,id,submitter,authors,title,comments,journal-ref,doi,report-no,categories,license,abstract,versions,update_date,authors_parsed,keywords
0,1407.7101,Md. Selim Al Mamun,"Md. Selim Al Mamun, Indrani Mandal, Md. Hasanuzzaman",Efficient Design of Reversible Sequential Circuit,IOSR Journal of Computer Engineering (IOSR-JCE) 5.6(2012),,10.9790/0661-0564247,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reversible logic has come to the forefront of theoretical and applied
research today. Although many researchers are investigating techniques to
synthesize reversible combinational logic, there is little work in the area of
sequential reversible logic. Latches and flip-flops are the most significant
memory elements for the forthcoming sequential memory elements. In this paper,
we proposed two new reversible logic gates MG-1 and MG-2. We then proposed new
design techniques for latches and flip-flops with the help of the new proposed
gates. The proposed designs are better than the existing ones in terms of
number of gates, garbage outputs and delay.
","[{'version': 'v1', 'created': 'Sat, 26 Jul 2014 07:05:33 GMT'}]",2014-07-29,"[['Mamun', 'Md. Selim Al', ''], ['Mandal', 'Indrani', ''], ['Hasanuzzaman', 'Md.', '']]","['Garbage Output', 'Latch', 'MG gate', 'Quantum Cost', 'Reversible Logic']"
1,1008.1659,EPTCS,"Ronny Polley (Uni Halle), Ludwig Staiger (Uni Halle)",The Maximal Subword Complexity of Quasiperiodic Infinite Words,"In Proceedings DCFS 2010, arXiv:1008.1270","EPTCS 31, 2010, pp. 169-176",10.4204/EPTCS.31.19,,cs.FL cs.DM cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide an exact estimate on the maximal subword complexity for
quasiperiodic infinite words. To this end we give a representation of the set
of finite and of infinite words having a certain quasiperiod q via a finite
language derived from q. It is shown that this language is a suffix code having
a bounded delay of decipherability. Our estimate of the subword complexity now
follows from this result, previously known results on the subword complexity
and elementary results on formal power series.
","[{'version': 'v1', 'created': 'Tue, 10 Aug 2010 08:33:59 GMT'}]",2010-08-11,"[['Polley', 'Ronny', '', 'Uni Halle'], ['Staiger', 'Ludwig', '', 'Uni Halle']]","['quasiperiodic words', 'codes', 'subword complexity', 'structure generating function']"
2,1203.4933,Kishorjit Nongmeikapam Mr.,"Kishorjit Nongmeikapam, Lairenlakpam Nonglenjaoba, Yumnam Nirmal and
  Sivaji Bandyopadhyay","Reduplicated MWE (RMWE) helps in improving the CRF based Manipuri POS
  Tagger","15 pages, 4 tables, 2 figures, the link
  http://airccse.org/journal/jcsit/1011csit05.pdf. arXiv admin note: text
  overlap with arXiv:1111.2399",,10.5121/ijitcs.2012.210,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper gives a detail overview about the modified features selection in
CRF (Conditional Random Field) based Manipuri POS (Part of Speech) tagging.
Selection of features is so important in CRF that the better are the features
then the better are the outputs. This work is an attempt or an experiment to
make the previous work more efficient. Multiple new features are tried to run
the CRF and again tried with the Reduplicated Multiword Expression (RMWE) as
another feature. The CRF run with RMWE because Manipuri is rich of RMWE and
identification of RMWE becomes one of the necessities to bring up the result of
POS tagging. The new CRF system shows a Recall of 78.22%, Precision of 73.15%
and F-measure of 75.60%. With the identification of RMWE and considering it as
a feature makes an improvement to a Recall of 80.20%, Precision of 74.31% and
F-measure of 77.14%.
","[{'version': 'v1', 'created': 'Thu, 22 Mar 2012 09:50:51 GMT'}]",2012-03-23,"[['Nongmeikapam', 'Kishorjit', ''], ['Nonglenjaoba', 'Lairenlakpam', ''], ['Nirmal', 'Yumnam', ''], ['Bandyopadhyay', 'Sivaji', '']]","['CRF', 'RMWE', 'POS', 'Features', 'Stemming', 'Root']"
3,1710.11200,Renato J Cintra,"N. Rajapaksha, A. Madanayake, R. J. Cintra, J. Adikari, V. S. Dimitrov",VLSI Computational Architectures for the Arithmetic Cosine Transform,"8 pages, 2 figures, 6 tables","IEEE Transactions on Computers, vol. 64, no. 9, Sep 2015",10.1109/TC.2014.2366732,,cs.AR cs.DS cs.MM math.NA stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The discrete cosine transform (DCT) is a widely-used and important signal
processing tool employed in a plethora of applications. Typical fast algorithms
for nearly-exact computation of DCT require floating point arithmetic, are
multiplier intensive, and accumulate round-off errors. Recently proposed fast
algorithm arithmetic cosine transform (ACT) calculates the DCT exactly using
only additions and integer constant multiplications, with very low area
complexity, for null mean input sequences. The ACT can also be computed
non-exactly for any input sequence, with low area complexity and low power
consumption, utilizing the novel architecture described. However, as a
trade-off, the ACT algorithm requires 10 non-uniformly sampled data points to
calculate the 8-point DCT. This requirement can easily be satisfied for
applications dealing with spatial signals such as image sensors and biomedical
sensor arrays, by placing sensor elements in a non-uniform grid. In this work,
a hardware architecture for the computation of the null mean ACT is proposed,
followed by a novel architectures that extend the ACT for non-null mean
signals. All circuits are physically implemented and tested using the Xilinx
XC6VLX240T FPGA device and synthesized for 45 nm TSMC standard-cell library for
performance assessment.
","[{'version': 'v1', 'created': 'Mon, 30 Oct 2017 19:06:19 GMT'}]",2017-11-01,"[['Rajapaksha', 'N.', ''], ['Madanayake', 'A.', ''], ['Cintra', 'R. J.', ''], ['Adikari', 'J.', ''], ['Dimitrov', 'V. S.', '']]","['Discrete cosine transform', 'Arithmetic cosine transform', 'fast algorithms', 'VLSI']"
4,0904.0352,Rami Puzis,"Shlomi Dolev, Yuval Elovici, Rami Puzis, Polina Zilberman","Incremental Deployment of Network Monitors Based on Group Betweenness
  Centrality",,"Information Processing Letters, 109(20), 1172-1176 (2009)",10.1016/j.ipl.2009.07.019,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many applications we are required to increase the deployment of a
distributed monitoring system on an evolving network. In this paper we present
a new method for finding candidate locations for additional deployment in the
network. This method is based on the Group Betweenness Centrality (GBC) measure
that is used to estimate the influence of a group of nodes over the information
flow in the network. The new method assists in finding the location of k
additional monitors in the evolving network, such that the portion of
additional traffic covered is at least (1-1/e) of the optimal.
","[{'version': 'v1', 'created': 'Thu, 2 Apr 2009 09:32:51 GMT'}, {'version': 'v2', 'created': 'Sun, 12 Jul 2009 10:01:36 GMT'}, {'version': 'v3', 'created': 'Fri, 2 Oct 2020 13:32:31 GMT'}]",2020-10-05,"[['Dolev', 'Shlomi', ''], ['Elovici', 'Yuval', ''], ['Puzis', 'Rami', ''], ['Zilberman', 'Polina', '']]","['Graph Algorithms', 'Distributed Systems', 'Interconnection Networks', 'Network']"
5,1001.0639,Arnaud Labourel,"Jurek Czyzowicz, David Ilcinkas (LaBRI, INRIA Bordeaux - Sud-Ouest),
  Arnaud Labourel (LaBRI), Andrzej Pelc",Optimal Exploration of Terrains with Obstacles,,,10.1007/978-3-642-13731-0_1,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A mobile robot represented by a point moving in the plane has to explore an
unknown terrain with obstacles. Both the terrain and the obstacles are modeled
as arbitrary polygons. We consider two scenarios: the unlimited vision, when
the robot situated at a point p of the terrain explores (sees) all points q of
the terrain for which the segment pq belongs to the terrain, and the limited
vision, when we require additionally that the distance between p and q be at
most 1. All points of the terrain (except obstacles) have to be explored and
the performance of an exploration algorithm is measured by the length of the
trajectory of the robot. For unlimited vision we show an exploration algorithm
with complexity O(P + D?k), where P is the total perimeter of the terrain
(including perimeters of obstacles), D is the diameter of the convex hull of
the terrain, and k is the number of obstacles. We do not assume knowledge of
these parameters. We also prove a matching lower bound showing that the above
complexity is optimal, even if the terrain is known to the robot. For limited
vision we show exploration algorithms with complexity O(P + A + ?Ak), where A
is the area of the terrain (excluding obstacles). Our algorithms work either
for arbitrary terrains, if one of the parameters A or k is known, or for c-fat
terrains, where c is any constant (unknown to the robot) and no additional
knowledge is assumed. (A terrain T with obstacles is c-fat if R/r ? c, where R
is the radius of the smallest disc containing T and r is the radius of the
largest disc contained in T .) We also prove a matching lower bound ?(P + A +
?Ak) on the complexity of exploration for limited vision, even if the terrain
is known to the robot.
","[{'version': 'v1', 'created': 'Tue, 5 Jan 2010 07:29:11 GMT'}]",2015-05-14,"[['Czyzowicz', 'Jurek', '', 'LaBRI, INRIA Bordeaux - Sud-Ouest'], ['Ilcinkas', 'David', '', 'LaBRI, INRIA Bordeaux - Sud-Ouest'], ['Labourel', 'Arnaud', '', 'LaBRI'], ['Pelc', 'Andrzej', '']]","['mobile robot', 'exploration', 'polygon', 'obstacle']"
6,1802.07489,Sylwia Polberg,"Anthony Hunter, Sylwia Polberg, Matthias Thimm","Epistemic Graphs for Representing and Reasoning with Positive and
  Negative Influences of Arguments",,,10.1016/j.artint.2020.103236,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces epistemic graphs as a generalization of the epistemic
approach to probabilistic argumentation. In these graphs, an argument can be
believed or disbelieved up to a given degree, thus providing a more
fine--grained alternative to the standard Dung's approaches when it comes to
determining the status of a given argument. Furthermore, the flexibility of the
epistemic approach allows us to both model the rationale behind the existing
semantics as well as completely deviate from them when required. Epistemic
graphs can model both attack and support as well as relations that are neither
support nor attack. The way other arguments influence a given argument is
expressed by the epistemic constraints that can restrict the belief we have in
an argument with a varying degree of specificity. The fact that we can specify
the rules under which arguments should be evaluated and we can include
constraints between unrelated arguments permits the framework to be more
context--sensitive. It also allows for better modelling of imperfect agents,
which can be important in multi--agent applications.
","[{'version': 'v1', 'created': 'Wed, 21 Feb 2018 10:05:49 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Jan 2020 11:45:14 GMT'}]",2020-01-15,"[['Hunter', 'Anthony', ''], ['Polberg', 'Sylwia', ''], ['Thimm', 'Matthias', '']]","['abstract argumentation', 'epistemic argumentation', 'bipolar argumentation']"
7,1612.08012,Arnaud Arindra Adiyoso Setio,"Arnaud Arindra Adiyoso Setio, Alberto Traverso, Thomas de Bel, Moira
  S.N. Berens, Cas van den Bogaard, Piergiorgio Cerello, Hao Chen, Qi Dou,
  Maria Evelina Fantacci, Bram Geurts, Robbert van der Gugten, Pheng Ann Heng,
  Bart Jansen, Michael M.J. de Kaste, Valentin Kotov, Jack Yu-Hung Lin, Jeroen
  T.M.C. Manders, Alexander S\'onora-Mengana, Juan Carlos Garc\'ia-Naranjo,
  Evgenia Papavasileiou, Mathias Prokop, Marco Saletta, Cornelia M
  Schaefer-Prokop, Ernst T. Scholten, Luuk Scholten, Miranda M. Snoeren,
  Ernesto Lopez Torres, Jef Vandemeulebroucke, Nicole Walasek, Guido C.A.
  Zuidhof, Bram van Ginneken, Colin Jacobs","Validation, comparison, and combination of algorithms for automatic
  detection of pulmonary nodules in computed tomography images: the LUNA16
  challenge",,,10.1016/j.media.2017.06.015,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic detection of pulmonary nodules in thoracic computed tomography (CT)
scans has been an active area of research for the last two decades. However,
there have only been few studies that provide a comparative performance
evaluation of different systems on a common database. We have therefore set up
the LUNA16 challenge, an objective evaluation framework for automatic nodule
detection algorithms using the largest publicly available reference database of
chest CT scans, the LIDC-IDRI data set. In LUNA16, participants develop their
algorithm and upload their predictions on 888 CT scans in one of the two
tracks: 1) the complete nodule detection track where a complete CAD system
should be developed, or 2) the false positive reduction track where a provided
set of nodule candidates should be classified. This paper describes the setup
of LUNA16 and presents the results of the challenge so far. Moreover, the
impact of combining individual systems on the detection performance was also
investigated. It was observed that the leading solutions employed convolutional
networks and used the provided set of nodule candidates. The combination of
these solutions achieved an excellent sensitivity of over 95% at fewer than 1.0
false positives per scan. This highlights the potential of combining algorithms
to improve the detection performance. Our observer study with four expert
readers has shown that the best system detects nodules that were missed by
expert readers who originally annotated the LIDC-IDRI data. We released this
set of additional nodules for further development of CAD systems.
","[{'version': 'v1', 'created': 'Fri, 23 Dec 2016 15:47:27 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Jan 2017 08:26:13 GMT'}, {'version': 'v3', 'created': 'Fri, 30 Jun 2017 07:56:47 GMT'}, {'version': 'v4', 'created': 'Sat, 15 Jul 2017 12:11:40 GMT'}]",2017-07-18,"[['Setio', 'Arnaud Arindra Adiyoso', ''], ['Traverso', 'Alberto', ''], ['de Bel', 'Thomas', ''], ['Berens', 'Moira S. N.', ''], ['Bogaard', 'Cas van den', ''], ['Cerello', 'Piergiorgio', ''], ['Chen', 'Hao', ''], ['Dou', 'Qi', ''], ['Fantacci', 'Maria Evelina', ''], ['Geurts', 'Bram', ''], ['van der Gugten', 'Robbert', ''], ['Heng', 'Pheng Ann', ''], ['Jansen', 'Bart', ''], ['de Kaste', 'Michael M. J.', ''], ['Kotov', 'Valentin', ''], ['Lin', 'Jack Yu-Hung', ''], ['Manders', 'Jeroen T. M. C.', ''], ['Sónora-Mengana', 'Alexander', ''], ['García-Naranjo', 'Juan Carlos', ''], ['Papavasileiou', 'Evgenia', ''], ['Prokop', 'Mathias', ''], ['Saletta', 'Marco', ''], ['Schaefer-Prokop', 'Cornelia M', ''], ['Scholten', 'Ernst T.', ''], ['Scholten', 'Luuk', ''], ['Snoeren', 'Miranda M.', ''], ['Torres', 'Ernesto Lopez', ''], ['Vandemeulebroucke', 'Jef', ''], ['Walasek', 'Nicole', ''], ['Zuidhof', 'Guido C. A.', ''], ['van Ginneken', 'Bram', ''], ['Jacobs', 'Colin', '']]","['pulmonary nodules', 'computed tomography', 'computer-aided detection', 'medical image challenges', 'deeplearning', 'convolutional networks']"
8,1610.00257,Maria Kulikova V.,Maria V. Kulikova,"Square-root algorithms for maximum correntropy estimation of linear
  discrete-time systems in presence of non-Gaussian noise","The paper is accepted for publication in Systems & Control Letters,
  2017","Systems & Control Letters, 108: 8-15, 2017",10.1016/j.sysconle.2017.07.016,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent developments in the realm of state estimation of stochastic dynamic
systems in the presence of non-Gaussian noise have induced a new methodology
called the maximum correntropy filtering. The filters designed under the
maximum correntropy criterion (MCC) utilize a similarity measure (or
correntropy) between two random variables as a cost function. They are shown to
improve the estimators' robustness against outliers or impulsive noises. In
this paper we explore the numerical stability of linear filtering technique
proposed recently under the MCC approach. The resulted estimator is called the
maximum correntropy criterion Kalman filter (MCC-KF). The purpose of this study
is two-fold. First, the previously derived MCC-KF equations are revise and the
related Kalman-like equality conditions are proved. Based on this theoretical
finding, we improve the MCC-KF technique in the sense that the new method
possesses a better estimation quality with the reduced computational cost
compared with the previously proposed MCC-KF variant. Second, we devise some
square-root implementations for the newly-designed improved estimator. The
square-root algorithms are well known to be inherently more stable than the
conventional Kalman-like implementations, which process the full error
covariance matrix in each iteration step of the filter. Additionally, following
the latest achievements in the KF community, all square-root algorithms are
formulated here in the so-called array form. All the MCC-KF variants developed
in this paper are demonstrated to outperform the previously proposed MCC-KF
version in two numerical examples.
","[{'version': 'v1', 'created': 'Sun, 2 Oct 2016 10:58:58 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Jan 2017 16:32:01 GMT'}, {'version': 'v3', 'created': 'Fri, 14 Apr 2017 11:46:14 GMT'}, {'version': 'v4', 'created': 'Tue, 5 Sep 2017 12:15:35 GMT'}]",2017-09-06,"[['Kulikova', 'Maria V.', '']]","['Maximum correntropy criterion', 'Kalman filter', 'square-root filtering', 'robust estimation']"
9,1208.6324,Ines Klimann,Ines Klimann (LIAFA),"The finiteness of a group generated by a 2-letter invertible-reversible
  Mealy automaton is decidable",,"30th International Symposium on Theoretical Aspects of Computer
  Science (STACS 2013), Kiel : Germany (2013)",10.4230/LIPIcs.STACS.2013.502,,cs.FL math.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove that a semigroup generated by a reversible two-state Mealy automaton
is either finite or free of rank 2. This fact leads to the decidability of
finiteness for groups generated by two-state or two-letter
invertible-reversible Mealy automata and to the decidability of freeness for
semigroups generated by two-state invertible-reversible Mealy automata.
","[{'version': 'v1', 'created': 'Thu, 30 Aug 2012 22:15:36 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Oct 2013 09:12:05 GMT'}]",2013-10-23,"[['Klimann', 'Ines', '', 'LIAFA']]","['Mealy automata', 'automaton semigroups', 'decidability of finiteness', 'decidability of freeness', 'Nerode equivalence']"
10,1304.5974,Kevin Xu,Kevin S. Xu and Alfred O. Hero III,"Dynamic stochastic blockmodels: Statistical models for time-evolving
  networks",,"Proceedings of the 6th International Conference on Social
  Computing, Behavioral-Cultural Modeling, and Prediction (2013) 201-210",10.1007/978-3-642-37210-0_22,,cs.SI cs.LG physics.soc-ph stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Significant efforts have gone into the development of statistical models for
analyzing data in the form of networks, such as social networks. Most existing
work has focused on modeling static networks, which represent either a single
time snapshot or an aggregate view over time. There has been recent interest in
statistical modeling of dynamic networks, which are observed at multiple points
in time and offer a richer representation of many complex phenomena. In this
paper, we propose a state-space model for dynamic networks that extends the
well-known stochastic blockmodel for static networks to the dynamic setting. We
then propose a procedure to fit the model using a modification of the extended
Kalman filter augmented with a local search. We apply the procedure to analyze
a dynamic social network of email communication.
","[{'version': 'v1', 'created': 'Mon, 22 Apr 2013 15:07:19 GMT'}]",2013-04-23,"[['Xu', 'Kevin S.', ''], ['Hero', 'Alfred O.', 'III']]","['dynamic network', 'stochastic blockmodel', 'state-space model']"
11,1701.05402,Mohammad Asif Mr.,"M. A. Habibi, M. Ulman, J. Van\v{e}k, J. Pavl\'ik","Measurement and Analysis of Quality of Service of Mobile Networks in
  Afghanistan End User Perspective",in AGRIS on-line Papers in Economics' and Informatics. December 2016,,10.7160/aol.2016.080407,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Enhanced Quality of Service (QoS) and satisfaction of mobile phone user are
major concerns of a service provider. In order to manage network efficiently
and to provide enhanced end to end Quality of Experience (QoE), operator is
expected to measure and analyze QoS from various perspectives and at different
relevant points of network. The scope of this paper is measurement and
statistically analysis of QoS of mobile networks from end user perspective in
Afghanistan. The study is based on primary data collected on random basis from
1,515 mobile phone users of five cellular operators. The paper furthermore
proposes adequate technical solutions to mobile operators in order to address
existing challenges in the area of QoS and to remain competitive in the market.
Based on the result of processed data, considering geographical locations,
population and telecom regulations of the government, authors recommend
deployment of small cells (SCs), increasing number of regular performance
tests, optimal placement of base stations, increasing number of carriers, and
high order sectorization as proposed technical solutions.
","[{'version': 'v1', 'created': 'Thu, 19 Jan 2017 13:12:36 GMT'}]",2017-01-20,"[['Habibi', 'M. A.', ''], ['Ulman', 'M.', ''], ['Vaněk', 'J.', ''], ['Pavlík', 'J.', '']]","['Quality of service', 'quality of experience', 'quality of service parameters', 'mobile network', 'end user', 'data measurement', 'statistical analysis', 'Afghanistan']"
12,1706.01406,Alessandro Aimar,"Alessandro Aimar, Hesham Mostafa, Enrico Calabrese, Antonio
  Rios-Navarro, Ricardo Tapiador-Morales, Iulia-Alexandra Lungu, Moritz B.
  Milde, Federico Corradi, Alejandro Linares-Barranco, Shih-Chii Liu, Tobi
  Delbruck","NullHop: A Flexible Convolutional Neural Network Accelerator Based on
  Sparse Representations of Feature Maps",,,10.1109/TNNLS.2018.2852335,,cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convolutional neural networks (CNNs) have become the dominant neural network
architecture for solving many state-of-the-art (SOA) visual processing tasks.
Even though Graphical Processing Units (GPUs) are most often used in training
and deploying CNNs, their power efficiency is less than 10 GOp/s/W for
single-frame runtime inference. We propose a flexible and efficient CNN
accelerator architecture called NullHop that implements SOA CNNs useful for
low-power and low-latency application scenarios. NullHop exploits the sparsity
of neuron activations in CNNs to accelerate the computation and reduce memory
requirements. The flexible architecture allows high utilization of available
computing resources across kernel sizes ranging from 1x1 to 7x7. NullHop can
process up to 128 input and 128 output feature maps per layer in a single pass.
We implemented the proposed architecture on a Xilinx Zynq FPGA platform and
present results showing how our implementation reduces external memory
transfers and compute time in five different CNNs ranging from small ones up to
the widely known large VGG16 and VGG19 CNNs. Post-synthesis simulations using
Mentor Modelsim in a 28nm process with a clock frequency of 500 MHz show that
the VGG19 network achieves over 450 GOp/s. By exploiting sparsity, NullHop
achieves an efficiency of 368%, maintains over 98% utilization of the MAC
units, and achieves a power efficiency of over 3TOp/s/W in a core area of
6.3mm$^2$. As further proof of NullHop's usability, we interfaced its FPGA
implementation with a neuromorphic event camera for real time interactive
demonstrations.
","[{'version': 'v1', 'created': 'Mon, 5 Jun 2017 16:20:24 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Mar 2018 10:05:33 GMT'}]",2020-10-27,"[['Aimar', 'Alessandro', ''], ['Mostafa', 'Hesham', ''], ['Calabrese', 'Enrico', ''], ['Rios-Navarro', 'Antonio', ''], ['Tapiador-Morales', 'Ricardo', ''], ['Lungu', 'Iulia-Alexandra', ''], ['Milde', 'Moritz B.', ''], ['Corradi', 'Federico', ''], ['Linares-Barranco', 'Alejandro', ''], ['Liu', 'Shih-Chii', ''], ['Delbruck', 'Tobi', '']]","['Convolutional Neural Networks', 'VLSI', 'FPGA', 'computer vision', 'artificial intelligence']"
13,1809.00711,Edith Zavala,"Edith Zavala, Xavier Franch, Jordi Marco",Adaptive Monitoring: A Systematic Mapping,"57 pages, 20 figures, 8 tables, Inf. Softw. Technol., Aug. 2018,
  pre-print, CC-BY-NC-ND 4.0 license,
  https://doi.org/10.1016/j.infsof.2018.08.013",,10.1016/j.infsof.2018.08.013,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Adaptive monitoring is a method used in a variety of domains for
responding to changing conditions. It has been applied in different ways, from
monitoring systems' customization to re-composition, in different application
domains. However, to the best of our knowledge, there are no studies analyzing
how adaptive monitoring differs or resembles among the existing approaches.
Method: We have conducted a systematic mapping study of adaptive monitoring
approaches following recommended practices. We have applied automatic search
and snowballing sampling on different sources and used rigorous selection
criteria to retrieve the final set of papers. Moreover, we have used an
existing qualitative analysis method for extracting relevant data from studies.
Finally, we have applied data mining techniques for identifying patterns in the
solutions. Conclusions: This cross-domain overview of the current state of the
art on adaptive monitoring may be a solid and comprehensive baseline for
researchers and practitioners in the field. Especially, it may help in
identifying opportunities of research, for instance, the need of proposing
generic and flexible software engineering solutions for supporting adaptive
monitoring in a variety of systems.
","[{'version': 'v1', 'created': 'Mon, 3 Sep 2018 20:19:31 GMT'}]",2018-09-05,"[['Zavala', 'Edith', ''], ['Franch', 'Xavier', ''], ['Marco', 'Jordi', '']]","['Adaptive Monitoring', 'Monitoring Reconfiguration', 'Monitor Customization', 'State of the Art', 'Systematic Mapping Study', 'Literature Review']"
14,1801.04971,Kathleen Gregory,"Kathleen Gregory, Helena Cousijn, Paul Groth, Andrea Scharnhorst,
  Sally Wyatt",Understanding Data Search as a Socio-technical Practice,"19 pages, 3 figures, 7 tables",Journal of Information Science. (2019). 0165551519837182,10.1177/0165551519837182,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Open research data are heralded as having the potential to increase
effectiveness, productivity, and reproducibility in science, but little is
known about the actual practices involved in data search. The socio-technical
problem of locating data for reuse is often reduced to the technological
dimension of designing data search systems. We combine a bibliometric study of
the current academic discourse around data search with interviews with data
seekers. In this article, we explore how adopting a contextual, socio-technical
perspective can help to understand user practices and behavior and ultimately
help to improve the design of data discovery systems.
","[{'version': 'v1', 'created': 'Mon, 15 Jan 2018 20:09:56 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Jan 2018 09:42:25 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Feb 2019 09:36:28 GMT'}]",2020-03-12,"[['Gregory', 'Kathleen', ''], ['Cousijn', 'Helena', ''], ['Groth', 'Paul', ''], ['Scharnhorst', 'Andrea', ''], ['Wyatt', 'Sally', '']]","['Data search', 'data reuse', 'data retrieval', 'information seeking', 'research data']"
15,2102.06740,Nicholas Baskerville,Nicholas P Baskerville and Diego Granziol and Jonathan P Keating,Appearance of Random Matrix Theory in Deep Learning,"33 pages, 14 figures",,10.1016/j.physa.2021.126742,,cs.LG math-ph math.MP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the local spectral statistics of the loss surface Hessians of
artificial neural networks, where we discover excellent agreement with Gaussian
Orthogonal Ensemble statistics across several network architectures and
datasets. These results shed new light on the applicability of Random Matrix
Theory to modelling neural networks and suggest a previously unrecognised role
for it in the study of loss surfaces in deep learning. Inspired by these
observations, we propose a novel model for the true loss surfaces of neural
networks, consistent with our observations, which allows for Hessian spectral
densities with rank degeneracy and outliers, extensively observed in practice,
and predicts a growing independence of loss gradients as a function of distance
in weight-space. We further investigate the importance of the true loss surface
in neural networks and find, in contrast to previous work, that the exponential
hardness of locating the global minimum has practical consequences for
achieving state of the art performance.
","[{'version': 'v1', 'created': 'Fri, 12 Feb 2021 19:49:19 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Nov 2021 12:32:05 GMT'}, {'version': 'v3', 'created': 'Fri, 24 Dec 2021 11:22:13 GMT'}]",2021-12-28,"[['Baskerville', 'Nicholas P', ''], ['Granziol', 'Diego', ''], ['Keating', 'Jonathan P', '']]","['random matrix theory', 'deep learning', 'machine learning', 'neuralnetworks', 'local statistics', 'Wigner surmise']"
16,1812.05961,Thomas Rolinger,"Thomas B. Rolinger, Tyler A. Simon, Christopher D. Krieger",Parallel Sparse Tensor Decomposition in Chapel,"2018 IEEE International Parallel and Distributed Processing Symposium
  Workshops (IPDPSW), 5th Annual Chapel Implementers and Users Workshop (CHIUW
  2018)",,10.1109/IPDPSW.2018.00143,,cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In big-data analytics, using tensor decomposition to extract patterns from
large, sparse multivariate data is a popular technique. Many challenges exist
for designing parallel, high performance tensor decomposition algorithms due to
irregular data accesses and the growing size of tensors that are processed.
There have been many efforts at implementing shared-memory algorithms for
tensor decomposition, most of which have focused on the traditional C/C++ with
OpenMP framework. However, Chapel is becoming an increasingly popular
programing language due to its expressiveness and simplicity for writing
scalable parallel programs. In this work, we port a state of the art C/OpenMP
parallel sparse tensor decomposition tool, SPLATT, to Chapel. We present a
performance study that investigates bottlenecks in our Chapel code and
discusses approaches for improving its performance. Also, we discuss features
in Chapel that would have been beneficial to our porting effort. We demonstrate
that our Chapel code is competitive with the C/OpenMP code for both runtime and
scalability, achieving 83%-96% performance of the original code and near linear
scalability up to 32 cores.
","[{'version': 'v1', 'created': 'Fri, 14 Dec 2018 14:39:26 GMT'}]",2018-12-17,"[['Rolinger', 'Thomas B.', ''], ['Simon', 'Tyler A.', ''], ['Krieger', 'Christopher D.', '']]","['Chapel', 'OpenMP', 'sparse', 'tensor decomposition', 'performance study']"
17,1002.2440,Bernhard von Stengel,"Christoph Ambuehl, Bernd Gaertner, Bernhard von Stengel",Optimal Lower Bounds for Projective List Update Algorithms,"Version 3 same as version 2, but date in LaTeX \today macro replaced
  by March 8, 2012","ACM Transactions on Algorithms (TALG) Volume 9, Issue 4, September
  2013, Article 31, 18 pages",10.1145/2500120,,cs.CC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The list update problem is a classical online problem, with an optimal
competitive ratio that is still open, known to be somewhere between 1.5 and
1.6. An algorithm with competitive ratio 1.6, the smallest known to date, is
COMB, a randomized combination of BIT and the TIMESTAMP algorithm TS. This and
almost all other list update algorithms, like MTF, are projective in the sense
that they can be defined by looking only at any pair of list items at a time.
Projectivity (also known as ""list factoring"") simplifies both the description
of the algorithm and its analysis, and so far seems to be the only way to
define a good online algorithm for lists of arbitrary length. In this paper we
characterize all projective list update algorithms and show that their
competitive ratio is never smaller than 1.6 in the partial cost model.
Therefore, COMB is a best possible projective algorithm in this model.
","[{'version': 'v1', 'created': 'Thu, 11 Feb 2010 21:48:07 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Mar 2012 08:21:54 GMT'}, {'version': 'v3', 'created': 'Thu, 8 Mar 2012 19:00:15 GMT'}]",2014-12-02,"[['Ambuehl', 'Christoph', ''], ['Gaertner', 'Bernd', ''], ['von Stengel', 'Bernhard', '']]","['linear lists', 'online algorithms', 'competitive analysis']"
18,1504.08213,Jean Louis Fendji Kedieng Ebongue,Jean Louis Ebongue Kedieng Fendji and Jean Michel Nlong,Rural Wireless Mesh Network: A Design Methodology,"9 pages, 2 figures, 3 tables","International Journal of Communications, Network and System
  Sciences, 8, 1-9",10.4236/ijcns.2015.81001,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless Mesh Network is presented as an appealing solution for bridging the
digital divide between developed and under-developed regions. But the planning
and deployment of these networks are not just a technical matter, since the
success depends on many other factors tied to the related region. Although we
observe some deployments, to ensure usefulness and sustainability, there is
still a need of concrete design process model and proper network planning
approach for rural regions, especially in Sub-Saharan Africa. This paper
presents a design methodology to provide network connectivity from a landline
node in a rural region at very low cost. We propose a methodology composed of
ten steps, starting by a deep analysis of the region in order to identify
relevant constraints and useful applications to sustain local activities and
communication. Approach for planning the physical architecture of the network
is based on an indoor-outdoor deployment for reducing the overall cost of the
network.
","[{'version': 'v1', 'created': 'Thu, 30 Apr 2015 13:20:50 GMT'}]",2015-05-01,"[['Fendji', 'Jean Louis Ebongue Kedieng', ''], ['Nlong', 'Jean Michel', '']]","['Design Methodology', 'Planning', 'Rural Regions', 'Wireless Mesh Network']"
19,1412.3639,Mostafa Zaman Chowdhury,"Mostafa Zaman Chowdhury, Yeong Min Jang, and Zygmunt J. Haas","Cost-Effective Frequency Planning for Capacity Enhancement of
  Femtocellular Networks",,"Wireless Personal Communications, vol. 60, no. 1, pp. 83-104,
  Sept. 2011",10.1007/s11277-011-0258-y,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Femtocellular networks will co-exist with macrocellular networks, mitigation
of the interference between these two network types is a key challenge for
successful integration of these two technologies. In particular, there are
several interference mechanisms between the femtocellular and the macrocellular
networks, and the effects of the resulting interference depend on the density
of femtocells and the overlaid macrocells in a particular coverage area. While
improper interference management can cause a significant reduction in the
system capacity and can increase the outage probability, effective and
efficient frequency allocation among femtocells and macrocells can result in a
successful co-existence of these two technologies. Furthermore, highly dense
femtocellular deployments the ultimate goal of the femtocellular technology
will require significant degree of self-organization in lieu of manual
configuration. In this paper, we present various femtocellular network
deployment scenarios, and we propose a number of frequency-allocation schemes
to mitigate the interference and to increases the spectral efficiency of the
integrated network. These schemes include: shared frequency band, dedicated
frequency band, sub-frequency band, static frequency-reuse, and dynamic
frequency-reuse.
","[{'version': 'v1', 'created': 'Thu, 11 Dec 2014 13:04:25 GMT'}]",2014-12-12,"[['Chowdhury', 'Mostafa Zaman', ''], ['Jang', 'Yeong Min', ''], ['Haas', 'Zygmunt J.', '']]","['Femtocell', 'Femtocellular Network', 'Overlay Networks', 'Interference']"
20,1003.5440,Secretary Aircc Journal,"K.Ayyappan (1) and R. Kumar (2) ((1) Rajiv Gandhi College of
  Engineering and Technology, India, (2) SRM University, India)",QoS Based Capacity Enhancement for WCDMA Network with Coding Scheme,"10 Pages, VLSICS Journal","International Journal Of VLSI Design & Communication Systems 1.1
  (2010) 10-19",10.5121/vlsic.2010.1102,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The wide-band code division multiple access (WCDMA) based 3G and beyond
cellular mobile wireless networks are expected to provide a diverse range of
multimedia services to mobile users with guaranteed quality of service (QoS).
To serve diverse quality of service requirements of these networks it
necessitates new radio resource management strategies for effective utilization
of network resources with coding schemes. Call admission control (CAC) is a
significant component in wireless networks to guarantee quality of service
requirements and also to enhance the network resilience. In this paper capacity
enhancement for WCDMA network with convolutional coding scheme is discussed and
compared with block code and without coding scheme to achieve a better balance
between resource utilization and quality of service provisioning. The model of
this network is valid for the real-time (RT) and non-real-time (NRT) services
having different data rate. Simulation results demonstrate the effectiveness of
the network using convolutional code in terms of capacity enhancement and QoS
of the voice and video services.
","[{'version': 'v1', 'created': 'Mon, 29 Mar 2010 07:07:31 GMT'}]",2010-07-15,"[['Ayyappan', 'K.', ''], ['Kumar', 'R.', '']]","['Call admission control', 'Wide band code division multiple access', 'Wireless networks', 'Quality of service']"
21,1709.01304,Stefan Wagner,Stefan Wagner and Florian Deissenboeck,"Abstractness, specificity, and complexity in software design","8 pages, 3 figures","Proceedings of the 2nd International Workshop on The Role of
  Abstraction in Software Engineering (ROA '08), pages 35-42, ACM, 2008",10.1145/1370164.1370173,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Abstraction is one of the fundamental concepts of software design.
Consequently, the determination of an appropriate abstraction level for the
multitude of artefacts that form a software system is an integral part of
software engineering. However, the very nature of abstraction in software
design and particularly its interrelation with equally important concepts like
complexity, specificity or genericity are not fully understood today. As a step
towards a better understanding of the trade-offs involved, this paper proposes
a distinction of abstraction into two types that have different effects on the
specificity and the complexity of artefacts. We discuss the roles of the two
types of abstraction in software design and explain the interrelations between
abstractness, specificity, and complexity. Furthermore, we illustrate the
benefit of the proposed distinction with multiple examples and describe
consequences of our findings for software design activities.
","[{'version': 'v1', 'created': 'Tue, 5 Sep 2017 09:38:06 GMT'}]",2017-09-06,"[['Wagner', 'Stefan', ''], ['Deissenboeck', 'Florian', '']]","['Abstractness', 'specificity', 'complexity', 'genericity']"
22,1807.00092,Ralf-Peter Mundani,"Ralf-Peter Mundani (1), J\'er\^ome Frisch (2), Vasco Varduhn (3), and
  Ernst Rank (1) ((1) Technische Universit\""at M\""unchen, Munich, Germany, (2)
  RWTH Aachen University, Aachen, Germany, (3) University of Minnesota,
  Minneapolis, MN, USA)","A sliding window technique for interactive high-performance computing
  scenarios","21 pages, 12 figures",Advances in Engineering Software 84 (2015) 21-30,10.1016/j.advengsoft.2015.02.003,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interactive high-performance computing is doubtlessly beneficial for many
computational science and engineering applications whenever simulation results
should be visually processed in real time, i.e. during the computation process.
Nevertheless, interactive HPC entails a lot of new challenges that have to be
solved - one of them addressing the fast and efficient data transfer between a
simulation back end and visualisation front end, as several gigabytes of data
per second are nothing unusual for a simulation running on some (hundred)
thousand cores. Here, a new approach based on a sliding window technique is
introduced that copes with any bandwidth limitations and allows users to study
both large and small scale effects of the simulation results in an interactive
fashion.
","[{'version': 'v1', 'created': 'Sat, 30 Jun 2018 00:17:52 GMT'}]",2018-07-03,"[['Mundani', 'Ralf-Peter', ''], ['Frisch', 'Jérôme', ''], ['Varduhn', 'Vasco', ''], ['Rank', 'Ernst', '']]","['interactive HPC', 'sliding window', 'computational fluid dynamics']"
23,1304.3876,Daowen Qiu,"Shenggen Zheng, Daowen Qiu, Jozef Gruska","Power of the interactive proof systems with verifiers modeled by
  semi-quantum two-way finite automata","26 pages, 5 figures, some references have been added, and comments
  are welcome",Information and Computation 241(2015) 197-214,10.1016/j.ic.2015.02.003,,cs.CC cs.CR quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we explore the power of AM for the case that verifiers are {\em
two-way finite automata with quantum and classical states} (2QCFA)--introduced
by Ambainis and Watrous in 2002--and the communications are classical. It is of
interest to consider AM with such ""semi-quantum"" verifiers because they use
only limited quantum resources. Our main result is that such Quantum
Arthur-Merlin proof systems (QAM(2QCFA)) with polynomial expected running time
are more powerful than in the case verifiers are two-way probabilistic finite
automata (AM(2PFA)) with polynomial expected running time. Moreover, we prove
that there is a language which can be recognized by an exponential expected
running time QAM(2QCFA), but can not be recognized by any AM(2PFA), and that
the NP-complete language $L_{knapsack}$ can also be recognized by a QAM(2QCFA)
working only on quantum pure states using unitary operators.
","[{'version': 'v1', 'created': 'Sun, 14 Apr 2013 04:59:44 GMT'}, {'version': 'v2', 'created': 'Tue, 7 May 2013 07:30:26 GMT'}, {'version': 'v3', 'created': 'Sat, 2 May 2015 15:55:26 GMT'}]",2015-05-05,"[['Zheng', 'Shenggen', ''], ['Qiu', 'Daowen', ''], ['Gruska', 'Jozef', '']]","['Quantum computing', 'quantum finite automata', 'quantum Arthur-Merlin proof systems', 'two-way finite automata with quantum', 'classical states']"
24,0802.2685,Maziar Nekovee,C. J. Rhodes and M. Nekovee,The Opportunistic Transmission of Wireless Worms between Mobile Devices,Submitted for publication,,10.1016/j.physa.2008.09.017,,cs.NI cond-mat.stat-mech cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ubiquity of portable wireless-enabled computing and communications
devices has stimulated the emergence of malicious codes (wireless worms) that
are capable of spreading between spatially proximal devices. The potential
exists for worms to be opportunistically transmitted between devices as they
move around, so human mobility patterns will have an impact on epidemic spread.
The scenario we address in this paper is proximity attacks from fleetingly
in-contact wireless devices with short-range communication range, such as
Bluetooth-enabled smart phones. An individual-based model of mobile devices is
introduced and the effect of population characteristics and device behaviour on
the outbreak dynamics is investigated. We show through extensive simulations
that in the above scenario the resulting mass-action epidemic models remain
applicable provided the contact rate is derived consistently from the
underlying mobility model. The model gives useful analytical expressions
against which more refined simulations of worm spread can be developed and
tested.
","[{'version': 'v1', 'created': 'Tue, 19 Feb 2008 17:07:32 GMT'}]",2009-11-13,"[['Rhodes', 'C. J.', ''], ['Nekovee', 'M.', '']]","['epidemic model; kinetic theory', 'mass action', 'mobile computing', 'wireless worms']"
25,1608.02755,Jordi Pont-Tuset,"Kevis-Kokitsi Maninis and Jordi Pont-Tuset and Pablo Arbel\'aez and
  Luc Van Gool",Convolutional Oriented Boundaries,ECCV 2016 Camera Ready,,10.1007/978-3-319-46448-0_35,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present Convolutional Oriented Boundaries (COB), which produces multiscale
oriented contours and region hierarchies starting from generic image
classification Convolutional Neural Networks (CNNs). COB is computationally
efficient, because it requires a single CNN forward pass for contour detection
and it uses a novel sparse boundary representation for hierarchical
segmentation; it gives a significant leap in performance over the
state-of-the-art, and it generalizes very well to unseen categories and
datasets. Particularly, we show that learning to estimate not only contour
strength but also orientation provides more accurate results. We perform
extensive experiments on BSDS, PASCAL Context, PASCAL Segmentation, and
MS-COCO, showing that COB provides state-of-the-art contours, region
hierarchies, and object proposals in all datasets.
","[{'version': 'v1', 'created': 'Tue, 9 Aug 2016 10:37:52 GMT'}]",2016-11-17,"[['Maninis', 'Kevis-Kokitsi', ''], ['Pont-Tuset', 'Jordi', ''], ['Arbeláez', 'Pablo', ''], ['Van Gool', 'Luc', '']]","['Contour detection', 'contour orientation estimation', 'hierarchical image segmentation', 'object proposals']"
26,1005.2405,Ozan Candogan,"Ozan Candogan, Ishai Menache, Asuman Ozdaglar, Pablo A. Parrilo",Flows and Decompositions of Games: Harmonic and Potential Games,,"Mathematics of Operations Research, Vol. 36, No. 3, pp. 474-503,
  2011",10.1287/moor.1110.0500,,cs.GT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we introduce a novel flow representation for finite games in
strategic form. This representation allows us to develop a canonical direct sum
decomposition of an arbitrary game into three components, which we refer to as
the potential, harmonic and nonstrategic components. We analyze natural classes
of games that are induced by this decomposition, and in particular, focus on
games with no harmonic component and games with no potential component. We show
that the first class corresponds to the well-known potential games. We refer to
the second class of games as harmonic games, and study the structural and
equilibrium properties of this new class of games. Intuitively, the potential
component of a game captures interactions that can equivalently be represented
as a common interest game, while the harmonic part represents the conflicts
between the interests of the players. We make this intuition precise, by
studying the properties of these two classes, and show that indeed they have
quite distinct and remarkable characteristics. For instance, while finite
potential games always have pure Nash equilibria, harmonic games generically
never do. Moreover, we show that the nonstrategic component does not affect the
equilibria of a game, but plays a fundamental role in their efficiency
properties, thus decoupling the location of equilibria and their payoff-related
properties. Exploiting the properties of the decomposition framework, we obtain
explicit expressions for the projections of games onto the subspaces of
potential and harmonic games. This enables an extension of the properties of
potential and harmonic games to ""nearby"" games. We exemplify this point by
showing that the set of approximate equilibria of an arbitrary game can be
characterized through the equilibria of its projection onto the set of
potential games.
","[{'version': 'v1', 'created': 'Thu, 13 May 2010 19:55:59 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Jun 2010 03:22:21 GMT'}]",2015-03-17,"[['Candogan', 'Ozan', ''], ['Menache', 'Ishai', ''], ['Ozdaglar', 'Asuman', ''], ['Parrilo', 'Pablo A.', '']]","['decomposition of games', 'potential games', 'harmonic games', 'strategic equivalence']"
27,1709.08526,\'Alvaro L\'opez Garc\'ia,"\'Alvaro L\'opez Garc\'ia, Enol Fern\'andez-del-Castillo, Pablo Orviz
  Fern\'andez, Isabel Campos Plasencia, Jes\'us Marco de Lucas",Resource provisioning in Science Clouds: Requirements and challenges,,Software: Practice and Experience. 2017;1-13,10.1002/spe.2544,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing has permeated into the information technology industry in the
last few years, and it is emerging nowadays in scientific environments. Science
user communities are demanding a broad range of computing power to satisfy the
needs of high-performance applications, such as local clusters,
high-performance computing systems, and computing grids. Different workloads
are needed from different computational models, and the cloud is already
considered as a promising paradigm. The scheduling and allocation of resources
is always a challenging matter in any form of computation and clouds are not an
exception. Science applications have unique features that differentiate their
workloads, hence, their requirements have to be taken into consideration to be
fulfilled when building a Science Cloud. This paper will discuss what are the
main scheduling and resource allocation challenges for any Infrastructure as a
Service provider supporting scientific applications.
","[{'version': 'v1', 'created': 'Mon, 25 Sep 2017 14:44:50 GMT'}]",2017-09-26,"[['García', 'Álvaro López', ''], ['Fernández-del-Castillo', 'Enol', ''], ['Fernández', 'Pablo Orviz', ''], ['Plasencia', 'Isabel Campos', ''], ['de Lucas', 'Jesús Marco', '']]","['Scientific Computing', 'Cloud Computing', 'Science Clouds', 'Cloud Challenges']"
28,1808.03965,Hongyang Gao,"Hongyang Gao, Zhengyang Wang, Shuiwang Ji",Large-Scale Learnable Graph Convolutional Networks,,"In Proceedings of the 24th ACM SIGKDD International Conference on
  Knowledge Discovery & Data Mining (pp. 1416-1424). ACM (2018)",10.1145/3219819.3219947,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convolutional neural networks (CNNs) have achieved great success on grid-like
data such as images, but face tremendous challenges in learning from more
generic data such as graphs. In CNNs, the trainable local filters enable the
automatic extraction of high-level features. The computation with filters
requires a fixed number of ordered units in the receptive fields. However, the
number of neighboring units is neither fixed nor are they ordered in generic
graphs, thereby hindering the applications of convolutional operations. Here,
we address these challenges by proposing the learnable graph convolutional
layer (LGCL). LGCL automatically selects a fixed number of neighboring nodes
for each feature based on value ranking in order to transform graph data into
grid-like structures in 1-D format, thereby enabling the use of regular
convolutional operations on generic graphs. To enable model training on
large-scale graphs, we propose a sub-graph training method to reduce the
excessive memory and computational resource requirements suffered by prior
methods on graph convolutions. Our experimental results on node classification
tasks in both transductive and inductive learning settings demonstrate that our
methods can achieve consistently better performance on the Cora, Citeseer,
Pubmed citation network, and protein-protein interaction network datasets. Our
results also indicate that the proposed methods using sub-graph training
strategy are more efficient as compared to prior approaches.
","[{'version': 'v1', 'created': 'Sun, 12 Aug 2018 16:22:12 GMT'}]",2018-09-05,"[['Gao', 'Hongyang', ''], ['Wang', 'Zhengyang', ''], ['Ji', 'Shuiwang', '']]","['Deep learning', 'graph convolutional networks', 'graph mining', 'largescale learning']"
29,1807.02192,David Paulius,David Paulius and Yu Sun,A Survey of Knowledge Representation in Service Robotics,"Accepted for RAS Special Issue on Semantic Policy and Action
  Representations for Autonomous Robots - 22 Pages",,10.1016/j.robot.2019.03.005,,cs.RO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Within the realm of service robotics, researchers have placed a great amount
of effort into learning, understanding, and representing motions as
manipulations for task execution by robots. The task of robot learning and
problem-solving is very broad, as it integrates a variety of tasks such as
object detection, activity recognition, task/motion planning, localization,
knowledge representation and retrieval, and the intertwining of
perception/vision and machine learning techniques. In this paper, we solely
focus on knowledge representations and notably how knowledge is typically
gathered, represented, and reproduced to solve problems as done by researchers
in the past decades. In accordance with the definition of knowledge
representations, we discuss the key distinction between such representations
and useful learning models that have extensively been introduced and studied in
recent years, such as machine learning, deep learning, probabilistic modelling,
and semantic graphical structures. Along with an overview of such tools, we
discuss the problems which have existed in robot learning and how they have
been built and used as solutions, technologies or developments (if any) which
have contributed to solving them. Finally, we discuss key principles that
should be considered when designing an effective knowledge representation.
","[{'version': 'v1', 'created': 'Thu, 5 Jul 2018 22:18:08 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Feb 2019 20:24:53 GMT'}, {'version': 'v3', 'created': 'Mon, 25 Mar 2019 00:39:17 GMT'}]",2019-05-02,"[['Paulius', 'David', ''], ['Sun', 'Yu', '']]","['Knowledge representation', 'Robot Learning', 'Domestic Robots', 'Task Planning', 'Service Robotics']"
30,1001.4341,Dariusz Dereniowski,Dariusz Dereniowski,Connected searching of weighted trees,,Theoretical Computer Science 412 (2011) 5700-5713,10.1016/j.tcs.2011.06.017,"Technical Report no 21/2009, Faculty of Electronics,
  Telecommunications and Informatics, Gdansk University of Technology",cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider the problem of connected edge searching of weighted
trees. It is shown that there exists a polynomial-time algorithm for finding
optimal connected search strategy for bounded degree trees with arbitrary
weights on the edges and vertices of the tree. The problem is NP-complete for
general node-weighted trees (the weight of each edge is 1).
","[{'version': 'v1', 'created': 'Mon, 25 Jan 2010 18:30:47 GMT'}]",2021-03-05,"[['Dereniowski', 'Dariusz', '']]","['connected searching', 'graph searching', 'search strategy']"
31,1311.6929,Jonathan Protzenko,Jonathan Protzenko,Illustrating the Mezzo programming language,,"1st French Singaporean Workshop on Formal Methods and Applications
  (FSFMA 2013)",10.4230/OASIcs.FSFMA.2013.68,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When programmers want to prove strong program invariants, they are usually
faced with a choice between using theorem provers and using traditional
programming languages. The former requires them to provide program proofs,
which, for many applications, is considered a heavy burden. The latter provides
less guarantees and the programmer usually has to write run-time assertions to
compensate for the lack of suitable invariants expressible in the type system.
  We introduce Mezzo, a programming language in the tradition of ML, in which
the usual concept of a type is replaced by a more precise notion of a
permission. Programs written in Mezzo usually enjoy stronger guarantees than
programs written in pure ML. However, because Mezzo is based on a type system,
the reasoning requires no user input. In this paper, we illustrate the key
concepts of Mezzo, highlighting the static guarantees our language provides.
","[{'version': 'v1', 'created': 'Wed, 27 Nov 2013 10:57:10 GMT'}]",2013-11-28,"[['Protzenko', 'Jonathan', '']]","['Type system', 'Language design', 'ML', 'Permissions']"
32,1608.07323,Sherry Ruan,"Sherry Ruan, Jacob O. Wobbrock, Kenny Liou, Andrew Ng, James Landay","Comparing Speech and Keyboard Text Entry for Short Messages in Two
  Languages on Touchscreen Phones",23 pages,"Journal Proceedings of the ACM on Interactive, Mobile, Wearable
  and Ubiquitous Technologies archive Volume 1 Issue 4, December 2017",10.1145/3161187,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the ubiquity of mobile touchscreen devices like smartphones, two widely
used text entry methods have emerged: small touch-based keyboards and speech
recognition. Although speech recognition has been available on desktop
computers for years, it has continued to improve at a rapid pace, and it is
currently unknown how today's modern speech recognizers compare to
state-of-the-art mobile touch keyboards, which also have improved considerably
since their inception. To discover both methods' ""upper-bound performance,"" we
evaluated them in English and Mandarin Chinese on an Apple iPhone 6 Plus in a
laboratory setting. Our experiment was carried out using Baidu's Deep Speech 2,
a deep learning-based speech recognition system, and the built-in Qwerty
(English) or Pinyin (Mandarin) Apple iOS keyboards. We found that with speech
recognition, the English input rate was 2.93 times faster (153 vs. 52 WPM), and
the Mandarin Chinese input rate was 2.87 times faster (123 vs. 43 WPM) than the
keyboard for short message transcription under laboratory conditions for both
methods. Furthermore, although speech made fewer errors during entry (5.30% vs.
11.22% corrected error rate), it left slightly more errors in the final
transcribed text (1.30% vs. 0.79% uncorrected error rate). Our results show
that comparatively, under ideal conditions for both methods, upper-bound speech
recognition performance has greatly improved compared to prior systems, and
might see greater uptake in the future, although further study is required to
quantify performance in non-laboratory settings for both methods.
","[{'version': 'v1', 'created': 'Thu, 25 Aug 2016 22:09:02 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Jan 2018 02:14:37 GMT'}]",2018-01-18,"[['Ruan', 'Sherry', ''], ['Wobbrock', 'Jacob O.', ''], ['Liou', 'Kenny', ''], ['Ng', 'Andrew', ''], ['Landay', 'James', '']]","['Mobile phones', 'smartphones', 'text input', 'text entry', 'speech recognition', 'touch keyboards']"
33,1512.06532,Mohamed Lamine Lamali,"Mohamed Lamine Lamali, H\'elia Pouyllau, Dominique Barth (PRISM)","Path computation in multi-layer multi-domain networks: A language
  theoretic approach","Journal on Computer Communications, 2013",,10.1016/j.comcom.2012.11.009,,cs.DS cs.FL cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-layer networks are networks in which several protocols may coexist at
different layers. The Pseudo-Wire architecture provides encapsulation and
de-capsulation functions of protocols over Packet-Switched Networks. In a
multi-domain context, computing a path to support end-to-end services requires
the consideration of encapsulation and decapsulation capabilities. It appears
that graph models are not expressive enough to tackle this problem. In this
paper, we propose a new model of heterogeneous networks using Automata Theory.
A network is modeled as a Push-Down Automaton (PDA) which is able to capture
the encapsulation and decapsulation capabilities, the PDA stack corresponding
to the stack of encapsulated protocols. We provide polynomial algorithms that
compute the shortest path either in hops or in the number of encapsulations and
decapsulations along the inter-domain path, the latter reducing manual
configurations and possible loops in the path.
","[{'version': 'v1', 'created': 'Mon, 21 Dec 2015 08:55:41 GMT'}]",2015-12-22,"[['Lamali', 'Mohamed Lamine', '', 'PRISM'], ['Pouyllau', 'Hélia', '', 'PRISM'], ['Barth', 'Dominique', '', 'PRISM']]","['Multi-layer networks', 'Pseudo-Wire', 'Push-Down Automata']"
34,1711.07786,Ale\v{s} Bizjak,"Nadia Creignou, Reinhard Pichler, Stefan Woltran",Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?,,"Logical Methods in Computer Science, Volume 14, Issue 4 (October
  31, 2018) lmcs:4941",10.23638/LMCS-14(4:10)2018,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  Many reasoning problems are based on the problem of satisfiability (SAT).
While SAT itself becomes easy when restricting the structure of the formulas in
a certain way, the situation is more opaque for more involved decision
problems. We consider here the CardMinSat problem which asks, given a
propositional formula $\phi$ and an atom $x$, whether $x$ is true in some
cardinality-minimal model of $\phi$. This problem is easy for the Horn
fragment, but, as we will show in this paper, remains $\Theta_2$-complete (and
thus $\mathrm{NP}$-hard) for the Krom fragment (which is given by formulas in
CNF where clauses have at most two literals). We will make use of this fact to
study the complexity of reasoning tasks in belief revision and logic-based
abduction and show that, while in some cases the restriction to Krom formulas
leads to a decrease of complexity, in others it does not. We thus also consider
the CardMinSat problem with respect to additional restrictions to Krom formulas
towards a better understanding of the tractability frontier of such problems.
","[{'version': 'v1', 'created': 'Tue, 21 Nov 2017 13:55:13 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Aug 2018 15:02:19 GMT'}, {'version': 'v3', 'created': 'Mon, 29 Oct 2018 09:32:17 GMT'}]",2018-11-27,"[['Creignou', 'Nadia', ''], ['Pichler', 'Reinhard', ''], ['Woltran', 'Stefan', '']]","['Complexity', 'Satisfiability', 'Belief Revision', 'Abduction', 'Krom Formulas']"
35,1308.3384,Mauro Femminella,Mauro Femminella and Gianluca Reali,Consistency Analysis of Sensor Data Distribution,"IEEE IWCMC 2013, Cagliari, Italy, June 2013",,10.1109/IWCMC.2013.6583768,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we analyze the probability of consistency of sensor data
distribution systems (SDDS), and determine suitable evaluation models. This
problem is typically difficult, since a reliable model taking into account all
parameters and processes which affect the system consistency is unavoidably
very complex. The simplest candidate approach consists of modeling the state
sojourn time, or holding time, as memoryless, and resorting to the well known
solutions of Markovian processes. Nevertheless, it may happen that this
approach does not fit with some working conditions. In particular, the correct
modeling of the SDDS dynamics requires the introduction of a number of
parameters, such as the packet transfer time or the packet loss probability,
the value of which may determine the suitability of unsuitability of the
Markovian model. Candidate alternative solutions include the Erlang phase-type
approximation of nearly constant state holding time and a more refined model to
account for overlapping events in semi-Markov processes.
","[{'version': 'v1', 'created': 'Thu, 15 Aug 2013 13:22:57 GMT'}]",2016-11-17,"[['Femminella', 'Mauro', ''], ['Reali', 'Gianluca', '']]","['information distribution systems', 'consistency', 'Markov processes', 'Semi-Markov processes', 'Erlang distribution']"
36,1811.01275,Andres Karjus,"Andres Karjus, Richard A. Blythe, Simon Kirby, Kenny Smith","Challenges in detecting evolutionary forces in language change using
  diachronic corpora",,"Glossa: a journal of general linguistics, 5(1) (2020), p.45",10.5334/gjgl.909,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Newberry et al. (Detecting evolutionary forces in language change, Nature
551, 2017) tackle an important but difficult problem in linguistics, the
testing of selective theories of language change against a null model of drift.
Having applied a test from population genetics (the Frequency Increment Test)
to a number of relevant examples, they suggest stochasticity has a previously
under-appreciated role in language evolution. We replicate their results and
find that while the overall observation holds, results produced by this
approach on individual time series can be sensitive to how the corpus is
organized into temporal segments (binning). Furthermore, we use a large set of
simulations in conjunction with binning to systematically explore the range of
applicability of the Frequency Increment Test. We conclude that care should be
exercised with interpreting results of tests like the Frequency Increment Test
on individual series, given the researcher degrees of freedom available when
applying the test to corpus data, and fundamental differences between genetic
and linguistic data. Our findings have implications for selection testing and
temporal binning in general, as well as demonstrating the usefulness of
simulations for evaluating methods newly introduced to the field.
","[{'version': 'v1', 'created': 'Sat, 3 Nov 2018 20:02:17 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Nov 2019 13:23:09 GMT'}]",2020-05-08,"[['Karjus', 'Andres', ''], ['Blythe', 'Richard A.', ''], ['Kirby', 'Simon', ''], ['Smith', 'Kenny', '']]","['language evolution', 'language change', 'selection', 'drift', 'corpus-based', 'temporalbinning']"
37,0903.0153,Ralph Kretschmer,"Patricio Galeas (1), Ralph Kretschmer (2), Bernd Freisleben (1) ((1)
  University of Marburg, Germany, (2) Kretschmer Software, Siegen, Germany)","Document Relevance Evaluation via Term Distribution Analysis Using
  Fourier Series Expansion","9 pages, submitted to proceedings of JCDL-2009","Proceedings of the 2009 Joint international Conference on Digital
  Libraries (Austin, TX, USA, June 15 - 19, 2009). JCDL '09. ACM, New York, NY,
  277-284",10.1145/1555400.1555446,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In addition to the frequency of terms in a document collection, the
distribution of terms plays an important role in determining the relevance of
documents for a given search query. In this paper, term distribution analysis
using Fourier series expansion as a novel approach for calculating an abstract
representation of term positions in a document corpus is introduced. Based on
this approach, two methods for improving the evaluation of document relevance
are proposed: (a) a function-based ranking optimization representing a user
defined document region, and (b) a query expansion technique based on
overlapping the term distributions in the top-ranked documents. Experimental
results demonstrate the effectiveness of the proposed approach in providing new
possibilities for optimizing the retrieval process.
","[{'version': 'v1', 'created': 'Sun, 1 Mar 2009 17:08:17 GMT'}]",2009-07-18,"[['Galeas', 'Patricio', ''], ['Kretschmer', 'Ralph', ''], ['Freisleben', 'Bernd', '']]","['Ranked retrieval', 'Fourier series', 'content representation andindexing', 'term distribution', 'query expansion']"
38,1702.01636,Enzo Ferrante,Enzo Ferrante and Nikos Paragios,Slice-to-volume medical image registration: a survey,Accepted for publication in Medical Image Analysis,,10.1016/j.media.2017.04.010,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During the last decades, the research community of medical imaging has
witnessed continuous advances in image registration methods, which pushed the
limits of the state-of-the-art and enabled the development of novel medical
procedures. A particular type of image registration problem, known as
slice-to-volume registration, played a fundamental role in areas like image
guided surgeries and volumetric image reconstruction. However, to date, and
despite the extensive literature available on this topic, no survey has been
written to discuss this challenging problem. This paper introduces the first
comprehensive survey of the literature about slice-to-volume registration,
presenting a categorical study of the algorithms according to an ad-hoc
taxonomy and analyzing advantages and disadvantages of every category. We draw
some general conclusions from this analysis and present our perspectives on the
future of the field.
","[{'version': 'v1', 'created': 'Mon, 6 Feb 2017 14:51:29 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Apr 2017 14:49:15 GMT'}]",2017-05-02,"[['Ferrante', 'Enzo', ''], ['Paragios', 'Nikos', '']]","['Bibliographical review', 'slice-to-volume registration', 'medical image registration', 'medical image analysis']"
39,1407.6470,Gabriele D'Angelo,"Gabriele D'Angelo, Moreno Marzolla","New Trends in Parallel and Distributed Simulation: from Many-Cores to
  Cloud Computing","Simulation Modelling Practice and Theory (SIMPAT), Elsevier, vol. 49
  (December 2014)",,10.1016/j.simpat.2014.06.007,,cs.DC cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advances in computing architectures and networking are bringing
parallel computing systems to the masses so increasing the number of potential
users of these kinds of systems. In particular, two important technological
evolutions are happening at the ends of the computing spectrum: at the ""small""
scale, processors now include an increasing number of independent execution
units (cores), at the point that a mere CPU can be considered a parallel
shared-memory computer; at the ""large"" scale, the Cloud Computing paradigm
allows applications to scale by offering resources from a large pool on a
pay-as-you-go model. Multi-core processors and Clouds both require applications
to be suitably modified to take advantage of the features they provide. In this
paper, we analyze the state of the art of parallel and distributed simulation
techniques, and assess their applicability to multi-core architectures or
Clouds. It turns out that most of the current approaches exhibit limitations in
terms of usability and adaptivity which may hinder their application to these
new computing architectures. We propose an adaptive simulation mechanism, based
on the multi-agent system paradigm, to partially address some of those
limitations. While it is unlikely that a single approach will work well on both
settings above, we argue that the proposed adaptive mechanism has useful
features which make it attractive both in a multi-core processor and in a Cloud
system. These features include the ability to reduce communication costs by
migrating simulation components, and the support for adding (or removing) nodes
to the execution architecture at runtime. We will also show that, with the help
of an additional support layer, parallel and distributed simulations can be
executed on top of unreliable resources.
","[{'version': 'v1', 'created': 'Thu, 24 Jul 2014 07:05:38 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Apr 2017 14:12:19 GMT'}]",2017-04-05,"[[""D'Angelo"", 'Gabriele', ''], ['Marzolla', 'Moreno', '']]","['Simulation', 'Parallel and Distributed Simulation', 'Cloud Computing', 'Adaptive Systems', 'Middleware', 'Agent-Based Simulation']"
40,1109.0090,Arup Pal,Arup Kumar Pal and Anup Sar,An Efficient Codebook Initialization Approach for LBG Algorithm,,,10.5121/ijcsea.2011.1407,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In VQ based image compression technique has three major steps namely (i)
Codebook Design, (ii) VQ Encoding Process and (iii) VQ Decoding Process. The
performance of VQ based image compression technique depends upon the
constructed codebook. A widely used technique for VQ codebook design is the
Linde-Buzo-Gray (LBG) algorithm. However the performance of the standard LBG
algorithm is highly dependent on the choice of the initial codebook. In this
paper, we have proposed a simple and very effective approach for codebook
initialization for LBG algorithm. The simulation results show that the proposed
scheme is computationally efficient and gives expected performance as compared
to the standard LBG algorithm.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2011 04:47:08 GMT'}]",2011-09-02,"[['Pal', 'Arup Kumar', ''], ['Sar', 'Anup', '']]","['Codebook Generation', 'Image Compression', 'Image Pyramid', 'LBG algorithm', 'Vector Quantization (VQ)']"
41,1507.02084,Iago Landesa-V\'azquez,"Iago Landesa-V\'azquez, Jos\'e Luis Alba-Castro",Shedding Light on the Asymmetric Learning Capability of AdaBoost,,Pattern Recognition Letters 33 (2012) 247-255,10.1016/j.patrec.2011.10.022,,cs.LG cs.AI cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a different insight to analyze AdaBoost. This
analysis reveals that, beyond some preconceptions, AdaBoost can be directly
used as an asymmetric learning algorithm, preserving all its theoretical
properties. A novel class-conditional description of AdaBoost, which models the
actual asymmetric behavior of the algorithm, is presented.
","[{'version': 'v1', 'created': 'Wed, 8 Jul 2015 09:58:06 GMT'}]",2015-07-15,"[['Landesa-Vázquez', 'Iago', ''], ['Alba-Castro', 'José Luis', '']]","['AdaBoost', 'Asymmetry', 'Boosting', 'Classification', 'Cost']"
42,1403.2043,Ruhi Gupta,Ruhi Gupta,"Implementation of an efficient RBAC in Cloud Computing using .NET
  environment","6 pages, 5 figures, 1 flowchart, published By International Journal
  of Computer Trends and Technology(IJCTT)","Ruhi Gupta. ""Implementation of an Efficient RBAC Technique of
  Cloud Computing In .NET Environment in
  (IJCTT)V8(3):120125,February2014.ISSN:22312803.www.ijcttjournal.org.Published
  by Seventh Sense Research Group",10.14445/22312803/IJCTT-V8P122,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud Computing is flourishing day by day and it will continue in developing
phase until computers and internet era is in existence. While dealing with
cloud computing, a number of security and traffic related issues are
confronted. Load Balancing is one of the answers to these issues. RBAC deals
with such an answer. The proposed technique involves the hybrid of FCFS with
RBAC technique. RBAC will assign roles to the clients and clients with a
particular role can only access the particular document. Hence identity
management and access management are fully implemented using this technique.
","[{'version': 'v1', 'created': 'Sun, 9 Mar 2014 09:59:32 GMT'}]",2014-03-11,"[['Gupta', 'Ruhi', '']]","['ABAC', 'Cloud Computing', 'IBAC', 'FCFS', 'RBAC']"
43,1406.0306,Juergen Zechner,"Benjamin Marussig and J\""urgen Zechner and Gernot Beer and
  Thomas-Peter Fries","Fast Isogeometric Boundary Element Method based on Independent Field
  Approximation","32 pages, 27 figures","Computer Methods in Applied Mechanics and Engineering, Volume 284,
  2015, Pages 458-488",10.1016/j.cma.2014.09.035,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An isogeometric boundary element method for problems in elasticity is
presented, which is based on an independent approximation for the geometry,
traction and displacement field. This enables a flexible choice of refinement
strategies, permits an efficient evaluation of geometry related information, a
mixed collocation scheme which deals with discontinuous tractions along
non-smooth boundaries and a significant reduction of the right hand side of the
system of equations for common boundary conditions. All these benefits are
achieved without any loss of accuracy compared to conventional isogeometric
formulations. The system matrices are approximated by means of hierarchical
matrices to reduce the computational complexity for large scale analysis. For
the required geometrical bisection of the domain, a strategy for the evaluation
of bounding boxes containing the supports of NURBS basis functions is
presented. The versatility and accuracy of the proposed methodology is
demonstrated by convergence studies showing optimal rates and real world
examples in two and three dimensions.
","[{'version': 'v1', 'created': 'Mon, 2 Jun 2014 09:33:19 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Sep 2014 14:19:44 GMT'}, {'version': 'v3', 'created': 'Tue, 3 Feb 2015 08:28:44 GMT'}]",2015-02-04,"[['Marussig', 'Benjamin', ''], ['Zechner', 'Jürgen', ''], ['Beer', 'Gernot', ''], ['Fries', 'Thomas-Peter', '']]","['Subparametric Formulation', 'Isogeometric Analysis', 'Hierarchical Matrices', 'Elasticity', 'NURBS', 'Convergence']"
44,1901.06880,Anne-Elisabeth Falq,"Anne-Elisabeth Falq, Pierre Fouilhoux, Safia Kedad-Sidhoum","Mixed integer formulations using natural variables for single machine
  scheduling around a common due date","32 pages, 10 figures",Discrete Applied Mathematics 290 (2021) 36-59,10.1016/j.dam.2020.08.033,,cs.DS cs.DM,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  While almost all existing works which optimally solve just-in-time scheduling
problems propose dedicated algorithmic approaches, we propose in this work
mixed integer formulations. We consider a single machine scheduling problem
that aims at minimizing the weighted sum of earliness tardiness penalties
around a common due-date. Using natural variables, we provide one compact
formulation for the unrestrictive case and, for the general case, a non-compact
formulation based on non-overlapping inequalities. We show that the separation
problem related to the latter formulation is solved polynomially. In this
formulation, solutions are only encoded by extreme points. We establish a
theoretical framework to show the validity of such a formulation using
non-overlapping inequalities, which could be used for other scheduling
problems. A Branch-and-Cut algorithm together with an experimental analysis are
proposed to assess the practical relevance of this mixed integer programming
based methods.
","[{'version': 'v1', 'created': 'Mon, 21 Jan 2019 11:17:10 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Feb 2021 16:11:14 GMT'}]",2021-02-15,"[['Falq', 'Anne-Elisabeth', ''], ['Fouilhoux', 'Pierre', ''], ['Kedad-Sidhoum', 'Safia', '']]","['Just-in-time scheduling', 'Mixed integer programming formulation', 'polyhedral approaches']"
45,1407.1540,Philipp Mayr,"Dagmar Kern, Peter Mutschke, Philipp Mayr","Establishing an Online Access Panel for Interactive Information
  Retrieval Research","2 pages, 1 figure, 2014 IEEE/ACM Joint Conference on Digital
  Libraries (JCDL), London, 8th-12th September 2014",,10.1109/JCDL.2014.6970231,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an online access panel to support the evaluation process of
Interactive Information Retrieval (IIR) systems - called IIRpanel. By
maintaining an online access panel with users of IIR systems we assume that the
recurring effort to recruit participants for web-based as well as for lab
studies can be minimized. We target on using the online access panel not only
for our own development processes but to open it for other interested
researchers in the field of IIR. In this paper we present the concept of
IIRpanel as well as first implementation details.
","[{'version': 'v1', 'created': 'Sun, 6 Jul 2014 20:20:13 GMT'}]",2016-11-18,"[['Kern', 'Dagmar', ''], ['Mutschke', 'Peter', ''], ['Mayr', 'Philipp', '']]","['Online access panel', 'interactive information retrieval', 'retrieval evaluation', 'participant recruiting support', 'user interface development', 'online research']"
46,1807.06443,Filip Zagorski,"Karol Gotfryd, Pawel Lorek, Filip Zagorski",RiffleScrambler - a memory-hard password storing function,Accepted to ESORICS 2018,,10.1007/978-3-319-98989-1_16,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce RiffleScrambler: a new family of directed acyclic graphs and a
corresponding data-independent memory hard function with password independent
memory access. We prove its memory hardness in the random oracle model.
  RiffleScrambler is similar to Catena -- updates of hashes are determined by a
graph (bit-reversal or double-butterfly graph in Catena). The advantage of the
RiffleScrambler over Catena is that the underlying graphs are not predefined
but are generated per salt, as in Balloon Hashing. Such an approach leads to
higher immunity against practical parallel attacks. RiffleScrambler offers
better efficiency than Balloon Hashing since the in-degree of the underlying
graph is equal to 3 (and is much smaller than in Ballon Hashing). At the same
time, because the underlying graph is an instance of a Superconcentrator, our
construction achieves the same time-memory trade-offs.
","[{'version': 'v1', 'created': 'Tue, 17 Jul 2018 14:02:55 GMT'}]",2020-08-10,"[['Gotfryd', 'Karol', ''], ['Lorek', 'Pawel', ''], ['Zagorski', 'Filip', '']]","['Memory hardness', 'password storing', 'key derivation function', 'Markov chains', 'mixing time', 'Thorp shuffle']"
47,1610.08436,Alexandre de Siqueira,"Alexandre Fioravante de Siqueira, Fl\'avio Camargo Cabrera, Aylton
  Pagamisse, Aldo Eloizo Job","Estimating the concentration of gold nanoparticles incorporated on
  Natural Rubber membranes using Multi-Level Starlet Optimal Segmentation","22 pages, 8 figures",J Nanopart Res (2014) 16: 2809,10.1007/s11051-014-2809-0,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study consolidates Multi-Level Starlet Segmentation (MLSS) and
Multi-Level Starlet Optimal Segmentation (MLSOS), techniques for
photomicrograph segmentation that use starlet wavelet detail levels to separate
areas of interest in an input image. Several segmentation levels can be
obtained using Multi-Level Starlet Segmentation; after that, Matthews
correlation coefficient (MCC) is used to choose an optimal segmentation level,
giving rise to Multi-Level Starlet Optimal Segmentation. In this paper, MLSOS
is employed to estimate the concentration of gold nanoparticles with diameter
around 47 nm, reducted on natural rubber membranes. These samples were used on
the construction of SERS/SERRS substrates and in the study of natural rubber
membranes with incorporated gold nanoparticles influence on Leishmania
braziliensis physiology. Precision, recall and accuracy are used to evaluate
the segmentation performance, and MLSOS presents accuracy greater than 88% for
this application.
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2016 17:49:49 GMT'}]",2017-06-14,"[['de Siqueira', 'Alexandre Fioravante', ''], ['Cabrera', 'Flávio Camargo', ''], ['Pagamisse', 'Aylton', ''], ['Job', 'Aldo Eloizo', '']]","['Computational Vision', 'Gold Nanoparticles', 'Image Processing', 'Multi-Level Starlet Segmentation', 'Natural Rubber', 'ScanningElectron Microscopy', 'Wavelets']"
48,1705.06575,Kazem Cheshmi,"Kazem Cheshmi, Shoaib Kamil, Michelle Mills Strout, Maryam Mehri
  Dehnavi","Sympiler: Transforming Sparse Matrix Codes by Decoupling Symbolic
  Analysis",12 pages,"in SC 2017, Proceedings of the International Conference for High
  Performance Computing, Networking, Storage and Analysis",10.1145/3126908.3126936,,cs.PL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Sympiler is a domain-specific code generator that optimizes sparse matrix
computations by decoupling the symbolic analysis phase from the numerical
manipulation stage in sparse codes. The computation patterns in sparse
numerical methods are guided by the input sparsity structure and the sparse
algorithm itself. In many real-world simulations, the sparsity pattern changes
little or not at all. Sympiler takes advantage of these properties to
symbolically analyze sparse codes at compile-time and to apply inspector-guided
transformations that enable applying low-level transformations to sparse codes.
As a result, the Sympiler-generated code outperforms highly-optimized matrix
factorization codes from commonly-used specialized libraries, obtaining average
speedups over Eigen and CHOLMOD of 3.8X and 1.5X respectively.
","[{'version': 'v1', 'created': 'Thu, 18 May 2017 13:16:14 GMT'}]",2018-01-08,"[['Cheshmi', 'Kazem', ''], ['Kamil', 'Shoaib', ''], ['Strout', 'Michelle Mills', ''], ['Dehnavi', 'Maryam Mehri', '']]","['Matrix computations', 'sparse methods', 'loop transformations', 'domainspecifc compilation']"
49,2003.00644,Jonni Virtema,"Miika Hannula, Juha Kontinen, Jan Van den Bussche and Jonni Virtema","Descriptive complexity of real computation and probabilistic
  independence logic",,"Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in
  Computer Science (LICS), 2020. Association for Computing Machinery, New York,
  NY, USA, 550-563",10.1145/3373718.3394773,,cs.LO cs.CC math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a novel variant of BSS machines called Separate Branching BSS
machines (S-BSS in short) and develop a Fagin-type logical characterisation for
languages decidable in non-deterministic polynomial time by S-BSS machines. We
show that NP on S-BSS machines is strictly included in NP on BSS machines and
that every NP language on S-BSS machines is a countable union of closed sets in
the usual topology of R^n. Moreover, we establish that on Boolean inputs NP on
S-BSS machines without real constants characterises a natural fragment of the
complexity class existsR (a class of problems polynomial time reducible to the
true existential theory of the reals) and hence lies between NP and PSPACE.
Finally we apply our results to determine the data complexity of probabilistic
independence logic.
","[{'version': 'v1', 'created': 'Mon, 2 Mar 2020 03:56:38 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Jul 2020 03:56:36 GMT'}]",2020-07-09,"[['Hannula', 'Miika', ''], ['Kontinen', 'Juha', ''], ['Bussche', 'Jan Van den', ''], ['Virtema', 'Jonni', '']]","['Blum-Shub-Smale machines', 'descriptive complexity', 'team semantics', 'independence logic', 'real arithmetic']"
50,1808.08208,Nitish Nag,"Vaibhav Pandey, Nitish Nag, Ramesh Jain",Ubiquitous Event Mining to Enhance Personal Health,"Accepted to UBICOMP 2018, International Workshop on Integrating
  Physical Activity and Health Aspects in Everyday Mobility. UbiComp / ISWC'18
  Adjunct, October 8-12, 2018, Singapore, Singapore",,10.1145/3267305.3267684,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advances in user interfaces, pattern recognition, and ubiquitous computing
continue to pave the way for better navigation towards our health goals.
Quantitative methods which can guide us towards our personal health goals will
help us optimize our daily life actions, and environmental exposures.
Ubiquitous computing is essential for monitoring these factors and actuating
timely interventions in all relevant circumstances. We need to combine the
events recognized by different ubiquitous systems and derive actionable causal
relationships from an event ledger. Understanding of user habits and health
should be teleported between applications rather than these systems working in
silos, allowing systems to find the optimal guidance medium for required
interventions. We propose a method through which applications and devices can
enhance the user experience by leveraging event relationships, leading the way
to more relevant, useful, and, most importantly, pleasurable health guidance
experience.
","[{'version': 'v1', 'created': 'Fri, 24 Aug 2018 16:55:10 GMT'}]",2018-08-27,"[['Pandey', 'Vaibhav', ''], ['Nag', 'Nitish', ''], ['Jain', 'Ramesh', '']]","['Event Mining', 'Pattern Recognition', 'Personal Health Navigation', 'User Interface']"
51,1008.1661,EPTCS,"Yo-Sub Han, Kai Salomaa",Nondeterministic State Complexity for Suffix-Free Regular Languages,"In Proceedings DCFS 2010, arXiv:1008.1270","EPTCS 31, 2010, pp. 189-196",10.4204/EPTCS.31.21,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the nondeterministic state complexity of basic operations for
suffix-free regular languages. The nondeterministic state complexity of an
operation is the number of states that are necessary and sufficient in the
worst-case for a minimal nondeterministic finite-state automaton that accepts
the language obtained from the operation. We consider basic operations
(catenation, union, intersection, Kleene star, reversal and complementation)
and establish matching upper and lower bounds for each operation. In the case
of complementation the upper and lower bounds differ by an additive constant of
two.
","[{'version': 'v1', 'created': 'Tue, 10 Aug 2010 08:34:08 GMT'}]",2010-08-11,"[['Han', 'Yo-Sub', ''], ['Salomaa', 'Kai', '']]","['nondeterministic state complexity', 'suffix-free regular languages', 'suffix codes']"
52,1611.07769,Michael Schaub,"Michael T. Schaub and Jean-Charles Delvenne and Martin Rosvall and
  Renaud Lambiotte",The many facets of community detection in complex networks,"8 Pages, 1 Figure","Schaub, M.T., Delvenne, JC., Rosvall, M. et al. Appl Netw Sci
  (2017) 2: 4",10.1007/s41109-017-0023-6,,cs.SI physics.data-an physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Community detection, the decomposition of a graph into essential building
blocks, has been a core research topic in network science over the past years.
Since a precise notion of what constitutes a community has remained evasive,
community detection algorithms have often been compared on benchmark graphs
with a particular form of assortative community structure and classified based
on the mathematical techniques they employ. However, this comparison can be
misleading because apparent similarities in their mathematical machinery can
disguise different goals and reasons for why we want to employ community
detection in the first place. Here we provide a focused review of these
different motivations that underpin community detection. This problem-driven
classification is useful in applied network science, where it is important to
select an appropriate algorithm for the given purpose. Moreover, highlighting
the different facets of community detection also delineates the many lines of
research and points out open directions and avenues for future research.
","[{'version': 'v1', 'created': 'Wed, 23 Nov 2016 12:39:52 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Jan 2017 23:54:00 GMT'}, {'version': 'v3', 'created': 'Wed, 15 Feb 2017 19:40:18 GMT'}]",2017-02-17,"[['Schaub', 'Michael T.', ''], ['Delvenne', 'Jean-Charles', ''], ['Rosvall', 'Martin', ''], ['Lambiotte', 'Renaud', '']]","['community detection', 'graph partitioning', 'Modularity; block models']"
53,1408.3231,Bernhard Rumpe,"Delf Block, S\""onke Heeren, Stefan K\""uhnel, Andr\'e Leschke, Bernhard
  Rumpe, Vladislavs Serebro","Simulations on Consumer Tests: A Perspective for Driver Assistance
  Systems","6 pages, 5 figure, Proceedings of International Workshop on
  Engineering Simulations for Cyber-Physical Systems (ES4CPS '14)",,10.1145/2559627.2559633,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article discusses new challenges for series development regarding the
vehicle safety that arise from the recently published AEB test protocol by the
consumer-test-organisation EuroNCAP for driver assistance systems [6]. The
tests from the test protocol are of great significance for an OEM that sells
millions of cars each year, due to the fact that a positive rating of the
vehicle-under-test (VUT) in safety relevant aspects is important for the
reputation of a car manufacturer. The further intensification and aggravation
of the test requirements for those systems is one of the challenges, that has
to be mastered in order to continuously make significant contributions to
safety for high-volume cars. Therefore, it is to be shown how a simulation
approach may support the development process, especially with tolerance
analysis. This article discusses the current stage of work, steps that are
planned for the future and results that can be expected at the end of such an
analysis.
","[{'version': 'v1', 'created': 'Thu, 14 Aug 2014 09:42:56 GMT'}]",2014-08-15,"[['Block', 'Delf', ''], ['Heeren', 'Sönke', ''], ['Kühnel', 'Stefan', ''], ['Leschke', 'André', ''], ['Rumpe', 'Bernhard', ''], ['Serebro', 'Vladislavs', '']]","['Advanced driver assistance systems', 'black-box testing', 'consumer tests', 'equivalence class partitioning', 'model-based testing', 'simulation']"
54,1807.00851,Konstantinos Psychas,"Konstantinos Psychas, Javad Ghaderi",On Non-Preemptive VM Scheduling in the Cloud,29 pages,"POMACS, Volume 1, Issue 2, December 2017, Article No. 35",10.1145/3154493,,cs.NI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of scheduling VMs (Virtual Machines) in a distributed
server platform, motivated by cloud computing applications. The VMs arrive
dynamically over time to the system, and require a certain amount of resources
(e.g. memory, CPU, etc) for the duration of their service. To avoid costly
preemptions, we consider non-preemptive scheduling: Each VM has to be assigned
to a server which has enough residual capacity to accommodate it, and once a VM
is assigned to a server, its service \textit{cannot} be disrupted (preempted).
Prior approaches to this problem either have high complexity, require
synchronization among the servers, or yield queue sizes/delays which are
excessively large. We propose a non-preemptive scheduling algorithm that
resolves these issues. In general, given an approximation algorithm to Knapsack
with approximation ratio $r$, our scheduling algorithm can provide $r\beta$
fraction of the throughput region for $\beta < r$. In the special case of a
greedy approximation algorithm to Knapsack, we further show that this condition
can be relaxed to $\beta<1$. The parameters $\beta$ and $r$ can be tuned to
provide a tradeoff between achievable throughput, delay, and computational
complexity of the scheduling algorithm. Finally extensive simulation results
using both synthetic and real traffic traces are presented to verify the
performance of our algorithm.
","[{'version': 'v1', 'created': 'Mon, 2 Jul 2018 18:27:28 GMT'}]",2018-07-04,"[['Psychas', 'Konstantinos', ''], ['Ghaderi', 'Javad', '']]","['Scheduling Algorithms', 'Stability', 'Queues', 'Knapsack Problem', 'Cloud']"
55,0708.3879,Dmitri Krioukov,"Xenofontas Dimitropoulos, Dmitri Krioukov, Amin Vahdat, George Riley",Graph Annotations in Modeling Complex Network Topologies,,"ACM Transactions on Modeling and Computer Simulation (TOMACS),
  v.19, n.4, p.17, 2009",10.1145/1596519.1596522,,cs.NI cond-mat.dis-nn physics.data-an physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The coarsest approximation of the structure of a complex network, such as the
Internet, is a simple undirected unweighted graph. This approximation, however,
loses too much detail. In reality, objects represented by vertices and edges in
such a graph possess some non-trivial internal structure that varies across and
differentiates among distinct types of links or nodes. In this work, we
abstract such additional information as network annotations. We introduce a
network topology modeling framework that treats annotations as an extended
correlation profile of a network. Assuming we have this profile measured for a
given network, we present an algorithm to rescale it in order to construct
networks of varying size that still reproduce the original measured annotation
profile.
  Using this methodology, we accurately capture the network properties
essential for realistic simulations of network applications and protocols, or
any other simulations involving complex network topologies, including modeling
and simulation of network evolution. We apply our approach to the Autonomous
System (AS) topology of the Internet annotated with business relationships
between ASs. This topology captures the large-scale structure of the Internet.
In depth understanding of this structure and tools to model it are cornerstones
of research on future Internet architectures and designs. We find that our
techniques are able to accurately capture the structure of annotation
correlations within this topology, thus reproducing a number of its important
properties in synthetically-generated random graphs.
","[{'version': 'v1', 'created': 'Wed, 29 Aug 2007 03:23:56 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Aug 2007 22:09:32 GMT'}, {'version': 'v3', 'created': 'Fri, 19 Sep 2008 02:44:12 GMT'}, {'version': 'v4', 'created': 'Mon, 2 Nov 2009 20:00:00 GMT'}]",2009-11-02,"[['Dimitropoulos', 'Xenofontas', ''], ['Krioukov', 'Dmitri', ''], ['Vahdat', 'Amin', ''], ['Riley', 'George', '']]","['Annotations', 'AS relationships', 'complex networks', 'topology']"
56,1607.06268,Matteo Sammartino,"Joshua Moerman and Matteo Sammartino and Alexandra Silva and Bartek
  Klin and Micha{\l} Szynwelski",Learning Nominal Automata,,,10.1145/3009837.3009879,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an Angluin-style algorithm to learn nominal automata, which are
acceptors of languages over infinite (structured) alphabets. The abstract
approach we take allows us to seamlessly extend known variations of the
algorithm to this new setting. In particular we can learn a subclass of nominal
non-deterministic automata. An implementation using a recently developed
Haskell library for nominal computation is provided for preliminary
experiments.
","[{'version': 'v1', 'created': 'Thu, 21 Jul 2016 11:16:47 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Nov 2016 00:54:36 GMT'}, {'version': 'v3', 'created': 'Sat, 15 Dec 2018 09:03:56 GMT'}]",2018-12-18,"[['Moerman', 'Joshua', ''], ['Sammartino', 'Matteo', ''], ['Silva', 'Alexandra', ''], ['Klin', 'Bartek', ''], ['Szynwelski', 'Michał', '']]","['Active Learning', '(Non)Deterministic Finite Automata', 'Nominal Automata', 'Functional Programming']"
57,1902.08597,Volodymyr Sokolov,"Mahyar Taj Dini, Volodymyr Sokolov",Internet of Things Security Problems,,"Modern Information Protection (ISSN: 2409-7292), no. 1, 2017",10.5281/zenodo.2528814,,cs.CR cs.NI,http://creativecommons.org/licenses/by/4.0/,"  The rapid development of ""smart"" devices leads to explosive growth of
unprotected or partially protected home networks. These networks are easy prey
for unauthorized access, the collection of personal information (including from
surveillance cameras), interference in the operation of individual devices and
the entire system as a whole. In addition, existing solutions for managing a
smart house offer work in the cloud, which in turn reduces the availability of
the system and simultaneously increases the risk of the unscrupulous use of
personal information by the service provider (up to the sale of data to a third
party). This article examines the existing access technologies, their
weaknesses, and offers solutions to improve the overall security of the system
with a local IoT gateway and virtual subnets.
","[{'version': 'v1', 'created': 'Fri, 22 Feb 2019 18:27:09 GMT'}]",2019-02-25,"[['Dini', 'Mahyar Taj', ''], ['Sokolov', 'Volodymyr', '']]","['Internet of things', 'data privacy', 'cloud', 'home dashboard']"
58,1809.01021,Fatemeh Hadaeghi,Fatemeh Hadaeghi and Herbert Jaeger,"Computing optimal discrete readout weights in reservoir computing is
  NP-hard",8 pages submitted to Neurocomputing,"Neurocomputing Volume 338, 21 April 2019, Pages 233-236",10.1016/j.neucom.2019.02.009,,cs.CC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We show NP-hardness of a generalized quadratic programming problem, which we
called Unconstrained N-ary Quadratic Programming (UNQP). This problem has
recently become practically relevant in the context of novel memristor-based
neuromorphic microchip designs, where solving the UNQP is a key operation for
on-chip training of the neural network implemented on the chip. UNQP is the
problem of finding a vector $\mathbf{v} \in S^N$ which minimizes
$\mathbf{v}^T\,Q\,\mathbf{v} +\mathbf{v}^T \mathbf{c} $, where $S = \{s_1,
\ldots, s_n\} \subset \mathbb{Z}$ is a given set of eligible parameters for
$\mathbf{v}$, $Q \in \mathbb{Z}^{N \times N}$ is positive semi-definite, and
$\mathbf{c} \in \mathbb{Z}^{N}$. In memristor-based neuromorphic hardware, $S$
is physically given by a finite (and small) number of possible memristor
states. The proof of NP-hardness is by reduction from the Unconstrained Binary
Quadratic Programming problem, which is a special case of UNQP where $S = \{0,
1\}$ and which is known to be NP-hard.
","[{'version': 'v1', 'created': 'Tue, 4 Sep 2018 14:30:02 GMT'}]",2019-08-27,"[['Hadaeghi', 'Fatemeh', ''], ['Jaeger', 'Herbert', '']]","['Complexity', 'Linear Regression', 'Neuromorphic Hardware', 'Reservoir Computing', 'Unconstrained Quadratic Programming', 'Unconventional Computing']"
59,1706.01118,Kevin Moran P,Kevin Moran,Enhancing Android Application Bug Reporting,"3 Pages, in Proceedings of 10th Joint Meeting of the European
  Software Engineering Conference and the 23rd ACM SIGSOFT Symposium on the
  Foundations of Software Engineering (ESEC/FSE'15) Student Research
  Competition (SRC)","Proceedings of the 23rd ACM SIGSOFT Symposium on the Foundations
  of Software Engineering (SRC), 2015, pp. 1045-1047",10.1145/2786805.2807557,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The modern software development landscape has seen a shift in focus toward
mobile applications as smartphones and tablets near ubiquitous adoption. Due to
this trend, the complexity of these ""apps"" has been increasing, making
development and maintenance challenging. Current bug tracking systems do not
effectively facilitate the creation of bug reports with useful information that
will directly lead to a bug's resolution. To address the need for an improved
reporting system, we introduce a novel solution, called Fusion, that helps
reporters auto-complete reproduction steps in bug reports for mobile apps by
taking advantage of their GUI-centric nature. Fusion links information, that
reporters provide, to program artifacts extracted through static and dynamic
analysis performed beforehand. This allows our system to facilitate the
reporting process for developers and testers, while generating more
reproducible bug reports with immediately actionable information.
","[{'version': 'v1', 'created': 'Sun, 4 Jun 2017 17:57:47 GMT'}]",2017-06-06,"[['Moran', 'Kevin', '']]","['Bug reports', 'android', 'reproduction steps', 'auto-completion']"
60,1911.11934,Michel Kinsy,"Lake Bu, Mihailo Isakov, Michel A. Kinsy","A Secure and Robust Scheme for Sharing Confidential Information in IoT
  Systems",,"Ad Hoc Networks, vol. 92, 2019 - Special Issue on Security of
  IoT-enabled Infrastructures in Smart Cities",10.1016/j.adhoc.2018.09.007,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Internet of Things (IoT) systems with security demands, there is often a
need to distribute sensitive information (such as encryption keys, digital
signatures, or login credentials, etc.) among the devices, so that it can be
retrieved for confidential purposes at a later moment. However, this
information cannot be entrusted to any one device, since the failure of that
device or an attack on it will jeopardize the security of the entire network.
Even if the information is divided among devices, there is still the danger
that an attacker can compromise a group of devices and expose the sensitive
information. In this work, we design and implement a secure and robust scheme
to enable the distribution of sensitive information in IoT networks. The
proposed approach has two important properties: (1) it uses Threshold Secret
Sharing (TSS) to split the information into pieces distributed among all
devices in the system - and so the information can only be retrieved
collaboratively by groups of devices; and (2) it ensures the privacy and
integrity of the information, even when attackers hijack a large number of
devices and use them in concert - specifically, all the compromised devices can
be identified, the confidentiality of information is kept, and authenticity of
the secret can be guaranteed.
","[{'version': 'v1', 'created': 'Wed, 27 Nov 2019 03:40:51 GMT'}]",2019-11-28,"[['Bu', 'Lake', ''], ['Isakov', 'Mihailo', ''], ['Kinsy', 'Michel A.', '']]","['IoT', 'security', 'secret sharing', 'encryption', 'authentication', 'group testing', 'PUF']"
61,1207.3437,Massimiliano Vasile,Massimiliano Vasile,"Robust Mission Design Through Evidence Theory and Multi-Agent
  Collaborative Search",,"Annals of the New York Academy of Science, Volume 1065, New Trends
  in Astrodynamics and Applications pages 152-173, December 2005",10.1196/annals.1370.024,,cs.CE cs.NE cs.SY math.OC math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the preliminary design of a space mission is approached
introducing uncertainties on the design parameters and formulating the
resulting reliable design problem as a multiobjective optimization problem.
Uncertainties are modelled through evidence theory and the belief, or
credibility, in the successful achievement of mission goals is maximised along
with the reliability of constraint satisfaction. The multiobjective
optimisation problem is solved through a novel algorithm based on the
collaboration of a population of agents in search for the set of highly
reliable solutions. Two typical problems in mission analysis are used to
illustrate the proposed methodology.
","[{'version': 'v1', 'created': 'Sat, 14 Jul 2012 16:17:52 GMT'}]",2015-06-05,"[['Vasile', 'Massimiliano', '']]","['multiobjective optimization', 'robust design', 'mission analysis']"
62,1311.7359,Tobias Kloos,"Tobias Kloos and Joachim St\""ockler","Zak transforms and Gabor frames of totally positive functions and
  exponential B-splines",,,10.1016/j.jat.2014.05.010,,cs.IT math.IT math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study totally positive (TP) functions of finite type and exponential
B-splines as window functions for Gabor frames. We establish the connection of
the Zak transform of these two classes of functions and prove that the Zak
transforms have only one zero in their fundamental domain of quasi-periodicity.
Our proof is based on the variation-diminishing property of shifts of
exponential B-splines. For the exponential B-spline B_m of order m, we
determine a large set of lattice parameters a,b>0 such that the Gabor family of
time-frequency shifts is a frame for L^2(R). By the connection of its Zak
transform to the Zak transform of TP functions of finite type, our result
provides an alternative proof that TP functions of finite type provide Gabor
frames for all lattice parameters with ab<1. For even two-sided exponentials
and the related exponential B-spline of order 2, we find lower frame-bounds A,
which show the asymptotically linear decay A (1-ab) as the density ab of the
time-frequency lattice tends to the critical density ab=1.
","[{'version': 'v1', 'created': 'Thu, 28 Nov 2013 16:29:18 GMT'}]",2014-11-07,"[['Kloos', 'Tobias', ''], ['Stöckler', 'Joachim', '']]","['Gabor frame', 'total positivity', 'exponential B-spline', 'Zaktransform']"
63,1202.4530,K Munivara Prasad,"K.Munivara Prasad, A.Rama Mohan Reddy, V Jyothsna","IP Traceback for Flooding attacks on Internet Threat Monitors (ITM)
  Using Honeypots","International Journal of Network Security & Its Applications (IJNSA),
  Vol.4, No.1, January 2012. arXiv admin note: substantial text overlap with
  arXiv:1201.2481","International Journal of Network Security & Its Applications
  (IJNSA), Vol.4, No.1, January 2012",10.5121/ijnsa.2012.4102,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  The Internet Threat Monitoring (ITM) is an efficient monitoring system used
globally to measure, detect, characterize and track threats such as denial of
service (DoS) and distributed Denial of Service (DDoS) attacks and worms. . To
block the monitoring system in the internet the attackers are targeted the ITM
system. In this paper we address the flooding attack of DDoS against ITM
monitors to exhaust the network resources, such as bandwidth, computing power,
or operating system data structures by sending the malicious traffic. We
propose an information-theoretic frame work that models the flooding attacks
using Botnet on ITM. One possible way to counter DDoS attacks is to trace the
attack sources and punish the perpetrators. we propose a novel traceback method
for DDoS using Honeypots. IP tracing through honeypot is a single packet
tracing method and is more efficient than commonly used packet marking
techniques.
","[{'version': 'v1', 'created': 'Tue, 21 Feb 2012 05:37:18 GMT'}]",2012-02-22,"[['Prasad', 'K. Munivara', ''], ['Reddy', 'A. Rama Mohan', ''], ['Jyothsna', 'V', '']]","['Internet Threat Monitors (ITM)', 'DDoS', 'Flooding attack', 'IpTrcing', 'Botnet and Honeypot']"
64,1712.09592,Murat Ozbayoglu,"O.B. Sezer, M. Ozbayoglu, E. Dogdu","An Artificial Neural Network-based Stock Trading System Using Technical
  Analysis and Big Data Framework","ACM Southeast Conference, ACMSE 2017, Kennesaw State University, GA,
  U.S.A., 13-15 April, 2017","ACM Southeast Conference, ACMSE 2017, Kennesaw State University,
  GA, U.S.A., 13-15 April, 2017",10.1145/3077286.3077294,,cs.CE q-fin.TR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a neural network-based stock price prediction and trading
system using technical analysis indicators is presented. The model developed
first converts the financial time series data into a series of buy-sell-hold
trigger signals using the most commonly preferred technical analysis
indicators. Then, a Multilayer Perceptron (MLP) artificial neural network (ANN)
model is trained in the learning stage on the daily stock prices between 1997
and 2007 for all of the Dow30 stocks. Apache Spark big data framework is used
in the training stage. The trained model is then tested with data from 2007 to
2017. The results indicate that by choosing the most appropriate technical
indicators, the neural network model can achieve comparable results against the
Buy and Hold strategy in most of the cases. Furthermore, fine tuning the
technical indicators and/or optimization strategy can enhance the overall
trading performance.
","[{'version': 'v1', 'created': 'Wed, 27 Dec 2017 14:45:40 GMT'}]",2017-12-29,"[['Sezer', 'O. B.', ''], ['Ozbayoglu', 'M.', ''], ['Dogdu', 'E.', '']]","['Stock market', 'Artificial neural network', 'multi layer perceptron', 'algorithmic trading', 'technical analysis']"
65,1310.7448,YuLi Sun,"Yuli Sun, Jinxu Tao, Conggui Liu","An iterative algorithm for computed tomography image reconstruction from
  limited-angle projections","14 pages, 1 figure, 1 table",,10.1007/s12204-015-1608-9,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In application of tomography imaging, limited-angle problem is a quite
practical and important issue. In this paper, an iterative
reprojection-reconstruction (IRR) algorithm using a modified Papoulis-Gerchberg
(PG) iterative scheme is developed for reconstruction from limited-angle
projections which contain noise. The proposed algorithm has two iterative
update processes, one is the extrapolation of unknown data, and the other is
the modification of the known noisy observation data. And the algorithm
introduces scaling factors to control the two processes, respectively. The
convergence of the algorithm is guaranteed, and the method of choosing the
scaling factors is given with energy constraints. The simulation result
demonstrates our conclusions and indicates that the algorithm proposed in this
paper can obviously improve the reconstruction quality.
","[{'version': 'v1', 'created': 'Mon, 16 Sep 2013 07:52:16 GMT'}]",2019-05-01,"[['Sun', 'Yuli', ''], ['Tao', 'Jinxu', ''], ['Liu', 'Conggui', '']]","['Computed tomography', 'Limited-angle reconstruction', 'Papoulis-Gerchberg']"
66,0803.3224,Michael Hahsler,Michael Hahsler,"A Model-Based Frequency Constraint for Mining Associations from
  Transaction Data",,"Michael Hahsler. A model-based frequency constraint for mining
  associations from transaction data. Data Mining and Knowledge Discovery,
  13(2):137-166, September 2006",10.1007/s10618-005-0026-2,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mining frequent itemsets is a popular method for finding associated items in
databases. For this method, support, the co-occurrence frequency of the items
which form an association, is used as the primary indicator of the
associations's significance. A single user-specified support threshold is used
to decided if associations should be further investigated. Support has some
known problems with rare items, favors shorter itemsets and sometimes produces
misleading associations.
  In this paper we develop a novel model-based frequency constraint as an
alternative to a single, user-specified minimum support. The constraint
utilizes knowledge of the process generating transaction data by applying a
simple stochastic mixture model (the NB model) which allows for transaction
data's typically highly skewed item frequency distribution. A user-specified
precision threshold is used together with the model to find local frequency
thresholds for groups of itemsets. Based on the constraint we develop the
notion of NB-frequent itemsets and adapt a mining algorithm to find all
NB-frequent itemsets in a database. In experiments with publicly available
transaction databases we show that the new constraint provides improvements
over a single minimum support threshold and that the precision threshold is
more robust and easier to set and interpret by the user.
","[{'version': 'v1', 'created': 'Fri, 21 Mar 2008 20:39:53 GMT'}]",2008-12-18,"[['Hahsler', 'Michael', '']]","['Data mining', 'associations', 'interest measures', 'mixture models', 'transaction data']"
67,1908.00763,Ninnart Fuengfusin,"Ninnart Fuengfusin, Hakaru Tamukoh",Network with Sub-Networks,,,10.2991/jrnal.k.201215.006,,cs.LG cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce network with sub-networks, a neural network which its weight
layers could be detached into sub-neural networks during inference. To develop
weights and biases which could be inserted in both base and sub-neural
networks, firstly, the parameters are copied from sub-model to base-model. Each
model is forward-propagated separately. Gradients from a pair of networks are
averaged and, used to update both networks. Our base model achieves the
test-accuracy which is comparable to the regularly trained models, while the
model maintains the ability to detach weight layers.
","[{'version': 'v1', 'created': 'Fri, 2 Aug 2019 09:04:28 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Dec 2019 04:41:02 GMT'}]",2021-10-20,"[['Fuengfusin', 'Ninnart', ''], ['Tamukoh', 'Hakaru', '']]","['Model Compression', 'Neural Networks', 'Multilayer Perceptron', 'Supervised Learning']"
68,1808.00823,Jacob Kreindl,"Jacob Kreindl (1), Manuel Rigger (1), Hanspeter M\""ossenb\""ock (1)
  ((1) Johannes Kepler University Linz)",Debugging Native Extensions of Dynamic Languages,"7 pages, 7 figures, accepted at 15th International Conference on
  Managed Languages & Runtimes (ManLang'18)",,10.1145/3237009.3237017,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many dynamic programming languages such as Ruby and Python enable developers
to use so called native extensions, code implemented in typically statically
compiled languages like C and C++. However, debuggers for these dynamic
languages usually lack support for also debugging these native extensions.
GraalVM can execute programs implemented in various dynamic programming
languages and, by using the LLVM-IR interpreter Sulong, also their native
extensions. We added support for source-level debugging to Sulong based on
GraalVM's debugging framework by associating run-time debug information from
the LLVM-IR level to the original program code. As a result, developers can now
use GraalVM to debug source code written in multiple LLVM-based programming
languages as well as programs implemented in various dynamic languages that
invoke it in a common debugger front-end.
","[{'version': 'v1', 'created': 'Thu, 2 Aug 2018 14:11:31 GMT'}]",2018-08-03,"[['Kreindl', 'Jacob', '', 'Johannes Kepler University Linz'], ['Rigger', 'Manuel', '', 'Johannes Kepler University Linz'], ['Mössenböck', 'Hanspeter', '', 'Johannes Kepler University Linz']]","['Sulong', 'GraalVM', 'Truffle', 'LLVM', 'Debugging', 'Native Extensions']"
69,1903.03018,Ian McQuillan,Oscar H. Ibarra and Ian McQuillan,"On the Density of Languages Accepted by Turing Machines and Other
  Machine Models",,"Journal of Automata, Languages and Combinatorics, 23, 189-199,
  2018",10.25596/jalc-2018-189,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A language is dense if the set of all infixes (or subwords) of the language
is the set of all words. Here, it is shown that it is decidable whether the
language accepted by a nondeterministic Turing machine with a one-way read-only
input and a reversal-bounded read/write worktape (the read/write head changes
direction at most some fixed number of times) is dense. From this, it is
implied that it is also decidable for one-way reversal-bounded queue automata,
one-way reversal-bounded stack automata, and one-way reversal-bounded $k$-flip
pushdown automata (machines that can ""flip"" their pushdowns up to $k$ times).
However, it is undecidable for deterministic Turing machines with two
1-reversal-bounded worktapes (even when the two tapes are restricted to operate
as 1-reversal-bounded pushdown stacks).
","[{'version': 'v1', 'created': 'Thu, 7 Mar 2019 16:10:24 GMT'}]",2019-03-08,"[['Ibarra', 'Oscar H.', ''], ['McQuillan', 'Ian', '']]","['density', 'Turing machines', 'store languages', 'pushdowns', 'queues', 'stacks']"
70,1803.06657,Can Pu,"Can Pu, Runzi Song, Radim Tylecek, Nanbo Li, Robert B Fisher","Sdf-GAN: Semi-supervised Depth Fusion with Multi-scale Adversarial
  Networks","This is our draft and accepted by the journal Remote Sensing. There
  is a little difference between the title on Arxiv and that on Remote Sensing.
  Two small corrections have been made in ""Performance on Kitti2015 Dataset"" in
  this latest version (which is slightly different from the previous version in
  Remote Sensing)","Remote Sens. 2019, 11, 487",10.3390/rs11050487,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Refining raw disparity maps from different algorithms to exploit their
complementary advantages is still challenging. Uncertainty estimation and
complex disparity relationships among pixels limit the accuracy and robustness
of existing methods and there is no standard method for fusion of different
kinds of depth data. In this paper, we introduce a new method to fuse disparity
maps from different sources, while incorporating supplementary information
(intensity, gradient, etc.) into a refiner network to better refine raw
disparity inputs. A discriminator network classifies disparities at different
receptive fields and scales. Assuming a Markov Random Field for the refined
disparity map produces better estimates of the true disparity distribution.
Both fully supervised and semi-supervised versions of the algorithm are
proposed. The approach includes a more robust loss function to inpaint invalid
disparity values and requires much less labeled data to train in the
semi-supervised learning mode. The algorithm can be generalized to fuse depths
from different kinds of depth sources. Experiments explored different fusion
opportunities: stereo-monocular fusion, stereo-ToF fusion and stereo-stereo
fusion. The experiments show the superiority of the proposed algorithm compared
with the most recent algorithms on public synthetic datasets (Scene Flow,
SYNTH3, our synthetic garden dataset) and real datasets (Kitti2015 dataset and
Trimbot2020 Garden dataset).
","[{'version': 'v1', 'created': 'Sun, 18 Mar 2018 13:17:16 GMT'}, {'version': 'v2', 'created': 'Sat, 2 Mar 2019 12:38:12 GMT'}, {'version': 'v3', 'created': 'Mon, 6 May 2019 15:48:51 GMT'}]",2019-05-07,"[['Pu', 'Can', ''], ['Song', 'Runzi', ''], ['Tylecek', 'Radim', ''], ['Li', 'Nanbo', ''], ['Fisher', 'Robert B', '']]","['Depth fusion', 'Disparity fusion', 'Stereo Vision', 'Monocular Vision', 'Time of Flight']"
71,1003.3569,Secretary Aircc Journal,"Hung-Chin Jang (National Chengchi University, Taiwan)","Applications of Geometric Algorithms to Reduce Interference in Wireless
  Mesh Network","24 Pages, JGraph-Hoc Journal 2010","International journal on applications of graph theory in wireless
  ad hoc networks and sensor networks 2.1 (2010) 62-85",10.5121/jgraphhoc.2010.2106,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11),
each node should help to relay packets of neighboring nodes toward gateway
using multi-hop routing mechanisms. Wireless mesh networks usually intensively
deploy mesh nodes to deal with the problem of dead spot communication. However,
the higher density of nodes deployed, the higher radio interference occurred.
This causes significant degradation of system performance. In this paper, we
first convert network problems into geometry problems in graph theory, and then
solve the interference problem by geometric algorithms. We first define line
intersection in a graph to reflect radio interference problem in a wireless
mesh network. We then use plan sweep algorithm to find intersection lines, if
any; employ Voronoi diagram algorithm to delimit the regions among nodes; use
Delaunay Triangulation algorithm to reconstruct the graph in order to minimize
the interference among nodes. Finally, we use standard deviation to prune off
those longer links (higher interference links) to have a further enhancement.
The proposed hybrid solution is proved to be able to significantly reduce
interference in a wireless mesh network in O(n log n) time complexity.
","[{'version': 'v1', 'created': 'Thu, 18 Mar 2010 12:13:38 GMT'}]",2010-07-15,"[['Jang', 'Hung-Chin', '', 'National Chengchi University, Taiwan']]","['Wireless Mesh Network', 'Interference Reduction', 'Voronoi Diagram', 'Delaunay Triangulation Algorithm']"
72,1204.4202,Richard Preen,Richard J. Preen and Larry Bull,Fuzzy Dynamical Genetic Programming in XCSF,2 page GECCO 2011 poster paper,"In Proceedings of the 13th annual conference companion on genetic
  and evolutionary computation, GECCO '11, pp. 167-168. ACM, 2011",10.1145/2001858.2001952,,cs.AI cs.LG cs.NE cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A number of representation schemes have been presented for use within
Learning Classifier Systems, ranging from binary encodings to Neural Networks,
and more recently Dynamical Genetic Programming (DGP). This paper presents
results from an investigation into using a fuzzy DGP representation within the
XCSF Learning Classifier System. In particular, asynchronous Fuzzy Logic
Networks are used to represent the traditional condition-action production
system rules. It is shown possible to use self-adaptive, open-ended evolution
to design an ensemble of such fuzzy dynamical systems within XCSF to solve
several well-known continuous-valued test problems.
","[{'version': 'v1', 'created': 'Wed, 18 Apr 2012 20:40:18 GMT'}]",2013-04-29,"[['Preen', 'Richard J.', ''], ['Bull', 'Larry', '']]","['Fuzzy Logic Networks', 'Learning Classifier Systems', 'Reinforcement Learning', 'Self-Adaptation', 'XCSF']"
73,1609.02234,Le Guan,"Le Guan and Jun Xu and Shuai Wang and Xinyu Xing and Lin Lin and
  Heqing Huang and Peng Liu and Wenke Lee","From Physical to Cyber: Escalating Protection for Personalized Auto
  Insurance",Appeared in Sensys 2016,,10.1145/2994551.2994573,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, auto insurance companies set personalized insurance rate based on
data gathered directly from their customers' cars. In this paper, we show such
a personalized insurance mechanism -- wildly adopted by many auto insurance
companies -- is vulnerable to exploit. In particular, we demonstrate that an
adversary can leverage off-the-shelf hardware to manipulate the data to the
device that collects drivers' habits for insurance rate customization and
obtain a fraudulent insurance discount. In response to this type of attack, we
also propose a defense mechanism that escalates the protection for insurers'
data collection. The main idea of this mechanism is to augment the insurer's
data collection device with the ability to gather unforgeable data acquired
from the physical world, and then leverage these data to identify manipulated
data points. Our defense mechanism leveraged a statistical model built on
unmanipulated data and is robust to manipulation methods that are not foreseen
previously. We have implemented this defense mechanism as a proof-of-concept
prototype and tested its effectiveness in the real world. Our evaluation shows
that our defense mechanism exhibits a false positive rate of 0.032 and a false
negative rate of 0.013.
","[{'version': 'v1', 'created': 'Thu, 8 Sep 2016 00:34:00 GMT'}, {'version': 'v2', 'created': 'Tue, 23 May 2017 14:58:27 GMT'}]",2017-05-24,"[['Guan', 'Le', ''], ['Xu', 'Jun', ''], ['Wang', 'Shuai', ''], ['Xing', 'Xinyu', ''], ['Lin', 'Lin', ''], ['Huang', 'Heqing', ''], ['Liu', 'Peng', ''], ['Lee', 'Wenke', '']]","['Telematics Device', 'Fraud Detection', 'Mixtures of RegressionModels']"
74,0704.1267,Laurence Likforman,"Laurence Likforman-Sulem, Abderrazak Zahour, Bruno Taconet",Text Line Segmentation of Historical Documents: a Survey,"25 pages, submitted version, To appear in International Journal on
  Document Analysis and Recognition, On line version available at
  http://www.springerlink.com/content/k2813176280456k3/","Vol. 9, no 2-4, April 2007, pp. 123-138",10.1007/s10032-006-0023-z,,cs.CV,,"  There is a huge amount of historical documents in libraries and in various
National Archives that have not been exploited electronically. Although
automatic reading of complete pages remains, in most cases, a long-term
objective, tasks such as word spotting, text/image alignment, authentication
and extraction of specific fields are in use today. For all these tasks, a
major step is document segmentation into text lines. Because of the low quality
and the complexity of these documents (background noise, artifacts due to
aging, interfering lines),automatic text line segmentation remains an open
research field. The objective of this paper is to present a survey of existing
methods, developed during the last decade, and dedicated to documents of
historical interest.
","[{'version': 'v1', 'created': 'Tue, 10 Apr 2007 16:26:42 GMT'}]",2007-05-23,"[['Likforman-Sulem', 'Laurence', ''], ['Zahour', 'Abderrazak', ''], ['Taconet', 'Bruno', '']]","['segmentation', 'handwriting', 'text lines', 'Historical documents', 'survey']"
75,1804.06816,Christoph Meier,"Christoph Meier, Reimar Weissbach, Johannes Weinberg, Wolfgang A.
  Wall, A. John Hart","Modeling and Characterization of Cohesion in Fine Metal Powders with a
  Focus on Additive Manufacturing Process Simulations",,,10.1016/j.powtec.2018.11.072,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The cohesive interactions between fine metal powder particles crucially
influence their flow behavior, which is in turn important to many powder-based
manufacturing processes including emerging methods for powder-based metal
additive manufacturing (AM). The present work proposes a novel modeling and
characterization approach for micron-scale metal powders, with a special focus
on characteristics of importance to powder-bed AM. The model is based on the
discrete element method (DEM), and the considered particle-to-particle and
particle-to-wall interactions involve frictional contact, rolling resistance
and cohesive forces. Special emphasis lies on the modeling of cohesion. The
proposed adhesion force law is defined by the pull-off force resulting from the
surface energy of powder particles in combination with a van-der-Waals force
curve regularization. The model is applied to predict the angle of repose (AOR)
of exemplary spherical Ti-6Al-4V powders, and the surface energy value
underlying the adhesion force law is calibrated by fitting the corresponding
angle of repose values from numerical and experimental funnel tests. To the
best of the authors' knowledge, this is the first work providing an
experimental estimate for the effective surface energy of the considered class
of metal powders. By this approach, an effective surface energy of $0.1mJ/m^2$
is found for the investigated Ti-6Al-4V powder. This value is considerably
lower than typical experimental values for flat metal contact surfaces in the
range of $30-50 mJ/m^2$, indicating the crucial influence of factors such as
surface roughness and chemical surface contamination on fine metal powders.
More importantly, the present study demonstrates that a neglect of the related
cohesive forces leads to a drastical underestimation of the AOR and,
consequently, to an insufficient representation of the bulk powder behavior.
","[{'version': 'v1', 'created': 'Wed, 18 Apr 2018 17:08:47 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Apr 2018 08:44:27 GMT'}, {'version': 'v3', 'created': 'Fri, 25 May 2018 07:30:16 GMT'}]",2019-05-08,"[['Meier', 'Christoph', ''], ['Weissbach', 'Reimar', ''], ['Weinberg', 'Johannes', ''], ['Wall', 'Wolfgang A.', ''], ['Hart', 'A. John', '']]","['Cohesion', 'Surface Energy', 'Fine Metal Powders', 'Additive Manufacturing', 'Discrete Element Method', 'Modeling and Characterization']"
76,1612.04598,Stefan Wagner,Sebastian Winter and Stefan Wagner and Florian Deissenboeck,A Comprehensive Model of Usability,"18 pages, 3 figures","Engineering Interactive Systems: EIS 2007 Joint Working
  Conferences, EHCI 2007, DSV-IS 2007, HCSE 2007. Springer, 2008",10.1007/978-3-540-92698-6_7,,cs.HC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Usability is a key quality attribute of successful software systems.
Unfortunately, there is no common understanding of the factors influencing
usability and their interrelations. Hence, the lack of a comprehensive basis
for designing, analyzing, and improving user interfaces. This paper proposes a
2-dimensional model of usability that associates system properties with the
activities carried out by the user. By separating activities and properties,
sound quality criteria can be identified, thus facilitating statements
concerning their interdependencies. This model is based on a tested quality
meta-model that fosters preciseness and completeness. A case study demonstrates
the manner by which such a model aids in revealing contradictions and omissions
in existing usability standards. Furthermore, the model serves as a central and
structured knowledge base for the entire quality assurance process, e.g. the
automatic generation of guideline documents.
","[{'version': 'v1', 'created': 'Wed, 14 Dec 2016 12:17:54 GMT'}]",2016-12-15,"[['Winter', 'Sebastian', ''], ['Wagner', 'Stefan', ''], ['Deissenboeck', 'Florian', '']]","['usability', 'quality models', 'quality assessment']"
77,1603.08323,{\L}ukasz Olech Piotr,"Micha{\l} Spytkowski, {\L}ukasz P. Olech, Halina Kwa\'snicka",Hierarchy of Groups Evaluation Using Different F-score Variants,"Presented on ACIIDS2016 conference https://aciids.pwr.edu.pl/. The
  final publication is available at Springer via
  http://dx.doi.org/10.1007/978-3-662-49381-6_63","ACIIDS 2016, Da Nang, Vietnam, March 14-16, 2016, pp. 654
  (Springer Berlin Heidelberg)",10.1007/978-3-662-49381-6_63,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents a cursory examination of clustering, focusing on a rarely
explored field of hierarchy of clusters. Based on this, a short discussion of
clustering quality measures is presented and the F-score measure is examined
more deeply. As there are no attempts to assess the quality for hierarchies of
clusters, three variants of the F-Score based index are presented: classic,
hierarchical and partial order. The partial order index is the authors'
approach to the subject. Conducted experiments show the properties of the
considered measures. In conclusions, the strong and weak sides of each variant
are presented.
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2016 06:38:56 GMT'}]",2016-03-29,"[['Spytkowski', 'Michał', ''], ['Olech', 'Łukasz P.', ''], ['Kwaśnicka', 'Halina', '']]","['clustering quality measures', 'F-score', 'hierarchies of clusters']"
78,1802.05594,Beno\^it Girard,"Lise Aubin, Mehdi Khamassi (ISIR), Beno\^it Girard (ISIR)","Prioritized Sweeping Neural DynaQ with Multiple Predecessors, and
  Hippocampal Replays","Living Machines 2018 (Paris, France)",,10.1007/978-3-319-95972-6_4,,cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During sleep and awake rest, the hippocampus replays sequences of place cells
that have been activated during prior experiences. These have been interpreted
as a memory consolidation process, but recent results suggest a possible
interpretation in terms of reinforcement learning. The Dyna reinforcement
learning algorithms use off-line replays to improve learning. Under limited
replay budget, a prioritized sweeping approach, which requires a model of the
transitions to the predecessors, can be used to improve performance. We
investigate whether such algorithms can explain the experimentally observed
replays. We propose a neural network version of prioritized sweeping
Q-learning, for which we developed a growing multiple expert algorithm, able to
cope with multiple predecessors. The resulting architecture is able to improve
the learning of simulated agents confronted to a navigation task. We predict
that, in animals, learning the world model should occur during rest periods,
and that the corresponding replays should be shuffled.
","[{'version': 'v1', 'created': 'Thu, 15 Feb 2018 15:15:19 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Aug 2018 12:27:55 GMT'}]",2018-08-14,"[['Aubin', 'Lise', '', 'ISIR'], ['Khamassi', 'Mehdi', '', 'ISIR'], ['Girard', 'Benoît', '', 'ISIR']]","['Reinforcement Learning', 'Replays', 'DynaQ', 'Prioritized Sweeping', 'Neural Networks', 'Hippocampus', 'Navigation']"
79,1311.6264,"J\""urgen M\""unch","Frank Elberzhager, Alla Rosbach, J\""urgen M\""unch, Robert Eschbach","Inspection and Test Process Integration Based on Explicit Test
  Prioritization Strategies","12 pages. The final publication is available at
  http://link.springer.com/chapter/10.1007%2F978-3-642-27213-4_12","Proceedings of the Software Quality Days (SWQD), pages 181-192,
  Vienna, Austria, January 17-19 2012",10.1007/978-3-642-27213-4_12,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today's software quality assurance techniques are often applied in isolation.
Consequently, synergies resulting from systematically integrating different
quality assurance activities are often not exploited. Such combinations promise
benefits, such as a reduction in quality assurance effort or higher defect
detection rates. The integration of inspection and testing, for instance, can
be used to guide testing activities. For example, testing activities can be
focused on defect-prone parts based upon inspection results. Existing
approaches for predicting defect-prone parts do not make systematic use of the
results from inspections. This article gives an overview of an integrated
inspection and testing approach, and presents a preliminary case study aiming
at verifying a study design for evaluating the approach. First results from
this preliminary case study indicate that synergies resulting from the
integration of inspection and testing might exist, and show a trend that
testing activities could be guided based on inspection results.
","[{'version': 'v1', 'created': 'Mon, 25 Nov 2013 11:14:07 GMT'}]",2013-11-26,"[['Elberzhager', 'Frank', ''], ['Rosbach', 'Alla', ''], ['Münch', 'Jürgen', ''], ['Eschbach', 'Robert', '']]","['software inspections', 'testing', 'quality assurance', 'integration', 'focusing', 'synergy effects', 'case study', 'study design']"
80,1512.05141,Evangelos Spyrou,Evangelos D. Spyrou and Dimitrios K. Mitrakos,"Approximating Nash Equilibrium Uniqueness of Power Control In Practical
  WSNs","16 pages, 10 figures, Game theory, Wireless Sensor Networks,
  International Journal of Computer Networks & Communications (IJCNC) Vol.7,
  No.6, November 2015",,10.5121/ijcnc.2015.7604,,cs.NI cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transmission power has a major impact on link and communication reliability
and network lifetime in Wireless Sensor Networks. We study power control in a
multi-hop Wireless Sensor Network where nodes' communication interfere with
each other. Our objective is to determine each node's transmission power level
that will reduce the communication interference and keep energy consumption to
a minimum. We propose a potential game approach to obtain the unique
equilibrium of the network transmission power allocation. The unique
equilibrium is located in a continuous domain. However, radio transceivers
accept only discrete values for transmission power level setting. We study the
viability and performance of mapping the continuous solution from the potential
game to the discrete domain required by the radio. We demonstrate the success
of our approach through TOSSIM simulation when nodes use the Collection Tree
Protocol for routing the data. Also, we show results of our method from the
Indriya testbed. We compare it with the case where the motes use Collection
Tree Protocol with the maximum transmission power.
","[{'version': 'v1', 'created': 'Wed, 16 Dec 2015 12:08:00 GMT'}]",2015-12-17,"[['Spyrou', 'Evangelos D.', ''], ['Mitrakos', 'Dimitrios K.', '']]","['Transmission Power', 'Packet Reception Ratio (PRR)', 'Game Theory', 'Distributed Optimisation', 'Potential Game    1']"
81,1407.2961,Youness Aliyari Ghassabeh,Youness Aliyari Ghassabeh,"On the Convergence of the Mean Shift Algorithm in the One-Dimensional
  Space","13 pages, 10 figures, Published in Pattern Recognition Letters","Pattern Recognition Letters, 2013, vol. 34(12)",10.1016/j.patrec.2013.05.004,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The mean shift algorithm is a non-parametric and iterative technique that has
been used for finding modes of an estimated probability density function. It
has been successfully employed in many applications in specific areas of
machine vision, pattern recognition, and image processing. Although the mean
shift algorithm has been used in many applications, a rigorous proof of its
convergence is still missing in the literature. In this paper we address the
convergence of the mean shift algorithm in the one-dimensional space and prove
that the sequence generated by the mean shift algorithm is a monotone and
convergent sequence.
","[{'version': 'v1', 'created': 'Thu, 10 Jul 2014 20:55:25 GMT'}]",2014-07-14,"[['Ghassabeh', 'Youness Aliyari', '']]","['Mean Shift Algorithm', 'Mode Estimate Sequence', 'Monotone Sequence', 'Kernel Function', 'Convex function', 'Convergence']"
82,1207.1818,Evangelos Karapanos,"R\'uben Gouveia, Evangelos Niforatos, Evangelos Karapanos","Footprint Tracker: reviewing lifelogs and reconstructing daily
  experiences",,"Gouveia, R., Niforatos, E., Karapanos, E. (2012) Footprint
  Tracker: reviewing lifelogs and reconstructing daily experiences, In adjunct
  proceedings of ACM conference on Designing Interactive Systems, DIS'12",,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the increasing emphasis on how mobile technologies are experienced in
everyday life, researchers are increasingly emphasizing the use of in-situ
methods such as Experience Sampling and Day Reconstruction. In our line of
research we explore the concept of Technology-Assisted Reconstruction, in which
passively logged behavior data assist in the later reconstruction of daily
experiences. In this paper we introduce Footprint tracker, a web application
that supports participants in reviewing lifelogs and reconstructing their daily
experiences. We focus on three kinds of data: visual (as captured through
Microsoft's sensecam), location, and context (i.e., SMS and calls received and
made). We describe how Footprint Tracker supports the user in reviewing these
lifelogs and outline a field study that attempts to inquire into whether and
how this data support reconstruction from memory.
","[{'version': 'v1', 'created': 'Sat, 7 Jul 2012 18:52:06 GMT'}]",2012-07-10,"[['Gouveia', 'Rúben', ''], ['Niforatos', 'Evangelos', ''], ['Karapanos', 'Evangelos', '']]","['Experience sampling', 'Day Reconstruction', 'life-logging']"
83,1810.07762,Jianguo Chen,"Jianguo Chen, Kenli Li, Huigui Rong, Kashif Bilal, Nan Yang, Keqin Li","A Disease Diagnosis and Treatment Recommendation System Based on Big
  Data Mining and Cloud Computing",,"Information Sciences, 2018, 435:124-149",10.1016/j.ins.2018.01.001,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is crucial to provide compatible treatment schemes for a disease according
to various symptoms at different stages. However, most classification methods
might be ineffective in accurately classifying a disease that holds the
characteristics of multiple treatment stages, various symptoms, and
multi-pathogenesis. Moreover, there are limited exchanges and cooperative
actions in disease diagnoses and treatments between different departments and
hospitals. Thus, when new diseases occur with atypical symptoms, inexperienced
doctors might have difficulty in identifying them promptly and accurately.
Therefore, to maximize the utilization of the advanced medical technology of
developed hospitals and the rich medical knowledge of experienced doctors, a
Disease Diagnosis and Treatment Recommendation System (DDTRS) is proposed in
this paper. First, to effectively identify disease symptoms more accurately, a
Density-Peaked Clustering Analysis (DPCA) algorithm is introduced for
disease-symptom clustering. In addition, association analyses on
Disease-Diagnosis (D-D) rules and Disease-Treatment (D-T) rules are conducted
by the Apriori algorithm separately. The appropriate diagnosis and treatment
schemes are recommended for patients and inexperienced doctors, even if they
are in a limited therapeutic environment. Moreover, to reach the goals of high
performance and low latency response, we implement a parallel solution for
DDTRS using the Apache Spark cloud platform. Extensive experimental results
demonstrate that the proposed DDTRS realizes disease-symptom clustering
effectively and derives disease treatment recommendations intelligently and
accurately.
","[{'version': 'v1', 'created': 'Wed, 17 Oct 2018 20:07:08 GMT'}]",2019-11-26,"[['Chen', 'Jianguo', ''], ['Li', 'Kenli', ''], ['Rong', 'Huigui', ''], ['Bilal', 'Kashif', ''], ['Yang', 'Nan', ''], ['Li', 'Keqin', '']]","['Big data mining', 'Cloud computing', 'Disease diagnosis and treatment', 'Recommendation system']"
84,1908.01501,Davide Taibi,"Steve Counsell, Mahir Arzoky, Giuseppe Destefanis, Davide Taibi","On the Relationship Between Coupling and Refactoring: An Empirical
  Viewpoint",,"ACM/IEEE International Symposium on Empirical Software Engineering
  and Measurement (ESEM). Brazil. 2019",,,cs.SE,http://creativecommons.org/licenses/by-sa/4.0/,"  [Background] Refactoring has matured over the past twenty years to become
part of a developer's toolkit. However, many fundamental research questions
still remain largely unexplored. [Aim] The goal of this paper is to investigate
the highest and lowest quartile of refactoring-based data using two coupling
metrics - the Coupling between Objects metric and the more recent Conceptual
Coupling between Classes metric to answer this question. Can refactoring trends
and patterns be identified based on the level of class coupling? [Method] In
this paper, we analyze over six thousand refactoring operations drawn from
releases of three open-source systems to address one such question. [Results]
Results showed no meaningful difference in the types of refactoring applied
across either lower or upper quartile of coupling for both metrics;
refactorings usually associated with coupling removal were actually more
numerous in the lower quartile in some cases. A lack of inheritance-related
refactorings across all systems was also noted. [Conclusions] The emerging
message (and a perplexing one) is that developers seem to be largely
indifferent to classes with high coupling when it comes to refactoring types -
they treat classes with relatively low coupling in almost the same way.
","[{'version': 'v1', 'created': 'Mon, 5 Aug 2019 07:54:31 GMT'}]",2019-08-06,"[['Counsell', 'Steve', ''], ['Arzoky', 'Mahir', ''], ['Destefanis', 'Giuseppe', ''], ['Taibi', 'Davide', '']]","['Refactoring', 'coupling', 'metrics', 'empirical']"
85,2102.12523,Chunjong Park,"Chunjong Park, Morelle Arian, Xin Liu, Leon Sasson, Jeffrey Kahn,
  Shwetak Patel, Alex Mariakakis, Tim Althoff","Online Mobile App Usage as an Indicator of Sleep Behavior and Job
  Performance",,,10.1145/3442381.3450093,,cs.HC cs.CY q-bio.NC,http://creativecommons.org/licenses/by/4.0/,"  Sleep is critical to human function, mediating factors like memory, mood,
energy, and alertness; therefore, it is commonly conjectured that a good
night's sleep is important for job performance. However, both real-world sleep
behavior and job performance are hard to measure at scale. In this work, we
show that people's everyday interactions with online mobile apps can reveal
insights into their job performance in real-world contexts. We present an
observational study in which we objectively tracked the sleep behavior and job
performance of salespeople (N = 15) and athletes (N = 19) for 18 months, using
a mattress sensor and online mobile app. We first demonstrate that cumulative
sleep measures are correlated with job performance metrics, showing that an
hour of daily sleep loss for a week was associated with a 9.0% and 9.5%
reduction in performance of salespeople and athletes, respectively. We then
examine the utility of online app interaction time as a passively collectible
and scalable performance indicator. We show that app interaction time is
correlated with the performance of the athletes, but not the salespeople. To
support that our app-based performance indicator captures meaningful variation
in psychomotor function and is robust against potential confounds, we conducted
a second study to evaluate the relationship between sleep behavior and app
interaction time in a cohort of 274 participants. Using a generalized additive
model to control for per-participant random effects, we demonstrate that
participants who lost one hour of daily sleep for a week exhibited 5.0% slower
app interaction times. We also find that app interaction time exhibits
meaningful chronobiologically consistent correlations with sleep history, time
awake, and circadian rhythms. Our findings reveal an opportunity for online app
developers to generate new insights regarding cognition and productivity.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2021 19:30:39 GMT'}]",2021-02-26,"[['Park', 'Chunjong', ''], ['Arian', 'Morelle', ''], ['Liu', 'Xin', ''], ['Sasson', 'Leon', ''], ['Kahn', 'Jeffrey', ''], ['Patel', 'Shwetak', ''], ['Mariakakis', 'Alex', ''], ['Althoff', 'Tim', '']]","['mobile app interaction', 'interaction time', 'sleep tracking', 'sleep behavior', 'job performance']"
86,1802.05831,Rozhin Eskandarpour,"Rozhin Eskandarpour, Amin Khodaei",Component Outage Estimation based on Support Vector Machine,,"Power & Energy Society General Meeting, 2017 IEEE",10.1109/PESGM.2017.8274276,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predicting power system component outages in response to an imminent
hurricane plays a major role in preevent planning and post-event recovery of
the power system. An exact prediction of components states, however, is a
challenging task and cannot be easily performed. In this paper, a Support
Vector Machine (SVM) based method is proposed to help estimate the components
states in response to anticipated path and intensity of an imminent hurricane.
Components states are categorized into three classes of damaged, operational,
and uncertain. The damaged components along with the components in uncertain
class are then considered in multiple contingency scenarios of a proposed
Event-driven Security-Constrained Unit Commitment (E-SCUC), which considers the
simultaneous outage of multiple components under an N-m-u reliability
criterion. Experimental results on the IEEE 118-bus test system show the merits
and the effectiveness of the proposed SVM classifier and the E-SCUC model in
improving power system resilience in response to extreme events.
","[{'version': 'v1', 'created': 'Fri, 16 Feb 2018 04:07:33 GMT'}]",2018-02-19,"[['Eskandarpour', 'Rozhin', ''], ['Khodaei', 'Amin', '']]","['Support vector machines', 'extreme events', 'power system resilience', 'resource scheduling', 'security-constrained unit commitment']"
87,1309.7979,Susan Stepney,"Clare Horsman, Susan Stepney, Rob C. Wagner, Viv Kendon",When does a physical system compute?,"22 pages, 10 figures. v3 as accepted by Proc.Roy.Soc.A","Proc. R. Soc. A 2014 470, 20140182",10.1098/rspa.2014.0182,,cs.ET physics.hist-ph quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computing is a high-level process of a physical system. Recent interest in
non-standard computing systems, including quantum and biological computers, has
brought this physical basis of computing to the forefront. There has been,
however, no consensus on how to tell if a given physical system is acting as a
computer or not; leading to confusion over novel computational devices, and
even claims that every physical event is a computation. In this paper we
introduce a formal framework that can be used to determine whether or not a
physical system is performing a computation. We demonstrate how the abstract
computational level interacts with the physical device level, drawing the
comparison with the use of mathematical models to represent physical objects in
experimental science. This powerful formulation allows a precise description of
the similarities between experiments, computation, simulation, and technology,
leading to our central conclusion: physical computing is the use of a physical
system to predict the outcome of an abstract evolution. We give conditions that
must be satisfied in order for computation to be occurring, and illustrate
these with a range of non-standard computing scenarios. The framework also
covers broader computing contexts, where there is no obvious human computer
user. We define the critical notion of a 'computational entity', and show the
role this plays in defining when computing is taking place in physical systems.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2013 19:37:43 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Mar 2014 09:30:44 GMT'}, {'version': 'v3', 'created': 'Mon, 16 Jun 2014 08:40:16 GMT'}]",2014-07-11,"[['Horsman', 'Clare', ''], ['Stepney', 'Susan', ''], ['Wagner', 'Rob C.', ''], ['Kendon', 'Viv', '']]","['computation', 'physical computation', 'computer']"
88,2206.02663,Yang Li,"Yang Li, Yu Shen, Huaijun Jiang, Wentao Zhang, Zhi Yang, Ce Zhang and
  Bin Cui",TransBO: Hyperparameter Optimization via Two-Phase Transfer Learning,9 pages and 2 extra pages of appendix,"Proceedings of the 28th ACM SIGKDD Conference on Knowledge
  Discovery and Data Mining (KDD 2022)",10.1145/3534678.3539255,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the extensive applications of machine learning models, automatic
hyperparameter optimization (HPO) has become increasingly important. Motivated
by the tuning behaviors of human experts, it is intuitive to leverage auxiliary
knowledge from past HPO tasks to accelerate the current HPO task. In this
paper, we propose TransBO, a novel two-phase transfer learning framework for
HPO, which can deal with the complementary nature among source tasks and
dynamics during knowledge aggregation issues simultaneously. This framework
extracts and aggregates source and target knowledge jointly and adaptively,
where the weights can be learned in a principled manner. The extensive
experiments, including static and dynamic transfer learning settings and neural
architecture search, demonstrate the superiority of TransBO over the
state-of-the-arts.
","[{'version': 'v1', 'created': 'Mon, 6 Jun 2022 15:00:33 GMT'}]",2022-06-07,"[['Li', 'Yang', ''], ['Shen', 'Yu', ''], ['Jiang', 'Huaijun', ''], ['Zhang', 'Wentao', ''], ['Yang', 'Zhi', ''], ['Zhang', 'Ce', ''], ['Cui', 'Bin', '']]","['hyperparameter optimization', 'black-box optimization', 'bayesianoptimization', 'transfer learning']"
89,1912.02024,Annalisa Franco,"Annalisa Franco, Antonio Magnani and Dario Maio",Template co-updating in multi-modal human activity recognition systems,,,10.1145/3341105.3374085,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-modal systems are quite common in the context of human activity
recognition; widely used RGB-D sensors (Kinect is the most prominent example)
give access to parallel data streams, typically RGB images, depth data,
skeleton information. The richness of multimodal information has been largely
exploited in many works in the literature, while an analysis of their
effectiveness for incremental template updating has not been investigated so
far. This paper is aimed at defining a general framework for unsupervised
template updating in multi-modal systems, where the different data sources can
provide complementary information, increasing the effectiveness of the updating
procedure and reducing at the same time the probability of incorrect template
modifications.
","[{'version': 'v1', 'created': 'Wed, 4 Dec 2019 14:39:25 GMT'}]",2019-12-05,"[['Franco', 'Annalisa', ''], ['Magnani', 'Antonio', ''], ['Maio', 'Dario', '']]","['Template co-updating', 'Human activity recognition', 'Kinect ® sensor']"
90,1404.3614,Jaroslav Vond\v{r}ejc,"Jaroslav Vond\v{r}ejc, Jan Zeman, Ivo Marek","Guaranteed upper-lower bounds on homogenized properties by FFT-based
  Galerkin method","37 pages, 20 figures","Computer Methods in Applied Mechanics and Engineering, 297, pp.
  258-291, 2015",10.1016/j.cma.2015.09.003,,cs.NA math.NA physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Guaranteed upper-lower bounds on homogenized coefficients, arising from the
periodic cell problem, are calculated in a scalar elliptic setting. Our
approach builds on the recent variational reformulation of the Moulinec-Suquet
(1994) Fast Fourier Transform (FFT) homogenization scheme by Vond\v{r}ejc et
al. (2014), which is based on the conforming Galerkin approximation with
trigonometric polynomials. Upper-lower bounds are obtained by adjusting the
primal-dual finite element framework developed independently by Dvo\v{r}\'{a}k
(1993) and Wieckowski (1995) to the FFT-based Galerkin setting. We show that
the discretization procedure differs for odd and non-odd number of grid points.
Thanks to the Helmholtz decomposition inherited from the continuous
formulation, the duality structure is fully preserved for the odd
discretizations. In the latter case, a more complex primal-dual structure is
observed due to presence of the trigonometric polynomials associated with the
Nyquist frequencies. These theoretical findings are confirmed with numerical
examples. To conclude, the main advantage of the FFT-based approach over
conventional finite-element schemes is that the primal and the dual problems
are treated on the same basis, and this property can be extended beyond the
scalar elliptic setting.
","[{'version': 'v1', 'created': 'Mon, 14 Apr 2014 15:13:41 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Nov 2014 10:58:02 GMT'}, {'version': 'v3', 'created': 'Fri, 17 Apr 2015 15:29:22 GMT'}]",2015-11-06,"[['Vondřejc', 'Jaroslav', ''], ['Zeman', 'Jan', ''], ['Marek', 'Ivo', '']]","['Upper-lower bounds', 'Numerical homogenization', 'Galerkin approximation', 'Trigonometricpolynomials', 'Fast Fourier Transform']"
91,1304.7346,Imran Sarwar Bajwa Dr.,"Imran Sarwar Bajwa, Behzad Bordbar, Mark Lee",SBVR vs OCL: A Comparative Analysis of Standards,"14th IEEE International Multitopic Conference (INMIC 2011),
  pp.261-266, Karachi, Pakistan",,10.1109/INMIC.2011.6151485,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In software modelling, the designers have to produce UML visual models with
software constraints. Similarly, in business modelling, designers have to model
business processes using business constraints (business rules). Constraints are
the key components in the skeleton of business or software models. A designer
has to write constraints to semantically compliment business models or UML
models and finally implementing the constraints into business processes or
source code. Business constraints/rules can be written using SBVR (Semantics of
Business Vocabulary and Rules) while OCL (Object Constraint Language) is the
well-known medium for writing software constraints. SBVR and OCL are two
significant standards from OMG. Both standards are principally different as
SBVR is typically used in business domains and OCL is employed to compliment
software models. However, we have identified a few similarities in both
standards that are interesting to study. In this paper, we have performed a
comparative analysis of both standards as we are looking for a mechanism for
automatic transformation of SBVR to OCL. The major emphasis of the study is to
highlight principal features of SBVR and OCL such as similarities, differences
and key parameters on which these both standards can work together.
","[{'version': 'v1', 'created': 'Sat, 27 Apr 2013 08:17:53 GMT'}]",2013-05-07,"[['Bajwa', 'Imran Sarwar', ''], ['Bordbar', 'Behzad', ''], ['Lee', 'Mark', '']]","['SBVR', 'OCL', 'MDA', 'UML']"
92,2102.11773,Mark Vella,Mark Vella and Christian Colombo,SpotCheck: On-Device Anomaly Detection for Android,,"SIN 2020: 13th International Conference on Security of Information
  and Networks, Merkez, Turkey, November 2020",10.1145/3433174.3433591,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In recent years the PC has been replaced by mobile devices for many security
sensitive operations, both from a privacy and a financial standpoint. While
security mechanisms are deployed at various levels, these are frequently put
under strain by previously unseen malware. An additional protection layer
capable of novelty detection is therefore needed. In this work we propose
SpotCheck, an anomaly detector intended to run on Android devices. It samples
app executions and submits suspicious apps to more thorough processing by
malware sandboxes. We compare Kernel Principal Component Analysis (KPCA) and
Variational Autoencoders (VAE) on app execution representations based on the
well-known system call traces, as well as a novel approach based on memory
dumps. Results show that when using VAE, SpotCheck attains a level of
effectiveness comparable to what has been previously achieved for network
anomaly detection. Interestingly this is also true for the memory dump
approach, relinquishing the need for continuous app monitoring.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2021 16:09:35 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Feb 2021 06:53:27 GMT'}]",2021-02-26,"[['Vella', 'Mark', ''], ['Colombo', 'Christian', '']]","['Android malware', 'anomaly detection', 'memory dump analysis', 'kernel PCA', 'variational autoencoders']"
93,1803.06615,Qiang Hao,"Ewan Wright, Qiang Hao, Khaled Rasheed, Yan Liu","Feature Selection of Post-Graduation Income of College Students in the
  United States","14 pages, 6 tables, 3 figures","SBP-BRiMS 2018: Social, Cultural, and Behavioral Modeling, pp
  38-45",10.1007/978-3-319-93372-6_4,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study investigated the most important attributes of the 6-year
post-graduation income of college graduates who used financial aid during their
time at college in the United States. The latest data released by the United
States Department of Education was used. Specifically, 1,429 cohorts of
graduates from three years (2001, 2003, and 2005) were included in the data
analysis. Three attribute selection methods, including filter methods, forward
selection, and Genetic Algorithm, were applied to the attribute selection from
30 relevant attributes. Five groups of machine learning algorithms were applied
to the dataset for classification using the best selected attribute subsets.
Based on our findings, we discuss the role of neighborhood professional degree
attainment, parental income, SAT scores, and family college education in
post-graduation incomes and the implications for social stratification.
","[{'version': 'v1', 'created': 'Sun, 18 Mar 2018 07:06:19 GMT'}, {'version': 'v2', 'created': 'Mon, 28 May 2018 06:37:48 GMT'}]",2018-07-06,"[['Wright', 'Ewan', ''], ['Hao', 'Qiang', ''], ['Rasheed', 'Khaled', ''], ['Liu', 'Yan', '']]","['Attribute selection', 'feature selection', 'post-graduation income classification', 'post-graduation income prediction', 'social stratification']"
94,1709.04864,Eduardo Aguilar,"Eduardo Aguilar, Marc Bola\~nos, Petia Radeva",Food Recognition using Fusion of Classifiers based on CNNs,,ICIAP 10485 (2017) 213-224,10.1007/978-3-319-68548-9_20,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the arrival of convolutional neural networks, the complex problem of
food recognition has experienced an important improvement in recent years. The
best results have been obtained using methods based on very deep convolutional
neural networks, which show that the deeper the model,the better the
classification accuracy will be obtain. However, very deep neural networks may
suffer from the overfitting problem. In this paper, we propose a combination of
multiple classifiers based on different convolutional models that complement
each other and thus, achieve an improvement in performance. The evaluation of
our approach is done on two public datasets: Food-101 as a dataset with a wide
variety of fine-grained dishes, and Food-11 as a dataset of high-level food
categories, where our approach outperforms the independent CNN models.
","[{'version': 'v1', 'created': 'Thu, 14 Sep 2017 16:35:40 GMT'}]",2018-01-23,"[['Aguilar', 'Eduardo', ''], ['Bolaños', 'Marc', ''], ['Radeva', 'Petia', '']]","['Food Recognition', 'Fusion Classifiers', 'CNN']"
95,1008.1657,EPTCS,"Xiaoxue Piao, Kai Salomaa",Operational State Complexity of Deterministic Unranked Tree Automata,"In Proceedings DCFS 2010, arXiv:1008.1270","EPTCS 31, 2010, pp. 149-158",10.4204/EPTCS.31.17,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the state complexity of basic operations on tree languages
recognized by deterministic unranked tree automata. For the operations of union
and intersection the upper and lower bounds of both weakly and strongly
deterministic tree automata are obtained. For tree concatenation we establish a
tight upper bound that is of a different order than the known state complexity
of concatenation of regular string languages. We show that (n+1) (
(m+1)2^n-2^(n-1) )-1 vertical states are sufficient, and necessary in the worst
case, to recognize the concatenation of tree languages recognized by (strongly
or weakly) deterministic automata with, respectively, m and n vertical states.
","[{'version': 'v1', 'created': 'Tue, 10 Aug 2010 08:33:49 GMT'}]",2010-08-11,"[['Piao', 'Xiaoxue', ''], ['Salomaa', 'Kai', '']]","['operational state complexity', 'tree automata', 'unranked trees', 'tree operations']"
96,1805.10978,Marco di Biase,"Marco di Biase, Magiel Bruntink, Arie van Deursen, Alberto Bacchelli","The effects of change decomposition on code review -- a controlled
  experiment",,,10.7717/peerj-cs.193,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Code review is a cognitively demanding and time-consuming
process. Previous qualitative studies hinted at how decomposing change sets
into multiple yet internally coherent ones would improve the reviewing process.
So far, literature provided no quantitative analysis of this hypothesis.
  Aims: (1) Quantitatively measure the effects of change decomposition on the
outcome of code review (in terms of number of found defects, wrongly reported
issues, suggested improvements, time, and understanding); (2) Qualitatively
analyze how subjects approach the review and navigate the code, building
knowledge and addressing existing issues, in large vs. decomposed changes.
  Method: Controlled experiment using the pull-based development model
involving 28 software developers among professionals and graduate students.
  Results: Change decomposition leads to fewer wrongly reported issues,
influences how subjects approach and conduct the review activity (by increasing
context-seeking), yet impacts neither understanding the change rationale nor
the number of found defects.
  Conclusions: Change decomposition reduces the noise for subsequent data
analyses but also significantly supports the tasks of the developers in charge
of reviewing the changes. As such, commits belonging to different concepts
should be separated, adopting this as a best practice in software engineering.
","[{'version': 'v1', 'created': 'Mon, 28 May 2018 15:34:45 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Jan 2020 16:06:31 GMT'}]",2020-01-22,"[['di Biase', 'Marco', ''], ['Bruntink', 'Magiel', ''], ['van Deursen', 'Arie', ''], ['Bacchelli', 'Alberto', '']]","['Code review', 'Controlled experiment', 'Change decomposition', 'Pull-baseddevelopment model']"
97,1309.3676,Nicolae Cleju,Nicolae Cleju,"Optimized projections for compressed sensing via rank-constrained
  nearest correlation matrix","25 pages, 13 figures, to appear in Applied and Computational Harmonic
  Analysis",,10.1016/j.acha.2013.08.005,,cs.IT cs.LG math.IT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optimizing the acquisition matrix is useful for compressed sensing of signals
that are sparse in overcomplete dictionaries, because the acquisition matrix
can be adapted to the particular correlations of the dictionary atoms. In this
paper a novel formulation of the optimization problem is proposed, in the form
of a rank-constrained nearest correlation matrix problem. Furthermore,
improvements for three existing optimization algorithms are introduced, which
are shown to be particular instances of the proposed formulation. Simulation
results show notable improvements and superior robustness in sparse signal
recovery.
","[{'version': 'v1', 'created': 'Sat, 14 Sep 2013 15:08:48 GMT'}]",2013-09-17,"[['Cleju', 'Nicolae', '']]","['acquisition', 'compressed sensing', 'nearest correlation matrix', 'optimization']"
98,1408.3110,Surender Kumar,"Surender Kumar, Manish Prateek, N.J. Ahuja, Bharat Bhushan","MEECDA: Multihop Energy Efficient Clustering and Data Aggregation
  Protocol for HWSN","8 pages, 11 figures. available at http://ijcaonline.org/2014. arXiv
  admin note: substantial text overlap with arXiv:1408.2914",,10.5120/15383-4047,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Wireless sensor network consists of large number of inexpensive tiny sensors
which are connected with low power wireless communications. Most of the routing
and data dissemination protocols of WSN assume a homogeneous network
architecture, in which all sensors have the same capabilities in terms of
battery power, communication, sensing, storage, and processing. However the
continued advances in miniaturization of processors and low-power
communications have enabled the development of a wide variety of nodes. When
more than one type of node is integrated into a WSN, it is called
heterogeneous. Multihop short distance communication is an important scheme to
reduce the energy consumption in a sensor network because nodes are densely
deployed in a WSN. In this paper M-EECDA (Multihop Energy Efficient Clustering
& Data Aggregation Protocol for Heterogeneous WSN) is proposed and analyzed.
The protocol combines the idea of multihop communications and clustering for
achieving the best performance in terms of network life and energy consumption.
M-EECDA introduces a sleep state and three tier architecture for some cluster
heads to save energy of the network. M-EECDA consists of three types of sensor
nodes: normal, advance and super. To become cluster head in a round normal
nodes use residual energy based scheme. Advance and super nodes further act as
relay node to reduce the transmission load of a normal node cluster head when
they are not cluster heads in a round.
","[{'version': 'v1', 'created': 'Wed, 13 Aug 2014 05:44:44 GMT'}]",2015-06-22,"[['Kumar', 'Surender', ''], ['Prateek', 'Manish', ''], ['Ahuja', 'N. J.', ''], ['Bhushan', 'Bharat', '']]","['Cluster', 'Energy Efficiency', 'Multihop', 'Initial Energy', 'Residual Energy', 'Wireless Sensor Network']"
99,1302.6339,EPTCS,"Maribel Fern\'andez, Ian Mackie, Matthew Walker",Bigraphical Nets,"In Proceedings TERMGRAPH 2013, arXiv:1302.5997","EPTCS 110, 2013, pp. 74-81",10.4204/EPTCS.110.8,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interaction nets are a graphical model of computation, which has been used to
define efficient evaluators for functional calculi, and specifically lambda
calculi with patterns. However, the flat structure of interaction nets forces
pattern matching and functional behaviour to be encoded at the same level,
losing some potential parallelism. In this paper, we introduce bigraphical
nets, or binets for short, as a generalisation of interaction nets using ideas
from bigraphs and port graphs, and we present a formal notation and operational
semantics for binets. We illustrate their expressive power by examples of
applications.
","[{'version': 'v1', 'created': 'Tue, 26 Feb 2013 06:50:45 GMT'}]",2013-02-27,"[['Fernández', 'Maribel', ''], ['Mackie', 'Ian', ''], ['Walker', 'Matthew', '']]","['Interaction Net', 'Port Graph', 'Bigraph', 'Rewriting Calculus']"
100,1405.0786,Vishal Anand,"Vishal Anand, Ramani S","Fault Localization in a Software Project using Back-Tracking Principles
  of Matrix Dependency","5 pages, 8 figures, ""Published with International Journal of
  Engineering Trends and Technology (IJETT)""","Vishal Anand , Ramani S Article: ""Fault Localization in a Software
  Project using Back-Tracking Principles of Matrix Dependency"". International
  Journal of Engineering Trends and Technology (IJETT) V10(11):545-549, April
  2014. ISSN:2231-5381",10.14445/22315381/IJETT-V10P308,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fault identification and testing has always been the most specific concern in
the field of software development. To identify and testify the bug we should be
aware of the source of the failure or any unwanted issue. In this paper, we are
trying to extract the location of failure and trying to cope up with the bug.
Using directed graph, we tried to obtain the dependency of multiple activities
in live environment to trace the origin of fault. Software development comes up
with series of activities and we tried to show the dependency of multiple
activities on each other. Critical activities are considered as they cause
abnormal functioning of the whole system. The paper discuss about the
priorities of activities of dependency of software failure on the critical
activities. Matrix representation of activities as part of the software is
chosen to determine root of the failure using concept of dependency. It can
vary with the topography of network and software environment. When faults
occur, the possible symptoms will be reflected in the dependency matrix with
high probability in fault itself. Thus, independent faults are located in the
main diagonal of dependency matrix.
","[{'version': 'v1', 'created': 'Mon, 5 May 2014 06:22:08 GMT'}]",2014-05-06,"[['Anand', 'Vishal', ''], ['S', 'Ramani', '']]","['Software', 'Dependency', 'Matrix', 'Bug', 'Critical Activity', 'Modules']"
101,1210.2282,Miguel Areias,Miguel Areias and Ricardo Rocha,Towards Multi-Threaded Local Tabling Using a Common Table Space,To appear in Theory and Practice of Logic Programming,"Theory and Practice of Logic Programming, Volume 12, Special Issue
  4-5, 2012, pp 427-443",10.1017/S1471068412000117,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-threading is currently supported by several well-known Prolog systems
providing a highly portable solution for applications that can benefit from
concurrency. When multi-threading is combined with tabling, we can exploit the
power of higher procedural control and declarative semantics. However, despite
the availability of both threads and tabling in some Prolog systems, the
implementation of these two features implies complex ties to each other and to
the underlying engine. Until now, XSB was the only Prolog system combining
multi-threading with tabling. In XSB, tables may be either private or shared
between threads. While thread-private tables are easier to implement, shared
tables have all the associated issues of locking, synchronization and potential
deadlocks. In this paper, we propose an alternative view to XSB's approach. In
our proposal, each thread views its tables as private but, at the engine level,
we use a common table space where tables are shared among all threads. We
present three designs for our common table space approach: No-Sharing (NS)
(similar to XSB's private tables), Subgoal-Sharing (SS) and Full-Sharing (FS).
The primary goal of this work was to reduce the memory usage for the table
space but, our experimental results, using the YapTab tabling system with a
local evaluation strategy, show that we can also achieve significant reductions
on running time.
","[{'version': 'v1', 'created': 'Mon, 8 Oct 2012 14:00:07 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Oct 2012 22:12:00 GMT'}]",2012-10-11,"[['Areias', 'Miguel', ''], ['Rocha', 'Ricardo', '']]","['Tabling', 'Multi-Threading', 'Implementation']"
102,2102.10777,Tejas Khare,"Tejas Khare, Vaibhav Bahel and Anuradha C. Phadke",PCB-Fire: Automated Classification and Fault Detection in PCB,"6 Pages, 9 Figures, Conference","Proceeding Reference - 978-0-7381-4335-4/20/$31.00
  \c{opyright}2020 IEEE",10.1109/MPCIT51588.2020.9350324,,cs.CV eess.IV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Printed Circuit Boards are the foundation for the functioning of any
electronic device, and therefore are an essential component for various
industries such as automobile, communication, computation, etc. However, one of
the challenges faced by the PCB manufacturers in the process of manufacturing
of the PCBs is the faulty placement of its components including missing
components. In the present scenario the infrastructure required to ensure
adequate quality of the PCB requires a lot of time and effort. The authors
present a novel solution for detecting missing components and classifying them
in a resourceful manner. The presented algorithm focuses on pixel theory and
object detection, which has been used in combination to optimize the results
from the given dataset.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2021 05:19:22 GMT'}]",2021-02-23,"[['Khare', 'Tejas', ''], ['Bahel', 'Vaibhav', ''], ['Phadke', 'Anuradha C.', '']]","['Convolutional Neural Networks', 'Object Detection', 'Image processing', 'Automatic Optical Inspection (AOI)', 'YOLOv3']"
103,1708.00777,Zheng Li,"Zheng Li, Selome Tesfatsion, Saeed Bastani, Ahmed Ali-Eldin, Erik
  Elmroth, Maria Kihl, Rajiv Ranjan","A Survey on Modeling Energy Consumption of Cloud Applications:
  Deconstruction, State of the Art, and Trade-off Debates",in press,"IEEE Transactions on Sustainable Computing, 2017",10.1109/TSUSC.2017.2722822,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given the complexity and heterogeneity in Cloud computing scenarios, the
modeling approach has widely been employed to investigate and analyze the
energy consumption of Cloud applications, by abstracting real-world objects and
processes that are difficult to observe or understand directly. It is clear
that the abstraction sacrifices, and usually does not need, the complete
reflection of the reality to be modeled. Consequently, current energy
consumption models vary in terms of purposes, assumptions, application
characteristics and environmental conditions, with possible overlaps between
different research works. Therefore, it would be necessary and valuable to
reveal the state-of-the-art of the existing modeling efforts, so as to weave
different models together to facilitate comprehending and further investigating
application energy consumption in the Cloud domain. By systematically
selecting, assessing and synthesizing 76 relevant studies, we rationalized and
organized over 30 energy consumption models with unified notations. To help
investigate the existing models and facilitate future modeling work, we
deconstructed the runtime execution and deployment environment of Cloud
applications, and identified 18 environmental factors and 12 workload factors
that would be influential on the energy consumption. In particular, there are
complicated trade-offs and even debates when dealing with the combinational
impacts of multiple factors.
","[{'version': 'v1', 'created': 'Wed, 2 Aug 2017 14:45:47 GMT'}]",2017-08-03,"[['Li', 'Zheng', ''], ['Tesfatsion', 'Selome', ''], ['Bastani', 'Saeed', ''], ['Ali-Eldin', 'Ahmed', ''], ['Elmroth', 'Erik', ''], ['Kihl', 'Maria', ''], ['Ranjan', 'Rajiv', '']]","['Application energy consumption', 'Cloud computing', 'energyconsumption modeling', 'energy-related factors', 'systematic literature review']"
104,1804.05935,Qian Feng,Qian Feng and Sing Kiong Nguang,"Dissipative delay range analysis of coupled differential-difference
  delay systems with distributed delays",,"Systems and Control Letters, 2018, 116, 56 - 65",10.1016/j.sysconle.2018.04.008,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes methods to handle the problem of delay range stability
analysis for a linear coupled differential-difference system (CDDS) with
distributed delays subject to dissipative constraints. The model of linear CDDS
contains many models of linear delay systems as special cases. A novel
Liapunov-Krasovskii functional with non-constant matrix parameters, which are
related to the delay value polynomially, is applied to derive stability
conditions. By constructing this new functional, sufficient conditions in terms
of robust linear matrix inequalities (LMIs) can be derived, which guarantee
range stability of a linear CDDS subject to dissipative constraints. To solve
the resulting robust LMIs numerically, we apply the technique of sum of squares
programming together with matrix relaxations without introducing any potential
conservatism to the original robust LMIs. Furthermore, the proposed methods can
be extended to solve delay margin estimation problems for a linear CDDS subject
to prescribed dissipative constraints. Finally, numerical examples are
presented to demonstrate the effectiveness of the proposed methodologies.
","[{'version': 'v1', 'created': 'Mon, 16 Apr 2018 20:54:58 GMT'}, {'version': 'v2', 'created': 'Mon, 14 May 2018 13:42:42 GMT'}, {'version': 'v3', 'created': 'Wed, 20 Jun 2018 02:12:05 GMT'}]",2018-06-21,"[['Feng', 'Qian', ''], ['Nguang', 'Sing Kiong', '']]","['Coupled Differential-Difference Systems', 'Range stability', 'Dissipativity', 'Sum of Squareprogramming']"
105,1711.05296,Thomas Pasquier,"Thomas Pasquier, Xueyuan Han, Mark Goldstein, Thomas Moyer, David
  Eyers, Margo Seltzer and Jean Bacon",Practical Whole-System Provenance Capture,"15 pages, 7 figures",SoCC '17 Proceedings of the 2017 Symposium on Cloud Computing,10.1145/3127479.3129249,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data provenance describes how data came to be in its present form. It
includes data sources and the transformations that have been applied to them.
Data provenance has many uses, from forensics and security to aiding the
reproducibility of scientific experiments. We present CamFlow, a whole-system
provenance capture mechanism that integrates easily into a PaaS offering. While
there have been several prior whole-system provenance systems that captured a
comprehensive, systemic and ubiquitous record of a system's behavior, none have
been widely adopted. They either A) impose too much overhead, B) are designed
for long-outdated kernel releases and are hard to port to current systems, C)
generate too much data, or D) are designed for a single system. CamFlow
addresses these shortcoming by: 1) leveraging the latest kernel design advances
to achieve efficiency; 2) using a self-contained, easily maintainable
implementation relying on a Linux Security Module, NetFilter, and other
existing kernel facilities; 3) providing a mechanism to tailor the captured
provenance data to the needs of the application; and 4) making it easy to
integrate provenance across distributed systems. The provenance we capture is
streamed and consumed by tenant-built auditor applications. We illustrate the
usability of our implementation by describing three such applications:
demonstrating compliance with data regulations; performing fault/intrusion
detection; and implementing data loss prevention. We also show how CamFlow can
be leveraged to capture meaningful provenance without modifying existing
applications.
","[{'version': 'v1', 'created': 'Tue, 14 Nov 2017 19:46:16 GMT'}]",2017-11-16,"[['Pasquier', 'Thomas', ''], ['Han', 'Xueyuan', ''], ['Goldstein', 'Mark', ''], ['Moyer', 'Thomas', ''], ['Eyers', 'David', ''], ['Seltzer', 'Margo', ''], ['Bacon', 'Jean', '']]","['Data Provenance', 'Whole-system provenance', 'Linux Kernel']"
106,1603.09434,Ibrahim AlShourbaji H,"Ibrahim AlShourbaji, Samaher Al-Janabi and Ahmed Patel",Document Selection in a Distributed Search Engine Architecture,"8 pages, 6 figures in Middle-East Journal of Scientific Research,
  IDOSI Publications, 2015",,10.5829/idosi.mejsr.2015.23.07.22398,,cs.IR cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed Search Engine Architecture (DSEA) hosts numerous independent
topic-specific search engines and selects a subset of the databases to search
within the architecture. The objective of this approach is to reduce the amount
of space needed to perform a search by querying only a subset of the total data
available. In order to manipulate data across many databases, it is most
efficient to identify a smaller subset of databases that would be most likely
to return the data of specific interest that can then be examined in greater
detail. The selection index has been most commonly used as a method for
choosing the most applicable databases as it captures broad information about
each database and its indexed documents. Employing this type of database allows
the researcher to find information more quickly, not only with less cost, but
it also minimizes the potential for biases. This paper investigates the
effectiveness of different databases selected within the framework and scope of
the distributed search engine architecture. The purpose of the study is to
improve the quality of distributed information retrieval.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2016 01:19:21 GMT'}]",2016-04-01,"[['AlShourbaji', 'Ibrahim', ''], ['Al-Janabi', 'Samaher', ''], ['Patel', 'Ahmed', '']]","['web search', 'distributed search engine', 'document selection', 'information retrieval', 'Collection Retrival Inference network  1']"
107,1204.2225,Sandhyarani Ramancha,"Ramancha Sandhyarani, Bodakuntla Rajkumar and Jayadev Gyani",Construction of Community Web Directories based on Web usage Data,"8 pages,5 figures","Advanced Computing: An International Journal (ACIJ), Vol.3, No.2,
  March 2012",10.5121/acij.2012.3205,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper support the concept of a community Web directory, as a Web
directory that is constructed according to the needs and interests of
particular user communities. Furthermore, it presents the complete method for
the construction of such directories by using web usage data. User community
models take the form of thematic hierarchies and are constructed by employing
clustering approach. We applied our methodology to the ODP directory and also
to an artificial Web directory, which was generated by clustering Web pages
that appear in the access log of an Internet Service Provider. For the
discovery of the community models, we introduced a new criterion that combines
a priori thematic informativeness of the Web directory categories with the
level of interest observed in the usage data. In this context, we introduced
and evaluated new clustering method. We have tested the methodology using
access log files which are collected from the proxy servers of an Internet
Service Provider and provided results that indicates the usability of the
community Web directories. The proposed clustering methodology is evaluated
both on a specialized artificial and a community Web directory, indicating its
value to the user of the web.
","[{'version': 'v1', 'created': 'Tue, 10 Apr 2012 17:28:39 GMT'}]",2012-04-11,"[['Sandhyarani', 'Ramancha', ''], ['Rajkumar', 'Bodakuntla', ''], ['Gyani', 'Jayadev', '']]","['web directory', 'user communities', 'Internet service Provider', 'clustering', 'Open Directory Project…']"
108,2105.09448,Tirtharaj Dash,"Gunjan Chhablani, Abheesht Sharma, Harshit Pandey, Tirtharaj Dash","Superpixel-based Knowledge Infusion in Deep Neural Networks for Image
  Classification","ACM Proc. format: 5 pages; Accepted at ACM SE'22, April 18-20, 2022,
  Virtual Event, USA","Proceedings of the 2022 ACM Southeast Conference, April 2022,
  Pages 243-247",10.1145/3476883.3520216,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Superpixels are higher-order perceptual groups of pixels in an image, often
carrying much more information than the raw pixels. There is an inherent
relational structure to the relationship among different superpixels of an
image such as adjacent superpixels are neighbours of each other. Our interest
here is to treat these relative positions of various superpixels as relational
information of an image. This relational information can convey higher-order
spatial information about the image, such as the relationship between
superpixels representing two eyes in an image of a cat. That is, two eyes are
placed adjacent to each other in a straight line or the mouth is below the
nose. Our motive in this paper is to assist computer vision models,
specifically those based on Deep Neural Networks (DNNs), by incorporating this
higher-order information from superpixels. We construct a hybrid model that
leverages (a) Convolutional Neural Network (CNN) to deal with spatial
information in an image and (b) Graph Neural Network (GNN) to deal with
relational superpixel information in the image. The proposed model is learned
using a generic hybrid loss function. Our experiments are extensive, and we
evaluate the predictive performance of our proposed hybrid vision model on
seven different image classification datasets from a variety of domains such as
digit and object recognition, biometrics, medical imaging. The results
demonstrate that the relational superpixel information processed by a GNN can
improve the performance of a standard CNN-based vision system.
","[{'version': 'v1', 'created': 'Thu, 20 May 2021 01:25:42 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Feb 2022 09:22:22 GMT'}]",2022-05-23,"[['Chhablani', 'Gunjan', ''], ['Sharma', 'Abheesht', ''], ['Pandey', 'Harshit', ''], ['Dash', 'Tirtharaj', '']]","['Knowledge-Infused Learning', 'Graph Neural Networks', 'Convolutional Neural Networks', 'Superpixels', 'SLIC']"
109,1301.4313,Pierre Lairez,"Alin Bostan (INRIA Saclay - Ile de France), Pierre Lairez (INRIA
  Saclay - Ile de France), Bruno Salvy (Inria Grenoble Rh\^one-Alpes / LIP
  Laboratoire de l'Informatique du Parall\'elisme)","Creative telescoping for rational functions using the Griffiths-Dwork
  method",,"Proceedings of ISSAC 2013, ACM, pp 93-100",10.1145/2465506.2465935,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Creative telescoping algorithms compute linear differential equations
satisfied by multiple integrals with parameters. We describe a precise and
elementary algorithmic version of the Griffiths-Dwork method for the creative
telescoping of rational functions. This leads to bounds on the order and degree
of the coefficients of the differential equation, and to the first complexity
result which is simply exponential in the number of variables. One of the
important features of the algorithm is that it does not need to compute
certificates. The approach is vindicated by a prototype implementation.
","[{'version': 'v1', 'created': 'Fri, 18 Jan 2013 07:40:01 GMT'}, {'version': 'v2', 'created': 'Sun, 21 Apr 2013 06:22:26 GMT'}]",2014-05-09,"[['Bostan', 'Alin', '', 'INRIA Saclay - Ile de France'], ['Lairez', 'Pierre', '', 'INRIA\n  Saclay - Ile de France'], ['Salvy', 'Bruno', '', ""Inria Grenoble Rhône-Alpes / LIP\n  Laboratoire de l'Informatique du Parallélisme""]]","['Integration', 'creative telescoping', 'algorithms', 'complexity', 'Picard-Fuchs equation', 'Griffiths–Dwork method']"
110,1709.03793,Shubham Dokania,"Shubham Dokania, Sunyam Bagga, Rohit Sharma","Opportunistic Self Organizing Migrating Algorithm for Real-Time Dynamic
  Traveling Salesman Problem","6 pages, published in CISS 2017",,10.1109/CISS.2017.7926065,,cs.NE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Self Organizing Migrating Algorithm (SOMA) is a meta-heuristic algorithm
based on the self-organizing behavior of individuals in a simulated social
environment. SOMA performs iterative computations on a population of potential
solutions in the given search space to obtain an optimal solution. In this
paper, an Opportunistic Self Organizing Migrating Algorithm (OSOMA) has been
proposed that introduces a novel strategy to generate perturbations
effectively. This strategy allows the individual to span across more possible
solutions and thus, is able to produce better solutions. A comprehensive
analysis of OSOMA on multi-dimensional unconstrained benchmark test functions
is performed. OSOMA is then applied to solve real-time Dynamic Traveling
Salesman Problem (DTSP). The problem of real-time DTSP has been stipulated and
simulated using real-time data from Google Maps with a varying cost-metric
between any two cities. Although DTSP is a very common and intuitive model in
the real world, its presence in literature is still very limited. OSOMA
performs exceptionally well on the problems mentioned above. To substantiate
this claim, the performance of OSOMA is compared with SOMA, Differential
Evolution and Particle Swarm Optimization.
","[{'version': 'v1', 'created': 'Tue, 12 Sep 2017 11:47:07 GMT'}]",2017-09-13,"[['Dokania', 'Shubham', ''], ['Bagga', 'Sunyam', ''], ['Sharma', 'Rohit', '']]","['Dynamic Traveling Salesman Problem', 'Evolutionary Algorithms', 'Optimization', 'Self Organizing Migrating Algorithm']"
111,1210.2877,Dimitris Arabadjis,"Constantin Papaodysseus, Dimitris Arabadjis, Michalis Exarhos,
  Panayiotis Rousopoulos, Solomon Zannos, Michail Panagopoulos and Lena
  Papazoglou-Manioudaki","Efficient Solution to the 3D Problem of Automatic Wall Paintings
  Reassembly",,"Mathematics & Computers with Applications, vol. 64, pp. 2712-2734,
  2012",10.1016/j.bbr.2011.03.031,,cs.CV math.DG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a new approach for the automated reconstruction -
reassembly of fragmented objects having one surface near to plane, on the basis
of the 3D representation of their constituent fragments. The whole process
starts by 3D scanning of the available fragments. The obtained representations
are properly processed so that they can be tested for possible matches. Next,
four novel criteria are introduced, that lead to the determination of pairs of
matching fragments. These criteria have been chosen so as the whole process
imitates the instinctive reassembling method dedicated scholars apply. The
first criterion exploits the volume of the gap between two properly placed
fragments. The second one considers the fragments' overlapping in each possible
matching position. Criteria 3,4 employ principles from calculus of variations
to obtain bounds for the area and the mean curvature of the contact surfaces
and the length of contact curves, which must hold if the two fragments match.
The method has been applied, with great success, both in the reconstruction of
objects artificially broken by the authors and, most importantly, in the
virtual reassembling of parts of wall paintings belonging to the Mycenaic
civilization (c. 1300 B.C.), excavated in a highly fragmented condition in
Tyrins, Greece.
","[{'version': 'v1', 'created': 'Wed, 10 Oct 2012 11:41:12 GMT'}]",2012-10-11,"[['Papaodysseus', 'Constantin', ''], ['Arabadjis', 'Dimitris', ''], ['Exarhos', 'Michalis', ''], ['Rousopoulos', 'Panayiotis', ''], ['Zannos', 'Solomon', ''], ['Panagopoulos', 'Michail', ''], ['Papazoglou-Manioudaki', 'Lena', '']]","['fragmented objects reassembly', 'wall paintings reconstruction', 'pattern']"
112,1907.12653,Timo Koch,"Timo Koch, Rainer Helmig, Martin Schneider","A new and consistent well model for one-phase flow in anisotropic porous
  media using a distributed source model","28 pages, 12 figures",,10.1016/j.jcp.2020.109369,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new well model for one-phase flow in anisotropic porous media is
introduced, where the mass exchange between well and a porous medium is modeled
by spatially distributed source terms over a small neighborhood region. To this
end, we first present a compact derivation of the exact analytical solution for
an arbitrarily oriented, infinite well cylinder in an infinite porous medium
with anisotropic permeability tensor in R3 , for constant well pressure and a
given injection rate, using a conformal map. The analytical solution motivates
the choice of a kernel function to distribute the sources. The presented model
is independent from the discretization method and the choice of computational
grids. In numerical experiments, the new well model is shown to be consistent
and robust with respect to rotation of the well axis, rotation of the
permeability tensor, and different anisotropy ratios. Finally, a comparison
with a Peaceman-type well model suggests that the new scheme leads to an
increased accuracy for injection (and production) rates for
arbitrarily-oriented pressure-controlled wells.
","[{'version': 'v1', 'created': 'Fri, 26 Jul 2019 12:46:32 GMT'}]",2020-03-23,"[['Koch', 'Timo', ''], ['Helmig', 'Rainer', ''], ['Schneider', 'Martin', '']]","['well model', '1d-3d', 'mixed-dimension', 'anisotropic', 'analytic solution', 'Peaceman']"
113,1607.01249,Paul Springer,"Paul Springer, Aravind Sankaran, Paolo Bientinesi",TTC: A Tensor Transposition Compiler for Multiple Architectures,,,10.1145/2935323.2935328,,cs.MS cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of transposing tensors of arbitrary dimension and
describe TTC, an open source domain-specific parallel compiler. TTC generates
optimized parallel C++/CUDA C code that achieves a significant fraction of the
system's peak memory bandwidth. TTC exhibits high performance across multiple
architectures, including modern AVX-based systems (e.g.,~Intel Haswell, AMD
Steamroller), Intel's Knights Corner as well as different CUDA-based GPUs such
as NVIDIA's Kepler and Maxwell architectures. We report speedups of TTC over a
meaningful baseline implementation generated by external C++ compilers; the
results suggest that a domain-specific compiler can outperform its general
purpose counterpart significantly: For instance, comparing with Intel's latest
C++ compiler on the Haswell and Knights Corner architecture, TTC yields
speedups of up to $8\times$ and $32\times$, respectively. We also showcase
TTC's support for multiple leading dimensions, making it a suitable candidate
for the generation of performance-critical packing functions that are at the
core of the ubiquitous BLAS 3 routines.
","[{'version': 'v1', 'created': 'Tue, 5 Jul 2016 13:53:57 GMT'}]",2016-07-06,"[['Springer', 'Paul', ''], ['Sankaran', 'Aravind', ''], ['Bientinesi', 'Paolo', '']]","['domain-specific compiler', 'multidimensional transpositions', 'high-performance computing', 'SIMD', 'tensors']"
114,1309.5502,Washington Alves de Oliveira,"Washington Alves de Oliveira, Antonio Carlos Moretti and Ednei Felix
  Reis","The multi-vehicle covering tour problem: building routes for urban
  patrolling","28 pages, 8 figures, 7 tables, Brazilian Operations Research Society;
  Printed version ISSN 0101-7438 / Online version ISSN 1678-5142",Pesquisa Operacional (2015) 35(3): 617-644,10.1590/0101-7438.2015.035.03.0617,,cs.AI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we study a particular aspect of the urban community policing:
routine patrol route planning. We seek routes that guarantee visibility, as
this has a sizable impact on the community perceived safety, allowing quick
emergency responses and providing surveillance of selected sites (e.g.,
hospitals, schools). The planning is restricted to the availability of vehicles
and strives to achieve balanced routes. We study an adaptation of the model for
the multi-vehicle covering tour problem, in which a set of locations must be
visited, whereas another subset must be close enough to the planned routes. It
constitutes an NP-complete integer programming problem. Suboptimal solutions
are obtained with several heuristics, some adapted from the literature and
others developed by us. We solve some adapted instances from TSPLIB and an
instance with real data, the former being compared with results from
literature, and latter being compared with empirical data.
","[{'version': 'v1', 'created': 'Sat, 21 Sep 2013 17:17:46 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Sep 2016 23:16:49 GMT'}]",2016-09-16,"[['de Oliveira', 'Washington Alves', ''], ['Moretti', 'Antonio Carlos', ''], ['Reis', 'Ednei Felix', '']]","['Vehicle routing', 'Covering tour problem', 'Heuristics', 'Urban patrolling']"
115,1302.1756,Anastasios Kavoukis,"Anastasios Kavoukis, Salem Aljareh","Efficient time synchronized one-time password scheme to provide secure
  wake-up authentication on wireless sensor networks","International Journal Of Advanced Smart Sensor Network Systems
  (IJASSN), Vol 3, No.1, January 2013
  http://airccse.org/journal/ijassn/papers/3113ijassn01.pdf",,10.5121/ijassn.2013.3101,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose Time Synchronized One-Time-Password scheme to
provide secure wake up authentication. The main constraint of wireless sensor
networks is their limited power resource that prevents us from using radio
transmission over the network to transfer the passwords. On the other hand
computation power consumption is insignificant when compared to the costs
associated with the power needed for transmitting the right set of keys. In
addition to prevent adversaries from reading and following the timeline of the
network, we propose to encrypt the tokens using symmetric encryption to prevent
replay attacks.
","[{'version': 'v1', 'created': 'Thu, 7 Feb 2013 14:24:51 GMT'}]",2013-02-08,"[['Kavoukis', 'Anastasios', ''], ['Aljareh', 'Salem', '']]","['Wake-up', 'Security', 'Wireless Sensor Networks', 'One-Time Password']"
116,1401.4282,"J\""urgen M\""unch","Mart\'in Soto, Alexis Ocampo, J\""urgen M\""unch","The Secret Life of a Process Description: A Look into the Evolution of a
  Large Process Model","12 pages. The final publication is available at
  http://link.springer.com/chapter/10.1007%2F978-3-540-79588-9_23","Making Globally Distributed Software Development a Success Story,
  volume 5007 of Lecture Notes in Computer Science, pages 257-268, Springer
  Berlin Heidelberg, 2008",10.1007/978-3-540-79588-9_23,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software process models must change continuously in order to remain
consistent over time with the reality they represent, as well as relevant to
the task they are intended for. Performing these changes in a sound and disci-
plined fashion requires software process model evolution to be understood and
controlled. The current situation can be characterized by a lack of
understanding of software process model evolution and, in consequence, by a
lack of systematic support for evolving software process models in
organizations. This paper presents an analysis of the evolution of a large
software process standard, namely, the process standard for the German Federal
Government (V-Modell(R) XT). The analysis was performed with the Evolyzer tool
suite, and is based on the complete history of over 600 versions that have been
created during the development and maintenance of the standard. The analysis
reveals similarities and differences between process evolution and empirical
findings in the area of software system evolution. These findings provide hints
on how to better manage process model evolution in the future.
","[{'version': 'v1', 'created': 'Fri, 17 Jan 2014 09:33:31 GMT'}]",2014-01-20,"[['Soto', 'Martín', ''], ['Ocampo', 'Alexis', ''], ['Münch', 'Jürgen', '']]","['process modeling', 'process model change', 'process model evolution', 'model comparison', 'V-Modell® XT']"
117,1912.06466,Savva Ignatyev,"Vage Egiazarian, Savva Ignatyev, Alexey Artemov, Oleg Voynov, Andrey
  Kravchenko, Youyi Zheng, Luiz Velho, Evgeny Burnaev","Latent-Space Laplacian Pyramids for Adversarial Representation Learning
  with 3D Point Clouds",,,10.5220/0009102604210428,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Constructing high-quality generative models for 3D shapes is a fundamental
task in computer vision with diverse applications in geometry processing,
engineering, and design. Despite the recent progress in deep generative
modelling, synthesis of finely detailed 3D surfaces, such as high-resolution
point clouds, from scratch has not been achieved with existing approaches. In
this work, we propose to employ the latent-space Laplacian pyramid
representation within a hierarchical generative model for 3D point clouds. We
combine the recently proposed latent-space GAN and Laplacian GAN architectures
to form a multi-scale model capable of generating 3D point clouds at increasing
levels of detail. Our evaluation demonstrates that our model outperforms the
existing generative models for 3D point clouds.
","[{'version': 'v1', 'created': 'Fri, 13 Dec 2019 13:32:28 GMT'}]",2021-02-08,"[['Egiazarian', 'Vage', ''], ['Ignatyev', 'Savva', ''], ['Artemov', 'Alexey', ''], ['Voynov', 'Oleg', ''], ['Kravchenko', 'Andrey', ''], ['Zheng', 'Youyi', ''], ['Velho', 'Luiz', ''], ['Burnaev', 'Evgeny', '']]","['Deep learning', '3D point clouds', 'generative adversarial networks', 'multi-scale 3D modelling', 'Laplacian pyramid']"
118,1805.10109,Sylvie Huet,"Sylvie Huet, Guillaume Deffuant, Armelle Nugier, Michel Streith, Serge
  Guimond",Resisting hostility generated by terror: An agent-based study,,,10.1371/journal.pone.0209907,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We aim to study through an agent-based model the cultural conditions leading
to a decrease or an increase of discrimination between groups after a major
cultural threat such as a terrorist attack. We propose an agent-based model of
cultural dynamics inspired from the social psychological theories. An agent has
a cultural identity comprised of the most acceptable positions about each of
the different cultural worldviews corresponding to the main cultural groups of
the considered society and a margin of acceptance around each of these most
acceptable positions. An agent forms an attitude about another agent depending
on the similarity between their cultural identities. When a terrorist attack is
perpetrated in the name of an extreme cultural identity, the negatively
perceived agents from this extreme cultural identity modify their margins of
acceptance in order to differentiate themselves more from the threatening
cultural identity. We generated a set of populations with cultural identities
compatible with data given by a survey on groups' attitudes among a large
sample representative of the population of France; we then simulated the
reaction of these agents facing a threat. For most populations, the average
attitude toward agents with the same preferred worldview as the terrorists
becomes more negative; however, when the population shows some cultural
properties, we noticed the opposite effect as the average attitude of the
population becomes less negative. This particular context requires that the
agents sharing the same preferred worldview with the terrorists strongly
differentiate themselves from the terrorists' extreme cultural identity and
that the other agents be aware of these changes.
","[{'version': 'v1', 'created': 'Fri, 25 May 2018 12:39:27 GMT'}]",2019-03-06,"[['Huet', 'Sylvie', ''], ['Deffuant', 'Guillaume', ''], ['Nugier', 'Armelle', ''], ['Streith', 'Michel', ''], ['Guimond', 'Serge', '']]","['Intergroup hostility', 'culture dynamics', 'Terror Management Theory', 'self-opinion']"
119,1111.5485,Willy Picard,Willy Picard,Membership(s) and compliance(s) with class-based graphs,"7 pages, 4 figures",Information Processing Letters. 112 (2012) 849-855,10.1016/j.ipl.2012.08.005,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Besides the need for a better understanding of networks, there is a need for
prescriptive models and tools to specify requirements concerning networks and
their associated graph representations. We propose class-based graphs as a
means to specify requirements concerning object-based graphs. Various variants
of membership are proposed as special relations between class-based and
object-based graphs at the local level, while various variants of compliance
are proposed at the global level.
","[{'version': 'v1', 'created': 'Wed, 23 Nov 2011 13:15:11 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Aug 2012 10:24:03 GMT'}]",2012-08-31,"[['Picard', 'Willy', '']]","['data structures', 'object-based graph', 'class-based graph', 'class membership', 'compliance']"
120,2105.11277,Andr\'e Vict\'oria Matias,"Andr\'e Vict\'oria Matias, Jo\~ao Gustavo Atkinson Amorim, Luiz
  Antonio Buschetto Macarini, Allan Cerentini, Alexandre Sherlley Casimiro
  Onofre, Fabiana Botelho de Miranda Onofre, Felipe Perozzo Dalto\'e, Marcelo
  Ricardo Stemmer, Aldo von Wangenheim","What is the State of the Art of Computer Vision-Assisted Cytology? A
  Systematic Literature Review",,,10.1016/j.compmedimag.2021.101934,,cs.CV eess.IV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Cytology is a low-cost and non-invasive diagnostic procedure employed to
support the diagnosis of a broad range of pathologies. Computer Vision
technologies, by automatically generating quantitative and objective
descriptions of examinations' contents, can help minimize the chances of
misdiagnoses and shorten the time required for analysis. To identify the
state-of-art of computer vision techniques currently applied to cytology, we
conducted a Systematic Literature Review. We analyzed papers published in the
last 5 years. The initial search was executed in September 2020 and resulted in
431 articles. After applying the inclusion/exclusion criteria, 157 papers
remained, which we analyzed to build a picture of the tendencies and problems
present in this research area, highlighting the computer vision methods,
staining techniques, evaluation metrics, and the availability of the used
datasets and computer code. As a result, we identified that the most used
methods in the analyzed works are deep learning-based (70 papers), while fewer
works employ classic computer vision only (101 papers). The most recurrent
metric used for classification and object detection was the accuracy (33 papers
and 5 papers), while for segmentation it was the Dice Similarity Coefficient
(38 papers). Regarding staining techniques, Papanicolaou was the most employed
one (130 papers), followed by H&E (20 papers) and Feulgen (5 papers). Twelve of
the datasets used in the papers are publicly available, with the DTU/Herlev
dataset being the most used one. We conclude that there still is a lack of
high-quality datasets for many types of stains and most of the works are not
mature enough to be applied in a daily clinical diagnostic routine. We also
identified a growing tendency towards adopting deep learning-based approaches
as the methods of choice.
","[{'version': 'v1', 'created': 'Mon, 24 May 2021 13:50:45 GMT'}]",2021-05-28,"[['Matias', 'André Victória', ''], ['Amorim', 'João Gustavo Atkinson', ''], ['Macarini', 'Luiz Antonio Buschetto', ''], ['Cerentini', 'Allan', ''], ['Onofre', 'Alexandre Sherlley Casimiro', ''], ['Onofre', 'Fabiana Botelho de Miranda', ''], ['Daltoé', 'Felipe Perozzo', ''], ['Stemmer', 'Marcelo Ricardo', ''], ['von Wangenheim', 'Aldo', '']]","['Cytology', 'Segmentation', 'Classification', 'Deep Learning', 'Computer Vision']"
121,1407.1103,Hanbaek Lyu,Hanbaek Lyu,Synchronization of finite-state pulse-coupled oscillators,"23 pages, 17 figures, To appear in Physica D: Nonlinear Phenomena",,10.1016/j.physd.2015.03.007,,cs.SY math.CO math.DS math.OC nlin.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel generalized cellular automaton(GCA) model for
discrete-time pulse-coupled oscillators and study the emergence of synchrony.
Given a finite simple graph and an integer $n\ge 3$, each vertex is an
identical oscillator of period $n$ with the following weak coupling along the
edges: each oscillator inhibits its phase update if it has at least one
neighboring oscillator at a particular ""blinking"" state and if its state is
ahead of this blinking state. We obtain conditions on initial configurations
and on network topologies for which states of all vertices eventually
synchronize. We show that our GCA model synchronizes arbitrary initial
configurations on paths, trees, and with random perturbation, any connected
graph. In particular, our main result is the following local-global principle
for tree networks: for $n\in \{3,4,5,6\}$, any $n$-periodic network on a tree
synchronizes arbitrary initial configuration if and only if the maximum degree
of the tree is less than the period $n$.
","[{'version': 'v1', 'created': 'Fri, 4 Jul 2014 01:02:45 GMT'}, {'version': 'v2', 'created': 'Sat, 12 Jul 2014 18:16:35 GMT'}, {'version': 'v3', 'created': 'Mon, 30 Mar 2015 02:00:17 GMT'}]",2018-01-25,"[['Lyu', 'Hanbaek', '']]","['Synchronization', 'pulse-coupled oscillators', 'generalized cellular automata', 'digital clocksynchronization', 'self-stabilization', 'path', 'tree', 'absorbing chain']"
122,1609.08141,Trung Kien Vu,"Trung Kien Vu, Sungoh Kwon","On-Demand Routing Algorithm with Mobility Prediction in the Mobile
  Ad-hoc Networks","Preprint submitted to Computer Networks, 10 pages, 15 figues. arXiv
  admin note: text overlap with arXiv:1604.03330",,10.1016/j.comnet.2005.11.008,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose an ad-hoc on-demand distance vector routing
algorithm for mobile ad-hoc networks taking into account node mobility.
Changeable topology of such mobile ad-hoc networks provokes overhead messages
in order to search available routes and maintain found routes. The overhead
messages impede data delivery from sources to destination and deteriorate
network performance. To overcome such a challenge, our proposed algorithm
estimates link duration based neighboring node mobility and chooses the most
reliable route. The proposed algorithm also applies the estimate for route
maintenance to lessen the number of overhead messages. Via simulations, the
proposed algorithm is verified in various mobile environments. In the low
mobility environment, by reducing route maintenance messages, the proposed
algorithm significantly improves network performance such as packet data rate
and end-to-end delay. In the high mobility environment, the reduction of route
discovery message enhances network performance since the proposed algorithm
provides more reliable routes.
","[{'version': 'v1', 'created': 'Mon, 26 Sep 2016 19:54:39 GMT'}]",2017-06-30,"[['Vu', 'Trung Kien', ''], ['Kwon', 'Sungoh', '']]","['Mobility Prediction', 'Longest and Stable Route', 'Link Duration Probability', 'End-to-End Delay', 'Low Latency']"
123,1003.5435,Secretary Aircc Journal,"Kilari Veera Swamy (1), B.Chandra Mohan (2), Y.V.Bhaskar Reddy (3) and
  S.Srinivas Kumar (4) ((1) QISCET, Ongole, India, (2) BEC, Bapatla, India, (3)
  QISCET, Ongole, India and (4) JNTU, Kakinada, India)",Image Compression and Watermarking scheme using Scalar Quantization,"11 Pages, IJNGN Journal 2010",International Journal of Next-Generation Networks 2.1 (2010) 37-47,10.5121/ijngn.2010.2104,,cs.CV cs.MM,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper presents a new compression technique and image watermarking
algorithm based on Contourlet Transform (CT). For image compression, an energy
based quantization is used. Scalar quantization is explored for image
watermarking. Double filter bank structure is used in CT. The Laplacian Pyramid
(LP) is used to capture the point discontinuities, and then followed by a
Directional Filter Bank (DFB) to link point discontinuities. The coefficients
of down sampled low pass version of LP decomposed image are re-ordered in a
pre-determined manner and prediction algorithm is used to reduce entropy
(bits/pixel). In addition, the coefficients of CT are quantized based on the
energy in the particular band. The superiority of proposed algorithm to JPEG is
observed in terms of reduced blocking artifacts. The results are also compared
with wavelet transform (WT). Superiority of CT to WT is observed when the image
contains more contours. The watermark image is embedded in the low pass image
of contourlet decomposition. The watermark can be extracted with minimum error.
In terms of PSNR, the visual quality of the watermarked image is exceptional.
The proposed algorithm is robust to many image attacks and suitable for
copyright protection applications.
","[{'version': 'v1', 'created': 'Mon, 29 Mar 2010 06:51:17 GMT'}]",2010-07-15,"[['Swamy', 'Kilari Veera', ''], ['Mohan', 'B. Chandra', ''], ['Reddy', 'Y. V. Bhaskar', ''], ['Kumar', 'S. Srinivas', '']]","['Contourlet Transform', 'Directional Filter Bank', 'Laplacian Pyramid', 'Topological re-ordering', 'Quantization']"
124,1801.00680,Caelan Garrett,"Caelan Reed Garrett, Tom\'as Lozano-P\'erez, and Leslie Pack Kaelbling",Sampling-Based Methods for Factored Task and Motion Planning,,"The International Journal of Robotics Research (IJRR), 2018",10.1177/0278364918802962,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a general-purpose formulation of a large class of
discrete-time planning problems, with hybrid state and control-spaces, as
factored transition systems. Factoring allows state transitions to be described
as the intersection of several constraints each affecting a subset of the state
and control variables. Robotic manipulation problems with many movable objects
involve constraints that only affect several variables at a time and therefore
exhibit large amounts of factoring. We develop a theoretical framework for
solving factored transition systems with sampling-based algorithms. The
framework characterizes conditions on the submanifold in which solutions lie,
leading to a characterization of robust feasibility that incorporates
dimensionality-reducing constraints. It then connects those conditions to
corresponding conditional samplers that can be composed to produce values on
this submanifold. We present two domain-independent, probabilistically complete
planning algorithms that take, as input, a set of conditional samplers. We
demonstrate the empirical efficiency of these algorithms on a set of
challenging task and motion planning problems involving picking, placing, and
pushing.
","[{'version': 'v1', 'created': 'Tue, 2 Jan 2018 15:15:35 GMT'}, {'version': 'v2', 'created': 'Thu, 3 May 2018 14:03:33 GMT'}, {'version': 'v3', 'created': 'Tue, 12 Feb 2019 18:40:09 GMT'}]",2019-02-13,"[['Garrett', 'Caelan Reed', ''], ['Lozano-Pérez', 'Tomás', ''], ['Kaelbling', 'Leslie Pack', '']]","['task and motion planning', 'manipulation planning', 'AI reasoning']"
125,1509.03208,AbdelRahim Elmadany,"Abdelrahim A Elmadany, Sherif M Abdou and Mervat Gheith",Towards Understanding Egyptian Arabic Dialogues,arXiv admin note: substantial text overlap with arXiv:1505.03081,"International Journal of Computer Applications 120(220, PP 7-12,
  June 2015",10.5120/21390-4427,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Labelling of user's utterances to understanding his attends which called
Dialogue Act (DA) classification, it is considered the key player for dialogue
language understanding layer in automatic dialogue systems. In this paper, we
proposed a novel approach to user's utterances labeling for Egyptian
spontaneous dialogues and Instant Messages using Machine Learning (ML) approach
without relying on any special lexicons, cues, or rules. Due to the lack of
Egyptian dialect dialogue corpus, the system evaluated by multi-genre corpus
includes 4725 utterances for three domains, which are collected and annotated
manually from Egyptian call-centers. The system achieves F1 scores of 70. 36%
overall domains.
","[{'version': 'v1', 'created': 'Tue, 14 Jul 2015 02:47:40 GMT'}]",2015-09-11,"[['Elmadany', 'Abdelrahim A', ''], ['Abdou', 'Sherif M', ''], ['Gheith', 'Mervat', '']]","['Dialogue Act Classification', 'Arabic Dialogue Understanding', 'Egyptian Arabic Dialect', 'Arabic Instant Messages']"
126,1811.09982,Battista Biggio,"Battista Biggio, Ignazio Pillai, Samuel Rota Bul\`o, Davide Ariu,
  Marcello Pelillo, Fabio Roli",Is Data Clustering in Adversarial Settings Secure?,,"Proceedings of the 2013 ACM Workshop on Artificial Intelligence
  and Security, AISec '13, pages 87-98, New York, NY, USA, 2013. ACM",,,cs.LG cs.CR cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering algorithms have been increasingly adopted in security applications
to spot dangerous or illicit activities. However, they have not been originally
devised to deal with deliberate attack attempts that may aim to subvert the
clustering process itself. Whether clustering can be safely adopted in such
settings remains thus questionable. In this work we propose a general framework
that allows one to identify potential attacks against clustering algorithms,
and to evaluate their impact, by making specific assumptions on the adversary's
goal, knowledge of the attacked system, and capabilities of manipulating the
input data. We show that an attacker may significantly poison the whole
clustering process by adding a relatively small percentage of attack samples to
the input data, and that some attack samples may be obfuscated to be hidden
within some existing clusters. We present a case study on single-linkage
hierarchical clustering, and report experiments on clustering of malware
samples and handwritten digits.
","[{'version': 'v1', 'created': 'Sun, 25 Nov 2018 10:21:59 GMT'}]",2018-11-27,"[['Biggio', 'Battista', ''], ['Pillai', 'Ignazio', ''], ['Bulò', 'Samuel Rota', ''], ['Ariu', 'Davide', ''], ['Pelillo', 'Marcello', ''], ['Roli', 'Fabio', '']]","['Adversarial learning', 'Unsupervised Learning', 'Clustering', 'Security Evaluation', 'Computer Security', 'Malware Detection']"
127,1502.05742,Ahmadreza Baghaie,"Ahmadreza Baghaie, Roshan M. D'souza, Zeyun Yu","Application of Independent Component Analysis Techniques in Speckle
  Noise Reduction of Retinal OCT Images",,,10.1016/j.ijleo.2016.03.078,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optical Coherence Tomography (OCT) is an emerging technique in the field of
biomedical imaging, with applications in ophthalmology, dermatology, coronary
imaging etc. OCT images usually suffer from a granular pattern, called speckle
noise, which restricts the process of interpretation. Therefore the need for
speckle noise reduction techniques is of high importance. To the best of our
knowledge, use of Independent Component Analysis (ICA) techniques has never
been explored for speckle reduction of OCT images. Here, a comparative study of
several ICA techniques (InfoMax, JADE, FastICA and SOBI) is provided for noise
reduction of retinal OCT images. Having multiple B-scans of the same location,
the eye movements are compensated using a rigid registration technique. Then,
different ICA techniques are applied to the aggregated set of B-scans for
extracting the noise-free image. Signal-to-Noise-Ratio (SNR),
Contrast-to-Noise-Ratio (CNR) and Equivalent-Number-of-Looks (ENL), as well as
analysis on the computational complexity of the methods, are considered as
metrics for comparison. The results show that use of ICA can be beneficial,
especially in case of having fewer number of B-scans.
","[{'version': 'v1', 'created': 'Thu, 19 Feb 2015 22:49:37 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Jun 2015 00:33:56 GMT'}, {'version': 'v3', 'created': 'Tue, 28 Jul 2015 15:31:04 GMT'}]",2016-05-25,"[['Baghaie', 'Ahmadreza', ''], [""D'souza"", 'Roshan M.', ''], ['Yu', 'Zeyun', '']]","['Independent Component Analysis', 'Speckle Reduction', 'OpticalCoherence Tomography (OCT)']"
128,1003.4146,Michael Bommarito II,"Michael J. Bommarito II, Daniel Martin Katz",A Mathematical Approach to the Study of the United States Code,"5 pages, 6 figures, 2 tables.",,10.1016/j.physa.2010.05.057,,cs.IR cs.CY cs.DL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The United States Code (Code) is a document containing over 22 million words
that represents a large and important source of Federal statutory law. Scholars
and policy advocates often discuss the direction and magnitude of changes in
various aspects of the Code. However, few have mathematically formalized the
notions behind these discussions or directly measured the resulting
representations. This paper addresses the current state of the literature in
two ways. First, we formalize a representation of the United States Code as the
union of a hierarchical network and a citation network over vertices containing
the language of the Code. This representation reflects the fact that the Code
is a hierarchically organized document containing language and explicit
citations between provisions. Second, we use this formalization to measure
aspects of the Code as codified in October 2008, November 2009, and March 2010.
These measurements allow for a characterization of the actual changes in the
Code over time. Our findings indicate that in the recent past, the Code has
grown in its amount of structure, interdependence, and language.
","[{'version': 'v1', 'created': 'Mon, 22 Mar 2010 12:41:01 GMT'}]",2015-05-18,"[['Bommarito', 'Michael J.', 'II'], ['Katz', 'Daniel Martin', '']]","['United States Code', 'hierarchical network', 'citation network', 'language', 'computational legal studies']"
129,1003.5439,Secretary Aircc Journal,"Ratul Kr. Baruah (Tezpur University, India)",Design of A Low Power Low Voltage CMOS Opamp,"8 Pages, VLSICS Journal","International Journal Of VLSI Design & Communication Systems 1.1
  (2010) 1-8",10.5121/vlsic.2010.1101,,cs.OH,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper a CMOS operational amplifier is presented which operates at 2V
power supply and 1microA input bias current at 0.8 micron technology using non
conventional mode of operation of MOS transistors and whose input is depended
on bias current. The unique behaviour of the MOS transistors in subthreshold
region not only allows a designer to work at low input bias current but also at
low voltage. While operating the device at weak inversion results low power
dissipation but dynamic range is degraded. Optimum balance between power
dissipation and dynamic range results when the MOS transistors are operated at
moderate inversion. Power is again minimised by the application of input
dependant bias current using feedback loops in the input transistors of the
differential pair with two current substractors. In comparison with the
reported low power low voltage opamps at 0.8 micron technology, this opamp has
very low standby power consumption with a high driving capability and operates
at low voltage. The opamp is fairly small (0.0084 mm 2) and slew rate is more
than other low power low voltage opamps reported at 0.8 um technology [1,2].
Vittoz at al [3] reported that slew rate can be improved by adaptive biasing
technique and power dissipation can be reduced by operating the device in weak
inversion. Though lower power dissipation is achieved the area required by the
circuit is very large and speed is too small. So, operating the device in
moderate inversion is a good solution. Also operating the device in
subthreshold region not only allows lower power dissipation but also a lower
voltage operation is achieved.
","[{'version': 'v1', 'created': 'Mon, 29 Mar 2010 07:03:46 GMT'}]",2010-07-15,"[['Baruah', 'Ratul Kr.', '', 'Tezpur University, India']]","['Opamp', 'Adaptive biasing', 'Low power', 'Low voltage', 'Current Substractor']"
130,0903.2174,Amir Leshem,Amir Leshem and Ephi Zehavi,"Game theory and the frequency selective interference channel - A
  tutorial",,"IEEE Signal Processing Magazine. Special issue on applications of
  game theory in signal processing and communications. Volume 26, Issue 4,
  pages 28-40. Sep. 2009",10.1109/MSP.2009.933372,,cs.IT cs.GT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper provides a tutorial overview of game theoretic techniques used for
communication over frequency selective interference channels. We discuss both
competitive and cooperative techniques.
  Keywords: Game theory, competitive games, cooperative games, Nash
Equilibrium, Nash bargaining solution, Generalized Nash games, Spectrum
optimization, distributed coordination, interference channel, multiple access
channel, iterative water-filling.
","[{'version': 'v1', 'created': 'Thu, 12 Mar 2009 14:42:13 GMT'}]",2010-08-10,"[['Leshem', 'Amir', ''], ['Zehavi', 'Ephi', '']]","['Game theory', 'competitive games', 'cooperative games', 'Nash Equilibrium', 'Nash bargaining']"
131,1912.05897,Runhua Xu,"Runhua Xu, Nathalie Baracaldo, Yi Zhou, Ali Anwar and Heiko Ludwig","HybridAlpha: An Efficient Approach for Privacy-Preserving Federated
  Learning","12 pages, AISec 2019",,10.1145/3338501.3357371,,cs.CR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Federated learning has emerged as a promising approach for collaborative and
privacy-preserving learning. Participants in a federated learning process
cooperatively train a model by exchanging model parameters instead of the
actual training data, which they might want to keep private. However, parameter
interaction and the resulting model still might disclose information about the
training data used. To address these privacy concerns, several approaches have
been proposed based on differential privacy and secure multiparty computation
(SMC), among others. They often result in large communication overhead and slow
training time. In this paper, we propose HybridAlpha, an approach for
privacy-preserving federated learning employing an SMC protocol based on
functional encryption. This protocol is simple, efficient and resilient to
participants dropping out. We evaluate our approach regarding the training time
and data volume exchanged using a federated learning process to train a CNN on
the MNIST data set. Evaluation against existing crypto-based SMC solutions
shows that HybridAlpha can reduce the training time by 68% and data transfer
volume by 92% on average while providing the same model performance and privacy
guarantees as the existing solutions.
","[{'version': 'v1', 'created': 'Thu, 12 Dec 2019 12:37:39 GMT'}]",2019-12-13,"[['Xu', 'Runhua', ''], ['Baracaldo', 'Nathalie', ''], ['Zhou', 'Yi', ''], ['Anwar', 'Ali', ''], ['Ludwig', 'Heiko', '']]","['Federated learning', 'privacy', 'functional encryption', 'neural networks']"
132,1206.0375,Hector Zenil,Hector Zenil and James A.R. Marshall,Some Computational Aspects of Essential Properties of Evolution and Life,"Invited contribution to the ACM Ubiquity Symposium on Evolutionary
  Computation","ACM Ubiquity, Symposium on Evolutionary Computation, 2012",,,cs.CC cs.IT math.IT nlin.AO nlin.PS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While evolution has inspired algorithmic methods of heuristic optimisation,
little has been done in the way of using concepts of computation to advance our
understanding of salient aspects of biological phenomena. We argue that under
reasonable assumptions, interesting conclusions can be drawn that are of
relevance to behavioural evolution. We will focus on two important features of
life--robustness and fitness--which, we will argue, are related to algorithmic
probability and to the thermodynamics of computation, disciplines that may be
capable of modelling key features of living organisms, and which can be used in
formulating new algorithms of evolutionary computation.
","[{'version': 'v1', 'created': 'Sat, 2 Jun 2012 13:00:11 GMT'}]",2012-06-05,"[['Zenil', 'Hector', ''], ['Marshall', 'James A. R.', '']]","['algorithmic probability', 'information theory', 'thermodynamics of computation', 'biological robustness', 'evolutionary computation', 'fitness']"
133,1701.00180,Hamid Hamraz,"Hamid Hamraz, Marco A. Contreras, and Jun Zhang","A scalable approach for tree segmentation within small-footprint
  airborne LiDAR data","The replacement version is exactly the same and only the journal
  biblio information and the DOI of the published version was added",Computers and Geosciences 102 (pp. 139-147): Elsevier (2017),10.1016/j.cageo.2017.02.017,,cs.DC cs.CE,http://creativecommons.org/licenses/by/4.0/,"  This paper presents a distributed approach that scales up to segment tree
crowns within a LiDAR point cloud representing an arbitrarily large forested
area. The approach uses a single-processor tree segmentation algorithm as a
building block in order to process the data delivered in the shape of tiles in
parallel. The distributed processing is performed in a master-slave manner, in
which the master maintains the global map of the tiles and coordinates the
slaves that segment tree crowns within and across the boundaries of the tiles.
A minimal bias was introduced to the number of detected trees because of trees
lying across the tile boundaries, which was quantified and adjusted for.
Theoretical and experimental analyses of the runtime of the approach revealed a
near linear speedup. The estimated number of trees categorized by crown class
and the associated error margins as well as the height distribution of the
detected trees aligned well with field estimations, verifying that the
distributed approach works correctly. The approach enables providing
information of individual tree locations and point cloud segments for a
forest-level area in a timely manner, which can be used to create detailed
remotely sensed forest inventories. Although the approach was presented for
tree segmentation within LiDAR point clouds, the idea can also be generalized
to scale up processing other big spatial datasets.
  Highlights: - A scalable distributed approach for tree segmentation was
developed and theoretically analyzed. - ~2 million trees in a 7440 ha forest
was segmented in 2.5 hours using 192 cores. - 2% false positive trees were
identified as a result of the distributed run. - The approach can be used to
scale up processing other big spatial data
","[{'version': 'v1', 'created': 'Sun, 1 Jan 2017 00:10:42 GMT'}, {'version': 'v2', 'created': 'Sun, 19 Mar 2017 21:13:31 GMT'}]",2017-03-21,"[['Hamraz', 'Hamid', ''], ['Contreras', 'Marco A.', ''], ['Zhang', 'Jun', '']]","['distributed computing', 'big spatial data', 'remote sensing', 'remote forest inventory', 'individual tree']"
134,1705.05787,Luiz Gustavo Hafemann,"Luiz G. Hafemann, Robert Sabourin, Luiz S. Oliveira","Learning Features for Offline Handwritten Signature Verification using
  Deep Convolutional Neural Networks",,,10.1016/j.patcog.2017.05.012,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Verifying the identity of a person using handwritten signatures is
challenging in the presence of skilled forgeries, where a forger has access to
a person's signature and deliberately attempt to imitate it. In offline
(static) signature verification, the dynamic information of the signature
writing process is lost, and it is difficult to design good feature extractors
that can distinguish genuine signatures and skilled forgeries. This reflects in
a relatively poor performance, with verification errors around 7% in the best
systems in the literature. To address both the difficulty of obtaining good
features, as well as improve system performance, we propose learning the
representations from signature images, in a Writer-Independent format, using
Convolutional Neural Networks. In particular, we propose a novel formulation of
the problem that includes knowledge of skilled forgeries from a subset of users
in the feature learning process, that aims to capture visual cues that
distinguish genuine signatures and forgeries regardless of the user. Extensive
experiments were conducted on four datasets: GPDS, MCYT, CEDAR and Brazilian
PUC-PR datasets. On GPDS-160, we obtained a large improvement in
state-of-the-art performance, achieving 1.72% Equal Error Rate, compared to
6.97% in the literature. We also verified that the features generalize beyond
the GPDS dataset, surpassing the state-of-the-art performance in the other
datasets, without requiring the representation to be fine-tuned to each
particular dataset.
","[{'version': 'v1', 'created': 'Tue, 16 May 2017 16:08:09 GMT'}]",2017-05-17,"[['Hafemann', 'Luiz G.', ''], ['Sabourin', 'Robert', ''], ['Oliveira', 'Luiz S.', '']]","['Signature Verification', 'Convolutional Neural Networks', 'Feature Learning', 'Deep']"
135,1807.05848,Dmitry Lande,"Andrei Snarskii, Dmyto Lande, Dmyto Manko","K-method of calculating the mutual influence of nodes in a directed
  weight complex networks","16 pages, 2 appendix",,10.1016/j.physa.2019.04.135,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new characteristic of paired nodes in a directed weight complex network is
considered. A method (named as K-method) of the characteristics calculation for
complex networks is proposed. The method is based on transforming the initial
network with the subsequent application of the Kirchhoff rules. The scope of
the method for sparse complex networks is proposed. The nodes of these complex
networks are concepts of the real world, and the connections have a
cause-effect character of the so-called ""cognitive maps"". Two new
characteristics of concept nodes having a semantic interpretation are proposed,
namely ""pressure"" and ""influence"" taking into account the influence of all
nodes on each other.
","[{'version': 'v1', 'created': 'Mon, 16 Jul 2018 13:30:43 GMT'}]",2019-06-26,"[['Snarskii', 'Andrei', ''], ['Lande', 'Dmyto', ''], ['Manko', 'Dmyto', '']]","['complex networks', 'K-method', 'mutual influence', 'nodes ranking']"
136,1411.2406,Vladimir Khlevnoy,"Vladimir A. Khlevnoy, Andrey A. Shchurov",A Formal Approach to Distributed System Security Test Generation,"7 pages, 6 figures, 3 tables, Published with International Journal of
  Computer Trends and Technology (IJCTT). arXiv admin note: text overlap with
  arXiv:1410.1747","International Journal of Computer Trends and Technology (IJCTT)
  V16(3), 2014 pg 121-127",10.14445/22312803/IJCTT-V16P130,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deployment of distributed systems sets high requirements for procedures for
the security testing of these systems. This work introduces: (1) a list of
typical threats based on standards and actual practices; (2) an extended
six-layered model for test generation mission on the basis of technical
specifications and end-user requirements. Based on the list of typical threats
and the multilayer model, we describe a formal approach to the automated design
and generation of security mechanisms checklists for complex distributed
systems.
","[{'version': 'v1', 'created': 'Mon, 10 Nov 2014 13:01:19 GMT'}]",2014-11-11,"[['Khlevnoy', 'Vladimir A.', ''], ['Shchurov', 'Andrey A.', '']]","['distributed systems', 'security testing', 'formal']"
137,1511.07846,Leonidas Fegaras,Leonidas Fegaras,Incremental Query Processing on Big Data Streams,Extended version of a paper submitted to a journal,,10.1109/TKDE.2016.2601103,,cs.DB cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses online query processing for large-scale, incremental
data analysis on a distributed stream processing engine (DSPE). Our goal is to
convert any SQL-like query to an incremental DSPE program automatically. In
contrast to other approaches, we derive incremental programs that return
accurate results, not approximate answers. This is accomplished by retaining a
minimal state during the query evaluation lifetime and by using incremental
evaluation techniques to return an accurate snapshot answer at each time
interval that depends on the current state and the latest batches of data. Our
methods can handle many forms of queries on nested data collections, including
iterative and nested queries, group-by with aggregation, and equi-joins.
Finally, we report on a prototype implementation of our framework, called MRQL
Streaming, running on top of Spark and we experimentally validate the
effectiveness of our methods.
","[{'version': 'v1', 'created': 'Tue, 24 Nov 2015 19:55:09 GMT'}, {'version': 'v2', 'created': 'Sun, 17 Jan 2016 22:59:08 GMT'}, {'version': 'v3', 'created': 'Sun, 6 Mar 2016 19:21:25 GMT'}]",2016-08-23,"[['Fegaras', 'Leonidas', '']]","['Incremental Data Processing', 'DistributedStream Processing', 'Big Data', 'MRQL', 'Spark']"
138,1701.05751,Arnaud Martin,"Siwar Jendoubi (LARODEC, DRUID, CERT), Arnaud Martin (IRISA, UR1,
  DRUID), Ludovic Li\'etard (IRISA), Ben Hend (CERT), Ben Boutheina (LARODEC)",Two Evidential Data Based Models for Influence Maximization in Twitter,"Knowledge-Based Systems, Elsevier, 2017",,10.1016/j.knosys.2017.01.014,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Influence maximization is the problem of selecting a set of influential users
in the social network. Those users could adopt the product and trigger a large
cascade of adoptions through the "" word of mouth "" effect. In this paper, we
propose two evidential influence maximization models for Twitter social
network. The proposed approach uses the theory of belief functions to estimate
users influence. Furthermore, the proposed influence estimation measure fuses
many influence aspects in Twitter, like the importance of the user in the
network structure and the popularity of user's tweets (messages). In our
experiments, we compare the proposed solutions to existing ones and we show the
performance of our models.
","[{'version': 'v1', 'created': 'Fri, 20 Jan 2017 10:39:13 GMT'}]",2017-01-23,"[['Jendoubi', 'Siwar', '', 'LARODEC, DRUID, CERT'], ['Martin', 'Arnaud', '', 'IRISA, UR1,\n  DRUID'], ['Liétard', 'Ludovic', '', 'IRISA'], ['Hend', 'Ben', '', 'CERT'], ['Boutheina', 'Ben', '', 'LARODEC']]","['Influence maximization', 'Theory of belief functions', 'Twitter socialnetwork', 'Influence measure']"
139,2105.04294,Tonatiuh Hern\'andez-Del-Toro M.Sc.,"Tonatiuh Hern\'andez-Del-Toro, Carlos A. Reyes-Garc\'ia, Luis
  Villase\~nor-Pineda","Toward asynchronous EEG-based BCI: Detecting imagined words segments in
  continuous EEG signals","10 pages, 14 figures","Biomedical Signal Processing and Control. Volume 65 (2021), 102351",10.1016/j.bspc.2020.102351,,cs.HC cs.LG eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An asynchronous Brain--Computer Interface (BCI) based on imagined speech is a
tool that allows to control an external device or to emit a message at the
moment the user desires to by decoding EEG signals of imagined speech. In order
to correctly implement these types of BCI, we must be able to detect from a
continuous signal, when the subject starts to imagine words. In this work, five
methods of feature extraction based on wavelet decomposition, empirical mode
decomposition, frequency energies, fractal dimension and chaos theory features
are presented to solve the task of detecting imagined words segments from
continuous EEG signals as a preliminary study for a latter implementation of an
asynchronous BCI based on imagined speech. These methods are tested in three
datasets using four different classifiers and the higher F1 scores obtained are
0.73, 0.79, and 0.68 for each dataset, respectively. This results are promising
to build a system that automatizes the segmentation of imagined words segments
for latter classification.
","[{'version': 'v1', 'created': 'Tue, 13 Apr 2021 00:13:42 GMT'}]",2021-05-11,"[['Hernández-Del-Toro', 'Tonatiuh', ''], ['Reyes-García', 'Carlos A.', ''], ['Villaseñor-Pineda', 'Luis', '']]","['Imagined speech', 'Asynchronous BCI', 'Signal processing']"
140,1109.0397,Gabriele D'Angelo,"Moreno Marzolla, Stefano Ferretti, Gabriele D'Angelo",Auction-Based Resource Allocation in Digital Ecosystems,"Proceedings of the 6th International Conference on MOBILe Wireless
  MiddleWARE, Operating Systems, and Applications (MobilWare 2013). Bologna,
  Italy, November 11-12, 2013",,10.1109/Mobilware.2013.16,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The proliferation of portable devices (PDAs, smartphones, digital multimedia
players, and so forth) allows mobile users to carry around a pool of computing,
storage and communication resources. Sharing these resources with other users
(""Digital Organisms"" -- DOs) opens the door to novel interesting scenarios,
where people trade resources to allow the execution, anytime and anywhere, of
applications that require a mix of capabilities. In this paper we present a
fully distributed approach for resource sharing among multiple devices owned by
different mobile users. Our scheme enables DOs to trade computing/networking
facilities through an auction-based mechanism, without the need of a central
control. We use a set of numerical experiments to compare our approach with an
optimal (centralized) allocation strategy that, given the set of resource
demands and offers, maximizes the number of matches. Results confirm the
effectiveness of our approach since it produces a fair allocation of resources
with low computational cost, providing DOs with the means to form an altruistic
digital ecosystem.
","[{'version': 'v1', 'created': 'Fri, 2 Sep 2011 10:08:38 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Jul 2014 12:22:44 GMT'}]",2014-07-31,"[['Marzolla', 'Moreno', ''], ['Ferretti', 'Stefano', ''], [""D'Angelo"", 'Gabriele', '']]","['Resource Allocation', 'Optimization', 'Peer-to-Peer Systems', 'Ad-hoc Networks']"
141,2006.06867,Onur Varol,"Mohsen Sayyadiharikandeh, Onur Varol, Kai-Cheng Yang, Alessandro
  Flammini, Filippo Menczer",Detection of Novel Social Bots by Ensembles of Specialized Classifiers,"8 pages, 10 figures, Accepted to CIKM'20","Proc. 29th ACM International Conference on Information and
  Knowledge Management (CIKM), pages 2725-2732, 2020",10.1145/3340531.3412698,,cs.SI cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Malicious actors create inauthentic social media accounts controlled in part
by algorithms, known as social bots, to disseminate misinformation and agitate
online discussion. While researchers have developed sophisticated methods to
detect abuse, novel bots with diverse behaviors evade detection. We show that
different types of bots are characterized by different behavioral features. As
a result, supervised learning techniques suffer severe performance
deterioration when attempting to detect behaviors not observed in the training
data. Moreover, tuning these models to recognize novel bots requires retraining
with a significant amount of new annotations, which are expensive to obtain. To
address these issues, we propose a new supervised learning method that trains
classifiers specialized for each class of bots and combines their decisions
through the maximum rule. The ensemble of specialized classifiers (ESC) can
better generalize, leading to an average improvement of 56\% in F1 score for
unseen accounts across datasets. Furthermore, novel bot behaviors are learned
with fewer labeled examples during retraining. We deployed ESC in the newest
version of Botometer, a popular tool to detect social bots in the wild, with a
cross-validation AUC of 0.99.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2020 22:59:59 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Aug 2020 20:04:21 GMT'}]",2020-11-30,"[['Sayyadiharikandeh', 'Mohsen', ''], ['Varol', 'Onur', ''], ['Yang', 'Kai-Cheng', ''], ['Flammini', 'Alessandro', ''], ['Menczer', 'Filippo', '']]","['Social media', 'social bots', 'machine learning', 'cross-domain', 'recall']"
142,1901.10367,Tatyana Ivanova,Philippe Balbiani and Tatyana Ivanova,"Representation theorems for extended contact algebras based on
  equivalence relations",,,10.1007/s11225-020-09923-0,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of this paper is to give new representation theorems for extended
contact algebras. These representation theorems are based on equivalence
relations.
","[{'version': 'v1', 'created': 'Tue, 29 Jan 2019 16:34:19 GMT'}]",2020-09-22,"[['Balbiani', 'Philippe', ''], ['Ivanova', 'Tatyana', '']]","['Regular closed subsets', 'Contact algebras', 'Extended contact algebras', 'Topological representation', 'Relational representation']"
143,1810.10464,Meisam Mohammady memoh,"Meisam Mohammady, Lingyu Wang, Yuan Hong, Habib Louafi, Makan
  Pourzandi, Mourad Debbabi",Preserving Both Privacy and Utility in Network Trace Anonymization,,,10.1145/3243734.3243809,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As network security monitoring grows more sophisticated, there is an
increasing need for outsourcing such tasks to third-party analysts. However,
organizations are usually reluctant to share their network traces due to
privacy concerns over sensitive information, e.g., network and system
configuration, which may potentially be exploited for attacks. In cases where
data owners are convinced to share their network traces, the data are typically
subjected to certain anonymization techniques, e.g., CryptoPAn, which replaces
real IP addresses with prefix-preserving pseudonyms. However, most such
techniques either are vulnerable to adversaries with prior knowledge about some
network flows in the traces, or require heavy data sanitization or
perturbation, both of which may result in a significant loss of data utility.
In this paper, we aim to preserve both privacy and utility through shifting the
trade-off from between privacy and utility to between privacy and computational
cost. The key idea is for the analysts to generate and analyze multiple
anonymized views of the original network traces; those views are designed to be
sufficiently indistinguishable even to adversaries armed with prior knowledge,
which preserves the privacy, whereas one of the views will yield true analysis
results privately retrieved by the data owner, which preserves the utility. We
present the general approach and instantiate it based on CryptoPAn. We formally
analyze the privacy of our solution and experimentally evaluate it using real
network traces provided by a major ISP. The results show that our approach can
significantly reduce the level of information leakage (e.g., less than 1\% of
the information leaked by CryptoPAn) with comparable utility.
","[{'version': 'v1', 'created': 'Wed, 24 Oct 2018 15:54:26 GMT'}]",2018-10-25,"[['Mohammady', 'Meisam', ''], ['Wang', 'Lingyu', ''], ['Hong', 'Yuan', ''], ['Louafi', 'Habib', ''], ['Pourzandi', 'Makan', ''], ['Debbabi', 'Mourad', '']]","['Network trace anonymization', 'prefix-preserving anonymization', 'CryptoPAn', 'semantic attacks']"
144,1905.09433,Tongwen Huang,"Tongwen Huang, Zhiqi Zhang, Junlin Zhang","FiBiNET: Combining Feature Importance and Bilinear feature Interaction
  for Click-Through Rate Prediction","8 pages,5 figures","ACM Conference on Recommender Systems (RecSys '19), September
  16--20, 2019, Copenhagen, Denmark",10.1145/3298689.3347043,,cs.LG cs.AI stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Advertising and feed ranking are essential to many Internet companies such as
Facebook and Sina Weibo. Among many real-world advertising and feed ranking
systems, click through rate (CTR) prediction plays a central role. There are
many proposed models in this field such as logistic regression, tree based
models, factorization machine based models and deep learning based CTR models.
However, many current works calculate the feature interactions in a simple way
such as Hadamard product and inner product and they care less about the
importance of features. In this paper, a new model named FiBiNET as an
abbreviation for Feature Importance and Bilinear feature Interaction NETwork is
proposed to dynamically learn the feature importance and fine-grained feature
interactions. On the one hand, the FiBiNET can dynamically learn the importance
of features via the Squeeze-Excitation network (SENET) mechanism; on the other
hand, it is able to effectively learn the feature interactions via bilinear
function. We conduct extensive experiments on two real-world datasets and show
that our shallow model outperforms other shallow models such as factorization
machine(FM) and field-aware factorization machine(FFM). In order to improve
performance further, we combine a classical deep neural network(DNN) component
with the shallow model to be a deep model. The deep FiBiNET consistently
outperforms the other state-of-the-art deep models such as DeepFM and extreme
deep factorization machine(XdeepFM).
","[{'version': 'v1', 'created': 'Thu, 23 May 2019 02:10:17 GMT'}]",2019-11-13,"[['Huang', 'Tongwen', ''], ['Zhang', 'Zhiqi', ''], ['Zhang', 'Junlin', '']]","['Display Advertising', 'CTR Prediction', 'Factorization Machines', 'SqueezeExcitation network', 'Neural Network', 'Bilinear Function']"
145,1312.4794,Thabet Slimani,Thabet Slimani,Semantic Annotation: The Mainstay of Semantic Web,"8 pages, 3 figures","International Journal of Computer Applications Technology and
  Research, Volume 2, Issue 6, 763-770, 2013",10.7753/IJCATR0206.1025,,cs.DL cs.AI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given that semantic Web realization is based on the critical mass of metadata
accessibility and the representation of data with formal knowledge, it needs to
generate metadata that is specific, easy to understand and well-defined.
However, semantic annotation of the web documents is the successful way to make
the Semantic Web vision a reality. This paper introduces the Semantic Web and
its vision (stack layers) with regard to some concept definitions that helps
the understanding of semantic annotation. Additionally, this paper introduces
the semantic annotation categories, tools, domains and models.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2013 14:12:51 GMT'}]",2013-12-18,"[['Slimani', 'Thabet', '']]","['semantic annotation', 'Semantic Web', 'Ontologies  1']"
146,0811.0133,Deepyaman Maiti,"Mithun Chakraborty, Deepyaman Maiti, Amit Konar, Ramadoss Janarthanan","A Study of the Grunwald-Letnikov Definition for Minimizing the Effects
  of Random Noise on Fractional Order Differential Equations","4th IEEE International Conference on Information and Automation for
  Sustainability, 2008",,10.1109/ICIAFS.2008.4783931,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Of the many definitions for fractional order differintegral, the
Grunwald-Letnikov definition is arguably the most important one. The necessity
of this definition for the description and analysis of fractional order systems
cannot be overstated. Unfortunately, the Fractional Order Differential Equation
(FODE) describing such a systems, in its original form, highly sensitive to the
effects of random noise components inevitable in a natural environment. Thus
direct application of the definition in a real-life problem can yield erroneous
results. In this article, we perform an in-depth mathematical analysis the
Grunwald-Letnikov definition in depth and, as far as we know, we are the first
to do so. Based on our analysis, we present a transformation scheme which will
allow us to accurately analyze generalized fractional order systems in presence
of significant quantities of random errors. Finally, by a simple experiment, we
demonstrate the high degree of robustness to noise offered by the said
transformation and thus validate our scheme.
","[{'version': 'v1', 'created': 'Sun, 2 Nov 2008 06:16:49 GMT'}]",2016-11-15,"[['Chakraborty', 'Mithun', ''], ['Maiti', 'Deepyaman', ''], ['Konar', 'Amit', ''], ['Janarthanan', 'Ramadoss', '']]","['Fractional calculus', 'fractional order differential Equation', 'Grunwald-Letnikov definition', 'random noise']"
147,1503.00173,Jonathan Mei,Jonathan Mei and Jos\'e M. F. Moura,Signal Processing on Graphs: Causal Modeling of Unstructured Data,,"IEEE Transactions on Signal Processing, vol. 65, no. 8, pp.
  2077-2092, April 15, 2017",10.1109/TSP.2016.2634543,,cs.IT math.IT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many applications collect a large number of time series, for example, the
financial data of companies quoted in a stock exchange, the health care data of
all patients that visit the emergency room of a hospital, or the temperature
sequences continuously measured by weather stations across the US. These data
are often referred to as unstructured. A first task in its analytics is to
derive a low dimensional representation, a graph or discrete manifold, that
describes well the interrelations among the time series and their
intrarelations across time. This paper presents a computationally tractable
algorithm for estimating this graph that structures the data. The resulting
graph is directed and weighted, possibly capturing causal relations, not just
reciprocal correlations as in many existing approaches in the literature. A
convergence analysis is carried out. The algorithm is demonstrated on random
graph datasets and real network time series datasets, and its performance is
compared to that of related methods. The adjacency matrices estimated with the
new method are close to the true graph in the simulated data and consistent
with prior physical knowledge in the real dataset tested.
","[{'version': 'v1', 'created': 'Sat, 28 Feb 2015 20:28:05 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Apr 2016 20:58:45 GMT'}, {'version': 'v3', 'created': 'Tue, 13 Sep 2016 13:19:02 GMT'}, {'version': 'v4', 'created': 'Mon, 31 Oct 2016 22:05:33 GMT'}, {'version': 'v5', 'created': 'Wed, 30 Nov 2016 19:12:41 GMT'}, {'version': 'v6', 'created': 'Wed, 8 Feb 2017 15:49:58 GMT'}]",2017-02-09,"[['Mei', 'Jonathan', ''], ['Moura', 'José M. F.', '']]","['Graph Signal Processing', 'Graph Structure', 'Adjacency Matrix', 'Network', 'Time Series', 'Big Data', 'Causal']"
148,1911.11473,Dat Quoc Nguyen,"Dat Quoc Nguyen, Dai Quoc Nguyen, Son Bao Pham, The Duy Bui","A Fast Template-based Approach to Automatically Identify Primary Text
  Content of a Web Page","In Proceedings of the 2009 International Conference on Knowledge and
  Systems Engineering (KSE 2009)",,10.1109/KSE.2009.39,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Search engines have become an indispensable tool for browsing information on
the Internet. The user, however, is often annoyed by redundant results from
irrelevant Web pages. One reason is because search engines also look at
non-informative blocks of Web pages such as advertisement, navigation links,
etc. In this paper, we propose a fast algorithm called FastContentExtractor to
automatically detect main content blocks in a Web page by improving the
ContentExtractor algorithm. By automatically identifying and storing templates
representing the structure of content blocks in a website, content blocks of a
new Web page from the Website can be extracted quickly. The hierarchical order
of the output blocks is also maintained which guarantees that the extracted
content blocks are in the same order as the original ones.
","[{'version': 'v1', 'created': 'Tue, 26 Nov 2019 11:49:16 GMT'}]",2019-11-27,"[['Nguyen', 'Dat Quoc', ''], ['Nguyen', 'Dai Quoc', ''], ['Pham', 'Son Bao', ''], ['Bui', 'The Duy', '']]","['data mining', 'template detection', 'web mining']"
149,1711.08521,Ibrahim Aljarah,"Wadi' Hijawi, Hossam Faris, Ja'far Alqatawna, Ibrahim Aljarah, Ala' M.
  Al-Zoubi, and Maria Habib",EMFET: E-mail Features Extraction Tool,,,10.13140/RG.2.2.32995.45603,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  EMFET is an open source and flexible tool that can be used to extract a large
number of features from any email corpus with emails saved in EML format. The
extracted features can be categorized into three main groups: header features,
payload (body) features, and attachment features. The purpose of the tool is to
help practitioners and researchers to build datasets that can be used for
training machine learning models for spam detection. So far, 140 features can
be extracted using EMFET. EMFET is extensible and easy to use. The source code
of EMFET is publicly available at GitHub
(https://github.com/WadeaHijjawi/EmailFeaturesExtraction)
","[{'version': 'v1', 'created': 'Wed, 22 Nov 2017 22:24:20 GMT'}]",2017-11-28,"[['Hijawi', ""Wadi'"", ''], ['Faris', 'Hossam', ''], ['Alqatawna', ""Ja'far"", ''], ['Aljarah', 'Ibrahim', ''], ['Al-Zoubi', ""Ala' M."", ''], ['Habib', 'Maria', '']]","['Spam Detection', 'Feature Extraction Tool', 'Spam Features', 'Data Mining', 'Machine learning']"
150,1612.06093,Min Jiang,"Min Jiang, Zhongqiang Huang, Liming Qiu, Wenzhen Huang and Gary G. Yen",Transfer Learning based Dynamic Multiobjective Optimization Algorithms,,,10.1109/TEVC.2017.2771451,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the major distinguishing features of the dynamic multiobjective
optimization problems (DMOPs) is the optimization objectives will change over
time, thus tracking the varying Pareto-optimal front becomes a challenge. One
of the promising solutions is reusing the ""experiences"" to construct a
prediction model via statistical machine learning approaches. However most of
the existing methods ignore the non-independent and identically distributed
nature of data used to construct the prediction model. In this paper, we
propose an algorithmic framework, called Tr-DMOEA, which integrates transfer
learning and population-based evolutionary algorithm for solving the DMOPs.
This approach takes the transfer learning method as a tool to help reuse the
past experience for speeding up the evolutionary process, and at the same time,
any population based multiobjective algorithms can benefit from this
integration without any extensive modifications. To verify this, we incorporate
the proposed approach into the development of three well-known algorithms,
nondominated sorting genetic algorithm II (NSGA-II), multiobjective particle
swarm optimization (MOPSO), and the regularity model-based multiobjective
estimation of distribution algorithm (RM-MEDA), and then employ twelve
benchmark functions to test these algorithms as well as compare with some
chosen state-of-the-art designs. The experimental results confirm the
effectiveness of the proposed method through exploiting machine learning
technology.
","[{'version': 'v1', 'created': 'Mon, 19 Dec 2016 09:49:28 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Nov 2017 13:04:02 GMT'}]",2017-11-21,"[['Jiang', 'Min', ''], ['Huang', 'Zhongqiang', ''], ['Qiu', 'Liming', ''], ['Huang', 'Wenzhen', ''], ['Yen', 'Gary G.', '']]","['Dynamic multi-objective optimization', 'Domain adaption', 'Dimensionality reduction', 'Transfer learning', 'Evolutionary Algorithm']"
151,2102.08162,"Nicolas Pr\""ollochs","Kirill Solovev, Nicolas Pr\""ollochs",Integrating Floor Plans into Hedonic Models for Rent Price Appraisal,,,10.1145/3442381.3449967,,cs.LG econ.GN q-fin.EC stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online real estate platforms have become significant marketplaces
facilitating users' search for an apartment or a house. Yet it remains
challenging to accurately appraise a property's value. Prior works have
primarily studied real estate valuation based on hedonic price models that take
structured data into account while accompanying unstructured data is typically
ignored. In this study, we investigate to what extent an automated visual
analysis of apartment floor plans on online real estate platforms can enhance
hedonic rent price appraisal. We propose a tailored two-staged deep learning
approach to learn price-relevant designs of floor plans from historical price
data. Subsequently, we integrate the floor plan predictions into hedonic rent
price models that account for both structural and locational characteristics of
an apartment. Our empirical analysis based on a unique dataset of 9174 real
estate listings suggests that current hedonic models underutilize the available
data. We find that (1) the visual design of floor plans has significant
explanatory power regarding rent prices - even after controlling for structural
and locational apartment characteristics, and (2) harnessing floor plans
results in an up to 10.56% lower out-of-sample prediction error. We further
find that floor plans yield a particularly high gain in prediction performance
for older and smaller apartments. Altogether, our empirical findings contribute
to the existing research body by establishing the link between the visual
design of floor plans and real estate prices. Moreover, our approach has
important implications for online real estate platforms, which can use our
findings to enhance user experience in their real estate listings.
","[{'version': 'v1', 'created': 'Tue, 16 Feb 2021 14:05:33 GMT'}]",2021-02-17,"[['Solovev', 'Kirill', ''], ['Pröllochs', 'Nicolas', '']]","['Online real estate platforms', 'hedonic price models', 'floor plans', 'visual analytics', 'image sentiment']"
152,2105.09297,Rongyu Cao Dr.,Rongyu Cao and Yixuan Cao and Ganbin Zhou and Ping Luo,"Extracting Variable-Depth Logical Document Hierarchy from Long
  Documents: Method, Evaluation, and Application","23 pages, 10 figures, Journal of computer science and technology","Journal of computer science and technology, 2021",10.1007/s11390-021-1076-7,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the problem of extracting variable-depth ""logical
document hierarchy"" from long documents, namely organizing the recognized
""physical document objects"" into hierarchical structures. The discovery of
logical document hierarchy is the vital step to support many downstream
applications. However, long documents, containing hundreds or even thousands of
pages and variable-depth hierarchy, challenge the existing methods. To address
these challenges, we develop a framework, namely Hierarchy Extraction from Long
Document (HELD), where we ""sequentially"" insert each physical object at the
proper on of the current tree. Determining whether each possible position is
proper or not can be formulated as a binary classification problem. To further
improve its effectiveness and efficiency, we study the design variants in HELD,
including traversal orders of the insertion positions, heading extraction
explicitly or implicitly, tolerance to insertion errors in predecessor steps,
and so on. The empirical experiments based on thousands of long documents from
Chinese, English financial market and English scientific publication show that
the HELD model with the ""root-to-leaf"" traversal order and explicit heading
extraction is the best choice to achieve the tradeoff between effectiveness and
efficiency with the accuracy of 0.9726, 0.7291 and 0.9578 in Chinese financial,
English financial and arXiv datasets, respectively. Finally, we show that
logical document hierarchy can be employed to significantly improve the
performance of the downstream passage retrieval task. In summary, we conduct a
systematic study on this task in terms of methods, evaluations, and
applications.
","[{'version': 'v1', 'created': 'Fri, 14 May 2021 06:26:22 GMT'}]",2021-05-21,"[['Cao', 'Rongyu', ''], ['Cao', 'Yixuan', ''], ['Zhou', 'Ganbin', ''], ['Luo', 'Ping', '']]","['logical document hierarchy', 'long documents', 'passage retrieval']"
153,1305.4077,Riadh Bouslimi,"Abir Messaoudi, Riadh Bouslimi, Jalel Akaichi",Indexing Medical Images based on Collaborative Experts Reports,"9 pages, 8 figures. International Journal of Computer Applications,
  May 2013",,10.5120/11955-7787,,cs.CV cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A patient is often willing to quickly get, from his physician, reliable
analysis and concise explanation according to provided linked medical images.
The fact of making choices individually by the patient's physician may lead to
malpractices and consequently generates unforeseeable damages. The Institute of
Medicine of the National Sciences Academy(IMNAS) in USA published a study
estimating that up to 98,000 hospital deathseach year can be attributed to
medical malpractice [1]. Moreover, physician, in charge of medical image
analysis, might be unavailable at the right time, which may complicate the
patient's state. The goal of this paper is to provide to physicians and
patients, a social network that permits to foster cooperation and to overcome
the problem of unavailability of doctors on site any time. Therefore, patients
can submit their medical images to be diagnosed and commented by several
experts instantly. Consequently, the need to process opinions and to extract
information automatically from the proposed social network became a necessity
due to the huge number of comments expressing specialist's reviews. For this
reason, we propose a kind of comments' summary keywords-based method which
extracts the major current terms and relevant words existing on physicians'
annotations. The extracted keywords will present a new and robust method for
image indexation. In fact, significant extracted terms will be used later to
index images in order to facilitate their discovery for any appropriate use. To
overcome this challenge, we propose our Terminology Extraction of Annotation
(TEA) mixed approach which focuses on algorithms mainly based on statistical
methods and on external semantic resources.
","[{'version': 'v1', 'created': 'Fri, 17 May 2013 13:43:57 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Jul 2013 18:01:35 GMT'}]",2015-06-16,"[['Messaoudi', 'Abir', ''], ['Bouslimi', 'Riadh', ''], ['Akaichi', 'Jalel', '']]","['Medical social network', 'Social network analysis', 'indexation', 'mixed approach', 'relevant words extraction', 'text mining', 'Medicalimages']"
154,1608.08831,Guillaume Noyel,"Guillaume Noyel (IPRI), Michel Jourlin (IPRI, LHC)","Spatio-Colour Aspl\""und 's Metric and Logarithmic Image Processing for
  Colour Images (LIPC)",,"C\'esar Beltr\'an-Casta\~n\'on, Ingela Nystr\""om, Fazel Famili
  CIARP2016 - XXI IberoAmerican Congress on Pattern Recognition, Nov 2016,
  Lima, Peru. Springer, 10125 2017, pp.36-43, 2016, Progress in Pattern
  Recognition, Image Analysis, Computer Vision, and Applications: 21st
  Iberoamerican Congress, CIARP 2016, Lima, Peru, November 8--11, 2016,
  Proceedings",10.1007/978-3-319-52277-7_5,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aspl\""und 's metric, which is useful for pattern matching, consists in a
double-sided probing, i.e. the over-graph and the sub-graph of a function are
probed jointly. This paper extends the Aspl\""und 's metric we previously
defined for colour and multivariate images using a marginal approach (i.e.
component by component) to the first spatio-colour Aspl\""und 's metric based on
the vectorial colour LIP model (LIPC). LIPC is a non-linear model with
operations between colour images which are consistent with the human visual
system. The defined colour metric is insensitive to lighting variations and a
variant which is robust to noise is used for colour pattern matching.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2016 12:49:12 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Feb 2017 16:08:29 GMT'}]",2017-02-28,"[['Noyel', 'Guillaume', '', 'IPRI'], ['Jourlin', 'Michel', '', 'IPRI, LHC']]","['Aspl¨und’s metric', 'spatio-colour metric', 'colour LogarithmicImage Processing', 'double-sided probing', 'colour pattern recognition']"
155,1310.8097,"Hans-Peter Schr\""ocker","Hans-Peter Schr\""ocker, Matthias J. Weber",Guaranteed Collision Detection With Toleranced Motions,Accepted for publication in Computer Aided Geometric Design,"Comput. Aided Geom. Design, 31(7-8):602-612, 2014",10.1016/j.cagd.2014.08.001,,cs.CG cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a method for guaranteed collision detection with toleranced
motions. The basic idea is to consider the motion as a curve in the
12-dimensional space of affine displacements, endowed with an object-oriented
Euclidean metric, and cover it with balls. The associated orbits of points,
lines, planes and polygons have particularly simple shapes that lend themselves
well to exact and fast collision queries. We present formulas for elementary
collision tests with these orbit shapes and we suggest an algorithm, based on
motion subdivision and computation of bounding balls, that can give a
no-collision guarantee. It allows a robust and efficient implementation and
parallelization. At hand of several examples we explore the asymptotic behavior
of the algorithm and compare different implementation strategies.
","[{'version': 'v1', 'created': 'Wed, 30 Oct 2013 10:41:32 GMT'}, {'version': 'v2', 'created': 'Sat, 14 Jun 2014 07:16:00 GMT'}, {'version': 'v3', 'created': 'Thu, 14 Aug 2014 19:01:23 GMT'}]",2018-07-31,"[['Schröcker', 'Hans-Peter', ''], ['Weber', 'Matthias J.', '']]","['Toleranced motion', 'collision detection', 'bounding ball', 'bounding volumes']"
156,1512.07143,Marc Bola\~nos,"Mariella Dimiccoli and Marc Bola\~nos and Estefania Talavera and
  Maedeh Aghaei and Stavri G. Nikolov and Petia Radeva","SR-Clustering: Semantic Regularized Clustering for Egocentric Photo
  Streams Segmentation","23 pages, 10 figures, 2 tables. In Press in Computer Vision and Image
  Understanding Journal",,10.1016/j.cviu.2016.10.005,,cs.AI cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While wearable cameras are becoming increasingly popular, locating relevant
information in large unstructured collections of egocentric images is still a
tedious and time consuming processes. This paper addresses the problem of
organizing egocentric photo streams acquired by a wearable camera into
semantically meaningful segments. First, contextual and semantic information is
extracted for each image by employing a Convolutional Neural Networks approach.
Later, by integrating language processing, a vocabulary of concepts is defined
in a semantic space. Finally, by exploiting the temporal coherence in photo
streams, images which share contextual and semantic attributes are grouped
together. The resulting temporal segmentation is particularly suited for
further analysis, ranging from activity and event recognition to semantic
indexing and summarization. Experiments over egocentric sets of nearly 17,000
images, show that the proposed approach outperforms state-of-the-art methods.
","[{'version': 'v1', 'created': 'Tue, 22 Dec 2015 16:13:54 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Oct 2016 09:40:11 GMT'}]",2016-11-03,"[['Dimiccoli', 'Mariella', ''], ['Bolaños', 'Marc', ''], ['Talavera', 'Estefania', ''], ['Aghaei', 'Maedeh', ''], ['Nikolov', 'Stavri G.', ''], ['Radeva', 'Petia', '']]","['temporal segmentation', 'egocentric vision', 'photo streams clustering']"
157,1809.02266,Yucheng Fu,"Yucheng Fu, Yang Liu","BubGAN: Bubble Generative Adversarial Networks for Synthesizing
  Realistic Bubbly Flow Images","20 pages, 15 figures",,10.1016/j.ces.2019.04.004,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bubble segmentation and size detection algorithms have been developed in
recent years for their high efficiency and accuracy in measuring bubbly
two-phase flows. In this work, we proposed an architecture called bubble
generative adversarial networks (BubGAN) for the generation of realistic
synthetic images which could be further used as training or benchmarking data
for the development of advanced image processing algorithms. The BubGAN is
trained initially on a labeled bubble dataset consisting of ten thousand
images. By learning the distribution of these bubbles, the BubGAN can generate
more realistic bubbles compared to the conventional models used in the
literature. The trained BubGAN is conditioned on bubble feature parameters and
has full control of bubble properties in terms of aspect ratio, rotation angle,
circularity and edge ratio. A million bubble dataset is pre-generated using the
trained BubGAN. One can then assemble realistic bubbly flow images using this
dataset and associated image processing tool. These images contain detailed
bubble information, therefore do not require additional manual labeling. This
is more useful compared with the conventional GAN which generates images
without labeling information. The tool could be used to provide benchmarking
and training data for existing image processing algorithms and to guide the
future development of bubble detecting algorithms.
","[{'version': 'v1', 'created': 'Fri, 7 Sep 2018 01:19:59 GMT'}]",2019-11-22,"[['Fu', 'Yucheng', ''], ['Liu', 'Yang', '']]","['Realistic bubble synthesis', 'object counting', 'bubble segmentation', 'generative adversarial networks', 'image processing']"
158,1307.3295,Tareq Alhmiedat,"Tareq Alhmiedat, Amer O. Abu Salem, and Anas Abu Taleb","An imporved decentralized approach for tracking multiple mobile targets
  through ZigBee WSNs",16 pages,,10.5121/ijwmn.2013.5305,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Target localization and tracking problems in WSNs have received considerable
attention recently, driven by the requirement to achieve high localization
accuracy, with the minimum cost possible. In WSN based tracking applications,
it is critical to know the current location of any sensor node with the minimum
energy consumed. This paper focuses on the energy consumption issue in terms of
communication between nodes whenever the localization information is
transmitted to a sink node. Tracking through WSNs can be categorized into
centralized and decentralized systems. Decentralized systems offer low power
consumption when deployed to track a small number of mobile targets compared to
the centralized tracking systems. However, in several applications, it is
essential to position a large number of mobile targets. In such applications,
decentralized systems offer high power consumption, since the location of each
mobile target is required to be transmitted to a sink node, and this increases
the power consumption for the whole WSN. In this paper, we propose a power
efficient decentralized approach for tracking a large number of mobile targets
while offering reasonable localization accuracy through ZigBee network.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2013 23:39:46 GMT'}]",2013-07-15,"[['Alhmiedat', 'Tareq', ''], ['Salem', 'Amer O. Abu', ''], ['Taleb', 'Anas Abu', '']]","['Localization', 'Tracking', 'Decentralized', 'Wireless Sensor Networks', 'ZigBee']"
159,1612.01837,Chengqing Li,"Qiuye Gan, Simin Yu, Chengqing Li, Jinhu L\""u, Zhuosheng Lin, Ping
  Chen","Design and ARM-embedded implementation of a chaotic map-based multicast
  scheme for multiuser speech wireless communication","22 pages, 14 figures in International Journal of Circuit Theory and
  Applications, 2017",,10.1002/cta.2300,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a chaotic map-based multicast scheme for multiuser speech
wireless communication and implements it in an ARM platform. The scheme
compresses the digital audio signal decoded by a sound card and then encrypts
it with a three-level chaotic encryption scheme. First, the position of every
bit of the compressed data is permuted randomly with a pseudo-random number
sequence (PRNS) generated by a 6-D chaotic map. Then, the obtained data are
further permuted in the level of byte with a PRNS generated by a 7-D chaotic
map. Finally, it is operated with a multiround chaotic stream cipher. The whole
system owns the following merits: the redundancy in the original audio file is
reduced effectively and the corresponding unicity distance is increased; the
balancing point between a high security level of the system and real-time
conduction speed is achieved well. In the ARM implementation, the framework of
communication of multicast-multiuser in a subnet and the Internet Group Manage
Protocol is adopted to obtain the function of communication between one client
and other ones. Comprehensive test results were provided to show the
feasibility and security performance of the whole system.
","[{'version': 'v1', 'created': 'Tue, 6 Dec 2016 14:55:29 GMT'}]",2016-12-07,"[['Gan', 'Qiuye', ''], ['Yu', 'Simin', ''], ['Li', 'Chengqing', ''], ['Lü', 'Jinhu', ''], ['Lin', 'Zhuosheng', ''], ['Chen', 'Ping', '']]","['ARM-embedded implementation', 'multicast-multiuser', 'chaotic map', 'securecommunication', 'speech', 'WIFI']"
160,1606.07583,Biljana Risteska Stojkoska Dr,"Biljana Stojkoska, Danco Davcev and Vladimir Trajkovik","N-queens-based algorithm for moving object detection in distributed
  wireless sensor networks",6 pages,"Proceedings of the ITI 2008 30th Int. Conf. on Information
  Technology Interfaces, June 23-26, 2008, Cavtat, Croatia, pp.899-904",10.1109/ITI.2008.4588530,,cs.MM cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The main constraint of wireless sensor networks (WSN) in enabling wireless
image communication is the high energy requirement, which may exceed even the
future capabilities of battery technologies. In this paper we have shown that
this bottleneck can be overcome by developing local in-network image processing
algorithm that offers optimal energy consumption. Our algorithm is very
suitable for intruder detection applications. Each node is responsible for
processing the image captured by the video sensor, which consists of NxN
blocks. If an intruder is detected in the monitoring region, the node will
transmit the image for further processing. Otherwise, the node takes no action.
Results provided from our experiments show that our algorithm is better than
the traditional moving object detection techniques by a factor of (N/2) in
terms of energy savings.
","[{'version': 'v1', 'created': 'Fri, 24 Jun 2016 07:18:42 GMT'}]",2016-07-01,"[['Stojkoska', 'Biljana', ''], ['Davcev', 'Danco', ''], ['Trajkovik', 'Vladimir', '']]","['Wireless Sensor Networks', 'Multimedia', 'Image Processing', 'Motion Detection']"
161,1405.7868,Priya Bajaj,Priya Bajaj and Supriya Raheja,A Vague Improved Markov Model Approach for Web Page Prediction,"8 pages, 4 figures, 1 table, International Journal of Computer
  Science & Engineering Survey (IJCSES) Vol.5, No.2, April 2014",,10.5121/ijcses.2014.5205,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today most of the information in all areas is available over the web. It
increases the web utilization as well as attracts the interest of researchers
to improve the effectiveness of web access and web utilization. As the number
of web clients gets increased, the bandwidth sharing is performed that
decreases the web access efficiency. Web page prefetching improves the
effectiveness of web access by availing the next required web page before the
user demand. It is an intelligent predictive mining that analyze the user web
access history and predict the next page. In this work, vague improved markov
model is presented to perform the prediction. In this work, vague rules are
suggested to perform the pruning at different levels of markov model. Once the
prediction table is generated, the association mining will be implemented to
identify the most effective next page. In this paper, an integrated model is
suggested to improve the prediction accuracy and effectiveness.
","[{'version': 'v1', 'created': 'Thu, 8 May 2014 07:52:20 GMT'}]",2014-06-02,"[['Bajaj', 'Priya', ''], ['Raheja', 'Supriya', '']]","['Vague Rule', 'Markov Model', 'predictive', 'Web Usage Mining  1']"
162,1604.06707,"G\""unter Rote","Felix Herter and G\""unter Rote",Loopless Gray Code Enumeration and the Tower of Bucharest,"16 pages plus 8 pages of appendix with Python programs, 6 figures. A
  Python script to extract the program code from the LaTeX file is attached to
  the sources","Theoretical Computer Science 748 (2018), 40-54",10.1016/j.tcs.2017.11.017,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give new algorithms for generating all n-tuples over an alphabet of m
letters, changing only one letter at a time (Gray codes). These algorithms are
based on the connection with variations of the Towers of Hanoi game. Our
algorithms are loopless, in the sense that the next change can be determined in
a constant number of steps, and they can be implemented in hardware. We also
give another family of loopless algorithms that is based on the idea of working
ahead and saving the work in a buffer.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2016 15:19:24 GMT'}]",2018-11-26,"[['Herter', 'Felix', ''], ['Rote', 'Günter', '']]","['Tower of Hanoi', 'Gray code', 'enumeration', 'loopless generation']"
163,1505.03795,Houssam Abdul-Rahman,Houssam Abdul-Rahman and Nikolai Chernov,Fast and numerically stable circle fit,16 pages,"Journal of Mathematical Imaging and Vision June 2014, Volume 49,
  Issue 2, pp 289-295",10.1007/s10851-013-0461-4,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop a new algorithm for fitting circles that does not have drawbacks
commonly found in existing circle fits. Our fit achieves ultimate accuracy (to
machine precision), avoids divergence, and is numerically stable even when
fitting circles get arbitrary large. Lastly, our algorithm takes less than 10
iterations to converge, on average.
","[{'version': 'v1', 'created': 'Thu, 14 May 2015 16:43:07 GMT'}]",2022-10-13,"[['Abdul-Rahman', 'Houssam', ''], ['Chernov', 'Nikolai', '']]","['fitting circles', 'geometric fit', 'Levenberg-Marquardt', 'Gauss-Newton']"
164,1610.08833,Erik Schnetter,"Anshu Dubey, Ann Almgren, John Bell, Martin Berzins, Steve Brandt,
  Greg Bryan, Phillip Colella, Daniel Graves, Michael Lijewski, Frank
  L\""offler, Brian O'Shea, Erik Schnetter, Brian Van Straalen, Klaus Weide","A Survey of High Level Frameworks in Block-Structured Adaptive Mesh
  Refinement Packages",,"Journal of Parallel and Distributed Computing, Volume 74, Issue
  12, December 2014, Pages 3217-3227",10.1016/j.jpdc.2014.07.001,,cs.DC astro-ph.HE gr-qc,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the last decade block-structured adaptive mesh refinement (SAMR) has
found increasing use in large, publicly available codes and frameworks. SAMR
frameworks have evolved along different paths. Some have stayed focused on
specific domain areas, others have pursued a more general functionality,
providing the building blocks for a larger variety of applications. In this
survey paper we examine a representative set of SAMR packages and SAMR-based
codes that have been in existence for half a decade or more, have a reasonably
sized and active user base outside of their home institutions, and are publicly
available. The set consists of a mix of SAMR packages and application codes
that cover a broad range of scientific domains. We look at their high-level
frameworks, and their approach to dealing with the advent of radical changes in
hardware architecture. The codes included in this survey are BoxLib, Cactus,
Chombo, Enzo, FLASH, and Uintah.
","[{'version': 'v1', 'created': 'Thu, 27 Oct 2016 15:23:34 GMT'}]",2016-10-28,"[['Dubey', 'Anshu', ''], ['Almgren', 'Ann', ''], ['Bell', 'John', ''], ['Berzins', 'Martin', ''], ['Brandt', 'Steve', ''], ['Bryan', 'Greg', ''], ['Colella', 'Phillip', ''], ['Graves', 'Daniel', ''], ['Lijewski', 'Michael', ''], ['Löffler', 'Frank', ''], [""O'Shea"", 'Brian', ''], ['Schnetter', 'Erik', ''], ['Van Straalen', 'Brian', ''], ['Weide', 'Klaus', '']]","['SAMR', 'BoxLib', 'Chombo', 'FLASH', 'Cactus', 'Enzo', 'Uintah']"
165,1402.1246,Rubia  R,"Ms.Rubia.R, Mr.SivanArulSelvan","A Survey on Mobile Data Gathering in Wireless Sensor Networks - Bounded
  Relay","4 pages, 1 figure, ""Published with International Journal of
  Engineering Trends and Technology (IJETT)""","IJETT, 7(5),205-208,2014 published by seventh sense research group",10.14445/22315381/IJETT-V7P247,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most of the wireless sensor networks consist of static sensors, which can be
deployed in a wide environment for monitoring applications. While transmitting
the data from source to static sink, the amount of energy consumption of the
sensor node is high. It results in reduced lifetime of the network.Some of the
WSN architectures have been proposed based on Mobile Elements. There is large
number of approaches to resolve the above problem. It is found those two
approaches, namely Single Hop Data Gathering problem (SHDGP) and mobile Data
Gathering, which is used to increase the lifetime of the network. Single Hop
Data Gathering Problem is used to achieve the uniform energy consumption. The
mobile Data Gathering algorithm is used to find the minimal set of points in
the sensor network, which serves as data gathering points for mobile network.
Even after so many decades of research, there are some unresolved problems like
non uniform energy consumption, increased latency, which needs to be resolved.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2014 05:11:35 GMT'}]",2014-02-07,"[['R', 'Ms. Rubia.', ''], ['SivanArulSelvan', 'Mr.', '']]","['Mobile Collector', 'SenCar', 'Polling Point', 'Neighbour set', 'Candidate polling point', 'mobile Data Gathering', 'SDMA']"
166,0704.3890,Valmir Barbosa,"Rodolfo M. Pussente, Valmir C. Barbosa","An algorithm for clock synchronization with the gradient property in
  sensor networks",,"Journal of Parallel and Distributed Computing 69 (2009), 261-265",10.1016/j.jpdc.2008.11.001,,cs.DC,,"  We introduce a distributed algorithm for clock synchronization in sensor
networks. Our algorithm assumes that nodes in the network only know their
immediate neighborhoods and an upper bound on the network's diameter.
Clock-synchronization messages are only sent as part of the communication,
assumed reasonably frequent, that already takes place among nodes. The
algorithm has the gradient property of [2], achieving an O(1) worst-case skew
between the logical clocks of neighbors. As in the case of [3,8], the
algorithm's actions are such that no constant lower bound exists on the rate at
which logical clocks progress in time, and for this reason the lower bound of
[2,5] that forbids constant skew between neighbors does not apply.
","[{'version': 'v1', 'created': 'Mon, 30 Apr 2007 19:59:14 GMT'}]",2009-02-05,"[['Pussente', 'Rodolfo M.', ''], ['Barbosa', 'Valmir C.', '']]","['Distributed computing', 'Sensor networks', 'Clock synchronization', 'Gradient property in clock synchronization']"
167,1509.04064,Michael Castronovo,"Michael Castronovo, Damien Ernst, Adrien Couetoux, Raphael Fonteneau",Benchmarking for Bayesian Reinforcement Learning,37 pages,,10.1371/journal.pone.0157088,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the Bayesian Reinforcement Learning (BRL) setting, agents try to maximise
the collected rewards while interacting with their environment while using some
prior knowledge that is accessed beforehand. Many BRL algorithms have already
been proposed, but even though a few toy examples exist in the literature,
there are still no extensive or rigorous benchmarks to compare them. The paper
addresses this problem, and provides a new BRL comparison methodology along
with the corresponding open source library. In this methodology, a comparison
criterion that measures the performance of algorithms on large sets of Markov
Decision Processes (MDPs) drawn from some probability distributions is defined.
In order to enable the comparison of non-anytime algorithms, our methodology
also includes a detailed analysis of the computation time requirement of each
algorithm. Our library is released with all source code and documentation: it
includes three test problems, each of which has two different prior
distributions, and seven state-of-the-art RL algorithms. Finally, our library
is illustrated by comparing all the available algorithms and the results are
discussed.
","[{'version': 'v1', 'created': 'Mon, 14 Sep 2015 12:47:52 GMT'}]",2016-09-28,"[['Castronovo', 'Michael', ''], ['Ernst', 'Damien', ''], ['Couetoux', 'Adrien', ''], ['Fonteneau', 'Raphael', '']]","['Bayesian Reinforcement Learning', 'Benchmarking', 'BBRL library', 'OfflineLearning', 'Reinforcement Learning']"
168,1507.02139,Giuseppe Carbone Dr.,"Giuseppe Carbone, Ilaria Giannoccaro",Model of human collective decision-making in complex environments,"12 pages, 8 figues in European Physical Journal B, 2015","European Physical Journal B, 88 (12), 339, 2015",10.1140/epjb/e2015-60609-0,,cs.MA cs.AI nlin.AO physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A continuous-time Markov process is proposed to analyze how a group of humans
solves a complex task, consisting in the search of the optimal set of decisions
on a fitness landscape. Individuals change their opinions driven by two
different forces: (i) the self-interest, which pushes them to increase their
own fitness values, and (ii) the social interactions, which push individuals to
reduce the diversity of their opinions in order to reach consensus. Results
show that the performance of the group is strongly affected by the strength of
social interactions and by the level of knowledge of the individuals.
Increasing the strength of social interactions improves the performance of the
team. However, too strong social interactions slow down the search of the
optimal solution and worsen the performance of the group. In particular, we
find that the threshold value of the social interaction strength, which leads
to the emergence of a superior intelligence of the group, is just the critical
threshold at which the consensus among the members sets in. We also prove that
a moderate level of knowledge is already enough to guarantee high performance
of the group in making decisions.
","[{'version': 'v1', 'created': 'Wed, 8 Jul 2015 13:14:16 GMT'}, {'version': 'v2', 'created': 'Fri, 30 Oct 2015 15:06:52 GMT'}]",2015-12-21,"[['Carbone', 'Giuseppe', ''], ['Giannoccaro', 'Ilaria', '']]","['Decision making', 'social interactions', 'complexity', 'Markov chains']"
169,1511.09295,Savvas Zannettou,"Savvas Zannettou, Michael Sirivianos, Fragkiskos Papadopoulos",Exploiting Path Diversity in Datacenters using MPTCP-aware SDN,"8 pages, 7 figures, ISCC 2016, Messina, Italy","ISCC 2016, p.564-571",10.1109/ISCC.2016.7543794,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, Multipath TCP (MPTCP) has been proposed as an alternative transport
approach for datacenter networks. MPTCP provides the ability to split a flow
into multiple paths thus providing better performance and resilience to
failures. Usually, MPTCP is combined with flow-based Equal-Cost Multi-Path
Routing (ECMP), which uses random hashing to split the MPTCP subflows over
different paths. However, random hashing can be suboptimal as distinct subflows
may end up using the same paths, while other available paths remain unutilized.
In this paper, we explore an MPTCP-aware SDN controller that facilitates an
alternative routing mechanism for the MPTCP subflows. The controller uses
packet inspection to provide deterministic subflow assignment to paths. Using
the controller, we show that MPTCP can deliver significantly improved
performance when connections are not limited by the access links of hosts. To
lessen the effect of throughput limitation due to access links, we also
investigate the usage of multiple interfaces at the hosts. We demonstrate,
using our modification of the MPTCP Linux Kernel, that using multiple subflows
per pair of IP addresses can yield improved performance in multi-interface
settings.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2015 13:19:48 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Aug 2016 08:53:38 GMT'}]",2016-08-31,"[['Zannettou', 'Savvas', ''], ['Sirivianos', 'Michael', ''], ['Papadopoulos', 'Fragkiskos', '']]","['Datacenters', 'Multipath-TCP', 'MPTCP-aware SDN']"
170,1912.04465,Yudong Jiang,"Yudong Jiang, Kaixu Cui, Leilei Chen, Canjin Wang, Changliang Xu",SoccerDB: A Large-Scale Database for Comprehensive Video Understanding,accepted by MM2020 sports workshop,,10.1145/3422844.3423051,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Soccer videos can serve as a perfect research object for video understanding
because soccer games are played under well-defined rules while complex and
intriguing enough for researchers to study. In this paper, we propose a new
soccer video database named SoccerDB, comprising 171,191 video segments from
346 high-quality soccer games. The database contains 702,096 bounding boxes,
37,709 essential event labels with time boundary and 17,115 highlight
annotations for object detection, action recognition, temporal action
localization, and highlight detection tasks. To our knowledge, it is the
largest database for comprehensive sports video understanding on various
aspects. We further survey a collection of strong baselines on SoccerDB, which
have demonstrated state-of-the-art performances on independent tasks. Our
evaluation suggests that we can benefit significantly when jointly considering
the inner correlations among those tasks. We believe the release of SoccerDB
will tremendously advance researches around comprehensive video understanding.
{\itshape Our dataset and code published on
https://github.com/newsdata/SoccerDB.}
","[{'version': 'v1', 'created': 'Tue, 10 Dec 2019 02:57:28 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Dec 2019 05:51:47 GMT'}, {'version': 'v3', 'created': 'Tue, 23 Jun 2020 03:16:38 GMT'}, {'version': 'v4', 'created': 'Tue, 8 Sep 2020 13:27:22 GMT'}]",2020-09-09,"[['Jiang', 'Yudong', ''], ['Cui', 'Kaixu', ''], ['Chen', 'Leilei', ''], ['Wang', 'Canjin', ''], ['Xu', 'Changliang', '']]","['object detection', 'action recognition', 'temporal action localization', 'highlight detection']"
171,2105.10464,David Cerezo S\'anchez,David Cerezo S\'anchez,Pravuil: Global Consensus for a United World,,"FinTech 2022, 1(4), 325-344",10.3390/fintech1040025,,cs.CR cs.DC econ.GN q-fin.EC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pravuil is a robust, secure, and scalable consensus protocol for a
permissionless blockchain suitable for deployment in an adversarial environment
such as the Internet. Pravuil circumvents previous shortcomings of other
blockchains:
  - Bitcoin's limited adoption problem: as transaction demand grows, payment
confirmation times grow much lower than other PoW blockchains
  - higher transaction security at a lower cost
  - more decentralisation than other permissionless blockchains
  - impossibility of full decentralisation and the blockchain scalability
trilemma: decentralisation, scalability, and security can be achieved
simultaneously
  - Sybil-resistance for free implementing the social optimum
  - Pravuil goes beyond the economic limits of Bitcoin or other PoW/PoS
blockchains, leading to a more valuable and stable crypto-currency
","[{'version': 'v1', 'created': 'Fri, 21 May 2021 17:02:14 GMT'}]",2022-11-02,"[['Sánchez', 'David Cerezo', '']]","['consensus', 'permissionless', 'permissioned', 'scalability', 'zeroknowledge', 'mutual attestation', 'zk-PoI']"
172,1507.04576,Maedeh Aghaei,Maedeh Aghaei and Mariella Dimiccoli and Petia Radeva,Multi-Face Tracking by Extended Bag-of-Tracklets in Egocentric Videos,"27 pages, 18 figures, submitted to computer vision and image
  understanding journal",,10.1016/j.cviu.2016.02.013,YCVIU2393,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wearable cameras offer a hands-free way to record egocentric images of daily
experiences, where social events are of special interest. The first step
towards detection of social events is to track the appearance of multiple
persons involved in it. In this paper, we propose a novel method to find
correspondences of multiple faces in low temporal resolution egocentric videos
acquired through a wearable camera. This kind of photo-stream imposes
additional challenges to the multi-tracking problem with respect to
conventional videos. Due to the free motion of the camera and to its low
temporal resolution, abrupt changes in the field of view, in illumination
condition and in the target location are highly frequent. To overcome such
difficulties, we propose a multi-face tracking method that generates a set of
tracklets through finding correspondences along the whole sequence for each
detected face and takes advantage of the tracklets redundancy to deal with
unreliable ones. Similar tracklets are grouped into the so called extended
bag-of-tracklets (eBoT), which is aimed to correspond to a specific person.
Finally, a prototype tracklet is extracted for each eBoT, where the occurred
occlusions are estimated by relying on a new measure of confidence. We
validated our approach over an extensive dataset of egocentric photo-streams
and compared it to state of the art methods, demonstrating its effectiveness
and robustness.
","[{'version': 'v1', 'created': 'Thu, 16 Jul 2015 13:51:47 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Jan 2016 12:26:09 GMT'}]",2017-01-24,"[['Aghaei', 'Maedeh', ''], ['Dimiccoli', 'Mariella', ''], ['Radeva', 'Petia', '']]","['Egocentric vision', 'face tracking', 'low frame rate video analysis']"
173,2105.04273,Junaid Ali,"Junaid Ali, Muhammad Bilal Zafar, Adish Singla, Krishna P. Gummadi",Loss-Aversively Fair Classification,"8 pages, Accepted at AIES 2019","In AAAI/ACM Conference on AI, Ethics, and Society (AIES 2019),
  January 27-28 2019 Honolulu, HI, USA",10.1145/3461702.3462630,,cs.LG cs.CY,http://creativecommons.org/licenses/by/4.0/,"  The use of algorithmic (learning-based) decision making in scenarios that
affect human lives has motivated a number of recent studies to investigate such
decision making systems for potential unfairness, such as discrimination
against subjects based on their sensitive features like gender or race.
However, when judging the fairness of a newly designed decision making system,
these studies have overlooked an important influence on people's perceptions of
fairness, which is how the new algorithm changes the status quo, i.e.,
decisions of the existing decision making system. Motivated by extensive
literature in behavioral economics and behavioral psychology (prospect theory),
we propose a notion of fair updates that we refer to as loss-averse updates.
Loss-averse updates constrain the updates to yield improved (more beneficial)
outcomes to subjects compared to the status quo. We propose tractable proxy
measures that would allow this notion to be incorporated in the training of a
variety of linear and non-linear classifiers. We show how our proxy measures
can be combined with existing measures for training nondiscriminatory
classifiers. Our evaluation using synthetic and real-world datasets
demonstrates that the proposed proxy measures are effective for their desired
tasks.
","[{'version': 'v1', 'created': 'Mon, 10 May 2021 11:19:27 GMT'}]",2021-05-11,"[['Ali', 'Junaid', ''], ['Zafar', 'Muhammad Bilal', ''], ['Singla', 'Adish', ''], ['Gummadi', 'Krishna P.', '']]","['Algorithmic Fairness', 'Fair Updates', 'Fairness in Machine Learning', 'Loss-averse Fairness']"
174,1405.2362,Yan Fang,"Yan Fang, Matthew J. Cotter, Donald M. Chiarulli, Steven P. Levitan",Image Segmentation Using Frequency Locking of Coupled Oscillators,"7 pages, 14 figures, the 51th Design Automation Conference 2014, Work
  in Progress Poster Session",,10.1109/CNNA.2014.6888657,,cs.CV q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Synchronization of coupled oscillators is observed at multiple levels of
neural systems, and has been shown to play an important function in visual
perception. We propose a computing system based on locally coupled oscillator
networks for image segmentation. The system can serve as the preprocessing
front-end of an image processing pipeline where the common frequencies of
clusters of oscillators reflect the segmentation results. To demonstrate the
feasibility of our design, the system is simulated and tested on a human face
image dataset and its performance is compared with traditional intensity
threshold based algorithms. Our system shows both better performance and higher
noise tolerance than traditional methods.
","[{'version': 'v1', 'created': 'Fri, 9 May 2014 21:53:05 GMT'}]",2014-09-24,"[['Fang', 'Yan', ''], ['Cotter', 'Matthew J.', ''], ['Chiarulli', 'Donald M.', ''], ['Levitan', 'Steven P.', '']]","['Oscillator', 'Computer Vision', 'Image Segmentation']"
175,1902.09779,Tanweer Alam,Tanweer Alam,Blockchain and its Role in the Internet of Things (IoT),7 Pages,"International Journal of Scientific Research in Computer Science,
  Engineering and Information Technology, pp. 151-157, 2019",10.32628/CSEIT195137,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  Blockchain (BC) in the Internet of Things (IoT) is a novel technology that
acts with decentralized, distributed, public and real-time ledger to store
transactions among IoT nodes. A blockchain is a series of blocks, each block is
linked to its previous blocks. Every block has the cryptographic hash code,
previous block hash, and its data. The transactions in BC are the basic units
that are used to transfer data between IoT nodes. The IoT nodes are different
kind of physical but smart devices with embedded sensors, actuators, programs
and able to communicate with other IoT nodes. The role of BC in IoT is to
provide a procedure to process secured records of data through IoT nodes. BC is
a secured technology that can be used publicly and openly. IoT requires this
kind of technology to allow secure communication among IoT nodes in
heterogeneous environment. The transactions in BC could be traced and explored
through anyone who are authenticated to communicate within the IoT. The BC in
IoT may help to improve the communication security. In this paper, I explored
this approach, its opportunities and challenges.
","[{'version': 'v1', 'created': 'Tue, 26 Feb 2019 07:48:10 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Jun 2020 14:26:48 GMT'}]",2020-06-08,"[['Alam', 'Tanweer', '']]","['Blockchain', 'Internet of Things (IoT)', 'Cryptography', 'Security', 'Communication']"
176,1804.06025,Vahid Rasouli Disfani,"Changfu Li, Vahid R. Disfani, Zachary K. Pecenak, Saeed Mohajeryami,
  Jan Kleissl",Optimal OLTC Voltage Control Scheme to Enable High Solar Penetrations,,"Li, Changfu, Vahid R. Disfani, Zachary K. Pecenak, Saeed
  Mohajeryami, and Jan Kleissl. ""Optimal OLTC voltage control scheme to enable
  high solar penetrations."" Electric Power Systems Research 160 (2018): 318-326",10.1016/j.epsr.2018.02.016,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  High solar Photovoltaic (PV) penetration on distribution systems can cause
over-voltage problems. To this end, an Optimal Tap Control (OTC) method is
proposed to regulate On-Load Tap Changers (OLTCs) by minimizing the maximum
deviation of the voltage profile from 1~p.u. on the entire feeder. A secondary
objective is to reduce the number of tap operations (TOs), which is implemented
for the optimization horizon based on voltage forecasts derived from high
resolution PV generation forecasts. A linearization technique is applied to
make the optimization problem convex and able to be solved at operational
timescales. Simulations on a PC show the solution time for one time step is
only 1.1~s for a large feeder with 4 OLTCs and 1623 buses. OTC results are
compared against existing methods through simulations on two feeders in the
Californian network. OTC is firstly compared against an advanced rule-based
Voltage Level Control (VLC) method. OTC and VLC achieve the same reduction of
voltage violations, but unlike VLC, OTC is capable of coordinating multiple
OLTCs. Scalability to multiple OLTCs is therefore demonstrated against a basic
conventional rule-based control method called Autonomous Tap Control (ATC).
Comparing to ATC, the test feeder under control of OTC can accommodate around
67\% more PV without over-voltage issues. Though a side effect of OTC is an
increase in tap operations, the secondary objective functionally balances
operations between all OLTCs such that impacts on their lifetime and
maintenance are minimized.
","[{'version': 'v1', 'created': 'Tue, 17 Apr 2018 03:13:08 GMT'}]",2018-04-18,"[['Li', 'Changfu', ''], ['Disfani', 'Vahid R.', ''], ['Pecenak', 'Zachary K.', ''], ['Mohajeryami', 'Saeed', ''], ['Kleissl', 'Jan', '']]","['Optimal voltage control', 'distribution system', 'convexoptimization', 'photovoltaic systems', 'tap changer']"
177,1312.4077,Srinjoy Ganguly Mr.,"Arpita Chakraborty, Srinjoy Ganguly, Mrinal Kanti Naskar and Anupam
  Karmakar","A Trust Based Congestion Aware Hybrid Ant Colony Optimization Algorithm
  for Energy Efficient Routing in Wireless Sensor Networks (TC-ACO)","6 pages, 5 figures and 2 tables (Conference Paper)","Proceedings of the IEEE International Conference on Advanced
  Computing (ICoAC)-2013, pp.XX-XX,Chennai, India, 18 - 20 December (2013)",10.1109/ICoAC.2013.6921940,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Congestion is a problem of paramount importance in resource constrained
Wireless Sensor Networks, especially for large networks, where the traffic
loads exceed the available capacity of the resources. Sensor nodes are prone to
failure and the misbehavior of these faulty nodes creates further congestion.
The resulting effect is a degradation in network performance, additional
computation and increased energy consumption, which in turn decreases network
lifetime. Hence, the data packet routing algorithm should consider congestion
as one of the parameters, in addition to the role of the faulty nodes and not
merely energy efficient protocols. Unfortunately most of the researchers have
tried to make the routing schemes energy efficient without considering
congestion factor and the effect of the faulty nodes. In this paper we have
proposed a congestion aware, energy efficient, routing approach that utilizes
Ant Colony Optimization algorithm, in which faulty nodes are isolated by means
of the concept of trust. The merits of the proposed scheme are verified through
simulations where they are compared with other protocols.
","[{'version': 'v1', 'created': 'Sat, 14 Dec 2013 18:41:22 GMT'}]",2016-11-18,"[['Chakraborty', 'Arpita', ''], ['Ganguly', 'Srinjoy', ''], ['Naskar', 'Mrinal Kanti', ''], ['Karmakar', 'Anupam', '']]","['Wireless Sensor Networks', 'Congestion', 'Trust', 'Energy Efficient Routing', 'Ant Colony Optimization']"
178,1609.02603,Ali Sedighimanesh,"Ali Sedighimanesh, Mohammad Sedighimanesh, Javad Baqeri","Cutting down energy usage in wireless sensor networks using Duty Cycle
  technique and multi-hop routing","19 page, 7 Figures","International Journal of Wireless & Mobile Networks.
  2016;8(4):23-41",10.5121/ijwmn.2016.8402,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A wireless sensor network is composed of many sensor nodes that have been
given out in a specific zone and each of them had an ability of collecting
information from the environment and sending collected data to the sink. The
most significant issues in wireless sensor networks despite the recent progress
is the trouble of the severe limitations of energy resources. Since that in
different applications of sensor nets we could throw a static or mobile sink
then all aspects of such networks should be planned with an awareness of
energy. One of the most significant topics related to these networks is
routing. One of the most widely used and efficient methods of routing is a
hierarchy (based on clustering) method. In The present study with the objective
of cutting down energy consumption and persistence of network coverage we have
offered a novel algorithm based on clustering algorithms and multi hop routing.
To achieve this goal first we layer the network environment based on the size
of the network. We will identify the optimal number of cluster heads and every
cluster head based on the mechanism of topology control will start to accept
members. Likewise we set the first layer as gate layer and subsequently
identifying the gate nodes we would turn away half of the sensors and then stop
using energy and the remaining nodes in this layer will join the gate nodes
because they hold a critical part in bettering the functioning of the system.
Cluster heads off following layers send the information to cluster heads in the
above layer until sent data will be sent to gate nodes and finally will be sent
to sink. We have tested the proposed algorithm in two situations 1) when the
sink is off and 2) when a sink is on and simulation data shows that proposed
algorithm has better performance in terms of the life span of a network than
LEACH and E LEACH protocols.
","[{'version': 'v1', 'created': 'Thu, 8 Sep 2016 21:41:06 GMT'}]",2016-09-12,"[['Sedighimanesh', 'Ali', ''], ['Sedighimanesh', 'Mohammad', ''], ['Baqeri', 'Javad', '']]","['Wireless sensor networks', 'Lifetime', 'Hierarchical clustering', 'Hierarchical Routing', 'Cluster Topology']"
179,1302.1882,Dragan Vidakovic Novak,"Dragan Vidakovic, Olivera Nikolic and Dusko Parezanovic",Acceleration detection of large (probably) prime numbers,"8 pages, 6 figures","International Journal of UbiComp (IJU), Vol.4, No.1, January 2013",10.5121/iju.2013.4101,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to avoid unnecessary applications of Miller-Rabin algorithm to the
number in question, we resort to trial division by a few initial prime numbers,
since such a division take less time.
  How far we should go with such a division is the that we are trying to answer
in this paper?For the theory of the matter is fully resolved. However, that in
practice we do not have much use.
  Therefore, we present a solution that is probably irrelevant to theorists,
but it is very useful to people who have spent many nights to produce large
(probably) prime numbers using its own software.
","[{'version': 'v1', 'created': 'Thu, 7 Feb 2013 21:19:21 GMT'}]",2013-02-11,"[['Vidakovic', 'Dragan', ''], ['Nikolic', 'Olivera', ''], ['Parezanovic', 'Dusko', '']]","['Kryptography', 'Digital Signatures', 'RSA', 'Miller-Rabin', '(Large', 'probably) Prime Numbers']"
180,1902.00703,Giovanni Iacca Dr.,Stefano Fioravanzo and Giovanni Iacca,Evaluating MAP-Elites on Constrained Optimization Problems,,,10.1145/3319619.3321939,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Constrained optimization problems are often characterized by multiple
constraints that, in the practice, must be satisfied with different tolerance
levels. While some constraints are hard and as such must be satisfied with
zero-tolerance, others may be soft, such that non-zero violations are
acceptable. Here, we evaluate the applicability of MAP-Elites to ""illuminate""
constrained search spaces by mapping them into feature spaces where each
feature corresponds to a different constraint. On the one hand, MAP-Elites
implicitly preserves diversity, thus allowing a good exploration of the search
space. On the other hand, it provides an effective visualization that
facilitates a better understanding of how constraint violations correlate with
the objective function. We demonstrate the feasibility of this approach on a
large set of benchmark problems, in various dimensionalities, and with
different algorithmic configurations. As expected, numerical results show that
a basic version of MAP-Elites cannot compete on all problems (especially those
with equality constraints) with state-of-the-art algorithms that use gradient
information or advanced constraint handling techniques. Nevertheless, it has a
higher potential at finding constraint violations vs. objectives trade-offs and
providing new problem information. As such, it could be used in the future as
an effective building-block for designing new constrained optimization
algorithms.
","[{'version': 'v1', 'created': 'Sat, 2 Feb 2019 11:59:29 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Feb 2019 08:04:27 GMT'}, {'version': 'v3', 'created': 'Thu, 4 Apr 2019 14:53:05 GMT'}, {'version': 'v4', 'created': 'Fri, 5 Apr 2019 07:09:37 GMT'}]",2020-12-21,"[['Fioravanzo', 'Stefano', ''], ['Iacca', 'Giovanni', '']]","['Constrained Optimization', 'Evolutionary Computation', 'MAP-Elites']"
181,2105.06524,Hongpeng Guo,"Hongpeng Guo, Shuochao Yao, Zhe Yang, Qian Zhou, Klara Nahrstedt","CrossRoI: Cross-camera Region of Interest Optimization for Efficient
  Real Time Video Analytics at Scale",accepted in 12th ACM Multimedia Systems Conference (MMsys 21'),,10.1145/3458305.3463381,,cs.DC cs.CV cs.MM cs.NI,http://creativecommons.org/licenses/by/4.0/,"  Video cameras are pervasively deployed in city scale for public good or
community safety (i.e. traffic monitoring or suspected person tracking).
However, analyzing large scale video feeds in real time is data intensive and
poses severe challenges to network and computation systems today. We present
CrossRoI, a resource-efficient system that enables real time video analytics at
scale via harnessing the videos content associations and redundancy across a
fleet of cameras. CrossRoI exploits the intrinsic physical correlations of
cross-camera viewing fields to drastically reduce the communication and
computation costs. CrossRoI removes the repentant appearances of same objects
in multiple cameras without harming comprehensive coverage of the scene.
CrossRoI operates in two phases - an offline phase to establish cross-camera
correlations, and an efficient online phase for real time video inference.
Experiments on real-world video feeds show that CrossRoI achieves 42% - 65%
reduction for network overhead and 25% - 34% reduction for response delay in
real time video analytics applications with more than 99% query accuracy, when
compared to baseline methods. If integrated with SotA frame filtering systems,
the performance gains of CrossRoI reach 50% - 80% (network overhead) and 33% -
61% (end-to-end delay).
","[{'version': 'v1', 'created': 'Thu, 13 May 2021 19:29:14 GMT'}]",2021-05-17,"[['Guo', 'Hongpeng', ''], ['Yao', 'Shuochao', ''], ['Yang', 'Zhe', ''], ['Zhou', 'Qian', ''], ['Nahrstedt', 'Klara', '']]","['video analytics', 'video streaming', 'convolutional neural networks']"
182,1802.08013,Daniel Tanneberg,"Daniel Tanneberg, Jan Peters, Elmar Rueckert","Intrinsic Motivation and Mental Replay enable Efficient Online
  Adaptation in Stochastic Recurrent Networks",accepted in Neural Networks,"Volume 109, January 2019, Pages 67-80",10.1016/j.neunet.2018.10.005,,cs.AI cs.LG cs.RO stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autonomous robots need to interact with unknown, unstructured and changing
environments, constantly facing novel challenges. Therefore, continuous online
adaptation for lifelong-learning and the need of sample-efficient mechanisms to
adapt to changes in the environment, the constraints, the tasks, or the robot
itself are crucial. In this work, we propose a novel framework for
probabilistic online motion planning with online adaptation based on a
bio-inspired stochastic recurrent neural network. By using learning signals
which mimic the intrinsic motivation signalcognitive dissonance in addition
with a mental replay strategy to intensify experiences, the stochastic
recurrent network can learn from few physical interactions and adapts to novel
environments in seconds. We evaluate our online planning and adaptation
framework on an anthropomorphic KUKA LWR arm. The rapid online adaptation is
shown by learning unknown workspace constraints sample-efficiently from few
physical interactions while following given way points.
","[{'version': 'v1', 'created': 'Thu, 22 Feb 2018 12:41:06 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Oct 2018 08:36:19 GMT'}]",2018-11-09,"[['Tanneberg', 'Daniel', ''], ['Peters', 'Jan', ''], ['Rueckert', 'Elmar', '']]","['Intrinsic Motivation', 'Online Learning', 'Experience Replay', 'Autonomous Robots', 'Spiking RecurrentNetworks', 'Neural Sampling']"
183,1310.2127,Shanmugapriyaa S,"S. Shanmugapriyaa, K. S. Kuppusamy, G. Aghila",BloSEn: Blog Search Engine Based On Post Concept Clustering,12 pages,"International Journal of Ambient Systems and Applications (IJASA)
  Vol.1, No.3, September 2013",10.5121/ijasa.2013.1302,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper focuses on building a blog search engine which doesn't focus only
on keyword search but includes extended search capabilities. It also
incorporates the blog-post concept clustering which is based on the category
extracted from the blog post semantic content analysis. The proposed approach
is titled as ""BloSen (Blog Search Engine)"". It involves in extracting the posts
from blogs and parsing them to extract the blog elements and store them as
fields in a document format. Inverted index is being built on the fields of the
documents. Search is induced on the index and requested query is processed
based on the documents so far made from blog posts. It currently focuses on
Blogger and Wordpress hosted blogs since both these hosting services are the
most popular ones in the blogosphere. The proposed BloSen model is experimented
with a prototype implementation and the results of the experiments with the
user's relevance cumulative metric value of 95.44% confirms the efficiency of
the proposed model.
","[{'version': 'v1', 'created': 'Tue, 8 Oct 2013 13:16:30 GMT'}]",2013-10-09,"[['Shanmugapriyaa', 'S.', ''], ['Kuppusamy', 'K. S.', ''], ['Aghila', 'G.', '']]","['Blogs', 'Crawler', 'Document Parser', 'Apache Lucene', 'Inverted Index', 'Clustering']"
184,1709.04404,Huan Li,"Yujia Jin, Huan Li, Zhongzhi Zhang","Maximum matchings and minimum dominating sets in Apollonian networks and
  extended Tower of Hanoi graphs",,,10.1016/j.tcs.2017.08.024,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Apollonian networks display the remarkable power-law and small-world
properties as observed in most realistic networked systems. Their dual graphs
are extended Tower of Hanoi graphs, which are obtained from the Tower of Hanoi
graphs by adding a special vertex linked to all its three extreme vertices. In
this paper, we study analytically maximum matchings and minimum dominating sets
in Apollonian networks and their dual graph- s, both of which have found vast
applications in various fields, e.g. structural controllability of complex
networks. For both networks, we determine their matching number, domination
number, the number of maximum matchings, as well as the number of minimum
dominating sets.
","[{'version': 'v1', 'created': 'Wed, 13 Sep 2017 16:17:00 GMT'}]",2017-09-14,"[['Jin', 'Yujia', ''], ['Li', 'Huan', ''], ['Zhang', 'Zhongzhi', '']]","['Maximum matching', 'Minimum dominating set', 'Apolloniannetwork', 'Tower of Hanoi graph', 'Matching number', 'Domination number', 'Complex network']"
185,1911.11543,Shruti Jadon,"Tanvi Sahay, Ankita Mehta, Shruti Jadon",Schema Matching using Machine Learning,"7 pages, 2 figures, 2 tables",,10.1109/SPIN48934.2020.9071272,,cs.DB cs.AI cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Schema Matching is a method of finding attributes that are either similar to
each other linguistically or represent the same information. In this project,
we take a hybrid approach at solving this problem by making use of both the
provided data and the schema name to perform one to one schema matching and
introduce the creation of a global dictionary to achieve one to many schema
matching. We experiment with two methods of one to one matching and compare
both based on their F-scores, precision, and recall. We also compare our method
with the ones previously suggested and highlight differences between them.
","[{'version': 'v1', 'created': 'Sun, 24 Nov 2019 02:40:09 GMT'}]",2020-04-22,"[['Sahay', 'Tanvi', ''], ['Mehta', 'Ankita', ''], ['Jadon', 'Shruti', '']]","['Schema Matching', 'Machine Learning', 'SOM', 'EditDistance', 'One to Many Matching', 'One to One Matching']"
186,1608.08104,Fred Ngol\`e,"F. M. Ngol\`e Mboula, J.-L. Starck, K. Okumura, J. Amiaux, P. Hudelot",Constraint matrix factorization for space variant PSFs field restoration,33 pages,,10.1088/0266-5611/32/12/124001,,cs.CV astro-ph.IM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: in large-scale spatial surveys, the Point Spread Function (PSF)
varies across the instrument field of view (FOV). Local measurements of the
PSFs are given by the isolated stars images. Yet, these estimates may not be
directly usable for post-processings because of the observational noise and
potentially the aliasing. Aims: given a set of aliased and noisy stars images
from a telescope, we want to estimate well-resolved and noise-free PSFs at the
observed stars positions, in particular, exploiting the spatial correlation of
the PSFs across the FOV. Contributions: we introduce RCA (Resolved Components
Analysis) which is a noise-robust dimension reduction and super-resolution
method based on matrix factorization. We propose an original way of using the
PSFs spatial correlation in the restoration process through sparsity. The
introduced formalism can be applied to correlated data sets with respect to any
euclidean parametric space. Results: we tested our method on simulated
monochromatic PSFs of Euclid telescope (launch planned for 2020). The proposed
method outperforms existing PSFs restoration and dimension reduction methods.
We show that a coupled sparsity constraint on individual PSFs and their spatial
distribution yields a significant improvement on both the restored PSFs shapes
and the PSFs subspace identification, in presence of aliasing. Perspectives:
RCA can be naturally extended to account for the wavelength dependency of the
PSFs.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2016 15:30:25 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Aug 2016 12:40:23 GMT'}, {'version': 'v3', 'created': 'Wed, 31 Aug 2016 07:10:41 GMT'}]",2016-11-04,"[['Mboula', 'F. M. Ngolè', ''], ['Starck', 'J. -L.', ''], ['Okumura', 'K.', ''], ['Amiaux', 'J.', ''], ['Hudelot', 'P.', '']]","['Dimension reduction', 'Spatial analysis', 'Super-resolution', 'Matrix factorization', 'Sparsity']"
187,1501.07800,Elias Rudberg,Emanuel H. Rubensson and Elias Rudberg,"Locality-aware parallel block-sparse matrix-matrix multiplication using
  the Chunks and Tasks programming model","35 pages, 14 figures",Parallel Comput. 57 (2016) 87-106,10.1016/j.parco.2016.06.005,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a method for parallel block-sparse matrix-matrix multiplication on
distributed memory clusters. By using a quadtree matrix representation, data
locality is exploited without prior information about the matrix sparsity
pattern. A distributed quadtree matrix representation is straightforward to
implement due to our recent development of the Chunks and Tasks programming
model [Parallel Comput. 40, 328 (2014)]. The quadtree representation combined
with the Chunks and Tasks model leads to favorable weak and strong scaling of
the communication cost with the number of processes, as shown both
theoretically and in numerical experiments.
  Matrices are represented by sparse quadtrees of chunk objects. The leaves in
the hierarchy are block-sparse submatrices. Sparsity is dynamically detected by
the matrix library and may occur at any level in the hierarchy and/or within
the submatrix leaves. In case graphics processing units (GPUs) are available,
both CPUs and GPUs are used for leaf-level multiplication work, thus making use
of the full computing capacity of each node.
  The performance is evaluated for matrices with different sparsity structures,
including examples from electronic structure calculations. Compared to methods
that do not exploit data locality, our locality-aware approach reduces
communication significantly, achieving essentially constant communication per
node in weak scaling tests.
","[{'version': 'v1', 'created': 'Fri, 30 Jan 2015 15:15:22 GMT'}, {'version': 'v2', 'created': 'Sat, 7 Mar 2015 10:19:33 GMT'}, {'version': 'v3', 'created': 'Fri, 18 Sep 2015 14:16:35 GMT'}, {'version': 'v4', 'created': 'Mon, 27 Jun 2016 13:41:09 GMT'}]",2016-07-12,"[['Rubensson', 'Emanuel H.', ''], ['Rudberg', 'Elias', '']]","['parallel computing', 'sparse matrix-matrix multiplication', 'scalablealgorithms', 'large-scale computing', 'graphics processing units']"
188,1810.08040,Radom\'ir Hala\v{s},"Radom\'ir Hala\v{s}, Radko Mesiar, Jozef P\'ocs","Description of sup- and inf-preserving aggregation functions via
  families of clusters in data tables",24 pages,,10.1016/j.ins.2017.02.060,,cs.LO cs.AI math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Connection between the theory of aggregation functions and formal concept
analysis is discussed and studied, thus filling a gap in the literature by
building a bridge between these two theories, one of them living in the world
of data fusion, the second one in the area of data mining. We show how Galois
connections can be used to describe an important class of aggregation functions
preserving suprema, and, by duality, to describe aggregation functions
preserving infima. Our discovered method gives an elegant and complete
description of these classes. Also possible applications of our results within
certain biclustering fuzzy FCA-based methods are discussed.
","[{'version': 'v1', 'created': 'Tue, 9 Oct 2018 07:51:48 GMT'}]",2018-10-19,"[['Halaš', 'Radomír', ''], ['Mesiar', 'Radko', ''], ['Pócs', 'Jozef', '']]","['sup-preserving aggregation function', 'bounded lattice', 'Galoisconnection']"
189,1512.05667,Emil Je\v{r}\'abek,Emil Je\v{r}\'abek,Proof complexity of intuitionistic implicational formulas,"47 pages, 1 figure; to appear in Annals of Pure and Applied Logic","Annals of Pure and Applied Logic 168 (2017), no. 1, pp. 150--190",10.1016/j.apal.2016.09.003,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study implicational formulas in the context of proof complexity of
intuitionistic propositional logic (IPC). On the one hand, we give an efficient
transformation of tautologies to implicational tautologies that preserves the
lengths of intuitionistic extended Frege (EF) or substitution Frege (SF) proofs
up to a polynomial. On the other hand, EF proofs in the implicational fragment
of IPC polynomially simulate full intuitionistic logic for implicational
tautologies. The results also apply to other fragments of other
superintuitionistic logics under certain conditions.
  In particular, the exponential lower bounds on the length of intuitionistic
EF proofs by Hrube\v{s} \cite{hru:lbint}, generalized to exponential separation
between EF and SF systems in superintuitionistic logics of unbounded branching
by Je\v{r}\'abek \cite{ej:sfef}, can be realized by implicational tautologies.
","[{'version': 'v1', 'created': 'Thu, 17 Dec 2015 16:50:32 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Jan 2016 18:06:04 GMT'}, {'version': 'v3', 'created': 'Sun, 18 Sep 2016 12:30:16 GMT'}]",2016-10-27,"[['Jeřábek', 'Emil', '']]","['proof complexity', 'intuitionistic logic', 'implicational fragment']"
190,1711.07023,Yannick Forster,"Yannick Forster, Edith Heiter, Gert Smolka",Verification of PCP-Related Computational Reductions in Coq,,,10.1007/978-3-319-94821-8_15,,cs.LO cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We formally verify several computational reductions concerning the Post
correspondence problem (PCP) using the proof assistant Coq. Our verifications
include a reduction of a string rewriting problem generalising the halting
problem for Turing machines to PCP, and reductions of PCP to the intersection
problem and the palindrome problem for context-free grammars. Interestingly,
rigorous correctness proofs for some of the reductions are missing in the
literature.
","[{'version': 'v1', 'created': 'Sun, 19 Nov 2017 14:15:45 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Jul 2018 15:19:29 GMT'}]",2022-12-09,"[['Forster', 'Yannick', ''], ['Heiter', 'Edith', ''], ['Smolka', 'Gert', '']]","['Post Correspondence Problem', 'String Rewriting', 'Contextfree Grammars', 'Computational Reductions', 'Undecidability', 'Coq']"
191,1703.08738,Long Zhao,"Long Zhao, Fangda Han, Xi Peng, Xun Zhang, Mubbasir Kapadia, Vladimir
  Pavlovic, Dimitris N. Metaxas","Cartoonish sketch-based face editing in videos using identity
  deformation transfer","In Computers & Graphics, 2019. (12 pages, 10 figures)",,10.1016/j.cag.2019.01.004,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the problem of using hand-drawn sketches to create exaggerated
deformations to faces in videos, such as enlarging the shape or modifying the
position of eyes or mouth. This task is formulated as a 3D face model
reconstruction and deformation problem. We first recover the facial identity
and expressions from the video by fitting a face morphable model for each
frame. At the same time, user's editing intention is recognized from input
sketches as a set of facial modifications. Then a novel identity deformation
algorithm is proposed to transfer these facial deformations from 2D space to
the 3D facial identity directly while preserving the facial expressions. After
an optional stage for further refining the 3D face model, these changes are
propagated to the whole video with the modified identity. Both the user study
and experimental results demonstrate that our sketching framework can help
users effectively edit facial identities in videos, while high consistency and
fidelity are ensured at the same time.
","[{'version': 'v1', 'created': 'Sat, 25 Mar 2017 20:33:45 GMT'}, {'version': 'v2', 'created': 'Thu, 31 May 2018 10:36:08 GMT'}, {'version': 'v3', 'created': 'Sat, 26 Jan 2019 04:05:45 GMT'}]",2019-01-29,"[['Zhao', 'Long', ''], ['Han', 'Fangda', ''], ['Peng', 'Xi', ''], ['Zhang', 'Xun', ''], ['Kapadia', 'Mubbasir', ''], ['Pavlovic', 'Vladimir', ''], ['Metaxas', 'Dimitris N.', '']]","['Video editing', 'Sketch-basedmodeling', 'Shape deformation', 'Deformation transfer', '3D morphable model']"
192,1604.07751,Rafal Kotynski,"David Pastor-Calle, Anna Pastuszczak, Michal Mikolajczyk and Rafal
  Kotynski",Compressive phase-only filtering at extreme compression rates,,"Opt. Commun. vol. 383, pp. 446-452, (2017)",10.1016/j.optcom.2016.09.024,,cs.CV physics.optics,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce an efficient method for the reconstruction of the correlation
between a compressively measured image and a phase-only filter. The proposed
method is based on two properties of phase-only filtering: such filtering is a
unitary circulant transform, and the correlation plane it produces is usually
sparse. Thanks to these properties, phase-only filters are perfectly compatible
with the framework of compressive sensing. Moreover, the lasso-based recovery
algorithm is very fast when phase-only filtering is used as the compression
matrix. The proposed method can be seen as a generalisation of the
correlation-based pattern recognition technique, which is hereby applied
directly to non-adaptively acquired compressed data. At the time of
measurement, any prior knowledge of the target object for which the data will
be scanned is not required. We show that images measured at extremely high
compression rates may still contain sufficient information for target
classification and localization, even if the compression rate is high enough,
that visual recognition of the target in the reconstructed image is no longer
possible. The method has been applied by us to highly undersampled measurements
obtained from a single-pixel camera, with sampling based on randomly chosen
Walsh-Hadamard patterns.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2016 16:49:58 GMT'}, {'version': 'v2', 'created': 'Wed, 25 May 2016 13:45:38 GMT'}, {'version': 'v3', 'created': 'Fri, 3 Jun 2016 09:46:50 GMT'}, {'version': 'v4', 'created': 'Fri, 22 Jul 2016 12:33:18 GMT'}, {'version': 'v5', 'created': 'Thu, 29 Sep 2016 06:43:39 GMT'}]",2016-09-30,"[['Pastor-Calle', 'David', ''], ['Pastuszczak', 'Anna', ''], ['Mikolajczyk', 'Michal', ''], ['Kotynski', 'Rafal', '']]","['Computational imaging', 'phase-only filter', 'smashed filter', 'single-pixel camera', 'patternrecognition']"
193,1902.01477,Nikolaj Tatti,Nikolaj Tatti,Faster way to agony: Discovering hierarchies in directed graphs,,,10.1007/978-3-662-44845-8_11,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many real-world phenomena exhibit strong hierarchical structure.
Consequently, in many real-world directed social networks vertices do not play
equal role. Instead, vertices form a hierarchy such that the edges appear
mainly from upper levels to lower levels. Discovering hierarchies from such
graphs is a challenging problem that has gained attention. Formally, given a
directed graph, we want to partition vertices into levels such that ideally
there are only edges from upper levels to lower levels. From computational
point of view, the ideal case is when the underlying directed graph is acyclic.
In such case, we can partition the vertices into a hierarchy such that there
are only edges from upper levels to lower edges. In practice, graphs are rarely
acyclic, hence we need to penalize the edges that violate the hierarchy. One
practical approach is agony, where each violating edge is penalized based on
the severity of the violation. The fastest algorithm for computing agony
requires $O(nm^2)$ time. In the paper we present an algorithm for computing
agony that has better theoretical bound, namely $O(m^2)$. We also show that in
practice the obtained bound is pessimistic and that we can use our algorithm to
compute agony for large datasets. Moreover, our algorithm can be used as
any-time algorithm.
","[{'version': 'v1', 'created': 'Mon, 4 Feb 2019 22:12:16 GMT'}]",2019-02-06,"[['Tatti', 'Nikolaj', '']]","['Graph mining', 'agony', 'hierarchy discovery', 'primal-dual', 'maximum eulerian subgraph']"
194,1404.0442,Kevin Carlberg,Kevin Carlberg,Adaptive $h$-refinement for reduced-order models,"submitted to the International Journal for Numerical Methods in
  Engineering, Special Issue on Model Reduction","International Journal for Numerical Methods in Engineering, Vol.
  102, No. 5, p.1192-1210 (2014)",10.1002/nme.4800,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work presents a method to adaptively refine reduced-order models \emph{a
posteriori} without requiring additional full-order-model solves. The technique
is analogous to mesh-adaptive $h$-refinement: it enriches the reduced-basis
space online by `splitting' a given basis vector into several vectors with
disjoint support. The splitting scheme is defined by a tree structure
constructed offline via recursive $k$-means clustering of the state variables
using snapshot data. The method identifies the vectors to split online using a
dual-weighted-residual approach that aims to reduce error in an output quantity
of interest. The resulting method generates a hierarchy of subspaces online
without requiring large-scale operations or full-order-model solves. Further,
it enables the reduced-order model to satisfy \emph{any prescribed error
tolerance} regardless of its original fidelity, as a completely refined
reduced-order model is mathematically equivalent to the original full-order
model. Experiments on a parameterized inviscid Burgers equation highlight the
ability of the method to capture phenomena (e.g., moving shocks) not contained
in the span of the original reduced basis.
","[{'version': 'v1', 'created': 'Wed, 2 Apr 2014 03:29:43 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Apr 2014 04:12:34 GMT'}, {'version': 'v3', 'created': 'Fri, 18 Jul 2014 01:09:10 GMT'}]",2015-04-16,"[['Carlberg', 'Kevin', '']]","['adaptive refinement', 'h-refinement', 'model reduction', 'dual-weighted residual', 'adjoint errorestimation', 'clustering']"
195,1904.13086,Joachim Meyer,"Nir Douer, Joachim Meyer","Theoretical, Measured and Subjective Responsibility in Aided Decision
  Making",,"ACM Transactions on Intelligent Interactive Systems, 11(1),
  Article 5 (2021)",10.1145/3453938,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When humans interact with intelligent systems, their causal responsibility
for outcomes becomes equivocal. We analyze the descriptive abilities of a newly
developed responsibility quantification model (ResQu) to predict actual human
responsibility and perceptions of responsibility in the interaction with
intelligent systems. In two laboratory experiments, participants performed a
classification task. They were aided by classification systems with different
capabilities. We compared the predicted theoretical responsibility values to
the actual measured responsibility participants took on and to their subjective
rankings of responsibility. The model predictions were strongly correlated with
both measured and subjective responsibility. A bias existed only when
participants with poor classification capabilities relied less-than-optimally
on a system that had superior classification capabilities and assumed
higher-than-optimal responsibility. The study implies that when humans interact
with advanced intelligent systems, with capabilities that greatly exceed their
own, their comparative causal responsibility will be small, even if formally
the human is assigned major roles. Simply putting a human into the loop does
not assure that the human will meaningfully contribute to the outcomes. The
results demonstrate the descriptive value of the ResQu model to predict
behavior and perceptions of responsibility by considering the characteristics
of the human, the intelligent system, the environment and some systematic
behavioral biases. The ResQu model is a new quantitative method that can be
used in system design and can guide policy and legal decisions regarding human
responsibility in events involving intelligent systems.
","[{'version': 'v1', 'created': 'Tue, 30 Apr 2019 07:37:33 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Oct 2019 07:18:58 GMT'}, {'version': 'v3', 'created': 'Wed, 29 Apr 2020 15:28:35 GMT'}]",2022-05-20,"[['Douer', 'Nir', ''], ['Meyer', 'Joachim', '']]","['Artificial intelligence (AI)', 'Human-automation interaction', 'decision making', 'responsibility', 'cognitive engineering', 'autonomous systems', 'alert systems']"
196,1407.1972,Vinoth Kumar,"S. Rajaram, A. Babu Karuppiah, K. Vinoth Kumar",Secure Routing Path Using Trust Values for Wireless Sensor Networks,"10 pages, 4 figures, International Journal on Cryptography and
  Information Security (IJCIS)",http://airccse.org/journal/ijcis/current2014.html,10.5121/ijcis.2014.4203,,cs.CR cs.NI,http://creativecommons.org/licenses/by/3.0/,"  Traditional cryptography-based security mechanisms such as authentication and
authorization are not effective against insider attacks like wormhole,
sinkhole, selective forwarding attacks, etc., Trust based approaches have been
widely used to counter insider attacks in wireless sensor networks. It provides
a quantitative way to evaluate the trustworthiness of sensor nodes. An
untrustworthy node can wreak considerable damage and adversely affect the
quality and reliability of data. Therefore, analysing the trust level of a node
is important. In this paper we focused about indirect trust mechanism, in which
each node monitors the forwarding behavior of its neighbors in order to detect
any node that behaves selfishly and does not forward the packets it receives.
For this, we used a link state routing protocol based indirect trusts which
forms the shortest route and finds the best trustworthy route among them by
comparing the values of all the calculated route trusts as for each route
present in the network. And finally, we compare our work with similar routing
protocols and show its advantages over them.
","[{'version': 'v1', 'created': 'Tue, 8 Jul 2014 06:50:27 GMT'}]",2014-07-09,"[['Rajaram', 'S.', ''], ['Karuppiah', 'A. Babu', ''], ['Kumar', 'K. Vinoth', '']]","['Wireless Sensor Networks (WSNs)', 'Routing', 'Benevolent Node', 'Malicious Node', 'Trust Management']"
197,1707.05943,Yao-Lung Leo Fang,Yao-Lung L. Fang,FDTD: solving 1+1D delay PDE in parallel,"Introduced two parallelization approaches along with other
  improvements in the presentation. Code open sourced at
  https://github.com/leofang/FDTD. To appear in Computer Physics Communications","Computer Physics Communications 235, 422 (2019)",10.1016/j.cpc.2018.08.018,,cs.MS cs.NA math.NA physics.comp-ph quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a proof of concept for solving a 1+1D complex-valued, delay
partial differential equation (PDE) that emerges in the study of waveguide
quantum electrodynamics (QED) by adapting the finite-difference time-domain
(FDTD) method. The delay term is spatially non-local, rendering conventional
approaches such as the method of lines inapplicable. We show that by properly
designing the grid and by supplying the (partial) exact solution as the
boundary condition, the delay PDE can be numerically solved. In addition, we
demonstrate that while the delay imposes strong data dependency, multi-thread
parallelization can nevertheless be applied to such a problem. Our code
provides a numerically exact solution to the time-dependent multi-photon
scattering problem in waveguide QED.
","[{'version': 'v1', 'created': 'Wed, 19 Jul 2017 06:06:13 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Sep 2018 02:51:39 GMT'}]",2018-11-19,"[['Fang', 'Yao-Lung L.', '']]","['Waveguide QED', 'Delay PDE', 'FDTD', 'Non-Markovianity']"
198,1606.06204,Richard Barnes,Richard Barnes,"Parallel Priority-Flood Depression Filling For Trillion Cell Digital
  Elevation Models On Desktops Or Clusters","21 pages, 4 tables, 8 figures","Computers and Geosciences, Volume 96, November 2016, pp. 56-68",10.1016/j.cageo.2016.07.001,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Algorithms for extracting hydrologic features and properties from digital
elevation models (DEMs) are challenged by large datasets, which often cannot
fit within a computer's RAM. Depression filling is an important preconditioning
step to many of these algorithms. Here, I present a new, linearly-scaling
algorithm which parallelizes the Priority-Flood depression-filling algorithm by
subdividing a DEM into tiles. Using a single-producer, multi-consumer design,
the new algorithm works equally well on one core, multiple cores, or multiple
machines and can take advantage of large memories or cope with small ones.
Unlike previous algorithms, the new algorithm guarantees a fixed number of
memory access and communication events per subdivision of the DEM. In
comparison testing, this results in the new algorithm running generally faster
while using fewer resources than previous algorithms. For moderately sized
tiles, the algorithm exhibits ~60% strong and weak scaling efficiencies up to
48 cores, and linear time scaling across datasets ranging over three orders of
magnitude. The largest dataset on which I run the algorithm has 2 trillion
(2*10^12) cells. With 48 cores, processing required 4.8 hours wall-time (9.3
compute-days). This test is three orders of magnitude larger than any
previously performed in the literature. Complete, well-commented source code
and correctness tests are available for download from a repository.
","[{'version': 'v1', 'created': 'Mon, 20 Jun 2016 16:52:12 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Aug 2016 22:35:43 GMT'}]",2016-08-17,"[['Barnes', 'Richard', '']]","['parallel computing', 'hydrology', 'geographic information system (GIS)', 'pit filling', 'sink removal']"
199,1702.08903,Michael Lampis,"R\'emy Belmonte, Michael Lampis, Valia Mitsou",Defective Coloring on Classes of Perfect Graphs,,"Discrete Mathematics & Theoretical Computer Science, vol. 24, no.
  1, Discrete Algorithms (January 20, 2022) dmtcs:8918",10.46298/dmtcs.4926,,cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Defective Coloring we are given a graph $G$ and two integers $\chi_d$,
$\Delta^*$ and are asked if we can $\chi_d$-color $G$ so that the maximum
degree induced by any color class is at most $\Delta^*$. We show that this
natural generalization of Coloring is much harder on several basic graph
classes. In particular, we show that it is NP-hard on split graphs, even when
one of the two parameters $\chi_d$, $\Delta^*$ is set to the smallest possible
fixed value that does not trivialize the problem ($\chi_d = 2$ or $\Delta^* =
1$). Together with a simple treewidth-based DP algorithm this completely
determines the complexity of the problem also on chordal graphs. We then
consider the case of cographs and show that, somewhat surprisingly, Defective
Coloring turns out to be one of the few natural problems which are NP-hard on
this class. We complement this negative result by showing that Defective
Coloring is in P for cographs if either $\chi_d$ or $\Delta^*$ is fixed; that
it is in P for trivially perfect graphs; and that it admits a sub-exponential
time algorithm for cographs when both $\chi_d$ and $\Delta^*$ are unbounded.
","[{'version': 'v1', 'created': 'Tue, 28 Feb 2017 18:47:57 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Oct 2018 10:18:24 GMT'}, {'version': 'v3', 'created': 'Tue, 17 Nov 2020 21:06:23 GMT'}, {'version': 'v4', 'created': 'Wed, 5 Jan 2022 10:29:32 GMT'}]",2022-03-14,"[['Belmonte', 'Rémy', ''], ['Lampis', 'Michael', ''], ['Mitsou', 'Valia', '']]","['Defective Coloring', 'Split Graphs', 'Cographs']"
200,1907.12316,Eug\'enio Ribeiro,"Eug\'enio Ribeiro, Ricardo Ribeiro, and David Martins de Matos",Hierarchical Multi-Label Dialog Act Recognition on Spanish Data,"21 pages, 4 figures, 17 tables, translated version of the article
  published in Linguam\'atica 11(1)",Linguam\'atica 11(1) (2019) 17-40,10.21814/lm.11.1.278,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dialog acts reveal the intention behind the uttered words. Thus, their
automatic recognition is important for a dialog system trying to understand its
conversational partner. The study presented in this article approaches that
task on the DIHANA corpus, whose three-level dialog act annotation scheme poses
problems which have not been explored in recent studies. In addition to the
hierarchical problem, the two lower levels pose multi-label classification
problems. Furthermore, each level in the hierarchy refers to a different aspect
concerning the intention of the speaker both in terms of the structure of the
dialog and the task. Also, since its dialogs are in Spanish, it allows us to
assess whether the state-of-the-art approaches on English data generalize to a
different language. More specifically, we compare the performance of different
segment representation approaches focusing on both sequences and patterns of
words and assess the importance of the dialog history and the relations between
the multiple levels of the hierarchy. Concerning the single-label
classification problem posed by the top level, we show that the conclusions
drawn on English data also hold on Spanish data. Furthermore, we show that the
approaches can be adapted to multi-label scenarios. Finally, by hierarchically
combining the best classifiers for each level, we achieve the best results
reported for this corpus.
","[{'version': 'v1', 'created': 'Mon, 29 Jul 2019 10:12:18 GMT'}]",2019-07-30,"[['Ribeiro', 'Eugénio', ''], ['Ribeiro', 'Ricardo', ''], ['de Matos', 'David Martins', '']]","['Dialog Act Recognition', 'Hierarchical Classification', 'Multi-Label Classification', 'DIHANA Corpus']"
201,1307.2997,Padmavathi S,"S. Padmavathi, Manojna K.S.S, S. Sphoorthy Reddy, D. Meenakshy","Conversion of Braille to Text in English, Hindi and Tamil Languages","14 pages, 20 figures, 4 tables","International Journal of Computer Science, Engineering and
  Applications (IJCSEA) Vol.3, No.3, June 2013",10.5121/ijcsea.2013.3303,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Braille system has been used by the visually impaired for reading and
writing. Due to limited availability of the Braille text books an efficient
usage of the books becomes a necessity. This paper proposes a method to convert
a scanned Braille document to text which can be read out to many through the
computer. The Braille documents are pre processed to enhance the dots and
reduce the noise. The Braille cells are segmented and the dots from each cell
is extracted and converted in to a number sequence. These are mapped to the
appropriate alphabets of the language. The converted text is spoken out through
a speech synthesizer. The paper also provides a mechanism to type the Braille
characters through the number pad of the keyboard. The typed Braille character
is mapped to the alphabet and spoken out. The Braille cell has a standard
representation but the mapping differs for each language. In this paper mapping
of English, Hindi and Tamil are considered.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2013 07:24:16 GMT'}]",2013-07-12,"[['Padmavathi', 'S.', ''], ['S', 'Manojna K. S.', ''], ['Reddy', 'S. Sphoorthy', ''], ['Meenakshy', 'D.', '']]","['Braille Conversion', 'Projection Profile', 'Tamil Braille conversion', 'Hindi Braille conversion', 'ImageSegmentation']"
202,1511.06568,Tom\'a\v{s} Dvo\v{r}\'ak,Tom\'a\v{s} Dvo\v{r}\'ak,Matchings of quadratic size extend to long cycles in hypercubes,,"Discrete Mathematics & Theoretical Computer Science, Vol. 18 no.
  3, Graph Theory (September 1, 2016) dmtcs:2012",10.46298/dmtcs.1336,,cs.DM,http://creativecommons.org/licenses/by/4.0/,"  Ruskey and Savage in 1993 asked whether every matching in a hypercube can be
extended to a Hamiltonian cycle. A positive answer is known for perfect
matchings, but the general case has been resolved only for matchings of linear
size. In this paper we show that there is a quadratic function $q(n)$ such that
every matching in the $n$-dimensional hypercube of size at most $q(n)$ may be
extended to a cycle which covers at least $\frac34$ of the vertices.
","[{'version': 'v1', 'created': 'Fri, 20 Nov 2015 12:03:20 GMT'}, {'version': 'v2', 'created': 'Sat, 23 Jan 2016 21:47:45 GMT'}, {'version': 'v3', 'created': 'Mon, 29 Aug 2016 14:04:51 GMT'}]",2021-10-04,"[['Dvořák', 'Tomáš', '']]","['Gray code', 'Hamiltonian cycle', 'hypercube', 'long cycle', 'matching', 'Ruskey and Savage problem']"
203,1811.10161,Adil Erzin I,Adil Erzin and Natalya Lagutkina,FPTAS for barrier covering problem with equal circles in 2D,,,10.1007/s11590-020-01650-8,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider a problem of covering a straight line segment by
equal circles that are initially arbitrarily placed on a plane by moving their
centers on a segment or on a straight line containing a segment so that the
segment is completely covered, the neighboring circles in the cover are
touching each other and the total length of the paths traveled by circles is
minimal. The complexity status of the problem is not known. We propose a
$O(n^{2+c}/\varepsilon^2)$--time FPTAS for this problem, where $n$ is the
number of circles and $c>0$ is arbitrarily small real.
","[{'version': 'v1', 'created': 'Mon, 26 Nov 2018 03:24:42 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Apr 2019 04:29:10 GMT'}]",2021-01-05,"[['Erzin', 'Adil', ''], ['Lagutkina', 'Natalya', '']]","['barrier coverage', 'mobile sensors', 'FPTAS']"
204,1705.00097,Alejandro D\'iaz-Caro,Alejandro D\'iaz-Caro,"A lambda calculus for density matrices with classical and probabilistic
  controls","This version includes a 11-pages appendix with proofs, and a small
  fix in the definition of property P(b,A)",LNCS 10695:448-467 (APLAS 2017),10.1007/978-3-319-71237-6_22,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present two flavors of a quantum extension to the lambda
calculus. The first one, $\lambda_\rho$, follows the approach of classical
control/quantum data, where the quantum data is represented by density
matrices. We provide an interpretation for programs as density matrices and
functions upon them. The second one, $\lambda_\rho^\circ$, take advantage of
the density matrices presentation in order to follow the mixed trace of
programs in a kind of generalised density matrix. Such a control can be seen as
a weaker form of the quantum control and data approach.
","[{'version': 'v1', 'created': 'Fri, 28 Apr 2017 23:22:16 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Jun 2017 21:08:02 GMT'}, {'version': 'v3', 'created': 'Sun, 20 Aug 2017 15:28:03 GMT'}, {'version': 'v4', 'created': 'Mon, 20 Nov 2017 15:58:50 GMT'}]",2017-11-21,"[['Díaz-Caro', 'Alejandro', '']]","['lambda calculus', 'quantum computing', 'density matrices', 'classical control']"
205,1109.0660,Albert Fannjiang,Albert Fannjiang and Wenjing Liao,Mismatch and resolution in compressive imaging,Figure 5 revised,,10.1117/12.892434,,cs.IT math.IT math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Highly coherent sensing matrices arise in discretization of continuum
problems such as radar and medical imaging when the grid spacing is below the
Rayleigh threshold as well as in using highly coherent, redundant dictionaries
as sparsifying operators. Algorithms (BOMP, BLOOMP) based on techniques of band
exclusion and local optimization are proposed to enhance Orthogonal Matching
Pursuit (OMP) and deal with such coherent sensing matrices. BOMP and BLOOMP
have provably performance guarantee of reconstructing sparse, widely separated
objects {\em independent} of the redundancy and have a sparsity constraint and
computational cost similar to OMP's. Numerical study demonstrates the
effectiveness of BLOOMP for compressed sensing with highly coherent, redundant
sensing matrices.
","[{'version': 'v1', 'created': 'Sat, 3 Sep 2011 23:58:02 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Sep 2011 22:23:52 GMT'}]",2015-05-30,"[['Fannjiang', 'Albert', ''], ['Liao', 'Wenjing', '']]","['Model mismatch', 'compressed sensing', 'coherence band', 'gridding error', 'redundant dictionary']"
206,2105.09461,Ayman Al-Kababji,"Ayman Al-Kababji, Abbes Amira, Faycal Bensaali, Abdulah Jarouf, Lisan
  Shidqi, Hamza Djelouat",An IoT-Based Framework for Remote Fall Monitoring,"30 Pages, 9 figures, 9 tables. This is a the Accepted Manuscript
  version of the article published in Biomedical Signal Processing and Control
  (URL: https://doi.org/10.1016/j.bspc.2021.102532)",,10.1016/j.bspc.2021.102532,,cs.NI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fall detection is a serious healthcare issue that needs to be solved. Falling
without quick medical intervention would lower the chances of survival for the
elderly, especially if living alone. Hence, the need is there for developing
fall detection algorithms with high accuracy. This paper presents a novel
IoT-based system for fall detection that includes a sensing device transmitting
data to a mobile application through a cloud-connected gateway device. Then,
the focus is shifted to the algorithmic aspect where multiple features are
extracted from 3-axis accelerometer data taken from existing datasets. The
results emphasize on the significance of Continuous Wavelet Transform (CWT) as
an influential feature for determining falls. CWT, Signal Energy (SE), Signal
Magnitude Area (SMA), and Signal Vector Magnitude (SVM) features have shown
promising classification results using K-Nearest Neighbors (KNN) and E-Nearest
Neighbors (ENN). For all performance metrics (accuracy, recall, precision,
specificity, and F1 Score), the achieved results are higher than 95% for a
dataset of small size, while more than 98.47% score is achieved in the
aforementioned criteria over the UniMiB-SHAR dataset by the same algorithms,
where the classification time for a single test record is extremely efficient
and is real-time
","[{'version': 'v1', 'created': 'Wed, 10 Mar 2021 22:37:19 GMT'}]",2021-05-21,"[['Al-Kababji', 'Ayman', ''], ['Amira', 'Abbes', ''], ['Bensaali', 'Faycal', ''], ['Jarouf', 'Abdulah', ''], ['Shidqi', 'Lisan', ''], ['Djelouat', 'Hamza', '']]","['Wearable sensing device', '3-axis accelerometer', 'Feature extraction algorithm selection', 'CWT', 'Mobile']"
207,1901.06988,Daniele Ravi,"Daniele Rav\`i, Agnieszka Barbara Szczotka, Stephen P Pereira, Tom
  Vercauteren","Adversarial training with cycle consistency for unsupervised
  super-resolution in endomicroscopy",Accepted for publication on Medical Image Analysis journal,,10.1016/j.media.2019.01.011,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, endomicroscopy has become increasingly used for diagnostic
purposes and interventional guidance. It can provide intraoperative aids for
real-time tissue characterization and can help to perform visual investigations
aimed for example to discover epithelial cancers. Due to physical constraints
on the acquisition process, endomicroscopy images, still today have a low
number of informative pixels which hampers their quality. Post-processing
techniques, such as Super-Resolution (SR), are a potential solution to increase
the quality of these images. SR techniques are often supervised, requiring
aligned pairs of low-resolution (LR) and high-resolution (HR) images patches to
train a model. However, in our domain, the lack of HR images hinders the
collection of such pairs and makes supervised training unsuitable. For this
reason, we propose an unsupervised SR framework based on an adversarial deep
neural network with a physically-inspired cycle consistency, designed to impose
some acquisition properties on the super-resolved images. Our framework can
exploit HR images, regardless of the domain where they are coming from, to
transfer the quality of the HR images to the initial LR images. This property
can be particularly useful in all situations where pairs of LR/HR are not
available during the training. Our quantitative analysis, validated using a
database of 238 endomicroscopy video sequences from 143 patients, shows the
ability of the pipeline to produce convincing super-resolved images. A Mean
Opinion Score (MOS) study also confirms this quantitative image quality
assessment.
","[{'version': 'v1', 'created': 'Mon, 21 Jan 2019 16:23:32 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Feb 2019 18:31:03 GMT'}]",2019-02-07,"[['Ravì', 'Daniele', ''], ['Szczotka', 'Agnieszka Barbara', ''], ['Pereira', 'Stephen P', ''], ['Vercauteren', 'Tom', '']]","['Deep learning', 'Probe-based confocal laser endomicroscopy', 'Unsupervised Super-resolution', 'Cycle consistency', 'Adversarial training']"
208,1201.4342,Tobias Buer,Tobias Buer and Herbert Kopfer,"A Pareto-metaheuristic for a bi-objective winner determination problem
  in a combinatorial reverse auction","Accepted for publication in Computers & Operations Research,
  available online, Computers & Operations Research, 2013","Computers & Operations Research 41 (2014), 208-220",10.1016/j.cor.2013.04.004,,cs.GT cs.AI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The bi-objective winner determination problem (2WDP-SC) of a combinatorial
procurement auction for transport contracts is characterized by a set B of
bundle bids, with each bundle bid b in B consisting of a bidding carrier c_b, a
bid price p_b, and a set tau_b transport contracts which is a subset of the set
T of tendered transport contracts. Additionally, the transport quality
q_{t,c_b} is given which is expected to be realized when a transport contract t
is executed by a carrier c_b. The task of the auctioneer is to find a set X of
winning bids (X subset B), such that each transport contract is part of at
least one winning bid, the total procurement costs are minimized, and the total
transport quality is maximized. This article presents a metaheuristic approach
for the 2WDP-SC which integrates the greedy randomized adaptive search
procedure with a two-stage candidate component selection procedure, large
neighborhood search, and self-adaptive parameter setting in order to find a
competitive set of non-dominated solutions. The heuristic outperforms all
existing approaches. For seven small benchmark instances, the heuristic is the
sole approach that finds all Pareto-optimal solutions. For 28 out of 30 large
instances, none of the existing approaches is able to compute a solution that
dominates a solution found by the proposed heuristic.
","[{'version': 'v1', 'created': 'Fri, 20 Jan 2012 17:09:22 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Apr 2013 12:25:42 GMT'}]",2014-06-10,"[['Buer', 'Tobias', ''], ['Kopfer', 'Herbert', '']]","['Pareto optimization', 'multi-criteria winner determination', 'combinatorial auction', 'GRASP', 'ALNS']"
209,1706.01171,Rao Muhammad Anwer,"Rao Muhammad Anwer, Fahad Shahbaz Khan, Joost van de Weijer, Matthieu
  Molinier, Jorma Laaksonen","Binary Patterns Encoded Convolutional Neural Networks for Texture
  Recognition and Remote Sensing Scene Classification",To appear in ISPRS Journal of Photogrammetry and Remote Sensing,,10.1016/j.isprsjprs.2018.01.023,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Designing discriminative powerful texture features robust to realistic
imaging conditions is a challenging computer vision problem with many
applications, including material recognition and analysis of satellite or
aerial imagery. In the past, most texture description approaches were based on
dense orderless statistical distribution of local features. However, most
recent approaches to texture recognition and remote sensing scene
classification are based on Convolutional Neural Networks (CNNs). The d facto
practice when learning these CNN models is to use RGB patches as input with
training performed on large amounts of labeled data (ImageNet). In this paper,
we show that Binary Patterns encoded CNN models, codenamed TEX-Nets, trained
using mapped coded images with explicit texture information provide
complementary information to the standard RGB deep models. Additionally, two
deep architectures, namely early and late fusion, are investigated to combine
the texture and color information. To the best of our knowledge, we are the
first to investigate Binary Patterns encoded CNNs and different deep network
fusion architectures for texture recognition and remote sensing scene
classification. We perform comprehensive experiments on four texture
recognition datasets and four remote sensing scene classification benchmarks:
UC-Merced with 21 scene categories, WHU-RS19 with 19 scene classes, RSSCN7 with
7 categories and the recently introduced large scale aerial image dataset (AID)
with 30 aerial scene types. We demonstrate that TEX-Nets provide complementary
information to standard RGB deep model of the same network architecture. Our
late fusion TEX-Net architecture always improves the overall performance
compared to the standard RGB network on both recognition problems. Our final
combination outperforms the state-of-the-art without employing fine-tuning or
ensemble of RGB network architectures.
","[{'version': 'v1', 'created': 'Mon, 5 Jun 2017 00:53:06 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Mar 2018 10:27:27 GMT'}]",2018-03-28,"[['Anwer', 'Rao Muhammad', ''], ['Khan', 'Fahad Shahbaz', ''], ['van de Weijer', 'Joost', ''], ['Molinier', 'Matthieu', ''], ['Laaksonen', 'Jorma', '']]","['Remote sensing', 'Deep learning', 'Scene classification', 'Local Binary Patterns', 'Texture analysis']"
210,1709.08521,Omar Al-Harbi,Omar Al-Harbi,"Using objective words in the reviews to improve the colloquial arabic
  sentiment analysis","14 pages, 1 figure, International Journal on Natural Language
  Computing (IJNLC)","International Journal on Natural Language Computing (IJNLC) Vol.
  6, No.3, June 2017",10.5121/ijnlc,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the main difficulties in sentiment analysis of the Arabic language is
the presence of the colloquialism. In this paper, we examine the effect of
using objective words in conjunction with sentimental words on sentiment
classification for the colloquial Arabic reviews, specifically Jordanian
colloquial reviews. The reviews often include both sentimental and objective
words, however, the most existing sentiment analysis models ignore the
objective words as they are considered useless. In this work, we created two
lexicons: the first includes the colloquial sentimental words and compound
phrases, while the other contains the objective words associated with values of
sentiment tendency based on a particular estimation method. We used these
lexicons to extract sentiment features that would be training input to the
Support Vector Machines (SVM) to classify the sentiment polarity of the
reviews. The reviews dataset have been collected manually from JEERAN website.
The results of the experiments show that the proposed approach improves the
polarity classification in comparison to two baseline models, with accuracy
95.6%.
","[{'version': 'v1', 'created': 'Mon, 25 Sep 2017 14:40:28 GMT'}]",2017-09-26,"[['Al-Harbi', 'Omar', '']]","['Arabic sentiment analysis', 'opinion mining', 'colloquial Arabic language', 'colloquial Jordanian reviews']"
211,1612.05005,Ingmar Steiner,"Alexander Hewer, Stefanie Wuhrer, Ingmar Steiner, Korin Richmond","A Multilinear Tongue Model Derived from Speech Related MRI Data of the
  Human Vocal Tract",,Computer Speech & Language 51 (2018) 68-92,10.1016/j.csl.2018.02.001,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  We present a multilinear statistical model of the human tongue that captures
anatomical and tongue pose related shape variations separately. The model is
derived from 3D magnetic resonance imaging data of 11 speakers sustaining
speech related vocal tract configurations. The extraction is performed by using
a minimally supervised method that uses as basis an image segmentation approach
and a template fitting technique. Furthermore, it uses image denoising to deal
with possibly corrupt data, palate surface information reconstruction to handle
palatal tongue contacts, and a bootstrap strategy to refine the obtained
shapes. Our evaluation concludes that limiting the degrees of freedom for the
anatomical and speech related variations to 5 and 4, respectively, produces a
model that can reliably register unknown data while avoiding overfitting
effects. Furthermore, we show that it can be used to generate a plausible
tongue animation by tracking sparse motion capture data.
","[{'version': 'v1', 'created': 'Thu, 15 Dec 2016 10:31:40 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Apr 2017 08:51:42 GMT'}, {'version': 'v3', 'created': 'Tue, 12 Dec 2017 16:00:02 GMT'}, {'version': 'v4', 'created': 'Fri, 13 Apr 2018 09:27:33 GMT'}, {'version': 'v5', 'created': 'Tue, 17 Apr 2018 08:16:54 GMT'}]",2018-04-18,"[['Hewer', 'Alexander', ''], ['Wuhrer', 'Stefanie', ''], ['Steiner', 'Ingmar', ''], ['Richmond', 'Korin', '']]","['tongue', 'vocal tract', 'MRI', 'statistical model', 'shape analysis']"
212,1706.03170,Amirhossein Tavanaei,Amirhossein Tavanaei and Anthony Maida,"Bio-Inspired Multi-Layer Spiking Neural Network Extracts Discriminative
  Features from Speech Signals",,"Neural Information Processing. ICONIP 2017. Lecture Notes in
  Computer Science, vol 10639",10.1007/978-3-319-70136-3_95,,cs.NE cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spiking neural networks (SNNs) enable power-efficient implementations due to
their sparse, spike-based coding scheme. This paper develops a bio-inspired SNN
that uses unsupervised learning to extract discriminative features from speech
signals, which can subsequently be used in a classifier. The architecture
consists of a spiking convolutional/pooling layer followed by a fully connected
spiking layer for feature discovery. The convolutional layer of leaky,
integrate-and-fire (LIF) neurons represents primary acoustic features. The
fully connected layer is equipped with a probabilistic spike-timing-dependent
plasticity learning rule. This layer represents the discriminative features
through probabilistic, LIF neurons. To assess the discriminative power of the
learned features, they are used in a hidden Markov model (HMM) for spoken digit
recognition. The experimental results show performance above 96% that compares
favorably with popular statistical feature extraction methods. Our results
provide a novel demonstration of unsupervised feature acquisition in an SNN.
","[{'version': 'v1', 'created': 'Sat, 10 Jun 2017 02:14:42 GMT'}]",2017-11-23,"[['Tavanaei', 'Amirhossein', ''], ['Maida', 'Anthony', '']]","['Bio-inspired multi-layer framework', 'spiking network', 'speech recognition', 'unsupervised feature extraction']"
213,1211.4218,Natalia Melnikova,"N. B. Melnikova, V. V. Krzhizhanovskaya, P. M. A. Sloot","Modeling Earthen Dike Stability: Sensitivity Analysis and Automatic
  Calibration of Diffusivities Based on Live Sensor Data",,"Journal of Hydrology 496 (2013), pp. 154-165",10.1016/j.jhydrol.2013.05.031,,cs.CE physics.geo-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper describes concept and implementation details of integrating a
finite element module for dike stability analysis Virtual Dike into an early
warning system for flood protection. The module operates in real-time mode and
includes fluid and structural sub-models for simulation of porous flow through
the dike and for dike stability analysis. Real-time measurements obtained from
pore pressure sensors are fed into the simulation module, to be compared with
simulated pore pressure dynamics. Implementation of the module has been
performed for a real-world test case - an earthen levee protecting a sea-port
in Groningen, the Netherlands. Sensitivity analysis and calibration of
diffusivities have been performed for tidal fluctuations. An algorithm for
automatic diffusivities calibration for a heterogeneous dike is proposed and
studied. Analytical solutions describing tidal propagation in one-dimensional
saturated aquifer are employed in the algorithm to generate initial estimates
of diffusivities.
","[{'version': 'v1', 'created': 'Sun, 18 Nov 2012 13:05:54 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Nov 2012 12:40:27 GMT'}]",2014-01-30,"[['Melnikova', 'N. B.', ''], ['Krzhizhanovskaya', 'V. V.', ''], ['Sloot', 'P. M. A.', '']]","['dike stability', 'porous flow', 'diffusivity calibration', 'sensitivity analysis', 'live sensor data']"
214,1803.01686,Yuanhang Su,"Yuanhang Su, C.-C. Jay Kuo","On Extended Long Short-term Memory and Dependent Bidirectional Recurrent
  Neural Network",github repo: https://github.com/yuanhangsu/ELSTM-DBRNN,Neurocomputing 356 (2019): 151-161,10.1016/j.neucom.2019.04.044,,cs.LG cs.CL cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we first analyze the memory behavior in three recurrent neural
networks (RNN) cells; namely, the simple RNN (SRN), the long short-term memory
(LSTM) and the gated recurrent unit (GRU), where the memory is defined as a
function that maps previous elements in a sequence to the current output. Our
study shows that all three of them suffer rapid memory decay. Then, to
alleviate this effect, we introduce trainable scaling factors that act like an
attention mechanism to adjust memory decay adaptively. The new design is called
the extended LSTM (ELSTM). Finally, to design a system that is robust to
previous erroneous predictions, we propose a dependent bidirectional recurrent
neural network (DBRNN). Extensive experiments are conducted on different
language tasks to demonstrate the superiority of the proposed ELSTM and DBRNN
solutions. The ELTSM has achieved up to 30% increase in the labeled attachment
score (LAS) as compared to LSTM and GRU in the dependency parsing (DP) task.
Our models also outperform other state-of-the-art models such as bi-attention
and convolutional sequence to sequence (convseq2seq) by close to 10% in the
LAS. The code is released as an open source
(https://github.com/yuanhangsu/ELSTM-DBRNN)
","[{'version': 'v1', 'created': 'Tue, 27 Feb 2018 02:47:13 GMT'}, {'version': 'v2', 'created': 'Sun, 16 Sep 2018 05:43:49 GMT'}, {'version': 'v3', 'created': 'Sun, 3 Mar 2019 04:30:02 GMT'}, {'version': 'v4', 'created': 'Tue, 14 May 2019 23:26:31 GMT'}, {'version': 'v5', 'created': 'Sun, 17 Nov 2019 21:39:02 GMT'}]",2019-11-19,"[['Su', 'Yuanhang', ''], ['Kuo', 'C. -C. Jay', '']]","['recurrent neural networks', 'long short-term memory', 'gated']"
215,1501.05613,Arnaud Martin,"Jungyeul Park (IRISA), Mouna Chebbah (IRISA), Siwar Jendoubi (IRISA),
  Arnaud Martin (IRISA)",Second-Order Belief Hidden Markov Models,,"Belief 2014, Sep 2014, Oxford, United Kingdom. pp.284 - 293",10.1007/978-3-319-11191-9_31,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hidden Markov Models (HMMs) are learning methods for pattern recognition. The
probabilistic HMMs have been one of the most used techniques based on the
Bayesian model. First-order probabilistic HMMs were adapted to the theory of
belief functions such that Bayesian probabilities were replaced with mass
functions. In this paper, we present a second-order Hidden Markov Model using
belief functions. Previous works in belief HMMs have been focused on the
first-order HMMs. We extend them to the second-order model.
","[{'version': 'v1', 'created': 'Thu, 22 Jan 2015 19:56:34 GMT'}]",2015-01-23,"[['Park', 'Jungyeul', '', 'IRISA'], ['Chebbah', 'Mouna', '', 'IRISA'], ['Jendoubi', 'Siwar', '', 'IRISA'], ['Martin', 'Arnaud', '', 'IRISA']]","['Belief functions', 'Dempster-Shafer theory', 'first-order belief HMM', 'second-order belief HMM', 'probabilistic HMM']"
216,1403.7783,Mohammed  Javed,"Mohammed Javed, P. Nagabhushan, B.B. Chaudhuri","Extraction of Line Word Character Segments Directly from Run Length
  Compressed Printed Text Documents","IEEE Proceedings in National Conference on Computer Vision, Pattern
  Recognition, Image Processing and Graphics (NCVPRIPG 2013)",,10.1109/NCVPRIPG.2013.6776195,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Segmentation of a text-document into lines, words and characters, which is
considered to be the crucial pre-processing stage in Optical Character
Recognition (OCR) is traditionally carried out on uncompressed documents,
although most of the documents in real life are available in compressed form,
for the reasons such as transmission and storage efficiency. However, this
implies that the compressed image should be decompressed, which indents
additional computing resources. This limitation has motivated us to take up
research in document image analysis using compressed documents. In this paper,
we think in a new way to carry out segmentation at line, word and character
level in run-length compressed printed-text-documents. We extract the
horizontal projection profile curve from the compressed file and using the
local minima points perform line segmentation. However, tracing vertical
information which leads to tracking words-characters in a run-length compressed
file is not very straight forward. Therefore, we propose a novel technique for
carrying out simultaneous word and character segmentation by popping out column
runs from each row in an intelligent sequence. The proposed algorithms have
been validated with 1101 text-lines, 1409 words and 7582 characters from a
data-set of 35 noise and skew free compressed documents of Bengali, Kannada and
English Scripts.
","[{'version': 'v1', 'created': 'Sun, 30 Mar 2014 16:48:31 GMT'}]",2014-04-01,"[['Javed', 'Mohammed', ''], ['Nagabhushan', 'P.', ''], ['Chaudhuri', 'B. B.', '']]","['Compressed document segmentation', 'run-length compression', 'Line word', 'character segmentation']"
217,1806.01539,Christine Michel,"Elena Codreanu (GRePS, SICAL, WSE), Christine Michel (SICAL),
  Marc-Eric Bobillier-Chaumond (GRePS), Olivier Vigneau (WSE)","L'acceptation et l'appropriation des ENT (Espaces Num{\'e}riques de
  Travail) par les enseignants du primaire",in french,"2017, 24 (1), 39p. http://sticef.org",10.23709/sticef.24.1.1,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents an evaluation of the conditions of use of a VWE
(Virtual Work Environment) by primary school teachers. To this end, we
conducted two studies and used activity theory as theoretical framework. Our
first study aims to assess real practices carried out with the VWE and analyzed
publications' content in order to understand how users appropriate the tool.
The second study describes how teachers perceive the role of the VWE in the
evolution of their working prac-tices (maintaining, transforming and
restricting the existent practices). These stud-ies indicate that technological
appropriation is achieved through instructional and communicational uses. The
acceptance of this VWE is due to its ease of use and interface adequacy to
teachers and young children.
","[{'version': 'v1', 'created': 'Tue, 5 Jun 2018 08:09:57 GMT'}]",2018-06-06,"[['Codreanu', 'Elena', '', 'GRePS, SICAL, WSE'], ['Michel', 'Christine', '', 'SICAL'], ['Bobillier-Chaumond', 'Marc-Eric', '', 'GRePS'], ['Vigneau', 'Olivier', '', 'WSE']]","['• Virtual Work Environment', 'Practices', 'Uses', 'Primary Education']"
218,1611.04529,Helena Sofia Rodrigues,Helena Sofia Rodrigues and Manuel Jos\'e Fonseca,"Can information be spread as a virus? Viral Marketing as epidemiological
  model","Please cite this paper as: Rodrigues, Helena Sofia and Fonseca,
  Manuel Jos\'e (2016) . Can information be spread as a virus? Viral Marketing
  as epidemiological model, Mathematical Methods in the Applied Sciences, 39:
  4780--4786. arXiv admin note: substantial text overlap with arXiv:1507.06986","Mathematical Methods in the Applied Sciences,39: 4780--4786, 2016",10.1002/mma.3783,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In epidemiology, an epidemic is defined as the spread of an infectious
disease to a large number of people in a given population within a short period
of time. In the marketing context, a message is viral when it is broadly sent
and received by the target market through person-to-person transmission. This
specific marketing communication strategy is commonly referred as viral
marketing. Due to this similarity between an epidemic and the viral marketing
process and because the understanding of the critical factors to this
communications strategy effectiveness remain largely unknown, the mathematical
models in epidemiology are presented in this marketing specific field. In this
paper, an epidemiological model SIR (Susceptible- Infected-Recovered) to study
the effects of a viral marketing strategy is presented. It is made a comparison
between the disease parameters and the marketing application, and Matlab
simulations are performed. Finally, some conclusions are carried out and their
marketing implications are exposed: interactions across the parameters suggest
some recommendations to marketers, as the profitability of the investment or
the need to improve the targeting criteria of the communications campaigns.
","[{'version': 'v1', 'created': 'Tue, 8 Nov 2016 15:30:00 GMT'}]",2016-11-15,"[['Rodrigues', 'Helena Sofia', ''], ['Fonseca', 'Manuel José', '']]","['viral marketing', 'word-of-mouth', 'epidemiological model', 'numerical simulations', 'infectivity', 'recovery rate', 'seed population']"
219,1905.02951,Mouhamed Abdulla Ph.D.,Mouhamed Abdulla and Zohreh Motamedi and Amjed Majeed,"Redesigning Telecommunication Engineering Courses with CDIO geared for
  Polytechnic Education","Proc. of the 10th Conference on Canadian Engineering Education
  Association (CEEA'19)",,10.24908/PCEEA.VI0.13855,,cs.CY cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Whether in chemical, civil, mechanical, electrical, or their related
engineering subdisciplines, remaining up-to-date in the subject matter is
crucial. However, due to the pace of technological evolution, information and
communications technology (ICT) fields of study are impacted with much higher
consequences. Meanwhile, the curricula of higher educational institutes are
struggling to catch up to this reality. In order to remain competitive,
engineering schools ought to offer ICT related courses that are at once modern,
relevant and ultimately beneficial for the employability of their graduates. In
this spirit, we were recently mandated by our engineering school to develop and
design telecommunication courses with great emphasis on (i) technological
modernity, and (ii) experiential learning. To accomplish these objectives, we
utilized the conceive, design, implement and operate (CDIO) framework, a modern
engineering education initiative of which Sheridan is a member. In this
article, we chronicle the steps we took to streamline and modernize the
curriculum by outlining an effective methodology for course design and
development with CDIO. We then provide examples of course update and design
using the proposed methodology and highlight the lessons learned from this
systematic curriculum development endeavor.
","[{'version': 'v1', 'created': 'Wed, 8 May 2019 08:24:15 GMT'}]",2020-06-08,"[['Abdulla', 'Mouhamed', ''], ['Motamedi', 'Zohreh', ''], ['Majeed', 'Amjed', '']]","['Engineering Education', 'Engineering Design', 'Course Development', 'Applied Learning', 'CDIO']"
220,1901.10804,Samad Noeiaghdam,Samad Noeiaghdam,"Numerical approximation of modified non-linear SIR model of computer
  viruses",,Vol 1 No 1 (2019): Contemporary Mathematics,10.37256/cm.11201959.34-48,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the non-linear modified epidemiological model of computer
viruses is illustrated. For this aim, two semi-analytical methods, the
differential transform method (DTM) and the Laplace-Adomian decomposition
method (LADM) are applied. The numerical results are estimated for different
values of iterations and compared to the results of the LADM and the homotopy
analysis transform method (HATM). Also, graphs of residual errors and phase
portraits of approximate solutions for $n=5,10,15$ are demonstrated. The
numerical approximations show the performance of the LADM in comparison to the
LADM and the HATM.
","[{'version': 'v1', 'created': 'Tue, 15 Jan 2019 07:12:32 GMT'}]",2020-01-07,"[['Noeiaghdam', 'Samad', '']]","['Non-linear Susceptible-Infected-Recovered model', 'Differential transform method', 'Laplace transformations', 'Adomian decomposition method']"
221,1607.08038,Konstantin Yakovlev S,"Aleksandr I. Panov, Konstantin Yakovlev","Behavior and path planning for the coalition of cognitive robots in
  smart relocation tasks","As submitted to the 4th International Conference on Robot
  Intelligence Technology and Applications (RiTA-2015), Bucheon, Korea,
  December 14-16, 2015",,10.1007/978-3-319-31293-4_1,,cs.AI cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we outline the approach of solving special type of navigation
tasks for robotic systems, when a coalition of robots (agents) acts in the 2D
environment, which can be modified by the actions, and share the same goal
location. The latter is originally unreachable for some members of the
coalition, but the common task still can be accomplished as the agents can
assist each other (e.g. by modifying the environment). We call such tasks smart
relocation tasks (as the can not be solved by pure path planning methods) and
study spatial and behavior interaction of robots while solving them. We use
cognitive approach and introduce semiotic knowledge representation - sign world
model which underlines behavioral planning methodology. Planning is viewed as a
recursive search process in the hierarchical state-space induced by sings with
path planning signs reside on the lowest level. Reaching this level triggers
path planning which is accomplished by state of the art grid-based planners
focused on producing smooth paths (e.g. LIAN) and thus indirectly guarantying
feasibility of that paths against agent's dynamic constraints.
","[{'version': 'v1', 'created': 'Wed, 27 Jul 2016 11:12:02 GMT'}]",2016-07-28,"[['Panov', 'Aleksandr I.', ''], ['Yakovlev', 'Konstantin', '']]","['behavior planning', 'task planning', 'coalition', 'path planning', 'sign world model', 'semiotic model', 'knowledge representation', 'LIAN']"
222,1803.02124,David Robb,"Helen Hastie, Francisco J. Chiyah Garcia, David A. Robb, Pedro Patron
  and Atanas Laskov",MIRIAM: A Multimodal Chat-Based Interface for Autonomous Systems,"2 pages, ICMI'17, 19th ACM International Conference on Multimodal
  Interaction, November 13-17 2017, Glasgow, UK",,10.1145/3136755.3143022,,cs.AI cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present MIRIAM (Multimodal Intelligent inteRactIon for Autonomous
systeMs), a multimodal interface to support situation awareness of autonomous
vehicles through chat-based interaction. The user is able to chat about the
vehicle's plan, objectives, previous activities and mission progress. The
system is mixed initiative in that it pro-actively sends messages about key
events, such as fault warnings. We will demonstrate MIRIAM using SeeByte's
SeeTrack command and control interface and Neptune autonomy simulator.
","[{'version': 'v1', 'created': 'Tue, 6 Mar 2018 11:33:04 GMT'}]",2018-03-07,"[['Hastie', 'Helen', ''], ['Garcia', 'Francisco J. Chiyah', ''], ['Robb', 'David A.', ''], ['Patron', 'Pedro', ''], ['Laskov', 'Atanas', '']]","['Multimodal output', 'natural language generation', 'autonomous systems']"
223,1407.2190,Shahid Alam,Shahid Alam,Is Fortran Still Relevant? Comparing Fortran with Java and C++,,"International Journal of Software Engineering & Application, pages
  25-45, Volume 5, No 3, 2014",10.5121/ijsea.2014.5303,,cs.PL cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper presents a comparative study to evaluate and compare Fortran with
the two most popular programming languages Java and C++. Fortran has gone
through major and minor extensions in the years 2003 and 2008. (1) How much
have these extensions made Fortran comparable to Java and C++? (2) What are the
differences and similarities, in supporting features like: Templates, object
constructors and destructors, abstract data types and dynamic binding? These
are the main questions we are trying to answer in this study. An
object-oriented ray tracing application is implemented in these three languages
to compare them. By using only one program we ensured there was only one set of
requirements thus making the comparison homogeneous. Based on our literature
survey this is the first study carried out to compare these languages by
applying software metrics to the ray tracing application and comparing these
results with the similarities and differences found in practice. We motivate
the language implementers and compiler developers, by providing binary analysis
and profiling of the application, to improve Fortran object handling and
processing, and hence making it more prolific and general. This study
facilitates and encourages the reader to further explore, study and use these
languages more effectively and productively, especially Fortran.
","[{'version': 'v1', 'created': 'Wed, 11 Jun 2014 16:40:55 GMT'}]",2014-07-09,"[['Alam', 'Shahid', '']]","['Object-oriented programming languages', 'Comparing Languages', 'Fortran', 'Java', 'C++', 'Software Metrics']"
224,2207.10767,Prabhat Agarwal,"Prabhat Agarwal, Manisha Srivastava, Vishwakarma Singh, Charles
  Rosenberg",Modeling User Behavior With Interaction Networks for Spam Detection,"6 pages, 2 figures, accepted to SIGIR 2022","In Proceedings of the 45th International ACM SIGIR Conference on
  Research and Development in Information Retrieval (2022), pp. 2437-2442",10.1145/3477495.3531875,,cs.LG cs.IR cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Spam is a serious problem plaguing web-scale digital platforms which
facilitate user content creation and distribution. It compromises platform's
integrity, performance of services like recommendation and search, and overall
business. Spammers engage in a variety of abusive and evasive behavior which
are distinct from non-spammers. Users' complex behavior can be well represented
by a heterogeneous graph rich with node and edge attributes. Learning to
identify spammers in such a graph for a web-scale platform is challenging
because of its structural complexity and size. In this paper, we propose SEINE
(Spam DEtection using Interaction NEtworks), a spam detection model over a
novel graph framework. Our graph simultaneously captures rich users' details
and behavior and enables learning on a billion-scale graph. Our model considers
neighborhood along with edge types and attributes, allowing it to capture a
wide range of spammers. SEINE, trained on a real dataset of tens of millions of
nodes and billions of edges, achieves a high performance of 80% recall with 1%
false positive rate. SEINE achieves comparable performance to the
state-of-the-art techniques on a public dataset while being pragmatic to be
used in a large-scale production system.
","[{'version': 'v1', 'created': 'Thu, 21 Jul 2022 21:34:56 GMT'}]",2022-07-25,"[['Agarwal', 'Prabhat', ''], ['Srivastava', 'Manisha', ''], ['Singh', 'Vishwakarma', ''], ['Rosenberg', 'Charles', '']]","['Heterogeneous Graph Neural Networks', 'Spam', 'Machine Learning']"
225,1912.05170,"G\""orkem Algan","G\""orkem Algan, Ilkay Ulusoy","Image Classification with Deep Learning in the Presence of Noisy Labels:
  A Survey",,,10.1016/j.knosys.2021.106771,,cs.LG cs.CV stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Image classification systems recently made a giant leap with the advancement
of deep neural networks. However, these systems require an excessive amount of
labeled data to be adequately trained. Gathering a correctly annotated dataset
is not always feasible due to several factors, such as the expensiveness of the
labeling process or difficulty of correctly classifying data, even for the
experts. Because of these practical challenges, label noise is a common problem
in real-world datasets, and numerous methods to train deep neural networks with
label noise are proposed in the literature. Although deep neural networks are
known to be relatively robust to label noise, their tendency to overfit data
makes them vulnerable to memorizing even random noise. Therefore, it is crucial
to consider the existence of label noise and develop counter algorithms to fade
away its adverse effects to train deep neural networks efficiently. Even though
an extensive survey of machine learning techniques under label noise exists,
the literature lacks a comprehensive survey of methodologies centered
explicitly around deep learning in the presence of noisy labels. This paper
aims to present these algorithms while categorizing them into one of the two
subgroups: noise model based and noise model free methods. Algorithms in the
first group aim to estimate the noise structure and use this information to
avoid the adverse effects of noisy labels. Differently, methods in the second
group try to come up with inherently noise robust algorithms by using
approaches like robust losses, regularizers or other learning paradigms.
","[{'version': 'v1', 'created': 'Wed, 11 Dec 2019 08:26:57 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Jun 2020 09:56:01 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Jan 2021 08:50:51 GMT'}]",2021-01-19,"[['Algan', 'Görkem', ''], ['Ulusoy', 'Ilkay', '']]","['deep learning', 'label noise', 'classification with noise', 'noise robust', 'noise tolerant']"
226,1007.5165,Secretary Iju,"R. Shankar (1), Timothy Rajkumar.K (2) and P.Dananjayan (2) ((1) Sri
  Manakula Vinayagar Engineering College and (2) Pondicherry Engineering
  College, India)","Security Enhancement With Optimal QOS Using EAP-AKA In Hybrid Coupled
  3G-WLAN Convergence Network","12 pages, 5 figures",International Journal Of UbiComp 1.3 (2010) 31-42,10.5121/iju.2010.1303,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The third generation partnership project (3GPP) has addressed the feasibility
of interworking and specified the interworking architecture and security
architecture for third generation (3G)-wireless local area network (WLAN), it
is developing, system architecture evolution (SAE)/ long term evolution (LTE)
architecture, for the next generation mobile communication system. To provide a
secure 3G-WLAN interworking in the SAE/LTE architecture, Extensible
authentication protocol-authentication and key agreement (EAP-AKA) is used.
However, EAP-AKA have several vulnerabilities. Therefore, this paper not only
analyses the threats and attacks in 3G-WLAN interworking but also proposes a
new authentication and key agreement protocol based on EAP-AKA. The proposed
protocol combines elliptic curve Diffie-Hellman (ECDH) with symmetric key
cryptosystem to overcome the vulnerabilities. The proposed protocol is used in
hybrid coupled 3G-WLAN convergence network to analyse its efficiency in terms
of QoS metrics, the results obtained using OPNET 14.5 shows that the proposed
protocol outperforms existing interworking protocols both in security and QoS.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2010 09:39:23 GMT'}]",2010-07-30,"[['Shankar', 'R.', ''], ['K', 'Timothy Rajkumar.', ''], ['Dananjayan', 'P.', '']]","['3G-WLAN', 'Convergence Network', 'EAP-AKA', 'Security', 'QoS']"
227,1210.2640,Eric Eaton,"Eric Eaton, Marie desJardins, Sara Jacob","Multi-view constrained clustering with an incomplete mapping between
  views",,"Knowledge and Information Systems 38(1): 231-257, 2014",10.1007/s10115-012-0577-7,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-view learning algorithms typically assume a complete bipartite mapping
between the different views in order to exchange information during the
learning process. However, many applications provide only a partial mapping
between the views, creating a challenge for current methods. To address this
problem, we propose a multi-view algorithm based on constrained clustering that
can operate with an incomplete mapping. Given a set of pairwise constraints in
each view, our approach propagates these constraints using a local similarity
measure to those instances that can be mapped to the other views, allowing the
propagated constraints to be transferred across views via the partial mapping.
It uses co-EM to iteratively estimate the propagation within each view based on
the current clustering model, transfer the constraints across views, and then
update the clustering model. By alternating the learning process between views,
this approach produces a unified clustering model that is consistent with all
views. We show that this approach significantly improves clustering performance
over several other methods for transferring constraints and allows multi-view
clustering to be reliably applied when given a limited mapping between the
views. Our evaluation reveals that the propagated constraints have high
precision with respect to the true clusters in the data, explaining their
benefit to clustering performance in both single- and multi-view learning
scenarios.
","[{'version': 'v1', 'created': 'Tue, 9 Oct 2012 15:25:01 GMT'}]",2014-11-03,"[['Eaton', 'Eric', ''], ['desJardins', 'Marie', ''], ['Jacob', 'Sara', '']]","['constrained clustering', 'multi-view learning', 'semi-supervised learning']"
228,1202.5820,Zi-Ke Zhang Mr.,"Zi-Ke Zhang, Tao Zhou, Yi-Cheng Zhang",Tag-Aware Recommender Systems: A State-of-the-art Survey,"19 pages, 3 figures",Journal of Computer Science and Technology 26 (2011) 767,10.1007/s11390-011-0176-1,,cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the past decade, Social Tagging Systems have attracted increasing
attention from both physical and computer science communities. Besides the
underlying structure and dynamics of tagging systems, many efforts have been
addressed to unify tagging information to reveal user behaviors and
preferences, extract the latent semantic relations among items, make
recommendations, and so on. Specifically, this article summarizes recent
progress about tag-aware recommender systems, emphasizing on the contributions
from three mainstream perspectives and approaches: network-based methods,
tensor-based methods, and the topic-based methods. Finally, we outline some
other tag-related works and future challenges of tag-aware recommendation
algorithms.
","[{'version': 'v1', 'created': 'Mon, 27 Feb 2012 03:37:14 GMT'}]",2012-02-28,"[['Zhang', 'Zi-Ke', ''], ['Zhou', 'Tao', ''], ['Zhang', 'Yi-Cheng', '']]","['social tagging systems', 'tag-aware recommendation', 'network-based', 'tensor-based', 'topicbased methods']"
229,1803.06259,"Alexander Spr\""owitz","Alexander Spr\""owitz, Alexandre Tuleu, Mostafa Ajallooeian, Massimo
  Vespignani, Rico Moeckel, Peter Eckert, Michiel D'Haene, Jonas Degrave, Arne
  Nordmann, Benjamin Schrauwen, Jochen Steil, and Auke Jan Ijspeert","Oncilla robot: a versatile open-source quadruped research robot with
  compliant pantograph legs",,Front. Robot. AI 5:67 (2018),10.3389/frobt.2018.00067,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present Oncilla robot, a novel mobile, quadruped legged locomotion
machine. This large-cat sized, 5.1 robot is one of a kind of a recent,
bioinspired legged robot class designed with the capability of model-free
locomotion control. Animal legged locomotion in rough terrain is clearly shaped
by sensor feedback systems. Results with Oncilla robot show that agile and
versatile locomotion is possible without sensory signals to some extend, and
tracking becomes robust when feedback control is added (Ajaoolleian 2015). By
incorporating mechanical and control blueprints inspired from animals, and by
observing the resulting robot locomotion characteristics, we aim to understand
the contribution of individual components. Legged robots have a wide mechanical
and control design parameter space, and a unique potential as research tools to
investigate principles of biomechanics and legged locomotion control. But the
hardware and controller design can be a steep initial hurdle for academic
research. To facilitate the easy start and development of legged robots,
Oncilla-robot's blueprints are available through open-source. [...]
","[{'version': 'v1', 'created': 'Fri, 16 Mar 2018 14:59:41 GMT'}, {'version': 'v2', 'created': 'Sat, 16 Jun 2018 07:43:16 GMT'}]",2018-09-11,"[['Spröwitz', 'Alexander', ''], ['Tuleu', 'Alexandre', ''], ['Ajallooeian', 'Mostafa', ''], ['Vespignani', 'Massimo', ''], ['Moeckel', 'Rico', ''], ['Eckert', 'Peter', ''], [""D'Haene"", 'Michiel', ''], ['Degrave', 'Jonas', ''], ['Nordmann', 'Arne', ''], ['Schrauwen', 'Benjamin', ''], ['Steil', 'Jochen', ''], ['Ijspeert', 'Auke Jan', '']]","['quadruped', 'robot', 'pantograph', 'open-source', 'multiple gaits', 'open-loop', 'pattern generator', 'turning']"
230,1711.08336,Eli (Omid) David,"Eli David, Nathan S. Netanyahu","DeepSign: Deep Learning for Automatic Malware Signature Generation and
  Classification",,"International Joint Conference on Neural Networks (IJCNN), pages
  1-8, Killarney, Ireland, July 2015",10.1109/IJCNN.2015.7280815,,cs.CR cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel deep learning based method for automatic malware
signature generation and classification. The method uses a deep belief network
(DBN), implemented with a deep stack of denoising autoencoders, generating an
invariant compact representation of the malware behavior. While conventional
signature and token based methods for malware detection do not detect a
majority of new variants for existing malware, the results presented in this
paper show that signatures generated by the DBN allow for an accurate
classification of new malware variants. Using a dataset containing hundreds of
variants for several major malware families, our method achieves 98.6%
classification accuracy using the signatures generated by the DBN. The
presented method is completely agnostic to the type of malware behavior that is
logged (e.g., API calls and their parameters, registry entries, websites and
ports accessed, etc.), and can use any raw input from a sandbox to successfully
train the deep neural network which is used to generate malware signatures.
","[{'version': 'v1', 'created': 'Tue, 21 Nov 2017 07:22:58 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Nov 2017 16:27:18 GMT'}]",2017-11-27,"[['David', 'Eli', ''], ['Netanyahu', 'Nathan S.', '']]","['Deep Learning', 'Deep Belief Network', 'Autoencoders', 'Malware', 'Automatic Signature Generation']"
231,1402.2409,Christoph Koutschan,"Shaoshi Chen, Manuel Kauers, Christoph Koutschan",A Generalized Apagodu-Zeilberger Algorithm,,"Proceedings of the International Symposium on Symbolic and
  Algebraic Computation (ISSAC 2014), pages 107-114, 2014. ACM, New York, USA,
  ISBN 978-1-4503-2501-1",10.1145/2608628.2608641,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Apagodu-Zeilberger algorithm can be used for computing annihilating
operators for definite sums over hypergeometric terms, or for definite
integrals over hyperexponential functions. In this paper, we propose a
generalization of this algorithm which is applicable to arbitrary
$\partial$-finite functions. In analogy to the hypergeometric case, we
introduce the notion of proper $\partial$-finite functions. We show that the
algorithm always succeeds for these functions, and we give a tight a priori
bound for the order of the output operator.
","[{'version': 'v1', 'created': 'Tue, 11 Feb 2014 09:35:59 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Apr 2014 15:03:50 GMT'}, {'version': 'v3', 'created': 'Sat, 2 Aug 2014 19:32:33 GMT'}]",2014-08-05,"[['Chen', 'Shaoshi', ''], ['Kauers', 'Manuel', ''], ['Koutschan', 'Christoph', '']]","['Symbolic summation', 'symbolic integration', '∂-finite function', 'holonomic function', 'Ore algebra', 'creative telescoping']"
232,1810.08218,Luciano A. Romero Calla,"Luciano A. Romero Calla and Lizeth J. Fuentes Perez and Anselmo A.
  Montenegro","A minimalistic approach for fast computation of geodesic distances on
  triangular meshes",Preprint submitted to Computers & Graphics,,10.1016/j.cag.2019.08.014,,cs.CG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The computation of geodesic distances is an important research topic in
Geometry Processing and 3D Shape Analysis as it is a basic component of many
methods used in these areas. In this work, we present a minimalistic parallel
algorithm based on front propagation to compute approximate geodesic distances
on meshes. Our method is practical and simple to implement and does not require
any heavy pre-processing. The convergence of our algorithm depends on the
number of discrete level sets around the source points from which distance
information propagates. To appropriately implement our method on GPUs taking
into account memory coalescence problems, we take advantage of a graph
representation based on a breadth-first search traversal that works
harmoniously with our parallel front propagation approach. We report
experiments that show how our method scales with the size of the problem. We
compare the mean error and processing time obtained by our method with such
measures computed using other methods. Our method produces results in
competitive times with almost the same accuracy, especially for large meshes.
We also demonstrate its use for solving two classical geometry processing
problems: the regular sampling problem and the Voronoi tessellation on meshes.
","[{'version': 'v1', 'created': 'Thu, 18 Oct 2018 18:01:13 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Apr 2019 16:33:01 GMT'}, {'version': 'v3', 'created': 'Sun, 23 Jun 2019 02:42:30 GMT'}, {'version': 'v4', 'created': 'Wed, 31 Jul 2019 08:06:00 GMT'}, {'version': 'v5', 'created': 'Fri, 23 Aug 2019 21:38:42 GMT'}]",2019-09-24,"[['Calla', 'Luciano A. Romero', ''], ['Perez', 'Lizeth J. Fuentes', ''], ['Montenegro', 'Anselmo A.', '']]","['Geodesic distance', 'Fast marching', 'Triangular meshes', 'Parallel programming', 'Breadth-first search']"
233,1705.09797,Abdulhakeem Mohammed,Feodor F. Dragan and Abdulhakeem Mohammed,Slimness of graphs,,"Discrete Mathematics & Theoretical Computer Science, Vol. 21 no. 3
  , Graph Theory (March 4, 2019) dmtcs:5245",10.23638/DMTCS-21-3-10,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Slimness of a graph measures the local deviation of its metric from a tree
metric. In a graph $G=(V,E)$, a geodesic triangle $\bigtriangleup(x,y,z)$ with
$x, y, z\in V$ is the union $P(x,y) \cup P(x,z) \cup P(y,z)$ of three shortest
paths connecting these vertices. A geodesic triangle $\bigtriangleup(x,y,z)$ is
called $\delta$-slim if for any vertex $u\in V$ on any side $P(x,y)$ the
distance from $u$ to $P(x,z) \cup P(y,z)$ is at most $\delta$, i.e. each path
is contained in the union of the $\delta$-neighborhoods of two others. A graph
$G$ is called $\delta$-slim, if all geodesic triangles in $G$ are
$\delta$-slim. The smallest value $\delta$ for which $G$ is $\delta$-slim is
called the slimness of $G$. In this paper, using the layering partition
technique, we obtain sharp bounds on slimness of such families of graphs as (1)
graphs with cluster-diameter $\Delta(G)$ of a layering partition of $G$, (2)
graphs with tree-length $\lambda$, (3) graphs with tree-breadth $\rho$, (4)
$k$-chordal graphs, AT-free graphs and HHD-free graphs. Additionally, we show
that the slimness of every 4-chordal graph is at most 2 and characterize those
4-chordal graphs for which the slimness of every of its induced subgraph is at
most 1.
","[{'version': 'v1', 'created': 'Sat, 27 May 2017 09:44:44 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Feb 2018 17:33:05 GMT'}, {'version': 'v3', 'created': 'Wed, 14 Feb 2018 00:17:47 GMT'}, {'version': 'v4', 'created': 'Thu, 28 Feb 2019 20:49:25 GMT'}]",2019-11-20,"[['Dragan', 'Feodor F.', ''], ['Mohammed', 'Abdulhakeem', '']]","['Metric tree-like structures', 'Slimness', 'Hyperbolicity', 'Layering Partition', 'Tree-length', 'Chordality']"
234,1409.2352,Bernhard Rumpe,"Shahar Maoz, Jan Oliver Ringert, Bernhard Rumpe",ADDiff: Semantic Differencing for Activity Diagrams,"11 pages, 9 figures","Proc. Euro. Soft. Eng. Conf. and SIGSOFT Symp. on the Foundations
  of Soft. Eng. (ESEC/FSE'11), pp. 179-189, ACM, 2011",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Activity diagrams (ADs) have recently become widely used in the modeling of
workflows, business processes, and web-services, where they serve various
purposes, from documentation, requirement definitions, and test case
specifications, to simulation and code generation. As models, programs, and
systems evolve over time, understanding changes and their impact is an
important challenge, which has attracted much research efforts in recent years.
In this paper we present addiff, a semantic differencing operator for ADs.
Unlike most existing approaches to model comparison, which compare the concrete
or the abstract syntax of two given diagrams and output a list of syntactical
changes or edit operations, addiff considers the Semantics of the diagrams at
hand and outputs a set of diff witnesses, each of which is an execution trace
that is possible in the first AD and is not possible in the second. We motivate
the use of addiff, formally define it, and show two algorithms to compute it, a
concrete forward-search algorithm and a symbolic xpoint algorithm, implemented
using BDDs and integrated into the Eclipse IDE. Empirical results and examples
demonstrate the feasibility and unique contribution of addiff to the
state-of-the-art in version comparison and evolution analysis.
","[{'version': 'v1', 'created': 'Mon, 8 Sep 2014 14:14:56 GMT'}]",2014-09-09,"[['Maoz', 'Shahar', ''], ['Ringert', 'Jan Oliver', ''], ['Rumpe', 'Bernhard', '']]","['software evolution', 'activity diagrams', 'differencing']"
235,1701.01061,Samuel Weiser,Samuel Weiser and Mario Werner,SGXIO: Generic Trusted I/O Path for Intel SGX,To appear in CODASPY'16,,10.1145/3029806.3029822,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Application security traditionally strongly relies upon security of the
underlying operating system. However, operating systems often fall victim to
software attacks, compromising security of applications as well. To overcome
this dependency, Intel introduced SGX, which allows to protect application code
against a subverted or malicious OS by running it in a hardware-protected
enclave. However, SGX lacks support for generic trusted I/O paths to protect
user input and output between enclaves and I/O devices.
  This work presents SGXIO, a generic trusted path architecture for SGX,
allowing user applications to run securely on top of an untrusted OS, while at
the same time supporting trusted paths to generic I/O devices. To achieve this,
SGXIO combines the benefits of SGX's easy programming model with traditional
hypervisor-based trusted path architectures. Moreover, SGXIO can tweak insecure
debug enclaves to behave like secure production enclaves. SGXIO surpasses
traditional use cases in cloud computing and makes SGX technology usable for
protecting user-centric, local applications against kernel-level keyloggers and
likewise. It is compatible to unmodified operating systems and works on a
modern commodity notebook out of the box. Hence, SGXIO is particularly
promising for the broad x86 community to which SGX is readily available.
","[{'version': 'v1', 'created': 'Wed, 4 Jan 2017 16:17:23 GMT'}]",2017-01-05,"[['Weiser', 'Samuel', ''], ['Werner', 'Mario', '']]","['Trusted Path', 'SGX', 'Software Guard Extensions', 'SecureExecution', 'Hypervisor']"
236,1908.03505,David Semedo,"Gon\c{c}alo Marcelino, David Semedo, Andr\'e Mour\~ao, Saverio Blasi,
  Marta Mrak, Jo\~ao Magalh\~aes",A Benchmark of Visual Storytelling in Social Media,To appear in ACM ICMR 2019,,10.1145/3323873.3325047,,cs.MM cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Media editors in the newsroom are constantly pressed to provide a ""like-being
there"" coverage of live events. Social media provides a disorganised collection
of images and videos that media professionals need to grasp before publishing
their latest news updated. Automated news visual storyline editing with social
media content can be very challenging, as it not only entails the task of
finding the right content but also making sure that news content evolves
coherently over time. To tackle these issues, this paper proposes a benchmark
for assessing social media visual storylines. The SocialStories benchmark,
comprised by total of 40 curated stories covering sports and cultural events,
provides the experimental setup and introduces novel quantitative metrics to
perform a rigorous evaluation of visual storytelling with social media data.
","[{'version': 'v1', 'created': 'Fri, 9 Aug 2019 15:51:33 GMT'}]",2019-08-12,"[['Marcelino', 'Gonçalo', ''], ['Semedo', 'David', ''], ['Mourão', 'André', ''], ['Blasi', 'Saverio', ''], ['Mrak', 'Marta', ''], ['Magalhães', 'João', '']]","['Storytelling', 'social media', 'benchmark']"
237,1608.07934,Hadi Zare,Hadi Zare and Mojtaba Niazi,Relevant based structure learning for feature selection,"29 pages, 11 figures",Eng. Appl. Artif. Intel. 55 (2016) 93-102,10.1016/j.engappai.2016.06.001,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feature selection is an important task in many problems occurring in pattern
recognition, bioinformatics, machine learning and data mining applications. The
feature selection approach enables us to reduce the computation burden and the
falling accuracy effect of dealing with huge number of features in typical
learning problems. There is a variety of techniques for feature selection in
supervised learning problems based on different selection metrics. In this
paper, we propose a novel unified framework for feature selection built on the
graphical models and information theoretic tools. The proposed approach
exploits the structure learning among features to select more relevant and less
redundant features to the predictive modeling problem according to a primary
novel likelihood based criterion. In line with the selection of the optimal
subset of features through the proposed method, it provides us the Bayesian
network classifier without the additional cost of model training on the
selected subset of features. The optimal properties of our method are
established through empirical studies and computational complexity analysis.
Furthermore the proposed approach is evaluated on a bunch of benchmark datasets
based on the well-known classification algorithms. Extensive experiments
confirm the significant improvement of the proposed approach compared to the
earlier works.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2016 07:21:20 GMT'}]",2016-08-30,"[['Zare', 'Hadi', ''], ['Niazi', 'Mojtaba', '']]","['Feature selection', 'Supervised learning', 'Relevant features', 'Mutual information', 'Structure learning', 'Graphical models']"
238,1911.12982,Xuewen Shi,"Xuewen Shi, Heyan Huang, Ping Jian, Yuhang Guo, Xiaochi Wei, Yi-Kun
  Tang",Neural Chinese Word Segmentation as Sequence to Sequence Translation,"In proceedings of SMP 2017 (Chinese National Conference on Social
  Media Processing)",,10.1007/978-981-10-6805-8_8,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Recently, Chinese word segmentation (CWS) methods using neural networks have
made impressive progress. Most of them regard the CWS as a sequence labeling
problem which construct models based on local features rather than considering
global information of input sequence. In this paper, we cast the CWS as a
sequence translation problem and propose a novel sequence-to-sequence CWS model
with an attention-based encoder-decoder framework. The model captures the
global information from the input and directly outputs the segmented sequence.
It can also tackle other NLP tasks with CWS jointly in an end-to-end mode.
Experiments on Weibo, PKU and MSRA benchmark datasets show that our approach
has achieved competitive performances compared with state-of-the-art methods.
Meanwhile, we successfully applied our proposed model to jointly learning CWS
and Chinese spelling correction, which demonstrates its applicability of
multi-task fusion.
","[{'version': 'v1', 'created': 'Fri, 29 Nov 2019 07:22:01 GMT'}]",2019-12-02,"[['Shi', 'Xuewen', ''], ['Huang', 'Heyan', ''], ['Jian', 'Ping', ''], ['Guo', 'Yuhang', ''], ['Wei', 'Xiaochi', ''], ['Tang', 'Yi-Kun', '']]","['Chinese word segmentation', 'sequence-to-sequence', 'Chinesespelling correction', 'natural language processing']"
239,1212.5440,Zungeru Adamu Murtala,A. M. Zungeru,Development of an Anti-collision Model for Vehicles,"14 pages, 14 figures, Journal paper","International Journal of Embedded Systems and Applications
  (IJESA), vol. 2(4), pp. 21-34, 2012",10.5121/ijesa.2012.2402,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Anti Collision device is a detection device meant to be incorporated into
cars for the purpose of safety. As opposed to the anti collision devices
present in the market today, this system is not designed to control the
vehicle. Instead, it serves as an alert in the face of imminent collision. The
device is intended to find a way to implement a minimum spacing for cars in
traffic in an affordable way. It would also achieve safety for the passengers
of a moving car. The device is made up of an infrared transmitter and receiver.
Also incorporated into it is an audio visual alarm to work in with the receiver
and effectively alert the driver and/or the passengers. To achieve this design,
555 timers coupled both as astable and monostable circuits were used along with
a 38 KHz Square Pulse generator. The device works by sending out streams of
infrared radiation and when these rays are seen by the other equipped vehicle,
both are meant to take the necessary precaution to avert a collision. The
device would still sound an alarm even though it is not receiving infrared
beams from the oncoming vehicle. This is due to reflection of its own infrared
beams. At the end of the design and testing process, overall system was
implemented with a constructed work, tested working and perfectly functional.
","[{'version': 'v1', 'created': 'Fri, 21 Dec 2012 13:58:27 GMT'}]",2012-12-24,"[['Zungeru', 'A. M.', '']]","['Embedded Systems', 'Control System', 'Vehicle Automation', 'Anti-Collision', 'Electronic Circuit Design']"
240,1612.06454,Henrique Morimitsu,"Henrique Morimitsu, Isabelle Bloch and Roberto M. Cesar-Jr","Exploring Structure for Long-Term Tracking of Multiple Objects in Sports
  Videos","This version corresponds to the preprint of the paper accepted for
  CVIU",,10.1016/j.cviu.2016.12.003,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel approach for exploiting structural
relations to track multiple objects that may undergo long-term occlusion and
abrupt motion. We use a model-free approach that relies only on annotations
given in the first frame of the video to track all the objects online, i.e.
without knowledge from future frames. We initialize a probabilistic Attributed
Relational Graph (ARG) from the first frame, which is incrementally updated
along the video. Instead of using the structural information only to evaluate
the scene, the proposed approach considers it to generate new tracking
hypotheses. In this way, our method is capable of generating relevant object
candidates that are used to improve or recover the track of lost objects. The
proposed method is evaluated on several videos of table tennis, volleyball, and
on the ACASVA dataset. The results show that our approach is very robust,
flexible and able to outperform other state-of-the-art methods in sports videos
that present structural patterns.
","[{'version': 'v1', 'created': 'Mon, 19 Dec 2016 23:14:26 GMT'}]",2016-12-21,"[['Morimitsu', 'Henrique', ''], ['Bloch', 'Isabelle', ''], ['Cesar-Jr', 'Roberto M.', '']]","['Multi-object tracking', 'Structural information', 'Particle filter', 'Graph']"
241,1810.08678,Zhenpeng Zhou,"Zhenpeng Zhou, Steven Kearnes, Li Li, Richard N. Zare, and Patrick
  Riley",Optimization of Molecules via Deep Reinforcement Learning,,,10.1038/s41598-019-47148-x,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a framework, which we call Molecule Deep $Q$-Networks (MolDQN),
for molecule optimization by combining domain knowledge of chemistry and
state-of-the-art reinforcement learning techniques (double $Q$-learning and
randomized value functions). We directly define modifications on molecules,
thereby ensuring 100\% chemical validity. Further, we operate without
pre-training on any dataset to avoid possible bias from the choice of that set.
Inspired by problems faced during medicinal chemistry lead optimization, we
extend our model with multi-objective reinforcement learning, which maximizes
drug-likeness while maintaining similarity to the original molecule. We further
show the path through chemical space to achieve optimization for a molecule to
understand how the model works.
","[{'version': 'v1', 'created': 'Fri, 19 Oct 2018 20:23:44 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Oct 2018 05:28:46 GMT'}, {'version': 'v3', 'created': 'Fri, 1 Mar 2019 01:46:11 GMT'}]",2020-06-22,"[['Zhou', 'Zhenpeng', ''], ['Kearnes', 'Steven', ''], ['Li', 'Li', ''], ['Zare', 'Richard N.', ''], ['Riley', 'Patrick', '']]","['Molecule Optimization', 'Reinforcement Learning', 'Learning from']"
242,1211.4840,Mohamed Farag,Mohamed Farag,"Multicore Dynamic Kernel Modules Attachment Technique for Kernel
  Performance Enhancement","13 pages, International Journal of Computer Science & Information
  Technology (IJCSIT) Vol 4, No 4, August 2012",,10.5121/ijcsit.2012.4405,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional monolithic kernels dominated kernel structures for long time
along with small sized kernels,few hardware companies and limited kernel
functionalities. Monolithic kernel structure was not applicable when the number
of hardware companies increased and kernel services consumed by different users
for many purposes. One of the biggest disadvantages of the monolithic kernels
is the inflexibility due to the need to include all the available modules in
kernel compilation causing high time consuming. Lately, new kernel structure
was introduced through multicore operating systems. Unfortunately, many
multicore operating systems such as barrelfish and FOS are experimental. This
paper aims to simulate the performance of multicore hybrid kernels through
dynamic kernel module customized attachment/ deattachment for multicore
machines. In addition, this paper proposes a new technique for loading dynamic
kernel modules based on the user needs and machine capabilities.
","[{'version': 'v1', 'created': 'Tue, 20 Nov 2012 19:38:00 GMT'}]",2012-11-21,"[['Farag', 'Mohamed', '']]","['Multicore', 'Kernel', 'Dynamic Module', 'UNIX', 'Linux']"
243,1503.08294,Giacomo Parigi,"Giacomo Parigi, Angelo Stramieri, Danilo Pau, Marco Piastra","A Multi-signal Variant for the GPU-based Parallelization of Growing
  Self-Organizing Networks",17 pages,"Informatics in Control, Automation and Robotics - 9th
  International Conference, ICINCO 2012 Rome, Italy, July 28-31, 2012 Revised
  Selected Papers. Part I, pp. 83-100",10.1007/978-3-319-03500-0_6,,cs.DC cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Among the many possible approaches for the parallelization of self-organizing
networks, and in particular of growing self-organizing networks, perhaps the
most common one is producing an optimized, parallel implementation of the
standard sequential algorithms reported in the literature. In this paper we
explore an alternative approach, based on a new algorithm variant specifically
designed to match the features of the large-scale, fine-grained parallelism of
GPUs, in which multiple input signals are processed at once. Comparative tests
have been performed, using both parallel and sequential implementations of the
new algorithm variant, in particular for a growing self-organizing network that
reconstructs surfaces from point clouds. The experimental results show that
this approach allows harnessing in a more effective way the intrinsic
parallelism that the self-organizing networks algorithms seem intuitively to
suggest, obtaining better performances even with networks of smaller size.
","[{'version': 'v1', 'created': 'Sat, 28 Mar 2015 10:51:55 GMT'}]",2015-03-31,"[['Parigi', 'Giacomo', ''], ['Stramieri', 'Angelo', ''], ['Pau', 'Danilo', ''], ['Piastra', 'Marco', '']]","['Growing self-organizing networks', 'graphics processing unit', 'parallelism', 'surface reconstruction', 'topology preservation']"
244,1405.7349,Bing Wang,"Bing Wang, Yao-hua Meng, Xiao-hong Yu","Radial basis function process neural network training based on
  generalized frechet distance and GA-SA hybrid strategy","9 pages, 4 figures,14 references","Computer Science & Engineering: An International Journal (CSEIJ),
  Vol. 3, No. 6, December 2013:1-9",10.5121/cseij.2013.3601,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For learning problem of Radial Basis Function Process Neural Network
(RBF-PNN), an optimization training method based on GA combined with SA is
proposed in this paper. Through building generalized Fr\'echet distance to
measure similarity between time-varying function samples, the learning problem
of radial basis centre functions and connection weights is converted into the
training on corresponding discrete sequence coefficients. Network training
objective function is constructed according to the least square error
criterion, and global optimization solving of network parameters is implemented
in feasible solution space by use of global optimization feature of GA and
probabilistic jumping property of SA . The experiment results illustrate that
the training algorithm improves the network training efficiency and stability.
","[{'version': 'v1', 'created': 'Thu, 9 Jan 2014 10:24:00 GMT'}]",2014-05-29,"[['Wang', 'Bing', ''], ['Meng', 'Yao-hua', ''], ['Yu', 'Xiao-hong', '']]","['Radial Basis Function Process Neural Network', 'Training Algorithm', 'Generalized Fréchet Distance', 'GA-SAHybrid Optimization']"
245,1901.10197,Hiteshwar Azad,"Hiteshwar Kumar Azad, Akshay Deepak",A new approach for query expansion using Wikipedia and WordNet,"20 pages, 17 figures. arXiv admin note: text overlap with
  arXiv:1708.00247","Information Sciences, 2019",10.1016/j.ins.2019.04.019,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Query expansion (QE) is a well-known technique used to enhance the
effectiveness of information retrieval. QE reformulates the initial query by
adding similar terms that help in retrieving more relevant results. Several
approaches have been proposed in literature producing quite favorable results,
but they are not evenly favorable for all types of queries (individual and
phrase queries). One of the main reasons for this is the use of the same kind
of data sources and weighting scheme while expanding both the individual and
the phrase query terms. As a result, the holistic relationship among the query
terms is not well captured or scored. To address this issue, we have presented
a new approach for QE using Wikipedia and WordNet as data sources.
Specifically, Wikipedia gives rich expansion terms for phrase terms, while
WordNet does the same for individual terms. We have also proposed novel
weighting schemes for expansion terms: in-link score (for terms extracted from
Wikipedia) and a tf-idf based scheme (for terms extracted from WordNet). In the
proposed Wikipedia-WordNet-based QE technique (WWQE), we weigh the expansion
terms twice: first, they are scored by the weighting scheme individually, and
then, the weighting scheme scores the selected expansion terms concerning the
entire query using correlation score. The proposed approach gains improvements
of 24% on the MAP score and 48% on the GMAP score over unexpanded queries on
the FIRE dataset. Experimental results achieve a significant improvement over
individual expansion and other related state-of-the-art approaches. We also
analyzed the effect on retrieval effectiveness of the proposed technique by
varying the number of expansion terms.
","[{'version': 'v1', 'created': 'Tue, 29 Jan 2019 10:01:22 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Jun 2019 10:15:19 GMT'}]",2019-06-21,"[['Azad', 'Hiteshwar Kumar', ''], ['Deepak', 'Akshay', '']]","['Query Expansion', 'Information Retrieval', 'WordNet', 'Wikipedia']"
246,2206.02511,Yang Li,"Yang Li, Yu Shen, Huaijun Jiang, Tianyi Bai, Wentao Zhang, Ce Zhang
  and Bin Cui",Transfer Learning based Search Space Design for Hyperparameter Tuning,9 pages and 2 extra pages for appendix,"Proceedings of the 28th ACM SIGKDD Conference on Knowledge
  Discovery and Data Mining (KDD 2022)",10.1145/3534678.3539369,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The tuning of hyperparameters becomes increasingly important as machine
learning (ML) models have been extensively applied in data mining applications.
Among various approaches, Bayesian optimization (BO) is a successful
methodology to tune hyper-parameters automatically. While traditional methods
optimize each tuning task in isolation, there has been recent interest in
speeding up BO by transferring knowledge across previous tasks. In this work,
we introduce an automatic method to design the BO search space with the aid of
tuning history from past tasks. This simple yet effective approach can be used
to endow many existing BO methods with transfer learning capabilities. In
addition, it enjoys the three advantages: universality, generality, and
safeness. The extensive experiments show that our approach considerably boosts
BO by designing a promising and compact search space instead of using the
entire space, and outperforms the state-of-the-arts on a wide range of
benchmarks, including machine learning and deep learning tuning tasks, and
neural architecture search.
","[{'version': 'v1', 'created': 'Mon, 6 Jun 2022 11:48:58 GMT'}]",2022-06-07,"[['Li', 'Yang', ''], ['Shen', 'Yu', ''], ['Jiang', 'Huaijun', ''], ['Bai', 'Tianyi', ''], ['Zhang', 'Wentao', ''], ['Zhang', 'Ce', ''], ['Cui', 'Bin', '']]","['hyperparameter optimization', 'search space design', 'bayesian optimization', 'transfer learning']"
247,1204.1672,Gabriele Fici,Gabriele Fici,A Characterization of Bispecial Sturmian Words,Accepted to MFCS 2012,"LNCS 7464, pp. 383-394, 2012",10.1007/978-3-642-32589-2_35,,cs.FL cs.CG cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A finite Sturmian word w over the alphabet {a,b} is left special (resp. right
special) if aw and bw (resp. wa and wb) are both Sturmian words. A bispecial
Sturmian word is a Sturmian word that is both left and right special. We show
as a main result that bispecial Sturmian words are exactly the maximal internal
factors of Christoffel words, that are words coding the digital approximations
of segments in the Euclidean plane. This result is an extension of the known
relation between central words and primitive Christoffel words. Our
characterization allows us to give an enumerative formula for bispecial
Sturmian words. We also investigate the minimal forbidden words for the set of
Sturmian words.
","[{'version': 'v1', 'created': 'Sat, 7 Apr 2012 18:56:05 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Apr 2012 20:08:21 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Jun 2012 11:47:23 GMT'}, {'version': 'v4', 'created': 'Mon, 18 Jun 2012 16:25:36 GMT'}]",2015-03-20,"[['Fici', 'Gabriele', '']]","['Sturmian words', 'Christoffel words', 'special factors', 'minimal forbidden words', 'enumerative formula']"
248,1903.10681,Ahlem Aboud,"Ahlem Aboud, Raja Fdhila and Adel M. Alimi","Dynamic Multi Objective Particle Swarm Optimization based on a New
  Environment Change Detection Strategy","10 pages, 5 figures, International Conference on Neural Information
  Processing",,10.1007/978-3-319-70093-9_27,,cs.NE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The dynamic of real-world optimization problems raises new challenges to the
traditional particle swarm optimization (PSO). Responding to these challenges,
the dynamic optimization has received considerable attention over the past
decade. This paper introduces a new dynamic multi-objective optimization based
particle swarm optimization (Dynamic-MOPSO).The main idea of this paper is to
solve such dynamic problem based on a new environment change detection strategy
using the advantage of the particle swarm optimization. In this way, our
approach has been developed not just to obtain the optimal solution, but also
to have a capability to detect the environment changes. Thereby, DynamicMOPSO
ensures the balance between the exploration and the exploitation in dynamic
research space. Our approach is tested through the most popularized dynamic
benchmark's functions to evaluate its performance as a good method.
","[{'version': 'v1', 'created': 'Mon, 25 Mar 2019 10:05:28 GMT'}]",2019-03-27,"[['Aboud', 'Ahlem', ''], ['Fdhila', 'Raja', ''], ['Alimi', 'Adel M.', '']]","['dynamic optimization', 'dynamic multi-objective problems', 'particle swarms optimization', 'dynamic environment', 'time varying parameters']"
249,1901.08100,Luis Sentis,"D. Kim, S. Jorgensen, J. Lee, J. Ahn, J. Luo, and L. Sentis","Dynamic Locomotion For Passive-Ankle Biped Robots And Humanoids Using
  Whole-Body Locomotion Control",,,10.1177/0278364920918014,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Whole-body control (WBC) is a generic task-oriented control method for
feedback control of loco-manipulation behaviors in humanoid robots. The
combination of WBC and model-based walking controllers has been widely utilized
in various humanoid robots. However, to date, the WBC method has not been
employed for unsupported passive-ankle dynamic locomotion. As such, in this
paper, we devise a new WBC, dubbed whole-body locomotion controller (WBLC),
that can achieve experimental dynamic walking on unsupported passive-ankle
biped robots. A key aspect of WBLC is the relaxation of contact constraints
such that the control commands produce reduced jerk when switching foot
contacts. To achieve robust dynamic locomotion, we conduct an in-depth analysis
of uncertainty for our dynamic walking algorithm called
time-to-velocity-reversal (TVR) planner. The uncertainty study is fundamental
as it allows us to improve the control algorithms and mechanical structure of
our robot to fulfill the tolerated uncertainty. In addition, we conduct
extensive experimentation for: 1) unsupported dynamic balancing (i.e. in-place
stepping) with a six degree-of-freedom (DoF) biped, Mercury; 2) unsupported
directional walking with Mercury; 3) walking over an irregular and slippery
terrain with Mercury; and 4) in-place walking with our newly designed ten-DoF
viscoelastic liquid-cooled biped, DRACO. Overall, the main contributions of
this work are on: a) achieving various modalities of unsupported dynamic
locomotion of passive-ankle bipeds using a WBLC controller and a TVR planner,
b) conducting an uncertainty analysis to improve the mechanical structure and
the controllers of Mercury, and c) devising a whole-body control strategy that
reduces movement jerk during walking.
","[{'version': 'v1', 'created': 'Wed, 23 Jan 2019 19:49:10 GMT'}]",2021-04-28,"[['Kim', 'D.', ''], ['Jorgensen', 'S.', ''], ['Lee', 'J.', ''], ['Ahn', 'J.', ''], ['Luo', 'J.', ''], ['Sentis', 'L.', '']]","['Legged Robot', 'Humanoid Robots', 'Dynamics']"
250,0901.3769,Sebastien Verel,"William Beaudoin (I3S), S\'ebastien Verel (I3S), Philippe Collard
  (I3S), Cathy Escazut (I3S)",Deceptiveness and Neutrality - the ND family of fitness landscapes,"Genetic And Evolutionary Computation Conference, Seatle :
  \'Etats-Unis d'Am\'erique (2006)",,10.1145/1143997.1144091,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When a considerable number of mutations have no effects on fitness values,
the fitness landscape is said neutral. In order to study the interplay between
neutrality, which exists in many real-world applications, and performances of
metaheuristics, it is useful to design landscapes which make it possible to
tune precisely neutral degree distribution. Even though many neutral landscape
models have already been designed, none of them are general enough to create
landscapes with specific neutral degree distributions. We propose three steps
to design such landscapes: first using an algorithm we construct a landscape
whose distribution roughly fits the target one, then we use a simulated
annealing heuristic to bring closer the two distributions and finally we affect
fitness values to each neutral network. Then using this new family of fitness
landscapes we are able to highlight the interplay between deceptiveness and
neutrality.
","[{'version': 'v1', 'created': 'Fri, 23 Jan 2009 20:15:22 GMT'}]",2009-01-26,"[['Beaudoin', 'William', '', 'I3S'], ['Verel', 'Sébastien', '', 'I3S'], ['Collard', 'Philippe', '', 'I3S'], ['Escazut', 'Cathy', '', 'I3S']]","['Fitness landscapes', 'genetic algorithms', 'search', 'benchmark']"
251,2208.03244,Manuel Rebol,"Manuel Rebol, Christian G\""utl, Krzysztof Pietroszek","Real-time Gesture Animation Generation from Speech for Virtual Human
  Interaction","CHI EA '21: Extended Abstracts of the 2021 CHI Conference on Human
  Factors in Computing Systems. arXiv admin note: text overlap with
  arXiv:2107.00712","In CHI EA 2021. ACM, New York, NY, USA, Article 197, 1-4",10.1145/3411763.3451554,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  We propose a real-time system for synthesizing gestures directly from speech.
Our data-driven approach is based on Generative Adversarial Neural Networks to
model the speech-gesture relationship. We utilize the large amount of speaker
video data available online to train our 3D gesture model. Our model generates
speaker-specific gestures by taking consecutive audio input chunks of two
seconds in length. We animate the predicted gestures on a virtual avatar. We
achieve a delay below three seconds between the time of audio input and gesture
animation. Code and videos are available at
https://github.com/mrebol/Gestures-From-Speech
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2022 15:56:34 GMT'}]",2022-08-08,"[['Rebol', 'Manuel', ''], ['Gütl', 'Christian', ''], ['Pietroszek', 'Krzysztof', '']]","['Gestures', 'Animation', 'NUI']"
252,1610.08309,Edita Pelantova,"Christiane Frougny, Marta Pavelka, Edita Pelantova, Milena Svobodova","On-line algorithms for multiplication and division in real and complex
  numeration systems","Extended version of contribution on 23rd IEEE Symposium on Computer
  Arithmetic ARITH23","Discrete Mathematics & Theoretical Computer Science, Vol. 21 no. 3
  , Discrete Algorithms (June 20, 2019) dmtcs:5569",10.23638/DMTCS-21-3-14,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A positional numeration system is given by a base and by a set of digits. The
base is a real or complex number $\beta$ such that $|\beta|>1$, and the digit
set $A$ is a finite set of digits including $0$. Thus a number can be seen as a
finite or infinite string of digits. An on-line algorithm processes the input
piece-by-piece in a serial fashion. On-line arithmetic, introduced by Trivedi
and Ercegovac, is a mode of computation where operands and results flow through
arithmetic units in a digit serial manner, starting with the most significant
digit.
  In this paper, we first formulate a generalized version of the on-line
algorithms for multiplication and division of Trivedi and Ercegovac for the
cases that $\beta$ is any real or complex number, and digits are real or
complex. We then define the so-called OL Property, and show that if $(\beta,
A)$ has the OL Property, then on-line multiplication and division are feasible
by the Trivedi-Ercegovac algorithms. For a real base $\beta$ and a digit set
$A$ of contiguous integers, the system $(\beta, A)$ has the OL Property if $\#
A > |\beta|$. For a complex base $\beta$ and symmetric digit set $A$ of
contiguous integers, the system $(\beta, A)$ has the OL Property if $\# A >
\beta\overline{\beta} + |\beta + \overline{\beta}|$. Provided that addition and
subtraction are realizable in parallel in the system $(\beta, A)$ and that
preprocessing of the denominator is possible, our on-line algorithms for
multiplication and division have linear time complexity. Three examples are
presented in detail: base $\beta=\frac{3+\sqrt{5}}{2}$ with digits
$A=\{-1,0,1\}$; base $\beta=2i$ with digits $A = \{-2,-1, 0,1,2\}$; and base
$\beta = -\frac{3}{2} + i \frac{\sqrt{3}}{2} = -1 + \omega$, where $\omega =
\exp{\frac{2i\pi}{3}}$, with digits $A = \{0, \pm 1, \pm \omega, \pm \omega^2
\}$.
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2016 13:05:12 GMT'}, {'version': 'v2', 'created': 'Sun, 18 Feb 2018 11:04:16 GMT'}, {'version': 'v3', 'created': 'Fri, 25 Jan 2019 10:07:38 GMT'}, {'version': 'v4', 'created': 'Mon, 20 May 2019 09:12:15 GMT'}, {'version': 'v5', 'created': 'Tue, 11 Jun 2019 16:16:23 GMT'}]",2019-11-20,"[['Frougny', 'Christiane', ''], ['Pavelka', 'Marta', ''], ['Pelantova', 'Edita', ''], ['Svobodova', 'Milena', '']]","['On-line algorithm', 'numeration system', 'multiplication', 'division', 'preprocessing']"
253,1611.05182,Susmita Bhaduri,"Susmita Bhaduri, Anirban Bhaduri, Dipak Ghosh",Detecting tala Computationally in Polyphonic Context - A Novel Approach,"It is a 20 page document with 8 figures, essentially portrays a
  pattern recognition novel approach to detect tala from a polyphonic song
  having table content and of North-Indian-Music-System(NIMS) genre","American Journal of Computer Science and Information
  Technology(2018)",10.21767/2349-3917.100030,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In North-Indian-Music-System(NIMS),tabla is mostly used as percussive
accompaniment for vocal-music in polyphonic-compositions. The human auditory
system uses perceptual grouping of musical-elements and easily filters the
tabla component, thereby decoding prominent rhythmic features like tala, tempo
from a polyphonic composition. For Western music, lots of work have been
reported for automated drum analysis of polyphonic composition. However,
attempts at computational analysis of tala by separating the tabla-signal from
mixed signal in NIMS have not been successful. Tabla is played with two
components - right and left. The right-hand component has frequency overlap
with voice and other instruments. So, tala analysis of polyphonic-composition,
by accurately separating the tabla-signal from the mixture is a baffling task,
therefore an area of challenge. In this work we propose a novel technique for
successfully detecting tala using left-tabla signal, producing meaningful
results because the left-tabla normally doesn't have frequency overlap with
voice and other instruments. North-Indian-rhythm follows complex cyclic
pattern, against linear approach of Western-rhythm. We have exploited this
cyclic property along with stressed and non-stressed methods of playing
tabla-strokes to extract a characteristic pattern from the left-tabla strokes,
which, after matching with the grammar of tala-system, determines the tala and
tempo of the composition. A large number of
polyphonic(vocal+tabla+other-instruments) compositions has been analyzed with
the methodology and the result clearly reveals the effectiveness of proposed
techniques.
","[{'version': 'v1', 'created': 'Wed, 16 Nov 2016 08:15:00 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Sep 2018 08:37:49 GMT'}]",2018-11-08,"[['Bhaduri', 'Susmita', ''], ['Bhaduri', 'Anirban', ''], ['Ghosh', 'Dipak', '']]","['Left-tabl¯adrum', 'T¯aladetection', 'Tempo detection', 'Polyphonic composition', 'Cyclicpattern', 'North Indian Music System']"
254,1412.5010,Jens Ma{\ss}berg,Jens Ma{\ss}berg,"The rectilinear Steiner tree problem with given topology and length
  restrictions",14 pages,"Computing and Combinatorics, Lecture Notes in Computer Science,
  Volume 9198, 2015, pp 445-456",10.1007/978-3-319-21398-9_35,,cs.DS cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of embedding the Steiner points of a Steiner tree
with given topology into the rectilinear plane. Thereby, the length of the path
between a distinguished terminal and each other terminal must not exceed given
length restrictions. We want to minimize the total length of the tree.
  The problem can be formulated as a linear program and therefore it is
solvable in polynomial time. In this paper we analyze the structure of feasible
embeddings and give a combinatorial polynomial time algorithm for the problem.
Our algorithm combines a dynamic programming approach and binary search and
relies on the total unimodularity of a matrix appearing in a sub-problem.
","[{'version': 'v1', 'created': 'Tue, 16 Dec 2014 14:21:39 GMT'}]",2015-08-19,"[['Maßberg', 'Jens', '']]","['Steiner trees with given topology', 'rectilinear Steiner trees', 'dynamic programming', 'totally unimodular', 'shallow light Steiner trees']"
255,1609.00543,Richard Oentaryo,"Richard Jayadi Oentaryo, Arinto Murdopo, Philips Kokoh Prasetyo,
  Ee-Peng Lim",On Profiling Bots in Social Media,,,10.1007/978-3-319-47880-7_6,,cs.SI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The popularity of social media platforms such as Twitter has led to the
proliferation of automated bots, creating both opportunities and challenges in
information dissemination, user engagements, and quality of services. Past
works on profiling bots had been focused largely on malicious bots, with the
assumption that these bots should be removed. In this work, however, we find
many bots that are benign, and propose a new, broader categorization of bots
based on their behaviors. This includes broadcast, consumption, and spam bots.
To facilitate comprehensive analyses of bots and how they compare to human
accounts, we develop a systematic profiling framework that includes a rich set
of features and classifier bank. We conduct extensive experiments to evaluate
the performances of different classifiers under varying time windows, identify
the key features of bots, and infer about bots in a larger Twitter population.
Our analysis encompasses more than 159K bot and human (non-bot) accounts in
Twitter. The results provide interesting insights on the behavioral traits of
both benign and malicious bots.
","[{'version': 'v1', 'created': 'Fri, 2 Sep 2016 10:47:28 GMT'}]",2018-05-14,"[['Oentaryo', 'Richard Jayadi', ''], ['Murdopo', 'Arinto', ''], ['Prasetyo', 'Philips Kokoh', ''], ['Lim', 'Ee-Peng', '']]","['Bot profiling', 'classification', 'feature extraction', 'social media']"
256,1106.3967,Emilio Ferrara,Emilio Ferrara and Robert Baumgartner,Intelligent Self-Repairable Web Wrappers,"12 pages, 4 figures; Proceedings of the 12th International Conference
  of the Italian Association for Artificial Intelligence, 2011","Lecture Notes in Computer Science, 6934:274-285, 2011",10.1007/978-3-642-23954-0_26,,cs.AI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The amount of information available on the Web grows at an incredible high
rate. Systems and procedures devised to extract these data from Web sources
already exist, and different approaches and techniques have been investigated
during the last years. On the one hand, reliable solutions should provide
robust algorithms of Web data mining which could automatically face possible
malfunctioning or failures. On the other, in literature there is a lack of
solutions about the maintenance of these systems. Procedures that extract Web
data may be strictly interconnected with the structure of the data source
itself; thus, malfunctioning or acquisition of corrupted data could be caused,
for example, by structural modifications of data sources brought by their
owners. Nowadays, verification of data integrity and maintenance are mostly
manually managed, in order to ensure that these systems work correctly and
reliably. In this paper we propose a novel approach to create procedures able
to extract data from Web sources -- the so called Web wrappers -- which can
face possible malfunctioning caused by modifications of the structure of the
data source, and can automatically repair themselves.
","[{'version': 'v1', 'created': 'Mon, 20 Jun 2011 17:02:40 GMT'}]",2012-02-13,"[['Ferrara', 'Emilio', ''], ['Baumgartner', 'Robert', '']]","['Web data extraction', 'wrappers', 'automatic adaptation']"
257,0909.0237,Vassilis Kostakos,Vassilis Kostakos,"Is the crowd's wisdom biased? A quantitative asessment of three online
  communities","17 pages, 6 tagles","Computational Science and Engineering, p. 251-255, 2009",10.1109/CSE.2009.491,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a study of user voting on three websites: Imdb, Amazon
and BookCrossings. It reports on an expert evaluation of the voting mechanisms
of each website and a quantitative data analysis of users' aggregate voting
behavior. The results suggest that voting follows different patterns across the
websites, with higher barrier to vote introducing a more of one-off voters and
attracting mostly experts. The results also show that that one-off voters tend
to vote on popular items, while experts mostly vote for obscure, low-rated
items. The study concludes with design suggestions to address the ""wisdom of
the crowd"" bias.
","[{'version': 'v1', 'created': 'Tue, 1 Sep 2009 18:31:17 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Sep 2009 13:46:03 GMT'}, {'version': 'v3', 'created': 'Wed, 16 Sep 2009 13:40:23 GMT'}, {'version': 'v4', 'created': 'Tue, 6 Oct 2009 08:43:33 GMT'}, {'version': 'v5', 'created': 'Sun, 8 Nov 2009 01:54:35 GMT'}]",2013-06-06,"[['Kostakos', 'Vassilis', '']]","['Voting', 'rating', 'quantitative analysis', 'expert evaluation']"
258,1609.07721,Diederik Aerts,"Diederik Aerts, Jonito Aerts Argu\""elles, Lester Beltran, Lyneth
  Beltran, Massimiliano Sassoli de Bianchi, Sandro Sozzo and Tomas Veloz",Testing Quantum Models of Conjunction Fallacy on the World Wide Web,12 pages,"International Journal of Theoretical Physics, 56, pp. 3744-3756
  (2017)",10.1007/s10773-017-3288-8,,cs.AI quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The 'conjunction fallacy' has been extensively debated by scholars in
cognitive science and, in recent times, the discussion has been enriched by the
proposal of modeling the fallacy using the quantum formalism. Two major quantum
approaches have been put forward: the first assumes that respondents use a
two-step sequential reasoning and that the fallacy results from the presence of
'question order effects'; the second assumes that respondents evaluate the
cognitive situation as a whole and that the fallacy results from the 'emergence
of new meanings', as an 'effect of overextension' in the conceptual
conjunction. Thus, the question arises as to determine whether and to what
extent conjunction fallacies would result from 'order effects' or, instead,
from 'emergence effects'. To help clarify this situation, we propose to use the
World Wide Web as an 'information space' that can be interrogated both in a
sequential and non-sequential way, to test these two quantum approaches. We
find that 'emergence effects', and not 'order effects', should be considered
the main cognitive mechanism producing the observed conjunction fallacies.
","[{'version': 'v1', 'created': 'Sun, 25 Sep 2016 09:58:14 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Jun 2017 23:30:10 GMT'}]",2019-02-12,"[['Aerts', 'Diederik', ''], ['Arguëlles', 'Jonito Aerts', ''], ['Beltran', 'Lester', ''], ['Beltran', 'Lyneth', ''], ['de Bianchi', 'Massimiliano Sassoli', ''], ['Sozzo', 'Sandro', ''], ['Veloz', 'Tomas', '']]","['Quantum cognition', 'conjunction fallacy', 'emergent reasoning', 'meaning bond', 'World Wide Web']"
259,1307.3439,Y Jayanta Singh,"Y. Jayanta Singh, Shalu Gupta",Speedy Object Detection based on Shape,arXiv admin note: text overlap with arXiv:1210.7038 by other authors,"The International Journal of Multimedia & Its Applications (IJMA)
  Vol.5, No.3, June 2013",10.5121/ijma.2013.5302,,cs.CV,http://creativecommons.org/licenses/by/3.0/,"  This study is a part of design of an audio system for in-house object
detection system for visually impaired, low vision personnel by birth or by an
accident or due to old age. The input of the system will be scene and output as
audio. Alert facility is provided based on severity levels of the objects
(snake, broke glass etc) and also during difficulties. The study proposed
techniques to provide speedy detection of objects based on shapes and its
scale. Features are extraction to have minimum spaces using dynamic scaling.
From a scene, clusters of objects are formed based on the scale and shape.
Searching is performed among the clusters initially based on the shape, scale,
mean cluster value and index of object(s). The minimum operation to detect the
possible shape of the object is performed. In case the object does not have a
likely matching shape, scale etc, then the several operations required for an
object detection will not perform; instead, it will declared as a new object.
In such way, this study finds a speedy way of detecting objects.
","[{'version': 'v1', 'created': 'Fri, 12 Jul 2013 12:37:06 GMT'}]",2013-07-15,"[['Singh', 'Y. Jayanta', ''], ['Gupta', 'Shalu', '']]","['Speedy object detection', 'shape', 'scale and dynamic']"
260,1902.10820,Nicolai Kraus,Gun Pinyo and Nicolai Kraus,From Cubes to Twisted Cubes via Graph Morphisms in Type Theory,"v4: 18 pages, postproceedings of TYPES'2019",,10.4230/LIPIcs.TYPES.2019.5,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cube categories are used to encode higher-dimensional categorical structures.
They have recently gained significant attention in the community of homotopy
type theory and univalent foundations, where types carry the structure of such
higher groupoids. Bezem, Coquand, and Huber have presented a constructive model
of univalence using a specific cube category, which we call the BCH category.
  The higher categories encoded with the BCH category have the property that
all morphisms are invertible, mirroring the fact that equality is symmetric.
This might not always be desirable: the field of directed type theory considers
a notion of equality that is not necessarily invertible.
  This motivates us to suggest a category of twisted cubes which avoids
built-in invertibility. Our strategy is to first develop several alternative
(but equivalent) presentations of the BCH category using morphisms between
suitably defined graphs. Starting from there, a minor modification allows us to
define our category of twisted cubes. We prove several first results about this
category, and our work suggests that twisted cubes combine properties of cubes
with properties of globes and simplices (tetrahedra).
","[{'version': 'v1', 'created': 'Wed, 27 Feb 2019 22:53:38 GMT'}, {'version': 'v2', 'created': 'Sun, 3 Mar 2019 23:16:43 GMT'}, {'version': 'v3', 'created': 'Thu, 4 Jul 2019 22:14:51 GMT'}, {'version': 'v4', 'created': 'Sun, 19 Jul 2020 19:20:21 GMT'}]",2020-07-21,"[['Pinyo', 'Gun', ''], ['Kraus', 'Nicolai', '']]","['homotopy type theory', 'cubical sets', 'directed equality', 'graph morphisms']"
261,2010.04840,Jiahao Chen,Leo de Castro and Jiahao Chen and Antigoni Polychroniadou,CryptoCredit: Securely Training Fair Models,8 pages,"Proceedings of the 1st ACM International Conference on AI in
  Finance (ICAIF '20), October 15-16, 2020, New York, NY, USA",10.1145/3383455.3422567,,cs.LG cs.AI cs.CR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When developing models for regulated decision making, sensitive features like
age, race and gender cannot be used and must be obscured from model developers
to prevent bias. However, the remaining features still need to be tested for
correlation with sensitive features, which can only be done with the knowledge
of those features. We resolve this dilemma using a fully homomorphic encryption
scheme, allowing model developers to train linear regression and logistic
regression models and test them for possible bias without ever revealing the
sensitive features in the clear. We demonstrate how it can be applied to
leave-one-out regression testing, and show using the adult income data set that
our method is practical to run.
","[{'version': 'v1', 'created': 'Fri, 9 Oct 2020 23:05:37 GMT'}]",2020-10-13,"[['de Castro', 'Leo', ''], ['Chen', 'Jiahao', ''], ['Polychroniadou', 'Antigoni', '']]","['fully homomorphic encryption', 'logistic regression', 'Wald test']"
262,1307.5102,Stefano Gonella,"Stefano Gonella, Jarvis D. Haupt","Automated Defect Localization via Low Rank Plus Outlier Modeling of
  Propagating Wavefield Data","16 pages, 9 figures, Submitted to the IEEE Transactions on
  Ultrasonics, Ferroelectrics and Frequency Control on August 30th 2012","IEEE Transactions on Ultrasonics, Ferroelectrics and Frequency
  Control, v. 60, n.12, pp. 2553 - 2565",10.1109/TUFFC.2013.2854,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work proposes an agnostic inference strategy for material diagnostics,
conceived within the context of laser-based non-destructive evaluation methods,
which extract information about structural anomalies from the analysis of
acoustic wavefields measured on the structure's surface by means of a scanning
laser interferometer. The proposed approach couples spatiotemporal windowing
with low rank plus outlier modeling, to identify a priori unknown deviations in
the propagating wavefields caused by material inhomogeneities or defects, using
virtually no knowledge of the structural and material properties of the medium.
This characteristic makes the approach particularly suitable for diagnostics
scenarios where the mechanical and material models are complex, unknown, or
unreliable. We demonstrate our approach in a simulated environment using
benchmark point and line defect localization problems based on propagating
flexural waves in a thin plate.
","[{'version': 'v1', 'created': 'Fri, 19 Jul 2013 00:06:59 GMT'}]",2014-05-13,"[['Gonella', 'Stefano', ''], ['Haupt', 'Jarvis D.', '']]","['Anomaly detection', 'Low rank plus outlier models', 'Saliency', 'Non-destructive evaluation']"
263,2012.12798,Stasys Jukna,Stasys Jukna,Coin Flipping in Dynamic Programming is Almost Useless,"25 pages, 1 table","ACM Trans. on Computation Theory (2020) 26 pages, Article 17",10.1145/3397476,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider probabilistic circuits working over the real numbers, and using
arbitrary semialgebraic functions of bounded description complexity as gates.
In particular, such circuits can use all arithmetic operations +, -, x, /,
optimization operations min and max, conditional branching (if-then-else), and
many more. We show that probabilistic circuits using any of these operations as
gates can be simulated by deterministic circuits with only about a quadratical
blowup in size. A not much larger blow up in circuit size is also shown when
derandomizing approximating circuits. The algorithmic consequence, motivating
the title, is that randomness cannot substantially speed up dynamic programming
algorithms.
","[{'version': 'v1', 'created': 'Wed, 23 Dec 2020 16:58:49 GMT'}]",2020-12-24,"[['Jukna', 'Stasys', '']]","['derandomization', 'dynamic programming', 'semialgebraic functions', 'sign patterns of polynomials']"
264,1207.6033,Emilio Ferrara,"Giovanni Quattrone, Licia Capra, Pasquale De Meo, Emilio Ferrara,
  Domenico Ursino","Effective Retrieval of Resources in Folksonomies Using a New Tag
  Similarity Measure","6 pages, 2 figures, CIKM 2011: 20th ACM Conference on Information and
  Knowledge Management","Proceedings of the 20th ACM international conference on
  Information and knowledge management, pp. 545-550, 2011",10.1145/2063576.2063657,,cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social (or folksonomic) tagging has become a very popular way to describe
content within Web 2.0 websites. However, as tags are informally defined,
continually changing, and ungoverned, it has often been criticised for
lowering, rather than increasing, the efficiency of searching. To address this
issue, a variety of approaches have been proposed that recommend users what
tags to use, both when labeling and when looking for resources. These
techniques work well in dense folksonomies, but they fail to do so when tag
usage exhibits a power law distribution, as it often happens in real-life
folksonomies. To tackle this issue, we propose an approach that induces the
creation of a dense folksonomy, in a fully automatic and transparent way: when
users label resources, an innovative tag similarity metric is deployed, so to
enrich the chosen tag set with related tags already present in the folksonomy.
The proposed metric, which represents the core of our approach, is based on the
mutual reinforcement principle. Our experimental evaluation proves that the
accuracy and coverage of searches guaranteed by our metric are higher than
those achieved by applying classical metrics.
","[{'version': 'v1', 'created': 'Wed, 25 Jul 2012 15:46:58 GMT'}]",2012-07-26,"[['Quattrone', 'Giovanni', ''], ['Capra', 'Licia', ''], ['De Meo', 'Pasquale', ''], ['Ferrara', 'Emilio', ''], ['Ursino', 'Domenico', '']]","['Folksonomy', 'tag similarity', 'tag recommendations']"
265,1809.00211,Mateusz Trokielewicz,Mateusz Trokielewicz and Adam Czajka and Piotr Maciejewicz,Cataract influence on iris recognition performance,,"Photonics Applications in Astronomy, Communications, Industry, and
  High-Energy Physics Experiments 2014, 929020 (2014)",10.1117/12.2076040,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the experimental study revealing weaker performance of
the automatic iris recognition methods for cataract-affected eyes when compared
to healthy eyes. There is little research on the topic, mostly incorporating
scarce databases that are often deficient in images representing more than one
illness. We built our own database, acquiring 1288 eye images of 37 patients of
the Medical University of Warsaw. Those images represent several common ocular
diseases, such as cataract, along with less ordinary conditions, such as iris
pattern alterations derived from illness or eye trauma. Images were captured in
near-infrared light (used in biometrics) and for selected cases also in visible
light (used in ophthalmological diagnosis). Since cataract is a disorder that
is most populated by samples in the database, in this paper we focus solely on
this illness. To assess the extent of the performance deterioration we use
three iris recognition methodologies (commercial and academic solutions) to
calculate genuine match scores for healthy eyes and those influenced by
cataract. Results show a significant degradation in iris recognition
reliability manifesting by worsening the genuine scores in all three matchers
used in this study (12% of genuine score increase for an academic matcher, up
to 175% of genuine score increase obtained for an example commercial matcher).
This increase in genuine scores affected the final false non-match rate in two
matchers. To our best knowledge this is the only study of such kind that
employs more than one iris matcher, and analyzes the iris image segmentation as
a potential source of decreased reliability.
","[{'version': 'v1', 'created': 'Sat, 1 Sep 2018 15:40:47 GMT'}]",2018-09-05,"[['Trokielewicz', 'Mateusz', ''], ['Czajka', 'Adam', ''], ['Maciejewicz', 'Piotr', '']]","['biometrics', 'iris recognition', 'ophthalmic disease', 'cataract']"
266,1609.07288,Suthee Ruangwises,"Suthee Ruangwises, Toshiya Itoh",Random Popular Matchings with Incomplete Preference Lists,A shortened version of this paper has appeared at WALCOM 2018,"Journal of Graph Algorithms and Applications, 23(5): 815-835
  (2019)",10.7155/jgaa.00513,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a set $A$ of $n$ people and a set $B$ of $m \geq n$ items, with each
person having a list that ranks his/her preferred items in order of preference,
we want to match every person with a unique item. A matching $M$ is called
popular if for any other matching $M'$, the number of people who prefer $M$ to
$M'$ is not less than the number of those who prefer $M'$ to $M$. For given $n$
and $m$, consider the probability of existence of a popular matching when each
person's preference list is independently and uniformly generated at random.
Previously, Mahdian showed that when people's preference lists are strict
(containing no ties) and complete (containing all items in $B$), if $\alpha =
m/n > \alpha_*$, where $\alpha_* \approx 1.42$ is the root of equation $x^2 =
e^{1/x}$, then a popular matching exists with probability $1-o(1)$; and if
$\alpha < \alpha_*$, then a popular matching exists with probability $o(1)$,
i.e. a phase transition occurs at $\alpha_*$. In this paper, we investigate
phase transitions in the case that people's preference lists are strict but not
complete. We show that in the case where every person has a preference list
with length of a constant $k \geq 4$, a similar phase transition occurs at
$\alpha_k$, where $\alpha_k \geq 1$ is the root of equation $x e^{-1/2x} =
1-(1-e^{-1/x})^{k-1}$.
","[{'version': 'v1', 'created': 'Fri, 23 Sep 2016 09:38:24 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Apr 2017 14:53:52 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Oct 2017 12:07:37 GMT'}, {'version': 'v4', 'created': 'Fri, 15 Dec 2017 15:49:07 GMT'}, {'version': 'v5', 'created': 'Thu, 5 Jul 2018 02:14:47 GMT'}, {'version': 'v6', 'created': 'Wed, 26 Sep 2018 15:23:08 GMT'}, {'version': 'v7', 'created': 'Wed, 23 Oct 2019 07:22:51 GMT'}, {'version': 'v8', 'created': 'Sat, 26 Oct 2019 09:47:37 GMT'}]",2019-10-29,"[['Ruangwises', 'Suthee', ''], ['Itoh', 'Toshiya', '']]","['popular matching', 'incomplete preference lists', 'phase transition', 'complex component']"
267,1912.05879,Johan Medrano,"Johan Medrano, Fuchun Joseph Lin","Enabling Machine Learning Across Heterogeneous Sensor Networks with
  Graph Autoencoders",,"Chatzigiannakis I., De Ruyter B., Mavrommati I. (eds) Ambient
  Intelligence. AmI 2019. Lecture Notes in Computer Science, vol 11912.
  Springer, Cham",10.1007/978-3-030-34255-5_11,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine Learning (ML) has been applied to enable many life-assisting
appli-cations, such as abnormality detection and emdergency request for the
soli-tary elderly. However, in most cases machine learning algorithms depend on
the layout of the target Internet of Things (IoT) sensor network. Hence, to
deploy an application across Heterogeneous Sensor Networks (HSNs), i.e. sensor
networks with different sensors type or layouts, it is required to repeat the
process of data collection and ML algorithm training. In this paper, we
introduce a novel framework leveraging deep learning for graphs to enable using
the same activity recognition system across HSNs deployed in differ-ent smart
homes. Using our framework, we were able to transfer activity classifiers
trained with activity labels on a source HSN to a target HSN, reaching about
75% of the baseline accuracy on the target HSN without us-ing target activity
labels. Moreover, our model can quickly adapt to unseen sensor layouts, which
makes it highly suitable for the gradual deployment of real-world ML-based
applications. In addition, we show that our framework is resilient to
suboptimal graph representations of HSNs.
","[{'version': 'v1', 'created': 'Thu, 12 Dec 2019 11:14:12 GMT'}]",2019-12-13,"[['Medrano', 'Johan', ''], ['Lin', 'Fuchun Joseph', '']]","['Graph Autoencoders', 'Heterogeneous Sensor Networks', 'Smart Homes']"
268,1711.00698,Benoit Girard,"Guillaume Viejo (ISIR), Beno\^it Girard (ISIR), Emmanuel Procyk, Mehdi
  Khamassi (ISIR)","Adaptive coordination of working-memory and reinforcement learning in
  non-human primates performing a trial-and-error problem solving task","Behavioural Brain Research, Elsevier, 2017",,10.1016/j.bbr.2017.09.030,,cs.AI q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accumulating evidence suggest that human behavior in trial-and-error learning
tasks based on decisions between discrete actions may involve a combination of
reinforcement learning (RL) and working-memory (WM). While the understanding of
brain activity at stake in this type of tasks often involve the comparison with
non-human primate neurophysiological results, it is not clear whether monkeys
use similar combined RL and WM processes to solve these tasks. Here we analyzed
the behavior of five monkeys with computational models combining RL and WM. Our
model-based analysis approach enables to not only fit trial-by-trial choices
but also transient slowdowns in reaction times, indicative of WM use. We found
that the behavior of the five monkeys was better explained in terms of a
combination of RL and WM despite inter-individual differences. The same
coordination dynamics we used in a previous study in humans best explained the
behavior of some monkeys while the behavior of others showed the opposite
pattern, revealing a possible different dynamics of WM process. We further
analyzed different variants of the tested models to open a discussion on how
the long pretraining in these tasks may have favored particular coordination
dynamics between RL and WM. This points towards either inter-species
differences or protocol differences which could be further tested in humans.
","[{'version': 'v1', 'created': 'Thu, 2 Nov 2017 11:53:54 GMT'}]",2019-04-30,"[['Viejo', 'Guillaume', '', 'ISIR'], ['Girard', 'Benoît', '', 'ISIR'], ['Procyk', 'Emmanuel', '', 'ISIR'], ['Khamassi', 'Mehdi', '', 'ISIR']]","['Reinforcement Learning', 'Decision-making', 'Working-Memory', 'Bayesian Inference', 'Computational Modeling', 'Model Comparison']"
269,2105.06291,Christian Bartolo Burlò,"Christian Batrolo Burl\`o, Adrian Francalanza, Alceste Scalas","On the Monitorability of Session Types, in Theory and Practice (Extended
  Version)",,,10.4230/LIPIcs.ECOOP.2021.22,,cs.PL,http://creativecommons.org/licenses/by/4.0/,"  In concurrent and distributed systems, software components are expected to
communicate according to predetermined protocols and APIs - and if a component
does not observe them, the system's reliability is compromised. Furthermore,
isolating and fixing protocol/API errors can be very difficult. Many methods
have been proposed to check the correctness of communicating systems, ranging
from compile-time to run-time verification; among such methods, session types
have been applied for both static type-checking, and run-time monitoring. This
work takes a fresh look at the run-time verification of communicating systems
using session types, in theory and in practice. On the theoretical side, we
develop a novel formal model of session-monitored processes; with it, we
formulate and prove new results on the monitorability of session types,
connecting their run-time and static verification - in terms of soundness
(i.e., whether monitors only flag ill-typed processes) and completeness (i.e.,
whether all ill-typed processes can be flagged by a monitor). On the practical
side, we show that our monitoring theory is indeed realisable: building upon
our formal model, we develop a Scala toolkit for the automatic generation of
session monitors. Our executable monitors can be used to instrument black-box
processes written in any programming language; we assess the viability of our
approach with a series of benchmarks.
","[{'version': 'v1', 'created': 'Thu, 13 May 2021 13:36:42 GMT'}, {'version': 'v2', 'created': 'Sat, 22 May 2021 09:10:16 GMT'}]",2021-05-25,"[['Burlò', 'Christian Batrolo', ''], ['Francalanza', 'Adrian', ''], ['Scalas', 'Alceste', '']]","['Session types', 'monitorability', 'monitor correctness', 'Scala']"
270,1606.04488,Ashkan Kalantari,"Ashkan Kalantari, Mojtaba Soltanalian, Sina Maleki, Symeon
  Chatzinotas, and Bj\""orn Ottersten","Directional Modulation via Symbol-Level Precoding: A Way to Enhance
  Security","This manuscript is submitted to IEEE Journal of Selected Topics in
  Signal Processing",,10.1109/JSTSP.2016.2600521,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless communication provides a wide coverage at the cost of exposing
information to unintended users. As an information-theoretic paradigm, secrecy
rate derives bounds for secure transmission when the channel to the
eavesdropper is known. However, such bounds are shown to be restrictive in
practice and may require exploitation of specialized coding schemes. In this
paper, we employ the concept of directional modulation and follow a signal
processing approach to enhance the security of multi-user MIMO communication
systems when a multi-antenna eavesdropper is present. Enhancing the security is
accomplished by increasing the symbol error rate at the eavesdropper. Unlike
the information-theoretic secrecy rate paradigm, we assume that the legitimate
transmitter is not aware of its channel to the eavesdropper, which is a more
realistic assumption. We examine the applicability of MIMO receiving algorithms
at the eavesdropper. Using the channel knowledge and the intended symbols for
the users, we design security enhancing symbol-level precoders for different
transmitter and eavesdropper antenna configurations. We transform each design
problem to a linearly constrained quadratic program and propose two solutions,
namely the iterative algorithm and one based on non-negative least squares, at
each scenario for a computationally-efficient modulation. Simulation results
verify the analysis and show that the designed precoders outperform the
benchmark scheme in terms of both power efficiency and security enhancement.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2016 18:21:19 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Aug 2016 08:53:14 GMT'}]",2016-11-17,"[['Kalantari', 'Ashkan', ''], ['Soltanalian', 'Mojtaba', ''], ['Maleki', 'Sina', ''], ['Chatzinotas', 'Symeon', ''], ['Ottersten', 'Björn', '']]","['Array processing', 'directional modulation', 'M -PSKmodulation', 'physical layer security', 'symbol-level precoding']"
271,1711.01589,Saeed Ghodsi,"Saeed Ghodsi, Hoda Mohammadzade, Erfan Korki","Simultaneous Joint and Object Trajectory Templates for Human Activity
  Recognition from 3-D Data",,,10.1016/j.jvcir.2018.08.001,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The availability of low-cost range sensors and the development of relatively
robust algorithms for the extraction of skeleton joint locations have inspired
many researchers to develop human activity recognition methods using the 3-D
data. In this paper, an effective method for the recognition of human
activities from the normalized joint trajectories is proposed. We represent the
actions as multidimensional signals and introduce a novel method for generating
action templates by averaging the samples in a ""dynamic time"" sense. Then in
order to deal with the variations in the speed and style of performing actions,
we warp the samples to the action templates by an efficient algorithm and
employ wavelet filters to extract meaningful spatiotemporal features. The
proposed method is also capable of modeling the human-object interactions, by
performing the template generation and temporal warping procedure via the joint
and object trajectories simultaneously. The experimental evaluation on several
challenging datasets demonstrates the effectiveness of our method compared to
the state-of-the-arts.
","[{'version': 'v1', 'created': 'Sun, 5 Nov 2017 13:52:55 GMT'}]",2018-08-14,"[['Ghodsi', 'Saeed', ''], ['Mohammadzade', 'Hoda', ''], ['Korki', 'Erfan', '']]","['Human Activity Recognition', 'RGB-D Sensors', 'Trajectory-basedRepresentation', 'Action Template', 'Dynamic Time Warping (DTW)', 'HumanObject Interaction']"
272,2207.12964,Guangchen Shi,"Guangchen Shi, Yirui Wu, Jun Liu, Shaohua Wan, Wenhai Wang, Tong Lu","Incremental Few-Shot Semantic Segmentation via Embedding Adaptive-Update
  and Hyper-class Representation",,"Proceedings of the 30th ACM International Conference on Multimedia
  2022",10.1145/3503161.3548218,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Incremental few-shot semantic segmentation (IFSS) targets at incrementally
expanding model's capacity to segment new class of images supervised by only a
few samples. However, features learned on old classes could significantly
drift, causing catastrophic forgetting. Moreover, few samples for pixel-level
segmentation on new classes lead to notorious overfitting issues in each
learning session. In this paper, we explicitly represent class-based knowledge
for semantic segmentation as a category embedding and a hyper-class embedding,
where the former describes exclusive semantical properties, and the latter
expresses hyper-class knowledge as class-shared semantic properties. Aiming to
solve IFSS problems, we present EHNet, i.e., Embedding adaptive-update and
Hyper-class representation Network from two aspects. First, we propose an
embedding adaptive-update strategy to avoid feature drift, which maintains old
knowledge by hyper-class representation, and adaptively update category
embeddings with a class-attention scheme to involve new classes learned in
individual sessions. Second, to resist overfitting issues caused by few
training samples, a hyper-class embedding is learned by clustering all category
embeddings for initialization and aligned with category embedding of the new
class for enhancement, where learned knowledge assists to learn new knowledge,
thus alleviating performance dependence on training data scale. Significantly,
these two designs provide representation capability for classes with sufficient
semantics and limited biases, enabling to perform segmentation tasks requiring
high semantic dependence. Experiments on PASCAL-5i and COCO datasets show that
EHNet achieves new state-of-the-art performance with remarkable advantages.
","[{'version': 'v1', 'created': 'Tue, 26 Jul 2022 15:20:07 GMT'}]",2022-10-13,"[['Shi', 'Guangchen', ''], ['Wu', 'Yirui', ''], ['Liu', 'Jun', ''], ['Wan', 'Shaohua', ''], ['Wang', 'Wenhai', ''], ['Lu', 'Tong', '']]","['incremental learning', 'few-shot learning', 'semantic segmentation', 'adaptive update', 'hyper-class representation']"
273,1805.09563,Michele Scalas,"Michele Scalas, Davide Maiorca, Francesco Mercaldo, Corrado Aaron
  Visaggio, Fabio Martinelli and Giorgio Giacinto","On the Effectiveness of System API-Related Information for Android
  Ransomware Detection",,Computers & Security 86C (2019) pp. 168-182,10.1016/j.cose.2019.06.004,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ransomware constitutes a significant threat to the Android operating system.
It can either lock or encrypt the target devices, and victims are forced to pay
ransoms to restore their data. Hence, the prompt detection of such attacks has
a priority in comparison to other malicious threats. Previous works on Android
malware detection mainly focused on Machine Learning-oriented approaches that
were tailored to identifying malware families, without a clear focus on
ransomware. More specifically, such approaches resorted to complex information
types such as permissions, user-implemented API calls, and native calls.
However, this led to significant drawbacks concerning complexity, resilience
against obfuscation, and explainability. To overcome these issues, in this
paper, we propose and discuss learning-based detection strategies that rely on
System API information. These techniques leverage the fact that ransomware
attacks heavily resort to System API to perform their actions, and allow
distinguishing between generic malware, ransomware and goodware.
  We tested three different ways of employing System API information, i.e.,
through packages, classes, and methods, and we compared their performances to
other, more complex state-of-the-art approaches. The attained results showed
that systems based on System API could detect ransomware and generic malware
with very good accuracy, comparable to systems that employed more complex
information. Moreover, the proposed systems could accurately detect novel
samples in the wild and showed resilience against static obfuscation attempts.
Finally, to guarantee early on-device detection, we developed and released on
the Android platform a complete ransomware and malware detector (R-PackDroid)
that employed one of the methodologies proposed in this paper.
","[{'version': 'v1', 'created': 'Thu, 24 May 2018 09:18:08 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Jun 2018 10:29:25 GMT'}, {'version': 'v3', 'created': 'Thu, 17 Jan 2019 10:58:04 GMT'}, {'version': 'v4', 'created': 'Wed, 26 Jun 2019 09:46:16 GMT'}]",2019-07-03,"[['Scalas', 'Michele', ''], ['Maiorca', 'Davide', ''], ['Mercaldo', 'Francesco', ''], ['Visaggio', 'Corrado Aaron', ''], ['Martinelli', 'Fabio', ''], ['Giacinto', 'Giorgio', '']]","['Malware', 'Android', 'Ransomware', 'Machine Learning', 'Security']"
274,1212.1449,Carlos Ernesto Laciana,"Carlos E. Laciana, Santiago L. Rovere and Guillermo P. Podest\'a","Exploring associations between micro-level models of innovation
  diffusion and emerging macro-level adoption patterns","20 pages, 4 figures and a table of supplementary data. Accepted for
  publication",,10.1016/j.physa.2012.12.023,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A micro-level agent-based model of innovation diffusion was developed that
explicitly combines (a) an individual's perception of the advantages or
relative utility derived from adoption, and (b) social influence from members
of the individual's social network. The micro-model was used to simulate
macro-level diffusion patterns emerging from different configurations of
micro-model parameters. Micro-level simulation results matched very closely the
adoption patterns predicted by the widely-used Bass macro-level model (Bass,
1969). For a portion of the domain, results from micro-simulations were
consistent with aggregate-level adoption patterns reported in the literature.
Induced Bass macro-level parameters and responded to changes in
micro-parameters: (1) increased with the number of innovators and with the rate
at which innovators are introduced; (2) increased with the probability of
rewiring in small-world networks, as the characteristic path length decreases;
and (3) an increase in the overall perceived utility of an innovation caused a
corresponding increase in induced and values. Understanding micro to macro
linkages can inform the design and assessment of marketing interventions on
micro-variables - or processes related to them - to enhance adoption of future
products or technologies.
","[{'version': 'v1', 'created': 'Thu, 6 Dec 2012 19:45:50 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Dec 2012 11:48:37 GMT'}, {'version': 'v3', 'created': 'Wed, 2 Jan 2013 16:22:28 GMT'}]",2015-06-12,"[['Laciana', 'Carlos E.', ''], ['Rovere', 'Santiago L.', ''], ['Podestá', 'Guillermo P.', '']]","['innovation diffusion', 'Bass model', 'agent-based models', 'technology adoption']"
275,0901.3987,Mohammad Ravanbakhsh,"Mohammad Ravanbakhsh, Angela I. Barbero Diez, and Oyvind Ytrehus","Improved Delay Estimates for a Queueing Model for Random Linear Coding
  for Unicast","5 pages, 3 figures, accepted at the 2009 IEEE International Symposium
  on Information Theory",,10.1109/ISIT.2009.5205892,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consider a lossy communication channel for unicast with zero-delay feedback.
For this communication scenario, a simple retransmission scheme is optimum with
respect to delay. An alternative approach is to use random linear coding in
automatic repeat-request (ARQ) mode. We extend the work of Shrader and
Ephremides, by deriving an expression for the delay of random linear coding
over field of infinite size. Simulation results for various field sizes are
also provided.
","[{'version': 'v1', 'created': 'Mon, 26 Jan 2009 13:32:16 GMT'}, {'version': 'v2', 'created': 'Tue, 26 May 2009 11:04:19 GMT'}]",2016-11-18,"[['Ravanbakhsh', 'Mohammad', ''], ['Diez', 'Angela I. Barbero', ''], ['Ytrehus', 'Oyvind', '']]","['Random linear coding', 'Feedback channel', 'Erasure channel', 'ARQ', 'Bulk service', 'Delay']"
276,1805.04586,Peter Kling,"Petra Berenbrink, Robert Els\""asser, Tom Friedetzky, Dominik Kaaser,
  Peter Kling, Tomasz Radzik",Time-space Trade-offs in Population Protocols for the Majority Problem,,,10.1007/s00446-020-00385-0,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Population protocols are a model for distributed computing that is focused on
simplicity and robustness. A system of $n$ identical agents (finite state
machines) performs a global task like electing a unique leader or determining
the majority opinion when each agent has one of two opinions. Agents
communicate in pairwise interactions with randomly assigned communication
partners. Quality is measured in two ways: the number of interactions to
complete the task and the number of states per agent. We present protocols for
the majority problem that allow for a trade-off between these two measures.
Compared to the only other trade-off result [Alistarh, Gelashvili, Vojnovic;
PODC'15], we improve the number of interactions by almost a linear factor.
Furthermore, our protocols can be made uniform (working correctly without any
information on the population size $n$), yielding the first uniform majority
protocols that stabilize in a subquadratic number of interactions.
","[{'version': 'v1', 'created': 'Fri, 11 May 2018 20:43:15 GMT'}, {'version': 'v2', 'created': 'Sat, 23 Jun 2018 06:10:21 GMT'}, {'version': 'v3', 'created': 'Fri, 17 Jul 2020 15:43:24 GMT'}]",2020-08-24,"[['Berenbrink', 'Petra', ''], ['Elsässer', 'Robert', ''], ['Friedetzky', 'Tom', ''], ['Kaaser', 'Dominik', ''], ['Kling', 'Peter', ''], ['Radzik', 'Tomasz', '']]","['distributed computing', 'majority', 'population protocols', 'stochastic processes']"
277,1208.6335,Aman Chadha Mr.,"Aman Chadha, Sushmit Mallik and Ravdeep Johar","Comparative Study and Optimization of Feature-Extraction Techniques for
  Content based Image Retrieval","8 pages, 16 figures, 11 tables","International Journal of Computer Applications 52(20):35-42, 2012",10.5120/8320-1959,"Volume 52, Number 20, 2012",cs.CV cs.AI cs.IR cs.LG cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of a Content-Based Image Retrieval (CBIR) system, also known as Query
by Image Content (QBIC), is to help users to retrieve relevant images based on
their contents. CBIR technologies provide a method to find images in large
databases by using unique descriptors from a trained image. The image
descriptors include texture, color, intensity and shape of the object inside an
image. Several feature-extraction techniques viz., Average RGB, Color Moments,
Co-occurrence, Local Color Histogram, Global Color Histogram and Geometric
Moment have been critically compared in this paper. However, individually these
techniques result in poor performance. So, combinations of these techniques
have also been evaluated and results for the most efficient combination of
techniques have been presented and optimized for each class of image query. We
also propose an improvement in image retrieval performance by introducing the
idea of Query modification through image cropping. It enables the user to
identify a region of interest and modify the initial query to refine and
personalize the image retrieval results.
","[{'version': 'v1', 'created': 'Thu, 30 Aug 2012 23:50:06 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Jul 2020 01:34:05 GMT'}]",2020-07-10,"[['Chadha', 'Aman', ''], ['Mallik', 'Sushmit', ''], ['Johar', 'Ravdeep', '']]","['Feature Extraction', 'Image Similarities', 'Feature Matching', 'Image Retrieval']"
278,1610.03263,"Patrick Bl\""obaum","Patrick Bl\""obaum, Takashi Washio, Shohei Shimizu",Error Asymmetry in Causal and Anticausal Regression,,"Behaviormetrika, 2017, 10.1007/s41237-017-0022-z",10.1007/s41237-017-0022-z,,cs.AI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is generally difficult to make any statements about the expected
prediction error in an univariate setting without further knowledge about how
the data were generated. Recent work showed that knowledge about the real
underlying causal structure of a data generation process has implications for
various machine learning settings. Assuming an additive noise and an
independence between data generating mechanism and its input, we draw a novel
connection between the intrinsic causal relationship of two variables and the
expected prediction error. We formulate the theorem that the expected error of
the true data generating function as prediction model is generally smaller when
the effect is predicted from its cause and, on the contrary, greater when the
cause is predicted from its effect. The theorem implies an asymmetry in the
error depending on the prediction direction. This is further corroborated with
empirical evaluations in artificial and real-world data sets.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2016 10:15:15 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Apr 2017 12:25:44 GMT'}]",2017-04-18,"[['Blöbaum', 'Patrick', ''], ['Washio', 'Takashi', ''], ['Shimizu', 'Shohei', '']]","['causality', 'prediction error', 'error asymmetry', 'causal and anticausalprediction', 'inverse prediction', 'calibration']"
279,1805.08960,Yong Man Ro,"Seong Tae Kim, Hakmin Lee, Hak Gu Kim, Yong Man Ro",ICADx: Interpretable computer aided diagnosis of breast masses,"This paper was presented at SPIE Medical Imaging 2018, Houston, TX,
  USA",,10.1117/12.2293570,"Proc. SPIE 10575, Medical Imaging 2018: Computer-Aided Diagnosis,
  1057522 (27 February 2018)",cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, a novel computer aided diagnosis (CADx) framework is devised
to investigate interpretability for classifying breast masses. Recently, a deep
learning technology has been successfully applied to medical image analysis
including CADx. Existing deep learning based CADx approaches, however, have a
limitation in explaining the diagnostic decision. In real clinical practice,
clinical decisions could be made with reasonable explanation. So current deep
learning approaches in CADx are limited in real world deployment. In this
paper, we investigate interpretability in CADx with the proposed interpretable
CADx (ICADx) framework. The proposed framework is devised with a generative
adversarial network, which consists of interpretable diagnosis network and
synthetic lesion generative network to learn the relationship between
malignancy and a standardized description (BI-RADS). The lesion generative
network and the interpretable diagnosis network compete in an adversarial
learning so that the two networks are improved. The effectiveness of the
proposed method was validated on public mammogram database. Experimental
results showed that the proposed ICADx framework could provide the
interpretability of mass as well as mass classification. It was mainly
attributed to the fact that the proposed method was effectively trained to find
the relationship between malignancy and interpretations via the adversarial
learning. These results imply that the proposed ICADx framework could be a
promising approach to develop the CADx system.
","[{'version': 'v1', 'created': 'Wed, 23 May 2018 04:52:06 GMT'}]",2018-05-24,"[['Kim', 'Seong Tae', ''], ['Lee', 'Hakmin', ''], ['Kim', 'Hak Gu', ''], ['Ro', 'Yong Man', '']]","['Computer-aided diagnosis', 'Interpretable AI', 'Deep learning', 'Explainable deep learning']"
280,1912.11701,Abhishek Singh,"Abhishek Kumar Singh, Manish Gupta, Vasudeva Varma",Hybrid MemNet for Extractive Summarization,"Accepted in CIKM '17 Proceedings of the 2017 ACM on Conference on
  Information and Knowledge Management","In Proceedings of the 2017 ACM on Conference on Information and
  Knowledge Management (CIKM '17). ACM, New York, NY, USA, pages 2303-2306",10.1145/3132847.3133127,,cs.CL cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Extractive text summarization has been an extensive research problem in the
field of natural language understanding. While the conventional approaches rely
mostly on manually compiled features to generate the summary, few attempts have
been made in developing data-driven systems for extractive summarization. To
this end, we present a fully data-driven end-to-end deep network which we call
as Hybrid MemNet for single document summarization task. The network learns the
continuous unified representation of a document before generating its summary.
It jointly captures local and global sentential information along with the
notion of summary worthy sentences. Experimental results on two different
corpora confirm that our model shows significant performance gains compared
with the state-of-the-art baselines.
","[{'version': 'v1', 'created': 'Wed, 25 Dec 2019 17:48:09 GMT'}]",2019-12-30,"[['Singh', 'Abhishek Kumar', ''], ['Gupta', 'Manish', ''], ['Varma', 'Vasudeva', '']]","['Summarization', 'Deep Learning', 'Natural Language']"
281,1208.6391,Jalil Boukhobza,"Pierre Olivier (Lab-STICC), Jalil Boukhobza (Lab-STICC), Eric Senn
  (Lab-STICC)",On Benchmarking Embedded Linux Flash File Systems,"Embed With Linux, Lorient : France (2012)","ACM SIGBED Review 9(2) 43-47 9, 2 (2012) 43-47",,,cs.OS cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to its attractive characteristics in terms of performance, weight and
power consumption, NAND flash memory became the main non volatile memory (NVM)
in embedded systems. Those NVMs also present some specific
characteristics/constraints: good but asymmetric I/O performance, limited
lifetime, write/erase granularity asymmetry, etc. Those peculiarities are
either managed in hardware for flash disks (SSDs, SD cards, USB sticks, etc.)
or in software for raw embedded flash chips. When managed in software, flash
algorithms and structures are implemented in a specific flash file system
(FFS). In this paper, we present a performance study of the most widely used
FFSs in embedded Linux: JFFS2, UBIFS,and YAFFS. We show some very particular
behaviors and large performance disparities for tested FFS operations such as
mounting, copying, and searching file trees, compression, etc.
","[{'version': 'v1', 'created': 'Fri, 31 Aug 2012 06:32:38 GMT'}]",2013-12-17,"[['Olivier', 'Pierre', '', 'Lab-STICC'], ['Boukhobza', 'Jalil', '', 'Lab-STICC'], ['Senn', 'Eric', '', 'Lab-STICC']]","['NAND flash memory', 'Embedded storage', 'Flash File Systems', 'I/O Performance', 'Benchmarking']"
282,1304.6810,Guy Van den Broeck,"Daan Fierens, Guy Van den Broeck, Joris Renkens, Dimitar Shterionov,
  Bernd Gutmann, Ingo Thon, Gerda Janssens, Luc De Raedt","Inference and learning in probabilistic logic programs using weighted
  Boolean formulas",To appear in Theory and Practice of Logic Programming (TPLP),Theory and Practice of Logic Programming 15 (2015) 358-401,10.1017/S1471068414000076,,cs.AI cs.LG cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Probabilistic logic programs are logic programs in which some of the facts
are annotated with probabilities. This paper investigates how classical
inference and learning tasks known from the graphical model community can be
tackled for probabilistic logic programs. Several such tasks such as computing
the marginals given evidence and learning from (partial) interpretations have
not really been addressed for probabilistic logic programs before.
  The first contribution of this paper is a suite of efficient algorithms for
various inference tasks. It is based on a conversion of the program and the
queries and evidence to a weighted Boolean formula. This allows us to reduce
the inference tasks to well-studied tasks such as weighted model counting,
which can be solved using state-of-the-art methods known from the graphical
model and knowledge compilation literature. The second contribution is an
algorithm for parameter estimation in the learning from interpretations
setting. The algorithm employs Expectation Maximization, and is built on top of
the developed inference algorithms.
  The proposed approach is experimentally evaluated. The results show that the
inference algorithms improve upon the state-of-the-art in probabilistic logic
programming and that it is indeed possible to learn the parameters of a
probabilistic logic program from interpretations.
","[{'version': 'v1', 'created': 'Thu, 25 Apr 2013 06:10:55 GMT'}]",2020-02-19,"[['Fierens', 'Daan', ''], ['Broeck', 'Guy Van den', ''], ['Renkens', 'Joris', ''], ['Shterionov', 'Dimitar', ''], ['Gutmann', 'Bernd', ''], ['Thon', 'Ingo', ''], ['Janssens', 'Gerda', ''], ['De Raedt', 'Luc', '']]","['Probabilistic logic programming', 'Probabilistic inference', 'Parameter learning']"
283,1811.09160,Michael David,"Michael David (CRAN), A. Aubry (CRAN), W. Derigent (CRAN)",Towards energy efficient buildings: how ICTs can convert advances?,,"IFAC INCOM 2018, Jun 2018, Bergamo, Italy. 51 (11), pp.758 - 763,
  2018",10.1016/j.ifacol.2018.08.410,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work is a positioning research paper for energy efficient building based
on ICT solutions. Through the literature about the solutions for energy control
of buildings during operational phase, a 3-layers model is proposed to
integrate these solutions: first level consists in communication technologies,
second level is about data modelling and third level is related to
decision-making tools. For each level, key research topics and remaining
problems are identified in order to achieve a concrete step forward. 1. CONTEXT
AND PROBLEMATICS Through studies on ICT solutions for energy control of
buildings, a 3-layers model is proposed to integrate these solutions and
position a new way for energy efficiency. The building sector is the largest
user of energy and CO 2 emitter in the EU, estimated at approximately 40% of
the total consumption (Sharples et al., 1999). According to the International
Panel on Climate Change (European Union, 2010), 30% of energy used in buildings
could be reduced with net economic benefits by 2030. Such a reduction, however,
is meaningless unless ""sustainability"" is considered. Because of these factors,
healthy, sustainable, and energy efficient buildings have become active topics
in international research; there is an urgent need for a new kind of
high-technology driven and integrative research that should lead to the massive
development of smart buildings and, in the medium term, smart cities. From a
building lifecycle perspective, most of the energy (~80%) is consumed during
the operational stage of the building (European Union, 2010) (Bilsen et al.,
2013). Reducing building energy consumption may be addressed by the physical
modifications which can be operated on a building like upgrading windows,
heating systems or modifying thermic characteristics by insulating. Another
possible path to reduce the energy consumption of a building is to use
Information and Communication Technologies (ICT). According to the
International Panel on Climate Change, a reduction of energy even greater than
the 30% can be targeted by 2030 by considering ICT solutions. In support of
this claim, some specialists believe that ICT-based solutions have the
potential to enable 50-80% greenhouse gas reduction globally. In this respect,
ICT innovation opens prospects for the development of a new range of new
services highly available, flexible, safe, easy to integrate, and user friendly
(Bilsen et al., 2013). This, in turn, should foster a sophisticated, reliable
and fast communication infrastructure for the connection of various distributed
elements (sensors, generators, substations...) that enables to exchange
real-time data, information and knowledge needed to improve efficiency (e.g.,
to monitor and control energy consumption), reliability (e.g., to facilitate
maintenance operations), flexibility (e.g., to integrate new rules to meet new
consumer expectations), and investment returns, but also to induce a shift in
consumer behaviour.
","[{'version': 'v1', 'created': 'Thu, 22 Nov 2018 13:07:24 GMT'}]",2018-11-26,"[['David', 'Michael', '', 'CRAN'], ['Aubry', 'A.', '', 'CRAN'], ['Derigent', 'W.', '', 'CRAN']]","['Energy Control', 'Data Models', 'Networks', 'Information Technology', 'Decentralized Control']"
284,1502.04033,Tobias Reitmaier,Tobias Reitmaier and Bernhard Sick,"The Responsibility Weighted Mahalanobis Kernel for Semi-Supervised
  Training of Support Vector Machines for Classification",,,10.1016/j.ins.2015.06.027,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Kernel functions in support vector machines (SVM) are needed to assess the
similarity of input samples in order to classify these samples, for instance.
Besides standard kernels such as Gaussian (i.e., radial basis function, RBF) or
polynomial kernels, there are also specific kernels tailored to consider
structure in the data for similarity assessment. In this article, we will
capture structure in data by means of probabilistic mixture density models, for
example Gaussian mixtures in the case of real-valued input spaces. From the
distance measures that are inherently contained in these models, e.g.,
Mahalanobis distances in the case of Gaussian mixtures, we derive a new kernel,
the responsibility weighted Mahalanobis (RWM) kernel. Basically, this kernel
emphasizes the influence of model components from which any two samples that
are compared are assumed to originate (that is, the ""responsible"" model
components). We will see that this kernel outperforms the RBF kernel and other
kernels capturing structure in data (such as the LAP kernel in Laplacian SVM)
in many applications where partially labeled data are available, i.e., for
semi-supervised training of SVM. Other key advantages are that the RWM kernel
can easily be used with standard SVM implementations and training algorithms
such as sequential minimal optimization, and heuristics known for the
parametrization of RBF kernels in a C-SVM can easily be transferred to this new
kernel. Properties of the RWM kernel are demonstrated with 20 benchmark data
sets and an increasing percentage of labeled samples in the training data.
","[{'version': 'v1', 'created': 'Fri, 13 Feb 2015 15:48:00 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Feb 2015 13:02:05 GMT'}]",2015-07-03,"[['Reitmaier', 'Tobias', ''], ['Sick', 'Bernhard', '']]","['support vector machine', 'pattern classification', 'kernel function', 'responsibility weighted Mahalanobis kernel', 'semi-supervised learning']"
285,1803.02307,Youngjun Cho,"Youngjun Cho, Andrea Bianchi, Nicolai Marquardt and Nadia
  Bianchi-Berthouze","RealPen: Providing Realism in Handwriting Tasks on Touch Surfaces using
  Auditory-Tactile Feedback","Proceedings of the 29th Annual Symposium on User Interface Software
  and Technology (UIST '16)",,10.1145/2984511.2984550,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present RealPen, an augmented stylus for capacitive tablet screens that
recreates the physical sensation of writing on paper with a pencil, ball-point
pen or marker pen. The aim is to create a more engaging experience when writing
on touch surfaces, such as screens of tablet computers. This is achieved by
re-generating the friction-induced oscillation and sound of a real writing tool
in contact with paper. To generate realistic tactile feedback, our algorithm
analyses the frequency spectrum of the friction oscillation generated when
writing with traditional tools, extracts principal frequencies, and uses the
actuator's frequency response profile for an adjustment weighting function. We
enhance the realism by providing the sound feedback aligned with the writing
pressure and speed. Furthermore, we investigated the effects of superposition
and fluctuation of several frequencies on human tactile perception, evaluated
the performance of RealPen, and characterized users' perception and preference
of each feedback type.
","[{'version': 'v1', 'created': 'Tue, 6 Mar 2018 17:17:19 GMT'}]",2018-03-07,"[['Cho', 'Youngjun', ''], ['Bianchi', 'Andrea', ''], ['Marquardt', 'Nicolai', ''], ['Bianchi-Berthouze', 'Nadia', '']]","['H.5.2 [information interfaces and presentation (e.g', 'HCI)] User Interfaces – Tactile feedback', 'Auditory feedback']"
286,1612.08811,Ahmed Mateen Mr.,"Ahmed Mateen, Muhammad Azeem, Mohammad Shafiq",AZ Model for Software Development,4 pages,"International Journal of Computer Applications Foundation of
  Computer Science (FCS), NY, USA Volume 151 - Number 6 Year of Publication:
  2016",10.5120/ijca2016911701,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Know a days Computer system become essential and it is most commonly used in
every field of life. The computer saves time and use to solve complex and
extensive problem quickly in an efficient way. For this purpose software
programs are develop to facilitate the works for administrator, offices, banks
etc. so Quality is the most important factor as it mostly defines CUSTOMER
SATISFACTION which directly related to success of the project so there are many
approaches (methodologies) have been developed for this purpose occasionally.
The main study of this paper is to propose a new methodology for the
development of the software which focuses on the quality improvement of all
kind of product. This study will also discuss the features and limitation of
the traditional methodologies like waterfall iterative spiral RUP and Agile and
show how the new innovative methodology is better than previous one.
","[{'version': 'v1', 'created': 'Wed, 28 Dec 2016 06:47:56 GMT'}]",2016-12-30,"[['Mateen', 'Ahmed', ''], ['Azeem', 'Muhammad', ''], ['Shafiq', 'Mohammad', '']]","['Software process model', 'high quality product', 'innovative methodology', 'Traditional Development Models', 'propose Model']"
287,1601.07795,Setareh Maghsudi,Setareh Maghsudi and Ekram Hossain,"Distributed User Association in Energy Harvesting Small Cell Networks: A
  Probabilistic Model","27 Pages, Single-Column",,10.1109/TWC.2017.2647946,,cs.IT cs.LG math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a distributed downlink user association problem in a small cell
network, where small cells obtain the required energy for providing wireless
services to users through ambient energy harvesting. Since energy harvesting is
opportunistic in nature, the amount of harvested energy is a random variable,
without any a priori known characteristics. Moreover, since users arrive in the
network randomly and require different wireless services, the energy
consumption is a random variable as well. In this paper, we propose a
probabilistic framework to mathematically model and analyze the random behavior
of energy harvesting and energy consumption in dense small cell networks.
Furthermore, as acquiring (even statistical) channel and network knowledge is
very costly in a distributed dense network, we develop a bandit-theoretical
formulation for distributed user association when no information is available
at users
","[{'version': 'v1', 'created': 'Wed, 27 Jan 2016 17:14:44 GMT'}]",2017-01-09,"[['Maghsudi', 'Setareh', ''], ['Hossain', 'Ekram', '']]","['Small cell networks', 'energy harvesting', 'distributed user association', 'uncertainty', 'bandit']"
288,1512.07766,Fabrice Rouillier,"P.-V Koseleff (OURAGAN, IMJ-PRG, UPMC), D Pecker (IMJ-PRG, UPMC),
  Fabrice Rouillier (OURAGAN, IMJ-PRG, UPMC), C Tran (UPMC, IMJ-PRG)",Computing Chebyshev knot diagrams,,,10.1016/j.jsc.2017.04.001,hal-01232181,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Chebyshev curve $\mathcal{C}(a,b,c,\phi)$ has a parametrization of the
form$ x(t)=T\_a(t)$; \ $y(t)=T\_b(t)$; $z(t)= T\_c(t + \phi)$, where $a,b,c$are
integers, $T\_n(t)$ is the Chebyshev polynomialof degree $n$ and $\phi \in
\mathbb{R}$. When $\mathcal{C}(a,b,c,\phi)$ is nonsingular,it defines a
polynomial knot. We determine all possible knot diagrams when $\phi$ varies.
Let $a,b,c$ be integers, $a$ is odd, $(a,b)=1$, we show that one can list all
possible knots $\mathcal{C}(a,b,c,\phi)$ in$\tilde{\mathcal{O}}(n^2)$ bit
operations, with $n=abc$.
","[{'version': 'v1', 'created': 'Thu, 24 Dec 2015 09:23:25 GMT'}, {'version': 'v2', 'created': 'Tue, 16 May 2017 07:36:49 GMT'}]",2017-05-17,"[['Koseleff', 'P. -V', '', 'OURAGAN, IMJ-PRG, UPMC'], ['Pecker', 'D', '', 'IMJ-PRG, UPMC'], ['Rouillier', 'Fabrice', '', 'OURAGAN, IMJ-PRG, UPMC'], ['Tran', 'C', '', 'UPMC, IMJ-PRG']]","['Zero dimensional systems', 'Chebyshev curves', 'Lissajous knots', 'polynomial knots', 'factorization of Chebyshev polynomials', 'minimal polynomial', 'Chebyshev forms']"
289,1802.08690,Chenhao Tan,Chenhao Tan and Hao Peng and Noah A. Smith,"""You are no Jack Kennedy"": On Media Selection of Highlights from
  Presidential Debates","10 pages, 5 figures, to appear in Proceedings of WWW 2018, data and
  more at https://chenhaot.com/papers/debate-quotes.html",,10.1145/3178876.3186142,,cs.SI cs.CL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Political speeches and debates play an important role in shaping the images
of politicians, and the public often relies on media outlets to select bits of
political communication from a large pool of utterances. It is an important
research question to understand what factors impact this selection process.
  To quantitatively explore the selection process, we build a three- decade
dataset of presidential debate transcripts and post-debate coverage. We first
examine the effect of wording and propose a binary classification framework
that controls for both the speaker and the debate situation. We find that
crowdworkers can only achieve an accuracy of 60% in this task, indicating that
media choices are not entirely obvious. Our classifiers outperform crowdworkers
on average, mainly in primary debates. We also compare important factors from
crowdworkers' free-form explanations with those from data-driven methods and
find interesting differences. Few crowdworkers mentioned that ""context
matters"", whereas our data show that well-quoted sentences are more distinct
from the previous utterance by the same speaker than less-quoted sentences.
Finally, we examine the aggregate effect of media preferences towards different
wordings to understand the extent of fragmentation among media outlets. By
analyzing a bipartite graph built from quoting behavior in our data, we observe
a decreasing trend in bipartisan coverage.
","[{'version': 'v1', 'created': 'Fri, 23 Feb 2018 19:00:01 GMT'}]",2018-02-27,"[['Tan', 'Chenhao', ''], ['Peng', 'Hao', ''], ['Smith', 'Noah A.', '']]","['media bias', 'presidential debates', 'quotations', 'wording', 'conversations']"
290,1808.08709,Damien Chablat,"Philippe Wenger (LS2N, ReV), D. Chablat (LS2N, ReV)","Kinetostatic analysis and solution classification of a class of planar
  tensegrity mechanisms",,"Robotica, Cambridge University Press, 2018, pp.1 - 11",10.1017/S026357471800070X,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tensegrity mechanisms are composed of rigid and tensile parts that are in
equilibrium. They are interesting alternative designs for some applications,
such as modelling musculo-skeleton systems. Tensegrity mechanisms are more
difficult to analyze than classical mechanisms as the static equilibrium
conditions that must be satisfied generally result in complex equations. A
class of planar one-degree-of-freedom tensegrity mechanisms with three linear
springs is analyzed in detail for the sake of systematic solution
classifications. The kinetostatic equations are derived and solved under
several loading and geometric conditions. It is shown that these mechanisms
exhibit up to six equilibrium configurations, of which one or two are stable,
depending on the geometric and loading conditions. Discriminant varieties and
cylindrical algebraic decomposition combined with Groebner base elimination are
used to classify solutions as a function of the geometric, loading and actuator
input parameters.
","[{'version': 'v1', 'created': 'Mon, 27 Aug 2018 07:16:22 GMT'}]",2018-08-28,"[['Wenger', 'Philippe', '', 'LS2N, ReV'], ['Chablat', 'D.', '', 'LS2N, ReV']]","['Tensegrity mechanism', 'kinetostatic model', 'geometric design', 'algebraic computation']"
291,1312.0910,Derek Groen,"Derek Groen, Steven Rieder and Simon Portegies Zwart","MPWide: a light-weight library for efficient message passing over wide
  area networks","accepted by the Journal Of Open Research Software, 13 pages, 4
  figures, 1 table","Journal of Open Research Software 1(1):e9, 2013",10.5334/jors.ah,,cs.DC cs.NI,http://creativecommons.org/licenses/by/3.0/,"  We present MPWide, a light weight communication library which allows
efficient message passing over a distributed network. MPWide has been designed
to connect application running on distributed (super)computing resources, and
to maximize the communication performance on wide area networks for those
without administrative privileges. It can be used to provide message-passing
between application, move files, and make very fast connections in
client-server environments. MPWide has already been applied to enable
distributed cosmological simulations across up to four supercomputers on two
continents, and to couple two different bloodflow simulations to form a
multiscale simulation.
","[{'version': 'v1', 'created': 'Tue, 3 Dec 2013 19:17:57 GMT'}]",2014-01-06,"[['Groen', 'Derek', ''], ['Rieder', 'Steven', ''], ['Zwart', 'Simon Portegies', '']]","['communication library', 'distributed computing', 'message passing', 'TCP', 'modelcoupling', 'communication performance', 'data transfer', 'co-allocation']"
292,1302.2718,Monika Agarwal,Monika Agarwal,Text Steganographic Approaches: A Comparison,"16 pages, 6 figures, 5 tables","Monika Agarwal, ""Text Steganographic Approaches: A Comparison"",
  International Journal of Network Security & Its Applications (IJNSA), Vol.5,
  No.1, January 2013, pp.91-106",10.5121/ijnsa.2013.5107,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents three novel approaches of text steganography. The first
approach uses the theme of missing letter puzzle where each character of
message is hidden by missing one or more letters in a word of cover. The
average Jaro score was found to be 0.95 indicating closer similarity between
cover and stego file. The second approach hides a message in a wordlist where
ASCII value of embedded character determines length and starting letter of a
word. The third approach conceals a message, without degrading cover, by using
start and end letter of words of the cover. For enhancing the security of
secret message, the message is scrambled using one-time pad scheme before being
concealed and cipher text is then concealed in cover. We also present an
empirical comparison of the proposed approaches with some of the popular text
steganographic approaches and show that our approaches outperform the existing
approaches.
","[{'version': 'v1', 'created': 'Tue, 12 Feb 2013 07:03:02 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Feb 2013 04:37:25 GMT'}]",2013-02-15,"[['Agarwal', 'Monika', '']]","['Information Hiding', 'Steganography', 'Cryptography', 'Text Steganography']"
293,1003.1291,Alejandro Lorca,"Alejandro Lorca, Eduardo Huedo, Ignacio M. Llorente","The Grid[Way] Job Template Manager, a tool for parameter sweeping","26 pages, 1 figure,",,10.1016/j.cpc.2010.12.041,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parameter sweeping is a widely used algorithmic technique in computational
science. It is specially suited for high-throughput computing since the jobs
evaluating the parameter space are loosely coupled or independent.
  A tool that integrates the modeling of a parameter study with the control of
jobs in a distributed architecture is presented. The main task is to facilitate
the creation and deletion of job templates, which are the elements describing
the jobs to be run. Extra functionality relies upon the GridWay Metascheduler,
acting as the middleware layer for job submission and control. It supports
interesting features like multi-dimensional sweeping space, wildcarding of
parameters, functional evaluation of ranges, value-skipping and job template
automatic indexation.
  The use of this tool increases the reliability of the parameter sweep study
thanks to the systematic bookkeping of job templates and respective job
statuses. Furthermore, it simplifies the porting of the target application to
the grid reducing the required amount of time and effort.
","[{'version': 'v1', 'created': 'Fri, 5 Mar 2010 15:34:09 GMT'}]",2015-05-18,"[['Lorca', 'Alejandro', ''], ['Huedo', 'Eduardo', ''], ['Llorente', 'Ignacio M.', '']]","['e-science', 'parameter sweep', 'grid computing', 'middleware', 'high-throughput computing']"
294,1708.06822,Mehmet Turan,"Mehmet Turan, Yasin Almalioglu, Helder Araujo, Ender Konukoglu, Metin
  Sitti","Deep EndoVO: A Recurrent Convolutional Neural Network (RCNN) based
  Visual Odometry Approach for Endoscopic Capsule Robots",,,10.1016/j.neucom.2017.10.014,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ingestible wireless capsule endoscopy is an emerging minimally invasive
diagnostic technology for inspection of the GI tract and diagnosis of a wide
range of diseases and pathologies. Medical device companies and many research
groups have recently made substantial progresses in converting passive capsule
endoscopes to active capsule robots, enabling more accurate, precise, and
intuitive detection of the location and size of the diseased areas. Since a
reliable real time pose estimation functionality is crucial for actively
controlled endoscopic capsule robots, in this study, we propose a monocular
visual odometry (VO) method for endoscopic capsule robot operations. Our method
lies on the application of the deep Recurrent Convolutional Neural Networks
(RCNNs) for the visual odometry task, where Convolutional Neural Networks
(CNNs) and Recurrent Neural Networks (RNNs) are used for the feature extraction
and inference of dynamics across the frames, respectively. Detailed analyses
and evaluations made on a real pig stomach dataset proves that our system
achieves high translational and rotational accuracies for different types of
endoscopic capsule robot trajectories.
","[{'version': 'v1', 'created': 'Tue, 22 Aug 2017 21:13:18 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Sep 2017 13:47:53 GMT'}]",2017-11-21,"[['Turan', 'Mehmet', ''], ['Almalioglu', 'Yasin', ''], ['Araujo', 'Helder', ''], ['Konukoglu', 'Ender', ''], ['Sitti', 'Metin', '']]","['Endoscopic Capsule Robot', 'Visual Odometry', 'sequential deep']"
295,1509.06854,Bo Jiang,"Bo Jiang, Peng Chen, W.K. Chan, and Xinchao Zhang","To What Extent Is Stress Testing of Android TV Applications Automated in
  Industrial Environments?",17 pages,,10.1109/TR.2015.2481601,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An Android-based smart Television (TV) must reliably run its applications in
an embedded program environment under diverse hardware resource conditions.
Owing to the diverse hardware components used to build numerous TV models, TV
simulators are usually not high enough in fidelity to simulate various TV
models, and thus are only regarded as unreliable alternatives when stress
testing such applications. Therefore, even though stress testing on real TV
sets is tedious, it is the de facto approach to ensure the reliability of these
applications in the industry. In this paper, we study to what extent stress
testing of smart TV applications can be fully automated in the industrial
environments. To the best of our knowledge, no previous work has addressed this
important question. We summarize the find-ings collected from 10 industrial
test engineers to have tested 20 such TV applications in a real production
environment. Our study shows that the industry required test automation
supports on high-level GUI object controls and status checking, setup of
resource conditions and the interplay between the two. With such supports, 87%
of the industrial test specifications of one TV model can be fully automated
and 71.4% of them were found to be fully reusable to test a subsequent TV model
with major up-grades of hardware, operating system and application. It
repre-sents a significant improvement with margins of 28% and 38%,
respectively, compared to stress testing without such supports.
","[{'version': 'v1', 'created': 'Wed, 23 Sep 2015 06:26:16 GMT'}]",2015-09-24,"[['Jiang', 'Bo', ''], ['Chen', 'Peng', ''], ['Chan', 'W. K.', ''], ['Zhang', 'Xinchao', '']]","['Stress Testing', 'Android', 'TV', 'Reliability', 'Automation', 'Test Case Creation', 'Software Reuse']"
296,1701.08025,Magnus Andersson,"Hanqing Zhang, Tim Stangner, Krister Wiklund, Alvaro Rodriguez, Magnus
  Andersson","UmUTracker: A versatile MATLAB program for automated particle tracking
  of 2D light microscopy or 3D digital holography data",Manuscript including supplementary materials,,10.1016/j.cpc.2017.05.029,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a versatile and fast MATLAB program (UmUTracker) that
automatically detects and tracks particles by analyzing video sequences
acquired by either light microscopy or digital in-line holographic microscopy.
Our program detects the 2D lateral positions of particles with an algorithm
based on the isosceles triangle transform, and reconstructs their 3D axial
positions by a fast implementation of the Rayleigh-Sommerfeld model using a
radial intensity profile. To validate the accuracy and performance of our
program, we first track the 2D position of polystyrene particles using bright
field and digital holographic microscopy. Second, we determine the 3D particle
position by analyzing synthetic and experimentally acquired holograms. Finally,
to highlight the full program features, we profile the microfluidic flow in a
100 micrometer high flow chamber. This result agrees with computational fluid
dynamic simulations. On a regular desktop computer UmUTracker can detect,
analyze, and track multiple particles at 5 frames per second for a template
size of 201 x 201 in a 1024 x 1024 image. To enhance usability and to make it
easy to implement new functions we used object-oriented programming. UmUTracker
is suitable for studies related to: particle dynamics, cell localization,
colloids and microfluidic flow measurement.
","[{'version': 'v1', 'created': 'Fri, 27 Jan 2017 12:20:45 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Apr 2017 08:53:23 GMT'}]",2017-09-13,"[['Zhang', 'Hanqing', ''], ['Stangner', 'Tim', ''], ['Wiklund', 'Krister', ''], ['Rodriguez', 'Alvaro', ''], ['Andersson', 'Magnus', '']]","['image processing', 'digital holographic microscopy', 'particle tracking velocimetry', 'microfluidics']"
297,1307.4279,Yuansheng Liu,Yuansheng Liu,"Cryptanalyzing a RGB image encryption algorithm based on DNA encoding
  and chaos map",,,10.1016/j.optlastec.2014.01.015,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, a RGB image encryption algorithm based on DNA encoding and chaos
map has been proposed. It was reported that the encryption algorithm can be
broken with four pairs of chosen plain-images and the corresponding
cipher-images. This paper re-evaluates the security of the encryption
algorithm, and finds that the encryption algorithm can be broken efficiently
with only one known plain-image. The effectiveness of the proposed
known-plaintext attack is supported by both rigorous theoretical analysis and
experimental results. In addition, two other security defects are also
reported.
","[{'version': 'v1', 'created': 'Tue, 16 Jul 2013 14:02:07 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Jan 2014 01:52:36 GMT'}]",2014-03-05,"[['Liu', 'Yuansheng', '']]","['image encryption', 'cryptanalysis', 'known-plaintext attack']"
298,1709.03915,"Wilhelmiina H\""am\""al\""ainen","Wilhelmiina H\""am\""al\""ainen and Geoffrey I. Webb","Specious rules: an efficient and effective unifying method for removing
  misleading and uninformative patterns in association rule mining","Note: This is a corrected version of the paper published in SDM'17.
  In the equation on page 4, the range of the sum has been corrected","Proceedings of SIAM International Conference on Data Mining, pp.
  309-317, SIAM 2017",10.1137/1.9781611974973.35,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present theoretical analysis and a suite of tests and procedures for
addressing a broad class of redundant and misleading association rules we call
\emph{specious rules}. Specious dependencies, also known as \emph{spurious},
\emph{apparent}, or \emph{illusory associations}, refer to a well-known
phenomenon where marginal dependencies are merely products of interactions with
other variables and disappear when conditioned on those variables.
  The most extreme example is Yule-Simpson's paradox where two variables
present positive dependence in the marginal contingency table but negative in
all partial tables defined by different levels of a confounding factor. It is
accepted wisdom that in data of any nontrivial dimensionality it is infeasible
to control for all of the exponentially many possible confounds of this nature.
In this paper, we consider the problem of specious dependencies in the context
of statistical association rule mining. We define specious rules and show they
offer a unifying framework which covers many types of previously proposed
redundant or misleading association rules. After theoretical analysis, we
introduce practical algorithms for detecting and pruning out specious
association rules efficiently under many key goodness measures, including
mutual information and exact hypergeometric probabilities. We demonstrate that
the procedure greatly reduces the number of associations discovered, providing
an elegant and effective solution to the problem of association mining
discovering large numbers of misleading and redundant rules.
","[{'version': 'v1', 'created': 'Tue, 12 Sep 2017 15:39:47 GMT'}]",2017-09-13,"[['Hämäläinen', 'Wilhelmiina', ''], ['Webb', 'Geoffrey I.', '']]","['specious dependency', 'association rule', 'YuleSimpson’s paradox', 'mutual information', 'Birch’s test']"
299,1908.09505,Peter Kietzmann,"Hauke Petersen, Peter Kietzmann, Cenk G\""undo\u{g}an, Thomas C.
  Schmidt, Matthias W\""ahlisch",Bluetooth Mesh under the Microscope: How much ICN is Inside?,,Proceedings of ACM ICN 2019,10.1145/3357150.3357398,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bluetooth (BT) mesh is a new mode of BT operation for low-energy devices that
offers group-based publish-subscribe as a network service with additional
caching capabilities. These features resemble concepts of information-centric
networking (ICN), and the analogy to ICN has been repeatedly drawn in the BT
community. In this paper, we compare BT mesh with ICN both conceptually and in
real-world experiments. We contrast both architectures and their design
decisions in detail. Experiments are performed on an IoT testbed using NDN/CCNx
and BT mesh on constrained RIOT nodes. Our findings indicate significant
differences both in concepts and in real-world performance. Supported by new
insights, we identify synergies and sketch a design of a BT-ICN that benefits
from both worlds.
","[{'version': 'v1', 'created': 'Mon, 26 Aug 2019 07:34:00 GMT'}]",2019-08-27,"[['Petersen', 'Hauke', ''], ['Kietzmann', 'Peter', ''], ['Gündoğan', 'Cenk', ''], ['Schmidt', 'Thomas C.', ''], ['Wählisch', 'Matthias', '']]","['IoT', 'ICN', 'Bluetooth', 'Constrained devices']"
300,2102.03955,Eduardo Velloso,"Eduardo Velloso, Carlos Hitoshi Morimoto","A Probabilistic Interpretation of Motion Correlation Selection
  Techniques",,,10.1145/3411764.3445184,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Motion correlation interfaces are those that present targets moving in
different patterns, which the user can select by matching their motion. In this
paper, we re-formulate the task of target selection as a probabilistic
inference problem. We demonstrate that previous interaction techniques can be
modelled using a Bayesian approach and that how modelling the selection task as
transmission of information can help us make explicit the assumptions behind
similarity measures. We propose ways of incorporating uncertainty into the
decision-making process and demonstrate how the concept of entropy can
illuminate the measurement of the quality of a design. We apply these
techniques in a case study and suggest guidelines for future work.
","[{'version': 'v1', 'created': 'Mon, 8 Feb 2021 00:35:59 GMT'}]",2021-02-09,"[['Velloso', 'Eduardo', ''], ['Morimoto', 'Carlos Hitoshi', '']]","['motion correlation', 'pursuits', 'computational interaction', 'probabilistic input', 'gestures', 'gaze interaction']"
301,1509.04387,Aman Chadha Mr.,"Aman Chadha, Sushmit Mallik, Ankit Chadha, Ravdeep Johar and M. Mani
  Roja",Dual-Layer Video Encryption using RSA Algorithm,"arXiv admin note: text overlap with arXiv:1104.0800, arXiv:1112.0836
  by other authors","International Journal of Computer Applications 116(1):33-40, April
  2015",10.5120/20302-2341,,cs.CR cs.MM eess.IV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper proposes a video encryption algorithm using RSA and Pseudo Noise
(PN) sequence, aimed at applications requiring sensitive video information
transfers. The system is primarily designed to work with files encoded using
the Audio Video Interleaved (AVI) codec, although it can be easily ported for
use with Moving Picture Experts Group (MPEG) encoded files. The audio and video
components of the source separately undergo two layers of encryption to ensure
a reasonable level of security. Encryption of the video component involves
applying the RSA algorithm followed by the PN-based encryption. Similarly, the
audio component is first encrypted using PN and further subjected to encryption
using the Discrete Cosine Transform. Combining these techniques, an efficient
system, invulnerable to security breaches and attacks with favorable values of
parameters such as encryption/decryption speed, encryption/decryption ratio and
visual degradation; has been put forth. For applications requiring encryption
of sensitive data wherein stringent security requirements are of prime concern,
the system is found to yield negligible similarities in visual perception
between the original and the encrypted video sequence. For applications wherein
visual similarity is not of major concern, we limit the encryption task to a
single level of encryption which is accomplished by using RSA, thereby
quickening the encryption process. Although some similarity between the
original and encrypted video is observed in this case, it is not enough to
comprehend the happenings in the video.
","[{'version': 'v1', 'created': 'Mon, 14 Sep 2015 06:52:20 GMT'}]",2020-09-07,"[['Chadha', 'Aman', ''], ['Mallik', 'Sushmit', ''], ['Chadha', 'Ankit', ''], ['Johar', 'Ravdeep', ''], ['Roja', 'M. Mani', '']]","['encryption', 'video encryption', 'RSA', 'pseudo noise']"
302,1903.01618,Hyunjae Kang,"Hyunjae Kang, Jae-wook Jang, Aziz Mohaisen and Huy Kang Kim","Detecting and Classifying Android Malware using Static Analysis along
  with Creator Information",International Journal of Distributed Sensor Networks,,10.1155/2015/479174,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Thousands of malicious applications targeting mobile devices, including the
popular Android platform, are created every day. A large number of those
applications are created by a small number of professional under-ground actors,
however previous studies overlooked such information as a feature in detecting
and classifying malware, and in attributing malware to creators. Guided by this
insight, we propose a method to improve on the performance of Android malware
detection by incorporating the creator's information as a feature and classify
malicious applications into similar groups. We developed a system that
implements this method in practice. Our system enables fast detection of
malware by using creator information such as serial number of certificate.
Additionally, it analyzes malicious be-haviors and permissions to increase
detection accuracy. The system also can classify malware based on similarity
scoring. Finally, we showed detection and classification performance with 98%
and 90% accuracy respectively.
","[{'version': 'v1', 'created': 'Sat, 2 Mar 2019 13:26:33 GMT'}]",2019-03-06,"[['Kang', 'Hyunjae', ''], ['Jang', 'Jae-wook', ''], ['Mohaisen', 'Aziz', ''], ['Kim', 'Huy Kang', '']]","['Mobile malware', 'Android security', 'malware detection', 'malware classification', 'creator information']"
303,1907.08003,Dominik Aumayr,"Dominik Aumayr, Stefan Marr, Elisa Gonzalez Boix, Hanspeter
  M\""ossenb\""ock","Asynchronous Snapshots of Actor Systems for Latency-Sensitive
  Applications","This is the author's version of the work. It is posted here for your
  personal use. Not for redistribution. The definitive Version of Record was
  published in Proceedings of the 16th ACM SIGPLAN International Conference on
  Managed Programming Languages and Runtimes (MPLR '19), October 21-22, 2019,
  Athens, Greece, https://doi.org/10.1145/3357390.3361019",,10.1145/3357390.3361019,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The actor model is popular for many types of server applications. Efficient
snapshotting of applications is crucial in the deployment of pre-initialized
applications or moving running applications to different machines, e.g for
debugging purposes. A key issue is that snapshotting blocks all other
operations. In modern latency-sensitive applications, stopping the application
to persist its state needs to be avoided, because users may not tolerate the
increased request latency. In order to minimize the impact of snapshotting on
request latency, our approach persists the application's state asynchronously
by capturing partial heaps, completing snapshots step by step. Additionally,
our solution is transparent and supports arbitrary object graphs. We prototyped
our snapshotting approach on top of the Truffle/Graal platform and evaluated it
with the Savina benchmarks and the Acme Air microservice application. When
performing a snapshot every thousand Acme Air requests, the number of slow
requests ( 0.007% of all requests) with latency above 100ms increases by 5.43%.
Our Savina microbenchmark results detail how different utilization patterns
impact snapshotting cost. To the best of our knowledge, this is the first
system that enables asynchronous snapshotting of actor applications, i.e.
without stop-the-world synchronization, and thereby minimizes the impact on
latency. We thus believe it enables new deployment and debugging options for
actor systems.
","[{'version': 'v1', 'created': 'Thu, 18 Jul 2019 11:49:57 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Sep 2019 08:40:30 GMT'}]",2019-09-19,"[['Aumayr', 'Dominik', ''], ['Marr', 'Stefan', ''], ['Boix', 'Elisa Gonzalez', ''], ['Mössenböck', 'Hanspeter', '']]","['Actors', 'Snapshots', 'Micro services', 'Latency']"
304,0910.4568,Ilango Sriram,Ilango Sriram,"SPECI, a simulation tool exploring cloud-scale data centres",,"Ilango Sriram, SPECI, a Simulation Tool Exploring Cloud-Scale Data
  Centres, In: CloudCom 2009, LNCS 5931, pp. 381-392, 2009, M.G. Jaatun, G.
  Zhao, and C. Rong (Eds.), Springer-Verlag Berlin Heidelberg 2009",10.1007/978-3-642-10665-1_35,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a rapid increase in the size of data centres (DCs) used to provide
cloud computing services. It is commonly agreed that not all properties in the
middleware that manages DCs will scale linearly with the number of components.
Further, ""normal failure"" complicates the assessment of the per-formance of a
DC. However, unlike in other engineering domains, there are no well established
tools that allow the prediction of the performance and behav-iour of future
generations of DCs. SPECI, Simulation Program for Elastic Cloud
Infrastructures, is a simulation tool which allows exploration of aspects of
scaling as well as performance properties of future DCs.
","[{'version': 'v1', 'created': 'Fri, 23 Oct 2009 19:05:29 GMT'}]",2015-05-14,"[['Sriram', 'Ilango', '']]","['Cloud computing', 'data centre', 'middleware', 'scaling of performance', 'simulation tools']"
305,1912.01944,Saeideh Ghanbari Azar,Saeideh Ghanbari Azar and Hadi Seyedarabi,"Trajectory-Based Recognition of Dynamic Persian Sign Language Using
  Hidden Markov Model",,,10.1016/j.csl.2019.101053,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sign Language Recognition (SLR) is an important step in facilitating the
communication among deaf people and the rest of society. Existing Persian sign
language recognition systems are mainly restricted to static signs which are
not very useful in everyday communications. In this study, a dynamic Persian
sign language recognition system is presented. A collection of 1200 videos were
captured from 12 individuals performing 20 dynamic signs with a simple white
glove. The trajectory of the hands, along with hand shape information were
extracted from each video using a simple region-growing technique. These
time-varying trajectories were then modeled using Hidden Markov Model (HMM)
with Gaussian probability density functions as observations. The performance of
the system was evaluated in different experimental strategies.
Signer-independent and signer-dependent experiments were performed on the
proposed system and the average accuracy of 97.48% was obtained. The
experimental results demonstrated that the performance of the system is
independent of the subject and it can also perform excellently even with a
limited number of training data.
","[{'version': 'v1', 'created': 'Wed, 4 Dec 2019 13:08:58 GMT'}]",2019-12-05,"[['Azar', 'Saeideh Ghanbari', ''], ['Seyedarabi', 'Hadi', '']]","['Sign Language Recognition', 'Persian Sign Language', 'Trajectory', 'Hidden']"
306,1312.2342,Meiappane  Aroumougame,"A.Meiappane, B. Chithra, Prasanna Venkataesan","Evaluation of Software Architecture Quality Attribute for an Internet
  Banking System",4 pages,,10.5120/10189-5062,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The design phase plays a vital role than all other phases in the software
development. Software Architecture has to meet both the functional and
non-functional quality requirements. The Evaluation of Architecture has to be
performed, so that the developers are assured that their selected Architecture
will reduce the cost and effort and also enhances the various quality
attributes like Availability, Reusability, Performance, Modifiability and
Extendibility. The success of the system depends upon the Architecture
Evaluation by the essential method to the system. The overall ranking of the
candidate architecture is ascertained by assigning weight to the scenario and
scenario interaction. In this paper, SAAM method is taken to evaluate the two
architectures from the various available method and techniques to achieve the
various quality attributes by weight metric.
","[{'version': 'v1', 'created': 'Mon, 9 Dec 2013 08:48:42 GMT'}]",2015-06-18,"[['Meiappane', 'A.', ''], ['Chithra', 'B.', ''], ['Venkataesan', 'Prasanna', '']]","['Software architecture', 'Evaluation', 'quality attributes', 'weight metric']"
307,1701.07756,Siwar Jendoubi,"Siwar Jendoubi, Arnaud Martin, Ludovic Li\'etard, Boutheina Ben
  Yaghlane, Hend Ben Hadji","Dynamic time warping distance for message propagation classification in
  Twitter","10 pages, 1 figure ECSQARU 2015, Proceedings of the 13th European
  Conferences on Symbolic and Quantitative Approaches to Reasoning with
  Uncertainty, 2015",,10.1007/978-3-319-20807-7_38,,cs.AI cs.SI stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Social messages classification is a research domain that has attracted the
attention of many researchers in these last years. Indeed, the social message
is different from ordinary text because it has some special characteristics
like its shortness. Then the development of new approaches for the processing
of the social message is now essential to make its classification more
efficient. In this paper, we are mainly interested in the classification of
social messages based on their spreading on online social networks (OSN). We
proposed a new distance metric based on the Dynamic Time Warping distance and
we use it with the probabilistic and the evidential k Nearest Neighbors (k-NN)
classifiers to classify propagation networks (PrNets) of messages. The
propagation network is a directed acyclic graph (DAG) that is used to record
propagation traces of the message, the traversed links and their types. We
tested the proposed metric with the chosen k-NN classifiers on real world
propagation traces that were collected from Twitter social network and we got
good classification accuracies.
","[{'version': 'v1', 'created': 'Thu, 26 Jan 2017 16:14:40 GMT'}]",2017-01-27,"[['Jendoubi', 'Siwar', ''], ['Martin', 'Arnaud', ''], ['Liétard', 'Ludovic', ''], ['Yaghlane', 'Boutheina Ben', ''], ['Hadji', 'Hend Ben', '']]","['Propagation network (PrNet)', 'classification', 'Dynamic Time Warping (DTW)', 'k Nearest Neighbor (k-NN)']"
308,1608.05812,Suleiman Yerima,"Suleiman Y. Yerima, Sakir Sezer, Gavin McWilliams","Analysis of Bayesian Classification based Approaches for Android Malware
  Detection",arXiv admin note: text overlap with arXiv:1608.00848,"IET Information Security, Volume 8, Issue 1, January 2014, pp.
  25-36, Print ISSN 1751-8709, Online ISSN 1751-8717",10.1049/iet-ifs.2013.0095,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile malware has been growing in scale and complexity spurred by the
unabated uptake of smartphones worldwide. Android is fast becoming the most
popular mobile platform resulting in sharp increase in malware targeting the
platform. Additionally, Android malware is evolving rapidly to evade detection
by traditional signature-based scanning. Despite current detection measures in
place, timely discovery of new malware is still a critical issue. This calls
for novel approaches to mitigate the growing threat of zero-day Android
malware. Hence, in this paper we develop and analyze proactive Machine Learning
approaches based on Bayesian classification aimed at uncovering unknown Android
malware via static analysis. The study, which is based on a large malware
sample set of majority of the existing families, demonstrates detection
capabilities with high accuracy. Empirical results and comparative analysis are
presented offering useful insight towards development of effective
static-analytic Bayesian classification based solutions for detecting unknown
Android malware.
","[{'version': 'v1', 'created': 'Sat, 20 Aug 2016 12:10:49 GMT'}]",2016-08-23,"[['Yerima', 'Suleiman Y.', ''], ['Sezer', 'Sakir', ''], ['McWilliams', 'Gavin', '']]","['mobile security', 'Android', 'malware detection', 'data mining', 'Bayesian classification', 'static analysis', 'machine learning']"
309,1706.07786,Ismail Rusli,Ismail Rusli,"Comparison of Modified Kneser-Ney and Witten-Bell Smoothing Techniques
  in Statistical Language Model of Bahasa Indonesia","9 pages, 3 figures, 2nd International Conference on Information and
  Communication Technology (ICoICT), Bandung, 2014",,10.1109/ICoICT.2014.6914097,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smoothing is one technique to overcome data sparsity in statistical language
model. Although in its mathematical definition there is no explicit dependency
upon specific natural language, different natures of natural languages result
in different effects of smoothing techniques. This is true for Russian language
as shown by Whittaker (1998). In this paper, We compared Modified Kneser-Ney
and Witten-Bell smoothing techniques in statistical language model of Bahasa
Indonesia. We used train sets of totally 22M words that we extracted from
Indonesian version of Wikipedia. As far as we know, this is the largest train
set used to build statistical language model for Bahasa Indonesia. The
experiments with 3-gram, 5-gram, and 7-gram showed that Modified Kneser-Ney
consistently outperforms Witten-Bell smoothing technique in term of perplexity
values. It is interesting to note that our experiments showed 5-gram model for
Modified Kneser-Ney smoothing technique outperforms that of 7-gram. Meanwhile,
Witten-Bell smoothing is consistently improving over the increase of n-gram
order.
","[{'version': 'v1', 'created': 'Fri, 23 Jun 2017 17:43:20 GMT'}]",2017-06-26,"[['Rusli', 'Ismail', '']]","['n-gram', 'Kneser-Ney', 'Witten-Bell', 'smoothing technique', 'statistical language model of Bahasa Indonesia']"
310,1911.08684,Kaiqun Fu,"Kaiqun Fu, Taoran Ji, Liang Zhao, Chang-Tien Lu","TITAN: A Spatiotemporal Feature Learning Framework for Traffic Incident
  Duration Prediction",,,10.1145/3347146.3359381,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Critical incident stages identification and reasonable prediction of traffic
incident duration are essential in traffic incident management. In this paper,
we propose a traffic incident duration prediction model that simultaneously
predicts the impact of the traffic incidents and identifies the critical groups
of temporal features via a multi-task learning framework. First, we formulate a
sparsity optimization problem that extracts low-level temporal features based
on traffic speed readings and then generalizes higher level features as phases
of traffic incidents. Second, we propose novel constraints on feature
similarity exploiting prior knowledge about the spatial connectivity of the
road network to predict the incident duration. The proposed problem is
challenging to solve due to the orthogonality constraints, non-convexity
objective, and non-smoothness penalties. We develop an algorithm based on the
alternating direction method of multipliers (ADMM) framework to solve the
proposed formulation. Extensive experiments and comparisons to other models on
real-world traffic data and traffic incident records justify the efficacy of
our model.
","[{'version': 'v1', 'created': 'Wed, 20 Nov 2019 03:32:43 GMT'}]",2019-11-21,"[['Fu', 'Kaiqun', ''], ['Ji', 'Taoran', ''], ['Zhao', 'Liang', ''], ['Lu', 'Chang-Tien', '']]","['intelligent transportation systems', 'feature learning', 'incident impactanalysis']"
311,1705.07563,Yuxin Su,"Yuxin Su, Irwin King, Michael Lyu",Learning to Rank Using Localized Geometric Mean Metrics,To appear in SIGIR'17,,10.1145/3077136.3080828,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many learning-to-rank (LtR) algorithms focus on query-independent model, in
which query and document do not lie in the same feature space, and the rankers
rely on the feature ensemble about query-document pair instead of the
similarity between query instance and documents. However, existing algorithms
do not consider local structures in query-document feature space, and are
fragile to irrelevant noise features. In this paper, we propose a novel
Riemannian metric learning algorithm to capture the local structures and
develop a robust LtR algorithm. First, we design a concept called \textit{ideal
candidate document} to introduce metric learning algorithm to query-independent
model. Previous metric learning algorithms aiming to find an optimal metric
space are only suitable for query-dependent model, in which query instance and
documents belong to the same feature space and the similarity is directly
computed from the metric space. Then we extend the new and extremely fast
global Geometric Mean Metric Learning (GMML) algorithm to develop a localized
GMML, namely L-GMML. Based on the combination of local learned metrics, we
employ the popular Normalized Discounted Cumulative Gain~(NDCG) scorer and
Weighted Approximate Rank Pairwise (WARP) loss to optimize the \textit{ideal
candidate document} for each query candidate set. Finally, we can quickly
evaluate all candidates via the similarity between the \textit{ideal candidate
document} and other candidates. By leveraging the ability of metric learning
algorithms to describe the complex structural information, our approach gives
us a principled and efficient way to perform LtR tasks. The experiments on
real-world datasets demonstrate that our proposed L-GMML algorithm outperforms
the state-of-the-art metric learning to rank methods and the stylish
query-independent LtR algorithms regarding accuracy and computational
efficiency.
","[{'version': 'v1', 'created': 'Mon, 22 May 2017 05:46:44 GMT'}]",2017-05-23,"[['Su', 'Yuxin', ''], ['King', 'Irwin', ''], ['Lyu', 'Michael', '']]","['Learning to Rank', 'Distance Metric Learning', 'Local Metric Learning']"
312,1509.00388,Philipp Kindermann,"Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp
  Kindermann, Giuseppe Liotta, Fabrizio Montecchiani",Recognizing and Drawing IC-planar Graphs,,Theor. Comput. Sci. 636: 1-16 (2016),10.1016/j.tcs.2016.04.026,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  IC-planar graphs are those graphs that admit a drawing where no two crossed
edges share an end-vertex and each edge is crossed at most once. They are a
proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph $G$
with $n$ vertices, we present an $O(n)$-time algorithm that computes a
straight-line drawing of $G$ in quadratic area, and an $O(n^3)$-time algorithm
that computes a straight-line drawing of $G$ with right-angle crossings in
exponential area. Both these area requirements are worst-case optimal. We also
show that it is NP-complete to test IC-planarity both in the general case and
in the case in which a rotation system is fixed for the input graph.
Furthermore, we describe a polynomial-time algorithm to test whether a set of
matching edges can be added to a triangulated planar graph such that the
resulting graph is IC-planar.
","[{'version': 'v1', 'created': 'Tue, 1 Sep 2015 16:54:16 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Jul 2016 17:06:34 GMT'}]",2016-07-19,"[['Brandenburg', 'Franz J.', ''], ['Didimo', 'Walter', ''], ['Evans', 'William S.', ''], ['Kindermann', 'Philipp', ''], ['Liotta', 'Giuseppe', ''], ['Montecchiani', 'Fabrizio', '']]","['1-Planarity', 'IC-Planarity', 'Right Angle Crossings', 'Graph Drawing', 'NP-hardness']"
313,1808.01552,Leye Wang,"Leye Wang, Bin Guo, Qiang Yang",Smart City Development with Urban Transfer Learning,,"IEEE Computer ( Volume: 51, Issue: 12, Dec. 2018)",10.1109/MC.2018.2880015,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, the smart city development levels of different cities are still
unbalanced. For a large number of cities which just started development, the
governments will face a critical cold-start problem: 'how to develop a new
smart city service with limited data?'. To address this problem, transfer
learning can be leveraged to accelerate the smart city development, which we
term the urban transfer learning paradigm. This article investigates the common
process of urban transfer learning, aiming to provide city planners and
relevant practitioners with guidelines on how to apply this novel learning
paradigm. Our guidelines include common transfer strategies to take, general
steps to follow, and case studies in public safety, transportation management,
etc. We also summarize a few research opportunities and expect this article can
attract more researchers to study urban transfer learning.
","[{'version': 'v1', 'created': 'Sun, 5 Aug 2018 02:28:27 GMT'}, {'version': 'v2', 'created': 'Sun, 21 Oct 2018 03:42:02 GMT'}]",2022-05-31,"[['Wang', 'Leye', ''], ['Guo', 'Bin', ''], ['Yang', 'Qiang', '']]","['transfer learning', 'urban computing', 'smart city']"
314,1406.3969,Siddhartha Ghosh,"Siddhartha Ghosh, Sujata Thamke and Kalyani U.R.S","Translation Of Telugu-Marathi and Vice-Versa using Rule Based Machine
  Translation","13 pages, Fourth International Conference on Advances in Computing
  and Information Technology (ACITY 2014) Delhi, India - May 2014",,10.5121/csit.2014.4501,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In todays digital world automated Machine Translation of one language to
another has covered a long way to achieve different kinds of success stories.
Whereas Babel Fish supports a good number of foreign languages and only Hindi
from Indian languages, the Google Translator takes care of about 10 Indian
languages. Though most of the Automated Machine Translation Systems are doing
well but handling Indian languages needs a major care while handling the local
proverbs/ idioms. Most of the Machine Translation system follows the direct
translation approach while translating one Indian language to other. Our
research at KMIT R&D Lab found that handling the local proverbs/idioms is not
given enough attention by the earlier research work. This paper focuses on two
of the majorly spoken Indian languages Marathi and Telugu, and translation
between them. Handling proverbs and idioms of both the languages have been
given a special care, and the research outcome shows a significant achievement
in this direction.
","[{'version': 'v1', 'created': 'Mon, 16 Jun 2014 10:59:03 GMT'}]",2014-06-17,"[['Ghosh', 'Siddhartha', ''], ['Thamke', 'Sujata', ''], ['S', 'Kalyani U. R.', '']]","['Machine Translation', 'NLP', 'Parts Of Speech', 'Indian Languages']"
315,1902.09749,Andr\'es Monroy-Hern\'andez,"Taryn Bipat, Maarten Willem Bos, Rajan Vaish, Andr\'es
  Monroy-Hern\'andez",Analyzing the Use of Camera Glasses in the Wild,"In Proceedings of the 37th Annual ACM Conference on Human Factors in
  Computing Systems (CHI 2019). ACM, New York, NY, USA",,10.1145/3290605.3300651,,cs.HC cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Camera glasses enable people to capture point-of-view videos using a common
accessory, hands-free. In this paper, we investigate how, when, and why people
used one such product: Spectacles. We conducted 39 semi-structured interviews
and surveys with 191 owners of Spectacles. We found that the form factor
elicits sustained usage behaviors, and opens opportunities for new use-cases
and types of content captured. We provide a usage typology, and highlight
societal and individual factors that influence the classification of behaviors.
","[{'version': 'v1', 'created': 'Tue, 26 Feb 2019 06:20:44 GMT'}]",2019-02-27,"[['Bipat', 'Taryn', ''], ['Bos', 'Maarten Willem', ''], ['Vaish', 'Rajan', ''], ['Monroy-Hernández', 'Andrés', '']]","['camera glasses', 'smart glasses', 'wearables', 'usability']"
316,1803.07613,Radhika Jagtap,"Radhika Jagtap, Matthias Jung, Wendy Elsasser, Christian Weis, Andreas
  Hansson, Norbert Wehn",Integrating DRAM Power-Down Modes in gem5 and Quantifying their Impact,,"In Proceedings of MEMSYS 2017, Alexandria, VA, USA, October 2,
  2017, 10 pages, ACM",10.1145/3132402.3132444,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Across applications, DRAM is a significant contributor to the overall system
power, with the DRAM access energy per bit up to three orders of magnitude
higher compared to on-chip memory accesses. To improve the power efficiency,
DRAM technology incorporates multiple power-down modes, each with different
trade-offs between achievable power savings and performance impact due to entry
and exit delay requirements. Accurate modeling of these low power modes and
entry and exit control is crucial to analyze the trade-offs across controller
configurations and workloads with varied memory access characteristics. To
address this, we integrate the power-down modes into the DRAM controller model
in the open-source simulator gem5. This is the first publicly available
full-system simulator with DRAM power-down modes, providing the research
community a tool for DRAM power analysis for a breadth of use cases. We
validate the power-down functionality with sweep tests, which trigger defined
memory access characteristics. We further evaluate the model with real HPC
workloads, illustrating the value of integrating low power functionality into a
full system simulator.
","[{'version': 'v1', 'created': 'Tue, 20 Mar 2018 19:22:27 GMT'}]",2018-03-22,"[['Jagtap', 'Radhika', ''], ['Jung', 'Matthias', ''], ['Elsasser', 'Wendy', ''], ['Weis', 'Christian', ''], ['Hansson', 'Andreas', ''], ['Wehn', 'Norbert', '']]","['DRAM', 'Power-Down', 'Simulation', 'gem5', 'Power']"
317,1404.3186,Martin Monperrus,"Favio Demarco, Jifeng Xuan (INRIA Lille - Nord Europe), Daniel Le
  Berre (CRIL), Martin Monperrus (INRIA Lille - Nord Europe)","Automatic Repair of Buggy If Conditions and Missing Preconditions with
  SMT","CSTVA'2014, India (2014)","6th International Workshop on Constraints in Software Testing,
  Verification, and Analysis (CSTVA 2014), 2014",10.1145/2593735.2593740,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present Nopol, an approach for automatically repairing buggy if conditions
and missing preconditions. As input, it takes a program and a test suite which
contains passing test cases modeling the expected behavior of the program and
at least one failing test case embodying the bug to be repaired. It consists of
collecting data from multiple instrumented test suite executions, transforming
this data into a Satisfiability Modulo Theory (SMT) problem, and translating
the SMT result -- if there exists one -- into a source code patch. Nopol
repairs object oriented code and allows the patches to contain nullness checks
as well as specific method calls.
","[{'version': 'v1', 'created': 'Fri, 11 Apr 2014 18:57:52 GMT'}]",2018-07-06,"[['Demarco', 'Favio', '', 'INRIA Lille - Nord Europe'], ['Xuan', 'Jifeng', '', 'INRIA Lille - Nord Europe'], ['Berre', 'Daniel Le', '', 'CRIL'], ['Monperrus', 'Martin', '', 'INRIA Lille - Nord Europe']]","['Automatic repair', 'test suite', 'buggy if condition', 'missing precondition', 'SMT', 'angelic fix localization']"
318,1706.02889,Antonio Pertusa,"Antonio Pertusa, Antonio-Javier Gallego, Marisa Bernabeu","MirBot: A collaborative object recognition system for smartphones using
  convolutional neural networks","Accepted in Neurocomputing, 2018","Neurocomputing, vol 293, 2018, Pages 87-99",10.1016/j.neucom.2018.03.005,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  MirBot is a collaborative application for smartphones that allows users to
perform object recognition. This app can be used to take a photograph of an
object, select the region of interest and obtain the most likely class (dog,
chair, etc.) by means of similarity search using features extracted from a
convolutional neural network (CNN). The answers provided by the system can be
validated by the user so as to improve the results for future queries. All the
images are stored together with a series of metadata, thus enabling a
multimodal incremental dataset labeled with synset identifiers from the WordNet
ontology. This dataset grows continuously thanks to the users' feedback, and is
publicly available for research. This work details the MirBot object
recognition system, analyzes the statistics gathered after more than four years
of usage, describes the image classification methodology, and performs an
exhaustive evaluation using handcrafted features, convolutional neural codes
and different transfer learning techniques. After comparing various models and
transformation methods, the results show that the CNN features maintain the
accuracy of MirBot constant over time, despite the increasing number of new
classes. The app is freely available at the Apple and Google Play stores.
","[{'version': 'v1', 'created': 'Fri, 9 Jun 2017 10:50:43 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Mar 2018 08:34:12 GMT'}, {'version': 'v3', 'created': 'Sat, 24 Mar 2018 08:30:28 GMT'}]",2020-06-05,"[['Pertusa', 'Antonio', ''], ['Gallego', 'Antonio-Javier', ''], ['Bernabeu', 'Marisa', '']]","['Object recognition', 'image datasets', 'Convolutional neural networks', 'transfer learning', 'multimodality', 'human computer interaction']"
319,2102.07195,Mohamed Alrshah,"Ali A. Elrowayati, Mohamed A. Alrshah, M.F.L. Abdullah, Rohaya Latip","HEVC Watermarking Techniques for Authentication and Copyright
  Applications: Challenges and Opportunities","Review article, 20 pages",,10.1109/ACCESS.2020.3004049,,cs.CR cs.MM,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Recently, High-Efficiency Video Coding (HEVC/H.265) has been chosen to
replace previous video coding standards, such as H.263 and H.264. Despite the
efficiency of HEVC, it still lacks reliable and practical functionalities to
support authentication and copyright applications. In order to provide this
support, several watermarking techniques have been proposed by many researchers
during the last few years. However, those techniques are still suffering from
many issues that need to be considered for future designs. In this paper, a
Systematic Literature Review (SLR) is introduced to identify HEVC challenges
and potential research directions for interested researchers and developers.
The time scope of this SLR covers all research articles published during the
last six years starting from January 2014 up to the end of April 2020.
Forty-two articles have met the criteria of selection out of 343 articles
published in this area during the mentioned time scope. A new classification
has been drawn followed by an identification of the challenges of implementing
HEVC watermarking techniques based on the analysis and discussion of those
chosen articles. Eventually, recommendations for HEVC watermarking techniques
have been listed to help researchers to improve the existing techniques or to
design new efficient ones.
","[{'version': 'v1', 'created': 'Sun, 14 Feb 2021 16:56:42 GMT'}]",2021-02-16,"[['Elrowayati', 'Ali A.', ''], ['Alrshah', 'Mohamed A.', ''], ['Abdullah', 'M. F. L.', ''], ['Latip', 'Rohaya', '']]","[', and synonyms, as in Table 1', 'Initially,this search strategy produces lists of related', 'interestingarticles including many duplicated', 'redundant items']"
320,1809.00094,Miko{\l}aj Morzy,Miko{\l}aj Morzy and Tomasz Kajdanowicz,"Graph Energies of Egocentric Networks and Their Correlation with Vertex
  Centrality Measures",,"Entropy 2018, 20(12), 916",10.3390/e20120916,,cs.SI physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  Graph energy is the energy of the matrix representation of the graph, where
the energy of a matrix is the sum of singular values of the matrix. Depending
on the definition of a matrix, one can contemplate graph energy, Randi\'c
energy, Laplacian energy, distance energy, and many others. Although
theoretical properties of various graph energies have been investigated in the
past in the areas of mathematics, chemistry, physics, or graph theory, these
explorations have been limited to relatively small graphs representing chemical
compounds or theoretical graph classes with strictly defined properties. In
this paper we investigate the usefulness of the concept of graph energy in the
context of large, complex networks. We show that when graph energies are
applied to local egocentric networks, the values of these energies correlate
strongly with vertex centrality measures. In particular, for some generative
network models graph energies tend to correlate strongly with the betweenness
and the eigencentrality of vertices. As the exact computation of these
centrality measures is expensive and requires global processing of a network,
our research opens the possibility of devising efficient algorithms for the
estimation of these centrality measures based only on local information.
","[{'version': 'v1', 'created': 'Sat, 1 Sep 2018 01:25:37 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Nov 2018 20:51:41 GMT'}]",2019-02-12,"[['Morzy', 'Mikołaj', ''], ['Kajdanowicz', 'Tomasz', '']]","['Graph energy', 'Randi´c energy', 'Laplacian energy', 'egocentric network', 'vertex centralitymeasures']"
321,1603.04276,Elaheh Ghassabani,"Elaheh Ghassabani (1), Andrew Gacek (2), Michael W. Whalen (1) ((1)
  University of Minnesota, (2) Rockwell Collins Advanced Technology Center)",Efficient Generation of Inductive Validity Cores for Safety Properties,"appears in FSE2016: ACM Sigsoft International Symposium on the
  Foundations of Software Engineering, Seattle, WA, November 13-19, 2016",,10.1145/2950290.2950346,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Symbolic model checkers can construct proofs of properties over very complex
models. However, the results reported by the tool when a proof succeeds do not
generally provide much insight to the user. It is often useful for users to
have traceability information related to the proof: which portions of the model
were necessary to construct it. This traceability information can be used to
diagnose a variety of modeling problems such as overconstrained axioms and
underconstrained properties, and can also be used to measure completeness of a
set of requirements over a model. In this paper, we present a new algorithm to
efficiently compute the inductive validity core (IVC) within a model necessary
for inductive proofs of safety properties for sequential systems. The algorithm
is based on the UNSAT core support built into current SMT solvers and a novel
encoding of the inductive problem to try to generate a minimal inductive
validity core. We prove our algorithm is correct, and describe its
implementation in the JKind model checker for Lustre models. We then present an
experiment in which we benchmark the algorithm in terms of speed, diversity of
produced cores, and minimality, with promising results.
","[{'version': 'v1', 'created': 'Mon, 14 Mar 2016 14:36:58 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Jul 2016 17:36:57 GMT'}]",2016-08-01,"[['Ghassabani', 'Elaheh', ''], ['Gacek', 'Andrew', ''], ['Whalen', 'Michael W.', '']]","['Traceability', 'Requirements Completeness', 'k-Induction', 'IC3/PDR']"
322,2002.03256,Margaret Mitchell,"Margaret Mitchell, Dylan Baker, Nyalleng Moorosi, Emily Denton, Ben
  Hutchinson, Alex Hanna, Timnit Gebru, Jamie Morgenstern",Diversity and Inclusion Metrics in Subset Selection,,"AIES 2020: Proceedings of the AAAI/ACM Conference on AI, Ethics,
  and Society",10.1145/3375627.3375832,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ethical concept of fairness has recently been applied in machine learning
(ML) settings to describe a wide range of constraints and objectives. When
considering the relevance of ethical concepts to subset selection problems, the
concepts of diversity and inclusion are additionally applicable in order to
create outputs that account for social power and access differentials. We
introduce metrics based on these concepts, which can be applied together,
separately, and in tandem with additional fairness constraints. Results from
human subject experiments lend support to the proposed criteria. Social choice
methods can additionally be leveraged to aggregate and choose preferable sets,
and we detail how these may be applied.
","[{'version': 'v1', 'created': 'Sun, 9 Feb 2020 00:29:40 GMT'}]",2020-02-11,"[['Mitchell', 'Margaret', ''], ['Baker', 'Dylan', ''], ['Moorosi', 'Nyalleng', ''], ['Denton', 'Emily', ''], ['Hutchinson', 'Ben', ''], ['Hanna', 'Alex', ''], ['Gebru', 'Timnit', ''], ['Morgenstern', 'Jamie', '']]","['machine learning fairness', 'subset selection', 'diversity and inclusion']"
323,1207.3932,Kishorjit Nongmeikapam Mr.,"Kishorjit Nongmeikapam, Vidya Raj RK, Oinam Imocha Singh and Sivaji
  Bandyopadhyay",Automatic Segmentation of Manipuri (Meiteilon) Word into Syllabic Units,"12 Pages, 5 Tables See the link
  http://airccse.org/journal/jcsit/0612csit11.pdf",,10.5121/ijcsit.2012.4311,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The work of automatic segmentation of a Manipuri language (or Meiteilon) word
into syllabic units is demonstrated in this paper. This language is a scheduled
Indian language of Tibeto-Burman origin, which is also a very highly
agglutinative language. This language usages two script: a Bengali script and
Meitei Mayek (Script). The present work is based on the second script. An
algorithm is designed so as to identify mainly the syllables of Manipuri origin
word. The result of the algorithm shows a Recall of 74.77, Precision of 91.21
and F-Score of 82.18 which is a reasonable score with the first attempt of such
kind for this language.
","[{'version': 'v1', 'created': 'Tue, 17 Jul 2012 10:14:24 GMT'}]",2012-07-18,"[['Nongmeikapam', 'Kishorjit', ''], ['RK', 'Vidya Raj', ''], ['Singh', 'Oinam Imocha', ''], ['Bandyopadhyay', 'Sivaji', '']]","['Syllable', 'Syllabic Unit', 'Manipuri', 'Meitei Mayek']"
324,1604.08501,"Andreas Kl\""ockner","Andreas Kl\""ockner and Lucas C. Wilcox and T. Warburton","Array Program Transformation with Loo.py by Example: High-Order Finite
  Elements",,"ARRAY 2016 Proceedings of the 3rd ACM SIGPLAN International
  Workshop on Libraries, Languages, and Compilers for Array Programming Pages
  9-16",10.1145/2935323.2935325,,cs.PL cs.PF math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To concisely and effectively demonstrate the capabilities of our program
transformation system Loo.py, we examine a transformation path from two
real-world Fortran subroutines as found in a weather model to a single
high-performance computational kernel suitable for execution on modern GPU
hardware. Along the transformation path, we encounter kernel fusion,
vectorization, prefetch- ing, parallelization, and algorithmic changes achieved
by mechanized conversion between imperative and functional/substitution- based
code, among a number more. We conclude with performance results that
demonstrate the effects and support the effectiveness of the applied
transformations.
","[{'version': 'v1', 'created': 'Wed, 13 Apr 2016 20:56:15 GMT'}]",2018-10-05,"[['Klöckner', 'Andreas', ''], ['Wilcox', 'Lucas C.', ''], ['Warburton', 'T.', '']]","['Code generation', 'high-level language', 'GPU', 'substitution rule', 'embedded language', 'high-performance', 'program transformation', 'OpenCL']"
325,1107.3682,Jun Wu,Jun Wu and Shigeru Shimamoto,"Context-Capture Multi-Valued Decision Fusion With Fault Tolerant
  Capability For Wireless Sensor Networks","13 pages, 7 figures",,10.5121/ijwmn.2011.3310,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless sensor networks (WSNs) are usually utilized to perform decision
fusion of event detection. Current decision fusion schemes are based on binary
valued decision and do not consider bursty contextcapture. However, bursty
context and multi-valued data are important characteristics of WSNs. One on
hand, the local decisions from sensors usually have bursty and contextual
characteristics. Fusion center must capture the bursty context information from
the sensors. On the other hand, in practice, many applications need to process
multi-valued data, such as temperature and reflection level used for lightening
prediction. To address these challenges, the Markov modulated Poisson process
(MMPP) and multi-valued logic are introduced into WSNs to perform
context-capture multi-valued decision fusion. The overall decision fusion is
decomposed into two parts. The first part is the context-capture model for WSNs
using superposition MMPP. Through this procedure, the fusion center has a
higher probability to get useful local decisions from sensors. The second one
is focused on multi-valued decision fusion. Fault detection can also be
performed based on MVL. Once the fusion center detects the faulty nodes, all
their local decisions are removed from the computation of the likelihood
ratios. Finally, we evaluate the capability of context-capture and fault
tolerant. The result supports the usefulness of our scheme.
","[{'version': 'v1', 'created': 'Tue, 19 Jul 2011 10:50:36 GMT'}]",2011-07-20,"[['Wu', 'Jun', ''], ['Shimamoto', 'Shigeru', '']]","['Wireless Sensor Networks', 'Decision Fusion', 'Context', 'Fault-Tolerant', 'Multi-Valued Logic']"
326,2103.06379,Taha Hassan,"Taha Hassan, Bob Edmison, Timothy Stelter, D. Scott McCrickard","Learning to Trust: Understanding Editorial Authority and Trust in
  Recommender Systems for Education","(UMAP '21) Proceedings of the 29th ACM Conference on User Modeling,
  Adaptation and Personalization, June 21 - 25, 2021 (Utrecht, the Netherlands)","Proceedings of the 29th ACM Conference on User Modeling,
  Adaptation and Personalization (UMAP '21), pp. 24-32. 2021",10.1145/3450613.3456811,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Trust in a recommendation system (RS) is often algorithmically incorporated
using implicit or explicit feedback of user-perceived trustworthy social
neighbors, and evaluated using user-reported trustworthiness of recommended
items. However, real-life recommendation settings can feature group disparities
in trust, power, and prerogatives. Our study examines a complementary view of
trust which relies on the editorial power relationships and attitudes of all
stakeholders in the RS application domain. We devise a simple, first-principles
metric of editorial authority, i.e., user preferences for recommendation
sourcing, veto power, and incorporating user feedback, such that one RS user
group confers trust upon another by ceding or assigning editorial authority. In
a mixed-methods study at Virginia Tech, we surveyed faculty, teaching
assistants, and students about their preferences of editorial authority, and
hypothesis-tested its relationship with trust in algorithms for a hypothetical
`Suggested Readings' RS. We discover that higher RS editorial authority
assigned to students is linked to the relative trust the course staff allocates
to RS algorithm and students. We also observe that course staff favors higher
control for the RS algorithm in sourcing and updating the recommendations
long-term. Using content analysis, we discuss frequent staff-recommended
student editorial roles and highlight their frequent rationales, such as
perceived expertise, scaling the learning environment, professional curriculum
needs, and learner disengagement. We argue that our analyses highlight critical
user preferences to help detect editorial power asymmetry and identify RS
use-cases for supporting teaching and research
","[{'version': 'v1', 'created': 'Wed, 10 Mar 2021 22:57:39 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Sep 2021 08:16:35 GMT'}]",2021-09-20,"[['Hassan', 'Taha', ''], ['Edmison', 'Bob', ''], ['Stelter', 'Timothy', ''], ['McCrickard', 'D. Scott', '']]","['recommendation', 'education', 'context', 'trust', 'interpretation']"
327,1712.10213,Simon Foster,"Simon Foster, Ana Cavalcanti, Jim Woodcock, Frank Zeyda",Unifying Theories of Time with Generalised Reactive Processes,"7 pages, accepted for Information Processing Letters, 15th February
  2018",,10.1016/j.ipl.2018.02.017,,cs.LO cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hoare and He's theory of reactive processes provides a unifying foundation
for the formal semantics of concurrent and reactive languages. Though highly
applicable, their theory is limited to models that can express event histories
as discrete sequences. In this paper, we show how their theory can be
generalised by using an abstract trace algebra. We show how the algebra,
notably, allows us to also consider continuous-time traces and thereby
facilitate models of hybrid systems. We then use this algebra to reconstruct
the theory of reactive processes in our generic setting, and prove
characteristic laws for sequential and parallel processes, all of which have
been mechanically verified in the Isabelle/HOL proof assistant.
","[{'version': 'v1', 'created': 'Fri, 29 Dec 2017 13:09:25 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Feb 2018 11:25:48 GMT'}]",2018-04-05,"[['Foster', 'Simon', ''], ['Cavalcanti', 'Ana', ''], ['Woodcock', 'Jim', ''], ['Zeyda', 'Frank', '']]","['formal semantics', 'hybrid systems', 'process algebra', 'unifying theories', 'theorem proving']"
328,1005.0058,Pino Caballero-Gil,A. F\'uster-Sabater and P. Caballero-Gil,Linear solutions for cryptographic nonlinear sequence generators,,"Physics Letters A Vol. 369, Is. 5-6, 1 Oct. 2007, pp. 432-437",10.1016/j.physleta.2007.04.103,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This letter shows that linear Cellular Automata based on rules 90/150
generate all the solutions of linear difference equations with binary constant
coefficients. Some of these solutions are pseudo-random noise sequences with
application in cryptography: the sequences generated by the class of shrinking
generators. Consequently, this contribution show that shrinking generators do
not provide enough guarantees to be used for encryption purposes. Furthermore,
the linearization is achieved through a simple algorithm about which a full
description is provided.
","[{'version': 'v1', 'created': 'Sat, 1 May 2010 09:14:31 GMT'}]",2015-03-17,"[['Fúster-Sabater', 'A.', ''], ['Caballero-Gil', 'P.', '']]","['Nonlinear Science', 'Cellular Automata', 'Predictability', 'Cryptanalysis']"
329,1907.11352,Jim Buchan,Jim Buchan and Mark Pearl,Leveraging the Mob Mentality: An Experience Report on Mob Programming,6 pages. Best Paper in Industry Collaboration Track at EASE'18,"In EASE'18 Proceedings of the 22nd International Conference on
  Evaluation and Assessment in Software Engineering 2018 Vol. Part F137700 (pp.
  199-204)",10.1145/3210459.3210482,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mob Programming, or ""mobbing"", is a relatively new collaborative programming
practice being experimented with in different organizational contexts. There
are a number of claimed benefits to this way of working, but it is not clear if
these are realized in practice and under what circumstances. This paper
describes the experience of one team's experiences experimenting with Mob
Programming over an 18-month period. The context is programming in a software
product organization in the Financial Services sector. The paper details the
benefits and challenges observed as well as lessons learned from these
experiences. It also reports some early work on understanding others'
experiences and perceptions of mobbing through a preliminary international
survey of 82 practitioners of Mob Programming. The findings from the case and
the survey generally align well, as well as suggesting several fruitful areas
for further research into Mob Programming. Practitioners should find this
useful to extract learnings to inform their own mobbing experiments and its
potential impact on collaborative software development.
","[{'version': 'v1', 'created': 'Fri, 26 Jul 2019 01:09:50 GMT'}]",2019-07-29,"[['Buchan', 'Jim', ''], ['Pearl', 'Mark', '']]","['Mob programming', 'Mobbing', 'Collaborative programming']"
330,1307.6939,B\'ela Csaba,"B\'ela Csaba, Thomas A. Plick, Ali Shokoufandeh","Optimal Random Matchings, Tours, and Spanning Trees in Hierarchically
  Separated Trees","24 pages, to appear in TCS",,10.1016/j.tcs.2013.05.021,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We derive tight bounds on the expected weights of several combinatorial
optimization problems for random point sets of size $n$ distributed among the
leaves of a balanced hierarchically separated tree. We consider {\it
monochromatic} and {\it bichromatic} versions of the minimum matching, minimum
spanning tree, and traveling salesman problems. We also present tight
concentration results for the monochromatic problems.
","[{'version': 'v1', 'created': 'Fri, 26 Jul 2013 07:19:33 GMT'}]",2013-07-29,"[['Csaba', 'Béla', ''], ['Plick', 'Thomas A.', ''], ['Shokoufandeh', 'Ali', '']]","['hierarchically separated tree', 'Euclidean optimization', 'metric space']"
331,1705.04832,Renata Rychtarikova,"Renata Rychtarikova, Jan Urban, Dalibor Stys","Zampa's systems theory: a comprehensive theory of measurement in dynamic
  systems","16 pages, 9 figures","Acta Polytechnica 58(2), 128-143, 2018",10.14311/AP.2018.58.0128,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The article outlines in memoriam Prof. Pavel Zampa's concepts of system
theory which enable to devise a measurement in dynamic systems independently of
the particular system behaviour. From the point of view of Zampa's theory,
terms like system time, system attributes, system link, system element, input,
output, subsystems, and state variables are defined. In Conclusions, Zampa's
theory is discussed together with another mathematical approaches of
qualitative dynamics known since the 19th century. In Appendices, we present
applications of Zampa's technical approach to measurement of complex dynamical
(chemical and biological) systems at the Institute of Complex Systems,
University of South Bohemia in Ceske Budejovice.
","[{'version': 'v1', 'created': 'Sat, 13 May 2017 14:10:47 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Jun 2018 12:28:38 GMT'}]",2018-06-13,"[['Rychtarikova', 'Renata', ''], ['Urban', 'Jan', ''], ['Stys', 'Dalibor', '']]","['system theory', 'dynamic system', 'theory of measurement', 'complex systems', 'cybernetics']"
332,1606.06461,Dat Quoc Nguyen,"Dat Quoc Nguyen, Kairit Sirts, Lizhen Qu and Mark Johnson",Neighborhood Mixture Model for Knowledge Base Completion,"V1: In Proceedings of the 20th SIGNLL Conference on Computational
  Natural Language Learning, CoNLL 2016. V2: Corrected citation to (Krompa{\ss}
  et al., 2015). V3: A revised version of our CoNLL 2016 paper to update latest
  related work",,10.18653/v1/K16-1005,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge bases are useful resources for many natural language processing
tasks, however, they are far from complete. In this paper, we define a novel
entity representation as a mixture of its neighborhood in the knowledge base
and apply this technique on TransE-a well-known embedding model for knowledge
base completion. Experimental results show that the neighborhood information
significantly helps to improve the results of the TransE model, leading to
better performance than obtained by other state-of-the-art embedding models on
three benchmark datasets for triple classification, entity prediction and
relation prediction tasks.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2016 07:54:35 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Jul 2016 16:08:32 GMT'}, {'version': 'v3', 'created': 'Thu, 9 Mar 2017 12:51:31 GMT'}]",2017-03-10,"[['Nguyen', 'Dat Quoc', ''], ['Sirts', 'Kairit', ''], ['Qu', 'Lizhen', ''], ['Johnson', 'Mark', '']]","['Knowledge base completion', 'embedding model', 'mixture model', 'linkprediction', 'triple classification', 'entity prediction', 'relation prediction']"
333,1812.00992,Irene C\'ordoba,"Irene C\'ordoba, Juan de Lara","Ann: A domain-specific language for the effective design and validation
  of Java annotations","45 pages, 14 figures, 2016 journal publication. arXiv admin note:
  text overlap with arXiv:1807.03566","Computer Languages, Systems and Structures, 45:164-190, 2016",10.1016/j.cl.2016.02.002,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a new modelling language for the effective design and
validation of Java annotations. Since their inclusion in the 5th edition of
Java, annotations have grown from a useful tool for the addition of meta-data
to play a central role in many popular software projects. Usually they are not
conceived in isolation, but in groups, with dependency and integrity
constraints between them. However, the native support provided by Java for
expressing this design is very limited.
  To overcome its deficiencies and make explicit the rich conceptual model
which lies behind a set of annotations, we propose a domain-specific modelling
language. The proposal has been implemented as an Eclipse plug-in, including an
editor and an integrated code generator that synthesises annotation processors.
The environment also integrates a model finder, able to detect unsatisfiable
constraints between different annotations, and to provide examples of correct
annotation usages for validation. The language has been tested using a real set
of annotations from the Java Persistence API (JPA). Within this subset we have
found enough rich semantics expressible with Ann and omitted nowadays by the
Java language, which shows the benefits of Ann in a relevant field of
application.
","[{'version': 'v1', 'created': 'Sun, 2 Dec 2018 15:53:24 GMT'}]",2019-10-02,"[['Córdoba', 'Irene', ''], ['de Lara', 'Juan', '']]","['Model Driven Engineering', 'Domain-Specific Languages', 'Codegeneration', 'Java annotations', 'Model Finders']"
334,1602.08863,Lu\'is Cruz-Filipe,Lu\'is Cruz-Filipe and Fabrizio Montesi,Choreographies in Practice,,,10.1007/978-3-319-39570-8_8,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Choreographic Programming is a development methodology for concurrent
software that guarantees correctness by construction. The key to this paradigm
is to disallow mismatched I/O operations in programs, called choreographies,
and then mechanically synthesise distributed implementations in terms of
standard process models via a mechanism known as EndPoint Projection (EPP).
  Despite the promise of choreographic programming, there is still a lack of
practical evaluations that illustrate the applicability of choreographies to
concrete computational problems with standard concurrent solutions. In this
work, we explore the potential of choreographies by using Procedural
Choreographies (PC), a model that we recently proposed, to write distributed
algorithms for sorting (Quicksort), solving linear equations (Gaussian
elimination), and computing Fast Fourier Transform. We discuss the lessons
learned from this experiment, giving possible directions for the usage and
future improvements of choreography languages.
","[{'version': 'v1', 'created': 'Mon, 29 Feb 2016 08:49:49 GMT'}]",2017-08-09,"[['Cruz-Filipe', 'Luís', ''], ['Montesi', 'Fabrizio', '']]","['Choreographies', 'Correctness by Construction', 'DistributedAlgorithms']"
335,1903.09525,Fabio Calefato,"Fabio Calefato, Filippo Lanubile, Nicole Novielli, Luigi Quaranta",EMTk -- The Emotion Mining Toolkit,"Proceedings of the 4th International Workshop on Emotion Awareness in
  Software Engineering (SEmotion '19), May 2019, pp. 34-37",,10.1109/SEmotion.2019.00014,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Emotion Mining Toolkit (EMTk) is a suite of modules and datasets offering
a comprehensive solution for mining sentiment and emotions from technical text
contributed by developers on communication channels. The toolkit is written in
Java, Python, and R, and is released under the MIT open source license. In this
paper, we describe its architecture and the benchmark against the previous,
standalone versions of our sentiment analysis tools. Results show large
improvements in terms of speed.
","[{'version': 'v1', 'created': 'Fri, 22 Mar 2019 14:23:17 GMT'}, {'version': 'v2', 'created': 'Sun, 19 May 2019 07:13:22 GMT'}, {'version': 'v3', 'created': 'Mon, 12 Apr 2021 06:43:45 GMT'}]",2021-04-13,"[['Calefato', 'Fabio', ''], ['Lanubile', 'Filippo', ''], ['Novielli', 'Nicole', ''], ['Quaranta', 'Luigi', '']]","['sentiment analysis', 'emotion mining', 'social software']"
336,1811.01997,Ami Paz,"Keren Censor-Hillel, Ami Paz, Noam Ravid",The Sparsest Additive Spanner via Multiple Weighted BFS Trees,"Preliminary versions appeared in OPODIS 2018 conference and in TCS
  journal",,10.1016/j.tcs.2020.05.035,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spanners are fundamental graph structures that sparsify graphs at the cost of
small stretch. In particular, in recent years, many sequential algorithms
constructing additive all-pairs spanners were designed, providing very sparse
small-stretch subgraphs. Remarkably, it was then shown that the known
(+6)-spanner constructions are essentially the sparsest possible, that is, a
larger additive stretch cannot guarantee a sparser spanner, which brought the
stretch-sparsity trade-off to its limit. Distributed constructions of spanners
are also abundant. However, for additive spanners, while there were algorithms
constructing (+2) and (+4)-all-pairs spanners, the sparsest case of
(+6)-spanners remained elusive.
  We remedy this by designing a new sequential algorithm for constructing a
(+6)-spanner with the essentially-optimal sparsity of roughly O(n^{4/3}) edges.
We then show a distributed implementation of our algorithm, answering an open
problem in [Censor-Hillel et al., DISC 2016].
  A main ingredient in our distributed algorithm is an efficient construction
of multiple weighted BFS trees. A weighted BFS tree is a BFS tree in a weighted
graph, that consists of the lightest among all shortest paths from the root to
each node. We present a distributed algorithm in the CONGEST model, that
constructs multiple weighted BFS trees in |S|+D-1 rounds, where S is the set of
sources and D is the diameter of the network graph.
","[{'version': 'v1', 'created': 'Mon, 5 Nov 2018 19:44:50 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Jun 2020 14:20:52 GMT'}]",2020-06-03,"[['Censor-Hillel', 'Keren', ''], ['Paz', 'Ami', ''], ['Ravid', 'Noam', '']]","['Distributed graph algorithms', 'congest model', 'weighted BFS trees', 'additivespanners']"
337,1112.0647,Christoph Koutschan,"Christoph Koutschan and Thotsaporn ""Aek"" Thanatipanonda",Advanced Computer Algebra for Determinants,16 pages,"Annals of Combinatorics 17(3), 509-523, 2013",10.1007/s00026-013-0183-8,,cs.SC math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove three conjectures concerning the evaluation of determinants, which
are related to the counting of plane partitions and rhombus tilings. One of
them was posed by George Andrews in 1980, the other two were by Guoce Xin and
Christian Krattenthaler. Our proofs employ computer algebra methods, namely,
the holonomic ansatz proposed by Doron Zeilberger and variations thereof. These
variations make Zeilberger's original approach even more powerful and allow for
addressing a wider variety of determinants. Finally, we present, as a challenge
problem, a conjecture about a closed-form evaluation of Andrews's determinant.
","[{'version': 'v1', 'created': 'Sat, 3 Dec 2011 11:26:40 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Apr 2012 12:54:58 GMT'}, {'version': 'v3', 'created': 'Fri, 16 Aug 2013 11:38:25 GMT'}]",2013-08-19,"[['Koutschan', 'Christoph', ''], ['Thanatipanonda', 'Thotsaporn ""Aek""', '']]","['determinant', 'computer algebra', 'holonomic ansatz', 'rhombustiling']"
338,0810.1773,Amir Leshem,"Eitan Sayag, Amir Leshem, Nikolaos D. Sidiropoulos","Finite Word Length Effects on Transmission Rate in Zero Forcing Linear
  Precoding for Multichannel DSL",,,10.1109/TSP.2009.2012889,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crosstalk interference is the limiting factor in transmission over copper
lines. Crosstalk cancelation techniques show great potential for enabling the
next leap in DSL transmission rates. An important issue when implementing
crosstalk cancelation techniques in hardware is the effect of finite world
length on performance. In this paper we provide an analysis of the performance
of linear zero-forcing precoders, used for crosstalk compensation, in the
presence of finite word length errors. We quantify analytically the trade off
between precoder word length and transmission rate degradation. More
specifically, we prove a simple formula for the transmission rate loss as a
function of the number of bits used for precoding, the signal to noise ratio,
and the standard line parameters. We demonstrate, through simulations on real
lines, the accuracy of our estimates. Moreover, our results are stable in the
presence of channel estimation errors. Finally, we show how to use these
estimates as a design tool for DSL linear crosstalk precoders. For example, we
show that for standard VDSL2 precoded systems, 14 bits representation of the
precoder entries results in capacity loss below 1% for lines over 300m.
","[{'version': 'v1', 'created': 'Thu, 9 Oct 2008 22:40:14 GMT'}]",2009-11-13,"[['Sayag', 'Eitan', ''], ['Leshem', 'Amir', ''], ['Sidiropoulos', 'Nikolaos D.', '']]","['Multichannel DSL', 'vectoring', 'linear precoding', 'capacity estimates', 'quantization']"
339,1308.5811,Kyeong Soo (Joseph) Kim,"Kyeong Soo Kim, Karin Ennser, Yogesh K. Dwivedi",Clean-Slate Design of Next-Generation Optical Access,"4 pages, 3 figures",,10.1109/ICTON.2011.5970910,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We report the current status of our research on the clean-slate design of
next-generation optical access (NGOA). We have been studying candidate
architectures with a major focus on their elasticity to user demands, energy
efficiency, and support of better Quality of Experience (QoE). One of the major
challenges in this study is to establish a comparative analysis framework where
we can assess the performances of candidate architectures in an objective and
quantifiable way. In this paper we describe our efforts to meet this challenge:
(1) the development of a new comparison framework based on integrated QoE and
statistical hypothesis testing and (2) the implementation of a virtual test bed
capturing important aspects from physical layer to application layer to
end-user behaviour governing traffic generation. The comparison framework and
the virtual test bed will provide researchers a sound basis and useful tools
for comparative analysis in the clean-slate design of NGOA.
","[{'version': 'v1', 'created': 'Tue, 27 Aug 2013 09:49:33 GMT'}]",2014-03-25,"[['Kim', 'Kyeong Soo', ''], ['Ennser', 'Karin', ''], ['Dwivedi', 'Yogesh K.', '']]","['Optical access', 'clean-slate design', 'virtual test bed', 'comparison framework', 'energy efficiency']"
340,1504.01039,Jeremy Kepner,"Jeremy Kepner, David Bade, Ayd{\i}n Buluc, John Gilbert, Timothy
  Mattson, Henning Meyerhenke","Graphs, Matrices, and the GraphBLAS: Seven Good Reasons","10 pages; International Conference on Computational Science workshop
  on the Applications of Matrix Computational Methods in the Analysis of Modern
  Data","Procedia Computer Science Volume 51, 2015, Pages 2453-2462,
  International Conference On Computational Science",10.1016/j.procs.2015.05.353,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The analysis of graphs has become increasingly important to a wide range of
applications. Graph analysis presents a number of unique challenges in the
areas of (1) software complexity, (2) data complexity, (3) security, (4)
mathematical complexity, (5) theoretical analysis, (6) serial performance, and
(7) parallel performance. Implementing graph algorithms using matrix-based
approaches provides a number of promising solutions to these challenges. The
GraphBLAS standard (istc- bigdata.org/GraphBlas) is being developed to bring
the potential of matrix based graph algorithms to the broadest possible
audience. The GraphBLAS mathematically defines a core set of matrix-based graph
operations that can be used to implement a wide class of graph algorithms in a
wide range of programming environments. This paper provides an introduction to
the GraphBLAS and describes how the GraphBLAS can be used to address many of
the challenges associated with analysis of graphs.
","[{'version': 'v1', 'created': 'Sat, 4 Apr 2015 19:11:38 GMT'}]",2016-06-21,"[['Kepner', 'Jeremy', ''], ['Bade', 'David', ''], ['Buluc', 'Aydın', ''], ['Gilbert', 'John', ''], ['Mattson', 'Timothy', ''], ['Meyerhenke', 'Henning', '']]","['graphs', 'algorithms', 'matrices', 'linear algebra', 'software standards']"
341,2003.13633,Francisco \'Alvarez,"F. Mart\'inez-\'Alvarez, G. Asencio-Cort\'es, J. F. Torres, D.
  Guti\'errez-Avil\'es, L. Melgar-Garc\'ia, R. P\'erez-Chac\'on, C.
  Rubio-Escudero, J. C. Riquelme, A. Troncoso","Coronavirus Optimization Algorithm: A bioinspired metaheuristic based on
  the COVID-19 propagation model","30 pages, 4 figures",,10.1089/big.2020.0051,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel bioinspired metaheuristic is proposed in this work, simulating how
the coronavirus spreads and infects healthy people. From an initial individual
(the patient zero), the coronavirus infects new patients at known rates,
creating new populations of infected people. Every individual can either die or
infect and, afterwards, be sent to the recovered population. Relevant terms
such as re-infection probability, super-spreading rate or traveling rate are
introduced in the model in order to simulate as accurately as possible the
coronavirus activity. The Coronavirus Optimization Algorithm has two major
advantages compared to other similar strategies. First, the input parameters
are already set according to the disease statistics, preventing researchers
from initializing them with arbitrary values. Second, the approach has the
ability of ending after several iterations, without setting this value either.
Infected population initially grows at an exponential rate but after some
iterations, when considering social isolation measures and the high number
recovered and dead people, the number of infected people starts decreasing in
subsequent iterations. Furthermore, a parallel multi-virus version is proposed
in which several coronavirus strains evolve over time and explore wider search
space areas in less iterations. Finally, the metaheuristic has been combined
with deep learning models, in order to find optimal hyperparameters during the
training phase. As application case, the problem of electricity load time
series forecasting has been addressed, showing quite remarkable performance.
","[{'version': 'v1', 'created': 'Mon, 30 Mar 2020 17:10:02 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Apr 2020 11:28:04 GMT'}]",2020-08-03,"[['Martínez-Álvarez', 'F.', ''], ['Asencio-Cortés', 'G.', ''], ['Torres', 'J. F.', ''], ['Gutiérrez-Avilés', 'D.', ''], ['Melgar-García', 'L.', ''], ['Pérez-Chacón', 'R.', ''], ['Rubio-Escudero', 'C.', ''], ['Riquelme', 'J. C.', ''], ['Troncoso', 'A.', '']]","['Metaheuristics', 'soft computing', 'deep learning', 'Coronavirus']"
342,1306.1773,Daniel Graziotin,"Daniel Graziotin and Pekka Abrahamsson (Free University of
  Bozen-Bolzano)","Making Sense out of a Jungle of JavaScript Frameworks: towards a
  Practitioner-friendly Comparative Analysis","5 Pages, 1 Figure. The final publication is available at
  link.springer.com. Link:
  http://link.springer.com/chapter/10.1007/978-3-642-39259-7_28. DOI:
  10.1007/978-3-642-39259-7_28","Proceedings of the 14th International Conference on
  Product-Focused Software Process Improvement (PROFES 2013), LNCS 7983,
  Springer-Verlag, pp. 334-337, 2013",10.1007/978-3-642-39259-7_28,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The field of Web development is entering the HTML5 and CSS3 era and
JavaScript is becoming increasingly influential. A large number of JavaScript
frameworks have been recently promoted. Practitioners applying the latest
technologies need to choose a suitable JavaScript framework (JSF) in order to
abstract the frustrating and complicated coding steps and to provide a
cross-browser compatibility. Apart from benchmark suites and recommendation
from experts, there is little research helping practitioners to select the most
suitable JSF to a given situation. The few proposals employ software metrics on
the JSF, but practitioners are driven by different concerns when choosing a
JSF. As an answer to the critical needs, this paper is a call for action. It
proposes a re-search design towards a comparative analysis framework of JSF,
which merges researcher needs and practitioner needs.
","[{'version': 'v1', 'created': 'Fri, 7 Jun 2013 16:53:24 GMT'}]",2013-06-10,"[['Graziotin', 'Daniel', '', 'Free University of\n  Bozen-Bolzano'], ['Abrahamsson', 'Pekka', '', 'Free University of\n  Bozen-Bolzano']]","['Web Development', 'JavaScript Framework', 'Comparative Analysis']"
343,1509.07326,Pascal Potvin,"Pascal Potvin, Mario Bonja, Gordon Bailey, Pierre Busnel",An IMS DSL Developed at Ericsson,"19 pages, 2 figures, 1 table, oral presentation at SDL 2013:
  Model-Driven Dependability Engineering conference","SDL 2013: Model-Driven Dependability Engineering Volume 7916 of
  the series Lecture Notes in Computer Science pp 144-162",10.1007/978-3-642-38911-5,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present how we created a Domain Specific Language (DSL)
dedicated to IP Multimedia Subsystem (IMS) at Ericsson. First, we introduce IMS
and how developers are burdened by its complexity when integrating it in their
application. Then we describe the principles we followed to create our new IMS
DSL from its core in the Scala language to its syntax. We then present how we
integrated it in two existing projects and show how it can save time for
developers and how readable the syntax of the IMS DSL is.
","[{'version': 'v1', 'created': 'Thu, 24 Sep 2015 11:46:20 GMT'}]",2015-09-28,"[['Potvin', 'Pascal', ''], ['Bonja', 'Mario', ''], ['Bailey', 'Gordon', ''], ['Busnel', 'Pierre', '']]","['Domain Specific Language', 'IP Multimedia System', 'application development', 'industrial experience']"
344,1703.08698,Sajal Mukhopadhyay,"Vikash Kumar Singh, Sajal Mukhopadhyay, Aniruddh Sharma, Arpan Roy",Hiring Expert Consultants in E-Healthcare: A Two Sided Matching Approach,"33 pages, 9 figures","Trans. on Computational Collective Intelligence, vol 11120, 2018,
  pp. 178-199",10.1007/978-3-319-99810-7_9,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Very often in some censorious healthcare scenario, there may be a need to
have some expert consultancies (especially by doctors) that are not available
in-house to the hospital. With the advancement in technologies (such as video
conferencing, smartphone, etc.), it has become reality that, for the critical
medical cases in the hospitals, expert consultants (ECs) from around the world
could be hired, who will serve the patients by their physical or virtual
presence. Earlier, this interesting healthcare scenario of hiring the ECs
(mainly doctors) from outside of the hospitals had been studied with the robust
concepts of mechanism design with or without money. We have tried to model the
ECs (mainly doctors) hiring problem as a two-sided matching problem. In this
paper, for the first time, to the best of our knowledge, we explore the more
realistic two-sided matching in our set-up, where the members of the two
participating communities, namely patients and doctors are revealing the strict
preference ordering over all the members of the opposite community for a
stipulated amount of time. We assume that patients and doctors are strategic in
nature. With the theoretical analysis, we demonstrate that the proposed
mechanism that results in a stable allocation of doctors to patients is
strategy-proof (or truthful) and optimal. The proposed mechanism is also
validated with exhaustive experiments.
","[{'version': 'v1', 'created': 'Sat, 25 Mar 2017 14:39:40 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Sep 2017 10:59:41 GMT'}]",2018-10-18,"[['Singh', 'Vikash Kumar', ''], ['Mukhopadhyay', 'Sajal', ''], ['Sharma', 'Aniruddh', ''], ['Roy', 'Arpan', '']]","['E-Healthcare', 'hiring ECs', 'DSIC', 'mechanism design', 'stable allocation']"
345,2110.01848,Xin Zhang,"Xin Zhang, Xiujun Shu, Bingwen Zhang, Jie Ren, Lizhou Zhou, Xin Chen","Cellular Network Radio Propagation Modeling with Deep Convolutional
  Neural Networks",,"Proceedings of the 26th ACM SIGKDD International Conference on
  Knowledge Discovery and Data Mining, August, 2020, Pages 2378",,,cs.IT cs.AI cs.LG math.IT,http://creativecommons.org/licenses/by/4.0/,"  Radio propagation modeling and prediction is fundamental for modern cellular
network planning and optimization. Conventional radio propagation models fall
into two categories. Empirical models, based on coarse statistics, are simple
and computationally efficient, but are inaccurate due to oversimplification.
Deterministic models, such as ray tracing based on physical laws of wave
propagation, are more accurate and site specific. But they have higher
computational complexity and are inflexible to utilize site information other
than traditional global information system (GIS) maps.
  In this article we present a novel method to model radio propagation using
deep convolutional neural networks and report significantly improved
performance compared to conventional models. We also lay down the framework for
data-driven modeling of radio propagation and enable future research to utilize
rich and unconventional information of the site, e.g. satellite photos, to
provide more accurate and flexible models.
","[{'version': 'v1', 'created': 'Tue, 5 Oct 2021 07:20:48 GMT'}]",2021-10-06,"[['Zhang', 'Xin', ''], ['Shu', 'Xiujun', ''], ['Zhang', 'Bingwen', ''], ['Ren', 'Jie', ''], ['Zhou', 'Lizhou', ''], ['Chen', 'Xin', '']]","['radio propagation', 'deep convolutional neural networks', 'path loss']"
346,0806.4510,Casper Thomsen,"Olav Geil, Ryutaroh Matsumoto, Casper Thomsen",On Field Size and Success Probability in Network Coding,"16 pages, 3 figures, 2 tables. Accepted for publication at
  International Workshop on the Arithmetic of Finite Fields, WAIFI 2008","Proceedings of the 2nd International Workshop on the Arithmetic of
  Finite Fields, WAIFI 2008, pp. 157-173",10.1007/978-3-540-69499-1_14,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using tools from algebraic geometry and Groebner basis theory we solve two
problems in network coding. First we present a method to determine the smallest
field size for which linear network coding is feasible. Second we derive
improved estimates on the success probability of random linear network coding.
These estimates take into account which monomials occur in the support of the
determinant of the product of Edmonds matrices. Therefore we finally
investigate which monomials can occur in the determinant of the Edmonds matrix.
","[{'version': 'v1', 'created': 'Fri, 27 Jun 2008 13:05:32 GMT'}]",2008-09-04,"[['Geil', 'Olav', ''], ['Matsumoto', 'Ryutaroh', ''], ['Thomsen', 'Casper', '']]","['Distributed networking', 'linear network coding', 'multicast', 'network coding', 'random network coding']"
347,1807.06087,Sebastian Baltes,Sebastian Baltes and Stephan Diehl,Towards a Theory of Software Development Expertise,"14 pages, 5 figures, 26th ACM Joint European Software Engineering
  Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE
  2018), ACM, 2018",,10.1145/3236024.3236061,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software development includes diverse tasks such as implementing new
features, analyzing requirements, and fixing bugs. Being an expert in those
tasks requires a certain set of skills, knowledge, and experience. Several
studies investigated individual aspects of software development expertise, but
what is missing is a comprehensive theory. We present a first conceptual theory
of software development expertise that is grounded in data from a mixed-methods
survey with 335 software developers and in literature on expertise and expert
performance. Our theory currently focuses on programming, but already provides
valuable insights for researchers, developers, and employers. The theory
describes important properties of software development expertise and which
factors foster or hinder its formation, including how developers' performance
may decline over time. Moreover, our quantitative results show that developers'
expertise self-assessments are context-dependent and that experience is not
necessarily related to expertise.
","[{'version': 'v1', 'created': 'Mon, 16 Jul 2018 20:09:25 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Aug 2018 10:46:55 GMT'}, {'version': 'v3', 'created': 'Tue, 9 Oct 2018 11:14:53 GMT'}, {'version': 'v4', 'created': 'Sun, 4 Nov 2018 02:05:32 GMT'}]",2018-11-06,"[['Baltes', 'Sebastian', ''], ['Diehl', 'Stephan', '']]","['software engineering', 'expertise', 'theory', 'psychology']"
348,1305.1396,Marcelo Fiori,"Mat\'ias Di Martino, Guzman Hern\'andez, Marcelo Fiori, Alicia
  Fern\'andez",A new framework for optimal classifier design,,"Pattern Recognition, Volume 46, Issue 8, August 2013, Pages
  2249-2255",10.1016/j.patcog.2013.01.006,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of alternative measures to evaluate classifier performance is gaining
attention, specially for imbalanced problems. However, the use of these
measures in the classifier design process is still unsolved. In this work we
propose a classifier designed specifically to optimize one of these alternative
measures, namely, the so-called F-measure. Nevertheless, the technique is
general, and it can be used to optimize other evaluation measures. An algorithm
to train the novel classifier is proposed, and the numerical scheme is tested
with several databases, showing the optimality and robustness of the presented
classifier.
","[{'version': 'v1', 'created': 'Tue, 7 May 2013 04:05:24 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Sep 2013 16:09:55 GMT'}]",2013-09-13,"[['Di Martino', 'Matías', ''], ['Hernández', 'Guzman', ''], ['Fiori', 'Marcelo', ''], ['Fernández', 'Alicia', '']]","['Class Imbalance', 'One Class SVM', 'F-measure', 'Recall', 'Precision', 'Fraud Detection', 'Level Set Method']"
349,1607.05088,Giorgio Roffo,Giorgio Roffo,Towards Personality-Aware Recommendation,"This paper is an overview of Personality in Computational
  Advertising: A Benchmark, G. Roffo, ACM RecSys workshop on Emotions and
  Personality in Personalized Systems, (EMPIRE 2016)",,10.13140/RG.2.1.4167.0649,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last decade new ways of shopping online have increased the possibility
of buying products and services more easily and faster than ever. In this new
context, personality is a key determinant in the decision making of the
consumer when shopping. The two main reasons are: firstly, a person's buying
choices are influenced by psychological factors like impulsiveness, and
secondly, some consumers may be more susceptible to making impulse purchases
than others. To the best of our knowledge, the impact of personality factors on
advertisements has been largely neglected at the level of recommender systems.
This work proposes a highly innovative research which uses a personality
perspective to determine the unique associations among the consumer's buying
tendency and advert recommendations. As a matter of fact, the lack of a
publicly available benchmark for computational advertising do not allow both
the exploration of this intriguing research direction and the evaluation of
state-of-the-art algorithms. We present the ADS Dataset, a publicly available
benchmark for computational advertising enriched with Big-Five users'
personality factors and 1,200 personal users' pictures. The proposed benchmark
allows two main tasks: rating prediction over 300 real advertisements (i.e.,
Rich Media Ads, Image Ads, Text Ads) and click-through rate prediction.
Moreover, this work carries out experiments, reviews various evaluation
criteria used in the literature, and provides a library for each one of them
within one integrated toolbox.
","[{'version': 'v1', 'created': 'Mon, 18 Jul 2016 14:08:20 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Jul 2016 11:06:03 GMT'}, {'version': 'v3', 'created': 'Sat, 23 Jul 2016 09:45:57 GMT'}]",2016-07-26,"[['Roffo', 'Giorgio', '']]","['Ads Click Prediction', 'Ads Rating Prediction', 'Computational Advertising', 'Online Advertising', 'Affective Computing']"
350,1512.08047,Omar Al-Kadi,Omar Sultan Al-Kadi,"Assessment of texture measures susceptibility to noise in conventional
  and contrast enhanced computed tomography lung tumour images","10 pages, 9 figures","Computerized Medical Imaging and Graphics, vol.34, pp.494-503,
  2010",10.1016/j.compmedimag.2009.12.011,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Noise is one of the major problems that hinder an effective texture analysis
of disease in medical images, which may cause variability in the reported
diagnosis. In this paper seven texture measurement methods (two wavelet, two
model and three statistical based) were applied to investigate their
susceptibility to subtle noise caused by acquisition and reconstruction
deficiencies in computed tomography (CT) images. Features of lung tumours were
extracted from two different conventional and contrast enhanced CT image
data-sets under filtered and noisy conditions. When measuring the noise in the
background open-air region of the analysed CT images, noise of Gaussian and
Rayleigh distributions with varying mean and variance was encountered, and
Fisher distance was used to differentiate between an original extracted lung
tumour region of interest (ROI) with the filtered and noisy reconstructed
versions. It was determined that the wavelet packet (WP) and fractal dimension
measures were the least affected, while the Gaussian Markov random field,
run-length and co-occurrence matrices were the most affected by noise.
Depending on the selected ROI size, it was concluded that texture measures with
fewer extracted features can decrease susceptibility to noise, with the WP and
the Gabor filter having a stable performance in both filtered and noisy CT
versions and for both data-sets. Knowing how robust each texture measure under
noise presence is can assist physicians using an automated lung texture
classification system in choosing the appropriate feature extraction algorithm
for a more accurate diagnosis.
","[{'version': 'v1', 'created': 'Fri, 25 Dec 2015 23:00:45 GMT'}]",2015-12-29,"[['Al-Kadi', 'Omar Sultan', '']]","['texture analysis', 'feature extraction', 'CT image noise', 'contrast enhanced CT', 'lung tumour']"
351,1307.3005,Sayed Amir Hoseini,Sayed Amir Hoseini and Mohammad Reza Ashraf,"Computational Complexity Comparison Of Multi-Sensor Single Target Data
  Fusion Methods By Matlab",,,10.5121/ijccms.2013.2201,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Target tracking using observations from multiple sensors can achieve better
estimation performance than a single sensor. The most famous estimation tool in
target tracking is Kalman filter. There are several mathematical approaches to
combine the observations of multiple sensors by use of Kalman filter. An
important issue in applying a proper approach is computational complexity. In
this paper, four data fusion algorithms based on Kalman filter are considered
including three centralized and one decentralized methods. Using MATLAB,
computational loads of these methods are compared while number of sensors
increases. The results show that inverse covariance method has the best
computational performance if the number of sensors is above 20. For a smaller
number of sensors, other methods, especially group sensors, are more
appropriate..
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2013 07:52:08 GMT'}]",2013-07-12,"[['Hoseini', 'Sayed Amir', ''], ['Ashraf', 'Mohammad Reza', '']]","['Data fusion', 'Target Tracking', 'Kalman Filter', 'Multi-sensor', 'MATLAB']"
352,1308.5952,Sergey Dolgov,S. V. Dolgov and A. P. Smirnov and E. E. Tyrtyshnikov,"Low-rank approximation in the numerical modeling of the Farley-Buneman
  instability in ionospheric plasma",,,10.1016/j.jcp.2014.01.029,,cs.NA math.NA physics.comp-ph physics.plasm-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the numerical modeling of the Farley-Buneman instability
development in the earth's ionosphere plasma. The ion behavior is governed by
the kinetic Landau equation in the four-dimensional phase space, and since the
finite difference discretization on a tensor product grid is used, this
equation becomes the most computationally challenging part of the scheme. To
relax the complexity and memory consumption, an adaptive model reduction using
the low-rank separation of variables, namely the Tensor Train format, is
employed.
  The approach was verified via the prototype MATLAB implementation. Numerical
experiments demonstrate the possibility of efficient separation of space and
velocity variables, resulting in the solution storage reduction by a factor of
order tens.
","[{'version': 'v1', 'created': 'Tue, 27 Aug 2013 19:14:09 GMT'}]",2014-03-05,"[['Dolgov', 'S. V.', ''], ['Smirnov', 'A. P.', ''], ['Tyrtyshnikov', 'E. E.', '']]","['high–dimensional problems', 'DMRG', 'MPS', 'tensor trainformat', 'ionospheric irregularities', 'plasma waves and instabilities', 'Vlasovequation', 'hybrid methods']"
353,1101.3859,Mohammed Sqalli Dr.,"Mohammed H. Sqalli, Sadiq M. Sait, and Syed Asadullah",OSPF Weight Setting Optimization for Single Link Failures,,"International Journal of Computer Networks & Communications
  (IJCNC), pp:168-183, Vol. 3, No. 1, January 2011",10.5121/ijcnc.2011.3111,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In operational networks, nodes are connected via multiple links for load
sharing and redundancy. This is done to make sure that a failure of a link does
not disconnect or isolate some parts of the network. However, link failures
have an effect on routing, as the routers find alternate paths for the traffic
originally flowing through the link which has failed. This effect is severe in
case of failure of a critical link in the network, such as backbone links or
the links carrying higher traffic loads. When routing is done using the Open
Shortest Path First (OSPF) routing protocol, the original weight selection for
the normal state topology may not be as efficient for the failure state. In
this paper, we investigate the single link failure issue with an objective to
find a weight setting which results in efficient routing in normal and failure
states. We engineer Tabu Search Iterative heuristic using two different
implementation strategies to solve the OSPF weight setting problem for link
failure scenarios. We evaluate these heuristics and show through experimental
results that both heuristics efficiently handle weight setting for the failure
state. A comparison of both strategies is also presented.
","[{'version': 'v1', 'created': 'Thu, 20 Jan 2011 09:54:07 GMT'}]",2011-01-21,"[['Sqalli', 'Mohammed H.', ''], ['Sait', 'Sadiq M.', ''], ['Asadullah', 'Syed', '']]","['Routing', 'Open Shortest Path First (OSPF)', 'OSPF Weight Setting Problem', 'Iterative Heuristics', 'Link Failure', 'Tabu Search']"
354,1908.00112,Jia-Huai You,"David Spies, Jia-Huai You, Ryan Hayward",Domain-Independent Cost-Optimal Planning in ASP,"Paper presented at the 35th International Conference on Logic
  Programming (ICLP 2019), Las Cruces, New Mexico, USA, 20-25 September 2019,
  16 pages",Theory and Practice of Logic Programming 19 (2019) 1124-1142,10.1017/S1471068419000395,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the problem of cost-optimal planning in ASP. Current ASP
planners can be trivially extended to a cost-optimal one by adding weak
constraints, but only for a given makespan (number of steps). It is desirable
to have a planner that guarantees global optimality. In this paper, we present
two approaches to addressing this problem. First, we show how to engineer a
cost-optimal planner composed of two ASP programs running in parallel. Using
lessons learned from this, we then develop an entirely new approach to
cost-optimal planning, stepless planning, which is completely free of makespan.
Experiments to compare the two approaches with the only known cost-optimal
planner in SAT reveal good potentials for stepless planning in ASP. The paper
is under consideration for acceptance in TPLP.
","[{'version': 'v1', 'created': 'Wed, 31 Jul 2019 21:42:24 GMT'}]",2020-02-19,"[['Spies', 'David', ''], ['You', 'Jia-Huai', ''], ['Hayward', 'Ryan', '']]","['Cost-Optimal Planning', 'Answer Set Programming', 'CORE-2 ASP Standard']"
355,1701.00400,Jerome Darmont,"Zhen He, J\'er\^ome Darmont (ERIC)",Evaluating the Dynamic Behavior of Database Applications,arXiv admin note: text overlap with arXiv:0705.1454,"Journal of Database Management, IGI Global, 2005, 16 (2), pp.21 -
  45",10.4018/jdm.2005040102,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper explores the effect that changing access patterns has on the
performance of database management systems. Changes in access patterns play an
important role in determining the efficiency of key performance optimization
techniques, such as dynamic clustering, prefetching, and buffer replacement.
However, all existing benchmarks or evaluation frameworks produce static access
patterns in which objects are always accessed in the same order repeatedly.
Hence, we have proposed the Dynamic Evaluation Framework (DEF) that simulates
access pattern changes using configurable styles of change. DEF has been
designed to be open and fully extensible (e.g., new access pattern change
models can be added easily). In this paper, we instantiate DEF into the Dynamic
object Evaluation Framework (DoEF) which is designed for object databases,
i.e., object-oriented or object-relational databases such as multi-media
databases or most XML databases.The capabilities of DoEF have been evaluated by
simulating the execution of four different dynamic clustering algorithms. The
results confirm our analysis that flexible conservative re-clustering is the
key in determining a clustering algorithm's ability to adapt to changes in
access pattern. These results show the effectiveness of DoEF at determining the
adaptability of each dynamic clustering algorithm to changes in access pattern
in a simulation environment. In a second set of experiments, we have used DoEF
to compare the performance of two real-life object stores : Platypus and SHORE.
DoEF has helped to reveal the poor swapping performance of Platypus.
","[{'version': 'v1', 'created': 'Mon, 2 Jan 2017 14:20:12 GMT'}]",2017-01-03,"[['He', 'Zhen', '', 'ERIC'], ['Darmont', 'Jérôme', '', 'ERIC']]","['Performance evaluation', 'Dynamic access patterns', 'Benchmarking', 'Object-oriented']"
356,1809.03100,EPTCS,"Michele Chiari (DEIB, Politecnico di Milano), Dino Mandrioli (DEIB,
  Politecnico di Milano), Matteo Pradella (DEIB, Politecnico di Milano, and
  IEIIT, Consiglio Nazionale delle Ricerche)",Temporal Logic and Model Checking for Operator Precedence Languages,"In Proceedings GandALF 2018, arXiv:1809.02416","EPTCS 277, 2018, pp. 161-175",10.4204/EPTCS.277.12,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last decades much research effort has been devoted to extending the
success of model checking from the traditional field of finite state machines
and various versions of temporal logics to suitable subclasses of context-free
languages and appropriate extensions of temporal logics. To the best of our
knowledge such attempts only covered structured languages, i.e. languages whose
structure is immediately ""visible"" in their sentences, such as tree-languages
or visibly pushdown ones. In this paper we present a new temporal logic
suitable to express and automatically verify properties of operator precedence
languages. This ""historical"" language family has been recently proved to enjoy
fundamental algebraic and logic properties that make it suitable for model
checking applications yet breaking the barrier of visible-structure languages
(in fact the original motivation of its inventor Floyd was just to support
efficient parsing, i.e. building the ""hidden syntax tree"" of language
sentences). We prove that our logic is at least as expressive as analogous
logics defined for visible pushdown languages yet covering a much more powerful
family; we design a procedure that, given a formula in our logic builds an
automaton recognizing the sentences satisfying the formula, whose size is at
most exponential in the length of the formula.
","[{'version': 'v1', 'created': 'Mon, 10 Sep 2018 02:32:56 GMT'}]",2018-09-11,"[['Chiari', 'Michele', '', 'DEIB, Politecnico di Milano'], ['Mandrioli', 'Dino', '', 'DEIB,\n  Politecnico di Milano'], ['Pradella', 'Matteo', '', 'DEIB, Politecnico di Milano, and\n  IEIIT, Consiglio Nazionale delle Ricerche']]","['Operator Precedence Languages', 'Visibly Pushdown Languages', 'Input Driven Languages', 'Linear Temporal Logic', 'Model Checking']"
357,1212.1798,Nizar Rokbani,Nizar Rokbani and Adel M Alimi,"IK-PSO, PSO Inverse Kinematics Solver with Application to Biped Gait
  Generation","7 pages, 7 figures, ""Published with International Journal of Computer
  Applications (IJCA)""","International Journal of Computer applications (IJCA) 58 (22),
  33-39 (2012)",10.5120/9432-3844,,cs.RO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a new approach allowing the generation of a simplified
Biped gait. This approach combines a classical dynamic modeling with an inverse
kinematics' solver based on particle swarm optimization, PSO. First, an
inverted pendulum, IP, is used to obtain a simplified dynamic model of the
robot and to compute the target position of a key point in biped locomotion,
the Centre Of Mass, COM. The proposed algorithm, called IK-PSO, Inverse
Kinematics PSO, returns and inverse kinematics solution corresponding to that
COM respecting the joints constraints. In This paper the inertia weight PSO
variant is used to generate a possible solution according to the stability
based fitness function and a set of joints motions constraints. The method is
applied with success to a leg motion generation. Since based on a
pre-calculated COM, that satisfied the biped stability, the proposal allowed
also to plan a walk with application on a small size biped robot.
","[{'version': 'v1', 'created': 'Sat, 8 Dec 2012 14:45:54 GMT'}]",2013-01-08,"[['Rokbani', 'Nizar', ''], ['Alimi', 'Adel M', '']]","['Biped robotics', 'Gait generation', 'Particle Swarm Optimization', 'Inverse kinematics.  Inertia weight PSO']"
358,1610.01922,Mohamad Ivan Fanany,"Arif Budiman, Mohamad Ivan Fanany, Chan Basaruddin",Adaptive Online Sequential ELM for Concept Drift Tackling,"Hindawi Publishing. Computational Intelligence and Neuroscience
  Volume 2016 (2016), Article ID 8091267, 17 pages Received 29 January 2016,
  Accepted 17 May 2016. Special Issue on ""Advances in Neural Networks and
  Hybrid-Metaheuristics: Theory, Algorithms, and Novel Engineering
  Applications"". Academic Editor: Stefan Haufe","Computational Intelligence and Neuroscience Volume 2016 (2016),
  Article ID 8091267, 17 pages",10.1155/2016/8091267,8091267,cs.AI cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A machine learning method needs to adapt to over time changes in the
environment. Such changes are known as concept drift. In this paper, we propose
concept drift tackling method as an enhancement of Online Sequential Extreme
Learning Machine (OS-ELM) and Constructive Enhancement OS-ELM (CEOS-ELM) by
adding adaptive capability for classification and regression problem. The
scheme is named as adaptive OS-ELM (AOS-ELM). It is a single classifier scheme
that works well to handle real drift, virtual drift, and hybrid drift. The
AOS-ELM also works well for sudden drift and recurrent context change type. The
scheme is a simple unified method implemented in simple lines of code. We
evaluated AOS-ELM on regression and classification problem by using concept
drift public data set (SEA and STAGGER) and other public data sets such as
MNIST, USPS, and IDS. Experiments show that our method gives higher kappa value
compared to the multiclassifier ELM ensemble. Even though AOS-ELM in practice
does not need hidden nodes increase, we address some issues related to the
increasing of the hidden nodes such as error condition and rank values. We
propose taking the rank of the pseudoinverse matrix as an indicator parameter
to detect underfitting condition.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2016 16:08:52 GMT'}]",2016-10-10,"[['Budiman', 'Arif', ''], ['Fanany', 'Mohamad Ivan', ''], ['Basaruddin', 'Chan', '']]","['adaptive', 'concept drift', 'extreme learning machine', 'online sequential']"
359,1809.00223,Carlos Vega,"Carlos Vega Moreno, Eduardo Miravalls Sierra, Guillermo Juli\'an
  Moreno, Jorge E. L\'opez de Vergara, Eduardo Maga\~na, Javier Aracil","Evaluation of the performance challenges in automatic traffic report
  generation with huge data volumes",Preprint. Pre-peer reviewed version. 15 pages. 7 figures. 1 table,,10.1002/nem.2044,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we analyze the performance issues involved in the generation of
auto- mated traffic reports for large IT infrastructures. Such reports allows
the IT manager to proactively detect possible abnormal situations and roll out
the corresponding cor- rective actions. With the ever-increasing bandwidth of
current networks, the design of automated traffic report generation systems is
very challenging. In a first step, the huge volumes of collected traffic are
transformed into enriched flow records obtained from diverse collectors and
dissectors. Then, such flow records, along with time series obtained from the
raw traffic, are further processed to produce a usable report. As will be
shown, the data volume in flow records is very large as well and requires
careful selection of the Key Performance Indicators (KPIs) to be included in
the report. In this regard, we discuss the use of high-level languages versus
low- level approaches, in terms of speed and versatility. Furthermore, our
design approach is targeted for rapid development in commodity hardware, which
is essential to cost-effectively tackle demanding traffic analysis scenarios.
","[{'version': 'v1', 'created': 'Sat, 1 Sep 2018 17:01:04 GMT'}]",2018-09-05,"[['Moreno', 'Carlos Vega', ''], ['Sierra', 'Eduardo Miravalls', ''], ['Moreno', 'Guillermo Julián', ''], ['de Vergara', 'Jorge E. López', ''], ['Magaña', 'Eduardo', ''], ['Aracil', 'Javier', '']]","['Traffic analysis', 'Network management', 'Automatic reports']"
360,1711.03147,Clemente Rubio-Manzano,"Clemente Rubio-Manzano, Martin Pereira-Fari\~na","On the incorporation of interval-valued fuzzy sets into the Bousi-Prolog
  system: declarative semantics, implementation and applications",,"Interactions Between Computational Intelligence and Mathematics
  Studies in Computational Intelligence, vol 794. Springer 2018",10.1007/978-3-030-01632-6_1,,cs.AI cs.CL cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we analyse the benefits of incorporating interval-valued fuzzy
sets into the Bousi-Prolog system. A syntax, declarative semantics and im-
plementation for this extension is presented and formalised. We show, by using
potential applications, that fuzzy logic programming frameworks enhanced with
them can correctly work together with lexical resources and ontologies in order
to improve their capabilities for knowledge representation and reasoning.
","[{'version': 'v1', 'created': 'Wed, 8 Nov 2017 20:25:43 GMT'}]",2021-01-07,"[['Rubio-Manzano', 'Clemente', ''], ['Pereira-Fariña', 'Martin', '']]","['Interval-valued fuzzy sets', 'Approximate Reasoning', 'Lexical Knowl']"
361,1412.8527,EPTCS,"Anne Preller (LIRMM, France)",From Logical to Distributional Models,"In Proceedings QPL 2013, arXiv:1412.7917","EPTCS 171, 2014, pp. 113-131",10.4204/EPTCS.171.11,,cs.LO cs.CL quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper relates two variants of semantic models for natural language,
logical functional models and compositional distributional vector space models,
by transferring the logic and reasoning from the logical to the distributional
models.
  The geometrical operations of quantum logic are reformulated as algebraic
operations on vectors. A map from functional models to vector space models
makes it possible to compare the meaning of sentences word by word.
","[{'version': 'v1', 'created': 'Tue, 30 Dec 2014 01:43:39 GMT'}]",2014-12-31,"[['Preller', 'Anne', '', 'LIRMM, France']]","['compositional semantics for natural language', 'compact closed categories', 'quantum logic', 'logical models', 'vector']"
362,1805.00224,Ibraheem Kasim Ibraheem AL-Timeemee,"Fatin H. Ajeil, Ibraheem Kasim Ibraheem, Mouayad A. Sahib, Amjad J.
  Humaidi","Multi-objective path planning of an autonomous mobile robot using hybrid
  PSO-MFB optimization algorithm",,"Volume 89, April 2020, 106076",10.1016/j.asoc.2020.106076,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The main aim of this paper is to solve a path planning problem for an
autonomous mobile robot in static and dynamic environments. The problem is
solved by determining the collision-free path that satisfies the chosen
criteria for shortest distance and path smoothness. The proposed path planning
algorithm mimics the real world by adding the actual size of the mobile robot
to that of the obstacles and formulating the problem as a moving point in the
free-space. The proposed algorithm consists of three modules. The first module
forms an optimized path by conducting a hybridized Particle Swarm
Optimization-Modified Frequency Bat (PSO-MFB) algorithm that minimizes distance
and follows path smoothness criteria. The second module detects any infeasible
points generated by the proposed hybrid PSO-MFB Algorithm by a novel Local
Search (LS) algorithm integrated with the hybrid PSO-MFB algorithm to be
converted into feasible solutions. The third module features obstacle detection
and avoidance (ODA), which is triggered when the mobile robot detects obstacles
within its sensing region, allowing it to avoid collision with obstacles. The
simulation results indicate that this method generates an optimal feasible path
even in complex dynamic environments and thus overcomes the shortcomings of
conventional approaches such as grid methods. Moreover, compared to recent path
planning techniques, simulation results show that the proposed hybrid PSO-MFB
algorithm is highly competitive in terms of path optimality.
","[{'version': 'v1', 'created': 'Tue, 1 May 2018 07:56:43 GMT'}, {'version': 'v2', 'created': 'Thu, 10 May 2018 21:42:02 GMT'}, {'version': 'v3', 'created': 'Fri, 20 Mar 2020 21:41:10 GMT'}]",2020-03-24,"[['Ajeil', 'Fatin H.', ''], ['Ibraheem', 'Ibraheem Kasim', ''], ['Sahib', 'Mouayad A.', ''], ['Humaidi', 'Amjad J.', '']]","['Autonomous Mobile Robot', 'Robot path planning', 'particle swarm optimization', 'bat algorithm', 'collision avoidance.  1']"
363,1606.05506,Sebastian Stabinger MSc,"Sebastian Stabinger, Antonio Rodriguez-Sanchez, Justus Piater",Learning Abstract Classes using Deep Learning,"To be published in the proceedings of the International Conference on
  Bio-inspired Information and Communications Technologies 2015",,10.4108/eai.3-12-2015.2262468,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Humans are generally good at learning abstract concepts about objects and
scenes (e.g.\ spatial orientation, relative sizes, etc.). Over the last years
convolutional neural networks have achieved almost human performance in
recognizing concrete classes (i.e.\ specific object categories). This paper
tests the performance of a current CNN (GoogLeNet) on the task of
differentiating between abstract classes which are trivially differentiable for
humans. We trained and tested the CNN on the two abstract classes of horizontal
and vertical orientation and determined how well the network is able to
transfer the learned classes to other, previously unseen objects.
","[{'version': 'v1', 'created': 'Fri, 17 Jun 2016 12:51:23 GMT'}]",2016-08-01,"[['Stabinger', 'Sebastian', ''], ['Rodriguez-Sanchez', 'Antonio', ''], ['Piater', 'Justus', '']]","['Deep Learning', 'Convolutional Neural Networks', 'Visual Cortex', 'Abstract Reasoning']"
364,1903.03276,Prakash Murali,"Prakash Murali and Ali Javadi-Abhari and Frederic T. Chong and
  Margaret Martonosi","Formal Constraint-based Compilation for Noisy Intermediate-Scale Quantum
  Systems","Invited paper in Special Issue on Quantum Computer Architecture: a
  full-stack overview, Microprocessors and Microsystems",Microprocessors and Microsystems 2019,10.1016/j.micpro.2019.02.005,,cs.PL quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Noisy, intermediate-scale quantum (NISQ) systems are expected to have a few
hundred qubits, minimal or no error correction, limited connectivity and limits
on the number of gates that can be performed within the short coherence window
of the machine. The past decade's research on quantum programming languages and
compilers is directed towards large systems with thousands of qubits. For near
term quantum systems, it is crucial to design tool flows which make efficient
use of the hardware resources without sacrificing the ease and portability of a
high-level programming environment. In this paper, we present a compiler for
the Scaffold quantum programming language in which aggressive optimization
specifically targets NISQ machines with hundreds of qubits. Our compiler
extracts gates from a Scaffold program, and formulates a constrained
optimization problem which considers both program characteristics and machine
constraints. Using the Z3 SMT solver, the compiler maps program qubits to
hardware qubits, schedules gates, and inserts CNOT routing operations while
optimizing the overall execution time. The output of the optimization is used
to produce target code in the OpenQASM language, which can be executed on
existing quantum hardware such as the 16-qubit IBM machine. Using real and
synthetic benchmarks, we show that it is feasible to synthesize near-optimal
compiled code for current and small NISQ systems. For large programs and
machine sizes, the SMT optimization approach can be used to synthesize compiled
code that is guaranteed to finish within the coherence window of the machine.
","[{'version': 'v1', 'created': 'Fri, 8 Mar 2019 04:13:58 GMT'}]",2019-03-11,"[['Murali', 'Prakash', ''], ['Javadi-Abhari', 'Ali', ''], ['Chong', 'Frederic T.', ''], ['Martonosi', 'Margaret', '']]","['Quantum compilation', 'SMT optimization', 'Quantum computing']"
365,1711.05702,Xu Han,"Xu Han, Roland Kwitt, Stephen Aylward, Spyridon Bakas, Bjoern Menze,
  Alexander Asturias, Paul Vespa, John Van Horn, Marc Niethammer","Brain Extraction from Normal and Pathological Images: A Joint
  PCA/Image-Reconstruction Approach",,,10.1016/j.neuroimage.2018.04.073,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Brain extraction from images is a common pre-processing step. Many approaches
exist, but they are frequently only designed to perform brain extraction from
images without strong pathologies. Extracting the brain from images with strong
pathologies, for example, the presence of a tumor or of a traumatic brain
injury, is challenging. In such cases, tissue appearance may deviate from
normal tissue and violates algorithmic assumptions for these approaches; hence,
the brain may not be correctly extracted. This paper proposes a brain
extraction approach which can explicitly account for pathologies by jointly
modeling normal tissue and pathologies. Specifically, our model uses a
three-part image decomposition: (1) normal tissue appearance is captured by
principal component analysis, (2) pathologies are captured via a total
variation term, and (3) non-brain tissue is captured by a sparse term.
Decomposition and image registration steps are alternated to allow statistical
modeling in a fixed atlas space. As a beneficial side effect, the model allows
for the identification of potential pathologies and the reconstruction of a
quasi-normal image in atlas space. We demonstrate the effectiveness of our
method on four datasets: the IBSR and LPBA40 datasets which show normal images,
the BRATS dataset containing images with brain tumors and a dataset containing
clinical TBI images. We compare the performance with other popular models:
ROBEX, BEaST, MASS, BET, BSE and a recently proposed deep learning approach.
Our model performs better than these competing methods on all four datasets.
Specifically, our model achieves the best median (97.11) and mean (96.88) Dice
scores over all datasets. The two best performing competitors, ROBEX and MASS,
achieve scores of 96.23/95.62 and 96.67/94.25 respectively. Hence, our approach
is an effective method for high quality brain extraction on a wide variety of
images.
","[{'version': 'v1', 'created': 'Wed, 15 Nov 2017 17:57:52 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Apr 2018 19:53:45 GMT'}]",2018-05-10,"[['Han', 'Xu', ''], ['Kwitt', 'Roland', ''], ['Aylward', 'Stephen', ''], ['Bakas', 'Spyridon', ''], ['Menze', 'Bjoern', ''], ['Asturias', 'Alexander', ''], ['Vespa', 'Paul', ''], ['Van Horn', 'John', ''], ['Niethammer', 'Marc', '']]","['Brain Extraction', 'Image Registration', 'PCA', 'Total-Variation', 'Pathology']"
366,1610.04213,Konstantinos Chatzilygeroudis,"Konstantinos Chatzilygeroudis, Vassilis Vassiliades, Jean-Baptiste
  Mouret",Reset-free Trial-and-Error Learning for Robot Damage Recovery,"18 pages, 16 figures, 3 tables, 6 pseudocodes/algorithms, video at
  https://youtu.be/IqtyHFrb3BU, code at
  https://github.com/resibots/chatzilygeroudis_2018_rte",,10.1016/j.robot.2017.11.010,,cs.RO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The high probability of hardware failures prevents many advanced robots
(e.g., legged robots) from being confidently deployed in real-world situations
(e.g., post-disaster rescue). Instead of attempting to diagnose the failures,
robots could adapt by trial-and-error in order to be able to complete their
tasks. In this situation, damage recovery can be seen as a Reinforcement
Learning (RL) problem. However, the best RL algorithms for robotics require the
robot and the environment to be reset to an initial state after each episode,
that is, the robot is not learning autonomously. In addition, most of the RL
methods for robotics do not scale well with complex robots (e.g., walking
robots) and either cannot be used at all or take too long to converge to a
solution (e.g., hours of learning). In this paper, we introduce a novel
learning algorithm called ""Reset-free Trial-and-Error"" (RTE) that (1) breaks
the complexity by pre-generating hundreds of possible behaviors with a dynamics
simulator of the intact robot, and (2) allows complex robots to quickly recover
from damage while completing their tasks and taking the environment into
account. We evaluate our algorithm on a simulated wheeled robot, a simulated
six-legged robot, and a real six-legged walking robot that are damaged in
several ways (e.g., a missing leg, a shortened leg, faulty motor, etc.) and
whose objective is to reach a sequence of targets in an arena. Our experiments
show that the robots can recover most of their locomotion abilities in an
environment with obstacles, and without any human intervention.
","[{'version': 'v1', 'created': 'Thu, 13 Oct 2016 19:39:58 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Apr 2017 23:08:17 GMT'}, {'version': 'v3', 'created': 'Thu, 23 Nov 2017 10:55:03 GMT'}, {'version': 'v4', 'created': 'Tue, 12 Dec 2017 08:02:31 GMT'}]",2017-12-13,"[['Chatzilygeroudis', 'Konstantinos', ''], ['Vassiliades', 'Vassilis', ''], ['Mouret', 'Jean-Baptiste', '']]","['Robot Damage Recovery', 'Autonomous Systems', 'Robotics', 'Trial-and-Error Learning', 'ReinforcementLearning']"
367,1907.09696,Yeonjong Shin,"Yeonjong Shin, George Em Karniadakis",Trainability of ReLU networks and Data-dependent Initialization,,,10.1615/.2020034126,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this paper, we study the trainability of rectified linear unit (ReLU)
networks. A ReLU neuron is said to be dead if it only outputs a constant for
any input. Two death states of neurons are introduced; tentative and permanent
death. A network is then said to be trainable if the number of permanently dead
neurons is sufficiently small for a learning task. We refer to the probability
of a network being trainable as trainability. We show that a network being
trainable is a necessary condition for successful training and the trainability
serves as an upper bound of successful training rates. In order to quantify the
trainability, we study the probability distribution of the number of active
neurons at the initialization. In many applications, over-specified or
over-parameterized neural networks are successfully employed and shown to be
trained effectively. With the notion of trainability, we show that
over-parameterization is both a necessary and a sufficient condition for
minimizing the training loss. Furthermore, we propose a data-dependent
initialization method in the over-parameterized setting. Numerical examples are
provided to demonstrate the effectiveness of the method and our theoretical
findings.
","[{'version': 'v1', 'created': 'Tue, 23 Jul 2019 05:11:32 GMT'}, {'version': 'v2', 'created': 'Tue, 31 Mar 2020 04:25:31 GMT'}]",2020-10-23,"[['Shin', 'Yeonjong', ''], ['Karniadakis', 'George Em', '']]","['ReLU networks', 'Trainability', 'Dying ReLU', 'Over-parameterization', 'Overspecification', 'Data-dependent initialization']"
368,0906.2742,Daniel Kharitonov,"Luc Ceuppens, Alan Sardella, Daniel Kharitonov","Power Saving Strategies and Technologies in Network Equipment
  Opportunities and Challenges, Risk and Rewards","IEEE SAINT 2008 proceedings, July 28th - Aug 1st 2008, PCFNS workshop",,10.1109/SAINT.2008.79,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Drawing from todays best-in-class solutions, we identify power-saving
strategies that have succeeded in the past and look forward to new ideas and
paradigms. We strongly believe that designing energy-efficient network
equipment can be compared to building sports cars, task-oriented, focused and
fast. However, unlike track-bound sports cars, ultra-fast and purpose-built
silicon yields better energy efficiency when compared to more generic family
sedan designs that mitigate go-to-market risks by being the masters of many
tasks. Thus, we demonstrate that the best opportunities for power savings come
via protocol simplification, best-of-breed technology, and silicon and software
optimization, to achieve the least amount of processing necessary to move
packets. We also look to the future of networking from a new angle, where
energy efficiency and environmental concerns are viewed as fundamental design
criteria and forces that need to be harnessed to continually create more
powerful networking equipment.
","[{'version': 'v1', 'created': 'Sat, 13 Jun 2009 10:49:20 GMT'}]",2016-11-17,"[['Ceuppens', 'Luc', ''], ['Sardella', 'Alan', ''], ['Kharitonov', 'Daniel', '']]","['power', 'green', 'network', 'routers']"
369,1705.06824,Zhengyang Wang,"Zhengyang Wang, Shuiwang Ji","Learning Convolutional Text Representations for Visual Question
  Answering",Conference paper at SDM 2018. https://github.com/divelab/svae,"In proceedings of the 2018 SIAM International Conference on Data
  Mining (pp. 594-602). 2018",10.1137/1.9781611975321.67,,cs.LG cs.CL cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visual question answering is a recently proposed artificial intelligence task
that requires a deep understanding of both images and texts. In deep learning,
images are typically modeled through convolutional neural networks, and texts
are typically modeled through recurrent neural networks. While the requirement
for modeling images is similar to traditional computer vision tasks, such as
object recognition and image classification, visual question answering raises a
different need for textual representation as compared to other natural language
processing tasks. In this work, we perform a detailed analysis on natural
language questions in visual question answering. Based on the analysis, we
propose to rely on convolutional neural networks for learning textual
representations. By exploring the various properties of convolutional neural
networks specialized for text data, such as width and depth, we present our
""CNN Inception + Gate"" model. We show that our model improves question
representations and thus the overall accuracy of visual question answering
models. We also show that the text representation requirement in visual
question answering is more complicated and comprehensive than that in
conventional natural language processing tasks, making it a better task to
evaluate textual representation methods. Shallow models like fastText, which
can obtain comparable results with deep learning models in tasks like text
classification, are not suitable in visual question answering.
","[{'version': 'v1', 'created': 'Thu, 18 May 2017 22:51:44 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Apr 2018 17:38:50 GMT'}]",2018-09-05,"[['Wang', 'Zhengyang', ''], ['Ji', 'Shuiwang', '']]","['Deep learning', 'visual question answering', 'convolutionalneural networks', 'text representations']"
370,1808.10367,Vahid Keshavarzzadeh,"Vahid Keshavarzzadeh, Robert M. Kirby and Akil Narayan","Parametric Topology Optimization with Multi-Resolution Finite Element
  Models",,,10.1002/nme.6063,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a methodical procedure for topology optimization under uncertainty
with multi-resolution finite element models. We use our framework in a
bi-fidelity setting where a coarse and a fine mesh corresponding to low- and
high-resolution models are available. The inexpensive low-resolution model is
used to explore the parameter space and approximate the parameterized
high-resolution model and its sensitivity where parameters are considered in
both structural load and stiffness. We provide error bounds for bi-fidelity
finite element (FE) approximations and their sensitivities and conduct
numerical studies to verify these theoretical estimates. We demonstrate our
approach on benchmark compliance minimization problems where we show
significant reduction in computational cost for expensive problems such as
topology optimization under manufacturing variability while generating almost
identical designs to those obtained with single resolution mesh. We also
compute the parametric Von-Mises stress for the generated designs via our
bi-fidelity FE approximation and compare them with standard Monte Carlo
simulations. The implementation of our algorithm which extends the well-known
88-line topology optimization code in MATLAB is provided.
","[{'version': 'v1', 'created': 'Thu, 30 Aug 2018 15:52:08 GMT'}]",2019-04-08,"[['Keshavarzzadeh', 'Vahid', ''], ['Kirby', 'Robert M.', ''], ['Narayan', 'Akil', '']]","['Multi-Resolution Finite Elements', 'Parametric Topology Optimization', 'Bi-Fidelity Error Estimate', 'Man']"
371,1309.2183,Seyyed Reza Khaze,"Seyyed Reza Khaze, Mohammad Masdari and Sohrab Hojjatkhah","Application of Artificial Neural Networks in Estimating Participation in
  Elections",,"International Journal of Information Technology, Modeling and
  Computing (IJITMC) Vol.1, No.3,August 2013",10.5121/ijitmc.2013.1303,,cs.NE cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is approved that artificial neural networks can be considerable effective
in anticipating and analyzing flows in which traditional methods and statics
are not able to solve. in this article, by using two-layer feedforward network
with tan-sigmoid transmission function in input and output layers, we can
anticipate participation rate of public in kohgiloye and boyerahmad province in
future presidential election of islamic republic of iran with 91% accuracy. the
assessment standards of participation such as confusion matrix and roc diagrams
have been approved our claims.
","[{'version': 'v1', 'created': 'Mon, 9 Sep 2013 15:03:59 GMT'}]",2013-09-10,"[['Khaze', 'Seyyed Reza', ''], ['Masdari', 'Mohammad', ''], ['Hojjatkhah', 'Sohrab', '']]","['Anticipating', 'Data Mining', 'Artificial Neural Network', 'political behaviour', 'elections']"
372,1807.10816,Ling Liang,"Ling Liang, Lei Deng, Yueling Zeng, Xing Hu, Yu Ji, Xin Ma, Guoqi Li
  and Yuan Xie",Crossbar-aware neural network pruning,,IEEE Access 6 (2018): 58324-58337,10.1109/ACCESS.2018.2874823,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crossbar architecture based devices have been widely adopted in neural
network accelerators by taking advantage of the high efficiency on
vector-matrix multiplication (VMM) operations. However, in the case of
convolutional neural networks (CNNs), the efficiency is compromised
dramatically due to the large amounts of data reuse. Although some mapping
methods have been designed to achieve a balance between the execution
throughput and resource overhead, the resource consumption cost is still huge
while maintaining the throughput.
  Network pruning is a promising and widely studied leverage to shrink the
model size. Whereas, previous work didn`t consider the crossbar architecture
and the corresponding mapping method, which cannot be directly utilized by
crossbar-based neural network accelerators. Tightly combining the crossbar
structure and its mapping, this paper proposes a crossbar-aware pruning
framework based on a formulated L0-norm constrained optimization problem.
Specifically, we design an L0-norm constrained gradient descent (LGD) with
relaxant probabilistic projection (RPP) to solve this problem. Two grains of
sparsity are successfully achieved: i) intuitive crossbar-grain sparsity and
ii) column-grain sparsity with output recombination, based on which we further
propose an input feature maps (FMs) reorder method to improve the model
accuracy. We evaluate our crossbar-aware pruning framework on median-scale
CIFAR10 dataset and large-scale ImageNet dataset with VGG and ResNet models.
Our method is able to reduce the crossbar overhead by 44%-72% with little
accuracy degradation. This work greatly saves the resource and the related
energy cost, which provides a new co-design solution for mapping CNNs onto
various crossbar devices with significantly higher efficiency.
","[{'version': 'v1', 'created': 'Wed, 25 Jul 2018 21:08:35 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Nov 2018 23:13:32 GMT'}, {'version': 'v3', 'created': 'Thu, 6 Dec 2018 03:08:39 GMT'}]",2018-12-07,"[['Liang', 'Ling', ''], ['Deng', 'Lei', ''], ['Zeng', 'Yueling', ''], ['Hu', 'Xing', ''], ['Ji', 'Yu', ''], ['Ma', 'Xin', ''], ['Li', 'Guoqi', ''], ['Xie', 'Yuan', '']]","['Crossbar Architecture', 'Convolutional NeuralNetworks', 'Neural Network Pruning', 'Constrained OptimizationProblem']"
373,1303.0284,Tomasz Kajdanowicz,"Katarzyna Musial, Przemyslaw Kazienkol and Tomasz Kajdanowicz",Social Recommendations within the Multimedia Sharing Systems,"recommender system, multirelational social network, multimedia
  sharing system, social network analysis, Best Paper Award. arXiv admin note:
  text overlap with arXiv:1303.0093","Musial K., Kazienko P., Kajdanowicz T.: Social Recommendations
  within the Multimedia Sharing Systems. The First World Summit on the
  Knowledge Society, WSKS'08, Lecture Notes in Computer Science LNCS 5288,
  2008, pp. 364-372",10.1007/978-3-540-87781-3_40,,cs.SI cs.IR physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The social recommender system that supports the creation of new relations
between users in the multimedia sharing system is presented in the paper. To
generate suggestions the new concept of the multirelational social network was
introduced. It covers both direct as well as object-based relationships that
reflect social and semantic links between users. The main goal of the new
method is to create the personalized suggestions that are continuously adapted
to users' needs depending on the personal weights assigned to each layer from
the social network. The conducted experiments confirmed the usefulness of the
proposed model.
","[{'version': 'v1', 'created': 'Fri, 1 Mar 2013 07:09:39 GMT'}]",2013-03-05,"[['Musial', 'Katarzyna', ''], ['Kazienkol', 'Przemyslaw', ''], ['Kajdanowicz', 'Tomasz', '']]","['recommender system', 'multirelational social network', 'multimedia sharing system', 'social network analysis']"
374,1803.06649,Taichi Uemura,Taichi Uemura,"Cubical Assemblies, a Univalent and Impredicative Universe and a Failure
  of Propositional Resizing",,,10.4230/LIPIcs.TYPES.2018.7,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  We construct a model of cubical type theory with a univalent and
impredicative universe in a category of cubical assemblies. We show that this
impredicative universe in the cubical assembly model does not satisfy a form of
propositional resizing.
","[{'version': 'v1', 'created': 'Sun, 18 Mar 2018 11:58:07 GMT'}, {'version': 'v2', 'created': 'Sun, 15 Apr 2018 13:35:50 GMT'}, {'version': 'v3', 'created': 'Mon, 9 Sep 2019 08:40:32 GMT'}]",2019-11-19,"[['Uemura', 'Taichi', '']]","['Cubical type theory', 'Realizability', 'Impredicative universe', 'Univalence', 'Propositional resizing']"
375,1808.05283,Ashkan Yousefpour,"Ashkan Yousefpour, Caleb Fung, Tam Nguyen, Krishna Kadiyala, Fatemeh
  Jalali, Amirreza Niakanlahiji, Jian Kong, Jason P. Jue","All One Needs to Know about Fog Computing and Related Edge Computing
  Paradigms: A Complete Survey","48 pages, 7 tables, 11 figures, 450 references. The data (categories
  and features/objectives of the papers) of this survey are now available
  publicly. Accepted by Elsevier Journal of Systems Architecture",,10.1016/j.sysarc.2019.02.009,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the Internet of Things (IoT) becoming part of our daily life and our
environment, we expect rapid growth in the number of connected devices. IoT is
expected to connect billions of devices and humans to bring promising
advantages for us. With this growth, fog computing, along with its related edge
computing paradigms, such as multi-access edge computing (MEC) and cloudlet,
are seen as promising solutions for handling the large volume of
security-critical and time-sensitive data that is being produced by the IoT. In
this paper, we first provide a tutorial on fog computing and its related
computing paradigms, including their similarities and differences. Next, we
provide a taxonomy of research topics in fog computing, and through a
comprehensive survey, we summarize and categorize the efforts on fog computing
and its related computing paradigms. Finally, we provide challenges and future
directions for research in fog computing.
","[{'version': 'v1', 'created': 'Wed, 15 Aug 2018 20:56:28 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Sep 2018 20:24:07 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Feb 2019 23:30:17 GMT'}]",2019-02-15,"[['Yousefpour', 'Ashkan', ''], ['Fung', 'Caleb', ''], ['Nguyen', 'Tam', ''], ['Kadiyala', 'Krishna', ''], ['Jalali', 'Fatemeh', ''], ['Niakanlahiji', 'Amirreza', ''], ['Kong', 'Jian', ''], ['Jue', 'Jason P.', '']]","['Fog Computing', 'Edge Computing', 'Cloud Computing', 'Internet ofThings (IoT)', 'Cloudlet', 'Mobile Edge Computing', 'Multi-access EdgeComputing', 'Mist Computing']"
376,1802.06624,Dian Pratiwi,"Putri Kurniasih, Dian Pratiwi","Osteoarthritis Disease Detection System using Self Organizing Maps
  Method based on Ossa Manus X-Ray","6 pages, 12 figures, 1 table","International Journal of Computer Applications, Foundation of
  Computer Science (FCS), NY, USA. Volume 173 - Number 3, 2017",10.5120/ijca2017915278,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Osteoarthritis is a disease found in the world, including in Indonesia. The
purpose of this study was to detect the disease Osteoarthritis using Self
Organizing mapping (SOM), and to know the procedure of artificial intelligence
on the methods of Self Organizing Mapping (SOM). In this system, there are
several stages to preserve to detect disease Osteoarthritis using Self
Organizing maps is the result of photographic images rontgen Ossa Manus normal
and sick with the resolution (150 x 200 pixels) do the repair phase contrast,
the Gray scale, thresholding process, Histogram of process , and do the last
process, where the process of doing training (Training) and testing on images
that have kept the shape data (.text). the conclusion is the result of testing
by using a data image, where 42 of data have 12 Normal image data and image
data 30 sick. On the results of the process of training data there are 8 X-ray
image revealed normal right and 19 data x-ray image of pain expressed is
correct. Then the accuracy on the process of training was 96.42%, and in the
process of testing normal true image 4 obtained revealed Normal, 9 data pain
stated true pain and 1 data imagery hurts stated incorrectly, then the accuracy
gained from the results of testing are 92,8%.
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 13:43:05 GMT'}]",2018-02-20,"[['Kurniasih', 'Putri', ''], ['Pratiwi', 'Dian', '']]","['Osteoarthritis', 'Ossa manus', 'Grayscale', 'Thresholding', 'Self Organizing Maps']"
377,1005.4501,Secretary Aircc Journal,"S.Sangeetha(1), V.Vaidehi(2), ((1)Angel College of Engineering, India,
  (2)Madras Institute of Technology, India)","Fuzzy Aided Application Layer Semantic Intrusion Detection System -
  FASIDS","18 Pages, IJNSA","International Journal of Network Security & Its Applications 2.2
  (2010) 39-56",10.5121/ijnsa.2010.2204,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The objective of this is to develop a Fuzzy aided Application layer Semantic
Intrusion Detection System (FASIDS) which works in the application layer of the
network stack. FASIDS consist of semantic IDS and Fuzzy based IDS. Rule based
IDS looks for the specific pattern which is defined as malicious. A
non-intrusive regular pattern can be malicious if it occurs several times with
a short time interval. For detecting such malicious activities, FASIDS is
proposed in this paper. At application layer, HTTP traffic's header and payload
are analyzed for possible intrusion. In the proposed misuse detection module,
the semantic intrusion detection system works on the basis of rules that define
various application layer misuses that are found in the network. An attack
identified by the IDS is based on a corresponding rule in the rule-base. An
event that doesn't make a 'hit' on the rule-base is given to a Fuzzy Intrusion
Detection System (FIDS) for further analysis.
","[{'version': 'v1', 'created': 'Tue, 25 May 2010 08:02:30 GMT'}]",2010-07-15,"[['Sangeetha', 'S.', ''], ['Vaidehi', 'V.', '']]","['Semantic Intrusion detection', 'Application Layer misuse detector', 'Fuzzy']"
378,1005.2277,Amparo F\'uster-Sabater,Amparo F\'uster-Sabater and Pedro Garc\'ia-Mochales,"A Simple Computational Model for Acceptance/Rejection of Binary Sequence
  Generators","16 pages, 0 figures","Applied Mathematical Modelling. Volume 31, Issue 8, pp. 1548-1558.
  August 2007.",10.1016/j.apm.2006.05.004,,cs.CR cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A simple binary model to compute the degree of balancedness in the output
sequence of LFSR-combinational generators has been developed. The computational
method is based exclusively on the handling of binary strings by means of logic
operations. The proposed model can serve as a deterministic alternative to
existing probabilistic methods for checking balancedness in binary sequence
generators. The procedure here described can be devised as a first selective
criterium for acceptance/rejection of this type of generators.
","[{'version': 'v1', 'created': 'Thu, 13 May 2010 08:48:31 GMT'}]",2010-05-14,"[['Fúster-Sabater', 'Amparo', ''], ['García-Mochales', 'Pedro', '']]","['Balancedness', 'Bit-string model', 'Combinational generator', 'Design rules']"
379,1812.03174,Milica Bogicevic,"Milica Bogi\'cevi\'c, Milan Merkle","Approximate Calculation of Tukey's Depth and Median With
  High-dimensional Data",,"Yugoslav Journal of Operations Research 28 (2018), Number 4,
  475--499",10.2298/YJOR180520022B,,cs.DS cs.CG,http://creativecommons.org/publicdomain/zero/1.0/,"  We present a new fast approximate algorithm for Tukey (halfspace) depth level
sets and its implementation-ABCDepth. Given a $d$-dimensional data set for any
$d\geq 1$, the algorithm is based on a representation of level sets as
intersections of balls in $\mathbb{R}^d$. Our approach does not need
calculations of projections of sample points to directions. This novel idea
enables calculations of approximate level sets in very high dimensions with
complexity which is linear in $d$, which provides a great advantage over all
other approximate algorithms. Using different versions of this algorithm we
demonstrate approximate calculations of the deepest set of points (""Tukey
median"") and Tukey's depth of a sample point or out-of-sample point, all with a
linear in $d$ complexity. An additional theoretical advantage of this approach
is that the data points are not assumed to be in ""general position"". Examples
with real and synthetic data show that the executing time of the algorithm in
all mentioned versions in high dimensions is much smaller than the time of
other implemented algorithms. Also, our algorithms can be used with thousands
of multidimensional observations.
","[{'version': 'v1', 'created': 'Fri, 7 Dec 2018 10:27:14 GMT'}]",2018-12-11,"[['Bogićević', 'Milica', ''], ['Merkle', 'Milan', '']]","['Big data', 'multivariate medians', 'depth functions', 'computing Tukey’s depth']"
380,1801.03546,Upal Mahbub,Upal Mahbub and Sayantan Sarkar and Rama Chellappa,Segment-based Methods for Facial Attribute Detection from Partial Faces,,"IEEE Transactions on Affective Computing, 2018",10.1109/TAFFC.2018.2820048,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  State-of-the-art methods of attribute detection from faces almost always
assume the presence of a full, unoccluded face. Hence, their performance
degrades for partially visible and occluded faces. In this paper, we introduce
SPLITFACE, a deep convolutional neural network-based method that is explicitly
designed to perform attribute detection in partially occluded faces. Taking
several facial segments and the full face as input, the proposed method takes a
data driven approach to determine which attributes are localized in which
facial segments. The unique architecture of the network allows each attribute
to be predicted by multiple segments, which permits the implementation of
committee machine techniques for combining local and global decisions to boost
performance. With access to segment-based predictions, SPLITFACE can predict
well those attributes which are localized in the visible parts of the face,
without having to rely on the presence of the whole face. We use the CelebA and
LFWA facial attribute datasets for standard evaluations. We also modify both
datasets, to occlude the faces, so that we can evaluate the performance of
attribute detection algorithms on partial faces. Our evaluation shows that
SPLITFACE significantly outperforms other recent methods especially for partial
faces.
","[{'version': 'v1', 'created': 'Wed, 10 Jan 2018 20:32:35 GMT'}]",2018-07-19,"[['Mahbub', 'Upal', ''], ['Sarkar', 'Sayantan', ''], ['Chellappa', 'Rama', '']]","['attribute detection', 'facial segment', 'committee machines', 'score fusion', 'local to global decision propagation;']"
381,1006.3848,Secretary Aircc Journal,"Mosin Hasan, Nilesh Prajapati and Safvan Vohara (BVM Engineering
  College, India)",Case Study On Social Engineering Techniques for Persuasion,7 Pages,"International journal on applications of graph theory in wireless
  ad hoc networks and sensor networks 2.2 (2010) 17-23",10.5121/jgraphoc.2010.2202,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  There are plenty of security software in market; each claiming the best,
still we daily face problem of viruses and other malicious activities. If we
know the basic working principal of such malware then we can very easily
prevent most of them even without security software. Hackers and crackers are
experts in psychology to manipulate people into giving them access or the
information necessary to get access. This paper discusses the inner working of
such attacks. Case study of Spyware is provided. In this case study, we got
100% success using social engineering techniques for deception on Linux
operating system, which is considered as the most secure operating system. Few
basic principal of defend, for the individual as well as for the organization,
are discussed here, which will prevent most of such attack if followed.
","[{'version': 'v1', 'created': 'Sat, 19 Jun 2010 07:57:58 GMT'}]",2011-01-20,"[['Hasan', 'Mosin', '', 'BVM Engineering\n  College, India'], ['Prajapati', 'Nilesh', '', 'BVM Engineering\n  College, India'], ['Vohara', 'Safvan', '', 'BVM Engineering\n  College, India']]","['Spyware', 'Malware', 'Social Engineering', 'Psychology']"
382,1701.03836,Khaza Anuarul Hoque,"Khaza Anuarul Hoque, Otmane Ait Mohamed, Yvon Savaria","Formal Analysis of SEU Mitigation for Early Dependability and
  Performability Analysis of FPGA-based Space Applications","Accepted version for publication in the Journal of Applied Science,
  Elsevier",,10.1016/j.jal.2017.03.001,,cs.PF cs.AR cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  SRAM-based FPGAs are increasingly popular in the aerospace industry due to
their field programmability and low cost. However, they suffer from cosmic
radiation induced Single Event Upsets (SEUs). In safety-critical applications,
the dependability of the design is a prime concern since failures may have
catastrophic consequences. An early analysis of the relationship between
dependability metrics, performability-area trade-off, and different mitigation
techniques for such applications can reduce the design effort while increasing
the design confidence. This paper introduces a novel methodology based on
probabilistic model checking, for the analysis of the reliability,
availability, safety and performance-area tradeoffs of safety-critical systems
for early design decisions. Starting from the high-level description of a
system, a Markov reward model is constructed from the Control Data Flow Graph
(CDFG) and a component characterization library targeting FPGAs. The proposed
model and exhaustive analysis capture all the failure states (based on the
fault detection coverage) and repairs possible in the system. We present
quantitative results based on an FIR filter circuit to illustrate the
applicability of the proposed approach and to demonstrate that a wide range of
useful dependability and performability properties can be analyzed using the
proposed methodology. The modeling results show the relationship between
different mitigation techniques and fault detection coverage, exposing their
direct impact on the design for early decisions.
","[{'version': 'v1', 'created': 'Thu, 12 Jan 2017 17:07:36 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Feb 2017 17:21:29 GMT'}]",2017-03-07,"[['Hoque', 'Khaza Anuarul', ''], ['Mohamed', 'Otmane Ait', ''], ['Savaria', 'Yvon', '']]","['Probabilistic model checking', 'FPGA', 'Dependability', 'Performability', 'Markov Reward Model', 'SEU', 'CDFG']"
383,1807.05324,Heng Ding,"Heng Ding, Krisztian Balog",Generating Synthetic Data for Neural Keyword-to-Question Models,"Extended version of ICTIR'18 full paper, 11 pages",,10.1145/3234944.3234964,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Search typically relies on keyword queries, but these are often semantically
ambiguous. We propose to overcome this by offering users natural language
questions, based on their keyword queries, to disambiguate their intent. This
keyword-to-question task may be addressed using neural machine translation
techniques. Neural translation models, however, require massive amounts of
training data (keyword-question pairs), which is unavailable for this task. The
main idea of this paper is to generate large amounts of synthetic training data
from a small seed set of hand-labeled keyword-question pairs. Since natural
language questions are available in large quantities, we develop models to
automatically generate the corresponding keyword queries. Further, we introduce
various filtering mechanisms to ensure that synthetic training data is of high
quality. We demonstrate the feasibility of our approach using both automatic
and manual evaluation. This is an extended version of the article published
with the same title in the Proceedings of ICTIR'18.
","[{'version': 'v1', 'created': 'Sat, 14 Jul 2018 03:24:31 GMT'}]",2018-07-18,"[['Ding', 'Heng', ''], ['Balog', 'Krisztian', '']]","['Keyword-to-question', 'synthetic data generation', 'neural machinetranslation']"
384,1512.03565,Taner Cevik Dr.,"Taner Cevik, Alex Gunagwera, Nazife Cevik","A Survey of multimedia streaming in wireless sensor networks: progress,
  issues and design challenges",,,10.5121/ijcnc.2015.7508,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advancements in Complementary Metal Oxide Semiconductor (CMOS) technology
have enabled Wireless Sensor Networks (WSN) to gather, process and transport
multimedia (MM) data as well and not just limited to handling ordinary scalar
data anymore. This new generation of WSN type is called Wireless Multimedia
Sensor Networks (WMSNs). Better and yet relatively cheaper sensors that are
able to sense both scalar data and multimedia data with more advanced
functionalities such as being able to handle rather intense computations easily
have sprung up. In this paper, the applications, architectures, challenges and
issues faced in the design of WMSNs are explored. Security and privacy issues,
over all requirements, proposed and implemented solutions so far, some of the
successful achievements and other related works in the field are also
highlighted. Open research areas are pointed out and a few solution suggestions
to the still persistent problems are made, which, to the best of my knowledge,
so far have not been explored yet.
","[{'version': 'v1', 'created': 'Fri, 11 Dec 2015 09:51:58 GMT'}]",2015-12-14,"[['Cevik', 'Taner', ''], ['Gunagwera', 'Alex', ''], ['Cevik', 'Nazife', '']]","['Multimedia', 'Multimedia Streaming', 'Wireless Sensor Networks', 'Wireless Multimedia Sensor Networks.  1']"
385,1408.2914,Surender Kumar,"Surender Kumar, Manish Prateek, N.J. Ahuja, Bharat Bhushan",DE-LEACH: Distance and Energy Aware LEACH,"7 pages, 5 figures. available online at http://ijcaonline.org/2014",,10.5120/15384-4072,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Wireless sensor network consists of large number of tiny sensor nodes which
are usually deployed in a harsh environment. Self configuration and
infrastructure less are the two fundamental properties of sensor networks.
Sensor nodes are highly energy constrained devices because they are battery
operated devices and due to harsh environment deployment it is impossible to
change or recharge their battery. Energy conservation and prolonging the
network life are two major challenges in a sensor network. Communication
consumes the large portion of WSN energy. Several protocols have been proposed
to realize power- efficient communication in a wireless sensor network. Cluster
based routing protocols are best known for increasing energy efficiency,
stability and network lifetime of WSNs. Low Energy Adaptive Clustering
Hierarchy (LEACH) is an important protocol in this class. One of the
disadvantages of LEACH is that it does not consider the nodes energy and
distance for the election of cluster head. This paper proposes a new energy
efficient clustering protocol DE-LEACH for homogeneous wireless sensor network
which is an extension of LEACH. DE-LEACH elects cluster head on the basis of
distance and residual energy of the nodes. Proposed protocol increases the
network life, stability and throughput of sensor network and simulations result
shows that DE-LEACH is better than LEACH.
","[{'version': 'v1', 'created': 'Wed, 13 Aug 2014 05:37:11 GMT'}]",2015-06-22,"[['Kumar', 'Surender', ''], ['Prateek', 'Manish', ''], ['Ahuja', 'N. J.', ''], ['Bhushan', 'Bharat', '']]","['Cluster', 'Energy Efficiency', 'Initial Energy', 'Residual Energy', 'Wireless Sensor Network']"
386,1902.06224,Michele Polese,"Michele Polese, Tommaso Zugno and Michele Zorzi",Implementation of Reference Public Safety Scenarios in ns-3,"8 pages, 9 figures, submitted to WNS3 2019",,10.1145/3321349.3321356,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During incidents and disasters it is fundamental to provide to first
responders high performance and reliable communications, in order to improve
their coordination capabilities and their awareness of the surrounding
environment, and to allow them to promptly transmit and receive alerts on
possible dangerous situations or emergencies. The accurate evaluation of the
performance of different Public Safety Communication (PSC) networking and
communications technologies is therefore of paramount importance, and the
characterization of the scenario in which these technologies need to operate is
fundamental to obtain meaningful results. In this paper, we present the
implementation of three reference PSC scenarios, which are open source and made
publicly available to the research community, describing the incidents, the
mobility and applications of first responders, and providing examples on how a
mmWave-based Radio Access Network (RAN) can support high-traffic use cases.
Moreover, we present the implementation of two novel mobility models for ns-3,
which can be used to enable the simulation of realistic PSC scenarios in ns-3.
","[{'version': 'v1', 'created': 'Sun, 17 Feb 2019 08:56:58 GMT'}]",2019-11-11,"[['Polese', 'Michele', ''], ['Zugno', 'Tommaso', ''], ['Zorzi', 'Michele', '']]","['Public safety', 'ns-3', 'mmWave', 'scenarios', 'mobility models']"
387,1006.1177,Secretary Aircc Journal,"Srirangam V Addepallil, Per Andersen, George L Barnes",Efficient Resource Matching in Heterogeneous Grid Using Resource Vector,10 pages,"International Journal of Computer Science and Information
  Technology 2.3 (2010) 1-10",10.5121/ijcsit.2010.2301,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper, a method for efficient scheduling to obtain optimum job
throughput in a distributed campus grid environment is presented; Traditional
job schedulers determine job scheduling using user and job resource attributes.
User attributes are related to current usage, historical usage, user priority
and project access. Job resource attributes mainly comprise of soft
requirements (compilers, libraries) and hard requirements like memory, storage
and interconnect. A job scheduler dispatches jobs to a resource if a job's hard
and soft requirements are met by a resource. In current scenario during
execution of a job, if a resource becomes unavailable, schedulers are presented
with limited options, namely re-queuing job or migrating job to a different
resource. Both options are expensive in terms of data and compute time. These
situations can be avoided, if the often ignored factor, availability time of a
resource in a grid environment is considered. We propose resource rank
approach, in which jobs are dispatched to a resource which has the highest rank
among all resources that match the job's requirement. The results show that our
approach can increase throughput of many serial / monolithic jobs.
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2010 06:22:05 GMT'}]",2010-07-15,"[['Addepallil', 'Srirangam V', ''], ['Andersen', 'Per', ''], ['Barnes', 'George L', '']]","['SGE', 'LSF', 'Venus', 'ENDyne', 'Condor']"
388,2102.10101,Kunnath Ranjith,Kunnath Ranjith,"Spectral formulation of the boundary integral equation method for
  antiplane problems",In Press,"Mechanics of Materials, 2022",10.1016/j.mechmat.2021.104177,,cs.CE cond-mat.mtrl-sci physics.geo-ph,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A spectral formulation of the boundary integral equation method for antiplane
problems is presented. The boundary integral equation method relates the slip
and the shear stress at an interface between two half-planes. It involves
evaluating a space-time convolution of the shear stress or the slip at the
interface. In the spectral formulation, the convolution with respect to the
spatial coordinate is performed in the spectral domain. This leads to greater
numerical efficiency. Prior work on the spectral formulation of the boundary
integral equation method has performed the elastodynamic convolution of the
slip at the interface. In the present work, the convolution is performed of the
shear stress at the interface. The spectral formulation is developed both for
an interface between identical solids and for a bi-material interface. It is
validated by numerically calculating the response of the interface to harmonic
and to impulsive disturbances and comparing with known analytical solutions. To
illustrate use of the method, dynamic slip rupture propagation with a
slip-weakening friction law is simulated.
","[{'version': 'v1', 'created': 'Tue, 16 Feb 2021 12:18:12 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Mar 2021 02:39:15 GMT'}, {'version': 'v3', 'created': 'Sun, 28 Nov 2021 03:47:37 GMT'}]",2021-11-30,"[['Ranjith', 'Kunnath', '']]","['Boundary integral equation method', 'elasticity', 'waves', 'slip', 'spectral', 'modal']"
389,1502.00258,Liang Lin,"Xiaodan Liang, Liang Lin, Liangliang Cao","Learning Latent Spatio-Temporal Compositional Model for Human Action
  Recognition","This manuscript has 10 pages with 7 figures, and a preliminary
  version was published in ACM MM'13",,10.1145/2502081.2502089,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Action recognition is an important problem in multimedia understanding. This
paper addresses this problem by building an expressive compositional action
model. We model one action instance in the video with an ensemble of
spatio-temporal compositions: a number of discrete temporal anchor frames, each
of which is further decomposed to a layout of deformable parts. In this way,
our model can identify a Spatio-Temporal And-Or Graph (STAOG) to represent the
latent structure of actions e.g. triple jumping, swinging and high jumping. The
STAOG model comprises four layers: (i) a batch of leaf-nodes in bottom for
detecting various action parts within video patches; (ii) the or-nodes over
bottom, i.e. switch variables to activate their children leaf-nodes for
structural variability; (iii) the and-nodes within an anchor frame for
verifying spatial composition; and (iv) the root-node at top for aggregating
scores over temporal anchor frames. Moreover, the contextual interactions are
defined between leaf-nodes in both spatial and temporal domains. For model
training, we develop a novel weakly supervised learning algorithm which
iteratively determines the structural configuration (e.g. the production of
leaf-nodes associated with the or-nodes) along with the optimization of
multi-layer parameters. By fully exploiting spatio-temporal compositions and
interactions, our approach handles well large intra-class action variance (e.g.
different views, individual appearances, spatio-temporal structures). The
experimental results on the challenging databases demonstrate superior
performance of our approach over other competing methods.
","[{'version': 'v1', 'created': 'Sun, 1 Feb 2015 13:49:31 GMT'}]",2015-02-03,"[['Liang', 'Xiaodan', ''], ['Lin', 'Liang', ''], ['Cao', 'Liangliang', '']]","['Video Understanding', 'Action Recognition', 'Structural Learning', 'AndOr Graph']"
390,1406.7168,Amelia Carolina Sparavigna,Amelia Carolina Sparavigna,Co-occurrence matrices of time series applied to literary works,"Literary experiments, Time series, Co-occurrence plots, Harry Potter","ijSciences, 2014, Volume 3, Issue 7, Pages: 12-18",10.18483/ijSci.533,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, it has been proposed to analyse the literary works, plays or
novels, using graphs to display the social network of their interacting
characters. In this approach, the timeline of the literary work is lost,
because the storyline is projected on a planar graph. However, timelines can be
used to build some time series and analyse the work by means of vectors and
matrices. These series can be used to describe the presence and relevance, not
only of words in the text, but also of persons and places portrayed in the
drama or novel. In this framework, we discuss here an approach with
co-occurrence matrices plotted over time, concerning the presence of characters
in the pages of a novel. These matrices are similar to those appearing in
recurrence plots.
","[{'version': 'v1', 'created': 'Fri, 27 Jun 2014 12:37:46 GMT'}]",2015-08-06,"[['Sparavigna', 'Amelia Carolina', '']]","['Literary experiments', 'Time series', 'Co-occurrence plots', 'Harry Potter']"
391,1902.08985,Marc Aubreville,"Marc Aubreville, Miguel Goncalves, Christian Knipfer, Nicolai Oetter,
  Helmut Neumann, Florian Stelzle, Christopher Bohr, Andreas Maier","Transferability of Deep Learning Algorithms for Malignancy Detection in
  Confocal Laser Endomicroscopy Images from Different Anatomical Locations of
  the Upper Gastrointestinal Tract","Erratum for version 1, correcting the number of CLE image sequences
  used in one data set",BIOSTEC 2018: Biomedical Engineering Systems and Technologies,10.1007/978-3-030-29196-9_4,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Squamous Cell Carcinoma (SCC) is the most common cancer type of the
epithelium and is often detected at a late stage. Besides invasive diagnosis of
SCC by means of biopsy and histo-pathologic assessment, Confocal Laser
Endomicroscopy (CLE) has emerged as noninvasive method that was successfully
used to diagnose SCC in vivo. For interpretation of CLE images, however,
extensive training is required, which limits its applicability and use in
clinical practice of the method. To aid diagnosis of SCC in a broader scope,
automatic detection methods have been proposed. This work compares two methods
with regard to their applicability in a transfer learning sense, i.e. training
on one tissue type (from one clinical team) and applying the learnt
classification system to another entity (different anatomy, different clinical
team). Besides a previously proposed, patch-based method based on convolutional
neural networks, a novel classification method on image level (based on a
pre-trained Inception V.3 network with dedicated preprocessing and
interpretation of class activation maps) is proposed and evaluated. The newly
presented approach improves recognition performance, yielding accuracies of
91.63% on the first data set (oral cavity) and 92.63% on a joint data set. The
generalization from oral cavity to the second data set (vocal folds) lead to
similar area-under-the-ROC curve values than a direct training on the vocal
folds data set, indicating good generalization.
","[{'version': 'v1', 'created': 'Sun, 24 Feb 2019 17:38:25 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Jan 2020 13:38:45 GMT'}]",2020-01-06,"[['Aubreville', 'Marc', ''], ['Goncalves', 'Miguel', ''], ['Knipfer', 'Christian', ''], ['Oetter', 'Nicolai', ''], ['Neumann', 'Helmut', ''], ['Stelzle', 'Florian', ''], ['Bohr', 'Christopher', ''], ['Maier', 'Andreas', '']]","['Confocal Laser Endomicroscopy', 'Transfer Learning', 'Head', 'Neck Squamous Cell Carcinoma']"
392,1811.02965,Valdemar \v{S}v\'abensk\'y,"Martin Ukrop, Valdemar \v{S}v\'abensk\'y, Jan Nehyba",Reflective Diary for Professional Development of Novice Teachers,"ACM SIGCSE 2019 conference, 7 pages, 2 figures",,10.1145/3287324.3287448,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many starting teachers of computer science have great professional skill but
often lack pedagogical training. Since providing expert mentorship directly
during their lessons would be quite costly, institutions usually offer separate
teacher training sessions for novice instructors. However, the reflection on
teaching performed with a significant delay after the taught lesson limits the
possible impact on teachers. To bridge this gap, we introduced a weekly
semi-structured reflective practice to supplement the teacher training sessions
at our faculty. We created a paper diary that guides the starting teachers
through the process of reflection. Over the course of the semester, the diary
poses questions of increasing complexity while also functioning as a reference
to the topics covered in teacher training. Piloting the diary on a group of 25
novice teaching assistants resulted in overwhelmingly positive responses and
provided the teacher training sessions with valuable input for discussion. The
diary also turned out to be applicable in a broader context: it was appreciated
and used by several experienced university teachers from multiple faculties and
even some high-school teachers. The diary is freely available online, including
source and print versions.
","[{'version': 'v1', 'created': 'Wed, 7 Nov 2018 16:30:24 GMT'}]",2018-11-08,"[['Ukrop', 'Martin', ''], ['Švábenský', 'Valdemar', ''], ['Nehyba', 'Jan', '']]","['reflective practice', 'learning journal', 'teacher training', 'teaching assistants', 'teaching skills']"
393,0904.2061,Zhigang Cao,"Zhigang Cao, Xiaoguang Yang",Selfish Bin Covering,16 pages,"Theoretical Computer Science, 412, 2011, 7049-7058",10.1016/j.tcs.2011.09.017,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we address the selfish bin covering problem, which is greatly
related both to the bin covering problem, and to the weighted majority game.
What we mainly concern is how much the lack of coordination harms the social
welfare. Besides the standard PoA and PoS, which are based on Nash equilibrium,
we also take into account the strong Nash equilibrium, and several other new
equilibria. For each equilibrium, the corresponding PoA and PoS are given, and
the problems of computing an arbitrary equilibrium, as well as approximating
the best one, are also considered.
","[{'version': 'v1', 'created': 'Tue, 14 Apr 2009 07:17:01 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Jul 2009 14:22:34 GMT'}]",2011-11-10,"[['Cao', 'Zhigang', ''], ['Yang', 'Xiaoguang', '']]","['Selfish bin covering', 'weighted majority games', 'price of anarchy', 'price of stability', 'Nash equilibrium']"
394,2301.06629,David D. Nguyen,"David D. Nguyen, Surya Nepal, Salil S. Kanhere",Diverse Multimedia Layout Generation with Multi Choice Learning,9 pages,"Proceedings of the 29th ACM International Conference on Multimedia
  2021",10.1145/3474085.3475525,mfp1907,cs.CV cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Designing visually appealing layouts for multimedia documents containing
text, graphs and images requires a form of creative intelligence. Modelling the
generation of layouts has recently gained attention due to its importance in
aesthetics and communication style. In contrast to standard prediction tasks,
there are a range of acceptable layouts which depend on user preferences. For
example, a poster designer may prefer logos on the top-left while another
prefers logos on the bottom-right. Both are correct choices yet existing
machine learning models treat layouts as a single choice prediction problem. In
such situations, these models would simply average over all possible choices
given the same input forming a degenerate sample. In the above example, this
would form an unacceptable layout with a logo in the centre. In this paper, we
present an auto-regressive neural network architecture, called LayoutMCL, that
uses multi-choice prediction and winner-takes-all loss to effectively stabilise
layout generation. LayoutMCL avoids the averaging problem by using multiple
predictors to learn a range of possible options for each layout object. This
enables LayoutMCL to generate multiple and diverse layouts from a single input
which is in contrast with existing approaches which yield similar layouts with
minor variations. Through quantitative benchmarks on real data (magazine,
document and mobile app layouts), we demonstrate that LayoutMCL reduces
Fr\'echet Inception Distance (FID) by 83-98% and generates significantly more
diversity in comparison to existing approaches.
","[{'version': 'v1', 'created': 'Mon, 16 Jan 2023 22:53:55 GMT'}]",2023-01-18,"[['Nguyen', 'David D.', ''], ['Nepal', 'Surya', ''], ['Kanhere', 'Salil S.', '']]","['multimedia applications', 'neural networks', 'generative models', 'creative intelligence', 'layouts', 'multi-choice learning', 'mixture models']"
395,1907.06498,Emrah Basaran,"Emrah Basaran, Muhittin Gokmen, Mustafa E. Kamasak","An Efficient Framework for Visible-Infrared Cross Modality Person
  Re-Identification",,,10.1016/j.image.2020.115933,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visible-infrared cross-modality person re-identification (VI-ReId) is an
essential task for video surveillance in poorly illuminated or dark
environments. Despite many recent studies on person re-identification in the
visible domain (ReId), there are few studies dealing specifically with VI-ReId.
Besides challenges that are common for both ReId and VI-ReId such as
pose/illumination variations, background clutter and occlusion, VI-ReId has
additional challenges as color information is not available in infrared images.
As a result, the performance of VI-ReId systems is typically lower than that of
ReId systems. In this work, we propose a four-stream framework to improve
VI-ReId performance. We train a separate deep convolutional neural network in
each stream using different representations of input images. We expect that
different and complementary features can be learned from each stream. In our
framework, grayscale and infrared input images are used to train the ResNet in
the first stream. In the second stream, RGB and three-channel infrared images
(created by repeating the infrared channel) are used. In the remaining two
streams, we use local pattern maps as input images. These maps are generated
utilizing local Zernike moments transformation. Local pattern maps are obtained
from grayscale and infrared images in the third stream and from RGB and
three-channel infrared images in the last stream. We improve the performance of
the proposed framework by employing a re-ranking algorithm for post-processing.
Our results indicate that the proposed framework outperforms current
state-of-the-art with a large margin by improving Rank-1/mAP by 29.79%/30.91%
on SYSU-MM01 dataset, and by 9.73%/16.36% on RegDB dataset.
","[{'version': 'v1', 'created': 'Mon, 15 Jul 2019 13:32:15 GMT'}, {'version': 'v2', 'created': 'Sun, 2 Aug 2020 03:41:05 GMT'}]",2020-08-04,"[['Basaran', 'Emrah', ''], ['Gokmen', 'Muhittin', ''], ['Kamasak', 'Mustafa E.', '']]","['Person re-identification', 'cross modality person re-identification', 'local Zernike moments']"
396,1507.06689,Sarah Alice Gaggl,"Sarah A. Gaggl, Norbert Manthey, Alessandro Ronca, Johannes P.
  Wallner, Stefan Woltran",Improved Answer-Set Programming Encodings for Abstract Argumentation,"To appear in Theory and Practice of Logic Programming (TPLP),
  Proceedings of ICLP 2015",Theory and Practice of Logic Programming 15 (2015) 434-448,10.1017/S1471068415000149,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The design of efficient solutions for abstract argumentation problems is a
crucial step towards advanced argumentation systems. One of the most prominent
approaches in the literature is to use Answer-Set Programming (ASP) for this
endeavor. In this paper, we present new encodings for three prominent
argumentation semantics using the concept of conditional literals in
disjunctions as provided by the ASP-system clingo. Our new encodings are not
only more succinct than previous versions, but also outperform them on standard
benchmarks.
","[{'version': 'v1', 'created': 'Thu, 23 Jul 2015 21:43:48 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Oct 2015 13:54:18 GMT'}]",2020-02-19,"[['Gaggl', 'Sarah A.', ''], ['Manthey', 'Norbert', ''], ['Ronca', 'Alessandro', ''], ['Wallner', 'Johannes P.', ''], ['Woltran', 'Stefan', '']]","['Answer-Set Programming', 'Abstract Argumentation', 'Implementation', 'ASPARTIX']"
397,1304.0156,M.M.A. Hashem,"Mohammad Ashekur Rahman, Atanu Barai, Md. Asadul Islam and M.M.A
  Hashem","Development of a Device for Remote Monitoring of Heart Rate and Body
  Temperature",,"Procs. of the IEEE 2012 15th International Conference on Computer
  & Information Technology (ICCIT 2012), pp.411-416, Chittagong, Bangladesh,
  December 22-24, (2012)",10.1109/ICCITechn.2012.6509783,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new integrated, portable device to provide a convenient solution
for remote monitoring heart rate at the fingertip and body temperature using
Ethernet technology and widely spreading internet. Now a days, heart related
disease is rising. Most of the times in these cases, patients may not realize
their actual conditions and even it is a common fact that there are no doctors
by their side, especially in rural areas, but now a days most of the diseases
are curable if detected in time.
  We have tried to make a system which may give information about one's
physical condition and help him or her to detect these deadly but curable
diseases. The system gives information of heart rate and body temperature
simultaneously acquired on the portable side in real time and transmits results
to web. In this system, the condition of heart and body temperature can be
monitored from remote places. Eventually, this device provides a low cost,
easily accessible human health monitor solution bridging the gaps between
patients and doctors.
","[{'version': 'v1', 'created': 'Sun, 31 Mar 2013 05:44:47 GMT'}]",2016-11-15,"[['Rahman', 'Mohammad Ashekur', ''], ['Barai', 'Atanu', ''], ['Islam', 'Md. Asadul', ''], ['Hashem', 'M. M. A', '']]","['Body Temperature', 'Ethernet', 'Heart Rate', 'Infrared Transmitter', 'Infrared Receiver', 'Microcontroller']"
398,1007.5127,Secretary Ijsea,"Zeeshan Ahmed (University of Wuerzburg, Germany)","Towards Performance Measurement And Metrics Based Analysis of PLA
  Applications","15 pages, 12 figures","International Journal of Software Engineering & Applications 1.3
  (2010) 66-80",10.5121/ijsea.2010.1305,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This article is about a measurement analysis based approach to help software
practitioners in managing the additional level complexities and variabilities
in software product line applications. The architecture of the proposed
approach i.e. ZAC is designed and implemented to perform preprocessesed source
code analysis, calculate traditional and product line metrics and visualize
results in two and three dimensional diagrams. Experiments using real time data
sets are performed which concluded with the results that the ZAC can be very
helpful for the software practitioners in understanding the overall structure
and complexity of product line applications. Moreover the obtained results
prove strong positive correlation between calculated traditional and product
line measures.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2010 07:08:52 GMT'}]",2010-07-30,"[['Ahmed', 'Zeeshan', '', 'University of Wuerzburg, Germany']]","['Analysis', 'Measurement', 'Software product lines', 'Variability']"
399,1511.08118,D\v{z}enan Zuki\'c,"D\v{z}enan Zuki\'c and Julien Finet and Emmanuel Wilson and Filip
  Banovac and Giuseppe Esposito and Kevin Cleary and Andinet Enquobahrie","SlicerPET: A workflow based software module for PET/CT guided needle
  biopsy",,,10.1007/s11548-015-1213-2,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Biopsy is commonly used to confirm cancer diagnosis when radiologically
indicated. Given the ability of PET to localize malignancies in heterogeneous
tumors and tumors that do not have a CT correlate, PET/CT guided biopsy may
improve the diagnostic yield of biopsies. To facilitate PET/CT guided needle
biopsy, we developed a workflow that allows us to bring PET image guidance into
the interventional CT suite. In this abstract, we present SlicerPET, a
user-friendly workflow based module developed using open source software
libraries to guide needle biopsy in the interventional suite.
","[{'version': 'v1', 'created': 'Wed, 25 Nov 2015 17:02:20 GMT'}]",2015-11-26,"[['Zukić', 'Dženan', ''], ['Finet', 'Julien', ''], ['Wilson', 'Emmanuel', ''], ['Banovac', 'Filip', ''], ['Esposito', 'Giuseppe', ''], ['Cleary', 'Kevin', ''], ['Enquobahrie', 'Andinet', '']]","['Image Guided Therapy', 'PET/CT', 'PET', 'CT', 'Needle Biopsy', 'Liver Biopsy', 'Open Source Software']"
400,1509.08700,Mendes Oulamara,"Mendes Oulamara (ENS Paris), Arnaud Venet (NASA - ARC)","Abstract Interpretation with Higher-Dimensional Ellipsoids and Conic
  Extrapolation","Proceedings, Part I, Computer Aided Verification 27th International
  Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015",,10.1007/978-3-319-21690-4_24,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The inference and the verification of numerical relationships among variables
of a program is one of the main goals of static analysis. In this paper, we
propose an Abstract Interpretation framework based on higher-dimensional
ellipsoids to automatically discover symbolic quadratic invariants within
loops, using loop counters as implicit parameters. In order to obtain
non-trivial invariants, the diameter of the set of values taken by the
numerical variables of the program has to evolve (sub-)linearly during loop
iterations. These invariants are called ellipsoidal cones and can be seen as an
extension of constructs used in the static analysis of digital filters.
Semidefinite programming is used to both compute the numerical results of the
domain operations and provide proofs (witnesses) of their correctness.
","[{'version': 'v1', 'created': 'Tue, 29 Sep 2015 11:53:10 GMT'}]",2015-09-30,"[['Oulamara', 'Mendes', '', 'ENS Paris'], ['Venet', 'Arnaud', '', 'NASA - ARC']]","['static analysis', 'semidefinite programming', 'ellipsoids', 'conicextrapolation']"
401,1509.01815,Valery Vilisov,Valery Vilisov,"Research: Analysis of Transport Model that Approximates Decision Taker's
  Preferences",,,10.13140/RG.2.1.5085.6166,,cs.LG cs.AI math.OC stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Paper provides a method for solving the reverse Monge-Kantorovich transport
problem (TP). It allows to accumulate positive decision-taking experience made
by decision-taker in situations that can be presented in the form of TP. The
initial data for the solution of the inverse TP is the information on orders,
inventories and effective decisions take by decision-taker. The result of
solving the inverse TP contains evaluations of the TPs payoff matrix elements.
It can be used in new situations to select the solution corresponding to the
preferences of the decision-taker. The method allows to gain decision-taker
experience, so it can be used by others. The method allows to build the model
of decision-taker preferences in a specific application area. The model can be
updated regularly to ensure its relevance and adequacy to the decision-taker
system of preferences. This model is adaptive to the current preferences of the
decision taker.
","[{'version': 'v1', 'created': 'Sun, 6 Sep 2015 14:25:45 GMT'}]",2015-09-08,"[['Vilisov', 'Valery', '']]","['transport problem', 'reverse problem', 'decision-taking', 'decision-making', 'adaptation']"
402,1604.06158,Andrew Connor,"Matthew Martin, James Charlton and Andy M. Connor",Augmented Body: Changing Interactive Body Play,,,10.1145/2677758.2677790,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates the player's body as a system capable of unfamiliar
interactive movement achieved through digital mediation in a playful
environment. Body interactions in both digital and non-digital environments can
be considered as a perceptually manipulative exploration of self. This implies
a player may alter how they perceive their body and its operations in order to
create a new playful and original experience. This paper therefore questions
how player interaction can change as their perception of their body changes
using augmentative technology.
","[{'version': 'v1', 'created': 'Thu, 21 Apr 2016 02:02:13 GMT'}]",2016-04-22,"[['Martin', 'Matthew', ''], ['Charlton', 'James', ''], ['Connor', 'Andy M.', '']]","['Augmented reality', 'interaction design', 'body interaction']"
403,1709.02858,Aritra Banerjee,"Aritra Banerjee, Shrey Choudhary","Advanced Page Rank Algorithm with Semantics, In Links, Out Links and
  Google Analytics","6 pages, 2 figures, Published with International Journal of Computer
  Trends and Technology (IJCTT)","International Journal of Computer Trends and Technology(IJCTT) V50
  (3):137-142, August 2017. ISSN:2231-2803. Published by Seventh Sense Research
  Group",10.14445/22312803/IJCTT-V50P124,,cs.SI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we have modified the existing page ranking mechanism as an
advanced Page Rank Algorithm based on Semantics Inlinks Outlinks and Google
Analytics. We have used Semantics page ranking to rank pages according to the
word searched and match it with the metadata of the website and provide a value
of rank according to the highest priority.We have also used Google analytics to
store the number of hits of a website in a particular variable and add the
required percentage amount to the ranking procedure.The proposed algorithm is
used to find more relevant information according to users query.So this concept
is very useful to display most valuable pages on the top of the result list on
the basis of user browsing behaviour which reduce the search space to a large
scale.
","[{'version': 'v1', 'created': 'Thu, 7 Sep 2017 13:17:46 GMT'}]",2017-09-12,"[['Banerjee', 'Aritra', ''], ['Choudhary', 'Shrey', '']]","['PageRank', 'Semantics', 'Inlinks', 'Outlinks and Google Analytics']"
404,1907.07962,Camille Roth,"Agathe Baltzer, M\'arton Karsai, Camille Roth",Interactional and Informational Attention on Twitter,"16 pages, 6 figures","Information 2019, 10(8), 250",10.3390/info10080250,,cs.SI cs.CY physics.data-an physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Twitter may be considered as a decentralized social information processing
platform whose users constantly receive their followees' information feeds,
which they may in turn dispatch to their followers. This decentralization is
not devoid of hierarchy and heterogeneity, both in terms of activity and
attention. In particular, we appraise the distribution of attention at the
collective and individual level, which exhibits the existence of attentional
constraints and focus effects. We observe that most users usually concentrate
their attention on a limited core of peers and topics, and discuss the
relationship between interactional and informational attention processes -- all
of which, we suggest, may be useful to refine influence models by enabling the
consideration of differential attention likelihood depending on users, their
activity levels and peers' positions.
","[{'version': 'v1', 'created': 'Thu, 18 Jul 2019 10:13:04 GMT'}]",2020-04-27,"[['Baltzer', 'Agathe', ''], ['Karsai', 'Márton', ''], ['Roth', 'Camille', '']]","['attention', 'influence', 'ego-centered networks', 'Twitter study', 'information spreading']"
405,1301.2010,Maheswara Rao Valluri,"Maheswara Rao Valluri (School of Mathematical and Computing Sciences,
  Fiji National University, Derrick Campus, Suva, Fiji)",Authentication Schemes Using Polynomials Over Non-Commutative Rings,"International Journal on Cryptography and Information Security
  (IJCIS),Vol.2, No.4, December 2012",,10.5121/ijcis.2012.2406,,cs.CR math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Authentication is a process by which an entity,which could be a person or
intended computer,establishes its identity to another entity.In private and
public computer networks including the Internet,authentication is commonly done
through the use of logon passwords. Knowledge of the password is assumed to
guarantee that the user is authentic.Internet business and many other
transactions require a more stringent authentication process. The aim of this
paper is to propose two authentication schemes based on general non-commutative
rings. The key idea of the schemes is that for a given non-commutative ring;
one can build polynomials on additive structure and takes them as underlying
work structure. By doing so, one can implement authentication schemes, one of
them being zero-knowledge interactive proofs of knowledge, on multiplicative
structure of the ring. The security of the schemes is based on the
intractability of the polynomial symmetrical decomposition problem over the
given non-commutative ring.
","[{'version': 'v1', 'created': 'Thu, 10 Jan 2013 00:23:35 GMT'}]",2013-01-11,"[['Valluri', 'Maheswara Rao', '', 'School of Mathematical and Computing Sciences,\n  Fiji National University, Derrick Campus, Suva, Fiji']]","['Authentication', 'Cryptography', 'Non-commutative rings', 'Polynomial rings', 'Protocols', '&Security']"
406,1602.00269,Sunil Mandhan,"Sarath P R, Sunil Mandhan, Yoshiki Niwa",Numerical Atrribute Extraction from Clinical Texts,6 Pages,,10.13140/RG.2.1.4763.3365,"Submission 42, CLEF 2015",cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes about information extraction system, which is an
extension of the system developed by team Hitachi for ""Disease/Disorder
Template filling"" task organized by ShARe/CLEF eHealth Evolution Lab 2014. In
this extension module we focus on extraction of numerical attributes and values
from discharge summary records and associating correct relation between
attributes and values. We solve the problem in two steps. First step is
extraction of numerical attributes and values, which is developed as a Named
Entity Recognition (NER) model using Stanford NLP libraries. Second step is
correctly associating the attributes to values, which is developed as a
relation extraction module in Apache cTAKES framework. We integrated Stanford
NER model as cTAKES pipeline component and used in relation extraction module.
Conditional Random Field (CRF) algorithm is used for NER and Support Vector
Machines (SVM) for relation extraction. For attribute value relation
extraction, we observe 95% accuracy using NER alone and combined accuracy of
87% with NER and SVM.
","[{'version': 'v1', 'created': 'Sun, 31 Jan 2016 15:58:51 GMT'}]",2016-02-02,"[['R', 'Sarath P', ''], ['Mandhan', 'Sunil', ''], ['Niwa', 'Yoshiki', '']]","['NLP', 'NER', 'relation extraction', 'information extraction', 'crf', 'svm']"
407,1905.03288,Abu Sufian,"Farhana Sultana, A. Sufian and Paramartha Dutta",Advancements in Image Classification using Convolutional Neural Network,"9 pages, 15 figures, 3 Tables. Submitted to 2018 Fourth International
  Conference on Research in Computational Intelligence and Communication
  Networks(ICRCICN 2018)","2018 Fourth International Conference on Research in Computational
  Intelligence and Communication Networks (ICRCICN)",10.1109/ICRCICN.2018.8718718,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convolutional Neural Network (CNN) is the state-of-the-art for image
classification task. Here we have briefly discussed different components of
CNN. In this paper, We have explained different CNN architectures for image
classification. Through this paper, we have shown advancements in CNN from
LeNet-5 to latest SENet model. We have discussed the model description and
training details of each model. We have also drawn a comparison among those
models.
","[{'version': 'v1', 'created': 'Wed, 8 May 2019 18:34:19 GMT'}]",2019-05-27,"[['Sultana', 'Farhana', ''], ['Sufian', 'A.', ''], ['Dutta', 'Paramartha', '']]","['AlexNet', 'Capsnet', 'Convolutional Neural Network', 'Deep learning', 'DenseNet', 'Image classification', 'ResNet', 'SENet']"
408,1812.11586,Veronica Vilaplana,"Marc G\'orriz, Albert Aparicio, Berta Ravent\'os, Ver\'onica
  Vilaplana, Elisa Sayrol and Daniel L\'opez-Codina","Leishmaniasis Parasite Segmentation and Classification using Deep
  Learning","10th International Conference, AMDO 2018, Palma de Mallorca, Spain,
  July 12-13, 2018, Proceedings","Articulated Motion and Deformable Objects, Series volume 10945 ,
  2018, Springer International Publishing AG, part of Springer Nature",10.1007/978-3-319-94544-6,,cs.CV cs.AI cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Leishmaniasis is considered a neglected disease that causes thousands of
deaths annually in some tropical and subtropical countries. There are various
techniques to diagnose leishmaniasis of which manual microscopy is considered
to be the gold standard. There is a need for the development of automatic
techniques that are able to detect parasites in a robust and unsupervised
manner. In this paper we present a procedure for automatizing the detection
process based on a deep learning approach. We train a U-net model that
successfully segments leismania parasites and classifies them into
promastigotes, amastigotes and adhered parasites.
","[{'version': 'v1', 'created': 'Sun, 30 Dec 2018 18:42:08 GMT'}]",2019-01-01,"[['Górriz', 'Marc', ''], ['Aparicio', 'Albert', ''], ['Raventós', 'Berta', ''], ['Vilaplana', 'Verónica', ''], ['Sayrol', 'Elisa', ''], ['López-Codina', 'Daniel', '']]","['leishmaniosi', 'deep learning', 'segmentation']"
409,1808.01477,Hacer Yalim Keles,Long Ang Lim and Hacer Yalim Keles,Learning Multi-scale Features for Foreground Segmentation,,,10.1007/s10044-019-00845-9,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Foreground segmentation algorithms aim segmenting moving objects from the
background in a robust way under various challenging scenarios. Encoder-decoder
type deep neural networks that are used in this domain recently perform
impressive segmentation results. In this work, we propose a novel robust
encoder-decoder structure neural network that can be trained end-to-end using
only a few training examples. The proposed method extends the Feature Pooling
Module (FPM) of FgSegNet by introducing features fusions inside this module,
which is capable of extracting multi-scale features within images; resulting in
a robust feature pooling against camera motion, which can alleviate the need of
multi-scale inputs to the network. Our method outperforms all existing
state-of-the-art methods in CDnet2014 dataset by an average overall F-Measure
of 0.9847. We also evaluate the effectiveness of our method on SBI2015 and UCSD
Background Subtraction datasets. The source code of the proposed method is made
available at https://github.com/lim-anggun/FgSegNet_v2 .
","[{'version': 'v1', 'created': 'Sat, 4 Aug 2018 12:55:25 GMT'}]",2019-09-04,"[['Lim', 'Long Ang', ''], ['Keles', 'Hacer Yalim', '']]","['Foregroundsegmentation', 'convolutional neural networks', 'feature poolingmodule', 'background subtraction']"
410,2102.06901,Tuukka Korhonen,Tuukka Korhonen,Lower Bounds on Dynamic Programming for Maximum Weight Independent Set,"14 pages, to appear in ICALP 2021",,10.4230/LIPIcs.ICALP.2021.87,,cs.CC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove lower bounds on pure dynamic programming algorithms for maximum
weight independent set (MWIS). We model such algorithms as tropical circuits,
i.e., circuits that compute with $\max$ and $+$ operations. For a graph $G$, an
MWIS-circuit of $G$ is a tropical circuit whose inputs correspond to vertices
of $G$ and which computes the weight of a maximum weight independent set of $G$
for any assignment of weights to the inputs. We show that if $G$ has treewidth
$w$ and maximum degree $d$, then any MWIS-circuit of $G$ has $2^{\Omega(w/d)}$
gates and that if $G$ is planar, or more generally $H$-minor-free for any fixed
graph $H$, then any MWIS-circuit of $G$ has $2^{\Omega(w)}$ gates. An
MWIS-formula is an MWIS-circuit where each gate has fan-out at most one. We
show that if $G$ has treedepth $t$ and maximum degree $d$, then any
MWIS-formula of $G$ has $2^{\Omega(t/d)}$ gates. It follows that treewidth
characterizes optimal MWIS-circuits up to polynomials for all bounded degree
graphs and $H$-minor-free graphs, and treedepth characterizes optimal
MWIS-formulas up to polynomials for all bounded degree graphs.
","[{'version': 'v1', 'created': 'Sat, 13 Feb 2021 11:26:43 GMT'}, {'version': 'v2', 'created': 'Fri, 30 Apr 2021 05:51:10 GMT'}]",2022-02-08,"[['Korhonen', 'Tuukka', '']]","['Maximum weight independent set', 'Treewidth', 'Tropical circuits', 'Dynamicprogramming', 'Treedepth', 'Monotone circuit complexity']"
411,1901.04077,Mohamed Shehata,"Mohamed Shehata, Reda Abo-Al-Ez, Farid Zaghlool and Mohamed Taha
  Abou-Kreisha",Vehicles Detection Based on Background Modeling,"4 pages, 4 figures","International Journal of Engineering Trends and Technology 66.2
  (2018): 92-95",10.14445/22315381/IJETT-V66P216,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background image subtraction algorithm is a common approach which detects
moving objects in a video sequence by finding the significant difference
between the video frames and the static background model. This paper presents a
developed system which achieves vehicle detection by using background image
subtraction algorithm based on blocks followed by deep learning data validation
algorithm. The main idea is to segment the image into equal size blocks, to
model the static reference background image (SRBI), by calculating the variance
between each block pixels and each counterpart block pixels in the adjacent
frame, the system implemented into four different methods: Absolute Difference,
Image Entropy, Exclusive OR (XOR) and Discrete Cosine Transform (DCT). The
experimental results showed that the DCT method has the highest vehicle
detection accuracy.
","[{'version': 'v1', 'created': 'Sun, 13 Jan 2019 22:41:18 GMT'}]",2019-01-23,"[['Shehata', 'Mohamed', ''], ['Abo-Al-Ez', 'Reda', ''], ['Zaghlool', 'Farid', ''], ['Abou-Kreisha', 'Mohamed Taha', '']]","['video processing', 'object detection', 'DCT', 'image entropy']"
412,2105.05796,Tomasz Stanis{\l}awek,"Tomasz Stanis{\l}awek and Filip Grali\'nski and Anna Wr\'oblewska and
  Dawid Lipi\'nski and Agnieszka Kaliska and Paulina Rosalska and Bartosz
  Topolski and Przemys{\l}aw Biecek","Kleister: Key Information Extraction Datasets Involving Long Documents
  with Complex Layouts",accepted to ICDAR 2021,"International Conference on Document Analysis and Recognition
  ICDAR 2021",10.1007/978-3-030-86549-8_36,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The relevance of the Key Information Extraction (KIE) task is increasingly
important in natural language processing problems. But there are still only a
few well-defined problems that serve as benchmarks for solutions in this area.
To bridge this gap, we introduce two new datasets (Kleister NDA and Kleister
Charity). They involve a mix of scanned and born-digital long formal
English-language documents. In these datasets, an NLP system is expected to
find or infer various types of entities by employing both textual and
structural layout features. The Kleister Charity dataset consists of 2,788
annual financial reports of charity organizations, with 61,643 unique pages and
21,612 entities to extract. The Kleister NDA dataset has 540 Non-disclosure
Agreements, with 3,229 unique pages and 2,160 entities to extract. We provide
several state-of-the-art baseline systems from the KIE domain (Flair, BERT,
RoBERTa, LayoutLM, LAMBERT), which show that our datasets pose a strong
challenge to existing models. The best model achieved an 81.77% and an 83.57%
F1-score on respectively the Kleister NDA and the Kleister Charity datasets. We
share the datasets to encourage progress on more in-depth and complex
information extraction tasks.
","[{'version': 'v1', 'created': 'Wed, 12 May 2021 17:08:01 GMT'}]",2022-11-28,"[['Stanisławek', 'Tomasz', ''], ['Graliński', 'Filip', ''], ['Wróblewska', 'Anna', ''], ['Lipiński', 'Dawid', ''], ['Kaliska', 'Agnieszka', ''], ['Rosalska', 'Paulina', ''], ['Topolski', 'Bartosz', ''], ['Biecek', 'Przemysław', '']]","['Key Information Extraction', 'Visually Rich Documents', 'NamedEntity Recognition']"
413,1609.09179,Lucas Assun\c{c}\~ao,"Lucas Assun\c{c}\~ao, Thiago F. Noronha, Andr\'ea Cynthia Santos,
  Rafael Andrade","A linear programming based heuristic framework for min-max regret
  combinatorial optimization problems with interval costs",,,10.1016/j.cor.2016.12.010,,cs.DS cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work deals with a class of problems under interval data uncertainty,
namely interval robust-hard problems, composed of interval data min-max regret
generalizations of classical NP-hard combinatorial problems modeled as 0-1
integer linear programming problems. These problems are more challenging than
other interval data min-max regret problems, as solely computing the cost of
any feasible solution requires solving an instance of an NP-hard problem. The
state-of-the-art exact algorithms in the literature are based on the generation
of a possibly exponential number of cuts. As each cut separation involves the
resolution of an NP-hard classical optimization problem, the size of the
instances that can be solved efficiently is relatively small. To smooth this
issue, we present a modeling technique for interval robust-hard problems in the
context of a heuristic framework. The heuristic obtains feasible solutions by
exploring dual information of a linearly relaxed model associated with the
classical optimization problem counterpart. Computational experiments for
interval data min-max regret versions of the restricted shortest path problem
and the set covering problem show that our heuristic is able to find optimal or
near-optimal solutions and also improves the primal bounds obtained by a
state-of-the-art exact algorithm and a 2-approximation procedure for interval
data min-max regret problems.
","[{'version': 'v1', 'created': 'Thu, 29 Sep 2016 02:32:29 GMT'}]",2016-12-21,"[['Assunção', 'Lucas', ''], ['Noronha', 'Thiago F.', ''], ['Santos', 'Andréa Cynthia', ''], ['Andrade', 'Rafael', '']]","['Robust optimization', 'Matheuristics', 'Benders’ decomposition']"
414,1807.10819,Andrew Jesson D,"Andrew Jesson, Nicolas Guizard, Sina Hamidi Ghalehjegh, Damien Goblot,
  Florian Soudan, Nicolas Chapados",CASED: Curriculum Adaptive Sampling for Extreme Data Imbalance,"20th International Conference on Medical Image Computing and Computer
  Assisted Intervention 2017",,10.1007/978-3-319-66179-7_73,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce CASED, a novel curriculum sampling algorithm that facilitates
the optimization of deep learning segmentation or detection models on data sets
with extreme class imbalance. We evaluate the CASED learning framework on the
task of lung nodule detection in chest CT. In contrast to two-stage solutions,
wherein nodule candidates are first proposed by a segmentation model and
refined by a second detection stage, CASED improves the training of deep nodule
segmentation models (e.g. UNet) to the point where state of the art results are
achieved using only a trivial detection stage. CASED improves the optimization
of deep segmentation models by allowing them to first learn how to distinguish
nodules from their immediate surroundings, while continuously adding a greater
proportion of difficult-to-classify global context, until uniformly sampling
from the empirical data distribution. Using CASED during training yields a
minimalist proposal to the lung nodule detection problem that tops the LUNA16
nodule detection benchmark with an average sensitivity score of 88.35%.
Furthermore, we find that models trained using CASED are robust to nodule
annotation quality by showing that comparable results can be achieved when only
a point and radius for each ground truth nodule are provided during training.
Finally, the CASED learning framework makes no assumptions with regard to
imaging modality or segmentation target and should generalize to other medical
imaging problems where class imbalance is a persistent problem.
","[{'version': 'v1', 'created': 'Fri, 27 Jul 2018 20:10:11 GMT'}]",2018-07-31,"[['Jesson', 'Andrew', ''], ['Guizard', 'Nicolas', ''], ['Ghalehjegh', 'Sina Hamidi', ''], ['Goblot', 'Damien', ''], ['Soudan', 'Florian', ''], ['Chapados', 'Nicolas', '']]","['lung cancer', 'computer aided detection', 'nodule detection', 'curriculum learning', 'data imbalance', '3D convolutional neural networks']"
415,1907.11817,Firas Alomari,"F Alomari, M Harbi",Scalable Source Code Similarity Detection in Large Code Repositories,"11 pages, 5 figures, Journal","EAI Endorsed Transactions on Scalable Information Systems: Online
  first, 2019",10.4108/eai.13-7-2018.159353,,cs.SE cs.IR cs.PL,http://creativecommons.org/licenses/by/4.0/,"  Source code similarity are increasingly used in application development to
identify clones, isolate bugs, and find copy-rights violations. Similar code
fragments can be very problematic due to the fact that errors in the original
code must be fixed in every copy. Other maintenance changes, such as extensions
or patches, must be applied multiple times. Furthermore, the diversity of
coding styles and flexibility of modern languages makes it difficult and cost
ineffective to manually inspect large code repositories. Therefore, detection
is only feasible by automatic techniques. We present an efficient and scalable
approach for similar code fragment identification based on source code control
flow graphs fingerprinting. The source code is processed to generate control
flow graphs that are then hashed to create a unique fingerprint of the code
capturing semantics as well as syntax similarity. The fingerprints can then be
efficiently stored and retrieved to perform similarity search between code
fragments. Experimental results from our prototype implementation supports the
validity of our approach and show its effectiveness and efficiency in
comparison with other solutions.
","[{'version': 'v1', 'created': 'Fri, 26 Jul 2019 23:28:30 GMT'}]",2019-07-30,"[['Alomari', 'F', ''], ['Harbi', 'M', '']]","['clones', 'software similarity', 'Control Flow Graphs', 'Fingerprints']"
416,1309.3096,Neetu Goel,"Neetu Goel, R.B. Garg","Simulation of an Optimum Multilevel Dynamic Round Robin Scheduling
  Algorithm","International Journal of Computer Applications, Aug 2013",,10.5120/13263-0743,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CPU scheduling has valiant effect on resource utilization as well as overall
quality of the system. Round Robin algorithm performs optimally in time shared
systems, but it performs more number of context switches, larger waiting time
and larger response time. In order to simulate the behavior of various CPU
scheduling algorithms and to improve Round Robin scheduling algorithm using
dynamic time slice concept, in this paper we produce the implementation of new
CPU scheduling algorithm called An Optimum Multilevel Dynamic Round Robin
Scheduling (OMDRRS), which calculates intelligent time slice and warps after
every round of execution. The results display the robustness of this software,
especially for academic, research and experimental use, as well as proving the
desirability and efficiency of the probabilistic algorithm over the other
existing techniques and it is observed that this OMDRRS projects good
performance as compared to the other existing CPU scheduling algorithms.
","[{'version': 'v1', 'created': 'Thu, 12 Sep 2013 10:26:10 GMT'}]",2015-06-17,"[['Goel', 'Neetu', ''], ['Garg', 'R. B.', '']]","['Operating System', 'FCFS', 'SJF', 'Dynamic Time Slice', 'Context Switch', 'Waiting time', 'Turnaround time']"
417,1207.4308,Alejandro Frery,"Maria E. Buemi, Marta Mejail, Julio Jacobo, Alejandro C. Frery and
  Heitor S. Ramos",Assessment of SAR Image Filtering using Adaptive Stack Filters,,"Proceedings 16th Iberoamerican Congress on Pattern Recognition
  (CIARP 2011), Lecture Notes in Computer Science vol. 7042, p. 89--96",10.1007/978-3-642-25085-9_10,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stack filters are a special case of non-linear filters. They have a good
performance for filtering images with different types of noise while preserving
edges and details. A stack filter decomposes an input image into several binary
images according to a set of thresholds. Each binary image is then filtered by
a Boolean function, which characterizes the filter. Adaptive stack filters can
be designed to be optimal; they are computed from a pair of images consisting
of an ideal noiseless image and its noisy version. In this work we study the
performance of adaptive stack filters when they are applied to Synthetic
Aperture Radar (SAR) images. This is done by evaluating the quality of the
filtered images through the use of suitable image quality indexes and by
measuring the classification accuracy of the resulting images.
","[{'version': 'v1', 'created': 'Wed, 18 Jul 2012 09:16:07 GMT'}]",2012-07-19,"[['Buemi', 'Maria E.', ''], ['Mejail', 'Marta', ''], ['Jacobo', 'Julio', ''], ['Frery', 'Alejandro C.', ''], ['Ramos', 'Heitor S.', '']]","['Non-linear filters', 'speckle noise', 'stack filters', 'SAR image filtering']"
418,1903.03061,Tahar Kechadi M,"Damir Kahvedzic, Tahar Kechadi","DIALOG: A framework for modeling, analysis and reuse of digital forensic
  knowledge",,"Digital Investigation Volume 6, Supplement, September 2009, Pages
  S23-S33",10.1016/j.diin.2009.06.014,,cs.DL cs.AI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents DIALOG (Digital Investigation Ontology); a framework for
the management, reuse, and analysis of Digital Investigation knowledge. DIALOG
provides a general, application independent vocabulary that can be used to
describe an investigation at different levels of detail. DIALOG is defined to
encapsulate all concepts of the digital forensics field and the relationships
between them. In particular, we concentrate on the Windows Registry, where
registry keys are modeled in terms of both their structure and function.
Registry analysis software tools are modeled in a similar manner and we
illustrate how the interpretation of their results can be done using the
reasoning capabilities of ontology
","[{'version': 'v1', 'created': 'Thu, 21 Feb 2019 13:47:02 GMT'}]",2019-03-08,"[['Kahvedzic', 'Damir', ''], ['Kechadi', 'Tahar', '']]","['Windows', 'Registry', 'Digital', 'Investigation', 'Ontology']"
419,1808.09891,Zhan Su,"Peng Zhang, Zhan Su, Lipeng Zhang, Benyou Wang, Dawei Song",A Quantum Many-body Wave Function Inspired Language Modeling Approach,"10 pages,4 figures,CIKM","The 27th ACM International Conference on Information and Knowledge
  Management, October 22--26, 2018, Torino, Italy",10.1145/3269206.3271723,fp0675,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The recently proposed quantum language model (QLM) aimed at a principled
approach to modeling term dependency by applying the quantum probability
theory. The latest development for a more effective QLM has adopted word
embeddings as a kind of global dependency information and integrated the
quantum-inspired idea in a neural network architecture. While these
quantum-inspired LMs are theoretically more general and also practically
effective, they have two major limitations. First, they have not taken into
account the interaction among words with multiple meanings, which is common and
important in understanding natural language text. Second, the integration of
the quantum-inspired LM with the neural network was mainly for effective
training of parameters, yet lacking a theoretical foundation accounting for
such integration. To address these two issues, in this paper, we propose a
Quantum Many-body Wave Function (QMWF) inspired language modeling approach. The
QMWF inspired LM can adopt the tensor product to model the aforesaid
interaction among words. It also enables us to reveal the inherent necessity of
using Convolutional Neural Network (CNN) in QMWF language modeling.
Furthermore, our approach delivers a simple algorithm to represent and match
text/sentence pairs. Systematic evaluation shows the effectiveness of the
proposed QMWF-LM algorithm, in comparison with the state of the art
quantum-inspired LMs and a couple of CNN-based methods, on three typical
Question Answering (QA) datasets.
","[{'version': 'v1', 'created': 'Tue, 28 Aug 2018 13:39:44 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Aug 2018 02:34:18 GMT'}, {'version': 'v3', 'created': 'Mon, 3 Sep 2018 14:23:37 GMT'}]",2018-09-05,"[['Zhang', 'Peng', ''], ['Su', 'Zhan', ''], ['Zhang', 'Lipeng', ''], ['Wang', 'Benyou', ''], ['Song', 'Dawei', '']]","['Language modeling', 'quantum many-body wave function', 'convolutional neural network']"
420,0811.4170,Alain Barrat,"Alain Barrat, Ciro Cattuto, Vittoria Colizza, Jean-Francois Pinton,
  Wouter Van den Broeck, Alessandro Vespignani","High resolution dynamical mapping of social interactions with active
  RFID",,PLoS ONE 5(7): e11596 (2010),10.1371/journal.pone.0011596,,cs.CY cs.HC physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present an experimental framework to gather data on
face-to-face social interactions between individuals, with a high spatial and
temporal resolution. We use active Radio Frequency Identification (RFID)
devices that assess contacts with one another by exchanging low-power radio
packets. When individuals wear the beacons as a badge, a persistent radio
contact between the RFID devices can be used as a proxy for a social
interaction between individuals. We present the results of a pilot study
recently performed during a conference, and a subsequent preliminary data
analysis, that provides an assessment of our method and highlights its
versatility and applicability in many areas concerned with human dynamics.
","[{'version': 'v1', 'created': 'Tue, 25 Nov 2008 20:54:34 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Nov 2008 21:01:28 GMT'}]",2010-08-18,"[['Barrat', 'Alain', ''], ['Cattuto', 'Ciro', ''], ['Colizza', 'Vittoria', ''], ['Pinton', 'Jean-Francois', ''], ['Broeck', 'Wouter Van den', ''], ['Vespignani', 'Alessandro', '']]","['RFID', 'sensor networks', 'human dynamics', 'social network analysis', 'epidemiology']"
421,1408.4245,Dmitry Ustalov,Dmitry Ustalov,Towards crowdsourcing and cooperation in linguistic resources,"11 pages, 2 figures, accepted to RuSSIR 2014, the final publication
  is available at link.springer.com",,10.1007/978-3-319-25485-2_14,,cs.SI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linguistic resources can be populated with data through the use of such
approaches as crowdsourcing and gamification when motivated people are
involved. However, current crowdsourcing genre taxonomies lack the concept of
cooperation, which is the principal element of modern video games and may
potentially drive the annotators' interest. This survey on crowdsourcing
taxonomies and cooperation in linguistic resources provides recommendations on
using cooperation in existent genres of crowdsourcing and an evidence of the
efficiency of cooperation using a popular Russian linguistic resource created
through crowdsourcing as an example.
","[{'version': 'v1', 'created': 'Tue, 19 Aug 2014 08:32:49 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Apr 2017 12:23:03 GMT'}]",2017-04-25,"[['Ustalov', 'Dmitry', '']]","['games with a purpose', 'mechanized labor', 'wisdom of thecrowd', 'gamification', 'crowdsourcing', 'cooperation', 'linguistic resources']"
422,1502.06703,Smitha M.L.,"B.H. Shekar, Smitha M.L., P. Shivakumara","Discrete Wavelet Transform and Gradient Difference based approach for
  text localization in videos","Fifth International Conference on Signals and Image Processing, IEEE,
  DOI 10.1109/ICSIP.2014.50, pp. 280-284, held at BNMIT, Bangalore in January
  2014",,10.1109/ICSIP.2014.50,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The text detection and localization is important for video analysis and
understanding. The scene text in video contains semantic information and thus
can contribute significantly to video retrieval and understanding. However,
most of the approaches detect scene text in still images or single video frame.
Videos differ from images in temporal redundancy. This paper proposes a novel
hybrid method to robustly localize the texts in natural scene images and videos
based on fusion of discrete wavelet transform and gradient difference. A set of
rules and geometric properties have been devised to localize the actual text
regions. Then, morphological operation is performed to generate the text
regions and finally the connected component analysis is employed to localize
the text in a video frame. The experimental results obtained on publicly
available standard ICDAR 2003 and Hua dataset illustrate that the proposed
method can accurately detect and localize texts of various sizes, fonts and
colors. The experimentation on huge collection of video databases reveal the
suitability of the proposed method to video databases.
","[{'version': 'v1', 'created': 'Tue, 24 Feb 2015 07:46:34 GMT'}]",2015-02-25,"[['Shekar', 'B. H.', ''], ['L.', 'Smitha M.', ''], ['Shivakumara', 'P.', '']]","['Shot detection', 'Key Frame Extraction', 'DiscreteWavelet Transform', 'Gradient Difference', 'Text Localization']"
423,1806.00917,Roger Paredes,"R. Paredes, L. Duenas-Osorio, K.S. Meel, M.Y. Vardi",Principled Network Reliability Approximation: A Counting-Based Approach,,,10.1016/j.ress.2019.04.025,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  As engineered systems expand, become more interdependent, and operate in
real-time, reliability assessment is indispensable to support investment and
decision making. However, network reliability problems are known to be
#P-complete, a computational complexity class largely believed to be
intractable. The computational intractability of network reliability motivates
our quest for reliable approximations. Based on their theoretical foundations,
available methods can be grouped as follows: (i) exact or bounds, (ii)
guarantee-less sampling, and (iii) probably approximately correct (PAC). Group
(i) is well regarded due to its useful byproducts, but it does not scale in
practice. Group (ii) scales well and verifies desirable properties, such as the
bounded relative error, but it lacks error guarantees. Group (iii) is of great
interest when precision and scalability are required, as it harbors
computationally feasible approximation schemes with PAC-guarantees. We give a
comprehensive review of classical methods before introducing modern techniques
and our developments. We introduce K-RelNet, an extended counting-based
estimation method that delivers PAC-guarantees for the K-terminal reliability
problem. Then, we test methods' performance using various benchmark systems. We
highlight the range of application of algorithms and provide the foundation for
future resilience engineering as it increasingly necessitates methods for
uncertainty quantification in complex systems.
","[{'version': 'v1', 'created': 'Mon, 4 Jun 2018 01:43:31 GMT'}, {'version': 'v2', 'created': 'Wed, 1 May 2019 22:36:00 GMT'}]",2019-05-03,"[['Paredes', 'R.', ''], ['Duenas-Osorio', 'L.', ''], ['Meel', 'K. S.', ''], ['Vardi', 'M. Y.', '']]","['network reliability', 'FPRAS', 'PAC', 'relative variance', 'uncertainty', 'model counting', 'satisfiability']"
424,0905.3640,Mattheos Protopapas,"Mattheos K. Protopapas, Elias B. Kosmatopoulos, Francesco Battaglia","Coevolutionary Genetic Algorithms for Establishing Nash Equilibrium in
  Symmetric Cournot Games","18 pages, 4 figures","Advances in Decision Sciences, vol. 2010, Article ID 573107",10.1155/2010/573107,,cs.GT cs.LG,http://creativecommons.org/licenses/by/3.0/,"  We use co-evolutionary genetic algorithms to model the players' learning
process in several Cournot models, and evaluate them in terms of their
convergence to the Nash Equilibrium. The ""social-learning"" versions of the two
co-evolutionary algorithms we introduce, establish Nash Equilibrium in those
models, in contrast to the ""individual learning"" versions which, as we see
here, do not imply the convergence of the players' strategies to the Nash
outcome. When players use ""canonical co-evolutionary genetic algorithms"" as
learning algorithms, the process of the game is an ergodic Markov Chain, and
therefore we analyze simulation results using both the relevant methodology and
more general statistical tests, to find that in the ""social"" case, states
leading to NE play are highly frequent at the stationary distribution of the
chain, in contrast to the ""individual learning"" case, when NE is not reached at
all in our simulations; to find that the expected Hamming distance of the
states at the limiting distribution from the ""NE state"" is significantly
smaller in the ""social"" than in the ""individual learning case""; to estimate the
expected time that the ""social"" algorithms need to get to the ""NE state"" and
verify their robustness and finally to show that a large fraction of the games
played are indeed at the Nash Equilibrium.
","[{'version': 'v1', 'created': 'Fri, 22 May 2009 19:07:21 GMT'}]",2010-05-13,"[['Protopapas', 'Mattheos K.', ''], ['Kosmatopoulos', 'Elias B.', ''], ['Battaglia', 'Francesco', '']]","['Genetic Algorithms', 'Cournot oligopoly', 'Evolutionary GameTheory', 'Nash Equilibrium']"
425,1705.06681,Luisa Herrmann,"Zolt\'an F\""ul\""op and Luisa Herrmann and Heiko Vogler",Weighted Regular Tree Grammars with Storage,added errata,"Discrete Mathematics & Theoretical Computer Science, Vol. 20 no.
  1, Automata, Logic and Semantics (July 3, 2018) dmtcs:4660",10.23638/DMTCS-20-1-26,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce weighted regular tree grammars with storage as combination of
(a) regular tree grammars with storage and (b) weighted tree automata over
multioperator monoids. Each weighted regular tree grammar with storage
generates a weighted tree language, which is a mapping from the set of trees to
the multioperator monoid. We prove that, for multioperator monoids canonically
associated to particular strong bi-monoids, the support of the generated
weighted tree languages can be generated by (unweighted) regular tree grammars
with storage. We characterize the class of all generated weighted tree
languages by the composition of three basic concepts. Moreover, we prove
results on the elimination of chain rules and of finite storage types, and we
characterize weighted regular tree grammars with storage by a new weighted
MSO-logic.
","[{'version': 'v1', 'created': 'Thu, 18 May 2017 16:34:49 GMT'}, {'version': 'v2', 'created': 'Sat, 20 May 2017 03:47:37 GMT'}, {'version': 'v3', 'created': 'Tue, 23 May 2017 07:36:22 GMT'}, {'version': 'v4', 'created': 'Fri, 8 Jun 2018 16:28:28 GMT'}, {'version': 'v5', 'created': 'Mon, 2 Jul 2018 16:36:22 GMT'}, {'version': 'v6', 'created': 'Thu, 2 Jul 2020 19:39:52 GMT'}]",2020-07-06,"[['Fülöp', 'Zoltán', ''], ['Herrmann', 'Luisa', ''], ['Vogler', 'Heiko', '']]","['regular tree grammars', 'weighted tree automata', 'multioperator monoids', 'storage types', 'weighted MSOlogic']"
426,1208.5556,Alireza Nemaney Pour,"Alireza Nemaney Pour, Raheleh Kholghi, Soheil Behnam Roudsari","Minimizing the Time of Spam Mail Detection by Relocating Filtering
  System to the Sender Mail Server","10 pages, 7 figures","International Journal of Network Security & Its Applications
  (IJNSA), Vol.4, No.2, March 2012",10.5121/ijnsa.2012.4204,,cs.IR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Unsolicited Bulk Emails (also known as Spam) are undesirable emails sent to
massive number of users. Spam emails consume the network resources and cause
lots of security uncertainties. As we studied, the location where the spam
filter operates in is an important parameter to preserve network resources.
Although there are many different methods to block spam emails, most of program
developers only intend to block spam emails from being delivered to their
clients. In this paper, we will introduce a new and efficient approach to
prevent spam emails from being transferred. The result shows that if we focus
on developing a filtering method for spams emails in the sender mail server
rather than the receiver mail server, we can detect the spam emails in the
shortest time consequently to avoid wasting network resources.
","[{'version': 'v1', 'created': 'Tue, 28 Aug 2012 04:33:29 GMT'}]",2012-08-29,"[['Pour', 'Alireza Nemaney', ''], ['Kholghi', 'Raheleh', ''], ['Roudsari', 'Soheil Behnam', '']]","['Anti-spams', 'Receiver mail server', 'Sender mail server', 'Spam Email']"
427,2102.03339,Thibaut Verron,Maria Francis and Thibaut Verron,"On Two Signature Variants Of Buchberger's Algorithm Over Principal Ideal
  Domains","9 pages, 0 figures, accepted at ISSAC'21",,10.1145/3452143.3465522,,cs.SC math.AC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Signature-based algorithms have brought large improvements in the
performances of Gr\""obner bases algorithms for polynomial systems over fields.
Furthermore, they yield additional data which can be used, for example, to
compute the module of syzygies of an ideal or to compute coefficients in terms
of the input generators.
  In this paper, we examine two variants of Buchberger's algorithm to compute
Gr\""obner bases over principal ideal domains, with the addition of signatures.
The first one is adapted from Kandri-Rody and Kapur's algorithm, whereas the
second one uses the ideas developed in the algorithms by L. Pan (1989) and D.
Lichtblau (2012). The differences in constructions between the algorithms
entail differences in the operations which are compatible with the signatures,
and in the criteria which can be used to discard elements.
  We prove that both algorithms are correct and discuss their relative
performances in a prototype implementation in Magma.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2021 18:40:51 GMT'}, {'version': 'v2', 'created': 'Tue, 25 May 2021 10:53:50 GMT'}]",2021-05-26,"[['Francis', 'Maria', ''], ['Verron', 'Thibaut', '']]","['Algorithms', 'Gröbner bases', 'Signature-based algorithms', 'Polynomials over rings', 'Principal Ideal Domains']"
428,2105.10878,Guandong Xu,"Hamad Zogan, Imran Razzak, Shoaib Jameel, Guandong Xu","DepressionNet: A Novel Summarization Boosted Deep Framework for
  Depression Detection on Social Media",,,10.1145/3404835.3462938,,cs.LG cs.CL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Twitter is currently a popular online social media platform which allows
users to share their user-generated content. This publicly-generated user data
is also crucial to healthcare technologies because the discovered patterns
would hugely benefit them in several ways. One of the applications is in
automatically discovering mental health problems, e.g., depression. Previous
studies to automatically detect a depressed user on online social media have
largely relied upon the user behaviour and their linguistic patterns including
user's social interactions. The downside is that these models are trained on
several irrelevant content which might not be crucial towards detecting a
depressed user. Besides, these content have a negative impact on the overall
efficiency and effectiveness of the model. To overcome the shortcomings in the
existing automatic depression detection methods, we propose a novel
computational framework for automatic depression detection that initially
selects relevant content through a hybrid extractive and abstractive
summarization strategy on the sequence of all user tweets leading to a more
fine-grained and relevant content. The content then goes to our novel deep
learning framework comprising of a unified learning machinery comprising of
Convolutional Neural Network (CNN) coupled with attention-enhanced Gated
Recurrent Units (GRU) models leading to better empirical performance than
existing strong baselines.
","[{'version': 'v1', 'created': 'Sun, 23 May 2021 08:05:53 GMT'}]",2021-05-25,"[['Zogan', 'Hamad', ''], ['Razzak', 'Imran', ''], ['Jameel', 'Shoaib', ''], ['Xu', 'Guandong', '']]","['depression detection', 'social network', 'deep learning', 'machine learning', 'text summarization']"
429,1803.04566,Nicholas Waytowich,"Nicholas R. Waytowich, Vernon Lawhern, Javier O. Garcia, Jennifer
  Cummings, Josef Faller, Paul Sajda, Jean M. Vettel","Compact Convolutional Neural Networks for Classification of Asynchronous
  Steady-state Visual Evoked Potentials",Accepted for publication at the Journal of Neural Engineering,,10.1088/1741-2552/aae5d8,,cs.LG q-bio.NC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Steady-State Visual Evoked Potentials (SSVEPs) are neural oscillations from
the parietal and occipital regions of the brain that are evoked from flickering
visual stimuli. SSVEPs are robust signals measurable in the
electroencephalogram (EEG) and are commonly used in brain-computer interfaces
(BCIs). However, methods for high-accuracy decoding of SSVEPs usually require
hand-crafted approaches that leverage domain-specific knowledge of the stimulus
signals, such as specific temporal frequencies in the visual stimuli and their
relative spatial arrangement. When this knowledge is unavailable, such as when
SSVEP signals are acquired asynchronously, such approaches tend to fail. In
this paper, we show how a compact convolutional neural network (Compact-CNN),
which only requires raw EEG signals for automatic feature extraction, can be
used to decode signals from a 12-class SSVEP dataset without the need for any
domain-specific knowledge or calibration data. We report across subject mean
accuracy of approximately 80% (chance being 8.3%) and show this is
substantially better than current state-of-the-art hand-crafted approaches
using canonical correlation analysis (CCA) and Combined-CCA. Furthermore, we
analyze our Compact-CNN to examine the underlying feature representation,
discovering that the deep learner extracts additional phase and amplitude
related features associated with the structure of the dataset. We discuss how
our Compact-CNN shows promise for BCI applications that allow users to freely
gaze/attend to any stimulus at any time (e.g., asynchronous BCI) as well as
provides a method for analyzing SSVEP signals in a way that might augment our
understanding about the basic processing in the visual cortex.
","[{'version': 'v1', 'created': 'Mon, 12 Mar 2018 23:03:44 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Oct 2018 16:53:26 GMT'}]",2018-10-10,"[['Waytowich', 'Nicholas R.', ''], ['Lawhern', 'Vernon', ''], ['Garcia', 'Javier O.', ''], ['Cummings', 'Jennifer', ''], ['Faller', 'Josef', ''], ['Sajda', 'Paul', ''], ['Vettel', 'Jean M.', '']]","['Brain-Computer Interface', 'EEG', 'Deep Learning', 'Convolutional Neural Network', 'Steady-state visual evoked potentials']"
430,0711.0840,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",A thread calculus with molecular dynamics,"47 pages; examples and results added, phrasing improved, references
  replaced","Information and Computation, 208(7):817-844, 2010",10.1016/j.ic.2010.01.004,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a theory of threads, interleaving of threads, and interaction
between threads and services with features of molecular dynamics, a model of
computation that bears on computations in which dynamic data structures are
involved. Threads can interact with services of which the states consist of
structured data objects and computations take place by means of actions which
may change the structure of the data objects. The features introduced include
restriction of the scope of names used in threads to refer to data objects.
Because that feature makes it troublesome to provide a model based on
structural operational semantics and bisimulation, we construct a projective
limit model for the theory.
","[{'version': 'v1', 'created': 'Tue, 6 Nov 2007 11:25:20 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Nov 2008 09:29:03 GMT'}]",2010-05-18,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['thread calculus', 'thread algebra', 'molecular dynamics', 'restriction', 'projective limit model']"
431,1702.01805,Renato J Cintra,"F. M. Bayer, R. J. Cintra, A. Edirisuriya, A. Madanayake","A Digital Hardware Fast Algorithm and FPGA-based Prototype for a Novel
  16-point Approximate DCT for Image Compression Applications","17 pages, 6 figures, 6 tables","Measurement Science and Technology, Volume 23, Number 11, 2012",10.1088/0957-0233/23/11/114010,,cs.MM cs.AR cs.DS cs.IT math.IT stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The discrete cosine transform (DCT) is the key step in many image and video
coding standards. The 8-point DCT is an important special case, possessing
several low-complexity approximations widely investigated. However, 16-point
DCT transform has energy compaction advantages. In this sense, this paper
presents a new 16-point DCT approximation with null multiplicative complexity.
The proposed transform matrix is orthogonal and contains only zeros and ones.
The proposed transform outperforms the well-know Walsh-Hadamard transform and
the current state-of-the-art 16-point approximation. A fast algorithm for the
proposed transform is also introduced. This fast algorithm is experimentally
validated using hardware implementations that are physically realized and
verified on a 40 nm CMOS Xilinx Virtex-6 XC6VLX240T FPGA chip for a maximum
clock rate of 342 MHz. Rapid prototypes on FPGA for 8-bit input word size shows
significant improvement in compressed image quality by up to 1-2 dB at the cost
of only eight adders compared to the state-of-art 16-point DCT approximation
algorithm in the literature [S. Bouguezel, M. O. Ahmad, and M. N. S. Swamy. A
novel transform for image compression. In {\em Proceedings of the 53rd IEEE
International Midwest Symposium on Circuits and Systems (MWSCAS)}, 2010].
","[{'version': 'v1', 'created': 'Mon, 6 Feb 2017 22:00:34 GMT'}]",2017-02-08,"[['Bayer', 'F. M.', ''], ['Cintra', 'R. J.', ''], ['Edirisuriya', 'A.', ''], ['Madanayake', 'A.', '']]","['DCT Approximation', 'Fast algorithms', 'FPGA']"
432,1912.02260,Jessica Thompson,"Jessica A.F. Thompson, Yoshua Bengio, Marc Schoenwiesner","The effect of task and training on intermediate representations in
  convolutional neural networks revealed with modified RV similarity analysis","4 pages, 4 figures, Conference on Cognitive Computational
  Neuroscience 2019",,10.32470/CCN.2019.1300-0,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Centered Kernel Alignment (CKA) was recently proposed as a similarity metric
for comparing activation patterns in deep networks. Here we experiment with the
modified RV-coefficient (RV2), which has very similar properties as CKA while
being less sensitive to dataset size. We compare the representations of
networks that received varying amounts of training on different layers: a
standard trained network (all parameters updated at every step), a freeze
trained network (layers gradually frozen during training), random networks
(only some layers trained), and a completely untrained network. We found that
RV2 was able to recover expected similarity patterns and provide interpretable
similarity matrices that suggested hypotheses about how representations are
affected by different training recipes. We propose that the superior
performance achieved by freeze training can be attributed to representational
differences in the penultimate layer. Our comparisons of random networks
suggest that the inputs and targets serve as anchors on the representations in
the lowest and highest layers.
","[{'version': 'v1', 'created': 'Wed, 4 Dec 2019 21:43:57 GMT'}]",2019-12-06,"[['Thompson', 'Jessica A. F.', ''], ['Bengio', 'Yoshua', ''], ['Schoenwiesner', 'Marc', '']]","['similarity analysis', 'random features', 'CNNs', 'freezetraining', 'RV coefficient']"
433,1107.5556,Flavio Cruz,Flavio Cruz and Ricardo Rocha,"Efficient Instance Retrieval of Subgoals for Subsumptive Tabled
  Evaluation of Logic Programs","Theory and Practice of Logic Programming, 27th Int'l. Conference on
  Logic Programming (ICLP 2011) Special Issue, volume 11, issue 4-5","Theory and Practice of Logic Programming, Volume 11, Special Issue
  4-5, July 2011, pp 697-712 Published Cambridge University Press 2011",10.1017/S1471068411000251,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tabled evaluation is an implementation technique that solves some problems of
traditional Prolog systems in dealing with recursion and redundant
computations. Most tabling engines determine if a tabled subgoal will produce
or consume answers by using variant checks. A more refined method, named call
subsumption, considers that a subgoal A will consume from a subgoal B if A is
subsumed by (an instance of) B, thus allowing greater answer reuse. We recently
developed an extension, called Retroactive Call Subsumption, that improves upon
call subsumption by supporting bidirectional sharing of answers between
subsumed/subsuming subgoals. In this paper, we present both an algorithm and an
extension to the table space data structures to efficiently implement instance
retrieval of subgoals for subsumptive tabled evaluation of logic programs.
Experiments results using the YapTab tabling system show that our
implementation performs quite well on some complex benchmarks and is robust
enough to handle a large number of subgoals without performance degradation.
","[{'version': 'v1', 'created': 'Wed, 27 Jul 2011 18:31:13 GMT'}]",2011-07-29,"[['Cruz', 'Flavio', ''], ['Rocha', 'Ricardo', '']]","['Tabled Evaluation', 'Call Subsumption', 'Implementation']"
434,1901.09082,Arjun Pakrashi,"Arjun Pakrashi, Bidyut B. Chaudhuri","A Kalman filtering induced heuristic optimization based partitional data
  clustering",,,10.1016/j.ins.2016.07.057,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering algorithms have regained momentum with recent popularity of data
mining and knowledge discovery approaches. To obtain good clustering in
reasonable amount of time, various meta-heuristic approaches and their
hybridization, sometimes with K-Means technique, have been employed. A Kalman
Filtering based heuristic approach called Heuristic Kalman Algorithm (HKA) has
been proposed a few years ago, which may be used for optimizing an objective
function in data/feature space. In this paper at first HKA is employed in
partitional data clustering. Then an improved approach named HKA-K is proposed,
which combines the benefits of global exploration of HKA and the fast
convergence of K-Means method. Implemented and tested on several datasets from
UCI machine learning repository, the results obtained by HKA-K were compared
with other hybrid meta-heuristic clustering approaches. It is shown that HKA-K
is atleast as good as and often better than the other compared algorithms.
","[{'version': 'v1', 'created': 'Fri, 25 Jan 2019 21:09:35 GMT'}]",2019-01-29,"[['Pakrashi', 'Arjun', ''], ['Chaudhuri', 'Bidyut B.', '']]","['Clustering', 'K-Means', 'Optimization', 'Metaheuristic Optimization', 'Heuristics']"
435,1408.0101,Sandeep Kumar,"Sandeep Kumar, Vivek Kumar Sharma, Rajani Kumari",Memetic Search in Differential Evolution Algorithm,,,10.5120/15582-4406,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Differential Evolution (DE) is a renowned optimization stratagem that can
easily solve nonlinear and comprehensive problems. DE is a well known and
uncomplicated population based probabilistic approach for comprehensive
optimization. It has apparently outperformed a number of Evolutionary
Algorithms and further search heuristics in the vein of Particle Swarm
Optimization at what time of testing over both yardstick and actual world
problems. Nevertheless, DE, like other probabilistic optimization algorithms,
from time to time exhibits precipitate convergence and stagnates at suboptimal
position. In order to stay away from stagnation behavior while maintaining an
excellent convergence speed, an innovative search strategy is introduced, named
memetic search in DE. In the planned strategy, positions update equation
customized as per a memetic search stratagem. In this strategy a better
solution participates more times in the position modernize procedure. The
position update equation is inspired from the memetic search in artificial bee
colony algorithm. The proposed strategy is named as Memetic Search in
Differential Evolution (MSDE). To prove efficiency and efficacy of MSDE, it is
tested over 8 benchmark optimization problems and three real world optimization
problems. A comparative analysis has also been carried out among proposed MSDE
and original DE. Results show that the anticipated algorithm go one better than
the basic DE and its recent deviations in a good number of the experiments.
","[{'version': 'v1', 'created': 'Fri, 1 Aug 2014 08:45:14 GMT'}]",2015-06-22,"[['Kumar', 'Sandeep', ''], ['Sharma', 'Vivek Kumar', ''], ['Kumari', 'Rajani', '']]","['Differential Evolution', 'Swarm intelligence', 'Evolutionary computation', 'Memetic algorithm']"
436,1408.5951,Ashish Hota,"Ashish R. Hota, Siddharth Garg, Shreyas Sundaram",Fragility of the Commons under Prospect-Theoretic Risk Attitudes,"Accepted for publication in Games and Economic Behavior, 2016",,10.1016/j.geb.2016.06.003,,cs.GT q-fin.EC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We study a common-pool resource game where the resource experiences failure
with a probability that grows with the aggregate investment in the resource. To
capture decision making under such uncertainty, we model each player's risk
preference according to the value function from prospect theory. We show the
existence and uniqueness of a pure Nash equilibrium when the players have
heterogeneous risk preferences and under certain assumptions on the rate of
return and failure probability of the resource. Greater competition, vis-a-vis
the number of players, increases the failure probability at the Nash
equilibrium; we quantify this effect by obtaining bounds on the ratio of the
failure probability at the Nash equilibrium to the failure probability under
investment by a single user. We further show that heterogeneity in attitudes
towards loss aversion leads to higher failure probability of the resource at
the equilibrium.
","[{'version': 'v1', 'created': 'Tue, 26 Aug 2014 00:22:36 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Dec 2014 08:55:18 GMT'}, {'version': 'v3', 'created': 'Tue, 30 Jun 2015 17:42:21 GMT'}, {'version': 'v4', 'created': 'Fri, 20 May 2016 16:19:10 GMT'}, {'version': 'v5', 'created': 'Thu, 30 Jun 2016 22:20:32 GMT'}]",2016-07-04,"[['Hota', 'Ashish R.', ''], ['Garg', 'Siddharth', ''], ['Sundaram', 'Shreyas', '']]","['Tragedy of the commons', 'Common-pool resource', 'Resource dilemma', 'Risk heterogeneity', 'Loss aversion', 'Prospect theory', 'Inefficiency of equilibria']"
437,1907.11093,Pengyi Zhangpy,"Pengyi Zhang, Yunxin Zhong, Xiaoqiong Li","SlimYOLOv3: Narrower, Faster and Better for Real-Time UAV Applications",,,10.1109/ICCVW.2019.00011,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Drones or general Unmanned Aerial Vehicles (UAVs), endowed with computer
vision function by on-board cameras and embedded systems, have become popular
in a wide range of applications. However, real-time scene parsing through
object detection running on a UAV platform is very challenging, due to limited
memory and computing power of embedded devices. To deal with these challenges,
in this paper we propose to learn efficient deep object detectors through
channel pruning of convolutional layers. To this end, we enforce channel-level
sparsity of convolutional layers by imposing L1 regularization on channel
scaling factors and prune less informative feature channels to obtain ""slim""
object detectors. Based on such approach, we present SlimYOLOv3 with fewer
trainable parameters and floating point operations (FLOPs) in comparison of
original YOLOv3 (Joseph Redmon et al., 2018) as a promising solution for
real-time object detection on UAVs. We evaluate SlimYOLOv3 on VisDrone2018-Det
benchmark dataset; compelling results are achieved by SlimYOLOv3 in comparison
of unpruned counterpart, including ~90.8% decrease of FLOPs, ~92.0% decline of
parameter size, running ~2 times faster and comparable detection accuracy as
YOLOv3. Experimental results with different pruning ratios consistently verify
that proposed SlimYOLOv3 with narrower structure are more efficient, faster and
better than YOLOv3, and thus are more suitable for real-time object detection
on UAVs. Our codes are made publicly available at
https://github.com/PengyiZhang/SlimYOLOv3.
","[{'version': 'v1', 'created': 'Thu, 25 Jul 2019 14:22:43 GMT'}]",2020-05-04,"[['Zhang', 'Pengyi', ''], ['Zhong', 'Yunxin', ''], ['Li', 'Xiaoqiong', '']]","['SlimYOLOv3', 'object detection', 'drone', 'channel pruning', 'sparsity training']"
438,1406.3506,Hadi Fanaee-T,Hadi Fanaee-T and Jo\~ao Gama,Eigenspace Method for Spatiotemporal Hotspot Detection,To appear in Expert Systems Journal,,10.1111/exsy.12088,,cs.AI stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hotspot detection aims at identifying subgroups in the observations that are
unexpected, with respect to the some baseline information. For instance, in
disease surveillance, the purpose is to detect sub-regions in spatiotemporal
space, where the count of reported diseases (e.g. Cancer) is higher than
expected, with respect to the population. The state-of-the-art method for this
kind of problem is the Space-Time Scan Statistics (STScan), which exhaustively
search the whole space through a sliding window looking for significant
spatiotemporal clusters. STScan makes some restrictive assumptions about the
distribution of data, the shape of the hotspots and the quality of data, which
can be unrealistic for some nontraditional data sources. A novel methodology
called EigenSpot is proposed where instead of an exhaustive search over the
space, tracks the changes in a space-time correlation structure. Not only does
the new approach presents much more computational efficiency, but also makes no
assumption about the data distribution, hotspot shape or the data quality. The
principal idea is that with the joint combination of abnormal elements in the
principal spatial and the temporal singular vectors, the location of hotspots
in the spatiotemporal space can be approximated. A comprehensive experimental
evaluation, both on simulated and real data sets reveals the effectiveness of
the proposed method.
","[{'version': 'v1', 'created': 'Fri, 13 Jun 2014 11:26:13 GMT'}]",2014-09-23,"[['Fanaee-T', 'Hadi', ''], ['Gama', 'João', '']]","['Hotspot Detection', 'Spatiotemporal Data', 'Eigenspace', 'SVD', 'Outbreak Detection']"
439,1810.11388,Muhammad Burhan Hafez,"Muhammad Burhan Hafez, Cornelius Weber, Matthias Kerzel, Stefan
  Wermter","Deep Intrinsically Motivated Continuous Actor-Critic for Efficient
  Robotic Visuomotor Skill Learning",,"Paladyn, Journal of Behavioral Robotics, Volume 10, Issue 1, Pages
  14-29, 2019",10.1515/pjbr-2019-0005,,cs.LG cs.AI cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a new intrinsically motivated actor-critic
algorithm for learning continuous motor skills directly from raw visual input.
Our neural architecture is composed of a critic and an actor network. Both
networks receive the hidden representation of a deep convolutional autoencoder
which is trained to reconstruct the visual input, while the centre-most hidden
representation is also optimized to estimate the state value. Separately, an
ensemble of predictive world models generates, based on its learning progress,
an intrinsic reward signal which is combined with the extrinsic reward to guide
the exploration of the actor-critic learner. Our approach is more
data-efficient and inherently more stable than the existing actor-critic
methods for continuous control from pixel data. We evaluate our algorithm for
the task of learning robotic reaching and grasping skills on a realistic
physics simulator and on a humanoid robot. The results show that the control
policies learned with our approach can achieve better performance than the
compared state-of-the-art and baseline algorithms in both dense-reward and
challenging sparse-reward settings.
","[{'version': 'v1', 'created': 'Fri, 26 Oct 2018 15:32:32 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Feb 2019 10:54:46 GMT'}]",2019-02-19,"[['Hafez', 'Muhammad Burhan', ''], ['Weber', 'Cornelius', ''], ['Kerzel', 'Matthias', ''], ['Wermter', 'Stefan', '']]","['deep reinforcement learning', 'actor-critic', 'continuous control', 'efficient exploration', 'neuro-robotics']"
440,1301.5887,Tamara Kolda,"Tamara G. Kolda and Ali Pinar and Todd Plantenga and C. Seshadhri and
  Christine Task",Counting Triangles in Massive Graphs with MapReduce,,"SIAM Journal on Scientific Computing, Vol. 36, No. 5, pp. S44-S77,
  October 2014",10.1137/13090729X,,cs.SI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graphs and networks are used to model interactions in a variety of contexts.
There is a growing need to quickly assess the characteristics of a graph in
order to understand its underlying structure. Some of the most useful metrics
are triangle-based and give a measure of the connectedness of mutual friends.
This is often summarized in terms of clustering coefficients, which measure the
likelihood that two neighbors of a node are themselves connected. Computing
these measures exactly for large-scale networks is prohibitively expensive in
both memory and time. However, a recent wedge sampling algorithm has proved
successful in efficiently and accurately estimating clustering coefficients. In
this paper, we describe how to implement this approach in MapReduce to deal
with massive graphs. We show results on publicly-available networks, the
largest of which is 132M nodes and 4.7B edges, as well as artificially
generated networks (using the Graph500 benchmark), the largest of which has
240M nodes and 8.5B edges. We can estimate the clustering coefficient by degree
bin (e.g., we use exponential binning) and the number of triangles per bin, as
well as the global clustering coefficient and total number of triangles, in an
average of 0.33 seconds per million edges plus overhead (approximately 225
seconds total for our configuration). The technique can also be used to study
triangle statistics such as the ratio of the highest and lowest degree, and we
highlight differences between social and non-social networks. To the best of
our knowledge, these are the largest triangle-based graph computations
published to date.
","[{'version': 'v1', 'created': 'Thu, 24 Jan 2013 20:32:25 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Sep 2013 21:45:16 GMT'}, {'version': 'v3', 'created': 'Mon, 9 Dec 2013 20:37:01 GMT'}]",2014-12-02,"[['Kolda', 'Tamara G.', ''], ['Pinar', 'Ali', ''], ['Plantenga', 'Todd', ''], ['Seshadhri', 'C.', ''], ['Task', 'Christine', '']]","['triangle counting', 'clustering coefficient', 'triangle characteristics', 'largescale networks', 'MapReduce']"
441,1903.08454,Lynsay Shepherd,"Sam Scholefield, Lynsay A. Shepherd",Gamification Techniques for Raising Cyber Security Awareness,"14 pages. Human-Computer International 2019, HCII 2019, Orlando,
  United States (2019), Springer",,10.1007/978-3-030-22351-9_13,,cs.HC cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Due to the prevalence of online services in modern society, such as internet
banking and social media, it is important for users to have an understanding of
basic security measures in order to keep themselves safe online. However, users
often do not know how to make their online interactions secure, which
demonstrates an educational need in this area. Gamification has grown in
popularity in recent years and has been used to teach people about a range of
subjects. This paper presents an exploratory study investigating the use of
gamification techniques to educate average users about password security, with
the aim of raising overall security awareness. To explore the impact of such
techniques, a role-playing quiz application (RPG) was developed for the Android
platform to educate users about password security. Results gained from the work
highlighted that users enjoyed learning via the use of the password
application, and felt they benefitted from the inclusion of gamification
techniques. Future work seeks to expand the prototype into a full solution,
covering a range of security awareness issues.
","[{'version': 'v1', 'created': 'Wed, 20 Mar 2019 11:45:26 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Mar 2019 00:57:45 GMT'}]",2019-07-24,"[['Scholefield', 'Sam', ''], ['Shepherd', 'Lynsay A.', '']]","['Gamification', 'games-based learning', 'security awareness', 'usable security', 'human-centered cyber security']"
442,1201.5217,Mohammad Tarek Al-Muallim M.Sc.,"M. T. Al-Muallim, R. El-Kouatly",Unsupervised Classification Using Immune Algorithm,,,10.5120/677-952,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Unsupervised classification algorithm based on clonal selection principle
named Unsupervised Clonal Selection Classification (UCSC) is proposed in this
paper. The new proposed algorithm is data driven and self-adaptive, it adjusts
its parameters to the data to make the classification operation as fast as
possible. The performance of UCSC is evaluated by comparing it with the well
known K-means algorithm using several artificial and real-life data sets. The
experiments show that the proposed UCSC algorithm is more reliable and has high
classification precision comparing to traditional classification methods such
as K-means.
","[{'version': 'v1', 'created': 'Wed, 25 Jan 2012 09:44:06 GMT'}]",2012-01-26,"[['Al-Muallim', 'M. T.', ''], ['El-Kouatly', 'R.', '']]","['Artificial Immune Systems', 'Clonal Selection Algorithms', 'Clustering', 'K-means Algorithm']"
443,1703.01975,Ruben Mayer,"Ruben Mayer, Harshit Gupta, Enrique Saurez, Umakishore Ramachandran","The Fog Makes Sense: Enabling Social Sensing Services With Limited
  Internet Connectivity","Ruben Mayer, Harshit Gupta, Enrique Saurez, and Umakishore
  Ramachandran. 2017. The Fog Makes Sense: Enabling Social Sensing Services
  With Limited Internet Connectivity. In Proceedings of The 2nd International
  Workshop on Social Sensing, Pittsburgh, PA, USA, April 21 2017
  (SocialSens'17), 6 pages",,10.1145/3055601.3055614,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social sensing services use humans as sensor carriers, sensor operators and
sensors themselves in order to provide situation-awareness to applications.
This promises to provide a multitude of benefits to the users, for example in
the management of natural disasters or in community empowerment. However,
current social sensing services depend on Internet connectivity since the
services are deployed on central Cloud platforms. In many circumstances,
Internet connectivity is constrained, for instance when a natural disaster
causes Internet outages or when people do not have Internet access due to
economical reasons. In this paper, we propose the emerging Fog Computing
infrastructure to become a key-enabler of social sensing services in situations
of constrained Internet connectivity. To this end, we develop a generic
architecture and API of Fog-enabled social sensing services. We exemplify the
usage of the proposed social sensing architecture on a number of concrete use
cases from two different scenarios.
","[{'version': 'v1', 'created': 'Mon, 6 Mar 2017 17:02:14 GMT'}]",2017-03-07,"[['Mayer', 'Ruben', ''], ['Gupta', 'Harshit', ''], ['Saurez', 'Enrique', ''], ['Ramachandran', 'Umakishore', '']]","['Social Sensing', 'Fog Computing', 'Situation Awareness']"
444,1705.01661,Li Yi,"Li Yi, Leonidas Guibas, Aaron Hertzmann, Vladimir G. Kim, Hao Su,
  Ersin Yumer","Learning Hierarchical Shape Segmentation and Labeling from Online
  Repositories",,,10.1145/3072959.3073652,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a method for converting geometric shapes into hierarchically
segmented parts with part labels. Our key idea is to train category-specific
models from the scene graphs and part names that accompany 3D shapes in public
repositories. These freely-available annotations represent an enormous,
untapped source of information on geometry. However, because the models and
corresponding scene graphs are created by a wide range of modelers with
different levels of expertise, modeling tools, and objectives, these models
have very inconsistent segmentations and hierarchies with sparse and noisy
textual tags. Our method involves two analysis steps. First, we perform a joint
optimization to simultaneously cluster and label parts in the database while
also inferring a canonical tag dictionary and part hierarchy. We then use this
labeled data to train a method for hierarchical segmentation and labeling of
new 3D shapes. We demonstrate that our method can mine complex information,
detecting hierarchies in man-made objects and their constituent parts,
obtaining finer scale details than existing alternatives. We also show that, by
performing domain transfer using a few supervised examples, our technique
outperforms fully-supervised techniques that require hundreds of
manually-labeled models.
","[{'version': 'v1', 'created': 'Thu, 4 May 2017 00:11:16 GMT'}]",2017-05-05,"[['Yi', 'Li', ''], ['Guibas', 'Leonidas', ''], ['Hertzmann', 'Aaron', ''], ['Kim', 'Vladimir G.', ''], ['Su', 'Hao', ''], ['Yumer', 'Ersin', '']]","['hierarchical shape structure', 'shape labeling', 'learning', 'Siamese networks']"
445,2204.13844,Wenjie Wang,"Wenjie Wang, Fuli Feng, Liqiang Nie, Tat-Seng Chua",User-controllable Recommendation Against Filter Bubbles,Accepted by SIGIR 2022,"Proceedings of the 45th International ACM SIGIR Conference on
  Research and Development in Information Retrieval (SIGIR 2022)",10.1145/3477495.3532075,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender systems usually face the issue of filter bubbles:
overrecommending homogeneous items based on user features and historical
interactions. Filter bubbles will grow along the feedback loop and
inadvertently narrow user interests. Existing work usually mitigates filter
bubbles by incorporating objectives apart from accuracy such as diversity and
fairness. However, they typically sacrifice accuracy, hurting model fidelity
and user experience. Worse still, users have to passively accept the
recommendation strategy and influence the system in an inefficient manner with
high latency, e.g., keeping providing feedback (e.g., like and dislike) until
the system recognizes the user intention.
  This work proposes a new recommender prototype called UserControllable
Recommender System (UCRS), which enables users to actively control the
mitigation of filter bubbles. Functionally, 1) UCRS can alert users if they are
deeply stuck in filter bubbles. 2) UCRS supports four kinds of control commands
for users to mitigate the bubbles at different granularities. 3) UCRS can
respond to the controls and adjust the recommendations on the fly. The key to
adjusting lies in blocking the effect of out-of-date user representations on
recommendations, which contains historical information inconsistent with the
control commands. As such, we develop a causality-enhanced User-Controllable
Inference (UCI) framework, which can quickly revise the recommendations based
on user controls in the inference stage and utilize counterfactual inference to
mitigate the effect of out-of-date user representations. Experiments on three
datasets validate that the UCI framework can effectively recommend more desired
items based on user controls, showing promising performance w.r.t. both
accuracy and diversity.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2022 01:46:56 GMT'}]",2022-05-02,"[['Wang', 'Wenjie', ''], ['Feng', 'Fuli', ''], ['Nie', 'Liqiang', ''], ['Chua', 'Tat-Seng', '']]","['User-controllable Recommender Systems', 'Counterfactual Inference', 'Filter Bubbles', 'Causal Recommendation']"
446,1807.10731,John Ashburner PhD,"John Ashburner, Mikael Brudfors, Kevin Bronik, Yael Balbastre","An Algorithm for Learning Shape and Appearance Models without
  Annotations","61 pages, 16 figures (some downsampled by a factor of 4), submitted
  to MedIA",,10.1016/j.media.2019.04.008,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  This paper presents a framework for automatically learning shape and
appearance models for medical (and certain other) images. It is based on the
idea that having a more accurate shape and appearance model leads to more
accurate image registration, which in turn leads to a more accurate shape and
appearance model. This leads naturally to an iterative scheme, which is based
on a probabilistic generative model that is fit using Gauss-Newton updates
within an EM-like framework. It was developed with the aim of enabling
distributed privacy-preserving analysis of brain image data, such that shared
information (shape and appearance basis functions) may be passed across sites,
whereas latent variables that encode individual images remain secure within
each site. These latent variables are proposed as features for
privacy-preserving data mining applications.
  The approach is demonstrated qualitatively on the KDEF dataset of 2D face
images, showing that it can align images that traditionally require shape and
appearance models trained using manually annotated data (manually defined
landmarks etc.). It is applied to MNIST dataset of handwritten digits to show
its potential for machine learning applications, particularly when training
data is limited. The model is able to handle ``missing data'', which allows it
to be cross-validated according to how well it can predict left-out voxels. The
suitability of the derived features for classifying individuals into patient
groups was assessed by applying it to a dataset of over 1,900 segmented
T1-weighted MR images, which included images from the COBRE and ABIDE datasets.
","[{'version': 'v1', 'created': 'Fri, 27 Jul 2018 16:59:22 GMT'}]",2019-05-29,"[['Ashburner', 'John', ''], ['Brudfors', 'Mikael', ''], ['Bronik', 'Kevin', ''], ['Balbastre', 'Yael', '']]","['Machine Learning', 'Latent Variables', 'Diffeomorphisms', 'Geodesic']"
447,1005.5613,Secretary Aircc Journal,"Murtaza Ali Khan (Royal University for Women, Bahrain)","An Automated Algorithm for Approximation of Temporal Video Data Using
  Linear B'EZIER Fitting","14 Pages, IJMA 2010","International journal of Multimedia & Its Applications 2.2 (2010)
  81-94",10.5121/ijma.2010.2207,,cs.MM,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper presents an efficient method for approximation of temporal video
data using linear Bezier fitting. For a given sequence of frames, the proposed
method estimates the intensity variations of each pixel in temporal dimension
using linear Bezier fitting in Euclidean space. Fitting of each segment ensures
upper bound of specified mean squared error. Break and fit criteria is employed
to minimize the number of segments required to fit the data. The proposed
method is well suitable for lossy compression of temporal video data and
automates the fitting process of each pixel. Experimental results show that the
proposed method yields good results both in terms of objective and subjective
quality measurement parameters without causing any blocking artifacts.
","[{'version': 'v1', 'created': 'Mon, 31 May 2010 08:11:59 GMT'}]",2010-07-15,"[['Khan', 'Murtaza Ali', '', 'Royal University for Women, Bahrain']]","['Video data', 'Compression', 'Linear Bezier', 'Fitting']"
448,1606.07506,Biljana Risteska Stojkoska Dr,"Biljana Stojkoska, Danco Davcev and Andrea Kulakov","Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor
  Networks with Irregular Topologies",6 pages. arXiv admin note: text overlap with arXiv:1606.07389,"Proceedings of the 5th international conference on Soft computing
  as transdisciplinary science and technology, ISBN: 978-1-60558-046-3, ACM,
  2008. pp. 384-389",10.1145/1456223.1456302,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nodes localization in Wireless Sensor Networks (WSN) has arisen as a very
challenging problem in the research community. Most of the applications for WSN
are not useful without a priori known nodes positions. One solution to the
problem is by adding GPS receivers to each node. Since this is an expensive
approach and inapplicable for indoor environments, we need to find an
alternative intelligent mechanism for determining nodes location. In this
paper, we propose our cluster-based approach of multidimensional scaling (MDS)
technique. Our initial experiments show that our algorithm outperforms
MDS-MAP[8], particularly for irregular topologies in terms of accuracy.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2016 23:03:22 GMT'}]",2016-06-27,"[['Stojkoska', 'Biljana', ''], ['Davcev', 'Danco', ''], ['Kulakov', 'Andrea', '']]","['nodes localization', 'wireless sensor networks', 'multidimensional scaling']"
449,1701.04616,Vincenzo De Florio,"Vincenzo De Florio, Mohamed Bakhouya, D. Eloudghiri, Chris Blondia",Towards a Smarter organization for a Self-servicing Society,"Final version of a paper published in the Proceedings of
  International Conference on Software Development and Technologies for
  Enhancing Accessibility and Fighting Info-exclusion (DSAI'16), special track
  on Emergent Technologies for Ambient Assisted Living (ETAAL)",,10.1145/3019943.3019980,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional social organizations such as those for the management of
healthcare are the result of designs that matched well with an operational
context considerably different from the one we are experiencing today. The new
context reveals all the fragility of our societies. In this paper, a platform
is introduced by combining social-oriented communities and complex-event
processing concepts: SELFSERV. Its aim is to complement the ""old recipes"" with
smarter forms of social organization based on the self-service paradigm and by
exploring culture-specific aspects and technological challenges.
","[{'version': 'v1', 'created': 'Tue, 17 Jan 2017 10:52:19 GMT'}]",2017-01-18,"[['De Florio', 'Vincenzo', ''], ['Bakhouya', 'Mohamed', ''], ['Eloudghiri', 'D.', ''], ['Blondia', 'Chris', '']]","['Self-service paradigm', 'complex event processing', 'service-oriented communities', 'health services', 'service-dominant logic']"
450,2301.06777,Marjan Celikik,"Marjan Celikik, Jacek Wasilewski, Ana Peleteiro Ramallo","Reusable Self-Attention Recommender Systems in Fashion Industry
  Applications",,"Sixteenth ACM Conference on Recommender Systems (RecSys '22),
  September 18--23, 2022, Seattle, WA, USA",10.1145/3523227.3547377,,cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  A large number of empirical studies on applying self-attention models in the
domain of recommender systems are based on offline evaluation and metrics
computed on standardized datasets. Moreover, many of them do not consider side
information such as item and customer metadata although deep-learning
recommenders live up to their full potential only when numerous features of
heterogeneous type are included. Also, normally the model is used only for a
single use case. Due to these shortcomings, even if relevant, previous works
are not always representative of their actual effectiveness in real-world
industry applications. In this talk, we contribute to bridging this gap by
presenting live experimental results demonstrating improvements in user
retention of up to 30\%. Moreover, we share our learnings and challenges from
building a re-usable and configurable recommender system for various
applications from the fashion industry. In particular, we focus on fashion
inspiration use-cases, such as outfit ranking, outfit recommendation and
real-time personalized outfit generation.
","[{'version': 'v1', 'created': 'Tue, 17 Jan 2023 10:00:17 GMT'}]",2023-01-18,"[['Celikik', 'Marjan', ''], ['Wasilewski', 'Jacek', ''], ['Ramallo', 'Ana Peleteiro', '']]","['Recommendation Systems', 'Transformers', 'Fashion Industry']"
451,1207.4448,Sebastien Verel,"Bilel Derbel (LIFL, INRIA Lille - Nord Europe), S\'ebastien Verel
  (INRIA Lille - Nord Europe)",DAMS: Distributed Adaptive Metaheuristic Selection,,"Genetic And Evolutionary Computation Conference, Dublin : Ireland
  (2011)",10.1145/2001576.2001839,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a distributed generic algorithm called DAMS dedicated to adaptive
optimization in distributed environments. Given a set of metaheuristic, the
goal of DAMS is to coordinate their local execution on distributed nodes in
order to optimize the global performance of the distributed system. DAMS is
based on three-layer architecture allowing node to decide distributively what
local information to communicate, and what metaheuristic to apply while the
optimization process is in progress. The adaptive features of DAMS are first
addressed in a very general setting. A specific DAMS called SBM is then
described and analyzed from both a parallel and an adaptive point of view. SBM
is a simple, yet efficient, adaptive distributed algorithm using an
exploitation component allowing nodes to select the metaheuristic with the best
locally observed performance, and an exploration component allowing nodes to
detect the metaheuristic with the actual best performance. The efficiency of
BSM-DAMS is demonstrated through experimentations and comparisons with other
adaptive strategies (sequential and distributed).
","[{'version': 'v1', 'created': 'Wed, 18 Jul 2012 19:06:37 GMT'}]",2012-07-19,"[['Derbel', 'Bilel', '', 'LIFL, INRIA Lille - Nord Europe'], ['Verel', 'Sébastien', '', 'INRIA Lille - Nord Europe']]","['metaheurististics', 'distributed algorithms', 'adaptative algorithms', 'parameter control']"
452,1304.7373,Gunjan Kumar,"Gunjan Kumar, Saswata Shannigrahi",NP-Hardness of Speed Scaling with a Sleep State,"12 pages, 5 figures",,10.1016/j.tcs.2015.06.012,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A modern processor can dynamically set it's speed while it's active, and can
make a transition to sleep state when required. When the processor is operating
at a speed $s$, the energy consumed per unit time is given by a convex power
function $P(s)$ having the property that $P(0) > 0$ and $P""(s) > 0$ for all
values of $s$. Moreover, $C > 0$ units of energy is required to make a
transition from the sleep state to the active state. The jobs are specified by
their arrival time, deadline and the processing volume.
  We consider a scheduling problem, called speed scaling with sleep state,
where each job has to be scheduled within their arrival time and deadline, and
the goal is to minimize the total energy consumption required to process these
jobs. Albers et. al. proved the NP-hardness of this problem by reducing an
instance of an NP-hard partition problem to an instance of this scheduling
problem. The instance of this scheduling problem consists of the arrival time,
the deadline and the processing volume for each of the jobs, in addition to $P$
and $C$. Since $P$ and $C$ depend on the instance of the partition problem,
this proof of the NP-hardness of the speed scaling with sleep state problem
doesn't remain valid when $P$ and $C$ are fixed. In this paper, we prove that
the speed scaling with sleep state problem remains NP-hard for any fixed
positive number $C$ and convex $P$ satisfying $P(0) > 0$ and $P""(s) > 0$ for
all values of $s$.
","[{'version': 'v1', 'created': 'Sat, 27 Apr 2013 14:18:42 GMT'}]",2019-12-03,"[['Kumar', 'Gunjan', ''], ['Shannigrahi', 'Saswata', '']]","['Energy efficient algorithm', 'scheduling algorithm', 'NP-hardness']"
453,1812.00040,Daniel Severin Dr.,"Mauro Lucci, Graciela Nasini, Daniel Sever\'in",A Branch and Price Algorithm for List Coloring Problem,,"Electronic Notes in Theoretical Computer Science 346 (2019)
  613-624",10.1016/j.entcs.2019.08.054,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Coloring problems in graphs have been used to model a wide range of real
applications. In particular, the List Coloring Problem generalizes the
well-known Graph Coloring Problem for which many exact algorithms have been
developed. In this work, we present a Branch-and-Price algorithm for the
weighted version of the List Coloring Problem, based on the one developed by
Mehrotra and Trick (1996) for the Graph Coloring Problem. This version
considers non-negative weights associated to each color and it is required to
assign a color to each vertex from predetermined lists in such a way the sum of
weights of the assigned colors is minimum. Computational experiments show the
good performance of our approach, being able to comfortably solve instances
whose graphs have up to seventy vertices. These experiences also bring out that
the hardness of the instances of the List Coloring Problem does not seem to
depend only on quantitative parameters such as the size of the graph, its
density, and the size of list of colors, but also on the distribution of colors
present in the lists.
","[{'version': 'v1', 'created': 'Fri, 30 Nov 2018 20:18:42 GMT'}]",2020-02-28,"[['Lucci', 'Mauro', ''], ['Nasini', 'Graciela', ''], ['Severín', 'Daniel', '']]","['List Coloring', 'Branch and Price', 'Weighted Problem']"
454,1312.2859,Chanabasayya Vastrad M,Doreswamy and Chanabasayya .M. Vastrad,"A Robust Missing Value Imputation Method MifImpute For Incomplete
  Molecular Descriptor Data And Comparative Analysis With Other Missing Value
  Imputation Methods","arXiv admin note: text overlap with arXiv:1105.0828 by other authors
  without attribution","Published International Journal on Computational Sciences &
  Applications (IJCSA) Vol.3, No4, August 2013",10.5121/ijcsa.2013.3406,,cs.CE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Missing data imputation is an important research topic in data mining.
Large-scale Molecular descriptor data may contains missing values (MVs).
However, some methods for downstream analyses, including some prediction tools,
require a complete descriptor data matrix. We propose and evaluate an iterative
imputation method MiFoImpute based on a random forest. By averaging over many
unpruned regression trees, random forest intrinsically constitutes a multiple
imputation scheme. Using the NRMSE and NMAE estimates of random forest, we are
able to estimate the imputation error. Evaluation is performed on two molecular
descriptor datasets generated from a diverse selection of pharmaceutical fields
with artificially introduced missing values ranging from 10% to 30%. The
experimental result demonstrates that missing values has a great impact on the
effectiveness of imputation techniques and our method MiFoImpute is more robust
to missing value than the other ten imputation methods used as benchmark.
Additionally, MiFoImpute exhibits attractive computational efficiency and can
cope with high-dimensional data.
","[{'version': 'v1', 'created': 'Tue, 10 Dec 2013 16:24:28 GMT'}]",2013-12-13,"[['Doreswamy', '', ''], ['Vastrad', 'Chanabasayya . M.', '']]","['Random Forest', 'normalized root mean squared error', 'normalized mean absolute error', 'missing values  1']"
455,1903.00922,Benedikt Ahrens,"Benedikt Ahrens, Andr\'e Hirschowitz, Ambroise Lafont, Marco Maggesi",Modular specification of monads through higher-order presentations,17 pages,"Formal Structures for Computation and Deduction (FSCD) 2019,
  LIPIcs Vol. 131, pp. 6:1-6:19",10.4230/LIPIcs.FSCD.2019.6,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In their work on second-order equational logic, Fiore and Hur have studied
presentations of simply typed languages by generating binding constructions and
equations among them. To each pair consisting of a binding signature and a set
of equations, they associate a category of `models', and they give a monadicity
result which implies that this category has an initial object, which is the
language presented by the pair.
  In the present work, we propose, for the untyped setting, a variant of their
approach where monads and modules over them are the central notions. More
precisely, we study, for monads over sets, presentations by generating
(`higher-order') operations and equations among them. We consider a notion of
2-signature which allows to specify a monad with a family of binding operations
subject to a family of equations, as is the case for the paradigmatic example
of the lambda calculus, specified by its two standard constructions
(application and abstraction) subject to $\beta$- and $\eta$-equalities. Such a
2-signature is hence a pair $(\Sigma,E)$ of a binding signature $\Sigma$ and a
family $E$ of equations for $\Sigma$. This notion of 2-signature has been
introduced earlier by Ahrens in a slightly different context.
  We associate, to each 2-signature $(\Sigma,E)$, a category of `models of
$(\Sigma,E)$; and we say that a 2-signature is `effective' if this category has
an initial object; the monad underlying this (essentially unique) object is the
`monad specified by the 2-signature'. Not every 2-signature is effective; we
identify a class of 2-signatures, which we call `algebraic', that are
effective.
  Importantly, our 2-signatures together with their models enjoy `modularity':
when we glue (algebraic) 2-signatures together, their initial models are glued
accordingly.
  We provide a computer formalization for our main results.
","[{'version': 'v1', 'created': 'Sun, 3 Mar 2019 15:00:36 GMT'}]",2019-07-16,"[['Ahrens', 'Benedikt', ''], ['Hirschowitz', 'André', ''], ['Lafont', 'Ambroise', ''], ['Maggesi', 'Marco', '']]","['free monads', 'presentation of monads', 'initial semantics', 'signatures', 'syntax', 'monadic substitution', 'computer-checked proofs']"
456,1702.02223,Zongwei Zhou,"Hongkai Wang, Zongwei Zhou, Yingci Li, Zhonghua Chen, Peiou Lu, Wenzhi
  Wang, Wanyu Liu and Lijuan Yu","Comparison of machine learning methods for classifying mediastinal lymph
  node metastasis of non-small cell lung cancer from 18F-FDG PET/CT images",,,10.1186/s13550-017-0260-9,,cs.CV physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The present study shows that the performance of CNN is not significantly
different from the best classical methods and human doctors for classifying
mediastinal lymph node metastasis of NSCLC from PET/CT images. Because CNN does
not need tumor segmentation or feature calculation, it is more convenient and
more objective than the classical methods. However, CNN does not make use of
the import diagnostic features, which have been proved more discriminative than
the texture features for classifying small-sized lymph nodes. Therefore,
incorporating the diagnostic features into CNN is a promising direction for
future research.
","[{'version': 'v1', 'created': 'Tue, 7 Feb 2017 23:12:45 GMT'}]",2017-02-09,"[['Wang', 'Hongkai', ''], ['Zhou', 'Zongwei', ''], ['Li', 'Yingci', ''], ['Chen', 'Zhonghua', ''], ['Lu', 'Peiou', ''], ['Wang', 'Wenzhi', ''], ['Liu', 'Wanyu', ''], ['Yu', 'Lijuan', '']]","['Computer-aided diagnosis', 'Non-small cell lung cancer', 'Positron-emission tomography', 'Machine learning', 'Deep learning']"
457,1111.3127,Argimiro Arratia,Argimiro Arratia and Alejandra Caba\~na,Tracing the temporal evolution of clusters in a financial stock market,"22 pages, 3 figures (submitted for publication)",,10.1007/s10614-012-9327-x,,cs.CE math.ST q-fin.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a methodology for clustering financial time series of stocks'
returns, and a graphical set-up to quantify and visualise the evolution of
these clusters through time. The proposed graphical representation allows for
the application of well known algorithms for solving classical combinatorial
graph problems, which can be interpreted as problems relevant to portfolio
design and investment strategies. We illustrate this graph representation of
the evolution of clusters in time and its use on real data from the Madrid
Stock Exchange market.
","[{'version': 'v1', 'created': 'Mon, 14 Nov 2011 08:04:16 GMT'}]",2015-03-19,"[['Arratia', 'Argimiro', ''], ['Cabaña', 'Alejandra', '']]","['financial time series', 'raw–data clustering', 'graph combinatorics']"
458,1712.09619,Abdolah Sepahvand,"Mohammadreza Razzazi, Abdolah Sepahvand",Finding Two Disjoint Simple Paths on Two Sets of Points is NP-Complete,,scientiairanica.sharif.edu/article_4116.html 2017,10.24200/SCI.2017.4116,,cs.CC cs.CG,http://creativecommons.org/publicdomain/zero/1.0/,"  Finding two disjoint simple paths on two given sets of points is a geometric
problem introduced by Jeff Erickson. This problem has various applications in
computational geometry, like robot motion planning, generating polygon etc. We
will present a reduction from planar Hamiltonian path to this problem, and
prove that it is NP-Complete. To the best of our knowledge, no study has
considered its complexity up until now. We also present a reduction from planar
Hamiltonian path problem to the problem of finding a path on given points in
the presence of arbitrary obstacles and prove that it is NP-Complete too. Also,
we present a heuristic algorithm with time complexity of O(n4) to solve this
problem. The proposed algorithm first calculates the convex hull for each of
the entry points and then produces two simple paths on the two entry point sets
","[{'version': 'v1', 'created': 'Wed, 27 Dec 2017 16:36:50 GMT'}]",2017-12-29,"[['Razzazi', 'Mohammadreza', ''], ['Sepahvand', 'Abdolah', '']]","['Hamiltonian path', 'NP-complete', 'planar graph', 'simple path']"
459,1908.02877,Aaron Reite,"Aaron Reite, Scott Kangas, Zackery Steck, Steven Goley, Jonathan Von
  Stroh, and Steven Forsyth",Unsupervised Feature Learning in Remote Sensing,,,10.1117/12.2529791,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The need for labeled data is among the most common and well-known practical
obstacles to deploying deep learning algorithms to solve real-world problems.
The current generation of learning algorithms requires a large volume of data
labeled according to a static and pre-defined schema. Conversely, humans can
quickly learn generalizations based on large quantities of unlabeled data, and
turn these generalizations into classifications using spontaneous labels, often
including labels not seen before. We apply a state-of-the-art unsupervised
learning algorithm to the noisy and extremely imbalanced xView data set to
train a feature extractor that adapts to several tasks: visual similarity
search that performs well on both common and rare classes; identifying outliers
within a labeled data set; and learning a natural class hierarchy
automatically.
","[{'version': 'v1', 'created': 'Wed, 7 Aug 2019 23:48:49 GMT'}]",2019-09-24,"[['Reite', 'Aaron', ''], ['Kangas', 'Scott', ''], ['Steck', 'Zackery', ''], ['Goley', 'Steven', ''], ['Von Stroh', 'Jonathan', ''], ['Forsyth', 'Steven', '']]","['remote sensing', 'unsupervised learning', 'deep learning', 'classification', 'similarity search', 'anomalydetection', 'hierarchy discovery']"
460,1005.0055,Pino Caballero-Gil,"Pino Caballero-Gil, Amparo F\'uster-Sabater",On the Design of Cryptographic Primitives,,"Acta Applicandae Mathematicae. Volume 93, Numbers 1-3, pp.
  279-297. Sept 2006. Springer.",10.1007/s10440-006-9044-3,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The main objective of this work is twofold. On the one hand, it gives a brief
overview of the area of two-party cryptographic protocols. On the other hand,
it proposes new schemes and guidelines for improving the practice of robust
protocol design. In order to achieve such a double goal, a tour through the
descriptions of the two main cryptographic primitives is carried out. Within
this survey, some of the most representative algorithms based on the Theory of
Finite Fields are provided and new general schemes and specific algorithms
based on Graph Theory are proposed.
","[{'version': 'v1', 'created': 'Sat, 1 May 2010 08:13:55 GMT'}]",2015-03-17,"[['Caballero-Gil', 'Pino', ''], ['Fúster-Sabater', 'Amparo', '']]","['Cryptography', 'Secure communications', 'Finite Fields', 'Discrete Mathematics']"
461,1907.01985,Keyan Ding,"Keyan Ding, Kede Ma, Shiqi Wang",Intrinsic Image Popularity Assessment,Accepted by ACM Multimedia 2019,"Proceedings of the 27th ACM International Conference on
  Multimedia, 2019",10.1145/3343031.3351007,,cs.MM cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The goal of research in automatic image popularity assessment (IPA) is to
develop computational models that can accurately predict the potential of a
social image to go viral on the Internet. Here, we aim to single out the
contribution of visual content to image popularity, i.e., intrinsic image
popularity. Specifically, we first describe a probabilistic method to generate
massive popularity-discriminable image pairs, based on which the first
large-scale image database for intrinsic IPA (I$^2$PA) is established. We then
develop computational models for I$^2$PA based on deep neural networks,
optimizing for ranking consistency with millions of popularity-discriminable
image pairs. Experiments on Instagram and other social platforms demonstrate
that the optimized model performs favorably against existing methods, exhibits
reasonable generalizability on different databases, and even surpasses
human-level performance on Instagram. In addition, we conduct a psychophysical
experiment to analyze various aspects of human behavior in I$^2$PA.
","[{'version': 'v1', 'created': 'Wed, 3 Jul 2019 15:15:21 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Jul 2019 15:38:50 GMT'}]",2021-01-25,"[['Ding', 'Keyan', ''], ['Ma', 'Kede', ''], ['Wang', 'Shiqi', '']]","['Intrinsic image popularity', 'learning-to-rank', 'deep neural networks', 'human behavior analysis']"
462,1705.00717,Reza Farahbakhsh,"Reza Farahbakhsh, Angel Cuevas, Antonio M. Ortiz, Xiao Han, Noel
  Crespi",How far is Facebook from me? Facebook network infrastructure analysis,"Published in: IEEE Communications Magazine (Volume: 53, Issue: 9,
  September 2015)",IEEE Communications Magazine 53.9 (2015): 134-142,10.1109/MCOM.2015.7263357,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Facebook is today the most popular social network with more than one billion
subscribers worldwide. To provide good quality of service (e.g., low access
delay) to their clients, FB relies on Akamai, which provides a worldwide
content distribution network with a large number of edge servers that are much
closer to FB subscribers. In this article we aim to depict a global picture of
the current FB network infrastructure deployment taking into account both
native FB servers and Akamai nodes. Toward this end, we have performed a
measurement-based analysis during a period of two weeks using 463 Planet- Lab
nodes distributed across 41 countries. Based on the obtained data we compare
the average access delay that nodes in different countries experience accessing
both native FB servers and Akamai nodes. In addition, we obtain a wide view of
the deployment of Akamai nodes serving FB users worldwide. Finally, we analyze
the geographical coverage of those nodes, and demonstrate that in most of the
cases Akamai nodes located in a particular country service not only local FB
subscribers, but also FB users located in nearby countries.
","[{'version': 'v1', 'created': 'Mon, 1 May 2017 21:15:15 GMT'}]",2017-05-03,"[['Farahbakhsh', 'Reza', ''], ['Cuevas', 'Angel', ''], ['Ortiz', 'Antonio M.', ''], ['Han', 'Xiao', ''], ['Crespi', 'Noel', '']]","['Facebook', 'Akamai', 'CDN', 'Geolocation', 'AccessDelay']"
463,1707.08494,Alessandro Vittorio Papadopoulos,"Daniele Ioli, Alessandro Falsone, Alessandro Vittorio Papadopoulos,
  Maria Prandini","A compositional modeling framework for the optimal energy management of
  a district network","65 pages, 19 figures",,10.1016/j.jprocont.2017.10.005,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a compositional modeling framework for the optimal energy
management of a district network. The focus is on cooling of buildings, which
can possibly share resources to the purpose of reducing maintenance costs and
using devices at their maximal efficiency. Components of the network are
described in terms of energy fluxes and combined via energy balance equations.
Disturbances are accounted for as well through their contribution in terms of
energy. Different district configurations can be built, and the dimension and
complexity of the resulting model will depend on the number and type of
components and on the adopted disturbance description. Control inputs are
available to efficiently operate and coordinate the district components, thus
enabling energy management strategies to minimize the electrical energy costs
or track some consumption profile agreed with the main grid operator.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 15:25:25 GMT'}]",2020-05-12,"[['Ioli', 'Daniele', ''], ['Falsone', 'Alessandro', ''], ['Papadopoulos', 'Alessandro Vittorio', ''], ['Prandini', 'Maria', '']]","['Smart grid modeling', 'Compositional systems', 'Energy']"
464,1901.07299,Faiq Khalid,"Faiq Khalid, Syed Rafay Hasan, Osman Hasan, Muhammad Shafique","SIMCom: Statistical Sniffing of Inter-Module Communications for Run-time
  Hardware Trojan Detection",,"Elsevier Microprocessors and Microsystems, 2020, pp. 103-122",10.1016/j.micpro.2020.103122,,cs.CR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Timely detection of Hardware Trojans (HTs) has become a major challenge for
secure integrated circuits. We present a run-time methodology for HT detection
that employs a multi-parameter statistical traffic modeling of the
communication channel in a given System-on-Chip (SoC), named as SIMCom. The
main idea is to model the communication using multiple side-channel information
like the Hurst exponent, the standard deviation of the injection distribution,
and the hop distribution jointly to accurately identify HT-based online
anomalies (that affects the communication without affecting the protocols or
control signals). At design time, our methodology employs a ""property
specification language"" to define and embed assertions in the RTL, specifying
the correct communication behavior of a given SoC. At run-time, it monitors the
anomalies in the communication behavior by checking the execution patterns
against these assertions. For illustration, we evaluate SIMCom for three SoCs,
i.e., SoC1 ( four single-core MC8051 and UART modules), SoC2 (four single-core
MC8051, AES, ethernet, memctrl, BasicRSA, RS232 modules), and SoC3 (four
single-core LEON3 connected with each other and AES, ethernet, memctrl,
BasicRSA, RS23s modules microcontrollers). The experimental results show that
with the combined analysis of multiple statistical parameters, SIMCom is able
to detect all the benchmark Trojans (available on trust-hub) with less than 1%
area and power overhead.
","[{'version': 'v1', 'created': 'Sun, 4 Nov 2018 22:21:45 GMT'}, {'version': 'v2', 'created': 'Thu, 14 May 2020 07:36:54 GMT'}, {'version': 'v3', 'created': 'Sat, 23 May 2020 20:07:16 GMT'}]",2020-05-26,"[['Khalid', 'Faiq', ''], ['Hasan', 'Syed Rafay', ''], ['Hasan', 'Osman', ''], ['Shafique', 'Muhammad', '']]","['Hardware Trojans', 'Statistical Modeling', 'Communication', 'microcontrollers', 'internet-of-thing', 'IoT', 'Hurst Exponent']"
465,1208.1918,Mahdi Aiash,"Mahdi Aiash, Glenford Mapp and Aboubaker Lasebae","A Survey on Authentication and Key Agreement Protocols in Heterogeneous
  Networks",,"International Journal of Network Security & Its Applications
  (IJNSA), Vol.4, No.4, July 2012, 199-214",10.5121/ijnsa.2012.4413,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Unlike current closed systems such as 2nd and 3rd generations where the core
network is controlled by a sole network operator, multiple network operators
will coexist and manage the core network in Next Generation Networks (NGNs).
This open architecture and the collaboration between different network
operators will support ubiquitous connectivity and thus enhances users'
experience. However, this brings to the fore certain security issues which must
be addressed, the most important of which is the initial Authentication and Key
Agreement (AKA) to identify and authorize mobile nodes on these various
networks. This paper looks at how existing research efforts the HOKEY WG,
Mobile Ethernet and 3GPP frameworks respond to this new environment and provide
security mechanisms. The analysis shows that most of the research had realized
the openness of the core network and tried to deal with it using different
methods. These methods will be extensively analysed in order to highlight their
strengths and weaknesses.
","[{'version': 'v1', 'created': 'Thu, 9 Aug 2012 14:27:27 GMT'}]",2012-08-10,"[['Aiash', 'Mahdi', ''], ['Mapp', 'Glenford', ''], ['Lasebae', 'Aboubaker', '']]","['Authentication and Key Agreement Protocols', 'Casper/FDR', 'Next Generation Networks', 'Heterogeneous Networks']"
466,1806.09997,Pierre Denis Mr.,Pierre Denis,Probabilistic Inference Using Generators - The Statues Algorithm,"50 pages, incl. 3 appendices (v2: typos and minor corrections, added
  appendix C with proof of correctness)",,10.1007/978-3-030-52246-9_10,,cs.AI cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present here a new probabilistic inference algorithm that gives exact
results in the domain of discrete probability distributions. This algorithm,
named the Statues algorithm, calculates the marginal probability distribution
on probabilistic models defined as direct acyclic graphs. These models are made
up of well-defined primitives that allow to express, in particular, joint
probability distributions, Bayesian networks, discrete Markov chains,
conditioning and probabilistic arithmetic. The Statues algorithm relies on a
variable binding mechanism based on the generator construct, a special form of
coroutine; being related to the enumeration algorithm, this new algorithm
brings important improvements in terms of efficiency, which makes it valuable
in regard to other exact marginalization algorithms. After introduction of
several definitions, primitives and compositional rules, we present in details
the Statues algorithm. Then, we briefly discuss the interest of this algorithm
compared to others and we present possible extensions. Finally, we introduce
Lea and MicroLea, two Python libraries implementing the Statues algorithm,
along with several use cases. A proof of the correctness of the algorithm is
provided in appendix.
","[{'version': 'v1', 'created': 'Sun, 24 Jun 2018 23:00:29 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Aug 2018 07:19:02 GMT'}]",2020-07-08,"[['Denis', 'Pierre', '']]","['probabilistic inference', 'probabilistic arithmetic', 'discrete probability distribution', 'probabilistic model', 'Bayesian network', 'marginalization', 'generator']"
467,1111.2301,Morgan Barbier,"Daniel Augot (INRIA Saclay - Ile de France, LIX), Morgan Barbier
  (INRIA Saclay - Ile de France, LIX), Caroline Fontaine (Lab-STICC)",Ensuring message embedding in wet paper steganography,IMACC 2011 (2011),IMACC 2011 7089 (2011) 244-258,10.1007/978-3-642-25516-8_15,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Syndrome coding has been proposed by Crandall in 1998 as a method to
stealthily embed a message in a cover-medium through the use of bounded
decoding. In 2005, Fridrich et al. introduced wet paper codes to improve the
undetectability of the embedding by nabling the sender to lock some components
of the cover-data, according to the nature of the cover-medium and the message.
Unfortunately, almost all existing methods solving the bounded decoding
syndrome problem with or without locked components have a non-zero probability
to fail. In this paper, we introduce a randomized syndrome coding, which
guarantees the embedding success with probability one. We analyze the
parameters of this new scheme in the case of perfect codes.
","[{'version': 'v1', 'created': 'Wed, 9 Nov 2011 18:29:16 GMT'}]",2011-12-16,"[['Augot', 'Daniel', '', 'INRIA Saclay - Ile de France, LIX'], ['Barbier', 'Morgan', '', 'INRIA Saclay - Ile de France, LIX'], ['Fontaine', 'Caroline', '', 'Lab-STICC']]","['steganography', 'syndrome coding problem', 'wet paper codes']"
468,1710.11395,J\'er\^ome Kunegis,"J\'er\^ome Kunegis, Andreas Lommatzsch, Christian Bauckhage",The Slashdot Zoo: Mining a Social Network with Negative Edges,"10 pages, color, accepted at WWW 2009",Proc. WWW 2009,10.1145/1526709.1526809,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyse the corpus of user relationships of the Slashdot technology news
site. The data was collected from the Slashdot Zoo feature where users of the
website can tag other users as friends and foes, providing positive and
negative endorsements. We adapt social network analysis techniques to the
problem of negative edge weights. In particular, we consider signed variants of
global network characteristics such as the clustering coefficient, node-level
characteristics such as centrality and popularity measures, and link-level
characteristics such as distances and similarity measures. We evaluate these
measures on the task of identifying unpopular users, as well as on the task of
predicting the sign of links and show that the network exhibits multiplicative
transitivity which allows algebraic methods based on matrix multiplication to
be used. We compare our methods to traditional methods which are only suitable
for positively weighted edges.
","[{'version': 'v1', 'created': 'Tue, 31 Oct 2017 10:04:05 GMT'}]",2017-11-01,"[['Kunegis', 'Jérôme', ''], ['Lommatzsch', 'Andreas', ''], ['Bauckhage', 'Christian', '']]","['Social network', 'Slashdot Zoo', 'negative edge', 'link prediction']"
469,2105.08671,Neel Kanwal,"Jiahui Geng, Neel Kanwal, Martin Gilje Jaatun, Chunming Rong","DID-eFed: Facilitating Federated Learning as a Service with
  Decentralized Identities",Paper accepted in EASE2021,,10.1145/3463274.3463352,,cs.CR cs.DC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We have entered the era of big data, and it is considered to be the ""fuel""
for the flourishing of artificial intelligence applications. The enactment of
the EU General Data Protection Regulation (GDPR) raises concerns about
individuals' privacy in big data. Federated learning (FL) emerges as a
functional solution that can help build high-performance models shared among
multiple parties while still complying with user privacy and data
confidentiality requirements. Although FL has been intensively studied and used
in real applications, there is still limited research related to its prospects
and applications as a FLaaS (Federated Learning as a Service) to interested 3rd
parties. In this paper, we present a FLaaS system: DID-eFed, where FL is
facilitated by decentralized identities (DID) and a smart contract. DID enables
a more flexible and credible decentralized access management in our system,
while the smart contract offers a frictionless and less error-prone process. We
describe particularly the scenario where our DID-eFed enables the FLaaS among
hospitals and research institutions.
","[{'version': 'v1', 'created': 'Tue, 18 May 2021 16:55:34 GMT'}, {'version': 'v2', 'created': 'Wed, 19 May 2021 07:44:07 GMT'}]",2022-01-25,"[['Geng', 'Jiahui', ''], ['Kanwal', 'Neel', ''], ['Jaatun', 'Martin Gilje', ''], ['Rong', 'Chunming', '']]","['decentralized identity', 'blockchain', 'federated learning', 'FLaaS']"
470,1507.02955,Michael Walter,Christian Ikenmeyer and Ketan D. Mulmuley and Michael Walter,On vanishing of Kronecker coefficients,"43 pages, 1 figure",,10.1007/s00037-017-0158-y,,cs.CC math.RT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that the problem of deciding positivity of Kronecker coefficients is
NP-hard. Previously, this problem was conjectured to be in P, just as for the
Littlewood-Richardson coefficients. Our result establishes in a formal way that
Kronecker coefficients are more difficult than Littlewood-Richardson
coefficients, unless P=NP.
  We also show that there exists a #P-formula for a particular subclass of
Kronecker coefficients whose positivity is NP-hard to decide. This is an
evidence that, despite the hardness of the positivity problem, there may well
exist a positive combinatorial formula for the Kronecker coefficients. Finding
such a formula is a major open problem in representation theory and algebraic
combinatorics.
  Finally, we consider the existence of the partition triples $(\lambda, \mu,
\pi)$ such that the Kronecker coefficient $k^\lambda_{\mu, \pi} = 0$ but the
Kronecker coefficient $k^{l \lambda}_{l \mu, l \pi} > 0$ for some integer
$l>1$. Such ""holes"" are of great interest as they witness the failure of the
saturation property for the Kronecker coefficients, which is still poorly
understood. Using insight from computational complexity theory, we turn our
hardness proof into a positive result: We show that not only do there exist
many such triples, but they can also be found efficiently. Specifically, we
show that, for any $0<\epsilon\leq1$, there exists $0<a<1$ such that, for all
$m$, there exist $\Omega(2^{m^a})$ partition triples $(\lambda,\mu,\mu)$ in the
Kronecker cone such that: (a) the Kronecker coefficient $k^\lambda_{\mu,\mu}$
is zero, (b) the height of $\mu$ is $m$, (c) the height of $\lambda$ is $\le
m^\epsilon$, and (d) $|\lambda|=|\mu| \le m^3$. The proof of the last result
illustrates the effectiveness of the explicit proof strategy of GCT.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2015 16:19:53 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Jul 2017 17:32:52 GMT'}]",2017-08-02,"[['Ikenmeyer', 'Christian', ''], ['Mulmuley', 'Ketan D.', ''], ['Walter', 'Michael', '']]","['Geometric complexity theory', 'Kronecker coefficients', 'Moment polytope', 'Computational Complexity', 'NP-hard']"
471,1808.06025,Amit Kachroo,"Amit Kachroo, Mehmet Kemal Ozdemir and Hatice Tekiner-Mogulkoc","Optimization of LTE Radio Resource Block Allocation for Maritime
  Channels","6 pages, 10 figures. Published in 2016 IEEE 37th Sarnoff Symposium at
  Newark, NJ, USA",,10.1109/SARNOF.2016.7846771,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  In this study, we describe the behavior of LTE over the sea and investigate
the problem of radio resource block allocation in such SINR limited maritime
channels. For simulations of such sea environment, we considered a network
scenario of Bosphorus Strait in Istanbul, Turkey with different number of ships
ferrying between two ports at a given time. After exploiting the network
characteristics, we formulated and solved the radio resource allocation problem
by max-min integer linear programming method. The radio resource allocation
fairness in terms of Jain's fairness index was computed and it was compared
with round robin and opportunistic methods. Results show that the max-min
optimization method performs better than the opportunistic and round robin
methods. This result in turn reflects that the max-min optimization method
gives us the high minimum best throughput as compared to other two methods
considering different ship density scenarios in the sea. Also, it was observed
that as the number of ships begin to increase in the sea, the max-min method
performs significantly better with good fairness as compared to the other two
methods.
","[{'version': 'v1', 'created': 'Sat, 18 Aug 2018 00:30:27 GMT'}]",2018-08-21,"[['Kachroo', 'Amit', ''], ['Ozdemir', 'Mehmet Kemal', ''], ['Tekiner-Mogulkoc', 'Hatice', '']]","['LTE', '3-Ray Path loss Modelling', 'Max-min IntegerLinear Programming', 'SINR', 'Fairness', 'Radio Resource Block Allocation']"
472,0905.3830,Fionn Murtagh,"F. Murtagh, A. Ganz, S. McKie, J. Mothe and K. Englmeier",Tag Clouds for Displaying Semantics: The Case of Filmscripts,"23 pages, 7 figures","Information Visualization 9, 253-262, 2010",10.1057/ivs.2009.19,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We relate tag clouds to other forms of visualization, including planar or
reduced dimensionality mapping, and Kohonen self-organizing maps. Using a
modified tag cloud visualization, we incorporate other information into it,
including text sequence and most pertinent words. Our notion of word pertinence
goes beyond just word frequency and instead takes a word in a mathematical
sense as located at the average of all of its pairwise relationships. We
capture semantics through context, taken as all pairwise relationships. Our
domain of application is that of filmscript analysis. The analysis of
filmscripts, always important for cinema, is experiencing a major gain in
importance in the context of television. Our objective in this work is to
visualize the semantics of filmscript, and beyond filmscript any other
partially structured, time-ordered, sequence of text segments. In particular we
develop an innovative approach to plot characterization.
","[{'version': 'v1', 'created': 'Sat, 23 May 2009 16:11:18 GMT'}]",2011-06-14,"[['Murtagh', 'F.', ''], ['Ganz', 'A.', ''], ['McKie', 'S.', ''], ['Mothe', 'J.', ''], ['Englmeier', 'K.', '']]","['Correspondence Analysis', 'semantics', 'context', 'text analysis', 'information display', 'tag cloud', 'visualization', 'filmscript']"
473,1812.06158,Maksim Kretov,Alexander Fritzler and Varvara Logacheva and Maksim Kretov,Few-shot classification in Named Entity Recognition Task,In proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing,,10.1145/3297280.3297378,,cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For many natural language processing (NLP) tasks the amount of annotated data
is limited. This urges a need to apply semi-supervised learning techniques,
such as transfer learning or meta-learning. In this work we tackle Named Entity
Recognition (NER) task using Prototypical Network - a metric learning
technique. It learns intermediate representations of words which cluster well
into named entity classes. This property of the model allows classifying words
with extremely limited number of training examples, and can potentially be used
as a zero-shot learning method. By coupling this technique with transfer
learning we achieve well-performing classifiers trained on only 20 instances of
a target class.
","[{'version': 'v1', 'created': 'Fri, 14 Dec 2018 20:39:47 GMT'}]",2018-12-18,"[['Fritzler', 'Alexander', ''], ['Logacheva', 'Varvara', ''], ['Kretov', 'Maksim', '']]","['Named Entity Recognition', 'Prototypical networks', 'Few-shot learning', 'Semi-supervised learning', 'Transfer learning']"
474,1007.3760,Satish  Karra,Satish Karra and K. R. Rajagopal,"Development of three dimensional constitutive theories based on lower
  dimensional experimental data","23 pages, 6 figures",Appl. Math. 54 (2009) 147-176,10.1007/s10492-009-0010-z,,cs.NA math-ph math.MP physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most three dimensional constitutive relations that have been developed to
describe the behavior of bodies are correlated against one dimensional and two
dimensional experiments. What is usually lost sight of is the fact that
infinity of such three dimensional models may be able to explain these
experiments that are lower dimensional. Recently, the notion of maximization of
the rate of entropy production has been used to obtain constitutive relations
based on the choice of the stored energy and rate of entropy production, etc.
In this paper we show different choices for the manner in which the body stores
energy and dissipates energy and satisfies the requirement of maximization of
the rate of entropy production that leads to many three dimensional models. All
of these models, in one dimension, reduce to the model proposed by Burgers to
describe the viscoelastic behavior of bodies.
","[{'version': 'v1', 'created': 'Wed, 21 Jul 2010 21:04:51 GMT'}]",2010-07-23,"[['Karra', 'Satish', ''], ['Rajagopal', 'K. R.', '']]","['constitutive relations', 'Lagrange multiplier', 'Helmholtz potential', 'rate of dissipation', 'viscoelasticity', 'Burgers’ fluid', 'maximum entropy production']"
475,1812.02848,Anthony Palladino,Anthony Palladino and Christopher J. Thissen,Cyber Anomaly Detection Using Graph-node Role-dynamics,,"Proceedings of DYnamic and Novel Advances in Machine Learning and
  Intelligent Cyber Security Workshop (DYNAMICS'18). ACM, New York, NY, USA.
  (2019)",10.1145/3306195.3306198,,cs.CR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intrusion detection systems (IDSs) generate valuable knowledge about network
security, but an abundance of false alarms and a lack of methods to capture the
interdependence among alerts hampers their utility for network defense. Here,
we explore a graph-based approach for fusing alerts generated by multiple IDSs
(e.g., Snort, OSSEC, and Bro). Our approach generates a weighted graph of alert
fields (not network topology) that makes explicit the connections between
multiple alerts, IDS systems, and other cyber artifacts. We use this
multi-modal graph to identify anomalous changes in the alert patterns of a
network. To detect the anomalies, we apply the role-dynamics approach, which
has successfully identified anomalies in social media, email, and IP
communication graphs. In the cyber domain, each node (alert field) in the fused
IDS alert graph is assigned a probability distribution across a small set of
roles based on that node's features. A cyber attack should trigger IDS alerts
and cause changes in the node features, but rather than track every feature for
every alert-field node individually, roles provide a succinct, integrated
summary of those feature changes. We measure changes in each node's
probabilistic role assignment over time, and identify anomalies as deviations
from expected roles. We test our approach using simulations including three
weeks of normal background traffic, as well as cyber attacks that occur near
the end of the simulations. This paper presents a novel approach to multi-modal
data fusion and a novel application of role dynamics within the cyber-security
domain. Our results show a drastic decrease in the false-positive rate when
considering our anomaly indicator instead of the IDS alerts themselves, thereby
reducing alarm fatigue and providing a promising avenue for threat intelligence
in network defense.
","[{'version': 'v1', 'created': 'Thu, 6 Dec 2018 23:05:00 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Jan 2019 14:33:48 GMT'}]",2019-01-17,"[['Palladino', 'Anthony', ''], ['Thissen', 'Christopher J.', '']]","['Anomaly detection', 'data fusion', 'unsupervised machine learning', 'graph analysis', 'intrusion detection']"
476,2105.07837,Rohith Mekala,"Karampudi Radha, Mekala Rohith","An Experimental Analysis of Work-Life Balance Among The Employees using
  Machine Learning Classifiers","10 pages, 16 figures, Published with International Journal of
  Computer Trends and Technology (IJCTT)","International Journal of Computer Trends and Technology (IJCTT)
  69(4):39-48, April 2021. ISSN: 2231-2803",10.14445/22312803/IJCTT-V69I4P108,,cs.CY cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Researchers today have found out the importance of Artificial Intelligence,
and Machine Learning in our daily lives, as well as they can be used to improve
the quality of our lives as well as the cities and nations alike. An example of
this is that it is currently speculated that ML can provide ways to relieve
workers as it can predict effective working schedules and patterns which
increase the efficiency of the workers. Ultimately this is leading to a
Work-Life Balance for the workers. But how is this possible? It is practically
possible with the Machine Learning algorithms to predict, calculate the factors
affecting the feelings of the worker's work-life balance. In order to actually
do this, a sizeable amount of 12,756 people's data has been taken under
consideration. Upon analysing the data and calculating under various factors,
we have found out the correlation of various factors and WLB(Work-Life Balance
in short). There are some factors that have to be taken into serious
consideration as they play a major role in WLB. We have trained 80% of our data
with Random Forest Classifier, SVM and Naive Bayes algorithms. Upon testing,
the algorithms predict the WLB with 71.5% as the best accuracy.
","[{'version': 'v1', 'created': 'Wed, 28 Apr 2021 21:35:43 GMT'}]",2021-05-18,"[['Radha', 'Karampudi', ''], ['Rohith', 'Mekala', '']]","['Machine Learning Algorithms', 'Naïve Bayes', 'Random Forest Classifier', 'SVM', 'Work-Life-Balance']"
477,1901.09755,Rodrigo Agerri,"Rodrigo Agerri, German Rigau",Language Independent Sequence Labelling for Opinion Target Extraction,17 pages,"Artificial Intelligence (2018), 268: 65-85",10.1016/j.artint.2018.12.002,,cs.CL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this research note we present a language independent system to model
Opinion Target Extraction (OTE) as a sequence labelling task. The system
consists of a combination of clustering features implemented on top of a simple
set of shallow local features. Experiments on the well known Aspect Based
Sentiment Analysis (ABSA) benchmarks show that our approach is very competitive
across languages, obtaining best results for six languages in seven different
datasets. Furthermore, the results provide further insights into the behaviour
of clustering features for sequence labelling tasks. The system and models
generated in this work are available for public use and to facilitate
reproducibility of results.
","[{'version': 'v1', 'created': 'Mon, 28 Jan 2019 15:55:22 GMT'}]",2019-01-29,"[['Agerri', 'Rodrigo', ''], ['Rigau', 'German', '']]","['Opinion Target Extraction', 'Aspect Based Sentiment Analysis', 'Information Extraction', 'Clustering', 'Semi-supervised learning', 'Natural Language Processing']"
478,1507.02347,Jungsik Hwang,"Jungsik Hwang, Minju Jung, Naveen Madapana, Jinhyung Kim, Minkyu Choi
  and Jun Tani","Achieving Synergy in Cognitive Behavior of Humanoids via Deep Learning
  of Dynamic Visuo-Motor-Attentional Coordination","submitted to 2015 IEEE-RAS International Conference on Humanoid
  Robots",,10.1109/HUMANOIDS.2015.7363448,,cs.AI cs.LG cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The current study examines how adequate coordination among different
cognitive processes including visual recognition, attention switching, action
preparation and generation can be developed via learning of robots by
introducing a novel model, the Visuo-Motor Deep Dynamic Neural Network (VMDNN).
The proposed model is built on coupling of a dynamic vision network, a motor
generation network, and a higher level network allocated on top of these two.
The simulation experiments using the iCub simulator were conducted for
cognitive tasks including visual object manipulation responding to human
gestures. The results showed that synergetic coordination can be developed via
iterative learning through the whole network when spatio-temporal hierarchy and
temporal one can be self-organized in the visual pathway and in the motor
pathway, respectively, such that the higher level can manipulate them with
abstraction.
","[{'version': 'v1', 'created': 'Thu, 9 Jul 2015 02:10:03 GMT'}]",2016-11-15,"[['Hwang', 'Jungsik', ''], ['Jung', 'Minju', ''], ['Madapana', 'Naveen', ''], ['Kim', 'Jinhyung', ''], ['Choi', 'Minkyu', ''], ['Tani', 'Jun', '']]","['Artificial Intelligence', 'Learning', 'Robotics']"
479,1108.3260,Esra Erdem,Thomas Eiter and Esra Erdem and Halit Erdogan and Michael Fink,Finding Similar/Diverse Solutions in Answer Set Programming,"57 pages, 17 figures, 4 tables. To appear in Theory and Practice of
  Logic Programming (TPLP)","Theory and Practice of Logic Programming, 13(3), 303-359, 2013",10.1017/S1471068411000548,,cs.AI cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For some computational problems (e.g., product configuration, planning,
diagnosis, query answering, phylogeny reconstruction) computing a set of
similar/diverse solutions may be desirable for better decision-making. With
this motivation, we studied several decision/optimization versions of this
problem in the context of Answer Set Programming (ASP), analyzed their
computational complexity, and introduced offline/online methods to compute
similar/diverse solutions of such computational problems with respect to a
given distance function. All these methods rely on the idea of computing
solutions to a problem by means of finding the answer sets for an ASP program
that describes the problem. The offline methods compute all solutions in
advance using the ASP formulation of the problem with an ASP solver, like
Clasp, and then identify similar/diverse solutions using clustering methods.
The online methods compute similar/diverse solutions following one of the three
approaches: by reformulating the ASP representation of the problem to compute
similar/diverse solutions at once using an ASP solver; by computing
similar/diverse solutions iteratively (one after other) using an ASP solver; by
modifying the search algorithm of an ASP solver to compute similar/diverse
solutions incrementally. We modified Clasp to implement the last online method
and called it Clasp-NK. In the first two online methods, the given distance
function is represented in ASP; in the last one it is implemented in C++. We
showed the applicability and the effectiveness of these methods on
reconstruction of similar/diverse phylogenies for Indo-European languages, and
on several planning problems in Blocks World. We observed that in terms of
computational efficiency the last online method outperforms the others; also it
allows us to compute similar/diverse solutions when the distance function
cannot be represented in ASP.
","[{'version': 'v1', 'created': 'Tue, 16 Aug 2011 14:59:44 GMT'}]",2013-09-19,"[['Eiter', 'Thomas', ''], ['Erdem', 'Esra', ''], ['Erdogan', 'Halit', ''], ['Fink', 'Michael', '']]","['similar/diverse solutions', 'answer set programming', 'similar/diverse phylogenies', 'similar/diverse plans']"
480,1405.5342,Alin Bostan,"Alin Bostan (INRIA Saclay - Ile de France), Thierry Combot (IMB),
  Safey El Din Mohab (UPMC)","Computing necessary integrability conditions for planar parametrized
  homogeneous potentials","ISSAC'14 - International Symposium on Symbolic and Algebraic
  Computation (2014)",,10.1145/2608628.2608662,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $V\in\mathbb{Q}(i)(\a_1,\dots,\a_n)(\q_1,\q_2)$ be a rationally
parametrized planar homogeneous potential of homogeneity degree $k\neq -2, 0,
2$. We design an algorithm that computes polynomial \emph{necessary} conditions
on the parameters $(\a_1,\dots,\a_n)$ such that the dynamical system associated
to the potential $V$ is integrable. These conditions originate from those of
the Morales-Ramis-Sim\'o integrability criterion near all Darboux points. The
implementation of the algorithm allows to treat applications that were out of
reach before, for instance concerning the non-integrability of polynomial
potentials up to degree $9$. Another striking application is the first complete
proof of the non-integrability of the \emph{collinear three body problem}.
","[{'version': 'v1', 'created': 'Wed, 21 May 2014 09:07:15 GMT'}]",2014-05-22,"[['Bostan', 'Alin', '', 'INRIA Saclay - Ile de France'], ['Combot', 'Thierry', '', 'IMB'], ['Mohab', 'Safey El Din', '', 'UPMC']]","['Integrability', 'potentials', 'algorithms']"
481,1305.0483,Mayank Gupta MR,"A V Choudhari, N A Pande and M R Gupta","Feasibility Analysis of Low Cost Graphical Processing Units for
  Electromagnetic Field Simulations by Finite Difference Time Domain Method",,,10.5120/11739-7396,,cs.DC physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Among several techniques available for solving Computational Electromagnetics
(CEM) problems, the Finite Difference Time Domain (FDTD) method is one of the
best suited approaches when a parallelized hardware platform is used. In this
paper we investigate the feasibility of implementing the FDTD method using the
NVIDIA GT 520, a low cost Graphical Processing Unit (GPU), for solving the
differential form of Maxwell's equation in time domain. Initially a generalized
benchmarking problem of bandwidth test and another benchmarking problem of
'matrix left division is discussed for understanding the correlation between
the problem size and the performance on the CPU and the GPU respectively. This
is further followed by the discussion of the FDTD method, again implemented on
both, the CPU and the GT520 GPU. For both of the above comparisons, the CPU
used is Intel E5300, a low cost dual core CPU.
","[{'version': 'v1', 'created': 'Thu, 2 May 2013 15:37:36 GMT'}]",2013-05-03,"[['Choudhari', 'A V', ''], ['Pande', 'N A', ''], ['Gupta', 'M R', '']]","['CUDA', 'Maxwell’s Equation Numerical Solution', 'GPGPU Computing']"
482,1607.00476,Mordechai Shalom,"Saieed Akbari, Hadi Alizadeh, T{\i}naz Ekim, Didem G\""oz\""upek,
  Mordechai Shalom",Equimatchable Claw-Free Graphs,,"Discrete Mathematics, Volume 341, Issue 10, October 2018, Pages
  2859-2871",10.1016/j.disc.2018.06.043,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A graph is equimatchable if all of its maximal matchings have the same size.
A graph is claw-free if it does not have a claw as an induced subgraph. In this
paper, we provide, to the best of our knowledge, the first characterization of
claw-free equimatchable graphs by identifying the equimatchable claw-free graph
families. This characterization implies an efficient recognition algorithm.
","[{'version': 'v1', 'created': 'Sat, 2 Jul 2016 07:52:52 GMT'}, {'version': 'v2', 'created': 'Sun, 10 Jul 2016 09:17:48 GMT'}, {'version': 'v3', 'created': 'Tue, 24 Jul 2018 20:03:05 GMT'}]",2018-07-26,"[['Akbari', 'Saieed', ''], ['Alizadeh', 'Hadi', ''], ['Ekim', 'Tınaz', ''], ['Gözüpek', 'Didem', ''], ['Shalom', 'Mordechai', '']]","['Equimatchable graph', 'Factor-critical', 'Connectivity']"
483,1111.5733,Willy Picard,Jan \'Swierzowicz and Willy Picard,Social Service Brokerage based on UDDI and Social Requirements,"8 pages, 3 figures",,10.1007/978-3-642-15961-9_51,,cs.SE cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The choice of a suitable service provider is an important issue often
overlooked in existing architectures. Current systems focus mostly on the
service itself, paying little (if at all) attention to the service provider. In
the Service Oriented Architecture (SOA), Universal Description, Discovery and
Integration (UDDI) registries have been proposed as a way to publish and find
information about available services. These registries have been criticized for
not being completely trustworthy. In this paper, an enhancement of existing
mechanisms for finding services is proposed. The concept of Social Service
Broker addressing both service and social requirements is proposed. While UDDI
registries still provide information about available services, methods from
Social Network Analysis are proposed as a way to evaluate and rank the services
proposed by a UDDI registry in social terms.
","[{'version': 'v1', 'created': 'Thu, 24 Nov 2011 11:47:24 GMT'}]",2011-11-28,"[['Świerzowicz', 'Jan', ''], ['Picard', 'Willy', '']]","['Service Brokerage', 'UDDI', 'Social Network Analysis', 'Social Requirements', 'Service Oriented Architecture']"
484,1505.05610,Zhang WenKai,Wenkai Zhang and Jing Li,"Extended fast search clustering algorithm: widely density clusters, no
  density peaks","18 pages, 10 figures, DBDM 2015",,10.5121/csit.2015.50701,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CFSFDP (clustering by fast search and find of density peaks) is recently
developed density-based clustering algorithm. Compared to DBSCAN, it needs less
parameters and is computationally cheap for its non-iteration. Alex. at al have
demonstrated its power by many applications. However, CFSFDP performs not well
when there are more than one density peak for one cluster, what we name as ""no
density peaks"". In this paper, inspired by the idea of a hierarchical
clustering algorithm CHAMELEON, we propose an extension of CFSFDP,E_CFSFDP, to
adapt more applications. In particular, we take use of original CFSFDP to
generating initial clusters first, then merge the sub clusters in the second
phase. We have conducted the algorithm to several data sets, of which, there
are ""no density peaks"". Experiment results show that our approach outperforms
the original one due to it breaks through the strict claim of data sets.
","[{'version': 'v1', 'created': 'Thu, 21 May 2015 06:02:40 GMT'}]",2015-05-22,"[['Zhang', 'Wenkai', ''], ['Li', 'Jing', '']]","['Clustering', 'Density', 'Density peaks', 'K-nearest neighbour graph', 'Closeness & Inter-connectivity']"
485,1806.08760,Khuong Vo,"Khuong Vo, Dang Pham, Mao Nguyen, Trung Mai and Tho Quan",Combination of Domain Knowledge and Deep Learning for Sentiment Analysis,Accepted to MIWAI 2017,,10.1007/978-3-319-69456-6_14,,cs.CL cs.LG cs.NE,http://creativecommons.org/licenses/by/4.0/,"  The emerging technique of deep learning has been widely applied in many
different areas. However, when adopted in a certain specific domain, this
technique should be combined with domain knowledge to improve efficiency and
accuracy. In particular, when analyzing the applications of deep learning in
sentiment analysis, we found that the current approaches are suffering from the
following drawbacks: (i) the existing works have not paid much attention to the
importance of different types of sentiment terms, which is an important concept
in this area; and (ii) the loss function currently employed does not well
reflect the degree of error of sentiment misclassification. To overcome such
problem, we propose to combine domain knowledge with deep learning. Our
proposal includes using sentiment scores, learnt by quadratic programming, to
augment training data; and introducing the penalty matrix for enhancing the
loss function of cross entropy. When experimented, we achieved a significant
improvement in classification results.
","[{'version': 'v1', 'created': 'Fri, 22 Jun 2018 16:39:37 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Jun 2018 05:47:31 GMT'}, {'version': 'v3', 'created': 'Sat, 16 Feb 2019 00:58:24 GMT'}]",2019-02-19,"[['Vo', 'Khuong', ''], ['Pham', 'Dang', ''], ['Nguyen', 'Mao', ''], ['Mai', 'Trung', ''], ['Quan', 'Tho', '']]","['Sentiment Analysis', 'Sentiment Terms', 'Sentiment Scores', 'Training Data Augmentation', 'Deep Learning', 'Penalty Matrix', 'Weighted Cross Entropy']"
486,1601.07392,Hans Fangohr,"Hans Fangohr, Maximilian Albert, Matteo Franchin","Nmag micromagnetic simulation tool - software engineering lessons
  learned","7 pages, 5 figures, Software Engineering for Science, ICSE2016","Proceedings of the International Workshop on Software Engineering
  for Science, Pages 1-7, (2016)",10.1145/2897676.2897677,,cs.SE physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We review design and development decisions and their impact for the open
source code Nmag from a software engineering in computational science point of
view. We summarise lessons learned and recommendations for future computational
science projects. Key lessons include that encapsulating the simulation
functionality in a library of a general purpose language, here Python, provides
great flexibility in using the software. The choice of Python for the top-level
user interface was very well received by users from the science and engineering
community. The from-source installation in which required external libraries
and dependencies are compiled from a tarball was remarkably robust. In places,
the code is a lot more ambitious than necessary, which introduces unnecessary
complexity and reduces main- tainability. Tests distributed with the package
are useful, although more unit tests and continuous integration would have been
desirable. The detailed documentation, together with a tutorial for the usage
of the system, was perceived as one of its main strengths by the community.
","[{'version': 'v1', 'created': 'Wed, 27 Jan 2016 14:46:56 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Feb 2016 17:46:27 GMT'}]",2016-07-14,"[['Fangohr', 'Hans', ''], ['Albert', 'Maximilian', ''], ['Franchin', 'Matteo', '']]","['Nmag', 'Computational Science Software Engineering', 'Python', 'Finite Elements']"
487,0802.2258,Carlos Alberto Fernandez-y-Fernandez,"Anthony J. H. Simons, Carlos Alberto Fernandez-y-Fernandez",Using Alloy to model-check visual design notations,8 pages,"Simons, A.J.H. and Fernandez-y-Fernandez, C.A., Using Alloy to
  model-check visual design notations. In Sixth Mexican Int. Conf. on C S,
  (Mexico, 2005), IEEE, 121-128",10.1109/ENC.2005.52,,cs.SE cs.SC,,"  This paper explores the process of validation for the abstract syntax of a
graphical notation. We define an unified specification for five of the UML
diagrams used by the Discovery Method and, in this document, we illustrate how
diagrams can be represented in Alloy and checked against our specification in
order to know if these are valid under the Discovery notation.
","[{'version': 'v1', 'created': 'Fri, 15 Feb 2008 18:25:50 GMT'}]",2008-02-18,"[['Simons', 'Anthony J. H.', ''], ['Fernandez-y-Fernandez', 'Carlos Alberto', '']]","['Formal specification', 'model checking', 'Alloy', 'visual modelling', 'UML  1']"
488,2105.07465,Sohil Lal Shrestha,Sohil Lal Shrestha and Christoph Csallner,"SLGPT: Using Transfer Learning to Directly Generate Simulink Model Files
  and Find Bugs in the Simulink Toolchain","Changes from published version: In Algorithm 1, while condition in
  line 1 changed from ""and"" to ""or""",,10.1145/3463274.3463806,,cs.SE cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Finding bugs in a commercial cyber-physical system (CPS) development tool
such as Simulink is hard as its codebase contains millions of lines of code and
complete formal language specifications are not available. While deep learning
techniques promise to learn such language specifications from sample models,
deep learning needs a large number of training data to work well. SLGPT
addresses this problem by using transfer learning to leverage the powerful
Generative Pre-trained Transformer 2 (GPT-2) model, which has been pre-trained
on a large set of training data. SLGPT adapts GPT-2 to Simulink with both
randomly generated models and models mined from open-source repositories. SLGPT
produced Simulink models that are both more similar to open-source models than
its closest competitor, DeepFuzzSL, and found a super-set of the Simulink
development toolchain bugs found by DeepFuzzSL.
","[{'version': 'v1', 'created': 'Sun, 16 May 2021 16:08:03 GMT'}, {'version': 'v2', 'created': 'Tue, 18 May 2021 14:24:10 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Mar 2022 18:37:59 GMT'}]",2022-03-11,"[['Shrestha', 'Sohil Lal', ''], ['Csallner', 'Christoph', '']]","['Cyber-physical system development', 'Simulink', 'tool chain bugs', 'deep learning', 'programming language modeling', 'GPT-2']"
489,1605.06904,Jhoirene Clemente,"Jhoirene B. Clemente, Francis George C. Cabarle, Henry N. Adorna",PROJECTION Algorithm for Motif Finding on GPUs,"Workshop on Computation: Theory and Practice. Theory and Practice of
  Computation, Volume 5 of the series Proceedings in Information and
  Communications Technology pp 101-115 (2012)",,10.1007/978-4-431-54106-6_9,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Motif finding is one of the NP-complete problems in Computational Biology.
Existing nondeterministic algorithms for motif finding do not guarantee the
global optimality of results and are sensitive to initial parameters. To
address this problem, the PROJECTION algorithm provides a good initial estimate
that can be further refined using local optimization algorithms such as EM,
MEME or Gibbs. For large enough input (600-1000 bp per sequence) or for
challenging motif finding problems, the PROJECTION algorithm may run in an
inordinate amount of time. In this paper we present a parallel implementation
of the PROJECTION algorithm in Graphics Processing Units (GPUs) using CUDA. We
also list down several major issues we have encountered including performing
space optimizations because of the GPU's space limitations.
","[{'version': 'v1', 'created': 'Mon, 23 May 2016 06:40:18 GMT'}]",2016-05-24,"[['Clemente', 'Jhoirene B.', ''], ['Cabarle', 'Francis George C.', ''], ['Adorna', 'Henry N.', '']]","['motif finding', 'parallel computing', 'GPU', 'CUDA']"
490,1304.3309,Dragan Vidakovic Novak,"Dragan Vidakovic, Dusko Parezanovic, Olivera Nikolic and Jelena
  Kaljevic",RSA Signature: Behind the Scenes,13 pages,"Advanced Computing: An International Journal ( ACIJ ), Vol.4,
  No.2, March 2013",10.5121/acij.2013.4203,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a complete digital signature message stream, just
the way the RSA digital signature scheme does it. We will focus on the
operations with large numbers due to the fact that operating with large numbers
is the essence of RSA that cannot be understood by the usual illustrative
examples with small numbers.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2013 14:16:01 GMT'}]",2013-04-12,"[['Vidakovic', 'Dragan', ''], ['Parezanovic', 'Dusko', ''], ['Nikolic', 'Olivera', ''], ['Kaljevic', 'Jelena', '']]","['Cryptography', 'Data Integrity', 'Digital Signature', 'Example']"
491,1105.0288,Martin Slota,Martin Slota and Jo\~ao Leite and Terrance Swift,Splitting and Updating Hybrid Knowledge Bases (Extended Version),64 pages; extended version of the paper accepted for ICLP 2011,"Theory and Practice of Logic Programming, 11(4-5), 801-819, 2011",10.1017/S1471068411000317,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the years, nonmonotonic rules have proven to be a very expressive and
useful knowledge representation paradigm. They have recently been used to
complement the expressive power of Description Logics (DLs), leading to the
study of integrative formal frameworks, generally referred to as hybrid
knowledge bases, where both DL axioms and rules can be used to represent
knowledge. The need to use these hybrid knowledge bases in dynamic domains has
called for the development of update operators, which, given the substantially
different way Description Logics and rules are usually updated, has turned out
to be an extremely difficult task.
  In [SL10], a first step towards addressing this problem was taken, and an
update operator for hybrid knowledge bases was proposed. Despite its
significance -- not only for being the first update operator for hybrid
knowledge bases in the literature, but also because it has some applications -
this operator was defined for a restricted class of problems where only the
ABox was allowed to change, which considerably diminished its applicability.
Many applications that use hybrid knowledge bases in dynamic scenarios require
both DL axioms and rules to be updated.
  In this paper, motivated by real world applications, we introduce an update
operator for a large class of hybrid knowledge bases where both the DL
component as well as the rule component are allowed to dynamically change. We
introduce splitting sequences and splitting theorem for hybrid knowledge bases,
use them to define a modular update semantics, investigate its basic
properties, and illustrate its use on a realistic example about cargo imports.
","[{'version': 'v1', 'created': 'Mon, 2 May 2011 10:12:59 GMT'}]",2011-07-27,"[['Slota', 'Martin', ''], ['Leite', 'João', ''], ['Swift', 'Terrance', '']]","['hybrid knowledge base', 'update', 'splitting theorem', 'ontology', 'logic program']"
492,2109.12645,Anjana Perera,"Anjana Perera (1), Aldeida Aleti (1), Marcel B\""ohme (1), Burak Turhan
  (1) ((1) Faculty of Information Technology, Monash University, Melbourne,
  Australia)",Defect Prediction Guided Search-Based Software Testing,"13 pages, 8 figures","In Proceedings of the 35th IEEE/ACM International Conference on
  Automated Software Engineering (ASE '20), 2020",10.1145/3324884.3416612,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today, most automated test generators, such as search-based software testing
(SBST) techniques focus on achieving high code coverage. However, high code
coverage is not sufficient to maximise the number of bugs found, especially
when given a limited testing budget. In this paper, we propose an automated
test generation technique that is also guided by the estimated degree of
defectiveness of the source code. Parts of the code that are likely to be more
defective receive more testing budget than the less defective parts. To measure
the degree of defectiveness, we leverage Schwa, a notable defect prediction
technique.
  We implement our approach into EvoSuite, a state of the art SBST tool for
Java. Our experiments on the Defects4J benchmark demonstrate the improved
efficiency of defect prediction guided test generation and confirm our
hypothesis that spending more time budget on likely defective parts increases
the number of bugs found in the same time budget.
","[{'version': 'v1', 'created': 'Sun, 26 Sep 2021 16:25:49 GMT'}]",2021-09-28,"[['Perera', 'Anjana', ''], ['Aleti', 'Aldeida', ''], ['Böhme', 'Marcel', ''], ['Turhan', 'Burak', '']]","['search-based software testing', 'automated test generation', 'defectprediction']"
493,1512.03796,Carlo Rodrigues KLEBER,Ananda Gorck Streit and Carlo Kleber da Silva Rodrigues,"Improving BitTorrent's Peer Selection For Multimedia Content On-Demand
  Delivery","International Journal of Computer Networks & Communications(IJCNC)
  Vol.7, No.6, November 2015",,10.5121/ijcnc.2015.7608,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The great efficiency achieved by the BitTorrent protocol for the distribution
of large amounts of data inspired its adoption to provide multimedia content
on-demand delivery over the Internet. As it is not designed for this purpose,
some adjustments have been proposed in order to meet the related QoS
requirements like low startup delay and smooth playback continuity.
Accordingly, this paper introduces a BitTorrent-like proposal named as
Quota-Based Peer Selection (QBPS). This proposal is mainly based on the
adaptation of the original peer-selection policy of the BitTorrent protocol.
Its validation is achieved by means of simulations and competitive analysis.
The final results show that QBPS outperforms other recent proposals of the
literature. For instance, it achieves a throughput optimization of up to 48.0%
in low-provision capacity scenarios where users are very interactive.
","[{'version': 'v1', 'created': 'Fri, 11 Dec 2015 20:37:05 GMT'}]",2015-12-14,"[['Streit', 'Ananda Gorck', ''], ['Rodrigues', 'Carlo Kleber da Silva', '']]","['BitTorrent', 'Multimedia', 'Streaming', 'Video on Demand', 'Interactivity.  1']"
494,1606.04190,Carlos Caminha,"Carlos Caminha, Vasco Furtado, Vl\'adia Pinheiro e Caio Ponte","Micro-interventions in urban transport from pattern discovery on the
  flow of passengers and on the bus network",arXiv admin note: substantial text overlap with arXiv:1606.03737,,10.1109/ISC2.2016.7580776,,cs.AI cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we describe a case study in a big metropolis, in which from
data collected by digital sensors, we tried to understand mobility patterns of
persons using buses and how this can generate knowledge to suggest
interventions that are applied incrementally into the transportation network in
use. We have first estimated an Origin-Destination matrix of buses users from
datasets about the ticket validation and GPS positioning of buses. Then we
represent the supply of buses with their routes through bus stops as a complex
network, which allowed us to understand the bottlenecks of the current scenario
and, in particular, applying community discovery techniques, to identify
clusters that the service supply infrastructure has. Finally, from the
superimposing of the flow of people represented in the OriginDestination matrix
in the supply network, we exemplify how micro-interventions can be prospected
by means of an example of the introduction of express routes.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2016 01:44:16 GMT'}]",2016-10-11,"[['Caminha', 'Carlos', ''], ['Furtado', 'Vasco', ''], ['Ponte', 'Vládia Pinheiro e Caio', '']]","['Mobility', 'Complex Networks', 'Data Mining']"
495,1406.0090,Arjun Puri,"Arjun Puri, Sudesh Kumar","Error Control Codes: A Novel Solution for Secret Key Generation and Key
  Refreshment Problem","6 pages, 2 figures","International Journal of Computer Applications 92(1):1-6, April
  2014",10.5120/15970-4720,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cryptography is the science of encrypting the information so that it is
rendered unreadable for an intruder. Cryptographic techniques are of utmost
importance in today's world as the information to be sent might be of
invaluable importance to both the sender and the receiver. Various
cryptographic techniques ensure that even if an intruder intercepts the sent
information, he is not able to decipher it thus render ending it useless for
the intruder. Cryptography can be grouped into two types, that is Symmetric key
cryptography and Asymmetric key cryptography. Symmetric key cryptography uses
the same key for encryption as well as decryption thus making it faster
compared to Asymmetric Key cryptography which uses different keys for
encryption and decryption. Generation of dynamic keys for Symmetric key
cryptography is an interesting field and in this we have tapped this field so
as to generate dynamic keys for symmetric key cryptography. In this work, we
have devised an algorithm for generating dynamic keys for sending messages over
a communication channel and also solving key refreshment problem.
","[{'version': 'v1', 'created': 'Sat, 31 May 2014 16:03:09 GMT'}]",2015-06-19,"[['Puri', 'Arjun', ''], ['Kumar', 'Sudesh', '']]","['RS codes (Reed Solomon codes)', 'ARQ (Automatic Repeat Request)', 'DES (Data Encryption Standard)']"
496,1811.10439,Thomas Lagkas,"Thomas Lagkas, George Eleftherakis, Konstantinos Dimopoulos, Jie Zhang","Signal strength based scheme for following mobile IoT devices in dynamic
  environments","Accepted version that replaces the previous pre-print. Pervasive and
  Mobile Computing, Elsevier, 2020",,10.1016/j.pmcj.2020.101165,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increased maturity level of technological achievements towards the
realization of the Internet of Things (IoT) vision allowed sophisticated
solutions to emerge, offering reliable monitoring in highly dynamic
environments that lack well-defined and well-designed infrastructures. In this
paper, we use a bio-inspired IoT architecture, which allows flexible creation
and discovery of sensor-based services offering self-organization and
self-optimization properties to the dynamic network, in order to make the
required monitoring information available. The main contribution of the paper
is the introduction of a new algorithm for following mobile monitored
targets/individuals in the context of an IoT system, especially a dynamic one
as the aforementioned. The devised technique, called Hot-Cold, is able to
ensure proximity maintenance by the tracking robotic device solely based on the
strength of the RF signal broadcasted by the target to communicate its sensors'
data. Complete geometrical, numerical, simulation, and convergence analyses of
the proposed technique are thoroughly presented, along with a detailed
simulation-based evaluation that reveals the higher following accuracy of
Hot-Cold compared to the popular concept of trilateration-based tracking.
Finally, a prototype of the full architecture was implemented not only to
demonstrate the applicability of the presented approach for monitoring in
dynamic environments, but also the operability of the introduced tracking
technique.
","[{'version': 'v1', 'created': 'Mon, 26 Nov 2018 15:05:51 GMT'}, {'version': 'v2', 'created': 'Mon, 11 May 2020 11:29:16 GMT'}]",2020-05-12,"[['Lagkas', 'Thomas', ''], ['Eleftherakis', 'George', ''], ['Dimopoulos', 'Konstantinos', ''], ['Zhang', 'Jie', '']]","['GPS-denied environments', 'infrastructureless localization', 'IoT']"
497,1107.4218,Maurizio Serva,Maurizio Serva,The settlement of Madagascar: what dialects and languages can tell,"We find out the area and the modalities of the settlement of
  Madagascar by Indonesian colonizers around 650 CE. Results are obtained
  comparing 23 Malagasy dialects with Malay and Maanyan languages",,10.1371/journal.pone.0030666,,cs.CL q-bio.PE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The dialects of Madagascar belong to the Greater Barito East group of the
Austronesian family and it is widely accepted that the Island was colonized by
Indonesian sailors after a maritime trek which probably took place around 650
CE. The language most closely related to Malagasy dialects is Maanyan but also
Malay is strongly related especially for what concerns navigation terms. Since
the Maanyan Dayaks live along the Barito river in Kalimantan (Borneo) and they
do not possess the necessary skill for long maritime navigation, probably they
were brought as subordinates by Malay sailors.
  In a recent paper we compared 23 different Malagasy dialects in order to
determine the time and the landing area of the first colonization. In this
research we use new data and new methods to confirm that the landing took place
on the south-east coast of the Island. Furthermore, we are able to state here
that it is unlikely that there were multiple settlements and, therefore,
colonization consisted in a single founding event.
  To reach our goal we find out the internal kinship relations among all the 23
Malagasy dialects and we also find out the different kinship degrees of the 23
dialects versus Malay and Maanyan. The method used is an automated version of
the lexicostatistic approach. The data concerning Madagascar were collected by
the author at the beginning of 2010 and consist of Swadesh lists of 200 items
for 23 dialects covering all areas of the Island. The lists for Maanyan and
Malay were obtained from published datasets integrated by author's interviews.
","[{'version': 'v1', 'created': 'Thu, 21 Jul 2011 10:02:31 GMT'}]",2015-05-28,"[['Serva', 'Maurizio', '']]","['Malagasy dialects', 'Austronesian languages', 'taxonomy of languages', 'lexicostatistics', 'Malagasyorigins']"
498,1907.12549,Wei Yan Ph.D.,Wei Yan,"Augmented Reality Applied to LEGO Construction: AR-based Building
  Instructions with High Accuracy & Precision and Realistic Object-Hand
  Occlusions","Accompanying project video:
  https://www.youtube.com/watch?v=7JDW_lDv7FU and LinkedIn article:
  https://www.linkedin.com/pulse/augmented-reality-lego-construction-iphone-wei-yan/
  In version 4, algorithms are explained in more detail, more evaluations are
  added, and references are updated, while the results of the performance of AR
  instruction are unchanged. Virtual Reality (2021)",,10.1007/s10055-021-00582-7,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  BRICKxAR is a novel Augmented Reality (AR) instruction method for
construction toys such as LEGO. With BRICKxAR, physical LEGO construction is
guided by virtual bricks. Compared with the state-of-the-art, accuracy of the
virtual - physical model alignment is significantly improved through a new
design of marker-based registration, which can achieve an average error less
than 1mm throughout the model. Realistic object occlusion is accomplished to
reveal the true spatial relationship between physical and virtual bricks. LEGO
players' hand detection and occlusion are realized to visualize the correct
spatial relationship between real hands and virtual bricks, and allow virtual
bricks to be ""grasped"" by real hands. The integration of these features makes
AR instructions possible for small-parts assembly, validated through a working
AR prototype for constructing LEGO Arc de Triomphe, quantitative measures of
the accuracies of registration and occlusions, and heuristic evaluation of AR
instruction features.
","[{'version': 'v1', 'created': 'Mon, 29 Jul 2019 17:44:14 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Jul 2019 17:22:15 GMT'}, {'version': 'v3', 'created': 'Sun, 11 Aug 2019 21:19:53 GMT'}, {'version': 'v4', 'created': 'Sun, 20 Dec 2020 00:29:10 GMT'}]",2021-10-12,"[['Yan', 'Wei', '']]","['Augmented Reality', 'Assembly', 'Instruction', 'Occlusion', 'Accuracy']"
499,1507.07227,Lingfei Wu,"Lingfei Wu, Jesse Laeuchli, Vassilis Kalantzis, Andreas Stathopoulos,
  and Efstratios Gallopoulos","Estimating the Trace of the Matrix Inverse by Interpolating from the
  Diagonal of an Approximate Inverse","22 pages, 15 figures",,10.1016/j.jcp.2016.09.001,,cs.NA math.NA quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A number of applications require the computation of the trace of a matrix
that is implicitly available through a function. A common example of a function
is the inverse of a large, sparse matrix, which is the focus of this paper.
When the evaluation of the function is expensive, the task is computationally
challenging because the standard approach is based on a Monte Carlo method
which converges slowly. We present a different approach that exploits the
pattern correlation, if present, between the diagonal of the inverse of the
matrix and the diagonal of some approximate inverse that can be computed
inexpensively. We leverage various sampling and fitting techniques to fit the
diagonal of the approximation to the diagonal of the inverse. Depending on the
quality of the approximate inverse, our method may serve as a standalone kernel
for providing a fast trace estimate with a small number of samples.
Furthermore, the method can be used as a variance reduction method for Monte
Carlo in some cases. This is decided dynamically by our algorithm. An extensive
set of experiments with various technique combinations on several matrices from
some real applications demonstrate the potential of our method.
","[{'version': 'v1', 'created': 'Sun, 26 Jul 2015 17:43:26 GMT'}, {'version': 'v2', 'created': 'Sat, 2 Jul 2016 17:58:14 GMT'}, {'version': 'v3', 'created': 'Tue, 6 Sep 2016 02:15:44 GMT'}]",2016-09-07,"[['Wu', 'Lingfei', ''], ['Laeuchli', 'Jesse', ''], ['Kalantzis', 'Vassilis', ''], ['Stathopoulos', 'Andreas', ''], ['Gallopoulos', 'Efstratios', '']]","['Matrix trace', 'Monte Carlo method', 'variance reduction', 'preconditioner', 'fitting', 'interpolation']"
500,1406.7078,Mehdi Tibouchi,Pierre-Alain Fouque and Mehdi Tibouchi,Close to Uniform Prime Number Generation With Fewer Random Bits,"Full version of ICALP 2014 paper. Alternate version of IACR ePrint
  Report 2011/481",,10.1007/978-3-662-43948-7_82,,cs.CR math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we analyze several variants of a simple method for generating
prime numbers with fewer random bits. To generate a prime $p$ less than $x$,
the basic idea is to fix a constant $q\propto x^{1-\varepsilon}$, pick a
uniformly random $a<q$ coprime to $q$, and choose $p$ of the form $a+t\cdot q$,
where only $t$ is updated if the primality test fails. We prove that variants
of this approach provide prime generation algorithms requiring few random bits
and whose output distribution is close to uniform, under less and less
expensive assumptions: first a relatively strong conjecture by H.L. Montgomery,
made precise by Friedlander and Granville; then the Extended Riemann
Hypothesis; and finally fully unconditionally using the
Barban-Davenport-Halberstam theorem. We argue that this approach has a number
of desirable properties compared to previous algorithms.
","[{'version': 'v1', 'created': 'Fri, 27 Jun 2014 06:12:05 GMT'}]",2014-06-30,"[['Fouque', 'Pierre-Alain', ''], ['Tibouchi', 'Mehdi', '']]","['Number Theory', 'Cryptography', 'Prime Number Generation']"
501,1306.4478,Stefanie Wuhrer,"Stefanie Wuhrer, Jochen Lang, Motahareh Tekieh and Chang Shu",Finite Element Based Tracking of Deforming Surfaces,additional experiments,"Graphical Models, 77(1), pp. 1-17, 2015",10.1016/j.gmod.2014.10.002,,cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an approach to robustly track the geometry of an object that
deforms over time from a set of input point clouds captured from a single
viewpoint. The deformations we consider are caused by applying forces to known
locations on the object's surface. Our method combines the use of prior
information on the geometry of the object modeled by a smooth template and the
use of a linear finite element method to predict the deformation. This allows
the accurate reconstruction of both the observed and the unobserved sides of
the object. We present tracking results for noisy low-quality point clouds
acquired by either a stereo camera or a depth camera, and simulations with
point clouds corrupted by different error terms. We show that our method is
also applicable to large non-linear deformations.
","[{'version': 'v1', 'created': 'Wed, 19 Jun 2013 10:25:24 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Mar 2014 19:45:52 GMT'}, {'version': 'v3', 'created': 'Tue, 28 Oct 2014 18:40:01 GMT'}]",2015-03-31,"[['Wuhrer', 'Stefanie', ''], ['Lang', 'Jochen', ''], ['Tekieh', 'Motahareh', ''], ['Shu', 'Chang', '']]","['geometry processing', 'surface tracking', 'template deformation', 'linear finite element deformation']"
502,1507.03348,Maurice Chandoo,Maurice Chandoo,Deciding Circular-Arc Graph Isomorphism in Parameterized Logspace,"14 pages, 3 figures",,10.4230/LIPIcs.STACS.2016.26,,cs.DS cs.DM,http://creativecommons.org/licenses/by/4.0/,"  We compute a canonical circular-arc representation for a given circular-arc
(CA) graph which implies solving the isomorphism and recognition problem for
this class. To accomplish this we split the class of CA graphs into uniform and
non-uniform ones and employ a generalized version of the argument given by
K\""obler et al (2013) that has been used to show that the subclass of Helly CA
graphs can be canonized in logspace. For uniform CA graphs our approach works
in logspace and in addition to that Helly CA graphs are a strict subset of
uniform CA graphs. Thus our result is a generalization of the canonization
result for Helly CA graphs. In the non-uniform case a specific set of ambiguous
vertices arises. By choosing the parameter to be the cardinality of this set
the obstacle can be solved by brute force. This leads to an O(k + log n) space
algorithm to compute a canonical representation for non-uniform and therefore
all CA graphs.
","[{'version': 'v1', 'created': 'Mon, 13 Jul 2015 08:01:13 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Oct 2015 11:41:56 GMT'}, {'version': 'v3', 'created': 'Mon, 28 Dec 2015 10:16:40 GMT'}]",2018-02-02,"[['Chandoo', 'Maurice', '']]","['graph isomorphism', 'canonical representation', 'parameterized algorithm']"
503,1808.02998,Benno Stein,"Benno Stein, Lazaro Clapp, Manu Sridharan, Bor-Yuh Evan Chang",Safe Stream-Based Programming with Refinement Types,,"Proceedings of the 2018 33rd ACM/IEEE International Conference on
  Automated Software Engineering",10.1145/3238147.3238174,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In stream-based programming, data sources are abstracted as a stream of
values that can be manipulated via callback functions. Stream-based programming
is exploding in popularity, as it provides a powerful and expressive paradigm
for handling asynchronous data sources in interactive software. However,
high-level stream abstractions can also make it difficult for developers to
reason about control- and data-flow relationships in their programs. This is
particularly impactful when asynchronous stream-based code interacts with
thread-limited features such as UI frameworks that restrict UI access to a
single thread, since the threading behavior of streaming constructs is often
non-intuitive and insufficiently documented.
  In this paper, we present a type-based approach that can statically prove the
thread-safety of UI accesses in stream-based software. Our key insight is that
the fluent APIs of stream-processing frameworks enable the tracking of threads
via type-refinement, making it possible to reason automatically about what
thread a piece of code runs on -- a difficult problem in general.
  We implement the system as an annotation-based Java typechecker for Android
programs built upon the popular ReactiveX framework and evaluate its efficacy
by annotating and analyzing 8 open-source apps, where we find 33 instances of
unsafe UI access while incurring an annotation burden of only one annotation
per 186 source lines of code. We also report on our experience applying the
typechecker to two much larger apps from the Uber Technologies Inc. codebase,
where it currently runs on every code change and blocks changes that introduce
potential threading bugs.
","[{'version': 'v1', 'created': 'Thu, 9 Aug 2018 02:19:16 GMT'}]",2018-08-10,"[['Stein', 'Benno', ''], ['Clapp', 'Lazaro', ''], ['Sridharan', 'Manu', ''], ['Chang', 'Bor-Yuh Evan', '']]","['stream-based programming', 'refinement types', 'mobile applications']"
504,1502.07812,Kwangsu Lee,"Kwangsu Lee, Jong Hwan Park, Dong Hoon Lee","Anonymous HIBE with Short Ciphertexts: Full Security in Prime Order
  Groups","31 pages, 1 figure","Designs, Codes and Cryptography, vol. 74, no. 2, pp. 395-425, Feb.
  2015",10.1007/s10623-013-9868-6,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Anonymous Hierarchical Identity-Based Encryption (HIBE) is an extension of
Identity-Based Encryption (IBE), and it provides not only a message hiding
property but also an identity hiding property. Anonymous HIBE schemes can be
applicable to anonymous communication systems and public key encryption systems
with keyword searching. However, previous anonymous HIBE schemes have some
disadvantages that the security was proven in the weaker model, the size of
ciphertexts is not short, or the construction was based on composite order
bilinear groups. In this paper, we propose the first efficient anonymous HIBE
scheme with short ciphertexts in prime order (asymmetric) bilinear groups, and
prove its security in the full model with an efficient reduction. To achieve
this, we use the dual system encryption methodology of Waters. We also present
the benchmark results of our scheme by measuring the performance of our
implementation.
","[{'version': 'v1', 'created': 'Fri, 27 Feb 2015 03:31:04 GMT'}]",2015-03-02,"[['Lee', 'Kwangsu', ''], ['Park', 'Jong Hwan', ''], ['Lee', 'Dong Hoon', '']]","['Identity-based encryption', 'Hierarchical identity-based encryption', 'Anonymity', 'Full model security', 'Bilinear maps']"
505,1510.08240,Bruno Torresani,"H Omer (I2M), B Torr\'esani (I2M)","Time-frequency and time-scale analysis of deformed stationary processes,
  with application to non-stationary sound modeling","Applied and Computational Harmonic Analysis, Elsevier, 2016,
  \&lt;10.1016/j.acha.2015.10.002\&gt",,10.1016/j.acha.2015.10.002,,cs.IT math.IT math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A class of random non-stationary signals termed timbre x dynamics is
introduced and studied. These signals are obtained by non-linear
transformations of sta-tionary random gaussian signals, in such a way that the
transformation can be approximated by translations in an appropriate
representation domain. In such situations, approximate maximum likelihood
estimation techniques can be de-rived, which yield simultaneous estimation of
the transformation and the power spectrum of the underlying stationary signal.
This paper focuses on the case of modulation and time warping of station-ary
signals, and proposes and studies estimation algorithms (based on
time-frequency and time-scale representations respectively) for these
quantities of interest. The proposed approach is validated on numerical
simulations on synthetic signals, and examples on real life car engine sounds.
","[{'version': 'v1', 'created': 'Wed, 28 Oct 2015 09:35:38 GMT'}]",2015-10-29,"[['Omer', 'H', '', 'I2M'], ['Torrésani', 'B', '', 'I2M']]","['Stationary signals', 'Time-frequency', 'Time-scale', 'Warping', 'Modulation']"
506,1603.02642,Paul Issartel,"Paul Issartel (UP11,LIMSI), Lonni Besan\c{c}on (UP11,AVIZ), Tobias
  Isenberg (AVIZ), Mehdi Ammi (UP11,LIMSI)",A Tangible Volume for Portable 3D Interaction,,,10.1109/ISMAR-Adjunct.2016.0079,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new approach to achieve tangible object manipulation with a
single, fully portable and self-contained device. Our solution is based on the
concept of a ""tangible volume"". We turn a tangible object into a handheld
fish-tank display. The tangible volume represents a volume of space that can be
freely manipulated within a virtual scene. This volume can be positioned onto
virtual objects to directly grasp them, and to manipulate them in 3D space. We
investigate this concept through two user studies. The first study evaluates
the intuitiveness of using a tangible volume for grasping and manipulating
virtual objects. The second study evaluates the effects of the limited field of
view on spatial awareness. Finally, we present a generalization of this concept
to other forms of interaction through the surface of the volume.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2016 19:53:07 GMT'}]",2020-08-19,"[['Issartel', 'Paul', '', 'UP11,LIMSI'], ['Besançon', 'Lonni', '', 'UP11,AVIZ'], ['Isenberg', 'Tobias', '', 'AVIZ'], ['Ammi', 'Mehdi', '', 'UP11,LIMSI']]","['Tangible User Interface', '3D Manipulation', 'FishTank VR']"
507,1607.08809,Santiago Arroyave-Tobon,"Santiago Arroyave-Tob\'on (I2M), Denis Teissandier (I2M), Vincent
  Delos (I2M)","Adapting polytopes dimension for managing degrees of freedom in
  tolerancing analysis","in 14th CIRP Conference on Computer Aided Tolerancing (CAT), May
  2016, Gothenburg, Sweden",,10.1016/j.procir.2016.01.020,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In tolerancing analysis, geometrical or contact specifications can be
represented by polytopes. Due to the degrees of invariance of surfaces and that
of freedom of joints, these operand polytopes are originally unbounded in most
of the cases (i.e. polyhedra). Homri et al. proposed the introduction of
virtual boundaries (called cap half-spaces) over the unbounded displacements of
each polyhedron to turn them into 6-polytopes. This decision was motivated by
the complexity that operating on polyhedra in R6 supposes. However, that
strategy has to face the multiplication of the number of cap half-spaces during
the computation of Minkowski sums. In general, the time for computing cap
facets is greater than for computing facets representing real limits of bounded
displacements. In order to deal with that, this paper proposes the use of the
theory of screws to determine the set of displacements that defines the
positioning of one surface in relation to another. This set of displacements
defines the subspace of R6 in which the polytopes of the respective surfaces
have to be projected and operated to avoid calculating facets and vertices
along the directions of unbounded displacements. With this new strategy it is
possible to decrease the complexity of the Minkowski sums by reducing the
dimension of the operands and consequently reducing the computation time. An
example illustrates the method and shows the time reduction during the
computations.
","[{'version': 'v1', 'created': 'Wed, 13 Jul 2016 08:25:23 GMT'}]",2016-08-01,"[['Arroyave-Tobón', 'Santiago', '', 'I2M'], ['Teissandier', 'Denis', '', 'I2M'], ['Delos', 'Vincent', '', 'I2M']]","['Tolerance analysis', 'set of constraints', 'polytopes', 'Minkowski sum', 'screws']"
508,1403.1362,Shireesha Chintalapati,Shireesha Chintalapati and M. V. Raghunadh,"Illumination,Expression and Occlusion Invariant Pose-Adaptive Face
  Recognition System for Real-Time Applications","7 pages,8 figures, Published with International Journal of
  Engineering Trends and Technology (IJETT)","International Journal of Engineering Trends and Technology(IJETT),
  V8(6),292-298 February 2014. Published by seventh sense research group",10.14445/22315381/IJETT-V8P254,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Face recognition in real-time scenarios is mainly affected by illumination,
expression and pose variations and also by occlusion. This paper presents the
framework for pose adaptive component-based face recognition system. The
framework proposed deals with all the above mentioned issues. The steps
involved in the presented framework are (i) facial landmark localisation, (ii)
facial component extraction, (iii) pre-processing of facial image (iv) facial
pose estimation (v) feature extraction using Local Binary Pattern Histograms of
each component followed by (vi) fusion of pose adaptive classification of
components. By employing pose adaptive classification, the recognition process
is carried out on some part of database, based on estimated pose, instead of
applying the recognition process on the whole database. Pre-processing
techniques employed to overcome the problems due to illumination variation are
also discussed in this paper. Component-based techniques provide better
recognition rates when face images are occluded compared to the holistic
methods. Our method is simple, feasible and provides better results when
compared to other holistic methods.
","[{'version': 'v1', 'created': 'Thu, 6 Mar 2014 07:19:24 GMT'}]",2014-03-07,"[['Chintalapati', 'Shireesha', ''], ['Raghunadh', 'M. V.', '']]","['Pose estimation', 'Component extraction', 'LBPH', 'Kinect']"
509,1401.1289,"J\""urgen M\""unch","Jens Heidrich and J\""urgen M\""unch",Implementing Software Project Control Centers: An Architectural View,"14 pages. The final publication is available at
  http://link.springer.com/chapter/10.1007%2F978-3-540-89403-2_25","Software Process and Product Measurement, volume 5338 of Lecture
  Notes in Computer Science, pages 302-315. Springer Berlin Heidelberg, 2008",10.1007/978-3-540-89403-2_25,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Setting up effective and efficient mechanisms for controlling software and
system development projects is still challenging in industrial practice. On the
one hand, necessary prerequisites such as established development processes,
understanding of cause-effect relationships on relevant indicators, and
sufficient sustainability of measurement programs are often missing. On the
other hand, there are more fundamental methodological deficits related to the
controlling process itself and to appropriate tool support. Additional
activities that would guarantee the usefulness, completeness, and precision of
the result- ing controlling data are widely missing. This article presents a
conceptual architecture for so-called Software Project Control Centers (SPCC)
that addresses these challenges. The architecture includes mechanisms for
getting sufficiently precise and complete data and supporting the information
needs of different stakeholders. In addition, an implementation of this
architecture, the so-called Specula Project Support Environment, is sketched,
and results from evaluating this implementation in industrial settings are
presented.
","[{'version': 'v1', 'created': 'Tue, 7 Jan 2014 06:58:04 GMT'}]",2014-01-08,"[['Heidrich', 'Jens', ''], ['Münch', 'Jürgen', '']]","['Software Project Control Center', 'Measurement', 'QIP', 'GQM']"
510,2205.08249,Daniel Rotman,"Daniel Rotman, Yevgeny Yaroker, Elad Amrani, Udi Barzelay, Rami
  Ben-Ari",Learnable Optimal Sequential Grouping for Video Scene Detection,,"In Proceedings of the 28th ACM International Conference on
  Multimedia, pp. 1958-1966. 2020",10.1145/3394171.3413612,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video scene detection is the task of dividing videos into temporal semantic
chapters. This is an important preliminary step before attempting to analyze
heterogeneous video content. Recently, Optimal Sequential Grouping (OSG) was
proposed as a powerful unsupervised solution to solve a formulation of the
video scene detection problem. In this work, we extend the capabilities of OSG
to the learning regime. By giving the capability to both learn from examples
and leverage a robust optimization formulation, we can boost performance and
enhance the versatility of the technology. We present a comprehensive analysis
of incorporating OSG into deep learning neural networks under various
configurations. These configurations include learning an embedding in a
straight-forward manner, a tailored loss designed to guide the solution of OSG,
and an integrated model where the learning is performed through the OSG
pipeline. With thorough evaluation and analysis, we assess the benefits and
behavior of the various configurations, and show that our learnable OSG
approach exhibits desirable behavior and enhanced performance compared to the
state of the art.
","[{'version': 'v1', 'created': 'Tue, 17 May 2022 11:45:03 GMT'}]",2022-06-10,"[['Rotman', 'Daniel', ''], ['Yaroker', 'Yevgeny', ''], ['Amrani', 'Elad', ''], ['Barzelay', 'Udi', ''], ['Ben-Ari', 'Rami', '']]","['Video Scene Detection', 'Deep Learning', 'Video Analysis', 'TemporalSegmentation', 'Dynamic Programming', 'Optimization']"
511,1711.04185,Hossein Lolaee,Hossein Lolaee and Mohammad Ali Akhaee,Analytic Model for Network Resource Management between ISPs and Users,"14 pages, 7 figures, Journal of IET Networks","IET Networks, vol. 6, no. 2, pp. 32 to 38, Mar. 2017",10.1049/iet-net.2016.0060,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fixed Communication Provider (FCP) is a consortium of Internet Service
Providers (ISPs) which users can switch easily and freely between their ISPs.
In order to increase the QoS of the ISPs, we propose a two class service model
as the following. ISPs divide their available bandwidth into two parts to
provide their end users with optimal services. One dedicated to primary users,
and the other for secondary users. Primary users are those who pay more and
thus, expect dedicated bandwidth that is always available. Secondary services
are provided by ISPs for the other users who cannot afford the dedicated
bandwidth. In this study, by defining the utility functions for both user
types, we aim at dividing the ISP bandwidth between these two services such
that the utility function of the users is maximized. Since the primary users do
not always use the maximum bandwidth, an algorithm is proposed for ISPs to
estimate the primary users required bandwidth in each time segment based on the
previous segments. Based on this estimate, the expected bandwidth is dedicated
to the primary users, and the remaining bandwidth is devoted to the secondary
users to improve the Quality of Service (QoS). On the other hand, an ISP is
penalized if it fails to provide the primary users with the required bandwidth
mentioned in their contract. Therefore, there exists a trade-off between the
conservative estimation of the primary users rate, QoS of the secondary users
and the achieved utility of the ISPs.
","[{'version': 'v1', 'created': 'Sat, 11 Nov 2017 19:28:43 GMT'}]",2017-11-15,"[['Lolaee', 'Hossein', ''], ['Akhaee', 'Mohammad Ali', '']]","['Network analysis', 'Network management', 'Quality of service (QoS)']"
512,1804.01900,Davood Zabihzadeh,"Baida Hamdan, Davood Zabihzadeh, Monsefi Reza","Large Scale Local Online Similarity/Distance Learning Framework based on
  Passive/Aggressive",,,10.1142/S0218001421510174,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Similarity/Distance measures play a key role in many machine learning,
pattern recognition, and data mining algorithms, which leads to the emergence
of metric learning field. Many metric learning algorithms learn a global
distance function from data that satisfy the constraints of the problem.
However, in many real-world datasets that the discrimination power of features
varies in the different regions of input space, a global metric is often unable
to capture the complexity of the task. To address this challenge, local metric
learning methods are proposed that learn multiple metrics across the different
regions of input space. Some advantages of these methods are high flexibility
and the ability to learn a nonlinear mapping but typically achieves at the
expense of higher time requirement and overfitting problem. To overcome these
challenges, this research presents an online multiple metric learning
framework. Each metric in the proposed framework is composed of a global and a
local component learned simultaneously. Adding a global component to a local
metric efficiently reduce the problem of overfitting. The proposed framework is
also scalable with both sample size and the dimension of input data. To the
best of our knowledge, this is the first local online similarity/distance
learning framework based on PA (Passive/Aggressive). In addition, for
scalability with the dimension of input data, DRP (Dual Random Projection) is
extended for local online learning in the present work. It enables our methods
to be run efficiently on high-dimensional datasets, while maintains their
predictive performance. The proposed framework provides a straightforward local
extension to any global online similarity/distance learning algorithm based on
PA.
","[{'version': 'v1', 'created': 'Thu, 5 Apr 2018 15:11:11 GMT'}]",2022-01-04,"[['Hamdan', 'Baida', ''], ['Zabihzadeh', 'Davood', ''], ['Reza', 'Monsefi', '']]","['Metric Learning', 'Local Learning', 'PA (Passive/Aggressive)', 'Online Learning', 'Dual Random Projection']"
513,2102.07916,Zhichun Guo,"Zhichun Guo, Chuxu Zhang, Wenhao Yu, John Herr, Olaf Wiest, Meng
  Jiang, Nitesh V. Chawla",Few-Shot Graph Learning for Molecular Property Prediction,"To appear in WWW 2021 (long paper); Code is available at
  https://github.com/zhichunguo/Meta-MGNN",,10.1145/3442381.3450112,,cs.LG cs.SI,http://creativecommons.org/licenses/by/4.0/,"  The recent success of graph neural networks has significantly boosted
molecular property prediction, advancing activities such as drug discovery. The
existing deep neural network methods usually require large training dataset for
each property, impairing their performances in cases (especially for new
molecular properties) with a limited amount of experimental data, which are
common in real situations. To this end, we propose Meta-MGNN, a novel model for
few-shot molecular property prediction. Meta-MGNN applies molecular graph
neural network to learn molecular representation and builds a meta-learning
framework for model optimization. To exploit unlabeled molecular information
and address task heterogeneity of different molecular properties, Meta-MGNN
further incorporates molecular structure, attribute based self-supervised
modules and self-attentive task weights into the former framework,
strengthening the whole learning model. Extensive experiments on two public
multi-property datasets demonstrate that Meta-MGNN outperforms a variety of
state-of-the-art methods.
","[{'version': 'v1', 'created': 'Tue, 16 Feb 2021 01:55:34 GMT'}]",2021-02-17,"[['Guo', 'Zhichun', ''], ['Zhang', 'Chuxu', ''], ['Yu', 'Wenhao', ''], ['Herr', 'John', ''], ['Wiest', 'Olaf', ''], ['Jiang', 'Meng', ''], ['Chawla', 'Nitesh V.', '']]","['Molecular Property Prediction', 'Few-Shot Learning', 'Graph Learning']"
514,1904.00592,Foivos Diakogiannis,"Foivos I. Diakogiannis, Fran\c{c}ois Waldner, Peter Caccetta, Chen Wu","ResUNet-a: a deep learning framework for semantic segmentation of
  remotely sensed data","Accepted for publication to the ISPRS Journal of Photogrammetry and
  Remote Sensing",,10.1016/j.isprsjprs.2020.01.013,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scene understanding of high resolution aerial images is of great importance
for the task of automated monitoring in various remote sensing applications.
Due to the large within-class and small between-class variance in pixel values
of objects of interest, this remains a challenging task. In recent years, deep
convolutional neural networks have started being used in remote sensing
applications and demonstrate state of the art performance for pixel level
classification of objects. \textcolor{black}{Here we propose a reliable
framework for performant results for the task of semantic segmentation of
monotemporal very high resolution aerial images. Our framework consists of a
novel deep learning architecture, ResUNet-a, and a novel loss function based on
the Dice loss. ResUNet-a uses a UNet encoder/decoder backbone, in combination
with residual connections, atrous convolutions, pyramid scene parsing pooling
and multi-tasking inference. ResUNet-a infers sequentially the boundary of the
objects, the distance transform of the segmentation mask, the segmentation mask
and a colored reconstruction of the input. Each of the tasks is conditioned on
the inference of the previous ones, thus establishing a conditioned
relationship between the various tasks, as this is described through the
architecture's computation graph. We analyse the performance of several
flavours of the Generalized Dice loss for semantic segmentation, and we
introduce a novel variant loss function for semantic segmentation of objects
that has excellent convergence properties and behaves well even under the
presence of highly imbalanced classes.} The performance of our modeling
framework is evaluated on the ISPRS 2D Potsdam dataset. Results show
state-of-the-art performance with an average F1 score of 92.9\% over all
classes for our best model.
","[{'version': 'v1', 'created': 'Mon, 1 Apr 2019 06:54:29 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Jul 2019 10:00:22 GMT'}, {'version': 'v3', 'created': 'Wed, 15 Jan 2020 09:20:24 GMT'}]",2020-02-28,"[['Diakogiannis', 'Foivos I.', ''], ['Waldner', 'François', ''], ['Caccetta', 'Peter', ''], ['Wu', 'Chen', '']]","['convolutional neural network', 'loss function', 'architecture', 'data augmentation', 'very high spatial resolution']"
515,1606.05691,Marco Scarsini,"Marco Scarsini, Marc Schr\""oder, and Tristan Tomala",Dynamic Atomic Congestion Games with Seasonal Flows,"61 pages, 17 figures",,10.1287/opre.2017.1683,,cs.GT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a model of discrete time dynamic congestion games with atomic
players and a single source-destination pair. The latencies of edges are
composed by free-flow transit times and possible queuing time due to capacity
constraints. We give a precise description of the dynamics induced by the
individual strategies of players and of the corresponding costs, either when
the traffic is controlled by a planner, or when players act selfishly. In
parallel networks, optimal and equilibrium behavior eventually coincides, but
the selfish behavior of the first players has consequences that cannot be
undone and are paid by all future generations. In more general topologies, our
main contributions are three-fold.
  First, we show that equilibria are usually not unique. In particular, we
prove that there exists a sequence of networks such that the price of anarchy
is equal to $n-1$, where $n$ is the number of vertices, and the price of
stability is equal to 1.
  Second, we illustrate a new dynamic version of Braess's paradox: the presence
of initial queues in a network may decrease the long-run costs in equilibrium.
This paradox may arise even in networks for which no Braess's paradox was
previously known.
  Third, we propose an extension to model seasonalities by assuming that
departure flows fluctuate periodically over time. We introduce a measure that
captures the queues induced by periodicity of inflows. This measure is the
increase in costs compared to uniform departures for optimal and equilibrium
flows in parallel networks.
","[{'version': 'v1', 'created': 'Fri, 17 Jun 2016 22:26:04 GMT'}]",2019-01-03,"[['Scarsini', 'Marco', ''], ['Schröder', 'Marc', ''], ['Tomala', 'Tristan', '']]","['Network games', 'dynamic flows', 'price of seasonality', 'price of anarchy', 'max-flow']"
516,1210.7889,Nader Ale Ebrahim,"Nader Ale Ebrahim, Shamsuddin Ahmed, Salwa Hanim Abdul Rashid, Zahari
  Taha, M. A. Wazed",Virtual Collaborative R&D Teams in Malaysia Manufacturing SMEs,4 pages,"(2012). Virtual Collaborative R&D Teams in Malaysia Manufacturing
  SMEs. Advanced Materials Research, 433-440, 1653-1659",10.4028/www.scientific.net/AMR.433-440.1653,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the results of empirical research conducted during March
to September 2009. The study focused on the influence of virtual research and
development teams within Malaysian manufacturing small and medium sized
enterprises (SMEs). The specific objective of the study is better understanding
of the application of collaborative technologies in business, to find the
effective factors to assist SMEs to remain competitive in the future. The paper
stresses to find an answer for a question Is there any relationship between
company size, Internet connection facility and virtuality?. The survey data
shows SMEs are now technologically capable of performing the virtual
collaborative team, but the infrastructure usage is less. SMEs now have the
necessary technology to begin the implementation process of collaboration tools
to reduce research and development time, costs and increase productivity. So,
the manager of R and D should take the potentials of virtual teams into
account.
","[{'version': 'v1', 'created': 'Tue, 30 Oct 2012 02:41:51 GMT'}]",2012-10-31,"[['Ebrahim', 'Nader Ale', ''], ['Ahmed', 'Shamsuddin', ''], ['Rashid', 'Salwa Hanim Abdul', ''], ['Taha', 'Zahari', ''], ['Wazed', 'M. A.', '']]","['Small and medium enterprises', 'Collaborative tools', 'Questionnaires', 'Virtual teams']"
517,1809.01578,Mohamed Elobaid,"Mohamed Elobaid, Yue Hu, Giulio Romualdi, Stefano Dafarra, Jan Babic
  and Daniele Pucci",Telexistence and Teleoperation for Walking Humanoid Robots,,,10.1007/978-3-030-29513-4_80,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes an architecture for achieving telexistence and
teleoperation of humanoid robots. The architecture combines several
technological set-ups, methodologies, locomotion and manipulation algorithms in
a novel manner, thus building upon and extending works available in literature.
The approach allows a human operator to command and telexist with the robot.
Therefore, in this work we treat aspects pertaining not only to the proposed
architecture structure and implementation, but also the human operator
experience in terms of ability to adapt to the robot and to the architecture.
Also the proprioception aspects and embodiment of the robot are studied through
specific experimental results, which are also treated in a somewhat formal,
albeit high-level manner. Application of the proposed architecture and
experiments incorporating user training and experience are addressed using an
illustrative bipedal humanoid robot, namely the iCub robot.
","[{'version': 'v1', 'created': 'Wed, 5 Sep 2018 15:32:14 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Apr 2019 08:46:41 GMT'}]",2019-12-03,"[['Elobaid', 'Mohamed', ''], ['Hu', 'Yue', ''], ['Romualdi', 'Giulio', ''], ['Dafarra', 'Stefano', ''], ['Babic', 'Jan', ''], ['Pucci', 'Daniele', '']]","['Teleoperation', 'Humaniods', 'Telexistance']"
518,2105.11895,Hongbin Zhuang,"Hongbin Zhuang, Wenzhong Guo, Xiaoyan Li, Ximeng Liu and Cheng-Kuan
  Lin",The Component Diagnosability of General Networks,"21 pages, 11 figures","International Journal of Foundations of Computer Science, vol. 33,
  no. 01, pp. 67-89, 2022",10.1142/S0129054121500374,,cs.DC cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The processor failures in a multiprocessor system have a negative impact on
its distributed computing efficiency. Because of the rapid expansion of
multiprocessor systems, the importance of fault diagnosis is becoming
increasingly prominent. The $h$-component diagnosability of $G$, denoted by
$ct_{h}(G)$, is the maximum number of nodes of the faulty set $F$ that is
correctly identified in a system, and the number of components in $G-F$ is at
least $h$. In this paper, we determine the $(h+1)$-component diagnosability of
general networks under the PMC model and MM$^{*}$ model. As applications, the
component diagnosability is explored for some well-known networks, including
complete cubic networks, hierarchical cubic networks, generalized exchanged
hypercubes, dual-cube-like networks, hierarchical hypercubes, Cayley graphs
generated by transposition trees (except star graphs), and DQcube as well.
Furthermore, we provide some comparison results between the component
diagnosability and other fault diagnosabilities.
","[{'version': 'v1', 'created': 'Tue, 25 May 2021 13:06:54 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Sep 2022 07:17:13 GMT'}]",2022-09-16,"[['Zhuang', 'Hongbin', ''], ['Guo', 'Wenzhong', ''], ['Li', 'Xiaoyan', ''], ['Liu', 'Ximeng', ''], ['Lin', 'Cheng-Kuan', '']]","['Fault diagnosis', 'Component diagnosability', 'PMC model', 'MM∗ model', 'General networks']"
519,1111.2399,Kishorjit Nongmeikapam Mr.,Kishorjit Nongmeikapam and Sivaji Bandyopadhyay,"Genetic Algorithm (GA) in Feature Selection for CRF Based Manipuri
  Multiword Expression (MWE) Identification","14 pages, 6 figures, see
  http://airccse.org/journal/jcsit/1011csit05.pdf","International Journal of Computer Science & Information Technology
  (IJCSIT) Vol 3, No 5, Oct 2011, pp 53-66",10.5121/ijcsit.2011.3505,,cs.CL cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with the identification of Multiword Expressions (MWEs) in
Manipuri, a highly agglutinative Indian Language. Manipuri is listed in the
Eight Schedule of Indian Constitution. MWE plays an important role in the
applications of Natural Language Processing(NLP) like Machine Translation, Part
of Speech tagging, Information Retrieval, Question Answering etc. Feature
selection is an important factor in the recognition of Manipuri MWEs using
Conditional Random Field (CRF). The disadvantage of manual selection and
choosing of the appropriate features for running CRF motivates us to think of
Genetic Algorithm (GA). Using GA we are able to find the optimal features to
run the CRF. We have tried with fifty generations in feature selection along
with three fold cross validation as fitness function. This model demonstrated
the Recall (R) of 64.08%, Precision (P) of 86.84% and F-measure (F) of 73.74%,
showing an improvement over the CRF based Manipuri MWE identification without
GA application.
","[{'version': 'v1', 'created': 'Thu, 10 Nov 2011 06:08:12 GMT'}]",2012-03-30,"[['Nongmeikapam', 'Kishorjit', ''], ['Bandyopadhyay', 'Sivaji', '']]","['CRF', 'MWE', 'Manipuri', 'GA', 'Features']"
520,1705.00545,Diego Amancio Dr.,"Vanessa Q. Marinho, Graeme Hirst, Diego R. Amancio",Labelled network subgraphs reveal stylistic subtleties in written texts,"To appear in Journal of Complex Networks (JCN cnx047). The paper is
  available at https://tinyurl.com/y922r6pw",,10.1093/comnet/cnx047,,cs.CL physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The vast amount of data and increase of computational capacity have allowed
the analysis of texts from several perspectives, including the representation
of texts as complex networks. Nodes of the network represent the words, and
edges represent some relationship, usually word co-occurrence. Even though
networked representations have been applied to study some tasks, such
approaches are not usually combined with traditional models relying upon
statistical paradigms. Because networked models are able to grasp textual
patterns, we devised a hybrid classifier, called labelled subgraphs, that
combines the frequency of common words with small structures found in the
topology of the network, known as motifs. Our approach is illustrated in two
contexts, authorship attribution and translationese identification. In the
former, a set of novels written by different authors is analyzed. To identify
translationese, texts from the Canadian Hansard and the European parliament
were classified as to original and translated instances. Our results suggest
that labelled subgraphs are able to represent texts and it should be further
explored in other tasks, such as the analysis of text complexity, language
proficiency, and machine translation.
","[{'version': 'v1', 'created': 'Mon, 1 May 2017 14:36:21 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Nov 2017 17:09:50 GMT'}, {'version': 'v3', 'created': 'Wed, 8 Nov 2017 02:16:49 GMT'}]",2017-11-09,"[['Marinho', 'Vanessa Q.', ''], ['Hirst', 'Graeme', ''], ['Amancio', 'Diego R.', '']]","['Complex networks', 'motifs', 'natural language processing', 'authorship attribution', 'translationese', 'labelled motifs']"
521,1711.07045,Anh Nguyen Duc,"Anh Nguven Duc, Yngve Dahle, Martin Steinert, Pekka Abrahamsson","Towards understanding startup product development as effectual
  entrepreneurial behaviors","This is the author's version of the work. Copyright owner's version
  can be accessed at https://doi.org/10.1007/978-3-319-69191-6_15, 8th ICSOB
  2017, Essen, Germany",,10.1007/978-3-319-69191-6_15,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software startups face with multiple technical and business challenges, which
could make the startup journey longer, or even become a failure. Little is
known about entrepreneurial decision making as a direct force to startup
development outcome. In this study, we attempted to apply a behaviour theory of
entrepreneurial firms to understand the root-cause of some software startup s
challenges. Six common challenges related to prototyping and product
development in twenty software startups were identified. We found the behaviour
theory as a useful theoretical lens to explain the technical challenges.
Software startups search for local optimal solutions, emphasise on short-run
feedback rather than long-run strategies, which results in vague prototype
planning, paradox of demonstration and evolving throw-away prototypes. The
finding implies that effectual entrepreneurial processes might require a more
suitable product development approach than the current state-of-practice.
","[{'version': 'v1', 'created': 'Sun, 19 Nov 2017 16:31:58 GMT'}, {'version': 'v2', 'created': 'Sun, 3 Dec 2017 10:50:34 GMT'}]",2017-12-05,"[['Duc', 'Anh Nguven', ''], ['Dahle', 'Yngve', ''], ['Steinert', 'Martin', ''], ['Abrahamsson', 'Pekka', '']]","['effectuation', 'entrepreneurial behavior theory', 'software']"
522,1601.06971,Vishal Kharde,"Vishal.A.Kharde, Prof. Sheetal.Sonawane",Sentiment Analysis of Twitter Data: A Survey of Techniques,"7 figures, 10 tables","International Journal of Computer Applications 139(11): 5-15,
  April 2016",10.5120/ijca2016908625,,cs.CL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  With the advancement of web technology and its growth, there is a huge volume
of data present in the web for internet users and a lot of data is generated
too. Internet has become a platform for online learning, exchanging ideas and
sharing opinions. Social networking sites like Twitter, Facebook, Google+ are
rapidly gaining popularity as they allow people to share and express their
views about topics,have discussion with different communities, or post messages
across the world. There has been lot of work in the field of sentiment analysis
of twitter data. This survey focuses mainly on sentiment analysis of twitter
data which is helpful to analyze the information in the tweets where opinions
are highly unstructured, heterogeneous and are either positive or negative, or
neutral in some cases. In this paper, we provide a survey and a comparative
analyses of existing techniques for opinion mining like machine learning and
lexicon-based approaches, together with evaluation metrics. Using various
machine learning algorithms like Naive Bayes, Max Entropy, and Support Vector
Machine, we provide a research on twitter data streams.General challenges and
applications of Sentiment Analysis on Twitter are also discussed in this paper.
","[{'version': 'v1', 'created': 'Tue, 26 Jan 2016 10:44:30 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Feb 2016 04:53:56 GMT'}, {'version': 'v3', 'created': 'Fri, 22 Apr 2016 09:43:11 GMT'}]",2016-11-04,"[['Kharde', 'Vishal. A.', ''], ['Sonawane', 'Prof. Sheetal.', '']]","['Twitter', 'Sentiment analysis (SA)', 'Opinion mining', 'Machine learning', 'Naive Bayes (NB)', 'Maximum Entropy', 'Support Vector Machine (SVM)']"
523,1902.00491,Vaibhav B Sinha,"Vaibhav B Sinha, Sneha Kudugunta, Adepu Ravi Sankar, Surya Teja
  Chavali, Purushottam Kar, Vineeth N Balasubramanian",DANTE: Deep AlterNations for Training nEural networks,19 pages,Neural Networks 131 (2020) 127-143,10.1016/j.neunet.2020.07.026,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We present DANTE, a novel method for training neural networks using the
alternating minimization principle. DANTE provides an alternate perspective to
traditional gradient-based backpropagation techniques commonly used to train
deep networks. It utilizes an adaptation of quasi-convexity to cast training a
neural network as a bi-quasi-convex optimization problem. We show that for
neural network configurations with both differentiable (e.g. sigmoid) and
non-differentiable (e.g. ReLU) activation functions, we can perform the
alternations effectively in this formulation. DANTE can also be extended to
networks with multiple hidden layers. In experiments on standard datasets,
neural networks trained using the proposed method were found to be promising
and competitive to traditional backpropagation techniques, both in terms of
quality of the solution, as well as training speed.
","[{'version': 'v1', 'created': 'Fri, 1 Feb 2019 18:30:22 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Dec 2019 20:57:06 GMT'}, {'version': 'v3', 'created': 'Sun, 9 Aug 2020 21:26:21 GMT'}]",2020-08-11,"[['Sinha', 'Vaibhav B', ''], ['Kudugunta', 'Sneha', ''], ['Sankar', 'Adepu Ravi', ''], ['Chavali', 'Surya Teja', ''], ['Kar', 'Purushottam', ''], ['Balasubramanian', 'Vineeth N', '']]","['Neural nets', 'Deep Learning', 'Backpropagation', 'Machine Learning']"
524,1808.01703,Kira Adaricheva V,"Oren Segal, Justin Cabot-Miller, Kira Adaricheva, J.B.Nation, Anuar
  Sharafudinov",The Bases of Association Rules of High Confidence,"Presented at DTMN, Sydney, Australia, July 28, 2018","David C.Wyld et al. (Eds) : CSITY, DTMN, NWCOM, SIGPRO - 2018, pp.
  39-51, 2018",10.5121/csit.2018.81104,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop a new approach for distributed computing of the association rules
of high confidence in a binary table. It is derived from the D-basis algorithm
in K. Adaricheva and J.B. Nation (TCS 2017), which is performed on multiple
sub-tables of a table given by removing several rows at a time. The set of
rules is then aggregated using the same approach as the D-basis is retrieved
from a larger set of implications. This allows to obtain a basis of association
rules of high confidence, which can be used for ranking all attributes of the
table with respect to a given fixed attribute using the relevance parameter
introduced in K. Adaricheva et al. (Proceedings of ICFCA-2015). This paper
focuses on the technical implementation of the new algorithm. Some testing
results are performed on transaction data and medical data.
","[{'version': 'v1', 'created': 'Mon, 6 Aug 2018 01:01:50 GMT'}]",2018-08-07,"[['Segal', 'Oren', ''], ['Cabot-Miller', 'Justin', ''], ['Adaricheva', 'Kira', ''], ['Nation', 'J. B.', ''], ['Sharafudinov', 'Anuar', '']]","['Association rules', 'implications', 'binary table', 'D-basis', 'parallel computation']"
525,1412.7993,Mostafa Salehi,"Mostafa Salehi, Payam Siyari, Matteo Magnani, Danilo Montesi","Multidimensional epidemic thresholds in diffusion processes over
  interdependent networks",,,10.1016/j.chaos.2014.12.018,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several systems can be modeled as sets of interdependent networks where each
network contains distinct nodes. Diffusion processes like the spreading of a
disease or the propagation of information constitute fundamental phenomena
occurring over such coupled networks. In this paper we propose a new concept of
multidimensional epidemic threshold characterizing diffusion processes over
interdependent networks, allowing different diffusion rates on the different
networks and arbitrary degree distributions. We analytically derive and
numerically illustrate the conditions for multilayer epidemics, i.e., the
appearance of a giant connected component spanning all the networks.
Furthermore, we study the evolution of infection density and diffusion dynamics
with extensive simulation experiments on synthetic and real networks.
","[{'version': 'v1', 'created': 'Fri, 26 Dec 2014 21:31:13 GMT'}]",2015-06-23,"[['Salehi', 'Mostafa', ''], ['Siyari', 'Payam', ''], ['Magnani', 'Matteo', ''], ['Montesi', 'Danilo', '']]","['Multilayer Networks', 'Interdependent Networks', 'Information Diffusion', 'Epidemic']"
526,1903.01123,Corentin Lapeyre,"Corentin J. Lapeyre, Nicolas Cazard, Pamphile T. Roy, Sophie Ricci,
  Fabrice Zaoui",Reconstruction of Hydraulic Data by Machine Learning,Submitted to SimHydro 2019,,10.1007/978-981-15-5436-0_54,,cs.CE physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Numerical simulation models associated with hydraulic engineering take a wide
array of data into account to produce predictions: rainfall contribution to the
drainage basin (characterized by soil nature, infiltration capacity and
moisture), current water height in the river, topography, nature and geometry
of the river bed, etc. This data is tainted with uncertainties related to an
imperfect knowledge of the field, measurement errors on the physical parameters
calibrating the equations of physics, an approximation of the latter, etc.
These uncertainties can lead the model to overestimate or underestimate the
flow and height of the river. Moreover, complex assimilation models often
require numerous evaluations of physical solvers to evaluate these
uncertainties, limiting their use for some real-time operational applications.
In this study, we explore the possibility of building a predictor for river
height at an observation point based on drainage basin time series data. An
array of data-driven techniques is assessed for this task, including
statistical models, machine learning techniques and deep neural network
approaches. These are assessed on several metrics, offering an overview of the
possibilities related to hydraulic time-series. An important finding is that
for the same hydraulic quantity, the best predictors vary depending on whether
the data is produced using a physical model or real observations.
","[{'version': 'v1', 'created': 'Mon, 4 Mar 2019 08:28:15 GMT'}]",2021-03-01,"[['Lapeyre', 'Corentin J.', ''], ['Cazard', 'Nicolas', ''], ['Roy', 'Pamphile T.', ''], ['Ricci', 'Sophie', ''], ['Zaoui', 'Fabrice', '']]","['Data Science', 'Machine Learning', 'Shallow-water equations', 'time series']"
527,1504.04663,Jinxue Zhang,"Jinxue Zhang, Rui Zhang, Jingchao Sun, Yanchao Zhang, Chi Zhang","TrueTop: A Sybil-Resilient System for User Influence Measurement on
  Twitter","Accepted by IEEE/ACM Transactions on Networking. This is the Final
  version",,10.1109/TNET.2015.2494059,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Influential users have great potential for accelerating information
dissemination and acquisition on Twitter. How to measure the influence of
Twitter users has attracted significant academic and industrial attention.
Existing influential measurement techniques, however, are vulnerable to sybil
users that are thriving on Twitter. Although sybil defenses for online social
networks have been extensively investigated, they commonly assume unique
mappings from human-established trust relationships to online social
associations and thus do not apply to Twitter where users can freely follow
each other. This paper presents TrueTop, the first sybil-resilient system to
measure the influence of Twitter users. TrueTop is firmly rooted in two
observations from real Twitter datasets. First, although non-sybil users may
incautiously follow strangers, they tend to be more careful and selective in
retweeting, replying to, and mentioning other Twitter users. Second,
influential users usually get much more retweets, replies, and mentions than
non-influential users. Detailed theoretical studies and synthetic simulations
show that TrueTop can generate very accurate influence measurement results and
also have strong resilience to sybil attacks.
","[{'version': 'v1', 'created': 'Sat, 18 Apr 2015 00:07:10 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Jun 2015 00:35:04 GMT'}, {'version': 'v3', 'created': 'Tue, 20 Oct 2015 22:49:34 GMT'}]",2016-11-17,"[['Zhang', 'Jinxue', ''], ['Zhang', 'Rui', ''], ['Sun', 'Jingchao', ''], ['Zhang', 'Yanchao', ''], ['Zhang', 'Chi', '']]","['Influence measurement', 'social networks', 'Twitter', 'sybil resilience']"
528,1609.01410,M.M.A. Hashem,"Jarin Firose Moon, Shamminuj Aktar and M.M.A. Hashem",Securely Outsourcing Large Scale Eigen Value Problem to Public Cloud,,"Computer and Information Technology (ICCIT), 2015 18th
  International Conference on",10.1109/ICCITechn.2015.7488120,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing enables clients with limited computational power to
economically outsource their large scale computations to a public cloud with
huge computational power. Cloud has the massive storage, computational power
and software which can be used by clients for reducing their computational
overhead and storage limitation. But in case of outsourcing, privacy of
client's confidential data must be maintained. We have designed a protocol for
outsourcing large scale Eigen value problem to a malicious cloud which provides
input/output data security, result verifiability and client's efficiency. As
the direct computation method to find all eigenvectors is computationally
expensive for large dimensionality, we have used power iterative method for
finding the largest Eigen value and the corresponding Eigen vector of a matrix.
For protecting the privacy, some transformations are applied to the input
matrix to get encrypted matrix which is sent to the cloud and then decrypting
the result that is returned from the cloud for getting the correct solution of
Eigen value problem. We have also proposed result verification mechanism for
detecting robust cheating and provided theoretical analysis and experimental
result that describes high-efficiency, correctness, security and robust
cheating resistance of the proposed protocol.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2016 06:33:04 GMT'}]",2016-09-07,"[['Moon', 'Jarin Firose', ''], ['Aktar', 'Shamminuj', ''], ['Hashem', 'M. M. A.', '']]","['cloud computing', 'computation outsourcing', 'data security', 'Paillier cryptosystem', 'Eigen value problem', 'power method']"
529,1311.0402,Yu-Hang Tang,Yu-Hang Tang and George Em Karniadakis,"Accelerating Dissipative Particle Dynamics Simulations on GPUs:
  Algorithms, Numerics and Applications",,"Computer Physics Communications, 2014, 185(11), 2809 - 2822",10.1016/j.cpc.2014.06.015,,cs.DC physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a scalable dissipative particle dynamics simulation code, fully
implemented on the Graphics Processing Units (GPUs) using a hybrid CUDA/MPI
programming model, which achieves 10-30 times speedup on a single GPU over 16
CPU cores and almost linear weak scaling across a thousand nodes. A unified
framework is developed within which the efficient generation of the neighbor
list and maintaining particle data locality are addressed. Our algorithm
generates strictly ordered neighbor lists in parallel, while the construction
is deterministic and makes no use of atomic operations or sorting. Such
neighbor list leads to optimal data loading efficiency when combined with a
two-level particle reordering scheme. A faster in situ generation scheme for
Gaussian random numbers is proposed using precomputed binary signatures. We
designed custom transcendental functions that are fast and accurate for
evaluating the pairwise interaction. The correctness and accuracy of the code
is verified through a set of test cases simulating Poiseuille flow and
spontaneous vesicle formation. Computer benchmarks demonstrate the speedup of
our implementation over the CPU implementation as well as strong and weak
scalability. A large-scale simulation of spontaneous vesicle formation
consisting of 128 million particles was conducted to further illustrate the
practicality of our code in real-world applications.
","[{'version': 'v1', 'created': 'Sat, 2 Nov 2013 18:51:53 GMT'}]",2014-12-01,"[['Tang', 'Yu-Hang', ''], ['Karniadakis', 'George Em', '']]","['DPD', 'CUDA', 'LAMMPS', 'spontaneous vesicle formation']"
530,1703.08247,Brendan Fong,"Brendan Fong, Fabio Zanasi",A Universal Construction for (Co)Relations,"15 pages + 4 page appendix, CALCO 2017",,10.4230/LIPIcs.CALCO.2017.12,,cs.LO math.CT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Calculi of string diagrams are increasingly used to present the syntax and
algebraic structure of various families of circuits, including signal flow
graphs, electrical circuits and quantum processes. In many such approaches, the
semantic interpretation for diagrams is given in terms of relations or
corelations (generalised equivalence relations) of some kind. In this paper we
show how semantic categories of both relations and corelations can be
characterised as colimits of simpler categories. This modular perspective is
important as it simplifies the task of giving a complete axiomatisation for
semantic equivalence of string diagrams. Moreover, our general result unifies
various theorems that are independently found in literature, including the
cases of linear corelations (relevant for the semantics of electrical
circuits), of partial equivalence relations and of linear subspaces (semantics
of signal flow graphs and of the phase-free ZX calculus).
","[{'version': 'v1', 'created': 'Thu, 23 Mar 2017 22:34:33 GMT'}, {'version': 'v2', 'created': 'Fri, 26 May 2017 20:59:35 GMT'}]",2017-05-30,"[['Fong', 'Brendan', ''], ['Zanasi', 'Fabio', '']]","['corelation', 'prop', 'string diagram']"
531,1908.08581,Carsten Eickhoff,"Carsten Eickhoff and Floran Gmehlin and Anu V. Patel and Jocelyn
  Boullier and Hamish Fraser","DC3 -- A Diagnostic Case Challenge Collection for Clinical Decision
  Support",,"The 2019 ACM SIGIR International Conference on the Theory of
  Information Retrieval (ICTIR '19)",10.1145/3341981.3344239,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In clinical care, obtaining a correct diagnosis is the first step towards
successful treatment and, ultimately, recovery. Depending on the complexity of
the case, the diagnostic phase can be lengthy and ridden with errors and
delays. Such errors have a high likelihood to cause patients severe harm or
even lead to their death and are estimated to cost the U.S. healthcare system
several hundred billion dollars each year.
  To avoid diagnostic errors, physicians increasingly rely on diagnostic
decision support systems drawing from heuristics, historic cases, textbooks,
clinical guidelines and scholarly biomedical literature. The evaluation of such
systems, however, is often conducted in an ad-hoc fashion, using
non-transparent methodology, and proprietary data.
  This paper presents DC3, a collection of 31 extremely difficult diagnostic
case challenges, manually compiled and solved by clinical experts. For each
case, we present a number of temporally ordered physician-generated
observations alongside the eventually confirmed true diagnosis. We additionally
provide inferred dense relevance judgments for these cases among the PubMed
collection of 27 million scholarly biomedical articles.
","[{'version': 'v1', 'created': 'Thu, 22 Aug 2019 20:20:22 GMT'}]",2019-08-26,"[['Eickhoff', 'Carsten', ''], ['Gmehlin', 'Floran', ''], ['Patel', 'Anu V.', ''], ['Boullier', 'Jocelyn', ''], ['Fraser', 'Hamish', '']]","['Diagnostics', 'Rare Diseases', 'Corpus', 'Dataset']"
532,1806.09617,Stephen Sinclair,Stephen Sinclair,"Sounderfeit: Cloning a Physical Model using a Conditional Adversarial
  Autoencoder","Extended conference paper published as article in Brazilian
  open-access journal Musica Hodie. 17 pages, 10 figures. ISSN 1676-3939.
  Dispon\'ivel em: https://www.revistas.ufg.br/musica/article/view/53570. arXiv
  admin note: substantial text overlap with arXiv:1802.08008","Revista M\'usica Hodie, [S.l.], v. 18, n. 1, p. 44 - 60, jun. 2018",10.5216/mh.v18i1.53570,,cs.SD cs.LG cs.NE eess.AS,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  An adversarial autoencoder conditioned on known parameters of a physical
modeling bowed string synthesizer is evaluated for use in parameter estimation
and resynthesis tasks. Latent dimensions are provided to capture variance not
explained by the conditional parameters. Results are compared with and without
the adversarial training, and a system capable of ""copying"" a given
parameter-signal bidirectional relationship is examined. A real-time synthesis
system built on a generative, conditioned and regularized neural network is
presented, allowing to construct engaging sound synthesizers based purely on
recorded data.
","[{'version': 'v1', 'created': 'Mon, 25 Jun 2018 14:21:37 GMT'}]",2018-06-27,"[['Sinclair', 'Stephen', '']]","['Physical modeling', 'sound synthesis', 'autoencoder', 'latent parameter space']"
533,1009.1013,M. Emre Celebi,"M. Emre Celebi, Hitoshi Iyatomi, William V. Stoecker, Randy H. Moss,
  Harold S. Rabinovitz, Giuseppe Argenziano, H. Peter Soyer","Automatic Detection of Blue-White Veil and Related Structures in
  Dermoscopy Images",,Computerized Medical Imaging and Graphics 32 (2008) 670-677,10.1016/j.compmedimag.2008.08.003,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dermoscopy is a non-invasive skin imaging technique, which permits
visualization of features of pigmented melanocytic neoplasms that are not
discernable by examination with the naked eye. One of the most important
features for the diagnosis of melanoma in dermoscopy images is the blue-white
veil (irregular, structureless areas of confluent blue pigmentation with an
overlying white ""ground-glass"" film). In this article, we present a machine
learning approach to the detection of blue-white veil and related structures in
dermoscopy images. The method involves contextual pixel classification using a
decision tree classifier. The percentage of blue-white areas detected in a
lesion combined with a simple shape descriptor yielded a sensitivity of 69.35%
and a specificity of 89.97% on a set of 545 dermoscopy images. The sensitivity
rises to 78.20% for detection of blue veil in those cases where it is a primary
feature for melanoma recognition.
","[{'version': 'v1', 'created': 'Mon, 6 Sep 2010 10:29:18 GMT'}]",2011-11-10,"[['Celebi', 'M. Emre', ''], ['Iyatomi', 'Hitoshi', ''], ['Stoecker', 'William V.', ''], ['Moss', 'Randy H.', ''], ['Rabinovitz', 'Harold S.', ''], ['Argenziano', 'Giuseppe', ''], ['Soyer', 'H. Peter', '']]","['Melanoma', 'dermoscopy', 'blue-white veil', 'contextual pixel classification', 'decision tree classifier']"
534,2105.04244,Timm Haucke,"Timm Haucke, Hjalmar S. K\""uhl, Jacqueline Hoyer, Volker Steinhage","Overcoming the Distance Estimation Bottleneck in Estimating Animal
  Abundance with Camera Traps",,"Ecological Informatics, Volume 68, May 2022, 101536",10.1016/j.ecoinf.2021.101536,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The biodiversity crisis is still accelerating, despite increasing efforts by
the international community. Estimating animal abundance is of critical
importance to assess, for example, the consequences of land-use change and
invasive species on community composition, or the effectiveness of conservation
interventions. Various approaches have been developed to estimate abundance of
unmarked animal populations. Whereas these approaches differ in methodological
details, they all require the estimation of the effective area surveyed in
front of a camera trap. Until now camera-to-animal distance measurements are
derived by laborious, manual and subjective estimation methods. To overcome
this distance estimation bottleneck, this study proposes an automatized
pipeline utilizing monocular depth estimation and depth image calibration
methods. We are able to reduce the manual effort required by a factor greater
than 21 and provide our system at
https://timm.haucke.xyz/publications/distance-estimation-animal-abundance
","[{'version': 'v1', 'created': 'Mon, 10 May 2021 10:17:34 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Dec 2021 10:27:39 GMT'}]",2021-12-23,"[['Haucke', 'Timm', ''], ['Kühl', 'Hjalmar S.', ''], ['Hoyer', 'Jacqueline', ''], ['Steinhage', 'Volker', '']]","['Animal density', 'animal abundance', 'camera trapping', 'unmarkedanimal populations', 'automated distance estimation']"
535,1406.6218,Uwe Fechner,"Uwe Fechner, Rolf van der Vlugt, Edwin Schreuder, Roland Schmehl",Dynamic Model of a Pumping Kite Power System,"13 pages, 8 figures. This revision was accepted by the journal
  ""Renewable Energy"" and takes the comments of the reviewers into account. The
  abstract and the conclusions state more carefully the advantages of the
  suggested models. In addition, the wording of the results section was
  improved. Finally, the changes from passive to active voice of the last
  revision were reverted",,10.1016/j.renene.2015.04.028,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Converting the traction power of kites into electricity can be a low cost
solution for wind energy. Reliable control of both trajectory and tether
reeling is crucial. The present study proposes a modelling framework describing
the dynamic behaviour of the interconnected system components, suitable for
design and optimization of the control systems. The wing, bridle, airborne
control unit and tether are represented as a particle system using
spring-damper elements to describe their mechanical properties. Two kite models
are proposed: a point mass model and a four point model. Reeling of the tether
is modelled by varying the lengths of constituent tether elements. Dynamic
behaviour of the ground station is included. The framework is validated by
combining it with the automatic control system used for the operation of a kite
power system demonstrator. The simulation results show that the point mass
model can be adjusted to match the measured behaviour during a pumping cycle.
The four point model can better predict the influence of gravity and inertia on
the steering response and remains stable also at low tether forces. Compared to
simple one point models, the proposed framework is more accurate and robust
while allowing real-time simulations of the complete system.
","[{'version': 'v1', 'created': 'Tue, 24 Jun 2014 12:44:39 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Dec 2014 12:07:18 GMT'}, {'version': 'v3', 'created': 'Thu, 23 Apr 2015 14:42:19 GMT'}]",2017-05-11,"[['Fechner', 'Uwe', ''], ['van der Vlugt', 'Rolf', ''], ['Schreuder', 'Edwin', ''], ['Schmehl', 'Roland', '']]","['kite power', 'airborne wind energy', 'kite power system model', 'kite model', 'tether model', 'kite control']"
536,1701.04516,Chandan Gautam,"Chandan Gautam, Aruna Tiwari and Qian Leng","On The Construction of Extreme Learning Machine for Online and Offline
  One-Class Classification - An Expanded Toolbox","This paper has been accepted in Neurocomputing Journal (Elsevier)
  with Manuscript id: NEUCOM-D-15-02856",,10.1016/j.neucom.2016.04.070,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One-Class Classification (OCC) has been prime concern for researchers and
effectively employed in various disciplines. But, traditional methods based
one-class classifiers are very time consuming due to its iterative process and
various parameters tuning. In this paper, we present six OCC methods based on
extreme learning machine (ELM) and Online Sequential ELM (OSELM). Our proposed
classifiers mainly lie in two categories: reconstruction based and boundary
based, which supports both types of learning viz., online and offline learning.
Out of various proposed methods, four are offline and remaining two are online
methods. Out of four offline methods, two methods perform random feature
mapping and two methods perform kernel feature mapping. Kernel feature mapping
based approaches have been tested with RBF kernel and online version of
one-class classifiers are tested with both types of nodes viz., additive and
RBF. It is well known fact that threshold decision is a crucial factor in case
of OCC, so, three different threshold deciding criteria have been employed so
far and analyses the effectiveness of one threshold deciding criteria over
another. Further, these methods are tested on two artificial datasets to check
there boundary construction capability and on eight benchmark datasets from
different discipline to evaluate the performance of the classifiers. Our
proposed classifiers exhibit better performance compared to ten traditional
one-class classifiers and ELM based two one-class classifiers. Through proposed
one-class classifiers, we intend to expand the functionality of the most used
toolbox for OCC i.e. DD toolbox. All of our methods are totally compatible with
all the present features of the toolbox.
","[{'version': 'v1', 'created': 'Tue, 17 Jan 2017 02:55:51 GMT'}]",2017-02-16,"[['Gautam', 'Chandan', ''], ['Tiwari', 'Aruna', ''], ['Leng', 'Qian', '']]","['One-class classification (OCC)', 'Extreme Learning Machine (ELM)', 'Online Sequential ELM (OSELM)', 'One-Class ELM (OCELM)', 'Autoassociative ELM (AAELM)']"
537,2102.11678,Matej Madeja,"Matej Madeja, Jaroslav Porub\""an, Michaela Ba\v{c}\'ikov\'a,
  Mat\'u\v{s} Sul\'ir, J\'an Juh\'ar, Sergej Chodarev, Filip Gurb\'a\v{l}","Automating Test Case Identification in Java Open Source Projects on
  GitHub","30 pages, accepted in Computing and Informatics Journal -
  http://www.cai.sk, ISSN 2585-8807",Computing and Informatics 40 (2021) 575-605,10.31577/cai_2021_3_575,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software testing is one of the very important Quality Assurance (QA)
components. A lot of researchers deal with the testing process in terms of
tester motivation and how tests should or should not be written. However, it is
not known from the recommendations how the tests are written in real projects.
In this paper, the following was investigated: (i) the denotation of the word
""test"" in different natural languages; (ii) whether the number of occurrences
of the word ""test"" correlates with the number of test cases; and (iii) what
testing frameworks are mostly used. The analysis was performed on 38 GitHub
open source repositories thoroughly selected from the set of 4.3M GitHub
projects. We analyzed 20,340 test cases in 803 classes manually and 170k
classes using an automated approach. The results show that: (i) there exists a
weak correlation (r = 0.655) between the number of occurrences of the word
""test"" and the number of test cases in a class; (ii) the proposed algorithm
using static file analysis correctly detected 97% of test cases; (iii) 15% of
the analyzed classes used main() function whose represent regular Java programs
that test the production code without using any third-party framework. The
identification of such tests is very complex due to implementation diversity.
The results may be leveraged to more quickly identify and locate test cases in
a repository, to understand practices in customized testing solutions, and to
mine tests to improve program comprehension in the future.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2021 13:08:50 GMT'}, {'version': 'v2', 'created': 'Fri, 30 Jul 2021 07:47:23 GMT'}]",2022-01-04,"[['Madeja', 'Matej', ''], ['Porubän', 'Jaroslav', ''], ['Bačíková', 'Michaela', ''], ['Sulír', 'Matúš', ''], ['Juhár', 'Ján', ''], ['Chodarev', 'Sergej', ''], ['Gurbáľ', 'Filip', '']]","['Program comprehension', 'Java testing', 'testing practices', 'test smells', 'open-source projects', 'GitHub']"
538,1212.3425,Andrew Adamatzky,"Victor Erokhin, Gerard David Howard, Andrew Adamatzky",Organic Memristor Devices for Logic Elements with Memory,,Int J Bifurcation Chaos 22 (2012) 1250283,10.1142/S0218127412502835,,cs.ET physics.chem-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Memristors are promising next-generation memory candidates that are
nonvolatile, possess low power requirements and are capable of nanoscale
fabrication. In this article we physically realise and describe the use of
organic memristors in designing statefull boolean logic gates for the AND OR
and NOT operations. The output of these gates is analog and dependent on the
length of time that suitable charge is applied to the inputs, displaying a
learning property. Results may be also interpreted in a traditional binary
manner through use of a suitable thresholding function at the output. The
memristive property of the gate allows the for the production of analog outputs
that vary based on the charge-dependent nonvolatile state of the memristor. We
provide experimental results of physical fabrication of three types of logic
gate. A simulation of a one-bit full adder comprised of memristive logic gates
is also included, displaying varying response to two distinct input patterns.
","[{'version': 'v1', 'created': 'Fri, 14 Dec 2012 09:59:35 GMT'}]",2012-12-17,"[['Erokhin', 'Victor', ''], ['Howard', 'Gerard David', ''], ['Adamatzky', 'Andrew', '']]","['Organic Memristor', 'Learning', 'Hardware', 'Logic gates', 'Analoglogic']"
539,1403.0734,Emanuele Guido Fusco,"Irene Finocchi, Marco Finocchi, Emanuele G. Fusco",Clique counting in MapReduce: theory and experiments,,ACM Journal of Experimental Algorithmics 20: 1.7:1-1.7:20 (2015),10.1145/2794080,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We tackle the problem of counting the number of $k$-cliques in large-scale
graphs, for any constant $k \ge 3$. Clique counting is essential in a variety
of applications, among which social network analysis. Due to its
computationally intensive nature, we settle for parallel solutions in the
MapReduce framework, which has become in the last few years a {\em de facto}
standard for batch processing of massive data sets. We give both theoretical
and experimental contributions.
  On the theory side, we design the first exact scalable algorithm for counting
(and listing) $k$-cliques. Our algorithm uses $O(m^{3/2})$ total space and
$O(m^{k/2})$ work, where $m$ is the number of graph edges. This matches the
best-known bounds for triangle listing when $k=3$ and is work-optimal in the
worst case for any $k$, while keeping the communication cost independent of
$k$. We also design a sampling-based estimator that can dramatically reduce the
running time and space requirements of the exact approach, while providing very
accurate solutions with high probability.
  We then assess the effectiveness of different clique counting approaches
through an extensive experimental analysis over the Amazon EC2 platform,
considering both our algorithms and their state-of-the-art competitors. The
experimental results clearly highlight the algorithm of choice in different
scenarios and prove our exact approach to be the most effective when the number
of $k$-cliques is large, gracefully scaling to non-trivial values of $k$ even
on clusters of small/medium size. Our approximation algorithm achieves
extremely accurate estimates and large speedups, especially on the toughest
instances for the exact algorithms. As a side effect, our study also sheds
light on the number of $k$-cliques of several real-world graphs, mainly social
networks, and on its growth rate as a function of $k$.
","[{'version': 'v1', 'created': 'Tue, 4 Mar 2014 10:36:35 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Jul 2014 15:38:22 GMT'}]",2018-04-13,"[['Finocchi', 'Irene', ''], ['Finocchi', 'Marco', ''], ['Fusco', 'Emanuele G.', '']]","['Clique listing', 'graph algorithms', 'MapReduce', 'parallel algorithms', 'experimental algorithmics']"
540,1508.07951,Fabi\'an Riquelme,Fabi\'an Riquelme and Pablo Gonz\'alez-Cantergiani,Measuring user influence on Twitter: A survey,"33 pages, 3 tables, 3 figures, Information Processing & Management
  (2016)",,10.1016/j.ipm.2016.04.003,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Centrality is one of the most studied concepts in social network analysis.
There is a huge literature regarding centrality measures, as ways to identify
the most relevant users in a social network. The challenge is to find measures
that can be computed efficiently, and that can be able to classify the users
according to relevance criteria as close as possible to reality. We address
this problem in the context of the Twitter network, an online social networking
service with millions of users and an impressive flow of messages that are
published and spread daily by interactions between users. Twitter has different
types of users, but the greatest utility lies in finding the most influential
ones. The purpose of this article is to collect and classify the different
Twitter influence measures that exist so far in literature. These measures are
very diverse. Some are based on simple metrics provided by the Twitter API,
while others are based on complex mathematical models. Several measures are
based on the PageRank algorithm, traditionally used to rank the websites on the
Internet. Some others consider the timeline of publication, others the content
of the messages, some are focused on specific topics, and others try to make
predictions. We consider all these aspects, and some additional ones.
Furthermore, we include measures of activity and popularity, the traditional
mechanisms to correlate measures, and some important aspects of computational
complexity for this particular context.
","[{'version': 'v1', 'created': 'Mon, 31 Aug 2015 18:38:17 GMT'}, {'version': 'v2', 'created': 'Sun, 24 Apr 2016 14:17:29 GMT'}]",2016-04-26,"[['Riquelme', 'Fabián', ''], ['González-Cantergiani', 'Pablo', '']]","['Twitter', 'User influence', 'Opinion leaders', 'Centrality measure', 'PageRank']"
541,1903.08597,Volodymyr Miz,"Nicolas Aspert, Volodymyr Miz, Benjamin Ricaud, Pierre Vandergheynst",A Graph-structured Dataset for Wikipedia Research,,,10.1145/3308560.3316757,,cs.IR cs.LG cs.SI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Wikipedia is a rich and invaluable source of information. Its central place
on the Web makes it a particularly interesting object of study for scientists.
Researchers from different domains used various complex datasets related to
Wikipedia to study language, social behavior, knowledge organization, and
network theory. While being a scientific treasure, the large size of the
dataset hinders pre-processing and may be a challenging obstacle for potential
new studies. This issue is particularly acute in scientific domains where
researchers may not be technically and data processing savvy. On one hand, the
size of Wikipedia dumps is large. It makes the parsing and extraction of
relevant information cumbersome. On the other hand, the API is straightforward
to use but restricted to a relatively small number of requests. The middle
ground is at the mesoscopic scale when researchers need a subset of Wikipedia
ranging from thousands to hundreds of thousands of pages but there exists no
efficient solution at this scale.
  In this work, we propose an efficient data structure to make requests and
access subnetworks of Wikipedia pages and categories. We provide convenient
tools for accessing and filtering viewership statistics or ""pagecounts"" of
Wikipedia web pages. The dataset organization leverages principles of graph
databases that allows rapid and intuitive access to subgraphs of Wikipedia
articles and categories. The dataset and deployment guidelines are available on
the LTS2 website \url{https://lts2.epfl.ch/Datasets/Wikipedia/}.
","[{'version': 'v1', 'created': 'Wed, 20 Mar 2019 16:31:29 GMT'}]",2019-03-21,"[['Aspert', 'Nicolas', ''], ['Miz', 'Volodymyr', ''], ['Ricaud', 'Benjamin', ''], ['Vandergheynst', 'Pierre', '']]","['Dataset', 'Graph', 'Wikipedia', 'Temporal Network', 'Web Logs']"
542,1005.5525,Daniel Karapetyan Dr,Daniel Karapetyan and Gregory Gutin,"Efficient Local Search Algorithms for Known and New Neighborhoods for
  the Generalized Traveling Salesman Problem",29 pages,European Journal of Operational Research 219 (2012) 234-251,10.1016/j.ejor.2012.01.011,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Generalized Traveling Salesman Problem (GTSP) is a well-known
combinatorial optimization problem with a host of applications. It is an
extension of the Traveling Salesman Problem (TSP) where the set of cities is
partitioned into so-called clusters, and the salesman has to visit every
cluster exactly once.
  While the GTSP is a very important combinatorial optimization problem and is
well studied in many aspects, the local search algorithms used in the
literature are mostly basic adaptations of simple TSP heuristics. Hence, a
thorough and deep research of the neighborhoods and local search algorithms
specific to the GTSP is required.
  We formalize the procedure of adaptation of a TSP neighborhood for the GTSP
and classify all other existing and some new GTSP neighborhoods. For every
neighborhood, we provide efficient exploration algorithms that are often
significantly faster than the ones known from the literature. Finally, we
compare different local search implementations empirically.
","[{'version': 'v1', 'created': 'Sun, 30 May 2010 13:13:09 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Feb 2011 18:54:22 GMT'}, {'version': 'v3', 'created': 'Mon, 7 Nov 2011 02:36:49 GMT'}, {'version': 'v4', 'created': 'Mon, 13 Feb 2012 22:54:43 GMT'}]",2012-02-15,"[['Karapetyan', 'Daniel', ''], ['Gutin', 'Gregory', '']]","['Heuristics', 'Local Search', 'Neighborhood', 'Generalized Traveling Salesman Problem', 'Combinatorial Optimization']"
543,1408.0391,"Matthias W\""ahlisch","Matthias W\""ahlisch and Robert Schmidt and Thomas C. Schmidt and Olaf
  Maennel and Steve Uhlig and Gareth Tyson",RiPKI: The Tragic Story of RPKI Deployment in the Web Ecosystem,"Previous arXiv version of this paper has been published under the
  title ""When BGP Security Meets Content Deployment: Measuring and Analysing
  RPKI-Protection of Websites"", Proc. of Fourteenth ACM Workshop on Hot Topics
  in Networks (HotNets), New York:ACM, 2015",,10.1145/2834050.2834102,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web content delivery is one of the most important services on the Internet.
Access to websites is typically secured via TLS. However, this security model
does not account for prefix hijacking on the network layer, which may lead to
traffic blackholing or transparent interception. Thus, to achieve comprehensive
security and service availability, additional protective mechanisms are
necessary such as the RPKI, a recently deployed Resource Public Key
Infrastructure to prevent hijacking of traffic by networks. This paper argues
two positions. First, that modern web hosting practices make route protection
challenging due to the propensity to spread servers across many different
networks, often with unpredictable client redirection strategies, and, second,
that we need a better understanding why protection mechanisms are not deployed.
To initiate this, we empirically explore the relationship between web hosting
infrastructure and RPKI deployment. Perversely, we find that less popular
websites are more likely to be secured than the prominent sites. Worryingly, we
find many large-scale CDNs do not support RPKI, thus making their customers
vulnerable. This leads us to explore business reasons why operators are
hesitant to deploy RPKI, which may help to guide future research on improving
Internet security.
","[{'version': 'v1', 'created': 'Sat, 2 Aug 2014 16:12:43 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Aug 2015 11:43:41 GMT'}, {'version': 'v3', 'created': 'Mon, 2 Nov 2015 10:41:33 GMT'}]",2015-11-03,"[['Wählisch', 'Matthias', ''], ['Schmidt', 'Robert', ''], ['Schmidt', 'Thomas C.', ''], ['Maennel', 'Olaf', ''], ['Uhlig', 'Steve', ''], ['Tyson', 'Gareth', '']]","['BGP', 'RPKI', 'secure inter-domain routing', 'deployment', 'hostinginfrastructure', 'CDN']"
544,2102.08444,Matthew Parno,"Matthew Parno, Taylor Hodgdon, Brendan West, Devin O'Connor, Arnold
  Song",A Bayesian Approach for Inferring Sea Ice Loads,,,10.1115/1.4050281,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  The Earth's climate is rapidly changing and some of the most drastic changes
can be seen in the Arctic, where sea ice extent has diminished considerably in
recent years. As the Arctic climate continues to change, gathering in situ sea
ice measurements is increasingly important for understanding the complex
evolution of the Arctic ice pack. To date, observations of ice stresses in the
Arctic have been spatially and temporally sparse. We propose a measurement
framework that would instrument existing sea ice buoys with strain gauges. This
measurement framework uses a Bayesian inference approach to infer ice loads
acting on the buoy from a set of strain gauge measurements. To test our
framework, strain measurements were collected from an experiment where a buoy
was frozen into ice that was subsequently compressed to simulate convergent sea
ice conditions. A linear elastic finite element model was used to describe the
response of the deformable buoy to mechanical loading, allowing us to link the
observed strain on the buoy interior to the applied load on the buoy exterior.
  The approach presented in this paper presents an instrumentation framework
that could use existing buoy platforms as in situ sensors of internal stresses
in the ice pack.
","[{'version': 'v1', 'created': 'Tue, 16 Feb 2021 20:51:45 GMT'}]",2021-04-07,"[['Parno', 'Matthew', ''], ['Hodgdon', 'Taylor', ''], ['West', 'Brendan', ''], [""O'Connor"", 'Devin', ''], ['Song', 'Arnold', '']]","['Sea Ice', 'Stress Measurement', 'Bayesian Inference', 'Model-based Sensing']"
545,1003.3909,Secretary Aircc Journal,"G.F. Ali Ahammed, Reshma Banu",Anakyzing the performance of Active Queue Management Algorithms,"19 Pages, IJCNC Journal 2010",,10.5121/ijcnc.2010.2201,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Congestion is an important issue which researchers focus on in the
Transmission Control Protocol (TCP) network environment. To keep the stability
of the whole network, congestion control algorithms have been extensively
studied. Queue management method employed by the routers is one of the
important issues in the congestion control study. Active queue management (AQM)
has been proposed as a router-based mechanism for early detection of congestion
inside the network. In this paper we analyzed several active queue management
algorithms with respect to their abilities of maintaining high resource
utilization, identifying and restricting disproportionate bandwidth usage, and
their deployment complexity. We compare the performance of FRED, BLUE, SFB, and
CHOKe based on simulation results, using RED and Drop Tail as the evaluation
baseline. The characteristics of different algorithms are also discussed and
compared. Simulation is done by using Network Simulator(NS2) and the graphs are
drawn using X- graph.
","[{'version': 'v1', 'created': 'Sat, 20 Mar 2010 06:20:06 GMT'}]",2010-03-23,"[['Ahammed', 'G. F. Ali', ''], ['Banu', 'Reshma', '']]","['RED; Droptail; Fairness Index; Throughput; AQM; NS2 FRED', 'BLUE', 'SFB', 'CHOKe', 'ECN']"
546,1212.1073,Jinshan Pan,"Jinshan Pan, Risheng Liu, Zhixun Su, Xianfeng Gu",Kernel Estimation from Salient Structure for Robust Motion Deblurring,"This work has been accepted by Signal Processing: Image
  Communication, 2013","Signal Processing: Image Communication, 2013",10.1016/j.image.2013.05.001,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Blind image deblurring algorithms have been improving steadily in the past
years. Most state-of-the-art algorithms, however, still cannot perform
perfectly in challenging cases, especially in large blur setting. In this
paper, we focus on how to estimate a good kernel estimate from a single blurred
image based on the image structure. We found that image details caused by
blurring could adversely affect the kernel estimation, especially when the blur
kernel is large. One effective way to eliminate these details is to apply image
denoising model based on the Total Variation (TV). First, we developed a novel
method for computing image structures based on TV model, such that the
structures undermining the kernel estimation will be removed. Second, to
mitigate the possible adverse effect of salient edges and improve the
robustness of kernel estimation, we applied a gradient selection method. Third,
we proposed a novel kernel estimation method, which is capable of preserving
the continuity and sparsity of the kernel and reducing the noises. Finally, we
developed an adaptive weighted spatial prior, for the purpose of preserving
sharp edges in latent image restoration. The effectiveness of our method is
demonstrated by experiments on various kinds of challenging examples.
","[{'version': 'v1', 'created': 'Wed, 5 Dec 2012 16:02:43 GMT'}, {'version': 'v2', 'created': 'Sat, 24 May 2014 09:11:31 GMT'}]",2014-05-27,"[['Pan', 'Jinshan', ''], ['Liu', 'Risheng', ''], ['Su', 'Zhixun', ''], ['Gu', 'Xianfeng', '']]","['Motion deblurring', 'kernel estimation', 'image restoration', 'salient']"
547,1901.00117,Sai Kiran Narayanaswami,"Sai Kiran Narayanaswami, Nandan Sudarsanam, Balaraman Ravindran",An Active Learning Framework for Efficient Robust Policy Search,"9 pages, 6 figures",,10.1145/3493700.3493712,,cs.LG cs.AI cs.RO stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robust Policy Search is the problem of learning policies that do not degrade
in performance when subject to unseen environment model parameters. It is
particularly relevant for transferring policies learned in a simulation
environment to the real world. Several existing approaches involve sampling
large batches of trajectories which reflect the differences in various possible
environments, and then selecting some subset of these to learn robust policies,
such as the ones that result in the worst performance. We propose an active
learning based framework, EffAcTS, to selectively choose model parameters for
this purpose so as to collect only as much data as necessary to select such a
subset. We apply this framework using Linear Bandits, and experimentally
validate the gains in sample efficiency and the performance of our approach on
standard continuous control tasks. We also present a Multi-Task Learning
perspective to the problem of Robust Policy Search, and draw connections from
our proposed framework to existing work on Multi-Task Learning.
","[{'version': 'v1', 'created': 'Tue, 1 Jan 2019 08:50:47 GMT'}, {'version': 'v2', 'created': 'Sun, 21 Nov 2021 01:02:47 GMT'}]",2021-11-23,"[['Narayanaswami', 'Sai Kiran', ''], ['Sudarsanam', 'Nandan', ''], ['Ravindran', 'Balaraman', '']]","['deep reinforcement learning', 'robust learning', 'active learning', 'robotics']"
548,1304.0090,Mostafa Rahimi Azghadi,"Mostafa Rahimi Azghadi, Said Al-Sarawi, Derek Abbott, Nicolangelo
  Iannella","A Neuromorphic VLSI Design for Spike Timing and Rate Based Synaptic
  Plasticity","Accepted for publication in Neural Networks and is allowed to be
  distributed on Arxiv, according to the journal website at
  http://www.elsevier.com/authors/author-rights-and-responsibilities
  **Voluntary posting of Accepted Author Manuscripts in the arXiv subject
  repository is permitted","Mostafa Rahimi Azghadi, Said Al-Sarawi, Derek Abbott, Nicolangelo
  Iannella, A Neuromorphic VLSI Design for Spike Timing and Rate Based Synaptic
  Plasticity, Neural Networks (2013), 10.1016/j.neunet.2013.03.003",10.1016/j.neunet.2013.03.003,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Triplet-based Spike Timing Dependent Plasticity (TSTDP) is a powerful
synaptic plasticity rule that acts beyond conventional pair-based STDP (PSTDP).
Here, the TSTDP is capable of reproducing the outcomes from a variety of
biological experiments, while the PSTDP rule fails to reproduce them.
Additionally, it has been shown that the behaviour inherent to the spike
rate-based Bienenstock-Cooper-Munro (BCM) synaptic plasticity rule can also
emerge from the TSTDP rule. This paper proposes an analog implementation of the
TSTDP rule. The proposed VLSI circuit has been designed using the AMS 0.35 um
CMOS process and has been simulated using design kits for Synopsys and Cadence
tools. Simulation results demonstrate how well the proposed circuit can alter
synaptic weights according to the timing difference amongst a set of different
patterns of spikes. Furthermore, the circuit is shown to give rise to a
BCM-like learning rule, which is a rate-based rule. To mimic implementation
environment, a 1000 run Monte Carlo (MC) analysis was conducted on the proposed
circuit. The presented MC simulation analysis and the simulation result from
fine-tuned circuits show that, it is possible to mitigate the effect of process
variations in the proof of concept circuit, however, a practical variation
aware design technique is required to promise a high circuit performance in a
large scale neural network. We believe that the proposed design can play a
significant role in future VLSI implementations of both spike timing and rate
based neuromorphic learning systems.
","[{'version': 'v1', 'created': 'Sat, 30 Mar 2013 11:25:35 GMT'}]",2013-04-02,"[['Azghadi', 'Mostafa Rahimi', ''], ['Al-Sarawi', 'Said', ''], ['Abbott', 'Derek', ''], ['Iannella', 'Nicolangelo', '']]","['Synaptic Plasticity', 'Neuromorphic VLSI', 'Spike Timing Dependent Plasticity', 'Rate based Plasticity', 'BCM']"
549,1901.06792,Sunder Ali Khowaja,Sunder Ali Khowaja and Seok-Lyong Lee,Semantic Image Networks for Human Action Recognition,30 pages,International Journal of Computer Vision-2019,10.1007/s11263-019-01248-3,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose the use of a semantic image, an improved
representation for video analysis, principally in combination with Inception
networks. The semantic image is obtained by applying localized sparse
segmentation using global clustering (LSSGC) prior to the approximate rank
pooling which summarizes the motion characteristics in single or multiple
images. It incorporates the background information by overlaying a static
background from the window onto the subsequent segmented frames. The idea is to
improve the action-motion dynamics by focusing on the region which is important
for action recognition and encoding the temporal variances using the frame
ranking method. We also propose the sequential combination of
Inception-ResNetv2 and long-short-term memory network (LSTM) to leverage the
temporal variances for improved recognition performance. Extensive analysis has
been carried out on UCF101 and HMDB51 datasets which are widely used in action
recognition studies. We show that (i) the semantic image generates better
activations and converges faster than its original variant, (ii) using
segmentation prior to approximate rank pooling yields better recognition
performance, (iii) The use of LSTM leverages the temporal variance information
from approximate rank pooling to model the action behavior better than the base
network, (iv) the proposed representations can be adaptive as they can be used
with existing methods such as temporal segment networks to improve the
recognition performance, and (v) our proposed four-stream network architecture
comprising of semantic images and semantic optical flows achieves
state-of-the-art performance, 95.9% and 73.5% recognition accuracy on UCF101
and HMDB51, respectively.
","[{'version': 'v1', 'created': 'Mon, 21 Jan 2019 05:27:24 GMT'}]",2019-10-25,"[['Khowaja', 'Sunder Ali', ''], ['Lee', 'Seok-Lyong', '']]","['Motion representation', 'semantic information', 'convolutional neural networks', 'human action recognition', 'long-short term memory networks', 'frame ranking']"
550,1505.03055,Jaroslaw Jankowski,"Przemyslaw Rozewski, Jaroslaw Jankowski, Piotr Brodka, Radoslaw
  Michalski","Knowledge workers collaborative learning behavior modeling in an
  organizational social network",,"Computers in Human Behavior, 2015, 01",10.1016/j.chb.2014.12.014,,cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computations related to learning processes within an organizational social
network area require some network model preparation and specific algorithms in
order to implement human behaviors in simulated environments. The proposals in
this research model of collaborative learning in an organizational social
network are based on knowledge resource distribution through the establishment
of a knowledge flow. The nodes, which represent knowledge workers, contain
information about workers social and cognitive abilities. Moreover, the workers
are described by their set of competences, their skill level, and the
collaborative learning behavior that can be detected through knowledge flow
analysis. The proposed approach assumes that an increase in workers competence
is a result of collaborative learning. In other words, collaborative learning
can be analyzed as a process of knowledge flow that is being broadcast in a
network. In order to create a more effective organizational social network for
co-learning, the authors found the best strategies for knowledge facilitator,
knowledge collector, and expert roles allocation. Special attention is paid to
the process of knowledge flow in the community of practice. Acceleration within
the community of practice happens when knowledge flows more effectively between
community members. The presented procedure makes it possible to add new ties to
the community of practice in order to influence community members competences.
Both the proposed allocation and acceleration approaches were confirmed through
simulations.
","[{'version': 'v1', 'created': 'Tue, 12 May 2015 15:15:24 GMT'}]",2015-05-13,"[['Rozewski', 'Przemyslaw', ''], ['Jankowski', 'Jaroslaw', ''], ['Brodka', 'Piotr', ''], ['Michalski', 'Radoslaw', '']]","['organizational social network', 'computational models', 'collaborative learning']"
551,1809.06831,Theodoros Chondrogiannis,"Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper, Ulf Leser,
  David B. Blumenthal",Finding k-Dissimilar Paths with Minimum Collective Length,Extended version of the SIGSPATIAL'18 paper under the same title,"26th ACM SIGSPATIAL International Conference on Advances in
  Geographic Information Systems (ACM SIGSPATIAL GIS 2018), Seattle,
  Washington, USA, November 6-9, 2018",10.1145/3274895.3274903,,cs.DS cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Shortest path computation is a fundamental problem in road networks. However,
in many real-world scenarios, determining solely the shortest path is not
enough. In this paper, we study the problem of finding k-Dissimilar Paths with
Minimum Collective Length (kDPwML), which aims at computing a set of paths from
a source s to a target t such that all paths are pairwise dissimilar by at
least \theta and the sum of the path lengths is minimal. We introduce an exact
algorithm for the kDPwML problem, which iterates over all possible s-t paths
while employing two pruning techniques to reduce the prohibitively expensive
computational cost. To achieve scalability, we also define the much smaller set
of the simple single-via paths, and we adapt two algorithms for kDPwML queries
to iterate over this set. Our experimental analysis on real road networks shows
that iterating over all paths is impractical, while iterating over the set of
simple single-via paths can lead to scalable solutions with only a small
trade-off in the quality of the results.
","[{'version': 'v1', 'created': 'Tue, 18 Sep 2018 17:02:55 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Oct 2018 14:20:34 GMT'}]",2018-10-25,"[['Chondrogiannis', 'Theodoros', ''], ['Bouros', 'Panagiotis', ''], ['Gamper', 'Johann', ''], ['Leser', 'Ulf', ''], ['Blumenthal', 'David B.', '']]","['Alternative Routing', 'Route Planning', 'Path Similarity']"
552,1009.0396,Nazim Burak   Karahanoglu,Nazim Burak Karahanoglu and Hakan Erdogan,"A* Orthogonal Matching Pursuit: Best-First Search for Compressed Sensing
  Signal Recovery",accepted for publication in Digital Signal Processing,"Digital Signal Processing, Volume 22, Issue 4, 2012, Pages 555-568",10.1016/j.dsp.2012.03.003,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Compressed sensing is a developing field aiming at reconstruction of sparse
signals acquired in reduced dimensions, which make the recovery process
under-determined. The required solution is the one with minimum $\ell_0$ norm
due to sparsity, however it is not practical to solve the $\ell_0$ minimization
problem. Commonly used techniques include $\ell_1$ minimization, such as Basis
Pursuit (BP) and greedy pursuit algorithms such as Orthogonal Matching Pursuit
(OMP) and Subspace Pursuit (SP). This manuscript proposes a novel semi-greedy
recovery approach, namely A* Orthogonal Matching Pursuit (A*OMP). A*OMP
performs A* search to look for the sparsest solution on a tree whose paths grow
similar to the Orthogonal Matching Pursuit (OMP) algorithm. Paths on the tree
are evaluated according to a cost function, which should compensate for
different path lengths. For this purpose, three different auxiliary structures
are defined, including novel dynamic ones. A*OMP also incorporates pruning
techniques which enable practical applications of the algorithm. Moreover, the
adjustable search parameters provide means for a complexity-accuracy trade-off.
We demonstrate the reconstruction ability of the proposed scheme on both
synthetically generated data and images using Gaussian and Bernoulli
observation matrices, where A*OMP yields less reconstruction error and higher
exact recovery frequency than BP, OMP and SP. Results also indicate that novel
dynamic cost functions provide improved results as compared to a conventional
choice.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2010 11:41:21 GMT'}, {'version': 'v2', 'created': 'Sat, 17 Sep 2011 12:06:19 GMT'}, {'version': 'v3', 'created': 'Wed, 14 Mar 2012 10:36:17 GMT'}]",2012-09-06,"[['Karahanoglu', 'Nazim Burak', ''], ['Erdogan', 'Hakan', '']]","['compressed sensing', 'sparse signal reconstruction', 'orthogonal matching pursuit', 'best-first search', 'auxiliary functions for A* search']"
553,1108.1068,Yi Wei,"Yi Wei, Hannes Roth, Carlo A. Furia, Yu Pei, Alexander Horton, Michael
  Steindorfer, Martin Nordio, Bertrand Meyer",Stateful Testing: Finding More Errors in Code and Contracts,"11 pages, 3 figures","Proceedings of the 26th IEEE/ACM International Conference on
  Automated Software Engineering (ASE'11). Pgg. 440--443, ACM, November 2011",10.1109/ASE.2011.6100094,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated random testing has shown to be an effective approach to finding
faults but still faces a major unsolved issue: how to generate test inputs
diverse enough to find many faults and find them quickly. Stateful testing, the
automated testing technique introduced in this article, generates new test
cases that improve an existing test suite. The generated test cases are
designed to violate the dynamically inferred contracts (invariants)
characterizing the existing test suite. As a consequence, they are in a good
position to detect new errors, and also to improve the accuracy of the inferred
contracts by discovering those that are unsound. Experiments on 13 data
structure classes totalling over 28,000 lines of code demonstrate the
effectiveness of stateful testing in improving over the results of long
sessions of random testing: stateful testing found 68.4% new errors and
improved the accuracy of automatically inferred contracts to over 99%, with
just a 7% time overhead.
","[{'version': 'v1', 'created': 'Thu, 4 Aug 2011 12:38:29 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Aug 2011 14:51:54 GMT'}]",2013-08-14,"[['Wei', 'Yi', ''], ['Roth', 'Hannes', ''], ['Furia', 'Carlo A.', ''], ['Pei', 'Yu', ''], ['Horton', 'Alexander', ''], ['Steindorfer', 'Michael', ''], ['Nordio', 'Martin', ''], ['Meyer', 'Bertrand', '']]","['random testing', 'dynamic analysis', 'automation']"
554,1605.06276,Alexander Gorban,"A.N. Gorban, E.M. Mirkes, A. Zinovyev","Piece-wise quadratic approximations of arbitrary error functions for
  fast and robust machine learning",Edited and extended version with algortihms of regularized regression,"Neural Networks, Volume 84, December 2016, 28-38",10.1016/j.neunet.2016.08.007,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Most of machine learning approaches have stemmed from the application of
minimizing the mean squared distance principle, based on the computationally
efficient quadratic optimization methods. However, when faced with
high-dimensional and noisy data, the quadratic error functionals demonstrated
many weaknesses including high sensitivity to contaminating factors and
dimensionality curse. Therefore, a lot of recent applications in machine
learning exploited properties of non-quadratic error functionals based on $L_1$
norm or even sub-linear potentials corresponding to quasinorms $L_p$ ($0<p<1$).
The back side of these approaches is increase in computational cost for
optimization. Till so far, no approaches have been suggested to deal with {\it
arbitrary} error functionals, in a flexible and computationally efficient
framework. In this paper, we develop a theory and basic universal data
approximation algorithms ($k$-means, principal components, principal manifolds
and graphs, regularized and sparse regression), based on piece-wise quadratic
error potentials of subquadratic growth (PQSQ potentials). We develop a new and
universal framework to minimize {\it arbitrary sub-quadratic error potentials}
using an algorithm with guaranteed fast convergence to the local or global
error minimum. The theory of PQSQ potentials is based on the notion of the cone
of minorant functions, and represents a natural approximation formalism based
on the application of min-plus algebra. The approach can be applied in most of
existing machine learning methods, including methods of data approximation and
regularized and sparse regression, leading to the improvement in the
computational cost/accuracy trade-off. We demonstrate that on synthetic and
real-life datasets PQSQ-based machine learning methods achieve orders of
magnitude faster computational performance than the corresponding
state-of-the-art methods.
","[{'version': 'v1', 'created': 'Fri, 20 May 2016 10:25:47 GMT'}, {'version': 'v2', 'created': 'Sun, 21 Aug 2016 12:44:25 GMT'}]",2017-01-24,"[['Gorban', 'A. N.', ''], ['Mirkes', 'E. M.', ''], ['Zinovyev', 'A.', '']]","['data approximation', 'nonquadratic potential', 'principal components', 'clustering', 'regularizedregression', 'sparse regression']"
555,1901.06381,Chaitanya Prakash Bapat,"Chaitanya Bapat, Ganesh Baleri, Shivani Inamdar and Anant V Nimkar",Smart-Lock Security Re-engineered using Cryptography and Steganography,"Fifth International Symposium on Security in Computing and
  Communications (SSCC'17)","Communications in Computer and Information Science, vol 746.
  Springer, Singapore (2017) pp 325-336",10.1007/978-981-10-6898-0_27,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  After the rise of E-commerce, social media and messenger bots, rapid
developments have been made in the field of connecting things, gadgets, and
devices, i.e, the Internet of Things (IoT). In the fast-paced lifestyle, it is
very difficult to maintain multiple keys for traditional mechanical locks.
Electromagnetic smart locks are a possible solution to this problem. To connect
a smart lock with a key, Bluetooth Low Energy (BLE) protocol can be used. BLE
protocol is vulnerable to Man-in-the-Middle (MITM) attack. Ensuring security
over BLE is an ongoing challenge. This paper aims to analyze the MITM
vulnerability of BLE and develop a possible solution for designing smart-locks
with an increased level of security. The observation shows that the combination
of Image Steganography and Cryptography helps to overcome the vulnerabilities
of BLE protocol.
","[{'version': 'v1', 'created': 'Fri, 18 Jan 2019 18:49:23 GMT'}]",2019-01-21,"[['Bapat', 'Chaitanya', ''], ['Baleri', 'Ganesh', ''], ['Inamdar', 'Shivani', ''], ['Nimkar', 'Anant V', '']]","['Internet of Things', 'Security', 'Steganography', 'Cryptography', 'Bluetooth Low Energy protocol']"
556,1704.06610,Jose Oramas,Jose Oramas and Luc De Raedt and Tinne Tuytelaars,Context-based Object Viewpoint Estimation: A 2D Relational Approach,Computer Vision and Image Understanding (CVIU),,10.1016/j.cviu.2017.04.005,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The task of object viewpoint estimation has been a challenge since the early
days of computer vision. To estimate the viewpoint (or pose) of an object,
people have mostly looked at object intrinsic features, such as shape or
appearance. Surprisingly, informative features provided by other, extrinsic
elements in the scene, have so far mostly been ignored. At the same time,
contextual cues have been proven to be of great benefit for related tasks such
as object detection or action recognition. In this paper, we explore how
information from other objects in the scene can be exploited for viewpoint
estimation. In particular, we look at object configurations by following a
relational neighbor-based approach for reasoning about object relations. We
show that, starting from noisy object detections and viewpoint estimates,
exploiting the estimated viewpoint and location of other objects in the scene
can lead to improved object viewpoint predictions. Experiments on the KITTI
dataset demonstrate that object configurations can indeed be used as a
complementary cue to appearance-based viewpoint estimation. Our analysis
reveals that the proposed context-based method can improve object viewpoint
estimation by reducing specific types of viewpoint estimation errors commonly
made by methods that only consider local information. Moreover, considering
contextual information produces superior performance in scenes where a high
number of object instances occur. Finally, our results suggest that, following
a cautious relational neighbor formulation brings improvements over its
aggressive counterpart for the task of object viewpoint estimation.
","[{'version': 'v1', 'created': 'Fri, 21 Apr 2017 15:55:54 GMT'}]",2017-04-24,"[['Oramas', 'Jose', ''], ['De Raedt', 'Luc', ''], ['Tuytelaars', 'Tinne', '']]","['context', 'viewpoint estimation', 'relational learning', 'collective classification', 'cautious inference']"
557,1102.0372,Jerome Darmont,"Hadj Mahboubi (ERIC), J\'er\^ome Darmont (ERIC)",XWeB: the XML Warehouse Benchmark,,"2nd TPC Technology Conference on Performance Evaluation &
  Benchmarking (VLDB/TPCTC 10), Singapore : Singapore (2010)",10.1007/978-3-642-18206-8_14,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the emergence of XML as a standard for representing business data, new
decision support applications are being developed. These XML data warehouses
aim at supporting On-Line Analytical Processing (OLAP) operations that
manipulate irregular XML data. To ensure feasibility of these new tools,
important performance issues must be addressed. Performance is customarily
assessed with the help of benchmarks. However, decision support benchmarks do
not currently support XML features. In this paper, we introduce the XML
Warehouse Benchmark (XWeB), which aims at filling this gap. XWeB derives from
the relational decision support benchmark TPC-H. It is mainly composed of a
test data warehouse that is based on a unified reference model for XML
warehouses and that features XML-specific structures, and its associate XQuery
decision support workload. XWeB's usage is illustrated by experiments on
several XML database management systems.
","[{'version': 'v1', 'created': 'Wed, 2 Feb 2011 07:11:13 GMT'}]",2020-07-17,"[['Mahboubi', 'Hadj', '', 'ERIC'], ['Darmont', 'Jérôme', '', 'ERIC']]","['benchmark', 'XML data warehouse', 'OLAP', 'TPC-H']"
558,1304.0100,Diederik Aerts,Diederik Aerts and Sandro Sozzo,Entanglement Zoo I: Foundational and Structural Aspects,11 pages,"Quantum Interaction. Lecture Notes in Computer Science, 8369, pp.
  84-96, 2014",10.1007/978-3-642-54943-4_8,,cs.AI quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We put forward a general classification for a structural description of the
entanglement present in compound entities experimentally violating Bell's
inequalities, making use of a new entanglement scheme that we developed
recently. Our scheme, although different from the traditional one, is
completely compatible with standard quantum theory, and enables quantum
modeling in complex Hilbert space for different types of situations. Namely,
situations where entangled states and product measurements appear ('customary
quantum modeling'), and situations where states and measurements and evolutions
between measurements are entangled ('nonlocal box modeling', 'nonlocal
non-marginal box modeling'). The role played by Tsirelson's bound and marginal
distribution law is emphasized. Specific quantum models are worked out in
detail in complex Hilbert space within this new entanglement scheme.
","[{'version': 'v1', 'created': 'Sat, 30 Mar 2013 12:41:48 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Sep 2013 15:57:52 GMT'}]",2015-12-31,"[['Aerts', 'Diederik', ''], ['Sozzo', 'Sandro', '']]","['Quantum modeling', 'Bell’s inequalities', 'entanglement', 'nonlocal boxes']"
559,1502.07994,V.P. Binu,"Divya G. Nair, V. P. Binu, G. Santhosh Kumar","An Effective Private Data storage and Retrieval System using Secret
  sharing scheme based on Secure Multi-party Computation","Data Science & Engineering (ICDSE), 2014 International Conference,
  CUSAT",,10.1109/ICDSE.2014.6974639,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Privacy of the outsourced data is one of the major challenge.Insecurity of
the network environment and untrustworthiness of the service providers are
obstacles of making the database as a service.Collection and storage of
personally identifiable information is a major privacy concern.On-line public
databases and resources pose a significant risk to user privacy, since a
malicious database owner may monitor user queries and infer useful information
about the customer.The challenge in data privacy is to share data with
third-party and at the same time securing the valuable information from
unauthorized access and use by third party.A Private Information Retrieval(PIR)
scheme allows a user to query database while hiding the identity of the data
retrieved.The naive solution for confidentiality is to encrypt data before
outsourcing.Query execution,key management and statistical inference are major
challenges in this case.The proposed system suggests a mechanism for secure
storage and retrieval of private data using the secret sharing technique.The
idea is to develop a mechanism to store private information with a highly
available storage provider which could be accessed from anywhere using queries
while hiding the actual data values from the storage provider.The private
information retrieval system is implemented using Secure Multi-party
Computation(SMC) technique which is based on secret sharing. Multi-party
Computation enable parties to compute some joint function over their private
inputs.The query results are obtained by performing a secure computation on the
shares owned by the different servers.
","[{'version': 'v1', 'created': 'Thu, 26 Feb 2015 09:02:26 GMT'}]",2015-03-02,"[['Nair', 'Divya G.', ''], ['Binu', 'V. P.', ''], ['Kumar', 'G. Santhosh', '']]","['Database', 'Data storage', 'private Information Retrieval', 'QueryProcessing', 'Shamir’sSecretSharing', 'SecureMulti-party Computation']"
560,1303.1747,Emilio Ferrara,"Pasquale De Meo, Emilio Ferrara, Giacomo Fiumara, Angela Ricciardello",A Novel Measure of Edge Centrality in Social Networks,"28 pages, 5 figures","Knowledge-based Systems, 30:136-150, 2012",10.1016/j.knosys.2012.01.007,,cs.SI cs.DS physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of assigning centrality values to nodes and edges in graphs has
been widely investigated during last years. Recently, a novel measure of node
centrality has been proposed, called k-path centrality index, which is based on
the propagation of messages inside a network along paths consisting of at most
k edges. On the other hand, the importance of computing the centrality of edges
has been put into evidence since 1970's by Anthonisse and, subsequently by
Girvan and Newman. In this work we propose the generalization of the concept of
k-path centrality by defining the k-path edge centrality, a measure of
centrality introduced to compute the importance of edges. We provide an
efficient algorithm, running in O(k m), being m the number of edges in the
graph. Thus, our technique is feasible for large scale network analysis.
Finally, the performance of our algorithm is analyzed, discussing the results
obtained against large online social network datasets.
","[{'version': 'v1', 'created': 'Thu, 7 Mar 2013 16:54:34 GMT'}]",2013-03-08,"[['De Meo', 'Pasquale', ''], ['Ferrara', 'Emilio', ''], ['Fiumara', 'Giacomo', ''], ['Ricciardello', 'Angela', '']]","['Complex networks', 'Social networks', 'Centrality measure', 'Network analysis']"
561,1505.04157,Vijaykumar S,"Vijaykumar S., Saravanakumar S.G., M. Balamurugan",Unique Sense: Smart Computing Prototype,6 Pages,"Elsevier Procedia Computer Science 50, 2015 Pages 223-228",10.1016/j.procs.2015.04.056,,cs.OH,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Unique sense: Smart computing prototype is a part of unique sense computing
architecture, which delivers alternate solution for todays computing
architecture. This computing is one step towards future generation needs, which
brings extended support to the ubiquitous environment. This smart computing
prototype is the light weight compact architecture which is designed to satisfy
all the needs of this society. The proposed solution is based on the hybrid
combination of cutting edge technologies and techniques from the various
layers. In addition it achieves low cost architecture and eco-friendly to meet
all the levels of peoples needs.
","[{'version': 'v1', 'created': 'Sat, 9 May 2015 02:38:57 GMT'}]",2015-05-18,"[['S.', 'Vijaykumar', ''], ['G.', 'Saravanakumar S.', ''], ['Balamurugan', 'M.', '']]","['Smart Computing', 'HPC', 'Prototype', 'ARM', 'Hadoop']"
562,1404.6955,Kenric Nelson,"Kenric P. Nelson, Madalina Barbu, Brian J. Scannell",Probabilistic graphs using coupled random variables,"Submitted for presentation at the Machine Intelligence and
  Bio-inspired Computation: Theory and Applications Conference, SPIE Sensing
  Technology and Applications, Baltimore, MD, May 8, 2014",,10.1117/12.2050759,,cs.LG cs.IT cs.NE math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural network design has utilized flexible nonlinear processes which can
mimic biological systems, but has suffered from a lack of traceability in the
resulting network. Graphical probabilistic models ground network design in
probabilistic reasoning, but the restrictions reduce the expressive capability
of each node making network designs complex. The ability to model coupled
random variables using the calculus of nonextensive statistical mechanics
provides a neural node design incorporating nonlinear coupling between input
states while maintaining the rigor of probabilistic reasoning. A generalization
of Bayes rule using the coupled product enables a single node to model
correlation between hundreds of random variables. A coupled Markov random field
is designed for the inferencing and classification of UCI's MLR 'Multiple
Features Data Set' such that thousands of linear correlation parameters can be
replaced with a single coupling parameter with just a (3%, 4%) percent
reduction in (classification, inference) performance.
","[{'version': 'v1', 'created': 'Wed, 23 Apr 2014 19:25:48 GMT'}]",2015-06-19,"[['Nelson', 'Kenric P.', ''], ['Barbu', 'Madalina', ''], ['Scannell', 'Brian J.', '']]","['Probabilistic graphs', 'Markov Random Fields', 'Bayesian Networks', 'Nonlinear Statistical Coupling', 'Nonextensive Statistical Mechanics']"
563,1707.03327,Daniel Torres-Salinas Dr,"Daniel Torres-Salinas, Christian Gumpenberger, Juan Gorraiz","PlumX As a Potential Tool to Assess the Macroscopic Multidimensional
  Impact of Books",,,10.3389/frma.2017.00005,11 pages,cs.DL cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The main purpose of this macro-study is to shed light on the broad impact of
books. For this purpose, the impact of a very large collection of books has
been analyzed by using PlumX, an analytical tool providing a great number of
different metrics provided by various tools.
","[{'version': 'v1', 'created': 'Wed, 5 Jul 2017 19:02:22 GMT'}]",2017-07-12,"[['Torres-Salinas', 'Daniel', ''], ['Gumpenberger', 'Christian', ''], ['Gorraiz', 'Juan', '']]","['books', 'impact', 'altmetrics', 'PlumX', 'usage metrics']"
564,1306.2291,Francesca Scozzari,Gianluca Amato and Francesca Scozzari,Optimal multi-binding unification for sharing and linearity analysis,To appear in Theory and Practice of Logic Programming (TPLP),"Theory and Practice of Logic Programming, 14, pp 379-400, 2014",10.1017/S1471068413000070,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the analysis of logic programs, abstract domains for detecting sharing
properties are widely used. Recently the new domain $\Linp$ has been introduced
to generalize both sharing and linearity information. This domain is endowed
with an optimal abstract operator for single-binding unification. The authors
claim that the repeated application of this operator is also optimal for
multi-binding unification. This is the proof of such a claim.
","[{'version': 'v1', 'created': 'Mon, 10 Jun 2013 19:12:57 GMT'}]",2016-03-18,"[['Amato', 'Gianluca', ''], ['Scozzari', 'Francesca', '']]","['Static analysis', 'abstract interpretation', 'sharing', 'linearity', 'unification']"
565,2210.10144,Phillip Howard,"Phillip Howard, Arden Ma, Vasudev Lal, Ana Paula Simoes, Daniel Korat,
  Oren Pereg, Moshe Wasserblat, Gadi Singer","Cross-Domain Aspect Extraction using Transformers Augmented with
  Knowledge Graphs",,"Proceedings of the 31st ACM International Conference on
  Information & Knowledge Management (CIKM 2022). Association for Computing
  Machinery, New York, NY, USA, 780-790",10.1145/3511808.3557275,,cs.CL cs.AI,http://creativecommons.org/licenses/by/4.0/,"  The extraction of aspect terms is a critical step in fine-grained sentiment
analysis of text. Existing approaches for this task have yielded impressive
results when the training and testing data are from the same domain. However,
these methods show a drastic decrease in performance when applied to
cross-domain settings where the domain of the testing data differs from that of
the training data. To address this lack of extensibility and robustness, we
propose a novel approach for automatically constructing domain-specific
knowledge graphs that contain information relevant to the identification of
aspect terms. We introduce a methodology for injecting information from these
knowledge graphs into Transformer models, including two alternative mechanisms
for knowledge insertion: via query enrichment and via manipulation of attention
patterns. We demonstrate state-of-the-art performance on benchmark datasets for
cross-domain aspect term extraction using our approach and investigate how the
amount of external knowledge available to the Transformer impacts model
performance.
","[{'version': 'v1', 'created': 'Tue, 18 Oct 2022 20:18:42 GMT'}]",2022-10-20,"[['Howard', 'Phillip', ''], ['Ma', 'Arden', ''], ['Lal', 'Vasudev', ''], ['Simoes', 'Ana Paula', ''], ['Korat', 'Daniel', ''], ['Pereg', 'Oren', ''], ['Wasserblat', 'Moshe', ''], ['Singer', 'Gadi', '']]","['Knowledge graphs', 'transformers', 'aspect extraction', 'knowledgeinjection', 'aspect-based sentiment analysis']"
566,0708.2309,Dmitri Krioukov,"Dmitri Krioukov, kc claffy, Kevin Fall, Arthur Brady",On Compact Routing for the Internet,"This is a significantly revised, journal version of cs/0508021","ACM SIGCOMM Computer Communication Review (CCR), v.37, n.3,
  p.41-52, 2007",10.1145/1273445.1273450,,cs.NI,,"  While there exist compact routing schemes designed for grids, trees, and
Internet-like topologies that offer routing tables of sizes that scale
logarithmically with the network size, we demonstrate in this paper that in
view of recent results in compact routing research, such logarithmic scaling on
Internet-like topologies is fundamentally impossible in the presence of
topology dynamics or topology-independent (flat) addressing. We use analytic
arguments to show that the number of routing control messages per topology
change cannot scale better than linearly on Internet-like topologies. We also
employ simulations to confirm that logarithmic routing table size scaling gets
broken by topology-independent addressing, a cornerstone of popular
locator-identifier split proposals aiming at improving routing scaling in the
presence of network topology dynamics or host mobility. These pessimistic
findings lead us to the conclusion that a fundamental re-examination of
assumptions behind routing models and abstractions is needed in order to find a
routing architecture that would be able to scale ``indefinitely.''
","[{'version': 'v1', 'created': 'Fri, 17 Aug 2007 02:37:20 GMT'}]",2008-04-16,"[['Krioukov', 'Dmitri', ''], ['claffy', 'kc', ''], ['Fall', 'Kevin', ''], ['Brady', 'Arthur', '']]","['Compact routing', 'Internet routing', 'routing scalability']"
567,1904.02362,Shuai Shao,"Jin-Yi Cai, Zhiguo Fu and Shuai Shao","Beyond #CSP: A Dichotomy for Counting Weighted Eulerian Orientations
  with ARS","37 pages, 2 figures","Information and Computation, volume 275, 2020",10.1016/j.ic.2020.104589,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We define and explore a notion of unique prime factorization for constraint
functions, and use this as a new tool to prove a complexity classification for
counting weighted Eulerian orientation problems with arrow reversal symmetry
(ARS). We prove that all such problems are either polynomial-time computable or
#P-hard. We show that the class of weighted Eulerian orientation problems
subsumes all weighted counting constraint satisfaction problems (#CSP) on
Boolean variables. More significantly, we establish a novel connection between
#CSP and counting weighted Eulerian orientation problems that is global in
nature. This connection is based on a structural determination of all
half-weighted affine linear subspaces over $\mathbb{Z}_2$, which is proved
using M\""obius inversion.
","[{'version': 'v1', 'created': 'Thu, 4 Apr 2019 05:53:00 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Jun 2020 08:52:42 GMT'}]",2021-04-13,"[['Cai', 'Jin-Yi', ''], ['Fu', 'Zhiguo', ''], ['Shao', 'Shuai', '']]","['Eulerian orientation', 'Holant problem', '#CSP', 'Unique prime factorization']"
568,2102.09954,Thanh Pham Dinh,"Huynh Thi Thanh Binh, Ta Bao Thang, Nguyen Duc Thai, Pham Dinh Thanh","A bi-level encoding scheme for the clustered shortest-path tree problem
  in multifactorial optimization","36 pages, 13 figures, 13 tables",,10.1016/j.engappai.2021.104187,,cs.AI cs.NE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The Clustered Shortest-Path Tree Problem (CluSPT) plays an important role in
various types of optimization problems in real-life. Recently, some
Multifactorial Evolutionary Algorithm (MFEA) have been introduced to deal with
the CluSPT, however these researches still have some shortcomings such as
evolution operators only perform on complete graphs, huge resource consumption
for finding the solution on large search spaces. To overcome these limitations,
this paper describes a MFEA-based approach to solve the CluSPT. The proposed
algorithm utilizes Dijkstra's algorithm to construct the spanning trees in
clusters while using evolutionary operators for building the spanning tree
connecting clusters. This approach takes advantage of both exact and
approximate algorithms so it enables the algorithm to function efficiently on
complete and sparse graphs alike. Furthermore, evolutionary operators such as
individual encoding and decoding methods are also designed with great
consideration regarding performance and memory usage. We have included a proof
on the repairing method's efficacy in ensuring all solutions are valid. We have
conducted tests on various types of Euclidean instances to assess the
effectiveness of the proposed algorithm and methods. Experiment results point
out the effectiveness of the proposed algorithm existing heuristic algorithms
in most of the test cases. The impact of the proposed MFEA was analyzed and a
possible influential factor that may be useful for further study was also
pointed out.
","[{'version': 'v1', 'created': 'Fri, 12 Feb 2021 13:36:07 GMT'}]",2021-02-22,"[['Binh', 'Huynh Thi Thanh', ''], ['Thang', 'Ta Bao', ''], ['Thai', 'Nguyen Duc', ''], ['Thanh', 'Pham Dinh', '']]","['Multifactorial Evolutionary Algorithm', 'Clustered Shortest-Path Tree Problem', 'EvolutionaryAlgorithms', 'Multifactorial Optimization']"
569,1911.10708,Idris Abdulmumin,Idris Abdulmumin and Bashir Shehu Galadanci,hauWE: Hausa Words Embedding for Natural Language Processing,"In Proceedings of the 2019 2nd International Conference of the IEEE
  Nigeria Computer Chapter",,10.1109/NigeriaComputConf45974.2019.8949674,,cs.CL cs.AI cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Words embedding (distributed word vector representations) have become an
essential component of many natural language processing (NLP) tasks such as
machine translation, sentiment analysis, word analogy, named entity recognition
and word similarity. Despite this, the only work that provides word vectors for
Hausa language is that of Bojanowski et al. [1] trained using fastText,
consisting of only a few words vectors. This work presents words embedding
models using Word2Vec's Continuous Bag of Words (CBoW) and Skip Gram (SG)
models. The models, hauWE (Hausa Words Embedding), are bigger and better than
the only previous model, making them more useful in NLP tasks. To compare the
models, they were used to predict the 10 most similar words to 30 randomly
selected Hausa words. hauWE CBoW's 88.7% and hauWE SG's 79.3% prediction
accuracy greatly outperformed Bojanowski et al. [1]'s 22.3%.
","[{'version': 'v1', 'created': 'Mon, 25 Nov 2019 05:46:56 GMT'}]",2020-01-08,"[['Abdulmumin', 'Idris', ''], ['Galadanci', 'Bashir Shehu', '']]","['Hausa', 'words embedding', 'natural language']"
570,1509.08572,Giacomo Como,Giacomo Como and Fabio Fagnani,"From local averaging to emergent global behaviors: the fundamental role
  of network interconnections",10 pages,,10.1016/j.sysconle.2016.02.003,,cs.SY cs.MA math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed averaging is one of the simplest and most studied network
dynamics. Its applications range from cooperative inference in sensor networks,
to robot formation, to opinion dynamics. A number of fundamental results and
examples scattered through the literature are gathered here and originally
presented, emphasizing the deep interplay between the network interconnection
structure and the emergent global behavior.
","[{'version': 'v1', 'created': 'Tue, 29 Sep 2015 02:58:55 GMT'}, {'version': 'v2', 'created': 'Sat, 20 Feb 2016 11:37:30 GMT'}]",2016-03-04,"[['Como', 'Giacomo', ''], ['Fagnani', 'Fabio', '']]","['Network dynamics', 'interconnections', 'emergent behaviors', 'distributed averaging', 'consensus', 'polarization', 'electrical networks']"
571,1510.05405,Mira Sarkis,"Mira Sarkis (LTCI), Cyril Concolato (LTCI), Jean-Claude Dufourd (LTCI)","The Virtual Splitter: Refactoring Web Applications for the Multiscreen
  Environment",,"DocEng'14: ACM Symposium on Document Engineering, ACM, 2014,
  pp.Pages139-142 \&lt;10.1145/2644866.2644893\&gt;",10.1145/2644866.2644893,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Creating web applications for the multiscreen environment is still a
challenge. One approach is to transform existing single-screen applications but
this has not been done yet automatically or generically. This paper proposes a
refactor-ing system. It consists of a generic and extensible mapping phase that
automatically analyzes the application content based on a semantic or a visual
criterion determined by the author or the user, and prepares it for the
splitting process. The system then splits the application and as a result
delivers two instrumented applications ready for distribution across devices.
During runtime, the system uses a mirroring phase to maintain the functionality
of the distributed application and to support a dynamic splitting process.
Developed as a Chrome extension, our approach is validated on several web
applications, including a YouTube page and a video application from Mozilla.
","[{'version': 'v1', 'created': 'Mon, 19 Oct 2015 09:40:17 GMT'}]",2015-10-20,"[['Sarkis', 'Mira', '', 'LTCI'], ['Concolato', 'Cyril', '', 'LTCI'], ['Dufourd', 'Jean-Claude', '', 'LTCI']]","['Application Distribution', 'Authoring', 'Multiscreen', 'Web Application']"
572,1611.01078,Gabriel Nivasch,Boris Bukh and Po-Shen Loh and Gabriel Nivasch,Classifying unavoidable Tverberg partitions,"Revision following referee comments. 32 pages, 8 figures","Journal of Computational Geometry 8(1):174-205, 2017",10.20382/jocg.v8i1a9,,cs.CG math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $T(d,r) = (r-1)(d+1)+1$ be the parameter in Tverberg's theorem, and call
a partition $\mathcal I$ of $\{1,2,\ldots,T(d,r)\}$ into $r$ parts a ""Tverberg
type"". We say that $\mathcal I$ ""occurs"" in an ordered point sequence $P$ if
$P$ contains a subsequence $P'$ of $T(d,r)$ points such that the partition of
$P'$ that is order-isomorphic to $\mathcal I$ is a Tverberg partition. We say
that $\mathcal I$ is ""unavoidable"" if it occurs in every sufficiently long
point sequence.
  In this paper we study the problem of determining which Tverberg types are
unavoidable. We conjecture a complete characterization of the unavoidable
Tverberg types, and we prove some cases of our conjecture for $d\le 4$. Along
the way, we study the avoidability of many other geometric predicates.
  Our techniques also yield a large family of $T(d,r)$-point sets for which the
number of Tverberg partitions is exactly $(r-1)!^d$. This lends further support
for Sierksma's conjecture on the number of Tverberg partitions.
","[{'version': 'v1', 'created': 'Thu, 3 Nov 2016 16:15:59 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Dec 2016 19:26:37 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Mar 2017 21:02:21 GMT'}]",2017-07-06,"[['Bukh', 'Boris', ''], ['Loh', 'Po-Shen', ''], ['Nivasch', 'Gabriel', '']]","['Geometric predicate', 'Ramsey theory', 'stair-convexity', 'Tverberg’s theorem']"
573,1409.8230,Adrian Barbu,"Josue Anaya, Adrian Barbu",RENOIR - A Dataset for Real Low-Light Image Noise Reduction,"27 pages, 11 figures","Journal of Visual Communication and Image Representation 51, No.
  2, 144-154, 2018",10.1016/j.jvcir.2018.01.012,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image denoising algorithms are evaluated using images corrupted by artificial
noise, which may lead to incorrect conclusions about their performances on real
noise. In this paper we introduce a dataset of color images corrupted by
natural noise due to low-light conditions, together with spatially and
intensity-aligned low noise images of the same scenes. We also introduce a
method for estimating the true noise level in our images, since even the low
noise images contain small amounts of noise. We evaluate the accuracy of our
noise estimation method on real and artificial noise, and investigate the
Poisson-Gaussian noise model. Finally, we use our dataset to evaluate six
denoising algorithms: Active Random Field, BM3D, Bilevel-MRF, Multi-Layer
Perceptron, and two versions of NL-means. We show that while the Multi-Layer
Perceptron, Bilevel-MRF, and NL-means with soft threshold outperform BM3D on
gray images with synthetic noise, they lag behind on our dataset.
","[{'version': 'v1', 'created': 'Mon, 29 Sep 2014 18:38:52 GMT'}, {'version': 'v2', 'created': 'Tue, 3 May 2016 17:43:06 GMT'}, {'version': 'v3', 'created': 'Thu, 16 Jun 2016 17:11:16 GMT'}, {'version': 'v4', 'created': 'Mon, 20 Jun 2016 15:12:13 GMT'}, {'version': 'v5', 'created': 'Tue, 21 Jun 2016 10:38:40 GMT'}, {'version': 'v6', 'created': 'Tue, 9 Aug 2016 21:23:51 GMT'}, {'version': 'v7', 'created': 'Tue, 18 Oct 2016 13:59:43 GMT'}, {'version': 'v8', 'created': 'Tue, 13 Dec 2016 21:36:38 GMT'}, {'version': 'v9', 'created': 'Mon, 8 May 2017 22:24:44 GMT'}]",2018-02-06,"[['Anaya', 'Josue', ''], ['Barbu', 'Adrian', '']]","['image denoising', 'denoising dataset', 'low light noise', 'Poisson-Gaussian']"
574,2012.02346,Takashi Matsubara,"Takumi Kimura, Takashi Matsubara, Kuniaki Uehara",ChartPointFlow for Topology-Aware 3D Point Cloud Generation,"Accepted to ACM International Conference on Multimedia (ACMMM2021) as
  an oral presentation",ACM International Conference on Multimedia (ACMMM2021),10.1145/3474085.3475589,,cs.CV cs.GR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A point cloud serves as a representation of the surface of a
three-dimensional (3D) shape. Deep generative models have been adapted to model
their variations typically using a map from a ball-like set of latent
variables. However, previous approaches did not pay much attention to the
topological structure of a point cloud, despite that a continuous map cannot
express the varying numbers of holes and intersections. Moreover, a point cloud
is often composed of multiple subparts, and it is also difficult to express. In
this study, we propose ChartPointFlow, a flow-based generative model with
multiple latent labels for 3D point clouds. Each label is assigned to points in
an unsupervised manner. Then, a map conditioned on a label is assigned to a
continuous subset of a point cloud, similar to a chart of a manifold. This
enables our proposed model to preserve the topological structure with clear
boundaries, whereas previous approaches tend to generate blurry point clouds
and fail to generate holes. The experimental results demonstrate that
ChartPointFlow achieves state-of-the-art performance in terms of generation and
reconstruction compared with other point cloud generators. Moreover,
ChartPointFlow divides an object into semantic subparts using charts, and it
demonstrates superior performance in case of unsupervised segmentation.
","[{'version': 'v1', 'created': 'Fri, 4 Dec 2020 00:49:25 GMT'}, {'version': 'v2', 'created': 'Sat, 7 Aug 2021 10:14:33 GMT'}]",2021-08-10,"[['Kimura', 'Takumi', ''], ['Matsubara', 'Takashi', ''], ['Uehara', 'Kuniaki', '']]","['point clouds', 'generative model', 'manifold']"
575,1811.10574,Federico Galatolo,"Federico A. Galatolo, Mario G.C.A. Cimino, Gigliola Vaglini",Using stigmergy to incorporate the time into artificial neural networks,,,10.1007/978-3-030-05918-7_22,,cs.NE cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A current research trend in neurocomputing involves the design of novel
artificial neural networks incorporating the concept of time into their
operating model. In this paper, a novel architecture that employs stigmergy is
proposed. Computational stigmergy is used to dynamically increase (or decrease)
the strength of a connection, or the activation level, of an artificial neuron
when stimulated (or released). This study lays down a basic framework for the
derivation of a stigmergic NN with a related training algorithm. To show its
potential, some pilot experiments have been reported. The XOR problem is solved
by using only one single stigmergic neuron with one input and one output. A
static NN, a stigmergic NN, a recurrent NN and a long short-term memory NN have
been trained to solve the MNIST digits recognition benchmark.
","[{'version': 'v1', 'created': 'Fri, 26 Oct 2018 00:12:11 GMT'}]",2019-01-29,"[['Galatolo', 'Federico A.', ''], ['Cimino', 'Mario G. C. A.', ''], ['Vaglini', 'Gigliola', '']]","['Artificial Neural Networks', 'Stigmergy', 'Deep learning', 'Supervised learning']"
576,1003.3307,Secretary Aircc Journal,"S. Mehta (1) and K.S. Kwak (1) ((1)Inha University, Korea)",H-MAC: A Hybrid MAC Protocol for Wireless Sensor Networks,"10 pages, IJCNC Journal 2010","International Journal of Computer Networks & Communications 2.2
  (2010) 108-117",10.5121/ijcnc.2010.2208,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper, we propose a hybrid medium access control protocol (H-MAC) for
wireless sensor networks. It is based on the IEEE 802.11's power saving
mechanism (PSM) and slotted aloha, and utilizes multiple slots dynamically to
improve performance. Existing MAC protocols for sensor networks reduce energy
consumptions by introducing variation in an active/sleep mechanism. But they
may not provide energy efficiency in varying traffic conditions as well as they
did not address Quality of Service (QoS) issues. H-MAC, the propose MAC
protocol maintains energy efficiency as well as QoS issues like latency,
throughput, and channel utilization. Our numerical results show that H-MAC has
significant improvements in QoS parameters than the existing MAC protocols for
sensor networks while consuming comparable amount of energy.
","[{'version': 'v1', 'created': 'Wed, 17 Mar 2010 06:48:13 GMT'}]",2010-07-15,"[['Mehta', 'S.', '', 'Inha University, Korea'], ['Kwak', 'K. S.', '', 'Inha University, Korea']]","['Sensor networks', 'MAC protocol', 'energy efficiency']"
577,1405.1515,Olfa Boubaker,"Han\'ene Mkaouar, Olfa Boubaker","Compliant motion control for handling a single object by two similar
  industrial robots","7 pages, 6 Figures","Procedia Engineering, Vol. 41, pp. 1285-1291, 2012",10.1016/j.proeng.2012.07.312,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a compliant motion control strategy for handling a
single object by two similar industrial robots. The dynamics of the object
carried by the two robots is assimilated to the dynamics of a
mass-spring-damper system described by a piecewise linear model (PWA). The
coordination of the two robots is accomplished using a master slave
synchronization approach dedicated for PWA systems, based on the Lyapunov
theory, and solved via Linear Matrix Inequalities (LMIs). The performances of
the proposed approach are proved by simulation results and compared to a
related approach.
","[{'version': 'v1', 'created': 'Wed, 7 May 2014 06:28:46 GMT'}]",2014-05-08,"[['Mkaouar', 'Hanéne', ''], ['Boubaker', 'Olfa', '']]","['Robot coordination', 'Compliant  motion', 'Master-slave synchronization', 'Lyapunov Theory', 'PWA systems']"
578,1111.3125,Abuzer Yakaryilmaz,Abuzer Yakaryilmaz and A. C. Cem Say,Proving the power of postselection,26 pages. This is a heavily improved version of arXiv:1102.0666,"Fundamenta Informaticae, Vol. 123, No. 1, pp. 107-134, 2013",10.3233/FI-2013-803,,cs.CC quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is a widely believed, though unproven, conjecture that the capability of
postselection increases the language recognition power of both probabilistic
and quantum polynomial-time computers. It is also unknown whether
polynomial-time quantum machines with postselection are more powerful than
their probabilistic counterparts with the same resource restrictions. We
approach these problems by imposing additional constraints on the resources to
be used by the computer, and are able to prove for the first time that
postselection does augment the computational power of both classical and
quantum computers, and that quantum does outperform probabilistic in this
context, under simultaneous time and space bounds in a certain range. We also
look at postselected versions of space-bounded classes, as well as those
corresponding to error-free and one-sided error recognition, and provide
classical characterizations. It is shown that $\mathsf{NL}$ would equal
$\mathsf{RL}$ if the randomized machines had the postselection capability.
","[{'version': 'v1', 'created': 'Mon, 14 Nov 2011 08:02:36 GMT'}]",2014-04-11,"[['Yakaryilmaz', 'Abuzer', ''], ['Say', 'A. C. Cem', '']]","['postselection', 'quantum Turing machines', 'probabilistic Turing machines', 'space-boundedcomputation', 'one-sided error', 'zero error']"
579,1711.07049,Anh Nguyen Duc,"Anh Nguyen Duc, Daniela S. Cruzes, Geir K. Hanssen, Terje Snarby and
  Pekka Abrahamsson",Coopetition of software firms in Open source software ecosystems,"This is the author's version of the work. Copyright owner's version
  can be accessed at
  https://link.springer.com/chapter/10.1007/978-3-319-69191-6_10, Coopetition
  of software firms in Open source software ecosystems, 8th ICSOB 2017, Essen,
  Germany (2017)",,10.1007/978-3-319-69191-6_10,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software firms participate in an ecosystem as a part of their innovation
strategy to extend value creation beyond the firms boundary. Participation in
an open and independent environment also implies the competition among firms
with similar business models and targeted markets. Hence, firms need to
consider potential opportunities and challenges upfront. This study explores
how software firms interact with others in OSS ecosystems from a coopetition
perspective. We performed a quantitative and qualitative analysis of three OSS
projects. Finding shows that software firms emphasize the co-creation of common
value and partly react to the potential competitiveness on OSS ecosystems. Six
themes about coopetition were identified, including spanning gatekeepers,
securing communication, open-core sourcing and filtering shared code. Our work
contributes to software engineering research with a rich description of
coopetition in OSS ecosystems. Moreover, we also come up with several
implications for software firms in pursing a harmony participation in OSS
ecosystems.
","[{'version': 'v1', 'created': 'Sun, 19 Nov 2017 16:37:25 GMT'}, {'version': 'v2', 'created': 'Sun, 3 Dec 2017 10:51:16 GMT'}]",2017-12-05,"[['Duc', 'Anh Nguyen', ''], ['Cruzes', 'Daniela S.', ''], ['Hanssen', 'Geir K.', ''], ['Snarby', 'Terje', ''], ['Abrahamsson', 'Pekka', '']]","['coopetition', 'collaboration', 'competition', 'SECO', 'software']"
580,1811.02942,Shahab Aslani,"Shahab Aslani, Michael Dayan, Loredana Storelli, Massimo Filippi,
  Vittorio Murino, Maria A Rocca, Diego Sona","Multi-branch Convolutional Neural Network for Multiple Sclerosis Lesion
  Segmentation",This paper has been accepted for publication in NeuroImage,,10.1016/j.neuroimage.2019.03.068,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present an automated approach for segmenting multiple
sclerosis (MS) lesions from multi-modal brain magnetic resonance images. Our
method is based on a deep end-to-end 2D convolutional neural network (CNN) for
slice-based segmentation of 3D volumetric data. The proposed CNN includes a
multi-branch downsampling path, which enables the network to encode information
from multiple modalities separately. Multi-scale feature fusion blocks are
proposed to combine feature maps from different modalities at different stages
of the network. Then, multi-scale feature upsampling blocks are introduced to
upsize combined feature maps to leverage information from lesion shape and
location. We trained and tested the proposed model using orthogonal plane
orientations of each 3D modality to exploit the contextual information in all
directions. The proposed pipeline is evaluated on two different datasets: a
private dataset including 37 MS patients and a publicly available dataset known
as the ISBI 2015 longitudinal MS lesion segmentation challenge dataset,
consisting of 14 MS patients. Considering the ISBI challenge, at the time of
submission, our method was amongst the top performing solutions. On the private
dataset, using the same array of performance metrics as in the ISBI challenge,
the proposed approach shows high improvements in MS lesion segmentation
compared with other publicly available tools.
","[{'version': 'v1', 'created': 'Wed, 7 Nov 2018 15:42:57 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Nov 2018 13:10:39 GMT'}, {'version': 'v3', 'created': 'Tue, 5 Feb 2019 21:30:40 GMT'}, {'version': 'v4', 'created': 'Mon, 8 Apr 2019 17:12:50 GMT'}]",2019-04-09,"[['Aslani', 'Shahab', ''], ['Dayan', 'Michael', ''], ['Storelli', 'Loredana', ''], ['Filippi', 'Massimo', ''], ['Murino', 'Vittorio', ''], ['Rocca', 'Maria A', ''], ['Sona', 'Diego', '']]","['Multiple Sclerosis', 'Lesions', 'Brain', 'Multiple Image Modality', 'Segmentation', 'Convolutional Neural Network']"
581,1810.13036,Carlos Vinicius Gomes Costa Lima,"Guilherme de C. M. Gomes, Carlos V. G. C. Lima, Vin\'icius F. dos
  Santos",Parameterized Complexity of Equitable Coloring,,"Discrete Mathematics & Theoretical Computer Science, vol. 21 no.
  1, ICGT 2018 (May 16, 2019) dmtcs:5464",10.23638/DMTCS-21-1-8,,cs.DM,http://creativecommons.org/licenses/by/4.0/,"  A graph on $n$ vertices is equitably $k$-colorable if it is $k$-colorable and
every color is used either $\left\lfloor n/k \right\rfloor$ or $\left\lceil n/k
\right\rceil$ times.
  Such a problem appears to be considerably harder than vertex coloring, being
$\mathsf{NP\text{-}Complete}$ even for cographs and interval graphs.
  In this work, we prove that it is $\mathsf{W[1]\text{-}Hard}$ for block
graphs and for disjoint union of split graphs when parameterized by the number
of colors; and $\mathsf{W[1]\text{-}Hard}$ for $K_{1,4}$-free interval graphs
when parameterized by treewidth, number of colors and maximum degree,
generalizing a result by Fellows et al. (2014) through a much simpler
reduction.
  Using a previous result due to Dominique de Werra (1985), we establish a
dichotomy for the complexity of equitable coloring of chordal graphs based on
the size of the largest induced star.
  Finally, we show that \textsc{equitable coloring} is $\mathsf{FPT}$ when
parameterized by the treewidth of the complement graph.
","[{'version': 'v1', 'created': 'Tue, 30 Oct 2018 23:47:36 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Apr 2019 23:10:01 GMT'}, {'version': 'v3', 'created': 'Tue, 14 May 2019 18:04:18 GMT'}]",2021-01-04,"[['Gomes', 'Guilherme de C. M.', ''], ['Lima', 'Carlos V. G. C.', ''], ['Santos', 'Vinícius F. dos', '']]","['Equitable Coloring', 'Parameterized Complexity', 'Treewidth', 'Chordal Graphs']"
582,1102.2939,Davide Schipani,"Davide Schipani, Michele Elia, Joachim Rosenthal",On the Decoding Complexity of Cyclic Codes Up to the BCH Bound,accepted for publication in Proceedings ISIT 2011. IEEE copyright,,10.1109/ISIT.2011.6034253,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The standard algebraic decoding algorithm of cyclic codes $[n,k,d]$ up to the
BCH bound $t$ is very efficient and practical for relatively small $n$ while it
becomes unpractical for large $n$ as its computational complexity is $O(nt)$.
Aim of this paper is to show how to make this algebraic decoding
computationally more efficient: in the case of binary codes, for example, the
complexity of the syndrome computation drops from $O(nt)$ to $O(t\sqrt n)$, and
that of the error location from $O(nt)$ to at most $\max \{O(t\sqrt n),
O(t^2\log(t)\log(n))\}$.
","[{'version': 'v1', 'created': 'Tue, 15 Feb 2011 01:07:25 GMT'}, {'version': 'v2', 'created': 'Fri, 27 May 2011 17:02:12 GMT'}]",2016-11-17,"[['Schipani', 'Davide', ''], ['Elia', 'Michele', ''], ['Rosenthal', 'Joachim', '']]","['Cyclic codes', 'Syndrome computation', 'Decoding complexity', 'Reed Solomon codes', 'Rootsearch']"
583,2009.11771,Diego Saez-Trumper,"Oleksii Moskalenko, Denis Parra, and Diego Saez-Trumper","Scalable Recommendation of Wikipedia Articles to Editors Using
  Representation Learning",,"ComplexRec 2020, Workshop on Recommendation in Complex Scenarios
  at the ACM RecSys Conference on Recommender Systems (RecSys 2020)",,,cs.IR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wikipedia is edited by volunteer editors around the world. Considering the
large amount of existing content (e.g. over 5M articles in English Wikipedia),
deciding what to edit next can be difficult, both for experienced users that
usually have a huge backlog of articles to prioritize, as well as for newcomers
who that might need guidance in selecting the next article to contribute.
Therefore, helping editors to find relevant articles should improve their
performance and help in the retention of new editors. In this paper, we address
the problem of recommending relevant articles to editors. To do this, we
develop a scalable system on top of Graph Convolutional Networks and Doc2Vec,
learning how to represent Wikipedia articles and deliver personalized
recommendations for editors. We test our model on editors' histories,
predicting their most recent edits based on their prior edits. We outperform
competitive implicit-feedback collaborative-filtering methods such as WMRF
based on ALS, as well as a traditional IR-method such as content-based
filtering based on BM25. All of the data used on this paper is publicly
available, including graph embeddings for Wikipedia articles, and we release
our code to support replication of our experiments. Moreover, we contribute
with a scalable implementation of a state-of-art graph embedding algorithm as
current ones cannot efficiently handle the sheer size of the Wikipedia graph.
","[{'version': 'v1', 'created': 'Thu, 24 Sep 2020 15:56:02 GMT'}]",2020-09-25,"[['Moskalenko', 'Oleksii', ''], ['Parra', 'Denis', ''], ['Saez-Trumper', 'Diego', '']]","['Wikipedia', 'RecSys', 'Graph Convolutional Neural Network', 'Representation Learning']"
584,1111.5721,Willy Picard,Zbigniew Paszkiewicz and Willy Picard,"MAPSS, a Multi-Aspect Partner and Service Selection Method","10 pages, 1 figure",,10.1007/978-3-642-15961-9_39,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Service-Oriented Virtual Organization Breeding Environments (SOVOBEs),
services performed by people, organizations and information systems are
composed in potentially complex business processes performed by a set of
partners. In a SOVOBE, the success of a virtual organization depends largely on
the partner and service selection process, which determines the composition of
services performed by the VO partners. In this paper requirements for a partner
and service selection method for SOVOBEs are defined and a novel Multi-Aspect
Partner and Service Selection method, MAPSS, is presented. The MAPSS method
allows a VO planner to select appropriate services and partners based on their
competences and their relations with other services/partners. The MAPSS method
relies on a genetic algorithm to select the most appropriate set of partners
and services.
","[{'version': 'v1', 'created': 'Thu, 24 Nov 2011 11:08:02 GMT'}]",2011-11-28,"[['Paszkiewicz', 'Zbigniew', ''], ['Picard', 'Willy', '']]","['partner selection', 'service selection', 'virtual organization creation', 'competence description', 'social requirement', 'genetic algorithm']"
585,1604.06570,Jubin Johnson,"Hisham Cholakkal, Jubin Johnson and Deepu Rajan",A Classifier-guided Approach for Top-down Salient Object Detection,"To appear in Signal Processing: Image Communication, Elsevier.
  Available online from April 2016",,10.1016/j.image.2016.04.001,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a framework for top-down salient object detection that
incorporates a tightly coupled image classification module. The classifier is
trained on novel category-aware sparse codes computed on object dictionaries
used for saliency modeling. A misclassification indicates that the
corresponding saliency model is inaccurate. Hence, the classifier selects
images for which the saliency models need to be updated. The category-aware
sparse coding produces better image classification accuracy as compared to
conventional sparse coding with a reduced computational complexity. A
saliency-weighted max-pooling is proposed to improve image classification,
which is further used to refine the saliency maps. Experimental results on
Graz-02 and PASCAL VOC-07 datasets demonstrate the effectiveness of salient
object detection. Although the role of the classifier is to support salient
object detection, we evaluate its performance in image classification and also
illustrate the utility of thresholded saliency maps for image segmentation.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2016 08:43:34 GMT'}]",2016-04-25,"[['Cholakkal', 'Hisham', ''], ['Johnson', 'Jubin', ''], ['Rajan', 'Deepu', '']]","['Saliency', 'Top-down saliency', 'Image classification', 'Semantic segmentation']"
586,1907.09820,Angelos Charalambidis,"Angelos Charalambidis, Christos Nomikos, Panos Rondogiannis",The Expressive Power of Higher-Order Datalog,"Paper presented at the 35th International Conference on Logic
  Programming (ICLP 2019), Las Cruces, New Mexico, USA, 20-25 September 2019,
  24 pages, LaTeX",Theory and Practice of Logic Programming 19 (2019) 925-940,10.1017/S1471068419000279,,cs.PL cs.CC cs.DB cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A classical result in descriptive complexity theory states that Datalog
expresses exactly the class of polynomially computable queries on ordered
databases. In this paper we extend this result to the case of higher-order
Datalog. In particular, we demonstrate that on ordered databases, for all
$k\geq2$, $k$-order Datalog captures $(k-1)$-EXPTIME. This result suggests that
higher-order extensions of Datalog possess superior expressive power and they
are worthwhile of further investigation both in theory and in practice. This
paper is under consideration for acceptance in TPLP.
","[{'version': 'v1', 'created': 'Tue, 23 Jul 2019 11:21:49 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Jul 2019 14:03:23 GMT'}]",2020-02-19,"[['Charalambidis', 'Angelos', ''], ['Nomikos', 'Christos', ''], ['Rondogiannis', 'Panos', '']]","['Datalog', 'Higher-Order Logic Programming', 'Descriptive Complexity Theory']"
587,1804.10026,Georgios Birpoutsoukis,"Georgios Birpoutsoukis, P\'eter Zolt\'an Csurcsia, Johan Schoukens",Efficient Multidimensional Regularization for Volterra Series Estimation,,"Birpoutsoukis, G., Csurcsia, P.Z. and Schoukens, J., 2018.
  Efficient multidimensional regularization for Volterra series estimation.
  Mechanical Systems and Signal Processing, 104, pp.896-914",10.1016/j.ymssp.2017.10.007,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an efficient nonparametric time domain nonlinear system
identification method. It is shown how truncated Volterra series models can be
efficiently estimated without the need of long, transient-free measurements.
The method is a novel extension of the regularization methods that have been
developed for impulse response estimates of linear time invariant systems. To
avoid the excessive memory needs in case of long measurements or large number
of estimated parameters, a practical gradient-based estimation method is also
provided, leading to the same numerical results as the proposed Volterra
estimation method. Moreover, the transient effects in the simulated output are
removed by a special regularization method based on the novel ideas of
transient removal for Linear Time-Varying (LTV) systems. Combining the proposed
methodologies, the nonparametric Volterra models of the cascaded water tanks
benchmark are presented in this paper. The results for different scenarios
varying from a simple Finite Impulse Response (FIR) model to a 3rd degree
Volterra series with and without transient removal are compared and studied. It
is clear that the obtained models capture the system dynamics when tested on a
validation dataset, and their performance is comparable with the white-box
(physical) models.
","[{'version': 'v1', 'created': 'Thu, 26 Apr 2018 12:50:08 GMT'}]",2018-04-27,"[['Birpoutsoukis', 'Georgios', ''], ['Csurcsia', 'Péter Zoltán', ''], ['Schoukens', 'Johan', '']]","['Volterra series', 'Regularization', 'Cascaded water tanks benchmark', 'Kernel-based regression', 'Transient elimination']"
588,1801.04898,Samuel Way,Daniel T. Citron and Samuel F. Way,"Network assembly of scientific communities of varying size and
  specificity","22 pages, 13 figures","Journal of Informetrics, Volume 12, Issue 1, 2018, Pages 181-190",10.1016/j.joi.2017.12.008,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  How does the collaboration network of researchers coalesce around a
scientific topic? What sort of social restructuring occurs as a new field
develops? Previous empirical explorations of these questions have examined the
evolution of co-authorship networks associated with several fields of science,
each noting a characteristic shift in network structure as fields develop.
Historically, however, such studies have tended to rely on manually annotated
datasets and therefore only consider a handful of disciplines, calling into
question the universality of the observed structural signature.To overcome this
limitation and test the robustness of this phenomenon, we use a comprehensive
dataset of over 189,000 scientific articles and develop a framework for
partitioning articles and their authors into coherent, semantically-related
groups representing scientific fields of varying size and specificity. We then
use the resulting population of fields to study the structure of evolving
co-authorship networks. Consistent with earlier findings, we observe a global
topological transition as the co-authorship networks coalesce from a disjointed
aggregate into a dense giant connected component that dominates the network. We
validate these results using a separate, complimentary corpus of scientific
articles, and, overall, we find that the previously reported characteristic
structural evolution of a scientific field's associated co-authorship network
is robust across a large number of scientific fields of varying size, scope,
and specificity. Additionally, the framework developed in this study may be
used in other scientometric contexts in order to extend studies to compare
across a larger range of scientific disciplines.
","[{'version': 'v1', 'created': 'Mon, 15 Jan 2018 18:15:46 GMT'}]",2018-01-16,"[['Citron', 'Daniel T.', ''], ['Way', 'Samuel F.', '']]","['collaboration networks', 'network assembly', 'social network analysis', 'topic modeling', 'scientometrics']"
589,1904.03855,J{\o}rgen Nordmoen,"J{\o}rgen Nordmoen and T{\o}nnes F. Nygaard, Kai Olav Ellefsen and
  Kyrre Glette","Evolved embodied phase coordination enables robust quadruped robot
  locomotion",9 pages,"Genetic and Evolutionary Computation Conference (GECCO 19), July
  13-17, 2019, Prague, Czech Republic. ACM, New York, NY, USA",10.1145/3321707.3321762,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Overcoming robotics challenges in the real world requires resilient control
systems capable of handling a multitude of environments and unforeseen events.
Evolutionary optimization using simulations is a promising way to automatically
design such control systems, however, if the disparity between simulation and
the real world becomes too large, the optimization process may result in
dysfunctional real-world behaviors. In this paper, we address this challenge by
considering embodied phase coordination in the evolutionary optimization of a
quadruped robot controller based on central pattern generators. With this
method, leg phases, and indirectly also inter-leg coordination, are influenced
by sensor feedback.By comparing two very similar control systems we gain
insight into how the sensory feedback approach affects the evolved parameters
of the control system, and how the performances differs in simulation, in
transferal to the real world, and to different real-world environments. We show
that evolution enables the design of a control system with embodied phase
coordination which is more complex than previously seen approaches, and that
this system is capable of controlling a real-world multi-jointed quadruped
robot.The approach reduces the performance discrepancy between simulation and
the real world, and displays robustness towards new environments.
","[{'version': 'v1', 'created': 'Mon, 8 Apr 2019 06:04:26 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Apr 2019 07:47:23 GMT'}]",2019-04-12,"[['Nordmoen', 'Jørgen', ''], ['Nygaard', 'Tønnes F.', ''], ['Ellefsen', 'Kai Olav', ''], ['Glette', 'Kyrre', '']]","['TEGOTAE', 'CPG', 'evolutionary robotics']"
590,1603.00696,Oscar Hern\'an Paruma Pab\'on,"Oscar Hern\'an Paruma-Pab\'on, Fabio A. Gonz\'alez, Jairo Aponte,
  Jorge E. Camargo, Felipe Restrepo-Calle","Finding Relationships between Socio-Technical Aspects and Personality
  Traits by Mining Developer E-mails","7 pages, ICSE 2016 - Workshop on Cooperative and Human Aspects of
  Software Engineering (CHASE)",,10.1145/2897586.2897611,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Personality traits influence most, if not all, of the human activities, from
those as natural as the way people walk, talk, dress and write to those most
complex as the way they interact with others. Most importantly, personality
influences the way people make decisions including, in the case of developers,
the criteria they consider when selecting a software project they want to
participate. Most of the works that study the influence of social, technical
and human factors in software development projects have been focused on the
impact of communications in software quality. For instance, on identifying
predictors to detect files that may contain bugs before releasing an enhanced
version of a software product. Only a few of these works focus on the analysis
of personality traits of developers with commit permissions (committers) in
Free/Libre and Open-Source Software projects and their relationship with the
software artifacts they interact with. This paper presents an approach, based
on the automatic recognition of personality traits from e-mails sent by
committers in FLOSS projects, to uncover relationships between the social and
technical aspects that occur during the software development process. Our
experimental results suggest the existence of some relationships among
personality traits projected by the committers through their e-mails and the
social (communication) and technical activities they undertake. This work is a
preliminary study aimed at supporting the setting up of efficient work teams in
software development projects based on an appropriate mix of stakeholders
taking into account their personality traits.
","[{'version': 'v1', 'created': 'Wed, 2 Mar 2016 13:09:02 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Mar 2016 21:45:06 GMT'}]",2016-03-07,"[['Paruma-Pabón', 'Oscar Hernán', ''], ['González', 'Fabio A.', ''], ['Aponte', 'Jairo', ''], ['Camargo', 'Jorge E.', ''], ['Restrepo-Calle', 'Felipe', '']]","['socio-technical aspects', 'FLOSS', 'personality traits', 'sourcecode repository', 'mailing lists', 'email communication']"
591,2108.01427,Alain Starke,"Arngeir Berge, Vegard Velle Sj{\o}en, Alain D. Starke, Christoph
  Trattner","Changing Salty Food Preferences with Visual and Textual Explanations in
  a Search Interface","8 pages, 6 figures, HEALTHI workshop in conjunction with the ACM IUI
  conference","Joint Proceedings of the ACM IUI 2021 Workshops, 2021, College
  Station, USA",,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Salt is consumed at too high levels in the general population, causing high
blood pressure and related health problems. In this paper, we present results
of ongoing research that tries to reduce salt intake via technology and in
particular from an interface perspective. In detail, this paper features
results of a study that examines the extent to which visual and textual
explanations in a search interface can change salty food preferences. An online
user study with 200 participants demonstrates that this is possible in food
search results by accompanying recipes with a visual taste map that includes
salt-replacer herbs and spices in the calculation of salty taste.
","[{'version': 'v1', 'created': 'Tue, 3 Aug 2021 11:58:05 GMT'}]",2021-08-04,"[['Berge', 'Arngeir', ''], ['Sjøen', 'Vegard Velle', ''], ['Starke', 'Alain D.', ''], ['Trattner', 'Christoph', '']]","['Food Preferences', 'Salt', 'Sodium Replacement', 'Search Interface', 'Explanations']"
592,1608.07352,Shanyu Zhou,Shanyu Zhou and Hulya Seferoglu,"Connectivity-Aware Traffic Phase Scheduling for Heterogeneously
  Connected Vehicles",,,10.1145/2980100.2980105,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a transportation system of heterogeneously connected vehicles,
where not all vehicles are able to communicate. Heterogeneous connectivity in
transportation systems is coupled to practical constraints such that (i) not
all vehicles may be equipped with devices having communication interfaces, (ii)
some vehicles may not prefer to communicate due to privacy and security
reasons, and (iii) communication links are not perfect and packet losses and
delay occur in practice. In this context, it is crucial to develop control
algorithms by taking into account the heterogeneity. In this paper, we
particularly focus on making traffic phase scheduling decisions. We develop a
connectivity-aware traffic phase scheduling algorithm for heterogeneously
connected vehicles that increases the intersection efficiency (in terms of the
average number of vehicles that are allowed to pass the intersection) by taking
into account the heterogeneity. The simulation results show that our algorithm
significantly improves the efficiency of intersections as compared to the
baselines.
","[{'version': 'v1', 'created': 'Fri, 26 Aug 2016 02:41:05 GMT'}]",2016-08-29,"[['Zhou', 'Shanyu', ''], ['Seferoglu', 'Hulya', '']]","['Cyber-physical systems', 'transportation systems', 'connectedvehicles', 'heterogeneous communication']"
593,1604.00103,Jun Kawahara,Shoji Kasahara and Jun Kawahara,Effect of Bitcoin fee on transaction-confirmation process,,,10.3934/jimo.2018047,,cs.CR cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Bitcoin system, transactions are prioritized according to transaction
fees. Transactions without fees are given low priority and likely to wait for
confirmation. Because the demand of micro payment in Bitcoin is expected to
increase due to low remittance cost, it is important to quantitatively
investigate how transactions with small fees of Bitcoin affect the
transaction-confirmation time. In this paper, we analyze the
transaction-confirmation time by queueing theory. We model the
transaction-confirmation process of Bitcoin as a priority queueing system with
batch service, deriving the mean transaction-confirmation time. Numerical
examples show how the demand of transactions with low fees affects the
transaction-confirmation time. We also consider the effect of the maximum block
size on the transaction-confirmation time.
","[{'version': 'v1', 'created': 'Fri, 1 Apr 2016 02:15:02 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Apr 2016 05:41:58 GMT'}, {'version': 'v3', 'created': 'Tue, 30 May 2017 05:09:19 GMT'}]",2020-03-10,"[['Kasahara', 'Shoji', ''], ['Kawahara', 'Jun', '']]","['Bitcoin', 'blockchain', 'fee', 'transaction-confirmation time', 'priority queue']"
594,1804.10905,Ashish Mani Dr.,"Arit Kumar Bishwas, Ashish Mani, and Vasile Palade","An Investigation on Support Vector Clustering for Big Data in Quantum
  Paradigm",,"Quantum Information Processing volume 19, Article number: 108
  (2020)",10.1007/s11128-020-2606-x,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The support vector clustering algorithm is a well-known clustering algorithm
based on support vector machines using Gaussian or polynomial kernels. The
classical support vector clustering algorithm works well in general, but its
performance degrades when applied on big data. In this paper, we have
investigated the performance of support vector clustering algorithm implemented
in a quantum paradigm for possible run-time improvements. We have developed and
analyzed a quantum version of the support vector clustering algorithm. The
proposed approach is based on the quantum support vector machine and quantum
kernels (i.e., Gaussian and polynomial). The proposed quantum version of the
SVM clustering method demonstrates a significant speed-up gain on the overall
run-time complexity as compared to the classical counterpart.
","[{'version': 'v1', 'created': 'Sun, 29 Apr 2018 11:09:40 GMT'}, {'version': 'v2', 'created': 'Sun, 2 Feb 2020 12:42:55 GMT'}]",2020-05-27,"[['Bishwas', 'Arit Kumar', ''], ['Mani', 'Ashish', ''], ['Palade', 'Vasile', '']]","['Quantum Algorithm', 'Clustering', 'Support Vector Machines', 'Quantum Random Access Memory']"
595,1502.01951,Lu\'is Tarrayava,Lu\'is Tarrataca and Andreas Wichert,Tree Search and Quantum Computation,,"Quantum Information Processing, 2011, 10:4, 475-500",10.1007/s11128-010-0212-z,,cs.DS quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional tree search algorithms supply a blueprint for modeling problem
solving behaviour. A diverse spectrum of problems can be formulated in terms of
tree search. Quantum computation, in particular Grover's algorithm, has aroused
a great deal of interest since it allows for a quadratic speedup to be obtained
in search procedures. In this work we consider the impact of incorporating
classical search concepts alongside Grover's algorithm into a hybrid quantum
search system. Some of the crucial points examined include: (1) the
reverberations of contemplating the use of non-constant branching factors; (2)
determining the consequences of incorporating an heuristic perspective into a
quantum tree search model.
","[{'version': 'v1', 'created': 'Fri, 6 Feb 2015 16:55:10 GMT'}]",2015-02-09,"[['Tarrataca', 'Luís', ''], ['Wichert', 'Andreas', '']]","['quantum computation', 'tree search', 'heuristic']"
596,1609.06578,Kar Wai Lim,"Kar Wai Lim, Wray Buntine","Twitter Opinion Topic Model: Extracting Product Opinions from Tweets by
  Leveraging Hashtags and Sentiment Lexicon",CIKM paper,"Proceedings of the 23rd ACM International Conference on
  Information and Knowledge Management (CIKM), pp. 1319-1328. ACM. 2014",10.1145/2661829.2662005,,cs.CL cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aspect-based opinion mining is widely applied to review data to aggregate or
summarize opinions of a product, and the current state-of-the-art is achieved
with Latent Dirichlet Allocation (LDA)-based model. Although social media data
like tweets are laden with opinions, their ""dirty"" nature (as natural language)
has discouraged researchers from applying LDA-based opinion model for product
review mining. Tweets are often informal, unstructured and lacking labeled data
such as categories and ratings, making it challenging for product opinion
mining. In this paper, we propose an LDA-based opinion model named Twitter
Opinion Topic Model (TOTM) for opinion mining and sentiment analysis. TOTM
leverages hashtags, mentions, emoticons and strong sentiment words that are
present in tweets in its discovery process. It improves opinion prediction by
modeling the target-opinion interaction directly, thus discovering target
specific opinion words, neglected in existing approaches. Moreover, we propose
a new formulation of incorporating sentiment prior information into a topic
model, by utilizing an existing public sentiment lexicon. This is novel in that
it learns and updates with the data. We conduct experiments on 9 million tweets
on electronic products, and demonstrate the improved performance of TOTM in
both quantitative evaluations and qualitative analysis. We show that
aspect-based opinion analysis on massive volume of tweets provides useful
opinions on products.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2016 14:25:23 GMT'}]",2016-09-22,"[['Lim', 'Kar Wai', ''], ['Buntine', 'Wray', '']]","['Opinion mining', 'sentiment analysis', 'Twitter', 'topic modeling', 'product review', 'sentiment lexicon', 'emoticons']"
597,2102.09965,Mahieddine Djoudi,"Hichem Rahab, Abdelhafid Zitouni, Mahieddine Djoudi (TECHN\'E - EA
  6316)",An Enhanced Corpus for Arabic Newspapers Comments,arXiv admin note: substantial text overlap with arXiv:2006.00459,"International Arab Journal of Information Technology, Colleges of
  Computing and Information Society (CCIS), 2020, 17 (5), pp.789-798",10.34028/iajit/17/5/12,,cs.IR cs.CL cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose our enhanced approach to create a dedicated corpus
for Algerian Arabic newspapers comments. The developed approach has to enhance
an existing approach by the enrichment of the available corpus and the
inclusion of the annotation step by following the Model Annotate Train Test
Evaluate Revise (MATTER) approach. A corpus is created by collecting comments
from web sites of three well know Algerian newspapers. Three classifiers,
support vector machines, na{\""i}ve Bayes, and k-nearest neighbors, were used
for classification of comments into positive and negative classes. To identify
the influence of the stemming in the obtained results, the classification was
tested with and without stemming. Obtained results show that stemming does not
enhance considerably the classification due to the nature of Algerian comments
tied to Algerian Arabic Dialect. The promising results constitute a motivation
for us to improve our approach especially in dealing with non Arabic sentences,
especially Dialectal and French ones.
","[{'version': 'v1', 'created': 'Mon, 8 Feb 2021 10:15:44 GMT'}]",2021-02-22,"[['Rahab', 'Hichem', '', 'TECHNÉ - EA\n  6316'], ['Zitouni', 'Abdelhafid', '', 'TECHNÉ - EA\n  6316'], ['Djoudi', 'Mahieddine', '', 'TECHNÉ - EA\n  6316']]","['Opinion mining', 'sentiment analysis', 'K-Nearest Neighbours', 'Naïve Bayes', 'Support Vector Machines', 'Arabic', 'comment']"
598,1111.2618,Brian Day,"Brian P. Day, Adam R. Margetts, Daniel W. Bliss, and Philip Schniter",Full-Duplex MIMO Relaying: Achievable Rates under Limited Dynamic Range,,,10.1109/TSP.2012.2192925,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider the problem of full-duplex multiple-input
multiple-output (MIMO) relaying between multi-antenna source and destination
nodes. The principal difficulty in implementing such a system is that, due to
the limited attenuation between the relay's transmit and receive antenna
arrays, the relay's outgoing signal may overwhelm its limited-dynamic-range
input circuitry, making it difficult---if not impossible---to recover the
desired incoming signal. While explicitly modeling transmitter/receiver
dynamic-range limitations and channel estimation error, we derive tight upper
and lower bounds on the end-to-end achievable rate of decode-and-forward-based
full-duplex MIMO relay systems, and propose a transmission scheme based on
maximization of the lower bound. The maximization requires us to (numerically)
solve a nonconvex optimization problem, for which we detail a novel approach
based on bisection search and gradient projection. To gain insights into system
design tradeoffs, we also derive an analytic approximation to the achievable
rate and numerically demonstrate its accuracy. We then study the behavior of
the achievable rate as a function of signal-to-noise ratio,
interference-to-noise ratio, transmitter/receiver dynamic range, number of
antennas, and training length, using optimized half-duplex signaling as a
baseline.
","[{'version': 'v1', 'created': 'Thu, 10 Nov 2011 21:26:25 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Mar 2012 18:27:12 GMT'}, {'version': 'v3', 'created': 'Tue, 15 May 2012 02:34:13 GMT'}, {'version': 'v4', 'created': 'Thu, 17 May 2012 15:42:52 GMT'}]",2015-06-03,"[['Day', 'Brian P.', ''], ['Margetts', 'Adam R.', ''], ['Bliss', 'Daniel W.', ''], ['Schniter', 'Philip', '']]","['MIMO relays', 'full-duplex relays', 'limited dynamicrange', 'channel estimation']"
599,1405.7903,Carsten Gottschlich,Carsten Gottschlich and Dominic Schuhmacher,"The Shortlist Method for Fast Computation of the Earth Mover's Distance
  and Finding Optimal Solutions to Transportation Problems",,"PLOS ONE 9(10): e110214, Oct. 2014",10.1371/journal.pone.0110214,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finding solutions to the classical transportation problem is of great
importance, since this optimization problem arises in many engineering and
computer science applications. Especially the Earth Mover's Distance is used in
a plethora of applications ranging from content-based image retrieval, shape
matching, fingerprint recognition, object tracking and phishing web page
detection to computing color differences in linguistics and biology. Our
starting point is the well-known revised simplex algorithm, which iteratively
improves a feasible solution to optimality. The Shortlist Method that we
propose substantially reduces the number of candidates inspected for improving
the solution, while at the same time balancing the number of pivots required.
Tests on simulated benchmarks demonstrate a considerable reduction in
computation time for the new method as compared to the usual revised simplex
algorithm implemented with state-of-the-art initialization and pivot
strategies. As a consequence, the Shortlist Method facilitates the computation
of large scale transportation problems in viable time. In addition we describe
a novel method for finding an initial feasible solution which we coin Modified
Russell's Method.
","[{'version': 'v1', 'created': 'Fri, 30 May 2014 16:07:55 GMT'}]",2014-10-15,"[['Gottschlich', 'Carsten', ''], ['Schuhmacher', 'Dominic', '']]","['Transportation problem', 'revised simplex method', 'earth mover’s distance', 'EMD', 'Wasserstein distance', 'Monge-Kantorovich problem']"
600,1203.6439,Gopalakrishnan Tr Nair,"T.R. Gopalakrishnan Nair, V. Suma, N. R. Shashi Kumar","An Analytical Approach for Project Managers in Effective Defect
  Management in Software Process","7 Pages, 8 Figures, 4 Tables 2011 5th Malaysian Conference in
  Software Engineering (MySEC)",2011 5th Malaysian Conference in Software Engineering (MySEC),10.1109/MySEC.2011.6140669,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Defect estimation and prediction are some of the main modulating factors for
the success of software projects in any software industry. Maturity and
competency of a project manager in efficient prediction and estimation of
resource capabilities are one of the strategic driving forces towards the
generation of high quality software. Currently, there are no estimation
techniques developed through empirical analysis to evaluate the decision
capability of a project manager towards resource allocation for effective
defect management. This paper brings out an empirical study carried out in a
product based software organization. Our deep investigation on several projects
throws light on the impact of decision capability of project manager towards
accomplishment of an aforementioned objective. The paper enables project
managers to gain further awareness towards the significance of predictive
positioning in resource allocation in order to develop high quality defect-free
software products. It also enhances the maturity level of the company and its
persistence in the competitive atmosphere.
","[{'version': 'v1', 'created': 'Thu, 29 Mar 2012 06:23:13 GMT'}]",2012-03-30,"[['Nair', 'T. R. Gopalakrishnan', ''], ['Suma', 'V.', ''], ['Kumar', 'N. R. Shashi', '']]","['Defect Management', 'Project Manager', 'Inspection', 'Testing', 'Software Engineering']"
601,1901.11477,Amarnath R,Amarnath R and P Nagabhushan,"Text line Segmentation in Compressed Representation of Handwritten
  Document using Tunneling Algorithm","Compressed Representation, Handwritten Document Image, Text-Line
  Terminal Point, Text-Line Segmentation, Search Space, Grid","International Journal of Intelligent Systems and Applications in
  Engineering, Vol 6, No 4 (2018)",10.18201/ijisae.2018448451,,cs.CV cs.AI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this research work, we perform text line segmentation directly in
compressed representation of an unconstrained handwritten document image. In
this relation, we make use of text line terminal points which is the current
state-of-the-art. The terminal points spotted along both margins (left and
right) of a document image for every text line are considered as source and
target respectively. The tunneling algorithm uses a single agent (or robot) to
identify the coordinate positions in the compressed representation to perform
text-line segmentation of the document. The agent starts at a source point and
progressively tunnels a path routing in between two adjacent text lines and
reaches the probable target. The agent's navigation path from source to the
target bypassing obstacles, if any, results in segregating the two adjacent
text lines. However, the target point would be known only when the agent
reaches the destination; this is applicable for all source points and
henceforth we could analyze the correspondence between source and target nodes.
Artificial Intelligence in Expert systems, dynamic programming and greedy
strategies are employed for every search space while tunneling. An exhaustive
experimentation is carried out on various benchmark datasets including ICDAR13
and the performances are reported.
","[{'version': 'v1', 'created': 'Thu, 3 Jan 2019 05:19:38 GMT'}]",2019-02-01,"[['R', 'Amarnath', ''], ['Nagabhushan', 'P', '']]","['Compressed Representation', 'Handwritten Document Image', 'Text-Line Terminal Point', 'Text-Line Segmentation', 'Search Space', 'Grid']"
602,1003.3564,Secretary Aircc Journal,"S. Sumathy (1) and B.Upendra Kumar (1) ((1) VIT University, India)","Secure Key Exchange and Encryption Mechanism for Group Communication in
  Wireless Ad Hoc Networks","8 Pages, JGraph-Hoc Journal","International journal on applications of graph theory in wireless
  ad hoc networks and sensor networks 2.1 (2010) 9-16",10.5121/jgraphhoc.2010.2102,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Secured communication in ad hoc wireless networks is primarily important,
because the communication signals are openly available as they propagate
through air and are more susceptible to attacks ranging from passive
eavesdropping to active interfering. The lack of any central coordination and
shared wireless medium makes them more vulnerable to attacks than wired
networks. Nodes act both as hosts and routers and are interconnected by Multi-
hop communication path for forwarding and receiving packets to/from other
nodes. The objective of this paper is to propose a key exchange and encryption
mechanism that aims to use the MAC address as an additional parameter as the
message specific key[to encrypt]and forward data among the nodes. The nodes are
organized in spanning tree fashion, as they avoid forming cycles and exchange
of key occurs only with authenticated neighbors in ad hoc networks, where nodes
join or leave the network dynamically.
","[{'version': 'v1', 'created': 'Thu, 18 Mar 2010 11:55:01 GMT'}]",2010-07-15,"[['Sumathy', 'S.', '', 'VIT University, India'], ['Kumar', 'B. Upendra', '', 'VIT University, India']]","['Ad hoc networks', 'Spanning tree', 'Neighborhood key', 'Message specific key']"
603,1903.03268,Felix Hamza-Lup,"Felix G. Hamza-Lup, Crenguta M. Bogdan, Adrian Seitan",Haptic Simulator for Liver Diagnostics through Palpation,,"Medicine Meets Virtual Reality 19, 2012, pp.156-160",10.3233/978--1--61499--022--2--156,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mechanical properties of biological tissue for both histological and
pathological considerations are often required in disease diagnostics. Such
properties can be simulated and explored with haptic technology. Development of
cost effective haptic-based simulators and their introduction in the minimally
invasive surgery learning cycle is still in its infancy. Receiving pretraining
in a core set of surgical skills can reduce skill acquisition time and risks.
We present the development of a visuo-haptic simulator module designed to train
internal organs disease diagnostics through palpation. The module is part of a
set of tools designed to train and improve basic surgical skills for minimally
invasive surgery.
","[{'version': 'v1', 'created': 'Fri, 8 Mar 2019 03:50:21 GMT'}]",2019-03-11,"[['Hamza-Lup', 'Felix G.', ''], ['Bogdan', 'Crenguta M.', ''], ['Seitan', 'Adrian', '']]","['haptic', 'diagnostics', 'minimally invasive surgery']"
604,1507.05500,Ioannis Kokkinis,Ioannis Kokkinis,The Complexity of Non-Iterated Probabilistic Justification Logic,,,10.1007/978-3-319-30024-5_16,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The logic PJ is a probabilistic logic defined by adding (non-iterated)
probability operators to the basic justification logic J. In this paper we
establish upper and lower bounds for the complexity of the derivability problem
in the logic PJ. The main result of the paper is that the complex- ity of the
derivability problem in PJ remains the same as the complexity of the
derivability problem in the underlying logic J, which is {\Pi}p2-complete. This
implies hat the probability operators do not increase the complex- ity of the
logic, although they arguably enrich the expressiveness of the language.
","[{'version': 'v1', 'created': 'Mon, 20 Jul 2015 13:59:15 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Jul 2015 08:32:41 GMT'}, {'version': 'v3', 'created': 'Thu, 5 Jul 2018 10:55:22 GMT'}]",2018-07-06,"[['Kokkinis', 'Ioannis', '']]","['justification logic', 'probabilistic logic', 'complexity', 'derivability', 'satisfiability']"
605,1601.07232,Renato J Cintra,"R. J. Cintra, T. V. Cooklev",Robust Image Watermarking Using Non-Regular Wavelets,"13 pages, 11 figures","Signal, Image and Video Processing, September 2009, Volume 3,
  Issue 3, pp 241-250",10.1007/s11760-008-0070-7,,cs.MM cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An approach to watermarking digital images using non-regular wavelets is
advanced. Non-regular transforms spread the energy in the transform domain. The
proposed method leads at the same time to increased image quality and increased
robustness with respect to lossy compression. The approach provides robust
watermarking by suitably creating watermarked messages that have energy
compaction and frequency spreading. Our experimental results show that the
application of non-regular wavelets, instead of regular ones, can furnish a
superior robust watermarking scheme. The generated watermarked data is more
immune against non-intentional JPEG and JPEG2000 attacks.
","[{'version': 'v1', 'created': 'Wed, 27 Jan 2016 00:18:26 GMT'}]",2016-01-28,"[['Cintra', 'R. J.', ''], ['Cooklev', 'T. V.', '']]","['Robust watermarking', 'non-regular wavelets', 'JPEG compression']"
606,1003.5238,Tuhin Sahai,"Stefan Klus, Tuhin Sahai, Cong Liu and Michael Dellnitz","An efficient algorithm for the parallel solution of high-dimensional
  differential equations",,,10.1016/j.cam.2010.12.026,,cs.DC math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The study of high-dimensional differential equations is challenging and
difficult due to the analytical and computational intractability. Here, we
improve the speed of waveform relaxation (WR), a method to simulate
high-dimensional differential-algebraic equations. This new method termed
adaptive waveform relaxation (AWR) is tested on a communication network
example. Further we propose different heuristics for computing graph partitions
tailored to adaptive waveform relaxation. We find that AWR coupled with
appropriate graph partitioning methods provides a speedup by a factor between 3
and 16.
","[{'version': 'v1', 'created': 'Fri, 26 Mar 2010 21:30:08 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Aug 2010 18:42:48 GMT'}, {'version': 'v3', 'created': 'Tue, 26 Oct 2010 19:56:42 GMT'}]",2019-08-14,"[['Klus', 'Stefan', ''], ['Sahai', 'Tuhin', ''], ['Liu', 'Cong', ''], ['Dellnitz', 'Michael', '']]","['waveform relaxation', 'adaptive windowing', 'graph partitioning', 'Petri nets', 'parallelalgorithms']"
607,1701.04581,Suchi Kumari,Suchi Kumari and Anurag Singh,"Modeling and Performance Studies of Data Communication Networks using
  Dynamic Complex Networks",,"Advances in Complex Systems Vol. 25, No. 1 (2018) 1850006 (27
  pages)",10.1142/S0219525918500066,1850006,cs.NI cs.SI,http://creativecommons.org/licenses/by/4.0/,"  All the existing real world networks are evolving, hence, study of traffic
dynamics in these enlarged networks is a challenging task. The critical issue
is to optimize the network structure to improve network capacity and avoid
traffic congestion. We are interested in taking user's routes such that it is
least congested with optimal network capacity. Network capacity may be improved
either by optimizing network topology or enhancing in routing approach. In this
context, we propose and design a model of the time varying data communication
networks (TVCN) based on the dynamics of in-flowing links. Newly appeared node
prefers to attach with most influential node present in the network. In this
paper, influence is termed as \textit{reputation} and is applied for computing
overall congestion at any node. User path with least betweenness centrality and
most reputation is preferred for routing. Kelly's optimization formulation for
a rate allocation problem is used for obtaining optimal rates of distinct users
at different time instants and it is found that the user's path with lowest
betweenness centrality and highest reputation will always give maximum rate at
stable point.
","[{'version': 'v1', 'created': 'Tue, 17 Jan 2017 09:11:14 GMT'}]",2018-11-19,"[['Kumari', 'Suchi', ''], ['Singh', 'Anurag', '']]","['Data Communication Networks', 'Time varying Networks model', 'System Utility', 'Routing']"
608,2211.00572,Chang Liu,"Chang Liu, Yuwen Yang, Zhe Xie, Hongtao Lu, Yue Ding",Position-Aware Subgraph Neural Networks with Data-Efficient Learning,"9 pages, 7 figures, accepted by WSDM 23","Proceedings of the Sixteenth ACM International Conference on Web
  Search and Data Mining, February 27-March 3, 2023",10.1145/3539597.3570429,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Data-efficient learning on graphs (GEL) is essential in real-world
applications. Existing GEL methods focus on learning useful representations for
nodes, edges, or entire graphs with ``small'' labeled data. But the problem of
data-efficient learning for subgraph prediction has not been explored. The
challenges of this problem lie in the following aspects: 1) It is crucial for
subgraphs to learn positional features to acquire structural information in the
base graph in which they exist. Although the existing subgraph neural network
method is capable of learning disentangled position encodings, the overall
computational complexity is very high. 2) Prevailing graph augmentation methods
for GEL, including rule-based, sample-based, adaptive, and automated methods,
are not suitable for augmenting subgraphs because a subgraph contains fewer
nodes but richer information such as position, neighbor, and structure.
Subgraph augmentation is more susceptible to undesirable perturbations. 3) Only
a small number of nodes in the base graph are contained in subgraphs, which
leads to a potential ``bias'' problem that the subgraph representation learning
is dominated by these ``hot'' nodes. By contrast, the remaining nodes fail to
be fully learned, which reduces the generalization ability of subgraph
representation learning. In this paper, we aim to address the challenges above
and propose a Position-Aware Data-Efficient Learning framework for subgraph
neural networks called PADEL. Specifically, we propose a novel node position
encoding method that is anchor-free, and design a new generative subgraph
augmentation method based on a diffused variational subgraph autoencoder, and
we propose exploratory and exploitable views for subgraph contrastive learning.
Extensive experiment results on three real-world datasets show the superiority
of our proposed method over state-of-the-art baselines.
","[{'version': 'v1', 'created': 'Tue, 1 Nov 2022 16:34:42 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Dec 2022 09:38:12 GMT'}]",2022-12-09,"[['Liu', 'Chang', ''], ['Yang', 'Yuwen', ''], ['Xie', 'Zhe', ''], ['Lu', 'Hongtao', ''], ['Ding', 'Yue', '']]","['subgraph neural networks', 'contrastive learning', 'generative model', 'data-efficient learning']"
609,1409.2908,Austin Benson,Austin R. Benson and Grey Ballard,A Framework for Practical Parallel Fast Matrix Multiplication,,"Proceedings of the 20th ACM SIGPLAN Symposium on Principles and
  Practice of Parallel Programming (PPoPP), 2015",10.1145/2858788.2688513,,cs.DC cs.MS cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Matrix multiplication is a fundamental computation in many scientific
disciplines. In this paper, we show that novel fast matrix multiplication
algorithms can significantly outperform vendor implementations of the classical
algorithm and Strassen's fast algorithm on modest problem sizes and shapes.
Furthermore, we show that the best choice of fast algorithm depends not only on
the size of the matrices but also the shape. We develop a code generation tool
to automatically implement multiple sequential and shared-memory parallel
variants of each fast algorithm, including our novel parallelization scheme.
This allows us to rapidly benchmark over 20 fast algorithms on several problem
sizes. Furthermore, we discuss a number of practical implementation issues for
these algorithms on shared-memory machines that can direct further research on
making fast algorithms practical.
","[{'version': 'v1', 'created': 'Tue, 9 Sep 2014 22:28:36 GMT'}]",2018-01-08,"[['Benson', 'Austin R.', ''], ['Ballard', 'Grey', '']]","['fast matrix multiplication', 'dense linear algebra', 'parallel linear algebra', 'shared memory']"
610,1507.06566,Mark Law,"Mark Law, Alessandra Russo and Krysia Broda",Learning Weak Constraints in Answer Set Programming,"To appear in Theory and Practice of Logic Programming (TPLP),
  Proceedings of ICLP 2015",Theory and Practice of Logic Programming 15 (2015) 511-525,10.1017/S1471068415000198,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper contributes to the area of inductive logic programming by
presenting a new learning framework that allows the learning of weak
constraints in Answer Set Programming (ASP). The framework, called Learning
from Ordered Answer Sets, generalises our previous work on learning ASP
programs without weak constraints, by considering a new notion of examples as
ordered pairs of partial answer sets that exemplify which answer sets of a
learned hypothesis (together with a given background knowledge) are preferred
to others. In this new learning task inductive solutions are searched within a
hypothesis space of normal rules, choice rules, and hard and weak constraints.
We propose a new algorithm, ILASP2, which is sound and complete with respect to
our new learning framework. We investigate its applicability to learning
preferences in an interview scheduling problem and also demonstrate that when
restricted to the task of learning ASP programs without weak constraints,
ILASP2 can be much more efficient than our previously proposed system.
","[{'version': 'v1', 'created': 'Thu, 23 Jul 2015 17:03:39 GMT'}]",2020-02-19,"[['Law', 'Mark', ''], ['Russo', 'Alessandra', ''], ['Broda', 'Krysia', '']]","['Non-monotonic Inductive Logic Programming', 'Preference Learning', 'Answer Set Programming']"
611,1402.1348,Deepak Nayak Ranjan,"Deepak Ranjan Nayak, Sumit Kumar Sahu and Jahangir Mohammed","A Cellular Automata based Optimal Edge Detection Technique using
  Twenty-Five Neighborhood Model","7 pages, 9 figures","International Journal of Computer Applications, Volume 84, Number
  10, Year of Publication: 2013",10.5120/14614-2869,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cellular Automata (CA) are common and most simple models of parallel
computations. Edge detection is one of the crucial task in image processing,
especially in processing biological and medical images. CA can be successfully
applied in image processing. This paper presents a new method for edge
detection of binary images based on two dimensional twenty five neighborhood
cellular automata. The method considers only linear rules of CA for extraction
of edges under null boundary condition. The performance of this approach is
compared with some existing edge detection techniques. This comparison shows
that the proposed method to be very promising for edge detection of binary
images. All the algorithms and results used in this paper are prepared in
MATLAB.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2014 13:32:39 GMT'}]",2014-02-07,"[['Nayak', 'Deepak Ranjan', ''], ['Sahu', 'Sumit Kumar', ''], ['Mohammed', 'Jahangir', '']]","['CA', 'TFNCA', 'Edge Detection', 'Neighborhood', 'Linear Rule', 'Null-Boundary']"
612,1707.07277,Anton V. Proskurnikov,"Yuri A. Kapitanyuk, Anton V. Proskurnikov, Ming Cao",Optimal Universal Controllers for Roll Stabilization,,,10.1016/j.oceaneng.2019.106911,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Roll stabilization is an important problem of ship motion control. This
problem becomes especially difficult if the same set of actuators (e.g. a
single rudder) has to be used for roll stabilization and heading control of the
vessel, so that the roll stabilizing system interferes with the ship autopilot.
Finding the ""trade-off"" between the concurrent goals of accurate vessel
steering and roll stabilization usually reduces to an optimization problem,
which has to be solved in presence of an unknown wave disturbance. Standard
approaches to this problem (loop-shaping, LQG, $H_{\infty}$-control etc.)
require to know the spectral density of the disturbance, considered to be a
\colored noise"". In this paper, we propose a novel approach to optimal roll
stabilization, approximating the disturbance by a polyharmonic signal with
known frequencies yet uncertain amplitudes and phase shifts. Linear quadratic
optimization problems in presence of polyharmonic disturbances can be solved by
means of the theory of universal controllers developed by V.A. Yakubovich. An
optimal universal controller delivers the optimal solution for any uncertain
amplitudes and phases. Using Marine Systems Simulator (MSS) Toolbox that
provides a realistic vessel's model, we compare our design method with
classical approaches to optimal roll stabilization. Among three controllers
providing the same quality of yaw steering, OUC stabilizes the roll motion most
efficiently.
","[{'version': 'v1', 'created': 'Sun, 23 Jul 2017 10:37:22 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Jul 2017 16:38:33 GMT'}, {'version': 'v3', 'created': 'Mon, 16 Jul 2018 10:44:27 GMT'}, {'version': 'v4', 'created': 'Wed, 1 Jan 2020 17:41:25 GMT'}, {'version': 'v5', 'created': 'Tue, 14 Jul 2020 22:17:29 GMT'}]",2020-07-16,"[['Kapitanyuk', 'Yuri A.', ''], ['Proskurnikov', 'Anton V.', ''], ['Cao', 'Ming', '']]","['Roll stabilization', 'ship motion control', 'ship maneuvering', 'optimal control']"
613,1403.5864,Ying Long,Ying Long and Yao Shen,Mapping parcel-level urban areas for a large geographical area,"21 pages, 9 figures, 3 tables",,10.1080/00045608.2015.1095062,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As a vital indicator for measuring urban development, urban areas are
expected to be identified explicitly and conveniently with widely available
dataset thereby benefiting the planning decisions and relevant urban studies.
Existing approaches to identify urban areas normally based on mid-resolution
sensing dataset, socioeconomic information (e.g. population density) generally
associate with low-resolution in space, e.g. cells with several square
kilometers or even larger towns/wards. Yet, few of them pay attention to
defining urban areas with micro data in a fine-scaled manner with large extend
scale by incorporating the morphological and functional characteristics. This
paper investigates an automated framework to delineate urban areas in the
parcel level, using increasingly available ordnance surveys for generating all
parcels (or geo-units) and ubiquitous points of interest (POIs) for inferring
density of each parcel. A vector cellular automata model was adopted for
identifying urban parcels from all generated parcels, taking into account
density, neighborhood condition, and other spatial variables of each parcel. We
applied this approach for mapping urban areas of all 654 Chinese cities and
compared them with those interpreted from mid-resolution remote sensing images
and inferred by population density and road intersections. Our proposed
framework is proved to be more straight-forward, time-saving and fine-scaled,
compared with other existing ones, and reclaim the need for consistency,
efficiency and availability in defining urban areas with well-consideration of
omnipresent spatial and functional factors across cities.
","[{'version': 'v1', 'created': 'Mon, 24 Mar 2014 06:39:17 GMT'}]",2016-01-01,"[['Long', 'Ying', ''], ['Shen', 'Yao', '']]","['Urban parcel; road network', 'points of interest (POIs)', 'vector cellular automata', 'China']"
614,1801.00597,Xi Zhang,"Xi Zhang, Jiawei Shi, Di Wang, Binxing Fang","Exploiting Investors Social Network for Stock Prediction in China's
  Market",accepted by Journal of Computational Science,,10.1016/j.jocs.2017.10.013,,cs.CE q-fin.GN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent works have shown that social media platforms are able to influence the
trends of stock price movements. However, existing works have majorly focused
on the U.S. stock market and lacked attention to certain emerging countries
such as China, where retail investors dominate the market. In this regard, as
retail investors are prone to be influenced by news or other social media,
psychological and behavioral features extracted from social media platforms are
thought to well predict stock price movements in the China's market. Recent
advances in the investor social network in China enables the extraction of such
features from web-scale data. In this paper, on the basis of tweets from
Xueqiu, a popular Chinese Twitter-like social platform specialized for
investors, we analyze features with regard to collective sentiment and
perception on stock relatedness and predict stock price movements by employing
nonlinear models. The features of interest prove to be effective in our
experiments.
","[{'version': 'v1', 'created': 'Tue, 2 Jan 2018 10:27:08 GMT'}]",2018-01-03,"[['Zhang', 'Xi', ''], ['Shi', 'Jiawei', ''], ['Wang', 'Di', ''], ['Fang', 'Binxing', '']]","['Social Network Analysis', 'Stock Market Prediction', 'Sentiment']"
615,1608.01335,Caelan Garrett,"Caelan Reed Garrett, Tomas Lozano-Perez, and Leslie Pack Kaelbling","FFRob: Leveraging Symbolic Planning for Efficient Task and Motion
  Planning",,"The International Journal of Robotics Research (IJRR), 2017",10.1177/0278364917739114,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile manipulation problems involving many objects are challenging to solve
due to the high dimensionality and multi-modality of their hybrid configuration
spaces. Planners that perform a purely geometric search are prohibitively slow
for solving these problems because they are unable to factor the configuration
space. Symbolic task planners can efficiently construct plans involving many
variables but cannot represent the geometric and kinematic constraints required
in manipulation. We present the FFRob algorithm for solving task and motion
planning problems. First, we introduce Extended Action Specification (EAS) as a
general purpose planning representation that supports arbitrary predicates as
conditions. We adapt existing heuristic search ideas for solving \proc{strips}
planning problems, particularly delete-relaxations, to solve EAS problem
instances. We then apply the EAS representation and planners to manipulation
problems resulting in FFRob. FFRob iteratively discretizes task and motion
planning problems using batch sampling of manipulation primitives and a
multi-query roadmap structure that can be conditionalized to evaluate
reachability under different placements of movable objects. This structure
enables the EAS planner to efficiently compute heuristics that incorporate
geometric and kinematic planning constraints to give a tight estimate of the
distance to the goal. Additionally, we show FFRob is probabilistically complete
and has finite expected runtime. Finally, we empirically demonstrate FFRob's
effectiveness on complex and diverse task and motion planning tasks including
rearrangement planning and navigation among movable objects.
","[{'version': 'v1', 'created': 'Wed, 3 Aug 2016 20:19:32 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Dec 2017 15:30:26 GMT'}]",2017-12-04,"[['Garrett', 'Caelan Reed', ''], ['Lozano-Perez', 'Tomas', ''], ['Kaelbling', 'Leslie Pack', '']]","['task and motion planning', 'manipulation planning', 'AI reasoning']"
616,1705.02201,Antonio Iovanella,"Matteo Cinelli, Giovanna Ferraro, Antonio Iovanella",Rich-Club Ordering and the Dyadic Effect: Two Interrelated Phenomena,,"Physica A: Statistical Mechanics and its Applications, Volume 490,
  2018, Pages 808-818",10.1016/j.physa.2017.08.122,,cs.SI math.CO physics.soc-ph q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rich-club ordering and the dyadic effect are two phenomena observed in
complex networks that are based on the presence of certain substructures
composed of specific nodes. Rich-club ordering represents the tendency of
highly connected and important elements to form tight communities with other
central elements. The dyadic effect denotes the tendency of nodes that share a
common property to be much more interconnected than expected. In this study, we
consider the interrelation between these two phenomena, which until now have
always been studied separately. We contribute with a new formulation of the
rich-club measures in terms of the dyadic effect. Moreover, we introduce
certain measures related to the analysis of the dyadic effect, which are useful
in confirming the presence and relevance of rich-clubs in complex networks. In
addition, certain computational experiences show the usefulness of the
introduced quantities with regard to different classes of real networks.
","[{'version': 'v1', 'created': 'Thu, 9 Mar 2017 16:23:46 GMT'}]",2019-04-12,"[['Cinelli', 'Matteo', ''], ['Ferraro', 'Giovanna', ''], ['Iovanella', 'Antonio', '']]","['Rich-Club Phenomenon', 'Dyadic Effect', 'Complex networks']"
617,1405.6893,Juho Lauri,"Melissa Keranen, Juho Lauri",Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs,"13 pages, 3 figures","Discrete Mathematics & Theoretical Computer Science, Vol. 20 no.
  1, Graph Theory (June 4, 2018) dmtcs:4547",10.23638/DMTCS-20-1-22,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A path in an edge-colored graph $G$ is rainbow if no two edges of it are
colored the same. The graph $G$ is rainbow-connected if there is a rainbow path
between every pair of vertices. If there is a rainbow shortest path between
every pair of vertices, the graph $G$ is strongly rainbow-connected. The
minimum number of colors needed to make $G$ rainbow-connected is known as the
rainbow connection number of $G$, and is denoted by $\text{rc}(G)$. Similarly,
the minimum number of colors needed to make $G$ strongly rainbow-connected is
known as the strong rainbow connection number of $G$, and is denoted by
$\text{src}(G)$. We prove that for every $k \geq 3$, deciding whether
$\text{src}(G) \leq k$ is NP-complete for split graphs, which form a subclass
of chordal graphs. Furthermore, there exists no polynomial-time algorithm for
approximating the strong rainbow connection number of an $n$-vertex split graph
with a factor of $n^{1/2-\epsilon}$ for any $\epsilon > 0$ unless P = NP. We
then turn our attention to block graphs, which also form a subclass of chordal
graphs. We determine the strong rainbow connection number of block graphs, and
show it can be computed in linear time. Finally, we provide a polynomial-time
characterization of bridgeless block graphs with rainbow connection number at
most 4.
","[{'version': 'v1', 'created': 'Tue, 27 May 2014 12:54:39 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Jan 2015 14:35:27 GMT'}, {'version': 'v3', 'created': 'Thu, 5 Feb 2015 16:05:11 GMT'}, {'version': 'v4', 'created': 'Wed, 17 Feb 2016 07:24:03 GMT'}, {'version': 'v5', 'created': 'Thu, 18 May 2017 11:05:35 GMT'}, {'version': 'v6', 'created': 'Wed, 21 Mar 2018 11:51:11 GMT'}, {'version': 'v7', 'created': 'Fri, 25 May 2018 16:51:09 GMT'}, {'version': 'v8', 'created': 'Mon, 28 May 2018 15:12:50 GMT'}]",2019-03-14,"[['Keranen', 'Melissa', ''], ['Lauri', 'Juho', '']]","['rainbow coloring', 'computational complexity', 'block graph']"
618,2006.05117,Huaizheng Zhang,"Huaizheng Zhang, Yuanming Li, Qiming Ai, Yong Luo, Yonggang Wen,
  Yichao Jin and Nguyen Binh Duong Ta",Hysia: Serving DNN-Based Video-to-Retail Applications in Cloud,"4 pages, 4 figures","In Proceedings of the 28th ACM International Conference on
  Multimedia (2020) 4457-4460",10.1145/3394171.3414536,,cs.MM cs.DC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Combining \underline{v}ideo streaming and online \underline{r}etailing (V2R)
has been a growing trend recently. In this paper, we provide practitioners and
researchers in multimedia with a cloud-based platform named Hysia for easy
development and deployment of V2R applications. The system consists of: 1) a
back-end infrastructure providing optimized V2R related services including data
engine, model repository, model serving and content matching; and 2) an
application layer which enables rapid V2R application prototyping. Hysia
addresses industry and academic needs in large-scale multimedia by: 1)
seamlessly integrating state-of-the-art libraries including NVIDIA video SDK,
Facebook faiss, and gRPC; 2) efficiently utilizing GPU computation; and 3)
allowing developers to bind new models easily to meet the rapidly changing deep
learning (DL) techniques. On top of that, we implement an orchestrator for
further optimizing DL model serving performance. Hysia has been released as an
open source project on GitHub, and attracted considerable attention. We have
published Hysia to DockerHub as an official image for seamless integration and
deployment in current cloud environments.
","[{'version': 'v1', 'created': 'Tue, 9 Jun 2020 08:45:53 GMT'}]",2020-12-16,"[['Zhang', 'Huaizheng', ''], ['Li', 'Yuanming', ''], ['Ai', 'Qiming', ''], ['Luo', 'Yong', ''], ['Wen', 'Yonggang', ''], ['Jin', 'Yichao', ''], ['Ta', 'Nguyen Binh Duong', '']]","['Multimedia System', 'Video Analysis', 'Video Shopping', 'Advertising', 'Cloud Platform', 'Open Source Software']"
619,1806.02279,Seung Yeon Shin,"Seung Yeon Shin, Soochahn Lee, Il Dong Yun, Kyoung Mu Lee",Deep Vessel Segmentation By Learning Graphical Connectivity,,,10.1016/j.media.2019.101556,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel deep-learning-based system for vessel segmentation.
Existing methods using CNNs have mostly relied on local appearances learned on
the regular image grid, without considering the graphical structure of vessel
shape. To address this, we incorporate a graph convolutional network into a
unified CNN architecture, where the final segmentation is inferred by combining
the different types of features. The proposed method can be applied to expand
any type of CNN-based vessel segmentation method to enhance the performance.
Experiments show that the proposed method outperforms the current
state-of-the-art methods on two retinal image datasets as well as a coronary
artery X-ray angiography dataset.
","[{'version': 'v1', 'created': 'Wed, 6 Jun 2018 16:16:52 GMT'}]",2021-05-07,"[['Shin', 'Seung Yeon', ''], ['Lee', 'Soochahn', ''], ['Yun', 'Il Dong', ''], ['Lee', 'Kyoung Mu', '']]","['Vessel segmentation', 'deep learning', 'CNN', 'graph convolutional network', 'retinal image', 'coronary artery', 'X-ray angiography']"
620,1603.02484,Wanxing Ding,Wanxing Ding,"The Exploratory Research of the Effect Communication Model and Effect
  Improving Strategy of Interactive Advertising","15 pages, 14 tables, 2 figures in The International journal of
  Multimedia & Its Applications Vol.8, No.1, February 2016",,10.5121/ijma.2016.8102,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interactive advertising which characterized by interactivity has become the
mainstream of advertising by gradually replacing traditional one-way
advertising during the new media era. This paper has obeyed the research
outline below, literature review, background description, assumption proposed,
and empirical analysis. Therefore, this paper proposed the communication model
of interactive advertising and drawn two related important conclusions,
interactivity has brought positive effect to advertising communication,
different type of consumers tend to use different interactive options in
different ways. Furthermore, this paper also presented three related
optimization strategies to improving the communication of interactive
advertising, namely, 1.changing communication model from one-way to two-way,
2.renovating new communication process and effect-generated path, 3.renovating
new strategy portfolio to improving the communication effect of interactive
advertising.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2016 11:31:58 GMT'}]",2016-03-09,"[['Ding', 'Wanxing', '']]","['Interactive advertising', 'communication model', 'optimization strategy']"
621,1108.0190,Sergio Antoy,Sergio Antoy,On the Correctness of Pull-Tabbing,,"Theory and Practice of Logic Programming, vol. 11, no. 4-5, pp.
  713-730, 2011",10.1017/S1471068411000263,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pull-tabbing is an evaluation approach for functional logic computations,
based on a graph transformation recently proposed, which avoids making
irrevocable non-deterministic choices that would jeopardize the completeness of
computations. In contrast to other approaches with this property, it does not
require an upfront cloning of a possibly large portion of the choice's context.
We formally define the pull-tab transformation, characterize the class of
programs for which the transformation is intended, extend the computations in
these programs to include the transformation, and prove the correctness of the
extended computations.
","[{'version': 'v1', 'created': 'Sun, 31 Jul 2011 18:01:14 GMT'}]",2011-08-02,"[['Antoy', 'Sergio', '']]","['Functional Logic Programming', 'Non-Determinism', 'Graph Rewriting', 'Pull-tabbing']"
622,1807.01605,Mubariz Zaffar,"Mubariz Zaffar, Shoaib Ehsan, Rustam Stolkin and Klaus McDonald Maier","Sensors, SLAM and Long-term Autonomy: A Review","6 pages, 7 figures",,10.1109/AHS.2018.8541483,,cs.CV cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Simultaneous Localization and Mapping, commonly known as SLAM, has been an
active research area in the field of Robotics over the past three decades. For
solving the SLAM problem, every robot is equipped with either a single sensor
or a combination of similar/different sensors. This paper attempts to review,
discuss, evaluate and compare these sensors. Keeping an eye on future, this
paper also assesses the characteristics of these sensors against factors
critical to the long-term autonomy challenge.
","[{'version': 'v1', 'created': 'Wed, 4 Jul 2018 14:16:23 GMT'}]",2019-04-30,"[['Zaffar', 'Mubariz', ''], ['Ehsan', 'Shoaib', ''], ['Stolkin', 'Rustam', ''], ['Maier', 'Klaus McDonald', '']]","['SLAM', 'Long-term Autonomy', 'Sensors']"
623,1901.10720,Simon Perrault,Simon T. Perrault and Weiyu Zhang,"Effects of Moderation and Opinion Heterogeneity on Attitude towards the
  Online Deliberation Experience","11 pages, CHI 2019",,10.1145/3290605.3300247,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online deliberation offers a way for citizens to collectively discuss an
issue and provide input for policy makers. The overall experience of online
deliberation can be affected by multiple factors. We decided to investigate the
effects of moderation and opinion heterogeneity on the perceived deliberation
experience, by running the first online deliberation experiment in Singapore.
Our study took place in three months with three phases. In phase 1, our 2,006
participants answered a survey, that we used to create groups of different
opinion heterogeneity. During the second phase, 510 participants discussed
about the population issue on the online platform we developed. We gathered
data on their online deliberation experience during phase 3. We found out that
higher levels of moderation negatively impact the experience of deliberation on
perceived procedural fairness, validity claim and policy legitimacy; and that
high opinion heterogeneity is important in order to get a fair assessment of
the deliberation experience.
","[{'version': 'v1', 'created': 'Wed, 30 Jan 2019 09:27:52 GMT'}]",2019-01-31,"[['Perrault', 'Simon T.', ''], ['Zhang', 'Weiyu', '']]","['Civic engagement', 'deliberation', 'deliberative democracy', 'participation', 'public sphere']"
624,1907.09426,Francesco Ricca,"Giovanni Amendola, Francesco Ricca",Paracoherent Answer Set Semantics meets Argumentation Frameworks,"Paper presented at the 35th International Conference on Logic
  Programming (ICLP 2019), Las Cruces, New Mexico, USA, 20-25 September 2019,
  16 pages",Theory and Practice of Logic Programming 19 (2019) 688-704,10.1017/S1471068419000139,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last years, abstract argumentation has met with great success in AI,
since it has served to capture several non-monotonic logics for AI. Relations
between argumentation framework (AF) semantics and logic programming ones are
investigating more and more. In particular, great attention has been given to
the well-known stable extensions of an AF, that are closely related to the
answer sets of a logic program. However, if a framework admits a small
incoherent part, no stable extension can be provided. To overcome this
shortcoming, two semantics generalizing stable extensions have been studied,
namely semi-stable and stage. In this paper, we show that another perspective
is possible on incoherent AFs, called paracoherent extensions, as they have a
counterpart in paracoherent answer set semantics. We compare this perspective
with semi-stable and stage semantics, by showing that computational costs
remain unchanged, and moreover an interesting symmetric behaviour is
maintained. Under consideration for acceptance in TPLP.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2019 16:53:33 GMT'}]",2020-02-19,"[['Amendola', 'Giovanni', ''], ['Ricca', 'Francesco', '']]","['Answer Set Programming', 'Abstract Argumentation', 'Paracoherent reasoning']"
625,1907.07175,Alessandra Urbinati,"Alessandra Urbinati, Edoardo Galimberti, Giancarlo Ruffo","Measuring Scientific Brain Drain with Hubs and Authorities: a Dual
  Perspective","Paper published on Online Social Networks and Media, doi:
  https://doi.org/10.1016/j.osnem.2021.100176",,10.1016/j.osnem.2021.100176,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we study international migrations of researchers, scientists,
and academics from a complex-network perspective to identify the central
countries involved in the migration phenomenon. We define the scientific
migration network (SMN) as temporal directed weighted network where nodes are
world countries, links account for the number of scientists moving from one
country to another, and timestamps represent years (from 2000 to 2016). 2.8
millions ORCID public profiles are utilized as data source. We then
characterize hubs and authorities of the SMN employing the well-know weighted
hyperlink-induced topic search (HITS) algorithm to catch the interplay between
providing and attracting researchers from a global perspective, and relate
these results to other local and global methodologies. We also investigate the
local characteristics of successors of hubs and predecessors of authorities to
dive deeper into the motivations that establish hubs and authorities as such.
Our findings highlight the presence of a set of countries acting both as hubs
and authorities, occupying a privileged position in the scientific migration
network, and having similar local characteristics. Finally, we showcase how to
employ network visualization to evince temporal evolutions of ego-networks of
selected hubs and authorities.
","[{'version': 'v1', 'created': 'Tue, 16 Jul 2019 17:57:05 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Oct 2021 12:16:28 GMT'}]",2021-10-08,"[['Urbinati', 'Alessandra', ''], ['Galimberti', 'Edoardo', ''], ['Ruffo', 'Giancarlo', '']]","['scientific migration', 'complex networks analysis', 'hyperlink-induced topic search', 'science of science']"
626,1809.10982,Benjamin Wassermann,"Benjamin Wassermann, Stefan Kollmannsberger, Tino Bog, and Ernst Rank","From geometric design to numerical analysis: A direct approach using the
  Finite Cell Method on Constructive Solid Geometry",,Computers & Mathematics with Applications 74 (2017) 1703-1726,10.1016/j.camwa.2017.01.027,,cs.CE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  During the last ten years, increasing efforts were made to improve and
simplify the process from Computer Aided Design (CAD) modeling to a numerical
simulation. It has been shown that the transition from one model to another,
i.e. the meshing, is a bottle-neck. Several approaches have been developed to
overcome this time-consuming step, e.g. Isogeometric Analysis (IGA), which
applies the shape functions used for the geometry description (typically
B-Splines and NURBS) directly to the numerical analysis. In contrast to IGA,
which deals with boundary represented models (B-Rep), our approach focuses on
parametric volumetric models such as Constructive Solid Geometries (CSG). These
models have several advantages, as their geometry description is inherently
watertight and they provide a description of the model's interior. To be able
to use the explicit mathematical description of these models, we employ the
Finite Cell Method (FCM). Herein, the only necessary input is a reliable
statement whether an (integration-) point lies inside or outside of the
geometric model. This paper mainly discusses such point-in-membership tests on
various geometric objects like sweeps and lofts, as well as several geometric
operations such as filleting or chamfering. We demonstrate that, based on the
information of the construction method of these objects, the
point-in-membership-test can be carried out efficiently and robustly
","[{'version': 'v1', 'created': 'Fri, 28 Sep 2018 12:16:00 GMT'}]",2018-10-01,"[['Wassermann', 'Benjamin', ''], ['Kollmannsberger', 'Stefan', ''], ['Bog', 'Tino', ''], ['Rank', 'Ernst', '']]","['CSG', 'Constructive Solid Geometry', 'Finite Cell Method', 'Spline Ray Casting', 'Point MembershipClassification', 'Procedural Modeling', 'Sweep', 'Loft']"
627,1211.4695,Smitha Pai N,"Smitha N. Pai, K.C.Shet, H.S. Mruthyunjaya","Energy Aware Path Search for Sensor with parameters as used in
  agricultural field","12 pages, 5 figures","International Journal of Ad hoc, Sensor & Ubiquitous Computing
  (IJASUC) Vol.3, No.5, October 2012",10.5121/ijasuc.2012.3401,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sensors placed in agricultural field should have long network life. Failure
of node or link allows rerouting and establishing a new path from the source to
the sink. In this paper, a new path is established such that it is energy aware
during path discovery and is active for longer interval of time once it is
established. The parameters used for simulation are as those used in
agricultural application.
","[{'version': 'v1', 'created': 'Tue, 20 Nov 2012 09:28:05 GMT'}]",2012-11-21,"[['Pai', 'Smitha N.', ''], ['Shet', 'K. C.', ''], ['Mruthyunjaya', 'H. S.', '']]","['Agriculture', 'Energy Aware', 'Routing', 'Sensor Network']"
628,1007.5171,Secretary Iju,"Li Liu and Edward Dillon (University of Alabama, Alabama)",I-Interaction: An Intelligent In-Vehicle User Interaction Model,"11 pages, 4 figures",International Journal Of UbiComp 1.3 (2010) 57-67,10.5121/iju.2010.1305,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The automobile is always a point of interest where new technology has been
deployed. Because of this interest, human-vehicle interaction has been an
appealing area for much research in recent years. The current in-vehicle design
has been improved but still possesses some of the design from the traditional
interaction style. In this paper, we propose a new user-oriented model for
in-vehicle interaction model known as i-Interaction. The i-Interaction model
provides user with an intuitive approach to interact with the In-Vehicle
Information System (IVIS) by the keypad entry. It is the intent that the
proposed usability testing for this model will help improve the way research
and development is implemented from this topic. This model does not only
provide the user with a direct interaction in vehicles but also introduce a new
prospective that other research has not addressed.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2010 09:52:27 GMT'}]",2010-07-30,"[['Liu', 'Li', '', 'University of Alabama, Alabama'], ['Dillon', 'Edward', '', 'University of Alabama, Alabama']]","['Embedded systems', 'Domain-specific architectures', 'Interaction styles', 'User-centered design', 'In-Vehicle User Interface  1']"
629,1405.6179,Rajiv Ranjan Dr.,"A. Khoshkbarforoushha (1, 2) P. Jamshidi (3), M. Fahmideh (4), L. Wang
  (5), R. Ranjan (2) ((1) School of Computer Science, Australian National
  University (2) CSIRO Computational Informatics, Building 108, Australian
  National University (3) Lero - The Irish Software Engineering Research
  Centre, School of Computing, Dublin City University (4) Automated Software
  Engineering Research Group, Electrical and Computer Engineering Faculty,
  Shahid Beheshti University (5) School of Computer Science, China University
  of Geosciences)",Metrics for BPEL Process Reusability Analysis in a Workflow System,"This the extended version of the conference paper that Published in:
  WETSoM '10 Proceedings of the 2010 ICSE Workshop on Emerging Trends in
  Software Metrics Pages 67-74, ACM New York, NY, USA \c{opyright}2010",,10.1145/1809223.1809233,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work proposes a quantitative metric to analyze potential reusability of
a BPEL (Business Process Execution Language) Process. The approach is based on
Description and Logic Mismatch Probability of a BPEL Process that will be
reused within potential contexts. The mismatch probabilities have been
consolidated to a metric formula for quantifying the probability of potential
reuse of BPEL processes. An initial empirical evaluation suggests that the
proposed metric properly predict potential reusability of BPEL processes.
According to the experiment, there exists a significant statistical correlation
between results of the metric and the experts judgements. This indicates a
predictive dependency between the proposed metric and potential reusability of
BPEL processes as a measuring stick for this phenomena. If future studies
ascertain these findings by replicating this experiment, the practical
implications of such a metric are early detection of the design flaws and
aiding architects to judge various design alternatives.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2014 08:28:09 GMT'}]",2014-05-26,"[['Khoshkbarforoushha', 'A.', ''], ['Jamshidi', 'P.', ''], ['Fahmideh', 'M.', ''], ['Wang', 'L.', ''], ['Ranjan', 'R.', '']]","['Service Reusability Analysis', 'Composite Service', 'BPEL Process Reusability', 'SOA Metric']"
630,1901.06529,Vivek Kumar Mr.,"Vivek Kumar, Atul Samadhiya",Comparative Performance Analysis of Image De-noising Techniques,"6 pages, 9 figures, 1 Table, International Conference on Innovations
  in Engineering and Technology (ICIET'2013) Dec. 25-26, 2013 Bangkok
  (Thailand)","ICIET pages 47-52, 2013",10.15242/IIE.E1213576,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Noise is an important factor which when get added to an image reduces its
quality and appearance. So in order to enhance the image qualities, it has to
be removed with preserving the textural information and structural features of
image. There are different types of noises exist who corrupt the images.
Selection of the denoising algorithm is application dependent. Hence, it is
necessary to have knowledge about the noise present in the image so as to
select the appropriate denoising algorithm. Objective of this paper is to
present brief account on types of noises, its types and different noise removal
algorithms. In the first section types of noises on the basis of their additive
and multiplicative nature are being discussed. In second section a precise
classification and analysis of the different potential image denoising
algorithm is presented. At the end of paper, a comparative study of all these
algorithms in context of performance evaluation is done and concluded with
several promising directions for future research work.
","[{'version': 'v1', 'created': 'Sat, 19 Jan 2019 14:16:36 GMT'}]",2019-01-23,"[['Kumar', 'Vivek', ''], ['Samadhiya', 'Atul', '']]","['Noise', 'Textural information', 'Image denoising algorithm', 'Performance evaluation']"
631,1210.0829,Harbi AlMahafzah,Harbi AlMahafzah and Maen Zaid AlRwashdeh,A Survey of Multibiometric Systems,,"International Journal of Computer Application volume 43 No 15
  April 2012",10.5120/6182-8612,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most biometric systems deployed in real-world applications are unimodal.
Using unimodal biometric systems have to contend with a variety of problems
such as: Noise in sensed data; Intra-class variations; Inter-class
similarities; Non-universality; Spoof attacks. These problems have addressed by
using multibiometric systems, which expected to be more reliable due to the
presence of multiple, independent pieces of evidence.
","[{'version': 'v1', 'created': 'Tue, 2 Oct 2012 16:26:39 GMT'}]",2015-06-11,"[['AlMahafzah', 'Harbi', ''], ['AlRwashdeh', 'Maen Zaid', '']]","['Biometric System', 'Uni-Biometric', 'Multi-Biometric', 'Fusion']"
632,1904.00157,Marco Baroni,Marco Baroni,"Linguistic generalization and compositionality in modern artificial
  neural networks","Please cite as ""to appear in the Philosophical Transactions of the
  Royal Society B""",,10.1098/rstb.2019.0307,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last decade, deep artificial neural networks have achieved astounding
performance in many natural language processing tasks. Given the high
productivity of language, these models must possess effective generalization
abilities. It is widely assumed that humans handle linguistic productivity by
means of algebraic compositional rules: Are deep networks similarly
compositional? After reviewing the main innovations characterizing current deep
language processing networks, I discuss a set of studies suggesting that deep
networks are capable of subtle grammar-dependent generalizations, but also that
they do not rely on systematic compositional rules. I argue that the intriguing
behaviour of these devices (still awaiting a full understanding) should be of
interest to linguists and cognitive scientists, as it offers a new perspective
on possible computational strategies to deal with linguistic productivity
beyond rule-based compositionality, and it might lead to new insights into the
less systematic generalization patterns that also appear in natural language.
","[{'version': 'v1', 'created': 'Sat, 30 Mar 2019 06:48:32 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Jun 2019 10:32:00 GMT'}, {'version': 'v3', 'created': 'Wed, 26 Jun 2019 13:42:35 GMT'}]",2019-06-27,"[['Baroni', 'Marco', '']]","['artificial neural networks', 'deep learning', 'linguistic productivity', 'compositionality']"
633,1801.00202,Darren Strash,Pablo San Segundo and Jorge Artieda and Darren Strash,Efficiently Enumerating all Maximal Cliques with Bit-Parallelism,"15 pages, 1 figure",Computers & Operations Research 92 (2018) 37-46,10.1016/j.cor.2017.12.006,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The maximal clique enumeration (MCE) problem has numerous applications in
biology, chemistry, sociology, and graph modeling. Though this problem is well
studied, most current research focuses on finding solutions in large sparse
graphs or very dense graphs, while sacrificing efficiency on the most difficult
medium-density benchmark instances that are representative of data sets often
encountered in practice. We show that techniques that have been successfully
applied to the maximum clique problem give significant speed gains over the
state-of-the-art MCE algorithms on these instances. Specifically, we show that
a simple greedy pivot selection based on a fixed maximum-degree first ordering
of vertices, when combined with bit-parallelism, performs consistently better
than the theoretical worst-case optimal pivoting of the state-of-the-art
algorithms of Tomita et al. [Theoretical Computer Science, 2006] and Naud\'e
[Theoretical Computer Science, 2016].
  Experiments show that our algorithm is faster than the worst-case optimal
algorithm of Tomita et al. on 60 out of 74 standard structured and random
benchmark instances: we solve 48 instances 1.2 to 2.2 times faster, and solve
the remaining 12 instances 3.6 to 47.6 times faster. We also see consistent
speed improvements over the algorithm of Naud\'e: solving 61 instances 1.2 to
2.4 times faster. To the best of our knowledge, we are the first to achieve
such speed-ups compared to these state-of-the-art algorithms on these standard
benchmarks.
","[{'version': 'v1', 'created': 'Sat, 30 Dec 2017 22:29:04 GMT'}]",2018-01-03,"[['Segundo', 'Pablo San', ''], ['Artieda', 'Jorge', ''], ['Strash', 'Darren', '']]","['maximal clique', 'bitstring', 'branch-and-bound', 'subgraph enumeration', 'combinatorialoptimization']"
634,2102.11395,Ghani Lawal Mr.,Ghani O. Lawal and Michael Greenspan,Procam Calibration from a Single Pose of a Planar Target,"11 pages, 9 figures, 10 tables. Submitted to the VISAPP Conference.
  Stored in the SciTepress Digital Library:
  https://www.scitepress.org/PublicationsDetail.aspx?ID=rGG70YCQyOs=&t=1","In Proceedings of the 16th International Joint Conference on
  Computer Vision, Imaging and Computer Graphics Theory and Applications
  (VISIGRAPP 2021) - Volume 5: VISAPP, pages 817-827",10.5220/0010327708170827,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel user friendly method is proposed for calibrating a procam system from
a single pose of a planar chessboard target. The user simply needs to orient
the chessboard in a single appropriate pose. A sequence of Gray Code patterns
are projected onto the chessboard, which allows correspondences between the
camera, projector and the chessboard to be automatically extracted. These
correspondences are fed as input to a nonlinear optimization method that models
the projector of the principle points onto the chessboard, and accurately
calculates the intrinsic and extrinsic parameters of both the camera and the
projector, as well as the camera's distortion coefficients. The method is
experimentally validated on the procam system, which is shown to be comparable
in accuracy with existing multi-pose approaches. The impact of the orientation
of the chessboard with respect to the procam imaging places is also explored
through extensive simulation.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2021 22:53:29 GMT'}]",2021-02-24,"[['Lawal', 'Ghani O.', ''], ['Greenspan', 'Michael', '']]","['Procam', 'Calibration', 'Optimization', 'Stereovision', 'Homography']"
635,1701.05467,Oliviero Riganelli,Oliviero Riganelli and Daniela Micucci and Leonardo Mariani,Healing Data Loss Problems in Android Apps,"IEEE International Symposium on Software Reliability Engineering
  Workshops (ISSREW), 2016",,10.1109/ISSREW.2016.50,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Android apps should be designed to cope with stop-start events, which are the
events that require stopping and restoring the execution of an app while
leaving its state unaltered. These events can be caused by run-time
configuration changes, such as a screen rotation, and by context-switches, such
as a switch from one app to another. When a stop-start event occurs, Android
saves the state of the app, handles the event, and finally restores the saved
state. To let Android save and restore the state correctly, apps must provide
the appropriate support. Unfortunately, Android developers often implement this
support incorrectly, or do not implement it at all. This bad practice makes
apps to incorrectly react to stop-start events, thus generating what we defined
data loss problems, that is Android apps that lose user data, behave
unexpectedly, and crash due to program variables that lost their values. Data
loss problems are difficult to detect because they might be observed only when
apps are in specific states and with specific inputs. Covering all the possible
cases with testing may require a large number of test cases whose execution
must be checked manually to discover whether the app under test has been
correctly restored after each stop-start event. It is thus important to
complement traditional in-house testing activities with mechanisms that can
protect apps as soon as a data loss problem occurs in the field. In this paper
we present DataLossHealer, a technique for automatically identifying and
healing data loss problems in the field as soon as they occur. DataLossHealer
is a technique that checks at run-time whether states are recovered correctly,
and heals the app when needed. DataLossHealer can learn from experience,
incrementally reducing the overhead that is introduced avoiding to monitor
interactions that have been managed correctly by the app in the past.
","[{'version': 'v1', 'created': 'Thu, 19 Jan 2017 15:15:55 GMT'}]",2017-01-20,"[['Riganelli', 'Oliviero', ''], ['Micucci', 'Daniela', ''], ['Mariani', 'Leonardo', '']]","['Self-healing', 'Android', 'Data loss', 'Stop-start events']"
636,1203.6453,Mathieu Sassolas,"B\'eatrice B\'erard (LIP6), Serge Haddad (LSV), Mathieu Sassolas
  (LIP6)",Interrupt Timed Automata: verification and expressiveness,,"Formal Methods in System Design 40, 1 (2012) 41-87",10.1007/s10703-011-0140-2,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the class of Interrupt Timed Automata (ITA), a subclass of
hybrid automata well suited to the description of timed multi-task systems with
interruptions in a single processor environment. While the reachability problem
is undecidable for hybrid automata we show that it is decidable for ITA. More
precisely we prove that the untimed language of an ITA is regular, by building
a finite automaton as a generalized class graph. We then establish that the
reachability problem for ITA is in NEXPTIME and in PTIME when the number of
clocks is fixed. To prove the first result, we define a subclass ITA- of ITA,
and show that (1) any ITA can be reduced to a language-equivalent automaton in
ITA- and (2) the reachability problem in this subclass is in NEXPTIME (without
any class graph). In the next step, we investigate the verification of real
time properties over ITA. We prove that model checking SCL, a fragment of a
timed linear time logic, is undecidable. On the other hand, we give model
checking procedures for two fragments of timed branching time logic. We also
compare the expressive power of classical timed automata and ITA and prove that
the corresponding families of accepted languages are incomparable. The result
also holds for languages accepted by controlled real-time automata (CRTA), that
extend timed automata. We finally combine ITA with CRTA, in a model which
encompasses both classes and show that the reachability problem is still
decidable. Additionally we show that the languages of ITA are neither closed
under complementation nor under intersection.
","[{'version': 'v1', 'created': 'Thu, 29 Mar 2012 07:43:15 GMT'}]",2012-03-30,"[['Bérard', 'Béatrice', '', 'LIP6'], ['Haddad', 'Serge', '', 'LSV'], ['Sassolas', 'Mathieu', '', 'LIP6']]","['Hybrid automata', 'timed automata', 'multi-task systems', 'interrupts', 'decidability of reachability', 'model checking', 'real-time properties']"
637,0704.0062,Tom\'a\v{s} Vina\v{r},"Rastislav \v{S}r\'amek, Bro\v{n}a Brejov\'a, Tom\'a\v{s} Vina\v{r}",On-line Viterbi Algorithm and Its Relationship to Random Walks,,"Algorithms in Bioinformatics: 7th International Workshop (WABI),
  4645 volume of Lecture Notes in Computer Science, pp. 240-251, Philadelphia,
  PA, USA, September 2007. Springer",10.1007/978-3-540-74126-8_23,,cs.DS,,"  In this paper, we introduce the on-line Viterbi algorithm for decoding hidden
Markov models (HMMs) in much smaller than linear space. Our analysis on
two-state HMMs suggests that the expected maximum memory used to decode
sequence of length $n$ with $m$-state HMM can be as low as $\Theta(m\log n)$,
without a significant slow-down compared to the classical Viterbi algorithm.
Classical Viterbi algorithm requires $O(mn)$ space, which is impractical for
analysis of long DNA sequences (such as complete human genome chromosomes) and
for continuous data streams. We also experimentally demonstrate the performance
of the on-line Viterbi algorithm on a simple HMM for gene finding on both
simulated and real DNA sequences.
","[{'version': 'v1', 'created': 'Sat, 31 Mar 2007 23:52:33 GMT'}]",2010-01-25,"[['Šrámek', 'Rastislav', ''], ['Brejová', 'Broňa', ''], ['Vinař', 'Tomáš', '']]","['hidden Markov models', 'on-line algorithms', 'Viterbi algorithm', 'gene finding']"
638,1901.01538,Andrea Arcuri,Andrea Arcuri,RESTful API Automated Test Case Generation,,"2017 IEEE International Conference on Software Quality,
  Reliability and Security (QRS)",10.1109/QRS.2017.11,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, web services play a major role in the development of enterprise
applications. Many such applications are now developed using a service-oriented
architecture (SOA), where microservices is one of its most popular kind. A
RESTful web service will provide data via an API over the network using HTTP,
possibly interacting with databases and other web services. Testing a RESTful
API poses challenges, as inputs/outputs are sequences of HTTP
requests/responses to a remote server. Many approaches in the literature do
black-box testing, as the tested API is a remote service whose code is not
available. In this paper, we consider testing from the point of view of the
developers, which do have full access to the code that they are writing.
Therefore, we propose a fully automated white-box testing approach, where test
cases are automatically generated using an evolutionary algorithm. Tests are
rewarded based on code coverage and fault finding metrics. We implemented our
technique in a tool called EVOMASTER, which is open-source. Experiments on two
open-source, yet non-trivial RESTful services and an industrial one, do show
that our novel technique did automatically find 38 real bugs in those
applications. However, obtained code coverage is lower than the one achieved by
the manually written test suites already existing in those services. Research
directions on how to further improve such approach are therefore discussed.
","[{'version': 'v1', 'created': 'Sun, 6 Jan 2019 13:21:44 GMT'}]",2019-01-08,"[['Arcuri', 'Andrea', '']]","['REST', 'SBSE', 'SBST', 'SOA', 'Microservice', 'Web Service', 'Test Generation']"
639,1701.06815,Stefan Wagner,"Alexander Pretschner, Wolfgang Prenninger, Stefan Wagner, Christian
  K\""janel, Martin Baumgartner, Bernd Sostawa, R\""udiger Z\""olch, Thomas
  Stauner",One evaluation of model-based testing and its automation,"10 pages, 8 figures","Proceedings of the 27th International Conference on Software
  Engineering (ICSE '05), pages 392-401, ACM, 2005",10.1145/1062455.1062529,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Model-based testing relies on behavior models for the generation of model
traces: input and expected output---test cases---for an implementation. We use
the case study of an automotive network controller to assess different test
suites in terms of error detection, model coverage, and implementation
coverage. Some of these suites were generated automatically with and without
models, purely at random, and with dedicated functional test selection
criteria. Other suites were derived manually, with and without the model at
hand. Both automatically and manually derived model-based test suites detected
significantly more requirements errors than hand-crafted test suites that were
directly derived from the requirements. The number of detected programming
errors did not depend on the use of models. Automatically generated model-based
test suites detected as many errors as hand-crafted model-based suites with the
same number of tests. A sixfold increase in the number of model-based tests led
to an 11% increase in detected errors.
","[{'version': 'v1', 'created': 'Tue, 24 Jan 2017 11:19:53 GMT'}]",2017-01-25,"[['Pretschner', 'Alexander', ''], ['Prenninger', 'Wolfgang', ''], ['Wagner', 'Stefan', ''], ['Kjanel', 'Christian', ''], ['Baumgartner', 'Martin', ''], ['Sostawa', 'Bernd', ''], ['Zölch', 'Rüdiger', ''], ['Stauner', 'Thomas', '']]","['Model-based development', 'abstraction', 'test case generation', 'coverage', 'CASE', 'automotive software']"
640,1101.2715,Jaydip Sen,Jaydip Sen,A Novel Mechanism for Detection of Distributed Denial of Service Attacks,"11 pages, 5 tables. In Proceedings of the First International
  Conference on Computer Science and Information Technology (CCSIT 2011).
  Springer CCIS Series Vol 133, Advanced Computing, Part 3, pp. 247-257,
  Bangalore, 2011, India",,10.1007/978-3-642-17881-8_24,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing popularity of web-based applications has led to several
critical services being provided over the Internet. This has made it imperative
to monitor the network traffic so as to prevent malicious attackers from
depleting the resources of the network and denying services to legitimate
users. This paper has presented a mechanism for protecting a web-server against
a distributed denial of service (DDoS) attack. Incoming traffic to the server
is continuously monitored and any abnormal rise in the inbound traffic is
immediately detected. The detection algorithm is based on a statistical
analysis of the inbound traffic on the server and a robust hypothesis testing
framework. While the detection process is on, the sessions from the legitimate
sources are not disrupted and the load on the server is restored to the normal
level by blocking the traffic from the attacking sources. To cater to different
scenarios, the detection algorithm has various modules with varying level of
computational and memory overheads for their execution. While the approximate
modules are fast in detection and involve less overhead, they have lower
detection accuracy. The accurate modules involve complex detection logic and
hence involve more overhead for their execution, but they have very high
detection accuracy. Simulations carried out on the proposed mechanism have
produced results that demonstrate effectiveness of the scheme.
","[{'version': 'v1', 'created': 'Fri, 14 Jan 2011 04:34:43 GMT'}]",2011-01-17,"[['Sen', 'Jaydip', '']]","['Distributed denial of service (DDoS)', 'traffic flow', 'buffer', 'Poisson arrival', 'Queuing model', 'statistical test of significance']"
641,1703.08593,Roberto Camacho Barranco,"Roberto Camacho Barranco, Arnold P. Boedihardjo, M. Shahriar Hossain",Analyzing Evolving Stories in News Articles,"This is a pre-print of an article published in the International
  Journal of Data Science and Analytics. The final authenticated version is
  available online at: https://doi.org/10.1007/s41060-017-0091-9",,10.1007/s41060-017-0091-9,,cs.IR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is an overwhelming number of news articles published every day around
the globe. Following the evolution of a news-story is a difficult task given
that there is no such mechanism available to track back in time to study the
diffusion of the relevant events in digital news feeds. The techniques
developed so far to extract meaningful information from a massive corpus rely
on similarity search, which results in a myopic loopback to the same topic
without providing the needed insights to hypothesize the origin of a story that
may be completely different than the news today. In this paper, we present an
algorithm that mines historical data to detect the origin of an event, segments
the timeline into disjoint groups of coherent news articles, and outlines the
most important documents in a timeline with a soft probability to provide a
better understanding of the evolution of a story. Qualitative and quantitative
approaches to evaluate our framework demonstrate that our algorithm discovers
statistically significant and meaningful stories in reasonable time.
Additionally, a relevant case study on a set of news articles demonstrates that
the generated output of the algorithm holds the promise to aid prediction of
future entities in a story.
","[{'version': 'v1', 'created': 'Fri, 24 Mar 2017 20:52:32 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Dec 2017 15:46:59 GMT'}]",2017-12-22,"[['Barranco', 'Roberto Camacho', ''], ['Boedihardjo', 'Arnold P.', ''], ['Hossain', 'M. Shahriar', '']]","['Entity evolution', 'connecting the dots', 'storytelling', 'entity prediction', 'document understanding', 'causal analysis']"
642,1809.00395,Alborz Rezazadeh Sereshkeh,"Alborz Rezazadeh Sereshkeh, Rozhin Yousefi, Andrew T Wong, Tom Chau","Online classification of imagined speech using functional near-infrared
  spectroscopy signals",,,10.1088/1741-2552/aae4b9,,cs.HC q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most brain-computer interfaces (BCIs) based on functional near-infrared
spectroscopy (fNIRS) require that users perform mental tasks such as motor
imagery, mental arithmetic, or music imagery to convey a message or to answer
simple yes or no questions. These cognitive tasks usually have no direct
association with the communicative intent, which makes them difficult for users
to perform. In this paper, a 3-class intuitive BCI is presented which enables
users to directly answer yes or no questions by covertly rehearsing the word
'yes' or 'no' for 15 s. The BCI also admits an equivalent duration of
unconstrained rest which constitutes the third discernable task. Twelve
participants each completed one offline block and six online blocks over the
course of 2 sessions. The mean value of the change in oxygenated hemoglobin
concentration during a trial was calculated for each channel and used to train
a regularized linear discriminant analysis (RLDA) classifier. By the final
online block, 9 out of 12 participants were performing above chance (p<0.001),
with a 3-class accuracy of 83.8+9.4%. Even when considering all participants,
the average online 3-class accuracy over the last 3 blocks was 64.1+20.6%, with
only 3 participants scoring below chance (p<0.001). For most participants,
channels in the left temporal and temporoparietal cortex provided the most
discriminative information. To our knowledge, this is the first report of an
online fNIRS 3-class imagined speech BCI. Our findings suggest that imagined
speech can be used as a reliable activation task for selected users for the
development of more intuitive BCIs for communication.
","[{'version': 'v1', 'created': 'Sun, 2 Sep 2018 21:27:19 GMT'}]",2018-12-17,"[['Sereshkeh', 'Alborz Rezazadeh', ''], ['Yousefi', 'Rozhin', ''], ['Wong', 'Andrew T', ''], ['Chau', 'Tom', '']]","['brain-computer interfaces', 'functional near-infrared spectroscopy', 'imagined speech', 'regularized linear discriminant analysis']"
643,1203.0473,Alan Cain,Alan J. Cain and Victor Maltcev,"Finitely presented monoids with linear Dehn function need not have
  regular cross-sections",13 pages; 1 table,"Semigroup Forum, 88, no. 2 (2014), pp. 300--315",10.1007/s00233-013-9531-6,,cs.FL math.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper shows that a finitely presented monoid with linear Dehn function
need not have a regular cross-section, strengthening the previously-known
result that such a monoid need not be presented by a finite complete string
rewriting system, and contrasting the fact that finitely presented groups with
linear Dehn function always have regular cross-sections.
","[{'version': 'v1', 'created': 'Fri, 2 Mar 2012 14:19:16 GMT'}]",2015-10-21,"[['Cain', 'Alan J.', ''], ['Maltcev', 'Victor', '']]","['String rewriting system', 'linear Dehn function', 'regular', 'cross-section', 'unique normal forms']"
644,1811.11668,Sebastian Benthall,Sebastian Benthall and Bruce D. Haynes,Racial categories in machine learning,,,10.1145/3287560.3287575,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Controversies around race and machine learning have sparked debate among
computer scientists over how to design machine learning systems that guarantee
fairness. These debates rarely engage with how racial identity is embedded in
our social experience, making for sociological and psychological complexity.
This complexity challenges the paradigm of considering fairness to be a formal
property of supervised learning with respect to protected personal attributes.
Racial identity is not simply a personal subjective quality. For people labeled
""Black"" it is an ascribed political category that has consequences for social
differentiation embedded in systemic patterns of social inequality achieved
through both social and spatial segregation. In the United States, racial
classification can best be understood as a system of inherently unequal status
categories that places whites as the most privileged category while signifying
the Negro/black category as stigmatized. Social stigma is reinforced through
the unequal distribution of societal rewards and goods along racial lines that
is reinforced by state, corporate, and civic institutions and practices. This
creates a dilemma for society and designers: be blind to racial group
disparities and thereby reify racialized social inequality by no longer
measuring systemic inequality, or be conscious of racial categories in a way
that itself reifies race. We propose a third option. By preceding group
fairness interventions with unsupervised learning to dynamically detect
patterns of segregation, machine learning systems can mitigate the root cause
of social disparities, social segregation and stratification, without further
anchoring status categories of disadvantage.
","[{'version': 'v1', 'created': 'Wed, 28 Nov 2018 16:47:36 GMT'}]",2018-11-29,"[['Benthall', 'Sebastian', ''], ['Haynes', 'Bruce D.', '']]","['fairness', 'machine learning', 'racial classification', 'segregation']"
645,1510.04212,Dmytro Terletskyi,Dmytro Terletskyi,Inheritance in Object-Oriented Knowledge Representation,"in Information and Software Technologies, Communications in Computer
  and Information Science, Springer, 2015","Information and Software Technologies, Volume 538 of the series
  Communications in Computer and Information Science, pp. 293-305, 2015",10.1007/978-3-319-24770-0_26,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper contains the consideration of inheritance mechanism in such
knowledge representation models as object-oriented programming, frames and
object-oriented dynamic networks. In addition, inheritance within
representation of vague and imprecise knowledge are also discussed. New types
of inheritance, general classification of all known inheritance types and
approach, which allows avoiding in many cases problems with exceptions,
redundancy and ambiguity within object-oriented dynamic networks and their
fuzzy extension, are introduced in the paper. The proposed approach bases on
conception of homogeneous and inhomogeneous or heterogeneous class of objects,
which allow building of inheritance hierarchy more flexibly and efficiently.
","[{'version': 'v1', 'created': 'Wed, 14 Oct 2015 17:34:11 GMT'}]",2015-12-22,"[['Terletskyi', 'Dmytro', '']]","['single inheritance', 'multiple inheritance', 'strong inheritance', 'weak inheritance', 'full inheritance', 'partial inheritance']"
646,1703.02091,Han Zhu,"Han Zhu, Junqi Jin, Chang Tan, Fei Pan, Yifan Zeng, Han Li, Kun Gai",Optimized Cost per Click in Taobao Display Advertising,Accepted by KDD 2017,,10.1145/3097983.3098134,,cs.GT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Taobao, as the largest online retail platform in the world, provides billions
of online display advertising impressions for millions of advertisers every
day. For commercial purposes, the advertisers bid for specific spots and target
crowds to compete for business traffic. The platform chooses the most suitable
ads to display in tens of milliseconds. Common pricing methods include cost per
mille (CPM) and cost per click (CPC). Traditional advertising systems target
certain traits of users and ad placements with fixed bids, essentially regarded
as coarse-grained matching of bid and traffic quality. However, the fixed bids
set by the advertisers competing for different quality requests cannot fully
optimize the advertisers' key requirements. Moreover, the platform has to be
responsible for the business revenue and user experience. Thus, we proposed a
bid optimizing strategy called optimized cost per click (OCPC) which
automatically adjusts the bid to achieve finer matching of bid and traffic
quality of page view (PV) request granularity. Our approach optimizes
advertisers' demands, platform business revenue and user experience and as a
whole improves traffic allocation efficiency. We have validated our approach in
Taobao display advertising system in production. The online A/B test shows our
algorithm yields substantially better results than previous fixed bid manner.
","[{'version': 'v1', 'created': 'Mon, 27 Feb 2017 09:51:37 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Mar 2017 03:37:42 GMT'}, {'version': 'v3', 'created': 'Thu, 1 Nov 2018 04:46:51 GMT'}, {'version': 'v4', 'created': 'Tue, 29 Jan 2019 05:06:12 GMT'}]",2019-01-30,"[['Zhu', 'Han', ''], ['Jin', 'Junqi', ''], ['Tan', 'Chang', ''], ['Pan', 'Fei', ''], ['Zeng', 'Yifan', ''], ['Li', 'Han', ''], ['Gai', 'Kun', '']]","['Display Advertising', 'Bid Optimization', 'Probability Estimation']"
647,2102.09390,Al-Akhir Nayan,"Al-Akhir Nayan, Ahamad Nokib Mozumder, Joyeta Saha, Khan Raqib Mahmud,
  Abul Kalam Al Azad, Muhammad Golam Kibria","A Machine Learning Approach for Early Detection of Fish Diseases by
  Analyzing Water Quality",,TRENDS IN SCIENCES 2021; 18(21): 351,10.48048/tis.2021.351,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Early detection of fish diseases and identifying the underlying causes are
crucial for farmers to take necessary steps to mitigate the potential outbreak
and thus to avert financial losses with apparent negative implications to the
national economy. Typically, fish diseases are caused by viruses and bacteria;
according to biochemical studies, the presence of certain bacteria and viruses
may affect the level of pH, DO, BOD, COD, TSS, TDS, EC, PO43-, NO3-N, and NH3-N
in water, resulting in the death of fishes. Besides, natural processes, e.g.,
photosynthesis, respiration, and decomposition, also contribute to the
alteration of water quality that adversely affects fish health. Being motivated
by the recent successes of machine learning techniques, a state-of-art machine
learning algorithm has been adopted in this paper to detect and predict the
degradation of water quality timely and accurately. Thus, it helps to take
preemptive steps against potential fish diseases. The experimental results show
high accuracy in detecting fish diseases specific to water quality based on the
algorithm with real datasets.
","[{'version': 'v1', 'created': 'Mon, 15 Feb 2021 18:52:58 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Nov 2021 09:28:54 GMT'}]",2021-11-12,"[['Nayan', 'Al-Akhir', ''], ['Mozumder', 'Ahamad Nokib', ''], ['Saha', 'Joyeta', ''], ['Mahmud', 'Khan Raqib', ''], ['Azad', 'Abul Kalam Al', ''], ['Kibria', 'Muhammad Golam', '']]","['Water quality analysis', 'Water quality prediction', 'Disease identification', 'Bacteria attack', 'Automatic detection', 'Gradient boosting   Introduction']"
648,1007.4157,Valerio Senni,"Alberto Pettorossi, Maurizio Proietti, and Valerio Senni",Transformations of Logic Programs on Infinite Lists,"37 pages, including the appendix with proofs. This is an extended
  version of a paper published in Theory and Practice of Logic Programming, see
  below","Theory and Practice of Logic Programming, Volume 10, Special Issue
  4-6, 383-399, 2010",10.1017/S1471068410000177,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider an extension of logic programs, called \omega-programs, that can
be used to define predicates over infinite lists. \omega-programs allow us to
specify properties of the infinite behavior of reactive systems and, in
general, properties of infinite sequences of events. The semantics of
\omega-programs is an extension of the perfect model semantics. We present
variants of the familiar unfold/fold rules which can be used for transforming
\omega-programs. We show that these new rules are correct, that is, their
application preserves the perfect model semantics. Then we outline a general
methodology based on program transformation for verifying properties of
\omega-programs. We demonstrate the power of our transformation-based
verification methodology by proving some properties of Buechi automata and
\omega-regular languages.
","[{'version': 'v1', 'created': 'Fri, 23 Jul 2010 15:29:40 GMT'}]",2010-07-26,"[['Pettorossi', 'Alberto', ''], ['Proietti', 'Maurizio', ''], ['Senni', 'Valerio', '']]","['Program Transformation', 'Program Verification', 'Infinite Lists']"
649,2201.02577,Tiago Ferreira,"Tiago Ferreira, Harrison Brewton, Loris D'Antoni, Alexandra Silva",Prognosis: Closed-Box Analysis of Network Protocol Implementations,"ACM SIGCOMM 2021 Conference (SIGCOMM '21), August 23--27, 2021,
  Virtual Event, USA","In Proceedings of the 2021 ACM SIGCOMM 2021 Conference. ACM, New
  York, NY, USA, 762-774",10.1145/3452296.3472938,,cs.NI cs.FL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We present Prognosis, a framework offering automated closed-box learning and
analysis of models of network protocol implementations. Prognosis can learn
models that vary in abstraction level from simple deterministic automata to
models containing data operations, such as register updates, and can be used to
unlock a variety of analysis techniques -- model checking temporal properties,
computing differences between models of two implementations of the same
protocol, or improving testing via model-based test generation. Prognosis is
modular and easily adaptable to different protocols (e.g., TCP and QUIC) and
their implementations. We use Prognosis to learn models of (parts of) three
QUIC implementations -- Quiche (Cloudflare), Google QUIC, and Facebook mvfst --
and use these models to analyze the differences between the various
implementations. Our analysis provides insights into different design choices
and uncovers potential bugs. Concretely, we have found critical bugs in
multiple QUIC implementations, which have been acknowledged by the developers.
","[{'version': 'v1', 'created': 'Sun, 14 Nov 2021 23:20:24 GMT'}]",2022-01-10,"[['Ferreira', 'Tiago', ''], ['Brewton', 'Harrison', ''], [""D'Antoni"", 'Loris', ''], ['Silva', 'Alexandra', '']]","['model learning', 'synthesis', 'varied abstraction modelling', 'bug finding', 'protocol state machines']"
650,cs/0604017,Dmitri Krioukov,"Xenofontas Dimitropoulos, Dmitri Krioukov, Marina Fomenkov, Bradley
  Huffaker, Young Hyun, kc claffy, George Riley",AS Relationships: Inference and Validation,Final journal version,"ACM SIGCOMM Computer Communication Review (CCR), v.37, n.1,
  p.29-40, 2007",10.1145/1198255.1198259,,cs.NI,,"  Research on performance, robustness, and evolution of the global Internet is
fundamentally handicapped without accurate and thorough knowledge of the nature
and structure of the contractual relationships between Autonomous Systems
(ASs). In this work we introduce novel heuristics for inferring AS
relationships. Our heuristics improve upon previous works in several technical
aspects, which we outline in detail and demonstrate with several examples.
Seeking to increase the value and reliability of our inference results, we then
focus on validation of inferred AS relationships. We perform a survey with ASs'
network administrators to collect information on the actual connectivity and
policies of the surveyed ASs. Based on the survey results, we find that our new
AS relationship inference techniques achieve high levels of accuracy: we
correctly infer 96.5% customer to provider (c2p), 82.8% peer to peer (p2p), and
90.3% sibling to sibling (s2s) relationships. We then cross-compare the
reported AS connectivity with the AS connectivity data contained in BGP tables.
We find that BGP tables miss up to 86.2% of the true adjacencies of the
surveyed ASs. The majority of the missing links are of the p2p type, which
highlights the limitations of present measuring techniques to capture links of
this type. Finally, to make our results easily accessible and practically
useful for the community, we open an AS relationship repository where we
archive, on a weekly basis, and make publicly available the complete Internet
AS-level topology annotated with AS relationship information for every pair of
AS neighbors.
","[{'version': 'v1', 'created': 'Thu, 6 Apr 2006 01:04:05 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Apr 2006 01:35:18 GMT'}, {'version': 'v3', 'created': 'Thu, 7 Dec 2006 07:20:37 GMT'}]",2008-04-16,"[['Dimitropoulos', 'Xenofontas', ''], ['Krioukov', 'Dmitri', ''], ['Fomenkov', 'Marina', ''], ['Huffaker', 'Bradley', ''], ['Hyun', 'Young', ''], ['claffy', 'kc', ''], ['Riley', 'George', '']]","['AS relationships', 'inference', 'routing policies']"
651,1701.03947,Tuan Tran,"Tuan Tran, Claudia Nieder\'ee, Nattiya Kanhabua, Ujwal Gadiraju,
  Avishek Anand","Balancing Novelty and Salience: Adaptive Learning to Rank Entities for
  Timeline Summarization of High-impact Events",Published via ACM to CIKM 2015,,10.1145/2806416.2806486,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Long-running, high-impact events such as the Boston Marathon bombing often
develop through many stages and involve a large number of entities in their
unfolding. Timeline summarization of an event by key sentences eases story
digestion, but does not distinguish between what a user remembers and what she
might want to re-check. In this work, we present a novel approach for timeline
summarization of high-impact events, which uses entities instead of sentences
for summarizing the event at each individual point in time. Such entity
summaries can serve as both (1) important memory cues in a retrospective event
consideration and (2) pointers for personalized event exploration. In order to
automatically create such summaries, it is crucial to identify the ""right""
entities for inclusion. We propose to learn a ranking function for entities,
with a dynamically adapted trade-off between the in-document salience of
entities and the informativeness of entities across documents, i.e., the level
of new information associated with an entity for a time point under
consideration. Furthermore, for capturing collective attention for an entity we
use an innovative soft labeling approach based on Wikipedia. Our experiments on
a real large news datasets confirm the effectiveness of the proposed methods.
","[{'version': 'v1', 'created': 'Sat, 14 Jan 2017 16:47:51 GMT'}]",2017-02-12,"[['Tran', 'Tuan', ''], ['Niederée', 'Claudia', ''], ['Kanhabua', 'Nattiya', ''], ['Gadiraju', 'Ujwal', ''], ['Anand', 'Avishek', '']]","['Entity Retrieval', 'Timeline Summarization', 'Wikipedia', 'Learning to Rank', 'News', 'Temporal Ranking']"
652,1204.2465,Fernando  Barreto,"Fernando Barreto, Emilio C. G. Wille and Luiz Nacamura Jr","Fast emergency paths schema to overcome transient link failures in ospf
  routing",18 pages,"International Journal of Computer Networks & Communications
  (IJCNC) Vol.4, No.2, March 2012 17-34",10.5121/ijcnc.2012.4202,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A reliable network infrastructure must be able to sustain traffic flows, even
when a failure occurs and changes the network topology. During the occurrence
of a failure, routing protocols, like OSPF, take from hundreds of milliseconds
to various seconds in order to converge. During this convergence period,
packets might traverse a longer path or even a loop. An even worse transient
behaviour is that packets are dropped even though destinations are reachable.
In this context, this paper describes a proactive fast rerouting approach,
named Fast Emergency Paths Schema (FEP-S), to overcome problems originating
from transient link failures in OSPF routing. Extensive experiments were done
using several network topologies with different dimensionality degrees. Results
show that the recovery paths, obtained by FEPS, are shorter than those from
other rerouting approaches and can improve the network reliability by reducing
the packet loss rate during the routing protocols convergence caused by a
failure.
","[{'version': 'v1', 'created': 'Wed, 11 Apr 2012 14:43:47 GMT'}]",2012-04-12,"[['Barreto', 'Fernando', ''], ['Wille', 'Emilio C. G.', ''], ['Nacamura', 'Luiz', 'Jr']]","['Network protocols', 'OSPF', 'IP rerouting', 'failure recovery']"
653,0912.4660,Johannes Rauh,Johannes Rauh,"Finding the Maximizers of the Information Divergence from an Exponential
  Family",25 pages,"IEEE transactions on information theory, 57 (2011) 6, p. 3236-3247",10.1109/TIT.2011.2136230,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates maximizers of the information divergence from an
exponential family $E$. It is shown that the $rI$-projection of a maximizer $P$
to $E$ is a convex combination of $P$ and a probability measure $P_-$ with
disjoint support and the same value of the sufficient statistics $A$. This
observation can be used to transform the original problem of maximizing
$D(\cdot||E)$ over the set of all probability measures into the maximization of
a function $\Dbar$ over a convex subset of $\ker A$. The global maximizers of
both problems correspond to each other. Furthermore, finding all local
maximizers of $\Dbar$ yields all local maximizers of $D(\cdot||E)$.
  This paper also proposes two algorithms to find the maximizers of $\Dbar$ and
applies them to two examples, where the maximizers of $D(\cdot||E)$ were not
known before.
","[{'version': 'v1', 'created': 'Wed, 23 Dec 2009 15:03:29 GMT'}]",2014-06-18,"[['Rauh', 'Johannes', '']]","['Information divergence', 'relative entropy', 'exponential family', 'optimization', 'binomial equations']"
654,1804.02205,Matthias Zeppelzauer,"Matthias Zeppelzauer, Miroslav Despotovic, Muntaha Sakeena, David
  Koch, Mario D\""oller",Automatic Prediction of Building Age from Photographs,"Preprint of paper to appear in ACM International Conference on
  Multimedia Retrieval (ICMR) 2018 Conference",,10.1145/3206025.3206060,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a first method for the automated age estimation of buildings from
unconstrained photographs. To this end, we propose a two-stage approach that
firstly learns characteristic visual patterns for different building epochs at
patch-level and then globally aggregates patch-level age estimates over the
building. We compile evaluation datasets from different sources and perform an
detailed evaluation of our approach, its sensitivity to parameters, and the
capabilities of the employed deep networks to learn characteristic visual
age-related patterns. Results show that our approach is able to estimate
building age at a surprisingly high level that even outperforms human
evaluators and thereby sets a new performance baseline. This work represents a
first step towards the automated assessment of building parameters for
automated price prediction.
","[{'version': 'v1', 'created': 'Fri, 6 Apr 2018 11:06:43 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Apr 2018 17:45:38 GMT'}]",2018-04-20,"[['Zeppelzauer', 'Matthias', ''], ['Despotovic', 'Miroslav', ''], ['Sakeena', 'Muntaha', ''], ['Koch', 'David', ''], ['Döller', 'Mario', '']]","['Content-based image retrieval', 'visual pattern extraction', 'image classification', 'building analysis', 'building age estimation', 'deep learning']"
655,1805.09542,Etienne Miquey,\'Etienne Miquey (GALLINETTE),A sequent calculus with dependent types for classical arithmetic,"LICS 2018 - 33th Annual ACM/IEEE Symposium on Logic in Computer
  Science, Jul 2018, Oxford, United Kingdom. ACM, pp.720-729, LICS '18
  Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer
  Science",,10.1145/3209108.3209199,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a recent paper, Herbelin developed a calculus dPA$^\omega$ in which
constructive proofs for the axioms of countable and dependent choices could be
derived via the encoding of a proof of countable universal quantification as a
stream of it components. However, the property of normalization (and therefore
the one of soundness) was only conjectured. The difficulty for the proof of
normalization is due to the simultaneous presence of dependent dependent types
(for the constructive part of the choice), of control operators (for classical
logic), of coinductive objects (to encode functions of type $N\rightarrow A$
into streams $(a_0,a_1,\ldots)$) and of lazy evaluation with sharing (for these
coinductive objects).Building on previous works, we introduce in this paper a
variant of dPA$^\omega$ presented as a sequent calculus. On the one hand, we
take advantage of a variant of Krivine classical realizability we developed to
prove the normalization of classical call-by-need. On the other hand, we
benefit of dL, a classical sequent calculus with dependent types in which type
safety is ensured using delimited continuations together with a syntactic
restriction. By combining the techniques developed in these papers, we manage
to define a realizability interpretation {\`a} la Krivine of our calculus that
allows us to prove normalization and soundness.
","[{'version': 'v1', 'created': 'Thu, 24 May 2018 08:22:35 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Dec 2018 12:15:24 GMT'}]",2019-04-22,"[['Miquey', 'Étienne', '', 'GALLINETTE']]","['Curry-Howard', 'dependent choice', 'classical arithmetic', 'side effects', 'dependent types', 'classical realizability', 'sequent calculus']"
656,1612.01608,Julian Togelius,Julian Togelius,"AI Researchers, Video Games Are Your Friends!","in Studies in Computational Intelligence Studies in Computational
  Intelligence, Volume 669 2017. Springer",,10.1007/978-3-319-48506-5_1,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  If you are an artificial intelligence researcher, you should look to video
games as ideal testbeds for the work you do. If you are a video game developer,
you should look to AI for the technology that makes completely new types of
games possible. This chapter lays out the case for both of these propositions.
It asks the question ""what can video games do for AI"", and discusses how in
particular general video game playing is the ideal testbed for artificial
general intelligence research. It then asks the question ""what can AI do for
video games"", and lays out a vision for what video games might look like if we
had significantly more advanced AI at our disposal. The chapter is based on my
keynote at IJCCI 2015, and is written in an attempt to be accessible to a broad
audience.
","[{'version': 'v1', 'created': 'Tue, 6 Dec 2016 00:46:57 GMT'}]",2016-12-07,"[['Togelius', 'Julian', '']]","['Artificial Intelligence', 'Games', 'Artificial General Intelligence']"
657,1801.04479,Philipp Mayr,"Marcia Lei Zeng, Philipp Mayr","Knowledge Organization Systems (KOS) in the Semantic Web: A
  Multi-Dimensional Review","31 pages, 12 figures, accepted paper in International Journal on
  Digital Libraries",,10.1007/s00799-018-0241-2,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since the Simple Knowledge Organization System (SKOS) specification and its
SKOS eXtension for Labels (SKOS-XL) became formal W3C recommendations in 2009 a
significant number of conventional knowledge organization systems (KOS)
(including thesauri, classification schemes, name authorities, and lists of
codes and terms, produced before the arrival of the ontology-wave) have made
their journeys to join the Semantic Web mainstream. This paper uses ""LOD KOS""
as an umbrella term to refer to all of the value vocabularies and lightweight
ontologies within the Semantic Web framework. The paper provides an overview of
what the LOD KOS movement has brought to various communities and users. These
are not limited to the colonies of the value vocabulary constructors and
providers, nor the catalogers and indexers who have a long history of applying
the vocabularies to their products. The LOD dataset producers and LOD service
providers, the information architects and interface designers, and researchers
in sciences and humanities, are also direct beneficiaries of LOD KOS. The paper
examines a set of the collected cases (experimental or in real applications)
and aims to find the usages of LOD KOS in order to share the practices and
ideas among communities and users. Through the viewpoints of a number of
different user groups, the functions of LOD KOS are examined from multiple
dimensions. This paper focuses on the LOD dataset producers, vocabulary
producers, and researchers (as end-users of KOS).
","[{'version': 'v1', 'created': 'Sat, 13 Jan 2018 18:58:44 GMT'}]",2018-12-10,"[['Zeng', 'Marcia Lei', ''], ['Mayr', 'Philipp', '']]","['Linked Open Data', 'Knowledge Organization Systems', 'LOD KOS functions', 'Personas']"
658,1210.2316,Mario Alviano,"Mario Alviano, Wolfgang Faber, Nicola Leone and Marco Manna","Disjunctive Datalog with Existential Quantifiers: Semantics,
  Decidability, and Complexity Issues","18 pages, 1 figure, 1 table, 1 procedure, presented at ICLP 2012","Theory and Practice of Logic Programming 12 (4-5): 701-718, 2012",10.1017/S1471068412000257,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Datalog is one of the best-known rule-based languages, and extensions of it
are used in a wide context of applications. An important Datalog extension is
Disjunctive Datalog, which significantly increases the expressivity of the
basic language. Disjunctive Datalog is useful in a wide range of applications,
ranging from Databases (e.g., Data Integration) to Artificial Intelligence
(e.g., diagnosis and planning under incomplete knowledge). However, in recent
years an important shortcoming of Datalog-based languages became evident, e.g.
in the context of data-integration (consistent query-answering, ontology-based
data access) and Semantic Web applications: The language does not permit any
generation of and reasoning with unnamed individuals in an obvious way. In
general, it is weak in supporting many cases of existential quantification. To
overcome this problem, Datalogex has recently been proposed, which extends
traditional Datalog by existential quantification in rule heads. In this work,
we propose a natural extension of Disjunctive Datalog and Datalogex, called
Datalogexor, which allows both disjunctions and existential quantification in
rule heads and is therefore an attractive language for knowledge representation
and reasoning, especially in domains where ontology-based reasoning is needed.
We formally define syntax and semantics of the language Datalogexor, and
provide a notion of instantiation, which we prove to be adequate for
Datalogexor. A main issue of Datalogex and hence also of Datalogexor is that
decidability is no longer guaranteed for typical reasoning tasks. In order to
address this issue, we identify many decidable fragments of the language, which
extend, in a natural way, analog classes defined in the non-disjunctive case.
Moreover, we carry out an in-depth complexity analysis, deriving interesting
results which range from Logarithmic Space to Exponential Time.
","[{'version': 'v1', 'created': 'Mon, 8 Oct 2012 15:49:41 GMT'}]",2012-10-09,"[['Alviano', 'Mario', ''], ['Faber', 'Wolfgang', ''], ['Leone', 'Nicola', ''], ['Manna', 'Marco', '']]","['Datalog', 'Non-monotonic Reasoning', 'Decidability', 'Complexity']"
659,1809.00159,Renato Marroqu\'in,"Renato Marroqu\'in, Ingo M\""uller, Darko Makreshanski and Gustavo
  Alonso","Pay One, Get Hundreds for Free: Reducing Cloud Costs through Shared
  Query Execution",,"Proceedings of the ACM Symposium on Cloud Computing (SoCC) 2018,
  pages 439-450",10.1145/3267809.3267822,,cs.DB,http://creativecommons.org/licenses/by/4.0/,"  Cloud-based data analysis is nowadays common practice because of the lower
system management overhead as well as the pay-as-you-go pricing model. The
pricing model, however, is not always suitable for query processing as heavy
use results in high costs. For example, in query-as-a-service systems, where
users are charged per processed byte, collections of queries accessing the same
data frequently can become expensive. The problem is compounded by the limited
options for the user to optimize query execution when using declarative
interfaces such as SQL. In this paper, we show how, without modifying existing
systems and without the involvement of the cloud provider, it is possible to
significantly reduce the overhead, and hence the cost, of query-as-a-service
systems. Our approach is based on query rewriting so that multiple concurrent
queries are combined into a single query. Our experiments show the aggregated
amount of work done by the shared execution is smaller than in a
query-at-a-time approach. Since queries are charged per byte processed, the
cost of executing a group of queries is often the same as executing a single
one of them. As an example, we demonstrate how the shared execution of the
TPC-H benchmark is up to 100x and 16x cheaper in Amazon Athena and Google
BigQuery than using a query-at-a-time approach while achieving a higher
throughput.
","[{'version': 'v1', 'created': 'Sat, 1 Sep 2018 12:15:16 GMT'}]",2020-04-07,"[['Marroquín', 'Renato', ''], ['Müller', 'Ingo', ''], ['Makreshanski', 'Darko', ''], ['Alonso', 'Gustavo', '']]","['Data Warehouse', 'Shared Workload Execution', 'Query Processing', 'Cloud Computing', 'Serverless']"
660,1607.08480,Ashutosh Trivedi,"Shibashis Guha and Marcin Jurdzinski and Krishna S. and Ashutosh
  Trivedi",Mean-Payoff Games on Timed Automata,"29 pages, unpublished manuscript, submitted to FSTTCS",,10.4230/LIPIcs.FSTTCS.2016.44,,cs.GT cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mean-payoff games on timed automata are played on the infinite weighted graph
of configurations of priced timed automata between two players, Player Min and
Player Max, by moving a token along the states of the graph to form an infinite
run. The goal of Player Min is to minimize the limit average weight of the run,
while the goal of the Player Max is the opposite. Brenguier, Cassez, and Raskin
recently studied a variation of these games and showed that mean-payoff games
are undecidable for timed automata with five or more clocks. We refine this
result by proving the undecidability of mean-payoff games with three clocks. On
a positive side, we show the decidability of mean-payoff games on one-clock
timed automata with binary price-rates. A key contribution of this paper is the
application of dynamic programming based proof techniques applied in the
context of average reward optimization on an uncountable state and action
space.
","[{'version': 'v1', 'created': 'Thu, 28 Jul 2016 14:36:30 GMT'}]",2020-01-16,"[['Guha', 'Shibashis', ''], ['Jurdzinski', 'Marcin', ''], ['S.', 'Krishna', ''], ['Trivedi', 'Ashutosh', '']]","['Timed Automata', 'Mean-Payoff Games', 'Controller-Synthesis']"
661,1901.00811,Alexandre Coninx,"Seungsu Kim, Alexandre Coninx, Stephane Doncieux","From exploration to control: learning object manipulation skills through
  novelty search and local adaptation","30 pages, 18 figures, accepted for publication in Robotics and
  Autonomous Systems",,10.1016/j.robot.2020.103710,,cs.RO cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Programming a robot to deal with open-ended tasks remains a challenge, in
particular if the robot has to manipulate objects. Launching, grasping, pushing
or any other object interaction can be simulated but the corresponding models
are not reversible and the robot behavior thus cannot be directly deduced.
These behaviors are hard to learn without a demonstration as the search space
is large and the reward sparse. We propose a method to autonomously generate a
diverse repertoire of simple object interaction behaviors in simulation. Our
goal is to bootstrap a robot learning and development process with limited
information about what the robot has to achieve and how. This repertoire can be
exploited to solve different tasks in reality thanks to a proposed adaptation
method or could be used as a training set for data-hungry algorithms.
  The proposed approach relies on the definition of a goal space and generates
a repertoire of trajectories to reach attainable goals, thus allowing the robot
to control this goal space. The repertoire is built with an off-the-shelf
simulation thanks to a quality diversity algorithm. The result is a set of
solutions tested in simulation only. It may result in two different problems:
(1) as the repertoire is discrete and finite, it may not contain the trajectory
to deal with a given situation or (2) some trajectories may lead to a behavior
in reality that differs from simulation because of a reality gap. We propose an
approach to deal with both issues by using a local linearization of the mapping
between the motion parameters and the observed effects. Furthermore, we present
an approach to update the existing solutions repertoire with the tests done on
the real robot. The approach has been validated on two different experiments on
the Baxter robot: a ball launching and a joystick manipulation tasks.
","[{'version': 'v1', 'created': 'Thu, 3 Jan 2019 16:46:27 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Nov 2020 09:21:35 GMT'}]",2020-12-15,"[['Kim', 'Seungsu', ''], ['Coninx', 'Alexandre', ''], ['Doncieux', 'Stephane', '']]","['Quality-diversity search', 'evolutionary algorithm', 'long-life learning', 'robotics', 'developmental robotics', 'behavior repertoire']"
662,2004.00396,Jan Stolarek,"Frank Emrich, Sam Lindley, Jan Stolarek, James Cheney, Jonathan Coates",FreezeML: Complete and Easy Type Inference for First-Class Polymorphism,"48 pages, 23 Figures. Accepted for PLDI 2020",,10.1145/3385412.3386003,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  ML is remarkable in providing statically typed polymorphism without the
programmer ever having to write any type annotations. The cost of this
parsimony is that the programmer is limited to a form of polymorphism in which
quantifiers can occur only at the outermost level of a type and type variables
can be instantiated only with monomorphic types.
  Type inference for unrestricted System F-style polymorphism is undecidable in
general. Nevertheless, the literature abounds with a range of proposals to
bridge the gap between ML and System F.
  We put forth a new proposal, FreezeML, a conservative extension of ML with
two new features. First, let- and lambda-binders may be annotated with
arbitrary System F types. Second, variable occurrences may be frozen,
explicitly disabling instantiation. FreezeML is equipped with type-preserving
translations back and forth between System F and admits a type inference
algorithm, an extension of algorithm W, that is sound and complete and which
yields principal types.
","[{'version': 'v1', 'created': 'Wed, 1 Apr 2020 12:48:07 GMT'}]",2020-04-02,"[['Emrich', 'Frank', ''], ['Lindley', 'Sam', ''], ['Stolarek', 'Jan', ''], ['Cheney', 'James', ''], ['Coates', 'Jonathan', '']]","['first-class polymorphism', 'type inference', 'impredicative types']"
663,1904.03756,Issam Damaj,Issam Damaj (Rafik Hariri University),Higher-Level Hardware Synthesis of The KASUMI Algorithm,,Jrnl. Comp. Sc. & Tech. Springer. 22(2007) 60-70,10.1016/j.advengsoft.2006.01.009,,cs.AR cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Programmable Logic Devices (PLDs) continue to grow in size and currently
contain several millions of gates. At the same time, research effort is going
into higher-level hardware synthesis methodologies for reconfigurable computing
that can exploit PLD technology. In this paper, we explore the effectiveness
and extend one such formal methodology in the design of massively parallel
algorithms. We take a step-wise refinement approach to the development of
correct reconfigurable hardware circuits from formal specifications. A
functional programming notation is used for specifying algorithms and for
reasoning about them. The specifications are realised through the use of a
combination of function decomposition strategies, data refinement techniques,
and off-the-shelf refinements based upon higher-order functions. The
off-the-shelf refinements are inspired by the operators of Communicating
Sequential Processes (CSP) and map easily to programs in Handel-C (a hardware
description language). The Handel-C descriptions are directly compiled into
reconfigurable hardware. The practical realisation of this methodology is
evidenced by a case studying the third generation mobile communication security
algorithms. The investigated algorithm is the KASUM} block cipher. In this
paper, we obtain several hardware implementations with different performance
characteristics by applying different refinements to the algorithm. The
developed designs are compiled and tested under Celoxica's RC-1000
reconfigurable computer with its 2 million gates Virtex-E FPGA. Performance
analysis and evaluation of these implementations are included.
","[{'version': 'v1', 'created': 'Sun, 7 Apr 2019 22:15:36 GMT'}]",2019-04-09,"[['Damaj', 'Issam', '', 'Rafik Hariri University']]","['Data encryption', 'Formal Models', 'Gate Array', 'Methodologies', 'Parallel algorithms1Introduction']"
664,2102.07098,Jiwei Tan,"Shaowei Yao, Jiwei Tan, Xi Chen, Keping Yang, Rong Xiao, Hongbo Deng
  and Xiaojun Wan",Learning a Product Relevance Model from Click-Through Data in E-Commerce,Accepted to TheWebConf/WWW 2021,,10.1145/3442381.3450129,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The search engine plays a fundamental role in online e-commerce systems, to
help users find the products they want from the massive product collections.
Relevance is an essential requirement for e-commerce search, since showing
products that do not match search query intent will degrade user experience.
With the existence of vocabulary gap between user language of queries and
seller language of products, measuring semantic relevance is necessary and
neural networks are engaged to address this task. However, semantic relevance
is different from click-through rate prediction in that no direct training
signal is available. Most previous attempts learn relevance models from user
click-through data that are cheap and abundant. Unfortunately, click behavior
is noisy and misleading, which is affected by not only relevance but also
factors including price, image and attractive titles. Therefore, it is
challenging but valuable to learn relevance models from click-through data. In
this paper, we propose a new relevance learning framework that concentrates on
how to train a relevance model from the weak supervision of click-through data.
Different from previous efforts that treat samples as either relevant or
irrelevant, we construct more fine-grained samples for training. We propose a
novel way to consider samples of different relevance confidence, and come up
with a new training objective to learn a robust relevance model with desirable
score distribution. The proposed model is evaluated on offline annotated data
and online A/B testing, and it achieves both promising performance and high
computational efficiency. The model has already been deployed online, serving
the search traffic of Taobao for over a year.
","[{'version': 'v1', 'created': 'Sun, 14 Feb 2021 08:05:11 GMT'}]",2021-02-16,"[['Yao', 'Shaowei', ''], ['Tan', 'Jiwei', ''], ['Chen', 'Xi', ''], ['Yang', 'Keping', ''], ['Xiao', 'Rong', ''], ['Deng', 'Hongbo', ''], ['Wan', 'Xiaojun', '']]","['neural networks', 'e-commerce', 'semantic matching']"
665,1805.05845,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg","On the complexity of the correctness problem for non-zeroness test
  instruction sequences","32 pages, minor revision with several obscurities made clear","Theoretical Computer Science, 802:1--18, 2020",10.1016/j.tcs.2019.03.040,,cs.LO cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper concerns the question to what extent it can be efficiently
determined whether an arbitrary program correctly solves a given problem. This
question is investigated with programs of a very simple form, namely
instruction sequences, and a very simple problem, namely the non-zeroness test
on natural numbers. The instruction sequences concerned are of a kind by which,
for each $n > 0$, each function from $\{0,1\}^n$ to $\{0,1\}$ can be computed.
The established results include the time complexities of the problem of
determining whether an arbitrary instruction sequence correctly implements the
restriction to $\{0,1\}^n$ of the function from $\{0,1\}^*$ to $\{0,1\}$ that
models the non-zeroness test function, for $n > 0$, under several restrictions
on the arbitrary instruction sequence.
","[{'version': 'v1', 'created': 'Tue, 15 May 2018 15:22:51 GMT'}, {'version': 'v2', 'created': 'Sun, 25 Nov 2018 13:26:09 GMT'}, {'version': 'v3', 'created': 'Tue, 26 Feb 2019 16:18:23 GMT'}]",2019-11-22,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['non-zeroness test', 'instruction sequence', 'correctness problem', 'computational complexity']"
666,1809.03336,Le Thanh Nguyen-Meidine,"Le Thanh Nguyen-Meidine, Eric Granger, Madhu Kiran, Louis-Antoine
  Blais-Morin","A Comparison of CNN-based Face and Head Detectors for Real-Time Video
  Surveillance Applications",,,10.1109/IPTA.2017.8310113,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detecting faces and heads appearing in video feeds are challenging tasks in
real-world video surveillance applications due to variations in appearance,
occlusions and complex backgrounds. Recently, several CNN architectures have
been proposed to increase the accuracy of detectors, although their
computational complexity can be an issue, especially for real-time
applications, where faces and heads must be detected live using high-resolution
cameras. This paper compares the accuracy and complexity of state-of-the-art
CNN architectures that are suitable for face and head detection. Single pass
and region-based architectures are reviewed and compared empirically to
baseline techniques according to accuracy and to time and memory complexity on
images from several challenging datasets. The viability of these architectures
is analyzed with real-time video surveillance applications in mind. Results
suggest that, although CNN architectures can achieve a very high level of
accuracy compared to traditional detectors, their computational cost can
represent a limitation for many practical real-time applications.
","[{'version': 'v1', 'created': 'Mon, 10 Sep 2018 14:14:34 GMT'}]",2018-09-11,"[['Nguyen-Meidine', 'Le Thanh', ''], ['Granger', 'Eric', ''], ['Kiran', 'Madhu', ''], ['Blais-Morin', 'Louis-Antoine', '']]","['Face Detection', 'Head Detection', 'ConvolutionalNNs', 'Video Surveillance']"
667,1509.04250,Ond\v{r}ej Roko\v{s},"O. Roko\v{s}, J. M\'aca","The response of grandstands driven by filtered Gaussian white noise
  processes","20 pages, 12 figures, 4 tables","Advances in Engineering Software, Volume 72, June 2014, Pages
  85--94, Special Issue dedicated to Professor Zden\v{e}k Bittnar on the
  occasion of his Seventieth Birthday: Part 2",10.1016/j.advengsoft.2013.05.008,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a semi-analytical estimate of the response of a
grandstand occupied by an active crowd and by a passive crowd. Filtered
Gaussian white noise processes are used to approximate the loading terms
representing an active crowd. Lumped biodynamic models with a single degree of
freedom are included to reflect passive spectators occupying the structure. The
response is described in terms of the first two moments, employing the It\^o
formula and the state augmentation method for the stationary time domain
solution. The quality of the approximation is compared on the basis of three
examples of varying complexity using Monte Carlo simulation based on a
synthetic generator available in the literature. For comparative purposes,
there is also a brief review of frequency domain estimates.
","[{'version': 'v1', 'created': 'Mon, 14 Sep 2015 19:23:06 GMT'}]",2015-09-15,"[['Rokoš', 'O.', ''], ['Máca', 'J.', '']]","['grandstand response', 'random vibration', 'active crowd', 'white noise process', 'filtration']"
668,1512.07780,Ruben Verborgh,"Ruben Verborgh, D\""orthe Arndt, Sofie Van Hoecke, Jos De Roo, Giovanni
  Mels, Thomas Steiner, Joaquim Gabarro",The Pragmatic Proof: Hypermedia API Composition and Execution,"Under consideration in Theory and Practice of Logic Programming
  (TPLP)",,10.1017/S1471068416000016,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine clients are increasingly making use of the Web to perform tasks.
While Web services traditionally mimic remote procedure calling interfaces, a
new generation of so-called hypermedia APIs works through hyperlinks and forms,
in a way similar to how people browse the Web. This means that existing
composition techniques, which determine a procedural plan upfront, are not
sufficient to consume hypermedia APIs, which need to be navigated at runtime.
Clients instead need a more dynamic plan that allows them to follow hyperlinks
and use forms with a preset goal. Therefore, in this article, we show how
compositions of hypermedia APIs can be created by generic Semantic Web
reasoners. This is achieved through the generation of a proof based on semantic
descriptions of the APIs' functionality. To pragmatically verify the
applicability of compositions, we introduce the notion of pre-execution and
post-execution proofs. The runtime interaction between a client and a server is
guided by proofs but driven by hypermedia, allowing the client to react to the
application's actual state indicated by the server's response. We describe how
to generate compositions from descriptions, discuss a computer-assisted process
to generate descriptions, and verify reasoner performance on various
composition tasks using a benchmark suite. The experimental results lead to the
conclusion that proof-based consumption of hypermedia APIs is a feasible
strategy at Web scale.
","[{'version': 'v1', 'created': 'Thu, 24 Dec 2015 10:30:25 GMT'}]",2016-03-16,"[['Verborgh', 'Ruben', ''], ['Arndt', 'Dörthe', ''], ['Van Hoecke', 'Sofie', ''], ['De Roo', 'Jos', ''], ['Mels', 'Giovanni', ''], ['Steiner', 'Thomas', ''], ['Gabarro', 'Joaquim', '']]","['composition', 'proof', 'reasoning', 'Semantic Web', 'hypermedia APIs', 'Web APIs']"
669,1407.6318,Reza Azad,"Reza Azad, Fatemeh Davami","A robust and adaptable method for face detection based on Color
  Probabilistic Estimation Technique",,"International Journal of Research in Computer Science A Unit of
  White Globe Publications, Volume 3, Issue 6, 2013",10.7815/ijorcs.36.2013.072,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human face perception is currently an active research area in the computer
vision community. Skin detection is one of the most important and primary
stages for this purpose. So far, many approaches are proposed to done this
case. Near all of these methods have tried to find best match intensity
distribution with skin pixels based on popular color spaces such as RGB, HSI or
YCBCR. Results show that these methods cannot provide an accurate approach for
every kind of skin. In this paper, an approach is proposed to solve this
problem using a color probabilistic estimation technique. This approach is
including two stages. In the first one, the skin intensity distribution is
estimated using some train photos of pure skin, and at the second stage, the
skin pixels are detected using Gaussian model and optimal threshold tuning.
Then from the skin region facial features have been extracted to get the face
from the skin region. In the results section, the proposed approach is applied
on FEI database and the accuracy rate reached 99.25%. The proposed approach can
be used for all kinds of skin using train stage which is the main advantage
among the other advantages, such as Low noise sensitivity and low computational
complexity.
","[{'version': 'v1', 'created': 'Wed, 23 Jul 2014 18:12:08 GMT'}]",2014-07-24,"[['Azad', 'Reza', ''], ['Davami', 'Fatemeh', '']]","['Face Detection', 'Image Processing', 'Threshold tuning', 'Gaussian Model feature extraction']"
670,1608.07094,Mahamad Suhil,"D S Guru, Mahamad Suhil",A Novel Term_Class Relevance Measure for Text Categorization,"12 pages, 6 figures, 2 tables","Procedia Computer Science, vol.45, pp.13-22, 2015",10.1016/j.procs.2015.03.074,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce a new measure called Term_Class relevance to
compute the relevancy of a term in classifying a document into a particular
class. The proposed measure estimates the degree of relevance of a given term,
in placing an unlabeled document to be a member of a known class, as a product
of Class_Term weight and Class_Term density; where the Class_Term weight is the
ratio of the number of documents of the class containing the term to the total
number of documents containing the term and the Class_Term density is the
relative density of occurrence of the term in the class to the total occurrence
of the term in the entire population. Unlike the other existing term weighting
schemes such as TF-IDF and its variants, the proposed relevance measure takes
into account the degree of relative participation of the term across all
documents of the class to the entire population. To demonstrate the
significance of the proposed measure experimentation has been conducted on the
20 Newsgroups dataset. Further, the superiority of the novel measure is brought
out through a comparative analysis.
","[{'version': 'v1', 'created': 'Thu, 25 Aug 2016 11:46:06 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Sep 2016 12:51:50 GMT'}]",2016-09-15,"[['Guru', 'D S', ''], ['Suhil', 'Mahamad', '']]","['text categorization', 'term weight', 'term-document relevance', 'term_class relevance', 'supervised term weighting', 'unsupervised term weighting']"
671,1902.00549,David Rauch,"David Rauch (Hasso Plattner Institute, Germany), Patrick Rein (Hasso
  Plattner Institute, Germany), Stefan Ramson (Hasso Plattner Institute,
  Germany), Jens Lincke (Hasso Plattner Institute, University of Potsdam,
  Germany), Robert Hirschfeld (Hasso-Plattner-Institut (HPI), Germany)","Babylonian-style Programming: Design and Implementation of an
  Integration of Live Examples into General-purpose Source Code",,"The Art, Science, and Engineering of Programming, 2019, Vol. 3,
  Issue 3, Article 9",10.22152/programming-journal.org/2019/3/9,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When working on a program, developers traditionally have to simulate the
behavior of the abstract code in their heads until they can execute the
application. Live programming aims to support the development and comprehension
of programs by providing more immediate feedback on program behavior, but the
divide between code and behavior often remains. The goal of example-based live
programming is to remove this gap by allowing programmers to explore the actual
behavior of their code during development. This is achieved by defining live
examples for parts of the application. The idea of live examples has been
already addressed in other tools and environments. However, most of those
solutions are limited to specific domains and are suitable only for small
programs. Thus, we aim to extend the application of example-based live
programming to more complex programs potentially spanning multiple modules. We
investigate existing solutions to derive a set of requirements for an
integration of live examples into source code. Based on these requirements we
propose a new approach to live examples and present a prototype in its support.
We reproduce, discuss, and extend scenarios from related work to show the
practicality of our approach in the context of larger, more complicated, and
with that also more realistic scenarios. Also, we measure and evaluate the
system response time of our prototypical implementation. Our first results show
that example-based live programming can provide more insights into the run-time
behavior of parameterized code for non-trivial programs. They also reveal
unsolved and new challenges affecting example-based live programming
environments. In presenting this more general approach to example-based live
programming, we hope to motivate further research into this area and to make
practical solutions available.
","[{'version': 'v1', 'created': 'Fri, 1 Feb 2019 20:17:07 GMT'}]",2019-02-05,"[['Rauch', 'David', '', 'Hasso Plattner Institute, Germany'], ['Rein', 'Patrick', '', 'Hasso\n  Plattner Institute, Germany'], ['Ramson', 'Stefan', '', 'Hasso Plattner Institute,\n  Germany'], ['Lincke', 'Jens', '', 'Hasso Plattner Institute, University of Potsdam,\n  Germany'], ['Hirschfeld', 'Robert', '', 'Hasso-Plattner-Institut']]","['live programming', 'exploratory programming', 'example-based programming', 'example-centric']"
672,2105.05490,Muhammad Ashfaq,"Muhammad Ashfaq, Rubing Huang, Dave Towey, Michael Omari, Dmitry
  Yashunin, Patrick Kwaku Kudjo, Tao Zhang","SWFC-ART: A Cost-effective Approach for Fixed-Size-Candidate-Set
  Adaptive Random Testing through Small World Graphs",26 Pages,,10.1016/j.jss.2021.111008,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Adaptive random testing (ART) improves the failure-detection effectiveness of
random testing by leveraging properties of the clustering of failure-causing
inputs of most faulty programs: ART uses a sampling mechanism that evenly
spreads test cases within a software's input domain. The widely-used
Fixed-Sized-Candidate-Set ART (FSCS-ART) sampling strategy faces a quadratic
time cost, which worsens as the dimensionality of the software input domain
increases. In this paper, we propose an approach based on small world graphs
that can enhance the computational efficiency of FSCS-ART: SWFC-ART. To
efficiently perform nearest neighbor queries for candidate test cases, SWFC-ART
incrementally constructs a hierarchical navigable small world graph for
previously executed, non-failure-causing test cases. Moreover, SWFC-ART has
shown consistency in programs with high dimensional input domains. Our
simulation and empirical studies show that SWFC-ART reduces the computational
overhead of FSCS-ART from quadratic to log-linear order while maintaining the
failure-detection effectiveness of FSCS-ART, and remaining consistent in high
dimensional input domains. We recommend using SWFC-ART in practical software
testing scenarios, where real-life programs often have high dimensional input
domains and low failure rates.
","[{'version': 'v1', 'created': 'Wed, 12 May 2021 07:54:43 GMT'}]",2021-06-01,"[['Ashfaq', 'Muhammad', ''], ['Huang', 'Rubing', ''], ['Towey', 'Dave', ''], ['Omari', 'Michael', ''], ['Yashunin', 'Dmitry', ''], ['Kudjo', 'Patrick Kwaku', ''], ['Zhang', 'Tao', '']]","['Software Testing', 'Random Testing', 'Adaptive Random Testing', 'Efficiency', 'Hierarchical Navigable Small World Graphs']"
673,1706.07119,Antonio H. Ribeiro,Ant\^onio H. Ribeiro and Luis A. Aguirre,"""Parallel Training Considered Harmful?"": Comparing series-parallel and
  parallel feedforward network training",,"Neurocomputing 316:222--231, (2018)",10.1016/j.neucom.2018.07.071,,cs.SY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural network models for dynamic systems can be trained either in parallel
or in series-parallel configurations. Influenced by early arguments, several
papers justify the choice of series-parallel rather than parallel configuration
claiming it has a lower computational cost, better stability properties during
training and provides more accurate results. Other published results, on the
other hand, defend parallel training as being more robust and capable of
yielding more accu- rate long-term predictions. The main contribution of this
paper is to present a study comparing both methods under the same unified
framework. We focus on three aspects: i) robustness of the estimation in the
presence of noise; ii) computational cost; and, iii) convergence. A unifying
mathematical framework and simulation studies show situations where each
training method provides better validation results, being parallel training
better in what is believed to be more realistic scenarios. An example using
measured data seems to reinforce such claim. We also show, with a novel
complexity analysis and numerical examples, that both methods have similar
computational cost, being series series-parallel training, however, more
amenable to parallelization. Some informal discussion about stability and
convergence properties is presented and explored in the examples.
","[{'version': 'v1', 'created': 'Wed, 21 Jun 2017 21:00:44 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Oct 2017 15:48:27 GMT'}, {'version': 'v3', 'created': 'Tue, 14 Aug 2018 13:46:31 GMT'}]",2019-05-06,"[['Ribeiro', 'Antônio H.', ''], ['Aguirre', 'Luis A.', '']]","['Neural network', 'parallel training', 'series-parallel training', 'systemidentification', 'output error models']"
674,1810.09878,Tara Salman,"Deval Bhamare, Tara Salman, Mohammed Samaka, Aiman Erbad, Raj Jain",Feasibility of Supervised Machine Learning for Cloud Security,,"2016 International Conference on Information Science and Security
  (ICISS)",10.1109/ICISSEC.2016.7885853,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing is gaining significant attention, however, security is the
biggest hurdle in its wide acceptance. Users of cloud services are under
constant fear of data loss, security threats and availability issues. Recently,
learning-based methods for security applications are gaining popularity in the
literature with the advents in machine learning techniques. However, the major
challenge in these methods is obtaining real-time and unbiased datasets. Many
datasets are internal and cannot be shared due to privacy issues or may lack
certain statistical characteristics. As a result of this, researchers prefer to
generate datasets for training and testing purpose in the simulated or closed
experimental environments which may lack comprehensiveness. Machine learning
models trained with such a single dataset generally result in a semantic gap
between results and their application. There is a dearth of research work which
demonstrates the effectiveness of these models across multiple datasets
obtained in different environments. We argue that it is necessary to test the
robustness of the machine learning models, especially in diversified operating
conditions, which are prevalent in cloud scenarios. In this work, we use the
UNSW dataset to train the supervised machine learning models. We then test
these models with ISOT dataset. We present our results and argue that more
research in the field of machine learning is still required for its
applicability to the cloud security.
","[{'version': 'v1', 'created': 'Tue, 23 Oct 2018 14:23:43 GMT'}]",2018-10-24,"[['Bhamare', 'Deval', ''], ['Salman', 'Tara', ''], ['Samaka', 'Mohammed', ''], ['Erbad', 'Aiman', ''], ['Jain', 'Raj', '']]","['Cloud', 'Machine Learning', 'Security', 'Supervised Learning']"
675,1907.09620,Kelsey Allen,"Kelsey R. Allen, Kevin A. Smith, Joshua B. Tenenbaum","Rapid trial-and-error learning with simulation supports flexible tool
  use and physical reasoning","This manuscript is in press at PNAS. It is an extended version of a
  paper ""Rapid Trial-and-Error Learning in Physical Problem Solving"" accepted
  for oral presentation at the 41st Annual Meeting of the Cognitive Science
  Society (2019). It represents ongoing work on the part of the authors",,10.1073/pnas.1912341117,,cs.AI cs.LG cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many animals, and an increasing number of artificial agents, display
sophisticated capabilities to perceive and manipulate objects. But human beings
remain distinctive in their capacity for flexible, creative tool use -- using
objects in new ways to act on the world, achieve a goal, or solve a problem. To
study this type of general physical problem solving, we introduce the Virtual
Tools game. In this game, people solve a large range of challenging physical
puzzles in just a handful of attempts. We propose that the flexibility of human
physical problem solving rests on an ability to imagine the effects of
hypothesized actions, while the efficiency of human search arises from rich
action priors which are updated via observations of the world. We instantiate
these components in the ""Sample, Simulate, Update"" (SSUP) model and show that
it captures human performance across 30 levels of the Virtual Tools game. More
broadly, this model provides a mechanism for explaining how people condense
general physical knowledge into actionable, task-specific plans to achieve
flexible and efficient physical problem-solving.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2019 22:49:27 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Jul 2019 18:15:30 GMT'}, {'version': 'v3', 'created': 'Mon, 29 Jun 2020 17:05:56 GMT'}]",2022-10-12,"[['Allen', 'Kelsey R.', ''], ['Smith', 'Kevin A.', ''], ['Tenenbaum', 'Joshua B.', '']]","['Intuitive Physics', 'Physical Problem Solving', 'Tool Use']"
676,1902.09647,Richard Mortier,"Poonam Yadav, Qi Li, Anthony Brown, Richard Mortier",Network Service Dependencies in Commodity Internet-of-Things Devices,"IoTDI '19: Internet of Things Design and Implementation, April
  15--18, 2019, Montreal, QC, Canada",,10.1145/3302505.3310082,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We continue to see increasingly widespread deployment of IoT devices, with
apparent intent to embed them in our built environment likely to accelerate if
smart city and related programmes succeed. In this paper we are concerned with
the ways in which current generation IoT devices are being designed in terms of
their ill-considered dependencies on network connectivity and services. Our
hope is to provide evidence that such dependencies need to be better thought
through in design, and better documented in implementation so that those
responsible for deploying these devices can be properly informed as to the
impact of device deployment (at scale) on infrastructure resilience. We believe
this will be particularly relevant as we feel that commodity IoT devices are
likely to be commonly used to retrofit `smart' capabilities to existing
buildings, particularly domestic buildings.
  To the existing body of work on network-level behaviour of IoT devices, we
add \one~a protocol-level breakdown and analysis of periodicity, \two~an
exploration of the service and infrastructure dependencies that will implicitly
be taken in `smart' environments when IoT devices are deployed, and
\three~examination of the robustness of device operation when connectivity is
disrupted. We find that many devices make use of services distributed across
the planet and thus appear dependent on the global network infrastructure even
when carrying out purely local actions. Some devices cease to operate properly
without network connectivity (even where their behaviour appears, on the face
of it, to require only local information, e.g.,~the Hive thermostat). Further,
they exhibit quite different network behaviours, typically involving
significantly more traffic and possibly use of otherwise unobserved protocols,
when connectivity is recovered after some disruption.
","[{'version': 'v1', 'created': 'Mon, 25 Feb 2019 22:40:34 GMT'}]",2019-02-27,"[['Yadav', 'Poonam', ''], ['Li', 'Qi', ''], ['Brown', 'Anthony', ''], ['Mortier', 'Richard', '']]","['IoT', 'Infrastructure', 'Measurement', 'Scalability', 'Resilience']"
677,1512.06943,EPTCS,"Salvador Lucas (DSIC, Universitat Polit\`ecnica de Val\`encia, Spain)","Synthesis of models for order-sorted first-order theories using linear
  algebra and constraint solving","In Proceedings PROLE 2015, arXiv:1512.06178","EPTCS 200, 2015, pp. 32-47",10.4204/EPTCS.200.3,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent developments in termination analysis for declarative programs
emphasize the use of appropriate models for the logical theory representing the
program at stake as a generic approach to prove termination of declarative
programs. In this setting, Order-Sorted First-Order Logic provides a powerful
framework to represent declarative programs. It also provides a target logic to
obtain models for other logics via transformations. We investigate the
automatic generation of numerical models for order-sorted first-order logics
and its use in program analysis, in particular in termination analysis of
declarative programs. We use convex domains to give domains to the different
sorts of an order-sorted signature; we interpret the ranked symbols of sorted
signatures by means of appropriately adapted convex matrix interpretations.
Such numerical interpretations permit the use of existing algorithms and tools
from linear algebra and arithmetic constraint solving to synthesize the models.
","[{'version': 'v1', 'created': 'Tue, 22 Dec 2015 03:16:34 GMT'}]",2015-12-23,"[['Lucas', 'Salvador', '', 'DSIC, Universitat Politècnica de València, Spain']]","['Linear algebra', 'Logical models', 'Order-sorted first-order logic', 'Program Termination']"
678,2008.01919,Xiaojun Jia,"Xiaojun Jia, Xingxing Wei, Xiaochun Cao and Xiaoguang Han",Adv-watermark: A Novel Watermark Perturbation for Adversarial Examples,,ACM MM2020,,,cs.CR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent research has demonstrated that adding some imperceptible perturbations
to original images can fool deep learning models. However, the current
adversarial perturbations are usually shown in the form of noises, and thus
have no practical meaning. Image watermark is a technique widely used for
copyright protection. We can regard image watermark as a king of meaningful
noises and adding it to the original image will not affect people's
understanding of the image content, and will not arouse people's suspicion.
Therefore, it will be interesting to generate adversarial examples using
watermarks. In this paper, we propose a novel watermark perturbation for
adversarial examples (Adv-watermark) which combines image watermarking
techniques and adversarial example algorithms. Adding a meaningful watermark to
the clean images can attack the DNN models. Specifically, we propose a novel
optimization algorithm, which is called Basin Hopping Evolution (BHE), to
generate adversarial watermarks in the black-box attack mode. Thanks to the
BHE, Adv-watermark only requires a few queries from the threat models to finish
the attacks. A series of experiments conducted on ImageNet and CASIA-WebFace
datasets show that the proposed method can efficiently generate adversarial
examples, and outperforms the state-of-the-art attack methods. Moreover,
Adv-watermark is more robust against image transformation defense methods.
","[{'version': 'v1', 'created': 'Wed, 5 Aug 2020 03:28:43 GMT'}, {'version': 'v2', 'created': 'Sat, 29 Aug 2020 19:10:01 GMT'}]",2020-09-01,"[['Jia', 'Xiaojun', ''], ['Wei', 'Xingxing', ''], ['Cao', 'Xiaochun', ''], ['Han', 'Xiaoguang', '']]","['Adversarial Examples', 'Watermark Perturbation', 'Basin HoppingEvolution']"
679,2105.10325,Jana Kierdorf,"Jana Kierdorf, Immanuel Weber, Anna Kicherer, Laura Zabawa, Lukas
  Drees, Ribana Roscher","Behind the leaves -- Estimation of occluded grapevine berries with
  conditional generative adversarial networks","45 pages, 18 figures, 1 table",,10.3389/frai.2022.830026,,cs.CV cs.LG cs.NE,http://creativecommons.org/licenses/by/4.0/,"  The need for accurate yield estimates for viticulture is becoming more
important due to increasing competition in the wine market worldwide. One of
the most promising methods to estimate the harvest is berry counting, as it can
be approached non-destructively, and its process can be automated. In this
article, we present a method that addresses the challenge of occluded berries
with leaves to obtain a more accurate estimate of the number of berries that
will enable a better estimate of the harvest. We use generative adversarial
networks, a deep learning-based approach that generates a likely scenario
behind the leaves exploiting learned patterns from images with non-occluded
berries. Our experiments show that the estimate of the number of berries after
applying our method is closer to the manually counted reference. In contrast to
applying a factor to the berry count, our approach better adapts to local
conditions by directly involving the appearance of the visible berries.
Furthermore, we show that our approach can identify which areas in the image
should be changed by adding new berries without explicitly requiring
information about hidden areas.
","[{'version': 'v1', 'created': 'Fri, 21 May 2021 12:57:48 GMT'}]",2022-03-28,"[['Kierdorf', 'Jana', ''], ['Weber', 'Immanuel', ''], ['Kicherer', 'Anna', ''], ['Zabawa', 'Laura', ''], ['Drees', 'Lukas', ''], ['Roscher', 'Ribana', '']]","['Machine Learning', 'Deep Learning', 'Neural Networks', 'Generative']"
680,2105.04869,Pawan Goyal,Pawan Goyal and Peter Benner,"Discovery of Nonlinear Dynamical Systems using a Runge-Kutta Inspired
  Dictionary-based Sparse Regression Approach",,,10.1098/rspa.2021.0883,,cs.LG cs.CE,http://creativecommons.org/licenses/by/4.0/,"  Discovering dynamical models to describe underlying dynamical behavior is
essential to draw decisive conclusions and engineering studies, e.g.,
optimizing a process. Experimental data availability notwithstanding has
increased significantly, but interpretable and explainable models in science
and engineering yet remain incomprehensible. In this work, we blend machine
learning and dictionary-based learning with numerical analysis tools to
discover governing differential equations from noisy and sparsely-sampled
measurement data. We utilize the fact that given a dictionary containing huge
candidate nonlinear functions, dynamical models can often be described by a few
appropriately chosen candidates. As a result, we obtain interpretable and
parsimonious models which are prone to generalize better beyond the sampling
regime. Additionally, we integrate a numerical integration framework with
dictionary learning that yields differential equations without requiring or
approximating derivative information at any stage. Hence, it is utterly
effective in corrupted and sparsely-sampled data. We discuss its extension to
governing equations, containing rational nonlinearities that typically appear
in biological networks. Moreover, we generalized the method to governing
equations that are subject to parameter variations and externally controlled
inputs. We demonstrate the efficiency of the method to discover a number of
diverse differential equations using noisy measurements, including a model
describing neural dynamics, chaotic Lorenz model, Michaelis-Menten Kinetics,
and a parameterized Hopf normal form.
","[{'version': 'v1', 'created': 'Tue, 11 May 2021 08:46:51 GMT'}]",2022-10-12,"[['Goyal', 'Pawan', ''], ['Benner', 'Peter', '']]","['Artificial intelligence', 'machine learning', 'dictionary learning', 'nonlinear dynamicalsystems', 'differential equations']"
681,1306.3517,Piotr Br\'odka,"Bogdan Gliwa, Piotr Br\'odka, Anna Zygmunt, Stanis{\l}aw Saganowski,
  Przemys{\l}aw Kazienko, Jaros{\l}aw Ko\'zlak",Different Approaches to Community Evolution Prediction in Blogosphere,SNAA2013 at ASONAM2013 IEEE Computer Society,,10.1145/2492517.2500231,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predicting the future direction of community evolution is a problem with high
theoretical and practical significance. It allows to determine which
characteristics describing communities have importance from the point of view
of their future behaviour. Knowledge about the probable future career of the
community aids in the decision concerning investing in contact with members of
a given community and carrying out actions to achieve a key position in it. It
also allows to determine effective ways of forming opinions or to protect group
participants against such activities. In the paper, a new approach to group
identification and prediction of future events is presented together with the
comparison to existing method. Performed experiments prove a high quality of
prediction results. Comparison to previous studies shows that using many
measures to describe the group profile, and in consequence as a classifier
input, can improve predictions.
","[{'version': 'v1', 'created': 'Fri, 14 Jun 2013 21:07:15 GMT'}]",2016-11-15,"[['Gliwa', 'Bogdan', ''], ['Bródka', 'Piotr', ''], ['Zygmunt', 'Anna', ''], ['Saganowski', 'Stanisław', ''], ['Kazienko', 'Przemysław', ''], ['Koźlak', 'Jarosław', '']]","['social network', 'group evolution', 'predicting group evolution', 'group dynamics', 'social network analysis', 'GED', 'SGCI']"
682,1107.1609,Kazushi Mimura,Kazushi Mimura,"Linear Complexity Lossy Compressor for Binary Redundant Memoryless
  Sources","4 pages, 1 figure","J. Phys. Soc. Jpn., 80, 9 093801 (2011)",10.1143/JPSJ.80.093801,,cs.IT cond-mat.dis-nn math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A lossy compression algorithm for binary redundant memoryless sources is
presented. The proposed scheme is based on sparse graph codes. By introducing a
nonlinear function, redundant memoryless sequences can be compressed. We
propose a linear complexity compressor based on the extended belief
propagation, into which an inertia term is heuristically introduced, and show
that it has near-optimal performance for moderate block lengths.
","[{'version': 'v1', 'created': 'Fri, 8 Jul 2011 11:17:54 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Jul 2011 13:25:38 GMT'}]",2011-08-19,"[['Mimura', 'Kazushi', '']]","['nonlinear function', 'LDGM codes', 'lossy compression', 'replica method']"
683,1902.02501,Leon Bo\v{s}njak Mr.,Leon Bo\v{s}njak and Bo\v{s}tjan Brumen,Shoulder Surfing: From An Experimental Study to a Comparative Framework,"45 pages, 6 figures, 4 tables",International Journal of Human - Computer Studies (2019),10.1016/j.ijhcs.2019.04.003,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Shoulder surfing is an attack vector widely recognized as a real threat -
enough to warrant researchers dedicating a considerable effort toward designing
novel authentication methods to be shoulder surfing resistant. Despite a
multitude of proposed solutions over the years, few have employed empirical
evaluations and comparisons between different methods, and our understanding of
the shoulder surfing phenomenon remains limited. Barring the challenges in
experimental design, the reason for that can be primarily attributed to the
lack of objective and comparable vulnerability measures. In this paper, we
develop an ensemble of vulnerability metrics, a first endeavour toward a
comprehensive assessment of a given method's susceptibility to observational
attacks. In the largest on-site shoulder surfing experiment (n = 274) to date,
we verify the model on four conceptually different authentication methods in
two observation scenarios. On the example of a novel hybrid authentication
method based on associations, we explore the effect of input type on the
adversary's effectiveness. We provide first empirical evidence that graphical
passwords are easier to observe; however, that does not necessarily mean that
the observed information will allow the attacker to guess the victim's password
easier. An in-depth analysis of individual metrics within the clusters offers
insight into many additional aspects of the shoulder surfing attack not
explored before. Our comparative framework makes an advancement in evaluation
of shoulder surfing and furthers our understanding of observational attacks.
The results have important implications for future shoulder surfing studies and
the field of Password Security as a whole.
","[{'version': 'v1', 'created': 'Thu, 7 Feb 2019 07:29:21 GMT'}, {'version': 'v2', 'created': 'Sat, 20 Apr 2019 22:43:22 GMT'}]",2019-04-23,"[['Bošnjak', 'Leon', ''], ['Brumen', 'Boštjan', '']]","['Shoulder Surfing', 'Textual Passwords', 'Graphical Passwords', 'Authentication', 'Comparative Framework', 'Vulnerability Evaluation']"
684,1108.1572,Hasan Tavakoli,"H. Tavakoli, M. Ahmadian Attari, M. Reza Peyghami",Optimal Rate for Irregular LDPC Codes in Binary Erasure Channel,"5 pages, to be presented at the 2011 IEEE Information Theory Workshop
  (ITW 2011), Paraty, Brazil, October, 2011",,10.1109/ITW.2011.6089360,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce a new practical and general method for solving
the main problem of designing the capacity approaching, optimal rate, irregular
low-density parity-check (LDPC) code ensemble over binary erasure channel
(BEC). Compared to some new researches, which are based on application of
asymptotic analysis tools out of optimization process, the proposed method is
much simpler, faster, accurate and practical. Because of not using any
relaxation or any approximate solution like previous works, the found answer
with this method is optimal. We can construct optimal variable node degree
distribution for any given binary erasure rate, {\epsilon}, and any check node
degree distribution. The presented method is implemented and works well in
practice. The time complexity of this method is of polynomial order. As a
result, we obtain some degree distribution which their rates are close to the
capacity.
","[{'version': 'v1', 'created': 'Sun, 7 Aug 2011 20:23:05 GMT'}]",2016-11-18,"[['Tavakoli', 'H.', ''], ['Attari', 'M. Ahmadian', ''], ['Peyghami', 'M. Reza', '']]","['component;LDPC code', 'Infinite analysis method', 'Density evolution', 'LP', 'SDP']"
685,1305.1824,Marc Hellmuth,"Marc Hellmuth, Manuel Noll and Lydia Ostermeier","Strong Products of Hypergraphs: Unique Prime Factorization Theorems and
  Algorithms",,,10.1016/j.dam.2014.02.017,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is well-known that all finite connected graphs have a unique prime factor
decomposition (PFD) with respect to the strong graph product which can be
computed in polynomial time. Essential for the PFD computation is the
construction of the so-called Cartesian skeleton of the graphs under
investigation.
  In this contribution, we show that every connected thin hypergraph H has a
unique prime factorization with respect to the normal and strong (hypergraph)
product. Both products coincide with the usual strong graph product whenever H
is a graph. We introduce the notion of the Cartesian skeleton of hypergraphs as
a natural generalization of the Cartesian skeleton of graphs and prove that it
is uniquely defined for thin hypergraphs. Moreover, we show that the Cartesian
skeleton of hypergraphs can be determined in O(|E|^2) time and that the PFD can
be computed in O(|V|^2|E|) time, for hypergraphs H = (V,E) with bounded degree
and bounded rank.
","[{'version': 'v1', 'created': 'Wed, 8 May 2013 14:12:38 GMT'}]",2015-01-27,"[['Hellmuth', 'Marc', ''], ['Noll', 'Manuel', ''], ['Ostermeier', 'Lydia', '']]","['Hypergraph', 'strong product', 'normal product', 'Prime Factor Decomposition Algorithms', 'CartesianSkeleton']"
686,1606.06726,Tobias Pape,"Tobias Pape, Carl Friedrich Bolz, Robert Hirschfeld","Adaptive Just-in-time Value Class Optimization for Lowering Memory
  Consumption and Improving Execution Time Performance",,,10.1016/j.scico.2016.08.003,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The performance of value classes is highly dependent on how they are
represented in the virtual machine. Value class instances are immutable, have
no identity, and can only refer to other value objects or primitive values and
since they should be very lightweight and fast, it is important to optimize
them carefully. In this paper we present a technique to detect and compress
common patterns of value class usage to improve memory usage and performance.
The technique identifies patterns of frequent value object references and
introduces abbreviated forms for them. This allows to store multiple
inter-referenced value objects in an inlined memory representation, reducing
the overhead stemming from meta-data and object references. Applied to a small
prototype and an implementation of the Racket language, we found improvements
in memory usage and execution time for several micro-benchmarks.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2016 19:57:15 GMT'}]",2016-08-30,"[['Pape', 'Tobias', ''], ['Bolz', 'Carl Friedrich', ''], ['Hirschfeld', 'Robert', '']]","['Meta-tracing', 'JIT', 'Data Structure Optimization', 'Value Classes']"
687,1407.2025,Ali Alsahlany,Ali M. Alsahlany,"Performance Analysis of VOIP Traffic Over Integrating Wireless LAN and
  WAN Using Different Codecs",,"International Journal of Wireless & Mobile Networks (IJWMN)Vol. 6,
  No. 3, June 2014",10.5121/ijwmn.2014.6306,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A simulation model is presented to analyze and evaluate the performance of
VoIP based integrated wireless LAN/WAN with taking into account various voice
encoding schemes. The network model was simulated using OPNET Modeler software.
Different parameters that indicate the QoS like MOS, jitter, end to end delay,
traffic send and traffic received are calculated and analyzed in Wireless
LAN/WAN scenarios. Depending on this evaluation, Selection codecs G.729A
consider the best choice for VoIP.
","[{'version': 'v1', 'created': 'Tue, 8 Jul 2014 10:22:06 GMT'}]",2014-07-09,"[['Alsahlany', 'Ali M.', '']]","['VoIP', 'Codecs', 'QoS']"
688,1808.09407,V\'it Novotn\'y,"V\'it Novotn\'y (1) ((1) Faculty of Informatics, Masaryk University,
  Brno, Czech Republic)",Implementation Notes for the Soft Cosine Measure,"This is the author's version of the work. It is posted here for your
  personal use. Not for redistribution. The definitive Version of Record was
  published in The 27th ACM International Conference on Information and
  Knowledge Management (CIKM '18), October 22-26, 2018, Torino, Italy,
  https://doi.org/10.1145/3269206.3269317",,10.1145/3269206.3269317,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The standard bag-of-words vector space model (VSM) is efficient, and
ubiquitous in information retrieval, but it underestimates the similarity of
documents with the same meaning, but different terminology. To overcome this
limitation, Sidorov et al. proposed the Soft Cosine Measure (SCM) that
incorporates term similarity relations. Charlet and Damnati showed that the SCM
is highly effective in question answering (QA) systems. However, the
orthonormalization algorithm proposed by Sidorov et al. has an impractical time
complexity of $\mathcal O(n^4)$, where n is the size of the vocabulary.
  In this paper, we prove a tighter lower worst-case time complexity bound of
$\mathcal O(n^3)$. We also present an algorithm for computing the similarity
between documents and we show that its worst-case time complexity is $\mathcal
O(1)$ given realistic conditions. Lastly, we describe implementation in
general-purpose vector databases such as Annoy, and Faiss and in the inverted
indices of text search engines such as Apache Lucene, and ElasticSearch. Our
results enable the deployment of the SCM in real-world information retrieval
systems.
","[{'version': 'v1', 'created': 'Tue, 28 Aug 2018 16:57:34 GMT'}]",2018-08-30,"[['Novotný', 'Vít', '']]","['Vector Space Model', 'computational complexity', 'similarity measure']"
689,1809.10954,Sheng He,Sheng He and Lambert Schomaker,"Deep Adaptive Learning for Writer Identification based on Single
  Handwritten Word Images",Under view of Pattern Recognition,,10.1016/j.patcog.2018.11.003,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  There are two types of information in each handwritten word image: explicit
information which can be easily read or derived directly, such as lexical
content or word length, and implicit attributes such as the author's identity.
Whether features learned by a neural network for one task can be used for
another task remains an open question. In this paper, we present a deep
adaptive learning method for writer identification based on single-word images
using multi-task learning. An auxiliary task is added to the training process
to enforce the emergence of reusable features. Our proposed method transfers
the benefits of the learned features of a convolutional neural network from an
auxiliary task such as explicit content recognition to the main task of writer
identification in a single procedure. Specifically, we propose a new adaptive
convolutional layer to exploit the learned deep features. A multi-task neural
network with one or several adaptive convolutional layers is trained
end-to-end, to exploit robust generic features for a specific main task, i.e.,
writer identification. Three auxiliary tasks, corresponding to three explicit
attributes of handwritten word images (lexical content, word length and
character attributes), are evaluated. Experimental results on two benchmark
datasets show that the proposed deep adaptive learning method can improve the
performance of writer identification based on single-word images, compared to
non-adaptive and simple linear-adaptive approaches.
","[{'version': 'v1', 'created': 'Fri, 28 Sep 2018 10:40:23 GMT'}]",2018-11-20,"[['He', 'Sheng', ''], ['Schomaker', 'Lambert', '']]","['Writer identification', 'Deep adaptive learning', 'Handwritten wordattributes', 'Multi-task learning']"
690,1812.07101,Sourya Sengupta,"Sourya Sengupta, Amitojdeep Singh, Henry A.Leopold, Tanmay Gulati,
  Vasudevan Lakshminarayanan","Application of Deep Learning in Fundus Image Processing for Ophthalmic
  Diagnosis -- A Review",,"Artificial Intelligence in Medicine Volume 102, January 2020,
  101758",10.1016/j.artmed.2019.101758,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An overview of the applications of deep learning in ophthalmic diagnosis
using retinal fundus images is presented. We also review various retinal image
datasets that can be used for deep learning purposes. Applications of deep
learning for segmentation of optic disk, blood vessels and retinal layer as
well as detection of lesions are reviewed. Recent deep learning models for
classification of diseases such as age-related macular degeneration,
glaucoma,diabetic macular edema and diabetic retinopathy are also reported.
","[{'version': 'v1', 'created': 'Sun, 9 Dec 2018 05:57:17 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Feb 2019 01:59:58 GMT'}, {'version': 'v3', 'created': 'Fri, 5 Jul 2019 19:57:45 GMT'}]",2020-01-24,"[['Sengupta', 'Sourya', ''], ['Singh', 'Amitojdeep', ''], ['Leopold', 'Henry A.', ''], ['Gulati', 'Tanmay', ''], ['Lakshminarayanan', 'Vasudevan', '']]","['Deep Learning', 'Ophthalmology', 'Image Segmentation', 'Classification', 'Fundus Photos', 'Fundus Image Datasets', 'Retina']"
691,2206.04361,Wentao Zhang,"Wentao Zhang, Zeang Sheng, Ziqi Yin, Yuezihan Jiang, Yikuan Xia, Jun
  Gao, Zhi Yang, Bin Cui",Model Degradation Hinders Deep Graph Neural Networks,"11 pages, 10 figures","In Proceedings of the 28th ACM SIGKDD Conference on Knowledge
  Discovery and Data Mining, 2022",10.1145/3534678.3539374,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph Neural Networks (GNNs) have achieved great success in various graph
mining tasks.However, drastic performance degradation is always observed when a
GNN is stacked with many layers. As a result, most GNNs only have shallow
architectures, which limits their expressive power and exploitation of deep
neighborhoods.Most recent studies attribute the performance degradation of deep
GNNs to the \textit{over-smoothing} issue. In this paper, we disentangle the
conventional graph convolution operation into two independent operations:
\textit{Propagation} (\textbf{P}) and \textit{Transformation}
(\textbf{T}).Following this, the depth of a GNN can be split into the
propagation depth ($D_p$) and the transformation depth ($D_t$). Through
extensive experiments, we find that the major cause for the performance
degradation of deep GNNs is the \textit{model degradation} issue caused by
large $D_t$ rather than the \textit{over-smoothing} issue mainly caused by
large $D_p$. Further, we present \textit{Adaptive Initial Residual} (AIR), a
plug-and-play module compatible with all kinds of GNN architectures, to
alleviate the \textit{model degradation} issue and the \textit{over-smoothing}
issue simultaneously. Experimental results on six real-world datasets
demonstrate that GNNs equipped with AIR outperform most GNNs with shallow
architectures owing to the benefits of both large $D_p$ and $D_t$, while the
time costs associated with AIR can be ignored.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2022 09:02:01 GMT'}]",2022-06-10,"[['Zhang', 'Wentao', ''], ['Sheng', 'Zeang', ''], ['Yin', 'Ziqi', ''], ['Jiang', 'Yuezihan', ''], ['Xia', 'Yikuan', ''], ['Gao', 'Jun', ''], ['Yang', 'Zhi', ''], ['Cui', 'Bin', '']]","['empirical analysis', 'graph neural networks', 'plug-and-play module']"
692,1805.06821,Giovanni Manzini,"Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles","External memory BWT and LCP computation for sequence collections with
  applications",,,10.4230/LIPIcs.WABI.2018.10,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an external memory algorithm for the computation of the BWT and
LCP array for a collection of sequences. Our algorithm takes the amount of
available memory as an input parameter, and tries to make the best use of it by
splitting the input collection into subcollections sufficiently small that it
can compute their BWT in RAM using an optimal linear time algorithm. Next, it
merges the partial BWTs in external memory and in the process it also computes
the LCP values. We prove that our algorithm performs O(n AveLcp) sequential
I/Os, where n is the total length of the collection, and AveLcp is the average
Longest Common Prefix of the collection. This bound is an improvement over the
known algorithms for the same task. The experimental results show that our
algorithm outperforms the current best algorithm for collections of sequences
with different lengths and for collections with relatively small average
Longest Common Prefix.
  In the second part of the paper, we show that our algorithm can be modified
to output two additional arrays that, used with the BWT and LCP arrays, provide
simple, scan based, external memory algorithms for three well known problems in
bioinformatics: the computation of maximal repeats, the all pairs suffix-prefix
overlaps, and the construction of succinct de Bruijn graphs. To our knowledge,
there are no other known external memory algorithms for these problems.
","[{'version': 'v1', 'created': 'Thu, 17 May 2018 15:28:49 GMT'}]",2020-09-10,"[['Egidi', 'Lavinia', ''], ['Louza', 'Felipe A.', ''], ['Manzini', 'Giovanni', ''], ['Telles', 'Guilherme P.', '']]","['Burrows-Wheeler Transform', 'Longest Common Prefix Array', 'All pairssuffix-prefix overlaps', 'Succinct de Bruijn graph', 'Maximal repeats']"
693,1808.00878,Hazrat Ali,"Hazrat Ali, Adnan Ali Awan, Sanaullah Khan, Omer Shafique, Atiq ur
  Rahman, Shahid Khan","Supervised classification for object identification in urban areas using
  satellite imagery","2018 International Conference on Computing, Mathematics and
  Engineering Technologies (iCoMET)","H. Ali et al., 2018 International Conference on Computing,
  Mathematics and Engineering Technologies (iCoMET), Sukkur, 2018, pp. 1-4",10.1109/ICOMET.2018.8346383,,cs.LG cs.CV eess.SP stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper presents a useful method to achieve classification in satellite
imagery. The approach is based on pixel level study employing various features
such as correlation, homogeneity, energy and contrast. In this study gray-scale
images are used for training the classification model. For supervised
classification, two classification techniques are employed namely the Support
Vector Machine (SVM) and the Naive Bayes. With textural features used for
gray-scale images, Naive Bayes performs better with an overall accuracy of 76%
compared to 68% achieved by SVM. The computational time is evaluated while
performing the experiment with two different window sizes i.e., 50x50 and
70x70. The required computational time on a single image is found to be 27
seconds for a window size of 70x70 and 45 seconds for a window size of 50x50.
","[{'version': 'v1', 'created': 'Thu, 2 Aug 2018 16:00:32 GMT'}]",2018-08-03,"[['Ali', 'Hazrat', ''], ['Awan', 'Adnan Ali', ''], ['Khan', 'Sanaullah', ''], ['Shafique', 'Omer', ''], ['Rahman', 'Atiq ur', ''], ['Khan', 'Shahid', '']]","['SVM', 'Naïve Bayes', 'Classification', 'Satellite']"
694,1607.00591,Naima Kaabouch,"Hector Reyes, Sriram Subramaniam, and Naima Kaabouch","A Bayesian Network Model of the Bit Error Rate for Cognitive Radio
  Networks","4 pages, IEEE Wireless and Microwave Technology Conference (WAMICON),
  2015",,10.1109/WAMICON.2015.7120377,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In addition to serve as platforms for dynamic spectrum access, cognitive
radios can also serve as a method for improving the performance of wireless
communication systems by smartly adjusting their operating parameters according
to the environment and requirements. The uncertainty always present in the
environment makes the practical implementation of the latter application
difficult. In this paper, we propose a probabilistic graphical model, Bayesian
network that captures the causal relationships among the variables bit energy
to noise spectral density ratio (EbN0), carrier to interference ratio (C/I),
modulation scheme (MOD), Doppler phase shift (Dop_Phi), and bit error rate
(BER). BER indicates how the communication link is performing. The goal of our
proposed Bayesian network is to use the BER as evidence in order to infer the
behavior of the other variables, so the cognitive radio can learn how the
conditions of the environment are, and based on that knowledge make better
informed decisions. This model along with the method used to build it are
described in this paper.
","[{'version': 'v1', 'created': 'Sun, 3 Jul 2016 05:02:43 GMT'}]",2016-11-18,"[['Reyes', 'Hector', ''], ['Subramaniam', 'Sriram', ''], ['Kaabouch', 'Naima', '']]","['Cognitive radio', 'performance', 'Bayesian']"
695,1212.5421,Zungeru Adamu Murtala,"A. M. Zungeru, A. J. Garba, J. G. Kolo, M. S. Ahmed and I. Olumide","Design of a Smart Embedded Uninterrupted Power Supply System for
  Personal Computers","20 pages, 15 figures, 4 tables, journal paper","International Journal of Embedded Systems and Applications
  (IJESA), vol. 2(4), pp. 1-19, 2012",10.5121/ijesa.2012.2401,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Digital equipment such as computers, telecommunication systems and
instruments use microprocessors that operate at high frequencies allowing them
to carry out millions or even billions of operations per second. A disturbance
in the electrical supply lasting just a few milliseconds can affect thousands
or millions of basic operations. The result may be malfunctioning and loss of
data with dangerous or costly consequences (e.g. loss of production). That is
why many loads, called sensitive or critical loads, require a supply that is
protected. Many manufacturers of sensitive equipment specify very strict
tolerances, much stricter than those in the distribution system for the supply
of their equipment, one example being Computer Business Equipment Manufacturers
Association for computer equipment against distribution system disturbances.
The design of this uninterrupted power supply (UPS) for personal computer (PC)
is necessitated due to a need for enhanced portability in the design of
personal computer desktop workstations. Apart from its original functionality
as a backup source of power, this design incorporates the unit within the
system unit casing, thereby reducing the number of system components available.
Also, the embedding of this unit removes the untidiness of connecting wires and
makes the whole computer act like a laptop. Not to be left out is the choice of
a microcontroller as an important part of the circuitry. This has eliminated
the weight and space-consuming components that make up an original design. The
singular use of this microcontroller places the UPS under the class of an
advanced technology device.
","[{'version': 'v1', 'created': 'Fri, 21 Dec 2012 13:23:06 GMT'}]",2012-12-24,"[['Zungeru', 'A. M.', ''], ['Garba', 'A. J.', ''], ['Kolo', 'J. G.', ''], ['Ahmed', 'M. S.', ''], ['Olumide', 'I.', '']]","['Embedded System', 'Uninterrupted Power Supply', 'Personal Computer', 'Automation', 'Power Electronics']"
696,1307.3294,Md. Maklachur Rahman,Md. Maklachur Rahman,"A dwt, dct and svd based watermarking technique to protect the image
  piracy","12 pages, 12 figures and 1 table","International Journal of Managing Public Sector Information and
  Communication Technologies (IJMPICT) Vol. 4, No. 2, June 2013",10.5121/ijmpict.2013.4203,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rapid development of information technology and multimedia, the use
of digital data is increasing day by day. So it becomes very essential to
protect multimedia information from piracy and also it is challenging. A great
deal of Copyright owners is worried about protecting any kind of illegal
repetition of their information. Hence, facing all these kinds of problems
development of the techniques is very important. Digital watermarking
considered as a solution to prevent the multimedia data. In this paper, an idea
of watermarking is proposed and implemented. In proposed watermarking method,
the original image is rearranged using zigzag sequence and DWT is applied on
rearranged image. Then DCT and SVD are applied on all high bands LH, HL and HH.
Watermark is then embedded by modifying the singular values of these bands.
Extraction of watermark is performed by the inversion of watermark embedding
process. For choosing of these three bands it gives facility of mid-band and
pure high band that ensures good imperceptibility and more robustness against
different kinds of attacks.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2013 23:35:44 GMT'}]",2013-07-15,"[['Rahman', 'Md. Maklachur', '']]","['DWT', 'DCT', 'SVD', 'Watermarking', 'Zigzag.  1']"
697,1201.2481,K Munivara Prasad,"K. Munivara Prasad, A. Rama Mohan Reddy, M. Ganesh Karthik","Flooding attacks to internet threat monitors (ITM): Modeling and counter
  measures using botnet and honeypots",,"International Journal of Computer Science & Information Technology
  (IJCSIT) Vol 3, No 6, Dec 2011, 159-172",10.5121/ijcsit.2011.3612,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The Internet Threat Monitoring (ITM),is a globally scoped Internet monitoring
system whose goal is to measure, detect, characterize, and track threats such
as distribute denial of service(DDoS) attacks and worms. To block the
monitoring system in the internet the attackers are targeted the ITM system. In
this paper we address flooding attack against ITM system in which the attacker
attempt to exhaust the network and ITM's resources, such as network bandwidth,
computing power, or operating system data structures by sending the malicious
traffic. We propose an information-theoretic frame work that models the
flooding attacks using Botnet on ITM. Based on this model we generalize the
flooding attacks and propose an effective attack detection using Honeypots.
","[{'version': 'v1', 'created': 'Thu, 12 Jan 2012 06:07:03 GMT'}]",2012-01-13,"[['Prasad', 'K. Munivara', ''], ['Reddy', 'A. Rama Mohan', ''], ['Karthik', 'M. Ganesh', '']]","['Internet Threat Monitors (ITM)', 'DDoS', 'Flooding attack', 'Botnet and Honeypot']"
698,1805.09250,Adib Rastegarnia,"Douglas Comer, Rajas H. Karandikar, Adib Rastegarnia",Umbrella: A Unified Software Defined Development Framework,"work-in-progress paper, under submission",,10.1145/3230718.3233546,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Northbound (NB) APIs that SDN controllers provide differ in terms of
architecture, syntax, naming convention, data resources, and usage. Using NB
APIs to write SDN applications makes each application dependent on the API of a
specific controller. To bring NB APIs from different vendors under one umbrella
and make programming of SDN applications independent of specific controllers,
we propose a unified software defined development framework that we call
Umbrella. This paper presents the key components of the software and reports
some preliminary results.
","[{'version': 'v1', 'created': 'Sun, 29 Apr 2018 20:16:04 GMT'}]",2019-01-10,"[['Comer', 'Douglas', ''], ['Karandikar', 'Rajas H.', ''], ['Rastegarnia', 'Adib', '']]","['Software Defined Networking', 'Northbound API', 'REST API', 'Networks Programming Interfaces']"
699,2105.09507,Masoud Jalayer,"Masoud Jalayer, Morvarid Azheian, Mehrdad Mohammad Ali Kermani","A hybrid algorithm based on Community Detection and Multi-Attribute
  Decision-Making for Influence Maximization","30 pages, 20 figures",,10.1016/j.cie.2018.04.049,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The influence maximization problem is trying to identify a set of K nodes by
which the spread of influence, diseases, or information is maximized. The
optimization of influence by finding such a set is an NP-hard problem and a key
issue in analyzing complex networks. In this paper, a new greedy and hybrid
approach based on a community detection algorithm and a MADM technique (TOPSIS)
is proposed to cope with the problem, called, Greedy TOPSIS and Community-Based
(GTaCB) algorithm. The paper concisely introduces community detection and the
TOPSIS technique, then it presents the pseudo-code of the proposed algorithm.
Afterward, it compares the performance of the solution which is found by GTaCB
with some well-known greedy algorithms, based on Degree Centrality, Closeness
Centrality, Betweenness Centrality, PageRank as well as TOPSIS, from two
aspects: diffusion quality and diffusion speed. In order to evaluate the
performance of GTaCB, computational experiments on nine different types of
real-world networks are provided. The tests are conducted via one of the
renowned epidemic diffusion models, namely, Susceptible-Infected-Recovered
(SIR) model. The simulations exhibit that in most of the cases the proposed
algorithm significantly outperforms the others, chiefly as the number of
initial nodes or probability of infection increases.
","[{'version': 'v1', 'created': 'Thu, 20 May 2021 04:17:22 GMT'}]",2021-05-21,"[['Jalayer', 'Masoud', ''], ['Azheian', 'Morvarid', ''], ['Kermani', 'Mehrdad Mohammad Ali', '']]","['Influence maximization', 'Social network analysis', 'Community detection', 'SIR model', 'TOPSIS']"
700,1902.02204,Bac Nam Vu,"N. Vu-Bac, T.X. Duong, T. Lahmer, X. Zhuang, R.A. Sauer, H.S. Parke,
  T. Rabczuk","A NURBS-based Inverse Analysis for Reconstruction of Nonlinear
  Deformations of Thin Shell Structures",,"Computer Methods in Applied Mechanics and Engineering 331 (2018):
  427-455",10.1016/j.cma.2017.09.034,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents original work combining a NURBS-based inverse analysis
with both kinematic and constitutive nonlinearities to recover the applied
loads and deformations of thin shell structures. The inverse formulation is
tackled by gradient-based optimization algorithms based on computed and
measured displacements at a number of discrete locations. The proposed method
allows accurately recovering the target shape of shell structures such that
instabilities due to snapping and buckling are captured. The results obtained
show good performance and applicability of the proposed algorithms to
computer-aided manufacturing of shell structures.
","[{'version': 'v1', 'created': 'Tue, 5 Feb 2019 17:15:54 GMT'}]",2019-02-07,"[['Vu-Bac', 'N.', ''], ['Duong', 'T. X.', ''], ['Lahmer', 'T.', ''], ['Zhuang', 'X.', ''], ['Sauer', 'R. A.', ''], ['Parke', 'H. S.', ''], ['Rabczuk', 'T.', '']]","['Inverse analysis', 'Isogeometric analysis', 'Kirchhoff-Love shells', 'Nonlinear mechanics', 'Instability shape change', 'Adjoint method']"
701,1802.08327,Mario Gleirscher,Mario Gleirscher and Stefan Kugele,"From Hazard Analysis to Hazard Mitigation Planning: The Automated
  Driving Case",,"Barrett C., Davies M., Kahsai T. (eds) NASA Formal Methods. LNCS,
  vol 10227. Springer",10.1007/978-3-319-57288-8_23,,cs.SE cs.RO cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vehicle safety depends on (a) the range of identified hazards and (b) the
operational situations for which mitigations of these hazards are acceptably
decreasing risk. Moreover, with an increasing degree of autonomy, risk
ownership is likely to increase for vendors towards regulatory certification.
Hence, highly automated vehicles have to be equipped with verified controllers
capable of reliably identifying and mitigating hazards in all possible
operational situations. To this end, available methods for the design and
verification of automated vehicle controllers have to be supported by models
for hazard analysis and mitigation. In this paper, we describe (1) a framework
for the analysis and design of planners (i.e., high-level controllers) capable
of run-time hazard identification and mitigation, (2) an incremental algorithm
for constructing planning models from hazard analysis, and (3) an exemplary
application to the design of a fail-operational controller based on a given
control system architecture. Our approach equips the safety engineer with
concepts and steps to (2a) elaborate scenarios of endangerment and (2b) design
operational strategies for mitigating such scenarios.
","[{'version': 'v1', 'created': 'Thu, 22 Feb 2018 22:17:39 GMT'}]",2018-02-26,"[['Gleirscher', 'Mario', ''], ['Kugele', 'Stefan', '']]","['risk analysis', 'hazard mitigation', 'safe state', 'controller design', 'autonomous vehicle', 'automotive system', 'modeling', 'planning']"
702,1806.08987,Jorge Miguel Ferreira Da Silva,"Jorge Miguel Silva, Tiago Marques Godinho, David Silva, Carlos Costa","A Community-Driven Validation Service for Standard Medical Imaging
  Objects","Computer Standards & Interfaces, 2018",,10.1016/j.csi.2018.06.003,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Digital medical imaging laboratories contain many distinct types of equipment
provided by different manufacturers. Interoperability is a critical issue and
the DICOM protocol is a de facto standard in those environments. However,
manufacturers' implementation of the standard may have non-conformities at
several levels, which will hinder systems' integration. Moreover, medical staff
may be responsible for data inconsistencies when entering data. Those
situations severely affect the quality of healthcare services since they can
disrupt system operations. The existence of software able to confirm data
quality and compliance with the DICOM standard is important for programmers, IT
staff and healthcare technicians. Although there are a few solutions that try
to accomplish this goal, they are unable to deal with certain situations that
require user input. Furthermore, these cases usually require the setup of a
working environment, which makes the sharing of validation information more
difficult. This article proposes and describes the development of a Web DICOM
validation service for the community. This solution requires no configuration
by the user, promotes validation results share-ability in the community and
preserves patient data privacy since files are de-identified on the client
side.
","[{'version': 'v1', 'created': 'Sat, 23 Jun 2018 15:39:59 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Jun 2018 10:12:52 GMT'}]",2018-06-27,"[['Silva', 'Jorge Miguel', ''], ['Godinho', 'Tiago Marques', ''], ['Silva', 'David', ''], ['Costa', 'Carlos', '']]","['Web', 'DICOM', 'PACS', 'Medical Imaging', 'Validator']"
703,0902.3026,Artem Chebotko,"Artem Chebotko, Yu Deng, Shiyong Lu, Farshad Fotouhi, Anthony Aristar,
  Hennie Brugman, Alexander Klassmann, Han Sloetjes, Albert Russel, Peter
  Wittenburg",OntoELAN: An Ontology-based Linguistic Multimedia Annotator,"Appeared in the Proceedings of the IEEE Sixth International Symposium
  on Multimedia Software Engineering (IEEE-MSE'04), pp. 329-336, Miami, FL,
  USA, December, 2004","Proceedings of the IEEE Sixth International Symposium on
  Multimedia Software Engineering (IEEE-MSE'04), pp. 329-336, Miami, FL, USA,
  December, 2004",10.1109/MMSE.2004.58,,cs.DL cs.DB cs.MM cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite its scientific, political, and practical value, comprehensive
information about human languages, in all their variety and complexity, is not
readily obtainable and searchable. One reason is that many language data are
collected as audio and video recordings which imposes a challenge to document
indexing and retrieval. Annotation of multimedia data provides an opportunity
for making the semantics explicit and facilitates the searching of multimedia
documents. We have developed OntoELAN, an ontology-based linguistic multimedia
annotator that features: (1) support for loading and displaying ontologies
specified in OWL; (2) creation of a language profile, which allows a user to
choose a subset of terms from an ontology and conveniently rename them if
needed; (3) creation of ontological tiers, which can be annotated with profile
terms and, therefore, corresponding ontological terms; and (4) saving
annotations in the XML format as Multimedia Ontology class instances and,
linked to them, class instances of other ontologies used in ontological tiers.
To our best knowledge, OntoELAN is the first audio/video annotation tool in
linguistic domain that provides support for ontology-based annotation.
","[{'version': 'v1', 'created': 'Wed, 18 Feb 2009 00:40:37 GMT'}]",2016-11-18,"[['Chebotko', 'Artem', ''], ['Deng', 'Yu', ''], ['Lu', 'Shiyong', ''], ['Fotouhi', 'Farshad', ''], ['Aristar', 'Anthony', ''], ['Brugman', 'Hennie', ''], ['Klassmann', 'Alexander', ''], ['Sloetjes', 'Han', ''], ['Russel', 'Albert', ''], ['Wittenburg', 'Peter', '']]","['ontology', 'annotation', 'multimedia', 'Semantic Web', 'OWL', 'GOLD']"
704,1705.09454,Mohammadreza Doostmohammadian,"Mohammadreza Doostmohammadian, Houman Zarrabi, Hamid R. Rabiee","Sensor Selection Cost Optimization for Tracking Structurally Cyclic
  Systems: a P-Order Solution",,,10.1080/00207721.2017.1322640,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Measurements and sensing implementations impose certain cost in sensor
networks. The sensor selection cost optimization is the problem of minimizing
the sensing cost of monitoring a physical (or cyber- physical) system. Consider
a given set of sensors tracking states of a dynamical system for estimation
purposes. For each sensor assume different costs to measure different
(realizable) states. The idea is to assign sensors to measure states such that
the global cost is minimized. The number and selection of sensor measurements
need to ensure the observability to track the dynamic state of the system with
bounded estimation error. The main question we address is how to select the
state measurements to minimize the cost while satisfying the observability
conditions. Relaxing the observability condition for structurally cyclic
systems, the main contribution is to propose a graph theoretic approach to
solve the problem in polynomial time. Note that, polynomial time algorithms are
suitable for large-scale systems as their running time is upper-bounded by a
polynomial expression in the size of input for the algorithm. We frame the
problem as a linear sum assignment with solution complexity of O(m3).
","[{'version': 'v1', 'created': 'Fri, 26 May 2017 06:53:45 GMT'}]",2017-06-01,"[['Doostmohammadian', 'Mohammadreza', ''], ['Zarrabi', 'Houman', ''], ['Rabiee', 'Hamid R.', '']]","['State-Space Models', 'Linear Systems', 'State Estimation', 'Observability', 'ConvexProgramming', 'Sensor Selection']"
705,1609.08078,Chiwoo Park,Garret Vo and Chiwoo Park,"Robust Regression For Image Binarization Under Heavy Noises and
  Nonuniform Background",,"Pattern Recognition Volume 81, September 2018, Pages 224-239",10.1016/j.patcog.2018.04.005,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a robust regression approach for image binarization under
significant background variations and observation noises. The work is motivated
by the need of identifying foreground regions in noisy microscopic image or
degraded document images, where significant background variation and severe
noise make an image binarization challenging. The proposed method first
estimates the background of an input image, subtracts the estimated background
from the input image, and apply a global thresholding to the subtracted outcome
for achieving a binary image of foregrounds. A robust regression approach was
proposed to estimate the background intensity surface with minimal effects of
foreground intensities and noises, and a global threshold selector was proposed
on the basis of a model selection criterion in a sparse regression. The
proposed approach was validated using 26 test images and the corresponding
ground truths, and the outcomes of the proposed work were compared with those
from nine existing image binarization methods. The approach was also combined
with three state-of-the-art morphological segmentation methods to show how the
proposed approach can improve their image segmentation outcomes.
","[{'version': 'v1', 'created': 'Mon, 26 Sep 2016 17:07:49 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Feb 2017 17:30:08 GMT'}, {'version': 'v3', 'created': 'Fri, 30 Jun 2017 16:06:59 GMT'}, {'version': 'v4', 'created': 'Thu, 6 Jul 2017 20:35:51 GMT'}]",2018-07-18,"[['Vo', 'Garret', ''], ['Park', 'Chiwoo', '']]","['Image Binarization', 'Background Subtraction', 'RobustRegression', 'Document Image Analysis', 'Microscopy Image Analysis']"
706,0806.4034,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",Data linkage dynamics with shedding,"22 pages; introduction improved. arXiv admin note: substantial text
  overlap with arXiv:0804.4565","Fundamenta Informaticae, 103(1--4):31--52, 2010",10.3233/FI-2010-317,PRG0809,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study shedding in the setting of data linkage dynamics, a simple model of
computation that bears on the use of dynamic data structures in programming.
Shedding is complementary to garbage collection. With shedding, each time a
link to a data object is updated by a program, it is determined whether or not
the link will possibly be used once again by the program, and if not the link
is automatically removed. Thus, everything is made garbage as soon as it can be
viewed as garbage. By that, the effectiveness of garbage collection becomes
maximal.
","[{'version': 'v1', 'created': 'Wed, 25 Jun 2008 07:15:35 GMT'}, {'version': 'v2', 'created': 'Fri, 7 May 2010 15:11:57 GMT'}]",2012-10-20,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['data linkage dynamics', 'shedding', 'forecasting service']"
707,1001.0830,Chris De Vries,Christopher M. De Vries and Shlomo Geva,K-tree: Large Scale Document Clustering,"2 pages, SIGIR 2009",,10.1145/1571941.1572094,,cs.IR cs.AI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce K-tree in an information retrieval context. It is an efficient
approximation of the k-means clustering algorithm. Unlike k-means it forms a
hierarchy of clusters. It has been extended to address issues with sparse
representations. We compare performance and quality to CLUTO using document
collections. The K-tree has a low time complexity that is suitable for large
document collections. This tree structure allows for efficient disk based
implementations where space requirements exceed that of main memory.
","[{'version': 'v1', 'created': 'Wed, 6 Jan 2010 07:43:31 GMT'}]",2010-01-07,"[['De Vries', 'Christopher M.', ''], ['Geva', 'Shlomo', '']]","['Document Clustering', 'K-tree', 'B-tree', 'Search Tree', 'k-means']"
708,1310.7453,Francesco Versaci,Francesco Versaci,"OutFlank Routing: Increasing Throughput in Toroidal Interconnection
  Networks","9 pages, 5 figures, to be presented at ICPADS 2013",,10.1109/ICPADS.2013.40,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new, deadlock-free, routing scheme for toroidal interconnection
networks, called OutFlank Routing (OFR). OFR is an adaptive strategy which
exploits non-minimal links, both in the source and in the destination nodes.
When minimal links are congested, OFR deroutes packets to carefully chosen
intermediate destinations, in order to obtain travel paths which are only an
additive constant longer than the shortest ones. Since routing performance is
very sensitive to changes in the traffic model or in the router parameters, an
accurate discrete-event simulator of the toroidal network has been developed to
empirically validate OFR, by comparing it against other relevant routing
strategies, over a range of typical real-world traffic patterns. On the
16x16x16 (4096 nodes) simulated network OFR exhibits improvements of the
maximum sustained throughput between 14% and 114%, with respect to Adaptive
Bubble Routing.
","[{'version': 'v1', 'created': 'Mon, 28 Oct 2013 15:11:57 GMT'}]",2014-05-22,"[['Versaci', 'Francesco', '']]","['Routing', 'Interconnection networks', 'Adaptive routing', 'Toroidal networks', 'High performance computing']"
709,1912.01816,Eli (Omid) David,"Evyatar Illouz, Eli David, and Nathan S. Netanyahu","Handwriting-Based Gender Classification Using End-to-End Deep Neural
  Networks",,"International Conference on Artificial Neural Networks (ICANN),
  Springer LNCS, Vol. 11141, pp. 613-621, Rhodes, Greece, October 2018",10.1007/978-3-030-01424-7_60,,cs.CV cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Handwriting-based gender classification is a well-researched problem that has
been approached mainly by traditional machine learning techniques. In this
paper, we propose a novel deep learning-based approach for this task.
Specifically, we present a convolutional neural network (CNN), which performs
automatic feature extraction from a given handwritten image, followed by
classification of the writer's gender. Also, we introduce a new dataset of
labeled handwritten samples, in Hebrew and English, of 405 participants.
Comparing the gender classification accuracy on this dataset against human
examiners, our results show that the proposed deep learning-based approach is
substantially more accurate than that of humans.
","[{'version': 'v1', 'created': 'Wed, 4 Dec 2019 06:24:31 GMT'}]",2019-12-05,"[['Illouz', 'Evyatar', ''], ['David', 'Eli', ''], ['Netanyahu', 'Nathan S.', '']]","['Gender classification', 'offline handwriting', 'HEBIU handwriting dataset', 'deep neural network', 'convolutional neural network']"
710,1801.01586,David Charte,"David Charte and Francisco Charte and Salvador Garc\'ia and Mar\'ia J.
  del Jesus and Francisco Herrera","A practical tutorial on autoencoders for nonlinear feature fusion:
  Taxonomy, models, software and guidelines",,Information Fusion 44 (2018) 78-96,10.1016/j.inffus.2017.12.007,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many of the existing machine learning algorithms, both supervised and
unsupervised, depend on the quality of the input characteristics to generate a
good model. The amount of these variables is also important, since performance
tends to decline as the input dimensionality increases, hence the interest in
using feature fusion techniques, able to produce feature sets that are more
compact and higher level. A plethora of procedures to fuse original variables
for producing new ones has been developed in the past decades. The most basic
ones use linear combinations of the original variables, such as PCA (Principal
Component Analysis) and LDA (Linear Discriminant Analysis), while others find
manifold embeddings of lower dimensionality based on non-linear combinations,
such as Isomap or LLE (Linear Locally Embedding) techniques.
  More recently, autoencoders (AEs) have emerged as an alternative to manifold
learning for conducting nonlinear feature fusion. Dozens of AE models have been
proposed lately, each with its own specific traits. Although many of them can
be used to generate reduced feature sets through the fusion of the original
ones, there also AEs designed with other applications in mind.
  The goal of this paper is to provide the reader with a broad view of what an
AE is, how they are used for feature fusion, a taxonomy gathering a broad range
of models, and how they relate to other classical techniques. In addition, a
set of didactic guidelines on how to choose the proper AE for a given task is
supplied, together with a discussion of the software tools available. Finally,
two case studies illustrate the usage of AEs with datasets of handwritten
digits and breast cancer.
","[{'version': 'v1', 'created': 'Thu, 4 Jan 2018 23:51:05 GMT'}]",2018-01-08,"[['Charte', 'David', ''], ['Charte', 'Francisco', ''], ['García', 'Salvador', ''], ['del Jesus', 'María J.', ''], ['Herrera', 'Francisco', '']]","['autoencoders', 'feature fusion', 'feature extraction', 'representation learning', 'deep learning', 'machine learning']"
711,1908.01262,Wang Yan,"Yan Wang, Peng Jia, Luping Liu, Jiayong Liu",A systematic review of fuzzing based on machine learning techniques,,,10.1371/journal.pone.0237749,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security vulnerabilities play a vital role in network security system.
Fuzzing technology is widely used as a vulnerability discovery technology to
reduce damage in advance. However, traditional fuzzing techniques have many
challenges, such as how to mutate input seed files, how to increase code
coverage, and how to effectively bypass verification. Machine learning
technology has been introduced as a new method into fuzzing test to alleviate
these challenges. This paper reviews the research progress of using machine
learning technology for fuzzing test in recent years, analyzes how machine
learning improve the fuzz process and results, and sheds light on future work
in fuzzing. Firstly, this paper discusses the reasons why machine learning
techniques can be used for fuzzing scenarios and identifies six different
stages in which machine learning have been used. Then this paper systematically
study the machine learning based fuzzing models from selection of machine
learning algorithm, pre-processing methods, datasets, evaluation metrics, and
hyperparameters setting. Next, this paper assesses the performance of the
machine learning models based on the frequently used evaluation metrics. The
results of the evaluation prove that machine learning technology has an
acceptable capability of categorize predictive for fuzzing. Finally, the
comparison on capability of discovering vulnerabilities between traditional
fuzzing tools and machine learning based fuzzing tools is analyzed. The results
depict that the introduction of machine learning technology can improve the
performance of fuzzing. However, there are still some limitations, such as
unbalanced training samples and difficult to extract the characteristics
related to vulnerabilities.
","[{'version': 'v1', 'created': 'Sun, 4 Aug 2019 02:51:53 GMT'}]",2020-08-20,"[['Wang', 'Yan', ''], ['Jia', 'Peng', ''], ['Liu', 'Luping', ''], ['Liu', 'Jiayong', '']]","['Fuzzing', 'vulnerability', 'testcase', 'mutation operator', 'machine learning', 'deep neural network']"
712,1810.07665,Shujun Li,"Ximing Liu, Yingjiu Li, Robert H. Deng, Bing Chang and Shujun Li","When Human cognitive modeling meets PINs: User-independent
  inter-keystroke timing attacks","16 pages, 9 figures","Computers & Security, vol. 80, pp. 90-107, 2018",10.1016/j.cose.2018.09.003,,cs.CR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes the first user-independent inter-keystroke timing attacks
on PINs. Our attack method is based on an inter-keystroke timing dictionary
built from a human cognitive model whose parameters can be determined by a
small amount of training data on any users (not necessarily the target
victims). Our attacks can thus be potentially launched on a large scale in
real-world settings. We investigate inter-keystroke timing attacks in different
online attack settings and evaluate their performance on PINs at different
strength levels. Our experimental results show that the proposed attack
performs significantly better than random guessing attacks. We further
demonstrate that our attacks pose a serious threat to real-world applications
and propose various ways to mitigate the threat.
","[{'version': 'v1', 'created': 'Wed, 17 Oct 2018 16:54:39 GMT'}]",2018-10-18,"[['Liu', 'Ximing', ''], ['Li', 'Yingjiu', ''], ['Deng', 'Robert H.', ''], ['Chang', 'Bing', ''], ['Li', 'Shujun', '']]","['PIN', 'Authentication', 'Human Cognitive Model', 'Timing Attack', 'Human Behavior', 'Keystroke Dynamics']"
713,1207.5152,Fatih Korkmaz,"Fatih Korkmaz, M. Faruk Cakir, Yilmaz Korkmaz, Ismail Topaloglu",Stator flux optimization on direct torque control with fuzzy logic,"8 pages, 8 figures, Itca 2012 conference",,10.5121/csit.2012.2355,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Direct Torque Control (DTC) is well known as an effective control
technique for high performance drives in a wide variety of industrial
applications and conventional DTC technique uses two constant reference value:
torque and stator flux. In this paper, fuzzy logic based stator flux
optimization technique for DTC drives that has been proposed. The proposed
fuzzy logic based stator flux optimizer self-regulates the stator flux
reference using induction motor load situation without need of any motor
parameters. Simulation studies have been carried out with Matlab/Simulink to
compare the proposed system behaviors at vary load conditions. Simulation
results show that the performance of the proposed DTC technique has been
improved and especially at low-load conditions torque ripple are greatly
reduced with respect to the conventional DTC.
","[{'version': 'v1', 'created': 'Sat, 21 Jul 2012 15:08:06 GMT'}]",2012-12-04,"[['Korkmaz', 'Fatih', ''], ['Cakir', 'M. Faruk', ''], ['Korkmaz', 'Yilmaz', ''], ['Topaloglu', 'Ismail', '']]","['Asynchronous motor control', 'Direct torque control', 'Fuzzy logic optimization', 'Vector control']"
714,1706.08266,Victor Marsault,Shigeki Akiyama and Victor Marsault and Jacques Sakarovitch,"On subtrees of the representation tree in rational base numeration
  systems",33 pages,"Discrete Mathematics & Theoretical Computer Science, Vol. 20 no.
  1, Analysis of Algorithms (March 5, 2018) dmtcs:4331",10.23638/DMTCS-20-1-10,,cs.DM cs.FL math.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Every rational number p/q defines a rational base numeration system in which
every integer has a unique finite representation, up to leading zeroes. This
work is a contribution to the study of the set of the representations of
integers. This prefix-closed subset of the free monoid is naturally represented
as a highly non-regular tree. Its nodes are the integers, its edges bear labels
taken in {0,1,...,p-1}, and its subtrees are all distinct.
  We associate with each subtree (or with its root n) three infinite words. The
bottom word of n is the lexicographically smallest word that is the label of a
branch of the subtree. The top word of n is defined similarly. The span-word of
n is the digitwise difference between the latter and the former.
  First, we show that the set of all the span-words is accepted by an infinite
automaton whose underlying graph is essentially the same as the tree itself.
Second, we study the function that computes for all n the bottom word
associated with n+1 from the one associated with n, and show that it is
realised by an infinite sequential transducer whose underlying graph is once
again essentially the same as the tree itself.
  An infinite word may be interpreted as an expansion in base p/q after the
radix point, hence evaluated to a real number. If T is a subtree whose root is
n, then the evaluations of the labels of the branches of T form an interval of
$\mathbb{R}$. The length of this interval is called the span of n and is equal
to the evaluation of the span-word of n. The set of all spans is then a subset
of R and we use the preceding construction to study its topological closure. We
show that it is an interval when p is greater than or equal to 2q-1, and a
Cantor set of measure zero otherwise.
","[{'version': 'v1', 'created': 'Mon, 26 Jun 2017 07:58:37 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Jan 2018 09:31:45 GMT'}, {'version': 'v3', 'created': 'Tue, 27 Feb 2018 11:56:23 GMT'}]",2019-03-14,"[['Akiyama', 'Shigeki', ''], ['Marsault', 'Victor', ''], ['Sakarovitch', 'Jacques', '']]","['Rational base numeration systems', 'Real-representation tree', 'Infinite words', 'Infinite transducers', 'Cantorsets', 'Hausdorff measure']"
715,1008.1338,Zeeshan Ahmed Mr.,Zeeshan Ahmed,"Intelligent Human Machine Interface Design for Advanced Product Life
  Cycle Management Systems","In International Conference on Frontiers of Information Technology,
  ACM - FIT09, Session 5: Computational Science/Artificial Intelligence, 16-18
  December, 2009","ACM Special Interest Group on Artificial Intelligence (SIGART),
  2009",10.1145/1838002.1838058,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Designing and implementing an intelligent and user friendly human machine
interface for any kind of software or hardware oriented application is always
be a challenging task for the designers and developers because it is very
difficult to understand the psychology of the user, nature of the work and best
suit of the environment. This research paper is basically about to propose an
intelligent, flexible and user friendly machine interface for Product Life
Cycle Management products or PDM Systems since studies show that usability and
human computer interaction issues are a major cause of acceptance problems
introducing or using such systems. Going into details of the proposition, we
present prototype implementations about theme based on design requirements,
designed designs and technologies involved for the development of human machine
interface.
","[{'version': 'v1', 'created': 'Sat, 7 Aug 2010 12:58:13 GMT'}]",2010-08-26,"[['Ahmed', 'Zeeshan', '']]","['Advanced User Interface Design', 'HCI', 'HMI', 'PLM']"
716,1903.11483,Erik Derner,"Erik Derner, Ji\v{r}\'i Kubal\'ik, Nicola Ancona and Robert
  Babu\v{s}ka","Constructing Parsimonious Analytic Models for Dynamic Systems via
  Symbolic Regression",,"Applied Soft Computing, Volume 94, September 2020, 106432",10.1016/j.asoc.2020.106432,,cs.LG cs.NE cs.RO cs.SY stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Developing mathematical models of dynamic systems is central to many
disciplines of engineering and science. Models facilitate simulations, analysis
of the system's behavior, decision making and design of automatic control
algorithms. Even inherently model-free control techniques such as reinforcement
learning (RL) have been shown to benefit from the use of models, typically
learned online. Any model construction method must address the tradeoff between
the accuracy of the model and its complexity, which is difficult to strike. In
this paper, we propose to employ symbolic regression (SR) to construct
parsimonious process models described by analytic equations. We have equipped
our method with two different state-of-the-art SR algorithms which
automatically search for equations that fit the measured data: Single Node
Genetic Programming (SNGP) and Multi-Gene Genetic Programming (MGGP). In
addition to the standard problem formulation in the state-space domain, we show
how the method can also be applied to input-output models of the NARX
(nonlinear autoregressive with exogenous input) type. We present the approach
on three simulated examples with up to 14-dimensional state space: an inverted
pendulum, a mobile robot, and a bipedal walking robot. A comparison with deep
neural networks and local linear regression shows that SR in most cases
outperforms these commonly used alternative methods. We demonstrate on a real
pendulum system that the analytic model found enables a RL controller to
successfully perform the swing-up task, based on a model constructed from only
100 data samples.
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2019 15:22:38 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Jun 2020 09:17:27 GMT'}]",2020-06-19,"[['Derner', 'Erik', ''], ['Kubalík', 'Jiří', ''], ['Ancona', 'Nicola', ''], ['Babuška', 'Robert', '']]","['symbolic regression', 'genetic programming', 'model learning', 'reinforcement learning']"
717,1810.10350,Michelle Kuchera,"Michelle P. Kuchera, Raghuram Ramanujan, Jack Z. Taylor, Ryan R.
  Strauss, Daniel Bazin, Joshua Bradt, Ruiming Chen",Machine Learning Methods for Track Classification in the AT-TPC,,"NIMA 940 (2019) 56-167, ISSN 0168-9002",10.1016/j.nima.2019.05.097,NIMA-D-18-01137,cs.CV cs.LG nucl-ex,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We evaluate machine learning methods for event classification in the
Active-Target Time Projection Chamber detector at the National Superconducting
Cyclotron Laboratory (NSCL) at Michigan State University. An automated method
to single out the desired reaction product would result in more accurate
physics results as well as a faster analysis process. Binary and multi-class
classification methods were tested on data produced by the $^{46}$Ar(p,p)
experiment run at the NSCL in September 2015. We found a Convolutional Neural
Network to be the most successful classifier of proton scattering events for
transfer learning. Results from this investigation and recommendations for
event classification in future experiments are presented.
","[{'version': 'v1', 'created': 'Sun, 21 Oct 2018 18:52:01 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Feb 2019 01:57:47 GMT'}, {'version': 'v3', 'created': 'Tue, 30 Apr 2019 01:54:11 GMT'}]",2019-07-17,"[['Kuchera', 'Michelle P.', ''], ['Ramanujan', 'Raghuram', ''], ['Taylor', 'Jack Z.', ''], ['Strauss', 'Ryan R.', ''], ['Bazin', 'Daniel', ''], ['Bradt', 'Joshua', ''], ['Chen', 'Ruiming', '']]","['machine learning', 'neural networks', 'classification', 'active targets', 'time projection chamber']"
718,1907.07029,Rituraj Kaushik,"Rituraj Kaushik, Pierre Desreumaux, Jean-Baptiste Mouret","Adaptive Prior Selection for Repertoire-based Online Adaptation in
  Robotics","Frontiers in Robotics and AI. Vol. 6, p. 151, 2020. Video :
  http://tiny.cc/aprol_video",Frontiers in Robotics and AI. 6 (2020) 151,10.3389/frobt.2019.00151,,cs.RO cs.AI cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Repertoire-based learning is a data-efficient adaptation approach based on a
two-step process in which (1) a large and diverse set of policies is learned in
simulation, and (2) a planning or learning algorithm chooses the most
appropriate policies according to the current situation (e.g., a damaged robot,
a new object, etc.). In this paper, we relax the assumption of previous works
that a single repertoire is enough for adaptation. Instead, we generate
repertoires for many different situations (e.g., with a missing leg, on
different floors, etc.) and let our algorithm selects the most useful prior.
Our main contribution is an algorithm, APROL (Adaptive Prior selection for
Repertoire-based Online Learning) to plan the next action by incorporating
these priors when the robot has no information about the current situation. We
evaluate APROL on two simulated tasks: (1) pushing unknown objects of various
shapes and sizes with a robotic arm and (2) a goal reaching task with a damaged
hexapod robot. We compare with ""Reset-free Trial and Error"" (RTE) and various
single repertoire-based baselines. The results show that APROL solves both the
tasks in less interaction time than the baselines. Additionally, we demonstrate
APROL on a real, damaged hexapod that quickly learns to pick compensatory
policies to reach a goal by avoiding obstacles in the path.
","[{'version': 'v1', 'created': 'Tue, 16 Jul 2019 14:26:13 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Oct 2019 11:13:57 GMT'}, {'version': 'v3', 'created': 'Tue, 3 Mar 2020 22:25:25 GMT'}]",2020-03-05,"[['Kaushik', 'Rituraj', ''], ['Desreumaux', 'Pierre', ''], ['Mouret', 'Jean-Baptiste', '']]","['data-efficient robot learning', 'model-basedlearning', 'repertoire-basedrobotlearning', 'evolutionaryrobotics', 'fault tolerance in robotics']"
719,1610.07424,Xianwen Wang,"Xianwen Wang, Zhichao Fang, Qingchun Li and Xinhui Guo","The poor altmetric performance of publications authored by researchers
  in mainland China","15 pages, 2 figures","Frontiers in Research Metrics and Analytics, 2016, 1:8",10.3389/frma.2016.00008,,cs.DL cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  China's scientific output has risen precipitously over the past decade; it is
now the world's second-largest producer of scientific papers, behind only the
United States. The quality of China's research is also on the rise (Van
Noorden, 2016). The online visibility and impact of China's research are also
important issues worth exploring. In this study, we investigate the altmetric
performance of publications in the field of Biotechnology and Applied
Microbiology and published by authors from Chinese affiliations. We find that
papers published by those authors from Chinese affiliations have much lower
visibility on the social web than articles from other countries, when there is
no significant difference for the citations. Fewer of China's publications get
tweeted, and those tweeted publications attract less social attention. A
geographical analysis of tweeters shows that scholarly articles get most of
their social attention from the authors' home countries, a finding that is also
confirmed by correlation and regression analysis. This situation, which is
unfavorable for researchers from Chinese affiliations, is caused, in part, by
the inaccessibility of mainstream social networking platforms in mainland
China.
","[{'version': 'v1', 'created': 'Mon, 24 Oct 2016 14:18:00 GMT'}]",2016-10-25,"[['Wang', 'Xianwen', ''], ['Fang', 'Zhichao', ''], ['Li', 'Qingchun', ''], ['Guo', 'Xinhui', '']]","['Altmetrics', 'social media', 'open access', 'China', 'Twitter']"
720,1812.07640,Alexander Veretennikov Borisovich,Alexander B. Veretennikov,"Proximity Full-Text Search by Means of Additional Indexes with
  Multi-component Keys: In Pursuit of Optimal Performance","Revised paper of ""Veretennikov A.B. Proximity full-text search with a
  response time guarantee by means of additional indexes with multi-component
  keys"", Selected Papers of the XX International Conference on Data Analytics
  and Management in Data Intensive Domains (DAMDID/RCDL 2018), Moscow, Russia,
  October 9-12, 2018, http://ceur-ws.org/Vol-2277,
  http://ceur-ws.org/Vol-2277/paper23.pdf","Data Analytics and Management in Data Intensive Domains.
  DAMDID/RCDL 2018. Communications in Computer and Information Science, vol
  1003. Springer, Cham",10.1007/978-3-030-23584-0_7,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Full-text search engines are important tools for information retrieval. In a
proximity full-text search, a document is relevant if it contains query terms
near each other, especially if the query terms are frequently occurring words.
For each word in a text, we use additional indexes to store information about
nearby words that are at distances from the given word of less than or equal to
the MaxDistance parameter. We showed that additional indexes with
three-component keys can be used to improve the average query execution time by
up to 94.7 times if the queries consist of high-frequency occurring words. In
this paper, we present a new search algorithm with even more performance gains.
We consider several strategies for selecting multi-component key indexes for a
specific query and compare these strategies with the optimal strategy. We also
present the results of search experiments, which show that three-component key
indexes enable much faster searches in comparison with two-component key
indexes.
  This is a pre-print of a contribution ""Veretennikov A.B. (2019) Proximity
Full-Text Search by Means of Additional Indexes with Multi-component Keys: In
Pursuit of Optimal Performance."" published in ""Manolopoulos Y., Stupnikov S.
(eds) Data Analytics and Management in Data Intensive Domains. DAMDID/RCDL
2018. Communications in Computer and Information Science, vol 1003"" published
by Springer, Cham. This book constitutes the refereed proceedings of the 20th
International Conference on Data Analytics and Management in Data Intensive
Domains, DAMDID/RCDL 2018, held in Moscow, Russia, in October 2018. The 9
revised full papers presented together with three invited papers were carefully
reviewed and selected from 54 submissions. The final authenticated version is
available online at https://doi.org/10.1007/978-3-030-23584-0_7.
","[{'version': 'v1', 'created': 'Tue, 18 Dec 2018 20:57:15 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Jul 2019 18:33:56 GMT'}]",2019-07-11,"[['Veretennikov', 'Alexander B.', '']]","['Full-Text Search', 'Search Engines', 'Inverted Indexes', 'Additional Indexes', 'Proximity Search', 'Term Proximity', 'Information Retrieval']"
721,1407.4645,Am\'elie David,Serenella Cerrito and Am\'elie David and Valentin Goranko,"Optimal Tableaux Method for Constructive Satisfiability Testing and
  Model Synthesis in the Alternating-time Temporal Logic ATL+",45 pages,"IJCAR 2014, Springer LNCS 8562. pp. 277-291, 2014",10.1007/978-3-319-08587-6_21,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop a sound, complete and practically implementable tableaux-based
decision method for constructive satisfiability testing and model synthesis in
the fragment ATL+ of the full Alternating time temporal logic ATL*. The method
extends in an essential way a previously developed tableaux-based decision
method for ATL and works in 2EXPTIME, which is the optimal worst case
complexity of the satisfiability problem for ATL+ . We also discuss how
suitable parametrizations and syntactic restrictions on the class of input ATL+
formulae can reduce the complexity of the satisfiability problem.
","[{'version': 'v1', 'created': 'Thu, 17 Jul 2014 11:54:30 GMT'}, {'version': 'v2', 'created': 'Tue, 26 May 2015 08:49:29 GMT'}, {'version': 'v3', 'created': 'Wed, 27 May 2015 11:01:21 GMT'}]",2015-05-28,"[['Cerrito', 'Serenella', ''], ['David', 'Amélie', ''], ['Goranko', 'Valentin', '']]","['alternating-time temporal logics', 'ATL+', 'decision procedure', 'modelsynthesis', 'satisfiability', 'tableaux']"
722,1507.05454,Germ\'an Vidal,"Fred Mesnard, \'Etienne Payet, Germ\'an Vidal",Concolic Testing in Logic Programming,"To appear in Theory and Practice of Logic Programming (TPLP),
  Proceedings of ICLP 2015",Theory and Practice of Logic Programming 15 (2015) 711-725,10.1017/S1471068415000332,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software testing is one of the most popular validation techniques in the
software industry. Surprisingly, we can only find a few approaches to testing
in the context of logic programming. In this paper, we introduce a systematic
approach for dynamic testing that combines both concrete and symbolic
execution. Our approach is fully automatic and guarantees full path coverage
when it terminates. We prove some basic properties of our technique and
illustrate its practical usefulness through a prototype implementation.
","[{'version': 'v1', 'created': 'Mon, 20 Jul 2015 11:41:49 GMT'}]",2020-02-19,"[['Mesnard', 'Fred', ''], ['Payet', 'Étienne', ''], ['Vidal', 'Germán', '']]","['Symbolic execution', 'logic programming', 'testing']"
723,1912.01401,Anton Truov Mr.,Anton Trusov and Elena Limonova,"The Analysis of Projective Transformation Algorithms for Image
  Recognition on Mobile Devices",ICMV 2019,,10.1117/12.2559732,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we apply commonly known methods of non-adaptive interpolation
(nearest pixel, bilinear, B-spline, bicubic, Hermite spline) and sampling
(point sampling, supersampling, mip-map pre-filtering, rip-map pre-filtering
and FAST) to the problem of projective image transformation. We compare their
computational complexity, describe their artifacts and than experimentally
measure their quality and working time on mobile processor with ARM
architecture. Those methods were widely developed in the 90s and early 2000s,
but were not in an area of active research in resent years due to a lower need
in computationally efficient algorithms. However, real-time mobile recognition
systems, which collect more and more attention, do not only require fast
projective transform methods, but also demand high quality images without
artifacts. As a result, in this work we choose methods appropriate for those
systems, which allow to avoid artifacts, while preserving low computational
complexity. Based on the experimental results for our setting they are bilinear
interpolation combined with either mip-map pre-filtering or FAST sampling, but
could be modified for specific use cases.
","[{'version': 'v1', 'created': 'Tue, 3 Dec 2019 14:27:38 GMT'}]",2020-09-15,"[['Trusov', 'Anton', ''], ['Limonova', 'Elena', '']]","['image resampling', 'projective transformation', 'anti-aliasing', 'mobile recognition']"
724,2102.07279,Keping Bi,"Keping Bi, Pavel Metrikov, Chunyuan Li, Byungki Byun",Leveraging User Behavior History for Personalized Email Search,In proceedings of the Web Conference 2021,,10.1145/3442381.3450110,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An effective email search engine can facilitate users' search tasks and
improve their communication efficiency. Users could have varied preferences on
various ranking signals of an email, such as relevance and recency based on
their tasks at hand and even their jobs. Thus a uniform matching pattern is not
optimal for all users. Instead, an effective email ranker should conduct
personalized ranking by taking users' characteristics into account. Existing
studies have explored user characteristics from various angles to make email
search results personalized. However, little attention has been given to users'
search history for characterizing users. Although users' historical behaviors
have been shown to be beneficial as context in Web search, their effect in
email search has not been studied and remains unknown. Given these
observations, we propose to leverage user search history as query context to
characterize users and build a context-aware ranking model for email search. In
contrast to previous context-dependent ranking techniques that are based on raw
texts, we use ranking features in the search history. This frees us from
potential privacy leakage while giving a better generalization power to unseen
users. Accordingly, we propose a context-dependent neural ranking model (CNRM)
that encodes the ranking features in users' search history as query context and
show that it can significantly outperform the baseline neural model without
using the context. We also investigate the benefit of the query context vectors
obtained from CNRM on the state-of-the-art learning-to-rank model LambdaMart by
clustering the vectors and incorporating the cluster information. Experimental
results show that significantly better results can be achieved on LambdaMart as
well, indicating that the query clusters can characterize different users and
effectively turn the ranking model personalized.
","[{'version': 'v1', 'created': 'Mon, 15 Feb 2021 00:15:46 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Mar 2021 23:02:20 GMT'}]",2021-03-19,"[['Bi', 'Keping', ''], ['Metrikov', 'Pavel', ''], ['Li', 'Chunyuan', ''], ['Byun', 'Byungki', '']]","['Email Search', 'Query Context', 'Personalized Search']"
725,1612.03925,Jose Dolz,"J. Dolz, C. Desrosiers, I. Ben Ayed","3D fully convolutional networks for subcortical segmentation in MRI: A
  large-scale study","Accepted in the special issue of Neuroimage: ""Brain Segmentation and
  Parcellation""",,10.1016/j.neuroimage.2017.04.039,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study investigates a 3D and fully convolutional neural network (CNN) for
subcortical brain structure segmentation in MRI. 3D CNN architectures have been
generally avoided due to their computational and memory requirements during
inference. We address the problem via small kernels, allowing deeper
architectures. We further model both local and global context by embedding
intermediate-layer outputs in the final prediction, which encourages
consistency between features extracted at different scales and embeds
fine-grained information directly in the segmentation process. Our model is
efficiently trained end-to-end on a graphics processing unit (GPU), in a single
stage, exploiting the dense inference capabilities of fully CNNs.
  We performed comprehensive experiments over two publicly available datasets.
First, we demonstrate a state-of-the-art performance on the ISBR dataset. Then,
we report a {\em large-scale} multi-site evaluation over 1112 unregistered
subject datasets acquired from 17 different sites (ABIDE dataset), with ages
ranging from 7 to 64 years, showing that our method is robust to various
acquisition protocols, demographics and clinical factors. Our method yielded
segmentations that are highly consistent with a standard atlas-based approach,
while running in a fraction of the time needed by atlas-based methods and
avoiding registration/normalization steps. This makes it convenient for massive
multi-site neuroanatomical imaging studies. To the best of our knowledge, our
work is the first to study subcortical structure segmentation on such
large-scale and heterogeneous data.
","[{'version': 'v1', 'created': 'Mon, 12 Dec 2016 21:09:06 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Apr 2017 02:03:35 GMT'}]",2017-04-21,"[['Dolz', 'J.', ''], ['Desrosiers', 'C.', ''], ['Ayed', 'I. Ben', '']]","['Deep learning', 'MRI segmentation', 'brain', '3D CNN', 'fully CNN']"
726,1907.08470,"Erich Gr\""adel","Erich Gr\""adel and Val Tannen",Provenance Analysis for Logic and Games,,Moscow J. Comb. Number Th. 9 (2020) 203-228,10.2140/moscow.2020.9.203,,cs.LO cs.DB math.LO,http://creativecommons.org/publicdomain/zero/1.0/,"  A model checking computation checks whether a given logical sentence is true
in a given finite structure. Provenance analysis abstracts from such a
computation mathematical information on how the result depends on the atomic
data that describe the structure. In database theory, provenance analysis by
interpretations in commutative semirings has been rather succesful for positive
query languages (such a unions of conjunctive queries, positive relational
algebra, or datalog). However, it did not really offer an adequate treatment of
negation or missing information.
  Here we propose a new approach for the provenance analysis of logics with
negation, such as first-order logic and fixed-point logics. It is closely
related to a provenance analysis of the associated model-checking games, and
based on new semirings of dual-indeterminate polynomials or dual-indeterminate
formal power series. These are obtained by taking quotients of traditional
provenance semirings by congruences that are generated by products of positive
and negative provenance tokens. Beyond the use for model-checking problems in
logics, provenance analysis of games is of independent interest. Provenance
values in games provide detailed information about the number and properties of
the strategies of the players, far beyond the question whether or not a player
has a winning strategy from a given position.
","[{'version': 'v1', 'created': 'Fri, 19 Jul 2019 11:43:41 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Feb 2020 12:06:00 GMT'}]",2020-10-21,"[['Grädel', 'Erich', ''], ['Tannen', 'Val', '']]","['Finite Model Theory', 'Provenance', 'Games']"
727,1907.09474,Vicent Blanes-Selva,"Vicent Blanes-Selva, Vicente Ruiz-Garc\'ia, Salvador Tortajada,
  Jos\'e-Miguel Bened\'i, Bernardo Valdivieso, Juan M. Garc\'ia-G\'omez","Design of one-year mortality forecast at hospital admission based: a
  machine learning approach",,,10.1177/1460458220987580,,cs.LG stat.AP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Palliative care is referred to a set of programs for patients
that suffer life-limiting illnesses. These programs aim to guarantee a minimum
level of quality of life (QoL) for the last stage of life. They are currently
based on clinical evaluation of risk of one-year mortality.
  Objectives: The main objective of this work is to develop and validate
machine-learning based models to predict the exitus of a patient within the
next year using data gathered at hospital admission.
  Methods: Five machine learning techniques were applied in our study to
develop machine-learning predictive models: Support Vector Machines,
K-neighbors Classifier, Gradient Boosting Classifier, Random Forest and
Multilayer Perceptron. All models were trained and evaluated using the
retrospective dataset. The evaluation was performed with five metrics computed
by a resampling strategy: Accuracy, the area under the ROC curve, Specificity,
Sensitivity, and the Balanced Error Rate.
  Results: All models for forecasting one-year mortality achieved an AUC ROC
from 0.858 to 0.911. Specifically, Gradient Boosting Classifier was the best
model, producing an AUC ROC of 0.911 (CI 95%, 0.911 to 0.912), a sensitivity of
0.858 (CI 95%, 0.856 to 0.86) and a specificity of 0.807 (CI 95%, 0.806 to
0808) and a BER of 0.168 (CI 95%, 0.167 to 0.169).
  Conclusions: The analysis of common information at hospital admission
combined with machine learning techniques produced models with competitive
discriminative power. Our models reach the best results reported in state of
the art. These results demonstrate that they can be used as an accurate
data-driven palliative care criteria inclusion.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2019 14:18:04 GMT'}]",2021-01-14,"[['Blanes-Selva', 'Vicent', ''], ['Ruiz-García', 'Vicente', ''], ['Tortajada', 'Salvador', ''], ['Benedí', 'José-Miguel', ''], ['Valdivieso', 'Bernardo', ''], ['García-Gómez', 'Juan M.', '']]","['Machine Learning', 'Palliative care', 'Hospital admission data', 'mortality forecast']"
728,1308.4516,Zhe Chen,Zhe Chen,On the Generative Power of Omega-Grammars and Omega-Automata,,Fundamenta Informaticae 111(2):119-145 (2011),10.3233/FI-2011-557,,cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An \omega-grammar is a formal grammar used to generate \omega-words (i.e.
infinite length words), while an \omega-automaton is an automaton used to
recognize \omega-words. This paper gives clean and uniform definitions for
\omega-grammars and \omega-automata, provides a systematic study of the
generative power of \omega-grammars with respect to \omega-automata, and
presents a complete set of results for various types of \omega-grammars and
acceptance modes. We use the tuple (\sigma,\rho,\pi) to denote various
acceptance modes, where \sigma denotes that some designated elements should
appear at least once or infinitely often, \rho denotes some binary relation
between two sets, and \pi denotes normal or leftmost derivations. Technically,
we propose (\sigma,\rho,\pi)-accepting \omega-grammars, and systematically
study their relative generative power with respect to (\sigma,\rho)-accepting
\omega-automata. We show how to construct some special forms of
\omega-grammars, such as \epsilon-production-free \omega-grammars. We study the
equivalence or inclusion relations between \omega$-grammars and \omega-automata
by establishing the translation techniques. In particular, we show that, for
some acceptance modes, the generative power of \omega-CFG is strictly weaker
than \omega-PDA, and the generative power of \omega-CSG is equal to \omega-TM
(rather than linear-bounded \omega-automata-like devices). Furthermore, we
raise some remaining open problems for two of the acceptance modes.
","[{'version': 'v1', 'created': 'Wed, 21 Aug 2013 08:57:05 GMT'}]",2013-08-22,"[['Chen', 'Zhe', '']]","['ω-automaton', 'ω-grammar', 'ω-language', 'generative power']"
729,1507.08847,Fei  Guo,"Jiachen Yanga, Zhiyong Dinga, Fei Guoa, Huogen Wanga, Nick Hughesb","A novel multivariate performance optimization method based on sparse
  coding and hyper-predictor learning",,,10.1016/j.neunet.2015.07.011,,cs.LG cs.CV cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate the problem of optimization multivariate
performance measures, and propose a novel algorithm for it. Different from
traditional machine learning methods which optimize simple loss functions to
learn prediction function, the problem studied in this paper is how to learn
effective hyper-predictor for a tuple of data points, so that a complex loss
function corresponding to a multivariate performance measure can be minimized.
We propose to present the tuple of data points to a tuple of sparse codes via a
dictionary, and then apply a linear function to compare a sparse code against a
give candidate class label. To learn the dictionary, sparse codes, and
parameter of the linear function, we propose a joint optimization problem. In
this problem, the both the reconstruction error and sparsity of sparse code,
and the upper bound of the complex loss function are minimized. Moreover, the
upper bound of the loss function is approximated by the sparse codes and the
linear function parameter. To optimize this problem, we develop an iterative
algorithm based on descent gradient methods to learn the sparse codes and
hyper-predictor parameter alternately. Experiment results on some benchmark
data sets show the advantage of the proposed methods over other
state-of-the-art algorithms.
","[{'version': 'v1', 'created': 'Fri, 31 Jul 2015 12:14:35 GMT'}]",2015-08-03,"[['Yanga', 'Jiachen', ''], ['Dinga', 'Zhiyong', ''], ['Guoa', 'Fei', ''], ['Wanga', 'Huogen', ''], ['Hughesb', 'Nick', '']]","['Pattern classification', 'Loss function', 'Multivariate performancemeasures', 'Sparse coding', 'Joint learning', 'Alternate optimization']"
730,1009.0929,Hao-En Chueh,Hao-En Chueh,Mining Target-Oriented Sequential Patterns with Time-Intervals,"11 pages, 9 tables","International journal of computer science & information Technology
  (IJCSIT) Vol.2, No.4, August 2010",10.5121/ijcsit.2010.2410,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A target-oriented sequential pattern is a sequential pattern with a concerned
itemset in the end of pattern. A time-interval sequential pattern is a
sequential pattern with time-intervals between every pair of successive
itemsets. In this paper we present an algorithm to discover target-oriented
sequential pattern with time-intervals. To this end, the original sequences are
reversed so that the last itemsets can be arranged in front of the sequences.
The contrasts between reversed sequences and the concerned itemset are then
used to exclude the irrelevant sequences. Clustering analysis is used with
typical sequential pattern mining algorithm to extract the sequential patterns
with time-intervals between successive itemsets. Finally, the discovered
time-interval sequential patterns are reversed again to the original order for
searching the target patterns.
","[{'version': 'v1', 'created': 'Sun, 5 Sep 2010 16:48:59 GMT'}]",2010-09-07,"[['Chueh', 'Hao-En', '']]","['Data Mining', 'Target-Oriented Sequential Pattern', 'Time-Interval', 'Clustering Analysis']"
731,1809.03486,Piotr Jurkiewicz,"Piotr Jurkiewicz, Grzegorz Rzym, Piotr Bory{\l}o",Flow length and size distributions in campus Internet traffic,,Computer Communications 167 (2021) 15-30,10.1016/j.comcom.2020.12.016,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The efficiency of flow-based networking mechanisms strongly depends on
traffic characteristics and should thus be assessed using accurate flow models.
For example, in the case of algorithms based on the distinction between
elephant and mice flows, it is extremely important to ensure realistic flows'
length and size distributions. Credible models or data are not available in
literature. Numerous works contain only plots roughly presenting empirical
distribution of selected flow parameters, without providing distribution
mixture models or any reusable numerical data. This paper aims to fill that gap
and provide reusable models of flow length and size derived from real traffic
traces. Traces were collected at the Internet-facing interface of the
university campus network and comprise four billion layer-4 flow (275 TB).
These models can be used to assess a variety of flow-oriented solutions under
the assumption of realistic conditions. Additionally, this paper provides a
tutorial on constructing network flow models from traffic traces. The proposed
methodology is universal and can be applied to traffic traces gathered in any
network. We also provide an open source software framework to analyze flow
traces and fit general mixture models to them.
","[{'version': 'v1', 'created': 'Mon, 10 Sep 2018 17:58:51 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Sep 2018 07:07:49 GMT'}, {'version': 'v3', 'created': 'Mon, 1 Jul 2019 04:09:08 GMT'}, {'version': 'v4', 'created': 'Wed, 15 Apr 2020 20:41:39 GMT'}, {'version': 'v5', 'created': 'Sun, 27 Dec 2020 01:15:49 GMT'}]",2020-12-29,"[['Jurkiewicz', 'Piotr', ''], ['Rzym', 'Grzegorz', ''], ['Boryło', 'Piotr', '']]","['flow distributions', 'network traffic model', 'elephant flows', 'mice flows', 'SDN']"
732,1103.5433,Serguei Mokhov,"Michael J. Assels, Dana Echtner, Michael Spanner, Serguei A. Mokhov,
  Fran\c{c}ois Carri\`ere, Manny Taveroff","Multifaceted Faculty Network Design and Management: Practice and
  Experience Report","19 pages, 11 figures, TOC and index; a short version presented at
  C3S2E'11; v6: more proofreading, index, TOC, references","Proceedings of The Fourth International C* Conference on Computer
  Science and Software Engineering (C3S2E '11). 2011, ACM, New York, NY, USA,
  151-155",10.1145/1992896.1992916,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We report on our experience on multidimensional aspects of our faculty's
network design and management, including some unique aspects such as
campus-wide VLANs and ghosting, security and monitoring, switching and routing,
and others. We outline a historical perspective on certain research, design,
and development decisions and discuss the network topology, its scalability,
and management in detail; the services our network provides, and its evolution.
We overview the security aspects of the management as well as data management
and automation and the use of the data by other members of the IT group in the
faculty.
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2011 17:59:53 GMT'}, {'version': 'v2', 'created': 'Sat, 16 Apr 2011 18:34:24 GMT'}, {'version': 'v3', 'created': 'Thu, 21 Apr 2011 14:54:05 GMT'}, {'version': 'v4', 'created': 'Fri, 22 Apr 2011 01:43:27 GMT'}, {'version': 'v5', 'created': 'Mon, 25 Apr 2011 01:08:35 GMT'}, {'version': 'v6', 'created': 'Mon, 25 Jul 2011 19:56:31 GMT'}]",2015-03-19,"[['Assels', 'Michael J.', ''], ['Echtner', 'Dana', ''], ['Spanner', 'Michael', ''], ['Mokhov', 'Serguei A.', ''], ['Carrière', 'François', ''], ['Taveroff', 'Manny', '']]","['network topology', 'spanning tree', 'network security', 'network management', 'VLANs']"
733,1701.00622,EPTCS,"Dietmar Seipel (University of W\""urzburg)",Knowledge Engineering for Hybrid Deductive Databases,"In Proceedings WLP'15/'16/WFLP'16, arXiv:1701.00148","EPTCS 234, 2017, pp. 1-12",10.4204/EPTCS.234.1,,cs.DB cs.AI cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern knowledge base systems frequently need to combine a collection of
databases in different formats: e.g., relational databases, XML databases, rule
bases, ontologies, etc. In the deductive database system DDBASE, we can manage
these different formats of knowledge and reason about them. Even the file
systems on different computers can be part of the knowledge base. Often, it is
necessary to handle different versions of a knowledge base. E.g., we might want
to find out common parts or differences of two versions of a relational
database.
  We will examine the use of abstractions of rule bases by predicate dependency
and rule predicate graphs. Also the proof trees of derived atoms can help to
compare different versions of a rule base. Moreover, it might be possible to
have derivations joining rules with other formalisms of knowledge
representation.
  Ontologies have shown their benefits in many applications of intelligent
systems, and there have been many proposals for rule languages compatible with
the semantic web stack, e.g., SWRL, the semantic web rule language. Recently,
ontologies are used in hybrid systems for specifying the provenance of the
different components.
","[{'version': 'v1', 'created': 'Tue, 3 Jan 2017 10:30:37 GMT'}]",2017-01-04,"[['Seipel', 'Dietmar', '', 'University of Würzburg']]","['hybrid knowledge bases', 'deductive databases', 'rules', 'ontologies']"
734,1612.06668,Aggelos Biboudis,"Oleg Kiselyov, Aggelos Biboudis, Nick Palladinos, Yannis Smaragdakis","Stream Fusion, to Completeness",,,10.1145/3009837.3009880,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stream processing is mainstream (again): Widely-used stream libraries are now
available for virtually all modern OO and functional languages, from Java to C#
to Scala to OCaml to Haskell. Yet expressivity and performance are still
lacking. For instance, the popular, well-optimized Java 8 streams do not
support the zip operator and are still an order of magnitude slower than
hand-written loops. We present the first approach that represents the full
generality of stream processing and eliminates overheads, via the use of
staging. It is based on an unusually rich semantic model of stream interaction.
We support any combination of zipping, nesting (or flat-mapping), sub-ranging,
filtering, mapping-of finite or infinite streams. Our model captures
idiosyncrasies that a programmer uses in optimizing stream pipelines, such as
rate differences and the choice of a ""for"" vs. ""while"" loops. Our approach
delivers hand-written-like code, but automatically. It explicitly avoids the
reliance on black-box optimizers and sufficiently-smart compilers, offering
highest, guaranteed and portable performance. Our approach relies on high-level
concepts that are then readily mapped into an implementation. Accordingly, we
have two distinct implementations: an OCaml stream library, staged via
MetaOCaml, and a Scala library for the JVM, staged via LMS. In both cases, we
derive libraries richer and simultaneously many tens of times faster than past
work. We greatly exceed in performance the standard stream libraries available
in Java, Scala and OCaml, including the well-optimized Java 8 streams.
","[{'version': 'v1', 'created': 'Tue, 20 Dec 2016 14:06:34 GMT'}]",2016-12-21,"[['Kiselyov', 'Oleg', ''], ['Biboudis', 'Aggelos', ''], ['Palladinos', 'Nick', ''], ['Smaragdakis', 'Yannis', '']]","['Code generation', 'multi-stage programming', 'optimization', 'stream fusion', 'streams']"
735,1903.10289,Andrea Tassi,Andrea Tassi and Ioannis Mavromatis and Robert J. Piechocki,"A Dataset of Full-Stack ITS-G5 DSRC Communications over Licensed and
  Unlicensed Bands Using a Large-Scale Urban Testbed",Manuscript submitted to Elsevier Data in Brief,,10.1016/j.dib.2019.104368,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A dataset of measurements of ETSI ITS-G5 Dedicated Short Range Communications
(DSRC) is presented. Our dataset consists of network interactions happening
between two On-Board Units (OBUs) and four Road Side Units (RSUs). Each OBU was
fitted onto a vehicle driven across the FLOURISH Test Track in Bristol, UK.
Each RSU and OBU was equipped with two transceivers operating at different
frequencies. During our experiments, each transceiver broadcasts Cooperative
Awareness Messages (CAMs) over the licensed DSRC band, and over the unlicensed
Industrial, Scientific, and Medical radio (ISM) bands 2.4GHz-2.5GHz and
5.725GHz-5.875GHz. Each transmitted and received CAM is logged along with its
Received Signal Strength Indicator (RSSI) value and accurate positioning
information. The Media Access Control layer (MAC) layer Packet Delivery Rates
(PDRs) and RSSI values are also empirically calculated across the whole length
of the track for any transceiver. The dataset can be used to derive realistic
approximations of the PDR as a function of RSSI values under urban environments
and for both the DSRC and ISM bands -- thus, the dataset is suitable to
calibrate (simplified) physical layers of full-stack vehicular simulators where
the MAC layer PDR is a direct function of the RSSI. The dataset is not intended
to be used for signal propagation modelling.
  The dataset can be found at
https://doi.org/10.5523/bris.eupowp7h3jl525yxhm3521f57 , and it has been
analyzed in the following paper: I. Mavromatis, A. Tassi, and R. J. Piechocki,
""Operating ITS-G5 DSRC over Unlicensed Bands: A City-Scale Performance
Evaluation,"" IEEE PIMRC 2019. [Online]. Available: arXiv:1904.00464.
","[{'version': 'v1', 'created': 'Mon, 25 Mar 2019 13:07:52 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Apr 2019 06:33:41 GMT'}, {'version': 'v3', 'created': 'Thu, 13 Jun 2019 13:08:42 GMT'}, {'version': 'v4', 'created': 'Wed, 17 Jul 2019 09:47:07 GMT'}]",2022-09-05,"[['Tassi', 'Andrea', ''], ['Mavromatis', 'Ioannis', ''], ['Piechocki', 'Robert J.', '']]","['ITS-G5', 'DSRC', 'RSSI', 'V2V', 'V2I', 'V2X', 'CAM']"
736,1812.11113,Bogdan Chlebus,Bogdan S. Chlebus and Vicent Cholvi and Dariusz R. Kowalski,Stability of Adversarial Routing with Feedback,,"Networks , 66 (2): 88 - 97, 2015",10.1002/net.21607,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the impact of scheduling disciplines on performance of routing in
the framework of adversarial queuing. We propose an adversarial model which
reflects stalling of packets due to transient failures and explicitly
incorporates feedback produced by a network when packets are stalled. This
adversarial model provides a methodology to study stability of routing
protocols when flow-control and congestion-control mechanisms affect the volume
of traffic. We show that any scheduling policy that is universally stable, in
the regular model of routing that additionally allows packets to have two
priorities, remains stable in the proposed adversarial model.
","[{'version': 'v1', 'created': 'Fri, 28 Dec 2018 16:54:01 GMT'}]",2018-12-31,"[['Chlebus', 'Bogdan S.', ''], ['Cholvi', 'Vicent', ''], ['Kowalski', 'Dariusz R.', '']]","['adversarial queueing', 'adversary with feedback', 'packet routing', 'scheduling policy', 'stability', 'universal stability', 'link fault', 'transient fault']"
737,1809.03445,Jasper Kyle Catapang,Jasper Kyle Catapang,"A collection of database industrial techniques and optimization
  approaches of database operations",,,10.5281/zenodo.1439511,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Databases play an essential role in our society today. Databases are embedded
in sectors like corporations, institutions, and government organizations, among
others. These databases are used for our video and audio streaming platforms,
social gaming, finances, cloud storage, e-commerce, healthcare, economy, etc.
It is therefore imperative that we learn how to properly execute database
operations and efficiently implement methodologies so that we may optimize the
performance of databases.
","[{'version': 'v1', 'created': 'Mon, 10 Sep 2018 16:33:11 GMT'}]",2018-10-02,"[['Catapang', 'Jasper Kyle', '']]","['database', 'optimization', 'industry']"
738,1810.07120,Mahbubur Rahman,"Mahbubur Rahman, Abusayeed Saifullah",A Comprehensive Survey on Networking over TV White Spaces,30 pages,,10.1016/j.pmcj.2019.101072,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  TV white spaces refer to the allocated but locally unused TV spectrum and can
be used by unlicensed devices as secondary users. Thanks to their lower
frequencies (e.g., 54 -- 698 MHz in the US), communication over the TV spectrum
has excellent propagation characteristics over long distances and through
obstacles. These characteristics along with their wide availability make the TV
white spaces a great choice and alternative to many existing wireless
technologies, especially the ones that need long range and high bandwidth
communication. In the last decade, there have been numerous efforts from
academia, industries, and standards bodies for exploiting the potentials of the
TV white spaces for several applications including wireless broadband Internet
access. Their characteristics and features also hold potentials for many new
applications including sensing and monitoring, Internet of Things, wireless
control, smart utility, location-based services, and transportation and
logistics. In this paper, we perform a retrospective review and comparative
study of existing work on networking in the TV white spaces. Additionally, we
discuss the associated research challenges such as dealing with the
interference between primary and secondary TV spectrum users, TV white space
temporal and spatial variations and fragmentation, antenna design, mobility,
and security. We also describe the future research directions to handle the
above challenges. To the best of our knowledge, this is the first comprehensive
survey on the literature of TV white space networking research.
","[{'version': 'v1', 'created': 'Tue, 16 Oct 2018 16:26:37 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Oct 2018 05:11:09 GMT'}, {'version': 'v3', 'created': 'Mon, 5 Aug 2019 02:55:47 GMT'}]",2019-08-06,"[['Rahman', 'Mahbubur', ''], ['Saifullah', 'Abusayeed', '']]","['White spaces', 'Networking protocols', 'Spectrum sensing']"
739,1404.2014,Mohammed  Javed,"P. Nagabhushan, Mohammed Javed, B.B. Chaudhuri",Entropy Computation of Document Images in Run-Length Compressed Domain,"Published in IEEE Proceedings 2014 Fifth International Conference on
  Signals and Image Processing","In IEEE Proceedings 2014 Fifth International Conference on Signals
  and Image Processing, Pages 287-291",10.1109/ICSIP.2014.51,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Compression of documents, images, audios and videos have been traditionally
practiced to increase the efficiency of data storage and transfer. However, in
order to process or carry out any analytical computations, decompression has
become an unavoidable pre-requisite. In this research work, we have attempted
to compute the entropy, which is an important document analytic directly from
the compressed documents. We use Conventional Entropy Quantifier (CEQ) and
Spatial Entropy Quantifiers (SEQ) for entropy computations [1]. The entropies
obtained are useful in applications like establishing equivalence, word
spotting and document retrieval. Experiments have been performed with all the
data sets of [1], at character, word and line levels taking compressed
documents in run-length compressed domain. The algorithms developed are
computational and space efficient, and results obtained match 100% with the
results reported in [1].
","[{'version': 'v1', 'created': 'Tue, 8 Apr 2014 05:15:18 GMT'}]",2014-04-09,"[['Nagabhushan', 'P.', ''], ['Javed', 'Mohammed', ''], ['Chaudhuri', 'B. B.', '']]","['Entropy', 'run-length compression', 'compressed documents', 'compressed domain processing']"
740,1902.07657,Alexandros Hollender,"Paul W. Goldberg, Alexandros Hollender",The Hairy Ball Problem is PPAD-Complete,Journal version,"Journal of Computer and System Sciences, 122:34-62 (2021)",10.1016/j.jcss.2021.05.004,,cs.CC cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Hairy Ball Theorem states that every continuous tangent vector field on
an even-dimensional sphere must have a zero. We prove that the associated
computational problem of (a) computing an approximate zero is PPAD-complete,
and (b) computing an exact zero is FIXP-hard. We also consider the Hairy Ball
Theorem on toroidal instead of spherical domains and show that the approximate
problem remains PPAD-complete. On a conceptual level, our PPAD-membership
results are particularly interesting, because they heavily rely on the
investigation of multiple-source variants of END-OF-LINE, the canonical
PPAD-complete problem. Our results on these new END-OF-LINE variants are of
independent interest and provide new tools for showing membership in PPAD. In
particular, we use them to provide the first full proof of PPAD-completeness
for the IMBALANCE problem defined by Beame et al. in 1998.
","[{'version': 'v1', 'created': 'Wed, 20 Feb 2019 17:11:20 GMT'}, {'version': 'v2', 'created': 'Fri, 3 May 2019 14:11:30 GMT'}, {'version': 'v3', 'created': 'Thu, 8 Sep 2022 23:14:23 GMT'}]",2022-09-12,"[['Goldberg', 'Paul W.', ''], ['Hollender', 'Alexandros', '']]","['Computational Complexity', 'TFNP', 'PPAD', 'End-of-Line']"
741,1303.3229,Radu Dragusin,"Radu Dragusin (1 and 2), Paula Petcu (1 and 3), Christina Lioma (1 and
  2), Birger Larsen (4), Henrik L. J{\o}rgensen (5), Ingemar J. Cox (1 and 6),
  Lars Kai Hansen (1), Peter Ingwersen (4), Ole Winther (1) ((1) DTU Compute,
  Technical University of Denmark, Denmark, (2) Department of Computer Science,
  University of Copenhagen, Denmark, (3) Findwise, Copenhagen, Denmark, (4)
  Information Systems and Interaction Design, Royal School of Library and
  Information Science, Copenhagen, Denmark, (5) Department of Clinical
  Biochemistry, Bispebjerg Hospital, Copenhagen, Denmark, (6) Department of
  Computer Science, University College London, London, United Kingdom)",FindZebra: A search engine for rare diseases,,"International Journal of Medical Informatics, Available online 23
  February 2013, ISSN 1386-5056",10.1016/j.ijmedinf.2013.01.005,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: The web has become a primary information resource about illnesses
and treatments for both medical and non-medical users. Standard web search is
by far the most common interface for such information. It is therefore of
interest to find out how well web search engines work for diagnostic queries
and what factors contribute to successes and failures. Among diseases, rare (or
orphan) diseases represent an especially challenging and thus interesting class
to diagnose as each is rare, diverse in symptoms and usually has scattered
resources associated with it. Methods: We use an evaluation approach for web
search engines for rare disease diagnosis which includes 56 real life
diagnostic cases, state-of-the-art evaluation measures, and curated information
resources. In addition, we introduce FindZebra, a specialized (vertical) rare
disease search engine. FindZebra is powered by open source search technology
and uses curated freely available online medical information. Results:
FindZebra outperforms Google Search in both default setup and customised to the
resources used by FindZebra. We extend FindZebra with specialized
functionalities exploiting medical ontological information and UMLS medical
concepts to demonstrate different ways of displaying the retrieved results to
medical experts. Conclusions: Our results indicate that a specialized search
engine can improve the diagnostic quality without compromising the ease of use
of the currently widely popular web search engines. The proposed evaluation
approach can be valuable for future development and benchmarking. The FindZebra
search engine is available at http://www.findzebra.com/.
","[{'version': 'v1', 'created': 'Wed, 13 Mar 2013 17:47:57 GMT'}]",2013-03-14,"[['Dragusin', 'Radu', '', '1 and 2'], ['Petcu', 'Paula', '', '1 and 3'], ['Lioma', 'Christina', '', '1 and\n  2'], ['Larsen', 'Birger', '', '1 and 6'], ['Jørgensen', 'Henrik L.', '', '1 and 6'], ['Cox', 'Ingemar J.', '', '1 and 6'], ['Hansen', 'Lars Kai', ''], ['Ingwersen', 'Peter', ''], ['Winther', 'Ole', '']]","['Rare diseases', 'Specialized search engine', 'Information retrieval', 'Evaluation of web search engines']"
742,1509.01404,Nicolas Gillis,"Arnaud Vandaele, Nicolas Gillis, Qi Lei, Kai Zhong, Inderjit Dhillon","Coordinate Descent Methods for Symmetric Nonnegative Matrix
  Factorization","25 pages, 5 figures, 7 tables. Main changes: comparison with another
  symNMF algorithm (namely, BetaSNMF), and correction of an error in the
  convergence proof","IEEE Transactions on Signal Processing 64 (21), pp. 5571-5584,
  2016",10.1109/TSP.2016.2591510,,cs.NA cs.CV cs.LG math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a symmetric nonnegative matrix $A$, symmetric nonnegative matrix
factorization (symNMF) is the problem of finding a nonnegative matrix $H$,
usually with much fewer columns than $A$, such that $A \approx HH^T$. SymNMF
can be used for data analysis and in particular for various clustering tasks.
In this paper, we propose simple and very efficient coordinate descent schemes
to solve this problem, and that can handle large and sparse input matrices. The
effectiveness of our methods is illustrated on synthetic and real-world data
sets, and we show that they perform favorably compared to recent
state-of-the-art methods.
","[{'version': 'v1', 'created': 'Fri, 4 Sep 2015 11:19:35 GMT'}, {'version': 'v2', 'created': 'Tue, 31 May 2016 12:50:38 GMT'}]",2016-10-07,"[['Vandaele', 'Arnaud', ''], ['Gillis', 'Nicolas', ''], ['Lei', 'Qi', ''], ['Zhong', 'Kai', ''], ['Dhillon', 'Inderjit', '']]","['symmetric nonnegative matrix factorization', 'coordinate descent', 'completely positivematrices']"
743,1305.0688,Chantal Cherifi,"Chantal Cherifi, Vincent Labatut, Jean-Fran\c{c}ois Santucci",On Flexible Web Services Composition Networks,,"In: International Conference on Digital Information and
  Communication Technology and its Applications (DICTAP), Springer CCIS, Dijon,
  France (2011)",10.1007/978-3-642-21984-9_5,,cs.SE cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The semantic Web service community develops efforts to bring semantics to Web
service descriptions and allow automatic discovery and composition. However,
there is no widespread adoption of such descriptions yet, because semantically
defining Web services is highly complicated and costly. As a result, production
Web services still rely on syntactic descriptions, key-word based discovery and
predefined compositions. Hence, more advanced research on syntactic Web
services is still ongoing. In this work we build syntactic composition Web
services networks with three well known similarity metrics, namely Levenshtein,
Jaro and Jaro-Winkler. We perform a comparative study on the metrics
performance by studying the topological properties of networks built from a
test collection of real-world descriptions. It appears Jaro-Winkler finds more
appropriate similarities and can be used at higher thresholds. For lower
thresholds, the Jaro metric would be preferable because it detect less
irrelevant relationships.
","[{'version': 'v1', 'created': 'Fri, 3 May 2013 12:40:17 GMT'}]",2015-02-04,"[['Cherifi', 'Chantal', ''], ['Labatut', 'Vincent', ''], ['Santucci', 'Jean-François', '']]","['Web services', 'Web services Composition', 'Interaction Networks', 'Similarity Metrics', 'Flexible Matching']"
744,1605.06424,Zeeshan Lakhani,"Russell Brown, Zeeshan Lakhani, and Paul Place",Big(ger) Sets: decomposed delta CRDT Sets in Riak,"PaPoC '16 Proceedings of the 2nd Workshop on the Principles and
  Practice of Consistency for Distributed Data, Article No. 5, Publication
  Date: 2016-04-18",,10.1145/2911151.2911156,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CRDT[24] Sets as implemented in Riak[6] perform poorly for writes, both as
cardinality grows, and for sets larger than 500KB[25]. Riak users wish to
create high cardinality CRDT sets, and expect better than O(n) performance for
individual insert and remove operations. By decomposing a CRDT set on disk, and
employing delta-replication[2], we can achieve far better performance than just
delta replication alone: relative to the size of causal metadata, not the
cardinality of the set, and we can support sets that are 100s times the size of
Riak sets, while still providing the same level of consistency. There is a
trade-off in read performance but we expect it is mitigated by enabling queries
on sets.
","[{'version': 'v1', 'created': 'Fri, 20 May 2016 16:27:13 GMT'}]",2016-05-23,"[['Brown', 'Russell', ''], ['Lakhani', 'Zeeshan', ''], ['Place', 'Paul', '']]","['Eventual Consistency', 'CRDTs', 'databases']"
745,0804.4565,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg","Data linkage algebra, data linkage dynamics, and priority rewriting","48 pages, typos corrected, phrasing improved, definition of services
  replaced; presentation improved; presentation improved and appendix added","Fundamenta Informaticae, 128(4):367--412, 2013",10.3233/FI-2013-950,PRG0806,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce an algebra of data linkages. Data linkages are intended for
modelling the states of computations in which dynamic data structures are
involved. We present a simple model of computation in which states of
computations are modelled as data linkages and state changes take place by
means of certain actions. We describe the state changes and replies that result
from performing those actions by means of a term rewriting system with rule
priorities. The model in question is an upgrade of molecular dynamics. The
upgrading is mainly concerned with the features to deal with values and the
features to reclaim garbage.
","[{'version': 'v1', 'created': 'Tue, 29 Apr 2008 09:55:33 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Jun 2008 05:48:10 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Oct 2012 11:31:42 GMT'}, {'version': 'v4', 'created': 'Wed, 5 Jun 2013 09:46:25 GMT'}]",2013-11-18,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['data linkage algebra', 'data linkage dynamics', 'garbage collection', 'priority rewrite system']"
746,1809.06535,Kyudong Park,"Kyudong Park, Jiyoung Kwahk, Sung H. Han, Minseok Song, Dong Gu Choi,
  Hyeji Jang, Dohyeon Kim, Young Deok Won, In Sub Jeong","Modelling the Intrusive feelings of advanced driver assistance systems
  based on vehicle activity log data: a case study for the lane keeping
  assistance system",,"International Journal of Automotive Technology, 2019,
  20(3):455-463",10.1007/s12239-019-0043-6,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although the automotive industry has been among the sectors that
best-understands the importance of drivers' affect, the focus of design and
research in the automotive field has long emphasized the visceral aspects of
exterior and interior design. With the adoption of Advanced Driver Assistance
Systems (ADAS), endowing 'semi-autonomy' to the vehicles, however, the scope of
affective design should be expanded to include the behavioural aspects of the
vehicle. In such a 'shared-control' system wherein the vehicle can intervene in
the human driver's operations, a certain degree of 'intrusive feelings' are
unavoidable. For example, when the Lane Keeping Assistance System (LKAS), one
of the most popular examples of ADAS, operates the steering wheel in a
dangerous situation, the driver may feel interrupted or surprised because of
the abrupt torque generated by LKAS. This kind of unpleasant experience can
lead to prolonged negative feelings such as irritation, anxiety, and distrust
of the system. Therefore, there are increasing needs of investigating the
driver's affective responses towards the vehicle's dynamic behaviour. In this
study, four types of intrusive feelings caused by LKAS were identified to be
proposed as a quantitative performance indicator in designing the affectively
satisfactory behaviour of LKAS. A metric as well as a statistical data analysis
method to quantitatively measure the intrusive feelings through the vehicle
sensor log data.
","[{'version': 'v1', 'created': 'Tue, 18 Sep 2018 05:13:21 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Apr 2019 14:24:00 GMT'}]",2019-05-01,"[['Park', 'Kyudong', ''], ['Kwahk', 'Jiyoung', ''], ['Han', 'Sung H.', ''], ['Song', 'Minseok', ''], ['Choi', 'Dong Gu', ''], ['Jang', 'Hyeji', ''], ['Kim', 'Dohyeon', ''], ['Won', 'Young Deok', ''], ['Jeong', 'In Sub', '']]","['ADAS', 'LKAS', 'Vehicle activity log data', 'Intrusive feeling', 'Affective design']"
747,1208.3022,Ehsan Saboori Mr.,"Ehsan Saboori, Majid Rafigh and Alireza Nooriyan",Analyzing the Dual-Path Peer-to-Peer Anonymous Approach,"7 Pages. Published by Foundation of Computer Science, New York, USA","International Journal of Computer Applications 37(11):16-22,
  January 2012",10.5120/4729-6919,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dual-Path is an anonymous peer-to-peer approach which provides requester
anonymity. This approach provides anonymity between a requester and a provider
in peer-to-peer networks with trusted servers called suppernode so the provider
will not be able to identify the requester and no other peers can identify the
two communicating parties with certainty. Dual-Path establishes two paths for
transmitting data. These paths called Request path and Response path. The first
one is used for requesting data and the second one is used for sending the
requested data to the requester. As Dual-Path approach is similar to Crowds
approach, this article compares reliability and performance of Dual-Path and
Crowds. For this purpose a simulator is developed and several scenarios are
defined to compare Dual-Path and Crowds in different situations. In chapter 2
and 3 Dual-Path and Crowds approaches are briefly described. Chapter 4 is
talking about simulator. Chapter 5 explains the scenarios for comparison of
performance. Chapter 6 is about comparison of reliability and chapter 7 is
conclusion.
","[{'version': 'v1', 'created': 'Wed, 15 Aug 2012 04:06:14 GMT'}]",2012-08-16,"[['Saboori', 'Ehsan', ''], ['Rafigh', 'Majid', ''], ['Nooriyan', 'Alireza', '']]","['Dual-Path', 'Peer-to-peer Networks', 'Anonymity', 'Onion']"
748,1007.3829,Frank Raiser,"Hariolf Betz and Frank Raiser and Thom Fr\""uhwirth",A Complete and Terminating Execution Model for Constraint Handling Rules,15 pages,"Theory and Practice of Logic Programming, Volume 10, Special Issue
  4-6, July 2010, pp 597-610",10.1017/S147106841000030X,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We observe that the various formulations of the operational semantics of
Constraint Handling Rules proposed over the years fall into a spectrum ranging
from the analytical to the pragmatic. While existing analytical formulations
facilitate program analysis and formal proofs of program properties, they
cannot be implemented as is. We propose a novel operational semantics, which
has a strong analytical foundation, while featuring a terminating execution
model. We prove its soundness and completeness with respect to existing
analytical formulations and we provide an implementation in the form of a
source-to-source transformation to CHR with rule priorities.
","[{'version': 'v1', 'created': 'Thu, 22 Jul 2010 08:41:47 GMT'}]",2010-07-23,"[['Betz', 'Hariolf', ''], ['Raiser', 'Frank', ''], ['Frühwirth', 'Thom', '']]","['Constraint Handling Rules', 'Operational Semantics', 'Execution Model', 'Persistent Constraints']"
749,1006.0878,Secretary Aircc Journal,Hao Shi,Developing E-Learning Materials for Software Development Course,7 pages,"International Journal of Managing Information Technology 2.2
  (2010) 15-21",10.5121/ijmit.2010.2202,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Software Development is a core second-year course currently offered to
undergraduate students at Victoria University at its five local and
international campuses. The project aims to redesign the existing course
curriculum to support student-centred teaching and learning. It is intended to
provide a learning context in which learners can reflect on new material,
discuss their tentative understandings with others, actively search for new
information, develop skills in communication and collaboration, and build
conceptual connections to their existing knowledge base. The key feature of the
cross-campus curriculum innovation is the use of Blackboard, short for
Blackboard Learning System, to assist in course content organization and online
delivery. A well-defined and integrated case study is used throughout the
course to provide realistic practical experience of software development. It
allows students to take control of their own learning while at the same time
providing support to those students who have particular learning difficulties.
In this paper, the developed curriculum and the learning outcome are described.
The e-Learning material and various Blackboard tools used for teaching and
learning activities are presented. Finally, conclusion is drawn from classroom
experience.
","[{'version': 'v1', 'created': 'Fri, 4 Jun 2010 12:32:57 GMT'}]",2010-07-15,"[['Shi', 'Hao', '']]","['e-Learning', 'curriculum', 'student-centred', 'Learning Management System (LMS)', 'Blackboard', 'software development', 'course design']"
750,1402.2003,Sorin Matei,"Sorin Adam Matei, Nicholas K. Rauh, Eric C. Kansa","A New Approach to Reporting Archaeological Surveys: Connecting Rough
  Cilicia, Visible Past and Open Context through loose coupling and 3d codes","A previous version of this paper was presented at the 2012 Conference
  of the Association of Ancient Historians, May 3-5, Chapell Hill, North
  Carolina","Journal of Data Mining & Digital Humanities, 2014 (June 24, 2014)
  jdmdh:12",10.46298/jdmdh.9,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The project presents the strategy adopted by the Rough Cilicia Archaeological
Survey team for publishing its primary data and reports via three potentially
transformative strategies for digital humanities: Loose coupling of digital
data curation and publishing platforms. In loosely coupled systems, components
share only a limited set of simple assumptions, which enables systems to evolve
dynamically. Collaborative creation of map based narrative content. Connecting
print scholarship (book, reports, article) to online resources via
two-dimensional barcodes (2D codes) that can be printed on paper and can call
up hyperlinks when scanned with a Smartphone. The three strategies are made
possible by loosely coupling two autonomous services: Visible Past, dedicated
to web collaboration and digital-print publishing and Open Context, which is a
geo-historical data archiving and publishing service. The Rough Cilicia
Archaeological Survey, Visible Past, and Open Context work together to
illustrate a new genre of scholarship, which combine qualitative narratives and
quantitative representations of space and social phenomena. The project
provides tools for collaborative creation of rich scholarly narratives that are
spatially located and for connecting print publications to the digital realm.
The project is a case study for utilizing the three new strategies for creating
and publishing spatial humanities scholarship more broadly for ancient
historians.
","[{'version': 'v1', 'created': 'Sun, 9 Feb 2014 23:09:21 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Mar 2014 01:54:29 GMT'}]",2021-07-01,"[['Matei', 'Sorin Adam', ''], ['Rauh', 'Nicholas K.', ''], ['Kansa', 'Eric C.', '']]","['loose coupling', 'digital humanities', 'collaboration', 'online platform', 'mapping', 'GIS']"
751,1803.07991,Florian Dubost,"Filipe Marques, Florian Dubost, Mariette Kemner-van de Corput, Harm
  A.W. Tiddens, Marleen de Bruijne","Quantification of Lung Abnormalities in Cystic Fibrosis using Deep
  Networks",SPIE - Medical Imaging 2018: Image Processing,"Proc. SPIE 10574, Medical Imaging 2018: Image Processing, 105741G
  (2 March 2018)",10.1117/12.2292188,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cystic fibrosis is a genetic disease which may appear in early life with
structural abnormalities in lung tissues. We propose to detect these
abnormalities using a texture classification approach. Our method is a cascade
of two convolutional neural networks. The first network detects the presence of
abnormal tissues. The second network identifies the type of the structural
abnormalities: bronchiectasis, atelectasis or mucus plugging.We also propose a
network computing pixel-wise heatmaps of abnormality presence learning only
from the patch-wise annotations. Our database consists of CT scans of 194
subjects. We use 154 subjects to train our algorithms and the 40 remaining ones
as a test set. We compare our method with random forest and a single neural
network approach. The first network reaches an accuracy of 0,94 for disease
detection, 0,18 higher than the random forest classifier and 0,37 higher than
the single neural network. Our cascade approach yields a final class-averaged
F1-score of 0,33, outperforming the baseline method and the single network by
0,10 and 0,12.
","[{'version': 'v1', 'created': 'Wed, 21 Mar 2018 16:18:46 GMT'}]",2018-03-22,"[['Marques', 'Filipe', ''], ['Dubost', 'Florian', ''], ['de Corput', 'Mariette Kemner-van', ''], ['Tiddens', 'Harm A. W.', ''], ['de Bruijne', 'Marleen', '']]","['Cystic Fibrosis', 'Deep Learning', 'Cascade Network', 'Reconstruction', 'Visualization']"
752,1609.00203,Angelos Valsamis,"Angelos Valsamis, Konstantinos Tserpes, Dimitrios Zissis, Dimosthenis
  Anagnostopoulos, Theodora Varvarigou","Employing traditional machine learning algorithms for big data streams
  analysis: the case of object trajectory prediction","14 pages, 2 figures, 3 tables, 31 references",,10.1016/j.jss.2016.06.016,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we model the trajectory of sea vessels and provide a service
that predicts in near-real time the position of any given vessel in 4', 10',
20' and 40' time intervals. We explore the necessary tradeoffs between
accuracy, performance and resource utilization are explored given the large
volume and update rates of input data. We start with building models based on
well-established machine learning algorithms using static datasets and
multi-scan training approaches and identify the best candidate to be used in
implementing a single-pass predictive approach, under real-time constraints.
The results are measured in terms of accuracy and performance and are compared
against the baseline kinematic equations. Results show that it is possible to
efficiently model the trajectory of multiple vessels using a single model,
which is trained and evaluated using an adequately large, static dataset, thus
achieving a significant gain in terms of resource usage while not compromising
accuracy.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2016 12:06:20 GMT'}]",2016-09-02,"[['Valsamis', 'Angelos', ''], ['Tserpes', 'Konstantinos', ''], ['Zissis', 'Dimitrios', ''], ['Anagnostopoulos', 'Dimosthenis', ''], ['Varvarigou', 'Theodora', '']]","['trajectory prediction', 'real-time query response', 'data streams', 'machine learning']"
753,1211.2190,Luca Martino,"Jesse Read, Luca Martino, David Luengo","Efficient Monte Carlo Methods for Multi-Dimensional Learning with
  Classifier Chains",Submitted to Pattern Recognition,"Pattern Recognition, Volume 47, Issue 3, Pages: 1535-1546, 2014",10.1016/j.patcog.2013.10.006,,cs.LG stat.CO stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-dimensional classification (MDC) is the supervised learning problem
where an instance is associated with multiple classes, rather than with a
single class, as in traditional classification problems. Since these classes
are often strongly correlated, modeling the dependencies between them allows
MDC methods to improve their performance - at the expense of an increased
computational cost. In this paper we focus on the classifier chains (CC)
approach for modeling dependencies, one of the most popular and highest-
performing methods for multi-label classification (MLC), a particular case of
MDC which involves only binary classes (i.e., labels). The original CC
algorithm makes a greedy approximation, and is fast but tends to propagate
errors along the chain. Here we present novel Monte Carlo schemes, both for
finding a good chain sequence and performing efficient inference. Our
algorithms remain tractable for high-dimensional data sets and obtain the best
predictive performance across several real data sets.
","[{'version': 'v1', 'created': 'Fri, 9 Nov 2012 17:21:48 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Dec 2012 18:39:35 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Apr 2013 16:43:20 GMT'}, {'version': 'v4', 'created': 'Sat, 7 Sep 2013 13:10:06 GMT'}]",2014-05-20,"[['Read', 'Jesse', ''], ['Martino', 'Luca', ''], ['Luengo', 'David', '']]","['classifier chains', 'multi-dimensional classification', 'multi-labelclassification', 'Monte Carlo methods', 'Bayesian inference']"
754,1806.09856,Evgenii Tsymbalov,"Evgenii Tsymbalov, Maxim Panov, Alexander Shapeev",Dropout-based Active Learning for Regression,"Report on AIST 2018; will be published in Springer LNCS series
  (Analysis of Images, Social Networks and Texts - 7th International
  Conference, AIST 2018)","Analysis of Images, Social Networks and Texts - 7th International
  Conference, AIST 2018, Lecture Notes in Computer Science book series (LNCS),
  volume 11179, pp. 247-258",10.1007/978-3-030-11027-7_24,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Active learning is relevant and challenging for high-dimensional regression
models when the annotation of the samples is expensive. Yet most of the
existing sampling methods cannot be applied to large-scale problems, consuming
too much time for data processing. In this paper, we propose a fast active
learning algorithm for regression, tailored for neural network models. It is
based on uncertainty estimation from stochastic dropout output of the network.
Experiments on both synthetic and real-world datasets show comparable or better
performance (depending on the accuracy metric) as compared to the baselines.
This approach can be generalized to other deep learning architectures. It can
be used to systematically improve a machine-learning model as it offers a
computationally efficient way of sampling additional data.
","[{'version': 'v1', 'created': 'Tue, 26 Jun 2018 09:06:40 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Jul 2018 10:42:19 GMT'}]",2020-01-24,"[['Tsymbalov', 'Evgenii', ''], ['Panov', 'Maxim', ''], ['Shapeev', 'Alexander', '']]","['regression', 'active learning', 'uncertainty quantification', 'neural networks', 'dropout']"
755,1211.0978,Ignasi Sau,Valentin Garnero and Ignasi Sau,A Linear Kernel for Planar Total Dominating Set,"33 pages, 13 figures","Discrete Mathematics & Theoretical Computer Science, Vol. 20 no.
  1, Discrete Algorithms (May 16, 2018) dmtcs:4487",10.23638/DMTCS-20-1-14,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ such
that every vertex in $V$ is adjacent to some vertex in $D$. Finding a total
dominating set of minimum size is NP-hard on planar graphs and W[2]-complete on
general graphs when parameterized by the solution size. By the meta-theorem of
Bodlaender et al. [J. ACM, 2016], there exists a linear kernel for Total
Dominating Set on graphs of bounded genus. Nevertheless, it is not clear how
such a kernel can be effectively constructed, and how to obtain explicit
reduction rules with reasonably small constants. Following the approach of
Alber et al. [J. ACM, 2004], we provide an explicit kernel for Total Dominating
Set on planar graphs with at most $410k$ vertices, where $k$ is the size of the
solution. This result complements several known constructive linear kernels on
planar graphs for other domination problems such as Dominating Set, Edge
Dominating Set, Efficient Dominating Set, Connected Dominating Set, or Red-Blue
Dominating Set.
","[{'version': 'v1', 'created': 'Mon, 5 Nov 2012 19:16:18 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Jan 2014 14:12:22 GMT'}, {'version': 'v3', 'created': 'Fri, 28 Apr 2017 22:22:06 GMT'}, {'version': 'v4', 'created': 'Tue, 12 Dec 2017 08:19:34 GMT'}, {'version': 'v5', 'created': 'Mon, 7 May 2018 09:46:25 GMT'}]",2019-03-14,"[['Garnero', 'Valentin', ''], ['Sau', 'Ignasi', '']]","['parameterized complexity', 'planar graphs', 'linear kernels', 'total domination']"
756,1511.04437,Aleksei Kondratev Mr,Aleksei Kondratev and Vladimir Mazalov,The Ranking Problem of Alternatives as a Cooperative Game,,"International Journal of Game Theory, 49(1), 119-145 (2020)",10.1007/s00182-019-00681-5,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the ranking problem of candidates for a certain position
based on ballot papers filled by voters. We suggest a ranking procedure of
alternatives using cooperative game theory methods. For this, it is necessary
to construct a characteristic function via the filled ballot paper profile of
voters. The Shapley value serves as the ranking method. The winner is the
candidate having the maximum Shapley value. And finally, we explore the
properties of the designed ranking procedure.
","[{'version': 'v1', 'created': 'Mon, 9 Nov 2015 09:01:43 GMT'}]",2022-09-09,"[['Kondratev', 'Aleksei', ''], ['Mazalov', 'Vladimir', '']]","['ranked election', 'ballot paper', 'tournament matrix', 'cooperativegame', 'Shapley value']"
757,1801.01557,Javad Fotouhi,"Javad Fotouhi, Clayton P. Alexander, Mathias Unberath, Giacomo Taylor,
  Sing Chun Lee, Bernhard Fuerst, Alex Johnson, Greg Osgood, Russell H. Taylor,
  Harpal Khanuja, Mehran Armand, Nassir Navab","Plan in 2D, execute in 3D: An augmented reality solution for cup
  placement in total hip arthroplasty",,"J. Med. Imag. 5(2), 021205 (2018)",10.1117/1.JMI.5.2.021205,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reproducibly achieving proper implant alignment is a critical step in total
hip arthroplasty (THA) procedures that has been shown to substantially affect
patient outcome. In current practice, correct alignment of the acetabular cup
is verified in C-arm X-ray images that are acquired in an anterior-posterior
(AP) view. Favorable surgical outcome is, therefore, heavily dependent on the
surgeon's experience in understanding the 3D orientation of a hemispheric
implant from 2D AP projection images. This work proposes an easy to use
intra-operative component planning system based on two C-arm X-ray images that
is combined with 3D augmented reality (AR) visualization that simplifies
impactor and cup placement according to the planning by providing a real-time
RGBD data overlay. We evaluate the feasibility of our system in a user study
comprising four orthopedic surgeons at the Johns Hopkins Hospital, and also
report errors in translation, anteversion, and abduction as low as 1.98 mm,
1.10 degrees, and 0.53 degrees, respectively. The promising performance of this
AR solution shows that deploying this system could eliminate the need for
excessive radiation, simplify the intervention, and enable reproducibly
accurate placement of acetabular implants.
","[{'version': 'v1', 'created': 'Thu, 4 Jan 2018 22:00:20 GMT'}]",2018-01-08,"[['Fotouhi', 'Javad', ''], ['Alexander', 'Clayton P.', ''], ['Unberath', 'Mathias', ''], ['Taylor', 'Giacomo', ''], ['Lee', 'Sing Chun', ''], ['Fuerst', 'Bernhard', ''], ['Johnson', 'Alex', ''], ['Osgood', 'Greg', ''], ['Taylor', 'Russell H.', ''], ['Khanuja', 'Harpal', ''], ['Armand', 'Mehran', ''], ['Navab', 'Nassir', '']]","['intra-operative planning', 'X-ray', 'augmented reality', 'RGBD camera', 'total hip arthroplasty']"
758,1306.3414,Ella Gale,"Ella Gale, Andrew Adamatzky and Ben de Lacy Costello",Slime Mould Memristors,"14 pages, 6 figures",,10.1007/s12668-014-0156-3,,cs.ET cond-mat.other physics.bio-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In laboratory experiments we demonstrate that protoplasmic tubes of acellular
slime mould \emph{Physarum polycephalum} show current versus voltage profiles
consistent with memristive systems and that the effect is due to the living
protoplasm of the mould. This complements previous findings on memristive
properties of other living systems (human skin and blood) and contributes to
development of self-growing bio-electronic circuits. Distinctive asymmetric
$V$-$I$ curves which were occasionally observed when the internal current is on
the same order as the driven current, are well-modelled by the concept of
active memristors.
","[{'version': 'v1', 'created': 'Fri, 14 Jun 2013 14:44:51 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Apr 2014 14:02:10 GMT'}]",2014-11-25,"[['Gale', 'Ella', ''], ['Adamatzky', 'Andrew', ''], ['Costello', 'Ben de Lacy', '']]","['memristor', 'slimemould', 'bioelectronics', 'active memristor', 'Physarum']"
759,2109.15095,Oliver Gasser,"Taha Albakour, Oliver Gasser, Robert Beverly, Georgios Smaragdakis",Third Time's Not a Charm: Exploiting SNMPv3 for Router Fingerprinting,Visit https://snmpv3.io for up-to-date SNMPv3 measurement results,"Proceedings of the 2021 ACM Internet Measurement Conference (IMC
  '21)",10.1145/3487552.3487848,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we show that adoption of the SNMPv3 network management
protocol standard offers a unique -- but likely unintended -- opportunity for
remotely fingerprinting network infrastructure in the wild. Specifically, by
sending unsolicited and unauthenticated SNMPv3 requests, we obtain detailed
information about the configuration and status of network devices including
vendor, uptime, and the number of restarts. More importantly, the reply
contains a persistent and strong identifier that allows for lightweight
Internet-scale alias resolution and dual-stack association. By launching active
Internet-wide SNMPv3 scan campaigns, we show that our technique can fingerprint
more than 4.6 million devices of which around 350k are network routers. Not
only is our technique lightweight and accurate, it is complementary to existing
alias resolution, dual-stack inference, and device fingerprinting approaches.
Our analysis not only provides fresh insights into the router deployment
strategies of network operators worldwide, but also highlights potential
vulnerabilities of SNMPv3 as currently deployed.
","[{'version': 'v1', 'created': 'Thu, 30 Sep 2021 13:05:11 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Oct 2021 14:29:32 GMT'}]",2021-10-07,"[['Albakour', 'Taha', ''], ['Gasser', 'Oliver', ''], ['Beverly', 'Robert', ''], ['Smaragdakis', 'Georgios', '']]","['Simple Network Management Protocol (SNMP)', 'Device Fingerprinting', 'Alias Resolution']"
760,1406.7075,"\""Omer Faruk Ertu\u{g}rul",Omer Faruk Ertugrul,Adaptive texture energy measure method,,"International Journal of Intelligent Information Systems. Vol. 3,
  No. 2, 2014, pp. 13-18",10.11648/j.ijiis.20140302.11,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent developments in image quality, data storage, and computational
capacity have heightened the need for texture analysis in image process. To
date various methods have been developed and introduced for assessing textures
in images. One of the most popular texture analysis methods is the Texture
Energy Measure (TEM) and it has been used for detecting edges, levels, waves,
spots and ripples by employing predefined TEM masks to images. Despite several
success- ful studies, TEM has a number of serious weaknesses in use. The major
drawback is; the masks are predefined therefore they cannot be adapted to
image. A new method, Adaptive Texture Energy Measure Method (aTEM), was offered
to over- come this disadvantage of TEM by using adaptive masks by adjusting the
contrast, sharpening and orientation angle of the mask. To assess the
applicability of aTEM, it is compared with TEM. The accuracy of the
classification of butterfly, flower seed and Brodatz datasets are 0.08, 0.3292
and 0.3343, respectively by TEM and 0.0053, 0.2417 and 0.3153, respectively by
aTEM. The results of this study indicate that aTEM is a successful method for
texture analysis.
","[{'version': 'v1', 'created': 'Fri, 27 Jun 2014 06:00:17 GMT'}]",2014-06-30,"[['Ertugrul', 'Omer Faruk', '']]","['Texture Energy Measure', 'Adaptive Image Process', 'Machine Vision', 'Feature Extraction']"
761,1703.04594,Alessandro Gabbana,"E. Calore, A. Gabbana, S. F. Schifano, R. Tripiccione",Optimization of Lattice Boltzmann Simulations on Heterogeneous Computers,,,10.1177/1094342017703771,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  High-performance computing systems are more and more often based on
accelerators. Computing applications targeting those systems often follow a
host-driven approach in which hosts offload almost all compute-intensive
sections of the code onto accelerators; this approach only marginally exploits
the computational resources available on the host CPUs, limiting performance
and energy efficiency. The obvious step forward is to run compute-intensive
kernels in a concurrent and balanced way on both hosts and accelerators. In
this paper we consider exactly this problem for a class of applications based
on Lattice Boltzmann Methods, widely used in computational fluid-dynamics. Our
goal is to develop just one program, portable and able to run efficiently on
several different combinations of hosts and accelerators. To reach this goal,
we define common data layouts enabling the code to exploit efficiently the
different parallel and vector options of the various accelerators, and matching
the possibly different requirements of the compute-bound and memory-bound
kernels of the application. We also define models and metrics that predict the
best partitioning of workloads among host and accelerator, and the optimally
achievable overall performance level. We test the performance of our codes and
their scaling properties using as testbeds HPC clusters incorporating different
accelerators: Intel Xeon-Phi many-core processors, NVIDIA GPUs and AMD GPUs.
","[{'version': 'v1', 'created': 'Tue, 14 Mar 2017 17:20:39 GMT'}]",2017-05-15,"[['Calore', 'E.', ''], ['Gabbana', 'A.', ''], ['Schifano', 'S. F.', ''], ['Tripiccione', 'R.', '']]","['Lattice Boltzmann methods', 'Accelerators', 'Performance modeling', 'Heterogeneous systems', 'Performance portability']"
762,1805.08677,Thomas Vogel,"Thomas Vogel, Stefan Neumann, Stephan Hildebrandt, Holger Giese, Basil
  Becker","Model-Driven Architectural Monitoring and Adaptation for Autonomic
  Systems",,"In: International Conference on Autonomic Computing and
  Communications. ICAC '09. ACM, 2009, pp. 67-68",10.1145/1555228.1555249,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Architectural monitoring and adaptation allows self-management capabilities
of autonomic systems to realize more powerful adaptation steps, which observe
and adjust not only parameters but also the software architecture. However,
monitoring as well as adaptation of the architecture of a running system in
addition to the parameters are considerably more complex and only rather
limited and costly solutions are available today. In this paper we propose a
model-driven approach to ease the development of architectural monitoring and
adaptation for autonomic systems. Using meta models and model transformation
techniques, we were able to realize an incremental synchronization between the
run-time system and models for different self-management activities. The
synchronization might be triggered when needed and therefore the activities can
operate concurrently.
","[{'version': 'v1', 'created': 'Thu, 17 May 2018 07:43:29 GMT'}]",2018-05-23,"[['Vogel', 'Thomas', ''], ['Neumann', 'Stefan', ''], ['Hildebrandt', 'Stephan', ''], ['Giese', 'Holger', ''], ['Becker', 'Basil', '']]","['autonomic computing', 'model-driven engineering', 'model synchronization', 'model transformation', 'software architecture']"
763,1703.04980,Veronika Cheplygina,"Veronika Cheplygina and Lauge S{\o}rensen and David M. J. Tax and
  Jesper Holst Pedersen and Marco Loog and Marleen de Bruijne",Classification of COPD with Multiple Instance Learning,"Published at International Conference on Pattern Recognition (ICPR)
  2014",,10.1109/ICPR.2014.268,,cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Chronic obstructive pulmonary disease (COPD) is a lung disease where early
detection benefits the survival rate. COPD can be quantified by classifying
patches of computed tomography images, and combining patch labels into an
overall diagnosis for the image. As labeled patches are often not available,
image labels are propagated to the patches, incorrectly labeling healthy
patches in COPD patients as being affected by the disease. We approach
quantification of COPD from lung images as a multiple instance learning (MIL)
problem, which is more suitable for such weakly labeled data. We investigate
various MIL assumptions in the context of COPD and show that although a concept
region with COPD-related disease patterns is present, considering the whole
distribution of lung tissue patches improves the performance. The best method
is based on averaging instances and obtains an AUC of 0.742, which is higher
than the previously reported best of 0.713 on the same dataset. Using the full
training set further increases performance to 0.776, which is significantly
higher (DeLong test) than previous results.
","[{'version': 'v1', 'created': 'Wed, 15 Mar 2017 07:41:49 GMT'}]",2017-03-16,"[['Cheplygina', 'Veronika', ''], ['Sørensen', 'Lauge', ''], ['Tax', 'David M. J.', ''], ['Pedersen', 'Jesper Holst', ''], ['Loog', 'Marco', ''], ['de Bruijne', 'Marleen', '']]","['Computer aided diagnosis', 'chronic obstructive pulmonary disease', 'supervised learning', 'multiple instance learning']"
764,1805.00116,Jeffrey Uhlmann,Jeffrey Uhlmann,"A Canonical Image Set for Examining and Comparing Image Processing
  Algorithms",,"Journal of Image and Graphics, Vol. 6, No. 2, pp. 137-144,
  December 2018",10.18178/joig.6.2.137-144,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this paper is to introduce a set of four test images
containing features and structures that can facilitate effective examination
and comparison of image processing algorithms. More specifically, the images
are designed to more explicitly expose the characteristic properties of
algorithms for image compression, virtual resolution adjustment, and
enhancement. This set was developed at the Naval Research Laboratory (NRL) in
the late 1990s as a more rigorous alternative to Lena and other images that
have come into common use for purely ad hoc reasons with little or no rigorous
consideration of their suitability. The increasing number of test images
appearing in the literature not only makes it more difficult to compare results
from different papers, it also introduces the potential for cherry-picking to
influence results. The key contribution of this paper is the proposal to
establish {\em some} canonical set to ensure that published results can be
analyzed and compared in a rigorous way from one paper to another, and
consideration of the four NRL images is proposed for this purpose.
","[{'version': 'v1', 'created': 'Mon, 30 Apr 2018 22:21:56 GMT'}]",2019-03-06,"[['Uhlmann', 'Jeffrey', '']]","['Test images', 'image compression', 'image superresolution', 'image enhancement', 'image processing', 'SVD']"
765,1607.00470,Georges Younes Mr.,"Georges Younes, Daniel Asmar, Elie Shammas, John Zelek","Keyframe-based monocular SLAM: design, survey, and future directions",,"Robotics and Autonomous Systems, Volume 98, 2017, Pages 67-88",10.1016/j.robot.2017.09.010,,cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Extensive research in the field of monocular SLAM for the past fifteen years
has yielded workable systems that found their way into various applications in
robotics and augmented reality. Although filter-based monocular SLAM systems
were common at some time, the more efficient keyframe-based solutions are
becoming the de facto methodology for building a monocular SLAM system. The
objective of this paper is threefold: first, the paper serves as a guideline
for people seeking to design their own monocular SLAM according to specific
environmental constraints. Second, it presents a survey that covers the various
keyframe-based monocular SLAM systems in the literature, detailing the
components of their implementation, and critically assessing the specific
strategies made in each proposed solution. Third, the paper provides insight
into the direction of future research in this field, to address the major
limitations still facing monocular SLAM; namely, in the issues of illumination
changes, initialization, highly dynamic motion, poorly textured scenes,
repetitive textures, map maintenance, and failure recovery.
","[{'version': 'v1', 'created': 'Sat, 2 Jul 2016 06:01:16 GMT'}, {'version': 'v2', 'created': 'Sun, 7 Jan 2018 20:47:25 GMT'}]",2018-01-09,"[['Younes', 'Georges', ''], ['Asmar', 'Daniel', ''], ['Shammas', 'Elie', ''], ['Zelek', 'John', '']]","['Visual SLAM', 'Monocular', 'Keyframe based']"
766,1701.02991,Zaid Hussain,"Zaid Hussain, Bader AlBdaiwi, Anton Cerny",Node-Independent Spanning Trees in Gaussian Networks,,"Journal of Parallel and Distributed Computing, Volume 109,
  November 2017, Pages 324-332",10.1016/j.jpdc.2017.06.018,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Message broadcasting in networks could be carried over spanning trees. A set
of spanning trees in the same network is node independent if two conditions are
satisfied. First, all trees are rooted at node $r$. Second, for every node $u$
in the network, all trees' paths from $r$ to $u$ are node-disjoint, excluding
the end nodes $r$ and $u$. Independent spanning trees have applications in
fault-tolerant communications and secure message distributions. Gaussian
networks and two-dimensional toroidal networks share similar topological
characteristics. They are regular of degree four, symmetric, and
node-transitive. Gaussian networks, however, have relatively lesser network
diameter that could result in a better performance. This promotes Gaussian
networks to be a potential alternative for two-dimensional toroidal networks.
In this paper, we present constructions for node independent spanning trees in
dense Gaussian networks. Based on these constructions, we design routing
algorithms that can be used in fault-tolerant routing and secure message
distribution. We also design fault-tolerant algorithms to construct these trees
in parallel.
","[{'version': 'v1', 'created': 'Wed, 11 Jan 2017 14:43:05 GMT'}]",2017-10-04,"[['Hussain', 'Zaid', ''], ['AlBdaiwi', 'Bader', ''], ['Cerny', 'Anton', '']]","['Circulant Graphs', 'Gaussian Networks', 'Spanning Trees', 'Independent Spanning Trees', 'Fault-Tolerant Routing']"
767,1711.01381,Sang-Il Oum,"Jisu Jeong, Eun Jung Kim, Sang-il Oum","Finding branch-decompositions of matroids, hypergraphs, and more","79 pages, 15 figures; Fix a few English issues. To appear in SIAM J.
  Discrete Math","SIAM J. Discrete Math., 35(4):2544-2617, November 2021",10.1137/19M1285895,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given $n$ subspaces of a finite-dimensional vector space over a fixed finite
field $\mathbb F$, we wish to find a ""branch-decomposition"" of these subspaces
of width at most $k$ that is a subcubic tree $T$ with $n$ leaves mapped
bijectively to the subspaces such that for every edge $e$ of $T$, the sum of
subspaces associated to the leaves in one component of $T-e$ and the sum of
subspaces associated to the leaves in the other component have the intersection
of dimension at most $k$. This problem includes the problems of computing
branch-width of $\mathbb F$-represented matroids, rank-width of graphs,
branch-width of hypergraphs, and carving-width of graphs.
  We present a fixed-parameter algorithm to construct such a
branch-decomposition of width at most $k$, if it exists, for input subspaces of
a finite-dimensional vector space over $\mathbb F$. Our algorithm is analogous
to the algorithm of Bodlaender and Kloks (1996) on tree-width of graphs. To
extend their framework to branch-decompositions of vector spaces, we developed
highly generic tools for branch-decompositions on vector spaces. The only known
previous fixed-parameter algorithm for branch-width of $\mathbb F$-represented
matroids was due to Hlin\v{e}n\'y and Oum (2008) that runs in time $O(n^3)$
where $n$ is the number of elements of the input $\mathbb F$-represented
matroid. But their method is highly indirect. Their algorithm uses the
nontrivial fact by Geelen et al. (2003) that the number of forbidden minors is
finite and uses the algorithm of Hlin\v{e}n\'y (2006) on checking monadic
second-order formulas on $\mathbb F$-represented matroids of small
branch-width. Our result does not depend on such a fact and is completely
self-contained, and yet matches their asymptotic running time for each fixed
$k$.
","[{'version': 'v1', 'created': 'Sat, 4 Nov 2017 01:43:57 GMT'}, {'version': 'v2', 'created': 'Mon, 5 Jul 2021 08:22:01 GMT'}, {'version': 'v3', 'created': 'Wed, 27 Oct 2021 08:22:15 GMT'}]",2022-10-05,"[['Jeong', 'Jisu', ''], ['Kim', 'Eun Jung', ''], ['Oum', 'Sang-il', '']]","['branch-width', 'rank-width', 'carving-width', 'matroid', 'fixed-parameter tractability']"
768,1712.10152,Sowmya V,"V. Sowmya, D. Govind, K. P. Soman","Exploring the significance of using perceptually relevant image
  decolorization method for scene classification","This article is accepted in SPIE J.of Electronic Imaging with title:
  Significance of perceptually relevant image decolorization for scene
  classification","Sowmya Viswanathan, Govind Divakaran, Kutti Padanyl Soman,
  Significance of perceptually relevant image decolorization for scene
  classification, J. Electron. Imaging 26(6), 063019 (2017)",10.1117/1.JEI.26.6.063019,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A color image contains luminance and chrominance components representing the
intensity and color information respectively. The objective of the work
presented in this paper is to show the significance of incorporating the
chrominance information for the task of scene classification. An improved
color-to-grayscale image conversion algorithm by effectively incorporating the
chrominance information is proposed using color-to-gay structure similarity
index (C2G-SSIM) and singular value decomposition (SVD) to improve the
perceptual quality of the converted grayscale images. The experimental result
analysis based on the image quality assessment for image decolorization called
C2G-SSIM and success rate (Cadik and COLOR250 datasets) shows that the proposed
image decolorization technique performs better than 8 existing benchmark
algorithms for image decolorization. In the second part of the paper, the
effectiveness of incorporating the chrominance component in scene
classification task is demonstrated using the deep belief network (DBN) based
image classification system developed using dense scale invariant feature
transform (SIFT) as features. The levels of chrominance information
incorporated by the proposed image decolorization technique is confirmed by the
improvement in the overall scene classification accuracy . Also, the overall
scene classification performance is improved by the combination of models
obtained using the proposed and the conventional decolorization methods.
","[{'version': 'v1', 'created': 'Fri, 29 Dec 2017 09:04:02 GMT'}]",2018-01-01,"[['Sowmya', 'V.', ''], ['Govind', 'D.', ''], ['Soman', 'K. P.', '']]","['image decolorization', 'color-to-grayscale', 'C2G-SSIM', 'scene classification', 'OT scene', 'SVD']"
769,1808.01150,Faizal Hafiz,"Faizal Hafiz, Akshya Swain, Nitish Patel, Chirag Naik","A Two-Dimensional (2-D) Learning Framework for Particle Swarm based
  Feature Selection",,"Elsevier - Pattern Recognition, Volume 76, 2018, Pages 416-433",10.1016/j.patcog.2017.11.027,,cs.NE cs.CV,http://creativecommons.org/licenses/by/4.0/,"  This paper proposes a new generalized two dimensional learning approach for
particle swarm based feature selection. The core idea of the proposed approach
is to include the information about the subset cardinality into the learning
framework by extending the dimension of the velocity. The 2D-learning framework
retains all the key features of the original PSO, despite the extra learning
dimension. Most of the popular variants of PSO can easily be adapted into this
2D learning framework for feature selection problems. The efficacy of the
proposed learning approach has been evaluated considering several benchmark
data and two induction algorithms: Naive-Bayes and k-Nearest Neighbor. The
results of the comparative investigation including the time-complexity analysis
with GA, ACO and five other PSO variants illustrate that the proposed 2D
learning approach gives feature subset with relatively smaller cardinality and
better classification performance with shorter run times.
","[{'version': 'v1', 'created': 'Fri, 3 Aug 2018 10:50:43 GMT'}]",2018-08-06,"[['Hafiz', 'Faizal', ''], ['Swain', 'Akshya', ''], ['Patel', 'Nitish', ''], ['Naik', 'Chirag', '']]","['Classification', 'Dimensionality Reduction', 'Feature Selection', 'Particle Swarm Optimization', 'Machine Learning']"
770,1304.5101,Pablo Dorta-Gonzalez,Pablo Dorta-Gonzalez and Maria Isabel Dorta-Gonzalez,"Impact maturity times and citation time windows: The 2-year maximum
  journal impact factor","24 pages, 5 tables and 3 figures. arXiv admin note: text overlap with
  arXiv:1007.4749, arXiv:1208.6122 by other authors",,10.1016/j.joi.2013.03.005,,cs.DL physics.soc-ph stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Journal metrics are employed for the assessment of scientific scholar
journals from a general bibliometric perspective. In this context, the Thomson
Reuters journal impact factors (JIF) are the citation-based indicators most
used. The 2-year journal impact factor (2-JIF) counts citations to one and two
year old articles, while the 5-year journal impact factor (5-JIF) counts
citations from one to five year old articles. Nevertheless, these indicators
are not comparable among fields of science for two reasons: (i) each field has
a different impact maturity time, and (ii) because of systematic differences in
publication and citation behaviour across disciplines. In fact, the 5-JIF
firstly appeared in the Journal Citation Reports (JCR) in 2007 with the purpose
of making more comparable impacts in fields in which impact matures slowly.
However, there is not an optimal fixed impact maturity time valid for all the
fields. In some of them two years provides a good performance whereas in others
three or more years are necessary. Therefore, there is a problem when comparing
a journal from a field in which impact matures slowly with a journal from a
field in which impact matures rapidly. In this work, we propose the 2-year
maximum journal impact factor (2M-JIF), a new impact indicator that considers
the 2-year rolling citation time window of maximum impact instead of the
previous 2-year time window. Finally, an empirical application comparing 2-JIF,
5-JIF, and 2M-JIF shows that the maximum rolling target window reduces the
between-group variance with respect to the within-group variance in a random
sample of about six hundred journals from eight different fields.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2013 12:21:08 GMT'}]",2013-04-19,"[['Dorta-Gonzalez', 'Pablo', ''], ['Dorta-Gonzalez', 'Maria Isabel', '']]","['Journal assessment', 'Journal metrics', 'Bibliometric indicator', 'Citation analysis', 'Journal']"
771,1205.3576,Alexandre Bartel,"Alexandre Bartel (SnT), Jacques Klein (SnT), Martin Monperrus (INRIA
  Lille - Nord Europe), Yves Le Traon (SnT)","Dexpler: Converting Android Dalvik Bytecode to Jimple for Static
  Analysis with Soot","ACM SIGPLAN International Workshop on the State Of the Art in Java
  Program Analysis(SOAP 2012), Beijing : China (2012)","ACM SIGPLAN International Workshop on State Of the Art in Java
  Program Analysis, 2012",10.1145/2259051.2259056,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces Dexpler, a software package which converts Dalvik
bytecode to Jimple. Dexpler is built on top of Dedexer and Soot. As Jimple is
Soot's main internal rep- resentation of code, the Dalvik bytecode can be
manipu- lated with any Jimple based tool, for instance for performing point-to
or flow analysis.
","[{'version': 'v1', 'created': 'Wed, 16 May 2012 06:55:00 GMT'}, {'version': 'v2', 'created': 'Thu, 31 Jan 2013 07:53:47 GMT'}]",2019-07-24,"[['Bartel', 'Alexandre', '', 'SnT'], ['Klein', 'Jacques', '', 'SnT'], ['Monperrus', 'Martin', '', 'INRIA\n  Lille - Nord Europe'], ['Traon', 'Yves Le', '', 'SnT']]","['Dalvik Bytecode', 'Android', 'Soot', 'Jimple', 'StaticAnalysis']"
772,1406.1033,Smita Saini,Smita Saini and Deep Mann,Identity Management issues in Cloud Computing,"3 pages.""Published with International Journal of Computer Trends and
  Technology (IJCTT)""","IJCTT V9(8):414-416, March 2014",10.14445/22312803/IJCTT-V9P174,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing is providing a low cost on demand services to the users,
omnipresent network,large storage capacity due to these features of cloud
computing web applications are moving towards the cloud and due to this
migration of the web application,cloud computing platform is raised many issues
like privacy, security etc. Privacy issue are major concern for the cloud
computing. Privacy is to preserve the sensitive information of the cloud
consumer and the major issues to the privacy are unauthorized secondary usage,
lack of user control, unclear responsibility. For dealing with these privacy
issues Identity management method are used. This paper discusses the privacy
issue and different kind of identity management technique that are used for
preserving the privacy.
","[{'version': 'v1', 'created': 'Tue, 3 Jun 2014 12:08:44 GMT'}]",2014-06-05,"[['Saini', 'Smita', ''], ['Mann', 'Deep', '']]","['cloud computing Privacy issues', 'Identity management technique-OpenID', 'Prime', 'Microsoft Cardspace']"
773,1803.01618,Johannes Hofmann,Johannes Hofmann and Georg Hager and Dietmar Fey,"On the accuracy and usefulness of analytic energy models for
  contemporary multicore processors",,,10.1007/978-3-319-92040-5_2,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents refinements to the execution-cache-memory performance
model and a previously published power model for multicore processors. The
combination of both enables a very accurate prediction of performance and
energy consumption of contemporary multicore processors as a function of
relevant parameters such as number of active cores as well as core and Uncore
frequencies. Model validation is performed on the Sandy Bridge-EP and
Broadwell-EP microarchitectures. Production-related variations in chip quality
are demonstrated through a statistical analysis of the fit parameters obtained
on one hundred Broadwell-EP CPUs of the same model. Insights from the models
are used to explain the performance- and energy-related behavior of the
processors for scalable as well as saturating (i.e., memory-bound) codes. In
the process we demonstrate the models' capability to identify optimal operating
points with respect to highest performance, lowest energy-to-solution, and
lowest energy-delay product and identify a set of best practices for
energy-efficient execution.
","[{'version': 'v1', 'created': 'Mon, 5 Mar 2018 11:53:24 GMT'}]",2018-07-09,"[['Hofmann', 'Johannes', ''], ['Hager', 'Georg', ''], ['Fey', 'Dietmar', '']]","['Performance modeling', 'power modeling', 'energy modeling']"
774,2201.00115,Thanh Le-Cong Le-Cong Thanh,"Thanh-Dat Nguyen, Thanh Le-Cong, ThanhVu H. Nguyen, Xuan-Bach D. Le,
  Quyet-Thang Huynh",Toward the Analysis of Graph Neural Networks,"Accepted to ICSE 2022, NIER track","The 44th IEEE/ACM International Conference on Software Engineering
  (ICSE 2022)",,,cs.SE cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Graph Neural Networks (GNNs) have recently emerged as a robust framework for
graph-structured data. They have been applied to many problems such as
knowledge graph analysis, social networks recommendation, and even Covid19
detection and vaccine developments. However, unlike other deep neural networks
such as Feed Forward Neural Networks (FFNNs), few analyses such as verification
and property inferences exist, potentially due to dynamic behaviors of GNNs,
which can take arbitrary graphs as input, whereas FFNNs which only take fixed
size numerical vectors as inputs.
  This paper proposes an approach to analyze GNNs by converting them into FFNNs
and reusing existing FFNNs analyses. We discuss various designs to ensure the
scalability and accuracy of the conversions. We illustrate our method on a
study case of node classification. We believe that our approach opens new
research directions for understanding and analyzing GNNs.
","[{'version': 'v1', 'created': 'Sat, 1 Jan 2022 04:59:49 GMT'}]",2022-01-04,"[['Nguyen', 'Thanh-Dat', ''], ['Le-Cong', 'Thanh', ''], ['Nguyen', 'ThanhVu H.', ''], ['Le', 'Xuan-Bach D.', ''], ['Huynh', 'Quyet-Thang', '']]","['Property Inference', 'Formal Explanations', 'Graph Neural Networks']"
775,1801.01807,Fabricio de Franca Olivetti,Fabricio Olivetti de Franca,A Greedy Search Tree Heuristic for Symbolic Regression,"30 pages, 7 figures, 3 tables, submitted to Information Science on
  12/2016",,10.1016/j.ins.2018.02.040,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Symbolic Regression tries to find a mathematical expression that describes
the relationship of a set of explanatory variables to a measured variable. The
main objective is to find a model that minimizes the error and, optionally,
that also minimizes the expression size. A smaller expression can be seen as an
interpretable model considered a reliable decision model. This is often
performed with Genetic Programming which represents their solution as
expression trees. The shortcoming of this algorithm lies on this representation
that defines a rugged search space and contains expressions of any size and
difficulty. These pose as a challenge to find the optimal solution under
computational constraints. This paper introduces a new data structure, called
Interaction-Transformation (IT), that constrains the search space in order to
exclude a region of larger and more complicated expressions. In order to test
this data structure, it was also introduced an heuristic called SymTree. The
obtained results show evidence that SymTree are capable of obtaining the
optimal solution whenever the target function is within the search space of the
IT data structure and competitive results when it is not. Overall, the
algorithm found a good compromise between accuracy and simplicity for all the
generated models.
","[{'version': 'v1', 'created': 'Thu, 4 Jan 2018 18:30:38 GMT'}]",2018-02-27,"[['de Franca', 'Fabricio Olivetti', '']]","['Symbolic Regression', 'Regression Analysis', 'Greedy Heuristic']"
776,1711.06073,Joaquin Garcia-Alfaro,"Gustavo Gonzalez-Granadillo, Joaquin Garcia-Alfaro, Herv\'e Debar","An n-sided polygonal model to calculate the impact of cyber security
  events","16 pages, 5 figures, 2 tables, 11th International Conference on Risks
  and Security of Internet and Systems, (CRiSIS 2016), Roscoff, France,
  September 2016",,10.1007/978-3-319-54876-0_7,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a model to represent graphically the impact of cyber
events (e.g., attacks, countermeasures) in a polygonal systems of n-sides. The
approach considers information about all entities composing an information
system (e.g., users, IP addresses, communication protocols, physical and
logical resources, etc.). Every axis is composed of entities that contribute to
the execution of the security event. Each entity has an associated weighting
factor that measures its contribution using a multi-criteria methodology named
CARVER. The graphical representation of cyber events is depicted as straight
lines (one dimension) or polygons (two or more dimensions). Geometrical
operations are used to compute the size (i.e, length, perimeter, surface area)
and thus the impact of each event. As a result, it is possible to identify and
compare the magnitude of cyber events. A case study with multiple security
events is presented as an illustration on how the model is built and computed.
","[{'version': 'v1', 'created': 'Thu, 16 Nov 2017 13:10:47 GMT'}]",2017-11-17,"[['Gonzalez-Granadillo', 'Gustavo', ''], ['Garcia-Alfaro', 'Joaquin', ''], ['Debar', 'Hervé', '']]","['Polygonal Model', 'Multiple Cyber Events', 'Impact Representation', 'CARVER', 'Response Actions']"
777,2111.12899,Yang Zhang,Yang Zhang and Qiang Ma,"Recommending Multiple Positive Citations for Manuscript via
  Content-Dependent Modeling and Multi-Positive Triplet",,"The 20th IEEE/WIC/ACM International Conference on Web Intelligence
  and Intelligent Agent Technology 2021",10.1587/transinf.2022EDP7034,,cs.IR cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Considering the rapidly increasing number of academic papers, searching for
and citing appropriate references has become a non-trial task during the wiring
of papers. Recommending a handful of candidate papers to a manuscript before
publication could ease the burden of the authors, and help the reviewers to
check the completeness of the cited resources. Conventional approaches on
citation recommendation generally consider recommending one ground-truth
citation for a query context from an input manuscript, but lack of
consideration on co-citation recommendations. However, a piece of context often
needs to be supported by two or more co-citation pairs. Here, we propose a
novel scientific paper modeling for citation recommendations, namely
Multi-Positive BERT Model for Citation Recommendation (MP-BERT4CR), complied
with a series of Multi-Positive Triplet objectives to recommend multiple
positive citations for a query context. The proposed approach has the following
advantages: First, the proposed multi-positive objectives are effective to
recommend multiple positive candidates. Second, we adopt noise distributions
which are built based on the historical co-citation frequencies, so that
MP-BERT4CR is not only effective on recommending high-frequent co-citation
pairs; but also the performances on retrieving the low-frequent ones are
significantly improved. Third, we propose a dynamic context sampling strategy
which captures the ``macro-scoped'' citing intents from a manuscript and
empowers the citation embeddings to be content-dependent, which allow the
algorithm to further improve the performances. Single and multiple positive
recommendation experiments testified that MP-BERT4CR delivered significant
improvements. In addition, MP-BERT4CR are also effective in retrieving the full
list of co-citations, and historically low-frequent co-citation pairs compared
with the prior works.
","[{'version': 'v1', 'created': 'Thu, 25 Nov 2021 04:09:31 GMT'}]",2022-11-23,"[['Zhang', 'Yang', ''], ['Ma', 'Qiang', '']]","['Citation Recommendation', 'Text Recommendation', 'Document Embedding']"
778,1304.3357,Vaishali Khairnar mrs,"Vaishali D. Khairnar, Ketan Kotecha","Performance of Vehicle-to-Vehicle Communication using IEEE 802.11p in
  Vehicular Ad-hoc Network Environment","28 pages, 18 figures, International Journal of Network Security & Its
  Applications, International Journal of Network Security & Its Applications
  (IJNSA), Vol.5, No.2, March 2013",,10.5121/ijnsa.2013.5212,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traffic safety applications using vehicle-to-vehicle (V2V) communication is
an emerging and promising area within the ITS environment. Many of these
applications require real-time communication with high reliability. To meet a
real-time deadline, timely and predictable access to the channel is paramount.
The medium access method used in 802.11p, CSMA with collision avoidance, does
not guarantee channel access before a finite deadline. The well-known property
of CSMA is undesirable for critical communications scenarios. The simulation
results reveal that a specific vehicle is forced to drop over 80% of its
packets because no channel access was possible before the next message was
generated. To overcome this problem, we propose to use STDMA for real-time data
traffic between vehicles. The real- time properties of STDMA are investigated
by means of the highway road simulation scenario, with promising results.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2013 16:20:49 GMT'}]",2013-04-12,"[['Khairnar', 'Vaishali D.', ''], ['Kotecha', 'Ketan', '']]","['CSMA', 'STDMA', 'V2V', 'VANET etc']"
779,1309.6297,Esra Erdem,"Esra Erdem, Umut Oztok",Generating Explanations for Biomedical Queries,"42 pages, 14 figures, 4 tables, online appendix (proofs, 24 pages)",Theory and Practice of Logic Programming 15 (2015) 35-78,10.1017/S1471068413000598,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce novel mathematical models and algorithms to generate (shortest
or k different) explanations for biomedical queries, using answer set
programming. We implement these algorithms and integrate them in BIOQUERY-ASP.
We illustrate the usefulness of these methods with some complex biomedical
queries related to drug discovery, over the biomedical knowledge resources
PHARMGKB, DRUGBANK, BIOGRID, CTD, SIDER, DISEASE ONTOLOGY and ORPHADATA. To
appear in Theory and Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Tue, 24 Sep 2013 19:28:44 GMT'}]",2020-02-19,"[['Erdem', 'Esra', ''], ['Oztok', 'Umut', '']]","['answer set programming', 'explanation generation', 'query answering', 'biomedical queries']"
780,1409.6585,Bernhard Rumpe,"Maria Victoria Cengarle, Hans Gr\""onninger, Bernhard Rumpe",Variability within Modeling Language Definitions,"15 pages, 14 figures, 1 table","Model Driven Engineering Languages and Systems. Proceedings of
  MODELS 2009, LNCS 5795. Denver, Colorado, USA, October 2009",10.1007/978-3-642-04425-0_54,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a taxonomy of the variability mechanisms offered by modeling
languages. The definition of a formal language encompasses a syntax and a
semantic domain as well as the mapping that relates them, thus language
variabilities are classified according to which of those three pillars they
address. This work furthermore proposes a framework to explicitly document and
manage the variation points and their corresponding variants of a variable
modeling language. The framework enables the systematic study of various kinds
of variabilities and their interdependencies. Moreover, it allows a methodical
customization of a language, for example, to a given application domain. The
taxonomy of variability is explicitly of interest for the UML to provide a more
precise understanding of its variation points.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 11:59:03 GMT'}]",2014-09-24,"[['Cengarle', 'Maria Victoria', ''], ['Grönninger', 'Hans', ''], ['Rumpe', 'Bernhard', '']]","['Modeling languages', 'variability', 'formal semantics', 'UML']"
781,1204.1797,Arindam Sarkar,"Arindam Sarkar, S. Karforma, J. K. Mandal","Object Oriented Modelling of Idea using GA based efficient key
  generation for e-governance security (OOMIG)","13 Pages, 4 Figures","International Journal of Distributed and Parallel Systems (IJDPS)
  Vol.3, No.2, March 2012, PAGE NO: 171-183",10.5121/ijdps.2012.3215,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays different state and central government in India as well as abroad
are taking initiative to deliver different kind of services electronically
specially using Information and Communication Technology (ICT). Intruders or
hackers can steal or modify the information communicated between Government and
consumer through internet. To implement privacy and confidentiality of the
information we must use suitable encryption technique. In this paper an Object
Oriented Modelling of International Data Encryption Algorithm (IDEA) using GA
based efficient key generation technique has been proposed to incorporate
privacy and confidentiality of information which would be communicated between
government and consumer.
","[{'version': 'v1', 'created': 'Mon, 9 Apr 2012 05:35:14 GMT'}]",2012-04-10,"[['Sarkar', 'Arindam', ''], ['Karforma', 'S.', ''], ['Mandal', 'J. K.', '']]","['E-Governance', 'e-participation', 'corruption perception index', 'Communication and Technology (ICT)', 'National e-Governance Plan (NeGP)']"
782,1311.4166,Xinyang Deng,"Shiyu Chen, Yong Hu, Sankaran Mahadevan, Yong Deng",A Visibility Graph Averaging Aggregation Operator,"33 pages, 9 figures",,10.1016/j.physa.2014.02.015,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of aggregation is considerable importance in many disciplines. In
this paper, a new type of operator called visibility graph averaging (VGA)
aggregation operator is proposed. This proposed operator is based on the
visibility graph which can convert a time series into a graph. The weights are
obtained according to the importance of the data in the visibility graph.
Finally, the VGA operator is used in the analysis of the TAIEX database to
illustrate that it is practical and compared with the classic aggregation
operators, it shows its advantage that it not only implements the aggregation
of the data purely, but also conserves the time information, and meanwhile, the
determination of the weights is more reasonable.
","[{'version': 'v1', 'created': 'Sun, 17 Nov 2013 15:01:31 GMT'}]",2015-06-17,"[['Chen', 'Shiyu', ''], ['Hu', 'Yong', ''], ['Mahadevan', 'Sankaran', ''], ['Deng', 'Yong', '']]","['The visibility graph', 'Aggregation operator', 'The ordered']"
783,1001.0889,Arnaud Labourel,"Jurek Czyzowicz, David Ilcinkas (LaBRI, INRIA Bordeaux - Sud-Ouest),
  Arnaud Labourel (LaBRI), Andrzej Pelc",Asynchronous deterministic rendezvous in bounded terrains,,,10.1007/978-3-642-13284-1_7,,cs.CG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two mobile agents (robots) have to meet in an a priori unknown bounded
terrain modeled as a polygon, possibly with polygonal obstacles. Agents are
modeled as points, and each of them is equipped with a compass. Compasses of
agents may be incoherent. Agents construct their routes, but the actual walk of
each agent is decided by the adversary: the movement of the agent can be at
arbitrary speed, the agent may sometimes stop or go back and forth, as long as
the walk of the agent in each segment of its route is continuous, does not
leave it and covers all of it. We consider several scenarios, depending on
three factors: (1) obstacles in the terrain are present, or not, (2) compasses
of both agents agree, or not, (3) agents have or do not have a map of the
terrain with their positions marked. The cost of a rendezvous algorithm is the
worst-case sum of lengths of the agents' trajectories until their meeting. For
each scenario we design a deterministic rendezvous algorithm and analyze its
cost. We also prove lower bounds on the cost of any deterministic rendezvous
algorithm in each case. For all scenarios these bounds are tight.
","[{'version': 'v1', 'created': 'Wed, 6 Jan 2010 13:25:55 GMT'}]",2015-05-14,"[['Czyzowicz', 'Jurek', '', 'LaBRI, INRIA Bordeaux - Sud-Ouest'], ['Ilcinkas', 'David', '', 'LaBRI, INRIA Bordeaux - Sud-Ouest'], ['Labourel', 'Arnaud', '', 'LaBRI'], ['Pelc', 'Andrzej', '']]","['mobile agent', 'rendezvous', 'deterministic', 'polygon', 'obstacle']"
784,1001.1187,Hooman Shirani-Mehr,"Hooman Shirani-Mehr, Haralabos C. Papadopoulos, Sean A. Ramprashad and
  Giuseppe Caire","Joint Scheduling and ARQ for MU-MIMO Downlink in the Presence of
  Inter-Cell Interference","Submitted to IEEE Transactions on Communications, v2: small
  corrections",,10.1109/TCOMM.2010.112310.100013,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  User scheduling and multiuser multi-antenna (MU-MIMO) transmission are at the
core of high rate data-oriented downlink schemes of the next-generation of
cellular systems (e.g., LTE-Advanced). Scheduling selects groups of users
according to their channels vector directions and SINR levels. However, when
scheduling is applied independently in each cell, the inter-cell interference
(ICI) power at each user receiver is not known in advance since it changes at
each new scheduling slot depending on the scheduling decisions of all
interfering base stations. In order to cope with this uncertainty, we consider
the joint operation of scheduling, MU-MIMO beamforming and Automatic Repeat
reQuest (ARQ). We develop a game-theoretic framework for this problem and build
on stochastic optimization techniques in order to find optimal scheduling and
ARQ schemes. Particularizing our framework to the case of ""outage service
rates"", we obtain a scheme based on adaptive variable-rate coding at the
physical layer, combined with ARQ at the Logical Link Control (ARQ-LLC). Then,
we present a novel scheme based on incremental redundancy Hybrid ARQ (HARQ)
that is able to achieve a throughput performance arbitrarily close to the
""genie-aided service rates"", with no need for a genie that provides
non-causally the ICI power levels. The novel HARQ scheme is both easier to
implement and superior in performance with respect to the conventional
combination of adaptive variable-rate coding and ARQ-LLC.
","[{'version': 'v1', 'created': 'Fri, 8 Jan 2010 02:23:18 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Jan 2010 07:08:59 GMT'}]",2016-11-17,"[['Shirani-Mehr', 'Hooman', ''], ['Papadopoulos', 'Haralabos C.', ''], ['Ramprashad', 'Sean A.', ''], ['Caire', 'Giuseppe', '']]","['Multiuser MIMO', 'inter-cell interference', 'scheduling', 'hybrid ARQ', 'stochastic op']"
785,2102.09460,Daheng Wang,"Daheng Wang, Prashant Shiralkar, Colin Lockard, Binxuan Huang, Xin
  Luna Dong, Meng Jiang",TCN: Table Convolutional Network for Web Table Interpretation,,,10.1145/3442381.3450090,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information extraction from semi-structured webpages provides valuable
long-tailed facts for augmenting knowledge graph. Relational Web tables are a
critical component containing additional entities and attributes of rich and
diverse knowledge. However, extracting knowledge from relational tables is
challenging because of sparse contextual information. Existing work linearize
table cells and heavily rely on modifying deep language models such as BERT
which only captures related cells information in the same table. In this work,
we propose a novel relational table representation learning approach
considering both the intra- and inter-table contextual information. On one
hand, the proposed Table Convolutional Network model employs the attention
mechanism to adaptively focus on the most informative intra-table cells of the
same row or column; and, on the other hand, it aggregates inter-table
contextual information from various types of implicit connections between cells
across different tables. Specifically, we propose three novel aggregation
modules for (i) cells of the same value, (ii) cells of the same schema
position, and (iii) cells linked to the same page topic. We further devise a
supervised multi-task training objective for jointly predicting column type and
pairwise column relation, as well as a table cell recovery objective for
pre-training. Experiments on real Web table datasets demonstrate our method can
outperform competitive baselines by +4.8% of F1 for column type prediction and
by +4.1% of F1 for pairwise column relation prediction.
","[{'version': 'v1', 'created': 'Wed, 17 Feb 2021 02:18:10 GMT'}]",2021-02-19,"[['Wang', 'Daheng', ''], ['Shiralkar', 'Prashant', ''], ['Lockard', 'Colin', ''], ['Huang', 'Binxuan', ''], ['Dong', 'Xin Luna', ''], ['Jiang', 'Meng', '']]","['Web table', 'information extraction', 'knowledge extraction']"
786,1801.00432,Vaclav Skala,"Michal Smolik, Vaclav Skala and Ondrej Nedved",A Comparative Study of LOWESS and RBF Approximations for Visualization,,,10.1007/978-3-319-42108-7_31,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Approximation methods are widely used in many fields and many techniques have
been published already. This comparative study presents a comparison of LOWESS
(Locally weighted scatterplot smoothing) and RBF (Radial Basis Functions)
approximation methods on noisy data as they use different approaches. The RBF
approach is generally convenient for high dimensional scattered data sets. The
LOWESS method needs finding a subset of nearest points if data are scattered.
The experiments proved that LOWESS approximation gives slightly better results
than RBF in the case of lower dimension, while in the higher dimensional case
","[{'version': 'v1', 'created': 'Mon, 1 Jan 2018 11:51:37 GMT'}]",2018-01-03,"[['Smolik', 'Michal', ''], ['Skala', 'Vaclav', ''], ['Nedved', 'Ondrej', '']]","['Radial Basis Functions', 'LOWESS', 'Approximation']"
787,1807.04966,Ricardo Antunes,Ricardo Antunes and Mani Poshdar,"Envision of an integrated information system for project-driven
  production in construction","Lean construction, SCADA, machine learning, LiDAR, BIM. 10 pages, 1
  figure, conference","Proc. 26th Annual Conference of the International. Group for Lean
  Construction (IGLC) 2018",10.24928/2018/0511,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Construction frequently appears at the bottom of productivity charts with
decreasing indexes of productivity over the years. Lack of innovation and
delayed adoption, informal processes or insufficient rigor and consistency in
process execution, insufficient knowledge transfer from project to project,
weak project monitoring, little cross- functional cooperation, little
collaboration with suppliers, conservative company culture, and a shortage of
young talent and people development are usual issues. Whereas work has been
carried out on information technology and automation in construction their
application is isolated without an interconnected information flow. This paper
suggests a framework to address production issues on construction by
implementing an integrated automatic supervisory control and data acquisition
for management and operations. The system is divided into planning, monitoring,
controlling, and executing groups clustering technologies to track both the
project product and production. This research stands on the four pillars of
manufacturing knowledge and lean production (production processes, production
management, equipment/tool design, and automated systems and control). The
framework offers benefits such as increased information flow, detection and
prevention of overburdening equipment or labor (Muri) and production unevenness
(Mura), reduction of waste (Muda), evidential and continuous process
standardization and improvement, reuse and abstraction of project information
across endeavors.
","[{'version': 'v1', 'created': 'Fri, 13 Jul 2018 08:19:29 GMT'}]",2018-07-16,"[['Antunes', 'Ricardo', ''], ['Poshdar', 'Mani', '']]","['Lean construction', 'SCADA', 'machine learning', 'LiDAR', 'BIM']"
788,1803.02331,Harsh Taneja,Harsh Taneja and Angela Xiao Wu,"Pathways to Fragmentation:User Flows and Web Distribution
  Infrastructures",,,10.1145/3201064.3201107,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study analyzes how web audiences flow across online digital features. We
construct a directed network of user flows based on sequential user
clickstreams for all popular websites (n=1761), using traffic data obtained
from a panel of a million web users in the United States. We analyze these data
to identify constellations of websites that are frequently browsed together in
temporal sequences, both by similar user groups in different browsing sessions
as well as by disparate users. Our analyses thus render visible previously
hidden online collectives and generate insight into the varied roles that
curatorial infrastructures may play in shaping audience fragmentation on the
web.
","[{'version': 'v1', 'created': 'Tue, 6 Mar 2018 18:44:40 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Apr 2018 18:50:17 GMT'}]",2018-04-13,"[['Taneja', 'Harsh', ''], ['Wu', 'Angela Xiao', '']]","['Clickstream', 'fragmentation', 'network analysis', 'infrastructure', 'curation', 'web usage']"
789,1509.02458,Yeounoh Chung,"Yeounoh Chung, Chang-yong Park, Noo-ri Kim, Hana Cho, Taebok Yoon,
  Hunjoo Lee and Jee-Hyong Lee","A Behavior Analysis-Based Game Bot Detection Approach Considering
  Various Play Styles",,ETRI Journal 35.6 (2013): 1058-1067,10.4218/etrij.13.2013.0049,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An approach for game bot detection in MMORPGs is proposed based on the
analysis of game playing behavior. Since MMORPGs are large scale games, users
can play in various ways. This variety in playing behavior makes it hard to
detect game bots based on play behaviors. In order to cope with this problem,
the proposed approach observes game playing behaviors of users and groups them
by their behavioral similarities. Then, it develops a local bot detection model
for each player group. Since the locally optimized models can more accurately
detect game bots within each player group, the combination of those models
brings about overall improvement. For a practical purpose of reducing the
workloads of the game servers in service, the game data is collected at a low
resolution in time. Behavioral features are selected and developed to
accurately detect game bots with the low resolution data, considering common
aspects of MMORPG playing. Through the experiment with the real data from a
game currently in service, it is shown that the proposed local model approach
yields more accurate results.
","[{'version': 'v1', 'created': 'Tue, 8 Sep 2015 17:36:31 GMT'}]",2015-09-09,"[['Chung', 'Yeounoh', ''], ['Park', 'Chang-yong', ''], ['Kim', 'Noo-ri', ''], ['Cho', 'Hana', ''], ['Yoon', 'Taebok', ''], ['Lee', 'Hunjoo', ''], ['Lee', 'Jee-Hyong', '']]","['User behavior analysis', 'Machine learning', 'Bot detection model', 'MMORPGs', 'Game play styles']"
790,1706.03184,Warut Suksompong,"Charles E. Leiserson, Tao B. Schardl, Warut Suksompong",Upper Bounds on Number of Steals in Rooted Trees,"18 pages, 5 figures","Theory of Computing Systems, 58(2):223-240 (2016)",10.1007/s00224-015-9613-9,,cs.DC cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Inspired by applications in parallel computing, we analyze the setting of
work stealing in multithreaded computations. We obtain tight upper bounds on
the number of steals when the computation can be modeled by rooted trees. In
particular, we show that if the computation with $n$ processors starts with one
processor having a complete $k$-ary tree of height $h$ (and the remaining $n-1$
processors having nothing), the maximum possible number of steals is
$\sum_{i=1}^n(k-1)^i\binom{h}{i}$.
","[{'version': 'v1', 'created': 'Sat, 10 Jun 2017 05:38:20 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Jun 2017 16:28:29 GMT'}]",2018-04-19,"[['Leiserson', 'Charles E.', ''], ['Schardl', 'Tao B.', ''], ['Suksompong', 'Warut', '']]","['work stealing', 'parallel algorithm', 'extremal combinatorics', 'binomial coefficient']"
791,1305.6451,Iheb Ben Amor,"Iheb Ben Amor (LIPADE), Athman Bougetteya (CSIT), Mourad Ouziri
  (LIPADE), Salima Benbernou (LIPADE), Mohamed Nadif (LIPADE)",Data Leak Aware Crowdsourcing in Social Network,,Springer 7652 (2012) pp 226-236,10.1007/978-3-642-38333-5_23,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Harnessing human computation for solving complex problems call spawns the
issue of finding the unknown competitive group of solvers. In this paper, we
propose an approach called Friendlysourcing to build up teams from social
network answering a business call, all the while avoiding partial solution
disclosure to competitive groups. The contributions of this paper include (i) a
clustering based approach for discovering collaborative and competitive team in
social network (ii) a Markov-chain based algorithm for discovering implicit
interactions in the social network.
","[{'version': 'v1', 'created': 'Tue, 28 May 2013 11:25:39 GMT'}]",2013-05-30,"[['Amor', 'Iheb Ben', '', 'LIPADE'], ['Bougetteya', 'Athman', '', 'CSIT'], ['Ouziri', 'Mourad', '', 'LIPADE'], ['Benbernou', 'Salima', '', 'LIPADE'], ['Nadif', 'Mohamed', '', 'LIPADE']]","['Social network', 'outsourcing human-computation', 'privacy']"
792,1707.02546,Angelos Valsamis,"Fotis Aisopos, Angelos Valsamis, Alexandros Psychas, Andreas
  Menychtas, Theodora Varvarigou","Efficient Context Management and Personalized User Recommendations in a
  Smart Social TV environment","In GECON2016, 13th International Conference on Economics of Grids,
  Clouds, Systems, and Services, September 20-22, 2016, Harokopio University,
  Athens, Greece",,10.1007/978-3-319-61920-0_8,,cs.IR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the emergence of Smart TV and related interconnected devices, second
screen solutions have rapidly appeared to provide more content for end-users
and enrich their TV experience. Given the various data and sources involved -
videos, actors, social media and online databases- the aforementioned market
poses great challenges concerning user context management and sophisticated
recommendations that can be addressed to the end-users. This paper presents an
innovative Context Management model and a related first and second screen
recommendation service, based on a user-item graph analysis as well as
collaborative filtering techniques in the context of a Dynamic Social & Media
Content Syndication (SAM) platform. The model evaluation provided is based on
datasets collected online, presenting a comparative analysis concerning
efficiency and effectiveness of the current approach, and illustrating its
added value.
","[{'version': 'v1', 'created': 'Sun, 9 Jul 2017 09:19:21 GMT'}]",2017-07-11,"[['Aisopos', 'Fotis', ''], ['Valsamis', 'Angelos', ''], ['Psychas', 'Alexandros', ''], ['Menychtas', 'Andreas', ''], ['Varvarigou', 'Theodora', '']]","['Smart TV Recommendations', 'Social Media', 'Second Screen', 'Context Management', 'Graph analysis']"
793,1406.3065,Stasys Jukna,Stasys Jukna,Lower Bounds for Tropical Circuits and Dynamic Programs,"Corrected reduction to arithmetic circuits (holds only for
  multilinear polynomials, now Sect. 4). Solved Open Problem 3 about Min/Max
  gaps (now Lemma 10). Added lower bounds for the depth of tropical circuits
  (Sect. 15)",Theory of Computing Systems 57:1 (2015) 160-194,10.1007/s00224-014-9574-4,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tropical circuits are circuits with Min and Plus, or Max and Plus operations
as gates. Their importance stems from their intimate relation to dynamic
programming algorithms. The power of tropical circuits lies somewhere between
that of monotone boolean circuits and monotone arithmetic circuits. In this
paper we present some lower bounds arguments for tropical circuits, and hence,
for dynamic programs.
","[{'version': 'v1', 'created': 'Wed, 11 Jun 2014 20:58:10 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Jul 2014 11:47:33 GMT'}]",2018-05-30,"[['Jukna', 'Stasys', '']]","['Tropical circuits', 'dynamic programming', 'monotone arithmetic circuits', 'lowerbounds']"
794,0904.4006,Rajesh Ramachandran,"R. Rajesh, Vinod Sharma and V. K. Varshenya","Joint Source-Channel Coding on a Multiple Access Channel with Side
  Information","29 pages, 3 figures. Submitted to IEEE Trans. Information theory",,10.1109/ISIT.2008.4595484,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of transmission of several distributed correlated
sources over a multiple access channel (MAC) with side information at the
sources and the decoder. Source-channel separation does not hold for this
channel. Sufficient conditions are provided for transmission of sources with a
given distortion. The source and/or the channel could have continuous alphabets
(thus Gaussian sources and Gaussian MACs are special cases). Various previous
results are obtained as special cases. We also provide several good joint
source-channel coding schemes for discrete sources and discrete/continuous
alphabet channel.
","[{'version': 'v1', 'created': 'Sun, 26 Apr 2009 04:43:59 GMT'}]",2016-11-15,"[['Rajesh', 'R.', ''], ['Sharma', 'Vinod', ''], ['Varshenya', 'V. K.', '']]","['Multiple access channel', 'side information', 'lossy joint source-channel coding', 'jointly Gaussian']"
795,1301.4753,Nikzad Babaii-Rizvandi,"Nikzad Babaii Rizvandi, Javid Taheri, Albert Y.Zomaya",Pattern Matching for Self- Tuning of MapReduce Jobs,"7 pages, previously published as ""On Using Pattern Matching
  Algorithms in MapReduce Applications"" at ISPA 2011. arXiv admin note:
  substantial text overlap with arXiv:1112.5505",,10.1109/ISPA.2011.24,,cs.DC cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study CPU utilization time patterns of several MapReduce
applications. After extracting running patterns of several applications, they
are saved in a reference database to be later used to tweak system parameters
to efficiently execute unknown applications in future. To achieve this goal,
CPU utilization patterns of new applications are compared with the already
known ones in the reference database to find/predict their most probable
execution patterns. Because of different patterns lengths, the Dynamic Time
Warping (DTW) is utilized for such comparison; a correlation analysis is then
applied to DTWs outcomes to produce feasible similarity patterns. Three real
applications (WordCount, Exim Mainlog parsing and Terasort) are used to
evaluate our hypothesis in tweaking system parameters in executing similar
applications. Results were very promising and showed effectiveness of our
approach on pseudo-distributed MapReduce platforms.
","[{'version': 'v1', 'created': 'Mon, 21 Jan 2013 04:57:05 GMT'}]",2013-01-30,"[['Rizvandi', 'Nikzad Babaii', ''], ['Taheri', 'Javid', ''], ['Zomaya', 'Albert Y.', '']]","['Mapreduce', 'Pattern Matching', 'Configuration parameters']"
796,2106.13632,Ahmed Shokry,"Ahmed Shokry, Marwan Torki, Moustafa Youssef","DeepLoc: A Ubiquitous Accurate and Low-Overhead Outdoor Cellular
  Localization System",,"SIGSPATIAL '18: Proceedings of the 26th ACM SIGSPATIAL
  International Conference on Advances in Geographic Information
  SystemsNovember 2018",10.1145/3274895.3274909,,cs.LG cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Recent years have witnessed fast growth in outdoor location-based services.
While GPS is considered a ubiquitous localization system, it is not supported
by low-end phones, requires direct line of sight to the satellites, and can
drain the phone battery quickly.
  In this paper, we propose DeepLoc: a deep learning-based outdoor localization
system that obtains GPS-like localization accuracy without its limitations. In
particular, DeepLoc leverages the ubiquitous cellular signals received from the
different cell towers heard by the mobile device as hints to localize it. To do
that, crowd-sensed geo-tagged received signal strength information coming from
different cell towers is used to train a deep model that is used to infer the
user's position. As part of DeepLoc design, we introduce modules to address a
number of practical challenges including scaling the data collection to large
areas, handling the inherent noise in the cellular signal and geo-tagged data,
as well as providing enough data that is required for deep learning models with
low-overhead.
  We implemented DeepLoc on different Android devices. Evaluation results in
realistic urban and rural environments show that DeepLoc can achieve a median
localization accuracy within 18.8m in urban areas and within 15.7m in rural
areas. This accuracy outperforms the state-of-the-art cellular-based systems by
more than 470% and comes with 330% savings in power compared to the GPS. This
highlights the promise of DeepLoc as a ubiquitous accurate and low-overhead
localization system.
","[{'version': 'v1', 'created': 'Fri, 25 Jun 2021 13:34:40 GMT'}]",2021-06-28,"[['Shokry', 'Ahmed', ''], ['Torki', 'Marwan', ''], ['Youssef', 'Moustafa', '']]","['Deep learning', 'Crowd-sensing', 'Accurate and low-overhead localization', 'Outdoor localization']"
797,1403.2330,Chen Jie,Jie Chen and Hua Mao and Yongsheng Sang and Zhang Yi,Subspace clustering using a symmetric low-rank representation,12 pages,,10.1016/j.knosys.2017.02.031,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a low-rank representation with symmetric constraint
(LRRSC) method for robust subspace clustering. Given a collection of data
points approximately drawn from multiple subspaces, the proposed technique can
simultaneously recover the dimension and members of each subspace. LRRSC
extends the original low-rank representation algorithm by integrating a
symmetric constraint into the low-rankness property of high-dimensional data
representation. The symmetric low-rank representation, which preserves the
subspace structures of high-dimensional data, guarantees weight consistency for
each pair of data points so that highly correlated data points of subspaces are
represented together. Moreover, it can be efficiently calculated by solving a
convex optimization problem. We provide a rigorous proof for minimizing the
nuclear-norm regularized least square problem with a symmetric constraint. The
affinity matrix for spectral clustering can be obtained by further exploiting
the angular information of the principal directions of the symmetric low-rank
representation. This is a critical step towards evaluating the memberships
between data points. Experimental results on benchmark databases demonstrate
the effectiveness and robustness of LRRSC compared with several
state-of-the-art subspace clustering algorithms.
","[{'version': 'v1', 'created': 'Fri, 7 Mar 2014 10:07:43 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Oct 2014 08:39:50 GMT'}, {'version': 'v3', 'created': 'Sat, 13 May 2017 11:25:48 GMT'}]",2017-05-16,"[['Chen', 'Jie', ''], ['Mao', 'Hua', ''], ['Sang', 'Yongsheng', ''], ['Yi', 'Zhang', '']]","['Low-rank representation', 'subspace clustering', 'affinity matrix learning', 'spectral clustering']"
798,1711.04731,Keith Carlson,"Keith Carlson, Allen Riddell, Daniel Rockmore",Evaluating prose style transfer with the Bible,,Royal Society open science 5.10 (2018): 171920,10.1098/rsos.171920,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the prose style transfer task a system, provided with text input and a
target prose style, produces output which preserves the meaning of the input
text but alters the style. These systems require parallel data for evaluation
of results and usually make use of parallel data for training. Currently, there
are few publicly available corpora for this task. In this work, we identify a
high-quality source of aligned, stylistically distinct text in different
versions of the Bible. We provide a standardized split, into training,
development and testing data, of the public domain versions in our corpus. This
corpus is highly parallel since many Bible versions are included. Sentences are
aligned due to the presence of chapter and verse numbers within all versions of
the text. In addition to the corpus, we present the results, as measured by the
BLEU and PINC metrics, of several models trained on our data which can serve as
baselines for future research. While we present these data as a style transfer
corpus, we believe that it is of unmatched quality and may be useful for other
natural language tasks as well.
","[{'version': 'v1', 'created': 'Mon, 13 Nov 2017 17:59:26 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Dec 2018 18:43:56 GMT'}]",2021-09-01,"[['Carlson', 'Keith', ''], ['Riddell', 'Allen', ''], ['Rockmore', 'Daniel', '']]","['style transfer', 'datasets', 'paraphrase generation']"
799,1808.05439,Jaroslaw Kwapien,"Tomasz Stanisz, Jaros{\l}aw Kwapie\'n, Stanis{\l}aw Dro\.zd\.z","Linguistic data mining with complex networks: a stylometric-oriented
  approach",,"Information Sciences 482, 301-320 (2019)",10.1016/j.ins.2019.01.040,,cs.CL nlin.AO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  By representing a text by a set of words and their co-occurrences, one
obtains a word-adjacency network being a reduced representation of a given
language sample. In this paper, the possibility of using network representation
to extract information about individual language styles of literary texts is
studied. By determining selected quantitative characteristics of the networks
and applying machine learning algorithms, it is possible to distinguish between
texts of different authors. Within the studied set of texts, English and
Polish, a properly rescaled weighted clustering coefficients and weighted
degrees of only a few nodes in the word-adjacency networks are sufficient to
obtain the authorship attribution accuracy over 90%. A correspondence between
the text authorship and the word-adjacency network structure can therefore be
found. The network representation allows to distinguish individual language
styles by comparing the way the authors use particular words and punctuation
marks. The presented approach can be viewed as a generalization of the
authorship attribution methods based on simple lexical features.
  Additionally, other network parameters are studied, both local and global
ones, for both the unweighted and weighted networks. Their potential to capture
the writing style diversity is discussed; some differences between languages
are observed.
","[{'version': 'v1', 'created': 'Thu, 16 Aug 2018 12:14:07 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Jan 2019 12:13:12 GMT'}]",2019-01-18,"[['Stanisz', 'Tomasz', ''], ['Kwapień', 'Jarosław', ''], ['Drożdż', 'Stanisław', '']]","['complex networks', 'natural language', 'data mining', 'stylometry', 'authorship attribution']"
800,1210.1649,Thomas Krennwallner,"Thomas Eiter, Michael Fink, Thomas Krennwallner, Christoph Redl",Conflict-driven ASP Solving with External Sources,To appear in Theory and Practice of Logic Programming,Theor. Pract. Log. Prog. 12:4-5 (2012) 659-679,10.1017/S1471068412000233,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Answer Set Programming (ASP) is a well-known problem solving approach based
on nonmonotonic logic programs and efficient solvers. To enable access to
external information, HEX-programs extend programs with external atoms, which
allow for a bidirectional communication between the logic program and external
sources of computation (e.g., description logic reasoners and Web resources).
Current solvers evaluate HEX-programs by a translation to ASP itself, in which
values of external atoms are guessed and verified after the ordinary answer set
computation. This elegant approach does not scale with the number of external
accesses in general, in particular in presence of nondeterminism (which is
instrumental for ASP). In this paper, we present a novel, native algorithm for
evaluating HEX-programs which uses learning techniques. In particular, we
extend conflict-driven ASP solving techniques, which prevent the solver from
running into the same conflict again, from ordinary to HEX-programs. We show
how to gain additional knowledge from external source evaluations and how to
use it in a conflict-driven algorithm. We first target the uninformed case,
i.e., when we have no extra information on external sources, and then extend
our approach to the case where additional meta-information is available.
Experiments show that learning from external sources can significantly decrease
both the runtime and the number of considered candidate compatible sets.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2012 06:12:59 GMT'}]",2012-10-08,"[['Eiter', 'Thomas', ''], ['Fink', 'Michael', ''], ['Krennwallner', 'Thomas', ''], ['Redl', 'Christoph', '']]","['Answer Set Programming', 'Nonmonotonic Reasoning', 'Conflict-Driven Clause Learning']"
801,1709.05360,Zhongang Qi,"Zhongang Qi, Saeed Khorram, Fuxin Li",Embedding Deep Networks into Visual Explanations,,Artificial Intelligence (2020),10.1016/j.artint.2020.103435,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel Explanation Neural Network (XNN) to explain
the predictions made by a deep network. The XNN works by learning a nonlinear
embedding of a high-dimensional activation vector of a deep network layer into
a low-dimensional explanation space while retaining faithfulness i.e., the
original deep learning predictions can be constructed from the few concepts
extracted by our explanation network. We then visualize such concepts for human
to learn about the high-level concepts that the deep network is using to make
decisions. We propose an algorithm called Sparse Reconstruction Autoencoder
(SRAE) for learning the embedding to the explanation space. SRAE aims to
reconstruct part of the original feature space while retaining faithfulness. A
pull-away term is applied to SRAE to make the bases of the explanation space
more orthogonal to each other. A visualization system is then introduced for
human understanding of the features in the explanation space. The proposed
method is applied to explain CNN models in image classification tasks. We
conducted a human study, which shows that the proposed approach outperforms
single saliency map baselines, and improves human performance on a difficult
classification tasks. Also, several novel metrics are introduced to evaluate
the performance of explanations quantitatively without human involvement.
","[{'version': 'v1', 'created': 'Fri, 15 Sep 2017 18:16:34 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Apr 2018 01:13:52 GMT'}, {'version': 'v3', 'created': 'Fri, 11 Dec 2020 09:26:19 GMT'}]",2020-12-14,"[['Qi', 'Zhongang', ''], ['Khorram', 'Saeed', ''], ['Li', 'Fuxin', '']]","['Deep Neural Networks', 'Embedding', 'Visual Explanations']"
802,1607.04763,Ary Setijadi Prihatmanto,"Ahmad Syarif, Ary Setijadi Prihatmanto","Design and implementation of computational platform for social-humanoid
  robot Lumen as an exhibition guide in Electrical Engineering Days 2015","Keywords: robot, humanoid, server, RabbitMQ, Fuzzy Logic Controller,
  AI",,10.13140/RG.2.1.2317.9762,,cs.RO cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Social Robot Lumen is an Artificial Intelligence development project that
aims to create an Artificial Intelligence (AI) which allows a humanoid robot to
communicate with human being naturally. In this study, Lumen will be developed
to be a tour guide in Electrical Engineering Days 2015 exhibition. In
developing an AI, there are a lot of modules that need to be developed
separately. To make the development easier, we need a computational platform
which becomes basis for all developers to give easiness in developing the
modules in parallel way. That computational platform that developed by the
writer is called Lumen Server. Lumen Server has two main function, which are to
be a bridge between all Lumen intelligence modules with NAO robot, and to be
the communication bridge between those Lumen intelligence modules. For the
second function, Lumen Server implements the AMQP protocol using RabbitMQ.
Besides that, writer also developed a control system for robot movement called
Lumen Motion. Lumen motion is implemented by modelling the movement of NAO
robot and also by creating a control system using fuzzy logic controller.
Writer also developed a program that connects all Lumen intelligence modules so
that Lumen can act like a tour guide. The implementation of this program uses
FSM and event-driven program. From implementation result, all the features
which were designed are successfully implemented. By the developing of this
computational platform, it can ease the development of Lumen in the future. For
next development, it must be focused on creating integration system so that
Lumen can be more responsive to the environment.
  -----
  Sosial Robot Lumen adalah proyek pengembangan kecerdasan buatan yang
bertujuan untuk menciptakan kecerdasan buatan atau artificial intelligence (AI)
yang memungkinkan robot untuk dapat berkomunikasi dengan manusia secara alami.
","[{'version': 'v1', 'created': 'Sat, 16 Jul 2016 16:46:33 GMT'}]",2016-07-19,"[['Syarif', 'Ahmad', ''], ['Prihatmanto', 'Ary Setijadi', '']]","['robot', 'humanoid', 'server', 'rabbitMQ', 'Fuzzy Logic Controller', 'AI']"
803,1706.03232,Michail Basios,"Michail Basios, Lingbo Li, Fan Wu, Leslie Kanthan, Earl Barr",Darwinian Data Structure Selection,11 pages,"26th ACM Joint European Software Engineering Conference and
  Symposium on the Foundations of Software Engineering (ESEC FSE 18) November
  2018, Lake Buena Vista, FL, USA",10.1145/3236024.3236043,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data structure selection and tuning is laborious but can vastly improve an
application's performance and memory footprint. Some data structures share a
common interface and enjoy multiple implementations. We call them Darwinian
Data Structures (DDS), since we can subject their implementations to survival
of the fittest. We introduce ARTEMIS a multi-objective, cloud-based
search-based optimisation framework that automatically finds optimal, tuned DDS
modulo a test suite, then changes an application to use that DDS. ARTEMIS
achieves substantial performance improvements for \emph{every} project in $5$
Java projects from DaCapo benchmark, $8$ popular projects and $30$ uniformly
sampled projects from GitHub. For execution time, CPU usage, and memory
consumption, ARTEMIS finds at least one solution that improves \emph{all}
measures for $86\%$ ($37/43$) of the projects. The median improvement across
the best solutions is $4.8\%$, $10.1\%$, $5.1\%$ for runtime, memory and CPU
usage.
  These aggregate results understate ARTEMIS's potential impact. Some of the
benchmarks it improves are libraries or utility functions. Two examples are
gson, a ubiquitous Java serialization framework, and xalan, Apache's XML
transformation tool. ARTEMIS improves gson by $16.5$\%, $1\%$ and $2.2\%$ for
memory, runtime, and CPU; ARTEMIS improves xalan's memory consumption by
$23.5$\%. \emph{Every} client of these projects will benefit from these
performance improvements.
","[{'version': 'v1', 'created': 'Sat, 10 Jun 2017 13:20:29 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Jun 2018 10:44:42 GMT'}, {'version': 'v3', 'created': 'Wed, 1 Aug 2018 10:42:02 GMT'}]",2018-08-02,"[['Basios', 'Michail', ''], ['Li', 'Lingbo', ''], ['Wu', 'Fan', ''], ['Kanthan', 'Leslie', ''], ['Barr', 'Earl', '']]","['Search-based Software Engineering', 'Genetic Improvement', 'Software Analysis and Optimisation', 'Data Structure Optimisation']"
804,1603.04917,Madeleine Kotzagiannidis,"Madeleine S. Kotzagiannidis, Pier Luigi Dragotti",Splines and Wavelets on Circulant Graphs,To appear in Appl. Comput. Harmon. Anal. (2017),,10.1016/j.acha.2017.10.002,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present novel families of wavelets and associated filterbanks for the
analysis and representation of functions defined on circulant graphs. In this
work, we leverage the inherent vanishing moment property of the circulant graph
Laplacian operator, and by extension, the e-graph Laplacian, which is
established as a parameterization of the former with respect to the degree per
node, for the design of vertex-localized and critically-sampled higher-order
graph (e-)spline wavelet filterbanks, which can reproduce and annihilate
classes of (exponential) polynomial signals on circulant graphs. In addition,
we discuss similarities and analogies of the detected properties and resulting
constructions with splines and spline wavelets in the Euclidean domain.
Ultimately, we consider generalizations to arbitrary graphs in the form of
graph approximations, with focus on graph product decompositions. In
particular, we proceed to show how the use of graph products facilitates a
multi-dimensional extension of the proposed constructions and properties.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2016 23:01:03 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Oct 2017 22:11:08 GMT'}]",2017-10-24,"[['Kotzagiannidis', 'Madeleine S.', ''], ['Dragotti', 'Pier Luigi', '']]","['graph signal processing', 'graph wavelet', 'sparse representation', 'circulantgraphs', 'splines']"
805,1907.02323,"Jan R\""uth","Constantin Sander and Jan R\""uth and Oliver Hohlfeld and Klaus Wehrle",DeePCCI: Deep Learning-based Passive Congestion Control Identification,,"NetAI '19: ACM SIGCOMM 2019 Workshop on Network Meets AI & ML,
  August 23, 2019, Beijing, China",10.1145/3341216.3342211,,cs.NI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transport protocols use congestion control to avoid overloading a network.
Nowadays, different congestion control variants exist that influence
performance. Studying their use is thus relevant, but it is hard to identify
which variant is used. While passive identification approaches exist, these
require detailed domain knowledge and often also rely on outdated assumptions
about how congestion control operates and what data is accessible. We present
DeePCCI, a passive, deep learning-based congestion control identification
approach which does not need any domain knowledge other than training traffic
of a congestion control variant. By only using packet arrival data, it is also
directly applicable to encrypted (transport header) traffic. DeePCCI is
therefore more easily extendable and can also be used with QUIC.
","[{'version': 'v1', 'created': 'Thu, 4 Jul 2019 10:50:51 GMT'}]",2019-07-05,"[['Sander', 'Constantin', ''], ['Rüth', 'Jan', ''], ['Hohlfeld', 'Oliver', ''], ['Wehrle', 'Klaus', '']]","['Deep Learning', 'Congestion Control', 'Congestion Control Identification', 'Passive Measurements']"
806,1209.1433,EPTCS,"Zinovy Diskin (McMaster University/The University of Waterloo), Tom
  Maibaum (McMaster University)","Category Theory and Model-Driven Engineering: From Formal Semantics to
  Design Patterns and Beyond","In Proceedings ACCAT 2012, arXiv:1208.4301","EPTCS 93, 2012, pp. 1-21",10.4204/EPTCS.93.1,,cs.SE cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a hidden intrigue in the title. CT is one of the most abstract
mathematical disciplines, sometimes nicknamed ""abstract nonsense"". MDE is a
recent trend in software development, industrially supported by standards,
tools, and the status of a new ""silver bullet"". Surprisingly, categorical
patterns turn out to be directly applicable to mathematical modeling of
structures appearing in everyday MDE practice. Model merging, transformation,
synchronization, and other important model management scenarios can be seen as
executions of categorical specifications.
  Moreover, the paper aims to elucidate a claim that relationships between CT
and MDE are more complex and richer than is normally assumed for ""applied
mathematics"". CT provides a toolbox of design patterns and structural
principles of real practical value for MDE. We will present examples of how an
elementary categorical arrangement of a model management scenario reveals
deficiencies in the architecture of modern tools automating the scenario.
","[{'version': 'v1', 'created': 'Fri, 7 Sep 2012 01:19:35 GMT'}]",2012-09-10,"[['Diskin', 'Zinovy', '', 'McMaster University/The University of Waterloo'], ['Maibaum', 'Tom', '', 'McMaster University']]","['Model-driven engineering', 'mathematical modeling', 'category theory']"
807,1604.02546,Lorenzo Baraldi,"Lorenzo Baraldi, Costantino Grana and Rita Cucchiara","Scene-driven Retrieval in Edited Videos using Aesthetic and Semantic
  Deep Features",ICMR 2016,,10.1145/2911996.2912012,,cs.CV cs.IR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel retrieval pipeline for video collections, which
aims to retrieve the most significant parts of an edited video for a given
query, and represent them with thumbnails which are at the same time
semantically meaningful and aesthetically remarkable. Videos are first
segmented into coherent and story-telling scenes, then a retrieval algorithm
based on deep learning is proposed to retrieve the most significant scenes for
a textual query. A ranking strategy based on deep features is finally used to
tackle the problem of visualizing the best thumbnail. Qualitative and
quantitative experiments are conducted on a collection of edited videos to
demonstrate the effectiveness of our approach.
","[{'version': 'v1', 'created': 'Sat, 9 Apr 2016 09:41:14 GMT'}]",2016-04-12,"[['Baraldi', 'Lorenzo', ''], ['Grana', 'Costantino', ''], ['Cucchiara', 'Rita', '']]","['Video retrieval', 'Thumbnail selection', 'Ranking']"
808,1409.6346,Bartlomiej Placzek,Bartlomiej Placzek,"Communication-aware algorithms for target tracking in wireless sensor
  networks","11 pages, 4 figures","Communications in Computer and Information Science, vol. 431, pp.
  69-78 (2014)",10.1007/978-3-319-07941-7_7,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces algorithms for target tracking in wireless sensor
networks (WSNs) that enable reduction of data communication cost. The objective
of the considered problem is to control movement of a mobile sink which has to
reach a moving target in the shortest possible time. Consumption of the WSN
energy resources is reduced by transferring only necessary data readings
(target positions) to the mobile sink. Simulations were performed to evaluate
the proposed algorithms against existing methods. The experimental results
confirm that the introduced tracking algorithms allow the data communication
cost to be considerably reduced without significant increase in the amount of
time that the sink needs to catch the target.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 21:31:00 GMT'}]",2014-09-24,"[['Placzek', 'Bartlomiej', '']]","['wireless sensor networks', 'data collection', 'object tracking']"
809,1305.3311,Harsh Taneja,Harsh Taneja and Angela Xiao Wu,"Does the Great Firewall really isolate the Chinese? Integrating access
  blockage with cultural factors to explain web user behavior","Pre-Publication Copy. Cite as: Taneja, H. & Wu, A.X. (Forthcoming).
  Does the Great Firewall really isolate the Chinese? Integrating access
  blockage with cultural factors to explain web user behavior. The Information
  Society",,10.1080/01972243.2014.944728,,cs.CY cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The dominant understanding of Internet censorship posits that blocking access
to foreign-based websites creates isolated communities of Internet users. We
question this discourse for its assumption that if given access people would
use all websites. We develop a conceptual framework that integrates access
blockage with social structures to explain web users' choices, and argue that
users visit websites they find culturally proximate and access blockage matters
only when such sites are blocked. We examine the case of China, where online
blockage is notoriously comprehensive, and compare Chinese web usage patterns
with those elsewhere. Analyzing audience traffic among the 1000 most visited
websites, we find that websites cluster according to language and geography.
Chinese websites constitute one cluster, which resembles other such
geo-linguistic clusters in terms of both its composition and degree of
isolation. Our sociological investigation reveals a greater role of cultural
proximity than access blockage in explaining online behaviors.
","[{'version': 'v1', 'created': 'Tue, 14 May 2013 22:00:52 GMT'}, {'version': 'v2', 'created': 'Thu, 23 May 2013 15:22:19 GMT'}, {'version': 'v3', 'created': 'Fri, 25 Oct 2013 03:16:23 GMT'}, {'version': 'v4', 'created': 'Sat, 22 Feb 2014 00:43:44 GMT'}, {'version': 'v5', 'created': 'Mon, 9 Jun 2014 16:02:20 GMT'}]",2016-03-11,"[['Taneja', 'Harsh', ''], ['Wu', 'Angela Xiao', '']]","['censorship', 'China', 'Culturally Defined Markets', 'cultural proximity', 'audience']"
810,1609.07134,Michal Wlodarczyk,Micha{\l} W{\l}odarczyk,Clifford algebras meet tree decompositions,"This work was presented at International Symposium on Parameterized
  and Exact Computation (IPEC) 2016",,10.1007/s00453-018-0489-3,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the Non-commutative Subset Convolution - a convolution of
functions useful when working with determinant-based algorithms. In order to
compute it efficiently, we take advantage of Clifford algebras, a
generalization of quaternions used mainly in the quantum field theory.
  We apply this tool to speed up algorithms counting subgraphs parameterized by
the treewidth of a graph. We present an $O^*((2^\omega + 1)^{tw})$-time
algorithm for counting Steiner trees and an $O^*((2^\omega + 2)^{tw})$-time
algorithm for counting Hamiltonian cycles, both of which improve the previously
known upper bounds. The result for Steiner Tree also translates into a
deterministic algorithm for Feedback Vertex Set. All of these constitute the
best known running times of deterministic algorithms for decision versions of
these problems and they match the best obtained running times for pathwidth
parameterization under assumption $\omega = 2$.
","[{'version': 'v1', 'created': 'Thu, 22 Sep 2016 19:58:52 GMT'}]",2018-08-13,"[['Włodarczyk', 'Michał', '']]","['fixed-parameter tractability', 'treewidth', 'Clifford algebra', 'algebra isomorphism']"
811,1806.02508,Chen Chen,"Chen Chen, Qizhen Weng, Wei Wang, Baochun Li, Bo Li","Semi-Dynamic Load Balancing: Efficient Distributed Learning in
  Non-Dedicated Environments",,,10.1145/3419111.3421299,,cs.DC cs.AI cs.LG cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning (ML) models are increasingly trained in clusters with
non-dedicated workers possessing heterogeneous resources. In such scenarios,
model training efficiency can be negatively affected by stragglers -- workers
that run much slower than others. Efficient model training requires eliminating
such stragglers, yet for modern ML workloads, existing load balancing
strategies are inefficient and even infeasible. In this paper, we propose a
novel strategy called semi-dynamic load balancing to eliminate stragglers of
distributed ML workloads. The key insight is that ML workers shall be
load-balanced at iteration boundaries, being non-intrusive to intra-iteration
execution. We develop LB-BSP based on such an insight, which is an integrated
worker coordination mechanism that adapts workers' load to their instantaneous
processing capabilities by right-sizing the sample batches at the
synchronization barriers. We have custom-designed the batch sizing algorithm
respectively for CPU and GPU clusters based on their own characteristics.
LB-BSP has been implemented as a Python module for ML frameworks like
TensorFlow and PyTorch. Our EC2 deployment confirms that LB-BSP is practical,
effective and light-weight, and is able to accelerating distributed training by
up to $54\%$.
","[{'version': 'v1', 'created': 'Thu, 7 Jun 2018 04:15:58 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Dec 2020 14:37:47 GMT'}]",2020-12-09,"[['Chen', 'Chen', ''], ['Weng', 'Qizhen', ''], ['Wang', 'Wei', ''], ['Li', 'Baochun', ''], ['Li', 'Bo', '']]","['Distributed Learning', 'Load Balancing', 'Synchronization']"
812,1303.5029,Giuseppe Vizzari,Stefania Bandini and Andrea Gorrini and Giuseppe Vizzari,"Towards an Integrated Approach to Crowd Analysis and Crowd Synthesis: a
  Case Study and First Results","Preprint submitted to Pattern Recognition Letters March 20, 2013",,10.1016/j.patrec.2013.10.003,,cs.MA physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Studies related to crowds of pedestrians, both those of theoretical nature
and application oriented ones, have generally focused on either the analysis or
the synthesis of the phenomena related to the interplay between individual
pedestrians, each characterised by goals, preferences and potentially relevant
relationships with others, and the environment in which they are situated. The
cases in which these activities have been systematically integrated for a
mutual benefit are still very few compared to the corpus of crowd related
literature. This paper presents a case study of an integrated approach to the
definition of an innovative model for pedestrian and crowd simulation (on the
side of synthesis) that was actually motivated and supported by the analyses of
empirical data acquired from both experimental settings and observations in
real world scenarios. In particular, we will introduce a model for the adaptive
behaviour of pedestrians that are also members of groups, that strive to
maintain their cohesion even in difficult (e.g. high density) situations. The
paper will show how the synthesis phase also provided inputs to the analysis of
empirical data, in a virtuous circle.
","[{'version': 'v1', 'created': 'Wed, 20 Mar 2013 19:03:26 GMT'}]",2013-11-07,"[['Bandini', 'Stefania', ''], ['Gorrini', 'Andrea', ''], ['Vizzari', 'Giuseppe', '']]","['crowd analysis', 'crowd synthesis', 'agent–based modelling and simulation', 'groups']"
813,1803.04054,Azad Aminpour,"Kamyar Nazeri, Azad Aminpour, Mehran Ebrahimi","Two-Stage Convolutional Neural Network for Breast Cancer Histology Image
  Classification","10 pages, 5 figures, ICIAR 2018 conference",LNCS 10882 (2018) 717-726,10.1007/978-3-319-93000-8_81,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper explores the problem of breast tissue classification of microscopy
images. Based on the predominant cancer type the goal is to classify images
into four categories of normal, benign, in situ carcinoma, and invasive
carcinoma. Given a suitable training dataset, we utilize deep learning
techniques to address the classification problem. Due to the large size of each
image in the training dataset, we propose a patch-based technique which
consists of two consecutive convolutional neural networks. The first
""patch-wise"" network acts as an auto-encoder that extracts the most salient
features of image patches while the second ""image-wise"" network performs
classification of the whole image. The first network is pre-trained and aimed
at extracting local information while the second network obtains global
information of an input image. We trained the networks using the ICIAR 2018
grand challenge on BreAst Cancer Histology (BACH) dataset. The proposed method
yields 95 % accuracy on the validation set compared to previously reported 77 %
accuracy rates in the literature. Our code is publicly available at
https://github.com/ImagingLab/ICIAR2018
","[{'version': 'v1', 'created': 'Sun, 11 Mar 2018 22:05:33 GMT'}, {'version': 'v2', 'created': 'Sun, 1 Apr 2018 16:37:19 GMT'}]",2018-06-29,"[['Nazeri', 'Kamyar', ''], ['Aminpour', 'Azad', ''], ['Ebrahimi', 'Mehran', '']]","['Breast cancer', 'Whole slide images', 'Convolutional neuralnetworks', 'Patch-wise learning', 'Microscopy image classification']"
814,1409.8021,C. John Deepu,"Chacko John Deepu, Zhihao Chen, Ju Teng Teo, Soon Huat Ng, Xiefeng
  Yang, Yong Lian",A Smart Cushion for Real-Time Heart Rate Monitoring,2012 IEEE Biomedical Circuits and Systems Conference,,10.1109/BioCAS.2012.6418512,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a smart cushion for real time heart rate monitoring. The
cushion comprises of an integrated micro-bending fiber sensor, which records
the BCG (Ballistocardiogram) signal without direct skin-electrode contact, and
an optical transceiver that does signal amplification, digitization, and
pre-filtering. To remove the artifacts and extract heart rate from BCG signal,
a computationally efficient heart rate detection algorithm is developed. The
system doesn't require any pre-training and is highly responsive with the
outputs updated every 3 sec and initial response within first 10 sec. Tests
conducted on human subjects show the detected heart rate closely matches the
one from a commercial SpO2 device.
","[{'version': 'v1', 'created': 'Mon, 29 Sep 2014 08:24:29 GMT'}]",2014-09-30,"[['Deepu', 'Chacko John', ''], ['Chen', 'Zhihao', ''], ['Teo', 'Ju Teng', ''], ['Ng', 'Soon Huat', ''], ['Yang', 'Xiefeng', ''], ['Lian', 'Yong', '']]","['Ballistocardiogram', 'Smart Cushion', 'Contactless heart rate detection', 'MRI friendly heart rate monitoring']"
815,2102.04796,Javier Yuste,"Javier Yuste, Sergio Pastrana","Avaddon ransomware: an in-depth analysis and decryption of infected
  systems",,Computers & Security 109 (2021) 102388,10.1016/j.cose.2021.102388,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The commoditization of Malware-as-a-Service (MaaS) allows criminals to obtain
financial benefits at a low risk and with little technical background. One such
popular product in the underground economy is ransomware. In ransomware
attacks, data from infected systems is held hostage (encrypted) until a fee is
paid to the criminals. This modus operandi disrupts legitimate businesses,
which may become unavailable until the data is restored. A recent blackmailing
strategy adopted by criminals is to leak data online from the infected systems
if the ransom is not paid. Besides reputational damage, data leakage might
produce further economical losses due to fines imposed by data protection laws.
Thus, research on prevention and recovery measures to mitigate the impact of
such attacks is needed to adapt existing countermeasures to new strains.
  In this work, we perform an in-depth analysis of Avaddon, a ransomware
offered in the underground economy as an affiliate program business. This has
infected and leaked data from at least 23 organizations. Additionally, it runs
Distributed Denial-of-Service (DDoS) attacks against victims that do not pay
the ransom. We first provide an analysis of the criminal business model from
the underground economy. Then, we identify and describe its technical
capabilities. We provide empirical evidence of links between this variant and a
previous family, suggesting that the same group was behind the development and,
possibly, the operation of both campaigns.
  Finally, we describe a method to decrypt files encrypted with Avaddon in real
time. We implement and test the decryptor in a tool that can recover the
encrypted data from an infected system, thus mitigating the damage caused by
the ransomware. The tool is released open-source so it can be incorporated in
existing Antivirus engines.
","[{'version': 'v1', 'created': 'Tue, 9 Feb 2021 12:31:49 GMT'}]",2021-07-09,"[['Yuste', 'Javier', ''], ['Pastrana', 'Sergio', '']]","['Avaddon', 'Ransomware', 'Malware Analysis', 'Reverse Engineering', 'Cybersecurity']"
816,1711.01447,Emmanouil Panaousis Dr,"Emmanouil Panaousis, Eirini Karapistoli, Hadeer Elsemary, Tansu
  Alpcan, MHR Khuzani, Anastasios A.Economides","Game theoretic path selection to support security in device-to-device
  communications","35 pages, 7 figures","Ad Hoc Networks (2017), 28-42",10.1016/j.adhoc.2016.11.008.,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Device-to-Device (D2D) communication is expected to be a key feature
supported by 5G networks, especially due to the proliferation of Mobile Edge
Computing (MEC), which has a prominent role in reducing network stress by
shifting computational tasks from the Internet to the mobile edge. Apart from
being part of MEC, D2D can extend cellular coverage allowing users to
communicate directly when telecommunication infrastructure is highly congested
or absent. This significant departure from the typical cellular paradigm
imposes the need for decentralised network routing protocols. Moreover,
enhanced capabilities of mobile devices and D2D networking will likely result
in proliferation of new malware types and epidemics. Although the literature is
rich in terms of D2D routing protocols that enhance quality-of-service and
energy consumption, they provide only basic security support, e.g., in the form
of encryption. Routing decisions can, however, contribute to collaborative
detection of mobile malware by leveraging different kinds of anti-malware
software installed on mobile devices. Benefiting from the cooperative nature of
D2D communications, devices can rely on each other's contributions to detect
malware. The impact of our work is geared towards having more malware-free D2D
networks. To achieve this, we designed and implemented a novel routing protocol
for D2D communications that optimises routing decisions for explicitly
improving malware detection. The protocol identifies optimal network paths, in
terms of malware mitigation and energy spent for malware detection, based on a
game theoretic model. Diverse capabilities of network devices running different
types of anti-malware software and their potential for inspecting messages
relayed towards an intended destination device are leveraged using game
theoretic tools. An optimality analysis of both Nash and Stackelberg security
games is undertaken, including both zero and non-zero sum variants, and the
Defender's equilibrium strategies. By undertaking network simulations,
theoretical results obtained are illustrated through randomly generated network
scenarios showing how our protocol outperforms conventional routing protocols,
in terms of expected payoff, which consists of: security damage in inflicted by
malware and malware detection cost.
","[{'version': 'v1', 'created': 'Sat, 4 Nov 2017 15:07:48 GMT'}]",2017-11-07,"[['Panaousis', 'Emmanouil', ''], ['Karapistoli', 'Eirini', ''], ['Elsemary', 'Hadeer', ''], ['Alpcan', 'Tansu', ''], ['Khuzani', 'MHR', ''], ['Economides', 'Anastasios A.', '']]","['Device-to-Device (D2D) communications', 'iRouting protocol', 'Malware detection games', 'Game theory']"
817,1612.03785,Stefan Wagner,Stefan Wagner,"A model and sensitivity analysis of the quality economics of
  defect-detection techniques","11 pages, 3 figures, Proceedings of the 2006 International Symposium
  on Software Testing and Analysis (ISSTA '06). ACM, 2006",,10.1145/1146238.1146247,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the main cost factors in software development is the detection and
removal of defects. However, the relationships and influencing factors of the
costs and revenues of defect-detection techniques are still not well
understood. This paper proposes an analytical, stochastic model of the
economics of defect detection and removal to improve this understanding. The
model is able to incorporate dynamic as well as static techniques in contrast
to most other models of that kind. We especially analyse the model with
state-ofthe-art sensitivity analysis methods to (1) identify the most relevant
factors for model simplification and (2) prioritise the factors to guide
further research and measurements.
","[{'version': 'v1', 'created': 'Mon, 12 Dec 2016 16:56:39 GMT'}]",2016-12-13,"[['Wagner', 'Stefan', '']]","['Software quality economics', 'quality costs', 'cost/benefit', 'defectdetection techniques', 'sensitivity analysis']"
818,1409.8670,David Wajc,"Joseph (Seffi) Naor, David Wajc",Near-Optimum Online Ad Allocation for Targeted Advertising,,,10.1145/2764468.2764482,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by Internet targeted advertising, we address several ad allocation
problems. Prior work has established these problems admit no randomized online
algorithm better than $(1-\frac{1}{e})$-competitive
(\cite{karp1990optimal,mehta2007adwords}), yet simple heuristics have been
observed to perform much better in practice. We explain this phenomenon by
studying a generalization of the bounded-degree inputs considered by Buchbinder
et al.~\cite{buchbinder2007online}, graphs which we call $(k,d)-bounded$. In
such graphs the maximal degree on the online side is at most $d$ and the
minimal degree on the offline side is at least $k$. We prove that for such
graphs, these problems' natural greedy algorithms attain competitive ratio
$1-\frac{d-1}{k+d-1}$, tending to \emph{one} as $d/k$ tends to zero. We prove
this bound is tight for these algorithms.
  Next, we develop deterministic primal-dual algorithms for the above problems
achieving competitive ratio $1-(1-\frac{1}{d})^k>1-\frac{1}{e^{k/d}}$, or
\emph{exponentially} better loss as a function of $k/d$, and strictly better
than $1-\frac{1}{e}$ whenever $k\geq d$. We complement our lower bounds with
matching upper bounds for the vertex-weighted problem. Finally, we use our
deterministic algorithms to prove by dual-fitting that simple randomized
algorithms achieve the same bounds in expectation. Our algorithms and analysis
differ from previous ad allocation algorithms, which largely scale bids based
on the spent fraction of their bidder's budget, whereas we scale bids according
to the number of times the bidder could have spent as much as her current bid.
Our algorithms differ from previous online primal-dual algorithms, as they do
not maintain dual feasibility, but only primal-to-dual ratio, and only attain
dual feasibility upon termination. We believe our techniques could find
applications to other well-behaved online packing problems.
","[{'version': 'v1', 'created': 'Tue, 30 Sep 2014 19:49:29 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Apr 2015 18:41:49 GMT'}]",2015-04-30,"[['Joseph', '', '', 'Seffi'], ['Naor', '', ''], ['Wajc', 'David', '']]","['Online Matching', 'Online Ad Allocation', 'Targeted Advertising', 'Sponsored search']"
819,1903.00642,Hayato Ushijima-Mwesigwa,"Hayato Ushijima-Mwesigwa, Zadid Khan, Mashrur A. Chowdhury, and Ilya
  Safro",Centralities for Networks with Consumable Resources,,Net Sci 7 (2019) 376-401,10.1017/nws.2019.7,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identification of influential nodes is an important step in understanding and
controlling the dynamics of information, traffic and spreading processes in
networks. As a result, a number of centrality measures have been proposed and
used across different application domains. At the heart of many of these
measures, lies an assumption describing the manner in which traffic (of
information, social actors, particles, etc.) flows through the network. For
example, some measures only count shortest paths while others consider random
walks.
  This paper considers a spreading process in which a resource necessary for
transit is partially consumed along the way while being refilled at special
nodes on the network. Examples include fuel consumption of vehicles together
with refueling stations, information loss during dissemination with error
correcting nodes, and consumption of ammunition of military troops while
moving.
  We propose generalizations of the well-known measures of betweenness, random
walk betweenness, and Katz centralities to take such a spreading process with
consumable resources into account. In order to validate the results,
experiments on real-world networks are carried out by developing simulations
based on well-known models such as Susceptible-Infected-Recovered and
congestion with respect to particle hopping from vehicular flow theory. The
simulation-based models are shown to be highly correlated to the proposed
centrality measures.
","[{'version': 'v1', 'created': 'Sat, 2 Mar 2019 07:17:08 GMT'}]",2019-10-23,"[['Ushijima-Mwesigwa', 'Hayato', ''], ['Khan', 'Zadid', ''], ['Chowdhury', 'Mashrur A.', ''], ['Safro', 'Ilya', '']]","['network centrality', 'Katz centrality', 'betweenness centrality', 'random-walk betweenness centrality', 'consumable resources']"
820,1808.02784,Ivan Smirnov,Ivan Smirnov,Schools are segregated by educational outcomes in the digital space,,,10.1371/journal.pone.0217142,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Internet provides students with a unique opportunity to connect and
maintain social ties with peers from other schools, irrespective of how far
they are from each other. However, little is known about the real structure of
such online relationships. In this paper, we investigate the structure of
interschool friendship on a popular social networking site. We use data from
36,951 students from 590 schools of a large European city. We find that the
probability of a friendship tie between students from neighboring schools is
high and that it decreases with the distance between schools following the
power law. We also find that students are more likely to be connected if the
educational outcomes of their schools are similar. We show that this fact is
not a consequence of residential segregation. While high- and low-performing
schools are evenly distributed across the city, this is not the case for the
digital space, where schools turn out to be segregated by educational outcomes.
There is no significant correlation between the educational outcomes of a
school and its geographical neighbors; however, there is a strong correlation
between the educational outcomes of a school and its digital neighbors. These
results challenge the common assumption that the Internet is a borderless
space, and may have important implications for the understanding of educational
inequality in the digital age.
","[{'version': 'v1', 'created': 'Wed, 8 Aug 2018 14:00:16 GMT'}]",2019-06-19,"[['Smirnov', 'Ivan', '']]","['schools', 'social networks', 'educational outcomes', 'digital inequality']"
821,1805.06534,Tara Safavi,"Tara Safavi, Maryam Davoodi, Danai Koutra",Career Transitions and Trajectories: A Case Study in Computing,To appear in KDD 2018,,10.1145/3219819.3219863,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  From artificial intelligence to network security to hardware design, it is
well-known that computing research drives many important technological and
societal advancements. However, less is known about the long-term career paths
of the people behind these innovations. What do their careers reveal about the
evolution of computing research? Which institutions were and are the most
important in this field, and for what reasons? Can insights into computing
career trajectories help predict employer retention?
  In this paper we analyze several decades of post-PhD computing careers using
a large new dataset rich with professional information, and propose a versatile
career network model, R^3, that captures temporal career dynamics. With R^3 we
track important organizations in computing research history, analyze career
movement between industry, academia, and government, and build a powerful
predictive model for individual career transitions. Our study, the first of its
kind, is a starting point for understanding computing research careers, and may
inform employer recruitment and retention mechanisms at a time when the demand
for specialized computational expertise far exceeds supply.
","[{'version': 'v1', 'created': 'Wed, 16 May 2018 21:40:52 GMT'}, {'version': 'v2', 'created': 'Thu, 24 May 2018 18:24:07 GMT'}]",2018-05-28,"[['Safavi', 'Tara', ''], ['Davoodi', 'Maryam', ''], ['Koutra', 'Danai', '']]","['like “LLC”', '“college”,', 'rule-based automatic classification']"
822,1501.02134,Lesandro Ponciano,Lesandro Ponciano and Francisco Brasileiro,"Finding Volunteers' Engagement Profiles in Human Computation for Citizen
  Science Projects","3 tables, and 4 figures","Human Computation vol. 1, no. 2, pp. 245-264 (2014)",10.15346/hc.v1i2.12,,cs.HC cs.CY,http://creativecommons.org/licenses/by/3.0/,"  Human computation is a computing approach that draws upon human cognitive
abilities to solve computational tasks for which there are so far no
satisfactory fully automated solutions even when using the most advanced
computing technologies available. Human computation for citizen science
projects consists in designing systems that allow large crowds of volunteers to
contribute to scientific research by executing human computation tasks.
Examples of successful projects are Galaxy Zoo and FoldIt. A key feature of
this kind of project is its capacity to engage volunteers. An important
requirement for the proposal and evaluation of new engagement strategies is
having a clear understanding of the typical engagement of the volunteers;
however, even though several projects of this kind have already been completed,
little is known about this issue. In this paper, we investigate the engagement
pattern of the volunteers in their interactions in human computation for
citizen science projects, how they differ among themselves in terms of
engagement, and how those volunteer engagement features should be taken into
account for establishing the engagement encouragement strategies that should be
brought into play in a given project. To this end, we define four quantitative
engagement metrics to measure different aspects of volunteer engagement, and
use data mining algorithms to identify the different volunteer profiles in
terms of the engagement metrics. Our study is based on data collected from two
projects: Galaxy Zoo and The Milky Way Project. The results show that the
volunteers in such projects can be grouped into five distinct engagement
profiles that we label as follows: hardworking, spasmodic, persistent, lasting,
and moderate. The analysis of these profiles provides a deeper understanding of
the nature of volunteers' engagement in human computation for citizen science
projects
","[{'version': 'v1', 'created': 'Fri, 9 Jan 2015 13:38:02 GMT'}]",2015-01-12,"[['Ponciano', 'Lesandro', ''], ['Brasileiro', 'Francisco', '']]","['citizen science', 'human computation', 'engagement', 'participation', 'retention']"
823,1202.5985,Romain Giot,"Romain Giot (GREYC), Mohamad El-Abed (GREYC), Christophe Rosenberger
  (GREYC)","Fast computation of the performance evaluation of biometric systems:
  application to multibiometric",Future Generation Computer Systems (2012),,10.1016/j.future.2012.02.003,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The performance evaluation of biometric systems is a crucial step when
designing and evaluating such systems. The evaluation process uses the Equal
Error Rate (EER) metric proposed by the International Organization for
Standardization (ISO/IEC). The EER metric is a powerful metric which allows
easily comparing and evaluating biometric systems. However, the computation
time of the EER is, most of the time, very intensive. In this paper, we propose
a fast method which computes an approximated value of the EER. We illustrate
the benefit of the proposed method on two applications: the computing of non
parametric confidence intervals and the use of genetic algorithms to compute
the parameters of fusion functions. Experimental results show the superiority
of the proposed EER approximation method in term of computing time, and the
interest of its use to reduce the learning of parameters with genetic
algorithms. The proposed method opens new perspectives for the development of
secure multibiometrics systems by speeding up their computation time.
","[{'version': 'v1', 'created': 'Mon, 27 Feb 2012 16:05:10 GMT'}]",2012-02-28,"[['Giot', 'Romain', '', 'GREYC'], ['El-Abed', 'Mohamad', '', 'GREYC'], ['Rosenberger', 'Christophe', '', 'GREYC']]","['Biometrics', 'Authentication', 'Error Estimation', 'Access Control']"
824,1208.1955,Fahimeh Farahbod,Fahimeh Farahbod and Mahdi Eftekhari,Comparison of different T-norm operators in classification problems,"6 pages, 1 figure, 4 tables; International Journal of Fuzzy Logic
  Systems (IJFLS) Vol.2, No.3, July 2012",,10.5121/ijfls.2012.2303,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fuzzy rule based classification systems are one of the most popular fuzzy
modeling systems used in pattern classification problems. This paper
investigates the effect of applying nine different T-norms in fuzzy rule based
classification systems. In the recent researches, fuzzy versions of confidence
and support merits from the field of data mining have been widely used for both
rules selecting and weighting in the construction of fuzzy rule based
classification systems. For calculating these merits the product has been
usually used as a T-norm. In this paper different T-norms have been used for
calculating the confidence and support measures. Therefore, the calculations in
rule selection and rule weighting steps (in the process of constructing the
fuzzy rule based classification systems) are modified by employing these
T-norms. Consequently, these changes in calculation results in altering the
overall accuracy of rule based classification systems. Experimental results
obtained on some well-known data sets show that the best performance is
produced by employing the Aczel-Alsina operator in terms of the classification
accuracy, the second best operator is Dubois-Prade and the third best operator
is Dombi. In experiments, we have used 12 data sets with numerical attributes
from the University of California, Irvine machine learning repository (UCI).
","[{'version': 'v1', 'created': 'Thu, 9 Aug 2012 15:41:27 GMT'}]",2012-08-10,"[['Farahbod', 'Fahimeh', ''], ['Eftekhari', 'Mahdi', '']]","['Pattern classification', 'Fuzzy systems', 'T-norm operators']"
825,1307.7791,Kester Quist-Aphetsi,Quist-Aphetsi Kester,A Visual Cryptographic Encryption Technique for Securing Medical Images,"5 pages. International Journal of Emerging Technology and Advanced
  Engineering (IJREAT), 2013","International Journal of Emerging Technology and Advanced
  Engineering (IJETAE), 3.6 (2013): pp: 496-500",10.5120/16500-5752,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The increased growth in the use of transmission of multimedia medical
contents over unsecured and open networks provides insecurity for confidential
patient information over these networks. Digital encryption of medical images
before transmission and storage is proposed as a way to effectively provide
protection of patient information. Encryption before watermarking of these
images is necessary in order to ensure inaccessibility of information to
unauthorized personnel with patient. This paper presented a visual
cryptographic technique for encrypting of medical images before transmission or
storage of them. This will make such images inaccessible by unauthorized
personnel and also ensures confidentiality. The process made use of an
encryption technique that is based on pixel shuffling and a secret key
generated from the image.
","[{'version': 'v1', 'created': 'Tue, 30 Jul 2013 02:47:29 GMT'}]",2015-06-16,"[['Kester', 'Quist-Aphetsi', '']]","['visual cryptography', 'medical images', 'secret']"
826,1809.00085,Ishtar Nyawira,"Ishtar Nyawira, Kristi Bushman",A Simplified Approach to Deep Learning for Image Segmentation,"8 pages, 6 figures (1a to 6c, plus 5 in appendix), PEARC '18:
  Practice and Experience in Advanced Research Computing, July 22--26, 2018,
  Pittsburgh, PA, USA","PEARC '18 Proceedings of the Practice and Experience on Advanced
  Research Computing, Article No. 56, 2018",10.1145/3219104.3229286,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Leaping into the rapidly developing world of deep learning is an exciting and
sometimes confusing adventure. All of the advice and tutorials available can be
hard to organize and work through, especially when training specific models on
specific datasets, different from those originally used to train the network.
In this short guide, we aim to walk the reader through the techniques that we
have used to successfully train two deep neural networks for pixel-wise
classification, including some data management and augmentation approaches for
working with image data that may be insufficiently annotated or relatively
homogenous.
","[{'version': 'v1', 'created': 'Fri, 31 Aug 2018 23:46:38 GMT'}]",2018-09-05,"[['Nyawira', 'Ishtar', ''], ['Bushman', 'Kristi', '']]","['Deep Learning', 'Convolutional Neural Networks', 'Machine Learning', 'Artificial Intelligence', 'Biomedical Image Processing']"
827,1901.06926,Debarghya China,"Debarghya China, Pabitra Mitra, Debdoot Sheet","Segmentation of Lumen and External Elastic Laminae in Intravascular
  Ultrasound Images using Ultrasonic Backscattering Physics Initialized
  Multiscale Random Walks",ICVGIP MedImage 2016,,10.1007/978-3-319-68124-5_34,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Coronary artery disease accounts for a large number of deaths across the
world and clinicians generally prefer using x-ray computed tomography or
magnetic resonance imaging for localizing vascular pathologies. Interventional
imaging modalities like intravascular ultrasound (IVUS) are used to adjunct
diagnosis of atherosclerotic plaques in vessels, and help assess morphological
state of the vessel and plaque, which play a significant role for treatment
planning. Since speckle intensity in IVUS images are inherently stochastic in
nature and challenge clinicians with accurate visibility of the vessel wall
boundaries, it requires automation. In this paper we present a method for
segmenting the lumen and external elastic laminae of the artery wall in IVUS
images using random walks over a multiscale pyramid of Gaussian decomposed
frames. The seeds for the random walker are initialized by supervised learning
of ultrasonic backscattering and attenuation statistical mechanics from
labelled training samples. We have experimentally evaluated the performance
using $77$ IVUS images acquired at $40$ MHz that are available in the IVUS
segmentation challenge
dataset\footnote{http://www.cvc.uab.es/IVUSchallenge2011/dataset.html} to
obtain a Jaccard score of $0.89 \pm 0.14$ for lumen and $0.85 \pm 0.12$ for
external elastic laminae segmentation over a $10$-fold cross-validation study.
","[{'version': 'v1', 'created': 'Mon, 21 Jan 2019 13:29:46 GMT'}]",2019-01-23,"[['China', 'Debarghya', ''], ['Mitra', 'Pabitra', ''], ['Sheet', 'Debdoot', '']]","['External elastic laminae segmentation', 'intravascular ultrasound', 'lumen segmentation', 'random forests', 'random walks', 'signal confidence']"
828,1312.2949,Rajendra Patel,"Rajendra Patel, Arvind Rajwat",A Survey of Embedded Software Profiling Methodologies,"22 Pages, 14 Figures, 2 Tables, International Journal of Embedded
  Systems and Applications (IJESA)",,10.5121/ijesa.2011.1203,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Embedded Systems combine one or more processor cores with dedicated logic
running on an ASIC or FPGA to meet design goals at reasonable cost. It is
achieved by profiling the application with variety of aspects like performance,
memory usage, cache hit versus cache miss, energy consumption, etc. Out of
these, performance estimation is more important than others. With ever
increasing system complexities, it becomes quite necessary to carry out
performance estimation of embedded software implemented in a particular
processor for fast design space exploration. Such profiled data also guides the
designer how to partition the system for Hardware (HW) and Software (SW)
environments. In this paper, we propose a classification for currently
available Embedded Software Profiling Tools, and we present different academic
and industrial approaches in this context. Based on these observations, it will
be easy to identify such common principles and needs which are required for a
true Software Profiling Tool for a particular application.
","[{'version': 'v1', 'created': 'Tue, 10 Dec 2013 05:15:32 GMT'}]",2013-12-12,"[['Patel', 'Rajendra', ''], ['Rajwat', 'Arvind', '']]","['Profiling', 'Embedded', 'Software', 'Performance', 'Methodology']"
829,1112.0713,Qiang Li,"Qiang Li, Azhar Iqbal, Minyou Chen, Derek Abbott",Quantum Strategies Win in a Defector-Dominated Population,"8 pages, 7figures","Physica A, Volume 391, Issue 11, pp. 3316-3322, 2012",10.1016/j.physa.2012.01.048,,cs.GT nlin.AO quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quantum strategies are introduced into evolutionary games. The agents using
quantum strategies are regarded as invaders whose fraction generally is 1% of a
population in contrast to the 50% defectors. In this paper, the evolution of
strategies on networks is investigated in a defector-dominated population, when
three networks (Regular Lattice, Newman-Watts small world network, scale-free
network) are constructed and three games (Prisoners' Dilemma, Snowdrift,
Stag-Hunt) are employed. As far as these three games are concerned, the results
show that quantum strategies can always invade the population successfully.
Comparing the three networks, we find that the regular lattice is most easily
invaded by agents that adopt quantum strategies. However, for a scale-free
network it can be invaded by agents adopting quantum strategies only if a hub
is occupied by an agent with a quantum strategy or if the fraction of agents
with quantum strategies in the population is significant.
","[{'version': 'v1', 'created': 'Sun, 4 Dec 2011 03:05:20 GMT'}]",2012-06-08,"[['Li', 'Qiang', ''], ['Iqbal', 'Azhar', ''], ['Chen', 'Minyou', ''], ['Abbott', 'Derek', '']]","['Quantum Computation', 'Quantum Game', 'Multi-Agent System', 'Evolutionary Game', 'Strategy Evolution']"
830,1806.08981,Raghavendra Selvan,"Raghavendra Selvan, Jens Petersen, Jesper H Pedersen, Marleen de
  Bruijne","Extracting Tree-structures in CT data by Tracking Multiple Statistically
  Ranked Hypotheses","Accepted for publication at the International Journal of Medical
  Physics and Practice",,10.1002/mp.13711,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we adapt a method based on multiple hypothesis tracking (MHT)
that has been shown to give state-of-the-art vessel segmentation results in
interactive settings, for the purpose of extracting trees. Regularly spaced
tubular templates are fit to image data forming local hypotheses. These local
hypotheses are used to construct the MHT tree, which is then traversed to make
segmentation decisions. However, some critical parameters in this method are
scale-dependent and have an adverse effect when tracking structures of varying
dimensions. We propose to use statistical ranking of local hypotheses in
constructing the MHT tree, which yields a probabilistic interpretation of
scores across scales and helps alleviate the scale-dependence of MHT
parameters. This enables our method to track trees starting from a single seed
point. Our method is evaluated on chest CT data to extract airway trees and
coronary arteries. In both cases, we show that our method performs
significantly better than the original MHT method.
","[{'version': 'v1', 'created': 'Sat, 23 Jun 2018 15:03:09 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Jul 2019 15:23:20 GMT'}]",2020-07-01,"[['Selvan', 'Raghavendra', ''], ['Petersen', 'Jens', ''], ['Pedersen', 'Jesper H', ''], ['de Bruijne', 'Marleen', '']]","['multiple hypothesis tracking', 'tree segmentation', 'CT', 'airways', 'vessels']"
831,1907.09247,Jorge Fandinno,Jorge Fandinno,Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting,"Paper presented at the 35th International Conference on Logic
  Programming (ICLP 2019), Las Cruces, New Mexico, USA, 20-25 September 2019,
  16 pages",Theory and Practice of Logic Programming 19 (2019) 671-687,10.1017/S1471068419000127,,cs.LO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a recent line of research, two familiar concepts from logic programming
semantics (unfounded sets and splitting) were extrapolated to the case of
epistemic logic programs. The property of epistemic splitting provides a
natural and modular way to understand programs without epistemic cycles but,
surprisingly, was only fulfilled by Gelfond's original semantics (G91), among
the many proposals in the literature. On the other hand, G91 may suffer from a
kind of self-supported, unfounded derivations when epistemic cycles come into
play. Recently, the absence of these derivations was also formalised as a
property of epistemic semantics called foundedness. Moreover, a first semantics
proved to satisfy foundedness was also proposed, the so-called Founded
Autoepistemic Equilibrium Logic (FAEEL). In this paper, we prove that FAEEL
also satisfies the epistemic splitting property something that, together with
foundedness, was not fulfilled by any other approach up to date. To prove this
result, we provide an alternative characterisation of FAEEL as a combination of
G91 with a simpler logic we called Founded Epistemic Equilibrium Logic (FEEL),
which is somehow an extrapolation of the stable model semantics to the modal
logic S5. Under consideration for acceptance in TPLP.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2019 11:48:15 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Feb 2020 15:33:26 GMT'}]",2020-02-21,"[['Fandinno', 'Jorge', '']]","['Answer Set Programming', 'Epistemic Specifications', 'Epistemic Logic Programs']"
832,1503.06871,Wojciech Zabo{\l}otny PhD,Wojciech M. Zabolotny,"Low latency protocol for transmission of measurement data from FPGA to
  Linux computer via 10 Gbps Ethernet link","Introduced further language corrections. Changed section describing
  resource consumption","JINST 10 (2015), T07005",10.1088/1748-0221/10/07/T07005,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents FADE-10G - an integrated solution for modern multichannel
measurement systems. Its main aim is a low latency, reliable transmission of
measurement data from FPGA-based front-end electronic boards (FEBs) to a
computer-based node in the Data Acquisition System (DAQ), using a standard
Ethernet 1 Gbps or 10 Gbps link. In addition to transmission of data, the
system allows the user to send reliably simple control commands from DAQ to FEB
and to receive responses. The aim of the work is to provide a possible simple
base solution, which can be adapted by the end user to his or her particular
needs. Therefore, the emphasis is put on the minimal consumption of FPGA
resources in FEB and the minimal CPU load in the DAQ computer. The open source
implementation of the FPGA IP core and the Linux kernel driver published under
permissive license facilitates modifications and reuse of the solution. The
system has been successfully tested in real hardware, both with 1 Gbps and 10
Gbps links.
","[{'version': 'v1', 'created': 'Mon, 23 Mar 2015 23:10:42 GMT'}, {'version': 'v2', 'created': 'Sun, 10 May 2015 21:52:13 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Jun 2015 08:35:31 GMT'}, {'version': 'v4', 'created': 'Sun, 21 Jun 2015 15:13:09 GMT'}]",2015-07-29,"[['Zabolotny', 'Wojciech M.', '']]","['FPGA', 'Ethernet', 'Ethernet Protocol', 'Data Acquisition', 'Measurement System']"
833,1610.01295,Gabriele D'Angelo,Gabriele D'Angelo,"The Simulation Model Partitioning Problem: an Adaptive Solution Based on
  Self-Clustering (Extended Version)",,"Simulation Modelling Practice and Theory, Elsevier, Volume 70,
  January 2017 pages 1-20",10.1016/j.simpat.2016.10.001,,cs.DC cs.MA cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is about partitioning in parallel and distributed simulation. That
means decomposing the simulation model into a numberof components and to
properly allocate them on the execution units. An adaptive solution based on
self-clustering, that considers both communication reduction and computational
load-balancing, is proposed. The implementation of the proposed mechanism is
tested using a simulation model that is challenging both in terms of structure
and dynamicity. Various configurations of the simulation model and the
execution environment have been considered. The obtained performance results
are analyzed using a reference cost model. The results demonstrate that the
proposed approach is promising and that it can reduce the simulation execution
time in both parallel and distributed architectures.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2016 07:30:54 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Nov 2016 12:16:11 GMT'}]",2016-11-07,"[[""D'Angelo"", 'Gabriele', '']]","['Simulation', 'Parallel and Distributed Simulation', 'Load Balancing', 'AdaptiveSystems', 'Middleware']"
834,1101.0241,Jaydip Sen,Jaydip Sen,"An Intrusion Detection Architecture for Clustered Wireless Ad Hoc
  Networks","6 pages, 2 Figures, 2 tables. Second International Conference on
  Computational Intelligence, Communication Systems and Networks (CICSYSN
  2010), Liverpool, UK, July 28 - 30, 2010",,10.1109/CICSyN.2010.51,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intrusion detection in wireless ad hoc networks is a challenging task because
these networks change their topologies dynamically, lack concentration points
where aggregated traffic can be analyzed, utilize infrastructure protocols that
are susceptible to manipulation, and rely on noisy, intermittent wireless
communications. Security remains a major challenge for these networks due their
features of open medium, dynamically changing topologies, reliance on
co-operative algorithms, absence of centralized monitoring points, and lack of
clear lines of defense. In this paper, we present a cooperative, distributed
intrusion detection architecture based on clustering of the nodes that
addresses the security vulnerabilities of the network and facilitates accurate
detection of attacks. The architecture is organized as a dynamic hierarchy in
which the intrusion data is acquired by the nodes and is incrementally
aggregated, reduced in volume and analyzed as it flows upwards to the
cluster-head. The cluster-heads of adjacent clusters communicate with each
other in case of cooperative intrusion detection. For intrusion related message
communication, mobile agents are used for their efficiency in lightweight
computation and suitability in cooperative intrusion detection. Simulation
results show effectiveness and efficiency of the proposed architecture.
","[{'version': 'v1', 'created': 'Fri, 31 Dec 2010 12:25:23 GMT'}]",2021-09-07,"[['Sen', 'Jaydip', '']]","['intrusion detection', 'wireless ad hoc networks', 'cluster', 'security', 'denial of service attack']"
835,2112.14446,Xuanwen Huang,"Xuanwen Huang, Yang Yang, Ziqiang Cheng, Shen Fan, Zhongyao Wang,
  Juren Li, Jun Zhang, Jingmin Chen","How Powerful are Interest Diffusion on Purchasing Prediction: A Case
  Study of Taocode",,"Proceedings of the 44th International ACM SIGIR Conference on
  Research and Development in Information Retrieval, 2021",10.1145/3404835.3462898,,cs.SI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A taocode is a kind of specially coded text-link on Taobao(the world's
biggest online shopping website), through which users can share messages about
products with each other. Analyzing taocodes can potentially facilitate
understanding of the social relationships between users and, more excitingly,
their online purchasing behaviors under the influence of taocode diffusion.
This paper innovatively investigates the problem of online purchasing
predictions from an information diffusion perspective, with taocode as a case
study. Specifically, we conduct profound observational studies on a large-scale
real-world dataset from Taobao, containing over 100M Taocode sharing records.
Inspired by our observations, we propose InfNet, a dynamic GNN-based framework
that models the information diffusion across Taocode. We then apply InfNet to
item purchasing predictions. Extensive experiments on real-world datasets
validate the effectiveness of InfNet compared with 8 state-of-the-art
baselines.
","[{'version': 'v1', 'created': 'Wed, 29 Dec 2021 08:14:36 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Dec 2021 05:35:22 GMT'}]",2022-01-03,"[['Huang', 'Xuanwen', ''], ['Yang', 'Yang', ''], ['Cheng', 'Ziqiang', ''], ['Fan', 'Shen', ''], ['Wang', 'Zhongyao', ''], ['Li', 'Juren', ''], ['Zhang', 'Jun', ''], ['Chen', 'Jingmin', '']]","['purchasing prediction', 'information diffusion', 'GNN', 'Taocode']"
836,1809.02433,Martin Boissier,Rainer Schlosser and Martin Boissier,"Dealing with the Dimensionality Curse in Dynamic Pricing Competition:
  Using Frequent Repricing to Compensate Imperfect Market Anticipations",,"Computers & Operations Research Volume 100, December 2018, Pages
  26-42",10.1016/j.cor.2018.07.011,,cs.GT q-fin.TR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Most sales applications are characterized by competition and limited demand
information. For successful pricing strategies, frequent price adjustments as
well as anticipation of market dynamics are crucial. Both effects are
challenging as competitive markets are complex and computations of optimized
pricing adjustments can be time-consuming. We analyze stochastic dynamic
pricing models under oligopoly competition for the sale of perishable goods. To
circumvent the curse of dimensionality, we propose a heuristic approach to
efficiently compute price adjustments. To demonstrate our strategy's
applicability even if the number of competitors is large and their strategies
are unknown, we consider different competitive settings in which competitors
frequently and strategically adjust their prices. For all settings, we verify
that our heuristic strategy yields promising results. We compare the
performance of our heuristic against upper bounds, which are obtained by
optimal strategies that take advantage of perfect price anticipations. We find
that price adjustment frequencies can have a larger impact on expected profits
than price anticipations. Finally, our approach has been applied on Amazon for
the sale of used books. We have used a seller's historical market data to
calibrate our model. Sales results show that our data-driven strategy
outperforms the rule-based strategy of an experienced seller by a profit
increase of more than 20%.
","[{'version': 'v1', 'created': 'Fri, 7 Sep 2018 12:20:50 GMT'}]",2018-09-10,"[['Schlosser', 'Rainer', ''], ['Boissier', 'Martin', '']]","['dynamic pricing', 'oligopoly competition', 'dynamic programming', 'data-driven strategies', 'e-commerce']"
837,1404.1129,Chengyu  Peng,"Chengyu Peng, Hong Cheng, Manchor Ko",An Efficient Two-Stage Sparse Representation Method,"21 pages, 2 figures, 4 tables",,10.1142/S0218001416510010,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are a large number of methods for solving under-determined linear
inverse problem. Many of them have very high time complexity for large
datasets. We propose a new method called Two-Stage Sparse Representation (TSSR)
to tackle this problem. We decompose the representing space of signals into two
parts, the measurement dictionary and the sparsifying basis. The dictionary is
designed to approximate a sub-Gaussian distribution to exploit its
concentration property. We apply sparse coding to the signals on the dictionary
in the first stage, and obtain the training and testing coefficients
respectively. Then we design the basis to approach an identity matrix in the
second stage, to acquire the Restricted Isometry Property (RIP) and
universality property. The testing coefficients are encoded over the basis and
the final representing coefficients are obtained. We verify that the projection
of testing coefficients onto the basis is a good approximation of the signal
onto the representing space. Since the projection is conducted on a much
sparser space, the runtime is greatly reduced. For concrete realization, we
provide an instance for the proposed TSSR. Experiments on four biometrics
databases show that TSSR is effective and efficient, comparing with several
classical methods for solving linear inverse problem.
","[{'version': 'v1', 'created': 'Fri, 4 Apr 2014 01:57:25 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Jul 2014 14:31:31 GMT'}]",2015-12-09,"[['Peng', 'Chengyu', ''], ['Cheng', 'Hong', ''], ['Ko', 'Manchor', '']]","['linear inverse problem', 'sparse representation', 'two-stage structure', 'mutualcoherence', 'bi-lipschitz', 'concentration of measure']"
838,1503.04385,Kisor Ray,Kisor Ray,Design and Implementation of Database Independent Auto Sequence Numbers,"03 pages, 02 figures","International Journal of Computer Trends and Technology,Volume-20
  Number-2,2015",10.14445/22312803/IJCTT-V20P111,,cs.DB,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Developers across the world use autonumber or auto sequences field of the
backend databases for developing both the desktop and web based data centric
applications which is easier to use at the development and deployment purpose
but can create a lot of problems under varied situations. This paper examines
how a database independent autonumber could be developed and reused solving all
the problems as well as providing the same degree of easy to use features of
autonumber offered by modern Relational Database Systems.
","[{'version': 'v1', 'created': 'Sun, 15 Mar 2015 04:09:26 GMT'}]",2015-04-01,"[['Ray', 'Kisor', '']]","['Autonumber', 'Auto Sequence', 'RDBMS', 'Application']"
839,1808.07675,Devis Tuia,"Michele Volpi, Devis Tuia","Deep multi-task learning for a geographically-regularized semantic
  segmentation of aerial images",,"ISPRS Journal of Photogrammetry and Remote Sensing, 144, pages
  48-60, 2018",10.1016/j.isprsjprs.2018.06.007,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When approaching the semantic segmentation of overhead imagery in the
decimeter spatial resolution range, successful strategies usually combine
powerful methods to learn the visual appearance of the semantic classes (e.g.
convolutional neural networks) with strategies for spatial regularization (e.g.
graphical models such as conditional random fields). In this paper, we propose
a method to learn evidence in the form of semantic class likelihoods, semantic
boundaries across classes and shallow-to-deep visual features, each one modeled
by a multi-task convolutional neural network architecture. We combine this
bottom-up information with top-down spatial regularization encoded by a
conditional random field model optimizing the label space across a hierarchy of
segments with constraints related to structural, spatial and data-dependent
pairwise relationships between regions. Our results show that such strategy
provide better regularization than a series of strong baselines reflecting
state-of-the-art technologies. The proposed strategy offers a flexible and
principled framework to include several sources of visual and structural
information, while allowing for different degrees of spatial regularization
accounting for priors about the expected output structures.
","[{'version': 'v1', 'created': 'Thu, 23 Aug 2018 09:41:47 GMT'}]",2018-08-24,"[['Volpi', 'Michele', ''], ['Tuia', 'Devis', '']]","['Semantic segmentation', 'Semantic boundary detection', 'Convolutional']"
840,2105.07812,Mehdi Dadvar,"Mehdi Dadvar, Soheil Habibian",Contemporary Research Trends in Response Robotics,,,10.1186/s40648-022-00221-z,,cs.CY cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The multidisciplinary nature of response robotics has brought about a
diversified research community with extended expertise. Motivated by the recent
accelerated rate of publications in the field, this paper analyzes the
technical content, statistics, and implications of the literature from
bibliometric standpoints. The aim is to study the global progress of response
robotics research and identify the contemporary trends. To that end, we
investigated the collaboration mapping together with the citation network to
formally recognize impactful and contributing authors, publications, sources,
institutions, funding agencies, and countries. We found how natural and
human-made disasters contributed to forming productive regional research
communities, while there are communities that only view response robotics as an
application of their research. Furthermore, through an extensive discussion on
the bibliometric results, we elucidated the philosophy behind research priority
shifts in response robotics and presented our deliberations on future research
directions.
","[{'version': 'v1', 'created': 'Wed, 28 Apr 2021 05:35:45 GMT'}, {'version': 'v2', 'created': 'Thu, 31 Mar 2022 21:59:58 GMT'}]",2022-04-04,"[['Dadvar', 'Mehdi', ''], ['Habibian', 'Soheil', '']]","['Bibliometric analysis', 'Response robotics', 'Search and rescue robots', 'Collaboration mapping', 'Research trends']"
841,1606.07389,Biljana Risteska Stojkoska Dr,Biljana Risteska Stojkoska and Vesna Kirandziska,"Improved MDS-based Algorithm for Nodes Localization in Wireless Sensor
  Networks",,"IEEE EUROCON 2013, 1-4 July 2013, Croatia, pp.608-613",10.1109/EUROCON.2013.6625044,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the recent development of technology, wireless sensor networks (WSN) are
becoming an important part of many applications. Knowing the exact location of
each sensor in the network is very important issue. Therefore, the localization
problem is a growing field of interest. Adding GPS receivers to each sensor
node is costly solution and inapplicable on nodes with limited resources.
Additionally, it is not suitable for indoor environments. In this paper, we
propose an algorithm for nodes localization in WNS based on multidimensional
scaling (MDS) technique. Our approach improves MDS by distance matrix
refinement. Using extensive simulations we investigated in details our approach
regarding different network topologies, various network parameters and
performance issues. The results from simulations show that our improved MDS
(IMDS) algorithm outperforms well known MDS-MAP algorithm [1] in terms of
accuracy.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2016 17:57:21 GMT'}]",2016-06-27,"[['Stojkoska', 'Biljana Risteska', ''], ['Kirandziska', 'Vesna', '']]","['wireless sensor networks', 'multidimensional scaling', 'nodes positioning']"
842,1706.02186,Yu Wang,"Yu Wang, Aniket Chakrabarti, David Sivakoff, Srinivasan Parthasarathy",Hierarchical Change Point Detection on Dynamic Networks,"9 pages, ACM WebSci'17",,10.1145/3091478.3091493,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies change point detection on networks with community
structures. It proposes a framework that can detect both local and global
changes in networks efficiently. Importantly, it can clearly distinguish the
two types of changes. The framework design is generic and as such several
state-of-the-art change point detection algorithms can fit in this design.
Experiments on both synthetic and real-world networks show that this framework
can accurately detect changes while achieving up to 800X speedup.
","[{'version': 'v1', 'created': 'Wed, 7 Jun 2017 13:48:28 GMT'}, {'version': 'v2', 'created': 'Sat, 17 Jun 2017 15:29:17 GMT'}]",2017-06-20,"[['Wang', 'Yu', ''], ['Chakrabarti', 'Aniket', ''], ['Sivakoff', 'David', ''], ['Parthasarathy', 'Srinivasan', '']]","['Anomaly Detection', 'Dynamic Social Networks', 'Community Detection']"
843,0811.4483,"Ga\""etan Le Guelvouit","Ga\""etan Le Guelvouit, St\'ephane Pateux","Wide spread spectrum watermarking with side information and interference
  cancellation","12 pages, 8 figures","Proc. IS&T/SPIE Electronic Imaging, vol. 5020, Santa Clara, CA,
  Jan. 2003",10.1117/12.476839,,cs.MM cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, a popular method used for additive watermarking is wide spread
spectrum. It consists in adding a spread signal into the host document. This
signal is obtained by the sum of a set of carrier vectors, which are modulated
by the bits to be embedded. To extract these embedded bits, weighted
correlations between the watermarked document and the carriers are computed.
Unfortunately, even without any attack, the obtained set of bits can be
corrupted due to the interference with the host signal (host interference) and
also due to the interference with the others carriers (inter-symbols
interference (ISI) due to the non-orthogonality of the carriers). Some recent
watermarking algorithms deal with host interference using side informed
methods, but inter-symbols interference problem is still open. In this paper,
we deal with interference cancellation methods, and we propose to consider ISI
as side information and to integrate it into the host signal. This leads to a
great improvement of extraction performance in term of signal-to-noise ratio
and/or watermark robustness.
","[{'version': 'v1', 'created': 'Fri, 28 Nov 2008 16:28:59 GMT'}]",2008-12-01,"[['Guelvouit', 'Gaëtan Le', ''], ['Pateux', 'Stéphane', '']]","['Robust watermarking', 'spread spectrum', 'side information', 'interference cancellation']"
844,2112.09852,Rui Han,"Rui Han, Qinglong Zhang, Chi Harold Liu, Guoren Wang, Jian Tang, Lydia
  Y. Chen",LegoDNN: Block-grained Scaling of Deep Neural Networks for Mobile Vision,"13 pages, 15 figures","In MobiCom'21, pages 406-419, 2021. ACM",10.1145/3447993.3483249,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks (DNNs) have become ubiquitous techniques in mobile and
embedded systems for applications such as image/object recognition and
classification. The trend of executing multiple DNNs simultaneously exacerbate
the existing limitations of meeting stringent latency/accuracy requirements on
resource constrained mobile devices. The prior art sheds light on exploring the
accuracy-resource tradeoff by scaling the model sizes in accordance to resource
dynamics. However, such model scaling approaches face to imminent challenges:
(i) large space exploration of model sizes, and (ii) prohibitively long
training time for different model combinations. In this paper, we present
LegoDNN, a lightweight, block-grained scaling solution for running multi-DNN
workloads in mobile vision systems. LegoDNN guarantees short model training
times by only extracting and training a small number of common blocks (e.g. 5
in VGG and 8 in ResNet) in a DNN. At run-time, LegoDNN optimally combines the
descendant models of these blocks to maximize accuracy under specific resources
and latency constraints, while reducing switching overhead via smart
block-level scaling of the DNN. We implement LegoDNN in TensorFlow Lite and
extensively evaluate it against state-of-the-art techniques (FLOP scaling,
knowledge distillation and model compression) using a set of 12 popular DNN
models. Evaluation results show that LegoDNN provides 1,296x to 279,936x more
options in model sizes without increasing training time, thus achieving as much
as 31.74% improvement in inference accuracy and 71.07% reduction in scaling
energy consumptions.
","[{'version': 'v1', 'created': 'Sat, 18 Dec 2021 06:04:03 GMT'}]",2021-12-21,"[['Han', 'Rui', ''], ['Zhang', 'Qinglong', ''], ['Liu', 'Chi Harold', ''], ['Wang', 'Guoren', ''], ['Tang', 'Jian', ''], ['Chen', 'Lydia Y.', '']]","['mobile vision', 'neural networks', 'block-grained scaling']"
845,1603.05746,Yong Zhan,"Yong Zhan, Mahdi Ghamkhari, Du Xu, Shaolei Ren and Hamed Mohsenian-Rad","Extending Demand Response to Tenants in Cloud Data Centers via
  Non-intrusive Workload Flexibility Pricing",,,10.1109/TSG.2016.2628886,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Participating in demand response programs is a promising tool for reducing
energy costs in data centers by modulating energy consumption. Towards this
end, data centers can employ a rich set of resource management knobs, such as
workload shifting and dynamic server provisioning. Nonetheless, these knobs may
not be readily available in a cloud data center (CDC) that serves cloud
tenants/users, because workloads in CDCs are managed by tenants themselves who
are typically charged based on a usage-based or flat-rate pricing and often
have no incentive to cooperate with the CDC operator for demand response and
cost saving. Towards breaking such ""split incentive"" hurdle, a few recent
studies have tried market-based mechanisms, such as dynamic pricing, inside
CDCs. However, such mechanisms often rely on complex designs that are hard to
implement and difficult to cope with by tenants. To address this limitation, we
propose a novel incentive mechanism that is not dynamic, i.e., it keeps pricing
for cloud resources unchanged for a long period. While it charges tenants based
on a Usage-based Pricing (UP) as used by today's major cloud operators, it
rewards tenants proportionally based on the time length that tenants set as
deadlines for completing their workloads. This new mechanism is called
Usage-based Pricing with Monetary Reward (UPMR). We demonstrate the
effectiveness of UPMR both analytically and empirically. We show that UPMR can
reduce the CDC operator's energy cost by 12.9% while increasing its profit by
4.9%, compared to the state-of-the-art approaches used by today's CDC operators
to charge their tenants.
","[{'version': 'v1', 'created': 'Fri, 18 Mar 2016 01:53:10 GMT'}]",2017-01-30,"[['Zhan', 'Yong', ''], ['Ghamkhari', 'Mahdi', ''], ['Xu', 'Du', ''], ['Ren', 'Shaolei', ''], ['Mohsenian-Rad', 'Hamed', '']]","['Demand response', 'monetary reward', 'split incentive', 'cloud data center', 'time-shiftable load', 'demand delaying']"
846,2105.00560,Brad Calder,Anna Berenberg and Brad Calder,Deployment Archetypes for Cloud Applications,,"ACM Computing Surveys, Volume 55, Issue 3, pp 1-48, 2022",10.1145/3498336,,cs.DC cs.NI,http://creativecommons.org/licenses/by/4.0/,"  This is a survey paper that explores six Cloud-based deployment archetypes
for Cloud applications and the tradeoffs between them to achieve high
availability, low end-user latency, and acceptable costs. These are (1) Zonal,
(2) Regional, (3) Multi-Regional, (4) Global, (5) Hybrid, and (6) Multi-Cloud
deployment archetypes. The goal is to classify cloud applications into a set of
deployment archetypes and deployment models that tradeoff their needs around
availability, latency, and geographical constraints with a focus on serving
applications. This enables application owners to better examine the tradeoffs
of each deployment model and what is needed for achieving the availability and
latency goals for their application.
","[{'version': 'v1', 'created': 'Sun, 2 May 2021 22:02:50 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Feb 2022 00:56:00 GMT'}]",2022-02-23,"[['Berenberg', 'Anna', ''], ['Calder', 'Brad', '']]","['Cloud Deployments', 'Cloud Archetypes', 'Cloud Architecture', 'Cloud Availability']"
847,2211.00890,Jinxiang Lai,"Jinxiang Lai, Siqian Yang, Guannan Jiang, Xi Wang, Yuxi Li, Zihui Jia,
  Xiaochen Chen, Jun Liu, Bin-Bin Gao, Wei Zhang, Yuan Xie, Chengjie Wang","Rethinking the Metric in Few-shot Learning: From an Adaptive
  Multi-Distance Perspective",,"Proceedings of the 30th ACM International Conference on Multimedia
  2022",,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Few-shot learning problem focuses on recognizing unseen classes given a few
labeled images. In recent effort, more attention is paid to fine-grained
feature embedding, ignoring the relationship among different distance metrics.
In this paper, for the first time, we investigate the contributions of
different distance metrics, and propose an adaptive fusion scheme, bringing
significant improvements in few-shot classification. We start from a naive
baseline of confidence summation and demonstrate the necessity of exploiting
the complementary property of different distance metrics. By finding the
competition problem among them, built upon the baseline, we propose an Adaptive
Metrics Module (AMM) to decouple metrics fusion into metric-prediction fusion
and metric-losses fusion. The former encourages mutual complementary, while the
latter alleviates metric competition via multi-task collaborative learning.
Based on AMM, we design a few-shot classification framework AMTNet, including
the AMM and the Global Adaptive Loss (GAL), to jointly optimize the few-shot
task and auxiliary self-supervised task, making the embedding features more
robust. In the experiment, the proposed AMM achieves 2% higher performance than
the naive metrics fusion module, and our AMTNet outperforms the
state-of-the-arts on multiple benchmark datasets.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2022 05:30:03 GMT'}]",2022-11-03,"[['Lai', 'Jinxiang', ''], ['Yang', 'Siqian', ''], ['Jiang', 'Guannan', ''], ['Wang', 'Xi', ''], ['Li', 'Yuxi', ''], ['Jia', 'Zihui', ''], ['Chen', 'Xiaochen', ''], ['Liu', 'Jun', ''], ['Gao', 'Bin-Bin', ''], ['Zhang', 'Wei', ''], ['Xie', 'Yuan', ''], ['Wang', 'Chengjie', '']]","['Few-Shot Learning', 'Distance Metric', 'Metrics Fusion']"
848,0707.4124,Jean Mairesse,"Moez Draief (LIAFA), Jean Mairesse (LIAFA)",Services within a busy period of an M/M/1 queue and Dyck paths,,"Queueing Systems / Queueing Systems Theory Appl 49, 1 (2005) 73-84",10.1007/s11134-004-5556-6,,cs.DM,,"  We analyze the service times of customers in a stable M/M/1 queue in
equilibrium depending on their position in a busy period. We give the law of
the service of a customer at the beginning, at the end, or in the middle of the
busy period. It enables as a by-product to prove that the process of instants
of beginning of services is not Poisson. We then proceed to a more precise
analysis. We consider a family of polynomial generating series associated with
Dyck paths of length 2n and we show that they provide the correlation function
of the successive services in a busy period with (n+1) customers.
","[{'version': 'v1', 'created': 'Fri, 27 Jul 2007 14:10:12 GMT'}]",2007-07-30,"[['Draief', 'Moez', '', 'LIAFA'], ['Mairesse', 'Jean', '', 'LIAFA']]","['M/M/1 queue', 'busy period', 'Dyck paths']"
849,1107.1644,Jocelyne Troccaz,"Michael Baumann (TIMC), Pierre Mozer, Vincent Daanen, Jocelyne Troccaz
  (TIMC)",Prostate biopsy tracking with deformation estimation,Medical Image Analysis (2011) epub ahead of print,,10.1016/j.media.2011.01.008,,cs.CV physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transrectal biopsies under 2D ultrasound (US) control are the current
clinical standard for prostate cancer diagnosis. The isoechogenic nature of
prostate carcinoma makes it necessary to sample the gland systematically,
resulting in a low sensitivity. Also, it is difficult for the clinician to
follow the sampling protocol accurately under 2D US control and the exact
anatomical location of the biopsy cores is unknown after the intervention.
Tracking systems for prostate biopsies make it possible to generate biopsy
distribution maps for intra- and post-interventional quality control and 3D
visualisation of histological results for diagnosis and treatment planning.
They can also guide the clinician toward non-ultrasound targets. In this paper,
a volume-swept 3D US based tracking system for fast and accurate estimation of
prostate tissue motion is proposed. The entirely image-based system solves the
patient motion problem with an a priori model of rectal probe kinematics.
Prostate deformations are estimated with elastic registration to maximize
accuracy. The system is robust with only 17 registration failures out of 786
(2%) biopsy volumes acquired from 47 patients during biopsy sessions. Accuracy
was evaluated to 0.76$\pm$0.52mm using manually segmented fiducials on 687
registered volumes stemming from 40 patients. A clinical protocol for assisted
biopsy acquisition was designed and implemented as a biopsy assistance system,
which allows to overcome the draw-backs of the standard biopsy procedure.
","[{'version': 'v1', 'created': 'Thu, 7 Jul 2011 06:31:05 GMT'}]",2011-07-11,"[['Baumann', 'Michael', '', 'TIMC'], ['Mozer', 'Pierre', '', 'TIMC'], ['Daanen', 'Vincent', '', 'TIMC'], ['Troccaz', 'Jocelyne', '', 'TIMC']]","['image-based tracking', 'prostate tracking', 'prostate biopsy maps', 'guided prostate biopsies', '3D ultrasoundregistration']"
850,1607.06264,Alejandro Betancourt,"Alejandro Betancourt, Pietro Morerio, Emilia Barakova, Lucio
  Marcenaro, Matthias Rauterberg, Carlo Regazzoni",Left/Right Hand Segmentation in Egocentric Videos,,,10.1016/j.cviu.2016.09.005,,cs.HC cs.AI cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wearable cameras allow people to record their daily activities from a
user-centered (First Person Vision) perspective. Due to their favorable
location, wearable cameras frequently capture the hands of the user, and may
thus represent a promising user-machine interaction tool for different
applications. Existent First Person Vision methods handle hand segmentation as
a background-foreground problem, ignoring two important facts: i) hands are not
a single ""skin-like"" moving element, but a pair of interacting cooperative
entities, ii) close hand interactions may lead to hand-to-hand occlusions and,
as a consequence, create a single hand-like segment. These facts complicate a
proper understanding of hand movements and interactions. Our approach extends
traditional background-foreground strategies, by including a
hand-identification step (left-right) based on a Maxwell distribution of angle
and position. Hand-to-hand occlusions are addressed by exploiting temporal
superpixels. The experimental results show that, in addition to a reliable
left/right hand-segmentation, our approach considerably improves the
traditional background-foreground hand-segmentation.
","[{'version': 'v1', 'created': 'Thu, 21 Jul 2016 11:06:05 GMT'}]",2016-09-15,"[['Betancourt', 'Alejandro', ''], ['Morerio', 'Pietro', ''], ['Barakova', 'Emilia', ''], ['Marcenaro', 'Lucio', ''], ['Rauterberg', 'Matthias', ''], ['Regazzoni', 'Carlo', '']]","['Hand-Segmentation', 'Hand-identification', 'Egocentric Vision', 'First Person Vision']"
851,1803.04860,Simone Madeo,"Alexandra Covaci and Simone Madeo and Patrick Motylinski and
  St\'ephane Vincent","NECTAR: Non-Interactive Smart Contract Protocol using Blockchain
  Technology","IEEE/ACM 1st International Workshop on Emerging Trends in Software
  Engineering for Blockchain (WETSEB 2018)",,10.1145/3194113.3194116,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Blockchain-driven technologies are considered disruptive because of the
availability of dis-intermediated, censorship-resistant and tamper-proof
digital platforms of distributed trust. Among these technologies, smart
contract platforms have the potential to take over functions usually done by
intermediaries like banks, escrow or legal services. In this paper, we
introduce a novel protocol aiming to execute smart contracts as part of a
blockchain transaction validation. We enable extensions in the execution of
smart contracts while guaranteeing their privacy, correctness and
verifiability. Man-in-the-middle attacks are prevented, since no communication
between participants is requested, and contract validations do not imply the
re-execution of the code by all the nodes in the network. However, proofs of
correct execution are stored on the blockchain and can be verified by multiple
parties. Our solution is based on programming tools which optimize the time
execution and the required memory while preserving the embedded functionality.
","[{'version': 'v1', 'created': 'Tue, 13 Mar 2018 14:57:53 GMT'}]",2018-03-14,"[['Covaci', 'Alexandra', ''], ['Madeo', 'Simone', ''], ['Motylinski', 'Patrick', ''], ['Vincent', 'Stéphane', '']]","['Smart contract', 'blockchain', 'Bitcoin', 'verifiable computation', 'noninteractive protocol']"
852,1811.02579,Dallas Card,Dallas Card and Michael Zhang and Noah A. Smith,Deep Weighted Averaging Classifiers,"13 pages, 8 figures, 5 tables, added DOI and updated to meet ACM
  formatting requirements, In Proceedings of FAT* (2019)",,10.1145/3287560.3287595,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advances in deep learning have achieved impressive gains in
classification accuracy on a variety of types of data, including images and
text. Despite these gains, however, concerns have been raised about the
calibration, robustness, and interpretability of these models. In this paper we
propose a simple way to modify any conventional deep architecture to
automatically provide more transparent explanations for classification
decisions, as well as an intuitive notion of the credibility of each
prediction. Specifically, we draw on ideas from nonparametric kernel
regression, and propose to predict labels based on a weighted sum of training
instances, where the weights are determined by distance in a learned
instance-embedding space. Working within the framework of conformal methods, we
propose a new measure of nonconformity suggested by our model, and
experimentally validate the accompanying theoretical expectations,
demonstrating improved transparency, controlled error rates, and robustness to
out-of-domain data, without compromising on accuracy or calibration.
","[{'version': 'v1', 'created': 'Tue, 6 Nov 2018 19:00:06 GMT'}, {'version': 'v2', 'created': 'Sun, 18 Nov 2018 20:00:55 GMT'}]",2018-11-20,"[['Card', 'Dallas', ''], ['Zhang', 'Michael', ''], ['Smith', 'Noah A.', '']]","['interpretability', 'credibility', 'conformal methods']"
853,1502.04600,Dariusz Dereniowski,"Bo Chen, Ed Coffman, Dariusz Dereniowski, Wieslaw Kubiak",Structural Properties of an Open Problem in Preemptive Scheduling,,Journal of Scheduling 19 (2016) 701-728,10.1007/s10951-015-0446-9,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Structural properties of optimal preemptive schedules have been studied in a
number of recent papers with a primary focus on two structural parameters: the
minimum number of preemptions necessary, and a tight lower bound on `shifts',
i.e., the sizes of intervals bounded by the times created by preemptions, job
starts, or completions. So far only rough bounds for these parameters have been
derived for specific problems. This paper sharpens the bounds on these
structural parameters for a well-known open problem in the theory of preemptive
scheduling: Instances consist of in-trees of $n$ unit-execution-time jobs with
release dates, and the objective is to minimize the total completion time on
two processors. This is among the current, tantalizing `threshold' problems of
scheduling theory: Our literature survey reveals that any significant
generalization leads to an NP-hard problem, but that any significant
simplification leads to tractable problem.
  For the above problem, we show that the number of preemptions necessary for
optimality need not exceed $2n-1$; that the number must be of order
$\Omega(\log n)$ for some instances; and that the minimum shift need not be
less than $2^{-2n+1}$. These bounds are obtained by combinatorial analysis of
optimal schedules rather than by the analysis of polytope corners for
linear-program formulations, an approach to be found in earlier papers. The
bounds immediately follow from a fundamental structural property called
`normality', by which minimal shifts of a job are exponentially decreasing
functions. In particular, the first interval between a preempted job's start
and its preemption is a multiple of 1/2, the second such interval is a multiple
of 1/4, and in general, the $i$-th preemption occurs at a multiple of $2^{-i}$.
We expect the new structural properties to play a prominent role in finally
settling a vexing, still-open question of complexity.
","[{'version': 'v1', 'created': 'Mon, 16 Feb 2015 16:22:38 GMT'}]",2021-03-05,"[['Chen', 'Bo', ''], ['Coffman', 'Ed', ''], ['Dereniowski', 'Dariusz', ''], ['Kubiak', 'Wieslaw', '']]","['preemption', 'parallel machines', 'in-tree', 'release date', 'scheduling algorithm', 'total completion time']"
854,1007.3700,Enrico Pontelli,"Chitta Baral, Gregory Gelfond, Enrico Pontelli, Tran Cao Son","Logic Programming for Finding Models in the Logics of Knowledge and its
  Applications: A Case Study","16 pages, 1 figure, International Conference on Logic Programming
  2010","Theory and Practice of Logic Programming, Volume 10, Special Issue
  4-6, July 2010, pages 675-690",10.1017/S1471068410000359,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The logics of knowledge are modal logics that have been shown to be effective
in representing and reasoning about knowledge in multi-agent domains.
Relatively few computational frameworks for dealing with computation of models
and useful transformations in logics of knowledge (e.g., to support multi-agent
planning with knowledge actions and degrees of visibility) have been proposed.
This paper explores the use of logic programming (LP) to encode interesting
forms of logics of knowledge and compute Kripke models. The LP modeling is
expanded with useful operators on Kripke structures, to support multi-agent
planning in the presence of both world-altering and knowledge actions. This
results in the first ever implementation of a planner for this type of complex
multi-agent domains.
","[{'version': 'v1', 'created': 'Wed, 21 Jul 2010 17:44:02 GMT'}]",2010-07-22,"[['Baral', 'Chitta', ''], ['Gelfond', 'Gregory', ''], ['Pontelli', 'Enrico', ''], ['Son', 'Tran Cao', '']]","['planning', 'multi-agents', 'modal logics']"
855,1711.06039,Binanda Sengupta,Binanda Sengupta and Sushmita Ruj,Cloud Data Auditing Using Proofs of Retrievability,"A version has been published as a book chapter in Guide to Security
  Assurance for Cloud Computing (Springer International Publishing Switzerland
  2015)",,10.1007/978-3-319-25988-8_11,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud servers offer data outsourcing facility to their clients. A client
outsources her data without having any copy at her end. Therefore, she needs a
guarantee that her data are not modified by the server which may be malicious.
Data auditing is performed on the outsourced data to resolve this issue.
Moreover, the client may want all her data to be stored untampered. In this
chapter, we describe proofs of retrievability (POR) that convince the client
about the integrity of all her data.
","[{'version': 'v1', 'created': 'Thu, 16 Nov 2017 11:37:46 GMT'}]",2017-11-17,"[['Sengupta', 'Binanda', ''], ['Ruj', 'Sushmita', '']]","['Cloud computing', 'Data auditing', 'Proofs of retrievability', 'Erasurecode', 'Message authentication code', 'Bilinear maps', 'Oblivious RAM']"
856,1512.06942,EPTCS,"Salvador Lucas (DSIC, Universitat Polit\`ecnica de Val\`encia, Spain)","Termination of canonical context-sensitive rewriting and productivity of
  rewrite systems","In Proceedings PROLE 2015, arXiv:1512.06178","EPTCS 200, 2015, pp. 18-31",10.4204/EPTCS.200.2,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Termination of programs, i.e., the absence of infinite computations, ensures
the existence of normal forms for all initial expressions, thus providing an
essential ingredient for the definition of a normalization semantics for
functional programs. In lazy functional languages, though, infinite data
structures are often delivered as the outcome of computations. For instance,
the list of all prime numbers can be returned as a neverending stream of
numerical expressions or data structures. If such streams are allowed,
requiring termination is hopeless. In this setting, the notion of productivity
can be used to provide an account of computations with infinite data
structures, as it ""captures the idea of computability, of progress of
infinite-list programs"" (B.A. Sijtsma, On the Productivity of Recursive List
Definitions, ACM Transactions on Programming Languages and Systems
11(4):633-649, 1989). However, in the realm of Term Rewriting Systems, which
can be seen as (first-order, untyped, unconditional) functional programs,
termination of Context-Sensitive Rewriting (CSR) has been showed equivalent to
productivity of rewrite systems through appropriate transformations. In this
way, tools for proving termination of CSR can be used to prove productivity. In
term rewriting, CSR is the restriction of rewriting that arises when reductions
are allowed on selected arguments of function symbols only. In this paper we
show that well-known results about the computational power of CSR are useful to
better understand the existing connections between productivity of rewrite
systems and termination of CSR, and also to obtain more powerful techniques to
prove productivity of rewrite systems.
","[{'version': 'v1', 'created': 'Tue, 22 Dec 2015 03:16:22 GMT'}]",2015-12-23,"[['Lucas', 'Salvador', '', 'DSIC, Universitat Politècnica de València, Spain']]","['context-sensitive rewriting', 'functional programming', 'productivity', 'termination']"
857,1706.06368,Carlos Castillo,"Meike Zehlike, Francesco Bonchi, Carlos Castillo, Sara Hajian, Mohamed
  Megahed, Ricardo Baeza-Yates",FA*IR: A Fair Top-k Ranking Algorithm,"In Proceedings of the 26th ACM International Conference on
  Information and Knowledge Management (CIKM'17). This version corrects an
  error on Table 4",,10.1145/3132847.3132938,,cs.CY cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we define and solve the Fair Top-k Ranking problem, in which we
want to determine a subset of k candidates from a large pool of n >> k
candidates, maximizing utility (i.e., select the ""best"" candidates) subject to
group fairness criteria. Our ranked group fairness definition extends group
fairness using the standard notion of protected groups and is based on ensuring
that the proportion of protected candidates in every prefix of the top-k
ranking remains statistically above or indistinguishable from a given minimum.
  Utility is operationalized in two ways: (i) every candidate included in the
top-$k$ should be more qualified than every candidate not included; and (ii)
for every pair of candidates in the top-k, the more qualified candidate should
be ranked above. An efficient algorithm is presented for producing the Fair
Top-k Ranking, and tested experimentally on existing datasets as well as new
datasets released with this paper, showing that our approach yields small
distortions with respect to rankings that maximize utility without considering
fairness criteria.
  To the best of our knowledge, this is the first algorithm grounded in
statistical tests that can mitigate biases in the representation of an
under-represented group along a ranked list.
","[{'version': 'v1', 'created': 'Tue, 20 Jun 2017 11:20:12 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Sep 2017 10:45:32 GMT'}, {'version': 'v3', 'created': 'Mon, 2 Jul 2018 12:58:10 GMT'}]",2018-07-03,"[['Zehlike', 'Meike', ''], ['Bonchi', 'Francesco', ''], ['Castillo', 'Carlos', ''], ['Hajian', 'Sara', ''], ['Megahed', 'Mohamed', ''], ['Baeza-Yates', 'Ricardo', '']]","['Algorithmic fairness', 'Bias in Computer Systems', 'Ranking', 'Top-kselection']"
858,1003.3533,Rajkumar Kannan,"Rajkumar Kannan, Frederic Andres","Towards Automated Lecture Capture, Navigation and Delivery System for
  Web-Lecture on Demand","3rd International Conference on Data Management, March 2010, India","Book Chapter in Innovations and Advances in Computer Science and
  Engineering, MacMillan Publishers, 386-394, 2010",,,cs.MM cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Institutions all over the world are continuously exploring ways to use ICT in
improving teaching and learning effectiveness. The use of course web pages,
discussion groups, bulletin boards, and e-mails have shown considerable impact
on teaching and learning in significant ways, across all disciplines. ELearning
has emerged as an alternative to traditional classroom-based education and
training and web lectures can be a powerful addition to traditional lectures.
They can even serve as a main content source for learning, provided users can
quickly navigate and locate relevant pages in a web lecture. A web lecture
consists of video and audio of the presenter and slides complemented with
screen capturing. In this paper, an automated approach for recording live
lectures and for browsing available web lectures for on-demand applications by
end users is presented.
","[{'version': 'v1', 'created': 'Thu, 18 Mar 2010 09:27:16 GMT'}]",2010-03-19,"[['Kannan', 'Rajkumar', ''], ['Andres', 'Frederic', '']]","['Lecture Recording', 'Web Lectures', 'Multimedia Navigation', 'SVG', 'Flex2']"
859,1003.1967,"Yann-A\""el Le Borgne","Yann-A\""el Le Borgne, Sylvain Raybaud, Gianluca Bontempi",Distributed Principal Component Analysis for Wireless Sensor Networks,,"Sensors 2008, 8(8), 4821-4850",10.3390/s8084821,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Principal Component Analysis (PCA) is a data dimensionality reduction
technique well-suited for processing data from sensor networks. It can be
applied to tasks like compression, event detection, and event recognition. This
technique is based on a linear transform where the sensor measurements are
projected on a set of principal components. When sensor measurements are
correlated, a small set of principal components can explain most of the
measurements variability. This allows to significantly decrease the amount of
radio communication and of energy consumption. In this paper, we show that the
power iteration method can be distributed in a sensor network in order to
compute an approximation of the principal components. The proposed
implementation relies on an aggregation service, which has recently been shown
to provide a suitable framework for distributing the computation of a linear
transform within a sensor network. We also extend this previous work by
providing a detailed analysis of the computational, memory, and communication
costs involved. A compression experiment involving real data validates the
algorithm and illustrates the tradeoffs between accuracy and communication
costs.
","[{'version': 'v1', 'created': 'Tue, 9 Mar 2010 20:11:53 GMT'}]",2010-03-13,"[['Borgne', 'Yann-Aël Le', ''], ['Raybaud', 'Sylvain', ''], ['Bontempi', 'Gianluca', '']]","['Wireless sensor networks', 'distributed principal component analysis', 'in-networkaggregation', 'power iteration method']"
860,1407.7288,Krzysztof Drewniak,"Krzysztof Drewniak, Joseph Helsing, Armin R. Mikler","A Method for Reducing the Severity of Epidemics by Allocating Vaccines
  According to Centrality","10 pages, accepted to ACM BCB 2014",,10.1145/2649387.2649409,,cs.SI cs.CE physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One long-standing question in epidemiological research is how best to
allocate limited amounts of vaccine or similar preventative measures in order
to minimize the severity of an epidemic. Much of the literature on the problem
of vaccine allocation has focused on influenza epidemics and used mathematical
models of epidemic spread to determine the effectiveness of proposed methods.
Our work applies computational models of epidemics to the problem of
geographically allocating a limited number of vaccines within several Texas
counties. We developed a graph-based, stochastic model for epidemics that is
based on the SEIR model, and tested vaccine allocation methods based on
multiple centrality measures. This approach provides an alternative method for
addressing the vaccine allocation problem, which can be combined with more
conventional approaches to yield more effective epidemic suppression
strategies. We found that allocation methods based on in-degree and inverse
betweenness centralities tended to be the most effective at containing
epidemics.
","[{'version': 'v1', 'created': 'Sun, 27 Jul 2014 22:26:36 GMT'}]",2014-12-02,"[['Drewniak', 'Krzysztof', ''], ['Helsing', 'Joseph', ''], ['Mikler', 'Armin R.', '']]","['Computational epidemiology', 'health informatics', 'vaccine distribution', 'centrality measures']"
861,0710.3916,Bernard Cousin,"Wojtek Bigos (IRISA), St\'ephane Gosselin (IRISA), Bernard Cousin
  (IRISA), Morgane Le Foll (IRISA), Hisao Nakajima (IRISA)","Optimized Design of Survivable MPLS over Optical Transport Networks.
  Optical Switching and Networking",,"Optical Switching and Networking 3, 3-4 (2006) 202-218",10.1016/j.osn.2006.08.001,,cs.NI cs.PF,,"  In this paper we study different options for the survivability implementation
in MPLS over Optical Transport Networks in terms of network resource usage and
configuration cost. We investigate two approaches to the survivability
deployment: single layer and multilayer survivability and present various
methods for spare capacity allocation (SCA) to reroute disrupted traffic. The
comparative analysis shows the influence of the traffic granularity on the
survivability cost: for high bandwidth LSPs, close to the optical channel
capacity, the multilayer survivability outperforms the single layer one,
whereas for low bandwidth LSPs the single layer survivability is more
cost-efficient. For the multilayer survivability we demonstrate that by mapping
efficiently the spare capacity of the MPLS layer onto the resources of the
optical layer one can achieve up to 22% savings in the total configuration cost
and up to 37% in the optical layer cost. Further savings (up to 9 %) in the
wavelength use can be obtained with the integrated approach to network
configuration over the sequential one, however, at the increase in the
optimization problem complexity. These results are based on a cost model with
actual technology pricing and were obtained for networks targeted to a
nationwide coverage.
","[{'version': 'v1', 'created': 'Sun, 21 Oct 2007 09:40:38 GMT'}]",2007-10-23,"[['Bigos', 'Wojtek', '', 'IRISA'], ['Gosselin', 'Stéphane', '', 'IRISA'], ['Cousin', 'Bernard', '', 'IRISA'], ['Foll', 'Morgane Le', '', 'IRISA'], ['Nakajima', 'Hisao', '', 'IRISA']]","['integer linear program', 'MPLS over OTN', 'multilayer optimization', 'survivability design', 'spare capacity allocation', 'protection routing']"
862,1106.1194,Angelos Anastassi,Angelos A. Anastassi,"Constructing Runge-Kutta Methods with the Use of Artificial Neural
  Networks",The final publication is available at link.springer.com,,10.1007/2Fs00521-013-1476-x,,cs.NE math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A methodology that can generate the optimal coefficients of a numerical
method with the use of an artificial neural network is presented in this work.
The network can be designed to produce a finite difference algorithm that
solves a specific system of ordinary differential equations numerically. The
case we are examining here concerns an explicit two-stage Runge-Kutta method
for the numerical solution of the two-body problem. Following the
implementation of the network, the latter is trained to obtain the optimal
values for the coefficients of the Runge-Kutta method. The comparison of the
new method to others that are well known in the literature proves its
efficiency and demonstrates the capability of the network to provide efficient
algorithms for specific problems.
","[{'version': 'v1', 'created': 'Mon, 6 Jun 2011 20:37:55 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Sep 2013 15:08:32 GMT'}]",2013-09-20,"[['Anastassi', 'Angelos A.', '']]","['Feedforward artificial neural networks', 'Gradient descent', 'Backpropagation', 'Initial value problems', 'Ordinary differential equations', 'Runge-Kuttamethods']"
863,1403.3297,Samarendra Nath Sur,"Samarendra Nath Sur, Dr. Rabindranath Bera and Dr. Bansibadan Maji","Channel Capacity Analysis of MIMO System in Correlated Nakagami-m Fading
  Environment","5 pages, 6 figures,Published with International Journal of
  Engineering Trends and Technology (IJETT)","IJETT, V9(3),101-105 March 2014. ISSN:2231-5381",10.14445/22315381/IJETT-V9P221,,cs.IT math.IT,http://creativecommons.org/licenses/by/3.0/,"  We consider Vertical Bell Laboratories Layered Space-Time (V-BLAST) systems
in correlated multiple-input multiple-output (MIMO) Nakagami-m fading channels
with equal power allocated to each transmit antenna and also we consider that
the channel state information (CSI) is available only at the receiver. Now for
practical application, study of the VBLAST MIMO system in correlated
environment is necessary. In this paper, we present a detailed study of the
channel capacity in correlated and uncorrelated channel condition and also
validated the result with appropriate mathematical relation.
","[{'version': 'v1', 'created': 'Thu, 13 Mar 2014 15:19:36 GMT'}]",2014-03-14,"[['Sur', 'Samarendra Nath', ''], ['Bera', 'Dr. Rabindranath', ''], ['Maji', 'Dr. Bansibadan', '']]","['BLAST', 'CSI', 'Capacity', 'SNR', 'MMSE', 'ZF']"
864,1704.07171,Vincent Labatut,"G\""unce Keziban Orman, Vincent Labatut (LIA), Ahmet Teoman Naskali",Exploring the Evolution of Node Neighborhoods in Dynamic Networks,,"Physica A, Elsevier, 482, pp.375-391 (2017)",10.1016/j.physa.2017.04.084,,cs.SI cs.IR physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dynamic Networks are a popular way of modeling and studying the behavior of
evolving systems. However, their analysis constitutes a relatively recent
subfield of Network Science, and the number of available tools is consequently
much smaller than for static networks. In this work, we propose a method
specifically designed to take advantage of the longitudinal nature of dynamic
networks. It characterizes each individual node by studying the evolution of
its direct neighborhood, based on the assumption that the way this neighborhood
changes reflects the role and position of the node in the whole network. For
this purpose, we define the concept of \textit{neighborhood event}, which
corresponds to the various transformations such groups of nodes can undergo,
and describe an algorithm for detecting such events. We demonstrate the
interest of our method on three real-world networks: DBLP, LastFM and Enron. We
apply frequent pattern mining to extract meaningful information from temporal
sequences of neighborhood events. This results in the identification of
behavioral trends emerging in the whole network, as well as the individual
characterization of specific nodes. We also perform a cluster analysis, which
reveals that, in all three networks, one can distinguish two types of nodes
exhibiting different behaviors: a very small group of active nodes, whose
neighborhood undergo diverse and frequent events, and a very large group of
stable nodes.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 12:18:21 GMT'}, {'version': 'v2', 'created': 'Fri, 5 May 2017 12:26:08 GMT'}]",2017-05-08,"[['Orman', 'Günce Keziban', '', 'LIA'], ['Labatut', 'Vincent', '', 'LIA'], ['Naskali', 'Ahmet Teoman', '']]","['Dynamic networks', 'Network Evolution', 'Network Topology', 'Neighborhood Events']"
865,1807.02740,Wentai Zhang,"Wentai Zhang, Haoliang Jiang, Zhangsihao Yang, Soji Yamakawa, Kenji
  Shimada, Levent Burak Kara",Data-driven Upsampling of Point Clouds,Preprint submitted to CAD,"Computer-Aided Design, Volume 112, Pages 1-13, 2019",10.1016/j.cad.2019.02.006.,,cs.CV cs.CG cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  High quality upsampling of sparse 3D point clouds is critically useful for a
wide range of geometric operations such as reconstruction, rendering, meshing,
and analysis. In this paper, we propose a data-driven algorithm that enables an
upsampling of 3D point clouds without the need for hard-coded rules. Our
approach uses a deep network with Chamfer distance as the loss function,
capable of learning the latent features in point clouds belonging to different
object categories. We evaluate our algorithm across different amplification
factors, with upsampling learned and performed on objects belonging to the same
category as well as different categories. We also explore the desirable
characteristics of input point clouds as a function of the distribution of the
point samples. Finally, we demonstrate the performance of our algorithm in
single-category training versus multi-category training scenarios. The final
proposed model is compared against a baseline, optimization-based upsampling
method. Results indicate that our algorithm is capable of generating more
uniform and accurate upsamplings.
","[{'version': 'v1', 'created': 'Sun, 8 Jul 2018 02:19:09 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Dec 2018 03:49:16 GMT'}]",2019-06-24,"[['Zhang', 'Wentai', ''], ['Jiang', 'Haoliang', ''], ['Yang', 'Zhangsihao', ''], ['Yamakawa', 'Soji', ''], ['Shimada', 'Kenji', ''], ['Kara', 'Levent Burak', '']]","['point cloud', 'upsampling', 'deep learning', 'neural network']"
866,2110.06107,Guillaume Allais,Guillaume Allais,Generic Level Polymorphic N-ary Functions,Draft of the Tyde19 paper,"TyDe 2019: Proceedings of the 4th ACM SIGPLAN International
  Workshop on Type-Driven Development (Pages 14-26)",10.1145/3331554,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Agda's standard library struggles in various places with n-ary functions and
relations. It introduces congruence and substitution operators for functions of
arities one and two, and provides users with convenient combinators for
manipulating indexed families of arity exactly one.
  After a careful analysis of the kinds of problems the unifier can easily
solve, we design a unifier-friendly representation of n-ary functions. This
allows us to write generic programs acting on n-ary functions which
automatically reconstruct the representation of their inputs' types by
unification. In particular, we can define fully level polymorphic n-ary
versions of congruence, substitution and the combinators for indexed families,
all requiring minimal user input.
","[{'version': 'v1', 'created': 'Tue, 12 Oct 2021 15:54:35 GMT'}]",2021-10-13,"[['Allais', 'Guillaume', '']]","['Dependent types', 'Arity-generic programming', 'Universe polymorphism', 'Agda']"
867,1511.09065,Richard McClatchey,"Richard McClatchey, Jetendr Shamdasani, Andrew Branson, Kamran Munir
  and Zsolt Kovacs",Traceability and Provenance in Big Data Medical Systems,"6 pages, 3 diagrams. Proc of the 28th Int Symposium on Computer-Based
  Medical Systems (CBMS 2015) Sao Carlos, Brazil. June 2015. arXiv admin note:
  text overlap with arXiv:1502.01545",,10.1109/CBMS.2015.10,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Providing an appropriate level of accessibility to and tracking of data or
process elements in large volumes of medical data, is an essential requirement
in the Big Data era. Researchers require systems that provide traceability of
information through provenance data capture and management to support their
clinical analyses. We present an approach that has been adopted in the neuGRID
and N4U projects, which aimed to provide detailed traceability to support
research analysis processes in the study of biomarkers for Alzheimers disease,
but is generically applicable across medical systems. To facilitate the
orchestration of complex, large-scale analyses in these projects we have
adapted CRISTAL, a workflow and provenance tracking solution. The use of
CRISTAL has provided a rich environment for neuroscientists to track and manage
the evolution of data and workflow usage over time in neuGRID and N4U.
","[{'version': 'v1', 'created': 'Sun, 29 Nov 2015 19:05:31 GMT'}]",2015-12-01,"[['McClatchey', 'Richard', ''], ['Shamdasani', 'Jetendr', ''], ['Branson', 'Andrew', ''], ['Munir', 'Kamran', ''], ['Kovacs', 'Zsolt', '']]","['; Provenance', 'Workflows', 'Biomedical Analysis', 'Grid Computing', 'Neuroimaging']"
868,1305.6394,Hoang Tuan Minh Nguyen,"Minh Hoang-Tuan Nguyen, Kok Kiong Tan, Sunan Huang",Enhanced Predictive Ratio Control of Interacting Systems,"9 pages, 7 figures, 1 table","Journal of Process Control, Volume 21, Issue 7, August 2011, Pages
  1115 to 1125",10.1016/j.jprocont.2011.04.002,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ratio control for two interacting processes is proposed with a PID
feedforward design based on model predictive control (MPC) scheme. At each
sampling instant, the MPC control action minimizes a state-dependent
performance index associated with a PID-type state vector, thus yielding a
PID-type control structure. Compared to the standard MPC formulations with
separated single-variable control, such a control action allows one to take
into account the non-uniformity of the two process outputs. After reformulating
the MPC control law as a PID control law, we provide conditions for prediction
horizon and weighting matrices so that the closed-loop control is
asymptotically stable, and show the effectiveness of the approach with
simulation and experiment results.
","[{'version': 'v1', 'created': 'Tue, 28 May 2013 07:44:26 GMT'}]",2016-11-26,"[['Nguyen', 'Minh Hoang-Tuan', ''], ['Tan', 'Kok Kiong', ''], ['Huang', 'Sunan', '']]","['Robust tracking', 'constrained linear systems', 'model predictive control', 'PID gain scheduling']"
869,1507.06778,Ingmar Dasseville,"Ingmar Dasseville, Matthias van der Hallen, Gerda Janssens, Marc
  Denecker",Semantics of templates in a compositional framework for building logics,,Theory and Practice of Logic Programming 15 (2015) 681-695,10.1017/S1471068415000319,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a growing need for abstractions in logic specification languages
such as FO(.) and ASP. One technique to achieve these abstractions are
templates (sometimes called macros). While the semantics of templates are
virtually always described through a syntactical rewriting scheme, we present
an alternative view on templates as second order definitions. To extend the
existing definition construct of FO(.) to second order, we introduce a powerful
compositional framework for defining logics by modular integration of logic
constructs specified as pairs of one syntactical and one semantical inductive
rule. We use the framework to build a logic of nested second order definitions
suitable to express templates. We show that under suitable restrictions, the
view of templates as macros is semantically correct and that adding them does
not extend the descriptive complexity of the base logic, which is in line with
results of existing approaches.
","[{'version': 'v1', 'created': 'Fri, 24 Jul 2015 08:29:52 GMT'}]",2020-02-19,"[['Dasseville', 'Ingmar', ''], ['van der Hallen', 'Matthias', ''], ['Janssens', 'Gerda', ''], ['Denecker', 'Marc', '']]","['compositionality', 'modularity', 'templates', 'macros', 'semantics', 'second orderlogic']"
870,1604.08245,Muhammad Fahad Khan,"Saira Beg, M. Fahad Khan, Faisal Baig",Text writing in the air,"19 pages, 19 figures,2 tables. see
  http://www.tandfonline.com/doi/abs/10.1080/15980316.2013.860928?journalCode=tjid20",,10.1080/15980316.2013.860928,,cs.MM,http://creativecommons.org/licenses/by/4.0/,"  This paper presents a real time video based pointing method which allows
sketching and writing of English text over air in front of mobile camera.
Proposed method have two main tasks: first it track the colored finger tip in
the video frames and then apply English OCR over plotted images in order to
recognize the written characters. Moreover, proposed method provides a natural
human-system interaction in such way that it do not require keypad, stylus, pen
or glove etc for character input. For the experiments, we have developed an
application using OpenCv with JAVA language. We tested the proposed method on
Samsung Galaxy3 android mobile. Results show that proposed algorithm gains the
average accuracy of 92.083% when tested for different shaped alphabets. Here,
more than 3000 different Magnetic 3D shaped characters were used [Ref:
http://learnrnd.com/news.php?id=Magnetic_3D_Bio_Printing]. Our proposed system
is the software based approach and relevantly very simple, fast and easy. It
does not require sensors or any hardware rather than camera and red tape.
Moreover, proposed methodology can be applicable for all disconnected languages
but having one issue that it is color sensitive in such a way that existence of
any red color in the background before starting the character writing can lead
to false results.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2016 21:11:22 GMT'}]",2016-04-29,"[['Beg', 'Saira', ''], ['Khan', 'M. Fahad', ''], ['Baig', 'Faisal', '']]","['Object Tracking', 'Computer Vision', 'Human Computer Interaction', 'Optical Character Reorganization']"
871,1808.00417,Carmine Dodaro,"Carmine Dodaro, Philip Gasteiger, Kristian Reale, Francesco Ricca,
  Konstantin Schekotihin",Debugging Non-Ground ASP Programs: Technique and Graphical Tools,"27 pages, 6 figures, Under consideration in Theory and Practice of
  Logic Programming (TPLP)",Theory and Practice of Logic Programming 19 (2019) 290-316,10.1017/S1471068418000492,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Answer Set Programming (ASP) is one of the major declarative programming
paradigms in the area of logic programming and non-monotonic reasoning. Despite
that ASP features a simple syntax and an intuitive semantics, errors are common
during the development of ASP programs. In this paper we propose a novel
debugging approach allowing for interactive localization of bugs in non-ground
programs. The new approach points the user directly to a set of non-ground
rules involved in the bug, which might be refined (up to the point in which the
bug is easily identified) by asking the programmer a sequence of questions on
an expected answer set. The approach has been implemented on top of the ASP
solver WASP. The resulting debugger has been complemented by a user-friendly
graphical interface, and integrated in ASPIDE, a rich IDE for answer set
programs. In addition, an empirical analysis shows that the new debugger is not
affected by the grounding blowup limiting the application of previous
approaches based on meta-programming. Under consideration in Theory and
Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Wed, 1 Aug 2018 16:59:01 GMT'}]",2020-02-19,"[['Dodaro', 'Carmine', ''], ['Gasteiger', 'Philip', ''], ['Reale', 'Kristian', ''], ['Ricca', 'Francesco', ''], ['Schekotihin', 'Konstantin', '']]","['Answer Set Programming', 'Debugging', 'Graphical User Interface']"
872,1608.06148,Chandrajit M,"Chandrajit M, Girisha R and Vasudev T","Multiple objects tracking in surveillance video using color and Hu
  moments","13 pages, Signal & Image Processing : An International Journal
  (SIPIJ) Vol.7, No.3, June 2016",,10.5121/sipij.2016.7302,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multiple objects tracking finds its applications in many high level vision
analysis like object behaviour interpretation and gait recognition. In this
paper, a feature based method to track the multiple moving objects in
surveillance video sequence is proposed. Object tracking is done by extracting
the color and Hu moments features from the motion segmented object blob and
establishing the association of objects in the successive frames of the video
sequence based on Chi-Square dissimilarity measure and nearest neighbor
classifier. The benchmark IEEE PETS and IEEE Change Detection datasets has been
used to show the robustness of the proposed method. The proposed method is
assessed quantitatively using the precision and recall accuracy metrics.
Further, comparative evaluation with related works has been carried out to
exhibit the efficacy of the proposed method.
","[{'version': 'v1', 'created': 'Mon, 22 Aug 2016 12:42:46 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Aug 2016 13:11:35 GMT'}]",2016-08-30,"[['M', 'Chandrajit', ''], ['R', 'Girisha', ''], ['T', 'Vasudev', '']]","['Video surveillance', 'Color moments', 'Hu moments', 'Object tracking', 'Multiple Objects Tracking']"
873,1306.2414,Paulo Sergio Santos,Paulo Sergio Medeiros dos Santos and Guilherme Horta Travassos,"Action Research Can Swing the Balance in Experimental Software
  Engineering","77 pages, Advances in Computers (2011)",,10.1016/B978-0-12-385510-7.00005-9,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In general, professionals still ignore scientific evidence in place of expert
opinions in most of their decision-making. For this reason, it is still common
to see the adoption of new software technologies in the field without any
scientific basis or well-grounded criteria, but on the opinions of experts.
Experimental Software Engineering is of paramount importance to provide the
foundations to understand the limits and applicability of software
technologies. The need to better observe and understand the practice of
Software Engineering leads us to look for alternative experimental approaches
to support our studies. Different research strategies can be used to explore
different Software Engineering practices. Action Research can be seen as one
alternative to intensify the conducting of important experimental studies with
results of great value while investigating the Software Engineering practices
in depth. In this paper, a discussion on the use of Action Research in Software
Engineering is presented. Aiming at better explaining the application of Action
Research, an experimental study (in vivo) on the investigation of the
subjective decisions of software developers, concerned with the refactoring of
source code to improve source code quality in a distributed software
development context is depicted. In addition, some guidance on how to
accomplish an Action Research study in Software Engineering supplement the
discussions.
","[{'version': 'v1', 'created': 'Tue, 11 Jun 2013 03:47:35 GMT'}]",2013-06-12,"[['Santos', 'Paulo Sergio Medeiros dos', ''], ['Travassos', 'Guilherme Horta', '']]","['Action Research', 'Refactoring', 'in vivo Study', 'Software Engineering Theory', 'Scientific Knowledge Management', 'Experimental Software Engineering']"
874,1707.08134,Daniel Ziener,"Bernhard Schmidt, Daniel Ziener, J\""urgen Teich, Christian Z\""ollner","Optimizing Scrubbing by Netlist Analysis for FPGA Configuration Bit
  Classification and Floorplanning",,"Integration, the VLSI Journal 59C (2017) pp. 98-108",10.1016/j.vlsi.2017.06.012,,cs.AR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Existing scrubbing techniques for SEU mitigation on FPGAs do not guarantee an
error-free operation after SEU recovering if the affected configuration bits do
belong to feedback loops of the implemented circuits. In this paper, we a)
provide a netlist-based circuit analysis technique to distinguish so-called
critical configuration bits from essential bits in order to identify
configuration bits which will need also state-restoring actions after a
recovered SEU and which not. Furthermore, b) an alternative classification
approach using fault injection is developed in order to compare both
classification techniques. Moreover, c) we will propose a floorplanning
approach for reducing the effective number of scrubbed frames and d),
experimental results will give evidence that our optimization methodology not
only allows to detect errors earlier but also to minimize the
Mean-Time-To-Repair (MTTR) of a circuit considerably. In particular, we show
that by using our approach, the MTTR for datapath-intensive circuits can be
reduced by up to 48.5% in comparison to standard approaches.
","[{'version': 'v1', 'created': 'Tue, 25 Jul 2017 18:03:20 GMT'}]",2017-07-27,"[['Schmidt', 'Bernhard', ''], ['Ziener', 'Daniel', ''], ['Teich', 'Jürgen', ''], ['Zöllner', 'Christian', '']]","['Single Event Upsets', 'FPGA Scrubbing', 'Configuration Bit Partitioning', 'Floorplanning', 'Fault Injection']"
875,1805.06997,Mark Velednitsky,Mark Velednitsky,"Short Combinatorial Proof that the DFJ Polytope is contained in the MTZ
  Polytope for the Asymmetric Traveling Salesman Problem",,Operations Research Letters 45.4 (2017): 323-324,10.1016/j.orl.2017.04.010,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For the Asymmetric Traveling Salesman Problem (ATSP), it is known that the
Dantzig-Fulkerson-Johnson (DFJ) polytope is contained in the
Miller-Tucker-Zemlin (MTZ) polytope. The analytic proofs of this fact are quite
long. Here, we present a proof which is combinatorial and significantly shorter
by relating the formulation to distances in a modified graph.
","[{'version': 'v1', 'created': 'Thu, 17 May 2018 23:59:25 GMT'}]",2018-10-16,"[['Velednitsky', 'Mark', '']]","['salesman', 'polytope', 'mtz', 'subtour', 'combinatorial']"
876,1603.08827,Tom\'a\v{s} Dvo\v{r}\'ak,"Tom\'a\v{s} Dvo\v{r}\'ak, Petr Gregor and V\'aclav Koubek",Generalized Gray codes with prescribed ends,"30 pages, 2 figures",Theoretical Computer Science 668 (2017) 70-94,10.1016/j.tcs.2017.01.010,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An $n$-bit Gray code is a sequence of all $n$-bit strings such that
consecutive strings differ in a single bit. It is well-known that given
$\alpha,\beta\in\{0,1\}^n$, an $n$-bit Gray code between $\alpha$ and $\beta$
exists iff the Hamming distance $d(\alpha,\beta)$ of $\alpha$ and $\beta$ is
odd. We generalize this classical result to $k$ pairwise disjoint pairs
$\alpha_i, \beta_i\in\{0,1\}^n$: if $d(\alpha_i,\beta_i)$ is odd for all $i$
and $k<n$, then the set of all $n$-bit strings can be partitioned into $k$
sequences such that the $i$-th sequence leads from $\alpha_i$ to $\beta_i$ and
consecutive strings differ in a single bit. This holds for every $n>1$ with one
exception in the case when $n = k + 1 = 4$. Our result is optimal in the sense
that for every $n>2$ there are $n$ pairwise disjoint pairs
$\alpha_i,\beta_i\in\{0,1\}^n$ with $d(\alpha_i,\beta_i)$ odd for which such
sequences do not exist.
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2016 16:16:35 GMT'}]",2017-03-07,"[['Dvořák', 'Tomáš', ''], ['Gregor', 'Petr', ''], ['Koubek', 'Václav', '']]","['Gray code', 'Hamiltonian path', 'hypercube', 'path partition', 'prescribed endvertices']"
877,1705.00694,Stepan Kuznetsov,"Max Kanovich, Stepan Kuznetsov, Glyn Morrill, Andre Scedrov","A polynomial time algorithm for the Lambek calculus with brackets of
  bounded order",,"Proc. FSCD 2017, LIPIcs vol. 84, 22:1-22:17",10.4230/LIPIcs.FSCD.2017.22,,cs.LO cs.CL cs.DS cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lambek calculus is a logical foundation of categorial grammar, a linguistic
paradigm of grammar as logic and parsing as deduction. Pentus (2010) gave a
polynomial-time algorithm for determ- ining provability of bounded depth
formulas in the Lambek calculus with empty antecedents allowed. Pentus'
algorithm is based on tabularisation of proof nets. Lambek calculus with
brackets is a conservative extension of Lambek calculus with bracket
modalities, suitable for the modeling of syntactical domains. In this paper we
give an algorithm for provability the Lambek calculus with brackets allowing
empty antecedents. Our algorithm runs in polynomial time when both the formula
depth and the bracket nesting depth are bounded. It combines a Pentus-style
tabularisation of proof nets with an automata-theoretic treatment of
bracketing.
","[{'version': 'v1', 'created': 'Mon, 1 May 2017 20:12:11 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Dec 2017 10:39:22 GMT'}]",2017-12-19,"[['Kanovich', 'Max', ''], ['Kuznetsov', 'Stepan', ''], ['Morrill', 'Glyn', ''], ['Scedrov', 'Andre', '']]","['Lambek calculus', 'proof nets', 'Lambek calculus with brackets', 'categorialgrammar', 'polynomial algorithm']"
878,1305.1992,Sawood Alam,Sawood Alam and Charles L. Cartledge and Michael L. Nelson,HTTP Mailbox - Asynchronous RESTful Communication,"13 pages, 6 figures, 8 code blocks, 3 equations, and 3 tables",,10.25777/wh13-fd86,,cs.SE cs.DL,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We describe HTTP Mailbox, a mechanism to enable RESTful HTTP communication in
an asynchronous mode with a full range of HTTP methods otherwise unavailable to
standard clients and servers. HTTP Mailbox allows for broadcast and multicast
semantics via HTTP. We evaluate a reference implementation using ApacheBench (a
server stress testing tool) demonstrating high throughput (on 1,000 concurrent
requests) and a systemic error rate of 0.01%. Finally, we demonstrate our HTTP
Mailbox implementation in a human assisted web preservation application called
""Preserve Me"".
","[{'version': 'v1', 'created': 'Thu, 9 May 2013 02:39:18 GMT'}]",2019-05-20,"[['Alam', 'Sawood', ''], ['Cartledge', 'Charles L.', ''], ['Nelson', 'Michael L.', '']]","['HTTP Mailbox', 'Messaging', 'REST', 'Asynchronous', 'Linda']"
879,1509.07175,Jaimie Murdock,Jaimie Murdock and Colin Allen and Simon DeDeo,"Exploration and Exploitation of Victorian Science in Darwin's Reading
  Notebooks","Cognition pre-print, published February 2017; 22 pages, plus 17 pages
  supporting information, 7 pages references",Cognition 159 (2017) 117-126,10.1016/j.cognition.2016.11.012,,cs.CL cs.AI cs.CY cs.DL physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  Search in an environment with an uncertain distribution of resources involves
a trade-off between exploitation of past discoveries and further exploration.
This extends to information foraging, where a knowledge-seeker shifts between
reading in depth and studying new domains. To study this decision-making
process, we examine the reading choices made by one of the most celebrated
scientists of the modern era: Charles Darwin. From the full-text of books
listed in his chronologically-organized reading journals, we generate topic
models to quantify his local (text-to-text) and global (text-to-past) reading
decisions using Kullback-Liebler Divergence, a cognitively-validated,
information-theoretic measure of relative surprise. Rather than a pattern of
surprise-minimization, corresponding to a pure exploitation strategy, Darwin's
behavior shifts from early exploitation to later exploration, seeking unusually
high levels of cognitive surprise relative to previous eras. These shifts,
detected by an unsupervised Bayesian model, correlate with major intellectual
epochs of his career as identified both by qualitative scholarship and Darwin's
own self-commentary. Our methods allow us to compare his consumption of texts
with their publication order. We find Darwin's consumption more exploratory
than the culture's production, suggesting that underneath gradual societal
changes are the explorations of individual synthesis and discovery. Our
quantitative methods advance the study of cognitive search through a framework
for testing interactions between individual and collective behavior and between
short- and long-term consumption choices. This novel application of topic
modeling to characterize individual reading complements widespread studies of
collective scientific behavior.
","[{'version': 'v1', 'created': 'Wed, 23 Sep 2015 22:41:46 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Dec 2015 03:43:07 GMT'}, {'version': 'v3', 'created': 'Sat, 13 Feb 2016 21:47:35 GMT'}, {'version': 'v4', 'created': 'Mon, 22 Aug 2016 21:52:56 GMT'}, {'version': 'v5', 'created': 'Thu, 2 Feb 2017 15:51:17 GMT'}]",2017-02-03,"[['Murdock', 'Jaimie', ''], ['Allen', 'Colin', ''], ['DeDeo', 'Simon', '']]","['Cognitive search', 'information foraging', 'topic modeling', 'exploration-exploitation', 'history of science', 'scientific discovery']"
880,1806.10115,Christian Lins,"Christian Lins, Daniel Eckhoff, Andreas Klausen, Sandra Hellmers,
  Andreas Hein, Sebastian Fudickar","Cardiopulmonary resuscitation quality parameters from motion capture
  data using Differential Evolution fitting of sinusoids","Final paper, 22 pages","Applied Soft Computing, Volume 79, June 2019, Pages 300-309",10.1016/j.asoc.2019.03.023,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cardiopulmonary resuscitation (CPR) is alongside electrical defibrillation
the most crucial countermeasure for sudden cardiac arrest, which affects
thousands of individuals every year. In this paper, we present a novel approach
including sinusoid models that use skeletal motion data from an RGB-D (Kinect)
sensor and the Differential Evolution (DE) optimization algorithm to
dynamically fit sinusoidal curves to derive frequency and depth parameters for
cardiopulmonary resuscitation training. It is intended to be part of a robust
and easy-to-use feedback system for CPR training, allowing its use for
unsupervised training. The accuracy of this DE-based approach is evaluated in
comparison with data of 28 participants recorded by a state-of-the-art training
mannequin. We optimized the DE algorithm hyperparameters and showed that with
these optimized parameters the frequency of the CPR is recognized with a median
error of $\pm 2.9$ compressions per minute compared to the reference training
mannequin.
","[{'version': 'v1', 'created': 'Tue, 26 Jun 2018 17:24:49 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Dec 2018 10:45:37 GMT'}, {'version': 'v3', 'created': 'Fri, 1 Feb 2019 18:04:04 GMT'}, {'version': 'v4', 'created': 'Tue, 30 Jul 2019 10:54:39 GMT'}]",2020-10-26,"[['Lins', 'Christian', ''], ['Eckhoff', 'Daniel', ''], ['Klausen', 'Andreas', ''], ['Hellmers', 'Sandra', ''], ['Hein', 'Andreas', ''], ['Fudickar', 'Sebastian', '']]","['CPR training', 'Resuscitation', 'Differential Evolution', 'Cardiac Arrest', 'Motion Capture', 'Kinect', 'Sinusoid Regression Model']"
881,1311.0352,John-John Cabibihan,"John-John Cabibihan, Hifza Javed, Marcelo Ang Jr., and Sharifah Mariam
  Aljunied","Why robots? A survey on the roles and benefits of social robots in the
  therapy of children with autism",,"International Journal of Social Robotics, 2013, 5(4), 593-618",10.1007/s12369-013-0202-2,,cs.RO cs.CY cs.HC,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper reviews the use of socially interactive robots to assist in the
therapy of children with autism. The extent to which the robots were successful
in helping the children in their social, emotional, and communication deficits
was investigated. Child-robot interactions were scrutinized with respect to the
different target behaviors that are to be elicited from a child during therapy.
These behaviors were thoroughly examined with respect to a childs development
needs. Most importantly, experimental data from the surveyed works were
extracted and analyzed in terms of the target behaviors and how each robot was
used during a therapy session to achieve these behaviors. The study concludes
by categorizing the different therapeutic roles that these robots were observed
to play, and highlights the important design features that enable them to
achieve high levels of effectiveness in autism therapy.
","[{'version': 'v1', 'created': 'Sat, 2 Nov 2013 07:15:08 GMT'}]",2013-11-05,"[['Cabibihan', 'John-John', ''], ['Javed', 'Hifza', ''], ['Ang', 'Marcelo', 'Jr.'], ['Aljunied', 'Sharifah Mariam', '']]","['social robots', 'autism spectrum disorder', 'autism therapy', 'human-robot interaction', 'robot design']"
882,1902.09667,A\'ecio Santos,"Kien Pham, A\'ecio Santos and Juliana Freire",Bootstrapping Domain-Specific Content Discovery on the Web,"Accepted for publication in the Proceedings of the 2019 World Wide
  Web Conference (WWW'19). 11 pages, 8 figures",,10.1145/3308558.3313709,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  The ability to continuously discover domain-specific content from the Web is
critical for many applications. While focused crawling strategies have been
shown to be effective for discovery, configuring a focused crawler is difficult
and time-consuming. Given a domain of interest $D$, subject-matter experts
(SMEs) must search for relevant websites and collect a set of representative
Web pages to serve as training examples for creating a classifier that
recognizes pages in $D$, as well as a set of pages to seed the crawl. In this
paper, we propose DISCO, an approach designed to bootstrap domain-specific
search. Given a small set of websites, DISCO aims to discover a large
collection of relevant websites. DISCO uses a ranking-based framework that
mimics the way users search for information on the Web: it iteratively
discovers new pages, distills, and ranks them. It also applies multiple
discovery strategies, including keyword-based and related queries issued to
search engines, backward and forward crawling. By systematically combining
these strategies, DISCO is able to attain high harvest rates and coverage for a
variety of domains. We perform extensive experiments in four social-good
domains, using data gathered by SMEs in the respective domains, and show that
our approach is effective and outperforms state-of-the-art methods.
","[{'version': 'v1', 'created': 'Mon, 25 Feb 2019 23:58:38 GMT'}]",2019-02-27,"[['Pham', 'Kien', ''], ['Santos', 'Aécio', ''], ['Freire', 'Juliana', '']]","['Focused crawling', 'Domain-specific Website discovery', 'Meta search']"
883,1812.03802,Vincent Cheutet,"Sophea Chhun (DISP), N\'ejib Moalla (DISP), Yacine Ouzrout (DISP)","Ontology based Approach for Semantic Service Selection in Business
  Process Re-Engineering",,"Kai Mertins, Fr\'ed\'erick B\'enaben, Ra\'ul Poler, Jean-Paul
  Bourri\`eres. 7th International Conference Interoperability for Enterprise
  Systems and Applications (I-ESA'14), Mar 2014, Albi, France. Springer,
  Proceedings of the I-ESA Conferences, 7, pp.63--73, 2014, Enterprise
  Interoperability VI. http://2014.i-esa.org/",10.1007/978-3-319-04948-9_6,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This research aims to provide the possibility to the business analysts to be
able to know whether their design business processes are feasible or not. In
order to solve this problem, we proposed a model called BPMNSemAuto that makes
use of the existing services stored in the service registry UDDI (Universal
Description Discovery and Integration). From the data extracted from the UDDI,
the WSDL files and the tracking data of service execution on the server, a Web
Service Ontology (WSOnto) is generated to store all the existing services. The
BPMNSemAuto model takes an input of business process design specifications, and
it generates an executable business process as an output. It provides an
interface for business analysts to specify the description of each service task
of the design business process. For each service task, the business analysts
specify the task objective (keywords), inputs, outputs and weights of the
Quality of Service (QoS) properties. From the design business process with the
service task specifications, a Business Process Ontology (BPOnto) is generated.
A service selection algorithm performs the mapping between the instances of the
WSOnto and the BPOnto to obtain possible mappings between these two ontologies.
The obtained mappings help the model to acquire web services to execute the
desired service tasks. Moreover, the consistency checking of the inputs of the
proposed model is performed before executing the service selection algorithm.
WordNet is used to solve the synonym problems and at the same time a keyword
extraction method is presented in this paper.
","[{'version': 'v1', 'created': 'Fri, 16 Nov 2018 11:47:44 GMT'}]",2018-12-11,"[['Chhun', 'Sophea', '', 'DISP'], ['Moalla', 'Néjib', '', 'DISP'], ['Ouzrout', 'Yacine', '', 'DISP']]","['business process', 'keyword extraction', 'ontology', 'ontology matching', 'QoS', 'semantic web service', 'service selection']"
884,1706.06636,Chenyan Xiong,"Chenyan Xiong, Jamie Callan, and Tie-Yan Liu",Word-Entity Duet Representations for Document Ranking,,SIGIR 2017,10.1145/3077136.3080768,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a word-entity duet framework for utilizing knowledge
bases in ad-hoc retrieval. In this work, the query and documents are modeled by
word-based representations and entity-based representations. Ranking features
are generated by the interactions between the two representations,
incorporating information from the word space, the entity space, and the
cross-space connections through the knowledge graph. To handle the
uncertainties from the automatically constructed entity representations, an
attention-based ranking model AttR-Duet is developed. With back-propagation
from ranking labels, the model learns simultaneously how to demote noisy
entities and how to rank documents with the word-entity duet. Evaluation
results on TREC Web Track ad-hoc task demonstrate that all of the four-way
interactions in the duet are useful, the attention mechanism successfully
steers the model away from noisy entities, and together they significantly
outperform both word-based and entity-based learning to rank systems.
","[{'version': 'v1', 'created': 'Tue, 20 Jun 2017 19:23:07 GMT'}]",2017-06-22,"[['Xiong', 'Chenyan', ''], ['Callan', 'Jamie', ''], ['Liu', 'Tie-Yan', '']]","['Word-Entity Duet', 'Entity-based Search', 'Explicit Semantics', 'TextRepresentation', 'Document Ranking']"
885,1511.02273,Claude Gravel,Luc Devroye and Claude Gravel,The expected bit complexity of the von Neumann rejection algorithm,"25 pages, 4 figures",,10.1007/s11222-016-9648-z,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 1952, von Neumann introduced the rejection method for random variate
generation. We revisit this algorithm when we have a source of perfect bits at
our disposal. In this random bit model, there are universal lower bounds for
generating a random variate with a given density to within an accuracy
$\epsilon$ derived by Knuth and Yao, and refined by the authors. In general,
von Neumann's method fails in this model. We propose a modification that
insures proper behavior for all Riemann-integrable densities on compact sets,
and show that the expected number of random bits needed behaves optimally with
respect to universal lower bounds. In particular, we introduce the notion of an
oracle that evaluates the supremum and infimum of a function on any rectangle
of $\mathbb{R}^{d}$, and develop a quadtree-style extension of the classical
rejection method.
","[{'version': 'v1', 'created': 'Sat, 7 Nov 2015 00:39:07 GMT'}, {'version': 'v2', 'created': 'Sat, 2 Apr 2016 17:20:46 GMT'}]",2022-01-04,"[['Devroye', 'Luc', ''], ['Gravel', 'Claude', '']]","['random number generation', 'random bit model', 'von Neumann sam']"
886,2102.10908,Weitao Xu,"Weitao Xu, Zhenjiang Li, Wanli Xue, Xiaotong Yu, Bo Wei, Jia Wang,
  Chengwen Luo, Wei Li, Albert Y. Zomaya","InaudibleKey: Generic Inaudible Acoustic Signal based Key Agreement
  Protocol for Mobile Devices","13 pages, 11 figures, IPSN 2021",,10.1145/3412382.3458260,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Secure Device-to-Device (D2D) communication is becoming increasingly
important with the ever-growing number of Internet-of-Things (IoT) devices in
our daily life. To achieve secure D2D communication, the key agreement between
different IoT devices without any prior knowledge is becoming desirable.
Although various approaches have been proposed in the literature, they suffer
from a number of limitations, such as low key generation rate and short pairing
distance. In this paper, we present InaudibleKey, an inaudible acoustic
signal-based key generation protocol for mobile devices. Based on acoustic
channel reciprocity, InaudibleKey exploits the acoustic channel frequency
response of two legitimate devices as a common secret to generating keys.
InaudibleKey employs several novel technologies to significantly improve its
performance. We conduct extensive experiments to evaluate the proposed system
in different real environments. Compared to state-of-the-art works,
InaudibleKey improves key generation rate by 3-145 times, extends pairing
distance by 3.2-44 times, and reduces information reconciliation counts by
2.5-16 times. Security analysis demonstrates that InaudibleKey is resilient to
a number of malicious attacks. We also implement InaudibleKey on modern
smartphones and resource-limited IoT devices. Results show that it is
energy-efficient and can run on both powerful and resource-limited IoT devices
without incurring excessive resource consumption.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2021 11:23:50 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Mar 2021 05:03:00 GMT'}]",2021-03-29,"[['Xu', 'Weitao', ''], ['Li', 'Zhenjiang', ''], ['Xue', 'Wanli', ''], ['Yu', 'Xiaotong', ''], ['Wei', 'Bo', ''], ['Wang', 'Jia', ''], ['Luo', 'Chengwen', ''], ['Li', 'Wei', ''], ['Zomaya', 'Albert Y.', '']]","['Key generation', 'Mobile devices', 'Acoustic signal']"
887,1912.05511,Hanna Wallach,Abigail Z. Jacobs and Hanna Wallach,Measurement and Fairness,"11 pages, 1 figure. To be published in the proceedings of the ACM
  Conference on Fairness, Accountability, and Transparency (FAccT '21)",,10.1145/3442188.3445901,,cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose measurement modeling from the quantitative social sciences as a
framework for understanding fairness in computational systems. Computational
systems often involve unobservable theoretical constructs, such as
socioeconomic status, teacher effectiveness, and risk of recidivism. Such
constructs cannot be measured directly and must instead be inferred from
measurements of observable properties (and other unobservable theoretical
constructs) thought to be related to them -- i.e., operationalized via a
measurement model. This process, which necessarily involves making assumptions,
introduces the potential for mismatches between the theoretical understanding
of the construct purported to be measured and its operationalization. We argue
that many of the harms discussed in the literature on fairness in computational
systems are direct results of such mismatches. We show how some of these harms
could have been anticipated and, in some cases, mitigated if viewed through the
lens of measurement modeling. To do this, we contribute fairness-oriented
conceptualizations of construct reliability and construct validity that unite
traditions from political science, education, and psychology and provide a set
of tools for making explicit and testing assumptions about constructs and their
operationalizations. We then turn to fairness itself, an essentially contested
construct that has different theoretical understandings in different contexts.
We argue that this contestedness underlies recent debates about fairness
definitions: although these debates appear to be about different
operationalizations, they are, in fact, debates about different theoretical
understandings of fairness. We show how measurement modeling can provide a
framework for getting to the core of these debates.
","[{'version': 'v1', 'created': 'Wed, 11 Dec 2019 18:21:38 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Jan 2021 18:20:14 GMT'}, {'version': 'v3', 'created': 'Fri, 12 Mar 2021 21:26:55 GMT'}]",2021-03-16,"[['Jacobs', 'Abigail Z.', ''], ['Wallach', 'Hanna', '']]","['measurement', 'construct validity', 'construct reliability', 'fairness']"
888,1002.3299,Mohsen Toorani,"M. Toorani, A. A. Beheshti","LPKI - A Lightweight Public Key Infrastructure for the Mobile
  Environments","6 Pages, 6 Figures","Proceedings of the 11th IEEE International Conference on
  Communication Systems (IEEE ICCS'08), pp.162-166, Guangzhou, China, Nov. 2008",10.1109/ICCS.2008.4737164,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The non-repudiation as an essential requirement of many applications can be
provided by the asymmetric key model. With the evolution of new applications
such as mobile commerce, it is essential to provide secure and efficient
solutions for the mobile environments. The traditional public key cryptography
involves huge computational costs and is not so suitable for the
resource-constrained platforms. The elliptic curve-based approaches as the
newer solutions require certain considerations that are not taken into account
in the traditional public key infrastructures. The main contribution of this
paper is to introduce a Lightweight Public Key Infrastructure (LPKI) for the
constrained platforms such as mobile phones. It takes advantages of elliptic
curve cryptography and signcryption to decrease the computational costs and
communication overheads, and adapting to the constraints. All the computational
costs of required validations can be eliminated from end-entities by
introduction of a validation authority to the introduced infrastructure and
delegating validations to such a component. LPKI is so suitable for mobile
environments and for applications such as mobile commerce where the security is
the great concern.
","[{'version': 'v1', 'created': 'Wed, 17 Feb 2010 16:12:49 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Mar 2010 20:23:32 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Jul 2011 13:50:44 GMT'}, {'version': 'v4', 'created': 'Fri, 16 Mar 2012 21:18:11 GMT'}]",2012-03-20,"[['Toorani', 'M.', ''], ['Beheshti', 'A. A.', '']]","['Public Key Cryptography', 'Signcryption', 'Elliptic Curves', 'Mobile Security', 'Validation Authority']"
889,1406.5301,Borko Boskovic,"Borko Bo\v{s}kovi\'c, Franc Brglez, Janez Brest","Low-Autocorrelation Binary Sequences: On Improved Merit Factors and
  Runtime Predictions to Achieve Them",,"Applied Soft Computing, Volume 56, July 2017, Pages 262-285",10.1016/j.asoc.2017.02.024,,cs.DS cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The search for binary sequences with a high figure of merit, known as the low
autocorrelation binary sequence ($labs$}) problem, represents a formidable
computational challenge. To mitigate the computational constraints of the
problem, we consider solvers that accept odd values of sequence length $L$ and
return solutions for skew-symmetric binary sequences only -- with the
consequence that not all best solutions under this constraint will be optimal
for each $L$. In order to improve both, the search for best merit factor $and$
the asymptotic runtime performance, we instrumented three stochastic solvers,
the first two are state-of-the-art solvers that rely on variants of memetic and
tabu search ($lssMAts$ and $lssRRts$), the third solver ($lssOrel$) organizes
the search as a sequence of independent contiguous self-avoiding walk segments.
By adapting a rigorous statistical methodology to performance testing of all
three combinatorial solvers, experiments show that the solver with the best
asymptotic average-case performance, $lssOrel\_8 = 0.000032*1.1504^L$, has the
best chance of finding solutions that improve, as $L$ increases, figures of
merit reported to date. The same methodology can be applied to engineering new
$labs$ solvers that may return merit factors even closer to the conjectured
asymptotic value of 12.3248.
","[{'version': 'v1', 'created': 'Fri, 20 Jun 2014 08:00:15 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Jul 2014 06:57:01 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Jul 2014 13:54:15 GMT'}, {'version': 'v4', 'created': 'Mon, 22 Feb 2016 12:17:46 GMT'}, {'version': 'v5', 'created': 'Thu, 24 Mar 2016 12:44:48 GMT'}, {'version': 'v6', 'created': 'Sat, 6 May 2017 08:36:16 GMT'}]",2017-05-09,"[['Bošković', 'Borko', ''], ['Brglez', 'Franc', ''], ['Brest', 'Janez', '']]","['Low-autocorrelation binary sequences', 'self-avoiding walk', 'stochastic combinatorialoptimization', 'asymptotic average-case performance']"
890,1710.06892,Tongfei Chen,Tongfei Chen,Typesafe Abstractions for Tensor Operations,,"Tongfei Chen (2017): Typesafe Abstractions for Tensor Operations
  (Short Paper). In Proceedings of the 8th ACM SIGPLAN International Symposium
  on Scala. pp. 45-50",10.1145/3136000.3136001,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a typesafe abstraction to tensors (i.e. multidimensional arrays)
exploiting the type-level programming capabilities of Scala through
heterogeneous lists (HList), and showcase typesafe abstractions of common
tensor operations and various neural layers such as convolution or recurrent
neural networks. This abstraction could lay the foundation of future typesafe
deep learning frameworks that runs on Scala/JVM.
","[{'version': 'v1', 'created': 'Wed, 18 Oct 2017 18:43:38 GMT'}]",2017-10-20,"[['Chen', 'Tongfei', '']]","['Scala', 'tensor', 'heterogeneous list', 'deep learning']"
891,1806.10044,Johannes Zink,"Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink","Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few
  Bends",,,10.1016/j.comgeo.2019.07.006,,cs.CG cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the following classes of beyond-planar graphs: 1-planar, IC-planar,
and NIC-planar graphs. These are the graphs that admit a 1-planar, IC-planar,
and NIC-planar drawing, respectively. A drawing of a graph is 1-planar if every
edge is crossed at most once. A 1-planar drawing is IC-planar if no two pairs
of crossing edges share a vertex. A 1-planar drawing is NIC-planar if no two
pairs of crossing edges share two vertices. We study the relations of these
beyond-planar graph classes (beyond-planar graphs is a collective term for the
primary attempts to generalize the planar graphs) to right-angle crossing (RAC)
graphs that admit compact drawings on the grid with few bends. We present four
drawing algorithms that preserve the given embeddings. First, we show that
every $n$-vertex NIC-planar graph admits a NIC-planar RAC drawing with at most
one bend per edge on a grid of size $O(n) \times O(n)$. Then, we show that
every $n$-vertex 1-planar graph admits a 1-planar RAC drawing with at most two
bends per edge on a grid of size $O(n^3) \times O(n^3)$. Finally, we make two
known algorithms embedding-preserving; for drawing 1-planar RAC graphs with at
most one bend per edge and for drawing IC-planar RAC graphs straight-line.
","[{'version': 'v1', 'created': 'Tue, 26 Jun 2018 15:02:36 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Jul 2018 11:57:24 GMT'}, {'version': 'v3', 'created': 'Tue, 28 Aug 2018 15:01:59 GMT'}, {'version': 'v4', 'created': 'Mon, 3 Sep 2018 13:58:52 GMT'}, {'version': 'v5', 'created': 'Thu, 8 Aug 2019 16:33:07 GMT'}]",2019-08-12,"[['Chaplick', 'Steven', ''], ['Lipp', 'Fabian', ''], ['Wolff', 'Alexander', ''], ['Zink', 'Johannes', '']]","['graph drawing', 'beyond-planar graphs', '1-planar graphs', 'right-angle crossings', 'grid drawing']"
892,1310.5892,Nicolas Robinson-Garcia,Nicolas Robinson-Garcia and Clara Calero-Medina,"What do university rankings by fields rank? Exploring discrepancies
  between the organizational structure of universities and bibliometric
  classifications",Paper published in Scientometrics,,10.1007/s11192-013-1157-7,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  University rankings by fields are usually based on the research output of
universities. However, research managers and rankings consumers expect to see
in such fields a reflection of the structure of their own organizational
institution. In this study we address such misinterpretation by developing the
research profile of the organizational units of two Spanish universities:
University of Granada and Pompeu Fabra University. We use two classification
systems, the subject categories offered by Thomson Scientific which are
commonly used on bibliometric studies, and the 37 disciplines displayed by the
Spanish I-UGR Rankings which are constructed from an aggregation of the former.
We also describe in detail problems encountered when working with address data
from a top down approach and we show differences between universities
structures derived from the interdisciplinary organizational forms of new
managerialism at universities. We conclude by highlighting that rankings by
fields should clearly state the methodology for the construction of such
fields. We indicate that the construction of research profiles may be a good
solution for universities for finding out levels of discrepancy between
organizational units and subject fields.
","[{'version': 'v1', 'created': 'Tue, 22 Oct 2013 12:33:32 GMT'}]",2013-10-23,"[['Robinson-Garcia', 'Nicolas', ''], ['Calero-Medina', 'Clara', '']]","['University rankings', 'fields', 'address data', 'institutional structure', 'subject classification']"
893,1512.00787,Luiz Capretz Dr.,"Surayne Torres, Yadenis Pinero, Pedro Pinero, Luiz Fernando Capretz",Creation and Evaluation of Software Teams - A Social Approach,,"International Journal of Manufacturing Technology and Management,
  28(4/5/6):167-187, 2014",10.1504/IJMTM.2014.066695,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work discusses an important issue in the area of human resource
management by proposing a novel model for creation and evaluation of software
teams. The model consists of several assessments, including a technical test, a
quality of life test and a psychological-sociological test. Since the technical
test requires particular organizational specifications and cannot be examined
without reference to a specific company, only the sociological test and the
quality of life tests are extensively discussed in this work. Two strategies
are discussed for assigning roles in a project. Initially, six software
projects were selected, and after extensive analysis of the projects, two
projects were chosen and correctives actions were applied. An empirical
evaluation was also conducted to assess the model effectiveness. The
experimental results demonstrate that the application of the model improved the
productivity of project teams.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2015 17:57:13 GMT'}]",2015-12-03,"[['Torres', 'Surayne', ''], ['Pinero', 'Yadenis', ''], ['Pinero', 'Pedro', ''], ['Capretz', 'Luiz Fernando', '']]","['team balance', 'team creation', 'human resource management', 'project management']"
894,1809.07406,Darren Chitty,Darren M. Chitty,"Exploiting Tournament Selection for Efficient Parallel Genetic
  Programming",,"Chitty, Darren M. ""Exploiting Tournament Selection for Efficient
  Parallel Genetic Programming."" In UK Workshop on UK Workshop on Computational
  Intelligence, pp. 41-53. Springer, Cham, 2018",10.1007/978-3-319-97982-3_4,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Genetic Programming (GP) is a computationally intensive technique which is
naturally parallel in nature. Consequently, many attempts have been made to
improve its run-time from exploiting highly parallel hardware such as GPUs.
However, a second methodology of improving the speed of GP is through
efficiency techniques such as subtree caching. However achieving parallel
performance and efficiency is a difficult task. This paper will demonstrate an
efficiency saving for GP compatible with the harnessing of parallel CPU
hardware by exploiting tournament selection. Significant efficiency savings are
demonstrated whilst retaining the capability of a high performance parallel
implementation of GP. Indeed, a 74% improvement in the speed of GP is achieved
with a peak rate of 96 billion GPop/s for classification type problems.
","[{'version': 'v1', 'created': 'Wed, 19 Sep 2018 20:52:52 GMT'}]",2018-09-21,"[['Chitty', 'Darren M.', '']]","['Genetic Programming', 'HPC', 'Computational Efficiency']"
895,1804.07127,Antoine Cully,Antoine Cully and Yiannis Demiris,Hierarchical Behavioral Repertoires with Unsupervised Descriptors,GECCO 2018,Genetic and Evolutionary Computation Conference 2018,10.1145/3205455.3205571,,cs.RO cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Enabling artificial agents to automatically learn complex, versatile and
high-performing behaviors is a long-lasting challenge. This paper presents a
step in this direction with hierarchical behavioral repertoires that stack
several behavioral repertoires to generate sophisticated behaviors. Each
repertoire of this architecture uses the lower repertoires to create complex
behaviors as sequences of simpler ones, while only the lowest repertoire
directly controls the agent's movements. This paper also introduces a novel
approach to automatically define behavioral descriptors thanks to an
unsupervised neural network that organizes the produced high-level behaviors.
The experiments show that the proposed architecture enables a robot to learn
how to draw digits in an unsupervised manner after having learned to draw lines
and arcs. Compared to traditional behavioral repertoires, the proposed
architecture reduces the dimensionality of the optimization problems by orders
of magnitude and provides behaviors with a twice better fitness. More
importantly, it enables the transfer of knowledge between robots: a
hierarchical repertoire evolved for a robotic arm to draw digits can be
transferred to a humanoid robot by simply changing the lowest layer of the
hierarchy. This enables the humanoid to draw digits although it has never been
trained for this task.
","[{'version': 'v1', 'created': 'Thu, 19 Apr 2018 12:53:39 GMT'}]",2018-04-20,"[['Cully', 'Antoine', ''], ['Demiris', 'Yiannis', '']]","['Behavioral repertoires', 'Qality-diversity optimization', 'Evolutionary robotics']"
896,1711.04592,Jan Egger,"Jan Egger, Christopher Nimsky, Xiaojun Chen","Vertebral body segmentation with GrowCut: Initial experience, workflow
  and practical application",10 pages,"SAGE Open Medicine, Volume 5, pp. 1-10, Nov. 2017",10.1177/2050312117740984,,cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this contribution, we used the GrowCut segmentation algorithm publicly
available in three-dimensional Slicer for three-dimensional segmentation of
vertebral bodies. To the best of our knowledge, this is the first time that the
GrowCut method has been studied for the usage of vertebral body segmentation.
In brief, we found that the GrowCut segmentation times were consistently less
than the manual segmentation times. Hence, GrowCut provides an alternative to a
manual slice-by-slice segmentation process.
","[{'version': 'v1', 'created': 'Mon, 13 Nov 2017 14:19:05 GMT'}]",2017-11-15,"[['Egger', 'Jan', ''], ['Nimsky', 'Christopher', ''], ['Chen', 'Xiaojun', '']]","['Segmentation', 'vertebral body', 'GrowCut', 'magnetic resonance imaging', 'Dice Score']"
897,1902.01724,Kai Arulkumaran,"Kai Arulkumaran, Antoine Cully, Julian Togelius",AlphaStar: An Evolutionary Computation Perspective,Genetic and EvolutionaryComputation Conference Companion 2019,,10.1145/3319619.3321894,,cs.NE cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In January 2019, DeepMind revealed AlphaStar to the world-the first
artificial intelligence (AI) system to beat a professional player at the game
of StarCraft II-representing a milestone in the progress of AI. AlphaStar draws
on many areas of AI research, including deep learning, reinforcement learning,
game theory, and evolutionary computation (EC). In this paper we analyze
AlphaStar primarily through the lens of EC, presenting a new look at the system
and relating it to many concepts in the field. We highlight some of its most
interesting aspects-the use of Lamarckian evolution, competitive co-evolution,
and quality diversity. In doing so, we hope to provide a bridge between the
wider EC community and one of the most significant AI systems developed in
recent times.
","[{'version': 'v1', 'created': 'Tue, 5 Feb 2019 14:57:15 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Feb 2019 15:05:35 GMT'}, {'version': 'v3', 'created': 'Sun, 14 Jul 2019 16:16:44 GMT'}]",2019-07-16,"[['Arulkumaran', 'Kai', ''], ['Cully', 'Antoine', ''], ['Togelius', 'Julian', '']]","['Lamarckian evolution', 'co-evolution', 'quality diversity']"
898,1208.5558,Alireza Nemaney Pour,"Melisa Hajyvahabzadeh, Elina Eidkhani, S. Anahita Mortazavi, Alireza
  Nemaney Pour","An Efficient Group Key Management Using Code for Key Calculation for
  Simultaneous Join/Leave: CKCS","18 pages, 16 figures, 4 tables","International Journal of Computer Networks & Communications
  (IJCNC) Vol.4, No.4, July 2012",10.5121/ijcnc.2012.4417,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an efficient group key management protocol, CKCS (Code
for Key Calculation in Simultaneous join/leave) for simultaneous join/leave in
secure multicast. This protocol is based on logical key hierarchy. In this
protocol, when new members join the group simultaneously, server sends only the
group key for those new members. Then, current members and new members
calculate the necessary keys by node codes and one-way hash function. A node
code is a random number which is assigned to each key to help users calculate
the necessary keys. Again, at leave, the server just sends the new group key to
remaining members. The results show that CKCS reduces computational and
communication overhead, and also message size in simultaneous join/leave.
","[{'version': 'v1', 'created': 'Tue, 28 Aug 2012 04:35:59 GMT'}]",2012-08-29,"[['Hajyvahabzadeh', 'Melisa', ''], ['Eidkhani', 'Elina', ''], ['Mortazavi', 'S. Anahita', ''], ['Pour', 'Alireza Nemaney', '']]","['Secure Multicast', 'Group Key Management', 'Group Security', 'Simultaneous join/leave', 'Code for Key Calculation', 'Re-keying']"
899,1312.2183,Yuantao Gu,"Jiang Zhu, Xiaohan Wang, Yuantao Gu","Maximum Likelihood Estimation from Sign Measurements with Sensing Matrix
  Perturbation","29 pages, 9 figures, journal paper",,10.1109/TSP.2014.2330350,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of estimating an unknown deterministic parameter vector from sign
measurements with a perturbed sensing matrix is studied in this paper. We
analyze the best achievable mean square error (MSE) performance by exploring
the corresponding Cram\'{e}r-Rao Lower Bound (CRLB). To estimate the parameter,
the maximum likelihood (ML) estimator is utilized and its consistency is
proved. We show that the perturbation on the sensing matrix exacerbates the
performance of ML estimator in most cases. However, suitable perturbation may
improve the performance in some special cases. Then we reformulate the original
ML estimation problem as a convex optimization problem, which can be solved
efficiently. Furthermore, theoretical analysis implies that the
perturbation-ignored estimation is a scaled version with the same direction of
the ML estimation. Finally, numerical simulations are performed to validate our
theoretical analysis.
","[{'version': 'v1', 'created': 'Sun, 8 Dec 2013 08:19:24 GMT'}]",2015-06-18,"[['Zhu', 'Jiang', ''], ['Wang', 'Xiaohan', ''], ['Gu', 'Yuantao', '']]","['Maximum likelihood estimation', 'sign measurements', 'Gaussian perturbation', 'CRLB']"
900,1807.05786,Konstantin Bulatov,"Vladimir V. Arlazarov, Konstantin Bulatov, Timofey Chernov, Vladimir
  L. Arlazarov","MIDV-500: A Dataset for Identity Documents Analysis and Recognition on
  Mobile Devices in Video Stream","7 pages, 6 figures, 5 tables",Computer optics 43 N5 (2019) 818-824,10.18287/2412-6179-2019-43-5-818-824,,cs.CV cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A lot of research has been devoted to identity documents analysis and
recognition on mobile devices. However, no publicly available datasets designed
for this particular problem currently exist. There are a few datasets which are
useful for associated subtasks but in order to facilitate a more comprehensive
scientific and technical approach to identity document recognition more
specialized datasets are required. In this paper we present a Mobile Identity
Document Video dataset (MIDV-500) consisting of 500 video clips for 50
different identity document types with ground truth which allows to perform
research in a wide scope of document analysis problems. The paper presents
characteristics of the dataset and evaluation results for existing methods of
face detection, text line recognition, and document fields data extraction.
Since an important feature of identity documents is their sensitiveness as they
contain personal data, all source document images used in MIDV-500 are either
in public domain or distributed under public copyright licenses.
  The main goal of this paper is to present a dataset. However, in addition and
as a baseline, we present evaluation results for existing methods for face
detection, text line recognition, and document data extraction, using the
presented dataset.
  (The dataset is available for download at ftp://smartengines.com/midv-500/.)
","[{'version': 'v1', 'created': 'Mon, 16 Jul 2018 10:51:10 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Oct 2018 12:17:23 GMT'}, {'version': 'v3', 'created': 'Wed, 9 Jan 2019 08:30:01 GMT'}, {'version': 'v4', 'created': 'Tue, 11 Feb 2020 07:28:48 GMT'}]",2020-02-12,"[['Arlazarov', 'Vladimir V.', ''], ['Bulatov', 'Konstantin', ''], ['Chernov', 'Timofey', ''], ['Arlazarov', 'Vladimir L.', '']]","['document analysis and recognition', 'dataset', 'identity documents', 'video stream']"
901,1710.06582,Xiaoming Zhang,"Feiran Huang, Xiaoming Zhang, Zhoujun Li, Tao Mei, Yueying He,
  Zhonghua Zhao",Learning Social Image Embedding with Deep Multimodal Attention Networks,,Proceedings of Thematic Workshops of the 25th ACM Multimedia 2017,10.1145/3126686.3126720,,cs.MM cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning social media data embedding by deep models has attracted extensive
research interest as well as boomed a lot of applications, such as link
prediction, classification, and cross-modal search. However, for social images
which contain both link information and multimodal contents (e.g., text
description, and visual content), simply employing the embedding learnt from
network structure or data content results in sub-optimal social image
representation. In this paper, we propose a novel social image embedding
approach called Deep Multimodal Attention Networks (DMAN), which employs a deep
model to jointly embed multimodal contents and link information. Specifically,
to effectively capture the correlations between multimodal contents, we propose
a multimodal attention network to encode the fine-granularity relation between
image regions and textual words. To leverage the network structure for
embedding learning, a novel Siamese-Triplet neural network is proposed to model
the links among images. With the joint deep model, the learnt embedding can
capture both the multimodal contents and the nonlinear network information.
Extensive experiments are conducted to investigate the effectiveness of our
approach in the applications of multi-label classification and cross-modal
search. Compared to state-of-the-art image embeddings, our proposed DMAN
achieves significant improvement in the tasks of multi-label classification and
cross-modal search.
","[{'version': 'v1', 'created': 'Wed, 18 Oct 2017 04:28:20 GMT'}]",2017-10-19,"[['Huang', 'Feiran', ''], ['Zhang', 'Xiaoming', ''], ['Li', 'Zhoujun', ''], ['Mei', 'Tao', ''], ['He', 'Yueying', ''], ['Zhao', 'Zhonghua', '']]","['Social embedding', 'deep learning', 'atention model', 'Siamese-Triplet']"
902,1905.08880,Anshul Kanakia,"Anshul Kanakia (1), Zhihong Shen (1), Darrin Eide (1), Kuansan Wang
  (1) ((1) Microsoft Research)","A Scalable Hybrid Research Paper Recommender System for Microsoft
  Academic","7 pages, 7 figures. Short paper at The Web Conference 2019, San
  Francisco, USA","In The World Wide Web Conference (WWW '19). ACM, New York, NY,
  USA, 2893-2899",10.1145/3308558.3313700,,cs.DL cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the design and methodology for the large scale hybrid paper
recommender system used by Microsoft Academic. The system provides
recommendations for approximately 160 million English research papers and
patents. Our approach handles incomplete citation information while also
alleviating the cold-start problem that often affects other recommender
systems. We use the Microsoft Academic Graph (MAG), titles, and available
abstracts of research papers to build a recommendation list for all documents,
thereby combining co-citation and content based approaches. Tuning system
parameters also allows for blending and prioritization of each approach which,
in turn, allows us to balance paper novelty versus authority in recommendation
results. We evaluate the generated recommendations via a user study of 40
participants, with over 2400 recommendation pairs graded and discuss the
quality of the results using P@10 and nDCG scores. We see that there is a
strong correlation between participant scores and the similarity rankings
produced by our system but that additional focus needs to be put towards
improving recommender precision, particularly for content based
recommendations. The results of the user survey and associated analysis scripts
are made available via GitHub and the recommendations produced by our system
are available as part of the MAG on Azure to facilitate further research and
light up novel research paper recommendation applications.
","[{'version': 'v1', 'created': 'Tue, 21 May 2019 21:46:33 GMT'}]",2019-05-23,"[['Kanakia', 'Anshul', '', 'Microsoft Research'], ['Shen', 'Zhihong', '', 'Microsoft Research'], ['Eide', 'Darrin', '', 'Microsoft Research'], ['Wang', 'Kuansan', '', 'Microsoft Research']]","['recommender system', 'word embedding', 'big data', 'k-means', 'clustering', 'document collection']"
903,2105.06388,Kiev Gama,"Kiev Gama, Carlos Zimmerle, Pedro Rossi","Online Hackathons as an Engaging Tool to Promote Group Work in Emergency
  Remote Learning","26th Annual ACM Conference on Innovation and Technology in Computer
  Science Education (ITiCSE) - 2021",,10.1145/3430665.3456312,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  In 2020, due to the COVID-19 pandemic, educational activities had to be done
remotely as a way to avoid the spread of the disease. What happened was not
exactly a shift to an online learning model but a transition to a new approach
called Emergency Remote Teaching. It is a temporary strategy to keep activities
going on until it is safe again to return to the physical facilities of
universities. This new setting became a challenge to both teachers and
students. The lack of interaction and classroom socialization became obstacles
for students to continue engaged. Before the pandemic, hackathons --
short-lived events (1 to 3 days) where participants intensively collaboration
to develop software prototypes -- were starting to be explored as an
alternative venue to engage students in acquiring and practicing technical
skills. In this paper, we present an experience report on the usage of an
online hackathon as a resource to engage students in the development of their
semester project in a distributed applications course during this emergency
remote teaching period. We describe details of the intervention and present an
analysis of the students' perspective of the approach. One of the important
findings was the efficient usage of the Discord communication tool -- already
used by all students while playing games -- which helped them socialize and
keep them continuously engaged in synchronous group work, ""virtually
collocated"".
","[{'version': 'v1', 'created': 'Sat, 24 Apr 2021 06:55:29 GMT'}]",2021-05-14,"[['Gama', 'Kiev', ''], ['Zimmerle', 'Carlos', ''], ['Rossi', 'Pedro', '']]","['online learning', 'hackathons', 'emergency remote teaching']"
904,1109.0895,Anis Charrada,"Anis Charrada, Abdelaziz Samet","Nonlinear Channel Estimation for OFDM System by Complex LS-SVM under
  High Mobility Conditions",11 pages,"International Journal of Wireless & Mobile Networks (IJWMN) Vol.
  3, No. 4, August 2011",10.5121/ijwmn.2011.3412,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  A nonlinear channel estimator using complex Least Square Support Vector
Machines (LS-SVM) is proposed for pilot-aided OFDM system and applied to Long
Term Evolution (LTE) downlink under high mobility conditions. The estimation
algorithm makes use of the reference signals to estimate the total frequency
response of the highly selective multipath channel in the presence of
non-Gaussian impulse noise interfering with pilot signals. Thus, the algorithm
maps trained data into a high dimensional feature space and uses the structural
risk minimization (SRM) principle to carry out the regression estimation for
the frequency response function of the highly selective channel. The
simulations show the effectiveness of the proposed method which has good
performance and high precision to track the variations of the fading channels
compared to the conventional LS method and it is robust at high speed mobility.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2011 21:40:00 GMT'}]",2014-12-12,"[['Charrada', 'Anis', ''], ['Samet', 'Abdelaziz', '']]","['Complex LS-SVM', ""Mercer's kernel"", 'nonlinear channel estimation', 'impulse noise', 'OFDM', 'LTE']"
905,1902.06775,Antonio E. Porreca,"Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Luciano Margara,
  Antonio E. Porreca","On the dynamical behaviour of linear higher-order cellular automata and
  its decidability",Preprint,Information Sciences 486 (2019) 73-87,10.1016/j.ins.2019.02.023,,cs.FL cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Higher-order cellular automata (HOCA) are a variant of cellular automata (CA)
used in many applications (ranging, for instance, from the design of secret
sharing schemes to data compression and image processing), and in which the
global state of the system at time $t$ depends not only on the state at time
$t-1$, as in the original model, but also on the states at time $t-2, \ldots,
t-n$, where $n$ is the memory size of the HOCA. We provide decidable
characterizations of two important dynamical properties, namely, sensitivity to
the initial conditions and equicontinuity, for linear HOCA over the alphabet
$\mathbb{Z}_m$. Such characterizations extend the ones shown in [23] for linear
CA (LCA) over the alphabet $\mathbb{Z}^{n}_m$ in the case $n=1$. We also prove
that linear HOCA of size memory $n$ over $\mathbb{Z}_m$ form a class that is
indistinguishable from a specific subclass of LCA over $\mathbb{Z}_m^n$. This
enables to decide injectivity and surjectivity for linear HOCA of size memory
$n$ over $\mathbb{Z}_m$ using the decidable characterization provided in [2]
and [19] for injectivity and surjectivity of LCA over $\mathbb{Z}^n_m$.
Finally, we prove an equivalence between LCA over $\mathbb{Z}_m^n$ and an
important class of non-uniform CA, another variant of CA used in many
applications.
","[{'version': 'v1', 'created': 'Mon, 18 Feb 2019 19:53:53 GMT'}]",2019-02-25,"[['Dennunzio', 'Alberto', ''], ['Formenti', 'Enrico', ''], ['Manzoni', 'Luca', ''], ['Margara', 'Luciano', ''], ['Porreca', 'Antonio E.', '']]","['cellular automata', 'higher-order cellular automata', 'linear cellular automata', 'sensitivity to the initialconditions', 'decidability', 'discrete dynamical systems']"
906,1705.10351,Eric Tellez Dr.,"Eric S. Tellez, Guillermo Ruiz, Edgar Chavez, Mario Graff","A scalable solution to the nearest neighbor search problem through
  local-search methods on neighbor graphs",,Pattern Analysis and Applications 24 763--777 2021,10.1007/s10044-020-00946-w,,cs.DS cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Near neighbor search (NNS) is a powerful abstraction for data access;
however, data indexing is troublesome even for approximate indexes. For
intrinsically high-dimensional data, high-quality fast searches demand either
indexes with impractically large memory usage or preprocessing time.
  In this paper, we introduce an algorithm to solve a nearest-neighbor query
$q$ by minimizing a kernel function defined by the distance from $q$ to each
object in the database. The minimization is performed using metaheuristics to
solve the problem rapidly; even when some methods in the literature use this
strategy behind the scenes, our approach is the first one using it explicitly.
We also provide two approaches to select edges in the graph's construction
stage that limit memory footprint and reduce the number of free parameters
simultaneously.
  We carry out a thorough experimental comparison with state-of-the-art indexes
through synthetic and real-world datasets; we found out that our contributions
achieve competitive performances regarding speed, accuracy, and memory in
almost any of our benchmarks.
","[{'version': 'v1', 'created': 'Mon, 29 May 2017 18:32:00 GMT'}, {'version': 'v2', 'created': 'Wed, 31 May 2017 11:49:06 GMT'}, {'version': 'v3', 'created': 'Thu, 17 Jan 2019 00:26:50 GMT'}, {'version': 'v4', 'created': 'Tue, 29 Jun 2021 14:46:02 GMT'}]",2021-06-30,"[['Tellez', 'Eric S.', ''], ['Ruiz', 'Guillermo', ''], ['Chavez', 'Edgar', ''], ['Graff', 'Mario', '']]","['Nearest neighbor search', 'Metric search with heuristics', 'Combinatorial optimization']"
907,1908.04207,Shigang Li,"Shigang Li, Tal Ben-Nun, Salvatore Di Girolamo, Dan Alistarh, Torsten
  Hoefler","Taming Unbalanced Training Workloads in Deep Learning with Partial
  Collective Operations","Published in Proceedings of the 25th ACM SIGPLAN Symposium on
  Principles and Practice of Parallel Programming (PPoPP'20), pp. 45-61. 2020",,10.1145/3332466.3374528,,cs.DC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Load imbalance pervasively exists in distributed deep learning training
systems, either caused by the inherent imbalance in learned tasks or by the
system itself. Traditional synchronous Stochastic Gradient Descent (SGD)
achieves good accuracy for a wide variety of tasks, but relies on global
synchronization to accumulate the gradients at every training step. In this
paper, we propose eager-SGD, which relaxes the global synchronization for
decentralized accumulation. To implement eager-SGD, we propose to use two
partial collectives: solo and majority. With solo allreduce, the faster
processes contribute their gradients eagerly without waiting for the slower
processes, whereas with majority allreduce, at least half of the participants
must contribute gradients before continuing, all without using a central
parameter server. We theoretically prove the convergence of the algorithms and
describe the partial collectives in detail. Experimental results on
load-imbalanced environments (CIFAR-10, ImageNet, and UCF101 datasets) show
that eager-SGD achieves 1.27x speedup over the state-of-the-art synchronous
SGD, without losing accuracy.
","[{'version': 'v1', 'created': 'Mon, 12 Aug 2019 15:37:51 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Aug 2019 07:35:30 GMT'}, {'version': 'v3', 'created': 'Tue, 25 Feb 2020 23:13:50 GMT'}]",2020-02-27,"[['Li', 'Shigang', ''], ['Ben-Nun', 'Tal', ''], ['Di Girolamo', 'Salvatore', ''], ['Alistarh', 'Dan', ''], ['Hoefler', 'Torsten', '']]","['stochastic gradient descent', 'distributed deeplearning', 'eager-SGD', 'workload imbalance', 'collective operations']"
908,1109.0753,Kinjal Shah H,"Kinjal Shah, Gagan Dua, Dharmendar Sharma, Priyanka Mishra, Nitin
  Rakesh","Transmission of Successful Route Error Message(RERR) in Routing Aware
  Multiple Description Video Coding over Mobile Ad-Hoc Network","9 pages,2 figures, 1 table for algorithm",,10.5121/ijma.2011.3305,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video transmission over mobile ad-hoc networks is becoming important as these
networks become more widely used in the wireless networks. We propose a
routing-aware multiple description video coding approach to support video
transmission over mobile ad-hoc networks with single and multiple path
transport. We build a model to estimate the packet loss probability of each
packet transmitted over the network based on the standard ad-hoc routing
messages and network parameters without losing the RERR message. We then
calculate the frame loss probability in order to eliminate error without any
loss of data.
","[{'version': 'v1', 'created': 'Sun, 4 Sep 2011 20:03:32 GMT'}]",2011-09-06,"[['Shah', 'Kinjal', ''], ['Dua', 'Gagan', ''], ['Sharma', 'Dharmendar', ''], ['Mishra', 'Priyanka', ''], ['Rakesh', 'Nitin', '']]","['Network Protocols', 'Wireless Network', 'Mobile Network', 'Virus', 'Worms & Trojan']"
909,1604.06182,Haroon Idrees,"Haroon Idrees, Amir R. Zamir, Yu-Gang Jiang, Alex Gorban, Ivan Laptev,
  Rahul Sukthankar, Mubarak Shah","The THUMOS Challenge on Action Recognition for Videos ""in the Wild""",Preprint submitted to Computer Vision and Image Understanding,,10.1016/j.cviu.2016.10.018,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatically recognizing and localizing wide ranges of human actions has
crucial importance for video understanding. Towards this goal, the THUMOS
challenge was introduced in 2013 to serve as a benchmark for action
recognition. Until then, video action recognition, including THUMOS challenge,
had focused primarily on the classification of pre-segmented (i.e., trimmed)
videos, which is an artificial task. In THUMOS 2014, we elevated action
recognition to a more practical level by introducing temporally untrimmed
videos. These also include `background videos' which share similar scenes and
backgrounds as action videos, but are devoid of the specific actions. The three
editions of the challenge organized in 2013--2015 have made THUMOS a common
benchmark for action classification and detection and the annual challenge is
widely attended by teams from around the world.
  In this paper we describe the THUMOS benchmark in detail and give an overview
of data collection and annotation procedures. We present the evaluation
protocols used to quantify results in the two THUMOS tasks of action
classification and temporal detection. We also present results of submissions
to the THUMOS 2015 challenge and review the participating approaches.
Additionally, we include a comprehensive empirical study evaluating the
differences in action recognition between trimmed and untrimmed videos, and how
well methods trained on trimmed videos generalize to untrimmed videos. We
conclude by proposing several directions and improvements for future THUMOS
challenges.
","[{'version': 'v1', 'created': 'Thu, 21 Apr 2016 05:08:59 GMT'}]",2016-12-06,"[['Idrees', 'Haroon', ''], ['Zamir', 'Amir R.', ''], ['Jiang', 'Yu-Gang', ''], ['Gorban', 'Alex', ''], ['Laptev', 'Ivan', ''], ['Sukthankar', 'Rahul', ''], ['Shah', 'Mubarak', '']]","['Action Recognition', 'Action Detection', 'Action Localization', 'Untrimmed']"
910,1611.07400,Quamar Niyaz,"Quamar Niyaz, Weiqing Sun, Ahmad Y Javaid","A Deep Learning Based DDoS Detection System in Software-Defined
  Networking (SDN)",,,10.4108/eai.28-12-2017.153515,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed Denial of Service (DDoS) is one of the most prevalent attacks
that an organizational network infrastructure comes across nowadays. We propose
a deep learning based multi-vector DDoS detection system in a software-defined
network (SDN) environment. SDN provides flexibility to program network devices
for different objectives and eliminates the need for third-party
vendor-specific hardware. We implement our system as a network application on
top of an SDN controller. We use deep learning for feature reduction of a large
set of features derived from network traffic headers. We evaluate our system
based on different performance metrics by applying it on traffic traces
collected from different scenarios. We observe high accuracy with a low
false-positive for attack detection in our proposed system.
","[{'version': 'v1', 'created': 'Tue, 22 Nov 2016 16:36:27 GMT'}]",2018-01-03,"[['Niyaz', 'Quamar', ''], ['Sun', 'Weiqing', ''], ['Javaid', 'Ahmad Y', '']]","['Network security', 'Deep Learning', 'Multi-vector DDoS detection', 'Software DefinedNetworking']"
911,1204.1383,Mohamed Lahby,"Mohamed Lahby, Leghris Cherkaoui and Abdellah Adib","An Intelligent Network Selection Strategy Based on MADM Methods in
  Heterogeneous Networks","14 pages, 21 figures","International Journal of Wireless & Mobile Networks (IJWMN) Vol.
  4, No. 1, February 2012, 83-96",10.5121/ijwmn.2012.4106,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Providing service continuity to the end users with best quality is a very
important issue in the next generation wireless communications. With the
evolution of the mobile devices towards a multimode architecture and the
coexistence of multitude of radio access technologies (RAT's), the users are
able to benefit simultaneously from these RAT's. However, the major issue in
heterogeneous wireless communications is how to choose the most suitable access
network for mobile's user which can be used as long as possible for
communication. To achieve this issue, this paper proposes an intelligent
network selection strategy which combines two multi attribute decision making
(MADM) methods such as analytic network process (ANP) and the technique for
order preference by similarity to an ideal solution (TOPSIS) method. The ANP
method is used to find the differentiate weights of available networks by
considering each criterion and the TOPSIS method is applied to rank the
alternatives. Our new strategy for network selection can dealing with the
limitations of MADM methods which are the ranking abnormality and the ping-ponf
effect.
","[{'version': 'v1', 'created': 'Fri, 6 Apr 2012 00:19:04 GMT'}]",2012-04-09,"[['Lahby', 'Mohamed', ''], ['Cherkaoui', 'Leghris', ''], ['Adib', 'Abdellah', '']]","['Heterogeneous Wireless Network', 'Network Selection', 'Multi Attribute Decision Making', 'Ranking Abnormality', 'Ping Pong Effect']"
912,1212.1752,Mriganka Chakraborty,Mriganka Chakraborty and Arka Ghosh,"Hybrid Optimized Back propagation Learning Algorithm For Multi-layer
  Perceptron","Accepted for publish in 18th December, 2012,International Journal of
  Computer Applications, Foundation of Computer Science, New York, USA","International Journal of Computer Applications 60(13):1-5, 2012",10.5120/9749-3332,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Standard neural network based on general back propagation learning using
delta method or gradient descent method has some great faults like poor
optimization of error-weight objective function, low learning rate, instability
.This paper introduces a hybrid supervised back propagation learning algorithm
which uses trust-region method of unconstrained optimization of the error
objective function by using quasi-newton method .This optimization leads to
more accurate weight update system for minimizing the learning error during
learning phase of multi-layer perceptron.[13][14][15] In this paper augmented
line search is used for finding points which satisfies Wolfe condition. In this
paper, This hybrid back propagation algorithm has strong global convergence
properties & is robust & efficient in practice.
","[{'version': 'v1', 'created': 'Sat, 8 Dec 2012 02:47:40 GMT'}]",2012-12-20,"[['Chakraborty', 'Mriganka', ''], ['Ghosh', 'Arka', '']]","['Neural network', 'Back-propagation learning', 'Delta method', 'Gradient Descent', 'Wolfe condition', 'Multi layer perceptron', 'Quasi Newton']"
913,2109.13589,Corrado Monti,"Corrado Monti, Giuseppe Manco, Cigdem Aslay, Francesco Bonchi",Learning Ideological Embeddings from Information Cascades,Published in CIKM 2021,"Proceedings of the 30th ACM International Conference on
  Information and Knowledge Management (CIKM 2021)",10.1145/3459637.3482444,,cs.SI cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modeling information cascades in a social network through the lenses of the
ideological leaning of its users can help understanding phenomena such as
misinformation propagation and confirmation bias, and devising techniques for
mitigating their toxic effects.
  In this paper we propose a stochastic model to learn the ideological leaning
of each user in a multidimensional ideological space, by analyzing the way
politically salient content propagates. In particular, our model assumes that
information propagates from one user to another if both users are interested in
the topic and ideologically aligned with each other. To infer the parameters of
our model, we devise a gradient-based optimization procedure maximizing the
likelihood of an observed set of information cascades. Our experiments on
real-world political discussions on Twitter and Reddit confirm that our model
is able to learn the political stance of the social media users in a
multidimensional ideological space.
","[{'version': 'v1', 'created': 'Tue, 28 Sep 2021 09:58:02 GMT'}]",2021-09-29,"[['Monti', 'Corrado', ''], ['Manco', 'Giuseppe', ''], ['Aslay', 'Cigdem', ''], ['Bonchi', 'Francesco', '']]","['Embedding', 'polarization', 'information diffusion']"
914,1209.1086,Aur\'elien Bellet,Aur\'elien Bellet and Amaury Habrard,Robustness and Generalization for Metric Learning,"16 pages, to appear in Neurocomputing","Neurocomputing,151(1):259-267, 2015",10.1016/j.neucom.2014.09.044,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Metric learning has attracted a lot of interest over the last decade, but the
generalization ability of such methods has not been thoroughly studied. In this
paper, we introduce an adaptation of the notion of algorithmic robustness
(previously introduced by Xu and Mannor) that can be used to derive
generalization bounds for metric learning. We further show that a weak notion
of robustness is in fact a necessary and sufficient condition for a metric
learning algorithm to generalize. To illustrate the applicability of the
proposed framework, we derive generalization results for a large family of
existing metric learning algorithms, including some sparse formulations that
are not covered by previous results.
","[{'version': 'v1', 'created': 'Wed, 5 Sep 2012 19:48:59 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Jul 2013 20:25:54 GMT'}, {'version': 'v3', 'created': 'Mon, 29 Sep 2014 09:27:31 GMT'}]",2019-01-25,"[['Bellet', 'Aurélien', ''], ['Habrard', 'Amaury', '']]","['Metric learning', 'Algorithmic robustness', 'Generalization bounds']"
915,1412.4188,Jan Kyn\v{c}l,"Jan Kyn\v{c}l, Bernard Lidick\'y and Tom\'a\v{s} Vysko\v{c}il",Irreversible 2-conversion set in graphs of bounded degree,"18 pages, 12 figures; journal version","Discrete Mathematics & Theoretical Computer Science, Vol. 19 no.
  3, Graph Theory (September 26, 2017) dmtcs:3952",10.23638/DMTCS-19-3-5,,cs.DM cs.CC math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An irreversible $k$-threshold process (also a $k$-neighbor bootstrap
percolation) is a dynamic process on a graph where vertices change color from
white to black if they have at least $k$ black neighbors. An irreversible
$k$-conversion set of a graph $G$ is a subset $S$ of vertices of $G$ such that
the irreversible $k$-threshold process starting with $S$ black eventually
changes all vertices of $G$ to black. We show that deciding the existence of an
irreversible 2-conversion set of a given size is NP-complete, even for graphs
of maximum degree 4, which answers a question of Dreyer and Roberts.
Conversely, we show that for graphs of maximum degree 3, the minimum size of an
irreversible 2-conversion set can be computed in polynomial time. Moreover, we
find an optimal irreversible 3-conversion set for the toroidal grid,
simplifying constructions of Pike and Zou.
","[{'version': 'v1', 'created': 'Sat, 13 Dec 2014 03:35:20 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Jan 2016 02:39:17 GMT'}, {'version': 'v3', 'created': 'Sat, 26 Nov 2016 18:12:56 GMT'}, {'version': 'v4', 'created': 'Wed, 7 Jun 2017 14:30:44 GMT'}, {'version': 'v5', 'created': 'Fri, 22 Sep 2017 21:04:18 GMT'}]",2019-03-14,"[['Kynčl', 'Jan', ''], ['Lidický', 'Bernard', ''], ['Vyskočil', 'Tomáš', '']]","['irreversible k-conversion process', 'spread of infection', 'bootstrap percolation', 'NP-complete problem', 'matroid parity problem', 'toroidal grid']"
916,2006.16926,Yash Raj Shrestha,"Leopold Franz, Yash Raj Shrestha, Bibek Paudel","A Deep Learning Pipeline for Patient Diagnosis Prediction Using
  Electronic Health Records",,"BIOKDD 2020 at the ACM SIGKDD Conference on Knowledge Discovery
  and Data Mining (KDD) 2020",,,cs.CY cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Augmentation of disease diagnosis and decision-making in healthcare with
machine learning algorithms is gaining much impetus in recent years. In
particular, in the current epidemiological situation caused by COVID-19
pandemic, swift and accurate prediction of disease diagnosis with machine
learning algorithms could facilitate identification and care of vulnerable
clusters of population, such as those having multi-morbidity conditions. In
order to build a useful disease diagnosis prediction system, advancement in
both data representation and development of machine learning architectures are
imperative. First, with respect to data collection and representation, we face
severe problems due to multitude of formats and lack of coherency prevalent in
Electronic Health Records (EHRs). This causes hindrance in extraction of
valuable information contained in EHRs. Currently, no universal global data
standard has been established. As a useful solution, we develop and publish a
Python package to transform public health dataset into an easy to access
universal format. This data transformation to an international health data
format facilitates researchers to easily combine EHR datasets with clinical
datasets of diverse formats. Second, machine learning algorithms that predict
multiple disease diagnosis categories simultaneously remain underdeveloped. We
propose two novel model architectures in this regard. First, DeepObserver,
which uses structured numerical data to predict the diagnosis categories and
second, ClinicalBERT_Multi, that incorporates rich information available in
clinical notes via natural language processing methods and also provides
interpretable visualizations to medical practitioners. We show that both models
can predict multiple diagnoses simultaneously with high accuracy.
","[{'version': 'v1', 'created': 'Tue, 23 Jun 2020 14:58:58 GMT'}]",2021-02-23,"[['Franz', 'Leopold', ''], ['Shrestha', 'Yash Raj', ''], ['Paudel', 'Bibek', '']]","['deep learning', 'health care', 'patient diagnosis prediction', 'clinicalnotes', 'electronic health records']"
917,1612.04742,Stefan Lattner,"Stefan Lattner, Maarten Grachten, Gerhard Widmer","Imposing higher-level Structure in Polyphonic Music Generation using
  Convolutional Restricted Boltzmann Machines and Constraints","31 pages, 11 figures","Journal of Creative Music Systems, Volume 2, Issue 1, March 2018",10.5920/jcms.2018.01,,cs.SD cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a method for imposing higher-level structure on generated,
polyphonic music. A Convolutional Restricted Boltzmann Machine (C-RBM) as a
generative model is combined with gradient descent constraint optimisation to
provide further control over the generation process. Among other things, this
allows for the use of a ""template"" piece, from which some structural properties
can be extracted, and transferred as constraints to the newly generated
material. The sampling process is guided with Simulated Annealing to avoid
local optima, and to find solutions that both satisfy the constraints, and are
relatively stable with respect to the C-RBM. Results show that with this
approach it is possible to control the higher-level self-similarity structure,
the meter, and the tonal properties of the resulting musical piece, while
preserving its local musical coherence.
","[{'version': 'v1', 'created': 'Wed, 14 Dec 2016 17:33:38 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Dec 2016 01:48:52 GMT'}, {'version': 'v3', 'created': 'Thu, 17 Aug 2017 15:21:05 GMT'}, {'version': 'v4', 'created': 'Sat, 14 Apr 2018 12:43:15 GMT'}]",2018-04-18,"[['Lattner', 'Stefan', ''], ['Grachten', 'Maarten', ''], ['Widmer', 'Gerhard', '']]","['Constrained Sampling', 'Convolutional Restricted Boltzmann Machine', 'Music Generation', 'Optimisation']"
918,1303.2364,Rados{\l}aw Michalski,"Jaros{\l}aw Jankowski, Rados{\l}aw Michalski, Przemys{\l}aw Kazienko",The Multidimensional Study of Viral Campaigns as Branching Processes,"In proceedings of the 4th International Conference on Social
  Informatics, SocInfo 2012","Jankowski, J., Michalski, R., Kazienko, P.: The Multidimensional
  Study of Viral Campaigns as Branching Processes. K. Aberer et al. (Eds.):
  LNCS, vol. 7710, pp. 462-474, Springer, Berlin Heidelberg (2012)",10.1007/978-3-642-35386-4_34,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Viral campaigns on the Internet may follow variety of models, depending on
the content, incentives, personal attitudes of sender and recipient to the
content and other factors. Due to the fact that the knowledge of the campaign
specifics is essential for the campaign managers, researchers are constantly
evaluating models and real-world data. The goal of this article is to present
the new knowledge obtained from studying two viral campaigns that took place in
a virtual world which followed the branching process. The results show that it
is possible to reduce the time needed to estimate the model parameters of the
campaign and, moreover, some important aspects of time-generations relationship
are presented.
","[{'version': 'v1', 'created': 'Sun, 10 Mar 2013 19:19:54 GMT'}]",2013-03-12,"[['Jankowski', 'Jarosław', ''], ['Michalski', 'Radosław', ''], ['Kazienko', 'Przemysław', '']]","['viral campaigns', 'diffusion of information', 'branching process', 'social network analysis', 'virtual worlds']"
919,1908.02270,Tianchi Huang,"Tianchi Huang, Chao Zhou, Rui-Xiao Zhang, Chenglei Wu, Xin Yao, Lifeng
  Sun",Comyco: Quality-Aware Adaptive Video Streaming via Imitation Learning,ACM Multimedia 2019,,10.1145/3343031.3351014,,cs.MM cs.AI cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning-based Adaptive Bit Rate~(ABR) method, aiming to learn outstanding
strategies without any presumptions, has become one of the research hotspots
for adaptive streaming. However, it typically suffers from several issues,
i.e., low sample efficiency and lack of awareness of the video quality
information. In this paper, we propose Comyco, a video quality-aware ABR
approach that enormously improves the learning-based methods by tackling the
above issues. Comyco trains the policy via imitating expert trajectories given
by the instant solver, which can not only avoid redundant exploration but also
make better use of the collected samples. Meanwhile, Comyco attempts to pick
the chunk with higher perceptual video qualities rather than video bitrates. To
achieve this, we construct Comyco's neural network architecture, video datasets
and QoE metrics with video quality features. Using trace-driven and real-world
experiments, we demonstrate significant improvements of Comyco's sample
efficiency in comparison to prior work, with 1700x improvements in terms of the
number of samples required and 16x improvements on training time required.
Moreover, results illustrate that Comyco outperforms previously proposed
methods, with the improvements on average QoE of 7.5% - 16.79%. Especially,
Comyco also surpasses state-of-the-art approach Pensieve by 7.37% on average
video quality under the same rebuffering time.
","[{'version': 'v1', 'created': 'Tue, 6 Aug 2019 17:48:46 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Dec 2019 07:54:23 GMT'}]",2019-12-24,"[['Huang', 'Tianchi', ''], ['Zhou', 'Chao', ''], ['Zhang', 'Rui-Xiao', ''], ['Wu', 'Chenglei', ''], ['Yao', 'Xin', ''], ['Sun', 'Lifeng', '']]","['Imitation Learning', 'Quality-aware', 'Adaptive Video Streaming']"
920,1404.3190,Cong Li,"Cong Li, Michael Georgiopoulos, Georgios C. Anagnostopoulos",Pareto-Path Multi-Task Multiple Kernel Learning,Accepted by IEEE Transactions on Neural Networks and Learning Systems,,10.1109/TNNLS.2014.2309939,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A traditional and intuitively appealing Multi-Task Multiple Kernel Learning
(MT-MKL) method is to optimize the sum (thus, the average) of objective
functions with (partially) shared kernel function, which allows information
sharing amongst tasks. We point out that the obtained solution corresponds to a
single point on the Pareto Front (PF) of a Multi-Objective Optimization (MOO)
problem, which considers the concurrent optimization of all task objectives
involved in the Multi-Task Learning (MTL) problem. Motivated by this last
observation and arguing that the former approach is heuristic, we propose a
novel Support Vector Machine (SVM) MT-MKL framework, that considers an
implicitly-defined set of conic combinations of task objectives. We show that
solving our framework produces solutions along a path on the aforementioned PF
and that it subsumes the optimization of the average of objective functions as
a special case. Using algorithms we derived, we demonstrate through a series of
experimental results that the framework is capable of achieving better
classification performance, when compared to other similar MTL approaches.
","[{'version': 'v1', 'created': 'Fri, 11 Apr 2014 19:15:22 GMT'}]",2014-04-14,"[['Li', 'Cong', ''], ['Georgiopoulos', 'Michael', ''], ['Anagnostopoulos', 'Georgios C.', '']]","['Multiple Kernel Learning', 'Multi-task Learning', 'Multi-objective Optimization', 'Pareto Front', 'Support Vector Machines']"
921,2102.03277,Llu\'is Alemany-Puig,"Llu\'is Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho",Minimum projective linearizations of trees in linear time,Updated with latest revision submitted to journal,"Information Processing Letters, 174:106204 (2022)",10.1016/j.ipl.2021.106204,,cs.DS cs.CL cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Minimum Linear Arrangement problem (MLA) consists of finding a mapping
$\pi$ from vertices of a graph to distinct integers that minimizes
$\sum_{\{u,v\}\in E}|\pi(u) - \pi(v)|$. In that setting, vertices are often
assumed to lie on a horizontal line and edges are drawn as semicircles above
said line. For trees, various algorithms are available to solve the problem in
polynomial time in $n=|V|$. There exist variants of the MLA in which the
arrangements are constrained. Iordanskii, and later Hochberg and Stallmann
(HS), put forward $O(n)$-time algorithms that solve the problem when
arrangements are constrained to be planar (also known as one-page book
embeddings). We also consider linear arrangements of rooted trees that are
constrained to be projective (planar embeddings where the root is not covered
by any edge). Gildea and Temperley (GT) sketched an algorithm for projective
arrangements which they claimed runs in $O(n)$ but did not provide any
justification of its cost. In contrast, Park and Levy claimed that GT's
algorithm runs in $O(n \log d_{max})$ where $d_{max}$ is the maximum degree but
did not provide sufficient detail. Here we correct an error in HS's algorithm
for the planar case, show its relationship with the projective case, and derive
simple algorithms for the projective and planar cases that run without a doubt
in $O(n)$ time.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2021 16:35:38 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Feb 2021 14:20:33 GMT'}, {'version': 'v3', 'created': 'Mon, 26 Jul 2021 14:02:41 GMT'}, {'version': 'v4', 'created': 'Wed, 8 Sep 2021 15:19:02 GMT'}, {'version': 'v5', 'created': 'Tue, 3 May 2022 09:21:04 GMT'}]",2022-05-04,"[['Alemany-Puig', 'Lluís', ''], ['Esteban', 'Juan Luis', ''], ['Ferrer-i-Cancho', 'Ramon', '']]","['Linear arrangements', 'Minimum Linear Arrangement Problem', 'Projectivity', 'Planarity', 'One-pageembeddings']"
922,1309.6608,sukhjit Singh Sehra Er.,"Sukhjit Singh Sehra, Jaiteg Singh and Hardeep Singh Rai",Assessment of OpenStreetMap Data - A Review,Review paper,"International Journal of Computer Applications, 76(16):17-20,
  August 2013",10.5120/13331-0888 10.5120/13331-0888,,cs.CY cs.DB cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The meaning and purposes of web has been changing and evolving day by day.
Web 2. 0 encouraged more contribution by the end users. This movement provided
revolutionary methods of sharing and computing data by crowdsourcing such as
OpenStreetmap, also called ""the wikification of maps"" by some researchers. When
crowdsourcing collects huge data with help of general public with varying level
of mapping experience, the focus of researcher should be on analysing the data
rather than collecting it. Researchers have assessed the quality of
OpenStreetMap data by comparing it with proprietary data or data of
governmental map agencies. This study reviews the research work for assessment
of Open- StreetMap Data and also discusses about the future directions.
","[{'version': 'v1', 'created': 'Wed, 25 Sep 2013 18:52:48 GMT'}]",2013-09-26,"[['Sehra', 'Sukhjit Singh', ''], ['Singh', 'Jaiteg', ''], ['Rai', 'Hardeep Singh', '']]","['Openstreetmap', 'Crowdsourcing', 'Volutereed Geographic Information']"
923,1504.02424,Vasileios Kapinas,"Panagiotis D. Diamantoulakis and Vasileios M. Kapinas and George K.
  Karagiannidis",Big Data Analytics for Dynamic Energy Management in Smart Grids,Published in ELSEVIER Big Data Research,"Big Data Research, vol. 2, no. 3, pp. 94-101, Sep. 2015",10.1016/j.bdr.2015.03.003,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The smart electricity grid enables a two-way flow of power and data between
suppliers and consumers in order to facilitate the power flow optimization in
terms of economic efficiency, reliability and sustainability. This
infrastructure permits the consumers and the micro-energy producers to take a
more active role in the electricity market and the dynamic energy management
(DEM). The most important challenge in a smart grid (SG) is how to take
advantage of the users' participation in order to reduce the cost of power.
However, effective DEM depends critically on load and renewable production
forecasting. This calls for intelligent methods and solutions for the real-time
exploitation of the large volumes of data generated by a vast amount of smart
meters. Hence, robust data analytics, high performance computing, efficient
data network management, and cloud computing techniques are critical towards
the optimized operation of SGs. This research aims to highlight the big data
issues and challenges faced by the DEM employed in SG networks. It also
provides a brief description of the most commonly used data processing methods
in the literature, and proposes a promising direction for future research in
the field.
","[{'version': 'v1', 'created': 'Thu, 9 Apr 2015 19:04:35 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Apr 2015 17:47:34 GMT'}, {'version': 'v3', 'created': 'Thu, 30 Jul 2015 16:22:40 GMT'}]",2015-07-31,"[['Diamantoulakis', 'Panagiotis D.', ''], ['Kapinas', 'Vasileios M.', ''], ['Karagiannidis', 'George K.', '']]","['Big data', 'Smart grids', 'Dynamic energy management', 'Predictive analytics', 'Artificial intelligence', 'highperformance computing']"
924,1007.5130,Secretary  Ijaia,"Giuseppe Della Penna (1), Benedetto Intrigila (2), Daniele Magazzeni
  (3) and Fabio Mercorio (1) ((1) University of L'Aquila, Italy, (2) University
  of Rome, Italy and (3) University of Chieti, Italy)",Resource-Optimal Planning For An Autonomous Planetary Vehicle,"15 pages, 4 figures","International Journal of Artificial Intelligence & Applications
  1.3 (2010) 15-29",10.5121/ijaia.2010.1302,,cs.AI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Autonomous planetary vehicles, also known as rovers, are small autonomous
vehicles equipped with a variety of sensors used to perform exploration and
experiments on a planet's surface. Rovers work in a partially unknown
environment, with narrow energy/time/movement constraints and, typically, small
computational resources that limit the complexity of on-line planning and
scheduling, thus they represent a great challenge in the field of autonomous
vehicles. Indeed, formal models for such vehicles usually involve hybrid
systems with nonlinear dynamics, which are difficult to handle by most of the
current planning algorithms and tools. Therefore, when offline planning of the
vehicle activities is required, for example for rovers that operate without a
continuous Earth supervision, such planning is often performed on simplified
models that are not completely realistic. In this paper we show how the
UPMurphi model checking based planning tool can be used to generate
resource-optimal plans to control the engine of an autonomous planetary
vehicle, working directly on its hybrid model and taking into account several
safety constraints, thus achieving very accurate results.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2010 07:27:25 GMT'}]",2010-07-30,"[['Della Penna', 'Giuseppe', ''], ['Intrigila', 'Benedetto', ''], ['Magazzeni', 'Daniele', ''], ['Mercorio', 'Fabio', '']]","['AI Planning', 'Autonomous Vehicles', 'Model Checking']"
925,2204.13536,Giancarlo Ruffo,"Rossano Gaeta, Michele Garetto, Giancarlo Ruffo, and Alessandro
  Flammini","Reconciling the Quality vs Popularity Dichotomy in Online Cultural
  Markets",ACM Trans. Inf. Syst. April 2022,"ACM Transactions on Information Systems Volume 41 Issue 1 January
  2023 Article No 25",10.1145/3530790,,cs.SI cs.CY cs.IR,http://creativecommons.org/licenses/by/4.0/,"  We propose a simple model of an idealized online cultural market in which $N$
items, endowed with a hidden quality metric, are recommended to users by a
ranking algorithm possibly biased by the current items' popularity. Our goal is
to better understand the underlying mechanisms of the well-known fact that
popularity bias can prevent higher-quality items from becoming more popular
than lower-quality items, producing an undesirable misalignment between quality
and popularity rankings. We do so under the assumption that users, having
limited time/attention, are able to discriminate the best-quality only within a
random subset of the items. We discover the existence of a harmful regime in
which improper use of popularity can seriously compromise the emergence of
quality, and a benign regime in which wise use of popularity, coupled with a
small discrimination effort on behalf of users, guarantees the perfect
alignment of quality and popularity ranking. Our findings clarify the effects
of algorithmic popularity bias on quality outcomes, and may inform the design
of more principled mechanisms for techno-social cultural markets.
","[{'version': 'v1', 'created': 'Thu, 28 Apr 2022 14:36:11 GMT'}]",2023-01-18,"[['Gaeta', 'Rossano', ''], ['Garetto', 'Michele', ''], ['Ruffo', 'Giancarlo', ''], ['Flammini', 'Alessandro', '']]","['online cultural markets', 'ranking algorithms', 'popularity bias', 'retrieval diversity']"
926,1901.07601,Yanshan Wang,"Sijia Liu, Yanshan Wang, Andrew Wen, Liwei Wang, Na Hong, Feichen
  Shen, Steven Bedrick, William Hersh, Hongfang Liu","CREATE: Cohort Retrieval Enhanced by Analysis of Text from Electronic
  Health Records using OMOP Common Data Model",,,10.2196/17376,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Widespread adoption of electronic health records (EHRs) has
enabled secondary use of EHR data for clinical research and healthcare
delivery. Natural language processing (NLP) techniques have shown promise in
their capability to extract the embedded information in unstructured clinical
data, and information retrieval (IR) techniques provide flexible and scalable
solutions that can augment the NLP systems for retrieving and ranking relevant
records. Methods: In this paper, we present the implementation of Cohort
Retrieval Enhanced by Analysis of Text from EHRs (CREATE), a cohort retrieval
system that can execute textual cohort selection queries on both structured and
unstructured EHR data. CREATE is a proof-of-concept system that leverages a
combination of structured queries and IR techniques on NLP results to improve
cohort retrieval performance while adopting the Observational Medical Outcomes
Partnership (OMOP) Common Data Model (CDM) to enhance model portability. The
NLP component empowered by cTAKES is used to extract CDM concepts from textual
queries. We design a hierarchical index in Elasticsearch to support CDM concept
search utilizing IR techniques and frameworks. Results: Our case study on 5
cohort identification queries evaluated using the IR metric, P@5 (Precision at
5) at both the patient-level and document-level, demonstrates that CREATE
achieves an average P@5 of 0.90, which outperforms systems using only
structured data or only unstructured data with average P@5s of 0.54 and 0.74,
respectively.
","[{'version': 'v1', 'created': 'Tue, 22 Jan 2019 20:05:11 GMT'}]",2021-06-15,"[['Liu', 'Sijia', ''], ['Wang', 'Yanshan', ''], ['Wen', 'Andrew', ''], ['Wang', 'Liwei', ''], ['Hong', 'Na', ''], ['Shen', 'Feichen', ''], ['Bedrick', 'Steven', ''], ['Hersh', 'William', ''], ['Liu', 'Hongfang', '']]","['(4-6) cohort retrieval', 'information retrieval', 'common data model', 'electronic health records', 'natural language processing']"
927,1607.01971,Guillaume Noyel,"Guillaume Noyel (IPRI), Rebecca Thomas, Gavin Bhakta (DESW), Andrew
  Crowder (DESW), David Owens, Peter Boyle (SIGPH@iPRI, IPRI)","Superimposition of eye fundus images for longitudinal analysis from
  large public health databases","This is an author-created, un-copyedited version of an article
  published in Biomedical Physics \& Engineering Express. IOP Publishing Ltd is
  not responsible for any errors or omissions in this version of the manuscript
  or any version derived from it. The Version of Record is available online at
  https://doi.org/10.1088/2057-1976/aa7d16","Biomedical Physics \& Engineering Express, 2017, 3 (4)",10.1088/2057-1976/aa7d16,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a method is presented for superimposition (i.e. registration)
of eye fundus images from persons with diabetes screened over many years for
diabetic retinopathy. The method is fully automatic and robust to camera
changes and colour variations across the images both in space and time. All the
stages of the process are designed for longitudinal analysis of cohort public
health databases where retinal examinations are made at approximately yearly
intervals. The method relies on a model correcting two radial distortions and
an affine transformation between pairs of images which is robustly fitted on
salient points. Each stage involves linear estimators followed by non-linear
optimisation. The model of image warping is also invertible for fast
computation. The method has been validated (1) on a simulated montage and (2)
on public health databases with 69 patients with high quality images (271 pairs
acquired mostly with different types of camera and 268 pairs acquired mostly
with the same type of camera) with success rates of 92% and 98%, and five
patients (20 pairs) with low quality images with a success rate of 100%.
Compared to two state-of-the-art methods, ours gives better results.
","[{'version': 'v1', 'created': 'Thu, 7 Jul 2016 11:43:24 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Aug 2017 09:44:05 GMT'}, {'version': 'v3', 'created': 'Wed, 18 Jul 2018 13:07:32 GMT'}]",2018-11-28,"[['Noyel', 'Guillaume', '', 'IPRI'], ['Thomas', 'Rebecca', '', 'DESW'], ['Bhakta', 'Gavin', '', 'DESW'], ['Crowder', 'Andrew', '', 'DESW'], ['Owens', 'David', '', 'SIGPH@iPRI, IPRI'], ['Boyle', 'Peter', '', 'SIGPH@iPRI, IPRI']]","['eye fundus images', 'image registration', 'invertible model', 'longitudinal analysis', 'public health databases', 'radial distortion', 'diabetic retinopathy']"
928,1007.4591,Rio Yokota Dr.,"Rio Yokota, Jaydeep P. Bardhan, Matthew G. Knepley, L. A. Barba,
  Tsuyoshi Hamada","Biomolecular electrostatics using a fast multipole BEM on up to 512 GPUs
  and a billion unknowns",,"Comput. Phys. Commun., 182(6):1271-1283 (2011)",10.1016/j.cpc.2011.02.013,,cs.CE physics.chem-ph physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present teraflop-scale calculations of biomolecular electrostatics enabled
by the combination of algorithmic and hardware acceleration. The algorithmic
acceleration is achieved with the fast multipole method (FMM) in conjunction
with a boundary element method (BEM) formulation of the continuum electrostatic
model, as well as the BIBEE approximation to BEM. The hardware acceleration is
achieved through graphics processors, GPUs. We demonstrate the power of our
algorithms and software for the calculation of the electrostatic interactions
between biological molecules in solution. The applications demonstrated include
the electrostatics of protein--drug binding and several multi-million atom
systems consisting of hundreds to thousands of copies of lysozyme molecules.
The parallel scalability of the software was studied in a cluster at the
Nagasaki Advanced Computing Center, using 128 nodes, each with 4 GPUs. Delicate
tuning has resulted in strong scaling with parallel efficiency of 0.8 for 256
and 0.5 for 512 GPUs. The largest application run, with over 20 million atoms
and one billion unknowns, required only one minute on 512 GPUs. We are
currently adapting our BEM software to solve the linearized Poisson-Boltzmann
equation for dilute ionic solutions, and it is also designed to be flexible
enough to be extended for a variety of integral equation problems, ranging from
Poisson problems to Helmholtz problems in electromagnetics and acoustics to
high Reynolds number flow.
","[{'version': 'v1', 'created': 'Mon, 26 Jul 2010 23:27:16 GMT'}, {'version': 'v2', 'created': 'Sun, 17 Oct 2010 18:29:02 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Feb 2011 22:07:03 GMT'}]",2011-09-21,"[['Yokota', 'Rio', ''], ['Bardhan', 'Jaydeep P.', ''], ['Knepley', 'Matthew G.', ''], ['Barba', 'L. A.', ''], ['Hamada', 'Tsuyoshi', '']]","['bioelectrostatics', 'fast multipole method', 'boundary element method', 'integral equations', 'graphicsprocessors', 'GPU']"
929,1707.04038,Daniel Anderson,Daniel Anderson and Jerome Droniou,"An arbitrary order scheme on generic meshes for miscible displacements
  in porous media",,"SIAM J. Sci. Comput. 40 (4), B1020-B1054, 2018",10.1137/17M1138807,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We design, analyse and implement an arbitrary order scheme applicable to
generic meshes for a coupled elliptic-parabolic PDE system describing miscible
displacement in porous media. The discretisation is based on several
adaptations of the Hybrid-High-Order (HHO) method due to Di Pietro et al.
[Computational Methods in Applied Mathematics, 14(4), (2014)]. The equation
governing the pressure is discretised using an adaptation of the HHO method for
variable diffusion, while the discrete concentration equation is based on the
HHO method for advection-diffusion-reaction problems combined with numerically
stable flux reconstructions for the advective velocity that we have derived
using the results of Cockburn et al. [ESAIM: Mathematical Modelling and
Numerical Analysis, 50(3), (2016)]. We perform some rigorous analysis of the
method to demonstrate its $L^2$ stability under the irregular data often
presented by reservoir engineering problems and present several numerical tests
to demonstrate the quality of the results that are produced by the proposed
scheme.
","[{'version': 'v1', 'created': 'Thu, 13 Jul 2017 09:31:26 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Nov 2017 12:12:26 GMT'}, {'version': 'v3', 'created': 'Thu, 15 Mar 2018 02:55:06 GMT'}, {'version': 'v4', 'created': 'Mon, 14 Jan 2019 19:11:07 GMT'}]",2019-01-16,"[['Anderson', 'Daniel', ''], ['Droniou', 'Jerome', '']]","['hybrid high-order methods', 'porous medium', 'miscible fluid flow', 'stabilityanalysis', 'numerical tests']"
930,1705.02801,Palash Goyal,"Palash Goyal, Emilio Ferrara","Graph Embedding Techniques, Applications, and Performance: A Survey",Submitted to Knowledge Based Systems for review,"Knowledge Based Systems, Volume 151, 1 July 2018, Pages 78-94,
  2018",10.1016/j.knosys.2018.03.022,,cs.SI cs.LG physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graphs, such as social networks, word co-occurrence networks, and
communication networks, occur naturally in various real-world applications.
Analyzing them yields insight into the structure of society, language, and
different patterns of communication. Many approaches have been proposed to
perform the analysis. Recently, methods which use the representation of graph
nodes in vector space have gained traction from the research community. In this
survey, we provide a comprehensive and structured analysis of various graph
embedding techniques proposed in the literature. We first introduce the
embedding task and its challenges such as scalability, choice of
dimensionality, and features to be preserved, and their possible solutions. We
then present three categories of approaches based on factorization methods,
random walks, and deep learning, with examples of representative algorithms in
each category and analysis of their performance on various tasks. We evaluate
these state-of-the-art methods on a few common datasets and compare their
performance against one another. Our analysis concludes by suggesting some
potential applications and future directions. We finally present the
open-source Python library we developed, named GEM (Graph Embedding Methods,
available at https://github.com/palash1992/GEM), which provides all presented
algorithms within a unified interface to foster and facilitate research on the
topic.
","[{'version': 'v1', 'created': 'Mon, 8 May 2017 09:47:38 GMT'}, {'version': 'v2', 'created': 'Tue, 9 May 2017 17:28:21 GMT'}, {'version': 'v3', 'created': 'Sun, 10 Dec 2017 17:24:19 GMT'}, {'version': 'v4', 'created': 'Fri, 22 Dec 2017 20:42:06 GMT'}]",2019-08-22,"[['Goyal', 'Palash', ''], ['Ferrara', 'Emilio', '']]","['Graph embedding techniques', 'Graph embedding applications', 'Python Graph Embedding Methods GEM Library']"
931,1612.01263,Martin Jon\'a\v{s},"Martin Jon\'a\v{s}, Jan Strej\v{c}ek","On the Complexity of the Quantified Bit-Vector Arithmetic with Binary
  Encoding",,"Published in Information Processing Letters, 2018, vol. 135C",10.1016/j.ipl.2018.02.018,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the precise computational complexity of deciding satisfiability of
first-order quantified formulas over the theory of fixed-size bit-vectors with
binary-encoded bit-widths and constants. This problem is known to be in
EXPSPACE and to be NEXPTIME-hard. We show that this problem is complete for the
complexity class AEXP(poly) -- the class of problems decidable by an
alternating Turing machine using exponential time, but only a polynomial number
of alternations between existential and universal states.
","[{'version': 'v1', 'created': 'Mon, 5 Dec 2016 07:41:08 GMT'}, {'version': 'v2', 'created': 'Tue, 16 May 2017 16:58:38 GMT'}, {'version': 'v3', 'created': 'Tue, 7 Nov 2017 22:01:51 GMT'}, {'version': 'v4', 'created': 'Wed, 2 May 2018 06:37:32 GMT'}]",2018-05-03,"[['Jonáš', 'Martin', ''], ['Strejček', 'Jan', '']]","['computational complexity', 'satisfiability modulo theories', 'fixed-sizebit-vectors']"
932,1805.08694,Markus Haltmeier,"Hessel Tuinhof, Clemens Pirker, Markus Haltmeier",Image Based Fashion Product Recommendation with Deep Learning,,"LOD: International Conference on Machine Learning, Optimization,
  and Data Science Machine Learning, Optimization, and Data Science 4th
  International Conference, LOD 2018, Volterra, Italy, September 13-16, 2018,
  Revised Selected Papers",10.1007/978-3-030-13709-0_40,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop a two-stage deep learning framework that recommends fashion images
based on other input images of similar style. For that purpose, a neural
network classifier is used as a data-driven, visually-aware feature extractor.
The latter then serves as input for similarity-based recommendations using a
ranking algorithm. Our approach is tested on the publicly available Fashion
dataset. Initialization strategies using transfer learning from larger product
databases are presented. Combined with more traditional content-based
recommendation systems, our framework can help to increase robustness and
performance, for example, by better matching a particular customer style.
","[{'version': 'v1', 'created': 'Sun, 6 May 2018 18:14:51 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Jul 2018 21:05:33 GMT'}]",2019-03-20,"[['Tuinhof', 'Hessel', ''], ['Pirker', 'Clemens', ''], ['Haltmeier', 'Markus', '']]","['Product recommendation', 'deep learning', 'convolutional neural networks', 'similarity recommendation']"
933,1404.1301,Zohreh Zahedi,"Zohreh Zahedi, Rodrigo Costas and Paul Wouters","How well developed are altmetrics? A cross-disciplinary analysis of the
  presence of 'alternative metrics' in scientific publications",,,10.1007/s11192-014-1264-0,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper an analysis of the presence and possibilities of altmetrics for
bibliometric and performance analysis is carried out. Using the web based tool
Impact Story, we collected metrics for 20,000 random publications from the Web
of Science. We studied both the presence and distribution of altmetrics in the
set of publications, across fields, document types and over publication years,
as well as the extent to which altmetrics correlate with citation indicators.
The main result of the study is that the altmetrics source that provides the
most metrics is Mendeley, with metrics on readerships for 62.6% of all the
publications studied, other sources only provide marginal information. In terms
of relation with citations, a moderate spearman correlation (r=0.49) has been
found between Mendeley readership counts and citation indicators. Other
possibilities and limitations of these indicators are discussed and future
research lines are outlined.
","[{'version': 'v1', 'created': 'Fri, 21 Feb 2014 10:01:48 GMT'}]",2014-04-07,"[['Zahedi', 'Zohreh', ''], ['Costas', 'Rodrigo', ''], ['Wouters', 'Paul', '']]","['Altmetrics', 'Impact Story', 'Citation indicators', 'Research evaluation']"
934,1706.06696,Mat\'ias Mattamala,"Mat\'ias Mattamala, Gonzalo Olave, Clayder Gonz\'alez, Nicol\'as
  Hasb\'un and Javier Ruiz-del-Solar","The NAO Backpack: An Open-hardware Add-on for Fast Software Development
  with the NAO Robot","Accepted in the RoboCup Symposium 2017. Final version will be
  published at Springer",,10.1007/978-3-030-00308-1_25,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an open-source accessory for the NAO robot, which enables to test
computationally demanding algorithms in an external platform while preserving
robot's autonomy and mobility. The platform has the form of a backpack, which
can be 3D printed and replicated, and holds an ODROID XU4 board to process
algorithms externally with ROS compatibility. We provide also a software bridge
between the B-Human's framework and ROS to have access to the robot's sensors
close to real-time. We tested the platform in several robotics applications
such as data logging, visual SLAM, and robot vision with deep learning
techniques. The CAD model, hardware specifications and software are available
online for the benefit of the community:
https://github.com/uchile-robotics/nao-backpack
","[{'version': 'v1', 'created': 'Tue, 20 Jun 2017 22:53:16 GMT'}]",2022-07-01,"[['Mattamala', 'Matías', ''], ['Olave', 'Gonzalo', ''], ['González', 'Clayder', ''], ['Hasbún', 'Nicolás', ''], ['Ruiz-del-Solar', 'Javier', '']]","['NAO robot', 'SPL', 'ODROID XU-4', 'ROS']"
935,1709.07676,Pekka Abrahamsson,"Anh Nguyen-Duc, Soudabeh Khodambashi, Jon Atle Gulla, John Krogstie
  and Pekka Abrahamsson","Female Leadership in Software Projects: A Preliminary Result on
  Leadership Style and Project Context Factors","This is the author's version of the work. Copyright holder's version
  can be accessed at
  https://link.springer.com/chapter/10.1007/978-3-319-65208-5_11","Kosiuczenko P., Madeyski L. (eds) Towards a Synergistic
  Combination of Research and Practice in Software Engineering. Studies in
  Computational Intelligence, vol 733, pp. 149-163, Springer, Cham, 2018",10.1007/978-3-319-65208-5_11,,cs.SE cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Women have been shown to be effective leaders in many team-based situations.
However, it is also well-recognized that women are underrepresented in
engineering and technology areas, which leads to wasted efforts and a lack of
diversity in professional organizations. Although studies about gender and
leadership are rich, research focusing on engineering-specific activities, are
scarce. To react on this gap, we explored the experience of female leaders of
software development projects and possible context factors that influence
leadership effectiveness. The study was conducted as a longitudinal multiple
case study. Data was collected from survey, interviews, observation and project
reports. In this work, we reported some preliminary findings related to
leadership style, team perception on leadership and team-task context factors.
We found a strong correlation between perceived team leadership and task
management. We also observed a potential association between human-oriented
leading approach in low customer involvement scenarios and task-oriented
leading approach in high customer involvement situations.
","[{'version': 'v1', 'created': 'Fri, 22 Sep 2017 10:17:51 GMT'}]",2017-09-25,"[['Nguyen-Duc', 'Anh', ''], ['Khodambashi', 'Soudabeh', ''], ['Gulla', 'Jon Atle', ''], ['Krogstie', 'John', ''], ['Abrahamsson', 'Pekka', '']]","['female leadership', 'software engineering', 'contingency model', 'project contextual factors', 'team coordination', 'team performance']"
936,1706.01014,Ming Yan,Xiaolin Huang and Ming Yan,"Nonconvex penalties with analytical solutions for one-bit compressive
  sensing",,"X. Huang and M. Yan, Non-convex penalties with analytical
  solutions for one-bit compressive sensing, Signal Processing, 144 (2018),
  341-351",10.1016/j.sigpro.2017.10.023,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One-bit measurements widely exist in the real world, and they can be used to
recover sparse signals. This task is known as the problem of learning
halfspaces in learning theory and one-bit compressive sensing (1bit-CS) in
signal processing. In this paper, we propose novel algorithms based on both
convex and nonconvex sparsity-inducing penalties for robust 1bit-CS. We provide
a sufficient condition to verify whether a solution is globally optimal or not.
Then we show that the globally optimal solution for positive homogeneous
penalties can be obtained in two steps: a proximal operator and a normalization
step. For several nonconvex penalties, including minimax concave penalty (MCP),
$\ell_0$ norm, and sorted $\ell_1$ penalty, we provide fast algorithms for
finding the analytical solutions by solving the dual problem. Specifically, our
algorithm is more than $200$ times faster than the existing algorithm for MCP.
Its efficiency is comparable to the algorithm for the $\ell_1$ penalty in time,
while its performance is much better. Among these penalties, the sorted
$\ell_1$ penalty is most robust to noise in different settings.
","[{'version': 'v1', 'created': 'Sun, 4 Jun 2017 02:17:12 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Nov 2017 21:44:00 GMT'}]",2017-11-08,"[['Huang', 'Xiaolin', ''], ['Yan', 'Ming', '']]","['one-bit compressed sensing', 'nonconvex penalty', 'analytical']"
937,1503.06289,Pritheega Magalingam,"Pritheega Magalingam, Stephen Davis, Asha Rao",Using shortest path to discover criminal community,,DIIN584 2015,10.1016/j.diin.2015.08.002,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Extracting communities using existing community detection algorithms yields
dense sub-networks that are difficult to analyse. Extracting a smaller sample
that embodies the relationships of a list of suspects is an important part of
the beginning of an investigation. In this paper, we present the efficacy of
our shortest paths network search algorithm (SPNSA) that begins with an
""algorithm feed"", a small subset of nodes of particular interest, and builds an
investigative sub-network. The algorithm feed may consist of known criminals or
suspects, or persons of influence. This sets our approach apart from existing
community detection algorithms. We apply the SPNSA on the Enron Dataset of
e-mail communications starting with those convicted of money laundering in
relation to the collapse of Enron as the algorithm feed. The algorithm produces
sparse and small sub-networks that could feasibly identify a list of persons
and relationships to be further investigated. In contrast, we show that
identifying sub-networks of interest using either community detection
algorithms or a k-Neighbourhood approach produces sub-networks of much larger
size and complexity. When the 18 top managers of Enron were used as the
algorithm feed, the resulting sub-network identified 4 convicted criminals that
were not managers and so not part of the algorithm feed. We also directly
tested the SPNSA by removing one of the convicted criminals from the algorithm
feed and re-running the algorithm; in 5 out of 9 cases the left out criminal
occurred in the resulting sub-network.
","[{'version': 'v1', 'created': 'Sat, 21 Mar 2015 12:27:49 GMT'}]",2015-09-01,"[['Magalingam', 'Pritheega', ''], ['Davis', 'Stephen', ''], ['Rao', 'Asha', '']]","['Criminal network', 'Shortest path', 'Leave-one-out', 'Trust', 'Suspect', 'Investigation']"
938,1903.00923,Jun Li,"Jun Li, Xiaozhu Lin, Hui Che, Hao Li, Xiaohua Qian","Pancreas segmentation with probabilistic map guided bi-directional
  recurrent UNet",accepted by Physics in Medicine & Biology,"Physics in Medicine & Biology, 66(11), 115010 (2021)",10.1088/1361-6560/abfce3,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pancreas segmentation in medical imaging data is of great significance for
clinical pancreas diagnostics and treatment. However, the large population
variations in the pancreas shape and volume cause enormous segmentation
difficulties, even for state-of-the-art algorithms utilizing
fully-convolutional neural networks (FCNs). Specifically, pancreas segmentation
suffers from the loss of spatial information in 2D methods, and the high
computational cost of 3D methods. To alleviate these problems, we propose a
probabilistic-map-guided bi-directional recurrent UNet (PBR-UNet) architecture,
which fuses intra-slice information and inter-slice probabilistic maps into a
local 3D hybrid regularization scheme, which is followed by bi-directional
recurrent network optimization. The PBR-UNet method consists of an initial
estimation module for efficiently extracting pixel-level probabilistic maps and
a primary segmentation module for propagating hybrid information through a 2.5D
U-Net architecture. Specifically, local 3D information is inferred by combining
an input image with the probabilistic maps of the adjacent slices into
multichannel hybrid data, and then hierarchically aggregating the hybrid
information of the entire segmentation network. Besides, a bi-directional
recurrent optimization mechanism is developed to update the hybrid information
in both the forward and the backward directions. This allows the proposed
network to make full and optimal use of the local context information.
Quantitative and qualitative evaluation was performed on the NIH Pancreas-CT
dataset, and our proposed PBR-UNet method achieved better segmentation results
with less computational cost compared to other state-of-the-art methods.
","[{'version': 'v1', 'created': 'Sun, 3 Mar 2019 15:13:33 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Mar 2019 16:00:54 GMT'}, {'version': 'v3', 'created': 'Sun, 7 Apr 2019 15:21:28 GMT'}, {'version': 'v4', 'created': 'Sun, 15 Dec 2019 15:16:04 GMT'}, {'version': 'v5', 'created': 'Thu, 13 May 2021 12:31:52 GMT'}, {'version': 'v6', 'created': 'Thu, 11 Aug 2022 15:33:22 GMT'}]",2022-08-12,"[['Li', 'Jun', ''], ['Lin', 'Xiaozhu', ''], ['Che', 'Hui', ''], ['Li', 'Hao', ''], ['Qian', 'Xiaohua', '']]","['pancreas segmentation', 'bi-directional recurrent UNet', 'medical image segmentation']"
939,1808.09630,"Konstantin L\""aufer","Konstantin L\""aufer, John O'Sullivan, George K. Thiruvathukal","Tests as Maintainable Assets Via Auto-generated Spies: A case study
  involving the Scala collections library's Iterator trait",,"Proc. 10th ACM SIGPLAN Symposium on Scala (Scala '19), pp17-21,
  London, UK, July 17, 2019",10.1145/3337932.3338814,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In testing stateful abstractions, it is often necessary to record
interactions, such as method invocations, and express assertions over these
interactions. Following the Test Spy design pattern, we can reify such
interactions programmatically through additional mutable state. Alternatively,
a mocking framework, such as Mockito, can automatically generate test spies
that allow us to record the interactions and express our expectations in a
declarative domain-specific language. According to our study of the test code
for Scala's Iterator trait, the latter approach can lead to a significant
reduction of test code complexity in terms of metrics such as code size (in
some cases over 70% smaller), cyclomatic complexity, and amount of additional
mutable state required. In this tools paper, we argue that the resulting test
code is not only more maintainable, readable, and intentional, but also a
better stylistic match for the Scala community than manually implemented,
explicitly stateful test spies.
","[{'version': 'v1', 'created': 'Wed, 29 Aug 2018 04:05:26 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Jan 2019 18:58:36 GMT'}, {'version': 'v3', 'created': 'Fri, 23 Aug 2019 01:04:36 GMT'}]",2019-08-26,"[['Läufer', 'Konstantin', ''], [""O'Sullivan"", 'John', ''], ['Thiruvathukal', 'George K.', '']]","['Automated unit testing', 'mock-based testing', 'spy-based testing', 'test code complexity', 'test code metrics', 'Iterator design pattern', 'stream processing', 'prefx sum']"
940,1511.04094,Harsh Taneja,"Harsh Taneja, James Webster","How Do Global Audiences Take Shape? The Role of Institutions and Culture
  in Patterns of Web Use","Suggested Citation: Taneja. H & Webster. J.G. (In Press). How Do
  Global Audiences Take Shape? The Role of Institutions and Culture in Shaping
  Patterns of Web Use. Journal of Communication",,10.1111/jcom.12200,,cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study investigates the role of both cultural and technological factors
in determining audience formation on a global scale. It integrates theories of
media choice with theories of global cultural consumption and tests them by
analyzing shared audience traffic between the world's 1000 most popular
Websites. We find that language and geographic similarities are more powerful
predictors of audience overlap than hyperlinks and genre similarity,
highlighting the role of cultural structures in shaping global media use.
","[{'version': 'v1', 'created': 'Thu, 12 Nov 2015 21:13:06 GMT'}]",2016-03-11,"[['Taneja', 'Harsh', ''], ['Webster', 'James', '']]","['Globalization', 'WWW Use', 'Media Choice', 'Audience Behavior', 'Network']"
941,2203.01654,Manu Lahariya,"Manu Lahariya, Nasrin Sadeghianpourhamami and Chris Develder","Optimized cost function for demand response coordination of multiple EV
  charging stations using reinforcement learning",,"Proceedings of the 6th ACM International Conference on Systems for
  Energy-Efficient Buildings, Cities, and Transportation (BuildSys 19),
  November 2019 Pages 344 345",10.1145/3360322.3360992,,cs.AI,http://creativecommons.org/licenses/by-sa/4.0/,"  Electric vehicle (EV) charging stations represent a substantial load with
significant flexibility. The exploitation of that flexibility in demand
response (DR) algorithms becomes increasingly important to manage and balance
demand and supply in power grids. Model-free DR based on reinforcement learning
(RL) is an attractive approach to balance such EV charging load. We build on
previous research on RL, based on a Markov decision process (MDP) to
simultaneously coordinate multiple charging stations. However, we note that the
computationally expensive cost function adopted in the previous research leads
to large training times, which limits the feasibility and practicality of the
approach. We, therefore, propose an improved cost function that essentially
forces the learned control policy to always fulfill any charging demand that
does not offer any flexibility. We rigorously compare the newly proposed batch
RL fitted Q-iteration implementation with the original (costly) one, using
real-world data. Specifically, for the case of load flattening, we compare the
two approaches in terms of (i) the processing time to learn the RL-based
charging policy, as well as (ii) the overall performance of the policy
decisions in terms of meeting the target load for unseen test data. The
performance is analyzed for different training periods and varying training
sample sizes. In addition to both RL policies performance results, we provide
performance bounds in terms of both (i) an optimal all-knowing strategy, and
(ii) a simple heuristic spreading individual EV charging uniformly over time
","[{'version': 'v1', 'created': 'Thu, 3 Mar 2022 11:22:27 GMT'}]",2022-03-04,"[['Lahariya', 'Manu', ''], ['Sadeghianpourhamami', 'Nasrin', ''], ['Develder', 'Chris', '']]","['Smart grid', 'demand response', 'electric vehicle', 'smart charging', 'reinforcement learning', 'markov decision process']"
942,1801.05161,Sergi Nadal,"Sergi Nadal, Oscar Romero, Alberto Abell\'o, Panos Vassiliadis and
  Stijn Vansummeren","An Integration-Oriented Ontology to Govern Evolution in Big Data
  Ecosystems",Preprint submitted to Information Systems. 35 pages,,10.1016/j.is.2018.01.006,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Big Data architectures allow to flexibly store and process heterogeneous
data, from multiple sources, in their original format. The structure of those
data, commonly supplied by means of REST APIs, is continuously evolving. Thus
data analysts need to adapt their analytical processes after each API release.
This gets more challenging when performing an integrated or historical
analysis. To cope with such complexity, in this paper, we present the Big Data
Integration ontology, the core construct to govern the data integration process
under schema evolution by systematically annotating it with information
regarding the schema of the sources. We present a query rewriting algorithm
that, using the annotated ontology, converts queries posed over the ontology to
queries over the sources. To cope with syntactic evolution in the sources, we
present an algorithm that semi-automatically adapts the ontology upon new
releases. This guarantees ontology-mediated queries to correctly retrieve data
from the most recent schema version as well as correctness in historical
queries. A functional and performance evaluation on real-world APIs is
performed to validate our approach.
","[{'version': 'v1', 'created': 'Tue, 16 Jan 2018 08:55:41 GMT'}]",2018-02-05,"[['Nadal', 'Sergi', ''], ['Romero', 'Oscar', ''], ['Abelló', 'Alberto', ''], ['Vassiliadis', 'Panos', ''], ['Vansummeren', 'Stijn', '']]","['Data integration', 'Evolution', 'Semantic web']"
943,1808.09413,Jianmin Guo,"Jianmin Guo, Yu Jiang, Yue Zhao, Quan Chen, and Jiaguang Sun",DLFuzz: Differential Fuzzing Testing of Deep Learning Systems,This paper is to appear in ESEC/FSE'2018 (NIER track),,10.1145/3236024.3264835,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning (DL) systems are increasingly applied to safety-critical
domains such as autonomous driving cars. It is of significant importance to
ensure the reliability and robustness of DL systems. Existing testing
methodologies always fail to include rare inputs in the testing dataset and
exhibit low neuron coverage. In this paper, we propose DLFuzz, the frst
differential fuzzing testing framework to guide DL systems exposing incorrect
behaviors. DLFuzz keeps minutely mutating the input to maximize the neuron
coverage and the prediction difference between the original input and the
mutated input, without manual labeling effort or cross-referencing oracles from
other DL systems with the same functionality. We present empirical evaluations
on two well-known datasets to demonstrate its efficiency. Compared with
DeepXplore, the state-of-the-art DL whitebox testing framework, DLFuzz does not
require extra efforts to find similar functional DL systems for
cross-referencing check, but could generate 338.59% more adversarial inputs
with 89.82% smaller perturbations, averagely obtain 2.86% higher neuron
coverage, and save 20.11% time consumption.
","[{'version': 'v1', 'created': 'Tue, 28 Aug 2018 17:08:38 GMT'}]",2018-08-29,"[['Guo', 'Jianmin', ''], ['Jiang', 'Yu', ''], ['Zhao', 'Yue', ''], ['Chen', 'Quan', ''], ['Sun', 'Jiaguang', '']]","['Fuzzing Testing', 'Deep Learning', 'Neuron Coverage']"
944,2009.10632,Armin Moin,"Armin Moin, Stephan R\""ossler, Marouane Sayih, Stephan G\""unnemann","From Things' Modeling Language (ThingML) to Things' Machine Learning
  (ThingML2)","International Conference on Model Driven Engineering Languages and
  Systems (MODELS) 2020 Poster Companion (Extended Abstract)","Proceedings of the 23rd ACM/IEEE International Conference on Model
  Driven Engineering Languages and Systems: Companion Proceedings, 2020",10.1145/3417990.3420057,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we illustrate how to enhance an existing state-of-the-art
modeling language and tool for the Internet of Things (IoT), called ThingML, to
support machine learning on the modeling level. To this aim, we extend the
Domain-Specific Language (DSL) of ThingML, as well as its code generation
framework. Our DSL allows one to define things, which are in charge of carrying
out data analytics. Further, our code generators can automatically produce the
complete implementation in Java and Python. The generated Python code is
responsible for data analytics and employs APIs of machine learning libraries,
such as Keras, Tensorflow and Scikit Learn. Our prototype is available as open
source software on Github.
","[{'version': 'v1', 'created': 'Tue, 22 Sep 2020 15:44:57 GMT'}]",2021-06-29,"[['Moin', 'Armin', ''], ['Rössler', 'Stephan', ''], ['Sayih', 'Marouane', ''], ['Günnemann', 'Stephan', '']]","['domain-specific modeling', 'machine learning', 'internet of things']"
945,1502.01377,Renato J Cintra,"R. J. Cintra, V. S. Dimitrov",The Arithmetic Cosine Transform: Exact and Approximate Algorithms,"17 pages, 3 figures","IEEE Transactions on Signal Processing, vol. 58, no. 6, pp.
  3076-3085, June 2010",10.1109/TSP.2010.2045781,,cs.NA math.NA stat.AP stat.CO stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce a new class of transform method --- the
arithmetic cosine transform (ACT). We provide the central mathematical
properties of the ACT, necessary in designing efficient and accurate
implementations of the new transform method. The key mathematical tools used in
the paper come from analytic number theory, in particular the properties of the
Riemann zeta function. Additionally, we demonstrate that an exact signal
interpolation is achievable for any block-length. Approximate calculations were
also considered. The numerical examples provided show the potential of the ACT
for various digital signal processing applications.
","[{'version': 'v1', 'created': 'Wed, 4 Feb 2015 22:10:21 GMT'}]",2015-02-06,"[['Cintra', 'R. J.', ''], ['Dimitrov', 'V. S.', '']]","['Discrete cosine transform', 'arithmetic transform algorithms', 'nonuniform sampling']"
946,1208.4945,Cm Pintea,"Camelia-M. Pintea, Gloria Cerasela Crisan, Mihai Manea",Parallel ACO with a Ring Neighborhood for Dynamic TSP,"8 pages, 1 figure; accepted J. Information Technology Research",J Information Technology Research 5(4): 1-13 (2012),10.4018/jitr.2012100101,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The current paper introduces a new parallel computing technique based on ant
colony optimization for a dynamic routing problem. In the dynamic traveling
salesman problem the distances between cities as travel times are no longer
fixed. The new technique uses a parallel model for a problem variant that
allows a slight movement of nodes within their Neighborhoods. The algorithm is
tested with success on several large data sets.
","[{'version': 'v1', 'created': 'Fri, 24 Aug 2012 10:38:49 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Oct 2012 13:14:13 GMT'}]",2020-07-28,"[['Pintea', 'Camelia-M.', ''], ['Crisan', 'Gloria Cerasela', ''], ['Manea', 'Mihai', '']]","['Artificial Ants', 'Traveling Salesman Problem', 'Dynamic Problems']"
947,1603.06083,Mohammad Hosseini,"Mohammad Hosseini and Gregorij Kurillo and Seyed Rasoul Etesami and
  Jiang Yu","Towards Coordinated Bandwidth Adaptations for Hundred-Scale 3D
  Tele-Immersive Systems","Springer Multimedia Systems Journal, 14 pages, March 2016",,10.1007/s00530-016-0511-z,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  3D tele-immersion improves the state of collaboration among geographically
distributed participants. Unlike the traditional 2D videos, a 3D tele-immersive
system employs multiple 3D cameras based in each physical site to cover a much
larger field of view, generating a very large amount of stream data. One of the
major challenges is how to efficiently transmit these bulky 3D streaming data
to bandwidth-constrained sites. In this paper, we study an adaptive Human
Visual System (HVS) -compliant bandwidth management framework for efficient
delivery of hundred-scale streams produced from distributed 3D tele-immersive
sites to a receiver site with limited bandwidth budget. Our adaptation
framework exploits the semantics link of HVS with multiple 3D streams in the 3D
tele-immersive environment. We developed TELEVIS, a visual simulation tool to
showcase a HVS-aware tele-immersive system for realistic cases. Our evaluation
results show that the proposed adaptation can improve the total quality per
unit of bandwidth used to deliver streams in 3D tele-immersive systems.
","[{'version': 'v1', 'created': 'Sat, 19 Mar 2016 11:43:01 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Mar 2016 19:30:21 GMT'}]",2016-03-29,"[['Hosseini', 'Mohammad', ''], ['Kurillo', 'Gregorij', ''], ['Etesami', 'Seyed Rasoul', ''], ['Yu', 'Jiang', '']]","['3D Tele-immersion', 'Bandwidth Adaptation', 'Human Visual System', 'TELEVIS']"
948,1106.6223,Melvin Gauci,"Melvin Gauci, Tony J. Dodd and Roderich Gross","Why 'GSA: A Gravitational Search Algorithm' Is Not Genuinely Based on
  the Law of Gravity",,,10.1007/s11047-012-9322-0,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Why 'GSA: A Gravitational Search Algorithm' Is Not Genuinely Based on the Law
of Gravity
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2011 13:38:35 GMT'}]",2016-03-17,"[['Gauci', 'Melvin', ''], ['Dodd', 'Tony J.', ''], ['Gross', 'Roderich', '']]","['optimization', 'heuristic search algorithms', 'gravitational searchalgorithm', 'law of gravity']"
949,1804.08473,Bei Liu,"Bei Liu, Jianlong Fu, Makoto P. Kato, Masatoshi Yoshikawa","Beyond Narrative Description: Generating Poetry from Images by
  Multi-Adversarial Training",,,10.1145/3240508.3240587,,cs.CV cs.AI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic generation of natural language from images has attracted extensive
attention. In this paper, we take one step further to investigate generation of
poetic language (with multiple lines) to an image for automatic poetry
creation. This task involves multiple challenges, including discovering poetic
clues from the image (e.g., hope from green), and generating poems to satisfy
both relevance to the image and poeticness in language level. To solve the
above challenges, we formulate the task of poem generation into two correlated
sub-tasks by multi-adversarial training via policy gradient, through which the
cross-modal relevance and poetic language style can be ensured. To extract
poetic clues from images, we propose to learn a deep coupled visual-poetic
embedding, in which the poetic representation from objects, sentiments and
scenes in an image can be jointly learned. Two discriminative networks are
further introduced to guide the poem generation, including a multi-modal
discriminator and a poem-style discriminator. To facilitate the research, we
have released two poem datasets by human annotators with two distinct
properties: 1) the first human annotated image-to-poem pair dataset (with 8,292
pairs in total), and 2) to-date the largest public English poem corpus dataset
(with 92,265 different poems in total). Extensive experiments are conducted
with 8K images, among which 1.5K image are randomly picked for evaluation. Both
objective and subjective evaluations show the superior performances against the
state-of-the-art methods for poem generation from images. Turing test carried
out with over 500 human subjects, among which 30 evaluators are poetry experts,
demonstrates the effectiveness of our approach.
","[{'version': 'v1', 'created': 'Mon, 23 Apr 2018 14:35:59 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Apr 2018 06:45:53 GMT'}, {'version': 'v3', 'created': 'Fri, 24 Aug 2018 07:35:26 GMT'}, {'version': 'v4', 'created': 'Wed, 10 Oct 2018 03:23:38 GMT'}]",2018-10-11,"[['Liu', 'Bei', ''], ['Fu', 'Jianlong', ''], ['Kato', 'Makoto P.', ''], ['Yoshikawa', 'Masatoshi', '']]","['Image', 'Poetry Generation', 'Adversarial Training']"
950,0906.2228,Hans Tompits,"David Pearce, Hans Tompits, Stefan Woltran","Characterising equilibrium logic and nested logic programs: Reductions
  and complexity",,"Theory and Practice of Logic Programming (2009), 9 : 565-616",10.1017/S147106840999010X,,cs.LO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Equilibrium logic is an approach to nonmonotonic reasoning that extends the
stable-model and answer-set semantics for logic programs. In particular, it
includes the general case of nested logic programs, where arbitrary Boolean
combinations are permitted in heads and bodies of rules, as special kinds of
theories. In this paper, we present polynomial reductions of the main reasoning
tasks associated with equilibrium logic and nested logic programs into
quantified propositional logic, an extension of classical propositional logic
where quantifications over atomic formulas are permitted. We provide reductions
not only for decision problems, but also for the central semantical concepts of
equilibrium logic and nested logic programs. In particular, our encodings map a
given decision problem into some formula such that the latter is valid
precisely in case the former holds. The basic tasks we deal with here are the
consistency problem, brave reasoning, and skeptical reasoning. Additionally, we
also provide encodings for testing equivalence of theories or programs under
different notions of equivalence, viz. ordinary, strong, and uniform
equivalence. For all considered reasoning tasks, we analyse their computational
complexity and give strict complexity bounds.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2009 23:24:43 GMT'}, {'version': 'v2', 'created': 'Sat, 13 Jun 2009 17:47:12 GMT'}]",2009-12-30,"[['Pearce', 'David', ''], ['Tompits', 'Hans', ''], ['Woltran', 'Stefan', '']]","['answer-set programming', 'equilibrium logic', 'reduction techniques', 'quantified Boolean formulas', 'computational complexity', 'equivalence testing']"
951,1703.05647,Blair Archibald,"Blair Archibald, Patrick Maier, Ciaran McCreesh, Rob Stewart, Phil
  Trinder",Replicable Parallel Branch and Bound Search,"36 pages, 12 figures, submitted to the Journal of Parallel and
  Distributed Computing",,10.1016/j.jpdc.2017.10.010,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Combinatorial branch and bound searches are a common technique for solving
global optimisation and decision problems. Their performance often depends on
good search order heuristics, refined over decades of algorithms research.
Parallel search necessarily deviates from the sequential search order,
sometimes dramatically and unpredictably, e.g. by distributing work at random.
This can disrupt effective search order heuristics and lead to unexpected and
highly variable parallel performance. The variability makes it hard to reason
about the parallel performance of combinatorial searches.
  This paper presents a generic parallel branch and bound skeleton, implemented
in Haskell, with replicable parallel performance. The skeleton aims to preserve
the search order heuristic by distributing work in an ordered fashion, closely
following the sequential search order. We demonstrate the generality of the
approach by applying the skeleton to 40 instances of three combinatorial
problems: Maximum Clique, 0/1 Knapsack and Travelling Salesperson. The
overheads of our Haskell skeleton are reasonable: giving slowdown factors of
between 1.9 and 6.2 compared with a class-leading, dedicated, and highly
optimised C++ Maximum Clique solver. We demonstrate scaling up to 200 cores of
a Beowulf cluster, achieving speedups of 100x for several Maximum Clique
instances. We demonstrate low variance of parallel performance across all
instances of the three combinatorial problems and at all scales up to 200
cores, with median Relative Standard Deviation (RSD) below 2%. Parallel solvers
that do not follow the sequential search order exhibit far higher variance,
with median RSD exceeding 85% for Knapsack.
","[{'version': 'v1', 'created': 'Thu, 16 Mar 2017 14:43:09 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Oct 2017 14:13:35 GMT'}]",2017-11-28,"[['Archibald', 'Blair', ''], ['Maier', 'Patrick', ''], ['McCreesh', 'Ciaran', ''], ['Stewart', 'Rob', ''], ['Trinder', 'Phil', '']]","['Algorithmic Skeletons', 'Branch-and-Bound', 'Parallel Algorithms', 'CombinatorialOptimization', 'Distributed Computing', 'Repeatability']"
952,1705.05650,Georg Struth,"Hitoshi Furusawa, Yasuo Kawahara, Georg Struth, Norihiro Tsumagari","Kleisli, Parikh and Peleg Compositions and Liftings for Multirelations",20 pages,,10.1016/j.jlamp.2017.04.002,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multirelations provide a semantic domain for computing systems that involve
two dual kinds of nondeterminism. This paper presents relational formalisations
of Kleisli, Parikh and Peleg compositions and liftings of multirelations. These
liftings are similar to those that arise in the Kleisli category of the
powerset monad. We show that Kleisli composition of multirelations is
associative, but need not have units. Parikh composition may neither be
associative nor have units, but yields a category on the subclass of up-closed
multirelations. Finally, Peleg composition has units, but need not be
associative; a category is obtained when multirelations are union-closed.
","[{'version': 'v1', 'created': 'Tue, 16 May 2017 11:29:33 GMT'}]",2017-05-17,"[['Furusawa', 'Hitoshi', ''], ['Kawahara', 'Yasuo', ''], ['Struth', 'Georg', ''], ['Tsumagari', 'Norihiro', '']]","['algebras of multirelations', 'liftings of multirelations', 'associativity of compositions ofmultirelations', 'relational calculus']"
953,2204.08156,Toshiya Isomoto,"Toshiya Isomoto, Shota Yamanaka, Buntarou Shizuki","Interaction Design of Dwell Selection Toward Gaze-based AR/VR
  Interaction","2 pages, 1 figures","Proceedings of the 2022 ACM Symposium on Eye Tracking Research &
  Applications (ETRA 2022)",10.1145/3517031.3531628,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we first position the current dwell selection among gaze-based
interactions and its advantages against head-gaze selection, which is the
mainstream interface for HMDs. Next, we show how dwell selection and head-gaze
selection are used in an actual interaction situation. By comparing these two
selection methods, we describe the potential of dwell selection as an essential
AR/VR interaction.
","[{'version': 'v1', 'created': 'Mon, 18 Apr 2022 04:04:21 GMT'}]",2022-05-17,"[['Isomoto', 'Toshiya', ''], ['Yamanaka', 'Shota', ''], ['Shizuki', 'Buntarou', '']]","['Gaze-based interface', 'target selection', 'intent prediction', 'Midastouch problem']"
954,1603.05959,Konstantinos Kamnitsas,"Konstantinos Kamnitsas, Christian Ledig, Virginia F.J. Newcombe,
  Joanna P. Simpson, Andrew D. Kane, David K. Menon, Daniel Rueckert, Ben
  Glocker","Efficient Multi-Scale 3D CNN with Fully Connected CRF for Accurate Brain
  Lesion Segmentation","This version was accepted in the journal Medical Image Analysis
  (MedIA)",,10.1016/j.media.2016.10.004,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a dual pathway, 11-layers deep, three-dimensional Convolutional
Neural Network for the challenging task of brain lesion segmentation. The
devised architecture is the result of an in-depth analysis of the limitations
of current networks proposed for similar applications. To overcome the
computational burden of processing 3D medical scans, we have devised an
efficient and effective dense training scheme which joins the processing of
adjacent image patches into one pass through the network while automatically
adapting to the inherent class imbalance present in the data. Further, we
analyze the development of deeper, thus more discriminative 3D CNNs. In order
to incorporate both local and larger contextual information, we employ a dual
pathway architecture that processes the input images at multiple scales
simultaneously. For post-processing of the network's soft segmentation, we use
a 3D fully connected Conditional Random Field which effectively removes false
positives. Our pipeline is extensively evaluated on three challenging tasks of
lesion segmentation in multi-channel MRI patient data with traumatic brain
injuries, brain tumors, and ischemic stroke. We improve on the state-of-the-art
for all three applications, with top ranking performance on the public
benchmarks BRATS 2015 and ISLES 2015. Our method is computationally efficient,
which allows its adoption in a variety of research and clinical settings. The
source code of our implementation is made publicly available.
","[{'version': 'v1', 'created': 'Fri, 18 Mar 2016 19:07:01 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Apr 2016 19:59:22 GMT'}, {'version': 'v3', 'created': 'Sun, 8 Jan 2017 13:55:35 GMT'}]",2017-01-10,"[['Kamnitsas', 'Konstantinos', ''], ['Ledig', 'Christian', ''], ['Newcombe', 'Virginia F. J.', ''], ['Simpson', 'Joanna P.', ''], ['Kane', 'Andrew D.', ''], ['Menon', 'David K.', ''], ['Rueckert', 'Daniel', ''], ['Glocker', 'Ben', '']]","['3D Convolutional Neural Network', 'Fully Connected CRF', 'Segmentation', 'Brain Lesions', 'Deep Learning']"
955,1107.3313,F. Richard Yu,"F. Richard Yu, Peng Zhang, Weidong Xiao, Paul Choudhury",Communication Systems for Grid Integration of Renewable Energy Resources,"to appear in IEEE Network, Sept. 2011",,10.1109/MNET.2011.6033032,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is growing interest in renewable energy around the world. Since most
renewable sources are intermittent in nature, it is a challenging task to
integrate renewable energy resources into the power grid infrastructure. In
this grid integration, communication systems are crucial technologies, which
enable the accommodation of distributed renewable energy generation and play
extremely important role in monitoring, operating, and protecting both
renewable energy generators and power systems. In this paper, we review some
communication technologies available for grid integration of renewable energy
resources. Then, we present the communication systems used in a real renewable
energy project, Bear Mountain Wind Farm (BMW) in British Columbia, Canada. In
addition, we present the communication systems used in Photovoltaic Power
Systems (PPS). Finally, we outline some research challenges and possible
solutions about the communication systems for grid integration of renewable
energy resources.
","[{'version': 'v1', 'created': 'Sun, 17 Jul 2011 16:00:36 GMT'}]",2016-11-18,"[['Yu', 'F. Richard', ''], ['Zhang', 'Peng', ''], ['Xiao', 'Weidong', ''], ['Choudhury', 'Paul', '']]","['Communication Systems', 'Grid', 'Renewable Energy']"
956,1806.04950,Ana Serrano,"Ana Serrano, Diego Gutierrez, Karol Myszkowski, Hans-Peter Seidel,
  Belen Masia",An intuitive control space for material appearance,,"ACM Transactions on Graphics 35, 6, Article 186 (November 2016)",10.1145/2980179.2980242,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many different techniques for measuring material appearance have been
proposed in the last few years. These have produced large public datasets,
which have been used for accurate, data-driven appearance modeling. However,
although these datasets have allowed us to reach an unprecedented level of
realism in visual appearance, editing the captured data remains a challenge. In
this paper, we present an intuitive control space for predictable editing of
captured BRDF data, which allows for artistic creation of plausible novel
material appearances, bypassing the difficulty of acquiring novel samples. We
first synthesize novel materials, extending the existing MERL dataset up to 400
mathematically valid BRDFs. We then design a large-scale experiment, gathering
56,000 subjective ratings on the high-level perceptual attributes that best
describe our extended dataset of materials. Using these ratings, we build and
train networks of radial basis functions to act as functionals mapping the
perceptual attributes to an underlying PCA-based representation of BRDFs. We
show that our functionals are excellent predictors of the perceived attributes
of appearance. Our control space enables many applications, including intuitive
material editing of a wide range of visual properties, guidance for gamut
mapping, analysis of the correlation between perceptual attributes, or novel
appearance similarity metrics. Moreover, our methodology can be used to derive
functionals applicable to classic analytic BRDF representations. We release our
code and dataset publicly, in order to support and encourage further research
in this direction.
","[{'version': 'v1', 'created': 'Wed, 13 Jun 2018 11:19:01 GMT'}]",2018-06-14,"[['Serrano', 'Ana', ''], ['Gutierrez', 'Diego', ''], ['Myszkowski', 'Karol', ''], ['Seidel', 'Hans-Peter', ''], ['Masia', 'Belen', '']]","['BRDF editing', 'appearance editing', 'light reflectionmodels', 'visual perception']"
957,1801.05615,Christos Liaskos K.,"Angeliki Tsioliaridou, Christos Liaskos, Andreas Pitsillides, Sotiris
  Ioannidis",A Novel Protocol for Network-Controlled Metasurfaces,,,10.1145/3109453.3109469,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A recently proposed class of materials, called software-defined
metamaterials, can change their electromagnetic behavior on demand, utilizing a
nanonetwork embedded in their structure. The present work focuses on 2D
metamaterials, known as metasurfaces, and their electromagnetically
programmable counterparts, the HyperSurfaces. The particular focus of the study
is to propose a nanonetworking protocol that can support the intended
macroscopic functionality of a HyperSurface, such as sensing and reacting to
impinging waves in a customizable manner. The novel protocol is derived
analytically, using the Lyapunov drift minimization approach, taking into
account nano-node energy, communication latency and complexity concerns. The
proposed scheme is evaluated via simulations, covering both the macroscopic
HyperSurface functionality and the microscopic, nanonetwork behavior.
","[{'version': 'v1', 'created': 'Wed, 17 Jan 2018 10:27:43 GMT'}]",2018-01-18,"[['Tsioliaridou', 'Angeliki', ''], ['Liaskos', 'Christos', ''], ['Pitsillides', 'Andreas', ''], ['Ioannidis', 'Sotiris', '']]","['Electromagnetic nano-networking', 'metasurfaces', 'protocol']"
958,1807.04020,Nicolas Gillis,"Atif Muhammad Syed, Sameer Qazi, Nicolas Gillis","Improved SVD-based Initialization for Nonnegative Matrix Factorization
  using Low-Rank Correction","12 pages, 1 figure, 5 tables, submitted to pattern recognition
  letters","Pattern Recognition Letters 122, pp. 53-59, 2019",10.1016/j.patrec.2019.02.018,,cs.NA cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the iterative nature of most nonnegative matrix factorization
(\textsc{NMF}) algorithms, initialization is a key aspect as it significantly
influences both the convergence and the final solution obtained. Many
initialization schemes have been proposed for NMF, among which one of the most
popular class of methods are based on the singular value decomposition (SVD).
However, these SVD-based initializations do not satisfy a rather natural
condition, namely that the error should decrease as the rank of factorization
increases. In this paper, we propose a novel SVD-based \textsc{NMF}
initialization to specifically address this shortcoming by taking into account
the SVD factors that were discarded to obtain a nonnegative initialization.
This method, referred to as nonnegative SVD with low-rank correction
(NNSVD-LRC), allows us to significantly reduce the initial error at a
negligible additional computational cost using the low-rank structure of the
discarded SVD factors. NNSVD-LRC has two other advantages compared to previous
SVD-based initializations: (1) it provably generates sparse initial factors,
and (2) it is faster as it only requires to compute a truncated SVD of rank
$\lceil r/2 + 1 \rceil$ where $r$ is the factorization rank of the sought NMF
decomposition (as opposed to a rank-$r$ truncated SVD for other methods). We
show on several standard dense and sparse data sets that our new method
competes favorably with state-of-the-art SVD-based initializations for NMF.
","[{'version': 'v1', 'created': 'Wed, 11 Jul 2018 09:21:31 GMT'}]",2019-02-25,"[['Syed', 'Atif Muhammad', ''], ['Qazi', 'Sameer', ''], ['Gillis', 'Nicolas', '']]","['nonnegative matrix factorization', 'initialization', 'singular value decomposition']"
959,1610.01068,Rafal Scherer,"Marcin Korytkowski, Leszek Rutkowski, Rafa{\l} Scherer",Fast Image Classification by Boosting Fuzzy Classifiers,1 figure,Inf. Sci. (327) 2016 175-182,10.1016/j.ins.2015.08.030,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel approach to visual objects classification based
on generating simple fuzzy classifiers using local image features to
distinguish between one known class and other classes. Boosting meta learning
is used to find the most representative local features. The proposed approach
is tested on a state-of-the-art image dataset and compared with the
bag-of-features image representation model combined with the Support Vector
Machine classification. The novel method gives better classification accuracy
and the time of learning and testing process is more than 30% shorter.
","[{'version': 'v1', 'created': 'Tue, 4 Oct 2016 16:18:57 GMT'}]",2016-10-05,"[['Korytkowski', 'Marcin', ''], ['Rutkowski', 'Leszek', ''], ['Scherer', 'Rafał', '']]","['visual object categorization', 'fuzzy classification', 'boostingmeta-learning']"
960,2102.10939,Liang Chen,Liang Chen,A High-dimensional Sparse Fourier Transform in the Continuous Setting,,"There are some minor errors in the previous version, please refer
  to <Inverse problems, 2022 (38)>for the correct version",10.1088/1361-6420/ac3c16,,cs.DS cs.IT cs.NA math.IT math.NA,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we theoretically propose a new hashing scheme to establish the
sparse Fourier transform in high-dimensional space. The estimation of the
algorithm complexity shows that this sparse Fourier transform can overcome the
curse of dimensionality. To the best of our knowledge, this is the first
polynomial-time algorithm to recover the high-dimensional continuous
frequencies.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2021 12:14:26 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Feb 2021 10:23:00 GMT'}, {'version': 'v3', 'created': 'Wed, 24 Feb 2021 03:09:41 GMT'}, {'version': 'v4', 'created': 'Sun, 28 Feb 2021 12:30:00 GMT'}, {'version': 'v5', 'created': 'Sun, 7 Mar 2021 11:56:42 GMT'}, {'version': 'v6', 'created': 'Wed, 9 Jun 2021 07:25:44 GMT'}]",2022-05-03,"[['Chen', 'Liang', '']]","['Curse of dimensionality', 'Frequency estimation', 'Runtime complexity', 'Sparse Fouriertransform']"
961,1502.01880,Helio M. de Oliveira,E.F. Melo and H.M. de Oliveira,"A Fingerprint-based Access Control using Principal Component Analysis
  and Edge Detection","5 pages, 9 figures. SBrT/IEEE International Telecommunication
  Symposium, ITS 2010, Manaus, AM, Brazil",,10.14209/SBRT.2010.63,,cs.CV cs.CR stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel approach for deciding on the appropriateness or
not of an acquired fingerprint image into a given database. The process begins
with the assembly of a training base in an image space constructed by combining
Principal Component Analysis (PCA) and edge detection. Then, the parameter H, a
new feature that helps in the decision making about the relevance of a
fingerprint image in databases, is derived from a relationship between
Euclidean and Mahalanobian distances. This procedure ends with the lifting of
the curve of the Receiver Operating Characteristic (ROC), where the thresholds
defined on the parameter H are chosen according to the acceptable rates of
false positives and false negatives.
","[{'version': 'v1', 'created': 'Fri, 6 Feb 2015 13:31:54 GMT'}]",2019-09-27,"[['Melo', 'E. F.', ''], ['de Oliveira', 'H. M.', '']]","['Fingerprints', 'PCA', 'Edge Detection', 'Euclidean and Mahalanobian distances', 'ROC']"
962,1407.0623,Lamberto Ballan,"Lamberto Ballan, Marco Bertini, Giuseppe Serra, Alberto Del Bimbo",A Data-Driven Approach for Tag Refinement and Localization in Web Videos,Preprint submitted to Computer Vision and Image Understanding (CVIU),,10.1016/j.cviu.2015.05.009,,cs.CV cs.IR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tagging of visual content is becoming more and more widespread as web-based
services and social networks have popularized tagging functionalities among
their users. These user-generated tags are used to ease browsing and
exploration of media collections, e.g. using tag clouds, or to retrieve
multimedia content. However, not all media are equally tagged by users. Using
the current systems is easy to tag a single photo, and even tagging a part of a
photo, like a face, has become common in sites like Flickr and Facebook. On the
other hand, tagging a video sequence is more complicated and time consuming, so
that users just tag the overall content of a video. In this paper we present a
method for automatic video annotation that increases the number of tags
originally provided by users, and localizes them temporally, associating tags
to keyframes. Our approach exploits collective knowledge embedded in
user-generated tags and web sources, and visual similarity of keyframes and
images uploaded to social sites like YouTube and Flickr, as well as web sources
like Google and Bing. Given a keyframe, our method is able to select on the fly
from these visual sources the training exemplars that should be the most
relevant for this test sample, and proceeds to transfer labels across similar
images. Compared to existing video tagging approaches that require training
classifiers for each tag, our system has few parameters, is easy to implement
and can deal with an open vocabulary scenario. We demonstrate the approach on
tag refinement and localization on DUT-WEBV, a large dataset of web videos, and
show state-of-the-art results.
","[{'version': 'v1', 'created': 'Wed, 2 Jul 2014 15:48:37 GMT'}, {'version': 'v2', 'created': 'Sat, 11 Apr 2015 18:12:36 GMT'}, {'version': 'v3', 'created': 'Thu, 28 May 2015 17:12:54 GMT'}]",2015-09-09,"[['Ballan', 'Lamberto', ''], ['Bertini', 'Marco', ''], ['Serra', 'Giuseppe', ''], ['Del Bimbo', 'Alberto', '']]","['Video tagging', 'Web video', 'Tag refinement', 'Tag localization', 'Social media', 'Data-driven', 'Lazy learning']"
963,1904.05456,Mohammad Hosseini,"Boyang Peng, Mohammad Hosseini, Zhihao Hong, Reza Farivar, Roy
  Campbell",R-Storm: Resource-Aware Scheduling in Storm,"Proceedings of the 16th Annual ACM Middleware Conference, Pages
  149-161, Vancouver, BC, Canada, December 07 - 11, 2015","In Proceedings of the 16th Annual Middleware Conference
  (Middleware 2015). ACM, New York, NY, USA, 149-161",10.1145/2814576.2814808,,cs.DC cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The era of big data has led to the emergence of new systems for real-time
distributed stream processing, e.g., Apache Storm is one of the most popular
stream processing systems in industry today. However, Storm, like many other
stream processing systems lacks an intelligent scheduling mechanism. The
default round-robin scheduling currently deployed in Storm disregards resource
demands and availability, and can therefore be inefficient at times. We present
R-Storm (Resource-Aware Storm), a system that implements resource-aware
scheduling within Storm. R-Storm is designed to increase overall throughput by
maximizing resource utilization while minimizing network latency. When
scheduling tasks, R-Storm can satisfy both soft and hard resource constraints
as well as minimizing network distance between components that communicate with
each other. We evaluate R-Storm on set of micro-benchmark Storm applications as
well as Storm applications used in production at Yahoo! Inc. From our
experimental results we conclude that R-Storm achieves 30-47% higher throughput
and 69-350% better CPU utilization than default Storm for the micro-benchmarks.
For the Yahoo! Storm applications, R-Storm outperforms default Storm by around
50% based on overall throughput. We also demonstrate that R-Storm performs much
better when scheduling multiple Storm applications than default Storm.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2019 21:45:39 GMT'}]",2019-04-12,"[['Peng', 'Boyang', ''], ['Hosseini', 'Mohammad', ''], ['Hong', 'Zhihao', ''], ['Farivar', 'Reza', ''], ['Campbell', 'Roy', '']]","['Storm', 'Resource-Aware Scheduling', 'Stream Processing']"
964,1706.00069,Qiyu Zhi,"Qiyu Zhi, Ronald Metoyer",Recognizing Handwritten Source Code,"7 pages, 6 figures, Proceedings of the 2017 Graphics Interface
  conference",,10.20380/GI2017.21,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Supporting programming on touchscreen devices requires effective text input
and editing methods. Unfortunately, the virtual keyboard can be inefficient and
uses valuable screen space on already small devices. Recent advances in stylus
input make handwriting a potentially viable text input solution for programming
on touchscreen devices. The primary barrier, however, is that handwriting
recognition systems are built to take advantage of the rules of natural
language, not those of a programming language. In this paper, we explore this
particular problem of handwriting recognition for source code. We collect and
make publicly available a dataset of handwritten Python code samples from 15
participants and we characterize the typical recognition errors for this
handwritten Python source code when using a state-of-the-art handwriting
recognition tool. We present an approach to improve the recognition accuracy by
augmenting a handwriting recognizer with the programming language grammar
rules. Our experiment on the collected dataset shows an 8.6% word error rate
and a 3.6% character error rate which outperforms standard handwriting
recognition systems and compares favorably to typing source code on virtual
keyboards.
","[{'version': 'v1', 'created': 'Wed, 31 May 2017 20:07:12 GMT'}]",2017-12-07,"[['Zhi', 'Qiyu', ''], ['Metoyer', 'Ronald', '']]","['programming', 'handwriting recognition', 'touch screen', 'source code', 'python']"
965,1512.04097,Cristian Molinaro,"Marco Calautti, Sergio Greco, Cristian Molinaro, Irina Trubitsyna",Using Linear Constraints for Logic Program Termination Analysis,"Under consideration in Theory and Practice of Logic Programming
  (TPLP)",Theory and Practice of Logic Programming 16 (2016) 353-377,10.1017/S1471068416000077,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is widely acknowledged that function symbols are an important feature in
answer set programming, as they make modeling easier, increase the expressive
power, and allow us to deal with infinite domains. The main issue with their
introduction is that the evaluation of a program might not terminate and
checking whether it terminates or not is undecidable. To cope with this
problem, several classes of logic programs have been proposed where the use of
function symbols is restricted but the program evaluation termination is
guaranteed. Despite the significant body of work in this area, current
approaches do not include many simple practical programs whose evaluation
terminates. In this paper, we present the novel classes of rule-bounded and
cycle-bounded programs, which overcome different limitations of current
approaches by performing a more global analysis of how terms are propagated
from the body to the head of rules. Results on the correctness, the complexity,
and the expressivity of the proposed approach are provided.
","[{'version': 'v1', 'created': 'Sun, 13 Dec 2015 18:36:54 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Dec 2015 13:15:04 GMT'}]",2020-02-19,"[['Calautti', 'Marco', ''], ['Greco', 'Sergio', ''], ['Molinaro', 'Cristian', ''], ['Trubitsyna', 'Irina', '']]","['Answer set programming', 'function symbols', 'bottom-up evaluation', 'program evaluation termination', 'stable models']"
966,1902.09597,Pavel Semukhin,"Thomas Colcombet, Jo\""el Ouaknine, Pavel Semukhin and James Worrell",On Reachability Problems for Low-Dimensional Matrix Semigroups,Full version of the paper submitted to ICALP 2019,,10.4230/LIPIcs.ICALP.2019.39,,cs.CC cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the Membership and the Half-Space Reachability problems for
matrices in dimensions two and three. Our first main result is that the
Membership Problem is decidable for finitely generated sub-semigroups of the
Heisenberg group over rational numbers. Furthermore, we prove two decidability
results for the Half-Space Reachability Problem. Namely, we show that this
problem is decidable for sub-semigroups of $\mathrm{GL}(2,\mathbb{Z})$ and of
the Heisenberg group over rational numbers.
","[{'version': 'v1', 'created': 'Mon, 25 Feb 2019 20:18:13 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Apr 2019 15:14:01 GMT'}, {'version': 'v3', 'created': 'Mon, 29 Apr 2019 14:31:43 GMT'}]",2019-04-30,"[['Colcombet', 'Thomas', ''], ['Ouaknine', 'Joël', ''], ['Semukhin', 'Pavel', ''], ['Worrell', 'James', '']]","['Membership Problem', 'Half-Space Reachability Problem', 'matrix semigroups', 'Heisenberg group', 'general linear group']"
967,2212.00459,Yongqi Zhai,"Yongqi Zhai, Luyang Tang, Yi Ma, Rui Peng, Ronggang Wang",Disparity-based Stereo Image Compression with Aligned Cross-View Priors,"10 pages, 8 figures, published to ACM Multimedia 2022","Proceedings of the 30th ACM International Conference on Multimedia
  (MM '22), October 10--14, 2022, Lisboa, Portugal",10.1145/3503161.3548136,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the wide application of stereo images in various fields, the research on
stereo image compression (SIC) attracts extensive attention from academia and
industry. The core of SIC is to fully explore the mutual information between
the left and right images and reduce redundancy between views as much as
possible. In this paper, we propose DispSIC, an end-to-end trainable deep
neural network, in which we jointly train a stereo matching model to assist in
the image compression task. Based on the stereo matching results (i.e.
disparity), the right image can be easily warped to the left view, and only the
residuals between the left and right views are encoded for the left image. A
three-branch auto-encoder architecture is adopted in DispSIC, which encodes the
right image, the disparity map and the residuals respectively. During training,
the whole network can learn how to adaptively allocate bitrates to these three
parts, achieving better rate-distortion performance at the cost of a lower
disparity map bitrates. Moreover, we propose a conditional entropy model with
aligned cross-view priors for SIC, which takes the warped latents of the right
image as priors to improve the accuracy of the probability estimation for the
left image. Experimental results demonstrate that our proposed method achieves
superior performance compared to other existing SIC methods on the KITTI and
InStereo2K datasets both quantitatively and qualitatively.
","[{'version': 'v1', 'created': 'Thu, 1 Dec 2022 12:23:44 GMT'}]",2022-12-02,"[['Zhai', 'Yongqi', ''], ['Tang', 'Luyang', ''], ['Ma', 'Yi', ''], ['Peng', 'Rui', ''], ['Wang', 'Ronggang', '']]","['stereo image compression', 'stereo matching', 'deep learning']"
968,1312.3990,Nima Hatami,"Nima Hatami, Reza Ebrahimpour, Reza Ghaderi",ECOC-Based Training of Neural Networks for Face Recognition,,"Cybernetics and Intelligent Systems, IEEE Conference on, 450-454,
  2008",10.1109/ICCIS.2008.4670763,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Error Correcting Output Codes, ECOC, is an output representation method
capable of discovering some of the errors produced in classification tasks.
This paper describes the application of ECOC to the training of feed forward
neural networks, FFNN, for improving the overall accuracy of classification
systems. Indeed, to improve the generalization of FFNN classifiers, this paper
proposes an ECOC-Based training method for Neural Networks that use ECOC as the
output representation, and adopts the traditional Back-Propagation algorithm,
BP, to adjust weights of the network. Experimental results for face recognition
problem on Yale database demonstrate the effectiveness of our method. With a
rejection scheme defined by a simple robustness rate, high reliability is
achieved in this application.
","[{'version': 'v1', 'created': 'Sat, 14 Dec 2013 00:29:36 GMT'}]",2016-11-18,"[['Hatami', 'Nima', ''], ['Ebrahimpour', 'Reza', ''], ['Ghaderi', 'Reza', '']]","['Error correcting output coding', 'Error BackPropagation algorithm', 'Face Recognition', 'Multi-layer Perceptron']"
969,1608.07730,Samad Khabbazi Oskouei,"Samad Khabbazi Oskouei, Stefano Mancini",Algorithmic complexity of quantum capacity,,"Quantum Inf Process (2018) 17, 94 (2018)",10.1007/s11128-018-1859-0,,cs.IT math.IT quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently the theory of communication developed by Shannon has been extended
to the quantum realm by exploiting the rules of quantum theory. This latter
stems on complex vector spaces. However complex (as well as real) numbers are
just idealizations and they are not available in practice where we can only
deal with rational numbers. This fact naturally leads to the question of
whether the developed notions of capacities for quantum channels truly catch
their ability to transmit information. Here we answer this question for the
quantum capacity. To this end we resort to the notion of semi-computability in
order to approximately (by rational numbers) describe quantum states and
quantum channel maps. Then we introduce algorithmic entropies (like algorithmic
quantum coherent information) and derive relevant properties for them. Finally
we define algorithmic quantum capacity and prove that it equals the standard
one.
","[{'version': 'v1', 'created': 'Sat, 27 Aug 2016 18:02:24 GMT'}, {'version': 'v2', 'created': 'Sun, 18 Sep 2016 15:38:53 GMT'}, {'version': 'v3', 'created': 'Mon, 17 Apr 2017 08:01:08 GMT'}]",2018-04-23,"[['Oskouei', 'Samad Khabbazi', ''], ['Mancini', 'Stefano', '']]","['Algorithmic complexity', 'quantum entropies', 'quantum channels', 'quantum capacity']"
970,1201.3076,Jerome Vanclay,Jerome K. Vanclay,"Impact Factor: outdated artefact or stepping-stone to journal
  certification?","25 pages, 12 figures, 6 tables",Scientometrics 92(2):211-238 (2012),10.1007/s11192-011-0561-0,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A review of Garfield's journal impact factor and its specific implementation
as the Thomson Reuters Impact Factor reveals several weaknesses in this
commonly-used indicator of journal standing. Key limitations include the
mismatch between citing and cited documents, the deceptive display of three
decimals that belies the real precision, and the absence of confidence
intervals. These are minor issues that are easily amended and should be
corrected, but more substantive improvements are needed. There are indications
that the scientific community seeks and needs better certification of journal
procedures to improve the quality of published science. Comprehensive
certification of editorial and review procedures could help ensure adequate
procedures to detect duplicate and fraudulent submissions.
","[{'version': 'v1', 'created': 'Sun, 15 Jan 2012 10:15:27 GMT'}]",2012-08-23,"[['Vanclay', 'Jerome K.', '']]","['Thomson Reuters', 'ISI', 'JCR', 'journal impact factor', 'certification', 'quality control']"
971,1810.11546,Mohammad Malekzadeh,"Mohammad Malekzadeh, Richard G. Clegg, Andrea Cavallaro, Hamed Haddadi",Mobile Sensor Data Anonymization,10 pages,,10.1145/3302505.3310068,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motion sensors such as accelerometers and gyroscopes measure the instant
acceleration and rotation of a device, in three dimensions. Raw data streams
from motion sensors embedded in portable and wearable devices may reveal
private information about users without their awareness. For example, motion
data might disclose the weight or gender of a user, or enable their
re-identification. To address this problem, we propose an on-device
transformation of sensor data to be shared for specific applications, such as
monitoring selected daily activities, without revealing information that
enables user identification. We formulate the anonymization problem using an
information-theoretic approach and propose a new multi-objective loss function
for training deep autoencoders. This loss function helps minimizing
user-identity information as well as data distortion to preserve the
application-specific utility. The training process regulates the encoder to
disregard user-identifiable patterns and tunes the decoder to shape the output
independently of users in the training set. The trained autoencoder can be
deployed on a mobile or wearable device to anonymize sensor data even for users
who are not included in the training dataset. Data from 24 users transformed by
the proposed anonymizing autoencoder lead to a promising trade-off between
utility and privacy, with an accuracy for activity recognition above 92% and an
accuracy for user identification below 7%.
","[{'version': 'v1', 'created': 'Fri, 26 Oct 2018 22:26:31 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Nov 2018 16:08:44 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Feb 2019 23:58:38 GMT'}]",2019-02-20,"[['Malekzadeh', 'Mohammad', ''], ['Clegg', 'Richard G.', ''], ['Cavallaro', 'Andrea', ''], ['Haddadi', 'Hamed', '']]","['Sensor Data Privacy', 'Adversarial Training', 'Deep Learning', 'EdgeComputing', 'Time Series Analysis']"
972,2007.00300,Arthur Drichel,"Arthur Drichel, Ulrike Meyer, Samuel Sch\""uppen, Dominik Teubert","Making Use of NXt to Nothing: The Effect of Class Imbalances on DGA
  Detection Classifiers","Accepted at The 15th International Conference on Availability,
  Reliability and Security (ARES 2020)","In The 15th International Conference on Availability, Reliability
  and Security (ARES 2020), ACM, 9 pages",10.1145/3407023.3409190,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Numerous machine learning classifiers have been proposed for binary
classification of domain names as either benign or malicious, and even for
multiclass classification to identify the domain generation algorithm (DGA)
that generated a specific domain name. Both classification tasks have to deal
with the class imbalance problem of strongly varying amounts of training
samples per DGA. Currently, it is unclear whether the inclusion of DGAs for
which only a few samples are known to the training sets is beneficial or
harmful to the overall performance of the classifiers. In this paper, we
perform a comprehensive analysis of various contextless DGA classifiers, which
reveals the high value of a few training samples per class for both
classification tasks. We demonstrate that the classifiers are able to detect
various DGAs with high probability by including the underrepresented classes
which were previously hardly recognizable. Simultaneously, we show that the
classifiers' detection capabilities of well represented classes do not
decrease.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2020 07:51:12 GMT'}]",2020-07-02,"[['Drichel', 'Arthur', ''], ['Meyer', 'Ulrike', ''], ['Schüppen', 'Samuel', ''], ['Teubert', 'Dominik', '']]","['DGA detection', 'class imbalance problem', 'machine learning']"
973,1802.09669,George Leu,George Leu and Hussein Abbass,"A Multi-Disciplinary Review of Knowledge Acquisition Methods: From Human
  to Autonomous Eliciting Agents",,"Knowledge-Based Systems, Volume 105, Elsevier, 2016",10.1016/j.knosys.2016.02.012,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper offers a multi-disciplinary review of knowledge acquisition
methods in human activity systems. The review captures the degree of
involvement of various types of agencies in the knowledge acquisition process,
and proposes a classification with three categories of methods: the human
agent, the human-inspired agent, and the autonomous machine agent methods. In
the first two categories, the acquisition of knowledge is seen as a cognitive
task analysis exercise, while in the third category knowledge acquisition is
treated as an autonomous knowledge-discovery endeavour. The motivation for this
classification stems from the continuous change over time of the structure,
meaning and purpose of human activity systems, which are seen as the factor
that fuelled researchers' and practitioners' efforts in knowledge acquisition
for more than a century.
  We show through this review that the KA field is increasingly active due to
the higher and higher pace of change in human activity, and conclude by
discussing the emergence of a fourth category of knowledge acquisition methods,
which are based on red-teaming and co-evolution.
","[{'version': 'v1', 'created': 'Tue, 27 Feb 2018 01:21:46 GMT'}]",2018-02-28,"[['Leu', 'George', ''], ['Abbass', 'Hussein', '']]","['knowledge acquisition', 'human agency', 'machine agency', 'cognitive task analysis', 'autonomous knowledge-discovery']"
974,1907.11007,Efthimis Tsilionis,"Efthimis Tsilionis, Nikolaos Koutroumanis, Panagiotis Nikitopoulos,
  Christos Doulkeridis and Alexander Artikis",Online Event Recognition from Moving Vehicles: Application Paper,"Paper presented at the 35th International Conference on Logic
  Programming (ICLP 2019), Las Cruces, New Mexico, USA, 20-25 September 2019,
  16 pages",Theory and Practice of Logic Programming 19 (2019) 841-856,10.1017/S147106841900022X,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a system for online composite event recognition over streaming
positions of commercial vehicles. Our system employs a data enrichment module,
augmenting the mobility data with external information, such as weather data
and proximity to points of interest. In addition, the composite event
recognition module, based on a highly optimised logic programming
implementation of the Event Calculus, consumes the enriched data and identifies
activities that are beneficial in fleet management applications. We evaluate
our system on large, real-world data from commercial vehicles, and illustrate
its efficiency. Under consideration for acceptance in TPLP.
","[{'version': 'v1', 'created': 'Thu, 25 Jul 2019 12:30:08 GMT'}]",2020-02-19,"[['Tsilionis', 'Efthimis', ''], ['Koutroumanis', 'Nikolaos', ''], ['Nikitopoulos', 'Panagiotis', ''], ['Doulkeridis', 'Christos', ''], ['Artikis', 'Alexander', '']]","['Event Pattern Matching', 'Event Calculus', 'Data Enrichment']"
975,1804.03294,Tianyun Zhang,"Tianyun Zhang, Shaokai Ye, Kaiqi Zhang, Jian Tang, Wujie Wen, Makan
  Fardad, Yanzhi Wang","A Systematic DNN Weight Pruning Framework using Alternating Direction
  Method of Multipliers",,"ECCV 2018, pp 191-207",10.1007/978-3-030-01237-3_12,,cs.NE cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Weight pruning methods for deep neural networks (DNNs) have been investigated
recently, but prior work in this area is mainly heuristic, iterative pruning,
thereby lacking guarantees on the weight reduction ratio and convergence time.
To mitigate these limitations, we present a systematic weight pruning framework
of DNNs using the alternating direction method of multipliers (ADMM). We first
formulate the weight pruning problem of DNNs as a nonconvex optimization
problem with combinatorial constraints specifying the sparsity requirements,
and then adopt the ADMM framework for systematic weight pruning. By using ADMM,
the original nonconvex optimization problem is decomposed into two subproblems
that are solved iteratively. One of these subproblems can be solved using
stochastic gradient descent, the other can be solved analytically. Besides, our
method achieves a fast convergence rate.
  The weight pruning results are very promising and consistently outperform the
prior work. On the LeNet-5 model for the MNIST data set, we achieve 71.2 times
weight reduction without accuracy loss. On the AlexNet model for the ImageNet
data set, we achieve 21 times weight reduction without accuracy loss. When we
focus on the convolutional layer pruning for computation reductions, we can
reduce the total computation by five times compared with the prior work
(achieving a total of 13.4 times weight reduction in convolutional layers). Our
models and codes are released at https://github.com/KaiqiZhang/admm-pruning
","[{'version': 'v1', 'created': 'Tue, 10 Apr 2018 01:14:51 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Apr 2018 02:19:16 GMT'}, {'version': 'v3', 'created': 'Wed, 25 Jul 2018 16:52:02 GMT'}]",2018-10-23,"[['Zhang', 'Tianyun', ''], ['Ye', 'Shaokai', ''], ['Zhang', 'Kaiqi', ''], ['Tang', 'Jian', ''], ['Wen', 'Wujie', ''], ['Fardad', 'Makan', ''], ['Wang', 'Yanzhi', '']]","['systematic weight pruning', 'deep neural networks (DNNs)', 'alternating direction method of multipliers (ADMM)']"
976,1007.4971,Johannes Oetsch,"Johannes Oetsch, J\""org P\""uhrer, Martin Schwengerer, and Hans Tompits",The System Kato: Detecting Cases of Plagiarism for Answer-Set Programs,,"Theory and Practice of Logic Programming, Volume 10, Special Issue
  4-6, July 2010, pp 759-775",10.1017/S1471068410000402,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Plagiarism detection is a growing need among educational institutions and
solutions for different purposes exist. An important field in this direction is
detecting cases of source-code plagiarism. In this paper, we present the tool
Kato for supporting the detection of this kind of plagiarism in the area of
answer-set programming (ASP). Currently, the tool is implemented for DLV
programs but it is designed to handle other logic-programming dialects as well.
We review the basic features of Kato, introduce its theoretical underpinnings,
and discuss an application of Kato for plagiarism detection in the context of
courses on logic programming at the Vienna University of Technology.
","[{'version': 'v1', 'created': 'Wed, 28 Jul 2010 13:43:10 GMT'}]",2010-07-29,"[['Oetsch', 'Johannes', ''], ['Pührer', 'Jörg', ''], ['Schwengerer', 'Martin', ''], ['Tompits', 'Hans', '']]","['answer-set programming', 'program analysis', 'plagiarism detection']"
977,1306.1676,Eckhard Hitzer,Eckhard Hitzer,Algebraic foundations of split hypercomplex nonlinear adaptive filtering,"14 pages, 1 figure","Mathematical Methods in the Applied Sciences, Volume 36, Issue 9,
  pages 1042-1055, June 2013",10.1002/mma.2660,,cs.CV math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A split hypercomplex learning algorithm for the training of nonlinear finite
impulse response adaptive filters for the processing of hypercomplex signals of
any dimension is proposed. The derivation strictly takes into account the laws
of hypercomplex algebra and hypercomplex calculus, some of which have been
neglected in existing learning approaches (e.g. for quaternions). Already in
the case of quaternions we can predict improvements in performance of
hypercomplex processes. The convergence of the proposed algorithms is
rigorously analyzed.
  Keywords: Quaternionic adaptive filtering, Hypercomplex adaptive filtering,
Nonlinear adaptive filtering, Hypercomplex Multilayer Perceptron, Clifford
geometric algebra
","[{'version': 'v1', 'created': 'Fri, 7 Jun 2013 09:55:29 GMT'}]",2013-06-10,"[['Hitzer', 'Eckhard', '']]","['Quaternionic adaptive filtering', 'Hypercomplex adaptive filtering', 'Nonlinear adaptive filtering', 'Hypercomplex Multilayer Perceptron', 'Clifford geometric algebra']"
978,2102.13503,Baptiste Barreau,"Baptiste Barreau, Laurent Carlier",History-Augmented Collaborative Filtering for Financial Recommendations,,"RecSys '20: Fourteenth ACM Conference on Recommender Systems, Sep
  2020, Virtual Event, Brazil. pp.492-497",10.1145/3383313.3412206,,cs.LG q-fin.CP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many businesses, and particularly in finance, the behavior of a client
might drastically change over time. It is consequently crucial for recommender
systems used in such environments to be able to adapt to these changes. In this
study, we propose a novel collaborative filtering algorithm that captures the
temporal context of a user-item interaction through the users' and items'
recent interaction histories to provide dynamic recommendations. The algorithm,
designed with issues specific to the financial world in mind, uses a custom
neural network architecture that tackles the non-stationarity of users' and
items' behaviors. The performance and properties of the algorithm are monitored
in a series of experiments on a G10 bond request for quotation proprietary
database from BNP Paribas Corporate and Institutional Banking.
","[{'version': 'v1', 'created': 'Fri, 26 Feb 2021 14:24:04 GMT'}]",2021-03-01,"[['Barreau', 'Baptiste', ''], ['Carlier', 'Laurent', '']]","['matrix factorization', 'collaborative filtering', 'context-aware', 'time', 'neural networks']"
979,1706.06620,Seyoung Kim,"Seyoung Kim, Tayfun Gokmen, Hyung-Min Lee and Wilfried E. Haensch","Analog CMOS-based Resistive Processing Unit for Deep Neural Network
  Training",,,10.1109/MWSCAS.2017.8052950,,cs.ET cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently we have shown that an architecture based on resistive processing
unit (RPU) devices has potential to achieve significant acceleration in deep
neural network (DNN) training compared to today's software-based DNN
implementations running on CPU/GPU. However, currently available device
candidates based on non-volatile memory technologies do not satisfy all the
requirements to realize the RPU concept. Here, we propose an analog CMOS-based
RPU design (CMOS RPU) which can store and process data locally and can be
operated in a massively parallel manner. We analyze various properties of the
CMOS RPU to evaluate the functionality and feasibility for acceleration of DNN
training.
","[{'version': 'v1', 'created': 'Tue, 20 Jun 2017 18:53:29 GMT'}]",2017-10-27,"[['Kim', 'Seyoung', ''], ['Gokmen', 'Tayfun', ''], ['Lee', 'Hyung-Min', ''], ['Haensch', 'Wilfried E.', '']]","['resistive processing unit', 'RPU', 'deep neural network', 'machine learning accelerator', 'resistive memory']"
980,1911.05181,Jonathan Baxter,"Douglas Aberdeen, Jonathan Baxter and Robert Edwards","92c/MFlops/s, Ultra-Large-Scale Neural-Network Training on a PIII
  Cluster",SC '00: Proceedings of the 2000 ACM/IEEE Conference on Supercomputing,ACM/IEEE SC 2000 Conference (SC00),10.1109/SC.2000.10031,,cs.LG cs.DC cs.PF stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Artificial neural networks with millions of adjustable parameters and a
similar number of training examples are a potential solution for difficult,
large-scale pattern recognition problems in areas such as speech and face
recognition, classification of large volumes of web data, and finance. The
bottleneck is that neural network training involves iterative gradient descent
and is extremely computationally intensive. In this paper we present a
technique for distributed training of Ultra Large Scale Neural Networks (ULSNN)
on Bunyip, a Linux-based cluster of 196 Pentium III processors. To illustrate
ULSNN training we describe an experiment in which a neural network with 1.73
million adjustable parameters was trained to recognize machine-printed Japanese
characters from a database containing 9 million training patterns. The training
runs with a average performance of 163.3 GFlops/s (single precision). With a
machine cost of \$150,913, this yields a price/performance ratio of
92.4c/MFlops/s (single precision). For comparison purposes, training using
double precision and the ATLAS DGEMM produces a sustained performance of 70
MFlops/s or \$2.16 / MFlop/s (double precision).
","[{'version': 'v1', 'created': 'Tue, 12 Nov 2019 22:57:09 GMT'}]",2019-11-14,"[['Aberdeen', 'Douglas', ''], ['Baxter', 'Jonathan', ''], ['Edwards', 'Robert', '']]","['neural-network', 'Linux cluster', 'matrix-multiply']"
981,1804.10060,Garth Wells,"Chris N. Richardson, Nathan Sime, Garth N. Wells",Scalable computation of thermomechanical turbomachinery problems,,,10.1016/j.finel.2018.11.002,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A commonly held view in the turbomachinery community is that finite element
methods are not well-suited for very large-scale thermomechanical simulations.
We seek to dispel this notion by presenting performance data for a collection
of realistic, large-scale thermomechanical simulations. We describe the
necessary technology to compute problems with $O(10^7)$ to $O(10^9)$
degrees-of-freedom, and emphasise what is required to achieve near linear
computational complexity with good parallel scaling. Performance data is
presented for turbomachinery components with up to 3.3 billion
degrees-of-freedom. The software libraries used to perform the simulations are
freely available under open source licenses. The performance demonstrated in
this work opens up the possibility of system-level thermomechanical modelling,
and lays the foundation for further research into high-performance formulations
for even larger problems and for other physical processes, such as contact,
that are important in turbomachinery analysis.
","[{'version': 'v1', 'created': 'Thu, 26 Apr 2018 13:49:43 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Nov 2018 14:44:04 GMT'}]",2018-12-03,"[['Richardson', 'Chris N.', ''], ['Sime', 'Nathan', ''], ['Wells', 'Garth N.', '']]","['finite element analysis', 'multigrid', 'parallel computing', 'thermomechanicalmodelling', 'turbomachinery']"
982,1807.01395,Madhumita Sushil,"Madhumita Sushil and Simon \v{S}uster and Kim Luyckx and Walter
  Daelemans","Patient representation learning and interpretable evaluation using
  clinical notes",Accepted manuscript at Journal of Biomedical Informatics,Journal of Biomedical Informatics Volume 84C (2018) pp. 103-113,10.1016/j.jbi.2018.06.016,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We have three contributions in this work: 1. We explore the utility of a
stacked denoising autoencoder and a paragraph vector model to learn
task-independent dense patient representations directly from clinical notes. To
analyze if these representations are transferable across tasks, we evaluate
them in multiple supervised setups to predict patient mortality, primary
diagnostic and procedural category, and gender. We compare their performance
with sparse representations obtained from a bag-of-words model. We observe that
the learned generalized representations significantly outperform the sparse
representations when we have few positive instances to learn from, and there is
an absence of strong lexical features. 2. We compare the model performance of
the feature set constructed from a bag of words to that obtained from medical
concepts. In the latter case, concepts represent problems, treatments, and
tests. We find that concept identification does not improve the classification
performance. 3. We propose novel techniques to facilitate model
interpretability. To understand and interpret the representations, we explore
the best encoded features within the patient representations obtained from the
autoencoder model. Further, we calculate feature sensitivity across two
networks to identify the most significant input features for different
classification tasks when we use these pretrained representations as the
supervised input. We successfully extract the most influential features for the
pipeline using this technique.
","[{'version': 'v1', 'created': 'Tue, 3 Jul 2018 23:20:49 GMT'}]",2018-07-05,"[['Sushil', 'Madhumita', ''], ['Šuster', 'Simon', ''], ['Luyckx', 'Kim', ''], ['Daelemans', 'Walter', '']]","['Representation Learning', 'Patient Representations', 'Model Interpretability', 'Natural LanguageProcessing', 'Unsupervised Learning']"
983,1604.07642,Tim Weninger PhD,"Glenn Osborne, Tim Weninger",Ozy: A General Orchestration Container,"8 pages, 8 figures, accepted at IEEE Intl Conf. on Web Services
  (ICWS), San Francisco, CA, 2016",,10.1109/ICWS.2016.84,,cs.SE cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Service-Oriented Computing is a paradigm that uses services as building
blocks for building distributed applications. The primary motivation for
orchestrating services in the cloud used to be distributed business processes,
which drove the standardization of the Business Process Execution Language
(BPEL) and its central notion that a service is a business process. In recent
years, there has been a transition towards other motivations for orchestrating
services in the cloud, {\em e.g.}, XaaS, RMAD. Although it is theoretically
possible to make all of those services into WSDL/SOAP services, it would be too
complicated and costly for industry adoption. Therefore, the central notion
that a service is a business process is too restrictive. Instead, we view a
service as a technology neutral, loosely coupled, location transparent
procedure. With these ideas in mind, we introduce a new approach to services
orchestration: Ozy, a general orchestration container. We define this new
approach in terms of existing technology, and we show that the Ozy container
relaxes many traditional constraints and allows for simpler, more feature-rich
applications.
","[{'version': 'v1', 'created': 'Mon, 25 Apr 2016 15:23:27 GMT'}]",2016-11-15,"[['Osborne', 'Glenn', ''], ['Weninger', 'Tim', '']]","['SOA', 'SOC', 'coordination', 'orchestration', 'service']"
984,1810.09164,Alberto Cetoli,"Alberto Cetoli, Mohammad Akbari, Stefano Bragaglia, Andrew D.
  O'Harney, Marc Sloan",Named Entity Disambiguation using Deep Learning on Graphs,,,10.1007/978-3-030-15719-7_10,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We tackle \ac{NED} by comparing entities in short sentences with \wikidata{}
graphs. Creating a context vector from graphs through deep learning is a
challenging problem that has never been applied to \ac{NED}. Our main
contribution is to present an experimental study of recent neural techniques,
as well as a discussion about which graph features are most important for the
disambiguation task. In addition, a new dataset (\wikidatadisamb{}) is created
to allow a clean and scalable evaluation of \ac{NED} with \wikidata{} entries,
and to be used as a reference in future research. In the end our results show
that a \ac{Bi-LSTM} encoding of the graph triplets performs best, improving
upon the baseline models and scoring an \rm{F1} value of $91.6\%$ on the
\wikidatadisamb{} test set
","[{'version': 'v1', 'created': 'Mon, 22 Oct 2018 10:16:07 GMT'}]",2020-10-16,"[['Cetoli', 'Alberto', ''], ['Akbari', 'Mohammad', ''], ['Bragaglia', 'Stefano', ''], [""O'Harney"", 'Andrew D.', ''], ['Sloan', 'Marc', '']]","['Named Entity Disambiguation', 'Graphs', 'Wikidata', 'RNN', 'GCN']"
985,2102.08322,Jiahuan Pei,"Jiahuan Pei, Pengjie Ren, Maarten de Rijke","A Cooperative Memory Network for Personalized Task-oriented Dialogue
  Systems with Incomplete User Profiles","In Proceedings of the Web Conference 2021 (WWW '21), April 19-23,
  2021, Ljubljana, Slovenia. ACM, New York, NY, USA, 10 pages",,10.1145/3442381.3449843,,cs.AI cs.CL cs.IR,http://creativecommons.org/licenses/by/4.0/,"  There is increasing interest in developing personalized Task-oriented
Dialogue Systems (TDSs). Previous work on personalized TDSs often assumes that
complete user profiles are available for most or even all users. This is
unrealistic because (1) not everyone is willing to expose their profiles due to
privacy concerns; and (2) rich user profiles may involve a large number of
attributes (e.g., gender, age, tastes, . . .). In this paper, we study
personalized TDSs without assuming that user profiles are complete. We propose
a Cooperative Memory Network (CoMemNN) that has a novel mechanism to gradually
enrich user profiles as dialogues progress and to simultaneously improve
response selection based on the enriched profiles. CoMemNN consists of two core
modules: User Profile Enrichment (UPE) and Dialogue Response Selection (DRS).
The former enriches incomplete user profiles by utilizing collaborative
information from neighbor users as well as current dialogues. The latter uses
the enriched profiles to update the current user query so as to encode more
useful information, based on which a personalized response to a user request is
selected.
  We conduct extensive experiments on the personalized bAbI dialogue benchmark
datasets. We find that CoMemNN is able to enrich user profiles effectively,
which results in an improvement of 3.06% in terms of response selection
accuracy compared to state-of-the-art methods. We also test the robustness of
CoMemNN against incompleteness of user profiles by randomly discarding
attribute values from user profiles. Even when discarding 50% of the attribute
values, CoMemNN is able to match the performance of the best performing
baseline without discarding user profiles, showing the robustness of CoMemNN.
","[{'version': 'v1', 'created': 'Tue, 16 Feb 2021 18:05:54 GMT'}]",2021-02-17,"[['Pei', 'Jiahuan', ''], ['Ren', 'Pengjie', ''], ['de Rijke', 'Maarten', '']]","['Dialogue systems', 'personalization', 'neural networks', 'collaborativeagents']"
986,1106.1809,Darko Dimitrov,"Hosam Abdo, Darko Dimitrov, Ivan Gutman",On the Zagreb Indices Equality,"11 pages, 1 figure",Discrete Applied Mathematics 160(1-2): 1-8 (2012),10.1016/j.dam.2011.10.003,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For a simple graph $G$ with $n$ vertices and $m$ edges, the first Zagreb
index and the second Zagreb index are defined as $M_1(G)=\sum_{v\in V}d(v)^2 $
and $M_2(G)=\sum_{uv\in E}d(u)d(v)$. In \cite{VGFAD}, it was shown that if a
connected graph $G$ has maximal degree 4, then $G$ satisfies $M_1(G)/n =
M_2(G)/m$ (also known as the Zagreb indices equality) if and only if $G$ is
regular or biregular of class 1 (a biregular graph whose no two vertices of
same degree are adjacent). There, it was also shown that there exist infinitely
many connected graphs of maximal degree $\Delta= 5$ that are neither regular
nor biregular of class 1 which satisfy the Zagreb indices equality. Here, we
generalize that result by showing that there exist infinitely many connected
graphs of maximal degree $\Delta \geq 5$ that are neither regular nor biregular
graphs of class 1 which satisfy the Zagreb indices equality. We also consider
when the above equality holds when the degrees of vertices of a given graph are
in a prescribed interval of integers.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2011 13:43:40 GMT'}]",2015-03-19,"[['Abdo', 'Hosam', ''], ['Dimitrov', 'Darko', ''], ['Gutman', 'Ivan', '']]","['first Zagreb index', 'second Zagreb index', 'comparing Zagreb indices']"
987,1804.07284,Cem C. Tutum,"Cem C. Tutum, Supawit Chockchowwat, Etienne Vouga, Risto Miikkulainen",Functional Generative Design: An Evolutionary Approach to 3D-Printing,"8 pages, 12 figures, GECCO'18",,10.1145/3205455.3205635,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consumer-grade printers are widely available, but their ability to print
complex objects is limited. Therefore, new designs need to be discovered that
serve the same function, but are printable. A representative such problem is to
produce a working, reliable mechanical spring. The proposed methodology for
discovering solutions to this problem consists of three components: First, an
effective search space is learned through a variational autoencoder (VAE);
second, a surrogate model for functional designs is built; and third, a genetic
algorithm is used to simultaneously update the hyperparameters of the surrogate
and to optimize the designs using the updated surrogate. Using a car-launcher
mechanism as a test domain, spring designs were 3D-printed and evaluated to
update the surrogate model. Two experiments were then performed: First, the
initial set of designs for the surrogate-based optimizer was selected randomly
from the training set that was used for training the VAE model, which resulted
in an exploitative search behavior. On the other hand, in the second
experiment, the initial set was composed of more uniformly selected designs
from the same training set and a more explorative search behavior was observed.
Both of the experiments showed that the methodology generates interesting,
successful, and reliable spring geometries robust to the noise inherent in the
3D printing process. The methodology can be generalized to other functional
design problems, thus making consumer-grade 3D printing more versatile.
","[{'version': 'v1', 'created': 'Thu, 19 Apr 2018 17:35:50 GMT'}]",2018-04-20,"[['Tutum', 'Cem C.', ''], ['Chockchowwat', 'Supawit', ''], ['Vouga', 'Etienne', ''], ['Miikkulainen', 'Risto', '']]","['3D Printing', 'Variational Autoencoder', 'Kriging', 'Efficient Global Optimization', 'Constraint Handling', 'Missing Values', 'Noisy Landscape']"
988,1007.4908,"J\""urgen Giesl","Peter Schneider-Kamp, J\""urgen Giesl, Thomas Str\""oder, Alexander
  Serebrenik, Ren\'e Thiemann",Automated Termination Analysis for Logic Programs with Cut,,"Theory and Practice of Logic Programming, 10(4-6), 365-381, 2010",10.1017/S1471068410000165,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Termination is an important and well-studied property for logic programs.
However, almost all approaches for automated termination analysis focus on
definite logic programs, whereas real-world Prolog programs typically use the
cut operator. We introduce a novel pre-processing method which automatically
transforms Prolog programs into logic programs without cuts, where termination
of the cut-free program implies termination of the original program. Hence
after this pre-processing, any technique for proving termination of definite
logic programs can be applied. We implemented this pre-processing in our
termination prover AProVE and evaluated it successfully with extensive
experiments.
","[{'version': 'v1', 'created': 'Wed, 28 Jul 2010 09:27:52 GMT'}]",2010-07-29,"[['Schneider-Kamp', 'Peter', ''], ['Giesl', 'Jürgen', ''], ['Ströder', 'Thomas', ''], ['Serebrenik', 'Alexander', ''], ['Thiemann', 'René', '']]","['automated termination analysis', 'cut', 'definite logic programs']"
989,1705.04016,Kevin Moran P,"Kevin Moran, Mario Linares-V\'asquez, Carlos Bernal-C\'ardenas, Denys
  Poshyvanyk",Auto-completing Bug Reports for Android Applications,"ESEC/FSE 2015 10th Joint Meeting on Foundations of Software
  Engineering, 14 pages",,10.1145/2786805.2786857,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The modern software development landscape has seen a shift in focus toward
mobile applications as tablets and smartphones near ubiquitous adoption. Due to
this trend, the complexity of these apps has been increasing, making
development and maintenance challenging. Additionally, current bug tracking
systems are not able to effectively support construction of reports with
actionable information that directly lead to a bug's resolution. To address the
need for an improved reporting system, we introduce a novel solution, called
FUSION, that helps users auto complete reproduction steps in bug reports for
mobile apps. FUSION links user provided information to program artifacts
extracted through static and dynamic analysis performed before testing or
release. The approach that FUSION employs is generalizable to other current
mobile software platforms, and constitutes a new method by which off device bug
reporting can be conducted for mobile software projects. In a study involving
28 participants we applied FUSION to support the maintenance tasks of reporting
and reproducing defects from 15 real world bugs found in 14 open source Android
apps while qualitatively and qualitatively measuring the user experience of the
system. Our results demonstrate that FUSION both effectively facilitates
reporting and allows for more reliable reproduction of bugs from reports
compared to traditional issue tracking systems by presenting more detailed
contextual app information.
","[{'version': 'v1', 'created': 'Thu, 11 May 2017 04:51:19 GMT'}]",2017-05-12,"[['Moran', 'Kevin', ''], ['Linares-Vásquez', 'Mario', ''], ['Bernal-Cárdenas', 'Carlos', ''], ['Poshyvanyk', 'Denys', '']]","['Bug reports', 'android', 'reproduction steps', 'auto-completion']"
990,1304.0810,Claudio Angione,"Claudio Angione, Annalisa Occhipinti, Giovanni Stracquadanio, Giuseppe
  Nicosia",Bose-Einstein Condensation in Satisfiability Problems,,"European Journal of Operational Research, 227, 44-54 (2013)",10.1016/j.ejor.2012.11.039,,cs.DS cond-mat.stat-mech,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is concerned with the complex behavior arising in satisfiability
problems. We present a new statistical physics-based characterization of the
satisfiability problem. Specifically, we design an algorithm that is able to
produce graphs starting from a k-SAT instance, in order to analyze them and
show whether a Bose-Einstein condensation occurs. We observe that, analogously
to complex networks, the networks of k-SAT instances follow Bose statistics and
can undergo Bose-Einstein condensation. In particular, k-SAT instances move
from a fit-get-rich network to a winner-takes-all network as the ratio of
clauses to variables decreases, and the phase transition of k-SAT approximates
the critical temperature for the Bose-Einstein condensation. Finally, we employ
the fitness-based classification to enhance SAT solvers (e.g., ChainSAT) and
obtain the consistently highest performing SAT solver for CNF formulas, and
therefore a new class of efficient hardware and software verification tools.
","[{'version': 'v1', 'created': 'Tue, 2 Apr 2013 22:58:35 GMT'}]",2013-04-04,"[['Angione', 'Claudio', ''], ['Occhipinti', 'Annalisa', ''], ['Stracquadanio', 'Giovanni', ''], ['Nicosia', 'Giuseppe', '']]","['k–SAT', 'complex networks', 'Bose-Einstein condensation', 'phase transition', 'performance']"
991,1607.07543,Ming-Feng Ge,"Ming-Feng Ge, Zhi-Hong Guan, Chao Yang, Chao-Yang Chen, Ding-Fu Zheng,
  Ming Chi","Task-space coordinated tracking of multiple heterogeneous manipulators
  via controller-estimator approaches","17 pages, 7 figures, Journal of the Franklin Institute",,10.1016/j.jfranklin.2016.06.025,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies the task-space coordinated tracking of a time-varying
leader for multiple heterogeneous manipulators (MHMs), containing redundant
manipulators and nonredundant ones. Different from the traditional coordinated
control, distributed controller-estimator algorithms (DCEA), which consist of
local algorithms and networked algorithms, are developed for MHMs with
parametric uncertainties and input disturbances. By invoking differential
inclusions, nonsmooth analysis, and input-to-state stability, some conditions
(including sufficient conditions, necessary and sufficient conditions) on the
asymptotic stability of the task-space tracking errors and the subtask errors
are developed. Simulation results are given to show the effectiveness of the
presented DCEA.
","[{'version': 'v1', 'created': 'Tue, 26 Jul 2016 05:20:43 GMT'}]",2016-07-27,"[['Ge', 'Ming-Feng', ''], ['Guan', 'Zhi-Hong', ''], ['Yang', 'Chao', ''], ['Chen', 'Chao-Yang', ''], ['Zheng', 'Ding-Fu', ''], ['Chi', 'Ming', '']]","['task-space coordinated tracking', 'multiple heterogeneousmanipulators (MHMs)', 'redundant manipulator', 'distributedcontroller-estimator algorithm (DCEA)']"
992,1609.00086,Rajasekar Venkatesan,"Rajasekar Venkatesan, Meng Joo Er, Mihika Dave, Mahardhika Pratama,
  Shiqian Wu","A novel online multi-label classifier for high-speed streaming data
  applications","18 pages, 7 tables, 3 figures. arXiv admin note: text overlap with
  arXiv:1608.08898",,10.1007/s12530-016-9162-8,,cs.LG cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a high-speed online neural network classifier based on extreme
learning machines for multi-label classification is proposed. In multi-label
classification, each of the input data sample belongs to one or more than one
of the target labels. The traditional binary and multi-class classification
where each sample belongs to only one target class forms the subset of
multi-label classification. Multi-label classification problems are far more
complex than binary and multi-class classification problems, as both the number
of target labels and each of the target labels corresponding to each of the
input samples are to be identified. The proposed work exploits the high-speed
nature of the extreme learning machines to achieve real-time multi-label
classification of streaming data. A new threshold-based online sequential
learning algorithm is proposed for high speed and streaming data classification
of multi-label problems. The proposed method is experimented with six different
datasets from different application domains such as multimedia, text, and
biology. The hamming loss, accuracy, training time and testing time of the
proposed technique is compared with nine different state-of-the-art methods.
Experimental studies shows that the proposed technique outperforms the existing
multi-label classifiers in terms of performance and speed.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2016 01:58:50 GMT'}]",2016-09-06,"[['Venkatesan', 'Rajasekar', ''], ['Er', 'Meng Joo', ''], ['Dave', 'Mihika', ''], ['Pratama', 'Mahardhika', ''], ['Wu', 'Shiqian', '']]","['Classification', 'multi-label', 'extreme learning machines', 'high speed', 'real-time']"
993,1109.1068,Karteeka Pavan Kanadam,"K. Karteeka Pavan, Allam Appa Rao, A. V. Dattatreya Rao",An Automatic Clustering Technique for Optimal Clusters,"12 pages, 5 figures, 2 tables","International journal of Computer Sciene Engineering and
  Applications, Vol., No.4, 2011, pp 133-144",10.5121/ijcsea.2011.1412,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a simple, automatic and efficient clustering algorithm,
namely, Automatic Merging for Optimal Clusters (AMOC) which aims to generate
nearly optimal clusters for the given datasets automatically. The AMOC is an
extension to standard k-means with a two phase iterative procedure combining
certain validation techniques in order to find optimal clusters with automation
of merging of clusters. Experiments on both synthetic and real data have proved
that the proposed algorithm finds nearly optimal clustering structures in terms
of number of clusters, compactness and separation.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2011 05:34:28 GMT'}]",2011-09-07,"[['Pavan', 'K. Karteeka', ''], ['Rao', 'Allam Appa', ''], ['Rao', 'A. V. Dattatreya', '']]","['Clustering', 'Optimal clusters', 'k-means', 'validation technique']"
994,1705.06227,Mancho Manev,Hristo Manev and Mancho Manev,"Design, analysis and implementation of electronic test for knowledge
  evaluation in the course of Information Technologies for pharmaceutical
  students","6 pages, presented at CBU International Conference: Innovations in
  Science and Education, March 22-24, 2017, Prague, Czech Republic","CBU International Conference Proceedings: Innovations in Science
  and Education, vol. 5 (2017), 705-709",10.12955/cbup.v5.1011,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increased usage of the information technologies in everyday life and
especially in education leads to demands for new forms of teaching, studying
and appropriate examination and evaluation of acquired knowledge and skills of
the students. Modern electronic educational systems use only those technologies
that improve the learning process and make it more effective. The interactive
education provides an opportunity to develop skills for independent literature
research and activation of the cognitive activity. In this work, it is shown
how a modern electronic education is implemented in the curriculum of English
language pharmaceutical students at the Medical University - Plovdiv in the
course of Information Technologies. It is developed a methodological approach
of a hybrid system, i.e. a compulsory attendance at lectures in combination
with two different types of conduction of the final test for comparison - a
paper-based test and a remote web-based one. The results received from the
parallel tests are processed and analysed and the conclusions are used to
enhance the quality of the developed test and the type of implementation.
Moreover, the examined students fill in an anonymous poll to show the authors
their thoughts for this type of hybrid educational system.
","[{'version': 'v1', 'created': 'Wed, 17 May 2017 16:05:46 GMT'}]",2017-11-21,"[['Manev', 'Hristo', ''], ['Manev', 'Mancho', '']]","['interactive learning', 'e-learning', 'educational technology', 'electronic test']"
995,1404.0088,EPTCS,"Youcheng Sun, Giuseppe Lipari, \'Etienne Andr\'e, Laurent Fribourg",Toward Parametric Timed Interfaces for Real-Time Components,"In Proceedings SynCoP 2014, arXiv:1403.7841","EPTCS 145, 2014, pp. 49-64",10.4204/EPTCS.145.6,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose here a framework to model real-time components consisting of
concurrent real-time tasks running on a single processor, using parametric
timed automata. Our framework is generic and modular, so as to be easily
adapted to different schedulers and more complex task models. We first perform
a parametric schedulability analysis of the components using the inverse
method. We show that the method unfortunately does not provide satisfactory
results when the task periods are consid- ered as parameters. After identifying
and explaining the problem, we present a solution adapting the model by making
use of the worst-case scenario in schedulability analysis. We show that the
analysis with the inverse method always converges on the modified model when
the system load is strictly less than 100%. Finally, we show how to use our
parametric analysis for the generation of timed interfaces in compositional
system design.
","[{'version': 'v1', 'created': 'Tue, 1 Apr 2014 00:40:01 GMT'}]",2014-04-02,"[['Sun', 'Youcheng', ''], ['Lipari', 'Giuseppe', ''], ['André', 'Étienne', ''], ['Fribourg', 'Laurent', '']]","['Real-Time Scheduling', 'Parametric Schedulability Analysis', 'Parametric Timed Automata']"
996,2208.02252,Benedict Yeoh,Benedict Yeoh and Huijuan Wang,"GROWN+UP: A Graph Representation Of a Webpage Network Utilizing
  Pre-training",Submitted to CIKM '22,"CIKM '22: Proceedings of the 31st ACM International Conference on
  Information & Knowledge Management October 2022",10.1145/3511808.3557340,,cs.LG cs.AI cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Large pre-trained neural networks are ubiquitous and critical to the success
of many downstream tasks in natural language processing and computer vision.
However, within the field of web information retrieval, there is a stark
contrast in the lack of similarly flexible and powerful pre-trained models that
can properly parse webpages. Consequently, we believe that common machine
learning tasks like content extraction and information mining from webpages
have low-hanging gains that yet remain untapped.
  We aim to close the gap by introducing an agnostic deep graph neural network
feature extractor that can ingest webpage structures, pre-train self-supervised
on massive unlabeled data, and fine-tune to arbitrary tasks on webpages
effectually.
  Finally, we show that our pre-trained model achieves state-of-the-art results
using multiple datasets on two very different benchmarks: webpage boilerplate
removal and genre classification, thus lending support to its potential
application in diverse downstream tasks.
","[{'version': 'v1', 'created': 'Wed, 3 Aug 2022 13:37:27 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Oct 2022 10:28:48 GMT'}]",2022-10-28,"[['Yeoh', 'Benedict', ''], ['Wang', 'Huijuan', '']]","['graph neural network', 'webpage', 'pre-training', 'self-supervised', 'boilerplate removal', 'web genre classification', 'feature extractor', 'backbone']"
997,1812.04697,Milad Salem,"Milad Salem, Shayan Taheri, Jiann Shiun Yuan","Anomaly Generation using Generative Adversarial Networks in Host Based
  Intrusion Detection","Accepted and presented at IEEE Annual Ubiquitous Computing,
  Electronics, and Mobile Communications Conference (IEEE UEMCON) on 8th-10th
  November 2018",,10.1109/UEMCON.2018.8796769,,cs.LG cs.CR cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generative adversarial networks have been able to generate striking results
in various domains. This generation capability can be general while the
networks gain deep understanding regarding the data distribution. In many
domains, this data distribution consists of anomalies and normal data, with the
anomalies commonly occurring relatively less, creating datasets that are
imbalanced. The capabilities that generative adversarial networks offer can be
leveraged to examine these anomalies and help alleviate the challenge that
imbalanced datasets propose via creating synthetic anomalies. This anomaly
generation can be specifically beneficial in domains that have costly data
creation processes as well as inherently imbalanced datasets. One of the
domains that fits this description is the host-based intrusion detection
domain. In this work, ADFA-LD dataset is chosen as the dataset of interest
containing system calls of small foot-print next generation attacks. The data
is first converted into images, and then a Cycle-GAN is used to create images
of anomalous data from images of normal data. The generated data is combined
with the original dataset and is used to train a model to detect anomalies. By
doing so, it is shown that the classification results are improved, with the
AUC rising from 0.55 to 0.71, and the anomaly detection rate rising from 17.07%
to 80.49%. The results are also compared to SMOTE, showing the potential
presented by generative adversarial networks in anomaly generation.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2018 21:21:09 GMT'}]",2019-09-16,"[['Salem', 'Milad', ''], ['Taheri', 'Shayan', ''], ['Yuan', 'Jiann Shiun', '']]","['Anomaly Generation', 'Cycle-GAN', 'Generative']"
998,1410.0371,Ankit Chaudhary,"J. L. Raheja, B. Ajay, Ankit Chaudhary",Real Time Fabric Defect Detection System on an Embedded DSP Platform,Optik Elsevier 2013,,10.1016/j.ijleo.2013.03.038,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In industrial fabric productions, automated real time systems are needed to
find out the minor defects. It will save the cost by not transporting defected
products and also would help in making compmay image of quality fabrics by
sending out only undefected products. A real time fabric defect detection
system (FDDS), implementd on an embedded DSP platform is presented here.
Textural features of fabric image are extracted based on gray level
co-occurrence matrix (GLCM). A sliding window technique is used for defect
detection where window moves over the whole image computing a textural energy
from the GLCM of the fabric image. The energy values are compared to a
reference and the deviations beyond a threshold are reported as defects and
also visually represented by a window. The implementation is carried out on a
TI TMS320DM642 platform and programmed using code composer studio software. The
real time output of this implementation was shown on a monitor.
","[{'version': 'v1', 'created': 'Mon, 8 Sep 2014 02:49:07 GMT'}]",2014-10-03,"[['Raheja', 'J. L.', ''], ['Ajay', 'B.', ''], ['Chaudhary', 'Ankit', '']]","['Fabric Defects', 'Texture', 'Grey Level Co-occurrence Matrix', 'DSP Kit', 'Energy Computation', 'Sliding Window', 'FDDS']"
999,1807.05195,Daniel Grie{\ss}haber,"Daniel Grie{\ss}haber, Ngoc Thang Vu, and Johannes Maucher",Low-Resource Text Classification using Domain-Adversarial Learning,,"Computer Speech & Language Volume 62, July 2020, 101056 Computer
  Speech & Language Volume 62, July 2020, 101056",10.1016/j.csl.2019.101056,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning techniques have recently shown to be successful in many natural
language processing tasks forming state-of-the-art systems. They require,
however, a large amount of annotated data which is often missing. This paper
explores the use of domain-adversarial learning as a regularizer to avoid
overfitting when training domain invariant features for deep, complex neural
networks in low-resource and zero-resource settings in new target domains or
languages. In case of new languages, we show that monolingual word vectors can
be directly used for training without prealignment. Their projection into a
common space can be learnt ad-hoc at training time reaching the final
performance of pretrained multilingual word vectors.
","[{'version': 'v1', 'created': 'Fri, 13 Jul 2018 17:30:32 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Apr 2020 07:19:47 GMT'}]",2020-04-23,"[['Grießhaber', 'Daniel', ''], ['Vu', 'Ngoc Thang', ''], ['Maucher', 'Johannes', '']]","['NLP', 'Low-resource', 'Deep Learning', 'Domain-Adversarial']"
1000,1311.6609,Antonio Iovanella,"Giovanna Ferraro, Antonio Iovanella",Choreography In Inter-Organizational Innovation Networks,,"International Journal of Engineering Business Management, 7, 2015",10.5772/61802,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces the concept of choreography with respect to
inter-organizational innovation networks, as they constitute an attractive
environment to create innovation in different sectors. We argue that
choreography governs behaviours by shaping the level of connectivity and
cohesion among network members. It represents a valid organizational system
able to sustain some activities and to reach effects generating innovation
outcomes. This issue is tackled introducing a new framework in which we propose
a network model as prerequisite for our hypothesis. The analysis is focused on
inter-organizational innovation networks characterized by the presence of hubs,
semi-peripheral and peripheral members lacking hierarchical authority. We
sustain that the features of a network, bringing to synchronization phenomena,
are extremely similar to those existing in innovation network characterized by
the emergence of choreography. The effectiveness of our model is verified by
providing a real case study that gives preliminary empirical hints on the
network aptitude to perform choreography. Indeed, the innovation network
analysed in the case study reveals characteristics causing synchronization and
consequently the establishment of choreography.
","[{'version': 'v1', 'created': 'Tue, 26 Nov 2013 10:09:15 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Dec 2013 17:41:18 GMT'}, {'version': 'v3', 'created': 'Fri, 20 Jun 2014 13:57:52 GMT'}]",2017-02-14,"[['Ferraro', 'Giovanna', ''], ['Iovanella', 'Antonio', '']]","['Network choreography', 'complex network', 'innovation network', 'orches']"
1001,1905.09932,Vladimir Ivashkin,"Vadim Lebedev, Vladimir Ivashkin, Irina Rudenko, Alexander Ganshin,
  Alexander Molchanov, Sergey Ovcharenko, Ruslan Grokhovetskiy, Ivan
  Bushmarinov, Dmitry Solomentsev",Precipitation Nowcasting with Satellite Imagery,Final KDD 2019 version,"in Proceedings of The 25th ACM SIGKDD Conference on Knowledge
  Discovery and Data Mining, KDD 2019",10.1145/3292500.3330762,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Precipitation nowcasting is a short-range forecast of rain/snow (up to 2
hours), often displayed on top of the geographical map by the weather service.
Modern precipitation nowcasting algorithms rely on the extrapolation of
observations by ground-based radars via optical flow techniques or neural
network models. Dependent on these radars, typical nowcasting is limited to the
regions around their locations. We have developed a method for precipitation
nowcasting based on geostationary satellite imagery and incorporated the
resulting data into the Yandex.Weather precipitation map (including an alerting
service with push notifications for products in the Yandex ecosystem), thus
expanding its coverage and paving the way to a truly global nowcasting service.
","[{'version': 'v1', 'created': 'Thu, 23 May 2019 21:11:16 GMT'}]",2020-03-17,"[['Lebedev', 'Vadim', ''], ['Ivashkin', 'Vladimir', ''], ['Rudenko', 'Irina', ''], ['Ganshin', 'Alexander', ''], ['Molchanov', 'Alexander', ''], ['Ovcharenko', 'Sergey', ''], ['Grokhovetskiy', 'Ruslan', ''], ['Bushmarinov', 'Ivan', ''], ['Solomentsev', 'Dmitry', '']]","['neural networks', 'radar', 'satellite', 'nowcasting', 'weather forecasting']"
1002,1306.2298,Sadegh Motallebi,"Sadegh Motallebi, Sadegh Aliakbary, Jafar Habibi","Generative Model Selection Using a Scalable and Size-Independent Complex
  Network Classifier",,"Chaos 23, 043127 (2013);",10.1063/1.4840235,,cs.SI cs.LG physics.soc-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real networks exhibit nontrivial topological features such as heavy-tailed
degree distribution, high clustering, and small-worldness. Researchers have
developed several generative models for synthesizing artificial networks that
are structurally similar to real networks. An important research problem is to
identify the generative model that best fits to a target network. In this
paper, we investigate this problem and our goal is to select the model that is
able to generate graphs similar to a given network instance. By the means of
generating synthetic networks with seven outstanding generative models, we have
utilized machine learning methods to develop a decision tree for model
selection. Our proposed method, which is named ""Generative Model Selection for
Complex Networks"" (GMSCN), outperforms existing methods with respect to
accuracy, scalability and size-independence.
","[{'version': 'v1', 'created': 'Mon, 10 Jun 2013 19:42:10 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Jun 2013 09:46:04 GMT'}, {'version': 'v3', 'created': 'Sat, 1 Feb 2014 10:42:30 GMT'}]",2014-02-04,"[['Motallebi', 'Sadegh', ''], ['Aliakbary', 'Sadegh', ''], ['Habibi', 'Jafar', '']]","['Complex Networks', 'Generative Models', 'Synthetic Networks', 'Model Selection', 'Network StructuralFeatures', 'Social Networks', 'Decision Tree Learning']"
1003,1106.4096,EPTCS,"Ukachukwu Ndukwu (Macquarie University, Australia), Annabelle McIver
  (Macquarie University, Australia)","Model exploration and analysis for quantitative safety refinement in
  probabilistic B","In Proceedings Refine 2011, arXiv:1106.3488","EPTCS 55, 2011, pp. 101-120",10.4204/EPTCS.55.7,,cs.LO cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The role played by counterexamples in standard system analysis is well known;
but less common is a notion of counterexample in probabilistic systems
refinement. In this paper we extend previous work using counterexamples to
inductive invariant properties of probabilistic systems, demonstrating how they
can be used to extend the technique of bounded model checking-style analysis
for the refinement of quantitative safety specifications in the probabilistic B
language. In particular, we show how the method can be adapted to cope with
refinements incorporating probabilistic loops. Finally, we demonstrate the
technique on pB models summarising a one-step refinement of a randomised
algorithm for finding the minimum cut of undirected graphs, and that for the
dependability analysis of a controller design.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2011 05:25:05 GMT'}]",2011-06-22,"[['Ndukwu', 'Ukachukwu', '', 'Macquarie University, Australia'], ['McIver', 'Annabelle', '', 'Macquarie University, Australia']]","['Probabilistic B', 'quantitative safety specification', 'refinement', 'counterexamples']"
1004,1901.04375,Bahareh Sarrafzadeh,"Bahareh Sarrafzadeh, Ahmed Hassan Awadallah, Christopher H. Lin,
  Chia-Jung Lee, Milad Shokouhi and Susan T. Dumais",Characterizing and Predicting Email Deferral Behavior,,WSDM 2019,10.1145/3289600.3291028,,cs.IR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Email triage involves going through unhandled emails and deciding what to do
with them. This familiar process can become increasingly challenging as the
number of unhandled email grows. During a triage session, users commonly defer
handling emails that they cannot immediately deal with to later. These deferred
emails, are often related to tasks that are postponed until the user has more
time or the right information to deal with them. In this paper, through
qualitative interviews and a large-scale log analysis, we study when and what
enterprise email users tend to defer. We found that users are more likely to
defer emails when handling them involves replying, reading carefully, or
clicking on links and attachments. We also learned that the decision to defer
emails depends on many factors such as user's workload and the importance of
the sender. Our qualitative results suggested that deferring is very common,
and our quantitative log analysis confirms that 12% of triage sessions and 16%
of daily active users had at least one deferred email on weekdays. We also
discuss several deferral strategies such as marking emails as unread and
flagging that are reported by our interviewees, and illustrate how such
patterns can be also observed in user logs. Inspired by the characteristics of
deferred emails and contextual factors involved in deciding if an email should
be deferred, we train a classifier for predicting whether a recently triaged
email is actually deferred. Our experimental results suggests that deferral can
be classified with modest effectiveness. Overall, our work provides novel
insights about how users handle their emails and how deferral can be modeled.
","[{'version': 'v1', 'created': 'Mon, 14 Jan 2019 16:09:53 GMT'}]",2019-01-15,"[['Sarrafzadeh', 'Bahareh', ''], ['Awadallah', 'Ahmed Hassan', ''], ['Lin', 'Christopher H.', ''], ['Lee', 'Chia-Jung', ''], ['Shokouhi', 'Milad', ''], ['Dumais', 'Susan T.', '']]","['Email Management', 'Triage', 'Deferral', 'Users Behavior Modeling']"
1005,2104.06710,Teemu Lehtinen,"Teemu Lehtinen, Aleksi Lukkarinen, Lassi Haaranen",Students Struggle to Explain Their Own Program Code,Accepted manuscript for ITiCSE'21,"Proceedings of the 26th ACM Conference on Innovation and
  Technology in Computer Science Education V. 1 (2021) 206-212",10.1145/3430665.3456322,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We asked students to explain the structure and execution of their small
programs after they had submitted them to a programming exercise. These
questions about learner's code (QLCs) were delivered at three occasions in an
online and open course in introductory programming as a part of the digital
learning material. We make inductive content analysis to research the
open-ended text answers we collected. One third of the students struggled to
explain their own program code. This estimates possible occurrences of fragile
learning at the moment when a student seemingly succeeds in a program writing
exercise. Furthermore, we examine correlations between the correctness of the
answers with other learning data. Our results indicate that answering properly
aligned QLCs correctly has stronger correlation with student success and
retention than merely submitting a correct program. Additionally, we present
observations on learning event-driven programming to explore QLCs' potential in
identifying students' thinking process.
","[{'version': 'v1', 'created': 'Wed, 14 Apr 2021 09:13:05 GMT'}]",2021-07-06,"[['Lehtinen', 'Teemu', ''], ['Lukkarinen', 'Aleksi', ''], ['Haaranen', 'Lassi', '']]","['QLC', 'program comprehension', 'event-driven programming', 'introductory programming', 'CS1', 'online education']"
1006,1803.08312,Antonio Pertusa,Aurelia Bustos and Antonio Pertusa,"Learning Eligibility in Cancer Clinical Trials using Deep Neural
  Networks",,"Applied Sciences, 8(7), 2018",10.3390/app8071206,,cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interventional cancer clinical trials are generally too restrictive, and some
patients are often excluded on the basis of comorbidity, past or concomitant
treatments, or the fact that they are over a certain age. The efficacy and
safety of new treatments for patients with these characteristics are,
therefore, not defined. In this work, we built a model to automatically predict
whether short clinical statements were considered inclusion or exclusion
criteria. We used protocols from cancer clinical trials that were available in
public registries from the last 18 years to train word-embeddings, and we
constructed a~dataset of 6M short free-texts labeled as eligible or not
eligible. A text classifier was trained using deep neural networks, with
pre-trained word-embeddings as inputs, to predict whether or not short
free-text statements describing clinical information were considered eligible.
We additionally analyzed the semantic reasoning of the word-embedding
representations obtained and were able to identify equivalent treatments for a
type of tumor analogous with the drugs used to treat other tumors. We show that
representation learning using {deep} neural networks can be successfully
leveraged to extract the medical knowledge from clinical trial protocols for
potentially assisting practitioners when prescribing treatments.
","[{'version': 'v1', 'created': 'Thu, 22 Mar 2018 11:38:53 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Mar 2018 14:45:57 GMT'}, {'version': 'v3', 'created': 'Wed, 25 Jul 2018 10:06:35 GMT'}]",2018-07-26,"[['Bustos', 'Aurelia', ''], ['Pertusa', 'Antonio', '']]","['Clinical Trials', 'Clinical Decision Support System', 'NaturalLanguage Processing', 'Word Embeddings', 'Deep Neural Networks']"
1007,2105.05502,Britta Grusdt,Britta Grusdt and Daniel Lassiter and Michael Franke,Probabilistic modeling of rational communication with conditionals,,,10.3765/sp.15.13,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  While a large body of work has scrutinized the meaning of conditional
sentences, considerably less attention has been paid to formal models of their
pragmatic use and interpretation. Here, we take a probabilistic approach to
pragmatic reasoning about indicative conditionals which flexibly integrates
gradient beliefs about richly structured world states. We model listeners'
update of their prior beliefs about the causal structure of the world and the
joint probabilities of the consequent and antecedent based on assumptions about
the speaker's utterance production protocol. We show that, when supplied with
natural contextual assumptions, our model uniformly explains a number of
inferences attested in the literature, including epistemic inferences,
conditional perfection and the dependency between antecedent and consequent of
a conditional. We argue that this approach also helps explain three puzzles
introduced by Douven (2012) about updating with conditionals: depending on the
utterance context, the listener's belief in the antecedent may increase,
decrease or remain unchanged.
","[{'version': 'v1', 'created': 'Wed, 12 May 2021 08:21:25 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Jul 2021 18:20:56 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Jul 2022 11:02:09 GMT'}, {'version': 'v4', 'created': 'Sat, 8 Oct 2022 06:05:03 GMT'}, {'version': 'v5', 'created': 'Thu, 13 Oct 2022 06:19:19 GMT'}]",2022-10-14,"[['Grusdt', 'Britta', ''], ['Lassiter', 'Daniel', ''], ['Franke', 'Michael', '']]","['indicative conditionals', 'Rational-Speech-Act model', 'computational pragmatics', 'causal Bayes nets', 'inferentialism']"
1008,2003.12265,Alexander Schindler,"Alexander Schindler, Sergiu Gordea, Peter Knees","Unsupervised Cross-Modal Audio Representation Learning from Unstructured
  Multilingual Text",This is the long version of our SAC2020 poster presentation,"In Proceedings of the 35th ACM/SIGAPP Symposium On Applied
  Computing (SAC2020), March 30-April 3, 2020, Brno, Czech Republic",,,cs.MM cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an approach to unsupervised audio representation learning. Based
on a triplet neural network architecture, we harnesses semantically related
cross-modal information to estimate audio track-relatedness. By applying Latent
Semantic Indexing (LSI) we embed corresponding textual information into a
latent vector space from which we derive track relatedness for online triplet
selection. This LSI topic modelling facilitates fine-grained selection of
similar and dissimilar audio-track pairs to learn the audio representation
using a Convolution Recurrent Neural Network (CRNN). By this we directly
project the semantic context of the unstructured text modality onto the learned
representation space of the audio modality without deriving structured
ground-truth annotations from it. We evaluate our approach on the Europeana
Sounds collection and show how to improve search in digital audio libraries by
harnessing the multilingual meta-data provided by numerous European digital
libraries. We show that our approach is invariant to the variety of annotation
styles as well as to the different languages of this collection. The learned
representations perform comparable to the baseline of handcrafted features,
respectively exceeding this baseline in similarity retrieval precision at
higher cut-offs with only 15\% of the baseline's feature vector length.
","[{'version': 'v1', 'created': 'Fri, 27 Mar 2020 07:37:15 GMT'}]",2020-03-30,"[['Schindler', 'Alexander', ''], ['Gordea', 'Sergiu', ''], ['Knees', 'Peter', '']]","['audio representation learning', 'cross-modal learning', 'deep neuralnetworks']"
1009,1512.08187,Gaurav Somani,"Gaurav Somani, Manoj Singh Gaur, Dheeraj Sanghi, Mauro Conti and
  Rajkumar Buyya","DDoS Attacks in Cloud Computing: Issues, Taxonomy, and Future Directions","Published in Computer Communications, Volume 107, 2017, Eslevier",,10.1016/j.comcom.2017.03.010.,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security issues related to the cloud computing are relevant to various
stakeholders for an informed cloud adoption decision. Apart from data breaches,
the cyber security research community is revisiting the attack space for
cloud-specific solutions as these issues affect budget, resource management,
and service quality. Distributed Denial of Service (DDoS) attack is one such
serious attack in the cloud space. In this paper, we present developments
related to DDoS attack mitigation solutions in the cloud. In particular, we
present a comprehensive survey with a detailed insight into the
characterization, prevention, detection, and mitigation mechanisms of these
attacks. Additionally, we present a comprehensive solution taxonomy to classify
DDoS attack solutions. We also provide a comprehensive discussion on important
metrics to evaluate various solutions. This survey concludes that there is a
strong requirement of solutions, which are designed keeping utility computing
models in mind. Accurate auto-scaling decisions, multi-layer mitigation, and
defense using profound resources in the cloud, are some of the key requirements
of the desired solutions. In the end, we provide a definite guideline on
effective solution building and detailed solution requirements to help the
cyber security research community in designing defense mechanisms. To the best
of our knowledge, this work is a novel attempt to identify the need of DDoS
mitigation solutions involving multi-level information flow and effective
resource management during the attack.
","[{'version': 'v1', 'created': 'Sun, 27 Dec 2015 09:16:20 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Aug 2017 09:26:23 GMT'}]",2017-08-29,"[['Somani', 'Gaurav', ''], ['Gaur', 'Manoj Singh', ''], ['Sanghi', 'Dheeraj', ''], ['Conti', 'Mauro', ''], ['Buyya', 'Rajkumar', '']]","['Cloud Computing', 'Distributed Denial of Service (DDoS)', 'Security and Protection']"
1010,1705.07142,Abhay Shah,"Abhay Shah, Michael Abramoff and Xiaodong Wu",Simultaneous Multiple Surface Segmentation Using Deep Learning,8 pages,,10.1007/978-3-319-67558-9_1,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The task of automatically segmenting 3-D surfaces representing boundaries of
objects is important for quantitative analysis of volumetric images, and plays
a vital role in biomedical image analysis. Recently, graph-based methods with a
global optimization property have been developed and optimized for various
medical imaging applications. Despite their widespread use, these require human
experts to design transformations, image features, surface smoothness priors,
and re-design for a different tissue, organ or imaging modality. Here, we
propose a Deep Learning based approach for segmentation of the surfaces in
volumetric medical images, by learning the essential features and
transformations from training data, without any human expert intervention. We
employ a regional approach to learn the local surface profiles. The proposed
approach was evaluated on simultaneous intraretinal layer segmentation of
optical coherence tomography (OCT) images of normal retinas and retinas
affected by age related macular degeneration (AMD). The proposed approach was
validated on 40 retina OCT volumes including 20 normal and 20 AMD subjects. The
experiments showed statistically significant improvement in accuracy for our
approach compared to state-of-the-art graph based optimal surface segmentation
with convex priors (G-OSC). A single Convolution Neural Network (CNN) was used
to learn the surfaces for both normal and diseased images. The mean unsigned
surface positioning errors obtained by G-OSC method 2.31 voxels (95% CI
2.02-2.60 voxels) was improved to $1.27$ voxels (95% CI 1.14-1.40 voxels) using
our new approach. On average, our approach takes 94.34 s, requiring 95.35 MB
memory, which is much faster than the 2837.46 s and 6.87 GB memory required by
the G-OSC method on the same computer system.
","[{'version': 'v1', 'created': 'Fri, 19 May 2017 18:43:07 GMT'}]",2018-01-10,"[['Shah', 'Abhay', ''], ['Abramoff', 'Michael', ''], ['Wu', 'Xiaodong', '']]","['Optical Coherence Tomography (OCT)', 'deep learning', 'Convolution Neural Networks (CNNs)', 'multiple surface segmentation']"
1011,1306.1301,Joyeeta Singha,Joyeeta Singha and Karen Das,Recognition of Indian Sign Language in Live Video,"6 pages, 5 figures","International Journal of Computer Applications 70(19):17-22, May
  2013",10.5120/12174-7306,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sign Language Recognition has emerged as one of the important area of
research in Computer Vision. The difficulty faced by the researchers is that
the instances of signs vary with both motion and appearance. Thus, in this
paper a novel approach for recognizing various alphabets of Indian Sign
Language is proposed where continuous video sequences of the signs have been
considered. The proposed system comprises of three stages: Preprocessing stage,
Feature Extraction and Classification. Preprocessing stage includes skin
filtering, histogram matching. Eigen values and Eigen Vectors were considered
for feature extraction stage and finally Eigen value weighted Euclidean
distance is used to recognize the sign. It deals with bare hands, thus allowing
the user to interact with the system in natural way. We have considered 24
different alphabets in the video sequences and attained a success rate of
96.25%.
","[{'version': 'v1', 'created': 'Thu, 6 Jun 2013 05:40:06 GMT'}]",2013-06-07,"[['Singha', 'Joyeeta', ''], ['Das', 'Karen', '']]","['Indian Sign Language (ISL)', 'Skin Filtering', 'Eigen value', 'Eigen vector', 'Euclidean Distance (ED)', 'Computer Vision']"
1012,1701.00117,Ivan Svogor,Ivan \v{S}vogor,"An initial performance review of software components for a heterogeneous
  computing platform",,,10.1145/2797433.2797449,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The design of embedded systems is a complex activity that involves a lot of
decisions. With high performance demands of present day usage scenarios and
software, they often involve energy hungry state-of-the-art computing units.
While focusing on power consumption of computing units, the physical properties
of software are often ignored. Recently, there has been a growing interest to
quantify and model the physical footprint of software (e.g. consumed power,
generated heat, execution time, etc.), and a component based approach
facilitates methods for describing such properties. Based on these, software
architects can make energy-efficient software design solutions. This paper
presents power consumption and execution time profiling of a component software
that can be allocated on heterogeneous computing units (CPU, GPU, FPGA) of a
tracked robot.
","[{'version': 'v1', 'created': 'Sat, 31 Dec 2016 14:58:23 GMT'}]",2017-01-03,"[['Švogor', 'Ivan', '']]","['software', 'component-based', 'software profiling', 'power consumption', 'GPU', 'CPU', 'FPGA']"
1013,1512.00228,Yunior Ram\'irez-Cruz,"Henry Rosales-M\'endez, Yunior Ram\'irez-Cruz","MOCICE-BCubed F$_1$: A New Evaluation Measure for Biclustering
  Algorithms",,Pattern Recognition Letters 84 (2016) 142-148,10.1016/j.patrec.2016.09.002,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The validation of biclustering algorithms remains a challenging task, even
though a number of measures have been proposed for evaluating the quality of
these algorithms. Although no criterion is universally accepted as the overall
best, a number of meta-evaluation conditions to be satisfied by biclustering
algorithms have been enunciated. In this work, we present MOCICE-BCubed F$_1$,
a new external measure for evaluating biclusterings, in the scenario where gold
standard annotations are available for both the object clusters and the
associated feature subspaces. Our proposal relies on the so-called
micro-objects transformation and satisfies the most comprehensive set of
meta-evaluation conditions so far enunciated for biclusterings. Additionally,
the proposed measure adequately handles the occurrence of overlapping in both
the object and feature spaces. Moreover, when used for evaluating traditional
clusterings, which are viewed as a particular case of biclustering, the
proposed measure also satisfies the most comprehensive set of meta-evaluation
conditions so far enunciated for this task.
","[{'version': 'v1', 'created': 'Tue, 1 Dec 2015 11:26:50 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Jan 2016 11:35:22 GMT'}]",2017-04-21,"[['Rosales-Méndez', 'Henry', ''], ['Ramírez-Cruz', 'Yunior', '']]","['Clustering algorithm evaluation', 'External measures', 'Biclustering']"
1014,1811.02194,Fei Yang,"Fei Yang, Qian Zhang, Chi Zheng, and Guoping Qiu",In-the-wild Facial Expression Recognition in Extreme Poses,Published on ICGIP2017,,10.1117/12.2302626,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the computer research area, facial expression recognition is a hot
research problem. Recent years, the research has moved from the lab environment
to in-the-wild circumstances. It is challenging, especially under extreme
poses. But current expression detection systems are trying to avoid the pose
effects and gain the general applicable ability. In this work, we solve the
problem in the opposite approach. We consider the head poses and detect the
expressions within special head poses. Our work includes two parts: detect the
head pose and group it into one pre-defined head pose class; do facial
expression recognize within each pose class. Our experiments show that the
recognition results with pose class grouping are much better than that of
direct recognition without considering poses. We combine the hand-crafted
features, SIFT, LBP and geometric feature, with deep learning feature as the
representation of the expressions. The handcrafted features are added into the
deep learning framework along with the high level deep learning features. As a
comparison, we implement SVM and random forest to as the prediction models. To
train and test our methodology, we labeled the face dataset with 6 basic
expressions.
","[{'version': 'v1', 'created': 'Tue, 6 Nov 2018 07:02:14 GMT'}]",2018-11-07,"[['Yang', 'Fei', ''], ['Zhang', 'Qian', ''], ['Zheng', 'Chi', ''], ['Qiu', 'Guoping', '']]","['Facial expression', 'deep learning', 'Caffe', 'head pose', 'SIFT', 'LBP', 'SVM', 'random forest']"
1015,1806.07884,Zuzana Majdisova,Zuzana Majdisova and Vaclav Skala,"Big Geo Data Surface Approximation using Radial Basis Functions: A
  Comparative Study",arXiv admin note: text overlap with arXiv:1806.04243,"Computers and Geosciences, Vol.109, pp.51-58, ISSN 0098-3004,
  Elsevier, December 2017",10.1016/j.cageo.2017.08.007,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Approximation of scattered data is often a task in many engineering problems.
The Radial Basis Function (RBF) approximation is appropriate for big scattered
datasets in $n-$dimensional space. It is a non-separable approximation, as it
is based on the distance between two points. This method leads to the solution
of an overdetermined linear system of equations.
  In this paper the RBF approximation methods are briefly described, a new
approach to the RBF approximation of big datasets is presented, and a
comparison for different Compactly Supported RBFs (CS-RBFs) is made with
respect to the accuracy of the computation. The proposed approach uses symmetry
of a matrix, partitioning the matrix into blocks and data structures for
storage of the sparse matrix. The experiments are performed for synthetic and
real datasets.
","[{'version': 'v1', 'created': 'Wed, 20 Jun 2018 13:13:41 GMT'}]",2018-06-22,"[['Majdisova', 'Zuzana', ''], ['Skala', 'Vaclav', '']]","['Radial basis functions', 'CS-RBF', 'Approximation', 'Wendland’s RBF', 'Big data', 'Point clouds']"
1016,1303.1635,Nastooh Taheri Javan,"Hassanali Nasehi, Nastooh Taheri Javan, Amir Bagheri Aghababa and
  Yasna Ghanbari Birgani",Improving Energy Efficiency in MANETs by Multi-Path Routing,,"International Journal of Wireless & Mobile Networks (IJWMN) Vol.
  5, No. 1, February 2013",10.5121/ijwmn.2013.5113,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Some multi-path routing algorithm in MANET, simultaneously send information
to the destination through several directions to reduce end-to-end delay. In
all these algorithms, the sent traffic through a path affects the adjacent path
and unintentionally increases the delay due to the use of adjacent paths.
Because, there are repetitive competitions among neighboring nodes, in order to
obtain the joint channel in adjacent paths. The represented algorithm in this
study tries to discover the distinct paths between source and destination nodes
with using Omni directional antennas, to send information through these
simultaneously. For this purpose, the number of active neighbors is counted in
each direction with using a strategy. These criterions are effectively used to
select routes. Proposed algorithm is based on AODV routing algorithm, and in
the end it is compared with AOMDV, AODVM, and IZM-DSR algorithms which are
multi-path routing algorithms based on AODV and DSR. Simulation results show
that using the proposed algorithm creates a significant improvement in energy
efficiency and reducing end-to-end delay.
","[{'version': 'v1', 'created': 'Thu, 7 Mar 2013 10:03:37 GMT'}]",2013-03-08,"[['Nasehi', 'Hassanali', ''], ['Javan', 'Nastooh Taheri', ''], ['Aghababa', 'Amir Bagheri', ''], ['Birgani', 'Yasna Ghanbari', '']]","['MANET', 'Multi-path Routing', 'Energy Efficiency']"
1017,1807.03731,Nabil Simaan,"Nabil Simaan, Rashid M. Yasin, Long Wang","Medical Technologies and Challenges of Robot Assisted Minimally Invasive
  Intervention and Diagnostics",,"Annual Review of Control, Robotics, and Autonomous Systems, Vol.
  1:465-490, 2018",10.1146/annurev-control-060117-104956,,cs.RO,http://creativecommons.org/licenses/by-sa/4.0/,"  Emerging paradigms furthering the reach of medical technology deeper into
human anatomy present unique modeling, control and sensing problems. This paper
discusses a brief history of medical robotics leading to the current trend of
minimally invasive intervention and diagnostics in confined spaces. Robotics
for natural orifice and single port access surgery, capsule and magnetically
actuated robotics and microrobotics are discussed with the aim of elucidating
the state of the art. Works on modeling, sensing and control of mechanical
architectures of robots for natural orifice and single port access surgery are
discussed, followed by a presentation of works on magnetic actuation, sensing
and localization for capsule robotics and microrobotics. Finally challenges and
open problems in each one of these areas are presented.
","[{'version': 'v1', 'created': 'Tue, 10 Jul 2018 16:06:38 GMT'}]",2018-07-11,"[['Simaan', 'Nabil', ''], ['Yasin', 'Rashid M.', ''], ['Wang', 'Long', '']]","['surgical robotics', 'natural orifice surgery', 'microrobots', 'capsule robots', 'continuum robots']"
1018,1304.5110,Pablo Dorta-Gonzalez,Pablo Dorta-Gonzalez and Maria Isabel Dorta-Gonzalez,"Central indexes to the citation distribution: A complement to the
  h-index","23 pages, 3 tables and 6 figures","Scientometrics 88(3), 729-745 (2011)",10.1007/s11192-011-0453-3,,cs.DL physics.soc-ph stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The citation distribution of a researcher shows the impact of their
production and determines the success of their scientific career. However, its
application in scientific evaluation is difficult due to the bi-dimensional
character of the distribution. Some bibliometric indexes that try to synthesize
in a numerical value the principal characteristics of this distribution have
been proposed recently. In contrast with other bibliometric measures, the
biases that the distribution tails provoke, are reduced by the h-index.
However, some limitations in the discrimination among researchers with
different publication habits are presented in this index. This index penalizes
selective researchers, distinguished by the large number of citations received,
as compared to large producers. In this work, two original sets of indexes, the
central area indexes and the central interval indexes, that complement the
h-index to include the central shape of the citation distribution, are proposed
and compared.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2013 12:45:52 GMT'}]",2013-04-19,"[['Dorta-Gonzalez', 'Pablo', ''], ['Dorta-Gonzalez', 'Maria Isabel', '']]","['h-index', 'Citation analysis', 'Bibliometric indexes', 'Research career evaluation']"
1019,1807.02200,Sergio Oramas,"Sergio Oramas, Luis Espinosa-Anke, Francisco G\'omez, Xavier Serra",Natural Language Processing for Music Knowledge Discovery,,Journal of New Music Research (2018),10.1080/09298215.2018.1488878,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today, a massive amount of musical knowledge is stored in written form, with
testimonies dated as far back as several centuries ago. In this work, we
present different Natural Language Processing (NLP) approaches to harness the
potential of these text collections for automatic music knowledge discovery,
covering different phases in a prototypical NLP pipeline, namely corpus
compilation, text-mining, information extraction, knowledge graph generation
and sentiment analysis. Each of these approaches is presented alongside
different use cases (i.e., flamenco, Renaissance and popular music) where large
collections of documents are processed, and conclusions stemming from
data-driven analyses are presented and discussed.
","[{'version': 'v1', 'created': 'Fri, 6 Jul 2018 00:07:27 GMT'}]",2018-07-09,"[['Oramas', 'Sergio', ''], ['Espinosa-Anke', 'Luis', ''], ['Gómez', 'Francisco', ''], ['Serra', 'Xavier', '']]","['Musicology', 'Natural Language Processing', 'Information Extraction', 'Entity Linking', 'Sentiment Analysis']"
1020,2210.10561,Philipp Richter,Philipp Richter and Oliver Gasser and Arthur Berger,Illuminating Large-Scale IPv6 Scanning in the Internet,,"in Proceedings of the ACM Internet Measurement Conference (IMC),
  2022",10.1145/3517745.3561452,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While scans of the IPv4 space are ubiquitous, today little is known about
scanning activity in the IPv6 Internet. In this work, we present a longitudinal
and detailed empirical study on large-scale IPv6 scanning behavior in the
Internet, based on firewall logs captured at some 230,000 hosts of a major
Content Distribution Network (CDN). We develop methods to identify IPv6 scans,
assess current and past levels of IPv6 scanning activity, and study dominant
characteristics of scans, including scanner origins, targeted services, and
insights on how scanners find target IPv6 addresses. Where possible, we compare
our findings to what can be assessed from publicly available traces. Our work
identifies and highlights new challenges to detect scanning activity in the
IPv6 Internet, and uncovers that today's scans of the IPv6 space show widely
different characteristics when compared to the more well-known IPv4 scans.
","[{'version': 'v1', 'created': 'Wed, 19 Oct 2022 14:00:59 GMT'}]",2022-10-20,"[['Richter', 'Philipp', ''], ['Gasser', 'Oliver', ''], ['Berger', 'Arthur', '']]","['IPv6 scanning', 'Internet scanning', 'Internet security', 'network telescope', 'unsolicited traffic']"
1021,1809.00650,Christoph Matthies,"Christoph Matthies, Thomas Kowark, Keven Richly, Matthias Uflacker,
  Hasso Plattner","How Surveys, Tutors, and Software Help to Assess Scrum Adoption in a
  Classroom Software Engineering Project",,"Proceedings of the 38th International Conference on Software
  Engineering Companion (ICSE'16). 2016, ACM, New York, NY, USA, 313-322",10.1145/2889160.2889182,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Agile methods are best taught in a hands-on fashion in realistic projects.
The main challenge in doing so is to assess whether students apply the methods
correctly without requiring complete supervision throughout the entire project.
This paper presents experiences from a classroom project where 38 students
developed a single system using a scaled version of Scrum. Surveys helped us to
identify which elements of Scrum correlated most with student satisfaction or
posed the biggest challenges. These insights were augmented by a team of
tutors, which accompanied main meetings throughout the project to provide
feedback to the teams, and captured impressions of method application in
practice. Finally, we performed a post-hoc, tool-supported analysis of
collaboration artifacts to detect concrete indicators for anti-patterns in
Scrum adoption. Through the combination of these techniques we were able to
understand how students implemented Scrum in this course and which elements
require further lecturing and tutoring in future iterations. Automated analysis
of collaboration artifacts proved to be a promising addition to the development
process that could potentially reduce manual efforts in future courses and
allow for more concrete and targeted feedback, as well as more objective
assessment.
","[{'version': 'v1', 'created': 'Mon, 3 Sep 2018 16:42:49 GMT'}]",2018-09-05,"[['Matthies', 'Christoph', ''], ['Kowark', 'Thomas', ''], ['Richly', 'Keven', ''], ['Uflacker', 'Matthias', ''], ['Plattner', 'Hasso', '']]","['Classroom project', 'Scrum', 'multi-level assessment', 'collaboration analysis']"
1022,2001.05254,Alejandro Corti\~nas,"Jos\'e Miguel Horcas Aguilera, Alejandro Corti\~nas, Lidia Fuentes,
  Miguel R. Luaces","Integrating the Common Variability Language with Multilanguage
  Annotations for Web Engineering","This research has received funding from the European Union's Horizon
  2020 research and innovation programme under the Marie Sk{\l}odowska-Curie
  Actions H2020-MSCA-RISE-2015 BIRDS GA No. 690941","Proc. of the 22st International Systems & Software Product Line
  Conference (SPLC 2018) vol.1, ACM Digital Library, Gothenburg (Sweden), 2018,
  pp. 196-207",10.1145/3233027.3233049,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web applications development involves managing a high diversity of files and
resources like code, pages or style sheets, implemented in different languages.
To deal with the automatic generation of custom-made configurations of web
applications, industry usually adopts annotation-based approaches despite the
majority of studies encourage the use of composition-based approaches to
implement Software Product Lines. Recent work tries to combine both approaches
to get the complementary benefits. However, technological companies are
reticent to adopt new development paradigms such as feature-oriented
programming or aspect-oriented programming. Moreover, it is extremely
difficult, or even impossible, to apply these programming models to web
applications, mainly because of their multilingual nature, since their
development involves multiple types of source code (Java, Groovy, JavaScript),
templates (HTML, Markdown, XML), style sheet files (CSS and its variants, such
as SCSS), and other files (JSON, YML, shell scripts). We propose to use the
Common Variability Language as a composition-based approach and integrate
annotations to manage fine grained variability of a Software Product Line for
web applications. In this paper, we (i) show that existing composition and
annotation-based approaches, including some well-known combinations, are not
appropriate to model and implement the variability of web applications; and
(ii) present a combined approach that effectively integrates annotations into a
composition-based approach for web applications. We implement our approach and
show its applicability with an industrial real-world system.
","[{'version': 'v1', 'created': 'Wed, 15 Jan 2020 11:54:40 GMT'}]",2020-01-16,"[['Aguilera', 'José Miguel Horcas', ''], ['Cortiñas', 'Alejandro', ''], ['Fuentes', 'Lidia', ''], ['Luaces', 'Miguel R.', '']]","['Automation', 'annotations', 'composition', 'CVL', 'SPL', 'variability', 'webengineering']"
1023,1903.00757,Zhaocheng Zhu,"Zhaocheng Zhu, Shizhen Xu, Meng Qu, Jian Tang",GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding,accepted at WWW 2019,,10.1145/3308558.3313508,,cs.LG cs.DC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning continuous representations of nodes is attracting growing interest
in both academia and industry recently, due to their simplicity and
effectiveness in a variety of applications. Most of existing node embedding
algorithms and systems are capable of processing networks with hundreds of
thousands or a few millions of nodes. However, how to scale them to networks
that have tens of millions or even hundreds of millions of nodes remains a
challenging problem. In this paper, we propose GraphVite, a high-performance
CPU-GPU hybrid system for training node embeddings, by co-optimizing the
algorithm and the system. On the CPU end, augmented edge samples are parallelly
generated by random walks in an online fashion on the network, and serve as the
training data. On the GPU end, a novel parallel negative sampling is proposed
to leverage multiple GPUs to train node embeddings simultaneously, without much
data transfer and synchronization. Moreover, an efficient collaboration
strategy is proposed to further reduce the synchronization cost between CPUs
and GPUs. Experiments on multiple real-world networks show that GraphVite is
super efficient. It takes only about one minute for a network with 1 million
nodes and 5 million edges on a single machine with 4 GPUs, and takes around 20
hours for a network with 66 million nodes and 1.8 billion edges. Compared to
the current fastest system, GraphVite is about 50 times faster without any
sacrifice on performance.
","[{'version': 'v1', 'created': 'Sat, 2 Mar 2019 20:06:58 GMT'}]",2019-03-05,"[['Zhu', 'Zhaocheng', ''], ['Xu', 'Shizhen', ''], ['Qu', 'Meng', ''], ['Tang', 'Jian', '']]","['Unsupervised node embedding', 'parallel processing', 'scalability', 'graphics processing unit']"
1024,1611.08327,S\'ergio Waitman,"S\'ergio Waitman, Laurent Bako, Paolo Massioni, G\'erard Scorletti,
  Vincent Fromion","Incremental stability of Lur'e systems through piecewise-affine
  approximations",,,10.1016/j.ifacol.2017.08.491,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lur'e-type nonlinear systems are virtually ubiquitous in applied control
theory, which explains the great interest they have attracted throughout the
years. The purpose of this paper is to propose conditions to assess incremental
asymptotic stability of Lur'e systems that are less conservative than those
obtained with the incremental circle criterion. The method is based on the
approximation of the nonlinearity by a piecewise-affine function. The Lur'e
system can then be rewritten as a so-called piecewise-affine Lur'e system, for
which sufficient conditions for asymptotic incremental stability are provided.
These conditions are expressed as linear matrix inequalities (LMIs) allowing
the construction of a continuous piecewise-quadratic incremental Lyapunov
function, which can be efficiently solved numerically. The results are
illustrated with numerical examples.
","[{'version': 'v1', 'created': 'Fri, 25 Nov 2016 00:13:40 GMT'}]",2017-10-27,"[['Waitman', 'Sérgio', ''], ['Bako', 'Laurent', ''], ['Massioni', 'Paolo', ''], ['Scorletti', 'Gérard', ''], ['Fromion', 'Vincent', '']]","['incremental stability', 'Lur’e systems', 'incremental circle criterion', 'piecewise-affinesystems', 'piecewise-affine approximation', 'Lyapunov methods']"
1025,0812.3648,Mehdi Bahrami,Mehdi Bahrami,A New Method for Knowledge Representation in Expert System's (XMLKR),IEEE Procceding 2008,"Emerging Trends in Engineering and Technology, 2008. ICETET '08.
  First International Conference, IEEE",10.1109/ICETET.2008.194,,cs.DC cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge representation it is an essential section of a Expert Systems,
Because in this section we have a framework to establish an expert system then
we can modeling and use by this to design an expert system. Many method it is
exist for knowledge representation but each method have problems, in this paper
we introduce a new method of object oriented by XML language as XMLKR to
knowledge representation, and we want to discuss advantage and disadvantage of
this method.
","[{'version': 'v1', 'created': 'Thu, 18 Dec 2008 20:39:48 GMT'}]",2016-11-17,"[['Bahrami', 'Mehdi', '']]","['Knowledge Representation', 'Expert System', 'XML']"
1026,1912.06552,Daniel Heestermans Svendsen,"Daniel Heestermans Svendsen, Luca Martino, Gustau Camps-Valls","Active emulation of computer codes with Gaussian processes --
  Application to remote sensing","Keywords: Active learning; Gaussian process; Emulation; Design of
  experiments; Computer code; Remote sensing; Radiative transfer model",Pattern Recognition (2019): 107103,10.1016/j.patcog.2019.107103,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many fields of science and engineering rely on running simulations with
complex and computationally expensive models to understand the involved
processes in the system of interest. Nevertheless, the high cost involved
hamper reliable and exhaustive simulations. Very often such codes incorporate
heuristics that ironically make them less tractable and transparent. This paper
introduces an active learning methodology for adaptively constructing surrogate
models, i.e. emulators, of such costly computer codes in a multi-output
setting. The proposed technique is sequential and adaptive, and is based on the
optimization of a suitable acquisition function. It aims to achieve accurate
approximations, model tractability, as well as compact and expressive simulated
datasets. In order to achieve this, the proposed Active Multi-Output Gaussian
Process Emulator (AMOGAPE) combines the predictive capacity of Gaussian
Processes (GPs) with the design of an acquisition function that favors sampling
in low density and fluctuating regions of the approximation functions.
Comparing different acquisition functions, we illustrate the promising
performance of the method for the construction of emulators with toy examples,
as well as for a widely used remote sensing transfer code.
","[{'version': 'v1', 'created': 'Fri, 13 Dec 2019 15:16:13 GMT'}]",2019-12-16,"[['Svendsen', 'Daniel Heestermans', ''], ['Martino', 'Luca', ''], ['Camps-Valls', 'Gustau', '']]","['Active learning', 'Gaussian process', 'emulation', 'design of experiments', 'computer code', 'remote sensing', 'radiative transfer model']"
1027,1806.00528,Giovanni Bacci,Giovanni Bacci and Giorgio Bacci and Kim G. Larsen and Radu Mardare,On the Metric-based Approximate Minimization of Markov Chains,"This article in an extended and revised version of a paper accepted
  for publication at ICALP 2017",,10.1016/j.jlamp.2018.05.006,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we address the approximate minimization problem of Markov
Chains (MCs) from a behavioral metric-based perspective. Specifically, given a
finite MC and a positive integer k, we are looking for an MC with at most k
states having minimal distance to the original. The metric considered in this
work is the bisimilarity distance of Desharnais et al.. For this metric we show
that (1) optimal approximations always exist; (2) the problem has a bilinear
program characterization; and (3) prove that its threshold problem is in PSPACE
and NP-hard. In addition to the bilinear program solution, we present an
approach inspired by expectation maximization techniques for computing
suboptimal solutions to the problem. Experiments suggest that our method gives
a practical approach that outperforms the bilinear program implementation run
on state-of-the-art bilinear solvers.
","[{'version': 'v1', 'created': 'Wed, 30 May 2018 13:09:33 GMT'}]",2018-06-07,"[['Bacci', 'Giovanni', ''], ['Bacci', 'Giorgio', ''], ['Larsen', 'Kim G.', ''], ['Mardare', 'Radu', '']]","['Behavioral Distances', 'Probabilistic Models', 'Automata Minimization']"
1028,2206.03216,Margaret Mitchell,"Yacine Jernite, Huu Nguyen, Stella Biderman, Anna Rogers, Maraim
  Masoud, Valentin Danchev, Samson Tan, Alexandra Sasha Luccioni, Nishant
  Subramani, G\'erard Dupont, Jesse Dodge, Kyle Lo, Zeerak Talat, Isaac
  Johnson, Dragomir Radev, Somaieh Nikpoor, J\""org Frohberg, Aaron Gokaslan,
  Peter Henderson, Rishi Bommasani, Margaret Mitchell","Data Governance in the Age of Large-Scale Data-Driven Language
  Technology","32 pages: Full paper and Appendices; Association for Computing
  Machinery, New York, NY, USA, 2206-2222","Proceedings of 2022 ACM Conference on Fairness, Accountability,
  and Transparency (FAccT '22)",10.1145/3531146.3534637,,cs.CY cs.AI cs.CL,http://creativecommons.org/licenses/by/4.0/,"  The recent emergence and adoption of Machine Learning technology, and
specifically of Large Language Models, has drawn attention to the need for
systematic and transparent management of language data. This work proposes an
approach to global language data governance that attempts to organize data
management amongst stakeholders, values, and rights. Our proposal is informed
by prior work on distributed governance that accounts for human values and
grounded by an international research collaboration that brings together
researchers and practitioners from 60 countries. The framework we present is a
multi-party international governance structure focused on language data, and
incorporating technical and organizational tools needed to support its work.
","[{'version': 'v1', 'created': 'Wed, 4 May 2022 00:44:35 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Nov 2022 21:18:30 GMT'}]",2022-11-04,"[['Jernite', 'Yacine', ''], ['Nguyen', 'Huu', ''], ['Biderman', 'Stella', ''], ['Rogers', 'Anna', ''], ['Masoud', 'Maraim', ''], ['Danchev', 'Valentin', ''], ['Tan', 'Samson', ''], ['Luccioni', 'Alexandra Sasha', ''], ['Subramani', 'Nishant', ''], ['Dupont', 'Gérard', ''], ['Dodge', 'Jesse', ''], ['Lo', 'Kyle', ''], ['Talat', 'Zeerak', ''], ['Johnson', 'Isaac', ''], ['Radev', 'Dragomir', ''], ['Nikpoor', 'Somaieh', ''], ['Frohberg', 'Jörg', ''], ['Gokaslan', 'Aaron', ''], ['Henderson', 'Peter', ''], ['Bommasani', 'Rishi', ''], ['Mitchell', 'Margaret', '']]","['datasets', 'technology governance', 'data rights', 'language data']"
1029,1704.07078,Yunior Ram\'irez-Cruz,"Sjouke Mauw, Yunior Ram\'irez-Cruz, Rolando Trujillo-Rasua","Rethinking $(k,\ell)$-anonymity in social graphs: $(k,\ell)$-adjacency
  anonymity and $(k,\ell)$-(adjacency) anonymous transformations",,"""Conditional adjacency anonymity in social graphs under active
  attacks"", Knowledge and Information Systems 61(1):485-511, 2019",10.1007/s10115-018-1283-x,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper treats the privacy-preserving publication of social graphs in the
presence of active adversaries, that is, adversaries with the ability to
introduce sybil nodes in the graph prior to publication and leverage them to
create unique fingerprints for a set of victim nodes and re-identify them after
publication. Stemming from the notion of $(k,\ell)$-anonymity, we introduce
$(k,\ell)$-anonymous transformations, characterising graph perturbation methods
that ensure protection from active adversaries levaraging up to $\ell$ sybil
nodes. Additionally, we introduce a new privacy property: $(k,\ell)$-adjacency
anonymity, which relaxes the assumption made by $(k,\ell)$-anonymity that
adversaries can control all distances between sybil nodes and the rest of the
nodes in the graph. The new privacy property is in turn the basis for a new
type of graph perturbation: $(k,\ell)$-adjacency anonymous transformations. We
propose algorithms for obtaining $(k,1)$-adjacency anonymous transformations
for arbitrary values of $k$, as well as $(2,\ell)$-adjacency anonymous
transformations for small values of $\ell$.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 08:14:03 GMT'}]",2019-09-04,"[['Mauw', 'Sjouke', ''], ['Ramírez-Cruz', 'Yunior', ''], ['Trujillo-Rasua', 'Rolando', '']]","['social graphs', 'privacy-preserving publication', 'active adversaries', 'perturbation methods']"
1030,1606.06812,Dong Hao,"Ratha Pech, Dong Hao, Liming Pan, Hong Cheng and Tao Zhou",Link Prediction via Matrix Completion,,,10.1209/0295-5075/117/38002,,cs.SI cs.LG physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Inspired by practical importance of social networks, economic networks,
biological networks and so on, studies on large and complex networks have
attracted a surge of attentions in the recent years. Link prediction is a
fundamental issue to understand the mechanisms by which new links are added to
the networks. We introduce the method of robust principal component analysis
(robust PCA) into link prediction, and estimate the missing entries of the
adjacency matrix. On one hand, our algorithm is based on the sparsity and low
rank property of the matrix, on the other hand, it also performs very well when
the network is dense. This is because a relatively dense real network is also
sparse in comparison to the complete graph. According to extensive experiments
on real networks from disparate fields, when the target network is connected
and sufficiently dense, whatever it is weighted or unweighted, our method is
demonstrated to be very effective and with prediction accuracy being
considerably improved comparing with many state-of-the-art algorithms.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2016 03:55:38 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Jun 2016 02:58:40 GMT'}]",2017-04-05,"[['Pech', 'Ratha', ''], ['Hao', 'Dong', ''], ['Pan', 'Liming', ''], ['Cheng', 'Hong', ''], ['Zhou', 'Tao', '']]","['Link prediction', 'matrix completion', 'local similarity', 'community structure']"
1031,1812.05596,"Daniel Sch\""ollhammer","D. Sch\""ollhammer, T.P. Fries",Reissner-Mindlin shell theory based on tangential differential calculus,"Submitted to Computer Methods in Applied Mechanics and Engineering
  V1: Initial submission. V2: Revised version. arXiv admin note: text overlap
  with arXiv:1805.11978",,10.1016/j.cma.2019.04.018,,cs.NA cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The linear Reissner-Mindlin shell theory is reformulated in the frame of the
tangential differential calculus (TDC) using a global Cartesian coordinate
system. The rotation of the normal vector is modelled with a difference vector
approach. The resulting equations are applicable to both explicitly and
implicitly defined shells, because the employed surface operators do not
necessarily rely on a parametrization. Hence, shell analysis on surfaces
implied by level-set functions is enabled, but also the classical case of
parametrized surfaces is captured. As a consequence, the proposed TDC-based
formulation is more general and may also be used in recent finite element
approaches such as the TraceFEM and CutFEM where a parametrization of the
middle surface is not required. Herein, the numerical results are obtained by
isogeometric analysis using NURBS as trial and test functions for classical and
new benchmark tests. In the residual errors, optimal higher-order convergence
rates are confirmed when the involved physical fields are sufficiently smooth.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2018 20:32:03 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Apr 2019 09:16:59 GMT'}]",2019-05-22,"[['Schöllhammer', 'D.', ''], ['Fries', 'T. P.', '']]","['Shells', 'Tangential Differential Calculus', 'Isogeometric analysis', 'Man']"
1032,1803.06140,Christopher Spinrath,"Christof L\""oding (1) and Christopher Spinrath (2) ((1) RWTH Aachen
  University, (2) TU Dortmund University)","Decision Problems for Subclasses of Rational Relations over Finite and
  Infinite Words","v1: 31 pages, submitted to DMTCS, extended version of the paper with
  the same title published in the conference proceedings of FCT 2017; v2: 32
  pages, minor revision of v1 (DMTCS review process), results unchanged; v3: 32
  pages, enabled hyperref for Figure 1; v4: 32 pages, add reference for known
  complexity results for the slenderness problem; v5: 32 pages, added DMTCS
  metadata","Discrete Mathematics & Theoretical Computer Science, Vol. 21 no. 3
  , Automata, Logic and Semantics (January 31, 2019) dmtcs:5141",10.23638/DMTCS-21-3-4,,cs.FL,http://creativecommons.org/licenses/by/4.0/,"  We consider decision problems for relations over finite and infinite words
defined by finite automata. We prove that the equivalence problem for binary
deterministic rational relations over infinite words is undecidable in contrast
to the case of finite words, where the problem is decidable. Furthermore, we
show that it is decidable in doubly exponential time for an automatic relation
over infinite words whether it is a recognizable relation. We also revisit this
problem in the context of finite words and improve the complexity of the
decision procedure to single exponential time. The procedure is based on a
polynomial time regularity test for deterministic visibly pushdown automata,
which is a result of independent interest.
","[{'version': 'v1', 'created': 'Fri, 16 Mar 2018 10:05:29 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Dec 2018 16:54:01 GMT'}, {'version': 'v3', 'created': 'Fri, 14 Dec 2018 18:52:20 GMT'}, {'version': 'v4', 'created': 'Thu, 10 Jan 2019 16:30:13 GMT'}, {'version': 'v5', 'created': 'Tue, 29 Jan 2019 10:18:41 GMT'}]",2019-11-20,"[['Löding', 'Christof', ''], ['Spinrath', 'Christopher', '']]","['rational relations', 'automatic relations', 'omega-automata', 'finite transducers', 'visibly pushdown automata']"
1033,1711.00760,Sohaib Bajwa Mr.,"Sohaib Shahid Bajwa, Xiaofeng Wang, Anh Nguven Duc, Pekka Abrahamsson","How Do Software Startups Pivot? Empirical Results from a Multiple Case
  Study","Conference publication, International Conference on Software Business
  (ICSOB'16), Slovenia","In: Maglyas A., Lamprecht AL. (eds) Software Business. Lecture
  Notes in Business Information Processing, vol 240. Springer, Cham (2016)",10.1007/978-3-319-40515-5_14,,cs.CY cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to handle intense time pressure and survive in dynamic market,
software startups have to make crucial decisions constantly on whether to
change directions or stay on chosen courses, or in the terms of Lean Startup,
to pivot or to persevere. The existing research and knowledge on software
startup pivots are very limited. In this study, we focused on understanding the
pivoting processes of software startups, and identified the triggering factors
and pivot types. To achieve this, we employed a multiple case study approach,
and analyzed the data obtained from four software startups. The initial
findings show that different software startups make different types of pivots
related to business and technology during their product development life cycle.
The pivots are triggered by various factors including negative customer
feedback.
","[{'version': 'v1', 'created': 'Sun, 29 Oct 2017 17:52:35 GMT'}]",2017-11-03,"[['Bajwa', 'Sohaib Shahid', ''], ['Wang', 'Xiaofeng', ''], ['Duc', 'Anh Nguven', ''], ['Abrahamsson', 'Pekka', '']]","['Software Startup', 'Lean Startup', 'Pivot', 'Validated Learning']"
1034,1403.2541,Kieran Greer Dr,Kieran Greer,"Turing: Then, Now and Still Key",Published,"'Artificial Intelligence, Evolutionary Computation and
  Metaheuristics (AIECM) - Turing 2012', Eds. X-S. Yang, Studies in
  Computational Intelligence, 2013, Vol. 427/2013, pp. 43-62, Springer-Verlag
  Berlin Heidelberg",10.1007/978-3-642-29694-9_3,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper looks at Turing's postulations about Artificial Intelligence in
his paper 'Computing Machinery and Intelligence', published in 1950. It notes
how accurate they were and how relevant they still are today. This paper notes
the arguments and mechanisms that he suggested and tries to expand on them
further. The paper however is mostly about describing the essential ingredients
for building an intelligent model and the problems related with that. The
discussion includes recent work by the author himself, who adds his own
thoughts on the matter that come from a purely technical investigation into the
problem. These are personal and quite speculative, but provide an interesting
insight into the mechanisms that might be used for building an intelligent
system.
","[{'version': 'v1', 'created': 'Tue, 11 Mar 2014 11:38:23 GMT'}]",2014-03-12,"[['Greer', 'Kieran', '']]","['Artificial Intelligence', 'Intelligence Modelling', 'Alan Turing']"
1035,1704.06371,Abeer Eshra,"Abeer Eshra, Shalin Shah and John Reif",DNA Hairpin Gate: A Renewable DNA Seesaw Motif Using Hairpins,,"IEEE Transactions on Nanotechnology, Jan, 2019",10.1109/TNANO.2019.2896189,,cs.ET,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In 2011 the DNA seesaw gate motif was introduced. It is a powerful
feed-forward DNA nanodevice that can perform digital logic computations. The
landmark of that work managed to evaluate moderately large Boolean circuits by
cascading multiple DNA seesaw gates. Although the design is robust in solution
and scalable, it is designed for one time use and is not reusable. This
prevents pursuing important applications such as feedback and sequential
digital circuits. We present a novel design for DNA nanodevices that can
perform digital logic computations and are furthermore renewable. First, we
modified the prior DNA seesaw gate motif into a hairpin. We call the resulting
motif a DNA hairpin-seesaw gate. We show the feed-forward digital computation
reaction imitates the seesaw gate motif. Second, we added a reporting phase
that provides increased scalability to our device. Third, we designed input and
fuel extracting hairpins that when added, initiate a renewing process. This
results in a renewed functional gate, in its original configuration, which is
able to make a new logical computation with new inputs. Finally, we introduced
a renewable two-input Boolean logic OR gate. After calculating the output of a
certain input set, the circuit is restored and a new set of inputs is
introduced to compute the new output. We provide experimental fluorescent data
on three repeated rounds of executions of our hairpin gate motif and its
restoration, indicating gradual loss of response. Finally, we calculated rate
constants of our experimental data by fitting it to a second order reaction
model using maximum likelihood estimation method.
","[{'version': 'v1', 'created': 'Fri, 21 Apr 2017 00:36:22 GMT'}]",2019-02-05,"[['Eshra', 'Abeer', ''], ['Shah', 'Shalin', ''], ['Reif', 'John', '']]","['DNA', 'nanotechnology', 'seesaw', 'DNA logic gates', 'toehold exchange stranddisplacement', 'hairpin', 'renewable']"
1036,1312.0976,Scott A. Hale,Scott A. Hale,Multilinguals and Wikipedia Editing,,"Proceedings of the 6th Annual ACM Web Science Conference, WebSci
  2014, ACM",10.1145/2615569.2615684,,cs.CY cs.CL cs.DL cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article analyzes one month of edits to Wikipedia in order to examine the
role of users editing multiple language editions (referred to as multilingual
users). Such multilingual users may serve an important function in diffusing
information across different language editions of the encyclopedia, and prior
work has suggested this could reduce the level of self-focus bias in each
edition. This study finds multilingual users are much more active than their
single-edition (monolingual) counterparts. They are found in all language
editions, but smaller-sized editions with fewer users have a higher percentage
of multilingual users than larger-sized editions. About a quarter of
multilingual users always edit the same articles in multiple languages, while
just over 40% of multilingual users edit different articles in different
languages. When non-English users do edit a second language edition, that
edition is most frequently English. Nonetheless, several regional and
linguistic cross-editing patterns are also present.
","[{'version': 'v1', 'created': 'Tue, 3 Dec 2013 23:04:36 GMT'}, {'version': 'v2', 'created': 'Mon, 12 May 2014 11:15:18 GMT'}]",2014-05-13,"[['Hale', 'Scott A.', '']]","['Social Media', 'Information Discovery', 'Social Network Analysis', 'Information Diffusion', 'Cross-language', 'Wikipedia', 'Multilingual']"
1037,1711.05251,Serhii Nazarovets,Serhii Nazarovets,"War and Peace: The Peculiarities of Ukrainian-Russian Scientific
  Cooperation Dynamics Against the Background of Russian Military Aggression in
  Ukraine, in 2014-2016",,"Nauka innov. 2017, 13(5):38-43",10.15407/scin13.05.038,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  The paper presents the results of bibliometric analysis of publications that
were co-written by authors affiliated with Ukrainian and Russian institutions
in 2007-2016 according to Scopus. Results of the study show that Ukrainian and
Russian scientists have not refused to carry out joint research in major
international projects, but a decrease in the number of works, written by
Ukrainian and Russian scientific institutions staff members in 2016, provides
evidence on the threat and negative impact the Russian military intervention
brings to cooperation in science. The findings are important for generating the
science development programs in Ukraine.
","[{'version': 'v1', 'created': 'Tue, 14 Nov 2017 18:51:46 GMT'}]",2017-11-16,"[['Nazarovets', 'Serhii', '']]","['scientific cooperation', 'publication activity', 'bibliometric analysis', 'Ukraine', 'Russia']"
1038,2105.05517,Nicky Williams,Nicky Williams (LSL),Towards exhaustive branch coverage with PathCrawler,,"2nd ACM/IEEE International Conference on Automation of Software
  Test AST 2021, May 2021, Madrid, Spain",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Branch coverage of source code is a very widely used test criterion.
Moreover, branch coverage is a similar problem to line coverage, MC/DC and the
coverage of assertion violations, certain runtime errors and various other
types of test objective. Indeed, establishing that a large number of test
objectives are unreachable, or conversely, providing the test inputs which
reach them, is at the heart of many verification tasks. However, automatic test
generation for exhaustive branch coverage remains an elusive goal: many modern
tools obtain high coverage scores without being able to provide an explanation
for why some branches are not covered, such as a demonstration that they are
unreachable. Concolic test generation offers the promise of exhaustive coverage
but covers paths more efficiently than branches. In this paper, I explain why,
and propose different strategies to improve its performance on exhaustive
branch coverage. A comparison of these strategies on examples of real code
shows promising results.
","[{'version': 'v1', 'created': 'Wed, 12 May 2021 08:55:13 GMT'}]",2021-05-13,"[['Williams', 'Nicky', '', 'LSL']]","['automatic test generation', 'branch coverage', 'reachability', 'concolic']"
1039,1705.07358,Oscar Eduardo Cornejo Olivares,Oscar Cornejo,Flexible In-The-Field Monitoring,"2 pages, no figures, conference article",,10.1109/ICSE-C.2017.37,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fully assessing the robustness of a software application in-house is
infeasible, especially considering the huge variety of hardly predictable
stimuli, environments, and configurations that applications must handle in the
field. For this reason, modern testing and analysis techniques can often
process data extracted from the field, such as crash reports and profile data,
or can even be executed directly in the field, for instance to diagnose and
correct problems. In all these cases, collection, processing, and distribution
of field data must be done seamlessly and unobstrusively while users interact
with their applications. To limit the intrusiveness of in-the-field monitoring
a common approach is to reduce the amount of collected data (e.g., to rare
events and to crash dumps), which, however, may severely affect the
effectiveness of the techniques that exploit field data. The objective of this
Ph.D. thesis is to define solutions for collecting field data in a cost
effective way without affecting the quality of the user experience. This result
can enable a new range of testing and analysis solutions that extensively
exploit field data.
","[{'version': 'v1', 'created': 'Sat, 20 May 2017 20:41:53 GMT'}]",2017-05-23,"[['Cornejo', 'Oscar', '']]","['Monitoring', 'dynamic analysis', 'user experience']"
1040,1701.08114,Alexandru Florin Iosif-Lazar,"Alexandru Florin Iosif-Lazar (IT University of Copenhagen, Denmark),
  Jean Melo (IT University of Copenhagen, Denmark), Aleksandar S. Dimovski (IT
  University of Copenhagen, Denmark), Claus Brabrand (IT University of
  Copenhagen, Denmark), Andrzej Wasowski (IT University of Copenhagen, Denmark)",Effective Analysis of C Programs by Rewriting Variability,"The Art, Science, and Engineering of Programming, Vol. 1, Issue 1,
  Article 1","The Art, Science, and Engineering of Programming, 2017, Vol. 1,
  Issue 1, Article 1",10.22152/programming-journal.org/2017/1/1,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context. Variability-intensive programs (program families) appear in many
application areas and for many reasons today. Different family members, called
variants, are derived by switching statically configurable options (features)
on and off, while reuse of the common code is maximized.
  Inquiry. Verification of program families is challenging since the number of
variants is exponential in the number of features. Existing single-program
analysis and verification tools cannot be applied directly to program families,
and designing and implementing the corresponding variability-aware versions is
tedious and laborious.
  Approach. In this work, we propose a range of variability-related
transformations for translating program families into single programs by
replacing compile-time variability with run-time variability (non-determinism).
The obtained transformed programs can be subsequently analyzed using the
conventional off- the-shelf single-program analysis tools such as type
checkers, symbolic executors, model checkers, and static analyzers.
  Knowledge. Our variability-related transformations are outcome-preserving,
which means that the relation between the outcomes in the transformed single
program and the union of outcomes of all variants derived from the original
program family is equality.
  Grounding. We show our transformation rules and their correctness with
respect to a minimal core imperative language IMP. Then, we discuss our
experience of implementing and using the transformations for efficient and
effective analysis and verification of real-world C program families.
  Importance. We report some interesting variability-related bugs that we
discovered using various state-of-the-art single-program C verification tools,
such as Frama-C, Clang, LLBMC.
","[{'version': 'v1', 'created': 'Fri, 27 Jan 2017 16:55:51 GMT'}]",2017-02-01,"[['Iosif-Lazar', 'Alexandru Florin', '', 'IT University of Copenhagen, Denmark'], ['Melo', 'Jean', '', 'IT University of Copenhagen, Denmark'], ['Dimovski', 'Aleksandar S.', '', 'IT\n  University of Copenhagen, Denmark'], ['Brabrand', 'Claus', '', 'IT University of\n  Copenhagen, Denmark'], ['Wasowski', 'Andrzej', '', 'IT University of Copenhagen, Denmark']]","['Program Families', 'Variability-related Transformations', 'Verification', 'Static Analysis']"
1041,1607.04789,Thijs Laarhoven,Thijs Laarhoven,Sieving for closest lattice vectors (with preprocessing),"23rd Conference on Selected Areas in Cryptography (SAC), 2016","23rd International Conference on Selected Areas in Cryptography
  (SAC), pp. 523-542, 2016",10.1007/978-3-319-69453-5_28,,cs.CR cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lattice-based cryptography has recently emerged as a prime candidate for
efficient and secure post-quantum cryptography. The two main hard problems
underlying its security are the shortest vector problem (SVP) and the closest
vector problem (CVP). Various algorithms have been studied for solving these
problems, and for SVP, lattice sieving currently dominates in terms of the
asymptotic time complexity: one can heuristically solve SVP in time
$2^{0.292d}$ in high dimensions $d$ [BDGL'16]. Although several SVP algorithms
can also be used to solve CVP, it is not clear whether this also holds for
heuristic lattice sieving methods. The best time complexity for CVP is
currently $2^{0.377d}$ [BGJ'14].
  In this paper we revisit sieving algorithms for solving SVP, and study how
these algorithms can be modified to solve CVP and its variants as well. Our
first method is aimed at solving one problem instance and minimizes the overall
time complexity for a single CVP instance with a time complexity of
$2^{0.292d}$. Our second method minimizes the amortized time complexity for
several instances on the same lattice, at the cost of a larger preprocessing
cost. We can solve the closest vector problem with preprocessing (CVPP) with
$2^{0.636d}$ space and preprocessing, in $2^{0.136d}$ time, while the query
complexity can even be reduced to $2^{\epsilon d}$ at the cost of preprocessing
time and memory complexities of $(1/\epsilon)^{O(d)}$.
  For easier variants of CVP, such as approximate CVP and bounded distance
decoding (BDD), we further show how the preprocessing method achieves even
better complexities. For instance, we can solve approximate CVPP with large
approximation factors $k$ with polynomial-sized advice in polynomial time if $k
= \Omega(\sqrt{d/\log d})$, heuristically closing the gap between the
decision-CVPP result of [AR'04] and the search-CVPP result of [DRS'14].
","[{'version': 'v1', 'created': 'Sat, 16 Jul 2016 18:59:19 GMT'}]",2019-10-04,"[['Laarhoven', 'Thijs', '']]","['lattices', 'sieving algorithms', 'approximate nearest neighbors', 'shortest vectorproblem (SVP)', 'closest vector problem (CVP)', 'bounded distance decoding (BDD)']"
1042,1607.07792,Ali Tarhini,"Mohammed Hassouna, Ali Tarhini, Tariq Elyas, Mohammad Saeed AbouTrab",Customer Churn in Mobile Markets A Comparison of Techniques,"14 pages, 7 figures, Journal paper (2015, Vol 8 No 6, 224-237)",,10.5539/ibr.v8n6p224,,cs.CY cs.SI stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The high increase in the number of companies competing in mature markets
makes customer retention an important factor for any company to survive. Thus,
many methodologies (e.g., data mining and statistics) have been proposed to
analyse and study customer retention. The validity of such methods is not yet
proved though. This paper tries to fill this gap by empirically comparing two
techniques: Customer churn-decision tree and logistic regression models. The
paper proves the superiority of decision tree technique and stresses the needs
for more advanced methods to churn modelling.
","[{'version': 'v1', 'created': 'Mon, 18 Jan 2016 10:42:46 GMT'}]",2016-07-27,"[['Hassouna', 'Mohammed', ''], ['Tarhini', 'Ali', ''], ['Elyas', 'Tariq', ''], ['AbouTrab', 'Mohammad Saeed', '']]","['customer relationship management', 'customer churn', 'data mining', 'mobile market']"
1043,1810.09591,Malay Haldar,"Malay Haldar, Mustafa Abdool, Prashant Ramanathan, Tao Xu, Shulin
  Yang, Huizhong Duan, Qing Zhang, Nick Barrow-Williams, Bradley C. Turnbull,
  Brendan M. Collins and Thomas Legrand",Applying Deep Learning To Airbnb Search,8 pages,,10.1145/3292500.3330658,,cs.LG cs.AI cs.IR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The application to search ranking is one of the biggest machine learning
success stories at Airbnb. Much of the initial gains were driven by a gradient
boosted decision tree model. The gains, however, plateaued over time. This
paper discusses the work done in applying neural networks in an attempt to
break out of that plateau. We present our perspective not with the intention of
pushing the frontier of new modeling techniques. Instead, ours is a story of
the elements we found useful in applying neural networks to a real life
product. Deep learning was steep learning for us. To other teams embarking on
similar journeys, we hope an account of our struggles and triumphs will provide
some useful pointers. Bon voyage!
","[{'version': 'v1', 'created': 'Mon, 22 Oct 2018 23:11:01 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Oct 2018 18:28:03 GMT'}]",2020-02-13,"[['Haldar', 'Malay', ''], ['Abdool', 'Mustafa', ''], ['Ramanathan', 'Prashant', ''], ['Xu', 'Tao', ''], ['Yang', 'Shulin', ''], ['Duan', 'Huizhong', ''], ['Zhang', 'Qing', ''], ['Barrow-Williams', 'Nick', ''], ['Turnbull', 'Bradley C.', ''], ['Collins', 'Brendan M.', ''], ['Legrand', 'Thomas', '']]","['Search ranking', 'Deep learning', 'e-commerce']"
1044,1704.06258,Mustapha Oudani,"Abdelhamid Benaini, Achraf Berrajaa, Jaouad Boukachour, Mustapha
  Oudani",Solving the Uncapacitated Single Allocation p-Hub Median Problem on GPU,,,10.1007/978-3-319-95104-1_2,,cs.DM cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A parallel genetic algorithm (GA) implemented on GPU clusters is proposed to
solve the Uncapacitated Single Allocation p-Hub Median problem. The GA uses
binary and integer encoding and genetic operators adapted to this problem. Our
GA is improved by generated initial solution with hubs located at middle nodes.
The obtained experimental results are compared with the best known solutions on
all benchmarks on instances up to 1000 nodes. Furthermore, we solve our own
randomly generated instances up to 6000 nodes. Our approach outperforms most
well-known heuristics in terms of solution quality and time execution and it
allows hitherto unsolved problems to be solved.
","[{'version': 'v1', 'created': 'Fri, 14 Apr 2017 07:57:16 GMT'}]",2018-08-24,"[['Benaini', 'Abdelhamid', ''], ['Berrajaa', 'Achraf', ''], ['Boukachour', 'Jaouad', ''], ['Oudani', 'Mustapha', '']]","['Parrallel genetic algorithms', 'GPU', 'CUDA', 'p-hub median problem']"
1045,1902.09802,Benyou Wang,"Benyou Wang, Qiuchi Li, Massimo Melucci, Dawei Song",Semantic Hilbert Space for Text Representation Learning,accepted in WWW 2019,,10.1145/3308558.3313516,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Capturing the meaning of sentences has long been a challenging task. Current
models tend to apply linear combinations of word features to conduct semantic
composition for bigger-granularity units e.g. phrases, sentences, and
documents. However, the semantic linearity does not always hold in human
language. For instance, the meaning of the phrase `ivory tower' can not be
deduced by linearly combining the meanings of `ivory' and `tower'. To address
this issue, we propose a new framework that models different levels of semantic
units (e.g. sememe, word, sentence, and semantic abstraction) on a single
\textit{Semantic Hilbert Space}, which naturally admits a non-linear semantic
composition by means of a complex-valued vector word representation. An
end-to-end neural network~\footnote{https://github.com/wabyking/qnn} is
proposed to implement the framework in the text classification task, and
evaluation results on six benchmarking text classification datasets demonstrate
the effectiveness, robustness and self-explanation power of the proposed model.
Furthermore, intuitive case studies are conducted to help end users to
understand how the framework works.
","[{'version': 'v1', 'created': 'Tue, 26 Feb 2019 08:46:15 GMT'}]",2019-02-27,"[['Wang', 'Benyou', ''], ['Li', 'Qiuchi', ''], ['Melucci', 'Massimo', ''], ['Song', 'Dawei', '']]","['text understanding', 'neural network', 'quantum theory']"
1046,1611.08208,Michael Lettmann,"Alexander Leitsch, Michael Peter Lettmann",The problem of Pi_2-cut-introduction,52 pages,,10.1016/j.tcs.2017.10.003,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe an algorithmic method of proof compression based on the
introduction of Pi_2-cuts into a cut-free LK-proof. The current approach is
based on an inversion of Gentzen s cut-elimination method and extends former
methods for introducing Pi_1-cuts. The Herbrand instances of a cut-free proof
pi of a sequent S are described by a grammar G which encodes substitutions
defined in the elimination of quantified cuts. We present an algorithm which,
given a grammar G, constructs a Pi_2-cut formula A and a proof phi of S with
one cut on A. It is shown that, by this algorithm, we can achieve an
exponential proof compression.
","[{'version': 'v1', 'created': 'Thu, 24 Nov 2016 15:05:39 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Jan 2018 10:29:47 GMT'}]",2018-01-16,"[['Leitsch', 'Alexander', ''], ['Lettmann', 'Michael Peter', '']]","['Proof Theory', 'Automated Deduction', 'Proof Grammar', 'SequentCalculus', 'Lemma Generation']"
1047,1507.04489,Florian Geigl,"Florian Geigl, Daniel Lamprecht, Rainer Hofmann-Wellenhof, Simon Walk,
  Markus Strohmaier and Denis Helic",Random Surfers on a Web Encyclopedia,8 pages,,10.1145/2809563.2809598,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The random surfer model is a frequently used model for simulating user
navigation behavior on the Web. Various algorithms, such as PageRank, are based
on the assumption that the model represents a good approximation of users
browsing a website. However, the way users browse the Web has been drastically
altered over the last decade due to the rise of search engines. Hence, new
adaptations for the established random surfer model might be required, which
better capture and simulate this change in navigation behavior. In this article
we compare the classical uniform random surfer to empirical navigation and page
access data in a Web Encyclopedia. Our high level contributions are (i) a
comparison of stationary distributions of different types of the random surfer
to quantify the similarities and differences between those models as well as
(ii) new insights into the impact of search engines on traditional user
navigation. Our results suggest that the behavior of the random surfer is
almost similar to those of users - as long as users do not use search engines.
We also find that classical website navigation structures, such as navigation
hierarchies or breadcrumbs, only exercise limited influence on user navigation
anymore. Rather, a new kind of navigational tools (e.g., recommendation
systems) might be needed to better reflect the changes in browsing behavior of
existing users.
","[{'version': 'v1', 'created': 'Thu, 16 Jul 2015 08:54:43 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Aug 2015 11:50:20 GMT'}]",2015-08-05,"[['Geigl', 'Florian', ''], ['Lamprecht', 'Daniel', ''], ['Hofmann-Wellenhof', 'Rainer', ''], ['Walk', 'Simon', ''], ['Strohmaier', 'Markus', ''], ['Helic', 'Denis', '']]","['Navigation', 'Browsing', 'Random Surfer', 'PageRank']"
1048,1511.08844,Luiz Capretz Dr.,"Arif Raza, Luiz Fernando Capretz, Faheem Ahmed","An Empirical Study of Open Source Software Usability: The Industrial
  Perspective",arXiv admin note: text overlap with arXiv:1507.06882,"International Journal of Open Source Software and Processes,
  3(1):1-16, 2011",10.4018/jossp.2011010101,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent years have seen a sharp increase in the use of open source projects by
common novice users; Open Source Software (OSS) is thus no longer a reserved
arena for software developers and computer gurus. Although user-centered
designs are gaining popularity in OSS, usability is still not considered as one
of the prime objectives in many design scenarios. In this paper, we analyze
industry users perception of usability factors, including understandability,
learnability, operability and attractiveness, on OSS usability. The research
model of this empirical study establishes the relationship between the key
usability factors and OSS usability from industrial perspective. In order to
conduct the study, a data set of 105 industry users is included. The results of
the empirical investigation indicate the significance of the key factors for
OSS usability.
","[{'version': 'v1', 'created': 'Fri, 27 Nov 2015 22:35:53 GMT'}]",2015-12-01,"[['Raza', 'Arif', ''], ['Capretz', 'Luiz Fernando', ''], ['Ahmed', 'Faheem', '']]","['Open Source Software (OSS)', 'Usability', 'Empirical Study', 'Users', 'Industry']"
1049,1003.3322,Secretary Aircc Journal,"Youcef Zafoune (1), Aicha Mokhtari(1) and Rushed kanawati(2), ((1)
  USTHB University, Algeria and (2) Institute Galilee, Paris13 University,
  Paris, French)","Mobile Codes Localization in Ad hoc Networks: a Comparative Study of
  Centralized and Distributed Approaches","14 Pages, IJCNC Journal 2010","International Journal of Computer Networks & Communications 2.2
  (2010) 164-177",10.5121/ijcnc.2010.2213,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper presents a new approach in the management of mobile ad hoc
networks. Our alternative, based on mobile agent technology, allows the design
of mobile centralized server in ad hoc network, where it is not obvious to
think about a centralized management, due to the absence of any administration
or fixed infrastructure in these networks. The aim of this centralized approach
is to provide permanent availability of services in ad hoc networks which are
characterized by a distributed management. In order to evaluate the performance
of the proposed approach, we apply it to solve the problem of mobile code
localization in ad hoc networks. A comparative study, based upon a simulation,
of centralized and distributed localization protocols in terms of messages
number exchanged and response time shows that the centralized approach in a
distributed form is more interesting than a totally centralized approach.
","[{'version': 'v1', 'created': 'Wed, 17 Mar 2010 08:44:11 GMT'}]",2010-07-15,"[['Zafoune', 'Youcef', ''], ['Mokhtari', 'Aicha', ''], ['kanawati', 'Rushed', '']]","['Agent', 'Ad hoc', 'Centralized', 'Distributed', 'Localization', 'Mobile']"
1050,1807.03490,Yu Shi,Yu Shi and Qi Zhu and Fang Guo and Chao Zhang and Jiawei Han,"Easing Embedding Learning by Comprehensive Transcription of
  Heterogeneous Information Networks","10 pages. In Proceedings of the 24th ACM SIGKDD International
  Conference on Knowledge Discovery and Data Mining, London, United Kingdom,
  ACM, 2018",,10.1145/3219819.3220006,,cs.SI cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Heterogeneous information networks (HINs) are ubiquitous in real-world
applications. In the meantime, network embedding has emerged as a convenient
tool to mine and learn from networked data. As a result, it is of interest to
develop HIN embedding methods. However, the heterogeneity in HINs introduces
not only rich information but also potentially incompatible semantics, which
poses special challenges to embedding learning in HINs. With the intention to
preserve the rich yet potentially incompatible information in HIN embedding, we
propose to study the problem of comprehensive transcription of heterogeneous
information networks. The comprehensive transcription of HINs also provides an
easy-to-use approach to unleash the power of HINs, since it requires no
additional supervision, expertise, or feature engineering. To cope with the
challenges in the comprehensive transcription of HINs, we propose the HEER
algorithm, which embeds HINs via edge representations that are further coupled
with properly-learned heterogeneous metrics. To corroborate the efficacy of
HEER, we conducted experiments on two large-scale real-words datasets with an
edge reconstruction task and multiple case studies. Experiment results
demonstrate the effectiveness of the proposed HEER model and the utility of
edge representations and heterogeneous metrics. The code and data are available
at https://github.com/GentleZhu/HEER.
","[{'version': 'v1', 'created': 'Tue, 10 Jul 2018 06:21:22 GMT'}]",2018-07-11,"[['Shi', 'Yu', ''], ['Zhu', 'Qi', ''], ['Guo', 'Fang', ''], ['Zhang', 'Chao', ''], ['Han', 'Jiawei', '']]","['Heterogeneous information networks', 'network embedding', 'graphmining', 'representation learning']"
1051,0709.4015,Amanda Bouffier,Amanda Bouffier (LIPN),"From Texts to Structured Documents: The Case of Health Practice
  Guidelines",,"Dans International Semantic Web Conference Proceedings -
  International Semantic Web Conference-Doctoral Consortium, Busan : Cor\'ee,
  R\'epublique de (2007)",10.1007/978-3-540-76298-0_69,,cs.AI,,"  This paper describes a system capable of semi-automatically filling an XML
template from free texts in the clinical domain (practice guidelines). The XML
template includes semantic information not explicitly encoded in the text
(pairs of conditions and actions/recommendations). Therefore, there is a need
to compute the exact scope of conditions over text sequences expressing the
required actions. We present in this paper the rules developed for this task.
We show that the system yields good performance when applied to the analysis of
French practice guidelines.
","[{'version': 'v1', 'created': 'Tue, 25 Sep 2007 19:26:08 GMT'}]",2015-05-13,"[['Bouffier', 'Amanda', '', 'LIPN']]","['Health\xa0practice\xa0guidelines', 'XML', 'GEM\xa0(Guideline Elements Model)']"
1052,1404.7458,Daniel Krenn,"Clemens Heuberger, Daniel Krenn, Sara Kropf",Automata in SageMath---Combinatorics meet Theoretical Computer Science,,"Discrete Mathematics & Theoretical Computer Science, Vol. 18 no.
  3, Analysis of Algorithms (May 10, 2016) dmtcs:1475",10.46298/dmtcs.1352,,cs.FL math.CO,http://creativecommons.org/licenses/by/4.0/,"  The new finite state machine package in the mathematics software system
SageMath is presented and illustrated by many examples. Several combinatorial
problems, in particular digit problems, are introduced, modeled by automata and
transducers and solved using SageMath. In particular, we compute the asymptotic
Hamming weight of a non-adjacent-form-like digit expansion, which was not known
before.
","[{'version': 'v1', 'created': 'Tue, 29 Apr 2014 18:56:19 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Jan 2016 10:08:19 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Apr 2016 12:29:53 GMT'}, {'version': 'v4', 'created': 'Thu, 5 May 2016 17:46:57 GMT'}]",2021-10-04,"[['Heuberger', 'Clemens', ''], ['Krenn', 'Daniel', ''], ['Kropf', 'Sara', '']]","['Transducer', 'automaton', 'non-adjacent form', 'Hamming weight', 'tutorial']"
1053,0904.3310,Shariq Bashir Mr.,"Shariq Bashir, Abdul Rauf Baig","FastLMFI: An Efficient Approach for Local Maximal Patterns Propagation
  and Maximal Patterns Superset Checking","8 Pages, In the proceedings of 4th ACS/IEEE International Conference
  on Computer Systems and Applications 2006, March 8, 2006, Dubai/Sharjah, UAE,
  2006, Page(s) 452-459",,10.1109/AICCSA.2006.205130,,cs.DB cs.AI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Maximal frequent patterns superset checking plays an important role in the
efficient mining of complete Maximal Frequent Itemsets (MFI) and maximal search
space pruning. In this paper we present a new indexing approach, FastLMFI for
local maximal frequent patterns (itemset) propagation and maximal patterns
superset checking. Experimental results on different sparse and dense datasets
show that our work is better than the previous well known progressive focusing
technique. We have also integrated our superset checking approach with an
existing state of the art maximal itemsets algorithm Mafia, and compare our
results with current best maximal itemsets algorithms afopt-max and FP
(zhu)-max. Our results outperform afopt-max and FP (zhu)-max on dense (chess
and mushroom) datasets on almost all support thresholds, which shows the
effectiveness of our approach.
","[{'version': 'v1', 'created': 'Tue, 21 Apr 2009 18:33:04 GMT'}]",2016-11-17,"[['Bashir', 'Shariq', ''], ['Baig', 'Abdul Rauf', '']]","['Association Rule Mining', 'Maximal Frequent Itemset', 'Maximal Patterns Superset Checking', 'Data Mining   1']"
1054,2102.10522,Ajayi Ekuase-Anwansedo,"Ajayi Ekuase-Anwansedo, Akai Smith","Effect of Cloud Based Learning Management System on The Learning
  Management System Implementation Process: Faculty and Student Perspectives",,"In Proceedings of the 2019 ACM SIGUCCS Annual Conference (pp.
  176-179) 2019",10.1145/3347709.3347835,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  The concept of E-learning in Universities has grown rapidly over the years to
include not just only a learning management system but also tools initially not
designed for learning such as Facebook and advanced learning tools, for example
games, simulations and virtualization. As a result, Cloud-based LMS is being
touted as the next evolution of the traditional LMS. It is hoped that Cloud
based LMS will resolve some of the challenges associated with the traditional
LMS implementation process. In a previous study, we reported that lack of
involvement of faculty and students in the LMS implementation process results
in the limited use of the LMS by faculty and students. The question then is,
Will the cloud-based LMS resolve these issues? We conducted a review of
literature and presented an overview of the traditional LMS, cloud computing
and the cloudbased LMS and we described how the cloud computing LMS resolve
issues raised by faculty and students. we find that even though, cloud-based
LMS resolve most of the technical issues associated with the traditional LMS,
some of the human issues were not resolved. We hope that this study draws
attention to non-technical issues associated with the LMS implementation
process.
","[{'version': 'v1', 'created': 'Sun, 21 Feb 2021 06:12:04 GMT'}]",2021-02-23,"[['Ekuase-Anwansedo', 'Ajayi', ''], ['Smith', 'Akai', '']]","['Learning management system', 'Cloud computing', 'Cloud based Learning management system', 'E-learning']"
1055,1912.02400,Matthew Fontaine,"Matthew C. Fontaine, Julian Togelius, Stefanos Nikolaidis, Amy K.
  Hoover","Covariance Matrix Adaptation for the Rapid Illumination of Behavior
  Space",Accepted to GECCO 2020,,10.1145/3377930.3390232,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We focus on the challenge of finding a diverse collection of quality
solutions on complex continuous domains. While quality diver-sity (QD)
algorithms like Novelty Search with Local Competition (NSLC) and MAP-Elites are
designed to generate a diverse range of solutions, these algorithms require a
large number of evaluations for exploration of continuous spaces. Meanwhile,
variants of the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) are
among the best-performing derivative-free optimizers in single-objective
continuous domains. This paper proposes a new QD algorithm called Covariance
Matrix Adaptation MAP-Elites (CMA-ME). Our new algorithm combines the
self-adaptation techniques of CMA-ES with archiving and mapping techniques for
maintaining diversity in QD. Results from experiments based on standard
continuous optimization benchmarks show that CMA-ME finds better-quality
solutions than MAP-Elites; similarly, results on the strategic game Hearthstone
show that CMA-ME finds both a higher overall quality and broader diversity of
strategies than both CMA-ES and MAP-Elites. Overall, CMA-ME more than doubles
the performance of MAP-Elites using standard QD performance metrics. These
results suggest that QD algorithms augmented by operators from state-of-the-art
optimization algorithms can yield high-performing methods for simultaneously
exploring and optimizing continuous search spaces, with significant
applications to design, testing, and reinforcement learning among other
domains.
","[{'version': 'v1', 'created': 'Thu, 5 Dec 2019 06:06:42 GMT'}, {'version': 'v2', 'created': 'Thu, 7 May 2020 09:47:00 GMT'}]",2020-05-08,"[['Fontaine', 'Matthew C.', ''], ['Togelius', 'Julian', ''], ['Nikolaidis', 'Stefanos', ''], ['Hoover', 'Amy K.', '']]","['Quality diversity', 'illumination algorithms', 'evolutionary algorithms', 'Hearthstone', 'optimization', 'MAP-Elites']"
1056,1604.01358,Omar A. Alzubi,"Abiodun Sholiyi, Jafar A. Alzubi, Omar A. Alzubi, Omar Almomani, Tim
  O'Farrell",Near Capacity Irregular Turbo Code,"10 pages, 11 figures, 3 tables, journal paper, Indian Journal of
  Science and Technology, Vol 8(23), September 2015",,10.17485/ijst/2015/v8i23/70654,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this study is to construct a near capacity Irregular Turbo
Code and to evaluate its performance over Gaussian channel. The methodology
used to evaluate and measure the performance of the new design is by simulating
the system by developing a software platform using Matlab. The simulation
carried out by implementing the system over different modulation schemes,
different frame sizes, and different code rates in order to achieve a fair
comparison between irregular turbo code and regular Turbo Code. The simulation
results showed that the Irregular Turbo Code with 64QAM modulation is capable
of achieving a coding gain of 1.29 dB over its corresponding Turbo Code for a
low Bit Error Rate 10 to 5, when used in a Gaussian noisy channel. Also, the
Irregular Turbo Code designed in this paper, utilizes a single recursive
Convolution encoder with short frame size of 5012 bits. The new designed codec
can play an important role in many commercial applications such as
Third-Generation wireless phones, Digital Video Broadcasting systems, or
Wireless Metropolitan Area Networks, etc.
","[{'version': 'v1', 'created': 'Fri, 12 Feb 2016 21:33:23 GMT'}]",2016-04-06,"[['Sholiyi', 'Abiodun', ''], ['Alzubi', 'Jafar A.', ''], ['Alzubi', 'Omar A.', ''], ['Almomani', 'Omar', ''], [""O'Farrell"", 'Tim', '']]","['Coding', 'Error Correction', 'Irregular Turbo Code', 'Iterative Decoding', 'Log-MAP', 'Turbo Code']"
1057,1302.1355,Hani Abdeen Dr.,Hani Abdeen and Osama Shata,Characterizing and Evaluating The Impact of Software Interface Clones,11 pages,"H. Abdeen, O. Shata, ""Characterizing and Evaluating The Impact of
  Software Interface Clones"", International Journal of Software Engineering &
  Applications (IJSEA) 4 (1), Jan. 2013",10.5121/ijsea.2013.4106,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software Interfaces are meant to describe contracts governing interactions
between logic modules. Interfaces, if well designed, significantly reduce
software complexity and ease maintainability . However, as software evolves,
the organization and the quality of software interfaces gradually deteriorate.
As a consequence, this often leads to increased development cost, lower code
quality and reduced reusability . Code clones are one of the most known bad
smells in source code. This design defect may occur in interfaces by
duplicating method/API declarations in several interfaces. Such interfaces are
similar from the point of view of public services/APIs they specify, thus they
indicate a bad organization of application services. In this paper, we
characterize the interface clone design defect and illustrate it via examples
taken from real-world open source software applications. We conduct an
empirical study covering nine real-world open source software applications to
quantify the presence of interface clones and evaluate their impact on
interface design quality . The results of the empirical study show that
interface clones are widely present in software interfaces. They also show that
the presence of interface clones may cause a degradation of interface cohesion
and indicate a considerable presence of code clones at implementations level.
","[{'version': 'v1', 'created': 'Wed, 6 Feb 2013 13:16:44 GMT'}]",2013-02-07,"[['Abdeen', 'Hani', ''], ['Shata', 'Osama', '']]","['Software Interfaces', 'Interface Design Quality', 'Interface Clones', 'Interface Cohesion', 'Code Clones']"
1058,1808.04701,Stefanos Leonardos Mr.,Costis Melolidakis and Stefanos Leonardos and Constandina Koki,"Measuring Market Performance with Stochastic Demand: Price of Anarchy
  and Price of Uncertainty",arXiv admin note: substantial text overlap with arXiv:1803.03451,"In: Destercke S., Denoeux T., Cuzzolin F., Martin A. (eds) Belief
  Functions: Theory and Applications. BELIEF 2018. Lecture Notes in Computer
  Science, vol 11069. Springer, Cham",10.1007/978-3-319-99383-6_21,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Globally operating suppliers face the rising challenge of wholesale pricing
under scarce data about retail demand, in contrast to better informed, locally
operating retailers. At the same time, as local businesses proliferate, markets
congest and retail competition increases. To capture these strategic
considerations, we employ the classic Cournot model and extend it to a
two-stage supply chain with an upstream supplier who operates under demand
uncertainty and multiple downstream retailers who compete over quantity. The
supplier's belief about retail demand is modeled via a continuous probability
distribution function F. If F has the decreasing generalized mean residual life
property, then the supplier's optimal pricing policy exists and is the unique
fixed point of the mean residual life function. We evaluate the realized Price
of Uncertainty and show that there exist demand levels for which market
performs better when the supplier prices under demand uncertainty. In general,
performance worsens for lower values of realized demand. We examine the effects
of increasing competition on supply chain efficiency via the realized Price of
Anarchy and complement our findings with numerical results.
","[{'version': 'v1', 'created': 'Sat, 11 Aug 2018 07:00:55 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Jul 2021 17:47:19 GMT'}]",2021-07-19,"[['Melolidakis', 'Costis', ''], ['Leonardos', 'Stefanos', ''], ['Koki', 'Constandina', '']]","['Nash Equilibrium', 'Generalized Mean Residual Life', 'Continuous Beliefs', 'Price of Uncertainty', 'Price of Anarchy']"
1059,1007.5168,Secretary Iju,"R.Valli and P.Dananjayan (Pondicherry Engineering College, India)","A Non-Cooperative Game Theoretical Approach For Power Control In Virtual
  MIMO Wireless Sensor Network","12 pages, 8 figures",International Journal Of UbiComp 1.3 (2010) 44-55,10.5121/iju.2010.1304,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Power management is one of the vital issue in wireless sensor networks, where
the lifetime of the network relies on battery powered nodes. Transmitting at
high power reduces the lifetime of both the nodes and the network. One
efficient way of power management is to control the power at which the nodes
transmit. In this paper, a virtual multiple input multiple output wireless
sensor network (VMIMO-WSN)communication architecture is considered and the
power control of sensor nodes based on the approach of game theory is
formulated. The use of game theory has proliferated, with a broad range of
applications in wireless sensor networking. Approaches from game theory can be
used to optimize node level as well as network wide performance. The game here
is categorized as an incomplete information game, in which the nodes do not
have complete information about the strategies taken by other nodes. For
virtual multiple input multiple output wireless sensor network architecture
considered, the Nash equilibrium is used to decide the optimal power level at
which a node needs to transmit, to maximize its utility. Outcome shows that the
game theoretic approach considered for VMIMO-WSN architecture achieves the best
utility, by consuming less power.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2010 09:47:06 GMT'}]",2010-07-30,"[['Valli', 'R.', '', 'Pondicherry Engineering College, India'], ['Dananjayan', 'P.', '', 'Pondicherry Engineering College, India']]","['Wireless Sensor Network', 'Power Control', 'Virtual MIMO', 'Non-Cooperative Game']"
1060,2205.02538,Xiangjun Tang,"Xiangjun Tang, Wenxin Sun, Yong-Liang Yang, and Xiaogang Jin",Parametric Reshaping of Portraits in Videos,,"MM'21: Proceedings of the 29th ACM International Conference on
  MultimediaOctober 2021",10.1145/3474085.3475334,,cs.CV cs.MM,http://creativecommons.org/licenses/by/4.0/,"  Sharing short personalized videos to various social media networks has become
quite popular in recent years. This raises the need for digital retouching of
portraits in videos. However, applying portrait image editing directly on
portrait video frames cannot generate smooth and stable video sequences. To
this end, we present a robust and easy-to-use parametric method to reshape the
portrait in a video to produce smooth retouched results. Given an input
portrait video, our method consists of two main stages: stabilized face
reconstruction, and continuous video reshaping. In the first stage, we start by
estimating face rigid pose transformations across video frames. Then we jointly
optimize multiple frames to reconstruct an accurate face identity, followed by
recovering face expressions over the entire video. In the second stage, we
first reshape the reconstructed 3D face using a parametric reshaping model
reflecting the weight change of the face, and then utilize the reshaped 3D face
to guide the warping of video frames. We develop a novel signed distance
function based dense mapping method for the warping between face contours
before and after reshaping, resulting in stable warped video frames with
minimum distortions. In addition, we use the 3D structure of the face to
correct the dense mapping to achieve temporal consistency. We generate the
final result by minimizing the background distortion through optimizing a
content-aware warping mesh. Extensive experiments show that our method is able
to create visually pleasing results by adjusting a simple reshaping parameter,
which facilitates portrait video editing for social media and visual effects.
","[{'version': 'v1', 'created': 'Thu, 5 May 2022 09:55:16 GMT'}]",2022-05-06,"[['Tang', 'Xiangjun', ''], ['Sun', 'Wenxin', ''], ['Yang', 'Yong-Liang', ''], ['Jin', 'Xiaogang', '']]","['video portrait editing', 'face reconstruction', 'face reshaping']"
1061,1608.04162,Stephen Makonin,"Laura Guzman, Stephen Makonin, Roger Alex Clapp",CarbonKit: Designing A Personal Carbon Tracking Platform,"Accepted to be presented at SocialSense '19: Fourth International
  Workshop on Social Sensing",,10.1145/3313294.3313385,,cs.HC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ubiquitous technology platforms have been created to track and improve health
and fitness; similar technologies can help individuals monitor and reduce their
carbon footprints. This paper proposes CarbonKit, a platform combining
technology, markets, and incentives to empower and reward people for reducing
their carbon footprint. We argue that a goal-and-reward behavioral feedback
loop can be combined with the Big Data available from tracked activities, apps,
and social media to make CarbonKit an integral part of individuals daily lives.
CarbonKit comprises five modules that link personal carbon tracking, health and
fitness, social media, and economic incentives. Protocols for safeguarding
security, privacy and individuals control over their own data are essential to
the design of the CarbonKit. Initially CarbonKit would operate on a voluntary
basis, but such a system can also serve as part of a mandatory region-wide
initiative. We use the example of the British Columbia to illustrate the
regulatory framework and participating stakeholders that would be required to
support the CarbonKit in specific jurisdictions.
","[{'version': 'v1', 'created': 'Sun, 14 Aug 2016 23:59:39 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Aug 2016 15:28:17 GMT'}, {'version': 'v3', 'created': 'Thu, 25 Aug 2016 02:13:35 GMT'}, {'version': 'v4', 'created': 'Tue, 19 Feb 2019 20:34:06 GMT'}]",2019-02-21,"[['Guzman', 'Laura', ''], ['Makonin', 'Stephen', ''], ['Clapp', 'Roger Alex', '']]","['behavioral change', 'big data', 'carbon footprint', 'personal carbon tracking', 'computational sustainability', 'ubiquitous platform']"
1062,2102.11819,Konrad Kollnig,"Konrad Kollnig, Siddhartha Datta, Max Van Kleek",I Want My App That Way: Reclaiming Sovereignty Over Personal Devices,Accepted as Late-Breaking Work (LBW) for CHI 2021,,10.1145/3411763.3451632,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dark patterns in mobile apps take advantage of cognitive biases of end-users
and can have detrimental effects on people's lives. Despite growing research in
identifying remedies for dark patterns and established solutions for desktop
browsers, there exists no established methodology to reduce dark patterns in
mobile apps. Our work introduces GreaseDroid, a community-driven app
modification framework enabling non-expert users to disable dark patterns in
apps selectively.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2021 17:44:36 GMT'}]",2021-02-24,"[['Kollnig', 'Konrad', ''], ['Datta', 'Siddhartha', ''], ['Van Kleek', 'Max', '']]","['dark patterns', 'digital distraction', 'digital self-control', 'mobile app', 'program repair']"
1063,1306.5142,Daniel Langr,"Daniel Langr, Pavel Tvrd\'ik, Tom\'a\v{s} Dytrych, Jerry P. Draayer",Fake Run-Time Selection of Template Arguments in C++,"Objects, Models, Components, Patterns (50th International Conference,
  TOOLS 2012)","Lecture Notes in Computer Science, pages 140-154, volume 7304.
  2012",10.1007/978-3-642-30561-0_11,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  C++ does not support run-time resolution of template type arguments. To
circumvent this restriction, we can instantiate a template for all possible
combinations of type arguments at compile time and then select the proper
instance at run time by evaluation of some provided conditions. However, for
templates with multiple type parameters such a solution may easily result in a
branching code bloat. We present a template metaprogramming algorithm called
for_id that allows the user to select the proper template instance at run time
with theoretical minimum sustained complexity of the branching code.
","[{'version': 'v1', 'created': 'Fri, 21 Jun 2013 14:01:43 GMT'}]",2013-06-24,"[['Langr', 'Daniel', ''], ['Tvrdík', 'Pavel', ''], ['Dytrych', 'Tomáš', ''], ['Draayer', 'Jerry P.', '']]","['C++', 'run-time selection', 'template arguments', 'template metaprogramming', 'typesequences']"
1064,1203.2511,Victor Seal,"Victor Seal, Arnab Raha, Shovan Maity, Souvik Kr Mitra, Amitava
  Mukherjee and Mrinal Kanti Naskar",A Simple Flood Forecasting Scheme Using Wireless Sensor Networks,"16 pages, 4 figures, published in International Journal Of Ad-Hoc,
  Sensor And Ubiquitous Computing, February 2012; V. seal et al, 'A Simple
  Flood Forecasting Scheme Using Wireless Sensor Networks', IJASUC, Feb.2012",,10.5121/ijasuc.2012.3105,,cs.LG cs.CE cs.NI cs.SY stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a forecasting model designed using WSNs (Wireless Sensor
Networks) to predict flood in rivers using simple and fast calculations to
provide real-time results and save the lives of people who may be affected by
the flood. Our prediction model uses multiple variable robust linear regression
which is easy to understand and simple and cost effective in implementation, is
speed efficient, but has low resource utilization and yet provides real time
predictions with reliable accuracy, thus having features which are desirable in
any real world algorithm. Our prediction model is independent of the number of
parameters, i.e. any number of parameters may be added or removed based on the
on-site requirements. When the water level rises, we represent it using a
polynomial whose nature is used to determine if the water level may exceed the
flood line in the near future. We compare our work with a contemporary
algorithm to demonstrate our improvements over it. Then we present our
simulation results for the predicted water level compared to the actual water
level.
","[{'version': 'v1', 'created': 'Fri, 9 Mar 2012 18:08:34 GMT'}]",2012-03-13,"[['Seal', 'Victor', ''], ['Raha', 'Arnab', ''], ['Maity', 'Shovan', ''], ['Mitra', 'Souvik Kr', ''], ['Mukherjee', 'Amitava', ''], ['Naskar', 'Mrinal Kanti', '']]","['Flood forecasting', 'robust regression', 'WSN', 'polynomial fitting', 'multi-square weight minimization', 'event', 'query']"
1065,1804.06316,Pierangelo Lombardo,"Pierangelo Lombardo, Salvatore Saeli, Federica Bisio, Davide Bernardi,
  and Danilo Massa","Fast Flux Service Network Detection via Data Mining on Passive DNS
  Traffic","This is a pre-print of an article published in the proceedings of
  21st International Conference, ISC 2018, Guildford, UK, September 9-12, 2018.
  The final authenticated version is available online at:
  https://doi.org/10.1007/978-3-319-99136-8_25",,10.1007/978-3-319-99136-8_25,,cs.CR cs.NI stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last decade, the use of fast flux technique has become established as
a common practice to organise botnets in Fast Flux Service Networks (FFSNs),
which are platforms able to sustain illegal online services with very high
availability. In this paper, we report on an effective fast flux detection
algorithm based on the passive analysis of the Domain Name System (DNS) traffic
of a corporate network. The proposed method is based on the near-real-time
identification of different metrics that measure a wide range of fast flux key
features; the metrics are combined via a simple but effective mathematical and
data mining approach. The proposed solution has been evaluated in a one-month
experiment over an enterprise network, with the injection of pcaps associated
with different malware campaigns, that leverage FFSNs and cover a wide variety
of attack scenarios. An in-depth analysis of a list of fast flux domains
confirmed the reliability of the metrics used in the proposed algorithm and
allowed for the identification of many IPs that turned out to be part of two
notorious FFSNs, namely Dark Cloud and SandiFlux, to the description of which
we therefore contribute. All the fast flux domains were detected with a very
low false positive rate; a comparison of performance indicators with previous
works show a remarkable improvement.
","[{'version': 'v1', 'created': 'Tue, 17 Apr 2018 15:26:06 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Apr 2018 15:25:37 GMT'}, {'version': 'v3', 'created': 'Fri, 13 Jul 2018 09:26:37 GMT'}, {'version': 'v4', 'created': 'Fri, 7 Sep 2018 12:51:47 GMT'}, {'version': 'v5', 'created': 'Tue, 18 Sep 2018 12:45:07 GMT'}]",2018-09-19,"[['Lombardo', 'Pierangelo', ''], ['Saeli', 'Salvatore', ''], ['Bisio', 'Federica', ''], ['Bernardi', 'Davide', ''], ['Massa', 'Danilo', '']]","['automated security analysis', 'malware detection', 'networksecurity', 'passive traffic analysis', 'botnet', 'fast flux']"
1066,1505.06855,Byungjin Cho,"Byungjin Cho, Konstantinos Koufos, Kalle Ruttik, Riku J\""antti","Modeling the Interference Generated from Car Base Stations towards
  Indoor Femto-cells","6 pages, 4 figures, 3rd IFAC Symposium on Telematics Applications","Proc. of the 3rd IFAC Symposium on Telematics Applications, pp.
  96-101, Nov, 2013",10.3182/20131111-3-KR-2043.00030,,cs.SY cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In future wireless networks, a significant number of users will be vehicular.
One promising solution to improve the capacity for these vehicular users is to
employ moving relays or car base stations. The system forms cell inside the
vehicle and then uses rooftop antenna for back-hauling to overcome the
vehicular penetration loss. In this paper, we develop a model for aggregate
interference distribution generated from moving/parked cars to indoor users in
order to study whether indoor femto-cells can coexist on the same spectrum with
vehicular communications. Since spectrum authorization for vehicular
communications is open at moment, we consider two spectrum sharing scenarios
(i) communication from mounted antennas on the roof of the vehicles to the
infrastructure network utilizes same spectrum with indoor femto-cells (ii)
in-vehicle communication utilizes same spectrum with indoor femto-cells while
vehicular to infrastructure (V2I) communication is allocated at different
spectrum. Based on our findings we suggest that V2I and indoor femto-cells
should be allocated at different spectrum. The reason being that mounted
roof-top antennas facing the indoor cells generate unacceptable interference
levels. On the other hand, in-vehicle communication and indoor cells can share
the spectrum thanks to the vehicle body isolation and the lower transmit power
levels that can be used inside the vehicle.
","[{'version': 'v1', 'created': 'Tue, 26 May 2015 08:44:10 GMT'}]",2015-05-27,"[['Cho', 'Byungjin', ''], ['Koufos', 'Konstantinos', ''], ['Ruttik', 'Kalle', ''], ['J\x7fäntti', 'Riku', '']]","['Interference modeling', 'poisson point process', 'shared spectrum access', 'vehicularcommunication']"
1067,1511.07180,Florin Manea,"Marius Dumitran, Pawe{\l} Gawrychowski and Florin Manea",Longest Gapped Repeats and Palindromes,"This is an extension of the conference papers ""Longest
  $\alpha$-Gapped Repeat and Palindrome"", presented by the second and third
  authors at FCT 2015, and ""Longest Gapped Repeats and Palindromes"", presented
  by the first and third authors at MFCS 2015","Discrete Mathematics & Theoretical Computer Science, Vol. 19 no.
  4, FCT '15, special issue FCT'15 (October 13, 2017) dmtcs:3988",10.23638/DMTCS-19-4-4,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  A gapped repeat (respectively, palindrome) occurring in a word $w$ is a
factor $uvu$ (respectively, $u^Rvu$) of $w$. In such a repeat (palindrome) $u$
is called the arm of the repeat (respectively, palindrome), while $v$ is called
the gap. We show how to compute efficiently, for every position $i$ of the word
$w$, the longest gapped repeat and palindrome occurring at that position,
provided that the length of the gap is subject to various types of
restrictions. That is, that for each position $i$ we compute the longest prefix
$u$ of $w[i..n]$ such that $uv$ (respectively, $u^Rv$) is a suffix of
$w[1..i-1]$ (defining thus a gapped repeat $uvu$ -- respectively, palindrome
$u^Rvu$), and the length of $v$ is subject to the aforementioned restrictions.
","[{'version': 'v1', 'created': 'Mon, 23 Nov 2015 11:19:00 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Feb 2017 17:50:14 GMT'}, {'version': 'v3', 'created': 'Thu, 29 Jun 2017 15:02:47 GMT'}, {'version': 'v4', 'created': 'Wed, 11 Oct 2017 09:40:01 GMT'}]",2019-03-14,"[['Dumitran', 'Marius', ''], ['Gawrychowski', 'Paweł', ''], ['Manea', 'Florin', '']]","['combinatorial pattern matching', 'gapped repeats', 'gapped palindromes']"
1068,1005.2821,Secretary Aircc Journal,"Tamaghna Acharya(1), Samiran Chattopadhyay(2) and Rajarshi Roy(3),
  ((1) BESU, India, (2) Jadavpur University, India, (3) Indian Institute of
  Technology - Kharagpur, India)","Constructing Path Efficient and Energy Aware Virtual Multicast Backbones
  in Static Ad Hoc Wireless Networks","17 Pages, IJWMN 2010","International Journal of Wireless & Mobile Networks 2.2 (2010)
  138-154",10.5121/ijwmn.2010.2210,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  For stationary wireless ad hoc networks, one of the key challenging issues in
routing and multicasting is to conserve as much energy as possible without
compromising path efficiency measured as end-to-end delay. In this paper, we
address the problem of path efficient and energy aware multicasting in static
wireless ad hoc networks. We propose a novel distributed scalable algorithm for
finding a virtual multicast backbone (VMB). Based on this VMB, we have further
developed a multicasting scheme that jointly improves path efficiency and
energy conservation. By exploiting inherent broadcast advantage of wireless
communication and employing a more realistic energy consumption model for
wireless communication which not only depends on radio propagation losses but
also on energy losses in transceiver circuitry, our simulation results show
that the proposed VMB-based multicasting scheme outperforms existing prominent
tree based energy conserving, path efficient multicasting schemes.
","[{'version': 'v1', 'created': 'Mon, 17 May 2010 07:21:57 GMT'}]",2010-07-15,"[['Acharya', 'Tamaghna', ''], ['Chattopadhyay', 'Samiran', ''], ['Roy', 'Rajarshi', '']]","['Wireless Ad Hoc Networks', 'Multicasting; Virtual Multicast Backbone', 'Energy Conservation', 'Path Efficiency', 'Distributed Algorithm']"
1069,1706.08312,I\~naki Ucar,"Arturo Azcorra, I\~naki Ucar, Francesco Gringoli, Albert Banchs, Pablo
  Serrano",$\mu$Nap: Practical Micro-Sleeps for 802.11 WLANs,"15 pages, 12 figures","Computer Communications, Volume 110, 15 September 2017, pp.175-186",10.1016/j.comcom.2017.06.008,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we revisit the idea of putting interfaces to sleep during
'packet overhearing' (i.e., when there are ongoing transmissions addressed to
other stations) from a practical standpoint. To this aim, we perform a robust
experimental characterisation of the timing and consumption behaviour of a
commercial 802.11 card. We design $\mu$Nap, a local standard-compliant
energy-saving mechanism that leverages micro-sleep opportunities inherent to
the CSMA operation of 802.11 WLANs. This mechanism is backwards compatible and
incrementally deployable, and takes into account the timing limitations of
existing hardware, as well as practical CSMA-related issues (e.g., capture
effect). According to the performance assessment carried out through
trace-based simulation, the use of our scheme would result in a 57% reduction
in the time spent in overhearing, thus leading to an energy saving of 15.8% of
the activity time.
","[{'version': 'v1', 'created': 'Mon, 26 Jun 2017 10:36:21 GMT'}, {'version': 'v2', 'created': 'Fri, 30 Jun 2017 09:54:54 GMT'}]",2017-07-11,"[['Azcorra', 'Arturo', ''], ['Ucar', 'Iñaki', ''], ['Gringoli', 'Francesco', ''], ['Banchs', 'Albert', ''], ['Serrano', 'Pablo', '']]","['energy efficiency', 'energy measurement', 'CSMA wireless networks']"
1070,1801.00329,Yang Yu,"Yu-Ren Liu, Yi-Qi Hu, Hong Qian, Chao Qian, Yang Yu",ZOOpt: Toolbox for Derivative-Free Optimization,"SCIENCE CHINA Information Sciences, 2022. Codes:
  https://github.com/polixir/ZOOpt","SCIENCE CHINA Information Sciences, 65: 207101, 2022",10.1007/s11432-021-3416-y,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Recent advances in derivative-free optimization allow efficient approximation
of the global-optimal solutions of sophisticated functions, such as functions
with many local optima, non-differentiable and non-continuous functions. This
article describes the ZOOpt (Zeroth Order Optimization) toolbox that provides
efficient derivative-free solvers and is designed easy to use. ZOOpt provides
single-machine parallel optimization on the basis of python core and
multi-machine distributed optimization for time-consuming tasks by
incorporating with the Ray framework -- a famous platform for building
distributed applications. ZOOpt particularly focuses on optimization problems
in machine learning, addressing high-dimensional and noisy problems such as
hyper-parameter tuning and direct policy search. The toolbox is maintained
toward a ready-to-use tool in real-world machine learning tasks.
","[{'version': 'v1', 'created': 'Sun, 31 Dec 2017 18:06:25 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Feb 2018 21:11:13 GMT'}, {'version': 'v3', 'created': 'Thu, 2 Jun 2022 02:10:52 GMT'}]",2022-09-28,"[['Liu', 'Yu-Ren', ''], ['Hu', 'Yi-Qi', ''], ['Qian', 'Hong', ''], ['Qian', 'Chao', ''], ['Yu', 'Yang', '']]","['Software', 'Derivative-free optimization', 'Hyper-parameter optimization', 'Non-convexoptimization', 'Subset selection', 'Distributed optimization']"
1071,1901.03627,"Niels Gr\""uttemeier","Niels Gr\""uttemeier, Christian Komusiewicz, Jannik Schestag, Frank
  Sommer",Destroying Bicolored $P_3$s by Deleting Few Edges,25 pages,"Discrete Mathematics & Theoretical Computer Science, vol. 23 no.
  1, Graph Theory (June 8, 2021) dmtcs:7553",10.46298/dmtcs.6108,,cs.DS cs.DM math.CO,http://creativecommons.org/licenses/by/4.0/,"  We introduce and study the Bicolored $P_3$ Deletion problem defined as
follows. The input is a graph $G=(V,E)$ where the edge set $E$ is partitioned
into a set $E_r$ of red edges and a set $E_b$ of blue edges. The question is
whether we can delete at most $k$ edges such that $G$ does not contain a
bicolored $P_3$ as an induced subgraph. Here, a bicolored $P_3$ is a path on
three vertices with one blue and one red edge. We show that Bicolored $P_3$
Deletion is NP-hard and cannot be solved in $2^{o(|V|+|E|)}$ time on
bounded-degree graphs if the ETH is true. Then, we show that Bicolored $P_3$
Deletion is polynomial-time solvable when $G$ does not contain a bicolored
$K_3$, that is, a triangle with edges of both colors. Moreover, we provide a
polynomial-time algorithm for the case that $G$ contains no blue $P_3$, red
$P_3$, blue $K_3$, and red $K_3$. Finally, we show that Bicolored $P_3$
Deletion can be solved in $ O(1.84^k\cdot |V| \cdot |E|)$ time and that it
admits a kernel with $ O(k\Delta\min(k,\Delta))$ vertices, where $\Delta$ is
the maximum degree of $G$.
","[{'version': 'v1', 'created': 'Fri, 11 Jan 2019 16:05:23 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Feb 2020 14:14:29 GMT'}, {'version': 'v3', 'created': 'Thu, 8 Apr 2021 13:20:54 GMT'}, {'version': 'v4', 'created': 'Fri, 4 Jun 2021 11:35:39 GMT'}]",2021-10-04,"[['Grüttemeier', 'Niels', ''], ['Komusiewicz', 'Christian', ''], ['Schestag', 'Jannik', ''], ['Sommer', 'Frank', '']]","['NP-hard problem', 'graph modification', 'edge-colored graphs', 'parameterized complexity', 'graph classes']"
1072,1811.11516,Janusz Dybizba\'nski,"Janusz Dybizba\'nski, Andrzej Szepietowski",Hamiltonian cycles and paths in hypercubes with disjoint faulty edges,,,10.1016/j.ipl.2021.106157,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider hypercubes with pairwise disjoint faulty edges. An
$n$-dimensional hypercube $Q_n$ is an undirected graph with $2^n$ nodes, each
labeled with a distinct binary strings of length $n$. The parity of the vertex
is 0 if the number of ones in its labels is even, and is 1 if the number of
ones is odd. Two vertices $a$ and $b$ are connected by the edge iff $a$ and $b$
differ in one position. If $a$ and $b$ differ in position $i$, then we say that
the edge $(a,b)$ goes in direction $i$ and we define the parity of the edge as
the parity of the end with 0 on the position $i$. It was already known that
$Q_n$ is not Hamiltonian if all edges going in one direction and of the same
parity are faulty.
  In this paper we show that if $n\ge4$ then all other hypercubes are
Hamiltonian. In other words, every cube $Q_n$, with $n\ge4$ and disjoint faulty
edges is Hamiltonian if and only if for each direction there are two healthy
crossing edges of different parity.
","[{'version': 'v1', 'created': 'Wed, 28 Nov 2018 12:05:56 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Aug 2019 07:14:14 GMT'}]",2021-06-28,"[['Dybizbański', 'Janusz', ''], ['Szepietowski', 'Andrzej', '']]","['Hamiltonian cycle', 'hypercube', 'fault tolerance', 'disjoint faultyedges']"
1073,1807.03613,Shenghua He,"Shenghua He, Jie Zheng, Akiko Maehara, Gary Mintz, Dalin Tang, Mark
  Anastasio, Hua Li","Convolutional neural network based automatic plaque characterization
  from intracoronary optical coherence tomography images",SPIE 2018,,10.1117/12.2293957,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optical coherence tomography (OCT) can provide high-resolution
cross-sectional images for analyzing superficial plaques in coronary arteries.
Commonly, plaque characterization using intra-coronary OCT images is performed
manually by expert observers. This manual analysis is time consuming and its
accuracy heavily relies on the experience of human observers. Traditional
machine learning based methods, such as the least squares support vector
machine and random forest methods, have been recently employed to automatically
characterize plaque regions in OCT images. Several processing steps, including
feature extraction, informative feature selection, and final pixel
classification, are commonly used in these traditional methods. Therefore, the
final classification accuracy can be jeopardized by error or inaccuracy within
each of these steps. In this study, we proposed a convolutional neural network
(CNN) based method to automatically characterize plaques in OCT images. Unlike
traditional methods, our method uses the image as a direct input and performs
classification as a single-step process. The experiments on 269 OCT images
showed that the average prediction accuracy of CNN-based method was 0.866,
which indicated a great promise for clinical translation.
","[{'version': 'v1', 'created': 'Tue, 10 Jul 2018 13:18:21 GMT'}]",2018-07-11,"[['He', 'Shenghua', ''], ['Zheng', 'Jie', ''], ['Maehara', 'Akiko', ''], ['Mintz', 'Gary', ''], ['Tang', 'Dalin', ''], ['Anastasio', 'Mark', ''], ['Li', 'Hua', '']]","['Convolutional neural network', 'automatic plaque characterization', 'optical coherence tomography']"
1074,1505.06955,Wei Wei,"Wei Wei, Yunjia Zhang, Ting Wang, Baifeng Li, Baolong Niu, Zhiming
  Zheng","Research on Solution Space of Bipartite Graph Vertex-Cover by Maximum
  Matchings","19 pages, 8 figures",,10.1088/1742-5468/2015/11/P11027,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Some rigorous results and statistics of the solution space of Vertex-Covers
on bipartite graphs are given in this paper. Based on the $K\ddot{o}nig$'s
theorem, an exact solution space expression algorithm is proposed and
statistical analysis of the nodes' states is provided. The statistical results
fit well with the algorithmic results until the emergence of the unfrozen core,
which makes the fluctuation of statistical quantities and causes the replica
symmetric breaking in the solutions. Besides, the entropy of bipartite
Vertex-Cover solutions is calculated with the clustering entropy using a cycle
simplification technique for the unfrozen core. Furthermore, as generalization
of bipartite graphs, bipartite core graph is proposed, the solution space of
which can also be easily determined; and based on these results, how to
generate a $K\ddot{o}nig-Egerv\acute{a}ry$ subgraph is studied by a growth
process of adding edges. The investigation of solution space of bipartite graph
Vertex-Cover provides intensive understanding and some insights on the solution
space complexity, and will produce benefit for finding maximal
$K\ddot{o}nig-Egerv\acute{a}ry$ subgraphs, solving general graph Vertex-Cover
and recognizing the intrinsic hardness of NP-complete problems.
","[{'version': 'v1', 'created': 'Sat, 23 May 2015 02:06:31 GMT'}]",2015-12-09,"[['Wei', 'Wei', ''], ['Zhang', 'Yunjia', ''], ['Wang', 'Ting', ''], ['Li', 'Baifeng', ''], ['Niu', 'Baolong', ''], ['Zheng', 'Zhiming', '']]","['disordered systems (theory)', 'classical phase transitions (theory)', 'cavity andreplica method', 'phase diagrams (theory)']"
1075,1507.07049,Jedidiah McClurg,"Jedidiah McClurg, Hossein Hojjat, Nate Foster, Pavol Cerny",Event-Driven Network Programming,,,10.1145/2908080.2908097,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software-defined networking (SDN) programs must simultaneously describe
static forwarding behavior and dynamic updates in response to events.
Event-driven updates are critical to get right, but difficult to implement
correctly due to the high degree of concurrency in networks. Existing SDN
platforms offer weak guarantees that can break application invariants, leading
to problems such as dropped packets, degraded performance, security violations,
etc. This paper introduces EVENT-DRIVEN CONSISTENT UPDATES that are guaranteed
to preserve well-defined behaviors when transitioning between configurations in
response to events. We propose NETWORK EVENT STRUCTURES (NESs) to model
constraints on updates, such as which events can be enabled simultaneously and
causal dependencies between events. We define an extension of the NetKAT
language with mutable state, give semantics to stateful programs using NESs,
and discuss provably-correct strategies for implementing NESs in SDNs. Finally,
we evaluate our approach empirically, demonstrating that it gives well-defined
consistency guarantees while avoiding expensive synchronization and packet
buffering.
","[{'version': 'v1', 'created': 'Sat, 25 Jul 2015 01:12:57 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Nov 2015 02:21:46 GMT'}, {'version': 'v3', 'created': 'Sat, 16 Apr 2016 03:57:02 GMT'}]",2016-04-19,"[['McClurg', 'Jedidiah', ''], ['Hojjat', 'Hossein', ''], ['Foster', 'Nate', ''], ['Cerny', 'Pavol', '']]","['network update', 'consistent update', 'event structure', 'software-defined networking', 'SDN', 'NetKAT']"
1076,1006.3035,Shay Cohen,"Shay B. Cohen, Robert J. Simmons, Noah A. Smith",Products of Weighted Logic Programs,,"TLP 11 (2-3): 263-296, 2011",10.1017/S1471068410000529,,cs.AI cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Weighted logic programming, a generalization of bottom-up logic programming,
is a well-suited framework for specifying dynamic programming algorithms. In
this setting, proofs correspond to the algorithm's output space, such as a path
through a graph or a grammatical derivation, and are given a real-valued score
(often interpreted as a probability) that depends on the real weights of the
base axioms used in the proof. The desired output is a function over all
possible proofs, such as a sum of scores or an optimal score. We describe the
PRODUCT transformation, which can merge two weighted logic programs into a new
one. The resulting program optimizes a product of proof scores from the
original programs, constituting a scoring function known in machine learning as
a ``product of experts.'' Through the addition of intuitive constraining side
conditions, we show that several important dynamic programming algorithms can
be derived by applying PRODUCT to weighted logic programs corresponding to
simpler weighted logic programs. In addition, we show how the computation of
Kullback-Leibler divergence, an information-theoretic measure, can be
interpreted using PRODUCT.
","[{'version': 'v1', 'created': 'Tue, 15 Jun 2010 17:22:55 GMT'}]",2012-08-15,"[['Cohen', 'Shay B.', ''], ['Simmons', 'Robert J.', ''], ['Smith', 'Noah A.', '']]","['weighted logic programming', 'program transformations', 'natural languageprocessing']"
1077,0901.3482,Aurelien Francillon,"Aur\'elien Francillon, Claude Castelluccia",Code injection attacks on harvard-architecture devices,,"CCS '08: Proceedings of the 15th ACM conference on Computer and
  communications security (2008) 15--26",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Harvard architecture CPU design is common in the embedded world. Examples of
Harvard-based architecture devices are the Mica family of wireless sensors.
Mica motes have limited memory and can process only very small packets.
Stack-based buffer overflow techniques that inject code into the stack and then
execute it are therefore not applicable. It has been a common belief that code
injection is impossible on Harvard architectures. This paper presents a remote
code injection attack for Mica sensors. We show how to exploit program
vulnerabilities to permanently inject any piece of code into the program memory
of an Atmel AVR-based sensor. To our knowledge, this is the first result that
presents a code injection technique for such devices. Previous work only
succeeded in injecting data or performing transient attacks. Injecting
permanent code is more powerful since the attacker can gain full control of the
target sensor. We also show that this attack can be used to inject a worm that
can propagate through the wireless sensor network and possibly create a sensor
botnet. Our attack combines different techniques such as return oriented
programming and fake stack injection. We present implementation details and
suggest some counter-measures.
","[{'version': 'v1', 'created': 'Thu, 22 Jan 2009 14:21:27 GMT'}]",2009-01-23,"[['Francillon', 'Aurélien', ''], ['Castelluccia', 'Claude', '']]","['Harvard Architecture', 'Embedded Devices', 'Wireless SensorNetworks', 'Code Injection Attacks', 'Gadgets', 'Return Oriented Programming', 'Buffer Overflow', 'Computer Worms']"
1078,1601.00164,Mingyu Xiao,Mingyu Xiao,"On a generalization of Nemhauser and Trotter's local optimization
  theorem",,Journal of Computer and System Sciences 84: 97-106 (2017),10.1016/j.jcss.2016.08.003,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fellows, Guo, Moser and Niedermeier~[JCSS2011] proved a generalization of
Nemhauser and Trotter's theorem, which applies to \textsc{Bounded-Degree Vertex
Deletion} (for a fixed integer $d\geq 0$, to delete $k$ vertices of the input
graph to make the maximum degree of it $\leq d$) and gets a linear-vertex
kernel for $d=0$ and $1$, and a superlinear-vertex kernel for each $d\geq 2$.
It is still left as an open problem whether \textsc{Bounded-Degree Vertex
Deletion} admits a linear-vertex kernel for each $d\geq 3$. In this paper, we
refine the generalized Nemhauser and Trotter's theorem and get a linear-vertex
kernel for each $d\geq 0$.
","[{'version': 'v1', 'created': 'Sat, 2 Jan 2016 11:24:58 GMT'}]",2020-07-23,"[['Xiao', 'Mingyu', '']]","['Kernelization', 'Fixed-Parameter Tractable', 'Graph Algorithms', 'Graph Theory', 'Graph Decomposition', 'Bounded-Degree Vertex Deletion']"
1079,1905.07903,Ruslan Nikolaev,Ruslan Nikolaev and Binoy Ravindran,"Snapshot-Free, Transparent, and Robust Memory Reclamation for Lock-Free
  Data Structures",An extended version of the PLDI'21 paper (with Appendix),"42nd ACM SIGPLAN International Conference on Programming Language
  Design and Implementation (PLDI 2021)",10.1145/3453483.3454090,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a family of safe memory reclamation schemes, Hyaline, which are
fast, scalable, and transparent to the underlying lock-free data structures.
Hyaline is based on reference counting - considered impractical for memory
reclamation in the past due to high overheads. Hyaline uses reference counters
only during reclamation, but not while accessing individual objects, which
reduces overheads for object accesses. Since with reference counters, an
arbitrary thread ends up freeing memory, Hyaline's reclamation workload is
(almost) balanced across all threads, unlike most prior reclamation schemes
such as epoch-based reclamation (EBR) or hazard pointers (HP). Hyaline often
yields (excellent) EBR-grade performance with (good) HP-grade memory
efficiency, which is a challenging tradeoff with all existing schemes.
  Hyaline schemes offer: (i) high performance; (ii) good memory efficiency;
(iii) robustness: bounding memory usage even in the presence of stalled
threads, a well-known problem with EBR; (iv) transparency: supporting virtually
unbounded number of threads (or concurrent entities) that can be created and
deleted dynamically, and effortlessly join existent workload; (v) autonomy:
avoiding special OS mechanisms and being non-intrusive to runtime or compiler
environments; (vi) simplicity: enabling easy integration into unmanaged C/C++
code; and (vii) generality: supporting many data structures. All existing
schemes lack one or more properties.
  We have implemented and tested Hyaline on x86(-64), ARM32/64, PowerPC, and
MIPS. The general approach requires LL/SC or double-width CAS, while a
specialized version also works with single-width CAS. Our evaluation reveals
that Hyaline's throughput is very high - it steadily outperforms EBR by 10% in
one test and yields 2x gains in oversubscribed scenarios. Hyaline's superior
memory efficiency is especially evident in read-dominated workloads
","[{'version': 'v1', 'created': 'Mon, 20 May 2019 06:34:15 GMT'}, {'version': 'v2', 'created': 'Sat, 1 May 2021 13:38:45 GMT'}]",2021-05-04,"[['Nikolaev', 'Ruslan', ''], ['Ravindran', 'Binoy', '']]","['lock-free', 'non-blocking', 'memory reclamation', 'hazard pointers', 'epoch-based reclamation']"
1080,1901.08015,Tiancheng Li,"Tiancheng Li, Hongqi Fan, Jes\'us G. Herrero and Juan M Corchado","Second Order Statistics Analysis and Comparison between Arithmetic and
  Geometric Average Fusion","17 pages, 8 figures","Information Fusion, 2019",10.1016/j.inffus.2019.02.009,,cs.SY cs.MA math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two fundamental approaches to information averaging are based on linear and
logarithmic combination, yielding the arithmetic average (AA) and geometric
average (GA) of the fusing initials, respectively. In the context of target
tracking, the two most common formats of data to be fused are random variables
and probability density functions, namely $v$-fusion and $f$-fusion,
respectively. In this work, we analyze and compare the second order statistics
(including variance and mean square error) of AA and GA in terms of both
$v$-fusion and $f$-fusion. The case of weighted Gaussian mixtures representing
multitarget densities in the presence of false alarms and misdetection (whose
weight sums are not necessarily unit) is also considered, the result of which
appears significantly different from that for a single target. In addition to
exact derivation, exemplifying analysis and illustrations are provided.
","[{'version': 'v1', 'created': 'Wed, 23 Jan 2019 17:24:19 GMT'}]",2019-02-26,"[['Li', 'Tiancheng', ''], ['Fan', 'Hongqi', ''], ['Herrero', 'Jesús G.', ''], ['Corchado', 'Juan M', '']]","['Multisensor fusion', 'average consensus', 'distributed tracking', 'covariance intersection', 'arithmetic mean', 'geometric mean', 'linear pool', 'log-linear pool']"
1081,1705.04469,Luka \v{C}ehovin Zajc,Luka \v{C}ehovin,TraX: The visual Tracking eXchange Protocol and Library,,,10.1016/j.neucom.2017.02.036,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we address the problem of developing on-line visual tracking
algorithms. We present a specialized communication protocol that serves as a
bridge between a tracker implementation and utilizing application. It decouples
development of algorithms and application, encouraging re-usability. The
primary use case is algorithm evaluation where the protocol facilitates more
complex evaluation scenarios that are used nowadays thus pushing forward the
field of visual tracking. We present a reference implementation of the protocol
that makes it easy to use in several popular programming languages and discuss
where the protocol is already used and some usage scenarios that we envision
for the future.
","[{'version': 'v1', 'created': 'Fri, 12 May 2017 08:33:20 GMT'}]",2017-05-15,"[['Čehovin', 'Luka', '']]","['computer vision', 'visual tracking', 'performance evaluation', 'algorithm analysis', 'communication protocol', 'software library']"
1082,1703.09423,Joachim Bruneau-Queyreix,"Joachim Bruneau-Queyreix (LaBRI), Daniel N\'egru (LaBRI), Jordi Mongay
  Batalla (Warsaw University of Technology (WUT))","Home-Box based collaborative caching strategy: An asset for Content
  Delivery Networks",,"TEMU, 2014, Heraklion, France. pp.58 - 63, 2014",10.1109/TEMU.2014.6917736,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  -- Within the Future Internet, a new trend is foreseen with the creation of
overlay networks composed of residential gateways (i.e. Home-Box), leveraging
their storage and upload capacity in order to achieve scalable and
cost-efficient content distribution. In this paper, we highlight an
architecture of such a home-box overlay for Video On Demand (VOD) services, in
cooperation with a network-aware request redirection and content caching
strategy that optimize the resource usage at both network and client side to
reduce the overall distribution cost. The proposed system is compared to
existing solutions through comprehensive simulations. The results demonstrate
the strong advantage of introducing such a network-aware and popularity-based
caching strategy in terms of cost reduction for VOD services, especially for
Content Delivery Networks.
","[{'version': 'v1', 'created': 'Tue, 28 Mar 2017 07:22:58 GMT'}]",2017-03-29,"[['Bruneau-Queyreix', 'Joachim', '', 'LaBRI'], ['Négru', 'Daniel', '', 'LaBRI'], ['Batalla', 'Jordi Mongay', '', 'Warsaw University of Technology']]","['content distribution networks', 'content replication and caching', 'home-box overlay', 'future media Internet']"
1083,1804.07179,Naoki Hamada,Naoki Hamada and Keisuke Goto,Data-Driven Analysis of Pareto Set Topology,"8 pages, accepted at GECCO'18 as a full paper",,10.1145/3205455.3205613,,cs.NE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When and why can evolutionary multi-objective optimization (EMO) algorithms
cover the entire Pareto set? That is a major concern for EMO researchers and
practitioners. A recent theoretical study revealed that (roughly speaking) if
the Pareto set forms a topological simplex (a curved line, a curved triangle, a
curved tetrahedron, etc.), then decomposition-based EMO algorithms can cover
the entire Pareto set. Usually, we cannot know the true Pareto set and have to
estimate its topology by using the population of EMO algorithms during or after
the runtime. This paper presents a data-driven approach to analyze the topology
of the Pareto set. We give a theory of how to recognize the topology of the
Pareto set from data and implement an algorithm to judge whether the true
Pareto set may form a topological simplex or not. Numerical experiments show
that the proposed method correctly recognizes the topology of high-dimensional
Pareto sets within reasonable population size.
","[{'version': 'v1', 'created': 'Thu, 19 Apr 2018 14:03:00 GMT'}]",2018-04-20,"[['Hamada', 'Naoki', ''], ['Goto', 'Keisuke', '']]","['multi-objective optimization', 'continuous optimization', 'topologicaldata analysis', 'persistent homology']"
1084,0909.4004,Robert Brijder,"Robert Brijder, Hendrik Jan Hoogeboom","The Group Structure of Pivot and Loop Complementation on Graphs and Set
  Systems","21 pages, 7 figures, significant additions w.r.t. v3 are Thm 7 and
  Remark 25","European Journal of Combinatorics, v. 32, 1353-1367, 2011",10.1016/j.ejc.2011.03.002,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the interplay between principal pivot transform (pivot) and loop
complementation for graphs. This is done by generalizing loop complementation
(in addition to pivot) to set systems. We show that the operations together,
when restricted to single vertices, form the permutation group S_3. This leads,
e.g., to a normal form for sequences of pivots and loop complementation on
graphs. The results have consequences for the operations of local
complementation and edge complementation on simple graphs: an alternative proof
of a classic result involving local and edge complementation is obtained, and
the effect of sequences of local complementations on simple graphs is
characterized.
","[{'version': 'v1', 'created': 'Tue, 22 Sep 2009 15:42:06 GMT'}, {'version': 'v2', 'created': 'Mon, 5 Oct 2009 17:41:52 GMT'}, {'version': 'v3', 'created': 'Tue, 4 May 2010 16:27:00 GMT'}, {'version': 'v4', 'created': 'Mon, 18 Apr 2011 09:50:54 GMT'}]",2014-03-26,"[['Brijder', 'Robert', ''], ['Hoogeboom', 'Hendrik Jan', '']]","['local complementation', 'principal pivot transform', 'circle graph', 'interlace polynomial', 'delta-matroid', 'algebraic graph theory']"
1085,1109.0137,Andrey Makarenko,"A.V. Makarenko, A.V. Pravdivtsev","Architectural solutions of conformal network-centric staring-sensor
  systems with spherical field of view","16 pages, 2 figures, 2 tables, Report accepted for conference: SPIE
  Security+Defence 2011, Conferences ""Electro-Optical and Infrared Systems:
  Technology and Applications"", 19-22 September 2011, Prague, Czech Republic,
  Paper 8185-18","Proc. SPIE 8185, 81850I (2011)",10.1117/12.897804,,cs.SY math.PR physics.optics,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The article presents the concept of network-centric conformal electro-optical
systems construction with spherical field of view. It discusses abstract
passive distributed electro-optical systems with focal array detectors based on
a group of moving objects distributed in space. The system performs conformal
processing of information from sensor matrix in a single event coordinate-time
field. Unequivocally the construction of the systems which satisfy the
different criteria of optimality is very complicated and requires special
approaches to their development and design. The paper briefly touches upon key
questions (in the authors' opinion) in the synthesis of such systems that meet
different criteria of optimality. The synthesis of such systems is discussed by
authors with the systematic and synergy approaches.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2011 09:25:13 GMT'}]",2011-10-11,"[['Makarenko', 'A. V.', ''], ['Pravdivtsev', 'A. V.', '']]","['EOS', 'network-centric systems', 'architecture', 'wide angle optical systems', 'MWIR']"
1086,2102.03980,Koh Takeuchi,"Koh Takeuchi, Ryo Nishida, Hisashi Kashima, Masaki Onishi","Grab the Reins of Crowds: Estimating the Effects of Crowd Movement
  Guidance Using Causal Inference",,AAMAS2020,10.5555/3463952.3464101,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Crowd movement guidance has been a fascinating problem in various fields,
such as easing traffic congestion in unusual events and evacuating people from
an emergency-affected area. To grab the reins of crowds, there has been
considerable demand for a decision support system that can answer a typical
question: ``what will be the outcomes of each of the possible options in the
current situation. In this paper, we consider the problem of estimating the
effects of crowd movement guidance from past data. To cope with limited amount
of available data biased by past decision-makers, we leverage two recent
techniques in deep representation learning for spatial data analysis and causal
inference. We use a spatial convolutional operator to extract effective spatial
features of crowds from a small amount of data and use balanced representation
learning based on the integral probability metrics to mitigate the selection
bias and missing counterfactual outcomes. To evaluate the performance on
estimating the treatment effects of possible guidance, we use a multi-agent
simulator to generate realistic data on evacuation scenarios in a crowded
theater, since there are no available datasets recording outcomes of all
possible crowd movement guidance. The results of three experiments demonstrate
that our proposed method reduces the estimation error by at most 56% from
state-of-the-art methods.
","[{'version': 'v1', 'created': 'Mon, 8 Feb 2021 03:17:08 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Jul 2021 06:10:30 GMT'}]",2021-07-20,"[['Takeuchi', 'Koh', ''], ['Nishida', 'Ryo', ''], ['Kashima', 'Hisashi', ''], ['Onishi', 'Masaki', '']]","['Deep Learning', 'Causal Inference', 'Multi-Agent Simulator']"
1087,1402.0918,Usman Khan,Mohammadreza Doostmohammadian and Usman A. Khan,Graphic-theoretic distributed inference in social networks,submitted for journal publication,,10.1109/JSTSP.2014.2314512,,cs.SI cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider distributed inference in social networks where a phenomenon of
interest evolves over a given social interaction graph, referred to as the
\emph{social digraph}. For inference, we assume that a network of agents
monitors certain nodes in the social digraph and no agent may be able to
perform inference within its neighborhood; the agents must rely on inter-agent
communication. The key contributions of this paper include: (i) a novel
construction of the distributed estimator and distributed observability from
the first principles; (ii) a graph-theoretic agent classification that
establishes the importance and role of each agent towards inference; (iii)
characterizing the necessary conditions, based on the classification in (ii),
on the agent network to achieve distributed observability. Our results are
based on structured systems theory and are applicable to any parameter choice
of the underlying system matrix as long as the social digraph remains fixed. In
other words, any social phenomena that evolves (linearly) over a
structure-invariant social digraph may be considered--we refer to such systems
as Liner Structure-Invariant (LSI). The aforementioned contributions,
(i)--(iii), thus, only require the knowledge of the social digraph (topology)
and are independent of the social phenomena. We show the applicability of the
results to several real-wold social networks, i.e. social influence among
monks, networks of political blogs and books, and a co-authorship graph.
","[{'version': 'v1', 'created': 'Wed, 5 Feb 2014 01:04:09 GMT'}]",2015-06-18,"[['Doostmohammadian', 'Mohammadreza', ''], ['Khan', 'Usman A.', '']]","['Distributed estimation and observability', 'Dulmage-Mendelsohn decomposition', 'Bipartite graphs', 'Graph']"
1088,1612.03639,Xiaopeng Li,"Xiaopeng Li, Ming Cheung and James She","Connection Discovery using Shared Images by Gaussian Relational Topic
  Model",IEEE International Conference on Big Data 2016,,10.1109/BigData.2016.7840689,,cs.SI cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Social graphs, representing online friendships among users, are one of the
fundamental types of data for many applications, such as recommendation,
virality prediction and marketing in social media. However, this data may be
unavailable due to the privacy concerns of users, or kept private by social
network operators, which makes such applications difficult. Inferring user
interests and discovering user connections through their shared multimedia
content has attracted more and more attention in recent years. This paper
proposes a Gaussian relational topic model for connection discovery using user
shared images in social media. The proposed model not only models user
interests as latent variables through their shared images, but also considers
the connections between users as a result of their shared images. It explicitly
relates user shared images to user connections in a hierarchical, systematic
and supervisory way and provides an end-to-end solution for the problem. This
paper also derives efficient variational inference and learning algorithms for
the posterior of the latent variables and model parameters. It is demonstrated
through experiments with over 200k images from Flickr that the proposed method
significantly outperforms the methods in previous works.
","[{'version': 'v1', 'created': 'Mon, 12 Dec 2016 12:10:28 GMT'}]",2017-02-16,"[['Li', 'Xiaopeng', ''], ['Cheung', 'Ming', ''], ['She', 'James', '']]","['Bayesian', 'topic model', 'variational inference', 'usershared images', 'connection', 'discovery', 'recommendation', 'socialnetwork analysis']"
1089,2003.14132,Andreas Maier,"Patrick Krauss, Andreas Maier",Will we ever have Conscious Machines?,,"Front. Comput. Neurosci., 22, Dec 2020",10.3389/fncom.2020.556544,,cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The question of whether artificial beings or machines could become self-aware
or consciousness has been a philosophical question for centuries. The main
problem is that self-awareness cannot be observed from an outside perspective
and the distinction of whether something is really self-aware or merely a
clever program that pretends to do so cannot be answered without access to
accurate knowledge about the mechanism's inner workings. We review the current
state-of-the-art regarding these developments and investigate common machine
learning approaches with respect to their potential ability to become
self-aware. We realise that many important algorithmic steps towards machines
with a core consciousness have already been devised. For human-level
intelligence, however, many additional techniques have to be discovered.
","[{'version': 'v1', 'created': 'Tue, 31 Mar 2020 12:09:50 GMT'}]",2020-12-29,"[['Krauss', 'Patrick', ''], ['Maier', 'Andreas', '']]","['machine consciousness', 'artificial intelligence', 'theories of consciousness']"
1090,1908.01080,Sanidhya Mangal,"Sanidhya Mangal, Rahul Modak, Poorva Joshi",LSTM Based Music Generation System,"6 pages, 11 figures","IARJSET: Vol. 6, Issue 5 (2019) 47-54",10.17148/IARJSET.2019.6508,,cs.SD cs.LG eess.AS stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditionally, music was treated as an analogue signal and was generated
manually. In recent years, music is conspicuous to technology which can
generate a suite of music automatically without any human intervention. To
accomplish this task, we need to overcome some technical challenges which are
discussed descriptively in this paper. A brief introduction about music and its
components is provided in the paper along with the citation and analysis of
related work accomplished by different authors in this domain. Main objective
of this paper is to propose an algorithm which can be used to generate musical
notes using Recurrent Neural Networks (RNN), principally Long Short-Term Memory
(LSTM) networks. A model is designed to execute this algorithm where data is
represented with the help of musical instrument digital interface (MIDI) file
format for easier access and better understanding. Preprocessing of data before
feeding it into the model, revealing methods to read, process and prepare MIDI
files for input are also discussed. The model used in this paper is used to
learn the sequences of polyphonic musical notes over a single-layered LSTM
network. The model must have the potential to recall past details of a musical
sequence and its structure for better learning. Description of layered
architecture used in LSTM model and its intertwining connections to develop a
neural network is presented in this work. This paper imparts a peek view of
distributions of weights and biases in every layer of the model along with a
precise representation of losses and accuracy at each step and batches. When
the model was thoroughly analyzed, it produced stellar results in composing new
melodies.
","[{'version': 'v1', 'created': 'Fri, 2 Aug 2019 22:10:19 GMT'}]",2019-08-06,"[['Mangal', 'Sanidhya', ''], ['Modak', 'Rahul', ''], ['Joshi', 'Poorva', '']]","['Music', 'Melodies', 'RNN', 'LSTM', 'Neural']"
1091,1911.08938,Steffen Herbold,"Steffen Herbold, Alexander Trautsch, Fabian Trautsch, Benjamin Ledel","Problems with SZZ and Features: An empirical study of the state of
  practice of defect prediction data collection","Accepted at Empirical Software Engineering, Springer. First three
  authors are equally contributing",,10.1007/s10664-021-10092-4,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: The SZZ algorithm is the de facto standard for labeling bug fixing
commits and finding inducing changes for defect prediction data. Recent
research uncovered potential problems in different parts of the SZZ algorithm.
Most defect prediction data sets provide only static code metrics as features,
while research indicates that other features are also important.
  Objective: We provide an empirical analysis of the defect labels created with
the SZZ algorithm and the impact of commonly used features on results.
  Method: We used a combination of manual validation and adopted or improved
heuristics for the collection of defect data. We conducted an empirical study
on 398 releases of 38 Apache projects.
  Results: We found that only half of the bug fixing commits determined by SZZ
are actually bug fixing. If a six-month time frame is used in combination with
SZZ to determine which bugs affect a release, one file is incorrectly labeled
as defective for every file that is correctly labeled as defective. In
addition, two defective files are missed. We also explored the impact of the
relatively small set of features that are available in most defect prediction
data sets, as there are multiple publications that indicate that, e.g., churn
related features are important for defect prediction. We found that the
difference of using more features is not significant.
  Conclusion: Problems with inaccurate defect labels are a severe threat to the
validity of the state of the art of defect prediction. Small feature sets seem
to be a less severe threat.
","[{'version': 'v1', 'created': 'Wed, 20 Nov 2019 14:41:21 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Feb 2020 13:35:39 GMT'}, {'version': 'v3', 'created': 'Thu, 11 Nov 2021 11:07:05 GMT'}]",2022-01-24,"[['Herbold', 'Steffen', ''], ['Trautsch', 'Alexander', ''], ['Trautsch', 'Fabian', ''], ['Ledel', 'Benjamin', '']]","['SZZ', 'bug fix labeling', 'bug inducing changes', 'defect predictiondata', 'data set']"
1092,1509.01396,Stefano Ferretti Stefano Ferretti,"Stefano Ferretti, Vittorio Ghini, Fabio Panzieri",A Survey on Handover Management in Mobility Architectures,,"Computer Networks Volume 94, 15 January 2016, Pages 390-413",10.1016/j.comnet.2015.11.016,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work presents a comprehensive and structured taxonomy of available
techniques for managing the handover process in mobility architectures.
Representative works from the existing literature have been divided into
appropriate categories, based on their ability to support horizontal handovers,
vertical handovers and multihoming. We describe approaches designed to work on
the current Internet (i.e. IPv4-based networks), as well as those that have
been devised for the ""future"" Internet (e.g. IPv6-based networks and
extensions). Quantitative measures and qualitative indicators are also
presented and used to evaluate and compare the examined approaches. This
critical review provides some valuable guidelines and suggestions for designing
and developing mobility architectures, including some practical expedients
(e.g. those required in the current Internet environment), aimed to cope with
the presence of NAT/firewalls and to provide support to legacy systems and
several communication protocols working at the application layer.
","[{'version': 'v1', 'created': 'Fri, 4 Sep 2015 10:22:17 GMT'}]",2016-05-18,"[['Ferretti', 'Stefano', ''], ['Ghini', 'Vittorio', ''], ['Panzieri', 'Fabio', '']]","['Mobility Management', 'Handover', 'Mobile Applications', 'Multi-Homing', 'Cross-Layer Protocols']"
1093,1911.11675,Valdemar \v{S}v\'abensk\'y,"Valdemar \v{S}v\'abensk\'y, Jan Vykopal, Pavel \v{C}eleda","What Are Cybersecurity Education Papers About? A Systematic Literature
  Review of SIGCSE and ITiCSE Conferences","ACM SIGCSE 2020 conference, 7 pages, 3 figures, 1 table",,10.1145/3328778.3366816,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cybersecurity is now more important than ever, and so is education in this
field. However, the cybersecurity domain encompasses an extensive set of
concepts, which can be taught in different ways and contexts. To understand the
state of the art of cybersecurity education and related research, we examine
papers from the ACM SIGCSE and ACM ITiCSE conferences. From 2010 to 2019, a
total of 1,748 papers were published at these conferences, and 71 of them focus
on cybersecurity education. The papers discuss courses, tools, exercises, and
teaching approaches. For each paper, we map the covered topics, teaching
context, evaluation methods, impact, and the community of authors. We
discovered that the technical topic areas are evenly covered (the most
prominent being secure programming, network security, and offensive security),
and human aspects, such as privacy and social engineering, are present as well.
The interventions described in SIGCSE and ITiCSE papers predominantly focus on
tertiary education in the USA. The subsequent evaluation mostly consists of
collecting students' subjective perceptions via questionnaires. However, less
than a third of the papers provide supplementary materials for other educators,
and none of the authors published their dataset. Our results provide
orientation in the area, a synthesis of trends, and implications for further
research. Therefore, they are relevant for instructors, researchers, and anyone
new in the field of cybersecurity education. The information we collected and
synthesized from individual papers are organized in a publicly available
dataset.
","[{'version': 'v1', 'created': 'Tue, 26 Nov 2019 16:17:07 GMT'}]",2019-11-27,"[['Švábenský', 'Valdemar', ''], ['Vykopal', 'Jan', ''], ['Čeleda', 'Pavel', '']]","['cybersecurity education', 'systematic literature review', 'systematicmapping study', 'survey', 'SIGCSE community', 'ITiCSE community']"
1094,1304.3550,Gagan Dua,"Gagan Dua, Nitin Gautam, Dharmendar Sharma, Ankit Arora","Replay Attack Prevention in Kerberos Authentication Protocol Using
  Triple Password","12 pages, 2 Figures, 2 Tables","International Journal of Computer Networks & Communications
  (IJCNC) Vol.5, No.2, March 2013",10.5121/ijcnc.2013.5205,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Replay attack and password attacks are serious issues in the Kerberos
authentication protocol. Many ideas have been proposed to prevent these attacks
but they increase complexity of the total Kerberos environment. In this paper
we present an improved method which prevents replay attacks and password
attacks by using Triple password scheme. Three passwords are stored on
Authentication Server and Authentication Server sends two passwords to Ticket
Granting Server (one for Application Server) by encrypting with the secret key
shared between Authentication server and Ticket Granting server.
Similarly,Ticket Granting Server sends one password to Application Server by
encrypting with the secret key shared between TGS and application server.
Meanwhile, Service-Granting-Ticket is transferred to users by encrypting it
with the password that TGS just received from AS. It helps to prevent Replay
attack.
","[{'version': 'v1', 'created': 'Fri, 12 Apr 2013 06:49:23 GMT'}]",2013-04-15,"[['Dua', 'Gagan', ''], ['Gautam', 'Nitin', ''], ['Sharma', 'Dharmendar', ''], ['Arora', 'Ankit', '']]","['Kerberos Protocol', 'Password Attack', 'Authentication Server', 'Replay Attack', 'Ticket Granting Server', 'Application Server']"
1095,1606.08266,Carlos M. Ala\'iz,"Micha\""el Fanuel, Carlos M. Ala\'iz, \'Angela Fern\'andez, Johan A. K.
  Suykens",Magnetic Eigenmaps for the Visualization of Directed Networks,,"Applied and Computational Harmonic Analysis, 44, 1, 189-199 (2018)",10.1016/j.acha.2017.01.004,ESAT-SISTA:16-121,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a framework for the visualization of directed networks relying on
the eigenfunctions of the magnetic Laplacian, called here Magnetic Eigenmaps.
The magnetic Laplacian is a complex deformation of the well-known combinatorial
Laplacian. Features such as density of links and directionality patterns are
revealed by plotting the phases of the first magnetic eigenvectors. An
interpretation of the magnetic eigenvectors is given in connection with the
angular synchronization problem. Illustrations of our method are given for both
artificial and real networks.
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2016 13:30:32 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Oct 2016 12:01:32 GMT'}]",2017-10-25,"[['Fanuel', 'Michaël', ''], ['Alaíz', 'Carlos M.', ''], ['Fernández', 'Ángela', ''], ['Suykens', 'Johan A. K.', '']]","['Magnetic Eigenmaps', 'Magnetic Laplacian', 'Directed Graph', 'Data Visualization']"
1096,1001.3765,Silvija Kokalj-Filipovic,"Silvija Kokalj-Filipovic, Predrag Spasojevic, Emina Soljanin","Doped Fountain Coding for Minimum Delay Data Collection in Circular
  Networks",,"IEEE Journal on Selected Areas in Communications (JSAC), Special
  issue on Network Coding for Wireless Communication Networks, Vol. 27, Nr. 5
  (2009), p. 673-684",10.1109/JSAC.2009.090609,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies decentralized, Fountain and network-coding based
strategies for facilitating data collection in circular wireless sensor
networks, which rely on the stochastic diversity of data storage. The goal is
to allow for a reduced delay collection by a data collector who accesses the
network at a random position and random time. Data dissemination is performed
by a set of relays which form a circular route to exchange source packets. The
storage nodes within the transmission range of the route's relays linearly
combine and store overheard relay transmissions using random decentralized
strategies. An intelligent data collector first collects a minimum set of coded
packets from a subset of storage nodes in its proximity, which might be
sufficient for recovering the original packets and, by using a message-passing
decoder, attempts recovering all original source packets from this set.
Whenever the decoder stalls, the source packet which restarts decoding is
polled/doped from its original source node. The random-walk-based analysis of
the decoding/doping process furnishes the collection delay analysis with a
prediction on the number of required doped packets. The number of doped packets
can be surprisingly small when employed with an Ideal Soliton code degree
distribution and, hence, the doping strategy may have the least collection
delay when the density of source nodes is sufficiently large. Furthermore, we
demonstrate that network coding makes dissemination more efficient at the
expense of a larger collection delay. Not surprisingly, a circular network
allows for a significantly more (analytically and otherwise) tractable
strategies relative to a network whose model is a random geometric graph.
","[{'version': 'v1', 'created': 'Thu, 21 Jan 2010 10:40:33 GMT'}]",2016-11-17,"[['Kokalj-Filipovic', 'Silvija', ''], ['Spasojevic', 'Predrag', ''], ['Soljanin', 'Emina', '']]","['decentralized Fountain codes', 'wireless networks', 'network coding', 'distributed storage', 'data collection']"
1097,1703.05375,Yang Wang,"Yang Wang, Jasmin Ramadani, Stefan Wagner","An Exploratory Study of Applying a Scrum Development Process for
  Safety-Critical Systems","16 pages, 4 figures","PROFES 2017. Lecture Notes in Computer Science, vol 10611.
  Springer, Cham",10.1007/978-3-319-69926-4_23,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Agile techniques recently have received attention in developing
safety-critical systems. However, a lack of empirical knowledge of performing
safety assurance techniques in practice, especially safety analysis into agile
development processes prevents further steps. In this article, we aim at
investigating the feasibility and the effects of our S-Scrum development
process, and stepwise improving and proposing an Optimized S-Scrum development
process for safety-critical systems in a real environment. We conducted an
exploratory case study in a one-year student project ""Smart Home"" at the
University of Stuttgart, Germany. We participated in the project and collected
quantitative and qualitative data from questionnaire, interviews, participant
observation, physical artifacts, and documentation review. Furthermore, we
evaluated the Optimized S-Scrum in industry by conducting interviews. The
first-stage results showed that by integrating STPA (System-Theoretic Process
Analysis) can ensure the safety during each sprint and enhance the safety of
delivered products, while the agility of S-Scrum is slightly worse than the
original Scrum. Six challenges have been explored: Management changes the
team's priorities during an iteration; Disturbed safety-related communication;
Non-functional requirements are determined too late; Insufficient upfront
planning; Insufficient well-defined completion criteria; Excessive time to
perform upfront planning. We investigated further the causalities and
optimizations. The second-stage results revealed that the safety and agility
have been improved after the optimizations. We have gained a positive
assessment and suggestions from industry. The optimized S-Scrum is feasible for
developing safety-critical systems concerning the capability to ensure safety
and the acceptable agility in a student project. Further attempt is still
needed in industrial projects.
","[{'version': 'v1', 'created': 'Wed, 15 Mar 2017 20:20:30 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Jun 2017 20:00:18 GMT'}, {'version': 'v3', 'created': 'Thu, 5 Apr 2018 07:47:29 GMT'}]",2018-04-06,"[['Wang', 'Yang', ''], ['Ramadani', 'Jasmin', ''], ['Wagner', 'Stefan', '']]","['Agile software development', 'safety-critical systems', 'casestudy']"
1098,1812.04911,"Bernd G\""artner","Radoslav Fulek, Bernd G\""artner, Andrey Kupavskii, Pavel Valtr, Uli
  Wagner",The Crossing Tverberg Theorem,"13 pages, 7 figures",,10.4230/LIPIcs.SoCG.2019.38,,cs.CG math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tverberg's theorem is one of the cornerstones of discrete geometry. It states
that, given a set $X$ of at least $(d+1)(r-1)+1$ points in $\mathbb R^d$, one
can find a partition $X=X_1\cup \ldots \cup X_r$ of $X$, such that the convex
hulls of the $X_i$, $i=1,\ldots,r$, all share a common point. In this paper, we
prove a strengthening of this theorem that guarantees a partition which, in
addition to the above, has the property that the boundaries of full-dimensional
convex hulls have pairwise nonempty intersections. Possible generalizations and
algorithmic aspects are also discussed.
  As a concrete application, we show that any $n$ points in the plane in
general position span $\lfloor n/3\rfloor$ vertex-disjoint triangles that are
pairwise crossing, meaning that their boundaries have pairwise nonempty
intersections; this number is clearly best possible. A previous result of
Rebollar et al.\ guarantees $\lfloor n/6\rfloor$ pairwise crossing triangles.
Our result generalizes to a result about simplices in $\mathbb R^d,d\ge2$.
","[{'version': 'v1', 'created': 'Wed, 12 Dec 2018 12:09:47 GMT'}, {'version': 'v2', 'created': 'Sun, 11 Apr 2021 10:47:51 GMT'}]",2021-04-13,"[['Fulek', 'Radoslav', ''], ['Gärtner', 'Bernd', ''], ['Kupavskii', 'Andrey', ''], ['Valtr', 'Pavel', ''], ['Wagner', 'Uli', '']]","['Discrete geometry', 'Tverberg theorem', 'Crossing Tverberg theorem']"
1099,1511.09066,Richard McClatchey,"Kamran Munir, Khawar Hasham Ahmad and Richard McClatchey","Development of a Large-scale Neuroimages and Clinical Variables Data
  Atlas in the neuGRID4You (N4U) project","35 pages, 15 figures, Journal of Biomedical Informatics, 2015",,10.1016/j.jbi.2015.08.004,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Exceptional growth in the availability of large-scale clinical imaging
datasets has led to the development of computational infrastructures offering
scientists access to image repositories and associated clinical variables data.
The EU FP7 neuGRID and its follow on neuGRID4You (N4U) project is a leading
e-Infrastructure where neuroscientists can find core services and resources for
brain image analysis. The core component of this e-Infrastructure is the N4U
Virtual Laboratory, which offers an easy access for neuroscientists to a wide
range of datasets and algorithms, pipelines, computational resources, services,
and associated support services. The foundation of this virtual laboratory is a
massive data store plus information services called the Data Atlas that stores
datasets, clinical study data, data dictionaries, algorithm/pipeline
definitions, and provides interfaces for parameterised querying so that
neuroscientists can perform analyses on required datasets. This paper presents
the overall design and development of the Data Atlas, its associated datasets
and indexing and a set of retrieval services that originated from the
development of the N4U Virtual Laboratory in the EU FP7 N4U project in the
light of user requirements.
","[{'version': 'v1', 'created': 'Sun, 29 Nov 2015 19:14:53 GMT'}]",2015-12-01,"[['Munir', 'Kamran', ''], ['Ahmad', 'Khawar Hasham', ''], ['McClatchey', 'Richard', '']]","['Data atlas', 'neuroscience; data integration', 'data analysis; information retrieval']"
1100,2102.07614,Sanjay Pant,"Gareth Jones, Jim Parr, Perumal Nithiarasu, Sanjay Pant","A proof of concept study for machine learning application to stenosis
  detection",,Medical & Biological Engineering & Computing (2021),10.1007/s11517-021-02424-9,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This proof of concept (PoC) assesses the ability of machine learning (ML)
classifiers to predict the presence of a stenosis in a three vessel arterial
system consisting of the abdominal aorta bifurcating into the two common
iliacs. A virtual patient database (VPD) is created using one-dimensional pulse
wave propagation model of haemodynamics. Four different machine learning (ML)
methods are used to train and test a series of classifiers -- both binary and
multiclass -- to distinguish between healthy and unhealthy virtual patients
(VPs) using different combinations of pressure and flow-rate measurements. It
is found that the ML classifiers achieve specificities larger than 80% and
sensitivities ranging from 50-75%. The most balanced classifier also achieves
an area under the receiver operative characteristic curve of 0.75,
outperforming approximately 20 methods used in clinical practice, and thus
placing the method as moderately accurate. Other important observations from
this study are that: i) few measurements can provide similar classification
accuracies compared to the case when more/all the measurements are used; ii)
some measurements are more informative than others for classification; and iii)
a modification of standard methods can result in detection of not only the
presence of stenosis, but also the stenosed vessel.
","[{'version': 'v1', 'created': 'Thu, 11 Feb 2021 19:39:33 GMT'}]",2021-08-31,"[['Jones', 'Gareth', ''], ['Parr', 'Jim', ''], ['Nithiarasu', 'Perumal', ''], ['Pant', 'Sanjay', '']]","['Arterial disease diagnosis', 'machine learning', 'virtual patient database', 'pulse wave haemodynamics']"
1101,1504.07482,Robin Haunschild,"Robin Haunschild, Lutz Bornmann, and Loet Leydesdorff","Networks of reader and country status: An analysis of Mendeley reader
  statistics","26 pages, 6 figures (also web-based startable), and 2 tables","PeerJ CompSci, 32 (2015)",10.7717/peerj-cs.32,,cs.DL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The number of papers published in journals indexed by the Web of Science core
collection is steadily increasing. In recent years, nearly two million new
papers were published each year; somewhat more than one million papers when
primary research papers are considered only (articles and reviews are the
document types where primary research is usually reported or reviewed).
However, who reads these papers? More precisely, which groups of researchers
from which (self-assigned) scientific disciplines and countries are reading
these papers? Is it possible to visualize readership patterns for certain
countries, scientific disciplines, or academic status groups? One popular
method to answer these questions is a network analysis. In this study, we
analyze Mendeley readership data of a set of 1,133,224 articles and 64,960
reviews with publication year 2012 to generate three different kinds of
networks: (1) The network based on disciplinary affiliations of Mendeley
readers contains four groups: (i) biology, (ii) social science and humanities
(including relevant computer science), (iii) bio-medical sciences, and (iv)
natural science and engineering. In all four groups, the category with the
addition ""miscellaneous"" prevails. (2) The network of co-readers in terms of
professional status shows that a common interest in papers is mainly shared
among PhD students, Master's students, and postdocs. (3) The country network
focusses on global readership patterns: a group of 53 nations is identified as
core to the scientific enterprise, including Russia and China as well as two
thirds of the OECD (Organisation for Economic Co-operation and Development)
countries.
","[{'version': 'v1', 'created': 'Tue, 28 Apr 2015 14:08:06 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Jul 2015 14:49:51 GMT'}, {'version': 'v3', 'created': 'Fri, 16 Oct 2015 13:32:40 GMT'}]",2015-11-17,"[['Haunschild', 'Robin', ''], ['Bornmann', 'Lutz', ''], ['Leydesdorff', 'Loet', '']]","['Mendeley', 'network', 'Pajek', 'VOSviewer', 'bibliometrics', 'altmetrics']"
1102,1211.4133,Ibrahim El Bitar,"Ibrahim El Bitar, Fatima-Zahra Belouadha, Ounsa Roudies",A Logic and Adaptive Approach for Efficient Diagnosis Systems using CBR,"5 pages,3 figures, 1 table","http://www.ijcaonline.org/archives/volume39/number15/4893-7393
  year: 2012",10.5120/4893-7393,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Case Based Reasoning (CBR) is an intelligent way of thinking based on
experience and capitalization of already solved cases (source cases) to find a
solution to a new problem (target case). Retrieval phase consists on
identifying source cases that are similar to the target case. This phase may
lead to erroneous results if the existing knowledge imperfections are not taken
into account. This work presents a novel solution based on Fuzzy logic
techniques and adaptation measures which aggregate weighted similarities to
improve the retrieval results. To confirm the efficiency of our solution, we
have applied it to the industrial diagnosis domain. The obtained results are
more efficient results than those obtained by applying typical measures.
","[{'version': 'v1', 'created': 'Sat, 17 Nov 2012 15:52:55 GMT'}]",2012-11-20,"[['Bitar', 'Ibrahim El', ''], ['Belouadha', 'Fatima-Zahra', ''], ['Roudies', 'Ounsa', '']]","['CBR', 'Retrieve', 'Fuzzy logic', 'Adaptation', 'knowledge']"
1103,1810.09012,Saad Nadeem,"Ji Hwan Park, Saad Nadeem, Seyedkoosha Mirhosseini and Arie Kaufman",C2A: Crowd Consensus Analytics for Virtual Colonoscopy,"IEEE Conference on Visual Analytics Science and Technology (VAST),
  pp. 21-30, 2016 (10 pages, 11 figures)","IEEE Conference on Visual Analytics Science and Technology (VAST),
  pp. 21-30, 2016",10.1109/VAST.2016.7883508,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a medical crowdsourcing visual analytics platform called C{$^2$}A
to visualize, classify and filter crowdsourced clinical data. More
specifically, C$^2$A is used to build consensus on a clinical diagnosis by
visualizing crowd responses and filtering out anomalous activity. Crowdsourcing
medical applications have recently shown promise where the non-expert users
(the crowd) were able to achieve accuracy similar to the medical experts. This
has the potential to reduce interpretation/reading time and possibly improve
accuracy by building a consensus on the findings beforehand and letting the
medical experts make the final diagnosis. In this paper, we focus on a virtual
colonoscopy (VC) application with the clinical technicians as our target users,
and the radiologists acting as consultants and classifying segments as benign
or malignant. In particular, C$^2$A is used to analyze and explore crowd
responses on video segments, created from fly-throughs in the virtual colon.
C$^2$A provides several interactive visualization components to build crowd
consensus on video segments, to detect anomalies in the crowd data and in the
VC video segments, and finally, to improve the non-expert user's work quality
and performance by A/B testing for the optimal crowdsourcing platform and
application-specific parameters. Case studies and domain experts feedback
demonstrate the effectiveness of our framework in improving workers' output
quality, the potential to reduce the radiologists' interpretation time, and
hence, the potential to improve the traditional clinical workflow by marking
the majority of the video segments as benign based on the crowd consensus.
","[{'version': 'v1', 'created': 'Sun, 21 Oct 2018 19:33:33 GMT'}]",2018-10-23,"[['Park', 'Ji Hwan', ''], ['Nadeem', 'Saad', ''], ['Mirhosseini', 'Seyedkoosha', ''], ['Kaufman', 'Arie', '']]","['Crowdsourcing', 'virtual colonoscopy', 'visual analytics', 'biomedical applications']"
1104,1509.05498,Renyuan Zhang,"Renyuan Zhang, Kai Cai, and W.M. Wonham","Supervisor Localization of Discrete-Event Systems under Partial
  Observation",,"Automatica, vol. 81, pp. 142-147, 2017",10.1016/j.automatica.2017.03.018,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently we developed supervisor localization, a top-down approach to
distributed control of discrete-event systems. Its essence is the allocation of
monolithic (global) control action among the local control strategies of
individual agents. In this paper, we extend supervisor localization by
considering partial observation; namely not all events are observable.
Specifically, we employ the recently proposed concept of relative observability
to compute a partial-observation monolithic supervisor, and then design a
suitable localization procedure to decompose the supervisor into a set of local
controllers. In the resulting local controllers, only observable events can
cause state change. Further, to deal with large-scale systems, we combine the
partial-observation supervisor localization with an efficient architectural
synthesis approach: first compute a heterarchical array of partial-observation
decentralized supervisors and coordinators, and then localize each of these
supervisors/coordinators into local controllers.
","[{'version': 'v1', 'created': 'Fri, 18 Sep 2015 03:43:27 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Oct 2015 08:27:18 GMT'}, {'version': 'v3', 'created': 'Mon, 1 Feb 2016 02:35:03 GMT'}, {'version': 'v4', 'created': 'Tue, 2 Feb 2016 01:56:10 GMT'}, {'version': 'v5', 'created': 'Tue, 28 Jun 2016 02:16:36 GMT'}, {'version': 'v6', 'created': 'Tue, 19 Jun 2018 03:35:43 GMT'}]",2018-06-20,"[['Zhang', 'Renyuan', ''], ['Cai', 'Kai', ''], ['Wonham', 'W. M.', '']]","['Discrete-event systems', 'supervisory control', 'supervisor localization', 'partial observation', 'automata']"
1105,2102.06491,Thanasis Zoumpekas,"Thanasis Zoumpekas, Anna Puig, Maria Salam\'o, David
  Garc\'ia-Sell\'es, Laura Blanco Nu\~nez, Marta Guinau",End-to-End Intelligent Framework for Rockfall Detection,,,10.1002/int.22557,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Rockfall detection is a crucial procedure in the field of geology, which
helps to reduce the associated risks. Currently, geologists identify rockfall
events almost manually utilizing point cloud and imagery data obtained from
different caption devices such as Terrestrial Laser Scanner or digital cameras.
Multi-temporal comparison of the point clouds obtained with these techniques
requires a tedious visual inspection to identify rockfall events which implies
inaccuracies that depend on several factors such as human expertise and the
sensibility of the sensors. This paper addresses this issue and provides an
intelligent framework for rockfall event detection for any individual working
in the intersection of the geology domain and decision support systems. The
development of such an analysis framework poses significant research challenges
and justifies intensive experimental analysis. In particular, we propose an
intelligent system that utilizes multiple machine learning algorithms to detect
rockfall clusters of point cloud data. Due to the extremely imbalanced nature
of the problem, a plethora of state-of-the-art resampling techniques
accompanied by multiple models and feature selection procedures are being
investigated. Various machine learning pipeline combinations have been
benchmarked and compared applying well-known metrics to be incorporated into
our system. Specifically, we developed statistical and machine learning
techniques and applied them to analyze point cloud data extracted from
Terrestrial Laser Scanner in two distinct case studies, involving different
geological contexts: the basaltic cliff of Castellfollit de la Roca and the
conglomerate Montserrat Massif, both located in Spain. Our experimental data
suggest that some of the above-mentioned machine learning pipelines can be
utilized to detect rockfall incidents on mountain walls, with experimentally
proven accuracy.
","[{'version': 'v1', 'created': 'Fri, 12 Feb 2021 12:48:17 GMT'}]",2022-09-29,"[['Zoumpekas', 'Thanasis', ''], ['Puig', 'Anna', ''], ['Salamó', 'Maria', ''], ['García-Sellés', 'David', ''], ['Nuñez', 'Laura Blanco', ''], ['Guinau', 'Marta', '']]","['Machine Learning', 'Imbalanced Classification', 'Rockfall Monitoring', 'Geology', 'Expert Systems']"
1106,1204.4829,Wajeb Gharibi,Wajeb Gharibi,"Improved Balas and Mazzola Linearization for Quadratic 0-1 Programs with
  Application in a New Cutting Plane Algorithm",,"Int. J. Communications, Network and System Sciences, 2012",10.4236/ijcns.2012,,cs.DS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Balas and Mazzola linearization (BML) is widely used in devising cutting
plane algorithms for quadratic 0-1 programs. In this article, we improve BML by
first strengthening the primal formulation of BML and then considering the dual
formulation. Additionally, a new cutting plane algorithm is proposed.
","[{'version': 'v1', 'created': 'Sat, 21 Apr 2012 17:21:39 GMT'}]",2012-04-24,"[['Gharibi', 'Wajeb', '']]","['Quadratic Program', 'Integer program', 'Linearization', 'Cutting plane algorithm']"
1107,1811.01611,Young Myoung Ko,Yongkyu Cho and Young Myoung Ko,"Stabilizing the virtual response time in single-server processor sharing
  queues with slowly time-varying arrival rates",,"Annals of Operations Research, 293 (2020), 27-55",10.1007/s10479-019-03511-9,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by the work of Whitt, who studied stabilization of the mean virtual
waiting time (excluding service time) in a $GI_t/GI_t/1/FCFS$ queue, this paper
investigates the stabilization of the mean virtual response time in a
single-server processor sharing (PS) queueing system with a time-varying
arrival rate and a service rate control (a $GI_t/GI_t/1/PS$ queue). We propose
and compare a modified square-root (SR) control and a difference-matching (DM)
control to stabilize the mean virtual response time of a $GI_t/GI_t/1/PS$
queue. Extensive simulation studies with various settings of arrival processes
and service times show that the DM control outperforms the SR control for
heavy-traffic conditions, and that the SR control performs better for
light-traffic conditions.
","[{'version': 'v1', 'created': 'Mon, 5 Nov 2018 11:04:08 GMT'}]",2020-09-09,"[['Cho', 'Yongkyu', ''], ['Ko', 'Young Myoung', '']]","['Stabilizing performance', 'Nonstationary queues', 'Processorsharing', 'Service rate control', 'Queueing simulation']"
1108,1403.4608,Justin Cheng,"Justin Cheng, Lada A. Adamic, P. Alex Dow, Jon Kleinberg, Jure
  Leskovec",Can Cascades be Predicted?,,,10.1145/2566486.2567997,,cs.SI physics.soc-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  On many social networking web sites such as Facebook and Twitter, resharing
or reposting functionality allows users to share others' content with their own
friends or followers. As content is reshared from user to user, large cascades
of reshares can form. While a growing body of research has focused on analyzing
and characterizing such cascades, a recent, parallel line of work has argued
that the future trajectory of a cascade may be inherently unpredictable. In
this work, we develop a framework for addressing cascade prediction problems.
On a large sample of photo reshare cascades on Facebook, we find strong
performance in predicting whether a cascade will continue to grow in the
future. We find that the relative growth of a cascade becomes more predictable
as we observe more of its reshares, that temporal and structural features are
key predictors of cascade size, and that initially, breadth, rather than depth
in a cascade is a better indicator of larger cascades. This prediction
performance is robust in the sense that multiple distinct classes of features
all achieve similar performance. We also discover that temporal features are
predictive of a cascade's eventual shape. Observing independent cascades of the
same content, we find that while these cascades differ greatly in size, we are
still able to predict which ends up the largest.
","[{'version': 'v1', 'created': 'Tue, 18 Mar 2014 20:00:55 GMT'}]",2014-03-20,"[['Cheng', 'Justin', ''], ['Adamic', 'Lada A.', ''], ['Dow', 'P. Alex', ''], ['Kleinberg', 'Jon', ''], ['Leskovec', 'Jure', '']]","['Information diffusion', 'cascade prediction', 'contagion']"
1109,1807.10990,Chen Li,"Chen Li, Mai Xu, Xinzhe Du and Zulin Wang","Bridge the Gap Between VQA and Human Behavior on Omnidirectional Video:
  A Large-Scale Dataset and a Deep Learning Model",Accepted by ACM MM 2018,,10.1145/3240508.3240581,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Omnidirectional video enables spherical stimuli with the $360 \times 180^
\circ$ viewing range. Meanwhile, only the viewport region of omnidirectional
video can be seen by the observer through head movement (HM), and an even
smaller region within the viewport can be clearly perceived through eye
movement (EM). Thus, the subjective quality of omnidirectional video may be
correlated with HM and EM of human behavior. To fill in the gap between
subjective quality and human behavior, this paper proposes a large-scale visual
quality assessment (VQA) dataset of omnidirectional video, called VQA-OV, which
collects 60 reference sequences and 540 impaired sequences. Our VQA-OV dataset
provides not only the subjective quality scores of sequences but also the HM
and EM data of subjects. By mining our dataset, we find that the subjective
quality of omnidirectional video is indeed related to HM and EM. Hence, we
develop a deep learning model, which embeds HM and EM, for objective VQA on
omnidirectional video. Experimental results show that our model significantly
improves the state-of-the-art performance of VQA on omnidirectional video.
","[{'version': 'v1', 'created': 'Sun, 29 Jul 2018 02:03:14 GMT'}]",2018-07-31,"[['Li', 'Chen', ''], ['Xu', 'Mai', ''], ['Du', 'Xinzhe', ''], ['Wang', 'Zulin', '']]","['Omnidirectional video', 'visual quality assessment', 'human behavior']"
1110,1808.02122,Ali Pour Yazdanpanah,"Ali Pour Yazdanpanah, Onur Afacan, Simon K. Warfield",Non-Learning based Deep Parallel MRI Reconstruction (NLDpMRI),,,10.1117/12.2511653,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fast data acquisition in Magnetic Resonance Imaging (MRI) is vastly in demand
and scan time directly depends on the number of acquired k-space samples.
Recently, the deep learning-based MRI reconstruction techniques were suggested
to accelerate MR image acquisition. The most common issues in any deep
learning-based MRI reconstruction approaches are generalizability and
transferability. For different MRI scanner configurations using these
approaches, the network must be trained from scratch every time with new
training dataset, acquired under new configurations, to be able to provide good
reconstruction performance. Here, we propose a new generalized parallel imaging
method based on deep neural networks called NLDpMRI to reduce any structured
aliasing ambiguities related to the different k-space undersampling patterns
for accelerated data acquisition. Two loss functions including non-regularized
and regularized are proposed for parallel MRI reconstruction using deep network
optimization and we reconstruct MR images by optimizing the proposed loss
functions over the network parameters. Unlike any deep learning-based MRI
reconstruction approaches, our method doesn't include any training step that
the network learns from a large number of training samples and it only needs
the single undersampled multi-coil k-space data for reconstruction. Also, the
proposed method can handle k-space data with different undersampling patterns,
and the different number of coils. Experimental results show that the proposed
method outperforms the current state-of-the-art GRAPPA method and the deep
learning-based variational network method.
","[{'version': 'v1', 'created': 'Mon, 6 Aug 2018 21:26:06 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Oct 2018 17:15:39 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Mar 2019 23:22:59 GMT'}]",2019-03-20,"[['Yazdanpanah', 'Ali Pour', ''], ['Afacan', 'Onur', ''], ['Warfield', 'Simon K.', '']]","['Parallel imaging', 'accelerated MRI', 'image reconstruction', 'deep learning']"
1111,1312.2578,Cong Li,"Cong Li, Michael Georgiopoulos, Georgios C. Anagnostopoulos",Kernel-based Distance Metric Learning in the Output Space,"11 pages, 7 figures, appeared in the Proceedings of 2013
  International Joint Conference on Neural Networks (IJCNN)",,10.1109/IJCNN.2013.6706862,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present two related, kernel-based Distance Metric Learning
(DML) methods. Their respective models non-linearly map data from their
original space to an output space, and subsequent distance measurements are
performed in the output space via a Mahalanobis metric. The dimensionality of
the output space can be directly controlled to facilitate the learning of a
low-rank metric. Both methods allow for simultaneous inference of the
associated metric and the mapping to the output space, which can be used to
visualize the data, when the output space is 2- or 3-dimensional. Experimental
results for a collection of classification tasks illustrate the advantages of
the proposed methods over other traditional and kernel-based DML approaches.
","[{'version': 'v1', 'created': 'Mon, 9 Dec 2013 20:58:16 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Apr 2014 20:08:47 GMT'}]",2014-04-30,"[['Li', 'Cong', ''], ['Georgiopoulos', 'Michael', ''], ['Anagnostopoulos', 'Georgios C.', '']]","['Distance Metric Learning', 'Kernel Methods', 'Reproducing Kernel Hilbert Space for Vector-valuedFunctions']"
1112,1808.06928,W B Langdon,W. B. Langdon,The Distribution of Reversible Functions is Normal,"Published as Chapter 11, pp173-187, in Genetic Programming Theory and
  Practice, 2003, Rick L. Riolo and Bill Worzel (editors)",,10.1007/978-1-4419-8983-3_11,,cs.ET cs.NE quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The distribution of reversible programs tends to a limit as their size
increases. For problems with a Hamming distance fitness function the limiting
distribution is binomial with an exponentially small chance (but non~zero)
chance of perfect solution. Sufficiently good reversible circuits are more
common. Expected RMS error is also calculated. Random unitary matrices may
suggest possible extension to quantum computing. Using the genetic programming
(GP) benchmark, the six multiplexor, circuits of Toffoli gates are shown to
give a fitness landscape amenable to evolutionary search. Minimal CCNOT
solutions to the six multiplexer are found but larger circuits are more
evolvable.
","[{'version': 'v1', 'created': 'Sat, 18 Aug 2018 13:06:25 GMT'}]",2018-08-22,"[['Langdon', 'W. B.', '']]","['fitness landscape', 'evolutionary computation', 'genetic algorithms', 'geneticprogramming', 'quantum computing', 'CCNOT', 'Toffoli', 'low power consumption']"
1113,1310.1032,David Yllanes,"Janus Collaboration: M. Baity-Jesi, R. A. Ba\~nos, A. Cruz, L. A.
  Fernandez, J. M. Gil-Narvion, A. Gordillo-Guerrero, D. I\~niguez, A.
  Maiorano, F. Mantovani, E. Marinari, V. Martin-Mayor, J. Monforte-Garcia, A.
  Mu\~noz Sudupe, D. Navarro, G. Parisi, S. Perez-Gaviro, M. Pivanti, F.
  Ricci-Tersenghi, J. J. Ruiz-Lorenzo, S. F. Schifano, B. Seoane, A. Tarancon,
  R. Tripiccione, D. Yllanes","Janus II: a new generation application-driven computer for spin-system
  simulations","28 pages, 6 figures",Computer Physics Communications 185 (2014) 550-559,10.1016/j.cpc.2013.10.019,,cs.AR cond-mat.dis-nn cond-mat.stat-mech physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the architecture, the development and the implementation
of Janus II, a new generation application-driven number cruncher optimized for
Monte Carlo simulations of spin systems (mainly spin glasses). This domain of
computational physics is a recognized grand challenge of high-performance
computing: the resources necessary to study in detail theoretical models that
can make contact with experimental data are by far beyond those available using
commodity computer systems. On the other hand, several specific features of the
associated algorithms suggest that unconventional computer architectures, which
can be implemented with available electronics technologies, may lead to order
of magnitude increases in performance, reducing to acceptable values on human
scales the time needed to carry out simulation campaigns that would take
centuries on commercially available machines. Janus II is one such machine,
recently developed and commissioned, that builds upon and improves on the
successful JANUS machine, which has been used for physics since 2008 and is
still in operation today. This paper describes in detail the motivations behind
the project, the computational requirements, the architecture and the
implementation of this new machine and compares its expected performances with
those of currently available commercial systems.
","[{'version': 'v1', 'created': 'Thu, 3 Oct 2013 16:49:55 GMT'}]",2013-12-03,"[['Janus Collaboration', '', ''], ['Baity-Jesi', 'M.', ''], ['Baños', 'R. A.', ''], ['Cruz', 'A.', ''], ['Fernandez', 'L. A.', ''], ['Gil-Narvion', 'J. M.', ''], ['Gordillo-Guerrero', 'A.', ''], ['Iñiguez', 'D.', ''], ['Maiorano', 'A.', ''], ['Mantovani', 'F.', ''], ['Marinari', 'E.', ''], ['Martin-Mayor', 'V.', ''], ['Monforte-Garcia', 'J.', ''], ['Sudupe', 'A. Muñoz', ''], ['Navarro', 'D.', ''], ['Parisi', 'G.', ''], ['Perez-Gaviro', 'S.', ''], ['Pivanti', 'M.', ''], ['Ricci-Tersenghi', 'F.', ''], ['Ruiz-Lorenzo', 'J. J.', ''], ['Schifano', 'S. F.', ''], ['Seoane', 'B.', ''], ['Tarancon', 'A.', ''], ['Tripiccione', 'R.', ''], ['Yllanes', 'D.', '']]","['Spin glass', 'Monte Carlo', 'Application-driven computers', 'FPGAcomputing']"
1114,1903.12620,Marcin Jurdzi\'nski,"Laure Daviaud, Marcin Jurdzi\'nski, Karoliina Lehtinen",Alternating Weak Automata from Universal Trees,,,10.4230/LIPIcs.CONCUR.2019.18,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An improved translation from alternating parity automata on infinite words to
alternating weak automata is given. The blow-up of the number of states is
related to the size of the smallest universal ordered trees and hence it is
quasi-polynomial, and only polynomial if the asymptotic number of priorities is
logarithmic in the number of states. This is an exponential improvement on the
translation of Kupferman and Vardi (2001) and a quasi-polynomial improvement on
the translation of Boker and Lehtinen (2018). Any slightly better such
translation would (if---like all presently known such translations---it is
efficiently constructive) lead to algorithms for solving parity games that are
asymptotically faster in the worst case than the current state of the art
(Calude, Jain, Khoussainov, Li, and Stephan, 2017; Jurdzi\'nski and Lazi\'c,
2017; and Fearnley, Jain, Schewe, Stephan, and Wojtczak, 2017), and hence it
would yield a significant breakthrough.
","[{'version': 'v1', 'created': 'Fri, 29 Mar 2019 17:11:43 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Jul 2019 16:53:22 GMT'}]",2020-01-15,"[['Daviaud', 'Laure', ''], ['Jurdziński', 'Marcin', ''], ['Lehtinen', 'Karoliina', '']]","['alternating automata', 'weak automata', 'Büchi automata', 'parity automata', 'parity games', 'universal trees']"
1115,1707.08061,Yuansong Qiao,"Zhao Liu, Niall Murray, Brian Lee, Enda Fallon and Yuansong Qiao","MVP2P: Layer-Dependency-Aware Live MVC Video Streaming over Peer-to-Peer
  Networks",,Signal Processing: Image Communication 65 (2018) 173-186,10.1016/j.image.2018.04.004,,cs.MM cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multiview video supports observing a scene from different viewpoints. The
Joint Video Team (JVT) developed H.264/MVC to enhance the compression
efficiency for multiview video, however, MVC encoded multiview video (MVC
video) still requires high bitrates for transmission. This paper investigates
live MVC video streaming over Peer-to-Peer (P2P) networks. The goal is to
minimize the server bandwidth costs whist ensuring high streaming quality to
peers. MVC employs intra-view and inter-view prediction structures, which leads
to a complicated layer dependency relationship. As the peers' outbound
bandwidth is shared while supplying all the MVC video layers, the bandwidth
allocation to one MVC layer affects the available outbound bandwidth of the
other layers. To optimise the utilisation of the peers' outbound bandwidth for
providing video layers, a maximum flow based model is proposed which considers
the MVC video layer dependency and the layer supplying relationship between
peers. Based on the model, a layer dependency aware live MVC video streaming
method over a BitTorrent-like P2P network is proposed, named MVP2P. The key
components of MVP2P include a chunk scheduling strategy and a peer selection
strategy for receiving peers, and a bandwidth scheduling algorithm for
supplying peers. To evaluate the efficiency of the proposed solution, MVP2P is
compared with existing methods considering the constraints of peer bandwidth,
peer numbers, view switching rates, and peer churns. The test results show that
MVP2P significantly outperforms the existing methods.
","[{'version': 'v1', 'created': 'Tue, 25 Jul 2017 16:03:55 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Apr 2018 23:46:11 GMT'}]",2018-04-18,"[['Liu', 'Zhao', ''], ['Murray', 'Niall', ''], ['Lee', 'Brian', ''], ['Fallon', 'Enda', ''], ['Qiao', 'Yuansong', '']]","['MVC Video Streaming', 'Peer-to-Peer Streaming', 'Layered Video Streaming', 'Live Video Streaming', 'Multiview Video']"
1116,1111.3321,Leslie Ann Goldberg,"Josep D\'iaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby,
  Maria Serna and Paul G. Spirakis",Approximating Fixation Probabilities in the Generalized Moran Process,"updated to the final version, which appeared in Algorithmica","Algorithmica May 2014, Volume 69, Issue 1, pp 78-91",10.1007/s00453-012-9722-7,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the Moran process, as generalized by Lieberman, Hauert and Nowak
(Nature, 433:312--316, 2005). A population resides on the vertices of a finite,
connected, undirected graph and, at each time step, an individual is chosen at
random with probability proportional to its assigned 'fitness' value. It
reproduces, placing a copy of itself on a neighbouring vertex chosen uniformly
at random, replacing the individual that was there. The initial population
consists of a single mutant of fitness $r>0$ placed uniformly at random, with
every other vertex occupied by an individual of fitness 1. The main quantities
of interest are the probabilities that the descendants of the initial mutant
come to occupy the whole graph (fixation) and that they die out (extinction);
almost surely, these are the only possibilities. In general, exact computation
of these quantities by standard Markov chain techniques requires solving a
system of linear equations of size exponential in the order of the graph so is
not feasible. We show that, with high probability, the number of steps needed
to reach fixation or extinction is bounded by a polynomial in the number of
vertices in the graph. This bound allows us to construct fully polynomial
randomized approximation schemes (FPRAS) for the probability of fixation (when
$r\geq 1$) and of extinction (for all $r>0$).
","[{'version': 'v1', 'created': 'Mon, 14 Nov 2011 18:51:42 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Feb 2012 14:45:48 GMT'}, {'version': 'v3', 'created': 'Thu, 20 Mar 2014 11:08:56 GMT'}]",2014-03-21,"[['Díaz', 'Josep', ''], ['Goldberg', 'Leslie Ann', ''], ['Mertzios', 'George B.', ''], ['Richerby', 'David', ''], ['Serna', 'Maria', ''], ['Spirakis', 'Paul G.', '']]","['Evolutionary dynamics', 'Markov-chain Monte Carlo', 'approximation algorithm']"
1117,1512.03251,Evgeny Nikulchev,"V.N. Petrushin, E.V. Nikulchev, D.A. Korolev",Histogram Arithmetic under Uncertainty of Probability Density Function,10 pages,Applied Mathematical Sciences 9(2015) 7043-7052,10.12988/ams.2015.510644,,cs.NA stat.CO,http://creativecommons.org/licenses/by-sa/4.0/,"  In this article we propose a method of performing arithmetic operations on
varia-bles with unknown distribution. The approach to the evaluation results of
arithme-tic operations can select probability intervals of the algebraic
equations and their systems solutions, of differential equations and their
systems in case of histogram evaluation of the empirical density distributions
of random parameters.
","[{'version': 'v1', 'created': 'Thu, 10 Dec 2015 13:42:35 GMT'}]",2015-12-11,"[['Petrushin', 'V. N.', ''], ['Nikulchev', 'E. V.', ''], ['Korolev', 'D. A.', '']]","['histogram arithmetic', 'reliability of the histogram', 'the distribution function', 'graphical methods', 'the method of constructing a histogram   1 Introduction']"
1118,2110.10857,Blaise Pascal Tine,"Blaise Tine, Fares Elsabbagh, Krishna Yalamarthy, Hyesoon Kim",Vortex: Extending the RISC-V ISA for GPGPU and 3D-GraphicsResearch,,"MICRO'21: 54th Annual IEEE/ACM International Symposium on
  Microarchitecture (MICRO '21), October 18--22, 2021, Virtual Event, Greece",,,cs.AR,http://creativecommons.org/licenses/by/4.0/,"  The importance of open-source hardware and software has been increasing.
However, despite GPUs being one of the more popular accelerators across various
applications, there is very little open-source GPU infrastructure in the public
domain. We argue that one of the reasons for the lack of open-source
infrastructure for GPUs is rooted in the complexity of their ISA and software
stacks.In this work, we first propose an ISA extension to RISC-V that supports
GPGPUs and graphics. The main goal of the ISA extension proposal is to minimize
the ISA changes so that the corresponding changes to the open-source ecosystem
are also minimal, which makes for a sustainable development ecosystem. To
demonstrate the feasibility of the minimally extended RISC-V ISA, we
implemented the complete software and hardware stacks of Vortex on FPGA. Vortex
is a PCIe-based soft GPU that supports OpenCL and OpenGL.Vortex can be used in
a variety of applications, including machine learning, graph analytics, and
graphics rendering. Vortex can scale up to 32 cores on an Altera Stratix 10
FPGA, delivering a peak performance of 25.6 GFlops at 200 Mhz.
","[{'version': 'v1', 'created': 'Thu, 21 Oct 2021 02:39:54 GMT'}]",2021-10-22,"[['Tine', 'Blaise', ''], ['Elsabbagh', 'Fares', ''], ['Yalamarthy', 'Krishna', ''], ['Kim', 'Hyesoon', '']]","['reconfigurable computing', 'computer graphics', 'memory systems']"
1119,1903.09850,Marcello Balduccini,Marcello Balduccini and Emily LeBlanc,Action-Centered Information Retrieval,"Under consideration in Theory and Practice of Logic Programming
  (TPLP)",Theory and Practice of Logic Programming 20 (2020) 249-272,10.1017/S1471068419000097,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information Retrieval (IR) aims at retrieving documents that are most
relevant to a query provided by a user. Traditional techniques rely mostly on
syntactic methods. In some cases, however, links at a deeper semantic level
must be considered. In this paper, we explore a type of IR task in which
documents describe sequences of events, and queries are about the state of the
world after such events. In this context, successfully matching documents and
query requires considering the events' possibly implicit, uncertain effects and
side-effects. We begin by analyzing the problem, then propose an action
language based formalization, and finally automate the corresponding IR task
using Answer Set Programming.
","[{'version': 'v1', 'created': 'Sat, 23 Mar 2019 17:34:25 GMT'}]",2020-02-19,"[['Balduccini', 'Marcello', ''], ['LeBlanc', 'Emily', '']]","['Reasoning about Actions and Change', 'Answer Set Programming', 'Information Retrieval']"
1120,2003.13199,Frank Nielsen,Frank Nielsen,"A note on Onicescu's informational energy and correlation coefficient in
  exponential families","13 pages, 2 tables","Foundations 2022, 2(2), 362-376",10.3390/foundations2020025,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The informational energy of Onicescu is a positive quantity that measures the
amount of uncertainty of a random variable. But contrary to Shannon's entropy,
the informational energy increases when randomness decreases. We report
closed-form formula for Onicescu's informational energy and its associated
correlation coefficient when the probability distributions belong to an
exponential family. We show how to instantiate the generic formula for several
common exponential families.
","[{'version': 'v1', 'created': 'Mon, 30 Mar 2020 03:18:21 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Apr 2020 04:40:22 GMT'}, {'version': 'v3', 'created': 'Sat, 5 Feb 2022 00:47:08 GMT'}]",2022-04-21,"[['Nielsen', 'Frank', '']]","['Shannon’s entropy', 'Onicescu’s informational energy', 'Onicescu’s correlation coefficient', 'exponential families', 'Cauchy-Schwarz divergence']"
1121,1810.11732,Labib Terrissa,"Safa Meraghni, Labib Sadek Terrissa, Soheyb Ayad, Noureddine Zerhouni,
  Christophe Varnier",Post-prognostics decision in Cyber-Physical Systems,"6 pages, 4 figures, 2018 IEEE Ic_ASET",,10.1109/ASET.2018.8379859,,cs.CY cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Prognostics and Health Management (PHM) offers several benefits for
predictive maintenance. It predicts the future behavior of a system as well as
its Remaining Useful Life (RUL). This RUL is used to planned the maintenance
operation to avoid the failure, the stop time and optimize the cost of the
maintenance and failure. However, with the development of the industry the
assets are nowadays distributed this is why the PHM needs to be developed using
the new IT. In our work we propose a PHM solution based on Cyber physical
system where the physical side is connected to the analyze process of the PHM
which are developed in the cloud to be shared and to benefit of the cloud
characteristics
","[{'version': 'v1', 'created': 'Sat, 27 Oct 2018 23:47:39 GMT'}]",2018-10-30,"[['Meraghni', 'Safa', ''], ['Terrissa', 'Labib Sadek', ''], ['Ayad', 'Soheyb', ''], ['Zerhouni', 'Noureddine', ''], ['Varnier', 'Christophe', '']]","['Cyber physical systems CPS', 'Prognostics Health Management PHM', 'Decision post-prognostics', 'cloud computing', 'Internet of Things']"
1122,1702.01126,Konrad Kulakowski,Konrad Ku{\l}akowski,"Inconsistency in the ordinal pairwise comparisons method with and
  without ties","50 pages, 12 figures","Konrad Kulakowski, Inconsistency in the ordinal pairwise
  comparisons method with and without ties, European Journal of Operational
  Research, Volume 270, Issue 1, 1 October 2018, Pages 314-327",10.1016/j.ejor.2018.03.024,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Comparing alternatives in pairs is a well-known method of ranking creation.
Experts are asked to perform a series of binary comparisons and then, using
mathematical methods, the final ranking is prepared. As experts conduct the
individual assessments, they may not always be consistent. The level of
inconsistency among individual assessments is widely accepted as a measure of
the ranking quality. The higher the ranking quality, the greater its
credibility. One way to determine the level of inconsistency among the paired
comparisons is to calculate the value of the inconsistency index. One of the
earliest and most widespread inconsistency indexes is the consistency
coefficient defined by Kendall and Babington Smith. In their work, the authors
consider binary pairwise comparisons, i.e., those where the result of an
individual comparison can only be: better or worse. The presented work extends
the Kendall and Babington Smith index to sets of paired comparisons with ties.
Hence, this extension allows the decision makers to determine the inconsistency
for sets of paired comparisons, where the result may also be ""equal."" The
article contains a definition and analysis of the most inconsistent set of
pairwise comparisons with and without ties. It is also shown that the most
inconsistent set of pairwise comparisons with ties represents a special case of
the more general set cover problem.
","[{'version': 'v1', 'created': 'Fri, 3 Feb 2017 19:13:51 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Feb 2017 18:39:55 GMT'}, {'version': 'v3', 'created': 'Thu, 6 Apr 2017 19:25:25 GMT'}]",2018-12-12,"[['Kułakowski', 'Konrad', '']]","['pairwise comparisons', 'consistency coefficient', 'inconsistency', 'AHP']"
1123,1705.01693,Dan Work,"Raphael E. Stern, Shumo Cui, Maria Laura Delle Monache, Rahul Bhadani,
  Matt Bunting, Miles Churchill, Nathaniel Hamilton, R'mani Haulcy, Hannah
  Pohlmann, Fangyu Wu, Benedetto Piccoli, Benjamin Seibold, Jonathan Sprinkle,
  Daniel B. Work","Dissipation of stop-and-go waves via control of autonomous vehicles:
  Field experiments",,"Transportation Research Part C: Emerging Technologies, 89: pp.
  205-221, 2018",10.1016/j.trc.2018.02.005,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traffic waves are phenomena that emerge when the vehicular density exceeds a
critical threshold. Considering the presence of increasingly automated vehicles
in the traffic stream, a number of research activities have focused on the
influence of automated vehicles on the bulk traffic flow. In the present
article, we demonstrate experimentally that intelligent control of an
autonomous vehicle is able to dampen stop-and-go waves that can arise even in
the absence of geometric or lane changing triggers. Precisely, our experiments
on a circular track with more than 20 vehicles show that traffic waves emerge
consistently, and that they can be dampened by controlling the velocity of a
single vehicle in the flow. We compare metrics for velocity, braking events,
and fuel economy across experiments. These experimental findings suggest a
paradigm shift in traffic management: flow control will be possible via a few
mobile actuators (less than 5%) long before a majority of vehicles have
autonomous capabilities.
","[{'version': 'v1', 'created': 'Thu, 4 May 2017 03:51:54 GMT'}]",2018-03-28,"[['Stern', 'Raphael E.', ''], ['Cui', 'Shumo', ''], ['Monache', 'Maria Laura Delle', ''], ['Bhadani', 'Rahul', ''], ['Bunting', 'Matt', ''], ['Churchill', 'Miles', ''], ['Hamilton', 'Nathaniel', ''], ['Haulcy', ""R'mani"", ''], ['Pohlmann', 'Hannah', ''], ['Wu', 'Fangyu', ''], ['Piccoli', 'Benedetto', ''], ['Seibold', 'Benjamin', ''], ['Sprinkle', 'Jonathan', ''], ['Work', 'Daniel B.', '']]","['Traffic waves', 'Autonomous vehicles', 'Traffic control']"
1124,2101.12604,Anca Jurcut Dr.,"Jinyong Chen, Reiner Dojen and Anca Jurcut","Detection and Prevention of New Attacks for ID-based Authentication
  Protocols",,"9th ACM International Conference on Networks, Communication and
  Computing (ICNCC 2020)",10.1145/3447654.3447666,,cs.CR,http://creativecommons.org/publicdomain/zero/1.0/,"  The rapid development of information and network technologies motivates the
emergence of various new computing paradigms, such as distributed computing,
and edge computing. This also enables more and more network enterprises to
provide multiple different services simultaneously. To ensure these services
can conveniently be accessed only by authorized users, many password and smart
card-based authentication schemes for multi-server architecture have been
proposed. In this paper, we review several dynamic ID-based password
authentication schemes for multi-server environments. New attacks against four
of these schemes are presented, demonstrating that an adversary can impersonate
either legitimate or fictitious users. The impact of these attacks is the
failure to achieve the main security requirement: authentication. Thus, the
security of the analyzed schemes is proven to be compromised. We analyze these
four dynamic ID-based schemes and discuss the reasons for the success of the
new attacks. Additionally, we propose a new set of design guidelines to prevent
such exploitable weaknesses on dynamic ID-based authentication protocols.
Finally, we apply the proposed guidelines to the analyzed protocols and
demonstrate that violation of these guidelines leads to insecure protocols.
","[{'version': 'v1', 'created': 'Fri, 29 Jan 2021 14:32:48 GMT'}]",2021-02-01,"[['Chen', 'Jinyong', ''], ['Dojen', 'Reiner', ''], ['Jurcut', 'Anca', '']]","['Authentication protocols', 'Multi-factor authentication', 'Multi-server']"
1125,1907.12635,Anjul Tyagi,"Ayush Kumar, Anjul Tyagi, Michael Burch, Daniel Weiskopf, Klaus
  Mueller","Task Classification Model for Visual Fixation, Exploration, and Search",4 pages,"In proceedings of the 11th ACM Symposium on Eye Tracking Research
  and Applications, 2019",10.1145/3314111.3323073,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Yarbus' claim to decode the observer's task from eye movements has received
mixed reactions. In this paper, we have supported the hypothesis that it is
possible to decode the task. We conducted an exploratory analysis on the
dataset by projecting features and data points into a scatter plot to visualize
the nuance properties for each task. Following this analysis, we eliminated
highly correlated features before training an SVM and Ada Boosting classifier
to predict the tasks from this filtered eye movements data. We achieve an
accuracy of 95.4% on this task classification problem and hence, support the
hypothesis that task classification is possible from a user's eye movement
data.
","[{'version': 'v1', 'created': 'Mon, 29 Jul 2019 20:50:37 GMT'}]",2019-07-31,"[['Kumar', 'Ayush', ''], ['Tyagi', 'Anjul', ''], ['Burch', 'Michael', ''], ['Weiskopf', 'Daniel', ''], ['Mueller', 'Klaus', '']]","['Classifier', 'eye movements', 'Yarbus', 'task decoding', 'visual attention']"
1126,1709.04405,Mehmet Emir Koksal,Mehmet Emir Koksal,Commutativity of Systems with their Feedback Conjugates,"13 pages, 2 figures","Transactions of the Institute of Measurement and Control, vol. 41,
  no. 3, pp. 696-700, 2019",10.1177/0142331218765615,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  After introducing commutativity concept and summarizing the relevant
literature, this work is focused on the commutativity of feedback conjugates.
It is already known that a linear time-varying differential system describing a
single input-single output dynamical system is always commutative with its
constant gain feedback pairs. In this article, it is proven that among the
time-varying feedback conjugates of a linear time-varying system, constant
feedback conjugates are the only commutative feedback pairs and any of the
time-varying feedback conjugates cannot constitutes a commutative pair of a
linear time-varying system.
","[{'version': 'v1', 'created': 'Wed, 13 Sep 2017 16:21:28 GMT'}]",2020-08-13,"[['Koksal', 'Mehmet Emir', '']]","['Commutativity', 'Feedback', 'Time-varying linear systems', 'Differential']"
1127,0907.5074,Marcello M. Bersani,"Marcello M. Bersani, Carlo A. Furia, Matteo Pradella, and Matteo Rossi","Integrated Modeling and Verification of Real-Time Systems through
  Multiple Paradigms",27 pages,"Proceedings of the 7th IEEE International Conference on Software
  Engineering and Formal Methods (SEFM'09). Pgg. 13--22, IEEE Computer Society
  Press, November 2009",10.1109/SEFM.2009.16,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Complex systems typically have many different parts and facets, with
different characteristics. In a multi-paradigm approach to modeling, formalisms
with different natures are used in combination to describe complementary parts
and aspects of the system. This can have a beneficial impact on the modeling
activity, as different paradigms an be better suited to describe different
aspects of the system. While each paradigm provides a different view on the
many facets of the system, it is of paramount importance that a coherent
comprehensive model emerges from the combination of the various partial
descriptions. In this paper we present a technique to model different aspects
of the same system with different formalisms, while keeping the various models
tightly integrated with one another. In addition, our approach leverages the
flexibility provided by a bounded satisfiability checker to encode the
verification problem of the integrated model in the propositional
satisfiability (SAT) problem; this allows users to carry out formal
verification activities both on the whole model and on parts thereof. The
effectiveness of the approach is illustrated through the example of a
monitoring system.
","[{'version': 'v1', 'created': 'Wed, 29 Jul 2009 09:21:45 GMT'}]",2013-08-14,"[['Bersani', 'Marcello M.', ''], ['Furia', 'Carlo A.', ''], ['Pradella', 'Matteo', ''], ['Rossi', 'Matteo', '']]","['Metric temporal logic', 'timed Petri nets', 'timed automata', 'discretization', 'dense time', 'bounded model checking']"
1128,1403.3807,Bibo Hao,"Bibo Hao, Lin Li, Rui Gao, Ang Li, Tingshao Zhu",Sensing Subjective Well-being from Social Media,"12 pages, 1 figures, 2 tables, 10th International Conference, AMT
  2014, Warsaw, Poland, August 11-14, 2014. Proceedings",,10.1007/978-3-319-09912-5_27,,cs.AI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Subjective Well-being(SWB), which refers to how people experience the quality
of their lives, is of great use to public policy-makers as well as economic,
sociological research, etc. Traditionally, the measurement of SWB relies on
time-consuming and costly self-report questionnaires. Nowadays, people are
motivated to share their experiences and feelings on social media, so we
propose to sense SWB from the vast user generated data on social media. By
utilizing 1785 users' social media data with SWB labels, we train machine
learning models that are able to ""sense"" individual SWB from users' social
media. Our model, which attains the state-by-art prediction accuracy, can then
be used to identify SWB of large population of social media users in time with
very low cost.
","[{'version': 'v1', 'created': 'Sat, 15 Mar 2014 14:19:47 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Aug 2014 11:43:14 GMT'}]",2014-08-29,"[['Hao', 'Bibo', ''], ['Li', 'Lin', ''], ['Gao', 'Rui', ''], ['Li', 'Ang', ''], ['Zhu', 'Tingshao', '']]","['Subjective Well-being', 'Social Media', 'Machine Learning']"
1129,0803.2965,Uwe Aickelin,Uwe Aickelin,An Indirect Genetic Algorithm for Set Covering Problems,,"Journal of the Operational Research Society, 53(10), pp 1118-1126
  2002",10.1057/palgrave.jors.2601317,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new type of genetic algorithm for the set covering
problem. It differs from previous evolutionary approaches first because it is
an indirect algorithm, i.e. the actual solutions are found by an external
decoder function. The genetic algorithm itself provides this decoder with
permutations of the solution variables and other parameters. Second, it will be
shown that results can be further improved by adding another indirect
optimisation layer. The decoder will not directly seek out low cost solutions
but instead aims for good exploitable solutions. These are then post optimised
by another hill-climbing algorithm. Although seemingly more complicated, we
will show that this three-stage approach has advantages in terms of solution
quality, speed and adaptability to new types of problems over more direct
approaches. Extensive computational results are presented and compared to the
latest evolutionary and other heuristic approaches to the same data instances.
","[{'version': 'v1', 'created': 'Thu, 20 Mar 2008 10:58:32 GMT'}]",2010-07-05,"[['Aickelin', 'Uwe', '']]","['Heuristics', 'Optimisation', 'Scheduling']"
1130,1901.04299,Lester Beltran,"Diederik Aerts, Lester Beltran, Suzette Geriente and Sandro Sozzo","Quantum-theoretic Modeling in Computer Science A complex Hilbert space
  model for entangled concepts in corpuses of documents","15 pages, no figures",,10.1007/s10773-019-04155-y,,cs.CL quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We work out a quantum-theoretic model in complex Hilbert space of a recently
performed test on co-occurrencies of two concepts and their combination in
retrieval processes on specific corpuses of documents. The test violated the
Clauser-Horne-Shimony-Holt version of the Bell inequalities ('CHSH
inequality'), thus indicating the presence of entanglement between the combined
concepts. We make use of a recently elaborated 'entanglement scheme' and
represent the collected data in the tensor product of Hilbert spaces of the
individual concepts, showing that the identified violation is due to the
occurrence of a strong form of entanglement, involving both states and
measurements and reflecting the meaning connection between the component
concepts. These results provide a significant confirmation of the presence of
quantum structures in corpuses of documents, like it is the case for the
entanglement identified in human cognition.
","[{'version': 'v1', 'created': 'Sat, 5 Jan 2019 20:33:28 GMT'}]",2019-09-04,"[['Aerts', 'Diederik', ''], ['Beltran', 'Lester', ''], ['Geriente', 'Suzette', ''], ['Sozzo', 'Sandro', '']]","['CHSH inequality', 'Quantum entanglement', 'Quantum structures', 'Corpuses of documents']"
1131,0712.2629,Toshiya Itoh,"Ryoso Hamane, Toshiya Itoh, and Kouhei Tomita",Approximation Algorithms for the Highway Problem under the Coupon Model,"13 pages, 5 figures","IEICE Trans. on Fundamentals, E92-A(8), pp.1779-1786, 2009",10.1587/transfun.E92.A.1779,,cs.DS,,"  When a store sells items to customers, the store wishes to determine the
prices of the items to maximize its profit. Intuitively, if the store sells the
items with low (resp. high) prices, the customers buy more (resp. less) items,
which provides less profit to the store. So it would be hard for the store to
decide the prices of items. Assume that the store has a set V of n items and
there is a set E of m customers who wish to buy those items, and also assume
that each item i \in V has the production cost d_i and each customer e_j \in E
has the valuation v_j on the bundle e_j \subseteq V of items. When the store
sells an item i \in V at the price r_i, the profit for the item i is
p_i=r_i-d_i. The goal of the store is to decide the price of each item to
maximize its total profit. In most of the previous works, the item pricing
problem was considered under the assumption that p_i \geq 0 for each i \in V,
however, Balcan, et al. [In Proc. of WINE, LNCS 4858, 2007] introduced the
notion of loss-leader, and showed that the seller can get more total profit in
the case that p_i < 0 is allowed than in the case that p_i < 0 is not allowed.
In this paper, we consider the line and the cycle highway problem, and show
approximation algorithms for the line and/or cycle highway problem for which
the smallest valuation is s and the largest valuation is \ell or all valuations
are identical.
","[{'version': 'v1', 'created': 'Mon, 17 Dec 2007 04:47:38 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Jan 2008 05:54:40 GMT'}]",2011-09-29,"[['Hamane', 'Ryoso', ''], ['Itoh', 'Toshiya', ''], ['Tomita', 'Kouhei', '']]","['Line Highway Problem', 'Cycle Highway Problem', 'Multi-Valuations', 'Single-Valuation']"
1132,1510.05681,Rodrigo de Souza Couto,"Rodrigo de Souza Couto, Stefano Secci, Miguel Elias Mitre Campista,
  Lu\'is Henrique Maciel Kosmalski Costa",Server Placement with Shared Backups for Disaster-Resilient Clouds,Computer Networks 2015,,10.1016/j.comnet.2015.09.039,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A key strategy to build disaster-resilient clouds is to employ backups of
virtual machines in a geo-distributed infrastructure. Today, the continuous and
acknowledged replication of virtual machines in different servers is a service
provided by different hypervisors. This strategy guarantees that the virtual
machines will have no loss of disk and memory content if a disaster occurs, at
a cost of strict bandwidth and latency requirements. Considering this kind of
service, in this work, we propose an optimization problem to place servers in a
wide area network. The goal is to guarantee that backup machines do not fail at
the same time as their primary counterparts. In addition, by using
virtualization, we also aim to reduce the amount of backup servers required.
The optimal results, achieved in real topologies, reduce the number of backup
servers by at least 40%. Moreover, this work highlights several characteristics
of the backup service according to the employed network, such as the
fulfillment of latency requirements.
","[{'version': 'v1', 'created': 'Mon, 19 Oct 2015 20:45:38 GMT'}]",2015-10-21,"[['Couto', 'Rodrigo de Souza', ''], ['Secci', 'Stefano', ''], ['Campista', 'Miguel Elias Mitre', ''], ['Costa', 'Luís Henrique Maciel Kosmalski', '']]","['cloud networking', 'resilience', 'geo-distributed data centers', 'infrastructure as a service']"
1133,1404.4140,Richa Gupta Ms,Richa Gupta,Journey from Data Mining to Web Mining to Big Data,3 pages,"International Journal of Computer Trends and Technology (IJCTT)
  10(1): 1-3, April 2014. Published by Seventh Sense Research Group",10.14445/22312803/IJCTT-V10P104,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the journey of big data starting from data mining to web
mining to big data. It discusses each of this method in brief and also provides
their applications. It states the importance of mining big data today using
fast and novel approaches.
","[{'version': 'v1', 'created': 'Wed, 16 Apr 2014 05:20:28 GMT'}]",2014-04-17,"[['Gupta', 'Richa', '']]","['data mining', 'web mining', 'big data']"
1134,1604.02444,Tao Wu,"Tao Wu, Leiting Chen",Predicting the evolution of complex networks via local information,,,10.1016/j.physa.2016.08.013,,cs.SI physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  Almost all real-world networks are subject to constant evolution, and plenty
of evolving networks have been investigated to uncover the underlying
mechanisms for a deeper understanding of the organization and development of
them. Compared with the rapid expansion of the empirical studies about
evolution mechanisms exploration, the future links prediction methods
corresponding to the evolution mechanisms are deficient. Real-world information
always contain hints of what would happen next, which is also the case in the
observed evolving networks. In this paper, we firstly propose a
structured-dependent index to strengthen the robustness of link prediction
methods. Then we treat the observed links and their timestamps in evolving
networks as known information. We envision evolving networks as dynamic systems
and model the evolutionary dynamics of nodes similarity. Based on the iterative
updating of nodes' network position, the potential trend of evolving networks
is uncovered, which improves the accuracy of future links prediction.
Experiments on various real-world networks show that the proposed index
performs better than baseline methods and the spatial-temporal position drift
model performs well in real-world evolving networks.
","[{'version': 'v1', 'created': 'Fri, 8 Apr 2016 19:55:31 GMT'}]",2016-10-12,"[['Wu', 'Tao', ''], ['Chen', 'Leiting', '']]","['Link Prediction', 'Evolutionary Dynamics', 'Spatial-temporal Drift', 'Complex Networks']"
1135,0910.5435,Mark Tygert,Mark Tygert,"Fast algorithms for spherical harmonic expansions, III","14 pages, 1 figure, 6 tables","Fast algorithms for spherical harmonic expansions, III, Journal of
  Computational Physics, 229 (18): 6181-6192, 2010",10.1016/j.jcp.2010.05.004,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We accelerate the computation of spherical harmonic transforms, using what is
known as the butterfly scheme. This provides a convenient alternative to the
approach taken in the second paper from this series on ""Fast algorithms for
spherical harmonic expansions."" The requisite precomputations become manageable
when organized as a ""depth-first traversal"" of the program's control-flow
graph, rather than as the perhaps more natural ""breadth-first traversal"" that
processes one-by-one each level of the multilevel procedure. We illustrate the
results via several numerical examples.
","[{'version': 'v1', 'created': 'Wed, 28 Oct 2009 17:03:05 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Oct 2009 16:57:59 GMT'}, {'version': 'v3', 'created': 'Fri, 30 Oct 2009 19:19:55 GMT'}, {'version': 'v4', 'created': 'Tue, 17 Nov 2009 19:23:19 GMT'}, {'version': 'v5', 'created': 'Sun, 13 Dec 2009 18:48:39 GMT'}, {'version': 'v6', 'created': 'Mon, 5 Apr 2010 17:16:54 GMT'}]",2015-05-14,"[['Tygert', 'Mark', '']]","['butterfly', 'algorithm', 'spherical harmonic', 'transform', 'interpolative decomposition']"
1136,1803.07519,Minhui Xue,"Lei Ma, Felix Juefei-Xu, Fuyuan Zhang, Jiyuan Sun, Minhui Xue, Bo Li,
  Chunyang Chen, Ting Su, Li Li, Yang Liu, Jianjun Zhao, Yadong Wang",DeepGauge: Multi-Granularity Testing Criteria for Deep Learning Systems,"The 33rd IEEE/ACM International Conference on Automated Software
  Engineering (ASE 2018)","DeepGauge: Multi-Granularity Testing Criteria for Deep Learning
  Systems. In Proceedings of the 33rd ACM/IEEE International Conference on
  Automated Software Engineering (ASE 18), September 3-7, 2018, Montpellier,
  France",10.1145/3238147.3238202,,cs.SE cs.CR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning (DL) defines a new data-driven programming paradigm that
constructs the internal system logic of a crafted neuron network through a set
of training data. We have seen wide adoption of DL in many safety-critical
scenarios. However, a plethora of studies have shown that the state-of-the-art
DL systems suffer from various vulnerabilities which can lead to severe
consequences when applied to real-world applications. Currently, the testing
adequacy of a DL system is usually measured by the accuracy of test data.
Considering the limitation of accessible high quality test data, good accuracy
performance on test data can hardly provide confidence to the testing adequacy
and generality of DL systems. Unlike traditional software systems that have
clear and controllable logic and functionality, the lack of interpretability in
a DL system makes system analysis and defect detection difficult, which could
potentially hinder its real-world deployment. In this paper, we propose
DeepGauge, a set of multi-granularity testing criteria for DL systems, which
aims at rendering a multi-faceted portrayal of the testbed. The in-depth
evaluation of our proposed testing criteria is demonstrated on two well-known
datasets, five DL systems, and with four state-of-the-art adversarial attack
techniques against DL. The potential usefulness of DeepGauge sheds light on the
construction of more generic and robust DL systems.
","[{'version': 'v1', 'created': 'Tue, 20 Mar 2018 16:52:12 GMT'}, {'version': 'v2', 'created': 'Tue, 15 May 2018 05:02:54 GMT'}, {'version': 'v3', 'created': 'Sat, 28 Jul 2018 07:47:27 GMT'}, {'version': 'v4', 'created': 'Tue, 14 Aug 2018 23:07:39 GMT'}]",2018-08-16,"[['Ma', 'Lei', ''], ['Juefei-Xu', 'Felix', ''], ['Zhang', 'Fuyuan', ''], ['Sun', 'Jiyuan', ''], ['Xue', 'Minhui', ''], ['Li', 'Bo', ''], ['Chen', 'Chunyang', ''], ['Su', 'Ting', ''], ['Li', 'Li', ''], ['Liu', 'Yang', ''], ['Zhao', 'Jianjun', ''], ['Wang', 'Yadong', '']]","['Deep learning', 'Software testing', 'Deep neural networks', 'Testingcriteria']"
1137,1308.1536,Gleb Beliakov,Gleb Beliakov and Yuri Matiyasevich,"A Parallel Algorithm for Calculation of Large Determinants with High
  Accuracy for GPUs and MPI clusters",,,10.1007/s10543-015-0547-z,,cs.DC cs.MS cs.NA math.NA math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a parallel algorithm for calculating very large determinants with
arbitrary precision on computer clusters. This algorithm minimises data
movements between the nodes and computes not only the determinant but also all
minors corresponding to a particular row or column at a little extra cost, and
also the determinants and minors of all submatrices in the top left corner at
no extra cost. We implemented the algorithm in arbitrary precision arithmetic,
suitable for very ill conditioned matrices, and empirically estimated the loss
of precision. The algorithm was applied to studies of Riemann's zeta function.
","[{'version': 'v1', 'created': 'Wed, 7 Aug 2013 11:24:07 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Aug 2013 11:06:59 GMT'}]",2021-10-26,"[['Beliakov', 'Gleb', ''], ['Matiyasevich', 'Yuri', '']]","['determinant', 'linear algebra', 'parallel algorithms', 'Message Passing Interface', 'GPU', 'Riemann’s zeta function']"
1138,1407.0147,Ravi Khatwal,"Ravi Khatwal, Manoj Kumar Jain","Application Specific Hardware Design Simulation for High Performance
  Embedded System","ijca,june(2014)",,10.5120/16834-6599,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Application specific simulation is challenging task in various real time high
performance embedded devices. In this study specific application is implemented
with the help of Xilinx. Xilinx provides SDK and XPS tools, XPS tools used for
develop complete hardware platform and SDK provides software platform for
application creation and verification. Xilinx XUP-5 board have been used and
implemented various specific Applications with hardware platform. In this study
the base instruction set with customized instructions, supported with specific
hardware resources are analyzed.
","[{'version': 'v1', 'created': 'Tue, 1 Jul 2014 09:10:26 GMT'}]",2014-07-02,"[['Khatwal', 'Ravi', ''], ['Jain', 'Manoj Kumar', '']]","['Xilinx', 'virtex-5 FPGA board', 'simulation', 'hardware and software design', 'Xilinx Platform Studio']"
1139,2004.08219,Stefan Karlsson,Stefan Karlsson,Exploratory Test Agents for Stateful Software Systems,,"ESEC/FSE 2019: Proceedings of the 2019 27th ACM Joint Meeting on
  European Software Engineering Conference and Symposium on the Foundations of
  Software Engineering",10.1145/3338906.3341458,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The adequate testing of stateful software systems is a hard and costly
activity. Failures that result from complex stateful interactions can be of
high impact, and it can be hard to replicate failures resulting from erroneous
stateful interactions. Addressing this problem in an automatic way would save
cost and time and increase the quality of software systems in the industry. In
this paper, we propose an approach that uses agents to explore software systems
with the intention to find faults and gain knowledge.
","[{'version': 'v1', 'created': 'Fri, 17 Apr 2020 12:49:03 GMT'}]",2020-04-20,"[['Karlsson', 'Stefan', '']]","['exploratory', 'test', 'agents', 'automated testing']"
1140,1406.4748,Sanjay Chakraborty,"Sanjay Majumder, Sanjay Chakraborty and Suman Das",A New Advanced User Authentication and Confidentiality Security Service,,,10.5120/16257-5904,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network & internet security is the burning question of today's world and they
are deeply related to each other for secure successful data transmission.
Network security approach is totally based on the concept of network security
services. In this paper, a new system of network security service is
implemented which is more secure than conventional network security services.
This technique is mainly deals with two essential network security services,
one is user authentication and other is data confidentiality. For user
authentication this paper introduces Graphical Username & Voice Password
approaches which provides better security than conventional username & password
authentication process. In data confidentiality section this paper introduces
two layer private key for both message encryption & decryption which is mainly
applicable on 8 bit plain text data. This paper also provides the hints of
introducing other two network security services (integrity and non-repudiation)
as a future work.
","[{'version': 'v1', 'created': 'Wed, 18 Jun 2014 14:54:53 GMT'}]",2015-06-22,"[['Majumder', 'Sanjay', ''], ['Chakraborty', 'Sanjay', ''], ['Das', 'Suman', '']]","['Network Security', 'Authentication', 'Confidentiality']"
1141,1111.5483,Rick Quax M.Sc.,"Rick Quax, Andrea Apolloni, Peter M. A. Sloot",The diminishing role of hubs in dynamical processes on complex networks,Published version,"Journal of the Royal Society Interface, vol. 10, nr 88 2013. ISSN:
  1742-5662",10.1098/rsif.2013.0568,,cs.IT math.IT nlin.AO physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is notoriously difficult to predict the behaviour of a complex
self-organizing system, where the interactions among dynamical units form a
heterogeneous topology. Even if the dynamics of each microscopic unit is known,
a real understanding of their contributions to the macroscopic system behaviour
is still lacking. Here we develop information-theoretical methods to
distinguish the contribution of each individual unit to the collective
out-of-equilibrium dynamics. We show that for a system of units connected by a
network of interaction potentials with an arbitrary degree distribution, highly
connected units have less impact on the system dynamics as compared to
intermediately connected units. In an equilibrium setting, the hubs are often
found to dictate the long-term behaviour. However, we find both analytically
and experimentally that the instantaneous states of these units have a
short-lasting effect on the state trajectory of the entire system. We present
qualitative evidence of this phenomenon from empirical findings about a social
network of product recommendations, a protein-protein interaction network, and
a neural network, suggesting that it might indeed be a widespread property in
nature.
","[{'version': 'v1', 'created': 'Wed, 23 Nov 2011 13:12:29 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Oct 2012 07:45:49 GMT'}, {'version': 'v3', 'created': 'Mon, 30 Sep 2013 12:37:39 GMT'}]",2013-10-01,"[['Quax', 'Rick', ''], ['Apolloni', 'Andrea', ''], ['Sloot', 'Peter M. A.', '']]","['complex networks', 'out-of-equilibriumdynamics', 'information theory', 'word-of-mouthmarketing', 'gene regulatory networks', 'neuralnetworks']"
1142,2105.04817,Mayuko Kori,"Mayuko Kori, Ichiro Hasuo, Shin-ya Katsumata","Fibrational Initial Algebra-Final Coalgebra Coincidence over Initial
  Algebras: Turning Verification Witnesses Upside Down",38 pages,,10.4230/LIPIcs.CONCUR.2021.21,,cs.LO cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The coincidence between initial algebras (IAs) and final coalgebras (FCs) is
a phenomenon that underpins various important results in theoretical computer
science. In this paper, we identify a general fibrational condition for the
IA-FC coincidence, namely in the fiber over an initial algebra in the base
category. Identifying (co)algebras in a fiber as (co)inductive predicates, our
fibrational IA-FC coincidence allows one to use coinductive witnesses (such as
invariants) for verifying inductive properties (such as liveness). Our general
fibrational theory features the technical condition of stability of chain
colimits; we extend the framework to the presence of a monadic effect, too,
restricting to fibrations of complete lattice-valued predicates. Practical
benefits of our categorical theory are exemplified by new ""upside-down"" witness
notions for three verification problems: probabilistic liveness, and acceptance
and model-checking with respect to bottom-up tree automata.
","[{'version': 'v1', 'created': 'Tue, 11 May 2021 07:10:13 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Jul 2021 07:11:05 GMT'}, {'version': 'v3', 'created': 'Tue, 24 Aug 2021 09:26:16 GMT'}]",2021-08-25,"[['Kori', 'Mayuko', ''], ['Hasuo', 'Ichiro', ''], ['Katsumata', 'Shin-ya', '']]","['initial algebra', 'final coalgebra', 'fibration', 'category theory']"
1143,2010.01723,Donald Pinckney,"Donald Pinckney, Arjun Guha, Yuriy Brun",Wasm/k: Delimited Continuations for WebAssembly,,"Proceedings of the ACM SIGPLAN International Symposium on Dynamic
  Languages (DLS 2020)",10.1145/3426422.3426978,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  WebAssembly is designed to be an alternative to JavaScript that is a safe,
portable, and efficient compilation target for a variety of languages. The
performance of high-level languages depends not only on the underlying
performance of WebAssembly, but also on the quality of the generated
WebAssembly code. In this paper, we identify several features of high-level
languages that current approaches can only compile to WebAssembly by generating
complex and inefficient code. We argue that these problems could be addressed
if WebAssembly natively supported first-class continuations. We then present
Wasm/k, which extends WebAssembly with delimited continuations. Wasm/k
introduces no new value types, and thus does not require significant changes to
the WebAssembly type system (validation). Wasm/k is safe, even in the presence
of foreign function calls (e.g., to and from JavaScript). Finally, Wasm/k is
amenable to efficient implementation: we implement Wasm/k as a local change to
Wasmtime, an existing WebAssembly JIT. We evaluate Wasm/k by implementing C/k,
which adds delimited continuations to C/C++. C/k uses Emscripten and its
implementation serves as a case study on how to use Wasm/k in a compiler that
targets WebAssembly. We present several case studies using C/k, and show that
on implementing green threads, it can outperform the state-of-the-art approach
Asyncify with an 18% improvement in performance and a 30% improvement in code
size.
","[{'version': 'v1', 'created': 'Mon, 5 Oct 2020 00:09:01 GMT'}]",2020-10-07,"[['Pinckney', 'Donald', ''], ['Guha', 'Arjun', ''], ['Brun', 'Yuriy', '']]","['virtual machines', 'first-class continuations', 'formal language semantics']"
1144,1106.1232,EPTCS,"Krishnendu Chatterjee (Institute of Science and Technology (IST
  Austria)), Nathana\""el Fijalkow (Institute of Science and Technology (IST
  Austria))",A reduction from parity games to simple stochastic games,"In Proceedings GandALF 2011, arXiv:1106.0814","EPTCS 54, 2011, pp. 74-86",10.4204/EPTCS.54.6,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Games on graphs provide a natural model for reactive non-terminating systems.
In such games, the interaction of two players on an arena results in an
infinite path that describes a run of the system. Different settings are used
to model various open systems in computer science, as for instance turn-based
or concurrent moves, and deterministic or stochastic transitions. In this
paper, we are interested in turn-based games, and specifically in deterministic
parity games and stochastic reachability games (also known as simple stochastic
games). We present a simple, direct and efficient reduction from deterministic
parity games to simple stochastic games: it yields an arena whose size is
linear up to a logarithmic factor in size of the original arena.
","[{'version': 'v1', 'created': 'Tue, 7 Jun 2011 01:06:10 GMT'}]",2011-06-08,"[['Chatterjee', 'Krishnendu', '', 'Institute of Science and Technology'], ['Fijalkow', 'Nathanaël', '', 'Institute of Science and Technology']]","['Stochastic games', 'parity objectives', 'reachability objectives']"
1145,1408.2662,Navid Talebanfard,Navid Talebanfard,On the Structure and the Number of Prime Implicants of 2-CNFs,,,10.1016/j.dam.2015.06.036,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $m(n, k)$ be the maximum number of prime implicants that any $k$-CNF on n
variables can have. We show that $3^{n/3} \le m(n,2) \le (1+o(1))3^{n/3}$.
","[{'version': 'v1', 'created': 'Tue, 12 Aug 2014 09:00:33 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Oct 2015 17:01:20 GMT'}]",2015-10-20,"[['Talebanfard', 'Navid', '']]","['Computational complexity', 'Combinatorial problems', 'Conjunctive normalform', 'Prime implicant']"
1146,1502.08033,Hung Nghiep Tran,"Vu Le Anh, Vo Hoang Hai, Hung Nghiep Tran, Jason J. Jung","SciRecSys: A Recommendation System for Scientific Publication by
  Discovering Keyword Relationships",,"International Conference on Computational Collective Intelligence
  (ICCCI 2014)",10.1007/978-3-319-11289-3_8,,cs.DL cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we propose a new approach for discovering various relationships
among keywords over the scientific publications based on a Markov Chain model.
It is an important problem since keywords are the basic elements for
representing abstract objects such as documents, user profiles, topics and many
things else. Our model is very effective since it combines four important
factors in scientific publications: content, publicity, impact and randomness.
Particularly, a recommendation system (called SciRecSys) has been presented to
support users to efficiently find out relevant articles.
","[{'version': 'v1', 'created': 'Fri, 27 Feb 2015 19:35:24 GMT'}]",2020-02-24,"[['Anh', 'Vu Le', ''], ['Hai', 'Vo Hoang', ''], ['Tran', 'Hung Nghiep', ''], ['Jung', 'Jason J.', '']]","['Keyword ranking', 'Keyword similarity', 'Keyword inference', 'Scientific Recommendation System', 'Bibliographical corpus']"
1147,1911.11930,Hao Liao,"Hao Liao, Qi-xin Liu, Ze-cheng Huang, Chi Ho Yeung, Yi-Cheng Zhang","Accumulative time-based ranking method to reputation evaluation in
  information networks",,"Journal of Computer Science and Technology, 2022, 37 (4): 960-974",10.1007/s11390-021-0471-4,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rapid development of modern technology, the Web has become an
important platform for users to make friends and acquire information. However,
since information on the Web is over-abundant, information filtering becomes a
key task for online users to obtain relevant suggestions. As most Websites can
be ranked according to users' rating and preferences, relevance to queries, and
recency, how to extract the most relevant item from the over-abundant
information is always a key topic for researchers in various fields. In this
paper, we adopt tools used to analyze complex networks to evaluate user
reputation and item quality. In our proposed accumulative time-based ranking
(ATR) algorithm, we incorporate two behavioral weighting factors which are
updated when users select or rate items, to reflect the evolution of user
reputation and item quality over time. We showed that our algorithm outperforms
state-of-the-art ranking algorithms in terms of precision and robustness on
empirical datasets from various online retailers and the citation datasets
among research publications.
","[{'version': 'v1', 'created': 'Wed, 27 Nov 2019 03:21:09 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Mar 2020 08:27:39 GMT'}]",2022-07-28,"[['Liao', 'Hao', ''], ['Liu', 'Qi-xin', ''], ['Huang', 'Ze-cheng', ''], ['Yeung', 'Chi Ho', ''], ['Zhang', 'Yi-Cheng', '']]","['Behavior dynamics', 'Reputation evaluation', 'Ranking', 'Temporal networks']"
1148,1207.6816,Lee Naish,Lee Naish,Transforming floundering into success,Number of pages: 24 Number of figures: 9 Number of tables: none,Theory and Practice of Logic Programming 14 (2014) 215-238,10.1017/S147106841200035X,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show how logic programs with ""delays"" can be transformed to programs
without delays in a way which preserves information concerning floundering
(also known as deadlock). This allows a declarative (model-theoretic),
bottom-up or goal independent approach to be used for analysis and debugging of
properties related to floundering. We rely on some previously introduced
restrictions on delay primitives and a key observation which allows properties
such as groundness to be analysed by approximating the (ground) success set.
This paper is to appear in Theory and Practice of Logic Programming (TPLP).
  Keywords: Floundering, delays, coroutining, program analysis, abstract
interpretation, program transformation, declarative debugging
","[{'version': 'v1', 'created': 'Mon, 30 Jul 2012 01:11:12 GMT'}]",2020-02-19,"[['Naish', 'Lee', '']]","['Floundering', 'delays', 'coroutining', 'program analysis', 'abstract interpretation', 'program transformation', 'declarative debugging']"
1149,1908.00737,Davide Taibi,"Valentina Lenarduzzi, Antonio Martini, Davide Taibi, Damian Andrew
  Tamburri","Towards Surgically-Precise Technical Debt Estimation: Early Results and
  Research Roadmap",6 pages,"In Proceedings of the 3rd ACM SIGSOFT International Workshop on
  Machine Learning Techniques for Software QualityEvaluation (MaLTeSQuE '19),
  August 27, 2019, Tallinn, Estonia",10.1145/3340482.3342747,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The concept of technical debt has been explored from many perspectives but
its precise estimation is still under heavy empirical and experimental inquiry.
We aim to understand whether, by harnessing approximate, data-driven,
machine-learning approaches it is possible to improve the current techniques
for technical debt estimation, as represented by a top industry quality
analysis tool such as SonarQube. For the sake of simplicity, we focus on
relatively simple regression modelling techniques and apply them to modelling
the additional project cost connected to the sub-optimal conditions existing in
the projects under study. Our results shows that current techniques can be
improved towards a more precise estimation of technical debt and the case study
shows promising results towards the identification of more accurate estimation
of technical debt.
","[{'version': 'v1', 'created': 'Fri, 2 Aug 2019 07:55:51 GMT'}]",2019-08-05,"[['Lenarduzzi', 'Valentina', ''], ['Martini', 'Antonio', ''], ['Taibi', 'Davide', ''], ['Tamburri', 'Damian Andrew', '']]","['Technical Debt', 'Machine Learning', 'Empirical Study']"
1150,2205.13034,Amine Remita,Amine M. Remita and Abdoulaye Banir\'e Diallo,"EvoVGM: a Deep Variational Generative Model for Evolutionary Parameter
  Estimation","Accepted as a full paper for publication in ACM-BCB 2022
  (Camera-ready version)","In 13th ACM International Conference on Bioinformatics,
  Computational Biology and Health Informatics (BCB '22), August 7-10, 2022,
  Northbrook, IL, USA. ACM, New York, NY, USA, 10 pages",10.1145/3535508.3545563,,cs.LG q-bio.PE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Most evolutionary-oriented deep generative models do not explicitly consider
the underlying evolutionary dynamics of biological sequences as it is performed
within the Bayesian phylogenetic inference framework. In this study, we propose
a method for a deep variational Bayesian generative model (EvoVGM) that jointly
approximates the true posterior of local evolutionary parameters and generates
sequence alignments. Moreover, it is instantiated and tuned for continuous-time
Markov chain substitution models such as JC69, K80 and GTR. We train the model
via a low-variance stochastic estimator and a gradient ascent algorithm. Here,
we analyze the consistency and effectiveness of EvoVGM on synthetic sequence
alignments simulated with several evolutionary scenarios and different sizes.
Finally, we highlight the robustness of a fine-tuned EvoVGM model using a
sequence alignment of gene S of coronaviruses.
","[{'version': 'v1', 'created': 'Wed, 25 May 2022 20:08:10 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Jul 2022 01:28:55 GMT'}]",2022-07-04,"[['Remita', 'Amine M.', ''], ['Diallo', 'Abdoulaye Baniré', '']]","['Variational Generative Model', 'Evolutionary model', 'Substitutionmodel', 'Variational inference', 'Latent variables', 'Deep neural networks', 'EvoVGM']"
1151,1812.05737,Venkatesh Umaashankar Mr,Abdul Arfat Mohammed and Venkatesh Umaashankar,"Effectiveness of Hierarchical Softmax in Large Scale Classification
  Tasks",,,10.1109/ICACCI.2018.8554637,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Typically, Softmax is used in the final layer of a neural network to get a
probability distribution for output classes. But the main problem with Softmax
is that it is computationally expensive for large scale data sets with large
number of possible outputs. To approximate class probability efficiently on
such large scale data sets we can use Hierarchical Softmax. LSHTC datasets were
used to study the performance of the Hierarchical Softmax. LSHTC datasets have
large number of categories. In this paper we evaluate and report the
performance of normal Softmax Vs Hierarchical Softmax on LSHTC datasets. This
evaluation used macro f1 score as a performance measure. The observation was
that the performance of Hierarchical Softmax degrades as the number of classes
increase.
","[{'version': 'v1', 'created': 'Thu, 13 Dec 2018 23:57:33 GMT'}]",2018-12-17,"[['Mohammed', 'Abdul Arfat', ''], ['Umaashankar', 'Venkatesh', '']]","['Natural Language Processing', 'LSHTC', 'Fasttext', 'Hierarchical Softmax']"
1152,1703.08425,Vineet John,Vineet John,"Redynis: Traffic-aware dynamic repartitioning for a distributed
  key-value store","6 pages, 3 figures",,10.13140/RG.2.2.12252.39048,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most modern data stores tend to be distributed, to enable the scaling of the
data across multiple instances of commodity hardware. Although this ensures a
near unlimited potential for storage, the data itself is not always ideally
partitioned, and the cost of a network round-trip may cause a degradation of
end-user experience with respect to response latency. The problem being solved
is bringing the data objects closer to the frequent sources of requests using a
dynamic repartitioning algorithm. This is important if the objective is to
mitigate the overhead of network latency, and especially so if the partitions
are widely geo-distributed. The intention is to bring these features to an
existing distributed key-value store product, Redis.
","[{'version': 'v1', 'created': 'Fri, 24 Mar 2017 14:35:08 GMT'}]",2017-03-27,"[['John', 'Vineet', '']]","['dynamic repartitioning', 'key-value store', 'data placement']"
1153,1403.1949,Mehdi Naseriparsa,"Mehdi Naseriparsa, Mohammad Mansour Riahi Kashani","Combination of PCA with SMOTE Resampling to Boost the Prediction Rate in
  Lung Cancer Dataset","6 pages. arXiv admin note: text overlap with arXiv:1106.1813,
  arXiv:1001.1446 by other authors","International Journal of Computer Applications,Vol 77,No 3,pp
  33-38,2013",10.5120/13376-0987,,cs.LG cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classification algorithms are unable to make reliable models on the datasets
with huge sizes. These datasets contain many irrelevant and redundant features
that mislead the classifiers. Furthermore, many huge datasets have imbalanced
class distribution which leads to bias over majority class in the
classification process. In this paper combination of unsupervised
dimensionality reduction methods with resampling is proposed and the results
are tested on Lung-Cancer dataset. In the first step PCA is applied on
Lung-Cancer dataset to compact the dataset and eliminate irrelevant features
and in the second step SMOTE resampling is carried out to balance the class
distribution and increase the variety of sample domain. Finally, Naive Bayes
classifier is applied on the resulting dataset and the results are compared and
evaluation metrics are calculated. The experiments show the effectiveness of
the proposed method across four evaluation metrics: Overall accuracy, False
Positive Rate, Precision, Recall.
","[{'version': 'v1', 'created': 'Sat, 8 Mar 2014 08:12:54 GMT'}]",2014-03-11,"[['Naseriparsa', 'Mehdi', ''], ['Kashani', 'Mohammad Mansour Riahi', '']]","['PCA', 'Irrelevant Features', 'Unsupervised Dimensionality Reduction', 'SMOTE']"
1154,1706.07956,Vito Bellini,"Vito Bellini, Vito Walter Anelli, Tommaso Di Noia, Eugenio Di Sciascio","Auto-Encoding User Ratings via Knowledge Graphs in Recommendation
  Scenarios",,,10.1145/3125486.3125496,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last decade, driven also by the availability of an unprecedented
computational power and storage capabilities in cloud environments we assisted
to the proliferation of new algorithms, methods, and approaches in two areas of
artificial intelligence: knowledge representation and machine learning. On the
one side, the generation of a high rate of structured data on the Web led to
the creation and publication of the so-called knowledge graphs. On the other
side, deep learning emerged as one of the most promising approaches in the
generation and training of models that can be applied to a wide variety of
application fields. More recently, autoencoders have proven their strength in
various scenarios, playing a fundamental role in unsupervised learning. In this
paper, we instigate how to exploit the semantic information encoded in a
knowledge graph to build connections between units in a Neural Network, thus
leading to a new method, SEM-AUTO, to extract and weigh semantic features that
can eventually be used to build a recommender system. As adding content-based
side information may mitigate the cold user problems, we tested how our
approach behave in the presence of a few rating from a user on the Movielens 1M
dataset and compare results with BPRSLIM.
","[{'version': 'v1', 'created': 'Sat, 24 Jun 2017 13:46:40 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Jul 2017 17:18:45 GMT'}]",2017-07-25,"[['Bellini', 'Vito', ''], ['Anelli', 'Vito Walter', ''], ['Di Noia', 'Tommaso', ''], ['Di Sciascio', 'Eugenio', '']]","['Recommender Systems', 'Deep Learning', 'Autoencoders', 'Knowledgegraphs', 'Linked Open Data', 'DBpedia']"
1155,1106.5273,L. A. Barba,"R. Yokota, L. A. Barba, T. Narumi, and K. Yasuoka","Petascale turbulence simulation using a highly parallel fast multipole
  method on GPUs",,,10.1016/j.cpc.2012.09.011,,cs.NA physics.comp-ph physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper reports large-scale direct numerical simulations of
homogeneous-isotropic fluid turbulence, achieving sustained performance of 1.08
petaflop/s on gpu hardware using single precision. The simulations use a vortex
particle method to solve the Navier-Stokes equations, with a highly parallel
fast multipole method (FMM) as numerical engine, and match the current record
in mesh size for this application, a cube of 4096^3 computational points solved
with a spectral method. The standard numerical approach used in this field is
the pseudo-spectral method, relying on the FFT algorithm as numerical engine.
The particle-based simulations presented in this paper quantitatively match the
kinetic energy spectrum obtained with a pseudo-spectral method, using a trusted
code. In terms of parallel performance, weak scaling results show the fmm-based
vortex method achieving 74% parallel efficiency on 4096 processes (one gpu per
mpi process, 3 gpus per node of the TSUBAME-2.0 system). The FFT-based spectral
method is able to achieve just 14% parallel efficiency on the same number of
mpi processes (using only cpu cores), due to the all-to-all communication
pattern of the FFT algorithm. The calculation time for one time step was 108
seconds for the vortex method and 154 seconds for the spectral method, under
these conditions. Computing with 69 billion particles, this work exceeds by an
order of magnitude the largest vortex method calculations to date.
","[{'version': 'v1', 'created': 'Sun, 26 Jun 2011 22:05:59 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Aug 2012 18:47:50 GMT'}, {'version': 'v3', 'created': 'Mon, 3 Sep 2012 19:51:02 GMT'}]",2012-10-30,"[['Yokota', 'R.', ''], ['Barba', 'L. A.', ''], ['Narumi', 'T.', ''], ['Yasuoka', 'K.', '']]","['isotropic turbulence', 'fast multipole method', 'integral equations', 'gpu']"
1156,2102.03139,"Sebastian M\""uller","Bartosz Ku\'smierz, Sebastian M\""uller, Angelo Capossele",Committee selection in DAG distributed ledgers and applications,,"Lecture Notes in Networks and Systems, vol 284. Springer, Cham.
  (2021)",10.1007/978-3-030-80126-7_59,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose several solutions to the committee selection
problem among participants of a DAG distributed ledger. Our methods are based
on a ledger intrinsic reputation model that serves as a selection criterion.
The main difficulty arises from the fact that the DAG ledger is a priori not
totally ordered and that the participants need to reach a consensus on
participants' reputation. Furthermore, we outline applications of the proposed
protocols, including: (i) self-contained decentralized random number beacon;
(ii) selection of oracles in smart contracts; (iii) applications in consensus
protocols and sharding solutions. We conclude with a discussion on the security
and liveness of the proposed protocols by modeling reputation with a Zipf law.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2021 12:31:26 GMT'}]",2022-07-06,"[['Kuśmierz', 'Bartosz', ''], ['Müller', 'Sebastian', ''], ['Capossele', 'Angelo', '']]","['decentralized systems', 'distributed ledgers', 'DAG', 'reputation model', 'security']"
1157,1801.02199,Yuni Iwamasa,"Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivny",A tractable class of binary VCSPs via M-convex intersection,Full version of a STACS'18 paper,ACM Transactions on Algorithms 15(3) Article no. 44 (2019),10.1145/3329862,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A binary VCSP is a general framework for the minimization problem of a
function represented as the sum of unary and binary cost functions. An
important line of VCSP research is to investigate what functions can be solved
in polynomial time. Cooper and \v{Z}ivn\'{y} classified the tractability of
binary VCSP instances according to the concept of ""triangle,"" and showed that
the only interesting tractable case is the one induced by the joint winner
property (JWP). Recently, Iwamasa, Murota, and \v{Z}ivn\'{y} made a link
between VCSP and discrete convex analysis, showing that a function satisfying
the JWP can be transformed into a function represented as the sum of two
quadratic M-convex functions, which can be minimized in polynomial time via an
M-convex intersection algorithm if the value oracle of each M-convex function
is given. In this paper, we give an algorithmic answer to a natural question:
What binary finite-valued CSP instances can be represented as the sum of two
quadratic M-convex functions and can be solved in polynomial time via an
M-convex intersection algorithm? We solve this problem by devising a
polynomial-time algorithm for obtaining a concrete form of the representation
in the representable case. Our result presents a larger tractable class of
binary finite-valued CSPs, which properly contains the JWP class.
","[{'version': 'v1', 'created': 'Sun, 7 Jan 2018 15:38:31 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Jul 2019 06:04:06 GMT'}]",2019-07-18,"[['Hirai', 'Hiroshi', ''], ['Iwamasa', 'Yuni', ''], ['Murota', 'Kazuo', ''], ['Zivny', 'Stanislav', '']]","['valued constraint satisfaction problems', 'discrete convex analysis', 'Mconvexity']"
1158,1811.11121,Fabio Lobato,"Marcelo Augusto Muniz Teixeira, F\'abio Manoel Fran\c{c}a Lobato,
  Beatriz Nery Rodrigues Chagas, Antonio Fernando Lavareda Jacob Junior","Um Sistema de Aquisi\c{c}\~ao e An\'alise de Dados para Extra\c{c}\~ao
  de Conhecimento da Plataforma Ebit","in Portuguese, Paper presented at the 15th International Conference
  On Information Systems & Technology Management",,10.5748/9788599693148-15CONTECSI/PS-5903,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The internet development and the consequent change in communication forms
have strengthened as online social networks, increasing the involvement of
people with this media and making consumers of products and services, which are
more informed and demanding for companies. This context has given rise to
Social CRM, which can be put into practice by means of electronic word of mouth
platforms, enable web sharing of comments and evaluations about companies,
defining their reputation. However, most electronic word of mouth platforms do
not provide information for extracting your information, making it difficult to
analyze the data. To satisfy this gap, a system was developed to capture and
automatically summarize the data of the companies registered in the eBit
platform.
","[{'version': 'v1', 'created': 'Tue, 27 Nov 2018 17:32:32 GMT'}]",2018-11-28,"[['Teixeira', 'Marcelo Augusto Muniz', ''], ['Lobato', 'Fábio Manoel França', ''], ['Chagas', 'Beatriz Nery Rodrigues', ''], ['Junior', 'Antonio Fernando Lavareda Jacob', '']]","['Social Networks', 'Electronic Word of Mouth', 'Social CRM']"
1159,1808.01541,Keita Tsuji,Keita Tsuji,"Statistics on Open Access Books Available through the Directory of Open
  Access Books",,"International Journal of Academic Library and Information Science,
  Vol. 6, No. 4, pp. 86-100, 2018",10.14662/IJALIS2018.031,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Open Access (OA) books available through the Directory of Open Access Books
(DOAB) are investigated and the number of titles, the distribution of subjects,
languages, publishers, publication years, licensing patterns, etc., are
clarified. Their chronological changes are also shown. The sample comprised
10,866 OA books, which were available through the DOAB as of February 24, 2018.
The results show that OA books are increasing in number at an accelerating
rate. As for distribution of subjects, Social Sciences (""H"" in the Library of
Congress Classification [LCC] codes), Science (""Q"" in LCC) and World History
and History of Europe, Asia, Africa, Australia, New Zealand, etc. (""D"" in LCC)
are the most popular. As for languages, English, French, and German are the
most popular. As for publishers, Frontiers Media SA, Presses universitaires de
Rennes, and ANU Press are the most popular. Many books are newly published
ones, but older books, published in or before 1999, also began to be available
recently. As for the licensing patterns, ""CC by-nc-nd"" and ""CC by"" are the most
popular. Considering these tendencies, libraries should begin to utilize OA
books.
","[{'version': 'v1', 'created': 'Sat, 4 Aug 2018 22:59:36 GMT'}]",2018-08-07,"[['Tsuji', 'Keita', '']]","['Open Access Books', 'OA books', 'OA monographs', 'Directory of Open Access Books', 'DOAB']"
1160,1311.6126,Valmir Barbosa,"Leonardo I. L. Oliveira, Valmir C. Barbosa, F\'abio Protti","An energy function and its application to the periodic behavior of
  k-reversible processes",,"Discrete Applied Mathematics 245 (2018), 77-93",10.1016/j.dam.2017.07.005,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the graph dynamical systems known as k-reversible processes. In
such processes, each vertex in the graph has one of two possible states at each
discrete time step. Each vertex changes its state between the current time and
the next if and only if it currently has at least k neighbors in a state
different than its own. For such processes, we present a monotonic function
similar to the decreasing energy functions used to study threshold networks.
Using this new function, we show an alternative proof for the maximum period
length in a k-reversible process and provide better upper bounds on the
transient length in both the general case and the case of trees.
","[{'version': 'v1', 'created': 'Sun, 24 Nov 2013 14:12:41 GMT'}]",2018-06-06,"[['Oliveira', 'Leonardo I. L.', ''], ['Barbosa', 'Valmir C.', ''], ['Protti', 'Fábio', '']]","['k-reversible processes', 'Threshold networks', 'Energy function', 'Graph dynamical systems']"
1161,1312.4967,Stefanie Wuhrer,"Stefanie Wuhrer, Leonid Pishchulin, Alan Brunton, Chang Shu and Jochen
  Lang",Estimation of Human Body Shape and Posture Under Clothing,"23 pages, 11 figures","Computer Vision and Image Understanding, 127, pp. 31-42, 2014",10.1016/j.cviu.2014.06.012,,cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Estimating the body shape and posture of a dressed human subject in motion
represented as a sequence of (possibly incomplete) 3D meshes is important for
virtual change rooms and security. To solve this problem, statistical shape
spaces encoding human body shape and posture variations are commonly used to
constrain the search space for the shape estimate. In this work, we propose a
novel method that uses a posture-invariant shape space to model body shape
variation combined with a skeleton-based deformation to model posture
variation. Our method can estimate the body shape and posture of both static
scans and motion sequences of dressed human body scans. In case of motion
sequences, our method takes advantage of motion cues to solve for a single body
shape estimate along with a sequence of posture estimates. We apply our
approach to both static scans and motion sequences and demonstrate that using
our method, higher fitting accuracy is achieved than when using a variant of
the popular SCAPE model as statistical model.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2013 21:01:05 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Jun 2014 13:03:22 GMT'}]",2015-03-30,"[['Wuhrer', 'Stefanie', ''], ['Pishchulin', 'Leonid', ''], ['Brunton', 'Alan', ''], ['Shu', 'Chang', ''], ['Lang', 'Jochen', '']]","['digital human shape and posture modeling', 'statistical shape space', 'geometry processing']"
1162,1204.1433,Ahmed Hassan,"Ahmed Hassan M. Hassan, Bin Dai, Benxiong Huang, Edriss Eisa and
  Muhammad Azhar","Relay selection for multiple access relay channel with decode-forward
  and analog network coding","11 pages, 5 figures; International Journal of Distributed and
  Parallel Systems (IJDPS) Vol.3, No.2, March 2012",,10.5121/ijdps.2012.3201,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a relay selection for decode-and-forward based on network
coding (DF-NC) and analog-NC protocols in general scheme of cellular network
system. In the propose scheme the two source node simultaneously transmit their
own information to all the relays as well as the destination node, and then, a
single relay i.e. best with a minimum symbol error rate (SER) will be selected
to forward the new version of the received signal. Simulation results show
that, the DF-NC scheme with considerable performance has exactness over
analog-NC scheme. To improve the system performance, optimal power allocation
between the two sources and the best relay is determined based on the
asymptotic SER. By increasing the number of relays node, the optimum power
allocation achieve better performance than asymptotic SER.
","[{'version': 'v1', 'created': 'Fri, 6 Apr 2012 08:24:38 GMT'}]",2012-04-09,"[['Hassan', 'Ahmed Hassan M.', ''], ['Dai', 'Bin', ''], ['Huang', 'Benxiong', ''], ['Eisa', 'Edriss', ''], ['Azhar', 'Muhammad', '']]","['analog network coding', 'decode-forward', 'relay selection', 'multiple access relay channel']"
1163,1811.01745,James P. Crutchfield,"Ryan G. James, Jeffrey Emenheiser, and James P. Crutchfield",Unique Information and Secret Key Agreement,"9 pages, 3 figures, 4 tables;
  http://csc.ucdavis.edu/~cmg/compmech/pubs/pid_skar.htm. arXiv admin note:
  text overlap with arXiv:1808.08606",,10.3390/e21010012,,cs.IT cond-mat.stat-mech math.IT nlin.CD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The partial information decomposition (PID) is a promising framework for
decomposing a joint random variable into the amount of influence each source
variable Xi has on a target variable Y, relative to the other sources. For two
sources, influence breaks down into the information that both X0 and X1
redundantly share with Y, what X0 uniquely shares with Y, what X1 uniquely
shares with Y, and finally what X0 and X1 synergistically share with Y.
Unfortunately, considerable disagreement has arisen as to how these four
components should be quantified. Drawing from cryptography, we consider the
secret key agreement rate as an operational method of quantifying unique
informations. Secret key agreement rate comes in several forms, depending upon
which parties are permitted to communicate. We demonstrate that three of these
four forms are inconsistent with the PID. The remaining form implies certain
interpretations as to the PID's meaning---interpretations not present in PID's
definition but that, we argue, need to be explicit. These reveal an
inconsistency between third-order connected information, two-way secret key
agreement rate, and synergy. Similar difficulties arise with a popular PID
measure in light the results here as well as from a maximum entropy viewpoint.
We close by reviewing the challenges facing the PID.
","[{'version': 'v1', 'created': 'Thu, 1 Nov 2018 21:03:38 GMT'}]",2019-01-30,"[['James', 'Ryan G.', ''], ['Emenheiser', 'Jeffrey', ''], ['Crutchfield', 'James P.', '']]","['information theory', 'partial information decomposition', 'secret key agreement', 'cryptography']"
1164,1812.07872,Alexander Goncharenko,"Alexander Goncharenko, Andrey Denisov, Sergey Alyamkin, Evgeny
  Terentev","Fast Adjustable Threshold For Uniform Neural Network Quantization
  (Winning solution of LPIRC-II)",,,10.1007/978-3-030-20518-8_26,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Neural network quantization procedure is the necessary step for porting of
neural networks to mobile devices. Quantization allows accelerating the
inference, reducing memory consumption and model size. It can be performed
without fine-tuning using calibration procedure (calculation of parameters
necessary for quantization), or it is possible to train the network with
quantization from scratch. Training with quantization from scratch on the
labeled data is rather long and resource-consuming procedure. Quantization of
network without fine-tuning leads to accuracy drop because of outliers which
appear during the calibration. In this article we suggest to simplify the
quantization procedure significantly by introducing the trained scale factors
for quantization thresholds. It allows speeding up the process of quantization
with fine-tuning up to 8 epochs as well as reducing the requirements to the set
of train images. By our knowledge, the proposed method allowed us to get the
first public available quantized version of MNAS without significant accuracy
reduction - 74.8% vs 75.3% for original full-precision network. Model and code
are ready for use and available at:
https://github.com/agoncharenko1992/FAT-fast_adjustable_threshold.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2018 10:54:32 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Dec 2018 04:44:48 GMT'}, {'version': 'v3', 'created': 'Tue, 18 Jun 2019 04:48:29 GMT'}]",2019-06-27,"[['Goncharenko', 'Alexander', ''], ['Denisov', 'Andrey', ''], ['Alyamkin', 'Sergey', ''], ['Terentev', 'Evgeny', '']]","['Distillation', 'Machine Learning', 'NeuralNetworks', 'Quantization']"
1165,2212.01440,Xiaoting Li,"Xiaoting Li, Yuhang Wu, Vineeth Rakesh, Yusan Lin, Hao Yang, Fei Wang","SMARTQUERY: An Active Learning Framework for Graph Neural Networks
  through Hybrid Uncertainty Reduction",,"ACM International Conference on Information & Knowledge Management
  (2022) 4199-4203",10.1145/3511808.3557701,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph neural networks have achieved significant success in representation
learning. However, the performance gains come at a cost; acquiring
comprehensive labeled data for training can be prohibitively expensive. Active
learning mitigates this issue by searching the unexplored data space and
prioritizing the selection of data to maximize model's performance gain. In
this paper, we propose a novel method SMARTQUERY, a framework to learn a graph
neural network with very few labeled nodes using a hybrid uncertainty reduction
function. This is achieved using two key steps: (a) design a multi-stage active
graph learning framework by exploiting diverse explicit graph information and
(b) introduce label propagation to efficiently exploit known labels to assess
the implicit embedding information. Using a comprehensive set of experiments on
three network datasets, we demonstrate the competitive performance of our
method against state-of-the-arts on very few labeled data (up to 5 labeled
nodes per class).
","[{'version': 'v1', 'created': 'Fri, 2 Dec 2022 20:49:38 GMT'}]",2022-12-06,"[['Li', 'Xiaoting', ''], ['Wu', 'Yuhang', ''], ['Rakesh', 'Vineeth', ''], ['Lin', 'Yusan', ''], ['Yang', 'Hao', ''], ['Wang', 'Fei', '']]","['active learning', 'graph neural networks', 'candidate pool', 'label propagation', 'hybrid uncertainty reduction']"
1166,1408.0680,Rafael Berri A,"Rafael A. Berri, Alexandre G. Silva, Rafael S. Parpinelli, Elaine
  Girardi, Rangel Arthur","A Pattern Recognition System for Detecting Use of Mobile Phones While
  Driving","8 pages, 9th International Conference on Computer Vision Theory and
  Applications",,10.5220/0004684504110418,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is estimated that 80% of crashes and 65% of near collisions involved
drivers inattentive to traffic for three seconds before the event. This paper
develops an algorithm for extracting characteristics allowing the cell phones
identification used during driving a vehicle. Experiments were performed on
sets of images with 100 positive images (with phone) and the other 100 negative
images (no phone), containing frontal images of the driver. Support Vector
Machine (SVM) with Polynomial kernel is the most advantageous classification
system to the features provided by the algorithm, obtaining a success rate of
91.57% for the vision system. Tests done on videos show that it is possible to
use the image datasets for training classifiers in real situations. Periods of
3 seconds were correctly classified at 87.43% of cases.
","[{'version': 'v1', 'created': 'Mon, 4 Aug 2014 13:35:24 GMT'}]",2014-08-12,"[['Berri', 'Rafael A.', ''], ['Silva', 'Alexandre G.', ''], ['Parpinelli', 'Rafael S.', ''], ['Girardi', 'Elaine', ''], ['Arthur', 'Rangel', '']]","['Driver distraction', 'cell phones', 'machine learning', 'Support Vector Machines', 'skin segmentation', 'ComputerVision', 'Genetic Algorithm']"
1167,2102.05851,Joseph Chow,"Bingqing Liu, Theodoros P. Pantelidis, Stephanie Tam, Joseph Y. J.
  Chow","An electric vehicle charging station access equilibrium model with M/D/C
  queueing",,International Journal of Sustainable Transportation (2022),10.1080/15568318.2022.2029633,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Despite the dependency of electric vehicle (EV) fleets on charging station
availability, charging infrastructure remains limited in many cities. Three
contributions are made. First, we propose an EV-to-charging station user
equilibrium (UE) assignment model with a M/D/C queue approximation as a
nondifferentiable nonlinear program. Second, to address the
non-differentiability of the queue delay function, we propose an original
solution algorithm based on the derivative-free Method of Successive Averages.
Computational tests with a toy network show that the model converges to a UE. A
working code in Python is provided free on Github with detailed test cases.
Third, the model is applied to the large-scale case study of New York City
Department of Citywide Administrative Services (NYC DCAS) fleet and EV charging
station configuration as of July 8, 2020, which includes unique, real data for
563 Level 2 chargers and 4 Direct Current Fast Chargers (DCFCs) and 1484 EVs
distributed over 512 Traffic Analysis Zones. The arrival rates of the
assignment model are calibrated in the base scenario to fit an observed average
utilization ratio of 7.6% in NYC. The model is then applied to compare charging
station investment policies of DCFCs to Level 2 charging stations based on two
alternative criteria. Results suggest a policy based on selecting locations
with high utilization ratio instead of with high queue delay.
","[{'version': 'v1', 'created': 'Thu, 11 Feb 2021 05:23:36 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Sep 2021 19:41:03 GMT'}]",2022-09-14,"[['Liu', 'Bingqing', ''], ['Pantelidis', 'Theodoros P.', ''], ['Tam', 'Stephanie', ''], ['Chow', 'Joseph Y. J.', '']]","['electric vehicle', 'charging stations', 'user equilibrium', 'Method of Successive Averages', 'M/D/C queue', 'New York City']"
1168,1812.07264,Niklas Carlsson,Niklas Carlsson and Derek Eager,"Worst-case Bounds and Optimized Cache on $M^{th}$ Request Cache
  Insertion Policies under Elastic Conditions","To appear in IFIP Performance, Dec. 2018, Toulouse, France. The final
  version will appear in Performance Evaluation, volumes 127-128, Nov. 2018,
  pp. 70-92",,10.1016/j.peva.2018.09.006,,cs.NI cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud services and other shared third-party infrastructures allow individual
content providers to easily scale their services based on current resource
demands. In this paper, we consider an individual content provider that wants
to minimize its delivery costs under the assumptions that the storage and
bandwidth resources it requires are elastic, the content provider only pays for
the resources that it consumes, and costs are proportional to the resource
usage. Within this context, we (i) derive worst-case bounds for the optimal
cost and competitive cost ratios of different classes of ""cache on $M^{th}$
request"" cache insertion policies, (ii) derive explicit average cost
expressions and bounds under arbitrary inter-request distributions, (iii)
derive explicit average cost expressions and bounds for short-tailed
(deterministic, Erlang, and exponential) and heavy-tailed (Pareto)
inter-request distributions, and (iv) present numeric and trace-based
evaluations that reveal insights into the relative cost performance of the
policies. Our results show that a window-based ""cache on $2^{nd}$ request""
policy using a single threshold optimized to minimize worst-case costs provides
good average performance across the different distributions and the full
parameter ranges of each considered distribution, making it an attractive
choice for a wide range of practical conditions where request rates of
individual file objects typically are not known and can change quickly.
","[{'version': 'v1', 'created': 'Tue, 18 Dec 2018 09:48:47 GMT'}]",2018-12-19,"[['Carlsson', 'Niklas', ''], ['Eager', 'Derek', '']]","['Caching', 'Worst-case bounds', 'Optimized insertion policies']"
1169,1711.07886,Fayyaz Minhas,"Abdul Hannan Basit, Wajid Arshad Abbasi, Amina Asif, and Fayyaz Ul
  Amir Afsar Minhas","Training large margin host-pathogen protein-protein interaction
  predictors",12 pages,Journal of Bioinformatics and Computational Biology 2018,10.1142/S0219720018500142,"Vol. 16, No. 04 1850014",cs.LG q-bio.QM stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detection of protein-protein interactions (PPIs) plays a vital role in
molecular biology. Particularly, infections are caused by the interactions of
host and pathogen proteins. It is important to identify host-pathogen
interactions (HPIs) to discover new drugs to counter infectious diseases.
Conventional wet lab PPI prediction techniques have limitations in terms of
large scale application and budget. Hence, computational approaches are
developed to predict PPIs. This study aims to develop large margin machine
learning models to predict interspecies PPIs with a special interest in
host-pathogen protein interactions (HPIs). Especially, we focus on seeking
answers to three queries that arise while developing an HPI predictor. 1) How
should we select negative samples? 2) What should be the size of negative
samples as compared to the positive samples? 3) What type of margin violation
penalty should be used to train the predictor? We compare two available methods
for negative sampling. Moreover, we propose a new method of assigning weights
to each training example in weighted SVM depending on the distance of the
negative examples from the positive examples. We have also developed a web
server for our HPI predictor called HoPItor (Host Pathogen Interaction
predicTOR) that can predict interactions between human and viral proteins. This
webserver can be accessed at the URL:
http://faculty.pieas.edu.pk/fayyaz/software.html#HoPItor.
","[{'version': 'v1', 'created': 'Tue, 21 Nov 2017 16:31:43 GMT'}]",2019-03-26,"[['Basit', 'Abdul Hannan', ''], ['Abbasi', 'Wajid Arshad', ''], ['Asif', 'Amina', ''], ['Minhas', 'Fayyaz Ul Amir Afsar', '']]","['host-pathogen interactions', 'interaction predictor', 'protein-protein interactions', 'negative sampling', 'margin violation penalty', 'hopitor']"
1170,2102.06027,Zhengyang Zhou,"Zhengyang Zhou, Yang Wang, Xike Xie, Lei Qiao, Yuantao Li","STUaNet: Understanding uncertainty in spatiotemporal collective human
  mobility","12 pages, 8 figures, WWW 2021 Conference",,10.1145/3442381.3449817,,cs.LG cs.NA math.NA,http://creativecommons.org/licenses/by/4.0/,"  The high dynamics and heterogeneous interactions in the complicated urban
systems have raised the issue of uncertainty quantification in spatiotemporal
human mobility, to support critical decision-makings in risk-aware web
applications such as urban event prediction where fluctuations are of
significant interests. Given the fact that uncertainty quantifies the potential
variations around prediction results, traditional learning schemes always lack
uncertainty labels, and conventional uncertainty quantification approaches
mostly rely upon statistical estimations with Bayesian Neural Networks or
ensemble methods. However, they have never involved any spatiotemporal
evolution of uncertainties under various contexts, and also have kept suffering
from the poor efficiency of statistical uncertainty estimation while training
models with multiple times. To provide high-quality uncertainty quantification
for spatiotemporal forecasting, we propose an uncertainty learning mechanism to
simultaneously estimate internal data quality and quantify external uncertainty
regarding various contextual interactions. To address the issue of lacking
labels of uncertainty, we propose a hierarchical data turbulence scheme where
we can actively inject controllable uncertainty for guidance, and hence provide
insights to both uncertainty quantification and weak supervised learning.
Finally, we re-calibrate and boost the prediction performance by devising a
gated-based bridge to adaptively leverage the learned uncertainty into
predictions. Extensive experiments on three real-world spatiotemporal mobility
sets have corroborated the superiority of our proposed model in terms of both
forecasting and uncertainty quantification.
","[{'version': 'v1', 'created': 'Tue, 9 Feb 2021 01:43:27 GMT'}]",2021-02-12,"[['Zhou', 'Zhengyang', ''], ['Wang', 'Yang', ''], ['Xie', 'Xike', ''], ['Qiao', 'Lei', ''], ['Li', 'Yuantao', '']]","['Uncertainty quantification', 'human mobility', 'spatiotemporal datamining', 'web of things']"
1171,1505.06747,Jose Rodrigues Jr,"Gabriel Gimenes, Robson Cordeiro, Jose F. Rodrigues-Jr","ORFEL: efficient detection of defamation or illegitimate promotion in
  online recommendation","http://www.sciencedirect.com/science/article/pii/S0020025516307320.
  Information Sciences, Available online 5 September 2016, ISSN 0020-0255","Gabriel Gimenes, Robson Cordeiro, Jose Rodrigues-Jr (2016); ORFEL:
  Efficient detection of defamation or illegitimate promotion in online
  recommendation; Elsevier Information Sciences 379: 10. 274 - 287",10.1016/j.ins.2016.09.006.,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  What if a successful company starts to receive a torrent of low-valued (one
or two stars) recommendations in its mobile apps from multiple users within a
short (say one month) period of time? Is it legitimate evidence that the apps
have lost in quality, or an intentional plan (via lockstep behavior) to steal
market share through defamation? In the case of a systematic attack to one's
reputation, it might not be possible to manually discern between legitimate and
fraudulent interaction within the huge universe of possibilities of
user-product recommendation. Previous works have focused on this issue, but
none of them took into account the context, modeling, and scale that we
consider in this paper. Here, we propose the novel method Online-Recommendation
Fraud ExcLuder (ORFEL) to detect defamation and/or illegitimate promotion of
online products by using vertex-centric asynchronous parallel processing of
bipartite (users-products) graphs. With an innovative algorithm, our results
demonstrate both efficacy and efficiency -- over 95% of potential attacks were
detected, and ORFEL was at least two orders of magnitude faster than the
state-of-the-art. Over a novel methodology, our main contributions are: (1) a
new algorithmic solution; (2) one scalable approach; and (3) a novel context
and modeling of the problem, which now addresses both defamation and
illegitimate promotion. Our work deals with relevant issues of the Web 2.0,
potentially augmenting the credibility of online recommendation to prevent
losses to both customers and vendors.
","[{'version': 'v1', 'created': 'Mon, 25 May 2015 20:09:54 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Jun 2015 18:49:15 GMT'}, {'version': 'v3', 'created': 'Tue, 21 Jul 2015 17:37:27 GMT'}, {'version': 'v4', 'created': 'Fri, 6 Nov 2015 20:21:31 GMT'}, {'version': 'v5', 'created': 'Wed, 14 Sep 2016 21:09:08 GMT'}, {'version': 'v6', 'created': 'Wed, 23 Nov 2016 13:43:57 GMT'}]",2016-11-24,"[['Gimenes', 'Gabriel', ''], ['Cordeiro', 'Robson', ''], ['Rodrigues-Jr', 'Jose F.', '']]","['graphs', 'fraud detection', 'defamation', 'recommendation', 'Web2']"
1172,1408.2564,Ally Nyamawe S,Ally S. Nyamawe,"A Proposed Framework for Development of a Visualizer Based on Memory
  Transfer Language (MTL)","5 Pages, 15 Figures, Published with International Journal of Computer
  Trends and Technology (IJCTT)",,10.14445/22312803/IJCTT-V13P136,,cs.PL,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Computer programming is among the fundamental aspects of computer science
curriculum. Many students first introduced to introductory computer programming
courses experience difficulties in learning and comprehending. Vast amount of
researches have revealed that, generally programming courses are regarded as
difficult and challenging and thus often have the highest dropout rates.
Moreover, numerous researches have devoted in delivering new approaches and
tools in enhancing the process of teaching and learning computer programming to
novice programmers. One among the tools that have emerged to offer positive
results is Program Visualization tool (Visualizer). Visualizers have shown
remarkable contributions in facilitating novices to learn and comprehend
computer programming. In addition to that, an approach to visualize codes
execution, Memory Transfer Language (MTL), allows a novice to animate the code
through paper and pencil mechanism without actively involving the machine. MTL
depends on the concepts of RAM (Random Access Memory) to interpret the code
line by line. Programming requires effort and special approach in the way it is
learned and taught, thus this paper aimed at presenting a proposed framework
for developing a visualizer that employs the use of MTL to enhance teaching and
learning programming.
","[{'version': 'v1', 'created': 'Mon, 11 Aug 2014 21:35:00 GMT'}]",2014-08-13,"[['Nyamawe', 'Ally S.', '']]","['MTL', 'RAM', 'Programming', 'Novice Programmer']"
1173,1901.10530,Manik Sharma Dr.,"M. Sharma, G. Singh and R. Singh","An Advanced Conceptual Diagnostic Healthcare Framework for Diabetes and
  Cardiovascular Disorders",11 PAGES,"EAI ENDORSED TRANSACTIONS ON SCALABLE INFORMATION SYSTEMS 5.18
  (2018)",10.4108/eai.19-6-2018.154828,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The data mining along with emerging computing techniques have astonishingly
influenced the healthcare industry. Researchers have used different Data Mining
and Internet of Things (IoT) for enrooting a programmed solution for diabetes
and heart patients. However, still, more advanced and united solution is needed
that can offer a therapeutic opinion to individual diabetic and cardio
patients. Therefore, here, a smart data mining and IoT (SMDIoT) based advanced
healthcare system for proficient diabetes and cardiovascular diseases have been
proposed. The hybridization of data mining and IoT with other emerging
computing techniques is supposed to give an effective and economical solution
to diabetes and cardio patients. SMDIoT hybridized the ideas of data mining,
Internet of Things, chatbots, contextual entity search (CES), bio-sensors,
semantic analysis and granular computing (GC). The bio-sensors of the proposed
system assist in getting the current and precise status of the concerned
patients so that in case of an emergency, the needful medical assistance can be
provided. The novelty lies in the hybrid framework and the adequate support of
chatbots, granular computing, context entity search and semantic analysis. The
practical implementation of this system is very challenging and costly.
However, it appears to be more operative and economical solution for diabetes
and cardio patients.
","[{'version': 'v1', 'created': 'Sun, 13 Jan 2019 15:46:24 GMT'}]",2019-01-31,"[['Sharma', 'M.', ''], ['Singh', 'G.', ''], ['Singh', 'R.', '']]","['Diabetes', 'Cardiovascular', 'IoT', 'Data Mining', 'Semantic Analysis', 'Granular Computing', 'chatbot']"
1174,0812.2518,Yeow Meng Chee,"Zhifang Zhang, Mulan Liu, Yeow Meng Chee, San Ling, and Huaxiong Wang","Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing
  Schemes",18 pages,"Advances in Cryptology - Asiacrypt 2008, vol. 5350 of Lecture
  Notes in Computer Science, pp. 19-36, Springer-Verlag, 2008",10.1007/978-3-540-89255-7,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Strongly multiplicative linear secret sharing schemes (LSSS) have been a
powerful tool for constructing secure multiparty computation protocols.
However, it remains open whether or not there exist efficient constructions of
strongly multiplicative LSSS from general LSSS. In this paper, we propose the
new concept of a 3-multiplicative LSSS, and establish its relationship with
strongly multiplicative LSSS. More precisely, we show that any 3-multiplicative
LSSS is a strongly multiplicative LSSS, but the converse is not true; and that
any strongly multiplicative LSSS can be efficiently converted into a
3-multiplicative LSSS. Furthermore, we apply 3-multiplicative LSSS to the
computation of unbounded fan-in multiplication, which reduces its round
complexity to four (from five of the previous protocol based on strongly
multiplicative LSSS). We also give two constructions of 3-multiplicative LSSS
from Reed-Muller codes and algebraic geometric codes. We believe that the
construction and verification of 3-multiplicative LSSS are easier than those of
strongly multiplicative LSSS. This presents a step forward in settling the open
problem of efficient constructions of strongly multiplicative LSSS from general
LSSS.
","[{'version': 'v1', 'created': 'Sat, 13 Dec 2008 02:59:37 GMT'}]",2008-12-16,"[['Zhang', 'Zhifang', ''], ['Liu', 'Mulan', ''], ['Chee', 'Yeow Meng', ''], ['Ling', 'San', ''], ['Wang', 'Huaxiong', '']]","['monotone span program', 'secure multi-party computation', 'stronglymultiplicative linear secret sharing scheme']"
1175,1809.00143,Alireza Haghighatkhah,"Alireza Haghighatkhah, Mika M\""antyl\""a, Markku Oivo, Pasi Kuvaja",Test Prioritization in Continuous Integration Environments,Journal of Systems and Software (2018),Journal of Systems and Software (2018),10.1016/j.jss.2018.08.061,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two heuristics namely diversity-based (DBTP) and history-based test
prioritization (HBTP) have been separately proposed in the literature. Yet,
their combination has not been widely studied in continuous integration (CI)
environments. The objective of this study is to catch regression faults
earlier, allowing developers to integrate and verify their changes more
frequently and continuously. To achieve this, we investigated six open-source
projects, each of which included several builds over a large time period.
Findings indicate that previous failure knowledge seems to have strong
predictive power in CI environments and can be used to effectively prioritize
tests. HBTP does not necessarily need to have large data, and its effectiveness
improves to a certain degree with larger history interval. DBTP can be used
effectively during the early stages, when no historical data is available, and
also combined with HBTP to improve its effectiveness. Among the investigated
techniques, we found that history-based diversity using NCD Multiset is
superior in terms of effectiveness but comes with relatively higher overhead in
terms of method execution time. Test prioritization in CI environments can be
effectively performed with negligible investment using previous failure
knowledge, and its effectiveness can be further improved by considering
dissimilarities among the tests.
","[{'version': 'v1', 'created': 'Sat, 1 Sep 2018 09:38:57 GMT'}]",2018-09-05,"[['Haghighatkhah', 'Alireza', ''], ['Mäntylä', 'Mika', ''], ['Oivo', 'Markku', ''], ['Kuvaja', 'Pasi', '']]","['Test case prioritization', 'regression testing', 'continuous integration', 'buildhistory', 'test diversity']"
1176,1604.06763,C\'eline Comte,Thomas Bonald and C\'eline Comte,Balanced Fair Resource Sharing in Computer Clusters,,,10.1016/j.peva.2017.08.006,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We represent a computer cluster as a multi-server queue with some arbitrary
bipartite graph of compatibilities between jobs and servers. Each server
processes its jobs sequentially in FCFS order. The service rate of a job at any
given time is the sum of the service rates of all servers processing this job.
We show that the corresponding queue is quasi-reversible and use this property
to design a scheduling algorithm achieving balanced fair sharing of the service
capacity.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2016 18:10:10 GMT'}, {'version': 'v2', 'created': 'Sat, 11 Mar 2017 10:43:51 GMT'}, {'version': 'v3', 'created': 'Mon, 4 Sep 2017 08:06:33 GMT'}]",2017-09-19,"[['Bonald', 'Thomas', ''], ['Comte', 'Céline', '']]","['Parallel processing', 'multi-server queues', 'balanced fairness', 'order independent queues', 'Whittle networks']"
1177,1603.00546,Jan Egger,"Jan Egger, Philip Voglreiter, Mark Dokter, Michael Hofmann, Xiaojun
  Chen, Wolfram G. Zoller, Dieter Schmalstieg, Alexander Hann","US-Cut: Interactive Algorithm for rapid Detection and Segmentation of
  Liver Tumors in Ultrasound Acquisitions","6 pages, 6 figures, 1 table, 32 references","SPIE Medical Imaging Conference 2016, Paper 9790-47",10.1117/12.2216509,,cs.CV cs.CE cs.CG cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ultrasound (US) is the most commonly used liver imaging modality worldwide.
It plays an important role in follow-up of cancer patients with liver
metastases. We present an interactive segmentation approach for liver tumors in
US acquisitions. Due to the low image quality and the low contrast between the
tumors and the surrounding tissue in US images, the segmentation is very
challenging. Thus, the clinical practice still relies on manual measurement and
outlining of the tumors in the US images. We target this problem by applying an
interactive segmentation algorithm to the US data, allowing the user to get
real-time feedback of the segmentation results. The algorithm has been
developed and tested hand-in-hand by physicians and computer scientists to make
sure a future practical usage in a clinical setting is feasible. To cover
typical acquisitions from the clinical routine, the approach has been evaluated
with dozens of datasets where the tumors are hyperechoic (brighter), hypoechoic
(darker) or isoechoic (similar) in comparison to the surrounding liver tissue.
Due to the interactive real-time behavior of the approach, it was possible even
in difficult cases to find satisfying segmentations of the tumors within
seconds and without parameter settings, and the average tumor deviation was
only 1.4mm compared with manual measurements. However, the long term goal is to
ease the volumetric acquisition of liver tumors in order to evaluate for
treatment response. Additional aim is the registration of intraoperative US
images via the interactive segmentations to the patient's pre-interventional CT
acquisitions.
","[{'version': 'v1', 'created': 'Wed, 2 Mar 2016 01:42:48 GMT'}]",2016-06-29,"[['Egger', 'Jan', ''], ['Voglreiter', 'Philip', ''], ['Dokter', 'Mark', ''], ['Hofmann', 'Michael', ''], ['Chen', 'Xiaojun', ''], ['Zoller', 'Wolfram G.', ''], ['Schmalstieg', 'Dieter', ''], ['Hann', 'Alexander', '']]","['Ultrasound', 'Liver Tumors', 'Segmentation', 'Detection', 'Interactive', 'Rapid']"
1178,1602.00484,Rodrigo Roman,"Rodrigo Roman, Javier Lopez, Masahiro Mambo","Mobile Edge Computing, Fog et al.: A Survey and Analysis of Security
  Threats and Challenges","In press, accepted manuscript: Future Generation Computer Systems",,10.1016/j.future.2016.11.009,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For various reasons, the cloud computing paradigm is unable to meet certain
requirements (e.g. low latency and jitter, context awareness, mobility support)
that are crucial for several applications (e.g. vehicular networks, augmented
reality). To fulfil these requirements, various paradigms, such as fog
computing, mobile edge computing, and mobile cloud computing, have emerged in
recent years. While these edge paradigms share several features, most of the
existing research is compartmentalised; no synergies have been explored. This
is especially true in the field of security, where most analyses focus only on
one edge paradigm, while ignoring the others. The main goal of this study is to
holistically analyse the security threats, challenges, and mechanisms inherent
in all edge paradigms, while highlighting potential synergies and venues of
collaboration. In our results, we will show that all edge paradigms should
consider the advances in other paradigms.
","[{'version': 'v1', 'created': 'Mon, 1 Feb 2016 11:46:41 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Nov 2016 09:47:59 GMT'}]",2016-11-15,"[['Roman', 'Rodrigo', ''], ['Lopez', 'Javier', ''], ['Mambo', 'Masahiro', '']]","['Security', 'Privacy', 'Cloud computing', 'Fog computing', 'Mobile edge computing', 'Mobile cloudcomputing']"
1179,1803.06845,Richard McClatchey,"Syeda ZarAfshan Gohera, Peter Bloodsworth, Raihan Ur Rasool, Richard
  McClatchey","Cloud Provider Capacity Augmentation Through Automated Resource
  Bartering","26 pages, 15 figures, 6 tables",Future Generation Computer Systems Vol 81 pp 203-218 April 2018,10.1016/j.future.2017.09.080,,cs.SE cs.DC cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Growing interest in Cloud Computing places a heavy workload on cloud
providers which is becoming increasingly difficult for them to manage with
their primary datacenter infrastructures. Resource limitations can make
providers vulnerable to significant reputational damage and it often forces
customers to select services from the larger, more established companies,
sometimes at a higher price. Funding limitations, however, commonly prevent
emerging and even established providers from making continual investment in
hardware speculatively assuming a certain level of growth in demand. As an
alternative, they may strive to use the current inter-cloud resource sharing
platforms which mainly rely on monetary payments and thus putting pressure on
already stretched cash flows. To address such issues, we have designed and
implemented a new multi-agent based Cloud Resource Bartering System (CRBS) that
fosters the management and bartering of pooled resources without requiring
costly financial transactions between providers. Agents in CRBS not only
strengthen the trading relationship among providers but also enable them to
handle surges in demand with their primary setup. Unlike existing systems, CRBS
assigns resources by considering resource urgency which comparatively improves
customers satisfaction and the resource utilization rate by more than 50%.The
evaluation results provide evidence that our system assists providers to timely
acquire the additional resources and to maintain sustainable service delivery.
We conclude that the existence of such a system is economically beneficial for
cloud providers and enables them to adapt to fluctuating workloads.
","[{'version': 'v1', 'created': 'Mon, 19 Mar 2018 09:39:06 GMT'}]",2018-03-20,"[['Gohera', 'Syeda ZarAfshan', ''], ['Bloodsworth', 'Peter', ''], ['Rasool', 'Raihan Ur', ''], ['McClatchey', 'Richard', '']]","['Cloud Computing', 'Resource Bartering', 'IAAS Cloud Providers', 'Barter Credits', 'Multi-Agent System (MAS)']"
1180,1807.11236,Liu Yongcheng,"Yongcheng Liu, Bin Fan, Lingfeng Wang, Jun Bai, Shiming Xiang,
  Chunhong Pan","Semantic Labeling in Very High Resolution Images via a Self-Cascaded
  Convolutional Neural Network",accepted by ISPRS Journal of Photogrammetry and Remote Senseing 2017,,10.1016/j.isprsjprs.2017.12.007,,cs.CV cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semantic labeling for very high resolution (VHR) images in urban areas, is of
significant importance in a wide range of remote sensing applications. However,
many confusing manmade objects and intricate fine-structured objects make it
very difficult to obtain both coherent and accurate labeling results. For this
challenging task, we propose a novel deep model with convolutional neural
networks (CNNs), i.e., an end-to-end self-cascaded network (ScasNet).
Specifically, for confusing manmade objects, ScasNet improves the labeling
coherence with sequential global-to-local contexts aggregation. Technically,
multi-scale contexts are captured on the output of a CNN encoder, and then they
are successively aggregated in a self-cascaded manner. Meanwhile, for
fine-structured objects, ScasNet boosts the labeling accuracy with a
coarse-to-fine refinement strategy. It progressively refines the target objects
using the low-level features learned by CNN's shallow layers. In addition, to
correct the latent fitting residual caused by multi-feature fusion inside
ScasNet, a dedicated residual correction scheme is proposed. It greatly
improves the effectiveness of ScasNet. Extensive experimental results on three
public datasets, including two challenging benchmarks, show that ScasNet
achieves the state-of-the-art performance.
","[{'version': 'v1', 'created': 'Mon, 30 Jul 2018 08:49:25 GMT'}]",2018-07-31,"[['Liu', 'Yongcheng', ''], ['Fan', 'Bin', ''], ['Wang', 'Lingfeng', ''], ['Bai', 'Jun', ''], ['Xiang', 'Shiming', ''], ['Pan', 'Chunhong', '']]","['Semantic labeling', 'Convolutional neural networks (CNNs)', 'Multi-scale contexts', 'End-to-end']"
1181,1606.06702,Ji Hwan Park,"Ji Hwan Park, Seyedkoosha Mirhosseini, Saad Nadeem, Joseph Marino,
  Arie Kaufman, Kevin Baker, Matthew Barish","Crowdsourcing for Identification of Polyp-Free Segments in Virtual
  Colonoscopy Videos",,"Proc. SPIE Medical Imaging 2017, 101380V",10.1117/12.2252281,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Virtual colonoscopy (VC) allows a physician to virtually navigate within a
reconstructed 3D colon model searching for colorectal polyps. Though VC is
widely recognized as a highly sensitive and specific test for identifying
polyps, one limitation is the reading time, which can take over 30 minutes per
patient. Large amounts of the colon are often devoid of polyps, and a way of
identifying these polyp-free segments could be of valuable use in reducing the
required reading time for the interrogating radiologist. To this end, we have
tested the ability of the collective crowd intelligence of non-expert workers
to identify polyp candidates and polyp-free regions. We presented twenty short
videos flying through a segment of a virtual colon to each worker, and the
crowd was asked to determine whether or not a possible polyp was observed
within that video segment. We evaluated our framework on Amazon Mechanical Turk
and found that the crowd was able to achieve a sensitivity of 80.0% and
specificity of 86.5% in identifying video segments which contained a clinically
proven polyp. Since each polyp appeared in multiple consecutive segments, all
polyps were in fact identified. Using the crowd results as a first pass, 80% of
the video segments could in theory be skipped by the radiologist, equating to a
significant time savings and enabling more VC examinations to be performed.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2016 18:48:03 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Jun 2016 16:51:44 GMT'}, {'version': 'v3', 'created': 'Mon, 24 Jul 2017 18:59:50 GMT'}]",2017-07-26,"[['Park', 'Ji Hwan', ''], ['Mirhosseini', 'Seyedkoosha', ''], ['Nadeem', 'Saad', ''], ['Marino', 'Joseph', ''], ['Kaufman', 'Arie', ''], ['Baker', 'Kevin', ''], ['Barish', 'Matthew', '']]","['Virtual colonoscopy', 'crowdsourcing', 'colonic polyps']"
1182,1107.4303,Kostyantyn Shchekotykhin,"Kostyantyn Shchekotykhin, Gerhard Friedrich, Philipp Fleiss, Patrick
  Rodler","Interactive ontology debugging: two query strategies for efficient fault
  localization","Published in Web Semantics: Science, Services and Agents on the World
  Wide Web. arXiv admin note: substantial text overlap with arXiv:1004.5339",Journal of Web Semantics 12 (2012) 88-103,10.1016/j.websem.2011.12.006,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Effective debugging of ontologies is an important prerequisite for their
broad application, especially in areas that rely on everyday users to create
and maintain knowledge bases, such as the Semantic Web. In such systems
ontologies capture formalized vocabularies of terms shared by its users.
However in many cases users have different local views of the domain, i.e. of
the context in which a given term is used. Inappropriate usage of terms
together with natural complications when formulating and understanding logical
descriptions may result in faulty ontologies. Recent ontology debugging
approaches use diagnosis methods to identify causes of the faults. In most
debugging scenarios these methods return many alternative diagnoses, thus
placing the burden of fault localization on the user. This paper demonstrates
how the target diagnosis can be identified by performing a sequence of
observations, that is, by querying an oracle about entailments of the target
ontology. To identify the best query we propose two query selection strategies:
a simple ""split-in-half"" strategy and an entropy-based strategy. The latter
allows knowledge about typical user errors to be exploited to minimize the
number of queries. Our evaluation showed that the entropy-based method
significantly reduces the number of required queries compared to the
""split-in-half"" approach. We experimented with different probability
distributions of user errors and different qualities of the a-priori
probabilities. Our measurements demonstrated the superiority of entropy-based
query selection even in cases where all fault probabilities are equal, i.e.
where no information about typical user errors is available.
","[{'version': 'v1', 'created': 'Wed, 20 Jul 2011 10:02:07 GMT'}, {'version': 'v2', 'created': 'Sun, 27 Apr 2014 10:20:14 GMT'}]",2014-04-29,"[['Shchekotykhin', 'Kostyantyn', ''], ['Friedrich', 'Gerhard', ''], ['Fleiss', 'Philipp', ''], ['Rodler', 'Patrick', '']]","['Ontology Debugging', 'Query Selection', 'Model-based Diagnosis', 'Description Logic']"
1183,1811.00921,Sajjad Arshad,"Seyed Ali Mirheidari, Sajjad Arshad, Rasool Jalili",Alert Correlation Algorithms: A Survey and Taxonomy,"Symposium on Cyberspace Safety and Security (CSS), Lecture Notes in
  Computer Science, Springer International Publishing, vol 8300, pp 183-197,
  Zhangjiajie, China, November 2013",,10.1007/978-3-319-03584-0_14,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Alert correlation is a system which receives alerts from heterogeneous
Intrusion Detection Systems and reduces false alerts, detects high level
patterns of attacks, increases the meaning of occurred incidents, predicts the
future states of attacks, and detects root cause of attacks. To reach these
goals, many algorithms have been introduced in the world with many advantages
and disadvantages. In this paper, we are trying to present a comprehensive
survey on already proposed alert correlation algorithms. The approach of this
survey is mainly focused on algorithms in correlation engines which can work in
enterprise and practical networks. Having this aim in mind, many features
related to accuracy, functionality, and computation power are introduced and
all algorithm categories are assessed with these features. The result of this
survey shows that each category of algorithms has its own strengths and an
ideal correlation frameworks should be carried the strength feature of each
category.
","[{'version': 'v1', 'created': 'Fri, 2 Nov 2018 15:12:05 GMT'}]",2018-11-05,"[['Mirheidari', 'Seyed Ali', ''], ['Arshad', 'Sajjad', ''], ['Jalili', 'Rasool', '']]","['Network Security', 'Intrusion Detection System', 'Alert', 'Alert Correlation', 'Attack Scenario', 'Similarity-based', 'Knowledge-based', 'Statistical-based']"
1184,1301.3297,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",Instruction sequence based non-uniform complexity classes,"33 pages, supersedes arXiv:0809.0352 [cs.CC] in many respects (see
  end of introduction); remarks added","Scientific Annals of Computer Science 24(1):47--89, 2014",10.7561/SACS.2014.1.47,,cs.CC cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an approach to non-uniform complexity in which single-pass
instruction sequences play a key part, and answer various questions that arise
from this approach. We introduce several kinds of non-uniform complexity
classes. One kind includes a counterpart of the well-known non-uniform
complexity class P/poly and another kind includes a counterpart of the
well-known non-uniform complexity class NP/poly. Moreover, we introduce a
general notion of completeness for the non-uniform complexity classes of the
latter kind. We also formulate a counterpart of the well-known complexity
theoretic conjecture that NP is not included in P/poly. We think that the
presented approach opens up an additional way of investigating issues
concerning non-uniform complexity.
","[{'version': 'v1', 'created': 'Tue, 15 Jan 2013 10:32:55 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Jul 2013 11:52:23 GMT'}]",2014-08-13,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['non-uniform complexity class', 'single-pass instruction sequence', 'projective Boolean function family']"
1185,1209.2717,Sadik Ulker,"Ezgi Deniz Ulker, Sadik Ulker",Comparison Study for Clonal Selection Algorithm and Genetic Algorithm,"12 pages, 12 figures, 2 tables","International Journal of Computer Science & Information Technology
  (IJCSIT) Vol 4, No 4, August 2012 pp 107-118",10.5121/ijcsit.2012.4410,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two metaheuristic algorithms namely Artificial Immune Systems (AIS) and
Genetic Algorithms are classified as computational systems inspired by
theoretical immunology and genetics mechanisms. In this work we examine the
comparative performances of two algorithms. A special selection algorithm,
Clonal Selection Algorithm (CLONALG), which is a subset of Artificial Immune
Systems, and Genetic Algorithms are tested with certain benchmark functions. It
is shown that depending on type of a function Clonal Selection Algorithm and
Genetic Algorithm have better performance over each other.
","[{'version': 'v1', 'created': 'Wed, 12 Sep 2012 20:17:05 GMT'}]",2012-09-14,"[['Ulker', 'Ezgi Deniz', ''], ['Ulker', 'Sadik', '']]","['Metaheuristic Algorithms', 'Artificial Immune Systems', 'Clonal Selection Algorithm', 'Genetic Algorithms', 'Numerical Optimization']"
1186,1503.04374,Tobias Kuhn,Tobias Kuhn,Science Bots: a Model for the Future of Scientific Computation?,"WWW 2015 Companion, May 18-22, 2015, Florence, Italy",,10.1145/2740908.2742014,,cs.CY cs.DL cs.MA,http://creativecommons.org/licenses/by/3.0/,"  As a response to the trends of the increasing importance of computational
approaches and the accelerating pace in science, I propose in this position
paper to establish the concept of ""science bots"" that autonomously perform
programmed tasks on input data they encounter and immediately publish the
results. We can let such bots participate in a reputation system together with
human users, meaning that bots and humans get positive or negative feedback by
other participants. Positive reputation given to these bots would also shine on
their owners, motivating them to contribute to this system, while negative
reputation will allow us to filter out low-quality data, which is inevitable in
an open and decentralized system.
","[{'version': 'v1', 'created': 'Sun, 15 Mar 2015 02:45:21 GMT'}]",2015-03-17,"[['Kuhn', 'Tobias', '']]","['autonomous agent', 'bot', 'nanopublication', 'scholarly communication', 'semantic publishing']"
1187,2006.16309,Bibek Paudel,"Mario Arduini, Lorenzo Noci, Federico Pirovano, Ce Zhang, Yash Raj
  Shrestha, Bibek Paudel",Adversarial Learning for Debiasing Knowledge Graph Embeddings,"MLG 2020 at the ACM SIGKDD Conference on Knowledge Discovery and Data
  Mining (KDD) 2020","MLG 2020 at the ACM SIGKDD Conference on Knowledge Discovery and
  Data Mining (KDD) 2020",,,cs.LG cs.AI cs.SI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge Graphs (KG) are gaining increasing attention in both academia and
industry. Despite their diverse benefits, recent research have identified
social and cultural biases embedded in the representations learned from KGs.
Such biases can have detrimental consequences on different population and
minority groups as applications of KG begin to intersect and interact with
social spheres. This paper aims at identifying and mitigating such biases in
Knowledge Graph (KG) embeddings. As a first step, we explore popularity bias --
the relationship between node popularity and link prediction accuracy. In case
of node2vec graph embeddings, we find that prediction accuracy of the embedding
is negatively correlated with the degree of the node. However, in case of
knowledge-graph embeddings (KGE), we observe an opposite trend. As a second
step, we explore gender bias in KGE, and a careful examination of popular KGE
algorithms suggest that sensitive attribute like the gender of a person can be
predicted from the embedding. This implies that such biases in popular KGs is
captured by the structural properties of the embedding. As a preliminary
solution to debiasing KGs, we introduce a novel framework to filter out the
sensitive attribute information from the KG embeddings, which we call FAN
(Filtering Adversarial Network). We also suggest the applicability of FAN for
debiasing other network embeddings which could be explored in future work.
","[{'version': 'v1', 'created': 'Mon, 29 Jun 2020 18:36:15 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Feb 2021 02:16:59 GMT'}]",2021-02-22,"[['Arduini', 'Mario', ''], ['Noci', 'Lorenzo', ''], ['Pirovano', 'Federico', ''], ['Zhang', 'Ce', ''], ['Shrestha', 'Yash Raj', ''], ['Paudel', 'Bibek', '']]","['network embedding', 'knowledge graph embedding', 'representationlearning', 'bias', 'fairness']"
1188,1201.1095,Krasimir Yordzhev,Krasimir Yordzhev,"An Entertaining Example of Using the Concepts of Context-Free Grammar
  and Pushdown Automation",,"Open Journal of Discrete Mathematics, 2012, 2, 105-108",10.4236/ojdm.2012.23020,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A formal-linguistic approach for solving an entertaining task is made in this
paper. The well-known task of the Hanoi towers is discussed in relation to some
concepts of discrete mathematics. A context-free grammar which generate an
algorithm for solving this task is described. A deterministic pushdown
automation which in its work imitates the work of monks in solving the task of
the Hanoi towers is built.
","[{'version': 'v1', 'created': 'Thu, 5 Jan 2012 09:47:46 GMT'}]",2013-01-24,"[['Yordzhev', 'Krasimir', '']]","['teaching discrete mathematics', 'context-free grammar', 'contextfree language', 'pushdown automation', 'Hanoi towers']"
1189,1807.00673,Tanja Kneiske,Tanja M. Kneiske and Martin Braun,"Flexibility potentials of a combined use of heat storages and batteries
  in PV-CHP hybrid systems","11th International Renewable Energy Storage Conference, IRES 2017,
  14-16 March 2017, D\""usseldorf, Germany","Energy Procedia, Volume 135, October 2017, Pages 482-495",10.1016/j.egypro.2017.09.498,,cs.SY cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the 2012 change in the renewable energy act the feed-in tariffs and as
result the number of newly installed photovoltaic systems decreased
dramatically in Germany. Therefore, there was the need, particularly, in the
residential sector to develop new business ideas for photovoltaic systems. In
context of this development, combined photovoltaic and heat-power systems were
analyzed, which provide not only electricity but also heat throughout one
entire year. Flexibilities are provided in form of thermal and electrical
storage systems leading to many possible setting options requiring an
elaborated control management. In this paper, a new optimized control algorithm
is proposed that in contrast to standard strategies can operate optimal even
under incorrect weather and load forecasts. A predictive controller based on a
mixed integer optimization problem and an additional so called secondary,
rule-based controller is combined. The controller is based on several input
data. Depending on the choice of these data the PV-CHP hybrid system can be
used for different control strategies, like maximum self-consumption, minimum
CO2 emission or minimum operational costs. The main focus in this paper is to
study if the flexibility potentials of the combined thermal and electrical
storage systems can ensure a market oriented or a grid-friendly behavior. This
is studied in five control options. As a result we found that the control
algorithm is stable and able to adapt to the different conditions. In
conclusion, it was discovered that the storage systems play a crucial role in
terms of forecast differences and parameter changes. Storage systems are as
expected the key-element for the flexibility of PV-CHP hybrid systems.
","[{'version': 'v1', 'created': 'Thu, 28 Jun 2018 11:30:26 GMT'}]",2018-07-03,"[['Kneiske', 'Tanja M.', ''], ['Braun', 'Martin', '']]","['CHP', 'PV', 'Grid Integration', 'Battery', 'Thermal Storage', 'MPC control', 'Hybrid System', 'MILP']"
1190,1210.1925,Artan Berisha,"Artan Berisha, Behar Baxhaku and Artan Alidema","A Class of Non Invertible Matrices in GF (2) for Practical One Way Hash
  Algorithm","6 pages, 5 figures, ""Published with International Journal of Computer
  Applications (IJCA)""","Artan Berisha, Behar Baxhaku and Artan Alidema. Article: A Class
  of Non Invertible Matrices in GF(2) for Practical One Way Hash Algorithm.
  International Journal of Computer Applications 54(18):19-20, September 2012",10.5120/8667-2574,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we describe non invertible matrix in GF(2)which can be used as
multiplication matrix in Hill Cipher technique for one way hash algorithm. The
matrices proposed are permutation matrices with exactly one entry 1 in each row
and each column and 0 elsewhere. Such matrices represent a permutation of m
elements. Since the invention, Hill cipher algorithm was used for symmetric
encryption, where the multiplication matrix is the key. The Hill cipher
requires the inverse of the matrix to recover the plaintext from cipher text.
We propose a class of matrices in GF(2) which are non invertible and easy to
generate.
","[{'version': 'v1', 'created': 'Sat, 6 Oct 2012 07:29:48 GMT'}]",2012-10-09,"[['Berisha', 'Artan', ''], ['Baxhaku', 'Behar', ''], ['Alidema', 'Artan', '']]","['Hill cipher technique', 'Non-invertible matrix', 'Galois field GF(2)', 'hash algorithm', 'One-way hash function', 'plaintext', 'integrity']"
1191,0707.1925,Vahan Mkrtchyan,V. V. Mkrtchyan,A note on minimal matching covered graphs,4 pages,"Discrete Mathematics 306, (2006), pp. 452-455",10.1016/j.disc.2005.12.006,,cs.DM,,"  A graph is called matching covered if for its every edge there is a maximum
matching containing it. It is shown that minimal matching covered graphs
contain a perfect matching.
","[{'version': 'v1', 'created': 'Fri, 13 Jul 2007 13:01:10 GMT'}]",2007-07-16,"[['Mkrtchyan', 'V. V.', '']]","['Maximum matching', 'Matching covered graph', 'Minimal matching coveredgraph', 'Perfect matching']"
1192,1412.8109,Anis Charrada,"Anis Charrada, Abdelaziz Samet","Complex support vector machines regression for robust channel estimation
  in LTE downlink system","13 pages Vol.4, IJCNC (2012) No.1, January 2012. arXiv admin note:
  substantial text overlap with arXiv:1109.0895",,10.5121/ijcnc.2012.4115,,cs.IT cs.LG math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the problem of channel estimation for LTE Downlink system in
the environment of high mobility presenting non-Gaussian impulse noise
interfering with reference signals is faced. The estimation of the frequency
selective time varying multipath fading channel is performed by using a channel
estimator based on a nonlinear complex Support Vector Machine Regression (SVR)
which is applied to Long Term Evolution (LTE) downlink. The estimation
algorithm makes use of the pilot signals to estimate the total frequency
response of the highly selective fading multipath channel. Thus, the algorithm
maps trained data into a high dimensional feature space and uses the structural
risk minimization principle to carry out the regression estimation for the
frequency response function of the fading channel. The obtained results show
the effectiveness of the proposed method which has better performance than the
conventional Least Squares (LS) and Decision Feedback methods to track the
variations of the fading multipath channel.
","[{'version': 'v1', 'created': 'Wed, 10 Dec 2014 19:51:35 GMT'}]",2014-12-30,"[['Charrada', 'Anis', ''], ['Samet', 'Abdelaziz', '']]","['Complex SVR', 'RKHS', 'nonlinear regression', 'impulse noise', 'OFDM', 'LTE']"
1193,1309.2152,K.S.Kuppusamy,"K.S.Kuppusamy, Leena Mary Francis, G. Aghila","COSMOS A Context Sensitive Model For Dynamic Configuration Of
  Smartphones Using Multifactor Analysis","12 Pages, 5 Figures","International Journal of Information Technology, Modeling and
  Computing (IJITMC) Vol.1, No.3,August 2013, ISSN: 2320-7493",10.5121/ijitmc.2013.1302,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the prolific growth in usage of smartphones across the spectrum of
people in the society it becomes mandatory to handle and configure these
devices effectively to achieve optimum results from it. This paper proposes a
context sensitive model termed COSMOS (COntext Sensitive MOdel for Smartphones)
for configuring the smartphones using multifactor analysis with the help of
decision trees. The COSMOS model proposed in this paper facilitates the
configuration of various smartphone settings implicitly based on the user's
current context, without interrupting the user for various inputs. The COSMOS
model also proposes multiple context parameters like location, scheduler data,
recent call log settings etc to decide the appropriate settings for the
smartphones. The proposed model is validated by a prototype implementation in
the Android platform. Various tests were conducted in the implementation and
the settings relevancy metric value of 90.95% confirms the efficiency of the
proposed model.
","[{'version': 'v1', 'created': 'Mon, 9 Sep 2013 13:29:16 GMT'}]",2013-09-10,"[['Kuppusamy', 'K. S.', ''], ['Francis', 'Leena Mary', ''], ['Aghila', 'G.', '']]","['Mobile computing', 'Smartphone configuration', 'Context sensitivity']"
1194,1409.1496,Giovanni Luca Ciampaglia,"Giovanni Luca Ciampaglia, Dario Taraborelli","MoodBar: Increasing new user retention in Wikipedia through lightweight
  socialization","9 pages, 5 figures, accepted for presentation at CSCW'15",,10.1145/2675133.2675181,,cs.SI cs.HC physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Socialization in online communities allows existing members to welcome and
recruit newcomers, introduce them to community norms and practices, and sustain
their early participation. However, socializing newcomers does not come for
free: in large communities, socialization can result in a significant workload
for mentors and is hard to scale. In this study we present results from an
experiment that measured the effect of a lightweight socialization tool on the
activity and retention of newly registered users attempting to edit for the
first time Wikipedia. Wikipedia is struggling with the retention of newcomers
and our results indicate that a mechanism to elicit lightweight feedback and to
provide early mentoring to newcomers improves their chances of becoming
long-term contributors.
","[{'version': 'v1', 'created': 'Thu, 4 Sep 2014 17:11:54 GMT'}]",2014-10-14,"[['Ciampaglia', 'Giovanni Luca', ''], ['Taraborelli', 'Dario', '']]","['Wikipedia', 'online community', 'socialization', 'user retention', 'natural experiment']"
1195,1006.3374,Secretary Aircc Journal,"Vibhar Pathak (1), Dr. Krishna Chandra Roy (2) and Santosh Kumar Singh
  (1) ((1) Suresh Gyan Vihar University, India,(2) SBCET, India)","Cross Layer Aware Adaptive MAC based on Knowledge Based Reasoning for
  Cognitive Radio Computer Networks",8 pages,International Journal of Next-Generation Networks 2.2 (2010) 14-21,10.5121/ijngn.2010.2202,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper we are proposing a new concept in MAC layer protocol design for
Cognitive radio by combining information held by physical layer and MAC layer
with analytical engine based on knowledge based reasoning approach. In the
proposed system a cross layer information regarding signal to interference and
noise ratio (SINR) and received power are analyzed with help of knowledge based
reasoning system to determine minimum power to transmit and size of contention
window, to minimize backoff, collision, save power and drop packets. The
performance analysis of the proposed protocol indicates improvement in power
saving, lowering backoff and significant decrease in number of drop packets.
The simulation environment was implement using OMNET++ discrete simulation tool
with Mobilty framework and MiXiM simulation library.
","[{'version': 'v1', 'created': 'Thu, 17 Jun 2010 05:29:08 GMT'}]",2010-07-15,"[['Pathak', 'Vibhar', '', 'Suresh Gyan Vihar University, India'], ['Roy', 'Dr. Krishna Chandra', '', 'SBCET, India'], ['Singh', 'Santosh Kumar', '', 'Suresh Gyan Vihar University, India']]","['Cognitive radio', 'SDR', 'SINR', 'Received Power', 'MAC', 'OMNET++']"
1196,1912.05474,Vivek Singh,"Vivek Singh, Mary Chayko, Raj Inamdar, and Diana Floegel","Female Librarians and Male Computer Programmers? Gender Bias in
  Occupational Images on Digital Media Platforms","Article accepted for publication in The Journal of the Association
  for Information Science and Technology (JASIST)",,10.1002/ASI.24335,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Media platforms, technological systems, and search engines act as conduits
and gatekeepers for all kinds of information. They often influence, reflect,
and reinforce gender stereotypes, including those that represent occupations.
This study examines the prevalence of gender stereotypes on digital media
platforms and considers how human efforts to create and curate messages
directly may impact these stereotypes. While gender stereotyping in social
media and algorithms has received some examination in recent literature, its
prevalence in different types of platforms (e.g., wiki vs. news vs. social
network) and under differing conditions (e.g., degrees of human and machine led
content creation and curation) has yet to be studied. This research explores
the extent to which stereotypes of certain strongly gendered professions
(librarian, nurse, computer programmer, civil engineer) persist and may vary
across digital platforms (Twitter, the New York Times online, Wikipedia, and
Shutterstock). The results suggest that gender stereotypes are most likely to
be challenged when human beings act directly to create and curate content in
digital platforms, and that highly algorithmic approaches for curation showed
little inclination towards breaking stereotypes. Implications for the more
inclusive design and use of digital media platforms, particularly with regard
to mediated occupational messaging, are discussed.
","[{'version': 'v1', 'created': 'Wed, 11 Dec 2019 17:10:23 GMT'}]",2019-12-12,"[['Singh', 'Vivek', ''], ['Chayko', 'Mary', ''], ['Inamdar', 'Raj', ''], ['Floegel', 'Diana', '']]","['gender bias', 'algorithmic bias', 'search bias']"
1197,1902.00616,Ahmad Javaid,"Aakif Mairaj, Asif I. Baba, Ahmad Y. Javaid",Application Specific Drone Simulators: Recent Advances and Challenges,,,10.1016/j.simpat.2019.01.004,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the past two decades, Unmanned Aerial Vehicles (UAVs), more commonly
known as drones, have gained a lot of attention, and are rapidly becoming
ubiquitous because of their diverse applications such as surveillance, disaster
management, pollution monitoring, film-making, and military reconnaissance.
However, incidents such as fatal system failures, malicious attacks, and
disastrous misuses have raised concerns in the recent past. Security and
viability concerns in drone-based applications are growing at an alarming rate.
Besides, UAV networks (UAVNets) are distinctive from other ad-hoc networks.
Therefore, it is necessary to address these issues to ensure proper functioning
of these UAVs while keeping their uniqueness in mind. Furthermore, adequate
security and functionality require the consideration of many parameters that
may include an accurate cognizance of the working mechanism of vehicles,
geographical and weather conditions, and UAVNet communication. This is
achievable by creating a simulator that includes these aspects. A performance
evaluation through relevant drone simulator becomes indispensable procedure to
test features, configurations, and designs to demonstrate superiority to
comparative schemes and suitability. Thus, it becomes of paramount importance
to establish the credibility of simulation results by investigating the merits
and limitations of each simulator prior to selection. Based on this motivation,
we present a comprehensive survey of current drone simulators. In addition,
open research issues and research challenges are discussed and presented.
","[{'version': 'v1', 'created': 'Sat, 2 Feb 2019 02:03:51 GMT'}]",2019-02-05,"[['Mairaj', 'Aakif', ''], ['Baba', 'Asif I.', ''], ['Javaid', 'Ahmad Y.', '']]","['Unmanned Aerial Vehicles', 'UAVs', 'FANETs', 'UAV Simulator']"
1198,1006.3845,Secretary Aircc Journal,"Yaser Miaji and Suhaidi Hassan (University Utara, Malaysia)",Breaking the Legend: Maxmin Fairness notion is no longer effective,8 Pages,"International journal on applications of graph theory in wireless
  ad hoc networks and sensor networks 2.2 (2010) 25-32",10.5121/jgraphoc.2010.2203,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper we analytically propose an alternative approach to achieve
better fairness in scheduling mechanisms which could provide better quality of
service particularly for real time application. Our proposal oppose the
allocation of the bandwidth which adopted by all previous scheduling mechanism.
It rather adopt the opposition approach be proposing the notion of
Maxmin-charge which fairly distribute the congestion. Furthermore, analytical
proposition of novel mechanism named as Just Queueing is been demonstrated.
","[{'version': 'v1', 'created': 'Sat, 19 Jun 2010 07:05:23 GMT'}]",2010-07-15,"[['Miaji', 'Yaser', '', 'University Utara, Malaysia'], ['Hassan', 'Suhaidi', '', 'University Utara, Malaysia']]","['scheduling mechanism', 'Queueing', 'Maxmin', 'WFQ']"
1199,1912.05913,Alireza Abdoli,"Alireza Abdoli, Amy C. Murillo, Alec C. Gerry, Eamonn J. Keogh","Time Series Classification: Lessons Learned in the (Literal) Field while
  Studying Chicken Behavior",arXiv admin note: text overlap with arXiv:1811.03149,,10.1109/BigData47090.2019.9005596,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Poultry farms are a major contributor to the human food chain. However,
around the world, there have been growing concerns about the quality of life
for the livestock in poultry farms; and increasingly vocal demands for improved
standards of animal welfare. Recent advances in sensing technologies and
machine learning allow the possibility of monitoring birds, and employing the
lessons learned to improve the welfare for all birds. This task superficially
appears to be easy, yet, studying behavioral patterns involves collecting
enormous amounts of data, justifying the term Big Data. Before the big data can
be used for analytical purposes to tease out meaningful, well-conserved
behavioral patterns, the collected data needs to be pre-processed. The
pre-processing refers to processes for cleansing and preparing data so that it
is in the format ready to be analyzed by downstream algorithms, such as
classification and clustering algorithms. However, as we shall demonstrate,
efficient pre-processing of chicken big data is both non-trivial and crucial
towards success of further analytics.
","[{'version': 'v1', 'created': 'Thu, 21 Nov 2019 06:57:47 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Dec 2019 19:48:04 GMT'}]",2020-06-02,"[['Abdoli', 'Alireza', ''], ['Murillo', 'Amy C.', ''], ['Gerry', 'Alec C.', ''], ['Keogh', 'Eamonn J.', '']]","['Time Series', 'Classification', 'Big Data', 'Machine']"
1200,1812.11927,Mark Minas,"Frank Drewes, Berthold Hoffmann, Mark Minas","Formalization and Correctness of Predictive Shift-Reduce Parsers for
  Graph Grammars based on Hyperedge Replacement","63 pages; fixed wrong email address of one of the authors and some
  typos","Journal of Logical and Algebraic Methods in Programming, vol. 104,
  April 2019, pp. 303-341",10.1016/j.jlamp.2018.12.006,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hyperedge replacement (HR) grammars can generate NP-complete graph languages,
which makes parsing hard even for fixed HR languages. Therefore, we study
predictive shift-reduce (PSR) parsing that yields efficient parsers for a
subclass of HR grammars, by generalizing the concepts of SLR(1) string parsing
to graphs. We formalize the construction of PSR parsers and show that it is
correct. PSR parsers run in linear space and time, and are more efficient than
the predictive top-down (PTD) parsers recently developed by the authors.
","[{'version': 'v1', 'created': 'Mon, 31 Dec 2018 18:10:37 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Jan 2019 09:39:32 GMT'}]",2019-03-12,"[['Drewes', 'Frank', ''], ['Hoffmann', 'Berthold', ''], ['Minas', 'Mark', '']]","['hyperedge replacement grammar', 'graph parsing', 'grammar analysis']"
1201,1603.00361,Tom\'a\v{s} Masopust,Tom\'a\v{s} Masopust,Piecewise Testable Languages and Nondeterministic Automata,Corrections in section 4.1,,10.4230/LIPIcs.MFCS.2016.67,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A regular language is $k$-piecewise testable if it is a finite boolean
combination of languages of the form $\Sigma^* a_1 \Sigma^* \cdots \Sigma^* a_n
\Sigma^*$, where $a_i\in\Sigma$ and $0\le n \le k$. Given a DFA $A$ and $k\ge
0$, it is an NL-complete problem to decide whether the language $L(A)$ is
piecewise testable and, for $k\ge 4$, it is coNP-complete to decide whether the
language $L(A)$ is $k$-piecewise testable. It is known that the depth of the
minimal DFA serves as an upper bound on $k$. Namely, if $L(A)$ is piecewise
testable, then it is $k$-piecewise testable for $k$ equal to the depth of $A$.
In this paper, we show that some form of nondeterminism does not violate this
upper bound result. Specifically, we define a class of NFAs, called ptNFAs,
that recognize piecewise testable languages and show that the depth of a ptNFA
provides an (up to exponentially better) upper bound on $k$ than the minimal
DFA. We provide an application of our result, discuss the relationship between
$k$-piecewise testability and the depth of NFAs, and study the complexity of
$k$-piecewise testability for ptNFAs.
","[{'version': 'v1', 'created': 'Tue, 1 Mar 2016 17:11:05 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Mar 2016 06:54:39 GMT'}]",2016-09-07,"[['Masopust', 'Tomáš', '']]","['Automata', 'Logics', 'Languages', 'k-piecewise testability', 'Nondeterminism']"
1202,1511.03124,Eerke Boiten,Eerke Boiten,Diversity and Adjudication,,,10.1016/j.jlamp.2015.10.007,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper takes an axiomatic and calculational view of diversity (or
""N-version programming""), where multiple implementations of the same
specification are executed in parallel to increase dependability. The central
notion is ""adjudication"": once we have multiple, potential different, outcomes,
how do we come to a single result? Adjudication operators are explicitly
defined and some general properties for these explored.
","[{'version': 'v1', 'created': 'Tue, 10 Nov 2015 14:43:37 GMT'}]",2015-11-11,"[['Boiten', 'Eerke', '']]","['N-version programming', 'dependability', 'versions', 'adjudication']"
1203,cs/0205055,Paul M. Aoki,"Allison Woodruff, Margaret H. Szymanski, Rebecca E. Grinter, and Paul
  M. Aoki","Practical Strategies for Integrating a Conversation Analyst in an
  Iterative Design Process",11 pages,"Proc. ACM Conf. on Designing Interactive Systems, London, UK, June
  2002, 19-28. ACM Press.",10.1145/778712.778748,,cs.HC,,"  We present a case study of an iterative design process that includes a
conversation analyst. We discuss potential benefits of conversation analysis
for design, and we describe our strategies for integrating the conversation
analyst in the design process. Since the analyst on our team had no previous
exposure to design or engineering, and none of the other members of our team
had any experience with conversation analysis, we needed to build a foundation
for our interaction. One of our key strategies was to pair the conversation
analyst with a designer in a highly interactive collaboration. Our tactics have
been effective on our project, leading to valuable results that we believe we
could not have obtained using another method. We hope that this paper can serve
as a practical guide to those interested in establishing a productive and
efficient working relationship between a conversation analyst and the other
members of a design team.
","[{'version': 'v1', 'created': 'Tue, 21 May 2002 03:16:49 GMT'}]",2007-05-23,"[['Woodruff', 'Allison', ''], ['Szymanski', 'Margaret H.', ''], ['Grinter', 'Rebecca E.', ''], ['Aoki', 'Paul M.', '']]","['Conversationanalysis', 'electronic guidebooks', 'iterativedesign', 'qualitative research methods']"
1204,1609.00514,Mostafa Dehghani,"Mostafa Dehghani, Hosein Azarbonyad, Jaap Kamps, Maarten Marx","On Horizontal and Vertical Separation in Hierarchical Text
  Classification","Full paper (10 pages) accepted for publication in proceedings of ACM
  SIGIR International Conference on the Theory of Information Retrieval
  (ICTIR'16)",,10.1145/2970398.2970408,,cs.IR cs.CL cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hierarchy is a common and effective way of organizing data and representing
their relationships at different levels of abstraction. However, hierarchical
data dependencies cause difficulties in the estimation of ""separable"" models
that can distinguish between the entities in the hierarchy. Extracting
separable models of hierarchical entities requires us to take their relative
position into account and to consider the different types of dependencies in
the hierarchy. In this paper, we present an investigation of the effect of
separability in text-based entity classification and argue that in hierarchical
classification, a separation property should be established between entities
not only in the same layer, but also in different layers. Our main findings are
the followings. First, we analyse the importance of separability on the data
representation in the task of classification and based on that, we introduce a
""Strong Separation Principle"" for optimizing expected effectiveness of
classifiers decision based on separation property. Second, we present
Hierarchical Significant Words Language Models (HSWLM) which capture all, and
only, the essential features of hierarchical entities according to their
relative position in the hierarchy resulting in horizontally and vertically
separable models. Third, we validate our claims on real-world data and
demonstrate that how HSWLM improves the accuracy of classification and how it
provides transferable models over time. Although discussions in this paper
focus on the classification problem, the models are applicable to any
information access tasks on data that has, or can be mapped to, a hierarchical
structure.
","[{'version': 'v1', 'created': 'Fri, 2 Sep 2016 09:21:33 GMT'}]",2016-09-05,"[['Dehghani', 'Mostafa', ''], ['Azarbonyad', 'Hosein', ''], ['Kamps', 'Jaap', ''], ['Marx', 'Maarten', '']]","['Separation', 'Hierarchical Significant Words Language Models', 'Hierarchical Text Classification']"
1205,1304.3531,Anru Zhang,"T. Tony Cai, Anru Zhang","Compressed Sensing and Affine Rank Minimization under Restricted
  Isometry",to appear in IEEE Transactions on Signal Processing,,10.1109/TSP.2013.2259164,,cs.IT math.IT math.ST stat.TH,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper establishes new restricted isometry conditions for compressed
sensing and affine rank minimization. It is shown for compressed sensing that
$\delta_{k}^A+\theta_{k,k}^A < 1$ guarantees the exact recovery of all $k$
sparse signals in the noiseless case through the constrained $\ell_1$
minimization. Furthermore, the upper bound 1 is sharp in the sense that for any
$\epsilon > 0$, the condition $\delta_k^A + \theta_{k, k}^A < 1+\epsilon$ is
not sufficient to guarantee such exact recovery using any recovery method.
Similarly, for affine rank minimization, if
$\delta_{r}^\mathcal{M}+\theta_{r,r}^\mathcal{M}< 1$ then all matrices with
rank at most $r$ can be reconstructed exactly in the noiseless case via the
constrained nuclear norm minimization; and for any $\epsilon > 0$,
$\delta_r^\mathcal{M} +\theta_{r,r}^\mathcal{M} < 1+\epsilon$ does not ensure
such exact recovery using any method. Moreover, in the noisy case the
conditions $\delta_{k}^A+\theta_{k,k}^A < 1$ and
$\delta_{r}^\mathcal{M}+\theta_{r,r}^\mathcal{M}< 1$ are also sufficient for
the stable recovery of sparse signals and low-rank matrices respectively.
Applications and extensions are also discussed.
","[{'version': 'v1', 'created': 'Fri, 12 Apr 2013 04:04:49 GMT'}]",2016-11-17,"[['Cai', 'T. Tony', ''], ['Zhang', 'Anru', '']]","['Affine rank minimization', 'compressed sensing', 'Dantzig selector', 'constrained ℓ1 min']"
1206,1803.04442,Krzysztof Rzadca,"Grzegorz Milka, Krzysztof Rzadca",Dfuntest: A Testing Framework for Distributed Applications,PPAM 2017 Proceedings,,10.1007/978-3-319-78024-5_35,,cs.DC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  New ideas in distributed systems (algorithms or protocols) are commonly
tested by simulation, because experimenting with a prototype deployed on a
realistic platform is cumbersome. However, a prototype not only measures
performance but also verifies assumptions about the underlying system. We
developed dfuntest - a testing framework for distributed applications that
defines abstractions and test structure, and automates experiments on
distributed platforms. Dfuntest aims to be jUnit's analogue for distributed
applications; a framework that enables the programmer to write robust and
flexible scenarios of experiments. Dfuntest requires minimal bindings that
specify how to deploy and interact with the application. Dfuntest's
abstractions allow execution of a scenario on a single machine, a cluster, a
cloud, or any other distributed infrastructure, e.g. on PlanetLab. A scenario
is a procedure; thus, our framework can be used both for functional tests and
for performance measurements. We show how to use dfuntest to deploy our DHT
prototype on 60 PlanetLab nodes and verify whether the prototype maintains a
correct topology.
","[{'version': 'v1', 'created': 'Mon, 12 Mar 2018 18:25:59 GMT'}]",2018-03-14,"[['Milka', 'Grzegorz', ''], ['Rzadca', 'Krzysztof', '']]","['distributed systems', 'testing', 'deployment', 'planetlab', 'jUnit']"
1207,1303.1738,Emilio Ferrara,"Pasquale De Meo, Emilio Ferrara, Giacomo Fiumara, Alessandro Provetti","Mixing local and global information for community detection in large
  networks",,"Journal of Computer and System Sciences 80(1):72-87, 2014",10.1016/j.jcss.2013.03.012,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of clustering large complex networks plays a key role in several
scientific fields ranging from Biology to Sociology and Computer Science. Many
approaches to clustering complex networks are based on the idea of maximizing a
network modularity function. Some of these approaches can be classified as
global because they exploit knowledge about the whole network topology to find
clusters. Other approaches, instead, can be interpreted as local because they
require only a partial knowledge of the network topology, e.g., the neighbors
of a vertex. Global approaches are able to achieve high values of modularity
but they do not scale well on large networks and, therefore, they cannot be
applied to analyze on-line social networks like Facebook or YouTube. In
contrast, local approaches are fast and scale up to large, real-life networks,
at the cost of poorer results than those achieved by local methods. In this
article we propose a glocal method to maximizing modularity, i.e., our method
uses information at the global level, yet its scalability on large networks is
comparable to that of local methods. The proposed method is called COmplex
Network CLUster DEtection (or, shortly, CONCLUDE.) It works in two stages: in
the first stage it uses an information-propagation model, based on random and
non-backtracking walks of finite length, to compute the importance of each edge
in keeping the network connected (called edge centrality.) Then, edge
centrality is used to map network vertices onto points of an Euclidean space
and to compute distances between all pairs of connected vertices. In the second
stage, CONCLUDE uses the distances computed in the first stage to partition the
network into clusters. CONCLUDE is computationally efficient since in the
average case its cost is roughly linear in the number of edges of the network.
","[{'version': 'v1', 'created': 'Thu, 7 Mar 2013 16:32:52 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Oct 2013 13:58:43 GMT'}]",2013-10-17,"[['De Meo', 'Pasquale', ''], ['Ferrara', 'Emilio', ''], ['Fiumara', 'Giacomo', ''], ['Provetti', 'Alessandro', '']]","['Complex Networks', 'Community Detection', 'Social Networks', 'Social Network Analysis']"
1208,1503.06729,Jean-Francois Caron,"Lina Bouhaya (NAVIER UMR 8205), Olivier Baverel, Jean-Fran\c{c}ois
  Caron (NAVIER UMR 8205)","Optimization of gridshell bar orientation using a simplified genetic
  approach",,"Structural and Multidisciplinary Optimization, Springer Verlag
  (Germany), 2014, 50 (5), pp. 839-848",10.1007/s00158-014-1088-9,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Gridshells are defined as structures that have the shape and rigidity of a
double curvature shell but consist of a grid instead of a continuous surface.
This study concerns those obtained by elastic deformation of an initially flat
two-way grid. This paper presents a novel approach to generate gridshells on an
imposed shape under imposed boundary conditions. A numerical tool based on a
geometrical method, the compass method, is developed. It is coupled with
genetic algorithms to optimize the orientation of gridshell bars in order to
minimize the stresses and therefore to avoid bar breakage during the
construction phase. Examples of application are shown.
","[{'version': 'v1', 'created': 'Fri, 20 Mar 2015 19:09:20 GMT'}]",2015-03-24,"[['Bouhaya', 'Lina', '', 'NAVIER UMR 8205'], ['Baverel', 'Olivier', '', 'NAVIER UMR 8205'], ['Caron', 'Jean-François', '', 'NAVIER UMR 8205']]","['Gridshell', 'Formfinding', 'Compass method', 'Genetic algorithms']"
1209,1405.4828,Safa Hamdare,"Safa Hamdare, Varsha Nagpurkar, Jayashri Mittal","Securing SMS Based One Time Password Technique from Man in the Middle
  Attack","5 pages, 5 figures, 3 Tables, Published with International Journal of
  Engineering Trends and Technology (IJETT)","IJETT 11(3):154-158, May 2014",10.14445/22315381/IJETT-V11P230,,cs.CR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security of financial transaction in e-commerce is difficult to implement and
there is a risk that users confidential data over the internet may be accessed
by hackers. Unfortunately, interacting with an online service such as a banking
web application often requires certain degree of technical sophistication that
not all Internet users possess. For the last couple of years such naive users
have been increasingly targeted by phishing attacks that are launched by
miscreants who are aiming to make an easy profit by means of illegal financial
transactions. In this paper, we have proposed an idea for securing e-commerce
transaction from phishing attack. An approach already exists where phishing
attack is prevented using one time password which is sent on users registered
mobile via SMS for authentication.But this method can be counter attacked by
man in the middle.In our paper, a new idea is proposed which is more secure
compared to the existing online payment system using OTP. In this mechanism,
OTP is combined with the secure key and is then passed through RSA algorithm to
generate the Transaction password. A copy of this password is maintained at the
server side and is being generated at the user side using a mobile
application.So that it is not transferred over the insecure network leading to
a fraudulent transaction.
","[{'version': 'v1', 'created': 'Mon, 19 May 2014 18:28:45 GMT'}]",2014-05-20,"[['Hamdare', 'Safa', ''], ['Nagpurkar', 'Varsha', ''], ['Mittal', 'Jayashri', '']]","['Phishing', 'Replay attack', 'MITM attack', 'RSA', 'Random Generator']"
1210,1709.08880,Noreddine Gherabi,"Noreddine Gherabi, Abdelhadi Daoui, and Abderrahim Marzouk","An enhanced method to compute the similarity between concepts of
  ontology",,,10.1007/978-3-319-64719-7,,cs.DB cs.AI cs.IR,http://creativecommons.org/licenses/by/4.0/,"  With the use of ontologies in several domains such as semantic web,
information retrieval, artificial intelligence, the concept of similarity
measuring has become a very important domain of research. Therefore, in the
current paper, we propose our method of similarity measuring which uses the
Dijkstra algorithm to define and compute the shortest path. Then, we use this
one to compute the semantic distance between two concepts defined in the same
hierarchy of ontology. Afterward, we base on this result to compute the
semantic similarity. Finally, we present an experimental comparison between our
method and other methods of similarity measuring.
","[{'version': 'v1', 'created': 'Tue, 26 Sep 2017 08:18:15 GMT'}]",2017-09-27,"[['Gherabi', 'Noreddine', ''], ['Daoui', 'Abdelhadi', ''], ['Marzouk', 'Abderrahim', '']]","['semantic web', 'ontologies', 'similarity measuring', 'Dijkstra’s algorithm']"
1211,1808.01546,Jiliang Zhang,"Xinbo Liu, Jiliang Zhang, Yaping Lin and He Li","ATMPA: Attacking Machine Learning-based Malware Visualization Detection
  Methods via Adversarial Examples","9 pages, 5 figures",IEEE/ACM International Symposium on Quality of Service(2019),,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since the threat of malicious software (malware) has become increasingly
serious, automatic malware detection techniques have received increasing
attention, where machine learning (ML)-based visualization detection methods
become more and more popular. In this paper, we demonstrate that the
state-of-the-art ML-based visualization detection methods are vulnerable to
Adversarial Example (AE) attacks. We develop a novel Adversarial Texture
Malware Perturbation Attack (ATMPA) method based on the gradient descent and
L-norm optimization method, where attackers can introduce some tiny
perturbations on the transformed dataset such that ML-based malware detection
methods will completely fail. The experimental results on the MS BIG malware
dataset show that a small interference can reduce the accuracy rate down to 0%
for several ML-based detection methods, and the rate of transferability is
74.1% on average.
","[{'version': 'v1', 'created': 'Sun, 5 Aug 2018 01:03:13 GMT'}, {'version': 'v2', 'created': 'Sat, 5 Oct 2019 09:04:07 GMT'}, {'version': 'v3', 'created': 'Mon, 30 Dec 2019 12:46:20 GMT'}]",2020-01-01,"[['Liu', 'Xinbo', ''], ['Zhang', 'Jiliang', ''], ['Lin', 'Yaping', ''], ['Li', 'He', '']]","['Adversarial Examples', 'Malware Detection', 'Image Texture', 'MachineLearning', 'Data visualization']"
1212,1810.07304,Erik Sy,"Erik Sy, Christian Burkert, Hannes Federrath, Mathias Fischer",Tracking Users across the Web via TLS Session Resumption,11 pages,"Published in 2018 Annual Computer Security Applications Conference
  (ACSAC '18), December 3-7, 2018, San Juan, PR, USA",10.1145/3274694.3274708,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  User tracking on the Internet can come in various forms, e.g., via cookies or
by fingerprinting web browsers. A technique that got less attention so far is
user tracking based on TLS and specifically based on the TLS session resumption
mechanism. To the best of our knowledge, we are the first that investigate the
applicability of TLS session resumption for user tracking. For that, we
evaluated the configuration of 48 popular browsers and one million of the most
popular websites. Moreover, we present a so-called prolongation attack, which
allows extending the tracking period beyond the lifetime of the session
resumption mechanism. To show that under the observed browser configurations
tracking via TLS session resumptions is feasible, we also looked into DNS data
to understand the longest consecutive tracking period for a user by a
particular website. Our results indicate that with the standard setting of the
session resumption lifetime in many current browsers, the average user can be
tracked for up to eight days. With a session resumption lifetime of seven days,
as recommended upper limit in the draft for TLS version 1.3, 65% of all users
in our dataset can be tracked permanently.
","[{'version': 'v1', 'created': 'Tue, 16 Oct 2018 22:58:44 GMT'}]",2019-03-01,"[['Sy', 'Erik', ''], ['Burkert', 'Christian', ''], ['Federrath', 'Hannes', ''], ['Fischer', 'Mathias', '']]","['Session IDs', 'Session Tickets', 'PSK Identity', 'Tracking Period', 'BrowserMeasurement']"
1213,1503.06590,Pedro M.  d'Orey,"Mate Boban, Pedro M. d'Orey","Exploring the Practical Limits of Cooperative Awareness in Vehicular
  Communications",Accepted to IEEE Transactions on Vehicular Technology,,10.1109/TVT.2016.2544935,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We perform an extensive study of cooperative awareness in vehicular
communication based on periodic message exchange. We start by analyzing
measurements collected on four test sites across Europe. To measure cooperative
awareness, we use three metrics: 1) neighborhood awareness ratio; 2) ratio of
neighbors above range; and 3) packet delivery rate. Using the collected data,
we define a simple model for calculating neighborhood awareness given packet
delivery ratio for a given environment. Finally, we perform realistic,
large-scale simulations to explore the achievable performance of cooperative
awareness under realistic transmit power and transmit rate constraints. Our
measurements and simulation results show that: i) above a certain threshold,
there is little benefit in increasing cooperative message rate to improve the
awareness; higher transmit power and fewer messages transmissions are a better
approach, since message delivery is dominated by shadowing. ii) the efficacy of
cooperative awareness varies greatly in different environments on both large
scale (e.g., 90\% awareness is achievable up to 200~m in urban and over 500~m
in highway) and small scale (e.g., vehicles in nearby streets can have
significantly different awareness); iii) V2V and V2I communication have
distinct awareness patterns; iv) each location has a distinct transmit power
that achieves high awareness; and v) achieving high awareness levels results in
increased reception of potentially unwanted messages; therefore, a balance
needs to be found between awareness and interference, depending on the specific
context. We hope our results will serve as a starting point for designing more
effective periodic message exchange services for cooperative awareness.
","[{'version': 'v1', 'created': 'Mon, 23 Mar 2015 10:35:13 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Dec 2015 00:43:28 GMT'}, {'version': 'v3', 'created': 'Mon, 21 Mar 2016 20:48:23 GMT'}]",2016-11-15,"[['Boban', 'Mate', ''], [""d'Orey"", 'Pedro M.', '']]","['Cooperative Awareness', 'Empirical Evaluation', 'Vehicular Networks', 'Intelligent Transportation Systems', 'Periodic Message Exchange']"
1214,1402.0631,Sanjay Bhalgama,"S.R.Bhalgama, C.C.Kavar, S.S.Parmar","LWRP: Low Power Consumption Weighting Replacement Policy using Buffer
  Memory","4 pages, 2 figures, Published with International Journal of Computer
  Trends and Technology (IJCTT)","IJCTT 7(3):147-150, January 2014. Published by Seventh Sense
  Research Group",10.14445/22312803/IJCTT-V7P142,,cs.OS,http://creativecommons.org/licenses/by/3.0/,"  As the performance gap between memory and processors has increased, then it
leads to the poor performance. Efficient virtual memory can overcome this
problem. And the efficiency of virtual memory depends on the replacement policy
used for cache. In this paper, our algorithm not only based on the time to last
access and frequency index but, we also consider the power consumption. We show
that Low Power Consumption Weighting Replacement Policy (LWRP) has better
performance and low power consumption.
","[{'version': 'v1', 'created': 'Tue, 4 Feb 2014 06:26:34 GMT'}]",2014-02-05,"[['Bhalgama', 'S. R.', ''], ['Kavar', 'C. C.', ''], ['Parmar', 'S. S.', '']]","['LFU', 'LRU', 'Memory management', 'replacement policy', 'weighting replacement policy']"
1215,1305.7410,Zhe Chen,"Zhe Chen, Daqiang Zhang, Rongbo Zhu, Yinxue Ma, Ping Yin, Feng Xie","A Review of Automated Formal Verification of Ad Hoc Routing Protocols
  for Wireless Sensor Networks","12 pages, 1 figure, Journal Article","Sensor Letters, Volume 11, Number 5, May 2013, pp. 752-764",10.1166/sl.2013.2653,,cs.NI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper surveys how formal verification can be used to prove the
correctness of ad hoc routing protocols, which are fundamental infrastructure
of wireless sensor networks. The existing techniques fall into two classes:
verification on small-scale networks and verification on unbounded networks.
The former one is always fully automatic and easy to use, thanks to the limited
state space generated in verification. However, it cannot prove the correctness
over all cases. The latter one can provide a complete proof based on
abstractions of unbounded network. However, it usually needs user intervention
and expertise in verification. The two kinds of technique are illustrated by
verifications against some key properties such as stability, loop-freedom and
deadlock-freedom. To conclude, they can be used to find faults and prove
correctness, respectively. We believe that they can together aid the
development of correct ad hoc routing protocols and their reliable
implementations.
","[{'version': 'v1', 'created': 'Fri, 31 May 2013 14:25:50 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Feb 2014 10:30:57 GMT'}, {'version': 'v3', 'created': 'Tue, 26 Aug 2014 12:44:53 GMT'}]",2014-08-27,"[['Chen', 'Zhe', ''], ['Zhang', 'Daqiang', ''], ['Zhu', 'Rongbo', ''], ['Ma', 'Yinxue', ''], ['Yin', 'Ping', ''], ['Xie', 'Feng', '']]","['formal verification', 'routing protocol', 'ad hoc network', 'model checking', 'theorem proving']"
1216,1811.11259,Francesco Fraternali,"Francesco Fraternali, Bharathan Balaji, Rajesh Gupta","Scaling Configuration of Energy Harvesting Sensors with Reinforcement
  Learning","7 pages, 5 figures","ENSsys '18: International Workshop on Energy Harvesting &
  Energy-Neutral Sensing Systems}{November 4, 2018}{Shenzhen, China",10.1145/3279755.3279760,,cs.LG cs.AI cs.DS cs.SY stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the advent of the Internet of Things (IoT), an increasing number of
energy harvesting methods are being used to supplement or supplant battery
based sensors. Energy harvesting sensors need to be configured according to the
application, hardware, and environmental conditions to maximize their
usefulness. As of today, the configuration of sensors is either manual or
heuristics based, requiring valuable domain expertise. Reinforcement learning
(RL) is a promising approach to automate configuration and efficiently scale
IoT deployments, but it is not yet adopted in practice. We propose solutions to
bridge this gap: reduce the training phase of RL so that nodes are operational
within a short time after deployment and reduce the computational requirements
to scale to large deployments. We focus on configuration of the sampling rate
of indoor solar panel based energy harvesting sensors. We created a simulator
based on 3 months of data collected from 5 sensor nodes subject to different
lighting conditions. Our simulation results show that RL can effectively learn
energy availability patterns and configure the sampling rate of the sensor
nodes to maximize the sensing data while ensuring that energy storage is not
depleted. The nodes can be operational within the first day by using our
methods. We show that it is possible to reduce the number of RL policies by
using a single policy for nodes that share similar lighting conditions.
","[{'version': 'v1', 'created': 'Tue, 27 Nov 2018 21:05:43 GMT'}]",2018-11-29,"[['Fraternali', 'Francesco', ''], ['Balaji', 'Bharathan', ''], ['Gupta', 'Rajesh', '']]","['Internet of Things', 'Reinforcement Learning', 'Battery-Less', 'Scaling']"
1217,1311.0803,Marcin Makowski,"Marcin Makowski, Edward W. Piotrowski","When ""I cut, you choose"" method implies intransitivity",,"Physica A: Statistical Mechanics and its Applications (2014) 415C
  pp. 189-193",10.1016/j.physa.2014.05.074,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a common belief that humans and many animals follow transitive
inference (choosing A over C on the basis of knowing that A is better than B
and B is better than C). Transitivity seems to be the essence of rational
choice. We present a theoretical model of a repeated game in which the players
make a choice between three goods (e.g. food). The rules of the game refer to
the simple procedure of fair division among two players, known as the ""I cut,
you choose"" mechanism which has been widely discussed in the literature. In
this game one of the players has to make intransitive choices in order to
achieve the optimal result (for him/her and his/her co-player). The point is
that an intransitive choice can be rational. Previously, an increase in the
significance of intransitive strategies was achieved by referring to models of
quantum games. We show that \textit{relevant intransitive strategies} also
appear in the classic description of decision algorithms.
","[{'version': 'v1', 'created': 'Thu, 31 Oct 2013 18:43:03 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Dec 2013 09:28:54 GMT'}, {'version': 'v3', 'created': 'Sat, 20 Sep 2014 10:48:02 GMT'}]",2014-09-23,"[['Makowski', 'Marcin', ''], ['Piotrowski', 'Edward W.', '']]","['intransitivity', 'relevant intransitive strategies', 'repeated game']"
1218,1902.00543,Rodin Aarssen,"Rodin Aarssen (CWI, Netherlands), Jurgen Vinju (CWI, Netherlands),
  Tijs van der Storm (CWI, Netherlands)",Concrete Syntax with Black Box Parsers,,"The Art, Science, and Engineering of Programming, 2019, Vol. 3,
  Issue 3, Article 15",10.22152/programming-journal.org/2019/3/15,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Meta programming consists for a large part of matching, analyzing,
and transforming syntax trees. Many meta programming systems process abstract
syntax trees, but this requires intimate knowledge of the structure of the data
type describing the abstract syntax. As a result, meta programming is
error-prone, and meta programs are not resilient to evolution of the structure
of such ASTs, requiring invasive, fault-prone change to these programs.
Inquiry: Concrete syntax patterns alleviate this problem by allowing the meta
programmer to match and create syntax trees using the actual syntax of the
object language. Systems supporting concrete syntax patterns, however, require
a concrete grammar of the object language in their own formalism. Creating such
grammars is a costly and error-prone process, especially for realistic
languages such as Java and C++. Approach: In this paper we present Concretely,
a technique to extend meta programming systems with pluggable concrete syntax
patterns, based on external, black box parsers. We illustrate Concretely in the
context of Rascal, an open-source meta programming system and language
workbench, and show how to reuse existing parsers for Java, JavaScript, and
C++. Furthermore, we propose Tympanic, a DSL to declaratively map external AST
structures to Rascal's internal data structures. Tympanic allows implementors
of Concretely to solve the impedance mismatch between object-oriented class
hierarchies in Java and Rascal's algebraic data types. Both the algebraic data
type and AST marshalling code is automatically generated. Knowledge: The
conceptual architecture of Concretely and Tympanic supports the reuse of
pre-existing, external parsers, and their AST representation in meta
programming systems that feature concrete syntax patterns for matching and
constructing syntax trees. As such this opens up concrete syntax pattern
matching for a host of realistic languages for which writing a grammar from
scratch is time consuming and error-prone, but for which industry-strength
parsers exist in the wild. Grounding: We evaluate Concretely in terms of source
lines of code (SLOC), relative to the size of the AST data type and marshalling
code. We show that for real programming languages such as C++ and Java, adding
support for concrete syntax patterns takes an effort only in the order of
dozens of SLOC. Similarly, we evaluate Tympanic in terms of SLOC, showing an
order of magnitude of reduction in SLOC compared to manual implementation of
the AST data types and marshalling code. Importance: Meta programming has
applications in reverse engineering, reengineering, source code analysis,
static analysis, software renovation, domain-specific language engineering, and
many others. Processing of syntax trees is central to all of these tasks.
Concrete syntax patterns improve the practice of constructing meta programs.
The combination of Concretely and Tympanic has the potential to make concrete
syntax patterns available with very little effort, thereby improving and
promoting the application of meta programming in the general software
engineering context.
","[{'version': 'v1', 'created': 'Fri, 1 Feb 2019 20:14:45 GMT'}]",2019-02-05,"[['Aarssen', 'Rodin', '', 'CWI, Netherlands'], ['Vinju', 'Jurgen', '', 'CWI, Netherlands'], ['van der Storm', 'Tijs', '', 'CWI, Netherlands']]","['meta programming', 'concrete syntax patterns', 'black box parsers', 'grammar mapping']"
1219,1108.0267,Amy Poh Ai Ling,Amy Poh Ai Ling and Mukaidono Masao,"Grid Information Security Functional Requirement - Fulfilling
  Information Security of a Smart Grid System",19 pages,"International Journal of Grid Computing & Applications (IJGCA)
  Vol.2, No.2, June 2011, page 1-19",10.5121/ijgca.2011.2201,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the background of smart information infrastructure and
the needs for smart grid information security. It introduces the conceptual
analysis to the methodology with the application of hermeneutic circle and
information security functional requirement identification. Information
security for the grid market cover matters includes automation and
communications industry that affects the operation of electric power systems
and the functioning of the utilities that manage them and its awareness of this
information infrastructure has become critical to the reliability of the power
system. Community benefits from of cost savings, flexibility and deployment
along with the establishment of wireless communications. However, concern
revolves around the security protections for easily accessible devices such as
the smart meter and the related communications hardware. On the other hand, the
changing points between traditional versus smart grid networking trend and the
information security importance on the communication field reflects the
criticality of grid information security functional requirement identification.
The goal of this paper is to identify the functional requirement and relate its
significance addresses to the consumer requirement of an information security
of a smart grid. Vulnerabilities may bring forth possibility for an attacker to
penetrate a network, make headway admission to control software, alter it to
load conditions that destabilize the grid in unpredictable ways. Focusing on
the grid information security functional requirement is stepping ahead in
developing consumer trust and satisfaction toward smart grid completeness.
","[{'version': 'v1', 'created': 'Mon, 1 Aug 2011 09:37:45 GMT'}]",2011-08-02,"[['Ling', 'Amy Poh Ai', ''], ['Masao', 'Mukaidono', '']]","['Functional Requirement', 'Smart Grid', 'Information Security', 'Networking Trend', 'Consumer Requirement']"
1220,1107.1608,Jesus Emeterio Navarro-Barrientos,J.-Emeterio Navarro-Barrientos,"Formation of Common Investment Networks by Project Establishment between
  Agents",,"SBP 2011, LNCS 6589, Springer (2011) pp.172-179",10.1007/978-3-642-19656-0_26,,cs.SI cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an investment model integrated with trust-reputation mechanisms
where agents interact with each other to establish investment projects. We
investigate the establishment of investment projects, the influence of the
interaction between agents in the evolution of the distribution of wealth, as
well as the formation of common investment networks and some of their
properties. Simulation results show that the wealth distribution presents a
power law in its tail. Also, it is shown that the trust and reputation
mechanism presented leads to the establishment of networks among agents, which
present some of the typical characteristics of real-life networks like a high
clustering coefficient and short average path length.
","[{'version': 'v1', 'created': 'Fri, 8 Jul 2011 11:15:59 GMT'}]",2015-03-19,"[['Navarro-Barrientos', 'J. -Emeterio', '']]","['agent-based computational economics', 'trust/reputation dynamics', 'investment networks']"
1221,1912.06385,Hazrat Ali,"Hazrat Ali, Feroz Karim, Junaid Javed Qureshi, Adnan Omer Abuassba,
  Mohammad Farhad Bulbul",Seizure Prediction Using Bidirectional LSTM,"CyberDI 2019, Cyberspace Data and Intelligence, and Cyber-Living,
  Syndrome, and Health pp 349-356",,10.1007/978-981-15-1922-2_25,,cs.LG eess.SP stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Approximately, 50 million people in the world are affected by epilepsy. For
patients, the anti-epileptic drugs are not always useful and these drugs may
have undesired side effects on a patient's health. If the seizure is predicted
the patients will have enough time to take preventive measures. The purpose of
this work is to investigate the application of bidirectional LSTM for seizure
prediction. In this paper, we trained EEG data from canines on a double
Bidirectional LSTM layer followed by a fully connected layer. The data was
provided in the form of a Kaggle competition by American Epilepsy Society. The
main task was to classify the interictal and preictal EEG clips. Using this
model, we obtained an AUC of 0.84 on the test dataset. Which shows that our
classifier's performance is above chance level on unseen data. The comparison
with the previous work shows that the use of bidirectional LSTM networks can
achieve significantly better results than SVM and GRU networks.
","[{'version': 'v1', 'created': 'Fri, 13 Dec 2019 10:08:45 GMT'}]",2019-12-16,"[['Ali', 'Hazrat', ''], ['Karim', 'Feroz', ''], ['Qureshi', 'Junaid Javed', ''], ['Abuassba', 'Adnan Omer', ''], ['Bulbul', 'Mohammad Farhad', '']]","['Seizure Prediction', 'Bidirectional LSTM', 'Deep Learning', 'EEG']"
1222,1807.06160,Homanga Bharadhwaj,Homanga Bharadhwaj,Layer-wise Relevance Propagation for Explainable Recommendations,Accepted in Proceedings of the EARS Workshop at SIGIR 2018,"Homanga Bharadhwaj. 2018. Layer-wise Relevance Propagation for
  Explainable Recommendations. In Proceedings of SIGIR 2018 Workshop on
  ExplainAble Recommendation and Search (EARS'18). ACM, New York, NY, USA",,,cs.LG cs.CV cs.IR cs.MM stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we tackle the problem of explanations in a deep-learning based
model for recommendations by leveraging the technique of layer-wise relevance
propagation. We use a Deep Convolutional Neural Network to extract relevant
features from the input images before identifying similarity between the images
in feature space. Relationships between the images are identified by the model
and layer-wise relevance propagation is used to infer pixel-level details of
the images that may have significantly informed the model's choice. We evaluate
our method on an Amazon products dataset and demonstrate the efficacy of our
approach.
","[{'version': 'v1', 'created': 'Tue, 17 Jul 2018 00:38:31 GMT'}]",2018-07-18,"[['Bharadhwaj', 'Homanga', '']]","['Recommender systems', 'Explanations', 'Deep Convolutional NeuralNetwork', 'Layer-wise Relevance Propagation']"
1223,1005.0095,Pino Caballero-Gil,"P. Caballero-Gil, A. F\'uster-Sabater",A Simple Attack on Some Clock-Controlled Generators,,"Computers & Mathematics with Applications. Vol. 58 , Is. 1 (July
  2009) pp. 179-188",10.1016/j.camwa.2009.03.103,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new approach to edit distance attacks on certain
clock-controlled generators, which applies basic concepts of Graph Theory to
simplify the search trees of the original attacks in such a way that only the
most promising branches are analyzed. In particular, the proposed improvement
is based on cut sets defined on some graphs so that certain shortest paths
provide the edit distances. The strongest aspects of the proposal are that the
obtained results from the attack are absolutely deterministic, and that many
inconsistent initial states of the target registers are recognized beforehand
and avoided during search.
","[{'version': 'v1', 'created': 'Sat, 1 May 2010 18:07:36 GMT'}]",2010-05-04,"[['Caballero-Gil', 'P.', ''], ['Fúster-Sabater', 'A.', '']]","['Cryptanalysis', 'Stream Cipher', 'Graphs', 'Edit Distance']"
1224,1307.4901,Janusz Dybizba\'nski,Janusz Dybizba\'nski and Andrzej Szepietowski,Oriented chromatic number of Halin graphs,,,10.1016/j.ipl.2013.09.011,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Oriented chromatic number of an oriented graph $G$ is the minimum order of an
oriented graph $H$ such that $G$ admits a homomorphism to $H$. The oriented
chromatic number of an unoriented graph $G$ is the maximal chromatic number
over all possible orientations of $G$. In this paper, we prove that every Halin
graph has oriented chromatic number at most 8, improving a previous bound by
Hosseini Dolama and Sopena, and confirming the conjecture given by Vignal.
","[{'version': 'v1', 'created': 'Thu, 18 Jul 2013 10:54:33 GMT'}]",2019-09-04,"[['Dybizbański', 'Janusz', ''], ['Szepietowski', 'Andrzej', '']]","['Graph coloring', 'oriented graph coloring', 'Halin graph', 'oriented chromatic number']"
1225,2208.12961,Takahito Murakami,"Takahito Murakami, Maya Grace Torii, Xanat Vargas Meza, Yoichi Ochiai","Kuchibashi: 3D-Printed Tweezers Bioinspired by the New Caledonian Crow's
  Beak","2 pages, 2figures,ACM SIGGRAPH2022",ACM SIGGRAPH 2022. Posters Article 18. 1-2,10.1145/3532719.3543254,,cs.HC cs.GR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this study we implemented Kuchibashi, the New Caledonian Crow beak-like
tweezers, and conducted a user study to evaluate the prototype's usability. We
proved that Kuchibashi is superior in interacting with large spherical objects
than hands and tweezers. Also, impressions of security and safeness were
perceived positively by the participants.
","[{'version': 'v1', 'created': 'Sat, 27 Aug 2022 08:51:22 GMT'}]",2022-08-30,"[['Murakami', 'Takahito', ''], ['Torii', 'Maya Grace', ''], ['Meza', 'Xanat Vargas', ''], ['Ochiai', 'Yoichi', '']]","['3D printing', 'New Caledonian Crow', 'ergonomics']"
1226,1907.10918,Alex Alvarado,"Alex Alvarado and Gabriele Liga and Yi Lei and Bin Chen and Alexios
  Balatsoukas-Stimming",Improving HD-FEC decoding via bit marking,OECC 2019,,10.23919/PS.2019.8817790,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We review the recently introduced soft-aided bit-marking (SABM) algorithm and
its suitability for product codes. Some aspects of the implementation of the
SABM algorithm are discussed. The influence of suboptimal channel soft
information is also analyzed.
","[{'version': 'v1', 'created': 'Thu, 25 Jul 2019 09:23:39 GMT'}]",2020-06-05,"[['Alvarado', 'Alex', ''], ['Liga', 'Gabriele', ''], ['Lei', 'Yi', ''], ['Chen', 'Bin', ''], ['Balatsoukas-Stimming', 'Alexios', '']]","['Forward error correction', 'hard-decision FEC', 'iterative decoding', 'soft information', 'logarithmic likelihood ratios']"
1227,1807.06067,Chaochao Yan,"Chaochao Yan and Jiawen Yao and Ruoyu Li and Zheng Xu and Junzhou
  Huang","Weakly Supervised Deep Learning for Thoracic Disease Classification and
  Localization on Chest X-rays",10 pages. Accepted by the ACM BCB 2018,,10.1145/3233547.3233573,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Chest X-rays is one of the most commonly available and affordable
radiological examinations in clinical practice. While detecting thoracic
diseases on chest X-rays is still a challenging task for machine intelligence,
due to 1) the highly varied appearance of lesion areas on X-rays from patients
of different thoracic disease and 2) the shortage of accurate pixel-level
annotations by radiologists for model training. Existing machine learning
methods are unable to deal with the challenge that thoracic diseases usually
happen in localized disease-specific areas. In this article, we propose a
weakly supervised deep learning framework equipped with squeeze-and-excitation
blocks, multi-map transfer, and max-min pooling for classifying thoracic
diseases as well as localizing suspicious lesion regions. The comprehensive
experiments and discussions are performed on the ChestX-ray14 dataset. Both
numerical and visual results have demonstrated the effectiveness of the
proposed model and its better performance against the state-of-the-art
pipelines.
","[{'version': 'v1', 'created': 'Mon, 16 Jul 2018 19:19:38 GMT'}]",2018-07-18,"[['Yan', 'Chaochao', ''], ['Yao', 'Jiawen', ''], ['Li', 'Ruoyu', ''], ['Xu', 'Zheng', ''], ['Huang', 'Junzhou', '']]","['Chest X-ray', 'computer-aided diagnosis', 'weakly supervised learning']"
1228,1303.1734,Zungeru Adamu Murtala,A.M. Zungeru,"An electronic digital combination lock: A precise and reliable security
  system","13 pages, 9 figures, 1 Table","A.M. Zungeru. An electronic digital combination lock: A precise
  and reliable security system. International Journal of Security, Privacy and
  Trust Management (IJSPTM), vol. 2(1), pp. 29-41, 2013",10.5121/ijsptm.2013.2103,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing rate of crime, attacks by thieves, intruders and vandals,
despite all forms of security gadgets and locks still need the attention of
researchers to find a permanent solution to the well being of lives and
properties of individuals. To this end, we design a cheap and effective
security system for buildings, cars, safes, doors and gates, so as to prevent
unauthorized person from having access to ones properties through the use of
codes, we therefore experiment the application of electronic devices as locks.
However, a modular approach was employed in the design in which the combination
lock was divided into units and each unit designed separately before being
coupled to form a whole functional system. During the design, we conducted
Twenty tests with the first eight combinations being four in number, the next
seven tests being five and the last five combinations being six. This was done
because of the incorporation of 2 dummy switches in the combinations. From the
result obtained, combinations 8, 11, 13 gave the correct output combination.
However, 8 being the actual combination gave the required output. The general
operation of the system and performance is dependent on the key combinations.
The overall system was constructed and tested and it works perfectly.
","[{'version': 'v1', 'created': 'Thu, 7 Mar 2013 16:20:22 GMT'}]",2013-03-08,"[['Zungeru', 'A. M.', '']]","['Security system', 'Motion Detector', 'Transducers', 'Buzzer', 'Ultrasonic Sound', 'Electronic Circuit Design']"
1229,2210.11820,Pablo Donato,"Pablo Donato (LIX, PARTOUT), Pierre-Yves Strub (LIX), Benjamin Werner
  (LIX, PARTOUT)",A drag-and-drop proof tactic,,"CPP '22: 11th ACM SIGPLAN International Conference on Certified
  Programs and Proofs, Jan 2022, Philadelphia, United States. pp.197-209",10.1145/3497775.3503692,,cs.HC cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore the features of a user interface where formal proofs can be built
through gestural actions. In particular, we show how proof construction steps
can be associated to drag-and-drop actions. We argue that this can provide
quick and intuitive proof construction steps. This work builds on theoretical
tools coming from deep inference. It also resumes and integrates some ideas of
the former proof-by-pointing project.
","[{'version': 'v1', 'created': 'Fri, 21 Oct 2022 08:47:09 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Nov 2022 13:23:09 GMT'}]",2022-11-08,"[['Donato', 'Pablo', '', 'LIX, PARTOUT'], ['Strub', 'Pierre-Yves', '', 'LIX'], ['Werner', 'Benjamin', '', 'LIX, PARTOUT']]","['logic', 'formal proofs', 'user interfaces', 'deep inference']"
1230,1201.4292,John Whitbeck,"John Whitbeck, Yoann Lopez, Jeremie Leguay, Vania Conan, Marcelo Dias
  de Amorim","Push-and-Track: Saving Infrastructure Bandwidth Through Opportunistic
  Forwarding","Accepted for publication in the Pervasive and Mobile Computing
  journal",,10.1016/j.pmcj.2012.02.001,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Major wireless operators are nowadays facing network capacity issues in
striving to meet the growing demands of mobile users. At the same time,
3G-enabled devices increasingly benefit from ad hoc radio connectivity (e.g.,
Wi-Fi). In this context of hybrid connectivity, we propose Push-and-track, a
content dissemina- tion framework that harnesses ad hoc communication
opportunities to minimize the load on the wireless infrastructure while
guaranteeing tight delivery delays. It achieves this through a control loop
that collects user-sent acknowledgements to determine if new copies need to be
reinjected into the network through the 3G interface. Push-and-Track is
flexible and can be applied to a variety of scenarios, including periodic
message flooding and floating data. For the former, this paper examines
multiple strategies to determine how many copies of the content should be
injected, when, and to whom; for the latter, it examines the achievable offload
ratio depending on the freshness constraints. The short delay-tolerance of
common content, such as news or road traffic updates, make them suitable for
such a system. Use cases with a long delay-tolerance, such as software updates,
are an even better fit. Based on a realistic large-scale vehicular dataset from
the city of Bologna composed of more than 10,000 vehicles, we demonstrate that
Push-and-Track consistently meets its delivery objectives while reducing the
use of the 3G network by about 90%.
","[{'version': 'v1', 'created': 'Fri, 20 Jan 2012 13:53:37 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Feb 2012 10:26:19 GMT'}, {'version': 'v3', 'created': 'Sat, 18 Feb 2012 14:15:51 GMT'}]",2012-02-21,"[['Whitbeck', 'John', ''], ['Lopez', 'Yoann', ''], ['Leguay', 'Jeremie', ''], ['Conan', 'Vania', ''], ['de Amorim', 'Marcelo Dias', '']]","['Feedback loop', 'Offloading', 'Delay-Tolerant Networking']"
1231,1801.05284,Juan Eugenio Iglesias,"Juan Eugenio Iglesias and Marc Modat and Loic Peter and Allison
  Stevens and Roberto Annunziata and Tom Vercauteren and Ed Lein and Bruce
  Fischl and Sebastien Ourselin","Joint registration and synthesis using a probabilistic model for
  alignment of MRI and histological sections",,,10.1016/j.media.2018.09.002,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nonlinear registration of 2D histological sections with corresponding slices
of MRI data is a critical step of 3D histology reconstruction. This task is
difficult due to the large differences in image contrast and resolution, as
well as the complex nonrigid distortions produced when sectioning the sample
and mounting it on the glass slide. It has been shown in brain MRI registration
that better spatial alignment across modalities can be obtained by synthesizing
one modality from the other and then using intra-modality registration metrics,
rather than by using mutual information (MI) as metric. However, such an
approach typically requires a database of aligned images from the two
modalities, which is very difficult to obtain for histology/MRI.
  Here, we overcome this limitation with a probabilistic method that
simultaneously solves for registration and synthesis directly on the target
images, without any training data. In our model, the MRI slice is assumed to be
a contrast-warped, spatially deformed version of the histological section. We
use approximate Bayesian inference to iteratively refine the probabilistic
estimate of the synthesis and the registration, while accounting for each
other's uncertainty. Moreover, manually placed landmarks can be seamlessly
integrated in the framework for increased performance.
  Experiments on a synthetic dataset show that, compared with MI, the proposed
method makes it possible to use a much more flexible deformation model in the
registration to improve its accuracy, without compromising robustness.
Moreover, our framework also exploits information in manually placed landmarks
more efficiently than MI, since landmarks inform both synthesis and
registration - as opposed to registration alone. Finally, we show qualitative
results on the public Allen atlas, in which the proposed method provides a
clear improvement over MI based registration.
","[{'version': 'v1', 'created': 'Tue, 16 Jan 2018 15:16:05 GMT'}]",2018-09-28,"[['Iglesias', 'Juan Eugenio', ''], ['Modat', 'Marc', ''], ['Peter', 'Loic', ''], ['Stevens', 'Allison', ''], ['Annunziata', 'Roberto', ''], ['Vercauteren', 'Tom', ''], ['Lein', 'Ed', ''], ['Fischl', 'Bruce', ''], ['Ourselin', 'Sebastien', '']]","['Synthesis', 'registration', 'variational Bayes', 'histology reconstruction']"
1232,1705.08063,Arman Cohan,"Arman Cohan, Nazli Goharian","Contextualizing Citations for Scientific Summarization using Word
  Embeddings and Domain Knowledge",SIGIR 2017,,10.1145/3077136.3080740,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Citation texts are sometimes not very informative or in some cases inaccurate
by themselves; they need the appropriate context from the referenced paper to
reflect its exact contributions. To address this problem, we propose an
unsupervised model that uses distributed representation of words as well as
domain knowledge to extract the appropriate context from the reference paper.
Evaluation results show the effectiveness of our model by significantly
outperforming the state-of-the-art. We furthermore demonstrate how an effective
contextualization method results in improving citation-based summarization of
the scientific articles.
","[{'version': 'v1', 'created': 'Tue, 23 May 2017 02:55:56 GMT'}]",2017-05-24,"[['Cohan', 'Arman', ''], ['Goharian', 'Nazli', '']]","['Text Summarization', 'Scientifc Text', 'Information Retrieval']"
1233,1906.01785,Michael Huth,"Kwok Cheung and Michael Huth and Laurence Kirk and Leif-Nissen
  Lundb{\ae}k and Rodolphe Marques and Jan Petsche","Owner-centric sharing of physical resources, data, and data-driven
  insights in digital ecosystems",,ACM SACMAT 2019: 73-81,10.1145/3322431.3326326,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We are living in an age in which digitization will connect more and more
physical assets with IT systems and where IoT endpoints will generate a wealth
of valuable data. Companies, individual users, and organizations alike
therefore have the need to control their own physical or non-physical assets
and data sources. At the same time, they recognize the need for, and
opportunity to, share access to such data and digitized physical assets. This
paper sets out our technology vision for such sharing ecosystems, reports
initial work in that direction, identifies challenges for realizing this
vision, and seeks feedback and collaboration from the academic access-control
community in that R\&D space.
","[{'version': 'v1', 'created': 'Wed, 5 Jun 2019 02:09:13 GMT'}]",2019-06-06,"[['Cheung', 'Kwok', ''], ['Huth', 'Michael', ''], ['Kirk', 'Laurence', ''], ['Lundbæk', 'Leif-Nissen', ''], ['Marques', 'Rodolphe', ''], ['Petsche', 'Jan', '']]","['FROST Language', 'Policy Life Cycle', 'Software DevelopmentKit', 'Belnap Logic', 'Distributed Ledger']"
1234,1303.0665,Florent Garcin,"Florent Garcin, Christos Dimitrakakis and Boi Faltings",Personalized News Recommendation with Context Trees,,"Proceedings of the 7th ACM conference on Recommender systems
  (2013), pp. 105--112",10.1145/2507157.2507166,,cs.IR cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The profusion of online news articles makes it difficult to find interesting
articles, a problem that can be assuaged by using a recommender system to bring
the most relevant news stories to readers. However, news recommendation is
challenging because the most relevant articles are often new content seen by
few users. In addition, they are subject to trends and preference changes over
time, and in many cases we do not have sufficient information to profile the
reader.
  In this paper, we introduce a class of news recommendation systems based on
context trees. They can provide high-quality news recommendation to anonymous
visitors based on present browsing behaviour. We show that context-tree
recommender systems provide good prediction accuracy and recommendation
novelty, and they are sufficiently flexible to capture the unique properties of
news articles.
","[{'version': 'v1', 'created': 'Mon, 4 Mar 2013 10:34:13 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Nov 2014 16:19:43 GMT'}]",2014-11-04,"[['Garcin', 'Florent', ''], ['Dimitrakakis', 'Christos', ''], ['Faltings', 'Boi', '']]","['online recommender system', 'personalization', 'news']"
1235,1311.0359,Bartlomiej Placzek,Bart{\l}omiej P{\l}aczek and Marcin Berna\'s,"Optimizing data collection for object tracking in wireless sensor
  networks","10 pages, 6 figures","Communications in Computer and Information Science, vol. 370, pp.
  485-494 (2013)",10.1007/978-3-642-38865-1_49,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper some modifications are proposed to optimize an algorithm of
object tracking in wireless sensor network (WSN). The task under consideration
is to control movement of a mobile sink, which has to reach a target in the
shortest possible time. Utilization of the WSN resources is optimized by
transferring only selected data readings (target locations) to the mobile sink.
Simulations were performed to evaluate the proposed modifications against
state-of-the-art methods. The obtained results show that the presented tracking
algorithm allows for substantial reduction of data collection costs with no
significant increase in the amount of time that it takes to catch the target.
","[{'version': 'v1', 'created': 'Sat, 2 Nov 2013 09:03:49 GMT'}]",2013-11-05,"[['Płaczek', 'Bartłomiej', ''], ['Bernaś', 'Marcin', '']]","['wireless sensor networks', 'data collection', 'object tracking']"
1236,1407.7929,EPTCS,"Maribel Fern\'andez (King's College London, Department of Informatics,
  Strand, London WC2R 2LS, UK), H\'el\`ene Kirchner (Inria, Domaine de
  Voluceau, Rocquencourt BP 105, 78153 Le Chesnay Cedex, France), Bruno Pinaud
  (Bordeaux University, LaBRI CNRS UMR5800, 33405 Talence Cedex, France)","Strategic Port Graph Rewriting: An Interactive Modelling and Analysis
  Framework","In Proceedings GRAPHITE 2014, arXiv:1407.7671","EPTCS 159, 2014, pp. 15-29",10.4204/EPTCS.159.3,,cs.LO cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present strategic portgraph rewriting as a basis for the implementation of
visual modelling and analysis tools. The goal is to facilitate the
specification, analysis and simulation of complex systems, using port graphs. A
system is represented by an initial graph and a collection of graph rewriting
rules, together with a user-defined strategy to control the application of
rules. The strategy language includes constructs to deal with graph traversal
and management of rewriting positions in the graph. We give a small-step
operational semantics for the language, and describe its implementation in the
graph transformation and visualisation tool PORGY.
","[{'version': 'v1', 'created': 'Wed, 30 Jul 2014 03:22:43 GMT'}]",2014-07-31,"[['Fernández', 'Maribel', '', ""King's College London, Department of Informatics,\n  Strand, London WC2R 2LS, UK""], ['Kirchner', 'Hélène', '', 'Inria, Domaine de\n  Voluceau, Rocquencourt BP 105, 78153 Le Chesnay Cedex, France'], ['Pinaud', 'Bruno', '', 'Bordeaux University, LaBRI CNRS UMR5800, 33405 Talence Cedex, France']]","['port graph', 'graph rewriting', 'strategies', 'simulation', 'analysis', 'visual environment']"
1237,2301.04842,Ling Li,"Ling Li, Lin Zhao, Linhao Xu, Jie Xu",Towards High Performance One-Stage Human Pose Estimation,"5 pages, 5 figures, accepted at ACM Multimedia Asia (MMAsia) 2022","ACM Multimedia Asia (MMAsia '22), December 13-16, 2022, Tokyo,
  Japan",10.1145/3551626.3564968,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Making top-down human pose estimation method present both good performance
and high efficiency is appealing. Mask RCNN can largely improve the efficiency
by conducting person detection and pose estimation in a single framework, as
the features provided by the backbone are able to be shared by the two tasks.
However, the performance is not as good as traditional two-stage methods. In
this paper, we aim to largely advance the human pose estimation results of
Mask-RCNN and still keep the efficiency. Specifically, we make improvements on
the whole process of pose estimation, which contains feature extraction and
keypoint detection. The part of feature extraction is ensured to get enough and
valuable information of pose. Then, we introduce a Global Context Module into
the keypoints detection branch to enlarge the receptive field, as it is crucial
to successful human pose estimation. On the COCO val2017 set, our model using
the ResNet-50 backbone achieves an AP of 68.1, which is 2.6 higher than Mask
RCNN (AP of 65.5). Compared to the classic two-stage top-down method
SimpleBaseline, our model largely narrows the performance gap (68.1 AP vs. 68.9
AP) with a much faster inference speed (77 ms vs. 168 ms), demonstrating the
effectiveness of the proposed method. Code is available at:
https://github.com/lingl_space/maskrcnn_keypoint_refined.
","[{'version': 'v1', 'created': 'Thu, 12 Jan 2023 07:02:17 GMT'}]",2023-01-13,"[['Li', 'Ling', ''], ['Zhao', 'Lin', ''], ['Xu', 'Linhao', ''], ['Xu', 'Jie', '']]","['human pose estimation', 'one-stage', 'efficiency']"
1238,1607.08028,Matthew England Dr,"E. Abraham, J. Abbott, B. Becker, A.M. Bigatti, M. Brain, B.
  Buchberger, A. Cimatti, J.H. Davenport, M. England, P. Fontaine, S. Forrest,
  A. Griggio, D. Kroening, W.M. Seiler, T. Sturm",Satisfiability Checking meets Symbolic Computation (Project Paper),,"M. Kohlhase, M. Johansson, B. Miller, L. de Moura, F. Tompa, eds.,
  Intelligent Computer Mathematics (Proceedings of CICM 2016), pp. 28-43,
  (Lecture Notes in Computer Science, 9791). Springer International Publishing,
  2016",10.1007/978-3-319-42547-4_3,,cs.SC cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Symbolic Computation and Satisfiability Checking are two research areas, both
having their individual scientific focus but sharing also common interests in
the development, implementation and application of decision procedures for
arithmetic theories. Despite their commonalities, the two communities are
rather weakly connected. The aim of our newly accepted SC-square project
(H2020-FETOPEN-CSA) is to strengthen the connection between these communities
by creating common platforms, initiating interaction and exchange, identifying
common challenges, and developing a common roadmap from theory along the way to
tools and (industrial) applications. In this paper we report on the aims and on
the first activities of this project, and formalise some relevant challenges
for the unified SC-square community.
","[{'version': 'v1', 'created': 'Wed, 27 Jul 2016 10:38:53 GMT'}]",2016-10-05,"[['Abraham', 'E.', ''], ['Abbott', 'J.', ''], ['Becker', 'B.', ''], ['Bigatti', 'A. M.', ''], ['Brain', 'M.', ''], ['Buchberger', 'B.', ''], ['Cimatti', 'A.', ''], ['Davenport', 'J. H.', ''], ['England', 'M.', ''], ['Fontaine', 'P.', ''], ['Forrest', 'S.', ''], ['Griggio', 'A.', ''], ['Kroening', 'D.', ''], ['Seiler', 'W. M.', ''], ['Sturm', 'T.', '']]","['Logical Problems', 'Symbolic Computation', 'Computer Algebra Systems', 'Satisfiability Checking', 'Satisfiability Modulo Theories']"
1239,1906.01668,Sandeep Madireddy,"Sandeep Madireddy, Angel Yanguas-Gil, Prasanna Balaprakash","Neuromorphic Architecture Optimization for Task-Specific Dynamic
  Learning",,"Proceedings of the International Conference on Neuromorphic
  Systems 2019. ACM, New York, NY, USA, Article 5, 5 pages",10.1145/3354265.3354270,ANL/MCS-P9175-0419,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ability to learn and adapt in real time is a central feature of
biological systems. Neuromorphic architectures demonstrating such versatility
can greatly enhance our ability to efficiently process information at the edge.
A key challenge, however, is to understand which learning rules are best suited
for specific tasks and how the relevant hyperparameters can be fine-tuned. In
this work, we introduce a conceptual framework in which the learning process is
integrated into the network itself. This allows us to cast meta-learning as a
mathematical optimization problem. We employ DeepHyper, a scalable,
asynchronous model-based search, to simultaneously optimize the choice of
meta-learning rules and their hyperparameters. We demonstrate our approach with
two different datasets, MNIST and FashionMNIST, using a network architecture
inspired by the learning center of the insect brain. Our results show that
optimal learning rules can be dataset-dependent even within similar tasks. This
dependency demonstrates the importance of introducing versatility and
flexibility in the learning algorithms. It also illuminates experimental
findings in insect neuroscience that have shown a heterogeneity of learning
rules within the insect mushroom body.
","[{'version': 'v1', 'created': 'Tue, 4 Jun 2019 18:20:23 GMT'}]",2019-11-12,"[['Madireddy', 'Sandeep', ''], ['Yanguas-Gil', 'Angel', ''], ['Balaprakash', 'Prasanna', '']]","['Meta-Learning', 'Neuromorphic Architecture', 'Optimization', 'Dynamic Learning', 'Edge Processing']"
1240,1811.02642,Aman Rana,"Aman Rana, Gregory Yauney, Alarice Lowe, Pratik Shah","Computational Histological Staining and Destaining of Prostate Core
  Biopsy RGB Images with Generative Adversarial Neural Networks","Accepted for publication at 2018 IEEE International Conference on
  Machine Learning and Applications (ICMLA)",,10.1109/ICMLA.2018.00133,,cs.CV cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Histopathology tissue samples are widely available in two states:
paraffin-embedded unstained and non-paraffin-embedded stained whole slide RGB
images (WSRI). Hematoxylin and eosin stain (H&E) is one of the principal stains
in histology but suffers from several shortcomings related to tissue
preparation, staining protocols, slowness and human error. We report two novel
approaches for training machine learning models for the computational H&E
staining and destaining of prostate core biopsy RGB images. The staining model
uses a conditional generative adversarial network that learns hierarchical
non-linear mappings between whole slide RGB image (WSRI) pairs of prostate core
biopsy before and after H&E staining. The trained staining model can then
generate computationally H&E-stained prostate core WSRIs using previously
unseen non-stained biopsy images as input. The destaining model, by learning
mappings between an H&E stained WSRI and a non-stained WSRI of the same biopsy,
can computationally destain previously unseen H&E-stained images. Structural
and anatomical details of prostate tissue and colors, shapes, geometries,
locations of nuclei, stroma, vessels, glands and other cellular components were
generated by both models with structural similarity indices of 0.68 (staining)
and 0.84 (destaining). The proposed staining and destaining models can engender
computational H&E staining and destaining of WSRI biopsies without additional
equipment and devices.
","[{'version': 'v1', 'created': 'Fri, 26 Oct 2018 17:36:00 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Feb 2019 16:37:49 GMT'}]",2019-02-21,"[['Rana', 'Aman', ''], ['Yauney', 'Gregory', ''], ['Lowe', 'Alarice', ''], ['Shah', 'Pratik', '']]","['digitalhistopathology', 'computationalstaining', 'deep learning', 'H&E staining', 'GAN', 'prostate core biopsy']"
1241,1902.01328,Josef Matou\v{s},"Josef Matou\v{s}, Adam Kollar\v{c}\'ik, Martin Gurtner, Tom\'a\v{s}
  Mich\'alek, Zden\v{e}k Hur\'ak","Optimization-based Feedback Manipulation Through an Array of Ultrasonic
  Transducers",final version before submission to IFAC Mechatronics 2019 conference,,10.1016/j.ifacol.2019.11.722,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we document a novel laboratory experimental platform for
non-contact planar manipulation (positioning) of millimeter-scale objects using
acoustic pressure. The manipulated objects are either floating on a water
surface or rolling on a solid surface. The pressure field is shaped in real
time through an 8-by-8 array (matrix) of ultrasonic transducers. The
transducers are driven with square voltages whose phase-shifts are updated
periodically every few milliseconds based on the difference between the desired
and true (estimated from video) position. Numerical optimization is used within
every period of a discrete-time feedback loop to determine the phase shifts for
the voltages. The platform can be used as an affordable testbed for algorithms
for non-contact manipulation through arrays of actuators as all the design and
implementation details for the presented platform are shared with the public
through a dedicated git repository. The platform can certainly be extended
towards higher numbers of simultaneously yet independently manipulated objects
and larger manipulation areas by the expanding the transducer array.
","[{'version': 'v1', 'created': 'Mon, 4 Feb 2019 17:31:54 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Feb 2019 12:29:50 GMT'}, {'version': 'v3', 'created': 'Fri, 22 Feb 2019 11:40:54 GMT'}, {'version': 'v4', 'created': 'Thu, 12 Nov 2020 13:26:17 GMT'}]",2020-11-13,"[['Matouš', 'Josef', ''], ['Kollarčík', 'Adam', ''], ['Gurtner', 'Martin', ''], ['Michálek', 'Tomáš', ''], ['Hurák', 'Zdeněk', '']]","['Distributed manipulation', 'non-contact manipulation', 'optimization-based control', 'acoustic manipulation', 'acoustophoresis', 'distributed control']"
1242,1901.03888,Erion \c{C}ano,"Erion \c{C}ano, Maurizio Morisio",Hybrid Recommender Systems: A Systematic Literature Review,"38 pages, 9 figures, 14 tables. The final authenticated version is
  available online at
  https://content.iospress.com/articles/intelligent-data-analysis/ida163209","Intelligent Data Analysis, vol. 21, no. 6, pp. 1487-1524, 2017",10.3233/IDA-163209,,cs.IR cs.CY cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Recommender systems are software tools used to generate and provide
suggestions for items and other entities to the users by exploiting various
strategies. Hybrid recommender systems combine two or more recommendation
strategies in different ways to benefit from their complementary advantages.
This systematic literature review presents the state of the art in hybrid
recommender systems of the last decade. It is the first quantitative review
work completely focused in hybrid recommenders. We address the most relevant
problems considered and present the associated data mining and recommendation
techniques used to overcome them. We also explore the hybridization classes
each hybrid recommender belongs to, the application domains, the evaluation
process and proposed future research directions. Based on our findings, most of
the studies combine collaborative filtering with another technique often in a
weighted way. Also cold-start and data sparsity are the two traditional and top
problems being addressed in 23 and 22 studies each, while movies and movie
datasets are still widely used by most of the authors. As most of the studies
are evaluated by comparisons with similar methods using accuracy metrics,
providing more credible and user oriented evaluations remains a typical
challenge. Besides this, newer challenges were also identified such as
responding to the variation of user context, evolving user tastes or providing
cross-domain recommendations. Being a hot topic, hybrid recommenders represent
a good basis with which to respond accordingly by exploring newer opportunities
such as contextualizing recommendations, involving parallel hybrid algorithms,
processing larger datasets, etc.
","[{'version': 'v1', 'created': 'Sat, 12 Jan 2019 18:12:44 GMT'}]",2019-01-15,"[['Çano', 'Erion', ''], ['Morisio', 'Maurizio', '']]","['Hybrid Recommendations', 'Recommender Systems', 'Systematic Review', 'Recommendation Strategies']"
1243,2205.04346,Maurizio Ferrari Dacrema,"Maurizio Ferrari Dacrema, Fabio Moroni, Riccardo Nembrini, Nicola
  Ferro, Guglielmo Faggioli, Paolo Cremonesi","Towards Feature Selection for Ranking and Classification Exploiting
  Quantum Annealers","Source code is available on Github
  https://github.com/qcpolimi/SIGIR22_QuantumFeatureSelection.git","Proceedings of the 45th International ACM SIGIR Conference on
  Research and Development in Information Retrieval (SIGIR 2022)",10.1145/3477495.3531755,,cs.IR cs.LG quant-ph,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Feature selection is a common step in many ranking, classification, or
prediction tasks and serves many purposes. By removing redundant or noisy
features, the accuracy of ranking or classification can be improved and the
computational cost of the subsequent learning steps can be reduced. However,
feature selection can be itself a computationally expensive process. While for
decades confined to theoretical algorithmic papers, quantum computing is now
becoming a viable tool to tackle realistic problems, in particular
special-purpose solvers based on the Quantum Annealing paradigm. This paper
aims to explore the feasibility of using currently available quantum computing
architectures to solve some quadratic feature selection algorithms for both
ranking and classification. The experimental analysis includes 15
state-of-the-art datasets. The effectiveness obtained with quantum computing
hardware is comparable to that of classical solvers, indicating that quantum
computers are now reliable enough to tackle interesting problems. In terms of
scalability, current generation quantum computers are able to provide a limited
speedup over certain classical algorithms and hybrid quantum-classical
strategies show lower computational cost for problems of more than a thousand
features.
","[{'version': 'v1', 'created': 'Mon, 9 May 2022 14:46:38 GMT'}]",2022-05-10,"[['Dacrema', 'Maurizio Ferrari', ''], ['Moroni', 'Fabio', ''], ['Nembrini', 'Riccardo', ''], ['Ferro', 'Nicola', ''], ['Faggioli', 'Guglielmo', ''], ['Cremonesi', 'Paolo', '']]","['Feature Selection', 'Quantum Computing', 'Quantum Annealing', 'Machine Learning']"
1244,1901.07865,Lijun Sun,"Lijun Sun, Chao Lyu, Yuhui Shi","Cooperative coevolution of real predator robots and virtual robots in
  the pursuit domain",,Applied Soft Computing Journal 89 (2020) 106098,10.1016/j.asoc.2020.106098,,cs.RO cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The pursuit domain, or predator-prey problem is a standard testbed for the
study of coordination techniques. In spite that its problem setup is apparently
simple, it is challenging for the research of the emerged swarm intelligence.
This paper presents a particle swarm optimization (PSO) based cooperative
coevolutionary algorithm for the (predator) robots, called CCPSO-R, where real
and virtual robots coexist in an evolutionary algorithm (EA). Virtual robots
sample and explore the vicinity of the corresponding real robots and act as
their action spaces, while the real robots consist of the real predators who
actually pursue the prey robot without fixed behavior rules under the immediate
guidance of the fitness function, which is designed in a modular manner with
very limited domain knowledge. In addition, kinematic limits and collision
avoidance considerations are integrated into the update rules of robots.
Experiments are conducted on a scalable swarm of predator robots with 4 types
of preys, the results of which show the reliability, generality, and
scalability of the proposed CCPSO-R. Comparison with a representative dynamic
path planning based algorithm Multi-Agent Real-Time Pursuit (MAPS) further
shows the effectiveness of CCPSO-R. Finally, the codes of this paper are public
available at: https://github.com/LijunSun90/pursuitCCPSOR.
","[{'version': 'v1', 'created': 'Wed, 23 Jan 2019 13:15:20 GMT'}, {'version': 'v2', 'created': 'Tue, 31 Aug 2021 05:13:52 GMT'}]",2021-09-01,"[['Sun', 'Lijun', ''], ['Lyu', 'Chao', ''], ['Shi', 'Yuhui', '']]","['Swarm intelligence', 'Cooperative coevolution', 'Particle swarm']"
1245,1503.08623,Edd Barrett Dr,"Edd Barrett, Carl Friedrich Bolz, Lukas Diekmann, Laurence Tratt",Fine-grained Language Composition: A Case Study,"27 pages, 4 tables, 5 figures","European Conference on Object-Oriented Programming (ECOOP). July
  2016, Pages 3:1--3:27",10.4230/LIPIcs.ECOOP.2016.3,,cs.PL,http://creativecommons.org/licenses/by/4.0/,"  Although run-time language composition is common, it normally takes the form
of a crude Foreign Function Interface (FFI). While useful, such compositions
tend to be coarse-grained and slow. In this paper we introduce a novel
fine-grained syntactic composition of PHP and Python which allows users to
embed each language inside the other, including referencing variables across
languages. This composition raises novel design and implementation challenges.
We show that good solutions can be found to the design challenges; and that the
resulting implementation imposes an acceptable performance overhead of, at
most, 2.6x.
","[{'version': 'v1', 'created': 'Mon, 30 Mar 2015 10:10:18 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Dec 2015 15:36:57 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Jul 2016 11:39:51 GMT'}]",2017-03-02,"[['Barrett', 'Edd', ''], ['Bolz', 'Carl Friedrich', ''], ['Diekmann', 'Lukas', ''], ['Tratt', 'Laurence', '']]","['JIT', 'tracing', 'language composition']"
1246,1703.00520,Ivan Voitalov,"Ivan Voitalov, Rodrigo Aldecoa, Lan Wang, Dmitri Krioukov",Geohyperbolic Routing and Addressing Schemes,"6 pages, 1 figure","ACM SIGCOMM Computer Communication Review (CCR), vol. 47, issue 3,
  p. 11-18, July 2017",10.1145/3138808.3138811,,cs.NI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The key requirement to routing in any telecommunication network, and
especially in Internet-of-Things (IoT) networks, is scalability. Routing must
route packets between any source and destination in the network without
incurring unmanageable routing overhead that grows quickly with increasing
network size and dynamics. Here we present an addressing scheme and a coupled
network topology design scheme that guarantee essentially optimal routing
scalability. The FIB sizes are as small as they can be, equal to the number of
adjacencies a node has, while the routing control overhead is minimized as
nearly zero routing control messages are exchanged even upon catastrophic
failures in the network. The key new ingredient is the addressing scheme, which
is purely local, based only on geographic coordinates of nodes and a centrality
measure, and does not require any sophisticated non-local computations or
global network topology knowledge for network embedding. The price paid for
these benefits is that network topology cannot be arbitrary but should follow a
specific design, resulting in Internet-like topologies. The proposed schemes
can be most easily deployed in overlay networks, and also in other network
deployments, where geolocation information is available, and where network
topology can grow following the design specifications.
","[{'version': 'v1', 'created': 'Wed, 1 Mar 2017 21:39:00 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Sep 2017 04:23:09 GMT'}]",2017-09-12,"[['Voitalov', 'Ivan', ''], ['Aldecoa', 'Rodrigo', ''], ['Wang', 'Lan', ''], ['Krioukov', 'Dmitri', '']]","['Routing', 'Scalability', 'Addressing', 'Hyperbolic Routing']"
1247,1303.5659,Taisuke Sato,Taisuke Sato and Keiichi Kubota,Viterbi training in PRISM,"23 pages, 1 figure",Theory and Practice of Logic Programming 15 (2015) 147-168,10.1017/S1471068413000677,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  VT (Viterbi training), or hard EM, is an efficient way of parameter learning
for probabilistic models with hidden variables. Given an observation $y$, it
searches for a state of hidden variables $x$ that maximizes $p(x,y \mid
\theta)$ by coordinate ascent on parameters $\theta$ and $x$. In this paper we
introduce VT to PRISM, a logic-based probabilistic modeling system for
generative models. VT improves PRISM in three ways. First VT in PRISM converges
faster than EM in PRISM due to the VT's termination condition. Second,
parameters learned by VT often show good prediction performance compared to
those learned by EM. We conducted two parsing experiments with probabilistic
grammars while learning parameters by a variety of inference methods, i.e.\ VT,
EM, MAP and VB. The result is that VT achieved the best parsing accuracy among
them in both experiments. Also we conducted a similar experiment for
classification tasks where a hidden variable is not a prediction target unlike
probabilistic grammars. We found that in such a case VT does not necessarily
yield superior performance. Third since VT always deals with a single
probability of a single explanation, Viterbi explanation, the exclusiveness
condition that is imposed on PRISM programs is no more required if we learn
parameters by VT.
  Last but not least we can say that as VT in PRISM is general and applicable
to any PRISM program, it largely reduces the need for the user to develop a
specific VT algorithm for a specific model. Furthermore since VT in PRISM can
be used just by setting a PRISM flag appropriately, it makes VT easily
accessible to (probabilistic) logic programmers. To appear in Theory and
Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Fri, 22 Mar 2013 16:22:43 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Nov 2013 02:55:17 GMT'}]",2020-02-19,"[['Sato', 'Taisuke', ''], ['Kubota', 'Keiichi', '']]","['Viterbi training', 'PRISM', 'exclusiveness condition']"
1248,2102.08368,David Jurgens,"Jiajun Bao, Junjie Wu, Yiming Zhang, Eshwar Chandrasekharan, and David
  Jurgens","Conversations Gone Alright: Quantifying and Predicting Prosocial
  Outcomes in Online Conversations",Accepted for Publication at the Web Conference 2021; 12 pages,,10.1145/3442381.3450122,,cs.CY cs.CL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online conversations can go in many directions: some turn out poorly due to
antisocial behavior, while others turn out positively to the benefit of all.
Research on improving online spaces has focused primarily on detecting and
reducing antisocial behavior. Yet we know little about positive outcomes in
online conversations and how to increase them-is a prosocial outcome simply the
lack of antisocial behavior or something more? Here, we examine how
conversational features lead to prosocial outcomes within online discussions.
We introduce a series of new theory-inspired metrics to define prosocial
outcomes such as mentoring and esteem enhancement. Using a corpus of 26M Reddit
conversations, we show that these outcomes can be forecasted from the initial
comment of an online conversation, with the best model providing a relative 24%
improvement over human forecasting performance at ranking conversations for
predicted outcome. Our results indicate that platforms can use these early cues
in their algorithmic ranking of early conversations to prioritize better
outcomes.
","[{'version': 'v1', 'created': 'Tue, 16 Feb 2021 18:53:41 GMT'}]",2021-02-17,"[['Bao', 'Jiajun', ''], ['Wu', 'Junjie', ''], ['Zhang', 'Yiming', ''], ['Chandrasekharan', 'Eshwar', ''], ['Jurgens', 'David', '']]","['prosocial behavior', 'antisocial behavior', 'social media', 'behavioralforecasting']"
1249,1709.04409,Amanda Cercas Curry,"Amanda Cercas Curry, Helen Hastie and Verena Rieser",A Review of Evaluation Techniques for Social Dialogue Systems,2 pages,,10.1145/3139491.3139504,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In contrast with goal-oriented dialogue, social dialogue has no clear measure
of task success. Consequently, evaluation of these systems is notoriously hard.
In this paper, we review current evaluation methods, focusing on automatic
metrics. We conclude that turn-based metrics often ignore the context and do
not account for the fact that several replies are valid, while end-of-dialogue
rewards are mainly hand-crafted. Both lack grounding in human perceptions.
","[{'version': 'v1', 'created': 'Wed, 13 Sep 2017 16:31:44 GMT'}]",2017-09-14,"[['Curry', 'Amanda Cercas', ''], ['Hastie', 'Helen', ''], ['Rieser', 'Verena', '']]","['Automatic Evaluation', 'Social Dialogue Systems', 'Conversational Agents', 'Evaluation Metrics']"
1250,1703.05435,Mitar Milutinovic,"Mitar Milutinovic, Warren He, Howard Wu, Maxinder Kanwal",Proof of Luck: an Efficient Blockchain Consensus Protocol,"SysTEX '16, December 12-16, 2016, Trento, Italy",,10.1145/3007788.3007790,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the paper, we present designs for multiple blockchain consensus primitives
and a novel blockchain system, all based on the use of trusted execution
environments (TEEs), such as Intel SGX-enabled CPUs. First, we show how using
TEEs for existing proof of work schemes can make mining equitably distributed
by preventing the use of ASICs. Next, we extend the design with proof of time
and proof of ownership consensus primitives to make mining energy- and
time-efficient. Further improving on these designs, we present a blockchain
using a proof of luck consensus protocol. Our proof of luck blockchain uses a
TEE platform's random number generation to choose a consensus leader, which
offers low-latency transaction validation, deterministic confirmation time,
negligible energy consumption, and equitably distributed mining. Lastly, we
discuss a potential protection against up to a constant number of compromised
TEEs.
","[{'version': 'v1', 'created': 'Thu, 16 Mar 2017 00:32:02 GMT'}]",2017-03-17,"[['Milutinovic', 'Mitar', ''], ['He', 'Warren', ''], ['Wu', 'Howard', ''], ['Kanwal', 'Maxinder', '']]","['Blockchain', 'Trusted Execution Environments', 'Consensus Protocol', 'Intel SGX']"
1251,1504.05022,Weifeng Liu,"Weifeng Liu, Brian Vinter","A Framework for General Sparse Matrix-Matrix Multiplication on GPUs and
  Heterogeneous Processors","25 pages, 12 figures, published at Journal of Parallel and
  Distributed Computing (JPDC)",,10.1016/j.jpdc.2015.06.010,,cs.MS cs.DC math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  General sparse matrix-matrix multiplication (SpGEMM) is a fundamental
building block for numerous applications such as algebraic multigrid method
(AMG), breadth first search and shortest path problem. Compared to other sparse
BLAS routines, an efficient parallel SpGEMM implementation has to handle extra
irregularity from three aspects: (1) the number of nonzero entries in the
resulting sparse matrix is unknown in advance, (2) very expensive parallel
insert operations at random positions in the resulting sparse matrix dominate
the execution time, and (3) load balancing must account for sparse data in both
input matrices.
  In this work we propose a framework for SpGEMM on GPUs and emerging CPU-GPU
heterogeneous processors. This framework particularly focuses on the above
three problems. Memory pre-allocation for the resulting matrix is organized by
a hybrid method that saves a large amount of global memory space and
efficiently utilizes the very limited on-chip scratchpad memory. Parallel
insert operations of the nonzero entries are implemented through the GPU merge
path algorithm that is experimentally found to be the fastest GPU merge
approach. Load balancing builds on the number of necessary arithmetic
operations on the nonzero entries and is guaranteed in all stages.
  Compared with the state-of-the-art CPU and GPU SpGEMM methods, our approach
delivers excellent absolute performance and relative speedups on various
benchmarks multiplying matrices with diverse sparsity structures. Furthermore,
on heterogeneous processors, our SpGEMM approach achieves higher throughput by
using re-allocatable shared virtual memory.
  The source code of this work is available at
https://github.com/bhSPARSE/Benchmark_SpGEMM_using_CSR
","[{'version': 'v1', 'created': 'Mon, 20 Apr 2015 11:58:05 GMT'}, {'version': 'v2', 'created': 'Sun, 13 Sep 2015 07:38:29 GMT'}]",2015-09-15,"[['Liu', 'Weifeng', ''], ['Vinter', 'Brian', '']]","['sparse matrix', 'sparse matrix-matrix multiplication', 'linear algebra', 'GPU', 'heterogeneousprocessor', 'merging', 'parallel algorithm']"
1252,1611.01325,Gabriele D'Angelo,"Gabriele D'Angelo, Stefano Ferretti, Vittorio Ghini",Multi-level Simulation of Internet of Things on Smart Territories,"Simulation Modelling Practice and Theory, Elsevier, vol. 73 (April
  2017)",,10.1016/j.simpat.2016.10.008,,cs.PF cs.DC cs.MA cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a methodology is presented and employed for simulating the
Internet of Things (IoT). The requirement for scalability, due to the possibly
huge amount of involved sensors and devices, and the heterogeneous scenarios
that might occur, impose resorting to sophisticated modeling and simulation
techniques. In particular, multi-level simulation is regarded as a main
framework that allows simulating large-scale IoT environments while keeping
high levels of detail, when it is needed. We consider a use case based on the
deployment of smart services in decentralized territories. A two level
simulator is employed, which is based on a coarse agent-based, adaptive
parallel and distributed simulation approach to model the general life of
simulated entities. However, when needed a finer grained simulator (based on
OMNeT++) is triggered on a restricted portion of the simulated area, which
allows considering all issues concerned with wireless communications. Based on
this use case, it is confirmed that the ad-hoc wireless networking technologies
do represent a principle tool to deploy smart services over decentralized
countrysides. Moreover, the performance evaluation confirms the viability of
utilizing multi-level simulation for simulating large scale IoT environments.
","[{'version': 'v1', 'created': 'Fri, 4 Nov 2016 11:07:53 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Apr 2017 14:04:57 GMT'}]",2017-04-05,"[[""D'Angelo"", 'Gabriele', ''], ['Ferretti', 'Stefano', ''], ['Ghini', 'Vittorio', '']]","['Simulation', 'Smart cities', 'Internet of Things', 'Multi-level Simulation', 'Parallel And Distributed Simulation (PADS)']"
1253,1406.1062,Gabriel Arrobo,"Gabriel E. Arrobo, Calvin A. Perumalla, Stanley B. Hanke, Thomas P.
  Ketterl, Peter J. Fabri, and Richard D. Gitlin",An Innovative Wireless Cardiac Rhythm Management (iCRM) System,,,10.1109/WTS.2014.6835035,,cs.CE cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a wireless Communicator to manage and enhance a
Cardiac Rhythm Management System. The system includes: (1) an on-body wireless
Electrocardiogram (ECG), (2) an Intracardiac Electrogram (EGM) embedded inside
an Implantable Cardioverter/Defibrillator, and (3) a Communicator (with a
resident Learning System). The first two devices are existing technology
available in the market and are emulated using data from the Physionet
database, while the Communicator was designed and implemented by our research
team. The value of the information obtained by combining the information
supplied by (1) and (2), presented to the Communicator, improves decision
making regarding use of the actuator or other actions. Preliminary results show
a high level of confidence in the decisions made by the Communicator. For
example, excellent accuracy is achieved in predicting atrial arrhythmia in 8
patients using only external ECG when we used a neural network.
","[{'version': 'v1', 'created': 'Tue, 3 Jun 2014 19:29:04 GMT'}]",2016-02-18,"[['Arrobo', 'Gabriel E.', ''], ['Perumalla', 'Calvin A.', ''], ['Hanke', 'Stanley B.', ''], ['Ketterl', 'Thomas P.', ''], ['Fabri', 'Peter J.', ''], ['Gitlin', 'Richard D.', '']]","['Wireless', 'Learning systems', 'Bluetooth', 'ZigBee', 'ECG', 'EGM']"
1254,1510.00331,Tadahiro Taniguchi,"Tadahiro Taniguchi, Toshiaki Takano and Ryo Yoshino",Multimodal Hierarchical Dirichlet Process-based Active Perception,submitted,Front. Neurorobot. 12:22. 2018,10.3389/fnbot.2018.00022,,cs.RO cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose an active perception method for recognizing object
categories based on the multimodal hierarchical Dirichlet process (MHDP). The
MHDP enables a robot to form object categories using multimodal information,
e.g., visual, auditory, and haptic information, which can be observed by
performing actions on an object. However, performing many actions on a target
object requires a long time. In a real-time scenario, i.e., when the time is
limited, the robot has to determine the set of actions that is most effective
for recognizing a target object. We propose an MHDP-based active perception
method that uses the information gain (IG) maximization criterion and lazy
greedy algorithm. We show that the IG maximization criterion is optimal in the
sense that the criterion is equivalent to a minimization of the expected
Kullback--Leibler divergence between a final recognition state and the
recognition state after the next set of actions. However, a straightforward
calculation of IG is practically impossible. Therefore, we derive an efficient
Monte Carlo approximation method for IG by making use of a property of the
MHDP. We also show that the IG has submodular and non-decreasing properties as
a set function because of the structure of the graphical model of the MHDP.
Therefore, the IG maximization problem is reduced to a submodular maximization
problem. This means that greedy and lazy greedy algorithms are effective and
have a theoretical justification for their performance. We conducted an
experiment using an upper-torso humanoid robot and a second one using synthetic
data. The experimental results show that the method enables the robot to select
a set of actions that allow it to recognize target objects quickly and
accurately. The results support our theoretical outcomes.
","[{'version': 'v1', 'created': 'Thu, 1 Oct 2015 17:36:42 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jan 2016 15:45:44 GMT'}, {'version': 'v3', 'created': 'Thu, 14 Jan 2016 17:13:57 GMT'}]",2023-01-18,"[['Taniguchi', 'Tadahiro', ''], ['Takano', 'Toshiaki', ''], ['Yoshino', 'Ryo', '']]","['Active Perception', 'Cognitive Robotics', 'Topic model', 'Multimodal Machine Learning', 'Submodular Maximization']"
1255,1806.09074,Yukai Wang,"Yukai Wang, Qizhi Teng, Xiaohai He, Junxi Feng, Tingrong Zhang",CT-image Super Resolution Using 3D Convolutional Neural Network,,,10.1016/j.cageo.2019.104314,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computed Tomography (CT) imaging technique is widely used in geological
exploration, medical diagnosis and other fields. In practice, however, the
resolution of CT image is usually limited by scanning devices and great
expense. Super resolution (SR) methods based on deep learning have achieved
surprising performance in two-dimensional (2D) images. Unfortunately, there are
few effective SR algorithms for three-dimensional (3D) images. In this paper,
we proposed a novel network named as three-dimensional super resolution
convolutional neural network (3DSRCNN) to realize voxel super resolution for CT
images. To solve the practical problems in training process such as slow
convergence of network training, insufficient memory, etc., we utilized
adjustable learning rate, residual-learning, gradient clipping, momentum
stochastic gradient descent (SGD) strategies to optimize training procedure. In
addition, we have explored the empirical guidelines to set appropriate number
of layers of network and how to use residual learning strategy. Additionally,
previous learning-based algorithms need to separately train for different scale
factors for reconstruction, yet our single model can complete the multi-scale
SR. At last, our method has better performance in terms of PSNR, SSIM and
efficiency compared with conventional methods.
","[{'version': 'v1', 'created': 'Sun, 24 Jun 2018 03:22:33 GMT'}]",2020-01-29,"[['Wang', 'Yukai', ''], ['Teng', 'Qizhi', ''], ['He', 'Xiaohai', ''], ['Feng', 'Junxi', ''], ['Zhang', 'Tingrong', '']]","['super-resolution', '3D images processing', '3D-CNN', 'residual learning']"
1256,1511.02407,Sohini Roychowdhury,Sohini Roychowdhury and Michelle Emmons,"A Survey of the Trends in Facial and Expression Recognition Databases
  and Methods","16 pages, 4 figures, 3 tables, International Journal of Computer
  Science and Engineering Survey, October, 2015","International Journal of Computer Science & Engineering Survey,
  2015, 6, 1-19",10.5121/ijcses.2015.6501,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated facial identification and facial expression recognition have been
topics of active research over the past few decades. Facial and expression
recognition find applications in human-computer interfaces, subject tracking,
real-time security surveillance systems and social networking. Several holistic
and geometric methods have been developed to identify faces and expressions
using public and local facial image databases. In this work we present the
evolution in facial image data sets and the methodologies for facial
identification and recognition of expressions such as anger, sadness,
happiness, disgust, fear and surprise. We observe that most of the earlier
methods for facial and expression recognition aimed at improving the
recognition rates for facial feature-based methods using static images.
However, the recent methodologies have shifted focus towards robust
implementation of facial/expression recognition from large image databases that
vary with space (gathered from the internet) and time (video recordings). The
evolution trends in databases and methodologies for facial and expression
recognition can be useful for assessing the next-generation topics that may
have applications in security systems or personal identification systems that
involve ""Quantitative face"" assessments.
","[{'version': 'v1', 'created': 'Sat, 7 Nov 2015 22:05:12 GMT'}, {'version': 'v2', 'created': 'Sat, 5 Dec 2015 14:01:38 GMT'}]",2016-10-25,"[['Roychowdhury', 'Sohini', ''], ['Emmons', 'Michelle', '']]","['Facial recognition', 'expression recognition', 'geometric methods', 'databases']"
1257,2206.00322,Markus Dahlmanns,"Markus Dahlmanns, Johannes Lohm\""oller, Jan Pennekamp, J\""orn
  Bodenhausen, Klaus Wehrle, Martin Henze","Missed Opportunities: Measuring the Untapped TLS Support in the
  Industrial Internet of Things","15 pages, 6 figures","In Proceedings of the 2022 ACM Asia Conference on Computer and
  Communications Security (ASIA CCS '22), Association for Computing Machinery,
  New York, NY, USA, pages 252-266",10.1145/3488932.3497762,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ongoing trend to move industrial appliances from previously isolated
networks to the Internet requires fundamental changes in security to uphold
secure and safe operation. Consequently, to ensure end-to-end secure
communication and authentication, (i) traditional industrial protocols, e.g.,
Modbus, are retrofitted with TLS support, and (ii) modern protocols, e.g.,
MQTT, are directly designed to use TLS. To understand whether these changes
indeed lead to secure Industrial Internet of Things deployments, i.e., using
TLS-based protocols, which are configured according to security best practices,
we perform an Internet-wide security assessment of ten industrial protocols
covering the complete IPv4 address space.
  Our results show that both, retrofitted existing protocols and newly
developed secure alternatives, are barely noticeable in the wild. While we find
that new protocols have a higher TLS adoption rate than traditional protocols
(7.2% vs. 0.4%), the overall adoption of TLS is comparably low (6.5% of hosts).
Thus, most industrial deployments (934,736 hosts) are insecurely connected to
the Internet. Furthermore, we identify that 42% of hosts with TLS support
(26,665 hosts) show security deficits, e.g., missing access control. Finally,
we show that support in configuring systems securely, e.g., via configuration
templates, is promising to strengthen security.
","[{'version': 'v1', 'created': 'Wed, 1 Jun 2022 08:38:28 GMT'}]",2022-06-02,"[['Dahlmanns', 'Markus', ''], ['Lohmöller', 'Johannes', ''], ['Pennekamp', 'Jan', ''], ['Bodenhausen', 'Jörn', ''], ['Wehrle', 'Klaus', ''], ['Henze', 'Martin', '']]","['industrial communication', 'network security', 'security configuration']"
1258,2105.11521,Adil Rasheed Professor,"Sindre Stenen Blakseth and Adil Rasheed and Trond Kvamsdal and Omer
  San","Deep neural network enabled corrective source term approach to hybrid
  analysis and modeling",,,10.1016/j.neunet.2021.11.021,,cs.NE cs.LG physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we introduce, justify and demonstrate the Corrective Source
Term Approach (CoSTA) -- a novel approach to Hybrid Analysis and Modeling
(HAM). The objective of HAM is to combine physics-based modeling (PBM) and
data-driven modeling (DDM) to create generalizable, trustworthy, accurate,
computationally efficient and self-evolving models. CoSTA achieves this
objective by augmenting the governing equation of a PBM model with a corrective
source term generated using a deep neural network. In a series of numerical
experiments on one-dimensional heat diffusion, CoSTA is found to outperform
comparable DDM and PBM models in terms of accuracy -- often reducing predictive
errors by several orders of magnitude -- while also generalizing better than
pure DDM. Due to its flexible but solid theoretical foundation, CoSTA provides
a modular framework for leveraging novel developments within both PBM and DDM.
Its theoretical foundation also ensures that CoSTA can be used to model any
system governed by (deterministic) partial differential equations. Moreover,
CoSTA facilitates interpretation of the DNN-generated source term within the
context of PBM, which results in improved explainability of the DNN. These
factors make CoSTA a potential door-opener for data-driven techniques to enter
high-stakes applications previously reserved for pure PBM.
","[{'version': 'v1', 'created': 'Mon, 24 May 2021 20:17:13 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Nov 2021 21:44:26 GMT'}]",2021-12-02,"[['Blakseth', 'Sindre Stenen', ''], ['Rasheed', 'Adil', ''], ['Kvamsdal', 'Trond', ''], ['San', 'Omer', '']]","['Deep neural networks', 'Digital twins', 'Explainable AI', 'Hybrid analysis and modeling', 'Physics-based']"
1259,1611.04976,Stefan Wagner,Daniel M\'endez Fern\'andez and Stefan Wagner,"Naming the Pain in Requirements Engineering: Design of a Global Family
  of Surveys and First Results from Germany","11 pages, 1 figure","Proc. 17th International Conference on Evaluation and Assessment
  in Software Engineering (EASE'13). ACM, 2013",10.1145/2460999.2461027,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: For many years, we have observed industry struggling in defining a
high quality requirements engineering (RE) and researchers trying to understand
industrial expectations and problems. Although we are investigating the
discipline with a plethora of empirical studies, those studies either
concentrate on validating specific methods or on single companies or countries.
Therefore, they allow only for limited empirical generalisations. Objective: To
lay an empirical and generalisable foundation about the state of the practice
in RE, we aim at a series of open and reproducible surveys that allow us to
steer future research in a problem-driven manner. Method: We designed a
globally distributed family of surveys in joint collaborations with different
researchers from different countries. The instrument is based on an initial
theory inferred from available studies. As a long-term goal, the survey will be
regularly replicated to manifest a clear understanding on the status quo and
practical needs in RE. In this paper, we present the design of the family of
surveys and first results of its start in Germany. Results: Our first results
contain responses from 30 German companies. The results are not yet
generalisable, but already indicate several trends and problems. For instance,
a commonly stated problem respondents see in their company standards are
artefacts being underrepresented, and important problems they experience in
their projects are incomplete and inconsistent requirements. Conclusion: The
results suggest that the survey design and instrument are well-suited to be
replicated and, thereby, to create a generalisable empirical basis of RE in
practice.
","[{'version': 'v1', 'created': 'Tue, 15 Nov 2016 18:32:46 GMT'}]",2016-11-16,"[['Fernández', 'Daniel Méndez', ''], ['Wagner', 'Stefan', '']]","['Survey Research', 'Requirements Engineering', 'Family of Studies']"
1260,2102.04686,Abdur Rahim Mohammad Forkan,"Abdur Rahim Mohammad Forkan, Yong-Bin Kang, Prem Prakash Jayaraman,
  Kewen Liao, Rohit Kaul, Graham Morgan, Rajiv Ranjan, Samir Sinha","CorrDetector: A Framework for Structural Corrosion Detection from Drone
  Images using Ensemble Deep Learning",,,10.1016/j.eswa.2021.116461,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a new technique that applies automated image
analysis in the area of structural corrosion monitoring and demonstrate
improved efficacy compared to existing approaches. Structural corrosion
monitoring is the initial step of the risk-based maintenance philosophy and
depends on an engineer's assessment regarding the risk of building failure
balanced against the fiscal cost of maintenance. This introduces the
opportunity for human error which is further complicated when restricted to
assessment using drone captured images for those areas not reachable by humans
due to many background noises. The importance of this problem has promoted an
active research community aiming to support the engineer through the use of
artificial intelligence (AI) image analysis for corrosion detection. In this
paper, we advance this area of research with the development of a framework,
CorrDetector. CorrDetector uses a novel ensemble deep learning approach
underpinned by convolutional neural networks (CNNs) for structural
identification and corrosion feature extraction. We provide an empirical
evaluation using real-world images of a complicated structure (e.g.
telecommunication tower) captured by drones, a typical scenario for engineers.
Our study demonstrates that the ensemble approach of \model significantly
outperforms the state-of-the-art in terms of classification accuracy.
","[{'version': 'v1', 'created': 'Tue, 9 Feb 2021 07:27:16 GMT'}]",2022-01-12,"[['Forkan', 'Abdur Rahim Mohammad', ''], ['Kang', 'Yong-Bin', ''], ['Jayaraman', 'Prem Prakash', ''], ['Liao', 'Kewen', ''], ['Kaul', 'Rohit', ''], ['Morgan', 'Graham', ''], ['Ranjan', 'Rajiv', ''], ['Sinha', 'Samir', '']]","['Corrosion detection', 'Object detection', 'Deep Learning', 'DroneImages', 'Industrial structure', 'Ensemble model', 'CNN']"
1261,1601.07207,Renato J Cintra,"T. Cooklev, H. Dogan, R. J. Cintra, H. Yildiz","A Generalized Prefix Construction for OFDM Systems Over Quasi-Static
  Channels",19 pages,"IEEE Transactions on Vehicular Technology, vol. 60, no. 8,
  3684-3693, 2011",10.1109/TVT.2011.2165741,,cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  All practical OFDM systems require a prefix to eliminate inter-symbol
interference at the receiver. Cyclic prefix (CP) and zero-padding are
well-known prefix construction methods, the former being the most employed
technique in practice due to its lower complexity. In this paper we construct
an OFDM system with a generalized CP. It is shown that the proposed generalized
prefix effectively makes the channel experienced by the packet different from
the actual channel. Using an optimization procedure, lower bit error rates can
be achieved, outperforming other prefix construction techniques. At the same
time the complexity of the technique is comparable to the CP method. The
presented simulation results show that the proposed technique not only
outperforms the CP method, but is also more robust in the presence of channel
estimation errors and mobility. The proposed method is appropriate for
practical OFDM systems.
","[{'version': 'v1', 'created': 'Tue, 26 Jan 2016 21:59:32 GMT'}]",2016-01-28,"[['Cooklev', 'T.', ''], ['Dogan', 'H.', ''], ['Cintra', 'R. J.', ''], ['Yildiz', 'H.', '']]","['Generalized prefix', 'generalized skew-circular convolution', 'orthogonal frequency-division multiplexing (OFDM)', 'deep fading channels']"
1262,1611.08834,Daniel M\'endez Fern\'andez,"D. M\'endez Fern\'andez, S. Wagner",Case Studies in Industry: What We Have Learnt,"Proceedings of the 4th International Workshop on Conducting Empirical
  Studies in Industry, co-located with ICSE, 2016",,10.1145/2896839.2896844,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Case study research has become an important research methodology for
exploring phenomena in their natural contexts. Case studies have earned a
distinct role in the empirical analysis of software engineering phenomena which
are difficult to capture in isolation. Such phenomena often appear in the
context of methods and development processes for which it is difficult to run
large, controlled experiments as they usually have to reduce the scale in
several respects and, hence, are detached from the reality of industrial
software development. The other side of the medal is that the realistic
socio-economic environments where we conduct case studies -- with real-life
cases and realistic conditions -- also pose a plethora of practical challenges
to planning and conducting case studies. In this experience report, we discuss
such practical challenges and the lessons we learnt in conducting case studies
in industry. Our goal is to help especially inexperienced researchers facing
their first case studies in industry by increasing their awareness for typical
obstacles they might face and practical ways to deal with those obstacles.
","[{'version': 'v1', 'created': 'Sun, 27 Nov 2016 12:46:13 GMT'}]",2016-11-29,"[['Fernández', 'D. Méndez', ''], ['Wagner', 'S.', '']]","['Case Study Research', 'Experience Report', 'Lessons Learnt']"
1263,1406.5569,Ashkan Rahimian,"Ashkan Rahimian, Raha Ziarati, Stere Preda, Mourad Debbabi",On the Reverse Engineering of the Citadel Botnet,"10 pages, 17 figures. This is an updated / edited version of a paper
  appeared in FPS 2013","LNCS 8352, 2014, pp 408-425",10.1007/978-3-319-05302-8_25,,cs.CR cs.NI cs.OS cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Citadel is an advanced information-stealing malware which targets financial
information. This malware poses a real threat against the confidentiality and
integrity of personal and business data. A joint operation was recently
conducted by the FBI and the Microsoft Digital Crimes Unit in order to take
down Citadel command-and-control servers. The operation caused some disruption
in the botnet but has not stopped it completely. Due to the complex structure
and advanced anti-reverse engineering techniques, the Citadel malware analysis
process is both challenging and time-consuming. This allows cyber criminals to
carry on with their attacks while the analysis is still in progress. In this
paper, we present the results of the Citadel reverse engineering and provide
additional insight into the functionality, inner workings, and open source
components of the malware. In order to accelerate the reverse engineering
process, we propose a clone-based analysis methodology. Citadel is an offspring
of a previously analyzed malware called Zeus; thus, using the former as a
reference, we can measure and quantify the similarities and differences of the
new variant. Two types of code analysis techniques are provided in the
methodology, namely assembly to source code matching and binary clone
detection. The methodology can help reduce the number of functions requiring
manual analysis. The analysis results prove that the approach is promising in
Citadel malware analysis. Furthermore, the same approach is applicable to
similar malware analysis scenarios.
","[{'version': 'v1', 'created': 'Sat, 21 Jun 2014 02:04:56 GMT'}]",2014-06-24,"[['Rahimian', 'Ashkan', ''], ['Ziarati', 'Raha', ''], ['Preda', 'Stere', ''], ['Debbabi', 'Mourad', '']]","['Reverse Engineering', 'Malware Analysis', 'Clone Detection', 'Botnet Takedown', 'Incident Response', 'Zeus Botnet Variant', 'Static Analysis', 'Dynamic Analysis']"
1264,1304.3138,Fran\c{c}ois-Michel De Rainville,"Fran\c{c}ois-Michel De Rainville, Mich\`ele Sebag, Christian Gagn\'e,
  Marc Schoenauer, Denis Laurendeau",Sustainable Cooperative Coevolution with a Multi-Armed Bandit,Accepted at GECCO 2013,,10.1145/2463372.2463556,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a self-adaptation mechanism to manage the resources
allocated to the different species comprising a cooperative coevolutionary
algorithm. The proposed approach relies on a dynamic extension to the
well-known multi-armed bandit framework. At each iteration, the dynamic
multi-armed bandit makes a decision on which species to evolve for a
generation, using the history of progress made by the different species to
guide the decisions. We show experimentally, on a benchmark and a real-world
problem, that evolving the different populations at different paces allows not
only to identify solutions more rapidly, but also improves the capacity of
cooperative coevolution to solve more complex problems.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2013 20:24:31 GMT'}]",2013-07-30,"[['De Rainville', 'François-Michel', ''], ['Sebag', 'Michèle', ''], ['Gagné', 'Christian', ''], ['Schoenauer', 'Marc', ''], ['Laurendeau', 'Denis', '']]","['Cooperative Coevolution', 'Multi-Armed Bandit', 'Credit Assignment', 'Adaptivity']"
1265,1809.10522,Narendra Nath Joshi,"Mary Arpita Pyreddy, Varshini Ramaseshan, Narendra Nath Joshi, Zhuyun
  Dai, Chenyan Xiong, Jamie Callan, Zhiyuan Liu",Consistency and Variation in Kernel Neural Ranking Model,"4 pages, 4 figures, 2 tables","Mary Arpita Pyreddy et al. 2018. Consistency and Variation in
  Kernel Neural Ranking Model. In The 41st International ACM SIGIR Conference
  on Research & Development in Information Retrieval (SIGIR '18). ACM, New
  York, NY, USA, 961-964",10.1145/3209978.3210107,,cs.IR cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies the consistency of the kernel-based neural ranking model
K-NRM, a recent state-of-the-art neural IR model, which is important for
reproducible research and deployment in the industry. We find that K-NRM has
low variance on relevance-based metrics across experimental trials. In spite of
this low variance in overall performance, different trials produce different
document rankings for individual queries. The main source of variance in our
experiments was found to be different latent matching patterns captured by
K-NRM. In the IR-customized word embeddings learned by K-NRM, the
query-document word pairs follow two different matching patterns that are
equally effective, but align word pairs differently in the embedding space. The
different latent matching patterns enable a simple yet effective approach to
construct ensemble rankers, which improve K-NRM's effectiveness and
generalization abilities.
","[{'version': 'v1', 'created': 'Thu, 27 Sep 2018 14:01:19 GMT'}]",2018-09-28,"[['Pyreddy', 'Mary Arpita', ''], ['Ramaseshan', 'Varshini', ''], ['Joshi', 'Narendra Nath', ''], ['Dai', 'Zhuyun', ''], ['Xiong', 'Chenyan', ''], ['Callan', 'Jamie', ''], ['Liu', 'Zhiyuan', '']]","['Neural-IR', 'Retrieval Model Stability', 'Ensemble-Rankers']"
1266,1510.08881,Mike Thelwall,"Mike Thelwall, Paul Wilson",Distributions for cited articles from individual subjects and years,,"Journal of Informetrics, 8(4), 824-839 (2014)",10.1016/j.joi.2014.08.001,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The citations to a set of academic articles are typically unevenly shared,
with many articles attracting few citations and few attracting many. It is
important to know more precisely how citations are distributed in order to help
statistical analyses of citations, especially for sets of articles from a
single discipline and a small range of years, as normally used for research
evaluation. This article fits discrete versions of the power law, the lognormal
distribution and the hooked power law to 20 different Scopus categories, using
citations to articles published in 2004 and ignoring uncited articles. The
results show that, despite its popularity, the power law is not a suitable
model for collections of articles from a single subject and year, even for the
purpose of estimating the slope of the tail of the citation data. Both the
hooked power law and the lognormal distributions fit best for some subjects but
neither is a universal optimal choice and parameter estimates for both seem to
be unreliable. Hence only the hooked power law and discrete lognormal
distributions should be considered for subject-and-year-based citation analysis
in future and parameter estimates should always be interpreted cautiously.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2015 20:20:48 GMT'}]",2015-11-02,"[['Thelwall', 'Mike', ''], ['Wilson', 'Paul', '']]","['citation distribution', 'power law', 'hooked power law', 'lognormal distribution', 'citation analysis']"
1267,1305.1840,Ward Jaradat,"Ward Jaradat, Alan Dearle and Adam Barker","A Dataflow Language for Decentralised Orchestration of Web Service
  Workflows","To appear in Proceedings of the IEEE 2013 7th International Workshop
  on Scientific Workflows, in conjunction with IEEE SERVICES 2013",,10.1109/SERVICES.2013.30,,cs.DC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Orchestrating centralised service-oriented workflows presents significant
scalability challenges that include: the consumption of network bandwidth,
degradation of performance, and single points of failure. This paper presents a
high-level dataflow specification language that attempts to address these
scalability challenges. This language provides simple abstractions for
orchestrating large-scale web service workflows, and separates between the
workflow logic and its execution. It is based on a data-driven model that
permits parallelism to improve the workflow performance. We provide a
decentralised architecture that allows the computation logic to be moved
""closer"" to services involved in the workflow. This is achieved through
partitioning the workflow specification into smaller fragments that may be sent
to remote orchestration services for execution. The orchestration services rely
on proxies that exploit connectivity to services in the workflow. These proxies
perform service invocations and compositions on behalf of the orchestration
services, and carry out data collection, retrieval, and mediation tasks. The
evaluation of our architecture implementation concludes that our decentralised
approach reduces the execution time of workflows, and scales accordingly with
the increasing size of data sets.
","[{'version': 'v1', 'created': 'Wed, 8 May 2013 14:59:20 GMT'}]",2013-11-11,"[['Jaradat', 'Ward', ''], ['Dearle', 'Alan', ''], ['Barker', 'Adam', '']]","['Web Service Workflows', 'Dataflow SpecificationLanguage', 'Decentralised Orchestration Architecture']"
1268,1604.02475,Junan Zhu,"Junan Zhu, Dror Baron, Florent Krzakala",Performance Limits for Noisy Multi-Measurement Vector Problems,"11 pages, 6 figures","IEEE Transactions on Signal Processing, Volume: 65, Issue: 9
  Pages: 2444 - 2454 (2017)",10.1109/TSP.2016.2646663,,cs.IT cs.DC math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Compressed sensing (CS) demonstrates that sparse signals can be estimated
from under-determined linear systems. Distributed CS (DCS) further reduces the
number of measurements by considering joint sparsity within signal ensembles.
DCS with jointly sparse signals has applications in multi-sensor acoustic
sensing, magnetic resonance imaging with multiple coils, remote sensing, and
array signal processing. Multi-measurement vector (MMV) problems consider the
estimation of jointly sparse signals under the DCS framework. Two related MMV
settings are studied. In the first setting, each signal vector is measured by a
different independent and identically distributed (i.i.d.) measurement matrix,
while in the second setting, all signal vectors are measured by the same i.i.d.
matrix. Replica analysis is performed for these two MMV settings, and the
minimum mean squared error (MMSE), which turns out to be identical for both
settings, is obtained as a function of the noise variance and number of
measurements. To showcase the application of MMV models, the MMSE's of complex
CS problems with both real and complex measurement matrices are also analyzed.
Multiple performance regions for MMV are identified where the MMSE behaves
differently as a function of the noise variance and the number of measurements.
  Belief propagation (BP) is a CS signal estimation framework that often
achieves the MMSE asymptotically. A phase transition for BP is identified. This
phase transition, verified by numerical results, separates the regions where BP
achieves the MMSE and where it is suboptimal. Numerical results also illustrate
that more signal vectors in the jointly sparse signal ensemble lead to a better
phase transition.
","[{'version': 'v1', 'created': 'Fri, 8 Apr 2016 20:30:51 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Aug 2016 02:17:59 GMT'}]",2017-03-24,"[['Zhu', 'Junan', ''], ['Baron', 'Dror', ''], ['Krzakala', 'Florent', '']]","['Approximatemessagepassing', 'multimeasurement vector problem', 'replica analysis']"
1269,1610.07038,Victor Magron,Alexandre Rocca and Victor Magron and Thao Dang,"Certified Roundoff Error Bounds using Bernstein Expansions and Sparse
  Krivine-Stengle Representations","20 pages, 2 tables",,10.1109/ARITH.2017.36,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Floating point error is an inevitable drawback of embedded systems
implementation. Computing rigorous upper bounds of roundoff errors is
absolutely necessary to the validation of critical software. This problem is
even more challenging when addressing non-linear programs. In this paper, we
propose and compare two new methods based on Bernstein expansions and sparse
Krivine-Stengle representations, adapted from the field of the global
optimization to compute upper bounds of roundoff errors for programs
implementing polynomial functions. We release two related software package
FPBern and FPKiSten, and compare them with state of the art tools. We show that
these two methods achieve competitive performance, while computing accurate
upper bounds by comparison with other tools.
","[{'version': 'v1', 'created': 'Sat, 22 Oct 2016 12:04:12 GMT'}, {'version': 'v2', 'created': 'Mon, 9 Jan 2017 14:09:48 GMT'}]",2018-02-12,"[['Rocca', 'Alexandre', ''], ['Magron', 'Victor', ''], ['Dang', 'Thao', '']]","['PolynomialOptimization', 'FloatingPointArithmetic', 'Roundoff Error Bounds', 'Linear Programming Relaxations', 'Bernstein Expansions', 'Krivine-Stengle Representations']"
1270,1610.05716,Richard Preen,"Richard J. Preen, Jiseon You, Larry Bull, and Ioannis A. Ieropoulos",Design Mining Microbial Fuel Cell Cascades,,"Soft Computing (2019), 23(13):4673-4683",10.1007/s00500-018-3117-x,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Microbial fuel cells (MFCs) perform wastewater treatment and electricity
production through the conversion of organic matter using microorganisms. For
practical applications, it has been suggested that greater efficiency can be
achieved by arranging multiple MFC units into physical stacks in a cascade with
feedstock flowing sequentially between units. In this paper, we investigate the
use of computational intelligence to physically explore and optimise
(potentially) heterogeneous MFC designs in a cascade, i.e. without simulation.
Conductive structures are 3-D printed and inserted into the anodic chamber of
each MFC unit, augmenting a carbon fibre veil anode and affecting the
hydrodynamics, including the feedstock volume and hydraulic retention time, as
well as providing unique habitats for microbial colonisation. We show that it
is possible to use design mining to identify new conductive inserts that
increase both the cascade power output and power density.
","[{'version': 'v1', 'created': 'Tue, 18 Oct 2016 17:36:26 GMT'}, {'version': 'v2', 'created': 'Tue, 31 Jan 2017 17:10:00 GMT'}]",2022-12-05,"[['Preen', 'Richard J.', ''], ['You', 'Jiseon', ''], ['Bull', 'Larry', ''], ['Ieropoulos', 'Ioannis A.', '']]","['3D printing', 'Cascade stacks', 'Coevolution', 'Microbial fuel cell', 'Shape optimisation']"
1271,1109.0098,Michael Gall,"Michael Gall, Thomas Grechenig and Mogens Bjerre",Assessing the Feasibility of Developing a Federated ERP System,,"International Journal of Managing Information Technology (IJMIT)
  Vol.3, No.3, August 2011, 16-26",10.5121/ijmit.2011.3302,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In past years ERP Systems have become one of the main components within the
corporate IT structure. Several problems exist around implementing and
operating these systems within companies. In the literature one can find
several studies about the problems arising during the implementation of an ERP
system. The main problem areas are around the complexity of ERP systems. One
vision to overcome some of these problems is federated ERP. Federated ERP
systems are built of components from different vendors, which are distributed
within a network. All components act as one single ERP system from the user
perspective. The decreased complexity of such a system would require lower
installation and maintenance cost. Additional, only the components which are
needed to cover the company's business processes would be used. Several
theories around this concept exist, but a feasibility assessment of developing
a federated ERP system has not been done yet. Based on a literary analysis of
existing methods for feasibility studies, this paper is applying strategic
planning concepts and referential data from the traditional ERP development to
provide a first assessment of the overall feasibility of developing a platform
for federated ERP systems. An analytical hierarchical approach is used to
define effort and effect related criteria and their domain values. The
assessment as the criteria is done in comparison to the development of a
classical ERP system. Using the developed criteria, a net present value
calculation is done. The calculation of the net present value is done on an
overall, not company specific level. In order to estimate the weighted average
cost of capital, the values from successful software companies are used as a
baseline. Additional potential risks and obstacles are identified for further
clarification.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2011 06:08:56 GMT'}]",2011-09-02,"[['Gall', 'Michael', ''], ['Grechenig', 'Thomas', ''], ['Bjerre', 'Mogens', '']]","['ERP', 'Federated ERP', 'Feasibility', 'SME', 'Effort', 'Effect']"
1272,1304.6656,Francesco Flammini,"Francesco Flammini, Stefano Marrone, Nicola Mazzocca, Valeria
  Vittorini","A new modeling approach to the safety evaluation of N-modular redundant
  computer systems in presence of imperfect maintenance",,,10.1016/j.ress.2009.02.014,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A large number of safety-critical control systems are based on N-modular
redundant architectures, using majority voters on the outputs of independent
computation units. In order to assess the compliance of these architectures
with international safety standards, the frequency of hazardous failures must
be analyzed by developing and solving proper formal models. Furthermore, the
impact of maintenance faults has to be considered, since imperfect maintenance
may degrade the safety integrity level of the system. In this paper we present
both a failure model for voting architectures based on Bayesian Networks and a
maintenance model based on Continuous Time Markov Chains, and we propose to
combine them according to a compositional multiformalism modeling approach in
order to analyze the impact of imperfect maintenance on the system safety. We
also show how the proposed approach promotes the reuse and the interchange of
models as well the interchange of solving tools.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2013 13:00:15 GMT'}]",2013-04-25,"[['Flammini', 'Francesco', ''], ['Marrone', 'Stefano', ''], ['Mazzocca', 'Nicola', ''], ['Vittorini', 'Valeria', '']]","['Safety', 'N-Modular Redundancy', 'Bayesian Networks', 'Imperfect Maintenance', 'Multiformalism Modeling']"
1273,1609.02079,Abhinav Parihar,"Abhinav Parihar, Nikhil Shukla, Matthew Jerry, Suman Datta, Arijit
  Raychowdhury","Vertex coloring of graphs via phase dynamics of coupled oscillatory
  networks",,Scientific Reports 7 (2017) 911,10.1038/s41598-017-00825-1,,cs.ET cond-mat.other math.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While Boolean logic has been the backbone of digital information processing,
there are classes of computationally hard problems wherein this conventional
paradigm is fundamentally inefficient. Vertex coloring of graphs, belonging to
the class of combinatorial optimization represents such a problem; and is well
studied for its wide spectrum of applications in data sciences, life sciences,
social sciences and engineering and technology. This motivates alternate, and
more efficient non-Boolean pathways to their solution. Here, we demonstrate a
coupled relaxation oscillator based dynamical system that exploits the
insulator-metal transition in vanadium dioxide (VO2), to efficiently solve the
vertex coloring of graphs. By harnessing the natural analogue between
optimization, pertinent to graph coloring solutions, and energy minimization
processes in highly parallel, interconnected dynamical systems, we harness the
physical manifestation of the latter process to approximate the optimal
coloring of k-partite graphs. We further indicate a fundamental connection
between the eigen properties of a linear dynamical system and the spectral
algorithms that can solve approximate graph coloring. Our work not only
elucidates a physics-based computing approach but also presents tantalizing
opportunities for building customized analog co-processors for solving hard
problems efficiently.
","[{'version': 'v1', 'created': 'Wed, 7 Sep 2016 17:16:50 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Mar 2017 02:10:05 GMT'}]",2017-04-21,"[['Parihar', 'Abhinav', ''], ['Shukla', 'Nikhil', ''], ['Jerry', 'Matthew', ''], ['Datta', 'Suman', ''], ['Raychowdhury', 'Arijit', '']]","['Coupled Oscillators', 'Vertex Coloring of graphs', 'Dynamical Systems', 'Non-Boolean']"
1274,2102.02938,Stephen MacDonell,Stephen G. MacDonell,"The Impact of Sampling and Rule Set Size on Generated Fuzzy Inference
  System Predictive Accuracy: Analysis of a Software Engineering Data Set","Conference paper, 7 pages, 5 tables, 7 figures","Proceedings of the 12th Engineering Applications of Neural
  Networks (EANN)/7th Artificial Intelligence Applications and Innovations
  (AIAI) Joint Conferences (EANN-AIAI2011)",10.1007/978-3-642-23960-1_43,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software project management makes extensive use of predictive modeling to
estimate product size, defect proneness and development effort. Although
uncertainty is acknowledged in these tasks, fuzzy inference systems, designed
to cope well with uncertainty, have received only limited attention in the
software engineering domain. In this study we empirically investigate the
impact of two choices on the predictive accuracy of generated fuzzy inference
systems when applied to a software engineering data set: sampling of
observations for training and testing; and the size of the rule set generated
using fuzzy c-means clustering. Over ten samples we found no consistent pattern
of predictive performance given certain rule set size. We did find, however,
that a rule set compiled from multiple samples generally resulted in more
accurate predictions than single sample rule sets. More generally, the results
provide further evidence of the sensitivity of empirical analysis outcomes to
specific model-building decisions.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2021 00:42:52 GMT'}]",2021-02-08,"[['MacDonell', 'Stephen G.', '']]","['fuzzy inference', 'prediction', 'software size', 'source code', 'sampling', 'sensitivity analysis  1']"
1275,1803.02729,Shangbin Wu,"Shangbin Wu, Yue Wang, Mohammed Al-Imari and Maziar Nekovee",Frequency and Quadrature Amplitude Modulation for 5G Networks,,,10.1109/EuCNC.2016.7560993,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The emerging fifth generation (5G) wireless access network, aiming at
providing ubiquitous and high data rate connectivity, is envisaged to deploy
large number of base stations with higher density and smaller sizes, where
inter-cell interference (ICI) becomes a critical problem. Frequency quadrature
amplitude modulation (FQAM) has been shown to reduce the ICI at the cell edge
therefore achieve a higher transmission rate for cell edge users. This paper
investigates the detection of FQAM symbols and noise plus ICI in a multi-cell
FQAM communication network. Turbo-coded bit error rate (BER) and frame error
rate (FER) of multi-cell FQAM are studied. Also, the cumulative distribution
function (CDF) of signal to noise plus interference (SINR) of multi-cell FQAM
is computed using stochastic geometry. It is demonstrated via simulations FQAM
outperforms quadrature amplitude modulation (QAM) in BER and FER when ICI is
significant. Furthermore, FQAM can achieve better SINR than QAM.
","[{'version': 'v1', 'created': 'Wed, 7 Mar 2018 15:52:43 GMT'}]",2018-03-08,"[['Wu', 'Shangbin', ''], ['Wang', 'Yue', ''], ['Al-Imari', 'Mohammed', ''], ['Nekovee', 'Maziar', '']]","['FQAM', 'ICI', 'Turbo code', 'stochastic geometry']"
1276,1911.12737,Romain Edelmann,"Romain Edelmann, Jad Hamza, Viktor Kun\v{c}ak",LL(1) Parsing with Derivatives and Zippers,"Appeared at PLDI'20 under the title ""Zippy LL(1) Parsing with
  Derivatives""",,10.1145/3385412.3385992,,cs.FL cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present an efficient, functional, and formally verified
parsing algorithm for LL(1) context-free expressions based on the concept of
derivatives of formal languages. Parsing with derivatives is an elegant parsing
technique, which, in the general case, suffers from cubic worst-case time
complexity and slow performance in practice. We specialise the parsing with
derivatives algorithm to LL(1) context-free expressions, where alternatives can
be chosen given a single token of lookahead. We formalise the notion of LL(1)
expressions and show how to efficiently check the LL(1) property. Next, we
present a novel linear-time parsing with derivatives algorithm for LL(1)
expressions operating on a zipper-inspired data structure. We prove the
algorithm correct in Coq and present an implementation as a parser combinators
framework in Scala, with enumeration and pretty printing capabilities.
","[{'version': 'v1', 'created': 'Thu, 28 Nov 2019 14:57:03 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Jan 2021 12:54:49 GMT'}]",2021-01-22,"[['Edelmann', 'Romain', ''], ['Hamza', 'Jad', ''], ['Kunčak', 'Viktor', '']]","['Parsing', 'LL(1)', 'Derivatives', 'Zipper', 'Formal proof']"
1277,2010.08234,Youngjin Park,"Youngjin Park, Deokjun Eom, Byoungki Seo, Jaesik Choi",Improved Predictive Deep Temporal Neural Networks with Trend Filtering,"8 pages, 4 figures, 3 tables, ICAIF 2020: ACM International
  Conference on AI in Finance",ICAIF 2020: ACM International Conference on AI in Finance,10.1145/3383455.3422565,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Forecasting with multivariate time series, which aims to predict future
values given previous and current several univariate time series data, has been
studied for decades, with one example being ARIMA. Because it is difficult to
measure the extent to which noise is mixed with informative signals within
rapidly fluctuating financial time series data, designing a good predictive
model is not a simple task. Recently, many researchers have become interested
in recurrent neural networks and attention-based neural networks, applying them
in financial forecasting. There have been many attempts to utilize these
methods for the capturing of long-term temporal dependencies and to select more
important features in multivariate time series data in order to make accurate
predictions. In this paper, we propose a new prediction framework based on deep
neural networks and a trend filtering, which converts noisy time series data
into a piecewise linear fashion. We reveal that the predictive performance of
deep temporal neural networks improves when the training data is temporally
processed by a trend filtering. To verify the effect of our framework, three
deep temporal neural networks, state of the art models for predictions in time
series finance data, are used and compared with models that contain trend
filtering as an input feature. Extensive experiments on real-world multivariate
time series data show that the proposed method is effective and significantly
better than existing baseline methods.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2020 08:29:36 GMT'}]",2020-10-19,"[['Park', 'Youngjin', ''], ['Eom', 'Deokjun', ''], ['Seo', 'Byoungki', ''], ['Choi', 'Jaesik', '']]","['Deep Neural Networks', 'Time Series Prediction', 'Trend filtering']"
1278,1307.5591,Subra Mukherjee,"Subra Mukherjee, Karen Das",A Novel Equation based Classifier for Detecting Human in Images,published with international journal of Computer Applications (IJCA),"International Journal of Computer Applications 72(6):9-16, June
  2013",10.5120/12496-7272,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Shape based classification is one of the most challenging tasks in the field
of computer vision. Shapes play a vital role in object recognition. The basic
shapes in an image can occur in varying scale, position and orientation. And
specially when detecting human, the task becomes more challenging owing to the
largely varying size, shape, posture and clothing of human. So, in our work we
detect human, based on the head-shoulder shape as it is the most unvarying part
of human body. Here, firstly a new and a novel equation named as the Omega
Equation that describes the shape of human head-shoulder is developed and based
on this equation, a classifier is designed particularly for detecting human
presence in a scene. The classifier detects human by analyzing some of the
discriminative features of the values of the parameters obtained from the Omega
equation. The proposed method has been tested on a variety of shape dataset
taking into consideration the complexities of human head-shoulder shape. In all
the experiments the proposed method demonstrated satisfactory results.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2013 05:13:03 GMT'}]",2013-07-23,"[['Mukherjee', 'Subra', ''], ['Das', 'Karen', '']]","['Omega Equation', 'Classifier', 'Human Detection', 'Omega Shape', 'Gaussian Mixture Model']"
1279,1212.3536,Valmir Barbosa,"Flavio B. Gonzaga, Valmir C. Barbosa, Geraldo B. Xex\'eo","The network structure of mathematical knowledge according to the
  Wikipedia, MathWorld, and DLMF online libraries",,"Network Science 2 (2014), 367-386",10.1017/nws.2014.20,,cs.SI cs.IR math.HO physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the network structure of Wikipedia (restricted to its mathematical
portion), MathWorld, and DLMF. We approach these three online mathematical
libraries from the perspective of several global and local network-theoretic
features, providing for each one the appropriate value or distribution, along
with comparisons that, if possible, also include the whole of the Wikipedia or
the Web. We identify some distinguishing characteristics of all three
libraries, most of them supposedly traceable to the libraries' shared nature of
relating to a very specialized domain. Among these characteristics are the
presence of a very large strongly connected component in each of the
corresponding directed graphs, the complete absence of any clear power laws
describing the distribution of local features, and the rise to prominence of
some local features (e.g., stress centrality) that can be used to effectively
search for keywords in the libraries.
","[{'version': 'v1', 'created': 'Fri, 14 Dec 2012 17:29:57 GMT'}]",2014-12-16,"[['Gonzaga', 'Flavio B.', ''], ['Barbosa', 'Valmir C.', ''], ['Xexéo', 'Geraldo B.', '']]","['Online mathematical libraries', 'Wikipedia', 'MathWorld', 'DLMF', 'complex networks', 'text search']"
1280,1211.4464,Christiaan Erdbrink,"C. D. Erdbrink, V. V. Krzhizhanovskaya, P. M. A. Sloot","Free-surface flow simulations for discharge-based operation of hydraulic
  structure gates","25 pages, 16 figures","Journal of Hydroinformatics, V. 16, N 1, pp. 189-206, 2014",10.2166/hydro.2013.215,,cs.CE physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We combine non-hydrostatic flow simulations of the free surface with a
discharge model based on elementary gate flow equations for decision support in
operation of hydraulic structure gates. A water level-based gate control used
in most of today's general practice does not take into account the fact that
gate operation scenarios producing similar total discharged volumes and similar
water levels may have different local flow characteristics. Accurate and timely
prediction of local flow conditions around hydraulic gates is important for
several aspects of structure management: ecology, scour, flow-induced gate
vibrations and waterway navigation. The modelling approach is described and
tested for a multi-gate sluice structure regulating discharge from a river to
the sea. The number of opened gates is varied and the discharge is stabilized
with automated control by varying gate openings. The free-surface model was
validated for discharge showing a correlation coefficient of 0.994 compared to
experimental data. Additionally, we show the analysis of CFD results for
evaluating bed stability and gate vibrations.
","[{'version': 'v1', 'created': 'Mon, 19 Nov 2012 15:32:55 GMT'}]",2014-01-31,"[['Erdbrink', 'C. D.', ''], ['Krzhizhanovskaya', 'V. V.', ''], ['Sloot', 'P. M. A.', '']]","['Computational Fluid Dynamics', 'discharge sluice', 'free-surface flow', 'gate control', 'gate operation', 'hydraulic gates', 'hydraulic structures', 'near-field modelling']"
1281,1706.02909,Vindula Jayawardana Mr,"Vindula Jayawardana, Dimuthu Lakmal, Nisansa de Silva, Amal Shehan
  Perera, Keet Sugathadasa, Buddhi Ayesha","Deriving a Representative Vector for Ontology Classes with Instance Word
  Vector Embeddings",,,10.1109/INTECH.2017.8102426,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Selecting a representative vector for a set of vectors is a very common
requirement in many algorithmic tasks. Traditionally, the mean or median vector
is selected. Ontology classes are sets of homogeneous instance objects that can
be converted to a vector space by word vector embeddings. This study proposes a
methodology to derive a representative vector for ontology classes whose
instances were converted to the vector space. We start by deriving five
candidate vectors which are then used to train a machine learning model that
would calculate a representative vector for the class. We show that our
methodology out-performs the traditional mean and median vector
representations.
","[{'version': 'v1', 'created': 'Thu, 8 Jun 2017 03:01:37 GMT'}]",2019-06-07,"[['Jayawardana', 'Vindula', ''], ['Lakmal', 'Dimuthu', ''], ['de Silva', 'Nisansa', ''], ['Perera', 'Amal Shehan', ''], ['Sugathadasa', 'Keet', ''], ['Ayesha', 'Buddhi', '']]","['Ontology', 'Word Embedding', 'Representative Vector', 'Neural Networks', 'word2vec']"
1282,1603.02063,Diego Seco,"Nieves R. Brisaboa, Guillermo De Bernardo, Roberto Konow, Gonzalo
  Navarro, Diego Seco",Aggregated 2D Range Queries on Clustered Points,"This research has received funding from the European Union's Horizon
  2020 research and innovation programme under the Marie Sk{\l}odowska-Curie
  Actions H2020-MSCA-RISE-2015 BIRDS GA No. 690941","Information Systems, Volume 60, Pages 34-49, 2016",10.1016/j.is.2016.03.004,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efficient processing of aggregated range queries on two-dimensional grids is
a common requirement in information retrieval and data mining systems, for
example in Geographic Information Systems and OLAP cubes. We introduce a
technique to represent grids supporting aggregated range queries that requires
little space when the data points in the grid are clustered, which is common in
practice. We show how this general technique can be used to support two
important types of aggregated queries, which are ranked range queries and
counting range queries. Our experimental evaluation shows that this technique
can speed up aggregated queries up to more than an order of magnitude, with a
small space overhead.
","[{'version': 'v1', 'created': 'Mon, 7 Mar 2016 13:45:36 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Mar 2016 20:37:53 GMT'}]",2016-04-01,"[['Brisaboa', 'Nieves R.', ''], ['De Bernardo', 'Guillermo', ''], ['Konow', 'Roberto', ''], ['Navarro', 'Gonzalo', ''], ['Seco', 'Diego', '']]","['Compact Data Structures', 'Grids', 'Query Processing', 'Aggregated queries', 'Clustered Points']"
1283,1112.0032,G\'erald Kembellec,G\'erald Kembellec and Imad Saleh and Catherine Sauvaget,"A model of Cross Language Retrieval for IT domain papers through a map
  of ACM Computing Classification System","7 pages, 3 figures, 1 table",,10.1109/MMCS.2009.5256709,,cs.DL cs.HC cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents a concept model, and the associated tool to help
advanced learners to find adapted bibliography. The purpose is the use of an IT
representation as educational research software for newcomers in research. We
use an ontology based on the ACM's Computing Classification System in order to
find scientific articles directly related to the new researcher's domain
without any formal request. An ontology translation in French is automatically
proposed and can be based on Web 2.0 enhanced by a community of users. A
visualization and navigation model is proposed to make it more accessible and
examples are given to show the interface of our tool: Ontology Navigator.
","[{'version': 'v1', 'created': 'Wed, 30 Nov 2011 21:18:44 GMT'}]",2012-02-07,"[['Kembellec', 'Gérald', ''], ['Saleh', 'Imad', ''], ['Sauvaget', 'Catherine', '']]","['Digital Library', 'Domain Ontology', 'KBS', 'Metadata', 'Cross Language Research', 'Information retrival']"
1284,1705.04108,Mohammed Al-Imari,"Mohammed Al-Imari, Pei Xiao, Muhammad Ali Imran, and Rahim Tafazolli",Uplink Non-Orthogonal Multiple Access for 5G Wireless Networks,"Presented in the International Symposium on Wireless Communications
  Systems (ISWCS), 2014",,10.1109/ISWCS.2014.6933459,,cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Orthogonal Frequency Division Multiple Access (OFDMA) as well as other
orthogonal multiple access techniques fail to achieve the system capacity limit
in the uplink due to the exclusivity in resource allocation. This issue is more
prominent when fairness among the users is considered in the system. Current
Non-Orthogonal Multiple Access (NOMA) techniques introduce redundancy by
coding/spreading to facilitate the users' signals separation at the receiver,
which degrade the system spectral efficiency. Hence, in order to achieve higher
capacity, more efficient NOMA schemes need to be developed. In this paper, we
propose a NOMA scheme for uplink that removes the resource allocation
exclusivity and allows more than one user to share the same subcarrier without
any coding/spreading redundancy. Joint processing is implemented at the
receiver to detect the users' signals. However, to control the receiver
complexity, an upper limit on the number of users per subcarrier needs to be
imposed. In addition, a novel subcarrier and power allocation algorithm is
proposed for the new NOMA scheme that maximizes the users' sum-rate. The
link-level performance evaluation has shown that the proposed scheme achieves
bit error rate close to the single-user case. Numerical results show that the
proposed NOMA scheme can significantly improve the system performance in terms
of spectral efficiency and fairness comparing to OFDMA.
","[{'version': 'v1', 'created': 'Thu, 11 May 2017 10:54:41 GMT'}]",2017-05-12,"[['Al-Imari', 'Mohammed', ''], ['Xiao', 'Pei', ''], ['Imran', 'Muhammad Ali', ''], ['Tafazolli', 'Rahim', '']]","['Non-orthogonal multiple access technique', 'uplink', 'spectral efficiency', 'fairness']"
1285,1804.05445,Alexander Lalejini,Alexander Lalejini and Charles Ofria,Evolving Event-driven Programs with SignalGP,,,10.1145/3205455.3205523,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present SignalGP, a new genetic programming (GP) technique designed to
incorporate the event-driven programming paradigm into computational
evolution's toolbox. Event-driven programming is a software design philosophy
that simplifies the development of reactive programs by automatically
triggering program modules (event-handlers) in response to external events,
such as signals from the environment or messages from other programs. SignalGP
incorporates these concepts by extending existing tag-based referencing
techniques into an event-driven context. Both events and functions are labeled
with evolvable tags; when an event occurs, the function with the closest
matching tag is triggered. In this work, we apply SignalGP in the context of
linear GP. We demonstrate the value of the event-driven paradigm using two
distinct test problems (an environment coordination problem and a distributed
leader election problem) by comparing SignalGP to variants that are otherwise
identical, but must actively use sensors to process events or messages. In each
of these problems, rapid interaction with the environment or other agents is
critical for maximizing fitness. We also discuss ways in which SignalGP can be
generalized beyond our linear GP implementation.
","[{'version': 'v1', 'created': 'Sun, 15 Apr 2018 22:47:41 GMT'}]",2018-04-17,"[['Lalejini', 'Alexander', ''], ['Ofria', 'Charles', '']]","['SignalGP', 'genetic programming', 'event-driven programming', 'eventdriven computation', 'linear genetic programming', 'tags']"
1286,1611.08809,Ren\'e van Bevern,"Ren\'e van Bevern and Robert Bredereck and Morgan Chopin and Sepp
  Hartung and Falk H\""uffner and Andr\'e Nichterlein and Ond\v{r}ej Such\'y",Fixed-Parameter Algorithms for DAG Partitioning,"A preliminary version of this article appeared at CIAC'13. Besides
  providing full proof details, this revised and extended version improves our
  O(2^k * n^2)-time algorithm to run in O(2^k * (n+m)) time and provides
  linear-time executable data reduction rules. Moreover, we experimentally
  evaluated the algorithm and compared it to known heuristics","Discrete Applied Mathematics 220:134-160, 2017",10.1016/j.dam.2016.12.002,,cs.DS cs.DM cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finding the origin of short phrases propagating through the web has been
formalized by Leskovec et al. [ACM SIGKDD 2009] as DAG Partitioning: given an
arc-weighted directed acyclic graph on $n$ vertices and $m$ arcs, delete arcs
with total weight at most $k$ such that each resulting weakly-connected
component contains exactly one sink---a vertex without outgoing arcs. DAG
Partitioning is NP-hard.
  We show an algorithm to solve DAG Partitioning in $O(2^k \cdot (n+m))$ time,
that is, in linear time for fixed $k$. We complement it with linear-time
executable data reduction rules. Our experiments show that, in combination,
they can optimally solve DAG Partitioning on simulated citation networks within
five minutes for $k\leq190$ and $m$ being $10^7$ and larger. We use our
obtained optimal solutions to evaluate the solution quality of Leskovec et
al.'s heuristic.
  We show that Leskovec et al.'s heuristic works optimally on trees and
generalize this result by showing that DAG Partitioning is solvable in
$2^{O(w^2)}\cdot n$ time if a width-$w$ tree decomposition of the input graph
is given. Thus, we improve an algorithm and answer an open question of Alamdari
and Mehrabian [WAW 2012].
  We complement our algorithms by lower bounds on the running time of exact
algorithms and on the effectivity of data reduction.
","[{'version': 'v1', 'created': 'Sun, 27 Nov 2016 09:04:03 GMT'}]",2017-02-02,"[['van Bevern', 'René', ''], ['Bredereck', 'Robert', ''], ['Chopin', 'Morgan', ''], ['Hartung', 'Sepp', ''], ['Hüffner', 'Falk', ''], ['Nichterlein', 'André', ''], ['Suchý', 'Ondřej', '']]","['NP-hard problem', 'graph algorithms', 'polynomial-time data reduction', 'multiway cut', 'linear-time algorithms', 'algorithm engineering', 'evaluating heuristics']"
1287,1509.06935,Daniel Ruprecht,Daniel Ruprecht,Shared Memory Pipelined Parareal,,"In: Rivera F., Pena T., Cabaleiro J. (eds) Euro-Par 2017: Parallel
  Processing. Lecture Notes in Computer Science, vol 10417. Springer",10.1007/978-3-319-64203-1_48,,cs.MS cs.DC cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For the parallel-in-time integration method Parareal, pipelining can be used
to hide some of the cost of the serial correction step and improve its
efficiency. The paper introduces a basic OpenMP implementation of pipelined
Parareal and compares it to a standard MPI-based variant. Both versions yield
almost identical runtimes, but, depending on the compiler, the OpenMP variant
consumes about 7% less energy and has a significantly smaller memory footprint.
However, its higher implementation complexity might make it difficult to use in
legacy codes and in combination with spatial parallelisation.
","[{'version': 'v1', 'created': 'Wed, 23 Sep 2015 12:04:23 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Apr 2016 09:57:47 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Nov 2019 15:20:23 GMT'}]",2019-11-12,"[['Ruprecht', 'Daniel', '']]","['Parareal', 'parallel-in-time integration', 'pipelining', 'OpenMP']"
1288,1810.08484,Roland Molontay,Roland Molontay and Kitti Varga,On the complexity of color-avoiding site and bond percolation,14 pages,,10.1007/978-3-030-10801-4_28,,cs.DM cs.CC cs.SI math.CO physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The mathematical analysis of robustness and error-tolerance of complex
networks has been in the center of research interest. On the other hand, little
work has been done when the attack-tolerance of the vertices or edges are not
independent but certain classes of vertices or edges share a mutual
vulnerability. In this study, we consider a graph and we assign colors to the
vertices or edges, where the color-classes correspond to the shared
vulnerabilities. An important problem is to find robustly connected vertex
sets: nodes that remain connected to each other by paths providing any type of
error (i.e. erasing any vertices or edges of the given color). This is also
known as color-avoiding percolation. In this paper, we study various possible
modeling approaches of shared vulnerabilities, we analyze the computational
complexity of finding the robustly (color-avoiding) connected components. We
find that the presented approaches differ significantly regarding their
complexity.
","[{'version': 'v1', 'created': 'Fri, 19 Oct 2018 13:19:09 GMT'}]",2019-02-26,"[['Molontay', 'Roland', ''], ['Varga', 'Kitti', '']]","['computational complexity', 'color-avoiding percolation', 'robustly connected components', 'attack tolerance', 'shared vulnerability']"
1289,0811.2609,Mahdi Cheraghchi,Mahdi Cheraghchi,Noise-Resilient Group Testing: Limitations and Constructions,"Full version. A preliminary summary of this work appears (under the
  same title) in proceedings of the 17th International Symposium on
  Fundamentals of Computation Theory (FCT 2009)",,10.1007/978-3-642-03409-1_7,,cs.DM cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study combinatorial group testing schemes for learning $d$-sparse Boolean
vectors using highly unreliable disjunctive measurements. We consider an
adversarial noise model that only limits the number of false observations, and
show that any noise-resilient scheme in this model can only approximately
reconstruct the sparse vector. On the positive side, we take this barrier to
our advantage and show that approximate reconstruction (within a satisfactory
degree of approximation) allows us to break the information theoretic lower
bound of $\tilde{\Omega}(d^2 \log n)$ that is known for exact reconstruction of
$d$-sparse vectors of length $n$ via non-adaptive measurements, by a
multiplicative factor $\tilde{\Omega}(d)$.
  Specifically, we give simple randomized constructions of non-adaptive
measurement schemes, with $m=O(d \log n)$ measurements, that allow efficient
reconstruction of $d$-sparse vectors up to $O(d)$ false positives even in the
presence of $\delta m$ false positives and $O(m/d)$ false negatives within the
measurement outcomes, for any constant $\delta < 1$. We show that, information
theoretically, none of these parameters can be substantially improved without
dramatically affecting the others. Furthermore, we obtain several explicit
constructions, in particular one matching the randomized trade-off but using $m
= O(d^{1+o(1)} \log n)$ measurements. We also obtain explicit constructions
that allow fast reconstruction in time $\poly(m)$, which would be sublinear in
$n$ for sufficiently sparse vectors. The main tool used in our construction is
the list-decoding view of randomness condensers and extractors.
","[{'version': 'v1', 'created': 'Mon, 17 Nov 2008 00:12:45 GMT'}, {'version': 'v2', 'created': 'Tue, 26 May 2009 15:15:01 GMT'}, {'version': 'v3', 'created': 'Fri, 22 Jul 2011 20:32:04 GMT'}]",2015-05-13,"[['Cheraghchi', 'Mahdi', '']]","['Group Testing', 'Randomness Condensers', 'Extractors', 'List Decoding']"
1290,2004.14164,Xiaoqing Geng,"Xiaoqing Geng, Xiwen Chen, Kenny Q. Zhu, Libin Shen, Yinggong Zhao","MICK: A Meta-Learning Framework for Few-shot Relation Classification
  with Small Training Data",,"CIKM 2020: The 29th ACM International Conference on Information
  and Knowledge Management",10.1145/3340531.3411858,,cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Few-shot relation classification seeks to classify incoming query instances
after meeting only few support instances. This ability is gained by training
with large amount of in-domain annotated data. In this paper, we tackle an even
harder problem by further limiting the amount of data available at training
time. We propose a few-shot learning framework for relation classification,
which is particularly powerful when the training data is very small. In this
framework, models not only strive to classify query instances, but also seek
underlying knowledge about the support instances to obtain better instance
representations. The framework also includes a method for aggregating
cross-domain knowledge into models by open-source task enrichment.
Additionally, we construct a brand new dataset: the TinyRel-CM dataset, a
few-shot relation classification dataset in health domain with purposely small
training data and challenging relation classes. Experimental results
demonstrate that our framework brings performance gains for most underlying
classification models, outperforms the state-of-the-art results given small
training data, and achieves competitive results with sufficiently large
training data.
","[{'version': 'v1', 'created': 'Sun, 26 Apr 2020 06:23:38 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Dec 2020 15:54:51 GMT'}]",2020-12-15,"[['Geng', 'Xiaoqing', ''], ['Chen', 'Xiwen', ''], ['Zhu', 'Kenny Q.', ''], ['Shen', 'Libin', ''], ['Zhao', 'Yinggong', '']]","['few-shot learning', 'meta-learning', 'small training data', 'relation classification']"
1291,1310.0152,Shamim Ripon,"Shamim Ripon, Sk. Jahir Hossain and Touhid Bhuiyan",Managing and Analysing Software Product Line Requirements,"13 pages, 11 figures","International Journal of Software Engineering & Applications
  (IJSEA), Vol.4, No.5, September 2013",10.5121/ijsea.2013.4505,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modelling software product line (SPL) features plays a crucial role to a
successful development of SPL. Feature diagram is one of the widely used
notations to model SPL variants. However, there is a lack of precisely defined
formal notations for representing and verifying such models. This paper
presents an approach that we adopt to model SPL variants by using UML and
subsequently verify them by using first-order logic. UML provides an overall
modelling view of the system. First-order logic provides a precise and rigorous
interpretation of the feature diagrams. We model variants and their
dependencies by using propositional connectives and build logical expressions.
These expressions are then validated by the Alloy verification tool. The
analysis and verification process is illustrated by using Computer Aided
Dispatch (CAD) system.
","[{'version': 'v1', 'created': 'Tue, 1 Oct 2013 06:13:04 GMT'}]",2013-10-02,"[['Ripon', 'Shamim', ''], ['Hossain', 'Sk. Jahir', ''], ['Bhuiyan', 'Touhid', '']]","['Software Product Line', 'First order logic', 'Alloy', 'variant management']"
1292,2102.12313,Xiang Li,"Xiang Li, Yuzheng Chen, Rakesh Patibanda, Florian 'Floyd' Mueller",vrCAPTCHA: Exploring CAPTCHA Designs in Virtual Reality,"4 pages, 3 figures, CHI EA' 2021",,10.1145/3411763.3451985,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  With the popularity of online access in virtual reality (VR) devices, it will
become important to investigate exclusive and interactive CAPTCHA (Completely
Automated Public Turing test to tell Computers and Humans Apart) designs for VR
devices. In this paper, we first present four traditional two-dimensional (2D)
CAPTCHAs (i.e., text-based, image-rotated, image-puzzled, and image-selected
CAPTCHAs) in VR. Then, based on the three-dimensional (3D) interaction
characteristics of VR devices, we propose two vrCAPTCHA design prototypes
(i.e., task-driven and bodily motion-based CAPTCHAs). We conducted a user study
with six participants for exploring the feasibility of our two vrCAPTCHAs and
traditional CAPTCHAs in VR. We believe that our two vrCAPTCHAs can be an
inspiration for the further design of CAPTCHAs in VR.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2021 14:43:11 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Feb 2021 16:13:02 GMT'}]",2021-02-26,"[['Li', 'Xiang', ''], ['Chen', 'Yuzheng', ''], ['Patibanda', 'Rakesh', ''], ['Mueller', ""Florian 'Floyd'"", '']]","['vrCAPTCHA', 'virtual reality', 'CAPTCHA']"
1293,1901.08840,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",Program algebra for Turing-machine programs,"19 pages, Sect. 2--4 are largely shortened versions of Sect. 2--4 of
  arXiv:1808.04264, which, in turn, draw from preliminary sections of several
  earlier papers; 21 pages, some remarks in Sect.1 and Sect.10 added",Scientific Annals of Computer Science 29(2):113--139 (2019),10.7561/SACS.2019.2.113,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an algebraic theory of instruction sequences with
instructions for Turing tapes as basic instructions, the behaviours produced by
the instruction sequences concerned under execution, and the interaction
between such behaviours and Turing tapes provided by an execution environment.
This theory provides a setting for the development of theory in areas such as
computability and computational complexity that distinguishes itself by
offering the possibility of equational reasoning and being more general than
the setting provided by a known version of the Turing-machine model of
computation. The theory is essentially an instantiation of a parameterized
algebraic theory which is the basis of a line of research in which issues
relating to a wide variety of subjects from computer science have been
rigorously investigated thinking in terms of instruction sequences.
","[{'version': 'v1', 'created': 'Fri, 25 Jan 2019 11:39:36 GMT'}, {'version': 'v2', 'created': 'Sat, 7 Dec 2019 12:39:19 GMT'}]",2020-01-06,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['program algebra', 'thread algebra', 'model of computation', 'Turingmachine program', 'computability', 'computational complexity']"
1294,1811.00761,Riza Ozcelik,"R{\i}za \""Oz\c{c}elik, Hakime \""Ozt\""urk, Arzucan \""Ozg\""ur, Elif
  Ozkirimli","ChemBoost: A chemical language based approach for protein-ligand binding
  affinity prediction",Molecular Informatics,,10.1002/minf.202000212,,cs.LG q-bio.QM stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identification of high affinity drug-target interactions is a major research
question in drug discovery. Proteins are generally represented by their
structures or sequences. However, structures are available only for a small
subset of biomolecules and sequence similarity is not always correlated with
functional similarity. We propose ChemBoost, a chemical language based approach
for affinity prediction using SMILES syntax. We hypothesize that SMILES is a
codified language and ligands are documents composed of chemical words. These
documents can be used to learn chemical word vectors that represent words in
similar contexts with similar vectors. In ChemBoost, the ligands are
represented via chemical word embeddings, while the proteins are represented
through sequence-based features and/or chemical words of their ligands. Our aim
is to process the patterns in SMILES as a language to predict protein-ligand
affinity, even when we cannot infer the function from the sequence. We used
eXtreme Gradient Boosting to predict protein-ligand affinities in KIBA and
BindingDB data sets. ChemBoost was able to predict drug-target binding affinity
as well as or better than state-of-the-art machine learning systems. When
powered with ligand-centric representations, ChemBoost was more robust to the
changes in protein sequence similarity and successfully captured the
interactions between a protein and a ligand, even if the protein has low
sequence similarity to the known targets of the ligand.
","[{'version': 'v1', 'created': 'Fri, 2 Nov 2018 07:29:56 GMT'}, {'version': 'v2', 'created': 'Sun, 30 Aug 2020 10:28:40 GMT'}, {'version': 'v3', 'created': 'Fri, 18 Dec 2020 21:48:20 GMT'}]",2020-12-22,"[['Özçelik', 'Rıza', ''], ['Öztürk', 'Hakime', ''], ['Özgür', 'Arzucan', ''], ['Ozkirimli', 'Elif', '']]","['chemical language', 'drug discovery', 'machine learning', 'proteins', 'virtual screening']"
1295,1809.08811,Robert Schilling,"Robert Schilling, Mario Werner, Pascal Nasahl, Stefan Mangard","Pointing in the Right Direction - Securing Memory Accesses in a Faulty
  World",Accepted at ACSAC 2018,,10.1145/3274694.3274728,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reading and writing memory are, besides computation, the most common
operations a processor performs. The correctness of these operations is
therefore essential for the proper execution of any program. However, as soon
as fault attacks are considered, assuming that the hardware performs its memory
operations as instructed is not valid anymore. In particular, attackers may
induce faults with the goal of reading or writing incorrectly addressed memory,
which can have various critical safety and security implications.
  In this work, we present a solution to this problem and propose a new method
for protecting every memory access inside a program against address tampering.
The countermeasure comprises two building blocks. First, every pointer inside
the program is redundantly encoded using a multi-residue error detection code.
The redundancy information is stored in the unused upper bits of the pointer
with zero overhead in terms of storage. Second, load and store instructions are
extended to link data with the corresponding encoded address from the pointer.
Wrong memory accesses subsequently infect the data value allowing the software
to detect the error.
  For evaluation purposes, we implemented our countermeasure into a RISC-V
processor, tested it on a FPGA development board, and evaluated the induced
overhead. Furthermore, a LLVM-based C compiler has been modified to
automatically encode all data pointers, to perform encoded pointer arithmetic,
and to emit the extended load/store instructions with linking support. Our
evaluations show that the countermeasure induces an average overhead of 10% in
terms of code size and 7% regarding runtime, which makes it suitable for
practical adoption.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2018 09:20:16 GMT'}]",2018-09-25,"[['Schilling', 'Robert', ''], ['Werner', 'Mario', ''], ['Nasahl', 'Pascal', ''], ['Mangard', 'Stefan', '']]","['fault attacks', 'countermeasure', 'memory access', 'pointer protection']"
1296,1907.10096,Enrique Martin-Martin,"Elvira Albert, Miquel Bofill, Cristina Borralleras, Enrique
  Martin-Martin, Albert Rubio",Resource Analysis driven by (Conditional) Termination Proofs,"Paper presented at the 35th International Conference on Logic
  Programming (ICLP 2019), Las Cruces, New Mexico, USA, 20-25 September 2019,
  16 pages",Theory and Practice of Logic Programming 19 (2019) 722-739,10.1017/S1471068419000152,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When programs feature a complex control flow, existing techniques for
resource analysis produce cost relation systems (CRS) whose cost functions
retain the complex flow of the program and, consequently, might not be solvable
into closed-form upper bounds. This paper presents a novel approach to resource
analysis that is driven by the result of a termination analysis. The
fundamental idea is that the termination proof encapsulates the flows of the
program which are relevant for the cost computation so that, by driving the
generation of the CRS using the termination proof, we produce a
linearly-bounded CRS (LB-CRS). A LB-CRS is composed of cost functions that are
guaranteed to be locally bounded by linear ranking functions and thus greatly
simplify the process of CRS solving. We have built a new resource analysis
tool, named MaxCore, that is guided by the VeryMax termination analyzer and
uses CoFloCo and PUBS as CRS solvers. Our experimental results on the set of
benchmarks from the Complexity and Termination Competition 2019 for C Integer
programs show that MaxCore outperforms all other resource analysis tools. Under
consideration for acceptance in TPLP.
","[{'version': 'v1', 'created': 'Tue, 23 Jul 2019 18:34:36 GMT'}]",2020-02-19,"[['Albert', 'Elvira', ''], ['Bofill', 'Miquel', ''], ['Borralleras', 'Cristina', ''], ['Martin-Martin', 'Enrique', ''], ['Rubio', 'Albert', '']]","['resource analysis', 'termination analysis', 'cost relation systems', 'upper bounds']"
1297,1305.2462,Liyong Shen,"Sonia Perez-Diaza, Liyong Shen",Characterization of Rational Ruled Surfaces,31 pages,"Journal of Symbolic Computation Volume 63, May 2014, Pages 21-45",10.1016/j.jsc.2013.11.003,,cs.SC cs.CG math.AG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ruled surface is a typical modeling surface in computer aided geometric
design. It is usually given in the standard parametric form. However, it can
also be in the forms than the standard one. For these forms, it is necessary to
determine and find the standard form. In this paper, we present algorithms to
determine whether a given implicit surface is a rational ruled surface. A
parametrization of the surface is computed for the affirmative case. We also
consider the parametric situation. More precisely, after a given rational
parametric surface is determined as a ruled one, we reparameterize it to the
standard form.
","[{'version': 'v1', 'created': 'Sat, 11 May 2013 01:50:15 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Jun 2013 00:42:54 GMT'}]",2014-10-28,"[['Perez-Diaza', 'Sonia', ''], ['Shen', 'Liyong', '']]","['ruled surface', 'parametrization', 'reparametrization', 'birationaltransformation']"
1298,1809.07656,Alexander Gorban,"A.N. Gorban, V.A. Makarov, I.Y. Tyukin","The unreasonable effectiveness of small neural ensembles in
  high-dimensional brain","Review paper, accepted in Physics of Life Reviews; minor corrections","Physics of Life Reviews Volume 29, July 2019, Pages 55-88",10.1016/j.plrev.2018.09.005,,cs.AI q-bio.NC,http://creativecommons.org/licenses/by/4.0/,"  Despite the widely-spread consensus on the brain complexity, sprouts of the
single neuron revolution emerged in neuroscience in the 1970s. They brought
many unexpected discoveries, including grandmother or concept cells and sparse
coding of information in the brain.
  In machine learning for a long time, the famous curse of dimensionality
seemed to be an unsolvable problem. Nevertheless, the idea of the blessing of
dimensionality becomes gradually more and more popular. Ensembles of
non-interacting or weakly interacting simple units prove to be an effective
tool for solving essentially multidimensional problems. This approach is
especially useful for one-shot (non-iterative) correction of errors in large
legacy artificial intelligence systems.
  These simplicity revolutions in the era of complexity have deep fundamental
reasons grounded in geometry of multidimensional data spaces. To explore and
understand these reasons we revisit the background ideas of statistical
physics. In the course of the 20th century they were developed into the
concentration of measure theory. New stochastic separation theorems reveal the
fine structure of the data clouds.
  We review and analyse biological, physical, and mathematical problems at the
core of the fundamental question: how can high-dimensional brain organise
reliable and fast learning in high-dimensional world of data by simple tools?
  Two critical applications are reviewed to exemplify the approach: one-shot
correction of errors in intellectual systems and emergence of static and
associative memories in ensembles of single neurons.
","[{'version': 'v1', 'created': 'Thu, 20 Sep 2018 14:53:11 GMT'}, {'version': 'v2', 'created': 'Sat, 10 Nov 2018 10:57:11 GMT'}]",2022-05-17,"[['Gorban', 'A. N.', ''], ['Makarov', 'V. A.', ''], ['Tyukin', 'I. Y.', '']]","['big data', 'non-iterative learning', 'error correction', 'measure concentration', 'blessing of dimensionality', 'linear discriminant']"
1299,1806.02750,Hassan Ismail Fawaz,"Hassan Ismail Fawaz, Germain Forestier, Jonathan Weber, Lhassane
  Idoumghar, Pierre-Alain Muller","Evaluating surgical skills from kinematic data using convolutional
  neural networks",Accepted at MICCAI 2018,,10.1007/978-3-030-00937-3_25,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The need for automatic surgical skills assessment is increasing, especially
because manual feedback from senior surgeons observing junior surgeons is prone
to subjectivity and time consuming. Thus, automating surgical skills evaluation
is a very important step towards improving surgical practice. In this paper, we
designed a Convolutional Neural Network (CNN) to evaluate surgeon skills by
extracting patterns in the surgeon motions performed in robotic surgery. The
proposed method is validated on the JIGSAWS dataset and achieved very
competitive results with 100% accuracy on the suturing and needle passing
tasks. While we leveraged from the CNNs efficiency, we also managed to mitigate
its black-box effect using class activation map. This feature allows our method
to automatically highlight which parts of the surgical task influenced the
skill prediction and can be used to explain the classification and to provide
personalized feedback to the trainee.
","[{'version': 'v1', 'created': 'Thu, 7 Jun 2018 16:06:10 GMT'}]",2018-11-27,"[['Fawaz', 'Hassan Ismail', ''], ['Forestier', 'Germain', ''], ['Weber', 'Jonathan', ''], ['Idoumghar', 'Lhassane', ''], ['Muller', 'Pierre-Alain', '']]","['kinematic data', 'RMIS', 'deep learning', 'CNN']"
1300,1811.00764,Youhei Akimoto,"Naoki Sakamoto, Youhei Akimoto","Adaptive Ranking Based Constraint Handling for Explicitly Constrained
  Black-Box Optimization",Accepted to Evolutionary Computation (MIT Press),,10.1162/evco_a_00310,,cs.NE cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We propose a novel constraint-handling technique for the covariance matrix
adaptation evolution strategy (CMA-ES). The proposed technique is aimed at
solving explicitly constrained black-box continuous optimization problems, in
which the explicit constraint is a constraint whereby the computational time
for the constraint violation and its (numerical) gradient are negligible
compared to that for the objective function. This method is designed to realize
two invariance properties: invariance to the affine transformation of the
search space, and invariance to the increasing transformation of the objective
and constraint functions. The CMA-ES is designed to possess these properties
for handling difficulties that appear in black-box optimization problems, such
as non-separability, ill-conditioning, ruggedness, and the different orders of
magnitude in the objective. The proposed constraint-handling technique (CHT),
known as ARCH, modifies the underlying CMA-ES only in terms of the ranking of
the candidate solutions. It employs a repair operator and an adaptive ranking
aggregation strategy to compute the ranking. We developed test problems to
evaluate the effects of the invariance properties, and performed experiments to
empirically verify the invariance of the algorithm. We compared the proposed
method with other CHTs on the CEC 2006 constrained optimization benchmark suite
to demonstrate its efficacy. Empirical studies reveal that ARCH is able to
exploit the explicitness of the constraint functions effectively, sometimes
even more efficiently than an existing box-constraint handling technique on
box-constrained problems, while exhibiting the invariance properties. Moreover,
ARCH overwhelmingly outperforms CHTs by not exploiting the explicit constraints
in terms of the number of objective function calls.
","[{'version': 'v1', 'created': 'Fri, 2 Nov 2018 07:40:54 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Jun 2019 07:10:15 GMT'}, {'version': 'v3', 'created': 'Mon, 9 May 2022 23:22:00 GMT'}]",2022-05-11,"[['Sakamoto', 'Naoki', ''], ['Akimoto', 'Youhei', '']]","['Explicit constraint', 'black-box optimization', 'invariance', 'CMA-ES']"
1301,1502.00143,Hossam  Afifi,"Thouraya Toukabri Gunes, Hossam Afifi",Hybrid model for LTE Network-Assisted D2D communications,,,10.1007/978-3-319-07425-2_8,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  New Architecture to support D2D communications, where discovery is made
directly between devices while communications occur with the help of the E-Node
B
","[{'version': 'v1', 'created': 'Sat, 31 Jan 2015 18:39:46 GMT'}]",2015-02-03,"[['Gunes', 'Thouraya Toukabri', ''], ['Afifi', 'Hossam', '']]","['D2D communications', 'LTE networks', 'Proximity Services']"
1302,1701.07774,Ying Dong,"Ying Dong, Yuqing Zhang",Adaptively Detecting Malicious Queries in Web Attacks,,,10.1007/s11432-017-9288-4,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web request query strings (queries), which pass parameters to the referenced
resource, are always manipulated by attackers to retrieve sensitive data and
even take full control of victim web servers and web applications. However,
existing malicious query detection approaches in the current literature cannot
cope with changing web attacks with constant detection models. In this paper,
we propose AMODS, an adaptive system that periodically updates the detection
model to detect the latest unknown attacks. We also propose an adaptive
learning strategy, called SVM HYBRID, leveraged by our system to minimize
manual work. In the evaluation, an up-to-date detection model is trained on a
ten-day query dataset collected from an academic institute's web server logs.
Our system outperforms existing web attack detection methods, with an F-value
of 94.79% and FP rate of 0.09%. The total number of malicious queries obtained
by SVM HYBRID is 2.78 times that by the popular Support Vector Machine Adaptive
Learning (SVM AL) method. The malicious queries obtained can be used to update
the Web Application Firewall (WAF) signature library.
","[{'version': 'v1', 'created': 'Thu, 26 Jan 2017 16:56:01 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Nov 2017 09:09:04 GMT'}]",2018-01-12,"[['Dong', 'Ying', ''], ['Zhang', 'Yuqing', '']]","['Web attacks', 'Web request query strings', 'Adaptive learning', 'SVM', 'Intrusion detection', 'Anomaly detection']"
1303,1403.6085,Stefan Mitsch,"Stefan Mitsch, Grant Olney Passmore and Andre Platzer",Collaborative Verification-Driven Engineering of Hybrid Systems,,"Math. Comput. Sci. 8(1), 71-97, 2014",10.1007/s11786-014-0176-y,,cs.LO cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hybrid systems with both discrete and continuous dynamics are an important
model for real-world cyber-physical systems. The key challenge is to ensure
their correct functioning w.r.t. safety requirements. Promising techniques to
ensure safety seem to be model-driven engineering to develop hybrid systems in
a well-defined and traceable manner, and formal verification to prove their
correctness. Their combination forms the vision of verification-driven
engineering. Often, hybrid systems are rather complex in that they require
expertise from many domains (e.g., robotics, control systems, computer science,
software engineering, and mechanical engineering). Moreover, despite the
remarkable progress in automating formal verification of hybrid systems, the
construction of proofs of complex systems often requires nontrivial human
guidance, since hybrid systems verification tools solve undecidable problems.
It is, thus, not uncommon for development and verification teams to consist of
many players with diverse expertise. This paper introduces a
verification-driven engineering toolset that extends our previous work on
hybrid and arithmetic verification with tools for (i) graphical (UML) and
textual modeling of hybrid systems, (ii) exchanging and comparing models and
proofs, and (iii) managing verification tasks. This toolset makes it easier to
tackle large-scale verification tasks.
","[{'version': 'v1', 'created': 'Mon, 24 Mar 2014 19:09:47 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Oct 2014 02:52:13 GMT'}]",2015-05-27,"[['Mitsch', 'Stefan', ''], ['Passmore', 'Grant Olney', ''], ['Platzer', 'Andre', '']]","['formal verification', 'hybrid system', 'cyber-physical system', 'model-driven engineering']"
1304,1903.11833,Andres Ferraro,"Andr\'es Ferraro, Dmitry Bogdanov and Xavier Serra","Skip prediction using boosting trees based on acoustic features of
  tracks in sessions",,"WSDM Cup 2019 Workshop on the 12th ACM International Conference on
  Web Search and Data Mining",,,cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The Spotify Sequential Skip Prediction Challenge focuses on predicting if a
track in a session will be skipped by the user or not. In this paper, we
describe our approach to this problem and the final system that was submitted
to the challenge by our team from the Music Technology Group (MTG) under the
name ""aferraro"". This system consists in combining the predictions of multiple
boosting trees models trained with features extracted from the sessions and the
tracks. The proposed approach achieves good overall performance (MAA of 0.554),
with our model ranked 14th out of more than 600 submissions in the final
leaderboard.
","[{'version': 'v1', 'created': 'Thu, 28 Mar 2019 08:37:10 GMT'}]",2019-03-29,"[['Ferraro', 'Andrés', ''], ['Bogdanov', 'Dmitry', ''], ['Serra', 'Xavier', '']]","['data mining', 'machine learning', 'music recommender systems', 'contentaware recommendation', 'challenges']"
1305,2211.14592,Nikolai Kosmatov,"Nicolas Berthier and Steven De Oliveira and Nikolai Kosmatov and
  Delphine Longuet and Romain Soulat",An Efficient Black-Box Support of Advanced Coverage Criteria for Klee,15 pages,Proceedings of ACM SAC 2023,10.1145/3555776.3577713,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Dynamic symbolic execution (DSE) is a powerful test generation approach based
on an exploration of the path space of the program under test. Well-adapted for
path coverage, this approach is however less efficient for conditions,
decisions, advanced coverage criteria (such as multiple conditions, weak
mutations, boundary testing) or user-provided test objectives. While
theoretical solutions to adapt DSE to a large set of criteria have been
proposed, they have never been integrated into publicly available testing
tools. This paper presents a first integration of an optimized test generation
strategy for advanced coverage criteria into a popular open-source testing tool
based on DSE, namely, Klee. The integration is performed in a fully black-box
manner, and can therefore inspire an easy integration into other similar tools.
The resulting version of the tool, named Klee4labels, is publicly available. We
present the design of the proposed technique and evaluate it on several
benchmarks. Our results confirm the benefits of the proposed tool for advanced
coverage criteria.
","[{'version': 'v1', 'created': 'Sat, 26 Nov 2022 15:31:49 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Dec 2022 15:06:29 GMT'}]",2022-12-26,"[['Berthier', 'Nicolas', ''], ['De Oliveira', 'Steven', ''], ['Kosmatov', 'Nikolai', ''], ['Longuet', 'Delphine', ''], ['Soulat', 'Romain', '']]","['Test generation', 'dynamic symbolic execution', 'test coveragecriteria', 'Klee', 'coverage labels']"
1306,1705.00107,Liane Gabora,Liane Gabora and Simon Tseng,"The Social Benefits of Balancing Creativity and Imitation: Evidence from
  an Agent-based Model","58 pages, 2 tables, 12 figures; Accepted for publication in
  Psychology of Aesthetics, Creativity, and the Arts. arXiv admin note: text
  overlap with arXiv:1408.2512","Psychology of Aesthetics, Creativity, and the Arts, Vol 11(4), Nov
  2017, 403-419",10.1037/aca0000132,,cs.MA cs.SI q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although creativity is encouraged in the abstract it is often discouraged in
educational and workplace settings. Using an agent-based model of cultural
evolution, we investigated the idea that tempering the novelty-generating
effects of creativity with the novelty-preserving effects of imitation is
beneficial for society. In Experiment One we systematically introduced
individual differences in creativity, and observed a trade-off between the
ratio of creators to imitators, and how creative the creators were. Excess
creativity was detrimental because creators invested in unproven ideas at the
expense of propagating proven ones. Experiment Two tested the hypothesis that
society as a whole benefits if individuals adjust how creative they are in
accordance with their creative success. When effective creators created more,
and ineffective creators created less (social regulation), the agents
segregated into creators and imitators, and the mean fitness of outputs was
temporarily higher. We hypothesized that the temporary nature of the effect was
due to a ceiling on output fitness. In Experiment Three we made the space of
possible outputs open-ended by giving agents the capacity to chain simple
outputs into arbitrarily complex ones such that fitter outputs were always
possible. With the capacity for chained outputs, the effect of social
regulation could indeed be maintained indefinitely. The results are discussed
in light of empirical data.
","[{'version': 'v1', 'created': 'Sat, 29 Apr 2017 01:09:18 GMT'}]",2019-03-15,"[['Gabora', 'Liane', ''], ['Tseng', 'Simon', '']]","['agent-based model', 'creativity', 'imitation', 'individual differences', 'social']"
1307,1611.08847,Daniel M\'endez Fern\'andez,"H. Femmer, D. M\'endez Fern\'andez, S. Wagner, S. Eder",Rapid quality assurance with Requirements Smells,"The Journal of Systems and Software, 2016",,10.1016/j.jss.2016.02.047,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bad requirements quality can cause expensive consequences during the software
development lifecycle, especially if iterations are long and feedback comes
late. %-- the faster a problem is found, the cheaper it is to fix. This makes
explicit the need of a lightweight detection mechanism of requirements quality
violations. We aim at a light-weight static requirements analysis approach that
allows for rapid checks immediately when requirements are written down. We
transfer the concept of code smells to Requirements Engineering as Requirements
Smells. To evaluate the benefits and limitations, we define Requirements
Smells, realize our concepts for a smell detection in a prototype called Smella
and apply Smella in a series of cases provided by three industrial and a
university context. The automatic detection yields an average precision of 59%
at an average recall of 82% with high variation. The evaluation in practical
environments indicates benefits such as an increase of the awareness of quality
defects. Yet, some smells were not clearly distinguishable. Lightweight smell
detection can uncover many practically relevant requirements defects in a
reasonably precise way. Although some smells need to be defined more clearly,
smell detection provides a helpful means to support quality assurance in
Requirements Engineering, for instance, as a supplement to reviews.
","[{'version': 'v1', 'created': 'Sun, 27 Nov 2016 14:06:42 GMT'}]",2016-11-29,"[['Femmer', 'H.', ''], ['Fernández', 'D. Méndez', ''], ['Wagner', 'S.', ''], ['Eder', 'S.', '']]","['Requirements Engineering', 'Quality Assurance', 'Automatic Defect Detection', 'RequirementsSmells']"
1308,1808.08042,Fabrizio Riguzzi PhD,"Jan Wielemaker, Fabrizio Riguzzi, Bob Kowalski, Torbj\""orn Lager,
  Fariba Sadri, Miguel Calejo","Using SWISH to realise interactive web based tutorials for logic based
  languages",,"Jan Wielemaker et al. Using SWISH to realise interactive web based
  tutorials for logic based languages. Theory and Practice of Logic
  Programming, 19(2):229--261, 2019",10.1017/S1471068418000522,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Programming environments have evolved from purely text based to using
graphical user interfaces, and now we see a move towards web based interfaces,
such as Jupyter. Web based interfaces allow for the creation of interactive
documents that consist of text and programs, as well as their output. The
output can be rendered using web technology as, e.g., text, tables, charts or
graphs. This approach is particularly suitable for capturing data analysis
workflows and creating interactive educational material. This article describes
SWISH, a web front-end for Prolog that consists of a web server implemented in
SWI-Prolog and a client web application written in JavaScript. SWISH provides a
web server where multiple users can manipulate and run the same material, and
it can be adapted to support Prolog extensions. In this paper we describe the
architecture of SWISH, and describe two case studies of extensions of Prolog,
namely Probabilistic Logic Programming (PLP) and Logic Production System (LPS),
which have used SWISH to provide tutorial sites.
","[{'version': 'v1', 'created': 'Fri, 24 Aug 2018 08:14:29 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Jan 2020 11:59:17 GMT'}]",2020-01-31,"[['Wielemaker', 'Jan', ''], ['Riguzzi', 'Fabrizio', ''], ['Kowalski', 'Bob', ''], ['Lager', 'Torbjörn', ''], ['Sadri', 'Fariba', ''], ['Calejo', 'Miguel', '']]","['Prolog', 'logic programming system', 'notebook interface', 'web']"
1309,1303.1741,Emilio Ferrara,"Pasquale De Meo, Emilio Ferrara, Giacomo Fiumara, Alessandro Provetti",Enhancing community detection using a network weighting strategy,"28 pages, 2 figures","Information Sciences, 222:648-668, 2013",10.1016/j.ins.2012.08.001,,cs.SI cs.DS physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A community within a network is a group of vertices densely connected to each
other but less connected to the vertices outside. The problem of detecting
communities in large networks plays a key role in a wide range of research
areas, e.g. Computer Science, Biology and Sociology. Most of the existing
algorithms to find communities count on the topological features of the network
and often do not scale well on large, real-life instances.
  In this article we propose a strategy to enhance existing community detection
algorithms by adding a pre-processing step in which edges are weighted
according to their centrality w.r.t. the network topology. In our approach, the
centrality of an edge reflects its contribute to making arbitrary graph
tranversals, i.e., spreading messages over the network, as short as possible.
Our strategy is able to effectively complements information about network
topology and it can be used as an additional tool to enhance community
detection. The computation of edge centralities is carried out by performing
multiple random walks of bounded length on the network. Our method makes the
computation of edge centralities feasible also on large-scale networks. It has
been tested in conjunction with three state-of-the-art community detection
algorithms, namely the Louvain method, COPRA and OSLOM. Experimental results
show that our method raises the accuracy of existing algorithms both on
synthetic and real-life datasets.
","[{'version': 'v1', 'created': 'Thu, 7 Mar 2013 16:43:30 GMT'}]",2013-03-08,"[['De Meo', 'Pasquale', ''], ['Ferrara', 'Emilio', ''], ['Fiumara', 'Giacomo', ''], ['Provetti', 'Alessandro', '']]","['Network Science', 'Complex Networks', 'Community Detection', 'Social Networks', 'Social Network Analysis']"
1310,0712.2449,Philipp Mayr,"Philipp Mayr, Peter Mutschke, Vivien Petras","Reducing semantic complexity in distributed Digital Libraries: treatment
  of term vagueness and document re-ranking","12 pages, 4 figures",,10.1108/00242530810865484,,cs.DL,,"  The purpose of the paper is to propose models to reduce the semantic
complexity in heterogeneous DLs. The aim is to introduce value-added services
(treatment of term vagueness and document re-ranking) that gain a certain
quality in DLs if they are combined with heterogeneity components established
in the project ""Competence Center Modeling and Treatment of Semantic
Heterogeneity"". Empirical observations show that freely formulated user terms
and terms from controlled vocabularies are often not the same or match just by
coincidence. Therefore, a value-added service will be developed which rephrases
the natural language searcher terms into suggestions from the controlled
vocabulary, the Search Term Recommender (STR). Two methods, which are derived
from scientometrics and network analysis, will be implemented with the
objective to re-rank result sets by the following structural properties: the
ranking of the results by core journals (so-called Bradfordizing) and ranking
by centrality of authors in co-authorship networks.
","[{'version': 'v1', 'created': 'Fri, 14 Dec 2007 21:24:26 GMT'}]",2019-01-15,"[['Mayr', 'Philipp', ''], ['Mutschke', 'Peter', ''], ['Petras', 'Vivien', '']]","['Digital Library', 'Semantic Heterogeneity', 'Search Term Recommender', 'ReRanking', 'Bradfordizing', 'Co-Author Networks', 'Network Analysis']"
1311,2209.13495,Paolo Burelli,"Jeppe Theiss Kristensen, Christian Guckelsberger, Paolo Burelli,
  Perttu H\""am\""al\""ainen",Personalized Game Difficulty Prediction Using Factorization Machines,,"The 35th Annual ACM Symposium on User Interface Software and
  Technology (UIST '22), October 29-November 2, 2022, Bend, OR, USA. ACM, New
  York, NY, USA, 13 pages",10.1145/3526113.3545624,,cs.HC cs.AI,http://creativecommons.org/licenses/by/4.0/,"  The accurate and personalized estimation of task difficulty provides many
opportunities for optimizing user experience. However, user diversity makes
such difficulty estimation hard, in that empirical measurements from some user
sample do not necessarily generalize to others. In this paper, we contribute a
new approach for personalized difficulty estimation of game levels, borrowing
methods from content recommendation. Using factorization machines (FM) on a
large dataset from a commercial puzzle game, we are able to predict difficulty
as the number of attempts a player requires to pass future game levels, based
on observed attempt counts from earlier levels and levels played by others. In
addition to performance and scalability, FMs offer the benefit that the learned
latent variable model can be used to study the characteristics of both players
and game levels that contribute to difficulty. We compare the approach to a
simple non-personalized baseline and a personalized prediction using Random
Forests. Our results suggest that FMs are a promising tool enabling game
designers to both optimize player experience and learn more about their players
and the game.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2022 08:03:46 GMT'}]",2022-09-28,"[['Kristensen', 'Jeppe Theiss', ''], ['Guckelsberger', 'Christian', ''], ['Burelli', 'Paolo', ''], ['Hämäläinen', 'Perttu', '']]","['Factorization Machines', 'games', 'player modelling']"
1312,2004.11846,Thomas Vogel,"Javier C\'amara (1), Alessandro V. Papadopoulos (2), Thomas Vogel (3),
  Danny Weyns (4), David Garlan (5), Shihong Huang (6), Kenji Tei (7) ((1)
  University of York, UK, (2) M\""alardalen University, Sweden, (3) Humboldt
  University Berlin, Germany, (4) KU Leuven, Belgium, Linnaeus, Sweden, (5)
  Carnegie Mellon University, USA, (6) Florida Atlantic University, USA, (7)
  Waseda University, Japan)","Towards Bridging the Gap between Control and Self-Adaptive System
  Properties",,"IEEE/ACM 15th International Symposium on Software Engineering for
  Adaptive and Self-Managing Systems (SEAMS 2020)",10.1145/3387939.3391568,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two of the main paradigms used to build adaptive software employ different
types of properties to capture relevant aspects of the system's run-time
behavior. On the one hand, control systems consider properties that concern
static aspects like stability, as well as dynamic properties that capture the
transient evolution of variables such as settling time. On the other hand,
self-adaptive systems consider mostly non-functional properties that capture
concerns such as performance, reliability, and cost. In general, it is not easy
to reconcile these two types of properties or identify under which conditions
they constitute a good fit to provide run-time guarantees. There is a need of
identifying the key properties in the areas of control and self-adaptation, as
well as of characterizing and mapping them to better understand how they relate
and possibly complement each other. In this paper, we take a first step to
tackle this problem by: (1) identifying a set of key properties in control
theory, (2) illustrating the formalization of some of these properties
employing temporal logic languages commonly used to engineer self-adaptive
software systems, and (3) illustrating how to map key properties that
characterize self-adaptive software systems into control properties, leveraging
their formalization in temporal logics. We illustrate the different steps of
the mapping on an exemplar case in the cloud computing domain and conclude with
identifying open challenges in the area.
","[{'version': 'v1', 'created': 'Fri, 24 Apr 2020 16:40:44 GMT'}]",2020-04-27,"[['Cámara', 'Javier', ''], ['Papadopoulos', 'Alessandro V.', ''], ['Vogel', 'Thomas', ''], ['Weyns', 'Danny', ''], ['Garlan', 'David', ''], ['Huang', 'Shihong', ''], ['Tei', 'Kenji', '']]","['self-adaptation', 'control theory', 'nonfunctional requirements']"
1313,1704.08605,Quan Quan,"Quan Quan, Zhiyao Zhao, Liyong Lin, Peng Wang, Walter Murray Wonham,
  Kai-Yuan Cai","Failsafe Mechanism Design of Multicopters Based on Supervisory Control
  Theory","33 pages, 15 figures","IET Cyber-Systems and Robotics,2020",10.1049/iet-csr.2019.0039,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to handle undesirable failures of a multicopter which occur in
either the pre-flight process or the in-flight process, a failsafe mechanism
design method based on supervisory control theory is proposed for the
semi-autonomous control mode. Failsafe mechanism is a control logic that guides
what subsequent actions the multicopter should take, by taking account of
real-time information from guidance, attitude control, diagnosis, and other
low-level subsystems. In order to design a failsafe mechanism for multicopters,
safety issues of multicopters are introduced. Then, user requirements including
functional requirements and safety requirements are textually described, where
function requirements determine a general multicopter plant, and safety
requirements cover the failsafe measures dealing with the presented safety
issues. In order to model the user requirements by discrete-event systems,
several multicopter modes and events are defined. On this basis, the
multicopter plant and control specifications are modeled by automata. Then, a
supervisor is synthesized by monolithic supervisory control theory. In
addition, we present three examples to demonstrate the potential blocking
phenomenon due to inappropriate design of control specifications. Also, we
discuss the meaning of correctness and the properties of the obtained
supervisor. This makes the failsafe mechanism convincingly correct and
effective. Finally, based on the obtained supervisory controller generated by
TCT software, an implementation method suitable for multicopters is presented,
in which the supervisory controller is transformed into decision-making codes.
","[{'version': 'v1', 'created': 'Thu, 27 Apr 2017 14:46:17 GMT'}]",2020-03-10,"[['Quan', 'Quan', ''], ['Zhao', 'Zhiyao', ''], ['Lin', 'Liyong', ''], ['Wang', 'Peng', ''], ['Wonham', 'Walter Murray', ''], ['Cai', 'Kai-Yuan', '']]","['Multicopter', 'failsafe mechanism', 'supervisory control']"
1314,1809.01771,Roger Stein,"Roger A. Stein, Patricia A. Jaques, Joao F. Valiati",An Analysis of Hierarchical Text Classification Using Word Embeddings,"Article accepted for publication in Information Sciences on Sep 1st,
  2018",,10.1016/j.ins.2018.09.001,,cs.CL cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efficient distributed numerical word representation models (word embeddings)
combined with modern machine learning algorithms have recently yielded
considerable improvement on automatic document classification tasks. However,
the effectiveness of such techniques has not been assessed for the hierarchical
text classification (HTC) yet. This study investigates the application of those
models and algorithms on this specific problem by means of experimentation and
analysis. We trained classification models with prominent machine learning
algorithm implementations---fastText, XGBoost, SVM, and Keras' CNN---and
noticeable word embeddings generation methods---GloVe, word2vec, and
fastText---with publicly available data and evaluated them with measures
specifically appropriate for the hierarchical context. FastText achieved an
${}_{LCA}F_1$ of 0.893 on a single-labeled version of the RCV1 dataset. An
analysis indicates that using word embeddings and its flavors is a very
promising approach for HTC.
","[{'version': 'v1', 'created': 'Thu, 6 Sep 2018 00:31:51 GMT'}]",2018-09-07,"[['Stein', 'Roger A.', ''], ['Jaques', 'Patricia A.', ''], ['Valiati', 'Joao F.', '']]","['Hierarchical Text Classification', 'Word Embeddings', 'Gradient Tree Boosting', 'fastText', 'Support Vector Machines']"
1315,0909.5029,EPTCS,"Clemens Thielen, Sven O. Krumke",Complexity of Strong Implementability,,"EPTCS 4, 2009, pp. 1-12",10.4204/EPTCS.4.1,,cs.CC cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the question of implementability of a social choice function in a
classical setting where the preferences of finitely many selfish individuals
with private information have to be aggregated towards a social choice. This is
one of the central questions in mechanism design. If the concept of weak
implementation is considered, the Revelation Principle states that one can
restrict attention to truthful implementations and direct revelation
mechanisms, which implies that implementability of a social choice function is
easy to check. For the concept of strong implementation, however, the
Revelation Principle becomes invalid, and the complexity of deciding whether a
given social choice function is strongly implementable has been open so far. In
this paper, we show by using methods from polyhedral theory that strong
implementability of a social choice function can be decided in polynomial space
and that each of the payments needed for strong implementation can always be
chosen to be of polynomial encoding length. Moreover, we show that strong
implementability of a social choice function involving only a single selfish
individual can be decided in polynomial time via linear programming.
","[{'version': 'v1', 'created': 'Mon, 28 Sep 2009 07:59:23 GMT'}]",2009-09-29,"[['Thielen', 'Clemens', ''], ['Krumke', 'Sven O.', '']]","['computational complexity', 'algorithmic game theory', 'mechanism design', 'social choice']"
1316,1810.07884,Guotai Wang,"Guotai Wang, Wenqi Li, Sebastien Ourselin, Tom Vercauteren","Automatic Brain Tumor Segmentation using Convolutional Neural Networks
  with Test-Time Augmentation","12 pages, 3 figures, MICCAI BrainLes 2018",,10.1007/978-3-030-11726-9_6,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic brain tumor segmentation plays an important role for diagnosis,
surgical planning and treatment assessment of brain tumors. Deep convolutional
neural networks (CNNs) have been widely used for this task. Due to the
relatively small data set for training, data augmentation at training time has
been commonly used for better performance of CNNs. Recent works also
demonstrated the usefulness of using augmentation at test time, in addition to
training time, for achieving more robust predictions. We investigate how
test-time augmentation can improve CNNs' performance for brain tumor
segmentation. We used different underpinning network structures and augmented
the image by 3D rotation, flipping, scaling and adding random noise at both
training and test time. Experiments with BraTS 2018 training and validation set
show that test-time augmentation helps to improve the brain tumor segmentation
accuracy and obtain uncertainty estimation of the segmentation results.
","[{'version': 'v1', 'created': 'Thu, 18 Oct 2018 02:55:56 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Nov 2018 02:02:01 GMT'}]",2019-02-26,"[['Wang', 'Guotai', ''], ['Li', 'Wenqi', ''], ['Ourselin', 'Sebastien', ''], ['Vercauteren', 'Tom', '']]","['Brain tumor', 'convolutional neural network', 'segmentation', 'data augmentation']"
1317,1912.02854,Zhenhua Feng,"Tianyang Xu, Zhen-Hua Feng, Xiao-Jun Wu and Josef Kittler",An Accelerated Correlation Filter Tracker,,Pattern Recognition 102(2019) 107172,10.1016/j.patcog.2019.107172,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent visual object tracking methods have witnessed a continuous improvement
in the state-of-the-art with the development of efficient discriminative
correlation filters (DCF) and robust deep neural network features. Despite the
outstanding performance achieved by the above combination, existing advanced
trackers suffer from the burden of high computational complexity of the deep
feature extraction and online model learning. We propose an accelerated ADMM
optimisation method obtained by adding a momentum to the optimisation sequence
iterates, and by relaxing the impact of the error between DCF parameters and
their norm. The proposed optimisation method is applied to an innovative
formulation of the DCF design, which seeks the most discriminative spatially
regularised feature channels. A further speed up is achieved by an adaptive
initialisation of the filter optimisation process. The significantly increased
convergence of the DCF filter is demonstrated by establishing the optimisation
process equivalence with a continuous dynamical system for which the
convergence properties can readily be derived. The experimental results
obtained on several well-known benchmarking datasets demonstrate the efficiency
and robustness of the proposed ACFT method, with a tracking accuracy comparable
to the start-of-the-art trackers.
","[{'version': 'v1', 'created': 'Thu, 5 Dec 2019 20:03:38 GMT'}]",2020-06-02,"[['Xu', 'Tianyang', ''], ['Feng', 'Zhen-Hua', ''], ['Wu', 'Xiao-Jun', ''], ['Kittler', 'Josef', '']]","['Visual object tracking', 'discriminative correlation filters', 'accelerated optimisation', 'alternating direction method of multipliers']"
1318,1309.1842,Nicolas Trotignon,"Raphael C.S. Machado, Celina M.H. de Figueiredo, Nicolas Trotignon",Edge-colouring and total-colouring chordless graphs,,"R.C.S. Machado, C.M.H. de Figueiredo and N. Trotignon.
  Edge-colouring and total-colouring chordless graphs, Discrete Mathematics,
  313:1547-1552, 2013",10.1016/j.disc.2013.03.020,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A graph $G$ is \emph{chordless} if no cycle in $G$ has a chord. In the
present work we investigate the chromatic index and total chromatic number of
chordless graphs. We describe a known decomposition result for chordless graphs
and use it to establish that every chordless graph of maximum degree
$\Delta\geq 3$ has chromatic index $\Delta$ and total chromatic number $\Delta
+ 1$. The proofs are algorithmic in the sense that we actually output an
optimal colouring of a graph instance in polynomial time.
","[{'version': 'v1', 'created': 'Sat, 7 Sep 2013 08:54:39 GMT'}]",2013-09-10,"[['Machado', 'Raphael C. S.', ''], ['de Figueiredo', 'Celina M. H.', ''], ['Trotignon', 'Nicolas', '']]","['chordless graph', 'graph decomposition', 'edge-colouring', 'total-colouring']"
1319,1901.11286,Daniel Rodriguez,"Raul-Jose Palma-Mendoza and Luis de-Marcos and Daniel Rodriguez and
  Amparo Alonso-Betanzos",Distributed Correlation-Based Feature Selection in Spark,"25 pages, 5 figures",,10.1016/j.ins.2018.10.052,,cs.LG cs.DC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CFS (Correlation-Based Feature Selection) is an FS algorithm that has been
successfully applied to classification problems in many domains. We describe
Distributed CFS (DiCFS) as a completely redesigned, scalable, parallel and
distributed version of the CFS algorithm, capable of dealing with the large
volumes of data typical of big data applications. Two versions of the algorithm
were implemented and compared using the Apache Spark cluster computing model,
currently gaining popularity due to its much faster processing times than
Hadoop's MapReduce model. We tested our algorithms on four publicly available
datasets, each consisting of a large number of instances and two also
consisting of a large number of features. The results show that our algorithms
were superior in terms of both time-efficiency and scalability. In leveraging a
computer cluster, they were able to handle larger datasets than the
non-distributed WEKA version while maintaining the quality of the results,
i.e., exactly the same features were returned by our algorithms when compared
to the original algorithm available in WEKA.
","[{'version': 'v1', 'created': 'Thu, 31 Jan 2019 09:36:04 GMT'}]",2019-02-01,"[['Palma-Mendoza', 'Raul-Jose', ''], ['de-Marcos', 'Luis', ''], ['Rodriguez', 'Daniel', ''], ['Alonso-Betanzos', 'Amparo', '']]","['feature selection', 'scalability', 'big data', 'apache spark', 'cfs', 'correlation']"
1320,1302.6276,Lilian Weng,"Lilian Weng, Jacob Ratkiewicz, Nicola Perra, Bruno Gon\c{c}alves,
  Carlos Castillo, Francesco Bonchi, Rossano Schifanella, Filippo Menczer,
  Alessandro Flammini",The Role of Information Diffusion in the Evolution of Social Networks,"9 pages, 10 figures, 2 tables","Proc. 19th ACM SIGKDD Conference on Knowledge Discovery and Data
  Mining (KDD 2013)",,,cs.SI cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Every day millions of users are connected through online social networks,
generating a rich trove of data that allows us to study the mechanisms behind
human interactions. Triadic closure has been treated as the major mechanism for
creating social links: if Alice follows Bob and Bob follows Charlie, Alice will
follow Charlie. Here we present an analysis of longitudinal micro-blogging
data, revealing a more nuanced view of the strategies employed by users when
expanding their social circles. While the network structure affects the spread
of information among users, the network is in turn shaped by this communication
activity. This suggests a link creation mechanism whereby Alice is more likely
to follow Charlie after seeing many messages by Charlie. We characterize users
with a set of parameters associated with different link creation strategies,
estimated by a Maximum-Likelihood approach. Triadic closure does have a strong
effect on link formation, but shortcuts based on traffic are another key factor
in interpreting network evolution. However, individual strategies for following
other users are highly heterogeneous. Link creation behaviors can be summarized
by classifying users in different categories with distinct structural and
behavioral characteristics. Users who are popular, active, and influential tend
to create traffic-based shortcuts, making the information diffusion process
more efficient in the network.
","[{'version': 'v1', 'created': 'Mon, 25 Feb 2013 23:13:34 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Jun 2013 07:38:59 GMT'}]",2013-06-21,"[['Weng', 'Lilian', ''], ['Ratkiewicz', 'Jacob', ''], ['Perra', 'Nicola', ''], ['Gonçalves', 'Bruno', ''], ['Castillo', 'Carlos', ''], ['Bonchi', 'Francesco', ''], ['Schifanella', 'Rossano', ''], ['Menczer', 'Filippo', ''], ['Flammini', 'Alessandro', '']]","['Link creation', 'traffic', 'network evolution', 'information diffusion', 'shortcut', 'user behavior', 'social media', 'network structure']"
1321,1803.00989,Lilia Rodrigues Sampaio,"Lilia Sampaio, F\'abio Silva, Amanda Souza, Andrey Brito, Pascal
  Felber",Secure and Privacy-Aware Data Dissemination for Cloud-Based Applications,,,10.1145/3147213.3147230,,cs.DC cs.CR,http://creativecommons.org/licenses/by/4.0/,"  In this paper we propose a data dissemination platform that supports data
security and different privacy levels even when the platform and the data are
hosted by untrusted infrastructures. The proposed system aims at enabling an
application ecosystem that uses off-the-shelf trusted platforms (in this case,
Intel SGX), so that users may allow or disallow third parties to access the
live data stream with a specific sensitivity-level. Moreover, this approach
does not require users to manage the encryption keys directly. Our experiments
show that such an approach is indeed practical for medium scale systems, where
participants disseminate small volumes of data at a time, such as in smart
grids and IoT environments.
","[{'version': 'v1', 'created': 'Fri, 2 Mar 2018 18:40:13 GMT'}]",2018-03-05,"[['Sampaio', 'Lilia', ''], ['Silva', 'Fábio', ''], ['Souza', 'Amanda', ''], ['Brito', 'Andrey', ''], ['Felber', 'Pascal', '']]","['smart grids', 'privacy', 'Intel SGX', 'publish/subscribe']"
1322,1108.4942,Wolfgang Dvo\v{r}\'ak,"Wolfgang Dvo\v{r}\'ak, Sarah Alice Gaggl, Johannes Wallner, Stefan
  Woltran","Making Use of Advances in Answer-Set Programming for Abstract
  Argumentation Systems","Paper appears in the Proceedings of the 19th International Conference
  on Applications of Declarative Programming and Knowledge Management (INAP
  2011)",,10.1007/978-3-642-41524-1_7,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dung's famous abstract argumentation frameworks represent the core formalism
for many problems and applications in the field of argumentation which
significantly evolved within the last decade. Recent work in the field has thus
focused on implementations for these frameworks, whereby one of the main
approaches is to use Answer-Set Programming (ASP). While some of the
argumentation semantics can be nicely expressed within the ASP language, others
required rather cumbersome encoding techniques. Recent advances in ASP systems,
in particular, the metasp optimization frontend for the ASP-package
gringo/claspD provides direct commands to filter answer sets satisfying certain
subset-minimality (or -maximality) constraints. This allows for much simpler
encodings compared to the ones in standard ASP language. In this paper, we
experimentally compare the original encodings (for the argumentation semantics
based on preferred, semi-stable, and respectively, stage extensions) with new
metasp encodings. Moreover, we provide novel encodings for the recently
introduced resolution-based grounded semantics. Our experimental results
indicate that the metasp approach works well in those cases where the
complexity of the encoded problem is adequately mirrored within the metasp
approach.
","[{'version': 'v1', 'created': 'Wed, 24 Aug 2011 20:19:09 GMT'}]",2016-04-20,"[['Dvořák', 'Wolfgang', ''], ['Gaggl', 'Sarah Alice', ''], ['Wallner', 'Johannes', ''], ['Woltran', 'Stefan', '']]","['Abstract Argumentation', 'Answer-Set Programming', 'Metasp']"
1323,1808.05864,Daqing Liu,"Daqing Liu, Zheng-Jun Zha, Hanwang Zhang, Yongdong Zhang, Feng Wu",Context-Aware Visual Policy Network for Sequence-Level Image Captioning,"9 pages, 6 figures, ACM MM 2018 oral",,10.1145/3240508.3240632,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many vision-language tasks can be reduced to the problem of sequence
prediction for natural language output. In particular, recent advances in image
captioning use deep reinforcement learning (RL) to alleviate the ""exposure
bias"" during training: ground-truth subsequence is exposed in every step
prediction, which introduces bias in test when only predicted subsequence is
seen. However, existing RL-based image captioning methods only focus on the
language policy while not the visual policy (e.g., visual attention), and thus
fail to capture the visual context that are crucial for compositional reasoning
such as visual relationships (e.g., ""man riding horse"") and comparisons (e.g.,
""smaller cat""). To fill the gap, we propose a Context-Aware Visual Policy
network (CAVP) for sequence-level image captioning. At every time step, CAVP
explicitly accounts for the previous visual attentions as the context, and then
decides whether the context is helpful for the current word generation given
the current visual attention. Compared against traditional visual attention
that only fixes a single image region at every step, CAVP can attend to complex
visual compositions over time. The whole image captioning model --- CAVP and
its subsequent language policy network --- can be efficiently optimized
end-to-end by using an actor-critic policy gradient method with respect to any
caption evaluation metric. We demonstrate the effectiveness of CAVP by
state-of-the-art performances on MS-COCO offline split and online server, using
various metrics and sensible visualizations of qualitative visual context. The
code is available at https://github.com/daqingliu/CAVP
","[{'version': 'v1', 'created': 'Thu, 16 Aug 2018 11:45:45 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Aug 2018 20:54:31 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Aug 2018 13:32:28 GMT'}]",2018-08-23,"[['Liu', 'Daqing', ''], ['Zha', 'Zheng-Jun', ''], ['Zhang', 'Hanwang', ''], ['Zhang', 'Yongdong', ''], ['Wu', 'Feng', '']]","['image captioning', 'reinforcement learning', 'visual context', 'policynetwork']"
1324,1503.05702,Xianwen Wang,"Xianwen Wang, Chen Liu, Wenli Mao and Zhichao Fang","The Open Access Advantage Considering Citation, Article Usage and Social
  Media Attention","12 pages, 6 figures",,10.1007/s11192-015-1547-0,,cs.DL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, we compare the difference in the impact between open access
(OA) and non-open access (non-OA) articles. 1761 Nature Communications articles
published from 1 Jan. 2012 to 31 Aug. 2013 are selected as our research
objects, including 587 OA articles and 1174 non-OA articles. Citation data and
daily updated article-level metrics data are harvested directly from the
platform of nature.com. Data is analyzed from the static versus
temporal-dynamic perspectives. The OA citation advantage is confirmed, and the
OA advantage is also applicable when extending the comparing from citation to
article views and social media attention. More important, we find that OA
papers not only have the great advantage of total downloads, but also have the
feature of keeping sustained and steady downloads for a long time. For article
downloads, non-OA papers only have a short period of attention, when the
advantage of OA papers exists for a much longer time.
","[{'version': 'v1', 'created': 'Thu, 19 Mar 2015 10:41:22 GMT'}]",2015-03-20,"[['Wang', 'Xianwen', ''], ['Liu', 'Chen', ''], ['Mao', 'Wenli', ''], ['Fang', 'Zhichao', '']]","['Article-level metrics', 'usage metrics', 'Altmetrics', 'open access', 'social media attention', 'open access advantage']"
1325,1811.02666,Randi Wang,"Randi Wang, Vadim Shapiro",Topological Semantics for Lumped Parameter Systems Modeling,,"Advanced Engineering Informatics, 42, 100958 (2019)",10.1016/j.aei.2019.100958,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Behaviors of many engineering systems are described by lumped parameter
models that encapsulate the spatially distributed nature of the system into
networks of lumped elements; the dynamics of such a network is governed by a
system of ordinary differential and algebraic equations. Languages and
simulation tools for modeling such systems differ in syntax, informal
semantics, and in the methods by which such systems of equations are generated
and simulated, leading to numerous interoperability challenges. Logical
extensions of SysML aim specially at unifying a subset of the underlying
concepts in such languages. We propose to unify semantics of all such systems
using standard notions from algebraic topology. In particular, Tonti diagrams
classify all physical theories in terms of physical laws (topological and
constitutive) defined over a pair of dual cochain complexes and may be used to
describe different types of lumped parameter systems. We show that all possible
methods for generating the corresponding state equations within each physical
domain correspond to paths over Tonti diagrams. We further propose a
generalization of Tonti diagram that captures the behavior and supports
canonical generation of state equations for multi-domain lumped parameter
systems. The unified semantics provides a basis for greater interoperability in
systems modeling, supporting automated translation, integration, reuse, and
numerical simulation of models created in different authoring systems and
applications. Notably, the proposed algebraic topological semantics is also
compatible with spatially and temporally distributed models that are at the
core of modern CAD and CAE systems.
","[{'version': 'v1', 'created': 'Sun, 4 Nov 2018 22:59:17 GMT'}]",2019-12-04,"[['Wang', 'Randi', ''], ['Shapiro', 'Vadim', '']]","['Interoperability', 'Algebraic topology', 'System modeling languages; Tonti diagrams']"
1326,1607.00782,David Sanchez,"Malik Imran-Daud, David S\'anchez and Alexandre Viejo","Privacy-driven Access Control in Social Networks by Means of Automatic
  Semantic Annotation",,Computer Communications 76: 12-25 (2016),10.1016/j.comcom.2016.01.001,,cs.SI cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In online social networks (OSN), users quite usually disclose sensitive
information about themselves by publishing messages. At the same time, they are
(in many cases) unable to properly manage the access to this sensitive
information due to the following issues: i) the rigidness of the access control
mechanism implemented by the OSN, and ii) many users lack of technical
knowledge about data privacy and access control. To tackle these limitations,
in this paper, we propose a dynamic, transparent and privacy-driven access
control mechanism for textual messages published in OSNs. The notion of
privacy-driven is achieved by analyzing the semantics of the messages to be
published and, according to that, assessing the degree of sensitiveness of
their contents. For this purpose, the proposed system relies on an automatic
semantic annotation mechanism that, by using knowledge bases and linguistic
tools, is able to associate a meaning to the information to be published. By
means of this annotation, our mechanism automatically detects the information
that is sensitive according to the privacy requirements of the publisher of
data, with regard to the type of reader that may access such data. Finally, our
access control mechanism automatically creates sanitized versions of the users'
publications according to the type of reader that accesses them. As a result,
our proposal, which can be integrated in already existing social networks,
provides an automatic, seamless and content-driven protection of user
publications, which are coherent with her privacy requirements and the type of
readers that access them. Complementary to the system design, we also discuss
the feasibility of the system by illustrating it through a real example and
evaluate its accuracy and effectiveness over standard approaches.
","[{'version': 'v1', 'created': 'Mon, 4 Jul 2016 09:09:07 GMT'}]",2016-07-05,"[['Imran-Daud', 'Malik', ''], ['Sánchez', 'David', ''], ['Viejo', 'Alexandre', '']]","['Social Networks', 'Access Control', 'Semantic Annotation', 'Privacy']"
1327,1707.04027,"Peter Sch\""uller","Bernardo Cuteri, Carmine Dodaro, Francesco Ricca, Peter Sch\""uller","Constraints, Lazy Constraints, or Propagators in ASP Solving: An
  Empirical Analysis","Paper presented at the 33nd International Conference on Logic
  Programming (ICLP 2017), Melbourne, Australia, August 28 to September 1,
  2017. 16 pages","Theory and Practice of Logic Programming 17 (5-6), pages 780-799,
  2017",10.1017/S1471068417000254,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Answer Set Programming (ASP) is a well-established declarative paradigm. One
of the successes of ASP is the availability of efficient systems.
State-of-the-art systems are based on the ground+solve approach. In some
applications this approach is infeasible because the grounding of one or few
constraints is expensive. In this paper, we systematically compare alternative
strategies to avoid the instantiation of problematic constraints, that are
based on custom extensions of the solver. Results on real and synthetic
benchmarks highlight some strengths and weaknesses of the different strategies.
(Under consideration for acceptance in TPLP, ICLP 2017 Special Issue.)
","[{'version': 'v1', 'created': 'Thu, 13 Jul 2017 08:41:30 GMT'}]",2018-02-01,"[['Cuteri', 'Bernardo', ''], ['Dodaro', 'Carmine', ''], ['Ricca', 'Francesco', ''], ['Schüller', 'Peter', '']]","['Answer Set Programming', 'Lazy Grounding', 'Propagators']"
1328,2102.04763,Lukas Daniel Klausner,"Djordje Slijep\v{c}evi\'c, Maximilian Henzl, Lukas Daniel Klausner,
  Tobias Dam, Peter Kieseberg, Matthias Zeppelzauer","$k$-Anonymity in Practice: How Generalisation and Suppression Affect
  Machine Learning Classifiers","48 pages, 38 figures","Comput. Secur. 111, 2021",10.1016/j.cose.2021.102488,,cs.LG cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The protection of private information is a crucial issue in data-driven
research and business contexts. Typically, techniques like anonymisation or
(selective) deletion are introduced in order to allow data sharing, e. g. in
the case of collaborative research endeavours. For use with anonymisation
techniques, the $k$-anonymity criterion is one of the most popular, with
numerous scientific publications on different algorithms and metrics.
Anonymisation techniques often require changing the data and thus necessarily
affect the results of machine learning models trained on the underlying data.
In this work, we conduct a systematic comparison and detailed investigation
into the effects of different $k$-anonymisation algorithms on the results of
machine learning models. We investigate a set of popular $k$-anonymisation
algorithms with different classifiers and evaluate them on different real-world
datasets. Our systematic evaluation shows that with an increasingly strong
$k$-anonymity constraint, the classification performance generally degrades,
but to varying degrees and strongly depending on the dataset and anonymisation
method. Furthermore, Mondrian can be considered as the method with the most
appealing properties for subsequent classification.
","[{'version': 'v1', 'created': 'Tue, 9 Feb 2021 11:28:20 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Jun 2022 07:13:36 GMT'}]",2022-06-23,"[['Slijepčević', 'Djordje', ''], ['Henzl', 'Maximilian', ''], ['Klausner', 'Lukas Daniel', ''], ['Dam', 'Tobias', ''], ['Kieseberg', 'Peter', ''], ['Zeppelzauer', 'Matthias', '']]","['k-anonymity', 'machine learning', 'anonymisation', 'generalisation', 'suppression']"
1329,2002.02362,Runsheng Xu,"Andi Zang, Runsheng Xu, Zichen Li, David Doria",Lane Boundary Geometry Extraction from Satellite Imagery,,"In Proceedings of the 1st ACM SIGSPATIAL Workshop on
  High-Precision Maps and Intelligent Applications for Autonomous Vehicles,
  page 1. ACM, 2017",10.1145/3149092.3149093,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autonomous driving car is becoming more of a reality, as a key
component,high-definition(HD) maps shows its value in both market place and
industry. Even though HD maps generation from LiDAR or stereo/perspective
imagery has achieved impressive success, its inherent defects cannot be
ignored. In this paper, we proposal a novel method for Highway HD maps modeling
using pixel-wise segmentation on satellite imagery and formalized hypotheses
linking, which is cheaper and faster than current HD maps modeling approaches
from LiDAR point cloud and perspective view imagery, and let it becomes an
ideal complementary of state of the art. We also manual code/label an HD road
model dataset as ground truth, aligned with Bing tile image server, to train,
test and evaluate our methodology. This dataset will be publish at same time to
contribute research in HD maps modeling from aerial imagery.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2020 17:10:35 GMT'}]",2020-02-07,"[['Zang', 'Andi', ''], ['Xu', 'Runsheng', ''], ['Li', 'Zichen', ''], ['Doria', 'David', '']]","['HD Maps', 'lane boundary geometry', 'satellite image processing']"
1330,1903.11621,Xin-She Yang,"Nunzia Palmieri, Xin-She Yang, Floriano De Rango, Amilcare Francesco
  Santamaria","Self-adaptive decision-making mechanisms to balance the execution of
  multiple tasks for a multi-robots team",40 pages,"Neurocomputing, vol. 306, 17-36 (2018)",10.1016/j.neucom.2018.03.038,,cs.RO cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work addresses the coordination problem of multiple robots with the goal
of finding specific hazardous targets in an unknown area and dealing with them
cooperatively. The desired behaviour for the robotic system entails multiple
requirements, which may also be conflicting. The paper presents the problem as
a constrained bi-objective optimization problem in which mobile robots must
perform two specific tasks of exploration and at same time cooperation and
coordination for disarming the hazardous targets. These objectives are opposed
goals, in which one may be favored, but only at the expense of the other.
Therefore, a good trade-off must be found. For this purpose, a nature-inspired
approach and an analytical mathematical model to solve this problem considering
a single equivalent weighted objective function are presented. The results of
proposed coordination model, simulated in a two dimensional terrain, are showed
in order to assess the behaviour of the proposed solution to tackle this
problem. We have analyzed the performance of the approach and the influence of
the weights of the objective function under different conditions: static and
dynamic. In this latter situation, the robots may fail under the stringent
limited budget of energy or for hazardous events. The paper concludes with a
critical discussion of the experimental results.
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2019 18:01:59 GMT'}]",2019-03-29,"[['Palmieri', 'Nunzia', ''], ['Yang', 'Xin-She', ''], ['De Rango', 'Floriano', ''], ['Santamaria', 'Amilcare Francesco', '']]","['Multi-Robot Systems', 'Bi-criteria Optimization Model', 'Nature-Inspired Algorithms', 'Self-Coordination of Multiple Robots', 'Hazardous Environment']"
1331,1711.07208,Yelena Mejova,"Yelena Mejova, Youcef Benkhedda, Khairani",#Halal Culture on Instagram,,,10.3389/fdigh.2017.00021,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Halal is a notion that applies to both objects and actions, and means
permissible according to Islamic law. It may be most often associated with food
and the rules of selecting, slaughtering, and cooking animals. In the
globalized world, halal can be found in street corners of New York and beauty
shops of Manila. In this study, we explore the cultural diversity of the
concept, as revealed through social media, and specifically the way it is
expressed by different populations around the world, and how it relates to
their perception of (i) religious and (ii) governmental authority, and (iii)
personal health. Here, we analyze two Instagram datasets, using Halal in Arabic
(325,665 posts) and in English (1,004,445 posts), which provide a global view
of major Muslim populations around the world. We find a great variety in the
use of halal within Arabic, English, and Indonesian-speaking populations, with
animal trade emphasized in first (making up 61% of the language's stream), food
in second (80%), and cosmetics and supplements in third (70%). The
commercialization of the term halal is a powerful signal of its detraction from
its traditional roots. We find a complex social engagement around posts
mentioning religious terms, such that when a food-related post is accompanied
by a religious term, it on average gets more likes in English and Indonesian,
but not in Arabic, indicating a potential shift out of its traditional moral
framing.
","[{'version': 'v1', 'created': 'Mon, 20 Nov 2017 08:59:12 GMT'}]",2017-11-21,"[['Mejova', 'Yelena', ''], ['Benkhedda', 'Youcef', ''], ['Khairani', '', '']]","['Halal', 'Culture', 'Religion', 'Health', 'Instagram', 'Social Media']"
1332,2102.06527,Francesco Sanna Passino,"Francesco Sanna Passino, Nicholas A. Heard",Mutually exciting point process graphs for modelling dynamic networks,,"Journal of Computational and Graphical Statistics, 2022
  (forthcoming)",10.1080/10618600.2022.2096048,,cs.SI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new class of models for dynamic networks is proposed, called mutually
exciting point process graphs (MEG). MEG is a scalable network-wide statistical
model for point processes with dyadic marks, which can be used for anomaly
detection when assessing the significance of future events, including
previously unobserved connections between nodes. The model combines mutually
exciting point processes to estimate dependencies between events and latent
space models to infer relationships between the nodes. The intensity functions
for each network edge are characterised exclusively by node-specific
parameters, which allows information to be shared across the network. This
construction enables estimation of intensities even for unobserved edges, which
is particularly important in real world applications, such as computer networks
arising in cyber-security. A recursive form of the log-likelihood function for
MEG is obtained, which is used to derive fast inferential procedures via modern
gradient ascent algorithms. An alternative EM algorithm is also derived. The
model and algorithms are tested on simulated graphs and real world datasets,
demonstrating excellent performance.
","[{'version': 'v1', 'created': 'Thu, 11 Feb 2021 10:14:55 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Nov 2021 11:07:33 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Dec 2021 15:13:36 GMT'}]",2022-07-12,"[['Passino', 'Francesco Sanna', ''], ['Heard', 'Nicholas A.', '']]","['dynamic network', 'Hawkes process', 'self-exciting process', 'statistical cyber-security']"
1333,1812.07847,Giovanni Abramo,"Giovanni Abramo, Ciriaco Andrea D'Angelo, Flavia Di Costa",Research collaboration and productivity: is there correlation?,,"Abramo, G., D'Angelo, C.A., Di Costa, F. (2009). Research
  collaboration and productivity: is there correlation? Higher Education,
  57(2), 155-171",10.1007/s10734-008-9139-z,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The incidence of extramural collaboration in academic research activities is
increasing as a result of various factors. These factors include policy
measures aimed at fostering partnership and networking among the various
components of the research system, policies which are in turn justified by the
idea that knowledge sharing could increase the effectiveness of the system.
Over the last two decades, the scientific community has also stepped up
activities to assess the actual impact of collaboration intensity on the
performance of research systems. This study draws on a number of empirical
analyses, with the intention of measuring the effects of extramural
collaboration on research performance and, indirectly, verifying the legitimacy
of policies that support this type of collaboration. The analysis focuses on
the Italian academic research system. The aim of the work is to assess the
level of correlation, at institutional level, between scientific productivity
and collaboration intensity as a whole, both internationally and with private
organizations. This will be carried out using a bibliometric type of approach,
which equates collaboration with the co-authorship of scientific publications.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2018 09:52:48 GMT'}]",2018-12-20,"[['Abramo', 'Giovanni', ''], [""D'Angelo"", 'Ciriaco Andrea', ''], ['Di Costa', 'Flavia', '']]","['Research collaboration', 'productivity', 'universities', 'bibliometrics']"
1334,1808.08066,Quanyan Zhu,"Quanyan Zhu, Stefan Rass",Game Theory Meets Network Security: A Tutorial at ACM CCS,,,10.1145/3243734.3264421,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  The increasingly pervasive connectivity of today's information systems brings
up new challenges to security. Traditional security has accomplished a long way
toward protecting well-defined goals such as confidentiality, integrity,
availability, and authenticity. However, with the growing sophistication of the
attacks and the complexity of the system, the protection using traditional
methods could be cost-prohibitive. A new perspective and a new theoretical
foundation are needed to understand security from a strategic and
decision-making perspective. Game theory provides a natural framework to
capture the adversarial and defensive interactions between an attacker and a
defender. It provides a quantitative assessment of security, prediction of
security outcomes, and a mechanism design tool that can enable
security-by-design and reverse the attacker's advantage. This tutorial provides
an overview of diverse methodologies from game theory that includes games of
incomplete information, dynamic games, mechanism design theory to offer a
modern theoretic underpinning of a science of cybersecurity. The tutorial will
also discuss open problems and research challenges that the CCS community can
address and contribute with an objective to build a multidisciplinary bridge
between cybersecurity, economics, game and decision theory.
","[{'version': 'v1', 'created': 'Fri, 24 Aug 2018 09:46:22 GMT'}]",2018-08-27,"[['Zhu', 'Quanyan', ''], ['Rass', 'Stefan', '']]","['Game theory', 'Network security', 'Defense strategy', 'Mechanism design', 'Decision theory', 'Security economics']"
1335,0906.3896,Panos Giannopoulos,"Panos Giannopoulos, Christian Knauer, Gunter Rote, Daniel Werner",Fixed-parameter tractability and lower bounds for stabbing problems,"Based on the MSc. Thesis of Daniel Werner, Free University Berlin,
  Berlin, Germany","Computational Geometry, Theory and Applications 46 (2013),
  839-860. Special issue for the 25th European Workshop on Computational
  Geometry (EuroCG'09)",10.1016/j.comgeo.2011.06.005,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the following general stabbing problem from a parameterized
complexity point of view: Given a set $\mathcal S$ of $n$ translates of an
object in $\Rd$, find a set of $k$ lines with the property that every object in
$\mathcal S$ is ''stabbed'' (intersected) by at least one line.
  We show that when $S$ consists of axis-parallel unit squares in $\Rtwo$ the
(decision) problem of stabbing $S$ with axis-parallel lines is W[1]-hard with
respect to $k$ (and thus, not fixed-parameter tractable unless FPT=W[1]) while
it becomes fixed-parameter tractable when the squares are disjoint. We also
show that the problem of stabbing a set of disjoint unit squares in $\Rtwo$
with lines of arbitrary directions is W[1]--hard with respect to $k$. Several
generalizations to other types of objects and lines with arbitrary directions
are also presented. Finally, we show that deciding whether a set of unit balls
in $\Rd$ can be stabbed by one line is W[1]--hard with respect to the dimension
$d$.
","[{'version': 'v1', 'created': 'Sun, 21 Jun 2009 20:50:58 GMT'}]",2015-02-18,"[['Giannopoulos', 'Panos', ''], ['Knauer', 'Christian', ''], ['Rote', 'Gunter', ''], ['Werner', 'Daniel', '']]","['geometric stabbing', 'minimum enclosing cylinder', 'lower bounds', 'fixed-parametertractability']"
1336,2009.09132,Jieh-Sheng Lee,Jieh-Sheng Lee and Jieh Hsiang,Prior Art Search and Reranking for Generated Patent Text,"7 pages, 3 figures, 1 table","The 2nd Workshop on Patent Text Mining and Semantic Technologies
  (PatentSemTech2021) co-located with the 44th International ACM SIGIR
  Conference on Research and Development in Information Retrieval",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generative models, such as GPT-2, have demonstrated impressive results
recently. A fundamental question we'd like to address is: where did the
generated text come from? This work is our initial effort toward answering the
question by using prior art search. The purpose of the prior art search is to
find the most similar prior text in the training data of GPT-2. We take a
reranking approach and apply it to the patent domain. Specifically, we
pre-train GPT-2 models from scratch by using the patent data from the USPTO.
The input for the prior art search is the patent text generated by the GPT-2
model. We also pre-trained BERT models from scratch for converting patent text
to embeddings. The steps of reranking are: (1) search the most similar text in
the training data of GPT-2 by taking a bag-of-word ranking approach (BM25), (2)
convert the search results in text format to BERT embeddings, and (3) provide
the final result by ranking the BERT embeddings based on their similarities
with the patent text generated by GPT-2. The experiments in this work show that
such reranking is better than ranking with embeddings alone. However, our mixed
results also indicate that calculating the semantic similarities among long
text spans is still challenging. To our knowledge, this work is the first to
implement a reranking system to identify retrospectively the most similar
inputs to a GPT model based on its output.
","[{'version': 'v1', 'created': 'Sat, 19 Sep 2020 01:16:18 GMT'}, {'version': 'v2', 'created': 'Sun, 18 Jul 2021 06:07:21 GMT'}]",2021-07-20,"[['Lee', 'Jieh-Sheng', ''], ['Hsiang', 'Jieh', '']]","['patent', 'natural language generation', 'natural language processing', 'deep learning', 'semantic search']"
1337,1404.6823,Joshua Garland,"Joshua Garland, Ryan James, Elizabeth Bradley",Model-free quantification of time-series predictability,"23 pages, 8 figures, 1 table","Physical Review E 90 (5), 052910 (2014)",10.1103/PhysRevE.90.052910,Santa Fe Institute Working Paper #14-05-014,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper provides insight into when, why, and how forecast strategies fail
when they are applied to complicated time series. We conjecture that the
inherent complexity of real-world time-series data---which results from the
dimension, nonlinearity, and non-stationarity of the generating process, as
well as from measurement issues like noise, aggregation, and finite data
length---is both empirically quantifiable and directly correlated with
predictability. In particular, we argue that redundancy is an effective way to
measure complexity and predictive structure in an experimental time series and
that weighted permutation entropy is an effective way to estimate that
redundancy. To validate these conjectures, we study 120 different time-series
data sets. For each time series, we construct predictions using a wide variety
of forecast models, then compare the accuracy of the predictions with the
permutation entropy of that time series. We use the results to develop a
model-free heuristic that can help practitioners recognize when a particular
prediction method is not well matched to the task at hand: that is, when the
time series has more predictive structure than that method can capture and
exploit.
","[{'version': 'v1', 'created': 'Sun, 27 Apr 2014 20:29:23 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Aug 2014 21:02:04 GMT'}]",2014-11-24,"[['Garland', 'Joshua', ''], ['James', 'Ryan', ''], ['Bradley', 'Elizabeth', '']]","['entropy', 'permutation entropy', 'weighted permutation entropy', 'time-series analysis', 'predictability']"
1338,1301.2474,Aur\'elie Lagoutte,"Nicolas Bousquet, Aur\'elie Lagoutte and St\'ephan Thomass\'e",Clique versus Independent Set,,"European Journal of Combinatorics, 40:73-92, 2014",10.1016/j.ejc.2014.02.003,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Yannakakis' Clique versus Independent Set problem (CL-IS) in communication
complexity asks for the minimum number of cuts separating cliques from stable
sets in a graph, called CS-separator. Yannakakis provides a quasi-polynomial
CS-separator, i.e. of size $O(n^{\log n})$, and addresses the problem of
finding a polynomial CS-separator. This question is still open even for perfect
graphs. We show that a polynomial CS-separator almost surely exists for random
graphs. Besides, if H is a split graph (i.e. has a vertex-partition into a
clique and a stable set) then there exists a constant $c_H$ for which we find a
$O(n^{c_H})$ CS-separator on the class of H-free graphs. This generalizes a
result of Yannakakis on comparability graphs. We also provide a $O(n^{c_k})$
CS-separator on the class of graphs without induced path of length k and its
complement. Observe that on one side, $c_H$ is of order $O(|H| \log |H|)$
resulting from Vapnik-Chervonenkis dimension, and on the other side, $c_k$ is
exponential.
  One of the main reason why Yannakakis' CL-IS problem is fascinating is that
it admits equivalent formulations. Our main result in this respect is to show
that a polynomial CS-separator is equivalent to the polynomial
Alon-Saks-Seymour Conjecture, asserting that if a graph has an edge-partition
into k complete bipartite graphs, then its chromatic number is polynomially
bounded in terms of k. We also show that the classical approach to the stubborn
problem (arising in CSP) which consists in covering the set of all solutions by
$O(n^{\log n})$ instances of 2-SAT is again equivalent to the existence of a
polynomial CS-separator.
","[{'version': 'v1', 'created': 'Fri, 11 Jan 2013 12:22:54 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Mar 2013 12:48:43 GMT'}, {'version': 'v3', 'created': 'Fri, 27 Jun 2014 08:04:22 GMT'}]",2014-06-30,"[['Bousquet', 'Nicolas', ''], ['Lagoutte', 'Aurélie', ''], ['Thomassé', 'Stéphan', '']]","['Clique-Stable separation', 'Alon-Saks-Seymour conjecture', 'stubborn problem', 'random graphs', 'split-free graphs', 'Pk-free graphs']"
1339,1608.03127,EPTCS,"Sanjiva Prasad (Indian Institute of Technology Delhi), Lenore D. Zuck
  (University of Illinois at Chicago)",Self-Similarity Breeds Resilience,"In Proceedings EXPRESS/SOS 2016, arXiv:1608.02692","EPTCS 222, 2016, pp. 30-44",10.4204/EPTCS.222.3,,cs.PL cs.LO cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-similarity is the property of a system being similar to a part of
itself. We posit that a special class of behaviourally self-similar systems
exhibits a degree of resilience to adversarial behaviour. We formalise the
notions of system, adversary and resilience in operational terms, based on
transition systems and observations. While the general problem of proving
systems to be behaviourally self-similar is undecidable, we show, by casting
them in the framework of well-structured transition systems, that there is an
interesting class of systems for which the problem is decidable. We illustrate
our prescriptive framework for resilience with some small examples, e.g.,
systems robust to failures in a fail-stop model, and those avoiding
side-channel attacks.
","[{'version': 'v1', 'created': 'Wed, 10 Aug 2016 11:10:49 GMT'}]",2016-08-11,"[['Prasad', 'Sanjiva', '', 'Indian Institute of Technology Delhi'], ['Zuck', 'Lenore D.', '', 'University of Illinois at Chicago']]","['Behavioural self-similarity', 'resilience', 'adversary', 'context', 'barbs', 'bisimulation', 'wellstructured transition systems', 'fault-tolerance']"
1340,1806.10906,Jason R.C. Nurse Dr,"Jason R.C. Nurse and Petar Radanliev and Sadie Creese and David De
  Roure","If you can't understand it, you can't properly assess it! The reality of
  assessing security risks in Internet of Things systems","9 pages, 1 figure","IET Living in the Internet of Things: Cybersecurity of the IoT
  Conference 2018",10.1049/cp.2018.0001,,cs.CR cs.CY cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security risk assessment methods have served us well over the last two
decades. As the complexity, pervasiveness and automation of technology systems
increases, particularly with the Internet of Things (IoT), there is a
convincing argument that we will need new approaches to assess risk and build
system trust. In this article, we report on a series of scoping workshops and
interviews with industry professionals (experts in enterprise systems, IoT and
risk) conducted to investigate the validity of this argument. Additionally, our
research aims to consult with these professionals to understand two crucial
aspects. Firstly, we seek to identify the wider concerns in adopting IoT
systems into a corporate environment, be it a smart manufacturing shop floor or
a smart office. Secondly, we investigate the key challenges for approaches in
industry that attempt to effectively and efficiently assess cyber-risk in the
IoT.
","[{'version': 'v1', 'created': 'Thu, 28 Jun 2018 12:07:12 GMT'}]",2018-06-29,"[['Nurse', 'Jason R. C.', ''], ['Radanliev', 'Petar', ''], ['Creese', 'Sadie', ''], ['De Roure', 'David', '']]","['risk assessment', 'security', 'internet of things', 'coupled systems', 'industry workshops and studies', 'stakeholder anduser engagement']"
1341,1608.03984,Mathias Louboutin,"Mathias Louboutin, Michael Lange, Felix Herrmann, Navjot Kukreja, and
  Gerard Gorman","Performance prediction of finite-difference solvers for different
  computer architectures",,Computer & Geoscience (2017) 148-157; Volume 105,10.1016/j.cageo.2017.04.014,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The life-cycle of a partial differential equation (PDE) solver is often
characterized by three development phases: the development of a stable
numerical discretization, development of a correct (verified) implementation,
and the optimization of the implementation for different computer
architectures. Often it is only after significant time and effort has been
invested that the performance bottlenecks of a PDE solver are fully understood,
and the precise details varies between different computer architectures. One
way to mitigate this issue is to establish a reliable performance model that
allows a numerical analyst to make reliable predictions of how well a numerical
method would perform on a given computer architecture, before embarking upon
potentially long and expensive implementation and optimization phases. The
availability of a reliable performance model also saves developer effort as it
both informs the developer on what kind of optimisations are beneficial, and
when the maximum expected performance has been reached and optimisation work
should stop. We show how discretization of a wave equation can be theoretically
studied to understand the performance limitations of the method on modern
computer architectures. We focus on the roofline model, now broadly used in the
high-performance computing community, which considers the achievable
performance in terms of the peak memory bandwidth and peak floating point
performance of a computer with respect to algorithmic choices. A first
principles analysis of operational intensity for key time-stepping
finite-difference algorithms is presented. With this information available at
the time of algorithm design, the expected performance on target computer
systems can be used as a driver for algorithm design.
","[{'version': 'v1', 'created': 'Sat, 13 Aug 2016 13:57:14 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Mar 2017 22:26:22 GMT'}, {'version': 'v3', 'created': 'Tue, 18 Apr 2017 22:35:12 GMT'}]",2017-06-07,"[['Louboutin', 'Mathias', ''], ['Lange', 'Michael', ''], ['Herrmann', 'Felix', ''], ['Kukreja', 'Navjot', ''], ['Gorman', 'Gerard', '']]","['Finite-differences', 'HPC', 'Modelling', 'Multi-physics', 'Performance', 'Wave-equation']"
1342,1807.04035,Jerome Darmont,"Iuri Nogueira (UL2), Maram Romdhane (UL2), J\'er\^ome Darmont (ERIC)",Modeling Data Lake Metadata with a Data Vault,,"22nd International Database Engineering & Applications Symposium
  (IDEAS 2018), Jun 2018, Villa San Giovanni, Italy. ACM, pp.253-261, 2018,
  http://confsys.encs.concordia.ca/IDEAS/ideas18/ideas18.php",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rise of big data, business intelligence had to find solutions for
managing even greater data volumes and variety than in data warehouses, which
proved ill-adapted. Data lakes answer these needs from a storage point of view,
but require managing adequate metadata to guarantee an efficient access to
data. Starting from a multidimensional metadata model designed for an
industrial heritage data lake presenting a lack of schema evolutivity, we
propose in this paper to use ensemble modeling, and more precisely a data
vault, to address this issue. To illustrate the feasibility of this approach,
we instantiate our metadata conceptual model into relational and
document-oriented logical and physical models, respectively. We also compare
the physical models in terms of metadata storage and query response time.
","[{'version': 'v1', 'created': 'Wed, 11 Jul 2018 09:36:34 GMT'}]",2018-07-12,"[['Nogueira', 'Iuri', '', 'UL2'], ['Romdhane', 'Maram', '', 'UL2'], ['Darmont', 'Jérôme', '', 'ERIC']]","['Big data', 'Data lake', 'Metadata management', 'Ensemble modeling', 'Data vault']"
1343,2112.02758,Yiming Tang,"Yiming Tang, Allan Spektor, Raffi Khatchadourian, Mehdi Bagherzadeh","A Tool for Rejuvenating Feature Logging Levels via Git Histories and
  Degree of Interest","4 pages, ICSE '22 (tool demo track)","International Conference on Software Engineering, ICSE 2022.
  ACM/IEEE, ACM, May 2022",10.1109/ICSE-Companion55297.2022.9793736,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Logging is a significant programming practice. Due to the highly
transactional nature of modern software applications, massive amount of logs
are generated every day, which may overwhelm developers. Logging information
overload can be dangerous to software applications. Using log levels,
developers can print the useful information while hiding the verbose logs
during software runtime. As software evolves, the log levels of logging
statements associated with the surrounding software feature implementation may
also need to be altered. Maintaining log levels necessitates a significant
amount of manual effort. In this paper, we demonstrate an automated approach
that can rejuvenate feature log levels by matching the interest level of
developers in the surrounding features. The approach is implemented as an
open-source Eclipse plugin, using two external plug-ins (JGit and Mylyn). It
was tested on 18 open-source Java projects consisting of ~3 million lines of
code and ~4K log statements. Our tool successfully analyzes 99.22% of logging
statements, increases log level distributions by ~20%, and increases the focus
of logs in bug fix contexts ~83% of the time. For further details, interested
readers can watch our demonstration video
(https://www.youtube.com/watch?v=qIULoAXoDv4).
","[{'version': 'v1', 'created': 'Mon, 6 Dec 2021 03:19:20 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Feb 2022 15:11:39 GMT'}]",2022-07-20,"[['Tang', 'Yiming', ''], ['Spektor', 'Allan', ''], ['Khatchadourian', 'Raffi', ''], ['Bagherzadeh', 'Mehdi', '']]","['logging', 'software evolution', 'software repository mining', 'sourcecode analysis and transformation', 'degree of interest']"
1344,1503.04375,Xiao Zhang,"Xiao Zhang, Kan Fang, Gregory Francis",Optimization of Switch Keyboards,"In Proceedings of the 15th International ACM SIGACCESS Conference on
  Computers and Accessibility 2013",,10.1145/2513383.2513394,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Patients with motor control difficulties often ""type"" on a computer using a
switch keyboard to guide a scanning cursor to text elements. We show how to
optimize some parts of the design of switch keyboards by casting the design
problem as mixed integer programming. A new algorithm to find an optimized
design solution is approximately 3600 times faster than a previous algorithm,
which was also susceptible to finding a non-optimal solution. The optimization
requires a model of the probability of an entry error, and we show how to build
such a model from experimental data. Example optimized keyboards are
demonstrated.
","[{'version': 'v1', 'created': 'Sun, 15 Mar 2015 02:48:08 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Mar 2015 01:05:42 GMT'}]",2015-03-18,"[['Zhang', 'Xiao', ''], ['Fang', 'Kan', ''], ['Francis', 'Gregory', '']]","['“Locked-in” Patients', 'Switch Keyboard', 'Mixed Integer Programming']"
1345,1607.01539,Lars Hupel,Lars Hupel and Viktor Kuncak,Translating Scala Programs to Isabelle/HOL,"International Joint Conference on Automated Reasoning, 2016","IJCAR 2016: Automated Reasoning Volume 9706 of the series Lecture
  Notes in Computer Science pp 568-577, Springer",10.1007/978-3-319-40229-1_38,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a trustworthy connection between the Leon verification system and
the Isabelle proof assistant. Leon is a system for verifying functional Scala
programs. It uses a variety of automated theorem provers (ATPs) to check
verification conditions (VCs) stemming from the input program. Isabelle, on the
other hand, is an interactive theorem prover used to verify mathematical
specifications using its own input language Isabelle/Isar. Users specify
(inductive) definitions and write proofs about them manually, albeit with the
help of semi-automated tactics. The integration of these two systems allows us
to exploit Isabelle's rich standard library and give greater confidence
guarantees in the correctness of analysed programs.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2016 09:39:33 GMT'}]",2016-07-07,"[['Hupel', 'Lars', ''], ['Kuncak', 'Viktor', '']]","['Isabelle', 'HOL', 'Scala', 'Leon', 'compiler']"
1346,1604.02334,Uldis Locans,"Uldis Locans, Andreas Adelmann, Andreas Suter, Jannis Fischer, Werner
  Lustermann, Gunther Dissertori, Qiulin Wang","Real-Time Computation of Parameter Fitting and Image Reconstruction
  Using Graphical Processing Units",,,10.1016/j.cpc.2017.02.007,,cs.DC physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years graphical processing units (GPUs) have become a powerful tool
in scientific computing. Their potential to speed up highly parallel
applications brings the power of high performance computing to a wider range of
users. However, programming these devices and integrating their use in existing
applications is still a challenging task.
  In this paper we examined the potential of GPUs for two different
applications. The first application, created at Paul Scherrer Institut (PSI),
is used for parameter fitting during data analysis of muSR (muon spin rotation,
relaxation and resonance) experiments. The second application, developed at
ETH, is used for PET (Positron Emission Tomography) image reconstruction and
analysis. Applications currently in use were examined to identify parts of the
algorithms in need of optimization. Efficient GPU kernels were created in order
to allow applications to use a GPU, to speed up the previously identified
parts. Benchmarking tests were performed in order to measure the achieved
speedup
  During this work, we focused on single GPU systems to show that real time
data analysis of these problems can be achieved without the need for large
computing clusters. The results show that the currently used application for
parameter fitting, which uses OpenMP to parallelize calculations over multiple
CPU cores, can be accelerated around 40 times through the use of a GPU. The
speedup may vary depending on the size and complexity of the problem. For PET
image analysis, the obtained speedups of the GPU version was more than x40
larger compared to a single core CPU implementation. The achieved results show
that it is possible to improve the execution time by orders of magnitude.
","[{'version': 'v1', 'created': 'Fri, 8 Apr 2016 12:47:47 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Nov 2016 14:49:44 GMT'}]",2017-04-26,"[['Locans', 'Uldis', ''], ['Adelmann', 'Andreas', ''], ['Suter', 'Andreas', ''], ['Fischer', 'Jannis', ''], ['Lustermann', 'Werner', ''], ['Dissertori', 'Gunther', ''], ['Wang', 'Qiulin', '']]","['GPU', 'CUDA', 'Musrfit', 'PET', 'Image reconstruction']"
1347,1301.1897,Nargess Memarsadeghi,"Nargess Memarsadeghi, Jacqueline Le Moigne, Peter N. Blake, Peter A.
  Morey, Wayne B. Landsman, Victor J. Chambers, Samuel H. Moseley",Image Registration for Stability Testing of MEMS,"Proceedings of 2011 IS&T/SPIE Electronic Imaging, Computational
  Imaging IX Conference, San Francisco, CA, January 2011, Vol. 7873, 78730G-1:7",,10.1117/12.872076,,cs.CV astro-ph.IM,http://creativecommons.org/licenses/publicdomain/,"  Image registration, or alignment of two or more images covering the same
scenes or objects, is of great interest in many disciplines such as remote
sensing, medical imaging, astronomy, and computer vision. In this paper, we
introduce a new application of image registration algorithms. We demonstrate
how through a wavelet based image registration algorithm, engineers can
evaluate stability of Micro-Electro-Mechanical Systems (MEMS). In particular,
we applied image registration algorithms to assess alignment stability of the
MicroShutters Subsystem (MSS) of the Near Infrared Spectrograph (NIRSpec)
instrument of the James Webb Space Telescope (JWST). This work introduces a new
methodology for evaluating stability of MEMS devices to engineers as well as a
new application of image registration algorithms to computer scientists.
","[{'version': 'v1', 'created': 'Wed, 9 Jan 2013 15:49:26 GMT'}]",2013-01-10,"[['Memarsadeghi', 'Nargess', ''], ['Moigne', 'Jacqueline Le', ''], ['Blake', 'Peter N.', ''], ['Morey', 'Peter A.', ''], ['Landsman', 'Wayne B.', ''], ['Chambers', 'Victor J.', ''], ['Moseley', 'Samuel H.', '']]","['Image registration', 'wavelet transformation', 'Micro-Electro-Mechanical Systems (MEMS)', 'Microshutters', 'James Webb Space Telescope (JWST)']"
1348,1907.06912,Alexander Hagg,"Alexander Hagg, Alexander Asteroth, Thomas B\""ack",Modeling User Selection in Quality Diversity,,,10.1145/3321707.3321823,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The initial phase in real world engineering optimization and design is a
process of discovery in which not all requirements can be made in advance, or
are hard to formalize. Quality diversity algorithms, which produce a variety of
high performing solutions, provide a unique chance to support engineers and
designers in the search for what is possible and high performing. In this work
we begin to answer the question how a user can interact with quality diversity
and turn it into an interactive innovation aid. By modeling a user's selection
it can be determined whether the optimization is drifting away from the user's
preferences. The optimization is then constrained by adding a penalty to the
objective function. We present an interactive quality diversity algorithm that
can take into account the user's selection. The approach is evaluated in a new
multimodal optimization benchmark that allows various optimization tasks to be
performed. The user selection drift of the approach is compared to a state of
the art alternative on both a planning and a neuroevolution control task,
thereby showing its limits and possibilities.
","[{'version': 'v1', 'created': 'Tue, 16 Jul 2019 09:39:55 GMT'}]",2019-07-17,"[['Hagg', 'Alexander', ''], ['Asteroth', 'Alexander', ''], ['Bäck', 'Thomas', '']]","['quality diversity', 'interactive evolution', 'selection', 'niching']"
1349,1412.5466,Luca Giuzzi DPhil,"Ilaria Cardinali, Luca Giuzzi","Enumerative Coding for Line Polar Grassmannians with applications to
  codes",27 pages; revised version after review,Finite Fields Appl. 46 (2017) 107-138,10.1016/j.ffa.2017.03.005,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A $k$-polar Grassmannian is the geometry having as pointset the set of all
$k$-dimensional subspaces of a vector space $V$ which are totally isotropic for
a given non-degenerate bilinear form $\mu$ defined on $V.$ Hence it can be
regarded as a subgeometry of the ordinary $k$-Grassmannian. In this paper we
deal with orthogonal line Grassmannians and with symplectic line Grassmannians,
i.e. we assume $k=2$ and $\mu$ a non-degenerate symmetric or alternating form.
We will provide a method to efficiently enumerate the pointsets of both
orthogonal and symplectic line Grassmannians. This has several nice
applications; among them, we shall discuss an efficient encoding/decoding/error
correction strategy for line polar Grassmann codes of both types.
","[{'version': 'v1', 'created': 'Wed, 17 Dec 2014 16:26:40 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Mar 2016 21:12:55 GMT'}, {'version': 'v3', 'created': 'Tue, 10 Apr 2018 09:35:48 GMT'}]",2018-04-11,"[['Cardinali', 'Ilaria', ''], ['Giuzzi', 'Luca', '']]","['Enumerative Coding', 'Polar Grassmannian', 'Linear Code']"
1350,1809.09086,Nguyen Phong Hoang,"Nguyen Phong Hoang, Panagiotis Kintis, Manos Antonakakis, and Michalis
  Polychronakis","An Empirical Study of the I2P Anonymity Network and its Censorship
  Resistance","14 pages, To appear in the 2018 Internet Measurement Conference
  (IMC'18)",,10.1145/3278532.3278565,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tor and I2P are well-known anonymity networks used by many individuals to
protect their online privacy and anonymity. Tor's centralized directory
services facilitate the understanding of the Tor network, as well as the
measurement and visualization of its structure through the Tor Metrics project.
In contrast, I2P does not rely on centralized directory servers, and thus
obtaining a complete view of the network is challenging. In this work, we
conduct an empirical study of the I2P network, in which we measure properties
including population, churn rate, router type, and the geographic distribution
of I2P peers. We find that there are currently around 32K active I2P peers in
the network on a daily basis. Of these peers, 14K are located behind NAT or
firewalls.
  Using the collected network data, we examine the blocking resistance of I2P
against a censor that wants to prevent access to I2P using address-based
blocking techniques. Despite the decentralized characteristics of I2P, we
discover that a censor can block more than 95% of peer IP addresses known by a
stable I2P client by operating only 10 routers in the network. This amounts to
severe network impairment: a blocking rate of more than 70% is enough to cause
significant latency in web browsing activities, while blocking more than 90% of
peer IP addresses can make the network unusable. Finally, we discuss the
security consequences of the network being blocked, and directions for
potential approaches to make I2P more resistant to blocking.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2018 17:56:43 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Sep 2018 23:02:08 GMT'}]",2018-09-27,"[['Hoang', 'Nguyen Phong', ''], ['Kintis', 'Panagiotis', ''], ['Antonakakis', 'Manos', ''], ['Polychronakis', 'Michalis', '']]","['I2P anonymity network', 'network metrics', 'Internet censorship', 'blocking resistance']"
1351,1008.2688,Tomoyuki Yamakami,Tomoyuki Yamakami,"A Dichotomy Theorem for the Approximate Counting of Complex-Weighted
  Bounded-Degree Boolean CSPs","A4, 10pt, 20 pages. This revised version improves its preliminary
  version published under a slightly different title in the Proceedings of the
  4th International Conference on Combinatorial Optimization and Applications
  (COCOA 2010), Lecture Notes in Computer Science, Springer, Vol.6508 (Part I),
  pp.285--299, Kailua-Kona, Hawaii, USA, December 18--20, 2010","(journal version) Theoretical Computer Science, Vol.447,
  pp.120-135, 2012",10.1007/978-3-642-17458-2_24,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We determine the computational complexity of approximately counting the total
weight of variable assignments for every complex-weighted Boolean constraint
satisfaction problem (or CSP) with any number of additional unary (i.e., arity
1) constraints, particularly, when degrees of input instances are bounded from
above by a fixed constant. All degree-1 counting CSPs are obviously solvable in
polynomial time. When the instance's degree is more than two, we present a
dichotomy theorem that classifies all counting CSPs admitting free unary
constraints into exactly two categories. This classification theorem extends,
to complex-weighted problems, an earlier result on the approximation complexity
of unweighted counting Boolean CSPs of bounded degree. The framework of the
proof of our theorem is based on a theory of signature developed from Valiant's
holographic algorithms that can efficiently solve seemingly intractable
counting CSPs. Despite the use of arbitrary complex weight, our proof of the
classification theorem is rather elementary and intuitive due to an extensive
use of a novel notion of limited T-constructibility. For the remaining degree-2
problems, in contrast, they are as hard to approximate as Holant problems,
which are a generalization of counting CSPs.
","[{'version': 'v1', 'created': 'Mon, 16 Aug 2010 15:28:04 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Mar 2011 15:56:29 GMT'}, {'version': 'v3', 'created': 'Sun, 18 Mar 2012 07:26:41 GMT'}]",2015-05-19,"[['Yamakami', 'Tomoyuki', '']]","['constraint satisfaction problem', '#CSP', 'bounded degree', 'approximate counting', 'dichotomy theorem', 'T-constructibility', 'signature', 'Holant problem']"
1352,1005.5433,Secretary Aircc Journal,Nouha Arfaoui and Jalel Akaichi,A Data Warehouse Assistant Design System Based on Clover Model,"15 Pages, IJDMS","International Journal of Database Management Systems 2.2 (2010)
  57-71",10.5121/ijdms.2010.2204,,cs.DB,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Nowadays, Data Warehouse (DW) plays a crucial role in the process of decision
making. However, their design remains a very delicate and difficult task either
for expert or users. The goal of this paper is to propose a new approach based
on the clover model, destined to assist users to design a DW. The proposed
approach is based on two main steps. The first one aims to guide users in their
choice of DW schema model. The second one aims to finalize the chosen model by
offering to the designer views related to former successful DW design
experiences.
","[{'version': 'v1', 'created': 'Sat, 29 May 2010 07:35:23 GMT'}]",2010-07-15,"[['Arfaoui', 'Nouha', ''], ['Akaichi', 'Jalel', '']]","['Design', 'Schema', 'Data warehouse', 'Clover model', 'User Experiences']"
1353,1111.3281,Reza Farrahi Moghaddam,"Reza Farrahi Moghaddam and Mohamed Cheriet and Thomas Milo and Robert
  Wisnovsky","A prototype system for handwritten sub-word recognition: Toward
  Arabic-manuscript transliteration","8 pages, 7 figures, 6 tables",,10.1109/ISSPA.2012.6310473,,cs.CV cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A prototype system for the transliteration of diacritics-less Arabic
manuscripts at the sub-word or part of Arabic word (PAW) level is developed.
The system is able to read sub-words of the input manuscript using a set of
skeleton-based features. A variation of the system is also developed which
reads archigraphemic Arabic manuscripts, which are dot-less, into
archigraphemes transliteration. In order to reduce the complexity of the
original highly multiclass problem of sub-word recognition, it is redefined
into a set of binary descriptor classifiers. The outputs of trained binary
classifiers are combined to generate the sequence of sub-word letters. SVMs are
used to learn the binary classifiers. Two specific Arabic databases have been
developed to train and test the system. One of them is a database of the Naskh
style. The initial results are promising. The systems could be trained on other
scripts found in Arabic manuscripts.
","[{'version': 'v1', 'created': 'Mon, 14 Nov 2011 17:03:42 GMT'}]",2013-06-27,"[['Moghaddam', 'Reza Farrahi', ''], ['Cheriet', 'Mohamed', ''], ['Milo', 'Thomas', ''], ['Wisnovsky', 'Robert', '']]","['Optical shape recognition', 'Arabic language', 'Databases']"
1354,1005.1992,Secretary Aircc Journal,"G.F. Ali Ahammed and Reshma Banu (Ghousia college of Engg.Ramanagaram,
  India)",Analyzing the Performance of Active Queue Management Algorithms,"19 Pages, IJCNC 2010","International Journal of Computer Networks & Communications 2.2
  (2010) 1-19",10.5121/ijcnc.2010.2201,,cs.PF,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Congestion is an important issue which researchers focus on in the
Transmission Control Protocol (TCP) network environment. To keep the stability
of the whole network, congestion control algorithms have been extensively
studied. Queue management method employed by the routers is one of the
important issues in the congestion control study. Active queue management (AQM)
has been proposed as a router-based mechanism for early detection of congestion
inside the network. In this paper we analyzed several active queue management
algorithms with respect to their abilities of maintaining high resource
utilization, identifying and restricting disproportionate bandwidth usage, and
their deployment complexity. We compare the performance of FRED, BLUE, SFB, and
CHOKe based on simulation results, using RED and Drop Tail as the evaluation
baseline. The characteristics of different algorithms are also discussed and
compared. Simulation is done by using Network Simulator(NS2) and the graphs are
drawn using X- graph.
","[{'version': 'v1', 'created': 'Wed, 12 May 2010 05:29:40 GMT'}]",2010-07-15,"[['Ahammed', 'G. F. Ali', '', 'Ghousia college of Engg.Ramanagaram,\n  India'], ['Banu', 'Reshma', '', 'Ghousia college of Engg.Ramanagaram,\n  India']]","['RED; Droptail; Fairness Index; Throughput; AQM; NS2 FRED', 'BLUE', 'SFB', 'CHOKe', 'ECN']"
1355,1004.4342,Martin Slota,Martin Slota and Jo\~ao Leite,Towards Closed World Reasoning in Dynamic Open Worlds (Extended Version),"40 pages; an extended version of the article published in Theory and
  Practice of Logic Programming, 10 (4-6): 547 - 564, July. Copyright 2010
  Cambridge University Press","Theory and Practice of Logic Programming, 10(4-6), 547-564, 2010",10.1017/S147106841000027X,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The need for integration of ontologies with nonmonotonic rules has been
gaining importance in a number of areas, such as the Semantic Web. A number of
researchers addressed this problem by proposing a unified semantics for hybrid
knowledge bases composed of both an ontology (expressed in a fragment of
first-order logic) and nonmonotonic rules. These semantics have matured over
the years, but only provide solutions for the static case when knowledge does
not need to evolve. In this paper we take a first step towards addressing the
dynamics of hybrid knowledge bases. We focus on knowledge updates and,
considering the state of the art of belief update, ontology update and rule
update, we show that current solutions are only partial and difficult to
combine. Then we extend the existing work on ABox updates with rules, provide a
semantics for such evolving hybrid knowledge bases and study its basic
properties. To the best of our knowledge, this is the first time that an update
operator is proposed for hybrid knowledge bases.
","[{'version': 'v1', 'created': 'Sun, 25 Apr 2010 10:51:35 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Jul 2010 00:31:53 GMT'}]",2011-07-27,"[['Slota', 'Martin', ''], ['Leite', 'João', '']]","['belief change', 'belief update', 'hybrid knowledge bases', 'ontologies', 'rules', 'description logics', 'answer set programming', 'semantic web']"
1356,1504.07976,Frank Kammer,"Thomas Erlebach, Michael Hoffmann, Frank Kammer",On Temporal Graph Exploration,This is an extended version of an ICALP 2015 paper,"Journal of Computer and System Sciences, 119:1-18, 2021",10.1016/j.jcss.2021.01.005,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A temporal graph is a graph in which the edge set can change from one time
step to the next. The temporal graph exploration problem TEXP is the problem of
computing a foremost exploration schedule for a temporal graph, i.e., a
temporal walk that starts at a given start node, visits all nodes of the graph,
and has the smallest arrival time. In the first part of the paper, we consider
only undirected temporal graphs that are connected at each time step. For such
temporal graphs with $n$ nodes, we show that it is \NP-hard to approximate TEXP
with ratio $O(n^{1-\varepsilon})$ for every $\varepsilon>0$. We also provide an
explicit construction of temporal graphs that require $\Theta(n^2)$ time steps
to be explored. In the second part of the paper, we still consider temporal
graphs that are connected in each time step, but we assume that the underlying
graph (i.e. the graph that contains all edges that are present in the temporal
graph in at least one time step) belongs to a specific class of graphs. Among
other results, we show that temporal graphs can be explored in
$O(n^{1.5}k^{1.5}\log n)$ time steps if the underlying graph has treewidth $k$,
in $O(n^{1.8}\log n)$ time steps if the underlying graph is planar, and in
$O(n\log^3 n)$ time steps if the underlying graph is a $2\times n$ grid. In the
third part of the paper, we consider settings where the graphs in future time
steps are not known and the exploration schedule is constructed online. We
replace the connectedness assumption by a weaker assumption and show that
$m$-edge temporal graphs with regularly present edges and with
probabilistically present edges can be explored online in $O(m)$ time steps and
$O(m \log n)$ time steps with high probability, respectively. We finally show
that the latter result can be used to obtain a distributed algorithm for the
gossiping problem in random temporal graphs.
","[{'version': 'v1', 'created': 'Wed, 29 Apr 2015 19:41:52 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Nov 2017 13:57:20 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Mar 2021 11:15:11 GMT'}]",2021-03-17,"[['Erlebach', 'Thomas', ''], ['Hoffmann', 'Michael', ''], ['Kammer', 'Frank', '']]","['non-approximability', 'planar graphs', 'bounded treewidth', 'regularly present edges', 'random edges', 'distributed algorithm', 'gossiping problem']"
1357,1001.3555,T.R. Gopalakrishnan Nair,"R. Selvarani, T.R.Gopalakrishnan Nair, V. Kamakshi Prasad","Estimation of Defect proneness Using Design complexity Measurements in
  Object- Oriented Software","5 pages, 1 figure","ICCDA, ICSPS, IEEE Computer Society Press, pp 766-770, 2009",10.1109/ICSPS.2009.163,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software engineering is continuously facing the challenges of growing
complexity of software packages and increased level of data on defects and
drawbacks from software production process. This makes a clarion call for
inventions and methods which can enable a more reusable, reliable, easily
maintainable and high quality software systems with deeper control on software
generation process. Quality and productivity are indeed the two most important
parameters for controlling any industrial process. Implementation of a
successful control system requires some means of measurement. Software metrics
play an important role in the management aspects of the software development
process such as better planning, assessment of improvements, resource
allocation and reduction of unpredictability. The process involving early
detection of potential problems, productivity evaluation and evaluating
external quality factors such as reusability, maintainability, defect proneness
and complexity are of utmost importance. Here we discuss the application of CK
metrics and estimation model to predict the external quality parameters for
optimizing the design process and production process for desired levels of
quality. Estimation of defect-proneness in object-oriented system at design
level is developed using a novel methodology where models of relationship
between CK metrics and defect-proneness index is achieved. A multifunctional
estimation approach captures the correlation between CK metrics and defect
proneness level of software modules.
","[{'version': 'v1', 'created': 'Wed, 20 Jan 2010 11:28:26 GMT'}]",2016-11-15,"[['Selvarani', 'R.', ''], ['Nair', 'T. R. Gopalakrishnan', ''], ['Prasad', 'V. Kamakshi', '']]","['Quality', 'design', 'defect-proneness', 'internal']"
1358,1403.5869,Sumaira Tasnim,"Akhlaqur Rahman, Sumaira Tasnim",Block Motion Based Dynamic Texture Analysis: A Review,"Published with International Journal of Computer Trends and
  Technology (IJCTT)","Akhlaqur Rahman , Sumaira Tasnim . ""Block Motion Based Dynamic
  Texture Analysis: A Review"". International Journal of Computer Trends and
  Technology (IJCTT) V8(2):76-78, February 2014",10.14445/22312803/IJCTT-V8P114,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dynamic texture refers to image sequences of non-rigid objects that exhibit
some regularity in their movement. Videos of smoke, fire etc. fall under the
category of dynamic texture. Researchers have investigated different ways to
analyze dynamic textures since early nineties. Both appearance based (image
intensities) and motion based approaches are investigated. Motion based
approaches turn out to be more effective. A group of researchers have
investigated ways to utilize the motion vectors readily available with the
blocks in video codes like MGEG/H26X. In this paper we provide a review of the
dynamic texture analysis methods using block motion. Research into dynamic
texture analysis using block motion includes recognition, motion computation,
segmentation, and synthesis. We provide a comprehensive review of these
approaches.
","[{'version': 'v1', 'created': 'Mon, 24 Mar 2014 07:12:22 GMT'}]",2014-03-25,"[['Rahman', 'Akhlaqur', ''], ['Tasnim', 'Sumaira', '']]","['Dynamic Texture', 'Temporal Texture', 'Time Varying Texture']"
1359,1801.05040,Jonas Teuwen,"Mohsen Ghafoorian, Jonas Teuwen, Rashindra Manniesing, Frank-Erik de
  Leeuw, Bram van Ginneken, Nico Karssemeijer, Bram Platel","Student Beats the Teacher: Deep Neural Networks for Lateral Ventricles
  Segmentation in Brain MR","7 pages, 4 figures, SPIE Medical Imaging 2018 Conference paper","Proc. SPIE 10574, 105742U (2 March 2018)",10.1117/12.2293569,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ventricular volume and its progression are known to be linked to several
brain diseases such as dementia and schizophrenia. Therefore accurate
measurement of ventricle volume is vital for longitudinal studies on these
disorders, making automated ventricle segmentation algorithms desirable. In the
past few years, deep neural networks have shown to outperform the classical
models in many imaging domains. However, the success of deep networks is
dependent on manually labeled data sets, which are expensive to acquire
especially for higher dimensional data in the medical domain. In this work, we
show that deep neural networks can be trained on much-cheaper-to-acquire
pseudo-labels (e.g., generated by other automated less accurate methods) and
still produce more accurate segmentations compared to the quality of the
labels. To show this, we use noisy segmentation labels generated by a
conventional region growing algorithm to train a deep network for lateral
ventricle segmentation. Then on a large manually annotated test set, we show
that the network significantly outperforms the conventional region growing
algorithm which was used to produce the training labels for the network. Our
experiments report a Dice Similarity Coefficient (DSC) of $0.874$ for the
trained network compared to $0.754$ for the conventional region growing
algorithm ($p < 0.001$).
","[{'version': 'v1', 'created': 'Mon, 15 Jan 2018 21:43:48 GMT'}, {'version': 'v2', 'created': 'Sat, 3 Mar 2018 11:54:32 GMT'}]",2018-03-06,"[['Ghafoorian', 'Mohsen', ''], ['Teuwen', 'Jonas', ''], ['Manniesing', 'Rashindra', ''], ['de Leeuw', 'Frank-Erik', ''], ['van Ginneken', 'Bram', ''], ['Karssemeijer', 'Nico', ''], ['Platel', 'Bram', '']]","['lateral ventricles', 'segmentation', 'deep neural network', 'fully convolutional neural networks', 'noisylabels', 'pseudo-label', 'large dataset']"
1360,0810.1106,Kees Middelburg,"J.A. Bergstra, C.A. Middelburg",On the expressiveness of single-pass instruction sequences,"14 pages; error corrected, acknowledgement added; another error
  corrected, another acknowledgement added","Theory of Computing Systems, 50(2):313--328, 2012",10.1007/s00224-010-9301-8,PRG0813,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We perceive programs as single-pass instruction sequences. A single-pass
instruction sequence under execution is considered to produce a behaviour to be
controlled by some execution environment. Threads as considered in basic thread
algebra model such behaviours. We show that all regular threads, i.e. threads
that can only be in a finite number of states, can be produced by single-pass
instruction sequences without jump instructions if use can be made of Boolean
registers. We also show that, in the case where goto instructions are used
instead of jump instructions, a bound to the number of labels restricts the
expressiveness.
","[{'version': 'v1', 'created': 'Tue, 7 Oct 2008 06:51:53 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Dec 2008 08:28:59 GMT'}, {'version': 'v3', 'created': 'Tue, 13 Jan 2009 08:14:05 GMT'}]",2012-01-12,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['single-pass instruction sequence', 'regular thread', 'expressiveness', 'jump-free instruction sequence']"
1361,1902.00089,Meixin Zhu,"Meixin Zhu, Yinhai Wang, Ziyuan Pu, Jingyun Hu, Xuesong Wang, Ruimin
  Ke","Safe, Efficient, and Comfortable Velocity Control based on Reinforcement
  Learning for Autonomous Driving",Under the first-round revision for transportation research part c,Transportation Research Part C: Emerging Technologies 2020,10.1016/j.trc.2020.102662,,cs.LG cs.AI cs.RO stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A model used for velocity control during car following was proposed based on
deep reinforcement learning (RL). To fulfil the multi-objectives of car
following, a reward function reflecting driving safety, efficiency, and comfort
was constructed. With the reward function, the RL agent learns to control
vehicle speed in a fashion that maximizes cumulative rewards, through trials
and errors in the simulation environment. A total of 1,341 car-following events
extracted from the Next Generation Simulation (NGSIM) dataset were used to
train the model. Car-following behavior produced by the model were compared
with that observed in the empirical NGSIM data, to demonstrate the model's
ability to follow a lead vehicle safely, efficiently, and comfortably. Results
show that the model demonstrates the capability of safe, efficient, and
comfortable velocity control in that it 1) has small percentages (8\%) of
dangerous minimum time to collision values (\textless\ 5s) than human drivers
in the NGSIM data (35\%); 2) can maintain efficient and safe headways in the
range of 1s to 2s; and 3) can follow the lead vehicle comfortably with smooth
acceleration. The results indicate that reinforcement learning methods could
contribute to the development of autonomous driving systems.
","[{'version': 'v1', 'created': 'Tue, 29 Jan 2019 20:04:40 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Nov 2019 03:57:58 GMT'}]",2020-07-14,"[['Zhu', 'Meixin', ''], ['Wang', 'Yinhai', ''], ['Pu', 'Ziyuan', ''], ['Hu', 'Jingyun', ''], ['Wang', 'Xuesong', ''], ['Ke', 'Ruimin', '']]","['Car Following', 'Autonomous Driving', 'VelocityControl', 'Reinforcement Learning', 'NGSIM', 'Deep Deterministic Policy Gradient (DDPG)']"
1362,2212.03812,Spandan Dey,"Spandan Dey, Md Sahidullah, Goutam Saha","An Overview of Indian Spoken Language Recognition from Machine Learning
  Perspective","Accepted for publication in ACM Transactions on Asian and
  Low-Resource Language Information Processing","ACM Transactions on Asian and Low-Resource Language Information
  Processing, Volume 21, Issue 6 November 2022, Article No 128",10.1145/3523179,,cs.CL cs.SD eess.AS,http://creativecommons.org/licenses/by-sa/4.0/,"  Automatic spoken language identification (LID) is a very important research
field in the era of multilingual voice-command-based human-computer interaction
(HCI). A front-end LID module helps to improve the performance of many
speech-based applications in the multilingual scenario. India is a populous
country with diverse cultures and languages. The majority of the Indian
population needs to use their respective native languages for verbal
interaction with machines. Therefore, the development of efficient Indian
spoken language recognition systems is useful for adapting smart technologies
in every section of Indian society. The field of Indian LID has started gaining
momentum in the last two decades, mainly due to the development of several
standard multilingual speech corpora for the Indian languages. Even though
significant research progress has already been made in this field, to the best
of our knowledge, there are not many attempts to analytically review them
collectively. In this work, we have conducted one of the very first attempts to
present a comprehensive review of the Indian spoken language recognition
research field. In-depth analysis has been presented to emphasize the unique
challenges of low-resource and mutual influences for developing LID systems in
the Indian contexts. Several essential aspects of the Indian LID research, such
as the detailed description of the available speech corpora, the major research
contributions, including the earlier attempts based on statistical modeling to
the recent approaches based on different neural network architectures, and the
future research trends are discussed. This review work will help assess the
state of the present Indian LID research by any active researcher or any
research enthusiasts from related fields.
","[{'version': 'v1', 'created': 'Wed, 30 Nov 2022 11:03:51 GMT'}]",2022-12-08,"[['Dey', 'Spandan', ''], ['Sahidullah', 'Md', ''], ['Saha', 'Goutam', '']]","['Low-resourced languages', 'Indian language identification', 'language similarity', 'corpora development', 'codeswitching', 'acoustic phonetics', 'discriminative model']"
1363,1102.0583,Bimal Kumar Mr,Bimal Aklesh Kumar,"Thin Client Web-Based Campus Information Systems for Fiji National
  University",14 pages,"International Journal of Software Engineering & Applications
  (IJSEA), Vol.2, No.1, January 2011",10.5121/ijsea.2011.2102,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fiji National University is encountering many difficulties with its current
administrative systems. These difficulties include accessibility, scalability,
performance, flexibility and integration. We propose a new campus information
system, FNU-CIS to addresses these difficulties. FNU-CIS has the potential to
provide wide range of the services for students and staffs at the university.
In order to assist in the design and implementation of proposed FNU-CIS, we
present an overview, software architecture and prototype implementation of our
proposed system. We discuss the key properties of our system, compare it with
other similar systems available and outline our future plans for research in
FNU-CIS implementation.
","[{'version': 'v1', 'created': 'Wed, 2 Feb 2011 23:04:49 GMT'}]",2011-02-04,"[['Kumar', 'Bimal Aklesh', '']]","['Software Architecture', 'Object Oriented Design', 'Distributed Systems', 'Scalability', 'Flexibility']"
1364,1807.03649,Dejan Lavbi\v{c},"Olegas Vasilecas, Diana Kalibatiene and Dejan Lavbi\v{c}","Rule- and context-based dynamic business process modelling and
  simulation","22 pages, 4 figures, 3 tables",Journal of Systems and Software 122 (2016) 1-15,10.1016/j.jss.2016.08.048,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The traditional approach used to implement a business process (BP) in today's
information systems (IS) no longer covers the actual needs of the dynamically
changing business. Therefore, a necessity for a new approach of dynamic
business process (DBP) modelling and simulation has arisen. To date, existing
approaches to DBP modelling and simulation have been incomplete, i.e. they lack
theory or a case study or both. Furthermore, there is no commonly accepted
definition of BDP. Current BP modelling tools are suitable almost solely for
the modelling and simulation of a static BP that strictly prescribes which
activities, and in which sequence, to execute. Usually, a DBP is not defined
strictly at the beginning of its execution, and it changes under new conditions
at runtime. In our paper, we propose six requirements of DBP and an approach
for rule- and context-based DBP modelling and simulation. The approach is based
on changing BP rules, BP actions and their sequences at process instance
runtime, according to the new business system context. Based on the proposed
approach, a reference architecture and prototype of a DBP simulation tool were
developed. Modelling and simulation were carried out using this prototype, and
the case study shows correspondence to the needs of dynamically changing
business, as well as possibilities for modelling and simulating DBP.
","[{'version': 'v1', 'created': 'Tue, 10 Jul 2018 13:56:00 GMT'}]",2018-07-11,"[['Vasilecas', 'Olegas', ''], ['Kalibatiene', 'Diana', ''], ['Lavbič', 'Dejan', '']]","['Dynamic business process', 'Business rules', 'Context', 'Simulation', 'Business process modelling']"
1365,1301.4337,Hiren Joshi,"Mahimn Pandya, Hiren Joshi, Ashish Jani",A Novel Digital Watermarking Algorithm using Random Matrix Image,"4 pages, 8 figures","International Journal of Computer Applications, Volume 61, Number
  2, pp. 18-12, 2013",10.5120/9900-4481,,cs.MM cs.CR,http://creativecommons.org/licenses/by/3.0/,"  The availability of bandwidth for internet access is sufficient enough to
communicate digital assets. These digital assets are subjected to various types
of threats. [19] As a result of this, protection mechanism required for the
protection of digital assets is of priority in research. The threat of current
focus is unauthorized copying of digital assets which give boost to piracy.
This under the copyright act is illegal and a robust mechanism is required to
curb this kind of unauthorized copy. To safeguard the copyright digital assets,
a robust digital watermarking technique is needed. The existing digital
watermarking techniques protect digital assets by embedding a digital watermark
into a host digital image. This embedding does induce slight distortion in the
host image but the distortion is usually too small to be noticed. At the same
time the embedded watermark must be robust enough to with stand deliberate
attacks. There are various techniques of digital watermarking but researchers
are making constant efforts to increase the robustness of the watermark image.
The layered approach of watermarking based on Huffman coding [5] can soon
increase the robustness of digital watermark.[11] Ultimately, increasing the
security of copyright of protection. The proposed work is in similar direction
where in RMI (Random Matrix Image) is used in place of Huffman coding. This
innovative algorithm has considerably increased the robustness in digital
watermark while also enhancing security of production
","[{'version': 'v1', 'created': 'Fri, 18 Jan 2013 10:16:21 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Jan 2013 13:24:23 GMT'}]",2013-01-23,"[['Pandya', 'Mahimn', ''], ['Joshi', 'Hiren', ''], ['Jani', 'Ashish', '']]","['Digital Watermarking', 'Random Matrix Image', 'Image Processing', 'Embedding', 'Extraction']"
1366,1805.07565,Saeid Pourroostaei Ardakani,Saeid Pourroostaei Ardakani,ACR: a cluster-based routing protocol for VANET,"15 pages, 6 figures",,10.5121/ijwmn.2018.10204,,cs.NI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering is a technique used in network routing to enhance the performance
and conserve the network resources. This paper presents a cluster-based routing
protocol for VANET utilizing a new addressing scheme in which each node gets an
address according to its mobility pattern. Hamming distance technique is used
then to partition the network in an address-centric manner. The simulation
results show that this protocol enhances routing reachability, whereas reduces
routing end-to-end delay and traffic received comparing with two benchmarks
namely AODV and DSDV.
","[{'version': 'v1', 'created': 'Sat, 19 May 2018 10:13:21 GMT'}]",2018-05-22,"[['Ardakani', 'Saeid Pourroostaei', '']]","['Vehicular Networks (VANETs)', 'Routing', 'Clustering', 'Mobility', 'Hamming Distance.  1']"
1367,1312.4742,"J\""urgen M\""unch","Alexis Ocampo, Fabio Bella, J\""urgen M\""unch",Software Process Commonality Analysis,"26 pages. The final publication is available at
  http://onlinelibrary.wiley.com/doi/10.1002/spip.229/abstract","International Journal on Software Process: Improvement and
  Practice, 10(3):273-285, 2005",10.1002/spip.229,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To remain viable and thrive, software organizations must rapidly adapt to
frequent, and often rather far-ranging, changes to their operational context.
These changes typically concern many factors, including the nature of the
organization's marketplace in general, its customers' demands, and its business
needs. In today's most highly dynamic contexts, such as web services
development, other changes create additional, severe challenges. Most critical
are changes to the technology in which a software product is written or which
the software product has to control or use to provide its functionality. These
product-support technology changes are frequently relatively 'small' and
incremental. They are, therefore, often handled by relatively 'small,'
incremental changes to the organization's software processes. However, the
frequency of these changes is high, and their impact is elevated by
time-to-market and requirements change demands. The net result is an extremely
challenging need to create and manage a large number of customized process
variants, collectively having more commonalities than differences, and
incorporating experience-based, proven 'best practices'. This paper describes a
tool-based approach to coping with product-support technology changes. The
approach utilizes established capabilities such as descriptive process modeling
and the creation of reference models. It incorporates a new, innovative,
tool-based capability to analyze commonalities and differences among processes.
The paper includes an example-based evaluation of the approach in the domain of
Wireless Internet Services as well as a discussion of its potentially broader
application.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2013 12:19:21 GMT'}]",2013-12-18,"[['Ocampo', 'Alexis', ''], ['Bella', 'Fabio', ''], ['Münch', 'Jürgen', '']]","['Software Reference Process', 'Commonality Analysis', 'Variability', 'Software Process Modeling.  1']"
1368,1911.09874,Evgeny Tsykunov,"Evgeny Tsykunov, Ruslan Agishev, Roman Ibrahimov, Luiza Labazanova,
  Taha Moriyama, Hiroyuki Kajimoto, Dzmitry Tsetserukou",SwarmCloak: Landing of a Swarm of Nano-Quadrotors on Human Arms,"ACM Siggraph Asia 2019 conference (Emerging Technologies section).
  Best Demo Award by committee members",,10.1145/3355049.3360542,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel system SwarmCloak for landing of a fleet of four flying
robots on the human arms using light-sensitive landing pads with vibrotactile
feedback. We developed two types of wearable tactile displays with vibromotors
which are activated by the light emitted from the LED array at the bottom of
quadcopters. In a user study, participants were asked to adjust the position of
the arms to land up to two drones, having only visual feedback, only tactile
feedback or visual-tactile feedback. The experiment revealed that when the
number of drones increases, tactile feedback plays a more important role in
accurate landing and operator's convenience. An important finding is that the
best landing performance is achieved with the combination of tactile and visual
feedback. The proposed technology could have a strong impact on the human-swarm
interaction, providing a new level of intuitiveness and engagement into the
swarm deployment just right from the skin surface.
","[{'version': 'v1', 'created': 'Fri, 22 Nov 2019 06:27:28 GMT'}]",2019-11-25,"[['Tsykunov', 'Evgeny', ''], ['Agishev', 'Ruslan', ''], ['Ibrahimov', 'Roman', ''], ['Labazanova', 'Luiza', ''], ['Moriyama', 'Taha', ''], ['Kajimoto', 'Hiroyuki', ''], ['Tsetserukou', 'Dzmitry', '']]","['human-swarm interaction', 'tactile interaction with drones', 'quadcopter landing', 'multi-agent systems']"
1369,0804.0819,Namrata Vaswani,Namrata Vaswani,Kalman Filtered Compressed Sensing,"A slightly shorter version submitted to IEEE Intl. Conf. Image Proc.
  (ICIP) 2008. (5 pages, 1 figure)",,10.1109/ICIP.2008.4711899,,cs.IT math.IT math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of reconstructing time sequences of spatially sparse
signals (with unknown and time-varying sparsity patterns) from a limited number
of linear ""incoherent"" measurements, in real-time. The signals are sparse in
some transform domain referred to as the sparsity basis. For a single spatial
signal, the solution is provided by Compressed Sensing (CS). The question that
we address is, for a sequence of sparse signals, can we do better than CS, if
(a) the sparsity pattern of the signal's transform coefficients' vector changes
slowly over time, and (b) a simple prior model on the temporal dynamics of its
current non-zero elements is available. The overall idea of our solution is to
use CS to estimate the support set of the initial signal's transform vector. At
future times, run a reduced order Kalman filter with the currently estimated
support and estimate new additions to the support set by applying CS to the
Kalman innovations or filtering error (whenever it is ""large"").
","[{'version': 'v1', 'created': 'Fri, 4 Apr 2008 22:56:33 GMT'}]",2016-11-17,"[['Vaswani', 'Namrata', '']]","['compressed sensing', 'Kalman filtering', 'compressive sampling', 'sequential MMSE estimation']"
1370,1812.00262,Irene C\'ordoba,"Irene C\'ordoba, Concha Bielza, Pedro Larra\~naga",Towards Gaussian Bayesian Network Fusion,"10 pages, 3 figures, 2015 conference","Springer Lecture Notes in Artificial Intelligence (ECSQARU 2015),
  vol 9161, pages 519-528",10.1007/978-3-319-20807-7_47,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data sets are growing in complexity thanks to the increasing facilities we
have nowadays to both generate and store data. This poses many challenges to
machine learning that are leading to the proposal of new methods and paradigms,
in order to be able to deal with what is nowadays referred to as Big Data. In
this paper we propose a method for the aggregation of different Bayesian
network structures that have been learned from separate data sets, as a first
step towards mining data sets that need to be partitioned in an horizontal way,
i.e. with respect to the instances, in order to be processed. Considerations
that should be taken into account when dealing with this situation are
discussed. Scalable learning of Bayesian networks is slowly emerging, and our
method constitutes one of the first insights into Gaussian Bayesian network
aggregation from different sources. Tested on synthetic data it obtains good
results that surpass those from individual learning. Future research will be
focused on expanding the method and testing more diverse data sets.
","[{'version': 'v1', 'created': 'Sat, 1 Dec 2018 20:59:03 GMT'}]",2018-12-04,"[['Córdoba', 'Irene', ''], ['Bielza', 'Concha', ''], ['Larrañaga', 'Pedro', '']]","['Gaussian Bayesian network', 'Fusion', 'Scalability', 'Big Data']"
1371,1608.02829,Ravi Chugh,Brian Hempel and Ravi Chugh,Semi-Automated SVG Programming via Direct Manipulation,"In 29th ACM User Interface Software and Technology Symposium (UIST
  2016)",,10.1145/2984511.2984575,,cs.HC cs.GR cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Direct manipulation interfaces provide intuitive and interactive features to
a broad range of users, but they often exhibit two limitations: the built-in
features cannot possibly cover all use cases, and the internal representation
of the content is not readily exposed. We believe that if direct manipulation
interfaces were to (a) use general-purpose programs as the representation
format, and (b) expose those programs to the user, then experts could customize
these systems in powerful new ways and non-experts could enjoy some of the
benefits of programmable systems.
  In recent work, we presented a prototype SVG editor called Sketch-n-Sketch
that offered a step towards this vision. In that system, the user wrote a
program in a general-purpose lambda-calculus to generate a graphic design and
could then directly manipulate the output to indirectly change design
parameters (i.e. constant literals) in the program in real-time during the
manipulation. Unfortunately, the burden of programming the desired
relationships rested entirely on the user.
  In this paper, we design and implement new features for Sketch-n-Sketch that
assist in the programming process itself. Like typical direct manipulation
systems, our extended Sketch-n-Sketch now provides GUI-based tools for drawing
shapes, relating shapes to each other, and grouping shapes together. Unlike
typical systems, however, each tool carries out the user's intention by
transforming their general-purpose program. This novel, semi-automated
programming workflow allows the user to rapidly create high-level, reusable
abstractions in the program while at the same time retaining direct
manipulation capabilities. In future work, our approach may be extended with
more graphic design features or realized for other application domains.
","[{'version': 'v1', 'created': 'Tue, 9 Aug 2016 15:17:46 GMT'}]",2019-07-26,"[['Hempel', 'Brian', ''], ['Chugh', 'Ravi', '']]","['Live Programming', 'Direct Manipulation', 'SVG']"
1372,2201.07666,Mauricio Jacobo Romero Mr,Mauricio Jacobo Romero and Andr\'e Freitas,Microeconomic Foundations of Decentralised Organisations,"9 pages, 7 figures, pre-final version, submitted to conference","SAC '21: Proceedings of the 36th Annual ACM Symposium on Applied
  Computing March 2021 Pages 282-290",10.1145/3412841.3441911,,cs.CE cs.CY econ.EM,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this article, we analyse how decentralised digital infrastructures can
provide a fundamental change in the structure and dynamics of organisations.
The works of R.H.Coase and M. Olson, on the nature of the firm and the logic of
collective action, respectively, are revisited under the light of these
emerging new digital foundations. We also analyse how these technologies can
affect the fundamental assumptions on the role of organisations (either private
or public) as mechanisms for the coordination of labour. We propose that these
technologies can fundamentally affect: (i) the distribution of rewards within
an organisation and (ii) the structure of its transaction costs. These changes
bring the potential for addressing some of the trade-offs between the private
and public sectors.
","[{'version': 'v1', 'created': 'Fri, 7 Jan 2022 16:07:05 GMT'}, {'version': 'v2', 'created': 'Sun, 9 Oct 2022 12:26:11 GMT'}]",2022-10-11,"[['Romero', 'Mauricio Jacobo', ''], ['Freitas', 'André', '']]","['distributed ledgers', 'decentralised organisations', 'microeconomics', 'artificial intelligence']"
1373,1502.05906,Helio M. de Oliveira,"A.R. Gomes e Silva, H.M. de Oliveira and R.D. Lins","Converting ECG and other paper legated biomedical maps into digital
  signals","6 pages, 9 figures","Lecture Notes in Computer Science, LNCS 5046, GREC 2007, pp.
  21-28, 2008",10.1007/978-3-540-88188-9,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a digital signal processing tool developed using
MatlabTM, which provides a very low-cost and effective strategy for
analog-to-digital conversion of legated paper biomedical maps without requiring
dedicated hardware. This software-based approach is particularly helpful for
digitalizing biomedical signals acquired from analogical devices equipped with
a plottingter. Albeit signals used in biomedical diagnosis are the primary
concern, this imaging processing tool is suitable to modernize facilities in a
non-expensive way. Legated paper ECG and EEG charts can be fast and efficiently
digitalized in order to be added in existing up-to-date medical data banks,
improving the follow-up of patients.
","[{'version': 'v1', 'created': 'Fri, 20 Feb 2015 15:35:27 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Mar 2015 16:01:46 GMT'}]",2015-03-06,"[['Silva', 'A. R. Gomes e', ''], ['de Oliveira', 'H. M.', ''], ['Lins', 'R. D.', '']]","['analog\xadto\xaddigital\xa0converter', 'digitalization\xa0of\xa0medical\xa0maps', 'digital\xa0ECG', 'digital\xa0EEG']"
1374,1511.04053,Cornelia Haisjackl,"Jan Claes, Irene Vanderfeesten, Jakob Pinggera, Hajo A. Reijers,
  Barbara Weber, Geert Poels",Visualizing the Process of Process Modeling with PPMCharts,,"Proc. TAProViz'12, pp. 744-755, 2013",10.1007/978-3-642-36285-9_75,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the quest for knowledge about how to make good process models, recent
research focus is shifting from studying the quality of process models to
studying the process of process modeling (often abbreviated as PPM) itself.
This paper reports on our efforts to visualize this specific process in such a
way that relevant characteristics of the modeling process can be observed
graphically. By recording each modeling operation in a modeling process, one
can build an event log that can be used as input for the PPMChart Analysis
plug-in we implemented in ProM. The graphical representation this plug-in
generates allows for the discovery of different patterns of the process of
process modeling. It also provides different views on the process of process
modeling (by configuring and filtering the charts).
","[{'version': 'v1', 'created': 'Wed, 11 Nov 2015 17:40:41 GMT'}]",2015-11-13,"[['Claes', 'Jan', ''], ['Vanderfeesten', 'Irene', ''], ['Pinggera', 'Jakob', ''], ['Reijers', 'Hajo A.', ''], ['Weber', 'Barbara', ''], ['Poels', 'Geert', '']]","['Analysis Techniques and Visualization for Processes', 'Visualization Techniques for Processes', 'Change Visualization for Processes']"
1375,2105.11207,Andres C Rodriguez,"Andr\'es C. Rodr\'iguez, Stefano D'Aronco, Konrad Schindler, Jan
  D.Wegner",Mapping oil palm density at country scale: An active learning approach,,"Remote Sensing of Environment Volume 261, August 2021, 112479",10.1016/j.rse.2021.112479,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Accurate mapping of oil palm is important for understanding its past and
future impact on the environment. We propose to map and count oil palms by
estimating tree densities per pixel for large-scale analysis. This allows for
fine-grained analysis, for example regarding different planting patterns. To
that end, we propose a new, active deep learning method to estimate oil palm
density at large scale from Sentinel-2 satellite images, and apply it to
generate complete maps for Malaysia and Indonesia. What makes the regression of
oil palm density challenging is the need for representative reference data that
covers all relevant geographical conditions across a large territory.
Specifically for density estimation, generating reference data involves
counting individual trees. To keep the associated labelling effort low we
propose an active learning (AL) approach that automatically chooses the most
relevant samples to be labelled. Our method relies on estimates of the
epistemic model uncertainty and of the diversity among samples, making it
possible to retrieve an entire batch of relevant samples in a single iteration.
Moreover, our algorithm has linear computational complexity and is easily
parallelisable to cover large areas. We use our method to compute the first oil
palm density map with $10\,$m Ground Sampling Distance (GSD) , for all of
Indonesia and Malaysia and for two different years, 2017 and 2019. The maps
have a mean absolute error of $\pm$7.3 trees/$ha$, estimated from an
independent validation set. We also analyse density variations between
different states within a country and compare them to official estimates.
According to our estimates there are, in total, $>1.2$ billion oil palms in
Indonesia covering $>$15 million $ha$, and $>0.5$ billion oil palms in Malaysia
covering $>6$ million $ha$.
","[{'version': 'v1', 'created': 'Mon, 24 May 2021 11:23:55 GMT'}]",2021-05-25,"[['Rodríguez', 'Andrés C.', ''], [""D'Aronco"", 'Stefano', ''], ['Schindler', 'Konrad', ''], ['Wegner', 'Jan D.', '']]","['Palm oil', 'Tree density', 'Large-scale mapping', 'Active learning', 'Sentinel-2', 'Deep learning']"
1376,1108.1042,Antanas Zilinskas,Antanas Zilinskas,"On strong homogeneity of two global optimization algorithms based on
  statistical models of multimodal objective functions","11 pages, 1 figure",,10.1016/j.amc.2011.07.051,,cs.NA math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The implementation of global optimization algorithms, using the arithmetic of
infinity, is considered. A relatively simple version of implementation is
proposed for the algorithms that possess the introduced property of strong
homogeneity. It is shown that the P-algorithm and the one-step Bayesian
algorithm are strongly homogeneous.
","[{'version': 'v1', 'created': 'Thu, 4 Aug 2011 10:43:17 GMT'}]",2016-11-25,"[['Zilinskas', 'Antanas', '']]","['Arithmetic of infinity', 'Global optimization', 'Statistical models']"
1377,1903.01635,Brian Hoskins,"Brian D. Hoskins, Matthew W. Daniels, Siyuan Huang, Advait Madhavan,
  Gina C. Adam, Nikolai Zhitenev, Jabez J. McClelland, Mark D. Stiles",Streaming Batch Eigenupdates for Hardware Neuromorphic Networks,"13 pages, 5 figures",Frontiers in Neuroscience 13 (2019): 793,10.3389/fnins.2019.00793,,cs.LG cs.ET cs.NE,http://creativecommons.org/publicdomain/zero/1.0/,"  Neuromorphic networks based on nanodevices, such as metal oxide memristors,
phase change memories, and flash memory cells, have generated considerable
interest for their increased energy efficiency and density in comparison to
graphics processing units (GPUs) and central processing units (CPUs). Though
immense acceleration of the training process can be achieved by leveraging the
fact that the time complexity of training does not scale with the network size,
it is limited by the space complexity of stochastic gradient descent, which
grows quadratically. The main objective of this work is to reduce this space
complexity by using low-rank approximations of stochastic gradient descent.
This low spatial complexity combined with streaming methods allows for
significant reductions in memory and compute overhead, opening the doors for
improvements in area, time and energy efficiency of training. We refer to this
algorithm and architecture to implement it as the streaming batch eigenupdate
(SBE) approach.
","[{'version': 'v1', 'created': 'Tue, 5 Mar 2019 02:35:52 GMT'}]",2019-08-21,"[['Hoskins', 'Brian D.', ''], ['Daniels', 'Matthew W.', ''], ['Huang', 'Siyuan', ''], ['Madhavan', 'Advait', ''], ['Adam', 'Gina C.', ''], ['Zhitenev', 'Nikolai', ''], ['McClelland', 'Jabez J.', ''], ['Stiles', 'Mark D.', '']]","['neuromorphic', 'memristor', 'network training']"
1378,0911.4986,EPTCS,"Michael J. Dinneen (University of Auckland), Yun-Bum Kim (University
  of Auckland), Radu Nicolescu (University of Auckland)","New Solutions to the Firing Squad Synchronization Problems for Neural
  and Hyperdag P Systems",,"EPTCS 11, 2009, pp. 107-122",10.4204/EPTCS.11.7,,cs.CE cs.DC cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose two uniform solutions to an open question: the Firing Squad
Synchronization Problem (FSSP), for hyperdag and symmetric neural P systems,
with anonymous cells. Our solutions take e_c+5 and 6e_c+7 steps, respectively,
where e_c is the eccentricity of the commander cell of the dag or digraph
underlying these P systems. The first and fast solution is based on a novel
proposal, which dynamically extends P systems with mobile channels. The second
solution is substantially longer, but is solely based on classical rules and
static channels. In contrast to the previous solutions, which work for
tree-based P systems, our solutions synchronize to any subset of the underlying
digraph; and do not require membrane polarizations or conditional rules, but
require states, as typically used in hyperdag and neural P systems.
","[{'version': 'v1', 'created': 'Thu, 26 Nov 2009 00:26:39 GMT'}]",2009-11-30,"[['Dinneen', 'Michael J.', '', 'University of Auckland'], ['Kim', 'Yun-Bum', '', 'University\n  of Auckland'], ['Nicolescu', 'Radu', '', 'University of Auckland']]","['P systems', 'neural P systems', 'hyperdag P systems', 'synchronization', 'cellular automata']"
1379,0908.1471,Fen Zhou Mr,"Fen Zhou (IRISA / INSA Rennes), Miklos Molnar (IRISA / INSA Rennes),
  Bernard Cousin (IRISA / University of Rennes I)","Distance priority based multicast routing in WDM networks considering
  sparse light splitting","11th IEEE International Conference on Communication Systems,
  Guangzhou. China, 19-21 Nov. 2008. (ICCS 2008)","IEEE International Conference on Communication Systems. (2008)
  709-714",10.1109/ICCS.2008.4737278,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As we know, the member-only algorithm in provides the best links stress and
wavelength usage for the construction of multicast light-trees in WDM networks
with sparse splitting. However, the diameter of tree is too big and the average
delay is also too large, which are intolerant for QoS required multimedia
applications. In this paper, a distance priority based algorithm is proposed to
build light-trees for multicast routing, where the Candidate Destinations and
the Candidate Connectors are introduced. Simulations show the proposed
algorithm is able to greatly reduce the diameter and average delay of the
multicast tree (up to 51% and 50% respectively), while keep the same or get a
slightly better link stress as well as the wavelength usage than the famous
Member-Only algorithm.
","[{'version': 'v1', 'created': 'Tue, 11 Aug 2009 08:17:48 GMT'}]",2009-08-12,"[['Zhou', 'Fen', '', 'IRISA / INSA Rennes'], ['Molnar', 'Miklos', '', 'IRISA / INSA Rennes'], ['Cousin', 'Bernard', '', 'IRISA / University of Rennes I']]","['Multicast Routing', 'Sparse Light Splitting', 'Distance Priority', 'Light-Tree Computation', 'WDM network']"
1380,1808.07302,Sergey Paramonov,"Sergey Paramonov, Daria Stepanova, Pauli Miettinen",Hybrid ASP-based Approach to Pattern Mining,"29 pages, 7 figures, 5 tables",Theory and Practice of Logic Programming 19 (2019) 505-535,10.1017/S1471068418000467,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detecting small sets of relevant patterns from a given dataset is a central
challenge in data mining. The relevance of a pattern is based on user-provided
criteria; typically, all patterns that satisfy certain criteria are considered
relevant. Rule-based languages like Answer Set Programming (ASP) seem
well-suited for specifying such criteria in a form of constraints. Although
progress has been made, on the one hand, on solving individual mining problems
and, on the other hand, developing generic mining systems, the existing methods
either focus on scalability or on generality. In this paper we make steps
towards combining local (frequency, size, cost) and global (various condensed
representations like maximal, closed, skyline) constraints in a generic and
efficient way. We present a hybrid approach for itemset, sequence and graph
mining which exploits dedicated highly optimized mining systems to detect
frequent patterns and then filters the results using declarative ASP. To
further demonstrate the generic nature of our hybrid framework we apply it to a
problem of approximately tiling a database. Experiments on real-world datasets
show the effectiveness of the proposed method and computational gains for
itemset, sequence and graph mining, as well as approximate tiling.
  Under consideration in Theory and Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Wed, 22 Aug 2018 10:21:13 GMT'}]",2020-02-19,"[['Paramonov', 'Sergey', ''], ['Stepanova', 'Daria', ''], ['Miettinen', 'Pauli', '']]","['answer set programming', 'pattern mining', 'structured mining', 'sequence mining', 'itemset mining', 'graph mining']"
1381,1503.07716,Gayatri Venugopal Miss,Gayatri Venugopal,"A Review of Popular Applications on Google Play - Do They Cater to
  Visually Impaired Users?","19 pages, 1 figure, 3 tables","Indian Journal of Science and Technology, Vol 8 S4, 221 to 239,
  February 2015",10.17485/ijst/2015/v8iS4/61436,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The number of applications on online mobile application stores is increasing
at a rapid rate. Smart-phones are used by a wide range of people varying in
age, and also in the ability to use a smart phone. With the increasing
dependency on smart-phones, the paper aims to determine whether the popular
applications on Google Play, the official store for Android applications, can
be used by people with vision impairment. The accessibility of the applications
was tested using an external keyboard, and TalkBack, an accessibility tool
developed by Google. It was found that several popular applications on the
store were not designed keeping accessibility in mind. It was observed that
there exists a weak positive relationship between the popularity of the
application and its accessibility. A framework is proposed that can be used by
developers to improve the accessibility of an application. The paper also
discusses the programming aspects to be considered while developing an Android
application, so that the application can be used by sighted as well as visually
impaired users.
","[{'version': 'v1', 'created': 'Thu, 26 Mar 2015 12:56:20 GMT'}]",2015-03-27,"[['Venugopal', 'Gayatri', '']]","['Accessibility', 'Android', 'Google Play', 'Inclusive Design', 'Visually Impaired']"
1382,1112.6179,Laurent Poinsot,Laurent Poinsot (LIPN),The Tutte-Grothendieck group of a convergent alphabetic rewriting system,17 pages,ISRN Combinatorics 2013 (2013) 1-11,10.1155/2013/574578,,cs.DM math.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The two operations, deletion and contraction of an edge, on multigraphs
directly lead to the Tutte polynomial which satisfies a universal problem. As
observed by Brylawski in terms of order relations, these operations may be
interpreted as a particular instance of a general theory which involves
universal invariants like the Tutte polynomial, and a universal group, called
the Tutte-Grothendieck group. In this contribution, Brylawski's theory is
extended in two ways: first of all, the order relation is replaced by a string
rewriting system, and secondly, commutativity by partial commutations (that
permits a kind of interpolation between non commutativity and full
commutativity). This allows us to clarify the relations between the semigroup
subject to rewriting and the Tutte-Grothendieck group: the later is actually
the Grothendieck group completion of the former, up to the free adjunction of a
unit (this was even not mention by Brylawski), and normal forms may be seen as
universal invariants. Moreover we prove that such universal constructions are
also possible in case of a non convergent rewriting system, outside the scope
of Brylawski's work.
","[{'version': 'v1', 'created': 'Wed, 28 Dec 2011 20:30:01 GMT'}]",2013-03-08,"[['Poinsot', 'Laurent', '', 'LIPN']]","['Semi-Thue system', 'semigroup', 'free partially commutative structure', 'Grothendieck group completion', 'universal invariant']"
1383,1109.0708,Annmol Cherian,"Annmol Cherian, Ajay Augustine, Jemy Jose, Vinod Pangracious","A Novel Methodology for Thermal Analysis & 3-Dimensional Memory
  Integration",,"International Journal of Advanced Information Technology (IJAIT)
  Vol. 1, No. 4, August 2011",10.5121/ijait.2011.1403,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The semiconductor industry is reaching a fascinating confluence in several
evolutionary trends that will likely lead to a number of revolutionary changes
in the design, implementation, scaling, and the use of computer systems.
However, recently Moore's law has come to a stand-still since device scaling
beyond 65 nm is not practical. 2D integration has problems like memory latency,
power dissipation, and large foot-print. 3D technology comes as a solution to
the problems posed by 2D integration. The utilization of 3D is limited by the
problem of temperature crisis. It is important to develop an accurate power
profile extraction methodology to design 3D structure. In this paper, design of
3D integration of memory is considered and hence the static power dissipation
of the memory cell is analysed in transistor level and is used to accurately
model the inter-layer thermal effects for 3D memory stack. Subsequently,
packaging of the chip is considered and modelled using an architecture level
simulator. This modelling is intended to analyse the thermal effects of 3D
memory, its reliability and lifetime of the chip, with greater accuracy.
","[{'version': 'v1', 'created': 'Sun, 4 Sep 2011 12:28:46 GMT'}]",2011-09-06,"[['Cherian', 'Annmol', ''], ['Augustine', 'Ajay', ''], ['Jose', 'Jemy', ''], ['Pangracious', 'Vinod', '']]","['3D integration', '3D memory', 'Thermal effects']"
1384,1807.11322,Anna Spagnolli,"Anna Spagnolli, Diletta Mora, Matteo Fanchin, Valeria Orso, Luciano
  Gamberini","Embracing ambivalence in studying technology acceptance: A qualitative
  study on automated visual software for live music performance","25 pages,2 figures, 2 tables",,10.1145/3313831.3376463,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although the live music entertainment sector does not directly fuel the
current debate on automation, it might harbor positions that resonate with it.
In this paper we study a prototype software application helping DJs and VJs to
accurately manage and even automate the synchronization of visuals with music
during amateur or professional live performance. The goal of the study was to
unravel VJs' and DJs' ambivalent positions about this software. We
preliminarily investigated VJs' and DJs' perception of their sector of activity
with seven face-to-face interviews and an online survey (N = 102); then, we
asked DJs and VJs (N = 25) for their opinions about our prototype software
application. Four core controversies were identified in their answers, along
with a set of arguments mobilized to take side on them. The advantages of
focusing on ambivalence and argumentation when studying users' response to new
media are discussed.
","[{'version': 'v1', 'created': 'Mon, 30 Jul 2018 12:46:18 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Feb 2019 18:44:06 GMT'}]",2020-05-27,"[['Spagnolli', 'Anna', ''], ['Mora', 'Diletta', ''], ['Fanchin', 'Matteo', ''], ['Orso', 'Valeria', ''], ['Gamberini', 'Luciano', '']]","['ambivalence', 'qualitative', 'automation', 'live music performance']"
1385,1403.4662,Justin Dobbs,"Justin R. Dobbs, Brandon M. Hencey",Model Predictive HVAC Control with Online Occupancy Model,"Energy and Buildings preprint, submitted July 2014, 27 pages, 13
  figures",,10.1016/j.enbuild.2014.07.051,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an occupancy-predicting control algorithm for heating,
ventilation, and air conditioning (HVAC) systems in buildings. It incorporates
the building's thermal properties, local weather predictions, and a self-tuning
stochastic occupancy model to reduce energy consumption while maintaining
occupant comfort. Contrasting with existing approaches, the occupancy model
requires no manual training and adapts to changes in occupancy patterns during
operation. A prediction-weighted cost function provides conditioning of thermal
zones before occupancy begins and reduces system output before occupancy ends.
Simulation results with real-world occupancy data demonstrate the algorithm's
effectiveness.
","[{'version': 'v1', 'created': 'Wed, 19 Mar 2014 01:44:51 GMT'}, {'version': 'v2', 'created': 'Sat, 26 Jul 2014 19:15:12 GMT'}]",2014-07-29,"[['Dobbs', 'Justin R.', ''], ['Hencey', 'Brandon M.', '']]","['model predictive control', 'MPC', 'occupancy prediction', 'on-line training', 'Markov chains', 'HVAC']"
1386,1705.09014,Renato Portugal,"A. Abreu, L. Cunha, T. Fernandes, C. de Figueiredo, L. Kowada, F.
  Marquezino, D. Posner, R. Portugal",The tessellation problem of quantum walks,"10 pages, 7 figs","Theoretical Computer Science 801, 175-191, 2020",10.1016/j.tcs.2019.09.013,,cs.DM cs.CC math.CO quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quantum walks have received a great deal of attention recently because they
can be used to develop new quantum algorithms and to simulate interesting
quantum systems. In this work, we focus on a model called staggered quantum
walk, which employs advanced ideas of graph theory and has the advantage of
including the most important instances of other discrete-time models. The
evolution operator of the staggered model is obtained from a tessellation
cover, which is defined in terms of a set of partitions of the graph into
cliques. It is important to establish the minimum number of tessellations
required in a tessellation cover, and what classes of graphs admit a small
number of tessellations. We describe two main results: (1) infinite classes of
graphs where we relate the chromatic number of the clique graph to the minimum
number of tessellations required in a tessellation cover, and (2) the problem
of deciding whether a graph is $k$-tessellable for $k\ge 3$ is NP-complete.
","[{'version': 'v1', 'created': 'Thu, 25 May 2017 01:26:40 GMT'}]",2021-06-22,"[['Abreu', 'A.', ''], ['Cunha', 'L.', ''], ['Fernandes', 'T.', ''], ['de Figueiredo', 'C.', ''], ['Kowada', 'L.', ''], ['Marquezino', 'F.', ''], ['Posner', 'D.', ''], ['Portugal', 'R.', '']]","['staggered quantum walk', 'clique graph', 'tessellation', 'NP-completeness']"
1387,1708.00544,Jeremy Kepner,"Michael Jones, Jeremy Kepner, William Arcand, David Bestor, Bill
  Bergeron, Vijay Gadepally, Michael Houle, Matthew Hubbell, Peter Michaleas,
  Andrew Prout, Albert Reuther, Siddharth Samsi, Paul Monticiollo",Performance Measurements of Supercomputing and Cloud Storage Solutions,"5 pages, 4 figures, to appear in IEEE HPEC 2017",,10.1109/HPEC.2017.8091073,,cs.DC astro-ph.IM cs.NI cs.OS cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Increasing amounts of data from varied sources, particularly in the fields of
machine learning and graph analytics, are causing storage requirements to grow
rapidly. A variety of technologies exist for storing and sharing these data,
ranging from parallel file systems used by supercomputers to distributed block
storage systems found in clouds. Relatively few comparative measurements exist
to inform decisions about which storage systems are best suited for particular
tasks. This work provides these measurements for two of the most popular
storage technologies: Lustre and Amazon S3. Lustre is an open-source, high
performance, parallel file system used by many of the largest supercomputers in
the world. Amazon's Simple Storage Service, or S3, is part of the Amazon Web
Services offering, and offers a scalable, distributed option to store and
retrieve data from anywhere on the Internet. Parallel processing is essential
for achieving high performance on modern storage systems. The performance tests
used span the gamut of parallel I/O scenarios, ranging from single-client,
single-node Amazon S3 and Lustre performance to a large-scale, multi-client
test designed to demonstrate the capabilities of a modern storage appliance
under heavy load. These results show that, when parallel I/O is used correctly
(i.e., many simultaneous read or write processes), full network bandwidth
performance is achievable and ranged from 10 gigabits/s over a 10 GigE S3
connection to 0.35 terabits/s using Lustre on a 1200 port 10 GigE switch. These
results demonstrate that S3 is well-suited to sharing vast quantities of data
over the Internet, while Lustre is well-suited to processing large quantities
of data locally.
","[{'version': 'v1', 'created': 'Tue, 1 Aug 2017 22:48:06 GMT'}]",2018-03-06,"[['Jones', 'Michael', ''], ['Kepner', 'Jeremy', ''], ['Arcand', 'William', ''], ['Bestor', 'David', ''], ['Bergeron', 'Bill', ''], ['Gadepally', 'Vijay', ''], ['Houle', 'Michael', ''], ['Hubbell', 'Matthew', ''], ['Michaleas', 'Peter', ''], ['Prout', 'Andrew', ''], ['Reuther', 'Albert', ''], ['Samsi', 'Siddharth', ''], ['Monticiollo', 'Paul', '']]","['High Performance Computing', 'High PerformanceStorage', 'Lustre', 'Amazon Simple Storage Service', 'MIT SuperCloud']"
1388,2209.13925,Jiayin Cai,"Jiayin Cai, Changlin Li, Xin Tao, Chun Yuan and Yu-Wing Tai",DeViT: Deformed Vision Transformers in Video Inpainting,,"ACMMM'22, October 10-14, 2022, Lisboa, Portugal",10.1145/3503161.3548395,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  This paper proposes a novel video inpainting method. We make three main
contributions: First, we extended previous Transformers with patch alignment by
introducing Deformed Patch-based Homography (DePtH), which improves patch-level
feature alignments without additional supervision and benefits challenging
scenes with various deformation. Second, we introduce Mask Pruning-based Patch
Attention (MPPA) to improve patch-wised feature matching by pruning out less
essential features and using saliency map. MPPA enhances matching accuracy
between warped tokens with invalid pixels. Third, we introduce a
Spatial-Temporal weighting Adaptor (STA) module to obtain accurate attention to
spatial-temporal tokens under the guidance of the Deformation Factor learned
from DePtH, especially for videos with agile motions. Experimental results
demonstrate that our method outperforms recent methods qualitatively and
quantitatively and achieves a new state-of-the-art.
","[{'version': 'v1', 'created': 'Wed, 28 Sep 2022 08:57:14 GMT'}]",2022-09-29,"[['Cai', 'Jiayin', ''], ['Li', 'Changlin', ''], ['Tao', 'Xin', ''], ['Yuan', 'Chun', ''], ['Tai', 'Yu-Wing', '']]","['Video Inpainting', 'Transformer Networks', 'Patch-based HomographyEstimator', 'Mask Pruning-based Patch Attention']"
1389,2001.06466,"Serhan G\""ul","Serhan G\""ul, Dimitri Podborski, Thomas Buchholz, Thomas Schierl,
  Cornelius Hellge","Low-latency Cloud-based Volumetric Video Streaming Using Head Motion
  Prediction","7 pages, 4 figures","30th ACM Workshop on Network and Operating Systems Support for
  Digital Audio and Video (NOSSDAV) 2020",10.1145/3386290.3396933,,cs.MM eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Volumetric video is an emerging key technology for immersive representation
of 3D spaces and objects. Rendering volumetric video requires lots of
computational power which is challenging especially for mobile devices. To
mitigate this, we developed a streaming system that renders a 2D view from the
volumetric video at a cloud server and streams a 2D video stream to the client.
However, such network-based processing increases the motion-to-photon (M2P)
latency due to the additional network and processing delays. In order to
compensate the added latency, prediction of the future user pose is necessary.
We developed a head motion prediction model and investigated its potential to
reduce the M2P latency for different look-ahead times. Our results show that
the presented model reduces the rendering errors caused by the M2P latency
compared to a baseline system in which no prediction is performed.
","[{'version': 'v1', 'created': 'Fri, 17 Jan 2020 18:35:31 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Jul 2020 13:45:30 GMT'}]",2020-07-17,"[['Gül', 'Serhan', ''], ['Podborski', 'Dimitri', ''], ['Buchholz', 'Thomas', ''], ['Schierl', 'Thomas', ''], ['Hellge', 'Cornelius', '']]","['volumetric video', 'augmented reality', 'mixed reality', 'cloud streaming', 'head motion prediction']"
1390,1308.5480,Boris Leistedt,"Boris Leistedt, Hiranya V. Peiris, and Jason D. McEwen",Flaglets for studying the large-scale structure of the Universe,"Proceedings of Wavelets and Sparsity XV, SPIE Optics and Photonics
  2013","Proc. SPIE 8858, Wavelets and Sparsity XV, 88580J (2013)",10.1117/12.2022869,,cs.IT astro-ph.CO astro-ph.IM math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pressing questions in cosmology such as the nature of dark matter and dark
energy can be addressed using large galaxy surveys, which measure the
positions, properties and redshifts of galaxies in order to map the large-scale
structure of the Universe. We review the Fourier-Laguerre transform, a novel
transform in 3D spherical coordinates which is based on spherical harmonics
combined with damped Laguerre polynomials and appropriate for analysing galaxy
surveys. We also recall the construction of flaglets, 3D wavelets obtained
through a tiling of the Fourier-Laguerre space, which can be used to extract
scale-dependent, spatially localised features on the ball. We exploit a
sampling theorem to obtain exact Fourier-Laguerre and flaglet transforms, such
that band-limited signals can analysed and reconstructed at floating point
accuracy on a finite number of voxels on the ball. We present a potential
application of the flaglet transform for finding voids in galaxy surveys and
studying the large-scale structure of the Universe.
","[{'version': 'v1', 'created': 'Mon, 26 Aug 2013 03:31:07 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Sep 2013 09:52:45 GMT'}]",2013-12-10,"[['Leistedt', 'Boris', ''], ['Peiris', 'Hiranya V.', ''], ['McEwen', 'Jason D.', '']]","['Harmonic analysis', 'wavelets', 'three-dimensional ball', 'cosmology', 'galaxy surveys', 'cosmic voids']"
1391,1005.1753,Secretary Aircc Journal,"Meriem Abid (1,2), Tara Ali Yahiya (3) and Guy Pujolle (1) ((1)
  Laboratoire d'Informatique de Paris, France, (2) Ginkgo Networks, France, (3)
  Telecom SudParis, France)","On the Minimization of Handover Decision Instability in Wireless Local
  Area Networks","13 Pages, IJWMN",,10.5121/ijcnc.2010.2304,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper addresses handover decision instability which impacts negatively
on both user perception and network performances. To this aim, a new technique
called The HandOver Decision STAbility Technique (HODSTAT) is proposed for
horizontal handover in Wireless Local Area Networks (WLAN) based on IEEE
802.11standard. HODSTAT is based on a hysteresis margin analysis that, combined
with a utilitybased function, evaluates the need for the handover and
determines if the handover is needed or avoided. Indeed, if a Mobile Terminal
(MT) only transiently hands over to a better network, the gain from using this
new network may be diminished by the handover overhead and short usage
duration. The approach that we adopt throughout this article aims at reducing
the minimum handover occurrence that leads to the interruption of network
connectivity (this is due to the nature of handover in WLAN which is a break
before make which causes additional delay and packet loss). To this end, MT
rather performs a handover only if the connectivity of the current network is
threatened or if the performance of a neighboring network is really better
comparing the current one with a hysteresis margin. This hysteresis should make
a tradeoff between handover occurrence and the necessity to change the current
network of attachment. Our extensive simulation results show that our proposed
algorithm outperforms other decision stability approaches for handover decision
algorithm.
","[{'version': 'v1', 'created': 'Tue, 11 May 2010 08:35:49 GMT'}]",2010-05-12,"[['Abid', 'Meriem', ''], ['Yahiya', 'Tara Ali', ''], ['Pujolle', 'Guy', '']]","['Handover Decision stability', 'Ping-pong Effect', 'Autonomic Networks', 'Piloting Plane Concept']"
1392,0810.1139,Moufida Maimour,"Moufida Maimour (CRAN), Congduc Pham (LIUPPA), Julien Amelot (CRAN)","Load Repartition for Congestion Control in Multimedia Wireless Sensor
  Networks with Multipath Routing",,"3rd International Symposium on Wireless Pervasive Computing, ISWPC
  2008, Santorini : Gr\`ece (2008)",10.1109/ISWPC.2008.4556156,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless sensor networks hold a great potential in the deployment of several
applications of a paramount importance in our daily life. Video sensors are
able to improve a number of these applications where new approaches adapted to
both wireless sensor networks and video transport specific characteristics are
required. The aim of this work is to provide the necessary bandwidth and to
alleviate the congestion problem to video streaming. In this paper, we
investigate various load repartition strategies for congestion control
mechanism on top of a multipath routing feature. Simulations are performed in
order to get insight into the performances of our proposals.
","[{'version': 'v1', 'created': 'Tue, 7 Oct 2008 09:32:40 GMT'}]",2009-01-18,"[['Maimour', 'Moufida', '', 'CRAN'], ['Pham', 'Congduc', '', 'LIUPPA'], ['Amelot', 'Julien', '', 'CRAN']]","['Congestion control', 'Multipath routing', 'Sensornetworks', 'Video transport']"
1393,1004.2079,Yashodhan Kanoria,"Mohsen Bayati, Christian Borgs, Jennifer Chayes, Yashodhan Kanoria and
  Andrea Montanari",Bargaining dynamics in exchange networks,"47 pages, SODA 2011, invited to Journal of Economic Theory",Proc. ACM-SIAM Symp. on Discrete Algorithms (2011) 1518-1537,,,cs.GT cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a one-sided assignment market or exchange network with
transferable utility and propose a model for the dynamics of bargaining in such
a market. Our dynamical model is local, involving iterative updates of 'offers'
based on estimated best alternative matches, in the spirit of pairwise Nash
bargaining. We establish that when a balanced outcome (a generalization of the
pairwise Nash bargaining solution to networks) exists, our dynamics converges
rapidly to such an outcome. We extend our results to the cases of (i) general
agent 'capacity constraints', i.e., an agent may be allowed to participate in
multiple matches, and (ii) 'unequal bargaining powers' (where we also find a
surprising change in rate of convergence).
","[{'version': 'v1', 'created': 'Mon, 12 Apr 2010 23:11:16 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Dec 2011 19:40:38 GMT'}]",2015-03-14,"[['Bayati', 'Mohsen', ''], ['Borgs', 'Christian', ''], ['Chayes', 'Jennifer', ''], ['Kanoria', 'Yashodhan', ''], ['Montanari', 'Andrea', '']]","['Nash bargaining', 'network', 'dynamics', 'convergence', 'matching', 'assignment', 'exchange', 'balanced outcomes']"
1394,1509.08295,Matteo Morini,"Pablo Jensen, Matteo Morini, Marton Karsai, Tommaso Venturini,
  Alessandro Vespignani, Mathieu Jacomy, Jean-Philippe Cointet, Pierre Merckle,
  Eric Fleury",Detecting global bridges in networks,Journal of Complex Networks Preprint; 14 pages; 6 figures,,10.1093/comnet/cnv022,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The identification of nodes occupying important positions in a network
structure is crucial for the understanding of the associated real-world system.
Usually, betweenness centrality is used to evaluate a node capacity to connect
different graph regions. However, we argue here that this measure is not
adapted for that task, as it gives equal weight to ""local"" centers (i.e. nodes
of high degree central to a single region) and to ""global"" bridges, which
connect different communities. This distinction is important as the roles of
such nodes are different in terms of the local and global organisation of the
network structure. In this paper we propose a decomposition of betweenness
centrality into two terms, one highlighting the local contributions and the
other the global ones. We call the latter bridgeness centrality and show that
it is capable to specifically spot out global bridges. In addition, we
introduce an effective algorithmic implementation of this measure and
demonstrate its capability to identify global bridges in air transportation and
scientific collaboration networks.
","[{'version': 'v1', 'created': 'Mon, 28 Sep 2015 12:51:29 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Sep 2015 17:33:33 GMT'}]",2015-11-17,"[['Jensen', 'Pablo', ''], ['Morini', 'Matteo', ''], ['Karsai', 'Marton', ''], ['Venturini', 'Tommaso', ''], ['Vespignani', 'Alessandro', ''], ['Jacomy', 'Mathieu', ''], ['Cointet', 'Jean-Philippe', ''], ['Merckle', 'Pierre', ''], ['Fleury', 'Eric', '']]","['Centrality Measures', 'Betweenness Centrality', 'Bridgeness Centrality']"
1395,2203.01129,Manu Lahariya,Manu Lahariya and Dries Benoit and Chris Develder,"Defining a synthetic data generator for realistic electric vehicle
  charging sessions",,"e-Energy 20 Proceedings of the Eleventh ACM International
  Conference on Future Energy Systems June 2020 Pages 406 407",10.1145/3396851.3403509,,cs.OH cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Electric vehicle (EV) charging stations have become prominent in electricity
grids in the past years. Analysis of EV charging sessions is useful for
flexibility analysis, load balancing, offering incentives to customers, etc.
Yet, the limited availability of such EV sessions data hinders further
development in these fields. Addressing this need for publicly available and
realistic data, we develop a synthetic data generator (SDG) for EV charging
sessions. Our SDG assumes the EV inter-arrival time to follow an exponential
distribution. Departure times are modeled by defining a conditional probability
density function (pdf) for connection times. This pdf for connection time and
required energy is fitted by Gaussian mixture models. Since we train our SDG
using a large real-world dataset, its output is realistic.
","[{'version': 'v1', 'created': 'Mon, 28 Feb 2022 11:18:40 GMT'}]",2022-03-03,"[['Lahariya', 'Manu', ''], ['Benoit', 'Dries', ''], ['Develder', 'Chris', '']]","['Smart Grid', 'Electric Vehicle', 'Synthetic Data', 'Exponential Process', 'Gaussian Mixture Models']"
1396,1809.00836,Andrea Esuli,"Andrea Esuli, Alejandro Moreo Fern\'andez, Fabrizio Sebastiani",A Recurrent Neural Network for Sentiment Quantification,Accepted for publication at CIKM 2018,"Final version published in Proceedings of the 27th ACM
  International Conference on Information and Knowledge Management (CIKM 2018),
  Torino, IT, 2018",10.1145/3269206.3269287,,cs.LG cs.CL stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quantification is a supervised learning task that consists in predicting,
given a set of classes C and a set D of unlabelled items, the prevalence (or
relative frequency) p(c|D) of each class c in C. Quantification can in
principle be solved by classifying all the unlabelled items and counting how
many of them have been attributed to each class. However, this ""classify and
count"" approach has been shown to yield suboptimal quantification accuracy;
this has established quantification as a task of its own, and given rise to a
number of methods specifically devised for it. We propose a recurrent neural
network architecture for quantification (that we call QuaNet) that observes the
classification predictions to learn higher-order ""quantification embeddings"",
which are then refined by incorporating quantification predictions of simple
classify-and-count-like methods. We test {QuaNet on sentiment quantification on
text, showing that it substantially outperforms several state-of-the-art
baselines.
","[{'version': 'v1', 'created': 'Tue, 4 Sep 2018 08:41:53 GMT'}]",2021-09-22,"[['Esuli', 'Andrea', ''], ['Fernández', 'Alejandro Moreo', ''], ['Sebastiani', 'Fabrizio', '']]","['Quantification', 'Neural Networks', 'Deep Learning', 'Sentiment Analysis', 'Opinion Mining']"
1397,1810.07310,Yu-Hang Tang,"Yu-Hang Tang, Wibe A. de Jong",Prediction of Atomization Energy Using Graph Kernel and Active Learning,,"J. Chem. Phys. 150(4): 044107, 2019",10.1063/1.5078640,,cs.LG cond-mat.mtrl-sci cs.CE physics.comp-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data-driven prediction of molecular properties presents unique challenges to
the design of machine learning methods concerning data
structure/dimensionality, symmetry adaption, and confidence management. In this
paper, we present a kernel-based pipeline that can learn and predict the
atomization energy of molecules with high accuracy. The framework employs
Gaussian process regression to perform predictions based on the similarity
between molecules, which is computed using the marginalized graph kernel. To
apply the marginalized graph kernel, a spatial adjacency rule is first employed
to convert molecules into graphs whose vertices and edges are labeled by
elements and interatomic distances, respectively. We then derive formulas for
the efficient evaluation of the kernel. Specific functional components for the
marginalized graph kernel are proposed, while the effect of the associated
hyperparameters on accuracy and predictive confidence are examined. We show
that the graph kernel is particularly suitable for predicting extensive
properties because its convolutional structure coincides with that of the
covariance formula between sums of random variables. Using an active learning
procedure, we demonstrate that the proposed method can achieve a mean absolute
error of 0.62 +- 0.01 kcal/mol using as few as 2000 training samples on the QM7
data set.
","[{'version': 'v1', 'created': 'Tue, 16 Oct 2018 23:21:03 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Oct 2018 06:39:50 GMT'}, {'version': 'v3', 'created': 'Wed, 30 Jan 2019 06:00:28 GMT'}]",2019-01-31,"[['Tang', 'Yu-Hang', ''], ['de Jong', 'Wibe A.', '']]","['data-driven modeling', 'structured data', 'labeled graph', 'kernel method', 'quantum mechanics', 'computational']"
1398,0910.5599,Dror Rawitz,"Boaz Patt-Shamir, Dror Rawitz",Vector Bin Packing with Multiple-Choice,,,10.1007/978-3-642-13731-0_24,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a variant of bin packing called multiple-choice vector bin
packing. In this problem we are given a set of items, where each item can be
selected in one of several $D$-dimensional incarnations. We are also given $T$
bin types, each with its own cost and $D$-dimensional size. Our goal is to pack
the items in a set of bins of minimum overall cost. The problem is motivated by
scheduling in networks with guaranteed quality of service (QoS), but due to its
general formulation it has many other applications as well. We present an
approximation algorithm that is guaranteed to produce a solution whose cost is
about $\ln D$ times the optimum. For the running time to be polynomial we
require $D=O(1)$ and $T=O(\log n)$. This extends previous results for vector
bin packing, in which each item has a single incarnation and there is only one
bin type. To obtain our result we also present a PTAS for the multiple-choice
version of multidimensional knapsack, where we are given only one bin and the
goal is to pack a maximum weight set of (incarnations of) items in that bin.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2009 10:00:37 GMT'}]",2015-05-14,"[['Patt-Shamir', 'Boaz', ''], ['Rawitz', 'Dror', '']]","['Approximation Algorithms', 'Multiple-Choice Vector Bin Packing', 'Multiple-ChoiceMultidimensional Knapsack']"
1399,1611.03799,Rishin Haldar,"Rohan Kar, Rishin Haldar","Applying Chatbots to the Internet of Things: Opportunities and
  Architectural Elements","9 pages, 3 figures, 5 Use Cases",,10.14569/IJACSA.2016.071119,,cs.AI cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet of Things (IoT) is emerging as a significant technology in shaping
the future by connecting physical devices or things with internet. It also
presents various opportunities for intersection of other technological trends
which can allow it to become even more intelligent and efficient. In this paper
we focus our attention on the integration of Intelligent Conversational
Software Agents or Chatbots with IoT. Literature surveys have looked into
various applications, features, underlying technologies and known challenges of
IoT. On the other hand, Chatbots are being adopted in greater numbers due to
major strides in development of platforms and frameworks. The novelty of this
paper lies in the specific integration of Chatbots in the IoT scenario. We
analyzed the shortcomings of existing IoT systems and put forward ways to
tackle them by incorporating chatbots. A general architecture is proposed for
implementing such a system, as well as platforms and frameworks, both
commercial and open source, which allow for implementation of such systems.
Identification of the newer challenges and possible future directions with this
new integration, have also been addressed.
","[{'version': 'v1', 'created': 'Fri, 11 Nov 2016 17:56:04 GMT'}]",2016-12-09,"[['Kar', 'Rohan', ''], ['Haldar', 'Rishin', '']]","['Internet of Things', 'Chatbots', 'Human']"
1400,1405.2794,Theofrastos Mantadelis,"Thepfrastos Mantadelis, Ricardo Rocha and Paulo Moura","Tabling, Rational Terms, and Coinduction Finally Together!",To appear in Theory and Practice of Logic Programming (TPLP),Theory and Practice of Logic Programming 14 (2014) 429-443,10.1017/S147106841400012X,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To appear in Theory and Practice of Logic Programming (TPLP). Tabling is a
commonly used technique in logic programming for avoiding cyclic behavior of
logic programs and enabling more declarative program definitions. Furthermore,
tabling often improves computational performance. Rational term are terms with
one or more infinite sub-terms but with a finite representation. Rational terms
can be generated in Prolog by omitting the occurs check when unifying two
terms. Applications of rational terms include definite clause grammars,
constraint handling systems, and coinduction. In this paper, we report our
extension of YAP's Prolog tabling mechanism to support rational terms. We
describe the internal representation of rational terms within the table space
and prove its correctness. We then use this extension to implement a tabling
based approach to coinduction. We compare our approach with current coinductive
transformations and describe the implementation. In addition, we present an
algorithm that ensures a canonical representation for rational terms.
","[{'version': 'v1', 'created': 'Fri, 9 May 2014 17:07:26 GMT'}, {'version': 'v2', 'created': 'Thu, 15 May 2014 18:05:13 GMT'}]",2020-02-19,"[['Mantadelis', 'Thepfrastos', ''], ['Rocha', 'Ricardo', ''], ['Moura', 'Paulo', '']]","['Tabling', 'Rational Terms', 'Coinduction', 'Implementation']"
1401,1208.2766,EPTCS,"Gabriele Fici (Universit\'e Nice Sophia Antipolis, France), Francesca
  Fiorenzi (Universit\'e Paris-Sud 11, France)",Topological properties of cellular automata on trees,"In Proceedings AUTOMATA&JAC 2012, arXiv:1208.2498","EPTCS 90, 2012, pp. 255-266",10.4204/EPTCS.90.20,,cs.FL cs.CC cs.DM nlin.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove that there do not exist positively expansive cellular automata
defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some
topological properties of these automata and their relationships, namely
permutivity, surjectivity, preinjectivity, right-closingness and openness.
","[{'version': 'v1', 'created': 'Tue, 14 Aug 2012 01:55:58 GMT'}]",2012-08-15,"[['Fici', 'Gabriele', '', 'Université Nice Sophia Antipolis, France'], ['Fiorenzi', 'Francesca', '', 'Université Paris-Sud 11, France']]","['Cellular automaton', 'tree shift', 'expansivity', 'permutivity', 'right-closingness', 'openness']"
1402,1809.02657,Palash Goyal,"Palash Goyal, Sujit Rokka Chhetri, Arquimedes Canedo","dyngraph2vec: Capturing Network Dynamics using Dynamic Graph
  Representation Learning",,,10.1016/j.knosys.2019.06.024,,cs.SI cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning graph representations is a fundamental task aimed at capturing
various properties of graphs in vector space. The most recent methods learn
such representations for static networks. However, real world networks evolve
over time and have varying dynamics. Capturing such evolution is key to
predicting the properties of unseen networks. To understand how the network
dynamics affect the prediction performance, we propose an embedding approach
which learns the structure of evolution in dynamic graphs and can predict
unseen links with higher precision. Our model, dyngraph2vec, learns the
temporal transitions in the network using a deep architecture composed of dense
and recurrent layers. We motivate the need of capturing dynamics for prediction
on a toy data set created using stochastic block models. We then demonstrate
the efficacy of dyngraph2vec over existing state-of-the-art methods on two real
world data sets. We observe that learning dynamics can improve the quality of
embedding and yield better performance in link prediction.
","[{'version': 'v1', 'created': 'Fri, 7 Sep 2018 20:03:51 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Jul 2019 14:49:56 GMT'}]",2019-08-22,"[['Goyal', 'Palash', ''], ['Chhetri', 'Sujit Rokka', ''], ['Canedo', 'Arquimedes', '']]","['Graph embedding techniques', 'Graph embedding applications', 'Python Graph Embedding Methods GEM Library']"
1403,1703.00817,Daniel Lerch Hostalot PhD,Daniel Lerch-Hostalot and David Meg\'ias,"LSB Matching Steganalysis Based on Patterns of Pixel Differences and
  Random Embedding",,,10.1016/j.cose.2012.11.005.,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel method for detection of LSB matching steganogra-
phy in grayscale images. This method is based on the analysis of the
differences between neighboring pixels before and after random data embedding.
In natu- ral images, there is a strong correlation between adjacent pixels.
This correla- tion is disturbed by LSB matching generating new types of
correlations. The pre- sented method generates patterns from these correlations
and analyzes their varia- tion when random data are hidden. The experiments
performed for two different image databases show that the method yields better
classification accuracy com- pared to prior art for both LSB matching and HUGO
steganography. In addition, although the method is designed for the spatial
domain, some experiments show its applicability also for detecting JPEG
steganography.
","[{'version': 'v1', 'created': 'Thu, 2 Mar 2017 15:01:03 GMT'}]",2017-03-03,"[['Lerch-Hostalot', 'Daniel', ''], ['Megías', 'David', '']]","['Communication security', 'steganalysis', 'steganography', 'LSB matching', 'Support Vector Machines']"
1404,1407.5324,Reza Azad,"Reza Azad, Babak Azad, Iman Tavakoli Kazerooni",Optimized Method for Iranian Road Signs Detection and recognition system,,"International Journal of Research in Computer Science, 4 (1): pp.
  19-26, January 2014",10.7815/ijorcs.41.2014.077,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Road sign recognition is one of the core technologies in Intelligent
Transport Systems. In the current study, a robust and real-time method is
presented to identify and detect the roads speed signs in road image in
different situations. In our proposed method, first, the connected components
are created in the main image using the edge detection and mathematical
morphology and the location of the road signs extracted by the geometric and
color data; then the letters are segmented and recognized by Multiclass Support
Vector Machine (SVMs) classifiers. Regarding that the geometric and color
features ate properly used in detection the location of the road signs, so it
is not sensitive to the distance and noise and has higher speed and efficiency.
In the result part, the proposed approach is applied on Iranian road speed sign
database and the detection and recognition accuracy rate achieved 98.66% and
100% respectively.
","[{'version': 'v1', 'created': 'Sun, 20 Jul 2014 18:53:20 GMT'}]",2014-07-22,"[['Azad', 'Reza', ''], ['Azad', 'Babak', ''], ['Kazerooni', 'Iman Tavakoli', '']]","['Road sign detection and recognition', 'edge detection', 'mathematical morphology', 'SVM classifier']"
1405,1801.05564,Pablo Su\'arez-Serrato,"E. Gallagher, P. Su\'arez-Serrato, E.I. Velazquez Richards",Socialbots whitewashing contested elections; a case study from Honduras,,"Third International Congress on Information and Communication
  Technology. Advances in Intelligent Systems and Computing, vol 797 (2019)",10.1007/978-981-13-1165-9_50,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We analyze socialbots active tweeting in relation to Juan Orlando
Hern\'andez, the recently re-elected president of Honduras. We find a clear
bimodal separation between humans and bots, using Botometer and its
classifiers. Around one hundred separate communities of socialbots are
identified and visualized, detected through the analysis of temporally
coordinated retweets.
","[{'version': 'v1', 'created': 'Wed, 17 Jan 2018 06:03:43 GMT'}]",2019-12-05,"[['Gallagher', 'E.', ''], ['Suárez-Serrato', 'P.', ''], ['Richards', 'E. I. Velazquez', '']]","['social network analysis', 'socialbots', 'elections', 'Spanish', 'Honduras']"
1406,1606.07525,EPTCS,Yoram Moses,"Relating Knowledge and Coordinated Action: The Knowledge of
  Preconditions Principle","In Proceedings TARK 2015, arXiv:1606.07295","EPTCS 215, 2016, pp. 231-245",10.4204/EPTCS.215.17,,cs.MA cs.AI cs.DC cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Knowledge of Preconditions principle (KoP) is proposed as a widely
applicable connection between knowledge and action in multi-agent systems.
Roughly speaking, it asserts that if some condition is a necessary condition
for performing a given action A, then knowing that this condition holds is also
a necessary condition for performing A. Since the specifications of tasks often
involve necessary conditions for actions, the KoP principle shows that such
specifications induce knowledge preconditions for the actions. Distributed
protocols or multi-agent plans that satisfy the specifications must ensure that
this knowledge be attained, and that it is detected by the agents as a
condition for action. The knowledge of preconditions principle is formalised in
the runs and systems framework, and is proven to hold in a wide class of
settings. Well-known connections between knowledge and coordinated action are
extended and shown to derive directly from the KoP principle: a ""common
knowledge of preconditions"" principle is established showing that common
knowledge is a necessary condition for performing simultaneous actions, and a
""nested knowledge of preconditions"" principle is proven, showing that
coordinating actions to be performed in linear temporal order requires a
corresponding form of nested knowledge.
","[{'version': 'v1', 'created': 'Fri, 24 Jun 2016 00:32:41 GMT'}]",2016-06-27,"[['Moses', 'Yoram', '']]","['Knowledge', 'multi-agent systems', 'common knowledge', 'nested knowledge', 'coordinatedaction', 'knowledge of preconditions principle']"
1407,2105.10731,Pablo E. Torres,"Pablo E. Torres, Philip I. N. Ulrich, Veronica Cucuiat, Mutlu
  Cukurova, Maria Fercovic De la Presa, Rose Luckin, Amanda Carr, Thomas Dylan,
  Abigail Durrant, John Vines, and Shaun Lawson","A systematic review of physical-digital play technology and
  developmentally relevant child behaviour","11 Tables, 1 Figure, 4 Appendices; Keywords: Systematic review,
  digital play, child development, child behaviour, child-computer interactions
  *Corresponding author info: Faculty of Education, University of Cambridge.
  Email: pelt2@cam.ac.uk; torresp.uk@gmail.com",,10.1016/j.ijcci.2021.100323,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  New interactive physical-digital play technologies are shaping the way
children plan. These technologies refer to digital play technologies that
engage children in analogue forms of behaviour, either alone or with others.
Current interactive physical-digital play technologies include robots, digital
agents, mixed or augmented reality devices, and smart-eye based gaming. Little
is known, however, about the ways in which these technologies could promote or
damage child development. This systematic review was aimed at understanding if
and how these physical-digital play technologies promoted developmentally
relevant behaviour in typically developing 0 to 12 year-olds. Psychology,
Education, and Computer Science databases were searched producing 635 paper. A
total of 31 papers met the inclusion criteria, of which 17 were of high enough
quality to be included for synthesis. Results indicate that these new
interactive play technologies could have a positive effect on children's
developmentally relevant behaviour. The review indicated specific ways in which
different behaviour were promoted. Providing information about own performance
promoted self-monitoring. Slowing interactivity, play interdependency, and
joint object accessibility promoted collaboration. Offering delimited choices
promoted decision making. Problem solving and physical activity were promoted
by requiring children to engage in them to keep playing. Four principles
underpinned the ways in which physical digital play technologies afforded child
behaviour. These included social expectations framing play situations, the
directiveness of action regulations (inviting, guiding or forcing behaviours),
the technical features of play technologies (digital play mechanics and
physical characteristics), and the alignment between play goals, play
technology and the play behaviours promoted.
","[{'version': 'v1', 'created': 'Sat, 22 May 2021 13:41:40 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Jun 2021 16:29:05 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Feb 2022 15:22:33 GMT'}]",2022-02-11,"[['Torres', 'Pablo E.', ''], ['Ulrich', 'Philip I. N.', ''], ['Cucuiat', 'Veronica', ''], ['Cukurova', 'Mutlu', ''], ['De la Presa', 'Maria Fercovic', ''], ['Luckin', 'Rose', ''], ['Carr', 'Amanda', ''], ['Dylan', 'Thomas', ''], ['Durrant', 'Abigail', ''], ['Vines', 'John', ''], ['Lawson', 'Shaun', '']]","['Systematic review', 'digital play', 'child development', 'child behaviour', 'child-computer interactions']"
1408,1706.04432,{\L}ukasz D\k{e}bowski,{\L}ukasz D\k{e}bowski,"Is Natural Language a Perigraphic Process? The Theorem about Facts and
  Words Revisited","29 pages, 1 figure","Entropy 20(2):85, 2018",10.3390/e20020085,,cs.IT cs.CL math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As we discuss, a stationary stochastic process is nonergodic when a random
persistent topic can be detected in the infinite random text sampled from the
process, whereas we call the process strongly nonergodic when an infinite
sequence of independent random bits, called probabilistic facts, is needed to
describe this topic completely. Replacing probabilistic facts with an
algorithmically random sequence of bits, called algorithmic facts, we adapt
this property back to ergodic processes. Subsequently, we call a process
perigraphic if the number of algorithmic facts which can be inferred from a
finite text sampled from the process grows like a power of the text length. We
present a simple example of such a process. Moreover, we demonstrate an
assertion which we call the theorem about facts and words. This proposition
states that the number of probabilistic or algorithmic facts which can be
inferred from a text drawn from a process must be roughly smaller than the
number of distinct word-like strings detected in this text by means of the PPM
compression algorithm. We also observe that the number of the word-like strings
for a sample of plays by Shakespeare follows an empirical stepwise power law,
in a stark contrast to Markov processes. Hence we suppose that natural language
considered as a process is not only non-Markov but also perigraphic.
","[{'version': 'v1', 'created': 'Wed, 14 Jun 2017 12:22:38 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Nov 2017 12:45:39 GMT'}]",2020-03-11,"[['Dębowski', 'Łukasz', '']]","['stationary processes', 'PPM code', 'mutual information', 'powerlaws', 'algorithmic information theory', 'natural language']"
1409,1709.02911,Vindula Jayawardana,"Vindula Jayawardana, Dimuthu Lakmal, Nisansa de Silva, Amal Shehan
  Perera, Keet Sugathadasa, Buddhi Ayesha, Madhavi Perera","Semi-Supervised Instance Population of an Ontology using Word Vector
  Embeddings",,,10.1109/ICTER.2017.8257822,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many modern day systems such as information extraction and knowledge
management agents, ontologies play a vital role in maintaining the concept
hierarchies of the selected domain. However, ontology population has become a
problematic process due to its nature of heavy coupling with manual human
intervention. With the use of word embeddings in the field of natural language
processing, it became a popular topic due to its ability to cope up with
semantic sensitivity. Hence, in this study, we propose a novel way of
semi-supervised ontology population through word embeddings as the basis. We
built several models including traditional benchmark models and new types of
models which are based on word embeddings. Finally, we ensemble them together
to come up with a synergistic model with better accuracy. We demonstrate that
our ensemble model can outperform the individual models.
","[{'version': 'v1', 'created': 'Sat, 9 Sep 2017 05:04:19 GMT'}]",2019-06-07,"[['Jayawardana', 'Vindula', ''], ['Lakmal', 'Dimuthu', ''], ['de Silva', 'Nisansa', ''], ['Perera', 'Amal Shehan', ''], ['Sugathadasa', 'Keet', ''], ['Ayesha', 'Buddhi', ''], ['Perera', 'Madhavi', '']]","['Ontology', 'Ontology Population', 'Word Embeddings', 'word2vec']"
1410,0910.1758,Laurent Tapie,"Laurent Tapie (LURPA), Kwamiwi Mawussi (LURPA), Bernard Anselmetti
  (LURPA)",Circular tests for HSM machine tools: Bore machining application,,"International Journal of Machine Tools & Manufacture 47 (2007)
  805-819",10.1016/j.ijmachtools.2006.06.021,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today's High-Speed Machining (HSM) machine tool combines productivity and
part quality. The difficulty inherent in HSM operations lies in understanding
the impact of machine tool behaviour on machining time and part quality.
Analysis of some of the relevant ISO standards (230-1998, 10791-1998) and a
complementary protocol for better understanding HSM technology are presented in
the first part of this paper. These ISO standards are devoted to the procedures
implemented in order to study the behavior of machine tool. As these procedures
do not integrate HSM technology, the need for HSM machine tool tests becomes
critical to improving the trade-off between machining time and part quality. A
new protocol for analysing the HSM technology impact during circular
interpolation is presented in the second part of the paper. This protocol which
allows evaluating kinematic machine tool behaviour during circular
interpolation was designed from tests without machining. These tests are
discussed and their results analysed in the paper. During the circular
interpolation, axis capacities (such as acceleration or Jerk) related to
certain setting parameters of the numerical control unit have a significant
impact on the value of the feed rate. Consequently, a kinematic model for a
circular-interpolated trajectory was developed on the basis of these
parameters. Moreover, the link between part accuracy and kinematic machine tool
behaviour was established. The kinematic model was ultimately validated on a
bore machining simulation.
","[{'version': 'v1', 'created': 'Fri, 9 Oct 2009 14:33:48 GMT'}]",2009-10-12,"[['Tapie', 'Laurent', '', 'LURPA'], ['Mawussi', 'Kwamiwi', '', 'LURPA'], ['Anselmetti', 'Bernard', '', 'LURPA']]","['circular interpolation', 'HSM', 'kinematic machine tool behaviour', 'jerk', 'feed rate limitation']"
1411,1611.02518,Davide Fiore,"Davide Fiore, Marco Coraggio, Mario di Bernardo","Observer design for piecewise smooth and switched systems via
  contraction theory",Preprint accepted to IFAC World Congress 2017,"IFAC-PapersOnLine, vol. 50, no. 1, pp. 2959-2964, 2017",10.1016/j.ifacol.2017.08.660,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of this paper is to present the application of an approach to study
contraction theory recently developed for piecewise smooth and switched
systems. The approach that can be used to analyze incremental stability
properties of so-called Filippov systems (or variable structure systems) is
based on the use of regularization, a procedure to make the vector field of
interest differentiable before analyzing its properties. We show that by using
this extension of contraction theory to nondifferentiable vector fields, it is
possible to design observers for a large class of piecewise smooth systems
using not only Euclidean norms, as also done in previous literature, but also
non-Euclidean norms. This allows greater flexibility in the design and
encompasses the case of both piecewise-linear and piecewise-smooth (nonlinear)
systems. The theoretical methodology is illustrated via a set of representative
examples.
","[{'version': 'v1', 'created': 'Tue, 8 Nov 2016 13:53:24 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Apr 2017 14:34:11 GMT'}]",2020-03-18,"[['Fiore', 'Davide', ''], ['Coraggio', 'Marco', ''], ['di Bernardo', 'Mario', '']]","['contraction theory', 'observer design', 'incremental stability', 'discontinuous control', 'regularization']"
1412,1804.04250,Sagar Sharma,"Sagar Sharma, Keke Chen, Amit Sheth","Towards Practical Privacy-Preserving Analytics for IoT and Cloud Based
  Healthcare Systems",Internet Computing March/April 2018,,10.1109/MIC.2018.112102519,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern healthcare systems now rely on advanced computing methods and
technologies, such as Internet of Things (IoT) devices and clouds, to collect
and analyze personal health data at an unprecedented scale and depth. Patients,
doctors, healthcare providers, and researchers depend on analytical models
derived from such data sources to remotely monitor patients, early-diagnose
diseases, and find personalized treatments and medications. However, without
appropriate privacy protection, conducting data analytics becomes a source of a
privacy nightmare. In this article, we present the research challenges in
developing practical privacy-preserving analytics in healthcare information
systems. The study is based on kHealth - a personalized digital healthcare
information system that is being developed and tested for disease monitoring.
We analyze the data and analytic requirements for the involved parties,
identify the privacy assets, analyze existing privacy substrates, and discuss
the potential tradeoff among privacy, efficiency, and model quality.
","[{'version': 'v1', 'created': 'Wed, 11 Apr 2018 22:42:59 GMT'}]",2018-04-13,"[['Sharma', 'Sagar', ''], ['Chen', 'Keke', ''], ['Sheth', 'Amit', '']]","['Privacy Preserving Outsourced Computation', 'Privacy Risks in Modern Healthcare', 'Precision Healthcare', 'Application']"
1413,0708.3057,Hai Jiang,"Hai Jiang, Ping Wang, H. Vincent Poor, and Weihua Zhuang",Voice Service Support in Mobile Ad Hoc Networks,"To appear in the Proceedings of the IEEE Global Communications
  Conference (GLOBECOM), Washington, DC, November 26 - 30, 2007",,10.1109/GLOCOM.2007.186,,cs.IT cs.NI math.IT,,"  Mobile ad hoc networks are expected to support voice traffic. The requirement
for small delay and jitter of voice traffic poses a significant challenge for
medium access control (MAC) in such networks. User mobility makes it more
complex due to the associated dynamic path attenuation. In this paper, a MAC
scheme for mobile ad hoc networks supporting voice traffic is proposed. With
the aid of a low-power probe prior to DATA transmissions, resource reservation
is achieved in a distributed manner, thus leading to small delay and jitter.
The proposed scheme can automatically adapt to dynamic path attenuation in a
mobile environment. Simulation results demonstrate the effectiveness of the
proposed scheme.
","[{'version': 'v1', 'created': 'Wed, 22 Aug 2007 17:12:10 GMT'}]",2016-11-17,"[['Jiang', 'Hai', ''], ['Wang', 'Ping', ''], ['Poor', 'H. Vincent', ''], ['Zhuang', 'Weihua', '']]","['medium access control', 'code-division multipleaccess', 'mobile ad hoc networks']"
1414,1803.00046,Janine Mergel,"Janine C. Mergel, Riad Sahli, Julien Scheibert, Roger A. Sauer",Continuum contact models for coupled adhesion and friction,,"The Journal of Adhesion, 95(12):1101-1133, 2019",10.1080/00218464.2018.1479258,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop two new continuum contact models for coupled adhesion and
friction, and discuss them in the context of existing models proposed in the
literature. Our new models are able to describe sliding friction even under
tensile normal forces, which seems reasonable for certain adhesion mechanisms.
In contrast, existing continuum models for combined adhesion and friction
typically include sliding friction only if local contact stresses are
compressive. Although such models work well for structures with sufficiently
strong local compression, they fail to capture sliding friction for soft and
compliant systems (like adhesive pads), for which the resistance to bending is
low. This can be overcome with our new models. For further motivation, we
additionally present experimental results for the onset of sliding of a smooth
glass plate on a smooth elastomer cap under low normal loads. As shown, the
findings from these experiments agree well with the results from our models. In
this paper we focus on the motivation and derivation of our continuum contact
models, and provide a corresponding literature survey. Their implementation in
a nonlinear finite element framework as well as the algorithmic treatment of
adhesion and friction will be discussed in future work.
","[{'version': 'v1', 'created': 'Wed, 28 Feb 2018 19:29:08 GMT'}, {'version': 'v2', 'created': 'Tue, 31 Jul 2018 19:00:56 GMT'}, {'version': 'v3', 'created': 'Sun, 20 Oct 2019 13:45:47 GMT'}]",2019-10-22,"[['Mergel', 'Janine C.', ''], ['Sahli', 'Riad', ''], ['Scheibert', 'Julien', ''], ['Sauer', 'Roger A.', '']]","['adhesion-controlled friction', 'tribology', 'dry adhesion', 'non-destructive testing', 'continuum contact mechanics', 'sliding friction']"
1415,1102.2655,EPTCS,"Sandra Alves (University of Porto), Maribel Fern\'andez (King's
  College London), Ian Mackie (Ecole Polytechnique)",A new graphical calculus of proofs,"In Proceedings TERMGRAPH 2011, arXiv:1102.2268","EPTCS 48, 2011, pp. 69-84",10.4204/EPTCS.48.8,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We offer a simple graphical representation for proofs of intuitionistic
logic, which is inspired by proof nets and interaction nets (two formalisms
originating in linear logic). This graphical calculus of proofs inherits good
features from each, but is not constrained by them. By the Curry-Howard
isomorphism, the representation applies equally to the lambda calculus,
offering an alternative diagrammatic representation of functional computations.
","[{'version': 'v1', 'created': 'Mon, 14 Feb 2011 01:09:45 GMT'}]",2011-02-15,"[['Alves', 'Sandra', '', 'University of Porto'], ['Fernández', 'Maribel', '', ""King's\n  College London""], ['Mackie', 'Ian', '', 'Ecole Polytechnique']]","['Intuitionistic logic', 'lambda-calculus', 'visual representation', 'proof theory']"
1416,1608.02339,Filippo Bonazzi,"Elena Reshetova, Filippo Bonazzi, N. Asokan",SELint: an SEAndroid policy analysis tool,12 pages,"Proceedings of the 3rd International Conference on Information
  Systems Security and Privacy - Volume 1, 2017, pages 47-58",10.5220/0006126600470058,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  SEAndroid enforcement is now mandatory for Android devices. In order to
provide the desired level of security for their products, Android OEMs need to
be able to minimize their mistakes in writing SEAndroid policies. However,
existing SEAndroid and SELinux tools are not very useful for this purpose. It
has been shown that SEAndroid policies found in commercially available devices
for multiple manufacturers contain mistakes and redundancies. In this paper we
present a new tool, SELint, which aims to help OEMs to produce better SEAndroid
policies. SELint is extensible and configurable to suit the needs of different
OEMs. It is provided with a default configuration based on the AOSP SEAndroid
policy, but can be customized by OEMs.
","[{'version': 'v1', 'created': 'Mon, 8 Aug 2016 07:31:40 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Oct 2016 17:18:37 GMT'}, {'version': 'v3', 'created': 'Mon, 13 Mar 2017 13:35:59 GMT'}]",2017-03-14,"[['Reshetova', 'Elena', ''], ['Bonazzi', 'Filippo', ''], ['Asokan', 'N.', '']]","['Security', 'SEAndroid', 'SELinux', 'Android', 'Access Control', 'policy analysis']"
1417,2108.12536,Yifeng Jiang,"Yifeng Jiang, Michelle Guo, Jiangshan Li, Ioannis Exarchos, Jiajun Wu,
  C. Karen Liu","DASH: Modularized Human Manipulation Simulation with Vision and Language
  for Embodied AI",SCA'2021,"In The ACM SIGGRAPH / Eurographics Symposium on Computer Animation
  (SCA 21), September 6~9, 2021, Virtual Event, USA. ACM, New York, NY, USA, 12
  pages",10.1145/3475946.3480950,,cs.GR cs.AI cs.RO,http://creativecommons.org/licenses/by-sa/4.0/,"  Creating virtual humans with embodied, human-like perceptual and actuation
constraints has the promise to provide an integrated simulation platform for
many scientific and engineering applications. We present Dynamic and Autonomous
Simulated Human (DASH), an embodied virtual human that, given natural language
commands, performs grasp-and-stack tasks in a physically-simulated cluttered
environment solely using its own visual perception, proprioception, and touch,
without requiring human motion data. By factoring the DASH system into a vision
module, a language module, and manipulation modules of two skill categories, we
can mix and match analytical and machine learning techniques for different
modules so that DASH is able to not only perform randomly arranged tasks with a
high success rate, but also do so under anthropomorphic constraints and with
fluid and diverse motions. The modular design also favors analysis and
extensibility to more complex manipulation skills.
","[{'version': 'v1', 'created': 'Sat, 28 Aug 2021 00:22:30 GMT'}]",2021-09-02,"[['Jiang', 'Yifeng', ''], ['Guo', 'Michelle', ''], ['Li', 'Jiangshan', ''], ['Exarchos', 'Ioannis', ''], ['Wu', 'Jiajun', ''], ['Liu', 'C. Karen', '']]","['Virtual Human', 'Embodied AI System', 'Physics Simulation', 'Computer Vision', 'Reinforcement Learning']"
1418,1210.2297,Remy Haemmerle,R\'emy Haemmerl\'e,Diagrammatic confluence for Constraint Handling Rules,,"Theory and Practice of Logic Programming, 12(4-5): 737-753, 2012",10.1017/S1471068412000270,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Confluence is a fundamental property of Constraint Handling Rules (CHR)
since, as in other rewriting formalisms, it guarantees that the computations
are not dependent on rule application order, and also because it implies the
logical consistency of the program declarative view. In this paper we are
concerned with proving the confluence of non-terminating CHR programs. For this
purpose, we derive from van Oostrom's decreasing diagrams method a novel
criterion on CHR critical pairs that generalizes all preexisting criteria. We
subsequently improve on a result on the modularity of CHR confluence, which
permits modular combinations of possibly non-terminating confluent programs,
without loss of confluence.
","[{'version': 'v1', 'created': 'Mon, 8 Oct 2012 14:34:25 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Oct 2012 12:43:36 GMT'}]",2012-10-10,"[['Haemmerlé', 'Rémy', '']]","['CHR', 'confluence', 'decreasing diagrams', 'modularity of confluence']"
1419,1504.06075,Ivo Herman,"Ivo Herman, Dan Martinec, J. J. P. Veerman",Transients of platoons with asymmetric and different Laplacians,,"Systems and Control Letters, Volume 91, 2016",10.1016/j.sysconle.2016.02.013,,cs.SY cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider an asymmetric control of platoons of identical vehicles with
nearest-neighbor interaction. Recent results show that if the vehicle uses
different asymmetries for position and velocity errors, the platoon has a short
transient and low overshoots. In this paper we investigate the properties of
vehicles with friction. To achieve consensus, an integral part is added to the
controller, making the vehicle a third-order system. We show that the
parameters can be chosen so that the platoon behaves as a wave equation with
different wave velocities. Simulations suggest that our system has a better
performance than other nearest-neighbor scenarios. Moreover, an
optimization-based procedure is used to find the controller properties.
","[{'version': 'v1', 'created': 'Thu, 23 Apr 2015 08:16:44 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Sep 2015 13:43:50 GMT'}]",2016-04-05,"[['Herman', 'Ivo', ''], ['Martinec', 'Dan', ''], ['Veerman', 'J. J. P.', '']]","['vehicular platoons', 'different asymmetries', 'distributed control', 'scaling', 'multiple Laplacian']"
1420,1212.4287,Florian Richoux,"Charlotte Truchet, Florian Richoux and Philippe Codognet",Prediction of Parallel Speed-ups for Las Vegas Algorithms,"10 pages, 14 figures, 5 tables. Latex ACM Sigplan format","Proceedings of the IEEE 2013 42nd International Conference on
  Parallel Processing",10.1109/ICPP.2013.25,,cs.DC cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a probabilistic model for the parallel execution of Las Vegas
algorithms, i.e., randomized algorithms whose runtime might vary from one
execution to another, even with the same input. This model aims at predicting
the parallel performances (i.e., speedups) by analysis the runtime distribution
of the sequential runs of the algorithm. Then, we study in practice the case of
a particular Las Vegas algorithm for combinatorial optimization, on three
classical problems, and compare with an actual parallel implementation up to
256 cores. We show that the prediction can be quite accurate, matching the
actual speedups very well up to 100 parallel cores and then with a deviation of
about 20% up to 256 cores.
","[{'version': 'v1', 'created': 'Tue, 18 Dec 2012 10:05:51 GMT'}]",2019-06-24,"[['Truchet', 'Charlotte', ''], ['Richoux', 'Florian', ''], ['Codognet', 'Philippe', '']]","['Las Vegas algorithms', 'Prediction', 'Parallel Speed-ups', 'Local Search', 'Statistical Modeling', 'Runtime Distributions']"
1421,1901.07278,"Ga\""el \'Ecorchard","Ga\""el \'Ecorchard and Adam Heinrich and Libor P\v{r}eu\v{c}il","Ego-motion Sensor for Unmanned Aerial Vehicles Based on a Single-Board
  Computer","Proceedings of CLAWAR 2017: 20th International Conference on Climbing
  and Walking Robots and the Support Technologies for Mobile Machines","Human-Centric Robotics, pp. 189-196, 2017",10.1142/9789813231047_0025,,cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the design and implementation of a ground-related
odometry sensor suitable for micro aerial vehicles. The sensor is based on a
ground-facing camera and a single-board Linux-based embedded computer with a
multimedia System on a Chip (SoC). The SoC features a hardware video encoder
which is used to estimate the optical flow online. The optical flow is then
used in combination with a distance sensor to estimate the vehicle's velocity.
The proposed sensor is compared to a similar existing solution and evaluated in
both indoor and outdoor environments.
","[{'version': 'v1', 'created': 'Tue, 22 Jan 2019 12:01:00 GMT'}]",2019-01-23,"[['Écorchard', 'Gaël', ''], ['Heinrich', 'Adam', ''], ['Přeučil', 'Libor', '']]","['visual odometry', 'optical flow', 'ego-motion']"
1422,1809.09310,Daniel Fremont,"Daniel J. Fremont, Tommaso Dreossi, Shromona Ghosh, Xiangyu Yue,
  Alberto L. Sangiovanni-Vincentelli, Sanjit A. Seshia",Scenic: A Language for Scenario Specification and Scene Generation,"41 pages, 36 figures. Full version of a PLDI 2019 paper (extending UC
  Berkeley EECS Department Tech Report No. UCB/EECS-2018-8)",,10.1145/3314221.3314633,,cs.PL cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new probabilistic programming language for the design and
analysis of perception systems, especially those based on machine learning.
Specifically, we consider the problems of training a perception system to
handle rare events, testing its performance under different conditions, and
debugging failures. We show how a probabilistic programming language can help
address these problems by specifying distributions encoding interesting types
of inputs and sampling these to generate specialized training and test sets.
More generally, such languages can be used for cyber-physical systems and
robotics to write environment models, an essential prerequisite to any formal
analysis. In this paper, we focus on systems like autonomous cars and robots,
whose environment is a ""scene"", a configuration of physical objects and agents.
We design a domain-specific language, Scenic, for describing ""scenarios"" that
are distributions over scenes. As a probabilistic programming language, Scenic
allows assigning distributions to features of the scene, as well as
declaratively imposing hard and soft constraints over the scene. We develop
specialized techniques for sampling from the resulting distribution, taking
advantage of the structure provided by Scenic's domain-specific syntax.
Finally, we apply Scenic in a case study on a convolutional neural network
designed to detect cars in road images, improving its performance beyond that
achieved by state-of-the-art synthetic data generation methods.
","[{'version': 'v1', 'created': 'Tue, 25 Sep 2018 03:57:00 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Jun 2019 01:12:24 GMT'}]",2019-06-24,"[['Fremont', 'Daniel J.', ''], ['Dreossi', 'Tommaso', ''], ['Ghosh', 'Shromona', ''], ['Yue', 'Xiangyu', ''], ['Sangiovanni-Vincentelli', 'Alberto L.', ''], ['Seshia', 'Sanjit A.', '']]","['scenario description language', 'synthetic data', 'deep learning', 'probabilistic programming', 'automatic testgeneration', 'fuzz testing']"
1423,1006.3159,Alexandre Chapoutot,"Olivier Bouissou (LMeASI), Yassamine Seladji (LMeASI), Alexandre
  Chapoutot (LIP6)",Abstract Fixpoint Computations with Numerical Acceleration Methods,,Electronic Notes in Theoretical Computer Science (2010) 29-42,10.1016/j.entcs.2010.09.004,,cs.PL cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Static analysis by abstract interpretation aims at automatically proving
properties of computer programs. To do this, an over-approximation of program
semantics, defined as the least fixpoint of a system of semantic equations,
must be computed. To enforce the convergence of this computation, widening
operator is used but it may lead to coarse results. We propose a new method to
accelerate the computation of this fixpoint by using standard techniques of
numerical analysis. Our goal is to automatically and dynamically adapt the
widening operator in order to maintain precision.
","[{'version': 'v1', 'created': 'Wed, 16 Jun 2010 08:39:12 GMT'}]",2013-05-02,"[['Bouissou', 'Olivier', '', 'LMeASI'], ['Seladji', 'Yassamine', '', 'LMeASI'], ['Chapoutot', 'Alexandre', '', 'LIP6']]","['Abstract numerical domains', 'acceleration of convergence', 'widening operator']"
1424,2008.05509,Lisandro Granville,"Arthur Selle Jacobs, Ricardo Jos\'e Pfitscher, Ronaldo Alves Ferreira,
  Lisandro Zambenedetti Granville",Refining Network Intents for Self-Driving Networks,"9 pages, 5 figures, 3 listings, 1 grammar","ACM SIGCOMM Computer Communication Review (CCR), vol. 48, issue 5,
  p. 55-63, October 2018",10.1145/3310165.3310173,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advances in artificial intelligence (AI) offer an opportunity for the
adoption of self-driving networks. However, network operators or home-network
users still do not have the right tools to exploit these new advancements in
AI, since they have to rely on low-level languages to specify network policies.
Intent-based networking (IBN) allows operators to specify high-level policies
that dictate how the network should behave without worrying how they are
translated into configuration commands in the network devices. However, the
existing research proposals for IBN fail to exploit the knowledge and feedback
from the network operator to validate or improve the translation of intents. In
this paper, we introduce a novel intent-refinement process that uses machine
learning and feedback from the operator to translate the operator's utterances
into network configurations. Our refinement process uses a sequence-to-sequence
learning model to extract intents from natural language and the feedback from
the operator to improve learning. The key insight of our process is an
intermediate representation that resembles natural language that is suitable to
collect feedback from the operator but is structured enough to facilitate
precise translations. Our prototype interacts with a network operator using
natural language and translates the operator input to the intermediate
representation before translating to SDN rules. Our experimental results show
that our process achieves a correlation coefficient squared (i.e., R-squared)
of 0.99 for a dataset with 5000 entries and the operator feedback significantly
improves the accuracy of our model.
","[{'version': 'v1', 'created': 'Wed, 12 Aug 2020 18:13:43 GMT'}]",2020-08-14,"[['Jacobs', 'Arthur Selle', ''], ['Pfitscher', 'Ricardo José', ''], ['Ferreira', 'Ronaldo Alves', ''], ['Granville', 'Lisandro Zambenedetti', '']]","['Intent-Based Networking', 'Self-Driving Networks', 'MachineLearning']"
1425,1407.4395,Ming Jin,"Ming Jin, Ruoxi Jia, Zhoayi Kang, Ioannis C. Konstantakopoulos, Costas
  Spanos","PresenceSense: Zero-training Algorithm for Individual Presence Detection
  based on Power Monitoring",BuildSys 2014,,10.1109/TMC.2017.2684806,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Non-intrusive presence detection of individuals in commercial buildings is
much easier to implement than intrusive methods such as passive infrared,
acoustic sensors, and camera. Individual power consumption, while providing
useful feedback and motivation for energy saving, can be used as a valuable
source for presence detection. We conduct pilot experiments in an office
setting to collect individual presence data by ultrasonic sensors, acceleration
sensors, and WiFi access points, in addition to the individual power monitoring
data. PresenceSense (PS), a semi-supervised learning algorithm based on power
measurement that trains itself with only unlabeled data, is proposed, analyzed
and evaluated in the study. Without any labeling efforts, which are usually
tedious and time consuming, PresenceSense outperforms popular models whose
parameters are optimized over a large training set. The results are interpreted
and potential applications of PresenceSense on other data sources are
discussed. The significance of this study attaches to space security, occupancy
behavior modeling, and energy saving of plug loads.
","[{'version': 'v1', 'created': 'Wed, 16 Jul 2014 17:51:55 GMT'}]",2017-05-03,"[['Jin', 'Ming', ''], ['Jia', 'Ruoxi', ''], ['Kang', 'Zhoayi', ''], ['Konstantakopoulos', 'Ioannis C.', ''], ['Spanos', 'Costas', '']]","['Occupancy detection', 'non-intrusive method', 'power measurement', 'semi-supervised learning', 'plug loads', 'energy saving']"
1426,1606.06222,Albert Mestres Sugra\~nes,"Albert Mestres, Alberto Rodriguez-Natal, Josep Carner, Pere
  Barlet-Ros, Eduard Alarc\'on, Marc Sol\'e, Victor Munt\'es, David Meyer,
  Sharon Barkai, Mike J Hibbett, Giovani Estrada, Khaldun Ma`ruf, Florin Coras,
  Vina Ermagan, Hugo Latapie, Chris Cassar, John Evans, Fabio Maino, Jean
  Walrand, Albert Cabellos",Knowledge-Defined Networking,"8 pages, 22 references, 6 figures and 1 table","ACM SIGCOMM Computer Communication Review, Volume 47, Issue 3,
  July 2017",10.1145/3138808.3138810,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The research community has considered in the past the application of
Artificial Intelligence (AI) techniques to control and operate networks. A
notable example is the Knowledge Plane proposed by D.Clark et al. However, such
techniques have not been extensively prototyped or deployed in the field yet.
In this paper, we explore the reasons for the lack of adoption and posit that
the rise of two recent paradigms: Software-Defined Networking (SDN) and Network
Analytics (NA), will facilitate the adoption of AI techniques in the context of
network operation and control. We describe a new paradigm that accommodates and
exploits SDN, NA and AI, and provide use cases that illustrate its
applicability and benefits. We also present simple experimental results that
support its feasibility. We refer to this new paradigm as Knowledge-Defined
Networking (KDN).
","[{'version': 'v1', 'created': 'Mon, 20 Jun 2016 17:45:17 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Jun 2016 14:10:44 GMT'}]",2017-09-13,"[['Mestres', 'Albert', ''], ['Rodriguez-Natal', 'Alberto', ''], ['Carner', 'Josep', ''], ['Barlet-Ros', 'Pere', ''], ['Alarcón', 'Eduard', ''], ['Solé', 'Marc', ''], ['Muntés', 'Victor', ''], ['Meyer', 'David', ''], ['Barkai', 'Sharon', ''], ['Hibbett', 'Mike J', ''], ['Estrada', 'Giovani', ''], ['Ma`ruf', 'Khaldun', ''], ['Coras', 'Florin', ''], ['Ermagan', 'Vina', ''], ['Latapie', 'Hugo', ''], ['Cassar', 'Chris', ''], ['Evans', 'John', ''], ['Maino', 'Fabio', ''], ['Walrand', 'Jean', ''], ['Cabellos', 'Albert', '']]","['Knowledge Plane', 'SDN', 'Network Analytics', 'MachineLearning', 'NFV', 'Knowledge-Defined Networking']"
1427,2108.04311,Luiz Capretz Dr.,"Liang Wei, Luiz Fernando Capretz",Recommender Systems for Software Project Managers,"Proceedings of the Evaluation and Assessment in Software Engineering
  (EASE 2021), 6 pages","Proceedings of the Evaluation and Assessment in Software
  Engineering (EASE 2021), Trondheim, Norway, pp. 412-417, ACM Press, June 2021",10.1145/3463274.3463951,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The design of recommendation systems is based on complex information
processing and big data interaction. This personalized view has evolved into a
hot area in the past decade, where applications might have been proved to help
for solving problem in the software development field. Therefore, with the
evolvement of Recommendation System in Software Engineering (RSSE), the
coordination of software projects with their stakeholders is improving. This
experiment examines four open source recommender systems and implemented a
customized recommender engine with two industrial-oriented packages: Lenskit
and Mahout. Each of the main functions was examined and issues were identified
during the experiment.
","[{'version': 'v1', 'created': 'Mon, 9 Aug 2021 19:13:31 GMT'}]",2021-09-01,"[['Wei', 'Liang', ''], ['Capretz', 'Luiz Fernando', '']]","['Recommender Engine', 'Recommendation System', 'Recommendation System in Software Engineering', 'RSSE', 'Project Management']"
1428,0804.2819,Michel Grabisch,"Michel Grabisch (CES), Christophe Labreuche (TRT)",Bipolarization of posets and natural interpolation,,Journal of Mathematical Analysis and applications (2008) 1080-1097,10.1016/j.jmaa.2008.02.008,,cs.DM math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Choquet integral w.r.t. a capacity can be seen in the finite case as a
parsimonious linear interpolator between vertices of $[0,1]^n$. We take this
basic fact as a starting point to define the Choquet integral in a very general
way, using the geometric realization of lattices and their natural
triangulation, as in the work of Koshevoy. A second aim of the paper is to
define a general mechanism for the bipolarization of ordered structures. Bisets
(or signed sets), as well as bisubmodular functions, bicapacities,
bicooperative games, as well as the Choquet integral defined for them can be
seen as particular instances of this scheme. Lastly, an application to
multicriteria aggregation with multiple reference levels illustrates all the
results presented in the paper.
","[{'version': 'v1', 'created': 'Thu, 17 Apr 2008 14:05:41 GMT'}]",2015-05-13,"[['Grabisch', 'Michel', '', 'CES'], ['Labreuche', 'Christophe', '', 'TRT']]","['interpolation', 'Choquet integral', 'lattice', 'bipolar structure']"
1429,1304.3268,Mustapha Aznag,"Mustapha Aznag, Mohamed Quafafou, Nicolas Durand and Zahi Jarir","Web Services Discovery and Recommendation Based on Information
  Extraction and Symbolic Reputation",,"International Journal on Web Service Computing (IJWSC), Vol.4,
  No.1, March 2013",10.5121/ijwsc.2013.4101,,cs.IR,http://creativecommons.org/licenses/by/3.0/,"  This paper shows that the problem of web services representation is crucial
and analyzes the various factors that influence on it. It presents the
traditional representation of web services considering traditional textual
descriptions based on the information contained in WSDL files. Unfortunately,
textual web services descriptions are dirty and need significant cleaning to
keep only useful information. To deal with this problem, we introduce rules
based text tagging method, which allows filtering web service description to
keep only significant information. A new representation based on such filtered
data is then introduced. Many web services have empty descriptions. Also, we
consider web services representations based on the WSDL file structure (types,
attributes, etc.). Alternatively, we introduce a new representation called
symbolic reputation, which is computed from relationships between web services.
The impact of the use of these representations on web service discovery and
recommendation is studied and discussed in the experimentation using real world
web services.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2013 12:21:36 GMT'}]",2013-04-12,"[['Aznag', 'Mustapha', ''], ['Quafafou', 'Mohamed', ''], ['Durand', 'Nicolas', ''], ['Jarir', 'Zahi', '']]","['Web services', 'WSDL file', 'data representation', 'information extraction', 'semantic tagging', 'symbolicreputation', 'discovery and recommendation']"
1430,2009.05714,Nalin Asanka Gamagedara Arachchilage,Nalin Asanka Gamagedara Arachchilage and Mumtaz Abdul Hameed,"Designing a Serious Game: Teaching Developers to Embed Privacy into
  Software Systems",6,"35th IEEE/ACM International Conference on Automated Software
  Engineering Workshops (ASEW '20), September 25, 2020, Virtual Event,
  Australia. ACM, New York, NY, USA",10.1145/3417113.3422149,,cs.CR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software applications continue to challenge user privacy when users interact
with them. Privacy practices (e.g. Data Minimisation (DM), Privacy by Design
(PbD) or General Data Protection Regulation (GDPR)) and related ""privacy
engineering"" methodologies exist and provide clear instructions for developers
to implement privacy into software systems they develop that preserve user
privacy. However, those practices and methodologies are not yet a common
practice in the software development community. There has been no previous
research focused on developing ""educational"" interventions such as serious
games to enhance software developers' coding behaviour. Therefore, this
research proposes a game design framework as an educational tool for software
developers to improve (secure) coding behaviour, so they can develop
privacy-preserving software applications that people can use. The elements of
the proposed framework were incorporated into a gaming application scenario
that enhances the software developers' coding behaviour through their
motivation. The proposed work not only enables the development of
privacy-preserving software systems but also helping the software development
community to put privacy guidelines and engineering methodologies into
practice.
","[{'version': 'v1', 'created': 'Sat, 12 Sep 2020 03:18:11 GMT'}]",2020-09-15,"[['Arachchilage', 'Nalin Asanka Gamagedara', ''], ['Hameed', 'Mumtaz Abdul', '']]","['Secure Coding', 'DevSecOps', 'Privacy']"
1431,1604.08270,Diederik Aerts,"Diederik Aerts, Lyneth Beltran, Massimiliano Sassoli de Bianchi,
  Sandro Sozzo and Tomas Veloz",Quantum cognition beyond Hilbert space II: Applications,"10 pages, 2 figures","In de Barros J., Coecke B., Pothos E. (Eds) Quantum Interaction.
  QI 2016 (pp. 81-98). Lecture Notes in Computer Science, vol 10106. Springer,
  Cham (2017)",10.1007/978-3-319-52289-0_7,,cs.AI quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The research on human cognition has recently benefited from the use of the
mathematical formalism of quantum theory in Hilbert space. However, cognitive
situations exist which indicate that the Hilbert space structure, and the
associated Born rule, would be insufficient to provide a satisfactory modeling
of the collected data, so that one needs to go beyond Hilbert space. In Part I
of this paper we follow this direction and present a general tension-reduction
(GTR) model, in the ambit of an operational and realistic framework for human
cognition. In this Part II we apply this non-Hilbertian quantum-like model to
faithfully reproduce the probabilities of the 'Clinton/Gore' and 'Rose/Jackson'
experiments on question order effects. We also explain why the GTR-model is
needed if one wants to deal, in a fully consistent way, with response
replicability and unpacking effects.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2016 23:40:11 GMT'}]",2019-02-12,"[['Aerts', 'Diederik', ''], ['Beltran', 'Lyneth', ''], ['de Bianchi', 'Massimiliano Sassoli', ''], ['Sozzo', 'Sandro', ''], ['Veloz', 'Tomas', '']]","['Cognitive modeling', 'quantum structures', 'eneral tension reduction model', 'order effects', 'response replicability', 'unpacking effects']"
1432,1402.1252,Manojkumar  M. K.,"Manojkumar.M.K, Sathya.D","A Survey on an Effective Defense Mechanism against Reactive Jamming
  Attacks in WSN","4 pages,3 figures,""Published with International Journal of Computer
  Trends and Technology (IJCTT)""","IJCTT 7(3):143-146, January 2014. Published by Seventh Sense
  Research Group",10.14445/22312803/IJCTT-V7P129,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Wireless Sensor Network (WSN) is a self-configure network of sensor nodes
communicate among themselves using radio signals and deployed in quantity to
sense, monitor and to understand the physical world. A jammer is an entity
which interferes with the physical transmission and reception of wireless
communications. Reactive jamming attack is a major security problem in the
wireless sensor network. The reactive jammer stays quiet when the channel is
idle. The jammer starts transmitting a radio signal as soon as it senses
activity on the channel. The reactive jammer nodes will be deactivated by
identifying all the trigger nodes, at the same time a jammer node is localized
by exploiting the changes in the neighbor nodes. The affected node can be
identified, by analyzing the changes in its communication range, compared to
its neighbors. The paper proposes a survey on trigger node identification and a
detailed survey on techniques to identify trigger nodes and highly concentrated
on the reactive jammer.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2014 05:34:32 GMT'}]",2014-02-07,"[['K', 'Manojkumar. M.', ''], ['D', 'Sathya.', '']]","['Jammer', 'Reactive jammer', 'Trigger nodes', 'Wireless Sensor Networks']"
1433,1903.01895,Marijn Van Knippenberg,"Marijn van Knippenberg, Vlado Menkovski, Sergio Consoli",Evolutionary Construction of Convolutional Neural Networks,,Springer Lecture Notes in Computer Science 11331 (2018) 293-304,10.1007/978-3-030-13709-0_25,,cs.NE cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Neuro-Evolution is a field of study that has recently gained significantly
increased traction in the deep learning community. It combines deep neural
networks and evolutionary algorithms to improve and/or automate the
construction of neural networks. Recent Neuro-Evolution approaches have shown
promising results, rivaling hand-crafted neural networks in terms of accuracy.
A two-step approach is introduced where a convolutional autoencoder is created
that efficiently compresses the input data in the first step, and a
convolutional neural network is created to classify the compressed data in the
second step. The creation of networks in both steps is guided by by an
evolutionary process, where new networks are constantly being generated by
mutating members of a collection of existing networks. Additionally, a method
is introduced that considers the trade-off between compression and information
loss of different convolutional autoencoders. This is used to select the
optimal convolutional autoencoder from among those evolved to compress the data
for the second step. The complete framework is implemented, tested on the
popular CIFAR-10 data set, and the results are discussed. Finally, a number of
possible directions for future work with this particular framework in mind are
considered, including opportunities to improve its efficiency and its
application in particular areas.
","[{'version': 'v1', 'created': 'Wed, 2 Jan 2019 12:30:51 GMT'}]",2020-10-05,"[['van Knippenberg', 'Marijn', ''], ['Menkovski', 'Vlado', ''], ['Consoli', 'Sergio', '']]","['Neuro-Evolution', 'Genetic Algorithms', 'Convolutional Autoencoders', 'Convolutional Neural Networks']"
1434,1707.05152,Ricardo Gon\c{c}alves,"Ricardo Gon\c{c}alves (1), Matthias Knorr (1), Jo\~ao Leite (1),
  Stefan Woltran (2) ((1) NOVA LINCS, Universidade Nova de Lisboa, Portugal,
  (2) TU Wien, Austria)","When You Must Forget: beyond strong persistence when forgetting in
  answer set programming","Paper presented at the 33nd International Conference on Logic
  Programming (ICLP 2017), Melbourne, Australia, August 28 to September 1,
  2017, 15 pages, LaTeX (arXiv:YYMM.NNNNN)",,10.1017/S1471068417000382,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Among the myriad of desirable properties discussed in the context of
forgetting in Answer Set Programming (ASP), strong persistence naturally
captures its essence. Recently, it has been shown that it is not always
possible to forget a set of atoms from a program while obeying this property,
and a precise criterion regarding what can be forgotten has been presented,
accompanied by a class of forgetting operators that return the correct result
when forgetting is possible.
  However, it is an open question what to do when we have to forget a set of
atoms, but cannot without violating this property. In this paper, we address
this issue and investigate three natural alternatives to forget when forgetting
without violating strong persistence is not possible, which turn out to
correspond to the different possible relaxations of the characterization of
strong persistence. Additionally, we discuss their preferable usage, shed light
on the relation between forgetting and notions of relativized equivalence
established earlier in the context of ASP, and present a detailed study on
their computational complexity.
","[{'version': 'v1', 'created': 'Mon, 17 Jul 2017 13:41:26 GMT'}]",2019-08-01,"[['Gonçalves', 'Ricardo', ''], ['Knorr', 'Matthias', ''], ['Leite', 'João', ''], ['Woltran', 'Stefan', '']]","['Forgetting', 'Answer Set Programming', 'Strong Equivalence', 'Relativized Equivalence', 'Computational Complexity']"
1435,1810.12033,Martin Pfaller,"Martin R. Pfaller, Maria Cruz Varona, Johannes Lang, Crist\'obal
  Bertoglio, Wolfgang A. Wall","Parametric model order reduction and its application to inverse analysis
  of large nonlinear coupled cardiac problems",,,10.1002/cnm.3320,,cs.CE physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predictive high-fidelity finite element simulations of human cardiac
mechanics co\-mmon\-ly require a large number of structural degrees of freedom.
Additionally, these models are often coupled with lumped-parameter models of
hemodynamics. High computational demands, however, slow down model calibration
and therefore limit the use of cardiac simulations in clinical practice. As
cardiac models rely on several patient-specific parameters, just one solution
corresponding to one specific parameter set does not at all meet clinical
demands. Moreover, while solving the nonlinear problem, 90\% of the computation
time is spent solving linear systems of equations. We propose a novel approach
to reduce only the structural dimension of the monolithically coupled
structure-windkessel system by projection onto a lower-dimensional subspace. We
obtain a good approximation of the displacement field as well as of key scalar
cardiac outputs even with very few reduced degrees of freedom while achieving
considerable speedups. For subspace generation, we use proper orthogonal
decomposition of displacement snapshots. To incorporate changes in the
parameter set into our reduced order model, we provide a comparison of subspace
interpolation methods. We further show how projection-based model order
reduction can be easily integrated into a gradient-based optimization and
demonstrate its performance in a real-world multivariate inverse analysis
scenario. Using the presented projection-based model order reduction approach
can significantly speed up model personalization and could be used for
many-query tasks in a clinical setting.
","[{'version': 'v1', 'created': 'Mon, 29 Oct 2018 10:03:22 GMT'}]",2020-02-18,"[['Pfaller', 'Martin R.', ''], ['Varona', 'Maria Cruz', ''], ['Lang', 'Johannes', ''], ['Bertoglio', 'Cristóbal', ''], ['Wall', 'Wolfgang A.', '']]","['Cardiac mechanics', 'parametric model order reduction', 'proper orthogonal decomposition', 'inverse analysis']"
1436,1705.06640,Kexin Pei,"Kexin Pei, Yinzhi Cao, Junfeng Yang, Suman Jana",DeepXplore: Automated Whitebox Testing of Deep Learning Systems,To be published in SOSP'17,,10.1145/3132747.3132785,,cs.LG cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning (DL) systems are increasingly deployed in safety- and
security-critical domains including self-driving cars and malware detection,
where the correctness and predictability of a system's behavior for corner case
inputs are of great importance. Existing DL testing depends heavily on manually
labeled data and therefore often fails to expose erroneous behaviors for rare
inputs.
  We design, implement, and evaluate DeepXplore, the first whitebox framework
for systematically testing real-world DL systems. First, we introduce neuron
coverage for systematically measuring the parts of a DL system exercised by
test inputs. Next, we leverage multiple DL systems with similar functionality
as cross-referencing oracles to avoid manual checking. Finally, we demonstrate
how finding inputs for DL systems that both trigger many differential behaviors
and achieve high neuron coverage can be represented as a joint optimization
problem and solved efficiently using gradient-based search techniques.
  DeepXplore efficiently finds thousands of incorrect corner case behaviors
(e.g., self-driving cars crashing into guard rails and malware masquerading as
benign software) in state-of-the-art DL models with thousands of neurons
trained on five popular datasets including ImageNet and Udacity self-driving
challenge data. For all tested DL models, on average, DeepXplore generated one
test input demonstrating incorrect behavior within one second while running
only on a commodity laptop. We further show that the test inputs generated by
DeepXplore can also be used to retrain the corresponding DL model to improve
the model's accuracy by up to 3%.
","[{'version': 'v1', 'created': 'Thu, 18 May 2017 15:09:39 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Jun 2017 23:40:43 GMT'}, {'version': 'v3', 'created': 'Mon, 10 Jul 2017 17:05:40 GMT'}, {'version': 'v4', 'created': 'Sun, 24 Sep 2017 15:55:11 GMT'}]",2017-09-26,"[['Pei', 'Kexin', ''], ['Cao', 'Yinzhi', ''], ['Yang', 'Junfeng', ''], ['Jana', 'Suman', '']]","['Deep learning testing', 'differential testing', 'whitebox testing']"
1437,1809.03272,Le Trieu Phong,Le Trieu Phong and Tran Thi Phuong,Privacy-Preserving Deep Learning via Weight Transmission,Full version of a conference paper at NSS 2017,"IEEE Transactions on Information Forensics and Security (Volume:
  14, Issue: 11, Nov. 2019)",10.1109/TIFS.2019.2911169,,cs.LG cs.AI cs.CR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the scenario that multiple data owners wish to apply a
machine learning method over the combined dataset of all owners to obtain the
best possible learning output but do not want to share the local datasets owing
to privacy concerns. We design systems for the scenario that the stochastic
gradient descent (SGD) algorithm is used as the machine learning method because
SGD (or its variants) is at the heart of recent deep learning techniques over
neural networks. Our systems differ from existing systems in the following
features: {\bf (1)} any activation function can be used, meaning that no
privacy-preserving-friendly approximation is required; {\bf (2)} gradients
computed by SGD are not shared but the weight parameters are shared instead;
and {\bf (3)} robustness against colluding parties even in the extreme case
that only one honest party exists. We prove that our systems, while
privacy-preserving, achieve the same learning accuracy as SGD and hence retain
the merit of deep learning with respect to accuracy. Finally, we conduct
several experiments using benchmark datasets, and show that our systems
outperform previous system in terms of learning accuracies.
","[{'version': 'v1', 'created': 'Mon, 10 Sep 2018 12:36:05 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Jan 2019 06:43:25 GMT'}, {'version': 'v3', 'created': 'Tue, 12 Feb 2019 06:44:53 GMT'}]",2019-07-09,"[['Phong', 'Le Trieu', ''], ['Phuong', 'Tran Thi', '']]","['Privacy preservation', 'stochastic gradient descent', 'distributed trainers', 'neural networks']"
1438,1703.04676,Jose Ordonez-Lucena,"Jose Ordonez-Lucena, Pablo Ameigeiras, Diego Lopez, Juan J.
  Ramos-Munoz, Javier Lorca, Jesus Folgueira","Network Slicing for 5G with SDN/NFV: Concepts, Architectures and
  Challenges",,,10.1109/MCOM.2017.1600935,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The fifth generation of mobile communications is anticipated to open up
innovation opportunities for new industries such as vertical markets. However,
these verticals originate myriad use cases with diverging requirements that
future 5G networks have to efficiently support. Network slicing may be a
natural solution to simultaneously accommodate over a common network
infrastructure the wide range of services that vertical-specific use cases will
demand. In this article, we present the network slicing concept, with a
particular focus on its application to 5G systems. We start by summarizing the
key aspects that enable the realization of so-called network slices. Then, we
give a brief overview on the SDN architecture proposed by the ONF and show that
it provides tools to support slicing. We argue that although such architecture
paves the way for network slicing implementation, it lacks some essential
capabilities that can be supplied by NFV. Hence, we analyze a proposal from the
ETSI to incorporate the capabilities of SDN into the NFV architecture.
Additionally, we present an example scenario that combines SDN and NFV
technologies to address the realization of network slices. Finally, we
summarize the open research issues with the purpose of motivating new advances
in this field.
","[{'version': 'v1', 'created': 'Tue, 14 Mar 2017 19:10:32 GMT'}, {'version': 'v2', 'created': 'Mon, 1 May 2017 20:44:49 GMT'}]",2017-05-03,"[['Ordonez-Lucena', 'Jose', ''], ['Ameigeiras', 'Pablo', ''], ['Lopez', 'Diego', ''], ['Ramos-Munoz', 'Juan J.', ''], ['Lorca', 'Javier', ''], ['Folgueira', 'Jesus', '']]","['5G', 'Network Slicing', 'SDN', 'NFV']"
1439,1809.08473,"Kaz{\i}m R{\i}fat \""Ozy{\i}lmaz","Kaz{\i}m R{\i}fat \""Ozy{\i}lmaz, Harsh Patel, Ankit Malik",Split-Scale: Scaling Bitcoin by Partitioning the UTXO Space,"Accepted for publication in 9th IEEE International Conference on
  Software Engineering and Service Science (ICSESS 2018) on 09.07.2018 -
  published version may differ",,10.1109/ICSESS.2018.8663851,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Bitcoin protocol is a significant milestone in the history of money.
However, its adoption is currently constrained by the transaction limits of the
system. As the chief problem of blockchain technology, the scaling issue has
attracted many valuable solutions both on-chain and off-chain. In this paper,
our goal is to explore the notion of unspent transaction outputs (UTXOs) to
propose an augmented Bitcoin protocol that can scale gracefully. Our proposal
aims to increase the transaction throughput by partitioning the UTXO space and
splitting the blockchain. In addition, a new type of Bitcoin node is introduced
to preserve the capability to run validating nodes in low-bandwidth
environments, despite the increased transaction throughput.
","[{'version': 'v1', 'created': 'Sat, 22 Sep 2018 19:01:39 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Jan 2019 09:45:35 GMT'}]",2019-04-03,"[['Özyılmaz', 'Kazım Rıfat', ''], ['Patel', 'Harsh', ''], ['Malik', 'Ankit', '']]","['Bitcoin', 'blockchain', 'consensus', 'UTXO', 'scaling', 'block size']"
1440,1409.1487,Ronen Gradwohl,Ronen Gradwohl and Rann Smorodinsky,Perception Games and Privacy,,,10.1016/j.geb.2017.04.006,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Players (people, firms, states, etc.) have privacy concerns that may affect
their choice of actions in strategic settings. We use a variant of signaling
games to model this effect and study its relation to pooling behavior,
misrepresentation of information, and inefficiency. We discuss these issues and
show that common intuitions may lead to inaccurate conclusions about the
implications of privacy concerns.
","[{'version': 'v1', 'created': 'Thu, 4 Sep 2014 16:53:26 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Jan 2016 18:56:39 GMT'}, {'version': 'v3', 'created': 'Wed, 27 Jul 2016 19:25:45 GMT'}, {'version': 'v4', 'created': 'Wed, 17 May 2017 15:17:48 GMT'}]",2017-05-18,"[['Gradwohl', 'Ronen', ''], ['Smorodinsky', 'Rann', '']]","['Privacy', 'perception games', 'signaling games']"
1441,1404.7814,Davoud Mostafavi Amjad,Mostafavi Amjad Davoud and Zolfy Lighvan Mina,"A tlm-based platform to specify and verify component-based real-time
  systems","10 pages, 7 figures","International Journal of Software Engineering & Applications
  (IJSEA), Vol.5, No.2, March 2014",10.5121/ijsea.2014.5201,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is about modeling and verification languages with their pros and
cons. Modeling is dynamic part of system development process before
realization. The cost and risky situations obligate designer to model system
before production and modeling gives designer more flexible and dynamic image
of realized system. Formal languages and modeling methods are the ways to model
and verify systems but they have their own difficulties in specifying systems.
Some of them are very precise but hard to specify complex systems like TRIO,
and others do not support object oriented design and hardware/software
co-design in real-time systems. In this paper we are going to introduce systemC
and the more abstracted method called TLM 2.0 that solved all mentioned
problems.
","[{'version': 'v1', 'created': 'Wed, 30 Apr 2014 17:57:44 GMT'}]",2014-05-01,"[['Davoud', 'Mostafavi Amjad', ''], ['Mina', 'Zolfy Lighvan', '']]","['Modeling', 'Component-Based Development', 'Real-Time Systems', 'Transaction Level Modeling', 'Real-TimeSystem Verification']"
1442,1512.07684,EPTCS,"Asma Cherif (Umm al-Qura University, Saudi Arabia), Abdessamad Imine
  (Lorraine University and Inria Nancy Grand-Est, France)",A Constraint-based Approach for Generating Transformation Patterns,"In Proceedings FOCLASA 2015, arXiv:1512.06947","EPTCS 201, 2015, pp. 48-62",10.4204/EPTCS.201.4,,cs.DC cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Undoing operations is an indispensable feature for many collaborative
applications, mainly collaborative editors. It provides the ability to restore
a correct state of shared data after erroneous operations. In particular,
selective undo allows to undo any operation and is based on rearranging
operations in the history thanks to the Operational Transformation (OT)
approach. OT is an optimistic replication technique allowing for updating the
shared data concurrently while maintaining convergence. It is a challenging
task how to meaningfully combine OT and undo approaches. Indeed, undoing
operations that are received and executed out-of-order at different sites leads
to divergence cases. Even though various undo solutions have been proposed over
the recent years, they are either limited or erroneous.
  In this paper, we propose a constraint-based approach to address the undo
problem. We use Constraint Satisfaction Problem (CSP) theory to devise correct
and undoable transformation patterns (w.r.t OT and undo properties) which
considerably simplifies the design of collaborative objects.
","[{'version': 'v1', 'created': 'Thu, 24 Dec 2015 01:40:09 GMT'}]",2016-01-04,"[['Cherif', 'Asma', '', 'Umm al-Qura University, Saudi Arabia'], ['Imine', 'Abdessamad', '', 'Lorraine University and Inria Nancy Grand-Est, France']]","['Collaborative Applications', 'Selective Undo', 'Operational Transformation (OT)', 'ConstraintSatisfaction Problem (CSP)']"
1443,1612.01944,Ke Liu,"Ke Liu, Ye Guo, Zeyun Yu","Porous Structure Design in Tissue Engineering Using Anisotropic Radial
  Basis Function","Department of Computer Science, University of Wisconsin Milwaukee","International Symposium on Visual Computing (ISVC) 2018, Advances
  in Visual Computing, Lecture Notes in Computer Science, vol. 11241, pp. 79-90",10.1007/978-3-030-03801-4_8,,cs.GR cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Development of additive manufacturing in last decade greatly improves tissue
engineering. During the manufacturing of porous scaffold, simplified but
functionally equivalent models are getting focused for practically reasons.
Scaffolds can be classified into regular porous scaffolds and irregular porous
scaffolds. Several methodologies are developed to design these scaffolds. A
novel method is proposed in this paper using anisotropic radial basis function
(ARBF) interpolation. This is method uses geometric models such as volumetric
meshes as input and proves to be flexible because geometric models are able to
capture the characteristics of complex tissues easily. Moreover, this method is
straightforward and easy to implement.
","[{'version': 'v1', 'created': 'Tue, 6 Dec 2016 18:42:44 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Jan 2017 22:00:34 GMT'}]",2018-12-04,"[['Liu', 'Ke', ''], ['Guo', 'Ye', ''], ['Yu', 'Zeyun', '']]","['additive manufacturing', 'tissue engineering', 'anisotropic radial basis function', 'geometric models']"
1444,1502.06419,Zeeshan Bhatti,"Zeeshan Bhatti, Asadullah Shah, Ahmad Waqas, Nadeem Mahmood","Analysis of Design Principles and Requirements for Procedural Rigging of
  Bipeds and Quadrupeds Characters with Custom Manipulators for Animation","21 pages, 24 figures, 4 Algorithms, Journal Paper","International Journal of Computer Graphics & Animation (IJCGA)
  Vol.5, No.1, January 2015",10.5121/ijcga.2015.5104,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Character rigging is a process of endowing a character with a set of custom
manipulators and controls making it easy to animate by the animators. These
controls consist of simple joints, handles, or even separate character
selection windows.This research paper present an automated rigging system for
quadruped characters with custom controls and manipulators for animation.The
full character rigging mechanism is procedurally driven based on various
principles and requirements used by the riggers and animators. The automation
is achieved initially by creating widgets according to the character type.
These widgets then can be customized by the rigger according to the character
shape, height and proportion. Then joint locations for each body parts are
calculated and widgets are replaced programmatically.Finally a complete and
fully operational procedurally generated character control rig is created and
attached with the underlying skeletal joints. The functionality and feasibility
of the rig was analyzed from various source of actual character motion and a
requirements criterion was met. The final rigged character provides an
efficient and easy to manipulate control rig with no lagging and at high frame
rate.
","[{'version': 'v1', 'created': 'Sat, 14 Feb 2015 11:29:26 GMT'}]",2015-02-24,"[['Bhatti', 'Zeeshan', ''], ['Shah', 'Asadullah', ''], ['Waqas', 'Ahmad', ''], ['Mahmood', 'Nadeem', '']]","['Character Rigging', 'Quadruped Rigging', 'Animation', 'Procedural Rigging']"
1445,2009.01876,Felicien Ihirwe,"Felicien Ihirwe, Davide Di Ruscio, Silvia Mazzini, Pierluigi Pierini,
  Alfonso Pierantonio",Low-code Engineering for Internet of things: A state of research,"8 pages, 3 figures, 1 table","MODELS '20: Proceedings of the 23rd ACM/IEEE International
  Conference on Model Driven Engineering Languages and Systems: Companion
  Proceedings. October 2020",10.1145/3417990.3420208,74,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Developing Internet of Things (IoT) systems has to cope with several
challenges mainly because of the heterogeneity of the involved sub-systems and
components. With the aim of conceiving languages and tools supporting the
development of IoT systems, this paper presents the results of the study, which
has been conducted to understand the current state of the art of existing
platforms, and in particular low-code ones, for developing IoT systems. By
analyzing sixteen platforms, a corresponding set of features has been
identified to represent the functionalities and the services that each analyzed
platform can support. We also identify the limitations of already existing
approaches and discuss possible ways to improve and address them in the future.
","[{'version': 'v1', 'created': 'Thu, 3 Sep 2020 18:41:37 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Sep 2020 12:15:45 GMT'}]",2020-11-03,"[['Ihirwe', 'Felicien', ''], ['Di Ruscio', 'Davide', ''], ['Mazzini', 'Silvia', ''], ['Pierini', 'Pierluigi', ''], ['Pierantonio', 'Alfonso', '']]","['Model Driven Engineering (MDE)', 'IoT', 'Low-code Engineering']"
1446,1408.5380,Javier Garcia-Bernardo,Javier Garcia-Bernardo and Margaret J. Eppstein,"Evolving Modular Genetic Regulatory Networks with a Recursive, Top-Down
  Approach",,,10.1007/s11693-015-9179-5,,cs.CE q-bio.MN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Being able to design genetic regulatory networks (GRNs) to achieve a desired
cellular function is one of the main goals of synthetic biology. However,
determining minimal GRNs that produce desired time-series behaviors is
non-trivial. In this paper, we propose a 'top-down' approach to evolving small
GRNs and then use these to recursively boot-strap the identification of larger,
more complex, modular GRNs. We start with relatively dense GRNs and then use
differential evolution (DE) to evolve interaction coefficients. When the target
dynamical behavior is found embedded in a dense GRN, we narrow the focus of the
search and begin aggressively pruning out excess interactions at the end of
each generation. We first show that the method can quickly rediscover known
small GRNs for a toggle switch and an oscillatory circuit. Next we include
these GRNs as non-evolvable subnetworks in the subsequent evolution of more
complex, modular GRNs. Successful solutions found in canonical DE where we
truncated small interactions to zero, with or without an interaction penalty
term, invariably contained many excess interactions. In contrast, by
incorporating aggressive pruning and the penalty term, the DE was able to find
minimal or nearly minimal GRNs in all test problems.
","[{'version': 'v1', 'created': 'Fri, 22 Aug 2014 18:56:30 GMT'}]",2022-01-24,"[['Garcia-Bernardo', 'Javier', ''], ['Eppstein', 'Margaret J.', '']]","['Genetic regulatory networks', 'synthetic biology', 'genetic network inference', 'differential evolution']"
1447,1912.02851,Fabio Valerio Massoli,"Fabio Valerio Massoli, Giuseppe Amato, Fabrizio Falchi",Cross-Resolution Learning for Face Recognition,,"Image and Vision Computing Volume 99, July 2020, 103927",10.1016/j.imavis.2020.103927,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convolutional Neural Networks have reached extremely high performances on the
Face Recognition task. Largely used datasets, such as VGGFace2, focus on
gender, pose and age variations trying to balance them to achieve better
results. However, the fact that images have different resolutions is not
usually discussed and resize to 256 pixels before cropping is used. While
specific datasets for very low resolution faces have been proposed, less
attention has been payed on the task of cross-resolution matching. Such
scenarios are of particular interest for forensic and surveillance systems in
which it usually happens that a low-resolution probe has to be matched with
higher-resolution galleries. While it is always possible to either increase the
resolution of the probe image or to reduce the size of the gallery images, to
the best of our knowledge an extensive experimentation of cross-resolution
matching was missing in the recent deep learning based literature. In the
context of low- and cross-resolution Face Recognition, the contributions of our
work are: i) we proposed a training method to fine-tune a state-of-the-art
model in order to make it able to extract resolution-robust deep features; ii)
we tested our models on the benchmark datasets IJB-B/C considering images at
both full and low resolutions in order to show the effectiveness of the
proposed training algorithm. To the best of our knowledge, this is the first
work testing extensively the performance of a FR model in a cross-resolution
scenario; iii) we tested our models on the low resolution and low quality
datasets QMUL-SurvFace and TinyFace and showed their superior performances,
even though we did not train our model on low-resolution faces only and our
main focus was cross-resolution; iv) we showed that our approach can be more
effective with respect to preprocessing faces with super resolution techniques.
","[{'version': 'v1', 'created': 'Thu, 5 Dec 2019 19:40:35 GMT'}]",2020-11-23,"[['Massoli', 'Fabio Valerio', ''], ['Amato', 'Giuseppe', ''], ['Falchi', 'Fabrizio', '']]","['Deep Learning', 'Low Resolution Face Recognition', 'Cross']"
1448,1706.05261,Kevin Van Horn,Kevin S. Van Horn,From Propositional Logic to Plausible Reasoning: A Uniqueness Theorem,Submitted to Int'l Journal of Approximate Reasoning,"International Journal of Approximate Reasoning 88 (2017), 309--332",10.1016/j.ijar.2017.06.003,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the question of extending propositional logic to a logic of
plausible reasoning, and posit four requirements that any such extension should
satisfy. Each is a requirement that some property of classical propositional
logic be preserved in the extended logic; as such, the requirements are simpler
and less problematic than those used in Cox's Theorem and its variants. As with
Cox's Theorem, our requirements imply that the extended logic must be
isomorphic to (finite-set) probability theory. We also obtain specific
numerical values for the probabilities, recovering the classical definition of
probability as a theorem, with truth assignments that satisfy the premise
playing the role of the ""possible cases.""
","[{'version': 'v1', 'created': 'Fri, 16 Jun 2017 13:13:45 GMT'}]",2017-07-07,"[['Van Horn', 'Kevin S.', '']]","['Bayesian', 'Carnap', 'Cox', 'Jaynes', 'logic', 'probability']"
1449,1404.1116,Ayush Bhandari,"Ayush Bhandari, Achuta Kadambi, Refael Whyte, Christopher Barsi, Micha
  Feigin, Adrian Dorrington, and Ramesh Raskar","Resolving Multi-path Interference in Time-of-Flight Imaging via
  Modulation Frequency Diversity and Sparse Regularization","11 Pages, 4 figures, appeared with minor changes in Optics Letters","Optics Letters, Vol. 39, Issue 6, pp. 1705-1708 (2014)",10.1364/OL.39.001705,,cs.CV cs.IT math.IT physics.optics,http://creativecommons.org/licenses/by/3.0/,"  Time-of-flight (ToF) cameras calculate depth maps by reconstructing phase
shifts of amplitude-modulated signals. For broad illumination or transparent
objects, reflections from multiple scene points can illuminate a given pixel,
giving rise to an erroneous depth map. We report here a sparsity regularized
solution that separates K-interfering components using multiple modulation
frequency measurements. The method maps ToF imaging to the general framework of
spectral estimation theory and has applications in improving depth profiles and
exploiting multiple scattering.
","[{'version': 'v1', 'created': 'Thu, 3 Apr 2014 23:22:48 GMT'}]",2014-06-20,"[['Bhandari', 'Ayush', ''], ['Kadambi', 'Achuta', ''], ['Whyte', 'Refael', ''], ['Barsi', 'Christopher', ''], ['Feigin', 'Micha', ''], ['Dorrington', 'Adrian', ''], ['Raskar', 'Ramesh', '']]","['Depth imaging', 'multi–path interference', 'sparse regularization', 'time–of–flight imaging']"
1450,1803.09853,Christoph Salge,"Christoph Salge, Michael Cerny Green, Rodrigo Canaan and Julian
  Togelius","Generative Design in Minecraft (GDMC), Settlement Generation Competition","10 pages, 5 figures, Part of the Foundations of Digital Games 2018
  proceedings, as part of the workshop on Procedural Content Generation","In Foundations of Digital Games 2018 (FDG18), August 7-10, 2018,
  Malm\""o, Sweden. ACM, New York, NY, USA, 10 pages",10.1145/3235765.3235814,,cs.AI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces the settlement generation competition for Minecraft,
the first part of the Generative Design in Minecraft challenge. The settlement
generation competition is about creating Artificial Intelligence (AI) agents
that can produce functional, aesthetically appealing and believable settlements
adapted to a given Minecraft map - ideally at a level that can compete with
human created designs. The aim of the competition is to advance procedural
content generation for games, especially in overcoming the challenges of
adaptive and holistic PCG. The paper introduces the technical details of the
challenge, but mostly focuses on what challenges this competition provides and
why they are scientifically relevant.
","[{'version': 'v1', 'created': 'Tue, 27 Mar 2018 02:35:02 GMT'}, {'version': 'v2', 'created': 'Tue, 31 Jul 2018 03:55:50 GMT'}]",2018-08-01,"[['Salge', 'Christoph', ''], ['Green', 'Michael Cerny', ''], ['Canaan', 'Rodrigo', ''], ['Togelius', 'Julian', '']]","['competition', 'generative design', 'procedural content generation', 'Minecraft']"
1451,1101.3837,Abuzer Yakaryilmaz,Andris Ambainis and Abuzer Yakaryilmaz,Superiority of exact quantum automata for promise problems,"A completely new version. 6 pages. (The previous version contains
  some errata.)","Information Processing Letters, Volume 112, Issue 7, 31 March
  2012, Pages 289-291",10.1016/j.ipl.2012.01.001,,cs.CC cs.FL quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this note, we present an infinite family of promise problems which can be
solved exactly by just tuning transition amplitudes of a two-state quantum
finite automata operating in realtime mode, whereas the size of the
corresponding classical automata grow without bound.
","[{'version': 'v1', 'created': 'Thu, 20 Jan 2011 08:17:25 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Aug 2011 13:50:08 GMT'}]",2014-01-29,"[['Ambainis', 'Andris', ''], ['Yakaryilmaz', 'Abuzer', '']]","['exact quantum computation', 'promise problems', 'succinctness', 'quantum finite automaton', 'classical finite automaton']"
1452,1802.06706,Michele Polese,"Tommaso Zugno, Michele Polese, Michele Zorzi","Integration of Carrier Aggregation and Dual Connectivity for the ns-3
  mmWave Module","9 pages, 7 figures, submitted to the Workshop on ns-3 (WNS3) 2018",,10.1145/3199902.3199909,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Thanks to the wide availability of bandwidth, the millimeter wave (mmWave)
frequencies will provide very high data rates to mobile users in next
generation 5G cellular networks. However, mmWave links suffer from high
isotropic pathloss and blockage from common materials, and are subject to an
intermittent channel quality. Therefore, protocols and solutions at different
layers in the cellular network and the TCP/IP protocol stack have been proposed
and studied. A valuable tool for the end-to-end performance analysis of mmWave
cellular networks is the ns-3 mmWave module, which already models in detail the
channel, Physical (PHY) and Medium Access Control (MAC) layers, and extends the
Long Term Evolution (LTE) stack for the higher layers. In this paper we present
an implementation for the ns-3 mmWave module of multi connectivity techniques
for 3GPP New Radio (NR) at mmWave frequencies, namely Carrier Aggregation (CA)
and Dual Connectivity (DC), and discuss how they can be integrated to increase
the functionalities offered by the ns-3 mmWave module.
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 17:08:20 GMT'}]",2018-09-06,"[['Zugno', 'Tommaso', ''], ['Polese', 'Michele', ''], ['Zorzi', 'Michele', '']]","['mmWave', '5G', 'Cellular', 'Carrier Aggregation']"
1453,1809.03457,Andrew Mellor,Andrew Mellor,"Event Graphs: Advances and Applications of Second-Order Time-Unfolded
  Temporal Network Models","19 pages, 10 figures, 1 table","Advances in Complex Systems (Volume No.22, Issue No. 03, 2019)",10.1142/S0219525919500061,,cs.SI nlin.AO physics.data-an physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advances in data collection and storage have allowed both researchers
and industry alike to collect data in real time. Much of this data comes in the
form of 'events', or timestamped interactions, such as email and social media
posts, website clickstreams, or protein-protein interactions. This of type data
poses new challenges for modelling, especially if we wish to preserve all
temporal features and structure. We propose a generalised framework to explore
temporal networks using second-order time-unfolded models, called event graphs.
Through examples we demonstrate how event graphs can be used to understand the
higher-order topological-temporal structure of temporal networks and capture
properties of the network that are unobserved when considering either a static
(or time-aggregated) model. Furthermore, we show that by modelling a temporal
network as an event graph our analysis extends easily to consider non-dyadic
interactions, known as hyper-events.
","[{'version': 'v1', 'created': 'Mon, 10 Sep 2018 16:53:12 GMT'}]",2019-08-29,"[['Mellor', 'Andrew', '']]","['temporal networks', 'higher-order models', 'hypergraphs', 'percolation']"
1454,1703.06822,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",Process algebra with strategic interleaving,"19 pages, this version is a revision of the published version","Theory of Computing Systems, 63(3):488--505, 2019",10.1007/s00224-018-9873-2,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In process algebras such as ACP (Algebra of Communicating Processes),
parallel processes are considered to be interleaved in an arbitrary way. In the
case of multi-threading as found in contemporary programming languages,
parallel processes are actually interleaved according to some interleaving
strategy. An interleaving strategy is what is called a process-scheduling
policy in the field of operating systems. In many systems, for instance
hardware/software systems, we have to do with both parallel processes that may
best be considered to be interleaved in an arbitrary way and parallel processes
that may best be considered to be interleaved according to some interleaving
strategy. Therefore, we extend ACP in this paper with the latter form of
interleaving. The established properties of the extension concerned include an
elimination property, a conservative extension property, and a unique expansion
property.
","[{'version': 'v1', 'created': 'Mon, 20 Mar 2017 16:15:17 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Feb 2018 11:05:48 GMT'}, {'version': 'v3', 'created': 'Tue, 21 Apr 2020 12:39:01 GMT'}]",2020-04-22,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['process algebra', 'arbitrary interleaving', 'strategic interleaving']"
1455,2102.04201,Jennifer Cobbe Dr,"Jennifer Cobbe, Michelle Seng Ah Lee, Jatinder Singh","Reviewable Automated Decision-Making: A Framework for Accountable
  Algorithmic Systems",,"ACM Conference on Fairness, Accountability, and Transparency
  (FAccT 21), March 2021, Virtual Event, Canada",,,cs.CY cs.AI,http://creativecommons.org/licenses/by/4.0/,"  This paper introduces reviewability as a framework for improving the
accountability of automated and algorithmic decision-making (ADM) involving
machine learning. We draw on an understanding of ADM as a socio-technical
process involving both human and technical elements, beginning before a
decision is made and extending beyond the decision itself. While explanations
and other model-centric mechanisms may assist some accountability concerns,
they often provide insufficient information of these broader ADM processes for
regulatory oversight and assessments of legal compliance. Reviewability
involves breaking down the ADM process into technical and organisational
elements to provide a systematic framework for determining the contextually
appropriate record-keeping mechanisms to facilitate meaningful review - both of
individual decisions and of the process as a whole. We argue that a
reviewability framework, drawing on administrative law's approach to reviewing
human decision-making, offers a practical way forward towards more a more
holistic and legally-relevant form of accountability for ADM.
","[{'version': 'v1', 'created': 'Tue, 26 Jan 2021 18:15:34 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Feb 2021 11:48:42 GMT'}]",2021-02-11,"[['Cobbe', 'Jennifer', ''], ['Lee', 'Michelle Seng Ah', ''], ['Singh', 'Jatinder', '']]","['Algorithmic systems', 'automated decision-making', 'accountability', 'audit', 'artificial intelligence', 'machine learning']"
1456,1504.01130,Radu Grigore,"Maria Bruna, Radu Grigore, Stefan Kiefer, Jo\""el Ouaknine, James
  Worrell",Proving the Herman-Protocol Conjecture,ICALP 2016,,10.4230/LIPIcs.ICALP.2016.104,,cs.DS cs.CC cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Herman's self-stabilisation algorithm, introduced 25 years ago, is a
well-studied synchronous randomised protocol for enabling a ring of $N$
processes collectively holding any odd number of tokens to reach a stable state
in which a single token remains. Determining the worst-case expected time to
stabilisation is the central outstanding open problem about this protocol. It
is known that there is a constant $h$ such that any initial configuration has
expected stabilisation time at most $h N^2$. Ten years ago, McIver and Morgan
established a lower bound of $4/27 \approx 0.148$ for $h$, achieved with three
equally-spaced tokens, and conjectured this to be the optimal value of $h$. A
series of papers over the last decade gradually reduced the upper bound on $h$,
with the present record (achieved in 2014) standing at approximately $0.156$.
In this paper, we prove McIver and Morgan's conjecture and establish that $h =
4/27$ is indeed optimal.
","[{'version': 'v1', 'created': 'Sun, 5 Apr 2015 15:55:55 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Jul 2015 15:17:53 GMT'}, {'version': 'v3', 'created': 'Wed, 27 Apr 2016 22:34:01 GMT'}]",2017-10-12,"[['Bruna', 'Maria', ''], ['Grigore', 'Radu', ''], ['Kiefer', 'Stefan', ''], ['Ouaknine', 'Joël', ''], ['Worrell', 'James', '']]","['randomized protocols', 'self-stabilization', 'Lyapunov function', 'expectedtime']"
1457,1304.3629,Hema Latha S,"Hemalatha S, U Dinesh Acharya, Renuka A, Priya R. Kamath",A Secure And High Capacity Image Steganography Technique,"7 pages, Signal & Image Processing : An International Journal (SIPIJ)
  Vol.4, No.1, February 2013. arXiv admin note: substantial text overlap with
  arXiv:1304.3313",,10.5121/sipij.2013.4108,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Steganography is the science of invisible communication. The purpose of
Steganography is to maintain secret communication between two parties. The
secret information can be concealed in content such as image, audio, or video.
This paper provides a novel image steganography technique to hide multiple
secret images and keys in color cover image using Integer Wavelet Transform
(IWT). There is no visual difference between the stego image and the cover
image. The extracted secret images are also similar to the original secret
images. Very good PSNR (Peak Signal to Noise Ratio) values are obtained for
both stego and extracted secret images. The results are compared with the
results of other techniques, where single image is hidden and it is found that
the proposed technique is simple and gives better PSNR values than others.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2013 14:45:51 GMT'}]",2013-04-15,"[['S', 'Hemalatha', ''], ['Acharya', 'U Dinesh', ''], ['A', 'Renuka', ''], ['Kamath', 'Priya R.', '']]","['Steganography', 'IWT', 'MSE', 'PSNR', 'RGB', 'Luminance', 'Chrominance']"
1458,1303.0344,Diego  Amancio Raphael,Thiago C. Silva and Diego R. Amancio,"Network-based stochastic competitive learning approach to disambiguation
  in collaborative networks",,"Chaos 23, 013139 (2013)",10.1063/1.4794795,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many patterns have been uncovered in complex systems through the application
of concepts and methodologies of complex networks. Unfortunately, the validity
and accuracy of the unveiled patterns are strongly dependent on the amount of
unavoidable noise pervading the data, such as the presence of homonymous
individuals in social networks. In the current paper, we investigate the
problem of name disambiguation in collaborative networks, a task that plays a
fundamental role on a myriad of scientific contexts. In special, we use an
unsupervised technique which relies on a particle competition mechanism in a
networked environment to detect the clusters. It has been shown that, in this
kind of environment, the learning process can be improved because the network
representation of data can capture topological features of the input data set.
Specifically, in the proposed disambiguating model, a set of particles is
randomly spawned into the nodes constituting the network. As time progresses,
the particles employ a movement strategy composed of a probabilistic convex
mixture of random and preferential walking policies. In the former, the walking
rule exclusively depends on the topology of the network and is responsible for
the exploratory behavior of the particles. In the latter, the walking rule
depends both on the topology and the domination levels that the particles
impose on the neighboring nodes. This type of behavior compels the particles to
perform a defensive strategy, because it will force them to revisit nodes that
are already dominated by them, rather than exploring rival territories.
Computer simulations conducted on the networks extracted from the arXiv
repository of preprint papers and also from other databases reveal the
effectiveness of the model, which turned out to be more accurate than
traditional clustering methods.
","[{'version': 'v1', 'created': 'Sat, 2 Mar 2013 03:41:55 GMT'}]",2013-03-12,"[['Silva', 'Thiago C.', ''], ['Amancio', 'Diego R.', '']]","['Collaborative networks', 'disambiguation', 'stochastic competitive learning', 'complex networks', 'unsupervised learning']"
1459,1006.5398,John Whitbeck,"John Whitbeck, Marcelo Dias de Amorim, Vania Conan, Mostafa Ammar,
  Ellen Zegura",From Encounters to Plausible Mobility,"Accepted for publication in the Pervasive and Mobile Computing
  Journal",,10.1016/j.pmcj.2010.11.001,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Inferring plausible node mobility based only on information from wireless
contact traces is a difficult problem. Working with mobility information allows
richer protocol simulations, particularly in dense networks, but requires
complex set-ups to measure. On the other hand, contact information is easier to
measure but only allows for simplistic simulation models. In a contact trace a
lot of node movement information is irretrievably lost so the original
positions and velocities are in general out of reach. In this paper, we propose
a fast heuristic algorithm, inspired by dynamic force-based graph drawing,
capable of inferring a plausible movement from any contact trace, and evaluate
it on both synthetic and real-life contact traces. Our results reveal that (i)
the quality of the inferred mobility is directly linked to the precision of the
measured contact trace, and (ii) the simple addition of appropriate
anticipation forces between nodes leads to an accurate inferred mobility.
","[{'version': 'v1', 'created': 'Mon, 28 Jun 2010 16:32:21 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Aug 2010 09:15:27 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Nov 2010 10:00:35 GMT'}]",2010-11-29,"[['Whitbeck', 'John', ''], ['de Amorim', 'Marcelo Dias', ''], ['Conan', 'Vania', ''], ['Ammar', 'Mostafa', ''], ['Zegura', 'Ellen', '']]","['Mobile networks', 'Graph Animation', 'Movement Inference', 'ContactTraces']"
1460,1606.04567,Maruti Mudunuru,"M. K. Mudunuru, S. Karra, D. R. Harp, G. D. Guthrie, H. S. Viswanathan","Regression-based reduced-order models to predict transient thermal
  output for enhanced geothermal systems","25 pages, 8 figures","M.K. Mudunuru, S. Karra, D.R. Harp, G.D. Guthrie, H.S.
  Viswanathan, Regression-based reduced-order models to predict transient
  thermal output for enhanced geothermal systems, Geothermics, Volume 70, 2017,
  Pages 192-205",10.1016/j.geothermics.2017.06.013,,cs.CE math.NA physics.comp-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The goal of this paper is to assess the utility of Reduced-Order Models
(ROMs) developed from 3D physics-based models for predicting transient thermal
power output for an enhanced geothermal reservoir while explicitly accounting
for uncertainties in the subsurface system and site-specific details. Numerical
simulations are performed based on Latin Hypercube Sampling (LHS) of model
inputs drawn from uniform probability distributions. Key sensitive parameters
are identified from these simulations, which are fracture zone permeability,
well/skin factor, bottom hole pressure, and injection flow rate. The inputs for
ROMs are based on these key sensitive parameters. The ROMs are then used to
evaluate the influence of subsurface attributes on thermal power production
curves. The resulting ROMs are compared with field-data and the detailed
physics-based numerical simulations. We propose three different ROMs with
different levels of model parsimony, each describing key and essential features
of the power production curves. ROM-1 is able to accurately reproduce the power
output of numerical simulations for low values of permeabilities and certain
features of the field-scale data, and is relatively parsimonious. ROM-2 is a
more complex model than ROM-1 but it accurately describes the field-data. At
higher permeabilities, ROM-2 reproduces numerical results better than ROM-1,
however, there is a considerable deviation at low fracture zone permeabilities.
ROM-3 is developed by taking the best aspects of ROM-1 and ROM-2 and provides a
middle ground for model parsimony. It is able to describe various features of
numerical simulations and field-data. From the proposed workflow, we
demonstrate that the proposed simple ROMs are able to capture various complex
features of the power production curves of Fenton Hill HDR system. For typical
EGS applications, ROM-2 and ROM-3 outperform ROM-1.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2016 21:05:16 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Feb 2017 05:22:16 GMT'}, {'version': 'v3', 'created': 'Wed, 12 Jul 2017 19:05:32 GMT'}]",2018-06-18,"[['Mudunuru', 'M. K.', ''], ['Karra', 'S.', ''], ['Harp', 'D. R.', ''], ['Guthrie', 'G. D.', ''], ['Viswanathan', 'H. S.', '']]","['Enhanced Geothermal Systems (EGS)', 'Reduced-Order Models (ROMs)', 'thermal drawdown', 'regression']"
1461,1902.00916,Tom Hanika,Tom Hanika and Maximilian Marx and Gerd Stumme,Discovering Implicational Knowledge in Wikidata,,,10.1007/978-3-030-21462-3_21,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge graphs have recently become the state-of-the-art tool for
representing the diverse and complex knowledge of the world. Examples include
the proprietary knowledge graphs of companies such as Google, Facebook, IBM, or
Microsoft, but also freely available ones such as YAGO, DBpedia, and Wikidata.
A distinguishing feature of Wikidata is that the knowledge is collaboratively
edited and curated. While this greatly enhances the scope of Wikidata, it also
makes it impossible for a single individual to grasp complex connections
between properties or understand the global impact of edits in the graph. We
apply Formal Concept Analysis to efficiently identify comprehensible
implications that are implicitly present in the data. Although the complex
structure of data modelling in Wikidata is not amenable to a direct approach,
we overcome this limitation by extracting contextual representations of parts
of Wikidata in a systematic fashion. We demonstrate the practical feasibility
of our approach through several experiments and show that the results may lead
to the discovery of interesting implicational knowledge. Besides providing a
method for obtaining large real-world data sets for FCA, we sketch potential
applications in offering semantic assistance for editing and curating Wikidata.
","[{'version': 'v1', 'created': 'Sun, 3 Feb 2019 16:13:53 GMT'}]",2020-02-28,"[['Hanika', 'Tom', ''], ['Marx', 'Maximilian', ''], ['Stumme', 'Gerd', '']]","['Wikidata', 'Formal Concept Analysis', 'Property Dependencies', 'Implications']"
1462,1502.04662,Tim Althoff,"Tim Althoff, Xin Luna Dong, Kevin Murphy, Safa Alai, Van Dang, Wei
  Zhang",TimeMachine: Timeline Generation for Knowledge-Base Entities,"To appear at ACM SIGKDD KDD'15. 12pp, 7 fig. With appendix. Demo and
  other info available at http://cs.stanford.edu/~althoff/timemachine/",,10.1145/2783258.2783325,,cs.DB cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a method called TIMEMACHINE to generate a timeline of events and
relations for entities in a knowledge base. For example for an actor, such a
timeline should show the most important professional and personal milestones
and relationships such as works, awards, collaborations, and family
relationships. We develop three orthogonal timeline quality criteria that an
ideal timeline should satisfy: (1) it shows events that are relevant to the
entity; (2) it shows events that are temporally diverse, so they distribute
along the time axis, avoiding visual crowding and allowing for easy user
interaction, such as zooming in and out; and (3) it shows events that are
content diverse, so they contain many different types of events (e.g., for an
actor, it should show movies and marriages and awards, not just movies). We
present an algorithm to generate such timelines for a given time period and
screen size, based on submodular optimization and web-co-occurrence statistics
with provable performance guarantees. A series of user studies using Mechanical
Turk shows that all three quality criteria are crucial to produce quality
timelines and that our algorithm significantly outperforms various baseline and
state-of-the-art methods.
","[{'version': 'v1', 'created': 'Mon, 16 Feb 2015 18:53:01 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Feb 2015 07:02:11 GMT'}, {'version': 'v3', 'created': 'Mon, 8 Jun 2015 20:39:26 GMT'}]",2015-06-10,"[['Althoff', 'Tim', ''], ['Dong', 'Xin Luna', ''], ['Murphy', 'Kevin', ''], ['Alai', 'Safa', ''], ['Dang', 'Van', ''], ['Zhang', 'Wei', '']]","['Summarization', 'Timeline', 'Knowledge Base', 'Submodular Optimization']"
1463,1604.06581,Gabor Kecskemeti,Gabor Kecskemeti,"DISSECT-CF: a simulator to foster energy-aware scheduling in
  infrastructure clouds","28 pages, 17 figures, preprint version of the paper accepted by
  Simulation Modelling Practice and Theory","Simulation Modelling Practice and Theory, Volume 58, Part 2,
  November 2015, Pages 188-218, ISSN 1569-190X",10.1016/j.simpat.2015.05.009,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Infrastructure as a service (IaaS) systems offer on demand virtual
infrastructures so reliably and flexibly that users expect a high service
level. Therefore, even with regards to internal IaaS behaviour, production
clouds only adopt novel ideas that are proven not to hinder established service
levels. To analyse their expected behaviour, new ideas are often evaluated with
simulators in production IaaS system-like scenarios. For instance, new research
could enable collaboration amongst several layers of schedulers or could
consider new optimisation objectives such as energy consumption. Unfortunately,
current cloud simulators are hard to employ and they often have performance
issues when several layers of schedulers interact in them. To target these
issues, a new IaaS simulation framework (called DISSECT-CF) was designed. The
new simulator's foundation has the following goals: easy extensibility, support
energy evaluation of IaaSs and to enable fast evaluation of many scheduling and
IaaS internal behaviour related scenarios. In response to the requirements of
such scenarios, the new simulator introduces concepts such as: a unified model
for resource sharing and a new energy metering framework with hierarchical and
indirect metering options. Then, the comparison of several simulated situations
to real-life IaaS behaviour is used to validate the simulator's functionality.
Finally, a performance comparison is presented between DISSECT-CF and some
currently available simulators.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2016 09:14:56 GMT'}]",2016-04-25,"[['Kecskemeti', 'Gabor', '']]","['Cloud Computing', 'Infrastructure as a Service', 'Energy-Awareness', 'Resource management', 'Simulation']"
1464,1609.03136,Teruaki Kitasuka,Teruaki Kitasuka and Masahiro Iida,"A Heuristic Method of Generating Diameter 3 Graphs for Order/Degree
  Problem","Proceedings of 10th IEEE/ACM International Symposium on
  Networks-on-Chip, Nara, Japan, Aug. 2016",,10.1109/NOCS.2016.7579334,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a heuristic method that generates a graph for order/degree
problem. Target graphs of our heuristics have large order (> 4000) and diameter
3. We describe the ob- servation of smaller graphs and basic structure of our
heuristics. We also explain an evaluation function of each edge for efficient
2-opt local search. Using them, we found the best solutions for several graphs.
","[{'version': 'v1', 'created': 'Sun, 11 Sep 2016 08:56:02 GMT'}]",2016-10-10,"[['Kitasuka', 'Teruaki', ''], ['Iida', 'Masahiro', '']]","['order/degree problem', 'graph generation', 'Petersengraph', 'average shortest path length', '2-opt']"
1465,1902.10493,Jan Dvorak,Jan Dvo\v{r}\'ak and Zden\v{e}k Hanz\'alek,"Multi-Variant Scheduling of Critical Time-Triggered Communication in
  Incremental Development Process: Application to FlexRay",18 pages,"IEEE Transactions on Vehicular Technology, 68(1):155-169, Jan 2019",10.1109/TVT.2018.2879920,,cs.SY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The portfolio of models offered by car manufacturing groups often includes
many variants (i.e., different car models and their versions). With such
diversity in car models, variant management becomes a formidable task. Thus,
there is an effort to keep the variants as close as possible. This simple
requirement forms a big challenge in the area of communication protocols. When
several vehicle variants use the same signal, it is often required to
simultaneously schedule such a signal in all vehicle variants. Furthermore, new
vehicle variants are designed incrementally in such a way as to maintain
backward compatibility with the older vehicles. Backward compatibility of
time-triggered schedules reduces expenses relating to testing and fine-tuning
of the components that interact with physical environment (e.g.,
electromagnetic compatibility issues). As this requirement provides for using
the same platform, it simplifies signal traceability and diagnostics, across
different vehicle variants, besides simplifying the reuse of components and
tools.
  This paper proposes an efficient and robust heuristic algorithm, which
creates the schedules for internal communication of new vehicle variants. The
algorithm provides for variant management by ensuring compatibility among the
new variants, besides preserving backward compatibility with the preceding
vehicle variants. Based on the results of the proposed algorithm, the impact of
maintaining compatibility among new variants and of preserving backward
compatibility with the preceding variants on the scheduling procedure is
examined and discussed. Thanks to the execution time of the algorithm, which is
less than one second, the network parameters like the frame length and cycle
duration are explored to find their best choice concerning the schedule
feasibility.
","[{'version': 'v1', 'created': 'Wed, 27 Feb 2019 12:51:36 GMT'}]",2019-02-28,"[['Dvořák', 'Jan', ''], ['Hanzálek', 'Zdeněk', '']]","['FlexRay', 'Static segment', 'Automotive', 'Scheduling', 'Incremental', 'Multi-variant', 'Real-time']"
1466,1112.4033,William Moses Jr.,William K. Moses Jr. and C. Pandu Rangan,"Rational Secret Sharing over an Asynchronous Broadcast Channel with
  Information Theoretic Security","18 pages, 2 tables","International Journal of Network Security & Its Applications
  (IJNSA), Volume 3, Number 6, November 2011, pp. 1-18",10.5121/ijnsa.2011.3601,,cs.CR cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of rational secret sharing introduced by Halpern and
Teague [1], where the players involved in secret sharing play only if it is to
their advantage. This can be characterized in the form of preferences. Players
would prefer to get the secret than to not get it and secondly with lesser
preference, they would like as few other players to get the secret as possible.
Several positive results have already been published to efficiently solve the
problem of rational secret sharing but only a handful of papers have touched
upon the use of an asynchronous broadcast channel. [2] used cryptographic
primitives, [3] used an interactive dealer, and [4] used an honest minority of
players in order to handle an asynchronous broadcast channel.
  In our paper, we propose an m-out-of-n rational secret sharing scheme which
can function over an asynchronous broadcast channel without the use of
cryptographic primitives and with a non-interactive dealer. This is possible
because our scheme uses a small number, k+1, of honest players. The protocol is
resilient to coalitions of size up to k and furthermore it is
{\epsilon}-resilient to coalitions of size up to and including m-1. The
protocol will have a strict Nash equilibrium with probability Pr((k+1)/n) and
an {\epsilon}-Nash equilibrium with probability Pr((n-k-1)/n) . Furthermore,
our protocol is immune to backward induction.
  Later on in the paper, we extend our results to include malicious players as
well.
  We also show that our protocol handles the possibility of a player deviating
in order to force another player to get a wrong value in what we believe to be
a more time efficient manner than was done in Asharov and Lindell [5].
","[{'version': 'v1', 'created': 'Sat, 17 Dec 2011 07:03:40 GMT'}]",2011-12-20,"[['Moses', 'William K.', 'Jr.'], ['Rangan', 'C. Pandu', '']]","['Cryptographic Protocols', 'Rational Secret Sharing', 'Information Theoretic Security']"
1467,1811.03796,Yansong Feng,"Liwei Chen, Yansong Feng, Songfang Huang, Bingfeng Luo, Dongyan Zhao","Encoding Implicit Relation Requirements for Relation Extraction: A Joint
  Inference Approach",to appear in Artificial Intelligence,https://doi.org/10.1016/j.artint.2018.08.004,10.1016/j.artint.2018.08.004,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Relation extraction is the task of identifying predefined relationship
between entities, and plays an essential role in information extraction,
knowledge base construction, question answering and so on. Most existing
relation extractors make predictions for each entity pair locally and
individually, while ignoring implicit global clues available across different
entity pairs and in the knowledge base, which often leads to conflicts among
local predictions from different entity pairs. This paper proposes a joint
inference framework that employs such global clues to resolve disagreements
among local predictions. We exploit two kinds of clues to generate constraints
which can capture the implicit type and cardinality requirements of a relation.
Those constraints can be examined in either hard style or soft style, both of
which can be effectively explored in an integer linear program formulation.
Experimental results on both English and Chinese datasets show that our
proposed framework can effectively utilize those two categories of global clues
and resolve the disagreements among local predictions, thus improve various
relation extractors when such clues are applicable to the datasets. Our
experiments also indicate that the clues learnt automatically from existing
knowledge bases perform comparably to or better than those refined by human.
","[{'version': 'v1', 'created': 'Fri, 9 Nov 2018 07:06:46 GMT'}]",2018-11-12,"[['Chen', 'Liwei', ''], ['Feng', 'Yansong', ''], ['Huang', 'Songfang', ''], ['Luo', 'Bingfeng', ''], ['Zhao', 'Dongyan', '']]","['relation extraction', 'joint inference', 'knowledge base', 'integer linear']"
1468,1911.08775,Lutz Bornmann Dr.,"Lutz Bornmann, Sitaram Devarakonda, Alexander Tekles, George Chacko","Do disruption index indicators measure what they propose to measure? The
  comparison of several indicator variants with assessments by peers",,,10.1162/qss_a_00068,,cs.DL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, Wu, Wang, and Evans (2019) and Bu, Waltman, and Huang (2019)
proposed a new family of indicators, which measure whether a scientific
publication is disruptive to a field or tradition of research. Such disruptive
influences are characterized by citations to a focal paper, but not its cited
references. In this study, we are interested in the question of convergent
validity, i.e., whether these indicators of disruption are able to measure what
they propose to measure ('disruptiveness'). We used external criteria of
newness to examine convergent validity: in the post-publication peer review
system of F1000Prime, experts assess papers whether the reported research
fulfills these criteria (e.g., reports new findings). This study is based on
120,179 papers from F1000Prime published between 2000 and 2016. In the first
part of the study we discuss the indicators. Based on the insights from the
discussion, we propose alternate variants of disruption indicators. In the
second part, we investigate the convergent validity of the indicators and the
(possibly) improved variants. Although the results of a factor analysis show
that the different variants measure similar dimensions, the results of
regression analyses reveal that one variant (DI5) performs slightly better than
the others.
","[{'version': 'v1', 'created': 'Wed, 20 Nov 2019 09:01:38 GMT'}]",2021-01-05,"[['Bornmann', 'Lutz', ''], ['Devarakonda', 'Sitaram', ''], ['Tekles', 'Alexander', ''], ['Chacko', 'George', '']]","['bibliometrics', 'disruption index', 'dependence index', 'novelty']"
1469,1308.2872,Blesson Varghese,"Blesson Varghese, Gerard McKee, Vassil Alexandrov","Can Agent Intelligence be used to Achieve Fault Tolerant Parallel
  Computing Systems?",,"Parallel Processing Letters, Volume 21, Issue 04, December 2011",10.1142/S012962641100028X,,cs.DC cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The work reported in this paper is motivated towards validating an
alternative approach for fault tolerance over traditional methods like
checkpointing that constrain efficacious fault tolerance. Can agent
intelligence be used to achieve fault tolerant parallel computing systems? If
so, ""What agent capabilities are required for fault tolerance?"", ""What parallel
computational tasks can benefit from such agent capabilities?"" and ""How can
agent capabilities be implemented for fault tolerance?"" need to be addressed.
Cognitive capabilities essential for achieving fault tolerance through agents
are considered. Parallel reduction algorithms are identified as a class of
algorithms that can benefit from cognitive agent capabilities. The Message
Passing Interface is utilized for implementing an intelligent agent based
approach. Preliminary results obtained from the experiments validate the
feasibility of an agent based approach for achieving fault tolerance in
parallel computing systems.
","[{'version': 'v1', 'created': 'Tue, 13 Aug 2013 14:09:03 GMT'}]",2013-08-14,"[['Varghese', 'Blesson', ''], ['McKee', 'Gerard', ''], ['Alexandrov', 'Vassil', '']]","['Fault tolerance', 'Intelligent agent', 'Parallel computing']"
1470,1803.00712,Phuong Le-Hong,"Phuong Le-Hong, Duc-Thien Bui",A Factoid Question Answering System for Vietnamese,"In the proceedings of the HQA'18 workshop, The Web Conference
  Companion, Lyon, France",,10.1145/3184558.3191535,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we describe the development of an end-to-end factoid question
answering system for the Vietnamese language. This system combines both
statistical models and ontology-based methods in a chain of processing modules
to provide high-quality mappings from natural language text to entities. We
present the challenges in the development of such an intelligent user interface
for an isolating language like Vietnamese and show that techniques developed
for inflectional languages cannot be applied ""as is"". Our question answering
system can answer a wide range of general knowledge questions with promising
accuracy on a test set.
","[{'version': 'v1', 'created': 'Fri, 2 Mar 2018 04:10:24 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Mar 2018 03:32:39 GMT'}, {'version': 'v3', 'created': 'Wed, 28 Mar 2018 09:28:56 GMT'}]",2018-03-29,"[['Le-Hong', 'Phuong', ''], ['Bui', 'Duc-Thien', '']]","['question answering', 'ontology', 'knowledge bases', 'hybrid', 'Vietnamese']"
1471,1502.05507,Umberto Mart\'inez-Pe\~nas,"Olav Geil, Stefano Martin, Umberto Mart\'inez-Pe\~nas, Ryutaroh
  Matsumoto and Diego Ruano",On asymptotically good ramp secret sharing schemes,,"IEICE Trans. Fundamentals. vol. E100-A, no. 12, pages 2699-2708
  (2017)",10.1587/transfun.E100.A.2699,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Asymptotically good sequences of linear ramp secret sharing schemes have been
intensively studied by Cramer et al. in terms of sequences of pairs of nested
algebraic geometric codes. In those works the focus is on full privacy and full
reconstruction. In this paper we analyze additional parameters describing the
asymptotic behavior of partial information leakage and possibly also partial
reconstruction giving a more complete picture of the access structure for
sequences of linear ramp secret sharing schemes. Our study involves a detailed
treatment of the (relative) generalized Hamming weights of the considered
codes.
","[{'version': 'v1', 'created': 'Thu, 19 Feb 2015 09:23:37 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Mar 2015 16:52:47 GMT'}, {'version': 'v3', 'created': 'Thu, 5 Mar 2015 16:00:09 GMT'}, {'version': 'v4', 'created': 'Thu, 12 Mar 2015 11:45:31 GMT'}, {'version': 'v5', 'created': 'Mon, 2 Nov 2015 14:36:02 GMT'}, {'version': 'v6', 'created': 'Mon, 22 Aug 2016 10:57:58 GMT'}, {'version': 'v7', 'created': 'Thu, 2 Feb 2017 22:42:15 GMT'}]",2018-02-08,"[['Geil', 'Olav', ''], ['Martin', 'Stefano', ''], ['Martínez-Peñas', 'Umberto', ''], ['Matsumoto', 'Ryutaroh', ''], ['Ruano', 'Diego', '']]","['Algebraic geometric codes', 'generalized Hamming weights', 'relativegeneralized Hamming weights', 'secret sharing']"
1472,1611.04138,Mohammad Hossein Jafari,"Ebrahim Nasr-Esfahani, Nader Karimi, S.M. Reza Soroushmehr, M. Hossein
  Jafari, M. Amin Khorsandi, Shadrokh Samavi, Kayvan Najarian","Hand Gesture Recognition for Contactless Device Control in Operating
  Rooms",,,10.1007/s11548-017-1588-3,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hand gesture is one of the most important means of touchless communication
between human and machines. There is a great interest for commanding electronic
equipment in surgery rooms by hand gesture for reducing the time of surgery and
the potential for infection. There are challenges in implementation of a hand
gesture recognition system. It has to fulfill requirements such as high
accuracy and fast response. In this paper we introduce a system of hand gesture
recognition based on a deep learning approach. Deep learning is known as an
accurate detection model, but its high complexity prevents it from being
fabricated as an embedded system. To cope with this problem, we applied some
changes in the structure of our work to achieve low complexity. As a result,
the proposed method could be implemented on a naive embedded system. Our
experiments show that the proposed system results in higher accuracy while
having less complexity in comparison with the existing comparable methods.
","[{'version': 'v1', 'created': 'Sun, 13 Nov 2016 14:02:54 GMT'}]",2017-10-24,"[['Nasr-Esfahani', 'Ebrahim', ''], ['Karimi', 'Nader', ''], ['Soroushmehr', 'S. M. Reza', ''], ['Jafari', 'M. Hossein', ''], ['Khorsandi', 'M. Amin', ''], ['Samavi', 'Shadrokh', ''], ['Najarian', 'Kayvan', '']]","['Hand gesture recognition', 'convolutional neural network', 'embedded system', 'surgery aid system']"
1473,1107.1586,Ke Xu,"Jichang Zhao, Xu Feng, Li Dong, Xiao Liang and Ke Xu","Performance of Local Information Based Link Prediction: A Sampling
  Perspective","19 pages, 5 figures",J. Phys. A: Math. Theor. 45 (2012) 345001,10.1088/1751-8113/45/34/345001,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Link prediction is pervasively employed to uncover the missing links in the
snapshots of real-world networks, which are usually obtained from kinds of
sampling methods. Contrarily, in the previous literature, in order to evaluate
the performance of the prediction, the known edges in the sampled snapshot are
divided into the training set and the probe set randomly, without considering
the diverse sampling approaches beyond. However, different sampling methods
might lead to different missing links, especially for the biased ones. For this
reason, random partition based evaluation of performance is no longer
convincing if we take the sampling method into account. Hence, in this paper,
aim at filling this void, we try to reevaluate the performance of local
information based link predictions through sampling methods governed division
of the training set and the probe set. It is interesting that we find for
different sampling methods, each prediction approach performs unevenly.
Moreover, most of these predictions perform weakly when the sampling method is
biased, which indicates that the performance of these methods is overestimated
in the prior works.
","[{'version': 'v1', 'created': 'Fri, 8 Jul 2011 09:30:19 GMT'}]",2014-10-28,"[['Zhao', 'Jichang', ''], ['Feng', 'Xu', ''], ['Dong', 'Li', ''], ['Liang', 'Xiao', ''], ['Xu', 'Ke', '']]","['Link prediction', 'Sampling', 'Complex networks', 'Performanceevaluation']"
1474,1903.10251,Lars Ailo Bongo,"Cristina J\'acome, Johan Ravn, Einar Holsb{\o}, Juan Carlos
  Aviles-Solis, Hasse Melbye, Lars Ailo Bongo","Convolutional neural network for breathing phase detection in lung
  sounds",,,10.3390/s19081798,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We applied deep learning to create an algorithm for breathing phase detection
in lung sound recordings, and we compared the breathing phases detected by the
algorithm and manually annotated by two experienced lung sound researchers. Our
algorithm uses a convolutional neural network with spectrograms as the
features, removing the need to specify features explicitly. We trained and
evaluated the algorithm using three subsets that are larger than previously
seen in the literature. We evaluated the performance of the method using two
methods. First, discrete count of agreed breathing phases (using 50% overlap
between a pair of boxes), shows a mean agreement with lung sound experts of 97%
for inspiration and 87% for expiration. Second, the fraction of time of
agreement (in seconds) gives higher pseudo-kappa values for inspiration
(0.73-0.88) than expiration (0.63-0.84), showing an average sensitivity of 97%
and an average specificity of 84%. With both evaluation methods, the agreement
between the annotators and the algorithm shows human level performance for the
algorithm. The developed algorithm is valid for detecting breathing phases in
lung sound recordings.
","[{'version': 'v1', 'created': 'Mon, 25 Mar 2019 11:47:05 GMT'}]",2019-04-18,"[['Jácome', 'Cristina', ''], ['Ravn', 'Johan', ''], ['Holsbø', 'Einar', ''], ['Aviles-Solis', 'Juan Carlos', ''], ['Melbye', 'Hasse', ''], ['Bongo', 'Lars Ailo', '']]","['Respiratory phases', 'Breath onset', 'Breath detection', 'spectrograms', 'automated classification', 'deep learning']"
1475,1512.03523,Marian-Andrei Rizoiu,"Marian-Andrei Rizoiu, Lexing Xie, Tiberio Caetano, Manuel Cebrian",Evolution of Privacy Loss in Wikipedia,,,10.1145/2835776.2835798,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The cumulative effect of collective online participation has an important and
adverse impact on individual privacy. As an online system evolves over time,
new digital traces of individual behavior may uncover previously hidden
statistical links between an individual's past actions and her private traits.
To quantify this effect, we analyze the evolution of individual privacy loss by
studying the edit history of Wikipedia over 13 years, including more than
117,523 different users performing 188,805,088 edits. We trace each Wikipedia's
contributor using apparently harmless features, such as the number of edits
performed on predefined broad categories in a given time period (e.g.
Mathematics, Culture or Nature). We show that even at this unspecific level of
behavior description, it is possible to use off-the-shelf machine learning
algorithms to uncover usually undisclosed personal traits, such as gender,
religion or education. We provide empirical evidence that the prediction
accuracy for almost all private traits consistently improves over time.
Surprisingly, the prediction performance for users who stopped editing after a
given time still improves. The activities performed by new users seem to have
contributed more to this effect than additional activities from existing (but
still active) users. Insights from this work should help users, system
designers, and policy makers understand and make long-term design choices in
online content creation systems.
","[{'version': 'v1', 'created': 'Fri, 11 Dec 2015 05:08:20 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Dec 2015 04:37:30 GMT'}, {'version': 'v3', 'created': 'Thu, 17 Dec 2015 04:55:06 GMT'}]",2015-12-18,"[['Rizoiu', 'Marian-Andrei', ''], ['Xie', 'Lexing', ''], ['Caetano', 'Tiberio', ''], ['Cebrian', 'Manuel', '']]","['online privacy', 'de-anonymization', 'temporal lossof privacy']"
1476,1805.06267,Dominik Aumayr,"Dominik Aumayr, Stefan Marr, Cl\'ement B\'era, Elisa Gonzalez Boix,
  Hanspeter M\""ossenb\""ock",Efficient and Deterministic Record & Replay for Actor Languages,International Conference on Managed Languages & Runtimes (ManLang'18),,10.1145/3237009.3237015,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the ubiquity of parallel commodity hardware, developers turn to
high-level concurrency models such as the actor model to lower the complexity
of concurrent software. However, debugging concurrent software is hard,
especially for concurrency models with a limited set of supporting tools. Such
tools often deal only with the underlying threads and locks, which is at the
wrong abstraction level and may even introduce additional complexity. To
improve on this situation, we present a low-overhead record & replay approach
for actor languages. It allows one to debug concurrency issues
deterministically based on a previously recorded trace. Our evaluation shows
that the average run-time overhead for tracing on benchmarks from the Savina
suite is 10% (min. 0%, max. 20%). For Acme-Air, a modern web application, we
see a maximum increase of 1% in latency for HTTP requests and about 1.4 MB/s of
trace data. These results are a first step towards deterministic replay
debugging of actor systems in production.
","[{'version': 'v1', 'created': 'Wed, 16 May 2018 12:18:17 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Aug 2018 09:30:21 GMT'}]",2018-08-21,"[['Aumayr', 'Dominik', ''], ['Marr', 'Stefan', ''], ['Béra', 'Clément', ''], ['Boix', 'Elisa Gonzalez', ''], ['Mössenböck', 'Hanspeter', '']]","['Concurrency', 'Debugging', 'Determinism', 'Actors', 'Tracing', 'Replay']"
1477,1903.08504,Cl\'audio Rebelo De S\'a,"Cl\'audio Rebelo de S\'a and Paulo Azevedo and Carlos Soares and
  Al\'ipio M\'ario Jorge and Arno Knobbe","Preference rules for label ranking: Mining patterns in multi-target
  relations",,"Information Fusion, Volume 40, March 2018, Pages 112-125",10.1016/j.inffus.2017.07.001,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we investigate two variants of association rules for preference
data, Label Ranking Association Rules and Pairwise Association Rules. Label
Ranking Association Rules (LRAR) are the equivalent of Class Association Rules
(CAR) for the Label Ranking task. In CAR, the consequent is a single class, to
which the example is expected to belong to. In LRAR, the consequent is a
ranking of the labels. The generation of LRAR requires special support and
confidence measures to assess the similarity of rankings. In this work, we
carry out a sensitivity analysis of these similarity-based measures. We want to
understand which datasets benefit more from such measures and which parameters
have more influence in the accuracy of the model. Furthermore, we propose an
alternative type of rules, the Pairwise Association Rules (PAR), which are
defined as association rules with a set of pairwise preferences in the
consequent. While PAR can be used both as descriptive and predictive models,
they are essentially descriptive models. Experimental results show the
potential of both approaches.
","[{'version': 'v1', 'created': 'Wed, 20 Mar 2019 13:33:31 GMT'}]",2019-03-21,"[['de Sá', 'Cláudio Rebelo', ''], ['Azevedo', 'Paulo', ''], ['Soares', 'Carlos', ''], ['Jorge', 'Alípio Mário', ''], ['Knobbe', 'Arno', '']]","['Label Ranking', 'Association Rules', 'Pairwise Comparisons']"
1478,1805.05787,Wei Quan Lim,"Kunal Agrawal, Seth Gilbert, Wei Quan Lim",Parallel Working-Set Search Structures,Authors' version of a paper accepted to SPAA 2018,,10.1145/3210377.3210390,,cs.DS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present two versions of a parallel working-set map on p
processors that supports searches, insertions and deletions. In both versions,
the total work of all operations when the map has size at least p is bounded by
the working-set bound, i.e., the cost of an item depends on how recently it was
accessed (for some linearization): accessing an item in the map with recency r
takes O(1+log r) work. In the simpler version each map operation has O((log
p)^2+log n) span (where n is the maximum size of the map). In the pipelined
version each map operation on an item with recency r has O((log p)^2+log r)
span. (Operations in parallel may have overlapping span; span is additive only
for operations in sequence.)
  Both data structures are designed to be used by a dynamic multithreading
parallel program that at each step executes a unit-time instruction or makes a
data structure call. To achieve the stated bounds, the pipelined data structure
requires a weak-priority scheduler, which supports a limited form of 2-level
prioritization. At the end we explain how the results translate to practical
implementations using work-stealing schedulers.
  To the best of our knowledge, this is the first parallel implementation of a
self-adjusting search structure where the cost of an operation adapts to the
access sequence. A corollary of the working-set bound is that it achieves work
static optimality: the total work is bounded by the access costs in an optimal
static search tree.
","[{'version': 'v1', 'created': 'Tue, 15 May 2018 14:14:20 GMT'}, {'version': 'v2', 'created': 'Wed, 16 May 2018 17:17:06 GMT'}, {'version': 'v3', 'created': 'Wed, 11 Jul 2018 11:27:04 GMT'}]",2018-07-12,"[['Agrawal', 'Kunal', ''], ['Gilbert', 'Seth', ''], ['Lim', 'Wei Quan', '']]","['Data structures', 'parallel programs', 'dictionaries', 'comparison-based search', 'distribution-sensitive algorithms']"
1479,0911.1546,Sana Ullah,"Sana Ullah, Henry Higgins, M.Arif Siddiqui, and Kyung Sup Kwak",A Study of Implanted and Wearable Body Sensor Networks,"KES-AMSTA 08, LNAI 4953, pp. 464-473, Incheon, March 2008",,10.1007/978-3-540-78582-8_47,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advances in intelligent sensors, microelectronics and integrated
circuit, system-on-chip design and low power wireless communication introduced
the development of miniaturised and autonomous sensor nodes. These tiny sensor
nodes can be deployed to develop a proactive Body Sensor Network (BSN). The
rapid advancement in ultra low-power RF (radio frequency) technology enables
invasive and non-invasive devices to communicate with a remote station. This
communication revolutionizes healthcare system by enabling long term health
monitoring of a patient and providing real time feedback to the medical
experts. In this paper, we present In-body and On-body communication networks
with a special focus on the methodologies of wireless communication between
implanted medical devices with external monitoring equipment and recent
technological growth in both areas. We also discuss open issues and challenges
in a BSN.
","[{'version': 'v1', 'created': 'Sun, 8 Nov 2009 16:46:59 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Nov 2009 07:47:38 GMT'}, {'version': 'v3', 'created': 'Tue, 30 Oct 2018 01:22:08 GMT'}]",2018-10-31,"[['Ullah', 'Sana', ''], ['Higgins', 'Henry', ''], ['Siddiqui', 'M. Arif', ''], ['Kwak', 'Kyung Sup', '']]","['Body Sensor Network', 'Wireless Body Area Network', 'Implanted Communication', 'Wearable Computing']"
1480,1007.3629,Carlos A. Romero-Diaz,Mario Rodr\'iguez-Artalejo and Carlos A. Romero-D\'iaz,A Declarative Semantics for CLP with Qualification and Proximity,"17 pages, 26th Int'l. Conference on Logic Programming (ICLP'10)","Theory and Practice of Logic Programming, 26th Int'l. Conference
  on Logic Programming (ICLP'10) Special Issue, 10(4-6):627-642, 2010",10.1017/S1471068410000323,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Uncertainty in Logic Programming has been investigated during the last
decades, dealing with various extensions of the classical LP paradigm and
different applications. Existing proposals rely on different approaches, such
as clause annotations based on uncertain truth values, qualification values as
a generalization of uncertain truth values, and unification based on proximity
relations. On the other hand, the CLP scheme has established itself as a
powerful extension of LP that supports efficient computation over specialized
domains while keeping a clean declarative semantics. In this paper we propose a
new scheme SQCLP designed as an extension of CLP that supports qualification
values and proximity relations. We show that several previous proposals can be
viewed as particular cases of the new scheme, obtained by partial
instantiation. We present a declarative semantics for SQCLP that is based on
observables, providing fixpoint and proof-theoretical characterizations of
least program models as well as an implementation-independent notion of goal
solutions.
","[{'version': 'v1', 'created': 'Wed, 21 Jul 2010 12:25:10 GMT'}]",2010-07-22,"[['Rodríguez-Artalejo', 'Mario', ''], ['Romero-Díaz', 'Carlos A.', '']]","['Constraint Logic Programming', 'Qualification Domains and Values', 'Proximity Relations']"
1481,1810.11883,Huda Ibeid,"Huda Ibeid, Luke Olson, William Gropp","FFT, FMM, and Multigrid on the Road to Exascale: performance challenges
  and opportunities",,,10.1016/j.jpdc.2019.09.014,,cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  FFT, FMM, and multigrid methods are widely used fast and highly scalable
solvers for elliptic PDEs. However, emerging large-scale computing systems are
introducing challenges in comparison to current petascale computers. Recent
efforts (Dongarra et al. 2011) have identified several constraints in the
design of exascale software that includes massive concurrency, resilience
management, exploiting the high performance of heterogeneous systems, energy
efficiency, and utilizing the deeper and more complex memory hierarchy expected
at exascale. In this paper, we perform a model-based comparison of the FFT,
FMM, and multigrid methods in the context of these projected constraints. In
addition, we use performance models to offer predictions about the expected
performance on upcoming exascale system configurations based on current
technology trends.
","[{'version': 'v1', 'created': 'Sun, 28 Oct 2018 21:05:20 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Mar 2020 19:12:01 GMT'}]",2020-03-31,"[['Ibeid', 'Huda', ''], ['Olson', 'Luke', ''], ['Gropp', 'William', '']]","['Fast Fourier Transform', 'Fast Multipole Method', 'Multigrid', 'Exascale', 'Performance modeling']"
1482,1607.07535,Ming-Feng Ge,"Ming-Feng Ge, Zhi-Hong Guan, Chao Yang, Tao Li, Yan-Wu Wang","Time-varying formation tracking of multiple manipulators via distributed
  finite-time control",,"Neurocomputing, 2016, 202: 20-26",10.1016/j.neucom.2016.03.008,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Comparing with traditional fixed formation for a group of dynamical systems,
time-varying formation can produce the following benefits: i) covering the
greater part of complex environments; ii) collision avoidance. This paper
studies the time-varying formation tracking for multiple manipulator systems
(MMSs) under fixed and switching directed graphs with a dynamic leader, whose
acceleration cannot change too fast. An explicit mathematical formulation of
time-varying formation is developed based on the related practical
applications. A class of extended inverse dynamics control algorithms combining
with distributed sliding-mode estimators are developed to address the
aforementioned problem. By invoking finite-time stability arguments, several
novel criteria (including sufficient criteria, necessary and sufficient
criteria) for global finite-time stability of MMSs are established. Finally,
numerical experiments are presented to verify the effectiveness of the
theoretical results.
","[{'version': 'v1', 'created': 'Tue, 26 Jul 2016 04:23:57 GMT'}]",2016-07-27,"[['Ge', 'Ming-Feng', ''], ['Guan', 'Zhi-Hong', ''], ['Yang', 'Chao', ''], ['Li', 'Tao', ''], ['Wang', 'Yan-Wu', '']]","['time-varying formation tracking', 'dynamic leader', 'multiple manipulator systems (MMSs)', 'finite-time stability']"
1483,1508.00094,Anatoly Plotnikov D.,Anatoly D. Plotnikov,On a logical model of combinatorial problems,"8 pages, 2 figures",,10.4236/oalib.1101479,,cs.CC,http://creativecommons.org/publicdomain/zero/1.0/,"  The paper proposes a logical model of combinatorial problems, also it gives
an example of a problem of the class NP that can not be solved in polynomial
time on the dimension of the problem.
","[{'version': 'v1', 'created': 'Sat, 1 Aug 2015 07:38:22 GMT'}]",2016-03-02,"[['Plotnikov', 'Anatoly D.', '']]","['logical model', 'combinatorial problem', 'class P', 'class NP']"
1484,1611.07067,Stefan Wagner,Stefan Wagner,The Use of Application Scanners in Software Product Quality Assessment,"8 pages, 2 figures","Proceedings of the 8th international workshop on Software quality
  (WoSQ'11). ACM, 2011",10.1145/2024587.2024597,,cs.SE cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software development needs continuous quality control for a timely detection
and removal of quality problems. This includes frequent quality assessments,
which need to be automated as far as possible to be feasible. One way of
automation in assessing the security of software are application scanners that
test an executing software for vulnerabilities. At present, common quality
assessments do not integrate such scanners for giving an overall quality
statement. This paper presents an integration of application scanners into a
general quality assessment method based on explicit quality models and Bayesian
nets. Its applicability and the detection capabilities of common scanners are
investigated in a case study with two open-source web shops.
","[{'version': 'v1', 'created': 'Mon, 21 Nov 2016 21:28:21 GMT'}]",2016-11-28,"[['Wagner', 'Stefan', '']]","['Application scanner', 'quality assessment', 'Bayesian net', 'quality model']"
1485,1608.03126,EPTCS,"Xian Xu (East China University of Science and Technology, China)",Higher-order Processes with Parameterization over Names and Processes,"In Proceedings EXPRESS/SOS 2016, arXiv:1608.02692","EPTCS 222, 2016, pp. 15-29",10.4204/EPTCS.222.2,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parameterization extends higher-order processes with the capability of
abstraction and application (like those in lambda-calculus). This extension is
strict, i.e., higher-order processes equipped with parameterization is
computationally more powerful. This paper studies higher-order processes with
two kinds of parameterization: one on names and the other on processes
themselves. We present two results. One is that in presence of
parameterization, higher-order processes can encode first-order (name-passing)
processes in a quite neat fashion, in contrast to the fact that higher-order
processes without parameterization cannot encode first-order processes at all.
In the other result, we provide a simpler characterization of the (standard)
context bisimulation for higher-order processes with parameterization, in terms
of the normal bisimulation that stems from the well-known normal
characterization for higher-order calculus. These two results demonstrate more
essence of the parameterization method in the higher-order paradigm toward
expressiveness and behavioural equivalence.
","[{'version': 'v1', 'created': 'Wed, 10 Aug 2016 11:10:41 GMT'}]",2016-08-11,"[['Xu', 'Xian', '', 'East China University of Science and Technology, China']]","['Parameterization', 'Context bisimulation', 'Higher-order', 'First-order', 'Processes']"
1486,1003.5056,Sebastien Nedjar,"Sebastien Nedjar (LIF), Alain Casali (LIF), Rosine Cicchetti (LIF),
  Lotfi Lakhal (LIF)",Cubes convexes,,"Revue des Sciences et Technologies de l'Information (S\'erie
  Ing\'enierie des Syst\`emes d'Information) 11, 6 (2006) 11-31",10.3166/isi.11.6.11-31,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In various approaches, data cubes are pre-computed in order to answer
efficiently OLAP queries. The notion of data cube has been declined in various
ways: iceberg cubes, range cubes or differential cubes. In this paper, we
introduce the concept of convex cube which captures all the tuples of a
datacube satisfying a constraint combination. It can be represented in a very
compact way in order to optimize both computation time and required storage
space. The convex cube is not an additional structure appended to the list of
cube variants but we propose it as a unifying structure that we use to
characterize, in a simple, sound and homogeneous way, the other quoted types of
cubes. Finally, we introduce the concept of emerging cube which captures the
significant trend inversions. characterizations.
","[{'version': 'v1', 'created': 'Fri, 26 Mar 2010 07:46:33 GMT'}]",2010-04-08,"[['Nedjar', 'Sebastien', '', 'LIF'], ['Casali', 'Alain', '', 'LIF'], ['Cicchetti', 'Rosine', '', 'LIF'], ['Lakhal', 'Lotfi', '', 'LIF']]","['Multidimensional analysis', 'Datacubes', 'Convex cubes', 'Emergent Cubes', 'CubeTransversals']"
1487,1603.02853,Wolfgang Mulzer,"Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose, Stephane Durocher
  and Wolfgang Mulzer","A Time-Space Trade-off for Computing the k-Visibility Region of a Point
  in a Polygon","17 pages, 5 figures; a preliminary version appeared in WALCOM 2017;
  this revision fixes a mistake in the proof of Theorem 4.4 in the published
  version, the statement of the theorem remains unchanged",,10.1016/j.tcs.2018.06.017,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $P$ be a simple polygon with $n$ vertices, and let $q \in P$ be a point
in $P$. Let $k \in \{0, \dots, n - 1\}$. A point $p \in P$ is $k$-visible from
$q$ if and only if the line segment $pq$ crosses the boundary of $P$ at most
$k$ times. The $k$-visibility region of $q$ in $P$ is the set of all points
that are $k$-visible from $q$. We study the problem of computing the
$k$-visibility region in the limited workspace model, where the input resides
in a random-access read-only memory of $O(n)$ words, each with
$\Omega(\log{n})$ bits. The algorithm can read and write $O(s)$ additional
words of workspace, where $s \in \mathbb{N}$ is a parameter of the model. The
output is written to a write-only stream.
  Given a simple polygon $P$ with $n$ vertices and a point $q \in P$, we
present an algorithm that reports the $k$-visibility region of $q$ in $P$ in
$O(cn/s+c\log{s} + \min\{\lceil k/s \rceil n,n \log{\log_s{n}}\})$ expected
time using $O(s)$ words of workspace. Here, $c \in \{1, \dots, n\}$ is the
number of critical vertices of $P$ for $q$ where the $k$-visibility region of
$q$ may change. We generalize this result for polygons with holes and for sets
of non-crossing line segments.
","[{'version': 'v1', 'created': 'Wed, 9 Mar 2016 11:33:45 GMT'}, {'version': 'v2', 'created': 'Sat, 9 Jun 2018 09:53:17 GMT'}, {'version': 'v3', 'created': 'Tue, 13 Aug 2019 10:06:42 GMT'}]",2019-08-14,"[['Bahoo', 'Yeganeh', ''], ['Banyassady', 'Bahareh', ''], ['Bose', 'Prosenjit', ''], ['Durocher', 'Stephane', ''], ['Mulzer', 'Wolfgang', '']]","['Limited workspace model', 'k-visibility region', 'Time-space trade-off']"
1488,1901.10555,Otmane Azeroual,Otmane Azeroual and Horst Theel,"The Effects of Using Business Intelligence Systems on an Excellence
  Management and Decision-Making Process by Start-Up Companies: A Case Study","4(3), pp.30-40","International Journal of Management Science and Business
  Administration, Inovatus Usluge Ltd., 2018",10.18775/ijmsba.1849-5664-5419.2014.43.1004,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The rapid increase in data volumes in companies has meant that momentous and
comprehensive information gathering is barely possible by manual means.
Business intelligence solutions can help here. They provide tools with
appropriate technologies to assist with the collection, integration, storage,
editing, and analysis of existing data. While almost only large companies were
interested in this topic a few years ago, it has meanwhile also become
necessary for start-up companies, and so the market for business intelligence
has been growing for years. This article focuses on the general potentials of
using BI in start-ups. First, will be examined which providers of BI solutions
that are suitable for start-ups and what opportunities exist for implementing
BI systems in start-ups. Then it will be shown to what extent BI has prevailed
in start-ups, in which areas the techniques of BI are used in start-ups and
what purpose BI has in start-ups. Finally, the success factors for BI projects
in start-ups are considered.
","[{'version': 'v1', 'created': 'Fri, 18 Jan 2019 13:16:54 GMT'}]",2019-01-31,"[['Azeroual', 'Otmane', ''], ['Theel', 'Horst', '']]","['Business Intelligence', 'BI', 'BI-Projects', 'BI-Providers', 'Market-Analysis', 'Decision-Making', 'Start-Ups  1']"
1489,2105.04170,Hande Dong,"Jiawei Chen, Hande Dong, Yang Qiu, Xiangnan He, Xin Xin, Liang Chen,
  Guli Lin, Keping Yang",AutoDebias: Learning to Debias for Recommendation,Accepted by SIGIR 2021,,10.1145/3404835.3462919,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender systems rely on user behavior data like ratings and clicks to
build personalization model. However, the collected data is observational
rather than experimental, causing various biases in the data which
significantly affect the learned model. Most existing work for recommendation
debiasing, such as the inverse propensity scoring and imputation approaches,
focuses on one or two specific biases, lacking the universal capacity that can
account for mixed or even unknown biases in the data. Towards this research
gap, we first analyze the origin of biases from the perspective of \textit{risk
discrepancy} that represents the difference between the expectation empirical
risk and the true risk. Remarkably, we derive a general learning framework that
well summarizes most existing debiasing strategies by specifying some
parameters of the general framework. This provides a valuable opportunity to
develop a universal solution for debiasing, e.g., by learning the debiasing
parameters from data. However, the training data lacks important signal of how
the data is biased and what the unbiased data looks like. To move this idea
forward, we propose \textit{AotoDebias} that leverages another (small) set of
uniform data to optimize the debiasing parameters by solving the bi-level
optimization problem with meta-learning. Through theoretical analyses, we
derive the generalization bound for AutoDebias and prove its ability to acquire
the appropriate debiasing strategy. Extensive experiments on two real datasets
and a simulated dataset demonstrated effectiveness of AutoDebias. The code is
available at \url{https://github.com/DongHande/AutoDebias}.
","[{'version': 'v1', 'created': 'Mon, 10 May 2021 08:03:48 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Jul 2021 07:46:00 GMT'}, {'version': 'v3', 'created': 'Thu, 15 Jul 2021 07:35:19 GMT'}, {'version': 'v4', 'created': 'Wed, 8 Sep 2021 08:35:39 GMT'}, {'version': 'v5', 'created': 'Thu, 28 Oct 2021 04:12:51 GMT'}]",2021-10-29,"[['Chen', 'Jiawei', ''], ['Dong', 'Hande', ''], ['Qiu', 'Yang', ''], ['He', 'Xiangnan', ''], ['Xin', 'Xin', ''], ['Chen', 'Liang', ''], ['Lin', 'Guli', ''], ['Yang', 'Keping', '']]","['Recommendation', 'Bias', 'Debias', 'Meta-learning']"
1490,1001.3673,John Whitbeck,"John Whitbeck, Marcelo Dias de Amorim, Vania Conan",Plausible Mobility: Inferring Movement from Contacts,"8 pages, 8 figures, 1 table","In Proceedings: ACM Workshop on Mobile Opportunistic Networking
  (Mobiopp 2010) - Pisa, Italy - February 2010",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the difficult question of inferring plausible node mobility based
only on information from wireless contact traces. Working with mobility
information allows richer protocol simulations, particularly in dense networks,
but requires complex set-ups to measure, whereas contact information is easier
to measure but only allows for simplistic simulation models. In a contact trace
a lot of node movement information is irretrievably lost so the original
positions and velocities are in general out of reach. We propose a fast
heuristic algorithm, inspired by dynamic force-based graph drawing, capable of
inferring a plausible movement from any contact trace, and evaluate it on both
synthetic and real-life contact traces. Our results reveal that (i) the quality
of the inferred mobility is directly linked to the precision of the measured
contact trace, and (ii) the simple addition of appropriate anticipation forces
between nodes leads to an accurate inferred mobility.
","[{'version': 'v1', 'created': 'Wed, 20 Jan 2010 21:06:33 GMT'}]",2010-01-22,"[['Whitbeck', 'John', ''], ['de Amorim', 'Marcelo Dias', ''], ['Conan', 'Vania', '']]","['Delay Tolerant Networks', 'Graph Animation', 'Movement Inference']"
1491,1406.0117,Kerstin Eder,"Hayden Field, Glen Anderson, Kerstin Eder","EACOF: A Framework for Providing Energy Transparency to enable
  Energy-Aware Software Development",,,10.1145/2554850.2554920,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Making energy consumption data accessible to software developers is an
essential step towards energy efficient software engineering. The presence of
various different, bespoke and incompatible, methods of instrumentation to
obtain energy readings is currently limiting the widespread use of energy data
in software development. This paper presents EACOF, a modular Energy-Aware
Computing Framework that provides a layer of abstraction between sources of
energy data and the applications that exploit them. EACOF replaces platform
specific instrumentation through two APIs - one accepts input to the framework
while the other provides access to application software. This allows developers
to profile their code for energy consumption in an easy and portable manner
using simple API calls. We outline the design of our framework and provide
details of the API functionality. In a use case, where we investigate the
impact of data bit width on the energy consumption of various sorting
algorithms, we demonstrate that the data obtained using EACOF provides
interesting, sometimes counter-intuitive, insights. All the code is available
online under an open source license. http://github.com/eacof
","[{'version': 'v1', 'created': 'Sat, 31 May 2014 22:55:09 GMT'}]",2021-01-14,"[['Field', 'Hayden', ''], ['Anderson', 'Glen', ''], ['Eder', 'Kerstin', '']]","['Abstraction', 'EACOF', 'Energy Aware Computing', 'Energy Profiling', 'Energy Transparency']"
1492,1707.03865,Joseph Osborn,"Adam Summerville, Joseph C. Osborn, Christoffer Holmg{\aa}rd, Daniel
  W. Zhang",Mechanics Automatically Recognized via Interactive Observation: Jumping,"10 pages, 12 figures. Accepted at Foundations of Digital Games 2017",,10.1145/3102071.3102104,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Jumping has been an important mechanic since its introduction in Donkey Kong.
It has taken a variety of forms and shown up in numerous games, with each jump
having a different feel. In this paper, we use a modified Nintendo
Entertainment System (NES) emulator to semi-automatically run experiments on a
large subset (30%) of NES platform games. We use these experiments to build
models of jumps from different developers, series, and games across the history
of the console. We then examine these models to gain insights into different
forms of jumping and their associated feel.
","[{'version': 'v1', 'created': 'Wed, 12 Jul 2017 18:49:15 GMT'}]",2017-07-14,"[['Summerville', 'Adam', ''], ['Osborn', 'Joseph C.', ''], ['Holmgård', 'Christoffer', ''], ['Zhang', 'Daniel W.', '']]","['Emulator', 'Game Design', 'Platformers', 'Jumping', 'Regression', 'Clustering']"
1493,1609.02839,Richard Oentaryo,"Jovian Lin, Richard Oentaryo, Ee-Peng Lim, Casey Vu, Adrian Vu, Agus
  Kwee","Where is the Goldmine? Finding Promising Business Locations through
  Facebook Data Analytics",,"Proceedings of the ACM Conference on Hypertext and Social Media,
  Halifax, Canada, 2016, pp. 93-102",10.1145/2914586.2914588,,cs.SI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  If you were to open your own cafe, would you not want to effortlessly
identify the most suitable location to set up your shop? Choosing an optimal
physical location is a critical decision for numerous businesses, as many
factors contribute to the final choice of the location. In this paper, we seek
to address the issue by investigating the use of publicly available Facebook
Pages data---which include user check-ins, types of business, and business
locations---to evaluate a user-selected physical location with respect to a
type of business. Using a dataset of 20,877 food businesses in Singapore, we
conduct analysis of several key factors including business categories,
locations, and neighboring businesses. From these factors, we extract a set of
relevant features and develop a robust predictive model to estimate the
popularity of a business location. Our experiments have shown that the
popularity of neighboring business contributes the key features to perform
accurate prediction. We finally illustrate the practical usage of our proposed
approach via an interactive web application system.
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2016 15:48:50 GMT'}]",2016-09-12,"[['Lin', 'Jovian', ''], ['Oentaryo', 'Richard', ''], ['Lim', 'Ee-Peng', ''], ['Vu', 'Casey', ''], ['Vu', 'Adrian', ''], ['Kwee', 'Agus', '']]","['Location analytics', 'Facebook', 'feature extraction', 'machine learning']"
1494,1803.06178,Krzysztof Rzadca,"Milosz Pacholczyk, Krzysztof Rzadca",Fair non-monetary scheduling in federated clouds,"Accepted to CrossCloud'18: 5th Workshop on CrossCloud Infrastructures
  & Platforms",,10.1145/3195870.3195873,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a hybrid cloud, individual cloud service providers (CSPs) often have
incentive to use each other's resources to off-load peak loads or place load
closer to the end user. However, CSPs have to keep track of contributions and
gains in order to disincentivize long-term free-riding. We show CloudShare, a
distributed version of a load balancing algorithm DirectCloud based on the
Shapley value---a powerful fairness concept from game theory. CloudShare
coordinates CSPs by a ZooKeeper-based coordination layer; each CSP runs a
broker that interacts with local resources (such as Kubernetes-managed
clusters). We quantitatively evaluate our implementation by simulation. The
results confirm that CloudShare generates on the average more fair schedules
than the popular FairShare algorithm. We believe our results show an viable
alternative to monetary methods based on, e.g., spot markets.
","[{'version': 'v1', 'created': 'Fri, 16 Mar 2018 11:45:27 GMT'}]",2018-03-19,"[['Pacholczyk', 'Milosz', ''], ['Rzadca', 'Krzysztof', '']]","['scheduling', 'distributed', 'fairness', 'Shapley value', 'cooperativegame theory', 'ZooKeeper', 'Kubernetes']"
1495,1607.00590,Naima Kaabouch,"Sriram Subramaniam, Hector Reyes and Naima Kaabouch","Spectrum Occupancy Measurement: An Autocorrelation based Scanning
  Technique using USRP","5 pages, IEEE Wireless and Microwave Technology Conference (WAMICON),
  2015",,10.1109/WAMICON.2015.7120376,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a technique for scanning and evaluating the radio
spectrum use. This technique determines the average occupancy of a channel over
a specific duration. The technique was implemented using Software Defined Radio
units and GNU Radio software. The survey was conducted in Grand Forks, North
Dakota, over a frequency range of 824 MHz to 5.8 GHz. The results of this
technique were compared to those of two existing techniques, energy detection
and autocorrelation, that were also implemented. The results show that the
proposed technique is more efficient at scanning the radio spectrum than the
other two techniques.
","[{'version': 'v1', 'created': 'Sun, 3 Jul 2016 04:50:18 GMT'}]",2016-11-18,"[['Subramaniam', 'Sriram', ''], ['Reyes', 'Hector', ''], ['Kaabouch', 'Naima', '']]","['Cognitive Radio', 'Wireless Networks', 'Spectrum']"
1496,1908.00003,Matthias Miller,"Matthias Miller, Alexandra Bonnici, Mennatallah El-Assady",Augmenting Music Sheets with Harmonic Fingerprints,(9+1) pages; 5 figures; User Study,,10.1145/3342558.3345395,,cs.HC cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Conventional Music Notation (CMN) is the well-established foundation for the
written communication of musical information, such as rhythm, harmony, or
timbre. However, CMN suffers from the complexity of its visual encoding and the
need for extensive training to acquire proficiency and legibility. While
alternative notations using additional visual variables (such as color to
improve pitch identification) have been proposed, the music community does not
readily accept notation systems that vary widely from the CMN. Therefore, to
support student musicians in understanding the harmonic relationship of notes,
instead of replacing the CMN, we present a visualization technique that
augments a digital music sheet with a harmonic fingerprint glyph. Our design
exploits the circle of fifths - a fundamental concept in music theory, as a
visual metaphor. By attaching these visual glyphs to each bar of a selected
composition we provide additional information about the salient harmonic
features available in a musical piece. We conducted a user study to analyze the
performance of experts and non-experts in an identification and comparison task
of recurring patterns. The evaluation shows that the harmonic fingerprint
supports these tasks without the need for close-reading, as when compared to a
not-annotated music sheet.
","[{'version': 'v1', 'created': 'Wed, 31 Jul 2019 08:17:43 GMT'}]",2019-08-02,"[['Miller', 'Matthias', ''], ['Bonnici', 'Alexandra', ''], ['El-Assady', 'Mennatallah', '']]","['Visualization', 'Harmony', 'Analysis', 'Sheet Music']"
1497,0911.1318,Loet Leydesdorff,"Leo Egghe, Loet Leydesdorff","The relation between Pearson's correlation coefficient r and Salton's
  cosine measure",,"Journal of the American Society for Information Science and
  Technology 60(5) (2009) 1027-1036",10.1016/j.eswa.2012.07.016,,cs.IR stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The relation between Pearson's correlation coefficient and Salton's cosine
measure is revealed based on the different possible values of the division of
the L1-norm and the L2-norm of a vector. These different values yield a sheaf
of increasingly straight lines which form together a cloud of points, being the
investigated relation. The theoretical results are tested against the author
co-citation relations among 24 informetricians for whom two matrices can be
constructed, based on co-citations: the asymmetric occurrence matrix and the
symmetric co-citation matrix. Both examples completely confirm the theoretical
results. The results enable us to specify an algorithm which provides a
threshold value for the cosine above which none of the corresponding Pearson
correlations would be negative. Using this threshold value can be expected to
optimize the visualization of the vector space.
","[{'version': 'v1', 'created': 'Fri, 6 Nov 2009 18:09:07 GMT'}]",2012-07-25,"[['Egghe', 'Leo', ''], ['Leydesdorff', 'Loet', '']]","['Pearson', 'correlation coefficient', 'Salton', 'cosine', 'non-functional relation', 'threshold']"
1498,1803.04858,Jimmy Wu,"Jimmy Wu, Diondra Peck, Scott Hsieh, Vandana Dialani, Constance D.
  Lehman, Bolei Zhou, Vasilis Syrgkanis, Lester Mackey, and Genevieve Patterson","Expert identification of visual primitives used by CNNs during mammogram
  classification",,"Medical Imaging 2018: Computer-Aided Diagnosis, Proc. of SPIE Vol.
  10575, 105752T",10.1117/12.2293890,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work interprets the internal representations of deep neural networks
trained for classification of diseased tissue in 2D mammograms. We propose an
expert-in-the-loop interpretation method to label the behavior of internal
units in convolutional neural networks (CNNs). Expert radiologists identify
that the visual patterns detected by the units are correlated with meaningful
medical phenomena such as mass tissue and calcificated vessels. We demonstrate
that several trained CNN models are able to produce explanatory descriptions to
support the final classification decisions. We view this as an important first
step toward interpreting the internal representations of medical classification
CNNs and explaining their predictions.
","[{'version': 'v1', 'created': 'Tue, 13 Mar 2018 14:54:38 GMT'}]",2018-03-14,"[['Wu', 'Jimmy', ''], ['Peck', 'Diondra', ''], ['Hsieh', 'Scott', ''], ['Dialani', 'Vandana', ''], ['Lehman', 'Constance D.', ''], ['Zhou', 'Bolei', ''], ['Syrgkanis', 'Vasilis', ''], ['Mackey', 'Lester', ''], ['Patterson', 'Genevieve', '']]","['medical image understanding', 'deep learning for diagnosis', 'interpretable machine learning', 'expert-in-the-loop methods']"
1499,1805.08564,Ihab Mohamed,"Ihab S. Mohamed, Alessio Capitanelli, Fulvio Mastrogiovanni, Stefano
  Rovetta, Renato Zaccaria",A 2D laser rangefinder scans dataset of standard EUR pallets,"This paper has been accepted to be published in ""Data in Brief
  (DiB)"". 10 pages, 4 figures, and 2 tables",,10.1016/j.dib.2019.103837,,cs.RO cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the past few years, the technology of automated guided vehicles (AGVs) has
notably advanced. In particular, in the context of factory and warehouse
automation, different approaches have been presented for detecting and
localizing pallets inside warehouses and shop-floor environments. In a related
research paper [1], we show that an AGVs can detect, localize, and track
pallets using machine learning techniques based only on the data of an on-board
2D laser rangefinder. Such sensor is very common in industrial scenarios due to
its simplicity and robustness, but it can only provide a limited amount of
data. Therefore, it has been neglected in the past in favor of more complex
solutions. In this paper, we release to the community the data we collected in
[1] for further research activities in the field of pallet localization and
tracking. The dataset comprises a collection of 565 2D scans from real-world
environments, which are divided into 340 samples where pallets are present, and
225 samples where they are not. The data have been manually labelled and are
provided in different formats.
","[{'version': 'v1', 'created': 'Tue, 22 May 2018 13:16:54 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Mar 2019 21:48:59 GMT'}]",2020-04-24,"[['Mohamed', 'Ihab S.', ''], ['Capitanelli', 'Alessio', ''], ['Mastrogiovanni', 'Fulvio', ''], ['Rovetta', 'Stefano', ''], ['Zaccaria', 'Renato', '']]","['2D Laser Rangefinder', 'Object Detection', 'Robotics', 'Automated Guided Vehicle']"
1500,1907.01620,Konstantinos Michmizos,"Guangzhi Tang, Ioannis E. Polykretis, Vladimir A. Ivanov, Arpit Shah,
  Konstantinos P. Michmizos","Introducing Astrocytes on a Neuromorphic Processor: Synchronization,
  Local Plasticity and Edge of Chaos","9 pages, 7 figures","ACM Proceeding NICE '19 Proceedings of the 7th Annual
  Neuro-inspired Computational Elements Workshop, 2019",10.1145/3320288.3320302,,cs.NE q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While there is still a lot to learn about astrocytes and their
neuromodulatory role in the spatial and temporal integration of neuronal
activity, their introduction to neuromorphic hardware is timely, facilitating
their computational exploration in basic science questions as well as their
exploitation in real-world applications. Here, we present an astrocytic module
that enables the development of a spiking Neuronal-Astrocytic Network (SNAN)
into Intel's Loihi neuromorphic chip. The basis of the Loihi module is an
end-to-end biophysically plausible compartmental model of an astrocyte that
simulates the intracellular activity in response to the synaptic activity in
space and time. To demonstrate the functional role of astrocytes in SNAN, we
describe how an astrocyte may sense and induce activity-dependent neuronal
synchronization, switch on and off spike-time-dependent plasticity (STDP) to
introduce single-shot learning, and monitor the transition between ordered and
chaotic activity at the synaptic space. Our module may serve as an extension
for neuromorphic hardware, by either replicating or exploring the distinct
computational roles that astrocytes have in forming biological intelligence.
","[{'version': 'v1', 'created': 'Tue, 2 Jul 2019 20:19:25 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Sep 2019 16:19:01 GMT'}]",2019-09-20,"[['Tang', 'Guangzhi', ''], ['Polykretis', 'Ioannis E.', ''], ['Ivanov', 'Vladimir A.', ''], ['Shah', 'Arpit', ''], ['Michmizos', 'Konstantinos P.', '']]","['Neuromorphic Computing', 'Astrocyte', 'Spiking Neuronal-AstrocyticNetwork']"
1501,0911.3492,Britta Dorn,"Nadja Betzler, Britta Dorn","Towards a Dichotomy for the Possible Winner Problem in Elections Based
  on Scoring Rules","minor changes and updates; accepted for publication in JCSS, online
  version available.",,10.1016/j.jcss.2010.04.002,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To make a joint decision, agents (or voters) are often required to provide
their preferences as linear orders. To determine a winner, the given linear
orders can be aggregated according to a voting protocol. However, in realistic
settings, the voters may often only provide partial orders. This directly leads
to the Possible Winner problem that asks, given a set of partial votes, whether
a distinguished candidate can still become a winner. In this work, we consider
the computational complexity of Possible Winner for the broad class of voting
protocols defined by scoring rules. A scoring rule provides a score value for
every position which a candidate can have in a linear order. Prominent examples
include plurality, k-approval, and Borda. Generalizing previous NP-hardness
results for some special cases, we settle the computational complexity for all
but one scoring rule. More precisely, for an unbounded number of candidates and
unweighted voters, we show that Possible Winner is NP-complete for all pure
scoring rules except plurality, veto, and the scoring rule defined by the
scoring vector (2,1,...,1,0), while it is solvable in polynomial time for
plurality and veto.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2009 10:02:39 GMT'}, {'version': 'v2', 'created': 'Fri, 30 Apr 2010 11:36:55 GMT'}]",2010-05-03,"[['Betzler', 'Nadja', ''], ['Dorn', 'Britta', '']]","['Voting systems', 'NP-hardness', 'k-approval', 'partial votes', 'incompleteinformation']"
1502,1704.08233,Marek Szyku{\l}a,"Mikhail V. Berlinkov, Robert Ferens, Marek Szyku{\l}a",Preimage problems for deterministic finite automata,,"Journal of Computer and System Sciences, 115:214--234, 2021",10.1016/j.jcss.2020.08.002,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a subset of states $S$ of a deterministic finite automaton and a word
$w$, the preimage is the subset of all states mapped to a state in $S$ by the
action of $w$. We study three natural problems concerning words giving certain
preimages. The first problem is whether, for a given subset, there exists a
word \emph{extending} the subset (giving a larger preimage). The second problem
is whether there exists a \emph{totally extending} word (giving the whole set
of states as a preimage)---equivalently, whether there exists an
\emph{avoiding} word for the complementary subset. The third problem is whether
there exists a \emph{resizing} word. We also consider variants where the length
of the word is upper bounded, where the size of the given subset is restricted,
and where the automaton is strongly connected, synchronizing, or binary. We
conclude with a summary of the complexities in all combinations of the cases.
","[{'version': 'v1', 'created': 'Wed, 26 Apr 2017 17:38:20 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Apr 2018 09:26:56 GMT'}, {'version': 'v3', 'created': 'Mon, 2 Jul 2018 19:42:25 GMT'}, {'version': 'v4', 'created': 'Sat, 19 Sep 2020 12:16:40 GMT'}]",2020-09-22,"[['Berlinkov', 'Mikhail V.', ''], ['Ferens', 'Robert', ''], ['Szykuła', 'Marek', '']]","['avoiding word', 'extending word', 'extensible subset', 'reset word', 'synchronizing automaton']"
1503,2105.10366,Maria Korozi,"Asterios Leonidis, Maria Korozi, Vassilis Kouroumalis, Emmanouil
  Adamakis, Dimitris Milathianakis and Constantine Stephanidis","Going Beyond Second Screens: Applications for the Multi-display
  Intelligent Living Room",,,10.1145/3452918.3465486,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work aims to investigate how the amenities offered by Intelligent
Environments can be used to shape new types of useful, exciting and fulfilling
experiences while watching sports or movies. Towards this direction, two
ambient media players were developed aspiring to offer live access to secondary
information via the available displays of an Intelligent Living Room, and to
appropriately exploit the technological equipment so as to support natural
interaction. Expert-based evaluation experiments revealed some factors that can
influence the overall experience significantly, without hindering the viewers'
immersion to the main media.
","[{'version': 'v1', 'created': 'Fri, 21 May 2021 14:07:57 GMT'}]",2021-05-24,"[['Leonidis', 'Asterios', ''], ['Korozi', 'Maria', ''], ['Kouroumalis', 'Vassilis', ''], ['Adamakis', 'Emmanouil', ''], ['Milathianakis', 'Dimitris', ''], ['Stephanidis', 'Constantine', '']]","['Intelligent Living Room', 'Second Screens', 'Sports', 'Movies', 'Ambient Media Player']"
1504,1303.0377,Saswata Shannigrahi,"Gunjan Kumar, Saswata Shannigrahi",New Online Algorithm for Dynamic Speed Scaling with Sleep State,13 pages,,10.1016/j.tcs.2015.05.045,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider an energy-efficient scheduling problem where $n$
jobs $J_1, J_2, ..., J_n$ need to be executed such that the total energy usage
of these jobs is minimized while ensuring that each job is finished within it's
deadline. We work in an online setting where a job is known only at it's
arrival time, along with it's processing volume and deadline. In such a
setting, the currently best-known algorithm by Han et al. \cite{han} provides a
competitive ratio max $\{4, 2 + {\alpha}^{\alpha}\}$ of energy usage. In this
paper, we present a new online algorithm SqOA which provides a competitive
ratio max $\{4, 2 + (2-1/{\alpha})^\alpha 2^{\alpha-1}\}$ of energy usage. For
$\alpha \geq 3$, the competitive ratio of our algorithm is better than that of
any other existing algorithms for this problem.
","[{'version': 'v1', 'created': 'Sat, 2 Mar 2013 11:38:17 GMT'}]",2015-07-13,"[['Kumar', 'Gunjan', ''], ['Shannigrahi', 'Saswata', '']]","['Energy efficient algorithm', 'online algorithm', 'scheduling algorithm']"
1505,1808.10639,"Ma\""elick Claes","Ma\""elick Claes, Mika M\""antyl\""a, Umar Farooq",On the Use of Emoticons in Open Source Software Development,"Short paper to be presented at the 12th International Symposium on
  Empirical Software Engineering and Measurement (ESEM)",,10.1145/3239235.3267434,,cs.SE cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Using sentiment analysis to study software developers' behavior
comes with challenges such as the presence of a large amount of technical
discussion unlikely to express any positive or negative sentiment. However,
emoticons provide information about developer sentiments that can easily be
extracted from software repositories. Aim: We investigate how software
developers use emoticons differently in issue trackers in order to better
understand the differences between developers and determine to which extent
emoticons can be used as in place of sentiment analysis. Method: We extract
emoticons from 1.3M comments from Apache's issue tracker and 4.5M from
Mozilla's issue tracker using regular expressions built from a list of
emoticons used by SentiStrength and Wikipedia. We check for statistical
differences using Mann-Whitney U tests and determine the effect size with
Cliff's delta. Results: Overall Mozilla developers rely more on emoticons than
Apache developers. While the overall ratio of comments with emoticons is of 2%
and 3.6% for Apache and Mozilla, some individual developers can have a ratio
above 20%. Looking specifically at Mozilla developers, we find that western
developers use significantly more emoticons (with large size effect) than
eastern developers. While the majority of emoticons are used to express joy, we
find that Mozilla developers use emoticons more frequently to express sadness
and surprise than Apache developers. Finally, we find that developers use
overall more emoticons during weekends than during weekdays, with the share of
sad and surprised emoticons increasing during weekends. Conclusions: While
emoticons are primarily used to express joy, the more occasional use of sad and
surprised emoticons can potentially be utilized to detect frustration in place
of sentiment analysis among developers using emoticons frequently enough.
","[{'version': 'v1', 'created': 'Fri, 31 Aug 2018 09:09:34 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Oct 2018 14:10:08 GMT'}]",2018-10-10,"[['Claes', 'Maëlick', ''], ['Mäntylä', 'Mika', ''], ['Farooq', 'Umar', '']]","['Emoticons', 'Sentiment Analysis', 'Repository Mining', 'Emoticon Usage', 'Emotions', 'Open Source Software Development']"
1506,1507.08398,Frederic Le Mouel,"Baptiste Maingret (CITI), Fr\'ed\'eric Le Mou\""el (CITI), Julien Ponge
  (CITI), Nicolas Stouls (CITI), Jian Cao (CSE), Yannick Loiseau (LIMOS)","Towards a Decoupled Context-Oriented Programming Language for the
  Internet of Things",,"ACM. 7th International Workshop on Context-Oriented Programming
  (COP'2015) in conjunction with the European Conference on Object-Oriented
  Programming (ECOOP'2015), Jul 2015, Prague, Czech Republic. pp.6, 2015",10.1145/2786545.2786552,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Easily programming behaviors is one major issue of a large and reconfigurable
deployment in the Internet of Things. Such kind of devices often requires to
externalize part of their behavior such as the sensing, the data aggregation or
the code offloading. Most existing context-oriented programming languages
integrate in the same class or close layers the whole behavior. We propose to
abstract and separate the context tracking from the decision process, and to
use event-based handlers to interconnect them. We keep a very easy declarative
and non-layered programming model. We illustrate by defining an extension to
Golo-a JVM-based dynamic language.
","[{'version': 'v1', 'created': 'Thu, 30 Jul 2015 06:54:25 GMT'}]",2015-07-31,"[['Maingret', 'Baptiste', '', 'CITI'], ['Mouël', 'Frédéric Le', '', 'CITI'], ['Ponge', 'Julien', '', 'CITI'], ['Stouls', 'Nicolas', '', 'CITI'], ['Cao', 'Jian', '', 'CSE'], ['Loiseau', 'Yannick', '', 'LIMOS']]","['Programming Language', 'Context-Oriented Programming', 'Decoupled Architecture', 'Event-Based Handling', 'JVM', 'Golo']"
1507,1911.08372,Guillermo de Bernardo,"Nieves R. Brisaboa, Ana Cerdeira-Pena, Guillermo de Bernardo, Gonzalo
  Navarro",Improved Compressed String Dictionaries,"This research has received funding from the European Union's Horizon
  2020 research and innovation programme under the Marie Sklodowska-Curie
  Actions H2020-MSCA-RISE-2015 BIRDS GA No. 690941","Proc. 28th ACM International Conference on Information and
  Knowledge Management (CIKM 2019)",10.1145/3357384.3357972,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a new family of compressed data structures to efficiently store
and query large string dictionaries in main memory. Our main technique is a
combination of hierarchical Front-coding with ideas from longest-common-prefix
computation in suffix arrays. Our data structures yield relevant space-time
tradeoffs in real-world dictionaries. We focus on two domains where string
dictionaries are extensively used and efficient compression is required: URL
collections, a key element in Web graphs and applications such as Web mining;
and collections of URIs and literals, the basic components of RDF datasets. Our
experiments show that our data structures achieve better compression than the
state-of-the-art alternatives while providing very competitive query times.
","[{'version': 'v1', 'created': 'Tue, 19 Nov 2019 16:07:49 GMT'}]",2019-11-20,"[['Brisaboa', 'Nieves R.', ''], ['Cerdeira-Pena', 'Ana', ''], ['de Bernardo', 'Guillermo', ''], ['Navarro', 'Gonzalo', '']]","['compression', 'data structures', 'string dictionaries']"
1508,1805.10310,Torgeir Dings{\o}yr,"Torgeir Dings{\o}yr, Marius Mikalsen, Anniken Solem, and Kathrine
  Vestues","Learning in the Large - An Exploratory Study of Retrospectives in
  Large-Scale Agile Development","Post-print of short-paper presented at XP2018, Agile Processes in
  Software Engineering and Extreme Programming. XP 2018","[1] Dings{\o}yr, T., Mikalsen, M., Solem, A., and Vestues, K.,
  ""Learning in the Large - An Exploratory Study of Retrospectives in
  Large-Scale Agile Development,"" in XP2018, Porto, Portugal, 2018",10.1007/978-3-319-91602-6_13,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Many see retrospectives as the most important practice of agile software
development. Previous studies of retrospectives have focused on pro- cess and
outcome at team level. In this article, we study how a large-scale agile
development project uses retrospectives through an analysis of retrospective
reports identifying a total of 109 issues and 36 action items as a part of a
longitudinal case study. We find that most of the issues identified relate to
team-level learning and improvement, and discuss these findings in relation to
current advice to improve learning outcome in large-scale agile development.
","[{'version': 'v1', 'created': 'Fri, 25 May 2018 18:18:26 GMT'}]",2018-11-30,"[['Dingsøyr', 'Torgeir', ''], ['Mikalsen', 'Marius', ''], ['Solem', 'Anniken', ''], ['Vestues', 'Kathrine', '']]","['agile software development', 'software engineering', 'teamwork', 'team performance', 'post mortem review', 'reflection', 'learning', 'process improvement']"
1509,1510.04825,Mira Sarkis,"Mira Sarkis (LTCI), Cyril Concolato (LTCI), Jean-Claude Dufourd (LTCI)",MSoS: A Multi-Screen-Oriented Web Page Segmentation Approach,"DocEng'14: ACM Symposium on Document Engineering, ACM, 2015",,10.1145/2682571.2797090,,cs.HC cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we describe a multiscreen-oriented approach for segmenting web
pages. The segmentation is an automatic and hybrid visual and structural
method. It aims at creating coherent blocks which have different functions
determined by the multiscreen environment. It is also characterized by a
dynamic adaptation to the page content. Experiments are conducted on a set of
existing applications that contain multimedia elements, in particular YouTube
and video player pages. Results are compared with one seg-mentation method from
the literature and with a ground truth manually created. With a 75% precision,
the MSoS is a promising method that is capable of producing good segmentation
results.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2015 09:43:12 GMT'}]",2015-10-19,"[['Sarkis', 'Mira', '', 'LTCI'], ['Concolato', 'Cyril', '', 'LTCI'], ['Dufourd', 'Jean-Claude', '', 'LTCI']]","['Web Application', 'Page Segmentation', 'Automatic Processing', 'Application Distribution', 'Multiscreen']"
1510,0803.3192,Denis Pallez,"Denis Pallez (LIRIS), Philippe Collard (I3S), Thierry Baccino (LPEQ),
  Laurent Dumercy (LPEQ)","Eye-Tracking Evolutionary Algorithm to minimize user's fatigue in IEC
  applied to Interactive One-Max problem",,"Dans Proceedings of the 2007 GECCO conference companion on Genetic
  and evolutionary computation - GECCO '07: the 2007 GECCO conference companion
  on Genetic and evolutionary computation, London : Royaume-Uni (2007)",10.1145/1274000.1274098,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we describe a new algorithm that consists in combining an
eye-tracker for minimizing the fatigue of a user during the evaluation process
of Interactive Evolutionary Computation. The approach is then applied to the
Interactive One-Max optimization problem.
","[{'version': 'v1', 'created': 'Fri, 21 Mar 2008 16:11:38 GMT'}]",2008-12-18,"[['Pallez', 'Denis', '', 'LIRIS'], ['Collard', 'Philippe', '', 'I3S'], ['Baccino', 'Thierry', '', 'LPEQ'], ['Dumercy', 'Laurent', '', 'LPEQ']]","['Interactive evolutionary computation', 'user fatigue minimization', 'eye-tracking system', 'interactive one-max problem']"
1511,1902.01961,Daniel Lemire,"Daniel Lemire, Owen Kaser, Nathan Kurz","Faster Remainder by Direct Computation: Applications to Compilers and
  Software Libraries",,"Software: Practice and Experience 49 (6), 2019",10.1002/spe.2689,,cs.MS cs.PF,http://creativecommons.org/publicdomain/zero/1.0/,"  On common processors, integer multiplication is many times faster than
integer division. Dividing a numerator n by a divisor d is mathematically
equivalent to multiplication by the inverse of the divisor (n / d = n x 1/d).
If the divisor is known in advance---or if repeated integer divisions will be
performed with the same divisor---it can be beneficial to substitute a less
costly multiplication for an expensive division.
  Currently, the remainder of the division by a constant is computed from the
quotient by a multiplication and a subtraction. But if just the remainder is
desired and the quotient is unneeded, this may be suboptimal. We present a
generally applicable algorithm to compute the remainder more directly.
Specifically, we use the fractional portion of the product of the numerator and
the inverse of the divisor. On this basis, we also present a new, simpler
divisibility algorithm to detect nonzero remainders.
  We also derive new tight bounds on the precision required when representing
the inverse of the divisor. Furthermore, we present simple C implementations
that beat the optimized code produced by state-of-art C compilers on recent x64
processors (e.g., Intel Skylake and AMD Ryzen), sometimes by more than 25%. On
all tested platforms including 64-bit ARM and POWER8, our divisibility-test
functions are faster than state-of-the-art Granlund-Montgomery
divisibility-test functions, sometimes by more than 50%.
","[{'version': 'v1', 'created': 'Tue, 5 Feb 2019 22:33:20 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Feb 2019 18:49:00 GMT'}, {'version': 'v3', 'created': 'Wed, 20 Nov 2019 16:52:47 GMT'}]",2019-11-21,"[['Lemire', 'Daniel', ''], ['Kaser', 'Owen', ''], ['Kurz', 'Nathan', '']]","['Integer Division', 'Bit Manipulation', 'Divisibility']"
1512,1003.0054,Rahul Srivastava,Rahul Srivastava and Can Emre Koksal,Energy Optimal Transmission Scheduling in Wireless Sensor Networks,"Accepted for publication in the IEEE Transactions on Wireless
  Communications",,10.1109/TWC.2010.05.090275,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the main issues in the design of sensor networks is energy efficient
communication of time-critical data. Energy wastage can be caused by failed
packet transmission attempts at each node due to channel dynamics and
interference. Therefore transmission control techniques that are unaware of the
channel dynamics can lead to suboptimal channel use patterns. In this paper we
propose a transmission controller that utilizes different ""grades"" of channel
side information to schedule packet transmissions in an optimal way, while
meeting a deadline constraint for all packets waiting in the transmission
queue. The wireless channel is modeled as a finite-state Markov channel. We are
specifically interested in the case where the transmitter has low-grade channel
side information that can be obtained based solely on the ACK/NAK sequence for
the previous transmissions. Our scheduler is readily implementable and it is
based on the dynamic programming solution to the finite-horizon transmission
control problem. We also calculate the information theoretic capacity of the
finite state Markov channel with feedback containing different grades of
channel side information including that, obtained through the ACK/NAK sequence.
We illustrate that our scheduler achieves a given throughput at a power level
that is fairly close to the fundamental limit achievable over the channel.
","[{'version': 'v1', 'created': 'Sat, 27 Feb 2010 04:01:09 GMT'}]",2011-05-24,"[['Srivastava', 'Rahul', ''], ['Koksal', 'Can Emre', '']]","['Sensor networks', 'Markov channel', 'automatic repeat request (ARQ)', 'transmission scheduler']"
1513,1609.09435,Alessandro Bessi,Alessandro Bessi,"On the statistical properties of viral misinformation in online social
  media",,,10.1016/j.physa.2016.11.012,,cs.SI physics.soc-ph stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The massive diffusion of online social media allows for the rapid and
uncontrolled spreading of conspiracy theories, hoaxes, unsubstantiated claims,
and false news. Such an impressive amount of misinformation can influence
policy preferences and encourage behaviors strongly divergent from recommended
practices. In this paper, we study the statistical properties of viral
misinformation in online social media. By means of methods belonging to Extreme
Value Theory, we show that the number of extremely viral posts over time
follows a homogeneous Poisson process, and that the interarrival times between
such posts are independent and identically distributed, following an
exponential distribution. Moreover, we characterize the uncertainty around the
rate parameter of the Poisson process through Bayesian methods. Finally, we are
able to derive the predictive posterior probability distribution of the number
of posts exceeding a certain threshold of shares over a finite interval of
time.
","[{'version': 'v1', 'created': 'Thu, 29 Sep 2016 17:31:44 GMT'}]",2017-02-01,"[['Bessi', 'Alessandro', '']]","['misinformation', 'online social media', 'extreme value theory']"
1514,1209.0378,Carlos Viegas Dam\'asio,"C. V. Dam\'asio, A. Analyti and G. Antoniou",Provenance for SPARQL queries,"22 pages, extended version of the ISWC 2012 paper including proofs","The Semantic Web - ISWC 2012 - 11th International Semantic Web
  Conference, Part I, LNCS, Vol. 7649, ISBN 978-3-642-35175-4, pp. 625-640,
  Springer Berlin Heidelberg, November 2012",10.1007/978-3-642-35176-1_39,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Determining trust of data available in the Semantic Web is fundamental for
applications and users, in particular for linked open data obtained from SPARQL
endpoints. There exist several proposals in the literature to annotate SPARQL
query results with values from abstract models, adapting the seminal works on
provenance for annotated relational databases. We provide an approach capable
of providing provenance information for a large and significant fragment of
SPARQL 1.1, including for the first time the major non-monotonic constructs
under multiset semantics. The approach is based on the translation of SPARQL
into relational queries over annotated relations with values of the most
general m-semiring, and in this way also refuting a claim in the literature
that the OPTIONAL construct of SPARQL cannot be captured appropriately with the
known abstract models.
","[{'version': 'v1', 'created': 'Mon, 3 Sep 2012 15:04:55 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Mar 2013 18:57:22 GMT'}]",2015-03-20,"[['Damásio', 'C. V.', ''], ['Analyti', 'A.', ''], ['Antoniou', 'G.', '']]","['How-provenance', 'SPARQL queries', 'm-semirings', 'difference']"
1515,0805.0459,"\^Hamed  \""Owladeghaffari",Hamed Owladeghaffari,Phase transition in SONFIS&SORST,"submitted to :The Sixth International Conference on Rough Sets and
  Current Trends in Computing; Akron, Ohio, USA,2008",,10.1007/978-3-540-88425-5_35,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, we introduce general frame of MAny Connected Intelligent
Particles Systems (MACIPS). Connections and interconnections between particles
get a complex behavior of such merely simple system (system in
system).Contribution of natural computing, under information granulation
theory, are the main topics of this spacious skeleton. Upon this clue, we
organize two algorithms involved a few prominent intelligent computing and
approximate reasoning methods: self organizing feature map (SOM), Neuro- Fuzzy
Inference System and Rough Set Theory (RST). Over this, we show how our
algorithms can be taken as a linkage of government-society interaction, where
government catches various fashions of behavior: solid (absolute) or flexible.
So, transition of such society, by changing of connectivity parameters (noise)
from order to disorder is inferred. Add to this, one may find an indirect
mapping among financial systems and eventual market fluctuations with MACIPS.
Keywords: phase transition, SONFIS, SORST, many connected intelligent particles
system, society-government interaction
","[{'version': 'v1', 'created': 'Mon, 5 May 2008 04:19:50 GMT'}]",2014-07-29,"[['Owladeghaffari', 'Hamed', '']]","['phase transition', 'SONFIS', 'SORST', 'many connected intelligent particles system', 'society-government interaction']"
1516,1511.02503,Wei Li,"Wei Li, Mingquan Qiu, Zhencai Zhu, Bo Wu, Gongbo Zhou",Bearing fault diagnosis based on spectrum images of vibration signals,,"Measurement Science and Technology, Volume 27, Number 3, 2016",10.1088/0957-0233/27/3/035005,,cs.CV cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bearing fault diagnosis has been a challenge in the monitoring activities of
rotating machinery, and it's receiving more and more attention. The
conventional fault diagnosis methods usually extract features from the
waveforms or spectrums of vibration signals in order to realize fault
classification. In this paper, a novel feature in the form of images is
presented, namely the spectrum images of vibration signals. The spectrum images
are simply obtained by doing fast Fourier transformation. Such images are
processed with two-dimensional principal component analysis (2DPCA) to reduce
the dimensions, and then a minimum distance method is applied to classify the
faults of bearings. The effectiveness of the proposed method is verified with
experimental data.
","[{'version': 'v1', 'created': 'Sun, 8 Nov 2015 16:51:22 GMT'}, {'version': 'v2', 'created': 'Sun, 20 Dec 2015 15:00:22 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Jan 2016 14:30:19 GMT'}, {'version': 'v4', 'created': 'Wed, 3 Feb 2016 07:12:04 GMT'}, {'version': 'v5', 'created': 'Thu, 4 Feb 2016 01:52:35 GMT'}]",2016-02-05,"[['Li', 'Wei', ''], ['Qiu', 'Mingquan', ''], ['Zhu', 'Zhencai', ''], ['Wu', 'Bo', ''], ['Zhou', 'Gongbo', '']]","['Bearing', 'Vibration signal', 'Fault diagnosis', 'Image']"
1517,1803.05361,Yangguang Shi,"Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi","Approximating Generalized Network Design under (Dis)economies of Scale
  with Applications to Energy Efficiency","39 pages, 1 figure. An extended abstract of this paper is to appear
  in the 50th Annual ACM Symposium on the Theory of Computing (STOC 2018)",,10.1145/3188745.3188812,,cs.GT cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a generalized network design (GND) problem, a set of resources are
assigned to multiple communication requests. Each request contributes its
weight to the resources it uses and the total load on a resource is then
translated to the cost it incurs via a resource specific cost function. For
example, a request may be to establish a virtual circuit, thus contributing to
the load on each edge in the circuit. Motivated by energy efficiency
applications, recently, there is a growing interest in GND using cost functions
that exhibit (dis)economies of scale ((D)oS), namely, cost functions that
appear subadditive for small loads and superadditive for larger loads.
  The current paper advances the existing literature on approximation
algorithms for GND problems with (D)oS cost functions in various aspects: (1)
we present a generic approximation framework that yields approximation results
for a much wider family of requests in both directed and undirected graphs; (2)
our framework allows for unrelated weights, thus providing the first
non-trivial approximation for the problem of scheduling unrelated parallel
machines with (D)oS cost functions; (3) our framework is fully combinatorial
and runs in strongly polynomial time; (4) the family of (D)oS cost functions
considered in the current paper is more general than the one considered in the
existing literature, providing a more accurate abstraction for practical energy
conservation scenarios; and (5) we obtain the first approximation ratio for GND
with (D)oS cost functions that depends only on the parameters of the resources'
technology and does not grow with the number of resources, the number of
requests, or their weights. The design of our framework relies heavily on
Roughgarden's smoothness toolbox (JACM 2015), thus demonstrating the possible
usefulness of this toolbox in the area of approximation algorithms.
","[{'version': 'v1', 'created': 'Wed, 14 Mar 2018 15:39:58 GMT'}]",2018-03-15,"[['Emek', 'Yuval', ''], ['Kutten', 'Shay', ''], ['Lavi', 'Ron', ''], ['Shi', 'Yangguang', '']]","['Approximation algorithms', 'generalized network design', '(dis)economies of scale', 'energy']"
1518,1903.11446,Xin-She Yang,"Xin-She Yang, Suash Deb, Sudhanshu K Mishra",Multi-Species Cuckoo Search Algorithm for Global Optimization,"15 pages, 1 figures","Cognitive Computation, vol. 10, number 6, 1085-1095 (2018)",10.1007/s12559-018-9579-4,,cs.NE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many optimization problems in science and engineering are highly nonlinear,
and thus require sophisticated optimization techniques to solve. Traditional
techniques such as gradient-based algorithms are mostly local search methods,
and often struggle to cope with such challenging optimization problems. Recent
trends tend to use nature-inspired optimization algorithms. This work extends
the standard cuckoo search (CS) by using the successful features of the
cuckoo-host co-evolution with multiple interacting species, and the proposed
multi-species cuckoo search (MSCS) intends to mimic the multiple species of
cuckoos that compete for the survival of the fittest, and they co-evolve with
host species with solution vectors being encoded as position vectors. The
proposed algorithm is then validated by 15 benchmark functions as well as five
nonlinear, multimodal design case studies in practical applications. Simulation
results suggest that the proposed algorithm can be effective for finding
optimal solutions and in this case all optimal solutions are achievable. The
results for the test benchmarks are also compared with those obtained by other
methods such as the standard cuckoo search and genetic algorithm, which
demonstrated the efficiency of the present algorithm. Based on numerical
experiments and case studies, we can conclude that the proposed algorithm can
be more efficient in most cases, leading a potentially very effective tool for
solving nonlinear optimization problems.
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2019 14:25:16 GMT'}]",2019-03-28,"[['Yang', 'Xin-She', ''], ['Deb', 'Suash', ''], ['Mishra', 'Sudhanshu K', '']]","['Cuckoo search', 'Nature-inspired algorithm', 'Multi-species cuckoo search', 'Neural computing', 'Optimization', 'Swarm intelligence']"
1519,1902.10659,Kevin Carlberg,"Philip A. Etter, Kevin T. Carlberg","Online adaptive basis refinement and compression for reduced-order
  models via vector-space sieving",,,10.1016/j.cma.2020.112931,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many applications, projection-based reduced-order models (ROMs) have
demonstrated the ability to provide rapid approximate solutions to
high-fidelity full-order models (FOMs). However, there is no a priori assurance
that these approximate solutions are accurate; their accuracy depends on the
ability of the low-dimensional trial basis to represent the FOM solution. As a
result, ROMs can generate inaccurate approximate solutions, e.g., when the FOM
solution at the online prediction point is not well represented by training
data used to construct the trial basis. To address this fundamental deficiency
of standard model-reduction approaches, this work proposes a novel
online-adaptive mechanism for efficiently enriching the trial basis in a manner
that ensures convergence of the ROM to the FOM, yet does not incur any FOM
solves. The mechanism is based on the previously proposed adaptive
$h$-refinement method for ROMs [12], but improves upon this work in two crucial
ways. First, the proposed method enables basis refinement with respect to any
orthogonal basis (not just the Kronecker basis), thereby generalizing the
refinement mechanism and enabling it to be tailored to the physics
characterizing the problem at hand. Second, the proposed method provides a fast
online algorithm for periodically compressing the enriched basis via an
efficient proper orthogonal decomposition (POD) method, which does not incur
any operations that scale with the FOM dimension. These two features allow the
proposed method to serve as (1) a failsafe mechanism for ROMs, as the method
enables the ROM to satisfy any prescribed error tolerance online (even in the
case of inadequate training), and (2) an efficient online basis-adaptation
mechanism, as the combination of basis enrichment and compression enables the
basis to adapt online while controlling its dimension.
","[{'version': 'v1', 'created': 'Wed, 27 Feb 2019 17:47:51 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Apr 2019 22:14:16 GMT'}]",2020-04-22,"[['Etter', 'Philip A.', ''], ['Carlberg', 'Kevin T.', '']]","['adaptive refinement', 'adaptive coarsening', 'model reduction', 'dual-weighted residual', 'adjoint error estimation']"
1520,2102.12604,Katherine Van Koevering,"Katherine Van Koevering, Austin R. Benson, Jon Kleinberg","Random Graphs with Prescribed $K$-Core Sequences: A New Null Model for
  Network Analysis",,,10.1145/3442381.3450001,,cs.SI cs.DS math.CO physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the analysis of large-scale network data, a fundamental operation is the
comparison of observed phenomena to the predictions provided by null models:
when we find an interesting structure in a family of real networks, it is
important to ask whether this structure is also likely to arise in random
networks with similar characteristics to the real ones. A long-standing
challenge in network analysis has been the relative scarcity of reasonable null
models for networks; arguably the most common such model has been the
configuration model, which starts with a graph $G$ and produces a random graph
with the same node degrees as $G$. This leads to a very weak form of null
model, since fixing the node degrees does not preserve many of the crucial
properties of the network, including the structure of its subgraphs.
  Guided by this challenge, we propose a new family of network null models that
operate on the $k$-core decomposition. For a graph $G$, the $k$-core is its
maximal subgraph of minimum degree $k$; and the core number of a node $v$ in
$G$ is the largest $k$ such that $v$ belongs to the $k$-core of $G$. We provide
the first efficient sampling algorithm to solve the following basic
combinatorial problem: given a graph $G$, produce a random graph sampled nearly
uniformly from among all graphs with the same sequence of core numbers as $G$.
This opens the opportunity to compare observed networks $G$ with random graphs
that exhibit the same core numbers, a comparison that preserves aspects of the
structure of $G$ that are not captured by more local measures like the degree
sequence. We illustrate the power of this core-based null model on some
fundamental tasks in network analysis, including the enumeration of networks
motifs.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2021 23:41:11 GMT'}]",2021-02-26,"[['Van Koevering', 'Katherine', ''], ['Benson', 'Austin R.', ''], ['Kleinberg', 'Jon', '']]","['k-core', 'motif', 'Markov chain']"
1521,1608.02315,"Federico Schl\""uter","Federico Schl\""uter, Yanela Strappa, Diego H. Milone, Facundo Bromberg",Blankets Joint Posterior score for learning Markov network structures,"33 pages, 5 figures",,10.1016/j.ijar.2017.10.018,,cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Markov networks are extensively used to model complex sequential, spatial,
and relational interactions in a wide range of fields. By learning the
structure of independences of a domain, more accurate joint probability
distributions can be obtained for inference tasks or, more directly, for
interpreting the most significant relations among the variables. Recently,
several researchers have investigated techniques for automatically learning the
structure from data by obtaining the probabilistic maximum-a-posteriori
structure given the available data. However, all the approximations proposed
decompose the posterior of the whole structure into local sub-problems, by
assuming that the posteriors of the Markov blankets of all the variables are
mutually independent. In this work, we propose a scoring function for relaxing
such assumption. The Blankets Joint Posterior score computes the joint
posterior of structures as a joint distribution of the collection of its Markov
blankets. Essentially, the whole posterior is obtained by computing the
posterior of the blanket of each variable as a conditional distribution that
takes into account information from other blankets in the network. We show in
our experimental results that the proposed approximation can improve the sample
complexity of state-of-the-art scores when learning complex networks, where the
independence assumption between blanket variables is clearly incorrect.
","[{'version': 'v1', 'created': 'Mon, 8 Aug 2016 04:59:40 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Mar 2017 21:30:40 GMT'}]",2017-11-01,"[['Schlüter', 'Federico', ''], ['Strappa', 'Yanela', ''], ['Milone', 'Diego H.', ''], ['Bromberg', 'Facundo', '']]","['Markov network', 'structure learning', 'scoring function', 'blankets']"
1522,1902.11216,Bernd Huber,"Bernd Huber, Hijung Valentina Shin, Bryan Russell, Oliver Wang,
  Gautham J. Mysore",B-Script: Transcript-based B-roll Video Editing with Recommendations,"11 pages, 10 figures, CHI 2019",,10.1145/3290605.3300311,,cs.HC cs.GR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In video production, inserting B-roll is a widely used technique to enrich
the story and make a video more engaging. However, determining the right
content and positions of B-roll and actually inserting it within the main
footage can be challenging, and novice producers often struggle to get both
timing and content right. We present B-Script, a system that supports B-roll
video editing via interactive transcripts. B-Script has a built-in
recommendation system trained on expert-annotated data, recommending users
B-roll position and content. To evaluate the system, we conducted a
within-subject user study with 110 participants, and compared three interface
variations: a timeline-based editor, a transcript-based editor, and a
transcript-based editor with recommendations. Users found it easier and were
faster to insert B-roll using the transcript-based interface, and they created
more engaging videos when recommendations were provided.
","[{'version': 'v1', 'created': 'Thu, 28 Feb 2019 17:01:29 GMT'}]",2019-03-01,"[['Huber', 'Bernd', ''], ['Shin', 'Hijung Valentina', ''], ['Russell', 'Bryan', ''], ['Wang', 'Oliver', ''], ['Mysore', 'Gautham J.', '']]","['in the video, and presents these to the user for easy edits', 'A demo ofthe system can be found at berndhuber', 'github', 'io/bscript']"
1523,1306.0150,Mauro Femminella,"Luca Felicetti, Mauro Femminella, Gianluca Reali","Simulation of Molecular Signaling in Blood Vessels: Software Design and
  Application to Atherogenesis","Submitted for publication to Nano Communication Networks, Elsevier","Nano Communication Networks Vol.4, No.3, September 2013",10.1016/j.nancom.2013.06.002,,cs.CE cond-mat.soft q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a software platform, named BiNS2, able to simulate
diffusion-based molecular communications with drift inside blood vessels. The
contribution of the paper is twofold. First a detailed description of the
simulator is given, under the software engineering point of view, by
highlighting the innovations and optimizations introduced. Their introduction
into the previous version of the BiNS simulator was needed to provide to
functions for simulating molecular signaling and communication potentials
inside bounded spaces. The second contribution consists of the analysis,
carried out by using BiNS2, of a specific communication process happening
inside blood vessels, the atherogenesis, which is the initial phase of the
formation of atherosclerotic plaques, due to the abnormal signaling between
platelets and endothelium. From a communication point of view, platelets act as
mobile transmitters, endothelial cells are fixed receivers, sticky to the
vessel walls, and the transmitted signal is made of bursts of molecules emitted
by platelets. The simulator allows evaluating the channel latency and the
footprint on the vessel wall of the transmitted signal as a function of the
transmitter distance from the vessels wall, the signal strength, and the
receiver sensitivity.
","[{'version': 'v1', 'created': 'Sat, 1 Jun 2013 21:05:17 GMT'}]",2013-08-16,"[['Felicetti', 'Luca', ''], ['Femminella', 'Mauro', ''], ['Reali', 'Gianluca', '']]","['simulation', 'molecular communications', 'signaling', 'endothelium', 'platelets', 'distributed']"
1524,cs/0202017,Daniel Lehmann,"Daniel Lehmann, Liadan Ita O'Callaghan and Yoav Shoham",Truth Revelation in Approximately Efficient Combinatorial Auctions,Submitted to a Journal. A preliminary version appeared in EC'99,"Journal of the ACM Vol. 49, No. 5, September 2002, pp. 577-602",,Stanford University CS-TN-99-88,cs.GT,,"  Some important classical mechanisms considered in Microeconomics and Game
Theory require the solution of a difficult optimization problem. This is true
of mechanisms for combinatorial auctions, which have in recent years assumed
practical importance, and in particular of the gold standard for combinatorial
auctions, the Generalized Vickrey Auction (GVA). Traditional analysis of these
mechanisms - in particular, their truth revelation properties - assumes that
the optimization problems are solved precisely. In reality, these optimization
problems can usually be solved only in an approximate fashion. We investigate
the impact on such mechanisms of replacing exact solutions by approximate ones.
Specifically, we look at a particular greedy optimization method. We show that
the GVA payment scheme does not provide for a truth revealing mechanism. We
introduce another scheme that does guarantee truthfulness for a restricted
class of players. We demonstrate the latter property by identifying natural
properties for combinatorial auctions and showing that, for our restricted
class of players, they imply that truthful strategies are dominant. Those
properties have applicability beyond the specific auction studied.
","[{'version': 'v1', 'created': 'Fri, 15 Feb 2002 12:24:29 GMT'}]",2007-05-23,"[['Lehmann', 'Daniel', ''], [""O'Callaghan"", 'Liadan Ita', ''], ['Shoham', 'Yoav', '']]","['Combinatorial Auctions', 'Mechanism Design', 'Computational Complexity']"
1525,1812.03592,Dylan Hendrickson,"Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch","Toward a General Theory of Motion Planning Complexity: Characterizing
  Which Gadgets Make Games Hard","Added applications, fixed typos, changed style and colors","11th Innovations in Theoretical Computer Science Conference (ITCS
  2020)",10.4230/LIPIcs.ITCS.2020.62,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We build a general theory for characterizing the computational complexity of
motion planning of robot(s) through a graph of ""gadgets"", where each gadget has
its own state defining a set of allowed traversals which in turn modify the
gadget's state. We study two families of such gadgets, one which naturally
leads to motion planning problems with polynomially bounded solutions, and
another which leads to polynomially unbounded (potentially exponential)
solutions. We also study a range of competitive game-theoretic scenarios, from
one player controlling one robot to teams of players each controlling their own
robot and racing to achieve their team's goal. Under small restrictions on
these gadgets, we fully characterize the complexity of bounded 1-player motion
planning (NL vs. NP-complete), unbounded 1-player motion planning (NL vs.
PSPACE-complete), and bounded 2-player motion planning (P vs. PSPACE-complete),
and we partially characterize the complexity of unbounded 2-player motion
planning (P vs. EXPTIME-complete), bounded 2-team motion planning (P vs.
NEXPTIME-complete), and unbounded 2-team motion planning (P vs. undecidable).
These results can be seen as an alternative to Constraint Logic (which has
already proved useful as a basis for hardness reductions), providing a wide
variety of agent-based gadgets, any one of which suffices to prove a problem
hard.
","[{'version': 'v1', 'created': 'Mon, 10 Dec 2018 01:40:11 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Jan 2020 06:42:23 GMT'}]",2020-01-15,"[['Demaine', 'Erik D.', ''], ['Hendrickson', 'Dylan H.', ''], ['Lynch', 'Jayson', '']]","['motion planning', 'computational complexity', 'NP', 'PSPACE', 'EXP', 'NEXP', 'undecidability', 'games']"
1526,1404.3435,Iaakov Exman,Iaakov Exman,Web Search of New Linearized Medical Drug Leads,"8 pages, 9 figures, reprint of paper in SKY 2011 Workshop, Paris,
  France, October 2011, SciTePress Digital Library",,10.5220/0003705401080115,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Web is a potentially huge source of medical drug leads. But despite the
significant amount of multi- dimensional information about drugs, currently
commercial search engines accept only linear keyword strings as inputs. This
work uses linearized fragments of molecular structures as knowledge
representation units to serve as inputs to search engines. It is shown that
quite arbitrary fragments are surprisingly free of ambiguity, obtaining
relatively small result sets, which are both manageable and rich in novel
potential drug leads.
","[{'version': 'v1', 'created': 'Sun, 13 Apr 2014 22:01:48 GMT'}]",2014-04-15,"[['Exman', 'Iaakov', '']]","['Linearized chemical structures', 'lead', 'search', 'multi-dimensional', 'knowledge representation']"
1527,1406.7373,Marco Mondelli,"Marco Mondelli, S. Hamed Hassani, R\""udiger Urbanke",How to Achieve the Capacity of Asymmetric Channels,"32 pages, 4 figures, presented in part at Allerton'14 and published
  in IEEE Trans. Inform. Theory",,"10.1109/ALLERTON.2014.7028535, 10.1109/TIT.2018.2789885",,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We survey coding techniques that enable reliable transmission at rates that
approach the capacity of an arbitrary discrete memoryless channel. In
particular, we take the point of view of modern coding theory and discuss how
recent advances in coding for symmetric channels help provide more efficient
solutions for the asymmetric case. We consider, in more detail, three basic
coding paradigms.
  The first one is Gallager's scheme that consists of concatenating a linear
code with a non-linear mapping so that the input distribution can be
appropriately shaped. We explicitly show that both polar codes and spatially
coupled codes can be employed in this scenario. Furthermore, we derive a
scaling law between the gap to capacity, the cardinality of the input and
output alphabets, and the required size of the mapper.
  The second one is an integrated scheme in which the code is used both for
source coding, in order to create codewords distributed according to the
capacity-achieving input distribution, and for channel coding, in order to
provide error protection. Such a technique has been recently introduced by
Honda and Yamamoto in the context of polar codes, and we show how to apply it
also to the design of sparse graph codes.
  The third paradigm is based on an idea of B\""ocherer and Mathar, and
separates the two tasks of source coding and channel coding by a chaining
construction that binds together several codewords. We present conditions for
the source code and the channel code, and we describe how to combine any source
code with any channel code that fulfill those conditions, in order to provide
capacity-achieving schemes for asymmetric channels. In particular, we show that
polar codes, spatially coupled codes, and homophonic codes are suitable as
basic building blocks of the proposed coding strategy.
","[{'version': 'v1', 'created': 'Sat, 28 Jun 2014 08:58:54 GMT'}, {'version': 'v2', 'created': 'Sat, 20 Sep 2014 15:27:17 GMT'}, {'version': 'v3', 'created': 'Sun, 11 Sep 2016 20:26:18 GMT'}, {'version': 'v4', 'created': 'Wed, 23 Aug 2017 02:21:50 GMT'}, {'version': 'v5', 'created': 'Wed, 3 Jan 2018 08:34:57 GMT'}]",2018-01-04,"[['Mondelli', 'Marco', ''], ['Hassani', 'S. Hamed', ''], ['Urbanke', 'Rüdiger', '']]","['Asymmetric channel', 'capacity-achieving coding scheme', 'chaining construction', 'Gallager’s scheme', 'polar codes', 'spatially coupled codes']"
1528,1504.03068,Ahmad Kamal,Ahmad Kamal,Review Mining for Feature Based Opinion Summarization and Visualization,"6 pages, 5 figures, 2 tables","International Journal of Computer Applications, 119(17), 2015, pp.
  6-13",10.5120/21157-4183,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The application and usage of opinion mining, especially for business
intelligence, product recommendation, targeted marketing etc. have fascinated
many research attentions around the globe. Various research efforts attempted
to mine opinions from customer reviews at different levels of granularity,
including word-, sentence-, and document-level. However, development of a fully
automatic opinion mining and sentiment analysis system is still elusive. Though
the development of opinion mining and sentiment analysis systems are getting
momentum, most of them attempt to perform document-level sentiment analysis,
classifying a review document as positive, negative, or neutral. Such
document-level opinion mining approaches fail to provide insight about users
sentiment on individual features of a product or service. Therefore, it seems
to be a great help for both customers and manufacturers, if the reviews could
be processed at a finer-grained level and presented in a summarized form
through some visual means, highlighting individual features of a product and
users sentiment expressed over them. In this paper, the design of a unified
opinion mining and sentiment analysis framework is presented at the
intersection of both machine learning and natural language processing
approaches. Also, design of a novel feature-level review summarization scheme
is proposed to visualize mined features, opinions and their polarity values in
a comprehendible way.
","[{'version': 'v1', 'created': 'Mon, 13 Apr 2015 05:53:59 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Apr 2015 03:02:18 GMT'}]",2015-07-30,"[['Kamal', 'Ahmad', '']]","['OpinionMining', 'SubjectivityClassification', 'Feature']"
1529,1803.08378,Jian Gao,"Ling-Jiao Chen, Jian Gao",A trust-based recommendation method using network diffusion processes,"14 pages, 6 figures, 2 tables",Physica A 506 (2018) 679-691,10.1016/j.physa.2018.04.089,,cs.IR physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A variety of rating-based recommendation methods have been extensively
studied including the well-known collaborative filtering approaches and some
network diffusion-based methods, however, social trust relations are not
sufficiently considered when making recommendations. In this paper, we
contribute to the literature by proposing a trust-based recommendation method,
named CosRA+T, after integrating the information of trust relations into the
resource-redistribution process. Specifically, a tunable parameter is used to
scale the resources received by trusted users before the redistribution back to
the objects. Interestingly, we find an optimal scaling parameter for the
proposed CosRA+T method to achieve its best recommendation accuracy, and the
optimal value seems to be universal under several evaluation metrics across
different datasets. Moreover, results of extensive experiments on the two
real-world rating datasets with trust relations, Epinions and FriendFeed,
suggest that CosRA+T has a remarkable improvement in overall accuracy,
diversity, and novelty. Our work takes a step towards designing better
recommendation algorithms by employing multiple resources of social network
information.
","[{'version': 'v1', 'created': 'Thu, 22 Mar 2018 14:35:44 GMT'}]",2019-06-12,"[['Chen', 'Ling-Jiao', ''], ['Gao', 'Jian', '']]","['Recommender system', 'Trust relations', 'Vertex similarity', 'Network diffusion', 'Complex networks']"
1530,1703.01580,Michail-Antisthenis Tsompanas,"Michail-Antisthenis Tsompanas, Andrew Adamatzky, Georgios Ch.
  Sirakoulis, John Greenman, Ioannis Ieropoulos",Towards implementation of Cellular Automata in Microbial Fuel Cells,,,10.1371/journal.pone.0177528,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Microbial Fuel Cell (MFC) is a bio-electrochemical transducer converting
waste products into electricity using microbial communities. Cellular Automaton
(CA) is a uniform array of finite-state machines that update their states in
discrete time depending on states of their closest neighbors by the same rule.
Arrays of MFCs could, in principle, act as massive-parallel computing devices
with local connectivity between elementary processors. We provide a theoretical
design of such a parallel processor by implementing CA in MFCs. We have chosen
Conway's Game of Life as the 'benchmark' CA because this is the most popular CA
which also exhibits an enormously rich spectrum of patterns. Each cell of the
Game of Life CA is realized using two MFCs. The MFCs are linked electrically
and hydraulically. The model is verified via simulation of an electrical
circuit demonstrating equivalent behaviors. The design is a first step towards
future implementations of fully autonomous biological computing devices with
massive parallelism. The energy independence of such devices counteracts their
somewhat slow transitions - compared to silicon circuitry - between the
different states during computation.
","[{'version': 'v1', 'created': 'Sun, 5 Mar 2017 09:50:05 GMT'}]",2017-07-05,"[['Tsompanas', 'Michail-Antisthenis', ''], ['Adamatzky', 'Andrew', ''], ['Sirakoulis', 'Georgios Ch.', ''], ['Greenman', 'John', ''], ['Ieropoulos', 'Ioannis', '']]","['Microbial fuel cells', 'cellular automata', 'Game of Life', 'biological computation']"
1531,1801.00801,Nicolai Pogrebnyakov,Nicolai Pogrebnyakov and Edgar Maldonado,"Identifying emergency stages in Facebook posts of police departments
  with convolutional and recurrent neural networks and support vector machines",,"Proceedings of the 5th IEEE International Conference on Big Data,
  Boston, MA, USA, December 11-14, 2017",10.1109/BigData.2017.8258464,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classification of social media posts in emergency response is an important
practical problem: accurate classification can help automate processing of such
messages and help other responders and the public react to emergencies in a
timely fashion. This research focused on classifying Facebook messages of US
police departments. Randomly selected 5,000 messages were used to train
classifiers that distinguished between four categories of messages: emergency
preparedness, response and recovery, as well as general engagement messages.
Features were represented with bag-of-words and word2vec, and models were
constructed using support vector machines (SVMs) and convolutional (CNNs) and
recurrent neural networks (RNNs). The best performing classifier was an RNN
with a custom-trained word2vec model to represent features, which achieved the
F1 measure of 0.839.
","[{'version': 'v1', 'created': 'Tue, 2 Jan 2018 19:09:47 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Jan 2018 13:27:53 GMT'}]",2018-01-25,"[['Pogrebnyakov', 'Nicolai', ''], ['Maldonado', 'Edgar', '']]","['social media', 'classification', 'police', 'support vector machines', 'neural networks']"
1532,1509.00556,Elvis Xu,Elvis H. W. Xu and P. M. Hui,"Efficient Detection of Communities with Significant Overlaps in
  Networks: Partial Community Merger Algorithm",,Network Science 6 (2018) 71-96,10.1017/nws.2017.32,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detecting communities in large-scale networks is a challenging task when each
vertex may belong to multiple communities, as is often the case in social
networks. The multiple memberships of vertices and thus the strong overlaps
among communities render many detection algorithms invalid. We develop a
Partial Community Merger Algorithm (PCMA) for detecting communities with
significant overlaps as well as slightly overlapping and disjoint ones. It is a
bottom-up approach based on properly reassembling partial information of
communities revealed in ego networks of vertices to reconstruct complete
communities. Noise control and merger order are the two key issues in
implementing this idea. We propose a novel similarity measure between two
merged communities that can suppress noise and an efficient algorithm that
recursively merges the most similar pair of communities. The validity and
accuracy of PCMA is tested against two benchmarks and compared to four existing
algorithms. It is the most efficient one with linear complexity and it
outperforms the compared algorithms when vertices have multiple memberships.
PCMA is applied to two huge online social networks, Friendster and Sina Weibo.
Millions of communities are detected and they are of higher qualities than the
corresponding metadata groups. We find that the latter should not be regarded
as the ground-truth of structural communities. The significant overlapping
pattern found in the detected communities confirms the need of new algorithms,
such as PCMA, to handle multiple memberships of vertices in social networks.
","[{'version': 'v1', 'created': 'Wed, 2 Sep 2015 04:05:40 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Sep 2017 17:01:27 GMT'}]",2019-06-04,"[['Xu', 'Elvis H. W.', ''], ['Hui', 'P. M.', '']]","['Community Detection', 'Community Structure', 'Overlapping Community', 'Partial Community', 'Social Networks', 'Vertex Memberships', 'Metadata Groups', 'Linear Complexity']"
1533,1711.07890,Luiz Capretz Dr.,"Ronnie Santos, Cleyton Magalhaes, Jorge Correia-Neto, Fabio Queda
  Bueno da Silva, Luiz Fernando Capretz, Rodrigo Souza",Would You Like to Motivate Software Testers? Ask Them How,,"ACM/IEEE 11th International Symposium on Empirical Software
  Engineering and Measurement, pp. 95-104, IEEE Press, November 2017",10.1109/ESEM.2017.16,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context. Considering the importance of software testing to the development of
high quality and reliable software systems, this paper aims to investigate how
can work-related factors influence the motivation of software testers. Method.
We applied a questionnaire that was developed using a previous theory of
motivation and satisfaction of software engineers to conduct a survey-based
study to explore and understand how professional software testers perceive and
value work-related factors that could influence their motivation at work.
Results. With a sample of 80 software testers we observed that software testers
are strongly motivated by variety of work, creative tasks, recognition for
their work, and activities that allow them to acquire new knowledge, but in
general the social impact of this activity has low influence on their
motivation. Conclusion. This study discusses the difference of opinions among
software testers, regarding work-related factors that could impact their
motivation, which can be relevant for managers and leaders in software
engineering practice.
","[{'version': 'v1', 'created': 'Tue, 21 Nov 2017 16:35:29 GMT'}]",2017-11-22,"[['Santos', 'Ronnie', ''], ['Magalhaes', 'Cleyton', ''], ['Correia-Neto', 'Jorge', ''], ['da Silva', 'Fabio Queda Bueno', ''], ['Capretz', 'Luiz Fernando', ''], ['Souza', 'Rodrigo', '']]","['Software Testing', 'Motivation', 'Software Engineering']"
1534,2102.06317,Stephen MacDonell,Sherlock A. Licorish and Stephen G. MacDonell,"Understanding the attitudes, knowledge sharing behaviors and task
  performance of core developers: A longitudinal study","Journal Paper, 25 pages, 6 figures, 8 tables","Information and Software Technology 56(12), pp.1578-1596. (2014)",10.1016/j.infsof.2014.02.004,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Prior research has established that a few individuals generally
dominate project communication and source code changes during software
development, regardless of task assignments at project initiation. Objective:
While this phenomenon has been noted, prior research has not sought to
understand these dominant individuals. Previous work has found that core
communicators are the gatekeepers of their teams' knowledge, and the
performance of these members was correlated with their teams' success. Building
on this work, we have employed a longitudinal approach to study the way core
developers' attitudes, knowledge sharing behaviors and task performance change
over the course of their project. Method: We first used Social Network Analysis
(SNA) and standard statistical analysis techniques to identify and select
artifacts and central practitioners from ten different software development
teams. We then applied psycholinguistic analysis and directed content analysis
(CA) techniques to interpret the content of these practitioners' messages.
Finally, we inspected core developers' activities at various points in time
during systems' development. Results: Among our findings, we observe that core
developers' attitudes and knowledge sharing behaviors were linked to their
involvement in actual software development and the demands of their wider
project teams. However, core developers appeared to naturally possess high
levels of insightful characteristics. Conclusion: Project performance would
likely benefit from strategies aimed at surrounding core developers with other
competent communicators. Core developers should also be supported by a wider
team who are willing to ask questions and challenge their ideas. Finally, the
availability of adequate communication channels would help with maintaining
positive team climate especially in distributed developments.(Abridged)
","[{'version': 'v1', 'created': 'Fri, 12 Feb 2021 00:01:57 GMT'}]",2021-02-15,"[['Licorish', 'Sherlock A.', ''], ['MacDonell', 'Stephen G.', '']]","['Software Development', 'Core Developers', 'Psycholinguistics', 'Content Analysis', 'Attitudes', 'Knowledge Sharing', 'Task Performance']"
1535,1807.05571,Aravind Sesagiri Raamkumar,"Aravind Sesagiri Raamkumar, Mojisola Erdt, Harsha Vijayakumar, Edie
  Rasmussen, Yin-Leng Theng","Understanding the Twitter Usage of Humanities and Social Sciences
  Academic Journals","2018 Annual Meeting of The Association for Information Science &
  Technology",,10.1002/pra2.2018.14505501047,,cs.SI cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scholarly communication has the scope to transcend the limitations of the
physical world through social media extended coverage and shortened information
paths. Accordingly, publishers have created profiles for their journals in
Twitter to promote their publications and to initiate discussions with public.
This paper investigates the Twitter presence of humanities and social sciences
(HSS) journal titles obtained from mainstream citation indices, by analysing
the interaction and communication patterns. This study utilizes webometric data
collection, descriptive analysis, and social network analysis. Findings
indicate that the presence of HSS journals in Twitter across disciplines is not
yet substantial. Sharing of general websites appears to be the key activity
performed by HSS journals in Twitter. Among them, web content from news portals
and magazines are highly disseminated. Sharing of research articles and
retweeting was not majorly observed. Inter-journal communication is apparent
within the same citation index, but it is very minimal with journals from the
other index. However, there seems to be an effort to broaden communication
beyond the research community, reaching out to connect with the public.
","[{'version': 'v1', 'created': 'Sun, 15 Jul 2018 16:21:03 GMT'}]",2019-11-19,"[['Raamkumar', 'Aravind Sesagiri', ''], ['Erdt', 'Mojisola', ''], ['Vijayakumar', 'Harsha', ''], ['Rasmussen', 'Edie', ''], ['Theng', 'Yin-Leng', '']]","['Social media', 'twitter', 'microblogs', 'journals', 'social network analysis', 'humanities', 'social sciences']"
1536,1604.06961,Fionn Murtagh,Fionn Murtagh,"Sparse p-Adic Data Coding for Computationally Efficient and Effective
  Big Data Analytics","20 pages, 6 figures","p-Adic Numbers, Ultrametric Analysis and Applications, 8(3), 2016,
  pp. 236-247",10.1134/S2070046616030055,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop the theory and practical implementation of p-adic sparse coding of
data. Rather than the standard, sparsifying criterion that uses the $L_0$
pseudo-norm, we use the p-adic norm. We require that the hierarchy or tree be
node-ranked, as is standard practice in agglomerative and other hierarchical
clustering, but not necessarily with decision trees. In order to structure the
data, all computational processing operations are direct reading of the data,
or are bounded by a constant number of direct readings of the data, implying
linear computational time. Through p-adic sparse data coding, efficient storage
results, and for bounded p-adic norm stored data, search and retrieval are
constant time operations. Examples show the effectiveness of this new approach
to content-driven encoding and displaying of data.
","[{'version': 'v1', 'created': 'Sat, 23 Apr 2016 22:28:00 GMT'}]",2018-04-10,"[['Murtagh', 'Fionn', '']]","['big data', 'p-adic numbers', 'ultrametric topology', 'hierarchical clustering', 'binary rooted tree', 'computational', 'storage complexity']"
1537,1902.08882,Ryuichi Takanobu,"Ryuichi Takanobu, Tao Zhuang, Minlie Huang, Jun Feng, Haihong Tang, Bo
  Zheng","Aggregating E-commerce Search Results from Heterogeneous Sources via
  Hierarchical Reinforcement Learning","WWW 19, 11 pages",,10.1145/3308558.3313455,,cs.IR cs.AI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate the task of aggregating search results from
heterogeneous sources in an E-commerce environment. First, unlike traditional
aggregated web search that merely presents multi-sourced results in the first
page, this new task may present aggregated results in all pages and has to
dynamically decide which source should be presented in the current page.
Second, as pointed out by many existing studies, it is not trivial to rank
items from heterogeneous sources because the relevance scores from different
source systems are not directly comparable. To address these two issues, we
decompose the task into two subtasks in a hierarchical structure: a high-level
task for source selection where we model the sequential patterns of user
behaviors onto aggregated results in different pages so as to understand user
intents and select the relevant sources properly; and a low-level task for item
presentation where we formulate a slot filling process to sequentially present
the items instead of giving each item a relevance score when deciding the
presentation order of heterogeneous items. Since both subtasks can be naturally
formulated as sequential decision problems and learn from the future user
feedback on search results, we build our model with hierarchical reinforcement
learning. Extensive experiments demonstrate that our model obtains remarkable
improvements in search performance metrics, and achieves a higher user
satisfaction.
","[{'version': 'v1', 'created': 'Sun, 24 Feb 2019 03:18:43 GMT'}]",2021-05-25,"[['Takanobu', 'Ryuichi', ''], ['Zhuang', 'Tao', ''], ['Huang', 'Minlie', ''], ['Feng', 'Jun', ''], ['Tang', 'Haihong', ''], ['Zheng', 'Bo', '']]","['aggregated search', 'vertical', 'user feedback', 'hierarchical reinforcement learning']"
1538,2006.07070,Nicolas Grislain,Gr\'egoire Jauvion and Nicolas Grislain,Optimal Allocation of Real-Time-Bidding and Direct Campaigns,,"Proceedings of the 24th ACM SIGKDD International Conference on
  Knowledge Discovery and Data Mining, July 2018, Pages 416-424",10.1145/3219819.3219877,,cs.GT cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider the problem of optimizing the revenue a web
publisher gets through real-time bidding (i.e. from ads sold in real-time
auctions) and direct (i.e. from ads sold through contracts agreed in advance).
We consider a setting where the publisher is able to bid in the real-time
bidding auction for each impression. If it wins the auction, it chooses a
direct campaign to deliver and displays the corresponding ad.
  This paper presents an algorithm to build an optimal strategy for the
publisher to deliver its direct campaigns while maximizing its real-time
bidding revenue. The optimal strategy gives a formula to determine the
publisher bid as well as a way to choose the direct campaign being delivered if
the publisher bidder wins the auction, depending on the impression
characteristics.
  The optimal strategy can be estimated on past auctions data. The algorithm
scales with the number of campaigns and the size of the dataset. This is a very
important feature, as in practice a publisher may have thousands of active
direct campaigns at the same time and would like to estimate an optimal
strategy on billions of auctions.
  The algorithm is a key component of a system which is being developed, and
which will be deployed on thousands of web publishers worldwide, helping them
to serve efficiently billions of ads a day to hundreds of millions of visitors.
","[{'version': 'v1', 'created': 'Fri, 12 Jun 2020 10:44:56 GMT'}]",2020-06-15,"[['Jauvion', 'Grégoire', ''], ['Grislain', 'Nicolas', '']]","['High-Dimensional Optimization', 'Big-Data', 'Ad-tech', 'Real-time', 'Auctions']"
1539,1505.06345,Renato J Cintra,"V. Ariyarathna, S. Kulasekera, A. Madanayake, D. Suarez, R. J. Cintra,
  F. M. Bayer, L. Belostotski","Multi-beam 4 GHz Microwave Apertures Using Current-Mode DFT
  Approximation on 65 nm CMOS","7 pages, 4 figures, In: IEEE International Microwave Symposium 2015",,10.1109/MWSYM.2015.7167112,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A current-mode CMOS design is proposed for realizing receive mode multi-beams
in the analog domain using a novel DFT approximation. High-bandwidth CMOS RF
transistors are employed in low-voltage current mirrors to achieve bandwidths
exceeding 4 GHz with good beam fidelity. Current mirrors realize the
coefficients of the considered DFT approximation, which take simple values in
$\{0, \pm1, \pm2\}$ only. This allows high bandwidths realizations using simple
circuitry without needing phase-shifters or delays. The proposed design is used
as a method to efficiently achieve spatial discrete Fourier transform operation
across a ULA to obtain multiple simultaneous RF beams. An example using 1.2 V
current-mode approximate DFT on 65 nm CMOS, with BSIM4 models from the RF kit,
show potential operation up to 4 GHz with eight independent aperture beams.
","[{'version': 'v1', 'created': 'Sat, 23 May 2015 15:37:19 GMT'}]",2016-11-17,"[['Ariyarathna', 'V.', ''], ['Kulasekera', 'S.', ''], ['Madanayake', 'A.', ''], ['Suarez', 'D.', ''], ['Cintra', 'R. J.', ''], ['Bayer', 'F. M.', ''], ['Belostotski', 'L.', '']]","['Analog', 'arrays', 'beamforming', 'aperture', 'multibeam']"
1540,0812.2567,Jian Li,Jian Li,"An $O({\log n\over \log\log n})$ Upper Bound on the Price of Stability
  for Undirected Shapley Network Design Games",,"Information Processing Letters archive Volume 109 Issue 15, July,
  2009 Pages 876-878",10.1016/j.ipl.2009.04.015,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider the Shapley network design game on undirected
networks. In this game, we have an edge weighted undirected network $G(V,E)$
and $n$ selfish players where player $i$ wants to choose a path from source
vertex $s_i$ to destination vertex $t_i$. The cost of each edge is equally
split among players who pass it. The price of stability is defined as the ratio
of the cost of the best Nash equilibrium to that of the optimal solution. We
present an $O(\log n/\log\log n)$ upper bound on price of stability for the
single sink case, i.e, $t_i=t$ for all $i$.
","[{'version': 'v1', 'created': 'Sat, 13 Dec 2008 17:33:29 GMT'}]",2014-01-27,"[['Li', 'Jian', '']]","['Price of Stability', 'Shapley Network Design Game', 'network design game']"
1541,1710.04839,John Wickerson,"Nathan Chong, Tyler Sorensen, John Wickerson","The Semantics of Transactions and Weak Memory in x86, Power, ARM, and
  C++",,"Proceedings of 39th ACM SIGPLAN Conference on Programming Language
  Design and Implementation (PLDI'18), ACM, New York, NY, USA. 2018",10.1145/3192366.3192373,,cs.PL cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Weak memory models provide a complex, system-centric semantics for concurrent
programs, while transactional memory (TM) provides a simpler,
programmer-centric semantics. Both have been studied in detail, but their
combined semantics is not well understood. This is problematic because such
widely-used architectures and languages as x86, Power, and C++ all support TM,
and all have weak memory models.
  Our work aims to clarify the interplay between weak memory and TM by
extending existing axiomatic weak memory models (x86, Power, ARMv8, and C++)
with new rules for TM. Our formal models are backed by automated tooling that
enables (1) the synthesis of tests for validating our models against existing
implementations and (2) the model-checking of TM-related transformations, such
as lock elision and compiling C++ transactions to hardware. A key finding is
that a proposed TM extension to ARMv8 currently being considered within ARM
Research is incompatible with lock elision without sacrificing portability or
performance.
","[{'version': 'v1', 'created': 'Fri, 13 Oct 2017 08:36:16 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Apr 2018 21:19:34 GMT'}]",2018-04-18,"[['Chong', 'Nathan', ''], ['Sorensen', 'Tyler', ''], ['Wickerson', 'John', '']]","['Shared Memory Concurrency', 'Weak Memory', 'Transactional Memory', 'Program Synthesis']"
1542,1409.8518,David Lillis,"David Lillis, Fergus Toolan, Rem Collier, John Dunnion",ProbFuse: A Probabilistic Approach to Data Fusion,"Proceedings of the 29th Annual International ACM SIGIR Conference on
  Research and Development in Information Retrieval (SIGIR '06), 2006",,10.1145/1148170.1148197,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data fusion is the combination of the results of independent searches on a
document collection into one single output result set. It has been shown in the
past that this can greatly improve retrieval effectiveness over that of the
individual results.
  This paper presents probFuse, a probabilistic approach to data fusion.
ProbFuse assumes that the performance of the individual input systems on a
number of training queries is indicative of their future performance. The fused
result set is based on probabilities of relevance calculated during this
training process. Retrieval experiments using data from the TREC ad hoc
collection demonstrate that probFuse achieves results superior to that of the
popular CombMNZ fusion algorithm.
","[{'version': 'v1', 'created': 'Tue, 30 Sep 2014 12:27:28 GMT'}]",2014-10-01,"[['Lillis', 'David', ''], ['Toolan', 'Fergus', ''], ['Collier', 'Rem', ''], ['Dunnion', 'John', '']]","['information retrieval', 'data fusion', 'probFuse']"
1543,1304.3992,Thara  Nair,"K. Phani Tejaswi, D. Shanmukha Rao, Thara Nair, A. V. V. Prasad",GPU Acclerated Automated Feature Extraction from Satellite Images,,"International Journal of Distributed and Parallel Systems (IJDPS)
  Vol.4, No.2, March 2013",10.5121/ijdps.2013.4201,,cs.DC cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The availability of large volumes of remote sensing data insists on higher
degree of automation in feature extraction, making it a need of the hour.The
huge quantum of data that needs to be processed entails accelerated processing
to be enabled.GPUs, which were originally designed to provide efficient
visualization, are being massively employed for computation intensive parallel
processing environments. Image processing in general and hence automated
feature extraction, is highly computation intensive, where performance
improvements have a direct impact on societal needs. In this context, an
algorithm has been formulated for automated feature extraction from a
panchromatic or multispectral image based on image processing techniques. Two
Laplacian of Guassian (LoG) masks were applied on the image individually
followed by detection of zero crossing points and extracting the pixels based
on their standard deviation with the surrounding pixels. The two extracted
images with different LoG masks were combined together which resulted in an
image with the extracted features and edges. Finally the user is at liberty to
apply the image smoothing step depending on the noise content in the extracted
image. The image is passed through a hybrid median filter to remove the salt
and pepper noise from the image. This paper discusses the aforesaid algorithm
for automated feature extraction, necessity of deployment of GPUs for the same;
system-level challenges and quantifies the benefits of integrating GPUs in such
environment. The results demonstrate that substantial enhancement in
performance margin can be achieved with the best utilization of GPU resources
and an efficient parallelization strategy. Performance results in comparison
with the conventional computing scenario have provided a speedup of 20x, on
realization of this parallelizing strategy.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2013 06:03:19 GMT'}]",2013-04-16,"[['Tejaswi', 'K. Phani', ''], ['Rao', 'D. Shanmukha', ''], ['Nair', 'Thara', ''], ['Prasad', 'A. V. V.', '']]","['Graphics Processing Unit (GPU)', 'Laplacian of Gaussian (LoG)', 'panchromatic']"
1544,2102.02636,Hendri Murfi,"Hendri Murfi, Natasha Rosaline, Nora Hariadi",Deep Autoencoder-based Fuzzy C-Means for Topic Detection,18 pages,Array 13 (2022),10.1016/j.array.2021.100124,,cs.IR cs.CL cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Topic detection is a process for determining topics from a collection of
textual data. One of the topic detection methods is a clustering-based method,
which assumes that the centroids are topics. The clustering method has the
advantage that it can process data with negative representations. Therefore,
the clustering method allows a combination with a broader representation
learning method. In this paper, we adopt deep learning for topic detection by
using a deep autoencoder and fuzzy c-means called deep autoencoder-based fuzzy
c-means (DFCM). The encoder of the autoencoder performs a lower-dimensional
representation learning. Fuzzy c-means groups the lower-dimensional
representation to identify the centroids. The autoencoder's decoder transforms
back the centroids into the original representation to be interpreted as the
topics. Our simulation shows that DFCM improves the coherence score of
eigenspace-based fuzzy c-means (EFCM) and is comparable to the leading standard
methods, i.e., nonnegative matrix factorization (NMF) or latent Dirichlet
allocation (LDA).
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2021 07:41:52 GMT'}]",2021-12-28,"[['Murfi', 'Hendri', ''], ['Rosaline', 'Natasha', ''], ['Hariadi', 'Nora', '']]","['Topic detection', 'clustering', 'deep learning', 'autoencoder', 'fuzzy c-means']"
1545,1310.3595,Atreyee Kundu,Atreyee Kundu and Debasish Chatterjee,Stabilizing discrete-time switched linear systems,10 pages,,10.1145/2562059.2562114,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article deals with stabilizing discrete-time switched linear systems.
Our contributions are threefold: Firstly, given a family of linear systems
possibly containing unstable dynamics, we propose a large class of switching
signals that stabilize a switched system generated by the switching signal and
the given family of systems. Secondly, given a switched system, a sufficient
condition for the existence of the proposed switching signal is derived by
expressing the switching signal as an infinite walk on a directed graph
representing the switched system. Thirdly, given a family of linear systems, we
propose an algorithmic technique to design a switching signal for stabilizing
the corresponding switched system.
","[{'version': 'v1', 'created': 'Mon, 14 Oct 2013 08:50:34 GMT'}]",2014-05-09,"[['Kundu', 'Atreyee', ''], ['Chatterjee', 'Debasish', '']]","['Discrete-time switched linear system', 'asymptotic stability', 'multiple Lyapunov-like functions', 'directed graphs']"
1546,1505.07553,Aurore Guillevic,"Aurore Guillevic (GRACE, LIX)","Computing Individual Discrete Logarithms Faster in GF$(p^n)$ with the
  NFS-DL Algorithm","Tetsu Iwata; Jung Hee Cheon. Asiacrypt 2015, Nov 2015, Auckland, New
  Zealand. Springer, Asiacrypt 2015, 21st Annual International Conference on
  the Theory and Application of Cryptology and Information Security, 9452, pp
  149-173, 2015, Lecture Notes in Computer Science",,10.1007/978-3-662-48797-6_7,,cs.CR math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Number Field Sieve (NFS) algorithm is the best known method to compute
discrete logarithms (DL) in finite fields $\mathbb{F}\_{p^n}$, with $p$ medium
to large and $n \geq 1$ small. This algorithm comprises four steps: polynomial
selection, relation collection, linear algebra and finally, individual
logarithm computation. The first step outputs two polynomials defining two
number fields, and a map from the polynomial ring over the integers modulo each
of these polynomials to $\mathbb{F}\_{p^n}$. After the relation collection and
linear algebra phases, the (virtual) logarithm of a subset of elements in each
number field is known. Given the target element in $\mathbb{F}\_{p^n}$, the
fourth step computes a preimage in one number field. If one can write the
target preimage as a product of elements of known (virtual) logarithm, then one
can deduce the discrete logarithm of the target. As recently shown by the
Logjam attack, this final step can be critical when it can be computed very
quickly. But we realized that computing an individual DL is much slower in
medium-and large-characteristic non-prime fields $\mathbb{F}\_{p^n}$ with $n
\geq 3$, compared to prime fields and quadratic fields $\mathbb{F}\_{p^2}$. We
optimize the first part of individual DL: the \emph{booting step}, by reducing
dramatically the size of the preimage norm. Its smoothness probability is
higher, hence the running-time of the booting step is much improved. Our method
is very efficient for small extension fields with $2 \leq n \leq 6$ and applies
to any $n \textgreater{} 1$, in medium and large characteristic.
","[{'version': 'v1', 'created': 'Thu, 28 May 2015 06:12:59 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Sep 2015 17:17:35 GMT'}, {'version': 'v3', 'created': 'Fri, 27 May 2016 08:04:13 GMT'}]",2016-05-30,"[['Guillevic', 'Aurore', '', 'GRACE, LIX']]","['Discrete logarithm', 'finite field', 'number field sieve', 'individual logarithm']"
1547,1803.07738,Zhilei Liu,"Haotian Guan, Zhilei Liu, Longbiao Wang, Jianwu Dang, Ruiguo Yu",Speech Emotion Recognition Considering Local Dynamic Features,"10 pages, 3 figures, accepted by ISSP 2017",,10.1007/978-3-030-00126-1_2,,cs.HC cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, increasing attention has been directed to the study of the speech
emotion recognition, in which global acoustic features of an utterance are
mostly used to eliminate the content differences. However, the expression of
speech emotion is a dynamic process, which is reflected through dynamic
durations, energies, and some other prosodic information when one speaks. In
this paper, a novel local dynamic pitch probability distribution feature, which
is obtained by drawing the histogram, is proposed to improve the accuracy of
speech emotion recognition. Compared with most of the previous works using
global features, the proposed method takes advantage of the local dynamic
information conveyed by the emotional speech. Several experiments on Berlin
Database of Emotional Speech are conducted to verify the effectiveness of the
proposed method. The experimental results demonstrate that the local dynamic
information obtained with the proposed method is more effective for speech
emotion recognition than the traditional global features.
","[{'version': 'v1', 'created': 'Wed, 21 Mar 2018 03:52:26 GMT'}]",2018-11-21,"[['Guan', 'Haotian', ''], ['Liu', 'Zhilei', ''], ['Wang', 'Longbiao', ''], ['Dang', 'Jianwu', ''], ['Yu', 'Ruiguo', '']]","['speech emotion recognition', 'local dynamic feature', 'prosodic feature', 'pitch', 'segmentation']"
1548,2003.13826,Carola Doerr,"Jakob Bossek, Carola Doerr, Pascal Kerschke","Initial Design Strategies and their Effects on Sequential Model-Based
  Optimization","To appear in Proc. of ACM Genetic and Evolutionary Computation
  Conference (GECCO'20)",,10.1145/3377930.3390155,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sequential model-based optimization (SMBO) approaches are algorithms for
solving problems that require computationally or otherwise expensive function
evaluations. The key design principle of SMBO is a substitution of the true
objective function by a surrogate, which is used to propose the point(s) to be
evaluated next.
  SMBO algorithms are intrinsically modular, leaving the user with many
important design choices. Significant research efforts go into understanding
which settings perform best for which type of problems. Most works, however,
focus on the choice of the model, the acquisition function, and the strategy
used to optimize the latter. The choice of the initial sampling strategy,
however, receives much less attention. Not surprisingly, quite diverging
recommendations can be found in the literature.
  We analyze in this work how the size and the distribution of the initial
sample influences the overall quality of the efficient global
optimization~(EGO) algorithm, a well-known SMBO approach. While, overall, small
initial budgets using Halton sampling seem preferable, we also observe that the
performance landscape is rather unstructured. We furthermore identify several
situations in which EGO performs unfavorably against random sampling. Both
observations indicate that an adaptive SMBO design could be beneficial, making
SMBO an interesting test-bed for automated algorithm design.
","[{'version': 'v1', 'created': 'Mon, 30 Mar 2020 21:25:41 GMT'}]",2020-04-01,"[['Bossek', 'Jakob', ''], ['Doerr', 'Carola', ''], ['Kerschke', 'Pascal', '']]","['Sequential Model-Based Optimization', 'Design of Experiments', 'Initial Design', 'Continuous Black-Box Optimization']"
1549,1002.0783,Vahan Mkrtchyan,"Vahan V. Mkrtchyan, Eckhard Steffen",Maximum $\Delta$-edge-colorable subgraphs of class II graphs,"13 pages, 2 figures, the proof of the Lemma 1 is corrected","Journal of Graph Theory 70/4, 2012, pp. 473-482",10.1002/jgt.20629,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A graph $G$ is class II, if its chromatic index is at least $\Delta+1$. Let
$H$ be a maximum $\Delta$-edge-colorable subgraph of $G$. The paper proves best
possible lower bounds for $\frac{|E(H)|}{|E(G)|}$, and structural properties of
maximum $\Delta$-edge-colorable subgraphs. It is shown that every set of
vertex-disjoint cycles of a class II graph with $\Delta\geq3$ can be extended
to a maximum $\Delta$-edge-colorable subgraph. Simple graphs have a maximum
$\Delta$-edge-colorable subgraph such that the complement is a matching.
Furthermore, a maximum $\Delta$-edge-colorable subgraph of a simple graph is
always class I.
","[{'version': 'v1', 'created': 'Wed, 3 Feb 2010 16:26:25 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Mar 2011 12:05:35 GMT'}]",2012-10-26,"[['Mkrtchyan', 'Vahan V.', ''], ['Steffen', 'Eckhard', '']]","['maximum ∆-edge-colorable subgraph', 'matching', '2-factor', 'edge-chromatic']"
1550,1707.03540,Moritz Schubotz,"Moritz Schubotz, Norman Meuschke, Thomas Hepp, Howard S. Cohl and Bela
  Gipp",VMEXT: A Visualization Tool for Mathematical Expression Trees,"15 pages, 4 figures, Intelligent Computer Mathematics - 10th
  International Conference CICM 2017, Edinburgh, UK, July 17-21, 2017,
  Proceedings","Lecture Notes in Computer Science, Springer 2017",10.1007/978-3-319-62075-6_24,,cs.HC cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mathematical expressions can be represented as a tree consisting of terminal
symbols, such as identifiers or numbers (leaf nodes), and functions or
operators (non-leaf nodes). Expression trees are an important mechanism for
storing and processing mathematical expressions as well as the most frequently
used visualization of the structure of mathematical expressions. Typically,
researchers and practitioners manually visualize expression trees using
general-purpose tools. This approach is laborious, redundant, and error-prone.
Manual visualizations represent a user's notion of what the markup of an
expression should be, but not necessarily what the actual markup is. This paper
presents VMEXT - a free and open source tool to directly visualize expression
trees from parallel MathML. VMEXT simultaneously visualizes the presentation
elements and the semantic structure of mathematical expressions to enable users
to quickly spot deficiencies in the Content MathML markup that does not affect
the presentation of the expression. Identifying such discrepancies previously
required reading the verbose and complex MathML markup. VMEXT also allows one
to visualize similar and identical elements of two expressions. Visualizing
expression similarity can support support developers in designing retrieval
approaches and enable improved interaction concepts for users of mathematical
information retrieval systems. We demonstrate VMEXT's visualizations in two
web-based applications. The first application presents the visualizations
alone. The second application shows a possible integration of the
visualizations in systems for mathematical knowledge management and
mathematical information retrieval. The application converts LaTeX input to
parallel MathML, computes basic similarity measures for mathematical
expressions, and visualizes the results using VMEXT.
","[{'version': 'v1', 'created': 'Wed, 12 Jul 2017 04:57:45 GMT'}]",2018-04-16,"[['Schubotz', 'Moritz', ''], ['Meuschke', 'Norman', ''], ['Hepp', 'Thomas', ''], ['Cohl', 'Howard S.', ''], ['Gipp', 'Bela', '']]","['Mathematical Information Retrieval', 'Expression Tree', 'LATEX', 'MathML', 'Visualization']"
1551,1608.01038,Dawei Zhao,"Bo Gao, Dawei Zhao",Competing spreading processes and immunization in multiplex networks,,,10.1016/j.chaos.2016.10.013,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Epidemic spreading on physical contact network will naturally introduce the
human awareness information diffusion on virtual contact network, and the
awareness diffusion will in turn depress the epidemic spreading, thus forming
the competing spreading processes of epidemic and awareness in a multiplex
networks. In this paper, we study the competing dynamics of epidemic and
awareness, both of which follow the SIR process, in a two-layer networks based
on microscopic Markov chain approach and numerical simulations. We find that
strong capacities of awareness diffusion and self-protection of individuals
could lead to a much higher epidemic threshold and a smaller outbreak size.
However, the self-awareness of individuals has no obvious effect on the
epidemic threshold and outbreak size. In addition, the immunization of the
physical contact network under the interplay between of epidemic and awareness
spreading is also investigated. The targeted immunization is found performs
much better than random immunization, and the awareness diffusion could reduce
the immunization threshold for both type of random and targeted immunization
significantly.
","[{'version': 'v1', 'created': 'Wed, 3 Aug 2016 00:58:54 GMT'}]",2016-11-23,"[['Gao', 'Bo', ''], ['Zhao', 'Dawei', '']]","['competing spreading', 'immunization', 'multiplex network', 'threshold', 'outbreak size']"
1552,1108.4361,Alberto Pepe,Alberto Pepe,"The relationship between acquaintanceship and coauthorship in scientific
  collaboration networks",,"Journal of the American Society for Information Science and
  Technology 62(11): 2121--2132 (2011)",10.1002/asi.21629,,cs.CY cs.DL cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article examines the relationship between acquaintanceship and
coauthorship patterns in a multi-disciplinary, multi-institutional,
geographically distributed research center. Two social networks are constructed
and compared: a network of coauthorship, representing how researchers write
articles with one another, and a network of acquaintanceship, representing how
those researchers know each other on a personal level, based on their responses
to an online survey. Statistical analyses of the topology and community
structure of these networks point to the importance of small-scale, local,
personal networks predicated upon acquaintanceship for accomplishing
collaborative work in scientific communities.
","[{'version': 'v1', 'created': 'Mon, 22 Aug 2011 15:57:36 GMT'}]",2011-10-19,"[['Pepe', 'Alberto', '']]","['Scientific collaboration networks', 'scientific communities', 'coauthorship', 'acquaintanceship', 'community structure', 'survey research']"
1553,1612.04688,Poorna Dasgupta,Poorna Banerjee Dasgupta,"Algorithmic Analysis of Invisible Video Watermarking using LSB Encoding
  Over a Client-Server Framework","4 pages, Published with International Journal of Computer Trends and
  Technology (IJCTT), Volume-36 Number-3, June-2016","International Journal of Computer Trends and Technology (IJCTT)
  V36(3):143-146, June 2016",10.14445/22312803/IJCTT-V36P125,,cs.MM cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video watermarking is extensively used in many media-oriented applications
for embedding watermarks, i.e. hidden digital data, in a video sequence to
protect the video from illegal copying and to identify manipulations made in
the video. In case of an invisible watermark, the human eye can not perceive
any difference in the video, but a watermark extraction application can read
the watermark and obtain the embedded information. Although numerous
methodologies exist for embedding watermarks, many of them have shortcomings
with respect to performance efficiency, especially over a distributed network.
This paper proposes and analyses a 2-bit Least Significant Bit (LSB) parallel
algorithmic approach for achieving performance efficiency to watermark and
distribute videos over a client-server framework.
","[{'version': 'v1', 'created': 'Sun, 3 Jul 2016 12:39:53 GMT'}]",2016-12-15,"[['Dasgupta', 'Poorna Banerjee', '']]","['Video Watermarking', 'LSB Coding', 'Media Copy Control']"
1554,1802.08562,Artsiom Sanakoyeu,"Artsiom Sanakoyeu, Miguel A. Bautista, Bj\""orn Ommer",Deep Unsupervised Learning of Visual Similarities,arXiv admin note: text overlap with arXiv:1608.08792,"Pattern Recognition Volume 78, June 2018, Pages 331-343",10.1016/j.patcog.2018.01.036,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Exemplar learning of visual similarities in an unsupervised manner is a
problem of paramount importance to Computer Vision. In this context, however,
the recent breakthrough in deep learning could not yet unfold its full
potential. With only a single positive sample, a great imbalance between one
positive and many negatives, and unreliable relationships between most samples,
training of Convolutional Neural networks is impaired. In this paper we use
weak estimates of local similarities and propose a single optimization problem
to extract batches of samples with mutually consistent relations. Conflicting
relations are distributed over different batches and similar samples are
grouped into compact groups. Learning visual similarities is then framed as a
sequence of categorization tasks. The CNN then consolidates transitivity
relations within and between groups and learns a single representation for all
samples without the need for labels. The proposed unsupervised approach has
shown competitive performance on detailed posture analysis and object
classification.
","[{'version': 'v1', 'created': 'Thu, 22 Feb 2018 04:11:59 GMT'}]",2018-02-26,"[['Sanakoyeu', 'Artsiom', ''], ['Bautista', 'Miguel A.', ''], ['Ommer', 'Björn', '']]","['Visual Similarity Learning', 'Deep Learning', 'Self-supervised Learning', 'Human Pose Analysis', 'Object Retrieval']"
1555,1009.0961,M. Emre Celebi,"M. Emre Celebi, Hassan A. Kingravi, Bakhtiyar Uddin, Y. Alp Aslandogan",A Fast Switching Filter for Impulsive Noise Removal from Color Images,,Journal of Imaging Science and Technology 51 (2007) 155-165,10.2352/J.ImagingSci.Technol.(2007)51:2(155),,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a fast switching filter for impulsive noise removal
from color images. The filter exploits the HSL color space, and is based on the
peer group concept, which allows for the fast detection of noise in a
neighborhood without resorting to pairwise distance computations between each
pixel. Experiments on large set of diverse images demonstrate that the proposed
approach is not only extremely fast, but also gives excellent results in
comparison to various state-of-the-art filters.
","[{'version': 'v1', 'created': 'Mon, 6 Sep 2010 00:13:25 GMT'}]",2010-09-07,"[['Celebi', 'M. Emre', ''], ['Kingravi', 'Hassan A.', ''], ['Uddin', 'Bakhtiyar', ''], ['Aslandogan', 'Y. Alp', '']]","['color image processing', 'nonlinear vector filter', 'impulsive noise', 'HSL color space', 'switching filter', 'peer']"
1556,1610.02336,Ramin Yarinezhad,"Ramin Yarinezhad, Seyed Naser Hashemi","Approximation Algorithms for Multi-Multiway Cut and Multicut Problems on
  Directed Graphs","This version is completely correct and does not have any problem. All
  mistakes are corrected in this version. AUT Journal of Mathematics and
  Computing (2020)",,10.22060/AJMC.2018.15109.1014,,cs.DS cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present two approximation algorithms for the directed
multi-multiway cut and directed multicut problems. The so called region growing
paradigm \cite{1} is modified and used for these two cut problems on directed
graphs. By using this paradigm, we give for each problem an approximation
algorithm such that both algorithms have the approximate factor $O(k)$ the same
as the previous works done on these problems. However, the previous works need
to solve $k$ linear programming, whereas our algorithms require only one linear
programming. Therefore, our algorithms improve the running time of the previous
algorithms.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2016 16:09:43 GMT'}, {'version': 'v2', 'created': 'Sat, 3 Feb 2018 17:48:59 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Feb 2018 20:06:07 GMT'}, {'version': 'v4', 'created': 'Thu, 28 Mar 2019 17:21:43 GMT'}, {'version': 'v5', 'created': 'Sat, 30 Mar 2019 12:36:40 GMT'}]",2020-11-06,"[['Yarinezhad', 'Ramin', ''], ['Hashemi', 'Seyed Naser', '']]","['Approximation algorithm', 'Computational complexity', 'NP-hard problems', 'Directed multi']"
1557,2002.05583,Haosheng Chen,"Haosheng Chen, Qiangqiang Wu, Yanjie Liang, Xinbo Gao, Hanzi Wang","Asynchronous Tracking-by-Detection on Adaptive Time Surfaces for
  Event-based Object Tracking","9 pages, 5 figures","Proceedings of the 27th ACM International Conference on Multimedia
  (MM '19). 2019, Nice, France. ACM, New York, NY, USA",10.1145/3343031.3350975,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Event cameras, which are asynchronous bio-inspired vision sensors, have shown
great potential in a variety of situations, such as fast motion and low
illumination scenes. However, most of the event-based object tracking methods
are designed for scenarios with untextured objects and uncluttered backgrounds.
There are few event-based object tracking methods that support bounding
box-based object tracking. The main idea behind this work is to propose an
asynchronous Event-based Tracking-by-Detection (ETD) method for generic
bounding box-based object tracking. To achieve this goal, we present an
Adaptive Time-Surface with Linear Time Decay (ATSLTD) event-to-frame conversion
algorithm, which asynchronously and effectively warps the spatio-temporal
information of asynchronous retinal events to a sequence of ATSLTD frames with
clear object contours. We feed the sequence of ATSLTD frames to the proposed
ETD method to perform accurate and efficient object tracking, which leverages
the high temporal resolution property of event cameras. We compare the proposed
ETD method with seven popular object tracking methods, that are based on
conventional cameras or event cameras, and two variants of ETD. The
experimental results show the superiority of the proposed ETD method in
handling various challenging environments.
","[{'version': 'v1', 'created': 'Thu, 13 Feb 2020 15:58:31 GMT'}]",2020-02-14,"[['Chen', 'Haosheng', ''], ['Wu', 'Qiangqiang', ''], ['Liang', 'Yanjie', ''], ['Gao', 'Xinbo', ''], ['Wang', 'Hanzi', '']]","['Event-based Object Tracking', 'Event-based Object Detection', 'EventCamera', 'Adaptive Time Surface']"
1558,1807.03571,Min Wu,"Min Wu, Matthew Wicker, Wenjie Ruan, Xiaowei Huang, Marta Kwiatkowska","A Game-Based Approximate Verification of Deep Neural Networks with
  Provable Guarantees",,Theoretical Computer Science 807 (2020) 298-329,10.1016/j.tcs.2019.05.046,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the improved accuracy of deep neural networks, the discovery of
adversarial examples has raised serious safety concerns. In this paper, we
study two variants of pointwise robustness, the maximum safe radius problem,
which for a given input sample computes the minimum distance to an adversarial
example, and the feature robustness problem, which aims to quantify the
robustness of individual features to adversarial perturbations. We demonstrate
that, under the assumption of Lipschitz continuity, both problems can be
approximated using finite optimisation by discretising the input space, and the
approximation has provable guarantees, i.e., the error is bounded. We then show
that the resulting optimisation problems can be reduced to the solution of
two-player turn-based games, where the first player selects features and the
second perturbs the image within the feature. While the second player aims to
minimise the distance to an adversarial example, depending on the optimisation
objective the first player can be cooperative or competitive. We employ an
anytime approach to solve the games, in the sense of approximating the value of
a game by monotonically improving its upper and lower bounds. The Monte Carlo
tree search algorithm is applied to compute upper bounds for both games, and
the Admissible A* and the Alpha-Beta Pruning algorithms are, respectively, used
to compute lower bounds for the maximum safety radius and feature robustness
games. When working on the upper bound of the maximum safe radius problem, our
tool demonstrates competitive performance against existing adversarial example
crafting algorithms. Furthermore, we show how our framework can be deployed to
evaluate pointwise robustness of neural networks in safety-critical
applications such as traffic sign recognition in self-driving cars.
","[{'version': 'v1', 'created': 'Tue, 10 Jul 2018 11:28:46 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Mar 2019 22:21:11 GMT'}]",2020-04-07,"[['Wu', 'Min', ''], ['Wicker', 'Matthew', ''], ['Ruan', 'Wenjie', ''], ['Huang', 'Xiaowei', ''], ['Kwiatkowska', 'Marta', '']]","['Automated Verification', 'Deep Neural Networks', 'AdversarialExamples', 'Two-Player Game']"
1559,1904.03391,Hazrat Ali,"Sulaiman Khan, Hazrat Ali, Zahid Ullah, Nasru Minallah, Shahid
  Maqsood, Abdul Hafeez","KNN and ANN-based Recognition of Handwritten Pashto Letters using Zoning
  Features","(IJACSA) International Journal of Advanced Computer Science and
  Applications,","International Journal of Advanced Computer Science and
  Applications (IJACSA), 9(10), June 2018",10.14569/IJACSA.2018.091070,,cs.CV cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper presents a recognition system for handwritten Pashto letters.
However, handwritten character recognition is a challenging task. These letters
not only differ in shape and style but also vary among individuals. The
recognition becomes further daunting due to the lack of standard datasets for
inscribed Pashto letters. In this work, we have designed a database of moderate
size, which encompasses a total of 4488 images, stemming from 102
distinguishing samples for each of the 44 letters in Pashto. The recognition
framework uses zoning feature extractor followed by K-Nearest Neighbour (KNN)
and Neural Network (NN) classifiers for classifying individual letter. Based on
the evaluation of the proposed system, an overall classification accuracy of
approximately 70.05% is achieved by using KNN while 72% is achieved by using
NN.
","[{'version': 'v1', 'created': 'Sat, 6 Apr 2019 09:10:55 GMT'}, {'version': 'v2', 'created': 'Sat, 8 Jun 2019 15:49:26 GMT'}]",2019-06-11,"[['Khan', 'Sulaiman', ''], ['Ali', 'Hazrat', ''], ['Ullah', 'Zahid', ''], ['Minallah', 'Nasru', ''], ['Maqsood', 'Shahid', ''], ['Hafeez', 'Abdul', '']]","['KNN', 'deep neural network', 'OCR', 'zoning technique', 'Pashto', 'character recognition', 'classification']"
1560,0911.1685,Damien Chablat,"Liang Ma (IRCCyN), Wei Zhang (DIE), Damien Chablat (IRCCyN), Fouad
  Bennis (IRCCyN), Fran\c{c}ois Guillaume","Multi-Objective Optimisation Method for Posture Prediction and Analysis
  with Consideration of Fatigue Effect and its Application Case",,"Computers & Industrial Engineering 57, 4 (2009) 1235-1246",10.1016/j.cie.2009.06.003,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automation technique has been widely used in manufacturing industry, but
there are still manual handling operations required in assembly and maintenance
work in industry. Inappropriate posture and physical fatigue might result in
musculoskeletal disorders (MSDs) in such physical jobs. In ergonomics and
occupational biomechanics, virtual human modelling techniques have been
employed to design and optimize the manual operations in design stage so as to
avoid or decrease potential MSD risks. In these methods, physical fatigue is
only considered as minimizing the muscle or joint stress, and the fatigue
effect along time for the posture is not considered enough. In this study,
based on the existing methods and multiple objective optimisation method (MOO),
a new posture prediction and analysis method is proposed for predicting the
optimal posture and evaluating the physical fatigue in the manual handling
operation. The posture prediction and analysis problem is mathematically
described and a special application case is demonstrated for analyzing a
drilling assembly operation in European Aeronautic Defence & Space Company
(EADS) in this paper.
","[{'version': 'v1', 'created': 'Mon, 9 Nov 2009 13:57:25 GMT'}]",2009-11-10,"[['Ma', 'Liang', '', 'IRCCyN'], ['Zhang', 'Wei', '', 'DIE'], ['Chablat', 'Damien', '', 'IRCCyN'], ['Bennis', 'Fouad', '', 'IRCCyN'], ['Guillaume', 'François', '']]","['human simulation', 'posture analysis', 'posture prediction', 'joint discomfort', 'physical fatigue']"
1561,1810.07338,Sayed Chhattan Shah,Sayed Chhattan Shah,"A Mobile Ad hoc Cloud Computing and Networking Infrastructure for
  Automated Video Surveillance System","Technical Reports, 14 Pages","Journal of Computer Science, Volume 13, Issue 12, Pages 767-780,
  23-12-2017",10.3844/jcssp.2017.767.780,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile automated video surveillance system involves application of real-time
image and video processing algorithms which require a vast quantity of
computing and storage resources. To support the execution of mobile automated
video surveillance system, a mobile ad hoc cloud computing and networking
infrastructure is proposed in which multiple mobile devices interconnected
through a mobile ad hoc network are combined to create a virtual supercomputing
node. An energy efficient resource allocation scheme has also been proposed for
allocation of realtime automated video surveillance tasks. To enable
communication between mobile devices, a Wi-Fi Direct based mobile ad hoc cloud
networking infrastructure has been developed. More specifically, a routing
layer has been developed to support communication between Wi-Fi Direct devices
in a group and multi-hop communication between devices across the group. The
proposed system has been implemented on a group of Wi-Fi Direct-enabled Samsung
mobile devices.
","[{'version': 'v1', 'created': 'Tue, 16 Oct 2018 08:27:23 GMT'}]",2018-10-18,"[['Shah', 'Sayed Chhattan', '']]","['Mobile Cloud', 'Mobile AD Hoc Network', 'IoT Communication Infrastructure', 'Multi-hop Communication']"
1562,1908.01078,Amir Mosavi Prof,"Adrienn Dineva, Amir Mosavi, Mate Gyimesi, Istvan Vajda","Multi-label Classification for Fault Diagnosis of Rotating Electrical
  Machines","30 pages, 6 figures",,10.20944/preprints201908.0029.v1,,cs.LG eess.SP,http://creativecommons.org/licenses/by/4.0/,"  Primary importance is devoted to Fault Detection and Diagnosis (FDI) of
electrical machine and drive systems in modern industrial automation. The
widespread use of Machine Learning techniques has made it possible to replace
traditional motor fault detection techniques with more efficient solutions that
are capable of early fault recognition by using large amounts of sensory data.
However, the detection of concurrent failures is still a challenge in the
presence of disturbing noises or when the multiple faults cause overlapping
features. The contribution of this work is to propose a novel methodology using
multi-label classification method for simultaneously diagnosing multiple faults
and evaluating the fault severity under noisy conditions. Performance of
various multi-label classification models are compared. Current and vibration
signals are acquired under normal and fault conditions. The applicability of
the proposed method is experimentally validated under diverse fault conditions
such as unbalance and misalignment.
","[{'version': 'v1', 'created': 'Fri, 2 Aug 2019 22:05:55 GMT'}]",2019-08-06,"[['Dineva', 'Adrienn', ''], ['Mosavi', 'Amir', ''], ['Gyimesi', 'Mate', ''], ['Vajda', 'Istvan', '']]","['multiple fault detection', 'rotating electrical machines; drive systems', 'multi']"
1563,1807.10847,Bryan Head,Bryan Head and Uri Wilensky,"Agent cognition through micro-simulations: Adaptive and tunable
  intelligence with NetLogo LevelSpace","Model source code available here:
  https://github.com/qiemem/Wolf-Sheep-Predation-Micro-Sims, In: Unifying
  Themes in Complex Systems IX. ICCS 2018. Springer Proceedings in Complexity.
  Springer, Cham",,10.1007/978-3-319-96661-8_7,,cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We present a method of endowing agents in an agent-based model (ABM) with
sophisticated cognitive capabilities and a naturally tunable level of
intelligence. Often, ABMs use random behavior or greedy algorithms for
maximizing objectives (such as a predator always chasing after the closest
prey). However, random behavior is too simplistic in many circumstances and
greedy algorithms, as well as classic AI planning techniques, can be brittle in
the context of the unpredictable and emergent situations in which agents may
find themselves. Our method, called agent-centric Monte Carlo cognition
(ACMCC), centers around using a separate agent-based model to represent the
agents' cognition. This model is then used by the agents in the primary model
to predict the outcomes of their actions, and thus guide their behavior. To
that end, we have implemented our method in the NetLogo agent-based modeling
platform, using the recently released LevelSpace extension, which we developed
to allow NetLogo models to interact with other NetLogo models. As an
illustrative example, we extend the Wolf Sheep Predation model (included with
NetLogo) by using ACMCC to guide animal behavior, and analyze the impact on
agent performance and model dynamics. We find that ACMCC provides a reliable
and understandable method of controlling agent intelligence, and has a large
impact on agent performance and model dynamics even at low settings.
","[{'version': 'v1', 'created': 'Fri, 27 Jul 2018 22:33:40 GMT'}]",2018-07-31,"[['Head', 'Bryan', ''], ['Wilensky', 'Uri', '']]","['agent-based modeling', 'artificial intelligence', 'agent cognition', 'multi-level agent-based modeling', 'NetLogo']"
1564,1504.01380,Maitham Alhubail,Maitham Makki Alhubail and Qiqi Wang,The swept rule for breaking the latency barrier in time advancing PDEs,30 pages,"Journal of Computational Physics (2016), pp. 110-121",10.1016/j.jcp.2015.11.026,,cs.CE cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article investigates the swept rule of space-time domain decomposition,
an idea to break the latency barrier via communicating less often when
explicitly solving time-dependent PDEs. The swept rule decomposes space and
time among computing nodes in ways that exploit the domains of influence and
the domain of dependency, making it possible to communicate once per many
timesteps without redundant computation. The article presents simple
theoretical analysis to the performance of the swept rule which then was shown
to be accurate by conducting numerical experiments.
","[{'version': 'v1', 'created': 'Mon, 6 Apr 2015 16:00:32 GMT'}, {'version': 'v2', 'created': 'Sat, 14 Nov 2015 16:26:05 GMT'}]",2015-12-10,"[['Alhubail', 'Maitham Makki', ''], ['Wang', 'Qiqi', '']]","['Swept rule', 'Numerical solution of PDE', 'latency', 'Domain']"
1565,0906.5022,Tad Hogg,Tad Hogg and Robert A. Freitas Jr,Chemical Power for Microscopic Robots in Capillaries,"28 pages, 7 figures","Nanomedicine: Nanotechnology, Biology, and Medicine 6:298-317
  (2010)",10.1016/j.nano.2009.10.002,,cs.RO physics.bio-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The power available to microscopic robots (nanorobots) that oxidize
bloodstream glucose while aggregated in circumferential rings on capillary
walls is evaluated with a numerical model using axial symmetry and
time-averaged release of oxygen from passing red blood cells. Robots about one
micron in size can produce up to several tens of picowatts, in steady-state, if
they fully use oxygen reaching their surface from the blood plasma. Robots with
pumps and tanks for onboard oxygen storage could collect oxygen to support
burst power demands two to three orders of magnitude larger. We evaluate
effects of oxygen depletion and local heating on surrounding tissue. These
results give the power constraints when robots rely entirely on ambient
available oxygen and identify aspects of the robot design significantly
affecting available power. More generally, our numerical model provides an
approach to evaluating robot design choices for nanomedicine treatments in and
near capillaries.
","[{'version': 'v1', 'created': 'Fri, 26 Jun 2009 23:54:08 GMT'}]",2010-04-09,"[['Hogg', 'Tad', ''], ['Freitas', 'Robert A.', 'Jr']]","['nanomedicine', 'nanorobotics', 'capillary', 'power', 'numerical model', 'oxygen transport']"
1566,2102.10064,Mojtaba Barzegari,"Mojtaba Barzegari, Di Mei, Sviatlana V. Lamaka, Liesbet Geris","Computational modeling of degradation process of biodegradable magnesium
  biomaterials",,,10.1016/j.corsci.2021.109674,,cs.CE cond-mat.mtrl-sci,http://creativecommons.org/licenses/by/4.0/,"  Despite the advantages of using biodegradable metals in implant design, their
uncontrolled degradation and release remain a challenge in practical
applications. A validated computational model of the degradation process can
facilitate the tuning of implant biodegradation by changing design properties.
In this study, a physicochemical model was developed by deriving a mathematical
description of the chemistry of magnesium biodegradation and implementing it in
a 3D computational model. The model parameters were calibrated using the
experimental data of hydrogen evolution by performing a Bayesian optimization
routine. The model was validated by comparing the predicted change of pH in
saline and buffered solutions with the experimentally obtained values from
corrosion tests, showing maximum 5% of difference, demonstrating the model's
validity to be used for practical cases.
","[{'version': 'v1', 'created': 'Fri, 19 Feb 2021 17:51:50 GMT'}]",2021-07-28,"[['Barzegari', 'Mojtaba', ''], ['Mei', 'Di', ''], ['Lamaka', 'Sviatlana V.', ''], ['Geris', 'Liesbet', '']]","['Degradable metals', 'Magnesium corrosion', 'Reaction-diffusion models', 'Finiteelement method', 'In silico medicine']"
1567,1512.05569,Mohit Verma,Mohit Verma and J. Rajasankar,A thermodynamical approach towards multi-criteria decision making (MCDM),,"Applied Soft Computing 2017, Volume 52, Pages 323--332",10.1016/j.asoc.2016.10.033,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In multi-criteria decision making (MCDM) problems, ratings are assigned to
the alternatives on different criteria by the expert group. In this paper, we
propose a thermodynamically consistent model for MCDM using the analogies for
thermodynamical indicators - energy, exergy and entropy. The most commonly used
method for analysing MCDM problem is Technique for Order of Preference by
Similarity to Ideal Solution (TOPSIS). The conventional TOPSIS method uses a
measure similar to that of energy for the ranking of alternatives. We
demonstrate that the ranking of the alternatives is more meaningful if we use
exergy in place of energy. The use of exergy is superior due to the inclusion
of a factor accounting for the quality of the ratings by the expert group. The
unevenness in the ratings by the experts is measured by entropy. The procedure
for the calculation of the thermodynamical indicators is explained in both
crisp and fuzzy environment. Finally, two case studies are carried out to
demonstrate effectiveness of the proposed model.
","[{'version': 'v1', 'created': 'Thu, 17 Dec 2015 13:02:36 GMT'}]",2017-03-28,"[['Verma', 'Mohit', ''], ['Rajasankar', 'J.', '']]","['Thermodynamics', 'TOPSIS', 'MCDM', 'exergy', 'fuzzy']"
1568,1307.4299,Nisheeth Joshi,"Jyoti Singh, Nisheeth Joshi, Iti Mathur",Part of Speech Tagging of Marathi Text Using Trigram Method,"International Journal of Advanced Information Technology (IJAIT) Vol.
  3, No.2, April2013",,10.5121/ijait.2013.3203,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a Marathi part of speech tagger. It is a
morphologically rich language. It is spoken by the native people of
Maharashtra. The general approach used for development of tagger is statistical
using trigram Method. The main concept of trigram is to explore the most likely
POS for a token based on given information of previous two tags by calculating
probabilities to determine which is the best sequence of a tag. In this paper
we show the development of the tagger. Moreover we have also shown the
evaluation done.
","[{'version': 'v1', 'created': 'Mon, 15 Jul 2013 15:59:12 GMT'}]",2013-07-17,"[['Singh', 'Jyoti', ''], ['Joshi', 'Nisheeth', ''], ['Mathur', 'Iti', '']]","['Part of Speech Tagging', 'Stochastic Tagging', 'N-gram Modeling', 'Marathi']"
1569,1803.06596,Nathan Saraiva,"Nathan F. Saraiva de Sousa, Danny A. Lachos Perez, Raphael V. Rosa,
  Mateus A.S. Santos, and Christian Esteve Rothenberg",Network Service Orchestration: A Survey,Accepted for publication at Computer Communications Journal,,10.1016/j.comcom.2019.04.008,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Business models of network service providers are undergoing an evolving
transformation fueled by vertical customer demands and technological advances
such as 5G, Software Defined Networking~(SDN), and Network Function
Virtualization~(NFV). Emerging scenarios call for agile network services
consuming network, storage, and compute resources across heterogeneous
infrastructures and administrative domains. Coordinating resource control and
service creation across interconnected domains and diverse technologies becomes
a grand challenge. Research and development efforts are being devoted to
enabling orchestration processes to automate, coordinate, and manage the
deployment and operation of network services. In this survey, we delve into the
topic of Network Service Orchestration~(NSO) by reviewing the historical
background, relevant research projects, enabling technologies, and
standardization activities. We define key concepts and propose a taxonomy of
NSO approaches and solutions to pave the way towards a common understanding of
the various ongoing efforts around the realization of diverse NSO application
scenarios. Based on the analysis of the state of affairs, we present a series
of open challenges and research opportunities, altogether contributing to a
timely and comprehensive survey on the vibrant and strategic topic of network
service orchestration.
","[{'version': 'v1', 'created': 'Sun, 18 Mar 2018 03:16:41 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Mar 2018 20:13:05 GMT'}, {'version': 'v3', 'created': 'Mon, 12 Nov 2018 13:53:52 GMT'}, {'version': 'v4', 'created': 'Fri, 17 May 2019 13:24:31 GMT'}]",2019-05-20,"[['de Sousa', 'Nathan F. Saraiva', ''], ['Perez', 'Danny A. Lachos', ''], ['Rosa', 'Raphael V.', ''], ['Santos', 'Mateus A. S.', ''], ['Rothenberg', 'Christian Esteve', '']]","['Network Service Orchestration (NSO)', 'SDN', 'NFV', 'multi-domain', 'orchestration', 'virtualization', 'lifecyclemanagement']"
1570,1903.00438,Felix Hamza-Lup,"Felix G. Hamza-Lup, Ivan Sopin","Web-Based 3D and Haptic Interactive Environments for e-Learning,
  Simulation, and Training",ISBN:978-3-642-01343-0,,10.1007/978-3-642-01344-7_26,,cs.HC cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge creation occurs in the process of social interaction. As our
service-based society is evolving into a knowledge-based society there is an
acute need for more effective collaboration and knowledge-sharing systems to be
used by geographically scattered people. We present the use of Web3D components
and standards, such as X3D, in combination with the haptic (tactile) paradigm,
for the development of new communication channels for e-Learning and
simulation.
","[{'version': 'v1', 'created': 'Fri, 1 Mar 2019 17:58:06 GMT'}]",2019-03-06,"[['Hamza-Lup', 'Felix G.', ''], ['Sopin', 'Ivan', '']]","['Haptics', 'H3D', 'X3D', '3D Graphics']"
1571,1501.00834,Shun Kataoka,"Kazuyuki Tanaka, Shun Kataoka, Muneki Yasuda and Masayuki Ohzeki","Inverse Renormalization Group Transformation in Bayesian Image
  Segmentations","6 pages, 2 figures",Journal of the Physical Society of Japan 84 (2015) 045001,10.7566/JPSJ.84.045001,,cs.CV cond-mat.stat-mech stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new Bayesian image segmentation algorithm is proposed by combining a loopy
belief propagation with an inverse real space renormalization group
transformation to reduce the computational time. In results of our experiment,
we observe that the proposed method can reduce the computational time to less
than one-tenth of that taken by conventional Bayesian approaches.
","[{'version': 'v1', 'created': 'Mon, 5 Jan 2015 12:20:09 GMT'}]",2015-03-16,"[['Tanaka', 'Kazuyuki', ''], ['Kataoka', 'Shun', ''], ['Yasuda', 'Muneki', ''], ['Ohzeki', 'Masayuki', '']]","['statistical-mechanical informatics', 'Markov random fields', 'renormalization group']"
1572,1301.4659,Firoj Parwej Dr.,Firoj Parwej,"English Sentence Recognition using Artificial Neural Network through
  Mouse-based Gestures","6 Pages, 7 Figures. arXiv admin note: text overlap with
  arXiv:1007.0627 by other authors without attribution","International Journal of Computer Applications (IJCA)USA, Volume
  61, No.17, January 2013 ISSN 0975 - 8887, http://www.ijcaonline.org,
  http://www.ijcaonline.org/archives/volume61/number17/10023-4998",10.5120/10023-4998,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Handwriting is one of the most important means of daily communication.
Although the problem of handwriting recognition has been considered for more
than 60 years there are still many open issues, especially in the task of
unconstrained handwritten sentence recognition. This paper focuses on the
automatic system that recognizes continuous English sentence through a
mouse-based gestures in real-time based on Artificial Neural Network. The
proposed Artificial Neural Network is trained using the traditional
backpropagation algorithm for self supervised neural network which provides the
system with great learning ability and thus has proven highly successful in
training for feed-forward Artificial Neural Network. The designed algorithm is
not only capable of translating discrete gesture moves, but also continuous
gestures through the mouse. In this paper we are using the efficient neural
network approach for recognizing English sentence drawn by mouse. This approach
shows an efficient way of extracting the boundary of the English Sentence and
specifies the area of the recognition English sentence where it has been drawn
in an image and then used Artificial Neural Network to recognize the English
sentence. The proposed approach English sentence recognition (ESR) system is
designed and tested successfully. Experimental results show that the higher
speed and accuracy were examined.
","[{'version': 'v1', 'created': 'Sun, 20 Jan 2013 14:13:22 GMT'}]",2013-01-22,"[['Parwej', 'Firoj', '']]","['Recognition', 'Artificial Neural Network', 'Feature Extraction', 'Normalization', 'Preprocessing', 'English Word']"
1573,1903.10441,Gregory Moille,"Gregory Moille, Qing Li, Xiyuan Lu and Kartik Srinivasan",pyLLE: a Fast and User Friendly Lugiato-Lefever Equation Solver,,"Journal of Research of National Institute of Standards and
  Technology, Volume 124, Article No. 124012 (2019)",10.6028/jres.124.012,,cs.MS physics.optics,http://creativecommons.org/licenses/by/4.0/,"  We present the development of pyLLE, a freely accessible and cross-platform
Lugiato-Lefever equation solver programmed in Python and Julia and optimized
for the simulation of microresonator frequency combs. Examples illustrating its
operation, the simplicity of use, and performance against other programming
language are presented. The documentation of the software can be found at
https://gregmoille.github.io/pyLLE/
","[{'version': 'v1', 'created': 'Fri, 22 Mar 2019 17:38:23 GMT'}, {'version': 'v2', 'created': 'Thu, 30 May 2019 12:12:54 GMT'}]",2019-05-31,"[['Moille', 'Gregory', ''], ['Li', 'Qing', ''], ['Lu', 'Xiyuan', ''], ['Srinivasan', 'Kartik', '']]","['Python', 'Julia', 'Micro-Combs', 'Non-Linear Optics']"
1574,1404.1282,Dongwoo Kim,"Dongwoo Kim, Alice Oh",Hierarchical Dirichlet Scaling Process,,,10.1007/s10994-016-5621-5,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the \textit{hierarchical Dirichlet scaling process} (HDSP), a
Bayesian nonparametric mixed membership model. The HDSP generalizes the
hierarchical Dirichlet process (HDP) to model the correlation structure between
metadata in the corpus and mixture components. We construct the HDSP based on
the normalized gamma representation of the Dirichlet process, and this
construction allows incorporating a scaling function that controls the
membership probabilities of the mixture components. We develop two scaling
methods to demonstrate that different modeling assumptions can be expressed in
the HDSP. We also derive the corresponding approximate posterior inference
algorithms using variational Bayes. Through experiments on datasets of
newswire, medical journal articles, conference proceedings, and product
reviews, we show that the HDSP results in a better predictive performance than
labeled LDA, partially labeled LDA, and author topic model and a better
negative review classification performance than the supervised topic model and
SVM.
","[{'version': 'v1', 'created': 'Sat, 22 Mar 2014 06:25:51 GMT'}, {'version': 'v2', 'created': 'Mon, 12 May 2014 02:59:57 GMT'}, {'version': 'v3', 'created': 'Wed, 11 Feb 2015 05:17:27 GMT'}]",2017-07-10,"[['Kim', 'Dongwoo', ''], ['Oh', 'Alice', '']]","['Dirichlet process', 'hierarchical Dirichlet process', 'probabilistic topic model', 'Bayesian nonparametric model', 'labeled data']"
1575,1907.07496,Martin Maritsch,"Martin Maritsch, Caterina B\'erub\'e, Mathias Kraus, Vera Lehmann,
  Thomas Z\""uger, Stefan Feuerriegel, Tobias Kowatsch, Felix Wortmann","Improving Heart Rate Variability Measurements from Consumer Smartwatches
  with Machine Learning","Adjunct Proceedings of the 2019 ACM International Joint Conference on
  Pervasive and Ubiquitous Computing and the 2019 International Symposium on
  Wearable Computers",,10.1145/3341162.3346276,,cs.LG cs.HC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The reactions of the human body to physical exercise, psychophysiological
stress and heart diseases are reflected in heart rate variability (HRV). Thus,
continuous monitoring of HRV can contribute to determining and predicting
issues in well-being and mental health. HRV can be measured in everyday life by
consumer wearable devices such as smartwatches which are easily accessible and
affordable. However, they are arguably accurate due to the stability of the
sensor. We hypothesize a systematic error which is related to the wearer
movement. Our evidence builds upon explanatory and predictive modeling: we find
a statistically significant correlation between error in HRV measurements and
the wearer movement. We show that this error can be minimized by bringing into
context additional available sensor information, such as accelerometer data.
This work demonstrates our research-in-progress on how neural learning can
minimize the error of such smartwatch HRV measurements.
","[{'version': 'v1', 'created': 'Wed, 17 Jul 2019 13:16:57 GMT'}]",2019-07-18,"[['Maritsch', 'Martin', ''], ['Bérubé', 'Caterina', ''], ['Kraus', 'Mathias', ''], ['Lehmann', 'Vera', ''], ['Züger', 'Thomas', ''], ['Feuerriegel', 'Stefan', ''], ['Kowatsch', 'Tobias', ''], ['Wortmann', 'Felix', '']]","['neural networks', 'heart rate variability', 'smartwatch']"
1576,0908.3025,David Corne,David Corne and Joshua Knowles,"Techniques for Highly Multiobjective Optimisation: Some Nondominated
  Points are Better than Others","8 pages, 2 tables","in Hod Lipson (Ed.): Genetic and Evolutionary Computation
  Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11, 2007.
  ACM 2007, pp. 773--780, ISBN 978-1-59593-697-4",,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The research area of evolutionary multiobjective optimization (EMO) is
reaching better understandings of the properties and capabilities of EMO
algorithms, and accumulating much evidence of their worth in practical
scenarios. An urgent emerging issue is that the favoured EMO algorithms scale
poorly when problems have many (e.g. five or more) objectives. One of the chief
reasons for this is believed to be that, in many-objective EMO search,
populations are likely to be largely composed of nondominated solutions. In
turn, this means that the commonly-used algorithms cannot distinguish between
these for selective purposes. However, there are methods that can be used
validly to rank points in a nondominated set, and may therefore usefully
underpin selection in EMO search. Here we discuss and compare several such
methods. Our main finding is that simple variants of the often-overlooked
Average Ranking strategy usually outperform other methods tested, covering
problems with 5-20 objectives and differing amounts of inter-objective
correlation.
","[{'version': 'v1', 'created': 'Thu, 20 Aug 2009 21:44:32 GMT'}]",2009-08-24,"[['Corne', 'David', ''], ['Knowles', 'Joshua', '']]","['Multi-objective optimization', 'selection', 'ranking']"
1577,1305.6143,Vivek Narayanan,"Vivek Narayanan, Ishan Arora, Arjun Bhatia","Fast and accurate sentiment classification using an enhanced Naive Bayes
  model","8 pages, 2 figures","Intelligent Data Engineering and Automated Learning IDEAL 2013
  Lecture Notes in Computer Science Volume 8206, 2013, pp 194-201",10.1007/978-3-642-41278-3_24,,cs.CL cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We have explored different methods of improving the accuracy of a Naive Bayes
classifier for sentiment analysis. We observed that a combination of methods
like negation handling, word n-grams and feature selection by mutual
information results in a significant improvement in accuracy. This implies that
a highly accurate and fast sentiment classifier can be built using a simple
Naive Bayes model that has linear training and testing time complexities. We
achieved an accuracy of 88.80% on the popular IMDB movie reviews dataset.
","[{'version': 'v1', 'created': 'Mon, 27 May 2013 08:37:26 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Sep 2013 05:36:29 GMT'}]",2013-11-05,"[['Narayanan', 'Vivek', ''], ['Arora', 'Ishan', ''], ['Bhatia', 'Arjun', '']]","['Sentiment classification', 'Negation Handling', 'Mutual Information', 'Feature Selection', 'n-grams']"
1578,1806.02091,Andreas Hein M.,"Andreas Makoto Hein, H\'el\`ene Condat",Can Machines Design? An Artificial General Intelligence Approach,,,10.13140/RG.2.2.24564.45448,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Can machines design? Can they come up with creative solutions to problems and
build tools and artifacts across a wide range of domains? Recent advances in
the field of computational creativity and formal Artificial General
Intelligence (AGI) provide frameworks for machines with the general ability to
design. In this paper we propose to integrate a formal computational creativity
framework into the G\""odel machine framework. We call the resulting framework
design G\""odel machine. Such a machine could solve a variety of design problems
by generating novel concepts. In addition, it could change the way these
concepts are generated by modifying itself. The design G\""odel machine is able
to improve its initial design program, once it has proven that a modification
would increase its return on the utility function. Finally, we sketch out a
specific version of the design G\""odel machine which specifically addresses the
design of complex software and hardware systems. Future work aims at the
development of a more formal version of the design G\""odel machine and a proof
of concept implementation.
","[{'version': 'v1', 'created': 'Wed, 6 Jun 2018 09:41:58 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jun 2018 15:24:42 GMT'}, {'version': 'v3', 'created': 'Fri, 22 Jun 2018 22:42:46 GMT'}, {'version': 'v4', 'created': 'Tue, 26 Jun 2018 08:23:40 GMT'}]",2018-06-27,"[['Hein', 'Andreas Makoto', ''], ['Condat', 'Hélène', '']]","['Artificial General Intelligence', 'G¨odel Machine', 'Computational Creativity', 'Software Engineering', 'Systems Engineering', 'Design Theory', 'Reinforcement Learning']"
1579,1112.2044,Surekha Mariam Varghese Dr.,"Kurien Zacharia, Eldo P. Elias, Surekha Mariam Varghese",Modelling Gesture Based Ubiquitous Applications,"10 pages; The International Journal of Multimedia & Its Applications
  (IJMA) Vol.3, No.4, November 2011",,10.5121/ijma.2011.3403,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A cost effective, gesture based modelling technique called Virtual
Interactive Prototyping (VIP) is described in this paper. Prototyping is
implemented by projecting a virtual model of the equipment to be prototyped.
Users can interact with the virtual model like the original working equipment.
For capturing and tracking the user interactions with the model image and sound
processing techniques are used. VIP is a flexible and interactive prototyping
method that has much application in ubiquitous computing environments.
Different commercial as well as socio-economic applications and extension to
interactive advertising of VIP are also discussed.
","[{'version': 'v1', 'created': 'Fri, 9 Dec 2011 08:35:14 GMT'}]",2011-12-12,"[['Zacharia', 'Kurien', ''], ['Elias', 'Eldo P.', ''], ['Varghese', 'Surekha Mariam', '']]","['Rapid Prototyping', 'Virtual Reality', 'Ubiquitous Computing']"
1580,1806.11368,Benjamin Kellenberger,"Benjamin Kellenberger, Diego Marcos, Devis Tuia","Detecting Mammals in UAV Images: Best Practices to address a
  substantially Imbalanced Dataset with Deep Learning",,,10.1016/j.rse.2018.06.028,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge over the number of animals in large wildlife reserves is a vital
necessity for park rangers in their efforts to protect endangered species.
Manual animal censuses are dangerous and expensive, hence Unmanned Aerial
Vehicles (UAVs) with consumer level digital cameras are becoming a popular
alternative tool to estimate livestock. Several works have been proposed that
semi-automatically process UAV images to detect animals, of which some employ
Convolutional Neural Networks (CNNs), a recent family of deep learning
algorithms that proved very effective in object detection in large datasets
from computer vision. However, the majority of works related to wildlife
focuses only on small datasets (typically subsets of UAV campaigns), which
might be detrimental when presented with the sheer scale of real study areas
for large mammal census. Methods may yield thousands of false alarms in such
cases. In this paper, we study how to scale CNNs to large wildlife census tasks
and present a number of recommendations to train a CNN on a large UAV dataset.
We further introduce novel evaluation protocols that are tailored to censuses
and model suitability for subsequent human verification of detections. Using
our recommendations, we are able to train a CNN reducing the number of false
positives by an order of magnitude compared to previous state-of-the-art.
Setting the requirements at 90% recall, our CNN allows to reduce the amount of
data required for manual verification by three times, thus making it possible
for rangers to screen all the data acquired efficiently and to detect almost
all animals in the reserve automatically.
","[{'version': 'v1', 'created': 'Fri, 29 Jun 2018 11:59:14 GMT'}]",2018-07-02,"[['Kellenberger', 'Benjamin', ''], ['Marcos', 'Diego', ''], ['Tuia', 'Devis', '']]","['Animal census', 'Wildlife monitoring', 'Unmanned Aerial Vehicles', 'Object detection', 'Deep Learning', 'Convolutional Neural Networks']"
1581,1404.2512,Vaibhav Jha,"Vaibhav Jha, Sunny Deol, Mohit Jha and GK Sharma","Energy and Latency Aware Application Mapping Algorithm & Optimization
  for Homogeneous 3D Network on Chip","15 pages, 11 figure, CCSEA 2014",,10.5121/csit.2014.4302,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Energy efficiency is one of the most critical issue in design of System on
Chip. In Network On Chip (NoC) based system, energy consumption is influenced
dramatically by mapping of Intellectual Property (IP) which affect the
performance of the system. In this paper we test the antecedently extant
proposed algorithms and introduced a new energy proficient algorithm stand for
3D NoC architecture. In addition a hybrid method has also been implemented
using bioinspired optimization (particle swarm optimization) technique. The
proposed algorithm has been implemented and evaluated on randomly generated
benchmark and real life application such as MMS, Telecom and VOPD. The
algorithm has also been tested with the E3S benchmark and has been compared
with the existing algorithm (spiral and crinkle) and has shown better reduction
in the communication energy consumption and shows improvement in the
performance of the system. Comparing our work with spiral and crinkle,
experimental result shows that the average reduction in communication energy
consumption is 19% with spiral and 17% with crinkle mapping algorithms, while
reduction in communication cost is 24% and 21% whereas reduction in latency is
of 24% and 22% with spiral and crinkle. Optimizing our work and the existing
methods using bio-inspired technique and having the comparison among them an
average energy reduction is found to be of 18% and 24%.
","[{'version': 'v1', 'created': 'Mon, 7 Apr 2014 15:10:08 GMT'}]",2014-04-10,"[['Jha', 'Vaibhav', ''], ['Deol', 'Sunny', ''], ['Jha', 'Mohit', ''], ['Sharma', 'GK', '']]","['Network on Chip', 'Mapping', '3D Architecture', 'System on Chip', 'Optimization']"
1582,1309.1832,Prashanth  B.U.V,Prashanth B. U. V,"Design and Implementation of Wireless Energy Meter System for Monitoring
  the Single Phase Supply","4 pages, 10 figures, journal","IJCA 41(2):26-29,March 2012",10.5120/5514-7511,,cs.OH,http://creativecommons.org/licenses/by/3.0/,"  Wireless energy meter is a system developed to serve as a basic single-phase
energy meter with advanced functionalities such as Peak hour setting, Peak load
setting Wireless reading transmission; further the system eliminates the role
of a Meter Reader.
","[{'version': 'v1', 'created': 'Sat, 7 Sep 2013 07:48:51 GMT'}]",2013-09-10,"[['U.', 'Prashanth B.', 'V']]","['Single phase supply', 'WEM', 'Microcontroller']"
1583,1903.12505,Ronny Chevalier,"Ronny Chevalier (CIDRE), Stefano Cristalli, Christophe Hauser (USC),
  Yan Shoshitaishvili (ASU), Ruoyu Wang (ASU), Christopher Kruegel (CS-UCSB),
  Giovanni Vigna (CS-UCSB), Danilo Bruschi, Andrea Lanzi","BootKeeper: Validating Software Integrity Properties on Boot Firmware
  Images",,"Conference on Data and Application Security and Privacy (CODASPY),
  Mar 2019, Dallas, United States. ACM Press, pp.11, Proceedings of the 9th ACM
  Conference on Data and Application Security and Privacy.
  http://www.codaspy.org/",10.1145/3292006.3300026,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Boot firmware, like UEFI-compliant firmware, has been the target of numerous
attacks, giving the attacker control over the entire system while being
undetected. The measured boot mechanism of a computer platform ensures its
integrity by using cryptographic measurements to detect such attacks. This is
typically performed by relying on a Trusted Platform Module (TPM). Recent work,
however, shows that vendors do not respect the specifications that have been
devised to ensure the integrity of the firmware's loading process. As a result,
attackers may bypass such measurement mechanisms and successfully load a
modified firmware image while remaining unnoticed. In this paper we introduce
BootKeeper, a static analysis approach verifying a set of key security
properties on boot firmware images before deployment, to ensure the integrity
of the measured boot process. We evaluate BootKeeper against several attacks on
common boot firmware implementations and demonstrate its applicability.
","[{'version': 'v1', 'created': 'Fri, 29 Mar 2019 13:12:19 GMT'}]",2019-04-01,"[['Chevalier', 'Ronny', '', 'CIDRE'], ['Cristalli', 'Stefano', '', 'USC'], ['Hauser', 'Christophe', '', 'USC'], ['Shoshitaishvili', 'Yan', '', 'ASU'], ['Wang', 'Ruoyu', '', 'ASU'], ['Kruegel', 'Christopher', '', 'CS-UCSB'], ['Vigna', 'Giovanni', '', 'CS-UCSB'], ['Bruschi', 'Danilo', ''], ['Lanzi', 'Andrea', '']]","['firmware', 'TPM', 'SCRTM', 'binary analysis']"
1584,1709.06556,Matjaz Perc,"Kristina Ban, Matjaz Perc, Zoran Levnajic",Robust clustering of languages across Wikipedia growth,"9 two-column pages, 7 figures; accepted for publication in Royal
  Society Open Science","R. Soc. Open Sci. 4, 171217 (2017)",10.1098/rsos.171217,,cs.DL cs.SI physics.data-an physics.soc-ph stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wikipedia is the largest existing knowledge repository that is growing on a
genuine crowdsourcing support. While the English Wikipedia is the most
extensive and the most researched one with over five million articles,
comparatively little is known about the behavior and growth of the remaining
283 smaller Wikipedias, the smallest of which, Afar, has only one article. Here
we use a subset of this data, consisting of 14962 different articles, each of
which exists in 26 different languages, from Arabic to Ukrainian. We study the
growth of Wikipedias in these languages over a time span of 15 years. We show
that, while an average article follows a random path from one language to
another, there exist six well-defined clusters of Wikipedias that share common
growth patterns. The make-up of these clusters is remarkably robust against the
method used for their determination, as we verify via four different clustering
methods. Interestingly, the identified Wikipedia clusters have little
correlation with language families and groups. Rather, the growth of Wikipedia
across different languages is governed by different factors, ranging from
similarities in culture to information literacy.
","[{'version': 'v1', 'created': 'Mon, 18 Sep 2017 22:35:52 GMT'}]",2017-10-20,"[['Ban', 'Kristina', ''], ['Perc', 'Matjaz', ''], ['Levnajic', 'Zoran', '']]","['Wikipedia', 'language', 'growth patterns', 'data analysis', 'clustering']"
1585,1503.04999,Xiaoqiang Ren,"Xiaoqiang Ren, Karl H. Johansson, Dawei Shi, Ling Shi",Quickest Change Detection in Adaptive Censoring Sensor Networks,"12 pages, 6 figures, to appear in IEEE Transactions on Control of
  Network Systems",,10.1109/TCNS.2016.2598250,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of quickest change detection with communication rate constraints
is studied. A network of wireless sensors with limited computation capability
monitors the environment and sends observations to a fusion center via wireless
channels. At an unknown time instant, the distributions of observations at all
the sensor nodes change simultaneously. Due to limited energy, the sensors
cannot transmit at all the time instants. The objective is to detect the change
at the fusion center as quickly as possible, subject to constraints on false
detection and average communication rate between the sensors and the fusion
center. A minimax formulation is proposed. The cumulative sum (CuSum) algorithm
is used at the fusion center and censoring strategies are used at the sensor
nodes. The censoring strategies, which are adaptive to the CuSum statistic, are
fed back by the fusion center. The sensors only send observations that fall
into prescribed sets to the fusion center. This CuSum adaptive censoring
(CuSum-AC) algorithm is proved to be an equalizer rule and to be globally
asymptotically optimal for any positive communication rate constraint, as the
average run length to false alarm goes to infinity. It is also shown, by
numerical examples, that the CuSum-AC algorithm provides a suitable trade-off
between the detection performance and the communication rate.
","[{'version': 'v1', 'created': 'Tue, 17 Mar 2015 11:12:27 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Aug 2016 03:27:16 GMT'}]",2016-09-06,"[['Ren', 'Xiaoqiang', ''], ['Johansson', 'Karl H.', ''], ['Shi', 'Dawei', ''], ['Shi', 'Ling', '']]","['censoring', 'quickest change detection', 'minimax', 'CuSum', 'asymptotically optimal', 'adaptive', 'wireless sensor networks']"
1586,1810.07795,Markus Ring,"Markus Ring and Daniel Schl\""or and Dieter Landes and Andreas Hotho","Flow-based Network Traffic Generation using Generative Adversarial
  Networks","37 pages, submitted to Computer & Security",,10.1016/j.cose.2018.12.012,,cs.NI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Flow-based data sets are necessary for evaluating network-based intrusion
detection systems (NIDS). In this work, we propose a novel methodology for
generating realistic flow-based network traffic. Our approach is based on
Generative Adversarial Networks (GANs) which achieve good results for image
generation. A major challenge lies in the fact that GANs can only process
continuous attributes. However, flow-based data inevitably contain categorical
attributes such as IP addresses or port numbers. Therefore, we propose three
different preprocessing approaches for flow-based data in order to transform
them into continuous values. Further, we present a new method for evaluating
the generated flow-based network traffic which uses domain knowledge to define
quality tests. We use the three approaches for generating flow-based network
traffic based on the CIDDS-001 data set. Experiments indicate that two of the
three approaches are able to generate high quality data.
","[{'version': 'v1', 'created': 'Thu, 27 Sep 2018 11:31:43 GMT'}]",2019-03-07,"[['Ring', 'Markus', ''], ['Schlör', 'Daniel', ''], ['Landes', 'Dieter', ''], ['Hotho', 'Andreas', '']]","['GANs', 'TTUR WGAN-GP', 'NetFlow', 'Generation', 'IDS']"
1587,1505.02847,Patrick O'Callaghan PhD,Patrick H. O'Callaghan,Minimal conditions for parametric continuity of a utility representation,,"Journal of Mathematical Economics Volume 72, October 2017, Pages
  88-94",10.1016/j.jmateco.2017.07.004,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dependence on the parameter is continuous when perturbations of the parameter
preserves strict preference for one alternative over another. We characterise
this property via a utility function over alternatives that depends
continuously on the parameter. The class of parameter spaces where such a
representation is guaranteed to exist is also identified. When the parameter is
the type or belief of a player, these results have implications for Bayesian
and psychological games. When alternatives are discrete, the representation is
jointly continuous and an extension of Berge's theorem of the maximum yields a
continuous value function. We apply this result to generalise a standard
consumer choice problem where parameters are price-wealth vectors. When the
parameter space is lexicographically ordered, a novel application to
reference-dependent preferences is possible.
","[{'version': 'v1', 'created': 'Tue, 12 May 2015 01:23:33 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Mar 2019 14:16:41 GMT'}]",2019-04-01,"[[""O'Callaghan"", 'Patrick H.', '']]","['parametric continuity', 'preferences', 'utility representation']"
1588,1402.2695,Laura Deal,Laura Deal,Visualizing Digital Collections,"30 pages, 4 figures. This is a preprint of an article submitted for
  consideration in the Technical Services Quarterly (2014); Technical Services
  Quarterly is available online at:
  http://www.tandfonline.com/toc/wtsq20/current",,10.1080/07317131.2015.972871,,cs.DL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data visualizations can greatly enhance search in digital collections by
providing information about the scope and context of a collection and allowing
users to more easily browse and explore the contents. This article discusses
the benefits of incorporating visualizations into digital collections based on
the experiences of the Cold War International History Project (CWIHP) in
developing a user-friendly tool for searching and visualizing the project's
complex set of historical documents. The paper concludes with a tutorial on
using the free Library of Congress tool Viewshare to create visualizations
based on real data from the CWIHP Digital Archive.
","[{'version': 'v1', 'created': 'Tue, 11 Feb 2014 23:19:14 GMT'}]",2014-12-22,"[['Deal', 'Laura', '']]","['digital collections', 'digital libraries', 'data visualization']"
1589,1706.04140,Bharat Kale,"Bharat Kale, Harish Varma Siravuri, Hamed Alhoori and Michael E. Papka",Predicting Research that will be Cited in Policy Documents,2 page extended abstract submitted for ACM WebSci'17 conference,,10.1145/3091478.3098865,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scientific publications and other genres of research output are increasingly
being cited in policy documents. Citations in documents of this nature could be
considered a critical indicator of the significance and societal impact of the
research output. In this study, we built classification models that predict
whether a particular research work is likely to be cited in a public policy
document based on the attention it received online, primarily on social media
platforms. We evaluated the classifiers based on their accuracy, precision, and
recall values. We found that Random Forest and Multinomial Naive Bayes
classifiers performed better overall.
","[{'version': 'v1', 'created': 'Tue, 13 Jun 2017 16:00:39 GMT'}]",2017-06-14,"[['Kale', 'Bharat', ''], ['Siravuri', 'Harish Varma', ''], ['Alhoori', 'Hamed', ''], ['Papka', 'Michael E.', '']]","['Public Policy', 'Policy documents', 'Altmetrics', 'Social Media']"
1590,2208.04062,Bestoun Ahmed Dr.,"Ayan Chatterjee, Bestoun S. Ahmed, Erik Hallin, Anton Engman","Testing of Machine Learning Models with Limited Samples: An Industrial
  Vacuum Pumping Application",11 pages,"30th ACM Joint European Software Engineering Conference and
  Symposium on the Foundations of Software Engineering (ESEC/FSE 2022)",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is often a scarcity of training data for machine learning (ML)
classification and regression models in industrial production, especially for
time-consuming or sparsely run manufacturing processes. A majority of the
limited ground-truth data is used for training, while a handful of samples are
left for testing. Here, the number of test samples is inadequate to properly
evaluate the robustness of the ML models under test for classification and
regression. Furthermore, the output of these ML models may be inaccurate or
even fail if the input data differ from the expected. This is the case for ML
models used in the Electroslag Remelting (ESR) process in the refined steel
industry to predict the pressure in a vacuum chamber. A vacuum pumping event
that occurs once a workday generates a few hundred samples in a year of pumping
for training and testing. In the absence of adequate training and test samples,
this paper first presents a method to generate a fresh set of augmented samples
based on vacuum pumping principles. Based on the generated augmented samples,
three test scenarios and one test oracle are presented to assess the robustness
of an ML model used for production on an industrial scale. Experiments are
conducted with real industrial production data obtained from Uddeholms AB steel
company. The evaluations indicate that Ensemble and Neural Network are the most
robust when trained on augmented data using the proposed testing strategy. The
evaluation also demonstrates the proposed method's effectiveness in checking
and improving ML algorithms' robustness in such situations. The work improves
software testing's state-of-the-art robustness testing in similar settings.
Finally, the paper presents an MLOps implementation of the proposed approach
for real-time ML model prediction and action on the edge node and automated
continuous delivery of ML software from the cloud.
","[{'version': 'v1', 'created': 'Mon, 8 Aug 2022 11:19:41 GMT'}]",2022-08-09,"[['Chatterjee', 'Ayan', ''], ['Ahmed', 'Bestoun S.', ''], ['Hallin', 'Erik', ''], ['Engman', 'Anton', '']]","['data augmentation', 'software testing', 'vacuum pumping', 'data decomposition', 'machine learning', 'mlops']"
1591,1908.02414,Yuya Tsuda,"Yuya Tsuda, Atsushi Igarashi, Tomoya Tabuchi",Space-Efficient Gradual Typing in Coercion-Passing Style,,"34th European Conference on Object-Oriented Programming, ECOOP
  2020, volume 166 of LIPIcs, pages 8:1--8:29",10.4230/LIPIcs.ECOOP.2020.8,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Herman et al. pointed out that the insertion of run-time checks into a
gradually typed program could hamper tail-call optimization and, as a result,
worsen the space complexity of the program. To address the problem, they
proposed a space-efficient coercion calculus, which was subsequently improved
by Siek et al. The semantics of these calculi involves eager composition of
run-time checks expressed by coercions to prevent the size of a term from
growing. However, it relies also on a nonstandard reduction rule, which does
not seem easy to implement. In fact, no compiler implementation of gradually
typed languages fully supports the space-efficient semantics faithfully.
  In this paper, we study coercion-passing style, which Herman et al. have
already mentioned, as a technique for straightforward space-efficient
implementation of gradually typed languages. A program in coercion-passing
style passes ""the rest of the run-time checks"" around---just like
continuation-passing style (CPS), in which ""the rest of the computation"" is
passed around---and (unlike CPS) composes coercions eagerly. We give a formal
coercion-passing translation from $\lambda$S by Siek et al. to $\lambda$S$_1$,
which is a new calculus of first-class coercions tailored for coercion-passing
style, and prove correctness of the translation. We also implement our
coercion-passing style transformation for the Grift compiler developed by
Kuhlenschmidt et al. An experimental result shows stack overflow can be
prevented properly at the cost of up to 3 times slower execution for most
partially typed practical programs.
","[{'version': 'v1', 'created': 'Wed, 7 Aug 2019 01:40:24 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Nov 2020 14:31:33 GMT'}]",2020-11-11,"[['Tsuda', 'Yuya', ''], ['Igarashi', 'Atsushi', ''], ['Tabuchi', 'Tomoya', '']]","['Gradual typing', 'coercion calculus', 'coercion-passing style', 'dynamic typechecking', 'tail-call optimization']"
1592,1503.00709,Pradeep Kr. Banerjee,Pradeep Kr. Banerjee,"Some new insights into information decomposition in complex systems
  based on common information","17 pages, 5 figures, Conference Proceedings Paper, Entropy, Nov. 2014",,10.3390/ecea-1-c004,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We take a closer look at the structure of bivariate dependency induced by a
pair of predictor random variables $(X_1, X_2)$ trying to synergistically,
redundantly or uniquely encode a target random variable $Y$. We evaluate a
recently proposed measure of redundancy based on the G\'acs-K\""{o}rner common
information (Griffith et al., Entropy 2014) and show that the measure, in spite
of its elegance is degenerate for most non-trivial distributions. We show that
Wyner's common information also fails to capture the notion of redundancy as it
violates an intuitive monotonically non-increasing property. We identify a set
of conditions when a conditional version of G\'acs and K\""{o}rner's common
information is an ideal measure of unique information. Finally, we show how the
notions of approximately sufficient statistics and conditional information
bottleneck can be used to quantify unique information.
","[{'version': 'v1', 'created': 'Mon, 2 Mar 2015 20:55:13 GMT'}]",2015-03-03,"[['Banerjee', 'Pradeep Kr.', '']]","['synergy', 'redundancy', 'common information', 'information lattice', 'information bottleneck']"
1593,1905.03851,Francesco Fraternali,"Francesco Fraternali, Bharathan Balaji, Yuvraj Agarwal, Luca Benini,
  Rajesh Gupta","Demo Abstract: Pible: Battery-Free Mote for Perpetual Indoor BLE
  Applications",arXiv admin note: text overlap with arXiv:1812.04717,"BuildSys 2018 Proceedings of the 5th Conference on Systems for
  Built Environments",10.1145/3276774.3282823,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As of today, large-scale wireless sensor networks are adopted for smart
building applications as they are easy and flexible to deploy. Low-power
wireless nodes can achieve multi-year lifetimes with an AA battery using
Bluetooth Low Energy (BLE) and Zig-Bee. However, replacing these batteries at
scale is a non-trivial, labor-intensive task. Energy harvesting has emerged as
a potential solution to avoid battery replacement but requires compromises such
as application specific sensor node design, simplified communication protocol
or reduced quality of service. We show the design of a battery-free sensor node
using commercial off the shelf components, and present Pible: a Perpetual
Indoor BLE sensor node that uses an ambient light energy harvesting system and
can support numerous smart building applications. We show trade-offs between
node-lifetime, quality of service and light availability and present a
predictive algorithm that adapts to changing lighting conditions to maximize
node lifetime and application quality of service.
","[{'version': 'v1', 'created': 'Wed, 1 May 2019 20:50:45 GMT'}]",2019-05-13,"[['Fraternali', 'Francesco', ''], ['Balaji', 'Bharathan', ''], ['Agarwal', 'Yuvraj', ''], ['Benini', 'Luca', ''], ['Gupta', 'Rajesh', '']]","['Smart Buildings', 'Wireless Sensor Network', 'Energy-Harvesting']"
1594,1611.00675,Christian Himpe,Christian Himpe,emgr - The Empirical Gramian Framework,,"Algorithms 11(7): 91, 2018",10.3390/a11070091,,cs.MS cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  System Gramian matrices are a well-known encoding for properties of
input-output systems such as controllability, observability or minimality.
These so-called system Gramians were developed in linear system theory for
applications such as model order reduction of control systems. Empirical
Gramian are an extension to the system Gramians for parametric and nonlinear
systems as well as a data-driven method of computation. The empirical Gramian
framework - emgr - implements the empirical Gramians in a uniform and
configurable manner, with applications such as Gramian-based (nonlinear) model
reduction, decentralized control, sensitivity analysis, parameter
identification and combined state and parameter reduction.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2016 16:39:06 GMT'}, {'version': 'v2', 'created': 'Mon, 28 May 2018 11:47:47 GMT'}]",2018-09-14,"[['Himpe', 'Christian', '']]","['empirical gramians', 'cross gramian', 'combined reduction']"
1595,1403.5089,Ranga Prasad,"Ranga Prasad, Srikrishna Bhashyam, and A. Chockalingam",On the Gaussian Many-to-One X Channel,"Submitted to IEEE Transactions on Information Theory; Revised and
  updated version of the original draft",,10.1109/TIT.2015.2499746,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the Gaussian many-to-one X channel, which is a special case of
general multiuser X channel, is studied. In the Gaussian many-to-one X channel,
communication links exist between all transmitters and one of the receivers,
along with a communication link between each transmitter and its corresponding
receiver. As per the X channel assumption, transmission of messages is allowed
on all the links of the channel. This communication model is different from the
corresponding many-to-one interference channel (IC). Transmission strategies
which involve using Gaussian codebooks and treating interference from a subset
of transmitters as noise are formulated for the above channel. Sum-rate is used
as the criterion of optimality for evaluating the strategies. Initially, a $3
\times 3$ many-to-one X channel is considered and three transmission strategies
are analyzed. The first two strategies are shown to achieve sum-rate capacity
under certain channel conditions. For the third strategy, a sum-rate outer
bound is derived and the gap between the outer bound and the achieved rate is
characterized. These results are later extended to the $K \times K$ case. Next,
a region in which the many-to-one X channel can be operated as a many-to-one IC
without loss of sum-rate is identified. Further, in the above region, it is
shown that using Gaussian codebooks and treating interference as noise achieves
a rate point that is within $K/2 -1$ bits from the sum-rate capacity.
Subsequently, some implications of the above results to the Gaussian
many-to-one IC are discussed. Transmission strategies for the many-to-one IC
are formulated and channel conditions under which the strategies achieve
sum-rate capacity are obtained. A region where the sum-rate capacity can be
characterized to within $K/2-1$ bits is also identified.
","[{'version': 'v1', 'created': 'Thu, 20 Mar 2014 10:31:29 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Jun 2015 17:18:17 GMT'}]",2016-11-17,"[['Prasad', 'Ranga', ''], ['Bhashyam', 'Srikrishna', ''], ['Chockalingam', 'A.', '']]","['Many-to-one interference channel', 'interference channel', 'X channel', 'sum capacity']"
1596,2101.09808,Rui Li,"Rui Li, Yufan Xu, Aravind Sukumaran-Rajam, Atanas Rountev, and P.
  Sadayappan","Analytical Characterization and Design Space Exploration for
  Optimization of CNNs","In proceedings of the 26th ACM International Conference on
  Architectural Support for Programming Languages and Operating Systems (ASPLOS
  '21), April 19-23, 2021, Virtual, USA","Proceedings of the 26th ACM International Conference on
  Architectural Support for Programming Languages and Operating Systems, 2021",10.1145/3445814.3446759,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Moving data through the memory hierarchy is a fundamental bottleneck that can
limit the performance of core algorithms of machine learning, such as
convolutional neural networks (CNNs). Loop-level optimization, including loop
tiling and loop permutation, are fundamental transformations to reduce data
movement. However, the search space for finding the best loop-level
optimization configuration is explosively large. This paper develops an
analytical modeling approach for finding the best loop-level optimization
configuration for CNNs on multi-core CPUs. Experimental evaluation shows that
this approach achieves comparable or better performance than state-of-the-art
libraries and auto-tuning based optimizers for CNNs.
","[{'version': 'v1', 'created': 'Sun, 24 Jan 2021 21:36:52 GMT'}, {'version': 'v2', 'created': 'Sat, 6 Mar 2021 00:40:24 GMT'}]",2021-04-13,"[['Li', 'Rui', ''], ['Xu', 'Yufan', ''], ['Sukumaran-Rajam', 'Aravind', ''], ['Rountev', 'Atanas', ''], ['Sadayappan', 'P.', '']]","['Neural networks', 'Design space exploration', 'Tile size optimization', 'Performance modeling']"
1597,1810.07135,Susan Stepney,"Matthew Dale, Julian F. Miller, Susan Stepney, Martin A. Trefzer",A Substrate-Independent Framework to Characterise Reservoir Computers,addition of a further substrate: a simulated delay-based reservoir,"Proc.Roy.Soc.A 475(2226), 2019",10.1098/rspa.2018.0723,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Reservoir Computing (RC) framework states that any non-linear,
input-driven dynamical system (the reservoir) exhibiting properties such as a
fading memory and input separability can be trained to perform computational
tasks. This broad inclusion of systems has led to many new physical substrates
for RC. Properties essential for reservoirs to compute are tuned through
reconfiguration of the substrate, such as change in virtual topology or
physical morphology. As a result, each substrate possesses a unique `quality'
-- obtained through reconfiguration -- to realise different reservoirs for
different tasks. Here we describe an experimental framework to characterise the
quality of potentially any substrate for RC. Our framework reveals that a
definition of quality is not only useful to compare substrates, but can help
map the non-trivial relationship between properties and task performance. In
the wider context, the framework offers a greater understanding as to what
makes a dynamical system compute, helping improve the design of future
substrates for RC.
","[{'version': 'v1', 'created': 'Tue, 16 Oct 2018 16:59:37 GMT'}, {'version': 'v2', 'created': 'Mon, 20 May 2019 18:14:03 GMT'}]",2019-06-20,"[['Dale', 'Matthew', ''], ['Miller', 'Julian F.', ''], ['Stepney', 'Susan', ''], ['Trefzer', 'Martin A.', '']]","['Reservoir Computing', 'Physical Computation', 'Substrate Characterisation', 'DynamicalProperties']"
1598,1611.08868,Daniel M\'endez Fern\'andez,"J. Eckhardt, A. Vogelsang, D. M\'endez Fern\'andez","Are ""Non-functional"" Requirements really Non-functional?","Proceedings of the 38th International Conference on Software
  Engineering, 2016",,10.1145/2884781.2884788,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Non-functional requirements (NFRs) are commonly distinguished from functional
requirements by differentiating how the system shall do something in contrast
to what the system shall do. This distinction is not only prevalent in
research, but also influences how requirements are handled in practice. NFRs
are usually documented separately from functional requirements, without
quantitative measures, and with relatively vague descriptions. As a result,
they remain difficult to analyze and test. Several authors argue, however, that
many so-called NFRs actually describe behavioral properties and may be treated
the same way as functional requirements. In this paper, we empirically
investigate this point of view and aim to increase our understanding on the
nature of NFRs addressing system properties. We report on the classification of
530 NFRs extracted from 11 industrial requirements specifications and analyze
to which extent these NFRs describe system behavior. Our results suggest that
most ""non-functional"" requirements are not non-functional as they describe
behavior of a system. Consequently, we argue that many so-called NFRs can be
handled similarly to functional requirements.
","[{'version': 'v1', 'created': 'Sun, 27 Nov 2016 15:44:05 GMT'}]",2016-11-29,"[['Eckhardt', 'J.', ''], ['Vogelsang', 'A.', ''], ['Fernández', 'D. Méndez', '']]","['Non-functional requirements', 'classification', 'model-based development', 'empirical studies']"
1599,1407.5383,Jae Oh Woo,"Narayana P. Santhanam, Anand D. Sarwate and Jae Oh Woo",Redundancy of Exchangeable Estimators,18 pages,,10.3390/e16105339,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Exchangeable random partition processes are the basis for Bayesian approaches
to statistical inference in large alphabet settings. On the other hand, the
notion of the pattern of a sequence provides an information-theoretic framework
for data compression in large alphabet scenarios. Because data compression and
parameter estimation are intimately related, we study the redundancy of Bayes
estimators coming from Poisson-Dirichlet priors (or ""Chinese restaurant
processes"") and the Pitman-Yor prior. This provides an understanding of these
estimators in the setting of unknown discrete alphabets from the perspective of
universal compression. In particular, we identify relations between alphabet
sizes and sample sizes where the redundancy is small, thereby characterizing
useful regimes for these estimators.
","[{'version': 'v1', 'created': 'Mon, 21 Jul 2014 06:44:42 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Sep 2014 15:50:22 GMT'}, {'version': 'v3', 'created': 'Sat, 11 Oct 2014 21:45:39 GMT'}, {'version': 'v4', 'created': 'Tue, 21 Oct 2014 02:44:53 GMT'}]",2014-10-22,"[['Santhanam', 'Narayana P.', ''], ['Sarwate', 'Anand D.', ''], ['Woo', 'Jae Oh', '']]","['exchangeability', 'random exchangeable partitions', 'Chinese restaurant process', 'Pitman Yor process', 'strong', 'weak universal compression']"
1600,1612.01428,Seyed Mohammad Taheri,"Seyed Mohammad Taheri, Hamidreza Mahyar, Mohammad Firouzi, Elahe
  Ghalebi K., Radu Grosu, Ali Movaghar","Extracting Implicit Social Relation for Social Recommendation Techniques
  in User Rating Prediction",,,10.1145/3041021.3051153,,cs.SI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommendation plays an increasingly important role in our daily lives.
Recommender systems automatically suggest items to users that might be
interesting for them. Recent studies illustrate that incorporating social trust
in Matrix Factorization methods demonstrably improves accuracy of rating
prediction. Such approaches mainly use the trust scores explicitly expressed by
users. However, it is often challenging to have users provide explicit trust
scores of each other. There exist quite a few works, which propose Trust
Metrics to compute and predict trust scores between users based on their
interactions. In this paper, first we present how social relation can be
extracted from users' ratings to items by describing Hellinger distance between
users in recommender systems. Then, we propose to incorporate the predicted
trust scores into social matrix factorization models. By analyzing social
relation extraction from three well-known real-world datasets, which both:
trust and recommendation data available, we conclude that using the implicit
social relation in social recommendation techniques has almost the same
performance compared to the actual trust scores explicitly expressed by users.
Hence, we build our method, called Hell-TrustSVD, on top of the
state-of-the-art social recommendation technique to incorporate both the
extracted implicit social relations and ratings given by users on the
prediction of items for an active user. To the best of our knowledge, this is
the first work to extend TrustSVD with extracted social trust information. The
experimental results support the idea of employing implicit trust into matrix
factorization whenever explicit trust is not available, can perform much better
than the state-of-the-art approaches in user rating prediction.
","[{'version': 'v1', 'created': 'Mon, 5 Dec 2016 16:47:02 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Mar 2017 15:23:15 GMT'}]",2017-04-25,"[['Taheri', 'Seyed Mohammad', ''], ['Mahyar', 'Hamidreza', ''], ['Firouzi', 'Mohammad', ''], ['K.', 'Elahe Ghalebi', ''], ['Grosu', 'Radu', ''], ['Movaghar', 'Ali', '']]","['Social Recommendation Techniques', 'Matrix Factorization', 'Recommender Systems', 'Social Networks']"
1601,1803.01696,Hans van Ditmarsch,"Hans van Ditmarsch, Tim French, James Hales",Positive Announcements,,"Studia Logica 109(3): 639-681, 2021",10.1007/s11225-020-09922-1,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Arbitrary public announcement logic (APAL) reasons about how the knowledge of
a set of agents changes after true public announcements and after arbitrary
announcements of true epistemic formulas. We consider a variant of arbitrary
public announcement logic called positive arbitrary public announcement logic
(APAL+), which restricts arbitrary public announcements to announcement of
positive formulas. Positive formulas prohibit statements about the ignorance of
agents. The positive formulas correspond to the universal fragment in
first-order logic. As two successive announcements of positive formulas need
not correspond to the announcement of a positive formula, APAL+ is rather
different from APAL. We show that APAL+ is more expressive than public
announcement logic PAL, and that APAL+ is incomparable with APAL. We also
provide a sound and complete infinitary axiomatisation.
","[{'version': 'v1', 'created': 'Mon, 5 Mar 2018 14:51:31 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Jan 2019 15:49:08 GMT'}, {'version': 'v3', 'created': 'Wed, 19 Feb 2020 06:49:46 GMT'}, {'version': 'v4', 'created': 'Wed, 22 Jul 2020 06:42:15 GMT'}]",2021-11-30,"[['van Ditmarsch', 'Hans', ''], ['French', 'Tim', ''], ['Hales', 'James', '']]","['Dynamic Epistemic Logic', 'Multi-agent Systems', 'Universal Formulas']"
1602,0902.4106,Shih-Chun  Lin,"Shih-Chun Lin, Pin-Hsun Lin, Chung-Pi Lee, Hsuan-Jung Su","Filter and nested-lattice code design for fading MIMO channels with
  side-information","submitted to IEEE Transactions on Communications, Feb, 2009","IEEE Transactions on Communications, vol. 59. No. 6, pp. 1489 -
  1494, June 2011",10.1109/TCOMM.2011.050211.090113A,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linear-assignment Gel'fand-Pinsker coding (LA-GPC) is a coding technique for
channels with interference known only at the transmitter, where the known
interference is treated as side-information (SI). As a special case of LA-GPC,
dirty paper coding has been shown to be able to achieve the optimal
interference-free rate for interference channels with perfect channel state
information at the transmitter (CSIT). In the cases where only the channel
distribution information at the transmitter (CDIT) is available, LA-GPC also
has good (sometimes optimal) performance in a variety of fast and slow fading
SI channels. In this paper, we design the filters in nested-lattice based
coding to make it achieve the same rate performance as LA-GPC in multiple-input
multiple-output (MIMO) channels. Compared with the random Gaussian codebooks
used in previous works, our resultant coding schemes have an algebraic
structure and can be implemented in practical systems. A simulation in a
slow-fading channel is also provided, and near interference-free error
performance is obtained. The proposed coding schemes can serve as the
fundamental building blocks to achieve the promised rate performance of MIMO
Gaussian broadcast channels with CDIT or perfect CSIT
","[{'version': 'v1', 'created': 'Tue, 24 Feb 2009 09:54:57 GMT'}]",2011-06-28,"[['Lin', 'Shih-Chun', ''], ['Lin', 'Pin-Hsun', ''], ['Lee', 'Chung-Pi', ''], ['Su', 'Hsuan-Jung', '']]","['MMSE filter', 'lattice coding', 'dirty paper coding']"
1603,1006.0701,Marius Zimand,Marius Zimand,"Impossibility of independence amplification in Kolmogorov complexity
  theory",,,10.1007/978-3-642-15155-2_61,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper studies randomness extraction from sources with bounded
independence and the issue of independence amplification of sources, using the
framework of Kolmogorov complexity. The dependency of strings $x$ and $y$ is
${\rm dep}(x,y) = \max\{C(x) - C(x \mid y), C(y) - C(y\mid x)\}$, where
$C(\cdot)$ denotes the Kolmogorov complexity. It is shown that there exists a
computable Kolmogorov extractor $f$ such that, for any two $n$-bit strings with
complexity $s(n)$ and dependency $\alpha(n)$, it outputs a string of length
$s(n)$ with complexity $s(n)- \alpha(n)$ conditioned by any one of the input
strings. It is proven that the above are the optimal parameters a Kolmogorov
extractor can achieve. It is shown that independence amplification cannot be
effectively realized. Specifically, if (after excluding a trivial case) there
exist computable functions $f_1$ and $f_2$ such that ${\rm dep}(f_1(x,y),
f_2(x,y)) \leq \beta(n)$ for all $n$-bit strings $x$ and $y$ with ${\rm
dep}(x,y) \leq \alpha(n)$, then $\beta(n) \geq \alpha(n) - O(\log n)$.
","[{'version': 'v1', 'created': 'Thu, 3 Jun 2010 17:31:14 GMT'}]",2015-05-19,"[['Zimand', 'Marius', '']]","['Kolmogorov complexity', 'random strings', 'independent strings', 'randomness extraction']"
1604,1705.04839,Firoj Alam,"Firoj Alam, Morena Danieli and Giuseppe Riccardi",Annotating and Modeling Empathy in Spoken Conversations,Journal of Computer Speech and Language,,10.1016/j.csl.2017.12.003,,cs.CL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Empathy, as defined in behavioral sciences, expresses the ability of human
beings to recognize, understand and react to emotions, attitudes and beliefs of
others. The lack of an operational definition of empathy makes it difficult to
measure it. In this paper, we address two related problems in automatic
affective behavior analysis: the design of the annotation protocol and the
automatic recognition of empathy from spoken conversations. We propose and
evaluate an annotation scheme for empathy inspired by the modal model of
emotions. The annotation scheme was evaluated on a corpus of real-life, dyadic
spoken conversations. In the context of behavioral analysis, we designed an
automatic segmentation and classification system for empathy. Given the
different speech and language levels of representation where empathy may be
communicated, we investigated features derived from the lexical and acoustic
spaces. The feature development process was designed to support both the fusion
and automatic selection of relevant features from high dimensional space. The
automatic classification system was evaluated on call center conversations
where it showed significantly better performance than the baseline.
","[{'version': 'v1', 'created': 'Sat, 13 May 2017 14:49:08 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Dec 2017 20:13:29 GMT'}, {'version': 'v3', 'created': 'Fri, 29 Dec 2017 12:52:49 GMT'}]",2018-01-01,"[['Alam', 'Firoj', ''], ['Danieli', 'Morena', ''], ['Riccardi', 'Giuseppe', '']]","['Empathy', 'Emotion', 'Spoken Conversation', 'Behavior Analysis', 'Affective Scene', 'Affect', 'Call Center', 'Human-Human Conversation']"
1605,1308.5706,Jason McEwen,"J. D. McEwen, P. Vandergheynst, Y. Wiaux","On the computation of directional scale-discretized wavelet transforms
  on the sphere","13 pages, 3 figures, Proceedings of Wavelets and Sparsity XV, SPIE
  Optics and Photonics 2013, Code is publicly available at http://www.s2dw.org/","Proc. SPIE 8858, Wavelets and Sparsity XV, 88580I (2013)",10.1117/12.2022889,,cs.IT astro-ph.IM math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We review scale-discretized wavelets on the sphere, which are directional and
allow one to probe oriented structure in data defined on the sphere.
Furthermore, scale-discretized wavelets allow in practice the exact synthesis
of a signal from its wavelet coefficients. We present exact and efficient
algorithms to compute the scale-discretized wavelet transform of band-limited
signals on the sphere. These algorithms are implemented in the publicly
available S2DW code. We release a new version of S2DW that is parallelized and
contains additional code optimizations. Note that scale-discretized wavelets
can be viewed as a directional generalization of needlets. Finally, we outline
future improvements to the algorithms presented, which can be achieved by
exploiting a new sampling theorem on the sphere developed recently by some of
the authors.
","[{'version': 'v1', 'created': 'Mon, 26 Aug 2013 21:35:58 GMT'}]",2013-12-10,"[['McEwen', 'J. D.', ''], ['Vandergheynst', 'P.', ''], ['Wiaux', 'Y.', '']]","['Sphere', 'sampling theorem', 'wavelet transform']"
1606,1507.03767,Daniel Graziotin,"Daniel Graziotin, Xiaofeng Wang, and Pekka Abrahamsson","Understanding the Affect of Developers: Theoretical Background and
  Guidelines for Psychoempirical Software Engineering","9 pages, 2 figures","7th Intl. Workshop on Social Software Engineering, pp. 25-32, 2015",10.1145/2804381.2804386,,cs.SE cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Affects---emotions and moods---have an impact on cognitive processing
activities and the working performance of individuals. It has been established
that software development tasks are undertaken through cognitive processing
activities. Therefore, we have proposed to employ psychology theory and
measurements in software engineering (SE) research. We have called it
""psychoempirical software engineering"". However, we found out that existing SE
research has often fallen into misconceptions about the affect of developers,
lacking in background theory and how to successfully employ psychological
measurements in studies. The contribution of this paper is threefold. (1) It
highlights the challenges to conduct proper affect-related studies with
psychology; (2) it provides a comprehensive literature review in affect theory;
and (3) it proposes guidelines for conducting psychoempirical software
engineering.
","[{'version': 'v1', 'created': 'Tue, 14 Jul 2015 08:44:54 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Sep 2015 14:20:20 GMT'}]",2015-09-18,"[['Graziotin', 'Daniel', ''], ['Wang', 'Xiaofeng', ''], ['Abrahamsson', 'Pekka', '']]","['Affects', 'emotions', 'moods', 'human aspects in software development', 'psychology of programming', 'psychoempirical softwareengineering']"
1607,1007.2280,Guoqiang Zhang,Guoqiang Zhang and Bruno Quoitin and Shi Zhou,"Phase Changes in the Evolution of the IPv4 and IPv6 AS-Level Internet
  Topologies","12 pages, 21 figures; G. Zhang et al.,Phase changes in the evolution
  of the IPv4 and IPv6 AS-Level Internet topologies, Comput. Commun. (2010)",,10.1016/j.comcom.2010.06.004,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we investigate the evolution of the IPv4 and IPv6 Internet
topologies at the autonomous system (AS) level over a long period of time.We
provide abundant empirical evidence that there is a phase transition in the
growth trend of the two networks. For the IPv4 network, the phase change
occurred in 2001. Before then the network's size grew exponentially, and
thereafter it followed a linear growth. Changes are also observed around the
same time for the maximum node degree, the average node degree and the average
shortest path length. For the IPv6 network, the phase change occurred in late
2006. It is notable that the observed phase transitions in the two networks are
different, for example the size of IPv6 network initially grew linearly and
then shifted to an exponential growth. Our results show that following decades
of rapid expansion up to the beginning of this century, the IPv4 network has
now evolved into a mature, steady stage characterised by a relatively slow
growth with a stable network structure; whereas the IPv6 network, after a slow
startup process, has just taken off to a full speed growth. We also provide
insight into the possible impact of IPv6-over-IPv4 tunneling deployment scheme
on the evolution of the IPv6 network. The Internet topology generators so far
are based on an inexplicit assumption that the evolution of Internet follows
non-changing dynamic mechanisms. This assumption, however, is invalidated by
our results.Our work reveals insights into the Internet evolution and provides
inputs to future AS-Level Internet models.
","[{'version': 'v1', 'created': 'Wed, 14 Jul 2010 08:56:57 GMT'}]",2010-07-15,"[['Zhang', 'Guoqiang', ''], ['Quoitin', 'Bruno', ''], ['Zhou', 'Shi', '']]","['Internet', 'autonomous systems (AS)', 'topology', 'network evolution', 'IPv4', 'IPv6', 'phase change', 'networkmodels']"
1608,1608.05246,Kadir Kirtac,"Samil Karahan, Merve Kilinc Yildirim, Kadir Kirtac, Ferhat Sukru
  Rende, Gultekin Butun, Hazim Kemal Ekenel",How Image Degradations Affect Deep CNN-based Face Recognition?,"8 pages, 3 figures",,10.1109/BIOSIG.2016.7736924,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Face recognition approaches that are based on deep convolutional neural
networks (CNN) have been dominating the field. The performance improvements
they have provided in the so called in-the-wild datasets are significant,
however, their performance under image quality degradations have not been
assessed, yet. This is particularly important, since in real-world face
recognition applications, images may contain various kinds of degradations due
to motion blur, noise, compression artifacts, color distortions, and occlusion.
In this work, we have addressed this problem and analyzed the influence of
these image degradations on the performance of deep CNN-based face recognition
approaches using the standard LFW closed-set identification protocol. We have
evaluated three popular deep CNN models, namely, the AlexNet, VGG-Face, and
GoogLeNet. Results have indicated that blur, noise, and occlusion cause a
significant decrease in performance, while deep CNN models are found to be
robust to distortions, such as color distortions and change in color balance.
","[{'version': 'v1', 'created': 'Thu, 18 Aug 2016 11:48:26 GMT'}]",2016-11-28,"[['Karahan', 'Samil', ''], ['Yildirim', 'Merve Kilinc', ''], ['Kirtac', 'Kadir', ''], ['Rende', 'Ferhat Sukru', ''], ['Butun', 'Gultekin', ''], ['Ekenel', 'Hazim Kemal', '']]","['Face recognition', 'deep convolutional neural networks', 'image degradations', 'noise', 'blur', 'occlusion', 'color distortion']"
1609,1003.3556,Secretary Aircc Journal,"Bikramaditya Das (1) and Susmita Das (1), ((1) National Institute of
  Technology, Rourkela, India)","Performance Analysis of Ultra Wideband Receivers for High Data Rate
  Wireless Personal Area Network System","13 Pages, JGraph-Hoc Journal","International journal on applications of graph theory in wireless
  ad hoc networks and sensor networks 2.1 (2010) 31-43",10.5121/jgraphhoc.2010.2104,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  For high data rate ultra wideband communication system, performance
comparison of Rake, MMSE and Rake-MMSE receivers is attempted in this paper.
Further a detail study on Rake-MMSE time domain equalizers is carried out
taking into account all the important parameters such as the effect of the
number of Rake fingers and equalizer taps on the error rate performance. This
receiver combats inter-symbol interference by taking advantages of both the
Rake and equalizer structure. The bit error rate performances are investigated
using MATLAB simulation on IEEE 802.15.3a defined UWB channel models.
Simulation results show that the bit error rate probability of Rake-MMSE
receiver is much better than Rake receiver and MMSE equalizer. Study on
non-line of sight indoor channel models illustrates that bit error rate
performance of Rake-MMSE (both LE and DFE) improves for CM3 model with smaller
spread compared to CM4 channel model. It is indicated that for a MMSE equalizer
operating at low to medium SNR values, the number of Rake fingers is the
dominant factor to improve system performance, while at high SNR values the
number of equalizer taps plays a more significant role in reducing the error
rate.
","[{'version': 'v1', 'created': 'Thu, 18 Mar 2010 11:40:08 GMT'}]",2010-07-15,"[['Das', 'Bikramaditya', ''], ['Das', 'Susmita', '']]","['UWB', 'Rake receiver', 'MMSE', 'Rake-MMSE', 'Bit Error Rate', 'LE', 'DFE']"
1610,1612.05457,Federico Aschieri,Federico Aschieri and Matteo Manighetti,"On Natural Deduction for Herbrand Constructive Logics II: Curry-Howard
  Correspondence for Markov's Principle in First-Order Logic and Arithmetic",,,10.4230/LIPIcs.TYPES.2016.4,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intuitionistic first-order logic extended with a restricted form of Markov's
principle is constructive and admits a Curry-Howard correspondence, as shown by
Herbelin. We provide a simpler proof of that result and then we study
intuitionistic first-order logic extended with unrestricted Markov's principle.
Starting from classical natural deduction, we restrict the excluded middle and
we obtain a natural deduction system and a parallel Curry-Howard isomorphism
for the logic. We show that proof terms for existentially quantified formulas
reduce to a list of individual terms representing all possible witnesses. As
corollary, we derive that the logic is Herbrand constructive: whenever it
proves any existential formula, it proves also an Herbrand disjunction for the
formula. Finally, using the techniques just introduced, we also provide a new
computational interpretation of Arithmetic with Markov's principle.
","[{'version': 'v1', 'created': 'Fri, 16 Dec 2016 13:22:27 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Oct 2017 10:15:04 GMT'}]",2018-11-13,"[['Aschieri', 'Federico', ''], ['Manighetti', 'Matteo', '']]","['Markov’s Principle', 'first-order logic', 'natural deduction', 'Curry-Howard']"
1611,1512.00556,Nima Namvar,"Nima Namvar, Fatemeh Afghah","Spectrum Sharing in Cooperative Cognitive Radio Networks: A Matching
  Game Framework","5 pages, 3 figures in Information Sciences and Systems (CISS), 2015
  49th Annual Conference on , vol., no., pp.1-5, 18-20 March 2015",,10.1109/CISS.2015.7086843,,cs.NI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dynamic spectrum access allows the unlicensed wireless users (secondary
users) to dynamically access the licensed bands from legacy spectrum holders
(primary users) either on an opportunistic or a cooperative basis. In this
paper, we focus on cooperative spectrum sharing in a wireless network
consisting of multiple primary and multiple secondary users. In particular, we
study the partner-selection and resource-allocation problems within a matching
theory framework, in which the primary and secondary users aim at optimizing
their utilities in terms of transmission rate and power consumption. We propose
a distributed algorithm to find the solution of the developed matching game
that results in a stable matching between the sets of the primary and secondary
users. Both analytical and numerical results show that the proposed matching
model is a promising approach under which the utility functions of both primary
and secondary users are maximized.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2015 03:21:16 GMT'}]",2015-12-04,"[['Namvar', 'Nima', ''], ['Afghah', 'Fatemeh', '']]","['Cognitive radio networks', 'Dynamic spectrum sharing', 'Cooperative transmission', 'Stackelberg game', 'Stable Matching']"
1612,1008.1371,Vedran Novakovic,Vedran Novakovic and Sanja Singer,A GPU-based hyperbolic SVD algorithm,Accepted for publication in BIT Numerical Mathematics,BIT 51 (2011) 1009-1030,10.1007/s10543-011-0333-5,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A one-sided Jacobi hyperbolic singular value decomposition (HSVD) algorithm,
using a massively parallel graphics processing unit (GPU), is developed. The
algorithm also serves as the final stage of solving a symmetric indefinite
eigenvalue problem. Numerical testing demonstrates the gains in speed and
accuracy over sequential and MPI-parallelized variants of similar Jacobi-type
HSVD algorithms. Finally, possibilities of hybrid CPU--GPU parallelism are
discussed.
","[{'version': 'v1', 'created': 'Sat, 7 Aug 2010 23:00:42 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Apr 2011 03:20:13 GMT'}]",2011-11-28,"[['Novakovic', 'Vedran', ''], ['Singer', 'Sanja', '']]","['one-sided Jacobi algorithm', 'hyperbolic singular value decomposition', 'symmetricindefinite eigenvalue problem', 'GPU parallel programming']"
1613,1805.07035,Morad Behandish,"Morad Behandish, Saigopal Nelaturi, and Johan de Kleer",Automated Process Planning for Hybrid Manufacturing,Special Issue on symposium on Solid and Physical Modeling (SPM'2018),"Journal of Computer-Aided Design, 2018",10.1016/j.cad.2018.04.022,,cs.CG cs.AI cs.GR cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hybrid manufacturing (HM) technologies combine additive and subtractive
manufacturing (AM/SM) capabilities, leveraging AM's strengths in fabricating
complex geometries and SM's precision and quality to produce finished parts. We
present a systematic approach to automated computer-aided process planning
(CAPP) for HM that can identify non-trivial, qualitatively distinct, and
cost-optimal combinations of AM/SM modalities. A multimodal HM process plan is
represented by a finite Boolean expression of AM and SM manufacturing
primitives, such that the expression evaluates to an 'as-manufactured'
artifact. We show that primitives that respect spatial constraints such as
accessibility and collision avoidance may be constructed by solving inverse
configuration space problems on the 'as-designed' artifact and manufacturing
instruments. The primitives generate a finite Boolean algebra (FBA) that
enumerates the entire search space for planning. The FBA's canonical
intersection terms (i.e., 'atoms') provide the complete domain decomposition to
reframe manufacturability analysis and process planning into purely symbolic
reasoning, once a subcollection of atoms is found to be interchangeable with
the design target. The approach subsumes unimodal (all-AM or all-SM) process
planning as special cases. We demonstrate the practical potency of our
framework and its computational efficiency when applied to process planning of
complex 3D parts with dramatically different AM and SM instruments.
","[{'version': 'v1', 'created': 'Fri, 18 May 2018 03:27:35 GMT'}]",2018-05-21,"[['Behandish', 'Morad', ''], ['Nelaturi', 'Saigopal', ''], ['de Kleer', 'Johan', '']]","['Hybrid Manufacturing', 'Process Planning', 'Spatial Reasoning', 'Additive Manufacturing', 'Machining']"
1614,1405.1304,Sumaira Tasnim,Akhlaqur Rahman and Sumaira Tasnim,Application of Machine Learning Techniques in Aquaculture,2 pages,"International Journal of Computer Trends and Technology (IJCTT)
  V10(3):214-215 Apr 2014. ISSN:2231-2803",10.14445/22312803/IJCTT-V10P137,,cs.CE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present applications of different machine learning
algorithms in aquaculture. Machine learning algorithms learn models from
historical data. In aquaculture historical data are obtained from farm
practices, yields, and environmental data sources. Associations between these
different variables can be obtained by applying machine learning algorithms to
historical data. In this paper we present applications of different machine
learning algorithms in aquaculture applications.
","[{'version': 'v1', 'created': 'Sat, 3 May 2014 14:26:42 GMT'}]",2014-05-07,"[['Rahman', 'Akhlaqur', ''], ['Tasnim', 'Sumaira', '']]","['aquaculture', 'machine learning', 'decision support system']"
1615,2105.05622,Aidan Hughes,"A.J. Hughes, L.A. Bull, P. Gardner, R.J. Barthorpe, N. Dervilis, K.
  Worden",On risk-based active learning for structural health monitoring,"30 pages. 23 figures. Published in Mechanical Systems and Signal
  Processing","Mechanical Systems and Signal Processing, Volume 167, Part B, 15
  March 2022, 108569,",10.1016/j.ymssp.2021.108569,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A primary motivation for the development and implementation of structural
health monitoring systems, is the prospect of gaining the ability to make
informed decisions regarding the operation and maintenance of structures and
infrastructure. Unfortunately, descriptive labels for measured data
corresponding to health-state information for the structure of interest are
seldom available prior to the implementation of a monitoring system. This issue
limits the applicability of the traditional supervised and unsupervised
approaches to machine learning in the development of statistical classifiers
for decision-supporting SHM systems.
  The current paper presents a risk-based formulation of active learning, in
which the querying of class-label information is guided by the expected value
of said information for each incipient data point. When applied to structural
health monitoring, the querying of class labels can be mapped onto the
inspection of a structure of interest in order to determine its health state.
In the current paper, the risk-based active learning process is explained and
visualised via a representative numerical example and subsequently applied to
the Z24 Bridge benchmark. The results of the case studies indicate that a
decision-maker's performance can be improved via the risk-based active learning
of a statistical classifier, such that the decision process itself is taken
into account.
","[{'version': 'v1', 'created': 'Wed, 12 May 2021 12:34:03 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Nov 2021 13:45:26 GMT'}]",2021-11-17,"[['Hughes', 'A. J.', ''], ['Bull', 'L. A.', ''], ['Gardner', 'P.', ''], ['Barthorpe', 'R. J.', ''], ['Dervilis', 'N.', ''], ['Worden', 'K.', '']]","['structural health monitoring', 'decision-making', 'active learning', 'value of information']"
1616,1608.00100,Nikos Katzouris,"Nikos Katzouris, Alexander Artikis, Georgios Paliouras",Online Learning of Event Definitions,"Paper presented at the 32nd International Conference on Logic
  Programming (ICLP 2016), New York City, USA, 16-21 October 2016, 15 pages,
  LaTeX, 1 PDF figure","Theory and Practice of Logic Programming 16(5-6), 817-833, 2016",10.1017/S1471068416000260,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Systems for symbolic event recognition infer occurrences of events in time
using a set of event definitions in the form of first-order rules. The Event
Calculus is a temporal logic that has been used as a basis in event recognition
applications, providing among others, direct connections to machine learning,
via Inductive Logic Programming (ILP). We present an ILP system for online
learning of Event Calculus theories. To allow for a single-pass learning
strategy, we use the Hoeffding bound for evaluating clauses on a subset of the
input stream. We employ a decoupling scheme of the Event Calculus axioms during
the learning process, that allows to learn each clause in isolation. Moreover,
we use abductive-inductive logic programming techniques to handle unobserved
target predicates. We evaluate our approach on an activity recognition
application and compare it to a number of batch learning techniques. We obtain
results of comparable predicative accuracy with significant speed-ups in
training time. We also outperform hand-crafted rules and match the performance
of a sound incremental learner that can only operate on noise-free datasets.
This paper is under consideration for acceptance in TPLP.
","[{'version': 'v1', 'created': 'Sat, 30 Jul 2016 10:44:58 GMT'}]",2021-03-31,"[['Katzouris', 'Nikos', ''], ['Artikis', 'Alexander', ''], ['Paliouras', 'Georgios', '']]","['Inductive Logic Programming', 'Event Calculus', 'Online Learning']"
1617,1907.04739,Christoph Anderson,"Christoph Anderson, Judith Simone Heinisch, Sandra Ohly, Klaus David,
  Veljko Pejovic","The Impact of Private and Work-Related Smartphone Usage on
  Interruptibility","6 pages, 3 figures","Adjunct Proceedings of the 2019 ACM International Joint Conference
  on Pervasive and Ubiquitous Computing and the 2019 International Symposium on
  Wearable Computers (UbiComp/ISWC '19 Adjunct)",10.1145/3341162.3344845,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last decade, the effects of interruptions through mobile notifications
have been extensively researched in the field of Human-Computer Interaction.
Breakpoints in tasks and activities, cognitive load, and personality traits
have all been shown to correlate with individuals' interruptibility. However,
concepts that explain interruptibility in a broader sense are needed to provide
a holistic understanding of its characteristics. In this paper, we build upon
the theory of social roles to conceptualize and investigate the correlation
between individuals' private and work-related smartphone usage and their
interruptibility. Through our preliminary study with four participants over 11
weeks, we found that application sequences on smartphones correlate with
individuals' private and work roles. We observed that participants engaged in
these roles tend to follow specific interruptibility strategies - integrating,
combining, or segmenting private and work-related engagements. Understanding
these strategies breaks new ground for attention and interruption management
systems in ubiquitous computing.
","[{'version': 'v1', 'created': 'Wed, 10 Jul 2019 14:11:19 GMT'}]",2019-07-11,"[['Anderson', 'Christoph', ''], ['Heinisch', 'Judith Simone', ''], ['Ohly', 'Sandra', ''], ['David', 'Klaus', ''], ['Pejovic', 'Veljko', '']]","['Interruptibility', 'Attention Management', 'Social Roles', 'HCI']"
1618,1812.01195,Pragna Mannam,"Pragna Mannam, Alexander Volkov Jr., Robert Paolini, Gregory
  Chirikjian, Matthew T. Mason",Sensorless Pose Determination using Randomized Action Sequences,,,10.3390/e21020154,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is a study of 2D manipulation without sensing and planning, by
exploring the effects of unplanned randomized action sequences on 2D object
pose uncertainty. Our approach follows the work of Erdmann and Mason's
sensorless reorienting of an object into a completely determined pose,
regardless of its initial pose. While Erdmann and Mason proposed a method using
Newtonian mechanics, this paper shows that under some circumstances, a long
enough sequence of random actions will also converge toward a determined final
pose of the object. This is verified through several simulation and real robot
experiments where randomized action sequences are shown to reduce entropy of
the object pose distribution. The effects of varying object shapes, action
sequences, and surface friction are also explored.
","[{'version': 'v1', 'created': 'Tue, 4 Dec 2018 03:19:14 GMT'}]",2019-02-20,"[['Mannam', 'Pragna', ''], ['Volkov', 'Alexander', 'Jr.'], ['Paolini', 'Robert', ''], ['Chirikjian', 'Gregory', ''], ['Mason', 'Matthew T.', '']]","['manipulation', 'probabilistic reasoning', 'automation', 'manufacturing and logistics']"
1619,1406.3156,Christian Napoli,"Christian Napoli, Giuseppe Pappalardo, Emiliano Tramontana",A hybrid neuro--wavelet predictor for QoS control and stability,,"Proceedings of AI*IA 2013: Advances in Artificial Intelligence,
  pages 527-538. Springer, 2013",10.1007/978-3-319-03524-6_45,,cs.NE cs.DC cs.NI cs.PF cs.SY,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  For distributed systems to properly react to peaks of requests, their
adaptation activities would benefit from the estimation of the amount of
requests. This paper proposes a solution to produce a short-term forecast based
on data characterising user behaviour of online services. We use \emph{wavelet
analysis}, providing compression and denoising on the observed time series of
the amount of past user requests; and a \emph{recurrent neural network} trained
with observed data and designed so as to provide well-timed estimations of
future requests. The said ensemble has the ability to predict the amount of
future user requests with a root mean squared error below 0.06\%. Thanks to
prediction, advance resource provision can be performed for the duration of a
request peak and for just the right amount of resources, hence avoiding
over-provisioning and associated costs. Moreover, reliable provision lets users
enjoy a level of availability of services unaffected by load variations.
","[{'version': 'v1', 'created': 'Thu, 12 Jun 2014 09:04:49 GMT'}]",2014-06-13,"[['Napoli', 'Christian', ''], ['Pappalardo', 'Giuseppe', ''], ['Tramontana', 'Emiliano', '']]","['Neural networks', 'wavelet analysis', 'QoS', 'adaptive systems']"
1620,0907.2252,Dilip Krishnaswamy,Dilip Krishnaswamy,AWiMA: An architecture for Adhoc Wireless Mobile internet Access,"5 pages, 3 figures, submitted to IEEE Globecom 2008",,10.1109/GLOCOM.2008.ECP.1083,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  This paper suggests a system architecture for wireless widearea- networking
access using adhoc networking between a mobile Client node without direct
connectivity to a wirelesswide- area-network and a mobile Service Provider node
with connectivity to a wireless-wide-area-network. It provides a means for
securely providing such adhoc wireless networking services using a Server for
tunneling and routing, registration and authentication. The architecture also
provides support for handoff of a Client node from one Service Provider to
another with persistence of a tunnel between the Client and the Server enabling
a soft-handoff. Different wireless protocols may be used for adhoc networking,
with filtered interconnection of authenticated Clients implemented at a Service
Provider node. The architecture is applicable across different wide-areanetwork
protocols, and provides simultaneous support for multiple wide-area-network
protocols.
","[{'version': 'v1', 'created': 'Mon, 13 Jul 2009 20:10:29 GMT'}]",2016-11-17,"[['Krishnaswamy', 'Dilip', '']]","['Wireless Wide Area Networking', 'Adhoc Wireless Networking', 'Tunneling', 'Handoff', 'Heterogeneous networks']"
1621,1903.01742,Markus Borg,"Markus Borg, Oscar Svensson, Kristian Berg, Daniel Hansson","SZZ Unleashed: An Open Implementation of the SZZ Algorithm -- Featuring
  Example Usage in a Study of Just-in-Time Bug Prediction for the Jenkins
  Project",,"In Proc. of the 3rd ACM SIGSOFT International Workshop on Machine
  Learning Techniques for Software Quality Evaluation (MaLTeSQuE'19), pp. 7-12,
  August 27, 2019, Tallinn, Estonia",10.1145/3340482.3342742,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Numerous empirical software engineering studies rely on detailed information
about bugs. While issue trackers often contain information about when bugs were
fixed, details about when they were introduced to the system are often absent.
As a remedy, researchers often rely on the SZZ algorithm as a heuristic
approach to identify bug-introducing software changes. Unfortunately, as
reported in a recent systematic literature review, few researchers have made
their SZZ implementations publicly available. Consequently, there is a risk
that research effort is wasted as new projects based on SZZ output need to
initially reimplement the approach. Furthermore, there is a risk that newly
developed (closed source) SZZ implementations have not been properly tested,
thus conducting research based on their output might introduce threats to
validity. We present SZZ Unleashed, an open implementation of the SZZ algorithm
for git repositories. This paper describes our implementation along with a
usage example for the Jenkins project, and conclude with an illustrative study
on just-in-time bug prediction. We hope to continue evolving SZZ Unleashed on
GitHub, and warmly invite the community to contribute.
","[{'version': 'v1', 'created': 'Tue, 5 Mar 2019 09:24:43 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Aug 2019 10:43:20 GMT'}]",2019-08-20,"[['Borg', 'Markus', ''], ['Svensson', 'Oscar', ''], ['Berg', 'Kristian', ''], ['Hansson', 'Daniel', '']]","['SZZ', 'defect prediction', 'mining software repositories', 'issue tracking']"
1622,1706.03327,G Kavitha,Ms. Ganesan Kavitha and Dr. Lawrance Raj,"Educational Data Mining and Learning Analytics - Educational Assistance
  for Teaching and Learning","5 Pages, 5 Tables and 1 Figure, Internal Journal of Computer and
  Organization Trends (IJCOT), March 2017",,10.14445/22492593/IJCOT-V41P304,,cs.SY cs.DB,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Teaching and Learning process of an educational institution needs to be
monitored and effectively analysed for enhancement. Teaching and Learning is a
vital element for an educational institution. It is also one of the criteria
set by majority of the Accreditation Agencies around the world. Learning
analytics and Educational Data Mining are relatively new. Learning analytics
refers to the collection of large volume of data about students in an
educational setting and to analyse the data to predict the students' future
performance and identify risk. Educational Data Mining (EDM) is develops
methods to analyse the data produced by the students in educational settings
and these methods helps to understand the students and the setting where they
learn. Aim of this research is to collect large collection of data on students'
performance in their assessment to discover the students at risk of failing the
final exam. This analysis will help to understand how the students are
progressing. The proposed research aimed to utilize the result of the analysis
to identify the students at risk and provide recommendations for improvement.
The proposed research aimed to collect and analyse the result of the assessment
at the course level to enhance the teaching and learning process. The research
aimed to discuss two feature selection techniques namely information gain and
gain ratio and adopted to use gain ratio as the feature selection technique.
","[{'version': 'v1', 'created': 'Sun, 11 Jun 2017 09:03:39 GMT'}]",2017-06-13,"[['Kavitha', 'Ms. Ganesan', ''], ['Raj', 'Dr. Lawrance', '']]","['Educational Data Mining', 'Learning Analytics', 'Accreditation', 'Retention', 'Assessment', 'Teaching and Learning']"
1623,1410.0818,Junhua Li,"Junhua Li, Zbigniew Struzik, Liqing Zhang, Andrzej Cichocki",Feature Learning from Incomplete EEG with Denoising Autoencoder,The paper was accepted for publication by Neurocomputing,"Neurocomputing, 2015, 165: 23-31",10.1016/j.neucom.2014.08.092,,cs.CV q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An alternative pathway for the human brain to communicate with the outside
world is by means of a brain computer interface (BCI). A BCI can decode
electroencephalogram (EEG) signals of brain activities, and then send a command
or an intent to an external interactive device, such as a wheelchair. The
effectiveness of the BCI depends on the performance in decoding the EEG.
Usually, the EEG is contaminated by different kinds of artefacts (e.g.,
electromyogram (EMG), background activity), which leads to a low decoding
performance. A number of filtering methods can be utilized to remove or weaken
the effects of artefacts, but they generally fail when the EEG contains extreme
artefacts. In such cases, the most common approach is to discard the whole data
segment containing extreme artefacts. This causes the fatal drawback that the
BCI cannot output decoding results during that time. In order to solve this
problem, we employ the Lomb-Scargle periodogram to estimate the spectral power
from incomplete EEG (after removing only parts contaminated by artefacts), and
Denoising Autoencoder (DAE) for learning. The proposed method is evaluated with
motor imagery EEG data. The results show that our method can successfully
decode incomplete EEG to good effect.
","[{'version': 'v1', 'created': 'Fri, 3 Oct 2014 11:12:47 GMT'}]",2019-07-31,"[['Li', 'Junhua', ''], ['Struzik', 'Zbigniew', ''], ['Zhang', 'Liqing', ''], ['Cichocki', 'Andrzej', '']]","['Brain Computer Interface', 'Spectral Power Estimation', 'Denoising']"
1624,1110.0207,Carlos Granell,Alain Tamayo and Carlos Granell and Joaqu\'in Huerta,Analysing complexity of XML Schemas in geospatial web services,"9 pages, 10 tables, 4 figures; COM.Geo '11 Proceedings of the 2nd
  International Conference on Computing for Geospatial Research & Applications,
  ACM, no. 17, 2011","COM.Geo '11 Proceedings of the 2nd International Conference on
  Computing for Geospatial Research & Applications, ACM, no. 17, 2011",10.1145/1999320.1999337,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  XML Schema is the language used to define the structure of messages exchanged
between OGC-based web service clients and providers. The size of these schemas
has been growing with time, reaching a state that makes its understanding and
effective application a hard task. A first step to cope with this situation is
to provide different ways to measure the complexity of the schemas. In this
regard, we present in this paper an analysis of the complexity of XML schemas
in OGC web services. We use a group of metrics found in the literature and
introduce new metrics to measure size and/or complexity of these schemas. The
use of adequate metrics allows us to quantify the complexity, quality and other
properties of the schemas, which can be very useful in different scenarios.
","[{'version': 'v1', 'created': 'Sun, 2 Oct 2011 17:49:47 GMT'}]",2011-12-06,"[['Tamayo', 'Alain', ''], ['Granell', 'Carlos', ''], ['Huerta', 'Joaquín', '']]","['XML Schema', 'Web Services', 'Geospatial Information', 'Complexity Analysis', 'Software Metrics']"
1625,1709.07096,Ramin Soltani,"Ramin Soltani, Dennis Goeckel, Don Towsley, Boulat Bash, Saikat Guha",Covert Wireless Communication with Artificial Noise Generation,,,10.1109/TWC.2018.2865946,,cs.IT cs.CR cs.NI eess.SP math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Covert communication conceals the transmission of the message from an
attentive adversary. Recent work on the limits of covert communication in
additive white Gaussian noise (AWGN) channels has demonstrated that a covert
transmitter (Alice) can reliably transmit a maximum of
$\mathcal{O}\left(\sqrt{n}\right)$ bits to a covert receiver (Bob) without
being detected by an adversary (Warden Willie) in $n$ channel uses. This paper
focuses on the scenario where other friendly nodes distributed according to a
two-dimensional Poisson point process with density $m$ are present in the
environment. We propose a strategy where the friendly node closest to the
adversary, without close coordination with Alice, produces artificial noise. We
show that this method allows Alice to reliably and covertly send
$\mathcal{O}(\min\{{n,m^{\gamma/2}\sqrt{n}}\})$ bits to Bob in $n$ channel
uses, where $\gamma$ is the path-loss exponent. Moreover, we also consider a
setting where there are $N_{\mathrm{w}}$ collaborating adversaries uniformly
and randomly located in the environment and show that in $n$ channel uses,
Alice can reliably and covertly send
$\mathcal{O}\left(\min\left\{n,\frac{m^{\gamma/2}
\sqrt{n}}{N_{\mathrm{w}}^{\gamma}}\right\}\right)$ bits to Bob when $\gamma
>2$, and $\mathcal{O}\left(\min\left\{n,\frac{m
\sqrt{n}}{N_{\mathrm{w}}^{2}\log^2 {N_{\mathrm{w}}}}\right\}\right)$ when
$\gamma = 2$. Conversely, we demonstrate that no higher covert throughput is
possible for $\gamma>2$.
","[{'version': 'v1', 'created': 'Wed, 20 Sep 2017 22:37:00 GMT'}, {'version': 'v2', 'created': 'Sat, 10 Mar 2018 04:49:22 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Jun 2018 18:08:41 GMT'}, {'version': 'v4', 'created': 'Tue, 21 Aug 2018 19:35:06 GMT'}, {'version': 'v5', 'created': 'Sun, 23 Sep 2018 02:37:55 GMT'}]",2018-09-25,"[['Soltani', 'Ramin', ''], ['Goeckel', 'Dennis', ''], ['Towsley', 'Don', ''], ['Bash', 'Boulat', ''], ['Guha', 'Saikat', '']]","['Security and Privacy', 'Covert Communication', 'Wireless Communication', 'Artificial Noise Gen']"
1626,1509.00721,Andrey Shchurov,Andrey A. Shchurov,A Multilayer Model of Computer Networks,"5 pages, 4 figures. ISSN:2231-2803","International Journal of Computer Trends and Technology (IJCTT)
  V26(1):12-16, August 2015",10.14445/22312803/IJCTT-V26P103,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The fundamental concept of applying the system methodology to network
analysis declares that network architecture should take into account services
and applications which this network provides and supports. This work introduces
a formal model of computer networks on the basis of the hierarchical multilayer
networks. In turn, individual layers are represented as multiplex networks. The
concept of layered networks provides conditions of top-down consistency of the
model. Next, we determined the necessary set of layers for network architecture
representation with regard to applying the system methodology to network
analysis.
","[{'version': 'v1', 'created': 'Wed, 2 Sep 2015 14:34:53 GMT'}]",2015-09-03,"[['Shchurov', 'Andrey A.', '']]","['computer networks', 'formal models', 'multilayer networks']"
1627,1805.12381,Tanujit Chakraborty,Tanujit Chakraborty,"Imbalanced Ensemble Classifier for learning from imbalanced business
  school data set",,"International Journal of Mathematical, Engineering and Management
  Sciences Vol. 4, No. 4, 861-869, 2019",10.33889/IJMEMS.2019.4.4-068,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Private business schools in India face a common problem of selecting quality
students for their MBA programs to achieve the desired placement percentage.
Generally, such data sets are biased towards one class, i.e., imbalanced in
nature. And learning from the imbalanced dataset is a difficult proposition.
This paper proposes an imbalanced ensemble classifier which can handle the
imbalanced nature of the dataset and achieves higher accuracy in case of the
feature selection (selection of important characteristics of students) cum
classification problem (prediction of placements based on the students'
characteristics) for Indian business school dataset. The optimal value of an
important model parameter is found. Numerical evidence is also provided using
Indian business school dataset to assess the outstanding performance of the
proposed classifier.
","[{'version': 'v1', 'created': 'Thu, 31 May 2018 08:53:32 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Oct 2018 08:36:45 GMT'}]",2022-07-18,"[['Chakraborty', 'Tanujit', '']]","['Business School Problem', 'Imbalanced Data', 'Hellinger Distance', 'EnsembleClassifier']"
1628,0807.0484,Gabriel Nivasch,Gabriel Nivasch,"Improved bounds and new techniques for Davenport-Schinzel sequences and
  their generalizations","To appear in Journal of the ACM. 48 pages, 3 figures","Journal of the ACM, 57, article 17, 44 pages, 2010",10.1145/1706591.1706597,,cs.DM cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let lambda_s(n) denote the maximum length of a Davenport-Schinzel sequence of
order s on n symbols. For s=3 it is known that lambda_3(n) = Theta(n alpha(n))
(Hart and Sharir, 1986). For general s>=4 there are almost-tight upper and
lower bounds, both of the form n * 2^poly(alpha(n)) (Agarwal, Sharir, and Shor,
1989). Our first result is an improvement of the upper-bound technique of
Agarwal et al. We obtain improved upper bounds for s>=6, which are tight for
even s up to lower-order terms in the exponent. More importantly, we also
present a new technique for deriving upper bounds for lambda_s(n). With this
new technique we: (1) re-derive the upper bound of lambda_3(n) <= 2n alpha(n) +
O(n sqrt alpha(n)) (first shown by Klazar, 1999); (2) re-derive our own new
upper bounds for general s; and (3) obtain improved upper bounds for the
generalized Davenport-Schinzel sequences considered by Adamec, Klazar, and
Valtr (1992). Regarding lower bounds, we show that lambda_3(n) >= 2n alpha(n) -
O(n), and therefore, the coefficient 2 is tight. We also present a simpler
version of the construction of Agarwal, Sharir, and Shor that achieves the
known lower bounds for even s>=4.
","[{'version': 'v1', 'created': 'Thu, 3 Jul 2008 05:08:29 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Nov 2008 08:44:00 GMT'}, {'version': 'v3', 'created': 'Wed, 9 Dec 2009 11:09:16 GMT'}]",2013-03-25,"[['Nivasch', 'Gabriel', '']]","['Davenport–Schinzel sequence', 'lower envelope', 'inverse Ackermannfunction']"
1629,1807.06294,Zixin Luo,"Zixin Luo, Tianwei Shen, Lei Zhou, Siyu Zhu, Runze Zhang, Yao Yao,
  Tian Fang and Long Quan",GeoDesc: Learning Local Descriptors by Integrating Geometry Constraints,Accepted to ECCV'18,,10.1007/978-3-030-01240-3_11,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Learned local descriptors based on Convolutional Neural Networks (CNNs) have
achieved significant improvements on patch-based benchmarks, whereas not having
demonstrated strong generalization ability on recent benchmarks of image-based
3D reconstruction. In this paper, we mitigate this limitation by proposing a
novel local descriptor learning approach that integrates geometry constraints
from multi-view reconstructions, which benefits the learning process in terms
of data generation, data sampling and loss computation. We refer to the
proposed descriptor as GeoDesc, and demonstrate its superior performance on
various large-scale benchmarks, and in particular show its great success on
challenging reconstruction tasks. Moreover, we provide guidelines towards
practical integration of learned descriptors in Structure-from-Motion (SfM)
pipelines, showing the good trade-off that GeoDesc delivers to 3D
reconstruction tasks between accuracy and efficiency.
","[{'version': 'v1', 'created': 'Tue, 17 Jul 2018 09:31:34 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Aug 2018 12:46:10 GMT'}]",2018-11-27,"[['Luo', 'Zixin', ''], ['Shen', 'Tianwei', ''], ['Zhou', 'Lei', ''], ['Zhu', 'Siyu', ''], ['Zhang', 'Runze', ''], ['Yao', 'Yao', ''], ['Fang', 'Tian', ''], ['Quan', 'Long', '']]","['Local Features', 'Feature Descriptors', 'Deep Learning']"
1630,1701.00642,Paul Weng,Dajian Li and Paul Weng and Orkun Karabasoglu,Finding Risk-Averse Shortest Path with Time-dependent Stochastic Costs,accepted at MIWAI 2017,,10.1007/978-3-319-49397-8_9,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we tackle the problem of risk-averse route planning in a
transportation network with time-dependent and stochastic costs. To solve this
problem, we propose an adaptation of the A* algorithm that accommodates any
risk measure or decision criterion that is monotonic with first-order
stochastic dominance. We also present a case study of our algorithm on the
Manhattan, NYC, transportation network.
","[{'version': 'v1', 'created': 'Tue, 3 Jan 2017 10:47:35 GMT'}]",2017-01-04,"[['Li', 'Dajian', ''], ['Weng', 'Paul', ''], ['Karabasoglu', 'Orkun', '']]","['Route Planning', 'Shortest Path', 'Risk-averse decisionmaking', 'Conditional Value-At-Risk', 'Time-dependent StochasticCosts']"
1631,1805.06521,Siamak Barzegar,"Siamak Barzegar, Andre Freitas, Siegfried Handschuh and Brian Davis",Composite Semantic Relation Classification,"12 pages, 3 figures, conference",,10.1007/978-3-319-59569-6_49,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Different semantic interpretation tasks such as text entailment and question
answering require the classification of semantic relations between terms or
entities within text. However, in most cases it is not possible to assign a
direct semantic relation between entities/terms. This paper proposes an
approach for composite semantic relation classification, extending the
traditional semantic relation classification task. Different from existing
approaches, which use machine learning models built over lexical and
distributional word vector features, the proposed model uses the combination of
a large commonsense knowledge base of binary relations, a distributional
navigational algorithm and sequence classification to provide a solution for
the composite semantic relation classification problem.
","[{'version': 'v1', 'created': 'Wed, 16 May 2018 20:41:33 GMT'}]",2018-05-18,"[['Barzegar', 'Siamak', ''], ['Freitas', 'Andre', ''], ['Handschuh', 'Siegfried', ''], ['Davis', 'Brian', '']]","['Semantic Relation', 'Distributional Semantic', 'Deep Learning', 'Classification']"
1632,1003.5330,Daniel Karapetyan,Daniel Karapetyan and Gregory Gutin,"Lin-Kernighan Heuristic Adaptations for the Generalized Traveling
  Salesman Problem",25 pages,"European Journal of Operational Research 208(3), pages 221-232,
  2011",10.1016/j.ejor.2010.08.011,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Lin-Kernighan heuristic is known to be one of the most successful
heuristics for the Traveling Salesman Problem (TSP). It has also proven its
efficiency in application to some other problems. In this paper we discuss
possible adaptations of TSP heuristics for the Generalized Traveling Salesman
Problem (GTSP) and focus on the case of the Lin-Kernighan algorithm. At first,
we provide an easy-to-understand description of the original Lin-Kernighan
heuristic. Then we propose several adaptations, both trivial and complicated.
Finally, we conduct a fair competition between all the variations of the
Lin-Kernighan adaptation and some other GTSP heuristics. It appears that our
adaptation of the Lin-Kernighan algorithm for the GTSP reproduces the success
of the original heuristic. Different variations of our adaptation outperform
all other heuristics in a wide range of trade-offs between solution quality and
running time, making Lin-Kernighan the state-of-the-art GTSP local search.
","[{'version': 'v1', 'created': 'Sat, 27 Mar 2010 22:46:05 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Jun 2010 18:11:37 GMT'}]",2012-02-15,"[['Karapetyan', 'Daniel', ''], ['Gutin', 'Gregory', '']]","['Heuristics', 'Lin-Kernighan', 'Generalized Traveling Salesman Problem', 'Combinatorial Optimization']"
1633,1407.2925,Stefan Cruceanu Gicu,"Stelian Ion, Dorin Marinescu, Stefan-Gicu Cruceanu, Virgil Iordache","A data porting tool for coupling models with different discretization
  needs",,Environmental Modelling & Software 62 (2014) 240-252,10.1016/j.envsoft.2014.09.012,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The presented work is part of a larger research program dealing with
developing tools for coupling biogeochemical models in contaminated landscapes.
The specific objective of this article is to provide the researchers a tool to
build hexagonal raster using information from a rectangular raster data (e.g.
GIS format), data porting. This tool involves a computational algorithm and an
open source software (written in C). The method of extending the reticulated
functions defined on 2D networks is an essential key of this algorithm and can
also be used for other purposes than data porting. The algorithm allows one to
build the hexagonal raster with a cell size independent from the geometry of
the rectangular raster. The extended function is a bi-cubic spline which can
exactly reconstruct polynomials up to degree three in each variable. We
validate the method by analyzing errors in some theoretical case studies
followed by other studies with real terrain elevation data. We also introduce
and briefly present an iterative water routing method and use it for validation
on a case with concrete terrain data.
","[{'version': 'v1', 'created': 'Wed, 9 Jul 2014 10:45:40 GMT'}]",2020-09-03,"[['Ion', 'Stelian', ''], ['Marinescu', 'Dorin', ''], ['Cruceanu', 'Stefan-Gicu', ''], ['Iordache', 'Virgil', '']]","['Raster data', 'interpolation', 'cubic polynomials', 'hexagonalraster', 'hydrological modelling', 'water routing']"
1634,1403.3253,Ranjan Kumar,Ranjan Kumar and G. Sahoo,Cloud Computing Simulation Using CloudSim,"5 pages, 2 figures,""Published with International Journal of
  Engineering Trends and Technology (IJETT)"". http://www.ijettjournal.org.
  published by seventh sense research group","International Journal of Engineering Trends and Technology(IJETT),
  8(2),82-86 February 2014. ISSN:2231-5381",10.14445/22315381/IJETT-V8P216,,cs.DC,http://creativecommons.org/licenses/by/3.0/,"  As we know that Cloud Computing is a new paradigm in IT. It has many
advantages and disadvantages. But in future it will spread in the whole world.
Many researches are going on for securing the cloud services. Simulation is the
act of imitating or pretending. It is a situation in which a particular set of
condition is created artificially in order to study that could exit in reality.
We need only a simple Operating System with some memory to startup our
Computer. All our resources will be available in the cloud.
","[{'version': 'v1', 'created': 'Fri, 21 Feb 2014 16:07:01 GMT'}]",2014-03-14,"[['Kumar', 'Ranjan', ''], ['Sahoo', 'G.', '']]","['Cloud Computing', 'Data Center', 'VM Scheduler', 'Host']"
1635,1003.5068,Mathieu Feuillet Mr,"T. Bonald (Telecom ParisTech, Paris, France), M. Feuillet (INRIA,
  Rocquencourt, France)",On the stability of flow-aware CSMA,,,10.1016/j.peva.2010.08.001,,cs.PF cs.NI math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a wireless network where each flow (instead of each link) runs
its own CSMA (Carrier Sense Multiple Access) algorithm. Specifically, each flow
attempts to access the radio channel after some random time and transmits a
packet if the channel is sensed idle. We prove that, unlike the standard CSMA
algorithm, this simple distributed access scheme is optimal in the sense that
the network is stable for all traffic intensities in the capacity region of the
network.
","[{'version': 'v1', 'created': 'Fri, 26 Mar 2010 08:06:37 GMT'}]",2011-02-23,"[['Bonald', 'T.', '', 'Telecom ParisTech, Paris, France'], ['Feuillet', 'M.', '', 'INRIA,\n  Rocquencourt, France']]","['Wireless network', 'conflict graph', 'CSMA', 'flow-level dynamics', 'stability', 'throughput performance']"
1636,1502.04981,Mete Ozay,Mete Ozay,Semi-supervised Segmentation Fusion of Multi-spectral and Aerial Images,A version of the manuscript was published in ICPR 2014,"Proc. 22nd International Conference on Pattern Recognition, pp.
  3839-3844, Stockholm, 2014",10.1109/ICPR.2014.659,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Semi-supervised Segmentation Fusion algorithm is proposed using consensus
and distributed learning. The aim of Unsupervised Segmentation Fusion (USF) is
to achieve a consensus among different segmentation outputs obtained from
different segmentation algorithms by computing an approximate solution to the
NP problem with less computational complexity. Semi-supervision is incorporated
in USF using a new algorithm called Semi-supervised Segmentation Fusion (SSSF).
In SSSF, side information about the co-occurrence of pixels in the same or
different segments is formulated as the constraints of a convex optimization
problem. The results of the experiments employed on artificial and real-world
benchmark multi-spectral and aerial images show that the proposed algorithms
perform better than the individual state-of-the art segmentation algorithms.
","[{'version': 'v1', 'created': 'Tue, 17 Feb 2015 18:01:13 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Feb 2015 00:11:44 GMT'}]",2015-02-27,"[['Ozay', 'Mete', '']]","['Segmentation', 'clustering', 'fusion', 'consensus', 'stochastic optimization']"
1637,1212.4692,Anjan Krishnamurthy,"Anjan K. Koundinya, Srinath N. K., K. A. K. Sharma, Kiran Kumar, Madhu
  M. N., Kiran U. Shanbag","Map / Reduce Deisgn and Implementation of Apriori Alogirthm for handling
  voluminous data-sets","11 pages, 5 figures; Advanced Computing: An International Journal
  (ACIJ), Vol.3, No.6, November 2012",,10.5121/acij.2012.3604,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Apriori is one of the key algorithms to generate frequent itemsets. Analyzing
frequent itemset is a crucial step in analysing structured data and in finding
association relationship between items. This stands as an elementary foundation
to supervised learning, which encompasses classifier and feature extraction
methods. Applying this algorithm is crucial to understand the behaviour of
structured data. Most of the structured data in scientific domain are
voluminous. Processing such kind of data requires state of the art computing
machines. Setting up such an infrastructure is expensive. Hence a distributed
environment such as a clustered setup is employed for tackling such scenarios.
Apache Hadoop distribution is one of the cluster frameworks in distributed
environment that helps by distributing voluminous data across a number of nodes
in the framework. This paper focuses on map/reduce design and implementation of
Apriori algorithm for structured data analysis.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2012 15:04:12 GMT'}]",2012-12-20,"[['Koundinya', 'Anjan K.', ''], ['K.', 'Srinath N.', ''], ['Sharma', 'K. A. K.', ''], ['Kumar', 'Kiran', ''], ['N.', 'Madhu M.', ''], ['Shanbag', 'Kiran U.', '']]","['Frequent Itemset', 'Distributed Computing', 'Hadoop', 'Apriori', 'Distributed Data Mining']"
1638,2108.07190,Jiska Classen,Jiska Classen and Matthias Hollick,Happy MitM: Fun and Toys in Every Bluetooth Device,,"WiSec 2021: Proceedings of the 14th ACM Conference on Security and
  Privacy in Wireless and Mobile Networks",10.1145/3448300.3467822,,cs.CR cs.NI,http://creativecommons.org/licenses/by/4.0/,"  Bluetooth pairing establishes trust on first use between two devices by
creating a shared key. Similar to certificate warnings in TLS, the Bluetooth
specification requires warning users upon issues with this key, because this
can indicate ongoing Machine-in-the-Middle (MitM) attacks. This paper uncovers
that none of the major Bluetooth stacks warns users, which violates the
specification. Clear warnings would protect users from recently published and
potential future security issues in Bluetooth authentication and encryption.
","[{'version': 'v1', 'created': 'Mon, 16 Aug 2021 15:56:08 GMT'}]",2021-08-17,"[['Classen', 'Jiska', ''], ['Hollick', 'Matthias', '']]","['Bluetooth', 'Machine-in-the-Middle', 'Usable Security']"
1639,0906.5181,Serguei Mokhov,"Serguei A. Mokhov, Joey Paquet, and Mourad Debbabi","Reasoning About a Simulated Printer Case Investigation with Forensic
  Lucid","18 pages, 3 figures, 7 listings, TOC, index; this article closely
  relates to arXiv:0906.0049 and arXiv:0904.3789 but to remain stand-alone
  repeats some of the background and introductory content; abstract presented
  at HSC'09 and the full updated paper at ICDF2C'11. This is an updated/edited
  version after ICDF2C proceedings with more references and corrections","S. A. Mokhov, J. Paquet, and M. Debbabi. Reasoning about a
  simulated printer case investigation with Forensic Lucid. In P. Gladyshev and
  M. K. Rogers, editors, Proceedings of ICDF2C'11, number 0088 in LNICST, pp.
  282-296. Springer, 2012",10.1007/978-3-642-35515-8_23,,cs.LO cs.CR cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we model the ACME (a fictitious company name) ""printer case
incident"" and make its specification in Forensic Lucid, a Lucid- and
intensional-logic-based programming language for cyberforensic analysis and
event reconstruction specification. The printer case involves a dispute between
two parties that was previously solved using the finite-state automata (FSA)
approach, and is now re-done in a more usable way in Forensic Lucid. Our
simulation is based on the said case modeling by encoding concepts like
evidence and the related witness accounts as an evidential statement context in
a Forensic Lucid program, which is an input to the transition function that
models the possible deductions in the case. We then invoke the transition
function (actually its reverse) with the evidential statement context to see if
the evidence we encoded agrees with one's claims and then attempt to
reconstruct the sequence of events that may explain the claim or disprove it.
","[{'version': 'v1', 'created': 'Mon, 29 Jun 2009 00:06:22 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Apr 2012 09:41:26 GMT'}]",2013-09-17,"[['Mokhov', 'Serguei A.', ''], ['Paquet', 'Joey', ''], ['Debbabi', 'Mourad', '']]","['cybercrime investigation modeling', 'intensional logic and programming', 'cyberforensics', 'Forensic Lucid', 'finite-state automata']"
1640,1204.5590,Dr Brij Gupta,"B. B. Gupta, R. C. Joshi, Manoj Misra",An Efficient Analytical Solution to Thwart DDoS Attacks in Public Domain,arXiv admin note: substantial text overlap with arXiv:1203.2400,"Proceedings of ACM International Conference on Advances in
  Computer, Communication and Computing (ICAC3-2008), pp. 503-509, Jan. 23-24,
  2009,India",10.1145/1523103.1523203,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, an analytical model for DDoS attacks detection is proposed, in
which propagation of abrupt traffic changes inside public domain is monitored
to detect a wide range of DDoS attacks. Although, various statistical measures
can be used to construct profile of the traffic normally seen in the network to
identify anomalies whenever traffic goes out of profile, we have selected
volume and flow measure. Consideration of varying tolerance factors make
proposed detection system scalable to the varying network conditions and attack
loads in real time. NS-2 network simulator on Linux platform is used as
simulation testbed. Simulation results show that our proposed solution gives a
drastic improvement in terms of detection rate and false positive rate.
However, the mammoth volume generated by DDoS attacks pose the biggest
challenge in terms of memory and computational overheads as far as monitoring
and analysis of traffic at single point connecting victim is concerned. To
address this problem, a distributed cooperative technique is proposed that
distributes memory and computational overheads to all edge routers for
detecting a wide range of DDoS attacks at early stage.
","[{'version': 'v1', 'created': 'Wed, 25 Apr 2012 08:52:12 GMT'}]",2012-04-26,"[['Gupta', 'B. B.', ''], ['Joshi', 'R. C.', ''], ['Misra', 'Manoj', '']]","['Distributed Denial of Service Attacks', 'Security', 'False Positives', 'False Negatives']"
1641,0808.1247,Damien Chablat,"S\'ebastien Briot (DGMA), Ilian Bonev (GPA), Damien Chablat (IRCCyN),
  Philippe Wenger (IRCCyN), Vigen Arakelian (DGMA)",Self-Motions of General 3-RPR Planar Parallel Robots,,"International Journal of Robotics Research 27, 7 (2008) pp.
  855-866",10.1177/0278364908092466,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies the kinematic geometry of general 3-RPR planar parallel
robots with actuated base joints. These robots, while largely overlooked, have
simple direct kinematics and large singularity-free workspace. Furthermore,
their kinematic geometry is the same as that of a newly developed parallel
robot with SCARA-type motions. Starting from the direct and inverse kinematic
model, the expressions for the singularity loci of 3-RPR planar parallel robots
are determined. Then, the global behaviour at all singularities is
geometrically described by studying the degeneracy of the direct kinematic
model. Special cases of self-motions are then examined and the degree of
freedom gained in such special configurations is kinematically interpreted.
Finally, a practical example is discussed and experimental validations
performed on an actual robot prototype are presented.
","[{'version': 'v1', 'created': 'Fri, 8 Aug 2008 17:17:23 GMT'}]",2008-08-11,"[['Briot', 'Sébastien', '', 'DGMA'], ['Bonev', 'Ilian', '', 'GPA'], ['Chablat', 'Damien', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN'], ['Arakelian', 'Vigen', '', 'DGMA']]","['planar parallel robot', 'kinematic geometry', 'singularity', 'self-motion']"
1642,1203.5748,Mohammad Fuad,"Mohammad Muztaba Fuad, Debzani Deb, Jinsuk Baek",Self-Healing by Means of Runtime Execution Profiling,"Proceedings of 14th International Conference on Computer and
  Information Technology (ICCIT 2011) 22-24 December, 2011, Dhaka, Bangladesh",,10.1109/ICCITechn.2011.6164784,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A self-healing application brings itself into a stable state after a failure
put the software into an unstable state. For such self-healing software
application, finding fix for a previously unseen fault is a grand challenge.
Asking the user to provide fixes for every fault is bad for productivity,
especially when the users are non-savvy in technical aspect of computing. If
failure scenarios come into existence, the user wants the runtime environment
to handle those situations autonomically. This paper presents a new technique
of finding self-healing actions by matching a fault scenario to already
established fault models. By profiling and capturing runtime parameters and
execution pathWays, stable execution models are established and later are used
to match with an unstable execution scenario. Experimentation and results are
presented that showed that even with additional overheads; this technique can
prove beneficial for autonomically healing faults and reliving system
administrators from mundane troubleshooting situations.
","[{'version': 'v1', 'created': 'Mon, 26 Mar 2012 18:07:54 GMT'}]",2012-03-27,"[['Fuad', 'Mohammad Muztaba', ''], ['Deb', 'Debzani', ''], ['Baek', 'Jinsuk', '']]","['Self-adaptive application', 'Autonomic computing', 'Code transformation', 'Fault similarity']"
1643,1907.09077,Ruizhe Cai,"Ruizhe Cai, Ao Ren, Olivia Chen, Ning Liu, Caiwen Ding, Xuehai Qian,
  Jie Han, Wenhui Luo, Nobuyuki Yoshikawa, Yanzhi Wang","A Stochastic-Computing based Deep Learning Framework using Adiabatic
  Quantum-Flux-Parametron SuperconductingTechnology",,,10.1145/3307650.3322270,,cs.NE cs.ET cs.LG eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Adiabatic Quantum-Flux-Parametron (AQFP) superconducting technology has
been recently developed, which achieves the highest energy efficiency among
superconducting logic families, potentially huge gain compared with
state-of-the-art CMOS. In 2016, the successful fabrication and testing of
AQFP-based circuits with the scale of 83,000 JJs have demonstrated the
scalability and potential of implementing large-scale systems using AQFP. As a
result, it will be promising for AQFP in high-performance computing and deep
space applications, with Deep Neural Network (DNN) inference acceleration as an
important example. Besides ultra-high energy efficiency, AQFP exhibits two
unique characteristics: the deep pipelining nature since each AQFP logic gate
is connected with an AC clock signal, which increases the difficulty to avoid
RAW hazards; the second is the unique opportunity of true random number
generation (RNG) using a single AQFP buffer, far more efficient than RNG in
CMOS. We point out that these two characteristics make AQFP especially
compatible with the \emph{stochastic computing} (SC) technique, which uses a
time-independent bit sequence for value representation, and is compatible with
the deep pipelining nature. Further, the application of SC has been
investigated in DNNs in prior work, and the suitability has been illustrated as
SC is more compatible with approximate computations. This work is the first to
develop an SC-based DNN acceleration framework using AQFP technology.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2019 01:44:49 GMT'}]",2019-07-23,"[['Cai', 'Ruizhe', ''], ['Ren', 'Ao', ''], ['Chen', 'Olivia', ''], ['Liu', 'Ning', ''], ['Ding', 'Caiwen', ''], ['Qian', 'Xuehai', ''], ['Han', 'Jie', ''], ['Luo', 'Wenhui', ''], ['Yoshikawa', 'Nobuyuki', ''], ['Wang', 'Yanzhi', '']]","['Stochastic Computing', 'Deep Learning', 'Adiabatic QuantumFlux-Parametron', 'Superconducting']"
1644,1212.4034,Martin Kasparick,"Gerhard Wunder, Martin Kasparick, Stephan ten Brink, Frank Schaich,
  Thorsten Wild, Ivan Gaspar, Eckhard Ohlmer, Stefan Krone, Nicola Michailow,
  Ainoa Navarro, Gerhard Fettweis, Dimitri Ktenas, Vincent Berg, Marcin
  Dryjanski, Slawomir Pietrzyk, Bertalan Eged","5GNOW: Challenging the LTE Design Paradigms of Orthogonality and
  Synchronicity","Submitted to Workshop on Mobile and Wireless Communication Systems
  for 2020 and beyond (at IEEE VTC 2013, Spring)",,10.1109/VTCSpring.2013.6691814,,cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  LTE and LTE-Advanced have been optimized to deliver high bandwidth pipes to
wireless users. The transport mechanisms have been tailored to maximize single
cell performance by enforcing strict synchronism and orthogonality within a
single cell and within a single contiguous frequency band. Various emerging
trends reveal major shortcomings of those design criteria: 1) The fraction of
machine-type-communications (MTC) is growing fast. Transmissions of this kind
are suffering from the bulky procedures necessary to ensure strict synchronism.
2) Collaborative schemes have been introduced to boost capacity and coverage
(CoMP), and wireless networks are becoming more and more heterogeneous
following the non-uniform distribution of users. Tremendous efforts must be
spent to collect the gains and to manage such systems under the premise of
strict synchronism and orthogonality. 3) The advent of the Digital Agenda and
the introduction of carrier aggregation are forcing the transmission systems to
deal with fragmented spectrum. 5GNOW is an European research project supported
by the European Commission within FP7 ICT Call 8. It will question the design
targets of LTE and LTE-Advanced having these shortcomings in mind and the
obedience to strict synchronism and orthogonality will be challenged. It will
develop new PHY and MAC layer concepts being better suited to meet the upcoming
needs with respect to service variety and heterogeneous transmission setups.
Wireless transmission networks following the outcomes of 5GNOW will be better
suited to meet the manifoldness of services, device classes and transmission
setups present in envisioned future scenarios like smart cities. The
integration of systems relying heavily on MTC into the communication network
will be eased. The per-user experience will be more uniform and satisfying. To
ensure this 5GNOW will contribute to upcoming 5G standardization.
","[{'version': 'v1', 'created': 'Mon, 17 Dec 2012 15:46:56 GMT'}]",2016-11-18,"[['Wunder', 'Gerhard', ''], ['Kasparick', 'Martin', ''], ['Brink', 'Stephan ten', ''], ['Schaich', 'Frank', ''], ['Wild', 'Thorsten', ''], ['Gaspar', 'Ivan', ''], ['Ohlmer', 'Eckhard', ''], ['Krone', 'Stefan', ''], ['Michailow', 'Nicola', ''], ['Navarro', 'Ainoa', ''], ['Fettweis', 'Gerhard', ''], ['Ktenas', 'Dimitri', ''], ['Berg', 'Vincent', ''], ['Dryjanski', 'Marcin', ''], ['Pietrzyk', 'Slawomir', ''], ['Eged', 'Bertalan', '']]","['LTE-Advanced', 'MTC', 'COMP', '(Non-)Othogonality', '(A-)Synchronicity', 'Waveforms', 'GFDM', 'FBMC']"
1645,1207.2597,Saket Warade Mr.,"Saket Warade, Jagannath Aghav, Petitpierre Claude, Sandeep Udayagiri",Automated Training and Maintenance through Kinect,"14 pages, 5 figures, 1 Algorithm","Warades, S; Aghav, J; Claude, P; Udayagiri, S;,""Automated Training
  and Maintenance through Kinect,""International Journal of Computer Science,
  Engineering and Applications (IJCSEA) Vol.2, No.3, June 2012",10.5121/ijcsea.2012.2315,,cs.CV cs.ET cs.GR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we have worked on reducing burden on mechanic involving
complex automobile maintenance activities that are performed in centralised
workshops. We have presented a system prototype that combines Augmented Reality
with Kinect. With the use of Kinect, very high quality sensors are available at
considerably low costs, thus reducing overall expenditure for system design.
The system can be operated either in Speech mode or in Gesture mode. The system
can be controlled by various audio commands if user opts for Speech mode. The
same controlling can also be done by using a set of Gestures in Gesture mode.
  Gesture recognition is the task performed by Kinect system. This system,
bundled with RGB and Depth camera, processes the skeletal data by keeping track
of 20 different body joints. Recognizing Gestures is done by verifying user
movements and checking them against predefined condition. Augmented Reality
module captures real-time image data streams from high resolution camera. This
module then generates 3D model that is superimposed on real time data.
","[{'version': 'v1', 'created': 'Wed, 11 Jul 2012 11:17:28 GMT'}]",2012-07-12,"[['Warade', 'Saket', ''], ['Aghav', 'Jagannath', ''], ['Claude', 'Petitpierre', ''], ['Udayagiri', 'Sandeep', '']]","['Kinect', 'Augmented Reality', 'Depth Imaging', 'Skeleton Tracking']"
1646,2008.11308,Karishma Sharma,"Karishma Sharma, Yizhou Zhang, Emilio Ferrara, Yan Liu","Identifying Coordinated Accounts on Social Media through Hidden
  Influence and Group Behaviours",KDD'2021 (Accepted),"ACM SIGKDD International Conference on Knowledge Discovery & Data
  Mining 2021",,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Disinformation campaigns on social media, involving coordinated activities
from malicious accounts towards manipulating public opinion, have become
increasingly prevalent. Existing approaches to detect coordinated accounts
either make very strict assumptions about coordinated behaviours, or require
part of the malicious accounts in the coordinated group to be revealed in order
to detect the rest. To address these drawbacks, we propose a generative model,
AMDN-HAGE (Attentive Mixture Density Network with Hidden Account Group
Estimation) which jointly models account activities and hidden group behaviours
based on Temporal Point Processes (TPP) and Gaussian Mixture Model (GMM), to
capture inherent characteristics of coordination which is, accounts that
coordinate must strongly influence each other's activities, and collectively
appear anomalous from normal accounts. To address the challenges of optimizing
the proposed model, we provide a bilevel optimization algorithm with
theoretical guarantee on convergence. We verified the effectiveness of the
proposed method and training algorithm on real-world social network data
collected from Twitter related to coordinated campaigns from Russia's Internet
Research Agency targeting the 2016 U.S. Presidential Elections, and to identify
coordinated campaigns related to the COVID-19 pandemic. Leveraging the learned
model, we find that the average influence between coordinated account pairs is
the highest.On COVID-19, we found coordinated group spreading anti-vaccination,
anti-masks conspiracies that suggest the pandemic is a hoax and political scam.
","[{'version': 'v1', 'created': 'Tue, 25 Aug 2020 23:35:01 GMT'}, {'version': 'v2', 'created': 'Tue, 18 May 2021 08:13:48 GMT'}]",2021-05-19,"[['Sharma', 'Karishma', ''], ['Zhang', 'Yizhou', ''], ['Ferrara', 'Emilio', ''], ['Liu', 'Yan', '']]","['Coordinated Influence Campaigns', 'Disinformation', 'Social Media', 'Fake News', 'Temporal Point Process']"
1647,1409.8186,Bertrand Thierry,"Bertrand Thierry and Xavier Antoine and Chokri Chniti and Hasan
  Alzubaidi","$\mu$-diff: an open-source Matlab toolbox for computing multiple
  scattering problems by disks","27 pages, 15 figures, associated code available online at
  http://mu-diff.math.cnrs.fr",,10.1016/j.cpc.2015.03.013,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of this paper is to describe a Matlab toolbox, called $\mu$-diff, for
modeling and numerically solving two-dimensional complex multiple scattering by
a large collection of circular cylinders. The approximation methods in
$\mu$-diff are based on the Fourier series expansions of the four basic
integral operators arising in scattering theory. Based on these expressions, an
efficient spectrally accurate finite-dimensional solution of multiple
scattering problems can be simply obtained for complex media even when many
scatterers are considered as well as large frequencies. The solution of the
global linear system to solve can use either direct solvers or preconditioned
iterative Krylov subspace solvers for block Toeplitz matrices. Based on this
approach, this paper explains how the code is built and organized. Some
complete numerical examples of applications (direct and inverse scattering) are
provided to show that $\mu$-diff is a flexible, efficient and robust toolbox
for solving some complex multiple scattering problems.
","[{'version': 'v1', 'created': 'Mon, 29 Sep 2014 16:48:16 GMT'}]",2015-05-20,"[['Thierry', 'Bertrand', ''], ['Antoine', 'Xavier', ''], ['Chniti', 'Chokri', ''], ['Alzubaidi', 'Hasan', '']]","['Multiple scattering', 'wave propagation', 'acoustics', 'electromagnetism', 'optics', 'computational methods', 'numerical simulation', 'spectral method']"
1648,2212.10324,Michael Sober,"Michael Sober, Max Kobelt, Giulia Scaffino, Dominik Kaaser, Stefan
  Schulte",Distributed Key Generation with Smart Contracts using zk-SNARKs,,"The 38th ACM/SIGAPP Symposium on Applied Computing (SAC '23),
  March 27-31, 2023, Tallinn, Estonia",10.1145/3555776.3577677,,cs.CR cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Distributed Key Generation (DKG) is an extensively researched topic as it is
fundamental to threshold cryptosystems. Emerging technologies such as
blockchains benefit massively from applying threshold cryptography in consensus
protocols, randomness beacons, and threshold signatures. However, blockchains
and smart contracts also enable further improvements of DKG protocols by
providing a decentralized computation and communication platform.
  For that reason, we propose a DKG protocol that uses smart contracts to
ensure the correct execution of the protocol, allow dynamic participation, and
provide crypto-economic incentives to encourage honest behavior. The DKG
protocol uses a dispute and key derivation mechanism based on Zero-Knowledge
Succinct Non-interactive Arguments of Knowledge (zk-SNARKs) to reduce the costs
of applying smart contracts by moving the computations off-chain, where the
smart contract only verifies the correctness of the computation.
","[{'version': 'v1', 'created': 'Tue, 20 Dec 2022 15:15:55 GMT'}]",2022-12-23,"[['Sober', 'Michael', ''], ['Kobelt', 'Max', ''], ['Scaffino', 'Giulia', ''], ['Kaaser', 'Dominik', ''], ['Schulte', 'Stefan', '']]","['Distributed key generation', 'zero-knowledge proofs', 'smart contracts', 'blockchain']"
1649,1912.04883,Manish Raghavan,"Rediet Abebe, Solon Barocas, Jon Kleinberg, Karen Levy, Manish
  Raghavan, David G. Robinson",Roles for Computing in Social Change,,,10.1145/3351095.3372871,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  A recent normative turn in computer science has brought concerns about
fairness, bias, and accountability to the core of the field. Yet recent
scholarship has warned that much of this technical work treats problematic
features of the status quo as fixed, and fails to address deeper patterns of
injustice and inequality. While acknowledging these critiques, we posit that
computational research has valuable roles to play in addressing social problems
-- roles whose value can be recognized even from a perspective that aspires
toward fundamental social change. In this paper, we articulate four such roles,
through an analysis that considers the opportunities as well as the significant
risks inherent in such work. Computing research can serve as a diagnostic,
helping us to understand and measure social problems with precision and
clarity. As a formalizer, computing shapes how social problems are explicitly
defined --- changing how those problems, and possible responses to them, are
understood. Computing serves as rebuttal when it illuminates the boundaries of
what is possible through technical means. And computing acts as synecdoche when
it makes long-standing social problems newly salient in the public eye. We
offer these paths forward as modalities that leverage the particular strengths
of computational work in the service of social change, without overclaiming
computing's capacity to solve social problems on its own.
","[{'version': 'v1', 'created': 'Tue, 10 Dec 2019 18:46:42 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Dec 2019 18:42:38 GMT'}, {'version': 'v3', 'created': 'Tue, 28 Jan 2020 09:49:32 GMT'}, {'version': 'v4', 'created': 'Thu, 9 Jul 2020 15:29:07 GMT'}]",2020-07-10,"[['Abebe', 'Rediet', ''], ['Barocas', 'Solon', ''], ['Kleinberg', 'Jon', ''], ['Levy', 'Karen', ''], ['Raghavan', 'Manish', ''], ['Robinson', 'David G.', '']]","['social change', 'inequality', 'discrimination', 'societal implications ofAI']"
1650,1109.1062,Victo Sudha george,G. Victo Sudha George and V.Cyril Raj,"Review on Feature Selection Techniques and the Impact of SVM for Cancer
  Classification using Gene Expression Profile",12 pages,"International Journal of Computer Science & Engineering Survey
  (IJCSES) Vol.2, No.3, International Journal of Computer Science & Engineering
  Survey (IJCSES) Vol.2, No.3, August 2011",10.5121/ijcses.2011.2302,,cs.CE cs.ET cs.LG q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The DNA microarray technology has modernized the approach of biology research
in such a way that scientists can now measure the expression levels of
thousands of genes simultaneously in a single experiment. Gene expression
profiles, which represent the state of a cell at a molecular level, have great
potential as a medical diagnosis tool. But compared to the number of genes
involved, available training data sets generally have a fairly small sample
size for classification. These training data limitations constitute a challenge
to certain classification methodologies. Feature selection techniques can be
used to extract the marker genes which influence the classification accuracy
effectively by eliminating the un wanted noisy and redundant genes This paper
presents a review of feature selection techniques that have been employed in
micro array data based cancer classification and also the predominant role of
SVM for cancer classification.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2011 04:42:55 GMT'}]",2011-09-07,"[['George', 'G. Victo Sudha', ''], ['Raj', 'V. Cyril', '']]","['Microarray', 'feature selection', 'cancer classification', 'integrative gene selection']"
1651,1702.01398,Luca Maria Aiell,"Luca Maria Aiello, Nicola Barbieri",Evolution of Ego-networks in Social Media with Link Recommendations,"Proceedings of the 10th ACM International Conference on Web Search
  and Data Mining (WSDM 2017), Cambridge, UK. 10 pages, 16 figures, 1 table",,10.1145/3018661.3018733,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ego-networks are fundamental structures in social graphs, yet the process of
their evolution is still widely unexplored. In an online context, a key
question is how link recommender systems may skew the growth of these networks,
possibly restraining diversity. To shed light on this matter, we analyze the
complete temporal evolution of 170M ego-networks extracted from Flickr and
Tumblr, comparing links that are created spontaneously with those that have
been algorithmically recommended. We find that the evolution of ego-networks is
bursty, community-driven, and characterized by subsequent phases of explosive
diameter increase, slight shrinking, and stabilization. Recommendations favor
popular and well-connected nodes, limiting the diameter expansion. With a
matching experiment aimed at detecting causal relationships from observational
data, we find that the bias introduced by the recommendations fosters global
diversity in the process of neighbor selection. Last, with two link prediction
experiments, we show how insights from our analysis can be used to improve the
effectiveness of social recommender systems.
","[{'version': 'v1', 'created': 'Sun, 5 Feb 2017 13:14:36 GMT'}]",2017-02-07,"[['Aiello', 'Luca Maria', ''], ['Barbieri', 'Nicola', '']]","['Network evolution', 'ego-networks', 'link recommendation', 'groups', 'communities', 'social media', 'Tumblr', 'Flickr']"
1652,1208.2265,Ranjita Swain,"Ranjita Kumari Swain (RIMS, Rourkela), Prafulla Kumar Behera (Utkal
  University, Vani Vihar) and Durga Prasad Mohapatra (NIT, Rourkela)","Minimal TestCase Generation for Object-Oriented Software with State
  Charts","21 pages, 7 figures, 3-4 tables; International Journal of Software
  Engineering & Applications (IJSEA), Vol.3, No.4, July 2012. arXiv admin note:
  substantial text overlap with arXiv:1206.0373",,10.5121/ijsea.2012.3404,,cs.SE,http://creativecommons.org/licenses/publicdomain/,"  Today statecharts are a de facto standard in industry for modeling system
behavior. Test data generation is one of the key issues in software testing.
This paper proposes an reduction approach to test data generation for the
state-based software testing. In this paper, first state transition graph is
derived from state chart diagram. Then, all the required information are
extracted from the state chart diagram. Then, test cases are generated. Lastly,
a set of test cases are minimized by calculating the node coverage for each
test case. It is also determined that which test cases are covered by other
test cases. The advantage of our test generation technique is that it optimizes
test coverage by minimizing time and cost. The present test data generation
scheme generates test cases which satisfy transition path coverage criteria,
path coverage criteria and action coverage criteria. A case study on Railway
Ticket Vending Machine (RTVM) has been presented to illustrate our approach.
","[{'version': 'v1', 'created': 'Fri, 10 Aug 2012 04:39:26 GMT'}]",2012-08-14,"[['Swain', 'Ranjita Kumari', '', 'RIMS, Rourkela'], ['Behera', 'Prafulla Kumar', '', 'Utkal\n  University, Vani Vihar'], ['Mohapatra', 'Durga Prasad', '', 'NIT, Rourkela']]","['Test generation technique', 'Test sequence generation', 'State chart diagram / State charts', 'Test Case Generation', 'Test Coverage', 'Test Optimization']"
1653,1701.02440,Maziar Raissi,Maziar Raissi and George Em. Karniadakis,"Machine Learning of Linear Differential Equations using Gaussian
  Processes",,,10.1016/j.jcp.2017.07.050,,cs.LG math.NA stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work leverages recent advances in probabilistic machine learning to
discover conservation laws expressed by parametric linear equations. Such
equations involve, but are not limited to, ordinary and partial differential,
integro-differential, and fractional order operators. Here, Gaussian process
priors are modified according to the particular form of such operators and are
employed to infer parameters of the linear equations from scarce and possibly
noisy observations. Such observations may come from experiments or ""black-box""
computer simulations.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2017 05:14:22 GMT'}]",2017-09-13,"[['Raissi', 'Maziar', ''], ['Karniadakis', 'George Em.', '']]","['probabilistic machine learning', 'differential equations', 'Gaussianprocesses', 'inverse problems', 'uncertainty quantification']"
1654,1501.00105,Gholamreza Anbarjafari,Gholamreza Anbarjafari,"Face recognition using color local binary pattern from mutually
  independent color channels","11 pages in EURASIP Journal on Image and Video Processing, 2013",,10.1186/1687-5281-2013-6,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a high performance face recognition system based on local
binary pattern (LBP) using the probability distribution functions (PDF) of
pixels in different mutually independent color channels which are robust to
frontal homogenous illumination and planer rotation is proposed. The
illumination of faces is enhanced by using the state-of-the-art technique which
is using discrete wavelet transform (DWT) and singular value decomposition
(SVD). After equalization, face images are segmented by use of local Successive
Mean Quantization Transform (SMQT) followed by skin color based face detection
system. Kullback-Leibler Distance (KLD) between the concatenated PDFs of a
given face obtained by LBP and the concatenated PDFs of each face in the
database is used as a metric in the recognition process. Various decision
fusion techniques have been used in order to improve the recognition rate. The
proposed system has been tested on the FERET, HP, and Bosphorus face databases.
The proposed system is compared with conventional and thestate-of-the-art
techniques. The recognition rates obtained using FVF approach for FERET
database is 99.78% compared with 79.60% and 68.80% for conventional gray scale
LBP and Principle Component Analysis (PCA) based face recognition techniques
respectively.
","[{'version': 'v1', 'created': 'Wed, 31 Dec 2014 10:14:25 GMT'}]",2015-01-06,"[['Anbarjafari', 'Gholamreza', '']]","['Illumination robust', 'Local binary pattern', 'Face recognition', 'Probability distribution function', 'Discretewavelet transform', 'Kullback–Leibler distance']"
1655,2206.05438,\'Etienne Andr\'e,"\'Etienne Andr\'e, Didier Lime, Dylan Marinho and Jun Sun",Guaranteeing Timed Opacity using Parametric Timed Model Checking,"This is the author version of the manuscript of the same name
  published in ACM Transactions on Software Engineering and Methodology
  (ToSEM). This work is partially supported by the ANR national research
  program PACS (ANR-14-CE28-0002), by the ANR-NRF research program ProMiS
  (ANR-19-CE25-0015), and by ERATO HASUO Metamathematics for Systems Design
  Project (No. JPMJER1603), JST. arXiv admin note: substantial text overlap
  with arXiv:1907.00537","ACM Transactions on Software Engineering and Methodology (ToSEM),
  Volume 31(4), 2022",10.1145/3502851,,cs.CR cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information leakage can have dramatic consequences on systems security. Among
harmful information leaks, the timing information leakage occurs whenever an
attacker successfully deduces confidential internal information. In this work,
we consider that the attacker has access (only) to the system execution time.
We address the following timed opacity problem: given a timed system, a private
location and a final location, synthesize the execution times from the initial
location to the final location for which one cannot deduce whether the system
went through the private location. We also consider the full timed opacity
problem, asking whether the system is opaque for all execution times. We show
that these problems are decidable for timed automata (TAs) but become
undecidable when one adds parameters, yielding parametric timed automata
(PTAs). We identify a subclass with some decidability results. We then devise
an algorithm for synthesizing PTAs parameter valuations guaranteeing that the
resulting TA is opaque. We finally show that our method can also apply to
program analysis.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2022 06:26:46 GMT'}]",2022-10-05,"[['André', 'Étienne', ''], ['Lime', 'Didier', ''], ['Marinho', 'Dylan', ''], ['Sun', 'Jun', '']]","['opacity', 'timed automata', 'IMITATOR', 'parameter synthesis']"
1656,1704.09026,Andr\'es Ezequiel Viso,Juan Edi and Andr\'es Viso and Eduardo Bonelli,Efficient Type Checking for Path Polymorphism,,,10.4230/LIPIcs.TYPES.2015.6,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A type system combining type application, constants as types, union types
(associative, commutative and idempotent) and recursive types has recently been
proposed for statically typing path polymorphism, the ability to define
functions that can operate uniformly over recursively specified applicative
data structures. A typical pattern such functions resort to is $x\,y$ which
decomposes a compound, in other words any applicative tree structure, into its
parts. We study type-checking for this type system in two stages. First we
propose algorithms for checking type equivalence and subtyping based on
coinductive characterizations of those relations. We then formulate a
syntax-directed presentation and prove its equivalence with the original one.
This yields a type-checking algorithm which unfortunately has exponential time
complexity in the worst case. A second algorithm is then proposed, based on
automata techniques, which yields a polynomial-time type-checking algorithm.
","[{'version': 'v1', 'created': 'Fri, 28 Apr 2017 17:50:24 GMT'}]",2020-06-30,"[['Edi', 'Juan', ''], ['Viso', 'Andrés', ''], ['Bonelli', 'Eduardo', '']]","['λ-Calculus', 'Pattern Matching', 'Path Polymorphism', 'Type Checking']"
1657,1802.09393,Henry Edison,"Henry Edison, Nina M. Sm{\o}rsg{\aa}rd, Xiaofeng Wang and Pekka
  Abrahamsson","Lean Internal Startups for Software Product Innovation in Large
  Companies: Enablers and Inhibitors",,"Journal of Systems and Software, 135, pp. 69-87, 2018",10.1016/j.jss.2017.09.034,,cs.CY cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  To compete in this age of disruption, large companies cannot rely on cost
efficiency, lead time reduction and quality improvement. They are now looking
for ways to innovate like startups. Meanwhile, the awareness and use of the
Lean startup approach have grown rapidly amongst the software startup community
in recent years. This study investigates how Lean internal startup facilitates
software product innovation in large companies and identifies its enablers and
inhibitors. A multiple case study approach is followed in the investigation.
Two software product innovation projects from two large companies are examined,
using a conceptual framework that is based on the method-in-action framework
and extended with the previously developed Lean-Internal Corporate Venture
model. Seven face-to-face in-depth interviews of the employees with different
roles are conducted. Within-case analysis and cross-case comparison are applied
to draw the findings from the cases. A generic process flow summarises the
common key processes of Lean internal startups. The findings suggest that an
internal startup that is initiated management or employees faces different
challenges. A list of enablers of applying Lean startup in large companies are
identified, including top management support and cross-functional team. Both
cases face different inhibitors due to the different process of inception,
objective of the team and type of the product. Our contributions are threefold.
First, this study is one of the first attempt to investigate the use of Lean
startup approach in large companies empirically. Second, the study shows the
potential of the method-in-action framework to investigate the Lean startup
approach in non-startup context. The third is a general process of Lean
internal startup and the evidence of the enablers and inhibitors of
implementing it, which are both theory-informed and empirically grounded.
","[{'version': 'v1', 'created': 'Fri, 23 Feb 2018 15:51:04 GMT'}]",2018-02-27,"[['Edison', 'Henry', ''], ['Smørsgård', 'Nina M.', ''], ['Wang', 'Xiaofeng', ''], ['Abrahamsson', 'Pekka', '']]","['Lean startup', 'internal startup', 'software product innovation', 'large companies', 'method-in-action', 'Lean internal startup']"
1658,1806.11527,Ren\'e van Bevern,Ren\'e van Bevern and Oxana Yu. Tsidulko and Philipp Zschoche,"Representative families for matroid intersections, with applications to
  location, packing, and covering problems","Restructuring (focus on representative families instead of facility
  location), slight running time improvements, algorithms factored out","Discrete Applied Mathematics, 298: 110-128, 2021",10.1016/j.dam.2021.03.014,,cs.DS cs.DM math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show algorithms for computing representative families for matroid
intersections and use them in fixed-parameter algorithms for set packing, set
covering, and facility location problems with multiple matroid constraints. We
complement our tractability results by hardness results.
","[{'version': 'v1', 'created': 'Fri, 29 Jun 2018 16:45:42 GMT'}, {'version': 'v2', 'created': 'Sun, 30 Sep 2018 08:03:36 GMT'}, {'version': 'v3', 'created': 'Sat, 13 Oct 2018 08:51:55 GMT'}, {'version': 'v4', 'created': 'Sun, 28 Feb 2021 10:00:39 GMT'}]",2021-09-14,"[['van Bevern', 'René', ''], ['Tsidulko', 'Oxana Yu.', ''], ['Zschoche', 'Philipp', '']]","['combinatorial optimization', 'matroid set packing', 'matroid parity', 'matroid median']"
1659,1907.10385,Luisito Lacatan,"Yolanda D Austria, Luisito L. Lacatan, John Gregory D Funtera, Shawn
  C. Garcia, Jonet H. Montenegro, Laymar T. Santilleces",Face Recognition for Motorcycle Engine Ignition with Messaging System,"9 pages, 9 figures, 2017 1st International Conference on Redesigning,
  Re-engineering Academic Direction for Global Competitiveness",2018 International Journal of Computing Sciences Research (IJCSR),10.25147/ijcsr.2017.001.1.11,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this current world where technology is growing up day by day and
scientific researchers are presenting new era of discoveries, the need for
security is also increasing in all areas. At present, the vehicle usage is
basic necessity for everyone. Simultaneously, protecting the vehicle against
theft is also very important. Traditional vehicle security system depends on
many sensors and cost is also high. When the vehicle is stolen, no more
response or alternative could be available to help the owner of the vehicle to
find it back. The main goal of this paper is to protect the vehicle from any
unauthorized access, using fast, easy-to-use, clear, reliable and economical
face recognition technique. An efficient automotive security system is
implemented for anti-theft using an embedded system for starting the engine by
the use of face recognition and integrated with Global Positioning System (GPS)
and Global System for Mobile Communication (GSM). This proposed work is an
attempt to design and develop a smart anti-theft system that uses Face
recognition, GPS and GSM system to prevent theft and to determine the exact
location of vehicle.
","[{'version': 'v1', 'created': 'Wed, 17 Jul 2019 14:26:08 GMT'}]",2019-07-25,"[['Austria', 'Yolanda D', ''], ['Lacatan', 'Luisito L.', ''], ['Funtera', 'John Gregory D', ''], ['Garcia', 'Shawn C.', ''], ['Montenegro', 'Jonet H.', ''], ['Santilleces', 'Laymar T.', '']]","['camera', 'face recognition', 'GSM module', 'GPS module', 'keypad']"
1660,2104.10570,Barnaby Martin,"Benoit Larose and Petar Markovic and Barnaby Martin and Daniel
  Paulusma and Siani Smith and Stanislav Zivny",QCSP on Reflexive Tournaments,arXiv admin note: text overlap with arXiv:1709.09486,ACM Trans. Comput. Log. 23(3): 14:1-14:22 (2022),10.1145/3508069,,cs.CC,http://creativecommons.org/licenses/by/4.0/,"  We give a complexity dichotomy for the Quantified Constraint Satisfaction
Problem QCSP(H) when H is a reflexive tournament. It is well-known that
reflexive tournaments can be split into a sequence of strongly connected
components H_1,...,H_n so that there exists an edge from every vertex of H_i to
every vertex of H_j if and only if i<j. We prove that if H has both its initial
and final strongly connected component (possibly equal) of size 1, then QCSP(H)
is in NL and otherwise QCSP(H) is NP-hard.
","[{'version': 'v1', 'created': 'Wed, 21 Apr 2021 14:53:48 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Dec 2021 17:45:45 GMT'}]",2022-04-13,"[['Larose', 'Benoit', ''], ['Markovic', 'Petar', ''], ['Martin', 'Barnaby', ''], ['Paulusma', 'Daniel', ''], ['Smith', 'Siani', ''], ['Zivny', 'Stanislav', '']]","['computational complexity', 'algorithmic graph theory', 'quantified constraints', 'universalalgebra', 'constraint satisfaction']"
1661,0805.3538,Wojciech Mazurczyk,Wojciech Mazurczyk and Krzysztof Szczypiorski,Covert Channels in SIP for VoIP signalling,"8 pages, 4 figures",,10.1007/978-3-540-69403-8_9,,cs.MM cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we evaluate available steganographic techniques for SIP
(Session Initiation Protocol) that can be used for creating covert channels
during signaling phase of VoIP (Voice over IP) call. Apart from characterizing
existing steganographic methods we provide new insights by introducing new
techniques. We also estimate amount of data that can be transferred in
signalling messages for typical IP telephony call.
","[{'version': 'v1', 'created': 'Thu, 22 May 2008 20:43:38 GMT'}]",2009-11-13,"[['Mazurczyk', 'Wojciech', ''], ['Szczypiorski', 'Krzysztof', '']]","['VoIP', 'SIP', 'information hiding', 'steganography']"
1662,1503.04957,Andrea Burattin,"Andrea Burattin, Fabrizio Maria Maggi, Alessandro Sperduti","Conformance Checking Based on Multi-Perspective Declarative Process
  Models",,,10.1016/j.eswa.2016.08.040,,cs.SE cs.DB cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Process mining is a family of techniques that aim at analyzing business
process execution data recorded in event logs. Conformance checking is a branch
of this discipline embracing approaches for verifying whether the behavior of a
process, as recorded in a log, is in line with some expected behaviors provided
in the form of a process model. The majority of these approaches require the
input process model to be procedural (e.g., a Petri net). However, in turbulent
environments, characterized by high variability, the process behavior is less
stable and predictable. In these environments, procedural process models are
less suitable to describe a business process. Declarative specifications,
working in an open world assumption, allow the modeler to express several
possible execution paths as a compact set of constraints. Any process execution
that does not contradict these constraints is allowed. One of the open
challenges in the context of conformance checking with declarative models is
the capability of supporting multi-perspective specifications. In this paper,
we close this gap by providing a framework for conformance checking based on
MP-Declare, a multi-perspective version of the declarative process modeling
language Declare. The approach has been implemented in the process mining tool
ProM and has been experimented in three real life case studies.
","[{'version': 'v1', 'created': 'Tue, 17 Mar 2015 09:09:30 GMT'}]",2016-08-19,"[['Burattin', 'Andrea', ''], ['Maggi', 'Fabrizio Maria', ''], ['Sperduti', 'Alessandro', '']]","['Process Mining', 'Conformance Checking', 'Linear Temporal Logic', 'Business Constraints', 'Declare']"
1663,1901.01185,Jeman Park,"Aziz Mohaisen, Omar Alrawi, Jeman Park, Joongheon Kim, DaeHun Nyang,
  Manar Mohaisen","Network-based Analysis and Classification of Malware using Behavioral
  Artifacts Ordering",14 pages,"EAI Endorsed Transactions on Security and Safety, 5(16), 2018",10.4108/eai.13-7-2018.156002,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using runtime execution artifacts to identify malware and its associated
family is an established technique in the security domain. Many papers in the
literature rely on explicit features derived from network, file system, or
registry interaction. While effective, the use of these fine-granularity data
points makes these techniques computationally expensive. Moreover, the
signatures and heuristics are often circumvented by subsequent malware authors.
In this work, we propose Chatter, a system that is concerned only with the
order in which high-level system events take place. Individual events are
mapped onto an alphabet and execution traces are captured via terse
concatenations of those letters. Then, leveraging an analyst labeled corpus of
malware, n-gram document classification techniques are applied to produce a
classifier predicting malware family. This paper describes that technique and
its proof-of-concept evaluation. In its prototype form, only network events are
considered and eleven malware families are used. We show the technique achieves
83%-94% accuracy in isolation and makes non-trivial performance improvements
when integrated with a baseline classifier of combined order features to reach
an accuracy of up to 98.8%.
","[{'version': 'v1', 'created': 'Fri, 4 Jan 2019 15:54:25 GMT'}]",2019-01-07,"[['Mohaisen', 'Aziz', ''], ['Alrawi', 'Omar', ''], ['Park', 'Jeman', ''], ['Kim', 'Joongheon', ''], ['Nyang', 'DaeHun', ''], ['Mohaisen', 'Manar', '']]","['Malware', 'behavior-based analysis', 'classification', 'machine learning', 'n-grams']"
1664,2205.00183,Katie Seaborn,"Katie Seaborn, Peter Pennefather","Neither ""Hear"" Nor ""Their"": Interrogating Gender Neutrality in Robots",Accepted at HRI '22,"Proceedings of the 2022 ACM/IEEE International Conference on
  Human-Robot Interaction (HRI '22), 1030-1034",10.5555/3523760.3523929,,cs.RO cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Gender is a social framework through which people organize themselves-and
non-human subjects, including robots. Research stretching back decades has
found evidence that people tend to gender artificial agents unwittingly, even
with the slightest cue of humanlike features in voice, body, role, and other
social features. This has led to the notion of gender neutrality in robots:
ways in which we can avoid gendering robots in line with human models, as well
explorations of extra-human genders. This rapid review critically surveyed the
literature to capture the state of art on gender neutrality in robots that
interact with people. We present findings on theory, methods, results, and
reflexivity. We interrogate the very idea that robot gender/ing can be neutral
and explore alternate ways of approaching gender/ing through the design and
study of robots interacting with people.
","[{'version': 'v1', 'created': 'Sat, 30 Apr 2022 07:12:21 GMT'}]",2022-05-03,"[['Seaborn', 'Katie', ''], ['Pennefather', 'Peter', '']]","['robots', 'gender', 'gender neutral', 'perceptions of robots']"
1665,1603.09386,Evripidis Paraskevas,"Evripidis Paraskevas, Kyriakos Manousakis, Subir Das and John S. Baras",Multi-Metric Energy Efficient Routing in Mobile Ad-Hoc Networks,"6 pages, Appeared in IEEE MILCOM 2014",,10.1109/MILCOM.2014.193,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Increasing network lifetime by reducing energy consumption across the network
is one of the major concerns while designing routing protocols for Mobile
Ad-Hoc Networks. In this paper, we investigate the main reasons that lead to
energy depletion and we introduce appropriate routing metrics in the routing
decision scheme to mitigate their effect and increase the network lifetime. For
our routing scheme, we take into consideration multiple layer parameters, such
as MAC queue utilization, node degree and residual energy. We integrate our
multi-metric routing scheme into OLSR, a standard MANET proactive routing
protocol. We evaluate via simulations in NS3 the protocol modifications under a
range of different static and mobile scenarios. The main observations are that
in static and low mobility scenarios our modified routing protocol leads to a
significant increase (5\%-20\%) in network lifetime compared to standard OLSR
and slightly better performance in terms of Packet Delivery Ratio (PDR).
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2016 21:11:36 GMT'}]",2016-11-15,"[['Paraskevas', 'Evripidis', ''], ['Manousakis', 'Kyriakos', ''], ['Das', 'Subir', ''], ['Baras', 'John S.', '']]","['Routing', 'Energy efficient', 'OLSR', 'MANET']"
1666,0912.5506,Panos Papadimitratos,"J. Panchard, P. R. S. Rao, M. S. Sheshshayee, P. Papadimitratos, S.
  Kumar, and J-P. Hubaux",Wireless Sensor Networking for Rain-fed Farming Decision Support,,"ACM SIGCOMM Workshop on Networked Systems for Developing Regions
  (NSDR), Seattle, WA, USA, August 2008",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless sensor networks (WSNs) can be a valuable decision-support tool for
farmers. This motivated our deployment of a WSN system to support rain-fed
agriculture in India. We defined promising use cases and resolved technical
challenges throughout a two-year deployment of our COMMON-Sense Net system,
which provided farmers with environment data. However, the direct use of this
technology in the field did not foster the expected participation of the
population. This made it difficult to develop the intended decision-support
system. Based on this experience, we take the following position in this paper:
currently, the deployment of WSN technology in developing regions is more
likely to be effective if it targets scientists and technical personnel as
users, rather than the farmers themselves. We base this claim on the lessons
learned from the COMMON-Sense system deployment and the results of an extensive
user experiment with agriculture scientists, which we describe in this paper.
","[{'version': 'v1', 'created': 'Wed, 30 Dec 2009 19:32:09 GMT'}]",2009-12-31,"[['Panchard', 'J.', ''], ['Rao', 'P. R. S.', ''], ['Sheshshayee', 'M. S.', ''], ['Papadimitratos', 'P.', ''], ['Kumar', 'S.', ''], ['Hubaux', 'J-P.', '']]","['Wireless Sensor Network', 'User Experiment', 'Developing Countries', 'Agriculture']"
1667,1406.0292,Lars Hupel,Lars Hupel,Interactive Simplifier Tracing and Debugging in Isabelle,"Conferences on Intelligent Computer Mathematics, 2014",,10.1007/978-3-319-08434-3_24,,cs.MS cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Isabelle proof assistant comes equipped with a very powerful tactic for
term simplification. While tremendously useful, the results of simplifying a
term do not always match the user's expectation: sometimes, the resulting term
is not in the form the user expected, or the simplifier fails to apply a rule.
We describe a new, interactive tracing facility which offers insight into the
hierarchical structure of the simplification with user-defined filtering,
memoization and search. The new simplifier trace is integrated into the
Isabelle/jEdit Prover IDE.
","[{'version': 'v1', 'created': 'Mon, 2 Jun 2014 08:44:33 GMT'}]",2014-09-18,"[['Hupel', 'Lars', '']]","['Isabelle', 'simplifier', 'term rewriting', 'tracing', 'debugging']"
1668,1902.02543,Ermin Sakic,"Ermin Sakic, Wolfgang Kellerer","Impact of Adaptive Consistency on Distributed SDN Applications: An
  Empirical Study",,"IEEE Journal on Selected Areas in Communications (Volume: 36,
  Issue: 12, Dec. 2018)",10.1109/JSAC.2018.2871309,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scalability of the control plane in a software-defined network (SDN) is
enabled by means of decentralization of the decision-making logic, i.e., by
replication of controller functions to physically or virtually dislocated
controller replicas. Replication of a centralized controller state also enables
the protection against controller failures by means of primary and backup
replicas responsible for managing the underlying SDN data plane devices. In
this paper, we investigate the effect of the deployed consistency model on
scalability and correctness metrics of the SDN control plane. In particular, we
compare the strong and eventual consistency, and make a case for a novel
adaptive consistency approach. The existing controller platforms rely on either
strong or eventual consistency mechanisms in their state distribution. We show
how an adaptive consistency model offers the scalability benefits in terms of
the total request-handling throughput and response time, in contrast to the
strong consistency model. We also outline how the adaptive consistency approach
can provide for correctness semantics that are unachievable with the eventual
consistency paradigm in practice. The adaptability of our approach provides a
balanced and tunable tradeoff of scalability and correctness for the SDN
application implemented on top of the adaptive framework. To validate our
assumptions, we evaluate and compare the different approaches in an emulated
testbed with an example of a load balancer controller application. The
experimental setup comprises up to five extended OpenDaylight controller
instances and two network topologies from the area of service provider and data
center networks.
","[{'version': 'v1', 'created': 'Thu, 7 Feb 2019 09:44:54 GMT'}]",2019-02-08,"[['Sakic', 'Ermin', ''], ['Kellerer', 'Wolfgang', '']]","['consistency models', 'RAFT', 'SDN', 'distributedcontrol plane', 'scalability', 'OpenDaylight']"
1669,1807.05771,Rizwan Ahmed Khan,"Rumaisah Munir, Rizwan Ahmed Khan","An Extensive Review on Spectral Imaging in Biometric Systems: Challenges
  and Advancements",,"Journal of Visual Communication and Image Representation, 2019",10.1016/j.jvcir.2019.102660,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Spectral imaging has recently gained traction for face recognition in
biometric systems. We investigate the merits of spectral imaging for face
recognition and the current challenges that hamper the widespread deployment of
spectral sensors for face recognition. The reliability of conventional face
recognition systems operating in the visible range is compromised by
illumination changes, pose variations and spoof attacks. Recent works have
reaped the benefits of spectral imaging to counter these limitations in
surveillance activities (defence, airport security checks, etc.). However, the
implementation of this technology for biometrics, is still in its infancy due
to multiple reasons. We present an overview of the existing work in the domain
of spectral imaging for face recognition, different types of modalities and
their assessment, availability of public databases for sake of reproducible
research as well as evaluation of algorithms, and recent advancements in the
field, such as, the use of deep learning-based methods for recognizing faces
from spectral images.
","[{'version': 'v1', 'created': 'Mon, 16 Jul 2018 10:24:28 GMT'}, {'version': 'v2', 'created': 'Wed, 29 May 2019 07:16:04 GMT'}]",2020-01-06,"[['Munir', 'Rumaisah', ''], ['Khan', 'Rizwan Ahmed', '']]","['Spectral imaging', 'biometrics', 'face recognition', 'spoof attacks', 'Deep learning']"
1670,1512.05223,Ignasi Sau,"Luerbio Faria, Sulamita Klein, Ignasi Sau, Rubens Sucupira","Improved kernels for Signed Max Cut parameterized above lower bound on
  (r,l)-graphs","20 pages, 6 figures","Discrete Mathematics & Theoretical Computer Science, Vol. 19 no.
  1, Discrete Algorithms (June 7, 2017) dmtcs:3682",10.23638/DMTCS-19-1-14,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A graph $G$ is signed if each edge is assigned $+$ or $-$. A signed graph is
balanced if there is a bipartition of its vertex set such that an edge has sign
$-$ if and only if its endpoints are in different parts. The Edwards-Erd\""os
bound states that every graph with $n$ vertices and $m$ edges has a balanced
subgraph with at least $\frac{m}{2}+\frac{n-1}{4}$ edges. In the Signed Max Cut
Above Tight Lower Bound (Signed Max Cut ATLB) problem, given a signed graph $G$
and a parameter $k$, the question is whether $G$ has a balanced subgraph with
at least $\frac{m}{2}+\frac{n-1}{4}+\frac{k}{4}$ edges. This problem
generalizes Max Cut Above Tight Lower Bound, for which a kernel with $O(k^5)$
vertices was given by Crowston et al. [ICALP 2012, Algorithmica 2015]. Crowston
et al. [TCS 2013] improved this result by providing a kernel with $O(k^3)$
vertices for the more general Signed Max Cut ATLB problem. In this article we
are interested in improving the size of the kernels for Signed Max Cut ATLB on
restricted graph classes for which the problem remains hard. For two integers
$r,\ell \geq 0$, a graph $G$ is an $(r,\ell)$-graph if $V(G)$ can be
partitioned into $r$ independent sets and $\ell$ cliques. Building on the
techniques of Crowston et al. [TCS 2013], we provide a kernel with $O(k^2)$
vertices on $(r,\ell)$-graphs for any fixed $r,\ell \geq 0$, and a simple
linear kernel on subclasses of split graphs for which we prove that the problem
is still NP-hard.
","[{'version': 'v1', 'created': 'Wed, 16 Dec 2015 16:00:56 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Jul 2016 18:30:57 GMT'}, {'version': 'v3', 'created': 'Sun, 5 Mar 2017 21:58:07 GMT'}, {'version': 'v4', 'created': 'Mon, 22 May 2017 14:59:51 GMT'}]",2019-03-14,"[['Faria', 'Luerbio', ''], ['Klein', 'Sulamita', ''], ['Sau', 'Ignasi', ''], ['Sucupira', 'Rubens', '']]","['max cut', '(r', 'ℓ)-graphs', 'split graphs', 'parameterized complexity', 'parameterization above lower bound', 'polynomial kernels']"
1671,1207.3056,Kunal Narayan Chaudhury,"Kunal N. Chaudhury, Amit Singer",Non-Local Euclidean Medians,"6 figures, 1 table","IEEE Signal Processing Letters, vol. 19(11), pp. 745 - 748, 2012",10.1109/LSP.2012.2217329,,cs.CV cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this letter, we note that the denoising performance of Non-Local Means
(NLM) at large noise levels can be improved by replacing the mean by the
Euclidean median. We call this new denoising algorithm the Non-Local Euclidean
Medians (NLEM). At the heart of NLEM is the observation that the median is more
robust to outliers than the mean. In particular, we provide a simple geometric
insight that explains why NLEM performs better than NLM in the vicinity of
edges, particularly at large noise levels. NLEM can be efficiently implemented
using iteratively reweighted least squares, and its computational complexity is
comparable to that of NLM. We provide some preliminary results to study the
proposed algorithm and to compare it with NLM.
","[{'version': 'v1', 'created': 'Thu, 12 Jul 2012 18:39:10 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Aug 2012 21:25:51 GMT'}]",2015-06-05,"[['Chaudhury', 'Kunal N.', ''], ['Singer', 'Amit', '']]","['Image denoising', 'non-local means', 'Euclidean median', 'iteratively reweighted least squares (IRLS)', 'Weiszfeld algorithm']"
1672,2105.07841,Bolu John Folayan Dr.,"Bolu John Folayan, Olumide Samuel Ogunjobi, Prosper Zannu, Taiwo
  Ajibolu Balofin","Post-war Civil War Propaganda Techniques and Media Spins in Nigeria and
  Journalism Practice",,,10.24297/jssr.v17i.8993,,cs.CY cs.MM physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  In public relations and political communication, a spin is a form of
propaganda achieved through knowingly presenting a biased interpretation of an
event or issues. It is also the act of presenting narratives to influence
public opinion about events, people or and ideas. In war time, various forms of
spins are employed by antagonists to push their brigades to victory and wear
out the opponents. During the Nigerian civil war, quite a number of these spins
were dominant for example GOWON (Go On With One Nigeria); On Aburi We Stand, O
Le Ku Ija Ore. Post-war years presented different spins and fifty years after
the war, different spins continue to push emerging narratives (e.g.
marginalization, restructuring. This paper investigates and analyzes the
different propaganda techniques and spins in the narratives of the Nigerian
civil in the past five years through a content analysis of three national
newspapers: The Nigerian Tribune, Daily Trust and Sun Newspapers. Findings
confirm that propaganda and spins are not limited to war time, but are actively
deployed in peace time. This development places additional challenge on
journalists to uphold the canons of balance, truth and fairness in reporting
sensitive national issues.
","[{'version': 'v1', 'created': 'Thu, 29 Apr 2021 18:00:04 GMT'}]",2021-05-18,"[['Folayan', 'Bolu John', ''], ['Ogunjobi', 'Olumide Samuel', ''], ['Zannu', 'Prosper', ''], ['Balofin', 'Taiwo Ajibolu', '']]","['Biafran War', 'Framing', 'Propaganda', 'Media Spins']"
1673,1406.7197,Emilio Ferrara,"Onur Varol, Emilio Ferrara, Christine L. Ogan, Filippo Menczer,
  Alessandro Flammini",Evolution of Online User Behavior During a Social Upheaval,Best Paper Award at ACM Web Science 2014,"Proceedings of the 2014 ACM conference on Web science, Pages 81-90",10.1145/2615569.2615699,,cs.SI cs.CY physics.data-an physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media represent powerful tools of mass communication and information
diffusion. They played a pivotal role during recent social uprisings and
political mobilizations across the world. Here we present a study of the Gezi
Park movement in Turkey through the lens of Twitter. We analyze over 2.3
million tweets produced during the 25 days of protest occurred between May and
June 2013. We first characterize the spatio-temporal nature of the conversation
about the Gezi Park demonstrations, showing that similarity in trends of
discussion mirrors geographic cues. We then describe the characteristics of the
users involved in this conversation and what roles they played. We study how
roles and individual influence evolved during the period of the upheaval. This
analysis reveals that the conversation becomes more democratic as events
unfold, with a redistribution of influence over time in the user population. We
conclude by observing how the online and offline worlds are tightly
intertwined, showing that exogenous events, such as political speeches or
police actions, affect social media conversations and trigger changes in
individual behavior.
","[{'version': 'v1', 'created': 'Fri, 27 Jun 2014 14:39:53 GMT'}]",2014-06-30,"[['Varol', 'Onur', ''], ['Ferrara', 'Emilio', ''], ['Ogan', 'Christine L.', ''], ['Menczer', 'Filippo', ''], ['Flammini', 'Alessandro', '']]","['Social media analysis', 'social protest', 'political mobilization', 'online user behavior']"
1674,1106.1523,Daniel Hienert,"Daniel Hienert, Philipp Schaer, Johann Schaible, Philipp Mayr","A Novel Combined Term Suggestion Service for Domain-Specific Digital
  Libraries","To be published in Proceedings of Theories and Practice in Digital
  Libraries (TPDL), 2011",,10.1007/978-3-642-24469-8_21,,cs.DL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interactive query expansion can assist users during their query formulation
process. We conducted a user study with over 4,000 unique visitors and four
different design approaches for a search term suggestion service. As a basis
for our evaluation we have implemented services which use three different
vocabularies: (1) user search terms, (2) terms from a terminology service and
(3) thesaurus terms. Additionally, we have created a new combined service which
utilizes thesaurus term and terms from a domain-specific search term
re-commender. Our results show that the thesaurus-based method clearly is used
more often compared to the other single-method implementations. We interpret
this as a strong indicator that term suggestion mechanisms should be
domain-specific to be close to the user terminology. Our novel combined
approach which interconnects a thesaurus service with additional statistical
relations out-performed all other implementations. All our observations show
that domain-specific vocabulary can support the user in finding alternative
concepts and formulating queries.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2011 09:04:58 GMT'}]",2019-03-29,"[['Hienert', 'Daniel', ''], ['Schaer', 'Philipp', ''], ['Schaible', 'Johann', ''], ['Mayr', 'Philipp', '']]","['Evaluation', 'Term Suggestion', 'Query Suggestion', 'Thesaurus', 'Digital Libraries', 'Interactive Query Expansion']"
1675,2202.08973,Yoones Rezaei,"Yoones Rezaei, Stephen Lee, Daniel Mosse","Energy-Efficient Parking Analytics System using Deep Reinforcement
  Learning",,"Proceedings of the 8th ACM International Conference on Systems for
  Energy-Efficient Buildings, Cities, and Transportation November 2021 Pages
  81-90",10.1145/3486611.3486660,,cs.CV cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advances in deep vision techniques and ubiquity of smart cameras will drive
the next generation of video analytics. However, video analytics applications
consume vast amounts of energy as both deep learning techniques and cameras are
power-hungry. In this paper, we focus on a parking video analytics platform and
propose RL-CamSleep, a deep reinforcement learning-based technique, to actuate
the cameras to reduce the energy footprint while retaining the system's
utility. Our key insight is that many video-analytics applications do not
always need to be operational, and we can design policies to activate video
analytics only when necessary. Moreover, our work is complementary to existing
work that focuses on improving hardware and software efficiency. We evaluate
our approach on a city-scale parking dataset having 76 streets spread across
the city. Our analysis demonstrates how streets have various parking patterns,
highlighting the importance of an adaptive policy. Our approach can learn such
an adaptive policy that can reduce the average energy consumption by 76.38% and
achieve an average accuracy of more than 98% in performing video analytics.
","[{'version': 'v1', 'created': 'Tue, 15 Feb 2022 18:27:50 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Apr 2022 20:53:27 GMT'}]",2022-04-22,"[['Rezaei', 'Yoones', ''], ['Lee', 'Stephen', ''], ['Mosse', 'Daniel', '']]","['Deep Reinforcement Learning', 'Parking Analytic System', 'EnergyEfficiency', 'ML', 'Deep Learning']"
1676,2005.12418,Cristi\'an Bravo,Cristi\'an Bravo and Mar\'ia \'Oskarsd\'ottir,"Evolution of Credit Risk Using a Personalized Pagerank Algorithm for
  Multilayer Networks","Conference camera-ready paper - accepted at KDD MLF 2020. 15 pages,
  10 figures","Proceedings of the Third KDD Workshop on Machine Learning in
  Finance, joint with 26th ACM SIGKDD Conference on Knowledge Discovery in
  Databases (KDD MLF 2020). ACM, New York, NY, USA, 8 pages",,,cs.SI cs.LG physics.soc-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a novel algorithm to study the evolution of credit
risk across complex multilayer networks. Pagerank-like algorithms allow for the
propagation of an influence variable across single networks, and allow
quantifying the risk single entities (nodes) are subject to given the
connection they have to other nodes in the network. Multilayer networks, on the
other hand, are networks where subset of nodes can be associated to a unique
set (layer), and where edges connect elements either intra or inter networks.
Our personalized PageRank algorithm for multilayer networks allows for
quantifying how credit risk evolves across time and propagates through these
networks. By using bipartite networks in each layer, we can quantify the risk
of various components, not only the loans. We test our method in an
agricultural lending dataset, and our results show how default risk is a
challenging phenomenon that propagates and evolves through the network across
time.
","[{'version': 'v1', 'created': 'Mon, 25 May 2020 21:46:57 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Aug 2020 20:18:35 GMT'}]",2020-08-24,"[['Bravo', 'Cristián', ''], ['Óskarsdóttir', 'María', '']]","['Credit Risk', 'Default Propagation', 'Multilayer Networks', 'Complex Networks']"
1677,1804.08150,Amirhossein Tavanaei,"Amirhossein Tavanaei, Masoud Ghodrati, Saeed Reza Kheradpisheh,
  Timothee Masquelier, Anthony S. Maida",Deep Learning in Spiking Neural Networks,,Neural Networks (2018),10.1016/j.neunet.2018.12.002,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, deep learning has been a revolution in the field of machine
learning, for computer vision in particular. In this approach, a deep
(multilayer) artificial neural network (ANN) is trained in a supervised manner
using backpropagation. Huge amounts of labeled examples are required, but the
resulting classification accuracy is truly impressive, sometimes outperforming
humans. Neurons in an ANN are characterized by a single, static,
continuous-valued activation. Yet biological neurons use discrete spikes to
compute and transmit information, and the spike times, in addition to the spike
rates, matter. Spiking neural networks (SNNs) are thus more biologically
realistic than ANNs, and arguably the only viable option if one wants to
understand how the brain computes. SNNs are also more hardware friendly and
energy-efficient than ANNs, and are thus appealing for technology, especially
for portable devices. However, training deep SNNs remains a challenge. Spiking
neurons' transfer function is usually non-differentiable, which prevents using
backpropagation. Here we review recent supervised and unsupervised methods to
train deep SNNs, and compare them in terms of accuracy, but also computational
cost and hardware friendliness. The emerging picture is that SNNs still lag
behind ANNs in terms of accuracy, but the gap is decreasing, and can even
vanish on some tasks, while the SNNs typically require much fewer operations.
","[{'version': 'v1', 'created': 'Sun, 22 Apr 2018 18:27:34 GMT'}, {'version': 'v2', 'created': 'Tue, 15 May 2018 02:48:45 GMT'}, {'version': 'v3', 'created': 'Sat, 1 Sep 2018 14:43:38 GMT'}, {'version': 'v4', 'created': 'Sun, 20 Jan 2019 14:30:40 GMT'}]",2019-01-23,"[['Tavanaei', 'Amirhossein', ''], ['Ghodrati', 'Masoud', ''], ['Kheradpisheh', 'Saeed Reza', ''], ['Masquelier', 'Timothee', ''], ['Maida', 'Anthony S.', '']]","['Deep learning', 'Spiking neural network', 'Biological plausibility', 'Machine learning', 'Power-efficient architecture']"
1678,1301.5046,Shaoshi Chen,"Shaoshi Chen, Ruyong Feng, Guofeng Fu, Ziming Li",On the Structure of Compatible Rational Functions,,"Proceedings of the 2011 International Symposium on Symbolic and
  Algebraic Computation, pages 91--98, 2011, ACM",,,cs.SC math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A finite number of rational functions are compatible if they satisfy the
compatibility conditions of a first-order linear functional system involving
differential, shift and q-shift operators. We present a theorem that describes
the structure of compatible rational functions. The theorem enables us to
decompose a solution of such a system as a product of a rational function,
several symbolic powers, a hyperexponential function, a hypergeometric term,
and a q-hypergeometric term. We outline an algorithm for computing this
product, and present an application.
","[{'version': 'v1', 'created': 'Tue, 22 Jan 2013 00:37:06 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Jan 2013 01:24:01 GMT'}]",2013-01-24,"[['Chen', 'Shaoshi', ''], ['Feng', 'Ruyong', ''], ['Fu', 'Guofeng', ''], ['Li', 'Ziming', '']]","['Compatibility conditions', 'compatible rational functions', 'hyperexponential function', '(q-)hypergeometric term']"
1679,2005.11158,"Christian G\""ottel","Christian G\""ottel, Lars Nielsen, Niloofar Yazdani, Pascal Felber,
  Daniel E. Lucani and Valerio Schiavoni","Hermes: Enabling Energy-efficient IoT Networks with Generalized
  Deduplication","This work was partially financed by the SCALE-IoT Project (Grant No.
  7026-00042B) granted by the Independent Research Fund Denmark, by the Aarhus
  Universitets Forskningsfond (AUFF) Starting Grant Project AUFF- 2017-FLS-7-1,
  and Aarhus University's DIGIT Centre. European Commission Project: LEGaTO -
  Low Energy Toolset for Heterogeneous Computing (EC-H2020-780681)","DEBS'20: Proceedings of the 14th ACM International Conference on
  Distributed and Event-Based Systems (2020) 133-136",10.1145/3401025.3404098,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  With the advent of the Internet of Things (IoT), the ever growing number of
connected devices observed in recent years and foreseen for the next decade
suggests that more and more data will have to be transmitted over a network,
before being processed and stored in data centers. Generalized deduplication
(GD) is a novel technique to effectively reduce the data storage cost by
identifying similar data chunks, and able to gradually reduce the pressure from
the network infrastructure by limiting the data that needs to be transmitted.
  This paper presents Hermes, an application-level protocol for the data-plane
that can operate over generalized deduplication, as well as over classic
deduplication. Hermes significantly reduces the data transmission traffic while
effectively decreasing the energy footprint, a relevant matter to consider in
the context of IoT deployments. We fully implemented Hermes and evaluated its
performance using consumer-grade IoT devices (e.g., Raspberry Pi 4B models).
Our results highlight several trade-offs that must be taken into account when
considering real-world workloads.
","[{'version': 'v1', 'created': 'Fri, 22 May 2020 12:59:38 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Jul 2020 12:02:40 GMT'}]",2020-07-21,"[['Göttel', 'Christian', ''], ['Nielsen', 'Lars', ''], ['Yazdani', 'Niloofar', ''], ['Felber', 'Pascal', ''], ['Lucani', 'Daniel E.', ''], ['Schiavoni', 'Valerio', '']]","['IoT', 'generalized deduplication', 'energy efficiency']"
1680,0712.0836,Andrew Adamatzky,"Andrew Adamatzky, Larry Bull, Pierre Collet, Emmanuel Sapin",Evolving localizations in reaction-diffusion cellular automata,Accepted for publication in Int. J. Modern Physics C,"International Journal of Modern Physics C (IJMPC) Volume: 19,
  Issue: 4 (April 2008) pp. 557-567",10.1142/S0129183108012376,,cs.AI,,"  We consider hexagonal cellular automata with immediate cell neighbourhood and
three cell-states. Every cell calculates its next state depending on the
integral representation of states in its neighbourhood, i.e. how many
neighbours are in each one state. We employ evolutionary algorithms to breed
local transition functions that support mobile localizations (gliders), and
characterize sets of the functions selected in terms of quasi-chemical systems.
Analysis of the set of functions evolved allows to speculate that mobile
localizations are likely to emerge in the quasi-chemical systems with limited
diffusion of one reagent, a small number of molecules is required for
amplification of travelling localizations, and reactions leading to stationary
localizations involve relatively equal amount of quasi-chemical species.
Techniques developed can be applied in cascading signals in nature-inspired
spatially extended computing devices, and phenomenological studies and
classification of non-linear discrete systems.
","[{'version': 'v1', 'created': 'Wed, 5 Dec 2007 22:07:04 GMT'}]",2010-11-23,"[['Adamatzky', 'Andrew', ''], ['Bull', 'Larry', ''], ['Collet', 'Pierre', ''], ['Sapin', 'Emmanuel', '']]","['cellular automata', 'evolutionary algorithms', 'localizations', 'gliders']"
1681,1306.1772,Daniel Graziotin,"Daniel Graziotin, Xiaofeng Wang, Pekka Abrahamsson (Free University of
  Bozen-Bolzano)","Are Happy Developers more Productive? The Correlation of Affective
  States of Software Developers and their self-assessed Productivity","16 pages, 3 Figure. The final publication is available at
  link.springer.com. Link:
  http://link.springer.com/chapter/10.1007%2F978-3-642-39259-7_7. DOI:
  10.1007/978-3-642-39259-7_7","Proceedings of the 14th International Conference on
  Product-Focused Software Process Improvement (PROFES 2013), LNCS 7983,
  Springer-Verlag, pp. 50-64, 2013",10.1007/978-3-642-39259-7_7,,cs.SE cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For decades now, it has been claimed that a way to improve software
developers' productivity is to focus on people. Indeed, while human factors
have been recognized in Software Engineering research, few empirical
investigations have attempted to verify the claim. Development tasks are
undertaken through cognitive processing abilities. Affective states - emotions,
moods, and feelings - have an impact on work-related behaviors, cognitive
processing activities, and the productivity of individuals. In this paper, we
report an empirical study on the impact of affective states on software
developers' performance while programming. Two affective states dimensions are
positively correlated with self-assessed productivity. We demonstrate the value
of applying psychometrics in Software Engineering studies and echo a call to
valorize the human, individualized aspects of software developers. We introduce
and validate a measurement instrument and a linear mixed-effects model to study
the correlation of affective states and the productivity of software
developers.
","[{'version': 'v1', 'created': 'Fri, 7 Jun 2013 16:51:39 GMT'}]",2013-06-10,"[['Graziotin', 'Daniel', '', 'Free University of\n  Bozen-Bolzano'], ['Wang', 'Xiaofeng', '', 'Free University of\n  Bozen-Bolzano'], ['Abrahamsson', 'Pekka', '', 'Free University of\n  Bozen-Bolzano']]","['Productivity', 'Human Factors', 'Software Developers', 'Software Development', 'Affective States', 'Emotion', 'Mood', 'Feeling']"
1682,1707.08617,Benjam\'in Bedregal Prof.,"Benjam\'in Bedregal, Ivan Mezzomo, Renata Hax Sander Reiser",n-Dimensional Fuzzy Negations,20 pages and no figures,,10.1109/TFUZZ.2018.2842718,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  n-Dimensional fuzzy sets is a fuzzy set extension where the membership values
are n-tuples of real numbers in the unit interval [0,1] orderly increased,
called n-dimensional intervals. The set of n-dimensional intervals is denoted
by Ln([0,1]). This paper aims to investigate a special extension from [0,1] -
n-representable fuzzy negations on Ln([0,1]), summarizing the class of such
functions which are continuous and monotone by part. The main properties of
(strong) fuzzy negations on [0,1] are preserved by representable (strong) fuzzy
negation on Ln([0,1]), mainly related to the analysis of degenerate elements
and equilibrium points. The conjugate obtained by action of an n-dimensional
automorphism on an $n$-dimensional fuzzy negation provides a method to obtain
other n-dimensional fuzzy negation, in which properties such as
representability, continuity and monotonicity on Ln([0,1]) are preserved.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 19:27:13 GMT'}]",2019-05-10,"[['Bedregal', 'Benjamín', ''], ['Mezzomo', 'Ivan', ''], ['Reiser', 'Renata Hax Sander', '']]","['Fuzzy negations', 'n-dimensional fuzzy sets', 'n-dimensional fuzzy negations', 'ndimensional automorphisms']"
1683,2205.09052,Bengisu Cagiltay,"Bengisu Cagiltay, Nathan White, Rabia Ibtasar, Bilge Mutlu, Joseph
  Michaelis","Understanding Factors that Shape Children's Long Term Engagement with an
  In-Home Learning Companion Robot","Interaction Design and Children Conference, 2022",ACM Interaction Design and Children 2022 362-373,10.1145/3501712.3529747,,cs.RO cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social robots are emerging as learning companions for children, and research
shows that they facilitate the development of interest and learning even
through brief interactions. However, little is known about how such
technologies might support these goals in authentic environments over long-term
periods of use and interaction. We designed a learning companion robot capable
of supporting children reading popular-science books by expressing social and
informational commentaries. We deployed the robot in homes of 14 families with
children aged 10-12 for four weeks during the summer. Our analysis revealed
critical factors that affected children's long-term engagement and adoption of
the robot, including external factors such as vacations, family visits, and
extracurricular activities; family/parental involvement; and children's
individual interests. We present four in-depth cases that illustrate these
factors and demonstrate their impact on children's reading experiences and
discuss the implications of our findings for robot design.
","[{'version': 'v1', 'created': 'Wed, 18 May 2022 16:37:29 GMT'}]",2023-01-13,"[['Cagiltay', 'Bengisu', ''], ['White', 'Nathan', ''], ['Ibtasar', 'Rabia', ''], ['Mutlu', 'Bilge', ''], ['Michaelis', 'Joseph', '']]","['child-robot interactions', 'long-term', 'in-home', 'reading companion']"
1684,0907.0718,Jonathan Sorenson,Jonathan P. Sorenson,A Randomized Sublinear Time Parallel GCD Algorithm for the EREW PRAM,,Information Processing Letters 110 (2010) 198-201,10.1016/j.ipl.2009.12.008,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a randomized parallel algorithm that computes the greatest common
divisor of two integers of n bits in length with probability 1-o(1) that takes
O(n loglog n / log n) expected time using n^{6+\epsilon} processors on the EREW
PRAM parallel model of computation. We believe this to be the first randomized
sublinear time algorithm on the EREW PRAM for this problem.
","[{'version': 'v1', 'created': 'Fri, 3 Jul 2009 21:12:38 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Jan 2010 21:58:58 GMT'}]",2010-01-15,"[['Sorenson', 'Jonathan P.', '']]","['Parallel algorithms', 'randomized algorithms', 'algorithm analysis', 'greatest common']"
1685,2005.12379,Sumon Biswas,Sumon Biswas and Hridesh Rajan,"Do the Machine Learning Models on a Crowd Sourced Platform Exhibit Bias?
  An Empirical Study on Model Fairness",To be appeared in ESEC/FSE 2020,"ESEC/FSE'2020: The 28th ACM Joint European Software Engineering
  Conference and Symposium on the Foundations of Software Engineering,
  Sacramento, California, United States, November 8-13, 2020",10.1145/3368089.3409704,,cs.LG cs.SE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning models are increasingly being used in important
decision-making software such as approving bank loans, recommending criminal
sentencing, hiring employees, and so on. It is important to ensure the fairness
of these models so that no discrimination is made based on protected attribute
(e.g., race, sex, age) while decision making. Algorithms have been developed to
measure unfairness and mitigate them to a certain extent. In this paper, we
have focused on the empirical evaluation of fairness and mitigations on
real-world machine learning models. We have created a benchmark of 40 top-rated
models from Kaggle used for 5 different tasks, and then using a comprehensive
set of fairness metrics, evaluated their fairness. Then, we have applied 7
mitigation techniques on these models and analyzed the fairness, mitigation
results, and impacts on performance. We have found that some model optimization
techniques result in inducing unfairness in the models. On the other hand,
although there are some fairness control mechanisms in machine learning
libraries, they are not documented. The mitigation algorithm also exhibit
common patterns such as mitigation in the post-processing is often costly (in
terms of performance) and mitigation in the pre-processing stage is preferred
in most cases. We have also presented different trade-off choices of fairness
mitigation decisions. Our study suggests future research directions to reduce
the gap between theoretical fairness aware algorithms and the software
engineering methods to leverage them in practice.
","[{'version': 'v1', 'created': 'Thu, 21 May 2020 23:35:53 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Sep 2020 17:27:44 GMT'}]",2020-09-23,"[['Biswas', 'Sumon', ''], ['Rajan', 'Hridesh', '']]","['fairness', 'machine learning', 'models']"
1686,1306.0944,Mouhamed Abdulla,Mouhamed Abdulla and Yousef R. Shayan,An Exact Path-Loss Density Model for Mobiles in a Cellular System,"Proc. of the 7th ACM International Symposium on Mobility Management
  and Wireless Access (MobiWac'09), held in conjunction with MSWiM'09",,10.1145/1641776.1641797,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In trying to emulate the spatial position of wireless nodes for purpose of
analysis, we rely on stochastic simulation. And, it is customary, for mobile
systems, to consider a base-station radiation coverage by an ideal cell shape.
For cellular analysis, a hexagon contour is always preferred mainly because of
its tessellating nature. Despite this fact, largely due to its intrinsic
simplicity, in literature only random dispersion model for a circular shape is
known. However, if considered, this will result an unfair nodes density
specifically at the edges of non-circular contours. As a result, in this paper,
we showed the exact random number generation technique required for nodes
scattering inside a hexagon. Next, motivated from a system channel perspective,
we argued the need for the exhaustive random mobile dropping process, and hence
derived a generic close-form expression for the path-loss distribution density
between a base-station and a mobile. Last, simulation was used to reaffirm the
validity of the theoretical analysis using values from the new IEEE 802.20
standard.
","[{'version': 'v1', 'created': 'Tue, 4 Jun 2013 23:44:50 GMT'}]",2013-06-06,"[['Abdulla', 'Mouhamed', ''], ['Shayan', 'Yousef R.', '']]","['Spatial Distribution', 'Simulation', 'Stochastic Modeling', 'Path-Loss']"
1687,1210.7599,Krunoslav Zubrinic,"Krunoslav Zubrinic, Damir Kalpic, Mario Milicevic","The automatic creation of concept maps from documents written using
  morphologically rich languages",ISSN 0957-4174,"Expert Systems with Applications, Volume 39, Issue 16, 2012, Pages
  12709-12718",10.1016/j.eswa.2012.04.065,,cs.IR cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Concept map is a graphical tool for representing knowledge. They have been
used in many different areas, including education, knowledge management,
business and intelligence. Constructing of concept maps manually can be a
complex task; an unskilled person may encounter difficulties in determining and
positioning concepts relevant to the problem area. An application that
recommends concept candidates and their position in a concept map can
significantly help the user in that situation. This paper gives an overview of
different approaches to automatic and semi-automatic creation of concept maps
from textual and non-textual sources. The concept map mining process is
defined, and one method suitable for the creation of concept maps from
unstructured textual sources in highly inflected languages such as the Croatian
language is described in detail. Proposed method uses statistical and data
mining techniques enriched with linguistic tools. With minor adjustments, that
method can also be used for concept map mining from textual sources in other
morphologically rich languages.
","[{'version': 'v1', 'created': 'Mon, 29 Oct 2012 09:18:34 GMT'}, {'version': 'v2', 'created': 'Sat, 27 Sep 2014 17:46:02 GMT'}]",2014-09-30,"[['Zubrinic', 'Krunoslav', ''], ['Kalpic', 'Damir', ''], ['Milicevic', 'Mario', '']]","['Concept map', 'Concept map mining', 'Text analysis', 'Text summarization']"
1688,1602.00490,Amit Dvir Dr.,"Ran Dubin, Amit Dvir, Ofir Pele, Ofer Hadar","I Know What You Saw Last Minute - Encrypted HTTP Adaptive Video
  Streaming Title Classification",9 pages. arXiv admin note: text overlap with arXiv:1602.00489,"IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 12,
  NO. 12, DECEMBER 2017",10.1109/TIFS.2017.2730819,,cs.MM cs.LG cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Desktops and laptops can be maliciously exploited to violate privacy. There
are two main types of attack scenarios: active and passive. In this paper, we
consider the passive scenario where the adversary does not interact actively
with the device, but he is able to eavesdrop on the network traffic of the
device from the network side. Most of the Internet traffic is encrypted and
thus passive attacks are challenging. Previous research has shown that
information can be extracted from encrypted multimedia streams. This includes
video title classification of non HTTP adaptive streams (non-HAS). This paper
presents an algorithm for encrypted HTTP adaptive video streaming title
classification. We show that an external attacker can identify the video title
from video HTTP adaptive streams (HAS) sites such as YouTube. To the best of
our knowledge, this is the first work that shows this. We provide a large data
set of 10000 YouTube video streams of 100 popular video titles (each title
downloaded 100 times) as examples for this task. The dataset was collected
under real-world network conditions. We present several machine algorithms for
the task and run a through set of experiments, which shows that our
classification accuracy is more than 95%. We also show that our algorithms are
able to classify video titles that are not in the training set as unknown and
some of the algorithms are also able to eliminate false prediction of video
titles and instead report unknown. Finally, we evaluate our algorithms
robustness to delays and packet losses at test time and show that a solution
that uses SVM is the most robust against these changes given enough training
data. We provide the dataset and the crawler for future research.
","[{'version': 'v1', 'created': 'Mon, 1 Feb 2016 12:15:27 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Jul 2016 06:42:01 GMT'}]",2017-12-04,"[['Dubin', 'Ran', ''], ['Dvir', 'Amit', ''], ['Pele', 'Ofir', ''], ['Hadar', 'Ofer', '']]","['HTTP Adaptive Video Streaming', 'HTTP2', 'Encrypted Traffic', 'Classification', 'YouTube']"
1689,1502.02493,Jose M. Such,"Natalia Criado, Jose M. Such",Implicit Contextual Integrity in Online Social Networks,"Authors Version of the paper accepted for publication in the
  Information Sciences journal
  (http://www.journals.elsevier.com/information-sciences/)","Information Sciences, Vol. 325 pp. 48-69 (2015)",10.1016/j.ins.2015.07.013,,cs.SI cs.AI cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many real incidents demonstrate that users of Online Social Networks need
mechanisms that help them manage their interactions by increasing the awareness
of the different contexts that coexist in Online Social Networks and preventing
them from exchanging inappropriate information in those contexts or
disseminating sensitive information from some contexts to others. Contextual
integrity is a privacy theory that conceptualises the appropriateness of
information sharing based on the contexts in which this information is to be
shared. Computational models of Contextual Integrity assume the existence of
well-defined contexts, in which individuals enact pre-defined roles and
information sharing is governed by an explicit set of norms. However, contexts
in Online Social Networks are known to be implicit, unknown a priori and ever
changing; users relationships are constantly evolving; and the information
sharing norms are implicit. This makes current Contextual Integrity models not
suitable for Online Social Networks.
  In this paper, we propose the first computational model of Implicit
Contextual Integrity, presenting an information model and an Information
Assistant Agent that uses the information model to learn implicit contexts,
relationships and the information sharing norms to help users avoid
inappropriate information exchanges and undesired information disseminations.
Through an experimental evaluation, we validate the properties of Information
Assistant Agents, which are shown to: infer the information sharing norms even
if a small proportion of the users follow the norms and in presence of
malicious users; help reduce the exchange of inappropriate information and the
dissemination of sensitive information with only a partial view of the system
and the information received and sent by their users; and minimise the burden
to the users in terms of raising unnecessary alerts.
","[{'version': 'v1', 'created': 'Mon, 9 Feb 2015 14:25:44 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Jul 2015 09:35:32 GMT'}]",2016-06-14,"[['Criado', 'Natalia', ''], ['Such', 'Jose M.', '']]","['Contextual Integrity', 'Online Social Networks', 'Norms', 'Agents', 'Privacy']"
1690,1301.2561,Hiroki Sayama,"Hiroki Sayama, Irene Pestov, Jeffrey Schmidt, Benjamin James Bush,
  Chun Wong, Junichi Yamanoi, and Thilo Gross",Modeling complex systems with adaptive networks,"24 pages, 11 figures, 3 tables","Computers and Mathematics with Applications, 65, 1645-1664 (2013)",10.1016/j.camwa.2012.12.005,,cs.SI nlin.AO physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Adaptive networks are a novel class of dynamical networks whose topologies
and states coevolve. Many real-world complex systems can be modeled as adaptive
networks, including social networks, transportation networks, neural networks
and biological networks. In this paper, we introduce fundamental concepts and
unique properties of adaptive networks through a brief, non-comprehensive
review of recent literature on mathematical/computational modeling and analysis
of such networks. We also report our recent work on several applications of
computational adaptive network modeling and analysis to real-world problems,
including temporal development of search and rescue operational networks,
automated rule discovery from empirical network evolution data, and cultural
integration in corporate merger.
","[{'version': 'v1', 'created': 'Fri, 11 Jan 2013 17:59:20 GMT'}]",2017-05-29,"[['Sayama', 'Hiroki', ''], ['Pestov', 'Irene', ''], ['Schmidt', 'Jeffrey', ''], ['Bush', 'Benjamin James', ''], ['Wong', 'Chun', ''], ['Yamanoi', 'Junichi', ''], ['Gross', 'Thilo', '']]","['adaptive networks', 'complex systems', 'complex networks', 'state-topology coevolution', 'dynamics', 'generative networkautomata']"
1691,1108.5757,Ricardo Corr\^ea,"Manoel Camp\^elo and Ricardo C. Corr\^ea and Phablo F. S. Moura and
  Marcio C. Santos",Optimal k-fold colorings of webs and antiwebs,"A short version of this paper was presented at the Simp\'osio
  Brasileiro de Pesquisa Operacional, Brazil, 2011","Discrete Applied Mathematics, 161(1-2), pages 60-70, 2013",10.1016/j.dam.2012.07.013,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A k-fold x-coloring of a graph is an assignment of (at least) k distinct
colors from the set {1, 2, ..., x} to each vertex such that any two adjacent
vertices are assigned disjoint sets of colors. The smallest number x such that
G admits a k-fold x-coloring is the k-th chromatic number of G, denoted by
\chi_k(G). We determine the exact value of this parameter when G is a web or an
antiweb. Our results generalize the known corresponding results for odd cycles
and imply necessary and sufficient conditions under which \chi_k(G) attains its
lower and upper bounds based on the clique, the fractional chromatic and the
chromatic numbers. Additionally, we extend the concept of \chi-critical graphs
to \chi_k-critical graphs. We identify the webs and antiwebs having this
property, for every integer k <= 1.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2011 21:22:34 GMT'}]",2016-11-11,"[['Campêlo', 'Manoel', ''], ['Corrêa', 'Ricardo C.', ''], ['Moura', 'Phablo F. S.', ''], ['Santos', 'Marcio C.', '']]","['(k-fold) graph coloring', '(fractional) chromatic number', 'clique and stableset numbers', 'web and antiweb']"
1692,1503.04706,Tilen Marc,Tilen Marc,"There are no finite partial cubes of girth more than 6 and minimum
  degree at least 3",,,10.1016/j.ejc.2016.01.005,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Partial cubes are graphs isometrically embeddable into hypercubes. We analyze
how isometric cycles in partial cubes behave and derive that every partial cube
of girth more than 6 must have vertices of degree less than 3. As a direct
corollary we get that every regular partial cube of girth more than 6 is an
even cycle. Along the way we prove that every partial cube $G$ with girth more
than 6 is a tree-zone graph and therefore $2n(G)-m(G)-i(G)+ce(G)=2$ holds,
where $i(G)$ is the isometric dimension of $G$ and $ce(G)$ its convex excess.
","[{'version': 'v1', 'created': 'Mon, 16 Mar 2015 16:09:45 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Jul 2016 13:43:06 GMT'}]",2016-08-09,"[['Marc', 'Tilen', '']]","['partial cubes', 'girth of a graph', 'isometric cycles', 'regular graphs']"
1693,1304.0102,Diederik Aerts,Diederik Aerts and Sandro Sozzo,Entanglement Zoo II: Examples in Physics and Cognition,11 pages,"Quantum Interaction. Lecture Notes in Computer Science, 8369, pp.
  97-109, 2014",10.1007/978-3-642-54943-4_9,,cs.AI quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We have recently presented a general scheme enabling quantum modeling of
different types of situations that violate Bell's inequalities. In this paper,
we specify this scheme for a combination of two concepts. We work out a quantum
Hilbert space model where 'entangled measurements' occur in addition to the
expected 'entanglement between the component concepts', or 'state
entanglement'. We extend this result to a macroscopic physical entity, the
'connected vessels of water', which maximally violates Bell's inequalities. We
enlighten the structural and conceptual analogies between the cognitive and
physical situations which are both examples of a nonlocal non-marginal box
modeling in our classification.
","[{'version': 'v1', 'created': 'Sat, 30 Mar 2013 12:46:29 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Sep 2013 16:04:15 GMT'}]",2015-12-31,"[['Aerts', 'Diederik', ''], ['Sozzo', 'Sandro', '']]","['Quantum cognition', 'vessels of water', 'Bell’s inequalities', 'entanglement']"
1694,1808.06705,Paul Burkhardt,Paul Burkhardt,Graph connectivity in log steps using label propagation,,"Parallel Processing Letters, 31(4):1-23, 2021",10.1142/S0129626421500213,,cs.DS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The fastest deterministic algorithms for connected components take
logarithmic time and perform superlinear work on a Parallel Random Access
Machine (PRAM). These algorithms maintain a spanning forest by merging and
compressing trees, which requires pointer-chasing operations that increase
memory access latency and are limited to shared-memory systems. Many of these
PRAM algorithms are also very complicated to implement. Another popular method
is ""leader-contraction"" where the challenge is to select a constant fraction of
leaders that are adjacent to a constant fraction of non-leaders with high
probability. Instead we investigate label propagation because it is
deterministic and does not rely on pointer-chasing. Label propagation exchanges
representative labels within a component using simple graph traversal, but it
is inherently difficult to complete in a sublinear number of steps. We are able
to solve the problems with label propagation for graph connectivity.
  We introduce a surprisingly simple framework for deterministic graph
connectivity using label propagation that is easily adaptable to many
computational models. It propagates directed edges and alternates edge
direction to achieve linear edge count each step and sublinear convergence. We
present new algorithms in PRAM, Stream, and MapReduce for a simple, undirected
graph $G=(V,E)$ with $n=|V|$ vertices, $m=|E|$ edges. Our approach takes $O(m)$
work each step, but we can only prove logarithmic convergence on a path graph.
It was conjectured by Liu and Tarjan (2019) to take $O(\log n)$ steps or
possibly $O(\log^2 n)$ steps. We leave the proof of convergence as an open
problem.
","[{'version': 'v1', 'created': 'Mon, 20 Aug 2018 22:01:08 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Jul 2020 17:09:03 GMT'}, {'version': 'v3', 'created': 'Thu, 20 Aug 2020 13:23:35 GMT'}, {'version': 'v4', 'created': 'Mon, 3 May 2021 17:14:58 GMT'}, {'version': 'v5', 'created': 'Fri, 1 Oct 2021 21:14:01 GMT'}, {'version': 'v6', 'created': 'Tue, 7 Dec 2021 21:33:15 GMT'}]",2021-12-09,"[['Burkhardt', 'Paul', '']]","['graph connectivity', 'connected components', 'parallel algorithm', 'pram', 'stream', 'mapreduce']"
1695,1204.2058,Shalini Puri,Shalini Puri and Sona Kaushik,"A technical study and analysis on fuzzy similarity based models for text
  classification","15 pages, 3 tables, 1 figure","International Journal of Data Mining & Knowledge Management
  Process (IJDKP) March, 2012, Vol. 2, Number 2,pp. 1-15",10.5121/ijdkp.2012.2201,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this new and current era of technology, advancements and techniques,
efficient and effective text document classification is becoming a challenging
and highly required area to capably categorize text documents into mutually
exclusive categories. Fuzzy similarity provides a way to find the similarity of
features among various documents. In this paper, a technical review on various
fuzzy similarity based models is given. These models are discussed and compared
to frame out their use and necessity. A tour of different methodologies is
provided which is based upon fuzzy similarity related concerns. It shows that
how text and web documents are categorized efficiently into different
categories. Various experimental results of these models are also discussed.
The technical comparisons among each model's parameters are shown in the form
of a 3-D chart. Such study and technical review provide a strong base of
research work done on fuzzy similarity based text document categorization.
","[{'version': 'v1', 'created': 'Tue, 10 Apr 2012 06:59:48 GMT'}]",2012-04-11,"[['Puri', 'Shalini', ''], ['Kaushik', 'Sona', '']]","['Text Classification', 'Feature Extraction', 'Feature Clustering', 'Data Dimensionality', 'Fuzzy Similarity', 'Fuzzy Association', 'Membership Function', 'Data Sets']"
1696,1903.08408,Casper Hansen,"Christian Hansen, Casper Hansen, Stephen Alstrup, Jakob Grue Simonsen,
  Christina Lioma",Modelling Sequential Music Track Skips using a Multi-RNN Approach,4 pages,"12th ACM International Conference on Web Search and Data Mining
  (WSDM) 2019, WSDM Cup",,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modelling sequential music skips provides streaming companies the ability to
better understand the needs of the user base, resulting in a better user
experience by reducing the need to manually skip certain music tracks. This
paper describes the solution of the University of Copenhagen DIKU-IR team in
the 'Spotify Sequential Skip Prediction Challenge', where the task was to
predict the skip behaviour of the second half in a music listening session
conditioned on the first half. We model this task using a Multi-RNN approach
consisting of two distinct stacked recurrent neural networks, where one network
focuses on encoding the first half of the session and the other network focuses
on utilizing the encoding to make sequential skip predictions. The encoder
network is initialized by a learned session-wide music encoding, and both of
them utilize a learned track embedding. Our final model consists of a majority
voted ensemble of individually trained models, and ranked 2nd out of 45
participating teams in the competition with a mean average accuracy of 0.641
and an accuracy on the first skip prediction of 0.807. Our code is released at
https://github.com/Varyn/WSDM-challenge-2019-spotify.
","[{'version': 'v1', 'created': 'Wed, 20 Mar 2019 09:47:22 GMT'}]",2019-03-21,"[['Hansen', 'Christian', ''], ['Hansen', 'Casper', ''], ['Alstrup', 'Stephen', ''], ['Simonsen', 'Jakob Grue', ''], ['Lioma', 'Christina', '']]","['Music Track Recommendation', 'Skip Prediction', 'Music Embedding', 'Recurrent Neural Network', 'Deep Learning']"
1697,2206.02956,Qingsong Wen,"Xiaomin Song, Qingsong Wen, Yan Li, Liang Sun","Robust Time Series Dissimilarity Measure for Outlier Detection and
  Periodicity Detection",,"Proc. 31st ACM International Conference on Information and
  Knowledge Management (CIKM 2022)",,,cs.LG eess.SP stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dynamic time warping (DTW) is an effective dissimilarity measure in many time
series applications. Despite its popularity, it is prone to noises and
outliers, which leads to singularity problem and bias in the measurement. The
time complexity of DTW is quadratic to the length of time series, making it
inapplicable in real-time applications. In this paper, we propose a novel time
series dissimilarity measure named RobustDTW to reduce the effects of noises
and outliers. Specifically, the RobustDTW estimates the trend and optimizes the
time warp in an alternating manner by utilizing our designed temporal graph
trend filtering. To improve efficiency, we propose a multi-level framework that
estimates the trend and the warp function at a lower resolution, and then
repeatedly refines them at a higher resolution. Based on the proposed
RobustDTW, we further extend it to periodicity detection and outlier time
series detection. Experiments on real-world datasets demonstrate the superior
performance of RobustDTW compared to DTW variants in both outlier time series
detection and periodicity detection.
","[{'version': 'v1', 'created': 'Tue, 7 Jun 2022 00:49:16 GMT'}]",2022-08-04,"[['Song', 'Xiaomin', ''], ['Wen', 'Qingsong', ''], ['Li', 'Yan', ''], ['Sun', 'Liang', '']]","['time series', 'DTW', 'periodicity detection', 'outlier detection']"
1698,1804.02533,Amit Seal Ami,"Amit Seal Ami, Md. Mehedi Hasan, Md. Rayhanur Rahman, Kazi Sakib",MobiCoMonkey - Context Testing of Android Apps,4 pages,,10.1145/3197231.3197234,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The functionality of many mobile applications is dependent on various
contextual, external factors. Depending on unforeseen scenarios, mobile apps
can even malfunction or crash. In this paper, we have introduced MobiCoMonkey -
automated tool that allows a developer to test app against custom or auto
generated contextual scenarios and help detect possible bugs through the
emulator. Moreover, it reports the connection between the bugs and contextual
factors so that the bugs can later be reproduced. It utilizes the tools offered
by Android SDK and logcat to inject events and capture traces of the app
execution.
","[{'version': 'v1', 'created': 'Sat, 7 Apr 2018 09:16:43 GMT'}]",2018-04-10,"[['Ami', 'Amit Seal', ''], ['Hasan', 'Md. Mehedi', ''], ['Rahman', 'Md. Rayhanur', ''], ['Sakib', 'Kazi', '']]","['Android', 'Mobile', 'Simulation', 'Contextual Testing', 'Stress Testing', 'Emulator', 'Empirical Software Engineering']"
1699,1810.08861,Yixue Zhao,"Yixue Zhao, Paul Wat, Marcelo Schmitt Laser, Nenad Medvidovic","Empirically Assessing Opportunities for Prefetching and Caching in
  Mobile Apps",ASE 2018,,10.1145/3238147.3238215,,cs.SE cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network latency in mobile software has a large impact on user experience,
with potentially severe economic consequences. Prefetching and caching have
been shown effective in reducing the latencies in browser-based systems.
However, those techniques cannot be directly applied to the emerging domain of
mobile apps because of the differences in network interactions. Moreover, there
is a lack of research on prefetching and caching techniques that may be
suitable for the mobile app domain, and it is not clear whether such techniques
can be effective or whether they are even feasible. This paper takes the first
step toward answering these questions by conducting a comprehensive study to
understand the characteristics of HTTP requests in over 1000 popular Android
apps. Our work focuses on the prefetchability of requests using static program
analysis techniques and cacheability of resulting responses. We find that there
is a substantial opportunity to leverage prefetching and caching in mobile
apps, but that suitable techniques must take into account the nature of apps'
network interactions and idiosyncrasies such as untrustworthy HTTP header
information. Our observations provide guidelines for developers to utilize
prefetching and caching schemes in app development, and motivate future
research in this area.
","[{'version': 'v1', 'created': 'Sat, 20 Oct 2018 22:37:25 GMT'}]",2018-10-23,"[['Zhao', 'Yixue', ''], ['Wat', 'Paul', ''], ['Laser', 'Marcelo Schmitt', ''], ['Medvidovic', 'Nenad', '']]","['prefetching', 'caching', 'mobile apps', 'network latency', 'empirical study']"
1700,1202.5667,Saptarshi Das,"Suman Saha, Saptarshi Das, Ratna Ghosh, Bhaswati Goswami, Amitava
  Gupta, R. Balasubramanian, A. K. Chandra, Shantanu Das","Fractional Order Phase Shaper Design with Routh's Criterion for
  Iso-damped Control System","4 pages, 4 figures; Proceedings of INDICON 2009 - An IEEE India
  Council Conference, art. no. 5409434, Dec. 2009, Gujarat",,10.1109/INDCON.2009.5409434,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Phase curve of an open loop system is flat in nature if the derivative of
phase with respect to frequency is zero. With a flat phase curve, the
corresponding closed-loop system exhibits an iso-damped property i.e. maintains
constant overshoot with the change of gain and with other parametric
variations. In recent past application, fractional order (FO) phase shapers
have been proposed by contemporary researchers to achieve enhanced parametric
robustness. In this paper, a simple Routh tabulation based methodology is
proposed to design an appropriate FO phase shaper to achieve phase flattening
in a control loop, comprising a system, controlled by a classical PID
controller. The method is demonstrated using MATLAB simulation of a second
order DC motor plant and also a first order with time delay system.
","[{'version': 'v1', 'created': 'Sat, 25 Feb 2012 16:56:47 GMT'}]",2012-02-28,"[['Saha', 'Suman', ''], ['Das', 'Saptarshi', ''], ['Ghosh', 'Ratna', ''], ['Goswami', 'Bhaswati', ''], ['Gupta', 'Amitava', ''], ['Balasubramanian', 'R.', ''], ['Chandra', 'A. K.', ''], ['Das', 'Shantanu', '']]","['Carlson’s approximation', 'fractional order calculus', 'iso-damping', 'phase shaping', 'Routh stability criterion']"
1701,1406.3870,Iaakov Exman,Iaakov Exman and Alex Krepch,"An Anti_Turing Test: Reduced Variables for Social Network Friends'
  Recommendations","11 pages, 4 figures, Extended version of paper originally published
  in the SKY International Workshop on Software Knowledge, September 2013",,10.5220/0004641600550061,,cs.IR cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A routine activity of social networks servers is to recommend candidate
friends that one may know and stimulate addition of these people to one's
contacts. An intriguing issue is how these recommendation lists are composed.
This work investigates the main variables involved in the recommendation
activity, in order to reproduce these lists including its time dependent
characteristics. We propose relevant algorithms. Besides conventional
approaches, such as friend_of_a_friend, two techniques of importance have not
been emphasized in previous works: randomization and direct use of
interestingness criteria. An automatic software tool to implement these
techniques is proposed. Its architecture and implementation are discussed.
After a preliminary analysis of actual data collected from social networks, the
tool is used to simulate social network friends' recommendations.
","[{'version': 'v1', 'created': 'Sun, 15 Jun 2014 23:58:17 GMT'}]",2014-06-17,"[['Exman', 'Iaakov', ''], ['Krepch', 'Alex', '']]","['Social Networks', 'Friends', 'Recommendation', 'Interestingness', 'Randomization', 'Reduced Variables']"
1702,1008.2452,Irfan Syamsuddin,"Irfan Syamsuddin, Tharam Dillon, Elizabeth Chang, and Song Han",A Survey of RFID Authentication Protocols Based on Hash-Chain Method,"Third ICCIT 2008 International Conference on Convergence and Hybrid
  Information Technology",,10.1109/ICCIT.2008.314,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security and privacy are the inherent problems in RFID communications. There
are several protocols have been proposed to overcome those problems. Hash chain
is commonly employed by the protocols to improve security and privacy for RFID
authentication. Although the protocols able to provide specific solution for
RFID security and privacy problems, they fail to provide integrated solution.
This article is a survey to closely observe those protocols in terms of its
focus and limitations.
","[{'version': 'v1', 'created': 'Sat, 14 Aug 2010 15:07:07 GMT'}]",2010-08-17,"[['Syamsuddin', 'Irfan', ''], ['Dillon', 'Tharam', ''], ['Chang', 'Elizabeth', ''], ['Han', 'Song', '']]","['RFID', 'security', 'privacy', 'hash chain.   1']"
1703,1908.02702,Andreas Herten,"Andreas Herten, Thorsten Hater, Wouter Klijn, Dirk Pleiter",Performance Comparison for Neuroscience Application Benchmarks,"Presented at ISC19 Conference Workshop IWOPH (International Workshop
  on OpenPOWER for HPC)",,10.1007/978-3-030-34356-9_31,,cs.PF q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Researchers within the Human Brain Project and related projects have in the
last couple of years expanded their needs for high-performance computing
infrastructures. The needs arise from a diverse set of science challenges that
range from large-scale simulations of brain models to processing of
extreme-scale experimental data sets. The ICEI project, which is in the process
of creating a distributed infrastructure optimised for brain research, started
to build-up a set of benchmarks that reflect the diversity of applications in
this field. In this paper we analyse the performance of some selected
benchmarks on an IBM POWER8 and Intel Skylake based systems with and without
GPUs.
","[{'version': 'v1', 'created': 'Wed, 7 Aug 2019 16:19:15 GMT'}]",2020-02-11,"[['Herten', 'Andreas', ''], ['Hater', 'Thorsten', ''], ['Klijn', 'Wouter', ''], ['Pleiter', 'Dirk', '']]","['OpenPOWER', 'high-performance computing', 'data analytics', 'GPU acceleration', 'computational neuroscience']"
1704,1905.03970,Sindhu Padakandla,"Sindhu Padakandla, Prabuchandran K. J, and Shalabh Bhatnagar",Reinforcement Learning in Non-Stationary Environments,,Applied Intelligence 2020,10.1007/s10489-020-01758-5,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reinforcement learning (RL) methods learn optimal decisions in the presence
of a stationary environment. However, the stationary assumption on the
environment is very restrictive. In many real world problems like traffic
signal control, robotic applications, one often encounters situations with
non-stationary environments and in these scenarios, RL methods yield
sub-optimal decisions. In this paper, we thus consider the problem of
developing RL methods that obtain optimal decisions in a non-stationary
environment. The goal of this problem is to maximize the long-term discounted
reward achieved when the underlying model of the environment changes over time.
To achieve this, we first adapt a change point algorithm to detect change in
the statistics of the environment and then develop an RL algorithm that
maximizes the long-run reward accrued. We illustrate that our change point
method detects change in the model of the environment effectively and thus
facilitates the RL algorithm in maximizing the long-run reward. We further
validate the effectiveness of the proposed solution on non-stationary random
Markov decision processes, a sensor energy management problem and a traffic
signal control problem.
","[{'version': 'v1', 'created': 'Fri, 10 May 2019 07:05:27 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Dec 2019 12:54:18 GMT'}, {'version': 'v3', 'created': 'Wed, 8 Apr 2020 07:21:45 GMT'}, {'version': 'v4', 'created': 'Tue, 19 May 2020 09:48:13 GMT'}]",2020-06-08,"[['Padakandla', 'Sindhu', ''], ['J', 'Prabuchandran K.', ''], ['Bhatnagar', 'Shalabh', '']]","['Markov decision processes', 'Reinforcement Learning', 'Non-Stationary Environments', 'ChangeDetection']"
1705,1904.02661,Vahan Mkrtchyan,Luca Ferrarini and Giuseppe Mazzuoccolo and Vahan Mkrtchyan,Normal $5$-edge-colorings of a family of Loupekhine snarks,"8 pages, 6 figures",,10.1016/j.akcej.2019.12.014,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a proper edge-coloring of a cubic graph an edge $uv$ is called poor or
rich, if the set of colors of the edges incident to $u$ and $v$ contains
exactly three or five colors, respectively. An edge-coloring of a graph is
normal, if any edge of the graph is either poor or rich. In this note, we show
that some snarks constructed by using a method introduced by Loupekhine admit a
normal edge-coloring with five colors. The existence of a Berge-Fulkerson
Covering for a part of the snarks considered in this paper was recently proved
by Manuel and Shanthi (2015). Since the existence of a normal edge-coloring
with five colors implies the existence of a Berge-Fulkerson Covering, our main
theorem can be viewed as a generalization of their result.
","[{'version': 'v1', 'created': 'Thu, 4 Apr 2019 16:56:28 GMT'}]",2021-10-05,"[['Ferrarini', 'Luca', ''], ['Mazzuoccolo', 'Giuseppe', ''], ['Mkrtchyan', 'Vahan', '']]","['Cubic graph', 'Petersen coloring conjecture', 'normal edge-coloring', 'class ofsnarks']"
1706,1810.12896,Alexandre Talon,"Micha\""el Rao and Alexandre Talon",The 2-domination and Roman domination numbers of grid graphs,"11 pages, 5 figures, presented at ICGT 2018 The program that led to
  the results is included in the Source directory (see Other formats) Accepted
  in DMTCS vol 21. Journal version with their template","Discrete Mathematics & Theoretical Computer Science, vol. 21 no.
  1, ICGT 2018 (May 23, 2019) dmtcs:5482",10.23638/DMTCS-21-1-9,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the 2-domination number for grid graphs, that is the size of a
smallest set $D$ of vertices of the grid such that each vertex of the grid
belongs to $D$ or has at least two neighbours in $D$. We give a closed formula
giving the 2-domination number of any $n \!\times\! m$ grid, hereby confirming
the results found by Lu and Xu, and Shaheen et al. for $n \leq 4$ and slightly
correct the value of Shaheen et al. for $n = 5$. The proof relies on some
dynamic programming algorithms, using transfer matrices in (min,+)-algebra. We
also apply the method to solve the Roman domination problem on grid graphs.
","[{'version': 'v1', 'created': 'Tue, 30 Oct 2018 17:47:09 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Nov 2018 17:40:24 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Apr 2019 15:40:28 GMT'}, {'version': 'v4', 'created': 'Fri, 17 May 2019 14:15:52 GMT'}]",2021-01-04,"[['Rao', 'Michaël', ''], ['Talon', 'Alexandre', '']]","['domination', '2-domination', 'Roman domination', 'grid graphs', 'Cartesian product of paths', 'transfer matrix', '(min', '+)-algebra']"
1707,1309.0542,Karim Habak,"Karim Habak, Khaled A. Harras, Moustafa Youssef","Bandwidth Aggregation Techniques in Heterogeneous Multi-homed Devices: A
  Survey",,Computer Networks 92P1 (December 2015) 168-188,10.1016/j.comnet.2015.08.039,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The widespread deployment of various networking technologies, coupled with
the exponential increase in end- user data demand, have led to the
proliferation of multi-homed, or multi-interface enabled, devices. These trends
drove researchers to investigate a wide spectrum of solutions, at different
layers of the protocol stack, that utilize available interfaces in such devices
by aggregating their bandwidth. In this survey paper, we provide an overview
and examine the evolution of bandwidth aggregation solutions over time. We
begin by describing the bandwidth aggregation problem. We investigate the
common features of proposed bandwidth aggregation systems and break them down
into two major categories: layer-dependent and layer-independent features.
Afterwards, we discuss the evolution trends in the literature and discuss some
open challenges requiring further research. We end the survey with a brief
presentation of related work in tangential research areas.
","[{'version': 'v1', 'created': 'Mon, 2 Sep 2013 21:01:16 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Apr 2014 14:22:32 GMT'}, {'version': 'v3', 'created': 'Wed, 25 Nov 2015 17:57:58 GMT'}]",2015-11-26,"[['Habak', 'Karim', ''], ['Harras', 'Khaled A.', ''], ['Youssef', 'Moustafa', '']]","['Bandwidth aggregation', 'multiple network interfaces', 'throughput', 'optimization', 'multihoming']"
1708,0907.0340,James Whitacre,"James M. Whitacre, Hussein A. Abbass, Ruhul Sarker, Axel Bender,
  Stephen Baker",Strategic Positioning in Tactical Scenario Planning,,"Genetic And Evolutionary Computation Conference 2008, Pages
  1081-1088",10.1145/1389095.1389293,,cs.NE cs.AI,http://creativecommons.org/licenses/by/3.0/,"  Capability planning problems are pervasive throughout many areas of human
interest with prominent examples found in defense and security. Planning
provides a unique context for optimization that has not been explored in great
detail and involves a number of interesting challenges which are distinct from
traditional optimization research. Planning problems demand solutions that can
satisfy a number of competing objectives on multiple scales related to
robustness, adaptiveness, risk, etc. The scenario method is a key approach for
planning. Scenarios can be defined for long-term as well as short-term plans.
This paper introduces computational scenario-based planning problems and
proposes ways to accommodate strategic positioning within the tactical planning
domain. We demonstrate the methodology in a resource planning problem that is
solved with a multi-objective evolutionary algorithm. Our discussion and
results highlight the fact that scenario-based planning is naturally framed
within a multi-objective setting. However, the conflicting objectives occur on
different system levels rather than within a single system alone. This paper
also contends that planning problems are of vital interest in many human
endeavors and that Evolutionary Computation may be well positioned for this
problem domain.
","[{'version': 'v1', 'created': 'Thu, 2 Jul 2009 10:56:52 GMT'}]",2009-07-03,"[['Whitacre', 'James M.', ''], ['Abbass', 'Hussein A.', ''], ['Sarker', 'Ruhul', ''], ['Bender', 'Axel', ''], ['Baker', 'Stephen', '']]","['evolutionary algorithms', 'scenarios', 'uncertainty', 'decision support', 'strategic planning', 'military planning']"
1709,0802.3875,Andrew Adamatzky,Andy Adamatzky and Larry Bull,Are complex systems hard to evolve?,,"Volume 14, Issue 6, pages 15-20, July/August 2009",10.1002/cplx.20269,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evolutionary complexity is here measured by the number of trials/evaluations
needed for evolving a logical gate in a non-linear medium. Behavioural
complexity of the gates evolved is characterised in terms of cellular automata
behaviour. We speculate that hierarchies of behavioural and evolutionary
complexities are isomorphic up to some degree, subject to substrate specificity
of evolution and the spectrum of evolution parameters.
","[{'version': 'v1', 'created': 'Tue, 26 Feb 2008 19:07:53 GMT'}]",2010-11-23,"[['Adamatzky', 'Andy', ''], ['Bull', 'Larry', '']]","['logic gates', 'evolution', 'cellular automata', 'complexity']"
1710,1310.8511,{\L}ukasz D\k{e}bowski,{\L}ukasz D\k{e}bowski,"A Preadapted Universal Switch Distribution for Testing Hilberg's
  Conjecture","17 pages, 3 figures","IEEE Transactions on Information Theory 61(10):5708-5715, 2015",10.1109/TIT.2015.2466693,,cs.IT cs.CL math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hilberg's conjecture about natural language states that the mutual
information between two adjacent long blocks of text grows like a power of the
block length. The exponent in this statement can be upper bounded using the
pointwise mutual information estimate computed for a carefully chosen code. The
bound is the better, the lower the compression rate is but there is a
requirement that the code be universal. So as to improve a received upper bound
for Hilberg's exponent, in this paper, we introduce two novel universal codes,
called the plain switch distribution and the preadapted switch distribution.
Generally speaking, switch distributions are certain mixtures of adaptive
Markov chains of varying orders with some additional communication to avoid so
called catch-up phenomenon. The advantage of these distributions is that they
both achieve a low compression rate and are guaranteed to be universal. Using
the switch distributions we obtain that a sample of a text in English is
non-Markovian with Hilberg's exponent being $\le 0.83$, which improves over the
previous bound $\le 0.94$ obtained using the Lempel-Ziv code.
","[{'version': 'v1', 'created': 'Thu, 31 Oct 2013 14:12:30 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Mar 2015 11:51:04 GMT'}]",2020-03-11,"[['Dębowski', 'Łukasz', '']]","['universal coding', 'natural language', 'Hilberg’s conjecture']"
1711,1904.01721,Haozhen Zhao,"Rishi Chhatwal, Peter Gronvall, Nathaniel Huber-Fliflet, Robert
  Keeling, Jianping Zhang, Haozhen Zhao","Explainable Text Classification in Legal Document Review A Case Study of
  Explainable Predictive Coding",2018 IEEE International Conference on Big Data,,10.1109/BigData.2018.8622073,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In today's legal environment, lawsuits and regulatory investigations require
companies to embark upon increasingly intensive data-focused engagements to
identify, collect and analyze large quantities of data. When documents are
staged for review the process can require companies to dedicate an
extraordinary level of resources, both with respect to human resources, but
also with respect to the use of technology-based techniques to intelligently
sift through data. For several years, attorneys have been using a variety of
tools to conduct this exercise, and most recently, they are accepting the use
of machine learning techniques like text classification to efficiently cull
massive volumes of data to identify responsive documents for use in these
matters. In recent years, a group of AI and Machine Learning researchers have
been actively researching Explainable AI. In an explainable AI system, actions
or decisions are human understandable. In typical legal `document review'
scenarios, a document can be identified as responsive, as long as one or more
of the text snippets in a document are deemed responsive. In these scenarios,
if predictive coding can be used to locate these responsive snippets, then
attorneys could easily evaluate the model's document classification decision.
When deployed with defined and explainable results, predictive coding can
drastically enhance the overall quality and speed of the document review
process by reducing the time it takes to review documents. The authors of this
paper propose the concept of explainable predictive coding and simple
explainable predictive coding methods to locate responsive snippets within
responsive documents. We also report our preliminary experimental results using
the data from an actual legal matter that entailed this type of document
review.
","[{'version': 'v1', 'created': 'Wed, 3 Apr 2019 00:57:32 GMT'}]",2019-04-04,"[['Chhatwal', 'Rishi', ''], ['Gronvall', 'Peter', ''], ['Huber-Fliflet', 'Nathaniel', ''], ['Keeling', 'Robert', ''], ['Zhang', 'Jianping', ''], ['Zhao', 'Haozhen', '']]","['machine learning', 'text categorization', 'explainable']"
1712,1409.8053,J. G. Wolff,J. Gerard Wolff,"Medical diagnosis as pattern recognition in a framework of information
  compression by multiple alignment, unification and search",,"Decision Support Systems 42, 608-625, 2006",10.1016/j.dss.2005.02.005,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a novel approach to medical diagnosis based on the SP
theory of computing and cognition. The main attractions of this approach are: a
format for representing diseases that is simple and intuitive; an ability to
cope with errors and uncertainties in diagnostic information; the simplicity of
storing statistical information as frequencies of occurrence of diseases; a
method for evaluating alternative diagnostic hypotheses that yields true
probabilities; and a framework that should facilitate unsupervised learning of
medical knowledge and the integration of medical diagnosis with other AI
applications.
","[{'version': 'v1', 'created': 'Mon, 29 Sep 2014 10:11:31 GMT'}]",2014-09-30,"[['Wolff', 'J. Gerard', '']]","['medical diagnosis', 'information compression', 'multiple alignment', 'SP theory', 'pattern recognition', 'causal reasoning']"
1713,2003.02693,Jiahua Xu,Daniel Perez and Jiahua Xu and Benjamin Livshits,Revisiting Transactional Statistics of High-scalability Blockchains,,Proceedings of the ACM Internet Measurement Conference (2020),10.1145/3419394.3423628,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Scalability has been a bottleneck for major blockchains such as Bitcoin and
Ethereum. Despite the significantly improved scalability claimed by several
high--profile blockchain projects, there has been little effort to understand
how their transactional throughput is being used. In this paper, we examine
recent network traffic of three major high-scalability blockchains--EOSIO,
Tezos and XRP Ledger (XRPL)--over a period of seven months. Our analysis
reveals that only a small fraction of the transactions are used for value
transfer purposes. In particular, 96% of the transactions on EOSIO were
triggered by the airdrop of a currently valueless token; on Tezos, 76% of
throughput was used for maintaining consensus; and over 94% of transactions on
XRPL carried no economic value. We also identify a persisting airdrop on EOSIO
as a DoS attack and detect a two-month-long spam attack on XRPL. The paper
explores the different designs of the three blockchains and sheds light on how
they could shape user behavior.
","[{'version': 'v1', 'created': 'Thu, 5 Mar 2020 15:01:58 GMT'}, {'version': 'v2', 'created': 'Tue, 12 May 2020 22:22:19 GMT'}, {'version': 'v3', 'created': 'Wed, 3 Jun 2020 13:59:03 GMT'}, {'version': 'v4', 'created': 'Sat, 15 Aug 2020 17:18:21 GMT'}, {'version': 'v5', 'created': 'Sat, 3 Oct 2020 14:13:18 GMT'}]",2020-10-06,"[['Perez', 'Daniel', ''], ['Xu', 'Jiahua', ''], ['Livshits', 'Benjamin', '']]","['Blockchain', 'Transactional throughput', 'Internet measurements', 'Data extraction']"
1714,1208.2092,Rajalakshmi  M,"M. Rajalakshmi, P. Subashini","A study on non-destructive method for detecting Toxin in pepper using
  Neural networks","11 pages,1 figure; International Journal of Artificial Intelligence &
  Applications (IJAIA), Vol.3, No.4, July 2012",,10.5121/ijaia.2012.3414,,cs.NE cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mycotoxin contamination in certain agricultural systems have been a serious
concern for human and animal health. Mycotoxins are toxic substances produced
mostly as secondary metabolites by fungi that grow on seeds and feed in the
field, or in storage. The food-borne Mycotoxins likely to be of greatest
significance for human health in tropical developing countries are Aflatoxins
and Fumonisins. Chili pepper is also prone to Aflatoxin contamination during
harvesting, production and storage periods.Various methods used for detection
of Mycotoxins give accurate results, but they are slow, expensive and
destructive. Destructive method is testing a material that degrades the sample
under investigation. Whereas, non-destructive testing will, after testing,
allow the part to be used for its intended purpose. Ultrasonic methods,
Multispectral image processing methods, Terahertz methods, X-ray and
Thermography have been very popular in nondestructive testing and
characterization of materials and health monitoring. Image processing methods
are used to improve the visual quality of the pictures and to extract useful
information from them. In this proposed work, the chili pepper samples will be
collected, and the X-ray, multispectral images of the samples will be processed
using image processing methods. The term ""Computational Intelligence"" referred
as simulation of human intelligence on computers. It is also called as
""Artificial Intelligence"" (AI) approach. The techniques used in AI approach are
Neural network, Fuzzy logic and evolutionary computation. Finally, the
computational intelligence method will be used in addition to image processing
to provide best, high performance and accurate results for detecting the
Mycotoxin level in the samples collected.
","[{'version': 'v1', 'created': 'Fri, 10 Aug 2012 05:50:04 GMT'}]",2012-08-13,"[['Rajalakshmi', 'M.', ''], ['Subashini', 'P.', '']]","['Non-destructive', 'X-ray images', 'Multispectral images', 'Aflatoxin', 'Neural networks']"
1715,1610.03932,Christopher Vogl,Christopher J. Vogl,"The Curvature-Augmented Closest Point Method with Vesicle
  Inextensibility Application",,,10.1016/j.jcp.2017.06.004,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Closest Point method, initially developed by Ruuth and Merriman, allows
for the numerical solution of surface partial differential equations without
the need for a parameterization of the surface itself. Surface quantities are
embedded into the surrounding domain by assigning each value at a given spatial
location to the corresponding value at the closest point on the surface. This
embedding allows for surface derivatives to be replaced by their Cartesian
counterparts (e.g. $\nabla_s = \nabla$). This equivalence is only valid on the
surface, and thus, interpolation is used to enforce what is known as the side
condition away from the surface. To improve upon the method, this work derives
an operator embedding that incorporates curvature information, making it valid
in a neighborhood of the surface. With this, direct enforcement of the side
condition is no longer needed. Comparisons in $\mathbb{R}^2$ and $\mathbb{R}^3$
show that the resulting Curvature-Augmented Closest Point method has better
accuracy and requires less memory, through increased matrix sparsity, than the
Closest Point method, while maintaining similar matrix condition numbers. To
demonstrate the utility of the method in a physical application, simulations of
inextensible, bi-lipid vesicles evolving toward equilibrium shapes are also
included.
","[{'version': 'v1', 'created': 'Thu, 13 Oct 2016 04:08:32 GMT'}, {'version': 'v2', 'created': 'Wed, 31 May 2017 22:08:56 GMT'}, {'version': 'v3', 'created': 'Sun, 11 Jun 2017 05:06:42 GMT'}]",2017-06-28,"[['Vogl', 'Christopher J.', '']]","['closest point method', 'surface partial differential equation', 'surface gradient', 'Laplace-Beltrami operator', 'vesicle', 'inextensible membrane']"
1716,1807.05648,Euijoon Ahn,"Euijoon Ahn, Jinman Kim, Ashnil Kumar, Michael Fulham, Dagan Feng","Convolutional Sparse Kernel Network for Unsupervised Medical Image
  Analysis","Accepted by Medical Image Analysis (with a new title 'Convolutional
  Sparse Kernel Network for Unsupervised Medical Image Analysis'). The
  manuscript is available from following link
  (https://doi.org/10.1016/j.media.2019.06.005)",,10.1016/j.media.2019.06.005,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The availability of large-scale annotated image datasets and recent advances
in supervised deep learning methods enable the end-to-end derivation of
representative image features that can impact a variety of image analysis
problems. Such supervised approaches, however, are difficult to implement in
the medical domain where large volumes of labelled data are difficult to obtain
due to the complexity of manual annotation and inter- and intra-observer
variability in label assignment. We propose a new convolutional sparse kernel
network (CSKN), which is a hierarchical unsupervised feature learning framework
that addresses the challenge of learning representative visual features in
medical image analysis domains where there is a lack of annotated training
data. Our framework has three contributions: (i) We extend kernel learning to
identify and represent invariant features across image sub-patches in an
unsupervised manner. (ii) We initialise our kernel learning with a layer-wise
pre-training scheme that leverages the sparsity inherent in medical images to
extract initial discriminative features. (iii) We adapt a multi-scale spatial
pyramid pooling (SPP) framework to capture subtle geometric differences between
learned visual features. We evaluated our framework in medical image retrieval
and classification on three public datasets. Our results show that our CSKN had
better accuracy when compared to other conventional unsupervised methods and
comparable accuracy to methods that used state-of-the-art supervised
convolutional neural networks (CNNs). Our findings indicate that our
unsupervised CSKN provides an opportunity to leverage unannotated big data in
medical imaging repositories.
","[{'version': 'v1', 'created': 'Mon, 16 Jul 2018 01:33:00 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Jul 2018 05:05:36 GMT'}, {'version': 'v3', 'created': 'Thu, 13 Jun 2019 02:23:13 GMT'}, {'version': 'v4', 'created': 'Sat, 20 Jun 2020 05:02:28 GMT'}]",2020-06-23,"[['Ahn', 'Euijoon', ''], ['Kim', 'Jinman', ''], ['Kumar', 'Ashnil', ''], ['Fulham', 'Michael', ''], ['Feng', 'Dagan', '']]","['Unsupervised Feature Learning', 'Medical Image Retrieval', 'Medical Image Classification', 'Kernel Learning']"
1717,1201.1204,Lachhman Das Dhomeja,"Lachhman Das Dhomeja, Yasir Arfat Malkani, Asad Ali Shaikh and Ayaz
  Keerio","Transparent caching of virtual stubs for improved performance in
  ubiquitous environments",arXiv admin note: text overlap with arXiv:1108.1472 by other authors,"Lachhman Das Dhomeja, Yasir Arfat Malkani, Asad Ali Shaikh and
  Ayaz Keerio, ""Transparent Caching of Virtual Stubs for Improved Performance
  in Ubiquitous Environments "", International Journal of UbiComp (IJU), Vol.2,
  No.4, October 2011",10.5121/iju.2011.2401,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context-awareness is an essential requirement for pervasive computing
applications, which enables them to adapt and perform tasks based on context.
One of the adaptive features of context-awareness is contextual
reconfiguration. Contextual reconfiguration involves discovering remote
service(s) based on context and binding them to the application components to
realize new behaviors, which may be needed to satisfy user needs or to enrich
user experience. One of the steps in the reconfiguration process involves a
remote lookup to discover the service(s) based on context. This remote lookup
process provides the largest contribution to reconfiguration time and this is
due to fact that the remote calls are much slower than local calls.
Consequently, it affects system performance. In pervasive computing
applications, this may turn out to be undesirable in terms of user experience.
Moreover, other distributed applications using the network may be affected as
every remote method call decreases the amount of bandwidth available on the
network. Various systems provide reconfiguration support and offer high-level
reconfiguration directives to develop adaptive context-aware applications, but
do not address this performance bottleneck. We address this issue and implement
seamless caching of virtual stubs within our PCRA1 for improved performance. In
this paper we present and describe our transparent caching support and also
provide its performance evaluation.
","[{'version': 'v1', 'created': 'Fri, 25 Nov 2011 12:57:17 GMT'}]",2012-01-06,"[['Dhomeja', 'Lachhman Das', ''], ['Malkani', 'Yasir Arfat', ''], ['Shaikh', 'Asad Ali', ''], ['Keerio', 'Ayaz', '']]","['Contextual Reconfiguration', 'Virtual Stub Cache Manager', 'Ponder2', 'Bindings', 'Ubiquitous Computing']"
1718,1905.03093,Mohammad Riyaz Belgaum,"Mohammad Riyaz Belgaum, Safeeullah Soomro, Zainab Alansari and
  Muhammad Alam","Cloud Service ranking using Checkpoint based Load balancing in real time
  scheduling of Cloud Computing",,,10.1007/978-981-10-6872-0_64,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing has been gaining popularity in the recent years. Several
studies are being proceeded to build cloud applications with exquisite quality
based on users demands. In achieving the same, one of the applied criteria is
checkpoint based load balancing in real time scheduling through which suitable
cloud service is chosen from a group of cloud services candidates. Valuable
information can be collected to rank the services within this checkpoint based
load balancing. In order to attain ranking, different services are needed to be
invoked in the cloud, which is time consuming and wastage of services
invocation. To avoid the same, this chapter proposes an algorithm for
predicting the ranks of different cloud services by using the values from
previously offered services.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2019 09:18:53 GMT'}]",2020-10-02,"[['Belgaum', 'Mohammad Riyaz', ''], ['Soomro', 'Safeeullah', ''], ['Alansari', 'Zainab', ''], ['Alam', 'Muhammad', '']]","['Load Balancing', 'Checkpoint', 'Cloud services']"
1719,2104.14756,Hanyang Liu,"Hanyang Liu, Michael C. Montana, Dingwen Li, Chase Renfroe, Thomas
  Kannampallil, Chenyang Lu","Predicting Intraoperative Hypoxemia with Hybrid Inference Sequence
  Autoencoder Networks",Accepted for CIKM '22,"Proceedings of the 31th ACM International Conference on
  Information and Knowledge Management (CIKM), 2022",,,cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We present an end-to-end model using streaming physiological time series to
predict near-term risk for hypoxemia, a rare, but life-threatening condition
known to cause serious patient harm during surgery. Inspired by the fact that a
hypoxemia event is defined based on a future sequence of low SpO2 (i.e., blood
oxygen saturation) instances, we propose the hybrid inference network (hiNet)
that makes hybrid inference on both future low SpO2 instances and hypoxemia
outcomes. hiNet integrates 1) a joint sequence autoencoder that simultaneously
optimizes a discriminative decoder for label prediction, and 2) two auxiliary
decoders trained for data reconstruction and forecast, which seamlessly learn
contextual latent representations that capture the transition from present
states to future states. All decoders share a memory-based encoder that helps
capture the global dynamics of patient measurement. For a large surgical cohort
of 72,081 surgeries at a major academic medical center, our model outperforms
strong baselines including the model used by the state-of-the-art hypoxemia
prediction system. With its capability to make real-time predictions of
near-term hypoxemic at clinically acceptable alarm rates, hiNet shows promise
in improving clinical decision making and easing burden of perioperative care.
","[{'version': 'v1', 'created': 'Fri, 30 Apr 2021 05:01:50 GMT'}, {'version': 'v2', 'created': 'Wed, 19 May 2021 06:56:42 GMT'}, {'version': 'v3', 'created': 'Tue, 7 Sep 2021 21:32:51 GMT'}, {'version': 'v4', 'created': 'Fri, 18 Feb 2022 04:52:41 GMT'}, {'version': 'v5', 'created': 'Tue, 9 Aug 2022 06:23:47 GMT'}, {'version': 'v6', 'created': 'Tue, 23 Aug 2022 06:45:28 GMT'}]",2022-08-24,"[['Liu', 'Hanyang', ''], ['Montana', 'Michael C.', ''], ['Li', 'Dingwen', ''], ['Renfroe', 'Chase', ''], ['Kannampallil', 'Thomas', ''], ['Lu', 'Chenyang', '']]","['Hypoxemia prediction', 'physiological time series', 'deep sequencelearning', 'autoencoder']"
1720,1903.02153,Chao Chen,"Ruoxi Wang, Chao Chen, Jonghyun Lee, Eric Darve","PBBFMM3D: a parallel black-box algorithm for kernel matrix-vector
  multiplication",,"Journal of Parallel and Distributed Computing Volume 154, August
  2021, Pages 64-73",10.1016/j.jpdc.2021.04.005,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Kernel matrix-vector product is ubiquitous in many science and engineering
applications. However, a naive method requires $O(N^2)$ operations, which
becomes prohibitive for large-scale problems. We introduce a parallel method
that provably requires $O(N)$ operations to reduce the computation cost. The
distinct feature of our method is that it requires only the ability to evaluate
the kernel function, offering a black-box interface to users. Our parallel
approach targets multi-core shared-memory machines and is implemented using
OpenMP. Numerical results demonstrate up to $19\times$ speedup on 32 cores. We
also present a real-world application in geostatistics, where our parallel
method was used to deliver fast principle component analysis of covariance
matrices.
","[{'version': 'v1', 'created': 'Wed, 6 Mar 2019 03:33:18 GMT'}, {'version': 'v2', 'created': 'Wed, 13 May 2020 05:00:45 GMT'}, {'version': 'v3', 'created': 'Tue, 27 Apr 2021 17:12:22 GMT'}]",2021-04-30,"[['Wang', 'Ruoxi', ''], ['Chen', 'Chao', ''], ['Lee', 'Jonghyun', ''], ['Darve', 'Eric', '']]","['kernel method', 'matrix-vector multiplication', 'covariance matrix', 'fast multipole method', 'shared-memory parallelism']"
1721,1706.07886,Mohammed Fathy,"Mohammed E. Fathy, Ashraf S. Hussein, Mohammed F. Tolba",Fundamental Matrix Estimation: A Study of Error Criteria,"15 pages, 7 figures, Pattern Recognition Letters, 2011",,10.1016/j.patrec.2010.09.019,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The fundamental matrix (FM) describes the geometric relations that exist
between two images of the same scene. Different error criteria are used for
estimating FMs from an input set of correspondences. In this paper, the
accuracy and efficiency aspects of the different error criteria were studied.
We mathematically and experimentally proved that the most popular error
criterion, the symmetric epipolar distance, is biased. It was also shown that
despite the similarity between the algebraic expressions of the symmetric
epipolar distance and Sampson distance, they have different accuracy
properties. In addition, a new error criterion, Kanatani distance, was proposed
and was proved to be the most effective for use during the outlier removal
phase from accuracy and efficiency perspectives. To thoroughly test the
accuracy of the different error criteria, we proposed a randomized algorithm
for Reprojection Error-based Correspondence Generation (RE-CG). As input, RE-CG
takes an FM and a desired reprojection error value $d$. As output, RE-CG
generates a random correspondence having that error value. Mathematical
analysis of this algorithm revealed that the success probability for any given
trial is 1 - (2/3)^2 at best and is 1 - (6/7)^2 at worst while experiments
demonstrated that the algorithm often succeeds after only one trial.
","[{'version': 'v1', 'created': 'Sat, 24 Jun 2017 00:13:29 GMT'}]",2017-06-27,"[['Fathy', 'Mohammed E.', ''], ['Hussein', 'Ashraf S.', ''], ['Tolba', 'Mohammed F.', '']]","['Fundamental Matrix', 'Epipolar Geometry', 'Structure and Motion']"
1722,1007.4476,Jacopo Mauro,"Maurizio Gabbrielli abd Jacopo Mauro and Maria Chiara Meo and Jon
  Sneyers",Decidability properties for fragments of CHR,,"Theory and Practice of Logic Programming, volume 10, number 4-6,
  year 2010, pages 611-626",10.1017/S1471068410000311,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the decidability of termination for two CHR dialects which,
similarly to the Datalog like languages, are defined by using a signature which
does not allow function symbols (of arity >0). Both languages allow the use of
the = built-in in the body of rules, thus are built on a host language that
supports unification. However each imposes one further restriction. The first
CHR dialect allows only range-restricted rules, that is, it does not allow the
use of variables in the body or in the guard of a rule if they do not appear in
the head. We show that the existence of an infinite computation is decidable
for this dialect. The second dialect instead limits the number of atoms in the
head of rules to one. We prove that in this case, the existence of a
terminating computation is decidable. These results show that both dialects are
strictly less expressive than Turing Machines. It is worth noting that the
language (without function symbols) without these restrictions is as expressive
as Turing Machines.
","[{'version': 'v1', 'created': 'Mon, 26 Jul 2010 14:50:36 GMT'}]",2010-07-27,"[['Mauro', 'Maurizio Gabbrielli abd Jacopo', ''], ['Meo', 'Maria Chiara', ''], ['Sneyers', 'Jon', '']]","['Constraint programming', 'Expressivity', 'Well-structured transition systems']"
1723,1303.0341,Wen-Xin Zhou,"T. Tony Cai, Wen-Xin Zhou",Matrix Completion via Max-Norm Constrained Optimization,33 pages,,10.1214/16-EJS1147,,cs.LG cs.IT math.IT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Matrix completion has been well studied under the uniform sampling model and
the trace-norm regularized methods perform well both theoretically and
numerically in such a setting. However, the uniform sampling model is
unrealistic for a range of applications and the standard trace-norm relaxation
can behave very poorly when the underlying sampling scheme is non-uniform.
  In this paper we propose and analyze a max-norm constrained empirical risk
minimization method for noisy matrix completion under a general sampling model.
The optimal rate of convergence is established under the Frobenius norm loss in
the context of approximately low-rank matrix reconstruction. It is shown that
the max-norm constrained method is minimax rate-optimal and yields a unified
and robust approximate recovery guarantee, with respect to the sampling
distributions. The computational effectiveness of this method is also
discussed, based on first-order algorithms for solving convex optimizations
involving max-norm regularization.
","[{'version': 'v1', 'created': 'Sat, 2 Mar 2013 03:22:37 GMT'}, {'version': 'v2', 'created': 'Fri, 16 May 2014 06:05:27 GMT'}, {'version': 'v3', 'created': 'Fri, 28 Apr 2017 02:03:30 GMT'}]",2017-05-01,"[['Cai', 'T. Tony', ''], ['Zhou', 'Wen-Xin', '']]","['Compressed sensing', 'low-rank matrix', 'matrixcompletion', 'max-norm constrained minimization', 'minimax optimality', 'nonuniform sampling', 'sparsity']"
1724,1703.06642,Diederik Aerts,"Diederik Aerts, Jonito Aerts Arguelles, Lester Beltran, Lyneth
  Beltran, Isaac Distrito, Massimiliano Sassoli de Bianchi, Sandro Sozzo and
  Tomas Veloz",Towards a Quantum World Wide Web,"24 pages, no figures","Theoretical Computer Science, 752, pp. 116-131 (2018)",10.1016/j.tcs.2018.03.019,,cs.AI cs.CL quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We elaborate a quantum model for the meaning associated with corpora of
written documents, like the pages forming the World Wide Web. To that end, we
are guided by how physicists constructed quantum theory for microscopic
entities, which unlike classical objects cannot be fully represented in our
spatial theater. We suggest that a similar construction needs to be carried out
by linguists and computational scientists, to capture the full meaning carried
by collections of documental entities. More precisely, we show how to associate
a quantum-like 'entity of meaning' to a 'language entity formed by printed
documents', considering the latter as the collection of traces that are left by
the former, in specific results of search actions that we describe as
measurements. In other words, we offer a perspective where a collection of
documents, like the Web, is described as the space of manifestation of a more
complex entity - the QWeb - which is the object of our modeling, drawing its
inspiration from previous studies on operational-realistic approaches to
quantum physics and quantum modeling of human cognition and decision-making. We
emphasize that a consistent QWeb model needs to account for the observed
correlations between words appearing in printed documents, e.g.,
co-occurrences, as the latter would depend on the 'meaning connections'
existing between the concepts that are associated with these words. In that
respect, we show that both 'context and interference (quantum) effects' are
required to explain the probabilities calculated by counting the relative
number of documents containing certain words and co-ocurrrences of words.
","[{'version': 'v1', 'created': 'Mon, 20 Mar 2017 09:28:38 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Jan 2018 20:00:49 GMT'}]",2019-02-12,"[['Aerts', 'Diederik', ''], ['Arguelles', 'Jonito Aerts', ''], ['Beltran', 'Lester', ''], ['Beltran', 'Lyneth', ''], ['Distrito', 'Isaac', ''], ['de Bianchi', 'Massimiliano Sassoli', ''], ['Sozzo', 'Sandro', ''], ['Veloz', 'Tomas', '']]","['World Wide Web', 'Conceptual entities', 'Quantum structures', 'Information retrieval']"
1725,1811.12605,Qingyu Liu,"Qingyu Liu, Haibo Zeng, Minghua Chen","Minimizing Age-of-Information with Throughput Requirements in Multi-Path
  Network Communication","Accepted by the ACM Twentieth International Symposium on Mobile Ad
  Hoc Networking and Computing (ACM MobiHoc 2019)",,10.1145/3323679.3326502,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the scenario where a sender periodically sends a batch of data to
a receiver over a multi-hop network, possibly using multiple paths. Our
objective is to minimize peak/average Age-of-Information (AoI) subject to
throughput requirements. The consideration of batch generation and multi-path
communication differentiates our AoI study from existing ones. We first show
that our AoI minimization problems are NP-hard, but only in the weak sense, as
we develop an optimal algorithm with a pseudo-polynomial time complexity. We
then prove that minimizing AoI and minimizing maximum delay are ""roughly""
equivalent, in the sense that any optimal solution of the latter is an
approximate solution of the former with bounded optimality loss. We leverage
this understanding to design a general approximation framework for our
problems. It can build upon any $\alpha$-approximation algorithm of the maximum
delay minimization problem, to construct an $(\alpha+c)$-approximate solution
for minimizing AoI. Here $c$ is a constant depending on the throughput
requirements. Simulations over various network topologies validate the
effectiveness of our approach.
","[{'version': 'v1', 'created': 'Fri, 30 Nov 2018 04:14:43 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Dec 2018 19:02:26 GMT'}, {'version': 'v3', 'created': 'Sat, 22 Dec 2018 03:35:05 GMT'}, {'version': 'v4', 'created': 'Thu, 16 May 2019 18:39:30 GMT'}]",2019-05-20,"[['Liu', 'Qingyu', ''], ['Zeng', 'Haibo', ''], ['Chen', 'Minghua', '']]","['Age-of-information', 'multi-path routing', 'time-critical network flow']"
1726,2102.09635,Bibek Paudel,"Bibek Paudel, Abraham Bernstein","Random Walks with Erasure: Diversifying Personalized Recommendations on
  Social and Information Networks",Web Conference 2021 (WWW '21),"Proceedings of the Web Conference 2021 (WWW '21), April 19--23,
  2021, Ljubljana, Slovenia",10.1145/3442381.3449970,,cs.SI cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most existing personalization systems promote items that match a user's
previous choices or those that are popular among similar users. This results in
recommendations that are highly similar to the ones users are already exposed
to, resulting in their isolation inside familiar but insulated information
silos. In this context, we develop a novel recommendation framework with a goal
of improving information diversity using a modified random walk exploration of
the user-item graph. We focus on the problem of political content
recommendation, while addressing a general problem applicable to
personalization tasks in other social and information networks.
  For recommending political content on social networks, we first propose a new
model to estimate the ideological positions for both users and the content they
share, which is able to recover ideological positions with high accuracy. Based
on these estimated positions, we generate diversified personalized
recommendations using our new random-walk based recommendation algorithm. With
experimental evaluations on large datasets of Twitter discussions, we show that
our method based on \emph{random walks with erasure} is able to generate more
ideologically diverse recommendations. Our approach does not depend on the
availability of labels regarding the bias of users or content producers. With
experiments on open benchmark datasets from other social and information
networks, we also demonstrate the effectiveness of our method in recommending
diverse long-tail items.
","[{'version': 'v1', 'created': 'Thu, 18 Feb 2021 21:53:32 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Feb 2021 17:23:16 GMT'}, {'version': 'v3', 'created': 'Thu, 25 Feb 2021 17:20:52 GMT'}]",2021-02-26,"[['Paudel', 'Bibek', ''], ['Bernstein', 'Abraham', '']]","['diverse recommendations', 'social networks', 'random walks']"
1727,1812.07339,Daniel Graziotin,"Falko Koetter, Matthias Blohm, Monika Kochanowski, Joscha Goetzer,
  Daniel Graziotin, Stefan Wagner","Motivations, Classification and Model Trial of Conversational Agents for
  Insurance Companies","12 pages, 6 figure, accepted for presentation at The International
  Conference on Agents and Artificial Intelligence 2019 (ICAART 2019)",,10.5220/0007252100190030,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advances in artificial intelligence have renewed interest in conversational
agents. So-called chatbots have reached maturity for industrial applications.
German insurance companies are interested in improving their customer service
and digitizing their business processes. In this work we investigate the
potential use of conversational agents in insurance companies by determining
which classes of agents are of interest to insurance companies, finding
relevant use cases and requirements, and developing a prototype for an
exemplary insurance scenario. Based on this approach, we derive key findings
for conversational agent implementation in insurance companies.
","[{'version': 'v1', 'created': 'Tue, 18 Dec 2018 12:56:51 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Dec 2018 10:01:57 GMT'}]",2021-02-10,"[['Koetter', 'Falko', ''], ['Blohm', 'Matthias', ''], ['Kochanowski', 'Monika', ''], ['Goetzer', 'Joscha', ''], ['Graziotin', 'Daniel', ''], ['Wagner', 'Stefan', '']]","['conversational agents', 'intelligent user interfaces', 'machine learning', 'nlp', 'chatbots', 'insurance']"
1728,1808.06063,Rushan Ziatdinov,"Ismail Ipek, Rushan Ziatdinov","New Approaches and Trends in the Philosophy of Educational Technology
  for Learning and Teaching Environments",,"European Journal of Contemporary Education, 6(3), 381-389, 2017",10.13187/ejced.2017.3.381,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this study is to discuss instructional design and technology
(IDT) model strategies for developing learning and teaching environments, based
on philosophical approaches to educational technology theory. The study begins
with a discussion of IDT models to define the history of educational technology
or instructional technology theories, based on instructional strategies and
improvements. In the study, authors discuss the strategies and steps that a
design team should follow when designing learning environments in industry,
business and military scenarios, based on the philosophy of educational
technology and latest technologies, which should give way to effective learning
environments. The steps include recognising terminology in educational
technology concepts, psychological and instructional foundations in
instructional design (ID), as well as approaches to educational technology. To
recap, our purpose is to combine necessary IDT model strategies for the
pedagogical design of learning environments, with new technologies. We will
also discuss powerful IDT models that aim to meet the very high expectations of
digital and humanist education. To develop a high-quality learning environment,
we will explain technology design steps and practice in order to improve the
learning of tasks, complex cognitive skills, attitudes, motivations and
competencies in the future trends of educational technology. At the end of the
study, integrated technologies in e-learning were discussed and presented,
based on foundations of IDT and the philosophy of educational technology.
","[{'version': 'v1', 'created': 'Sat, 18 Aug 2018 09:12:58 GMT'}]",2018-08-21,"[['Ipek', 'Ismail', ''], ['Ziatdinov', 'Rushan', '']]","['philosophy of education', 'educational technology', 'instructional design', 'instructional design and technology', 'digital education']"
1729,1805.08695,Panagiotis Mousouliotis,"Panagiotis G. Mousouliotis, Loukas P. Petrou","SqueezeJet: High-level Synthesis Accelerator Design for Deep
  Convolutional Neural Networks","The final publication is available at Springer via
  https://doi.org/10.1007/978-3-319-78890-6_5",,10.1007/978-3-319-78890-6_5,,cs.CV cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep convolutional neural networks have dominated the pattern recognition
scene by providing much more accurate solutions in computer vision problems
such as object recognition and object detection. Most of these solutions come
at a huge computational cost, requiring billions of multiply-accumulate
operations and, thus, making their use quite challenging in real-time
applications that run on embedded mobile (resource-power constrained) hardware.
This work presents the architecture, the high-level synthesis design, and the
implementation of SqueezeJet, an FPGA accelerator for the inference phase of
the SqueezeNet DCNN architecture, which is designed specifically for use in
embedded systems. Results show that SqueezeJet can achieve 15.16 times speed-up
compared to the software implementation of SqueezeNet running on an embedded
mobile processor with less than 1% drop in top-5 accuracy.
","[{'version': 'v1', 'created': 'Sun, 6 May 2018 21:56:33 GMT'}]",2018-11-27,"[['Mousouliotis', 'Panagiotis G.', ''], ['Petrou', 'Loukas P.', '']]","['DCNN Accelerator', 'FPGA', 'High-level synthesis']"
1730,0901.2665,Eric Polizzi,Eric Polizzi,A Density Matrix-based Algorithm for Solving Eigenvalue Problems,"7 pages, 3 figures",,10.1103/PhysRevB.79.115112,,cs.CE cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new numerical algorithm for solving the symmetric eigenvalue problem is
presented. The technique deviates fundamentally from the traditional Krylov
subspace iteration based techniques (Arnoldi and Lanczos algorithms) or other
Davidson-Jacobi techniques, and takes its inspiration from the contour
integration and density matrix representation in quantum mechanics. It will be
shown that this new algorithm - named FEAST - exhibits high efficiency,
robustness, accuracy and scalability on parallel architectures. Examples from
electronic structure calculations of Carbon nanotubes (CNT) are presented, and
numerical performances and capabilities are discussed.
","[{'version': 'v1', 'created': 'Sat, 17 Jan 2009 23:36:23 GMT'}]",2009-11-13,"[['Polizzi', 'Eric', '']]","['diagonalization technique', 'contour integration', 'electronic structure calculations']"
1731,0708.1903,Vahan Mkrtchyan,"V. V. Mkrtchyan, V. L. Musoyan, A. V. Tserunyan",On Edge-Disjoint Pairs Of Matchings,"8 pages, 2 figures, Submitted to Discrete Mathematics","Discrete Mathematics, 2008, Vol 308/23 pp 5823-5828",10.1016/j.disc.2007.09.061,,cs.DM,,"  For a graph G, consider the pairs of edge-disjoint matchings whose union
consists of as many edges as possible. Let H be the largest matching among such
pairs. Let M be a maximum matching of G. We show that 5/4 is a tight upper
bound for |M|/|H|.
","[{'version': 'v1', 'created': 'Tue, 14 Aug 2007 14:38:47 GMT'}]",2008-10-09,"[['Mkrtchyan', 'V. V.', ''], ['Musoyan', 'V. L.', ''], ['Tserunyan', 'A. V.', '']]","['matching', 'maximum matching', 'pair of edge-disjoint matchings']"
1732,1404.6788,Dror Vinkler Mr.,"Dror A. Vinkler, Haim H. Permuter and Neri Merhav",Analogy Between Gambling and Measurement-Based Work Extraction,,,10.1088/1742-5468/2016/04/043403,,cs.IT cond-mat.stat-mech math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In information theory, one area of interest is gambling, where mutual
information characterizes the maximal gain in wealth growth rate due to
knowledge of side information; the betting strategy that achieves this maximum
is named the Kelly strategy. In the field of physics, it was recently shown
that mutual information can characterize the maximal amount of work that can be
extracted from a single heat bath using measurement-based control protocols,
i.e., using ""information engines"". However, to the best of our knowledge, no
relation between gambling and information engines has been presented before. In
this paper, we briefly review the two concepts and then demonstrate an analogy
between gambling, where bits are converted into wealth, and information
engines, where bits representing measurements are converted into energy. From
this analogy follows an extension of gambling to the continuous-valued case,
which is shown to be useful for investments in currency exchange rates or in
the stock market using options. Moreover, the analogy enables us to use
well-known methods and results from one field to solve problems in the other.
We present three such cases: maximum work extraction when the probability
distributions governing the system and measurements are unknown, work
extraction when some energy is lost in each cycle, e.g., due to friction, and
an analysis of systems with memory. In all three cases, the analogy enables us
to use known results in order to obtain new ones.
","[{'version': 'v1', 'created': 'Sun, 27 Apr 2014 16:53:34 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Feb 2016 19:11:32 GMT'}, {'version': 'v3', 'created': 'Sat, 12 Mar 2016 14:01:38 GMT'}]",2019-05-08,"[['Vinkler', 'Dror A.', ''], ['Permuter', 'Haim H.', ''], ['Merhav', 'Neri', '']]","['directed information', 'gambling', 'Kelly betting', 'Maxwell’s demon', 'Szilardengine', 'universal investment', 'work extraction']"
1733,1503.04404,Jessica Liebig,J. Liebig and A. Rao,"Predicting Item Popularity: Analysing Local Clustering Behaviour of
  Users","25 pages, 11 figures",,10.1016/j.physa.2015.08.045,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predicting the popularity of items in rating networks is an interesting but
challenging problem. This is especially so when an item has first appeared and
has received very few ratings. In this paper, we propose a novel approach to
predicting the future popularity of new items in rating networks, defining a
new bipartite clustering coefficient to predict the popularity of movies and
stories in the MovieLens and Digg networks respectively. We show that the
clustering behaviour of the first user who rates a new item gives insight into
the future popularity of that item. Our method predicts, with a success rate of
over 65% for the MovieLens network and over 50% for the Digg network, the
future popularity of an item. This is a major improvement on current results.
","[{'version': 'v1', 'created': 'Sun, 15 Mar 2015 09:57:41 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Sep 2015 01:19:11 GMT'}, {'version': 'v3', 'created': 'Thu, 17 Sep 2015 01:20:29 GMT'}]",2015-09-18,"[['Liebig', 'J.', ''], ['Rao', 'A.', '']]","['Bipartite networks', 'Clustering coefficient', 'Rating networks', 'Popularityprediction', 'Ego networks']"
1734,1405.1157,Hani Qudaih,"Hani A. Qudaih, Mohammed A. Bawazir, Shuaibu Hassan Usman, Jamaludin
  Ibrahim","Persuasive Technology Contributions Toward Enhance Information Security
  Awareness in an Organization","7 pages, 1 table, Published with International Journal of Computer
  Trends and Technology (IJCTT)","International Journal of Computer Trends and Technology (IJCTT)
  V10(4):180-186, Apr 2014. ISSN:2231-2803",10.14445/22312803/IJCTT-V10P131,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Persuasion is part and parcel of human interaction. The human persuaders in
society have been always exit, masters of rhetoric skilled of changing our
minds, or at least our behaviors. Leaders, mothers, salesmen, and teachers are
clear examples of persuaders. Persuaders often turn to technology and digital
media to amplify their persuasive ends. Besides, our lives and how we lead them
influenced by technologies and digital media,but for the most part, their
effects on our attitudes and behaviors have been incidental, even accidental.
Although, nowadays, the use of computers to sell products and services
considered as the most frequent application of persuasive technology. In this
short paper, based on an extensive review of literatures, we aim to give a
brief introduction to persuasive technology, and how it can play a role and
contribute to enhance and deliver the best practice of IT. Some challenges of
persuasive technology have been discussed. At the end, some recommendations and
steps should be taken place to empower IT professional practices have been
listed.
","[{'version': 'v1', 'created': 'Tue, 6 May 2014 05:54:59 GMT'}]",2014-05-07,"[['Qudaih', 'Hani A.', ''], ['Bawazir', 'Mohammed A.', ''], ['Usman', 'Shuaibu Hassan', ''], ['Ibrahim', 'Jamaludin', '']]","['Persuasive Technology', 'consultants', 'Information Security', 'Information Security Awareness']"
1735,2102.07076,Geoffrey Webb,Geoffrey I. Webb and Francois Petitjean,Tight lower bounds for Dynamic Time Warping,"26 pages, 23 figures, expanded version of a paper accepted for
  publication in Pattern Recognition. This revision fixed minor typos in the
  two algorithms","Pattern Recognition, Volume 115, 2021, 107895, ISSN 0031-3203",10.1016/j.patcog.2021.107895,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Dynamic Time Warping (DTW) is a popular similarity measure for aligning and
comparing time series. Due to DTW's high computation time, lower bounds are
often employed to screen poor matches. Many alternative lower bounds have been
proposed, providing a range of different trade-offs between tightness and
computational efficiency. LB Keogh provides a useful trade-off in many
applications. Two recent lower bounds, LB Improved and LB Enhanced, are
substantially tighter than LB Keogh. All three have the same worst case
computational complexity - linear with respect to series length and constant
with respect to window size. We present four new DTW lower bounds in the same
complexity class. LB Petitjean is substantially tighter than LB Improved, with
only modest additional computational overhead. LB Webb is more efficient than
LB Improved, while often providing a tighter bound. LB Webb is always tighter
than LB Keogh. The parameter free LB Webb is usually tighter than LB Enhanced.
A parameterized variant, LB Webb Enhanced, is always tighter than LB Enhanced.
A further variant, LB Webb*, is useful for some constrained distance functions.
In extensive experiments, LB Webb proves to be very effective for nearest
neighbor search.
","[{'version': 'v1', 'created': 'Sun, 14 Feb 2021 05:26:44 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Feb 2021 22:00:49 GMT'}, {'version': 'v3', 'created': 'Tue, 2 Mar 2021 04:00:30 GMT'}]",2021-03-03,"[['Webb', 'Geoffrey I.', ''], ['Petitjean', 'Francois', '']]","['dynamic time warping', 'lower bound', 'time series']"
1736,1811.09248,Martin Koehler,"Martin Koehler and Alex Bogatu and Cristina Civili and Nikolaos
  Konstantinou and Edward Abel and Alvaro A. A. Fernandes and John Keane and
  Leonid Libkin and Norman W. Paton",Data Context Informed Data Wrangling,,"2017 IEEE International Conference on Big Data (Big Data), pp.
  956-963, Boston, MA, 11-14 December, 2017",10.1109/BigData.2017.8258015,,cs.DB cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The process of preparing potentially large and complex data sets for further
analysis or manual examination is often called data wrangling. In classical
warehousing environments, the steps in such a process have been carried out
using Extract-Transform-Load platforms, with significant manual involvement in
specifying, configuring or tuning many of them. Cost-effective data wrangling
processes need to ensure that data wrangling steps benefit from automation
wherever possible. In this paper, we define a methodology to fully automate an
end-to-end data wrangling process incorporating data context, which associates
portions of a target schema with potentially spurious extensional data of types
that are commonly available. Instance-based evidence together with data
profiling paves the way to inform automation in several steps within the
wrangling process, specifically, matching, mapping validation, value format
transformation, and data repair. The approach is evaluated with real estate
data showing substantial improvements in the results of automated wrangling.
","[{'version': 'v1', 'created': 'Thu, 22 Nov 2018 17:34:35 GMT'}]",2018-11-26,"[['Koehler', 'Martin', ''], ['Bogatu', 'Alex', ''], ['Civili', 'Cristina', ''], ['Konstantinou', 'Nikolaos', ''], ['Abel', 'Edward', ''], ['Fernandes', 'Alvaro A. A.', ''], ['Keane', 'John', ''], ['Libkin', 'Leonid', ''], ['Paton', 'Norman W.', '']]","['Data Wrangling', 'Data Context', 'Data Integration']"
1737,1507.03510,Tao Chen,"Bang Hui Lim, Dongyuan Lu, Tao Chen, Min-Yen Kan","#mytweet via Instagram: Exploring User Behaviour across Multiple Social
  Networks","IEEE/ACM International Conference on Advances in Social Networks
  Analysis and Mining, 2015. This is the pre-peer reviewed version and the
  final version is available at
  http://wing.comp.nus.edu.sg/publications/2015/lim-et-al-15.pdf",,10.1145/2808797.2808820,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study how users of multiple online social networks (OSNs) employ and share
information by studying a common user pool that use six OSNs - Flickr, Google+,
Instagram, Tumblr, Twitter, and YouTube. We analyze the temporal and topical
signature of users' sharing behaviour, showing how they exhibit distinct
behaviorial patterns on different networks. We also examine cross-sharing
(i.e., the act of user broadcasting their activity to multiple OSNs
near-simultaneously), a previously-unstudied behaviour and demonstrate how
certain OSNs play the roles of originating source and destination sinks.
","[{'version': 'v1', 'created': 'Mon, 13 Jul 2015 16:20:43 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Jul 2015 16:59:12 GMT'}]",2016-11-15,"[['Lim', 'Bang Hui', ''], ['Lu', 'Dongyuan', ''], ['Chen', 'Tao', ''], ['Kan', 'Min-Yen', '']]","['Online Social Networks', 'cross-sharing', 'user behaviour']"
1738,0911.1508,Sana Ullah,"Ahasanun Nessa, Qinghai Yang, Sana Ullah, Humaun Kabir, and Kyung Sup
  Kwak","Performance Analysis of Two-Hop Cooperative MIMO transmission with Relay
  Selection in Rayleigh Fading Channel","5 figures, 4th International Conference on Wireless Communications,
  Networking and Mobile Computing, 2008. WiCOM '08",,10.1109/WiCom.2008.122,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless relaying is one of the promising solutions to overcome the channel
impairments and provide high data rate coverage that appears for beyond 3G
mobile communications. In this paper we present an end to end BER performance
analysis of dual hop wireless communication systems equipped with multiple
decode and forward relays over the Rayleigh fading channel with relay
selection. We select the best relay based on end to end channel conditions. We
apply orthogonal space time block coding (OSTBC) at source, and also present
how the multiple antennas at the source terminal affects the end to end BER
performance. This intermediate relay technique will cover long distance where
destination is out of reach from source.
","[{'version': 'v1', 'created': 'Sun, 8 Nov 2009 10:30:32 GMT'}]",2009-11-10,"[['Nessa', 'Ahasanun', ''], ['Yang', 'Qinghai', ''], ['Ullah', 'Sana', ''], ['Kabir', 'Humaun', ''], ['Kwak', 'Kyung Sup', '']]","['Bit error rate (BER)', 'amplify and forward (AF)', 'multiple input multiple output (MIMO)', 'decodeand-forward (DF)', 'probability density function (PDF)']"
1739,1603.08342,{\L}ukasz Olech Piotr,{\L}ukasz P. Olech and Mariusz Paradowski,"Hierarchical Gaussian Mixture Model with Objects Attached to Terminal
  and Non-terminal Dendrogram Nodes","This article was presented on CORES2015 conference
  http://cores.pwr.wroc.pl/ . The final publication is available at Springer
  via http://dx.doi.org/10.1007/978-3-319-26227-7_18","Proceedings of the CORES 2015 conf., pp. 191-201. Springer
  International Publishing, Cham (2016)",10.1007/978-3-319-26227-7_18,,cs.LG cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A hierarchical clustering algorithm based on Gaussian mixture model is
presented. The key difference to regular hierarchical mixture models is the
ability to store objects in both terminal and nonterminal nodes. Upper levels
of the hierarchy contain sparsely distributed objects, while lower levels
contain densely represented ones. As it was shown by experiments, this ability
helps in noise detection (modelling). Furthermore, compared to regular
hierarchical mixture model, the presented method generates more compact
dendrograms with higher quality measured by adopted F-measure.
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2016 08:54:03 GMT'}]",2016-03-29,"[['Olech', 'Łukasz P.', ''], ['Paradowski', 'Mariusz', '']]","['background model', 'outliers detection', 'noise modelling', 'hierarchical clustering', 'hierarchic Gaussian mixture model']"
1740,1506.03554,EPTCS,"Simon Busard (Universit\'e catholique de Louvain), Quentin Cappart
  (Universit\'e catholique de Louvain), Christophe Limbr\'ee (Universit\'e
  catholique de Louvain), Charles Pecheur (Universit\'e catholique de Louvain),
  Pierre Schaus (Universit\'e catholique de Louvain)",Verification of railway interlocking systems,"In Proceedings ESSS 2015, arXiv:1506.03250","EPTCS 184, 2015, pp. 19-31",10.4204/EPTCS.184.2,,cs.SE cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the railway domain, an interlocking is a computerised system that controls
the railway signalling objects in order to allow a safe operation of the train
traffic. Each interlocking makes use of particular data, called application
data, that reflects the track layout of the station under control. The
verification and validation of the application data are performed manually and
is thus error-prone and costly. In this paper, we explain how we built an
executable model in NuSMV of a railway interlocking based on the application
data. We also detail the tool that we have developed in order to translate the
application data into our model automatically. Finally we show how we could
verify a realistic set of safety properties on a real-size station model by
customizing the existing model-checking algorithm with PyNuSMV a Python library
based on NuSMV.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2015 06:10:41 GMT'}]",2015-06-12,"[['Busard', 'Simon', '', 'Université catholique de Louvain'], ['Cappart', 'Quentin', '', 'Université catholique de Louvain'], ['Limbrée', 'Christophe', '', 'Université\n  catholique de Louvain'], ['Pecheur', 'Charles', '', 'Université catholique de Louvain'], ['Schaus', 'Pierre', '', 'Université catholique de Louvain']]","['Railway interlocking', 'application data', 'automatic verification', 'model checking']"
1741,1408.5782,Guanghui Zhang,"Guanghui Zhang, Bocong Chen, Liangchen Li",A Construction of MDS Quantum Convolutional Codes,11 pages,,10.1007/s10773-015-2557-7,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, two new families of MDS quantum convolutional codes are
constructed. The first one can be regarded as a generalization of \cite[Theorem
6.5]{GGGlinear}, in the sense that we do not assume that $q\equiv1\pmod{4}$.
More specifically, we obtain two classes of MDS quantum convolutional codes
with parameters: {\rm (i)}~ $[(q^2+1, q^2-4i+3,1;2,2i+2)]_q$, where $q\geq5$ is
an odd prime power and $2\leq i\leq(q-1)/2$; {\rm (ii)}~
$[(\frac{q^2+1}{10},\frac{q^2+1}{10}-4i,1;2,2i+3)]_q$, where $q$ is an odd
prime power with the form
  $q=10m+3$ or $10m+7$ ($m\geq2$), and $2\leq i\leq2m-1$.
","[{'version': 'v1', 'created': 'Mon, 25 Aug 2014 14:55:15 GMT'}]",2015-06-22,"[['Zhang', 'Guanghui', ''], ['Chen', 'Bocong', ''], ['Li', 'Liangchen', '']]","['Quantum convolutional codes', 'convolutional codes', 'constacyclic codes']"
1742,1505.04527,Frederic Le Mouel,"Noha Ibrahim, Fr\'ed\'eric Le Mou\""el (CITI Insa Lyon / Inria Grenoble
  Rh\^one-Alpes), St\'ephane Fr\'enot (CITI Insa Lyon / Inria Grenoble
  Rh\^one-Alpes)",Semantic Service Substitution in Pervasive Environments,,"International Journal of Services, Economics and Management
  (IJSEM), Inderscience, 2014, 6 (4), pp.283-309",10.1504/IJSEM.2014.068244,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A computing infrastructure where everything is a service offers many new
system and application possibilities. Among the main challenges, however, is
the issue of service substitution for the application execution in such
heterogeneous environments. An application would like to continue to execute
even when a service disappears, or it would like to benefit from the
environment by using better services with better QoS when possible. In this
article, we define a generic service model and describe the equivalence
relations between services considering the functionalities they propose and
their non functional QoS properties. We define semantic equivalence relations
between services and equivalence degree between non functional QoS properties.
Using these relations we propose semantic substitution mechanisms upon the
appearance and disappearance of services that fits the application needs. We
developed a prototype as a proof of concept and evaluated its efficiency over a
real use case.
","[{'version': 'v1', 'created': 'Mon, 18 May 2015 06:32:29 GMT'}]",2015-05-19,"[['Ibrahim', 'Noha', '', 'CITI Insa Lyon / Inria Grenoble\n  Rhône-Alpes'], ['Mouël', 'Frédéric Le', '', 'CITI Insa Lyon / Inria Grenoble\n  Rhône-Alpes'], ['Frénot', 'Stéphane', '', 'CITI Insa Lyon / Inria Grenoble\n  Rhône-Alpes']]","['service-oriented architecture', 'service substitution', 'semantic matching', 'semantic distance', 'quality of service', 'z-score', 'equivalencerelations']"
1743,1609.01103,Kevis-Kokitsi Maninis,"Kevis-Kokitsi Maninis and Jordi Pont-Tuset and Pablo Arbel\'aez and
  Luc Van Gool",Deep Retinal Image Understanding,MICCAI 2016 Camera Ready,,10.1007/978-3-319-46723-8_17,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents Deep Retinal Image Understanding (DRIU), a unified
framework of retinal image analysis that provides both retinal vessel and optic
disc segmentation. We make use of deep Convolutional Neural Networks (CNNs),
which have proven revolutionary in other fields of computer vision such as
object detection and image classification, and we bring their power to the
study of eye fundus images. DRIU uses a base network architecture on which two
set of specialized layers are trained to solve both the retinal vessel and
optic disc segmentation. We present experimental validation, both qualitative
and quantitative, in four public datasets for these tasks. In all of them, DRIU
presents super-human performance, that is, it shows results more consistent
with a gold standard than a second human annotator used as control.
","[{'version': 'v1', 'created': 'Mon, 5 Sep 2016 11:20:30 GMT'}]",2016-11-17,"[['Maninis', 'Kevis-Kokitsi', ''], ['Pont-Tuset', 'Jordi', ''], ['Arbeláez', 'Pablo', ''], ['Van Gool', 'Luc', '']]","['Retinal vessel segmentation', 'optic disc segmentation', 'deep learning', 'convolutional neural networks', 'retinal image understanding']"
1744,2010.02080,"Olivier Fl\""uckiger","Olivier Fl\""uckiger and Andreas W\""alchli and Sebasti\'an Krynski and
  Jan Vitek",Sampling Optimized Code for Type Feedback,,"Proceedings of the 16th ACM SIGPLAN International Symposium on
  Dynamic Languages (DLS 2020)",10.1145/3426422.3426984,,cs.PL,http://creativecommons.org/licenses/by/4.0/,"  To efficiently execute dynamically typed languages, many language
implementations have adopted a two-tier architecture. The first tier aims for
low-latency startup times and collects dynamic profiles, such as the dynamic
types of variables. The second tier provides high-throughput using an
optimizing compiler that specializes code to the recorded type information. If
the program behavior changes to the point that not previously seen types occur
in specialized code, that specialized code becomes invalid, it is deoptimized,
and control is transferred back to the first tier execution engine which will
start specializing anew. However, if the program behavior becomes more
specific, for instance, if a polymorphic variable becomes monomorphic, nothing
changes. Once the program is running optimized code, there are no means to
notice that an opportunity for optimization has been missed.
  We propose to employ a sampling-based profiler to monitor native code without
any instrumentation. The absence of instrumentation means that when the
profiler is not active, no overhead is incurred. We present an implementation
is in the context of the \v{R} just-in-time, optimizing compiler for the R
language. Based on the sampled profiles, we are able to detect when the native
code produced by \v{R} is specialized for stale type feedback and recompile it
to more type-specific code. We show that sampling adds an overhead of less than
3% in most cases and up to 9% in few cases and that it reliably detects stale
type feedback within milliseconds.
","[{'version': 'v1', 'created': 'Mon, 5 Oct 2020 15:16:16 GMT'}]",2020-10-07,"[['Flückiger', 'Olivier', ''], ['Wälchli', 'Andreas', ''], ['Krynski', 'Sebastián', ''], ['Vitek', 'Jan', '']]","['sampling profiler', 'virtual machine', 'speculativeoptimizations']"
1745,1906.08595,Christian Otto,"Christian Otto, Matthias Springstein, Avishek Anand, Ralph Ewerth","Understanding, Categorizing and Predicting Semantic Image-Text Relations","8 pages, 8 Figures, 5 tables","In Proceedings of the 2019 on International Conference on
  Multimedia Retrieval (ICMR '19). ACM, New York, NY, USA, 168-176",10.1145/3323873.3325049,,cs.MM cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two modalities are often used to convey information in a complementary and
beneficial manner, e.g., in online news, videos, educational resources, or
scientific publications. The automatic understanding of semantic correlations
between text and associated images as well as their interplay has a great
potential for enhanced multimodal web search and recommender systems. However,
automatic understanding of multimodal information is still an unsolved research
problem. Recent approaches such as image captioning focus on precisely
describing visual content and translating it to text, but typically address
neither semantic interpretations nor the specific role or purpose of an
image-text constellation. In this paper, we go beyond previous work and
investigate, inspired by research in visual communication, useful semantic
image-text relations for multimodal information retrieval. We derive a
categorization of eight semantic image-text classes (e.g., ""illustration"" or
""anchorage"") and show how they can systematically be characterized by a set of
three metrics: cross-modal mutual information, semantic correlation, and the
status relation of image and text. Furthermore, we present a deep learning
system to predict these classes by utilizing multimodal embeddings. To obtain a
sufficiently large amount of training data, we have automatically collected and
augmented data from a variety of data sets and web resources, which enables
future research on this topic. Experimental results on a demanding test set
demonstrate the feasibility of the approach.
","[{'version': 'v1', 'created': 'Thu, 20 Jun 2019 13:20:22 GMT'}]",2019-06-21,"[['Otto', 'Christian', ''], ['Springstein', 'Matthias', ''], ['Anand', 'Avishek', ''], ['Ewerth', 'Ralph', '']]","['Image-text class', 'multimodality', 'data augmentation', 'semantic gap']"
1746,1901.04472,Andrea Arcuri,Andrea Arcuri,EvoMaster: Evolutionary Multi-context Automated System Test Generation,arXiv admin note: text overlap with arXiv:1901.01538,"2018 IEEE 11th International Conference on Software Testing,
  Verification and Validation (ICST)",10.1109/ICST.2018.00046,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents EvoMaster, an open-source tool that is able to
automatically generate system level test cases using evolutionary algorithms.
Currently, EvoMaster targets RESTful web services running on JVM technology,
and has been used to find several faults in existing open-source projects. We
discuss some of the architectural decisions made for its implementation, and
future work.
","[{'version': 'v1', 'created': 'Sat, 12 Jan 2019 14:10:13 GMT'}]",2019-01-16,"[['Arcuri', 'Andrea', '']]","['REST', 'SBSE', 'SBST', 'SOA', 'Microservice', 'WebService', 'Test Generation']"
1747,1907.12959,Christoph Matthies,"Christoph Matthies, Guenter Hesse","Towards Using Data to Inform Decisions in Agile Software Development:
  Views of Available Data",,"Proceedings of the 14th International Conference on Software
  Technologies - Volume 1: ICSOFT, 2019, ISBN 978-989-758-379-7, pages 552-559",10.5220/0007967905520559,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software development comprises complex tasks which are performed by humans.
It involves problem solving, domain understanding and communication skills as
well as knowledge of a broad variety of technologies, architectures, and
solution approaches. As such, software development projects include many
situations where crucial decisions must be made. Making the appropriate
organizational or technical choices for a given software team building a
product can make the difference between project success or failure. Software
development methods have introduced frameworks and sets of best practices for
certain contexts, providing practitioners with established guidelines for these
important choices. Current Agile methods employed in modern software
development have highlighted the importance of the human factors in software
development. These methods rely on short feedback loops and the
self-organization of teams to enable collaborative decision making. While Agile
methods stress the importance of empirical process control, i.e. relying on
data to make decisions, they do not prescribe in detail how this goal should be
achieved. In this paper, we describe the types and abstraction levels of data
and decisions within modern software development teams and identify the
benefits that usage of this data enables. We argue that the principles of
data-driven decision making are highly applicable, yet underused, in modern
Agile software development.
","[{'version': 'v1', 'created': 'Tue, 30 Jul 2019 14:06:45 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Oct 2019 12:09:50 GMT'}]",2019-10-22,"[['Matthies', 'Christoph', ''], ['Hesse', 'Guenter', '']]","['Software Engineering', 'Agile Software Development', 'Data-Driven Decision Making', 'Decision SupportSystems']"
1748,1306.3884,Martin Slota,Martin Slota and Jo\~ao Leite,The Rise and Fall of Semantic Rule Updates Based on SE-Models,"38 pages, to appear in Theory and Practice of Logic Programming
  (TPLP)",Theory and Practice of Logic Programming 14 (2014) 869-907,10.1017/S1471068413000100,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Logic programs under the stable model semantics, or answer-set programs,
provide an expressive rule-based knowledge representation framework, featuring
a formal, declarative and well-understood semantics. However, handling the
evolution of rule bases is still a largely open problem. The AGM framework for
belief change was shown to give inappropriate results when directly applied to
logic programs under a non-monotonic semantics such as the stable models. The
approaches to address this issue, developed so far, proposed update semantics
based on manipulating the syntactic structure of programs and rules.
  More recently, AGM revision has been successfully applied to a significantly
more expressive semantic characterisation of logic programs based on SE-models.
This is an important step, as it changes the focus from the evolution of a
syntactic representation of a rule base to the evolution of its semantic
content.
  In this paper, we borrow results from the area of belief update to tackle the
problem of updating (instead of revising) answer-set programs. We prove a
representation theorem which makes it possible to constructively define any
operator satisfying a set of postulates derived from Katsuno and Mendelzon's
postulates for belief update. We define a specific operator based on this
theorem, examine its computational complexity and compare the behaviour of this
operator with syntactic rule update semantics from the literature. Perhaps
surprisingly, we uncover a serious drawback of all rule update operators based
on Katsuno and Mendelzon's approach to update and on SE-models.
","[{'version': 'v1', 'created': 'Mon, 17 Jun 2013 15:02:11 GMT'}]",2020-02-19,"[['Slota', 'Martin', ''], ['Leite', 'João', '']]","['belief update', 'answer-set programs', 'rule update', 'SE-models', 'support', 'literal inertia']"
1749,1907.12175,Ramin Ramazi,"Ramin Ramazi, Christine Perndorfer, Emily Soriano, Jean-Philippe
  Laurenceau, Rahmatollah Beheshti",Multi-modal Predictive Models of Diabetes Progression,,,10.1145/3307339.3342177,,cs.LG eess.SP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the increasing availability of wearable devices, continuous monitoring
of individuals' physiological and behavioral patterns has become significantly
more accessible. Access to these continuous patterns about individuals'
statuses offers an unprecedented opportunity for studying complex diseases and
health conditions such as type 2 diabetes (T2D). T2D is a widely common chronic
disease that its roots and progression patterns are not fully understood.
Predicting the progression of T2D can inform timely and more effective
interventions to prevent or manage the disease. In this study, we have used a
dataset related to 63 patients with T2D that includes the data from two
different types of wearable devices worn by the patients: continuous glucose
monitoring (CGM) devices and activity trackers (ActiGraphs). Using this
dataset, we created a model for predicting the levels of four major biomarkers
related to T2D after a one-year period. We developed a wide and deep neural
network and used the data from the demographic information, lab tests, and
wearable sensors to create the model. The deep part of our method was developed
based on the long short-term memory (LSTM) structure to process the time-series
dataset collected by the wearables. In predicting the patterns of the four
biomarkers, we have obtained a root mean square error of 1.67% for HBA1c, 6.22
mg/dl for HDL cholesterol, 10.46 mg/dl for LDL cholesterol, and 18.38 mg/dl for
Triglyceride. Compared to existing models for studying T2D, our model offers a
more comprehensive tool for combining a large variety of factors that
contribute to the disease.
","[{'version': 'v1', 'created': 'Mon, 29 Jul 2019 02:19:05 GMT'}]",2019-07-30,"[['Ramazi', 'Ramin', ''], ['Perndorfer', 'Christine', ''], ['Soriano', 'Emily', ''], ['Laurenceau', 'Jean-Philippe', ''], ['Beheshti', 'Rahmatollah', '']]","['Type 2 diabetes', 'Continuous glucose monitoring', 'Activity trackers', 'Wearable medical devices', 'Recurrent neural networks']"
1750,1407.6034,Thomas Meyfroyt,"Thomas M.M. Meyfroyt, Sem C. Borst, Onno J. Boxma, Dee Denteneer",Data Dissemination Performance in Large-Scale Sensor Networks,,"ACM SIGMETRICS Performance Evaluation Review, Volume 42 Issue 1,
  June 2014, Pages 395-406",10.1145/2637364.2591981,,cs.NI math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As the use of wireless sensor networks increases, the need for
(energy-)efficient and reliable broadcasting algorithms grows. Ideally, a
broadcasting algorithm should have the ability to quickly disseminate data,
while keeping the number of transmissions low. In this paper we develop a model
describing the message count in large-scale wireless sensor networks. We focus
our attention on the popular Trickle algorithm, which has been proposed as a
suitable communication protocol for code maintenance and propagation in
wireless sensor networks. Besides providing a mathematical analysis of the
algorithm, we propose a generalized version of Trickle, with an additional
parameter defining the length of a listen-only period. This generalization
proves to be useful for optimizing the design and usage of the algorithm. For
single-cell networks we show how the message count increases with the size of
the network and how this depends on the Trickle parameters. Furthermore, we
derive distributions of inter-broadcasting times and investigate their
asymptotic behavior. Our results prove conjectures made in the literature
concerning the effect of a listen-only period. Additionally, we develop an
approximation for the expected number of transmissions in multi-cell networks.
All results are validated by simulations.
","[{'version': 'v1', 'created': 'Tue, 22 Jul 2014 20:43:10 GMT'}]",2014-07-24,"[['Meyfroyt', 'Thomas M. M.', ''], ['Borst', 'Sem C.', ''], ['Boxma', 'Onno J.', ''], ['Denteneer', 'Dee', '']]","['Analytical model', 'gossip protocol', 'message count', 'messageoverhead', 'Trickle algorithm', 'wireless sensor networks']"
1751,1701.06545,Yasutada Oohama,Yasutada Oohama,"Exponent Function for Stationary Memoryless Channels with Input Cost at
  Rates above the Capacity",15pages. arXiv admin note: text overlap with arXiv:1701.06357,,10.1587/transfun.E101.A.2199,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the stationaly memoryless channels with input cost. We prove that
for transmission rates above the capacity the correct probability of decoding
tends to zero exponentially as the block length $n$ of codes tends to infinity.
In the case where both of channel input and output sets are finite, we
determine the optimal exponent function on the above exponential decay of the
correct probability. To derive this result we use a new technique called the
recuresive method, which is based on the information spectrum approach. The
recursive method utilize a certain recursive structure on the information
spectrum quantities.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2017 18:30:01 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Jan 2017 12:13:29 GMT'}, {'version': 'v3', 'created': 'Sat, 4 Feb 2017 13:53:49 GMT'}]",2018-12-26,"[['Oohama', 'Yasutada', '']]","['Stationary memoryless channels', 'Strong conversetheorem', 'Information spectrum approach']"
1752,0905.0200,Paul M. Aoki,"Paul M. Aoki, R.J. Honicky, Alan Mainwaring, Chris Myers, Eric Paulos,
  Sushmita Subramanian, Allison Woodruff","A Vehicle for Research: Using Street Sweepers to Explore the Landscape
  of Environmental Community Action",10 pages,"Proc. ACM SIGCHI Conf. on Human Factors in Computing Systems,
  Boston, MA, Apr. 2009, 375-384. ACM Press",10.1145/1518701.1518762,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Researchers are developing mobile sensing platforms to facilitate public
awareness of environmental conditions. However, turning such awareness into
practical community action and political change requires more than just
collecting and presenting data. To inform research on mobile environmental
sensing, we conducted design fieldwork with government, private, and public
interest stakeholders. In parallel, we built an environmental air quality
sensing system and deployed it on street sweeping vehicles in a major U.S.
city; this served as a ""research vehicle"" by grounding our interviews and
affording us status as environmental action researchers. In this paper, we
present a qualitative analysis of the landscape of environmental action,
focusing on insights that will help researchers frame meaningful technological
interventions.
","[{'version': 'v1', 'created': 'Sat, 2 May 2009 11:42:50 GMT'}]",2016-09-05,"[['Aoki', 'Paul M.', ''], ['Honicky', 'R. J.', ''], ['Mainwaring', 'Alan', ''], ['Myers', 'Chris', ''], ['Paulos', 'Eric', ''], ['Subramanian', 'Sushmita', ''], ['Woodruff', 'Allison', '']]","['Air quality sensing', 'environmental science', 'environmental justice', 'mobile participatory sensing', 'street sweepers']"
1753,1811.11030,Lovro \v{S}ubelj,"Lovro \v{S}ubelj, Dalibor Fiala, Tadej Ciglari\v{c}, Luka Kronegger",Convexity in scientific collaboration networks,"44 pages, 17 figures, 5 tables","J. Infometr. 13(1), 10-31 (2019)",10.1016/j.joi.2018.11.005,,cs.SI cs.DL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convexity in a network (graph) has been recently defined as a property of
each of its subgraphs to include all shortest paths between the nodes of that
subgraph. It can be measured on the scale [0, 1] with 1 being assigned to fully
convex networks. The largest convex component of a graph that emerges after the
removal of the least number of edges is called a convex skeleton. It is
basically a tree of cliques, which has been shown to have many interesting
features. In this article the notions of convexity and convex skeletons in the
context of scientific collaboration networks are discussed. More specifically,
we analyze the co-authorship networks of Slovenian researchers in computer
science, physics, sociology, mathematics, and economics and extract convex
skeletons from them. We then compare these convex skeletons with the residual
graphs (remainders) in terms of collaboration frequency distributions by
various parameters such as the publication year and type, co-authors' birth
year, status, gender, discipline, etc. We also show the top-ranked scientists
by four basic centrality measures as calculated on the original networks and
their skeletons and conclude that convex skeletons may help detect influential
scholars that are hardly identifiable in the original collaboration network. As
their inherent feature, convex skeletons retain the properties of collaboration
networks. These include high-level structural properties but also the fact that
the same authors are highlighted by centrality measures. Moreover, the most
important ties and thus the most important collaborations are retained in the
skeletons.
","[{'version': 'v1', 'created': 'Tue, 27 Nov 2018 14:44:38 GMT'}]",2018-11-28,"[['Šubelj', 'Lovro', ''], ['Fiala', 'Dalibor', ''], ['Ciglarič', 'Tadej', ''], ['Kronegger', 'Luka', '']]","['convexity', 'co-authorship', 'convex skeletons', 'centrality', 'weak links']"
1754,1903.11751,Xiaoyan Lu,Xiaoyan Lu and Boleslaw K. Szymanski,"Regularized Stochastic Block Model for robust community detection in
  complex networks",,"Scientific Reports, vol. 9:13247, 13 Sept. 2019",10.1038/s41598-019-49580-5,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The stochastic block model is able to generate different network partitions,
ranging from traditional assortative communities to disassortative structures.
Since the degree-corrected stochastic block model does not specify which mixing
pattern is desired, the inference algorithms, which discover the most likely
partition of the networks nodes, are likely to get trapped in the local optima
of the log-likelihood. Here we introduce a new model constraining nodes'
internal degrees ratios in the objective function to stabilize the inference of
block models from the observed network data. Given the regularized model, the
inference algorithms, such as Markov chain Monte Carlo, reliably finds
assortative or disassortive structure as directed by the value of a single
parameter. We show experimentally that the inference of our proposed model
quickly converges to the desired assortative or disassortative partition while
the inference of degree-corrected stochastic block model gets often trapped at
the inferior local optimal partitions when the traditional assortative
community structure is not strong in the observed networks.
","[{'version': 'v1', 'created': 'Thu, 28 Mar 2019 01:31:02 GMT'}]",2019-09-16,"[['Lu', 'Xiaoyan', ''], ['Szymanski', 'Boleslaw K.', '']]","['community detection', 'stochastic block model', 'Markov chain Monte Carlo', 'modularity', 'assortative structures']"
1755,1405.5905,Bernardo Gon\c{c}alves,Bernardo Gon\c{c}alves and Fabio Porto,"Managing large-scale scientific hypotheses as uncertain and
  probabilistic data with support for predictive analytics","16 pages, 9 figures, 1 table","IEEE Computing in Science and Eng. 17(5):35-43, 2015",10.1109/MCSE.2015.102,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The sheer scale of high-resolution raw data generated by simulation has
motivated non-conventional approaches for data exploration referred as
`immersive' and `in situ' query processing of the raw simulation data. Another
step towards supporting scientific progress is to enable data-driven hypothesis
management and predictive analytics out of simulation results. We present a
synthesis method and tool for encoding and managing competing hypotheses as
uncertain data in a probabilistic database that can be conditioned in the
presence of observations.
","[{'version': 'v1', 'created': 'Thu, 22 May 2014 20:43:51 GMT'}, {'version': 'v2', 'created': 'Sun, 17 May 2015 23:01:31 GMT'}]",2015-08-25,"[['Gonçalves', 'Bernardo', ''], ['Porto', 'Fabio', '']]","['hypothesis management', 'predictive analytics', 'synthesis of probabilistic']"
1756,1606.07138,Gustavo Romanillos,"Javier Gutierrez, Juan Carlos Garcia-Palomares, Gustavo Romanillos and
  Maria Henar Salas-Olmedo","Airbnb in tourist cities: comparing spatial patterns of hotels and
  peer-to-peer accommodation","17 pages, 11 figures, 11 tables","Tourism Management 62:278-291, May 2017",10.1016/j.tourman.2017.05.003,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, what has become known as collaborative consumption has
undergone rapid expansion through peer-to-peer (P2P) platforms. In the field of
tourism, a particularly notable example is that of Airbnb. This article
analyses the spatial patterns of Airbnb in Barcelona and compares them with
hotels and sightseeing spots. New sources of data, such as Airbnb listings and
geolocated photographs are used. Analysis of bivariate spatial autocorrelation
reveals a close spatial relationship between Airbnb and hotels, with a marked
centre-periphery pattern, although Airbnb predominates around the main hotel
axis and hotels predominate in some peripheral areas of the city. Another
interesting finding is that Airbnb capitalises more on the advantages of
proximity to the main tourist attractions of the city than does the hotel
sector. Finally, it was possible to detect those parts of the city that have
seen the greatest increase in pressure from tourism related to Airbnb's recent
expansion.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2016 23:41:22 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Jul 2016 14:41:53 GMT'}, {'version': 'v3', 'created': 'Thu, 13 Oct 2016 11:14:14 GMT'}]",2017-05-24,"[['Gutierrez', 'Javier', ''], ['Garcia-Palomares', 'Juan Carlos', ''], ['Romanillos', 'Gustavo', ''], ['Salas-Olmedo', 'Maria Henar', '']]","['Collaborative\t consumption', 'P2P\t platforms', 'Airbnb', 'mass\t tourism', 'spatial\t analysis', 'Barcelona', 'sharing\teconomy']"
1757,1803.00296,Jeremy Frey,"Jelena Mladenovic (IDC, Potioc), J\'er\'emy Frey (IDC), Jessica
  Cauchard (IDC)",Di\v{s}imo: Anchoring Our Breath,,"CHI '18 Interactivity - SIGCHI Conference on Human Factors in
  Computing System, Apr 2018, Montreal, Canada",10.1145/3170427.3186517,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a system that raises awareness about users' inner state.
Di\v{s}imo is a multimodal ambient display that provides feedback about one's
stress level, which is assessed through heart rate monitoring. Upon detecting a
low heart rate variability for a prolonged period of time, Di\v{s}imo plays an
audio track, setting the pace of a regular and deep breathing. Users can then
choose to take a moment to focus on their breath. By doing so, they will
activate the Di\v{s}imo devices belonging to their close ones, who can then
join for a shared relaxation session.
","[{'version': 'v1', 'created': 'Thu, 1 Mar 2018 10:45:12 GMT'}]",2018-06-24,"[['Mladenovic', 'Jelena', '', 'IDC, Potioc'], ['Frey', 'Jérémy', '', 'IDC'], ['Cauchard', 'Jessica', '', 'IDC']]","['Biofeedback', 'Ambient display', 'Cardiac coherence']"
1758,1810.10308,Pavlos Fafalios,"Pavlos Fafalios, Vasileios Iosifidis, Eirini Ntoutsi, Stefan Dietze",TweetsKB: A Public and Large-Scale RDF Corpus of Annotated Tweets,,,10.1007/978-3-319-93417-4_12,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Publicly available social media archives facilitate research in a variety of
fields, such as data science, sociology or the digital humanities, where
Twitter has emerged as one of the most prominent sources. However, obtaining,
archiving and annotating large amounts of tweets is costly. In this paper, we
describe TweetsKB, a publicly available corpus of currently more than 1.5
billion tweets, spanning almost 5 years (Jan'13-Nov'17). Metadata information
about the tweets as well as extracted entities, hashtags, user mentions and
sentiment information are exposed using established RDF/S vocabularies. Next to
a description of the extraction and annotation process, we present use cases to
illustrate scenarios for entity-centric information exploration, data
integration and knowledge discovery facilitated by TweetsKB.
","[{'version': 'v1', 'created': 'Tue, 23 Oct 2018 11:54:23 GMT'}]",2021-07-30,"[['Fafalios', 'Pavlos', ''], ['Iosifidis', 'Vasileios', ''], ['Ntoutsi', 'Eirini', ''], ['Dietze', 'Stefan', '']]","['Twitter', 'RDF', 'Entity Linking', 'Sentiment Analysis', 'SocialMedia Archives']"
1759,1812.07851,Giovanni Abramo,"Giovanni Abramo, Ciriaco Andrea D'Angelo, Alessandro Caprasecca","Gender differences in research productivity: a bibliometric analysis of
  the Italian academic system",,"Abramo, G., D'Angelo, C.A., Caprasecca, A. (2009). Gender
  differences in research productivity: a bibliometric analysis of the Italian
  academic system. Scientometrics, 79(3), 517-539",10.1007/s11192-007-2046-8,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The literature dedicated to analysis of the difference in research
productivity between the sexes tends to agree in indicating better performance
for men. This study enters in the vein of work on the subject. Through
bibliometric examination of the entire population of research personnel working
in the scientific-technological disciplines of Italian university system, it
confirms the presence of significant differences in productivity between men
and women. But such differences result as being smaller than reported in a
large part of the literature, confirming an ongoing tendency towards decline,
and are also seen as more noticeable for quantitative performance indicators
than other indicators. The gap between the sexes presents important sectorial
specificities. In spite of the generally better performance of men, it can not
be ignored that there are a significant number of scientific sectors in which
the performance of women does not result as inferior.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2018 10:01:12 GMT'}]",2018-12-20,"[['Abramo', 'Giovanni', ''], [""D'Angelo"", 'Ciriaco Andrea', ''], ['Caprasecca', 'Alessandro', '']]","['Research productivity', 'gender differences', 'university', 'bibliometrics']"
1760,1911.08871,Jayasree Saha,Jayasree Saha and Jayanta Mukherjee,CNAK : Cluster Number Assisted K-means,,Pattern Recognition (Elsevier) 2020,10.1016/j.patcog.2020.107625,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Determining the number of clusters present in a dataset is an important
problem in cluster analysis. Conventional clustering techniques generally
assume this parameter to be provided up front. %user supplied. %Recently,
robustness of any given clustering algorithm is analyzed to measure cluster
stability/instability which in turn determines the cluster number. In this
paper, we propose a method which analyzes cluster stability for predicting the
cluster number. Under the same computational framework, the technique also
finds representatives of the clusters. The method is apt for handling big data,
as we design the algorithm using \emph{Monte-Carlo} simulation. Also, we
explore a few pertinent issues found to be of also clustering. Experiments
reveal that the proposed method is capable of identifying a single cluster. It
is robust in handling high dimensional dataset and performs reasonably well
over datasets having cluster imbalance. Moreover, it can indicate cluster
hierarchy, if present. Overall we have observed significant improvement in
speed and quality for predicting cluster numbers as well as the composition of
clusters in a large dataset.
","[{'version': 'v1', 'created': 'Wed, 20 Nov 2019 13:03:24 GMT'}]",2020-09-01,"[['Saha', 'Jayasree', ''], ['Mukherjee', 'Jayanta', '']]","['k-means clustering', 'Bipartite graph', 'Perfect Matching', 'Kuhn-Munkres Algorithm', 'Monte Carlo simulation']"
1761,cs/0703107,Arnaud Legout,"Arnaud Legout (INRIA Sophia Antipolis / INRIA Rh\^one-Alpes), Nikitas
  Liogkas (UCLA), Eddie Kohler (UCLA), Lixia Zhang (UCLA)",Clustering and Sharing Incentives in BitTorrent Systems,"This article is the author version of a paper accepted at ACM
  SIGMETRICS'2007. In particular, this paper is different from the technical
  report inria-00112066, version 1 - 21 November 2006. The technical report
  inria-00112066, version 1 - 21 November 2006 is a extended version of this
  paper (same title and authors, but different content) Version 2 is the same
  content as version 1, but with a different class in order to match the camera
  ready format for SIGMETRICS",Dans ACM SIGMETRICS'2007 (2007),,,cs.NI,,"  Peer-to-peer protocols play an increasingly instrumental role in Internet
content distribution. It is therefore important to gain a complete
understanding of how these protocols behave in practice and how their operating
parameters affect overall system performance. This paper presents the first
detailed experimental investigation of the peer selection strategy in the
popular BitTorrent protocol. By observing more than 40 nodes in instrumented
private torrents, we validate three protocol properties that, though believed
to hold, have not been previously demonstrated experimentally: the clustering
of similar-bandwidth peers, the effectiveness of BitTorrent's sharing
incentives, and the peers' high uplink utilization. In addition, we observe
that BitTorrent's modified choking algorithm in seed state provides uniform
service to all peers, and that an underprovisioned initial seed leads to
absence of peer clustering and less effective sharing incentives. Based on our
results, we provide guidelines for seed provisioning by content providers, and
discuss a tracker protocol extension that addresses an identified limitation of
the protocol.
","[{'version': 'v1', 'created': 'Thu, 22 Mar 2007 08:16:02 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Mar 2007 06:27:16 GMT'}]",2016-08-14,"[['Legout', 'Arnaud', '', 'INRIA Sophia Antipolis / INRIA Rhône-Alpes'], ['Liogkas', 'Nikitas', '', 'UCLA'], ['Kohler', 'Eddie', '', 'UCLA'], ['Zhang', 'Lixia', '', 'UCLA']]","['BitTorrent', 'choking algorithm', 'clustering', 'incentives', 'seed provisioning']"
1762,1109.0324,Yessad Lamia,Lamia Yessad and Zizette Boufaida,A qos ontology-based component selection,"15 pages, 5 figures, 6 tables","International Journal on Soft Computing ( IJSC ), Vol.2, No.3,
  August 2011",10.5121/ijsc.2011.2302,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the component-based software development, the selection step is very
important. It consists of searching and selecting appropriate software
components from a set of candidate components in order to satisfy the
developer-specific requirements. In the selection process, both functional and
non-functional requirements are generally considered. In this paper, we focus
only on the QoS, a subset of non-functional characteristics, in order to
determine the best components for selection. The component selection based on
the QoS is a hard task due to the QoS descriptions heterogeneity. Thus, we
propose a QoS ontology which provides a formal, a common and an explicit
description of the software components QoS. We use this ontology in order to
semantically select relevant components based on the QoS specified by the
developer. Our selection process is performed in two steps: (1) a QoS matching
process that uses the relations between QoS concepts to pre-select candidate
components. Each candidate component is matched against the developer's request
and (2) a component ranking process that uses the QoS values to determine the
best components for selection from the pre-selected components. The algorithms
of QoS matching and component ranking are then presented and experimented in
the domain of multimedia components.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2011 23:04:32 GMT'}]",2011-09-05,"[['Yessad', 'Lamia', ''], ['Boufaida', 'Zizette', '']]","['QoS ontology', 'semantic component selection', 'QoS matching', 'component ranking']"
1763,1601.07790,Dariusz Dereniowski,"Dariusz Dereniowski, Andrzej Pelc",Topology Recognition and Leader Election in Colored Networks,,Theoretical Computer Science 621 (2016) 92-102,10.1016/j.tcs.2016.01.037,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Topology recognition and leader election are fundamental tasks in distributed
computing in networks. The first of them requires each node to find a labeled
isomorphic copy of the network, while the result of the second one consists in
a single node adopting the label 1 (leader), with all other nodes adopting the
label 0 and learning a path to the leader. We consider both these problems in
networks whose nodes are equipped with not necessarily distinct labels called
colors, and ports at each node of degree $d$ are arbitrarily numbered
$0,1,\dots, d-1$. Colored networks are generalizations both of labeled networks
and anonymous networks.
  In colored networks, topology recognition and leader election are not always
feasible. Hence we study two more general problems. The aim of the problem TOP
(resp. LE), for a colored network and for input $I$ given to its nodes, is to
solve topology recognition (resp. leader election) in this network, if this is
possible under input $I$, and to have all nodes answer ""unsolvable"" otherwise.
  We show that nodes of a network can solve problems TOP and LE, if they are
given, as input $I$, an upper bound $k$ on the number of nodes of a given
color, called the size of this color. On the other hand we show that, if the
nodes are given an input that does not bound the size of any color, then the
answer to TOP and LE must be ""unsolvable"", even for the class of rings.
  Under the assumption that nodes are given an upper bound $k$ on the size of a
given color, we study the time of solving problems TOP and LE in the $LOCAL$.
We give an algorithm to solve each of these problems in arbitrary $n$-node
networks of diameter $D$ in time $O(kD+D\log(n/D))$. We also show that this
time is optimal, by exhibiting classes of networks in which every algorithm
solving problems TOP or LE must use time $\Omega(kD+D\log(n/D))$.
","[{'version': 'v1', 'created': 'Thu, 28 Jan 2016 15:00:26 GMT'}]",2021-03-05,"[['Dereniowski', 'Dariusz', ''], ['Pelc', 'Andrzej', '']]","['topology recognition', 'leader election', 'colored network', 'local model']"
1764,1711.00317,Philipp Fortenbacher,"Philipp Fortenbacher, Turhan Demiray","Linear/Quadratic Programming-Based Optimal Power Flow using Linear Power
  Flow and Absolute Loss Approximations",,,10.1016/j.ijepes.2018.12.008,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents novel methods to approximate the nonlinear AC optimal
power flow (OPF) into tractable linear/quadratic programming (LP/QP) based OPF
problems that can be used for power system planning and operation. We derive a
linear power flow approximation and consider a convex reformulation of the
power losses in the form of absolute value functions. We show four ways how to
incorporate this approximation into LP/QP based OPF problems. In a
comprehensive case study the usefulness of our OPF methods is analyzed and
compared with an existing OPF relaxation and approximation method. As a result,
the errors on voltage magnitudes and angles are reasonable, while obtaining
near-optimal results for typical scenarios. We find that our methods reduce
significantly the computational complexity compared to the nonlinear AC-OPF
making them a good choice for planning purposes.
","[{'version': 'v1', 'created': 'Wed, 1 Nov 2017 12:47:48 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Dec 2017 15:02:10 GMT'}, {'version': 'v3', 'created': 'Thu, 16 Aug 2018 15:04:30 GMT'}]",2019-03-19,"[['Fortenbacher', 'Philipp', ''], ['Demiray', 'Turhan', '']]","['Optimal Power Flow', 'Linear/Quadratic Programming', 'Power FlowApproximation']"
1765,1803.07328,Pol Henarejos,"Raul Mu\~noz, Josep Mangues-Bafalluy, Nikolaos Bartzoudis, Ricard
  Vilalta, Ricardo Mart\'inez, Ramon Casellas, Nicola Baldo, Jos\'e
  N\'u\~nez-Mart\'inez, Manuel Requena-Esteso, Oriol Font-Bach, Marco Miozzo,
  Pol Henarejos, Ana P\'erez-Neira, Miquel Payar\'o","End-to-end 5G services via an SDN/NFV-based multi-tenant network and
  cloud testbed",,,10.5281/zenodo.398834,,cs.NI cs.IT math.IT,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  5G has a main requirement of highly flexible, ultralow latency and ultra-high
bandwidth virtualized infrastructure in order to deliver end-to-end services.
This requirement can be met by efficiently integrating all network segments
(radio access, aggregation and core) with heterogeneous wireless and optical
technologies (5G, mmWave, LTE/LTE-A, Wi-Fi, Ethernet, MPLS, WDM,
software-defined optical transmission, etc.), and massive computing and storage
cloud services (offered in edge/core data centers). This paper introduces the
preliminary architecture aiming at integrating three consolidated and
standalone experimental infrastructures at CTTC, in order to deploy the
required end-to-end top-to-bottom converged infrastructure pointed out above
for testing and developing advanced 5G services.
","[{'version': 'v1', 'created': 'Tue, 20 Mar 2018 09:41:09 GMT'}]",2018-03-22,"[['Muñoz', 'Raul', ''], ['Mangues-Bafalluy', 'Josep', ''], ['Bartzoudis', 'Nikolaos', ''], ['Vilalta', 'Ricard', ''], ['Martínez', 'Ricardo', ''], ['Casellas', 'Ramon', ''], ['Baldo', 'Nicola', ''], ['Núñez-Martínez', 'José', ''], ['Requena-Esteso', 'Manuel', ''], ['Font-Bach', 'Oriol', ''], ['Miozzo', 'Marco', ''], ['Henarejos', 'Pol', ''], ['Pérez-Neira', 'Ana', ''], ['Payaró', 'Miquel', '']]","['5G testbeds', 'Software Defined Networks', 'Network']"
1766,2104.12121,Ali Parsai,Ali Parsai and Serge Demeyer,Mutant Density: A Measure of Fault-Sensitive Complexity,,"In Proceedings of the IEEE/ACM 42nd International Conference on
  Software Engineering Workshops (ICSEW 2020). Association for Computing
  Machinery, New York, NY, USA, 742--745. (2020)",10.1145/3387940.3392210,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software code complexity is a well-studied property to determine software
component health. However, the existing code complexity metrics do not directly
take into account the fault-proneness aspect of the code. We propose a metric
called mutant density where we use mutation as a method to introduce artificial
faults in code, and count the number of possible mutations per line. We show
how this metric can be used to perform helpful analysis of real-life software
projects.
","[{'version': 'v1', 'created': 'Sun, 25 Apr 2021 10:03:06 GMT'}]",2021-04-27,"[['Parsai', 'Ali', ''], ['Demeyer', 'Serge', '']]","['mutant density', 'software health', 'complexity metrics', 'fault-proneness']"
1767,1508.03843,Marko A. Rodriguez,Marko A. Rodriguez,The Gremlin Graph Traversal Machine and Language,"To appear in the Proceedings of the 2015 ACM Database Programming
  Languages Conference","ACM Proceedings of the 15th Symposium on Database Programming
  Languages, pages 1-10, 2015",10.1145/2815072.2815073,,cs.DB cs.DM,http://creativecommons.org/publicdomain/zero/1.0/,"  Gremlin is a graph traversal machine and language designed, developed, and
distributed by the Apache TinkerPop project. Gremlin, as a graph traversal
machine, is composed of three interacting components: a graph $G$, a traversal
$\Psi$, and a set of traversers $T$. The traversers move about the graph
according to the instructions specified in the traversal, where the result of
the computation is the ultimate locations of all halted traversers. A Gremlin
machine can be executed over any supporting graph computing system such as an
OLTP graph database and/or an OLAP graph processor. Gremlin, as a graph
traversal language, is a functional language implemented in the user's native
programming language and is used to define the $\Psi$ of a Gremlin machine.
This article provides a mathematical description of Gremlin and details its
automaton and functional properties. These properties enable Gremlin to
naturally support imperative and declarative querying, host language
agnosticism, user-defined domain specific languages, an extensible
compiler/optimizer, single- and multi-machine execution models, hybrid depth-
and breadth-first evaluation, as well as the existence of a Universal Gremlin
Machine and its respective entailments.
","[{'version': 'v1', 'created': 'Sun, 16 Aug 2015 16:30:27 GMT'}]",2017-05-26,"[['Rodriguez', 'Marko A.', '']]","['graph traversal', 'finite automata', 'functional languages', 'virtual machines']"
1768,1203.6845,Juli\'an Urbano,"M\'onica Marrero, Sonia S\'anchez-Cuadrado, Juli\'an Urbano, Jorge
  Morato, Jos\'e-Antonio Moreiro",Information Retrieval Systems Adapted to the Biomedical Domain,"6 pages, 4 tables","El Profesional de la Informaci\'on (2010), 19-3",10.3145/epi.2010.may.04,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The terminology used in Biomedicine shows lexical peculiarities that have
required the elaboration of terminological resources and information retrieval
systems with specific functionalities. The main characteristics are the high
rates of synonymy and homonymy, due to phenomena such as the proliferation of
polysemic acronyms and their interaction with common language. Information
retrieval systems in the biomedical domain use techniques oriented to the
treatment of these lexical peculiarities. In this paper we review some of the
techniques used in this domain, such as the application of Natural Language
Processing (BioNLP), the incorporation of lexical-semantic resources, and the
application of Named Entity Recognition (BioNER). Finally, we present the
evaluation methods adopted to assess the suitability of these techniques for
retrieving biomedical resources.
","[{'version': 'v1', 'created': 'Fri, 30 Mar 2012 16:16:43 GMT'}]",2012-04-02,"[['Marrero', 'Mónica', ''], ['Sánchez-Cuadrado', 'Sonia', ''], ['Urbano', 'Julián', ''], ['Morato', 'Jorge', ''], ['Moreiro', 'José-Antonio', '']]","['Biomedicine', 'BioNER', 'BioNLP', 'Text-mining', 'Information retrieval']"
1769,1406.7371,Paresh Tanna,"Paresh Tanna, Yogesh Ghodasara",Using Apriori with WEKA for Frequent Pattern Mining,"5 Pages, 4 Figures, ""Published with International Journal of
  Engineering Trends and Technology (IJETT)""","International Journal of Engineering Trends and Technology
  (IJETT), V12(3), 127-131, June 2014",10.14445/22315381/IJETT-V12P223,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge exploration from the large set of data,generated as a result of the
various data processing activities due to data mining only. Frequent Pattern
Mining is a very important undertaking in data mining. Apriori approach applied
to generate frequent item set generally espouse candidate generation and
pruning techniques for the satisfaction of the desired objective. This paper
shows how the different approaches achieve the objective of frequent mining
along with the complexities required to perform the job. This paper
demonstrates the use of WEKA tool for association rule mining using Apriori
algorithm.
","[{'version': 'v1', 'created': 'Sat, 28 Jun 2014 08:18:57 GMT'}]",2014-07-01,"[['Tanna', 'Paresh', ''], ['Ghodasara', 'Yogesh', '']]","['Data Mining', 'Apriori', 'Frequent Pattern Mining', 'WEKA']"
1770,1311.4151,Hichem Benfriha BH,"Hichem Benfriha, Fatiha Barigou, Baghdad Atmani",Lattice-cell : Hybrid approach for text categorization,Computer Science & Information Technology (CS & IT) 2013,,10.5121/csit.2013.3817,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a new text categorization framework based on
Concepts Lattice and cellular automata. In this framework, concept structure
are modeled by a Cellular Automaton for Symbolic Induction (CASI). Our
objective is to reduce time categorization caused by the Concept Lattice. We
examine, by experiments the performance of the proposed approach and compare it
with other algorithms such as Naive Bayes and k nearest neighbors. The results
show performance improvement while reducing time categorization.
","[{'version': 'v1', 'created': 'Sun, 17 Nov 2013 12:02:12 GMT'}]",2013-11-19,"[['Benfriha', 'Hichem', ''], ['Barigou', 'Fatiha', ''], ['Atmani', 'Baghdad', '']]","['Text Categorization', 'Concepts Lattice', 'Boolean Inference Engine', 'Cellular Automaton', 'CASI']"
1771,1807.11248,Gerard Par\'is,"Pedro Garc\'ia L\'opez, Marc S\'anchez-Artigas, Gerard Par\'is, Daniel
  Barcelona Pons, \'Alvaro Ruiz Ollobarren, David Arroyo Pinto",Comparison of FaaS Orchestration Systems,"6 pages, 2 figures, title changed, 4th International Workshop on
  Serverless Computing (UCC Companion 2018)",,10.1109/UCC-Companion.2018.00049,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since the appearance of Amazon Lambda in 2014, all major cloud providers have
embraced the Function as a Service (FaaS) model, because of its enormous
potential for a wide variety of applications. As expected (and also desired),
the competition is fierce in the serverless world, and includes aspects such as
the run-time support for the orchestration of serverless functions. In this
regard, the three major production services are currently Amazon Step Functions
(December 2016), Azure Durable Functions (June 2017), and IBM Composer (October
2017), still young and experimental projects with a long way ahead. In this
article, we will compare and analyze these three serverless orchestration
systems under a common evaluation framework. We will study their architectures,
programming and billing models, and their effective support for parallel
execution, among others. Through a series of experiments, we will also evaluate
the run-time overhead of the different infrastructures for different types of
workflows.
","[{'version': 'v1', 'created': 'Mon, 30 Jul 2018 09:23:09 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Jan 2019 09:27:57 GMT'}]",2019-01-28,"[['López', 'Pedro García', ''], ['Sánchez-Artigas', 'Marc', ''], ['París', 'Gerard', ''], ['Pons', 'Daniel Barcelona', ''], ['Ollobarren', 'Álvaro Ruiz', ''], ['Pinto', 'David Arroyo', '']]","['Cloud computing', 'Serverless', 'Function Composition', 'Orchestration', 'Amazon Step Functions', 'Azure Durable Functions', 'IBM Composer']"
1772,1810.00090,Emanuel Onica,"Ciprian Amariei, Paul Diac, Emanuel Onica, Valentin Ro\c{s}ca",Cell Grid Architecture for Maritime Route Prediction on AIS Data Streams,,"DEBS 2018, Proceedings of the 12th ACM International Conference on
  Distributed and Event-based Systems, Pages 202-204",10.1145/3210284.3220503,,cs.AI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The 2018 Grand Challenge targets the problem of accurate predictions on data
streams produced by automatic identification system (AIS) equipment, describing
naval traffic. This paper reports the technical details of a custom solution,
which exposes multiple tuning parameters, making its configurability one of the
main strengths. Our solution employs a cell grid architecture essentially based
on a sequence of hash tables, specifically built for the targeted use case.
This makes it particularly effective in prediction on AIS data, obtaining a
high accuracy and scalable performance results. Moreover, the architecture
proposed accommodates also an optionally semi-supervised learning process
besides the basic supervised mode.
","[{'version': 'v1', 'created': 'Fri, 28 Sep 2018 21:42:17 GMT'}]",2018-10-02,"[['Amariei', 'Ciprian', ''], ['Diac', 'Paul', ''], ['Onica', 'Emanuel', ''], ['Roşca', 'Valentin', '']]","['data stream processing', 'machine learning', 'event based systems']"
1773,1308.0683,Scott A. Hale,"Mark Graham, Scott A. Hale, and Devin Gaffney","Where in the World are You? Geolocation and Language Identification in
  Twitter",,,10.1080/00330124.2014.907699,,cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The movements of ideas and content between locations and languages are
unquestionably crucial concerns to researchers of the information age, and
Twitter has emerged as a central, global platform on which hundreds of millions
of people share knowledge and information. A variety of research has attempted
to harvest locational and linguistic metadata from tweets in order to
understand important questions related to the 300 million tweets that flow
through the platform each day. However, much of this work is carried out with
only limited understandings of how best to work with the spatial and linguistic
contexts in which the information was produced. Furthermore, standard,
well-accepted practices have yet to emerge. As such, this paper studies the
reliability of key methods used to determine language and location of content
in Twitter. It compares three automated language identification packages to
Twitter's user interface language setting and to a human coding of languages in
order to identify common sources of disagreement. The paper also demonstrates
that in many cases user-entered profile locations differ from the physical
locations users are actually tweeting from. As such, these open-ended,
user-generated, profile locations cannot be used as useful proxies for the
physical locations from which information is published to Twitter.
","[{'version': 'v1', 'created': 'Sat, 3 Aug 2013 11:06:58 GMT'}]",2014-08-19,"[['Graham', 'Mark', ''], ['Hale', 'Scott A.', ''], ['Gaffney', 'Devin', '']]","['Geography', 'Language', 'Twitter']"
1774,1804.05259,Ahmed Qureshi,"Ahmed Hussain Qureshi, Yutaka Nakamura, Yuichiro Yoshikawa and Hiroshi
  Ishiguro","Intrinsically motivated reinforcement learning for human-robot
  interaction in the real-world",34 pages,,10.1016/j.neunet.2018.03.014,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For a natural social human-robot interaction, it is essential for a robot to
learn the human-like social skills. However, learning such skills is
notoriously hard due to the limited availability of direct instructions from
people to teach a robot. In this paper, we propose an intrinsically motivated
reinforcement learning framework in which an agent gets the intrinsic
motivation-based rewards through the action-conditional predictive model. By
using the proposed method, the robot learned the social skills from the
human-robot interaction experiences gathered in the real uncontrolled
environments. The results indicate that the robot not only acquired human-like
social skills but also took more human-like decisions, on a test dataset, than
a robot which received direct rewards for the task achievement.
","[{'version': 'v1', 'created': 'Sat, 14 Apr 2018 18:22:29 GMT'}]",2018-04-17,"[['Qureshi', 'Ahmed Hussain', ''], ['Nakamura', 'Yutaka', ''], ['Yoshikawa', 'Yuichiro', ''], ['Ishiguro', 'Hiroshi', '']]","['Intrinsic motivation', 'Deep reinforcement learning', 'Human-robot']"
1775,2102.11617,Taras Kucherenko,"Taras Kucherenko, Patrik Jonell, Youngwoo Yoon, Pieter Wolfert, and
  Gustav Eje Henter","A large, crowdsourced evaluation of gesture generation systems on common
  data: The GENEA Challenge 2020","Accepted for publication at the 26th International Conference on
  Intelligent User Interfaces (IUI'21). 11 pages, 5 figures",,10.1145/3397481.3450692,,cs.HC cs.GR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Co-speech gestures, gestures that accompany speech, play an important role in
human communication. Automatic co-speech gesture generation is thus a key
enabling technology for embodied conversational agents (ECAs), since humans
expect ECAs to be capable of multi-modal communication. Research into gesture
generation is rapidly gravitating towards data-driven methods. Unfortunately,
individual research efforts in the field are difficult to compare: there are no
established benchmarks, and each study tends to use its own dataset, motion
visualisation, and evaluation methodology. To address this situation, we
launched the GENEA Challenge, a gesture-generation challenge wherein
participating teams built automatic gesture-generation systems on a common
dataset, and the resulting systems were evaluated in parallel in a large,
crowdsourced user study using the same motion-rendering pipeline. Since
differences in evaluation outcomes between systems now are solely attributable
to differences between the motion-generation methods, this enables benchmarking
recent approaches against one another in order to get a better impression of
the state of the art in the field. This paper reports on the purpose, design,
results, and implications of our challenge.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2021 10:54:58 GMT'}]",2021-02-24,"[['Kucherenko', 'Taras', ''], ['Jonell', 'Patrik', ''], ['Yoon', 'Youngwoo', ''], ['Wolfert', 'Pieter', ''], ['Henter', 'Gustav Eje', '']]","['gesture generation', 'conversational agents', 'evaluation paradigms']"
1776,1903.01743,Zheng Li,"Zheng Li, Chengyu Hu, Yang Zhang, Shanqing Guo","How to Prove Your Model Belongs to You: A Blind-Watermark based
  Framework to Protect Intellectual Property of DNN",To be published in ACSAC'19,,10.1145/3359789.3359801,,cs.CR cs.LG cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning techniques have made tremendous progress in a variety of
challenging tasks, such as image recognition and machine translation, during
the past decade. Training deep neural networks is computationally expensive and
requires both human and intellectual resources. Therefore, it is necessary to
protect the intellectual property of the model and externally verify the
ownership of the model. However, previous studies either fail to defend against
the evasion attack or have not explicitly dealt with fraudulent claims of
ownership by adversaries. Furthermore, they can not establish a clear
association between the model and the creator's identity.
  To fill these gaps, in this paper, we propose a novel intellectual property
protection (IPP) framework based on blind-watermark for watermarking deep
neural networks that meet the requirements of security and feasibility. Our
framework accepts ordinary samples and the exclusive logo as inputs, outputting
newly generated samples as watermarks, which are almost indistinguishable from
the origin, and infuses these watermarks into DNN models by assigning specific
labels, leaving the backdoor as the basis for our copyright claim. We evaluated
our IPP framework on two benchmark datasets and 15 popular deep learning
models. The results show that our framework successfully verifies the ownership
of all the models without a noticeable impact on their primary task. Most
importantly, we are the first to successfully design and implement a
blind-watermark based framework, which can achieve state-of-art performances on
undetectability against evasion attack and unforgeability against fraudulent
claims of ownership. Further, our framework shows remarkable robustness and
establishes a clear association between the model and the author's identity.
","[{'version': 'v1', 'created': 'Tue, 5 Mar 2019 09:32:36 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Mar 2019 08:43:51 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Mar 2019 06:54:43 GMT'}, {'version': 'v4', 'created': 'Thu, 7 Nov 2019 13:08:57 GMT'}]",2019-11-11,"[['Li', 'Zheng', ''], ['Hu', 'Chengyu', ''], ['Zhang', 'Yang', ''], ['Guo', 'Shanqing', '']]","['intellectual property protection', 'neural networks', 'blind watermark', 'security and privacy']"
1777,1301.4800,Omar Kermia,Omar Kermia,"Schedulability Analysis of Distributed Real-Time Applications under
  Dependence and Several Latency Constraints","8 pages, 6 figures, Published with International Journal of Computer
  Applications (IJCA)","International Journal of Computer Applications 62(14):1-7, January
  2013. Published by Foundation of Computer Science, New York, USA",10.5120/10145-4978,,cs.OS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper focuses on the analysis of real-time non preemptive multiprocessor
scheduling with precedence and several latency constraints. It aims to specify
a schedulability condition which enables a designer to check a priori -without
executing or simulating- if its scheduling of tasks will hold the precedences
between tasks as well as several latency constraints imposed on determined
pairs of tasks. It is shown that the required analysis is closely linked to the
topological structure of the application graph. More precisely, it depends on
the configuration of tasks paths subject to latency constraints. As a result of
the study, a sufficient schedulability condition is introduced for precedences
and latency constraints in the hardest configuration in term of complexity with
an optimal number of processors in term of applications parallelism. In
addition, the proposed conditions provides a practical lower bounds for general
cases. Performances results and comparisons with an optimal approach
demonstrate the effectiveness of the proposed approach.
","[{'version': 'v1', 'created': 'Mon, 21 Jan 2013 10:00:22 GMT'}]",2013-01-22,"[['Kermia', 'Omar', '']]","['Real-Time Systems', 'Multiprocessor Scheduling', 'SchedulabilityAnalysis', 'Combinatorial Problems', 'Latency Constraints']"
1778,2204.11276,Lei Chen,Lei Chen and Shinpei Hayashi,Impact of Change Granularity in Refactoring Detection,"5 pages, ICPC 2022","Proceedings of the 30th IEEE/ACM International Conference on
  Program Comprehension, 565-569, 2022",10.1145/3524610.3528386,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detecting refactorings in commit history is essential to improve the
comprehension of code changes in code reviews and to provide valuable
information for empirical studies on software evolution. Several techniques
have been proposed to detect refactorings accurately at the granularity level
of a single commit. However, refactorings may be performed over multiple
commits because of code complexity or other real development problems, which is
why attempting to detect refactorings at single-commit granularity is
insufficient. We observe that some refactorings can be detected only at coarser
granularity, that is, changes spread across multiple commits. Herein, this type
of refactoring is referred to as coarse-grained refactoring (CGR). We compared
the refactorings detected on different granularities of commits from 19
open-source repositories. The results show that CGRs are common, and their
frequency increases as the granularity becomes coarser. In addition, we found
that Move-related refactorings tended to be the most frequent CGRs. We also
analyzed the causes of CGR and suggested that CGRs will be valuable in
refactoring research.
","[{'version': 'v1', 'created': 'Sun, 24 Apr 2022 13:47:52 GMT'}]",2022-12-06,"[['Chen', 'Lei', ''], ['Hayashi', 'Shinpei', '']]","['Refactoring detection', 'Squashed commit', 'Git']"
1779,2102.03897,Chetan Srinidhi L,"Chetan L. Srinidhi, Seung Wook Kim, Fu-Der Chen, Anne L. Martel","Self-supervised driven consistency training for annotation efficient
  histopathology image analysis",,"Medical Image Analysis, Volume 75, January 2022",10.1016/j.media.2021.102256,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Training a neural network with a large labeled dataset is still a dominant
paradigm in computational histopathology. However, obtaining such exhaustive
manual annotations is often expensive, laborious, and prone to inter and
Intra-observer variability. While recent self-supervised and semi-supervised
methods can alleviate this need by learn-ing unsupervised feature
representations, they still struggle to generalize well to downstream tasks
when the number of labeled instances is small. In this work, we overcome this
challenge by leveraging both task-agnostic and task-specific unlabeled data
based on two novel strategies: i) a self-supervised pretext task that harnesses
the underlying multi-resolution contextual cues in histology whole-slide images
to learn a powerful supervisory signal for unsupervised representation
learning; ii) a new teacher-student semi-supervised consistency paradigm that
learns to effectively transfer the pretrained representations to downstream
tasks based on prediction consistency with the task-specific un-labeled data.
We carry out extensive validation experiments on three histopathology benchmark
datasets across two classification and one regression-based tasks, i.e., tumor
metastasis detection, tissue type classification, and tumor cellularity
quantification. Under limited-label data, the proposed method yields tangible
improvements, which is close or even outperforming other state-of-the-art
self-supervised and supervised baselines. Furthermore, we empirically show that
the idea of bootstrapping the self-supervised pretrained features is an
effective way to improve the task-specific semi-supervised learning on standard
benchmarks. Code and pretrained models will be made available at:
https://github.com/srinidhiPY/SSL_CR_Histo
","[{'version': 'v1', 'created': 'Sun, 7 Feb 2021 19:46:21 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Feb 2021 23:26:44 GMT'}, {'version': 'v3', 'created': 'Sun, 3 Oct 2021 11:07:40 GMT'}]",2021-11-03,"[['Srinidhi', 'Chetan L.', ''], ['Kim', 'Seung Wook', ''], ['Chen', 'Fu-Der', ''], ['Martel', 'Anne L.', '']]","['Self-supervised learning', 'Semi-supervised learning', 'Limited annotations', 'Histopathology imageanalysis', 'Digital pathology']"
1780,1707.03908,Joseph Osborn,Joseph C. Osborn and Adam Summerville and Michael Mateas,Automatic Mapping of NES Games with Mappy,"9 pages, 7 figures. Appearing at Procedural Content Generation
  Workshop 2017",,10.1145/3102071.3110576,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Game maps are useful for human players, general-game-playing agents, and
data-driven procedural content generation. These maps are generally made by
hand-assembling manually-created screenshots of game levels. Besides being
tedious and error-prone, this approach requires additional effort for each new
game and level to be mapped. The results can still be hard for humans or
computational systems to make use of, privileging visual appearance over
semantic information. We describe a software system, Mappy, that produces a
good approximation of a linked map of rooms given a Nintendo Entertainment
System game program and a sequence of button inputs exploring its world. In
addition to visual maps, Mappy outputs grids of tiles (and how they change over
time), positions of non-tile objects, clusters of similar rooms that might in
fact be the same room, and a set of links between these rooms. We believe this
is a necessary step towards developing larger corpora of high-quality
semantically-annotated maps for PCG via machine learning and other
applications.
","[{'version': 'v1', 'created': 'Wed, 12 Jul 2017 21:02:19 GMT'}]",2017-07-14,"[['Osborn', 'Joseph C.', ''], ['Summerville', 'Adam', ''], ['Mateas', 'Michael', '']]","['Automated game design learning', 'mapping', 'reverse engineering']"
1781,1908.00056,Marcelo Ponce,"Ramses van Zon, Marcelo Ponce","Software-Enhanced Teaching and Visualization Capabilities of an
  Ultra-High-Resolution Video Wall","PEARC'19: ""Practice and Experience in Advanced Research Computing"",
  July 28-August 1, 2019 - Chicago, IL, USA",,10.1145/3332186.3333149,,cs.GR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a modular approach to enhance the capabilities and
features of a visualization and teaching room using software. This approach was
applied to a room with a large, high resolution (7680$\times$4320 pixels),
tiled screen of 13 $\times$ 7.5 feet as its main display, and with a variety of
audio and video inputs, connected over a network. Many of the techniques
described are possible because of a software-enhanced setup, utilizing existing
hardware and a collection of mostly open-source tools, allowing to perform
collaborative, high-resolution visualizations as well as broadcasting and
recording workshops and lectures. The software approach is flexible and allows
one to add functionality without changing the hardware.
","[{'version': 'v1', 'created': 'Wed, 31 Jul 2019 19:05:39 GMT'}]",2019-08-02,"[['van Zon', 'Ramses', ''], ['Ponce', 'Marcelo', '']]","['Education and teaching', 'Virtualization', 'Scientific Visualization', 'UHD video wall']"
1782,1903.07673,Daniel Schwabe,"Daniel Schwabe, Carlos Laufer",Trust and Privacy in Knowledge Graphs,"Pre print of paper in the WWW-19 WORKSHOP ON KNOWLEDGE GRAPH
  TECHNOLOGY AND APPLICATIONS workshop",,10.1145/3308560.3317705,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the KG Usage framework, which allows the introduction of
KG features to support Trust, Privacy and Transparency concerns regarding the
use of its contents by applications. A real-world example is presented and used
to illustrate how the framework can be used.
","[{'version': 'v1', 'created': 'Mon, 18 Mar 2019 18:58:51 GMT'}]",2020-10-06,"[['Schwabe', 'Daniel', ''], ['Laufer', 'Carlos', '']]","['Knowledge Graph', 'Privacy', 'Transparency', 'Trust', 'Semantic Web']"
1783,1811.02617,Kieran Greer Dr,Kieran Greer,Category Trees,arXiv admin note: substantial text overlap with arXiv:1711.07042,"International Journal of Artificial Intelligence & Applications
  (IJAIA), Vol.12, No.6, November 2021, pp. 65 - 76",10.5121/ijaia.2021.12606,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a batch classifier that has been improved from the
earlier version and fixed a mistake in the earlier paper. Two important changes
have been made. Each category is represented by a classifier, where each
classifier classifies its own subset of data rows, using batch input values to
represent the centroid. The first change is to use the category centroid as the
desired category output. When the classifier represents more than one category,
it creates a new layer and splits, to represent each category separately in the
new layer. The second change therefore, is to allow the classifier to branch to
new levels when there is a split in the data, or when some data rows are
incorrectly classified. Each layer can therefore branch like a tree - not for
distinguishing features, but for distinguishing categories. The paper then
suggests further innovations, by adding fixed value ranges through bands, for
each column or feature of the input dataset. When considering features, it is
shown that some of the data can be classified directly through fixed value
ranges, while the rest can be classified using the classifier technique. Tests
show that the method can successfully classify a diverse set of benchmark
datasets to better than the state-of-the-art. The paper also discusses a
biological analogy with neurons and neuron links.
","[{'version': 'v1', 'created': 'Tue, 6 Nov 2018 20:21:26 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Jan 2019 10:32:40 GMT'}, {'version': 'v3', 'created': 'Thu, 3 Oct 2019 11:01:22 GMT'}, {'version': 'v4', 'created': 'Mon, 18 Nov 2019 15:00:57 GMT'}, {'version': 'v5', 'created': 'Thu, 23 Jan 2020 14:43:39 GMT'}, {'version': 'v6', 'created': 'Tue, 19 May 2020 14:26:39 GMT'}]",2021-12-03,"[['Greer', 'Kieran', '']]","['classifier', 'tree', 'batch', 'category', 'centroid', 'neural']"
1784,1404.1891,Richard Herrmann,Richard Herrmann,"A fractal approach to the dark silicon problem: a comparison of 3D
  computer architectures -- standard slices versus fractal Menger sponge
  geometry",4 pages 2 figures,"Chaos Solitons Fractals 70, (2015) pp. 38-41",10.1016/j.chaos.2014.11.004,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The dark silicon problem, which limits the power-growth of future computer
generations, is interpreted as a heat energy transport problem when increasing
the energy emitting surface area within a given volume. A comparison of two
3D-configuration models, namely a standard slicing and a fractal surface
generation within the Menger sponge geometry is presented. It is shown, that
for iteration orders $n>3$ the fractal model shows increasingly better thermal
behavior. As a consequence cooling problems may be minimized by using a fractal
architecture. Therefore the Menger sponge geometry is a good example for
fractal architectures applicable not only in computer science, but also e.g. in
chemistry when building chemical reactors, optimizing catalytic processes or in
sensor construction technology building highly effective sensors for toxic
gases or water analysis.
","[{'version': 'v1', 'created': 'Mon, 7 Apr 2014 19:24:41 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Apr 2014 07:24:42 GMT'}]",2014-11-25,"[['Herrmann', 'Richard', '']]","['fractal architecture', 'Menger sponge', 'computer science', 'dark silicon', 'chemical reactors', 'catalytic reactions', 'sensor technology']"
1785,1312.4652,Vladimir Naidenko G.,"Vladimir Naidenko (Institute of Mathematics, National Academy of
  Sciences of Belarus)",Logics for complexity classes,"This article has been accepted for publication in Logic Journal of
  IGPL Published by Oxford University Press; 23 pages, 2 figures",Logic Journal of the IGPL (2014) 22 (6): 1075-1093,10.1093/jigpal/jzu027,,cs.CC cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new syntactic characterization of problems complete via Turing reductions
is presented. General canonical forms are developed in order to define such
problems. One of these forms allows us to define complete problems on ordered
structures, and another form to define them on unordered non-Aristotelian
structures. Using the canonical forms, logics are developed for complete
problems in various complexity classes. Evidence is shown that there cannot be
any complete problem on Aristotelian structures for several complexity classes.
Our approach is extended beyond complete problems. Using a similar form, a
logic is developed to capture the complexity class $NP\cap coNP$ which very
likely contains no complete problem.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2013 05:54:04 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Sep 2014 10:01:02 GMT'}]",2014-11-25,"[['Naidenko', 'Vladimir', '', 'Institute of Mathematics, National Academy of\n  Sciences of Belarus']]","['theory of computation', 'computational complexity', 'Turing reduction', 'completeness', 'descriptive complexity']"
1786,1709.05054,Xuemei Xie,"Guimei Cao, Xuemei Xie, Wenzhe Yang, Quan Liao, Guangming Shi and
  Jinjian Wu",Feature-Fused SSD: Fast Detection for Small Objects,"Artificial Intelligence;8 pages,8 figures","Ninth International Conference on Graphic and Image Processing
  (ICGIP 2017)",10.1117/12.2304811,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Small objects detection is a challenging task in computer vision due to its
limited resolution and information. In order to solve this problem, the
majority of existing methods sacrifice speed for improvement in accuracy. In
this paper, we aim to detect small objects at a fast speed, using the best
object detector Single Shot Multibox Detector (SSD) with respect to
accuracy-vs-speed trade-off as base architecture. We propose a multi-level
feature fusion method for introducing contextual information in SSD, in order
to improve the accuracy for small objects. In detailed fusion operation, we
design two feature fusion modules, concatenation module and element-sum module,
different in the way of adding contextual information. Experimental results
show that these two fusion modules obtain higher mAP on PASCALVOC2007 than
baseline SSD by 1.6 and 1.7 points respectively, especially with 2-3 points
improvement on some smallobjects categories. The testing speed of them is 43
and 40 FPS respectively, superior to the state of the art Deconvolutional
single shot detector (DSSD) by 29.4 and 26.4 FPS. Code is available at
https://github.com/wnzhyee/Feature-Fused-SSD. Keywords: small object detection,
feature fusion, real-time, single shot multi-box detector
","[{'version': 'v1', 'created': 'Fri, 15 Sep 2017 04:21:05 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Oct 2017 13:00:21 GMT'}, {'version': 'v3', 'created': 'Tue, 27 Nov 2018 03:54:04 GMT'}]",2018-11-28,"[['Cao', 'Guimei', ''], ['Xie', 'Xuemei', ''], ['Yang', 'Wenzhe', ''], ['Liao', 'Quan', ''], ['Shi', 'Guangming', ''], ['Wu', 'Jinjian', '']]","['Small object detection', 'feature fusion', 'real-time', 'single shot multi-box detector']"
1787,1701.08361,Martin Uecker,"Sebastian Schaetz, Dirk Voit, Jens Frahm, Martin Uecker","Accelerated Computing in Magnetic Resonance Imaging -- Real-Time Imaging
  Using Non-Linear Inverse Reconstruction","22 pages, 8 figures, 6 tables","Computational and Mathematical Methods in Medicine, 2017:3527269
  (2017)",10.1155/2017/3527269,,cs.DC physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose: To develop generic optimization strategies for image reconstruction
using graphical processing units (GPUs) in magnetic resonance imaging (MRI) and
to exemplarily report about our experience with a highly accelerated
implementation of the non-linear inversion algorithm (NLINV) for dynamic MRI
with high frame rates. Methods: The NLINV algorithm is optimized and ported to
run on an a multi-GPU single-node server. The algorithm is mapped to multiple
GPUs by decomposing the data domain along the channel dimension. Furthermore,
the algorithm is decomposed along the temporal domain by relaxing a temporal
regularization constraint, allowing the algorithm to work on multiple frames in
parallel. Finally, an autotuning method is presented that is capable of
combining different decomposition variants to achieve optimal algorithm
performance in different imaging scenarios. Results: The algorithm is
successfully ported to a multi-GPU system and allows online image
reconstruction with high frame rates. Real-time reconstruction with low latency
and frame rates up to 30 frames per second is demonstrated. Conclusion: Novel
parallel decomposition methods are presented which are applicable to many
iterative algorithms for dynamic MRI. Using these methods to parallelize the
NLINV algorithm on multiple GPUs it is possible to achieve online image
reconstruction with high frame rates.
","[{'version': 'v1', 'created': 'Sun, 29 Jan 2017 10:38:06 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Nov 2017 15:19:47 GMT'}]",2018-01-08,"[['Schaetz', 'Sebastian', ''], ['Voit', 'Dirk', ''], ['Frahm', 'Jens', ''], ['Uecker', 'Martin', '']]","['MRI', 'GPU', 'accelerator', 'parallelism', 'concurrency']"
1788,1311.4570,Pedro Neto,"Diogo Mariano Neto, Pedro Neto",Numerical modeling of friction stir welding process: a literature review,The International Journal of Advanced Manufacturing Technology,"Volume 65, 2013 , pp 115-126",10.1007/s00170-012-4154-8,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This survey presents a literature review on friction stir welding (FSW)
modeling with a special focus on the heat generation due to the contact
conditions between the FSW tool and the workpiece. The physical process is
described and the main process parameters that are relevant to its modeling are
highlighted. The contact conditions (sliding/sticking) are presented as well as
an analytical model that allows estimating the associated heat generation. The
modeling of the FSW process requires the knowledge of the heat loss mechanisms,
which are discussed mainly considering the more commonly adopted formulations.
Different approaches that have been used to investigate the material flow are
presented and their advantages/drawbacks are discussed. A reliable FSW process
modeling depends on the fine tuning of some process and material parameters.
Usually, these parameters are achieved with base on experimental data. The
numerical modeling of the FSW process can help to achieve such parameters with
less effort and with economic advantages.
","[{'version': 'v1', 'created': 'Mon, 18 Nov 2013 22:10:14 GMT'}]",2013-11-20,"[['Neto', 'Diogo Mariano', ''], ['Neto', 'Pedro', '']]","['Frictions stir welding', 'FSW', 'Modeling', 'Numerical simulation', 'Heat generation', 'Heat transfer', 'Metal flow', 'Review']"
1789,1711.06841,Eli (Omid) David,"Eli David, Moshe Koppel, Nathan S. Netanyahu",Expert-Driven Genetic Algorithms for Simulating Evaluation Functions,"arXiv admin note: substantial text overlap with arXiv:1711.06839,
  arXiv:1711.06840","Genetic Programming and Evolvable Machines, Vol. 12, No. 1, pp.
  5-22, March 2011",10.1007/s10710-010-9103-4,,cs.NE cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we demonstrate how genetic algorithms can be used to reverse
engineer an evaluation function's parameters for computer chess. Our results
show that using an appropriate expert (or mentor), we can evolve a program that
is on par with top tournament-playing chess programs, outperforming a two-time
World Computer Chess Champion. This performance gain is achieved by evolving a
program that mimics the behavior of a superior expert. The resulting evaluation
function of the evolved program consists of a much smaller number of parameters
than the expert's. The extended experimental results provided in this paper
include a report of our successful participation in the 2008 World Computer
Chess Championship. In principle, our expert-driven approach could be used in a
wide range of problems for which appropriate experts are available.
","[{'version': 'v1', 'created': 'Sat, 18 Nov 2017 10:22:49 GMT'}]",2017-11-21,"[['David', 'Eli', ''], ['Koppel', 'Moshe', ''], ['Netanyahu', 'Nathan S.', '']]","['Computer chess', 'Fitness evaluation', 'Games', 'Genetic algorithms', 'Parameter tuning']"
1790,1607.04725,Ioannis Chatzigeorgiou,Jessica Claridge and Ioannis Chatzigeorgiou,Probability of Partially Decoding Network-Coded Messages,"12 pages, accepted for publication in IEEE Communications Letters",,10.1109/LCOMM.2017.2704110,,cs.IT math.IT,http://creativecommons.org/licenses/by/4.0/,"  In the literature there exists analytical expressions for the probability of
a receiver decoding a transmitted source message that has been encoded using
random linear network coding. In this work, we look into the probability that
the receiver will decode at least a fraction of the source message, and present
an exact solution to this problem for both non-systematic and systematic
network coding. Based on the derived expressions, we investigate the potential
of these two implementations of network coding for information-theoretic secure
communication and progressive recovery of data.
","[{'version': 'v1', 'created': 'Sat, 16 Jul 2016 09:58:45 GMT'}, {'version': 'v2', 'created': 'Wed, 10 May 2017 12:39:30 GMT'}]",2022-03-08,"[['Claridge', 'Jessica', ''], ['Chatzigeorgiou', 'Ioannis', '']]","['Random linear network coding', 'rank-deficient decoding', 'probability analysis', 'information-theoretic security']"
1791,1808.03178,Lingling Fan,"Lingling Fan, Ting Su, Sen Chen, Guozhu Meng, Yang Liu, Lihua Xu,
  Geguang Pu",Efficiently Manifesting Asynchronous Programming Errors in Android Apps,,,10.1145/3238147.3238170,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Android, the #1 mobile app framework, enforces the single-GUI-thread model,
in which a single UI thread manages GUI rendering and event dispatching. Due to
this model, it is vital to avoid blocking the UI thread for responsiveness. One
common practice is to offload long-running tasks into async threads. To achieve
this, Android provides various async programming constructs, and leaves
developers themselves to obey the rules implied by the model. However, as our
study reveals, more than 25% apps violate these rules and introduce
hard-to-detect, fail-stop errors, which we term as aysnc programming errors
(APEs). To this end, this paper introduces APEChecker, a technique to
automatically and efficiently manifest APEs. The key idea is to characterize
APEs as specific fault patterns, and synergistically combine static analysis
and dynamic UI exploration to detect and verify such errors. Among the 40
real-world Android apps, APEChecker unveils and processes 61 APEs, of which 51
are confirmed (83.6% hit rate). Specifically, APEChecker detects 3X more APEs
than the state-of-art testing tools (Monkey, Sapienz and Stoat), and reduces
testing time from half an hour to a few minutes. On a specific type of APEs,
APEChecker confirms 5X more errors than the data race detection tool,
EventRacer, with very few false alarms.
","[{'version': 'v1', 'created': 'Thu, 9 Aug 2018 14:19:35 GMT'}]",2018-08-10,"[['Fan', 'Lingling', ''], ['Su', 'Ting', ''], ['Chen', 'Sen', ''], ['Meng', 'Guozhu', ''], ['Liu', 'Yang', ''], ['Xu', 'Lihua', ''], ['Pu', 'Geguang', '']]","['Asynchronous programming error', 'testing', 'static analysis', 'Android']"
1792,1812.02852,Gang Luo,Gang Luo,"Automatically Explaining Machine Learning Prediction Results: A
  Demonstration on Type 2 Diabetes Risk Prediction",,"Gang Luo. Automatically Explaining Machine Learning Prediction
  Results: A Demonstration on Type 2 Diabetes Risk Prediction. Health
  Information Science and Systems, Vol. 4, No. 2, Mar. 2016",10.1186/s13755-016-0015-4,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Predictive modeling is a key component of solutions to many
healthcare problems. Among all predictive modeling approaches, machine learning
methods often achieve the highest prediction accuracy, but suffer from a
long-standing open problem precluding their widespread use in healthcare. Most
machine learning models give no explanation for their prediction results,
whereas interpretability is essential for a predictive model to be adopted in
typical healthcare settings. Methods: This paper presents the first complete
method for automatically explaining results for any machine learning predictive
model without degrading accuracy. We did a computer coding implementation of
the method. Using the electronic medical record data set from the Practice
Fusion diabetes classification competition containing patient records from all
50 states in the United States, we demonstrated the method on predicting type 2
diabetes diagnosis within the next year. Results: For the champion machine
learning model of the competition, our method explained prediction results for
87.4% of patients who were correctly predicted by the model to have type 2
diabetes diagnosis within the next year. Conclusions: Our demonstration showed
the feasibility of automatically explaining results for any machine learning
predictive model without degrading accuracy.
","[{'version': 'v1', 'created': 'Thu, 6 Dec 2018 23:22:15 GMT'}]",2018-12-10,"[['Luo', 'Gang', '']]","['Decision support techniques', 'patient care management', 'forecasting', 'machine learning', 'type 2 diabetes']"
1793,1903.08712,Mizanur Rahman,"Ankur Sarker, Haiying Shen, Mizanur Rahman, Mashrur Chowdhury, Kakan
  Dey, Fangjian Li, Yue Wang, Husnu S. Narman","A Review of Sensing and Communication, Human Factors, and Controller
  Aspects for Information-Aware Connected and Automated Vehicles",IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS,,10.1109/TITS.2019.2892399,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information-aware connected and automated vehicles (CAVs) have drawn great
attention in recent years due to its potentially significant positive impacts
on roadway safety and operational efficiency. In this paper, we conduct an
in-depth review of three basic and key interrelated aspects of a CAV: sensing
and communication technologies, human factors, and information-aware controller
design. First, different vehicular sensing and communication technologies and
their protocol stacks, to provide reliable information to the information-aware
CAV controller, are thoroughly discussed. Diverse human factor issues, such as
user comfort, preferences, and reliability, to design the CAV systems for mass
adaptation are also discussed. Then, different layers of a CAV controller
(route planning, driving mode execution, and driving model selection)
considering human factors and information through connectivity are reviewed. In
addition, critical challenges for the sensing and communication technologies,
human factors, and information-aware controller are identified to support the
design of a safe and efficient CAV system while considering user acceptance and
comfort. Finally, promising future research directions of these three aspects
are discussed to overcome existing challenges to realize a safe and
operationally efficient CAV.
","[{'version': 'v1', 'created': 'Wed, 20 Mar 2019 19:50:09 GMT'}]",2019-03-22,"[['Sarker', 'Ankur', ''], ['Shen', 'Haiying', ''], ['Rahman', 'Mizanur', ''], ['Chowdhury', 'Mashrur', ''], ['Dey', 'Kakan', ''], ['Li', 'Fangjian', ''], ['Wang', 'Yue', ''], ['Narman', 'Husnu S.', '']]","['Connected vehicles', 'automated vehicles', 'autonomous vehicles', 'controller', 'sensing and communicationtechnologies', 'human factors']"
1794,1603.00960,Jan Egger,"Jan Egger, Christopher Nimsky","Cellular Automata Segmentation of the Boundary between the Compacta of
  Vertebral Bodies and Surrounding Structures","6 pages, 5 figures, 1 table, 42 references","SPIE Medical Imaging Conference 2016, Paper 9787-52",10.1117/12.2209039,,cs.CV cs.CG cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the aging population, spinal diseases get more and more common
nowadays; e.g., lifetime risk of osteoporotic fracture is 40% for white women
and 13% for white men in the United States. Thus the numbers of surgical spinal
procedures are also increasing with the aging population and precise diagnosis
plays a vital role in reducing complication and recurrence of symptoms. Spinal
imaging of vertebral column is a tedious process subjected to interpretation
errors. In this contribution, we aim to reduce time and error for vertebral
interpretation by applying and studying the GrowCut-algorithm for boundary
segmentation between vertebral body compacta and surrounding structures.
GrowCut is a competitive region growing algorithm using cellular automata. For
our study, vertebral T2-weighted Magnetic Resonance Imaging (MRI) scans were
first manually outlined by neurosurgeons. Then, the vertebral bodies were
segmented in the medical images by a GrowCut-trained physician using the
semi-automated GrowCut-algorithm. Afterwards, results of both segmentation
processes were compared using the Dice Similarity Coefficient (DSC) and the
Hausdorff Distance (HD) which yielded to a DSC of 82.99+/-5.03% and a HD of
18.91+/-7.2 voxel, respectively. In addition, the times have been measured
during the manual and the GrowCut segmentations, showing that a
GrowCut-segmentation - with an average time of less than six minutes
(5.77+/-0.73) - is significantly shorter than a pure manual outlining.
","[{'version': 'v1', 'created': 'Thu, 3 Mar 2016 03:35:07 GMT'}]",2016-06-29,"[['Egger', 'Jan', ''], ['Nimsky', 'Christopher', '']]","['Vertebral Body', 'Segmentation', 'Cellular Automata', 'Evaluation', 'MRI']"
1795,1907.07645,Iskandar Aripov,Iskandar Aripov,The Statistical Analysis of the Live TV Bit Rate,,"Dhinaharan Nagamalai et al. (Eds) : SAI, NCO, SOFT, ICAITA, CDKP,
  CMC, SIGNAL - 2019 pp. 213-223, 2019. CS & IT-CSCP 2019",10.5121/csit.2019.90716,,cs.NI cs.MM eess.IV,http://creativecommons.org/licenses/by/4.0/,"  This paper studies the statistical nature of TV channels streaming variable
bit rate distribution and allocation. The goal of the paper is to derive the
best-fit rate distribution to describe TV streaming bandwidth allocation, which
can reveal traffic demands of users. Our analysis uses multiplexers channel
bandwidth allocation (PID) data of 13 TV live channels. We apply 17 continuous
and 3 discrete distributions to determine the best-fit distribution function
for each individual channel and for the whole set of channels. We found that
the generalized extreme distribution fitting most of our channels most
precisely according to the Bayesian information criterion. By the same
criterion tlocationscale distribution matches best for the whole system. We use
these results to propose parameters for streaming server queuing model. Results
are useful for streaming servers scheduling policy design process targeting to
improve limited infrastructural resources, traffic engineering through dynamic
routing at CDN, SDN.
","[{'version': 'v1', 'created': 'Wed, 17 Jul 2019 17:07:29 GMT'}]",2019-07-18,"[['Aripov', 'Iskandar', '']]","['Statistical Multiplexing', 'TV channels bandwidth utilization', 'Video compression & Streaming', 'Internet Signal Processing', 'queuing theory']"
1796,1807.11809,Andreas Kamilaris,Andreas Kamilaris and Francesc X. Prenafeta-Boldu,Deep learning in agriculture: A survey,,"Computers and Electronics in Agriculture International Journal,
  2018",10.1016/j.compag.2018.02.016,,cs.LG cs.CV stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Deep learning constitutes a recent, modern technique for image processing and
data analysis, with promising results and large potential. As deep learning has
been successfully applied in various domains, it has recently entered also the
domain of agriculture. In this paper, we perform a survey of 40 research
efforts that employ deep learning techniques, applied to various agricultural
and food production challenges. We examine the particular agricultural problems
under study, the specific models and frameworks employed, the sources, nature
and pre-processing of data used, and the overall performance achieved according
to the metrics used at each work under study. Moreover, we study comparisons of
deep learning with other existing popular techniques, in respect to differences
in classification or regression performance. Our findings indicate that deep
learning provides high accuracy, outperforming existing commonly used image
processing techniques.
","[{'version': 'v1', 'created': 'Tue, 31 Jul 2018 13:30:03 GMT'}]",2018-08-01,"[['Kamilaris', 'Andreas', ''], ['Prenafeta-Boldu', 'Francesc X.', '']]","['Deep learning', 'Agriculture', 'Survey', 'Convolutional Neural Networks', 'Recurrent']"
1797,1705.04010,Roland Bouffanais,"Mohammadreza Chamanbaz and David Mateo and Brandon M. Zoss and Grgur
  Toki\'c and Erik Wilhelm and Roland Bouffanais and and Dick K. P. Yue",Swarm-Enabling Technology for Multi-Robot Systems,,Frontiers in Robotics and AI 4 (2017) 12,10.3389/frobt.2017.00012,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Swarm robotics has experienced a rapid expansion in recent years, primarily
fueled by specialized multi-robot systems developed to achieve dedicated
collective actions. These specialized platforms are in general designed with
swarming considerations at the front and center. Key hardware and software
elements required for swarming are often deeply embedded and integrated with
the particular system. However, given the noticeable increase in the number of
low-cost mobile robots readily available, practitioners and hobbyists may start
considering to assemble full-fledged swarms by minimally retrofitting such
mobile platforms with a swarm-enabling technology. Here, we report one possible
embodiment of such a technology designed to enable the assembly and the study
of swarming in a range of general-purpose robotic systems. This is achieved by
combining a modular and transferable software toolbox with a hardware suite
composed of a collection of low-cost and off-the-shelf components. The
developed technology can be ported to a relatively vast range of robotic
platforms with minimal changes and high levels of scalability. This
swarm-enabling technology has successfully been implemented on two distinct
distributed multi-robot systems, a swarm of mobile marine buoys and a team of
commercial terrestrial robots. We have tested the effectiveness of both of
these distributed robotic systems in performing collective exploration and
search scenarios, as well as other classical cooperative behaviors.
Experimental results on different swarm behaviors are reported for the two
platforms in uncontrolled environments and without any supporting
infrastructure. The design of the associated software library allows for a
seamless switch to other cooperative behaviors, and also offers the possibility
to simulate newly designed collective behaviors prior to their implementation
onto the platforms.
","[{'version': 'v1', 'created': 'Thu, 11 May 2017 04:29:16 GMT'}]",2022-09-29,"[['Chamanbaz', 'Mohammadreza', ''], ['Mateo', 'David', ''], ['Zoss', 'Brandon M.', ''], ['Tokić', 'Grgur', ''], ['Wilhelm', 'Erik', ''], ['Bouffanais', 'Roland', ''], ['Yue', 'and Dick K. P.', '']]","['Swarm Robotics', 'Distributed Multi-Robot Systems', 'Cooperative Control', 'Flocking', 'Distributed Communication']"
1798,1307.4380,Nahier Aldhafferi Mr,"Nahier Aldhafferi, Charles Watson and A.S.M Sajeev","A Smart Wizard System Suitable for Use With Internet Mobile Devices to
  Adjust Personal Information Privacy Settings","16 pages, 8 figures, 2 tables","International Journal of Security, Privacy and Trust
  Management,Vol2,No3,2013",10.5121/ijsptm.2013.2301,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The privacy of personal information is an important issue affecting the
confidence of internet users. The widespread adoption of online social networks
and access to these platforms using mobile devices has encouraged developers to
make the systems and interfaces acceptable to users who seek privacy. The aim
of this study is to test a wizard that allows users to control the sharing of
personal information with others. We also assess the concerns of users in terms
of such sharing such as whether to hide personal data in current online social
network accounts. Survey results showed the wizard worked very well and that
females concealed more personal information than did males. In addition, most
users who were concerned about misuse of personal information hid those items.
The results can be used to upgrade current privacy systems or to design new
systems that work on mobile internet devices. The system can also be used to
save time when setting personal privacy settings and makes users more aware of
items that will be shared with others.
","[{'version': 'v1', 'created': 'Sat, 13 Jul 2013 04:05:11 GMT'}]",2013-07-17,"[['Aldhafferi', 'Nahier', ''], ['Watson', 'Charles', ''], ['Sajeev', 'A. S. M', '']]","['Mobile phones', 'Privacy', 'Online social networks', 'Touch screens', 'Personal information']"
1799,1006.5845,Mattia Monga,"Aristide Fattori, Roberto Paleari, Lorenzo Martignoni, Mattia Monga",Dynamic and Transparent Analysis of Commodity Production Systems,"10 pages, To appear in the 25th IEEE/ACM International Conference on
  Automated Software Engineering, Antwerp, Belgium, 20-24 September 2010",,10.1145/1858996.1859085,,cs.OS cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a framework that provides a programming interface to perform
complex dynamic system-level analyses of deployed production systems. By
leveraging hardware support for virtualization available nowadays on all
commodity machines, our framework is completely transparent to the system under
analysis and it guarantees isolation of the analysis tools running on its top.
Thus, the internals of the kernel of the running system needs not to be
modified and the whole platform runs unaware of the framework. Moreover, errors
in the analysis tools do not affect the running system and the framework. This
is accomplished by installing a minimalistic virtual machine monitor and
migrating the system, as it runs, into a virtual machine. In order to
demonstrate the potentials of our framework we developed an interactive kernel
debugger, nicknamed HyperDbg. HyperDbg can be used to debug any critical kernel
component, and even to single step the execution of exception and interrupt
handlers.
","[{'version': 'v1', 'created': 'Wed, 30 Jun 2010 13:01:58 GMT'}]",2015-03-04,"[['Fattori', 'Aristide', ''], ['Paleari', 'Roberto', ''], ['Martignoni', 'Lorenzo', ''], ['Monga', 'Mattia', '']]","['hardware virtualization', 'debugging', 'system analysis']"
1800,1601.08154,Tiago Azevedo,"Tiago Azevedo, Paulo J. M. de Ara\'ujo, Rosaldo J. F. Rossetti, Ana
  Paula C. Rocha","JADE, TraSMAPI and SUMO: A tool-chain for simulating traffic light
  control",,"Proceedings of the 8th International Workshop on Agents in Traffic
  and Transportation, ATT'14, held at the Thirteenth International Joint
  Conference on Autonomous Agents and Multiagent Systems, AAMAS'14 (2014) 8-15",10.13140/2.1.2739.4886,,cs.MA,http://creativecommons.org/licenses/by/4.0/,"  Increased stress, fuel consumption, air pollution, accidents and delays are
some of the consequences of traffic congestion usually incurring in tremendous
economic impacts, which society aims to remedy in order to leverage a
sustainable development. Recently, unconventional means for modeling and
controlling such complex traffic systems relying on multi-agent systems have
arisen. This paper contributes to the understanding of such complex and highly
dynamic systems by proposing an open-source tool-chain to implement
multi-agent-based solutions in traffic and transportation. The proposed
approach relies on two very popular tools in both domains, with focus on
traffic light control. This tool-chain consists in combining JADE (Java Agent
DEvelopment Framework), for the implementation of multi-agent systems, with
SUMO (Simulation of Urban MObility), for the microscopic simulation of traffic
interactions. TraSMAPI (Traffic Simulation Manager Application Programming
Interface) is used to combine JADE and SUMO allowing communication between
them. A demonstration of the concept is presented to illustrate the main
features of this tool-chain, using Q-Learning as the reinforcement learning
method for each traffic light agent in a simulated network. Results demonstrate
the feasibility of the proposed framework as a practical means to experiment
with different agent-based designs of intelligent transportation solutions.
","[{'version': 'v1', 'created': 'Fri, 29 Jan 2016 15:29:21 GMT'}]",2016-02-01,"[['Azevedo', 'Tiago', ''], ['de Araújo', 'Paulo J. M.', ''], ['Rossetti', 'Rosaldo J. F.', ''], ['Rocha', 'Ana Paula C.', '']]","['MAS', 'traffic light', 'JADE', 'SUMO', 'TraSMAPI', 'Q-learning']"
1801,1708.00743,Vincent Labatut,Vincent Labatut (LIA),Continuous Average Straightness in Spatial Graphs,,"Journal of Complex Networks, Oxford, 2018, 6 (2), pp.269-296",10.1093/comnet/cnx033,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Straightness is a measure designed to characterize a pair of vertices in
a spatial graph. It is defined as the ratio of the Euclidean distance to the
graph distance between these vertices. It is often used as an average, for
instance to describe the accessibility of a single vertex relatively to all the
other vertices in the graph, or even to summarize the graph as a whole. In some
cases, one needs to process the Straightness between not only vertices, but
also any other points constituting the graph of interest. Suppose for instance
that our graph represents a road network and we do not want to limit ourselves
to crossroad-to-crossroad itineraries, but allow any street number to be a
starting point or destination. In this situation, the standard approach
consists in: 1) discretizing the graph edges, 2) processing the
vertex-to-vertex Straightness considering the additional vertices resulting
from this discretization, and 3) performing the appropriate average on the
obtained values. However, this discrete approximation can be computationally
expensive on large graphs, and its precision has not been clearly assessed. In
this article, we adopt a continuous approach to average the Straightness over
the edges of spatial graphs. This allows us to derive 5 distinct measures able
to characterize precisely the accessibility of the whole graph, as well as
individual vertices and edges. Our method is generic and could be applied to
other measures designed for spatial graphs. We perform an experimental
evaluation of our continuous average Straightness measures, and show how they
behave differently from the traditional vertex-to-vertex ones. Moreover, we
also study their discrete approximations, and show that our approach is
globally less demanding in terms of both processing time and memory usage. Our
R source code is publicly available under an open source license.
","[{'version': 'v1', 'created': 'Wed, 2 Aug 2017 13:42:23 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Mar 2018 13:08:58 GMT'}]",2018-05-18,"[['Labatut', 'Vincent', '', 'LIA']]","['Spatial graph', 'Straightness', 'Centrality measure', 'Graph characterization']"
1802,1403.4064,Ivan Radi\v{c}ek,"Sumit Gulwani, Ivan Radi\v{c}ek, Florian Zuleger","Feedback Generation for Performance Problems in Introductory Programming
  Assignments",Tech report/extended version of FSE 2014 paper,,10.1145/2635868.2635912,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Providing feedback on programming assignments manually is a tedious, error
prone, and time-consuming task. In this paper, we motivate and address the
problem of generating feedback on performance aspects in introductory
programming assignments. We studied a large number of functionally correct
student solutions to introductory programming assignments and observed: (1)
There are different algorithmic strategies, with varying levels of efficiency,
for solving a given problem. These different strategies merit different
feedback. (2) The same algorithmic strategy can be implemented in countless
different ways, which are not relevant for reporting feedback on the student
program.
  We propose a light-weight programming language extension that allows a
teacher to define an algorithmic strategy by specifying certain key values that
should occur during the execution of an implementation. We describe a dynamic
analysis based approach to test whether a student's program matches a teacher's
specification. Our experimental results illustrate the effectiveness of both
our specification language and our dynamic analysis. On one of our benchmarks
consisting of 2316 functionally correct implementations to 3 programming
problems, we identified 16 strategies that we were able to describe using our
specification language (in 95 minutes after inspecting 66, i.e., around 3%,
implementations). Our dynamic analysis correctly matched each implementation
with its corresponding specification, thereby automatically producing the
intended feedback.
","[{'version': 'v1', 'created': 'Mon, 17 Mar 2014 11:09:59 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Sep 2014 10:01:03 GMT'}]",2014-09-18,"[['Gulwani', 'Sumit', ''], ['Radiček', 'Ivan', ''], ['Zuleger', 'Florian', '']]","['Education', 'MOOCs', 'performance analysis', 'trace specification', 'dynamic analysis']"
1803,1511.01413,Pedro Lopez-Garcia,"Umer Liqat, Kyriakos Georgiou, Steve Kerrison, Pedro Lopez-Garcia,
  John P. Gallagher, Manuel V. Hermenegildo and Kerstin Eder","Inferring Parametric Energy Consumption Functions at Different Software
  Levels: ISA vs. LLVM IR","22 pages, 4 figures, 2 tables",,10.1007/978-3-319-46559-3_5,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The static estimation of the energy consumed by program executions is an
important challenge, which has applications in program optimization and
verification, and is instrumental in energy-aware software development. Our
objective is to estimate such energy consumption in the form of functions on
the input data sizes of programs. We have developed a tool for experimentation
with static analysis which infers such energy functions at two levels, the
instruction set architecture (ISA) and the intermediate code (LLVM IR) levels,
and reflects it upwards to the higher source code level. This required the
development of a translation from LLVM IR to an intermediate representation and
its integration with existing components, a translation from ISA to the same
representation, a resource analyzer, an ISA-level energy model, and a mapping
from this model to LLVM IR. The approach has been applied to programs written
in the XC language running on XCore architectures, but is general enough to be
applied to other languages. Experimental results show that our LLVM IR level
analysis is reasonably accurate (less than 6.4% average error vs. hardware
measurements) and more powerful than analysis at the ISA level. This paper
provides insights into the trade-off of precision versus analyzability at these
levels.
","[{'version': 'v1', 'created': 'Wed, 4 Nov 2015 17:46:13 GMT'}]",2021-04-13,"[['Liqat', 'Umer', ''], ['Georgiou', 'Kyriakos', ''], ['Kerrison', 'Steve', ''], ['Lopez-Garcia', 'Pedro', ''], ['Gallagher', 'John P.', ''], ['Hermenegildo', 'Manuel V.', ''], ['Eder', 'Kerstin', '']]","['Energy Consumption Analysis', 'Resource Usage Analysis', 'Static Analysis', 'Embedded Systems']"
1804,1801.05463,Yonggyun Yu,"Yonggyun Yu, Taeil Hur, Jaeho Jung and In Gwun Jang","Deep learning for determining a near-optimal topological design without
  any iteration","27 page, 11 figures, The paper is accepted in the Structural and
  Multidisciplinary Optimization journal, Springer",,10.1007/s00158-018-2101-5,,cs.LG physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, we propose a novel deep learning-based method to predict an
optimized structure for a given boundary condition and optimization setting
without using any iterative scheme. For this purpose, first, using open-source
topology optimization code, datasets of the optimized structures paired with
the corresponding information on boundary conditions and optimization settings
are generated at low (32 x 32) and high (128 x 128) resolutions. To construct
the artificial neural network for the proposed method, a convolutional neural
network (CNN)-based encoder and decoder network is trained using the training
dataset generated at low resolution. Then, as a two-stage refinement, the
conditional generative adversarial network (cGAN) is trained with the optimized
structures paired at both low and high resolutions, and is connected to the
trained CNN-based encoder and decoder network. The performance evaluation
results of the integrated network demonstrate that the proposed method can
determine a near-optimal structure in terms of pixel values and compliance with
negligible computational time.
","[{'version': 'v1', 'created': 'Sat, 13 Jan 2018 17:10:35 GMT'}, {'version': 'v2', 'created': 'Tue, 22 May 2018 08:53:55 GMT'}, {'version': 'v3', 'created': 'Sat, 22 Sep 2018 07:50:36 GMT'}]",2018-10-30,"[['Yu', 'Yonggyun', ''], ['Hur', 'Taeil', ''], ['Jung', 'Jaeho', ''], ['Jang', 'In Gwun', '']]","['deep learning', 'machine learning', 'topology optimization', 'generative model', 'generative']"
1805,1006.1694,Martianus Frederic Ezerman,"Martianus Frederic Ezerman, Somphong Jitman, Han Mao Kiah, and San
  Ling","Pure Asymmetric Quantum MDS Codes from CSS Construction: A Complete
  Characterization","Change in authors' list. Accepted for publication in Int. Journal of
  Quantum Information","Int. J. Quantum Inform. 11, 1350027 (2013)",10.1142/S0219749913500275,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using the Calderbank-Shor-Steane (CSS) construction, pure $q$-ary asymmetric
quantum error-correcting codes attaining the quantum Singleton bound are
constructed. Such codes are called pure CSS asymmetric quantum maximum distance
separable (AQMDS) codes. Assuming the validity of the classical MDS Conjecture,
pure CSS AQMDS codes of all possible parameters are accounted for.
","[{'version': 'v1', 'created': 'Wed, 9 Jun 2010 03:17:56 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Sep 2011 09:34:58 GMT'}, {'version': 'v3', 'created': 'Tue, 17 Apr 2012 12:26:09 GMT'}, {'version': 'v4', 'created': 'Tue, 14 May 2013 04:06:12 GMT'}]",2016-04-18,"[['Ezerman', 'Martianus Frederic', ''], ['Jitman', 'Somphong', ''], ['Kiah', 'Han Mao', ''], ['Ling', 'San', '']]","['asymmetric quantum codes', 'MDS codes', 'Singleton bound', 'Generalized ReedSolomon codes', 'weight distribution']"
1806,1509.02673,Mihai Oltean,"Mihai Oltean, Oana Muntean","Solving NP-complete problems with delayed signals: an overview of
  current research directions","in Proceedings of 1st international workshop on Optical
  SuperComputing, LNCS 5172, pp. 115-128, Springer-Verlag, 2008, more info at:
  http://www.cs.ubbcluj.ro/~moltean/optical",,10.1007/978-3-540-85673-3_10,,cs.ET cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we summarize the existing principles for building
unconventional computing devices that involve delayed signals for encoding
solutions to NP-complete problems. We are interested in the following aspects:
the properties of the signal, the operations performed within the devices, some
components required for the physical implementation, precision required for
correctly reading the solution and the decrease in the signal's strength. Six
problems have been solved so far by using the above enumerated principles:
Hamiltonian path, travelling salesman, bounded and unbounded subset sum,
Diophantine equations and exact cover. For the hardware implementation several
types of signals can be used: light, electric power, sound, electro-magnetic
etc.
","[{'version': 'v1', 'created': 'Wed, 9 Sep 2015 08:14:52 GMT'}]",2015-09-10,"[['Oltean', 'Mihai', ''], ['Muntean', 'Oana', '']]","['unconventional computing', 'signal-based computing', 'NP-complete', 'delay lines', 'optical computing']"
1807,1807.01603,Javier Ferrer,Javier Ferrer and Enrique Alba,"BIN-CT: Urban Waste Collection based in Predicting the Container Fill
  Level","11 pages, double column, 4 figures, 3 tables",,10.1016/j.biosystems.2019.04.006,,cs.AI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The fast demographic growth, together with the concentration of the
population in cities and the increasing amount of daily waste, are factors that
push to the limit the ability of waste assimilation by Nature. Therefore, we
need technological means to make an optimal management of the waste collection
process, which represents 70% of the operational cost in waste treatment. In
this article, we present a free intelligent software system, based on
computational learning algorithms, which plans the best routes for waste
collection supported by past (historical) and future (predictions) data.
  The objective of the system is the cost reduction of the waste collection
service by means of the minimization in distance traveled by any truck to
collect a container, hence the fuel consumption. At the same time the quality
of service to the citizen is increased avoiding the annoying overflows of
containers thanks to the accurate fill level predictions performed by BIN-CT.
In this article we show the features of our software system, illustrating it
operation with a real case study of a Spanish city. We conclude that the use of
BIN-CT avoids unnecessary visits to containers, reduces the distance traveled
to collect a container and therefore we obtain a reduction of total costs and
harmful emissions thrown to the atmosphere.
","[{'version': 'v1', 'created': 'Tue, 3 Jul 2018 10:50:03 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Apr 2019 08:55:16 GMT'}]",2019-04-23,"[['Ferrer', 'Javier', ''], ['Alba', 'Enrique', '']]","['Waste Collection', 'Machine Learning', 'Recycling', 'Forecasting', 'Routes Generation']"
1808,1811.03424,Massimo Bartoletti,"Massimo Bartoletti, Tiziana Cimoli, Livio Pompianu, Sergio Serusi",Blockchain for social good: a quantitative analysis,In GOODTECHS 2018,,10.1145/3284869.3284881,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rise of blockchain technologies has given a boost to social good
projects, which are trying to exploit various characteristic features of
blockchains: the quick and inexpensive transfer of cryptocurrency, the
transparency of transactions, the ability to tokenize any kind of assets, and
the increase in trustworthiness due to decentralization. However, the swift
pace of innovation in blockchain technologies, and the hype that has surrounded
their ""disruptive potential"", make it difficult to understand whether these
technologies are applied correctly, and what one should expect when trying to
apply them to social good projects. This paper addresses these issues, by
systematically analysing a collection of 120 blockchain-enabled social good
projects. Focussing on measurable and objective aspects, we try to answer
various relevant questions: which features of blockchains are most commonly
used? Do projects have success in fund raising? Are they making appropriate
choices on the blockchain architecture? How many projects are released to the
public, and how many are eventually abandoned?
","[{'version': 'v1', 'created': 'Fri, 2 Nov 2018 19:04:14 GMT'}]",2018-11-09,"[['Bartoletti', 'Massimo', ''], ['Cimoli', 'Tiziana', ''], ['Pompianu', 'Livio', ''], ['Serusi', 'Sergio', '']]","['Blockchain', 'cryptocurrencies', 'social good']"
1809,1911.07919,Yu Feng,"Yu Feng, Paul Whatmough, Yuhao Zhu",ASV: Accelerated Stereo Vision System,MICRO 2019,"In Proceedings of the 52nd Annual IEEE/ACM International Symposium
  on Microarchitecture (MICRO '52). ACM, New York, NY, USA, 643-656 (2019)",10.1145/3352460.3358253,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Estimating depth from stereo vision cameras, i.e., ""depth from stereo"", is
critical to emerging intelligent applications deployed in energy- and
performance-constrained devices, such as augmented reality headsets and mobile
autonomous robots. While existing stereo vision systems make trade-offs between
accuracy, performance and energy-efficiency, we describe ASV, an accelerated
stereo vision system that simultaneously improves both performance and
energy-efficiency while achieving high accuracy. The key to ASV is to exploit
unique characteristics inherent to stereo vision, and apply stereo-specific
optimizations, both algorithmically and computationally. We make two
contributions. Firstly, we propose a new stereo algorithm, invariant-based
stereo matching (ISM), that achieves significant speedup while retaining high
accuracy. The algorithm combines classic ""hand-crafted"" stereo algorithms with
recent developments in Deep Neural Networks (DNNs), by leveraging the
correspondence invariant unique to stereo vision systems. Secondly, we observe
that the bottleneck of the ISM algorithm is the DNN inference, and in
particular the deconvolution operations that introduce massive
compute-inefficiencies. We propose a set of software optimizations that
mitigate these inefficiencies. We show that with less than 0.5% hardware area
overhead, these algorithmic and computational optimizations can be effectively
integrated within a conventional DNN accelerator. Overall, ASV achieves 5x
speedup and 85% energy saving with 0.02% accuracy loss compared to today
DNN-based stereo vision systems.
","[{'version': 'v1', 'created': 'Fri, 15 Nov 2019 18:44:25 GMT'}]",2019-11-20,"[['Feng', 'Yu', ''], ['Whatmough', 'Paul', ''], ['Zhu', 'Yuhao', '']]","['Stereo vision', 'Depth from stereo', 'Mobile computing', 'DNN accelerator', 'data-flow', 'tiling', 'constrained-optimization']"
1810,1912.02217,Pedro Mirabal,"P. Mirabal, J. Abreu, D. Seco","Assessing the best edit in perturbation-based iterative refinement
  algorithms to compute the median string","14 pages, 4 figures","Pattern Recognition Letters, Volume 120, 1 April 2019, Pages
  104-111",10.1016/j.patrec.2019.02.004,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Strings are a natural representation of biological data such as DNA, RNA and
protein sequences. The problem of finding a string that summarizes a set of
sequences has direct application in relative compression algorithms for genome
and proteome analysis, where reference sequences need to be chosen. Median
strings have been used as representatives of a set of strings in different
domains. However, several formulations of those problems are NP-Complete.
Alternatively, heuristic approaches that iteratively refine an initial coarse
solution by applying edit operations have been proposed. Recently, we
investigated the selection of the optimal edit operations to speed up
convergence without spoiling the quality of the approximated median string. We
propose a novel algorithm that outperforms state of the art heuristic
approximations to the median string in terms of convergence speed by estimating
the effect of a perturbation in the minimization of the expressions that define
the median strings. We present corpus of comparative experiments to validate
these results.
","[{'version': 'v1', 'created': 'Wed, 4 Dec 2019 19:09:15 GMT'}]",2019-12-06,"[['Mirabal', 'P.', ''], ['Abreu', 'J.', ''], ['Seco', 'D.', '']]","['approximate median string', 'edit distance', 'edit operations']"
1811,1502.08030,Hung Nghiep Tran,"Hung Nghiep Tran, Tin Huynh, Tien Do",Author Name Disambiguation by Using Deep Neural Network,,"Asian Conference on Intelligent Information and Database Systems
  (ACIIDS 2014)",10.1007/978-3-319-05476-6_13,,cs.DL cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Author name ambiguity decreases the quality and reliability of information
retrieved from digital libraries. Existing methods have tried to solve this
problem by predefining a feature set based on expert's knowledge for a specific
dataset. In this paper, we propose a new approach which uses deep neural
network to learn features automatically from data. Additionally, we propose the
general system architecture for author name disambiguation on any dataset. In
this research, we evaluate the proposed method on a dataset containing
Vietnamese author names. The results show that this method significantly
outperforms other methods that use predefined feature set. The proposed method
achieves 99.31% in terms of accuracy. Prediction error rate decreases from
1.83% to 0.69%, i.e., it decreases by 1.14%, or 62.3% relatively compared with
other methods that use predefined feature set (Table 3).
","[{'version': 'v1', 'created': 'Fri, 27 Feb 2015 19:34:42 GMT'}, {'version': 'v2', 'created': 'Sat, 29 Jul 2017 01:32:31 GMT'}]",2020-02-24,"[['Tran', 'Hung Nghiep', ''], ['Huynh', 'Tin', ''], ['Do', 'Tien', '']]","['Digital Library', 'Bibliographic Data', 'Author Name Disambiguation', 'Machine Learning', 'Feature Learning', 'Deep Neural Network']"
1812,1006.0866,Secretary Aircc Journal,"Shing-Kwei Tzeng(1) and Chih-Fang Huang(2), ((1)Kainan University,
  Taiwan and (2)Yuan Ze University, Taiwan)","A Study on the Interactive ""HOPSCOTCH"" Game for the Children Using
  Computer Music Techniques",13 Pages,"International journal of Multimedia & Its Applications 2.2 (2010)
  32-44",10.5121/ijma.2010.2203,,cs.SD,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  ""Hopscotch"" is a world-wide game for children to play since the times in the
ancient Roman Empire and China. Here we present a study mainly focused on the
research and discussion of the application on the children's well-know
edutainment via the physical interactive design to provide the sensing of the
times for the conventional hopscotch, which is a new type of experiment for the
technology aided edutainment. The innovated hopscotch music game involves the
sound samples of various animals and the characters of cartoon, and the
algorithmic composition via the development of the music technology based
interactive game, to gradually make the children perceive the world of digits,
sound, and music. It can guide the growing children's personality and character
from disorder into clarity. Furthermore, the traditional teaching materials can
be improved via the implementation of the electrical sensing devices,
electrical I/O module, and the computer music program Max/MSP, to integrate the
interactive computer music with the interactive and immersive soundscapes
composition, and the teaching tool with educational gaming is completely
accomplished eventually.
","[{'version': 'v1', 'created': 'Fri, 4 Jun 2010 11:20:08 GMT'}]",2010-07-15,"[['Tzeng', 'Shing-Kwei', ''], ['Huang', 'Chih-Fang', '']]","['Hopscotch', 'Algorithmic Composition', 'Edutainment', 'Interactive Design', 'Soundscapes']"
1813,1812.07524,Lukasz Romaszko,"Lukasz Romaszko, Christopher K.I. Williams, John Winn",Learning Direct Optimization for Scene Understanding,,"Pattern Recognition, Volume 105, 2020, 107369",10.1016/j.patcog.2020.107369,,cs.CV cs.GR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop a Learning Direct Optimization (LiDO) method for the refinement of
a latent variable model that describes input image x. Our goal is to explain a
single image x with an interpretable 3D computer graphics model having scene
graph latent variables z (such as object appearance, camera position). Given a
current estimate of z we can render a prediction of the image g(z), which can
be compared to the image x. The standard way to proceed is then to measure the
error E(x, g(z)) between the two, and use an optimizer to minimize the error.
However, it is unknown which error measure E would be most effective for
simultaneously addressing issues such as misaligned objects, occlusions,
textures, etc. In contrast, the LiDO approach trains a Prediction Network to
predict an update directly to correct z, rather than minimizing the error with
respect to z. Experiments show that our LiDO method converges rapidly as it
does not need to perform a search on the error landscape, produces better
solutions than error-based competitors, and is able to handle the mismatch
between the data and the fitted scene model. We apply LiDO to a realistic
synthetic dataset, and show that the method also transfers to work well with
real images.
","[{'version': 'v1', 'created': 'Tue, 18 Dec 2018 17:46:13 GMT'}, {'version': 'v2', 'created': 'Thu, 7 May 2020 13:43:49 GMT'}]",2020-05-08,"[['Romaszko', 'Lukasz', ''], ['Williams', 'Christopher K. I.', ''], ['Winn', 'John', '']]","['computer vision', 'scene understanding', '3D reconstruction', 'inversegraphics', 'object recognition', 'scene graph', 'analysis-by-synthesis', 'graphics']"
1814,1310.5249,Fabrice Rossi,"Mohamed Khalil El Mahrsi (LTCI, SAMM), Fabrice Rossi (SAMM)",Graph-Based Approaches to Clustering Network-Constrained Trajectory Data,,"New Frontiers in Mining Complex Patterns, Appice, Annalisa and
  Ceci, Michelangelo and Loglisci, Corrado and Manco, Giuseppe and Masciari,
  Elio and Ras, Zbigniew (Ed.) (2013) 124-137",10.1007/978-3-642-37382-4_9,NFMCP2013,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering trajectory data attracted considerable attention in the last few
years. Most of prior work assumed that moving objects can move freely in an
euclidean space and did not consider the eventual presence of an underlying
road network and its influence on evaluating the similarity between
trajectories. In this paper, we present an approach to clustering such
network-constrained trajectory data. More precisely we aim at discovering
groups of road segments that are often travelled by the same trajectories. To
achieve this end, we model the interactions between segments w.r.t. their
similarity as a weighted graph to which we apply a community detection
algorithm to discover meaningful clusters. We showcase our proposition through
experimental results obtained on synthetic datasets.
","[{'version': 'v1', 'created': 'Sat, 19 Oct 2013 17:24:39 GMT'}]",2013-10-22,"[['Mahrsi', 'Mohamed Khalil El', '', 'LTCI, SAMM'], ['Rossi', 'Fabrice', '', 'SAMM']]","['similarity', 'clustering', 'moving objects', 'trajectories', 'road network', 'graph']"
1815,1509.08743,Debajit Sensarma,Debajit Sensarma and Samar Sen Sarma,Data Hiding using Graphical Code based Steganography Technique,"5 pages, 3 figures, 2 tables, International Journal of Engineering
  Trends and Technology (IJETT),Volume 27 Number 3, September 2015",,10.14445/22315381/IJETT-V27P225,,cs.IT cs.MM math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data hiding has received much attention due to rapid development of internet
and multimedia technologies where security of information is a very important
concern. This is achieved by Steganography, which is the art or science of
hiding data into another data, so that human eyes cannot catch the hidden
information easily. There are many ways to hide information-like inside an
image, text, audio/ video etc. Among them image steganography is a very
attractive research area. The goal is to transmit a data within a modified
image (called stego-image)by minimizing the number of bit flips. In this paper,
a new steganography technique has been proposed using Graphical codes and also
comparison with steganography technique using BCH codes has been studied.
","[{'version': 'v1', 'created': 'Tue, 29 Sep 2015 13:31:08 GMT'}]",2015-10-02,"[['Sensarma', 'Debajit', ''], ['Sarma', 'Samar Sen', '']]","['Steganography', 'data hiding', 'graphical codes', 'covering radius', 'embedding efficiency']"
1816,1711.00617,Yu Wang,"Yu Wang, Yang Feng, Zhe Hong, Ryan Berger and Jiebo Luo","How Polarized Have We Become? A Multimodal Classification of Trump
  Followers and Clinton Followers","16 pages, SocInfo 2017, 9th International Conference on Social
  Informatics",,10.1007/978-3-319-67217-5_27,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Polarization in American politics has been extensively documented and
analyzed for decades, and the phenomenon became all the more apparent during
the 2016 presidential election, where Trump and Clinton depicted two radically
different pictures of America. Inspired by this gaping polarization and the
extensive utilization of Twitter during the 2016 presidential campaign, in this
paper we take the first step in measuring polarization in social media and we
attempt to predict individuals' Twitter following behavior through analyzing
ones' everyday tweets, profile images and posted pictures. As such, we treat
polarization as a classification problem and study to what extent Trump
followers and Clinton followers on Twitter can be distinguished, which in turn
serves as a metric of polarization in general. We apply LSTM to processing
tweet features and we extract visual features using the VGG neural network.
Integrating these two sets of features boosts the overall performance. We are
able to achieve an accuracy of 69%, suggesting that the high degree of
polarization recorded in the literature has started to manifest itself in
social media as well.
","[{'version': 'v1', 'created': 'Thu, 2 Nov 2017 05:40:46 GMT'}]",2017-11-03,"[['Wang', 'Yu', ''], ['Feng', 'Yang', ''], ['Hong', 'Zhe', ''], ['Berger', 'Ryan', ''], ['Luo', 'Jiebo', '']]","['polarization', 'American politics', 'Donald Trump', 'Hillary Clinton', 'LSTM', 'VGG', 'multimedia']"
1817,1810.11935,Tushar Semwal,"Rahul Shivnarayan Mishra, Tushar Semwal and Shivashankar B. Nair","A Distributed Epigenetic Shape Formation and Regeneration Algorithm for
  a Swarm of Robots","8 pages, 9 figures, GECCO-18 conference","In Proceedings of the Genetic and Evolutionary Computation
  Conference Companion (GECCO '18), Hernan Aguirre (Ed.). ACM, New York, NY,
  USA, 1505-1512. 2018",10.1145/3205651.3208300,,cs.RO cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Living cells exhibit both growth and regeneration of body tissues. Epigenetic
Tracking (ET), models this growth and regenerative qualities of living cells
and has been used to generate complex 2D and 3D shapes. In this paper, we
present an ET based algorithm that aids a swarm of identically-programmed
robots to form arbitrary shapes and regenerate them when cut. The algorithm
works in a distributed manner using only local interactions and computations
without any central control and aids the robots to form the shape in a
triangular lattice structure. In case of damage or splitting of the shape, it
helps each set of the remaining robots to regenerate and position themselves to
build scaled down versions of the original shape. The paper presents the shapes
formed and regenerated by the algorithm using the Kilombo simulator.
","[{'version': 'v1', 'created': 'Mon, 29 Oct 2018 03:25:04 GMT'}]",2018-10-30,"[['Mishra', 'Rahul Shivnarayan', ''], ['Semwal', 'Tushar', ''], ['Nair', 'Shivashankar B.', '']]","['Epigenetic Tracking', 'Swarm Robotics', 'Nature-inspired', 'Distributed', 'Decentralized']"
1818,1512.00664,Sanjay Sahay,"Aruna Govada, Bhavul Gauri and S.K. Sahay",Distributed Multi Class SVM for Large Data Sets,"Presente in the WCI, Kochi, India, 2015","ACM Digital Library, Proceeding WCI '15 Proceedings of the Third
  International Symposium on Women in Computing and Informatics, PP. 54-58,
  2015",10.1145/2791405.2791534,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data mining algorithms are originally designed by assuming the data is
available at one centralized site.These algorithms also assume that the whole
data is fit into main memory while running the algorithm. But in today's
scenario the data has to be handled is distributed even geographically.
Bringing the data into a centralized site is a bottleneck in terms of the
bandwidth when compared with the size of the data. In this paper for multiclass
SVM we propose an algorithm which builds a global SVM model by merging the
local SVMs using a distributed approach(DSVM). And the global SVM will be
communicated to each site and made it available for further classification. The
experimental analysis has shown promising results with better accuracy when
compared with both the centralized and ensemble method. The time complexity is
also reduced drastically because of the parallel construction of local SVMs.
The experiments are conducted by considering the data sets of size 100s to
hundred of 100s which also addresses the issue of scalability.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2015 12:14:19 GMT'}]",2015-12-03,"[['Govada', 'Aruna', ''], ['Gauri', 'Bhavul', ''], ['Sahay', 'S. K.', '']]","['Distributed Data Mining', 'MultiClass SVM', 'One-Vs-One(OVO)']"
1819,1907.12165,Hugh Kennedy Dr.,Hugh L Kennedy,"On the Realization and Analysis of Circular Harmonic Transforms for
  Feature Detection","A new section on parallel software implementation (MATLAB, C++ and
  CUDA) was added to this draft version. Manuscript was then accepted for
  publication in Journal of Real-Time Image Processing, special issue on
  Real-Time Statistical Image and Video Processing for Remote Sensing and
  Surveillance Applications",,10.1007/s11554-020-01040-4,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Circular-harmonic spectra are a compact representation of local image
features in two dimensions. It is well known that the computational complexity
of such transforms is greatly reduced when polar separability is exploited in
steerable filter-banks. Further simplifications are possible when Cartesian
separability is incorporated using the radial apodization (i.e. weight, window,
or taper) described here, as a consequence of the Laguerre/Hermite
correspondence over polar/Cartesian coordinates. The chosen form also mitigates
undesirable discretization artefacts due to angular aliasing. The possible
utility of circular-harmonic spectra for the description of simple features is
illustrated using real data from an airborne electro-optic sensor. The spectrum
is deployed in a test-statistic to detect and characterize corners of arbitrary
angle and orientation (i.e. wedges). The test-statistic considers uncertainty
due to finite sampling and clutter/noise.
","[{'version': 'v1', 'created': 'Mon, 29 Jul 2019 00:20:17 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Jul 2019 23:17:10 GMT'}, {'version': 'v3', 'created': 'Fri, 11 Oct 2019 03:50:55 GMT'}, {'version': 'v4', 'created': 'Fri, 10 Jan 2020 06:10:05 GMT'}, {'version': 'v5', 'created': 'Fri, 6 Nov 2020 10:25:09 GMT'}]",2020-11-09,"[['Kennedy', 'Hugh L', '']]","['Computer vision', 'Digital filters', 'Image filtering', 'Object detection', 'Object recognition', 'Transforms']"
1820,1911.13233,Giulio Romualdi,"Giulio Romualdi, Stefano Dafarra, Yue Hu, Prashanth Ramadoss,
  Francisco Javier Andrade Chavez, Silvio Traversaro and Daniele Pucci","A Benchmarking of DCM Based Architectures for Position, Velocity and
  Torque Controlled Humanoid Robots","arXiv admin note: text overlap with arXiv:1809.02167,
  arXiv:1909.10403. International Journal of Humanoid Robotics 2020",,10.1142/S0219843619500348,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper contributes towards the benchmarking of control architectures for
bipedal robot locomotion. It considers architectures that are based on the
Divergent Component of Motion (DCM) and composed of three main layers:
trajectory optimization, simplified model control, and whole-body QP control
layer. While the first two layers use simplified robot models, the whole-body
QP control layer uses a complete robot model to produce either desired
positions, velocities, or torques inputs at the joint-level. This paper then
compares two implementations of the simplified model control layer, which are
tested with position, velocity, and torque control modes for the whole-body QP
control layer. In particular, both an instantaneous and a Receding Horizon
controller are presented for the simplified model control layer. We show also
that one of the proposed architectures allows the humanoid robot iCub to
achieve a forward walking velocity of 0.3372 meters per second, which is the
highest walking velocity achieved by the iCub robot.
","[{'version': 'v1', 'created': 'Wed, 27 Nov 2019 17:41:26 GMT'}]",2020-02-17,"[['Romualdi', 'Giulio', ''], ['Dafarra', 'Stefano', ''], ['Hu', 'Yue', ''], ['Ramadoss', 'Prashanth', ''], ['Chavez', 'Francisco Javier Andrade', ''], ['Traversaro', 'Silvio', ''], ['Pucci', 'Daniele', '']]","['Bipedal robot locomotion', 'DCM', 'Benchmarking']"
1821,0910.4688,Olympia Hadjiliadis,"Olympia Hadjiliadis, Tobias Schaefer and H. Vincent Poor",Quickest detection in coupled systems,"6 pages, 48th IEEE Conference on Decision and Control, Shanghai 2009
  December 16 - 18",,10.1109/CDC.2009.5400871,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work considers the problem of quickest detection of signals in a coupled
system of N sensors, which receive continuous sequential observations from the
environment. It is assumed that the signals, which are modeled a general Ito
processes, are coupled across sensors, but that their onset times may differ
from sensor to sensor. The objective is the optimal detection of the first time
at which any sensor in the system receives a signal. The problem is formulated
as a stochastic optimization problem in which an extended average Kullback-
Leibler divergence criterion is used as a measure of detection delay, with a
constraint on the mean time between false alarms. The case in which the sensors
employ cumulative sum (CUSUM) strategies is considered, and it is proved that
the minimum of N CUSUMs is asymptotically optimal as the mean time between
false alarms increases without bound.
","[{'version': 'v1', 'created': 'Sat, 24 Oct 2009 23:29:03 GMT'}]",2016-11-15,"[['Hadjiliadis', 'Olympia', ''], ['Schaefer', 'Tobias', ''], ['Poor', 'H. Vincent', '']]","['Kullback-Leibler divergence', 'CUSUM', 'quickest detection']"
1822,1511.07521,YangQuan Chen Prof.,"Zhuo Li, Lu Liu, Sina Dehghan, YangQuan Chen, and Dingyu Xue","A review and evaluation of numerical tools for fractional calculus and
  fractional order control",,,10.1080/00207179.2015.1124290,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, as fractional calculus becomes more and more broadly used in
research across different academic disciplines, there are increasing demands
for the numerical tools for the computation of fractional
integration/differentiation, and the simulation of fractional order systems.
Time to time, being asked about which tool is suitable for a specific
application, the authors decide to carry out this survey to present
recapitulative information of the available tools in the literature, in hope of
benefiting researchers with different academic backgrounds. With this
motivation, the present article collects the scattered tools into a dashboard
view, briefly introduces their usage and algorithms, evaluates the accuracy,
compares the performance, and provides informative comments for selection.
","[{'version': 'v1', 'created': 'Tue, 24 Nov 2015 00:31:58 GMT'}]",2015-11-25,"[['Li', 'Zhuo', ''], ['Liu', 'Lu', ''], ['Dehghan', 'Sina', ''], ['Chen', 'YangQuan', ''], ['Xue', 'Dingyu', '']]","['Fractional calculus', 'fractional order controls', 'numerical tools']"
1823,1212.1790,Muhammad Fahad Khan,"Faisal Baig, Saira Beg, Muhammad Fahad Khan",Controlling Home Appliances Remotely through Voice Command,"4 pages, 4, figures, International Journal of Computer Applications",,10.5120/7437-0133,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Controlling appliances is a main part of automation. The main object of Home
automation is to provide a wireless communication link of home appliances to
the remote user. The main objective of this work is to make such a system which
controls the home appliances remotely. This paper discusses two methods of
controlling home appliances one is via voice to text SMS and other is to use
the mobile as a remote control, this system will provide a benefit to the
elderly and disable people and also to those who are unaware of typing an SMS.
","[{'version': 'v1', 'created': 'Sat, 8 Dec 2012 13:38:19 GMT'}]",2015-06-12,"[['Baig', 'Faisal', ''], ['Beg', 'Saira', ''], ['Khan', 'Muhammad Fahad', '']]","['GSM', 'SMS', 'Home Automation', 'Voice command']"
1824,1102.2933,Garth Wells,"Mikael Mortensen, Hans Petter Langtangen, Garth N. Wells","A FEniCS-Based Programming Framework for Modeling Turbulent Flow by the
  Reynolds-Averaged Navier-Stokes Equations",To appear in Advances in Water Resources,,10.1016/j.advwatres.2011.02.013,,cs.CE physics.comp-ph physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finding an appropriate turbulence model for a given flow case usually calls
for extensive experimentation with both models and numerical solution methods.
This work presents the design and implementation of a flexible, programmable
software framework for assisting with numerical experiments in computational
turbulence. The framework targets Reynolds-averaged Navier-Stokes models,
discretized by finite element methods. The novel implementation makes use of
Python and the FEniCS package, the combination of which leads to compact and
reusable code, where model- and solver-specific code resemble closely the
mathematical formulation of equations and algorithms. The presented ideas and
programming techniques are also applicable to other fields that involve systems
of nonlinear partial differential equations. We demonstrate the framework in
two applications and investigate the impact of various linearizations on the
convergence properties of nonlinear solvers for a Reynolds-averaged
Navier-Stokes model.
","[{'version': 'v1', 'created': 'Tue, 15 Feb 2011 00:08:11 GMT'}, {'version': 'v2', 'created': 'Thu, 31 Mar 2011 17:12:17 GMT'}]",2011-07-21,"[['Mortensen', 'Mikael', ''], ['Langtangen', 'Hans Petter', ''], ['Wells', 'Garth N.', '']]","['Turbulent flow', 'RANS models', 'finite elements', 'Python', 'FEniCS', 'object-oriented programming', 'problem solving environment']"
1825,1101.3291,Smriti Bhagat,"Smriti Bhagat, Graham Cormode and S. Muthukrishnan",Node Classification in Social Networks,"To appear in Social Network Data Analytics (Springer) Ed. Charu
  Aggarwal, March 2011",,10.1007/978-1-4419-8462-3_5,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When dealing with large graphs, such as those that arise in the context of
online social networks, a subset of nodes may be labeled. These labels can
indicate demographic values, interest, beliefs or other characteristics of the
nodes (users). A core problem is to use this information to extend the labeling
so that all nodes are assigned a label (or labels). In this chapter, we survey
classification techniques that have been proposed for this problem. We consider
two broad categories: methods based on iterative application of traditional
classifiers using graph information as features, and methods which propagate
the existing labels via random walks. We adopt a common perspective on these
methods to highlight the similarities between different approaches within and
across the two categories. We also describe some extensions and related
directions to the central problem of node classification.
","[{'version': 'v1', 'created': 'Mon, 17 Jan 2011 19:14:46 GMT'}]",2015-05-27,"[['Bhagat', 'Smriti', ''], ['Cormode', 'Graham', ''], ['Muthukrishnan', 'S.', '']]","['Node classification', 'Graph labeling', 'Semi-supervised learning', 'Iterativemethods']"
1826,1704.06361,Dariusz Dereniowski,Dariusz Dereniowski and Wieslaw Kubiak,Shared processor scheduling,,Journal of Scheduling 21(6): 583-593 (2018),10.1007/s10951-018-0566-0,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the shared processor scheduling problem with a single shared
processor where a unit time saving (weight) obtained by processing a job on the
shared processor depends on the job. A polynomial-time optimization algorithm
has been given for the problem with equal weights in the literature. This paper
extends that result by showing an $O(n \log n)$ optimization algorithm for a
class of instances in which non-decreasing order of jobs with respect to
processing times provides a non-increasing order with respect to weights ---
this instance generalizes the unweighted case of the problem. This algorithm
also leads to a $\frac{1}{2}$-approximation algorithm for the general weighted
problem. The complexity of the weighted problem remains open.
","[{'version': 'v1', 'created': 'Thu, 20 Apr 2017 23:10:36 GMT'}]",2021-01-19,"[['Dereniowski', 'Dariusz', ''], ['Kubiak', 'Wieslaw', '']]","['divisible jobs', 'scheduling', 'shared processor']"
1827,1608.05856,Jing Wang,"Jing Wang, Meng Wang, Xuegang Hu, Shuicheng Yan","Visual Processing by a Unified Schatten-$p$ Norm and $\ell_q$ Norm
  Regularized Principal Component Pursuit","Pattern Recognition, 2015",,10.1016/j.patcog.2015.01.024,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a non-convex formulation to recover the authentic
structure from the corrupted real data. Typically, the specific structure is
assumed to be low rank, which holds for a wide range of data, such as images
and videos. Meanwhile, the corruption is assumed to be sparse. In the
literature, such a problem is known as Robust Principal Component Analysis
(RPCA), which usually recovers the low rank structure by approximating the rank
function with a nuclear norm and penalizing the error by an $\ell_1$-norm.
Although RPCA is a convex formulation and can be solved effectively, the
introduced norms are not tight approximations, which may cause the solution to
deviate from the authentic one. Therefore, we consider here a non-convex
relaxation, consisting of a Schatten-$p$ norm and an $\ell_q$-norm that promote
low rank and sparsity respectively. We derive a proximal iteratively reweighted
algorithm (PIRA) to solve the problem. Our algorithm is based on an alternating
direction method of multipliers, where in each iteration we linearize the
underlying objective function that allows us to have a closed form solution. We
demonstrate that solutions produced by the linearized approximation always
converge and have a tighter approximation than the convex counterpart.
Experimental results on benchmarks show encouraging results of our approach.
","[{'version': 'v1', 'created': 'Sat, 20 Aug 2016 18:18:39 GMT'}]",2016-08-23,"[['Wang', 'Jing', ''], ['Wang', 'Meng', ''], ['Hu', 'Xuegang', ''], ['Yan', 'Shuicheng', '']]","['Image processing', 'Denoising', 'Robust principal component analysis', 'Schatten-p norm', 'ℓq norm']"
1828,1802.07849,Tom Hanika,Stephan Doerfel and Tom Hanika and Gerd Stumme,Clones in Graphs,"11 pages, 2 figures, 1 table",,10.1007/978-3-030-01851-1_6,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finding structural similarities in graph data, like social networks, is a
far-ranging task in data mining and knowledge discovery. A (conceptually)
simple reduction would be to compute the automorphism group of a graph.
However, this approach is ineffective in data mining since real world data does
not exhibit enough structural regularity. Here we step in with a novel approach
based on mappings that preserve the maximal cliques. For this we exploit the
well known correspondence between bipartite graphs and the data structure
formal context $(G,M,I)$ from Formal Concept Analysis. From there we utilize
the notion of clone items. The investigation of these is still an open problem
to which we add new insights with this work. Furthermore, we produce a
substantial experimental investigation of real world data. We conclude with
demonstrating the generalization of clone items to permutations.
","[{'version': 'v1', 'created': 'Wed, 21 Feb 2018 23:31:41 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Jul 2018 14:39:47 GMT'}]",2020-02-28,"[['Doerfel', 'Stephan', ''], ['Hanika', 'Tom', ''], ['Stumme', 'Gerd', '']]","['Social Network Analysis', 'Formal Concept Analysis', 'Clones']"
1829,1707.05038,Vasileios Kotronis,"Petros Gigis, Vasileios Kotronis, Emile Aben, Stephen D. Strowes and
  Xenofontas Dimitropoulos",Characterizing User-to-User Connectivity with RIPE Atlas,In Proceedings of the Applied Networking Research Workshop (ANRW '17),,10.1145/3106328.3106332,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Characterizing the interconnectivity of networks at a country level is an
interesting but non-trivial task. The IXP Country Jedi is an existing prototype
that uses RIPE Atlas probes in order to explore interconnectivity at a country
level, taking into account all Autonomous Systems (AS) where RIPE Atlas probes
are deployed. In this work, we build upon this basis and specifically focus on
""eyeball"" networks, i.e. the user-facing networks with the largest user
populations in any given country, and explore to what extent we can provide
insights on their interconnectivity. In particular, with a focused user-to-user
(and/or user-to-content) version of the IXP Country Jedi we work towards
meaningful statistics and comparisons between countries/economies. This is
something that a general-purpose probe-to-probe version is not able to capture.
We present our preliminary work on the estimation of RIPE Atlas coverage in
eyeball networks, as well as an approach to measure and visualize user
interconnectivity with our Eyeball Jedi tool.
","[{'version': 'v1', 'created': 'Mon, 17 Jul 2017 08:28:01 GMT'}]",2017-07-18,"[['Gigis', 'Petros', ''], ['Kotronis', 'Vasileios', ''], ['Aben', 'Emile', ''], ['Strowes', 'Stephen D.', ''], ['Dimitropoulos', 'Xenofontas', '']]","['Measurement', 'Traceroute', 'User Coverage', 'Eyeball Networks']"
1830,1211.4385,Vivek Shrivastava,Vivek Shrivastava and Navdeep Sharma,Artificial Neural Network Based Optical Character Recognition,"Signal & Image Processing : An International Journal (SIPIJ) Vol.3,
  No.5, October 2012",,10.5121/sipij.2012.3506,,cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optical Character Recognition deals in recognition and classification of
characters from an image. For the recognition to be accurate, certain
topological and geometrical properties are calculated, based on which a
character is classified and recognized. Also, the Human psychology perceives
characters by its overall shape and features such as strokes, curves,
protrusions, enclosures etc. These properties, also called Features are
extracted from the image by means of spatial pixel-based calculation. A
collection of such features, called Vectors, help in defining a character
uniquely, by means of an Artificial Neural Network that uses these Feature
Vectors.
","[{'version': 'v1', 'created': 'Mon, 19 Nov 2012 12:21:49 GMT'}]",2012-11-20,"[['Shrivastava', 'Vivek', ''], ['Sharma', 'Navdeep', '']]","['Feature Extraction', 'Vector Generation', 'Correlation Coefficients', 'Artificial Neural Networks', 'Walsh Hadamard Transform']"
1831,1908.04133,Matthias Niedermaier,Matthias Niedermaier and Dominik Merli and Georg Sigl,A Secure Dual-MCU Architecture for Robust Communication of IIoT Devices,,2019 8th Mediterranean Conference on Embedded Computing (MECO),10.1109/MECO.2019.8760188,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Industrial Internet of Things (IIoT) has already become a part of our
everyday life be it water supply, smart grid, or production, IIoT is
everywhere. For example, factory operators want to know the current state of
the production line. These new demands for data acquisition in modern plants
require industrial components to be able to communicate. Nowadays, network
communication in Industrial Control Systems (ICSs) is often implemented via an
IP-based protocol. This intercommunication also brings a larger attack surface
for hackers. If an IIoT device is influenced by attackers, the physical process
could be affected. For example, a high network load could cause a high Central
Processing Unit (CPU) load and influence the reaction time on the physical
control side. In this paper, we introduce a dual Microcontroller Unit (MCU)
setup to ensure a resilient controlling for IIoT devices like Programmable
Logic Controllers (PLCs). We introduce a possible solution for the demand of
secure architectures in the IIoT. Moreover, we provide a Proof of Concept (PoC)
implementation with a benchmark and a comparison with a standard PLC.
","[{'version': 'v1', 'created': 'Mon, 12 Aug 2019 12:58:53 GMT'}]",2019-08-13,"[['Niedermaier', 'Matthias', ''], ['Merli', 'Dominik', ''], ['Sigl', 'Georg', '']]","['security', 'robust', 'iiot', 'industrial control system']"
1832,1706.01831,Madhavun Candadai Vasu,"Madhavun Candadai Vasu, Eduardo Izquierdo","Information Bottleneck in Control Tasks with Recurrent Spiking Neural
  Networks","Accepted at ICANN'17 to appear in Springer Lecture Notes in Computer
  Science","ICANN 2017. Lecture Notes in Computer Science, vol 10613.
  Springer, Cham",10.1007/978-3-319-68600-4_28,,cs.NE cs.IT math.IT q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The nervous system encodes continuous information from the environment in the
form of discrete spikes, and then decodes these to produce smooth motor
actions. Understanding how spikes integrate, represent, and process information
to produce behavior is one of the greatest challenges in neuroscience.
Information theory has the potential to help us address this challenge.
Informational analyses of deep and feed-forward artificial neural networks
solving static input-output tasks, have led to the proposal of the
\emph{Information Bottleneck} principle, which states that deeper layers encode
more relevant yet minimal information about the inputs. Such an analyses on
networks that are recurrent, spiking, and perform control tasks is relatively
unexplored. Here, we present results from a Mutual Information analysis of a
recurrent spiking neural network that was evolved to perform the classic
pole-balancing task. Our results show that these networks deviate from the
\emph{Information Bottleneck} principle prescribed for feed-forward networks.
","[{'version': 'v1', 'created': 'Tue, 6 Jun 2017 16:08:18 GMT'}]",2017-11-15,"[['Vasu', 'Madhavun Candadai', ''], ['Izquierdo', 'Eduardo', '']]","['Spiking neurons', 'Evolutionary neural networks', 'Recurrentnetworks', 'Information theory', 'Information Bottleneck']"
1833,2108.02830,Moin Khan,"Moin Khan, Khurram Shahzad, Kamran Malik",Hate Speech Detection in Roman Urdu,"This is a pre-print of a contribution published in ACM Transactions
  on Asian and Low-Resource Language Information Processing. The final version
  is available online at the given journal link","ACM Transactions on Asian and Low Resource Language Information
  Processing; Volume 20; Issue 1; April 2021; Article Number 9; pp 1 to 19",10.1145/3414524,,cs.CL cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hate speech is a specific type of controversial content that is widely
legislated as a crime that must be identified and blocked. However, due to the
sheer volume and velocity of the Twitter data stream, hate speech detection
cannot be performed manually. To address this issue, several studies have been
conducted for hate speech detection in European languages, whereas little
attention has been paid to low-resource South Asian languages, making the
social media vulnerable for millions of users. In particular, to the best of
our knowledge, no study has been conducted for hate speech detection in Roman
Urdu text, which is widely used in the sub-continent. In this study, we have
scrapped more than 90,000 tweets and manually parsed them to identify 5,000
Roman Urdu tweets. Subsequently, we have employed an iterative approach to
develop guidelines and used them for generating the Hate Speech Roman Urdu 2020
corpus. The tweets in the this corpus are classified at three levels:
Neutral-Hostile, Simple-Complex, and Offensive-Hate speech. As another
contribution, we have used five supervised learning techniques, including a
deep learning technique, to evaluate and compare their effectiveness for hate
speech detection. The results show that Logistic Regression outperformed all
other techniques, including deep learning techniques for the two levels of
classification, by achieved an F1 score of 0.906 for distinguishing between
Neutral-Hostile tweets, and 0.756 for distinguishing between Offensive-Hate
speech tweets.
","[{'version': 'v1', 'created': 'Thu, 5 Aug 2021 19:49:46 GMT'}]",2021-08-09,"[['Khan', 'Moin', ''], ['Shahzad', 'Khurram', ''], ['Malik', 'Kamran', '']]","['NLP', 'Hate-speech detection', 'Roman Urdu']"
1834,1307.7612,Patrick Zwickl,"Patrick Zwickl, Paul Fuxjaeger, Ivan Gojmerac, Peter Reichl",Wi-Fi Offload: Tragedy of the Commons or Land of Milk and Honey?,"Workshop on Spectrum Sharing Strategies for Wireless Broadband
  Services, IEEE PIMRC'13, to appear 2013",,10.1109/PIMRCW.2013.6707854,,cs.NI cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fueled by its recent success in provisioning on-site wireless Internet
access, Wi-Fi is currently perceived as the best positioned technology for
pervasive mobile macro network offloading. However, the broad transitions of
multiple collocated operators towards this new paradigm may result in fierce
competition for the common unlicensed spectrum at hand. In this light, our
paper game-theoretically dissects market convergence scenarios by assessing the
competition between providers in terms of network performance, capacity
constraints, cost reductions, and revenue prospects. We will closely compare
the prospects and strategic positioning of fixed line operators offering Wi-Fi
services with respect to competing mobile network operators utilizing
unlicensed spectrum. Our results highlight important dependencies upon
inter-operator collaboration models, and more importantly, upon the ratio
between backhaul and Wi-Fi access bit-rates. Furthermore, our investigation of
medium- to long-term convergence scenarios indicates that a rethinking of
control measures targeting the large-scale monetization of unlicensed spectrum
may be required, as otherwise the used free bands may become subject to
tragedy-of-commons type of problems.
","[{'version': 'v1', 'created': 'Mon, 29 Jul 2013 15:17:51 GMT'}]",2016-11-17,"[['Zwickl', 'Patrick', ''], ['Fuxjaeger', 'Paul', ''], ['Gojmerac', 'Ivan', ''], ['Reichl', 'Peter', '']]","['Wi-Fi offloading', 'unlicensed spectrum', 'tragedyof commons', 'competition', 'resource sharing']"
1835,1612.03382,Sahar Yousefi,"Sahar Yousefi, M.T. Manzuri Shalmani, Jeremy Lin, Marius Staring",A Novel Motion Detection Method Resistant to Severe Illumination Changes,,,10.1109/TCSVT.2018.2885211,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Recently, there has been a considerable attention given to the motion
detection problem due to the explosive growth of its applications in video
analysis and surveillance systems. While the previous approaches can produce
good results, an accurate detection of motion remains a challenging task due to
the difficulties raised by illumination variations, occlusion, camouflage,
burst physical motion, dynamic texture, and environmental changes such as those
on climate changes, sunlight changes during a day, etc. In this paper, we
propose a novel per-pixel motion descriptor for both motion detection and
dynamic texture segmentation which outperforms the current methods in the
literature particularly in severe scenarios. The proposed descriptor is based
on two complementary three-dimensional-discrete wavelet transform (3D-DWT) and
three-dimensional wavelet leader. In this approach, a feature vector is
extracted for each pixel by applying a novel three dimensional wavelet-based
motion descriptor. Then, the extracted features are clustered by a clustering
method such as well-known k-means algorithm or Gaussian Mixture Model (GMM).
The experimental results demonstrate the effectiveness of our proposed method
compared to the other motion detection approaches from the literature. The
application of the proposed method and additional experimental results for the
different datasets are available at
(http://dspl.ce.sharif.edu/motiondetector.html).
","[{'version': 'v1', 'created': 'Sun, 11 Dec 2016 07:50:00 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Feb 2017 05:38:03 GMT'}, {'version': 'v3', 'created': 'Mon, 8 May 2017 08:14:06 GMT'}, {'version': 'v4', 'created': 'Wed, 10 May 2017 05:57:40 GMT'}, {'version': 'v5', 'created': 'Thu, 5 Oct 2017 12:55:56 GMT'}, {'version': 'v6', 'created': 'Thu, 15 Mar 2018 13:29:46 GMT'}]",2021-03-29,"[['Yousefi', 'Sahar', ''], ['Shalmani', 'M. T. Manzuri', ''], ['Lin', 'Jeremy', ''], ['Staring', 'Marius', '']]","['Motion detection', 'Dynamic texture', '3D-discrete Wavelet Transform', 'Wavelet leader']"
1836,1705.03341,Lars Ruthotto,Eldad Haber and Lars Ruthotto,Stable Architectures for Deep Neural Networks,"23 pages, 7 figures","Inverse Problems, Volume 34, Number 1 Inverse Problems, Volume 34,
  Number 1, 2017",10.1088/1361-6420/aa9a90,,cs.LG cs.NA math.NA math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks have become invaluable tools for supervised machine
learning, e.g., classification of text or images. While often offering superior
results over traditional techniques and successfully expressing complicated
patterns in data, deep architectures are known to be challenging to design and
train such that they generalize well to new data. Important issues with deep
architectures are numerical instabilities in derivative-based learning
algorithms commonly called exploding or vanishing gradients. In this paper we
propose new forward propagation techniques inspired by systems of Ordinary
Differential Equations (ODE) that overcome this challenge and lead to
well-posed learning problems for arbitrarily deep networks.
  The backbone of our approach is our interpretation of deep learning as a
parameter estimation problem of nonlinear dynamical systems. Given this
formulation, we analyze stability and well-posedness of deep learning and use
this new understanding to develop new network architectures. We relate the
exploding and vanishing gradient phenomenon to the stability of the discrete
ODE and present several strategies for stabilizing deep learning for very deep
networks. While our new architectures restrict the solution space, several
numerical experiments show their competitiveness with state-of-the-art
networks.
","[{'version': 'v1', 'created': 'Tue, 9 May 2017 14:13:18 GMT'}, {'version': 'v2', 'created': 'Fri, 30 Jun 2017 08:47:13 GMT'}, {'version': 'v3', 'created': 'Sat, 16 Feb 2019 16:13:21 GMT'}]",2019-02-19,"[['Haber', 'Eldad', ''], ['Ruthotto', 'Lars', '']]","['Machine Learning', 'Deep Neural Networks', 'Dynamic Inverse Problems', 'PDE-ConstrainedOptimization', 'Parameter Estimation', 'Image Classification']"
1837,1903.03369,Taras Kucherenko,"Taras Kucherenko, Dai Hasegawa, Gustav Eje Henter, Naoshi Kaneko,
  Hedvig Kjellstr\""om","Analyzing Input and Output Representations for Speech-Driven Gesture
  Generation","Accepted at IVA '19. Shorter version published at AAMAS '19. The code
  is available at
  https://github.com/GestureGeneration/Speech_driven_gesture_generation_with_autoencoder",,10.1145/3308532.3329472,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel framework for automatic speech-driven gesture
generation, applicable to human-agent interaction including both virtual agents
and robots. Specifically, we extend recent deep-learning-based, data-driven
methods for speech-driven gesture generation by incorporating representation
learning. Our model takes speech as input and produces gestures as output, in
the form of a sequence of 3D coordinates. Our approach consists of two steps.
First, we learn a lower-dimensional representation of human motion using a
denoising autoencoder neural network, consisting of a motion encoder MotionE
and a motion decoder MotionD. The learned representation preserves the most
important aspects of the human pose variation while removing less relevant
variation. Second, we train a novel encoder network SpeechE to map from speech
to a corresponding motion representation with reduced dimensionality. At test
time, the speech encoder and the motion decoder networks are combined: SpeechE
predicts motion representations based on a given speech signal and MotionD then
decodes these representations to produce motion sequences. We evaluate
different representation sizes in order to find the most effective
dimensionality for the representation. We also evaluate the effects of using
different speech features as input to the model. We find that mel-frequency
cepstral coefficients (MFCCs), alone or combined with prosodic features,
perform the best. The results of a subsequent user study confirm the benefits
of the representation learning.
","[{'version': 'v1', 'created': 'Fri, 8 Mar 2019 11:03:43 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Mar 2019 13:57:30 GMT'}, {'version': 'v3', 'created': 'Wed, 29 May 2019 12:00:57 GMT'}, {'version': 'v4', 'created': 'Tue, 11 Jun 2019 07:13:39 GMT'}]",2019-06-12,"[['Kucherenko', 'Taras', ''], ['Hasegawa', 'Dai', ''], ['Henter', 'Gustav Eje', ''], ['Kaneko', 'Naoshi', ''], ['Kjellström', 'Hedvig', '']]","['Gesture generation', 'social robotics', 'representation learning', 'neuralnetwork', 'deep learning', 'virtual agents']"
1838,1407.1133,Tarun Bhalla,Palvi Arora and Tarun Bhalla,A Synonym Based Approach of Data Mining in Search Engine Optimization,"5 pages, 2figures, Published with International Journal of Computer
  Trends and Technology (IJCTT)","Palvi Arora , Tarun Bhalla.""A Synonym Based Approach of Data
  Mining in Search Engine Optimization"". International Journal of Computer
  Trends and Technology (IJCTT) V12(4):201-205, June 2014. ISSN:2231-2803.
  www.ijcttjournal.org",10.14445/22312803/IJCTT-V12P140,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In todays era with the rapid growth of information on the web, makes users
turn to search engines as a replacement of traditional media. This makes
sorting of particular information through billions of webpages and displaying
the relevant data makes the task tough for the search engine. Remedy for this
is SEO i.e. having a website optimized in such a way that it will display the
relevant webpages based on ranking. This is the main reason that makes search
engine optimization a prominent position in online world. This paper present a
synonym based data mining approach for SEO that makes the task of improving the
ranking of the website much easier way and user will get answer to their query
easily through any of search engine available in market.
","[{'version': 'v1', 'created': 'Fri, 4 Jul 2014 06:38:02 GMT'}]",2014-07-07,"[['Arora', 'Palvi', ''], ['Bhalla', 'Tarun', '']]","['Data mining', 'Goal of SEO', 'Keyword based search', 'Random surfing', 'Synonym based search', 'Synonym table']"
1839,1304.0104,Diederik Aerts,"Diederik Aerts, Jan Broekaert, Sandro Sozzo and Tomas Veloz",Meaning-focused and Quantum-inspired Information Retrieval,11 pages,"Quantum Interaction. Lecture Notes in Computer Science, 8369, pp.
  71-83, 2014",10.1007/978-3-642-54943-4_7,,cs.IR cs.CL quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, quantum-based methods have promisingly integrated the
traditional procedures in information retrieval (IR) and natural language
processing (NLP). Inspired by our research on the identification and
application of quantum structures in cognition, more specifically our work on
the representation of concepts and their combinations, we put forward a
'quantum meaning based' framework for structured query retrieval in text
corpora and standardized testing corpora. This scheme for IR rests on
considering as basic notions, (i) 'entities of meaning', e.g., concepts and
their combinations and (ii) traces of such entities of meaning, which is how
documents are considered in this approach. The meaning content of these
'entities of meaning' is reconstructed by solving an 'inverse problem' in the
quantum formalism, consisting of reconstructing the full states of the entities
of meaning from their collapsed states identified as traces in relevant
documents. The advantages with respect to traditional approaches, such as
Latent Semantic Analysis (LSA), are discussed by means of concrete examples.
","[{'version': 'v1', 'created': 'Sat, 30 Mar 2013 13:08:58 GMT'}]",2015-12-31,"[['Aerts', 'Diederik', ''], ['Broekaert', 'Jan', ''], ['Sozzo', 'Sandro', ''], ['Veloz', 'Tomas', '']]","['Information Retrieval', 'Latent Semantic Analysis', 'quantum modeling', 'concept theory']"
1840,2105.11303,Kissami Imad,"Fayssal Benkhaldoun, Christophe C\'erin, Imad Kissami, Walid Saad","Challenges of Translating HPC codes to Workflows for Heterogeneous and
  Dynamic Environments",,,10.1109/HPCS.2017.130,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we would like to share our experience for transforming a
parallel code for a Computational Fluid Dynamics (CFD) problem into a parallel
version for the RedisDG workflow engine. This system is able to capture
heterogeneous and highly dynamic environments, thanks to opportunistic
scheduling strategies. We show how to move to the field of ""HPC as a Service""
in order to use heterogeneous platforms. We mainly explain, through the CFD use
case, how to transform the parallel code and we exhibit challenges to 'unfold'
the task graph dynamically in order to improve the overall performance (in a
broad sense) of the workflow engine. We discuss in particular of the impact on
the workflow engine of such dynamic feature. This paper states that new models
for High Performance Computing are possible, under the condition we revisit our
mind in the direction of the potential of new paradigms such as cloud, edge
computing.
","[{'version': 'v1', 'created': 'Mon, 24 May 2021 14:36:38 GMT'}]",2021-05-25,"[['Benkhaldoun', 'Fayssal', ''], ['Cérin', 'Christophe', ''], ['Kissami', 'Imad', ''], ['Saad', 'Walid', '']]","['component; HPC as a Service', 'Workflow', 'Scientific']"
1841,1803.05170,Jianxun Lian,"Jianxun Lian, Xiaohuan Zhou, Fuzheng Zhang, Zhongxia Chen, Xing Xie,
  Guangzhong Sun","xDeepFM: Combining Explicit and Implicit Feature Interactions for
  Recommender Systems",10 pages,,10.1145/3219819.3220023,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Combinatorial features are essential for the success of many commercial
models. Manually crafting these features usually comes with high cost due to
the variety, volume and velocity of raw data in web-scale systems.
Factorization based models, which measure interactions in terms of vector
product, can learn patterns of combinatorial features automatically and
generalize to unseen features as well. With the great success of deep neural
networks (DNNs) in various fields, recently researchers have proposed several
DNN-based factorization model to learn both low- and high-order feature
interactions. Despite the powerful ability of learning an arbitrary function
from data, plain DNNs generate feature interactions implicitly and at the
bit-wise level. In this paper, we propose a novel Compressed Interaction
Network (CIN), which aims to generate feature interactions in an explicit
fashion and at the vector-wise level. We show that the CIN share some
functionalities with convolutional neural networks (CNNs) and recurrent neural
networks (RNNs). We further combine a CIN and a classical DNN into one unified
model, and named this new model eXtreme Deep Factorization Machine (xDeepFM).
On one hand, the xDeepFM is able to learn certain bounded-degree feature
interactions explicitly; on the other hand, it can learn arbitrary low- and
high-order feature interactions implicitly. We conduct comprehensive
experiments on three real-world datasets. Our results demonstrate that xDeepFM
outperforms state-of-the-art models. We have released the source code of
xDeepFM at \url{https://github.com/Leavingseason/xDeepFM}.
","[{'version': 'v1', 'created': 'Wed, 14 Mar 2018 09:13:16 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Mar 2018 07:37:35 GMT'}, {'version': 'v3', 'created': 'Wed, 30 May 2018 15:00:27 GMT'}]",2019-10-28,"[['Lian', 'Jianxun', ''], ['Zhou', 'Xiaohuan', ''], ['Zhang', 'Fuzheng', ''], ['Chen', 'Zhongxia', ''], ['Xie', 'Xing', ''], ['Sun', 'Guangzhong', '']]","['Factorization machines', 'neural network', 'recommender systems', 'deep learning', 'feature interactions']"
1842,1809.00626,Denis Efremov,"Denis Efremov, Mikhail Mandrykin, Alexey Khoroshilov",Deductive Verification of Unmodified Linux Kernel Library Functions,"18 pages, 2 tables, 6 listings. Accepted to ISoLA 2018 conference.
  Evaluating Tools for Software Verification track","Leveraging Applications of Formal Methods, Verification and
  Validation. Verification. ISoLA 2018. Lecture Notes in Computer Science, vol
  11245. pp 216-234. Springer, Cham",10.1007/978-3-030-03421-4_15,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents results from the development and evaluation of a
deductive verification benchmark consisting of 26 unmodified Linux kernel
library functions implementing conventional memory and string operations. The
formal contract of the functions was extracted from their source code and was
represented in the form of preconditions and postconditions. The correctness of
23 functions was completely proved using AstraVer toolset, although success for
11 functions was achieved using 2 new specification language constructs.
Another 2 functions were proved after a minor modification of their source
code, while the final one cannot be completely proved using the existing memory
model. The benchmark can be used for the testing and evaluation of deductive
verification tools and as a starting point for verifying other parts of the
Linux kernel.
","[{'version': 'v1', 'created': 'Mon, 3 Sep 2018 15:19:46 GMT'}]",2018-11-15,"[['Efremov', 'Denis', ''], ['Mandrykin', 'Mikhail', ''], ['Khoroshilov', 'Alexey', '']]","['formal verification', 'deductive verification', 'Linux kernel']"
1843,2007.02083,Gabriela Purri Rosas Gomes,"Gabriela Purri R. Gomes, Sydney Rubin, Leah I. Stein Duker, Donna
  Benton, Andreas Kratky, Sze Yu A Chen, Maryalice Jordan-Marsh, and Marientina
  Gotsis","Healing Spaces: Feasibility of a Multisensory Experience for Older
  Adults with Advanced Dementia and their Caregivers","PETRA 20: Proceedings of the 13th ACM International Conference on
  PErvasive Technologies Related to Assistive Environments. June 2020. Article
  No 24. Pages 1 to 9","2020. In Proceedings of the 13th ACM International Conference on
  PErvasive Technologies Related to Assistive Environments (PETRA 20).
  Association for Computing Machinery, New York, NY, USA, Article 24, 1 to 9",10.1145/3389189.3392607,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Healing Spaces proposes a new approach to multisensory interventions that
show potential in ameliorating the behavioral and psychological symptoms of
advanced dementia in older adults. Using smart technology, the project combines
both digital and physical components to transform spaces and create unified,
curated sensory experiences that provide meaningful context for interaction,
and are easy for caregivers to deliver. A usability study was conducted for the
Healing Spaces app followed by a feasibility evaluation of the full experience
in a memory care facility recruiting caregivers, and residents in advanced
stages of dementia. The feasibility evaluation successfully illuminated
strengths as well as areas for improvement for the Healing Spaces experience in
a memory care setting with older adults with advanced dementia. Caregivers and
facility managers expressed interest in continuing to use Healing Spaces with
the residents of the facility. Lessons learned about the technical and
logistical implementation of Healing Spaces are discussed, as well as future
directions for study design and potential therapeutic value of the experience.
","[{'version': 'v1', 'created': 'Sat, 4 Jul 2020 12:27:19 GMT'}]",2020-07-07,"[['Gomes', 'Gabriela Purri R.', ''], ['Rubin', 'Sydney', ''], ['Duker', 'Leah I. Stein', ''], ['Benton', 'Donna', ''], ['Kratky', 'Andreas', ''], ['Chen', 'Sze Yu A', ''], ['Jordan-Marsh', 'Maryalice', ''], ['Gotsis', 'Marientina', '']]","['User-centered design', 'smart environments', 'multisensory environments', 'caregiving', 'dementia', 'older adults', 'wellness']"
1844,1802.07569,German I. Parisi,"German I. Parisi, Ronald Kemker, Jose L. Part, Christopher Kanan,
  Stefan Wermter",Continual Lifelong Learning with Neural Networks: A Review,,,10.1016/j.neunet.2019.01.012.,,cs.LG q-bio.NC stat.ML,http://creativecommons.org/licenses/by-sa/4.0/,"  Humans and animals have the ability to continually acquire, fine-tune, and
transfer knowledge and skills throughout their lifespan. This ability, referred
to as lifelong learning, is mediated by a rich set of neurocognitive mechanisms
that together contribute to the development and specialization of our
sensorimotor skills as well as to long-term memory consolidation and retrieval.
Consequently, lifelong learning capabilities are crucial for autonomous agents
interacting in the real world and processing continuous streams of information.
However, lifelong learning remains a long-standing challenge for machine
learning and neural network models since the continual acquisition of
incrementally available information from non-stationary data distributions
generally leads to catastrophic forgetting or interference. This limitation
represents a major drawback for state-of-the-art deep neural network models
that typically learn representations from stationary batches of training data,
thus without accounting for situations in which information becomes
incrementally available over time. In this review, we critically summarize the
main challenges linked to lifelong learning for artificial learning systems and
compare existing neural network approaches that alleviate, to different
extents, catastrophic forgetting. We discuss well-established and emerging
research motivated by lifelong learning factors in biological systems such as
structural plasticity, memory replay, curriculum and transfer learning,
intrinsic motivation, and multisensory integration.
","[{'version': 'v1', 'created': 'Wed, 21 Feb 2018 13:53:35 GMT'}, {'version': 'v2', 'created': 'Sat, 7 Jul 2018 06:59:28 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Jan 2019 18:40:25 GMT'}, {'version': 'v4', 'created': 'Mon, 11 Feb 2019 01:28:39 GMT'}]",2019-02-12,"[['Parisi', 'German I.', ''], ['Kemker', 'Ronald', ''], ['Part', 'Jose L.', ''], ['Kanan', 'Christopher', ''], ['Wermter', 'Stefan', '']]","['Continual learning', 'lifelong learning', 'catastrophic forgetting', 'memoryconsolidation']"
1845,1311.5013,Srivatsan Sridharan,"Srivatsan Sridharan, Kausal Malladi, Yamini Muralitharan","Data Mining Model for the Data Retrieval from Central Server
  Configuration","9 Pages, 10 References, 6 Figures presented in ACITY 2013 Conference","International Journal of Computer Science & Information Technology
  (IJCSIT) Vol 5, No 5, October 2013",10.5121/ijcsit.2013.5514,,cs.IR cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A server, which is to keep track of heavy document traffic, is unable to
filter the documents that are most relevant and updated for continuous text
search queries. This paper focuses on handling continuous text extraction
sustaining high document traffic. The main objective is to retrieve recent
updated documents that are most relevant to the query by applying sliding
window technique. Our solution indexes the streamed documents in the main
memory with structure based on the principles of inverted file, and processes
document arrival and expiration events with incremental threshold-based method.
It also ensures elimination of duplicate document retrieval using unsupervised
duplicate detection. The documents are ranked based on user feedback and given
higher priority for retrieval.
","[{'version': 'v1', 'created': 'Wed, 20 Nov 2013 11:14:58 GMT'}]",2013-11-21,"[['Sridharan', 'Srivatsan', ''], ['Malladi', 'Kausal', ''], ['Muralitharan', 'Yamini', '']]","['Continuous Text Queries', 'MapReduce Technique', 'Sliding Window']"
1846,1701.05886,Martin Milani\v{c},"Didem G\""oz\""upek, Ademir Hujdurovi\'c, Martin Milani\v{c}","Characterizations of minimal dominating sets and the well-dominated
  property in lexicographic product graphs",,"Discrete Mathematics & Theoretical Computer Science, Vol. 19 no.
  1, Graph Theory (August 30, 2017) dmtcs:3865",10.23638/DMTCS-19-1-25,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A graph is said to be well-dominated if all its minimal dominating sets are
of the same size. The class of well-dominated graphs forms a subclass of the
well studied class of well-covered graphs. While the recognition problem for
the class of well-covered graphs is known to be co-NP-complete, the recognition
complexity of well-dominated graphs is open.
  In this paper we introduce the notion of an irreducible dominating set, a
variant of dominating set generalizing both minimal dominating sets and minimal
total dominating sets. Based on this notion, we characterize the family of
minimal dominating sets in a lexicographic product of two graphs and derive a
characterization of the well-dominated lexicographic product graphs. As a side
result motivated by this study, we give a polynomially testable
characterization of well-dominated graphs with domination number two, and show,
more generally, that well-dominated graphs can be recognized in polynomial time
in any class of graphs with bounded domination number. Our results include a
characterization of dominating sets in lexicographic product graphs, which
generalizes the expression for the domination number of such graphs following
from works of Zhang et al. (2011) and of \v{S}umenjak et al. (2012).
","[{'version': 'v1', 'created': 'Fri, 20 Jan 2017 18:38:46 GMT'}, {'version': 'v2', 'created': 'Sun, 19 Mar 2017 16:16:05 GMT'}, {'version': 'v3', 'created': 'Mon, 31 Jul 2017 08:14:13 GMT'}, {'version': 'v4', 'created': 'Fri, 18 Aug 2017 07:55:04 GMT'}]",2019-03-14,"[['Gözüpek', 'Didem', ''], ['Hujdurović', 'Ademir', ''], ['Milanič', 'Martin', '']]","['lexicographic product of graphs', 'minimal dominating set', 'well-dominated graph', 'irreducible dominatingset']"
1847,1701.04612,Rafael Pereira Pires,"Rafael Pires, Marcelo Pasin, Pascal Felber, Christof Fetzer",Secure Content-Based Routing Using Intel Software Guard Extensions,"Middleware '16 Trento, Italy - 10 pages",,10.1145/2988336.2988346,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Content-based routing (CBR) is a powerful model that supports scalable
asynchronous communication among large sets of geographically distributed
nodes. Yet, preserving privacy represents a major limitation for the wide
adoption of CBR, notably when the routers are located in public clouds. Indeed,
a CBR router must see the content of the messages sent by data producers, as
well as the filters (or subscriptions) registered by data consumers. This
represents a major deterrent for companies for which data is a key asset, as
for instance in the case of financial markets or to conduct sensitive
business-to-business transactions. While there exists some techniques for
privacy-preserving computation, they are either prohibitively slow or too
limited to be usable in real systems. In this paper, we follow a different
strategy by taking advantage of trusted hardware extensions that have just been
introduced in off-the-shelf processors and provide a trusted execution
environment. We exploit Intel's new software guard extensions (SGX) to
implement a CBR engine in a secure enclave. Thanks to the hardware-based
trusted execution environment (TEE), the compute-intensive CBR operations can
operate on decrypted data shielded by the enclave and leverage efficient
matching algorithms. Extensive experimental evaluation shows that SGX adds only
limited overhead to insecure plaintext matching outside secure enclaves while
providing much better performance and more powerful filtering capabilities than
alternative software-only solutions. To the best of our knowledge, this work is
the first to demonstrate the practical benefits of SGX for privacy-preserving
CBR.
","[{'version': 'v1', 'created': 'Tue, 17 Jan 2017 10:48:57 GMT'}]",2017-01-18,"[['Pires', 'Rafael', ''], ['Pasin', 'Marcelo', ''], ['Felber', 'Pascal', ''], ['Fetzer', 'Christof', '']]","['Content-based routing', 'publish/subscribe', 'security', 'privacy', 'SGX']"
1848,2102.10085,Yibo Yang,"Yibo Yang, Antoine Blanchard, Themistoklis Sapsis, Paris Perdikaris",Output-Weighted Sampling for Multi-Armed Bandits with Extreme Payoffs,"14 pages, 5 figures, 1 table",,10.1098/rspa.2021.0781,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new type of acquisition functions for online decision making in
multi-armed and contextual bandit problems with extreme payoffs. Specifically,
we model the payoff function as a Gaussian process and formulate a novel type
of upper confidence bound (UCB) acquisition function that guides exploration
towards the bandits that are deemed most relevant according to the variability
of the observed rewards. This is achieved by computing a tractable likelihood
ratio that quantifies the importance of the output relative to the inputs and
essentially acts as an \textit{attention mechanism} that promotes exploration
of extreme rewards. We demonstrate the benefits of the proposed methodology
across several synthetic benchmarks, as well as a realistic example involving
noisy sensor network data. Finally, we provide a JAX library for efficient
bandit optimization using Gaussian processes.
","[{'version': 'v1', 'created': 'Fri, 19 Feb 2021 18:36:03 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Oct 2021 22:19:58 GMT'}]",2022-10-12,"[['Yang', 'Yibo', ''], ['Blanchard', 'Antoine', ''], ['Sapsis', 'Themistoklis', ''], ['Perdikaris', 'Paris', '']]","['Scientific machine learning', 'Active learning', 'Uncertainty quantification', 'Bayesian statistics']"
1849,1405.6985,Waqar  Ahmed,"Waqar Ahmed, Osman Hasan, Sofiene Tahar, and Mohammad Salah Hamdi",Towards the Formal Reliability Analysis of Oil and Gas Pipelines,15 pages,"Intelligent Computer Mathematics, pp. 30-44. (Lecture Notes in
  Artificial Intelligence, 8543). Springer Berlin Heidelberg, 2014",10.1007/978-3-319-08434-3_4,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is customary to assess the reliability of underground oil and gas
pipelines in the presence of excessive loading and corrosion effects to ensure
a leak-free transport of hazardous materials. The main idea behind this
reliability analysis is to model the given pipeline system as a Reliability
Block Diagram (RBD) of segments such that the reliability of an individual
pipeline segment can be represented by a random variable. Traditionally,
computer simulation is used to perform this reliability analysis but it
provides approximate results and requires an enormous amount of CPU time for
attaining reasonable estimates. Due to its approximate nature, simulation is
not very suitable for analyzing safety-critical systems like oil and gas
pipelines, where even minor analysis flaws may result in catastrophic
consequences. As an accurate alternative, we propose to use a
higher-order-logic theorem prover (HOL) for the reliability analysis of
pipelines. As a first step towards this idea, this paper provides a
higher-order-logic formalization of reliability and the series RBD using the
HOL theorem prover. For illustration, we present the formal analysis of a
simple pipeline that can be modeled as a series RBD of segments with
exponentially distributed failure times.
","[{'version': 'v1', 'created': 'Mon, 26 May 2014 06:50:27 GMT'}]",2015-05-11,"[['Ahmed', 'Waqar', ''], ['Hasan', 'Osman', ''], ['Tahar', 'Sofiene', ''], ['Hamdi', 'Mohammad Salah', '']]","['Reliability Block Diagrams', 'Formal Methods', 'Theorem Proving', 'Oil and Gas pipeline']"
1850,2006.05096,Huaizheng Zhang,"Huaizheng Zhang, Yuanming Li, Yizheng Huang, Yonggang Wen, Jianxiong
  Yin and Kyle Guan",MLModelCI: An Automatic Cloud Platform for Efficient MLaaS,"4 pages, 4 figures","In Proceedings of the 28th ACM International Conference on
  Multimedia (2020) 4453-4456",10.1145/3394171.3414535,,cs.DC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  MLModelCI provides multimedia researchers and developers with a one-stop
platform for efficient machine learning (ML) services. The system leverages
DevOps techniques to optimize, test, and manage models. It also containerizes
and deploys these optimized and validated models as cloud services (MLaaS). In
its essence, MLModelCI serves as a housekeeper to help users publish models.
The models are first automatically converted to optimized formats for
production purpose and then profiled under different settings (e.g., batch size
and hardware). The profiling information can be used as guidelines for
balancing the trade-off between performance and cost of MLaaS. Finally, the
system dockerizes the models for ease of deployment to cloud environments. A
key feature of MLModelCI is the implementation of a controller, which allows
elastic evaluation which only utilizes idle workers while maintaining online
service quality. Our system bridges the gap between current ML training and
serving systems and thus free developers from manual and tedious work often
associated with service deployment. We release the platform as an open-source
project on GitHub under Apache 2.0 license, with the aim that it will
facilitate and streamline more large-scale ML applications and research
projects.
","[{'version': 'v1', 'created': 'Tue, 9 Jun 2020 07:48:20 GMT'}]",2020-12-16,"[['Zhang', 'Huaizheng', ''], ['Li', 'Yuanming', ''], ['Huang', 'Yizheng', ''], ['Wen', 'Yonggang', ''], ['Yin', 'Jianxiong', ''], ['Guan', 'Kyle', '']]","['Machine Learning', 'Deployment', 'Conversion', 'Profiling', 'Cloud']"
1851,1703.06934,William La Cava,William La Cava and Jason H. Moore,"Ensemble representation learning: an analysis of fitness and survival
  for wrapper-based genetic programming methods","Genetic and Evolutionary Computation Conference (GECCO) 2017, Berlin,
  Germany",,10.1145/3071178/3071215,,cs.NE cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently we proposed a general, ensemble-based feature engineering wrapper
(FEW) that was paired with a number of machine learning methods to solve
regression problems. Here, we adapt FEW for supervised classification and
perform a thorough analysis of fitness and survival methods within this
framework. Our tests demonstrate that two fitness metrics, one introduced as an
adaptation of the silhouette score, outperform the more commonly used Fisher
criterion. We analyze survival methods and demonstrate that $\epsilon$-lexicase
survival works best across our test problems, followed by random survival which
outperforms both tournament and deterministic crowding. We conduct a benchmark
comparison to several classification methods using a large set of problems and
show that FEW can improve the best classifier performance in several cases. We
show that FEW generates consistent, meaningful features for a biomedical
problem with different ML pairings.
","[{'version': 'v1', 'created': 'Mon, 20 Mar 2017 19:26:00 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Apr 2017 12:46:40 GMT'}, {'version': 'v3', 'created': 'Thu, 3 Aug 2017 19:01:17 GMT'}]",2017-08-07,"[['La Cava', 'William', ''], ['Moore', 'Jason H.', '']]","['feature engineering', 'representation learning', 'genetic programming', 'classifcation']"
1852,2107.07724,Marco Sampaio,"Ricardo Barata, Miguel Leite, Ricardo Pacheco, Marco O. P. Sampaio,
  Jo\~ao Tiago Ascens\~ao, Pedro Bizarro",Active learning for imbalanced data under cold start,"9 pages, 6 figures, 2 tables","ACM International Conference on AI in Finance, Nov 2021",,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Modern systems that rely on Machine Learning (ML) for predictive modelling,
may suffer from the cold-start problem: supervised models work well but,
initially, there are no labels, which are costly or slow to obtain. This
problem is even worse in imbalanced data scenarios, where labels of the
positive class take longer to accumulate. We propose an Active Learning (AL)
system for datasets with orders of magnitude of class imbalance, in a cold
start streaming scenario. We present a computationally efficient Outlier-based
Discriminative AL approach (ODAL) and design a novel 3-stage sequence of AL
labeling policies where ODAL is used as warm-up. Then, we perform empirical
studies in four real world datasets, with various magnitudes of class
imbalance. The results show that our method can more quickly reach a high
performance model than standard AL policies without ODAL warm-up. Its observed
gains over random sampling can reach 80% and be competitive with policies with
an unlimited annotation budget or additional historical data (using just 2% to
10% of the labels).
","[{'version': 'v1', 'created': 'Fri, 16 Jul 2021 06:49:20 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Oct 2021 13:09:05 GMT'}]",2021-10-25,"[['Barata', 'Ricardo', ''], ['Leite', 'Miguel', ''], ['Pacheco', 'Ricardo', ''], ['Sampaio', 'Marco O. P.', ''], ['Ascensão', 'João Tiago', ''], ['Bizarro', 'Pedro', '']]","['active learning', 'data streams', 'cold start', 'high class imbalance']"
1853,1603.05433,Przemys{\l}aw Gospodarczyk MSc.,"Przemys{\l}aw Gospodarczyk, Stanis{\l}aw Lewanowicz, Pawe{\l} Wo\'zny",Degree reduction of composite B\'ezier curves,,"Applied Mathematics and Computation 293, p. 40-48 (2017)",10.1016/j.amc.2016.08.004,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with the problem of multi-degree reduction of a composite
B\'ezier curve with the parametric continuity constraints at the endpoints of
the segments. We present a novel method which is based on the idea of using
constrained dual Bernstein polynomials to compute the control points of the
reduced composite curve. In contrast to other methods, ours minimizes the
$L_2$-error for the whole composite curve instead of minimizing the
$L_2$-errors for each segment separately. As a result, an additional
optimization is possible. Examples show that the new method gives much better
results than multiple application of the degree reduction of a single B\'ezier
curve.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2016 11:30:01 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Mar 2016 09:34:34 GMT'}]",2017-02-10,"[['Gospodarczyk', 'Przemysław', ''], ['Lewanowicz', 'Stanisław', ''], ['Woźny', 'Paweł', '']]","['Composite B´ezier curve', 'multi-degree reduction', 'parametric continuity constraints', 'least-squares approximation', 'constrained dual Bernstein basis']"
1854,1812.11145,Zeeshan Lakhani,Zeeshan Lakhani and Heather Miller,Checking-in on Network Functions,ANRW 2019 ~ https://irtf.org/anrw/2019/program.html,,10.1145/3340301.3341131,,cs.NI cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When programming network functions, changes within a packet tend to have
consequences---side effects which must be accounted for by network programmers
or administrators via arbitrary logic and an innate understanding of
dependencies. Examples of this include updating checksums when a packet's
contents has been modified or adjusting a payload length field of a IPv6 header
if another header is added or updated within a packet. While static-typing
captures interface specifications and how packet contents should behave, it
does not enforce precise invariants around runtime dependencies like the
examples above. Instead, during the design phase of network functions,
programmers should be given an easier way to specify checks up front, all
without having to account for and keep track of these consequences at each and
every step during the development cycle. In keeping with this view, we present
a unique approach for adding and generating both static checks and dynamic
contracts for specifying and checking packet processing operations. We develop
our technique within an existing framework called NetBricks and demonstrate how
our approach simplifies and checks common dependent packet and header
processing logic that other systems take for granted, all without adding much
overhead during development.
","[{'version': 'v1', 'created': 'Fri, 28 Dec 2018 18:20:55 GMT'}, {'version': 'v2', 'created': 'Sat, 29 Jun 2019 04:34:04 GMT'}]",2019-07-02,"[['Lakhani', 'Zeeshan', ''], ['Miller', 'Heather', '']]","['network functions', 'design-by-contract', 'software verification']"
1855,1001.4499,Tom\'a\v{s} Vina\v{r},"Michal N\'an\'asi, Tom\'a\v{s} Vina\v{r}, Bro\v{n}a Brejov\'a","The Highest Expected Reward Decoding for HMMs with Application to
  Recombination Detection",,,10.1007/978-3-642-13509-5_16,,cs.DS q-bio.GN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hidden Markov models are traditionally decoded by the Viterbi algorithm which
finds the highest probability state path in the model. In recent years, several
limitations of the Viterbi decoding have been demonstrated, and new algorithms
have been developed to address them
\citep{Kall2005,Brejova2007,Gross2007,Brown2010}.
  In this paper, we propose a new efficient highest expected reward decoding
algorithm (HERD) that allows for uncertainty in boundaries of individual
sequence features. We demonstrate usefulness of our approach on jumping HMMs
for recombination detection in viral genomes.
","[{'version': 'v1', 'created': 'Mon, 25 Jan 2010 17:53:43 GMT'}]",2013-08-06,"[['Nánási', 'Michal', ''], ['Vinař', 'Tomáš', ''], ['Brejová', 'Broňa', '']]","['hidden Markov models', 'decoding algorithms', 'recombination detection', 'jumping HMMs']"
1856,1911.10081,Taha Ceritli,"Taha Ceritli, Christopher K. I. Williams, James Geddes",ptype: Probabilistic Type Inference,,Data Mining and Knowledge Discovery (2020),10.1007/s10618-020-00680-1,,cs.LG cs.PL stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Type inference refers to the task of inferring the data type of a given
column of data. Current approaches often fail when data contains missing data
and anomalies, which are found commonly in real-world data sets. In this paper,
we propose ptype, a probabilistic robust type inference method that allows us
to detect such entries, and infer data types. We further show that the proposed
method outperforms the existing methods.
","[{'version': 'v1', 'created': 'Fri, 22 Nov 2019 15:21:15 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Mar 2020 12:25:40 GMT'}]",2020-03-24,"[['Ceritli', 'Taha', ''], ['Williams', 'Christopher K. I.', ''], ['Geddes', 'James', '']]","['Type inference', 'Robustness', 'Probabilistic Finite-State Machine']"
1857,1902.02597,Adrien Lagrange,"Adrien Lagrange, Mathieu Fauvel, St\'ephane May, Jos\'e Bioucas-Dias
  and Nicolas Dobigeon","Matrix Cofactorization for Joint Representation Learning and Supervised
  Classification -- Application to Hyperspectral Image Analysis",,,10.1016/j.neucom.2019.12.068,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Supervised classification and representation learning are two widely used
classes of methods to analyze multivariate images. Although complementary,
these methods have been scarcely considered jointly in a hierarchical modeling.
In this paper, a method coupling these two approaches is designed using a
matrix cofactorization formulation. Each task is modeled as a factorization
matrix problem and a term relating both coding matrices is then introduced to
drive an appropriate coupling. The link can be interpreted as a clustering
operation over a low-dimensional representation vectors. The attribution
vectors of the clustering are then used as features vectors for the
classification task, i.e., the coding vectors of the corresponding
factorization problem. A proximal gradient descent algorithm, ensuring
convergence to a critical point of the objective function, is then derived to
solve the resulting non-convex non-smooth optimization problem. An evaluation
of the proposed method is finally conducted both on synthetic and real data in
the specific context of hyperspectral image interpretation, unifying two
standard analysis techniques, namely unmixing and classification.
","[{'version': 'v1', 'created': 'Thu, 7 Feb 2019 12:54:56 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Jun 2019 09:28:56 GMT'}, {'version': 'v3', 'created': 'Thu, 30 Jan 2020 18:40:04 GMT'}, {'version': 'v4', 'created': 'Thu, 13 Feb 2020 18:53:51 GMT'}]",2020-02-14,"[['Lagrange', 'Adrien', ''], ['Fauvel', 'Mathieu', ''], ['May', 'Stéphane', ''], ['Bioucas-Dias', 'José', ''], ['Dobigeon', 'Nicolas', '']]","['Image interpretation', 'supervised learning', 'representation learning', 'hyperspectral images', 'non-convex optimization', 'matrix cofactorization']"
1858,1809.09942,Benjamin Wassermann,"Benjamin Wassermann, Tino Bog, Stefan Kollmannsberger, and Ernst Rank","A design-through-analysis approach using the Finite Cell Method (ECCOMAS
  Congress 2016)","ECCOMAS Congress 2016, Crete, Greece",Eccomas Proceedia 1984 (2016) 2601-2613,10.7712/100016.1984.8920,,cs.CE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Modern 3D Computer-Aided-Design (CAD) systems use mainly two types of
geometric models. Classically, objects are defined by a Boundary Representation
(B-Rep), where only the objects' surfaces with their corresponding edges and
nodes are stored. One disadvantage concerning a numerical simulation is that
B-Rep models are not necessarily watertight. These 'dirty geometries' cause
major difficulties in computational analysis because even basic geometric
operations such as point-in-membership tests fail, not to mention meshing as
required by classical boundary conforming finite element methods.
Alternatively, objects may be represented by Constructive Solid Geometry (CSG),
which is strongly related to Procedural Modeling (PM). In this context, the
model is created using Boolean operations on primitives. The modeling process
is then either stored as a sequence (PM), or as a construction tree (CSG). In
contrast to B-Rep models, CSG models are intrinsically water-tight. To run a
finite element simulation on a water-tight CSG model, two alternatives are
possible: (i) it can either be converted to a B-Rep-model to obtain a finite
element mesh or (ii) its implicit description can be used directly by applying
an embedded domain approach, like the Finite Cell Method (FCM). In this
contribution, we present a design-through analysis methodology using CSG and
FCM. A crucial point in FCM is a fast and reliable point-in-membership test
which can be directly derived from the CSG model. We present the outline of the
modeling approach, the realization of the point-in-membership test as a
sequence of CSG-operations, and discuss advantages and limitations on complex
models of relevance in mechanical engineering.
","[{'version': 'v1', 'created': 'Wed, 26 Sep 2018 12:41:09 GMT'}]",2018-09-27,"[['Wassermann', 'Benjamin', ''], ['Bog', 'Tino', ''], ['Kollmannsberger', 'Stefan', ''], ['Rank', 'Ernst', '']]","['Constructive Solid Geometry', 'CSG', 'Finite Cell Method', 'FCM', 'Point-in-membershiptest']"
1859,1810.11491,Alexander Fabisch,Alexander Fabisch,"Empirical Evaluation of Contextual Policy Search with a Comparison-based
  Surrogate Model and Active Covariance Matrix Adaptation","Supplementary material for poster paper accepted at GECCO 2019;
  https://doi.org/10.1145/3319619.3321935",,10.1145/3319619.3321935,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Contextual policy search (CPS) is a class of multi-task reinforcement
learning algorithms that is particularly useful for robotic applications. A
recent state-of-the-art method is Contextual Covariance Matrix Adaptation
Evolution Strategies (C-CMA-ES). It is based on the standard black-box
optimization algorithm CMA-ES. There are two useful extensions of CMA-ES that
we will transfer to C-CMA-ES and evaluate empirically: ACM-ES, which uses a
comparison-based surrogate model, and aCMA-ES, which uses an active update of
the covariance matrix. We will show that improvements with these methods can be
impressive in terms of sample-efficiency, although this is not relevant any
more for the robotic domain.
","[{'version': 'v1', 'created': 'Fri, 26 Oct 2018 18:35:27 GMT'}, {'version': 'v2', 'created': 'Sun, 14 Apr 2019 21:20:16 GMT'}]",2019-04-16,"[['Fabisch', 'Alexander', '']]","['multi-task learning', 'policy search', 'black-box optimization']"
1860,2109.11243,Yin Zhao,"Xun Gao, Yin Zhao, Jie Zhang, Longjun Cai","Pairwise Emotional Relationship Recognition in Drama Videos: Dataset and
  Benchmark",,ACM MM 2021,10.1145/3474085.3475493,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recognizing the emotional state of people is a basic but challenging task in
video understanding. In this paper, we propose a new task in this field, named
Pairwise Emotional Relationship Recognition (PERR). This task aims to recognize
the emotional relationship between the two interactive characters in a given
video clip. It is different from the traditional emotion and social relation
recognition task. Varieties of information, consisting of character appearance,
behaviors, facial emotions, dialogues, background music as well as subtitles
contribute differently to the final results, which makes the task more
challenging but meaningful in developing more advanced multi-modal models. To
facilitate the task, we develop a new dataset called Emotional RelAtionship of
inTeractiOn (ERATO) based on dramas and movies. ERATO is a large-scale
multi-modal dataset for PERR task, which has 31,182 video clips, lasting about
203 video hours. Different from the existing datasets, ERATO contains
interaction-centric videos with multi-shots, varied video length, and multiple
modalities including visual, audio and text. As a minor contribution, we
propose a baseline model composed of Synchronous Modal-Temporal Attention
(SMTA) unit to fuse the multi-modal information for the PERR task. In contrast
to other prevailing attention mechanisms, our proposed SMTA can steadily
improve the performance by about 1\%. We expect the ERATO as well as our
proposed SMTA to open up a new way for PERR task in video understanding and
further improve the research of multi-modal fusion methodology.
","[{'version': 'v1', 'created': 'Thu, 23 Sep 2021 09:35:18 GMT'}]",2021-09-24,"[['Gao', 'Xun', ''], ['Zhao', 'Yin', ''], ['Zhang', 'Jie', ''], ['Cai', 'Longjun', '']]","['Dataset', 'Emotional relationship', 'Multi-Modal Learning', 'ModalTemporal Attention']"
1861,1809.00634,Christoph Matthies,"Christoph Matthies, Thomas Kowark, Keven Richly, Matthias Uflacker,
  Hasso Plattner","ScrumLint: Identifying Violations of Agile Practices Using Development
  Artifacts",,"Proceedings of the 9th International Workshop on Cooperative and
  Human Aspects of Software Engineering (CHASE '16). 2016, ACM, New York, NY,
  USA, 40-43",10.1145/2897586.2897602,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linting tools automatically identify source code fragments that do not follow
a set of predefined standards. Such feedback tools are equally desirable for
""linting"" agile development processes. However, providing concrete feedback on
process conformance is a challenging task, due to the intentional lack of
formal agile process models. In this paper, we present ScrumLint, a tool that
tackles this issue by analyzing development artifacts. On the basis of
experiences with an undergraduate agile software engineering course, we defined
a collection of process metrics. These contain the core ideas of agile methods
and report deviations. Using this approach, development teams receive immediate
feedback on their executed development practices. They can use this knowledge
to improve their workflows, or can adapt the metrics to better reflect their
project reality.
","[{'version': 'v1', 'created': 'Mon, 3 Sep 2018 15:59:38 GMT'}]",2018-09-05,"[['Matthies', 'Christoph', ''], ['Kowark', 'Thomas', ''], ['Richly', 'Keven', ''], ['Uflacker', 'Matthias', ''], ['Plattner', 'Hasso', '']]","['Scrum', 'Software engineering', 'Process metrics', 'Process conformance']"
1862,1703.00132,Wei Fu,"Wei Fu, Tim Menzies",Revisiting Unsupervised Learning for Defect Prediction,"11 pages, 5 figures. Accepted at FSE2017",,10.1145/3106237.3106257,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Collecting quality data from software projects can be time-consuming and
expensive. Hence, some researchers explore ""unsupervised"" approaches to quality
prediction that does not require labelled data. An alternate technique is to
use ""supervised"" approaches that learn models from project data labelled with,
say, ""defective"" or ""not-defective"". Most researchers use these supervised
models since, it is argued, they can exploit more knowledge of the projects.
  At FSE'16, Yang et al. reported startling results where unsupervised defect
predictors outperformed supervised predictors for effort-aware just-in-time
defect prediction. If confirmed, these results would lead to a dramatic
simplification of a seemingly complex task (data mining) that is widely
explored in the software engineering literature.
  This paper repeats and refutes those results as follows. (1) There is much
variability in the efficacy of the Yang et al. predictors so even with their
approach, some supervised data is required to prune weaker predictors away.
(2)Their findings were grouped across $N$ projects. When we repeat their
analysis on a project-by-project basis, supervised predictors are seen to work
better.
  Even though this paper rejects the specific conclusions of Yang et al., we
still endorse their general goal. In our our experiments, supervised predictors
did not perform outstandingly better than unsupervised ones for effort-aware
just-in-time defect prediction. Hence, they may indeed be some combination of
unsupervised learners to achieve comparable performance to supervised ones. We
therefore encourage others to work in this promising area.
","[{'version': 'v1', 'created': 'Wed, 1 Mar 2017 04:36:06 GMT'}, {'version': 'v2', 'created': 'Sat, 24 Jun 2017 17:00:52 GMT'}]",2017-06-27,"[['Fu', 'Wei', ''], ['Menzies', 'Tim', '']]","['Data analytics for sofware engineering', 'sofware repository mining', 'empirical studies', 'defect prediction']"
1863,1604.02167,W{\l}odzimierz Moczurad,W{\l}odzimierz Moczurad,"Decidability of multiset, set and numerically decipherable directed
  figure codes","Preliminary, short version of this paper appeared in IWOCA 2012
  proceedings volume as M. Kolarz and W. Moczurad, Multiset, set and
  numerically decipherable codes over directed figures, in Springer's LNCS vol.
  7643, pp. 224-235","Discrete Mathematics & Theoretical Computer Science, Vol. 19 no.
  1, Automata, Logic and Semantics (May 3, 2017) dmtcs:3301",10.23638/DMTCS-19-1-11,,cs.FL,http://creativecommons.org/licenses/by/4.0/,"  Codes with various kinds of decipherability, weaker than the usual unique
decipherability, have been studied since multiset decipherability was
introduced in mid-1980s. We consider decipherability of directed figure codes,
where directed figures are defined as labelled polyominoes with designated
start and end points, equipped with catenation operation that may use a merging
function to resolve possible conflicts. This is one of possible extensions
generalizing words and variable-length codes to planar structures. Here,
verification whether a given set is a code is no longer decidable in general.
We study the decidability status of figure codes depending on catenation type
(with or without a merging function), decipherability kind (unique, multiset,
set or numeric) and code geometry (several classes determined by relative
positions of start and end points of figures). We give decidability or
undecidability proofs in all but two cases that remain open.
","[{'version': 'v1', 'created': 'Thu, 7 Apr 2016 20:22:27 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Jan 2017 13:31:18 GMT'}, {'version': 'v3', 'created': 'Tue, 2 May 2017 16:51:25 GMT'}]",2019-03-14,"[['Moczurad', 'Włodzimierz', '']]","['directed figures', 'uniquely decipherable codes', 'multiset decipherable codes', 'decipherability verification']"
1864,1007.5133,Secretary  Ijaia,"Ming-Chang Lee (1) and Chang To (2) ((1) Fooyin University, Taiwan and
  (2) Shu-Te University, Taiwan)","Comparison of Support Vector Machine and Back Propagation Neural Network
  in Evaluating the Enterprise Financial Distress","13 pages, 1 figure","International Journal of Artificial Intelligence & Applications
  1.3 (2010) 31-43",10.5121/ijaia.2010.1303,,cs.LG,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Recently, applying the novel data mining techniques for evaluating enterprise
financial distress has received much research alternation. Support Vector
Machine (SVM) and back propagation neural (BPN) network has been applied
successfully in many areas with excellent generalization results, such as rule
extraction, classification and evaluation. In this paper, a model based on SVM
with Gaussian RBF kernel is proposed here for enterprise financial distress
evaluation. BPN network is considered one of the simplest and are most general
methods used for supervised training of multilayered neural network. The
comparative results show that through the difference between the performance
measures is marginal; SVM gives higher precision and lower error rates.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2010 07:36:49 GMT'}]",2010-07-30,"[['Lee', 'Ming-Chang', ''], ['To', 'Chang', '']]","['Enterprise Financial Distress', 'Support Vector Machines', 'Back-Propagation Neural Network', 'Gaussian']"
1865,1804.07204,Vishal Sharma,"Vishal Sharma, Gaurav Choudhary, Ilsun You, Jae Deok Lim, Jeong Nyeo
  Kim","Self-enforcing Game Theory-based Resource Allocation for LoRaWAN
  Assisted Public Safety Communications","16 Pages, 11 Figures, 2 Tables",Journal of Internet Technology Volume 19 (2018) No.2,10.3966/160792642018031902020,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Public safety networks avail to disseminate information during emergency
situations through its dedicated servers. Public safety networks accommodate
public safety communication (PSC) applications to track the location of its
utilizers and enable to sustain transmissions even in the crucial scenarios.
Despite that, if the traditional setups responsible for PSCs are unavailable,
it becomes prodigiously arduous to handle any of the safety applications, which
may cause havoc in the society. Dependence on a secondary network may assist to
solve such an issue. But, the secondary networks should be facilely deployable
and must not cause exorbitant overheads in terms of cost and operation. For
this, LoRaWAN can be considered as an ideal solution as it provides low power
and long-range communication. However, an excessive utilization of the
secondary network may result in high depletion of its own resources and can
lead to a complete shutdown of services, which is a quandary at hand. As a
solution, this paper proposes a novel network model via a combination of
LoRaWAN and traditional public safety networks, and uses a self-enforcing
agreement based game theory for allocating resources efficiently amongst the
available servers. The proposed approach adopts memory and energy constraints
as agreements, which are satisfied through Nash equilibrium. The numerical
results show that the proposed approach is capable of efficiently allocating
the resources with sufficiently high gains for resource conservation, network
sustainability, resource restorations and probability to continue at the
present conditions even in the complete absence of traditional Access Points
(APs) compared with a baseline scenario with no failure of nodes.
","[{'version': 'v1', 'created': 'Thu, 19 Apr 2018 14:56:01 GMT'}]",2018-04-20,"[['Sharma', 'Vishal', ''], ['Choudhary', 'Gaurav', ''], ['You', 'Ilsun', ''], ['Lim', 'Jae Deok', ''], ['Kim', 'Jeong Nyeo', '']]","['LoRaWAN', 'Public safety networks', 'Resource allocations', 'Energy efficient', 'Game theory']"
1866,1812.00548,Joseph Bullock,"Joseph Bullock, Carolina Cuesta-Lazaro, Arnau Quera-Bofarull","XNet: A convolutional neural network (CNN) implementation for medical
  X-Ray image segmentation suitable for small datasets","11 pages, 5 figures, 2 tables","Proc. SPIE 10953, Medical Imaging 2019: Biomedical Applications in
  Molecular, Structural, and Functional Imaging, 109531Z (15 March 2019)",10.1117/12.2512451,,cs.CV cs.AI physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  X-Ray image enhancement, along with many other medical image processing
applications, requires the segmentation of images into bone, soft tissue, and
open beam regions. We apply a machine learning approach to this problem,
presenting an end-to-end solution which results in robust and efficient
inference. Since medical institutions frequently do not have the resources to
process and label the large quantity of X-Ray images usually needed for neural
network training, we design an end-to-end solution for small datasets, while
achieving state-of-the-art results. Our implementation produces an overall
accuracy of 92%, F1 score of 0.92, and an AUC of 0.98, surpassing classical
image processing techniques, such as clustering and entropy based methods,
while improving upon the output of existing neural networks used for
segmentation in non-medical contexts. The code used for this project is
available online.
","[{'version': 'v1', 'created': 'Mon, 3 Dec 2018 04:17:27 GMT'}, {'version': 'v2', 'created': 'Sat, 20 Apr 2019 10:22:52 GMT'}]",2019-04-23,"[['Bullock', 'Joseph', ''], ['Cuesta-Lazaro', 'Carolina', ''], ['Quera-Bofarull', 'Arnau', '']]","['X-Ray image segmentation', 'medical image processing', 'machine learning']"
1867,1607.00973,Eran Treister,Eran Treister and Eldad Haber,A fast marching algorithm for the factored eikonal equation,,,10.1016/j.jcp.2016.08.012,,cs.CE cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The eikonal equation is instrumental in many applications in several fields
ranging from computer vision to geoscience. This equation can be efficiently
solved using the iterative Fast Sweeping (FS) methods and the direct Fast
Marching (FM) methods. However, when used for a point source, the original
eikonal equation is known to yield inaccurate numerical solutions, because of a
singularity at the source. In this case, the factored eikonal equation is often
preferred, and is known to yield a more accurate numerical solution. One
application that requires the solution of the eikonal equation for point
sources is travel time tomography. This inverse problem may be formulated using
the eikonal equation as a forward problem. While this problem has been solved
using FS in the past, the more recent choice for applying it involves FM
methods because of the efficiency in which sensitivities can be obtained using
them. However, while several FS methods are available for solving the factored
equation, the FM method is available only for the original eikonal equation.
  In this paper we develop a Fast Marching algorithm for the factored eikonal
equation, using both first and second order finite-difference schemes. Our
algorithm follows the same lines as the original FM algorithm and requires the
same computational effort. In addition, we show how to obtain sensitivities
using this FM method and apply travel time tomography, formulated as an inverse
factored eikonal equation. Numerical results in two and three dimensions show
that our algorithm solves the factored eikonal equation efficiently, and
demonstrate the achieved accuracy for computing the travel time. We also
demonstrate a recovery of a 2D and 3D heterogeneous medium by travel time
tomography using the eikonal equation for forward modelling and inversion by
Gauss-Newton.
","[{'version': 'v1', 'created': 'Mon, 4 Jul 2016 17:46:45 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Aug 2016 20:25:50 GMT'}, {'version': 'v3', 'created': 'Sat, 27 Aug 2016 09:32:09 GMT'}]",2016-08-30,"[['Treister', 'Eran', ''], ['Haber', 'Eldad', '']]","['eikonal equation', 'Factored eikonal equation', 'Fast Marching', 'First arrival', 'Travel TimeTomography', 'Gauss Newton', 'Seismic imaging']"
1868,1903.09522,Fabio Calefato,"Fabio Calefato, Filippo Lanubile, Nicole Novielli","An empirical assessment of best-answer prediction models in technical
  Q&A sites",,Empirical Software Engineering (2019) 24:854-901,10.1007/s10664-018-9642-5,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Technical Q&A sites have become essential for software engineers as they
constantly seek help from other experts to solve their work problems. Despite
their success, many questions remain unresolved, sometimes because the asker
does not acknowledge any helpful answer. In these cases, an information seeker
can only browse all the answers within a question thread to assess their
quality as potential solutions. We approach this time-consuming problem as a
binary-classification task where a best-answer prediction model is built to
identify the accepted answer among those within a resolved question thread, and
the candidate solutions to those questions that have received answers but are
still unresolved. In this paper, we report on a study aimed at assessing 26
best-answer prediction models in two steps. First, we study how models perform
when predicting best answers in Stack Overflow, the most popular Q&A site for
software engineers. Then, we assess performance in a cross-platform setting
where the prediction models are trained on Stack Overflow and tested on other
technical Q&A sites. Our findings show that the choice of the classifier and
automated parameter tuning have a large impact on the prediction of the best
answer. We also demonstrate that our approach to the best-answer prediction
problem is generalizable across technical Q&A sites. Finally, we provide
practical recommendations to Q&A platform designers to curate and preserve the
crowdsourced knowledge shared through these sites.
","[{'version': 'v1', 'created': 'Fri, 22 Mar 2019 14:19:04 GMT'}]",2019-03-25,"[['Calefato', 'Fabio', ''], ['Lanubile', 'Filippo', ''], ['Novielli', 'Nicole', '']]","['Cross-platform prediction', 'Q&a', 'Stack overflow', 'Crowdsourcing', 'Knowledgesharing']"
1869,1209.3117,Khurram Naim Shamsi,"Khurram Naim Shamsi, Zafar Iqbal Khan",Development of an e-learning system incorporating semantic web,"4 pages, 2 figures, published at International Journal of Research in
  Computer Science","International Journal of Research in Computer Science, 2 (5): pp.
  11-14, 2012",10.7815/ijorcs.25.2012.042,,cs.CY cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  E-Learning is efficient, task relevant and just-in-time learning grown from
the learning requirements of the new and dynamically changing world. The term
Semantic Web covers the steps to create a new WWW architecture that augments
the content with formal semantics enabling better possibilities of navigation
through the cyberspace and its contents. In this paper, we present the Semantic
Web-Based model for our e-learning system taking into account the learning
environment at Saudi Arabian universities. The proposed system is mainly based
on ontology-based descriptions of content, context and structure of the
learning materials. It further provides flexible and personalized access to
these learning materials. The framework has been validated by an interview
based qualitative method.
","[{'version': 'v1', 'created': 'Fri, 14 Sep 2012 08:01:50 GMT'}]",2012-09-17,"[['Shamsi', 'Khurram Naim', ''], ['Khan', 'Zafar Iqbal', '']]","['E-learning', 'Learning Objects', 'Ontology', 'RDF', 'Semantic Web', 'Software Agents']"
1870,1812.01375,Xiaoguang Lin,"Lin Xiaoguang, Yang Yong, Zhang Ju",Design and implementation of smart cooking based on amazon echo,"9 pages, 3 figures, 2 tables",IJSCAI 4 (2018) 37-45,10.5121/ijscai.2018.7403,,cs.CY cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smart cooking based on Amazon Echo uses the internet of things and cloud
computing to assist in cooking food. People may speak to Amazon Echo during the
cooking in order to get the information and situation of the cooking. Amazon
Echo recognizes what people say, then transfers the information to the cloud
services, and speaks to people the results that cloud services make by querying
the embedded cooking knowledge and achieving the information of intelligent
kitchen devices online. An intelligent food thermometer and its mobile
application are well-designed and implemented to monitor the temperature of
cooking food.
","[{'version': 'v1', 'created': 'Tue, 4 Dec 2018 12:38:07 GMT'}]",2018-12-05,"[['Xiaoguang', 'Lin', ''], ['Yong', 'Yang', ''], ['Ju', 'Zhang', '']]","['Smart Cooking', 'Things of Internet', 'Cloud Services', 'Smart Home']"
1871,1406.6937,Diego Hollmann,Diego A. Hollmann and Maximiliano Cristi\'a and Claudia Frydman,"A Family of Simulation Criteria to Guide DEVS Models Validation
  Rigorously, Systematically and Semi-Automatically",,,10.1016/j.simpat.2014.07.003,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The most common method to validate a DEVS model against the requirements is
to simulate it several times under different conditions, with some simulation
tool. The behavior of the model is compared with what the system is supposed to
do. The number of different scenarios to simulate is usually infinite,
therefore, selecting them becomes a crucial task. This selection, actually, is
made following the experience or intuition of an engineer. Here we present a
family of criteria to conduct DEVS model simulations in a disciplined way and
covering the most significant simulations to increase the confidence on the
model. This is achieved by analyzing the mathematical representation of the
DEVS model and, thus, part of the validation process can be automatized.
","[{'version': 'v1', 'created': 'Thu, 26 Jun 2014 16:28:56 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Jun 2014 12:57:00 GMT'}]",2015-04-10,"[['Hollmann', 'Diego A.', ''], ['Cristiá', 'Maximiliano', ''], ['Frydman', 'Claudia', '']]","['Model Validation', 'DEVS', 'Discrete Event Simulation', 'Simulation Criteria', 'Software Engineering']"
1872,1901.11341,Fabian Isensee,"Fabian Isensee, Marianne Schell, Irada Tursunova, Gianluca Brugnara,
  David Bonekamp, Ulf Neuberger, Antje Wick, Heinz-Peter Schlemmer, Sabine
  Heiland, Wolfgang Wick, Martin Bendszus, Klaus Hermann Maier-Hein, Philipp
  Kickingereder","Automated brain extraction of multi-sequence MRI using artificial neural
  networks","Fabian Isensee, Marianne Schell and Irada Tursunova share the first
  authorship",Hum Brain Mapp. 2019; 1-13,10.1002/hbm.24750,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Brain extraction is a critical preprocessing step in the analysis of MRI
neuroimaging studies and influences the accuracy of downstream analyses. The
majority of brain extraction algorithms are, however, optimized for processing
healthy brains and thus frequently fail in the presence of pathologically
altered brain or when applied to heterogeneous MRI datasets. Here we introduce
a new, rigorously validated algorithm (termed HD-BET) relying on artificial
neural networks that aims to overcome these limitations. We demonstrate that
HD-BET outperforms six popular, publicly available brain extraction algorithms
in several large-scale neuroimaging datasets, including one from a prospective
multicentric trial in neuro-oncology, yielding state-of-the-art performance
with median improvements of +1.16 to +2.11 points for the DICE coefficient and
-0.66 to -2.51 mm for the Hausdorff distance. Importantly, the HD-BET algorithm
shows robust performance in the presence of pathology or treatment-induced
tissue alterations, is applicable to a broad range of MRI sequence types and is
not influenced by variations in MRI hardware and acquisition parameters
encountered in both research and clinical practice. For broader accessibility
our HD-BET prediction algorithm is made freely available
(http://www.neuroAI-HD.org) and may become an essential component for robust,
automated, high-throughput processing of MRI neuroimaging data.
","[{'version': 'v1', 'created': 'Thu, 31 Jan 2019 13:10:39 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Aug 2019 13:52:57 GMT'}]",2019-08-21,"[['Isensee', 'Fabian', ''], ['Schell', 'Marianne', ''], ['Tursunova', 'Irada', ''], ['Brugnara', 'Gianluca', ''], ['Bonekamp', 'David', ''], ['Neuberger', 'Ulf', ''], ['Wick', 'Antje', ''], ['Schlemmer', 'Heinz-Peter', ''], ['Heiland', 'Sabine', ''], ['Wick', 'Wolfgang', ''], ['Bendszus', 'Martin', ''], ['Maier-Hein', 'Klaus Hermann', ''], ['Kickingereder', 'Philipp', '']]","['neuroimaging', 'brain extraction', 'skull stripping', 'artificial neural networks']"
1873,1602.00831,Paul Issartel,"Paul Issartel (LIMSI), Florimond Gu\'eniat (FSU), Sabine Coquillart
  (PRIMA), Mehdi Ammi (LIMSI)","Perceiving Mass in Mixed Reality through Pseudo-Haptic Rendering of
  Newton's Third Law",,,10.1109/VR.2015.7223322,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In mixed reality, real objects can be used to interact with virtual objects.
However, unlike in the real world, real objects do not encounter any opposite
reaction force when pushing against virtual objects. The lack of reaction force
during manipulation prevents users from perceiving the mass of virtual objects.
Although this could be addressed by equipping real objects with force-feedback
devices, such a solution remains complex and impractical.In this work, we
present a technique to produce an illusion of mass without any active
force-feedback mechanism. This is achieved by simulating the effects of this
reaction force in a purely visual way. A first study demonstrates that our
technique indeed allows users to differentiate light virtual objects from heavy
virtual objects. In addition, it shows that the illusion is immediately
effective, with no prior training. In a second study, we measure the lowest
mass difference (JND) that can be perceived with this technique. The
effectiveness and ease of implementation of our solution provides an
opportunity to enhance mixed reality interaction at no additional cost.
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2016 08:53:44 GMT'}]",2016-02-03,"[['Issartel', 'Paul', '', 'LIMSI'], ['Guéniat', 'Florimond', '', 'FSU'], ['Coquillart', 'Sabine', '', 'PRIMA'], ['Ammi', 'Mehdi', '', 'LIMSI']]","['Mass Perception', 'Physically-Based Simulation', 'MixedReality', 'Pseudo-Haptics']"
1874,1510.07026,Heejin Ahn,Heejin Ahn and Domitilla Del Vecchio,"Semi-autonomous Intersection Collision Avoidance through Job-shop
  Scheduling",Submitted to Hybrid Systems: Computation and Control (HSCC) 2016,,10.1145/2883817.2883830,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we design a supervisor to prevent vehicle collisions at
intersections. An intersection is modeled as an area containing multiple
conflict points where vehicle paths cross in the future. At every time step,
the supervisor determines whether there will be more than one vehicle in the
vicinity of a conflict point at the same time. If there is, then an impending
collision is detected, and the supervisor overrides the drivers to avoid
collision. A major challenge in the design of a supervisor as opposed to an
autonomous vehicle controller is to verify whether future collisions will occur
based on the current drivers choices. This verification problem is particularly
hard due to the large number of vehicles often involved in intersection
collision, to the multitude of conflict points, and to the vehicles dynamics.
In order to solve the verification problem, we translate the problem to a
job-shop scheduling problem that yields equivalent answers. The job-shop
scheduling problem can, in turn, be transformed into a mixed-integer linear
program when the vehicle dynamics are first-order dynamics, and can thus be
solved by using a commercial solver.
","[{'version': 'v1', 'created': 'Fri, 23 Oct 2015 19:41:50 GMT'}]",2016-12-09,"[['Ahn', 'Heejin', ''], ['Del Vecchio', 'Domitilla', '']]","['Intersection collision avoidance', 'multi-vehicle control', 'supervisory control', 'collision detection', 'verification', 'scheduling']"
1875,1504.06203,Loredana Tec,"Flavio Ferrarotti, Klaus-Dieter Schewe, Loredana Tec and Qing Wang","A New Thesis concerning Synchronised Parallel Computing - Simplified
  Parallel ASM Thesis",,"Theoretical Computer Science, 2016, Volume 649, 11 October 2016,
  Pages 25--53",10.1016/j.tcs.2016.08.013,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A behavioural theory consists of machine-independent postulates
characterizing a particular class of algorithms or systems, an abstract machine
model that provably satisfies these postulates, and a rigorous proof that any
algorithm or system stipulated by the postulates is captured by the abstract
machine model. The class of interest in this article is that of synchronous
parallel algorithms. For this class a behavioural theory has already been
developed by Blass and Gurevich, which unfortunately, though mathematically
correct, fails to be convincing, as it is not intuitively clear that the
postulates really capture the essence of (synchronous) parallel algorithms.
  In this article we present a much simpler (and presumably more convincing)
set of four postulates for (synchronous) parallel algorithms, which are rather
close to those used in Gurevich's celebrated sequential ASM thesis, i.e. the
behavioural theory of sequential algorithms. The key difference is made by an
extension of the bounded exploration postulate using multiset comprehension
terms instead of ground terms formulated over the signature of the states. In
addition, all implicit assumptions are made explicit, which amounts to
considering states of a parallel algorithm to be represented by meta-finite
first-order structures.
  The article first provides the necessary evidence that the axiomatization
presented in this article characterizes indeed the whole class of
deterministic, synchronous, parallel algorithms, then formally proves that
parallel algorithms are captured by Abstract State Machines (ASMs). The proof
requires some recourse to methods from finite model theory, by means of which
it can be shown that if a critical tuple defines an update in some update set,
then also every other tuple that is logically indistinguishable defines an
update in that update set.
","[{'version': 'v1', 'created': 'Thu, 23 Apr 2015 14:36:00 GMT'}]",2017-05-30,"[['Ferrarotti', 'Flavio', ''], ['Schewe', 'Klaus-Dieter', ''], ['Tec', 'Loredana', ''], ['Wang', 'Qing', '']]","['parallel algorithm', 'abstract state machine', 'ASM thesis', 'behavioural theory']"
1876,1807.00819,Sheikh Rabiul Islam,"Sheikh Rabiul Islam, William Eberle, Sheikh Khaled Ghafoor",Mining Bad Credit Card Accounts from OLAP and OLTP,"Conference proceedings of ICCDA, 2017","Islam, S. R., Eberle, W., & Ghafoor, S. K. (2017, May). Mining Bad
  Credit Card Accounts from OLAP and OLTP. In Proceedings of the International
  Conference on Compute and Data Analysis (pp. 129-137). ACM",10.1145/3093241.3093279,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Credit card companies classify accounts as a good or bad based on historical
data where a bad account may default on payments in the near future. If an
account is classified as a bad account, then further action can be taken to
investigate the actual nature of the account and take preventive actions. In
addition, marking an account as ""good"" when it is actually bad, could lead to
loss of revenue - and marking an account as ""bad"" when it is actually good,
could lead to loss of business. However, detecting bad credit card accounts in
real time from Online Transaction Processing (OLTP) data is challenging due to
the volume of data needed to be processed to compute the risk factor. We
propose an approach which precomputes and maintains the risk probability of an
account based on historical transactions data from offline data or data from a
data warehouse. Furthermore, using the most recent OLTP transactional data,
risk probability is calculated for the latest transaction and combined with the
previously computed risk probability from the data warehouse. If accumulated
risk probability crosses a predefined threshold, then the account is treated as
a bad account and is flagged for manual verification.
","[{'version': 'v1', 'created': 'Mon, 2 Jul 2018 14:24:10 GMT'}]",2018-07-04,"[['Islam', 'Sheikh Rabiul', ''], ['Eberle', 'William', ''], ['Ghafoor', 'Sheikh Khaled', '']]","['OLTP', 'Data warehouse', 'Risk Probability', 'Classifier', 'WEKA']"
1877,1907.06697,Jesse Wang,Jesse Wang and Henry Kautz,CupQ: A New Clinical Literature Search Engine,,"In Conference on Knowledge Discovery and Information Retrieval
  (KDIR). Vienna, Austria. September 2019",10.5220/0008385202250232,,cs.DL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new clinical literature search engine, called CupQ, is presented. It aims
to help clinicians stay updated with medical knowledge. Although PubMed is
currently one of the most widely used digital libraries for biomedical
information, it frequently does not return clinically relevant results. CupQ
utilizes a ranking algorithm that filters non-medical journals, compares
semantic similarity between queries, and incorporates journal impact factor and
publication date. It organizes search results into useful categories for
medical practitioners: reviews, guidelines, and studies. Qualitative
comparisons suggest that CupQ may return more clinically relevant information
than PubMed. CupQ is available at https://cupq.io/.
","[{'version': 'v1', 'created': 'Mon, 15 Jul 2019 19:01:39 GMT'}]",2021-02-23,"[['Wang', 'Jesse', ''], ['Kautz', 'Henry', '']]","['Medicine', 'Literature', 'Search Engine']"
1878,1612.03196,Jean-Pascal Pfister,Jean-Pascal Pfister and Arko Ghosh,A generalized priority-based model for smartphone screen touches,"11 pages, 6 figures, 1 table","Phys. Rev. E 102, 012307 (2020)",10.1103/PhysRevE.102.012307,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The distribution of intervals between human actions such as email posts or
keyboard strokes demonstrates distinct properties at short vs long time scales.
For instance, at long time scales, which are presumably controlled by complex
process such as planning and decision making, it has been shown that those
inter-event intervals follow a scale-invariant (or power-law) distribution. In
contrast, at shorter time-scales - which are governed by different process such
as sensorimotor skill - they do not follow the same distribution and little do
we know how they relate to the scale-invariant pattern. Here, we analyzed 9
millions intervals between smartphone screen touches of 84 individuals which
span several orders of magnitudes (from milliseconds to hours). To capture
these intervals, we extend a priority-based generative model to smartphone
touching events. At short-time scale, the model is governed by refractory
effects, while at longer time scales, the inter-touch intervals are governed by
the priority difference between smartphone tasks and other tasks. The
flexibility of the model allows to capture inter-individual variations at short
and long time scales while its tractability enables efficient model fitting.
According to our model, each individual has a specific power-low exponent which
is tightly related to the effective refractory time constant suggesting that
motor processes which influence the fast actions are related to the higher
cognitive processes governing the longer inter-event intervals.
","[{'version': 'v1', 'created': 'Tue, 6 Dec 2016 14:46:19 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Feb 2017 08:08:51 GMT'}, {'version': 'v3', 'created': 'Thu, 25 Jan 2018 13:58:28 GMT'}, {'version': 'v4', 'created': 'Tue, 14 May 2019 14:15:33 GMT'}, {'version': 'v5', 'created': 'Thu, 6 Feb 2020 13:23:34 GMT'}]",2020-07-22,"[['Pfister', 'Jean-Pascal', ''], ['Ghosh', 'Arko', '']]","['scale invariance', 'generative model', 'pointemission process', 'smartphone model']"
1879,1907.13447,\'Etienne Andr\'e,"\'Etienne Andr\'e, Jawher Jerray and Sahar Mhiri","Time4sys2imi: A tool to formalize real-time system models under
  uncertainty","This is the author (and extended) version of the manuscript of the
  same name published in the proceedings of ICTAC 2019. This work is supported
  by the ASTREI project funded by the Paris \^Ile-de-France Region, with the
  additional support of the ANR national research program PACS
  (ANR-14-CE28-0002) and ERATO HASUO Metamathematics for Systems Design Project
  (No. JPMJER1603), JST","Springer LNCS, pages 113-123, 2019",10.1007/978-3-030-32505-3_7,,cs.SE cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Time4sys is a formalism developed by Thales, realizing a graphical
specification for real-time systems. However, this formalism does not allow to
perform formal analyses for real-time systems. So a translation of this tool to
a formalism equipped with a formal semantics is needed. We present here
Time4sys2imi, a tool translating Time4sys models into parametric timed automata
in the input language of IMITATOR. This translation allows not only to check
the schedulability of real-time systems, but also to infer some timing
constraints (e.g., deadlines, offsets) guaranteeing schedulability. We
successfully applied Time4sys2imi to various examples.
","[{'version': 'v1', 'created': 'Mon, 29 Jul 2019 08:19:02 GMT'}]",2019-10-30,"[['André', 'Étienne', ''], ['Jerray', 'Jawher', ''], ['Mhiri', 'Sahar', '']]","['Real-time systems', 'scheduling', 'model checking', 'parametric timedautomata', 'parameter synthesis']"
1880,1612.03989,Sunil Kumar,"Sunil Kumar, J. V. Desai and Shaktidev Mukherjee",A Fast Keypoint Based Hybrid Method for Copy Move Forgery Detection,,,10.12785/ijcds/040203,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Copy move forgery detection in digital images has become a very popular
research topic in the area of image forensics. Due to the availability of
sophisticated image editing tools and ever increasing hardware capabilities, it
has become an easy task to manipulate the digital images. Passive forgery
detection techniques are more relevant as they can be applied without the prior
information about the image in question. Block based techniques are used to
detect copy move forgery, but have limitations of large time complexity and
sensitivity against affine operations like rotation and scaling. Keypoint based
approaches are used to detect forgery in large images where the possibility of
significant post processing operations like rotation and scaling is more. A
hybrid approach is proposed using different methods for keypoint detection and
description. Speeded Up Robust Features (SURF) are used to detect the keypoints
in the image and Binary Robust Invariant Scalable Keypoints (BRISK) features
are used to describe features at these keypoints. The proposed method has
performed better than the existing forgery detection method using SURF
significantly in terms of detection speed and is invariant to post processing
operations like rotation and scaling. The proposed method is also invariant to
other commonly applied post processing operations like adding Gaussian noise
and JPEG compression
","[{'version': 'v1', 'created': 'Sun, 11 Dec 2016 03:10:27 GMT'}]",2017-02-16,"[['Kumar', 'Sunil', ''], ['Desai', 'J. V.', ''], ['Mukherjee', 'Shaktidev', '']]","['Blind forgery detection', 'Keypoint detection', 'Hybrid technique', 'BRISK', 'SURF']"
1881,1203.0714,Abdessamad Mouzoune,Abdessamad Mouzoune,Towards an intelligence based conceptual framework for e-maintenance,"16 pages,1 figure",,10.1109/SITA.2013.6560789,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since the time when concept of e-maintenance was introduced, most of the
works insisted on the relevance of the underlying Information and Communication
Technologies infrastructure. Through a review of current e-maintenance
conceptual approaches and realizations, this paper aims to reconsider the
predominance of ICT within e-maintenance projects and literature. The review
brings to light the importance of intelligence as a fundamental dimension of
e-maintenance that is to be led in a holistic predefined manner rather than
isolated efforts within ICT driven approaches. As a contribution towards an
intelligence based e-maintenance conceptual framework, a proposal is outlined
in this paper to model e-maintenance system as an intelligent system. The
proposed frame is based on CogAff architecture for intelligent agents. Within
the proposed frame, more importance was reserved to the environment that the
system is to be continuously aware of: Plant Environment, Internal and External
Enterprise Environment and Human Environment. In addition to the abilities
required for internal coherent behavior of the system, requirements for
maintenance activities support are also mapped within the same frame according
to corresponding levels of management. A case study was detailed in this paper
sustaining the applicability of the proposal in relation to the classification
of existing e-maintenance platforms. However, more work is needed to enhance
exhaustiveness of the frame to serve as a comparison tool of existing
e-maintenance systems. At the conceptual level, our future work is to use the
proposed frame in an e-maintenance project.
","[{'version': 'v1', 'created': 'Sun, 4 Mar 2012 06:19:48 GMT'}]",2013-08-27,"[['Mouzoune', 'Abdessamad', '']]","['E-maintenance', 'Artificial Intelligence', 'Intelligent System', 'Framework', 'CogAff']"
1882,1308.3784,Hojjat Emami,Hojjat Emami and Shahriar Lotfi,"Graph Colouring Problem Based on Discrete Imperialist Competitive
  Algorithm",12 pages,"International Journal in Foundations of Computer Science &
  Technology (IJFCST), Vol. 3, No.4, July 2013, pp. 1-12",10.5121/ijfcst.2013.3401,,cs.AI cs.NE,http://creativecommons.org/licenses/by/3.0/,"  In graph theory, Graph Colouring Problem (GCP) is an assignment of colours to
vertices of any given graph such that the colours on adjacent vertices are
different. The GCP is known to be an optimization and NP-hard problem.
Imperialist Competitive Algorithm (ICA) is a meta-heuristic optimization and
stochastic search strategy which is inspired from socio-political phenomenon of
imperialistic competition. The ICA contains two main operators: the
assimilation and the imperialistic competition. The ICA has excellent
capabilities such as high convergence rate and better global optimum
achievement. In this research, a discrete version of ICA is proposed to deal
with the solution of GCP. We call this algorithm as the DICA. The performance
of the proposed method is compared with Genetic Algorithm (GA) on seven
well-known graph colouring benchmarks. Experimental results demonstrate the
superiority of the DICA for the benchmarks. This means DICA can produce optimal
and valid solutions for different GCP instances.
","[{'version': 'v1', 'created': 'Sat, 17 Aug 2013 14:02:36 GMT'}]",2013-08-20,"[['Emami', 'Hojjat', ''], ['Lotfi', 'Shahriar', '']]","['Graph Colouring Problem', 'Discrete Imperialist Competitive Algorithm', 'Genetic Algorithm', 'Optimization']"
1883,1507.08874,Miriam Marciel,"Miriam Marciel and Ruben Cuevas and Albert Banchs and Roberto Gonzalez
  and Stefano Traverso and Mohamed Ahmed and Arturo Azcorra",Understanding the Detection of View Fraud in Video Content Portals,"To appear in WWW 2016, Montr\'eal, Qu\'ebec, Canada. Please cite the
  conference version of this paper",,10.1145/2872427.2882980l,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While substantial effort has been devoted to understand fraudulent activity
in traditional online advertising (search and banner), more recent forms such
as video ads have received little attention. The understanding and
identification of fraudulent activity (i.e., fake views) in video ads for
advertisers, is complicated as they rely exclusively on the detection
mechanisms deployed by video hosting portals. In this context, the development
of independent tools able to monitor and audit the fidelity of these systems
are missing today and needed by both industry and regulators.
  In this paper we present a first set of tools to serve this purpose. Using
our tools, we evaluate the performance of the audit systems of five major
online video portals. Our results reveal that YouTube's detection system
significantly outperforms all the others. Despite this, a systematic evaluation
indicates that it may still be susceptible to simple attacks. Furthermore, we
find that YouTube penalizes its videos' public and monetized view counters
differently, the former being more aggressive. This means that views identified
as fake and discounted from the public view counter are still monetized. We
speculate that even though YouTube's policy puts in lots of effort to
compensate users after an attack is discovered, this practice places the burden
of the risk on the advertisers, who pay to get their ads displayed.
","[{'version': 'v1', 'created': 'Fri, 31 Jul 2015 13:24:55 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Feb 2016 16:10:59 GMT'}]",2016-02-08,"[['Marciel', 'Miriam', ''], ['Cuevas', 'Ruben', ''], ['Banchs', 'Albert', ''], ['Gonzalez', 'Roberto', ''], ['Traverso', 'Stefano', ''], ['Ahmed', 'Mohamed', ''], ['Azcorra', 'Arturo', '']]","['Fraud', 'fake views', 'YouTube', 'active probing', 'advertising']"
1884,1309.1983,Mark Mawson,"Mark Mawson, Alistair Revell","Memory transfer optimization for a lattice Boltzmann solver on Kepler
  architecture nVidia GPUs",12 pages,,10.1016/j.cpc.2014.06.003,,cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Lattice Boltzmann method (LBM) for solving fluid flow is naturally well
suited to an efficient implementation for massively parallel computing, due to
the prevalence of local operations in the algorithm. This paper presents and
analyses the performance of a 3D lattice Boltzmann solver, optimized for third
generation nVidia GPU hardware, also known as `Kepler'. We provide a review of
previous optimisation strategies and analyse data read/write times for
different memory types. In LBM, the time propagation step (known as streaming),
involves shifting data to adjacent locations and is central to parallel
performance; here we examine three approaches which make use of different
hardware options. Two of which make use of `performance enhancing' features of
the GPU; shared memory and the new shuffle instruction found in Kepler based
GPUs. These are compared to a standard transfer of data which relies instead on
optimised storage to increase coalesced access. It is shown that the more
simple approach is most efficient; since the need for large numbers of
registers per thread in LBM limits the block size and thus the efficiency of
these special features is reduced. Detailed results are obtained for a D3Q19
LBM solver, which is benchmarked on nVidia K5000M and K20C GPUs. In the latter
case the use of a read-only data cache is explored, and peak performance of
over 1036 Million Lattice Updates Per Second (MLUPS) is achieved. The
appearance of a periodic bottleneck in the solver performance is also reported,
believed to be hardware related; spikes in iteration-time occur with a
frequency of around 11Hz for both GPUs, independent of the size of the problem.
","[{'version': 'v1', 'created': 'Sun, 8 Sep 2013 17:37:32 GMT'}]",2017-01-04,"[['Mawson', 'Mark', ''], ['Revell', 'Alistair', '']]","['GPGPU', 'Lattice Boltzmann', 'Computational Fluid Dynamics', 'CUDA']"
1885,1610.02177,Patrick Christ,"Patrick Ferdinand Christ, Mohamed Ezzeldin A. Elshaer, Florian
  Ettlinger, Sunil Tatavarty, Marc Bickel, Patrick Bilic, Markus Rempfler,
  Marco Armbruster, Felix Hofmann, Melvin D'Anastasi, Wieland H. Sommer,
  Seyed-Ahmad Ahmadi and Bjoern H. Menze","Automatic Liver and Lesion Segmentation in CT Using Cascaded Fully
  Convolutional Neural Networks and 3D Conditional Random Fields","Accepted at MICCAI 2016. Source code available on
  https://github.com/IBBM/Cascaded-FCN",,10.1007/978-3-319-46723-8_48,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic segmentation of the liver and its lesion is an important step
towards deriving quantitative biomarkers for accurate clinical diagnosis and
computer-aided decision support systems. This paper presents a method to
automatically segment liver and lesions in CT abdomen images using cascaded
fully convolutional neural networks (CFCNs) and dense 3D conditional random
fields (CRFs). We train and cascade two FCNs for a combined segmentation of the
liver and its lesions. In the first step, we train a FCN to segment the liver
as ROI input for a second FCN. The second FCN solely segments lesions from the
predicted liver ROIs of step 1. We refine the segmentations of the CFCN using a
dense 3D CRF that accounts for both spatial coherence and appearance. CFCN
models were trained in a 2-fold cross-validation on the abdominal CT dataset
3DIRCAD comprising 15 hepatic tumor volumes. Our results show that CFCN-based
semantic liver and lesion segmentation achieves Dice scores over 94% for liver
with computation times below 100s per volume. We experimentally demonstrate the
robustness of the proposed method as a decision support system with a high
accuracy and speed for usage in daily clinical routine.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2016 08:23:32 GMT'}]",2017-02-21,"[['Christ', 'Patrick Ferdinand', ''], ['Elshaer', 'Mohamed Ezzeldin A.', ''], ['Ettlinger', 'Florian', ''], ['Tatavarty', 'Sunil', ''], ['Bickel', 'Marc', ''], ['Bilic', 'Patrick', ''], ['Rempfler', 'Markus', ''], ['Armbruster', 'Marco', ''], ['Hofmann', 'Felix', ''], [""D'Anastasi"", 'Melvin', ''], ['Sommer', 'Wieland H.', ''], ['Ahmadi', 'Seyed-Ahmad', ''], ['Menze', 'Bjoern H.', '']]","['Liver', 'Lesion', 'Segmentation', 'FCN', 'CRF', 'CFCN', 'Deep Learning']"
1886,1303.5441,Vincent Labatut,Vincent Labatut (LIA),Generalized Measures for the Evaluation of Community Detection Methods,"The R source code (based on the igraph library) for the measures
  described in this article is freely available on
  GitHub:https://github.com/CompNet/TopoMeasures","International Journal of Social Network Analysis and Mining
  (SNAM), 2015, 2 (1), pp.44-63",10.1504/IJSNM.2015.069776,,cs.SI math.ST physics.soc-ph stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Community detection can be considered as a variant of cluster analysis
applied to complex networks. For this reason, all existing studies have been
using tools derived from this field when evaluating community detection
algorithms. However, those are not completely relevant in the context of
network analysis, because they ignore an essential part of the available
information: the network structure. Therefore, they can lead to incorrect
interpretations. In this article, we review these measures, and illustrate this
limitation. We propose a modification to solve this problem, and apply it to
the three most widespread measures: purity, Rand index and normalized mutual
information (NMI). We then perform an experimental evaluation on artificially
generated networks with realistic community structure. We assess the relevance
of the modified measures by comparison with their traditional counterparts, and
also relatively to the topological properties of the community structures. On
these data, the modified NMI turns out to provide the most relevant results.
","[{'version': 'v1', 'created': 'Thu, 21 Mar 2013 07:06:37 GMT'}, {'version': 'v2', 'created': 'Fri, 13 May 2016 15:12:33 GMT'}, {'version': 'v3', 'created': 'Tue, 17 May 2016 09:43:33 GMT'}]",2016-05-18,"[['Labatut', 'Vincent', '', 'LIA']]","['Complex Networks', 'Community Detection', 'Evaluation Measure', 'Cluster Analysis', 'Purity', 'Adjusted Rand Index', 'Normalized Mutual Information']"
1887,1303.1441,Kamal Sarkar,Kamal Sarkar,A Hybrid Approach to Extract Keyphrases from Medical Documents,,"International Journal of Computer Applications 63(18):14-19,
  February 2013. Published by Foundation of Computer Science, New York, USA",10.5120/10565-5528,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Keyphrases are the phrases, consisting of one or more words, representing the
important concepts in the articles. Keyphrases are useful for a variety of
tasks such as text summarization, automatic indexing,
clustering/classification, text mining etc. This paper presents a hybrid
approach to keyphrase extraction from medical documents. The keyphrase
extraction approach presented in this paper is an amalgamation of two methods:
the first one assigns weights to candidate keyphrases based on an effective
combination of features such as position, term frequency, inverse document
frequency and the second one assign weights to candidate keyphrases using some
knowledge about their similarities to the structure and characteristics of
keyphrases available in the memory (stored list of keyphrases). An efficient
candidate keyphrase identification method as the first component of the
proposed keyphrase extraction system has also been introduced in this paper.
The experimental results show that the proposed hybrid approach performs better
than some state-of-the art keyphrase extraction approaches.
","[{'version': 'v1', 'created': 'Wed, 6 Mar 2013 20:09:05 GMT'}, {'version': 'v2', 'created': 'Sat, 25 Jan 2014 16:34:35 GMT'}]",2014-01-28,"[['Sarkar', 'Kamal', '']]","['keyphrase extraction', 'medical domain', 'automatic indexing', 'metadata', 'partial supervision']"
1888,1812.00955,Noah Apthorpe,"Noah Apthorpe, Danny Yuxing Huang, Dillon Reisman, Arvind Narayanan,
  Nick Feamster",Keeping the Smart Home Private with Smart(er) IoT Traffic Shaping,"21 pages, 9 figures, 4 tables. This article draws heavily from
  arXiv:1705.06805, arXiv:1705.06809, and arXiv:1708.05044. Camera-ready
  version","Proceedings on Privacy Enhancing Technologies 2019.3 (2019)
  128-148",10.2478/popets-2019-0040,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The proliferation of smart home Internet of Things (IoT) devices presents
unprecedented challenges for preserving privacy within the home. In this paper,
we demonstrate that a passive network observer (e.g., an Internet service
provider) can infer private in-home activities by analyzing Internet traffic
from commercially available smart home devices even when the devices use
end-to-end transport-layer encryption. We evaluate common approaches for
defending against these types of traffic analysis attacks, including firewalls,
virtual private networks, and independent link padding, and find that none
sufficiently conceal user activities with reasonable data overhead. We develop
a new defense, ""stochastic traffic padding"" (STP), that makes it difficult for
a passive network adversary to reliably distinguish genuine user activities
from generated traffic patterns designed to look like user interactions. Our
analysis provides a theoretical bound on an adversary's ability to accurately
detect genuine user activities as a function of the amount of additional cover
traffic generated by the defense technique.
","[{'version': 'v1', 'created': 'Mon, 3 Dec 2018 18:26:24 GMT'}, {'version': 'v2', 'created': 'Sat, 16 Mar 2019 05:27:47 GMT'}]",2020-07-28,"[['Apthorpe', 'Noah', ''], ['Huang', 'Danny Yuxing', ''], ['Reisman', 'Dillon', ''], ['Narayanan', 'Arvind', ''], ['Feamster', 'Nick', '']]","['Internet of things', 'smart home', 'activity inference', 'traffic shaping', 'stochastic traffic padding']"
1889,2102.04780,Sutharsan Mahendren Mr,"Sutharsan Mahendren, Chamira Edussooriya, Ranga Rodrigo",Diverse Single Image Generation with Controllable Global Structure,Published in the Neurocomputing Journal,Neurocomputing 528(2023)97-112,10.1016/j.neucom.2023.01.011,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image generation from a single image using generative adversarial networks is
quite interesting due to the realism of generated images. However, recent
approaches need improvement for such realistic and diverse image generation,
when the global context of the image is important such as in face, animal, and
architectural image generation. This is mainly due to the use of fewer
convolutional layers for mainly capturing the patch statistics and, thereby,
not being able to capture global statistics very well. We solve this problem by
using attention blocks at selected scales and feeding a random Gaussian blurred
image to the discriminator for training. Our results are visually better than
the state-of-the-art particularly in generating images that require global
context. The diversity of our image generation, measured using the average
standard deviation of pixels, is also better.
","[{'version': 'v1', 'created': 'Tue, 9 Feb 2021 11:52:48 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Feb 2021 05:22:34 GMT'}, {'version': 'v3', 'created': 'Thu, 20 Jan 2022 05:25:10 GMT'}, {'version': 'v4', 'created': 'Wed, 25 Jan 2023 13:10:39 GMT'}]",2023-01-26,"[['Mahendren', 'Sutharsan', ''], ['Edussooriya', 'Chamira', ''], ['Rodrigo', 'Ranga', '']]","['Single image generation', 'generative adversarial networks', 'scale-wise attention', 'adversarial feedback']"
1890,1904.00402,Tadashi Sakuma Associate Professor,"Tatsuoki Kato, Tomoki Nakamigawa and Tadashi Sakuma",Pebble Exchange Group of Graphs,Accepted in European Journal of Combinatorics,European Journal of Combinatorics (2021),10.1016/j.ejc.2021.103325,,cs.DM math.CO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A graph puzzle ${\rm Puz}(G)$ of a graph $G$ is defined as follows. A
configuration of ${\rm Puz}(G)$ is a bijection from the set of vertices of a
board graph to the set of vertices of a pebble graph, both graphs being
isomorphic to some input graph $G$. A move of pebbles is defined as exchanging
two pebbles which are adjacent on both a board graph and a pebble graph. For a
pair of configurations $f$ and $g$, we say that $f$ is equivalent to $g$ if $f$
can be transformed into $g$ by a finite sequence of moves.
  Let ${\rm Aut}(G)$ be the automorphism group of $G$, and let ${\rm 1}_G$ be
the unit element of ${\rm Aut}(G)$. The pebble exchange group of $G$, denoted
by ${\rm Peb}(G)$, is defined as the set of all automorphisms $f$ of $G$ such
that ${\rm 1}_G$ and $f$ are equivalent to each other.
  In this paper, some basic properties of ${\rm Peb}(G)$ are studied. Among
other results, it is shown that for any connected graph $G$, all automorphisms
of $G$ are contained in ${\rm Peb}(G^2)$, where $G^2$ is a square graph of $G$.
","[{'version': 'v1', 'created': 'Sun, 31 Mar 2019 13:02:28 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Mar 2021 08:21:50 GMT'}]",2021-03-30,"[['Kato', 'Tatsuoki', ''], ['Nakamigawa', 'Tomoki', ''], ['Sakuma', 'Tadashi', '']]","['pebble motion', 'motion planning', 'graph puzzle', 'automorphism']"
1891,1304.1233,Conrad Sanderson,"Andres Sanin, Conrad Sanderson, Brian C. Lovell",Shadow Detection: A Survey and Comparative Evaluation of Recent Methods,,"Pattern Recognition, Vol. 45, No. 4, pp. 1684-1695, 2012",10.1016/j.patcog.2011.10.001,,cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a survey and a comparative evaluation of recent
techniques for moving cast shadow detection. We identify shadow removal as a
critical step for improving object detection and tracking. The survey covers
methods published during the last decade, and places them in a feature-based
taxonomy comprised of four categories: chromacity, physical, geometry and
textures. A selection of prominent methods across the categories is compared in
terms of quantitative performance measures (shadow detection and discrimination
rates, colour desaturation) as well as qualitative observations. Furthermore,
we propose the use of tracking performance as an unbiased approach for
determining the practical usefulness of shadow detection methods. The
evaluation indicates that all shadow detection approaches make different
contributions and all have individual strength and weaknesses. Out of the
selected methods, the geometry-based technique has strict assumptions and is
not generalisable to various environments, but it is a straightforward choice
when the objects of interest are easy to model and their shadows have different
orientation. The chromacity based method is the fastest to implement and run,
but it is sensitive to noise and less effective in low saturated scenes. The
physical method improves upon the accuracy of the chromacity method by adapting
to local shadow models, but fails when the spectral properties of the objects
are similar to that of the background. The small-region texture based method is
especially robust for pixels whose neighbourhood is textured, but may take
longer to implement and is the most computationally expensive. The large-region
texture based method produces the most accurate results, but has a significant
computational load due to its multiple processing steps.
","[{'version': 'v1', 'created': 'Thu, 4 Apr 2013 03:11:38 GMT'}]",2013-04-05,"[['Sanin', 'Andres', ''], ['Sanderson', 'Conrad', ''], ['Lovell', 'Brian C.', '']]","['moving cast shadow detection', 'literature review', 'comparative evaluation', 'tracking improvement']"
1892,1610.06449,Hamed R.-Tavakoli,"Hamed R.-Tavakoli, Ali Borji, Jorma Laaksonen, Esa Rahtu","Exploiting inter-image similarity and ensemble of extreme learners for
  fixation prediction using deep features",,Neurocomputing 244 (2017) 10-18,10.1016/j.neucom.2017.03.018,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel fixation prediction and saliency modeling
framework based on inter-image similarities and ensemble of Extreme Learning
Machines (ELM). The proposed framework is inspired by two observations, 1) the
contextual information of a scene along with low-level visual cues modulates
attention, 2) the influence of scene memorability on eye movement patterns
caused by the resemblance of a scene to a former visual experience. Motivated
by such observations, we develop a framework that estimates the saliency of a
given image using an ensemble of extreme learners, each trained on an image
similar to the input image. That is, after retrieving a set of similar images
for a given image, a saliency predictor is learnt from each of the images in
the retrieved image set using an ELM, resulting in an ensemble. The saliency of
the given image is then measured in terms of the mean of predicted saliency
value by the ensemble's members.
","[{'version': 'v1', 'created': 'Thu, 20 Oct 2016 14:55:29 GMT'}]",2017-05-31,"[['-Tavakoli', 'Hamed R.', ''], ['Borji', 'Ali', ''], ['Laaksonen', 'Jorma', ''], ['Rahtu', 'Esa', '']]","['Visual attention', 'saliency prediction', 'fixation prediction', 'inter-image similarity', 'extreme learning machines']"
1893,1611.09176,Jerome Darmont,"J\'er\^ome Darmont (LIMOS), Amar Attoui (LIMOS), Michel Gourgand
  (LIMOS)","Simulation of clustering algorithms in OODBs in order to evaluate their
  performances","arXiv admin note: substantial text overlap with arXiv:0705.0454,
  arXiv:1611.09177","Simulation Practice and Theory, Elsevier, 1997, 5 (3), pp.269-287",10.1016/S0928-4869(96)00013-4,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A good object clustering is critical to the performance of object-oriented
databases. However, it always involves some kind of overhead for the system.
The aim of this paper is to propose a modelling methodology in order to
evaluate the performances of different clustering policies. This methodology
has been used to compare the performances of three clustering algorithms found
in the literature (Cactis, CK and ORION) that we considered representative of
the current research in the field of object clustering. The actual performance
evaluation was performed using simulation. Simulation experiments showed that
the Cactis algorithm is better than the ORION algorithm and that the CK
algorithm totally outperforms both other algorithms in terms of response time
and clustering overhead.
","[{'version': 'v1', 'created': 'Mon, 28 Nov 2016 15:19:14 GMT'}]",2017-01-01,"[['Darmont', 'Jérôme', '', 'LIMOS'], ['Attoui', 'Amar', '', 'LIMOS'], ['Gourgand', 'Michel', '', 'LIMOS']]","['Clustering', 'Computer systems performance evaluation methodology', 'Objectoriented databases', 'Simulation']"
1894,1108.4471,EPTCS,"Jens-Wolfhard Schicke (TU Braunschweig), Kirstin Peters (TU Berlin),
  Ursula Goltz (TU Braunschweig)",Synchrony vs. Causality in Asynchronous Petri Nets,"In Proceedings EXPRESS 2011, arXiv:1108.4077","EPTCS 64, 2011, pp. 119-131",10.4204/EPTCS.64.9,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a synchronous system, we study the question whether the behaviour of
that system can be exhibited by a (non-trivially) distributed and hence
asynchronous implementation. In this paper we show, by counterexample, that
synchronous systems cannot in general be implemented in an asynchronous fashion
without either introducing an infinite implementation or changing the causal
structure of the system behaviour.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2011 01:24:08 GMT'}]",2011-08-24,"[['Schicke', 'Jens-Wolfhard', '', 'TU Braunschweig'], ['Peters', 'Kirstin', '', 'TU Berlin'], ['Goltz', 'Ursula', '', 'TU Braunschweig']]","['asynchrony', 'distributed systems', 'causal semantics', 'Petri nets']"
1895,1512.06073,Keno Merckx,"Jean Cardinal, Jean-Paul Doignon, Keno Merckx",On the shelling antimatroids of split graphs,,"Discrete Mathematics & Theoretical Computer Science, Vol. 19 no.
  1, Combinatorics (March 24, 2017) dmtcs:3201",10.23638/DMTCS-19-1-7,,cs.DM cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Chordal graph shelling antimatroids have received little attention with
regard to their combinatorial properties and related optimization problems, as
compared to the case of poset shelling antimatroids. Here we consider a special
case of these antimatroids, namely the split graph shelling antimatroids. We
show that the feasible sets of such an antimatroid relate to some poset
shelling antimatroids constructed from the graph. We discuss a few
applications, obtaining in particular a simple polynomial-time algorithm to
find a maximum weight feasible set. We also provide a simple description of the
circuits and the free sets.
","[{'version': 'v1', 'created': 'Fri, 18 Dec 2015 18:54:14 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Jan 2017 09:44:50 GMT'}, {'version': 'v3', 'created': 'Thu, 16 Mar 2017 15:01:25 GMT'}]",2019-03-14,"[['Cardinal', 'Jean', ''], ['Doignon', 'Jean-Paul', ''], ['Merckx', 'Keno', '']]","['antimatroid', 'split graph', 'shelling', 'maximum weight feasible set']"
1896,2009.07498,Lijian Lin,"Lijian Lin, Haosheng Chen, Honglun Zhang, Jun Liang, Yu Li, Ying Shan,
  Hanzi Wang",Dual Semantic Fusion Network for Video Object Detection,"9 pages,6 figures",ACM Multimedia 2020,10.1145/3394171.3413583,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video object detection is a tough task due to the deteriorated quality of
video sequences captured under complex environments. Currently, this area is
dominated by a series of feature enhancement based methods, which distill
beneficial semantic information from multiple frames and generate enhanced
features through fusing the distilled information. However, the distillation
and fusion operations are usually performed at either frame level or instance
level with external guidance using additional information, such as optical flow
and feature memory. In this work, we propose a dual semantic fusion network
(abbreviated as DSFNet) to fully exploit both frame-level and instance-level
semantics in a unified fusion framework without external guidance. Moreover, we
introduce a geometric similarity measure into the fusion process to alleviate
the influence of information distortion caused by noise. As a result, the
proposed DSFNet can generate more robust features through the multi-granularity
fusion and avoid being affected by the instability of external guidance. To
evaluate the proposed DSFNet, we conduct extensive experiments on the ImageNet
VID dataset. Notably, the proposed dual semantic fusion network achieves, to
the best of our knowledge, the best performance of 84.1\% mAP among the current
state-of-the-art video object detectors with ResNet-101 and 85.4\% mAP with
ResNeXt-101 without using any post-processing steps.
","[{'version': 'v1', 'created': 'Wed, 16 Sep 2020 06:49:17 GMT'}]",2020-09-17,"[['Lin', 'Lijian', ''], ['Chen', 'Haosheng', ''], ['Zhang', 'Honglun', ''], ['Liang', 'Jun', ''], ['Li', 'Yu', ''], ['Shan', 'Ying', ''], ['Wang', 'Hanzi', '']]","['Video Object Detection', 'Semantic Fusion', 'Information Distillation', 'Geometric Similarity']"
1897,1702.01187,Helge Holzmann,"Helge Holzmann, Nina Tahmasebi, Thomas Risse",Named Entity Evolution Recognition on the Blogosphere,IJDL 2015,"International Journal on Digital Libraries 2015, Volume 15, Issue
  2, pp 209-235",10.1007/s00799-014-0135-x,,cs.CL cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advancements in technology and culture lead to changes in our language. These
changes create a gap between the language known by users and the language
stored in digital archives. It affects user's possibility to firstly find
content and secondly interpret that content. In previous work we introduced our
approach for Named Entity Evolution Recognition~(NEER) in newspaper
collections. Lately, increasing efforts in Web preservation lead to increased
availability of Web archives covering longer time spans. However, language on
the Web is more dynamic than in traditional media and many of the basic
assumptions from the newspaper domain do not hold for Web data. In this paper
we discuss the limitations of existing methodology for NEER. We approach these
by adapting an existing NEER method to work on noisy data like the Web and the
Blogosphere in particular. We develop novel filters that reduce the noise and
make use of Semantic Web resources to obtain more information about terms. Our
evaluation shows the potentials of the proposed approach.
","[{'version': 'v1', 'created': 'Fri, 3 Feb 2017 22:07:57 GMT'}]",2017-02-07,"[['Holzmann', 'Helge', ''], ['Tahmasebi', 'Nina', ''], ['Risse', 'Thomas', '']]","['Named Entity Evolution', 'Blogs', 'SemanticWeb', 'DBpedia']"
1898,1812.03441,Richard Skarbez,"Richard Skarbez and Doug A. Bowman and J. Todd Ogle and Thomas Tucker
  and Joseph L. Gabbard",Virtual replicas of real places: Experimental investigations,21 pages,"IEEE Transactions on Visualization and Computer Graphics (Early
  Access) (2021)",10.1109/TVCG.2021.3096494,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The emergence of social virtual reality (VR) experiences, such as Facebook
Spaces, Oculus Rooms, and Oculus Venues, will generate increased interest from
users who want to share real places (both personal and public) with their
fellow users in VR. At the same time, advances in scanning and reconstruction
technology are making the realistic capture of real places more and more
feasible. These complementary pressures mean that the representation of real
places in virtual reality will be an increasingly common use case for VR.
Despite this, there has been very little research into how users perceive such
replicated spaces. This paper reports the results from a series of three user
studies investigating this topic. Taken together, these results show that
getting the scale of the space correct is the most important factor for
generating a ""feeling of reality"", that it is important to avoid incoherent
behaviors (such as floating objects), and that lighting makes little difference
to perceptual similarity.
","[{'version': 'v1', 'created': 'Sun, 9 Dec 2018 08:04:00 GMT'}]",2021-07-19,"[['Skarbez', 'Richard', ''], ['Bowman', 'Doug A.', ''], ['Ogle', 'J. Todd', ''], ['Tucker', 'Thomas', ''], ['Gabbard', 'Joseph L.', '']]","['Virtual reality', 'virtual environments', 'presence', 'psychophysics', 'user studies']"
1899,1902.02573,Ermin Sakic,"Ermin Sakic, Fragkiskos Sardis, Jochen W. Guck, Wolfgang Kellerer",Towards adaptive state consistency in distributed SDN control plane,7 pages,2017 IEEE International Conference on Communications (ICC),10.1109/ICC.2017.7997164,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  State synchronisation in clustered Software Defined Networking controller
deployments ensures that all instances of the controller have the same state
information in order to provide redundancy. Current implementations of
controllers use a strong consistency model, where configuration changes must be
synchronised across a number of instances before they are applied on the
network infrastructure. For large deployments, this blocking process increases
the delay of state synchronisation across cluster members and consequently has
a detrimental effect on network operations that require rapid response, such as
fast failover and Quality of Service applications. In this paper, we introduce
an adaptive consistency model for SDN Controllers that employs concepts of
eventual consistency models along with a novel `cost-based' approach where
strict synchronisation is employed for critical operations that affect a large
portion of the network resources while less critical changes are periodically
propagated across cluster nodes. We use simulation to evaluate our model and
demonstrate the potential gains in performance.
","[{'version': 'v1', 'created': 'Thu, 7 Feb 2019 11:32:00 GMT'}]",2019-02-08,"[['Sakic', 'Ermin', ''], ['Sardis', 'Fragkiskos', ''], ['Guck', 'Jochen W.', ''], ['Kellerer', 'Wolfgang', '']]","['SDN', 'distributed control plane', 'scalability', 'QoS', 'adaptive consistency', 'RAFT', 'OpenDaylight', 'ONOS']"
1900,1207.2706,Gaurav Raj,"Gaurav Raj, Kamaljit Kaur","Secure Cloud Communication for Effective Cost Management System through
  MSBE","12 pages, 3 figures, International Journal on Cloud Computing:
  Services and Architecture(IJCCSA),Vol.2, No.3, June 2012",,10.5121/ijccsa.2012.2303,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Cloud Computing Architecture, Brokers are responsible to provide services
to the end users. An Effective Cost Management System (ECMS) which works over
Secure Cloud Communication Paradigm (SCCP) helps in finding a communication
link with overall minimum cost of links. We propose an improved Broker Cloud
Communication Paradigm (BCCP) with integration of security issues. Two
algorithms are included, first is Secure Optimized Route Cost Finder (S-ORCF)
to find optimum route between broker and cloud on the behalf of cost factor and
second is Secure Optimized Route Management (S-ORM) to maintain optimum route.
These algorithms proposed with cryptographic integrity of the secure route
discovery process in efficient routing approaches between broker and cloud.
There is lack in Dynamic Source Routing Approach to verify whether any
intermediate node has been deleted, inserted or modified with no valid
authentication. We use symmetric cryptographic primitives, which is made
possible due to multisource broadcast encryption scheme. This paper outlines
the use of secure route discovery protocol (SRDP)that employs such a security
paradigm in cloud computing.
","[{'version': 'v1', 'created': 'Wed, 11 Jul 2012 16:51:01 GMT'}]",2012-07-12,"[['Raj', 'Gaurav', ''], ['Kaur', 'Kamaljit', '']]","['Cloud Computing', 'Route Discovery Protocol', 'Broker Cloud Communication Protocol', 'Dynamic RouteDiscovery Protocol']"
1901,1509.05197,Chenhao Qu,"Chenhao Qu, Rodrigo N. Calheiros, Rajkumar Buyya","A Reliable and Cost-Efficient Auto-Scaling System for Web Applications
  Using Heterogeneous Spot Instances",,,10.1016/j.jnca.2016.03.001,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud providers sell their idle capacity on markets through an auction-like
mechanism to increase their return on investment. The instances sold in this
way are called spot instances. In spite that spot instances are usually 90%
cheaper than on-demand instances, they can be terminated by provider when their
bidding prices are lower than market prices. Thus, they are largely used to
provision fault-tolerant applications only. In this paper, we explore how to
utilize spot instances to provision web applications, which are usually
considered availability-critical. The idea is to take advantage of differences
in price among various types of spot instances to reach both high availability
and significant cost saving. We first propose a fault-tolerant model for web
applications provisioned by spot instances. Based on that, we devise novel
auto-scaling polices for hourly billed cloud markets. We implemented the
proposed model and policies both on a simulation testbed for repeatable
validation and Amazon EC2. The experiments on the simulation testbed and the
real platform against the benchmarks show that the proposed approach can
greatly reduce resource cost and still achieve satisfactory Quality of Service
(QoS) in terms of response time and availability.
","[{'version': 'v1', 'created': 'Thu, 17 Sep 2015 10:24:32 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Mar 2016 00:46:27 GMT'}]",2016-03-08,"[['Qu', 'Chenhao', ''], ['Calheiros', 'Rodrigo N.', ''], ['Buyya', 'Rajkumar', '']]","['Cloud Computing', 'Auto-scaling', 'Web Application', 'FaultTolerant', 'Cost', 'QoS', 'Spot Instance']"
1902,1802.09241,Giovanni Stabile,Giovanni Stabile and Hermann G. Matthies and Claudio Borri,"A novel reduced order model for vortex induced vibrations of long
  flexible cylinders",,,10.1016/j.oceaneng.2018.02.064,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this manuscript the development of a reduced order model for the analysis
of long flexible cylinders in an offshore environment is proposed. In
particular the focus is on the modelling of the vortex induced vibrations (VIV)
and the aim is the development of a model capable of capturing both the in-line
and cross-flow oscillations. The reduced order model is identified starting
from the results of a high fidelity solver developed coupling together a Finite
Element Solver (FEM) with a Computational Fluid Dynamics (CFD) solver. The high
fidelity analyses are conducted on a reduced domain size representing a small
section of the long cylinder, which is nevertheless, already flexible. The
section is forced using a motion which matches the expected motion in full
scale, and the results are used for the system-parameter identification of the
reduced order model. The reduced order model is identified by using a system
and parameter identification approach. The final proposed model consists in the
combination of a forced van der Pol oscillator, to model the cross-flow forces,
and a linear state-space model, to model the in-line forces. The model is
applied to study a full scale flexible model and the results are validated by
using experiments conducted on a flexible riser inside a towing tank.
","[{'version': 'v1', 'created': 'Mon, 26 Feb 2018 10:47:08 GMT'}]",2018-10-03,"[['Stabile', 'Giovanni', ''], ['Matthies', 'Hermann G.', ''], ['Borri', 'Claudio', '']]","['Vortex Induced Vibrations', 'Computational Fluid Dynamics', 'Reduced order modelling']"
1903,1804.05880,Andr\'e Platzer,Andr\'e Platzer,Uniform Substitution for Differential Game Logic,,"Automated Reasoning, 9th International Joint Conference, IJCAR
  2018",10.1007/978-3-319-94205-6_15,,cs.LO cs.GT cs.PL math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a uniform substitution calculus for differential game
logic (dGL). Church's uniform substitutions substitute a term or formula for a
function or predicate symbol everywhere. After generalizing them to
differential game logic and allowing for the substitution of hybrid games for
game symbols, uniform substitutions make it possible to only use axioms instead
of axiom schemata, thereby substantially simplifying implementations. Instead
of subtle schema variables and soundness-critical side conditions on the
occurrence patterns of logical variables to restrict infinitely many axiom
schema instances to sound ones, the resulting axiomatization adopts only a
finite number of ordinary dGL formulas as axioms, which uniform substitutions
instantiate soundly. This paper proves soundness and completeness of uniform
substitutions for the monotone modal logic dGL. The resulting axiomatization
admits a straightforward modular implementation of dGL in theorem provers.
","[{'version': 'v1', 'created': 'Mon, 16 Apr 2018 18:22:55 GMT'}]",2018-07-20,"[['Platzer', 'André', '']]","['differential game logic', 'uniform substitution', 'axioms', 'static semantics']"
1904,1709.04800,Eduardo Aguilar,"Eduardo Aguilar, Marc Bola\~nos, Petia Radeva",Exploring Food Detection using CNNs,,EUROCAST 2017 10672 (2018) 339-347,10.1007/978-3-319-74727-9_40,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the most common critical factors directly related to the cause of a
chronic disease is unhealthy diet consumption. In this sense, building an
automatic system for food analysis could allow a better understanding of the
nutritional information with respect to the food eaten and thus it could help
in taking corrective actions in order to consume a better diet. The Computer
Vision community has focused its efforts on several areas involved in the
visual food analysis such as: food detection, food recognition, food
localization, portion estimation, among others. For food detection, the best
results evidenced in the state of the art were obtained using Convolutional
Neural Network. However, the results of all these different approaches were
gotten on different datasets and therefore are not directly comparable. This
article proposes an overview of the last advances on food detection and an
optimal model based on GoogLeNet Convolutional Neural Network method, principal
component analysis, and a support vector machine that outperforms the state of
the art on two public food/non-food datasets.
","[{'version': 'v1', 'created': 'Thu, 14 Sep 2017 14:03:01 GMT'}]",2018-01-29,"[['Aguilar', 'Eduardo', ''], ['Bolaños', 'Marc', ''], ['Radeva', 'Petia', '']]","['CNN', 'PCA', 'GoogLeNet', 'SVM', 'Food Detection']"
1905,1305.2724,Said Broumi,Said Broumi,Generalized Neutrosophic Soft Set,"14 pages, 11 figures","International Journal of Computer Science, Engineering and
  Information Technology (IJCSEIT), Vol.3, No.2,April2013",10.5121/ijcseit.2013.3202,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a new concept called generalized neutrosophic soft
set. This concept incorporates the beneficial properties of both generalized
neutrosophic set introduced by A.A. Salama [7]and soft set techniques proposed
by Molodtsov [4]. We also study some properties of this concept. Some
definitions and operations have been introduced on generalized neutrosophic
soft set. Finally we present an application of generalized neuutrosophic soft
set in decision making problem.
","[{'version': 'v1', 'created': 'Mon, 13 May 2013 09:42:50 GMT'}]",2013-05-14,"[['Broumi', 'Said', '']]","['Soft Sets', 'Neutrosophic Set', 'Generalized Neutrosophic Set', 'Generalized Neutrosophic Soft Set']"
1906,0911.4961,Lianlin Li Dr,Lianlin Li and Behnam Jafarpour,"A Sparse Bayesian Estimation Framework for Conditioning Prior Geologic
  Models to Nonlinear Flow Measurements",,,10.1016/j.advwatres.2010.06.005,,cs.NA physics.data-an physics.geo-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a Bayesian framework for reconstruction of subsurface hydraulic
properties from nonlinear dynamic flow data by imposing sparsity on the
distribution of the solution coefficients in a compression transform domain.
","[{'version': 'v1', 'created': 'Wed, 25 Nov 2009 21:41:40 GMT'}]",2015-05-14,"[['Li', 'Lianlin', ''], ['Jafarpour', 'Behnam', '']]","['automatic history matching', 'the sparsity constraint', 'Bayesian estimation', 'Laplace']"
1907,1610.04533,Issa Atoum,"Issa Atoum, Ahmed Otoom and Narayanan Kulathuramaiyer","A Comprehensive Comparative Study of Word and Sentence Similarity
  Measures","7 pages,4 figures","International Journal of Computer Applications,2016,135(1),
  Foundation of Computer Science (FCS), NY, USA",10.5120/ijca2016908259,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sentence similarity is considered the basis of many natural language tasks
such as information retrieval, question answering and text summarization. The
semantic meaning between compared text fragments is based on the words semantic
features and their relationships. This article reviews a set of word and
sentence similarity measures and compares them on benchmark datasets. On the
studied datasets, results showed that hybrid semantic measures perform better
than both knowledge and corpus based measures.
","[{'version': 'v1', 'created': 'Wed, 17 Feb 2016 19:33:47 GMT'}]",2016-10-17,"[['Atoum', 'Issa', ''], ['Otoom', 'Ahmed', ''], ['Kulathuramaiyer', 'Narayanan', '']]","['Word Similarity', 'Sentence Similarity', 'Corpus Measures', 'Knowledge Measures', 'Hybrid Measures', 'Text Similarity']"
1908,1802.06501,Xiangyu Zhao,"Xiangyu Zhao and Liang Zhang and Zhuoye Ding and Long Xia and Jiliang
  Tang and Dawei Yin","Recommendations with Negative Feedback via Pairwise Deep Reinforcement
  Learning",arXiv admin note: substantial text overlap with arXiv:1801.00209,,10.1145/3219819.3219886,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender systems play a crucial role in mitigating the problem of
information overload by suggesting users' personalized items or services. The
vast majority of traditional recommender systems consider the recommendation
procedure as a static process and make recommendations following a fixed
strategy. In this paper, we propose a novel recommender system with the
capability of continuously improving its strategies during the interactions
with users. We model the sequential interactions between users and a
recommender system as a Markov Decision Process (MDP) and leverage
Reinforcement Learning (RL) to automatically learn the optimal strategies via
recommending trial-and-error items and receiving reinforcements of these items
from users' feedback. Users' feedback can be positive and negative and both
types of feedback have great potentials to boost recommendations. However, the
number of negative feedback is much larger than that of positive one; thus
incorporating them simultaneously is challenging since positive feedback could
be buried by negative one. In this paper, we develop a novel approach to
incorporate them into the proposed deep recommender system (DEERS) framework.
The experimental results based on real-world e-commerce data demonstrate the
effectiveness of the proposed framework. Further experiments have been
conducted to understand the importance of both positive and negative feedback
in recommendations.
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 02:30:10 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jun 2018 11:49:04 GMT'}, {'version': 'v3', 'created': 'Fri, 10 Aug 2018 02:33:08 GMT'}]",2018-08-13,"[['Zhao', 'Xiangyu', ''], ['Zhang', 'Liang', ''], ['Ding', 'Zhuoye', ''], ['Xia', 'Long', ''], ['Tang', 'Jiliang', ''], ['Yin', 'Dawei', '']]","['Recommender System', 'Deep Reinforcement Learning', 'PairwiseDeep Q-Network']"
1909,1706.06527,Daniel S. Katz,Udit Nangia and Daniel S. Katz,"Understanding Software in Research: Initial Results from Examining
  Nature and a Call for Collaboration","lightning talk submitted to WSSSPE5.2
  (http://wssspe.researchcomputing.org.uk/wssspe5/)",,10.1109/eScience.2017.78,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This lightning talk paper discusses an initial data set that has been
gathered to understand the use of software in research, and is intended to
spark wider interest in gathering more data. The initial data analyzes three
months of articles in the journal Nature for software mentions. The wider
activity that we seek is a community effort to analyze a wider set of articles,
including both a longer timespan of Nature articles as well as articles in
other journals. Such a collection of data could be used to understand how the
role of software has changed over time and how it varies across fields.
","[{'version': 'v1', 'created': 'Tue, 20 Jun 2017 15:54:34 GMT'}]",2018-07-23,"[['Nangia', 'Udit', ''], ['Katz', 'Daniel S.', '']]","['software use', 'software in literature', 'software citation']"
1910,1303.4293,Tobias Kuhn,Kaarel Kaljurand and Tobias Kuhn,"A Multilingual Semantic Wiki Based on Attempto Controlled English and
  Grammatical Framework","To appear in the Proceedings of the 10th Extended Semantic Web
  Conference (ESWC 2013)",,10.1007/978-3-642-38288-8_29,LNCS 7882,cs.CL cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a semantic wiki system with an underlying controlled natural
language grammar implemented in Grammatical Framework (GF). The grammar
restricts the wiki content to a well-defined subset of Attempto Controlled
English (ACE), and facilitates a precise bidirectional automatic translation
between ACE and language fragments of a number of other natural languages,
making the wiki content accessible multilingually. Additionally, our approach
allows for automatic translation into the Web Ontology Language (OWL), which
enables automatic reasoning over the wiki content. The developed wiki
environment thus allows users to build, query and view OWL knowledge bases via
a user-friendly multilingual natural language interface. As a further feature,
the underlying multilingual grammar is integrated into the wiki and can be
collaboratively edited to extend the vocabulary of the wiki or even customize
its sentence structures. This work demonstrates the combination of the existing
technologies of Attempto Controlled English and Grammatical Framework, and is
implemented as an extension of the existing semantic wiki engine AceWiki.
","[{'version': 'v1', 'created': 'Mon, 11 Mar 2013 08:10:39 GMT'}]",2013-08-13,"[['Kaljurand', 'Kaarel', ''], ['Kuhn', 'Tobias', '']]","['semantic wiki', 'multilinguality', 'controlled natural language', 'AttemptoControlled English', 'Grammatical Framework']"
1911,1003.0358,Dan Ciresan,"Dan Claudiu Ciresan, Ueli Meier, Luca Maria Gambardella, Juergen
  Schmidhuber",Deep Big Simple Neural Nets Excel on Handwritten Digit Recognition,"14 pages, 2 figures, 4 listings","Neural Computation, Volume 22, Number 12, December 2010",10.1162/NECO_a_00052,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Good old on-line back-propagation for plain multi-layer perceptrons yields a
very low 0.35% error rate on the famous MNIST handwritten digits benchmark. All
we need to achieve this best result so far are many hidden layers, many neurons
per layer, numerous deformed training images, and graphics cards to greatly
speed up learning.
","[{'version': 'v1', 'created': 'Mon, 1 Mar 2010 14:32:11 GMT'}]",2012-03-06,"[['Ciresan', 'Dan Claudiu', ''], ['Meier', 'Ueli', ''], ['Gambardella', 'Luca Maria', ''], ['Schmidhuber', 'Juergen', '']]","['NN (Neural Network)', 'MLP (Multilayer Perceptron)', 'GPU (Graphics']"
1912,1608.07019,Haozhe Xie,"Haozhe Xie, Jie Li, Qiaosheng Zhang and Yadong Wang","Comparison among dimensionality reduction techniques based on Random
  Projection for cancer classification",,"Computational biology and chemistry, 65: 165-172, 2016",10.1016/j.compbiolchem.2016.09.010,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Random Projection (RP) technique has been widely applied in many scenarios
because it can reduce high-dimensional features into low-dimensional space
within short time and meet the need of real-time analysis of massive data.
There is an urgent need of dimensionality reduction with fast increase of big
genomics data. However, the performance of RP is usually lower. We attempt to
improve classification accuracy of RP through combining other reduction
dimension methods such as Principle Component Analysis (PCA), Linear
Discriminant Analysis (LDA), and Feature Selection (FS). We compared
classification accuracy and running time of different combination methods on
three microarray datasets and a simulation dataset. Experimental results show a
remarkable improvement of 14.77% in classification accuracy of FS followed by
RP compared to RP on BC-TCGA dataset. LDA followed by RP also helps RP to yield
a more discriminative subspace with an increase of 13.65% on classification
accuracy on the same dataset. FS followed by RP outperforms other combination
methods in classification accuracy on most of the datasets.
","[{'version': 'v1', 'created': 'Thu, 25 Aug 2016 05:14:57 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Feb 2017 13:56:03 GMT'}, {'version': 'v3', 'created': 'Thu, 23 Feb 2017 02:52:17 GMT'}, {'version': 'v4', 'created': 'Tue, 30 May 2017 01:59:19 GMT'}, {'version': 'v5', 'created': 'Sat, 17 Jun 2017 04:12:57 GMT'}]",2017-06-20,"[['Xie', 'Haozhe', ''], ['Li', 'Jie', ''], ['Zhang', 'Qiaosheng', ''], ['Wang', 'Yadong', '']]","['Random Projection', 'Dimensionality reduction', 'Classification', 'Breast cancer']"
1913,1611.06159,Yipei Wang,"Yan Xu, Siyuan Shan, Ziming Qiu, Zhipeng Jia, Zhengyang Shen, Yipei
  Wang, Mengfei Shi, Eric I-Chao Chang","End-to-End Subtitle Detection and Recognition for Videos in East Asian
  Languages via CNN Ensemble with Near-Human-Level Performance",35 pages,,10.1016/j.image.2017.09.013,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose an innovative end-to-end subtitle detection and
recognition system for videos in East Asian languages. Our end-to-end system
consists of multiple stages. Subtitles are firstly detected by a novel image
operator based on the sequence information of consecutive video frames. Then,
an ensemble of Convolutional Neural Networks (CNNs) trained on synthetic data
is adopted for detecting and recognizing East Asian characters. Finally, a
dynamic programming approach leveraging language models is applied to
constitute results of the entire body of text lines. The proposed system
achieves average end-to-end accuracies of 98.2% and 98.3% on 40 videos in
Simplified Chinese and 40 videos in Traditional Chinese respectively, which is
a significant outperformance of other existing methods. The near-perfect
accuracy of our system dramatically narrows the gap between human cognitive
ability and state-of-the-art algorithms used for such a task.
","[{'version': 'v1', 'created': 'Fri, 18 Nov 2016 17:09:14 GMT'}]",2017-11-27,"[['Xu', 'Yan', ''], ['Shan', 'Siyuan', ''], ['Qiu', 'Ziming', ''], ['Jia', 'Zhipeng', ''], ['Shen', 'Zhengyang', ''], ['Wang', 'Yipei', ''], ['Shi', 'Mengfei', ''], ['Chang', 'Eric I-Chao', '']]","['Subtitle text detection', 'Subtitle text recognition', 'Synthetic']"
1914,1707.05199,Piyush Srivastava,Leonard J. Schulman and Piyush Srivastava,Online codes for analog signals,,"IEEE Trans. Inf. Theory. ""Early access"", 2019. DOI:
  10.1109/TIT.2019.2919632",10.1109/TIT.2019.2919632,,cs.DM cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper revisits a classical scenario in communication theory: a waveform
sampled at regular intervals is to be encoded so as to minimize distortion in
its reconstruction, despite noise. This transformation must be online (causal),
to enable real-time signaling; and should use no more power than the original
signal. The noise model we consider is an ""atomic norm"" convex relaxation of
the standard (discrete alphabet) Hamming-weight-bounded model: namely,
adversarial $\ell_1$-bounded. In the ""block coding"" (noncausal) setting, such
encoding is possible due to the existence of large almost-Euclidean sections in
$\ell_1$ spaces, a notion first studied in the work of Dvoretzky in 1961. Our
main result is that an analogous result is achievable even causally.
Equivalently, our work may be seen as a ""lower triangular"" version of $\ell_1$
Dvoretzky theorems. In terms of communication, the guarantees are expressed in
terms of certain time-weighted norms: the time-weighted $\ell_2$ norm imposed
on the decoder forces increasingly accurate reconstruction of the distant past
signal, while the time-weighted $\ell_1$ norm on the noise ensures vanishing
interference from distant past noise. Encoding is linear (hence easy to
implement in analog hardware). Decoding is performed by an LP analogous to
those used in compressed sensing.
","[{'version': 'v1', 'created': 'Mon, 17 Jul 2017 14:57:40 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Feb 2018 15:10:03 GMT'}, {'version': 'v3', 'created': 'Sat, 1 Jun 2019 17:48:44 GMT'}]",2019-06-04,"[['Schulman', 'Leonard J.', ''], ['Srivastava', 'Piyush', '']]","['Online coding', 'Dvoretzky theorems', 'Analog signals', 'Random matrices']"
1915,1406.3877,Fuan Pu,"Fuan Pu, Jian Luo, Yulai Zhang, and Guiming Luo",Argument Ranking with Categoriser Function,,,10.1007/978-3-319-12096-6_26,,cs.AI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Recently, ranking-based semantics is proposed to rank-order arguments from
the most acceptable to the weakest one(s), which provides a graded assessment
to arguments. In general, the ranking on arguments is derived from the strength
values of the arguments. Categoriser function is a common approach that assigns
a strength value to a tree of arguments. When it encounters an argument system
with cycles, then the categoriser strength is the solution of the non-linear
equations. However, there is no detail about the existence and uniqueness of
the solution, and how to find the solution (if exists). In this paper, we will
cope with these issues via fixed point technique. In addition, we define the
categoriser-based ranking semantics in light of categoriser strength, and
investigate some general properties of it. Finally, the semantics is shown to
satisfy some of the axioms that a ranking-based semantics should satisfy.
","[{'version': 'v1', 'created': 'Mon, 16 Jun 2014 01:19:02 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Jul 2014 14:40:27 GMT'}]",2014-12-04,"[['Pu', 'Fuan', ''], ['Luo', 'Jian', ''], ['Zhang', 'Yulai', ''], ['Luo', 'Guiming', '']]","['abstract argumentation', 'ranking semantics', 'graded assessment', 'categoriser function', 'fixed point technique']"
1916,1708.05905,Lesandro Ponciano,"Lesandro Ponciano and Pedro Barbosa and Francisco Brasileiro and
  Andrey Brito and Nazareno Andrade","Designing for Pragmatists and Fundamentalists: Privacy Concerns and
  Attitudes on the Internet of Things","XVI Brazilian Symposium on Human Factors in Computing Systems
  (IHC'17), October 23-27, 2017, Joinville, SC, Brazil","In Proceedings of IHC 2017. ACM, US, Article 21, 10 pages (2017)",10.1145/3160504.3160545,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet of Things (IoT) systems have aroused enthusiasm and concerns.
Enthusiasm comes from their utilities in people daily life, and concerns may be
associated with privacy issues. By using two IoT systems as case-studies, we
examine users' privacy beliefs, concerns and attitudes. We focus on four major
dimensions: the collection of personal data, the inference of new information,
the exchange of information to third parties, and the risk-utility trade-off
posed by the features of the system. Altogether, 113 Brazilian individuals
answered a survey about such dimensions. Although their perceptions seem to be
dependent on the context, there are recurrent patterns. Our results suggest
that IoT users can be classified into unconcerned, fundamentalists and
pragmatists. Most of them exhibit a pragmatist profile and believe in privacy
as a right guaranteed by law. One of the most privacy concerning aspect is the
exchange of personal information to third parties. Individuals' perceived risk
is negatively correlated with their perceived utility in the features of the
system. We discuss practical implications of these results and suggest
heuristics to cope with privacy concerns when designing IoT systems.
","[{'version': 'v1', 'created': 'Sat, 19 Aug 2017 22:15:58 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Jan 2018 16:05:41 GMT'}, {'version': 'v3', 'created': 'Tue, 30 Jul 2019 15:07:58 GMT'}]",2019-07-31,"[['Ponciano', 'Lesandro', ''], ['Barbosa', 'Pedro', ''], ['Brasileiro', 'Francisco', ''], ['Brito', 'Andrey', ''], ['Andrade', 'Nazareno', '']]","['Privacy perceptions', 'Concerns about privacy', 'Internet ofThings', 'Information Boundary', 'Face Keeping']"
1917,1805.11537,Ludovik Coba <,"Ludovik Coba, Markus Zanker, Laurens Rook, Panagiotis Symeonidis","Decision Making of Maximizers and Satisficers Based on Collaborative
  Explanations",,,10.1145/3301275.3302304,,cs.IR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rating-based summary statistics are ubiquitous in e-commerce, and often are
crucial components in personalized recommendation mechanisms. Largely left
unexplored, however, is the issue to what extent the descriptives of rating
distributions influence the decision making of online consumers. We conducted a
conjoint experiment to explore how different summarizations of rating
distributions (i.e., in the form of the number of ratings, mean, variance,
skewness or the origin of the ratings) impact users' decision making. Results
from over 200 participants indicate that users are primarily guided by the mean
and the number of ratings and to a lesser degree by the variance, and the
origin of a rating. We also looked into the maximizing behavioral tendencies of
our participants, and found that in particular participants scoring high on the
Decision Difficulty subscale displayed other sensitivities regarding the way in
which rating distributions were summarized than others.
","[{'version': 'v1', 'created': 'Tue, 29 May 2018 15:15:15 GMT'}]",2019-05-31,"[['Coba', 'Ludovik', ''], ['Zanker', 'Markus', ''], ['Rook', 'Laurens', ''], ['Symeonidis', 'Panagiotis', '']]","['recommender systems', 'maximizers', 'satisficers', 'user studies', 'explanations']"
1918,1709.03187,Darren Chitty,Darren M. Chitty,Applying ACO To Large Scale TSP Instances,,"UK Workshop on Computational Intelligence, pp. 104-118. Springer,
  Cham, 2017",10.1007/978-3-319-66939-7_9,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ant Colony Optimisation (ACO) is a well known metaheuristic that has proven
successful at solving Travelling Salesman Problems (TSP). However, ACO suffers
from two issues; the first is that the technique has significant memory
requirements for storing pheromone levels on edges between cities and second,
the iterative probabilistic nature of choosing which city to visit next at
every step is computationally expensive. This restricts ACO from solving larger
TSP instances. This paper will present a methodology for deploying ACO on
larger TSP instances by removing the high memory requirements, exploiting
parallel CPU hardware and introducing a significant efficiency saving measure.
The approach results in greater accuracy and speed. This enables the proposed
ACO approach to tackle TSP instances of up to 200K cities within reasonable
timescales using a single CPU. Speedups of as much as 1200 fold are achieved by
the technique.
","[{'version': 'v1', 'created': 'Sun, 10 Sep 2017 22:21:36 GMT'}]",2017-09-12,"[['Chitty', 'Darren M.', '']]","['Ant Colony Optimisation', 'Travelling Salesman Problem', 'High Performance Computing']"
1919,0808.0037,Caleb Lo,"Caleb K. Lo, Sriram Vishwanath and Robert W. Heath Jr","An Energy-Based Comparison of Long-Hop and Short-Hop Routing in MIMO
  Networks","27 pages, 12 figures, submitted to IEEE Transactions on Vehicular
  Technology in March 2009, revised in July 2009",,10.1109/TVT.2009.2033075,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the problem of selecting either routes that consist of
long hops or routes that consist of short hops in a network of multiple-antenna
nodes, where each transmitting node employs spatial multiplexing. This
distance-dependent route selection problem is approached from the viewpoint of
energy efficiency, where a route is selected with the objective of minimizing
the transmission energy consumed while satisfying a target outage criterion at
the final destination. Deterministic line networks and two-dimensional random
networks are considered. It is shown that when 1) the number of hops traversed
between the source and destination grows large or 2) when the target success
probability approaches one or 3) when the number of transmit and/or receive
antennas grows large, short-hop routing requires less energy than long-hop
routing. It is also shown that if both routing strategies are subject to the
same delay constraint, long-hop routing requires less energy than short-hop
routing as the target success probability approaches one. In addition,
numerical analysis indicates that given loose outage constraints, only a small
number of transmit antennas are needed for short-hop routing to have its
maximum advantage over long-hop routing, while given stringent outage
constraints, the advantage of short-hop over long-hop routing always increases
with additional transmit antennas.
","[{'version': 'v1', 'created': 'Thu, 31 Jul 2008 23:30:33 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Sep 2008 00:13:07 GMT'}, {'version': 'v3', 'created': 'Thu, 19 Mar 2009 00:34:44 GMT'}, {'version': 'v4', 'created': 'Tue, 14 Jul 2009 02:15:11 GMT'}]",2016-11-18,"[['Lo', 'Caleb K.', ''], ['Vishwanath', 'Sriram', ''], ['Heath', 'Robert W.', 'Jr']]","['Random networks', 'large-antenna limits', 'multiple antennas', 'relays']"
1920,1405.1814,Gayathri V,Thangaraj M and Gayathri V,A Retrieval Mechanism for Multi-versioned Digital Collection Using TAG,"6 pages, 7 figures, Published with International Journal of Computer
  & Organization Trends (IJCOT)","Dr. M. Thangaraj , V. Gayathri. ""A Retrieval Mechanism for
  Multi-versioned Digital Collection Using TAG"", International Journal of
  Computer & organization Trends (IJCOT),V7(1):14-19 April 2014. ISSN:2249-2593",10.14445/22492593/IJCOT-V7P303,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As the marvellous growth of the digital library in each year, the problems
with indexing and searching a digital library is increased in a high rate. When
the researchers search for the earlier versions, only a few recent versions in
the back volumes can be retrieved soon. It is unpredictable that researchers
require the earlier versions in a specific boundary. In order to facilitate the
researchers, who may access any version at any time, we propose a VTAG
technique for indexing. Our experiments indicate that the proposed retrieval
technique, VTAG, effectively retrieves any version in considerable amount of
time than the existing method.
","[{'version': 'v1', 'created': 'Thu, 8 May 2014 06:48:03 GMT'}]",2014-05-09,"[['M', 'Thangaraj', ''], ['V', 'Gayathri', '']]","['Version Retrieval', 'TAG tree', 'VTAG', 'Digital library', 'Information retrieval', 'Version Management']"
1921,1701.09123,Rodrigo Agerri,Rodrigo Agerri and German Rigau,"Robust Multilingual Named Entity Recognition with Shallow
  Semi-Supervised Features","26 pages, 19 tables (submitted for publication on September 2015),
  Artificial Intelligence (2016)","Artificial Intelligence, 238, 63-82 (2016)",10.1016/j.artint.2016.05.003,,cs.CL cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We present a multilingual Named Entity Recognition approach based on a robust
and general set of features across languages and datasets. Our system combines
shallow local information with clustering semi-supervised features induced on
large amounts of unlabeled text. Understanding via empirical experimentation
how to effectively combine various types of clustering features allows us to
seamlessly export our system to other datasets and languages. The result is a
simple but highly competitive system which obtains state of the art results
across five languages and twelve datasets. The results are reported on standard
shared task evaluation data such as CoNLL for English, Spanish and Dutch.
Furthermore, and despite the lack of linguistically motivated features, we also
report best results for languages such as Basque and German. In addition, we
demonstrate that our method also obtains very competitive results even when the
amount of supervised data is cut by half, alleviating the dependency on
manually annotated data. Finally, the results show that our emphasis on
clustering features is crucial to develop robust out-of-domain models. The
system and models are freely available to facilitate its use and guarantee the
reproducibility of results.
","[{'version': 'v1', 'created': 'Tue, 31 Jan 2017 16:36:06 GMT'}]",2017-02-03,"[['Agerri', 'Rodrigo', ''], ['Rigau', 'German', '']]","['Named Entity Recognition', 'Information Extraction', 'Word representations', 'Semisupervised learning', 'Natural Language Processing']"
1922,1505.05338,Poorna Dasgupta,Poorna Banerjee Dasgupta,"Algorithmic Analysis of Edge Ranking and Profiling for MTF Determination
  of an Imaging System","3 pages, Published with International Journal of Computer Trends and
  Technology (IJCTT), Volume-23 Number-1, 2015","International Journal of Computer Trends and Technology (IJCTT)
  V23(1):46-48, May 2015",10.14445/22312803/IJCTT-V23P110,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Edge detection is one of the most principal techniques for detecting
discontinuities in the gray levels of image pixels. The Modulation Transfer
Function (MTF) is one of the main criteria for assessing imaging quality and is
a parameter frequently used for measuring the sharpness of an imaging system.
In order to determine the MTF, it is essential to determine the best edge from
the target image so that an edge profile can be developed and then the line
spread function and hence the MTF, can be computed accordingly. For regular
image sizes, the human visual system is adept enough to identify suitable edges
from the image. But considering huge image datasets, such as those obtained
from satellites, the image size may range in few gigabytes and in such a case,
manual inspection of images for determination of the best suitable edge is not
plausible and hence, edge profiling tasks have to be automated. This paper
presents a novel, yet simple, algorithm for edge ranking and detection from
image data-sets for MTF computation, which is ideal for automation on
vectorised graphical processing units.
","[{'version': 'v1', 'created': 'Wed, 20 May 2015 12:12:48 GMT'}]",2015-05-21,"[['Dasgupta', 'Poorna Banerjee', '']]","['Edge', 'Image', 'Modulation Transfer Function (MTF)']"
1923,1602.00217,Gustau Camps-Valls,"Valero Laparra, Juan Guti\'errez, Gustavo Camps-Valls, Jes\'us Malo",Image Denoising with Kernels based on Natural Image Relations,,Journal of Machine Learning Research 11: 873-903 (2010),10.1145/1756006.1756035,,cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A successful class of image denoising methods is based on Bayesian approaches
working in wavelet representations. However, analytical estimates can be
obtained only for particular combinations of analytical models of signal and
noise, thus precluding its straightforward extension to deal with other
arbitrary noise sources. In this paper, we propose an alternative non-explicit
way to take into account the relations among natural image wavelet coefficients
for denoising: we use support vector regression (SVR) in the wavelet domain to
enforce these relations in the estimated signal. Since relations among the
coefficients are specific to the signal, the regularization property of SVR is
exploited to remove the noise, which does not share this feature. The specific
signal relations are encoded in an anisotropic kernel obtained from mutual
information measures computed on a representative image database. Training
considers minimizing the Kullback-Leibler divergence (KLD) between the
estimated and actual probability functions of signal and noise in order to
enforce similarity. Due to its non-parametric nature, the method can eventually
cope with different noise sources without the need of an explicit
re-formulation, as it is strictly necessary under parametric Bayesian
formalisms. Results under several noise levels and noise sources show that: (1)
the proposed method outperforms conventional wavelet methods that assume
coefficient independence, (2) it is similar to state-of-the-art methods that do
explicitly include these relations when the noise source is Gaussian, and (3)
it gives better numerical and visual performance when more complex, realistic
noise sources are considered. Therefore, the proposed machine learning approach
can be seen as a more flexible (model-free) alternative to the explicit
description of wavelet coefficient relations for image denoising.
","[{'version': 'v1', 'created': 'Sun, 31 Jan 2016 10:02:14 GMT'}]",2016-02-02,"[['Laparra', 'Valero', ''], ['Gutiérrez', 'Juan', ''], ['Camps-Valls', 'Gustavo', ''], ['Malo', 'Jesús', '']]","['Natural Images', 'Statistical Relations', 'Image Denoising', 'Wavelets', 'Non-parametricmethods', 'Kernel', 'Mutual Information', 'Regularization']"
1924,1312.4074,Srinjoy Ganguly Mr.,"Srinjoy Ganguly, Digbalay Bose and Amit Konar","Clustering using Vector Membership: An Extension of the Fuzzy C-Means
  Algorithm","6 pages, 8 figures and 1 table (Conference Paper)","Proceedings of the IEEE International Conference on Advanced
  Computing (ICoAC)-2013, pp.XX-XX,Chennai, India, 18 - 20 December (2013)",10.1109/ICoAC.2013.6921922,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering is an important facet of explorative data mining and finds
extensive use in several fields. In this paper, we propose an extension of the
classical Fuzzy C-Means clustering algorithm. The proposed algorithm,
abbreviated as VFC, adopts a multi-dimensional membership vector for each data
point instead of the traditional, scalar membership value defined in the
original algorithm. The membership vector for each point is obtained by
considering each feature of that point separately and obtaining individual
membership values for the same. We also propose an algorithm to efficiently
allocate the initial cluster centers close to the actual centers, so as to
facilitate rapid convergence. Further, we propose a scheme to achieve crisp
clustering using the VFC algorithm. The proposed, novel clustering scheme has
been tested on two standard data sets in order to analyze its performance. We
also examine the efficacy of the proposed scheme by analyzing its performance
on image segmentation examples and comparing it with the classical Fuzzy
C-means clustering algorithm.
","[{'version': 'v1', 'created': 'Sat, 14 Dec 2013 18:11:33 GMT'}]",2016-11-18,"[['Ganguly', 'Srinjoy', ''], ['Bose', 'Digbalay', ''], ['Konar', 'Amit', '']]","['Clustering', 'Fuzzy C-means', 'vector membership', 'VFC', 'IRIS', 'WBCD', 'Image Segmentation']"
1925,1306.1338,Anuj Gupta Prof.,"Anuj K. Gupta, Harsh Sadawarti and Anil K. Verma",Implementation of DYMO routing protocol,"9 pages, 6 figures, 1 table",,10.5121/ijitmc.2013.1205,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile ad hoc networks communicate without any fixed infrastructure or ant
centralized domain. All the nodes are free to move randomly within the network
and share information dynamically. To achieve an efficient routing various
protocols have been developed so far which vary in their nature and have their
own salient properties. In this paper, we have discussed one of the latest
protocols i.e. Dynamic Manet on demand (DYMO) routing Protocol, implemented and
analysed its performance with other similar protocols against different
parameters. Finally a comparison has been presented between all of them.
","[{'version': 'v1', 'created': 'Thu, 6 Jun 2013 08:42:28 GMT'}]",2013-06-07,"[['Gupta', 'Anuj K.', ''], ['Sadawarti', 'Harsh', ''], ['Verma', 'Anil K.', '']]","['Mobile Ad hoc Networks', 'DYMO', 'AODV', 'DSR', 'DSDV']"
1926,1812.11587,Moin Khan,"Moin Khan, Kamran Malik","Sentiment Classification of Customer Reviews about Automobiles in Roman
  Urdu","This is a pre-print of a contribution published in Advances in
  Intelligent Systems and Computing (editors: Kohei Arai, Supriya Kapoor and
  Rahul Bhatia) published by Springer, Cham. The final authenticated version is
  available online at: https://doi.org/10.1007/978-3-030-03405-4_44","Advances in Intelligent Systems and Computing, vol 887 (2018)
  630-640",10.1007/978-3-030-03405-4_44,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Text mining is a broad field having sentiment mining as its important
constituent in which we try to deduce the behavior of people towards a specific
item, merchandise, politics, sports, social media comments, review sites etc.
Out of many issues in sentiment mining, analysis and classification, one major
issue is that the reviews and comments can be in different languages like
English, Arabic, Urdu etc. Handling each language according to its rules is a
difficult task. A lot of research work has been done in English Language for
sentiment analysis and classification but limited sentiment analysis work is
being carried out on other regional languages like Arabic, Urdu and Hindi. In
this paper, Waikato Environment for Knowledge Analysis (WEKA) is used as a
platform to execute different classification models for text classification of
Roman Urdu text. Reviews dataset has been scrapped from different automobiles
sites. These extracted Roman Urdu reviews, containing 1000 positive and 1000
negative reviews, are then saved in WEKA attribute-relation file format (arff)
as labeled examples. Training is done on 80% of this data and rest of it is
used for testing purpose which is done using different models and results are
analyzed in each case. The results show that Multinomial Naive Bayes
outperformed Bagging, Deep Neural Network, Decision Tree, Random Forest,
AdaBoost, k-NN and SVM Classifiers in terms of more accuracy, precision, recall
and F-measure.
","[{'version': 'v1', 'created': 'Sun, 30 Dec 2018 18:50:35 GMT'}]",2019-01-15,"[['Khan', 'Moin', ''], ['Malik', 'Kamran', '']]","['Sentiment Analysis', 'Customer Reviews', 'Automobiles', 'WEKA', 'Roman Urdu']"
1927,1809.09399,Sergey Sukhov,"Mikhail Iu. Leontev, Viktoriia Islenteva, Sergey V. Sukhov",Non-Iterative Knowledge Fusion in Deep Convolutional Neural Networks,"19 pages, 8 figures",,10.1007/s11063-019-10074-0,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Incorporation of a new knowledge into neural networks with simultaneous
preservation of the previous one is known to be a nontrivial problem. This
problem becomes even more complex when new knowledge is contained not in new
training examples, but inside the parameters (connection weights) of another
neural network. Here we propose and test two methods allowing combining the
knowledge contained in separate networks. One method is based on a simple
operation of summation of weights of constituent neural networks. Another
method assumes incorporation of a new knowledge by modification of weights
nonessential for the preservation of already stored information. We show that
with these methods the knowledge from one network can be transferred into
another one non-iteratively without requiring training sessions. The fused
network operates efficiently, performing classification far better than a
chance level. The efficiency of the methods is quantified on several publicly
available data sets in classification tasks both for shallow and deep neural
networks.
","[{'version': 'v1', 'created': 'Tue, 25 Sep 2018 10:29:18 GMT'}]",2019-09-10,"[['Leontev', 'Mikhail Iu.', ''], ['Islenteva', 'Viktoriia', ''], ['Sukhov', 'Sergey V.', '']]","['knowledge fusion', 'transfer learning', 'convolutional neural networks', 'non-iterative learning']"
1928,1711.06439,Holger Roth,"Holger Roth, Masahiro Oda, Natsuki Shimizu, Hirohisa Oda, Yuichiro
  Hayashi, Takayuki Kitasaka, Michitaka Fujiwara, Kazunari Misawa, Kensaku Mori","Towards dense volumetric pancreas segmentation in CT using 3D fully
  convolutional networks","Accepted for oral presentation at SPIE Medical Imaging 2018, Houston,
  TX, USA Updated experiment in Fig. 4",Medical Imaging 2018: Image Processing,10.1117/12.2293499,Published in SPIE Proceedings Vol. 10574,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pancreas segmentation in computed tomography imaging has been historically
difficult for automated methods because of the large shape and size variations
between patients. In this work, we describe a custom-build 3D fully
convolutional network (FCN) that can process a 3D image including the whole
pancreas and produce an automatic segmentation. We investigate two variations
of the 3D FCN architecture; one with concatenation and one with summation skip
connections to the decoder part of the network. We evaluate our methods on a
dataset from a clinical trial with gastric cancer patients, including 147
contrast enhanced abdominal CT scans acquired in the portal venous phase. Using
the summation architecture, we achieve an average Dice score of 89.7 $\pm$ 3.8
(range [79.8, 94.8]) % in testing, achieving the new state-of-the-art
performance in pancreas segmentation on this dataset.
","[{'version': 'v1', 'created': 'Fri, 17 Nov 2017 07:26:39 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Jan 2018 02:14:48 GMT'}]",2018-03-15,"[['Roth', 'Holger', ''], ['Oda', 'Masahiro', ''], ['Shimizu', 'Natsuki', ''], ['Oda', 'Hirohisa', ''], ['Hayashi', 'Yuichiro', ''], ['Kitasaka', 'Takayuki', ''], ['Fujiwara', 'Michitaka', ''], ['Misawa', 'Kazunari', ''], ['Mori', 'Kensaku', '']]","['fully convolutional networks', 'deep learning', 'pancreas', 'segmentation', 'computed tomography']"
1929,1304.3563,Abdulaziz Alazemi,Abdul-Aziz Rashid Al-Azmi,"Data, text and web mining for business intelligence: a survey","21 page, journal paper","International Journal of Data Mining & Knowledge Management
  Process (IJDKP) Vol.3, No.2, March 2013",10.5121/ijdkp.2013.3201,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Information and Communication Technologies revolution brought a digital
world with huge amounts of data available. Enterprises use mining technologies
to search vast amounts of data for vital insight and knowledge. Mining tools
such as data mining, text mining, and web mining are used to find hidden
knowledge in large databases or the Internet.
","[{'version': 'v1', 'created': 'Fri, 12 Apr 2013 08:04:31 GMT'}]",2013-04-15,"[['Al-Azmi', 'Abdul-Aziz Rashid', '']]","['business intelligence', 'competitive advantage', 'data mining', 'information systems', 'knowledge discovery   1']"
1930,1811.10945,Valentin Zieglmeier,"Valentin Zieglmeier and Severin Kacianka and Thomas Hutzelmann and
  Alexander Pretschner",A Real-Time Remote IDS Testbed for Connected Vehicles,"Peer-reviewed version accepted for publication in the proceedings of
  the 34th ACM/SIGAPP Symposium On Applied Computing (SAC'19)",,10.1145/3297280.3297465,,cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Connected vehicles are becoming commonplace. A constant connection between
vehicles and a central server enables new features and services. This added
connectivity raises the likelihood of exposure to attackers and risks
unauthorized access. A possible countermeasure to this issue are intrusion
detection systems (IDS), which aim at detecting these intrusions during or
after their occurrence. The problem with IDS is the large variety of possible
approaches with no sensible option for comparing them. Our contribution to this
problem comprises the conceptualization and implementation of a testbed for an
automotive real-world scenario. That amounts to a server-side IDS detecting
intrusions into vehicles remotely. To verify the validity of our approach, we
evaluate the testbed from multiple perspectives, including its fitness for
purpose and the quality of the data it generates. Our evaluation shows that the
testbed makes the effective assessment of various IDS possible. It solves
multiple problems of existing approaches, including class imbalance.
Additionally, it enables reproducibility and generating data of varying
detection difficulties. This allows for comprehensive evaluation of real-time,
remote IDS.
","[{'version': 'v1', 'created': 'Tue, 27 Nov 2018 12:53:28 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Jan 2019 09:45:03 GMT'}]",2020-05-08,"[['Zieglmeier', 'Valentin', ''], ['Kacianka', 'Severin', ''], ['Hutzelmann', 'Thomas', ''], ['Pretschner', 'Alexander', '']]","['IDS', 'Intrusion detection', 'Testbed', 'Connected vehicles']"
1931,1704.07885,Cunlai Pu,"Rongbin Chen, Wei Cui, Cunlai Pu, Jie Li, Bo Ji, Konstantinos Gakis
  and Panos M. Pardalos",Information transmission on hybrid networks,"17 pages, 7 figures",,10.1016/j.physa.2017.08.098,,cs.NI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many real-world communication networks often have hybrid nature with both
fixed nodes and moving modes, such as the mobile phone networks mainly composed
of fixed base stations and mobile phones. In this paper, we discuss the
information transmission process on the hybrid networks with both fixed and
mobile nodes. The fixed nodes (base stations) are connected as a spatial
lattice on the plane forming the information-carrying backbone, while the
mobile nodes (users), which are the sources and destinations of information
packets, connect to their current nearest fixed nodes respectively to deliver
and receive information packets. We observe the phase transition of traffic
load in the hybrid network when the packet generation rate goes from below and
then above a critical value, which measures the network capacity of packets
delivery. We obtain the optimal speed of moving nodes leading to the maximum
network capacity. We further improve the network capacity by rewiring the fixed
nodes and by considering the current load of fixed nodes during packets
transmission. Our purpose is to optimize the network capacity of hybrid
networks from the perspective of network science, and provide some insights for
the construction of future communication infrastructures.
","[{'version': 'v1', 'created': 'Mon, 17 Apr 2017 12:25:17 GMT'}]",2017-10-11,"[['Chen', 'Rongbin', ''], ['Cui', 'Wei', ''], ['Pu', 'Cunlai', ''], ['Li', 'Jie', ''], ['Ji', 'Bo', ''], ['Gakis', 'Konstantinos', ''], ['Pardalos', 'Panos M.', '']]","['Traffic dynamics', 'Network capacity', 'Hybrid networks']"
1932,1703.07307,Andreas Varga,Andreas Varga,On recursive computation of coprime factorizations of rational matrices,"18 pages; article accepted for publication in the Linear Algebra and
  Its Applications",,10.1016/j.laa.2020.01.030,,cs.SY cs.NA math.NA math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  General computational methods based on descriptor state-space realizations
are proposed to compute coprime factorizations of rational matrices with
minimum degree denominators. The new methods rely on recursive pole dislocation
techniques, which allow to successively place all poles of the factors into a
""good"" region of the complex plane. The resulting McMillan degree of the
denominator factor is equal to the number of poles lying in the complementary
""bad"" region and therefore is minimal. The developed pole dislocation
techniques are instrumental for devising numerically reliable procedures for
the computation of coprime factorizations with proper and stable factors of
arbitrary improper rational matrices and coprime factorizations with inner
denominators. Implementation aspects of the proposed algorithms are discussed
and illustrative examples are given.
","[{'version': 'v1', 'created': 'Tue, 21 Mar 2017 16:40:12 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Mar 2017 12:03:42 GMT'}, {'version': 'v3', 'created': 'Sat, 8 Feb 2020 09:41:10 GMT'}]",2020-02-11,"[['Varga', 'Andreas', '']]","['rational matrices', 'coprime factorizations', 'computational methods', 'descriptorsystems']"
1933,1207.4626,Sebastien Verel,"Marie-Eleonore Marmion (LIFL), Clarisse Dhaenens (LIFL, INRIA Lille -
  Nord Europe), Laetitia Jourdan (LIFL, INRIA Lille - Nord Europe), Arnaud
  Liefooghe (LIFL, INRIA Lille - Nord Europe), S\'ebastien Verel (INRIA Lille -
  Nord Europe)",The Road to VEGAS: Guiding the Search over Neutral Networks,"Genetic And Evolutionary Computation Conference, Dublin : Ireland
  (2011)",,10.1145/2001576.2001842,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  VEGAS (Varying Evolvability-Guided Adaptive Search) is a new methodology
proposed to deal with the neutrality property of some optimization problems. ts
main feature is to consider the whole neutral network rather than an arbitrary
solution. Moreover, VEGAS is designed to escape from plateaus based on the
evolvability of solution and a multi-armed bandit. Experiments are conducted on
NK-landscapes with neutrality. Results show the importance of considering the
whole neutral network and of guiding the search cleverly. The impact of the
level of neutrality and of the exploration-exploitation trade-off are deeply
analyzed.
","[{'version': 'v1', 'created': 'Thu, 19 Jul 2012 12:05:15 GMT'}]",2012-07-20,"[['Marmion', 'Marie-Eleonore', '', 'LIFL'], ['Dhaenens', 'Clarisse', '', 'LIFL, INRIA Lille -\n  Nord Europe'], ['Jourdan', 'Laetitia', '', 'LIFL, INRIA Lille - Nord Europe'], ['Liefooghe', 'Arnaud', '', 'LIFL, INRIA Lille - Nord Europe'], ['Verel', 'Sébastien', '', 'INRIA Lille -\n  Nord Europe']]","['Neutrality', 'Local search', 'Evolvability', 'Adaptive search', 'MultiArmed Bandit']"
1934,1812.01804,Huangyi Ge,"Huangyi Ge, Sze Yiu Chau, Bruno Ribeiro, Ninghui Li","Random Spiking and Systematic Evaluation of Defenses Against Adversarial
  Examples",To be appear in ACM CODESPY 2020,,10.1145/3374664.3375736,,cs.LG cs.AI cs.CR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image classifiers often suffer from adversarial examples, which are generated
by strategically adding a small amount of noise to input images to trick
classifiers into misclassification. Over the years, many defense mechanisms
have been proposed, and different researchers have made seemingly contradictory
claims on their effectiveness. We present an analysis of possible adversarial
models, and propose an evaluation framework for comparing different defense
mechanisms. As part of the framework, we introduce a more powerful and
realistic adversary strategy. Furthermore, we propose a new defense mechanism
called Random Spiking (RS), which generalizes dropout and introduces random
noises in the training process in a controlled manner. Evaluations under our
proposed framework suggest RS delivers better protection against adversarial
examples than many existing schemes.
","[{'version': 'v1', 'created': 'Wed, 5 Dec 2018 03:31:07 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Mar 2019 17:08:21 GMT'}, {'version': 'v3', 'created': 'Sat, 12 Oct 2019 20:55:52 GMT'}, {'version': 'v4', 'created': 'Mon, 20 Jan 2020 22:09:40 GMT'}]",2020-01-22,"[['Ge', 'Huangyi', ''], ['Chau', 'Sze Yiu', ''], ['Ribeiro', 'Bruno', ''], ['Li', 'Ninghui', '']]","['random spiking', 'adversarial example', 'neural network']"
1935,1210.3131,Alireza Nemaney Pour,"Shekoofeh Ghiam, Alireza Nemaney Pour",A Survey on Web Spam Detection Methods: Taxonomy,"16 pages, 7 figures, 7 tables",,10.5121/ijnsa.2012.4510,,cs.IR cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web spam refers to some techniques, which try to manipulate search engine
ranking algorithms in order to raise web page position in search engine
results. In the best case, spammers encourage viewers to visit their sites, and
provide undeserved advertisement gains to the page owner. In the worst case,
they use malicious contents in their pages and try to install malware on the
victims machine. Spammers use three kinds of spamming techniques to get higher
score in ranking. These techniques are Link based techniques, hiding techniques
and content-based techniques. Existing spam pages cause distrust to search
engine results. This not only wastes the time of visitors, but also wastes lots
of search engine resources. Hence spam detection methods have been proposed as
a solution for web spam in order to reduce negative effects of spam pages.
Experimental results show that some of these techniques are working well and
can find spam pages more accurate than the others. This paper classifies web
spam techniques and the related detection methods.
","[{'version': 'v1', 'created': 'Thu, 11 Oct 2012 05:58:41 GMT'}]",2012-10-12,"[['Ghiam', 'Shekoofeh', ''], ['Pour', 'Alireza Nemaney', '']]","['Cloaking Detection', 'Hiding Techniques', 'Manipulating Search Engine', 'Redirection', 'Web Spam']"
1936,1003.4802,Jo\~ao Marcos,Jo\~ao Marcos,Automatic Generation of Proof Tactics for Finite-Valued Logics,,"EPTCS 21, 2010, pp. 91-98",10.4204/EPTCS.21.8,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A number of flexible tactic-based logical frameworks are nowadays available
that can implement a wide range of mathematical theories using a common
higher-order metalanguage. Used as proof assistants, one of the advantages of
such powerful systems resides in their responsiveness to extensibility of their
reasoning capabilities, being designed over rule-based programming languages
that allow the user to build her own `programs to construct proofs' - the
so-called proof tactics.
  The present contribution discusses the implementation of an algorithm that
generates sound and complete tableau systems for a very inclusive class of
sufficiently expressive finite-valued propositional logics, and then
illustrates some of the challenges and difficulties related to the algorithmic
formation of automated theorem proving tactics for such logics. The procedure
on whose implementation we will report is based on a generalized notion of
analyticity of proof systems that is intended to guarantee termination of the
corresponding automated tactics on what concerns theoremhood in our targeted
logics.
","[{'version': 'v1', 'created': 'Thu, 25 Mar 2010 04:44:58 GMT'}]",2010-03-26,"[['Marcos', 'João', '']]","['automated theorem proving', 'analyticity', 'rule-based programming', 'rewriting']"
1937,1511.04583,Yanhong Annie Liu,"Yanhong A. Liu, Jon Brandvein, Scott D. Stoller, Bo Lin",Demand-Driven Incremental Object Queries,,"PPDP 2016: Proceedings of the 18th International Symposium on
  Principles and Practice of Declarative Programming, September 2016, Pages
  228-241. ACM Press",10.1145/2967973.2968610,,cs.PL cs.AI cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Object queries are essential in information seeking and decision making in
vast areas of applications. However, a query may involve complex conditions on
objects and sets, which can be arbitrarily nested and aliased. The objects and
sets involved as well as the demand---the given parameter values of
interest---can change arbitrarily. How to implement object queries efficiently
under all possible updates, and furthermore to provide complexity guarantees?
  This paper describes an automatic method. The method allows powerful queries
to be written completely declaratively. It transforms demand as well as all
objects and sets into relations. Most importantly, it defines invariants for
not only the query results, but also all auxiliary values about the objects and
sets involved, including those for propagating demand, and incrementally
maintains all of them. Implementation and experiments with problems from a
variety of application areas, including distributed algorithms and
probabilistic queries, confirm the analyzed complexities, trade-offs, and
significant improvements over prior work.
","[{'version': 'v1', 'created': 'Sat, 14 Nov 2015 17:27:33 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Nov 2015 03:34:09 GMT'}, {'version': 'v3', 'created': 'Fri, 15 Jul 2016 18:06:30 GMT'}]",2020-12-25,"[['Liu', 'Yanhong A.', ''], ['Brandvein', 'Jon', ''], ['Stoller', 'Scott D.', ''], ['Lin', 'Bo', '']]","['object queries', 'demand-driven incremental computation', 'program transformation', 'complexity guarantees']"
1938,1112.6219,Rafi Muhammad,"Muhammad Rafi, M. Shahid Shaikh, Amir Farooq",Document Clustering based on Topic Maps,,"International Journal of Computer Applications 12(1):32-36,
  December 2010",10.5120/1640-2204,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Importance of document clustering is now widely acknowledged by researchers
for better management, smart navigation, efficient filtering, and concise
summarization of large collection of documents like World Wide Web (WWW). The
next challenge lies in semantically performing clustering based on the semantic
contents of the document. The problem of document clustering has two main
components: (1) to represent the document in such a form that inherently
captures semantics of the text. This may also help to reduce dimensionality of
the document, and (2) to define a similarity measure based on the semantic
representation such that it assigns higher numerical values to document pairs
which have higher semantic relationship. Feature space of the documents can be
very challenging for document clustering. A document may contain multiple
topics, it may contain a large set of class-independent general-words, and a
handful class-specific core-words. With these features in mind, traditional
agglomerative clustering algorithms, which are based on either Document Vector
model (DVM) or Suffix Tree model (STC), are less efficient in producing results
with high cluster quality. This paper introduces a new approach for document
clustering based on the Topic Map representation of the documents. The document
is being transformed into a compact form. A similarity measure is proposed
based upon the inferred information through topic maps data and structures. The
suggested method is implemented using agglomerative hierarchal clustering and
tested on standard Information retrieval (IR) datasets. The comparative
experiment reveals that the proposed approach is effective in improving the
cluster quality.
","[{'version': 'v1', 'created': 'Thu, 29 Dec 2011 04:15:48 GMT'}]",2011-12-30,"[['Rafi', 'Muhammad', ''], ['Shaikh', 'M. Shahid', ''], ['Farooq', 'Amir', '']]","['Text Document', 'Document Clustering', 'Algorithm', 'Performance measure']"
1939,1608.08898,Rajasekar Venkatesan,"Meng Joo Er, Rajasekar Venkatesan and Ning Wang",A High Speed Multi-label Classifier based on Extreme Learning Machines,"12 pages, 2 figures, 10 tables",,10.1007/978-3-319-28373-9_37,,cs.LG cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper a high speed neural network classifier based on extreme
learning machines for multi-label classification problem is proposed and
dis-cussed. Multi-label classification is a superset of traditional binary and
multi-class classification problems. The proposed work extends the extreme
learning machine technique to adapt to the multi-label problems. As opposed to
the single-label problem, both the number of labels the sample belongs to, and
each of those target labels are to be identified for multi-label classification
resulting in in-creased complexity. The proposed high speed multi-label
classifier is applied to six benchmark datasets comprising of different
application areas such as multi-media, text and biology. The training time and
testing time of the classifier are compared with those of the state-of-the-arts
methods. Experimental studies show that for all the six datasets, our proposed
technique have faster execution speed and better performance, thereby
outperforming all the existing multi-label clas-sification methods.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2016 14:56:12 GMT'}]",2016-09-06,"[['Er', 'Meng Joo', ''], ['Venkatesan', 'Rajasekar', ''], ['Wang', 'Ning', '']]","['Classification', 'extreme learning machine', 'high-speed', 'multi-label']"
1940,1707.04460,Gabor Vattay,"Zsofia Kallus, Daniel Kondor, Jozsef Steger, Istvan Csabai, Eszter
  Bokanyi and Gabor Vattay",Video Pandemics: Worldwide Viral Spreading of Psy's Gangnam Style Video,10 pages,"ICT Innovations 2017. Communications in Computer and Information
  Science, vol 778. Springer, Cham",10.1007/978-3-319-67597-8_1,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Viral videos can reach global penetration traveling through international
channels of communication similarly to real diseases starting from a
well-localized source. In past centuries, disease fronts propagated in a
concentric spatial fashion from the the source of the outbreak via the short
range human contact network. The emergence of long-distance air-travel changed
these ancient patterns. However, recently, Brockmann and Helbing have shown
that concentric propagation waves can be reinstated if propagation time and
distance is measured in the flight-time and travel volume weighted underlying
air-travel network. Here, we adopt this method for the analysis of viral meme
propagation in Twitter messages, and define a similar weighted network distance
in the communication network connecting countries and states of the World. We
recover a wave-like behavior on average and assess the randomizing effect of
non-locality of spreading. We show that similar result can be recovered from
Google Trends data as well.
","[{'version': 'v1', 'created': 'Fri, 14 Jul 2017 11:16:07 GMT'}]",2017-10-05,"[['Kallus', 'Zsofia', ''], ['Kondor', 'Daniel', ''], ['Steger', 'Jozsef', ''], ['Csabai', 'Istvan', ''], ['Bokanyi', 'Eszter', ''], ['Vattay', 'Gabor', '']]","['geo-social networks', 'meme dynamics', 'online news propagation', 'graph embedding']"
1941,1201.1733,Tom\'a\v{s} Masopust,"Jan Komenda, Tom\'a\v{s} Masopust, Jan H. van Schuppen",On Conditional Decomposability,A few minor corrections,"Systems & Control Letters 61 (12), 1260-1268, 2012",10.1016/j.sysconle.2012.07.013,,cs.SY cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The requirement of a language to be conditionally decomposable is imposed on
a specification language in the coordination supervisory control framework of
discrete-event systems. In this paper, we present a polynomial-time algorithm
for the verification whether a language is conditionally decomposable with
respect to given alphabets. Moreover, we also present a polynomial-time
algorithm to extend the common alphabet so that the language becomes
conditionally decomposable. A relationship of conditional decomposability to
nonblockingness of modular discrete-event systems is also discussed in this
paper in the general settings. It is shown that conditional decomposability is
a weaker condition than nonblockingness.
","[{'version': 'v1', 'created': 'Mon, 9 Jan 2012 10:51:33 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Mar 2012 20:32:59 GMT'}, {'version': 'v3', 'created': 'Fri, 19 Dec 2014 11:36:03 GMT'}]",2014-12-22,"[['Komenda', 'Jan', ''], ['Masopust', 'Tomáš', ''], ['van Schuppen', 'Jan H.', '']]","['Discrete-event system', 'coordination control', 'conditional decomposability']"
1942,1302.2615,Marko Horvat,"Marko Horvat, Gordan Gledec, Nikola Bogunovi\'c",Assessing Semantic Quality of Web Directory Structure,"12 pages, 6 figures. arXiv admin note: substantial text overlap with
  arXiv:1302.2222","Lecture Notes in Computer Science, Lecture Notes in Artificial
  Intelligence, 1, 5796, pp. 377-388 (2009)",10.1007/978-3-642-15034-0_7,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The administration of a Web directory content and associated structure is a
labor intensive task performed by human domain experts. Because of that there
always exists a realistic risk of the structure becoming unbalanced, uneven and
difficult to use to all except for a few users proficient in a particular Web
directory. These problems emphasize the importance of generic and objective
measures of Web directories structure quality. In this paper we demonstrate how
to formally merge Web directories into the Semantic Web vision. We introduce a
set of objective criterions for evaluation of a Web directory's structure
quality. Some criteria functions are based on heuristics while others require
the application of ontologies.
","[{'version': 'v1', 'created': 'Sat, 9 Feb 2013 11:48:39 GMT'}]",2015-06-15,"[['Horvat', 'Marko', ''], ['Gledec', 'Gordan', ''], ['Bogunović', 'Nikola', '']]","['Ontology', 'Ontology Alignment', 'Semantics', 'Artificial Intelligence', 'Semantic Web', 'Web directory']"
1943,1708.07224,EPTCS,"Gyula Sallai (Department of Measurement and Information Systems,
  Budapest University of Technology and Economics), \'Akos Hajdu (Department of
  Measurement and Information Systems, Budapest University of Technology and
  Economics / MTA-BME Lend\""ulet Cyber-Physical Systems Research Group),
  Tam\'as T\'oth (Department of Measurement and Information Systems, Budapest
  University of Technology and Economics), Zolt\'an Micskei (Department of
  Measurement and Information Systems, Budapest University of Technology and
  Economics)",Towards Evaluating Size Reduction Techniques for Software Model Checking,"In Proceedings VPT 2017, arXiv:1708.06887","EPTCS 253, 2017, pp. 75-91",10.4204/EPTCS.253.7,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Formal verification techniques are widely used for detecting design flaws in
software systems. Formal verification can be done by transforming an already
implemented source code to a formal model and attempting to prove certain
properties of the model (e.g. that no erroneous state can occur during
execution). Unfortunately, transformations from source code to a formal model
often yield large and complex models, making the verification process
inefficient and costly. In order to reduce the size of the resulting model,
optimization transformations can be used. Such optimizations include common
algorithms known from compiler design and different program slicing techniques.
Our paper describes a framework for transforming C programs to a formal model,
enhanced by various optimizations for size reduction. We evaluate and compare
several optimization algorithms regarding their effect on the size of the model
and the efficiency of the verification. Results show that different
optimizations are more suitable for certain models, justifying the need for a
framework that includes several algorithms.
","[{'version': 'v1', 'created': 'Thu, 24 Aug 2017 00:19:33 GMT'}]",2017-08-28,"[['Sallai', 'Gyula', '', 'Department of Measurement and Information Systems,\n  Budapest University of Technology and Economics'], ['Hajdu', 'Ákos', '', 'Department of\n  Measurement and Information Systems, Budapest University of Technology and\n  Economics / MTA-BME Lendület Cyber-Physical Systems Research Group'], ['Tóth', 'Tamás', '', 'Department of Measurement and Information Systems, Budapest\n  University of Technology and Economics'], ['Micskei', 'Zoltán', '', 'Department of\n  Measurement and Information Systems, Budapest University of Technology and\n  Economics']]","['size reduction', 'compiler optimizations', 'slicing', 'model checking', 'CEGAR']"
1944,1403.4722,Abhik Banerjee,"Abhik Banerjee, Abhirup Ghosh, Koustuvmoni Bharadwaj, Hemanta Saikia",Mouse Control using a Web Camera based on Colour Detection,"10 pages, 6 figures, 1 flowchart, ""Published with International
  Journal of Computer Trends and Technology (IJCTT)""","International Journal of Computer Trends and Technology (IJCTT)
  V9(1):15-20,March 2014.ISSN:2231-2803 Published by Seventh Sense Research
  Group",10.14445/22312803/IJCTT-V9P104,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present an approach for Human computer Interaction (HCI),
where we have tried to control the mouse cursor movement and click events of
the mouse using hand gestures. Hand gestures were acquired using a camera based
on colour detection technique. This method mainly focuses on the use of a Web
Camera to develop a virtual human computer interaction device in a cost
effective manner.
","[{'version': 'v1', 'created': 'Wed, 19 Mar 2014 07:40:55 GMT'}]",2014-03-20,"[['Banerjee', 'Abhik', ''], ['Ghosh', 'Abhirup', ''], ['Bharadwaj', 'Koustuvmoni', ''], ['Saikia', 'Hemanta', '']]","['Hand gesture', 'Human Computer Interaction', 'Colour Detection', 'Web camera', 'Background Subtraction']"
1945,1802.06257,Mark Heimann,"Mark Heimann, Haoming Shen, Tara Safavi, Danai Koutra",REGAL: Representation Learning-based Graph Alignment,"In Proceedings of the 27th ACM International Conference on
  Information and Knowledge Management (CIKM), 2018",,10.1145/3269206.3271788,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Problems involving multiple networks are prevalent in many scientific and
other domains. In particular, network alignment, or the task of identifying
corresponding nodes in different networks, has applications across the social
and natural sciences. Motivated by recent advancements in node representation
learning for single-graph tasks, we propose REGAL (REpresentation
learning-based Graph ALignment), a framework that leverages the power of
automatically-learned node representations to match nodes across different
graphs. Within REGAL we devise xNetMF, an elegant and principled node embedding
formulation that uniquely generalizes to multi-network problems. Our results
demonstrate the utility and promise of unsupervised representation
learning-based network alignment in terms of both speed and accuracy. REGAL
runs up to 30x faster in the representation learning stage than comparable
methods, outperforms existing network alignment methods by 20 to 30% accuracy
on average, and scales to networks with millions of nodes each.
","[{'version': 'v1', 'created': 'Sat, 17 Feb 2018 16:20:36 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Jun 2018 12:11:26 GMT'}, {'version': 'v3', 'created': 'Sat, 25 Aug 2018 16:03:29 GMT'}]",2018-08-28,"[['Heimann', 'Mark', ''], ['Shen', 'Haoming', ''], ['Safavi', 'Tara', ''], ['Koutra', 'Danai', '']]","['graph mining', 'network alignment', 'graph matching', 'node representation learning', 'node embedding']"
1946,1908.02199,Chen Ma,"Chen Ma, Chenxu Zhao, Hailin Shi, Li Chen, Junhai Yong and Dan Zeng",MetaAdvDet: Towards Robust Detection of Evolving Adversarial Attacks,"10 pages, 2 figures, accepted as the conference paper of Proceedings
  of the 27th ACM International Conference on Multimedia (MM'19)",,10.1145/3343031.3350887,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks (DNNs) are vulnerable to adversarial attack which is
maliciously implemented by adding human-imperceptible perturbation to images
and thus leads to incorrect prediction. Existing studies have proposed various
methods to detect the new adversarial attacks. However, new attack methods keep
evolving constantly and yield new adversarial examples to bypass the existing
detectors. It needs to collect tens of thousands samples to train detectors,
while the new attacks evolve much more frequently than the high-cost data
collection. Thus, this situation leads the newly evolved attack samples to
remain in small scales. To solve such few-shot problem with the evolving
attack, we propose a meta-learning based robust detection method to detect new
adversarial attacks with limited examples. Specifically, the learning consists
of a double-network framework: a task-dedicated network and a master network
which alternatively learn the detection capability for either seen attack or a
new attack. To validate the effectiveness of our approach, we construct the
benchmarks with few-shot-fashion protocols based on three conventional
datasets, i.e. CIFAR-10, MNIST and Fashion-MNIST. Comprehensive experiments are
conducted on them to verify the superiority of our approach with respect to the
traditional adversarial attack detection methods.
","[{'version': 'v1', 'created': 'Tue, 6 Aug 2019 15:06:21 GMT'}]",2019-08-07,"[['Ma', 'Chen', ''], ['Zhao', 'Chenxu', ''], ['Shi', 'Hailin', ''], ['Chen', 'Li', ''], ['Yong', 'Junhai', ''], ['Zeng', 'Dan', '']]","['adversarial example detection', 'meta-learning', 'few-shot learning', 'evolving adversarial attacks']"
1947,1406.2262,Ankit Chadha Mr.,"Ankit Chadha, Rishikesh Misal, Tanaya Mokashi and Aman Chadha",ARC Sort: Enhanced and Time Efficient Sorting Algorithm,,"International Journal of Applied Information Systems 7(2), 1-7,
  March 2014",10.5120/ijais14-451130,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses about a sorting algorithm which uses the concept of
buckets where each bucket represents a certain number of digits. A two
dimensional data structure is used where one dimension represents buckets i. e;
number of digits and each bucket's corresponding dimensions represents the
input numbers that belong to that bucket. Each bucket is then individually
sorted. Since every preceding bucket elements will always be smaller than the
succeeding buckets no comparison between them is required. By doing this we can
significantly reduced the time complexity of any sorting algorithm used to sort
the given set of inputs.
","[{'version': 'v1', 'created': 'Fri, 6 Jun 2014 12:17:11 GMT'}]",2014-06-10,"[['Chadha', 'Ankit', ''], ['Misal', 'Rishikesh', ''], ['Mokashi', 'Tanaya', ''], ['Chadha', 'Aman', '']]","['Sorting', 'Bucket', 'Enhanced Selection', 'ARC Sort']"
1948,1312.4722,Marcos Assuncao,"Marcos D. Assuncao, Rodrigo N. Calheiros, Silvia Bianchi, Marco A. S.
  Netto, Rajkumar Buyya",Big Data Computing and Clouds: Trends and Future Directions,,,10.1016/j.jpdc.2014.08.003,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses approaches and environments for carrying out analytics
on Clouds for Big Data applications. It revolves around four important areas of
analytics and Big Data, namely (i) data management and supporting
architectures; (ii) model development and scoring; (iii) visualisation and user
interaction; and (iv) business models. Through a detailed survey, we identify
possible gaps in technology and provide recommendations for the research
community on future directions on Cloud-supported Big Data computing and
analytics solutions.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2013 11:18:32 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Aug 2014 08:10:35 GMT'}]",2014-08-28,"[['Assuncao', 'Marcos D.', ''], ['Calheiros', 'Rodrigo N.', ''], ['Bianchi', 'Silvia', ''], ['Netto', 'Marco A. S.', ''], ['Buyya', 'Rajkumar', '']]","['Big Data', 'Cloud Computing', 'Analytics', 'Data Management']"
1949,1811.02982,Adrien Pommellet,Adrien Pommellet and Marcio Diaz and Tayssir Touili,Reachability Analysis of Pushdown Systems with an Upper Stack,"Full, corrected version of a paper first presented at LATA'17",,10.1007/978-3-319-53733-7_33,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pushdown systems (PDSs) are a natural model for sequential programs, but they
can fail to accurately represent the way an assembly stack actually operates.
Indeed, one may want to access the part of the memory that is below the current
stack or base pointer, hence the need for a model that keeps track of this part
of the memory.
  To this end, we introduce pushdown systems with an upper stack (UPDSs), an
extension of PDSs where symbols popped from the stack are not destroyed but
instead remain just above its top, and may be overwritten by later push rules.
We prove that the sets of successors post* and predecessors pre* of a regular
set of configurations of such a system are not always regular, but that post*
is context-sensitive, so that we can decide whether a single configuration is
forward reachable or not.
  In order to under-approximate pre* in a regular fashion, we consider a
bounded-phase analysis of UPDSs, where a phase is a part of a run during which
either push or pop rules are forbidden. We then present a method to
over-approximate post* that relies on regular abstractions of runs of UPDSs.
Finally, we show how these approximations can be used to detect stack overflows
and stack pointer manipulations with malicious intent.
","[{'version': 'v1', 'created': 'Wed, 7 Nov 2018 16:50:08 GMT'}]",2018-11-08,"[['Pommellet', 'Adrien', ''], ['Diaz', 'Marcio', ''], ['Touili', 'Tayssir', '']]","['pushdown systems', 'reachability analysis', 'stack pointer', 'finite automata']"
1950,1805.04462,Bernadette Spieler,"Anja Petri and Christian Schindler and Wolfgang Slany and Bernadette
  Spieler and Jonathan Smith",Pocket Game Jams: a Constructionist Approach at Schools,"5 pages, MobiHCI 2015","International Conference on Human-Computer Interaction with Mobile
  Devices and Services Adjunct 2015",10.1145/2786567.2801610,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The constructionist approach is more interested in constructing personal
experience than about acquiring information. It states that learning is most
effective when building knowledge through active engagement. Experiential and
discovery learning by challenges inspire creativity, and projects allow
independent thinking and new ways of learning information. This paper describes
how the ""No One Left Behind"" (NOLB) project plans to integrate this approach
into school curricula using two concepts. The first one is to enable students
to create their own games with Pocket Code by using its easy-to-learn visual
programming language. The second concept is to foster collaboration and
teamwork through hands-on sessions by conducting Game Jams using Pocket Code,
so called Pocket Game Jams. We present insights into such a Pocket Game Jam and
give an outlook on how we will use this concept.
","[{'version': 'v1', 'created': 'Fri, 11 May 2018 16:02:38 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Aug 2018 10:58:01 GMT'}]",2018-09-03,"[['Petri', 'Anja', ''], ['Schindler', 'Christian', ''], ['Slany', 'Wolfgang', ''], ['Spieler', 'Bernadette', ''], ['Smith', 'Jonathan', '']]","['Pocket Code', 'educational application', 'constructivism', 'constructionism', 'learning by doing', 'Game Jam', 'Pocket Game Jam']"
1951,2108.09555,"Cenk G\""undo\u{g}an","Cenk G\""undo\u{g}an and Christian Ams\""uss and Thomas C. Schmidt and
  Matthias W\""ahlisch",Reliable Firmware Updates for the Information-Centric Internet of Things,,Proceedings of ACM ICN 2021,10.1145/3460417.3482974,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security in the Internet of Things (IoT) requires ways to regularly update
firmware in the field. These demands ever increase with new, agile concepts
such as security as code and should be considered a regular operation. Hosting
massive firmware roll-outs present a crucial challenge for the constrained
wireless environment. In this paper, we explore how information-centric
networking can ease reliable firmware updates. We start from the recent
standards developed by the IETF SUIT working group and contribute a system that
allows for a timely discovery of new firmware versions by using
cryptographically protected manifest files. Our design enables a cascading
firmware roll-out from a gateway towards leaf nodes in a low-power multi-hop
network. While a chunking mechanism prepares firmware images for typically
low-sized maximum transmission units (MTUs), an early Denial-of-Service (DoS)
detection prevents the distribution of tampered or malformed chunks. In
experimental evaluations on a real-world IoT testbed, we demonstrate feasible
strategies with adaptive bandwidth consumption and a high resilience to
connectivity loss when replicating firmware images into the IoT edge.
","[{'version': 'v1', 'created': 'Sat, 21 Aug 2021 17:40:25 GMT'}]",2021-09-06,"[['Gündoğan', 'Cenk', ''], ['Amsüss', 'Christian', ''], ['Schmidt', 'Thomas C.', ''], ['Wählisch', 'Matthias', '']]","['Constrained IoT', 'ICN', 'firmware updates', 'security', 'performancemeasurement']"
1952,1701.05453,Muhammad Ali Babar,"Aakash Ahmad, Muhammad Ali Babar",Software Architectures for Robotics Systems: A Systematic Mapping Study,,"Journal of Systems and Software, 122, pp. 16-39 (2016)",10.1016/j.jss.2016.08.039,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software architecture related issues are important for robotic systems.
Architecture centric development and evolution of software for robotic systems
has been attracting researchers attention for more than two decades. The
objective of this work is to systematically identify, taxonomically classify
and holistically map existing solutions, research progress and trends that
influence architecture-driven modeling, development and evolution of robotic
software. We carried out a Systematic Mapping Study to identify and analyze the
relevant literature based on 56 peer-reviewed papers. We extract and synthesize
the data from selected papers to taxonomically classify the existing research
and systematically map the solutions, frameworks, notations and evaluation
methods to highlight the role of software architecture in robotic systems. We
have identified eight distinct research themes that support architectural
solutions to enable operations, evolution and development specific activities
of robotic software. The research in this area has progressed from object
oriented to component based and now to service driven robotics representing
different architectural generations. The reported solutions have exploited
model-driven, service oriented and reverse engineering techniques since 2005.
An emerging trend is cloud robotics that exploits the foundations of service
driven architectures to support an interconnected web of robots. The results of
this SMS facilitate knowledge transfer, benefiting researchers and
practitioners, focused on exploiting software architecture to model, develop
and evolve robotic systems.
","[{'version': 'v1', 'created': 'Thu, 19 Jan 2017 15:02:18 GMT'}]",2017-01-20,"[['Ahmad', 'Aakash', ''], ['Babar', 'Muhammad Ali', '']]","['Software Architecture', 'Robotic Systems', 'Evidence-Based Software Engineering', 'Systematic Mapping Study']"
1953,1711.00669,Antonio Bruto da Costa,"Antonio Anastasio Bruto da Costa, Goran Frehse, Pallab Dasgupta",Formal Feature Interpretation of Hybrid Systems,,"IEEE Transactions on Computer-Aided Design of Integrated Circuits
  and Systems ( Volume: 37 , Issue: 11 , Nov. 2018 )",10.1109/TCAD.2018.2857361,,cs.LO cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In current practice a formal analysis of hybrid system models is
assertion-based. The work presented here is based on features that look beyond
functional correctness toward a quantitative evaluation of behavioral
attributes. A feature defines a real-valued evaluation function over a specific
set of traces. This paper describes an improved method for the interpretation
of features over hybrid automata models. It further demonstrates how
satisfiability modulo theory solvers can be used for extracting behavioral
traces corresponding to corner cases of a feature. Results are demonstrated on
examples from the control and circuit domains.
","[{'version': 'v1', 'created': 'Thu, 2 Nov 2017 10:00:53 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Feb 2019 10:37:04 GMT'}]",2019-02-25,"[['da Costa', 'Antonio Anastasio Bruto', ''], ['Frehse', 'Goran', ''], ['Dasgupta', 'Pallab', '']]","['Hybrid Automata', 'Sequence Expressions', 'Features', 'Model Checking']"
1954,1607.06190,Uwe Aickelin,"Christopher Roadknight, Durga Suryanarayanan, Uwe Aickelin, John
  Scholefield, Lindy Durrant","An ensemble of machine learning and anti-learning methods for predicting
  tumour patient survival rates","IEEE International Conference on Data Science and Advanced Analytics
  (IEEE DSAA'2015), pp. 1-8, 2015. arXiv admin note: text overlap with
  arXiv:1307.1599, arXiv:1409.0788",,10.1109/DSAA.2015.7344863,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper primarily addresses a dataset relating to cellular, chemical and
physical conditions of patients gathered at the time they are operated upon to
remove colorectal tumours. This data provides a unique insight into the
biochemical and immunological status of patients at the point of tumour removal
along with information about tumour classification and post-operative survival.
The relationship between severity of tumour, based on TNM staging, and survival
is still unclear for patients with TNM stage 2 and 3 tumours. We ask whether it
is possible to predict survival rate more accurately using a selection of
machine learning techniques applied to subsets of data to gain a deeper
understanding of the relationships between a patient's biochemical markers and
survival. We use a range of feature selection and single classification
techniques to predict the 5 year survival rate of TNM stage 2 and 3 patients
which initially produces less than ideal results. The performance of each model
individually is then compared with subsets of the data where agreement is
reached for multiple models. This novel method of selective ensembling
demonstrates that significant improvements in model accuracy on an unseen test
set can be achieved for patients where agreement between models is achieved.
Finally we point at a possible method to identify whether a patients prognosis
can be accurately predicted or not.
","[{'version': 'v1', 'created': 'Thu, 21 Jul 2016 04:57:16 GMT'}]",2016-11-17,"[['Roadknight', 'Christopher', ''], ['Suryanarayanan', 'Durga', ''], ['Aickelin', 'Uwe', ''], ['Scholefield', 'John', ''], ['Durrant', 'Lindy', '']]","['Ensemble', 'Bioinformatics', 'Machine Learning']"
1955,1807.04855,Stefan Maetschke,"Stefan Maetschke, Bhavna Antony, Hiroshi Ishikawa, Gadi Wollstein,
  Joel S. Schuman, Rahil Garnavi",A feature agnostic approach for glaucoma detection in OCT volumes,"13 pages,3 figures",,10.1371/journal.pone.0219126,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optical coherence tomography (OCT) based measurements of retinal layer
thickness, such as the retinal nerve fibre layer (RNFL) and the ganglion cell
with inner plexiform layer (GCIPL) are commonly used for the diagnosis and
monitoring of glaucoma. Previously, machine learning techniques have utilized
segmentation-based imaging features such as the peripapillary RNFL thickness
and the cup-to-disc ratio. Here, we propose a deep learning technique that
classifies eyes as healthy or glaucomatous directly from raw, unsegmented OCT
volumes of the optic nerve head (ONH) using a 3D Convolutional Neural Network
(CNN). We compared the accuracy of this technique with various feature-based
machine learning algorithms and demonstrated the superiority of the proposed
deep learning based method.
  Logistic regression was found to be the best performing classical machine
learning technique with an AUC of 0.89. In direct comparison, the deep learning
approach achieved a substantially higher AUC of 0.94 with the additional
advantage of providing insight into which regions of an OCT volume are
important for glaucoma detection.
  Computing Class Activation Maps (CAM), we found that the CNN identified
neuroretinal rim and optic disc cupping as well as the lamina cribrosa (LC) and
its surrounding areas as the regions significantly associated with the glaucoma
classification. These regions anatomically correspond to the well established
and commonly used clinical markers for glaucoma diagnosis such as increased cup
volume, cup diameter, and neuroretinal rim thinning at the superior and
inferior segments.
","[{'version': 'v1', 'created': 'Thu, 12 Jul 2018 22:57:19 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Aug 2018 01:15:27 GMT'}, {'version': 'v3', 'created': 'Mon, 13 May 2019 02:29:18 GMT'}, {'version': 'v4', 'created': 'Thu, 24 Oct 2019 03:14:22 GMT'}]",2019-10-25,"[['Maetschke', 'Stefan', ''], ['Antony', 'Bhavna', ''], ['Ishikawa', 'Hiroshi', ''], ['Wollstein', 'Gadi', ''], ['Schuman', 'Joel S.', ''], ['Garnavi', 'Rahil', '']]","['Glaucoma', 'Optical Coherence Tomography', 'Deep Learning']"
1956,1701.08711,Yan Chi Vinci Chow,Vinci Chow,"Predicting Auction Price of Vehicle License Plate with Deep Recurrent
  Neural Network",,,10.1016/j.eswa.2019.113008,,cs.CL cs.LG q-fin.EC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Chinese societies, superstition is of paramount importance, and vehicle
license plates with desirable numbers can fetch very high prices in auctions.
Unlike other valuable items, license plates are not allocated an estimated
price before auction. I propose that the task of predicting plate prices can be
viewed as a natural language processing (NLP) task, as the value depends on the
meaning of each individual character on the plate and its semantics. I
construct a deep recurrent neural network (RNN) to predict the prices of
vehicle license plates in Hong Kong, based on the characters on a plate. I
demonstrate the importance of having a deep network and of retraining.
Evaluated on 13 years of historical auction prices, the deep RNN's predictions
can explain over 80 percent of price variations, outperforming previous models
by a significant margin. I also demonstrate how the model can be extended to
become a search engine for plates and to provide estimates of the expected
price distribution.
","[{'version': 'v1', 'created': 'Mon, 30 Jan 2017 17:14:25 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Feb 2017 17:41:35 GMT'}, {'version': 'v3', 'created': 'Tue, 14 Feb 2017 16:36:38 GMT'}, {'version': 'v4', 'created': 'Wed, 13 Feb 2019 08:34:32 GMT'}, {'version': 'v5', 'created': 'Tue, 8 Oct 2019 16:25:45 GMT'}]",2019-10-09,"[['Chow', 'Vinci', '']]","['price predictions', 'expert system', 'recurrent neural networks', 'deeplearning', 'natural language processing']"
1957,1809.03110,Supreeth Shastri,Supreeth Shastri and David Irwin,Cloud Index Tracking: Enabling Predictable Costs in Cloud Spot Markets,ACM Symposium on Cloud Computing 2018,,10.1145/3267809.3267821,,cs.NI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud spot markets rent VMs for a variable price that is typically much lower
than the price of on-demand VMs, which makes them attractive for a wide range
of large-scale applications. However, applications that run on spot VMs suffer
from cost uncertainty, since spot prices fluctuate, in part, based on supply,
demand, or both. The difficulty in predicting spot prices affects users and
applications: the former cannot effectively plan their IT expenditures, while
the latter cannot infer the availability and performance of spot VMs, which are
a function of their variable price. To address the problem, we use properties
of cloud infrastructure and workloads to show that prices become more stable
and predictable as they are aggregated together. We leverage this observation
to define an aggregate index price for spot VMs that serves as a reference for
what users should expect to pay. We show that, even when the spot prices for
individual VMs are volatile, the index price remains stable and predictable. We
then introduce cloud index tracking: a migration policy that tracks the index
price to ensure applications running on spot VMs incur a predictable cost by
migrating to a new spot VM if the current VM's price significantly deviates
from the index price.
","[{'version': 'v1', 'created': 'Mon, 10 Sep 2018 02:53:39 GMT'}]",2018-09-11,"[['Shastri', 'Supreeth', ''], ['Irwin', 'David', '']]","['Transient Server', 'Spot Market', 'Price Prediction']"
1958,2210.00486,Lushan Song,"Lushan Song, Jiaxuan Wang, Zhexuan Wang, Xinyu Tu, Guopeng Lin,
  Wenqiang Ruan, Haoqi Wu, and Weili Han",pMPL: A Robust Multi-Party Learning Framework with a Privileged Party,This paper is the full version of a paper to appear in CCS 2022,"2022 ACM SIGSAC Conference on Computer and Communications Security
  (CCS'22)",10.1145/3548606.3560697,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to perform machine learning among multiple parties while protecting
the privacy of raw data, privacy-preserving machine learning based on secure
multi-party computation (MPL for short) has been a hot spot in recent. The
configuration of MPL usually follows the peer-to-peer architecture, where each
party has the same chance to reveal the output result. However, typical
business scenarios often follow a hierarchical architecture where a powerful,
usually privileged party, leads the tasks of machine learning. Only the
privileged party can reveal the final model even if other assistant parties
collude with each other. It is even required to avoid the abort of machine
learning to ensure the scheduled deadlines and/or save used computing resources
when part of assistant parties drop out.
  Motivated by the above scenarios, we propose pMPL, a robust MPL framework
with a privileged part}. pMPL supports three-party training in the semi-honest
setting. By setting alternate shares for the privileged party, pMPL is robust
to tolerate one of the rest two parties dropping out during the training. With
the above settings, we design a series of efficient protocols based on vector
space secret sharing for pMPL to bridge the gap between vector space secret
sharing and machine learning. Finally, the experimental results show that the
performance of pMPL is promising when we compare it with the state-of-the-art
MPL frameworks. Especially, in the LAN setting, pMPL is around $16\times$ and
$5\times$ faster than TF-encrypted (with ABY3 as the back-end framework) for
the linear regression, and logistic regression, respectively. Besides, the
accuracy of trained models of linear regression, logistic regression, and BP
neural networks can reach around 97%, 99%, and 96% on MNIST dataset
respectively.
","[{'version': 'v1', 'created': 'Sun, 2 Oct 2022 11:13:14 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Oct 2022 08:15:52 GMT'}, {'version': 'v3', 'created': 'Thu, 6 Oct 2022 12:32:13 GMT'}, {'version': 'v4', 'created': 'Wed, 16 Nov 2022 11:07:41 GMT'}]",2022-11-17,"[['Song', 'Lushan', ''], ['Wang', 'Jiaxuan', ''], ['Wang', 'Zhexuan', ''], ['Tu', 'Xinyu', ''], ['Lin', 'Guopeng', ''], ['Ruan', 'Wenqiang', ''], ['Wu', 'Haoqi', ''], ['Han', 'Weili', '']]","['Secure Multi-party Computation', 'Vector Space Secret Sharing', 'Privacy-preserving Machine Learning', 'Robustness']"
1959,1802.07062,Zhi Zhang,"Zhi Zhang, Yueqiang Cheng, Surya Nepal, Dongxi Liu, Qingni Shen, Fethi
  Rabhi","KASR: A Reliable and Practical Approach to Attack Surface Reduction of
  Commodity OS Kernels","The work has been accepted at the 21st International Symposium on
  Research in Attacks, Intrusions, and Defenses 2018",,10.1007/978-3-030-00470-5_32,,cs.CR cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Commodity OS kernels have broad attack surfaces due to the large code base
and the numerous features such as device drivers. For a real-world use case
(e.g., an Apache Server), many kernel services are unused and only a small
amount of kernel code is used. Within the used code, a certain part is invoked
only at runtime while the rest are executed at startup and/or shutdown phases
in the kernel's lifetime run. In this paper, we propose a reliable and
practical system, named KASR, which transparently reduces attack surfaces of
commodity OS kernels at runtime without requiring their source code. The KASR
system, residing in a trusted hypervisor, achieves the attack surface reduction
through a two-step approach: (1) reliably depriving unused code of executable
permissions, and (2) transparently segmenting used code and selectively
activating them. We implement a prototype of KASR on Xen-4.8.2 hypervisor and
evaluate its security effectiveness on Linux kernel-4.4.0-87-generic. Our
evaluation shows that KASR reduces the kernel attack surface by 64% and trims
off 40% of CVE vulnerabilities. Besides, KASR successfully detects and blocks
all 6 real-world kernel rootkits. We measure its performance overhead with
three benchmark tools (i.e., SPECINT, httperf and bonnie++). The experimental
results indicate that KASR imposes less than 1% performance overhead (compared
to an unmodified Xen hypervisor) on all the benchmarks.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 11:08:31 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Nov 2018 22:55:38 GMT'}]",2018-12-03,"[['Zhang', 'Zhi', ''], ['Cheng', 'Yueqiang', ''], ['Nepal', 'Surya', ''], ['Liu', 'Dongxi', ''], ['Shen', 'Qingni', ''], ['Rabhi', 'Fethi', '']]","['Kernel Attack Surface Reduction', 'Reliable and Practical System', 'Hardware-Assisted Virtualization']"
1960,1412.4234,Riccardo Longo,"Riccardo Longo, Chiara Marcolla, Massimiliano Sala",Key-Policy Multi-Authority Attribute-Based Encryption,12 pages,"Algebraic Informatics, Springer LNCS, 2015, vol. 9270, p. 152-164",10.1007/978-3-319-23021-4_14,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bilinear groups are often used to create Attribute-Based Encryption (ABE)
algorithms. In particular, they have been used to create an ABE system with
multi authorities, but limited to the ciphertext-policy instance. Here, for the
first time, we propose a multi-authority key-policy ABE system. In our
proposal, the authorities may be set up in any moment and without any
coordination. A party can simply act as an ABE authority by creating its own
public parameters and issuing private keys to the users. A user can thus
encrypt data choosing both a set of attributes and a set of trusted
authorities, maintaining full control unless all his chosen authorities collude
against him. We prove our system secure under the bilinear Diffie-Hellman
assumption.
","[{'version': 'v1', 'created': 'Sat, 13 Dec 2014 13:05:53 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Feb 2016 11:17:25 GMT'}]",2016-04-01,"[['Longo', 'Riccardo', ''], ['Marcolla', 'Chiara', ''], ['Sala', 'Massimiliano', '']]","['ABE', 'Bilinear Groups', 'Algebraic Cryptography']"
1961,1004.3745,Mahmoud  Moussa,"M. Ibrahim Moussa (Benha University, Benha, Egypt)",An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles,"9 Pages, JGraph-Hoc Journal","Vol.2, No.1, March 2010",10.5121/jgraphhoc.2010.2108,0007736,cs.IT cs.NI math.IT,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In 1991, Gnanajothi [4] proved that the path graph P_n with n vertex and n-1
edge is odd graceful, and the cycle graph C_m with m vertex and m edges is odd
graceful if and only if m even, she proved the cycle graph is not graceful if m
odd. In this paper, firstly, we studied the graph C_m $\cup$ P_m when m = 4,
6,8,10 and then we proved that the graph C_ $\cup$ P_n is odd graceful if m is
even. Finally, we described an algorithm to label the vertices and the edges of
the vertex set V(C_m $\cup$ P_n) and the edge set E(C_m $\cup$ P_n).
","[{'version': 'v1', 'created': 'Wed, 21 Apr 2010 16:58:37 GMT'}]",2010-04-22,"[['Moussa', 'M. Ibrahim', '', 'Benha University, Benha, Egypt']]","['Vertex labeling', 'edge labeling', 'odd graceful', 'Algorithms']"
1962,1507.03770,Alireza Khosravian,"Alireza Khosravian, Jochen Trumpf, Robert Mahony, Christian Lageman","Observers for invariant systems on Lie groups with biased input
  measurements and homogeneous outputs",11 pages,Automatica 55 (2015) 19-26,10.1016/j.automatica.2015.02.030,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper provides a new observer design methodology for invariant systems
whose state evolves on a Lie group with outputs in a collection of related
homogeneous spaces and where the measurement of system input is corrupted by an
unknown constant bias. The key contribution of the paper is to study the
combined state and input bias estimation problem in the general setting of Lie
groups, a question for which only case studies of specific Lie groups are
currently available. We show that any candidate observer (with the same state
space dimension as the observed system) results in non-autonomous error
dynamics, except in the trivial case where the Lie-group is Abelian. This
precludes the application of the standard non-linear observer design
methodologies available in the literature and leads us to propose a new design
methodology based on employing invariant cost functions and general gain
mappings. We provide a rigorous and general stability analysis for the case
where the underlying Lie group allows a faithful matrix representation. We
demonstrate our theory in the example of rigid body pose estimation and show
that the proposed approach unifies two competing pose observers published in
prior literature.
","[{'version': 'v1', 'created': 'Tue, 14 Jul 2015 08:53:02 GMT'}]",2015-07-15,"[['Khosravian', 'Alireza', ''], ['Trumpf', 'Jochen', ''], ['Mahony', 'Robert', ''], ['Lageman', 'Christian', '']]","['Observers', 'Nonlinear systems', 'Lyapunov stability', 'Lie groups', 'Symmetries', 'Adaptive control', 'Attitude control']"
1963,1607.04760,Ary Setijadi Prihatmanto,"Setyaki Sholata Sya, Ary Setijadi Prihatmanto","Design and implementation of image processing system for Lumen social
  robot-humanoid as an exhibition guide for Electrical Engineering Days 2015","Lumen, image processing system, face detection, face recognition,
  face tracking, human detection",,10.13140/RG.2.1.3432.0889/1,,cs.CV cs.HC cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Lumen Social Robot is a humanoid robot development with the purpose that it
could be a good friend to all people. In this year, the Lumen Social Robot is
being developed into a guide in the exhibition and in the seminar of the Final
Exam of undergraduate and graduate students in Electrical Engineering ITB,
named Electrical Engineering Days 2015. In order to be the guide in that
occasion, Lumen is supported by several things. They are Nao robot components,
servers, and multiple processor systems. The image processing system is a
processing application system that allows Lumen to recognize and determine an
object from the image taken from the camera eye. The image processing system is
provided with four modules. They are face detection module to detect a person's
face, face recognition module to recognize a person's face, face tracking
module to follow a person's face, and human detection module to detect humans
based on the upper parts of person's body. Face detection module and human
detection module are implemented by using the library harcascade.xml on EMGU
CV. Face recognition module is implemented by adding the database for the face
that has been detected and store it in that database. Face tracking module is
implemented by using the Smooth Gaussian filter to the image.
  -----
  Lumen Sosial Robot merupakan sebuah pengembangan robot humanoid agar dapat
menjadi teman bagi banyak orang. Sistem pengolahan citra merupakan sistem
aplikasi pengolah yang bertujuan Lumen dapat mengenali dan mengetahui suatu
objek pada citra yang diambil dari camera mata Lumen. System pengolahan citra
dilengkapi dengan empat buah modul, yaitu modul face detection untuk mendeteksi
wajah seseorang, modul face recognition untuk mengenali wajah orang tersebut,
modul face tracking untuk mengikuti wajah seseorang, dan modul human detection
untuk mendeteksi manusia berdasarkan bagian tubuh atas orang
","[{'version': 'v1', 'created': 'Sat, 16 Jul 2016 16:34:09 GMT'}]",2016-07-19,"[['Sya', 'Setyaki Sholata', ''], ['Prihatmanto', 'Ary Setijadi', '']]","['Lumen', 'image processing system', 'face detection', 'face recognition', 'face tracking', 'human detection']"
1964,1102.1340,Michel Grabisch,Ulrich Faigle and Michel Grabisch,A Discrete Choquet Integral for Ordered Systems,,,10.1016/j.fss.2010.10.003,,cs.DM math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A model for a Choquet integral for arbitrary finite set systems is presented.
The model includes in particular the classical model on the system of all
subsets of a finite set. The general model associates canonical non-negative
and positively homogeneous superadditive functionals with generalized belief
functions relative to an ordered system, which are then extended to arbitrary
valuations on the set system. It is shown that the general Choquet integral can
be computed by a simple Monge-type algorithm for so-called intersection
systems, which include as a special case weakly union-closed families.
Generalizing Lov\'asz' classical characterization, we give a characterization
of the superadditivity of the Choquet integral relative to a capacity on a
union-closed system in terms of an appropriate model of supermodularity of such
capacities.
","[{'version': 'v1', 'created': 'Mon, 7 Feb 2011 15:40:54 GMT'}]",2011-02-08,"[['Faigle', 'Ulrich', ''], ['Grabisch', 'Michel', '']]","['Choquet integral', 'belief function', 'measurability', 'set systems', 'Mongealgorithm', 'supermodularity']"
1965,1701.08742,Christopher Zimmermann,Christopher Zimmermann and Roger A. Sauer,"Adaptive local surface refinement based on LR NURBS and its application
  to contact",Computational Mechanics (2017),,10.1007/s00466-017-1455-7,,cs.CE math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel adaptive local surface refinement technique based on Locally Refined
Non-Uniform Rational B-Splines (LR NURBS) is presented. LR NURBS can model
complex geometries exactly and are the rational extension of LR B-splines. The
local representation of the parameter space overcomes the drawback of
non-existent local refinement in standard NURBS-based isogeometric analysis.
For a convenient embedding into general finite element code, the B\'ezier
extraction operator for LR NURBS is formulated. An automatic remeshing
technique is presented that allows adaptive local refinement and coarsening of
LR NURBS. In this work, LR NURBS are applied to contact computations of 3D
solids and membranes. For solids, LR NURBS-enriched finite elements are used to
discretize the contact surfaces with LR NURBS finite elements, while the rest
of the body is discretized by linear Lagrange finite elements. For membranes,
the entire surface is discretized by LR NURBS. Various numerical examples are
shown, and they demonstrate the benefit of using LR NURBS: Compared to uniform
refinement, LR NURBS can achieve high accuracy at lower computational cost.
","[{'version': 'v1', 'created': 'Mon, 30 Jan 2017 18:29:18 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Apr 2017 10:06:56 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Sep 2017 15:58:09 GMT'}]",2017-09-19,"[['Zimmermann', 'Christopher', ''], ['Sauer', 'Roger A.', '']]","['Adaptive local refinement', 'computational contact mechanics', 'isogeometric analysis', 'LRB-splines', 'nonlinear finite element analysis']"
1966,1008.3681,Rajender Kumar,Rajender Kumar and Brahmjit Singh,EVM as generic QoS trigger for heterogeneous wieless overlay network,"12 pages, 7 figures, IJWMN 2010 august issue vol. 2, no.3","International Journal on Wireless and Mobile Networks, August 2010
  Issue volume 2, number 3, AIRCCS",10.5121/ijwmn.2010.2315,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fourth Generation (4G) Wireless System will integrate heterogeneous wireless
overlay systems i.e. interworking of WLAN/ GSM/ CDMA/ WiMAX/ LTE/ etc with
guaranteed Quality of Service (QoS) and Experience (QoE).QoS(E) vary from
network to network and is application sensitive. User needs an optimal mobility
solution while roaming in Overlaid wireless environment i.e. user could
seamlessly transfer his session/ call to a best available network bearing
guaranteed Quality of Experience. And If this Seamless transfer of session is
executed between two networks having different access standards then it is
called Vertical Handover (VHO). Contemporary VHO decision algorithms are based
on generic QoS metrics viz. SNR, bandwidth, jitter, BER and delay. In this
paper, Error Vector Magnitude (EVM) is proposed to be a generic QoS trigger for
VHO execution. EVM is defined as the deviation of inphase/ quadrature (I/Q)
values from ideal signal states and thus provides a measure of signal quality.
In 4G Interoperable environment, OFDM is the leading Modulation scheme (more
prone to multi-path fading). EVM (modulation error) properly characterises the
wireless link/ channel for accurate VHO decision. EVM depends on the inherent
transmission impairments viz. frequency offset, phase noise,
non-linear-impairment, skewness etc. for a given wireless link. Paper provides
an insight to the analytical aspect of EVM & measures EVM (%) for key
management subframes like association/re-association/disassociation/ probe
request/response frames. EVM relation is explored for different possible
NAV-Network Allocation Vectors (frame duration). Finally EVM is compared with
SNR, BER and investigation concludes EVM as a promising QoS trigger for OFDM
based emerging wireless standards.
","[{'version': 'v1', 'created': 'Sun, 22 Aug 2010 07:55:24 GMT'}]",2010-08-24,"[['Kumar', 'Rajender', ''], ['Singh', 'Brahmjit', '']]","['EVM', 'NAV', 'VHO', 'OFDM', 'QoS (E)', 'Wirless Overlay Network  1']"
1967,2208.14734,Filippo Carnovalini,Filippo Carnovalini,Open Challenges in Musical Metacreation,,"In EAI International Conference on Smart Objects and Technologies
  for Social Good (GoodTechs '19), September 25-27, 2019, Valencia, Spain. ACM,
  New York, NY, USA, 2 pages",10.1145/3342428.3342678,,cs.SD cs.AI eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Musical Metacreation tries to obtain creative behaviors from computers
algorithms composing music. In this paper I briefly analyze how this field
evolved from algorithmic composition to be focused on the search for
creativity, and I point out some issues in pursuing this goal. Finally, I argue
that hybridization of algorithms can be a useful direction for research.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2022 09:34:27 GMT'}]",2022-09-01,"[['Carnovalini', 'Filippo', '']]","['musical metacreation', 'algorithmic composition', 'music']"
1968,1709.07487,Pradeep Kr. Banerjee,"Pradeep Kr. Banerjee, Johannes Rauh and Guido Mont\'ufar",Computing the Unique Information,"To appear in 2018 IEEE International Symposium on Information Theory
  (ISIT); 18 pages; 4 figures, 1 Table; Github link to source code:
  https://github.com/infodeco/computeUI",,10.1109/ISIT.2018.8437757,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a pair of predictor variables and a response variable, how much
information do the predictors have about the response, and how is this
information distributed between unique, redundant, and synergistic components?
Recent work has proposed to quantify the unique component of the decomposition
as the minimum value of the conditional mutual information over a constrained
set of information channels. We present an efficient iterative divergence
minimization algorithm to solve this optimization problem with convergence
guarantees and evaluate its performance against other techniques.
","[{'version': 'v1', 'created': 'Thu, 21 Sep 2017 18:42:25 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Jan 2018 17:55:36 GMT'}, {'version': 'v3', 'created': 'Tue, 29 May 2018 16:27:10 GMT'}]",2018-10-29,"[['Banerjee', 'Pradeep Kr.', ''], ['Rauh', 'Johannes', ''], ['Montúfar', 'Guido', '']]","['decomposition of mutual information', 'synergy', 'redundancy', 'alternating divergence minimization', 'I-projection']"
1969,1003.3984,Javier Turek Mr.,"Javier Turek, Irad Yavneh, Matan Protter, Michael Elad","On MMSE and MAP Denoising Under Sparse Representation Modeling Over a
  Unitary Dictionary","29 pages, 10 figures",,10.1109/TSP.2011.2151190,,cs.CV stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Among the many ways to model signals, a recent approach that draws
considerable attention is sparse representation modeling. In this model, the
signal is assumed to be generated as a random linear combination of a few atoms
from a pre-specified dictionary. In this work we analyze two Bayesian denoising
algorithms -- the Maximum-Aposteriori Probability (MAP) and the
Minimum-Mean-Squared-Error (MMSE) estimators, under the assumption that the
dictionary is unitary. It is well known that both these estimators lead to a
scalar shrinkage on the transformed coefficients, albeit with a different
response curve. In this work we start by deriving closed-form expressions for
these shrinkage curves and then analyze their performance. Upper bounds on the
MAP and the MMSE estimation errors are derived. We tie these to the error
obtained by a so-called oracle estimator, where the support is given,
establishing a worst-case gain-factor between the MAP/MMSE estimation errors
and the oracle's performance. These denoising algorithms are demonstrated on
synthetic signals and on true data (images).
","[{'version': 'v1', 'created': 'Sun, 21 Mar 2010 08:39:51 GMT'}]",2015-05-18,"[['Turek', 'Javier', ''], ['Yavneh', 'Irad', ''], ['Protter', 'Matan', ''], ['Elad', 'Michael', '']]","['Sparse representations', 'MAP', 'MMSE', 'Unitary dictionary', 'Shrinkage', 'Bayesian estimation', 'Oracle']"
1970,1903.11712,Tarik A. Rashid,"Tarik A. Rashid (1, 2), Dosti K. Abbas (3), Yalin K. Turel (4) ((1)
  Computer Science and Engineering Department, University of Kurdistan Hewler,
  Kurdistan, Iraq, (2) Software and Informatics Engineering, Salahaddin
  University-Erbil, Kurdistan, Iraq, (3) Faculty of Engineering, Soran
  University, Kurdistan, Iraq, (4) Department of Computer Education and
  Instructional Technology, Firat University, Elazig, Turkey)","A Multi Hidden Recurrent Neural Network with a Modified Grey Wolf
  Optimizer","34 pages, published in PLoS ONE",PLoS ONE 14(3): e0213237,10.1371/journal.pone.0213237,,cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Identifying university students' weaknesses results in better learning and
can function as an early warning system to enable students to improve. However,
the satisfaction level of existing systems is not promising. New and dynamic
hybrid systems are needed to imitate this mechanism. A hybrid system (a
modified Recurrent Neural Network with an adapted Grey Wolf Optimizer) is used
to forecast students' outcomes. This proposed system would improve instruction
by the faculty and enhance the students' learning experiences. The results show
that a modified recurrent neural network with an adapted Grey Wolf Optimizer
has the best accuracy when compared with other models.
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2019 21:46:34 GMT'}]",2019-03-29,"[['Rashid', 'Tarik A.', ''], ['Abbas', 'Dosti K.', ''], ['Turel', 'Yalin K.', '']]","['Recurrent Neural Network', 'Swam Intelligence', 'Evolutionary Algorithms']"
1971,1404.2952,Oussama Noui,Noui Oussama and Noui Lemnouar,A blind robust watermarking scheme based on svd and circulant matrices,"12 pages, 6 figures, 5 tables, Second International Conference on
  Computational Science & Engineering (CSE - 2014)","Second International Conference on Computational Science and
  Engineering (CSE-2014) Dubai, UAE, April 04 ~ 05 - 2014 Volume Editors:
  Dhinaharan Nagamalai, Sundarapandian Vaidyanathan ISBN : 978-1-921987-30-4 pp
  65 - 77",10.5121/csit.2014.4406,,cs.MM cs.CR,http://creativecommons.org/licenses/by/3.0/,"  Multimedia security has been the aim point of considerable research activity
because of its wide application area. The major technology to achieve copyright
protection, content authentication, access control and multimedia security is
watermarking which is the process of embedding data into a multimedia element
such as image or audio, this embedded data can later be extracted from, or
detected in the embedded element for different purposes. In this work, a blind
watermarking algorithm based on SVD and circulant matrices has been presented.
Every circulant matrix is associated with a matrix for which the SVD
decomposition coincides with the spectral decomposition. This leads to improve
the Chandra algorithm [1], our presentation will include a discussion on the
data hiding capacity, watermark transparency and robustness against a wide
range of common image processing attacks.
","[{'version': 'v1', 'created': 'Thu, 10 Apr 2014 20:56:21 GMT'}]",2014-04-14,"[['Oussama', 'Noui', ''], ['Lemnouar', 'Noui', '']]","['Digital image watermarking', 'Singular value Decomposition', 'circulant matrix', 'ownership protection']"
1972,0910.5564,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",Instruction sequence processing operators,"37 pages; missing equations in table 3 added; combined with
  arXiv:0911.1851 [cs.PL] and arXiv:0911.5018 [cs.LO]; introduction and
  concluding remarks rewritten; remarks and examples added; minor error in
  proof of theorem 4 corrected","Acta Informatica, 49(3):139--172, 2012",10.1007/s00236-012-0154-2,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Instruction sequence is a key concept in practice, but it has as yet not come
prominently into the picture in theoretical circles. This paper concerns
instruction sequences, the behaviours produced by them under execution, the
interaction between these behaviours and components of the execution
environment, and two issues relating to computability theory. Positioning
Turing's result regarding the undecidability of the halting problem as a result
about programs rather than machines, and taking instruction sequences as
programs, we analyse the autosolvability requirement that a program of a
certain kind must solve the halting problem for all programs of that kind. We
present novel results concerning this autosolvability requirement. The analysis
is streamlined by using the notion of a functional unit, which is an abstract
state-based model of a machine. In the case where the behaviours exhibited by a
component of an execution environment can be viewed as the behaviours of a
machine in its different states, the behaviours concerned are completely
determined by a functional unit. The above-mentioned analysis involves
functional units whose possible states represent the possible contents of the
tapes of Turing machines with a particular tape alphabet. We also investigate
functional units whose possible states are the natural numbers. This
investigation yields a novel computability result, viz. the existence of a
universal computable functional unit for natural numbers.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2009 07:41:27 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Nov 2009 08:01:30 GMT'}, {'version': 'v3', 'created': 'Sun, 17 Oct 2010 20:17:01 GMT'}, {'version': 'v4', 'created': 'Mon, 26 Dec 2011 13:43:37 GMT'}, {'version': 'v5', 'created': 'Wed, 7 Mar 2012 08:40:16 GMT'}]",2012-05-07,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['instruction sequence processing', 'functional unit', 'universality', 'haltingproblem', 'autosolvability']"
1973,0712.1658,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",Program algebra with a jump-shift instruction,19 pages,"Journal of Applied Logic, 6(4):553--563, 2008",10.1016/j.jal.2008.07.001,PRG0711,cs.PL,,"  We study sequential programs that are instruction sequences with jump-shift
instructions in the setting of PGA (ProGram Algebra). Jump-shift instructions
preceding a jump instruction increase the position to jump to. The jump-shift
instruction is not found in programming practice. Its merit is that the
expressive power of PGA extended with the jump-shift instruction, is not
reduced if the reach of jump instructions is bounded. This is used to show that
there exists a finite-state execution mechanism that by making use of a counter
can produce each finite-state thread from some program that is a finite or
periodic infinite sequence of instructions from a finite set.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2007 08:53:49 GMT'}]",2008-11-11,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['program algebra', 'jump-shift instruction', 'thread algebra', 'thread extraction', 'execution mechanism']"
1974,1803.06878,Tom\'a\v{s} Masa\v{r}\'ik,"Du\v{s}an Knop, Tom\'a\v{s} Masa\v{r}\'ik, Tom\'a\v{s} Toufar",Parameterized Complexity of Fair Vertex Evaluation Problems,"25 pages, 5 figures, presented at MFCS 2019",,10.4230/LIPIcs.MFCS.2019.33,,cs.CC cs.DS cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A prototypical graph problem is centered around a graph-theoretic property
for a set of vertices and a solution to it is a set of vertices for which the
desired property holds. The task is to decide whether, in the given graph,
there exists a solution of a certain quality, where we use size as a quality
measure. In this work, we are changing the measure to the fair measure
[Lin&Sahni: Fair edge deletion problems. IEEE Trans. Comput. 89]. The measure
is k if the number of solution neighbors does not exceed k for any vertex in
the graph. One possible way to study graph problems is by defining the property
in a certain logic. For a given objective an evaluation problem is to find a
set (of vertices) that simultaneously minimizes the assumed measure and
satisfies an appropriate formula.
  In the presented paper we show that there is an FPT algorithm for the MSO
Fair Vertex Evaluation problem for formulas with one free variable
parameterized by the twin cover number of the input graph. Here, the free
variable corresponds to the solution sought. One may define an extended variant
of MSO Fair Vertex Evaluation for formulas with l free variables; here we
measure a maximum number of neighbors in each of the l sets. However, such
variant is W[1]-hard for parameter l even on graphs with twin cover one.
Furthermore, we study the Fair Vertex Cover (Fair VC) problem. Fair VC is among
the simplest problems with respect to the demanded property (i.e., the rest
forms an edgeless graph). On the negative side, Fair VC is W[1]-hard when
parameterized by both treedepth and feedback vertex set of the input graph. On
the positive side, we provide an FPT algorithm for the parameter modular width.
","[{'version': 'v1', 'created': 'Mon, 19 Mar 2018 11:49:02 GMT'}, {'version': 'v2', 'created': 'Mon, 21 May 2018 21:53:20 GMT'}, {'version': 'v3', 'created': 'Wed, 17 Apr 2019 17:10:55 GMT'}, {'version': 'v4', 'created': 'Tue, 9 Jun 2020 10:56:41 GMT'}]",2020-06-11,"[['Knop', 'Dušan', ''], ['Masařík', 'Tomáš', ''], ['Toufar', 'Tomáš', '']]","['Fair objective', 'metatheorem', 'fair vertex cover', 'twin cover', 'modular width']"
1975,1901.03660,Suayder Costa,"Suayder Milhomem, Tiago da Silva Almeida, Warley Gramacho da Silva,
  Edeilson Milhomem da Silva and Rafael Lima de Carvalho","Weightless Neural Network with Transfer Learning to Detect Distress in
  Asphalt","6 pages, 5 figures, published on IJAERS","International Journal of Advanced Engineering Research and
  Science, Page No: 294-299, vol.5,no. 12, date:2018",10.22161/ijaers.5.12.40,,cs.CV cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  The present paper shows a solution to the problem of automatic distress
detection, more precisely the detection of holes in paved roads. To do so, the
proposed solution uses a weightless neural network known as Wisard to decide
whether an image of a road has any kind of cracks. In addition, the proposed
architecture also shows how the use of transfer learning was able to improve
the overall accuracy of the decision system. As a verification step of the
research, an experiment was carried out using images from the streets at the
Federal University of Tocantins, Brazil. The architecture of the developed
solution presents a result of 85.71% accuracy in the dataset, proving to be
superior to approaches of the state-of-the-art.
","[{'version': 'v1', 'created': 'Thu, 3 Jan 2019 09:33:22 GMT'}]",2019-01-14,"[['Milhomem', 'Suayder', ''], ['Almeida', 'Tiago da Silva', ''], ['da Silva', 'Warley Gramacho', ''], ['da Silva', 'Edeilson Milhomem', ''], ['de Carvalho', 'Rafael Lima', '']]","['Distress detection', 'Transfer Learning', 'Wisard']"
1976,1702.01172,Helge Holzmann,"Helge Holzmann, Thomas Risse",Insights into Entity Name Evolution on Wikipedia,"WISE 2014, Thessaloniki, Greece",,10.1007/978-3-319-11746-1_4,,cs.CL cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Working with Web archives raises a number of issues caused by their temporal
characteristics. Depending on the age of the content, additional knowledge
might be needed to find and understand older texts. Especially facts about
entities are subject to change. Most severe in terms of information retrieval
are name changes. In order to find entities that have changed their name over
time, search engines need to be aware of this evolution. We tackle this problem
by analyzing Wikipedia in terms of entity evolutions mentioned in articles
regardless the structural elements. We gathered statistics and automatically
extracted minimum excerpts covering name changes by incorporating lists
dedicated to that subject. In future work, these excerpts are going to be used
to discover patterns and detect changes in other sources. In this work we
investigate whether or not Wikipedia is a suitable source for extracting the
required knowledge.
","[{'version': 'v1', 'created': 'Fri, 3 Feb 2017 21:36:46 GMT'}]",2017-02-07,"[['Holzmann', 'Helge', ''], ['Risse', 'Thomas', '']]","['Named Entity Evolution', 'Wikipedia', 'Semantics']"
1977,1911.12323,S\'ebastien Comb\'efis,S\'ebastien Comb\'efis and Guillaume de Moffarts,"Automated Generation of Computer Graded Unit Testing-Based Programming
  Assessments for Education","6th International Conference on Computer Science, Engineering and
  Information Technology (CSEIT 2019), November 23-24, 2019, Zurich,
  Switzerland",,10.5121/csit.2019.91308,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic assessment of code, in particular to support education, is an
important feature included in several Learning Management Systems (LMS), at
least to some extent. Several kinds of assessments can be designed, such as
exercises asking to ""fill the following code"", ""write a function that"", or
""correct the bug in the following program"", for example. One difficulty for
instructors is to create such programming exercises, in particular when they
are somewhat complex. Indeed, instructors need to write the statement of the
exercise, think about the solution and provide all the additional information
necessary to the platform to grade the assessment. Another difficulty occurs
when instructors want to use their exercises on another LMS platform. Since
there is no standard way to define and describe a coding exercise yet,
instructors have to re-encode their exercises into the other LMS. This paper
presents a tool that can automatically generate programming exercises, from one
single and unique description, and that can be solved in several programming
languages. The generated exercises can be automatically graded by the same
platform, providing intelligent feedback to its users to support their
learning. This paper focuses on and details unit testing-based exercises and
provides insights into new kinds of exercises that could be generated by the
platform in the future, with some additional developments.
","[{'version': 'v1', 'created': 'Wed, 27 Nov 2019 17:59:23 GMT'}]",2019-11-28,"[['Combéfis', 'Sébastien', ''], ['de Moffarts', 'Guillaume', '']]","['Code Grader', 'Programming Assessment', 'Code Exercise Generation', 'Computer Science Education']"
1978,1807.04375,Michael Green,"Michael Cerny Green, Ahmed Khalifa, Gabriella A.B. Barros, Tiago
  Machado, Andy Nealen and Julian Togelius","AtDelfi: Automatically Designing Legible, Full Instructions For Games","10 pages, 11 figures, published at Foundations of Digital Games
  Conference 2018",Foundations of Digital Games (FDG) 2018,10.1145/3235765.3235790,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a fully automatic method for generating video game
tutorials. The AtDELFI system (AuTomatically DEsigning Legible, Full
Instructions for games) was created to investigate procedural generation of
instructions that teach players how to play video games. We present a
representation of game rules and mechanics using a graph system as well as a
tutorial generation method that uses said graph representation. We demonstrate
the concept by testing it on games within the General Video Game Artificial
Intelligence (GVG-AI) framework; the paper discusses tutorials generated for
eight different games. Our findings suggest that a graph representation scheme
works well for simple arcade style games such as Space Invaders and Pacman, but
it appears that tutorials for more complex games might require higher-level
understanding of the game than just single mechanics.
","[{'version': 'v1', 'created': 'Wed, 11 Jul 2018 23:02:43 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Sep 2018 21:54:25 GMT'}]",2018-09-19,"[['Green', 'Michael Cerny', ''], ['Khalifa', 'Ahmed', ''], ['Barros', 'Gabriella A. B.', ''], ['Machado', 'Tiago', ''], ['Nealen', 'Andy', ''], ['Togelius', 'Julian', '']]","['tutorial', 'video game', 'procedural content generation', 'artificial intelligence']"
1979,1408.1391,Kezhi Li,"Kezhi Li, Shuang Cong","State of the Art and Prospects of Structured Sensing Matrices in
  Compressed Sensing",,"Front. Comput. Sci. 2015 9(5): 665--677, 2015",10.1007/s11704-015-3326-8,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Compressed sensing (CS) enables people to acquire the compressed measurements
directly and recover sparse or compressible signals faithfully even when the
sampling rate is much lower than the Nyquist rate. However, the pure random
sensing matrices usually require huge memory for storage and high computational
cost for signal reconstruction. Many structured sensing matrices have been
proposed recently to simplify the sensing scheme and the hardware
implementation in practice. Based on the restricted isometry property and
coherence, couples of existing structured sensing matrices are reviewed in this
paper, which have special structures, high recovery performance, and many
advantages such as the simple construction, fast calculation and easy hardware
implementation. The number of measurements and the universality of different
structure matrices are compared.
","[{'version': 'v1', 'created': 'Thu, 7 Aug 2014 11:50:16 GMT'}]",2016-11-24,"[['Li', 'Kezhi', ''], ['Cong', 'Shuang', '']]","['Compressed sensing', 'structured sensing matrices', 'RIP', 'coherence;']"
1980,1309.2077,Pedro Neto,"Nuno Mendes, Pedro Neto, J. Norberto Pires, Altino Loureiro","An optimal fuzzy-PI force/motion controller to increase industrial robot
  autonomy",,"The International Journal of Advanced Manufacturing Technology,
  Volume 68, 2013 , pp 435-441",10.1007/s00170-013-4741-3,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a method for robot self-recognition and self-adaptation
through the analysis of the contact between the robot end effector and its
surrounding environment. Often, in off-line robot programming, the idealized
robotic environment (the virtual one) does not reflect accurately the real one.
In this situation, we are in the presence of a partially unknown environment
(PUE). Thus, robotic systems must have some degree of autonomy to overcome this
situation, especially when contact exists. The proposed force/motion control
system has an external control loop based on forces and torques exerted on the
robot end effector and an internal control loop based on robot motion. The
external control loop is tested with an optimal proportional integrative (PI)
and a fuzzy-PI controller. The system performance is validated with real-world
experiments involving contact in PUEs.
","[{'version': 'v1', 'created': 'Mon, 9 Sep 2013 09:20:04 GMT'}]",2013-09-10,"[['Mendes', 'Nuno', ''], ['Neto', 'Pedro', ''], ['Pires', 'J. Norberto', ''], ['Loureiro', 'Altino', '']]","['Force control', 'Fuzzy-PI', 'Autonomous Robots', 'Robotics', 'Partly Unknown Environment']"
1981,1610.05693,Eren Aksoy,"Eren Erdal Aksoy, Adil Orhan, Florentin Woergoetter","Semantic Decomposition and Recognition of Long and Complex Manipulation
  Action Sequences",IJCV preprint manuscript,"International Journal of Computer Vision, 2017",10.1007/s11263-016-0956-8,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding continuous human actions is a non-trivial but important problem
in computer vision. Although there exists a large corpus of work in the
recognition of action sequences, most approaches suffer from problems relating
to vast variations in motions, action combinations, and scene contexts. In this
paper, we introduce a novel method for semantic segmentation and recognition of
long and complex manipulation action tasks, such as ""preparing a breakfast"" or
""making a sandwich"". We represent manipulations with our recently introduced
""Semantic Event Chain"" (SEC) concept, which captures the underlying
spatiotemporal structure of an action invariant to motion, velocity, and scene
context. Solely based on the spatiotemporal interactions between manipulated
objects and hands in the extracted SEC, the framework automatically parses
individual manipulation streams performed either sequentially or concurrently.
Using event chains, our method further extracts basic primitive elements of
each parsed manipulation. Without requiring any prior object knowledge, the
proposed framework can also extract object-like scene entities that exhibit the
same role in semantically similar manipulations. We conduct extensive
experiments on various recent datasets to validate the robustness of the
framework.
","[{'version': 'v1', 'created': 'Tue, 18 Oct 2016 16:13:59 GMT'}]",2019-09-27,"[['Aksoy', 'Eren Erdal', ''], ['Orhan', 'Adil', ''], ['Woergoetter', 'Florentin', '']]","['Semantic Decomposition', 'Temporal Segmentation', 'Recognition', 'Manipulation Action', 'Semantic Event Chain']"
1982,1802.07840,Mohammad Mahdi Tajiki,"Mohammad Mahdi Tajiki and Behzad Akbari and Mohammad Shojafar and
  Seyed Hesamedin Ghasemi Petroudi and Mahdi Latifi Barazandeh and Nader Mokari
  and Luca Chiaraviglio and Michael Zink","CECT: Computationally Efficient Congestion-avoidance and Traffic
  Engineering in Software-defined Cloud Data Centers",,,10.1007/s10586-018-2815-6,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The proliferation of cloud data center applications and network function
virtualization (NFV) boosts dynamic and QoS dependent traffic into the data
centers network. Currently, lots of network routing protocols are requirement
agnostic, while other QoS-aware protocols are computationally complex and
inefficient for small flows. In this paper, a computationally efficient
congestion avoidance scheme, called CECT, for software-defined cloud data
centers is proposed. The proposed algorithm, CECT, not only minimizes network
congestion but also reallocates the resources based on the flow requirements.
To this end, we use a routing architecture to reconfigure the network resources
triggered by two events: 1) the elapsing of a predefined time interval, or, 2)
the occurrence of congestion. Moreover, a forwarding table entries compression
technique is used to reduce the computational complexity of CECT. In this way,
we mathematically formulate an optimization problem and define a genetic
algorithm to solve the proposed optimization problem. We test the proposed
algorithm on real-world network traffic. Our results show that CECT is
computationally fast and the solution is feasible in all cases. In order to
evaluate our algorithm in term of throughput, CECT is compared with ECMP (where
the shortest path algorithm is used as the cost function). Simulation results
confirm that the throughput obtained by running CECT is improved up to 3x
compared to ECMP while packet loss is decreased up to 2x.
","[{'version': 'v1', 'created': 'Wed, 21 Feb 2018 22:57:26 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Dec 2020 09:54:14 GMT'}]",2021-01-01,"[['Tajiki', 'Mohammad Mahdi', ''], ['Akbari', 'Behzad', ''], ['Shojafar', 'Mohammad', ''], ['Petroudi', 'Seyed Hesamedin Ghasemi', ''], ['Barazandeh', 'Mahdi Latifi', ''], ['Mokari', 'Nader', ''], ['Chiaraviglio', 'Luca', ''], ['Zink', 'Michael', '']]","['QoS-aware Resource Reallocation', 'TrafficEngineering', 'Software-defined Cloud Data Centers(SCDC)', 'Network Reprogramming Overhead']"
1983,1606.06066,Niek Tax,"Niek Tax, Natalia Sidorova, Reinder Haakma, Wil M. P. van der Aalst",Mining Local Process Models,"Published in Elsevier's Journal of Innovation in Digital Ecosystems,
  Special Issue on Data Mining","Journal of Innovation in Digital Ecosystems volume 3 issue 2
  (2016), pages 183-196",10.1016/j.jides.2016.11.001,,cs.DB cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we describe a method to discover frequent behavioral patterns
in event logs. We express these patterns as \emph{local process models}. Local
process model mining can be positioned in-between process discovery and episode
/ sequential pattern mining. The technique presented in this paper is able to
learn behavioral patterns involving sequential composition, concurrency, choice
and loop, like in process mining. However, we do not look at start-to-end
models, which distinguishes our approach from process discovery and creates a
link to episode / sequential pattern mining. We propose an incremental
procedure for building local process models capturing frequent patterns based
on so-called process trees. We propose five quality dimensions and
corresponding metrics for local process models, given an event log. We show
monotonicity properties for some quality dimensions, enabling a speedup of
local process model discovery through pruning. We demonstrate through a real
life case study that mining local patterns allows us to get insights in
processes where regular start-to-end process discovery techniques are only able
to learn unstructured, flower-like, models.
","[{'version': 'v1', 'created': 'Mon, 20 Jun 2016 11:28:26 GMT'}, {'version': 'v2', 'created': 'Tue, 16 May 2017 17:23:10 GMT'}]",2017-05-17,"[['Tax', 'Niek', ''], ['Sidorova', 'Natalia', ''], ['Haakma', 'Reinder', ''], ['van der Aalst', 'Wil M. P.', '']]","['Process mining', 'Knowledge discovery', 'Data mining']"
1984,1807.03300,Qinqin Long,"Qinqin Long, Winfried Kurth, Christophe Pradal, Vincent Migault,
  Beno\^it Pallas","An Architecture for the Integration of Different Functional and
  Structural Plant Models",,,10.1145/3208854.3208875,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Plant scientists use Functional Structural Plant Models (FSPMs) to model
plant systems within a limited space-time range. To allow FSPMs to abstract
complex plant systems beyond a single model's limitation, an integration that
compounds different FSPMs could be a possible solution. However, the
integration involves many technical dimensions and a generic software
infrastructure for all integration cases is not possible. In this paper, we
analyze the requirements of the integration with all the technical dimensions.
Instead of an infrastructure, we propose a generic architecture with specific
process-related components as a logical level solution by combining an ETL
(Extract, Transform and Load) based sub architecture and a C/S (Client/Server)
based sub architecture. This allows the integration of different FSP models
hosted on the same and different FSP modeling platforms in a flexible way. We
demonstrate the usability of the architecture by the implementation of a full
infrastructure for the integration of two specific FSPMs, and we illustrate the
effectiveness of the infrastructure by several integrative tests.
","[{'version': 'v1', 'created': 'Mon, 9 Jul 2018 10:17:50 GMT'}]",2018-07-11,"[['Long', 'Qinqin', ''], ['Kurth', 'Winfried', ''], ['Pradal', 'Christophe', ''], ['Migault', 'Vincent', ''], ['Pallas', 'Benoît', '']]","['Functional structural plant model', 'simulation', 'multiscale', 'Multiscale tree graph', 'OpenAlea and GroIMP platform']"
1985,1709.03485,Eli Gibson,"Eli Gibson, Wenqi Li, Carole Sudre, Lucas Fidon, Dzhoshkun I. Shakir,
  Guotai Wang, Zach Eaton-Rosen, Robert Gray, Tom Doel, Yipeng Hu, Tom Whyntie,
  Parashkev Nachev, Marc Modat, Dean C. Barratt, S\'ebastien Ourselin, M. Jorge
  Cardoso and Tom Vercauteren",NiftyNet: a deep-learning platform for medical imaging,"Wenqi Li and Eli Gibson contributed equally to this work. M. Jorge
  Cardoso and Tom Vercauteren contributed equally to this work. 26 pages, 6
  figures; Update includes additional applications, updated author list and
  formatting for journal submission",,10.1016/j.cmpb.2018.01.025,,cs.CV cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Medical image analysis and computer-assisted intervention problems are
increasingly being addressed with deep-learning-based solutions. Established
deep-learning platforms are flexible but do not provide specific functionality
for medical image analysis and adapting them for this application requires
substantial implementation effort. Thus, there has been substantial duplication
of effort and incompatible infrastructure developed across many research
groups. This work presents the open-source NiftyNet platform for deep learning
in medical imaging. The ambition of NiftyNet is to accelerate and simplify the
development of these solutions, and to provide a common mechanism for
disseminating research outputs for the community to use, adapt and build upon.
  NiftyNet provides a modular deep-learning pipeline for a range of medical
imaging applications including segmentation, regression, image generation and
representation learning applications. Components of the NiftyNet pipeline
including data loading, data augmentation, network architectures, loss
functions and evaluation metrics are tailored to, and take advantage of, the
idiosyncracies of medical image analysis and computer-assisted intervention.
NiftyNet is built on TensorFlow and supports TensorBoard visualization of 2D
and 3D images and computational graphs by default.
  We present 3 illustrative medical image analysis applications built using
NiftyNet: (1) segmentation of multiple abdominal organs from computed
tomography; (2) image regression to predict computed tomography attenuation
maps from brain magnetic resonance images; and (3) generation of simulated
ultrasound images for specified anatomical poses.
  NiftyNet enables researchers to rapidly develop and distribute deep learning
solutions for segmentation, regression, image generation and representation
learning applications, or extend the platform to new applications.
","[{'version': 'v1', 'created': 'Mon, 11 Sep 2017 17:42:10 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Oct 2017 13:46:31 GMT'}]",2018-02-05,"[['Gibson', 'Eli', ''], ['Li', 'Wenqi', ''], ['Sudre', 'Carole', ''], ['Fidon', 'Lucas', ''], ['Shakir', 'Dzhoshkun I.', ''], ['Wang', 'Guotai', ''], ['Eaton-Rosen', 'Zach', ''], ['Gray', 'Robert', ''], ['Doel', 'Tom', ''], ['Hu', 'Yipeng', ''], ['Whyntie', 'Tom', ''], ['Nachev', 'Parashkev', ''], ['Modat', 'Marc', ''], ['Barratt', 'Dean C.', ''], ['Ourselin', 'Sébastien', ''], ['Cardoso', 'M. Jorge', ''], ['Vercauteren', 'Tom', '']]","['medical image analysis', 'deep learning', 'convolutional neuralnetwork', 'segmentation', 'image regression', 'generative adversarial network']"
1986,1310.2342,Heba Aly,"Heba Aly, Moustafa Youssef",Dejavu: An Accurate Energy-Efficient Outdoor Localization System,,"21st ACM SIGSPATIAL International Conference on Advances in
  Geographic Information Systems (ACM SIGSPATIAL GIS 2013)",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present Dejavu, a system that uses standard cell-phone sensors to provide
accurate and energy-efficient outdoor localization suitable for car navigation.
Our analysis shows that different road landmarks have a unique signature on
cell-phone sensors; For example, going inside tunnels, moving over bumps, going
up a bridge, and even potholes all affect the inertial sensors on the phone in
a unique pattern. Dejavu employs a dead-reckoning localization approach and
leverages these road landmarks, among other automatically discovered abundant
virtual landmarks, to reset the accumulated error and achieve accurate
localization. To maintain a low energy profile, Dejavu uses only
energy-efficient sensors or sensors that are already running for other
purposes. We present the design of Dejavu and how it leverages crowd-sourcing
to automatically learn virtual landmarks and their locations. Our evaluation
results from implementation on different android devices in both city and
highway driving show that Dejavu can localize cell phones to within 8.4m median
error in city roads and 16.6m on highways. Moreover, compared to GPS and other
state-of-the-art systems, Dejavu can extend the battery lifetime by 347%,
achieving even better localization results than GPS in the more challenging
in-city driving conditions.
","[{'version': 'v1', 'created': 'Wed, 9 Oct 2013 04:38:58 GMT'}]",2013-10-10,"[['Aly', 'Heba', ''], ['Youssef', 'Moustafa', '']]","['Crowd-sensing', 'energy-efficient localization', 'outdoor localization']"
1987,2102.03412,Waleed Yousef,"William Briguglio, Parisa Moghaddam, Waleed A. Yousef, Issa Traore,
  Mohammad Mamun","Machine Learning in Precision Medicine to Preserve Privacy via
  Encryption",,,10.1016/j.patrec.2021.07.004,,cs.LG cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Precision medicine is an emerging approach for disease treatment and
prevention that delivers personalized care to individual patients by
considering their genetic makeups, medical histories, environments, and
lifestyles. Despite the rapid advancement of precision medicine and its
considerable promise, several underlying technological challenges remain
unsolved. One such challenge of great importance is the security and privacy of
precision health-related data, such as genomic data and electronic health
records, which stifle collaboration and hamper the full potential of
machine-learning (ML) algorithms. To preserve data privacy while providing ML
solutions, this article makes three contributions. First, we propose a generic
machine learning with encryption (MLE) framework, which we used to build an ML
model that predicts cancer from one of the most recent comprehensive genomics
datasets in the field. Second, our framework's prediction accuracy is slightly
higher than that of the most recent studies conducted on the same dataset, yet
it maintains the privacy of the patients' genomic data. Third, to facilitate
the validation, reproduction, and extension of this work, we provide an
open-source repository that contains the design and implementation of the
framework, all the ML experiments and code, and the final predictive model
deployed to a free cloud service.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2021 20:22:15 GMT'}]",2021-11-11,"[['Briguglio', 'William', ''], ['Moghaddam', 'Parisa', ''], ['Yousef', 'Waleed A.', ''], ['Traore', 'Issa', ''], ['Mamun', 'Mohammad', '']]","['Machine Learning', 'Encryption', 'Homomorphic Encryption', 'Precision Medicine', 'Privacy']"
1988,1512.06635,Konstantin Golenberg,Konstantin Golenberg and Yehoshua Sagiv,"A Practically Efficient Algorithm for Generating Answers to Keyword
  Search over Data Graphs",Full version of ICDT'16 paper,,10.4230/LIPIcs.ICDT.2016.23,,cs.DB,http://creativecommons.org/licenses/by/4.0/,"  In keyword search over a data graph, an answer is a non-redundant subtree
that contains all the keywords of the query. A naive approach to producing all
the answers by increasing height is to generalize Dijkstra's algorithm to
enumerating all acyclic paths by increasing weight. The idea of freezing is
introduced so that (most) non-shortest paths are generated only if they are
actually needed for producing answers. The resulting algorithm for generating
subtrees, called GTF, is subtle and its proof of correctness is intricate.
Extensive experiments show that GTF outperforms existing systems, even ones
that for efficiency's sake are incomplete (i.e., cannot produce all the
answers). In particular, GTF is scalable and performs well even on large data
graphs and when many answers are needed.
","[{'version': 'v1', 'created': 'Mon, 21 Dec 2015 14:14:54 GMT'}]",2016-05-26,"[['Golenberg', 'Konstantin', ''], ['Sagiv', 'Yehoshua', '']]","['Keyword search over data graphs', 'subtree enumeration by height', 'top-kanswers', 'efficiency']"
1989,1811.01395,Ayan Kumar Bhunia,"Ayan Kumar Bhunia, Ankan Kumar Bhunia, Shuvozit Ghose, Abhirup Das,
  Partha Pratim Roy, Umapada Pal",A Deep One-Shot Network for Query-based Logo Retrieval,"Accepted in Pattern Recognition, Elsevier(2019)",,10.1016/j.patcog.2019.106965,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Logo detection in real-world scene images is an important problem with
applications in advertisement and marketing. Existing general-purpose object
detection methods require large training data with annotations for every logo
class. These methods do not satisfy the incremental demand of logo classes
necessary for practical deployment since it is practically impossible to have
such annotated data for new unseen logo. In this work, we develop an
easy-to-implement query-based logo detection and localization system by
employing a one-shot learning technique. Given an image of a query logo, our
model searches for it within a given target image and predicts the possible
location of the logo by estimating a binary segmentation mask. The proposed
model consists of a conditional branch and a segmentation branch. The former
gives a conditional latent representation of the given query logo which is
combined with feature maps of the segmentation branch at multiple scales in
order to find the matching position of the query logo in a target image, should
it be present. Feature matching between the latent query representation and
multi-scale feature maps of segmentation branch using simple concatenation
operation followed by 1x1 convolution layer makes our model scale-invariant.
Despite its simplicity, our query-based logo retrieval framework achieved
superior performance in FlickrLogos-32 and TopLogos-10 dataset over different
existing baselines.
","[{'version': 'v1', 'created': 'Sun, 4 Nov 2018 16:16:45 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Nov 2018 10:54:23 GMT'}, {'version': 'v3', 'created': 'Sat, 23 Mar 2019 22:01:26 GMT'}, {'version': 'v4', 'created': 'Thu, 27 Jun 2019 18:43:33 GMT'}, {'version': 'v5', 'created': 'Sat, 13 Jul 2019 18:55:59 GMT'}]",2019-07-16,"[['Bhunia', 'Ayan Kumar', ''], ['Bhunia', 'Ankan Kumar', ''], ['Ghose', 'Shuvozit', ''], ['Das', 'Abhirup', ''], ['Roy', 'Partha Pratim', ''], ['Pal', 'Umapada', '']]","['Logo Retrieval', 'One-shot Learning', 'Multi-scale Conditioning', 'Similarity Matching', 'Query Retrieval']"
1990,1610.00560,C\'eline Comte,"Thomas Bonald, C\'eline Comte, Virag Shah, Gustavo de Veciana",Poly-Symmetry in Processor-Sharing Systems,,Queueing Systems 86.3-4 (2017) 327-359,10.1007/s11134-017-9525-2,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a system of processor-sharing queues with state-dependent service
rates. These are allocated according to balanced fairness within a polymatroid
capacity set. Balanced fairness is known to be both insensitive and
Pareto-efficient in such systems, which ensures that the performance metrics,
when computable, will provide robust insights into the real performance of the
system considered. We first show that these performance metrics can be
evaluated with a complexity that is polynomial in the system size if the system
is partitioned into a finite number of parts, so that queues are exchangeable
within each part and asymmetric across different parts. This in turn allows us
to derive stochastic bounds for a larger class of systems which satisfy less
restrictive symmetry assumptions. These results are applied to practical
examples of tree data networks, such as backhaul networks of Internet service
providers, and computer clusters.
","[{'version': 'v1', 'created': 'Mon, 3 Oct 2016 14:05:04 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Apr 2017 20:45:37 GMT'}, {'version': 'v3', 'created': 'Thu, 24 Oct 2019 10:06:44 GMT'}]",2019-10-25,"[['Bonald', 'Thomas', ''], ['Comte', 'Céline', ''], ['Shah', 'Virag', ''], ['de Veciana', 'Gustavo', '']]","['Processor-sharing queueing systems', 'performance', 'balanced fairness', 'poly-symmetry']"
1991,1504.00983,Chen Sun,Chen Sun and Sanketh Shetty and Rahul Sukthankar and Ram Nevatia,"Temporal Localization of Fine-Grained Actions in Videos by Domain
  Transfer from Web Images",Camera ready version for ACM Multimedia 2015,,10.1145/2733373.2806226,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the problem of fine-grained action localization from temporally
untrimmed web videos. We assume that only weak video-level annotations are
available for training. The goal is to use these weak labels to identify
temporal segments corresponding to the actions, and learn models that
generalize to unconstrained web videos. We find that web images queried by
action names serve as well-localized highlights for many actions, but are
noisily labeled. To solve this problem, we propose a simple yet effective
method that takes weak video labels and noisy image labels as input, and
generates localized action frames as output. This is achieved by cross-domain
transfer between video frames and web images, using pre-trained deep
convolutional neural networks. We then use the localized action frames to train
action recognition models with long short-term memory networks. We collect a
fine-grained sports action data set FGA-240 of more than 130,000 YouTube
videos. It has 240 fine-grained actions under 85 sports activities. Convincing
results are shown on the FGA-240 data set, as well as the THUMOS 2014
localization data set with untrimmed training videos.
","[{'version': 'v1', 'created': 'Sat, 4 Apr 2015 05:40:55 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Aug 2015 07:04:34 GMT'}]",2015-08-05,"[['Sun', 'Chen', ''], ['Shetty', 'Sanketh', ''], ['Sukthankar', 'Rahul', ''], ['Nevatia', 'Ram', '']]","['Fine-grained action localization', 'domain transfer', 'LSTM']"
1992,2105.11610,Jiawang Bian,"Jia-Wang Bian, Huangying Zhan, Naiyan Wang, Zhichao Li, Le Zhang,
  Chunhua Shen, Ming-Ming Cheng, Ian Reid",Unsupervised Scale-consistent Depth Learning from Video,"Accept to IJCV. The source code is available at
  https://github.com/JiawangBian/SC-SfMLearner-Release","International Journal of Computer Vision, 2021",10.1007/s11263-021-01484-6,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a monocular depth estimator SC-Depth, which requires only
unlabelled videos for training and enables the scale-consistent prediction at
inference time. Our contributions include: (i) we propose a geometry
consistency loss, which penalizes the inconsistency of predicted depths between
adjacent views; (ii) we propose a self-discovered mask to automatically
localize moving objects that violate the underlying static scene assumption and
cause noisy signals during training; (iii) we demonstrate the efficacy of each
component with a detailed ablation study and show high-quality depth estimation
results in both KITTI and NYUv2 datasets. Moreover, thanks to the capability of
scale-consistent prediction, we show that our monocular-trained deep networks
are readily integrated into the ORB-SLAM2 system for more robust and accurate
tracking. The proposed hybrid Pseudo-RGBD SLAM shows compelling results in
KITTI, and it generalizes well to the KAIST dataset without additional
training. Finally, we provide several demos for qualitative evaluation.
","[{'version': 'v1', 'created': 'Tue, 25 May 2021 02:17:56 GMT'}]",2021-11-29,"[['Bian', 'Jia-Wang', ''], ['Zhan', 'Huangying', ''], ['Wang', 'Naiyan', ''], ['Li', 'Zhichao', ''], ['Zhang', 'Le', ''], ['Shen', 'Chunhua', ''], ['Cheng', 'Ming-Ming', ''], ['Reid', 'Ian', '']]","['Unsupervised Depth Estimation', 'ScaleConsistency', 'Visual SLAM', 'Pseudo-RGBD SLAM']"
1993,0710.4231,Yoshiharu Maeno,"Yoshiharu Maeno, and Yukio Ohsawa",Analyzing covert social network foundation behind terrorism disaster,"17pages, 10 figures, submitted to Int. J. Services Sciences","International Journal of Services Sciences Vol.2, pp.125-141
  (2009)",10.1504/IJSSCI.2009.024936,,cs.AI,,"  This paper addresses a method to analyze the covert social network foundation
hidden behind the terrorism disaster. It is to solve a node discovery problem,
which means to discover a node, which functions relevantly in a social network,
but escaped from monitoring on the presence and mutual relationship of nodes.
The method aims at integrating the expert investigator's prior understanding,
insight on the terrorists' social network nature derived from the complex graph
theory, and computational data processing. The social network responsible for
the 9/11 attack in 2001 is used to execute simulation experiment to evaluate
the performance of the method.
","[{'version': 'v1', 'created': 'Tue, 23 Oct 2007 10:40:55 GMT'}]",2010-09-28,"[['Maeno', 'Yoshiharu', ''], ['Ohsawa', 'Yukio', '']]","['communication', 'complex network', 'graph theory', 'node discovery', 'social network', 'terrorism']"
1994,1802.09219,Luis Martinez-Uribe,Luis Martinez-Uribe,Digital Archives as Big Data,Mathematical Population Studies 2018,,10.1080/08898480.2017.1418116,,cs.DL,http://creativecommons.org/publicdomain/zero/1.0/,"  Digital archives contribute to Big data. Combining social network analysis,
coincidence analysis, data reduction, and visual analytics leads to better
characterize topics over time, publishers' main themes and best authors of all
times, according to the British newspaper The Guardian and from the 3 million
records of the British National Bibliography.
","[{'version': 'v1', 'created': 'Mon, 26 Feb 2018 09:45:20 GMT'}]",2018-02-27,"[['Martinez-Uribe', 'Luis', '']]","['Big Data', 'coincidence analysis', 'social network analysis', 'open']"
1995,1807.02894,Sergiu Deitsch,"Sergiu Deitsch, Vincent Christlein, Stephan Berger, Claudia
  Buerhop-Lutz, Andreas Maier, Florian Gallwitz, Christian Riess","Automatic Classification of Defective Photovoltaic Module Cells in
  Electroluminescence Images",,,10.1016/j.solener.2019.02.067,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Electroluminescence (EL) imaging is a useful modality for the inspection of
photovoltaic (PV) modules. EL images provide high spatial resolution, which
makes it possible to detect even finest defects on the surface of PV modules.
However, the analysis of EL images is typically a manual process that is
expensive, time-consuming, and requires expert knowledge of many different
types of defects. In this work, we investigate two approaches for automatic
detection of such defects in a single image of a PV cell. The approaches differ
in their hardware requirements, which are dictated by their respective
application scenarios. The more hardware-efficient approach is based on
hand-crafted features that are classified in a Support Vector Machine (SVM). To
obtain a strong performance, we investigate and compare various processing
variants. The more hardware-demanding approach uses an end-to-end deep
Convolutional Neural Network (CNN) that runs on a Graphics Processing Unit
(GPU). Both approaches are trained on 1,968 cells extracted from high
resolution EL intensity images of mono- and polycrystalline PV modules. The CNN
is more accurate, and reaches an average accuracy of 88.42%. The SVM achieves a
slightly lower average accuracy of 82.44%, but can run on arbitrary hardware.
Both automated approaches make continuous, highly accurate monitoring of PV
cells feasible.
","[{'version': 'v1', 'created': 'Sun, 8 Jul 2018 23:24:00 GMT'}, {'version': 'v2', 'created': 'Sat, 9 Feb 2019 21:16:47 GMT'}, {'version': 'v3', 'created': 'Sat, 16 Mar 2019 21:17:39 GMT'}]",2019-08-15,"[['Deitsch', 'Sergiu', ''], ['Christlein', 'Vincent', ''], ['Berger', 'Stephan', ''], ['Buerhop-Lutz', 'Claudia', ''], ['Maier', 'Andreas', ''], ['Gallwitz', 'Florian', ''], ['Riess', 'Christian', '']]","['Deep learning', 'defect classification', 'electroluminescence imaging', 'photovoltaic modules', 'regression analysis', 'support vector machines', 'visual inspection']"
1996,1804.06822,Christoph Meier,"Christoph Meier, Reimbar Weissbach, Johannes Weinberg, Wolfgang A.
  Wall, A. John Hart","Critical Influences of Particle Size and Adhesion on the Powder Layer
  Uniformity in Metal Additive Manufacturing",Changed reference / bibliography style as compared to version 1,,10.1016/j.jmatprotec.2018.10.037,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The quality of powder layers, specifically their packing density and surface
uniformity, is a critical factor influencing the quality of components produced
by powder bed metal additive manufacturing (AM) processes, including selective
laser melting, electron beam melting and binder jetting. The present work
employs a computational model to study the critical influence of powder
cohesiveness on the powder recoating process in AM. The model is based on the
discrete element method (DEM) with particle-to-particle and particle-to-wall
interactions involving frictional contact, rolling resistance and cohesive
forces. Quantitative metrics, namely the spatial mean values and standard
deviations of the packing fraction and surface profile field, are defined in
order to evaluate powder layer quality. Based on these metrics, the
size-dependent behavior of exemplary plasma-atomized Ti-6Al-4V powders during
the recoating process is studied. It is found that decreased particle size /
increased cohesiveness leads to considerably decreased powder layer quality in
terms of low, strongly varying packing fractions and highly non-uniform surface
profiles. For relatively fine-grained powders (mean particle diameter $17 \mu
m$), it is shown that cohesive forces dominate gravity forces by two orders of
magnitude leading to low quality powder layers not suitable for subsequent
laser melting without additional layer / surface finishing steps. Besides
particle-to-particle adhesion, this contribution quantifies the influence of
mechanical bulk powder material parameters, nominal layer thickness, blade
velocity as well as particle-to-wall adhesion. Finally, the implications of the
resulting powder layer characteristics on the subsequent melting process are
discussed and practical recommendations are given for the choice of powder
recoating process parameters.
","[{'version': 'v1', 'created': 'Wed, 18 Apr 2018 17:16:18 GMT'}, {'version': 'v2', 'created': 'Fri, 25 May 2018 07:37:25 GMT'}]",2019-05-08,"[['Meier', 'Christoph', ''], ['Weissbach', 'Reimbar', ''], ['Weinberg', 'Johannes', ''], ['Wall', 'Wolfgang A.', ''], ['Hart', 'A. John', '']]","['Adhesion', 'Metal Powders', 'Additive Manufacturing', 'Recoating Process Simulation', 'Layer Uniformity']"
1997,1503.07759,Edvard Pedersen,Edvard Pedersen and Lars Ailo Bongo,Large-scale Biological Meta-database Management,"10 pages, 6 figures, 4 tables",,10.1016/j.future.2016.02.010,,cs.DC cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Up-to-date meta-databases are vital for the analysis of biological data.
However,the current exponential increase in biological data leads to
exponentially increasing meta-database sizes. Large-scale meta-database
management is therefore an important challenge for production platforms
providing services for biological data analysis. In particular, there is often
a need either to run an analysis with a particular version of a meta-database,
or to rerun an analysis with an updated meta-database. We present our GeStore
approach for biological meta-database management. It provides efficient storage
and runtime generation of specific meta-database versions, and efficient
incremental updates for biological data analysis tools. The approach is
transparent to the tools, and we provide a framework that makes it easy to
integrate GeStore with biological data analysis frameworks. We present the
GeStore system, an evaluation of the performance characteristics of the system,
and an evaluation of the benefits for a biological data analysis workflow.
","[{'version': 'v1', 'created': 'Thu, 26 Mar 2015 15:07:16 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Sep 2015 15:16:44 GMT'}, {'version': 'v3', 'created': 'Mon, 22 Feb 2016 11:43:18 GMT'}]",2018-01-31,"[['Pedersen', 'Edvard', ''], ['Bongo', 'Lars Ailo', '']]","['bioinformatics', 'big data management', 'hadoop', 'data-intensivecomputing', 'metagenomics']"
1998,1612.08029,Binanda Sengupta,Binanda Sengupta and Akanksha Dixit and Sushmita Ruj,"Secure Cloud Storage Protocols with Data Dynamics Using Secure Network
  Coding Techniques","A version of the paper has been published in IEEE Transactions on
  Cloud Computing",,10.1109/TCC.2020.3000342,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the age of cloud computing, cloud users with limited storage can outsource
their data to remote servers. These servers, in lieu of monetary benefits,
offer retrievability of their clients' data at any point of time. Secure cloud
storage protocols enable a client to check integrity of outsourced data. In
this work, we explore the possibility of constructing a secure cloud storage
for dynamic data by leveraging the algorithms involved in secure network
coding. We show that some of the secure network coding schemes can be used to
construct efficient secure cloud storage protocols for dynamic data, and we
construct such a protocol (DSCS I) based on a secure network coding protocol.
To the best of our knowledge, DSCS I is the first secure cloud storage protocol
for dynamic data constructed using secure network coding techniques which is
secure in the standard model. Although generic dynamic data support arbitrary
insertions, deletions and modifications, append-only data find numerous
applications in the real world. We construct another secure cloud storage
protocol (DSCS II) specific to append-only data -- that overcomes some
limitations of DSCS I. Finally, we provide prototype implementations for DSCS I
and DSCS II in order to evaluate their performance.
","[{'version': 'v1', 'created': 'Fri, 23 Dec 2016 16:33:39 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Jan 2017 12:20:05 GMT'}, {'version': 'v3', 'created': 'Mon, 4 Dec 2017 20:39:25 GMT'}, {'version': 'v4', 'created': 'Wed, 6 Dec 2017 09:50:02 GMT'}, {'version': 'v5', 'created': 'Fri, 3 Aug 2018 04:10:38 GMT'}, {'version': 'v6', 'created': 'Wed, 29 Aug 2018 17:54:53 GMT'}, {'version': 'v7', 'created': 'Sun, 7 Jun 2020 05:38:55 GMT'}]",2020-06-09,"[['Sengupta', 'Binanda', ''], ['Dixit', 'Akanksha', ''], ['Ruj', 'Sushmita', '']]","['Secure cloud storage', 'network coding', 'dynamic data', 'append-only data', 'publicverifiability']"
1999,1606.08743,Jesus Bonilla,"Santiago Badia, Jes\'us Bonilla","Monotonicity-preserving finite element schemes based on differentiable
  nonlinear stabilization",,,10.1016/j.cma.2016.09.035,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we propose a nonlinear stabilization technique for scalar
conservation laws with implicit time stepping. The method relies on an
artificial diffusion method, based on a graph-Laplacian operator. It is
nonlinear, since it depends on a shock detector. The same shock detector is
used to gradually lump the mass matrix. The resulting method is LED, positivity
preserving, linearity preserving, and also satisfies a global DMP. Lipschitz
continuity has also been proved. However, the resulting scheme is highly
nonlinear, leading to very poor nonlinear convergence rates. We propose a
smooth version of the scheme, which leads to twice differentiable nonlinear
stabilization schemes. It allows one to straightforwardly use Newton's method
and obtain quadratic convergence. In the numerical experiments, steady and
transient linear transport, and transient Burgers' equation have been
considered in 2D. Using the Newton method with a smooth version of the scheme
we can reduce 10 to 20 times the number of iterations of Anderson acceleration
with the original non-smooth scheme. In any case, these properties are only
true for the converged solution, but not for iterates. In this sense, we have
also proposed the concept of projected nonlinear solvers, where a projection
step is performed at the end of every nonlinear iteration onto a FE space of
admissible solutions. The space of admissible solutions is the one that
satisfies the desired monotonic properties (maximum principle or positivity).
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2016 14:46:50 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Dec 2016 17:00:02 GMT'}]",2016-12-23,"[['Badia', 'Santiago', ''], ['Bonilla', 'Jesús', '']]","['Finite elements', 'discrete maximum principle', 'monotonicity', 'nonlinear solvers', 'shock capturing']"
2000,1811.10856,Leon Abdillah,"Leon Andretti Abdillah, Arif Ainur Rofiq, and Dian Eka Indriani","Information Technology Utilization in Environmentally Friendly Higher
  Education","in Built Environment, Science and Technology International Conference
  (BEST ICON 2018), Luminor Hotel Surabaya, 2018",,10.5220/0008908303500355,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The awareness of an environmentally friendly learning process has been of
concern lately. IT offers some applications that are able to provide better
green education environment in higher education sectors. This research involves
top social information technology applications, DropBox and WordPress. DropBox
is the most popular cloud storage in the world. Meanwhile, WordPress is top
content management systems at the moment. This research employs the utilization
of those two applications in students assignments and presentation medium. The
study observed 150 sophomore students in computer science faculty. The results
show that, involving DropBox and WordPress in higher education learning
activities able to significantly reduce paper and ink usage. The combination of
those two top applications create a very handy and comfortable environment for
students in higer education. This strategy reduce the consumption of papers and
inks and are accepted well by most of the students.
","[{'version': 'v1', 'created': 'Tue, 27 Nov 2018 07:55:40 GMT'}]",2020-12-16,"[['Abdillah', 'Leon Andretti', ''], ['Rofiq', 'Arif Ainur', ''], ['Indriani', 'Dian Eka', '']]","['DropBox', 'Higher Education', 'Information Technology', 'WordPress']"
2001,1808.09700,Andrew Ruef,"George Klees, Andrew Ruef, Benji Cooper, Shiyi Wei, Michael Hicks",Evaluating Fuzz Testing,,"Proceedings of the ACM Conference on Computer and Communications
  Security (CCS) 2018",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fuzz testing has enjoyed great success at discovering security critical bugs
in real software. Recently, researchers have devoted significant effort to
devising new fuzzing techniques, strategies, and algorithms. Such new ideas are
primarily evaluated experimentally so an important question is: What
experimental setup is needed to produce trustworthy results? We surveyed the
recent research literature and assessed the experimental evaluations carried
out by 32 fuzzing papers. We found problems in every evaluation we considered.
We then performed our own extensive experimental evaluation using an existing
fuzzer. Our results showed that the general problems we found in existing
experimental evaluations can indeed translate to actual wrong or misleading
assessments. We conclude with some guidelines that we hope will help improve
experimental evaluations of fuzz testing algorithms, making reported results
more robust.
","[{'version': 'v1', 'created': 'Wed, 29 Aug 2018 09:22:54 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Oct 2018 20:36:45 GMT'}]",2018-10-22,"[['Klees', 'George', ''], ['Ruef', 'Andrew', ''], ['Cooper', 'Benji', ''], ['Wei', 'Shiyi', ''], ['Hicks', 'Michael', '']]","['fuzzing', 'evaluation', 'security']"
2002,0710.0528,Francesca Scozzari,Gianluca Amato and Francesca Scozzari,On the interaction between sharing and linearity,,"Theory and Practice of Logic Programming, volume 10, issue 01, pp.
  49-112, 2010",10.1017/S1471068409990160,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the analysis of logic programs, abstract domains for detecting sharing and
linearity information are widely used. Devising abstract unification algorithms
for such domains has proved to be rather hard. At the moment, the available
algorithms are correct but not optimal, i.e., they cannot fully exploit the
information conveyed by the abstract domains. In this paper, we define a new
(infinite) domain ShLin-w which can be thought of as a general framework from
which other domains can be easily derived by abstraction. ShLin-w makes the
interaction between sharing and linearity explicit. We provide a constructive
characterization of the optimal abstract unification operator on ShLin-w and we
lift it to two well-known abstractions of ShLin-w. Namely, to the classical
Sharing X Lin abstract domain and to the more precise ShLin-2 abstract domain
by Andy King. In the case of single binding substitutions, we obtain optimal
abstract unification algorithms for such domains.
  To appear in Theory and Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Tue, 2 Oct 2007 13:29:28 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Jul 2009 09:35:55 GMT'}]",2012-10-09,"[['Amato', 'Gianluca', ''], ['Scozzari', 'Francesca', '']]","['Static analysis', 'abstract interpretation', 'sharing', 'linearity', 'unification']"
2003,1812.06455,Emir Mu\~noz Mr,"Emir Mu\~noz, Pasquale Minervini, Matthias Nickles",Embedding Cardinality Constraints in Neural Link Predictors,"8 pages, accepted at the 34th ACM/SIGAPP Symposium on Applied
  Computing (SAC '19)",,10.1145/3297280.3297502,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural link predictors learn distributed representations of entities and
relations in a knowledge graph. They are remarkably powerful in the link
prediction and knowledge base completion tasks, mainly due to the learned
representations that capture important statistical dependencies in the data.
Recent works in the area have focused on either designing new scoring functions
or incorporating extra information into the learning process to improve the
representations. Yet the representations are mostly learned from the observed
links between entities, ignoring commonsense or schema knowledge associated
with the relations in the graph. A fundamental aspect of the topology of
relational data is the cardinality information, which bounds the number of
predictions given for a relation between a minimum and maximum frequency. In
this paper, we propose a new regularisation approach to incorporate relation
cardinality constraints to any existing neural link predictor without affecting
their efficiency or scalability. Our regularisation term aims to impose
boundaries on the number of predictions with high probability, thus,
structuring the embeddings space to respect commonsense cardinality assumptions
resulting in better representations. Experimental results on Freebase, WordNet
and YAGO show that, given suitable prior knowledge, the proposed method
positively impacts the predictive accuracy of downstream link prediction tasks.
","[{'version': 'v1', 'created': 'Sun, 16 Dec 2018 12:36:15 GMT'}]",2018-12-18,"[['Muñoz', 'Emir', ''], ['Minervini', 'Pasquale', ''], ['Nickles', 'Matthias', '']]","['Knowledge graphs', 'cardinality constraints', 'commonsense knowledge', 'regularisation']"
2004,2204.07309,Theodoros Rekatsinas,"Ihab F. Ilyas, Theodoros Rekatsinas, Vishnu Konda, Jeffrey Pound,
  Xiaoguang Qi, Mohamed Soliman","Saga: A Platform for Continuous Construction and Serving of Knowledge At
  Scale",,ACM SIGMOD 2022,10.1145/3514221.3526049,,cs.DB cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce Saga, a next-generation knowledge construction and serving
platform for powering knowledge-based applications at industrial scale. Saga
follows a hybrid batch-incremental design to continuously integrate billions of
facts about real-world entities and construct a central knowledge graph that
supports multiple production use cases with diverse requirements around data
freshness, accuracy, and availability. In this paper, we discuss the unique
challenges associated with knowledge graph construction at industrial scale,
and review the main components of Saga and how they address these challenges.
Finally, we share lessons-learned from a wide array of production use cases
powered by Saga.
","[{'version': 'v1', 'created': 'Fri, 15 Apr 2022 03:20:30 GMT'}]",2022-04-18,"[['Ilyas', 'Ihab F.', ''], ['Rekatsinas', 'Theodoros', ''], ['Konda', 'Vishnu', ''], ['Pound', 'Jeffrey', ''], ['Qi', 'Xiaoguang', ''], ['Soliman', 'Mohamed', '']]","['knowledge graphs', 'knowledge graph construction', 'entity resolution', 'entity linking']"
2005,1503.04964,Sindhu Padakandla,"Sindhu Padakandla, Prabuchandran K.J and Shalabh Bhatnagar",Energy Sharing for Multiple Sensor Nodes with Finite Buffers,"38 pages, 10 figures",,10.1109/TCOMM.2015.2415777,,cs.NI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of finding optimal energy sharing policies that
maximize the network performance of a system comprising of multiple sensor
nodes and a single energy harvesting (EH) source. Sensor nodes periodically
sense the random field and generate data, which is stored in the corresponding
data queues. The EH source harnesses energy from ambient energy sources and the
generated energy is stored in an energy buffer. Sensor nodes receive energy for
data transmission from the EH source. The EH source has to efficiently share
the stored energy among the nodes in order to minimize the long-run average
delay in data transmission. We formulate the problem of energy sharing between
the nodes in the framework of average cost infinite-horizon Markov decision
processes (MDPs). We develop efficient energy sharing algorithms, namely
Q-learning algorithm with exploration mechanisms based on the $\epsilon$-greedy
method as well as upper confidence bound (UCB). We extend these algorithms by
incorporating state and action space aggregation to tackle state-action space
explosion in the MDP. We also develop a cross entropy based method that
incorporates policy parameterization in order to find near optimal energy
sharing policies. Through simulations, we show that our algorithms yield energy
sharing policies that outperform the heuristic greedy method.
","[{'version': 'v1', 'created': 'Tue, 17 Mar 2015 09:32:29 GMT'}]",2021-04-06,"[['Padakandla', 'Sindhu', ''], ['J', 'Prabuchandran K.', ''], ['Bhatnagar', 'Shalabh', '']]","['Energy harvesting sensor nodes', 'energy sharing', 'Markov decision process', 'Q-learning', 'stateaggregation']"
2006,1801.00194,Bogdan Chlebus,Bogdan S. Chlebus and Dariusz R. Kowalski and Mariusz A. Rokicki,"Maximum Throughput of Multiple Access Channels in Adversarial
  Environments",,"Distributed Computing 22 (2), pp. 93 - 116, 2009",10.1007/s00446-009-0086-4,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider deterministic distributed broadcasting on multiple access
channels in the framework of adversarial queuing. Packets are injected
dynamically by an adversary that is constrained by the injection rate and the
number of packets that may be injected simultaneously; the latter we call
burstiness. The maximum injection rate that an algorithm can handle in a stable
manner is called the throughput of the algorithm. We develop an algorithm that
achieves throughput $1$ for any number of stations against leaky-bucket
adversaries. The algorithm has $O(n^2+\text{burstiness})$ packets queued
simultaneously at any time, where $n$ is the number of stations; this upper
bound is proved to be best possible. An algorithm is called fair when each
packet is eventually broadcast. We show that no algorithm can be both stable
and fair for a system of at least two stations against leaky-bucket
adversaries. We study in detail small systems of exactly two and three stations
against window adversaries to exhibit differences in quality of broadcast among
classes of algorithms. For two stations, we show that fair latency can be
achieved by a full sensing algorithm, while there is no stable acknowledgment
based algorithm. For three stations, we show that fair latency can be achieved
by a general algorithm, while no full sensing algorithm can be stable. Finally,
we show that algorithms that either are fair or do not have the queue sizes
affect the order of transmissions cannot be stable in systems of at least four
stations against window adversaries.
","[{'version': 'v1', 'created': 'Sat, 30 Dec 2017 21:14:25 GMT'}]",2018-01-03,"[['Chlebus', 'Bogdan S.', ''], ['Kowalski', 'Dariusz R.', ''], ['Rokicki', 'Mariusz A.', '']]","['multiple access channel', 'adversarial queuing', 'distributed broadcasting', 'deterministicalgorithm', 'stability', 'throughput', 'packet latency']"
2007,1004.4329,Joseph Shtok,Joseph Shtok and Michael Elad,Analysis of Basis Pursuit Via Capacity Sets,,"Journal of Fourier Analysis and Applications, Volume 14, Numbers
  5-6, December 2008, pp. 688-711",10.1007/s00041-008-9036-y,,cs.NA cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finding the sparsest solution $\alpha$ for an under-determined linear system
of equations $D\alpha=s$ is of interest in many applications. This problem is
known to be NP-hard. Recent work studied conditions on the support size of
$\alpha$ that allow its recovery using L1-minimization, via the Basis Pursuit
algorithm. These conditions are often relying on a scalar property of $D$
called the mutual-coherence. In this work we introduce an alternative set of
features of an arbitrarily given $D$, called the ""capacity sets"". We show how
those could be used to analyze the performance of the basis pursuit, leading to
improved bounds and predictions of performance. Both theoretical and numerical
methods are presented, all using the capacity values, and shown to lead to
improved assessments of the basis pursuit success in finding the sparest
solution of $D\alpha=s$.
","[{'version': 'v1', 'created': 'Sun, 25 Apr 2010 06:28:58 GMT'}]",2010-04-27,"[['Shtok', 'Joseph', ''], ['Elad', 'Michael', '']]","['sparse representations', 'ℓ1-reconstruction', 'Basis Pursuit', 'random support', 'capacity sets']"
2008,1902.00660,James Larus,"Nachshon Cohen, David T. Aksun, Hillel Avni, James R. Larus",Fine-Grain Checkpointing with In-Cache-Line Logging,"In 2019 Architectural Support for Programming Languages and Operating
  Systems (ASPLOS 19), April 13, 2019, Providence, RI, USA",,10.1145/3297858.3304046,,cs.OS cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Non-Volatile Memory offers the possibility of implementing high-performance,
durable data structures. However, achieving performance comparable to
well-designed data structures in non-persistent (transient) memory is
difficult, primarily because of the cost of ensuring the order in which memory
writes reach NVM. Often, this requires flushing data to NVM and waiting a full
memory round-trip time.
  In this paper, we introduce two new techniques: Fine-Grained Checkpointing,
which ensures a consistent, quickly recoverable data structure in NVM after a
system failure, and In-Cache-Line Logging, an undo-logging technique that
enables recovery of earlier state without requiring cache-line flushes in the
normal case. We implemented these techniques in the Masstree data structure,
making it persistent and demonstrating the ease of applying them to a highly
optimized system and their low (5.9-15.4\%) runtime overhead cost.
","[{'version': 'v1', 'created': 'Sat, 2 Feb 2019 07:22:25 GMT'}]",2019-02-05,"[['Cohen', 'Nachshon', ''], ['Aksun', 'David T.', ''], ['Avni', 'Hillel', ''], ['Larus', 'James R.', '']]","['non-volatile memory', 'NVM', 'durable data structures', 'in-cache-line logging', 'InCLL', 'fine-grain checkpointing']"
2009,1709.02955,Robin Haunschild,"Robin Haunschild, Hermann Schier, Werner Marx, and Lutz Bornmann","Algorithmically generated subject categories based on citation
  relations: An empirical micro study using papers on overall water splitting","28 pages, 6 figures, and 3 tables","Journal of Informetrics, 12, 436-447 (2018)",10.1016/j.joi.2018.03.004,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One important reason for the use of field categorization in bibliometrics is
the necessity to make citation impact of papers published in different
scientific fields comparable with each other. Raw citations are normalized by
using field-normalization schemes to achieve comparable citation scores. There
are different approaches to field categorization available. They can be broadly
classified as intellectual and algorithmic approaches. A paper-based
algorithmically constructed classification system (ACCS) was proposed which is
based on citation relations. Using a few ACCS field-specific clusters, we
investigate the discriminatory power of the ACCS. The micro study focusses on
the topic ""overall water splitting"" and related topics. The first part of the
study investigates intellectually whether the ACCS is able to identify papers
on overall water splitting reliably and validly. Next, we compare the ACCS with
(1) a paper-based intellectual (INSPEC) classification and (2) a journal-based
intellectual classification (Web of Science, WoS, subject categories). In the
last part of our case study, we compare the average number of citations in
selected ACCS clusters (on overall water splitting and related topics) with the
average citation count of publications in WoS subject categories related to
these clusters. The results of this micro study question the discriminatory
power of the ACCS. We recommend larger follow-up studies on broad datasets.
","[{'version': 'v1', 'created': 'Sat, 9 Sep 2017 13:45:21 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Feb 2018 09:52:33 GMT'}, {'version': 'v3', 'created': 'Tue, 17 Apr 2018 09:14:52 GMT'}]",2018-04-18,"[['Haunschild', 'Robin', ''], ['Schier', 'Hermann', ''], ['Marx', 'Werner', ''], ['Bornmann', 'Lutz', '']]","['Field categorization', 'bibliometrics', 'algorithmically constructed classification systems', 'subject']"
2010,1705.03214,Juergen Mueller,Juergen Mueller and Gerd Stumme,Predicting Rising Follower Counts on Twitter Using Profile Information,"10 pages, 3 figures, 8 tables, WebSci '17, June 25--28, 2017, Troy,
  NY, USA",,10.1145/3091478.3091490,,cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When evaluating the cause of one's popularity on Twitter, one thing is
considered to be the main driver: Many tweets. There is debate about the kind
of tweet one should publish, but little beyond tweets. Of particular interest
is the information provided by each Twitter user's profile page. One of the
features are the given names on those profiles. Studies on psychology and
economics identified correlations of the first name to, e.g., one's school
marks or chances of getting a job interview in the US. Therefore, we are
interested in the influence of those profile information on the follower count.
We addressed this question by analyzing the profiles of about 6 Million Twitter
users. All profiles are separated into three groups: Users that have a first
name, English words, or neither of both in their name field. The assumption is
that names and words influence the discoverability of a user and subsequently
his/her follower count. We propose a classifier that labels users who will
increase their follower count within a month by applying different models based
on the user's group. The classifiers are evaluated with the area under the
receiver operator curve score and achieves a score above 0.800.
","[{'version': 'v1', 'created': 'Tue, 9 May 2017 07:30:19 GMT'}]",2017-05-10,"[['Mueller', 'Juergen', ''], ['Stumme', 'Gerd', '']]","['Prediction', 'Correlational Analysis', 'Classification', 'Social NetworkAnalysis', 'Experimental Study', 'Onomastics']"
2011,1905.02200,Song Gao,"Yuhao Kang, Song Gao, Robert E. Roth",Transferring Multiscale Map Styles Using Generative Adversarial Networks,"12 pages, 17 figure","International Journal of Cartography, 2019",10.1080/23729333.2019.1615729,,cs.CV cs.LG eess.IV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The advancement of the Artificial Intelligence (AI) technologies makes it
possible to learn stylistic design criteria from existing maps or other visual
art and transfer these styles to make new digital maps. In this paper, we
propose a novel framework using AI for map style transfer applicable across
multiple map scales. Specifically, we identify and transfer the stylistic
elements from a target group of visual examples, including Google Maps,
OpenStreetMap, and artistic paintings, to unstylized GIS vector data through
two generative adversarial network (GAN) models. We then train a binary
classifier based on a deep convolutional neural network to evaluate whether the
transfer styled map images preserve the original map design characteristics.
Our experiment results show that GANs have a great potential for multiscale map
style transferring, but many challenges remain requiring future research.
","[{'version': 'v1', 'created': 'Mon, 6 May 2019 04:52:42 GMT'}, {'version': 'v2', 'created': 'Sat, 18 May 2019 05:47:15 GMT'}]",2019-05-21,"[['Kang', 'Yuhao', ''], ['Gao', 'Song', ''], ['Roth', 'Robert E.', '']]","['GeoAI', 'generative adversarial network', 'style transfer', 'convolutional neural network', 'map design']"
2012,1603.05819,Andrzej Woszczyna,"A. Woszczyna, P. Plaszczyk, W. Czaja, Z. A. Golda",Symbolic Tensor Calculus -- Functional and Dynamic Approach,,,10.4467/2353737XCT.15.110.4147,,cs.SC gr-qc physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we briefly discuss the dynamic and functional approach to
computer symbolic tensor analysis. The ccgrg package for Wolfram
Language/Mathematica is used to illustrate this approach. Some examples of
applications are attached.
","[{'version': 'v1', 'created': 'Fri, 18 Mar 2016 10:21:13 GMT'}]",2016-03-21,"[['Woszczyna', 'A.', ''], ['Plaszczyk', 'P.', ''], ['Czaja', 'W.', ''], ['Golda', 'Z. A.', '']]","['computer algebra', 'symbolic tensor calculus', 'functional programming', 'dynamic programming', 'Mathematica', 'Wolfram Language']"
2013,1902.07660,Malte Skambath,"Max Bannach, Malte Skambath, Till Tantau",Towards Work-Efficient Parallel Parameterized Algorithms,"Prior full version of the paper that will appear in Proceedings of
  the 13th International Conference and Workshops on Algorithms and Computation
  (WALCOM 2019), February 27 - March 02, 2019, Guwahati, India. The final
  authenticated version is available online at
  https://doi.org/10.1007/978-3-030-10564-8_27",,10.1007/978-3-030-10564-8_27,,cs.DS cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parallel parameterized complexity theory studies how fixed-parameter
tractable (fpt) problems can be solved in parallel. Previous theoretical work
focused on parallel algorithms that are very fast in principle, but did not
take into account that when we only have a small number of processors (between
2 and, say, 1024), it is more important that the parallel algorithms are
work-efficient. In the present paper we investigate how work-efficient fpt
algorithms can be designed. We review standard methods from fpt theory, like
kernelization, search trees, and interleaving, and prove trade-offs for them
between work efficiency and runtime improvements. This results in a toolbox for
developing work-efficient parallel fpt algorithms.
","[{'version': 'v1', 'created': 'Wed, 20 Feb 2019 17:16:39 GMT'}]",2019-02-21,"[['Bannach', 'Max', ''], ['Skambath', 'Malte', ''], ['Tantau', 'Till', '']]","['Parallel computation', 'fixed-parameter tractability', 'work efficiency']"
2014,1807.01970,Alexis Brenon,Alexis Brenon and Fran\c{c}ois Portet and Michel Vacher,"Arcades: A deep model for adaptive decision making in voice controlled
  smart-home","27 pages, 15 figures, 5 tables, 4 algorithms. In Press, Accepted
  Manuscript","Pervasive and Mobile Computing, Volume 49, September 2018, Pages
  92-110",10.1016/j.pmcj.2018.06.011,,cs.LG cs.AI cs.RO stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a voice-controlled smart-home, a controller must respond not only to
user's requests but also according to the interaction context. This paper
describes Arcades, a system which uses deep reinforcement learning to extract
context from a graphical representation of home automation system and to update
continuously its behavior to the user's one. This system is robust to changes
in the environment (sensor breakdown or addition) through its graphical
representation (scale well) and the reinforcement mechanism (adapt well). The
experiments on realistic data demonstrate that this method promises to reach
long life context-aware control of smart-home.
","[{'version': 'v1', 'created': 'Thu, 5 Jul 2018 12:50:16 GMT'}]",2018-07-19,"[['Brenon', 'Alexis', ''], ['Portet', 'François', ''], ['Vacher', 'Michel', '']]","['Smart-home', 'Decision system', 'Context-aware', 'Reinforcement learning', 'Deep learning']"
2015,1802.10472,Andrea Tassi,"Ioannis Mavromatis, Andrea Tassi, Robert J. Piechocki, Andrew Nix",Efficient V2V Communication Scheme for 5G MmWave Hyper-Connected CAVs,"To be presented at the IEEE ICC 2018 Workshop - 5G and Cooperative
  Autonomous Driving",,10.1109/ICCW.2018.8403780,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Connected and Autonomous Vehicles (CAVs) require continuous access to sensory
data to perform complex high-speed maneuvers and advanced trajectory planning.
High priority CAVs are particularly reliant on extended perception horizon
facilitated by sensory data exchange between CAVs. Existing technologies such
as the Dedicated Short Range Communications (DSRC) are ill-equipped to provide
advanced cooperative perception service. This creates the need for more
sophisticated technologies such as the 5G Millimetre-Waves (mmWaves). In this
work, we propose a distributed Vehicle-to-Vehicle (V2V) mmWaves association
scheme operating in a heterogeneous manner. Our system utilises the information
exchanged within the DSRC frequency band to bootstrap the best CAV pairs
formation. Using a Stable Fixtures Matching Game, we form V2V
multipoint-to-multipoint links. Compared to more traditional point-to-point
links, our system provides almost twice as much sensory data exchange capacity
for high priority CAVs while doubling the mmWaves channel utilisation for all
the vehicles in the network.
","[{'version': 'v1', 'created': 'Wed, 28 Feb 2018 15:17:13 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Mar 2018 12:43:19 GMT'}]",2022-09-05,"[['Mavromatis', 'Ioannis', ''], ['Tassi', 'Andrea', ''], ['Piechocki', 'Robert J.', ''], ['Nix', 'Andrew', '']]","['ConnectedandAutonomousVehicles', 'CAV', 'MmWaves', 'V2X', 'Multipoint-to-Multipoint', '5G', 'Heterogeneity', 'Matching Theory']"
2016,1511.03418,Phil Weir,"Phil Weir, Dominic Reuter, Roland Ellerweg, Tuomas Alhonnoro, Mika
  Pollari, Philip Voglreiter, Panchatcharam Mariappan, Ronan Flanagan, Chang
  Sub Park, Stephen Payne, Elmar Staerk, Peter Voigt, Michael Moche, and Marina
  Kolesnik","Go-Smart: Web-based Computational Modeling of Minimally Invasive Cancer
  Treatments","4 pages, 3 figures, submitted to the IEEE International Conference on
  e-Health and Bioengineering (EHB2015) [replaced to inc. IEEE copyright, as
  req. for arXiv by IEEE]",,10.1109/EHB.2015.7391385,,cs.CY physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The web-based Go-Smart environment is a scalable system that allows the
prediction of minimally invasive cancer treatment. Interventional radiologists
create a patient-specific 3D model by semi-automatic segmentation and
registration of pre-interventional CT (Computed Tomography) and/or MRI
(Magnetic Resonance Imaging) images in a 2D/3D browser environment. This model
is used to compare patient-specific treatment plans and device performance via
built-in simulation tools. Go-Smart includes evaluation techniques for
comparing simulated treatment with real ablation lesions segmented from
follow-up scans. The framework is highly extensible, allowing manufacturers and
researchers to incorporate new ablation devices, mathematical models and
physical parameters.
","[{'version': 'v1', 'created': 'Wed, 11 Nov 2015 08:36:52 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Nov 2015 10:00:41 GMT'}]",2016-11-17,"[['Weir', 'Phil', ''], ['Reuter', 'Dominic', ''], ['Ellerweg', 'Roland', ''], ['Alhonnoro', 'Tuomas', ''], ['Pollari', 'Mika', ''], ['Voglreiter', 'Philip', ''], ['Mariappan', 'Panchatcharam', ''], ['Flanagan', 'Ronan', ''], ['Park', 'Chang Sub', ''], ['Payne', 'Stephen', ''], ['Staerk', 'Elmar', ''], ['Voigt', 'Peter', ''], ['Moche', 'Michael', ''], ['Kolesnik', 'Marina', '']]","['cancer', 'internet', 'image processing', 'simulation']"
2017,1407.0080,Graeme Wilson N,"Graeme N. Wilson, Alejandro Ramirez-Serrano, Mahmoud Mustafa, and
  Krispin A. Davies","Velocity Selection for High-Speed UGVs in Rough Unknown Terrains using
  Force Prediction","10 pages, 6 figures, Proceedings of 5th International Conference on
  Intelligent Robotics and Applications, Concordia University, October 3-5,
  2012, Montreal, Canada","5th International Conference, ICIRA 2012, Montreal, Canada,
  October 3-5, 2012, Proceedings, Part II. 7507: 387-396",10.1007/978-3-642-33515-0_39,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Enabling high speed navigation of Unmanned Ground Vehicles (UGVs) in unknown
rough terrain where limited or no information is available in advance requires
the assessment of terrain in front of the UGV. Attempts have been made to
predict the forces the terrain exerts on the UGV for the purpose of determining
the maximum allowable velocity for a given terrain. However, current methods
produce overly aggressive velocity profiles which could damage the UGV. This
paper presents three novel safer methods of force prediction that produce
effective velocity profiles. Two models, Instantaneous Elevation Change Model
(IECM) and Sinusoidal Base Excitation Model: using Excitation Force (SBEM:EF),
predict the forces exerted by the terrain on the vehicle at the ground contact
point, while another method, Sinusoidal Base Excitation Model: using
Transmitted Force (SBEM:TF), predicts the forces transmitted to the vehicle
frame by the suspension.
","[{'version': 'v1', 'created': 'Mon, 30 Jun 2014 23:43:59 GMT'}]",2014-07-02,"[['Wilson', 'Graeme N.', ''], ['Ramirez-Serrano', 'Alejandro', ''], ['Mustafa', 'Mahmoud', ''], ['Davies', 'Krispin A.', '']]","['Unmanned Ground Vehicles', 'High Speed Terrain Traversal', 'Terrain Assessment']"
2018,1308.0971,Fragkiskos  Malliaros,Fragkiskos D. Malliaros and Michalis Vazirgiannis,Clustering and Community Detection in Directed Networks: A Survey,"86 pages, 17 figures. Physics Reports Journal (To Appear)",,10.1016/j.physrep.2013.08.002,,cs.SI cs.IR physics.bio-ph physics.comp-ph physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Networks (or graphs) appear as dominant structures in diverse domains,
including sociology, biology, neuroscience and computer science. In most of the
aforementioned cases graphs are directed - in the sense that there is
directionality on the edges, making the semantics of the edges non symmetric.
An interesting feature that real networks present is the clustering or
community structure property, under which the graph topology is organized into
modules commonly called communities or clusters. The essence here is that nodes
of the same community are highly similar while on the contrary, nodes across
communities present low similarity. Revealing the underlying community
structure of directed complex networks has become a crucial and
interdisciplinary topic with a plethora of applications. Therefore, naturally
there is a recent wealth of research production in the area of mining directed
graphs - with clustering being the primary method and tool for community
detection and evaluation. The goal of this paper is to offer an in-depth review
of the methods presented so far for clustering directed networks along with the
relevant necessary methodological background and also related applications. The
survey commences by offering a concise review of the fundamental concepts and
methodological base on which graph clustering algorithms capitalize on. Then we
present the relevant work along two orthogonal classifications. The first one
is mostly concerned with the methodological principles of the clustering
algorithms, while the second one approaches the methods from the viewpoint
regarding the properties of a good cluster in a directed network. Further, we
present methods and metrics for evaluating graph clustering results,
demonstrate interesting application domains and provide promising future
research directions.
","[{'version': 'v1', 'created': 'Mon, 5 Aug 2013 13:12:13 GMT'}]",2015-06-16,"[['Malliaros', 'Fragkiskos D.', ''], ['Vazirgiannis', 'Michalis', '']]","['Community detection', 'graph clustering', 'directed networks', 'complex networks', 'graph mining']"
2019,1312.1003,Upul Senanayake Mr,"Upul Senanayake, Rahal Prabuddha, Roshan Ragel","High Throughput Virtual Screening with Data Level Parallelism in
  Multi-core Processors","Information and Automation for Sustainability (ICIAfS), 2012 IEEE 6th
  International Conference on",,10.1109/ICIAFS.2012.6419885,,cs.AI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Improving the throughput of molecular docking, a computationally intensive
phase of the virtual screening process, is a highly sought area of research
since it has a significant weight in the drug designing process. With such
improvements, the world might find cures for incurable diseases like HIV
disease and Cancer sooner. Our approach presented in this paper is to utilize a
multi-core environment to introduce Data Level Parallelism (DLP) to the
Autodock Vina software, which is a widely used for molecular docking software.
Autodock Vina already exploits Instruction Level Parallelism (ILP) in
multi-core environments and therefore optimized for such environments. However,
with the results we have obtained, it can be clearly seen that our approach has
enhanced the throughput of the already optimized software by more than six
times. This will dramatically reduce the time consumed for the lead
identification phase in drug designing along with the shift in the processor
technology from multi-core to many-core of the current era. Therefore, we
believe that the contribution of this project will effectively make it possible
to expand the number of small molecules docked against a drug target and
improving the chances to design drugs for incurable diseases.
","[{'version': 'v1', 'created': 'Wed, 4 Dec 2013 01:53:33 GMT'}]",2013-12-05,"[['Senanayake', 'Upul', ''], ['Prabuddha', 'Rahal', ''], ['Ragel', 'Roshan', '']]","['Virtual Screening', 'Drug Designing', 'Molecular']"
2020,1705.03697,Amritanshu Agrawal,"Amritanshu Agrawal, Tim Menzies","Is ""Better Data"" Better than ""Better Data Miners""? (On the Benefits of
  Tuning SMOTE for Defect Prediction)","10 pages + 2 references. Accepted to International Conference of
  Software Engineering (ICSE), 2018","International Conference of Software Engineering (ICSE), 2018",10.1145/3180155.3180197,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We report and fix an important systematic error in prior studies that ranked
classifiers for software analytics. Those studies did not (a) assess
classifiers on multiple criteria and they did not (b) study how variations in
the data affect the results. Hence, this paper applies (a) multi-criteria tests
while (b) fixing the weaker regions of the training data (using SMOTUNED, which
is a self-tuning version of SMOTE). This approach leads to dramatically large
increases in software defect predictions. When applied in a 5*5
cross-validation study for 3,681 JAVA classes (containing over a million lines
of code) from open source systems, SMOTUNED increased AUC and recall by 60% and
20% respectively. These improvements are independent of the classifier used to
predict for quality. Same kind of pattern (improvement) was observed when a
comparative analysis of SMOTE and SMOTUNED was done against the most recent
class imbalance technique. In conclusion, for software analytic tasks like
defect prediction, (1) data pre-processing can be more important than
classifier choice, (2) ranking studies are incomplete without such
pre-processing, and (3) SMOTUNED is a promising candidate for pre-processing.
","[{'version': 'v1', 'created': 'Wed, 10 May 2017 11:02:03 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Aug 2017 17:21:54 GMT'}, {'version': 'v3', 'created': 'Tue, 20 Feb 2018 17:31:27 GMT'}]",2018-03-16,"[['Agrawal', 'Amritanshu', ''], ['Menzies', 'Tim', '']]","['Search based SE', 'defect prediction', 'classification', 'data analytics forsoftware engineering', 'SMOTE', 'imbalanced data', 'preprocessing']"
2021,2102.06386,Shigemichi Matsuzaki,"Shigemichi Matsuzaki, Jun Miura and Hiroaki Masuzawa","Multi-source Pseudo-label Learning of Semantic Segmentation for the
  Scene Recognition of Agricultural Mobile Robots",Published in Advanced Robotics,"Advanced Robotics, 36:19, 1011-1029 (2022)",10.1080/01691864.2022.2109427,,cs.CV cs.RO,http://creativecommons.org/licenses/by/4.0/,"  This paper describes a novel method of training a semantic segmentation model
for scene recognition of agricultural mobile robots exploiting publicly
available datasets of outdoor scenes that are different from the target
greenhouse environments. Semantic segmentation models require abundant labels
given by tedious manual annotation. A method to work around it is unsupervised
domain adaptation (UDA) that transfers knowledge from labeled source datasets
to unlabeled target datasets. However, the effectiveness of existing methods is
not well studied in adaptation between heterogeneous environments, such as
urban scenes and greenhouses. In this paper, we propose a method to train a
semantic segmentation model for greenhouse images without manually labeled
datasets of greenhouse images. The core of our idea is to use multiple rich
image datasets of different environments with segmentation labels to generate
pseudo-labels for the target images to effectively transfer the knowledge from
multiple sources and realize a precise training of semantic segmentation. Along
with the pseudo-label generation, we introduce state-of-the-art methods to deal
with noise in the pseudo-labels to further improve the performance. We
demonstrate in experiments with multiple greenhouse datasets that our proposed
method improves the performance compared to the single-source baselines and an
existing approach.
","[{'version': 'v1', 'created': 'Fri, 12 Feb 2021 08:17:10 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Feb 2022 06:34:29 GMT'}, {'version': 'v3', 'created': 'Fri, 13 Jan 2023 04:56:20 GMT'}]",2023-01-16,"[['Matsuzaki', 'Shigemichi', ''], ['Miura', 'Jun', ''], ['Masuzawa', 'Hiroaki', '']]","['Semantic segmentation', 'deep Learning', 'scene recognition', 'unsupervised domainadaptation (UDA)']"
2022,1903.03980,Jesse Hoey,Moojan Ghafurian and Neil Budnarain and Jesse Hoey,"Improving Humanness of Virtual Agents and Users' Cooperation through
  Emotions",,,10.1109/TAFFC.2021.3096831,,cs.AI cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we analyze the performance of an agent developed according to
a well-accepted appraisal theory of human emotion with respect to how it
modulates play in the context of a social dilemma. We ask if the agent will be
capable of generating interactions that are considered to be more human than
machine-like. We conduct an experiment with 117 participants and show how
participants rate our agent on dimensions of human-uniqueness (which separates
humans from animals) and human-nature (which separates humans from machines).
We show that our appraisal theoretic agent is perceived to be more human-like
than baseline models, by significantly improving both human-nature and
human-uniqueness aspects of the intelligent agent. We also show that perception
of humanness positively affects enjoyment and cooperation in the social
dilemma.
","[{'version': 'v1', 'created': 'Sun, 10 Mar 2019 12:37:15 GMT'}]",2021-07-19,"[['Ghafurian', 'Moojan', ''], ['Budnarain', 'Neil', ''], ['Hoey', 'Jesse', '']]","['Afective computing; Human likeness', 'OCC', 'prisoner’s dilemma']"
2023,1407.6317,Srinivasa Rao Ch.,"Ch.Srinivasa Rao, B. Raveendra Babu","A Fuzzy Differential Evolution Algorithm for Job Scheduling on
  Computational Grids","6 pages, 9 figures",,10.14445/22312803/IJCTT-V13P116,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Grid computing is the recently growing area of computing that share data,
storage, computing across geographically dispersed area. This paper proposes a
novel fuzzy approach using Differential Evolution (DE) for scheduling jobs on
computational grids. The fuzzy based DE generates an optimal plan to complete
the jobs within a minimum period of time. We evaluate the performance of the
proposed fuzzy based DE algorithm with Genetic Algorithm (GA), Simulated
Annealing (SA), Differential Evolution and fuzzy PSO. Experimental results have
shown that the new algorithm produces more optimal solutions for the job
scheduling problems compared to other algorithms.
","[{'version': 'v1', 'created': 'Wed, 23 Jul 2014 18:08:25 GMT'}]",2014-07-24,"[['Rao', 'Ch. Srinivasa', ''], ['Babu', 'B. Raveendra', '']]","['Grid computing', 'Job scheduling', 'Fuzzy Differential Evolution']"
2024,1908.00709,Xin He,"Xin He, Kaiyong Zhao, Xiaowen Chu",AutoML: A Survey of the State-of-the-Art,"automated machine learning (AutoML), published in journal of
  Knowledge-Based Systems","Knowledge-Based Systems, Volume 212, 5 January 2021, 106622",10.1016/j.knosys.2020.106622,,cs.LG cs.CV stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Deep learning (DL) techniques have penetrated all aspects of our lives and
brought us great convenience. However, building a high-quality DL system for a
specific task highly relies on human expertise, hindering the applications of
DL to more areas. Automated machine learning (AutoML) becomes a promising
solution to build a DL system without human assistance, and a growing number of
researchers focus on AutoML. In this paper, we provide a comprehensive and
up-to-date review of the state-of-the-art (SOTA) in AutoML. First, we introduce
AutoML methods according to the pipeline, covering data preparation, feature
engineering, hyperparameter optimization, and neural architecture search (NAS).
We focus more on NAS, as it is currently very hot sub-topic of AutoML. We
summarize the performance of the representative NAS algorithms on the CIFAR-10
and ImageNet datasets and further discuss several worthy studying directions of
NAS methods: one/two-stage NAS, one-shot NAS, and joint hyperparameter and
architecture optimization. Finally, we discuss some open problems of the
existing AutoML methods for future research.
","[{'version': 'v1', 'created': 'Fri, 2 Aug 2019 05:56:13 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Aug 2019 16:11:15 GMT'}, {'version': 'v3', 'created': 'Mon, 10 Feb 2020 13:05:19 GMT'}, {'version': 'v4', 'created': 'Thu, 27 Feb 2020 15:00:06 GMT'}, {'version': 'v5', 'created': 'Wed, 8 Jul 2020 11:43:36 GMT'}, {'version': 'v6', 'created': 'Fri, 16 Apr 2021 03:38:23 GMT'}]",2021-04-19,"[['He', 'Xin', ''], ['Zhao', 'Kaiyong', ''], ['Chu', 'Xiaowen', '']]","['deep learning', 'automated machine learning (AutoML)', 'neural architecture search (NAS)', 'hyperparameteroptimization (HPO)']"
2025,1706.02124,Marian Tietz,"Marian Tietz, Tayfun Alpay, Johannes Twiefel, Stefan Wermter",Semi-Supervised Phoneme Recognition with Recurrent Ladder Networks,,,10.1007/978-3-319-68600-4_1,,cs.CL cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ladder networks are a notable new concept in the field of semi-supervised
learning by showing state-of-the-art results in image recognition tasks while
being compatible with many existing neural architectures. We present the
recurrent ladder network, a novel modification of the ladder network, for
semi-supervised learning of recurrent neural networks which we evaluate with a
phoneme recognition task on the TIMIT corpus. Our results show that the model
is able to consistently outperform the baseline and achieve fully-supervised
baseline performance with only 75% of all labels which demonstrates that the
model is capable of using unsupervised data as an effective regulariser.
","[{'version': 'v1', 'created': 'Wed, 7 Jun 2017 10:50:47 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Sep 2017 18:49:26 GMT'}]",2017-09-20,"[['Tietz', 'Marian', ''], ['Alpay', 'Tayfun', ''], ['Twiefel', 'Johannes', ''], ['Wermter', 'Stefan', '']]","['semi-supervised learning', 'recurrent neural networks', 'laddernetworks', 'phoneme recognition']"
2026,1108.3632,EPTCS,Thierry Monteil (CNRS - Universit\'e Montpellier 2),The complexity of tangent words,"In Proceedings WORDS 2011, arXiv:1108.3412","EPTCS 63, 2011, pp. 152-157",10.4204/EPTCS.63.21,,cs.DM cs.CG cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a previous paper, we described the set of words that appear in the coding
of smooth (resp. analytic) curves at arbitrary small scale. The aim of this
paper is to compute the complexity of those languages.
","[{'version': 'v1', 'created': 'Thu, 18 Aug 2011 03:54:08 GMT'}]",2011-08-19,"[['Monteil', 'Thierry', '', 'CNRS - Université Montpellier 2']]","['Cutting sequence', 'symbolic coding', 'word complexity', 'multigrid convergence', 'Sturmianword']"
2027,1902.06168,Maximilian Balmus,"Maximilian Balmus, Andre Massing, Johan Hoffman, Reza Razavi and David
  Nordsletten","A partition of unity approach to fluid mechanics and fluid-structure
  interaction","34 pages, 15 figure",,10.1016/j.cma.2020.112842,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  For problems involving large deformations of thin structures, simulating
fluid-structure interaction (FSI) remains challenging largely due to the need
to balance computational feasibility, efficiency, and solution accuracy.
Overlapping domain techniques have been introduced as a way to combine the
fluid-solid mesh conformity, seen in moving-mesh methods, without the need for
mesh smoothing or re-meshing, which is a core characteristic of fixed mesh
approaches. In this work, we introduce a novel overlapping domain method based
on a partition of unity approach. Unified function spaces are defined as a
weighted sum of fields given on two overlapping meshes. The method is shown to
achieve optimal convergence rates and to be stable for steady-state Stokes,
Navier-Stokes, and ALE Navier-Stokes problems. Finally, we present results for
FSI in the case of a 2D mock aortic valve simulation. These initial results
point to the potential applicability of the method to a wide range of FSI
applications, enabling boundary layer refinement and large deformations without
the need for re-meshing or user-defined stabilization.
","[{'version': 'v1', 'created': 'Sat, 16 Feb 2019 22:27:26 GMT'}]",2020-03-18,"[['Balmus', 'Maximilian', ''], ['Massing', 'Andre', ''], ['Hoffman', 'Johan', ''], ['Razavi', 'Reza', ''], ['Nordsletten', 'David', '']]","['Finite element methods', 'Fluid-structure interaction', 'Overlapping domains', 'Partition of unity']"
2028,1404.2772,Ravi Ranjan,Ravi Ranjan and G. Sahoo,A New Clustering Approach for Anomaly Intrusion Detection,"10 pages with 3 figures,2 Tables This paper explains about clustering
  methodology used in Data Mining field for Intrusion Detection in the area of
  Network Security","International Journal of Data Mining & Knowledge Management
  Process (IJDKP),ISSN:2230-9608[Online],2231-007X[Print] Vol.4, No.2, March
  2014, page(s): 29-38",10.5121/ijdkp.2014.4203,,cs.DC cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advances in technology have made our work easier compare to earlier
times. Computer network is growing day by day but while discussing about the
security of computers and networks it has always been a major concerns for
organizations varying from smaller to larger enterprises. It is true that
organizations are aware of the possible threats and attacks so they always
prepare for the safer side but due to some loopholes attackers are able to make
attacks. Intrusion detection is one of the major fields of research and
researchers are trying to find new algorithms for detecting intrusions.
Clustering techniques of data mining is an interested area of research for
detecting possible intrusions and attacks. This paper presents a new clustering
approach for anomaly intrusion detection by using the approach of K-medoids
method of clustering and its certain modifications. The proposed algorithm is
able to achieve high detection rate and overcomes the disadvantages of K-means
algorithm.
","[{'version': 'v1', 'created': 'Thu, 10 Apr 2014 11:22:17 GMT'}]",2014-04-11,"[['Ranjan', 'Ravi', ''], ['Sahoo', 'G.', '']]","['Clustering', 'data mining', 'intrusion detection', 'network security']"
2029,1904.00785,Aleksandr Perevalov,"Aleksandr Perevalov, Daniil Kurushin, Rustam Faizrakhmanov and Farida
  Khabibrakhmanova","Question Embeddings Based on Shannon Entropy: Solving intent
  classification task in goal-oriented dialogue system",Proceedings of International Conference on Applied Innovation in IT,"2019/03/06, Volume 7, Issue 1, Koethen Germany, ISBN:
  978-3-96057-086-8 (Online)",10.25673/13485,,cs.CL stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Question-answering systems and voice assistants are becoming major part of
client service departments of many organizations, helping them to reduce the
labor costs of staff. In many such systems, there is always natural language
understanding module that solves intent classification task. This task is
complicated because of its case-dependency - every subject area has its own
semantic kernel. The state of art approaches for intent classification are
different machine learning and deep learning methods that use text vector
representations as input. The basic vector representation models such as Bag of
words and TF-IDF generate sparse matrixes, which are becoming very big as the
amount of input data grows. Modern methods such as word2vec and FastText use
neural networks to evaluate word embeddings with fixed dimension size. As we
are developing a question-answering system for students and enrollees of the
Perm National Research Polytechnic University, we have faced the problem of
user's intent detection. The subject area of our system is very specific, that
is why there is a lack of training data. This aspect makes intent
classification task more challenging for using state of the art deep learning
methods. In this paper, we propose an approach of the questions embeddings
representation based on calculation of Shannon entropy.The goal of the approach
is to produce low dimensional question vectors as neural approaches do and to
outperform related methods, described above in condition of small dataset. We
evaluate and compare our model with existing ones using logistic regression and
dataset that contains questions asked by students and enrollees. The data is
labeled into six classes. Experimental comparison of proposed approach and
other models revealed that proposed model performed better in the given task.
","[{'version': 'v1', 'created': 'Mon, 25 Mar 2019 18:59:32 GMT'}]",2019-04-02,"[['Perevalov', 'Aleksandr', ''], ['Kurushin', 'Daniil', ''], ['Faizrakhmanov', 'Rustam', ''], ['Khabibrakhmanova', 'Farida', '']]","['Text Classification', 'Word Embeddings', 'Shannon Entropy', 'Intent Classification', 'Natural Language Processing', 'Dialogue Systems', 'Word2vec', 'FastText']"
2030,1908.02598,Sven Hug,"Sven E. Hug, Mirjam Aeschbach",Criteria for assessing grant applications: A systematic review,Final version,,10.1057/s41599-020-0412-9,,cs.CY cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Criteria are an essential component of any procedure for assessing merit.
Yet, little is known about the criteria peers use in assessing grant
applications. In this systematic review we therefore identify and synthesize
studies that examine grant peer review criteria in an empirical and inductive
manner. To facilitate the synthesis, we introduce a framework that classifies
what is generally referred to as 'criterion' into an evaluated entity (i.e. the
object of evaluation) and an evaluation criterion (i.e. the dimension along
which an entity is evaluated). In total, this synthesis includes 12 studies.
Two-thirds of these studies examine criteria in the medical and health
sciences, while studies in other fields are scarce. Few studies compare
criteria across different fields, and none focus on criteria for
interdisciplinary research. We conducted a qualitative content analysis of the
12 studies and thereby identified 15 evaluation criteria and 30 evaluated
entities as well as the relations between them. Based on a network analysis, we
propose a conceptualization that groups the identified evaluation criteria and
evaluated entities into aims, means, and outcomes. We compare our results to
criteria found in studies on research quality and guidelines of funding
agencies. Since peer review is often approached from a normative perspective,
we discuss our findings in relation to two normative positions, the fairness
doctrine and the ideal of impartiality. Our findings suggest that future
studies on criteria in grant peer review should focus on the applicant, include
data from non-Western countries, and examine fields other than the medical and
health sciences.
","[{'version': 'v1', 'created': 'Sun, 4 Aug 2019 16:22:41 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Dec 2019 17:26:14 GMT'}, {'version': 'v3', 'created': 'Wed, 11 Mar 2020 20:16:10 GMT'}]",2020-03-13,"[['Hug', 'Sven E.', ''], ['Aeschbach', 'Mirjam', '']]","['grant peer review', 'grant funding', 'evaluation criteria', 'systematic review', 'qualitative synthesis']"
2031,1612.00670,Johannes Emerich,Johannes Emerich,"How Are Programs Found? Speculating About Language Ergonomics With
  Curry-Howard",,"Proceedings of the 2016 ACM International Symposium on New Ideas,
  New Paradigms, and Reflections on Programming and Software (Onward! 2016).
  ACM, New York, NY, USA, 212-223",10.1145/2986012.2986030,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Functional languages with strong static type systems have beneficial
properties to help ensure program correctness and reliability. Surprisingly,
their practical significance in applications is low relative to other languages
lacking in those dimensions. In this paper, the programs-as-proofs analogy is
taken seriously to gain speculative insights by analysis of creation habits in
the proof-centric discipline of mathematics. Viewed in light of this analogy, a
sampling of mathematicians' attitudes towards formal proof suggests that the
crucial role of intuition and experimentation in programming tasks may be under
appreciated, hinting at a possible explanation of the challenges rigorously
disciplined languages face in practical applications.
","[{'version': 'v1', 'created': 'Fri, 2 Dec 2016 13:18:58 GMT'}]",2016-12-05,"[['Emerich', 'Johannes', '']]","['language ergonomics', 'type systems', 'programming systems', 'programs as proofs', 'propositions as types']"
2032,1306.4040,Carlos Sarraute,"Carlos Sarraute (1 and 2), Gerardo Richarte (1), Jorge Lucangeli Obes
  (3) ((1) Core Security Technologies, (2) ITBA (Instituto Tecnologico Buenos
  Aires), (3) UBA (Universidad de Buenos Aires))",An Algorithm to Find Optimal Attack Paths in Nondeterministic Scenarios,"ACM Workshop on Artificial Intelligence and Security (AISec 2011), at
  ACM CCS Conference 2011",,10.1145/2046684.2046695,,cs.CR cs.AI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  As penetration testing frameworks have evolved and have become more complex,
the problem of controlling automatically the pentesting tool has become an
important question. This can be naturally addressed as an attack planning
problem. Previous approaches to this problem were based on modeling the actions
and assets in the PDDL language, and using off-the-shelf AI tools to generate
attack plans. These approaches however are limited. In particular, the planning
is classical (the actions are deterministic) and thus not able to handle the
uncertainty involved in this form of attack planning.
  We herein contribute a planning model that does capture the uncertainty about
the results of the actions, which is modeled as a probability of success of
each action. We present efficient planning algorithms, specifically designed
for this problem, that achieve industrial-scale runtime performance (able to
solve scenarios with several hundred hosts and exploits). These algorithms take
into account the probability of success of the actions and their expected cost
(for example in terms of execution time, or network traffic generated).
  We thus show that probabilistic attack planning can be solved efficiently for
the scenarios that arise when assessing the security of large networks. Two
""primitives"" are presented, which are used as building blocks in a framework
separating the overall problem into two levels of abstraction. We also present
the experimental results obtained with our implementation, and conclude with
some ideas for further work.
","[{'version': 'v1', 'created': 'Mon, 17 Jun 2013 23:26:23 GMT'}]",2017-07-10,"[['Sarraute', 'Carlos', '', '1 and 2'], ['Richarte', 'Gerardo', ''], ['Obes', 'Jorge Lucangeli', '']]","['Network security', 'exploit', 'automated pentesting', 'attack planning']"
2033,1805.09604,Julian Horsch,"Mathias Morbitzer, Manuel Huber, Julian Horsch, Sascha Wessel",SEVered: Subverting AMD's Virtual Machine Encryption,"Published in Proceedings of the 11th European Workshop on Systems
  Security (EuroSec'18)",,10.1145/3193111.3193112,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  AMD SEV is a hardware feature designed for the secure encryption of virtual
machines. SEV aims to protect virtual machine memory not only from other
malicious guests and physical attackers, but also from a possibly malicious
hypervisor. This relieves cloud and virtual server customers from fully
trusting their server providers and the hypervisors they are using. We present
the design and implementation of SEVered, an attack from a malicious hypervisor
capable of extracting the full contents of main memory in plaintext from
SEV-encrypted virtual machines. SEVered neither requires physical access nor
colluding virtual machines, but only relies on a remote communication service,
such as a web server, running in the targeted virtual machine. We verify the
effectiveness of SEVered on a recent AMD SEV-enabled server platform running
different services, such as web or SSH servers, in encrypted virtual machines.
With these examples, we demonstrate that SEVered reliably and efficiently
extracts all memory contents even in scenarios where the targeted virtual
machine is under high load.
","[{'version': 'v1', 'created': 'Thu, 24 May 2018 11:09:39 GMT'}]",2018-05-25,"[['Morbitzer', 'Mathias', ''], ['Huber', 'Manuel', ''], ['Horsch', 'Julian', ''], ['Wessel', 'Sascha', '']]","['AMD SEV', 'virtual machine encryption', 'page fault side channel', 'dataextraction']"
2034,1901.05520,Marcelo Ponce,"Ramses van Zon, Marcelo Ponce, Erik Spence, Daniel Gruner","Trends in Demand, Growth, and Breadth in Scientific Computing Training
  Delivered by a High-Performance Computing Center","Presented at the Fifth Workshop on Best Practices for Enhancing HPC
  Training and Education (BPHTE18) @ SC18","Journal of Computational Science Education Volume 10, Issue 1, pp.
  53-60 (2019)",10.22369/issn.2153-4136/10/1/9,,cs.CY cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze the changes in the training and educational efforts of the SciNet
HPC Consortium, a Canadian academic High Performance Computing center, in the
areas of Scientific Computing and High-Performance Computing, over the last six
years. Initially, SciNet offered isolated training events on how to use HPC
systems and write parallel code, but the training program now consists of a
broad range of workshops and courses that users can take toward certificates in
scientific computing, data science, or high-performance computing. Using data
on enrollment, attendence, and certificate numbers from SciNet's education
website, used by almost 1800 users so far, we extract trends on the growth,
demand, and breadth of SciNet's training program. Among the results are a
steady overall growth, a sharp and steady increase in the demand for data
science training, and a wider participation of 'non-traditional' computing
disciplines, which has motivated an increasingly broad spectrum of training
offerings. Of interest is also that many of the training initiatives have
evolved into courses that can be taken as part of the graduate curriculum at
the University of Toronto.
","[{'version': 'v1', 'created': 'Wed, 16 Jan 2019 20:36:54 GMT'}]",2019-01-18,"[['van Zon', 'Ramses', ''], ['Ponce', 'Marcelo', ''], ['Spence', 'Erik', ''], ['Gruner', 'Daniel', '']]","['Scientific Computing', 'Training and Education', 'Graduate Courses', 'Certificates', 'Curricula']"
2035,1512.07931,Hugh Chen,"Hugh Chen, Yusuf Erol, Eric Shen, Stuart Russell",Probabilistic Model-Based Approach for Heart Beat Detection,,,10.1088/0967-3334/37/9/1404,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, hospitals are ubiquitous and integral to modern society. Patients
flow in and out of a veritable whirlwind of paperwork, consultations, and
potential inpatient admissions, through an abstracted system that is not
without flaws. One of the biggest flaws in the medical system is perhaps an
unexpected one: the patient alarm system. One longitudinal study reported an
88.8% rate of false alarms, with other studies reporting numbers of similar
magnitudes. These false alarm rates lead to a number of deleterious effects
that manifest in a significantly lower standard of care across clinics.
  This paper discusses a model-based probabilistic inference approach to
identifying variables at a detection level. We design a generative model that
complies with an overview of human physiology and perform approximate Bayesian
inference. One primary goal of this paper is to justify a Bayesian modeling
approach to increasing robustness in a physiological domain.
  We use three data sets provided by Physionet, a research resource for complex
physiological signals, in the form of the Physionet 2014 Challenge set-p1 and
set-p2, as well as the MGH/MF Waveform Database. On the extended data set our
algorithm is on par with the other top six submissions to the Physionet 2014
challenge.
","[{'version': 'v1', 'created': 'Thu, 24 Dec 2015 23:24:24 GMT'}]",2016-09-21,"[['Chen', 'Hugh', ''], ['Erol', 'Yusuf', ''], ['Shen', 'Eric', ''], ['Russell', 'Stuart', '']]","['Beat Detection', 'PhysioNet Challenge', 'Particle Filter', 'Dynamic Bayesian Network', 'ECG', 'Blood Pressure', 'Model Based Probabilistic Inference']"
2036,1811.03122,Olivier Cardin,"Olivier Cardin (PSI, LS2N, IUT NANTES)","Classification of cyber-physical production systems applications:
  Proposition of an analysis framework",,"Computers in Industry, Elsevier, 2019, 104, pp.11 - 21",10.1016/j.compind.2018.10.002,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cyber-physical systems have encountered a huge success in the past decade in
several scientific communities, and specifically in production topics. The main
attraction of the concept relies in the fact that it encompasses many
scientific topics that were distinct before. The downside is the lack of
readability of the current developments about cyber-physical production systems
(CPPS). Indeed, the large scientific area of CPPS makes it difficult to
identify clearly and rapidly, in the various applications that were made of
CPPS, what are the choices, best practices and methodology that are suggested
and that could be used for a new application. This work intends to introduce an
analysis framework able to classify those developments. An extensive study of
literature enabled to extract the major criteria that are to be used in the
framework, namely: Development Extent; Research Axis; Instrumenting;
Communication standards; Intelligence deposit; Cognition level; Human factor.
Several recent examples of CPPS developments in literature are used to
illustrate the use of the framework and brief conclusions are drawn from the
comparative analysis of those examples.
","[{'version': 'v1', 'created': 'Fri, 26 Oct 2018 07:51:06 GMT'}]",2018-11-09,"[['Cardin', 'Olivier', '', 'PSI, LS2N, IUT NANTES']]","['Cyber-physical production systems', 'classification', 'cognition', 'framework', 'human factor', 'Manufacturing control']"
2037,1405.7470,"Andreas Kl\""ockner","Andreas Kl\""ockner",Loo.py: transformation-based code generation for GPUs and CPUs,,"Proceedings of ARRAY 2014: ACM SIGPLAN Workshop on Libraries,
  Languages, and Compilers for Array Programming",10.1145/2627373.2627387,,cs.PL cs.MS math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today's highly heterogeneous computing landscape places a burden on
programmers wanting to achieve high performance on a reasonably broad
cross-section of machines. To do so, computations need to be expressed in many
different but mathematically equivalent ways, with, in the worst case, one
variant per target machine.
  Loo.py, a programming system embedded in Python, meets this challenge by
defining a data model for array-style computations and a library of
transformations that operate on this model. Offering transformations such as
loop tiling, vectorization, storage management, unrolling, instruction-level
parallelism, change of data layout, and many more, it provides a convenient way
to capture, parametrize, and re-unify the growth among code variants. Optional,
deep integration with numpy and PyOpenCL provides a convenient computing
environment where the transition from prototype to high-performance
implementation can occur in a gradual, machine-assisted form.
","[{'version': 'v1', 'created': 'Thu, 29 May 2014 05:53:56 GMT'}]",2014-06-02,"[['Klöckner', 'Andreas', '']]","['Code generation', 'high-level language', 'GPU', 'vectorization', 'data layout', 'embedded language', 'high-performance']"
2038,2105.10075,Jianghong Zhou,"Jianghong Zhou, Eugene Agichtein, Surya Kallumadi",Diversifying Multi-aspect Search Results Using Simpson's Diversity Index,"Proceedings of the 29th ACM International Conference on Information
  and Knowledge Management (CIKM '20), October 19--23, 2020, Virtual Event,
  Ireland}","CIKM '20: Proceedings of the 29th ACM International Conference on
  Information & Knowledge Management October 2020 Pages 2345-2348",10.1145/3340531.3412163,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  In search and recommendation, diversifying the multi-aspect search results
could help with reducing redundancy, and promoting results that might not be
shown otherwise. Many previous methods have been proposed for this task.
However, previous methods do not explicitly consider the uniformity of the
number of the items' classes, or evenness, which could degrade the search and
recommendation quality. To address this problem, we introduce a novel method by
adapting the Simpson's Diversity Index from biology, which enables a more
effective and efficient quadratic search result diversification algorithm. We
also extend the method to balance the diversity between multiple aspects
through weighted factors and further improve computational complexity by
developing a fast approximation algorithm. We demonstrate the feasibility of
the proposed method using the openly available Kaggle shoes competition
dataset. Our experimental results show that our approach outperforms previous
state of the art diversification methods, while reducing computational
complexity.
","[{'version': 'v1', 'created': 'Fri, 21 May 2021 00:53:18 GMT'}]",2021-05-24,"[['Zhou', 'Jianghong', ''], ['Agichtein', 'Eugene', ''], ['Kallumadi', 'Surya', '']]","['search result diversification', 'Simpson’s diversity index for search', 'efficient search diversification computation']"
2039,1701.00289,Mariano Beguerisse-D\'iaz,"David J.P. O'Sullivan and Guillermo Gardu\~no-Hern\'andez and James P.
  Gleeson and Mariano Beguerisse-D\'iaz","Integrating sentiment and social structure to determine preference
  alignments: The Irish Marriage Referendum","16 pages, 12 figures","R. Soc. open sci., 4, 170154 (2017)",10.1098/rsos.170154,,cs.SI cs.CL cs.IR physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We examine the relationship between social structure and sentiment through
the analysis of a large collection of tweets about the Irish Marriage
Referendum of 2015. We obtain the sentiment of every tweet with the hashtags
#marref and #marriageref that was posted in the days leading to the referendum,
and construct networks to aggregate sentiment and use it to study the
interactions among users. Our results show that the sentiment of mention tweets
posted by users is correlated with the sentiment of received mentions, and
there are significantly more connections between users with similar sentiment
scores than among users with opposite scores in the mention and follower
networks. We combine the community structure of the two networks with the
activity level of the users and sentiment scores to find groups of users who
support voting `yes' or `no' in the referendum. There were numerous
conversations between users on opposing sides of the debate in the absence of
follower connections, which suggests that there were efforts by some users to
establish dialogue and debate across ideological divisions. Our analysis shows
that social structure can be integrated successfully with sentiment to analyse
and understand the disposition of social media users. These results have
potential applications in the integration of data and meta-data to study
opinion dynamics, public opinion modelling, and polling.
","[{'version': 'v1', 'created': 'Sun, 1 Jan 2017 20:54:52 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Feb 2017 16:14:00 GMT'}]",2017-07-18,"[[""O'Sullivan"", 'David J. P.', ''], ['Garduño-Hernández', 'Guillermo', ''], ['Gleeson', 'James P.', ''], ['Beguerisse-Díaz', 'Mariano', '']]","['Online Social Media', 'Networks', 'Text Analysis', 'Sentiment', 'Public Opinion', 'Referenda', 'OpinionDynamics', 'Homophily']"
2040,1807.11597,Ce Jin,"Ce Jin, Hongxun Wu","A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for
  Subset Sum",To appear in SOSA 2019 (fixed some typos),,10.4230/OASIcs.SOSA.2019.17,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a multiset $S$ of $n$ positive integers and a target integer $t$, the
Subset Sum problem asks to determine whether there exists a subset of $S$ that
sums up to $t$. The current best deterministic algorithm, by Koiliaris and Xu
[SODA'17], runs in $\tilde O(\sqrt{n}t)$ time, where $\tilde O$ hides
poly-logarithm factors. Bringmann [SODA'17] later gave a randomized $\tilde O(n
+ t)$ time algorithm using two-stage color-coding. The $\tilde O(n+t)$ running
time is believed to be near-optimal.
  In this paper, we present a simple and elegant randomized algorithm for
Subset Sum in $\tilde O(n + t)$ time. Our new algorithm actually solves its
counting version modulo prime $p>t$, by manipulating generating functions using
FFT.
","[{'version': 'v1', 'created': 'Mon, 30 Jul 2018 22:25:07 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Nov 2018 14:13:14 GMT'}, {'version': 'v3', 'created': 'Mon, 26 Nov 2018 12:21:01 GMT'}]",2020-01-03,"[['Jin', 'Ce', ''], ['Wu', 'Hongxun', '']]","['subset sum', 'formal power series', 'FFT']"
2041,1911.04422,Mat\'u\v{s} Sul\'ir,"Mat\'u\v{s} Sul\'ir, J\'an Juh\'ar",Draw This Object: A Study of Debugging Representations,,"Companion of the 3rd International Conference on Art, Science, and
  Engineering of Programming (Programming '19), ACM, 2019",10.1145/3328433.3328454,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Domain-specific debugging visualizations try to provide a view of a runtime
object tailored to a specific domain and highlighting its important properties.
The research in this area has focused mainly on the technical aspects of the
creation of such views so far. However, we still lack answers to questions such
as what properties of objects are considered important for these
visualizations, whether all objects have an appropriate domain-specific view,
or what clues could help us to construct these views fully automatically. In
this paper, we describe an exploratory study where the participants were asked
to inspect runtime states of objects displayed in a traditional debugger and
draw ideal domain-specific views of these objects on paper. We describe
interesting observations and findings obtained during this study and a
preliminary taxonomy of these visualizations.
","[{'version': 'v1', 'created': 'Mon, 11 Nov 2019 17:55:36 GMT'}]",2019-11-12,"[['Sulír', 'Matúš', ''], ['Juhár', 'Ján', '']]","['runtime', 'object state', 'visualization', 'qualitative study']"
2042,1608.06761,Geetanjali Kale,Geetanjali Vinayak Kale and Varsha Hemant Patil,A Study of Vision based Human Motion Recognition and Analysis,"5 Figures, 18 Pages, International Journal of Ambient Computing and
  Intelligence, Volume 7 Issue 2,July-December 2016",,10.4018/IJACI.2016070104,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Vision based human motion recognition has fascinated many researchers due to
its critical challenges and a variety of applications. The applications range
from simple gesture recognition to complicated behaviour understanding in
surveillance system. This leads to major development in the techniques related
to human motion representation and recognition. This paper discusses
applications, general framework of human motion recognition, and the details of
each of its components. The paper emphasizes on human motion representation and
the recognition methods along with their advantages and disadvantages. This
study also discusses the selected literature, popular datasets, and concludes
with the challenges in the domain along with a future direction. The human
motion recognition domain has been active for more than two decades, and has
provided a large amount of literature. A bird's eye view for new researchers in
the domain is presented in the paper.
","[{'version': 'v1', 'created': 'Wed, 24 Aug 2016 09:23:14 GMT'}]",2016-08-25,"[['Kale', 'Geetanjali Vinayak', ''], ['Patil', 'Varsha Hemant', '']]","['Human Motion Analysis', 'Human Motion Representation', 'Human Motion Recognition', 'Recognition Methods']"
2043,1709.03943,Erik Bartos,"Kabin Kanjamapornkul, Richard Pin\v{c}\'ak, Sanphet Chunithpaisan,
  Erik Barto\v{s}",Support Spinor Machine,"18 pages, 12 figures, 6 tables",Digital Signal Processing 70 (2017) 59-72,10.1016/j.dsp.2017.07.023,,cs.LG eess.SP q-fin.ST stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We generalize a support vector machine to a support spinor machine by using
the mathematical structure of wedge product over vector machine in order to
extend field from vector field to spinor field. The separated hyperplane is
extended to Kolmogorov space in time series data which allow us to extend a
structure of support vector machine to a support tensor machine and a support
tensor machine moduli space. Our performance test on support spinor machine is
done over one class classification of end point in physiology state of time
series data after empirical mode analysis and compared with support vector
machine test. We implement algorithm of support spinor machine by using
Holo-Hilbert amplitude modulation for fully nonlinear and nonstationary time
series data analysis.
","[{'version': 'v1', 'created': 'Mon, 11 Sep 2017 07:23:57 GMT'}]",2017-09-18,"[['Kanjamapornkul', 'Kabin', ''], ['Pinčák', 'Richard', ''], ['Chunithpaisan', 'Sanphet', ''], ['Bartoš', 'Erik', '']]","['support spinor machine', 'support vector machine', 'time series', 'moduli state space', 'holo-Hilbertspectrum']"
2044,1911.00621,Andrea Fioraldi,"Andrea Fioraldi, Daniele Cono D'Elia, Emilio Coppa",WEIZZ: Automatic Grey-box Fuzzing for Structured Binary Formats,,"Proceedings of the 29th ACM SIGSOFT International Symposium on
  Software Testing and Analysis, 2020",10.1145/3395363.3397372,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fuzzing technologies have evolved at a fast pace in recent years, revealing
bugs in programs with ever increasing depth and speed. Applications working
with complex formats are however more difficult to take on, as inputs need to
meet certain format-specific characteristics to get through the initial parsing
stage and reach deeper behaviors of the program. Unlike prior proposals based
on manually written format specifications, in this paper we present a technique
to automatically generate and mutate inputs for unknown chunk-based binary
formats. We propose a technique to identify dependencies between input bytes
and comparison instructions, and later use them to assign tags that
characterize the processing logic of the program. Tags become the building
block for structure-aware mutations involving chunks and fields of the input.
We show that our techniques performs comparably to structure-aware fuzzing
proposals that require human assistance. Our prototype implementation WEIZZ
revealed 16 unknown bugs in widely used programs.
","[{'version': 'v1', 'created': 'Sat, 2 Nov 2019 00:49:26 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Jul 2020 12:44:32 GMT'}, {'version': 'v3', 'created': 'Wed, 12 Aug 2020 07:46:45 GMT'}]",2020-08-13,"[['Fioraldi', 'Andrea', ''], [""D'Elia"", 'Daniele Cono', ''], ['Coppa', 'Emilio', '']]","['Fuzzing', 'binary testing', 'chunk-based formats', 'structural mutations']"
2045,1907.10235,Junwei Pan,"Junwei Pan, Yizhi Mao, Alfonso Lobos Ruiz, Yu Sun, Aaron Flores","Predicting Different Types of Conversions with Multi-Task Learning in
  Online Advertising",SIGKDD,SIGKDD 2019,10.1145/3292500.3330783,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Conversion prediction plays an important role in online advertising since
Cost-Per-Action (CPA) has become one of the primary campaign performance
objectives in the industry. Unlike click prediction, conversions have different
types in nature, and each type may be associated with different decisive
factors. In this paper, we formulate conversion prediction as a multi-task
learning problem, so that the prediction models for different types of
conversions can be learned together. These models share feature
representations, but have their specific parameters, providing the benefit of
information-sharing across all tasks. We then propose Multi-Task Field-weighted
Factorization Machine (MT-FwFM) to solve these tasks jointly. Our experiment
results show that, compared with two state-of-the-art models, MT-FwFM improve
the AUC by 0.74% and 0.84% on two conversion types, and the weighted AUC across
all conversion types is also improved by 0.50%.
","[{'version': 'v1', 'created': 'Wed, 24 Jul 2019 04:47:05 GMT'}, {'version': 'v2', 'created': 'Sun, 8 Mar 2020 23:46:52 GMT'}]",2020-03-10,"[['Pan', 'Junwei', ''], ['Mao', 'Yizhi', ''], ['Ruiz', 'Alfonso Lobos', ''], ['Sun', 'Yu', ''], ['Flores', 'Aaron', '']]","['Online Advertising', 'Conversion Prediction', 'Factorization Machines', 'Multi-Task Learning']"
2046,1402.1814,Paresh Tanna,"Prof. Paresh Tanna, Dr. Yogesh Ghodasara",Foundation for Frequent Pattern Mining Algorithms Implementation,"5 pages, Published with International Journal of Computer Trends and
  Technology (IJCTT)","International Journal of Computer Trends and Technology (IJCTT)
  4(7):2159-2163, July 2013",10.14445/2231-2803,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As with the development of the IT technologies, the amount of accumulated
data is also increasing. Thus the role of data mining comes into picture.
Association rule mining becomes one of the significant responsibilities of
descriptive technique which can be defined as discovering meaningful patterns
from large collection of data. The frequent pattern mining algorithms determine
the frequent patterns from a database. Mining frequent itemset is very
fundamental part of association rule mining. Many algorithms have been proposed
from last many decades including majors are Apriori, Direct Hashing and
Pruning, FP-Growth, ECLAT etc. The aim of this study is to analyze the existing
techniques for mining frequent patterns and evaluate the performance of them by
comparing Apriori and DHP algorithms in terms of candidate generation, database
and transaction pruning. This creates a foundation to develop newer algorithm
for frequent pattern mining.
","[{'version': 'v1', 'created': 'Sat, 8 Feb 2014 03:25:57 GMT'}]",2014-02-11,"[['Tanna', 'Prof. Paresh', ''], ['Ghodasara', 'Dr. Yogesh', '']]","['Association rule', 'Frequent pattern mining', 'Apriori', 'DHP', 'Foundation Implementation Study']"
2047,1708.00588,Maziar Raissi,Maziar Raissi and George Em Karniadakis,"Hidden Physics Models: Machine Learning of Nonlinear Partial
  Differential Equations",,,10.1016/j.jcp.2017.11.039,,cs.AI cs.LG math.AP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While there is currently a lot of enthusiasm about ""big data"", useful data is
usually ""small"" and expensive to acquire. In this paper, we present a new
paradigm of learning partial differential equations from {\em small} data. In
particular, we introduce \emph{hidden physics models}, which are essentially
data-efficient learning machines capable of leveraging the underlying laws of
physics, expressed by time dependent and nonlinear partial differential
equations, to extract patterns from high-dimensional data generated from
experiments. The proposed methodology may be applied to the problem of
learning, system identification, or data-driven discovery of partial
differential equations. Our framework relies on Gaussian processes, a powerful
tool for probabilistic inference over functions, that enables us to strike a
balance between model complexity and data fitting. The effectiveness of the
proposed approach is demonstrated through a variety of canonical problems,
spanning a number of scientific domains, including the Navier-Stokes,
Schr\""odinger, Kuramoto-Sivashinsky, and time dependent linear fractional
equations. The methodology provides a promising new direction for harnessing
the long-standing developments of classical methods in applied mathematics and
mathematical physics to design learning machines with the ability to operate in
complex domains without requiring large quantities of data.
","[{'version': 'v1', 'created': 'Wed, 2 Aug 2017 03:28:54 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Aug 2017 22:39:46 GMT'}]",2018-01-17,"[['Raissi', 'Maziar', ''], ['Karniadakis', 'George Em', '']]","['probabilistic machine learning', 'system identification', 'Bayesianmodeling', 'uncertainty quantification', 'fractional equations', 'small data']"
2048,1503.07881,Yonathan Perez,"Yonathan Perez, Rok Sosic, Arijit Banerjee, Rohan Puttagunta, Martin
  Raison, Pararth Shah, Jure Leskovec",Ringo: Interactive Graph Analytics on Big-Memory Machines,"6 pages, 2 figures",,10.1145/2723372.2735369,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present Ringo, a system for analysis of large graphs. Graphs provide a way
to represent and analyze systems of interacting objects (people, proteins,
webpages) with edges between the objects denoting interactions (friendships,
physical interactions, links). Mining graphs provides valuable insights about
individual objects as well as the relationships among them.
  In building Ringo, we take advantage of the fact that machines with large
memory and many cores are widely available and also relatively affordable. This
allows us to build an easy-to-use interactive high-performance graph analytics
system. Graphs also need to be built from input data, which often resides in
the form of relational tables. Thus, Ringo provides rich functionality for
manipulating raw input data tables into various kinds of graphs. Furthermore,
Ringo also provides over 200 graph analytics functions that can then be applied
to constructed graphs.
  We show that a single big-memory machine provides a very attractive platform
for performing analytics on all but the largest graphs as it offers excellent
performance and ease of use as compared to alternative approaches. With Ringo,
we also demonstrate how to integrate graph analytics with an iterative process
of trial-and-error data exploration and rapid experimentation, common in data
mining workloads.
","[{'version': 'v1', 'created': 'Thu, 26 Mar 2015 20:01:55 GMT'}]",2015-03-30,"[['Perez', 'Yonathan', ''], ['Sosic', 'Rok', ''], ['Banerjee', 'Arijit', ''], ['Puttagunta', 'Rohan', ''], ['Raison', 'Martin', ''], ['Shah', 'Pararth', ''], ['Leskovec', 'Jure', '']]","['Graphs', 'networks', 'graph processing', 'graph analytics']"
2049,1307.3075,Anurag,"Anurag, Gurmohan Singh, V. Sulochana",Low Power Dual Edge-Triggered Static D Flip-Flop,"Dual-Edge Triggered, Flip-Flop, High Speed, Low Power, Static D
  Flip-Flop","International Journal of VLSI design & Communication Systems
  (VLSICS) Vol.4, No.3, June 2013",10.5121/vlsic.2013.4303,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper enumerates new architecture of low power dual-edge triggered
Flip-Flop (DETFF) designed at 180nm CMOS technology. In DETFF same data
throughput can be achieved with half of the clock frequency as compared to
single edge triggered Flip-Flop (SETFF). In this paper conventional and
proposed DETFF are presented and compared at same simulation conditions. The
post layout experimental results comparison shows that the average power
dissipation is improved by 48.17%, 41.29% and 36.84% when compared with SCDFF,
DEPFF and SEDNIFF respectively and improvement in PDP is 42.44%, 33.88% and
24.69% as compared to SCDFF, DEPFF and SEDNIFF respectively. Therefore the
proposed DETFF design is suitable for low power and small area applications.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2013 11:53:40 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Dec 2014 10:19:59 GMT'}]",2014-12-30,"[['Anurag', '', ''], ['Singh', 'Gurmohan', ''], ['Sulochana', 'V.', '']]","['Dual-Edge Triggered', 'Flip-Flop', 'High Speed', 'Low Power', 'Static D Flip-Flop']"
2050,1507.06852,Maximiliano Cristia,"Maximiliano Cristia, Gianfranco Rossi and Claudia Frydman",Adding Partial Functions to Constraint Logic Programming with Sets,,Theory and Practice of Logic Programming 15 (2015) 651-665,10.1017/S1471068415000290,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Partial functions are common abstractions in formal specification notations
such as Z, B and Alloy. Conversely, executable programming languages usually
provide little or no support for them. In this paper we propose to add partial
functions as a primitive feature to a Constraint Logic Programming (CLP)
language, namely {log}. Although partial functions could be programmed on top
of {log}, providing them as first-class citizens adds valuable flexibility and
generality to the form of set-theoretic formulas that the language can safely
deal with. In particular, the paper shows how the {log} constraint solver is
naturally extended in order to accommodate for the new primitive constraints
dealing with partial functions. Efficiency of the new version is empirically
assessed by running a number of non-trivial set-theoretical goals involving
partial functions, obtained from specifications written in Z.
","[{'version': 'v1', 'created': 'Fri, 24 Jul 2015 14:18:59 GMT'}]",2020-02-19,"[['Cristia', 'Maximiliano', ''], ['Rossi', 'Gianfranco', ''], ['Frydman', 'Claudia', '']]","['CLP', '{log}', 'set theory', 'partial functions']"
2051,1502.01959,Lu\'is Tarrataca,Lu\'is Tarrataca and Andreas Wichert,Can Quantum Entanglement Detection Schemes Improve Search?,,"Quantum Information Processing, 2012, 11:1, 55-66",10.1007/s11128-011-0231-4,,cs.DS quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quantum computation, in particular Grover's algorithm, has aroused a great
deal of interest since it allows for a quadratic speedup to be obtained in
search procedures. Classical search procedures for an $N$ element database
require at most $O(N)$ time complexity. Grover's algorithm is able to find a
solution with high probability in $O(\sqrt{N})$ time through an amplitude
amplification scheme. In this work we draw elements from both classical and
quantum computation to develop an alternative search proposal based on quantum
entanglement detection schemes. In 2002, Horodecki and Ekert proposed an
efficient method for direct detection of quantum entanglement. Our proposition
to quantum search combines quantum entanglement detection alongside
entanglement inducing operators. Grover's quantum search relies on measuring a
quantum superposition after having applied a unitary evolution. We deviate from
the standard method by focusing on fine-tuning a unitary operator in order to
infer the solution with certainty. Our proposal sacrifices space for speed and
depends on the mathematical properties of linear positive maps $\Lambda$ which
have not been operationally characterized. Whether such a $\Lambda$ can be
easily determined remains an open question.
","[{'version': 'v1', 'created': 'Fri, 6 Feb 2015 17:04:50 GMT'}]",2015-02-09,"[['Tarrataca', 'Luís', ''], ['Wichert', 'Andreas', '']]","['quantum computation', 'tree search', 'entanglement detection']"
2052,1912.02962,Shuqi Xu,"Shuqi Xu, Qianming Zhang, Linyuan Lv, Manuel Sebastian Mariani","Recommending investors for new startups by integrating network diffusion
  and investors' domain preference",,Information Sciences 515C (2020) 103-115,10.1016/j.ins.2019.11.045,,cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the past decade, many startups have sprung up, which create a huge
demand for financial support from venture investors. However, due to the
information asymmetry between investors and companies, the financing process is
usually challenging and time-consuming, especially for the startups that have
not yet obtained any investment. Because of this, effective data-driven
techniques to automatically match startups with potentially relevant investors
would be highly desirable. Here, we analyze 34,469 valid investment events
collected from www.itjuzi.com and consider the cold-start problem of
recommending investors for new startups. We address this problem by
constructing different tripartite network representations of the data where
nodes represent investors, companies, and companies' domains. First, we find
that investors have strong domain preferences when investing, which motivates
us to introduce virtual links between investors and investment domains in the
tripartite network construction. Our analysis of the recommendation performance
of diffusion-based algorithms applied to various network representations
indicates that prospective investors for new startups are effectively revealed
by integrating network diffusion processes with investors' domain preference.
","[{'version': 'v1', 'created': 'Fri, 6 Dec 2019 03:18:24 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Jan 2020 11:47:08 GMT'}]",2020-01-17,"[['Xu', 'Shuqi', ''], ['Zhang', 'Qianming', ''], ['Lv', 'Linyuan', ''], ['Mariani', 'Manuel Sebastian', '']]","['Diffusion model', 'Recommender systems', 'Venture investment', 'Cold-start problem', 'Tripartite network']"
2053,1005.5436,Secretary Aircc Journal,"M. Dakshayini(1), T. R. Gopala Krishnan Nair(2), ((1)Dr.MGR
  University, India, (2)Research and Industry Incubation Centre - Bangalore,
  India)",Client-to-Client Streaming Scheme for VOD Applications,"10 Pages, IJMA","International journal of Multimedia & Its Applications 2.2 (2010)
  46-55",10.5121/ijma.2010.2204,,cs.MM,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper, we propose an efficient client-to-client streaming approach to
cooperatively stream the video using chaining technique with unicast
communication among the clients. This approach considers two major issues of
VoD 1) Prefix caching scheme to accommodate more number of videos closer to
client, so that the request-service delay for the user can be minimized. 2)
Cooperative proxy and client chaining scheme for streaming the videos using
unicasting. This approach minimizes the client rejection rate and bandwidth
requirement on server to proxy and proxy to client path. Our simulation results
show that the proposed approach achieves reduced client waiting time and
optimal prefix caching of videos minimizing server to proxy path bandwidth
usage by utilizing the client to client bandwidth, which is occasionally used
when compared to busy server to proxy path bandwidth.
","[{'version': 'v1', 'created': 'Sat, 29 May 2010 08:00:39 GMT'}]",2010-07-15,"[['Dakshayini', 'M.', ''], ['Nair', 'T. R. Gopala Krishnan', '']]","['Prefix Caching', 'Cooperative Clients', 'Streaming', 'Bandwidth Usage', 'Chaining']"
2054,1705.09732,Ian McQuillan,Oscar H. Ibarra and Ian McQuillan,"Variations of Checking Stack Automata: Obtaining Unexpected Decidability
  Properties",,"Theoretical Computer Science, 738, 1-12, 2018",10.1016/j.tcs.2018.04.024,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a model of one-way language acceptors (a variant of a checking
stack automaton) and show the following decidability properties: (1) The
deterministic version has a decidable membership problem but has an undecidable
emptiness problem. (2) The nondeterministic version has an undecidable
membership problem and emptiness problem. There are many models of accepting
devices for which there is no difference with these problems between
deterministic and nondeterministic versions, and the same holds for the
emptiness problem. As far as we know, the model we introduce above is the first
one-way model to exhibit properties (1) and (2). We define another family of
one-way acceptors where the nondeterministic version has an undecidable
emptiness problem, but the deterministic version has a decidable emptiness
problem. We also know of no other model with this property in the literature.
We also investigate decidability properties of other variations of checking
stack automata (e.g., allowing multiple stacks, two-way input, etc.).
Surprisingly, two-way deterministic machines with multiple checking stacks and
multiple reversal-bounded counters are shown to have a decidable membership
problem, a very general model with this property.
","[{'version': 'v1', 'created': 'Fri, 26 May 2017 22:22:01 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Mar 2019 16:25:31 GMT'}]",2019-03-08,"[['Ibarra', 'Oscar H.', ''], ['McQuillan', 'Ian', '']]","['checking stack automata', 'pushdown automata', 'decidability', 'reversal-bounded counters']"
2055,1702.00764,Fabio Massimo Zanzotto,Lorenzo Ferrone and Fabio Massimo Zanzotto,"Symbolic, Distributed and Distributional Representations for Natural
  Language Processing in the Era of Deep Learning: a Survey",25 pages,"Frontiers in Robotics and AI, 2020",10.3389/frobt.2019.00153,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Natural language is inherently a discrete symbolic representation of human
knowledge. Recent advances in machine learning (ML) and in natural language
processing (NLP) seem to contradict the above intuition: discrete symbols are
fading away, erased by vectors or tensors called distributed and distributional
representations. However, there is a strict link between
distributed/distributional representations and discrete symbols, being the
first an approximation of the second. A clearer understanding of the strict
link between distributed/distributional representations and symbols may
certainly lead to radically new deep learning networks. In this paper we make a
survey that aims to renew the link between symbolic representations and
distributed/distributional representations. This is the right time to
revitalize the area of interpreting how discrete symbols are represented inside
neural networks.
","[{'version': 'v1', 'created': 'Thu, 2 Feb 2017 17:53:29 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Jun 2019 13:32:42 GMT'}]",2020-03-02,"[['Ferrone', 'Lorenzo', ''], ['Zanzotto', 'Fabio Massimo', '']]","['keyword', 'keyword', 'keyword', 'keyword', 'keyword', 'keyword', 'keyword', 'keyword']"
2056,0708.0660,Guanrong Chen,"Zhisheng Duan, Chao Liu and Guanrong Chen","Network synchronizability analysis: the theory of subgraphs and
  complementary graphs","13 pages, 7 figures",,10.1016/j.physd.2007.12.003,,cs.NI cs.GR,,"  In this paper, subgraphs and complementary graphs are used to analyze the
network synchronizability. Some sharp and attainable bounds are provided for
the eigenratio of the network structural matrix, which characterizes the
network synchronizability, especially when the network's corresponding graph
has cycles, chains, bipartite graphs or product graphs as its subgraphs.
","[{'version': 'v1', 'created': 'Sun, 5 Aug 2007 05:25:45 GMT'}]",2009-11-13,"[['Duan', 'Zhisheng', ''], ['Liu', 'Chao', ''], ['Chen', 'Guanrong', '']]","['Complex network', 'Subgraph', 'Complementary graph', 'Synchronizability']"
2057,1401.3674,Zhili Guo,"Zhili Guo, Yao Wang, Elza Erkip, Shivendra Panwar","Wireless Video Multicast with Cooperative and Incremental Transmission
  of Parity Packets","11 pages in double-column IEEE journal style. Submitted to IEEE
  JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING",,10.1109/TMM.2015.2438718,,cs.MM cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a cooperative multicast scheme that uses Randomized
Distributed Space Time Codes (R-DSTC), along with packet level Forward Error
Correction (FEC), is studied. Instead of sending source packets and/or parity
packets through two hops using R-DSTC as proposed in our prior work, the new
scheme delivers both source packets and parity packets using only one hop.
After the source station (access point, AP) first sends all the source packets,
the AP as well as all nodes that have received all source packets together send
the parity packets using R-DSTC. As more parity packets are transmitted, more
nodes can recover all source packets and join the parity packet transmission.
The process continues until all nodes acknowledge the receipt of enough packets
for recovering the source packets. For each given node distribution, the
optimum transmission rates for source and parity packets are determined such
that the video rate that can be sustained at all nodes is maximized. This new
scheme can support significantly higher video rates, and correspondingly higher
PSNR of decoded video, than the prior approaches. Three suboptimal approaches,
which do not require full information about user distribution or the feedback,
and hence are more feasible in practice are also presented. The proposed
suboptimal scheme with only the node count information and without feedback
still outperforms our prior approach that assumes full channel information and
no feedback.
","[{'version': 'v1', 'created': 'Wed, 15 Jan 2014 17:08:41 GMT'}]",2016-11-18,"[['Guo', 'Zhili', ''], ['Wang', 'Yao', ''], ['Erkip', 'Elza', ''], ['Panwar', 'Shivendra', '']]","['User cooperation', 'video multicast', 'incremental parity transmission', 'randomized distributed space']"
2058,1809.10078,Jordi Vermeulen,"Vahideh Keikha and Mees van de Kerkhof and Marc van Kreveld and Irina
  Kostitsyna and Maarten L\""offler and Frank Staals and J\'er\^ome Urhausen and
  Jordi L. Vermeulen and Lionov Wiratma",Convex partial transversals of planar regions,,,10.4230/LIPIcs.ISAAC.2018.187,,cs.CG,http://creativecommons.org/licenses/by/4.0/,"  We consider the problem of testing, for a given set of planar regions $\cal
R$ and an integer $k$, whether there exists a convex shape whose boundary
intersects at least $k$ regions of $\cal R$. We provide a polynomial time
algorithm for the case where the regions are disjoint line segments with a
constant number of orientations. On the other hand, we show that the problem is
NP-hard when the regions are intersecting axis-aligned rectangles or 3-oriented
line segments. For several natural intermediate classes of shapes (arbitrary
disjoint segments, intersecting 2-oriented segments) the problem remains open.
","[{'version': 'v1', 'created': 'Wed, 26 Sep 2018 15:50:00 GMT'}]",2018-09-27,"[['Keikha', 'Vahideh', ''], ['van de Kerkhof', 'Mees', ''], ['van Kreveld', 'Marc', ''], ['Kostitsyna', 'Irina', ''], ['Löffler', 'Maarten', ''], ['Staals', 'Frank', ''], ['Urhausen', 'Jérôme', ''], ['Vermeulen', 'Jordi L.', ''], ['Wiratma', 'Lionov', '']]","['computational geometry', 'algorithms', 'NP-hardness', 'convex transversals']"
2059,1608.04082,Evgeny Lipovetsky,Evgeny Lipovetsky and Nira Dyn,"A weighted binary average of point-normal pairs with application to
  subdivision schemes",,,10.1016/j.cagd.2016.07.004,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Subdivision is a well-known and established method for generating smooth
curves and surfaces from discrete data by repeated refinements. The typical
input for such a process is a mesh of vertices. In this work we propose to
refine 2D data consisting of vertices of a polygon and a normal at each vertex.
Our core refinement procedure is based on a circle average, which is a new
non-linear weighted average of two points and their corresponding normals. The
ability to locally approximate curves by the circle average is demonstrated.
With this ability, the circle average is a candidate for modifying linear
subdivision schemes refining points, to schemes refining point-normal pairs.
This is done by replacing the weighted binary arithmetic means in a linear
subdivision scheme, expressed in terms of repeated binary averages, by circle
averages with the same weights. Here we investigate the modified
Lane-Riesenfeld algorithm and the 4-point scheme. For the case that the initial
data consists of a control polygon only, a naive method for choosing initial
normals is proposed. An example demonstrates the superiority of the above two
modified schemes, with the naive choice of initial normals over the
corresponding linear schemes, when applied to a control polygon with edges of
significantly different lengths.
","[{'version': 'v1', 'created': 'Sun, 14 Aug 2016 09:55:34 GMT'}]",2016-08-16,"[['Lipovetsky', 'Evgeny', ''], ['Dyn', 'Nira', '']]","['non-linear subdivision schemes', '2D curve design', 'weighted binaryaverage of point-normal pairs', 'convergence', 'Lane-Riesenfeld algorithm', '4-pointscheme']"
2060,1012.4074,Woong-Kee Loh Prof.,"Woong-Kee Loh, Yang-Sae Moon, and Wookey Lee",A fast divide-and-conquer algorithm for indexing human genome sequences,"8 pages, 9 figures",,10.1587/transinf.E94.D.1369,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since the release of human genome sequences, one of the most important
research issues is about indexing the genome sequences, and the suffix tree is
most widely adopted for that purpose. The traditional suffix tree construction
algorithms have severe performance degradation due to the memory bottleneck
problem. The recent disk-based algorithms also have limited performance
improvement due to random disk accesses. Moreover, they do not fully utilize
the recent CPUs with multiple cores. In this paper, we propose a fast algorithm
based on 'divide-and-conquer' strategy for indexing the human genome sequences.
Our algorithm almost eliminates random disk accesses by accessing the disk in
the unit of contiguous chunks. In addition, our algorithm fully utilizes the
multi-core CPUs by dividing the genome sequences into multiple partitions and
then assigning each partition to a different core for parallel processing.
Experimental results show that our algorithm outperforms the previous fastest
DIGEST algorithm by up to 3.5 times.
","[{'version': 'v1', 'created': 'Sat, 18 Dec 2010 09:46:03 GMT'}]",2015-05-20,"[['Loh', 'Woong-Kee', ''], ['Moon', 'Yang-Sae', ''], ['Lee', 'Wookey', '']]","['human genome sequences', 'indexing', 'suffix tree', 'memory bottleneck problem', 'divide-and-conquer', 'parallelprocessing']"
2061,1309.0136,Serkan Gugercin,"Tobias Breiten, Christopher Beattie, and Serkan Gugercin",Near-optimal Frequency-weighted Interpolatory Model Reduction,,"Systems and Control Letters. Vol. 78, pp. 8--18, 2015",10.1016/j.sysconle.2015.01.005,Max Planck Institute Magdeburg Preprint MPIMD/13-15,cs.SY math.DS math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper develops an interpolatory framework for weighted-$\mathcal{H}_2$
model reduction of MIMO dynamical systems. A new representation of the
weighted-$\mathcal{H}_2$ inner products in MIMO settings is introduced and used
to derive associated first-order necessary conditions satisfied by optimal
weighted-$\mathcal{H}_2$ reduced-order models. Equivalence of these new
interpolatory conditions with earlier Riccati-based conditions given by Halevi
is also shown. An examination of realizations for equivalent
weighted-$\mathcal{H}_2$ systems leads then to an algorithm that remains
tractable for large state-space dimension. Several numerical examples
illustrate the effectiveness of this approach and its competitiveness with
Frequency Weighted Balanced Truncation and an earlier interpolatory approach,
the Weighted Iterative Rational Krylov Algorithm.
","[{'version': 'v1', 'created': 'Sat, 31 Aug 2013 17:37:37 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Jul 2014 19:56:26 GMT'}]",2016-10-05,"[['Breiten', 'Tobias', ''], ['Beattie', 'Christopher', ''], ['Gugercin', 'Serkan', '']]","['frequency-weighting', 'interpolation', 'controller reduction', 'H2 model reduction']"
2062,1610.02796,"Sebastian Sch\""ops","Radoslav Jankoski and Ulrich R\""omer and Sebastian Sch\""ops",Modeling of Spatial Uncertainties in the Magnetic Reluctivity,submitted to COMPEL,"COMPEL, Vol. 36, Issue: 4, pp.1151-1167, 2017",10.1108/COMPEL-10-2016-0438,,cs.CE math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper a computationally efficient approach is suggested for the
stochastic modeling of an inhomogeneous reluctivity of magnetic materials.
These materials can be part of electrical machines, such as a single phase
transformer (a benchmark example that is considered in this paper). The
approach is based on the Karhunen-Lo\`{e}ve expansion. The stochastic model is
further used to study the statistics of the self inductance of the primary coil
as a quantity of interest.
","[{'version': 'v1', 'created': 'Mon, 10 Oct 2016 08:15:26 GMT'}]",2017-09-26,"[['Jankoski', 'Radoslav', ''], ['Römer', 'Ulrich', ''], ['Schöps', 'Sebastian', '']]","['Karhunen-Lo`eve expansion', 'hierarchical matrices', 'Lanczos method', 'generalized eigenvalue problem']"
2063,1208.5557,Alireza Nemaney Pour,"Elina Eidkhani, Melisa Hajyvahabzadeh, S. Anahita Mortazavi, Alireza
  Nemaney Pour","CRAW: Combination of Re-Keying and Authentication in Wireless Networks
  for Secure Multicast Increasing Efficiency of Member Join/Leave and Movement","22 pages, 16 figures, 7 tables","International Journal of Computer Networks & Communications
  (IJCNC) Vol.4, No.4, July 2012",10.5121/ijcnc.2012.4407,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, the number of requests for multicast services through the wireless
networks has been increased. However, for successful deployment, security and
efficiency of content delivery must be provided at first. This paper presents a
new approach for secure multicast in wireless networks. This approach, CRAW
(Combination of Re-keying and Authentication in Wireless networks) combines
member authentication procedure with group key management protocol to provide
an efficient group re-keying process. One-time password is proposed for member
authentication and CKC (Code for Key Calculation) is suggested for group key
management in wireless networks. In fact, the combination of authentication
with group key management in wireless networks results in a simple and secure
mechanism both for authentication and group key management while mobile members
join/leave a group or move inter-area. Simulation results show that CRAW
reduces re-keying overhead at join from O(log2 n+1) to O(1) while security
requirements are saved. Also, CRAW introduces storing a main list to manage
mobile members' location while they move intra-group inter-area.
","[{'version': 'v1', 'created': 'Tue, 28 Aug 2012 04:34:41 GMT'}]",2012-08-29,"[['Eidkhani', 'Elina', ''], ['Hajyvahabzadeh', 'Melisa', ''], ['Mortazavi', 'S. Anahita', ''], ['Pour', 'Alireza Nemaney', '']]","['Secure Multicast', 'Group Key Management', 'Wireless Networks', 'Member Authentication', 'One-Time Password']"
2064,1706.01780,Mehrdad Shariat,"Mehrdad Shariat, David M. Gutierrez-Estevez, Arnesh Vijay, Krystian
  Safjan, Patrik Rugeland, Icaro da Silva, Javier Lorca, Joerg Widmer, Maria
  Fresia, Yilin Li, Isabelle Siaud",5G Radio Access above 6 GHz,"7 pages, 5 figures","Transactions on Emerging Telecommunications Technologies, vol. 27,
  no. 9, pp. 1160-1167, 2016",10.1002/ett.3076,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Designing and developing a millimetre-wave(mmWave) based mobile Radio Access
Technology (RAT) in the 6-100 GHz frequency range is a fundamental component in
the standardization of the new 5G radio interface, recently kicked off by 3GPP.
Such component, herein called the new mmWave RAT, will not only enable extreme
mobile broadband (eMBB) services,but also support UHD/3D streaming, offer
immersive applications and ultra-responsive cloud services to provide an
outstanding Quality of Experience (QoE) to the mobile users. The main objective
of this paper is to develop the network architectural elements and functions
that will enable tight integration of mmWave technology into the overall 5G
radio access network (RAN). A broad range of topics addressing mobile
architecture and network functionalities will be covered-starting with the
architectural facets of network slicing, multiconnectivity and cells
clustering, to more functional elements of initial access, mobility, radio
resource management (RRM) and self-backhauling. The intention of the concepts
presented here is to lay foundation for future studies towards the first
commercial implementation of the mmWave RAT above 6 GHz.
","[{'version': 'v1', 'created': 'Tue, 6 Jun 2017 14:15:14 GMT'}]",2017-06-07,"[['Shariat', 'Mehrdad', ''], ['Gutierrez-Estevez', 'David M.', ''], ['Vijay', 'Arnesh', ''], ['Safjan', 'Krystian', ''], ['Rugeland', 'Patrik', ''], ['da Silva', 'Icaro', ''], ['Lorca', 'Javier', ''], ['Widmer', 'Joerg', ''], ['Fresia', 'Maria', ''], ['Li', 'Yilin', ''], ['Siaud', 'Isabelle', '']]","['mmWave', 'architecture', 'multi-connectivity', 'network slicing', 'cells clustering']"
2065,1705.05444,Mehmet Turan,"Mehmet Turan, Yasin Almalioglu, Helder Araujo, Ender Konukoglu, Metin
  Sitti","A Non-Rigid Map Fusion-Based RGB-Depth SLAM Method for Endoscopic
  Capsule Robots",,,10.1007/s41315-017-0036-4,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the gastrointestinal (GI) tract endoscopy field, ingestible wireless
capsule endoscopy is considered as a minimally invasive novel diagnostic
technology to inspect the entire GI tract and to diagnose various diseases and
pathologies. Since the development of this technology, medical device companies
and many groups have made significant progress to turn such passive capsule
endoscopes into robotic active capsule endoscopes to achieve almost all
functions of current active flexible endoscopes. However, the use of robotic
capsule endoscopy still has some challenges. One such challenge is the precise
localization of such active devices in 3D world, which is essential for a
precise three-dimensional (3D) mapping of the inner organ. A reliable 3D map of
the explored inner organ could assist the doctors to make more intuitive and
correct diagnosis. In this paper, we propose to our knowledge for the first
time in literature a visual simultaneous localization and mapping (SLAM) method
specifically developed for endoscopic capsule robots. The proposed RGB-Depth
SLAM method is capable of capturing comprehensive dense globally consistent
surfel-based maps of the inner organs explored by an endoscopic capsule robot
in real time. This is achieved by using dense frame-to-model camera tracking
and windowed surfelbased fusion coupled with frequent model refinement through
non-rigid surface deformations.
","[{'version': 'v1', 'created': 'Mon, 15 May 2017 20:42:29 GMT'}]",2017-11-27,"[['Turan', 'Mehmet', ''], ['Almalioglu', 'Yasin', ''], ['Araujo', 'Helder', ''], ['Konukoglu', 'Ender', ''], ['Sitti', 'Metin', '']]","['Capsule Endoscope Robot', 'Dense RGB-Depth SLAM', 'Non-rigid']"
2066,1701.00464,Antonio Lieto,"Antonio Lieto, Antonio Chella, Marcello Frixione","Conceptual Spaces for Cognitive Architectures: A Lingua Franca for
  Different Levels of Representation","31 pages, 3 figures in Biologically Inspired Cognitive Architectures,
  2017",,10.1016/j.bica.2016.10.005,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During the last decades, many cognitive architectures (CAs) have been
realized adopting different assumptions about the organization and the
representation of their knowledge level. Some of them (e.g. SOAR [Laird
(2012)]) adopt a classical symbolic approach, some (e.g. LEABRA [O'Reilly and
Munakata (2000)]) are based on a purely connectionist model, while others (e.g.
CLARION [Sun (2006)] adopt a hybrid approach combining connectionist and
symbolic representational levels. Additionally, some attempts (e.g. biSOAR)
trying to extend the representational capacities of CAs by integrating
diagrammatical representations and reasoning are also available [Kurup and
Chandrasekaran (2007)]. In this paper we propose a reflection on the role that
Conceptual Spaces, a framework developed by Peter G\""ardenfors [G\""ardenfors
(2000)] more than fifteen years ago, can play in the current development of the
Knowledge Level in Cognitive Systems and Architectures. In particular, we claim
that Conceptual Spaces offer a lingua franca that allows to unify and
generalize many aspects of the symbolic, sub-symbolic and diagrammatic
approaches (by overcoming some of their typical problems) and to integrate them
on a common ground. In doing so we extend and detail some of the arguments
explored by G\""ardenfors [G\""ardenfors (1997)] for defending the need of a
conceptual, intermediate, representation level between the symbolic and the
sub-symbolic one.
","[{'version': 'v1', 'created': 'Mon, 2 Jan 2017 17:35:34 GMT'}]",2017-01-03,"[['Lieto', 'Antonio', ''], ['Chella', 'Antonio', ''], ['Frixione', 'Marcello', '']]","['Knowledge Representation', 'Cognitive Architectures', 'Cognitive']"
2067,1706.09739,Sergio Oramas,"Sergio Oramas, Oriol Nieto, Mohamed Sordo, Xavier Serra",A Deep Multimodal Approach for Cold-start Music Recommendation,"In Proceedings of the 2nd Workshop on Deep Learning for Recommender
  Systems (DLRS 2017), collocated with RecSys 2017",,10.1145/3125486.3125492,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An increasing amount of digital music is being published daily. Music
streaming services often ingest all available music, but this poses a
challenge: how to recommend new artists for which prior knowledge is scarce? In
this work we aim to address this so-called cold-start problem by combining text
and audio information with user feedback data using deep network architectures.
Our method is divided into three steps. First, artist embeddings are learned
from biographies by combining semantics, text features, and aggregated usage
data. Second, track embeddings are learned from the audio signal and available
feedback data. Finally, artist and track embeddings are combined in a
multimodal network. Results suggest that both splitting the recommendation
problem between feature levels (i.e., artist metadata and audio track), and
merging feature embeddings in a multimodal approach improve the accuracy of the
recommendations.
","[{'version': 'v1', 'created': 'Thu, 29 Jun 2017 13:13:26 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Jul 2017 08:07:28 GMT'}]",2017-07-25,"[['Oramas', 'Sergio', ''], ['Nieto', 'Oriol', ''], ['Sordo', 'Mohamed', ''], ['Serra', 'Xavier', '']]","['recommender systems', 'deep learning', 'multimodal', 'music', 'semantics']"
2068,1709.05206,Fazle Karim,"Fazle Karim, Somshubra Majumdar, Houshang Darabi and Shun Chen",LSTM Fully Convolutional Networks for Time Series Classification,"7 pages, 3 figures and 2 tables",,10.1109/ACCESS.2017.2779939,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fully convolutional neural networks (FCN) have been shown to achieve
state-of-the-art performance on the task of classifying time series sequences.
We propose the augmentation of fully convolutional networks with long short
term memory recurrent neural network (LSTM RNN) sub-modules for time series
classification. Our proposed models significantly enhance the performance of
fully convolutional networks with a nominal increase in model size and require
minimal preprocessing of the dataset. The proposed Long Short Term Memory Fully
Convolutional Network (LSTM-FCN) achieves state-of-the-art performance compared
to others. We also explore the usage of attention mechanism to improve time
series classification with the Attention Long Short Term Memory Fully
Convolutional Network (ALSTM-FCN). Utilization of the attention mechanism
allows one to visualize the decision process of the LSTM cell. Furthermore, we
propose fine-tuning as a method to enhance the performance of trained models.
An overall analysis of the performance of our model is provided and compared to
other techniques.
","[{'version': 'v1', 'created': 'Fri, 8 Sep 2017 13:35:36 GMT'}]",2018-03-20,"[['Karim', 'Fazle', ''], ['Majumdar', 'Somshubra', ''], ['Darabi', 'Houshang', ''], ['Chen', 'Shun', '']]","['Convolutional Neural Network', 'Long Short TermMemory Recurrent Neural Network', 'Time Series Classification']"
2069,1706.01330,Filip Matzner,Filip Matzner,Neuroevolution on the Edge of Chaos,"To appear in Proceedings of the Genetic and Evolutionary Computation
  Conference 2017 (GECCO '17)",,10.1145/3071178.3071292,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Echo state networks represent a special type of recurrent neural networks.
Recent papers stated that the echo state networks maximize their computational
performance on the transition between order and chaos, the so-called edge of
chaos. This work confirms this statement in a comprehensive set of experiments.
Furthermore, the echo state networks are compared to networks evolved via
neuroevolution. The evolved networks outperform the echo state networks,
however, the evolution consumes significant computational resources. It is
demonstrated that echo state networks with local connections combine the best
of both worlds, the simplicity of random echo state networks and the
performance of evolved networks. Finally, it is shown that evolution tends to
stay close to the ordered side of the edge of chaos.
","[{'version': 'v1', 'created': 'Mon, 5 Jun 2017 14:04:16 GMT'}]",2017-06-06,"[['Matzner', 'Filip', '']]","['recurrent neural networks', 'echo state networks', 'neuroevolution', 'edge of chaos', 'phase transition']"
2070,1410.2834,Ubiratam de Paula Junior,"Ubiratam de Paula Junior, L\'ucia M. A. Drummond, Daniel de Oliveira,
  Yuri Frota, Valmir C. Barbosa","Handling Flash-Crowd Events to Improve the Performance of Web
  Applications",Submitted to the 30th Symposium On Applied Computing (2015),"Proceedings of the 30th ACM/SIGAPP Symposium on Applied Computing,
  769-774, 2015",10.1145/2695664.2695839,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing can offer a set of computing resources according to users'
demand. It is suitable to be used to handle flash-crowd events in Web
applications due to its elasticity and on-demand characteristics. Thus, when
Web applications need more computing or storage capacity, they just instantiate
new resources. However, providers have to estimate the amount of resources to
instantiate to handle with the flash-crowd event. This estimation is far from
trivial since each cloud environment provides several kinds of heterogeneous
resources, each one with its own characteristics such as bandwidth, CPU, memory
and financial cost. In this paper, the Flash Crowd Handling Problem (FCHP) is
precisely defined and formulated as an integer programming problem. A new
algorithm for handling with a flash crowd named FCHP-ILS is also proposed. With
FCHP-ILS the Web applications can replicate contents in the already
instantiated resources and define the types and amount of resources to
instantiate in the cloud during a flash crowd. Our approach is evaluated
considering real flash crowd traces obtained from the related literature. We
also present a case study, based on a synthetic dataset representing
flash-crowd events in small scenarios aiming at the comparison of the proposed
approach against Amazon's Auto-Scale mechanism.
","[{'version': 'v1', 'created': 'Fri, 10 Oct 2014 16:36:09 GMT'}]",2015-05-04,"[['Junior', 'Ubiratam de Paula', ''], ['Drummond', 'Lúcia M. A.', ''], ['de Oliveira', 'Daniel', ''], ['Frota', 'Yuri', ''], ['Barbosa', 'Valmir C.', '']]","['Flash Crowd', 'Cloud Computing', 'Optimization']"
2071,1301.3187,Mery Yolima Uribe Rios,Mery Yolima Uribe Rios and Rafael V. P\'aez,"Recommendation system for information services adapted, over terrestrial
  digital television","13 pages, 8 figures and 3 tables",,10.5121/cseij.2012.2602,,cs.CY,http://creativecommons.org/licenses/by/3.0/,"  The development of digital television in Colombia has grown in last years,
specially the digital terrestrial television (DTT), which is an essential part
to the projects of National Minister of ICT, thanks to the big distribution and
use of the television network and Internet in the country. This article
explains how joining different technologies like social networks, information
adaptation and DTT, to get an application that offers information services to
users, based on their data, preferences, inclinations, use and interaction with
others users and groups inside the network.
","[{'version': 'v1', 'created': 'Tue, 15 Jan 2013 00:06:00 GMT'}]",2013-01-16,"[['Rios', 'Mery Yolima Uribe', ''], ['Páez', 'Rafael V.', '']]","['Application', 'social network', 'services adaptation', 'terrestrial digital television', 'Ubiquitous computing', 'webservices']"
2072,1807.05618,Rodolfo Quispe,Rodolfo Quispe and Helio Pedrini,"Improved Person Re-Identification Based on Saliency and Semantic Parsing
  with Deep Neural Network Models",person re-identification,Image and Vision Computing 2019,10.1016/j.imavis.2019.07.009,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a video or an image of a person acquired from a camera, person
re-identification is the process of retrieving all instances of the same person
from videos or images taken from a different camera with non-overlapping view.
This task has applications in various fields, such as surveillance, forensics,
robotics, multimedia. In this paper, we present a novel framework, named
Saliency-Semantic Parsing Re-Identification (SSP-ReID), for taking advantage of
the capabilities of both clues: saliency and semantic parsing maps, to guide a
backbone convolutional neural network (CNN) to learn complementary
representations that improves the results over the original backbones. The
insight of fusing multiple clues is based on specific scenarios in which one
response is better than another, thus favoring the combination of them to
increase performance. Due to its definition, our framework can be easily
applied to a wide variety of networks and, in contrast to other competitive
methods, our training process follows simple and standard protocols. We present
extensive evaluation of our approach through five backbones and three
benchmarks. Experimental results demonstrate the effectiveness of our person
re-identification framework. In addition, we combine our framework with
re-ranking techniques to achieve state-of-the-art results on three benchmarks.
","[{'version': 'v1', 'created': 'Sun, 15 Jul 2018 21:40:00 GMT'}]",2020-02-25,"[['Quispe', 'Rodolfo', ''], ['Pedrini', 'Helio', '']]","['person re-identification', 'deep learning', 'multi-clue guided learning', 'human semantic parsing', 'saliencydetection', 'convolutional neural networks']"
2073,1502.00238,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",On instruction sets for Boolean registers in program algebra,"18 pages, the preliminaries are largely the same as the preliminaries
  in arXiv:1402.4950 [cs.PL] and some earlier papers; 21 pages, presentation
  improved","Scientific Annals of Computer Science 26(1):1--26, 2016",10.7561/SACS.2016.1.1,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In previous work carried out in the setting of program algebra, including
work in the area of instruction sequence size complexity, we chose instruction
sets for Boolean registers that contain only instructions of a few of the
possible kinds. In the current paper, we study instruction sequence size
bounded functional completeness of all possible instruction sets for Boolean
registers. We expect that the results of this study will turn out to be useful
to adequately assess results of work that is concerned with lower bounds of
instruction sequence size complexity.
","[{'version': 'v1', 'created': 'Sun, 1 Feb 2015 12:17:12 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Jun 2016 18:28:22 GMT'}]",2016-10-07,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['Boolean register', 'instruction set', 'size-bounded functionalcompleteness', 'instruction sequence size', 'program algebra']"
2074,1905.02990,Giona Casiraghi,"Laurence Brandenberger, Giona Casiraghi, Vahan Nanumyan, Frank
  Schweitzer",Quantifying Triadic Closure in Multi-Edge Social Networks,"19 pages, 5 figures, 6 tables","Proceedings of the 2019 IEEE/ACM International Conference on
  Advances in Social Networks Analysis and Mining (2019) 307-310",10.1145/3341161.3342926,,cs.SI physics.soc-ph stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-edge networks capture repeated interactions between individuals. In
social networks, such edges often form closed triangles, or triads. Standard
approaches to measure this triadic closure, however, fail for multi-edge
networks, because they do not consider that triads can be formed by edges of
different multiplicity. We propose a novel measure of triadic closure for
multi-edge networks of social interactions based on a shared partner statistic.
We demonstrate that our operalization is able to detect meaningful closure in
synthetic and empirical multi-edge networks, where common approaches fail. This
is a cornerstone in driving inferential network analyses from the analysis of
binary networks towards the analyses of multi-edge and weighted networks, which
offer a more realistic representation of social interactions and relations.
","[{'version': 'v1', 'created': 'Wed, 8 May 2019 10:09:21 GMT'}]",2021-02-24,"[['Brandenberger', 'Laurence', ''], ['Casiraghi', 'Giona', ''], ['Nanumyan', 'Vahan', ''], ['Schweitzer', 'Frank', '']]","['multi-edge networks', 'triadic closure', 'network inference', 'social networks', 'statistical learning']"
2075,1403.2914,Mayanka Katyal Miss,Mayanka Katyal and Atul Mishra,"Application of Selective Algorithm for Effective Resource Provisioning
  in Cloud Computing Environment","10 Pages, International Journal on Cloud Computing: Services and
  Architecture (IJCCSA) ,Vol. 4, No. 1, February 2014","International Journal on Cloud Computing: Services and
  Architecture (IJCCSA) ,Vol. 4, No. 1, February 2014",10.5121/ijccsa.2014.4101,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern day continued demand for resource hungry services and applications in
IT sector has led to development of Cloud computing. Cloud computing
environment involves high cost infrastructure on one hand and need high scale
computational resources on the other hand. These resources need to be
provisioned (allocation and scheduling) to the end users in most efficient
manner so that the tremendous capabilities of cloud are utilized effectively
and efficiently. In this paper we discuss a selective algorithm for allocation
of cloud resources to end-users on-demand basis. This algorithm is based on
min-min and max-min algorithms. These are two conventional task scheduling
algorithm. The selective algorithm uses certain heuristics to select between
the two algorithms so that overall makespan of tasks on the machines is
minimized. The tasks are scheduled on machines in either space shared or time
shared manner. We evaluate our provisioning heuristics using a cloud simulator,
called CloudSim. We also compared our approach to the statistics obtained when
provisioning of resources was done in First-Cum-First- Serve(FCFS) manner. The
experimental results show that overall makespan of tasks on given set of VMs
minimizes significantly in different scenarios.
","[{'version': 'v1', 'created': 'Wed, 12 Mar 2014 12:50:04 GMT'}]",2014-03-18,"[['Katyal', 'Mayanka', ''], ['Mishra', 'Atul', '']]","['Resource Provisioning', 'Cloud Computing', 'Makespan', 'Selective Algorithm', 'Min-Min', 'Max-Min']"
2076,1712.08667,Lorenzo Bertizzolo,"Zhangyu Guan, Lorenzo Bertizzolo, Emrecan Demirors, Tommaso Melodia",WNOS: An Optimization-based Wireless Network Operating System,,"Mobihoc '18: Proceedings of the Eighteenth ACM International
  Symposium on Mobile Ad Hoc Networking and Computing June 2018 Pages 241-250",10.1145/3209582.3209607,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article investigates the basic design principles for a new Wireless
Network Operating System (WNOS), a radically different approach to
software-defined networking (SDN) for infrastructure-less wireless networks.
Departing from well-understood approaches inspired by OpenFlow, WNOS provides
the network designer with an abstraction hiding (i) the lower-level details of
the wireless protocol stack and (ii) the distributed nature of the network
operations. Based on this abstract representation, the WNOS takes network
control programs written on a centralized, high-level view of the network and
automatically generates distributed cross-layer control programs based on
distributed optimization theory that are executed by each individual node on an
abstract representation of the radio hardware.
  We first discuss the main architectural principles of WNOS. Then, we discuss
a new approach to generate solution algorithms for each of the resulting
subproblems in an automated fashion. Finally, we illustrate a prototype
implementation of WNOS on software-defined radio devices and test its
effectiveness by considering specific cross-layer control problems.
Experimental results indicate that, based on the automatically generated
distributed control programs, WNOS achieves 18%, 56% and 80.4% utility gain in
networks with low, medium and high levels of interference; maybe more
importantly, we illustrate how the global network behavior can be controlled by
modifying a few lines of code on a centralized abstraction.
","[{'version': 'v1', 'created': 'Fri, 22 Dec 2017 21:47:09 GMT'}]",2021-03-08,"[['Guan', 'Zhangyu', ''], ['Bertizzolo', 'Lorenzo', ''], ['Demirors', 'Emrecan', ''], ['Melodia', 'Tommaso', '']]","['Sofware-defned Networking', 'Distributed Optimization', 'AutomatedControl Program Generation', 'Wireless Ad Hoc Networks']"
2077,1805.04458,Bernadette Spieler,"Helen Boulton and Bernadette Spieler and Anja Petri and Christian
  Schindler and Wolfgang Slany and Maria Beltran","The role of game jams in developing informal learning of computational
  thinking: a cross-european case study","10 pages, 4 figures, 2 tables, EduLearn 2016",EduLearn 2016,10.21125/edulearn.2016,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper will present a cross-European experience of game jams as part of a
Horizon 2020 funded project: No-one Left Behind (NOLB). The NOLB project was
created to unlock inclusive gaming creation and experiences in formal learning
situations from primary to secondary level, particularly for children at risk
of social exclusion. The project has engendered the concept of game jams,
events organised with the aim of designing and creating small games in a short
time-frame around a central theme. Game jams can support engagement with
informal learning beyond schools across a range of disciplines, resulting in an
exciting experience associated with strong, positive emotions which can
significantly support learning goals. This paper will disseminate experience of
two cross-European game jams; the first a pilot and the second having over 95
submissions from countries across Europe, America, Canada, Egypt, the
Philippians and India. Data collected through these games jams supports that
coding, designing, reflection, analysing, creating, debugging, persevering and
application, as well as developing computational thinking concepts such as
decomposition, using patterns, abstraction and evaluation. The notion of game
jams provides a paradigm for creating both formal and informal learning
experiences such as directed learning experience, problem-solving, hands-on
projects, working collaboratively, and creative invention, within a
learner-centred learning environment where children are creators of their own
knowledge and learning material.
","[{'version': 'v1', 'created': 'Fri, 11 May 2018 15:54:00 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Aug 2018 11:16:57 GMT'}]",2018-09-03,"[['Boulton', 'Helen', ''], ['Spieler', 'Bernadette', ''], ['Petri', 'Anja', ''], ['Schindler', 'Christian', ''], ['Slany', 'Wolfgang', ''], ['Beltran', 'Maria', '']]","['Game Jams', 'Pocket Code', 'computational thinking', 'secondary school', 'mobile technology']"
2078,1005.2469,Imran Rao,"Nomica Imran (1), Salman Khan (2) and Imran Rao (3) ((1) Monash
  University, Australia, (2) Kyung Hee University, Korea, (3) The University of
  Melbourne, Australia)","A Trustworthy and well-organized data disseminating scheme for ad-hoc
  wsns","12 Pages, IJCNC 2010","International Journal of Computer Networks & Communications 2.3
  (2010) 170-181",10.5121/ijcnc.2010.2313,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Wireless Sensor Networks (WSNs) generate massive amount of live data and
events sensed through dispersedly deployed tiny sensors. This generated data
needed to be disseminate to the sink with slight consumption of network
resources. One of the ways to efficiently transmit this bulk data is gossiping.
An important consideration in gossip-based dissemination protocols is to keep
routing table up to date. Considering the inherent resource constrained nature
of adhoc wireless sensor networks, we propose a gossip based protocol that
consumes little resources. Our proposed scheme aims to keep the routing table
size R as low as possible yet it ensures that the diameter is small too. We
learned the performance of our proposed protocol through simulations. Results
show that our proposed protocol attains major improvement in network
reachability and connectivity.
","[{'version': 'v1', 'created': 'Fri, 14 May 2010 08:07:50 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Aug 2010 08:26:12 GMT'}]",2010-08-05,"[['Imran', 'Nomica', ''], ['Khan', 'Salman', ''], ['Rao', 'Imran', '']]","['Network Protocols', 'Wireless Network', 'Mobile Network']"
2079,1309.5725,John Tengviel,"John Tengviel, K. Diawuo","Comparing the impact of mobile nodes arrival patterns in mobile ad hoc
  networks using poisson and pareto models","8 pages, 3 figures","International Journal of Wireless & Mobile Networks (IJWMN) Vol.
  5, No. 4, August 2013 International Journal of Wireless & Mobile Networks
  (IJWMN) Vol. 5, No. 4, August 2013",10.5121/ijwmn.2013.5410,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile Ad hoc Networks (MANETs) are dynamic networks populated by mobile
stations, or mobile nodes (MNs). Mobility model is a hot topic in many areas,
for example, protocol evaluation, network performance analysis and so on.How to
simulate MNs mobility is the problem we should consider if we want to build an
accurate mobility model. When new nodes can join and other nodes can leave the
network and therefore the topology is dynamic.Specifically, Mobile Ad hoc
Networks consist of a collection of nodes randomly placed in a line (not
necessarily straight). Mobile Ad hoc Networks do appear in many real-world
network applications such as a vehicular Mobile Ad hoc Networks built along a
highway in a city environment or people in a particular location. Mobile Nodes
in Mobile Ad hoc Networks are usually laptops, Personal Digital Assistants or
mobile phones. This paper presents comparative results that have been carried
out via Matrix lab software simulation. The study investigates the impact of
mobility predictive models on mobile nodes parameters such as, the arrival rate
and the size of mobile nodes in a given area using Pareto and Poisson
distributions. The results have indicated that mobile nodes arrival rates may
have influence on Mobile Nodes population (as a larger number) in a location.
The Pareto distribution is more reflective of the modeling mobility for Mobile
Ad hoc Networks than the Poisson distribution.
","[{'version': 'v1', 'created': 'Mon, 23 Sep 2013 08:17:27 GMT'}]",2013-09-24,"[['Tengviel', 'John', ''], ['Diawuo', 'K.', '']]","['Mobility Models', 'MANETs', 'Mobile Nodes Distribution', 'Arrival Patterns', 'Pareto Distribution', 'Poisson']"
2080,1903.01249,Felix Hamza-Lup,"Felix G. Hamza-Lup, Adrian Seitan, Dorin M. Popovici, Crenguta M.
  Bogdan","Liver Pathology Simulation: Algorithm for Haptic Rendering and Force
  Maps for Palpation Assessment",arXiv admin note: text overlap with arXiv:1812.03325,"Medicine Meets Virtual Reality MMVR, 2013, pp. 175-181",10.3233/978-1-61499-209-7-175,,cs.GR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Preoperative gestures include tactile sampling of the mechanical properties
of biological tissue for both histological and pathological considerations.
Tactile properties used in conjunction with visual cues can provide useful
feedback to the surgeon. Development of novel cost effective haptic-based
simulators and their introduction in the minimally invasive surgery learning
cycle can absorb the learning curve for your residents. Receiving pre-training
in a core set of surgical skills can reduce skill acquisition time and risks.
We present the integration of a real-time surface stiffness adjustment
algorithm and a novel paradigm -- force maps -- in a visuo-haptic simulator
module designed to train internal organs disease diagnostics through palpation.
","[{'version': 'v1', 'created': 'Fri, 1 Mar 2019 18:16:20 GMT'}]",2019-03-12,"[['Hamza-Lup', 'Felix G.', ''], ['Seitan', 'Adrian', ''], ['Popovici', 'Dorin M.', ''], ['Bogdan', 'Crenguta M.', '']]","['haptic rendering', 'simulation', 'laparoscopy', 'liver pathology']"
2081,1003.0146,Lihong Li,"Lihong Li, Wei Chu, John Langford, Robert E. Schapire",A Contextual-Bandit Approach to Personalized News Article Recommendation,"10 pages, 5 figures","Presented at the Nineteenth International Conference on World Wide
  Web (WWW 2010), Raleigh, NC, USA, 2010",10.1145/1772690.1772758,,cs.LG cs.AI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Personalized web services strive to adapt their services (advertisements,
news articles, etc) to individual users by making use of both content and user
information. Despite a few recent advances, this problem remains challenging
for at least two reasons. First, web service is featured with dynamically
changing pools of content, rendering traditional collaborative filtering
methods inapplicable. Second, the scale of most web services of practical
interest calls for solutions that are both fast in learning and computation.
  In this work, we model personalized recommendation of news articles as a
contextual bandit problem, a principled approach in which a learning algorithm
sequentially selects articles to serve users based on contextual information
about the users and articles, while simultaneously adapting its
article-selection strategy based on user-click feedback to maximize total user
clicks.
  The contributions of this work are three-fold. First, we propose a new,
general contextual bandit algorithm that is computationally efficient and well
motivated from learning theory. Second, we argue that any bandit algorithm can
be reliably evaluated offline using previously recorded random traffic.
Finally, using this offline evaluation method, we successfully applied our new
algorithm to a Yahoo! Front Page Today Module dataset containing over 33
million events. Results showed a 12.5% click lift compared to a standard
context-free bandit algorithm, and the advantage becomes even greater when data
gets more scarce.
","[{'version': 'v1', 'created': 'Sun, 28 Feb 2010 02:18:59 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Mar 2012 23:49:42 GMT'}]",2012-03-05,"[['Li', 'Lihong', ''], ['Chu', 'Wei', ''], ['Langford', 'John', ''], ['Schapire', 'Robert E.', '']]","['Contextual bandit', 'web service', 'personalization', 'recommender systems', 'exploration/exploitation dilemma']"
2082,1507.04831,Yongtao Hu,"Yongtao Hu, Jimmy Ren, Jingwen Dai, Chang Yuan, Li Xu, and Wenping
  Wang",Deep Multimodal Speaker Naming,,,10.1145/2733373.2806293,,cs.CV cs.LG cs.MM cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic speaker naming is the problem of localizing as well as identifying
each speaking character in a TV/movie/live show video. This is a challenging
problem mainly attributes to its multimodal nature, namely face cue alone is
insufficient to achieve good performance. Previous multimodal approaches to
this problem usually process the data of different modalities individually and
merge them using handcrafted heuristics. Such approaches work well for simple
scenes, but fail to achieve high performance for speakers with large appearance
variations. In this paper, we propose a novel convolutional neural networks
(CNN) based learning framework to automatically learn the fusion function of
both face and audio cues. We show that without using face tracking, facial
landmark localization or subtitle/transcript, our system with robust multimodal
feature extraction is able to achieve state-of-the-art speaker naming
performance evaluated on two diverse TV series. The dataset and implementation
of our algorithm are publicly available online.
","[{'version': 'v1', 'created': 'Fri, 17 Jul 2015 04:13:12 GMT'}]",2015-07-20,"[['Hu', 'Yongtao', ''], ['Ren', 'Jimmy', ''], ['Dai', 'Jingwen', ''], ['Yuan', 'Chang', ''], ['Xu', 'Li', ''], ['Wang', 'Wenping', '']]","['Speaker Naming', 'Multimodal', 'CNN', 'Deep Learning']"
2083,1309.2081,Pedro Neto,"Nuno Mendes, Pedro Neto, Norberto Pires, Altino Loureiro",Discretization and fitting of nominal data for autonomous robots,Expert Systems with Applications,"Expert Systems with Applications, Volume 40, Issue 4, March 2013,
  Pages 1143-1151",10.1016/j.eswa.2012.08.023,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents methodologies to discretize nominal robot paths extracted
from 3-D CAD drawings. Behind robot path discretization is the ability to have
a robot adjusting the traversed paths so that the contact between robot tool
and work-piece is properly maintained. In addition, a hybrid force/motion
control system based on Fuzzy-PI control is proposed to adjust robot paths with
external sensory feedback. All these capabilities allow to facilitate the robot
programming process and to increase the robots autonomy.
","[{'version': 'v1', 'created': 'Mon, 9 Sep 2013 09:27:10 GMT'}]",2013-09-10,"[['Mendes', 'Nuno', ''], ['Neto', 'Pedro', ''], ['Pires', 'Norberto', ''], ['Loureiro', 'Altino', '']]","['Autonomous robots', 'Fuzzy logic', 'PI control', 'Discretization', 'Off-line programming', 'Robotics']"
2084,1603.07030,Octavio Zapata,"Anuj Dawar, Simone Severini, Octavio Zapata",Descriptive complexity of graph spectra,17 pages,"Logic, Language, Information, and Computation: 23rd International
  Workshop, WoLLIC 2016, Puebla, Mexico, August 16-19th, 2016",10.1007/978-3-662-52921-8_12,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two graphs are co-spectral if their respective adjacency matrices have the
same multi-set of eigenvalues. A graph is said to be determined by its spectrum
if all graphs that are co-spectral with it are isomorphic to it. We consider
these properties in relation to logical definability. We show that any pair of
graphs that are elementarily equivalent with respect to the three-variable
counting first-order logic $C^3$ are co-spectral, and this is not the case with
$C^2$, nor with any number of variables if we exclude counting quantifiers. We
also show that the class of graphs that are determined by their spectra is
definable in partial fixed-point logic with counting. We relate these
properties to other algebraic and combinatorial problems.
","[{'version': 'v1', 'created': 'Tue, 22 Mar 2016 23:45:34 GMT'}, {'version': 'v2', 'created': 'Wed, 25 May 2016 13:56:39 GMT'}, {'version': 'v3', 'created': 'Wed, 1 Jun 2016 13:01:52 GMT'}, {'version': 'v4', 'created': 'Fri, 24 Jun 2016 14:41:54 GMT'}, {'version': 'v5', 'created': 'Wed, 14 Sep 2016 19:45:16 GMT'}]",2016-09-15,"[['Dawar', 'Anuj', ''], ['Severini', 'Simone', ''], ['Zapata', 'Octavio', '']]","['descriptive complexity', 'algebraic graph theory', 'isomorphismapproximations']"
2085,1604.00206,Cornelius Diekmann,"Cornelius Diekmann, Lars Hupel, Georg Carle",Semantics-Preserving Simplification of Real-World Firewall Rule Sets,"In 20th International Symposium on Formal Methods, June 2015","FM 2015: Formal Methods Volume 9109 of the series Lecture Notes in
  Computer Science pp 195-212, Springer",10.1007/978-3-319-19249-9_13,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The security provided by a firewall for a computer network almost completely
depends on the rules it enforces. For over a decade, it has been a well-known
and unsolved problem that the quality of many firewall rule sets is
insufficient. Therefore, there are many tools to analyze them. However, we
found that none of the available tools could handle typical, real-world
iptables rulesets. This is due to the complex chain model used by iptables, but
also to the vast amount of possible match conditions that occur in real-world
firewalls, many of which are not understood by academic and open source tools.
  In this paper, we provide algorithms to transform firewall rulesets. We
reduce the execution model to a simple list model and use ternary logic to
abstract over all unknown match conditions. These transformations enable
existing tools to understand real-world firewall rules, which we demonstrate on
four decently-sized rulesets. %After preparation with our algorithms, tools
could understand them. Using the Isabelle theorem prover, we formally show that
all our algorithms preserve the firewall's filtering behavior.
","[{'version': 'v1', 'created': 'Fri, 1 Apr 2016 11:37:26 GMT'}]",2016-04-06,"[['Diekmann', 'Cornelius', ''], ['Hupel', 'Lars', ''], ['Carle', 'Georg', '']]","['Computer Networks', 'Firewalls', 'Isabelle', 'Netfilter Iptables', 'Semantics']"
2086,2004.00438,Lucas Baier,"Lucas Baier (1), Marcel Hofmann (2), Niklas K\""uhl (1), Marisa Mohr (2
  and 3) and Gerhard Satzger (1) ((1) Karlsruhe Institute of Technology,
  Karlsruhe, Germany, (2) inovex GmbH, Karlsruhe, Germany (3) University of
  L\""ubeck, L\""ubeck, Germany)","Handling Concept Drifts in Regression Problems -- the Error Intersection
  Approach",,,10.30844/wi_2020_c1-baier,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning models are omnipresent for predictions on big data. One
challenge of deployed models is the change of the data over time, a phenomenon
called concept drift. If not handled correctly, a concept drift can lead to
significant mispredictions. We explore a novel approach for concept drift
handling, which depicts a strategy to switch between the application of simple
and complex machine learning models for regression tasks. We assume that the
approach plays out the individual strengths of each model, switching to the
simpler model if a drift occurs and switching back to the complex model for
typical situations. We instantiate the approach on a real-world data set of
taxi demand in New York City, which is prone to multiple drifts, e.g. the
weather phenomena of blizzards, resulting in a sudden decrease of taxi demand.
We are able to show that our suggested approach outperforms all regarded
baselines significantly.
","[{'version': 'v1', 'created': 'Wed, 1 Apr 2020 13:30:05 GMT'}]",2020-04-02,"[['Baier', 'Lucas', '', '2\n  and 3'], ['Hofmann', 'Marcel', '', '2\n  and 3'], ['Kühl', 'Niklas', '', '2\n  and 3'], ['Mohr', 'Marisa', '', '2\n  and 3'], ['Satzger', 'Gerhard', '']]","['Machine learning', 'Concept drift', 'Demand Prediction']"
2087,1310.3473,Rohit Jha,"Rohit Jha, Alfy Samuel, Ashmee Pawar, M. Kiruthika",A Domain-Specific Language for Discrete Mathematics,,"International Journal of Computer Applications 70(15):6-19, May
  2013",10.5120/12036-7257,,cs.PL cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses a Domain Specific Language (DSL) that has been developed
to enable implementation of concepts of discrete mathematics. A library of data
types and functions provides functionality which is frequently required by
users. Covering the areas of Mathematical Logic, Set Theory, Functions, Graph
Theory, Number Theory, Linear Algebra and Combinatorics, the language's syntax
is close to the actual notation used in the specific fields.
","[{'version': 'v1', 'created': 'Sun, 13 Oct 2013 12:28:54 GMT'}]",2013-10-15,"[['Jha', 'Rohit', ''], ['Samuel', 'Alfy', ''], ['Pawar', 'Ashmee', ''], ['Kiruthika', 'M.', '']]","['Domain-Specific Language', 'Glasgow Haskell Compiler', 'Haskell', 'Preprocessor']"
2088,2102.07289,Alasdair Tran,"Alasdair Tran, Alexander Mathews, Cheng Soon Ong, Lexing Xie","Radflow: A Recurrent, Aggregated, and Decomposable Model for Networks of
  Time Series","Published in The Web Conference 2021. Code is available at
  https://github.com/alasdairtran/radflow",Proceedings of The Web Conference 2021 (WWW '21),10.1145/3442381.3449945,,cs.SI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  We propose a new model for networks of time series that influence each other.
Graph structures among time series are found in diverse domains, such as web
traffic influenced by hyperlinks, product sales influenced by recommendation,
or urban transport volume influenced by road networks and weather. There has
been recent progress in graph modeling and in time series forecasting,
respectively, but an expressive and scalable approach for a network of series
does not yet exist. We introduce Radflow, a novel model that embodies three key
ideas: a recurrent neural network to obtain node embeddings that depend on
time, the aggregation of the flow of influence from neighboring nodes with
multi-head attention, and the multi-layer decomposition of time series. Radflow
naturally takes into account dynamic networks where nodes and edges change over
time, and it can be used for prediction and data imputation tasks. On
real-world datasets ranging from a few hundred to a few hundred thousand nodes,
we observe that Radflow variants are the best performing model across a wide
range of settings. The recurrent component in Radflow also outperforms N-BEATS,
the state-of-the-art time series model. We show that Radflow can learn
different trends and seasonal patterns, that it is robust to missing nodes and
edges, and that correlated temporal patterns among network neighbors reflect
influence strength. We curate WikiTraffic, the largest dynamic network of time
series with 366K nodes and 22M time-dependent links spanning five years. This
dataset provides an open benchmark for developing models in this area, with
applications that include optimizing resources for the web. More broadly,
Radflow has the potential to improve forecasts in correlated time series
networks such as the stock market, and impute missing measurements in
geographically dispersed networks of natural phenomena.
","[{'version': 'v1', 'created': 'Mon, 15 Feb 2021 00:57:28 GMT'}]",2021-02-16,"[['Tran', 'Alasdair', ''], ['Mathews', 'Alexander', ''], ['Ong', 'Cheng Soon', ''], ['Xie', 'Lexing', '']]","['time series', 'networks', 'graphs', 'sequence models', 'wikipedia']"
2089,1706.06279,Jintao Ke,"Jintao Ke, Hongyu Zheng, Hai Yang, Xiqun (Michael) Chen","Short-Term Forecasting of Passenger Demand under On-Demand Ride
  Services: A Spatio-Temporal Deep Learning Approach","39 pages, 10 figures","Transportation Research Part C: Emerging Technologies, Volume 85,
  Pages 591-608, 2017",10.1016/j.trc.2017.10.016,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Short-term passenger demand forecasting is of great importance to the
on-demand ride service platform, which can incentivize vacant cars moving from
over-supply regions to over-demand regions. The spatial dependences, temporal
dependences, and exogenous dependences need to be considered simultaneously,
however, which makes short-term passenger demand forecasting challenging. We
propose a novel deep learning (DL) approach, named the fusion convolutional
long short-term memory network (FCL-Net), to address these three dependences
within one end-to-end learning architecture. The model is stacked and fused by
multiple convolutional long short-term memory (LSTM) layers, standard LSTM
layers, and convolutional layers. The fusion of convolutional techniques and
the LSTM network enables the proposed DL approach to better capture the
spatio-temporal characteristics and correlations of explanatory variables. A
tailored spatially aggregated random forest is employed to rank the importance
of the explanatory variables. The ranking is then used for feature selection.
The proposed DL approach is applied to the short-term forecasting of passenger
demand under an on-demand ride service platform in Hangzhou, China.
Experimental results, validated on real-world data provided by DiDi Chuxing,
show that the FCL-Net achieves better predictive performance than traditional
approaches including both classical time-series prediction models and neural
network based algorithms (e.g., artificial neural network and LSTM). This paper
is one of the first DL studies to forecast the short-term passenger demand of
an on-demand ride service platform by examining the spatio-temporal
correlations.
","[{'version': 'v1', 'created': 'Tue, 20 Jun 2017 06:07:20 GMT'}]",2018-02-13,"[['Ke', 'Jintao', '', 'Michael'], ['Zheng', 'Hongyu', '', 'Michael'], ['Yang', 'Hai', '', 'Michael'], ['Xiqun', '', '', 'Michael'], ['Chen', '', '']]","['On-demand ride services', 'short-term demand forecasting', 'deep']"
2090,1505.03008,Lovro \v{S}ubelj,"Dalibor Fiala, Lovro \v{S}ubelj, Slavko \v{Z}itnik, Marko Bajec",Do PageRank-based author rankings outperform simple citation counts?,"28 pages, 5 figures, 6 tables","J. Infometr. 9(2), 334-348 (2015)",10.1016/j.joi.2015.02.008,,cs.DL cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The basic indicators of a researcher's productivity and impact are still the
number of publications and their citation counts. These metrics are clear,
straightforward, and easy to obtain. When a ranking of scholars is needed, for
instance in grant, award, or promotion procedures, their use is the fastest and
cheapest way of prioritizing some scientists over others. However, due to their
nature, there is a danger of oversimplifying scientific achievements.
Therefore, many other indicators have been proposed including the usage of the
PageRank algorithm known for the ranking of webpages and its modifications
suited to citation networks. Nevertheless, this recursive method is
computationally expensive and even if it has the advantage of favouring
prestige over popularity, its application should be well justified,
particularly when compared to the standard citation counts. In this study, we
analyze three large datasets of computer science papers in the categories of
artificial intelligence, software engineering, and theory and methods and apply
12 different ranking methods to the citation networks of authors. We compare
the resulting rankings with self-compiled lists of outstanding researchers
selected as frequent editorial board members of prestigious journals in the
field and conclude that there is no evidence of PageRank-based methods
outperforming simple citation counts.
","[{'version': 'v1', 'created': 'Tue, 12 May 2015 13:59:30 GMT'}]",2015-05-13,"[['Fiala', 'Dalibor', ''], ['Šubelj', 'Lovro', ''], ['Žitnik', 'Slavko', ''], ['Bajec', 'Marko', '']]","['PageRank', 'scholars', 'citations', 'rankings', 'importance']"
2091,1906.05029,Pieter Robberechts,"Pieter Robberechts, Jan Van Haaren and Jesse Davis",A Bayesian Approach to In-Game Win Probability in Soccer,,"In Proceedings of the 27th ACM SIGKDD Conference on Knowledge
  Discovery & Data Mining (2021) 3512-3521",10.1145/3447548.3467194,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In-game win probability models, which provide a sports team's likelihood of
winning at each point in a game based on historical observations, are becoming
increasingly popular. In baseball, basketball and American football, they have
become important tools to enhance fan experience, to evaluate in-game
decision-making, and to inform coaching decisions. While equally relevant in
soccer, the adoption of these models is held back by technical challenges
arising from the low-scoring nature of the sport.
  In this paper, we introduce an in-game win probability model for soccer that
addresses the shortcomings of existing models. First, we demonstrate that
in-game win probability models for other sports struggle to provide accurate
estimates for soccer, especially towards the end of a game. Second, we
introduce a novel Bayesian statistical framework that estimates running win,
tie and loss probabilities by leveraging a set of contextual game state
features. An empirical evaluation on eight seasons of data for the top-five
soccer leagues demonstrates that our framework provides well-calibrated
probabilities. Furthermore, two use cases show its ability to enhance fan
experience and to evaluate performance in crucial game situations.
","[{'version': 'v1', 'created': 'Wed, 12 Jun 2019 09:38:07 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Aug 2021 08:56:58 GMT'}]",2021-08-16,"[['Robberechts', 'Pieter', ''], ['Van Haaren', 'Jan', ''], ['Davis', 'Jesse', '']]","['Win probability', 'Soccer', 'Bayesian learning', 'Sports analytics']"
2092,1304.2050,Andrew Adamatzky,"Andrew Adamatzky, Rachel Armstrong, Jeff Jones, Yukio-Pegio Gunji",On Creativity of Slime Mould,,"International Journal of General Systems 42 (2013) 5, 441-457",10.1080/03081079.2013.776206,,cs.ET nlin.AO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Slime mould Physarum polycephalum is large single cell with intriguingly
smart behaviour. The slime mould shows outstanding abilities to adapt its
protoplasmic network to varying environmental conditions. The slime mould can
solve tasks of computational geometry, image processing, logics and arithmetics
when data are represented by configurations of attractants and repellents. We
attempt to map behavioural patterns of slime onto the cognitive control versus
schizotypy spectrum phase space and thus interpret slime mould's activity in
terms of creativity.
","[{'version': 'v1', 'created': 'Sun, 7 Apr 2013 19:41:00 GMT'}]",2013-04-09,"[['Adamatzky', 'Andrew', ''], ['Armstrong', 'Rachel', ''], ['Jones', 'Jeff', ''], ['Gunji', 'Yukio-Pegio', '']]","['creativity', 'slime mould', 'unconventional computing', 'biological intelligence']"
2093,1808.08213,Arquimedes Canedo,"Jiang Wan, Blake S. Pollard, Sujit Rokka Chhetri, Palash Goyal,
  Mohammad Abdullah Al Faruque, Arquimedes Canedo","Future Automation Engineering using Structural Graph Convolutional
  Neural Networks",ICCAD 2018,,10.1145/3240765.3243477,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The digitalization of automation engineering generates large quantities of
engineering data that is interlinked in knowledge graphs. Classifying and
clustering subgraphs according to their functionality is useful to discover
functionally equivalent engineering artifacts that exhibit different graph
structures. This paper presents a new graph learning algorithm designed to
classify engineering data artifacts -- represented in the form of graphs --
according to their structure and neighborhood features. Our Structural Graph
Convolutional Neural Network (SGCNN) is capable of learning graphs and
subgraphs with a novel graph invariant convolution kernel and
downsampling/pooling algorithm. On a realistic engineering-related dataset, we
show that SGCNN is capable of achieving ~91% classification accuracy.
","[{'version': 'v1', 'created': 'Fri, 24 Aug 2018 17:07:05 GMT'}]",2018-08-27,"[['Wan', 'Jiang', ''], ['Pollard', 'Blake S.', ''], ['Chhetri', 'Sujit Rokka', ''], ['Goyal', 'Palash', ''], ['Faruque', 'Mohammad Abdullah Al', ''], ['Canedo', 'Arquimedes', '']]","['Engineering', 'Knowledge Graphs', 'Graph Learning', 'Graph Convolutional Neural Networks']"
2094,1811.03814,Jianbo Gao,"Jianbo Gao, Han Liu, Chao Liu, Qingshan Li, Zhi Guan, Zhong Chen",EASYFLOW: Keep Ethereum Away From Overflow,"Proceedings of the 41st International Conference on Software
  Engineering: Companion Proceedings. IEEE Press, 2019",,10.1109/ICSE-Companion.2019.00029,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While Ethereum smart contracts enabled a wide range of blockchain
applications, they are extremely vulnerable to different forms of security
attacks. Due to the fact that transactions to smart contracts commonly involve
cryptocurrency transfer, any successful attacks can lead to money loss or even
financial disorder. In this paper, we focus on the overflow attacks in Ethereum
, mainly because they widely rooted in many smart contracts and comparatively
easy to exploit. We have developed EASYFLOW , an overflow detector at Ethereum
Virtual Machine level. The key insight behind EASYFLOW is a taint analysis
based tracking technique to analyze the propagation of involved taints.
Specifically, EASYFLOW can not only divide smart contracts into safe contracts,
manifested overflows, well-protected overflows and potential overflows, but
also automatically generate transactions to trigger potential overflows. In our
preliminary evaluation, EASYFLOW managed to find potentially vulnerable
Ethereum contracts with little runtime overhead.
","[{'version': 'v1', 'created': 'Fri, 9 Nov 2018 08:27:37 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Jun 2019 11:53:45 GMT'}]",2019-06-12,"[['Gao', 'Jianbo', ''], ['Liu', 'Han', ''], ['Liu', 'Chao', ''], ['Li', 'Qingshan', ''], ['Guan', 'Zhi', ''], ['Chen', 'Zhong', '']]","['Ethereum', 'Overflow Vulnerability', 'Taint Analysis', 'Smart Contract']"
2095,1706.06716,Chanyoung Park,"Chanyoung Park, Donghyun Kim, Min-Chul Yang, Jung-Tae Lee, Hwanjo Yu",Click-aware purchase prediction with push at the top,"For the final published journal version, see
  https://doi.org/10.1016/j.ins.2020.02.062",Information Sciences 521 (2020): 350-364,10.1016/j.ins.2020.02.062,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Eliciting user preferences from purchase records for performing purchase
prediction is challenging because negative feedback is not explicitly observed,
and because treating all non-purchased items equally as negative feedback is
unrealistic. Therefore, in this study, we present a framework that leverages
the past click records of users to compensate for the missing user-item
interactions of purchase records, i.e., non-purchased items. We begin by
formulating various model assumptions, each one assuming a different order of
user preferences among purchased, clicked-but-not-purchased, and non-clicked
items, to study the usefulness of leveraging click records. We implement the
model assumptions using the Bayesian personalized ranking model, which
maximizes the area under the curve for bipartite ranking. However, we argue
that using click records for bipartite ranking needs a meticulously designed
model because of the relative unreliableness of click records compared with
that of purchase records. Therefore, we ultimately propose a novel
learning-to-rank method, called P3Stop, for performing purchase prediction. The
proposed model is customized to be robust to relatively unreliable click
records by particularly focusing on the accuracy of top-ranked items.
Experimental results on two real-world e-commerce datasets demonstrate that
P3STop considerably outperforms the state-of-the-art implicit-feedback-based
recommendation methods, especially for top-ranked items.
","[{'version': 'v1', 'created': 'Wed, 21 Jun 2017 01:22:57 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Jun 2017 07:09:39 GMT'}, {'version': 'v3', 'created': 'Fri, 29 May 2020 02:41:18 GMT'}]",2020-06-01,"[['Park', 'Chanyoung', ''], ['Kim', 'Donghyun', ''], ['Yang', 'Min-Chul', ''], ['Lee', 'Jung-Tae', ''], ['Yu', 'Hwanjo', '']]","['Learning-to-Rank', 'Matrix Factorization', 'E-Commerce', 'Purchase']"
2096,1511.05202,Sean Welleck,Sean J. Welleck,Efficient AUC Optimization for Information Ranking Applications,12 pages,"ECIR 2016, LNCS 9626, pp.159-170, 2016",10.1007/978-3-319-30671-1_12,,cs.IR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Adequate evaluation of an information retrieval system to estimate future
performance is a crucial task. Area under the ROC curve (AUC) is widely used to
evaluate the generalization of a retrieval system. However, the objective
function optimized in many retrieval systems is the error rate and not the AUC
value. This paper provides an efficient and effective non-linear approach to
optimize AUC using additive regression trees, with a special emphasis on the
use of multi-class AUC (MAUC) because multiple relevance levels are widely used
in many ranking applications. Compared to a conventional linear approach, the
performance of the non-linear approach is comparable on binary-relevance
benchmark datasets and is better on multi-relevance benchmark datasets.
","[{'version': 'v1', 'created': 'Mon, 16 Nov 2015 22:12:00 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Nov 2015 21:28:00 GMT'}, {'version': 'v3', 'created': 'Sat, 23 Apr 2016 23:42:09 GMT'}]",2016-04-26,"[['Welleck', 'Sean J.', '']]","['machine learning', 'learning to rank', 'evaluation']"
2097,1311.3829,Sofia Benbelkacem,"Sofia Benbelkacem, Baghdad Atmani, Mohamed Benamina",Planning based on classification by induction graph,"International Conference on Data Mining & Knowledge Management
  Process CDKP-2013",,10.5121/csit.2013.3823,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Artificial Intelligence, planning refers to an area of research that
proposes to develop systems that can automatically generate a result set, in
the form of an integrated decision-making system through a formal procedure,
known as plan. Instead of resorting to the scheduling algorithms to generate
plans, it is proposed to operate the automatic learning by decision tree to
optimize time. In this paper, we propose to build a classification model by
induction graph from a learning sample containing plans that have an associated
set of descriptors whose values change depending on each plan. This model will
then operate for classifying new cases by assigning the appropriate plan.
","[{'version': 'v1', 'created': 'Fri, 15 Nov 2013 12:43:56 GMT'}]",2013-11-20,"[['Benbelkacem', 'Sofia', ''], ['Atmani', 'Baghdad', ''], ['Benamina', 'Mohamed', '']]","['Bloksworld', 'Classification', 'Data Mining', 'Decision Tree', 'Planning', 'Induction Graph', 'Symbolic Induction']"
2098,1004.5230,Florent Foucaud,"Florent Foucaud (LaBRI), Eleonora Guerrini (IF), Matjaz Kovse (LaBRI),
  Reza Naserasr (LaBRI), Aline Parreau (IF), Petru Valicov (LaBRI)",Extremal graphs for the identifying code problem,,"European Journal of Combinatorics 32, 4 (2011) 628-638",10.1016/j.ejc.2011.01.002,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An identifying code of a graph G is a dominating set C such that every vertex
x of G is distinguished from all other vertices by the set of vertices in C
that are at distance at most 1 from x. The problem of finding an identifying
code of minimum possible size turned out to be a challenging problem. It was
proved by N. Bertrand that if a graph on n vertices with at least one edge
admits an identifying code, then a minimum identifying code has size at most
n-1. Some classes of graphs whose smallest identifying code is of size n-1 were
already known, and few conjectures were formulated to classify all these
graphs. In this paper, disproving these conjectures, we classify all finite
graphs for which all but one of the vertices are needed to form an identifying
code. We also classify all infinite graphs needing the whole set of vertices in
any identifying code. New upper bounds in terms of the number of vertices and
the maximum degree of a graph are also provided.
","[{'version': 'v1', 'created': 'Thu, 29 Apr 2010 09:32:28 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Oct 2010 14:08:37 GMT'}, {'version': 'v3', 'created': 'Tue, 25 Jan 2011 15:25:51 GMT'}, {'version': 'v4', 'created': 'Thu, 24 Feb 2011 09:05:36 GMT'}]",2011-02-25,"[['Foucaud', 'Florent', '', 'LaBRI'], ['Guerrini', 'Eleonora', '', 'IF'], ['Kovse', 'Matjaz', '', 'LaBRI'], ['Naserasr', 'Reza', '', 'LaBRI'], ['Parreau', 'Aline', '', 'IF'], ['Valicov', 'Petru', '', 'LaBRI']]","['Identifying codes', 'Dominating sets', 'Infinite graphs']"
2099,1807.07165,Kevin Moran P,"Kevin Moran, Carlos Bernal Cardenas, Mario Linares Vasquez, Denys
  Poshyvanyk","Overcoming Language Dichotomies: Toward Effective Program Comprehension
  for Mobile App Development","Invited Keynote Paper for the 26th IEEE/ACM International Conference
  on Program Comprehension (ICPC'18)",,10.1145/3196321.3196322,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile devices and platforms have become an established target for modern
software developers due to performant hardware and a large and growing user
base numbering in the billions. Despite their popularity, the software
development process for mobile apps comes with a set of unique, domain-specific
challenges rooted in program comprehension. Many of these challenges stem from
developer difficulties in reasoning about different representations of a
program, a phenomenon we define as a ""language dichotomy"". In this paper, we
reflect upon the various language dichotomies that contribute to open problems
in program comprehension and development for mobile apps. Furthermore, to help
guide the research community towards effective solutions for these problems, we
provide a roadmap of directions for future work.
","[{'version': 'v1', 'created': 'Wed, 18 Jul 2018 21:34:47 GMT'}]",2018-07-20,"[['Moran', 'Kevin', ''], ['Cardenas', 'Carlos Bernal', ''], ['Vasquez', 'Mario Linares', ''], ['Poshyvanyk', 'Denys', '']]","['Program Comprehension', 'Mobile', 'Android', 'Natural Language', 'Code']"
2100,1412.8704,Diederik Aerts,"Diederik Aerts, Sandro Sozzo and Tomas Veloz",Quantum Structure in Cognition and the Foundations of Human Reasoning,"11 pages, no figures","International Journal of Theoretical Physics, 54, pp 4557-4569,
  2015",10.1007/s10773-015-2717-9,,cs.AI quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional cognitive science rests on a foundation of classical logic and
probability theory. This foundation has been seriously challenged by several
findings in experimental psychology on human decision making. Meanwhile, the
formalism of quantum theory has provided an efficient resource for modeling
these classically problematical situations. In this paper, we start from our
successful quantum-theoretic approach to the modeling of concept combinations
to formulate a unifying explanatory hypothesis. In it, human reasoning is the
superposition of two processes -- a conceptual reasoning, whose nature is
emergence of new conceptuality, and a logical reasoning, founded on an
algebraic calculus of the logical type. In most cognitive processes however,
the former reasoning prevails over the latter. In this perspective, the
observed deviations from classical logical reasoning should not be interpreted
as biases but, rather, as natural expressions of emergence in its deepest form.
","[{'version': 'v1', 'created': 'Tue, 30 Dec 2014 17:51:16 GMT'}]",2015-12-31,"[['Aerts', 'Diederik', ''], ['Sozzo', 'Sandro', ''], ['Veloz', 'Tomas', '']]","['Quantum cognition', 'Quantum modeling', 'Logic', 'Emergence', 'Human reasoning']"
2101,2102.04674,Yanhao Zhang,"Yanhao Zhang, Pan Pan, Yun Zheng, Kang Zhao, Yingya Zhang, Xiaofeng
  Ren, Rong Jin",Visual Search at Alibaba,accepted by KDD 2018,KDD 2018: 993-1001,10.1145/3219819.3219820,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces the large scale visual search algorithm and system
infrastructure at Alibaba. The following challenges are discussed under the
E-commercial circumstance at Alibaba (a) how to handle heterogeneous image data
and bridge the gap between real-shot images from user query and the online
images. (b) how to deal with large scale indexing for massive updating data.
(c) how to train deep models for effective feature representation without huge
human annotations. (d) how to improve the user engagement by considering the
quality of the content. We take advantage of large image collection of Alibaba
and state-of-the-art deep learning techniques to perform visual search at
scale. We present solutions and implementation details to overcome those
problems and also share our learnings from building such a large scale
commercial visual search engine. Specifically, model and search-based fusion
approach is introduced to effectively predict categories. Also, we propose a
deep CNN model for joint detection and feature learning by mining user click
behavior. The binary index engine is designed to scale up indexing without
compromising recall and precision. Finally, we apply all the stages into an
end-to-end system architecture, which can simultaneously achieve highly
efficient and scalable performance adapting to real-shot images. Extensive
experiments demonstrate the advancement of each module in our system. We hope
visual search at Alibaba becomes more widely incorporated into today's
commercial applications.
","[{'version': 'v1', 'created': 'Tue, 9 Feb 2021 06:46:50 GMT'}]",2021-02-10,"[['Zhang', 'Yanhao', ''], ['Pan', 'Pan', ''], ['Zheng', 'Yun', ''], ['Zhao', 'Kang', ''], ['Zhang', 'Yingya', ''], ['Ren', 'Xiaofeng', ''], ['Jin', 'Rong', '']]","['Visual Search', 'Deep Learning', 'Detection and Recognition']"
2102,1708.06586,Tomaso Aste,Noemi Nava and T. Di Matteo and Tomaso Aste,"Dynamic correlations at different time-scales with Empirical Mode
  Decomposition","19 pages, 11 figures",,10.1016/j.physa.2018.02.108,,cs.CE q-fin.CP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Empirical Mode Decomposition (EMD) provides a tool to characterize time
series in terms of its implicit components oscillating at different
time-scales. We apply this decomposition to intraday time series of the
following three financial indices: the S\&P 500 (USA), the IPC (Mexico) and the
VIX (volatility index USA), obtaining time-varying multidimensional
cross-correlations at different time-scales. The correlations computed over a
rolling window are compared across the three indices, across the components at
different time-scales, at different lags and over time. We uncover a rich
heterogeneity of interactions which depends on the time-scale and has important
led-lag relations which can have practical use for portfolio management, risk
estimation and investments.
","[{'version': 'v1', 'created': 'Tue, 22 Aug 2017 12:48:12 GMT'}]",2018-04-04,"[['Nava', 'Noemi', ''], ['Di Matteo', 'T.', ''], ['Aste', 'Tomaso', '']]","['Time-scale-dependent correlation', 'time-dependent correlation', 'empirical mode decomposition']"
2103,1004.2735,P\'eter    L. Erd\H{o}s,P\'eter L. Erd\H{o}s and Lajos Soukup and Jens Stoye,"Balanced Vertices in Trees and a Simpler Algorithm to Compute the
  Genomic Distance","6 pages, submitted",,10.1016/j.aml.2010.08.021,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper provides a short and transparent solution for the covering cost of
white-grey trees which play a crucial role in the algorithm of Bergeron {\it et
al.}\ to compute the rearrangement distance between two multichromosomal
genomes in linear time ({\it Theor. Comput. Sci.}, 410:5300-5316, 2009). In the
process it introduces a new {\em center} notion for trees, which seems to be
interesting on its own.
","[{'version': 'v1', 'created': 'Thu, 15 Apr 2010 23:44:18 GMT'}]",2021-01-01,"[['Erdős', 'Péter L.', ''], ['Soukup', 'Lajos', ''], ['Stoye', 'Jens', '']]","['comparative genomics', 'genome rearrangement', 'combinatorics on trees']"
2104,cs/0304002,Paul M. Aoki,"Paul M. Aoki, Matthew Romaine, Margaret H. Szymanski, James D.
  Thornton, Daniel Wilson, Allison Woodruff","The Mad Hatter&acute;s Cocktail Party: A Social Mobile Audio Space
  Supporting Multiple Simultaneous Conversations",8 pages,"Proc. ACM SIGCHI Conf. on Human Factors in Computing Systems, Ft.
  Lauderdale, FL, Apr. 2003, 425-432. ACM Press.",10.1145/642611.642686,,cs.HC cs.SD,,"  This paper presents a mobile audio space intended for use by gelled social
groups. In face-to-face interactions in such social groups, conversational
floors change frequently, e.g., two participants split off to form a new
conversational floor, a participant moves from one conversational floor to
another, etc. To date, audio spaces have provided little support for such
dynamic regroupings of participants, either requiring that the participants
explicitly specify with whom they wish to talk or simply presenting all
participants as though they are in a single floor. By contrast, the audio space
described here monitors participant behavior to identify conversational floors
as they emerge. The system dynamically modifies the audio delivered to each
participant to enhance the salience of the participants with whom they are
currently conversing. We report a user study of the system, focusing on
conversation analytic results.
","[{'version': 'v1', 'created': 'Tue, 1 Apr 2003 05:15:05 GMT'}]",2007-05-23,"[['Aoki', 'Paul M.', ''], ['Romaine', 'Matthew', ''], ['Szymanski', 'Margaret H.', ''], ['Thornton', 'James D.', ''], ['Wilson', 'Daniel', ''], ['Woodruff', 'Allison', '']]","['Audio space', 'floor management', 'conversation analysis']"
2105,1807.00468,Sakshi Udeshi,"Sakshi Udeshi, Pryanshu Arora, Sudipta Chattopadhyay",Automated Directed Fairness Testing,"In Proceedings of the 2018 33rd ACM/IEEE International Conference on
  Automated Software Engineering (ASE 18), September 3-7, 2018, Montpellier,
  France","Automated Directed Fairness Testing. In Proceedings of the 2018
  33rd ACM/IEEE International Conference on Automated Software Engineering (ASE
  18), September 3-7, 2018, Montpellier, France",10.1145/3238147.3238165,,cs.LG cs.AI cs.SE stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Fairness is a critical trait in decision making. As machine-learning models
are increasingly being used in sensitive application domains (e.g. education
and employment) for decision making, it is crucial that the decisions computed
by such models are free of unintended bias. But how can we automatically
validate the fairness of arbitrary machine-learning models? For a given
machine-learning model and a set of sensitive input parameters, our AEQUITAS
approach automatically discovers discriminatory inputs that highlight fairness
violation. At the core of AEQUITAS are three novel strategies to employ
probabilistic search over the input space with the objective of uncovering
fairness violation. Our AEQUITAS approach leverages inherent robustness
property in common machine-learning models to design and implement scalable
test generation methodologies. An appealing feature of our generated test
inputs is that they can be systematically added to the training set of the
underlying model and improve its fairness. To this end, we design a fully
automated module that guarantees to improve the fairness of the underlying
model.
  We implemented AEQUITAS and we have evaluated it on six state-of-the-art
classifiers, including a classifier that was designed with fairness
constraints. We show that AEQUITAS effectively generates inputs to uncover
fairness violation in all the subject classifiers and systematically improves
the fairness of the respective models using the generated test inputs. In our
evaluation, AEQUITAS generates up to 70% discriminatory inputs (w.r.t. the
total number of inputs generated) and leverages these inputs to improve the
fairness up to 94%.
","[{'version': 'v1', 'created': 'Mon, 2 Jul 2018 05:29:57 GMT'}, {'version': 'v2', 'created': 'Tue, 31 Jul 2018 12:08:59 GMT'}]",2018-08-02,"[['Udeshi', 'Sakshi', ''], ['Arora', 'Pryanshu', ''], ['Chattopadhyay', 'Sudipta', '']]","['Software Fairness', 'Directed Testing', 'Machine Learning']"
2106,1001.3090,Dayu Huang,"Dayu Huang, Sean Meyn","Feature Extraction for Universal Hypothesis Testing via Rank-constrained
  Optimization","5 pages, 4 figures, submitted to ISIT 2010",,10.1109/ISIT.2010.5513384,,cs.IT cs.LG math.IT math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper concerns the construction of tests for universal hypothesis
testing problems, in which the alternate hypothesis is poorly modeled and the
observation space is large. The mismatched universal test is a feature-based
technique for this purpose. In prior work it is shown that its
finite-observation performance can be much better than the (optimal) Hoeffding
test, and good performance depends crucially on the choice of features. The
contributions of this paper include: 1) We obtain bounds on the number of
\epsilon distinguishable distributions in an exponential family. 2) This
motivates a new framework for feature extraction, cast as a rank-constrained
optimization problem. 3) We obtain a gradient-based algorithm to solve the
rank-constrained optimization problem and prove its local convergence.
","[{'version': 'v1', 'created': 'Mon, 18 Jan 2010 17:07:03 GMT'}, {'version': 'v2', 'created': 'Sun, 13 Jun 2010 19:18:47 GMT'}]",2016-04-18,"[['Huang', 'Dayu', ''], ['Meyn', 'Sean', '']]","['Universal test', 'mismatched universal test', 'hypothesistesting', 'feature extraction', 'exponential family']"
2107,1303.0210,Aysajan Abidin,Aysajan Abidin and Jan-{\AA}ke Larsson,"Direct Proof of Security of Wegman-Carter Authentication with Partially
  Known Key",15 pages,"Quantum Information Processing, 13, 2155-2170, 2014",10.1007/s11128-013-0641-6,,cs.CR quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information-theoretically secure (ITS) authentication is needed in Quantum
Key Distribution (QKD). In this paper, we study security of an ITS
authentication scheme proposed by Wegman & Carter, in the case of partially
known authentication key. This scheme uses a new authentication key in each
authentication attempt, to select a hash function from an Almost Strongly
Universal$_2$ hash function family. The partial knowledge of the attacker is
measured as the trace distance between the authentication key distribution and
the uniform distribution; this is the usual measure in QKD. We provide direct
proofs of security of the scheme, when using partially known key, first in the
information-theoretic setting and then in terms of witness indistinguishability
as used in the Universal Composability (UC) framework. We find that if the
authentication procedure has a failure probability $\epsilon$ and the
authentication key has an $\epsilon'$ trace distance to the uniform, then under
ITS, the adversary's success probability conditioned on an authentic
message-tag pair is only bounded by $\epsilon+|\mT|\epsilon'$, where $|\mT|$ is
the size of the set of tags. Furthermore, the trace distance between the
authentication key distribution and the uniform increases to $|\mT|\epsilon'$
after having seen an authentic message-tag pair. Despite this, we are able to
prove directly that the authenticated channel is indistinguishable from an
(ideal) authentic channel (the desired functionality), except with probability
less than $\epsilon+\epsilon'$. This proves that the scheme is
($\epsilon+\epsilon'$)-UC-secure, without using the composability theorem.
","[{'version': 'v1', 'created': 'Fri, 1 Mar 2013 16:19:31 GMT'}]",2014-09-25,"[['Abidin', 'Aysajan', ''], ['Larsson', 'Jan-Åke', '']]","['Authentication', 'Strongly Universal hash functions', 'Partially known key', 'Trace distance', 'Universal Composability', 'Quantum Key Distribution']"
2108,1007.3249,Laurent Hubert,"Laurent Hubert (INRIA - IRISA), David Pichardie (INRIA - IRISA)","Soundly Handling Static Fields: Issues, Semantics and Analysis","Proceedings of the Fourth Workshop on Bytecode Semantics,
  Verification, Analysis and Transformation (BYTECODE 2009)","Electronic Notes in Theoretical Computer Science 253, 5 (2009) 15
  - 30",10.1016/j.entcs.2009.11.012,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although in most cases class initialization works as expected, some static
fields may be read before being initialized, despite being initialized in their
corresponding class initializer. We propose an analysis which compute, for each
program point, the set of static fields that must have been initialized and
discuss its soundness. We show that such an analysis can be directly applied to
identify the static fields that may be read before being initialized and to
improve the precision while preserving the soundness of a null-pointer
analysis.
","[{'version': 'v1', 'created': 'Mon, 19 Jul 2010 19:45:02 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Jul 2010 10:01:57 GMT'}]",2010-07-21,"[['Hubert', 'Laurent', '', 'INRIA - IRISA'], ['Pichardie', 'David', '', 'INRIA - IRISA']]","['static analysis', 'Java', 'semantics', 'class initialization', 'control flow', 'verification']"
2109,2003.07959,Jianan Yao,"Jianan Yao, Gabriel Ryan, Justin Wong, Suman Jana, Ronghui Gu","Learning Nonlinear Loop Invariants with Gated Continuous Logic Networks
  (Extended Version)",,"In Proceedings of the 41st ACM SIGPLAN Conference on Programming
  Language Design and Implementation, pp. 106-120. 2020",10.1145/3385412.3385986,,cs.SE cs.LG cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Verifying real-world programs often requires inferring loop invariants with
nonlinear constraints. This is especially true in programs that perform many
numerical operations, such as control systems for avionics or industrial
plants. Recently, data-driven methods for loop invariant inference have shown
promise, especially on linear invariants. However, applying data-driven
inference to nonlinear loop invariants is challenging due to the large numbers
of and magnitudes of high-order terms, the potential for overfitting on a small
number of samples, and the large space of possible inequality bounds.
  In this paper, we introduce a new neural architecture for general SMT
learning, the Gated Continuous Logic Network (G-CLN), and apply it to nonlinear
loop invariant learning. G-CLNs extend the Continuous Logic Network (CLN)
architecture with gating units and dropout, which allow the model to robustly
learn general invariants over large numbers of terms. To address overfitting
that arises from finite program sampling, we introduce fractional sampling---a
sound relaxation of loop semantics to continuous functions that facilitates
unbounded sampling on real domain. We additionally design a new CLN activation
function, the Piecewise Biased Quadratic Unit (PBQU), for naturally learning
tight inequality bounds.
  We incorporate these methods into a nonlinear loop invariant inference system
that can learn general nonlinear loop invariants. We evaluate our system on a
benchmark of nonlinear loop invariants and show it solves 26 out of 27
problems, 3 more than prior work, with an average runtime of 53.3 seconds. We
further demonstrate the generic learning ability of G-CLNs by solving all 124
problems in the linear Code2Inv benchmark. We also perform a quantitative
stability evaluation and show G-CLNs have a convergence rate of $97.5\%$ on
quadratic problems, a $39.2\%$ improvement over CLN models.
","[{'version': 'v1', 'created': 'Tue, 17 Mar 2020 21:44:37 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Mar 2020 22:32:57 GMT'}, {'version': 'v3', 'created': 'Fri, 10 Apr 2020 16:50:31 GMT'}, {'version': 'v4', 'created': 'Thu, 25 Jun 2020 16:43:51 GMT'}]",2020-11-03,"[['Yao', 'Jianan', ''], ['Ryan', 'Gabriel', ''], ['Wong', 'Justin', ''], ['Jana', 'Suman', ''], ['Gu', 'Ronghui', '']]","['Loop Invariant Inference', 'Program Verification', 'Continuous Logic Networks']"
2110,1612.01556,Daniel Graziotin,"Mika Viking M\""antyl\""a, Daniel Graziotin, Miikka Kuutila","The Evolution of Sentiment Analysis - A Review of Research Topics,
  Venues, and Top Cited Papers","29 pages, 14 figures","Computer Science Review, Volume 27, February 2018, Pages 16-32",10.1016/j.cosrev.2017.10.002,,cs.CL cs.DL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sentiment analysis is one of the fastest growing research areas in computer
science, making it challenging to keep track of all the activities in the area.
We present a computer-assisted literature review, where we utilize both text
mining and qualitative coding, and analyze 6,996 papers from Scopus. We find
that the roots of sentiment analysis are in the studies on public opinion
analysis at the beginning of 20th century and in the text subjectivity analysis
performed by the computational linguistics community in 1990's. However, the
outbreak of computer-based sentiment analysis only occurred with the
availability of subjective texts on the Web. Consequently, 99% of the papers
have been published after 2004. Sentiment analysis papers are scattered to
multiple publication venues, and the combined number of papers in the top-15
venues only represent ca. 30% of the papers in total. We present the top-20
cited papers from Google Scholar and Scopus and a taxonomy of research topics.
In recent years, sentiment analysis has shifted from analyzing online product
reviews to social media texts from Twitter and Facebook. Many topics beyond
product reviews like stock markets, elections, disasters, medicine, software
engineering and cyberbullying extend the utilization of sentiment analysis
","[{'version': 'v1', 'created': 'Mon, 5 Dec 2016 21:28:06 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Mar 2017 18:09:41 GMT'}, {'version': 'v3', 'created': 'Tue, 14 Nov 2017 10:40:58 GMT'}, {'version': 'v4', 'created': 'Tue, 21 Nov 2017 08:16:59 GMT'}]",2017-11-22,"[['Mäntylä', 'Mika Viking', ''], ['Graziotin', 'Daniel', ''], ['Kuutila', 'Miikka', '']]","['sentiment analysis', 'opinion mining', 'bibliometric study', 'text mining', 'literature review', 'topic modelling', 'latent dirichlet allocation', 'qualitative analysis']"
2111,0906.1225,Michael Goodrich,Michael T. Goodrich,Pipelined Algorithms to Detect Cheating in Long-Term Grid Computations,Expanded version with an additional figure; ISSN 0304-3975,"Theoretical Computer Science, Volume 408, Issues 2-3, Excursions
  in Algorithmics: A Collection of Papers in Honor of Franco P. Preparata, 28
  November 2008, Pages 199-207",10.1016/j.tcs.2008.08.008,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies pipelined algorithms for protecting distributed grid
computations from cheating participants, who wish to be rewarded for tasks they
receive but don't perform. We present improved cheater detection algorithms
that utilize natural delays that exist in long-term grid computations. In
particular, we partition the sequence of grid tasks into two interleaved
sequences of task rounds, and we show how to use those rounds to devise the
first general-purpose scheme that can catch all cheaters, even when cheaters
collude. The main idea of this algorithm might at first seem
counter-intuitive--we have the participants check each other's work. A naive
implementation of this approach would, of course, be susceptible to collusion
attacks, but we show that by, adapting efficient solutions to the parallel
processor diagnosis problem, we can tolerate collusions of lazy cheaters, even
if the number of such cheaters is a fraction of the total number of
participants. We also include a simple economic analysis of cheaters in grid
computations and a parameterization of the main deterrent that can be used
against them--the probability of being caught.
","[{'version': 'v1', 'created': 'Fri, 5 Jun 2009 22:29:34 GMT'}]",2009-06-09,"[['Goodrich', 'Michael T.', '']]","['Grid computing', 'pipelined algorithms', 'parallel algorithms', 'security']"
2112,1501.05612,Arnaud Martin,"Anthony Fiche, Jean-Christophe Cexus, Arnaud Martin (IRISA), Ali
  Khenchaf","Features modeling with an $\alpha$-stable distribution: Application to
  pattern recognition based on continuous belief functions",,"Information Fusion, Elsevier, 2013, 14, pp.504 - 520",10.1016/j.inffus.2013.02.004,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of this paper is to show the interest in fitting features with an
$\alpha$-stable distribution to classify imperfect data. The supervised pattern
recognition is thus based on the theory of continuous belief functions, which
is a way to consider imprecision and uncertainty of data. The distributions of
features are supposed to be unimodal and estimated by a single Gaussian and
$\alpha$-stable model. Experimental results are first obtained from synthetic
data by combining two features of one dimension and by considering a vector of
two features. Mass functions are calculated from plausibility functions by
using the generalized Bayes theorem. The same study is applied to the automatic
classification of three types of sea floor (rock, silt and sand) with features
acquired by a mono-beam echo-sounder. We evaluate the quality of the
$\alpha$-stable model and the Gaussian model by analyzing qualitative results,
using a Kolmogorov-Smirnov test (K-S test), and quantitative results with
classification rates. The performances of the belief classifier are compared
with a Bayesian approach.
","[{'version': 'v1', 'created': 'Thu, 22 Jan 2015 19:55:58 GMT'}]",2015-01-23,"[['Fiche', 'Anthony', '', 'IRISA'], ['Cexus', 'Jean-Christophe', '', 'IRISA'], ['Martin', 'Arnaud', '', 'IRISA'], ['Khenchaf', 'Ali', '']]","['Gaussian and α-stable model', 'unimodal features', 'continuous belief functions', 'supervised patternrecognition', 'Kolmogorov-Smirnov test', 'Bayesian approach']"
2113,1711.06840,Eli (Omid) David,"Eli David, H. Jaap van den Herik, Moshe Koppel, Nathan S. Netanyahu","Simulating Human Grandmasters: Evolution and Coevolution of Evaluation
  Functions","arXiv admin note: substantial text overlap with arXiv:1711.06839,
  arXiv:1711.06841","ACM Genetic and Evolutionary Computation Conference (GECCO), pages
  1483-1489, Montreal, Canada, July 2009",10.1145/1569901.1570100,,cs.NE cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper demonstrates the use of genetic algorithms for evolving a
grandmaster-level evaluation function for a chess program. This is achieved by
combining supervised and unsupervised learning. In the supervised learning
phase the organisms are evolved to mimic the behavior of human grandmasters,
and in the unsupervised learning phase these evolved organisms are further
improved upon by means of coevolution.
  While past attempts succeeded in creating a grandmaster-level program by
mimicking the behavior of existing computer chess programs, this paper presents
the first successful attempt at evolving a state-of-the-art evaluation function
by learning only from databases of games played by humans. Our results
demonstrate that the evolved program outperforms a two-time World Computer
Chess Champion.
","[{'version': 'v1', 'created': 'Sat, 18 Nov 2017 10:16:24 GMT'}]",2017-11-21,"[['David', 'Eli', ''], ['Herik', 'H. Jaap van den', ''], ['Koppel', 'Moshe', ''], ['Netanyahu', 'Nathan S.', '']]","['Computer chess', 'Fitness evaluation', 'Games', 'Genetic algorithms', 'Parameter tuning']"
2114,1007.3706,Dusan Jakovetic,"Dusan Jakovetic, Joao Xavier, and Jose M. F. Moura","Cooperative Convex Optimization in Networked Systems: Augmented
  Lagrangian Algorithms with Directed Gossip Communication","28 pages, journal; revised",,10.1109/TSP.2011.2146776,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study distributed optimization in networked systems, where nodes cooperate
to find the optimal quantity of common interest, x=x^\star. The objective
function of the corresponding optimization problem is the sum of private (known
only by a node,) convex, nodes' objectives and each node imposes a private
convex constraint on the allowed values of x. We solve this problem for generic
connected network topologies with asymmetric random link failures with a novel
distributed, decentralized algorithm. We refer to this algorithm as AL-G
(augmented Lagrangian gossiping,) and to its variants as AL-MG (augmented
Lagrangian multi neighbor gossiping) and AL-BG (augmented Lagrangian broadcast
gossiping.) The AL-G algorithm is based on the augmented Lagrangian dual
function. Dual variables are updated by the standard method of multipliers, at
a slow time scale. To update the primal variables, we propose a novel,
Gauss-Seidel type, randomized algorithm, at a fast time scale. AL-G uses
unidirectional gossip communication, only between immediate neighbors in the
network and is resilient to random link failures. For networks with reliable
communication (i.e., no failures,) the simplified, AL-BG (augmented Lagrangian
broadcast gossiping) algorithm reduces communication, computation and data
storage cost. We prove convergence for all proposed algorithms and demonstrate
by simulations the effectiveness on two applications: l_1-regularized logistic
regression for classification and cooperative spectrum sensing for cognitive
radio networks.
","[{'version': 'v1', 'created': 'Wed, 21 Jul 2010 18:25:33 GMT'}, {'version': 'v2', 'created': 'Sun, 6 Feb 2011 02:09:10 GMT'}]",2015-05-19,"[['Jakovetic', 'Dusan', ''], ['Xavier', 'Joao', ''], ['Moura', 'Jose M. F.', '']]","['Distributed algorithm', 'convex optimization', 'augmented Lagrangian', 'gossip communication']"
2115,1305.0359,Mauro Femminella,"M. Femminella, G. Reali, D. Valocchi, R. Francescangeli, H.
  Schulzrinne",Advanced Caching for Distributing Sensor Data through Programmable Nodes,Accepted for publication in IEEE LANMAN 2013,,10.1109/LANMAN.2013.6528285,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper shows an innovative solution for distributing dynamic sensor data
by using distributed caches. Our proposal is based on the concepts of service
modularization and virtualization of network nodes made available by the
NetServ hosting environment, which has been defined and implemented with the
aim of extending the functions of the network nodes. Through a lab experiment
involving tens of nodes, we have demonstrated a significant performance
improvements in term of traffic saving and download time in comparison with a
legacy, Internet-based, approach. Beyond this performance improvements, the
proposed solution holds also functional improvements, in terms of dynamic
deployment and easy integration with services making use of sensor data.
","[{'version': 'v1', 'created': 'Thu, 2 May 2013 07:35:19 GMT'}]",2016-11-18,"[['Femminella', 'M.', ''], ['Reali', 'G.', ''], ['Valocchi', 'D.', ''], ['Francescangeli', 'R.', ''], ['Schulzrinne', 'H.', '']]","['sensor network', 'content distribution', 'NetServ', 'performance evaluation']"
2116,2105.02568,Francesco Busolin,"Francesco Busolin, Claudio Lucchese, Franco Maria Nardini, Salvatore
  Orlando, Raffaele Perego, Salvatore Trani",Learning Early Exit Strategies for Additive Ranking Ensembles,"5 pages, 3 figures, ACM SIGIR Conference on Research and Development
  in Information Retrieval (SIGIR 21)","44th International ACM SIGIR Conference on Research and
  Development in Information Retrieval, Association for Computing Machinery,
  2021, 2217-2221",10.1145/3404835.346,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Modern search engine ranking pipelines are commonly based on large
machine-learned ensembles of regression trees. We propose LEAR, a novel -
learned - technique aimed to reduce the average number of trees traversed by
documents to accumulate the scores, thus reducing the overall query response
time. LEAR exploits a classifier that predicts whether a document can early
exit the ensemble because it is unlikely to be ranked among the final top-k
results. The early exit decision occurs at a sentinel point, i.e., after having
evaluated a limited number of trees, and the partial scores are exploited to
filter out non-promising documents. We evaluate LEAR by deploying it in a
production-like setting, adopting a state-of-the-art algorithm for ensembles
traversal. We provide a comprehensive experimental evaluation on two public
datasets. The experiments show that LEAR has a significant impact on the
efficiency of the query processing without hindering its ranking quality. In
detail, on a first dataset, LEAR is able to achieve a speedup of 3x without any
loss in NDCG1@0, while on a second dataset the speedup is larger than 5x with a
negligible NDCG@10 loss (< 0.05%).
","[{'version': 'v1', 'created': 'Thu, 6 May 2021 10:25:50 GMT'}]",2021-09-17,"[['Busolin', 'Francesco', ''], ['Lucchese', 'Claudio', ''], ['Nardini', 'Franco Maria', ''], ['Orlando', 'Salvatore', ''], ['Perego', 'Raffaele', ''], ['Trani', 'Salvatore', '']]","['Learning to Rank', 'Early Exiting', 'Efficiency/Effectiveness Trade-offs']"
2117,2105.09908,Filip Biljecki,"Wangyang Chen, Abraham Noah Wu, Filip Biljecki","Classification of Urban Morphology with Deep Learning: Application on
  Urban Vitality",,"Computers, Environment and Urban Systems (2021) 90: 101706",10.1016/j.compenvurbsys.2021.101706,,cs.CV cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a prevailing trend to study urban morphology quantitatively thanks
to the growing accessibility to various forms of spatial big data, increasing
computing power, and use cases benefiting from such information. The methods
developed up to now measure urban morphology with numerical indices describing
density, proportion, and mixture, but they do not directly represent
morphological features from the human's visual and intuitive perspective. We
take the first step to bridge the gap by proposing a deep learning-based
technique to automatically classify road networks into four classes on a visual
basis. The method is implemented by generating an image of the street network
(Colored Road Hierarchy Diagram), which we introduce in this paper, and
classifying it using a deep convolutional neural network (ResNet-34). The model
achieves an overall classification accuracy of 0.875. Nine cities around the
world are selected as the study areas with their road networks acquired from
OpenStreetMap. Latent subgroups among the cities are uncovered through
clustering on the percentage of each road network category. In the subsequent
part of the paper, we focus on the usability of such classification: we apply
our method in a case study of urban vitality prediction. An advanced tree-based
regression model (LightGBM) is for the first time designated to establish the
relationship between morphological indices and vitality indicators. The effect
of road network classification is found to be small but positively associated
with urban vitality. This work expands the toolkit of quantitative urban
morphology study with new techniques, supporting further studies in the future.
","[{'version': 'v1', 'created': 'Fri, 7 May 2021 08:53:31 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Jul 2021 13:48:38 GMT'}, {'version': 'v3', 'created': 'Sat, 21 Aug 2021 02:05:58 GMT'}]",2021-08-24,"[['Chen', 'Wangyang', ''], ['Wu', 'Abraham Noah', ''], ['Biljecki', 'Filip', '']]","['Urban form', 'Computer vision', 'GIScience', 'Urban vibrancy', 'Street network', 'Urban analytics']"
2118,1611.02072,Benjamin Unger,"Philipp Schulze, Benjamin Unger, Christopher Beattie, Serkan Gugercin",Data-driven Structured Realization,,"Linear Algebra and its Applications, Volume 537, 15 January 2018,
  Pages 250-286",10.1016/j.laa.2017.09.030,Preprint 31-2016,cs.SY math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a framework for constructing structured realizations of linear
dynamical systems having transfer functions of the form $C(\sum_{k=1}^K
h_k(s)A_k)^{-1}B$ where $h_1,h_2,\ldots,h_K$ are prescribed functions that
specify the surmised structure of the model. Our construction is data-driven in
the sense that an interpolant is derived entirely from measurements of a
transfer function. Our approach extends the Loewner realization framework to
more general system structure that includes second-order (and higher) systems
as well as systems with internal delays. Numerical examples demonstrate the
advantages of this approach.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2016 14:37:43 GMT'}]",2018-01-30,"[['Schulze', 'Philipp', ''], ['Unger', 'Benjamin', ''], ['Beattie', 'Christopher', ''], ['Gugercin', 'Serkan', '']]","['structured realization', 'data-driven model reduction', 'interpolation', 'delaysystem', 'second-order system']"
2119,1612.08686,Jesus Bonilla,"Santiago Badia, Jes\'us Bonilla, Alba Hierro","Differentiable monotonicity-preserving schemes for discontinuous
  Galerkin methods on arbitrary meshes",,,10.1016/j.cma.2017.03.032,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work is devoted to the design of interior penalty discontinuous Galerkin
(dG) schemes that preserve maximum principles at the discrete level for the
steady transport and convection-diffusion problems and the respective transient
problems with implicit time integration. Monotonic schemes that combine
explicit time stepping with dG space discretization are very common, but the
design of such schemes for implicit time stepping is rare, and it had only been
attained so far for 1D problems. The proposed scheme is based on an artificial
diffusion that linearly depends on a shock detector that identifies the
troublesome areas. In order to define the new shock detector, we have
introduced the concept of discrete local extrema. The diffusion operator is a
graph-Laplacian, instead of the more common finite element discretization of
the Laplacian operator, which is essential to keep monotonicity on general
meshes and in multi-dimension. The resulting nonlinear stabilization is
non-smooth and nonlinear solvers can fail to converge. As a result, we propose
a smoothed (twice differentiable) version of the nonlinear stabilization, which
allows us to use Newton with line search nonlinear solvers and dramatically
improve nonlinear convergence. A theoretical numerical analysis of the proposed
schemes show that they satisfy the desired monotonicity properties. Further,
the resulting operator is Lipschitz continuous and there exists at least one
solution of the discrete problem, even in the non-smooth version. We provide a
set of numerical results to support our findings.
","[{'version': 'v1', 'created': 'Tue, 27 Dec 2016 17:17:53 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Dec 2018 14:14:47 GMT'}]",2018-12-14,"[['Badia', 'Santiago', ''], ['Bonilla', 'Jesús', ''], ['Hierro', 'Alba', '']]","['Finite elements', 'discrete maximum principle', 'monotonicity', 'shock capturing', 'discontinuous Galerkin', 'local extrema diminishing']"
2120,1811.03045,Oscar Luis Vera P\'erez,"Oscar Luis Vera-P\'erez, Martin Monperrus, Benoit Baudry","Descartes: A PITest Engine to Detect Pseudo-Tested Methods - Tool
  Demonstration",,"ACM/IEEE International Conference on Automated Software
  Engineering, Tool demonstration track, 2018",10.1145/3238147.3240474,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Descartes is a tool that implements extreme mutation operators and aims at
finding pseudo-tested methods in Java projects. It leverages the efficient
transformation and runtime features of PIT. The demonstration compares
Descartes with Gregor, the default mutation engine provided by PIT, in a set of
real open source projects. It considers the execution time, number of mutants
created and the relationship between the mutation scores produced by both
engines. It provides some insights on the main features exposed by Descartes.
","[{'version': 'v1', 'created': 'Wed, 7 Nov 2018 18:00:58 GMT'}]",2019-03-11,"[['Vera-Pérez', 'Oscar Luis', ''], ['Monperrus', 'Martin', ''], ['Baudry', 'Benoit', '']]","['pseudo-tested methods', 'extreme mutation', 'mutation testing', 'sofware testing', 'PITest']"
2121,1810.07132,Wei Dai,"Wei Dai, Kenji Yoshigoe, William Parsley",Improving Data Quality through Deep Learning and Statistical Models,"8 pages, 6 figures, and 3 tables","Dai, Wei, Kenji Yoshigoe, and William Parsley. ""Improving Data
  Quality Through Deep Learning and Statistical Models."" In Information
  Technology-New Generations, pp. 515-522. Springer, Cham, 2018",10.1007/978-3-319-54978-1_66,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional data quality control methods are based on users experience or
previously established business rules, and this limits performance in addition
to being a very time consuming process with lower than desirable accuracy.
Utilizing deep learning, we can leverage computing resources and advanced
techniques to overcome these challenges and provide greater value to users. In
this paper, we, the authors, first review relevant works and discuss machine
learning techniques, tools, and statistical quality models. Second, we offer a
creative data quality framework based on deep learning and statistical model
algorithm for identifying data quality. Third, we use data involving salary
levels from an open dataset published by the state of Arkansas to demonstrate
how to identify outlier data and how to improve data quality via deep learning.
Finally, we discuss future work.
","[{'version': 'v1', 'created': 'Tue, 16 Oct 2018 16:57:07 GMT'}]",2018-10-17,"[['Dai', 'Wei', ''], ['Yoshigoe', 'Kenji', ''], ['Parsley', 'William', '']]","['data quality', 'data clean', 'deep learning', 'statistical quality control', 'data profiling  1']"
2122,1907.07757,Fan Yang,"Fan Yang, Shiva K. Pentyala, Sina Mohseni, Mengnan Du, Hao Yuan, Rhema
  Linder, Eric D. Ragan, Shuiwang Ji, Xia Hu",XFake: Explainable Fake News Detector with Visualizations,"4 pages, WebConf'2019 Demo",,10.1145/3308558.3314119,,cs.CY cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this demo paper, we present the XFake system, an explainable fake news
detector that assists end-users to identify news credibility. To effectively
detect and interpret the fakeness of news items, we jointly consider both
attributes (e.g., speaker) and statements. Specifically, MIMIC, ATTN and PERT
frameworks are designed, where MIMIC is built for attribute analysis, ATTN is
for statement semantic analysis and PERT is for statement linguistic analysis.
Beyond the explanations extracted from the designed frameworks, relevant
supporting examples as well as visualization are further provided to facilitate
the interpretation. Our implemented system is demonstrated on a real-world
dataset crawled from PolitiFact, where thousands of verified political news
have been collected.
","[{'version': 'v1', 'created': 'Mon, 8 Jul 2019 18:29:58 GMT'}]",2019-07-19,"[['Yang', 'Fan', ''], ['Pentyala', 'Shiva K.', ''], ['Mohseni', 'Sina', ''], ['Du', 'Mengnan', ''], ['Yuan', 'Hao', ''], ['Linder', 'Rhema', ''], ['Ragan', 'Eric D.', ''], ['Ji', 'Shuiwang', ''], ['Hu', 'Xia', '']]","['Fake news detection', 'explainable models', 'system visualization']"
2123,1904.00182,Joe Alexandersen,"Nicolo Pollini and Ole Sigmund and Casper Schousboe Andreasen and Joe
  Alexandersen","A ""poor man's"" approach for high-resolution three-dimensional topology
  optimization of natural convection problems",,"Advances in Engineering Software, Volume 140, February 2020,
  102736",10.1016/j.advengsoft.2019.102736,,cs.CE cs.DC math.OC physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper treats topology optimization of natural convection problems. A
simplified model is suggested to describe the flow of an incompressible fluid
in steady state conditions, similar to Darcy's law for fluid flow in porous
media. The equations for the fluid flow are coupled to the thermal
convection-diffusion equation through the Boussinesq approximation. The coupled
non-linear system of equations is discretized with stabilized finite elements
and solved in a parallel framework that allows for the optimization of high
resolution three-dimensional problems. A density-based topology optimization
approach is used, where a two-material interpolation scheme is applied to both
the permeability and conductivity of the distributed material. Due to the
simplified model, the proposed methodology allows for a significant reduction
of the computational effort required in the optimization. At the same time, it
is significantly more accurate than even simpler models that rely on convection
boundary conditions based on Newton's law of cooling. The methodology discussed
herein is applied to the optimization-based design of three-dimensional heat
sinks. The final designs are formally compared with results of previous work
obtained from solving the full set of Navier-Stokes equations. The results are
compared in terms of performance of the optimized designs and computational
cost. The computational time is shown to be decreased to around 5-20% in terms
of core-hours, allowing for the possibility of generating an optimized design
during the workday on a small computational cluster and overnight on a high-end
desktop.
","[{'version': 'v1', 'created': 'Sat, 30 Mar 2019 09:41:13 GMT'}]",2019-12-02,"[['Pollini', 'Nicolo', ''], ['Sigmund', 'Ole', ''], ['Andreasen', 'Casper Schousboe', ''], ['Alexandersen', 'Joe', '']]","['topology optimization', 'conjugate heat transfer', 'naturalconvection', 'high performance computing', 'simplified model']"
2124,1208.2334,Arindam Sarkar,Arindam Sarkar and J. K. Mandal,"Multilayer Perceptron Guided Key Generation Through Mutation with
  Recursive Replacement in Wireless Communication (MLPKG)",18 pages,"International Journal on AdHoc Networking Systems (IJANS) Vol. 2,
  No. 3, July 2012, 11-28",10.5121/ijans.2012.2302,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a multilayer perceptron guided key generation for
encryption/decryption (MLPKG) has been proposed through recursive replacement
using mutated character code generation for wireless communication of
data/information. Multilayer perceptron transmitting systems at both ends
accept an identical input vector, generate an output bit and the network are
trained based on the output bit which is used to form a protected variable
length secret-key. For each session, different hidden layer of multilayer
neural network is selected randomly and weights or hidden units of this
selected hidden layer help to form a secret session key. The plain text is
encrypted using mutated character code table. Intermediate cipher text is yet
again encrypted through recursive replacement technique to from next
intermediate encrypted text which is again encrypted to form the final cipher
text through chaining, cascaded xoring of multilayer perceptron generated
session key. If size of the final block of intermediate cipher text is less
than the size of the key then this block is kept unaltered. Receiver will use
identical multilayer perceptron generated session key for performing
deciphering process for getting the recursive replacement encrypted cipher text
and then mutated character code table is used for decoding. Parametric tests
have been done and results are compared in terms of Chi-Square test, response
time in transmission with some existing classical techniques, which shows
comparable results for the proposed technique.
","[{'version': 'v1', 'created': 'Sat, 11 Aug 2012 09:53:15 GMT'}]",2012-08-14,"[['Sarkar', 'Arindam', ''], ['Mandal', 'J. K.', '']]","['Multilayer Perceptron', 'Session Key', 'Encryption', 'Mutated Character Code', 'Wireless Communication']"
2125,1310.1191,Krzysztof Bana\'s,"Krzysztof Bana\'s and Przemys{\l}aw P{\l}aszewski and Pawe{\l}
  Macio{\l}",Numerical integration on GPUs for higher order finite elements,,"Computers and Mathematics with Applications, Volume 67, Issue 6,
  April 2014, Pages 1319-1344",10.1016/j.camwa.2014.01.021,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper considers the problem of implementation on graphics processors of
numerical integration routines for higher order finite element approximations.
The design of suitable GPU kernels is investigated in the context of general
purpose integration procedures, as well as particular example applications. The
most important characteristic of the problem investigated is the large
variation of required processor and memory resources associated with different
degrees of approximating polynomials. The questions that we try to answer are
whether it is possible to design a single integration kernel for different GPUs
and different orders of approximation and what performance can be expected in
such a case.
","[{'version': 'v1', 'created': 'Fri, 4 Oct 2013 07:50:02 GMT'}]",2014-03-03,"[['Banaś', 'Krzysztof', ''], ['Płaszewski', 'Przemysław', ''], ['Macioł', 'Paweł', '']]","['finite element method', 'higher order approximation', 'numericalintegration', 'graphics processors', 'GPU', 'OpenCL']"
2126,2003.12779,Haoyu Ma,"Juncheng Zhang, Qingmin Liao, Shaojun Liu, Haoyu Ma, Wenming Yang,
  Jing-Hao Xue",Real-MFF: A Large Realistic Multi-focus Image Dataset with Ground Truth,,,10.1016/j.patrec.2020.08.002,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-focus image fusion, a technique to generate an all-in-focus image from
two or more partially-focused source images, can benefit many computer vision
tasks. However, currently there is no large and realistic dataset to perform
convincing evaluation and comparison of algorithms in multi-focus image fusion.
Moreover, it is difficult to train a deep neural network for multi-focus image
fusion without a suitable dataset. In this letter, we introduce a large and
realistic multi-focus dataset called Real-MFF, which contains 710 pairs of
source images with corresponding ground truth images. The dataset is generated
by light field images, and both the source images and the ground truth images
are realistic. To serve as both a well-established benchmark for existing
multi-focus image fusion algorithms and an appropriate training dataset for
future development of deep-learning-based methods, the dataset contains a
variety of scenes, including buildings, plants, humans, shopping malls, squares
and so on. We also evaluate 10 typical multi-focus algorithms on this dataset
for the purpose of illustration.
","[{'version': 'v1', 'created': 'Sat, 28 Mar 2020 12:33:46 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Jul 2020 03:31:32 GMT'}, {'version': 'v3', 'created': 'Fri, 28 Aug 2020 11:25:18 GMT'}]",2020-08-31,"[['Zhang', 'Juncheng', ''], ['Liao', 'Qingmin', ''], ['Liu', 'Shaojun', ''], ['Ma', 'Haoyu', ''], ['Yang', 'Wenming', ''], ['Xue', 'Jing-Hao', '']]","['Image fusion', 'multi-focus images', 'multi-focus dataset', 'deep learning']"
2127,1901.03535,Savio Sciancalepore,"Savio Sciancalepore, Omar Adel Ibrahim, Gabriele Oligeri, Roberto Di
  Pietro","PiNcH: an Effective, Efficient, and Robust Solution to Drone Detection
  via Network Traffic Analysis",,"Computer Networks (COMNET), Elsevier, 2020",10.1016/j.comnet.2019.107044,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose PiNcH, a methodology to detect the presence of a drone, its
current status, and its movements by leveraging just the communication traffic
exchanged between the drone and its Remote Controller (RC). PiNcH is built
applying standard classification algorithms to the eavesdropped traffic,
analyzing features such as packets inter-arrival time and size. PiNcH is fully
passive and it requires just cheap and general-purpose hardware. To evaluate
the effectiveness of our solution, we collected real communication traces
originated by a drone running the widespread ArduCopter open-source firmware,
currently mounted on-board of a wide range (30+) of commercial amateur drones.
We tested our solution against different publicly available wireless traces.
The results prove that PiNcH can efficiently and effectively: (i) identify the
presence of the drone in several heterogeneous scenarios; (ii) identify the
current state of a powered-on drone, i.e., flying or lying on the ground; (iii)
discriminate the movements of the drone; and, finally, (iv) enjoy a reduced
upper bound on the time required to identify a drone with the requested level
of assurance. The effectiveness of PiNcH has been also evaluated in the
presence of both heavy packet loss and evasion attacks. In this latter case,
the adversary modifies on purpose the profile of the traffic of the drone-RC
link to avoid the detection. In both the cited cases, PiNcH continues enjoying
a remarkable performance. Further, the comparison against state of the art
solution confirms the superior performance of PiNcH in several scenarios. Note
that all the drone-controller generated data traces have been released as
open-source, to allow replicability and foster follow-up. Finally, the quality
and viability of our solution, do prove that network traffic analysis can be
successfully adopted for drone identification and status discrimination.
","[{'version': 'v1', 'created': 'Fri, 11 Jan 2019 10:03:50 GMT'}, {'version': 'v2', 'created': 'Sat, 7 Dec 2019 13:36:01 GMT'}]",2019-12-10,"[['Sciancalepore', 'Savio', ''], ['Ibrahim', 'Omar Adel', ''], ['Oligeri', 'Gabriele', ''], ['Di Pietro', 'Roberto', '']]","['Unmanned Aerial Vehicles', 'Drones Detection', 'RF PassiveDetection', 'Intrusion Detection']"
2128,1404.1559,Jai  Priyankka,"R. Vidya, Dr.G.M.Nasira, R. P. Jaia Priyankka","Sparse Coding: A Deep Learning using Unlabeled Data for High - Level
  Representation","4 Pages, 3 Figures, 2014 World Congress on Computing and
  Communication Technologies (WCCCT)","Vidya R, Dr. Naisra G.M, Priyankka R.P. Jaia, ""Sparse Coding: A
  Deep Learning using Unlabeled Data for High - Level Representation"" IEEE
  Xplore 2014",10.1109/WCCCT.2014.69,,cs.LG cs.NE,http://creativecommons.org/licenses/by/3.0/,"  Sparse coding algorithm is an learning algorithm mainly for unsupervised
feature for finding succinct, a little above high - level Representation of
inputs, and it has successfully given a way for Deep learning. Our objective is
to use High - Level Representation data in form of unlabeled category to help
unsupervised learning task. when compared with labeled data, unlabeled data is
easier to acquire because, unlike labeled data it does not follow some
particular class labels. This really makes the Deep learning wider and
applicable to practical problems and learning. The main problem with sparse
coding is it uses Quadratic loss function and Gaussian noise mode. So, its
performs is very poor when binary or integer value or other Non- Gaussian type
data is applied. Thus first we propose an algorithm for solving the L1 -
regularized convex optimization algorithm for the problem to allow High - Level
Representation of unlabeled data. Through this we derive a optimal solution for
describing an approach to Deep learning algorithm by using sparse code.
","[{'version': 'v1', 'created': 'Sun, 6 Apr 2014 09:50:45 GMT'}]",2014-04-08,"[['Vidya', 'R.', ''], ['Nasira', 'Dr. G. M.', ''], ['Priyankka', 'R. P. Jaia', '']]","['Deep Learning', 'High -Level Representation', 'Sparse Coding', 'Unlabeled Data', 'Neural Network']"
2129,1812.03557,Setareh Maghsudi,Setareh Maghsudi and Mihaela van der Schaar,"Distributed Task Management in Cyber-Physical Systems: How to Cooperate
  under Uncertainty?",,,10.1109/TCCN.2018.2888970,,cs.MA cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of task allocation in a network of cyber-physical
systems (CPSs). The network can have different states, and the tasks are of
different types. The task arrival is stochastic and state-dependent. Every CPS
is capable of performing each type of task with some specific state-dependent
efficiency. The CPSs have to agree on task allocation prior to knowing about
the realized network's state and/or the arrived tasks. We model the problem as
a multi-state stochastic cooperative game with state uncertainty. We then use
the concept of deterministic equivalence and sequential core to solve the
problem. We establish the non-emptiness of the strong sequential core in our
designed task allocation game and investigate its characteristics including
uniqueness and optimality. Moreover, we prove that in the task allocation game,
the strong sequential core is equivalent to Walrasian equilibrium under state
uncertainty; consequently, it can be implemented by using the Walras'
tatonnement process.
","[{'version': 'v1', 'created': 'Sun, 9 Dec 2018 20:59:01 GMT'}]",2020-05-18,"[['Maghsudi', 'Setareh', ''], ['van der Schaar', 'Mihaela', '']]","['Cyber-physical systems', 'distributed task allocation', 'stochastic cooperative games', 'uncertainty']"
2130,1706.00816,Philipp Mayr,"Philipp Mayr, Ameni Kacem","A Complete Year of User Retrieval Sessions in a Social Sciences Academic
  Search Engine","6 pages, 2 figures, accepted short paper at the 21st International
  Conference on Theory and Practice of Digital Libraries (TPDL 2017)",,10.1007/978-3-319-67008-9_46,,cs.DL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present an open data set extracted from the transaction log
of the social sciences academic search engine sowiport. The data set includes a
filtered set of 484,449 retrieval sessions which have been carried out by
sowiport users in the period from April 2014 to April 2015. We propose a
description of interactions performed by the academic search engine users that
can be used in different applications such as result ranking improvement, user
modeling, query reformulation analysis, search pattern recognition.
","[{'version': 'v1', 'created': 'Fri, 2 Jun 2017 18:46:20 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Jun 2017 19:26:22 GMT'}, {'version': 'v3', 'created': 'Sat, 23 Sep 2017 19:56:15 GMT'}]",2018-12-24,"[['Mayr', 'Philipp', ''], ['Kacem', 'Ameni', '']]","['Whole Session Retrieval', 'Information Behavior', 'Session LogAnalysis', 'User Session Data', 'Social Sciences Users']"
2131,1811.04406,Kasanagottu Sai Ram,"K. Sai Ram, Jayanta Mukherjee, Amit Patra and Partha Pratim Das","HSD-CNN: Hierarchically self decomposing CNN architecture using class
  specific filter sensitivity analysis","Accepted in ICVGIP,2018",,10.1145/3293353.3293383,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Conventional Convolutional neural networks (CNN) are trained on large domain
datasets and are hence typically over-represented and inefficient in limited
class applications. An efficient way to convert such large many-class
pre-trained networks into small few-class networks is through a hierarchical
decomposition of its feature maps. To alleviate this issue, we propose an
automated framework for such decomposition in Hierarchically Self Decomposing
CNN (HSD-CNN), in four steps. HSD-CNN is derived automatically using a
class-specific filter sensitivity analysis that quantifies the impact of
specific features on a class prediction. The decomposed hierarchical network
can be utilized and deployed directly to obtain sub-networks for a subset of
classes, and it is shown to perform better without the requirement of
retraining these sub-networks. Experimental results show that HSD-CNN generally
does not degrade accuracy if the full set of classes are used. Interestingly,
when operating on known subsets of classes, HSD-CNN has an improvement in
accuracy with a much smaller model size, requiring much fewer operations.
HSD-CNN flow is verified on the CIFAR10, CIFAR100 and CALTECH101 data sets. We
report accuracies up to $85.6\%$ ( $94.75\%$ ) on scenarios with 13 ( 4 )
classes of CIFAR100, using a pre-trained VGG-16 network on the full data set.
In this case, the proposed HSD-CNN requires $3.97 \times$ fewer parameters and
has $71.22\%$ savings in operations, in comparison to baseline VGG-16
containing features for all 100 classes.
","[{'version': 'v1', 'created': 'Sun, 11 Nov 2018 12:20:18 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Nov 2018 21:34:36 GMT'}]",2020-08-06,"[['Ram', 'K. Sai', ''], ['Mukherjee', 'Jayanta', ''], ['Patra', 'Amit', ''], ['Das', 'Partha Pratim', '']]","['CNN', 'hierarchical', 'neural networks', 'classification', 'clustering', 'modeltransfer', 'sub-networks']"
2132,1501.01941,Daniel Lemire,Adina Crainiceanu and Daniel Lemire,Bloofi: Multidimensional Bloom Filters,,"Information Systems Volume 54, December 2015, Pages 311-324",10.1016/j.is.2015.01.002,,cs.DB cs.DS,http://creativecommons.org/licenses/by/4.0/,"  Bloom filters are probabilistic data structures commonly used for approximate
membership problems in many areas of Computer Science (networking, distributed
systems, databases, etc.). With the increase in data size and distribution of
data, problems arise where a large number of Bloom filters are available, and
all them need to be searched for potential matches. As an example, in a
federated cloud environment, each cloud provider could encode the information
using Bloom filters and share the Bloom filters with a central coordinator. The
problem of interest is not only whether a given element is in any of the sets
represented by the Bloom filters, but which of the existing sets contain the
given element. This problem cannot be solved by just constructing a Bloom
filter on the union of all the sets. Instead, we effectively have a
multidimensional Bloom filter problem: given an element, we wish to receive a
list of candidate sets where the element might be.
  To solve this problem, we consider 3 alternatives. Firstly, we can naively
check many Bloom filters. Secondly, we propose to organize the Bloom filters in
a hierarchical index structure akin to a B+ tree, that we call Bloofi. Finally,
we propose another data structure that packs the Bloom filters in such a way as
to exploit bit-level parallelism, which we call Flat-Bloofi.
  Our theoretical and experimental results show that Bloofi and Flat-Bloofi
provide scalable and efficient solutions alternatives to search through a large
number of Bloom filters.
","[{'version': 'v1', 'created': 'Thu, 8 Jan 2015 20:04:46 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Feb 2015 15:31:25 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Sep 2016 18:37:56 GMT'}]",2016-09-22,"[['Crainiceanu', 'Adina', ''], ['Lemire', 'Daniel', '']]","['Bloom filter index', 'multidimensional Bloom filter', 'federated cloud', 'data provenance']"
2133,1911.12932,Caleb Helbling,Caleb Helbling and Samuel Z Guyer,Juniper: A Functional Reactive Programming Language for the Arduino,"9 pages, ICFP FARM 2016","Proceedings of the 4th International Workshop on Functional Art,
  Music, Modelling, and Design, 2016",10.1145/2975980.2975982,,cs.PL,http://creativecommons.org/licenses/by/4.0/,"  This paper presents the design and implementation of Juniper: a functional
reactive programming language (FRP) targeting the Arduino and related
microcontroller systems. Juniper provides a number of high level features,
including parametric polymorphic functions, anonymous functions, automatic
memory management, and immutable data structures. Also included is a standard
library which offers many useful FRP signal processing functions. Juniper is
translated to standard C++ and compiled with the existing Arduino development
tools, allowing Juniper programs to fit on resource-constrained devices, and
enabling seamless interoperability with existing C++ libraries for these
devices.
","[{'version': 'v1', 'created': 'Fri, 29 Nov 2019 03:00:51 GMT'}]",2019-12-02,"[['Helbling', 'Caleb', ''], ['Guyer', 'Samuel Z', '']]","['functional reactive programming', 'Arduino', 'microcontroller', 'embedded systems']"
2134,1804.03828,Takayasu Moriya,"Takayasu Moriya, Holger R. Roth, Shota Nakamura, Hirohisa Oda, Kai
  Nagara, Masahiro Oda, Kensaku Mori","Unsupervised Pathology Image Segmentation Using Representation Learning
  with Spherical K-means","This paper was presented at SPIE Medical Imaging 2018, Houston, TX,
  USA","Proc. SPIE 10581, Medical Imaging 2018: Digital Pathology, 1058111
  (6 March 2018)",10.1117/12.2292172,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel method for unsupervised segmentation of pathology
images. Staging of lung cancer is a major factor of prognosis. Measuring the
maximum dimensions of the invasive component in a pathology images is an
essential task. Therefore, image segmentation methods for visualizing the
extent of invasive and noninvasive components on pathology images could support
pathological examination. However, it is challenging for most of the recent
segmentation methods that rely on supervised learning to cope with unlabeled
pathology images. In this paper, we propose a unified approach to unsupervised
representation learning and clustering for pathology image segmentation. Our
method consists of two phases. In the first phase, we learn feature
representations of training patches from a target image using the spherical
k-means. The purpose of this phase is to obtain cluster centroids which could
be used as filters for feature extraction. In the second phase, we apply
conventional k-means to the representations extracted by the centroids and then
project cluster labels to the target images. We evaluated our methods on
pathology images of lung cancer specimen. Our experiments showed that the
proposed method outperforms traditional k-means segmentation and the
multithreshold Otsu method both quantitatively and qualitatively with an
improved normalized mutual information (NMI) score of 0.626 compared to 0.168
and 0.167, respectively. Furthermore, we found that the centroids can be
applied to the segmentation of other slices from the same sample.
","[{'version': 'v1', 'created': 'Wed, 11 Apr 2018 06:28:27 GMT'}]",2018-04-13,"[['Moriya', 'Takayasu', ''], ['Roth', 'Holger R.', ''], ['Nakamura', 'Shota', ''], ['Oda', 'Hirohisa', ''], ['Nagara', 'Kai', ''], ['Oda', 'Masahiro', ''], ['Mori', 'Kensaku', '']]","['Segmentation', 'Pathology', 'Representation Learning', 'Unsupervised Learning']"
2135,1112.5472,Casper Kejlberg-Rasmussen,Gerth St{\o}lting Brodal and Casper Kejlberg-Rasmussen,"Cache-Oblivious Implicit Predecessor Dictionaries with the Working Set
  Property","An extended abstract is accepted at STACS 2012, this is the full
  version of that paper with the same name ""Cache-Oblivious Implicit
  Predecessor Dictionaries with the Working-Set Property"", Symposium on
  Theoretical Aspects of Computer Science 2012",,10.4230/LIPIcs.STACS.2012.112,,cs.DS,http://creativecommons.org/licenses/by/3.0/,"  In this paper we present an implicit dynamic dictionary with the working-set
property, supporting insert(e) and delete(e) in O(log n) time, predecessor(e)
in O(log l_{p(e)}) time, successor(e) in O(log l_{s(e)}) time and search(e) in
O(log min(l_{p(e)},l_{e}, l_{s(e)})) time, where n is the number of elements
stored in the dictionary, l_{e} is the number of distinct elements searched for
since element e was last searched for and p(e) and s(e) are the predecessor and
successor of e, respectively. The time-bounds are all worst-case. The
dictionary stores the elements in an array of size n using no additional space.
In the cache-oblivious model the log is base B and the cache-obliviousness is
due to our black box use of an existing cache-oblivious implicit dictionary.
This is the first implicit dictionary supporting predecessor and successor
searches in the working-set bound. Previous implicit structures required O(log
n) time.
","[{'version': 'v1', 'created': 'Thu, 22 Dec 2011 21:45:16 GMT'}, {'version': 'v2', 'created': 'Sun, 1 Jan 2012 15:43:49 GMT'}, {'version': 'v3', 'created': 'Tue, 21 Feb 2012 10:59:40 GMT'}]",2012-07-05,"[['Brodal', 'Gerth Stølting', ''], ['Kejlberg-Rasmussen', 'Casper', '']]","['working-set property', 'dictionary', 'implicit', 'cache-oblivious', 'worst-case', 'external memory', 'I/O efficient']"
2136,1904.00732,Sergiy Koshkin,Sergiy Koshkin and Taylor Styers,From Golden to Unimodular Cryptography,"20 pages, no figures","Chaos, Solitons and Fractals, 105 (2017) pp. 208-214",10.1016/j.chaos.2017.10.015,,cs.CR math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a natural generalization of the golden cryptography, which uses
general unimodular matrices in place of the traditional Q-matrices, and prove
that it preserves the original error correction properties of the encryption.
Moreover, the additional parameters involved in generating the coding matrices
make this unimodular cryptography resilient to the chosen plaintext attacks
that worked against the golden cryptography. Finally, we show that even the
golden cryptography is generally unable to correct double errors in the same
row of the ciphertext matrix, and offer an additional check number which, if
transmitted, allows for the correction.
","[{'version': 'v1', 'created': 'Tue, 5 Feb 2019 00:07:17 GMT'}]",2022-06-24,"[['Koshkin', 'Sergiy', ''], ['Styers', 'Taylor', '']]","['Fibonacci numbers', 'recurrence relation', 'golden ratio', 'golden matrix', 'unimodular matrix', 'symmetric cipher', 'error correction', 'chosen plaintext attack']"
2137,1801.02101,Mohammadhassan Izadyyazdanabadi,"Mohammadhassan Izadyyazdanabadi, Evgenii Belykh, Nikolay Martirosyan,
  Jennifer Eschbacher, Peter Nakaji, Yezhou Yang, and Mark C. Preul","Improving utility of brain tumor confocal laser endomicroscopy:
  objective value assessment and diagnostic frame detection with convolutional
  neural networks",SPIE Medical Imaging: Computer-Aided Diagnosis 2017,"SPIE Proceedings Volume 10134, Medical Imaging 2017:
  Computer-Aided Diagnosis; 101342J (2017);",10.1117/12.2254902,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Confocal laser endomicroscopy (CLE), although capable of obtaining images at
cellular resolution during surgery of brain tumors in real time, creates as
many non-diagnostic as diagnostic images. Non-useful images are often distorted
due to relative motion between probe and brain or blood artifacts. Many images,
however, simply lack diagnostic features immediately informative to the
physician. Examining all the hundreds or thousands of images from a single case
to discriminate diagnostic images from nondiagnostic ones can be tedious.
Providing a real-time diagnostic value assessment of images (fast enough to be
used during the surgical acquisition process and accurate enough for the
pathologist to rely on) to automatically detect diagnostic frames would
streamline the analysis of images and filter useful images for the
pathologist/surgeon. We sought to automatically classify images as diagnostic
or non-diagnostic. AlexNet, a deep-learning architecture, was used in a 4-fold
cross validation manner. Our dataset includes 16,795 images (8572 nondiagnostic
and 8223 diagnostic) from 74 CLE-aided brain tumor surgery patients. The ground
truth for all the images is provided by the pathologist. Average model accuracy
on test data was 91% overall (90.79 % accuracy, 90.94 % sensitivity and 90.87 %
specificity). To evaluate the model reliability we also performed receiver
operating characteristic (ROC) analysis yielding 0.958 average for the area
under ROC curve (AUC). These results demonstrate that a deeply trained AlexNet
network can achieve a model that reliably and quickly recognizes diagnostic CLE
images.
","[{'version': 'v1', 'created': 'Sat, 6 Jan 2018 22:57:06 GMT'}]",2018-01-09,"[['Izadyyazdanabadi', 'Mohammadhassan', ''], ['Belykh', 'Evgenii', ''], ['Martirosyan', 'Nikolay', ''], ['Eschbacher', 'Jennifer', ''], ['Nakaji', 'Peter', ''], ['Yang', 'Yezhou', ''], ['Preul', 'Mark C.', '']]","['Confocal laser endomicroscopy', 'Convolutional neural networks', 'Computer aided diagnosis', 'Imagequality assessment', 'Brain tumor surgery', 'Precision surgery']"
2138,1405.7840,Nitesh Funde,"Nitesh Funde, P R Pardhi",Analysis Of Possible Attack On AODV Protocol In MANET,"4 pages,5 figures, ""Published with International Journal of
  Engineering Trends and Technology (IJETT)""","International Journal of Engineering Trends and Technology
  (IJETT), V11(6),306-309 May 2014",10.14445/22315381/IJETT-V11P258,,cs.NI cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Mobile Ad Hoc Networks (MANETs) consist of wireless mobile nodes which
coordinate with each other to form temporary network without its pre-existing
infrastructure. AODV is popular Ad-hoc distance vector routing reactive
protocol which is used to find correct & shortest route to destination. Due to
openness, dynamic, infrastructure-less nature, MANET are vulnerable to various
attacks. One of these possible attacks is a Black Hole Attack in which a mobile
node falsely replies to the source node that it is having a shortest path to
the destination without checking its routing table. Therefore source node send
all of its data to the black hole node and it deprives all the traffic of the
source node. In this paper, We are proposing a technique to detect and prevent
the multiple black hole nodes from MANET so that source to destination
communication can be made easily. We also analysed the performance of the
network in terms of number of packets sent, received, throughput, energy of
network before attack and after detection & prevention of Attack. From these
analysis, we can conclude that performance decreased due to attack can be
improved after detection & prevention black hole attack in MANET.
","[{'version': 'v1', 'created': 'Fri, 30 May 2014 12:44:27 GMT'}]",2014-06-02,"[['Funde', 'Nitesh', ''], ['Pardhi', 'P R', '']]","['AODV', 'black hole', 'RREQ', 'RREP', 'RERR']"
2139,1309.1553,Nicolas Trotignon,"J{\o}rgen Bang-Jensen, Fr\'ed\'eric Havet, Nicolas Trotignon",Finding an induced subdivision of a digraph,,"J. Bang-Jensen, F. Havet and N. Trotignon. Finding an induced
  subdivision of a digraph. Theoretical Computer Science, 443:10-24, 2012",10.1016/j.tcs.2012.03.017,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the following problem for oriented graphs and digraphs: Given an
oriented graph (digraph) $G$, does it contain an induced subdivision of a
prescribed digraph $D$? The complexity of this problem depends on $D$ and on
whether $G$ must be an oriented graph or is allowed to contain 2-cycles. We
give a number of examples of polynomial instances as well as several
NP-completeness proofs.
","[{'version': 'v1', 'created': 'Fri, 6 Sep 2013 07:19:51 GMT'}]",2016-03-27,"[['Bang-Jensen', 'Jørgen', ''], ['Havet', 'Frédéric', ''], ['Trotignon', 'Nicolas', '']]","['NP-completeness', 'induced paths and cycles', 'linkings', '3-SAT']"
2140,1706.03154,Fan Yang,"Fan Yang, Ajinkya Kale, Yury Bubnov, Leon Stein, Qiaosong Wang, Hadi
  Kiapour, Robinson Piramuthu",Visual Search at eBay,"To appear in 23rd SIGKDD Conference on Knowledge Discovery and Data
  Mining (KDD), 2017. A demonstration video can be found at
  https://youtu.be/iYtjs32vh4g",,10.1145/3097983.3098162,,cs.CV cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel end-to-end approach for scalable visual
search infrastructure. We discuss the challenges we faced for a massive
volatile inventory like at eBay and present our solution to overcome those. We
harness the availability of large image collection of eBay listings and
state-of-the-art deep learning techniques to perform visual search at scale.
Supervised approach for optimized search limited to top predicted categories
and also for compact binary signature are key to scale up without compromising
accuracy and precision. Both use a common deep neural network requiring only a
single forward inference. The system architecture is presented with in-depth
discussions of its basic components and optimizations for a trade-off between
search relevance and latency. This solution is currently deployed in a
distributed cloud infrastructure and fuels visual search in eBay ShopBot and
Close5. We show benchmark on ImageNet dataset on which our approach is faster
and more accurate than several unsupervised baselines. We share our learnings
with the hope that visual search becomes a first class citizen for all large
scale search engines rather than an afterthought.
","[{'version': 'v1', 'created': 'Sat, 10 Jun 2017 00:02:34 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Jul 2017 17:21:23 GMT'}]",2017-07-10,"[['Yang', 'Fan', ''], ['Kale', 'Ajinkya', ''], ['Bubnov', 'Yury', ''], ['Stein', 'Leon', ''], ['Wang', 'Qiaosong', ''], ['Kiapour', 'Hadi', ''], ['Piramuthu', 'Robinson', '']]","['Visual Search', 'Search Engine', 'e-Commerce', 'Deep Learning', 'Semantics']"
2141,1601.07804,Xin Ding,"Xin Ding, Wei Chen and Ian J. Wassell","Joint Sensing Matrix and Sparsifying Dictionary Optimization for Tensor
  Compressive Sensing",,,10.1109/TSP.2017.2699639,,cs.LG cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tensor Compressive Sensing (TCS) is a multidimensional framework of
Compressive Sensing (CS), and it is advantageous in terms of reducing the
amount of storage, easing hardware implementations and preserving
multidimensional structures of signals in comparison to a conventional CS
system. In a TCS system, instead of using a random sensing matrix and a
predefined dictionary, the average-case performance can be further improved by
employing an optimized multidimensional sensing matrix and a learned
multilinear sparsifying dictionary. In this paper, we propose a joint
optimization approach of the sensing matrix and dictionary for a TCS system.
For the sensing matrix design in TCS, an extended separable approach with a
closed form solution and a novel iterative non-separable method are proposed
when the multilinear dictionary is fixed. In addition, a multidimensional
dictionary learning method that takes advantages of the multidimensional
structure is derived, and the influence of sensing matrices is taken into
account in the learning process. A joint optimization is achieved via
alternately iterating the optimization of the sensing matrix and dictionary.
Numerical experiments using both synthetic data and real images demonstrate the
superiority of the proposed approaches.
","[{'version': 'v1', 'created': 'Thu, 28 Jan 2016 15:35:34 GMT'}]",2017-06-07,"[['Ding', 'Xin', ''], ['Chen', 'Wei', ''], ['Wassell', 'Ian J.', '']]","['Multidimensional system', 'compressive sensing', 'tensorcompressive sensing', 'dictionary learning', 'sensing matrix optimization']"
2142,1911.12590,Eric Knauss,"Jan-Philipp Stegh\""ofer and Eric Knauss and Jennifer Horkoff and
  Rebekka Wohlrab",Challenges of Scaled Agile for Safety-Critical Systems,"In: Franch X., M\""annist\""o T., Mart\'inez-Fern\'andez S. (eds)
  Proceedings of Product-Focused Software Process Improvement (Profes), pp
  350-366, Lecture Notes in Computer Science, vol 11915. Springer, Cham",,10.1007/978-3-030-35333-9_26,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automotive companies increasingly adopt scaled agile methods to allow them to
deal with their organisational and product complexity. Suitable methods are
needed to ensure safety when developing automotive systems. On a small scale,
R-Scrum and SafeScrum are two concrete suggestions for how to develop
safety-critical systems using agile methods. However, for large-scale
environments, existing frameworks like SAFe or LeSS do not support the
development of safety-critical systems out of the box. We, therefore, aim to
understand which challenges exist when developing safety-critical systems
within large-scale agile industrial settings, in particular in the automotive
domain. Based on an analysis of R-Scrum and SafeScrum, we conducted a focus
group with three experts from industry to collect challenges in their daily
work. We found challenges in the areas of living traceability, continuous
compliance, and organisational flexibility. Among others, organisations
struggle with defining a suitable traceability strategy, performing incremental
safety analysis, and with integrating safety practices into their scaled way of
working. Our results indicate a need to provide practical approaches to
integrate safety work into large-scale agile development and point towards
possible solutions, e.g., modular safety cases.
  Keywords: Scaled Agile, Safety-Critical Systems, Software Processes, R-Scrum,
SafeScrum
","[{'version': 'v1', 'created': 'Thu, 28 Nov 2019 08:38:45 GMT'}]",2019-12-02,"[['Steghöfer', 'Jan-Philipp', ''], ['Knauss', 'Eric', ''], ['Horkoff', 'Jennifer', ''], ['Wohlrab', 'Rebekka', '']]","['Scaled Agile', 'Safety-Critical Systems', 'Software Processes', 'R-Scrum', 'SafeScrum']"
2143,1911.09953,He-Feng Yin,He-Feng Yin and Xiao-Jun Wu,"Class-specific residual constraint non-negative representation for
  pattern classification",submitted to Journal of Electronic Imaging,,10.1117/1.JEI.29.2.023014,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Representation based classification method (RBCM) remains one of the hottest
topics in the community of pattern recognition, and the recently proposed
non-negative representation based classification (NRC) achieved impressive
recognition results in various classification tasks. However, NRC ignores the
relationship between the coding and classification stages. Moreover, there is
no regularization term other than the reconstruction error term in the
formulation of NRC, which may result in unstable solution leading to
misclassification. To overcome these drawbacks of NRC, in this paper, we
propose a class-specific residual constraint non-negative representation (CRNR)
for pattern classification. CRNR introduces a class-specific residual
constraint into the formulation of NRC, which encourages training samples from
different classes to competitively represent the test sample. Based on the
proposed CRNR, we develop a CRNR based classifier (CRNRC) for pattern
classification. Experimental results on several benchmark datasets demonstrate
the superiority of CRNRC over conventional RBCM as well as the recently
proposed NRC. Moreover, CRNRC works better or comparable to some
state-of-the-art deep approaches on diverse challenging pattern classification
tasks. The source code of our proposed CRNRC is accessible at
https://github.com/yinhefeng/CRNRC.
","[{'version': 'v1', 'created': 'Fri, 22 Nov 2019 10:03:14 GMT'}, {'version': 'v2', 'created': 'Sun, 19 Jan 2020 06:49:11 GMT'}]",2020-05-20,"[['Yin', 'He-Feng', ''], ['Wu', 'Xiao-Jun', '']]","['pattern classification', 'representation based classification', 'non-negative representation', 'class-specific residual constraint']"
2144,1804.06062,Alok Singh,"Alok Singh, Eric Stephan, Malachi Schram, Ilkay Altintas","Deep Learning on Operational Facility Data Related to Large-Scale
  Distributed Area Scientific Workflows",,"2017 IEEE 13th International Conference on e-Science, 2017, pp.
  586 to 591",10.1109/eScience.2017.94,,cs.DC cs.LG cs.PF,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Distributed computing platforms provide a robust mechanism to perform
large-scale computations by splitting the task and data among multiple
locations, possibly located thousands of miles apart geographically. Although
such distribution of resources can lead to benefits, it also comes with its
associated problems such as rampant duplication of file transfers increasing
congestion, long job completion times, unexpected site crashing, suboptimal
data transfer rates, unpredictable reliability in a time range, and suboptimal
usage of storage elements. In addition, each sub-system becomes a potential
failure node that can trigger system wide disruptions. In this vision paper, we
outline our approach to leveraging Deep Learning algorithms to discover
solutions to unique problems that arise in a system with computational
infrastructure that is spread over a wide area. The presented vision, motivated
by a real scientific use case from Belle II experiments, is to develop
multilayer neural networks to tackle forecasting, anomaly detection and
optimization challenges in a complex and distributed data movement environment.
Through this vision based on Deep Learning principles, we aim to achieve
reduced congestion events, faster file transfer rates, and enhanced site
reliability.
","[{'version': 'v1', 'created': 'Tue, 17 Apr 2018 06:29:56 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Apr 2018 19:43:16 GMT'}]",2018-04-24,"[['Singh', 'Alok', ''], ['Stephan', 'Eric', ''], ['Schram', 'Malachi', ''], ['Altintas', 'Ilkay', '']]","['Deep Learning', 'Scientific Workflows', 'Neural']"
2145,2105.10498,Josef Spjut,Josef Spjut and Ben Boudaoud and Joohwan Kim,A Case Study of First Person Aiming at Low Latency for Esports,"4 pages, 7 figures, presented at EHPHCI 2021",,10.31219/osf.io/nu9p3,,cs.HC cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lower computer system input-to-output latency substantially reduces many task
completion times. In fact, literature shows that reduction in targeting task
completion time from decreased latency often exceeds the decrease in latency
alone. However, for aiming in first person shooter (FPS) games, some prior work
has demonstrated diminishing returns below 40 ms of local input-to-output
computer system latency. In this paper, we review this prior art and provide an
additional case study with data demonstrating the importance of local system
latency improvement, even at latency values below 20 ms. Though other factors
may determine victory in a particular esports challenge, ensuring balanced
local computer latency among competitors is essential to fair competition.
","[{'version': 'v1', 'created': 'Wed, 5 May 2021 23:27:01 GMT'}]",2021-05-24,"[['Spjut', 'Josef', ''], ['Boudaoud', 'Ben', ''], ['Kim', 'Joohwan', '']]","['pointing devices', 'mouse', 'first person targeting', 'first person games']"
2146,2009.13033,Chang Liao,"Chang Liao, Yao Cheng, Chengfang Fang, Jie Shi","Where Does the Robustness Come from? A Study of the Transformation-based
  Ensemble Defence","The 27th ACM Conference on Computer and Communications Security (CCS)
  Workshop, AISec 2020",the 13th ACM Workshop on Artificial Intelligence and Security 2020,10.1145/3411508.3421380,,cs.LG cs.AI cs.CR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper aims to provide a thorough study on the effectiveness of the
transformation-based ensemble defence for image classification and its reasons.
It has been empirically shown that they can enhance the robustness against
evasion attacks, while there is little analysis on the reasons. In particular,
it is not clear whether the robustness improvement is a result of
transformation or ensemble. In this paper, we design two adaptive attacks to
better evaluate the transformation-based ensemble defence. We conduct
experiments to show that 1) the transferability of adversarial examples exists
among the models trained on data records after different reversible
transformations; 2) the robustness gained through transformation-based ensemble
is limited; 3) this limited robustness is mainly from the irreversible
transformations rather than the ensemble of a number of models; and 4) blindly
increasing the number of sub-models in a transformation-based ensemble does not
bring extra robustness gain.
","[{'version': 'v1', 'created': 'Mon, 28 Sep 2020 02:55:56 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Oct 2020 09:16:18 GMT'}]",2020-10-09,"[['Liao', 'Chang', ''], ['Cheng', 'Yao', ''], ['Fang', 'Chengfang', ''], ['Shi', 'Jie', '']]","['Adversarial Machine Learning', 'Evasion Attack', 'Ensemble', 'Transferability', 'Robustness']"
2147,1705.03934,Denis Kleyko,"Denis Kleyko, Abbas Rahimi, Ross W. Gayler, Evgeny Osipov","Autoscaling Bloom Filter: Controlling Trade-off Between True and False
  Positives","13 pages, 3 figures",Neural Computing and Applications (2019),10.1007/s00521-019-04397-1,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Bloom filter is a simple data structure supporting membership queries on a
set. The standard Bloom filter does not support the delete operation,
therefore, many applications use a counting Bloom filter to enable deletion.
This paper proposes a generalization of the counting Bloom filter approach,
called ""autoscaling Bloom filters"", which allows adjustment of its capacity
with probabilistic bounds on false positives and true positives. In essence,
the autoscaling Bloom filter is a binarized counting Bloom filter with an
adjustable binarization threshold. We present the mathematical analysis of the
performance as well as give a procedure for minimization of the false positive
rate.
","[{'version': 'v1', 'created': 'Wed, 10 May 2017 19:45:29 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Dec 2017 13:37:35 GMT'}]",2019-08-13,"[['Kleyko', 'Denis', ''], ['Rahimi', 'Abbas', ''], ['Gayler', 'Ross W.', ''], ['Osipov', 'Evgeny', '']]","['Bloom filter', 'counting Bloom filter', 'autoscaling Bloom Filter', 'true positiverate', 'false positive rate']"
2148,1801.04703,Luca Allodi,Luca Allodi and Fabio Massacci,Attack Potential in Impact and Complexity,,"Proceedings of the 12th International Conference on Availability,
  Reliability and Security (ARES 2017)",10.1145/3098954.3098965,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vulnerability exploitation is reportedly one of the main attack vectors
against computer systems. Yet, most vulnerabilities remain unexploited by
attackers. It is therefore of central importance to identify vulnerabilities
that carry a high `potential for attack'. In this paper we rely on Symantec
data on real attacks detected in the wild to identify a trade-off in the Impact
and Complexity of a vulnerability, in terms of attacks that it generates;
exploiting this effect, we devise a readily computable estimator of the
vulnerability's Attack Potential that reliably estimates the expected volume of
attacks against the vulnerability. We evaluate our estimator performance
against standard patching policies by measuring foiled attacks and demanded
workload expressed as the number of vulnerabilities entailed to patch. We show
that our estimator significantly improves over standard patching policies by
ruling out low-risk vulnerabilities, while maintaining invariant levels of
coverage against attacks in the wild. Our estimator can be used as a first aid
for vulnerability prioritisation to focus assessment efforts on high-potential
vulnerabilities.
","[{'version': 'v1', 'created': 'Mon, 15 Jan 2018 09:03:27 GMT'}]",2018-01-16,"[['Allodi', 'Luca', ''], ['Massacci', 'Fabio', '']]","['Vulnerability', 'CVSS', 'exploitation', 'atack potential', 'prioritization']"
2149,1108.1344,Nenad  Stojanovski,"Nenad Stojanovski, Marjan Gusev",Architecture Of A Identity Based Firewall System,"9 pages, 3 figures, 1 table; (ISSN: 0975- 2307); International
  Journal of Network Security & Its Applications July 2011, Volume 3, Number 4",,10.5121/ijnsa,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classic firewall systems are built to filter traffic based on IP addresses,
source and destination ports and protocol types. The modern networks have grown
to a level where the possibility for users' mobility is a must. In such
networks, modern firewalls may introduce such complexity where administration
can become very frustrating since it needs the intervention of a firewall
administrator. The solution for this problem is an identity based firewall
system. In this paper we will present a new design of a firewall system that
uses the user's identity to filter the traffic. In the design phase we will
define key points which have to be satisfied as a crucial milestone for the
functioning of the whole Identity based firewall system.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2011 14:54:25 GMT'}]",2011-08-08,"[['Stojanovski', 'Nenad', ''], ['Gusev', 'Marjan', '']]","['Identity based firewalls', 'user identity', 'firewalls', 'network security', 'computer networks', 'firewall systems design']"
2150,1705.05897,Roberto Metere,"Roberto Metere, Changyu Dong",Automated Cryptographic Analysis of the Pedersen Commitment Scheme,"12 pages, conference MMM-ACNS 2017",,10.1007/978-3-319-65127-9_22,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aiming for strong security assurance, recently there has been an increasing
interest in formal verification of cryptographic constructions. This paper
presents a mechanised formal verification of the popular Pedersen commitment
protocol, proving its security properties of correctness, perfect hiding, and
computational binding. To formally verify the protocol, we extended the theory
of EasyCrypt, a framework which allows for reasoning in the computational
model, to support the discrete logarithm and an abstraction of commitment
protocols. Commitments are building blocks of many cryptographic constructions,
for example, verifiable secret sharing, zero-knowledge proofs, and e-voting.
Our work paves the way for the verification of those more complex
constructions.
","[{'version': 'v1', 'created': 'Tue, 16 May 2017 20:07:08 GMT'}]",2019-01-17,"[['Metere', 'Roberto', ''], ['Dong', 'Changyu', '']]","['formal verification', 'cryptography', 'commitment', 'easycrypt']"
2151,2210.05206,Francois-Xavier Dupe,"Fran\c{c}ois-Xavier Dup\'e (LIS, QARMA), Rohit Yadav, Guillaume
  Auzias, S. Takerkart",Kernelized multi-graph matching,,"14th Asian Conference on Machine Learning (ACML 2022), Dec 2022,
  Hyderabad, India",,,cs.LG eess.SP math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multigraph matching is a recent variant of the graph matching problem. In
this framework, the optimization procedure considers several graphs and
enforces the consistency of the matches along the graphs. This constraint can
be formalized as a cycle consistency across the pairwise permutation matrices,
which implies the definition of a universe of
vertex~\citep{pachauri2013solving}. The label of each vertex is encoded by a
sparse vector and the dimension of this space corresponds to the rank of the
bulk permutation matrix, the matrix built from the aggregation of all the
pairwise permutation matrices. The matching problem can then be formulated as a
non-convex quadratic optimization problem (QAP) under constraints imposed on
the rank and the permutations. In this paper, we introduce a novel kernelized
multigraph matching technique that handles vectors of attributes on both the
vertices and edges of the graphs, while maintaining a low memory usage. We
solve the QAP problem using a projected power optimization approach and propose
several projectors leading to improved stability of the results. We provide
several experiments showing that our method is competitive against other
unsupervised methods.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2022 07:22:47 GMT'}]",2022-10-12,"[['Dupé', 'François-Xavier', '', 'LIS, QARMA'], ['Yadav', 'Rohit', ''], ['Auzias', 'Guillaume', ''], ['Takerkart', 'S.', '']]","['graph matching', 'kernel', 'multi-graph matching', 'non-convex optimization']"
2152,1511.09196,Hamid Kameli,Hamid Kameli,Non-adaptive Group Testing on Graphs,,"Discrete Mathematics & Theoretical Computer Science, Vol. 20 no.
  1, Combinatorics (March 26, 2018) dmtcs:4351",10.23638/DMTCS-20-1-9,,cs.DS cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Grebinski and Kucherov (1998) and Alon et al. (2004-2005) study the problem
of learning a hidden graph for some especial cases, such as hamiltonian cycle,
cliques, stars, and matchings. This problem is motivated by problems in
chemical reactions, molecular biology and genome sequencing.
  In this paper, we present a generalization of this problem. Precisely, we
consider a graph G and a subgraph H of G and we assume that G contains exactly
one defective subgraph isomorphic to H. The goal is to find the defective
subgraph by testing whether an induced subgraph contains an edge of the
defective subgraph, with the minimum number of tests. We present an upper bound
for the number of tests to find the defective subgraph by using the symmetric
and high probability variation of Lov\'asz Local Lemma.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2015 08:26:10 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Jan 2016 10:11:58 GMT'}, {'version': 'v3', 'created': 'Sun, 30 Apr 2017 15:14:24 GMT'}, {'version': 'v4', 'created': 'Sat, 30 Dec 2017 12:07:46 GMT'}, {'version': 'v5', 'created': 'Sun, 4 Mar 2018 09:39:48 GMT'}]",2019-03-14,"[['Kameli', 'Hamid', '']]","['Group testing on graphs', 'Non-adaptive algorithm', 'Combinatorial search', 'Learning a hidden subgraph']"
2153,1706.03686,Kang Han,"Kang Han, Wanggen Wan, Haiyan Yao, and Li Hou","Image Crowd Counting Using Convolutional Neural Network and Markov
  Random Field","6 pages, 6 figures, JACIII Vol.21 No.4",JACIII Vol.21 No.4 2017 pp. 632-638,10.20965/jaciii.2017.p0632(2017),,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we propose a method called Convolutional Neural Network-Markov
Random Field (CNN-MRF) to estimate the crowd count in a still image. We first
divide the dense crowd visible image into overlapping patches and then use a
deep convolutional neural network to extract features from each patch image,
followed by a fully connected neural network to regress the local patch crowd
count. Since the local patches have overlapping portions, the crowd count of
the adjacent patches has a high correlation. We use this correlation and the
Markov random field to smooth the counting results of the local patches.
Experiments show that our approach significantly outperforms the
state-of-the-art methods on UCF and Shanghaitech crowd counting datasets.
","[{'version': 'v1', 'created': 'Mon, 12 Jun 2017 15:29:48 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Sep 2017 11:47:45 GMT'}, {'version': 'v3', 'created': 'Tue, 17 Oct 2017 02:24:34 GMT'}]",2017-10-18,"[['Han', 'Kang', ''], ['Wan', 'Wanggen', ''], ['Yao', 'Haiyan', ''], ['Hou', 'Li', '']]","['crowd counting', 'convolutional neural network', 'Markov random field']"
2154,1404.4250,Dmitry N. Kozlov,Dmitry N. Kozlov,Witness structures and immediate snapshot complexes,"full paper version of the 1st part of the preprint arXiv:1402.4707;
  to appear in DMTCS","Discrete Mathematics & Theoretical Computer Science, Vol. 19 no.
  3, Distributed Computing and Networking (November 28, 2017) dmtcs:4086",10.23638/DMTCS-19-3-12,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we introduce and study a new family of combinatorial simplicial
complexes, which we call immediate snapshot complexes. Our construction and
terminology is strongly motivated by theoretical distributed computing, as
these complexes are combinatorial models of the standard protocol complexes
associated to immediate snapshot read/write shared memory communication model.
In order to define the immediate snapshot complexes we need a new combinatorial
object, which we call a witness structure. These objects are indexing the
simplices in the immediate snapshot complexes, while a special operation on
them, called ghosting, describes the combinatorics of taking simplicial
boundary. In general, we develop the theory of witness structures and use it to
prove several combinatorial as well as topological properties of the immediate
snapshot complexes.
","[{'version': 'v1', 'created': 'Wed, 16 Apr 2014 14:06:12 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Nov 2015 11:29:40 GMT'}, {'version': 'v3', 'created': 'Sun, 5 Feb 2017 08:39:38 GMT'}, {'version': 'v4', 'created': 'Fri, 24 Nov 2017 13:13:08 GMT'}]",2019-03-14,"[['Kozlov', 'Dmitry N.', '']]","['collapses', 'distributed computing', 'combinatorial algebraic topology', 'immediate snapshot', 'protocol complexes']"
2155,1912.12884,Sanjay Sahay,"Trupil Limbasiya, Debasis Das and Sanjay K. Sahay","Secure Communication Protocol for Smart Transportation Based on
  Vehicular Cloud","10 Pages, 1 figure, Conference","ACM Proceedings of the 2019 ACM International Joint Conference on
  Pervasive and Ubiquitous Computing and Proceedings of the 2019 ACM
  International Symposium on Wearable Computers, pp. 372-376",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The pioneering concept of connected vehicles has transformed the way of
thinking for researchers and entrepreneurs by collecting relevant data from
nearby objects. However, this data is useful for a specific vehicle only.
Moreover, vehicles get a high amount of data (e.g., traffic, safety, and
multimedia infotainment) on the road. Thus, vehicles expect adequate storage
devices for this data, but it is infeasible to have a large memory in each
vehicle. Hence, the vehicular cloud computing (VCC) framework came into the
picture to provide a storage facility by connecting a road-side-unit (RSU) with
the vehicular cloud (VC). In this, data should be saved in an encrypted form to
preserve security, but there is a challenge to search for information over
encrypted data. Next, we understand that many of vehicular communication
schemes are inefficient for data transmissions due to its poor performance
results and vulnerable to different fundamental security attacks. Accordingly,
on-device performance is critical, but data damages and secure on-time
connectivity are also significant challenges in a public environment.
Therefore, we propose reliable data transmission protocols for cutting-edge
architecture to search data from the storage, to resist against various
security attacks, and provide better performance results. Thus, the proposed
data transmission protocol is useful in diverse smart city applications
(business, safety, and entertainment) for the benefits of society.
","[{'version': 'v1', 'created': 'Mon, 30 Dec 2019 11:15:14 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Jan 2020 15:17:11 GMT'}]",2020-01-07,"[['Limbasiya', 'Trupil', ''], ['Das', 'Debasis', ''], ['Sahay', 'Sanjay K.', '']]","['Attack', 'Communication', 'Data', 'Smart City', 'Vehicular Cloud', 'Verification']"
2156,1609.03614,Rahul Krishna,"Rahul Krishna, Tim Menzies, and Lucas Layman",Less is More: Minimizing Code Reorganization using XTREE,"16 pages, 9 figures (2 colour images), and 68 References","Information and Software Technology, Volume 88, August 2017, Pages
  53-66, ISSN 0950-5849",10.1016/j.infsof.2017.03.012,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Developers use bad code smells to guide code reorganization. Yet
developers, text books, tools, and researchers disagree on which bad smells are
important. Objective: To evaluate the likelihood that a code reorganization to
address bad code smells will yield improvement in the defect-proneness of the
code. Method: We introduce XTREE, a tool that analyzes a historical log of
defects seen previously in the code and generates a set of useful code changes.
Any bad smell that requires changes outside of that set can be deprioritized
(since there is no historical evidence that the bad smell causes any problems).
Evaluation: We evaluate XTREE's recommendations for bad smell improvement
against recommendations from previous work (Shatnawi, Alves, and Borges) using
multiple data sets of code metrics and defect counts. Results: Code modules
that are changed in response to XTREE's recommendations contain significantly
fewer defects than recommendations from previous studies. Further, XTREE
endorses changes to very few code metrics, and the bad smell recommendations
(learned from previous studies) are not universal to all software projects.
Conclusion: Before undertaking a code reorganization based on a bad smell
report, use a tool like XTREE to check and ignore any such operations that are
useless; i.e. ones which lack evidence in the historical record that it is
useful to make that change. Note that this use case applies to both manual code
reorganizations proposed by developers as well as those conducted by automatic
methods. This recommendation assumes that there is an historical record. If
none exists, then the results of this paper could be used as a guide.
","[{'version': 'v1', 'created': 'Mon, 12 Sep 2016 22:00:50 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Sep 2016 14:21:08 GMT'}, {'version': 'v3', 'created': 'Tue, 20 Dec 2016 06:19:18 GMT'}, {'version': 'v4', 'created': 'Sun, 14 May 2017 15:23:15 GMT'}]",2017-05-17,"[['Krishna', 'Rahul', ''], ['Menzies', 'Tim', ''], ['Layman', 'Lucas', '']]","['Bad smells', 'performance prediction', 'decision trees']"
2157,1611.02049,Michal Nowicki,Micha{\l} Nowicki and Jan Wietrzykowski,Low-effort place recognition with WiFi fingerprints using deep learning,,,10.1007/978-3-319-54042-9_57,,cs.RO cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using WiFi signals for indoor localization is the main localization modality
of the existing personal indoor localization systems operating on mobile
devices. WiFi fingerprinting is also used for mobile robots, as WiFi signals
are usually available indoors and can provide rough initial position estimate
or can be used together with other positioning systems. Currently, the best
solutions rely on filtering, manual data analysis, and time-consuming parameter
tuning to achieve reliable and accurate localization. In this work, we propose
to use deep neural networks to significantly lower the work-force burden of the
localization system design, while still achieving satisfactory results.
Assuming the state-of-the-art hierarchical approach, we employ the DNN system
for building/floor classification. We show that stacked autoencoders allow to
efficiently reduce the feature space in order to achieve robust and precise
classification. The proposed architecture is verified on the publicly available
UJIIndoorLoc dataset and the results are compared with other solutions.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2016 13:47:25 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Apr 2017 06:32:25 GMT'}]",2017-05-01,"[['Nowicki', 'Michał', ''], ['Wietrzykowski', 'Jan', '']]","['WiFi', 'fingerprinting', 'indoor localization', 'deep neural networks']"
2158,1804.02668,Shahar Harel,"Shahar Harel, Kira Radinsky","Accelerating Prototype-Based Drug Discovery using Conditional Diversity
  Networks",,,10.1145/3219819.3219882,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Designing a new drug is a lengthy and expensive process. As the space of
potential molecules is very large (10^23-10^60), a common technique during drug
discovery is to start from a molecule which already has some of the desired
properties. An interdisciplinary team of scientists generates hypothesis about
the required changes to the prototype. In this work, we develop an algorithmic
unsupervised-approach that automatically generates potential drug molecules
given a prototype drug. We show that the molecules generated by the system are
valid molecules and significantly different from the prototype drug. Out of the
compounds generated by the system, we identified 35 FDA-approved drugs. As an
example, our system generated Isoniazid - one of the main drugs for
Tuberculosis. The system is currently being deployed for use in collaboration
with pharmaceutical companies to further analyze the additional generated
molecules.
","[{'version': 'v1', 'created': 'Sun, 8 Apr 2018 11:08:08 GMT'}]",2018-08-10,"[['Harel', 'Shahar', ''], ['Radinsky', 'Kira', '']]","['Prototype-Based Drug Discovery', 'Drug Design', 'Deep Learning forMedicine']"
2159,1402.1327,Rushirajsinh Zala,"Mr.Rushirajsinh L. Zala, Mr.Brijesh B. Mehta, Mr.Mahipalsinh R. Zala",A Survey on Spatial Co-location Patterns Discovery from Spatial Datasets,"6 pages,8 figures","IJCTT 7(3):137-142, January 2014",10.14445/22312803/IJCTT-V7P140,,cs.DB,http://creativecommons.org/licenses/by/3.0/,"  Spatial data mining or Knowledge discovery in spatial database is the
extraction of implicit knowledge, spatial relations and spatial patterns that
are not explicitly stored in databases. Co-location patterns discovery is the
process of finding the subsets of features that are frequently located together
in the same geographic area. In this paper, we discuss the different approaches
like Rule based approach, Join-less approach, Partial Join approach and
Constraint neighborhood based approach for finding co-location patterns.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2014 11:37:45 GMT'}]",2014-02-07,"[['Zala', 'Mr. Rushirajsinh L.', ''], ['Mehta', 'Mr. Brijesh B.', ''], ['Zala', 'Mr. Mahipalsinh R.', '']]","['Co-location patterns', 'Constraint Neighborhood based approach', 'Join-less approach Partial join approach', 'Rule based approach']"
2160,1111.5493,Willy Picard,Willy Picard,"A Formalization of Social Requirements for Human Interactions with
  Service Protocols","36 pages, 9 figures",,10.1016/j.ins.2013.02.005,,cs.SI cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Collaboration models and tools aim at improving the efficiency and
effectiveness of human interactions. Although social relations among
collaborators have been identified as having a strong influence on
collaboration, they are still insufficiently taken into account in current
collaboration models and tools. In this paper, the concept of service protocols
is proposed as a model for human interactions supporting social requirements,
i.e., sets of constraints on the relations among interacting humans. Service
protocols have been proposed as an answer to the need for models for human
interactions in which not only the potential sequences of activities are
specified-as in process models-but also the constraints on the relations among
collaborators. Service protocols are based on two main ideas: first, service
protocols are rooted in the service-oriented architecture (SOA): each service
protocol contains a service-oriented summary which provides a representation of
the activities of an associated process model in SOA terms. Second, a
class-based graph-referred to as a service network schema-restricts the set of
potential service elements that may participate in the service protocol by
defining constraints on nodes and constraints on arcs, i.e., social
requirements. Another major contribution to the modelling of human interactions
is a unified approach organized around the concept of service, understood in a
broad sense with services being not only Web services, but also provided by
humans.
","[{'version': 'v1', 'created': 'Wed, 23 Nov 2011 13:53:26 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Jul 2012 09:17:12 GMT'}]",2013-03-08,"[['Picard', 'Willy', '']]","['human interaction', 'social requirement', 'process modelling', 'serviceprotocol', 'social network']"
2161,1603.06121,Alina Zare,"Matthew Cook, Alina Zare, Dominic Ho","Buried object detection using handheld WEMI with task-driven extended
  functions of multiple instances","Proceedings of the SPIE, 2016",,10.1117/12.2223349,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many effective supervised discriminative dictionary learning methods have
been developed in the literature. However, when training these algorithms,
precise ground-truth of the training data is required to provide very accurate
point-wise labels. Yet, in many applications, accurate labels are not always
feasible. This is especially true in the case of buried object detection in
which the size of the objects are not consistent. In this paper, a new multiple
instance dictionary learning algorithm for detecting buried objects using a
handheld WEMI sensor is detailed. The new algorithm, Task Driven Extended
Functions of Multiple Instances, can overcome data that does not have very
precise point-wise labels and still learn a highly discriminative dictionary.
Results are presented and discussed on measured WEMI data.
","[{'version': 'v1', 'created': 'Sat, 19 Mar 2016 17:46:45 GMT'}]",2016-08-24,"[['Cook', 'Matthew', ''], ['Zare', 'Alina', ''], ['Ho', 'Dominic', '']]","['Supervised Dictionary Learning', 'Landmine Detection', 'Electromagnetic Induction', 'Extended Functions of Multiple Instances']"
2162,1311.7307,Radu Ciucanu,"Iovka Boneva, Radu Ciucanu, S{\l}awek Staworko",Schemas for Unordered XML on a DIME,Theory of Computing Systems,,10.1007/s00224-014-9593-1,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate schema languages for unordered XML having no relative order
among siblings. First, we propose unordered regular expressions (UREs),
essentially regular expressions with unordered concatenation instead of
standard concatenation, that define languages of unordered words to model the
allowed content of a node (i.e., collections of the labels of children).
However, unrestricted UREs are computationally too expensive as we show the
intractability of two fundamental decision problems for UREs: membership of an
unordered word to the language of a URE and containment of two UREs.
Consequently, we propose a practical and tractable restriction of UREs,
disjunctive interval multiplicity expressions (DIMEs).
  Next, we employ DIMEs to define languages of unordered trees and propose two
schema languages: disjunctive interval multiplicity schema (DIMS), and its
restriction, disjunction-free interval multiplicity schema (IMS). We study the
complexity of the following static analysis problems: schema satisfiability,
membership of a tree to the language of a schema, schema containment, as well
as twig query satisfiability, implication, and containment in the presence of
schema. Finally, we study the expressive power of the proposed schema languages
and compare them with yardstick languages of unordered trees (FO, MSO, and
Presburger constraints) and DTDs under commutative closure. Our results show
that the proposed schema languages are capable of expressing many practical
languages of unordered trees and enjoy desirable computational properties.
","[{'version': 'v1', 'created': 'Thu, 28 Nov 2013 13:03:12 GMT'}, {'version': 'v2', 'created': 'Sun, 9 Feb 2014 16:44:00 GMT'}, {'version': 'v3', 'created': 'Wed, 30 Jul 2014 15:50:41 GMT'}, {'version': 'v4', 'created': 'Tue, 28 Oct 2014 08:22:24 GMT'}]",2014-10-29,"[['Boneva', 'Iovka', ''], ['Ciucanu', 'Radu', ''], ['Staworko', 'Sławek', '']]","['Schemas for XML', 'Unordered XML', 'Regular expressions', 'Twigqueries', 'Semi-structured data']"
2163,1805.05534,Kyung Chul Jeong,"Panjin Kim, Kyung Chul Jeong, Daewan Han","Time-Space Complexity of Quantum Search Algorithms in Symmetric
  Cryptanalysis",,Quantum Inf Process (2018) 17: 339,10.1007/s11128-018-2107-3,,cs.CR quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Performance of cryptanalytic quantum search algorithms is mainly inferred
from query complexity which hides overhead induced by an implementation. To
shed light on quantitative complexity analysis removing hidden factors, we
provide a framework for estimating time-space complexity, with carefully
accounting for characteristics of target cryptographic functions. Processor and
circuit parallelization methods are taken into account, resulting in the
time-space trade-offs curves in terms of depth and qubit. The method guides how
to rank different circuit designs in order of their efficiency. The framework
is applied to representative cryptosystems NIST referred to as a guideline for
security parameters, reassessing the security strengths of AES and SHA-2.
","[{'version': 'v1', 'created': 'Tue, 15 May 2018 02:46:23 GMT'}]",2018-11-02,"[['Kim', 'Panjin', ''], ['Jeong', 'Kyung Chul', ''], ['Han', 'Daewan', '']]","['Post-quantum cryptography (PQC)', 'Circuit model', 'Grover', 'Resource estimates', 'Time-space trade-offs', 'AES', 'SHA-2']"
2164,1804.07604,Jukka Ruohonen,Jukka Ruohonen,"An Empirical Survey on the Early Adoption of DNS Certification Authority
  Authorization",Under review since early November 2017,,10.1080/23742917.2019.1632249,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new certification authority authorization (CAA) resource record for the
domain name system (DNS) was standardized in 2013. Motivated by the later 2017
decision to enforce mandatory CAA checking for most certificate authorities,
this paper surveys the early adoption of CAA by using an empirical sample
collected from the Alexa's top-million domains. According to the results, (i)
the adoption of CAA is still at a modest level; only a little below two percent
of the popular domains sampled have adopted CAA. Among the domains that have
adopted CAA, (ii) authorizations dealing with wildcard certificates are rare
compared to conventional certificates. Interestingly, (iii) the results only
partially reflect the market structure of the global certificate business. With
these timely results, the paper contributes to the ongoing large-scale
empirical research on the use of encryption technologies.
","[{'version': 'v1', 'created': 'Fri, 20 Apr 2018 13:34:35 GMT'}]",2019-09-06,"[['Ruohonen', 'Jukka', '']]","['domain name system', 'certificate authority', 'public key infrastructure', 'HTTPS', 'TLS']"
2165,2012.04196,Swetava Ganguli,"Xuerong Xiao, Swetava Ganguli, Vipul Pandey","VAE-Info-cGAN: Generating Synthetic Images by Combining Pixel-level and
  Feature-level Geospatial Conditional Inputs","10 pages, 4 figures, Peer-reviewed and accepted version of the paper
  published at the 13th ACM SIGSPATIAL International Workshop on Computational
  Transportation Science (IWCTS 2020)","In Proceedings of the 13th ACM SIGSPATIAL International Workshop
  on Computational Transportation Science, Article No. 1, Pages 1-10, November
  03, 2020, Seattle, WA, USA",10.1145/3423457.3429361,,cs.CV cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Training robust supervised deep learning models for many geospatial
applications of computer vision is difficult due to dearth of class-balanced
and diverse training data. Conversely, obtaining enough training data for many
applications is financially prohibitive or may be infeasible, especially when
the application involves modeling rare or extreme events. Synthetically
generating data (and labels) using a generative model that can sample from a
target distribution and exploit the multi-scale nature of images can be an
inexpensive solution to address scarcity of labeled data. Towards this goal, we
present a deep conditional generative model, called VAE-Info-cGAN, that
combines a Variational Autoencoder (VAE) with a conditional Information
Maximizing Generative Adversarial Network (InfoGAN), for synthesizing
semantically rich images simultaneously conditioned on a pixel-level condition
(PLC) and a macroscopic feature-level condition (FLC). Dimensionally, the PLC
can only vary in the channel dimension from the synthesized image and is meant
to be a task-specific input. The FLC is modeled as an attribute vector in the
latent space of the generated image which controls the contributions of various
characteristic attributes germane to the target distribution. An interpretation
of the attribute vector to systematically generate synthetic images by varying
a chosen binary macroscopic feature is explored. Experiments on a GPS
trajectories dataset show that the proposed model can accurately generate
various forms of spatio-temporal aggregates across different geographic
locations while conditioned only on a raster representation of the road
network. The primary intended application of the VAE-Info-cGAN is synthetic
data (and label) generation for targeted data augmentation for computer
vision-based modeling of problems relevant to geospatial analysis and remote
sensing.
","[{'version': 'v1', 'created': 'Tue, 8 Dec 2020 03:46:19 GMT'}]",2020-12-09,"[['Xiao', 'Xuerong', ''], ['Ganguli', 'Swetava', ''], ['Pandey', 'Vipul', '']]","['VAE', 'GAN', 'Deep Conditional Generative Models', 'Synthetic Data']"
2166,1503.09169,Pierre Crescenzo,"Isabelle Mirbel (INRIA Sophia Antipolis / Laboratoire I3S), Pierre
  Crescenzo (I3S)",Improving Collaborations in Neuroscientist Community,{\'e}galement rapport de recherche I3S/RR--2009-05--FR,"International Journal of Web Portals, IGI Global, 2011, 1 (3),
  pp.33-49",10.1109/WI-IAT.2009.351,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present our approach, called SATIS (Semantically AnnotaTed
Intentions for Services), relying on intentional process modeling and semantic
web technologies and models, to assist collaboration among the members of a
neurosciences community. The main expected result of this work is to derive and
share semantic web service specifications from a neuro-scientists point of view
in order to operationalise image analysis pipelines with web services.
","[{'version': 'v1', 'created': 'Tue, 31 Mar 2015 19:21:08 GMT'}]",2015-04-01,"[['Mirbel', 'Isabelle', '', 'INRIA Sophia Antipolis / Laboratoire I3S'], ['Crescenzo', 'Pierre', '', 'I3S']]","['intentional process modeling', 'semantic web', 'rules', 'fragments', 'reuse', 'scientif workflow']"
2167,1111.5773,Willy Picard,Jan \'Swierzowicz and Willy Picard,Social Requirements for Virtual Organization Breeding Environments,"10 pages, 2 figures",,10.1007/978-3-642-04568-4_63,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The creation of Virtual Breeding Environments (VBE) is a topic which has
received too little attention: in most former works, the existence of the VBE
is either assumed, or is considered as the result of the voluntary,
participatory gathering of a set of candidate companies. In this paper, the
creation of a VBE by a third authority is considered: chambers of commerce, as
organizations whose goal is to promote and facilitate business interests and
activity in the community, could be good candidates for exogenous VBE creators.
During VBE planning, there is a need to specify social requirements for the
VBE. In this paper, SNA metrics are proposed as a way for a VBE planner to
express social requirements for a VBE to be created. Additionally, a set of
social requirements for VO planners, VO brokers, and VBE members are proposed.
","[{'version': 'v1', 'created': 'Thu, 24 Nov 2011 14:13:59 GMT'}]",2011-11-28,"[['Świerzowicz', 'Jan', ''], ['Picard', 'Willy', '']]","['Social Requirements', 'Social Network Analysis', 'Virtual Breeding Environment', 'Virtual Organization']"
2168,1512.04648,Cl\'ement Maria,"Cl\'ement Maria, Jonathan Spreer","Admissible colourings of 3-manifold triangulations for Turaev-Viro type
  invariants","26 pages, 10 figures, 5 tables","24th Annual European Symposium on Algorithms (ESA 2016), Leibniz
  International Proceedings in Informatics (LIPIcs), vol. 57, 64:1-64:16, 2016",10.4230/LIPIcs.ESA.2016.64,,cs.CG math.CO math.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Turaev Viro invariants are amongst the most powerful tools to distinguish
3-manifolds: They are implemented in mathematical software, and allow practical
computations. The invariants can be computed purely combinatorially by
enumerating colourings on the edges of a triangulation T.
  These edge colourings can be interpreted as embeddings of surfaces in T. We
give a characterisation of how these embedded surfaces intersect with the
tetrahedra of T. This is done by characterising isotopy classes of simple
closed loops in the 3-punctured disk. As a direct result we obtain a new system
of coordinates for edge colourings which allows for simpler definitions of the
tetrahedron weights incorporated in the Turaev-Viro invariants.
  Moreover, building on a detailed analysis of the colourings, as well as
classical work due to Kirby and Melvin, Matveev, and others, we show that
considering a much smaller set of colourings suffices to compute Turaev-Viro
invariants in certain significant cases. This results in a substantial
improvement of running times to compute the invariants, reducing the number of
colourings to consider by a factor of $2^n$. In addition, we present an
algorithm to compute Turaev-Viro invariants of degree four -- a problem known
to be #P-hard -- which capitalises on the combinatorial structure of the input.
  The improved algorithms are shown to be optimal in the following sense: There
exist triangulations admitting all colourings the algorithms consider.
Furthermore, we demonstrate that our new algorithms to compute Turaev-Viro
invariants are able to distinguish the majority of $\mathbb{Z}$-homology
spheres with complexity up to $11$ in $O(2^n)$ operations in $\mathbb{Q}$.
","[{'version': 'v1', 'created': 'Tue, 15 Dec 2015 04:44:44 GMT'}]",2018-10-24,"[['Maria', 'Clément', ''], ['Spreer', 'Jonathan', '']]","['geometric topology', 'triangulations of 3-manifolds', 'Turaev-Viro invariants', 'combinatorial algorithms']"
2169,1611.08807,Ramon Ferrer i Cancho,"Bernardino Casas, Neus Catal\`a, Ramon Ferrer-i-Cancho, Antoni
  Hern\'andez-Fern\'andez and Jaume Baixeries",The polysemy of the words that children learn over time,"Substantially revised version based on referee comments from
  Interaction Studies","Interaction Studies 19 (3), 389-426 (2018)",10.1075/is.16036.cas,,cs.CL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Here we study polysemy as a potential learning bias in vocabulary learning in
children. Words of low polysemy could be preferred as they reduce the
disambiguation effort for the listener. However, such preference could be a
side-effect of another bias: the preference of children for nouns in
combination with the lower polysemy of nouns with respect to other
part-of-speech categories. Our results show that mean polysemy in children
increases over time in two phases, i.e. a fast growth till the 31st month
followed by a slower tendency towards adult speech. In contrast, this evolution
is not found in adults interacting with children. This suggests that children
have a preference for non-polysemous words in their early stages of vocabulary
acquisition. Interestingly, the evolutionary pattern described above weakens
when controlling for syntactic category (noun, verb, adjective or adverb) but
it does not disappear completely, suggesting that it could result from
acombination of a standalone bias for low polysemy and a preference for nouns.
","[{'version': 'v1', 'created': 'Sun, 27 Nov 2016 08:32:19 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Mar 2019 12:57:23 GMT'}]",2020-09-24,"[['Casas', 'Bernardino', ''], ['Català', 'Neus', ''], ['Ferrer-i-Cancho', 'Ramon', ''], ['Hernández-Fernández', 'Antoni', ''], ['Baixeries', 'Jaume', '']]","['child language evolution', 'vocabulary learning', 'learningbiases', 'polysemy', 'quantitative linguistics']"
2170,1510.05229,Erel Segal-Halevi,Erel Segal-Halevi and Bal\'azs Sziklai,Monotonicity and Competitive Equilibrium in Cake-cutting,Revised version,"Economic Theory, 2018-5-29. https://rdcu.be/PkIk",10.1007/s00199-018-1128-6,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the monotonicity properties of solutions in the classic problem of
fair cake-cutting --- dividing a heterogeneous resource among agents with
different preferences. Resource- and population-monotonicity relate to
scenarios where the cake, or the number of participants who divide the cake,
changes. It is required that the utility of all participants change in the same
direction: either all of them are better-off (if there is more to share or
fewer to share among) or all are worse-off (if there is less to share or more
to share among).
  We formally introduce these concepts to the cake-cutting problem and examine
whether they are satisfied by various common division rules. We prove that the
Nash-optimal rule, which maximizes the product of utilities, is
resource-monotonic and population-monotonic, in addition to being
Pareto-optimal, envy-free and satisfying a strong competitive-equilibrium
condition. Moreover, we prove that it is the only rule among a natural family
of welfare-maximizing rules that is both proportional and resource-monotonic.
","[{'version': 'v1', 'created': 'Sun, 18 Oct 2015 11:32:19 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Nov 2015 10:12:55 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Dec 2015 06:23:43 GMT'}, {'version': 'v4', 'created': 'Mon, 18 Jul 2016 16:21:26 GMT'}, {'version': 'v5', 'created': 'Mon, 1 May 2017 15:08:39 GMT'}, {'version': 'v6', 'created': 'Thu, 1 Jun 2017 01:46:17 GMT'}, {'version': 'v7', 'created': 'Sat, 10 Feb 2018 22:35:36 GMT'}]",2018-09-26,"[['Segal-Halevi', 'Erel', ''], ['Sziklai', 'Balázs', '']]","['game theory', 'cake-cutting', 'resource-monotonicity', 'population-monotonicity', 'additive utilities']"
2171,2102.09387,Jorge Melegati,"Jorge Melegati, Eduardo Guerra, Xiaofeng Wang","HyMap: eliciting hypotheses in early-stage software startups using
  cognitive mapping",,"Information and Software Technology, vol. 144, p. 106807, Apr.
  2022",10.1016/j.infsof.2021.106807,,cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Context: Software startups develop innovative, software-intensive products.
Given the uncertainty associated with such an innovative context,
experimentation is a valuable approach for these companies, especially in the
early stages of the development, when implementing unnecessary features
represents a higher risk for companies' survival. Nevertheless, researchers
have argued that the lack of clearly defined practices led to limited adoption
of experimentation. In this regard, the first step is to define the hypotheses
based on which teams will create experiments. Objective: We aim to develop a
systematic technique to identify hypotheses for early-stage software startups.
Methods: We followed a Design Science approach consisted of three cycles in the
construction phase, that involved seven startups in total, and an evaluation of
the final artifact within three startups. Results: We developed the HyMap, a
hypotheses elicitation technique based on cognitive mapping. It consists of a
visual language to depict a cognitive map representing the founder's
understanding of the product, and a process to elicit this map consisted of a
series of questions the founder must answer. Our evaluation showed that the
artifacts are clear, easy to use, and useful leading to hypotheses and
facilitating founders to visualize their idea. Conclusion: Our study
contributes to both descriptive and prescriptive bodies of knowledge. Regarding
the first, it provides a better understanding of the guidance founders use to
develop their startups and, for the latter, a technique to identify hypotheses
in early-stage software startups.
","[{'version': 'v1', 'created': 'Thu, 18 Feb 2021 17:29:47 GMT'}, {'version': 'v2', 'created': 'Sun, 9 Jan 2022 13:16:47 GMT'}]",2022-01-11,"[['Melegati', 'Jorge', ''], ['Guerra', 'Eduardo', ''], ['Wang', 'Xiaofeng', '']]","['hypotheses engineering', 'software startups', 'experimentation', 'hypotheses elicitation']"
2172,1812.00078,Rohan Padhye,"Rohan Padhye, Caroline Lemieux, Koushik Sen, Mike Papadakis, Yves Le
  Traon",Semantic Fuzzing with Zest,"To appear in Proceedings of 28th ACM SIGSOFT International Symposium
  on Software Testing and Analysis (ISSTA'19)",,10.1145/3293882.3330576,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Programs expecting structured inputs often consist of both a syntactic
analysis stage, which parses raw input, and a semantic analysis stage, which
conducts checks on the parsed input and executes the core logic of the program.
Generator-based testing tools in the lineage of QuickCheck are a promising way
to generate random syntactically valid test inputs for these programs. We
present Zest, a technique which automatically guides QuickCheck-like
randominput generators to better explore the semantic analysis stage of test
programs. Zest converts random-input generators into deterministic parametric
generators. We present the key insight that mutations in the untyped parameter
domain map to structural mutations in the input domain. Zest leverages program
feedback in the form of code coverage and input validity to perform
feedback-directed parameter search. We evaluate Zest against AFL and QuickCheck
on five Java programs: Maven, Ant, BCEL, Closure, and Rhino. Zest covers
1.03x-2.81x as many branches within the benchmarks semantic analysis stages as
baseline techniques. Further, we find 10 new bugs in the semantic analysis
stages of these benchmarks. Zest is the most effective technique in finding
these bugs reliably and quickly, requiring at most 10 minutes on average to
find each bug.
","[{'version': 'v1', 'created': 'Fri, 30 Nov 2018 22:34:11 GMT'}, {'version': 'v2', 'created': 'Thu, 2 May 2019 03:35:26 GMT'}, {'version': 'v3', 'created': 'Fri, 7 Jun 2019 20:49:28 GMT'}]",2019-06-11,"[['Padhye', 'Rohan', ''], ['Lemieux', 'Caroline', ''], ['Sen', 'Koushik', ''], ['Papadakis', 'Mike', ''], ['Traon', 'Yves Le', '']]","['Structure-aware fuzzing', 'property-based testing', 'random testing']"
2173,1808.06055,Maneesh Bilalpur,"Maneesh Bilalpur, Mohan Kankanhalli, Stefan Winkler, and Ramanathan
  Subramanian","EEG-based Evaluation of Cognitive Workload Induced by Acoustic
  Parameters for Data Sonification","Accepted for publication in the proceedings of the 20th ACM
  International Conference on Multimodal Interaction, Colorado, USA",,10.1145/3242969.3243016,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data Visualization has been receiving growing attention recently, with
ubiquitous smart devices designed to render information in a variety of ways.
However, while evaluations of visual tools for their interpretability and
intuitiveness have been commonplace, not much research has been devoted to
other forms of data rendering, eg, sonification. This work is the first to
automatically estimate the cognitive load induced by different acoustic
parameters considered for sonification in prior studies. We examine cognitive
load via (a) perceptual data-sound mapping accuracies of users for the
different acoustic parameters, (b) cognitive workload impressions explicitly
reported by users, and (c) their implicit EEG responses compiled during the
mapping task. Our main findings are that (i) low cognitive load-inducing (ie,
more intuitive) acoustic parameters correspond to higher mapping accuracies,
(ii) EEG spectral power analysis reveals higher $\alpha$ band power for low
cognitive load parameters, implying a congruent relationship between explicit
and implicit user responses, and (iii) Cognitive load classification with EEG
features achieves a peak F1-score of 0.64, confirming that reliable workload
estimation is achievable with user EEG data compiled using wearable sensors.
","[{'version': 'v1', 'created': 'Sat, 18 Aug 2018 08:20:23 GMT'}]",2018-08-21,"[['Bilalpur', 'Maneesh', ''], ['Kankanhalli', 'Mohan', ''], ['Winkler', 'Stefan', ''], ['Subramanian', 'Ramanathan', '']]","['Data Sonification', 'EEG', 'Cognitive Workload', 'Acoustic parameters']"
2174,1007.4986,Johannes Oetsch,"Johannes Oetsch, J\""org P\""uhrer, and Hans Tompits",Catching the Ouroboros: On Debugging Non-ground Answer-Set Programs,,"Theory and Practice of Logic Programming, Volume 10, Special Issue
  4-6, July 2010, pp 513-529",10.1017/S1471068410000256,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An important issue towards a broader acceptance of answer-set programming
(ASP) is the deployment of tools which support the programmer during the coding
phase. In particular, methods for debugging an answer-set program are
recognised as a crucial step in this regard. Initial work on debugging in ASP
mainly focused on propositional programs, yet practical debuggers need to
handle programs with variables as well. In this paper, we discuss a debugging
technique that is directly geared towards non-ground programs. Following
previous work, we address the central debugging question why some
interpretation is not an answer set. The explanations provided by our method
are computed by means of a meta-programming technique, using a uniform encoding
of a debugging request in terms of ASP itself. Our method also permits programs
containing comparison predicates and integer arithmetics, thus covering a
relevant language class commonly supported by all state-of-the-art ASP solvers.
","[{'version': 'v1', 'created': 'Wed, 28 Jul 2010 14:18:32 GMT'}]",2010-07-29,"[['Oetsch', 'Johannes', ''], ['Pührer', 'Jörg', ''], ['Tompits', 'Hans', '']]","['answer-set programming', 'program analysis', 'debugging']"
2175,1702.00112,Benjamin Mako Hill,"Sayamindu Dasgupta, Benjamin Mako Hill",Scratch Community Blocks: Supporting Children as Data Scientists,,,10.1145/3025453.3025847,,cs.HC cs.CY cs.SI,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we present Scratch Community Blocks, a new system that enables
children to programmatically access, analyze, and visualize data about their
participation in Scratch, an online community for learning computer
programming. At its core, our approach involves a shift in who analyzes data:
from adult data scientists to young learners themselves. We first introduce the
goals and design of the system and then demonstrate it by describing example
projects that illustrate its functionality. Next, we show through a series of
case studies how the system engages children in not only representing data and
answering questions with data but also in self-reflection about their own
learning and participation.
","[{'version': 'v1', 'created': 'Wed, 1 Feb 2017 03:21:35 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Feb 2017 02:48:16 GMT'}]",2017-02-03,"[['Dasgupta', 'Sayamindu', ''], ['Hill', 'Benjamin Mako', '']]","['data science; learning; computers', 'children; creativitysupport tools; social computing', 'social navigation;block-based programming']"
2176,1803.06686,Jordan Henkel,"Jordan Henkel, Shuvendu K. Lahiri, Ben Liblit, Thomas Reps","Code Vectors: Understanding Programs Through Embedded Abstracted
  Symbolic Traces",,,10.1145/3236024.3236085,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rise of machine learning, there is a great deal of interest in
treating programs as data to be fed to learning algorithms. However, programs
do not start off in a form that is immediately amenable to most off-the-shelf
learning techniques. Instead, it is necessary to transform the program to a
suitable representation before a learning technique can be applied.
  In this paper, we use abstractions of traces obtained from symbolic execution
of a program as a representation for learning word embeddings. We trained a
variety of word embeddings under hundreds of parameterizations, and evaluated
each learned embedding on a suite of different tasks. In our evaluation, we
obtain 93% top-1 accuracy on a benchmark consisting of over 19,000 API-usage
analogies extracted from the Linux kernel. In addition, we show that embeddings
learned from (mainly) semantic abstractions provide nearly triple the accuracy
of those learned from (mainly) syntactic abstractions.
","[{'version': 'v1', 'created': 'Sun, 18 Mar 2018 16:40:13 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Aug 2018 16:03:10 GMT'}]",2018-08-21,"[['Henkel', 'Jordan', ''], ['Lahiri', 'Shuvendu K.', ''], ['Liblit', 'Ben', ''], ['Reps', 'Thomas', '']]","['Word Embeddings', 'Analogical Reasoning', 'Program Understanding', 'Linux']"
2177,1310.4900,Akira Otsuki,Akira Otsuki and Masayoshi Kawamura,"GV-Index:Scientific Contribution Rating Index That Takes into Account
  the Growth Degree of Research Area and Variance Values of the Publication
  Year of Cited Paper","11 pages, 9 figures, 8 tables","International Journal of Data Mining & Knowledge Management
  Process (IJDKP) Vol.3, No.5, September 2013",10.5121/ijdkp.2013.3501,,cs.DL,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  There are a wide variety of scientific contribution rating indices including
the impact factor and h-index. These are used for quantitative analyses on
research papers published in the past, and therefore unable to incorporate in
the assessment the growth, or deterioration, of the research area: whether the
research area of a particular paper is in decline or conversely in a growing
trend. Other hand, the use of the conventional rating indices may result in
higher rates for papers that are hardly referenced nowadays in other papers
although frequently cited in the past. This study proposes a new type of
scientific contribution ranking index, ""Growing Degree of Research Area and
Variance Values Index (GV-Index)"". The GV-Index is computed by a principal
component analysis based on an estimated value obtained by PageRank Algorithm,
which takes into account the growing degree of the research area and its
variance. We also propose visualization system of a scientist's network using
the GV-Index.
","[{'version': 'v1', 'created': 'Fri, 18 Oct 2013 03:38:06 GMT'}]",2013-10-21,"[['Otsuki', 'Akira', ''], ['Kawamura', 'Masayoshi', '']]","['Scientific Contribution Rating Index', 'Principal Component Analysis', 'Bibliometrics', 'Database']"
2178,1902.02339,Kaicheng Yang,"Kai-Cheng Yang, Pik-Mai Hui, Filippo Menczer","Bot Electioneering Volume: Visualizing Social Bot Activity During
  Elections","3 pages, 3 figures. In submission",Companion Proceedings of The 2019 World Wide Web Conference,10.1145/3308560.3316499,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  It has been widely recognized that automated bots may have a significant
impact on the outcomes of national events. It is important to raise public
awareness about the threat of bots on social media during these important
events, such as the 2018 US midterm election. To this end, we deployed a web
application to help the public explore the activities of likely bots on Twitter
on a daily basis. The application, called Bot Electioneering Volume (BEV),
reports on the level of likely bot activities and visualizes the topics
targeted by them. With this paper we release our code base for the BEV
framework, with the goal of facilitating future efforts to combat malicious
bots on social media.
","[{'version': 'v1', 'created': 'Wed, 6 Feb 2019 18:56:45 GMT'}]",2020-06-05,"[['Yang', 'Kai-Cheng', ''], ['Hui', 'Pik-Mai', ''], ['Menczer', 'Filippo', '']]","['bot activity', 'Twitter', 'elections']"
2179,1502.03774,Aiswarya Iyer,"Aiswarya Iyer, S. Jeyalatha, Ronak Sumbaly",Diagnosis of diabetes using classification mining techniques,,"International Journal of Data Mining & Knowledge Management
  Process (IJDKP), Vol.5, No.1, January 2015, pp. 1-14",10.5121/ijdkp.2015.5101,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Diabetes has affected over 246 million people worldwide with a majority of
them being women. According to the WHO report, by 2025 this number is expected
to rise to over 380 million. The disease has been named the fifth deadliest
disease in the United States with no imminent cure in sight. With the rise of
information technology and its continued advent into the medical and healthcare
sector, the cases of diabetes as well as their symptoms are well documented.
This paper aims at finding solutions to diagnose the disease by analyzing the
patterns found in the data through classification analysis by employing
Decision Tree and Na\""ive Bayes algorithms. The research hopes to propose a
quicker and more efficient technique of diagnosing the disease, leading to
timely treatment of the patients.
","[{'version': 'v1', 'created': 'Thu, 12 Feb 2015 19:07:19 GMT'}]",2015-02-13,"[['Iyer', 'Aiswarya', ''], ['Jeyalatha', 'S.', ''], ['Sumbaly', 'Ronak', '']]","['Classification', 'Data Mining', 'Decision Tree', 'Diabetes', 'Naïve Bayes.     1']"
2180,1407.2207,Atul  Singh Kushwah Mr.,"Atul Singh Kushwah, Priya Rathore, Ramsewak Kumar","Performance Estimation of 2*4 MIMO-MC-CDMA Using Convolution Code in
  Different Modulation Technique using ZF Detection Scheme","5 pages,10 figures, 2 tables, International Journal of Engineering
  Trends and Technology (IJETT) Volume 10 Number 13 Apr 2014","International Journal of Engineering Trends and Technology
  (IJETT), V10(13), 621-625 April 2014. ISSN:2231-5381",10.14445/22315381/IJETT-V10P324,,cs.IT cs.NI math.IT,http://creativecommons.org/licenses/by/3.0/,"  In this paper we estimate the performance of 2*4 MIMO-MC-CDMA system using
convolution code in MATLAB which highly reduces BER. MC-CDMA (Multi Carrier
Code Division for Multiple Access) is a multiuser and multiple access system
which is formed by the combination of OFDM and CDMA and convolution encoding
scheme is used in encoder of CDMA as FEC (Forward Error Correction) code to
reduce BER (Bit Error Rate). MC-CDMA system is a multicarrier system in which
single wideband frequency selective carrier is converted into parallel
narrowband flat fading multiple sub-carriers to optimize the performance of
system. Now this system further improved by combination of 2*4 MIMO (Multiple
Input Multiple Output) system which utilizes ZF (Zero Forcing) decoder at the
receiver to reduce BER and also half rate convolutionally encoded Alamouti STBC
(Space Time Block Code) block code as transmit diversity of MIMO for multiple
transmission of data through multiple transmit antenna. Main advantage of using
MIMO-MC-CDMA using convolution code is to reduce the complexity of system and
to reduce BER with increased gain. In this paper we analyze system performance
in different modulation schemes like, QPSK, 8PSK, 8QAM, 16QAM, 32QAM and 64QAM
in Rayleigh fading channel using MATLAB.
","[{'version': 'v1', 'created': 'Sat, 5 Jul 2014 08:33:11 GMT'}]",2014-07-24,"[['Kushwah', 'Atul Singh', ''], ['Rathore', 'Priya', ''], ['Kumar', 'Ramsewak', '']]","['OFDM', 'CDMA', 'MIMO', 'MIMO-MC-CDMA and']"
2181,0801.3111,Martin Pelikan,Martin Pelikan,"Analysis of Estimation of Distribution Algorithms and Genetic Algorithms
  on NK Landscapes","Also available at the MEDAL web site, http://medal.cs.umsl.edu/","Proceedings of the Genetic and Evolutionary Computation Conference
  (GECCO-2008), ACM Press, 1033-1040",,MEDAL Report No. 2008001,cs.NE cs.AI,,"  This study analyzes performance of several genetic and evolutionary
algorithms on randomly generated NK fitness landscapes with various values of n
and k. A large number of NK problem instances are first generated for each n
and k, and the global optimum of each instance is obtained using the
branch-and-bound algorithm. Next, the hierarchical Bayesian optimization
algorithm (hBOA), the univariate marginal distribution algorithm (UMDA), and
the simple genetic algorithm (GA) with uniform and two-point crossover
operators are applied to all generated instances. Performance of all algorithms
is then analyzed and compared, and the results are discussed.
","[{'version': 'v1', 'created': 'Mon, 21 Jan 2008 00:20:50 GMT'}]",2008-07-30,"[['Pelikan', 'Martin', '']]","['NK fitness landscape', 'hierarchical BOA', 'genetic algorithm', 'branch and bound', 'performance analysis', 'scalability', 'local search', 'crossover']"
2182,1803.04453,Ashkan Yousefpour,"Zygmunt J. Haas, Ashkan Yousefpour",A Privacy Scheme for Monitoring Devices in the Internet of Things,"Appeared in the proceedings of FABULOUS 2016 (2nd EAI International
  Conference on Future Access Enablers of Ubiquitous and Intelligent
  Infrastructures)","In Pervasive Computing Paradigms for Mental Health, pp. 153-165.
  Springer, Cham, 2016",10.1007/978-3-319-74935-8_22,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sufficiently strong security and privacy mechanisms are prerequisite to amass
the promising benefits of the IoT technology and to incorporate this technology
into our daily lives. This paper introduces a novel approach to privacy in
networks, an approach which is especially well matched with the IoT
characteristics. Our general approach is based on continually changing the
identifying attributes of IoT nodes. In particular, the scheme proposed in this
work is based on changing the IoT nodes' IP addresses, and because the changing
patterns of the IP addresses appear random to a non-intended observer, an
adversary is unable to identify the source or destination of a particular
transmission. Thus, packets that carry information generated by a particular
node cannot be linked together. The scheme offers additional security benefits,
including DoS mitigation, is relatively easy to implement, and requires no
changes to the existing networking infrastructure. We discuss the details of
the implementation of the scheme and evaluate its performance.
","[{'version': 'v1', 'created': 'Mon, 12 Mar 2018 18:46:57 GMT'}]",2018-04-19,"[['Haas', 'Zygmunt J.', ''], ['Yousefpour', 'Ashkan', '']]","['Privacy', 'Anonymity', 'IoT', 'Security', 'IP Address Hopping']"
2183,1810.07177,Debesh Choudhury,Debesh Choudhury,"Fourier domain asymmetric cryptosystem for privacy protected multimodal
  biometric security","SPIE Conference Optical Pattern Recognition XXVII, part of SPIE
  Defense + Commercial Sensing, Baltimore, 20-21 April 2016",,10.1117/12.2223927,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a Fourier domain asymmetric cryptosystem for multimodal biometric
security. One modality of biometrics (such as face) is used as the plaintext,
which is encrypted by another modality of biometrics (such as fingerprint). A
private key is synthesized from the encrypted biometric signature by complex
spatial Fourier processing. The encrypted biometric signature is further
encrypted by other biometric modalities, and the corresponding private keys are
synthesized. The resulting biometric signature is privacy protected since the
encryption keys are provided by the human, and hence those are private keys.
Moreover, the decryption keys are synthesized using those private encryption
keys. The encrypted signatures are decrypted using the synthesized private keys
and inverse complex spatial Fourier processing. Computer simulations
demonstrate the feasibility of the technique proposed.
","[{'version': 'v1', 'created': 'Tue, 16 Oct 2018 08:35:28 GMT'}]",2018-10-18,"[['Choudhury', 'Debesh', '']]","['Biometric pattern recognition', 'privacy protection', 'multimodal biometrics', 'asymmetric cryptosystem']"
2184,1911.09018,Carlos Eduardo Cancino-Chac\'on,"Laura Bishop, Carlos Cancino-Chac\'on, Werner Goebl","Moving to Communicate, Moving to Interact: Patterns of Body Motion in
  Musical Duo Performance","32 pages, 10 figures. This version is a final preprint of the paper
  prepared by the authors. Please cite as Bishop, L., Cancino-Chac\'on, C., and
  Goebl, W. (2019). Moving to communicate, moving to interact: Patterns of body
  motion in musical duo performance. Music Perception, 37, 1-25",Music Perception 37 (2019) 1-25,10.1525/mp.2019.37.1.1,,cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Skilled ensemble musicians coordinate with high precision, even when
improvising or interpreting loosely-defined notation. Successful coordination
is supported primarily through shared attention to the musical output; however,
musicians also interact visually, particularly when the musical timing is
irregular. This study investigated the performance conditions that encourage
visual signalling and interaction between ensemble members. Piano and clarinet
duos rehearsed a new piece as their body motion was recorded. Analyses of head
movement showed that performers communicated gesturally following held notes.
Gesture patterns became more consistent as duos rehearsed, though consistency
dropped again during a final performance given under no-visual-contact
conditions. Movements were smoother and interperformer coordination was
stronger during irregularly-timed passages than elsewhere in the piece,
suggesting heightened visual interaction. Performers moved more after
rehearsing than before, and more when they could see each other than when
visual contact was occluded. Periods of temporal instability and increased
familiarity with the music and co-performer seem to encourage visual
interaction, while specific communicative gestures are integrated into
performance routines through rehearsal. We propose that visual interaction may
support successful ensemble performance by affirming coordination throughout
periods of temporal instability and serving as a social motivator to promote
creative risk-taking.
","[{'version': 'v1', 'created': 'Wed, 20 Nov 2019 16:46:23 GMT'}]",2019-11-21,"[['Bishop', 'Laura', ''], ['Cancino-Chacón', 'Carlos', ''], ['Goebl', 'Werner', '']]","['ensemble performance', 'musical interaction', 'communication', 'movement', 'gesture']"
2185,1901.06407,Dmitry Shkatov,Mikhail Rybakov and Dmitry Shkatov,"Complexity and expressivity of propositional dynamic logics with
  finitely many variables",,"Logic Journal of the IGPL, 26(5), 2018, pp. 539--547",10.1093/jigpal/jzy014,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the complexity of satisfiability for finite-variable fragments
of propositional dynamic logics. We consider three formalisms belonging to
three representative complexity classes, broadly understood,---regular PDL,
which is EXPTIME-complete, PDL with intersection, which is 2EXPTIME-complete,
and PDL with parallel composition, which is undecidable. We show that, for each
of these logics, the complexity of satisfiability remains unchanged even if we
only allow as inputs formulas built solely out of propositional constants, i.e.
without propositional variables. Moreover, we show that this is a consequence
of the richness of the expressive power of variable-free fragments: for all the
logics we consider, such fragments are as semantically expressive as entire
logics. We conjecture that this is representative of PDL-style, as well as
closely related, logics.
","[{'version': 'v1', 'created': 'Fri, 18 Jan 2019 20:01:02 GMT'}]",2019-09-16,"[['Rybakov', 'Mikhail', ''], ['Shkatov', 'Dmitry', '']]","['propositional dynamic logic', 'finite-variable fragments', 'satisfiability', 'computational complexity', 'undecidability', 'expressivity']"
2186,1812.04922,Jonathan Andersson,"Jonathan Andersson, H{\aa}kan Ahlstr\""om, Joel Kullberg","Separation of water and fat signal in whole-body gradient echo scans
  using convolutional neural networks","26 pages, 12 figures",,10.1002/mrm.27786,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose: To perform and evaluate water-fat signal separation of whole-body
gradient echo scans using convolutional neural networks.
  Methods: Whole-body gradient echo scans of 240 subjects, each consisting of 5
bipolar echoes, were used. Reference fat fraction maps were created using a
conventional method. Convolutional neural networks, more specifically 2D
U-nets, were trained using 5-fold cross-validation with 1 or several echoes as
input, using the squared difference between the output and the reference fat
fraction maps as the loss function. The outputs of the networks were assessed
by the loss function, measured liver fat fractions, and visually. Training was
performed using a graphics processing unit (GPU). Inference was performed using
the GPU as well as a central processing unit (CPU).
  Results: The loss curves indicated convergence, and the final loss of the
validation data decreased when using more echoes as input. The liver fat
fractions could be estimated using only 1 echo, but results were improved by
use of more echoes. Visual assessment found the quality of the outputs of the
networks to be similar to the reference even when using only 1 echo, with
slight improvements when using more echoes. Training a network took at most
28.6 h. Inference time of a whole-body scan took at most 3.7 s using the GPU
and 5.8 min using the CPU.
  Conclusion: It is possible to perform water-fat signal separation of
whole-body gradient echo scans using convolutional neural networks. Separation
was possible using only 1 echo, although using more echoes improved the
results.
","[{'version': 'v1', 'created': 'Wed, 12 Dec 2018 12:51:12 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Apr 2019 13:08:22 GMT'}]",2019-05-01,"[['Andersson', 'Jonathan', ''], ['Ahlström', 'Håkan', ''], ['Kullberg', 'Joel', '']]","['convolutional neural network', 'deep learning', 'Dixon', 'magnetic resonance imaging', 'neural']"
2187,1008.4166,Sanja Singer,"Sanja Singer, Sasa Singer, Vedran Novakovic, Davor Davidovic, Kresimir
  Bokulic and Aleksandar Uscumlic",Three-Level Parallel J-Jacobi Algorithms for Hermitian Matrices,Submitted for publication,Appl. Math. Comput. 218 (2012) 5704-5725,10.1016/j.amc.2011.11.067,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper describes several efficient parallel implementations of the
one-sided hyperbolic Jacobi-type algorithm for computing eigenvalues and
eigenvectors of Hermitian matrices. By appropriate blocking of the algorithms
an almost ideal load balancing between all available processors/cores is
obtained. A similar blocking technique can be used to exploit local cache
memory of each processor to further speed up the process. Due to diversity of
modern computer architectures, each of the algorithms described here may be the
method of choice for a particular hardware and a given matrix size. All
proposed block algorithms compute the eigenvalues with relative accuracy
similar to the original non-blocked Jacobi algorithm.
","[{'version': 'v1', 'created': 'Tue, 24 Aug 2010 22:13:50 GMT'}]",2020-03-18,"[['Singer', 'Sanja', ''], ['Singer', 'Sasa', ''], ['Novakovic', 'Vedran', ''], ['Davidovic', 'Davor', ''], ['Bokulic', 'Kresimir', ''], ['Uscumlic', 'Aleksandar', '']]","['Hermitan matrices', 'eigenvalues', 'J-Jacobi algorithm', 'parallelization', 'blocking', 'blockstrategies', 'efficiency']"
2188,2102.04527,Michael Stuart,Markus Kneer and Michael T. Stuart,Playing the Blame Game with Robots,"5 pages, 2 figures, 2 tables, HRI'21",,10.1145/3434074.3447202,,cs.HC cs.AI cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Recent research shows -- somewhat astonishingly -- that people are willing to
ascribe moral blame to AI-driven systems when they cause harm [1]-[4]. In this
paper, we explore the moral-psychological underpinnings of these findings. Our
hypothesis was that the reason why people ascribe moral blame to AI systems is
that they consider them capable of entertaining inculpating mental states (what
is called mens rea in the law). To explore this hypothesis, we created a
scenario in which an AI system runs a risk of poisoning people by using a novel
type of fertilizer. Manipulating the computational (or quasi-cognitive)
abilities of the AI system in a between-subjects design, we tested whether
people's willingness to ascribe knowledge of a substantial risk of harm (i.e.,
recklessness) and blame to the AI system. Furthermore, we investigated whether
the ascription of recklessness and blame to the AI system would influence the
perceived blameworthiness of the system's user (or owner). In an experiment
with 347 participants, we found (i) that people are willing to ascribe blame to
AI systems in contexts of recklessness, (ii) that blame ascriptions depend
strongly on the willingness to attribute recklessness and (iii) that the
latter, in turn, depends on the perceived ""cognitive"" capacities of the system.
Furthermore, our results suggest (iv) that the higher the computational
sophistication of the AI system, the more blame is shifted from the human user
to the AI system.
","[{'version': 'v1', 'created': 'Mon, 8 Feb 2021 20:53:42 GMT'}]",2021-02-10,"[['Kneer', 'Markus', ''], ['Stuart', 'Michael T.', '']]","['Moral Judgment', 'Theory of Mind', 'Mens Rea', 'Artificial Intelligence', 'Ethics of AI', 'Recklessness']"
2189,0710.0142,Marco Baldi,Marco Baldi,LDPC codes in the McEliece cryptosystem: attacks and countermeasures,"NATO Advanced Research Workshop 2008: Enhancing Crypto-Primitives
  with Techniques from Coding Theory","NATO Science for Peace and Security Series - D: Information and
  Communication Security, vol. 23, pp. 160-174, IOS Press, 2009. Edited by Bart
  Preneel, Stefan Dodunekov, Vincent Rijmen, Svetla Nikova. ISBN
  978-1-60750-002-5",10.3233/978-1-60750-002-5-160,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The McEliece cryptosystem is a public-key cryptosystem based on coding theory
that has successfully resisted cryptanalysis for thirty years. The original
version, based on Goppa codes, is able to guarantee a high level of security,
and is faster than competing solutions, like RSA. Despite this, it has been
rarely considered in practical applications, due to two major drawbacks: i)
large size of the public key and ii) low transmission rate. Low-Density
Parity-Check (LDPC) codes are state-of-art forward error correcting codes that
permit to approach the Shannon limit while ensuring limited complexity.
Quasi-Cyclic (QC) LDPC codes are a particular class of LDPC codes, able to join
low complexity encoding of QC codes with high-performing and low-complexity
decoding of LDPC codes. In a previous work it has been proposed to adopt a
particular family of QC-LDPC codes in the McEliece cryptosystem to reduce the
key size and increase the transmission rate. Recently, however, new attacks
have been found that are able to exploit a flaw in the transformation from the
private key to the public one. Such attacks can be effectively countered by
changing the form of some constituent matrices, without altering the system
parameters. This work gives an overview of the QC-LDPC codes-based McEliece
cryptosystem and its cryptanalysis. Two recent versions are considered, and
their ability to counter all the currently known attacks is discussed. A third
version able to reach a higher security level is also proposed. Finally, it is
shown that the new QC-LDPC codes-based cryptosystem scales favorably with the
key length.
","[{'version': 'v1', 'created': 'Sun, 30 Sep 2007 14:33:00 GMT'}, {'version': 'v2', 'created': 'Sun, 11 Jan 2009 11:53:29 GMT'}]",2009-10-20,"[['Baldi', 'Marco', '']]","['McEliece Cryptosystem', 'LDPC Codes', 'Cryptanalysis']"
2190,1302.6210,Ratnadip Adhikari,"Ratnadip Adhikari, R. K. Agrawal","A Homogeneous Ensemble of Artificial Neural Networks for Time Series
  Forecasting","8 pages, 4 figures, 2 tables, 26 references, international journal","International Journal of Computer Applications, Vol. 32, No. 7,
  October 2011, pp. 1-8",10.5120/3913-5505,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Enhancing the robustness and accuracy of time series forecasting models is an
active area of research. Recently, Artificial Neural Networks (ANNs) have found
extensive applications in many practical forecasting problems. However, the
standard backpropagation ANN training algorithm has some critical issues, e.g.
it has a slow convergence rate and often converges to a local minimum, the
complex pattern of error surfaces, lack of proper training parameters selection
methods, etc. To overcome these drawbacks, various improved training methods
have been developed in literature; but, still none of them can be guaranteed as
the best for all problems. In this paper, we propose a novel weighted ensemble
scheme which intelligently combines multiple training algorithms to increase
the ANN forecast accuracies. The weight for each training algorithm is
determined from the performance of the corresponding ANN model on the
validation dataset. Experimental results on four important time series depicts
that our proposed technique reduces the mentioned shortcomings of individual
ANN training algorithms to a great extent. Also it achieves significantly
better forecast accuracies than two other popular statistical models.
","[{'version': 'v1', 'created': 'Mon, 25 Feb 2013 20:09:19 GMT'}]",2013-02-27,"[['Adhikari', 'Ratnadip', ''], ['Agrawal', 'R. K.', '']]","['Time Series Forecasting', 'Artificial Neural Network', 'Ensemble', 'Backpropagation', 'Training Algorithm', 'ARIMA', 'Support Vector Machine']"
2191,1112.3173,Achim Tresch,"Ramin Norousi, Stephan Wickles, Thomas Becker, Roland Beckmann, Volker
  J. Schmid, and Achim Tresch","Automatic post-picking improves particle image detection from Cryo-EM
  micrographs","14 pages, 5 figures",Journal of Structural Biology 2013. 182(2),10.1016/j.jsb.2013.02.008,,cs.CV q-bio.BM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cryo-electron microscopy (cryo-EM) studies using single particle
reconstruction is extensively used to reveal structural information of
macromolecular complexes. Aiming at the highest achievable resolution, state of
the art electron microscopes acquire thousands of high-quality images. Having
collected these data, each single particle must be detected and windowed out.
Several fully- or semi-automated approaches have been developed for the
selection of particle images from digitized micrographs. However they still
require laborious manual post processing, which will become the major
bottleneck for next generation of electron microscopes. Instead of focusing on
improvements in automated particle selection from micrographs, we propose a
post-picking step for classifying small windowed images, which are output by
common picking software. A supervised strategy for the classification of
windowed micrograph images into particles and non-particles reduces the manual
workload by orders of magnitude. The method builds on new powerful image
features, and the proper training of an ensemble classifier. A few hundred
training samples are enough to achieve a human-like classification performance.
","[{'version': 'v1', 'created': 'Wed, 14 Dec 2011 11:38:34 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Jan 2012 12:39:20 GMT'}]",2020-05-04,"[['Norousi', 'Ramin', ''], ['Wickles', 'Stephan', ''], ['Becker', 'Thomas', ''], ['Beckmann', 'Roland', ''], ['Schmid', 'Volker J.', ''], ['Tresch', 'Achim', '']]","['Electron Microscopy', 'Particle Picking', 'Machine Learning', 'Classification Ensemble']"
2192,1902.07515,Fabian Kunze,"Yannick Forster, Fabian Kunze, Marc Roth","The Weak Call-By-Value {\lambda}-Calculus is Reasonable for Both Time
  and Space",,,10.1145/3371095,,cs.CC cs.LO cs.PL,http://creativecommons.org/licenses/by/4.0/,"  We study the weak call-by-value $\lambda$-calculus as a model for
computational complexity theory and establish the natural measures for time and
space -- the number of beta-reductions and the size of the largest term in a
computation -- as reasonable measures with respect to the invariance thesis of
Slot and van Emde Boas [STOC~84]. More precisely, we show that, using those
measures, Turing machines and the weak call-by-value $\lambda$-calculus can
simulate each other within a polynomial overhead in time and a constant factor
overhead in space for all computations that terminate in (encodings) of 'true'
or 'false'. We consider this result as a solution to the long-standing open
problem, explicitly posed by Accattoli [ENTCS~18], of whether the natural
measures for time and space of the $\lambda$-calculus are reasonable, at least
in case of weak call-by-value evaluation.
  Our proof relies on a hybrid of two simulation strategies of reductions in
the weak call-by-value $\lambda$-calculus by Turing machines, both of which are
insufficient if taken alone. The first strategy is the most naive one in the
sense that a reduction sequence is simulated precisely as given by the
reduction rules; in particular, all substitutions are executed immediately.
This simulation runs within a constant overhead in space, but the overhead in
time might be exponential. The second strategy is heap-based and relies on
structure sharing, similar to existing compilers of eager functional languages.
This strategy only has a polynomial overhead in time, but the space consumption
might require an additional factor of $\log n$, which is essentially due to the
size of the pointers required for this strategy. Our main contribution is the
construction and verification of a space-aware interleaving of the two
strategies, which is shown to yield both a constant overhead in space and a
polynomial overhead in time.
","[{'version': 'v1', 'created': 'Wed, 20 Feb 2019 11:30:17 GMT'}]",2022-12-09,"[['Forster', 'Yannick', ''], ['Kunze', 'Fabian', ''], ['Roth', 'Marc', '']]","['invariance thesis', 'lambda calculus', 'weak call-by-value reduction', 'time andspace complexity', 'abstract machines']"
2193,1210.3077,Miranda Zhang,"Miranda Zhang, Rajiv Ranjan, Armin Haller, Dimitrios Georgakopoulos,
  Peter Strazdins","Investigating Decision Support Techniques for Automating Cloud Service
  Selection",Accepted by IEEE Cloudcom 2012 - PhD consortium track,,10.1109/CloudCom.2012.6427501,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The compass of Cloud infrastructure services advances steadily leaving users
in the agony of choice. To be able to select the best mix of service offering
from an abundance of possibilities, users must consider complex dependencies
and heterogeneous sets of criteria. Therefore, we present a PhD thesis proposal
on investigating an intelligent decision support system for selecting Cloud
based infrastructure services (e.g. storage, network, CPU).
","[{'version': 'v1', 'created': 'Wed, 10 Oct 2012 22:12:26 GMT'}]",2016-11-18,"[['Zhang', 'Miranda', ''], ['Ranjan', 'Rajiv', ''], ['Haller', 'Armin', ''], ['Georgakopoulos', 'Dimitrios', ''], ['Strazdins', 'Peter', '']]","['Cloud computing', 'service computing', 'operation']"
2194,1108.0330,Remy Haemmerle,R\'emy Haemmerl\'e,(Co-)Inductive semantics for Constraint Handling Rules,17 pages,"Theory and Practice of Logic Programming, 11(4-5): 593-609, 2011",10.1017/S1471068411000196,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we address the problem of defining a fixpoint semantics for
Constraint Handling Rules (CHR) that captures the behavior of both
simplification and propagation rules in a sound and complete way with respect
to their declarative semantics. Firstly, we show that the logical reading of
states with respect to a set of simplification rules can be characterized by a
least fixpoint over the transition system generated by the abstract operational
semantics of CHR. Similarly, we demonstrate that the logical reading of states
with respect to a set of propagation rules can be characterized by a greatest
fixpoint. Then, in order to take advantage of both types of rules without
losing fixpoint characterization, we present an operational semantics with
persistent. We finally establish that this semantics can be characterized by
two nested fixpoints, and we show the resulting language is an elegant
framework to program using coinductive reasoning.
","[{'version': 'v1', 'created': 'Mon, 1 Aug 2011 15:02:43 GMT'}]",2011-08-02,"[['Haemmerlé', 'Rémy', '']]","['CHR', 'coinduction', 'fixpoint', 'declarative semantics', 'persistent constraints']"
2195,1606.07189,Mihajlo Grbovic,"Mihajlo Grbovic, Vladan Radosavljevic, Nemanja Djuric, Narayan
  Bhamidipati, Ananth Nagarajan",Gender and Interest Targeting for Sponsored Post Advertising at Tumblr,"10 pages, 9 figures, Proceedings of the 21th ACM SIGKDD International
  Conference on Knowledge Discovery and Data Mining (KDD 2015), Sydney,
  Australia","Proceedings of the 21th ACM SIGKDD International Conference on
  Knowledge Discovery and Data Mining (KDD 2015), Sydney, Australia",10.1145/2783258.2788616.,,cs.CL cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As one of the leading platforms for creative content, Tumblr offers
advertisers a unique way of creating brand identity. Advertisers can tell their
story through images, animation, text, music, video, and more, and promote that
content by sponsoring it to appear as an advertisement in the streams of Tumblr
users. In this paper we present a framework that enabled one of the key
targeted advertising components for Tumblr, specifically gender and interest
targeting. We describe the main challenges involved in development of the
framework, which include creating the ground truth for training gender
prediction models, as well as mapping Tumblr content to an interest taxonomy.
For purposes of inferring user interests we propose a novel semi-supervised
neural language model for categorization of Tumblr content (i.e., post tags and
post keywords). The model was trained on a large-scale data set consisting of
6.8 billion user posts, with very limited amount of categorized keywords, and
was shown to have superior performance over the bag-of-words model. We
successfully deployed gender and interest targeting capability in Yahoo
production systems, delivering inference for users that cover more than 90% of
daily activities at Tumblr. Online performance results indicate advantages of
the proposed approach, where we observed 20% lift in user engagement with
sponsored posts as compared to untargeted campaigns.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2016 05:03:03 GMT'}]",2016-06-24,"[['Grbovic', 'Mihajlo', ''], ['Radosavljevic', 'Vladan', ''], ['Djuric', 'Nemanja', ''], ['Bhamidipati', 'Narayan', ''], ['Nagarajan', 'Ananth', '']]","['data mining', 'computational advertising', 'audience modeling']"
2196,1405.3410,Tieming Chen,"Tieming Chen, Xu Zhang, Shichao Jin, Okhee Kim","Efficient classification using parallel and scalable compressed model
  and Its application on intrusion detection",,,10.1016/j.eswa.2014.04.009,,cs.LG cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to achieve high efficiency of classification in intrusion detection,
a compressed model is proposed in this paper which combines horizontal
compression with vertical compression. OneR is utilized as horizontal
com-pression for attribute reduction, and affinity propagation is employed as
vertical compression to select small representative exemplars from large
training data. As to be able to computationally compress the larger volume of
training data with scalability, MapReduce based parallelization approach is
then implemented and evaluated for each step of the model compression process
abovementioned, on which common but efficient classification methods can be
directly used. Experimental application study on two publicly available
datasets of intrusion detection, KDD99 and CMDC2012, demonstrates that the
classification using the compressed model proposed can effectively speed up the
detection procedure at up to 184 times, most importantly at the cost of a
minimal accuracy difference with less than 1% on average.
","[{'version': 'v1', 'created': 'Wed, 14 May 2014 08:47:31 GMT'}]",2014-05-15,"[['Chen', 'Tieming', ''], ['Zhang', 'Xu', ''], ['Jin', 'Shichao', ''], ['Kim', 'Okhee', '']]","['Compressed model', 'MapReduce', 'Parallelization', 'Classification', 'Intrusion Detection']"
2197,1901.00534,Anna Smagina Mrs,"Anna Smagina, Valentina Bozhkova, Sergey Gladilin, Dmitry Nikolaev",Linear colour segmentation revisited,,"Proc. SPIE 11041, Eleventh International Conference on Machine
  Vision (ICMV 2018)",10.1117/12.2523007,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we discuss the known algorithms for linear colour segmentation
based on a physical approach and propose a new modification of segmentation
algorithm. This algorithm is based on a region adjacency graph framework
without a pre-segmentation stage. Proposed edge weight functions are defined
from linear image model with normal noise. The colour space projective
transform is introduced as a novel pre-processing technique for better handling
of shadow and highlight areas. The resulting algorithm is tested on a benchmark
dataset consisting of the images of 19 natural scenes selected from the
Barnard's DXC-930 SFU dataset and 12 natural scene images newly published for
common use. The dataset is provided with pixel-by-pixel ground truth colour
segmentation for every image. Using this dataset, we show that the proposed
algorithm modifications lead to qualitative advantages over other model-based
segmentation algorithms, and also show the positive effect of each proposed
modification. The source code and datasets for this work are available for free
access at http://github.com/visillect/segmentation.
","[{'version': 'v1', 'created': 'Wed, 2 Jan 2019 21:06:55 GMT'}]",2019-03-26,"[['Smagina', 'Anna', ''], ['Bozhkova', 'Valentina', ''], ['Gladilin', 'Sergey', ''], ['Nikolaev', 'Dmitry', '']]","['colour segmentation', 'colour space', 'colour homography', 'clusterisation']"
2198,1812.05556,Liane Gabora,"Steve DiPaola, Liane Gabora, and Graeme McCaig","Informing Artificial Intelligence Generative Techniques using Cognitive
  Theories of Human Creativity","18 pages; 6 figures. arXiv admin note: substantial text overlap with
  arXiv:1610.02478","Procedia Computer Science, vol. 145 (pp. 158-168). Amsterdam:
  Elsevier (2018)",10.1016/j.procs.2018.11.024,,cs.AI cs.LG q-bio.NC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The common view that our creativity is what makes us uniquely human suggests
that incorporating research on human creativity into generative deep learning
techniques might be a fruitful avenue for making their outputs more compelling
and human-like. Using an original synthesis of Deep Dream-based convolutional
neural networks and cognitive based computational art rendering systems, we
show how honing theory, intrinsic motivation, and the notion of a 'seed
incident' can be implemented computationally, and demonstrate their impact on
the resulting generative art. Conversely, we discuss how explorations in deep
learn-ing convolutional neural net generative systems can inform our
understanding of human creativity. We conclude with ideas for further
cross-fertilization between AI based computational creativity and psychology of
creativity.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2018 18:12:44 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Jul 2019 21:00:09 GMT'}]",2019-07-09,"[['DiPaola', 'Steve', ''], ['Gabora', 'Liane', ''], ['McCaig', 'Graeme', '']]","['Deep learning', 'computational creativity', 'cognitive science']"
2199,1603.00572,Kamlesh Hingwe,Kamlesh Kumar Hingwe and S. Mary Saira Bhanu,"Hierarchical Role-Based Access Control with Homomorphic Encryption for
  Database as a Service","11 Pages,4 figures, Proceedings of International Conference on ICT
  for Sustainable Development",,10.1007/978-981-10-0135-2_43,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Database as a service provides services for accessing and managing customers
data which provides ease of access, and the cost is less for these services.
There is a possibility that the DBaaS service provider may not be trusted, and
data may be stored on untrusted server. The access control mechanism can
restrict users from unauthorized access, but in cloud environment access
control policies are more flexible. However, an attacker can gather sensitive
information for a malicious purpose by abusing the privileges as another user
and so database security is compromised. The other problems associated with the
DBaaS are to manage role hierarchy and secure session management for query
transaction in the database. In this paper, a role-based access control for the
multitenant database with role hierarchy is proposed. The query is granted with
least access privileges, and a session key is used for session management. The
proposed work protects data from privilege escalation and SQL injection. It
uses the partial homomorphic encryption (Paillier Encryption) for the
encrypting the sensitive data. If a query is to perform any operation on
sensitive data, then extra permissions are required for accessing sensitive
data. Data confidentiality and integrity are achieved using the role-based
access control with partial homomorphic encryption.
","[{'version': 'v1', 'created': 'Wed, 2 Mar 2016 04:22:31 GMT'}]",2016-03-03,"[['Hingwe', 'Kamlesh Kumar', ''], ['Bhanu', 'S. Mary Saira', '']]","['Cloud Computing', 'Access Control', 'Multi-tenant Database', 'DBaaS', 'Database Security']"
2200,2208.14748,Filippo Carnovalini,"Filippo Carnovalini, Antonio Rod\`a and Paolo Caneva","A Musical Serious Game for Social Interaction through Augmented Rhythmic
  Improvisation",,"In EAI International Conference on Smart Objects and Technologies
  for Social Good (GoodTechs '19), September 25--27, 2019, Valencia, Spain.
  ACM, New York, NY, USA, 6 pages",10.1145/3342428.3342683,,cs.MM cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Making music with other people is a social activity as well as an artistic
one. Music therapists take advantage of the social aspects of music to obtain
benefits for the patients, interacting with them musically, but this activity
requires an high level of expertise. We propose a serious game that helps
people even without musical skills interact with each other by collaboratively
creating a rhythm with MIDI drum pads. The gaming system analyzes the rhythm in
real time to add a musical feedback that enhances the aesthetical experience
that is a crucial part of the musical interaction. The system is evaluated
through a questionnaire asking subjects who tried in couples the system if they
perceived it as helping their interaction. Despite the early development stage
of the game, the results of the questionnaire show positive reception.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2022 09:49:59 GMT'}]",2022-09-01,"[['Carnovalini', 'Filippo', ''], ['Rodà', 'Antonio', ''], ['Caneva', 'Paolo', '']]","['serious games', 'music therapy', 'music interaction']"
2201,1904.03669,Ludger Paehler,Stephan Thaler and Ludger Paehler and Nikolaus A. Adams,Sparse Identification of Truncation Errors,"25 pages, 26 figures, 3 tables, submitted to the Journal of
  Computional Physics, ""code available at
  https://github.com/tumaer/truncationerror"", Stephan Thaler and Ludger Paehler
  share first authorship",,10.1016/j.jcp.2019.07.049,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work presents a data-driven approach to the identification of spatial
and temporal truncation errors for linear and nonlinear discretization schemes
of Partial Differential Equations (PDEs). Motivated by the central role of
truncation errors, for example in the creation of implicit Large Eddy schemes,
we introduce the Sparse Identification of Truncation Errors (SITE) framework to
automatically identify the terms of the modified differential equation from
simulation data. We build on recent advances in the field of data-driven
discovery and control of complex systems and combine it with classical work on
modified differential equation analysis of Warming, Hyett, Lerat and Peyret. We
augment a sparse regression-rooted approach with appropriate preconditioning
routines to aid in the identification of the individual modified differential
equation terms. The construction of such a custom algorithm pipeline allows
attenuating of multicollinearity effects as well as automatic tuning of the
sparse regression hyperparameters using the Bayesian information criterion
(BIC). As proof of concept, we constrain the analysis to finite difference
schemes and leave other numerical schemes open for future inquiry. Test cases
include the linear advection equation with a forward-time, backward-space
discretization, the Burgers' equation with a MacCormack predictor-corrector
scheme and the Korteweg-de Vries equation with a Zabusky and Kruska
discretization scheme. Based on variation studies, we derive guidelines for the
selection of discretization parameters, preconditioning approaches and sparse
regression algorithms. The results showcase highly accurate predictions
underlining the promise of SITE for the analysis and optimization of
discretization schemes, where analytic derivation of modified differential
equations is infeasible.
","[{'version': 'v1', 'created': 'Sun, 7 Apr 2019 15:23:00 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Apr 2019 14:26:27 GMT'}]",2019-09-04,"[['Thaler', 'Stephan', ''], ['Paehler', 'Ludger', ''], ['Adams', 'Nikolaus A.', '']]","['Sparse Regression', 'Truncation Error', 'Modified Differential Equation Analysis', 'Data-drivenScientific Computing', 'Preconditioning']"
2202,1507.03360,Kedar Khare,"Charu Gaur, Baranidharan Mohan, and Kedar Khare",Sparsity assisted solution to the twin image problem in phase retrieval,,,10.1364/JOSAA.32.001922,,cs.CV physics.optics,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The iterative phase retrieval problem for complex-valued objects from Fourier
transform magnitude data is known to suffer from the twin image problem. In
particular, when the object support is centro-symmetric, the iterative solution
often stagnates such that the resultant complex image contains the features of
both the desired solution and its inverted and complex-conjugated replica. The
conventional approach to address the twin image problem is to modify the object
support during initial iterations which can possibly lead to elimination of one
of the twin images. However, at present there seems to be no deterministic
procedure to make sure that the twin image will always be very weak or absent.
In this work we make an important observation that the ideal solution without
the twin image is typically more sparse (in some suitable transform domain) as
compared to the stagnated solution containing the twin image. We further show
that introducing a sparsity enhancing step in the iterative algorithm can
address the twin image problem without the need to change the object support
throughout the iterative process even when the object support is
centro-symmetric. In a simulation study, we use binary and gray-scale pure
phase objects and illustrate the effectiveness of the sparsity assisted phase
recovery in the context of the twin image problem. The results have important
implications for a wide range of topics in Physics where the phase retrieval
problem plays a central role.
","[{'version': 'v1', 'created': 'Mon, 13 Jul 2015 08:52:03 GMT'}]",2015-10-28,"[['Gaur', 'Charu', ''], ['Mohan', 'Baranidharan', ''], ['Khare', 'Kedar', '']]","['Phase retrieval', 'image formation and processing', 'phase imaging', 'image sparsity']"
2203,1907.09402,Carmine Dodaro,"Giovanni Amendola, Carmine Dodaro, Marco Maratea",Abstract Solvers for Computing Cautious Consequences of ASP programs,"Paper presented at the 35th International Conference on Logic
  Programming (ICLP 2019), Las Cruces, New Mexico, USA, 20-25 September 2019,
  20 pages",Theory and Practice of Logic Programming 19 (2019) 740-756,10.1017/S1471068419000164,,cs.LO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Abstract solvers are a method to formally analyze algorithms that have been
profitably used for describing, comparing and composing solving techniques in
various fields such as Propositional Satisfiability (SAT), Quantified SAT,
Satisfiability Modulo Theories, Answer Set Programming (ASP), and Constraint
ASP. In this paper, we design, implement and test novel abstract solutions for
cautious reasoning tasks in ASP. We show how to improve the current abstract
solvers for cautious reasoning in ASP with new techniques borrowed from
backbone computation in SAT, in order to design new solving algorithms. By
doing so, we also formally show that the algorithms for solving cautious
reasoning tasks in ASP are strongly related to those for computing backbones of
Boolean formulas. We implement some of the new solutions in the ASP solver WASP
and show that their performance are comparable to state-of-the-art solutions on
the benchmark problems from the past ASP Competitions. Under consideration for
acceptance in TPLP.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2019 16:25:11 GMT'}]",2020-02-19,"[['Amendola', 'Giovanni', ''], ['Dodaro', 'Carmine', ''], ['Maratea', 'Marco', '']]","['Answer Set Programming', 'Abstract solvers', 'Cautious reasoning']"
2204,1511.01303,Fabien Mathieu,"Fran\c{c}ois Durand (LINCS, GANG), Beno\^it Kloeckner (LAMA), Fabien
  Mathieu (LINCS), Ludovic Noirie (LINCS)",Geometry on the Utility Space,"in Fourth International Conference on Algorithmic Decision Theory,
  Sep 2015, Lexington, United States. pp.16, 2015, Fourth International
  Conference on Algorithmic Decision Theory",,10.1007/978-3-319-23114-3_12,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the geometrical properties of the utility space (the space of
expected utilities over a finite set of options), which is commonly used to
model the preferences of an agent in a situation of uncertainty. We focus on
the case where the model is neutral with respect to the available options, i.e.
treats them, a priori, as being symmetrical from one another. Specifically, we
prove that the only Riemannian metric that respects the geometrical properties
and the natural symmetries of the utility space is the round metric. This
canonical metric allows to define a uniform probability over the utility space
and to naturally generalize the Impartial Culture to a model with expected
utilities.
","[{'version': 'v1', 'created': 'Wed, 4 Nov 2015 12:29:12 GMT'}]",2015-11-05,"[['Durand', 'François', '', 'LINCS, GANG'], ['Kloeckner', 'Benoît', '', 'LAMA'], ['Mathieu', 'Fabien', '', 'LINCS'], ['Noirie', 'Ludovic', '', 'LINCS']]","['Utility theory', 'Geometry', 'Impartial culture', 'Voting']"
2205,1903.09393,Anil Yaman,"Anil Yaman, Giovanni Iacca, Decebal Constantin Mocanu, George
  Fletcher, Mykola Pechenizkiy",Learning with Delayed Synaptic Plasticity,GECCO2019,,10.1145/3321707.3321723,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The plasticity property of biological neural networks allows them to perform
learning and optimize their behavior by changing their configuration. Inspired
by biology, plasticity can be modeled in artificial neural networks by using
Hebbian learning rules, i.e. rules that update synapses based on the neuron
activations and reinforcement signals. However, the distal reward problem
arises when the reinforcement signals are not available immediately after each
network output to associate the neuron activations that contributed to
receiving the reinforcement signal. In this work, we extend Hebbian plasticity
rules to allow learning in distal reward cases. We propose the use of neuron
activation traces (NATs) to provide additional data storage in each synapse to
keep track of the activation of the neurons. Delayed reinforcement signals are
provided after each episode relative to the networks' performance during the
previous episode. We employ genetic algorithms to evolve delayed synaptic
plasticity (DSP) rules and perform synaptic updates based on NATs and delayed
reinforcement signals. We compare DSP with an analogous hill climbing algorithm
that does not incorporate domain knowledge introduced with the NATs, and show
that the synaptic updates performed by the DSP rules demonstrate more effective
training performance relative to the HC algorithm.
","[{'version': 'v1', 'created': 'Fri, 22 Mar 2019 08:03:02 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Apr 2019 19:27:23 GMT'}]",2020-12-21,"[['Yaman', 'Anil', ''], ['Iacca', 'Giovanni', ''], ['Mocanu', 'Decebal Constantin', ''], ['Fletcher', 'George', ''], ['Pechenizkiy', 'Mykola', '']]","['Evolving plastic artificial neural networks', 'Hebbian learning', 'delayed plasticity', 'distal reward problem']"
2206,2008.07561,Cheng-Shang Chang,"Che-Hao Yu, Lin Huang, Cheng-Shang Chang, and Duan-Shin Lee","Poisson Receivers: a Probabilistic Framework for Analyzing Coded Random
  Access",,"IEEE/ACM Transactions on Networking, Volume: 29, Issue: 2, pp. 862
  - 875, April 2021",10.1109/TNET.2021.3050485,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we develop a probabilistic framework for analyzing coded
random access. Our framework is based on a new abstract receiver (decoder),
called a Poisson receiver, that is characterized by a success probability
function of a tagged packet subject to a Poisson offered load. We show that
various coded slotted ALOHA (CSA) systems are Poisson receivers. Moreover,
Poisson receivers have two elegant closure properties: (i) Poisson receivers
with packet routing are still Poisson receivers, and (ii) Poisson receivers
with packet coding are still Poisson receivers. These two closure properties
enable us to use smaller Poisson receivers as building blocks for analyzing a
larger Poisson receiver. As such, we can analyze complicated systems that are
not possible by the classical tree evaluation method. In particular, for CSA
systems with both spatial diversity and temporal diversity, we can use the
framework of Poisson receivers to compute the exact (asymptotic) throughput. We
demonstrate that our framework can be used to provide differentiated services
between ultra-reliable low-latency communication (URLLC) traffic and enhanced
mobile broadband (eMBB) traffic. By conducting extensive simulations, we also
verify that our theoretical results match extremely well with the simulation
results.
","[{'version': 'v1', 'created': 'Mon, 17 Aug 2020 18:16:42 GMT'}]",2021-07-23,"[['Yu', 'Che-Hao', ''], ['Huang', 'Lin', ''], ['Chang', 'Cheng-Shang', ''], ['Lee', 'Duan-Shin', '']]","['multiple access', 'ALOHA', 'successive interference cancellation', 'ultra-reliable low-latency communications']"
2207,1308.6056,Surya Prasath,"Juan C. Moreno, V. B. S. Prasath, Hugo Proenca, K. Palaniappan","Brain MRI Segmentation with Fast and Globally Convex Multiphase Active
  Contours",,"Computer Vision and Image Understanding, 125, 237-250, 2014",10.1016/j.cviu.2014.04.010,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multiphase active contour based models are useful in identifying multiple
regions with different characteristics such as the mean values of regions. This
is relevant in brain magnetic resonance images (MRIs), allowing the
differentiation of white matter against gray matter. We consider a well defined
globally convex formulation of Vese and Chan multiphase active contour model
for segmenting brain MRI images. A well-established theory and an efficient
dual minimization scheme are thoroughly described which guarantees optimal
solutions and provides stable segmentations. Moreover, under the dual
minimization implementation our model perfectly describes disjoint regions by
avoiding local minima solutions. Experimental results indicate that the
proposed approach provides better accuracy than other related multiphase active
contour algorithms even under severe noise, intensity inhomogeneities, and
partial volume effects.
","[{'version': 'v1', 'created': 'Wed, 28 Aug 2013 04:48:00 GMT'}]",2014-12-16,"[['Moreno', 'Juan C.', ''], ['Prasath', 'V. B. S.', ''], ['Proenca', 'Hugo', ''], ['Palaniappan', 'K.', '']]","['Image segmentation', 'active contours', 'multiphase', 'globally convex', 'dual formulation', 'brain']"
2208,1507.06873,Luiz Capretz Dr.,"Faheem Ahmed, Luiz Fernando Capretz, Salah Bouktif, Piers Campbell","Soft Skills and Software Development: A Reflection from the Software
  Industry",,"International Journal of Information Processing and Management,
  4(3):171-191, 2013",10.4156/ijipm.vol14.issue3.17,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We review the literature relating to soft skills and the software engineering
and information systems domain before describing a study based on 650 job
advertisements posted on well-known recruitment sites from a range of
geographical locations including, North America, Europe, Asia and Australia.
The study makes use of nine defined soft skills to assess the level of demand
for each of these skills related to individual job roles within the software
industry. This work reports some of the vital statistics from industry about
the requirements of soft skills in various roles of software development
phases. The work also highlights the variation in the types of skills required
for each of the roles. We found that currently although the software industry
is paying attention to soft skills up to some extent while hiring but there is
a need to further acknowledge the role of these skills in software development.
The objective of this paper is to analyze the software industry soft skills
requirements for various software development positions, such as system
analyst, designer, programmer, and tester. We pose two research questions,
namely, (1) What soft skills are appropriate to different software development
lifecycle roles, and (2) Up to what extend does the software industry consider
soft skills when hiring an employee. The study suggests that there is a further
need of acknowledgment of the significance of soft skills from employers in
software industry.
","[{'version': 'v1', 'created': 'Fri, 24 Jul 2015 15:05:27 GMT'}]",2015-07-27,"[['Ahmed', 'Faheem', ''], ['Capretz', 'Luiz Fernando', ''], ['Bouktif', 'Salah', ''], ['Campbell', 'Piers', '']]","['Information Systems', 'Soft Skills', 'Employment', 'Human Factors', 'People Skills', 'Software Industry', 'Empirical Study', 'Diversity in Information System']"
2209,1901.08242,Taewon Kang,"Taewon Kang, Kwang Hee Lee",Unsupervised Image-to-Image Translation with Self-Attention Networks,"Accepted by 2020 IEEE International Conference on Big Data and Smart
  Computing (IEEE BigComp 2020). This paper has been accepted as a REGULAR
  paper presented at IEEE International Conference on BigComp 2020. 7 pages, 11
  figures; v4: corrected typos, figures","2020 IEEE International Conference on Big Data and Smart Computing
  (BigComp), (2020), 102-108",10.1109/BigComp48618.2020.00-92,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Unsupervised image translation aims to learn the transformation from a source
domain to another target domain given unpaired training data. Several
state-of-the-art works have yielded impressive results in the GANs-based
unsupervised image-to-image translation. It fails to capture strong geometric
or structural changes between domains, or it produces unsatisfactory result for
complex scenes, compared to local texture mapping tasks such as style transfer.
Recently, SAGAN (Han Zhang, 2018) showed that the self-attention network
produces better results than the convolution-based GAN. However, the
effectiveness of the self-attention network in unsupervised image-to-image
translation tasks have not been verified. In this paper, we propose an
unsupervised image-to-image translation with self-attention networks, in which
long range dependency helps to not only capture strong geometric change but
also generate details using cues from all feature locations. In experiments, we
qualitatively and quantitatively show superiority of the proposed method
compared to existing state-of-the-art unsupervised image-to-image translation
task. The source code and our results are online:
https://github.com/itsss/img2img_sa and
http://itsc.kr/2019/01/24/2019_img2img_sa
","[{'version': 'v1', 'created': 'Thu, 24 Jan 2019 05:59:40 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Apr 2019 08:28:44 GMT'}, {'version': 'v3', 'created': 'Mon, 26 Aug 2019 11:11:43 GMT'}, {'version': 'v4', 'created': 'Mon, 20 Apr 2020 15:56:06 GMT'}]",2020-04-21,"[['Kang', 'Taewon', ''], ['Lee', 'Kwang Hee', '']]","['Generative Adversarial Networks', 'Image-to-ImageTranslation', 'Self-Attention Networks']"
2210,1802.07476,Benjamin Sliwa,"Johannes Pillmann and Benjamin Sliwa and Christian Kastin and
  Christian Wietfeld","Empirical evaluation of predictive channel-aware transmission for
  resource efficient car-to-cloud communication",,"Vehicular Networking Conference (VNC), 2017 IEEE",10.1109/VNC.2017.8275635,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays vehicles are by default equipped with communication hardware. This
enables new possibilities of connected services, like vehicles serving as
highly mobile sensor platforms in the Internet of Things (IoT) context. Hereby,
cars need to upload and transfer their data via a mobile communication network
into the cloud for further evaluation. As wireless resources are limited and
shared by all users, data transfers need to be conducted efficiently. Within
the scope of this work three car-to-cloud data transmission algorithms
Channel-Aware Transmission (CAT), predictive CAT (pCAT) and a periodic scheme
are evaluated in an empirical setup. CAT leverages channel quality measurements
to start data uploads preferably when the channel quality is good. CAT's
extension pCAT uses past measurements in addition to estimate future channel
conditions. For the empirical evaluation, a research vehicle was equipped with
a measurement platform. On test drives along a reference route vehicle sensor
data was collected and subsequently uploaded to a cloud server via a Long Term
Evolution (LTE) network.
","[{'version': 'v1', 'created': 'Wed, 21 Feb 2018 09:24:20 GMT'}]",2018-02-22,"[['Pillmann', 'Johannes', ''], ['Sliwa', 'Benjamin', ''], ['Kastin', 'Christian', ''], ['Wietfeld', 'Christian', '']]","['Car-to-Cloud', 'Internet of Things', 'Data Offloading', 'Channel-Aware Transmission', 'Long Term Evolution']"
2211,1201.1613,Cyril Voyant,"Cyril Voyant (SPE, CHD Castellucio), Marc Muselli (SPE), Christophe
  Paoli (SPE), Marie Laure Nivet (SPE)","Numerical Weather Prediction (NWP) and hybrid ARMA/ANN model to predict
  global radiation",Energy (2012) 1,,10.1016/j.energy.2012.01.006,,cs.NE physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose in this paper an original technique to predict global radiation
using a hybrid ARMA/ANN model and data issued from a numerical weather
prediction model (ALADIN). We particularly look at the Multi-Layer Perceptron.
After optimizing our architecture with ALADIN and endogenous data previously
made stationary and using an innovative pre-input layer selection method, we
combined it to an ARMA model from a rule based on the analysis of hourly data
series. This model has been used to forecast the hourly global radiation for
five places in Mediterranean area. Our technique outperforms classical models
for all the places. The nRMSE for our hybrid model ANN/ARMA is 14.9% compared
to 26.2% for the na\""ive persistence predictor. Note that in the stand alone
ANN case the nRMSE is 18.4%. Finally, in order to discuss the reliability of
the forecaster outputs, a complementary study concerning the confidence
interval of each prediction is proposed
","[{'version': 'v1', 'created': 'Sun, 8 Jan 2012 07:04:36 GMT'}]",2012-01-10,"[['Voyant', 'Cyril', '', 'SPE, CHD Castellucio'], ['Muselli', 'Marc', '', 'SPE'], ['Paoli', 'Christophe', '', 'SPE'], ['Nivet', 'Marie Laure', '', 'SPE']]","['Time Series forecasting', 'hybrid', 'Artificial Neural Networks', 'ARMA', 'Stationarity']"
2212,1804.08316,Josu Goikoetxea,"J.Goikoetxea, A.Soroa, E.Agirre",Bilingual Embeddings with Random Walks over Multilingual Wordnets,"Preprint version, Knowledge-Based Systems (ISSN: 0950-7051). (2018)",,10.1016/j.knosys.2018.03.017,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bilingual word embeddings represent words of two languages in the same space,
and allow to transfer knowledge from one language to the other without machine
translation. The main approach is to train monolingual embeddings first and
then map them using bilingual dictionaries. In this work, we present a novel
method to learn bilingual embeddings based on multilingual knowledge bases (KB)
such as WordNet. Our method extracts bilingual information from multilingual
wordnets via random walks and learns a joint embedding space in one go. We
further reinforce cross-lingual equivalence adding bilingual con- straints in
the loss function of the popular skipgram model. Our experiments involve twelve
cross-lingual word similarity and relatedness datasets in six lan- guage pairs
covering four languages, and show that: 1) random walks over mul- tilingual
wordnets improve results over just using dictionaries; 2) multilingual wordnets
on their own improve over text-based systems in similarity datasets; 3) the
good results are consistent for large wordnets (e.g. English, Spanish), smaller
wordnets (e.g. Basque) or loosely aligned wordnets (e.g. Italian); 4) the
combination of wordnets and text yields the best results, above mapping-based
approaches. Our method can be applied to richer KBs like DBpedia or Babel- Net,
and can be easily extended to multilingual embeddings. All software and
resources are open source.
","[{'version': 'v1', 'created': 'Mon, 23 Apr 2018 10:02:29 GMT'}]",2018-04-24,"[['Goikoetxea', 'J.', ''], ['Soroa', 'A.', ''], ['Agirre', 'E.', '']]","['multilinguality', 'distributional semantics', 'embeddings', 'random']"
2213,1005.1747,Secretary Aircc Journal,"Salman Abdul Moiz (1) and Lakshmi Rajamani (2), ((1) Centre for
  Development of Advanced Computing, India, (2) Osmania University, India)","A Real Time Optimistic Strategy to achieve Concurrency Control in Mobile
  Environments Using On-demand Multicasting","14 Pages, IJWMN","International Journal of Wireless & Mobile Networks 2.2 (2010)
  172-185",10.5121/ijwmn.2010.2212,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In mobile database environments, multiple users may access similar data items
irrespective of their physical location leading to concurrent access anomalies.
As disconnections and mobility are the common characteristics in mobile
environment, performing concurrent access to a particular data item leads to
inconsistency. Most of the approaches use locking mechanisms to achieve
concurrency control. However this leads to increase in blocking and abort rate.
In this paper an optimistic concurrency control strategy using on-demand
multicasting is proposed for mobile database environments which guarantees
consistency and introduces application-specific conflict detection and
resolution strategies. The simulation results specify increase in system
throughput by reducing the transaction abort rates as compared to the other
optimistic strategies proposed in literature.
","[{'version': 'v1', 'created': 'Tue, 11 May 2010 08:17:36 GMT'}]",2010-07-15,"[['Moiz', 'Salman Abdul', ''], ['Rajamani', 'Lakshmi', '']]","['Concurrency Control', 'Serializability', 'Mobile Host', 'Fixed Host', 'Conflict detection & resolution']"
2214,1408.5405,Khalid Raza,Khalid Raza and Mansaf Alam,Recurrent Neural Network Based Hybrid Model of Gene Regulatory Network,"18 pages, 9 figures and 4 tables","Computational Biology and Chemistry, 64: 322-334, 2016",10.1016/j.compbiolchem.2016.08.002,,cs.NE cs.CE q-bio.MN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Systems biology is an emerging interdisciplinary area of research that
focuses on study of complex interactions in a biological system, such as gene
regulatory networks. The discovery of gene regulatory networks leads to a wide
range of applications, such as pathways related to a disease that can unveil in
what way the disease acts and provide novel tentative drug targets. In
addition, the development of biological models from discovered networks or
pathways can help to predict the responses to disease and can be much useful
for the novel drug development and treatments. The inference of regulatory
networks from biological data is still in its infancy stage. This paper
proposes a recurrent neural network (RNN) based gene regulatory network (GRN)
model hybridized with generalized extended Kalman filter for weight update in
backpropagation through time training algorithm. The RNN is a complex neural
network that gives a better settlement between the biological closeness and
mathematical flexibility to model GRN. The RNN is able to capture complex,
non-linear and dynamic relationship among variables. Gene expression data are
inherently noisy and Kalman filter performs well for estimation even in noisy
data. Hence, non-linear version of Kalman filter, i.e., generalized extended
Kalman filter has been applied for weight update during network training. The
developed model has been applied on DNA SOS repair network, IRMA network, and
two synthetic networks from DREAM Challenge. We compared our results with other
state-of-the-art techniques that show superiority of our model. Further, 5%
Gaussian noise has been added in the dataset and result of the proposed model
shows negligible effect of noise on the results.
","[{'version': 'v1', 'created': 'Fri, 22 Aug 2014 18:35:27 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Nov 2015 12:38:53 GMT'}]",2016-10-13,"[['Raza', 'Khalid', ''], ['Alam', 'Mansaf', '']]","['Recurrent Neural Network', 'Gene Regulatory Network Model', 'Gene Expression', 'Kalman Filter']"
2215,1305.0191,Chantal Cherifi,"Chantal Cherifi, Vincent Labatut, Jean-Fran\c{c}ois Santucci","Benefits of Semantics on Web Service Composition from a Complex Network
  Perspective",,"In International Conference on Networked Digital Technologies, pp
  80-90, Springer CCIS, Czech Republic (2010)",10.1007/978-3-642-14306-9_9,,cs.SI cs.AI cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The number of publicly available Web services (WS) is continuously growing,
and in parallel, we are witnessing a rapid development in semantic-related web
technologies. The intersection of the semantic web and WS allows the
development of semantic WS. In this work, we adopt a complex network
perspective to perform a comparative analysis of the syntactic and semantic
approaches used to describe WS. From a collection of publicly available WS
descriptions, we extract syntactic and semantic WS interaction networks. We
take advantage of tools from the complex network field to analyze them and
determine their properties. We show that WS interaction networks exhibit some
of the typical characteristics observed in real-world networks, such as short
average distance between nodes and community structure. By comparing syntactic
and semantic networks through their properties, we show the introduction of
semantics in WS descriptions should improve the composition process.
","[{'version': 'v1', 'created': 'Wed, 1 May 2013 14:56:33 GMT'}]",2015-02-04,"[['Cherifi', 'Chantal', ''], ['Labatut', 'Vincent', ''], ['Santucci', 'Jean-François', '']]","['Web Services', 'Service Composition', 'Complex Networks', 'Interaction Networks', 'Semantic Web']"
2216,1603.01977,Maurice Chandoo,Maurice Chandoo,On the Implicit Graph Conjecture,"13 pages, MFCS 2016",,10.4230/LIPIcs.MFCS.2016.23,,cs.CC cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The implicit graph conjecture states that every sufficiently small,
hereditary graph class has a labeling scheme with a polynomial-time computable
label decoder. We approach this conjecture by investigating classes of label
decoders defined in terms of complexity classes such as P and EXP. For
instance, GP denotes the class of graph classes that have a labeling scheme
with a polynomial-time computable label decoder. Until now it was not even
known whether GP is a strict subset of GR. We show that this is indeed the case
and reveal a strict hierarchy akin to classical complexity. We also show that
classes such as GP can be characterized in terms of graph parameters. This
could mean that certain algorithmic problems are feasible on every graph class
in GP. Lastly, we define a more restrictive class of label decoders using
first-order logic that already contains many natural graph classes such as
forests and interval graphs. We give an alternative characterization of this
class in terms of directed acyclic graphs. By showing that some small,
hereditary graph class cannot be expressed with such label decoders a weaker
form of the implicit graph conjecture could be disproven.
","[{'version': 'v1', 'created': 'Mon, 7 Mar 2016 08:55:26 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Apr 2016 12:29:23 GMT'}, {'version': 'v3', 'created': 'Mon, 20 Jun 2016 09:27:02 GMT'}]",2018-02-02,"[['Chandoo', 'Maurice', '']]","['adjacency labeling scheme', 'complexity classes', 'diagonalization', 'logic']"
2217,1704.06369,Feng Wang,"Feng Wang, Xiang Xiang, Jian Cheng, Alan L. Yuille",NormFace: L2 Hypersphere Embedding for Face Verification,camera-ready version,,10.1145/3123266.3123359,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Thanks to the recent developments of Convolutional Neural Networks, the
performance of face verification methods has increased rapidly. In a typical
face verification method, feature normalization is a critical step for boosting
performance. This motivates us to introduce and study the effect of
normalization during training. But we find this is non-trivial, despite
normalization being differentiable. We identify and study four issues related
to normalization through mathematical analysis, which yields understanding and
helps with parameter settings. Based on this analysis we propose two strategies
for training using normalized features. The first is a modification of softmax
loss, which optimizes cosine similarity instead of inner-product. The second is
a reformulation of metric learning by introducing an agent vector for each
class. We show that both strategies, and small variants, consistently improve
performance by between 0.2% to 0.4% on the LFW dataset based on two models.
This is significant because the performance of the two models on LFW dataset is
close to saturation at over 98%. Codes and models are released on
https://github.com/happynear/NormFace
","[{'version': 'v1', 'created': 'Fri, 21 Apr 2017 00:07:03 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Apr 2017 15:56:57 GMT'}, {'version': 'v3', 'created': 'Mon, 15 May 2017 05:48:54 GMT'}, {'version': 'v4', 'created': 'Wed, 26 Jul 2017 17:58:43 GMT'}]",2017-07-27,"[['Wang', 'Feng', ''], ['Xiang', 'Xiang', ''], ['Cheng', 'Jian', ''], ['Yuille', 'Alan L.', '']]","['Face Verifcation', 'Metric Learning', 'Feature Normalization']"
2218,1807.11256,Christoph Rauch,"Sergey Goncharov, Christoph Rauch and Lutz Schr\""oder",A Metalanguage for Guarded Iteration,extended version for the special issue,,10.1016/j.tcs.2021.04.005,,cs.LO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Notions of guardedness serve to delineate admissible recursive definitions in
various settings in a compositional manner. In recent work, we have introduced
an axiomatic notion of guardedness in symmetric monoidal categories, which
serves as a unifying framework for various examples from program semantics,
process algebra, and beyond. In the present paper, we propose a generic
metalanguage for guarded iteration based on combining this notion with the
fine-grain call-by-value paradigm, which we intend as a unifying programming
language for guarded and unguarded iteration in the presence of computational
effects. We give a generic (categorical) semantics of this language over a
suitable class of strong monads supporting guarded iteration, and show it to be
in touch with the standard operational behaviour of iteration by giving a
concrete big-step operational semantics for a certain specific instance of the
metalanguage and establishing soundness and (computational) adequacy for this
case.
","[{'version': 'v1', 'created': 'Mon, 30 Jul 2018 09:46:40 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Feb 2019 17:09:36 GMT'}, {'version': 'v3', 'created': 'Mon, 24 May 2021 14:49:50 GMT'}]",2021-05-25,"[['Goncharov', 'Sergey', ''], ['Rauch', 'Christoph', ''], ['Schröder', 'Lutz', '']]","['Computational monads', 'metalanguage', 'guarded iteration', 'computational adequacy']"
2219,2102.04667,Yanhao Zhang,"Yanhao Zhang, Pan Pan, Yun Zheng, Kang Zhao, Jianmin Wu, Yinghui Xu,
  Rong Jin","Virtual ID Discovery from E-commerce Media at Alibaba: Exploiting
  Richness of User Click Behavior for Visual Search Relevance",accepted by CIKM 2019,CIKM 2019: 2489-2497,10.1145/3357384.3357800,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visual search plays an essential role for E-commerce. To meet the search
demands of users and promote shopping experience at Alibaba, visual search
relevance of real-shot images is becoming the bottleneck. Traditional visual
search paradigm is usually based upon supervised learning with labeled data.
However, large-scale categorical labels are required with expensive human
annotations, which limits its applicability and also usually fails in
distinguishing the real-shot images. In this paper, we propose to discover
Virtual ID from user click behavior to improve visual search relevance at
Alibaba. As a totally click-data driven approach, we collect various types of
click data for training deep networks without any human annotations at all. In
particular, Virtual ID are learned as classification supervision with co-click
embedding, which explores image relationship from user co-click behaviors to
guide category prediction and feature learning. Concretely, we deploy Virtual
ID Category Network by integrating first-clicks and switch-clicks as
regularizer. Incorporating triplets and list constraints, Virtual ID Feature
Network is trained in a joint classification and ranking manner. Benefiting
from exploration of user click data, our networks are more effective to encode
richer supervision and better distinguish real-shot images in terms of category
and feature. To validate our method for visual search relevance, we conduct an
extensive set of offline and online experiments on the collected real-shot
images. We consistently achieve better experimental results across all
components, compared with alternative and state-of-the-art methods.
","[{'version': 'v1', 'created': 'Tue, 9 Feb 2021 06:31:20 GMT'}]",2021-02-10,"[['Zhang', 'Yanhao', ''], ['Pan', 'Pan', ''], ['Zheng', 'Yun', ''], ['Zhao', 'Kang', ''], ['Wu', 'Jianmin', ''], ['Xu', 'Yinghui', ''], ['Jin', 'Rong', '']]","['Visual Search', 'User Click Behavior', 'Deep Networks']"
2220,2105.09546,Andrea Fronzetti Colladon PhD,"P. A. Gloor, S. Woerner, D. Schoder, K. Fischbach, A. Fronzetti
  Colladon","Size does not matter -- in the virtual world. Comparing online social
  networking behaviour with business success of entrepreneurs",,"International Journal of Entrepreneurial Venturing 10(4), 435-455
  (2018)",10.1504/IJEV.2018.093919,,cs.SI cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We explore what benefits network position in online business social networks
like LinkedIn might confer to an aspiring entrepreneur. We compare two network
attributes, size and embeddedness, and two actor attributes, location and
diversity, between virtual and real-world networks. The promise of social
networks like LinkedIn is that network friends enable easier access to critical
resources such as legal and financial services, customers, and business
partners. Our setting consists of one million public member profiles of the
German business networking site XING (a German version of LinkedIn) from which
we extracted the network structure of 15,000 start-up entrepreneurs from 12
large German universities. We find no positive effect of virtual network size
and embeddedness, and small positive effects of location and diversity.
","[{'version': 'v1', 'created': 'Thu, 20 May 2021 06:58:42 GMT'}]",2021-05-21,"[['Gloor', 'P. A.', ''], ['Woerner', 'S.', ''], ['Schoder', 'D.', ''], ['Fischbach', 'K.', ''], ['Colladon', 'A. Fronzetti', '']]","['Online Social Networks', 'Network Analysis', 'Entrepreneurship', 'Business Success']"
2221,1409.7618,Wenhan Luo,"Wenhan Luo, Junliang Xing, Anton Milan, Xiaoqin Zhang, Wei Liu,
  Tae-Kyun Kim",Multiple Object Tracking: A Literature Review,Accepted by Artificial Intelligence,,10.1016/j.artint.2020.103448,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Multiple Object Tracking (MOT) has gained increasing attention due to its
academic and commercial potential. Although different approaches have been
proposed to tackle this problem, it still remains challenging due to factors
like abrupt appearance changes and severe object occlusions. In this work, we
contribute the first comprehensive and most recent review on this problem. We
inspect the recent advances in various aspects and propose some interesting
directions for future research. To the best of our knowledge, there has not
been any extensive review on this topic in the community. We endeavor to
provide a thorough review on the development of this problem in recent decades.
The main contributions of this review are fourfold: 1) Key aspects in an MOT
system, including formulation, categorization, key principles, evaluation of
MOT are discussed; 2) Instead of enumerating individual works, we discuss
existing approaches according to various aspects, in each of which methods are
divided into different groups and each group is discussed in detail for the
principles, advances and drawbacks; 3) We examine experiments of existing
publications and summarize results on popular datasets to provide quantitative
and comprehensive comparisons. By analyzing the results from different
perspectives, we have verified some basic agreements in the field; and 4) We
provide a discussion about issues of MOT research, as well as some interesting
directions which will become potential research effort in the future.
","[{'version': 'v1', 'created': 'Fri, 26 Sep 2014 16:15:32 GMT'}, {'version': 'v2', 'created': 'Fri, 29 May 2015 05:24:28 GMT'}, {'version': 'v3', 'created': 'Mon, 21 Sep 2015 15:13:28 GMT'}, {'version': 'v4', 'created': 'Mon, 22 May 2017 03:45:08 GMT'}, {'version': 'v5', 'created': 'Fri, 11 Feb 2022 17:54:27 GMT'}]",2022-02-14,"[['Luo', 'Wenhan', ''], ['Xing', 'Junliang', ''], ['Milan', 'Anton', ''], ['Zhang', 'Xiaoqin', ''], ['Liu', 'Wei', ''], ['Kim', 'Tae-Kyun', '']]","['Multi-Object Tracking', 'Data Association', 'Survey']"
2222,1405.2329,Carlos Olarte,"Elaine Pimentel, Carlos Olarte, Vivek Nigam",A Proof Theoretic Study of Soft Concurrent Constraint Programming,,Theory and Practice of Logic Programming 14 (2014) 649-663,10.1017/S147106841400026X,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Concurrent Constraint Programming (CCP) is a simple and powerful model for
concurrency where agents interact by telling and asking constraints. Since
their inception, CCP-languages have been designed for having a strong
connection to logic. In fact, the underlying constraint system can be built
from a suitable fragment of intuitionistic (linear) logic --ILL-- and processes
can be interpreted as formulas in ILL. Constraints as ILL formulas fail to
represent accurately situations where ""preferences"" (called soft constraints)
such as probabilities, uncertainty or fuzziness are present. In order to
circumvent this problem, c-semirings have been proposed as algebraic structures
for defining constraint systems where agents are allowed to tell and ask soft
constraints. Nevertheless, in this case, the tight connection to logic and
proof theory is lost. In this work, we give a proof theoretical interpretation
to soft constraints: they can be defined as formulas in a suitable fragment of
ILL with subexponentials (SELL) where subexponentials, ordered in a c-semiring
structure, are interpreted as preferences. We hence achieve two goals: (1)
obtain a CCP language where agents can tell and ask soft constraints and (2)
prove that the language in (1) has a strong connection with logic. Hence we
keep a declarative reading of processes as formulas while providing a logical
framework for soft-CCP based systems. An interesting side effect of (1) is that
one is also able to handle probabilities (and other modalities) in SELL, by
restricting the use of the promotion rule for non-idempotent c-semirings.This
finer way of controlling subexponentials allows for considering more
interesting spaces and restrictions, and it opens the possibility of specifying
more challenging computational systems.
","[{'version': 'v1', 'created': 'Fri, 9 May 2014 19:51:06 GMT'}]",2020-02-19,"[['Pimentel', 'Elaine', ''], ['Olarte', 'Carlos', ''], ['Nigam', 'Vivek', '']]","['Concurrent Constraint Programming', 'Linear Logic', 'Soft Constraints']"
2223,1512.07748,Tomohiko Nakamura,"Tomohiko Nakamura, Eita Nakamura and Shigeki Sagayama","Real-Time Audio-to-Score Alignment of Music Performances Containing
  Errors and Arbitrary Repeats and Skips","12 pages, 8 figures, version accepted in IEEE/ACM Transactions on
  Audio, Speech, and Language Processing","IEEE/ACM Transactions on Audio, Speech, and Language Processing (
  Volume: 24, Issue: 2, February 2016)",10.1109/TASLP.2015.2507862,,cs.SD cs.LG cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses real-time alignment of audio signals of music
performance to the corresponding score (a.k.a. score following) which can
handle tempo changes, errors and arbitrary repeats and/or skips (repeats/skips)
in performances. This type of score following is particularly useful in
automatic accompaniment for practices and rehearsals, where errors and
repeats/skips are often made. Simple extensions of the algorithms previously
proposed in the literature are not applicable in these situations for scores of
practical length due to the problem of large computational complexity. To cope
with this problem, we present two hidden Markov models of monophonic
performance with errors and arbitrary repeats/skips, and derive efficient
score-following algorithms with an assumption that the prior probability
distributions of score positions before and after repeats/skips are independent
from each other. We confirmed real-time operation of the algorithms with music
scores of practical length (around 10000 notes) on a modern laptop and their
tracking ability to the input performance within 0.7 s on average after
repeats/skips in clarinet performance data. Further improvements and extension
for polyphonic signals are also discussed.
","[{'version': 'v1', 'created': 'Thu, 24 Dec 2015 08:21:48 GMT'}]",2022-12-05,"[['Nakamura', 'Tomohiko', ''], ['Nakamura', 'Eita', ''], ['Sagayama', 'Shigeki', '']]","['Score following', 'audio-to-score alignment', 'arbitraryrepeats and skips', 'fast Viterbi algorithm', 'hidden Markov model', 'music signal processing']"
2224,1805.10493,Patrick Koch,"Patrick Koch, Konstantin Schekotihin, Dietmar Jannach, Birgit Hofer,
  Franz Wotawa",Combining Spreadsheet Smells for Improved Fault Prediction,"4 pages, 1 figure, to be published in 40th International Conference
  on Software Engineering: New Ideas and Emerging Results Track",,10.1145/3183399.3183402,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spreadsheets are commonly used in organizations as a programming tool for
business-related calculations and decision making. Since faults in spreadsheets
can have severe business impacts, a number of approaches from general software
engineering have been applied to spreadsheets in recent years, among them the
concept of code smells. Smells can in particular be used for the task of fault
prediction. An analysis of existing spreadsheet smells, however, revealed that
the predictive power of individual smells can be limited. In this work we
therefore propose a machine learning based approach which combines the
predictions of individual smells by using an AdaBoost ensemble classifier.
Experiments on two public datasets containing real-world spreadsheet faults
show significant improvements in terms of fault prediction accuracy.
","[{'version': 'v1', 'created': 'Sat, 26 May 2018 15:11:22 GMT'}]",2018-05-29,"[['Koch', 'Patrick', ''], ['Schekotihin', 'Konstantin', ''], ['Jannach', 'Dietmar', ''], ['Hofer', 'Birgit', ''], ['Wotawa', 'Franz', '']]","['Spreadsheet Smells', 'Spreadsheet QA', 'Fault Prediction']"
2225,1504.06846,Ashraf Shahin,Ashraf A. Shahin,"Memetic Elitist Pareto Evolutionary Algorithm for Virtual Network
  Embedding","URL: http://dx.doi.org/10.5539/cis.v8n2p73. ISSN 1913-8989 E-ISSN
  1913-8997,Published by Canadian Center of Science and Education","Computer and Information Science journal; Vol. 8, No. 2; 2015, pg.
  73-88",10.5539/cis.v8n2p73,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Assigning virtual network resources to physical network components, called
Virtual Network Embedding, is a major challenge in cloud computing platforms.
In this paper, we propose a memetic elitist pareto evolutionary algorithm for
virtual network embedding problem, which is called MEPE-VNE. MEPE-VNE applies a
non-dominated sorting-based multi-objective evolutionary algorithm, called
NSGA-II, to reduce computational complexity of constructing a hierarchy of
non-dominated Pareto fronts and assign a rank value to each virtual network
embedding solution based on its dominance level and crowding distance value.
Local search is applied to enhance virtual network embedding solutions and
speed up convergence of the proposed algorithm. To reduce loss of good
solutions, MEPE-VNE ensures elitism by passing virtual network embedding
solutions with best fitness values to next generation. Performance of the
proposed algorithm is evaluated and compared with existing algorithms using
extensive simulations, which show that the proposed algorithm improves virtual
network embedding by increasing acceptance ratio and revenue while decreasing
the cost incurred by substrate network.
","[{'version': 'v1', 'created': 'Sun, 26 Apr 2015 16:56:28 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Apr 2015 15:53:25 GMT'}]",2015-04-30,"[['Shahin', 'Ashraf A.', '']]","['cloud computing', 'differential evolution', 'genetic algorithm', 'pareto optimization', 'virtual network embedding']"
2226,1405.3393,Gregory Duck,Gregory J. Duck and Remy Haemmerle and Martin Sulzmann,"On Termination, Confluence and Consistent CHR-based Type Inference",,Theory and Practice of Logic Programming 14 (2014) 619-632,10.1017/S1471068414000246,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the application of Constraint Handling Rules (CHR) for the
specification of type inference systems, such as that used by Haskell.
Confluence of CHR guarantees that the answer provided by type inference is
correct and consistent. The standard method for establishing confluence relies
on an assumption that the CHR program is terminating. However, many examples in
practice give rise to non-terminating CHR programs, rendering this method
inapplicable. Despite no guarantee of termination or confluence, the Glasgow
Haskell Compiler (GHC) supports options that allow the user to proceed with
type inference anyway, e.g. via the use of the UndecidableInstances flag. In
this paper we formally identify and verify a set of relaxed criteria, namely
range-restrictedness, local confluence, and ground termination, that ensure the
consistency of CHR-based type inference that maps to potentially
non-terminating CHR programs.
","[{'version': 'v1', 'created': 'Wed, 14 May 2014 07:51:39 GMT'}]",2020-02-19,"[['Duck', 'Gregory J.', ''], ['Haemmerle', 'Remy', ''], ['Sulzmann', 'Martin', '']]","['Constraint Handling Rules', 'confluence', 'termination', 'type classes']"
2227,1307.5410,Michael Rodler,"Thomas Eder, Michael Rodler, Dieter Vymazal, Markus Zeilinger",ANANAS - A Framework For Analyzing Android Applications,"Paper accepted at First Int. Workshop on Emerging Cyberthreats and
  Countermeasures ECTCM 2013",,10.1109/ARES.2013.93,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Android is an open software platform for mobile devices with a large market
share in the smartphone sector. The openness of the system as well as its wide
adoption lead to an increasing amount of malware developed for this platform.
ANANAS is an expandable and modular framework for analyzing Android
applications. It takes care of common needs for dynamic malware analysis and
provides an interface for the development of plugins. Adaptability and
expandability have been main design goals during the development process. An
abstraction layer for simple user interaction and phone event simulation is
also part of the framework. It allows an analyst to script the required user
simulation or phone events on demand or adjust the simulation to his needs. Six
plugins have been developed for ANANAS. They represent well known techniques
for malware analysis, such as system call hooking and network traffic analysis.
The focus clearly lies on dynamic analysis, as five of the six plugins are
dynamic analysis methods.
","[{'version': 'v1', 'created': 'Sat, 20 Jul 2013 11:44:40 GMT'}]",2013-11-13,"[['Eder', 'Thomas', ''], ['Rodler', 'Michael', ''], ['Vymazal', 'Dieter', ''], ['Zeilinger', 'Markus', '']]","['Smartphone security', 'Android malware', 'automated malware analysis']"
2228,1509.02439,Nicolas Laurent,"Nicolas Laurent, Kim Mens",Parsing Expression Grammars Made Practical,"""Proceedings of the International Conference on Software Language
  Engineering (SLE 2015)"" - 167-172 (ISBN : 978-1-4503-3686-4)",,10.1145/2814251.2814265,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parsing Expression Grammars (PEGs) define languages by specifying
recursive-descent parser that recognises them. The PEG formalism exhibits
desirable properties, such as closure under composition, built-in
disambiguation, unification of syntactic and lexical concerns, and closely
matching programmer intuition. Unfortunately, state of the art PEG parsers
struggle with left-recursive grammar rules, which are not supported by the
original definition of the formalism and can lead to infinite recursion under
naive implementations. Likewise, support for associativity and explicit
precedence is spotty. To remedy these issues, we introduce Autumn, a general
purpose PEG library that supports left-recursion, left and right associativity
and precedence rules, and does so efficiently. Furthermore, we identify infix
and postfix operators as a major source of inefficiency in left-recursive PEG
parsers and show how to tackle this problem. We also explore the extensibility
of the PEG paradigm by showing how one can easily introduce new parsing
operators and how our parser accommodates custom memoization and error handling
strategies. We compare our parser to both state of the art and battle-tested
PEG and CFG parsers, such as Rats!, Parboiled and ANTLR.
","[{'version': 'v1', 'created': 'Tue, 8 Sep 2015 16:43:53 GMT'}, {'version': 'v2', 'created': 'Sat, 17 Sep 2016 17:08:03 GMT'}]",2016-09-20,"[['Laurent', 'Nicolas', ''], ['Mens', 'Kim', '']]","['parsing expression grammar', 'parsing', 'left-recursion', 'associativity', 'precedence']"
2229,2209.08719,Wunan Guo,"Wunan Guo, Zhen Dong, Liwei Shen, Wei Tian, Ting Su and Xin Peng",Detecting and Fixing Data Loss Issues in Android Apps,,"Proceedings of the 31st ACM SIGSOFT International Symposium on
  Software Testing and Analysis(ISSTA 2022), pp. 605-616",10.1145/3533767.3534402,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Android apps are event-driven, and their execution is often interrupted by
external events. This interruption can cause data loss issues that annoy users.
For instance, when the screen is rotated, the current app page will be
destroyed and recreated. If the app state is improperly preserved, user data
will be lost. In this work, we present an approach and tool iFixDataloss that
automatically detects and fixes data loss issues in Android apps. To achieve
this, we identify scenarios in which data loss issues may occur, develop
strategies to reveal data loss issues, and design patch templates to fix them.
Our experiments on 66 Android apps show iFixDataloss detected 374 data loss
issues (284 of them were previously unknown) and successfully generated patches
for 188 of the 374 issues. Out of 20 submitted patches, 16 have been accepted
by developers. In comparison with state-of-the-art techniques, iFixDataloss
performed significantly better in terms of the number of detected data loss
issues and the quality of generated patches.
","[{'version': 'v1', 'created': 'Mon, 19 Sep 2022 02:36:28 GMT'}]",2022-09-20,"[['Guo', 'Wunan', ''], ['Dong', 'Zhen', ''], ['Shen', 'Liwei', ''], ['Tian', 'Wei', ''], ['Su', 'Ting', ''], ['Peng', 'Xin', '']]","['mobile testing', 'patching', 'dynamic analysis']"
2230,1310.0036,Saptarshi Bhattacharjee,"Saptarshi Bhattacharjee, S Arunkumar, Samir Kumar Bandyopadhyay","Personal Identification from Lip-Print Features using a Statistical
  Model","5 pages, 7 images, Published with International Journal of Computer
  Applications (IJCA)",,10.5120/8817-2801,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel approach towards identification of human beings
from the statistical analysis of their lip prints. Lip features are extracted
by studying the spatial orientations of the grooves present in lip prints of
individuals using standard edge detection techniques. Horizontal, vertical and
diagonal groove features are analysed using connected-component analysis to
generate the region-specific edge datasets. Comparison between test and
reference sample datasets against a threshold value to define a match yield
satisfactory results. FAR, FRR and ROC metrics have been used to gauge the
performance of the algorithm for real-world deployment in unimodal and
multimodal biometric verification systems.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2013 20:12:02 GMT'}]",2013-12-04,"[['Bhattacharjee', 'Saptarshi', ''], ['Arunkumar', 'S', ''], ['Bandyopadhyay', 'Samir Kumar', '']]","['Biometrics', 'Chieloscopy', 'Lip Prints', 'Connected Component Analysis', 'FAR', 'FRR']"
2231,1705.06037,Marc Hellmuth,"Marc Hellmuth, Lydia Ostermeier and Peter F. Stadler",A Survey on Hypergraph Products (Erratum),,,10.1007/s11786-012-0109-6,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A surprising diversity of different products of hypergraphs have been
discussed in the literature. Most of the hypergraph products can be viewed as
generalizations of one of the four standard graph products. The most widely
studied variant, the so-called square product, does not have this property,
however. Here we survey the literature on hypergraph products with an emphasis
on comparing the alternative generalizations of graph products and the
relationships among them. In this context the so-called 2-sections and
L2-sections are considered. These constructions are closely linked to related
colored graph structures that seem to be a useful tool for the prime factor
decompositions w.r.t.\ specific hypergraph products. We summarize the current
knowledge on the propagation of hypergraph invariants under the different
hypergraph multiplications. While the overwhelming majority of the material
concerns finite (undirected) hypergraphs, the survey also covers a summary of
the few results on products of infinite and directed hypergraphs.
","[{'version': 'v1', 'created': 'Wed, 17 May 2017 07:41:32 GMT'}]",2017-05-18,"[['Hellmuth', 'Marc', ''], ['Ostermeier', 'Lydia', ''], ['Stadler', 'Peter F.', '']]","['Hypergraph invariants', 'products', 'set systems']"
2232,1812.02464,Craig Atkinson,"Craig Atkinson and Brendan McCane and Lech Szymanski and Anthony
  Robins","Pseudo-Rehearsal: Achieving Deep Reinforcement Learning without
  Catastrophic Forgetting",,,10.1016/j.neucom.2020.11.050,,cs.LG cs.AI cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Neural networks can achieve excellent results in a wide variety of
applications. However, when they attempt to sequentially learn, they tend to
learn the new task while catastrophically forgetting previous ones. We propose
a model that overcomes catastrophic forgetting in sequential reinforcement
learning by combining ideas from continual learning in both the image
classification domain and the reinforcement learning domain. This model
features a dual memory system which separates continual learning from
reinforcement learning and a pseudo-rehearsal system that ""recalls"" items
representative of previous tasks via a deep generative network. Our model
sequentially learns Atari 2600 games without demonstrating catastrophic
forgetting and continues to perform above human level on all three games. This
result is achieved without: demanding additional storage requirements as the
number of tasks increases, storing raw data or revisiting past tasks. In
comparison, previous state-of-the-art solutions are substantially more
vulnerable to forgetting on these complex deep reinforcement learning tasks.
","[{'version': 'v1', 'created': 'Thu, 6 Dec 2018 11:20:18 GMT'}, {'version': 'v2', 'created': 'Sun, 24 Feb 2019 22:31:47 GMT'}, {'version': 'v3', 'created': 'Mon, 26 Aug 2019 02:16:29 GMT'}, {'version': 'v4', 'created': 'Mon, 7 Oct 2019 01:42:20 GMT'}, {'version': 'v5', 'created': 'Mon, 3 Aug 2020 05:52:01 GMT'}, {'version': 'v6', 'created': 'Wed, 16 Dec 2020 21:38:56 GMT'}]",2020-12-18,"[['Atkinson', 'Craig', ''], ['McCane', 'Brendan', ''], ['Szymanski', 'Lech', ''], ['Robins', 'Anthony', '']]","['Deep Reinforcement Learning', 'Pseudo-Rehearsal', 'CatastrophicForgetting', 'Generative Adversarial Network']"
2233,2111.03753,Qingsong Wen,"Yingying Zhang, Zhengxiong Guan, Huajie Qian, Leili Xu, Hengbo Liu,
  Qingsong Wen, Liang Sun, Junwei Jiang, Lunting Fan, Min Ke",CloudRCA: A Root Cause Analysis Framework for Cloud Computing Platforms,"Accepted by CIKM 2021; 10 pages, 3 figures, 12 tables","30th ACM International Conference on Information and Knowledge
  Management (CIKM 2021)",,,cs.DC cs.LG cs.SE eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As business of Alibaba expands across the world among various industries,
higher standards are imposed on the service quality and reliability of big data
cloud computing platforms which constitute the infrastructure of Alibaba Cloud.
However, root cause analysis in these platforms is non-trivial due to the
complicated system architecture. In this paper, we propose a root cause
analysis framework called CloudRCA which makes use of heterogeneous
multi-source data including Key Performance Indicators (KPIs), logs, as well as
topology, and extracts important features via state-of-the-art anomaly
detection and log analysis techniques. The engineered features are then
utilized in a Knowledge-informed Hierarchical Bayesian Network (KHBN) model to
infer root causes with high accuracy and efficiency. Ablation study and
comprehensive experimental comparisons demonstrate that, compared to existing
frameworks, CloudRCA 1) consistently outperforms existing approaches in
f1-score across different cloud systems; 2) can handle novel types of root
causes thanks to the hierarchical structure of KHBN; 3) performs more robustly
with respect to algorithmic configurations; and 4) scales more favorably in the
data and feature sizes. Experiments also show that a cross-platform transfer
learning mechanism can be adopted to further improve the accuracy by more than
10\%. CloudRCA has been integrated into the diagnosis system of Alibaba Cloud
and employed in three typical cloud computing platforms including MaxCompute,
Realtime Compute and Hologres. It saves Site Reliability Engineers (SREs) more
than $20\%$ in the time spent on resolving failures in the past twelve months
and improves service reliability significantly.
","[{'version': 'v1', 'created': 'Fri, 5 Nov 2021 23:03:21 GMT'}]",2021-11-09,"[['Zhang', 'Yingying', ''], ['Guan', 'Zhengxiong', ''], ['Qian', 'Huajie', ''], ['Xu', 'Leili', ''], ['Liu', 'Hengbo', ''], ['Wen', 'Qingsong', ''], ['Sun', 'Liang', ''], ['Jiang', 'Junwei', ''], ['Fan', 'Lunting', ''], ['Ke', 'Min', '']]","['Root Cause Analysis', 'AIOps', 'Cloud Computing Platform', 'AlibabaCloud']"
2234,1505.02818,Fani Tsapeli,Fani Tsapeli and Mirco Musolesi,"Investigating Causality in Human Behavior from Smartphone Sensor Data: A
  Quasi-Experimental Approach",,"EPJ Data Science, 2015",10.1140/epjds/s13688-015-0061-1,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smartphones have become an indispensable part of our daily life. Their
improved sensing and computing capabilities bring new opportunities for human
behavior monitoring and analysis. Most work so far has been focused on
detecting correlation rather than causation among features extracted from
smartphone data. However, pure correlation analysis does not offer sufficient
understanding of human behavior. Moreover, causation analysis could allow
scientists to identify factors that have a causal effect on health and
well-being issues, such as obesity, stress, depression and so on and suggest
actions to deal with them. Finally, detecting causal relationships in this kind
of observational data is challenging since, in general, subjects cannot be
randomly exposed to an event.
  In this article, we discuss the design, implementation and evaluation of a
generic quasi-experimental framework for conducting causation studies on human
behavior from smartphone data. We demonstrate the effectiveness of our approach
by investigating the causal impact of several factors such as exercise, social
interactions and work on stress level. Our results indicate that exercising and
spending time outside home and working environment have a positive effect on
participants stress level while reduced working hours only slightly impact
stress.
","[{'version': 'v1', 'created': 'Mon, 11 May 2015 22:02:49 GMT'}]",2016-01-18,"[['Tsapeli', 'Fani', ''], ['Musolesi', 'Mirco', '']]","['smartphone data', 'causality', 'human behavior', 'stress modeling']"
2235,1904.02050,Marco Virgolin,"Marco Virgolin, Tanja Alderliesten, Cees Witteveen, Peter A.N. Bosman","Improving Model-based Genetic Programming for Symbolic Regression of
  Small Expressions",fix NMSE definition (it is 100xMSE/var instead of MSE/var),,10.1162/evco_a_00278,,cs.NE,http://creativecommons.org/licenses/by/4.0/,"  The Gene-pool Optimal Mixing Evolutionary Algorithm (GOMEA) is a model-based
EA framework that has been shown to perform well in several domains, including
Genetic Programming (GP). Differently from traditional EAs where variation acts
blindly, GOMEA learns a model of interdependencies within the genotype, i.e.,
the linkage, to estimate what patterns to propagate. In this article, we study
the role of Linkage Learning (LL) performed by GOMEA in Symbolic Regression
(SR). We show that the non-uniformity in the distribution of the genotype in GP
populations negatively biases LL, and propose a method to correct for this. We
also propose approaches to improve LL when ephemeral random constants are used.
Furthermore, we adapt a scheme of interleaving runs to alleviate the burden of
tuning the population size, a crucial parameter for LL, to SR. We run
experiments on 10 real-world datasets, enforcing a strict limitation on
solution size, to enable interpretability. We find that the new LL method
outperforms the standard one, and that GOMEA outperforms both traditional and
semantic GP. We also find that the small solutions evolved by GOMEA are
competitive with tuned decision trees, making GOMEA a promising new approach to
SR.
","[{'version': 'v1', 'created': 'Wed, 3 Apr 2019 15:16:07 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Apr 2019 09:24:29 GMT'}, {'version': 'v3', 'created': 'Tue, 2 Jul 2019 10:25:00 GMT'}, {'version': 'v4', 'created': 'Fri, 5 Mar 2021 16:24:49 GMT'}]",2021-03-08,"[['Virgolin', 'Marco', ''], ['Alderliesten', 'Tanja', ''], ['Witteveen', 'Cees', ''], ['Bosman', 'Peter A. N.', '']]","['Genetic programming', 'symbolic regression', 'linkage', 'GOMEA', 'machine learning', 'interpretability']"
2236,1608.03549,James Ross,David Richie and James Ross,"OpenCL + OpenSHMEM Hybrid Programming Model for the Adapteva Epiphany
  Architecture","12 pages, 5 figures, OpenSHMEM 2016: Third workshop on OpenSHMEM and
  Related Technologies",,10.1007/978-3-319-50995-2_12,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is interest in exploring hybrid OpenSHMEM + X programming models to
extend the applicability of the OpenSHMEM interface to more hardware
architectures. We present a hybrid OpenCL + OpenSHMEM programming model for
device-level programming for architectures like the Adapteva Epiphany many-core
RISC array processor. The Epiphany architecture comprises a 2D array of
low-power RISC cores with minimal uncore functionality connected by a 2D mesh
Network-on-Chip (NoC). The Epiphany architecture offers high computational
energy efficiency for integer and floating point calculations as well as
parallel scalability. The Epiphany-III is available as a coprocessor in
platforms that also utilize an ARM CPU host. OpenCL provides good functionality
for supporting a co-design programming model in which the host CPU offloads
parallel work to a coprocessor. However, the OpenCL memory model is
inconsistent with the Epiphany memory architecture and lacks support for
inter-core communication. We propose a hybrid programming model in which
OpenSHMEM provides a better solution by replacing the non-standard OpenCL
extensions introduced to achieve high performance with the Epiphany
architecture. We demonstrate the proposed programming model for matrix-matrix
multiplication based on Cannon's algorithm showing that the hybrid model
addresses the deficiencies of using OpenCL alone to achieve good benchmark
performance.
","[{'version': 'v1', 'created': 'Thu, 11 Aug 2016 17:50:49 GMT'}]",2017-01-18,"[['Richie', 'David', ''], ['Ross', 'James', '']]","['OpenCL', 'OpenSHMEM', 'hybrid programming model', 'singleboard computer', 'Network-on-Chip (NoC)']"
2237,1309.2404,Dian Pratiwi,Dian Pratiwi,"Implementation of Function Point Analysis in Measuring The Volume
  Estimation of Software System in Object Oriented and Structural Model of
  Academic System","4 pages, 5 figures, 6 tables","International Journal of Computer Applications (0975-8887), Volume
  70, No.10, May 2013",10.5120/11995-7879,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the software development required a fidelity and accuracy in determining
the size or value of the software to fit the operation is executed. Various
methods of calculation has been widely applied to estimate the size, and one of
them is by using the method of Function Point Analysis (FPA). The method is
then applied by author to measure the complexity of an academic information
system by using the two modeling approaches, namely object oriented and
structural models. Measurements in this paper consists of several stages,
namely describing the information system that will be built into the UML models
and structured. Then the model is analyzed by calculating Crude Function Points
(CRP), Relative Complexity Adjustment Factor (RCAF), and then calculate its
function point. From the result of a calculation using the FPA to the academic
system software development, FP values of object oriented model obtained for
174,64 and the FP value of structured models for 180,93. The result of function
point that will be used by developers in determining the price and cost of
software systems to be built.
","[{'version': 'v1', 'created': 'Tue, 10 Sep 2013 08:01:35 GMT'}]",2015-06-17,"[['Pratiwi', 'Dian', '']]","['Function Point', 'Crude Function Point', 'Relative Complexity Adjustment', 'UML']"
2238,1405.3218,Riccardo Zese,"Elena Bellodi, Evelina Lamma, Fabrizio Riguzzi, Vitor Santos Costa and
  Riccardo Zese",Lifted Variable Elimination for Probabilistic Logic Programming,"To appear in Theory and Practice of Logic Programming (TPLP). arXiv
  admin note: text overlap with arXiv:1402.0565 by other authors",Theory and Practice of Logic Programming 14 (2014) 681-695,10.1017/S1471068414000283,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lifted inference has been proposed for various probabilistic logical
frameworks in order to compute the probability of queries in a time that
depends on the size of the domains of the random variables rather than the
number of instances. Even if various authors have underlined its importance for
probabilistic logic programming (PLP), lifted inference has been applied up to
now only to relational languages outside of logic programming. In this paper we
adapt Generalized Counting First Order Variable Elimination (GC-FOVE) to the
problem of computing the probability of queries to probabilistic logic programs
under the distribution semantics. In particular, we extend the Prolog Factor
Language (PFL) to include two new types of factors that are needed for
representing ProbLog programs. These factors take into account the existing
causal independence relationships among random variables and are managed by the
extension to variable elimination proposed by Zhang and Poole for dealing with
convergent variables and heterogeneous factors. Two new operators are added to
GC-FOVE for treating heterogeneous factors. The resulting algorithm, called
LP$^2$ for Lifted Probabilistic Logic Programming, has been implemented by
modifying the PFL implementation of GC-FOVE and tested on three benchmarks for
lifted inference. A comparison with PITA and ProbLog2 shows the potential of
the approach.
","[{'version': 'v1', 'created': 'Tue, 13 May 2014 16:29:37 GMT'}, {'version': 'v2', 'created': 'Wed, 14 May 2014 19:48:43 GMT'}, {'version': 'v3', 'created': 'Fri, 16 May 2014 08:28:20 GMT'}, {'version': 'v4', 'created': 'Fri, 10 Oct 2014 12:00:38 GMT'}]",2020-02-19,"[['Bellodi', 'Elena', ''], ['Lamma', 'Evelina', ''], ['Riguzzi', 'Fabrizio', ''], ['Costa', 'Vitor Santos', ''], ['Zese', 'Riccardo', '']]","['Probabilistic Logic Programming', 'Lifted Inference', 'Variable Elimination', 'Distribution Semantics', 'ProbLog', 'Statistical Relational Artificial Intelligence']"
2239,1912.04496,Longchun Wang,Longchun Wang Lankun Guo and Qingguo Li,Continuous Domains in Formal Concept Analysis,,Fundamenta Informaticae 179 (2021),10.3233/FI-2021-2025,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Formal Concept Analysis has proven to be an effective method of restructuring
complete lattices and various algebraic domains. In this paper, the notions of
attribute continuous formal context and continuous formal concept are
introduced by considering a selection F of fnite subsets of attributes. Our
decision of a selection F relies on a kind of generalized interior operators.
It is shown that the set of continuous formal concepts forms a continuous
domain, and every continuous domain can be obtained in this way. Moreover, an
notion of F-morphism is also identified to produce a category equivalent to
that of continuous domains with Scott-continuous functions. This paper also
consider the representations of various subclasses of continuous domains such
as algebraic domains, bounded complete domains and stably continuous
semilattices. These results explore the fundamental idea of domain theory in
Formal Concept Analysis from a categorical viewpoint.
","[{'version': 'v1', 'created': 'Tue, 10 Dec 2019 04:57:15 GMT'}]",2021-03-23,"[['Guo', 'Longchun Wang Lankun', ''], ['Li', 'Qingguo', '']]","['domain theory', 'Formal Concept Analysis', 'continuous formal concept', 'categoricalequivalence']"
2240,1301.1932,P. Mahesha,P. Mahesha and D. S. Vinod,"An Approach for Classification of Dysfluent and Fluent Speech Using K-NN
  And SVM","10 pages,4 figures; International Journal of Computer Science,
  Engineering and Applications (IJCSEA) Vol.2, No.6, December 2012",,10.5121/ijcsea.2012.2603,,cs.SD cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new approach for classification of dysfluent and fluent
speech using Mel-Frequency Cepstral Coefficient (MFCC). The speech is fluent
when person's speech flows easily and smoothly. Sounds combine into syllable,
syllables mix together into words and words link into sentences with little
effort. When someone's speech is dysfluent, it is irregular and does not flow
effortlessly. Therefore, a dysfluency is a break in the smooth, meaningful flow
of speech. Stuttering is one such disorder in which the fluent flow of speech
is disrupted by occurrences of dysfluencies such as repetitions, prolongations,
interjections and so on. In this work we have considered three types of
dysfluencies such as repetition, prolongation and interjection to characterize
dysfluent speech. After obtaining dysfluent and fluent speech, the speech
signals are analyzed in order to extract MFCC features. The k-Nearest Neighbor
(k-NN) and Support Vector Machine (SVM) classifiers are used to classify the
speech as dysfluent and fluent speech. The 80% of the data is used for training
and 20% for testing. The average accuracy of 86.67% and 93.34% is obtained for
dysfluent and fluent speech respectively.
","[{'version': 'v1', 'created': 'Wed, 9 Jan 2013 17:42:59 GMT'}]",2013-01-10,"[['Mahesha', 'P.', ''], ['Vinod', 'D. S.', '']]","['Stuttering', 'Fluent Speech', 'MFCC & kNN']"
2241,1204.1851,Alexander Artikis,"Anastasios Skarlatidis, Alexander Artikis, Jason Filippou and Georgios
  Paliouras",A Probabilistic Logic Programming Event Calculus,"Accepted for publication in the Theory and Practice of Logic
  Programming (TPLP) journal",Theory and Practice of Logic Programming 15 (2015) 213-245,10.1017/S1471068413000690,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a system for recognising human activity given a symbolic
representation of video content. The input of our system is a set of
time-stamped short-term activities (STA) detected on video frames. The output
is a set of recognised long-term activities (LTA), which are pre-defined
temporal combinations of STA. The constraints on the STA that, if satisfied,
lead to the recognition of a LTA, have been expressed using a dialect of the
Event Calculus. In order to handle the uncertainty that naturally occurs in
human activity recognition, we adapted this dialect to a state-of-the-art
probabilistic logic programming framework. We present a detailed evaluation and
comparison of the crisp and probabilistic approaches through experimentation on
a benchmark dataset of human surveillance videos.
","[{'version': 'v1', 'created': 'Mon, 9 Apr 2012 10:23:38 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Apr 2013 16:15:27 GMT'}]",2020-02-19,"[['Skarlatidis', 'Anastasios', ''], ['Artikis', 'Alexander', ''], ['Filippou', 'Jason', ''], ['Paliouras', 'Georgios', '']]","['Event Recognition', 'Event Pattern Matching', 'Event Calculus', 'ProbLog']"
2242,1803.01662,Jonny O'Dwyer,"Jonny O'Dwyer, Ronan Flynn, Niall Murray",Continuous Affect Prediction Using Eye Gaze and Speech,"Accepted paper for the 2017 IEEE International Conference on
  Bioinformatics and Biomedicine (BIBM)","J. O Dwyer, R. Flynn, and N. Murray, Continuous affect prediction
  using eye gaze and speech, in 2017 IEEE International Conference on
  Bioinformatics and Biomedicine (BIBM), 2017, pp. 2001-2007",10.1109/BIBM.2017.8217968,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Affective computing research traditionally focused on labeling a person's
emotion as one of a discrete number of classes e.g. happy or sad. In recent
times, more attention has been given to continuous affect prediction across
dimensions in the emotional space, e.g. arousal and valence. Continuous affect
prediction is the task of predicting a numerical value for different emotion
dimensions. The application of continuous affect prediction is powerful in
domains involving real-time audio-visual communications which could include
remote or assistive technologies for psychological assessment of subjects.
Modalities used for continuous affect prediction may include speech, facial
expressions and physiological responses. As opposed to single modality
analysis, the research community have combined multiple modalities to improve
the accuracy of continuous affect prediction. In this context, this paper
investigates a continuous affect prediction system using the novel combination
of speech and eye gaze. A new eye gaze feature set is proposed. This novel
approach uses open source software for real-time affect prediction in
audio-visual communication environments. A unique advantage of the
human-computer interface used here is that it does not require the subject to
wear specialized and expensive eye-tracking headsets or intrusive devices. The
results indicate that the combination of speech and eye gaze improves arousal
prediction by 3.5% and valence prediction by 19.5% compared to using speech
alone.
","[{'version': 'v1', 'created': 'Mon, 5 Mar 2018 13:57:05 GMT'}]",2018-03-06,"[[""O'Dwyer"", 'Jonny', ''], ['Flynn', 'Ronan', ''], ['Murray', 'Niall', '']]","['speech', 'eye gaze', 'affective computing', 'human']"
2243,1501.06741,Juergen Zechner,"Gernot Beer and Benjamin Marussig and J\""urgen Zechner",A simple approach to the numerical simulation with trimmed CAD surfaces,20 pages and 16 figures,"Computer Methods in Applied Mechanics and Engineering, Volume 285,
  1 March 2015, Pages 776-790",10.1016/j.cma.2014.12.010,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work a novel method for the analysis with trimmed CAD surfaces is
presented. The method involves an additional mapping step and the attraction
stems from its sim- plicity and ease of implementation into existing Finite
Element (FEM) or Boundary Element (BEM) software. The method is first verified
with classical test examples in structural mechanics. Then two practical
applications are presented one using the FEM, the other the BEM, that show the
applicability of the method.
","[{'version': 'v1', 'created': 'Tue, 27 Jan 2015 11:01:00 GMT'}]",2015-01-28,"[['Beer', 'Gernot', ''], ['Marussig', 'Benjamin', ''], ['Zechner', 'Jürgen', '']]","['trimming', 'CAD', 'isogeometric analysis']"
2244,1208.1926,Laxmi Choudhary,Laxmi Choudhary and Bhawani Shankar Burdak,Role of Ranking Algorithms for Information Retrieval,"Keywords: Page Rank, Web Mining, Web Structured Mining, Web Content
  Mining",,10.5121/ijaia.2012.3415,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As the use of web is increasing more day by day, the web users get easily
lost in the web's rich hyper structure. The main aim of the owner of the
website is to give the relevant information according their needs to the users.
We explained the Web mining is used to categorize users and pages by analyzing
user's behavior, the content of pages and then describe Web Structure mining.
This paper includes different Page Ranking algorithms and compares those
algorithms used for Information Retrieval. Different Page Rank based algorithms
like Page Rank (PR), WPR (Weighted Page Rank), HITS (Hyperlink Induced Topic
Selection), Distance Rank and EigenRumor algorithms are discussed and compared.
Simulation Interface has been designed for PageRank algorithm and Weighted
PageRank algorithm but PageRank is the only ranking algorithm on which Google
search engine works.
","[{'version': 'v1', 'created': 'Thu, 9 Aug 2012 14:43:51 GMT'}]",2012-08-10,"[['Choudhary', 'Laxmi', ''], ['Burdak', 'Bhawani Shankar', '']]","['Page Rank', 'Web Mining', 'Web Structured Mining', 'Web Content Mining']"
2245,1901.04281,Mohammed Harun,"Mohammed Harun Babu R, Vinayakumar R, Soman KP",RNNSecureNet: Recurrent neural networks for Cyber security use-cases,12 pages. arXiv admin note: text overlap with arXiv:1812.03519,,10.13140/RG.2.2.21876.81283,,cs.CR cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Recurrent neural network (RNN) is an effective neural network in solving very
complex supervised and unsupervised tasks. There has been a significant
improvement in RNN field such as natural language processing, speech
processing, computer vision and other multiple domains. This paper deals with
RNN application on different use cases like Incident Detection, Fraud
Detection, and Android Malware Classification. The best performing neural
network architecture is chosen by conducting different chain of experiments for
different network parameters and structures. The network is run up to 1000
epochs with learning rate set in the range of 0.01 to 0.5.Obviously, RNN
performed very well when compared to classical machine learning algorithms.
This is mainly possible because RNNs implicitly extracts the underlying
features and also identifies the characteristics of the data. This helps to
achieve better accuracy.
","[{'version': 'v1', 'created': 'Sat, 5 Jan 2019 17:18:14 GMT'}]",2019-01-15,"[['R', 'Mohammed Harun Babu', ''], ['R', 'Vinayakumar', ''], ['KP', 'Soman', '']]","['Deep neural networks (DNNs)', 'recurrent neural network (RNN)', 'Cyber security', 'Android malware classification', 'incident detection', 'fraud detection']"
2246,2102.04960,Huan Yin,"Huan Yin, Xuecheng Xu, Yue Wang and Rong Xiong",Radar-to-Lidar: Heterogeneous Place Recognition via Joint Learning,"Published by Frontiers in Robotics and AI. The published version is
  available at
  https://www.frontiersin.org/articles/10.3389/frobt.2021.661199/full . The
  source code is available at
  https://github.com/ZJUYH/radar-to-lidar-place-recognition",,10.3389/frobt.2021.661199,,cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Place recognition is critical for both offline mapping and online
localization. However, current single-sensor based place recognition still
remains challenging in adverse conditions. In this paper, a heterogeneous
measurements based framework is proposed for long-term place recognition, which
retrieves the query radar scans from the existing lidar maps. To achieve this,
a deep neural network is built with joint training in the learning stage, and
then in the testing stage, shared embeddings of radar and lidar are extracted
for heterogeneous place recognition. To validate the effectiveness of the
proposed method, we conduct tests and generalization experiments on the
multi-session public datasets compared to other competitive methods. The
experimental results indicate that our model is able to perform multiple place
recognitions: lidar-to-lidar, radar-to-radar and radar-to-lidar, while the
learned model is trained only once. We also release the source code publicly:
https://github.com/ZJUYH/radar-to-lidar-place-recognition.
","[{'version': 'v1', 'created': 'Sat, 30 Jan 2021 15:34:58 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Jun 2021 09:31:08 GMT'}]",2021-06-21,"[['Yin', 'Huan', ''], ['Xu', 'Xuecheng', ''], ['Wang', 'Yue', ''], ['Xiong', 'Rong', '']]","['radar', 'lidar', 'heterogeneous measurements', 'place recognition', 'deep neural network']"
2247,1805.05356,Swaminathan Gurumurthy,"Swaminathan Gurumurthy, Lantao Yu, Chenyan Zhang, Yongchao Jin,
  Weiping Li, Haidong Zhang, Fei Fang",Exploiting Data and Human Knowledge for Predicting Wildlife Poaching,COMPASS 2018,,10.1145/3209811.3209879,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Poaching continues to be a significant threat to the conservation of wildlife
and the associated ecosystem. Estimating and predicting where the poachers have
committed or would commit crimes is essential to more effective allocation of
patrolling resources. The real-world data in this domain is often sparse, noisy
and incomplete, consisting of a small number of positive data (poaching signs),
a large number of negative data with label uncertainty, and an even larger
number of unlabeled data. Fortunately, domain experts such as rangers can
provide complementary information about poaching activity patterns. However,
this kind of human knowledge has rarely been used in previous approaches. In
this paper, we contribute new solutions to the predictive analysis of poaching
patterns by exploiting both very limited data and human knowledge. We propose
an approach to elicit quantitative information from domain experts through a
questionnaire built upon a clustering-based division of the conservation area.
In addition, we propose algorithms that exploit qualitative and quantitative
information provided by the domain experts to augment the dataset and improve
learning. In collaboration with World Wild Fund for Nature, we show that
incorporating human knowledge leads to better predictions in a conservation
area in Northeastern China where the charismatic species is Siberian Tiger. The
results show the importance of exploiting human knowledge when learning from
limited data.
","[{'version': 'v1', 'created': 'Mon, 14 May 2018 18:01:13 GMT'}]",2018-05-16,"[['Gurumurthy', 'Swaminathan', ''], ['Yu', 'Lantao', ''], ['Zhang', 'Chenyan', ''], ['Jin', 'Yongchao', ''], ['Li', 'Weiping', ''], ['Zhang', 'Haidong', ''], ['Fang', 'Fei', '']]","['Computational Sustainability', 'Wildlife Conservation', 'Applied Machine Learning', 'Limited Labeled Data']"
2248,2108.01542,Matthias Springstein,"Matthias Springstein, Stefanie Schneider, Javad Rahnama, Eyke
  H\""ullermeier, Hubertus Kohle, Ralph Ewerth","iART: A Search Engine for Art-Historical Images to Support Research in
  the Humanities",,ACM Multimedia Conference 2021,10.1145/3474085.3478564,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce iART: an open Web platform for art-historical
research that facilitates the process of comparative vision. The system
integrates various machine learning techniques for keyword- and content-based
image retrieval as well as category formation via clustering. An intuitive GUI
supports users to define queries and explore results. By using a
state-of-the-art cross-modal deep learning approach, it is possible to search
for concepts that were not previously detected by trained classification
models. Art-historical objects from large, openly licensed collections such as
Amsterdam Rijksmuseum and Wikidata are made available to users.
","[{'version': 'v1', 'created': 'Tue, 3 Aug 2021 14:51:28 GMT'}]",2022-01-10,"[['Springstein', 'Matthias', ''], ['Schneider', 'Stefanie', ''], ['Rahnama', 'Javad', ''], ['Hüllermeier', 'Eyke', ''], ['Kohle', 'Hubertus', ''], ['Ewerth', 'Ralph', '']]","['Web application', 'Cross-modal retrieval', 'Deep learning', 'Art']"
2249,2108.13041,Amin Banitalebi-Dehkordi,"Amin Banitalebi-Dehkordi, Naveen Vedula, Jian Pei, Fei Xia, Lanjun
  Wang, Yong Zhang",Auto-Split: A General Framework of Collaborative Edge-Cloud AI,"Published in KDD 2021. Code and demo available at:
  https://marketplace.huaweicloud.com/markets/aihub/notebook/detail/?id=5fad1eb4-50b2-4ac9-bcb0-a1f744cf85c7","KDD '21: the 27th ACM SIGKDD Conference on Knowledge Discovery &
  Data Mining, August 2021",,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many industry scale applications, large and resource consuming machine
learning models reside in powerful cloud servers. At the same time, large
amounts of input data are collected at the edge of cloud. The inference results
are also communicated to users or passed to downstream tasks at the edge. The
edge often consists of a large number of low-power devices. It is a big
challenge to design industry products to support sophisticated deep model
deployment and conduct model inference in an efficient manner so that the model
accuracy remains high and the end-to-end latency is kept low. This paper
describes the techniques and engineering practice behind Auto-Split, an
edge-cloud collaborative prototype of Huawei Cloud. This patented technology is
already validated on selected applications, is on its way for broader
systematic edge-cloud application integration, and is being made available for
public use as an automated pipeline service for end-to-end cloud-edge
collaborative intelligence deployment. To the best of our knowledge, there is
no existing industry product that provides the capability of Deep Neural
Network (DNN) splitting.
","[{'version': 'v1', 'created': 'Mon, 30 Aug 2021 08:03:29 GMT'}]",2021-08-31,"[['Banitalebi-Dehkordi', 'Amin', ''], ['Vedula', 'Naveen', ''], ['Pei', 'Jian', ''], ['Xia', 'Fei', ''], ['Wang', 'Lanjun', ''], ['Zhang', 'Yong', '']]","['Edge-Cloud Collaboration', 'Network Splitting', 'Neural Networks', 'Mixed Precision', 'Collaborative Intelligence', 'Distributed Inference']"
2250,1707.08390,Johanna Delanoy,"Johanna Delanoy, Mathieu Aubry, Phillip Isola, Alexei A. Efros, Adrien
  Bousseau",3D Sketching using Multi-View Deep Volumetric Prediction,"See our accompanying video on https://youtu.be/DGIYzmlm2pQ, networks
  and databases available at https://ns.inria.fr/d3/3DSketching/. To appear in
  PACMCGIT",,10.1145/3203197,,cs.GR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sketch-based modeling strives to bring the ease and immediacy of drawing to
the 3D world. However, while drawings are easy for humans to create, they are
very challenging for computers to interpret due to their sparsity and
ambiguity. We propose a data-driven approach that tackles this challenge by
learning to reconstruct 3D shapes from one or more drawings. At the core of our
approach is a deep convolutional neural network (CNN) that predicts occupancy
of a voxel grid from a line drawing. This CNN provides us with an initial 3D
reconstruction as soon as the user completes a single drawing of the desired
shape. We complement this single-view network with an updater CNN that refines
an existing prediction given a new drawing of the shape created from a novel
viewpoint. A key advantage of our approach is that we can apply the updater
iteratively to fuse information from an arbitrary number of viewpoints, without
requiring explicit stroke correspondences between the drawings. We train both
CNNs by rendering synthetic contour drawings from hand-modeled shape
collections as well as from procedurally-generated abstract shapes. Finally, we
integrate our CNNs in a minimal modeling interface that allows users to
seamlessly draw an object, rotate it to see its 3D reconstruction, and refine
it by re-drawing from another vantage point using the 3D reconstruction as
guidance. The main strengths of our approach are its robustness to freehand
bitmap drawings, its ability to adapt to different object categories, and the
continuum it offers between single-view and multi-view sketch-based modeling.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 11:49:48 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Jul 2017 06:24:49 GMT'}, {'version': 'v3', 'created': 'Thu, 24 May 2018 20:56:46 GMT'}, {'version': 'v4', 'created': 'Tue, 19 Jun 2018 12:24:54 GMT'}]",2018-06-20,"[['Delanoy', 'Johanna', ''], ['Aubry', 'Mathieu', ''], ['Isola', 'Phillip', ''], ['Efros', 'Alexei A.', ''], ['Bousseau', 'Adrien', '']]","['sketch-based modeling', 'deep learning', '3D reconstruction', 'line drawing']"
2251,2003.13300,Adrian-Catalin Florea,"Razvan Andonie, Adrian-Catalin Florea",Weighted Random Search for CNN Hyperparameter Optimization,"11 pages, 2 figurs, journal article","International Journal of Computers Communications & Control, Vol
  15, Nr 2, 2020",10.15837/ijccc.2020.2.3868,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nearly all model algorithms used in machine learning use two different sets
of parameters: the training parameters and the meta-parameters
(hyperparameters). While the training parameters are learned during the
training phase, the values of the hyperparameters have to be specified before
learning starts. For a given dataset, we would like to find the optimal
combination of hyperparameter values, in a reasonable amount of time. This is a
challenging task because of its computational complexity. In previous work
[11], we introduced the Weighted Random Search (WRS) method, a combination of
Random Search (RS) and probabilistic greedy heuristic. In the current paper, we
compare the WRS method with several state-of-the art hyperparameter
optimization methods with respect to Convolutional Neural Network (CNN)
hyperparameter optimization. The criterion is the classification accuracy
achieved within the same number of tested combinations of hyperparameter
values. According to our experiments, the WRS algorithm outperforms the other
methods.
","[{'version': 'v1', 'created': 'Mon, 30 Mar 2020 09:40:14 GMT'}]",2020-03-31,"[['Andonie', 'Razvan', ''], ['Florea', 'Adrian-Catalin', '']]","['Hyperparameter optimization', 'supervised learning', 'random search', 'convolutional']"
2252,0812.3259,Valmir Barbosa,"Rodrigo S. C. Leao, Valmir C. Barbosa","Approximate conditional distributions of distances between nodes in a
  two-dimensional sensor network",,"Lecture Notes in Computer Science 5513 (2009), 324-338",10.1007/978-3-642-02205-0_23,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When we represent a network of sensors in Euclidean space by a graph, there
are two distances between any two nodes that we may consider. One of them is
the Euclidean distance. The other is the distance between the two nodes in the
graph, defined to be the number of edges on a shortest path between them. In
this paper, we consider a network of sensors placed uniformly at random in a
two-dimensional region and study two conditional distributions related to these
distances. The first is the probability distribution of distances in the graph,
conditioned on Euclidean distances; the other is the probability density
function associated with Euclidean distances, conditioned on distances in the
graph. We study these distributions both analytically (when feasible) and by
means of simulations. To the best of our knowledge, our results constitute the
first of their kind and open up the possibility of discovering improved
solutions to certain sensor-network problems, as for example sensor
localization.
","[{'version': 'v1', 'created': 'Wed, 17 Dec 2008 11:23:59 GMT'}]",2009-06-10,"[['Leao', 'Rodrigo S. C.', ''], ['Barbosa', 'Valmir C.', '']]","['Sensor networks', 'Random geometric graphs', 'Distance distributions']"
2253,2102.08361,Tarik A. Rashid,"Bryar A. Hassan, Tarik A. Rashid","A Multi-disciplinary Ensemble Algorithm for Clustering Heterogeneous
  Datasets",30 pages,"Neural Computing and Applications, 2021",10.1007/s00521-020-05649-1,,cs.LG cs.NE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Clustering is a commonly used method for exploring and analysing data where
the primary objective is to categorise observations into similar clusters. In
recent decades, several algorithms and methods have been developed for
analysing clustered data. We notice that most of these techniques
deterministically define a cluster based on the value of the attributes,
distance, and density of homogenous and single-featured datasets. However,
these definitions are not successful in adding clear semantic meaning to the
clusters produced. Evolutionary operators and statistical and
multi-disciplinary techniques may help in generating meaningful clusters. Based
on this premise, we propose a new evolutionary clustering algorithm (ECAStar)
based on social class ranking and meta-heuristic algorithms for stochastically
analysing heterogeneous and multiple-featured datasets. The ECAStar is
integrated with recombinational evolutionary operators, Levy flight
optimisation, and some statistical techniques, such as quartiles and
percentiles, as well as the Euclidean distance of the K-means algorithm.
Experiments are conducted to evaluate the ECAStar against five conventional
approaches: K-means (KM), K-meansPlusPlus (KMPlusPlus), expectation
maximisation (EM), learning vector quantisation (LVQ), and the genetic
algorithm for clusteringPlusPlus (GENCLUSTPlusPlus).
","[{'version': 'v1', 'created': 'Fri, 1 Jan 2021 07:20:50 GMT'}]",2021-02-17,"[['Hassan', 'Bryar A.', ''], ['Rashid', 'Tarik A.', '']]","['Clustering', 'evolutionary clustering algorithm', 'social class ranking', 'meta-heuristic algorithms', 'quartiles and percentiles', 'clustering evaluation']"
2254,1909.05637,Tao-Yang Fu,"Tao-yang Fu, Wang-Chien Lee","DeepIST: Deep Image-based Spatio-Temporal Network for Travel Time
  Estimation","10 pages, accepted by The 28th ACM International Conference on
  Information and Knowledge Management (CIKM) 2019","The 28th ACM International Conference on Information and Knowledge
  Management (CIKM) 2019",10.1145/3357384.3357870,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Estimating the travel time for a given path is a fundamental problem in many
urban transportation systems. However, prior works fail to well capture moving
behaviors embedded in paths and thus do not estimate the travel time
accurately. To fill in this gap, in this work, we propose a novel neural
network framework, namely {\em Deep Image-based Spatio-Temporal network
(DeepIST)}, for travel time estimation of a given path. The novelty of DeepIST
lies in the following aspects: 1) we propose to plot a path as a sequence of
""generalized images"" which include sub-paths along with additional information,
such as traffic conditions, road network and traffic signals, in order to
harness the power of convolutional neural network model (CNN) on image
processing; 2) we design a novel two-dimensional CNN, namely {\em PathCNN}, to
extract spatial patterns for lines in images by regularization and adopting
multiple pooling methods; and 3) we apply a one-dimensional CNN to capture
temporal patterns among the spatial patterns along the paths for the
estimation. Empirical results show that DeepIST soundly outperforms the
state-of-the-art travel time estimation models by 24.37\% to 25.64\% of mean
absolute error (MAE) in multiple large-scale real-world datasets.
","[{'version': 'v1', 'created': 'Thu, 5 Sep 2019 04:38:42 GMT'}]",2019-09-13,"[['Fu', 'Tao-yang', ''], ['Lee', 'Wang-Chien', '']]","['neural networks', 'spatio-temporal data', 'travel time estimation']"
2255,1808.10523,Lei Zheng,"Lei Zheng, Chun-Ta Lu, Fei Jiang, Jiawei Zhang, Philip S. Yu",Spectral Collaborative Filtering,RecSys2018,,10.1145/3240323.3240343,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the popularity of Collaborative Filtering (CF), CF-based methods are
haunted by the \textit{cold-start} problem, which has a significantly negative
impact on users' experiences with Recommender Systems (RS). In this paper, to
overcome the aforementioned drawback, we first formulate the relationships
between users and items as a bipartite graph. Then, we propose a new spectral
convolution operation directly performing in the \textit{spectral domain},
where not only the proximity information of a graph but also the connectivity
information hidden in the graph are revealed. With the proposed spectral
convolution operation, we build a deep recommendation model called Spectral
Collaborative Filtering (SpectralCF). Benefiting from the rich information of
connectivity existing in the \textit{spectral domain}, SpectralCF is capable of
discovering deep connections between users and items and therefore, alleviates
the \textit{cold-start} problem for CF. To the best of our knowledge,
SpectralCF is the first CF-based method directly learning from the
\textit{spectral domains} of user-item bipartite graphs. We apply our method on
several standard datasets. It is shown that SpectralCF significantly
outperforms state-of-the-art models. Code and data are available at
\url{https://github.com/lzheng21/SpectralCF}.
","[{'version': 'v1', 'created': 'Thu, 30 Aug 2018 21:12:03 GMT'}]",2018-09-03,"[['Zheng', 'Lei', ''], ['Lu', 'Chun-Ta', ''], ['Jiang', 'Fei', ''], ['Zhang', 'Jiawei', ''], ['Yu', 'Philip S.', '']]","['Recommender Systems', 'Spectrum', 'Collaborative Filtering']"
2256,1005.4499,Secretary Aircc Journal,"Eslam Gamal Ahmed, Eman Shaaban and Mohamed Hashem",Lightweight Mutual Authentication Protocol for Low Cost RFID Tags,"11 Pages, IJNSA","International Journal of Network Security & Its Applications 2.2
  (2010) 27-37",10.5121/ijnsa.2010.2203,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Radio Frequency Identification (RFID) technology one of the most promising
technologies in the field of ubiquitous computing. Indeed, RFID technology may
well replace barcode technology. Although it offers many advantages over other
identification systems, there are also associated security risks that are not
easy to be addressed. When designing a real lightweight authentication protocol
for low cost RFID tags, a number of challenges arise due to the extremely
limited computational, storage and communication abilities of Low-cost RFID
tags. This paper proposes a real mutual authentication protocol for low cost
RFID tags. The proposed protocol prevents passive attacks as active attacks are
discounted when designing a protocol to meet the requirements of low cost RFID
tags. However the implementation of the protocol meets the limited abilities of
low cost RFID tags.
","[{'version': 'v1', 'created': 'Tue, 25 May 2010 07:59:29 GMT'}]",2010-07-15,"[['Ahmed', 'Eslam Gamal', ''], ['Shaaban', 'Eman', ''], ['Hashem', 'Mohamed', '']]","['RFID', 'Mutual Authentication', 'ubiquitous computing', 'Pervasive computing', 'Gossamer']"
2257,1305.4311,P. K. Gupta,"Kuwar Pratap Singh, P K Gupta and G Singh","Performance Evaluation of Enhanced Interior Gateway Routing Protocol in
  IPv6 Network",6 pages,,10.5120/11962-7802,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the explosive growth in communication and network technologies, there is
a great demand of IPv6 addressing scheme. However, the modern operating systems
has option for this and with the development of IPv6 which removes the
limitations imposed by IPv4 and provides the large number of address space. In
this paper, authors have considered the Enhanced Interior Gateway Routing
Protocol and presented a scenario for its performance evaluation in IPv6
networks and obtained results are highly considerable for the short distance of
communication and don't represent any problem of performance degradation while
sending or receiving the data.
","[{'version': 'v1', 'created': 'Sun, 19 May 2013 00:39:48 GMT'}]",2013-05-21,"[['Singh', 'Kuwar Pratap', ''], ['Gupta', 'P K', ''], ['Singh', 'G', '']]","['EIGRP', 'IPv6', 'Routing', 'OSPF', 'Local Area Network', 'Wide Area Network']"
2258,1903.03546,Mira Rizkallah,"Mira Rizkallah, Thomas Maugey and Christine Guillemot","Prediction and Sampling with Local Graph Transforms for Quasi-Lossless
  Light Field Compression",,,10.1109/TIP.2019.2959215,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph-based transforms have been shown to be powerful tools in terms of image
energy compaction. However, when the support increases to best capture signal
dependencies, the computation of the basis functions becomes rapidly
untractable. This problem is in particular compelling for high dimensional
imaging data such as light fields. The use of local transforms with limited
supports is a way to cope with this computational difficulty. Unfortunately,
the locality of the support may not allow us to fully exploit long term signal
dependencies present in both the spatial and angular dimensions in the case of
light fields. This paper describes sampling and prediction schemes with local
graph-based transforms enabling to efficiently compact the signal energy and
exploit dependencies beyond the local graph support. The proposed approach is
investigated and is shown to be very efficient in the context of spatio-angular
transforms for quasi-lossless compression of light fields.
","[{'version': 'v1', 'created': 'Fri, 8 Mar 2019 16:49:49 GMT'}]",2020-02-19,"[['Rizkallah', 'Mira', ''], ['Maugey', 'Thomas', ''], ['Guillemot', 'Christine', '']]","['Light Fields', 'Energy Compaction', 'Transform coding', 'Super-rays', 'Graph FourierTransform', 'Prediction', 'Sampling']"
2259,1606.07283,Niek Tax,"Niek Tax, Natalia Sidorova, Reinder Haakma, Wil M. P. van der Aalst","Event Abstraction for Process Mining using Supervised Learning
  Techniques","paper to appear in the proceedings of the SAI Intelligent Systems
  Conference 2016","Lecture Notes in Networks and Systems, 15 (2017), 251-269",10.1007/978-3-319-56994-9_18,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Process mining techniques focus on extracting insight in processes from event
logs. In many cases, events recorded in the event log are too fine-grained,
causing process discovery algorithms to discover incomprehensible process
models or process models that are not representative of the event log. We show
that when process discovery algorithms are only able to discover an
unrepresentative process model from a low-level event log, structure in the
process can in some cases still be discovered by first abstracting the event
log to a higher level of granularity. This gives rise to the challenge to
bridge the gap between an original low-level event log and a desired high-level
perspective on this log, such that a more structured or more comprehensible
process model can be discovered. We show that supervised learning can be
leveraged for the event abstraction task when annotations with high-level
interpretations of the low-level events are available for a subset of the
sequences (i.e., traces). We present a method to generate feature vector
representations of events based on XES extensions, and describe an approach to
abstract events in an event log with Condition Random Fields using these event
features. Furthermore, we propose a sequence-focused metric to evaluate
supervised event abstraction results that fits closely to the tasks of process
discovery and conformance checking. We conclude this paper by demonstrating the
usefulness of supervised event abstraction for obtaining more structured and/or
more comprehensible process models using both real life event data and
synthetic event data.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2016 12:12:45 GMT'}]",2017-12-20,"[['Tax', 'Niek', ''], ['Sidorova', 'Natalia', ''], ['Haakma', 'Reinder', ''], ['van der Aalst', 'Wil M. P.', '']]","['Process Mining', 'Event Abstraction', 'ProbabilisticGraphical Models']"
2260,2102.12566,Stephen MacDonell,"Sherlock A. Licorish, Stephen G. MacDonell and Tony Clear","Analyzing Confidentiality and Privacy Concerns: Insights from Android
  Issue Logs","Conference paper, 10 pages, 3 figures, 7 tables","Proceedings of the 19th International Conference on Evaluation and
  Assessment in Software Engineering (EASE2015). Nanjing, China, ACM Press,
  pp.1-10",10.1145/2745802.2745819,,cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Post-release user feedback plays an integral role in improving
software quality and informing new features. Given its growing importance,
feedback concerning security enhancements is particularly noteworthy. In
considering the rapid uptake of Android we have examined the scale and severity
of Android security threats as reported by its stakeholders. Objective: We
systematically mine Android issue logs to derive insights into stakeholder
perceptions and experiences in relation to certain Android security issues.
Method: We employed contextual analysis techniques to study issues raised
regarding confidentiality and privacy in the last three major Android releases,
considering covariance of stakeholder comments, and the level of consistency in
user preferences and priorities. Results: Confidentiality and privacy concerns
varied in severity, and were most prevalent over Jelly Bean releases. Issues
raised in regard to confidentiality related mostly to access, user credentials
and permission management, while privacy concerns were mainly expressed about
phone locking. Community users also expressed divergent preferences for new
security features, ranging from more relaxed to very strict. Conclusion:
Strategies that support continuous corrective measures for both old and new
Android releases would likely maintain stakeholder confidence. An approach that
provides users with basic default security settings, but with the power to
configure additional security features if desired, would provide the best
balance for Android's wide cohort of stakeholders.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2021 21:31:00 GMT'}]",2021-02-26,"[['Licorish', 'Sherlock A.', ''], ['MacDonell', 'Stephen G.', ''], ['Clear', 'Tony', '']]","['Android', 'Security', 'Confidentiality', 'Privacy', 'Content Analysis', 'Empirical Analysis']"
2261,1504.03217,Pedro Henrique Gonz\'alez,"Pedro Henrique Gonz\'alez, Luidi Simonetti, Philippe Michelon, Carlos
  Martinhon, Edcarllos Santos","A Variable Fixing Heuristic with Local Branching for the Fixed Charge
  Uncapacitated Network Design Problem with User-optimal Flow","32 pages, 10 figures, submitted to Computers and Operations Research",,10.1016/j.cor.2016.06.016,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an iterated local search for the fixed-charge
uncapacitated network design problem with user-optimal flow (FCNDP-UOF), which
concerns routing multiple commodities from its origin to its destination by
signing a network through selecting arcs, with an objective of minimizing the
sum of the fixed costs of the selected arcs plus the sum of variable costs
associated to the flows on each arc. Besides that, since the FCNDP-UOF is a
bi-level problem, each commodity has to be transported through a shortest path,
concerning the edges length, in the built network. The proposed algorithm
generate a initial solution using a variable fixing heuristic. Then a local
branching strategy is applied to improve the quality of the solution. At last,
an efficient perturbation strategy is presented to perform cycle-based moves to
explore different parts of the solution space. Computational experiments shows
that the proposed solution method consistently produces high-quality solutions
in reasonable computational times.
","[{'version': 'v1', 'created': 'Mon, 13 Apr 2015 15:30:15 GMT'}]",2020-06-22,"[['González', 'Pedro Henrique', ''], ['Simonetti', 'Luidi', ''], ['Michelon', 'Philippe', ''], ['Martinhon', 'Carlos', ''], ['Santos', 'Edcarllos', '']]","['Network Design', 'Bilevel Problem', 'Heuristics', 'Local Branching']"
2262,1203.2268,Aaron Clauset,Winter Mason and Aaron Clauset,"Friends FTW! Friendship, Collaboration and Competition in Halo: Reach","12 pages, 12 figures, 4 tables","Proceedings of the 2013 Conference on Computer Supported
  Cooperative Work (CSCW '13), 375-386 (2013)",10.1145/2441776.2441820,,cs.SI cs.CY cs.HC physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  How important are friendships in determining success by individuals and teams
in complex collaborative environments? By combining a novel data set containing
the dynamics of millions of ad hoc teams from the popular multiplayer online
first person shooter Halo: Reach with survey data on player demographics, play
style, psychometrics and friendships derived from an anonymous online survey,
we investigate the impact of friendship on collaborative and competitive
performance. In addition to finding significant differences in player behavior
across these variables, we find that friendships exert a strong influence,
leading to both improved individual and team performance--even after
controlling for the overall expertise of the team--and increased pro-social
behaviors. Players also structure their in-game activities around social
opportunities, and as a result hidden friendship ties can be accurately
inferred directly from behavioral time series. Virtual environments that enable
such friendship effects will thus likely see improved collaboration and
competition.
","[{'version': 'v1', 'created': 'Sat, 10 Mar 2012 17:31:47 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Feb 2013 03:12:07 GMT'}]",2013-02-27,"[['Mason', 'Winter', ''], ['Clauset', 'Aaron', '']]","['Social Mining', 'Group Dynamics', 'MMO']"
2263,1305.0300,Andrew Adamatzky,Andrew Adamatzky and Genaro J. Martinez,"Bio-imitaiton of Mexican migration routes to the USA with slime mould on
  3D terrains",,"Adamatzky A. and Martinez G. J. Bio-Imitation of Mexican Migration
  Routes to the USA with Slime Mould on 3D Terrains. J Bionic Engineering 10
  (2013) 242--250",10.1016/S1672-6529(13)60220-6,,cs.ET nlin.AO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Plasmodium of Physarum polycephalum is a large single cell visible by unaided
eye. It shows sophisticated behavioural traits in foraging for nutrients and
developing an optimal transport network of protoplasmic tubes spanning sources
of nutrients. When placed in an environment with distributed sources of
nutrients the cell 'computes' an optimal graph spanning the nutrients by
growing a network of protoplasmic tubes. P. polycephalum imitates development
of man-made transport networks of a country when configuration of nutrients
represents major urban areas. We employ this feature of the slime mould to
imitate mexican migration to USA. The Mexican migration to USA is the World's
largest migration system. We bio-physically imitate the migration using slime
mould P. polycephalum. In laboratory experiments with 3D Nylon terrains of USA
we imitated development of migratory routes from Mexico-USA border to ten urban
areas with high concentration of Mexican migrants. From results of laboratory
experiments we extracted topologies of migratory routes, and highlighted a role
of elevations in shaping the human movement networks.
","[{'version': 'v1', 'created': 'Wed, 1 May 2013 21:52:02 GMT'}]",2013-05-03,"[['Adamatzky', 'Andrew', ''], ['Martinez', 'Genaro J.', '']]","['migration', 'routes', 'Mexico', 'USA', 'slime mould', 'unconventional computing']"
2264,1309.4616,Lukas Einkemmer,Lukas Einkemmer and Alexander Ostermann,Exponential Integrators on Graphic Processing Units,"To appear in: Proceedings of the 2013 International Conference on
  High Performance Computing Simulation (HPCS 2013), IEEE (2013)","High Performance Computing and Simulation (HPCS), 2013
  International Conference on, pp. 490-496",10.1109/HPCSim.2013.6641458,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we revisit stencil methods on GPUs in the context of
exponential integrators. We further discuss boundary conditions, in the same
context, and show that simple boundary conditions (for example, homogeneous
Dirichlet or homogeneous Neumann boundary conditions) do not affect the
performance if implemented directly into the CUDA kernel. In addition, we show
that stencil methods with position-dependent coefficients can be implemented
efficiently as well.
  As an application, we discuss the implementation of exponential integrators
for different classes of problems in a single and multi GPU setup (up to 4
GPUs). We further show that for stencil based methods such parallelization can
be done very efficiently, while for some unstructured matrices the
parallelization to multiple GPUs is severely limited by the throughput of the
PCIe bus.
","[{'version': 'v1', 'created': 'Wed, 18 Sep 2013 11:21:05 GMT'}]",2014-05-27,"[['Einkemmer', 'Lukas', ''], ['Ostermann', 'Alexander', '']]","['GPGPU', 'exponential integrators', 'time integrationof differential equations', 'stencil methods', 'multi GPU setup']"
2265,1607.05868,Mohammad Khodaei,Mohammad Khodaei and Panos Papadimitratos,"Evaluating On-demand Pseudonym Acquisition Policies in Vehicular
  Communication Systems","6 pages, 7 figures, IoV-VoI'16",,10.1145/2938681.2938684,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Standardization and harmonization efforts have reached a consensus towards
using a special-purpose Vehicular Public-Key Infrastructure (VPKI) in upcoming
Vehicular Communication (VC) systems. However, there are still several
technical challenges with no conclusive answers; one such an important yet open
challenge is the acquisition of shortterm credentials, pseudonym: how should
each vehicle interact with the VPKI, e.g., how frequently and for how long?
Should each vehicle itself determine the pseudonym lifetime? Answering these
questions is far from trivial. Each choice can affect both the user privacy and
the system performance and possibly, as a result, its security. In this paper,
we make a novel systematic effort to address this multifaceted question. We
craft three generally applicable policies and experimentally evaluate the VPKI
system performance, leveraging two large-scale mobility datasets. We consider
the most promising, in terms of efficiency, pseudonym acquisition policies; we
find that within this class of policies, the most promising policy in terms of
privacy protection can be supported with moderate overhead. Moreover, in all
cases, this work is the first to provide tangible evidence that the
state-of-the-art VPKI can serve sizable areas or domain with modest computing
resources.
","[{'version': 'v1', 'created': 'Wed, 20 Jul 2016 09:02:01 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Jul 2017 14:57:07 GMT'}]",2017-07-05,"[['Khodaei', 'Mohammad', ''], ['Papadimitratos', 'Panos', '']]","['Vehicular Communications', 'Security', 'Privacy', 'Access Control', 'Identity and Credential Management', 'Vehicular PKI']"
2266,2003.13532,Jamal Toutouh,"Jamal Toutouh, Erik Hemberg, and Una-May O'Reilly","Re-purposing Heterogeneous Generative Ensembles with Evolutionary
  Computation","Accepted as a full paper for the Genetic and Evolutionary Computation
  Conference - GECCO'20",,10.1145/3377930.3390229,,cs.AI cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generative Adversarial Networks (GANs) are popular tools for generative
modeling. The dynamics of their adversarial learning give rise to convergence
pathologies during training such as mode and discriminator collapse. In machine
learning, ensembles of predictors demonstrate better results than a single
predictor for many tasks. In this study, we apply two evolutionary algorithms
(EAs) to create ensembles to re-purpose generative models, i.e., given a set of
heterogeneous generators that were optimized for one objective (e.g., minimize
Frechet Inception Distance), create ensembles of them for optimizing a
different objective (e.g., maximize the diversity of the generated samples).
The first method is restricted by the exact size of the ensemble and the second
method only restricts the upper bound of the ensemble size. Experimental
analysis on the MNIST image benchmark demonstrates that both EA ensembles
creation methods can re-purpose the models, without reducing their original
functionality. The EA-based demonstrate significantly better performance
compared to other heuristic-based methods. When comparing both evolutionary,
the one with only an upper size bound on the ensemble size is the best.
","[{'version': 'v1', 'created': 'Mon, 30 Mar 2020 15:04:40 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Aug 2020 17:48:34 GMT'}]",2020-08-04,"[['Toutouh', 'Jamal', ''], ['Hemberg', 'Erik', ''], [""O'Reilly"", 'Una-May', '']]","['Generative adversarial networks', 'ensembles', 'genetic algorithms', 'diversity']"
2267,1908.02520,Rudy Arthur,Rudy Arthur,Modularity and Projection of Bipartite Networks,,,10.1016/j.physa.2020.124341,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates community detection by modularity maximisation on
bipartite networks. In particular we are interested in how the operation of
projection, using one node set of the bipartite network to infer connections
between nodes in the other set, interacts with community detection. We first
define a notion of modularity appropriate for a projected bipartite network and
outline an algorithm for maximising it in order to partition the network. Using
both real and synthetic networks we compare the communities found by five
different algorithms, where each algorithm maximises a different modularity
function and sees different aspects of the bipartite structure. Based on these
results we suggest a simple heuristic for finding communities in bipartite
networks.
","[{'version': 'v1', 'created': 'Wed, 7 Aug 2019 10:37:56 GMT'}]",2020-05-20,"[['Arthur', 'Rudy', '']]","['Networks', 'Community Detection', 'Bipartite', 'Modularity']"
2268,1911.09057,Lucas Gren,"Lucas Gren, Alfredo Goldman and Christian Jacobsson","The perceived effects of group developmental psychology training on
  agile software development teams",,"IEEE Software, 2019",10.1109/MS.2019.2955675,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Research has shown that the maturity of small workgroups from a psychological
perspective is intimately connected to team agility. We, therefore, tested if
agile team members appreciated group development psychology training. Our
results show that the participating teams seem to have a very positive view of
group development training and state that they now have a new way of thinking
about teamwork and new tools to deal with team-related problems. We, therefore,
see huge potential in training agile teams in group development psychology
since the positive effects might span over the entire software development
organization.
","[{'version': 'v1', 'created': 'Wed, 20 Nov 2019 17:41:57 GMT'}]",2019-11-26,"[['Gren', 'Lucas', ''], ['Goldman', 'Alfredo', ''], ['Jacobsson', 'Christian', '']]","['group development', 'group dynamics', 'agile teams', 'behavioral software engineering', 'psychology']"
2269,1903.11485,Riku Arakawa,Riku Arakawa and Hiromu Yakura,"REsCUE: A framework for REal-time feedback on behavioral CUEs using
  multimodal anomaly detection",ACM CHI 2019,,10.1145/3290605.3300802,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Executive coaching has been drawing more and more attention for developing
corporate managers. While conversing with managers, coach practitioners are
also required to understand internal states of coachees through objective
observations. In this paper, we present REsCUE, an automated system to aid
coach practitioners in detecting unconscious behaviors of their clients. Using
an unsupervised anomaly detection algorithm applied to multimodal behavior data
such as the subject's posture and gaze, REsCUE notifies behavioral cues for
coaches via intuitive and interpretive feedback in real-time. Our evaluation
with actual coaching scenes confirms that REsCUE provides the informative cues
to understand internal states of coachees. Since REsCUE is based on the
unsupervised method and does not assume any prior knowledge, further
applications beside executive coaching are conceivable using our framework.
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2019 15:24:48 GMT'}]",2019-03-28,"[['Arakawa', 'Riku', ''], ['Yakura', 'Hiromu', '']]","['Executive Coaching', 'Nonverbal behavior analysis', 'Multimodal interaction', 'Anomaly detection']"
2270,1311.7589,Marc Renault,"Marc P. Renault, Adi Ros\'en and Rob van Stee",Online Algorithms with Advice for Bin Packing and Scheduling Problems,20 pages,,10.1016/j.tcs.2015.07.050,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the setting of online computation with advice, and study the bin
packing problem and a number of scheduling problems. We show that it is
possible, for any of these problems, to arbitrarily approach a competitive
ratio of $1$ with only a constant number of bits of advice per request. For the
bin packing problem, we give an online algorithm with advice that is
$(1+\varepsilon)$-competitive and uses $O\left(\frac{1}{\varepsilon}\log
\frac{1}{\varepsilon} \right)$ bits of advice per request. For scheduling on
$m$ identical machines, with the objective function of any of makespan, machine
covering and the minimization of the $\ell_p$ norm, $p >1$, we give similar
results. We give online algorithms with advice which are
$(1+\varepsilon)$-competitive ($(1/(1-\varepsilon))$-competitive for machine
covering) and also use $O\left(\frac{1}{\varepsilon}\log \frac{1}{\varepsilon}
\right)$ bits of advice per request. We complement our results by giving a
lower bound showing that for any online algorithm with advice to be optimal,
for any of the above scheduling problems, a non-constant number (namely, at
least $\left(1 - \frac{2m}{n}\right)\log m$, where $n$ is the number of jobs
and $m$ is the number of machines) of bits of advice per request is needed.
","[{'version': 'v1', 'created': 'Fri, 29 Nov 2013 15:02:30 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Aug 2015 13:16:39 GMT'}]",2015-08-06,"[['Renault', 'Marc P.', ''], ['Rosén', 'Adi', ''], ['van Stee', 'Rob', '']]","['online algorithms', 'online computation with advice', 'competitive analysis', 'binpacking', 'machine scheduling']"
2271,1407.0576,Jorge Gomes,"Jorge Gomes, Pedro Mariano, Anders Lyhne Christensen",Novelty Search in Competitive Coevolution,"To appear in 13th International Conference on Parallel Problem
  Solving from Nature (PPSN 2014)","Parallel Problem Solving from Nature (PPSN). vol. 8672 LNCS. pp.
  233-242. Springer (2014)",10.1007/978-3-319-10762-2_23,,cs.NE cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the main motivations for the use of competitive coevolution systems is
their ability to capitalise on arms races between competing species to evolve
increasingly sophisticated solutions. Such arms races can, however, be hard to
sustain, and it has been shown that the competing species often converge
prematurely to certain classes of behaviours. In this paper, we investigate if
and how novelty search, an evolutionary technique driven by behavioural
novelty, can overcome convergence in coevolution. We propose three methods for
applying novelty search to coevolutionary systems with two species: (i) score
both populations according to behavioural novelty; (ii) score one population
according to novelty, and the other according to fitness; and (iii) score both
populations with a combination of novelty and fitness. We evaluate the methods
in a predator-prey pursuit task. Our results show that novelty-based approaches
can evolve a significantly more diverse set of solutions, when compared to
traditional fitness-based coevolution.
","[{'version': 'v1', 'created': 'Wed, 2 Jul 2014 14:07:47 GMT'}]",2017-03-14,"[['Gomes', 'Jorge', ''], ['Mariano', 'Pedro', ''], ['Christensen', 'Anders Lyhne', '']]","['Competitive coevolution', 'behavioural diversity', 'noveltysearch', 'convergence', 'evolutionary robotics']"
2272,1810.11672,Jun He Dr,"Yu Chen, Jun He","Average Convergence Rate of Evolutionary Algorithms II: Continuous
  Optimization",,,10.1016/j.ins.2020.12.076,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The average convergence rate (ACR) measures how fast the approximation error
of an evolutionary algorithm converges to zero per generation. It is defined as
the geometric average of the reduction rate of the approximation error over
consecutive generations. This paper makes a theoretical analysis of the ACR in
continuous optimization. The obtained results are summarized as follows.
According to the limit property, the ACR is classified into two categories: (1)
linear ACR whose limit inferior value is larger than a positive and (2)
sublinear ACR whose value converges to zero. Then, it is proven that the ACR is
linear for evolutionary programming using positive landscape-adaptive mutation,
but sublinear for that using landscape-invariant or zero landscape-adaptive
mutation. The relationship between the ACR and the decision space dimension is
also classified into two categories: (1) polynomial ACR whose value is larger
than the reciprocal of a polynomial function of the dimension for any
generation, and (2) exponential ACR whose value is less than the reciprocal of
an exponential function of the dimension for an exponential long period. It is
proven that for easy problems such as linear functions, the ACR of the (1+1)
adaptive random univariate search is polynomial. But for hard functions such as
the deceptive function, the ACR of both the (1+1) adaptive random univariate
search and evolutionary programming is exponential.
","[{'version': 'v1', 'created': 'Sat, 27 Oct 2018 16:41:28 GMT'}, {'version': 'v2', 'created': 'Sat, 10 Jul 2021 10:22:49 GMT'}]",2021-07-13,"[['Chen', 'Yu', ''], ['He', 'Jun', '']]","['Evolutionary algorithm', 'Continuous optimization', 'Convergence rate', 'Markov chain', 'Approximation error']"
2273,1903.01396,Tahar Kechadi M,"Yoan Chabot, Aur\'elie Bertaux, Christophe Nicollea, Tahar Kechadi","A complete formalized knowledge representation model for advanced
  digital forensics timeline analysis",,"Digital Investigation Volume 11, Supplement 2, August 2014, Pages
  S95-S105",10.1016/j.diin.2014.05.009,,cs.CY cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Having a clear view of events that occurred over time is a difficult
objective to achieve in digital investigations (DI). Event reconstruction,
which allows investigators to understand the timeline of a crime, is one of the
most important step of a DI process. This complex task requires exploration of
a large amount of events due to the pervasiveness of new technologies nowadays.
Any evidence produced at the end of the investigative process must also meet
the requirements of the courts, such as reproducibility, verifiability,
validation, etc. For this purpose, we propose a new methodology, supported by
theoretical concepts, that can assist investigators through the whole process
including the construction and the interpretation of the events describing the
case. The proposed approach is based on a model which integrates knowledge of
experts from the fields of digital forensics and software development to allow
a semantically rich representation of events related to the incident. The main
purpose of this model is to allow the analysis of these events in an automatic
and efficient way. This paper describes the approach and then focuses on the
main conceptual and formal aspects: a formal incident modelization and
operators for timeline reconstruction and analysis.
","[{'version': 'v1', 'created': 'Thu, 21 Feb 2019 13:25:00 GMT'}]",2019-03-05,"[['Chabot', 'Yoan', ''], ['Bertaux', 'Aurélie', ''], ['Nicollea', 'Christophe', ''], ['Kechadi', 'Tahar', '']]","['Digital forensics', 'Timeline analysis', 'Event reconstruction', 'Knowledge management', 'Ontology']"
2274,1507.06462,Matteo Sammartino,"Roberto Bruni, Ugo Montanari, Matteo Sammartino",A coalgebraic semantics for causality in Petri nets,Accepted by Journal of Logical and Algebraic Methods in Programming,,10.1016/j.jlamp.2015.07.003,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  In this paper we revisit some pioneering efforts to equip Petri nets with
compact operational models for expressing causality. The models we propose have
a bisimilarity relation and a minimal representative for each equivalence
class, and they can be fully explained as coalgebras on a presheaf category on
an index category of partial orders. First, we provide a set-theoretic model in
the form of a a causal case graph, that is a labeled transition system where
states and transitions represent markings and firings of the net, respectively,
and are equipped with causal information. Most importantly, each state has a
poset representing causal dependencies among past events. Our first result
shows the correspondence with behavior structure semantics as proposed by
Trakhtenbrot and Rabinovich. Causal case graphs may be infinitely-branching and
have infinitely many states, but we show how they can be refined to get an
equivalent finitely-branching model. In it, states are equipped with
symmetries, which are essential for the existence of a minimal, often
finite-state, model. The next step is constructing a coalgebraic model. We
exploit the fact that events can be represented as names, and event generation
as name generation. Thus we can apply the Fiore-Turi framework: we model causal
relations as a suitable category of posets with action labels, and generation
of new events with causal dependencies as an endofunctor on this category. Then
we define a well-behaved category of coalgebras. Our coalgebraic model is still
infinite-state, but we exploit the equivalence between coalgebras over a class
of presheaves and History Dependent automata to derive a compact
representation, which is equivalent to our set-theoretical compact model.
Remarkably, state reduction is automatically performed along the equivalence.
","[{'version': 'v1', 'created': 'Thu, 23 Jul 2015 12:08:22 GMT'}]",2015-07-24,"[['Bruni', 'Roberto', ''], ['Montanari', 'Ugo', ''], ['Sammartino', 'Matteo', '']]","['Petri nets', 'causal case graph', 'behavior structures', 'presheaves', 'coalgebras', 'HD-automata']"
2275,1511.00840,Konstantin Yakovlev S,"Konstantin Yakovlev, Egor Baskin, Ivan Hramoin","Finetuning Randomized Heuristic Search For 2D Path Planning: Finding The
  Best Input Parameters For R* Algorithm Through Series Of Experiments","8 pages, 2 figures, 18 references. As accepted to the 16th
  International Conference on Artificial Intelligence:Methodology, Systems,
  Applications (AIMSA 2014), Varna, Bulgaria, September 11-13, 2014",,10.1007/978-3-319-10554-3_29,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Path planning is typically considered in Artificial Intelligence as a graph
searching problem and R* is state-of-the-art algorithm tailored to solve it.
The algorithm decomposes given path finding task into the series of subtasks
each of which can be easily (in computational sense) solved by well-known
methods (such as A*). Parameterized random choice is used to perform the
decomposition and as a result R* performance largely depends on the choice of
its input parameters. In our work we formulate a range of assumptions
concerning possible upper and lower bounds of R* parameters, their
interdependency and their influence on R* performance. Then we evaluate these
assumptions by running a large number of experiments. As a result we formulate
a set of heuristic rules which can be used to initialize the values of R*
parameters in a way that leads to algorithm's best performance.
","[{'version': 'v1', 'created': 'Tue, 3 Nov 2015 09:56:01 GMT'}]",2015-11-04,"[['Yakovlev', 'Konstantin', ''], ['Baskin', 'Egor', ''], ['Hramoin', 'Ivan', '']]","['path planning', 'grid', '2D', 'A*', 'R*', 'heuristic search']"
2276,1707.05259,Joel Colloc,"Jo\""el Colloc (IDEES)",Ethics of autonomous information systems towards an artificial thinking,in French,"Les Cahiers du num\'erique, Lavoisier, Enjeux du big data et
  identifications des donn\'ees m\'edicales, 12 (1-2), pp.187-211 (2016)",10.3166/LCN.12.1-2.187-212,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many projects relies on cognitives sciences, neurosciences, computer sciences
and robotics. They concerned today the building of autonomous artificial beings
able to think. This paper shows a model to compare the human thinking with an
hypothetic numerical way of thinking based on four hierarchies : the
information system classification, the cognitive pyramid, the linguistic
pyramid and the digital information hierarchy. After a state of art on the
nature of human thinking, feasibility of autonomous multi-agent systems
provided with artificial consciousness which are able to think is discussed.
The ethical aspects and consequences for humanity of such systems is evaluated.
These systems lead the scientific community to react.
","[{'version': 'v1', 'created': 'Wed, 12 Jul 2017 11:44:09 GMT'}]",2017-07-18,"[['Colloc', 'Joël', '', 'IDEES']]","['Ethics', 'artificial thinking', 'holism', 'autonomous information systems', 'artificial consciousness']"
2277,1402.1971,Mohammed  Javed,Mohammed Javed and P. Nagabhushan and B.B. Chaudhuri,"Direct Processing of Run Length Compressed Document Image for
  Segmentation and Characterization of a Specified Block","7 Pages and Published with International Journal of Computer
  Applications (IJCA)","IJCA 83(15):1-6, December 2013",10.5120/14521-2926,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Extracting a block of interest referred to as segmenting a specified block in
an image and studying its characteristics is of general research interest, and
could be a challenging if such a segmentation task has to be carried out
directly in a compressed image. This is the objective of the present research
work. The proposal is to evolve a method which would segment and extract a
specified block, and carry out its characterization without decompressing a
compressed image, for two major reasons that most of the image archives contain
images in compressed format and decompressing an image indents additional
computing time and space. Specifically in this research work, the proposal is
to work on run-length compressed document images.
","[{'version': 'v1', 'created': 'Sun, 9 Feb 2014 18:01:12 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Feb 2014 16:32:16 GMT'}]",2014-02-19,"[['Javed', 'Mohammed', ''], ['Nagabhushan', 'P.', ''], ['Chaudhuri', 'B. B.', '']]","['Compressed data', 'Document Block Extraction', 'Document Characterization', 'Entropy', 'Density  1']"
2278,1701.08124,"Ralf L\""ammel","Ralf L\""ammel (University of Koblenz-Landau, Germany)",Relationship Maintenance in Software Language Repositories,"The Art, Science, and Engineering of Programming, Vol. 1, Issue 1,
  Article 4","The Art, Science, and Engineering of Programming, 2017, Vol. 1,
  Issue 1, Article 4",10.22152/programming-journal.org/2017/1/4,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The context of this research is testing and building software systems and,
specifically, software language repositories (SLRs), i.e., repositories with
components for language processing (interpreters, translators, analyzers,
transformers, pretty printers, etc.). SLRs are typically set up for developing
and using metaprogramming systems, language workbenches, language definition
frameworks, executable semantic frameworks, and modeling frameworks. This work
is an inquiry into testing and building SLRs in a manner that the repository is
seen as a collection of language-typed artifacts being related by the
applications of language-typed functions or relations which serve language
processing. The notion of language is used in a broad sense to include text-,
tree-, graph-based languages as well as representations based on interchange
formats and also proprietary formats for serialization. The overall approach
underlying this research is one of language design driven by a complex case
study, i.e., a specific SLR with a significant number of processed languages
and language processors as well as a noteworthy heterogeneity in terms of
representation types and implementation languages. The knowledge gained by our
research is best understood as a declarative language design for regression
testing and build management, we introduce a corresponding language Ueber with
an executable semantics which maintains relationships between language-typed
artifacts in an SLR. The grounding of the reported research is based on the
comprehensive, formal, executable (logic programming-based) definition of the
Ueber language and its systematic application to the management of the SLR YAS
which consists of hundreds of language definition and processing components
(such as interpreters and transformations) for more than thirty languages (not
counting different representation types) with Prolog, Haskell, Java, and Python
being used as implementation languages. The importance of this work follows
from the significant costs implied by regression testing and build management
and also from the complexity of SLRs which calls for means to help with
understanding.
","[{'version': 'v1', 'created': 'Fri, 27 Jan 2017 17:25:53 GMT'}]",2017-02-01,"[['Lämmel', 'Ralf', '', 'University of Koblenz-Landau, Germany']]","['Language processing', 'Build management', 'Regression testing', 'Software language repository']"
2279,1808.04760,Yuri G. Gordienko,"Sergii Stirenko, Gang Peng, Wei Zeng, Yuri Gordienko, Oleg Alienin,
  Oleksandr Rokovyi, Nikita Gordienko","Parallel Statistical and Machine Learning Methods for Estimation of
  Physical Load","15 pages, 8 figures, accepted for 18th International Conference on
  Algorithms and Architectures for Parallel Processing (ICA3PP) 15-17 November,
  2018 (Guangzhou, China)","In: Vaidya J., Li J. (eds) Algorithms and Architectures for
  Parallel Processing. ICA3PP 2018. Lecture Notes in Computer Science, vol
  11334, 483-497. Springer, Cham",10.1007/978-3-030-05051-1_33,,cs.LG cs.HC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several statistical and machine learning methods are proposed to estimate the
type and intensity of physical load and accumulated fatigue . They are based on
the statistical analysis of accumulated and moving window data subsets with
construction of a kurtosis-skewness diagram. This approach was applied to the
data gathered by the wearable heart monitor for various types and levels of
physical activities, and for people with various physical conditions. The
different levels of physical activities, loads, and fitness can be
distinguished from the kurtosis-skewness diagram, and their evolution can be
monitored. Several metrics for estimation of the instant effect and accumulated
effect (physical fatigue) of physical loads were proposed. The data and results
presented allow to extend application of these methods for modeling and
characterization of complex human activity patterns, for example, to estimate
the actual and accumulated physical load and fatigue, model the potential
dangerous development, and give cautions and advice in real time.
","[{'version': 'v1', 'created': 'Tue, 14 Aug 2018 15:47:32 GMT'}]",2018-12-11,"[['Stirenko', 'Sergii', ''], ['Peng', 'Gang', ''], ['Zeng', 'Wei', ''], ['Gordienko', 'Yuri', ''], ['Alienin', 'Oleg', ''], ['Rokovyi', 'Oleksandr', ''], ['Gordienko', 'Nikita', '']]","['Statistical Analysis', 'Physiological Signals', 'Heart Beat', 'Classification', 'Machine Learning', 'HCI and Human Behaviour']"
2280,1405.7500,Joerg Endrullis,"J\""org Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky",An Introduction to the Clocked Lambda Calculus,,,10.1017/S0960129515000389,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give a brief introduction to the clocked lambda calculus, an extension of
the classical lambda calculus with a unary symbol tau used to witness the
beta-steps. In contrast to the classical lambda calculus, this extension is
infinitary strongly normalising and infinitary confluent. The infinitary normal
forms are enriched Boehm Trees, which we call clocked Boehm Trees.
","[{'version': 'v1', 'created': 'Thu, 29 May 2014 08:59:37 GMT'}]",2015-10-21,"[['Endrullis', 'Jörg', ''], ['Hendriks', 'Dimitri', ''], ['Klop', 'Jan Willem', ''], ['Polonsky', 'Andrew', '']]","['lambda calculus', 'convertibility', 'Böhm Trees']"
2281,1108.4465,EPTCS,"Sara Capecchi (University of Torino), Ilaria Castellani (INRIA Sophia
  Antipolis M\'editerran\'ee), Mariangiola Dezani-Ciancaglini (University of
  Torino)",Information Flow Safety in Multiparty Sessions,"In Proceedings EXPRESS 2011, arXiv:1108.4077","EPTCS 64, 2011, pp. 16-30",10.1017/S0960129514000619,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a calculus for multiparty sessions enriched with security levels
for messages. We propose a monitored semantics for this calculus, which blocks
the execution of processes as soon as they attempt to leak information. We
illustrate the use of our monitored semantics with various examples, and show
that the induced safety property implies a noninterference property studied
previously.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2011 01:23:09 GMT'}]",2015-01-07,"[['Capecchi', 'Sara', '', 'University of Torino'], ['Castellani', 'Ilaria', '', 'INRIA Sophia\n  Antipolis Méditerranée'], ['Dezani-Ciancaglini', 'Mariangiola', '', 'University of\n  Torino']]","['concurrency', 'session calculi', 'secure information flow', 'monitored semantics', 'safety']"
2282,1903.08243,Tianjiao Sun,"Tianjiao Sun, Lawrence Mitchell, Kaushik Kulkarni, Andreas Kl\""ockner,
  David A. Ham and Paul H. J. Kelly",A study of vectorization for matrix-free finite element methods,,"International Journal of High Performance Computing Applications
  (2020)",10.1177/1094342020945005,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vectorization is increasingly important to achieve high performance on modern
hardware with SIMD instructions. Assembly of matrices and vectors in the finite
element method, which is characterized by iterating a local assembly kernel
over unstructured meshes, poses difficulties to effective vectorization.
Maintaining a user-friendly high-level interface with a suitable degree of
abstraction while generating efficient, vectorized code for the finite element
method is a challenge for numerical software systems and libraries. In this
work, we study cross-element vectorization in the finite element framework
Firedrake via code transformation and demonstrate the efficacy of such an
approach by evaluating a wide range of matrix-free operators spanning different
polynomial degrees and discretizations on two recent CPUs using three
mainstream compilers. Our experiments show that our approaches for
cross-element vectorization achieve 30\% of theoretical peak performance for
many examples of practical significance, and exceed 50\% for cases with high
arithmetic intensities, with consistent speed-up over (intra-element)
vectorization restricted to the local assembly kernels.
","[{'version': 'v1', 'created': 'Tue, 19 Mar 2019 20:15:03 GMT'}, {'version': 'v2', 'created': 'Tue, 19 May 2020 14:23:13 GMT'}]",2020-08-26,"[['Sun', 'Tianjiao', ''], ['Mitchell', 'Lawrence', ''], ['Kulkarni', 'Kaushik', ''], ['Klöckner', 'Andreas', ''], ['Ham', 'David A.', ''], ['Kelly', 'Paul H. J.', '']]","['Finite element method', 'vectorization', 'global assembly', 'code generation']"
2283,1411.0698,Daniel Fremont,"Daniel J. Fremont, Alexandre Donz\'e, Sanjit A. Seshia, David Wessel",Control Improvisation,"16 pages. Full version of an FSTTCS 2015 paper. This article is
  superseded by arXiv:1704.06319","35th IARCS Annual Conference on Foundations of Software Technology
  and Theoretical Computer Science (FSTTCS 2015), 463-474",10.4230/LIPIcs.FSTTCS.2015.463,,cs.FL,http://creativecommons.org/licenses/by/4.0/,"  We formalize and analyze a new automata-theoretic problem termed control
improvisation. Given an automaton, the problem is to produce an improviser, a
probabilistic algorithm that randomly generates words in its language, subject
to two additional constraints: the satisfaction of an admissibility predicate,
and the exhibition of a specified amount of randomness. Control improvisation
has multiple applications, including, for example, generating musical
improvisations that satisfy rhythmic and melodic constraints, where
admissibility is determined by some bounded divergence from a reference melody.
We analyze the complexity of the control improvisation problem, giving cases
where it is efficiently solvable and cases where it is #P-hard or undecidable.
We also show how symbolic techniques based on Boolean satisfiability (SAT)
solvers can be used to approximately solve some of the intractable cases.
","[{'version': 'v1', 'created': 'Mon, 3 Nov 2014 21:09:41 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Mar 2015 18:30:08 GMT'}, {'version': 'v3', 'created': 'Thu, 23 Jul 2015 06:10:24 GMT'}, {'version': 'v4', 'created': 'Tue, 13 Oct 2015 18:29:08 GMT'}, {'version': 'v5', 'created': 'Mon, 24 Apr 2017 05:00:26 GMT'}]",2017-04-25,"[['Fremont', 'Daniel J.', ''], ['Donzé', 'Alexandre', ''], ['Seshia', 'Sanjit A.', ''], ['Wessel', 'David', '']]","['finite automata', 'random sampling', 'Boolean satisfiability', 'testing', 'computational music', 'control theory']"
2284,1302.1649,Rommel Anacan,"Rommel Anacan, James Greggory Alcayde, Retchel Antegra and Leah Luna","Eye-GUIDE (Eye-Gaze User Interface Design) Messaging for
  Physically-Impaired People",,,10.5121/ijdps.2013.4104,,cs.HC cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Eye-GUIDE is an assistive communication tool designed for the paralyzed or
physically impaired people who were unable to move parts of their bodies
especially people whose communications are limited only to eye movements. The
prototype consists of a camera and a computer. Camera captures images then it
will be send to the computer, where the computer will be the one to interpret
the data. Thus, Eye-GUIDE focuses on camera-based gaze tracking. The proponent
designed the prototype to perform simple tasks and provides graphical user
interface in order the paralyzed or physically impaired person can easily use
it.
","[{'version': 'v1', 'created': 'Thu, 7 Feb 2013 06:47:54 GMT'}]",2013-02-08,"[['Anacan', 'Rommel', ''], ['Alcayde', 'James Greggory', ''], ['Antegra', 'Retchel', ''], ['Luna', 'Leah', '']]","['Eye-GUIDE', 'Eye tracking', 'Human-computer Interfacing']"
2285,1804.03919,Martin Shepperd,Martin Shepperd and Carolyn Mair and Magne J{\o}rgensen,"An Experimental Evaluation of a De-biasing Intervention for Professional
  Software Developers","Presented at: SAC 2018: Symposium on Applied Computing, April 9--13,
  2018, Pau, France. ACM, New York, NY, USA, 8 pages",,10.1145/3167132.3167293,,cs.SE cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CONTEXT: The role of expert judgement is essential in our quest to improve
software project planning and execution. However, its accuracy is dependent on
many factors, not least the avoidance of judgement biases, such as the
anchoring bias, arising from being influenced by initial information, even when
it's misleading or irrelevant. This strong effect is widely documented.
OBJECTIVE: We aimed to replicate this anchoring bias using professionals and,
novel in a software engineering context, explore de-biasing interventions
through increasing knowledge and awareness of judgement biases. METHOD: We ran
two series of experiments in company settings with a total of 410 software
developers. Some developers took part in a workshop to heighten their awareness
of a range of cognitive biases, including anchoring. Later, the anchoring bias
was induced by presenting low or high productivity values, followed by the
participants' estimates of their own project productivity. Our hypothesis was
that the workshop would lead to reduced bias, i.e., work as a de-biasing
intervention. RESULTS: The anchors had a large effect (robust Cohen's $d=1.19$)
in influencing estimates. This was substantially reduced in those participants
who attended the workshop (robust Cohen's $d=0.72$). The reduced bias related
mainly to the high anchor. The de-biasing intervention also led to a threefold
reduction in estimate variance. CONCLUSIONS: The impact of anchors upon
judgement was substantial. Learning about judgement biases does appear capable
of mitigating, although not removing, the anchoring bias. The positive effect
of de-biasing through learning about biases suggests that it has value.
","[{'version': 'v1', 'created': 'Wed, 11 Apr 2018 10:47:27 GMT'}]",2018-04-12,"[['Shepperd', 'Martin', ''], ['Mair', 'Carolyn', ''], ['Jørgensen', 'Magne', '']]","['Software engineering experimentation', 'Software effort estimation', 'Expert judgement', 'Cognitive bias']"
2286,1610.03534,Mohamed Alrshah,"Mohamed A. Alrshah, Mohamed Othman, Borhanuddin Ali, Zurina Mohd
  Hanapia","Comparative study of High-speed Linux TCP Variants over High-BDP
  Networks",Review and performance evaluation work,"Journal of Network and Computer Applications, 43, pp.66-75 (2014)",10.1016/j.jnca.2014.04.007,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transmission Control Protocol (TCP) has been profusely used by most of
internet applications. Since 1970s, several TCP variants have been developed in
order to cope with the fast increasing of network capacities especially in high
Bandwidth Delay Product (high-BDP) networks. In these TCP variants, several
approaches have been used, some of these approaches have the ability to
estimate available bandwidths and some react based on network loss and/or delay
changes. This variety of the used approaches arises many consequent problems
with different levels of dependability and accuracy. Indeed, a particular TCP
variant which is proper for wireless networks, may not fit for high-BDP wired
networks and vice versa. Therefore, it is necessary to conduct a comparison
between the high-speed TCP variants that have a high level of importance
especially after the fast growth of networks bandwidths. In this paper,
high-speed TCP variants, that are implemented in Linux and available for
research, have been evaluated using NS2 network simulator. This performance
evaluation presents the advantages and disadvantages of these TCP variants in
terms of throughput, loss-ratio and fairness over high-BDP networks. The
results reveal that, CUBIC and YeAH overcome the other highspeed TCP variants
in different cases of buffer size. However, they still require more improvement
to extend their ability to fully utilize the high-speed bandwidths, especially
when the applied buffer is near-zero or less than the BDP of the link.
","[{'version': 'v1', 'created': 'Tue, 26 Jan 2016 06:52:06 GMT'}]",2016-10-13,"[['Alrshah', 'Mohamed A.', ''], ['Othman', 'Mohamed', ''], ['Ali', 'Borhanuddin', ''], ['Hanapia', 'Zurina Mohd', '']]","['Linux TCP', 'High-BDP', 'Congestion Control', 'Throughput', 'Loss Ratio', 'Fairness Index']"
2287,1808.00556,Maxim Belkin,"Maxim Belkin, Roland Haas, Galen Wesley Arnold, Hon Wai Leong, Eliu A.
  Huerta, David Lesny, Mark Neubauer","Container solutions for HPC Systems: A Case Study of Using Shifter on
  Blue Waters","8 pages, 7 figures, in PEARC '18: Proceedings of Practice and
  Experience in Advanced Research Computing, July 22--26, 2018, Pittsburgh, PA,
  USA",,10.1145/3219104.3219145,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Software container solutions have revolutionized application development
approaches by enabling lightweight platform abstractions within the so-called
""containers."" Several solutions are being actively developed in attempts to
bring the benefits of containers to high-performance computing systems with
their stringent security demands on the one hand and fundamental resource
sharing requirements on the other.
  In this paper, we discuss the benefits and short-comings of such solutions
when deployed on real HPC systems and applied to production scientific
applications.We highlight use cases that are either enabled by or significantly
benefit from such solutions. We discuss the efforts by HPC system
administrators and support staff to support users of these type of workloads on
HPC systems not initially designed with these workloads in mind focusing on
NCSA's Blue Waters system.
","[{'version': 'v1', 'created': 'Wed, 1 Aug 2018 20:41:26 GMT'}]",2018-08-03,"[['Belkin', 'Maxim', ''], ['Haas', 'Roland', ''], ['Arnold', 'Galen Wesley', ''], ['Leong', 'Hon Wai', ''], ['Huerta', 'Eliu A.', ''], ['Lesny', 'David', ''], ['Neubauer', 'Mark', '']]","['Petascale', 'Reproducibility', 'Data Science']"
2288,1502.06152,Graham H. Norton,Graham H. Norton,"On Sequences, Rational Functions and Decomposition","Several more typos corrected. To appear in J. Applied Algebra in
  Engineering, Communication and Computing. The final publication version is
  available at Springer via http://dx.doi.org/10.1007/s00200-015-0256-5",,10.1007/s00200-015-0256-5,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our overall goal is to unify and extend some results in the literature
related to the approximation of generating functions of finite and infinite
sequences over a field by rational functions. In our approach, numerators play
a significant role. We revisit a theorem of Niederreiter on (i) linear
complexities and (ii) '$n^{th}$ minimal polynomials' of an infinite sequence,
proved using partial quotients. We prove (i) and its converse from first
principles and generalise (ii) to rational functions where the denominator need
not have minimal degree. We prove (ii) in two parts: firstly for geometric
sequences and then for sequences with a jump in linear complexity. The basic
idea is to decompose the denominator as a sum of polynomial multiples of two
polynomials of minimal degree; there is a similar decomposition for the
numerators. The decomposition is unique when the denominator has degree at most
the length of the sequence. The proof also applies to rational functions
related to finite sequences, generalising a result of Massey. We give a number
of applications to rational functions associated to sequences.
","[{'version': 'v1', 'created': 'Sat, 21 Feb 2015 23:29:58 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Mar 2015 20:38:35 GMT'}, {'version': 'v3', 'created': 'Tue, 7 Apr 2015 07:16:07 GMT'}]",2015-04-08,"[['Norton', 'Graham H.', '']]","['Berlekamp-Massey algorithm', 'continued fraction', 'key equation', 'Laurentseries', 'linear recurrence', 'minimal polynomial', 'partial quotient', 'rational function']"
2289,1701.08981,Paul Acquatella B.,"Paul Acquatella B., Wim van Ekeren, Qi Ping Chu","PI(D) tuning for Flight Control Systems via Incremental Nonlinear
  Dynamic Inversion","Accepted to IFAC 2017 World Congress, Toulouse, France",,10.1016/j.ifacol.2017.08.1265,,cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Previous results reported in the robotics literature show the relationship
between time-delay control (TDC) and proportional-integral-derivative control
(PID). In this paper, we show that incremental nonlinear dynamic inversion
(INDI) - more familiar in the aerospace community - are in fact equivalent to
TDC. This leads to a meaningful and systematic method for PI(D)-control tuning
of robust nonlinear flight control systems via INDI. We considered a
reformulation of the plant dynamics inversion which removes effector blending
models from the resulting control law, resulting in robust model-free control
laws like PI(D)-control.
","[{'version': 'v1', 'created': 'Tue, 31 Jan 2017 10:39:40 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Mar 2017 16:55:47 GMT'}, {'version': 'v3', 'created': 'Wed, 5 Apr 2017 10:01:12 GMT'}]",2021-12-06,"[['B.', 'Paul Acquatella', ''], ['van Ekeren', 'Wim', ''], ['Chu', 'Qi Ping', '']]","['aerospace', 'tracking', 'application of nonlinear analysis', 'design']"
2290,2105.08969,Wei Shao Dr,"Wei Shao, Arian Prabowo, Sichen Zhao, Piotr Koniusz, Flora D. Salim","Predicting Flight Delay with Spatio-Temporal Trajectory Convolutional
  Network and Airport Situational Awareness Map","single column. Neurocomputing, 2021",,10.1016/j.neucom.2021.04.136,,cs.LG cs.AI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To model and forecast flight delays accurately, it is crucial to harness
various vehicle trajectory and contextual sensor data on airport tarmac areas.
These heterogeneous sensor data, if modelled correctly, can be used to generate
a situational awareness map. Existing techniques apply traditional supervised
learning methods onto historical data, contextual features and route
information among different airports to predict flight delay are inaccurate and
only predict arrival delay but not departure delay, which is essential to
airlines. In this paper, we propose a vision-based solution to achieve a high
forecasting accuracy, applicable to the airport. Our solution leverages a
snapshot of the airport situational awareness map, which contains various
trajectories of aircraft and contextual features such as weather and airline
schedules. We propose an end-to-end deep learning architecture, TrajCNN, which
captures both the spatial and temporal information from the situational
awareness map. Additionally, we reveal that the situational awareness map of
the airport has a vital impact on estimating flight departure delay. Our
proposed framework obtained a good result (around 18 minutes error) for
predicting flight departure delay at Los Angeles International Airport.
","[{'version': 'v1', 'created': 'Wed, 19 May 2021 07:38:57 GMT'}]",2021-11-25,"[['Shao', 'Wei', ''], ['Prabowo', 'Arian', ''], ['Zhao', 'Sichen', ''], ['Koniusz', 'Piotr', ''], ['Salim', 'Flora D.', '']]","['Spatio-temporal Data Mining', 'Flight Delay Prediction', 'Feature']"
2291,1907.10710,Hongfei Zhang,"Hongfei Zhang, Xia Song, Chenyan Xiong, Corby Rosset, Paul N. Bennett,
  Nick Craswell, and Saurabh Tiwary",Generic Intent Representation in Web Search,,"SIGIR 2019: Proceedings of the 42nd International ACM SIGIR
  Conference on Research and Development in Information Retrieval",10.1145/3331184.3331198,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents GEneric iNtent Encoder (GEN Encoder) which learns a
distributed representation space for user intent in search. Leveraging large
scale user clicks from Bing search logs as weak supervision of user intent, GEN
Encoder learns to map queries with shared clicks into similar embeddings
end-to-end and then finetunes on multiple paraphrase tasks. Experimental
results on an intrinsic evaluation task - query intent similarity modeling -
demonstrate GEN Encoder's robust and significant advantages over previous
representation methods. Ablation studies reveal the crucial role of learning
from implicit user feedback in representing user intent and the contributions
of multi-task learning in representation generality. We also demonstrate that
GEN Encoder alleviates the sparsity of tail search traffic and cuts down half
of the unseen queries by using an efficient approximate nearest neighbor search
to effectively identify previous queries with the same search intent. Finally,
we demonstrate distances between GEN encodings reflect certain information
seeking behaviors in search sessions.
","[{'version': 'v1', 'created': 'Wed, 24 Jul 2019 20:40:19 GMT'}]",2019-07-26,"[['Zhang', 'Hongfei', ''], ['Song', 'Xia', ''], ['Xiong', 'Chenyan', ''], ['Rosset', 'Corby', ''], ['Bennett', 'Paul N.', ''], ['Craswell', 'Nick', ''], ['Tiwary', 'Saurabh', '']]","['Generic Intent Representation', 'Query Embedding', 'User Intent']"
2292,1507.02563,Wen Shen,Wen Shen and Cristina Lopes,"Managing Autonomous Mobility on Demand Systems for Better Passenger
  Experience",,"Proceedings of the 18th International Conference on Principles and
  Practice of Multi-Agent Systems (PRIMA 2015). pp 20-35. Lecture Notes in
  Computer Science, vol 9387. Springer",10.1007/978-3-319-25524-8_2,,cs.AI cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autonomous mobility on demand systems, though still in their infancy, have
very promising prospects in providing urban population with sustainable and
safe personal mobility in the near future. While much research has been
conducted on both autonomous vehicles and mobility on demand systems, to the
best of our knowledge, this is the first work that shows how to manage
autonomous mobility on demand systems for better passenger experience. We
introduce the Expand and Target algorithm which can be easily integrated with
three different scheduling strategies for dispatching autonomous vehicles. We
implement an agent-based simulation platform and empirically evaluate the
proposed approaches with the New York City taxi data. Experimental results
demonstrate that the algorithm significantly improve passengers' experience by
reducing the average passenger waiting time by up to 29.82% and increasing the
trip success rate by up to 7.65%.
","[{'version': 'v1', 'created': 'Thu, 9 Jul 2015 15:43:17 GMT'}]",2017-11-23,"[['Shen', 'Wen', ''], ['Lopes', 'Cristina', '']]","['Autonomous Vehicles', 'Mobility on Demand', 'AMOD Systems', 'Expand and Target', 'Agent-based Simulation']"
2293,1812.11028,Avishek Choudhury,"Avishek Choudhury, Christopher M Greene",Evaluating Patient Readmission Risk: A Predictive Analytics Approach,arXiv admin note: text overlap with arXiv:1403.1210 by other authors,"American Journal of Engineering and Applied Sciences 2018,
  11(4):1320.1331",10.3844/ajeassp.2018.1320.1331,,cs.CY cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the emergence of the Hospital Readmission Reduction Program of the
Center for Medicare and Medicaid Services on October 1, 2012, forecasting
unplanned patient readmission risk became crucial to the healthcare domain.
There are tangible works in the literature emphasizing on developing
readmission risk prediction models; However, the models are not accurate enough
to be deployed in an actual clinical setting. Our study considers patient
readmission risk as the objective for optimization and develops a useful risk
prediction model to address unplanned readmissions. Furthermore, Genetic
Algorithm and Greedy Ensemble is used to optimize the developed model
constraints.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2018 16:18:45 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Aug 2019 03:36:48 GMT'}]",2019-08-22,"[['Choudhury', 'Avishek', ''], ['Greene', 'Christopher M', '']]","['Prediction Model', 'Patient Readmission Risk', 'Healthcare Expenses', 'Healthcare Quality', 'Optimization Model']"
2294,0809.2136,Shrisha Rao,"Prabodh K. Enumula, Shrisha Rao",The Potluck Problem,"9 pages. Economics Letters, to appear","Economics Letters 107 (1), pp. 10--12, April 2010",10.1016/j.econlet.2009.12.011,,cs.GT cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes the Potluck Problem as a model for the behavior of
independent producers and consumers under standard economic assumptions, as a
problem of resource allocation in a multi-agent system in which there is no
explicit communication among the agents.
","[{'version': 'v1', 'created': 'Fri, 12 Sep 2008 05:54:50 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Dec 2009 05:12:11 GMT'}]",2022-01-11,"[['Enumula', 'Prabodh K.', ''], ['Rao', 'Shrisha', '']]","['weighted majority algorithm', 'Santa Fe Bar Problem', 'demandsupply parity', 'rational learning', 'predictors']"
2295,1211.4683,Bhavesh Patel,B. V. Patel and B. B. Meshram,Content based video retrieval,,"The International Journal of Multimedia & Its Applications (IJMA)
  Vol.4, No.5, October 2012",10.5121/ijma.2012.4506,,cs.MM cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Content based video retrieval is an approach for facilitating the searching
and browsing of large image collections over World Wide Web. In this approach,
video analysis is conducted on low level visual properties extracted from video
frame. We believed that in order to create an effective video retrieval system,
visual perception must be taken into account. We conjectured that a technique
which employs multiple features for indexing and retrieval would be more
effective in the discrimination and search tasks of videos. In order to
validate this claim, content based indexing and retrieval systems were
implemented using color histogram, various texture features and other
approaches. Videos were stored in Oracle 9i Database and a user study measured
correctness of response.
","[{'version': 'v1', 'created': 'Tue, 20 Nov 2012 08:22:56 GMT'}]",2012-11-21,"[['Patel', 'B. V.', ''], ['Meshram', 'B. B.', '']]","['CBVR', 'Feature Extraction', 'Indexing']"
2296,1903.12113,ThanhVu Nguyen,"ThanhVu Nguyen, Timos Antopoulos, Andrew Ruef, and Michael Hicks",A Counterexample-guided Approach to Finding Numerical Invariants,,"11th Joint Meeting of the European Software Engineering Conference
  and the ACM SIGSOFT Symposium on the Foundations of Software Engineering
  (FSE), pages 605--615. ACM, 2017",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Numerical invariants, e.g., relationships among numerical variables in a
program, represent a useful class of properties to analyze programs. General
polynomial invariants represent more complex numerical relations, but they are
often required in many scientific and engineering applications. We present
NumInv, a tool that implements a counterexample-guided invariant generation
(CEGIR) technique to automatically discover numerical invariants, which are
polynomial equality and inequality relations among numerical variables. This
CEGIR technique infers candidate invariants from program traces and then checks
them against the program source code using the KLEE test-input generation tool.
If the invariants are incorrect KLEE returns counterexample traces, which help
the dynamic inference obtain better results. Existing CEGIR approaches often
require sound invariants, however NumInv sacrifices soundness and produces
results that KLEE cannot refute within certain time bounds. This design and the
use of KLEE as a verifier allow NumInv to discover useful and important
numerical invariants for many challenging programs.
  Preliminary results show that NumInv generates required invariants for
understanding and verifying correctness of programs involving complex
arithmetic. We also show that NumInv discovers polynomial invariants that
capture precise complexity bounds of programs used to benchmark existing static
complexity analysis techniques. Finally, we show that NumInv performs
competitively comparing to state of the art numerical invariant analysis tools.
","[{'version': 'v1', 'created': 'Thu, 28 Mar 2019 16:58:28 GMT'}]",2019-03-29,"[['Nguyen', 'ThanhVu', ''], ['Antopoulos', 'Timos', ''], ['Ruef', 'Andrew', ''], ['Hicks', 'Michael', '']]","['Dynamic and Static Invariant Analyses', 'Counterexample-guidedAlgorithms', 'Numerical Domains', 'Program and Correctness Analyses', 'Test-input Generation']"
2297,1502.06519,Haipeng Cai,Haipeng Cai,"Enhancing Programming Interface to Effectively Meet Multiple Information
  Needs of Developers","Position paper; 10 pages, 2 figures","International Conference on Software Quality, Reliability, and
  Security Companion, pages 221-229, 2015",10.1109/QRS-C.2015.46,,cs.SE cs.HC,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In the past decades, integrated development environments (IDEs) have been
largely advanced to facilitate common software engineering tasks. Yet, with
growing information needs driven by increasing complexity in developing modern
high-quality software, developers often need to switch among multiple user
interfaces, even across different applications, in their development process,
which breaks their mental workflow thus tends to adversely affect their working
efficiency and productivity. This position paper discusses challenges faced by
current IDE designs mainly from working context transitions of developers
during the process of seeking multiple information needs for their development
tasks. It remarks the primary blockades behind and initially explores some
high-level design considerations for overcoming such challenges in the
next-generation IDEs. Specifically, a few design enhancements on top of modern
IDEs are envisioned, attempting to reduce the overheads of frequent context
switching commonly seen in the multitasking of developers.
","[{'version': 'v1', 'created': 'Mon, 23 Feb 2015 17:23:56 GMT'}]",2021-11-02,"[['Cai', 'Haipeng', '']]","['Information need', 'integrated development environment', 'context switching', 'automatic recommendation', 'programming interface', 'software visualization']"
2298,1101.5076,Peter beim Graben,"Peter beim Graben, Sabrina Gerth",Geometric representations for minimalist grammars,"43 pages, 4 figures",,10.1007/s10849-012-9164-2,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We reformulate minimalist grammars as partial functions on term algebras for
strings and trees. Using filler/role bindings and tensor product
representations, we construct homomorphisms for these data structures into
geometric vector spaces. We prove that the structure-building functions as well
as simple processors for minimalist languages can be realized by piecewise
linear operators in representation space. We also propose harmony, i.e. the
distance of an intermediate processing step from the final well-formed state in
representation space, as a measure of processing complexity. Finally, we
illustrate our findings by means of two particular arithmetic and fractal
representations.
","[{'version': 'v1', 'created': 'Wed, 26 Jan 2011 14:56:20 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Feb 2011 17:44:39 GMT'}, {'version': 'v3', 'created': 'Thu, 25 Aug 2011 14:01:00 GMT'}, {'version': 'v4', 'created': 'Mon, 5 Dec 2011 14:58:37 GMT'}, {'version': 'v5', 'created': 'Wed, 4 Apr 2012 13:15:51 GMT'}, {'version': 'v6', 'created': 'Wed, 20 Jun 2012 14:23:17 GMT'}]",2012-07-19,"[['Graben', 'Peter beim', ''], ['Gerth', 'Sabrina', '']]","['Geometric cognition', 'vector symbolic architectures', 'tensor productrepresentations', 'minimalist grammars', 'harmony theory']"
2299,1611.09177,Jerome Darmont,"J\'er\^ome Darmont (LIMOS), Le Gruenwald",A comparison study of object-oriented database clustering techniques,arXiv admin note: text overlap with arXiv:1611.09176,"Information Sciences, Elsevier, 1996, 94 (1-4), pp.55-86",10.1016/0020-0255(96)00119-3,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is widely acknowledged that a good object clustering is critical to the
performance of OODBs. Clustering means storing related objects close together
on secondary storage so that when one object is accessed from disk, all its
related objects are also brought into memory. Then access to these related
objects is a main memory access that is much faster than a disk access. The aim
of this paper is to compare the performance of three clustering algorithms:
Cactis, CK and ORION. Simulation experiments we performed showed that the
Cactis algorithm is better than the ORION algorithm and that the CK algorithm
totally out-performs both other algorithms in terms of response time and
clustering overhead.
","[{'version': 'v1', 'created': 'Mon, 28 Nov 2016 15:19:52 GMT'}]",2017-01-01,"[['Darmont', 'Jérôme', '', 'LIMOS'], ['Gruenwald', 'Le', '']]","['Cactis', 'CK', 'Clustering', 'Object-Oriented Databases', 'ORION', 'Simulation']"
2300,1201.1259,Romain Boulet,"Romain Boulet (LMTG), Pierre Mazzega (LMTG), Dani\`ele Bourcier
  (CERSA)",Network Analysis of the French Environmental Code,"AI Approaches to the Complexity of Legal Systems (AICOL 2009),
  Rotterdam : Netherlands (2009)",,10.1007/978-3-642-16524-5_4,,cs.SI cs.DL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We perform a detailed analysis of the network constituted by the citations in
a legal code, we search for hidden structures and properties. The graph
associated to the Environmental code has a small-world structure and it is
partitioned in several hidden communities of articles that only partially
coincide with the organization of the code as given by its table of content.
Several articles are also connected with a low number of articles but are
intermediate between large communities. The structure of the Environmental Code
is contrasting with the reference network of all the French Legal Codes that
presents a rich-club of ten codes very central to the whole French legal
system, but no small-world property. This comparison shows that the structural
properties of the reference network associated to a legal system strongly
depends on the scale and granularity of the analysis, as is the case for many
complex systems
","[{'version': 'v1', 'created': 'Tue, 22 Nov 2011 20:54:43 GMT'}]",2012-05-09,"[['Boulet', 'Romain', '', 'LMTG'], ['Mazzega', 'Pierre', '', 'LMTG'], ['Bourcier', 'Danièle', '', 'CERSA']]","['Legal complexity', 'graph theory', 'network analysis', 'Environmental Code', 'citation network']"
2301,1603.07919,Olivier Delestre,"M Abily (I-CiTy), N Bertrand (IRSN), O Delestre (JAD), P Gourbesville
  (I-CiTy), Y Richet (IRSN), C.-M Duluc (IRSN)","Global sensitivity analysis with 2d hydraulic codes: applied protocol
  and practical tool",,"La Houille Blanche - Revue internationale de l'eau, EDP Sciences,
  2015, 5, pp.16-22",10.1051/lhb/20150050,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Global Sensitivity Analysis (GSA) methods are useful tools to rank input
parameters uncertainties regarding their impact on result variability. In
practice, such type of approach is still at an exploratory level for studies
relying on 2D Shallow Water Equations (SWE) codes as GSA requires specific
tools and deals with important computational capacity. The aim of this paper is
to provide both a protocol and a tool to carry out a GSA for 2D hydraulic
modelling applications. A coupled tool between Prom{\'e}th{\'e}e (a parametric
computation environment) and FullSWOF 2D (a code relying on 2D SWE) has been
set up: Prom{\'e}th{\'e}e-FullSWOF 2D (P-FS). The main steps of our protocol
are: i) to identify the 2D hydraulic code input parameters of interest and to
assign them a probability density function, ii) to propagate uncertainties
within the model, and iii) to rank the effects of each input parameter on the
output of interest. For our study case, simulations of a river flood event were
run with uncertainties introduced through three parameters using P-FS tool.
Tests were performed on regular computational mesh, spatially discretizing an
urban area, using up to 17.9 million of computational points. P-FS tool has
been installed on a cluster for computation. Method and P-FS tool successfully
allow the computation of Sobol indices maps. Keywords Uncertainty, flood hazard
modelling, global sensitivity analysis, 2D shallow water equation, Sobol index.
Analyse globale de sensibilit{\'e} en mod{\'e}lisation hydrauliqu{\`e} a
surface libre 2D : application d'un protocole et d{\'e}veloppement d'outils
op{\'e}rationnels -- Les m{\'e}thodes d'analyse de sensibilit{\'e} permettent
de contr{\^o}ler la robustesse des r{\'e}sultats de mod{\'e}lisation ainsi que
d'identifier le degr{\'e} d'influence des param etres d' entr{\'e}e sur le
r{\'e}sultat en sortie d'un mod ele. Le processus complet constitue une analyse
globale de sensibilit{\'e} (GSA). Ce type d'approche pr{\'e}sente un grand
int{\'e}r{\^e}t pour analyser les incer-titudes de r{\'e}sultats de
mod{\'e}lisation , mais est toujours a un stade exploratoire dans les etudes
appliqu{\'e}es mettant en jeu des codes bas{\'e}s sur la r{\'e}solution
bidimensionnelle des equations de Saint-Venant. En effet, l' impl{\'e}mentation
d'une GSA est d{\'e}licate car elle
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2016 07:57:42 GMT'}]",2016-03-28,"[['Abily', 'M', '', 'I-CiTy'], ['Bertrand', 'N', '', 'IRSN'], ['Delestre', 'O', '', 'JAD'], ['Gourbesville', 'P', '', 'I-CiTy'], ['Richet', 'Y', '', 'IRSN'], ['Duluc', 'C. -M', '', 'IRSN']]","['Uncertainty', 'flood hazard modelling', 'global sensitivity analysis', '2D shallowwater equation', 'Sobol index']"
2302,1604.01401,"Thomas H\""aner","Thomas H\""aner, Damian S. Steiger, Krysta Svore, Matthias Troyer",A Software Methodology for Compiling Quantum Programs,,Quantum Sci. Technol. 3 (2018) 020501,10.1088/2058-9565/aaa5cc,,cs.PL quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quantum computers promise to transform our notions of computation by offering
a completely new paradigm. To achieve scalable quantum computation, optimizing
compilers and a corresponding software design flow will be essential. We
present a software architecture for compiling quantum programs from a
high-level language program to hardware-specific instructions. We describe the
necessary layers of abstraction and their differences and similarities to
classical layers of a computer-aided design flow. For each layer of the stack,
we discuss the underlying methods for compilation and optimization. Our
software methodology facilitates more rapid innovation among quantum algorithm
designers, quantum hardware engineers, and experimentalists. It enables
scalable compilation of complex quantum algorithms and can be targeted to any
specific quantum hardware implementation.
","[{'version': 'v1', 'created': 'Tue, 5 Apr 2016 20:00:03 GMT'}, {'version': 'v2', 'created': 'Wed, 11 May 2016 11:57:40 GMT'}]",2018-07-24,"[['Häner', 'Thomas', ''], ['Steiger', 'Damian S.', ''], ['Svore', 'Krysta', ''], ['Troyer', 'Matthias', '']]","['Quantum Computing', 'Compilers', 'Quantum Programming Languages']"
2303,1903.11518,Timothy Verstraeten,"Timothy Verstraeten, Ann Nowe, Jonathan Keller, Yi Guo, Shuangwen
  Sheng, Jan Helsen",Fleetwide data-enabled reliability improvement of wind turbines,"24 pages, 8 figures",Renew Sustain Energy Rev 109 (2019) 428-437,10.1016/j.rser.2019.03.019,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wind farms are an indispensable driver toward renewable and nonpolluting
energy resources. However, as ideal sites are limited, placement in remote and
challenging locations results in higher logistics costs and lower average wind
speeds. Therefore, it is critical to increase the reliability of the turbines
to reduce maintenance costs. Robust implementation requires a thorough
understanding of the loads subject to the turbine's control. Yet, such
dynamically changing multidimensional loads are uncommon with other machinery,
and generally underresearched. Therefore, a multitiered approach is proposed to
investigate the load spectrum occurring in wind farms. Our approach relies on
both fundamental research using controllable test rigs, as well as analyses of
real-world loading conditions in high-frequency supervisory control and data
acquisition data. A method is introduced to detect operational zones in wind
farm data and link them with load distributions. Additionally, while focused
research further investigates the load spectrum, a method is proposed that
continuously optimizes the farm's control protocols without the need to fully
understand the loads that occur. A case of gearbox failure is investigated
based on a vast body of past experiments and suspect loads are identified.
Starting from this evidence on the cause and effects of dynamic loads, the
potential of our methods is shown by analyzing real-world farm loading
conditions on a steady-state case of wake and developing a preventive row-based
control protocol for a case of cascading emergency brakes induced by a storm.
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2019 16:14:40 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Apr 2019 09:27:19 GMT'}]",2019-04-25,"[['Verstraeten', 'Timothy', ''], ['Nowe', 'Ann', ''], ['Keller', 'Jonathan', ''], ['Guo', 'Yi', ''], ['Sheng', 'Shuangwen', ''], ['Helsen', 'Jan', '']]","['wind turbine reliability', 'data-enabled load analysis', 'failureavoidance']"
2304,1806.01540,Antonio Farias,"Valdigleis S. Costaa, Antonio Diego S. Farias, Benjam\'in Bedregal,
  Regivan H. N. Santiago, Anne Magaly de P. Canuto","Combining Multiple Algorithms in Classifier Ensembles using Generalized
  Mixture Functions",,,10.1016/j.neucom.2018.06.021,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classifier ensembles are pattern recognition structures composed of a set of
classification algorithms (members), organized in a parallel way, and a
combination method with the aim of increasing the classification accuracy of a
classification system. In this study, we investigate the application of a
generalized mixture (GM) functions as a new approach for providing an efficient
combination procedure for these systems through the use of dynamic weights in
the combination process. Therefore, we present three GM functions to be applied
as a combination method. The main advantage of these functions is that they can
define dynamic weights at the member outputs, making the combination process
more efficient. In order to evaluate the feasibility of the proposed approach,
an empirical analysis is conducted, applying classifier ensembles to 25
different classification data sets. In this analysis, we compare the use of the
proposed approaches to ensembles using traditional combination methods as well
as the state-of-the-art ensemble methods. Our findings indicated gains in terms
of performance when comparing the proposed approaches to the traditional ones
as well as comparable results with the state-of-the-art methods.
","[{'version': 'v1', 'created': 'Tue, 5 Jun 2018 08:11:16 GMT'}]",2018-07-03,"[['Costaa', 'Valdigleis S.', ''], ['Farias', 'Antonio Diego S.', ''], ['Bedregal', 'Benjamín', ''], ['Santiago', 'Regivan H. N.', ''], ['Canuto', 'Anne Magaly de P.', '']]","['Classifier ensembles', 'Aggregation functions', 'Pre-aggregation functions', 'Generalized mixturefunctions']"
2305,1802.07938,Zhiyong Cheng,"Zhiyong Cheng, Ying Ding, Lei Zhu, Mohan Kankanhalli","Aspect-Aware Latent Factor Model: Rating Prediction with Ratings and
  Reviews",This paper has been accepted by the WWW 2018 Conference,,10.1145/3178876.3186145,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Although latent factor models (e.g., matrix factorization) achieve good
accuracy in rating prediction, they suffer from several problems including
cold-start, non-transparency, and suboptimal recommendation for local users or
items. In this paper, we employ textual review information with ratings to
tackle these limitations. Firstly, we apply a proposed aspect-aware topic model
(ATM) on the review text to model user preferences and item features from
different aspects, and estimate the aspect importance of a user towards an
item. The aspect importance is then integrated into a novel aspect-aware latent
factor model (ALFM), which learns user's and item's latent factors based on
ratings. In particular, ALFM introduces a weighted matrix to associate those
latent factors with the same set of aspects discovered by ATM, such that the
latent factors could be used to estimate aspect ratings. Finally, the overall
rating is computed via a linear combination of the aspect ratings, which are
weighted by the corresponding aspect importance. To this end, our model could
alleviate the data sparsity problem and gain good interpretability for
recommendation. Besides, an aspect rating is weighted by an aspect importance,
which is dependent on the targeted user's preferences and targeted item's
features. Therefore, it is expected that the proposed method can model a user's
preferences on an item more accurately for each user-item pair locally.
Comprehensive experimental studies have been conducted on 19 datasets from
Amazon and Yelp 2017 Challenge dataset. Results show that our method achieves
significant improvement compared with strong baseline methods, especially for
users with only few ratings. Moreover, our model could interpret the
recommendation results in depth.
","[{'version': 'v1', 'created': 'Thu, 22 Feb 2018 08:23:51 GMT'}]",2018-02-23,"[['Cheng', 'Zhiyong', ''], ['Ding', 'Ying', ''], ['Zhu', 'Lei', ''], ['Kankanhalli', 'Mohan', '']]","['Aspect-aware', 'Matrix Factorization', 'Recommendation', 'Review-aware', 'Topic Model']"
2306,1408.4363,Xavier Giro-i-Nieto,"Eva Mohedano (1), Graham Healy (1), Kevin McGuinness (1), Xavier
  Giro-i-Nieto (2), Noel E. O'Connor (1) and Alan F. Smeaton (1) ((1) Dublin
  City University, (2) Universitat Politecnica de Catalunya)",Object Segmentation in Images using EEG Signals,"This is a preprint version prior to submission for peer-review of the
  paper accepted to the 22nd ACM International Conference on Multimedia
  (November 3-7, 2014, Orlando, Florida, USA) for the High Risk High Reward
  session. 10 pages",,10.1145/2647868.2654896,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper explores the potential of brain-computer interfaces in segmenting
objects from images. Our approach is centered around designing an effective
method for displaying the image parts to the users such that they generate
measurable brain reactions. When an image region, specifically a block of
pixels, is displayed we estimate the probability of the block containing the
object of interest using a score based on EEG activity. After several such
blocks are displayed, the resulting probability map is binarized and combined
with the GrabCut algorithm to segment the image into object and background
regions. This study shows that BCI and simple EEG analysis are useful in
locating object boundaries in images.
","[{'version': 'v1', 'created': 'Tue, 19 Aug 2014 15:24:44 GMT'}]",2014-08-20,"[['Mohedano', 'Eva', ''], ['Healy', 'Graham', ''], ['McGuinness', 'Kevin', ''], ['Giro-i-Nieto', 'Xavier', ''], [""O'Connor"", 'Noel E.', ''], ['Smeaton', 'Alan F.', '']]","['Brain-computer interfaces', 'Electroencephalography', 'rapidserial visual presentation', 'Object segmentation', 'Interactivesegmentation', 'GrabCut algorithm']"
2307,1811.02653,Vipul Gupta,Vipul Gupta and Shusen Wang and Thomas Courtade and Kannan Ramchandran,OverSketch: Approximate Matrix Multiplication for the Cloud,"Published in Proc. IEEE Big Data 2018. Updated version provides
  details of distributed sketching and highlights other advantages of
  OverSketch","2018 IEEE International Conference on Big Data (Big Data),
  Seattle, WA, USA, 2018, pp. 298-304",10.1109/BigData.2018.8622139,,cs.DC cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose OverSketch, an approximate algorithm for distributed matrix
multiplication in serverless computing. OverSketch leverages ideas from matrix
sketching and high-performance computing to enable cost-efficient
multiplication that is resilient to faults and straggling nodes pervasive in
low-cost serverless architectures. We establish statistical guarantees on the
accuracy of OverSketch and empirically validate our results by solving a
large-scale linear program using interior-point methods and demonstrate a 34%
reduction in compute time on AWS Lambda.
","[{'version': 'v1', 'created': 'Tue, 6 Nov 2018 21:09:43 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Feb 2019 01:29:05 GMT'}]",2019-02-25,"[['Gupta', 'Vipul', ''], ['Wang', 'Shusen', ''], ['Courtade', 'Thomas', ''], ['Ramchandran', 'Kannan', '']]","['serverlesscomputing', 'stragglermitigation', 'sketched matrix multiplication']"
2308,1504.02692,Henning Urbat,Liang-Ting Chen and Henning Urbat,A Fibrational Approach to Automata Theory,,CALCO (2015) 50-65,10.4230/LIPIcs.CALCO.2015.50,,cs.FL math.CT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For predual categories C and D we establish isomorphisms between opfibrations
representing local varieties of languages in C, local pseudovarieties of
D-monoids, and finitely generated profinite D-monoids. The global sections of
these opfibrations are shown to correspond to varieties of languages in C,
pseudovarieties of D-monoids, and profinite equational theories of D-monoids,
respectively. As an application, we obtain a new proof of Eilenberg's variety
theorem along with several related results, covering varieties of languages and
their coalgebraic modifications, Straubing's C-varieties, fully invariant local
varieties, etc., within a single framework.
","[{'version': 'v1', 'created': 'Fri, 10 Apr 2015 14:39:17 GMT'}]",2015-11-06,"[['Chen', 'Liang-Ting', ''], ['Urbat', 'Henning', '']]","['Eilenberg’s variety theorem', 'duality', 'coalgebra', 'Grothendieck fibration']"
2309,1111.0554,Abbas Mehrabian,"Shayan Ehsani and Saber Shokat Fadaee and MohammadAmin Fazli and Abbas
  Mehrabian and Sina Sadeghian Sadeghabad and MohammadAli Safari and Morteza
  Saghafian",On a Bounded Budget Network Creation Game,"28 pages, 3 figures, preliminary version appeared in SPAA'11","ACM Transactions on Algorithms (2015), 11(4), article 34",10.1145/2701615,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a network creation game in which each player (vertex) has a fixed
budget to establish links to other players. In our model, each link has unit
price and each agent tries to minimize its cost, which is either its local
diameter or its total distance to other players in the (undirected) underlying
graph of the created network. Two versions of the game are studied: in the MAX
version, the cost incurred to a vertex is the maximum distance between the
vertex and other vertices, and in the SUM version, the cost incurred to a
vertex is the sum of distances between the vertex and other vertices. We prove
that in both versions pure Nash equilibria exist, but the problem of finding
the best response of a vertex is NP-hard. We take the social cost of the
created network to be its diameter, and next we study the maximum possible
diameter of an equilibrium graph with n vertices in various cases. When the sum
of players' budgets is n-1, the equilibrium graphs are always trees, and we
prove that their maximum diameter is Theta(n) and Theta(log n) in MAX and SUM
versions, respectively. When each vertex has unit budget (i.e. can establish
link to just one vertex), the diameter of any equilibrium graph in either
version is Theta(1). We give examples of equilibrium graphs in the MAX version,
such that all vertices have positive budgets and yet the diameter is
Omega(sqrt(log n)). This interesting (and perhaps counter-intuitive) result
shows that increasing the budgets may increase the diameter of equilibrium
graphs and hence deteriorate the network structure. Then we prove that every
equilibrium graph in the SUM version has diameter 2^O(sqrt(log n)). Finally, we
show that if the budget of each player is at least k, then every equilibrium
graph in the SUM version is k-connected or has diameter smaller than 4.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2011 16:11:07 GMT'}, {'version': 'v2', 'created': 'Sun, 10 Jun 2012 22:20:25 GMT'}]",2015-04-21,"[['Ehsani', 'Shayan', ''], ['Fadaee', 'Saber Shokat', ''], ['Fazli', 'MohammadAmin', ''], ['Mehrabian', 'Abbas', ''], ['Sadeghabad', 'Sina Sadeghian', ''], ['Safari', 'MohammadAli', ''], ['Saghafian', 'Morteza', '']]","['Network Creation Games', 'Nash Equilibria', 'Price of Anarchy', 'Local Diameter', 'Braess’s Paradox', 'Bounded Budget']"
2310,1801.00552,Junan Zhu,"Junan Zhu, Dror Baron","Performance Limits with Additive Error Metrics in Noisy
  Multi-Measurement Vector Problem","11 pages, 5 figures. Accepted by IEEE Transactions on Signal
  Processing",,10.1109/TSP.2018.2866844,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real-world applications such as magnetic resonance imaging with multiple
coils, multi-user communication, and diffuse optical tomography often assume a
linear model where several sparse signals sharing common sparse supports are
acquired by several measurement matrices and then contaminated by noise.
Multi-measurement vector (MMV) problems consider the estimation or
reconstruction of such signals. In different applications, the estimation error
that we want to minimize could be the mean squared error or other metrics such
as the mean absolute error and the support set error. Seeing that minimizing
different error metrics is useful in MMV problems, we study
information-theoretic performance limits for MMV signal estimation with
arbitrary additive error metrics. We also propose a message passing algorithmic
framework that achieves the optimal performance, and rigorously prove the
optimality of our algorithm for a special case. We further conjecture the
optimality of our algorithm for some general cases, and back it up through
numerical examples. As an application of our MMV algorithm, we propose a novel
setup for active user detection in multi-user communication and demonstrate the
promise of our proposed setup.
","[{'version': 'v1', 'created': 'Tue, 2 Jan 2018 05:20:23 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Aug 2018 01:01:57 GMT'}]",2018-10-17,"[['Zhu', 'Junan', ''], ['Baron', 'Dror', '']]","['Active user detection', 'error metric', 'messagepassing', 'multi-measurement vector problem']"
2311,1308.0223,Tarik Anouari,Tarik Anouari and Abdelkrim Haqiq,"Performance Analysis of VoIP Traffic in WiMAX using various Service
  Classes",,International.Journal.Computer.Applications. 52-20 (2012) 975-8887,10.5120/8319-1956,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  Worldwide Interoperability for Microwave Access (WiMAX) is currently one of
the hottest technologies in wireless, it is a standard-based on the IEEE 802.16
wireless technology that provides high throughput broadband connections over
long distance, which supports Point to MultiPoint (PMP) broadband wireless
access. In parallel, Voice over Internet Protocol is a promising new technology
which provides access to voice communication over internet protocol based
network, it becomes an alternative to public switched telephone networks due to
its capability of transmission of voice as packets over IP networks. Therefore
VoIP is largely intolerant of delay and hence it needs a high priority
transmission. In this paper we investigate the performances of the most common
VoIP codecs, which are G711, G7231 and G729 over a WiMAX network using various
service classes and NOAH as a transport protocol. To analyze the QoS
parameters, the popular network simulator ns2 was used. Various parameters that
determine QoS of real life usage scenarios and traffic flows of applications is
analyzed. The objective is to compare different types of service classes with
respect to the QoS parameters, such as, throughput, average jitter and average
delay.
","[{'version': 'v1', 'created': 'Thu, 1 Aug 2013 14:35:02 GMT'}]",2013-08-02,"[['Anouari', 'Tarik', ''], ['Haqiq', 'Abdelkrim', '']]","['WiMAX', 'VoIP', 'BE', 'UGS', 'rtPS', 'NS2']"
2312,1610.06718,D Thirumulanathan,"D. Thirumulanathan, Rajesh Sundaresan, and Y Narahari","Optimal Mechanisms for Selling Two Items to a Single Buyer Having
  Uniformly Distributed Valuations","A preliminary version of the manuscript was published in Proceedings
  of the 12th Conference on Web and Internet Economics (WINE), 2016, Montreal,
  Canada","Journal of Mathematical Economics (JME), vol. 82, pp. 1--30, 2019",10.1016/j.jmateco.2019.01.004,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the design of a revenue-optimal mechanism when two items are
available to be sold to a single buyer whose valuation is uniformly distributed
over an arbitrary rectangle $[c_1,c_1+b_1]\times[c_2,c_2+b_2]$ in the positive
quadrant. We provide an explicit, complete solution for arbitrary nonnegative
values of $(c_1,c_2,b_1,b_2)$. We identify eight simple structures, each with
at most $4$ (possibly stochastic) menu items, and prove that the optimal
mechanism has one of these eight structures. We also characterize the optimal
mechanism as a function of $(c_1,c_2,b_1,b_2)$. The structures indicate that
the optimal mechanism involves (a) an interplay of individual sale and a bundle
sale when $c_1$ and $c_2$ are low, (b) a bundle sale when $c_1$ and $c_2$ are
high, and (c) an individual sale when one of them is high and the other is low.
To the best of our knowledge, our results are the first to show the existence
of optimal mechanisms with no exclusion region. We further conjecture, based on
promising preliminary results, that our methodology can be extended to a wider
class of distributions.
","[{'version': 'v1', 'created': 'Fri, 21 Oct 2016 09:32:37 GMT'}, {'version': 'v2', 'created': 'Fri, 5 May 2017 06:22:25 GMT'}, {'version': 'v3', 'created': 'Thu, 29 Jun 2017 10:28:01 GMT'}, {'version': 'v4', 'created': 'Wed, 31 Jan 2018 19:33:46 GMT'}, {'version': 'v5', 'created': 'Wed, 26 Sep 2018 06:51:44 GMT'}, {'version': 'v6', 'created': 'Tue, 5 Mar 2019 09:18:25 GMT'}]",2019-03-06,"[['Thirumulanathan', 'D.', ''], ['Sundaresan', 'Rajesh', ''], ['Narahari', 'Y', '']]","['Game theory', 'Economics', 'Optimal Auctions', 'StochasticOrders', 'Convex Optimization']"
2313,1111.4083,Denis Berthier,Denis Berthier (DSI),Unbiased Statistics of a CSP - A Controlled-Bias Generator,,"Innovations in Computing Sciences and Software Engineering, (2010)
  165-170",10.1007/978-90-481-3660-5_28,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that estimating the complexity (mean and distribution) of the
instances of a fixed size Constraint Satisfaction Problem (CSP) can be very
hard. We deal with the main two aspects of the problem: defining a measure of
complexity and generating random unbiased instances. For the first problem, we
rely on a general framework and a measure of complexity we presented at
CISSE08. For the generation problem, we restrict our analysis to the Sudoku
example and we provide a solution that also explains why it is so difficult.
","[{'version': 'v1', 'created': 'Thu, 17 Nov 2011 13:15:24 GMT'}]",2015-06-03,"[['Berthier', 'Denis', '', 'DSI']]","['constraint satisfaction problem', 'modelling and simulation', 'unbiased statistics', 'Sudoku puzzle generation', 'Sudoku rating']"
2314,2007.12632,Luiz Capretz Dr.,"Luiz Fernando Capretz, Shuib Basri, Maythem Adili, and Aamir Amin",What Malaysian Software Students Think about Testing?,pp. 195-196,"IEEE/ACM 42nd International Conference on Software Engineering
  Workshops (ICSE-CHASE 2020), 2020",10.1145/3387940.3392167,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software testing is one of the crucial supporting processes of software life
cycle. Unfortunately for the software industry, the role is stigmatized, partly
due to misperception and partly due to treatment of the role in the software
industry. The present study aims to analyse this situation to explore what
inhibit an individual from taking up a software testing career. In order to
investigate this issue, we surveyed 82 senior students taking a degree in
information technology, information and communication technology, and computer
science at two Malaysian universities. The subjects were asked the PROs and
CONs of taking up a career in software testing and what were the chances that
they would do so. The study identified 7 main PROs and 9 main CONSs for
starting a testing career, and indicated that the role of software tester has
been perceived as a social role, with more soft skills connotations than
technical implications. The results also show that Malaysian students have a
more positive attitude towards software testing than their counterparts where
similar investigations have been carried out.
","[{'version': 'v1', 'created': 'Thu, 16 Jul 2020 14:24:06 GMT'}]",2020-07-27,"[['Capretz', 'Luiz Fernando', ''], ['Basri', 'Shuib', ''], ['Adili', 'Maythem', ''], ['Amin', 'Aamir', '']]","['Human factors in software engineering', 'Software engineering', 'Software testing', 'Software careers', 'Cross-cultural studies']"
2315,1107.1206,EPTCS,"Mathieu Tracol (IST Austria), Jos\'ee Desharnais (Departement
  d'informatique et de g\'enie logiciel, Universit\'e Laval, Qu\'ebec, Canada),
  Abir Zhioua (Departement d'informatique et de g\'enie logiciel, Universit\'e
  Laval, Qu\'ebec, Canada)",Computing Distances between Probabilistic Automata,"In Proceedings QAPL 2011, arXiv:1107.0746","EPTCS 57, 2011, pp. 148-162",10.4204/EPTCS.57.11,,cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present relaxed notions of simulation and bisimulation on Probabilistic
Automata (PA), that allow some error epsilon. When epsilon is zero we retrieve
the usual notions of bisimulation and simulation on PAs. We give logical
characterisations of these notions by choosing suitable logics which differ
from the elementary ones, L with negation and L without negation, by the modal
operator. Using flow networks, we show how to compute the relations in PTIME.
This allows the definition of an efficiently computable non-discounted distance
between the states of a PA. A natural modification of this distance is
introduced, to obtain a discounted distance, which weakens the influence of
long term transitions. We compare our notions of distance to others previously
defined and illustrate our approach on various examples. We also show that our
distance is not expansive with respect to process algebra operators. Although L
without negation is a suitable logic to characterise epsilon-(bi)simulation on
deterministic PAs, it is not for general PAs; interestingly, we prove that it
does characterise weaker notions, called a priori epsilon-(bi)simulation, which
we prove to be NP-difficult to decide.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2011 17:55:31 GMT'}]",2011-07-07,"[['Tracol', 'Mathieu', '', 'IST Austria'], ['Desharnais', 'Josée', '', ""Departement\n  d'informatique et de génie logiciel, Université Laval, Québec, Canada""], ['Zhioua', 'Abir', '', ""Departement d'informatique et de génie logiciel, Université\n  Laval, Québec, Canada""]]","['Metrics', 'Bisimulation', 'Logic', 'Probabilistic Automata']"
2316,1805.11970,Rodrigo Berriel,"Rodrigo F. Berriel, Franco Schmidt Rossi, Alberto F. de Souza, Thiago
  Oliveira-Santos","Automatic Large-Scale Data Acquisition via Crowdsourcing for Crosswalk
  Classification: A Deep Learning Approach","13 pages, 13 figures, 3 videos, and GitHub with models","Computers & Graphics, 2017, vol. 68, pp. 32-42",10.1016/J.CAG.2017.08.004,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Correctly identifying crosswalks is an essential task for the driving
activity and mobility autonomy. Many crosswalk classification, detection and
localization systems have been proposed in the literature over the years. These
systems use different perspectives to tackle the crosswalk classification
problem: satellite imagery, cockpit view (from the top of a car or behind the
windshield), and pedestrian perspective. Most of the works in the literature
are designed and evaluated using small and local datasets, i.e. datasets that
present low diversity. Scaling to large datasets imposes a challenge for the
annotation procedure. Moreover, there is still need for cross-database
experiments in the literature because it is usually hard to collect the data in
the same place and conditions of the final application. In this paper, we
present a crosswalk classification system based on deep learning. For that,
crowdsourcing platforms, such as OpenStreetMap and Google Street View, are
exploited to enable automatic training via automatic acquisition and annotation
of a large-scale database. Additionally, this work proposes a comparison study
of models trained using fully-automatic data acquisition and annotation against
models that were partially annotated. Cross-database experiments were also
included in the experimentation to show that the proposed methods enable use
with real world applications. Our results show that the model trained on the
fully-automatic database achieved high overall accuracy (94.12%), and that a
statistically significant improvement (to 96.30%) can be achieved by manually
annotating a specific part of the database. Finally, the results of the
cross-database experiments show that both models are robust to the many
variations of image and scenarios, presenting a consistent behavior.
","[{'version': 'v1', 'created': 'Wed, 30 May 2018 13:55:14 GMT'}]",2018-05-31,"[['Berriel', 'Rodrigo F.', ''], ['Rossi', 'Franco Schmidt', ''], ['de Souza', 'Alberto F.', ''], ['Oliveira-Santos', 'Thiago', '']]","['Crosswalk classification', 'Zebra-crossing classification', 'Deep learning', 'Crowdsourcing', 'Large-scale database']"
2317,1809.09034,Thorben Casper,"Thorben Casper, Ulrich R\""omer, Sebastian Sch\""ops, Herbert De Gersem","Coupled Simulation of Transient Heat Flow and Electric Currents in Thin
  Wires: Application to Bond Wires in Microelectronic Chip Packaging","all numerical results can be reproduced by the Matlab code openly
  available at https://github.com/tc88/ETwireSim","Computers & Mathematics with Applications, 2019",10.1016/j.camwa.2019.10.009,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work addresses the simulation of heat flow and electric currents in thin
wires. An important application is the use of bond wires in microelectronic
chip packaging. The heat distribution is modeled by an electrothermal coupled
problem, which poses numerical challenges due to the presence of different
geometric scales. The necessity of very fine grids is relaxed by solving and
embedding a 1D sub-problem along the wire into the surrounding 3D geometry. The
arising singularities are described using de Rham currents. It is shown that
the problem is related to fluid flow in porous 3D media with 1D fractures [C.
D'Angelo, SIAM Journal on Numerical Analysis 50.1, pp. 194-215, 2012]. A
careful formulation of the 1D-3D coupling condition is essential to obtain a
stable scheme that yields a physical solution. Elliptic model problems are used
to investigate the numerical errors and the corresponding convergence rates.
Additionally, the transient electrothermal simulation of a simplified
microelectronic chip package as used in industrial applications is presented.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2018 16:28:25 GMT'}]",2020-02-04,"[['Casper', 'Thorben', ''], ['Römer', 'Ulrich', ''], ['Schöps', 'Sebastian', ''], ['De Gersem', 'Herbert', '']]","['coupled problems', 'de Rham currents', 'electrothermal problems', 'network model', 'singularities', 'thin wires']"
2318,1903.07410,Tom\'a\v{s} Masa\v{r}\'ik,"Julien Baste, Michael R. Fellows, Lars Jaffke, Tom\'a\v{s}
  Masa\v{r}\'ik, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A.
  Rosamond","Diversity of Solutions: An Exploration Through the Lens of
  Fixed-Parameter Tractability Theory","Accepted to Twenty-Ninth International Joint Conference on Artificial
  Intelligence, {IJCAI} 2020, 16 pages","Artificial Intelligence 303, 103644:1-103644:15, 2022",10.1016/j.artint.2021.103644,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When modeling an application of practical relevance as an instance of a
combinatorial problem X, we are often interested not merely in finding one
optimal solution for that instance, but in finding a sufficiently diverse
collection of good solutions. In this work we initiate a systematic study of
diversity from the point of view of fixed-parameter tractability theory. First,
we consider an intuitive notion of diversity of a collection of solutions which
suits a large variety of combinatorial problems of practical interest. We then
present an algorithmic framework which --automatically-- converts a
tree-decomposition-based dynamic programming algorithm for a given
combinatorial problem X into a dynamic programming algorithm for the diverse
version of X. Surprisingly, our algorithm has a polynomial dependence on the
diversity parameter.
","[{'version': 'v1', 'created': 'Mon, 18 Mar 2019 13:05:44 GMT'}, {'version': 'v2', 'created': 'Sat, 12 Sep 2020 01:38:39 GMT'}]",2021-12-15,"[['Baste', 'Julien', ''], ['Fellows', 'Michael R.', ''], ['Jaffke', 'Lars', ''], ['Masařík', 'Tomáš', ''], ['Oliveira', 'Mateus de Oliveira', ''], ['Philip', 'Geevarghese', ''], ['Rosamond', 'Frances A.', '']]","['Diversity', 'Combinatorial Optimization', 'Dynamic Programming']"
2319,1501.06326,Blesson Varghese,Blesson Varghese,The GPU vs Phi Debate: Risk Analytics Using Many-Core Computing,"A modified version of this article is accepted to the Computers and
  Electrical Engineering Journal under the title - ""The Hardware Accelerator
  Debate: A Financial Risk Case Study Using Many-Core Computing""; Blesson
  Varghese, ""The Hardware Accelerator Debate: A Financial Risk Case Study Using
  Many-Core Computing,"" Computers and Electrical Engineering, 2015",,10.1016/j.compeleceng.2015.01.012,,cs.DC cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The risk of reinsurance portfolios covering globally occurring natural
catastrophes, such as earthquakes and hurricanes, is quantified by employing
simulations. These simulations are computationally intensive and require large
amounts of data to be processed. The use of many-core hardware accelerators,
such as the Intel Xeon Phi and the NVIDIA Graphics Processing Unit (GPU), are
desirable for achieving high-performance risk analytics. In this paper, we set
out to investigate how accelerators can be employed in risk analytics, focusing
on developing parallel algorithms for Aggregate Risk Analysis, a simulation
which computes the Probable Maximum Loss of a portfolio taking both primary and
secondary uncertainties into account. The key result is that both hardware
accelerators are useful in different contexts; without taking data transfer
times into account the Phi had lowest execution times when used independently
and the GPU along with a host in a hybrid platform yielded best performance.
","[{'version': 'v1', 'created': 'Mon, 26 Jan 2015 10:52:18 GMT'}]",2015-02-04,"[['Varghese', 'Blesson', '']]","['hardware accelerators', 'many-core computing', 'secondary uncertainty', 'financial risk', 'catastrophic risk', 'risk analysis', 'Phi', 'GPU']"
2320,2205.02485,Bernhard C. Geiger,"Christoph Schweimer and Christine Gfrerer and Florian Lugstein and
  David Pape and Jan A. Velimsky and Robert Els\""asser and Bernhard C. Geiger","Generating Simple Directed Social Network Graphs for Information
  Spreading","11 pages, 7 figures; published at ACM Web Conference 2022","Proc. ACM Web Conf., p. 1475-1485, Apr. 2022",10.1145/3485447.3512194,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online social networks are a dominant medium in everyday life to stay in
contact with friends and to share information. In Twitter, users can connect
with other users by following them, who in turn can follow back. In recent
years, researchers studied several properties of social networks and designed
random graph models to describe them. Many of these approaches either focus on
the generation of undirected graphs or on the creation of directed graphs
without modeling the dependencies between reciprocal (i.e., two directed edges
of opposite direction between two nodes) and directed edges. We propose an
approach to generate directed social network graphs that creates reciprocal and
directed edges and considers the correlation between the respective degree
sequences.
  Our model relies on crawled directed graphs in Twitter, on which information
w.r.t. a topic is exchanged or disseminated. While these graphs exhibit a high
clustering coefficient and small average distances between random node pairs
(which is typical in real-world networks), their degree sequences seem to
follow a $\chi^2$-distribution rather than power law. To achieve high
clustering coefficients, we apply an edge rewiring procedure that preserves the
node degrees.
  We compare the crawled and the created graphs, and simulate certain
algorithms for information dissemination and epidemic spreading on them. The
results show that the created graphs exhibit very similar topological and
algorithmic properties as the real-world graphs, providing evidence that they
can be used as surrogates in social network analysis. Furthermore, our model is
highly scalable, which enables us to create graphs of arbitrary size with
almost the same properties as the corresponding real-world networks.
","[{'version': 'v1', 'created': 'Thu, 5 May 2022 07:54:24 GMT'}]",2022-05-06,"[['Schweimer', 'Christoph', ''], ['Gfrerer', 'Christine', ''], ['Lugstein', 'Florian', ''], ['Pape', 'David', ''], ['Velimsky', 'Jan A.', ''], ['Elsässer', 'Robert', ''], ['Geiger', 'Bernhard C.', '']]","['Social Network Graphs', 'Random Graph Generation', 'CorrelatedDegree Distributions', 'Edge Rewiring']"
2321,1405.1112,EPTCS,"\'Etienne Andr\'e (Universit\'e Paris 13, France), Mohamed Mahdi
  Benmoussa (Universit\'e Paris 13, France), Christine Choppy (Universit\'e
  Paris 13, France)","Translating UML State Machines to Coloured Petri Nets Using Acceleo: A
  Report","In Proceedings ESSS 2014, arXiv:1405.0554","EPTCS 150, 2014, pp. 1-7",10.4204/EPTCS.150.1,,cs.SE cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  UML state machines are widely used to specify dynamic systems behaviours.
However its semantics is described informally, thus preventing the application
of model checking techniques that could guarantee the system safety. In a
former work, we proposed a formalisation of non-concurrent UML state machines
using coloured Petri nets, so as to allow for formal verification. In this
paper, we report our experience to implement this translation in an automated
manner using the model-to-text transformation tool Acceleo. Whereas Acceleo
provides interesting features that facilitated our translation process, it also
suffers from limitations uneasy to overcome.
","[{'version': 'v1', 'created': 'Tue, 6 May 2014 00:53:22 GMT'}]",2014-05-07,"[['André', 'Étienne', '', 'Université Paris 13, France'], ['Benmoussa', 'Mohamed Mahdi', '', 'Université Paris 13, France'], ['Choppy', 'Christine', '', 'Université\n  Paris 13, France']]","['model transformation', 'software engineering', 'model checking', 'system safety', 'UML']"
2322,2105.05248,Reza Fotohi,"Samane Asgari, Shahram Jamali, Reza Fotohi, and Mahdi Nooshyar","Performance-aware placement and chaining scheme for virtualized network
  functions: a particle swarm optimization approach","22 pages, 10 Figures, 3 Tables, J Supercomput (2021)",,10.1007/s11227-021-03758-9,,cs.NI cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Network functions virtualization (NFV) is a new concept that has received the
attention of both researchers and network providers. NFV decouples network
functions from specialized hardware devices and virtualizes these network
functions as software instances called virtualized network functions (VNFs).
NFV leads to various benefits, including more flexibility, high resource
utilization, and easy upgrades and maintenances. Despite recent works in this
field, placement and chaining of VNFs need more attention. More specifically,
some of the existing works have considered only the placement of VNFs and
ignored the chaining part. So, they have not provided an integrated view of
host or bandwidth resources and propagation delay of paths. In this paper, we
solve the VNF placement and chaining problem as an optimization problem based
on the particle swarm optimization (PSO) algorithm. Our goal is to minimize the
required number of used servers, the average propagation delay of paths, and
the average utilization of links while meeting network demands and constraints.
Based on the obtained results, the algorithm proposed in this study can find
feasible and high-quality solutions.
","[{'version': 'v1', 'created': 'Fri, 9 Apr 2021 07:26:50 GMT'}]",2021-05-12,"[['Asgari', 'Samane', ''], ['Jamali', 'Shahram', ''], ['Fotohi', 'Reza', ''], ['Nooshyar', 'Mahdi', '']]","['Network functions virtualization (NFV)', 'Virtualized Network Functions (VNFs)', 'Placement and chaining']"
2323,1203.2431,Adri\'an Riesco,Adri\'an Riesco and Juan Rodr\'iguez-Hortal\'a,Singular and Plural Functions for Functional Logic Programming,"53 pages, 5 figures",Theory and Practice of Logic Programming 14 (2014) 65-116,10.1017/S147106841200004X,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Functional logic programming (FLP) languages use non-terminating and
non-confluent constructor systems (CS's) as programs in order to define
non-strict non-determi-nistic functions. Two semantic alternatives have been
usually considered for parameter passing with this kind of functions: call-time
choice and run-time choice. While the former is the standard choice of modern
FLP languages, the latter lacks some properties---mainly
compositionality---that have prevented its use in practical FLP systems.
Traditionally it has been considered that call-time choice induces a singular
denotational semantics, while run-time choice induces a plural semantics. We
have discovered that this latter identification is wrong when pattern matching
is involved, and thus we propose two novel compositional plural semantics for
CS's that are different from run-time choice.
  We study the basic properties of our plural semantics---compositionality,
polarity, monotonicity for substitutions, and a restricted form of the bubbling
property for constructor systems---and the relation between them and to
previous proposals, concluding that these semantics form a hierarchy in the
sense of set inclusion of the set of computed values. We have also identified a
class of programs characterized by a syntactic criterion for which the proposed
plural semantics behave the same, and a program transformation that can be used
to simulate one of them by term rewriting. At the practical level, we study how
to use the expressive capabilities of these semantics for improving the
declarative flavour of programs. We also propose a language which combines
call-time choice and our plural semantics, that we have implemented in Maude.
The resulting interpreter is employed to test several significant examples
showing the capabilities of the combined semantics.
  To appear in Theory and Practice of Logic Programming (TPLP)
","[{'version': 'v1', 'created': 'Mon, 12 Mar 2012 09:23:07 GMT'}]",2020-02-19,"[['Riesco', 'Adrián', ''], ['Rodríguez-Hortalá', 'Juan', '']]","['Non-deterministic functions', 'Semantics', 'Program transformation', 'Termrewriting', 'Maude']"
2324,1508.07480,Jes\'us Tramullas,"Jes\'us Tramullas, Ana I. S\'anchez-Casab\'on, Piedad Garrido-Picazo","Studies and analysis of reference management software: a literature
  review","Preprint. Accepted to be published in El Profesional de la
  Informaci\'on, 2015. ISSN: 1386-6710",,10.3145/epi.2015.sep.17,,cs.DL,http://creativecommons.org/licenses/by-sa/4.0/,"  Reference management software is a well-known tool for scientific research
work. Since the 1980s, it has been the subject of reviews and evaluations in
library and information science literature. This paper presents a systematic
review of published studies that evaluate reference management software with a
comparative approach. The objective is to identify the types, models, and
evaluation criteria that authors have adopted, in order to determine whether
the methods used provide adequate methodological rigor and useful contributions
to the field of study.
","[{'version': 'v1', 'created': 'Sat, 29 Aug 2015 17:26:54 GMT'}]",2016-01-22,"[['Tramullas', 'Jesús', ''], ['Sánchez-Casabón', 'Ana I.', ''], ['Garrido-Picazo', 'Piedad', '']]","['reference management software', 'evaluation methods', 'bibliography']"
2325,1901.05754,Fernando Mac\'ias,"Fernando Mac\'ias, Uwe Wolter, Adrian Rutle, Francisco Dur\'an,
  Roberto Rodriguez-Echeverria","Multilevel Coupled Model Transformations for Precise and Reusable
  Definition of Model Behaviour","Journal of Logical and Algebraic Methods in Programming. Available
  online 11 January 2019. In Press, Accepted Manuscript",,10.1016/j.jlamp.2018.12.005,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of Domain-Specific Languages (DSLs) is a promising field for the
development of tools tailored to specific problem spaces, effectively
diminishing the complexity of hand-made software. With the goal of making
models as precise, simple and reusable as possible, we augment DSLs with
concepts from multilevel modelling, where the number of abstraction levels are
not limited. This is particularly useful for DSL definitions with behaviour,
whose concepts inherently belong to different levels of abstraction. Here,
models can represent the state of the modelled system and evolve using model
transformations. These transformations can benefit from a multilevel setting,
becoming a precise and reusable definition of the semantics for behavioural
modelling languages. We present in this paper the concept of Multilevel Coupled
Model Transformations, together with examples, formal definitions and tools to
assess their conceptual soundness and practical value.
","[{'version': 'v1', 'created': 'Thu, 17 Jan 2019 12:25:47 GMT'}]",2019-01-18,"[['Macías', 'Fernando', ''], ['Wolter', 'Uwe', ''], ['Rutle', 'Adrian', ''], ['Durán', 'Francisco', ''], ['Rodriguez-Echeverria', 'Roberto', '']]","['Model-Driven Engineering', 'Graph Transformation', 'Multilevel Modelling', 'Multilevel CoupledModel Transformation', 'Behavioural Modelling']"
2326,1211.0090,Yaser Sadra,"Sodeif Ahadpour, Yaser Sadra",A Chaos-based Image Encryption Scheme using Chaotic Coupled Map Lattices,"4 pages, 3 figures. arXiv admin note: substantial text overlap with
  arXiv:1201.1449, arXiv:1112.3791","International Journal of Computer Applications 49(2):15-18, July
  2012. Published by Foundation of Computer Science, New York, USA",10.5120/7599-0311,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, information security essential in various arenas like
internet communication, multimedia systems, medical imaging, tele-medicine and
military communication. However, most of them faced with some problems such as
the lack of robustness and security. In this letter, after reviewing the main
points of the chaotic trigonometric maps and the coupled map lattices, we
introduce the scheme of chaos-based image encryption based on coupled map lat
tices. The scheme decreases periodic effect of the ergodic dynamical systems in
the chaos-based image encryption. To evaluate the security of the encrypted
image of this scheme, the key space analysis, the correlation of two adjacent
pixels and differential attack were performed. This scheme tries to improve the
problem of failure of encryption such as small key space and level of security.
","[{'version': 'v1', 'created': 'Thu, 1 Nov 2012 04:30:15 GMT'}]",2012-11-02,"[['Ahadpour', 'Sodeif', ''], ['Sadra', 'Yaser', '']]","['Chaotic function', 'Image encryption', 'Coupled map lattice', 'Chaotic trigonometric map.     1']"
2327,1701.02433,Haifeng Zhang,"Haifeng Zhang, Weinan Zhang, Yifei Rong, Kan Ren, Wenxin Li, Jun Wang",Managing Risk of Bidding in Display Advertising,,,10.1145/3018661.3018701,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we deal with the uncertainty of bidding for display
advertising. Similar to the financial market trading, real-time bidding (RTB)
based display advertising employs an auction mechanism to automate the
impression level media buying; and running a campaign is no different than an
investment of acquiring new customers in return for obtaining additional
converted sales. Thus, how to optimally bid on an ad impression to drive the
profit and return-on-investment becomes essential. However, the large
randomness of the user behaviors and the cost uncertainty caused by the auction
competition may result in a significant risk from the campaign performance
estimation. In this paper, we explicitly model the uncertainty of user
click-through rate estimation and auction competition to capture the risk. We
borrow an idea from finance and derive the value at risk for each ad display
opportunity. Our formulation results in two risk-aware bidding strategies that
penalize risky ad impressions and focus more on the ones with higher expected
return and lower risk. The empirical study on real-world data demonstrates the
effectiveness of our proposed risk-aware bidding strategies: yielding profit
gains of 15.4% in offline experiments and up to 17.5% in an online A/B test on
a commercial RTB platform over the widely applied bidding strategies.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2017 04:17:49 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Jan 2017 11:44:39 GMT'}]",2017-01-23,"[['Zhang', 'Haifeng', ''], ['Zhang', 'Weinan', ''], ['Rong', 'Yifei', ''], ['Ren', 'Kan', ''], ['Li', 'Wenxin', ''], ['Wang', 'Jun', '']]","['Risk-aware Bidding Strategy', 'Value at Risk', 'Demand-SidePlatform', 'Real-Time Bidding', 'Display Advertising']"
2328,2208.14747,Filippo Carnovalini,"Filippo Carnovalini, Antonio Rod\`a, Nicholas Harley, Steven T. Homer
  and Geraint A. Wiggins","A New Corpus for Computational Music Research and A Novel Method for
  Musical Structure Analysis",,"In Audio Mostly 2021 (AM '21), September 1-3, 2021,
  virtual/Trento, Italy. ACM, New York, NY, USA, 4 pages",10.1145/3478384.3478402,,cs.SD cs.MM eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Computational models of music, while providing good descriptions of melodic
development, still cannot fully grasp the general structure comprised of
repetitions, transpositions, and reuse of melodic material.
  We present a corpus of strongly structured baroque allemandes, and describe a
top-down approach to abstract the shared structure of their musical content
using tree representations produced from pairwise differences between the
Schenkerian-inspired analyses of each piece, thereby providing a rich
hierarchical description of the corpus.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2022 09:49:10 GMT'}]",2022-09-01,"[['Carnovalini', 'Filippo', ''], ['Rodà', 'Antonio', ''], ['Harley', 'Nicholas', ''], ['Homer', 'Steven T.', ''], ['Wiggins', 'Geraint A.', '']]","['Computational Musicology', 'Musical Structure', 'Music Corpus', 'MusicGeneration']"
2329,1912.08320,R.Stuart Geiger,"R. Stuart Geiger, Kevin Yu, Yanlai Yang, Mindy Dai, Jie Qiu, Rebekah
  Tang, Jenny Huang","Garbage In, Garbage Out? Do Machine Learning Application Papers in
  Social Computing Report Where Human-Labeled Training Data Comes From?","18 pages, includes appendix",Proc ACM FAT* 2020,10.1145/3351095.3372862,,cs.CY cs.CL cs.DL cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Many machine learning projects for new application areas involve teams of
humans who label data for a particular purpose, from hiring crowdworkers to the
paper's authors labeling the data themselves. Such a task is quite similar to
(or a form of) structured content analysis, which is a longstanding methodology
in the social sciences and humanities, with many established best practices. In
this paper, we investigate to what extent a sample of machine learning
application papers in social computing --- specifically papers from ArXiv and
traditional publications performing an ML classification task on Twitter data
--- give specific details about whether such best practices were followed. Our
team conducted multiple rounds of structured content analysis of each paper,
making determinations such as: Does the paper report who the labelers were,
what their qualifications were, whether they independently labeled the same
items, whether inter-rater reliability metrics were disclosed, what level of
training and/or instructions were given to labelers, whether compensation for
crowdworkers is disclosed, and if the training data is publicly available. We
find a wide divergence in whether such practices were followed and documented.
Much of machine learning research and education focuses on what is done once a
""gold standard"" of training data is available, but we discuss issues around the
equally-important aspect of whether such data is reliable in the first place.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2019 23:49:19 GMT'}]",2019-12-19,"[['Geiger', 'R. Stuart', ''], ['Yu', 'Kevin', ''], ['Yang', 'Yanlai', ''], ['Dai', 'Mindy', ''], ['Qiu', 'Jie', ''], ['Tang', 'Rebekah', ''], ['Huang', 'Jenny', '']]","['machine learning', 'data labeling', 'human annotation', 'content analysis', 'training data', 'research integrity', 'meta-research']"
2330,1805.11611,Miguel Angel Alvarez,"Miguel A. \'Alvarez-Carmona, Marc Franco-Salvador, Esa\'u
  Villatoro-Tello, Manuel Montes-y-G\'omez, Paolo Rosso and Luis
  Villase\~nor-Pineda","Semantically-informed distance and similarity measures for paraphrase
  plagiarism identification",,"Journal of Intelligent & Fuzzy Systems, vol. 34, no. 5, pp.
  2983-2990, 2018",10.3233/JIFS-169483,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Paraphrase plagiarism identification represents a very complex task given
that plagiarized texts are intentionally modified through several rewording
techniques. Accordingly, this paper introduces two new measures for evaluating
the relatedness of two given texts: a semantically-informed similarity measure
and a semantically-informed edit distance. Both measures are able to extract
semantic information from either an external resource or a distributed
representation of words, resulting in informative features for training a
supervised classifier for detecting paraphrase plagiarism. Obtained results
indicate that the proposed metrics are consistently good in detecting different
types of paraphrase plagiarism. In addition, results are very competitive
against state-of-the art methods having the advantage of representing a much
more simple but equally effective solution.
","[{'version': 'v1', 'created': 'Tue, 29 May 2018 17:54:52 GMT'}]",2018-05-31,"[['Álvarez-Carmona', 'Miguel A.', ''], ['Franco-Salvador', 'Marc', ''], ['Villatoro-Tello', 'Esaú', ''], ['Montes-y-Gómez', 'Manuel', ''], ['Rosso', 'Paolo', ''], ['Villaseñor-Pineda', 'Luis', '']]","['Plagiarism identification', 'Paraphrase Plagiarism', 'Semantic similarity', 'Editdistance', 'Word2vec representation']"
2331,1901.05560,Mingyang Hu,"Randell Cotta, Mingyang Hu, Dan Jiang and Peizhou Liao","Off-Policy Evaluation of Probabilistic Identity Data in Lookalike
  Modeling",Accepted by WSDM 2019,,10.1145/3289600.3291033,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We evaluate the impact of probabilistically-constructed digital identity data
collected from Sep. to Dec. 2017 (approx.), in the context of
Lookalike-targeted campaigns. The backbone of this study is a large set of
probabilistically-constructed ""identities"", represented as small bags of
cookies and mobile ad identifiers with associated metadata, that are likely all
owned by the same underlying user. The identity data allows to generate
""identity-based"", rather than ""identifier-based"", user models, giving a fuller
picture of the interests of the users underlying the identifiers. We employ
off-policy techniques to evaluate the potential of identity-powered lookalike
models without incurring the risk of allowing untested models to direct large
amounts of ad spend or the large cost of performing A/B tests. We add to
historical work on off-policy evaluation by noting a significant type of
""finite-sample bias"" that occurs for studies combining modestly-sized datasets
and evaluation metrics involving rare events (e.g., conversions). We illustrate
this bias using a simulation study that later informs the handling of inverse
propensity weights in our analyses on real data. We demonstrate significant
lift in identity-powered lookalikes versus an identity-ignorant baseline: on
average ~70% lift in conversion rate. This rises to factors of ~(4-32)x for
identifiers having little data themselves, but that can be inferred to belong
to users with substantial data to aggregate across identifiers. This implies
that identity-powered user modeling is especially important in the context of
identifiers having very short lifespans (i.e., frequently churned cookies). Our
work motivates and informs the use of probabilistically-constructed identities
in marketing. It also deepens the canon of examples in which off-policy
learning has been employed to evaluate the complex systems of the internet
economy.
","[{'version': 'v1', 'created': 'Fri, 4 Jan 2019 02:56:36 GMT'}]",2019-03-27,"[['Cotta', 'Randell', ''], ['Hu', 'Mingyang', ''], ['Jiang', 'Dan', ''], ['Liao', 'Peizhou', '']]","['ACM proceedings', 'Marketing and Advertising', 'Identity Management', 'Entity Resolution', 'User Modeling and Recommendation Systems', 'Off-Policy Evaluation']"
2332,1102.2250,Osman Yagan,Osman Yagan and Armand M. Makowski,"Modeling the pairwise key distribution scheme in the presence of
  unreliable links","Submitted to IEEE Transactions on Information Theory, October 2010","IEEE Transactions on Information Theory, Volume: 59, Issue: 3,
  Pages: 1740-1760, March 2013",10.1109/TIT.2012.2219578,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the secure connectivity of wireless sensor networks under the
pairwise key distribution scheme of Chan et al.. Unlike recent work which was
carried out under the assumption of full visibility, here we assume a
(simplified) communication model where unreliable wireless links are
represented as on/off channels. We present conditions on how to scale the model
parameters so that the network i) has no secure node which is isolated and ii)
is securely connected, both with high probability when the number of sensor
nodes becomes large. The results are given in the form of zero-one laws, and
exhibit significant differences with corresponding results in the full
visibility case. Through simulations these zero-one laws are shown to be valid
also under a more realistic communication model, i.e., the disk model.
","[{'version': 'v1', 'created': 'Thu, 10 Feb 2011 22:15:56 GMT'}]",2013-04-03,"[['Yagan', 'Osman', ''], ['Makowski', 'Armand M.', '']]","['Wireless sensor networks', 'Security', 'Key predistribution', 'Random graphs', 'Connectivity']"
2333,1512.08150,Faisal Orakzai Faisal Orakzai,"Faisal Orakzai, Thomas Devogele, Toon Calders",Towards Distributed Convoy Pattern Mining,"SIGSPATIAL'15 November 03-06, 2015, Bellevue, WA, USA",,10.1145/2820783.2820840,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mining movement data to reveal interesting behavioral patterns has gained
attention in recent years. One such pattern is the convoy pattern which
consists of at least m objects moving together for at least k consecutive time
instants where m and k are user-defined parameters. Existing algorithms for
detecting convoy patterns, however do not scale to real-life dataset sizes.
Therefore a distributed algorithm for convoy mining is inevitable. In this
paper, we discuss the problem of convoy mining and analyze different data
partitioning strategies to pave the way for a generic distributed convoy
pattern mining algorithm.
","[{'version': 'v1', 'created': 'Sat, 26 Dec 2015 22:10:05 GMT'}]",2015-12-29,"[['Orakzai', 'Faisal', ''], ['Devogele', 'Thomas', ''], ['Calders', 'Toon', '']]","['Spatial', 'temporal', 'movement patterns', 'big data', 'data mining', 'distributed processing', 'parallel algorithms']"
2334,1612.05395,Jacopo Pantaleoni,Jacopo Pantaleoni,Charted Metropolis Light Transport,"15 pages, 6 figures - to be published in the SIGGRAPH 2017
  proceedings",,10.1145/3072959.3073677,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this manuscript, inspired by a simpler reformulation of primary sample
space Metropolis light transport, we derive a novel family of general Markov
chain Monte Carlo algorithms called charted Metropolis-Hastings, that
introduces the notion of sampling charts to extend a given sampling domain and
making it easier to sample the desired target distribution and escape from
local maxima through coordinate changes. We further apply the novel algorithms
to light transport simulation, obtaining a new type of algorithm called charted
Metropolis light transport, that can be seen as a bridge between primary sample
space and path space Metropolis light transport. The new algorithms require to
provide only right inverses of the sampling functions, a property that we
believe crucial to make them practical in the context of light transport
simulation. We further propose a method to integrate density estimation into
this framework through a novel scheme that uses it as an independence sampler.
","[{'version': 'v1', 'created': 'Fri, 16 Dec 2016 08:41:06 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Dec 2016 09:51:25 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Dec 2016 16:58:16 GMT'}, {'version': 'v4', 'created': 'Mon, 30 Jan 2017 20:02:11 GMT'}, {'version': 'v5', 'created': 'Sun, 5 Feb 2017 20:39:49 GMT'}, {'version': 'v6', 'created': 'Wed, 26 Apr 2017 17:09:08 GMT'}, {'version': 'v7', 'created': 'Fri, 28 Apr 2017 06:43:30 GMT'}]",2017-05-01,"[['Pantaleoni', 'Jacopo', '']]","['global illumination', 'light transport simulation', 'Markov Chain Monte Carlo']"
2335,1109.1144,Venkatesan Sundaram,"M. Venkatesan, Arunkumar Thangavelu, P. Prabhavathy","Event Centric Modeling Approach in Colocation Pattern Snalysis from
  Spatial Data",9 pages,,10.5121/ijdms.2011.3311,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spatial co-location patterns are the subsets of Boolean spatial features
whose instances are often located in close geographic proximity. Co-location
rules can be identified by spatial statistics or data mining approaches. In
data mining method, Association rule-based approaches can be used which are
further divided into transaction-based approaches and distance-based
approaches. Transaction-based approaches focus on defining transactions over
space so that an Apriori algorithm can be used. The natural notion of
transactions is absent in spatial data sets which are embedded in continuous
geographic space. A new distance -based approach is developed to mine
co-location patterns from spatial data by using the concept of proximity
neighborhood. A new interest measure, a participation index, is used for
spatial co-location patterns as it possesses an anti-monotone property. An
algorithm to discover co-location patterns are designed which generates
candidate locations and their table instances. Finally the co-location rules
are generated to identify the patterns.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2011 11:12:42 GMT'}]",2011-09-07,"[['Venkatesan', 'M.', ''], ['Thangavelu', 'Arunkumar', ''], ['Prabhavathy', 'P.', '']]","['Co-location Pattern', 'Association Rule', 'Spatial Data', 'Participation Index']"
2336,1903.09587,Connor McCurley,"Connor H. McCurley, James Bocinsky, Alina Zare",Comparison of Hand-held WEMI Target Detection Algorithms,"SPIE Defense + Commercial Sensing, 20 pages, 8 figures","Proc. SPIE 11012, Detection and Sensing of Mines, Explosive
  Objects, and Obscured Targets XXIV, 110120U (10 May 2019)",10.1117/12.2519454,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wide-band Electromagnetic Induction Sensors (WEMI) have been used for a
number of years in subsurface detection of explosive hazards. While WEMI
sensors have proven effective at localizing objects exhibiting large magnetic
responses, detecting objects lacking or containing very low amounts of
conductive materials can be challenging. In this paper, we compare a number of
target detection algorithms in the literature in terms of detection
performance. In the comparison, methods are tested on two real-world data sets:
one containing relatively low amounts of ground noise pollution, and the other
demonstrating highly-magnetic soil interference. Results are quantitatively
evaluated through receiver-operator characteristic (ROC) curves and are used to
highlight the strengths and weaknesses of the compared approaches in hand-held
explosive hazard detection.
","[{'version': 'v1', 'created': 'Fri, 22 Mar 2019 16:28:35 GMT'}]",2019-05-22,"[['McCurley', 'Connor H.', ''], ['Bocinsky', 'James', ''], ['Zare', 'Alina', '']]","['Hazard detection', 'WEMI', 'ACE', 'SMF', 'JOMP', 'Multiple-instance', 'Mean-shift']"
2337,1903.12470,Jayant Gupchup A,"Jayant Gupchup, Yasaman Hosseinkashi, Pavel Dmitriev, Daniel
  Schneider, Ross Cutler, Andrei Jefremov, Martin Ellis",Trustworthy Experimentation Under Telemetry Loss,"Proceedings of the 27th ACM International Conference on Information
  and Knowledge Management, October 2018",,10.1145/3269206.3271747,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Failure to accurately measure the outcomes of an experiment can lead to bias
and incorrect conclusions. Online controlled experiments (aka AB tests) are
increasingly being used to make decisions to improve websites as well as mobile
and desktop applications. We argue that loss of telemetry data (during upload
or post-processing) can skew the results of experiments, leading to loss of
statistical power and inaccurate or erroneous conclusions. By systematically
investigating the causes of telemetry loss, we argue that it is not practical
to entirely eliminate it. Consequently, experimentation systems need to be
robust to its effects. Furthermore, we note that it is nontrivial to measure
the absolute level of telemetry loss in an experimentation system. In this
paper, we take a top-down approach towards solving this problem. We motivate
the impact of loss qualitatively using experiments in real applications
deployed at scale, and formalize the problem by presenting a theoretical
breakdown of the bias introduced by loss. Based on this foundation, we present
a general framework for quantitatively evaluating the impact of telemetry loss,
and present two solutions to measure the absolute levels of loss. This
framework is used by well-known applications at Microsoft, with millions of
users and billions of sessions. These general principles can be adopted by any
application to improve the overall trustworthiness of experimentation and
data-driven decision making.
","[{'version': 'v1', 'created': 'Tue, 22 Jan 2019 01:36:01 GMT'}]",2019-04-01,"[['Gupchup', 'Jayant', ''], ['Hosseinkashi', 'Yasaman', ''], ['Dmitriev', 'Pavel', ''], ['Schneider', 'Daniel', ''], ['Cutler', 'Ross', ''], ['Jefremov', 'Andrei', ''], ['Ellis', 'Martin', '']]","['Online controlled experiments', 'AB testing', 'client experimentation', 'telemetry loss', 'data loss', 'experimentation trustworthiness']"
2338,1312.4507,Alejandro Diaz-Caro,"Alejandro D\'iaz-Caro (LIPN), Giulio Manzonetto (LIPN), Michele Pagani
  (LIPN)",Call-by-value non-determinism in a linear logic type discipline,,Logical Foundations of Computer Science 7734 (2013) 164-178,10.1007/978-3-642-35722-0_12,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the call-by-value lambda-calculus extended with a may-convergent
non-deterministic choice and a must-convergent parallel composition. Inspired
by recent works on the relational semantics of linear logic and non-idempotent
intersection types, we endow this calculus with a type system based on the
so-called Girard's second translation of intuitionistic logic into linear
logic. We prove that a term is typable if and only if it is converging, and
that its typing tree carries enough information to give a bound on the length
of its lazy call-by-value reduction. Moreover, when the typing tree is minimal,
such a bound becomes the exact length of the reduction.
","[{'version': 'v1', 'created': 'Mon, 16 Dec 2013 20:29:41 GMT'}]",2014-01-08,"[['Díaz-Caro', 'Alejandro', '', 'LIPN'], ['Manzonetto', 'Giulio', '', 'LIPN'], ['Pagani', 'Michele', '', 'LIPN']]","['λ-calculus', 'linear logic', 'non-determinism', 'call-by-value']"
2339,1812.11622,Abbas Ganji,"Abbas Ganji, Mania Orand and David W. McDonald","Ease on Down the Code: Complex Collaborative Qualitative Coding
  Simplified with 'Code Wizard'",,"Proceedings of the ACM on Human-Computer Interaction (CSCW),
  Volume 2 Issue CSCW, Article No. 132, November 2018",,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the design and development of a preliminary qualitative
coding tool as well as a method to improve the process of achieving inter-coder
reliability (ICR) in small teams. Software applications that support
qualitative coding do not sufficiently assist collaboration among coders and
overlook some fundamental issues related to ICR. We propose a new dimension of
collaborative coding called ""coders' certainty"" and demonstrate its ability to
illustrate valuable code disagreements that are missing from existing
approaches. Through a case study, we describe the utility of our tool, Code
Wizard, and how it helped a group of researchers effectively collaborate to
code naturalistic observation data. We report the valuable lessons we learned
from the development of our tool and method: (1) identifying coders' certainty
constitutes an important part of determining the quality of data analysis and
facilitates identifying overlapping and ambiguous codes, (2) making the details
of coding process visible helps streamline the coding process and leads to a
sense of ownership of the research results, and (3) there is valuable
information hidden in coding disagreements that can be leveraged for improving
the process of data analysis.
","[{'version': 'v1', 'created': 'Sun, 30 Dec 2018 22:29:41 GMT'}]",2019-01-01,"[['Ganji', 'Abbas', ''], ['Orand', 'Mania', ''], ['McDonald', 'David W.', '']]","['Qualitative coding', 'collaborative coding', 'qualitative coding software application', 'qualitative code disagreements']"
2340,2103.09224,Corrado Monti,"Arthur Capozzi, Gianmarco De Francisci Morales, Yelena Mejova, Corrado
  Monti, Andr\'e Panisson, Daniela Paolotti","Clandestino or Rifugiato? Anti-immigration Facebook Ad Targeting in
  Italy",Published at CHI21,"CHI Conference on Human Factors in Computing Systems (CHI '21),
  May 8-13, 2021, Yokohama, Japan. ACM",10.1145/3411764.3445082,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Monitoring advertising around controversial issues is an important step in
ensuring accountability and transparency of political processes. To that end,
we use the Facebook Ads Library to collect 2312 migration-related advertising
campaigns in Italy over one year. Our pro- and anti-immigration classifier
(F1=0.85) reveals a partisan divide among the major Italian political parties,
with anti-immigration ads accounting for nearly 15M impressions. Although
composing 47.6% of all migration-related ads, anti-immigration ones receive
65.2% of impressions. We estimate that about two thirds of all captured
campaigns use some kind of demographic targeting by location, gender, or age.
We find sharp divides by age and gender: for instance, anti-immigration ads
from major parties are 17% more likely to be seen by a male user than a female.
Unlike pro-migration parties, we find that anti-immigration ones reach a
similar demographic to their own voters. However their audience change with
topic: an ad from anti-immigration parties is 24% more likely to be seen by a
male user when the ad speaks about migration, than if it does not. Furthermore,
the viewership of such campaigns tends to follow the volume of mainstream news
around immigration, supporting the theory that political advertisers try to
""ride the wave"" of current news. We conclude with policy implications for
political communication: since the Facebook Ads Library does not allow to
distinguish between advertisers intentions and algorithmic targeting, we argue
that more details should be shared by platforms regarding the targeting
configuration of socio-political campaigns.
","[{'version': 'v1', 'created': 'Tue, 16 Mar 2021 17:52:35 GMT'}]",2021-03-17,"[['Capozzi', 'Arthur', ''], ['Morales', 'Gianmarco De Francisci', ''], ['Mejova', 'Yelena', ''], ['Monti', 'Corrado', ''], ['Panisson', 'André', ''], ['Paolotti', 'Daniela', '']]","['politics', 'immigration', 'advertising', 'targeting', 'Italy']"
2341,1802.08345,Xiao Ma,"Xiao Ma, Megan Cackett, Leslie Park, Eric Chien, and Mor Naaman",Web-Based VR Experiments Powered by the Crowd,The Web Conference 2018 (WWW 2018); update citation format,Proceedings of the WWW 2018,10.1145/3178876.3186034,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  We build on the increasing availability of Virtual Reality (VR) devices and
Web technologies to conduct behavioral experiments in VR using crowdsourcing
techniques. A new recruiting and validation method allows us to create a panel
of eligible experiment participants recruited from Amazon Mechanical Turk.
Using this panel, we ran three different crowdsourced VR experiments, each
reproducing one of three VR illusions: place illusion, embodiment illusion, and
plausibility illusion. Our experience and worker feedback on these experiments
show that conducting Web-based VR experiments using crowdsourcing is already
feasible, though some challenges---including scale---remain. Such crowdsourced
VR experiments on the Web have the potential to finally support replicable VR
experiments with diverse populations at a low cost.
","[{'version': 'v1', 'created': 'Thu, 22 Feb 2018 23:13:54 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Feb 2018 15:35:40 GMT'}]",2019-05-15,"[['Ma', 'Xiao', ''], ['Cackett', 'Megan', ''], ['Park', 'Leslie', ''], ['Chien', 'Eric', ''], ['Naaman', 'Mor', '']]","['virtual reality', 'crowdsourcing', 'experiments']"
2342,1404.1685,Guido Governatori,Guido Governatori,Thou Shalt is not You Will,,"Fifteenth International Conference on Artificial Intelligence and
  Law (ICAIL 2015), pp. 63-68",10.1145/2746090.2746105,NICTA Technical Report 8026,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we discuss some reasons why temporal logic might not be
suitable to model real life norms. To show this, we present a novel deontic
logic contrary-to-duty/derived permission paradox based on the interaction of
obligations, permissions and contrary-to-duty obligations. The paradox is
inspired by real life norms.
","[{'version': 'v1', 'created': 'Mon, 7 Apr 2014 08:11:10 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Jun 2014 07:32:27 GMT'}, {'version': 'v3', 'created': 'Sun, 25 Jan 2015 15:14:33 GMT'}]",2022-09-13,"[['Governatori', 'Guido', '']]","['Linear Temporal Logic', 'Compliance', 'Deontic Logic', 'Deontic Paradox']"
2343,1804.09449,Vahan Mkrtchyan,"Giuseppe Mazzuoccolo, Vahan Mkrtchyan",Normal edge-colorings of cubic graphs,"17 pages, 6 figures",,10.1002/jgt.22507,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A normal $k$-edge-coloring of a cubic graph is an edge-coloring with $k$
colors having the additional property that when looking at the set of colors
assigned to any edge $e$ and the four edges adjacent it, we have either exactly
five distinct colors or exactly three distinct colors. We denote by
$\chi'_{N}(G)$ the smallest $k$, for which $G$ admits a normal
$k$-edge-coloring. Normal $k$-edge-colorings were introduced by Jaeger in order
to study his well-known Petersen Coloring Conjecture. More precisely, it is
known that proving $\chi'_{N}(G)\leq 5$ for every bridgeless cubic graph is
equivalent to proving Petersen Coloring Conjecture and then, among others,
Cycle Double Cover Conjecture and Berge-Fulkerson Conjecture. Considering the
larger class of all simple cubic graphs (not necessarily bridgeless), some
interesting questions naturally arise. For instance, there exist simple cubic
graphs, not bridgeless, with $\chi'_{N}(G)=7$. On the other hand, the known
best general upper bound for $\chi'_{N}(G)$ was $9$. Here, we improve it by
proving that $\chi'_{N}(G)\leq7$ for any simple cubic graph $G$, which is best
possible. We obtain this result by proving the existence of specific no-where
zero $\mathbb{Z}_2^2$-flows in $4$-edge-connected graphs.
","[{'version': 'v1', 'created': 'Wed, 25 Apr 2018 09:30:19 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Mar 2019 16:14:39 GMT'}]",2021-10-05,"[['Mazzuoccolo', 'Giuseppe', ''], ['Mkrtchyan', 'Vahan', '']]","['Cubic graph', 'normal edge-coloring', 'Petersen coloring conjecture', 'nowhere zeroflow']"
2344,1904.00690,Abdelrahim Ahmad,"Abdelrahim Kasem Ahmad, Assef Jafar and Kadan Aljoumaa","Customer churn prediction in telecom using machine learning and social
  network analysis in big data platform","24 pages, 14 figures. PDF https://rdcu.be/budKg",Journal of Big Data 2019 6:28,10.1186/s40537-019-0191-6,,cs.CY cs.DC cs.LG cs.SI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Customer churn is a major problem and one of the most important concerns for
large companies. Due to the direct effect on the revenues of the companies,
especially in the telecom field, companies are seeking to develop means to
predict potential customer to churn. Therefore, finding factors that increase
customer churn is important to take necessary actions to reduce this churn. The
main contribution of our work is to develop a churn prediction model which
assists telecom operators to predict customers who are most likely subject to
churn. The model developed in this work uses machine learning techniques on big
data platform and builds a new way of features' engineering and selection. In
order to measure the performance of the model, the Area Under Curve (AUC)
standard measure is adopted, and the AUC value obtained is 93.3%. Another main
contribution is to use customer social network in the prediction model by
extracting Social Network Analysis (SNA) features. The use of SNA enhanced the
performance of the model from 84 to 93.3% against AUC standard. The model was
prepared and tested through Spark environment by working on a large dataset
created by transforming big raw data provided by SyriaTel telecom company. The
dataset contained all customers' information over 9 months, and was used to
train, test, and evaluate the system at SyriaTel. The model experimented four
algorithms: Decision Tree, Random Forest, Gradient Boosted Machine Tree ""GBM""
and Extreme Gradient Boosting ""XGBOOST"". However, the best results were
obtained by applying XGBOOST algorithm. This algorithm was used for
classification in this churn predictive model.
","[{'version': 'v1', 'created': 'Mon, 1 Apr 2019 10:30:04 GMT'}]",2019-04-04,"[['Ahmad', 'Abdelrahim Kasem', ''], ['Jafar', 'Assef', ''], ['Aljoumaa', 'Kadan', '']]","['Customer churn prediction', 'Churn in telecom', 'Machine learning', 'Feature selection', 'Classification', 'Mobile Social Network Analysis', 'Big data']"
2345,1507.05133,Nikos Arechiga PhD,"Nikos Arechiga, James Kapinski, Jyotirmoy Deshmukh, Andre Platzer,
  Bruce Krogh",Forward Invariant Cuts to Simplify Proofs of Safety,Extended version of EMSOFT paper,,10.1109/EMSOFT.2015.7318278,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of deductive techniques, such as theorem provers, has several
advantages in safety verification of hybrid sys- tems; however,
state-of-the-art theorem provers require ex- tensive manual intervention.
Furthermore, there is often a gap between the type of assistance that a theorem
prover requires to make progress on a proof task and the assis- tance that a
system designer is able to provide. This paper presents an extension to
KeYmaera, a deductive verification tool for differential dynamic logic; the new
technique allows local reasoning using system designer intuition about per-
formance within particular modes as part of a proof task. Our approach allows
the theorem prover to leverage for- ward invariants, discovered using numerical
techniques, as part of a proof of safety. We introduce a new inference rule
into the proof calculus of KeYmaera, the forward invariant cut rule, and we
present a methodology to discover useful forward invariants, which are then
used with the new cut rule to complete verification tasks. We demonstrate how
our new approach can be used to complete verification tasks that lie out of the
reach of existing deductive approaches us- ing several examples, including one
involving an automotive powertrain control system.
","[{'version': 'v1', 'created': 'Fri, 17 Jul 2015 23:49:22 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Aug 2015 23:00:10 GMT'}]",2021-09-08,"[['Arechiga', 'Nikos', ''], ['Kapinski', 'James', ''], ['Deshmukh', 'Jyotirmoy', ''], ['Platzer', 'Andre', ''], ['Krogh', 'Bruce', '']]","['hybrid systems', 'formal verification', 'theorem provers']"
2346,2210.11745,Junaid Akram,"Junaid Akram, Awais Akram, Rutvij H. Jhaveri, Mamoun Alazab, Haoran
  Chi","BC-IoDT: Blockchain-based Framework for Authentication in Internet of
  Drone Things","6 pages, 3 figures, ACM MobiCom Workshop on Drone Assisted Wireless
  Communications for 5G and Beyond","2022 ACM MobiCom Workshop on Drone Assisted Wireless
  Communications for 5G and Beyond",10.1145/3555661.3560874,,cs.CR cs.DC,http://creativecommons.org/licenses/by/4.0/,"  We leverage blockchain technology for drone node authentication in internet
of drone things (IoDT). During the authentication procedure, the credentials of
drone nodes are examined to remove malicious nodes from the system. In IoDT,
drones are responsible for gathering data and transmitting it to cluster heads
(CHs) for further processing. The CH collects and organizes data. Due to
computational load, their energy levels rapidly deplete. To overcome this
problem, we present a low-energy adaptive clustering hierarchy (R2D) protocol
based on distance, degree, and residual energy. R2D is used to replace CHs with
normal nodes based on the biggest residual energy, the degree, and the shortest
distance from BS. The cost of keeping a big volume of data on the blockchain is
high. We employ the Interplanetary File System (IPFS), to address this issue.
Moreover, IPFS protects user data using the industry-standard encryption
technique AES-128. This standard compares well to other current encryption
methods. Using a consensus mechanism based on proof of work requires a high
amount of computing resources for transaction verification. The suggested
approach leverages a consensus mechanism known as proof of authority (PoA) to
address this problem . The results of the simulations indicate that the
suggested system model functions effectively and efficiently. A formal security
analysis is conducted to assess the smart contract's resistance to attacks.
","[{'version': 'v1', 'created': 'Fri, 21 Oct 2022 05:48:44 GMT'}]",2022-10-24,"[['Akram', 'Junaid', ''], ['Akram', 'Awais', ''], ['Jhaveri', 'Rutvij H.', ''], ['Alazab', 'Mamoun', ''], ['Chi', 'Haoran', '']]","['IoDT', 'Access Control', 'security', 'consensus', 'Cluster Head']"
2347,1006.3369,Secretary Aircc Journal,"Abhishek Samanta and Dripto Bakshi (Jadavpur University, India)","Fault Tolerant Wireless Sensor MAC Protocol for Efficient Collision
  Avoidance",14 pages,"International journal on applications of graph theory in wireless
  ad hoc networks and sensor networks 2.2 (2010) 46-59",10.5121/jgraphoc.2010.2205,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In sensor networks communication by broadcast methods involves many hazards,
especially collision. Several MAC layer protocols have been proposed to resolve
the problem of collision namely ARBP, where the best achieved success rate is
90%. We hereby propose a MAC protocol which achieves a greater success rate
(Success rate is defined as the percentage of delivered packets at the source
reaching the destination successfully) by reducing the number of collisions,
but by trading off the average propagation delay of transmission. Our proposed
protocols are also shown to be more energy efficient in terms of energy
dissipation per message delivery, compared to the currently existing protocol.
","[{'version': 'v1', 'created': 'Thu, 17 Jun 2010 04:55:55 GMT'}]",2010-07-15,"[['Samanta', 'Abhishek', '', 'Jadavpur University, India'], ['Bakshi', 'Dripto', '', 'Jadavpur University, India']]","['Wireless Sensor Networks', 'Energy efficient', 'Data propagation', 'Single path', 'Multi path', 'Collision avoidance', 'Success rate']"
2348,0804.0556,Gery Casiez,"G\'ery Casiez (LIFL, INRIA Lille - Nord Europe), Daniel Vogel, Qing
  Pan (LIFL, INRIA Lille - Nord Europe), Christophe Chaillou (INRIA Lille -
  Nord Europe)","RubberEdge: Reducing Clutching by Combining Position and Rate Control
  with Elastic Feedback",10 pages,"Dans Proceedings of the 20th annual ACM symposium on User
  interface software and technology - Symposium on User Interface Software and
  Technology, Lille : France (2007)",10.1145/1294211.1294234,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Position control devices enable precise selection, but significant clutching
degrades performance. Clutching can be reduced with high control-display gain
or pointer acceleration, but there are human and device limits. Elastic rate
control eliminates clutching completely, but can make precise selection
difficult. We show that hybrid position-rate control can outperform position
control by 20% when there is significant clutching, even when using pointer
acceleration. Unlike previous work, our RubberEdge technique eliminates
trajectory and velocity discontinuities. We derive predictive models for
position control with clutching and hybrid control, and present a prototype
RubberEdge position-rate control device including initial user feedback.
","[{'version': 'v1', 'created': 'Thu, 3 Apr 2008 13:40:02 GMT'}]",2008-12-18,"[['Casiez', 'Géry', '', 'LIFL, INRIA Lille - Nord Europe'], ['Vogel', 'Daniel', '', 'LIFL, INRIA Lille - Nord Europe'], ['Pan', 'Qing', '', 'LIFL, INRIA Lille - Nord Europe'], ['Chaillou', 'Christophe', '', 'INRIA Lille -\n  Nord Europe']]","['hybrid', 'pointing', 'clutching', 'mobile', 'elastic']"
2349,1003.3326,Secretary Aircc Journal,"Abhishek Sharma (1) and Hao Shi (1) ((1) Victoria University,
  Australia)",Innovative Rated-Resource Peer-to-Peer Network,"8 Pages, IJCNC Journal 2010","International journal on applications of graph theory in wireless
  ad hoc networks and sensor networks 2.2 (2010) 89-96",10.5121/ijcnc.2010.2206,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Peer-to-Peer (P2P) networks provide a significant solution for file sharing
among peers connected to Internet. It is fast and completely decentralised
system with robustness. But due to absence of a server documents on a P2P
network are not rated which makes it difficult for a peer to obtain precise
information in result of a query. In past, some researchers tried to attach
ratings to the peers itself but it was complex and less effective. In this
paper, a novel P2P architecture is proposed which attaches ratings to the
uploaded document directly. These ratings then become as <Rating> element in
its XML advertisement which has several child elements for information
classification. The attached <Rating> element is extracted from the
advertisement in real time and the document is then sorted accordingly.
Therefore, the information can be easily sorted based on a request by a peer
according to the relevance of matter. The information regarding relevance is
obtained by the peer issuing the query. This research leads to a smart P2P
model, the Rated-Resource P2P network (R2P2P).
","[{'version': 'v1', 'created': 'Wed, 17 Mar 2010 08:52:02 GMT'}]",2010-07-15,"[['Sharma', 'Abhishek', ''], ['Shi', 'Hao', '']]","['P2P', 'rated-resource', 'XML', 'JXTA', 'R2P2P', 'LDAP', 'vuCRN']"
2350,2003.13827,Juan I. Forcen,"J.I.Forcen, Miguel Pagola, Edurne Barrenechea and Humberto Bustince",Co-occurrence of deep convolutional features for image search,,,10.1016/j.imavis.2020.103909,,cs.CV cs.LG eess.IV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Image search can be tackled using deep features from pre-trained
Convolutional Neural Networks (CNN). The feature map from the last
convolutional layer of a CNN encodes descriptive information from which a
discriminative global descriptor can be obtained. We propose a new
representation of co-occurrences from deep convolutional features to extract
additional relevant information from this last convolutional layer. Combining
this co-occurrence map with the feature map, we achieve an improved image
representation. We present two different methods to get the co-occurrence
representation, the first one based on direct aggregation of activations, and
the second one, based on a trainable co-occurrence representation. The image
descriptors derived from our methodology improve the performance in very
well-known image retrieval datasets as we prove in the experiments.
","[{'version': 'v1', 'created': 'Mon, 30 Mar 2020 21:27:22 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Jun 2021 16:47:42 GMT'}]",2021-06-11,"[['Forcen', 'J. I.', ''], ['Pagola', 'Miguel', ''], ['Barrenechea', 'Edurne', ''], ['Bustince', 'Humberto', '']]","['co-occurrence', 'image retrieval', 'feature aggregation', 'pooling']"
2351,1707.03148,Seema Hegde B,"Seema B Hegde, Sathish Babu, Pallapa Venkatram","An Opportunistic AODV Routing Scheme : A Cognitive Mobile Agents
  Approach","21 pages, 16 figures, International Journal of Ad hoc, Sensor &
  Ubiquitous Computing",,10.5121/ijasuc.2017.8301,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Manets Dynamics and Robustness are the key features of the nodes and are
governed by several routing protocols such as AODV, DSR and so on. However in
the network the growing resource demand leads to resource scarcity. The Node
Mobility often leads to the link breakages and high routing overhead decreasing
the stability and reliability of the network connectivity. In this context, the
paper proposes a novel opportunistic AODV routing scheme which implements a
cognitive agent based intelligent technique to set up a stable connectivity
over the Manet. The Scheme computes the routing metric (rf) based on the
collaboration sensitivity levels of the nodes obtained based through the
knowledge based decision. This Routing Metric is subsequently used to set up
the stable path for network connectivity. Thus minimizes the route overhead and
increases the stability of the path. The Performance evaluation is conducted in
comparison with the AODV and sleep AODV routing protocol and validated.
","[{'version': 'v1', 'created': 'Tue, 11 Jul 2017 06:55:48 GMT'}]",2017-07-12,"[['Hegde', 'Seema B', ''], ['Babu', 'Sathish', ''], ['Venkatram', 'Pallapa', '']]","['Mobile Adhoc Network’s', 'AODV', 'Opportunistic network', 'Cognitive agents', 'Routing factor', 'Sleep AODV   1']"
2352,1807.06182,Xicheng Yin,"Xicheng Yin, Hongwei Wang, Pei Yin, Hengmin Zhu","Agent-based opinion formation modeling in social network: a perspective
  of social psychology","29 pages,7 figures and 4 tables, accepted by Informs Annual Meeting
  2018",,10.1016/j.physa.2019.121786,,cs.SI physics.soc-ph,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Most previous works on opinion modeling lack the simultaneous study of
individual mental activity and group behavior. This paper is motivated to
propose an agent-based online opinion formation model based on attitude change
theory, group behavior theory and evolutionary game theory in the perspective
of sociology and psychology. In this model, there are three factors influencing
the persuasion process, including credibility of the leaders, characteristic of
the recipient, and group environment. The proposed model is applied to Twitter
to analyze the influence of topic type, parameter changing, and opinion leaders
on opinion formation. Experimental results show that the opinion evolution of
controversial topic shows greater uncertainty and sustainability. The ratio of
benefit to cost has a significant impact on opinion formation and a moderate
ratio will result in the longest relaxation time or most unified global
opinions. Furthermore, celebrities with a large number of followers are more
capable of influencing public opinion than experts. This paper enriches the
researches on opinion formation modeling, and the results provide managerial
insights for business on public relations and market prediction.
","[{'version': 'v1', 'created': 'Tue, 17 Jul 2018 02:10:31 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Jul 2019 01:07:08 GMT'}]",2019-09-04,"[['Yin', 'Xicheng', ''], ['Wang', 'Hongwei', ''], ['Yin', 'Pei', ''], ['Zhu', 'Hengmin', '']]","['Opinion formation', 'social psychology', 'attitude change', 'game theory', 'social network']"
2353,2105.10256,Andrea Fronzetti Colladon PhD,A. Fronzetti Colladon and P. A. Gloor,Measuring the impact of spammers on e-mail and Twitter networks,,"International Journal of Information Management 48, 254-262 (2019)",10.1016/j.ijinfomgt.2018.09.009,,cs.SI cs.CL cs.IR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper investigates the research question if senders of large amounts of
irrelevant or unsolicited information - commonly called ""spammers"" - distort
the network structure of social networks. Two large social networks are
analyzed, the first extracted from the Twitter discourse about a big
telecommunication company, and the second obtained from three years of email
communication of 200 managers working for a large multinational company. This
work compares network robustness and the stability of centrality and
interaction metrics, as well as the use of language, after removing spammers
and the most and least connected nodes. The results show that spammers do not
significantly alter the structure of the information-carrying network, for most
of the social indicators. The authors additionally investigate the correlation
between e-mail subject line and content by tracking language sentiment,
emotionality, and complexity, addressing the cases where collecting email
bodies is not permitted for privacy reasons. The findings extend the research
about robustness and stability of social networks metrics, after the
application of graph simplification strategies. The results have practical
implication for network analysts and for those company managers who rely on
network analytics (applied to company emails and social media data) to support
their decision-making processes.
","[{'version': 'v1', 'created': 'Fri, 21 May 2021 10:13:11 GMT'}]",2021-05-24,"[['Colladon', 'A. Fronzetti', ''], ['Gloor', 'P. A.', '']]","['data preprocessing', 'robustness', 'social network', 'spammers', 'stability', 'email', 'Twitter']"
2354,1005.5065,Manar Mohaisen,"Manar Mohaisen, KyungHi Chang","Upper-lower bounded-complexity QRD-M for spatial multiplexing MIMO-OFDM
  systems","Springer, Wireless Personal Communications Journal (WPC'2010), 13
  pages, 6 figures, 2 tables, 1 algorithm",,10.1007/s11277-010-0014-8,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multiple-input multiple-output (MIMO) technology applied with orthogonal
frequency division multiplexing (OFDM) is considered as the ultimate solution
to increase channel capacity without any additional spectral resources. At the
receiver side, the challenge resides in designing low complexity detection
algorithms capable of separating independent streams sent simultaneously from
different antennas. In this paper, we introduce an upper-lower
bounded-complexity QRD-M algorithm (ULBC QRD-M). In the proposed algorithm we
solve the problem of high extreme complexity of the conventional sphere
decoding by fixing the upper bound complexity to that of the conventional
QRD-M. On the other hand, ULBC QRD-M intelligently cancels all unnecessary
hypotheses to achieve very low computational requirements. Analyses and
simulation results show that the proposed algorithm achieves the performance of
conventional QRD-M with only 26% of the required computations.
","[{'version': 'v1', 'created': 'Thu, 27 May 2010 13:26:03 GMT'}]",2010-05-28,"[['Mohaisen', 'Manar', ''], ['Chang', 'KyungHi', '']]","['MIMO‐OFDM\xa0detection', 'sphere\xa0decoding', 'QRD‐M', 'ULBC\xa0QRD‐M', 'maximum\xa0likelihood', 'receiver\xa0complexity']"
2355,1608.02012,Marco Tulio Valente,"Miguel Ramos, Marco Tulio Valente, Ricardo Terra, Gustavo Santos",AngularJS in the Wild: A Survey with 460 Developers,"Accepted at 7th Workshop on Evaluation and Usability of Programming
  Languages and Tools (PLATEAU)",,10.1145/3001878.3001881,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To implement modern web applications, a new family of JavaScript frameworks
has emerged, using the MVC pattern. Among these frameworks, the most popular
one is AngularJS, which is supported by Google. In spite of its popularity,
there is not a clear knowledge on how AngularJS design and features affect the
development experience of Web applications. Therefore, this paper reports the
results of a survey about AngularJS, including answers from 460 developers. Our
contributions include the identification of the most appreciated features of
AngularJS (e.g., custom interface components, dependency injection, and two-way
data binding) and the most problematic aspects of the framework (e.g.,
performance and implementation of directives).
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2016 20:21:57 GMT'}, {'version': 'v2', 'created': 'Sun, 25 Sep 2016 21:56:34 GMT'}, {'version': 'v3', 'created': 'Tue, 27 Sep 2016 23:47:43 GMT'}]",2018-08-07,"[['Ramos', 'Miguel', ''], ['Valente', 'Marco Tulio', ''], ['Terra', 'Ricardo', ''], ['Santos', 'Gustavo', '']]","['JavaScript', 'AngularJS', 'MVC frameworks']"
2356,1707.07847,Yi Tay,"Yi Tay, Luu Anh Tuan, Siu Cheung Hui","Hyperbolic Representation Learning for Fast and Efficient Neural
  Question Answering",Accepted at WSDM 2018,,10.1145/3159652.3159664,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The dominant neural architectures in question answer retrieval are based on
recurrent or convolutional encoders configured with complex word matching
layers. Given that recent architectural innovations are mostly new word
interaction layers or attention-based matching mechanisms, it seems to be a
well-established fact that these components are mandatory for good performance.
Unfortunately, the memory and computation cost incurred by these complex
mechanisms are undesirable for practical applications. As such, this paper
tackles the question of whether it is possible to achieve competitive
performance with simple neural architectures. We propose a simple but novel
deep learning architecture for fast and efficient question-answer ranking and
retrieval. More specifically, our proposed model, \textsc{HyperQA}, is a
parameter efficient neural network that outperforms other parameter intensive
models such as Attentive Pooling BiLSTMs and Multi-Perspective CNNs on multiple
QA benchmarks. The novelty behind \textsc{HyperQA} is a pairwise ranking
objective that models the relationship between question and answer embeddings
in Hyperbolic space instead of Euclidean space. This empowers our model with a
self-organizing ability and enables automatic discovery of latent hierarchies
while learning embeddings of questions and answers. Our model requires no
feature engineering, no similarity matrix matching, no complicated attention
mechanisms nor over-parameterized layers and yet outperforms and remains
competitive to many models that have these functionalities on multiple
benchmarks.
","[{'version': 'v1', 'created': 'Tue, 25 Jul 2017 08:21:30 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Jul 2017 01:21:20 GMT'}, {'version': 'v3', 'created': 'Thu, 23 Nov 2017 05:54:17 GMT'}]",2017-11-27,"[['Tay', 'Yi', ''], ['Tuan', 'Luu Anh', ''], ['Hui', 'Siu Cheung', '']]","['Question Answering', 'Deep Learning', 'Learning to Rank']"
2357,2201.06446,Malte Breuer,"Malte Breuer, Ulrike Meyer, Susanne Wetzel","Privacy-Preserving Maximum Matching on General Graphs and its
  Application to Enable Privacy-Preserving Kidney Exchange","This is the extended version of the paper that appeared in the 12th
  ACM Conference on Data and Application Security and Privacy (CODASPY'22),
  April 24-26, 2022, Baltimore-Washington DC Area, United States,
  https://doi.org/10.1145/3508398.3511509","12th ACM Conference on Data and Application Security and Privacy
  2022 (CODASPY'22)",10.1145/3508398.3511509,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To this day, there are still some countries where the exchange of kidneys
between multiple incompatible patient-donor pairs is restricted by law.
Typically, legal regulations in this context are put in place to prohibit
coercion and manipulation in order to prevent a market for organ trade. Yet, in
countries where kidney exchange is practiced, existing platforms to facilitate
such exchanges generally lack sufficient privacy mechanisms. In this paper, we
propose a privacy-preserving protocol for kidney exchange that not only
addresses the privacy problem of existing platforms but also is geared to lead
the way in overcoming legal issues in those countries where kidney exchange is
still not practiced. In our approach, we use the concept of secret sharing to
distribute the medical data of patients and donors among a set of computing
peers in a privacy-preserving fashion. These computing peers then execute our
new Secure Multi-Party Computation (SMPC) protocol among each other to
determine an optimal set of kidney exchanges. As part of our new protocol, we
devise a privacy-preserving solution to the maximum matching problem on general
graphs. We have implemented the protocol in the SMPC benchmarking framework
MP-SPDZ and provide a comprehensive performance evaluation. Furthermore, we
analyze the practicality of our protocol when used in a dynamic setting (where
patients and donors arrive and depart over time) based on a data set from the
United Network for Organ Sharing.
","[{'version': 'v1', 'created': 'Mon, 17 Jan 2022 14:57:26 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Jun 2022 12:08:46 GMT'}]",2022-06-03,"[['Breuer', 'Malte', ''], ['Meyer', 'Ulrike', ''], ['Wetzel', 'Susanne', '']]","['Kidney Exchange', 'Privacy', 'Secure Multi-Party Computation', 'Matching Algorithms']"
2358,1902.10418,Bang Liu,"Bang Liu, Mingjun Zhao, Di Niu, Kunfeng Lai, Yancheng He, Haojie Wei,
  Yu Xu",Learning to Generate Questions by Learning What not to Generate,Accepted by WWW 2019,,10.1145/3308558.3313737,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic question generation is an important technique that can improve the
training of question answering, help chatbots to start or continue a
conversation with humans, and provide assessment materials for educational
purposes. Existing neural question generation models are not sufficient mainly
due to their inability to properly model the process of how each word in the
question is selected, i.e., whether repeating the given passage or being
generated from a vocabulary. In this paper, we propose our Clue Guided Copy
Network for Question Generation (CGC-QG), which is a sequence-to-sequence
generative model with copying mechanism, yet employing a variety of novel
components and techniques to boost the performance of question generation. In
CGC-QG, we design a multi-task labeling strategy to identify whether a question
word should be copied from the input passage or be generated instead, guiding
the model to learn the accurate boundaries between copying and generation.
Furthermore, our input passage encoder takes as input, among a diverse range of
other features, the prediction made by a clue word predictor, which helps
identify whether each word in the input passage is a potential clue to be
copied into the target question. The clue word predictor is designed based on a
novel application of Graph Convolutional Networks onto a syntactic dependency
tree representation of each passage, thus being able to predict clue words only
based on their context in the passage and their relative positions to the
answer in the tree. We jointly train the clue prediction as well as question
generation with multi-task learning and a number of practical strategies to
reduce the complexity. Extensive evaluations show that our model significantly
improves the performance of question generation and out-performs all previous
state-of-the-art neural question generation models by a substantial margin.
","[{'version': 'v1', 'created': 'Wed, 27 Feb 2019 09:56:19 GMT'}]",2019-02-28,"[['Liu', 'Bang', ''], ['Zhao', 'Mingjun', ''], ['Niu', 'Di', ''], ['Lai', 'Kunfeng', ''], ['He', 'Yancheng', ''], ['Wei', 'Haojie', ''], ['Xu', 'Yu', '']]","['Question Generation', 'Copy Prediction', 'Multi-task Learning', 'Sequenceto-Sequence', 'Graph Convolutional Networks']"
2359,1005.4496,Secretary Aircc Journal,"Dewan Md. Farid(1), Nouria Harbi(1), and Mohammad Zahidur Rahman(2),
  ((1)University Lumiere Lyon 2 - France, (2)Jahangirnagar University,
  Bangladesh)",Combining Naive Bayes and Decision Tree for Adaptive Intrusion Detection,"14 Pages, IJNSA","International Journal of Network Security & Its Applications 2.2
  (2010) 12-25",10.5121/ijnsa.2010.2202,,cs.AI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper, a new learning algorithm for adaptive network intrusion
detection using naive Bayesian classifier and decision tree is presented, which
performs balance detections and keeps false positives at acceptable level for
different types of network attacks, and eliminates redundant attributes as well
as contradictory examples from training data that make the detection model
complex. The proposed algorithm also addresses some difficulties of data mining
such as handling continuous attribute, dealing with missing attribute values,
and reducing noise in training data. Due to the large volumes of security audit
data as well as the complex and dynamic properties of intrusion behaviours,
several data miningbased intrusion detection techniques have been applied to
network-based traffic data and host-based data in the last decades. However,
there remain various issues needed to be examined towards current intrusion
detection systems (IDS). We tested the performance of our proposed algorithm
with existing learning algorithms by employing on the KDD99 benchmark intrusion
detection dataset. The experimental results prove that the proposed algorithm
achieved high detection rates (DR) and significant reduce false positives (FP)
for different types of network intrusions using limited computational
resources.
","[{'version': 'v1', 'created': 'Tue, 25 May 2010 07:47:00 GMT'}]",2010-07-15,"[['Farid', 'Dewan Md.', ''], ['Harbi', 'Nouria', ''], ['Rahman', 'Mohammad Zahidur', '']]","['Decision Tree', 'Detection Rate', 'False Positive', 'Naive Bayesian classifier', 'Network Intrusion Detection']"
2360,1306.4849,Matteo Piva,Matteo Piva and Massimiliano Sala,"A generalization of bounds for cyclic codes, including the HT and BS
  bounds",,"Springer LNCS, 8080, p. 101-112 (2013)",10.1007/978-3-642-40663-8_11,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We use the algebraic structure of cyclic codes and some properties of the
discrete Fourier transform to give a reformulation of several classical bounds
for the distance of cyclic codes, by extending techniques of linear algebra. We
propose a bound, whose computational complexity is polynomial bounded, which is
a generalization of the Hartmann-Tzeng bound and the Betti-Sala bound. In the
majority of computed cases, our bound is the tightest among all known
polynomial-time bounds, including the Roos bound.
","[{'version': 'v1', 'created': 'Thu, 20 Jun 2013 12:27:49 GMT'}]",2016-04-01,"[['Piva', 'Matteo', ''], ['Sala', 'Massimiliano', '']]","['Cyclic codes', 'DFT', 'BCH bound', 'Hartmann-Tzeng bound', 'Roosbound']"
2361,1412.3841,Przemys{\l}aw Gospodarczyk MSc.,"Przemys{\l}aw Gospodarczyk, Pawe{\l} Wo\'zny",Merging of B\'ezier curves with box constraints,,"Journal of Computational and Applied Mathematics 296, 265-274
  (2016)",10.1016/j.cam.2015.10.005,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a novel approach to the problem of merging of
B\'ezier curves with respect to the $L_2$-norm. We give illustrative examples
to show that the solution of the conventional merging problem may not be
suitable for further modification and applications. As in the case of the
degree reduction problem, we apply the so-called restricted area approach --
proposed recently in (P. Gospodarczyk, Computer-Aided Design 62 (2015),
143--151) -- to avoid certain defects and make the resulting curve more useful.
A method of solving the new problem is based on box-constrained quadratic
programming approach.
","[{'version': 'v1', 'created': 'Thu, 11 Dec 2014 22:11:44 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Dec 2014 14:07:04 GMT'}, {'version': 'v3', 'created': 'Fri, 27 Mar 2015 18:41:02 GMT'}, {'version': 'v4', 'created': 'Thu, 2 Jul 2015 13:46:38 GMT'}, {'version': 'v5', 'created': 'Tue, 1 Sep 2015 08:55:21 GMT'}, {'version': 'v6', 'created': 'Sun, 18 Oct 2015 20:50:07 GMT'}]",2017-02-10,"[['Gospodarczyk', 'Przemysław', ''], ['Woźny', 'Paweł', '']]","['B´ezier curve', 'merging', 'multiple segments', 'parametric continuity', 'quadraticprogramming', 'box constraints']"
2362,1805.04465,Bernadette Spieler,"Bernadette Spieler and Christian Schindler and Wolfgang Slany and
  Olena Mashkina","App creation in schools for different curricula subjects - lesson
  learned","10 pages, 5 tables EduLearn 2017",EduLearn 2017 https://library.iated.org/publications/EDULEARN17,10.21125/edulearn.2017.2315,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The next generation of jobs will be characterized by an increased demand for
people with computational and problem solving skills. In Austria, computer
science topics are underrepresented in school curricula hence teaching time for
these topics is limited. From primary through secondary school, only a few
opportunities exist for young students to explore programming. Furthermore,
today's teachers are rarely trained in computer science, which impairs their
potential to motivate students in these courses. Within the ""No One Left
Behind"" (NOLB) project, teachers were supported to guide and assist their
students in their learning processes by constructing ideas through game making.
Thus, students created games that referred to different subject areas by using
the programming tool Pocket Code, an app developed at Graz University of
Technology (TU-Graz). This tool helps students to take control of their own
education, becoming more engaged, interested, and empowered as a result. To
ensure an optimal integration of the app in diverse subjects the different
backgrounds (technical and non-technical) of teachers must be considered as
well. First, teachers were supported to use Pocket Code in the different
subjects in school within the feasibility study of the project. Observed
challenges and difficulties using the app have been gathered. Second, we
conducted interviews with teachers and students to underpin our onsite
observations. As a result, it was possible to validate Pocket Codes' potential
to be used in a diverse range of subjects. Third, we focused especially on
those teachers who were not technically trained to provide them with a
framework for Pocket Code units, e.g., with the help of structured lesson plans
and predefined templates.
","[{'version': 'v1', 'created': 'Fri, 11 May 2018 16:05:01 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Aug 2018 10:21:05 GMT'}]",2018-09-03,"[['Spieler', 'Bernadette', ''], ['Schindler', 'Christian', ''], ['Slany', 'Wolfgang', ''], ['Mashkina', 'Olena', '']]","['Pocket Code', 'game design', 'programming', 'mobile learning', 'curricula', 'computational skills']"
2363,0907.0592,James Whitacre,"James M. Whitacre, Tuan Q. Pham, Ruhul A. Sarker",Credit Assignment in Adaptive Evolutionary Algorithms,,"Genetic And Evolutionary Computation Conference, 2006",10.1145/1143997.1144206,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a new method for assigning credit to search operators is
presented. Starting with the principle of optimizing search bias, search
operators are selected based on an ability to create solutions that are
historically linked to future generations. Using a novel framework for defining
performance measurements, distributing credit for performance, and the
statistical interpretation of this credit, a new adaptive method is developed
and shown to outperform a variety of adaptive and non-adaptive competitors.
","[{'version': 'v1', 'created': 'Fri, 3 Jul 2009 11:02:25 GMT'}]",2009-07-06,"[['Whitacre', 'James M.', ''], ['Pham', 'Tuan Q.', ''], ['Sarker', 'Ruhul A.', '']]","['Evolutionary Algorithm', 'Genetic Algorithm', 'Adaptation', 'Historical Credit Assignment', 'Search Bias']"
2364,1902.09277,Mohsen Khorasany,"Mohsen Khorasany, Yateendra Mishra, Gerard Ledwich","Design of auction-based approach for market clearing in peer-to-peer
  market platform",6 pages,,10.1049/joe.2018.9313,,cs.GT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper designs a market platform for Peer-to-Peer (P2P) energy trading in
Transactive Energy (TE) systems, where prosumers and consumers actively
participate in the market as seller or buyer to trade energy. An auction-based
approach is used for market clearing in the proposed platform and a review of
different types of auction is performed. The appropriate auction approach for
market clearing in the proposed platform is designed. The proposed auction
mechanism is implemented in three steps namely determination, allocation and
payment. This paper identifies important P2P market clearing performance
indices, which are used to compare and contrast the designed auction with
different types of auction mechanisms. Comparative studies demonstrate the
efficacy of the proposed auction mechanism for market clearing in the P2P
platform.
","[{'version': 'v1', 'created': 'Thu, 7 Feb 2019 22:25:28 GMT'}]",2019-07-30,"[['Khorasany', 'Mohsen', ''], ['Mishra', 'Yateendra', ''], ['Ledwich', 'Gerard', '']]","['Transactive Energy', 'Distributed Energy Resources', 'Market Design', 'P2P trading', 'Auction']"
2365,1705.10834,Thommen George Karimpanal,"Thommen George Karimpanal, Roland Bouffanais",Experience Replay Using Transition Sequences,"23 pages, 6 figures",Frontiers in Neurorobotics 12 (2018) 32,10.3389/fnbot.2018.00032,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Experience replay is one of the most commonly used approaches to improve the
sample efficiency of reinforcement learning algorithms. In this work, we
propose an approach to select and replay sequences of transitions in order to
accelerate the learning of a reinforcement learning agent in an off-policy
setting. In addition to selecting appropriate sequences, we also artificially
construct transition sequences using information gathered from previous
agent-environment interactions. These sequences, when replayed, allow value
function information to trickle down to larger sections of the
state/state-action space, thereby making the most of the agent's experience. We
demonstrate our approach on modified versions of standard reinforcement
learning tasks such as the mountain car and puddle world problems and
empirically show that it enables better learning of value functions as compared
to other forms of experience replay. Further, we briefly discuss some of the
possible extensions to this work, as well as applications and situations where
this approach could be particularly useful.
","[{'version': 'v1', 'created': 'Tue, 30 May 2017 19:24:09 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Sep 2019 01:13:39 GMT'}]",2022-09-29,"[['Karimpanal', 'Thommen George', ''], ['Bouffanais', 'Roland', '']]","['Experience Replay', 'Q-learning', 'Off-Policy', 'Multi-taskReinforcement Learning', 'Probabilistic Policy Reuse']"
2366,2105.10072,Jianghong Zhou,"Jianghong Zhou, Sayyed M. Zahiri, Simon Hughes, Khalifeh Al Jadda,
  Surya Kallumadi, Eugene Agichtein",De-Biased Modelling of Search Click Behavior with Reinforcement Learning,SIGIR 2021 Short Paper,,10.1145/3404835.3463228,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Users' clicks on Web search results are one of the key signals for evaluating
and improving web search quality and have been widely used as part of current
state-of-the-art Learning-To-Rank(LTR) models. With a large volume of search
logs available for major search engines, effective models of searcher click
behavior have emerged to evaluate and train LTR models. However, when modeling
the users' click behavior, considering the bias of the behavior is imperative.
In particular, when a search result is not clicked, it is not necessarily
chosen as not relevant by the user, but instead could have been simply missed,
especially for lower-ranked results. These kinds of biases in the click log
data can be incorporated into the click models, propagating the errors to the
resulting LTR ranking models or evaluation metrics. In this paper, we propose
the De-biased Reinforcement Learning Click model (DRLC). The DRLC model relaxes
previously made assumptions about the users' examination behavior and resulting
latent states. To implement the DRLC model, convolutional neural networks are
used as the value networks for reinforcement learning, trained to learn a
policy to reduce bias in the click logs. To demonstrate the effectiveness of
the DRLC model, we first compare performance with the previous state-of-art
approaches using established click prediction metrics, including log-likelihood
and perplexity. We further show that DRLC also leads to improvements in ranking
performance. Our experiments demonstrate the effectiveness of the DRLC model in
learning to reduce bias in click logs, leading to improved modeling performance
and showing the potential for using DRLC for improving Web search quality.
","[{'version': 'v1', 'created': 'Fri, 21 May 2021 00:23:32 GMT'}]",2021-05-24,"[['Zhou', 'Jianghong', ''], ['Zahiri', 'Sayyed M.', ''], ['Hughes', 'Simon', ''], ['Jadda', 'Khalifeh Al', ''], ['Kallumadi', 'Surya', ''], ['Agichtein', 'Eugene', '']]","['web search click models', 'reinforcement learning for click modeling', 'de-biased estimation of search click behavior']"
2367,1901.07525,Gianni Bianchini,"Daniele Pepe, Gianni Bianchini, Antonio Vicino",Model Estimation for Solar Generation Forecasting using Cloud Cover Data,,"Solar Energy, Volume 157, 2017, Pages 1032-1046, ISSN 0038-092X",10.1016/j.solener.2017.08.086,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a parametric model approach to address the problem of
photovoltaic generation forecasting in a scenario where measurements of
meteorological variables, i.e., solar irradiance and temperature, are not
available at the plant site. This scenario is relevant to electricity network
operation, when a large number of PV plants are deployed in the grid. The
proposed method makes use of raw cloud cover data provided by a meteorological
service combined with power generation measurements, and is particularly
suitable in PV plant integration on a large-scale basis, due to low model
complexity and computational efficiency. An extensive validation is performed
using both simulated and real data.
","[{'version': 'v1', 'created': 'Tue, 22 Jan 2019 18:58:48 GMT'}]",2019-01-23,"[['Pepe', 'Daniele', ''], ['Bianchini', 'Gianni', ''], ['Vicino', 'Antonio', '']]","['Photovoltaic generation', 'Modeling', 'Estimation', 'Forecasting', 'Cloud cover']"
2368,1108.0329,Remy Haemmerle,R\'emy Haemmerl\'e,Observational equivalences for linear logic CC languages,17 pages,"Theory and Practice of Logic Programming, 11(4-5): 469-485, 2011",10.1017/S1471068411000123,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linear logic Concurrent Constraint programming (LCC) is an extension of
concurrent constraint programming (CC) where the constraint system is based on
Girard's linear logic instead of the classical logic. In this paper we address
the problem of program equivalence for this programming framework. For this
purpose, we present a structural operational semantics for LCC based on a label
transition system and investigate different notions of observational
equivalences inspired by the state of art of process algebras. Then, we
demonstrate that the asynchronous \pi-calculus can be viewed as simple
syntactical restrictions of LCC. Finally we show LCC observational equivalences
can be transposed straightforwardly to classical Concurrent Constraint
languages and Constraint Handling Rules, and investigate the resulting
equivalences.
","[{'version': 'v1', 'created': 'Mon, 1 Aug 2011 14:56:56 GMT'}]",2011-08-02,"[['Haemmerlé', 'Rémy', '']]","['Concurrent Constraint programming', 'linear logic', 'observational equivalences', 'bisimulation', 'π-calculus', 'Constraint Handling Rules']"
2369,1901.07871,Patrick Spettel,Patrick Spettel and Hans-Georg Beyer,"Analysis of the $(\mu/\mu_I,\lambda)$-CSA-ES with Repair by Projection
  Applied to a Conically Constrained Problem","This is a PREPRINT of an article that has been accepted for
  publication in the journal MIT Press Evolutionary Computation (ECJ). 25 pages
  + supplementary material. The work was supported by the Austrian Science Fund
  FWF under grant P29651-N32",,10.1162/evco_a_00261,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Theoretical analyses of evolution strategies are indispensable for gaining a
deep understanding of their inner workings. For constrained problems, rather
simple problems are of interest in the current research. This work presents a
theoretical analysis of a multi-recombinative evolution strategy with
cumulative step size adaptation applied to a conically constrained linear
optimization problem. The state of the strategy is modeled by random variables
and a stochastic iterative mapping is introduced. For the analytical treatment,
fluctuations are neglected and the mean value iterative system is considered.
Non-linear difference equations are derived based on one-generation progress
rates. Based on that, expressions for the steady state of the mean value
iterative system are derived. By comparison with real algorithm runs, it is
shown that for the considered assumptions, the theoretical derivations are able
to predict the dynamics and the steady state values of the real runs.
","[{'version': 'v1', 'created': 'Wed, 23 Jan 2019 13:32:06 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Aug 2019 12:58:20 GMT'}]",2019-08-12,"[['Spettel', 'Patrick', ''], ['Beyer', 'Hans-Georg', '']]","['Evolution strategy', 'constraint handling', 'repair by projection', 'cumulative step sizeadaptation', 'conically constrained problem']"
2370,1306.2691,EPTCS,"Ivan Gazeau (INRIA), Dale Miller (INRIA), Catuscia Palamidessi (INRIA)",Preserving differential privacy under finite-precision semantics,"In Proceedings QAPL 2013, arXiv:1306.2413","EPTCS 117, 2013, pp. 1-18",10.4204/EPTCS.117.1,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The approximation introduced by finite-precision representation of continuous
data can induce arbitrarily large information leaks even when the computation
using exact semantics is secure. Such leakage can thus undermine design efforts
aimed at protecting sensitive information. We focus here on differential
privacy, an approach to privacy that emerged from the area of statistical
databases and is now widely applied also in other domains. In this approach,
privacy is protected by the addition of noise to a true (private) value. To
date, this approach to privacy has been proved correct only in the ideal case
in which computations are made using an idealized, infinite-precision
semantics. In this paper, we analyze the situation at the implementation level,
where the semantics is necessarily finite-precision, i.e. the representation of
real numbers and the operations on them, are rounded according to some level of
precision. We show that in general there are violations of the differential
privacy property, and we study the conditions under which we can still
guarantee a limited (but, arguably, totally acceptable) variant of the
property, under only a minor degradation of the privacy level. Finally, we
illustrate our results on two cases of noise-generating distributions: the
standard Laplacian mechanism commonly used in differential privacy, and a
bivariate version of the Laplacian recently introduced in the setting of
privacy-aware geolocation.
","[{'version': 'v1', 'created': 'Wed, 12 Jun 2013 01:55:18 GMT'}]",2013-06-13,"[['Gazeau', 'Ivan', '', 'INRIA'], ['Miller', 'Dale', '', 'INRIA'], ['Palamidessi', 'Catuscia', '', 'INRIA']]","['Differential privacy', 'floating-point arithmetic', 'robustness to errors']"
2371,1912.03437,Md Khairul Islam,"Md. Khairul Islam, Toufique Ahmed, Rifat Shahriyar, Anindya Iqbal, and
  Gias Uddin","Early Prediction for Merged vs Abandoned Code Changes in Modern Code
  Reviews",,,10.1016/j.infsof.2021.106756,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The modern code review process is an integral part of the current software
development practice. Considerable effort is given here to inspect code
changes, find defects, suggest an improvement, and address the suggestions of
the reviewers. In a code review process, usually, several iterations take place
where an author submits code changes and a reviewer gives feedback until is
happy to accept the change. In around 12% cases, the changes are abandoned,
eventually wasting all the efforts. In this research, our objective is to
design a tool that can predict whether a code change would be merged or
abandoned at an early stage to reduce the waste of efforts of all stakeholders
(e.g., program author, reviewer, project management, etc.) involved. The
real-world demand for such a tool was formally identified by a study by Fan et
al. [1]. We have mined 146,612 code changes from the code reviews of three
large and popular open-source software and trained and tested a suite of
supervised machine learning classifiers, both shallow and deep learning based.
We consider a total of 25 features in each code change during the training and
testing of the models. The best performing model named PredCR (Predicting Code
Review), a LightGBM-based classifier achieves around 85% AUC score on average
and relatively improves the state-of-the-art [1] by 14-23%. In our empirical
study on the 146,612 code changes from the three software projects, we find
that (1) The new features like reviewer dimensions that are introduced in
PredCR are the most informative. (2) Compared to the baseline, PredCR is more
effective towards reducing bias against new developers. (3) PredCR uses
historical data in the code review repository and as such the performance of
PredCR improves as a software system evolves with new and more data.
","[{'version': 'v1', 'created': 'Sat, 7 Dec 2019 04:38:48 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Aug 2021 19:19:31 GMT'}]",2021-10-27,"[['Islam', 'Md. Khairul', ''], ['Ahmed', 'Toufique', ''], ['Shahriyar', 'Rifat', ''], ['Iqbal', 'Anindya', ''], ['Uddin', 'Gias', '']]","['Code Review', 'Patch', 'Early Prediction', 'Merged', 'Abandoned']"
2372,1809.10270,Balakrishnan Chandrasekaran,"Mirko Palmer, Thorben Kr\""uger, Balakrishnan Chandrasekaran, and Anja
  Feldmann",The QUIC Fix for Optimal Video Streaming,"Published to ACM CoNEXT Workshop on the Evolution, Performance, and
  Interoperability of QUIC (EPIQ)",,10.1145/3284850.3284857,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Within a few years of its introduction, QUIC has gained traction: a
significant chunk of traffic is now delivered over QUIC. The networking
community is actively engaged in debating the fairness, performance, and
applicability of QUIC for various use cases, but these debates are centered
around a narrow, common theme: how does the new reliable transport built on top
of UDP fare in different scenarios? Support for unreliable delivery in QUIC
remains largely unexplored.
  The option for delivering content unreliably, as in a best-effort model,
deserves the QUIC designers' and community's attention. We propose extending
QUIC to support unreliable streams and present a simple approach for
implementation. We discuss a simple use case of video streaming---an
application that dominates the overall Internet traffic---that can leverage the
unreliable streams and potentially bring immense benefits to network operators
and content providers. To this end, we present a prototype implementation that,
by using both the reliable and unreliable streams in QUIC, outperforms both TCP
and QUIC in our evaluations.
","[{'version': 'v1', 'created': 'Wed, 26 Sep 2018 23:54:41 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Oct 2018 22:23:08 GMT'}]",2018-10-23,"[['Palmer', 'Mirko', ''], ['Krüger', 'Thorben', ''], ['Chandrasekaran', 'Balakrishnan', ''], ['Feldmann', 'Anja', '']]","['Video Streaming', 'Partial Reliability', 'QUIC']"
2373,0910.4292,Vassilis Kostakos,Vassilis Kostakos,"An empirical study of spatial and transpatial social networks using
  Bluetooth and Facebook","17 pages,4 figures, 1 table","IEEE SocialCom, p. 587-594, 2010",10.1109/SocialCom.2010.181,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study provides insights into the quantitative similarities, differences
and relationships between users' spatial, face-to-face, urban social networks
and their transpatial, online counterparts. We explore and map the social ties
within a cohort of 2602 users, and how those ties are mediated via physical
co-presence and online tools. Our analysis focused on isolating two distinct
segments of the social network: one mediated by physical co-presence, and the
other mediated by Facebook. Our results suggest that as a whole the networks
exhibit homogeneous characteristics, but individuals' involvement in those
networks varies considerably. Furthermore this study provides a methodological
approach for jointly analysing spatial & transpatial networks utilising
pervasive and ubiquitous technology.
","[{'version': 'v1', 'created': 'Thu, 22 Oct 2009 11:09:02 GMT'}]",2013-06-06,"[['Kostakos', 'Vassilis', '']]","['Social network', 'Facebook', 'Bluetooth', 'spatial and transpatial']"
2374,0808.0745,Caleb Lo,"Caleb K. Lo, John J. Hasenbein, Sriram Vishwanath and Robert W. Heath
  Jr",Relay-Assisted User Scheduling in Wireless Networks with Hybrid-ARQ,"14 pages, 5 figures, submitted to the IEEE Transactions on Vehicular
  Technology in October 2008, revised in March 2009 and May 2009",,10.1109/TVT.2009.2027711,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies the problem of relay-assisted user scheduling for downlink
wireless transmission. The base station or access point employs hybrid
automatic-repeat-request (HARQ) with the assistance of a set of fixed relays to
serve a set of mobile users. By minimizing a cost function of the queue lengths
at the base station and the number of retransmissions of the head-of-line
packet for each user, the base station can schedule an appropriate user in each
time slot and an appropriate transmitter to serve it. It is shown that a
priority-index policy is optimal for a linear cost function with packets
arriving according to a Poisson process and for an increasing convex cost
function where packets must be drained from the queues at the base station.
","[{'version': 'v1', 'created': 'Tue, 5 Aug 2008 23:53:26 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Oct 2008 00:03:40 GMT'}, {'version': 'v3', 'created': 'Thu, 9 Oct 2008 18:07:18 GMT'}, {'version': 'v4', 'created': 'Thu, 19 Mar 2009 00:14:59 GMT'}, {'version': 'v5', 'created': 'Sat, 16 May 2009 23:30:33 GMT'}]",2016-11-17,"[['Lo', 'Caleb K.', ''], ['Hasenbein', 'John J.', ''], ['Vishwanath', 'Sriram', ''], ['Heath', 'Robert W.', 'Jr']]","['Relays', 'scheduling policies', 'hybrid automatic-repeat-request', 'priority-index rules']"
2375,1504.03967,Holger Roth,"Holger R. Roth, Amal Farag, Le Lu, Evrim B. Turkbey, and Ronald M.
  Summers",Deep convolutional networks for pancreas segmentation in CT imaging,"SPIE Medical Imaging conference, Orlando, FL, USA: SPIE Proceedings |
  Volume 9413 | Classification","Proc. SPIE 9413, Medical Imaging 2015: Image Processing, 94131G
  (20 March 2015)",10.1117/12.2081420,,cs.CV,http://creativecommons.org/licenses/publicdomain/,"  Automatic organ segmentation is an important prerequisite for many
computer-aided diagnosis systems. The high anatomical variability of organs in
the abdomen, such as the pancreas, prevents many segmentation methods from
achieving high accuracies when compared to other segmentation of organs like
the liver, heart or kidneys. Recently, the availability of large annotated
training sets and the accessibility of affordable parallel computing resources
via GPUs have made it feasible for ""deep learning"" methods such as
convolutional networks (ConvNets) to succeed in image classification tasks.
These methods have the advantage that used classification features are trained
directly from the imaging data. We present a fully-automated bottom-up method
for pancreas segmentation in computed tomography (CT) images of the abdomen.
The method is based on hierarchical coarse-to-fine classification of local
image regions (superpixels). Superpixels are extracted from the abdominal
region using Simple Linear Iterative Clustering (SLIC). An initial probability
response map is generated, using patch-level confidences and a two-level
cascade of random forest classifiers, from which superpixel regions with
probabilities larger 0.5 are retained. These retained superpixels serve as a
highly sensitive initial input of the pancreas and its surroundings to a
ConvNet that samples a bounding box around each superpixel at different scales
(and random non-rigid deformations at training time) in order to assign a more
distinct probability of each superpixel region being pancreas or not. We
evaluate our method on CT images of 82 patients (60 for training, 2 for
validation, and 20 for testing). Using ConvNets we achieve average Dice scores
of 68%+-10% (range, 43-80%) in testing. This shows promise for accurate
pancreas segmentation, using a deep learning approach and compares favorably to
state-of-the-art methods.
","[{'version': 'v1', 'created': 'Wed, 15 Apr 2015 16:55:46 GMT'}]",2015-09-17,"[['Roth', 'Holger R.', ''], ['Farag', 'Amal', ''], ['Lu', 'Le', ''], ['Turkbey', 'Evrim B.', ''], ['Summers', 'Ronald M.', '']]","['deep learning', 'convolutional neural networks', 'computed tomography', 'segmentation', 'pancreas', 'abdomen', 'computer-aided detection', 'superpixel']"
2376,1812.04852,Martin Sablotny,"Martin Sablotny, Bj{\o}rn Sand Jensen and Chris W. Johnson",Recurrent Neural Networks for Fuzz Testing Web Browsers,Preprint of the paper presented at ICISC 2018 in Korea,,10.1007/978-3-030-12146-4_22,,cs.CR cs.LG cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generation-based fuzzing is a software testing approach which is able to
discover different types of bugs and vulnerabilities in software. It is,
however, known to be very time consuming to design and fine tune classical
fuzzers to achieve acceptable coverage, even for small-scale software systems.
To address this issue, we investigate a machine learning-based approach to fuzz
testing in which we outline a family of test-case generators based on Recurrent
Neural Networks (RNNs) and train those on readily available datasets with a
minimum of human fine tuning. The proposed generators do, in contrast to
previous work, not rely on heuristic sampling strategies but principled
sampling from the predictive distributions. We provide a detailed analysis to
demonstrate the characteristics and efficacy of the proposed generators in a
challenging web browser testing scenario. The empirical results show that the
RNN-based generators are able to provide better coverage than a mutation based
method and are able to discover paths not discovered by a classical fuzzer. Our
results supplement findings in other domains suggesting that generation based
fuzzing with RNNs is a viable route to better software quality conditioned on
the use of a suitable model selection/analysis procedure.
","[{'version': 'v1', 'created': 'Wed, 12 Dec 2018 08:54:29 GMT'}]",2019-01-25,"[['Sablotny', 'Martin', ''], ['Jensen', 'Bjørn Sand', ''], ['Johnson', 'Chris W.', '']]","['Software security', 'fuzz testing', 'browser security']"
2377,1304.7224,Stian Soiland-Reyes,"Paolo Ciccarese, Stian Soiland-Reyes, Khalid Belhajjame, Alasdair J G
  Gray, Carole Goble, Tim Clark","PAV ontology: Provenance, Authoring and Versioning","22 pages (incl 5 tables and 19 figures). Submitted to Journal of
  Biomedical Semantics 2013-04-26 (#1858276535979415). Revised article
  submitted 2013-08-30. Second revised article submitted 2013-10-06. Accepted
  2013-10-07. Author proofs sent 2013-10-09 and 2013-10-16. Published
  2013-11-22. Final version 2013-12-06.
  http://www.jbiomedsem.com/content/4/1/37","Journal of Biomedical Semantics 2013, 4:37",10.1186/2041-1480-4-37,University of Manchester eScholar: uk-ac-man-scw:193385,cs.DL cs.IR,http://creativecommons.org/licenses/by/3.0/,"  Provenance is a critical ingredient for establishing trust of published
scientific content. This is true whether we are considering a data set, a
computational workflow, a peer-reviewed publication or a simple scientific
claim with supportive evidence. Existing vocabularies such as DC Terms and the
W3C PROV-O are domain-independent and general-purpose and they allow and
encourage for extensions to cover more specific needs. We identify the specific
need for identifying or distinguishing between the various roles assumed by
agents manipulating digital artifacts, such as author, contributor and curator.
  We present the Provenance, Authoring and Versioning ontology (PAV): a
lightweight ontology for capturing just enough descriptions essential for
tracking the provenance, authoring and versioning of web resources. We argue
that such descriptions are essential for digital scientific content. PAV
distinguishes between contributors, authors and curators of content and
creators of representations in addition to the provenance of originating
resources that have been accessed, transformed and consumed. We explore five
projects (and communities) that have adopted PAV illustrating their usage
through concrete examples. Moreover, we present mappings that show how PAV
extends the PROV-O ontology to support broader interoperability.
  The authors strived to keep PAV lightweight and compact by including only
those terms that have demonstrated to be pragmatically useful in existing
applications, and by recommending terms from existing ontologies when
plausible.
  We analyze and compare PAV with related approaches, namely Provenance
Vocabulary, DC Terms and BIBFRAME. We identify similarities and analyze their
differences with PAV, outlining strengths and weaknesses of our proposed model.
We specify SKOS mappings that align PAV with DC Terms.
","[{'version': 'v1', 'created': 'Fri, 26 Apr 2013 16:48:15 GMT'}, {'version': 'v2', 'created': 'Fri, 30 Aug 2013 16:18:14 GMT'}, {'version': 'v3', 'created': 'Thu, 3 Oct 2013 15:34:45 GMT'}, {'version': 'v4', 'created': 'Mon, 21 Oct 2013 09:31:12 GMT'}, {'version': 'v5', 'created': 'Fri, 22 Nov 2013 14:57:47 GMT'}, {'version': 'v6', 'created': 'Fri, 6 Dec 2013 23:53:56 GMT'}]",2013-12-10,"[['Ciccarese', 'Paolo', ''], ['Soiland-Reyes', 'Stian', ''], ['Belhajjame', 'Khalid', ''], ['Gray', 'Alasdair J G', ''], ['Goble', 'Carole', ''], ['Clark', 'Tim', '']]","['Provenance', 'Authoring', 'Versioning', 'Annotation', 'Semantic web', 'Attribution']"
2378,1911.09732,Yu Meng,"Yu Meng, Maryam Karimzadehgan, Honglei Zhuang, Donald Metzler",Separate and Attend in Personal Email Search,WSDM 2020,,10.1145/3336191.3371775,,cs.IR cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In personal email search, user queries often impose different requirements on
different aspects of the retrieved emails. For example, the query ""my recent
flight to the US"" requires emails to be ranked based on both textual contents
and recency of the email documents, while other queries such as ""medical
history"" do not impose any constraints on the recency of the email. Recent deep
learning-to-rank models for personal email search often directly concatenate
dense numerical features (e.g., document age) with embedded sparse features
(e.g., n-gram embeddings). In this paper, we first show with a set of
experiments on synthetic datasets that direct concatenation of dense and sparse
features does not lead to the optimal search performance of deep neural ranking
models. To effectively incorporate both sparse and dense email features into
personal email search ranking, we propose a novel neural model, SepAttn.
SepAttn first builds two separate neural models to learn from sparse and dense
features respectively, and then applies an attention mechanism at the
prediction level to derive the final prediction from these two models. We
conduct a comprehensive set of experiments on a large-scale email search
dataset, and demonstrate that our SepAttn model consistently improves the
search quality over the baseline models.
","[{'version': 'v1', 'created': 'Thu, 21 Nov 2019 20:19:28 GMT'}]",2019-11-25,"[['Meng', 'Yu', ''], ['Karimzadehgan', 'Maryam', ''], ['Zhuang', 'Honglei', ''], ['Metzler', 'Donald', '']]","['Learning-to-Rank', 'Email Search', 'Neural Attention Model']"
2379,1903.01039,Katikapalli Subramanyam Kalyan,"Kalyan KS, S Sangeetha",SECNLP: A Survey of Embeddings in Clinical Natural Language Processing,"Published in Journal of Biomedical Informatics (For updated version,
  refer 10.1016/j.jbi.2019.103323)","Journal of Biomedical Informatics, Volume 101, January 2020,
  103323",10.1016/j.jbi.2019.103323,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional representations like Bag of words are high dimensional, sparse
and ignore the order as well as syntactic and semantic information. Distributed
vector representations or embeddings map variable length text to dense fixed
length vectors as well as capture the prior knowledge which can transferred to
downstream tasks. Even though embedding has become de facto standard for
representations in deep learning based NLP tasks in both general and clinical
domains, there is no survey paper which presents a detailed review of
embeddings in Clinical Natural Language Processing. In this survey paper, we
discuss various medical corpora and their characteristics, medical codes and
present a brief overview as well as comparison of popular embeddings models. We
classify clinical embeddings into nine types and discuss each embedding type in
detail. We discuss various evaluation methods followed by possible solutions to
various challenges in clinical embeddings. Finally, we conclude with some of
the future directions which will advance the research in clinical embeddings.
","[{'version': 'v1', 'created': 'Mon, 4 Mar 2019 01:37:52 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Mar 2019 03:16:20 GMT'}, {'version': 'v3', 'created': 'Sun, 17 Mar 2019 15:01:33 GMT'}, {'version': 'v4', 'created': 'Wed, 25 Nov 2020 02:06:42 GMT'}]",2020-11-26,"[['KS', 'Kalyan', ''], ['Sangeetha', 'S', '']]","['embeddings', 'distributed representations', 'medical', 'natural language processing', 'survey']"
2380,1902.10759,Patricio Rodriguez,"Jacinto Ulloa, Patricio Rodr\'iguez, Crist\'obal Samaniego, Esteban
  Samaniego",Phase-field modeling of fracture for quasi-brittle materials,"25 pages, 8 figures","Ulloa, J., Rodr\'iguez, P., Samaniego, C., & Samaniego, E. (2018).
  Phase-field modeling of fracture for quasi-brittle materials. Underground
  Space",10.1016/j.undsp.2018.08.002,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the modeling of fracture in quasi-brittle materials
using a phase-field approach to the description of crack topology. Within the
computational mechanics community, several studies have treated the issue of
modeling fracture using phase fields. Most of these studies have used an
approach that implies the lack of a damage threshold. We herein explore an
alternative model that includes a damage threshold and study how it compares
with the most popular approach. The formulation is systematically explained
within a rigorous variational framework. Subsequently, we present the
corresponding three-dimensional finite element discretization that leads to a
straightforward numerical implementation. Benchmark simulations in two
dimensions and three dimensions are then presented. The results show that while
an elastic stage and a damage threshold are ensured by the present model, good
agreement with the results reported in the literature can be obtained, where
such features are generally absent.
","[{'version': 'v1', 'created': 'Wed, 27 Feb 2019 20:02:12 GMT'}]",2019-03-01,"[['Ulloa', 'Jacinto', ''], ['Rodríguez', 'Patricio', ''], ['Samaniego', 'Cristóbal', ''], ['Samaniego', 'Esteban', '']]","['quasi-brittle materials', 'fracture', 'variational formulation', 'phase fields', 'gradient damage']"
2381,1610.00331,Victor Poupet,"Ana\""el Grandjean, Victor Poupet",Comparing 1D and 2D Real Time on Cellular Automata,,STACS 2015: 367-378,10.4230/LIPIcs.STACS.2015.367,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the influence of the dimension of cellular automata (CA) for real
time language recognition of one-dimensional languages with parallel input.
Specifically, we focus on the question of determining whether every language
that can be recognized in real time on a 2-dimensional CA working on the Moore
neighborhood can also be recognized in real time by a 1-dimensional CA working
on the standard two-way neighborhood.
  We show that 2-dimensional CA in real time can perform a linear number of
simulations of a 1-dimensional real time CA. If the two classes are equal then
the number of simulated instances can be polynomial.
","[{'version': 'v1', 'created': 'Sun, 2 Oct 2016 18:33:53 GMT'}]",2016-10-04,"[['Grandjean', 'Anaël', ''], ['Poupet', 'Victor', '']]","['Cellular automata', 'real time', 'language recognition']"
2382,1512.05247,Steven Schockaert,"Sofie De Clercq, Steven Schockaert, Martine De Cock, Ann Now\'e",Solving stable matching problems using answer set programming,"Under consideration in Theory and Practice of Logic Programming
  (TPLP). arXiv admin note: substantial text overlap with arXiv:1302.7251",Theory and Practice of Logic Programming 16 (2016) 247-268,10.1017/S147106841600003X,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since the introduction of the stable marriage problem (SMP) by Gale and
Shapley (1962), several variants and extensions have been investigated. While
this variety is useful to widen the application potential, each variant
requires a new algorithm for finding the stable matchings. To address this
issue, we propose an encoding of the SMP using answer set programming (ASP),
which can straightforwardly be adapted and extended to suit the needs of
specific applications. The use of ASP also means that we can take advantage of
highly efficient off-the-shelf solvers. To illustrate the flexibility of our
approach, we show how our ASP encoding naturally allows us to select optimal
stable matchings, i.e. matchings that are optimal according to some
user-specified criterion. To the best of our knowledge, our encoding offers the
first exact implementation to find sex-equal, minimum regret, egalitarian or
maximum cardinality stable matchings for SMP instances in which individuals may
designate unacceptable partners and ties between preferences are allowed.
  This paper is under consideration in Theory and Practice of Logic Programming
(TPLP).
","[{'version': 'v1', 'created': 'Wed, 16 Dec 2015 16:59:14 GMT'}]",2020-02-19,"[['De Clercq', 'Sofie', ''], ['Schockaert', 'Steven', ''], ['De Cock', 'Martine', ''], ['Nowé', 'Ann', '']]","['Answer Set Programming', 'Logic Rules', 'Stable Marriage Problem', 'OptimalStable Matchings']"
2383,1609.03385,Manolis Peponakis,Manolis Peponakis,"Libraries' Metadata as Data in the Era of the Semantic Web: Modeling a
  Repository of Master Theses and PhD Dissertations for the Web of Data","16 pages, 2 figures","Journal of Library Metadata, 13(4),330-348 (2013)",10.1080/19386389.2013.846618,,cs.DL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This study argues that metadata of library catalogs can stand autonomously,
providing valuable information detached from the resources they point to and,
therefore, could be used as data in the context of the Semantic Web. We present
an analysis of this perception followed by an implementation proposal for a
Master's thesis and PhD dissertation repository. The analysis builds on the
flexibility of the Resource Description Framework (RDF) and takes into account
the Functional Requirements for Bibliographic Records (FRBR) and Functional
Requirements for Authority Data (FRAD) in order to reveal the latent academic
network by linking its entities to a meaningful and computationally processable
set. Current library catalogs retrieve documents to find answers, whereas in
our approach catalogs can provide answers that could not be found in any
specific document.
","[{'version': 'v1', 'created': 'Mon, 12 Sep 2016 13:21:44 GMT'}]",2020-01-16,"[['Peponakis', 'Manolis', '']]","['Metadata', 'OPACs', 'Repositories', 'FRBR', 'FRAD', 'Semantic Web', 'Electronic  Theses  and  Dissertations  (ETDs)', 'Resource  Description Framework (RDF)']"
2384,1705.03303,Niek Tax,"Niek Tax, Xixi Lu, Natalia Sidorova, Dirk Fahland, Wil M. P. van der
  Aalst",The Imprecisions of Precision Measures in Process Mining,,"Information Processing Letters, 135 (2018), 1-8",10.1016/j.ipl.2018.01.013,,cs.DB cs.AI cs.LO cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In process mining, precision measures are used to quantify how much a process
model overapproximates the behavior seen in an event log. Although several
measures have been proposed throughout the years, no research has been done to
validate whether these measures achieve the intended aim of quantifying
over-approximation in a consistent way for all models and logs. This paper
fills this gap by postulating a number of axioms for quantifying precision
consistently for any log and any model. Further, we show through
counter-examples that none of the existing measures consistently quantifies
precision.
","[{'version': 'v1', 'created': 'Wed, 3 May 2017 11:50:45 GMT'}, {'version': 'v2', 'created': 'Tue, 16 May 2017 18:44:59 GMT'}]",2018-05-07,"[['Tax', 'Niek', ''], ['Lu', 'Xixi', ''], ['Sidorova', 'Natalia', ''], ['Fahland', 'Dirk', ''], ['van der Aalst', 'Wil M. P.', '']]","['Process mining', 'Formal languages and automata', 'Petri nets', 'Design of algorithms']"
2385,1706.03701,Eiman Kanjo Dr,"Eiman Kanjo, Daria Kuss, Chee Siang Ang","NotiMind: Utilizing Responses to Smart Phone Notifications as Affective
  sensors",,,10.1109/ACCESS.2017.2755661,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today's mobile phone users are faced with large numbers of notifications on
social media, ranging from new followers on Twitter and emails to messages
received from WhatsApp and Facebook. These digital alerts continuously disrupt
activities through instant calls for attention. This paper examines closely the
way everyday users interact with notifications and their impact on users'
emotion. Fifty users were recruited to download our application NotiMind and
use it over a five-week period. Users' phones collected thousands of social and
system notifications along with affect data collected via self-reported PANAS
tests three times a day. Results showed a noticeable correlation between
positive affective measures and keyboard activities. When large numbers of Post
and Remove notifications occur, a corresponding increase in negative affective
measures is detected. Our predictive model has achieved a good accuracy level
using three different classifiers ""in the wild"" (F-measure 74-78%
within-subject model, 72-76% global model). Our findings show that it is
possible to automatically predict when people are experiencing positive,
neutral or negative affective states based on interactions with notifications.
We also show how our findings open the door to a wide range of applications in
relation to emotion awareness on social and mobile communication.
","[{'version': 'v1', 'created': 'Thu, 8 Jun 2017 00:20:22 GMT'}]",2017-09-26,"[['Kanjo', 'Eiman', ''], ['Kuss', 'Daria', ''], ['Ang', 'Chee Siang', '']]","['Mobile Sensing', 'Affective Computing', 'Mobile Computing', 'Mobile Social media', 'Machine Learning']"
2386,0707.3622,Yaoyun Shi,"Igor Markov (University of Michigan) and Yaoyun Shi (University of
  Michigan)",Constant-degree graph expansions that preserve the treewidth,"12 pages, 6 figures, the main result used by quant-ph/0511070","Algorithmica, Volume 59, Number 4, 461-470,2011",10.1007/s00453-009-9312-5,,cs.DM cs.DS math.CO quant-ph,,"  Many hard algorithmic problems dealing with graphs, circuits, formulas and
constraints admit polynomial-time upper bounds if the underlying graph has
small treewidth. The same problems often encourage reducing the maximal degree
of vertices to simplify theoretical arguments or address practical concerns.
Such degree reduction can be performed through a sequence of splittings of
vertices, resulting in an _expansion_ of the original graph. We observe that
the treewidth of a graph may increase dramatically if the splittings are not
performed carefully. In this context we address the following natural question:
is it possible to reduce the maximum degree to a constant without substantially
increasing the treewidth?
  Our work answers the above question affirmatively. We prove that any simple
undirected graph G=(V, E) admits an expansion G'=(V', E') with the maximum
degree <= 3 and treewidth(G') <= treewidth(G)+1. Furthermore, such an expansion
will have no more than 2|E|+|V| vertices and 3|E| edges; it can be computed
efficiently from a tree-decomposition of G. We also construct a family of
examples for which the increase by 1 in treewidth cannot be avoided.
","[{'version': 'v1', 'created': 'Tue, 24 Jul 2007 19:56:27 GMT'}]",2011-11-04,"[['Markov', 'Igor', '', 'University of Michigan'], ['Shi', 'Yaoyun', '', 'University of\n  Michigan']]","['Treewidth', 'graph expansion', 'constant degree', 'ternary graph', 'algorithms']"
2387,1611.10187,Stefan Wagner,Stefan Wagner,"A Bayesian Network Approach to Assess and Predict Software Quality Using
  Activity-Based Quality Models (Conference Version)","9 pages, 3 figures","Proceedings of the 5th International Conference on Predictor
  Models in Software Engineering (PROMISE '09). ACM, 2009",10.1145/1540438.1540447,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Assessing and predicting the complex concept of software quality is still
challenging in practice as well as research. Activity-based quality models
break down this complex con- cept into more concrete definitions, more
precisely facts about the system, process and environment and their impact on
ac- tivities performed on and with the system. However, these models lack an
operationalisation that allows to use them in assessment and prediction of
quality. Bayesian Networks (BN) have been shown to be a viable means for
assessment and prediction incorporating variables with uncertainty. This paper
describes how activity-based quality models can be used to derive BN models for
quality assessment and pre- diction. The proposed approach is demonstrated in a
proof of concept using publicly available data.
","[{'version': 'v1', 'created': 'Wed, 30 Nov 2016 14:50:59 GMT'}]",2016-12-01,"[['Wagner', 'Stefan', '']]","['Activity-Based Quality Models', 'Bayesian Networks', 'QualityAssessment', 'Quality Prediction']"
2388,0708.3341,Noelle Carbonell,"Olivier Christmann (INRIA Rocquencourt / INRIA Lorraine - LORIA),
  No\""elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)","Browsing through 3D representations of unstructured picture collections:
  an empirical study",4 pages,"Dans Proceedings of ACM Working Conference on Advanced Visual
  Interfaces (AVI 2006), Venezia, Italy, May 23-26, 2006 - ACM Working
  Conference on Advanced Visual Interfaces (AVI 2006), Venezia : Italie (2006)",,,cs.HC,,"  The paper presents a 3D interactive representation of fairly large picture
collections which facilitates browsing through unstructured sets of icons or
pictures. Implementation of this representation implies choosing between two
visualization strategies: users may either manipulate the view (OV) or be
immersed in it (IV). The paper first presents this representation, then
describes an empirical study (17 participants) aimed at assessing the utility
and usability of each view. Subjective judgements in questionnaires and
debriefings were varied: 7 participants preferred the IV view, 4 the OV one,
and 6 could not choose between the two. Visual acuity and visual exploration
strategies seem to have exerted a greater influence on participants'
preferences than task performance or feeling of immersion.
","[{'version': 'v1', 'created': 'Fri, 24 Aug 2007 13:33:38 GMT'}]",2007-08-27,"[['Christmann', 'Olivier', '', 'INRIA Rocquencourt / INRIA Lorraine - LORIA'], ['Carbonell', 'Noëlle', '', 'INRIA Rocquencourt / INRIA Lorraine - LORIA']]","['3D visualization', 'immersive virtual reality', 'manipulation of 3D objects', 'picture browsing', 'photograph viewers', 'usability studies']"
2389,1901.10645,Sara Rouhani,"Sara Rouhani, Luke Butterworth, Adam D. Simmons, Darryl G. Humphery,
  and Ralph Deters",MediChainTM: A Secure Decentralized Medical Data Asset Management System,"2018 IEEE Confs on Internet of Things, Green Computing and
  Communications, Cyber, Physical and Social Computing, Smart Data, Blockchain,
  Computer and Information Technology, Congress on Cybermatics",,10.1109/Cybermatics_2018.2018.00258,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The set of distributed ledger architectures known as blockchain is best known
for cryptocurrency applications such as Bitcoin and Ethereum. These
permissionless block chains are showing the potential to be disruptive to the
financial services industry. Their broader adoption is likely to be limited by
the maximum block size, the cost of the Proof of Work consensus mechanism, and
the increasing size of any given chain overwhelming most of the participating
nodes. These factors have led to many cryptocurrency blockchains to become
centralized in the nodes with enough computing power and storage to be a
dominant miner and validator. Permissioned chains operate in trusted
environments and can, therefore, avoid the computationally expensive consensus
mechanisms. Permissioned chains are still susceptible to asset storage demands
and non-standard user interfaces that will impede their adoption. This paper
describes an approach to addressing these limitations: permissioned blockchain
that uses off-chain storage of the data assets and this is accessed through a
standard browser and mobile app. The implementation in the Hyperledger
framework is described as is an example use of patient-centered health data
management.
","[{'version': 'v1', 'created': 'Wed, 30 Jan 2019 02:22:07 GMT'}]",2019-01-31,"[['Rouhani', 'Sara', ''], ['Butterworth', 'Luke', ''], ['Simmons', 'Adam D.', ''], ['Humphery', 'Darryl G.', ''], ['Deters', 'Ralph', '']]","['blockchain', 'permissioned', 'data asset', 'application']"
2390,1505.06957,Nicolas Gillis,"Gabriella Casalino, Nicolas Gillis",Sequential Dimensionality Reduction for Extracting Localized Features,"24 pages, 12 figures. New numerical experiments on synthetic data
  sets, discussion about the convergence","Pattern Recoginition 63, pp. 15-29, 2017",10.1016/j.patcog.2016.09.006,,cs.CV cs.LG cs.NA math.NA stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linear dimensionality reduction techniques are powerful tools for image
analysis as they allow the identification of important features in a data set.
In particular, nonnegative matrix factorization (NMF) has become very popular
as it is able to extract sparse, localized and easily interpretable features by
imposing an additive combination of nonnegative basis elements. Nonnegative
matrix underapproximation (NMU) is a closely related technique that has the
advantage to identify features sequentially. In this paper, we propose a
variant of NMU that is particularly well suited for image analysis as it
incorporates the spatial information, that is, it takes into account the fact
that neighboring pixels are more likely to be contained in the same features,
and favors the extraction of localized features by looking for sparse basis
elements. We show that our new approach competes favorably with comparable
state-of-the-art techniques on synthetic, facial and hyperspectral image data
sets.
","[{'version': 'v1', 'created': 'Tue, 26 May 2015 14:06:16 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Jul 2016 06:44:58 GMT'}]",2016-10-07,"[['Casalino', 'Gabriella', ''], ['Gillis', 'Nicolas', '']]","['nonnegative matrix factorization', 'underapproximation', 'sparsity', 'hyperspectral imaging', 'dimensionality reduction', 'spatial information']"
2391,1812.05168,Luiz Capretz Dr.,"Tamer Mohamed Abdellatif, Luiz Fernando Capretz","Searching for Relevant Lessons Learned Using Hybrid Information
  Retrieval Classifiers: A Case Study in Software Engineering",,"International Workshop on Professional Search (ACM SIGIR - ProfS
  2018), pp. 12-17, Ann Arbor, Michigan, USA, July 2018",,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The lessons learned (LL) repository is one of the most valuable sources of
knowledge for a software organization. It can provide distinctive guidance
regarding previous working solutions for historical software management
problems, or former success stories to be followed. However, the unstructured
format of the LL repository makes it difficult to search using general queries,
which are manually inputted by project managers (PMs). For this reason, this
repository may often be overlooked despite the valuable information it
provides. Since the LL repository targets PMs, the search method should be
domain specific rather than generic as in the case of general web searching. In
previous work, we provided an automatic information retrieval based LL
classifier solution. In our solution, we relied on existing project management
artifacts in constructing the search query on-the-fly. In this paper, we extend
our previous work by examining the impact of the hybridization of multiple LL
classifiers, from our previous study, on performance. We employ two of the
hybridization techniques from the literature to construct the hybrid
classifiers. An industrial dataset of 212 LL records is used for validation.
The results show the superiority of the hybrid classifier over the top
achieving individual classifier, which reached 25%.
","[{'version': 'v1', 'created': 'Wed, 12 Dec 2018 21:45:33 GMT'}]",2018-12-14,"[['Abdellatif', 'Tamer Mohamed', ''], ['Capretz', 'Luiz Fernando', '']]","['Professional search', 'project management lessons learned', 'lessons learned recall', 'hybrid classifiers', 'information retrieval']"
2392,1807.03566,Irene C\'ordoba,Irene C\'ordoba and Juan de Lara,A modelling language for the effective design of Java annotations,"6 pages, 6 figures, 2015 conference","Proceedings of the 30th Annual ACM Symposium on Applied Computing
  (SAC 2015), 2087-2092, 2015",10.1145/2695664.2695717,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a new modelling language for the effective design of
Java annotations. Since their inclusion in the 5th edition of Java, annotations
have grown from a useful tool for the addition of meta-data to play a central
role in many popular software projects. Usually they are conceived as sets with
dependency and integrity constraints within them; however, the native support
provided by Java for expressing this design is very limited. To overcome its
deficiencies and make explicit the rich conceptual model which lies behind a
set of annotations, we propose a domain-specific modelling language. The
proposal has been implemented as an Eclipse plug-in, including an editor and an
integrated code generator that synthesises annotation processors. The language
has been tested using a real set of annotations from the Java Persistence API
(JPA). It has proven to cover a greater scope with respect to other related
work in different shared areas of application.
","[{'version': 'v1', 'created': 'Tue, 10 Jul 2018 10:59:37 GMT'}]",2019-10-02,"[['Córdoba', 'Irene', ''], ['de Lara', 'Juan', '']]","['Model Driven Engineering', 'Domain-Specific Languages', 'Codegeneration', 'Java', 'Annotations']"
2393,1708.07422,Saurabh Hukerikar,Saurabh Hukerikar and Christian Engelmann,"Resilience Design Patterns: A Structured Approach to Resilience at
  Extreme Scale","Supercomputing Frontiers and Innovations. arXiv admin note: text
  overlap with arXiv:1611.02717",,10.14529/jsfi170301,,cs.DC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reliability is a serious concern for future extreme-scale high-performance
computing (HPC) systems. While the HPC community has developed various
resilience solutions, the solution space remains fragmented. There are no
formal methods and metrics to integrate the various HPC resilience techniques
into composite solutions, nor are there methods to holistically evaluate the
adequacy and efficacy of such solutions in terms of their protection coverage,
and their performance & power efficiency characteristics. In this paper, we
develop a structured approach to the design, evaluation and optimization of HPC
resilience using the concept of design patterns. A design pattern is a general
repeatable solution to a commonly occurring problem. We identify the problems
caused by various types of faults, errors and failures in HPC systems and the
techniques used to deal with these events. Each well-known solution that
addresses a specific HPC resilience challenge is described in the form of a
pattern. We develop a complete catalog of such resilience design patterns,
which may be used as essential building blocks when designing and deploying
resilience solutions. We also develop a design framework that enhances a
designer's understanding the opportunities for integrating multiple patterns
across layers of the system stack and the important constraints during
implementation of the individual patterns. It is also useful for defining
mechanisms and interfaces to coordinate flexible fault management across
hardware and software components. The overall goal of this work is to establish
a systematic methodology for the design and evaluation of resilience
technologies in extreme-scale HPC systems that keep scientific applications
running to a correct solution in a timely and cost-efficient manner despite
frequent faults, errors, and failures of various types.
","[{'version': 'v1', 'created': 'Wed, 23 Aug 2017 04:21:22 GMT'}]",2017-11-01,"[['Hukerikar', 'Saurabh', ''], ['Engelmann', 'Christian', '']]","['high-performance computing', 'resilience', 'fault tolerance', 'design patterns']"
2394,1705.05139,Max Maass,"Max Maass, Pascal Wichmann, Henning Prid\""ohl, Dominik Herrmann","PrivacyScore: Improving Privacy and Security via Crowd-Sourced
  Benchmarks of Websites","14 pages, 4 figures. A german version of this paper discussing the
  legal aspects of this system is available at arXiv:1705.08889","Schweighofer E., Leitold H., Mitrakas A., Rannenberg K. (eds)
  Privacy Technologies and Policy. APF 2017. Lecture Notes in Computer Science,
  vol 10518. Springer, Cham",10.1007/978-3-319-67280-9_10,,cs.CR cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Website owners make conscious and unconscious decisions that affect their
users, potentially exposing them to privacy and security risks in the process.
In this paper we introduce PrivacyScore, an automated website scanning portal
that allows anyone to benchmark security and privacy features of multiple
websites. In contrast to existing projects, the checks implemented in
PrivacyScore cover a wider range of potential privacy and security issues.
Furthermore, users can control the ranking and analysis methodology. Therefore,
PrivacyScore can also be used by data protection authorities to perform
regularly scheduled compliance checks. In the long term we hope that the
transparency resulting from the published benchmarks creates an incentive for
website owners to improve their sites. The public availability of a first
version of PrivacyScore was announced at the ENISA Annual Privacy Forum in June
2017.
","[{'version': 'v1', 'created': 'Mon, 15 May 2017 09:54:17 GMT'}, {'version': 'v2', 'created': 'Fri, 30 Jun 2017 11:33:00 GMT'}, {'version': 'v3', 'created': 'Wed, 11 Oct 2017 08:37:45 GMT'}]",2017-10-12,"[['Maass', 'Max', ''], ['Wichmann', 'Pascal', ''], ['Pridöhl', 'Henning', ''], ['Herrmann', 'Dominik', '']]","['Scanner', 'Tracking', 'Compliance', 'Security', 'Privacy', 'Data protection']"
2395,1607.07558,Vignesh Prasad,"Vignesh Prasad, Karmesh Yadav, Rohitashva Singh Saurabh, Swapnil Daga,
  Nahas Pareekutty, K. Madhava Krishna, Balaraman Ravindran, Brojeshwar
  Bhowmick",Learning to Prevent Monocular SLAM Failure using Reinforcement Learning,"Accepted at the 11th Indian Conference on Computer Vision, Graphics
  and Image Processing (ICVGIP) 2018 More info can be found at the project page
  at https://robotics.iiit.ac.in/people/vignesh.prasad/SLAMSafePlanner.html and
  the supplementary video can be found at
  https://www.youtube.com/watch?v=420QmM_Z8vo",,10.1145/3293353.3293400,,cs.RO,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Monocular SLAM refers to using a single camera to estimate robot ego motion
while building a map of the environment. While Monocular SLAM is a well studied
problem, automating Monocular SLAM by integrating it with trajectory planning
frameworks is particularly challenging. This paper presents a novel formulation
based on Reinforcement Learning (RL) that generates fail safe trajectories
wherein the SLAM generated outputs do not deviate largely from their true
values. Quintessentially, the RL framework successfully learns the otherwise
complex relation between perceptual inputs and motor actions and uses this
knowledge to generate trajectories that do not cause failure of SLAM. We show
systematically in simulations how the quality of the SLAM dramatically improves
when trajectories are computed using RL. Our method scales effectively across
Monocular SLAM frameworks in both simulation and in real world experiments with
a mobile robot.
","[{'version': 'v1', 'created': 'Tue, 26 Jul 2016 06:53:38 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Sep 2016 07:02:24 GMT'}, {'version': 'v3', 'created': 'Mon, 17 Oct 2016 10:45:58 GMT'}, {'version': 'v4', 'created': 'Fri, 3 Mar 2017 05:36:11 GMT'}, {'version': 'v5', 'created': 'Wed, 8 Jan 2020 04:11:47 GMT'}]",2020-01-15,"[['Prasad', 'Vignesh', ''], ['Yadav', 'Karmesh', ''], ['Saurabh', 'Rohitashva Singh', ''], ['Daga', 'Swapnil', ''], ['Pareekutty', 'Nahas', ''], ['Krishna', 'K. Madhava', ''], ['Ravindran', 'Balaraman', ''], ['Bhowmick', 'Brojeshwar', '']]","['Reinforcement Learning', 'Robot Navigation', 'Monocular SLAM']"
2396,2205.10773,Timo Spinde,"Jan-David Krieger, Timo Spinde, Terry Ruas, Juhi Kulshrestha, Bela
  Gipp","A Domain-adaptive Pre-training Approach for Language Bias Detection in
  News",,"Proceedings of the ACM/IEEE-CS Joint Conference on Digital
  Libraries 2022 (JCDL)",10.1145/3529372.3530932,,cs.CL cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Media bias is a multi-faceted construct influencing individual behavior and
collective decision-making. Slanted news reporting is the result of one-sided
and polarized writing which can occur in various forms. In this work, we focus
on an important form of media bias, i.e. bias by word choice. Detecting biased
word choices is a challenging task due to its linguistic complexity and the
lack of representative gold-standard corpora. We present DA-RoBERTa, a new
state-of-the-art transformer-based model adapted to the media bias domain which
identifies sentence-level bias with an F1 score of 0.814. In addition, we also
train, DA-BERT and DA-BART, two more transformer models adapted to the bias
domain. Our proposed domain-adapted models outperform prior bias detection
approaches on the same data.
","[{'version': 'v1', 'created': 'Sun, 22 May 2022 08:18:19 GMT'}]",2022-05-24,"[['Krieger', 'Jan-David', ''], ['Spinde', 'Timo', ''], ['Ruas', 'Terry', ''], ['Kulshrestha', 'Juhi', ''], ['Gipp', 'Bela', '']]","['Media bias', 'news slant', 'neural classification', 'text analysis', 'domainadaptive']"
2397,1909.06192,Gareth Tyson,"Timm Boettger, Felix Cuadrado, Gianni Antichi, Eder Leao Fernandes,
  Gareth Tyson, Ignacio Castro, Steve Uhlig",An Empirical Study of the Cost of DNS-over-HTTPS,,ACM Internet Measurement Conference 2019 (IMC),,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  DNS is a vital component for almost every networked application. Originally
it was designed as an unencrypted protocol, making user security a concern.
DNS-over-HTTPS (DoH) is the latest proposal to make name resolution more
secure. In this paper we study the current DNS-over-HTTPS ecosystem, especially
the cost of the additional security. We start by surveying the current DoH
landscape by assessing standard compliance and supported features of public DoH
servers. We then compare different transports for secure DNS, to highlight the
improvements DoH makes over its predecessor, DNS-over-TLS (DoT). These
improvements explain in part the significantly larger take-up of DoH in
comparison to DoT. Finally, we quantify the overhead incurred by the additional
layers of the DoH transport and their impact on web page load times. We find
that these overheads only have limited impact on page load times, suggesting
that it is possible to obtain the improved security of DoH with only marginal
performance impact.
","[{'version': 'v1', 'created': 'Fri, 13 Sep 2019 13:01:06 GMT'}]",2019-09-16,"[['Boettger', 'Timm', ''], ['Cuadrado', 'Felix', ''], ['Antichi', 'Gianni', ''], ['Fernandes', 'Eder Leao', ''], ['Tyson', 'Gareth', ''], ['Castro', 'Ignacio', ''], ['Uhlig', 'Steve', '']]","['DNS-over-HTTPS', 'Transport', 'Performance']"
2398,1405.6130,Drashti Bhatt,"Ms.Drashti H. Bhatt, Mr.Kirit R. Rathod, Mr.Shardul J. Agravat",A Study of Local Binary Pattern Method for Facial Expression Detection,"3 pages, 2 images, International Journal of Computer Trends and
  Technology (IJCTT)","Ms.Drashti H. Bhatt , Mr.Kirit R. Rathod , Mr.Shardul J. Agravat.
  Article: A Study of Local Binary Pattern Method for Facial Expression
  Detection. IJCTT 7(3):151-153, January 2014. Published by Seventh Sense
  Research Group",10.14445/22312803/IJCTT-V7P143,,cs.CV,http://creativecommons.org/licenses/by/3.0/,"  Face detection is a basic task for expression recognition. The reliability of
face detection & face recognition approach has a major role on the performance
and usability of the entire system. There are several ways to undergo face
detection & recognition. We can use Image Processing Operations, various
classifiers, filters or virtual machines for the former. Various strategies are
being available for Facial Expression Detection. The field of facial expression
detection can have various applications along with its importance & can be
interacted between human being & computer. Many few options are available to
identify a face in an image in accurate & efficient manner. Local Binary
Pattern (LBP) based texture algorithms have gained popularity in these years.
LBP is an effective approach to have facial expression recognition & is a
feature-based approach.
","[{'version': 'v1', 'created': 'Tue, 4 Feb 2014 09:53:02 GMT'}]",2014-05-26,"[['Bhatt', 'Ms. Drashti H.', ''], ['Rathod', 'Mr. Kirit R.', ''], ['Agravat', 'Mr. Shardul J.', '']]","['Local Binary Patterns (LBP)', 'Face Recognition', 'Expression Detection']"
2399,0912.1839,Vishal Goyal,D. Sharma and V. Singh,"ICT in Universities of the Western Himalayan Region in India: Status,
  Performance- An Assessment","International Journal of Computer Science Issues, IJCSI Volume 6,
  Issue 2, pp44-52, November 2009",,10.5120/1111-1455,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The present paper describes a live project study carried out for the
universities located in the western Himalayan region of India in the year 2009.
The objective of this study is to undertake the task of assessment regarding
initiative, utilization of ICT resources, its performance and impact in these
higher educational institutions/universities. In order to answer these,
initially basic four- tier framework was prepared. Followed by a questionnaire
containing different ICT components 18 different groups like vision, planning,
implementation, ICT infrastructure and related activities exhibiting
performance. Primary data in the form of feedback on the five point scale, of
the questionnaire, was gathered from six universities of the region. A simple
statistical analysis was undertaken using weighted mean, to assess the ICT
initiative, status and performance of various universities. In the process, a
question related to Performance Indicator was identified from each group, whose
Coefficient of Correlation was calculated. This study suggests that a
progressive vision, planning and initiative regarding academic syllabi, ICT
infrastructure, used in training the skilled human resource, is going to have a
favourable impact through actual placement, research and play a dominant role
at the National and International level.
","[{'version': 'v1', 'created': 'Wed, 9 Dec 2009 19:00:01 GMT'}]",2015-05-14,"[['Sharma', 'D.', ''], ['Singh', 'V.', '']]","['Information and Communication Technology (ICT)', 'Initiative', 'Status', 'Performance', 'Assessment', 'Impact', 'Performance Indicator']"
2400,1705.04480,Robert Riemann,"Robert Riemann (DICE), St\'ephane Grumbach (DICE)",Distributed Protocols at the Rescue for Trustworthy Online Voting,,,10.5220/0006228504990505,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While online services emerge in all areas of life, the voting procedure in
many democracies remains paper-based as the security of current online voting
technology is highly disputed. We address the issue of trustworthy online
voting protocols and recall therefore their security concepts with its trust
assumptions. Inspired by the Bitcoin protocol, the prospects of distributed
online voting protocols are analysed. No trusted authority is assumed to ensure
ballot secrecy. Further, the integrity of the voting is enforced by all voters
themselves and without a weakest link, the protocol becomes more robust. We
introduce a taxonomy of notions of distribution in online voting protocols that
we apply on selected online voting protocols. Accordingly, blockchain-based
protocols seem to be promising for online voting due to their similarity with
paper-based protocols.
","[{'version': 'v1', 'created': 'Fri, 12 May 2017 09:21:36 GMT'}]",2017-05-15,"[['Riemann', 'Robert', '', 'DICE'], ['Grumbach', 'Stéphane', '', 'DICE']]","['distributed online voting', 'trust', 'distributed protocols', 'Bitcoin']"
2401,0808.2246,Philipp Mayr,"Boris Lauser, Gudrun Johannsen, Caterina Caracciolo, Johannes Keizer,
  Willem Robert van Hage, Philipp Mayr","Comparing human and automatic thesaurus mapping approaches in the
  agricultural domain","10 pages, Int'l Conf. on Dublin Core and Metadata Applications 2008",,10.18452/1251,,cs.DL,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Knowledge organization systems (KOS), like thesauri and other controlled
vocabularies, are used to provide subject access to information systems across
the web. Due to the heterogeneity of these systems, mapping between
vocabularies becomes crucial for retrieving relevant information. However,
mapping thesauri is a laborious task, and thus big efforts are being made to
automate the mapping process. This paper examines two mapping approaches
involving the agricultural thesaurus AGROVOC, one machine-created and one human
created. We are addressing the basic question ""What are the pros and cons of
human and automatic mapping and how can they complement each other?"" By
pointing out the difficulties in specific cases or groups of cases and grouping
the sample into simple and difficult types of mappings, we show the limitations
of current automatic methods and come up with some basic recommendations on
what approach to use when.
","[{'version': 'v1', 'created': 'Sat, 16 Aug 2008 10:10:21 GMT'}]",2019-01-15,"[['Lauser', 'Boris', ''], ['Johannsen', 'Gudrun', ''], ['Caracciolo', 'Caterina', ''], ['Keizer', 'Johannes', ''], ['van Hage', 'Willem Robert', ''], ['Mayr', 'Philipp', '']]","['mapping thesauri', 'knowledge organization systems', 'intellectual mapping', 'ontology matching']"
2402,1806.07449,Mat\'u\v{s} Sul\'ir,"Mat\'u\v{s} Sul\'ir and Jaroslav Porub\""an",Augmenting Source Code Lines with Sample Variable Values,,"ICPC '18: 26th IEEE/ACM International Conference on Program
  Comprehension, ACM, 2018",10.1145/3196321.3196364,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Source code is inherently abstract, which makes it difficult to understand.
Activities such as debugging can reveal concrete runtime details, including the
values of variables. However, they require that a developer explicitly requests
these data for a specific execution moment. We present a simple approach,
RuntimeSamp, which collects sample variable values during normal executions of
a program by a programmer. These values are then displayed in an ambient way at
the end of each line in the source code editor. We discuss questions which
should be answered for this approach to be usable in practice, such as how to
efficiently record the values and when to display them. We provide partial
answers to these questions and suggest future research directions.
","[{'version': 'v1', 'created': 'Tue, 19 Jun 2018 20:05:43 GMT'}]",2018-06-21,"[['Sulír', 'Matúš', ''], ['Porubän', 'Jaroslav', '']]","['integrated development environment (IDE)', 'source code augmentation', 'examples', 'variables', 'dynamic analysis']"
2403,1703.00304,Angelos Valsamis,"Angelos Valsamis, Alexandros Psychas, Fotis Aisopos, Andreas Menychtas
  and Theodora Varvarigou","Second Screen User Profiling and Multi-level Smart Recommendations in
  the context of Social TVs","In: Wu TT., Gennari R., Huang YM., Xie H., Cao Y. (eds) Emerging
  Technologies for Education. SETE 2016","Lecture Notes in Computer Science, vol 10108. Springer, Cham,
  2017, pp 514-525",10.1007/978-3-319-52836-6_55,,cs.MM cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the context of Social TV, the increasing popularity of first and second
screen users, interacting and posting content online, illustrates new business
opportunities and related technical challenges, in order to enrich user
experience on such environments. SAM (Socializing Around Media) project uses
Social Media-connected infrastructure to deal with the aforementioned
challenges, providing intelligent user context management models and mechanisms
capturing social patterns, to apply collaborative filtering techniques and
personalized recommendations towards this direction. This paper presents the
Context Management mechanism of SAM, running in a Social TV environment to
provide smart recommendations for first and second screen content. Work
presented is evaluated using real movie rating dataset found online, to
validate the SAM's approach in terms of effectiveness as well as efficiency.
","[{'version': 'v1', 'created': 'Wed, 1 Mar 2017 14:06:44 GMT'}]",2017-03-02,"[['Valsamis', 'Angelos', ''], ['Psychas', 'Alexandros', ''], ['Aisopos', 'Fotis', ''], ['Menychtas', 'Andreas', ''], ['Varvarigou', 'Theodora', '']]","['Second Screen', 'Social TV', 'Social Media', 'Context Management', 'Personalized Recommendations']"
2404,1611.09230,Stefan Wagner,"Stefan Wagner and Andreas Goeb and Lars Heinemann and Michael Kl\""as
  and Constanza Lampasona and Klaus Lochmann and Alois Mayr and Reinhold
  Pl\""osch and Andreas Seidl and Jonathan Streit and Adam Trendowicz","Operationalised product quality models and assessment: The Quamoco
  approach","41 pages, 14 figures","Information and Software Technology, Volume 62, June 2015, pages
  101-123",10.1016/j.infsof.2015.02.009,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software quality models provide either abstract quality characteristics or
concrete quality measurements; there is no seamless integration of these two
aspects. Reasons for this include the complexity of quality and the various
quality profiles in different domains which make it difficult to build
operationalised quality models. In the project Quamoco, we developed a
comprehensive approach for closing this gap. It combined constructive research,
which involved quality experts from academia and industry in workshops, sprint
work and reviews, with empirical studies. All deliverables within the project
were peer-reviewed by two project members from a different area. Most
deliverables were developed in two or three iterations and underwent an
evaluation. We contribute a comprehensive quality modelling and assessment
approach: (1) A meta quality model defines the structure of operationalised
quality models. It includes the concept of a product factor, which bridges the
gap between concrete measurements and abstract quality aspects, and allows
modularisation to create modules for specific domains. (2) A largely
technology-independent base quality model reduces the effort and complexity of
building quality models for specific domains. For Java and C# systems, we
refined it with about 300 concrete product factors and 500 measures. (3) A
concrete and comprehensive quality assessment approach makes use of the
concepts in the meta-model. (4) An empirical evaluation of the above results
using real-world software systems. (5) The extensive, open-source tool support
is in a mature state. (6) The model for embedded software systems is a
proof-of-concept for domain-specific quality models. We provide a broad basis
for the development and application of quality models in industrial practice as
well as a basis for further extension, validation and comparison with other
approaches in research.
","[{'version': 'v1', 'created': 'Mon, 28 Nov 2016 16:36:25 GMT'}]",2016-11-29,"[['Wagner', 'Stefan', ''], ['Goeb', 'Andreas', ''], ['Heinemann', 'Lars', ''], ['Kläs', 'Michael', ''], ['Lampasona', 'Constanza', ''], ['Lochmann', 'Klaus', ''], ['Mayr', 'Alois', ''], ['Plösch', 'Reinhold', ''], ['Seidl', 'Andreas', ''], ['Streit', 'Jonathan', ''], ['Trendowicz', 'Adam', '']]","['Quality Model', 'Product Quality', 'Quality Assessment']"
2405,1909.07618,Jingjing Li,"Jingjing Li and Erpeng Chen and Zhengming Ding and Lei Zhu and Ke Lu
  and Zi Huang",Cycle-consistent Conditional Adversarial Transfer Networks,Codes at github.com/lijin118/3CATN,ACM Multimedia 2019,,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Domain adaptation investigates the problem of cross-domain knowledge transfer
where the labeled source domain and unlabeled target domain have distinctive
data distributions. Recently, adversarial training have been successfully
applied to domain adaptation and achieved state-of-the-art performance.
However, there is still a fatal weakness existing in current adversarial models
which is raised from the equilibrium challenge of adversarial training.
Specifically, although most of existing methods are able to confuse the domain
discriminator, they cannot guarantee that the source domain and target domain
are sufficiently similar. In this paper, we propose a novel approach named {\it
cycle-consistent conditional adversarial transfer networks} (3CATN) to handle
this issue. Our approach takes care of the domain alignment by leveraging
adversarial training. Specifically, we condition the adversarial networks with
the cross-covariance of learned features and classifier predictions to capture
the multimodal structures of data distributions. However, since the classifier
predictions are not certainty information, a strong condition with the
predictions is risky when the predictions are not accurate. We, therefore,
further propose that the truly domain-invariant features should be able to be
translated from one domain to the other. To this end, we introduce two feature
translation losses and one cycle-consistent loss into the conditional
adversarial domain adaptation networks. Extensive experiments on both classical
and large-scale datasets verify that our model is able to outperform previous
state-of-the-arts with significant improvements.
","[{'version': 'v1', 'created': 'Tue, 17 Sep 2019 07:14:26 GMT'}]",2019-09-18,"[['Li', 'Jingjing', ''], ['Chen', 'Erpeng', ''], ['Ding', 'Zhengming', ''], ['Zhu', 'Lei', ''], ['Lu', 'Ke', ''], ['Huang', 'Zi', '']]","['domain adaptation', 'adversarial training', 'transfer learning']"
2406,1405.2664,Ji Zhao,"Ji Zhao, Deyu Meng",FastMMD: Ensemble of Circular Discrepancy for Efficient Two-Sample Test,,"Neural Computation, 2015 June, Vol. 27, No. 6, Pages 1345-1372",10.1162/NECO_a_00732,,cs.AI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The maximum mean discrepancy (MMD) is a recently proposed test statistic for
two-sample test. Its quadratic time complexity, however, greatly hampers its
availability to large-scale applications. To accelerate the MMD calculation, in
this study we propose an efficient method called FastMMD. The core idea of
FastMMD is to equivalently transform the MMD with shift-invariant kernels into
the amplitude expectation of a linear combination of sinusoid components based
on Bochner's theorem and Fourier transform (Rahimi & Recht, 2007). Taking
advantage of sampling of Fourier transform, FastMMD decreases the time
complexity for MMD calculation from $O(N^2 d)$ to $O(L N d)$, where $N$ and $d$
are the size and dimension of the sample set, respectively. Here $L$ is the
number of basis functions for approximating kernels which determines the
approximation accuracy. For kernels that are spherically invariant, the
computation can be further accelerated to $O(L N \log d)$ by using the Fastfood
technique (Le et al., 2013). The uniform convergence of our method has also
been theoretically proved in both unbiased and biased estimates. We have
further provided a geometric explanation for our method, namely ensemble of
circular discrepancy, which facilitates us to understand the insight of MMD,
and is hopeful to help arouse more extensive metrics for assessing two-sample
test. Experimental results substantiate that FastMMD is with similar accuracy
as exact MMD, while with faster computation speed and lower variance than the
existing MMD approximation methods.
","[{'version': 'v1', 'created': 'Mon, 12 May 2014 08:20:21 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Jun 2015 12:06:14 GMT'}]",2015-06-19,"[['Zhao', 'Ji', ''], ['Meng', 'Deyu', '']]","['Maximum mean discrepancy (MMD)', 'two-sample test', 'Fastfood', 'ran']"
2407,1606.07950,Diego Amancio Dr.,Edilson A. Correa Jr. and Alneu de Andrade Lopes and Diego R. Amancio,Word sense disambiguation: a complex network approach,,"Information Sciences 442-443, pages 103-113 (2018)",10.1016/j.ins.2018.02.047,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, concepts and methods of complex networks have been employed
to tackle the word sense disambiguation (WSD) task by representing words as
nodes, which are connected if they are semantically similar. Despite the
increasingly number of studies carried out with such models, most of them use
networks just to represent the data, while the pattern recognition performed on
the attribute space is performed using traditional learning techniques. In
other words, the structural relationship between words have not been explicitly
used in the pattern recognition process. In addition, only a few investigations
have probed the suitability of representations based on bipartite networks and
graphs (bigraphs) for the problem, as many approaches consider all possible
links between words. In this context, we assess the relevance of a bipartite
network model representing both feature words (i.e. the words characterizing
the context) and target (ambiguous) words to solve ambiguities in written
texts. Here, we focus on the semantical relationships between these two type of
words, disregarding the relationships between feature words. In special, the
proposed method not only serves to represent texts as graphs, but also
constructs a structure on which the discrimination of senses is accomplished.
Our results revealed that the proposed learning algorithm in such bipartite
networks provides excellent results mostly when topical features are employed
to characterize the context. Surprisingly, our method even outperformed the
support vector machine algorithm in particular cases, with the advantage of
being robust even if a small training dataset is available. Taken together, the
results obtained here show that the proposed representation/classification
method might be useful to improve the semantical characterization of written
texts.
","[{'version': 'v1', 'created': 'Sat, 25 Jun 2016 19:08:19 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Feb 2018 14:48:30 GMT'}]",2018-02-27,"[['Correa', 'Edilson A.', 'Jr.'], ['Lopes', 'Alneu de Andrade', ''], ['Amancio', 'Diego R.', '']]","['complex networks', 'bipartite graphs', 'word sense disambiguation', 'bipartite']"
2408,0911.2280,Bal\'azs Csan\'ad Cs\'aji,"Bal\'azs Csan\'ad Cs\'aji, Rapha\""el M. Jungers, and Vincent D.
  Blondel",PageRank Optimization by Edge Selection,"30 pages, 3 figures","Discrete Applied Mathematics, Volume 169, 2014, Pages 73-87",10.1016/j.dam.2014.01.007,,cs.DS cs.CC cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The importance of a node in a directed graph can be measured by its PageRank.
The PageRank of a node is used in a number of application contexts - including
ranking websites - and can be interpreted as the average portion of time spent
at the node by an infinite random walk. We consider the problem of maximizing
the PageRank of a node by selecting some of the edges from a set of edges that
are under our control. By applying results from Markov decision theory, we show
that an optimal solution to this problem can be found in polynomial time. Our
core solution results in a linear programming formulation, but we also provide
an alternative greedy algorithm, a variant of policy iteration, which runs in
polynomial time, as well. Finally, we show that, under the slight modification
for which we are given mutually exclusive pairs of edges, the problem of
PageRank optimization becomes NP-hard.
","[{'version': 'v1', 'created': 'Thu, 12 Nov 2009 12:57:09 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Jan 2012 09:09:34 GMT'}]",2014-05-22,"[['Csáji', 'Balázs Csanád', ''], ['Jungers', 'Raphaël M.', ''], ['Blondel', 'Vincent D.', '']]","['PageRank', 'computational complexity', 'stochastic shortest path']"
2409,1907.12690,Byunghyun Ban,"Byunghyun Ban, Soobin Kim","Control of nonlinear, complex and black-boxed greenhouse system with
  reinforcement learning","4 pages, 2 figures, 1 table. 2 pages of supplementary information.
  Published on ICTC 2017","2017 International Conference on Information and Communication
  Technology Convergence (ICTC)",10.1109/ICTC.2017.8190813,,cs.LG cs.AI cs.SY eess.SY stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern control theories such as systems engineering approaches try to solve
nonlinear system problems by revelation of causal relationship or
co-relationship among the components; most of those approaches focus on control
of sophisticatedly modeled white-boxed systems. We suggest an application of
actor-critic reinforcement learning approach to control a nonlinear, complex
and black-boxed system. We demonstrated this approach on artificial green-house
environment simulator all of whose control inputs have several side effects so
human cannot figure out how to control this system easily. Our approach
succeeded to maintain the circumstance at least 20 times longer than PID and
Deep Q Learning.
","[{'version': 'v1', 'created': 'Tue, 30 Jul 2019 00:06:47 GMT'}]",2021-01-07,"[['Ban', 'Byunghyun', ''], ['Kim', 'Soobin', '']]","['System Engineering', 'Deep Learning', 'Machine']"
2410,cs/0602040,Pierre-Alain Masson,"Samir Chouali (LIFC), Jacques Julliand (LIFC), Pierre-Alain Masson
  (LIFC), Fran\c{c}oise Bellegarde (LIFC)","PLTL Partitioned Model Checking for Reactive Systems under Fairness
  Assumptions",,ACM Transactions on Embedded Computing Systems 4(2) (2005) 267-301,10.1145/1067915.1067918,,cs.LO,,"  We are interested in verifying dynamic properties of finite state reactive
systems under fairness assumptions by model checking. The systems we want to
verify are specified through a top-down refinement process. In order to deal
with the state explosion problem, we have proposed in previous works to
partition the reachability graph, and to perform the verification on each part
separately. Moreover, we have defined a class, called Bmod, of dynamic
properties that are verifiable by parts, whatever the partition. We decide if a
property P belongs to Bmod by looking at the form of the Buchi automaton that
accepts the negation of P. However, when a property P belongs to Bmod, the
property f => P, where f is a fairness assumption, does not necessarily belong
to Bmod. In this paper, we propose to use the refinement process in order to
build the parts on which the verification has to be performed. We then show
that with such a partition, if a property P is verifiable by parts and if f is
the expression of the fairness assumptions on a system, then the property f =>
P is still verifiable by parts. This approach is illustrated by its application
to the chip card protocol T=1 using the B engineering design language.
","[{'version': 'v1', 'created': 'Fri, 10 Feb 2006 14:48:29 GMT'}]",2011-11-10,"[['Chouali', 'Samir', '', 'LIFC'], ['Julliand', 'Jacques', '', 'LIFC'], ['Masson', 'Pierre-Alain', '', 'LIFC'], ['Bellegarde', 'Françoise', '', 'LIFC']]","['Refinement design', 'PLTL model checking', 'fairness assumptions', 'out-of-core model checking']"
2411,2005.10960,Harini Suresh,"Harini Suresh, Natalie Lao, Ilaria Liccardi","Misplaced Trust: Measuring the Interference of Machine Learning in Human
  Decision-Making",10 pages,"12th ACM Conference on Web Science, July 6-10, 2020, Southampton,
  United Kingdom",10.1145/3394231.3397922,,cs.HC cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  ML decision-aid systems are increasingly common on the web, but their
successful integration relies on people trusting them appropriately: they
should use the system to fill in gaps in their ability, but recognize signals
that the system might be incorrect. We measured how people's trust in ML
recommendations differs by expertise and with more system information through a
task-based study of 175 adults. We used two tasks that are difficult for
humans: comparing large crowd sizes and identifying similar-looking animals.
Our results provide three key insights: (1) People trust incorrect ML
recommendations for tasks that they perform correctly the majority of the time,
even if they have high prior knowledge about ML or are given information
indicating the system is not confident in its prediction; (2) Four different
types of system information all increased people's trust in recommendations;
and (3) Math and logic skills may be as important as ML for decision-makers
working with ML recommendations.
","[{'version': 'v1', 'created': 'Fri, 22 May 2020 01:22:58 GMT'}]",2020-05-25,"[['Suresh', 'Harini', ''], ['Lao', 'Natalie', ''], ['Liccardi', 'Ilaria', '']]","['machine learning', 'trust', 'education', 'recommendations']"
2412,2102.09346,Iuliana Marin,"Iuliana Marin, Andrei Vasilateanu, Bujor Pavaloiu, Nicolae Goga","User Requirements and Analysis of Preeclampsia Detection done through a
  Smart Bracelet",,"12th International Technology, Education and Development
  Conference 2018",10.21125/inted.2018.2080,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Medical students along with the medical staff have to monitor the state of
the patients by using modern devices which have to offer precise results in a
short amount of time, so that the intervention to be done as soon as possible.
E-learning systems for blood pressure monitoring are used and new methods of
patient observation, evaluation and treatment are applied compared to classical
intervention. Based on this, medical students can improve their knowledge for
the practical training.
  In the medical activities specialized devices occupy an important place. A
device that can monitor the blood pressure is a smart bracelet that
incorporates a pressure sensor along the wrist for continuous recording of
blood pressure values. This enables the prediction of the emergency disorders
using a decision support system. It facilitates the learning of new
intervention approaches and boosts the responsiveness among learners. According
to the World Health Organization, hypertensive disorders affect about 10% of
pregnant women worldwide and are an important cause of disability and long-term
death among mothers and children. This paper is based on a survey completed by
persons of different ages and having various specialization domains regarding
the use of smart bracelets for detecting preeclampsia. The aim is to decide
upon its popularity among people and to determine the user requirements. The
pregnant women will be constantly monitored, doctors can update the diagnosis
of the patient. The medical students can learn from the critical situations and
benefit from these cases while learning. The results of the survey showed that
most of the interviewed persons consider the existence of such a device to be
very useful, mostly the female individuals would feel more comfortable to have
their blood pressure monitored during pregnancy.
","[{'version': 'v1', 'created': 'Fri, 29 Jan 2021 17:23:36 GMT'}]",2021-02-19,"[['Marin', 'Iuliana', ''], ['Vasilateanu', 'Andrei', ''], ['Pavaloiu', 'Bujor', ''], ['Goga', 'Nicolae', '']]","['Preeclampsia', 'smart bracelet', 'sensor', 'pregnant women', 'prediction']"
2413,1804.02443,Neil Ernst,Neil A. Ernst,Bayesian Hierarchical Modelling for Tailoring Metric Thresholds,"Short paper, published at MSR '18: 15th International Conference on
  Mining Software Repositories May 28--29, 2018, Gothenburg, Sweden",,10.1145/3196398.3196443,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software is highly contextual. While there are cross-cutting `global'
lessons, individual software projects exhibit many `local' properties. This
data heterogeneity makes drawing local conclusions from global data dangerous.
A key research challenge is to construct locally accurate prediction models
that are informed by global characteristics and data volumes. Previous work has
tackled this problem using clustering and transfer learning approaches, which
identify locally similar characteristics. This paper applies a simpler approach
known as Bayesian hierarchical modeling. We show that hierarchical modeling
supports cross-project comparisons, while preserving local context. To
demonstrate the approach, we conduct a conceptual replication of an existing
study on setting software metrics thresholds. Our emerging results show our
hierarchical model reduces model prediction error compared to a global approach
by up to 50%.
","[{'version': 'v1', 'created': 'Fri, 6 Apr 2018 20:04:24 GMT'}]",2018-04-10,"[['Ernst', 'Neil A.', '']]","['hierarchical models', 'metrics thresholds', 'probabilistic programming']"
2414,1705.09835,Jianfeng Guan,"Jianfeng Guan, Vishal Sharma, Ilsun You, Mohammad Atiquzzaman",Extension of MIH to Support FPMIPv6 for Optimized Heterogeneous Handover,"14 pages, 17 figures, 5 tables",Future Gener. Comput. Syst. 97: 775-791 (2019),10.1016/j.future.2019.03.031,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fast handover for Proxy Mobile IPv6 (FPMIPv6) can reduce handover delay and
packet loss compared with Proxy Mobile IPv6 (PMIPv6). However, FPMIPv6 still
cannot handle heterogeneous handovers due to the lack of unified Layer 2
triggering mechanism along with the booming of emerging wireless technologies.
Media Independent Handover (MIH) can provide heterogeneous handover support,
and a lot of integration solutions have been proposed for it. However, most of
them focus on the integration of MIH and PMIPv6, and require the additional
mechanisms, which are out of the scope the MIH and difficult to standardize the
operations. Therefore, in this paper, we propose an integration solution of
FPMIPv6 and MIH by extending the existing MIH standards, and adopt the city
section mobility model to analyze its performance under different scenarios.
The analytical results show that the proposed solution is capable of reducing
the handover delay and the signaling cost compared with the standard as well as
the fast handover solutions.
","[{'version': 'v1', 'created': 'Sat, 27 May 2017 16:10:10 GMT'}]",2022-02-15,"[['Guan', 'Jianfeng', ''], ['Sharma', 'Vishal', ''], ['You', 'Ilsun', ''], ['Atiquzzaman', 'Mohammad', '']]","['MIH', 'FPMIPv6', 'Integration', 'Heterogeneoushandover', 'fast handover']"
2415,1606.07239,Samuel St-Jean,"Samuel St-Jean, Pierrick Coup\'e and Maxime Descoteaux","Non Local Spatial and Angular Matching : Enabling higher spatial
  resolution diffusion MRI datasets through adaptive denoising","Code available : https://github.com/samuelstjean/nlsam Datasets
  available : https://github.com/samuelstjean/nlsam_data, Medical Image
  Analysis, 2016","Medical Image Analysis , Volume 32 , 115 - 130, 2016",10.1016/j.media.2016.02.010,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Diffusion magnetic resonance imaging datasets suffer from low Signal-to-Noise
Ratio, especially at high b-values. Acquiring data at high b-values contains
relevant information and is now of great interest for microstructural and
connectomics studies. High noise levels bias the measurements due to the
non-Gaussian nature of the noise, which in turn can lead to a false and biased
estimation of the diffusion parameters. Additionally, the usage of in-plane
acceleration techniques during the acquisition leads to a spatially varying
noise distribution, which depends on the parallel acceleration method
implemented on the scanner. This paper proposes a novel diffusion MRI denoising
technique that can be used on all existing data, without adding to the scanning
time. We first apply a statistical framework to convert the noise to Gaussian
distributed noise, effectively removing the bias. We then introduce a spatially
and angular adaptive denoising technique, the Non Local Spatial and Angular
Matching (NLSAM) algorithm. Each volume is first decomposed in small 4D
overlapping patches to capture the structure of the diffusion data and a
dictionary of atoms is learned on those patches. A local sparse decomposition
is then found by bounding the reconstruction error with the local noise
variance. We compare against three other state-of-the-art denoising methods and
show quantitative local and connectivity results on a synthetic phantom and on
an in-vivo high resolution dataset. Overall, our method restores perceptual
information, removes the noise bias in common diffusion metrics, restores the
extracted peaks coherence and improves reproducibility of tractography. Our
work paves the way for higher spatial resolution acquisition of diffusion MRI
datasets, which could in turn reveal new anatomical details that are not
discernible at the spatial resolution currently used by the diffusion MRI
community.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2016 09:28:29 GMT'}]",2016-06-27,"[['St-Jean', 'Samuel', ''], ['Coupé', 'Pierrick', ''], ['Descoteaux', 'Maxime', '']]","['Diffusion MRI', 'Denoising', 'Block Matching', 'Noise bias', 'Dictionary learning']"
2416,0706.2010,Anne Broadbent,Anne Broadbent and Alain Tapp,Information-theoretic security without an honest majority,"15 pages, to appear in Proceedings of ASIACRYPT 2007",Proceedings of ASIACRYPT 2007 pp. 410-426,10.1007/978-3-540-76900-2_25,,cs.CR,,"  We present six multiparty protocols with information-theoretic security that
tolerate an arbitrary number of corrupt participants. All protocols assume
pairwise authentic private channels and a broadcast channel (in a single case,
we require a simultaneous broadcast channel). We give protocols for veto, vote,
anonymous bit transmission, collision detection, notification and anonymous
message transmission. Not assuming an honest majority, in most cases, a single
corrupt participant can make the protocol abort. All protocols achieve
functionality never obtained before without the use of either computational
assumptions or of an honest majority.
","[{'version': 'v1', 'created': 'Wed, 13 Jun 2007 23:05:40 GMT'}]",2016-01-06,"[['Broadbent', 'Anne', ''], ['Tapp', 'Alain', '']]","['multiparty computation', 'anonymous message transmission', 'election protocols', 'collision detection', 'dining cryptographers', 'information-theoretic security']"
2417,2105.08475,Anton Korinek,Katya Klinova and Anton Korinek,AI and Shared Prosperity,,"Proceedings of the 2021 AAAI/ACM Conference on AI, Ethics, and
  Society (AIES '21)",10.1145/3461702.3462619,,cs.AI cs.CY econ.GN q-fin.EC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Future advances in AI that automate away human labor may have stark
implications for labor markets and inequality. This paper proposes a framework
to analyze the effects of specific types of AI systems on the labor market,
based on how much labor demand they will create versus displace, while taking
into account that productivity gains also make society wealthier and thereby
contribute to additional labor demand. This analysis enables ethically-minded
companies creating or deploying AI systems as well as researchers and
policymakers to take into account the effects of their actions on labor markets
and inequality, and therefore to steer progress in AI in a direction that
advances shared prosperity and an inclusive economic future for all of
humanity.
","[{'version': 'v1', 'created': 'Tue, 18 May 2021 12:37:18 GMT'}]",2021-05-19,"[['Klinova', 'Katya', ''], ['Korinek', 'Anton', '']]","['job displacement', 'inequality', 'shared prosperity', 'steering technological progress', 'automation', 'socio-technical systems']"
2418,1404.2155,Saeed Doostali,Saeed Doostali,"An Efficient Solution for Model Checking Abstract State Machine Using
  Bogor","57 pages, 25 figures, 4 tables, Technical Report","V. Rafe, S. Doostali, ASM2Bogor: An approach for verification of
  models specified through Asmeta language, Journal of Visual Languages and
  Computing 23 (5) (2012) 287-298",10.1016/j.jvlc.2012.05.002,,cs.SE,http://creativecommons.org/licenses/publicdomain/,"  Nowadays, publish subscribe and event based architecture are frequently used
for developing loosely coupled distributed systems. Hence, it is desirable to
find a proper solution to specify different systems through these
architectures. Abstract state machine (ASM) is a useful means to visually and
formally model publish subscribe and event based architectures. However,
modeling per se is not enough since the designers want to be able to verify the
designed models. As the model checking is a proper approach to verify software
and hardware systems. In this paper, we present an approach to verify ASM
models specified in terms of AsmetaL language using Bogor. In our approach, the
AsmetaL specification is automatically encoded to BIR, the input language of
the Bogor.
","[{'version': 'v1', 'created': 'Mon, 7 Apr 2014 06:47:45 GMT'}]",2014-04-09,"[['Doostali', 'Saeed', '']]","['model checking', 'Abstract state machine', 'Bogor', 'AsmetaL', 'Linear temporal logic']"
2419,1212.2044,Gabriel Kronberger,"Gabriel Kronberger, Stefan Fink, Michael Kommenda and Michael
  Affenzeller",Macro-Economic Time Series Modeling and Interaction Networks,"The original publication is available at
  http://link.springer.com/chapter/10.1007/978-3-642-20520-0_11","Applications of Evolutionary Computation, LNCS 6625 (Springer
  Berlin Heidelberg), pp. 101-110 (2011)",10.1007/978-3-642-20520-0_11,,cs.NE stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Macro-economic models describe the dynamics of economic quantities. The
estimations and forecasts produced by such models play a substantial role for
financial and political decisions. In this contribution we describe an approach
based on genetic programming and symbolic regression to identify variable
interactions in large datasets. In the proposed approach multiple symbolic
regression runs are executed for each variable of the dataset to find
potentially interesting models. The result is a variable interaction network
that describes which variables are most relevant for the approximation of each
variable of the dataset. This approach is applied to a macro-economic dataset
with monthly observations of important economic indicators in order to identify
potentially interesting dependencies of these indicators. The resulting
interaction network of macro-economic indicators is briefly discussed and two
of the identified models are presented in detail. The two models approximate
the help wanted index and the CPI inflation in the US.
","[{'version': 'v1', 'created': 'Mon, 10 Dec 2012 12:04:58 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Sep 2013 16:58:12 GMT'}]",2013-09-24,"[['Kronberger', 'Gabriel', ''], ['Fink', 'Stefan', ''], ['Kommenda', 'Michael', ''], ['Affenzeller', 'Michael', '']]","['Genetic programming', 'Finance', 'Econometrics']"
2420,1412.5477,Meenakshi Lakshmanan,"S V Kasmir Raja, V Rajitha and Lakshmanan Meenakshi","Computational Model to Generate Case-Inflected Forms of Masculine Nouns
  for Word Search in Sanskrit E-Text",,"Journal of Computer Science (ISSN Print: 1549-3636, ISSN Online:
  1552-6607), December 2014, Volume 10, Issue 11, Pages 2269-2283",10.3844/jcssp.2014.2260.2268,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of word search in Sanskrit is inseparable from complexities that
include those caused by euphonic conjunctions and case-inflections. The
case-inflectional forms of a noun normally number 24 owing to the fact that in
Sanskrit there are eight cases and three numbers-singular, dual and plural. The
traditional method of generating these inflectional forms is rather elaborate
owing to the fact that there are differences in the forms generated between
even very similar words and there are subtle nuances involved. Further, it
would be a cumbersome exercise to generate and search for 24 forms of a word
during a word search in a large text, using the currently available
case-inflectional form generators. This study presents a new approach to
generating case-inflectional forms that is simpler to compute. Further, an
optimized model that is sufficient for generating only those word forms that
are required in a word search and is more than 80% efficient compared to the
complete case-inflectional forms generator, is presented in this study for the
first time.
","[{'version': 'v1', 'created': 'Wed, 17 Dec 2014 16:56:43 GMT'}]",2014-12-18,"[['Raja', 'S V Kasmir', ''], ['Rajitha', 'V', ''], ['Meenakshi', 'Lakshmanan', '']]","['Sanskrit', 'Case-Inflection', 'Panini', 'E-text', 'Word Search', 'Noun Declension', 'XML Structure']"
2421,1501.06964,Usha Keshavamurthy,"Usha Keshavamurthy, H. S. Guruprasad",Learning Analytics: A Survey,,"International Journal of Computer Trends and Technology (IJCTT)
  Volume 18 Number 6 Dec 2014 Page 260 - 264",10.14445/22312803/IJCTT-V18P155,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning analytics is a research topic that is gaining increasing popularity
in recent time. It analyzes the learning data available in order to make aware
or improvise the process itself and/or the outcome such as student performance.
In this survey paper, we look at the recent research work that has been
conducted around learning analytics, framework and integrated models, and
application of various models and data mining techniques to identify students
at risk and to predict student performance.
","[{'version': 'v1', 'created': 'Tue, 27 Jan 2015 11:03:12 GMT'}]",2015-01-29,"[['Keshavamurthy', 'Usha', ''], ['Guruprasad', 'H. S.', '']]","['Learning Analytics', 'Student Performance', 'Student Retention', 'Academic analytics', 'Course success']"
2422,0812.2298,Francois Le Gall,Francois Le Gall,Efficient Isomorphism Testing for a Class of Group Extensions,"17 pages, accepted to the STACS 2009 conference","Proceedings of the 26th International Symposium on Theoretical
  Aspects of Computer Science (STACS 2009), pp. 625-636, 2009",10.4230/LIPIcs.STACS.2009.1830,,cs.DS cs.CC math.GR quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The group isomorphism problem asks whether two given groups are isomorphic or
not. Whereas the case where both groups are abelian is well understood and can
be solved efficiently, very little is known about the complexity of isomorphism
testing for nonabelian groups. In this paper we study this problem for a class
of groups corresponding to one of the simplest ways of constructing nonabelian
groups from abelian groups: the groups that are extensions of an abelian group
A by a cyclic group of order m. We present an efficient algorithm solving the
group isomorphism problem for all the groups of this class such that the order
of A is coprime with m. More precisely, our algorithm runs in time almost
linear in the orders of the input groups and works in the general setting where
the groups are given as black-boxes.
","[{'version': 'v1', 'created': 'Fri, 12 Dec 2008 09:39:02 GMT'}]",2021-10-05,"[['Gall', 'Francois Le', '']]","['Polynomial-time Algorithms', 'Group Isomorphism', 'Black-boxGroups']"
2423,1003.4314,Daniel Karapetyan,Daniel Karapetyan and Gregory Gutin,"A New Approach to Population Sizing for Memetic Algorithms: A Case Study
  for the Multidimensional Assignment Problem",25 pages,"Evolutionary Computation 19(3), pages 345-371, 2011",10.1162/EVCO_a_00026,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Memetic Algorithms are known to be a powerful technique in solving hard
optimization problems. To design a memetic algorithm one needs to make a host
of decisions; selecting a population size is one of the most important among
them. Most algorithms in the literature fix the population size to a certain
constant value. This reduces the algorithm's quality since the optimal
population size varies for different instances, local search procedures and
running times. In this paper we propose an adjustable population size. It is
calculated as a function of the running time of the whole algorithm and the
average running time of the local search for the given instance. Note that in
many applications the running time of a heuristic should be limited and
therefore we use this limit as a parameter of the algorithm. The average
running time of the local search procedure is obtained during the algorithm's
run. Some coefficients which are independent with respect to the instance or
the local search are to be tuned before the algorithm run; we provide a
procedure to find these coefficients. The proposed approach was used to develop
a memetic algorithm for the Multidimensional Assignment Problem (MAP or s-AP in
the case of s dimensions) which is an extension of the well-known assignment
problem. MAP is NP-hard and has a host of applications. We show that using
adjustable population size makes the algorithm flexible to perform well for
instances of very different sizes and types and for different running times and
local searches. This allows us to select the most efficient local search for
every instance type. The results of computational experiments for several
instance families and sizes prove that the proposed algorithm performs
efficiently for a wide range of the running times and clearly outperforms the
state-of-the art 3-AP memetic algorithm being given the same time.
","[{'version': 'v1', 'created': 'Tue, 23 Mar 2010 00:27:13 GMT'}]",2015-03-13,"[['Karapetyan', 'Daniel', ''], ['Gutin', 'Gregory', '']]","['Memetic Algorithm', 'Population Sizing', 'Parameter Tuning', 'Parameter Control', 'Metaheuristic', 'Multidimensional Assignment Problem']"
2424,1505.02002,Alberto Dafonte,Alberto Dafonte-Gomez,"The Key Elements of Viral Advertising. From Motivation to Emotion in the
  Most Shared Videos",,Comunicar Journal 43: Media Prosumers (Vol. 22 - 2014),10.3916/C43-2014-20,,cs.SI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  From its origins in the mid 90s, the application of the concept of virality
to commercial communication has represented an opportunity for brands to cross
the traditional barriers of the audience concerning advertising and turn it
into active communicator of brand messages. Viral marketing is based, since
then, on two basic principles: offer free and engaging content that mask its
commercial purpose to the individual and using a peer-to-peer dissemination
system. The transformation of the passive spectator into an active user who
broadcasts advertising messages promoted by sponsors, responds to needs and
motivations of individuals and content features which have been described by
previous research in this field, mainly through quantitative methods based on
user perceptions. This paper focusses on those elements detected in its
previous research as promoters of the sharing action in the 25 most shared
viral video ads between 2006 and 2013 using content analysis. The results
obtained show the most common features in these videos and the prominent
presence of surprise and joy as dominant emotions in the most successful viral
videos.
","[{'version': 'v1', 'created': 'Fri, 8 May 2015 11:40:49 GMT'}]",2015-05-11,"[['Dafonte-Gomez', 'Alberto', '']]","['Advertising', 'Internet', 'video', 'viral', 'social web', 'social media', 'emotion', 'content analysis']"
2425,1210.6284,Paolo Giosu\'e Giarrusso,"Paolo G. Giarrusso, Klaus Ostermann, Michael Eichberg, Ralf Mitschke,
  Tillmann Rendel, Christian K\""astner",Reify Your Collection Queries for Modularity and Speed!,20 pages,"Proceedings of the 12th annual international conference on
  Aspect-oriented software development (AOSD '13), 2013. ACM, New York, NY,
  USA, 1-12",10.1145/2451436.2451438,,cs.PL cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modularity and efficiency are often contradicting requirements, such that
programers have to trade one for the other. We analyze this dilemma in the
context of programs operating on collections. Performance-critical code using
collections need often to be hand-optimized, leading to non-modular, brittle,
and redundant code. In principle, this dilemma could be avoided by automatic
collection-specific optimizations, such as fusion of collection traversals,
usage of indexing, or reordering of filters. Unfortunately, it is not obvious
how to encode such optimizations in terms of ordinary collection APIs, because
the program operating on the collections is not reified and hence cannot be
analyzed.
  We propose SQuOpt, the Scala Query Optimizer--a deep embedding of the Scala
collections API that allows such analyses and optimizations to be defined and
executed within Scala, without relying on external tools or compiler
extensions. SQuOpt provides the same ""look and feel"" (syntax and static typing
guarantees) as the standard collections API. We evaluate SQuOpt by
re-implementing several code analyses of the Findbugs tool using SQuOpt, show
average speedups of 12x with a maximum of 12800x and hence demonstrate that
SQuOpt can reconcile modularity and efficiency in real-world applications.
","[{'version': 'v1', 'created': 'Tue, 23 Oct 2012 16:32:13 GMT'}]",2013-12-03,"[['Giarrusso', 'Paolo G.', ''], ['Ostermann', 'Klaus', ''], ['Eichberg', 'Michael', ''], ['Mitschke', 'Ralf', ''], ['Rendel', 'Tillmann', ''], ['Kästner', 'Christian', '']]","['Deep embedding', 'query languages', 'optimization', 'modularity']"
2426,1009.0384,Rahmat Widia Sembiring,"Rahmat Widia Sembiring, Jasni Mohamad Zain, Abdullah Embong","Clustering high dimensional data using subspace and projected clustering
  algorithms","9 pages, 6 figures","International journal of computer science & information Technology
  (IJCSIT) Vol.2, No.4, August 2010, p.162-170",10.5121/ijcsit.2010.2414,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Problem statement: Clustering has a number of techniques that have been
developed in statistics, pattern recognition, data mining, and other fields.
Subspace clustering enumerates clusters of objects in all subspaces of a
dataset. It tends to produce many over lapping clusters. Approach: Subspace
clustering and projected clustering are research areas for clustering in high
dimensional spaces. In this research we experiment three clustering oriented
algorithms, PROCLUS, P3C and STATPC. Results: In general, PROCLUS performs
better in terms of time of calculation and produced the least number of
un-clustered data while STATPC outperforms PROCLUS and P3C in the accuracy of
both cluster points and relevant attributes found. Conclusions/Recommendations:
In this study, we analyze in detail the properties of different data clustering
method.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2010 10:47:11 GMT'}]",2010-09-03,"[['Sembiring', 'Rahmat Widia', ''], ['Zain', 'Jasni Mohamad', ''], ['Embong', 'Abdullah', '']]","['Clustering', 'projected clustering', 'subspace clustering', 'clustering oriented', 'PROCLUS', 'P3C', 'STATPC']"
2427,1210.2090,Perry Nicolas,"Niek Du Preez (GCC), Nicolas Perry (IRCCyN), Alexandre Candlot
  (IRCCyN), Alain Bernard (IRCCyN), Wilhelm Uys (GCC), Louis Louw (GCC)",Customised high-value document generation,,"CIRP Annals 54, 1 (2005) 123-126",10.1016/S0007-8506(07)60064-X,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Contributions of different experts to innovation projects improve enterprise
value, captured in documents. A subset of them is the centre of expert
constraint convergence. Their production needs to be tailored case by case.
Documents are often considered as knowledge transcription. As the base of a
structured knowledge-based information environment, this paper presents a
global approach that helps knowledge-integration tool deployment. An example,
based on process plan in aircraft manufacturing, indicates how fundamental
understanding of domain infrastructure contributes to a more coherent
architecture of knowledge-based information environments. A comparison with an
experiment in insurance services generalised the application of presented
principles.
","[{'version': 'v1', 'created': 'Sun, 7 Oct 2012 18:33:18 GMT'}]",2012-10-09,"[['Preez', 'Niek Du', '', 'GCC'], ['Perry', 'Nicolas', '', 'IRCCyN'], ['Candlot', 'Alexandre', '', 'IRCCyN'], ['Bernard', 'Alain', '', 'IRCCyN'], ['Uys', 'Wilhelm', '', 'GCC'], ['Louw', 'Louis', '', 'GCC']]","['Methodology', 'Knowledge', 'Integration']"
2428,1505.04488,Wanxing Ding,Jian Ren and Wanxing Ding,"Exploring the Self-enhanced Mechanism of Interactive Advertising
  Phenomenon---Based on the Research of Three Cases","16 pages,10 figures, The International Journal of Multimedia & its
  Application,2015",,10.5121/ijma.2015.7202,,cs.CY,http://creativecommons.org/licenses/publicdomain/,"  Under the background of the new media era with the rapid development of
interactive advertising, this paper used case study method based on the summary
of the research of the communication effect of interactive advertising from
both domestic and foreign academia. This paper divided interactive advertising
into three types to examine ---- interactive ads on official website,
interactive ads based on SNS and interactive ads based on mobile media.
Furthermore, this paper induced and summarized a self-enhanced dissemination
mechanism of the interactive advertising, including three parts which are micro
level, meso level and macro level mechanism, micro level embodies core
interaction, inner interaction and outer interaction which reveal the whole
process of interact with contents, with people and with computer, and the
communication approach and spread speed shown in meso level which is
self-fission-type spread, finally in macro level the communication effect of IA
achieved the spiral increasing. In a word, this article enriches research
procedure of the interactive advertising communication effects.
","[{'version': 'v1', 'created': 'Mon, 18 May 2015 01:46:03 GMT'}]",2015-05-19,"[['Ren', 'Jian', ''], ['Ding', 'Wanxing', '']]","['interactive advertising', 'self-enhanced', 'case study']"
2429,1604.08226,Pavel Hrab\'ak,Pavel Hrab\'ak and Marek Buk\'a\v{c}ek,Influence of Agents Heterogeneity in Cellular Model of Evacuation,Submitted to Journal of Computational Science,"Journal of Computational Science, Volume 21, July 2017, Pages
  486-493",10.1016/j.jocs.2016.08.002,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The influence of agents heterogeneity on the microscopic characteristics of
pedestrian flow is studied via an evacuation simulation tool based on the
Floor-Field model. The heterogeneity is introduced in agents velocity,
aggressiveness, and sensitivity to occupation. The simulation results are
compared to data gathered during an original experiment. The comparison shows
that the heterogeneity in aggressiveness and sensitivity occupation enables to
reproduce some microscopic aspects. The heterogeneity in velocity seems to be
redundant.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2016 20:22:27 GMT'}]",2018-01-08,"[['Hrabák', 'Pavel', ''], ['Bukáček', 'Marek', '']]","['Travel time', 'Floor-Field model', 'Aggressiveness', 'Bonds principle', 'Heterogeneity', 'Pedestrian dynamics']"
2430,1111.3056,Srinivas V.V.,"N. Ramasubramanian, Srinivas V. V. and N. Ammasai Gounden",Performance of Cache Memory Subsystems for Multicore Architectures,"13 pages, 8 figures","International Journal of Computer Science, Engineering and
  Applications (IJCSEA), Vol. 1, No. 5, pp. 59-71, 2011",10.5121/ijcsea.2011.1506,,cs.AR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Advancements in multi-core have created interest among many research groups
in finding out ways to harness the true power of processor cores. Recent
research suggests that on-board component such as cache memory plays a crucial
role in deciding the performance of multi-core systems. In this paper,
performance of cache memory is evaluated through the parameters such as cache
access time, miss rate and miss penalty. The influence of cache parameters over
execution time is also discussed. Results obtained from simulated studies of
multi-core environments with different instruction set architectures (ISA) like
ALPHA and X86 are produced.
","[{'version': 'v1', 'created': 'Sun, 13 Nov 2011 19:28:01 GMT'}]",2011-11-15,"[['Ramasubramanian', 'N.', ''], ['V.', 'Srinivas V.', ''], ['Gounden', 'N. Ammasai', '']]","['Multi-core', 'performance evaluation', 'access time', 'execution time', 'cache memory']"
2431,0906.5446,Tom Hirschowitz,"Daniel Hirschkoff (LIP), Aur\'elien Pardon (LIP), Tom Hirschowitz
  (LAMA), Samuel Hym (LIFL), Damien Pous (INRIA Rh\^one-Alpes / LIG Laboratoire
  d'Informatique de Grenoble)",Encapsulation and Dynamic Modularity in the Pi-Calculus,,"PLACES 2008, Oslo : Norv\`ege (2008)",10.1016/j.entcs.2009.06.005,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a process calculus featuring high level constructs for
component-oriented programming in a distributed setting. We propose an
extension of the higher-order pi-calculus intended to capture several important
mechanisms related to component-based programming, such as dynamic update,
reconfiguration and code migration. In this paper, we are primarily concerned
with the possibility to build a distributed implementation of our calculus.
Accordingly, we define a low-level calculus, that describes how the high-level
constructs are implemented, as well as details of the data structures
manipulated at runtime. We also discuss current and future directions of
research in relation to our analysis of component-based programming.
","[{'version': 'v1', 'created': 'Tue, 30 Jun 2009 09:16:03 GMT'}]",2009-09-04,"[['Hirschkoff', 'Daniel', '', 'LIP'], ['Pardon', 'Aurélien', '', 'LIP'], ['Hirschowitz', 'Tom', '', 'LAMA'], ['Hym', 'Samuel', '', 'LIFL'], ['Pous', 'Damien', '', ""INRIA Rhône-Alpes / LIG Laboratoire\n  d'Informatique de Grenoble""]]","['Distributed computing', 'component-based programming', 'process algebra', 'higher-order calculi', 'abstract machine']"
2432,0708.2230,Dale Miller,Dale Miller (INRIA Futurs),Collection analysis for Horn clause programs,,"Dans International ACM SIGPLAN Conference on Principles and
  Practice of Declarative Programming (2006)",,,cs.LO,,"  We consider approximating data structures with collections of the items that
they contain. For examples, lists, binary trees, tuples, etc, can be
approximated by sets or multisets of the items within them. Such approximations
can be used to provide partial correctness properties of logic programs. For
example, one might wish to specify than whenever the atom $sort(t,s)$ is proved
then the two lists $t$ and $s$ contain the same multiset of items (that is, $s$
is a permutation of $t$). If sorting removes duplicates, then one would like to
infer that the sets of items underlying $t$ and $s$ are the same. Such results
could be useful to have if they can be determined statically and automatically.
We present a scheme by which such collection analysis can be structured and
automated. Central to this scheme is the use of linear logic as a omputational
logic underlying the logic of Horn clauses.
","[{'version': 'v1', 'created': 'Thu, 16 Aug 2007 15:45:06 GMT'}]",2007-08-17,"[['Miller', 'Dale', '', 'INRIA Futurs']]","['proof search', 'static analysis', 'Horn clauses', 'linear logic']"
2433,1606.04794,Huy-Dung Han,"Huy-Dung Han, Zhi Ding, Muhammad Zia","A Convex Relaxation Approach to Higher-Order Statistical Approaches to
  Signal Recovery",IEEE Transactions on Vehicular Technology 2016,,10.1109/TVT.2016.2542108,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we investigate an efficient numerical approach for solving
higher order statistical methods for blind and semi-blind signal recovery from
non-ideal channels. We develop numerical algorithms based on convex
optimization relaxation for minimization of higher order statistical cost
functions. The new formulation through convex relaxation overcomes the local
convergence problem of existing gradient descent based algorithms and applies
to several well-known cost functions for effective blind signal recovery
including blind equalization and blind source separation in both
single-input-single-output (SISO) and multi-input-multi-output (MIMO) systems.
We also propose a fourth order pilot based cost function that benefits from
this approach. The simulation results demonstrate that our approach is suitable
for short-length packet data transmission using only a few pilot symbols.
","[{'version': 'v1', 'created': 'Sat, 12 Mar 2016 14:43:16 GMT'}]",2016-11-17,"[['Han', 'Huy-Dung', ''], ['Ding', 'Zhi', ''], ['Zia', 'Muhammad', '']]","['Blind signal recovery', 'semi/blind channel equalization', 'convex optimization', 'semidefinite programming', 'rank1 approximation']"
2434,1705.09837,Carlos G\'omez-Rodr\'iguez,Carlos G\'omez-Rodr\'iguez,"On the relation between dependency distance, crossing dependencies, and
  parsing. Comment on ""Dependency distance: a new perspective on syntactic
  patterns in natural languages"" by Haitao Liu et al","This is a comment on the article ""Dependency distance: a new
  perspective on syntactic patterns in natural languages"", by Haitao Liu et al.
  Accepted for publication in Physics of Life Reviews. This version is
  identical to the previous one, but with the link to the accepted article and
  license as required by Elsevier","Physics of Life Reviews, 21:200-203, 2017",10.1016/j.plrev.2017.05.007,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Liu et al. (2017) provide a comprehensive account of research on dependency
distance in human languages. While the article is a very rich and useful report
on this complex subject, here I will expand on a few specific issues where
research in computational linguistics (specifically natural language
processing) can inform DDM research, and vice versa. These aspects have not
been explored much in the article by Liu et al. or elsewhere, probably due to
the little overlap between both research communities, but they may provide
interesting insights for improving our understanding of the evolution of human
languages, the mechanisms by which the brain processes and understands
language, and the construction of effective computer systems to achieve this
goal.
","[{'version': 'v1', 'created': 'Sat, 27 May 2017 16:19:37 GMT'}, {'version': 'v2', 'created': 'Sat, 3 Jun 2017 11:12:41 GMT'}]",2017-12-14,"[['Gómez-Rodríguez', 'Carlos', '']]","['dependency distance', 'natural language parsing', 'dependencyparsing', 'crossing dependencies', 'non-projectivity']"
2435,1408.5800,Laszlo Kish,Laszlo B. Kish,"Enhanced usage of keys obtained by physical, unconditionally secure
  distributions",this revised version is published,Fluctuation and Noise Letters 14 (2015) 1550007,10.1142/S0219477515500078,,cs.CR,http://creativecommons.org/licenses/by/3.0/,"  Unconditionally secure physical key distribution schemes are very slow, and
it is practically impossible to use a one-time-pad based cipher to guarantee
unconditional security for the encryption of data because using the key bits
more than once gives out statistical information, for example via the
known-plain-text-attack or by utilizing known components of the protocol and
language statistics. Here we outline a protocol that reduces this speed problem
and allows almost-one-time-pad based communication with an unconditionally
secure physical key of finite length. The physical, unconditionally secure key
is not used for data encryption but is employed in order to generate and share
a new software-based key without any known-plain-text component. The
software-only-based key distribution is then changed from computationally
secure to unconditionally secure, because the communicated key-exchange data
(algorithm parameters, one-way functions of random numbers, etc.) are encrypted
in an unconditionally secure way with a one-time-pad. For practical
applications, this combined physical/software key distribution based
communication looks favorable compared to the software-only and physical-only
key distribution based communication whenever the speed of the physical key
distribution is much lower than that of the software-based key distribution. A
mathematical security proof of this new scheme remains an open problem.
","[{'version': 'v1', 'created': 'Thu, 21 Aug 2014 23:51:46 GMT'}, {'version': 'v2', 'created': 'Tue, 5 May 2015 22:01:28 GMT'}]",2015-05-07,"[['Kish', 'Laszlo B.', '']]","['information theoretic security', 'secure key', 'one-time-pad']"
2436,1405.4335,Hemant Kumar Saini,"Hemant Kumar Saini, Satpal Singh Kushwaha, C. Rama Krishna",Compressing the Data Densely by New Geflochtener to Accelerate Web,,"International Journal of Computer Applications, 2014",10.5120/16377-5867 10.5120/16377-5867 10.5120/16377-5867,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  At the present scenario of the internet, there exist many optimization
techniques to improve the Web speed but almost expensive in terms of bandwidth.
So after a long investigation on different techniques to compress the data
without any loss, a new algorithm is proposed based on L Z 77 family which
selectively models the references with backward movement and encodes the
longest matches through greedy parsing with the shortest path technique to
compresses the data with high density. This idea seems to be useful since the
single Web Page contains many repetitive words which create havoc in consuming
space, so let it removes such unnecessary redundancies with 70% efficiency and
compress the pages with 23.75 - 35% compression ratio.
","[{'version': 'v1', 'created': 'Sat, 17 May 2014 00:46:00 GMT'}]",2014-05-20,"[['Saini', 'Hemant Kumar', ''], ['Kushwaha', 'Satpal Singh', ''], ['Krishna', 'C. Rama', '']]","['Shortest path technique', 'iterative compression longest matching', 'greedy parsing', 'backward references', 'Web compression', 'HTTP']"
2437,1911.08650,Jordan MacLachlan,"Jordan MacLachlan, Yi Mei, Juergen Branke, Mengjie Zhang","Genetic Programming Hyper-Heuristics with Vehicle Collaboration for
  Uncertain Capacitated Arc Routing Problems",,,10.1162/evco_a_00267,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to its direct relevance to post-disaster operations, meter reading and
civil refuse collection, the Uncertain Capacitated Arc Routing Problem (UCARP)
is an important optimisation problem. Stochastic models are critical to study
as they more accurately represent the real-world than their deterministic
counterparts. Although there have been extensive studies in solving routing
problems under uncertainty, very few have considered UCARP, and none consider
collaboration between vehicles to handle the negative effects of uncertainty.
This paper proposes a novel Solution Construction Procedure (SCP) that
generates solutions to UCARP within a collaborative, multi-vehicle framework.
It consists of two types of collaborative activities: one when a vehicle
unexpectedly expends capacity (\emph{route failure}), and the other during the
refill process. Then, we propose a Genetic Programming Hyper-Heuristic (GPHH)
algorithm to evolve the routing policy used within the collaborative framework.
The experimental studies show that the new heuristic with vehicle collaboration
and GP-evolved routing policy significantly outperforms the compared
state-of-the-art algorithms on commonly studied test problems. This is shown to
be especially true on instances with larger numbers of tasks and vehicles. This
clearly shows the advantage of vehicle collaboration in handling the uncertain
environment, and the effectiveness of the newly proposed algorithm.
","[{'version': 'v1', 'created': 'Wed, 20 Nov 2019 00:55:00 GMT'}]",2019-11-21,"[['MacLachlan', 'Jordan', ''], ['Mei', 'Yi', ''], ['Branke', 'Juergen', ''], ['Zhang', 'Mengjie', '']]","['Arc Routing', 'Genetic Programming', 'Hyper Heuristic', 'Stochastic Optimisation']"
2438,1102.1746,Zsuzsanna Lipt\'ak,"P\'eter Burcsi, Ferdinando Cicalese, Gabriele Fici and Zsuzsanna
  Lipt\'ak",Algorithms for Jumbled Pattern Matching in Strings,"18 pages, 9 figures; article accepted for publication in the
  International Journal of Foundations of Computer Science",Int. J. Found. Comput. Sci. 23(2): 357-374 (2012),10.1142/S0129054112400175,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Parikh vector p(s) of a string s is defined as the vector of
multiplicities of the characters. Parikh vector q occurs in s if s has a
substring t with p(t)=q. We present two novel algorithms for searching for a
query q in a text s. One solves the decision problem over a binary text in
constant time, using a linear size index of the text. The second algorithm, for
a general finite alphabet, finds all occurrences of a given Parikh vector q and
has sub-linear expected time complexity; we present two variants, which both
use a linear size index of the text.
","[{'version': 'v1', 'created': 'Tue, 8 Feb 2011 23:11:17 GMT'}]",2015-03-18,"[['Burcsi', 'Péter', ''], ['Cicalese', 'Ferdinando', ''], ['Fici', 'Gabriele', ''], ['Lipták', 'Zsuzsanna', '']]","['Parikh vectors', 'permuted strings', 'pattern matching', 'string algorithms', 'average case analysis', 'text indexing', 'non-standard string matching']"
2439,1403.2844,Amr Farouk,"Amr Farouk, Mohamed M. Fouad and Ahmed A. Abdelhafez","Analysis And Improvement of Pairing-Free Certificate-Less Two-Party
  Authenticated Key Agreement Protocol For Grid Computing",14 pages,"International Journal of Security, Privacy and Trust Management
  (IJSPTM) Vol 3, No 1, February 2014",10.5121/ijsptm.2014.3103,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The predominant grid authentication mechanisms use public key infrastructure
(PKI). Nonetheless, certificate-less public key cryptography (CL-PKC) has
several advantages that seem to well align with the demands of grid computing.
Security and efficiency are the main objectives of grid authentication
protocols. Unfortunately, certificate-less authenticated key agreement
protocols rely on the bilinear pairing, that is extremely computational
expensive. In this paper, we analyze the recently secure certificateless key
agreement protocols without pairing. We then propose a novel grid pairing-free
certificate-less two-party authenticated key agreement (GPC-AKA) protocol,
providing a more lightweight key management approach for grid users. We also
show, a GPC-AKA security protocol proof using formal automated security
analysis Sycther tool.
","[{'version': 'v1', 'created': 'Wed, 12 Mar 2014 08:38:25 GMT'}]",2014-03-13,"[['Farouk', 'Amr', ''], ['Fouad', 'Mohamed M.', ''], ['Abdelhafez', 'Ahmed A.', '']]","['Certificate-less Authenticated Key Agreement', 'Grid Computing', 'Pairing-free']"
2440,1411.1876,Puneet Kumar,"Puneet Kumar, Dharminder Kumar, Narendra Kumar","E-Governance in India: Definitions, Challenges and Solutions",,"International Journal of Computer Applications 101(16):6-8,
  September 2014",10.5120/17769-7408,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Government of India is transcending from traditional modus operandi of
governance towards technological involvement in the process of governance.
Currently, the Government of India is in the transition phase and seamlessly
unleashing the power of ICT in governance. The government is spending an
enormous amount of finances in deployment of e-governance, but, are these
efforts are going in the appropriate direction and leads towards intended
results? What do the people percept from the concept of e-governance? What is
the global perspective about perception of e-governance? What are the major
challenges confronting the deployment of e-governance? In this attempt the
authors have made an attempt to riposte aforesaid issues. Moreover, the authors
have also suggested some plausible suggestions which may help in successful and
sustainable deployment of e-governance in India.
","[{'version': 'v1', 'created': 'Fri, 7 Nov 2014 10:26:35 GMT'}]",2014-11-10,"[['Kumar', 'Puneet', ''], ['Kumar', 'Dharminder', ''], ['Kumar', 'Narendra', '']]","['E-Government', 'Interoperability', 'Cloud computing', 'NIC', 'SOA', 'Rural']"
2441,0905.4165,Murat Guzeltepe Mr,"Murat Guzeltepe, Mehmet Ozen",Cyclic Codes over Some Finite Quaternion Integer Rings,,,10.1016/j.jfranklin.2010.02.008,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, cyclic codes are established over some finite quaternion
integer rings with respect to the quaternion Mannheim distance, and de- coding
algorithm for these codes is given.
","[{'version': 'v1', 'created': 'Tue, 26 May 2009 11:11:34 GMT'}]",2010-03-24,"[['Guzeltepe', 'Murat', ''], ['Ozen', 'Mehmet', '']]","['Block codes', 'Mannheim distance', 'Cyclic codes', 'Syndrome decoding']"
2442,1402.1932,Prince Jain mr,Dr. Rahul Malhotra and Prince Jain,An EMUSIM Technique and its Components in Cloud Computing- A Review,"6 pages, 3 figures and ""Published with International Journal of
  Computer Trends and Technology (IJCTT)""","International Journal of Computer Trends and Technology (IJCTT)
  4(8): 2435-2440 August 2013",10.14445/2231-2803,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent efforts to design and develop Cloud technologies focus on defining
novel methods, policies and mechanisms for efficiently managing Cloud
infrastructures. One key challenge potential Cloud customers have before
renting resources is to know how their services will behave in a set of
resources and the costs involved when growing and shrinking their resource
pool. Most of the studies in this area rely on simulation-based experiments,
which consider simplified modeling of applications and computing environment.
In order to better predict service's behavior on Cloud platforms, an integrated
architecture that is based on both simulation and emulation. The proposed
architecture, named EMUSIM, automatically extracts information from application
behavior via emulation and then uses this information to generate the
corresponding simulation model. This paper presents brief overview of the
EMUSIM technique and its components. The work in this paper focuses on
architecture and operation details of Automated Emulation Framework (AEF),
QAppDeployer and proposes Cloud Sim Application for Simulation techniques.
","[{'version': 'v1', 'created': 'Sun, 9 Feb 2014 10:10:48 GMT'}]",2014-02-11,"[['Malhotra', 'Dr. Rahul', ''], ['Jain', 'Prince', '']]","['Cloud Computing', 'AEF', 'CloudSim', 'QAppDeployer']"
2443,1903.12553,Bruno Tavares,"Bruno Tavares, Filipe Figueiredo Correia, Andr\'e Restivo, Jo\~ao
  Pascoal Faria, Ademar Aguiar",A survey of blockchain frameworks and applications,,,10.13140/RG.2.2.34042.95685,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The applications of the blockchain technology are still being discov-ered.
When a new potential disruptive technology emerges, there is a tendency to try
to solve every problem with that technology. However, it is still necessary to
determine what approach is the best for each type of application. To find how
distributed ledgers solve existing problems, this study looks for blockchain
frameworks in the academic world. Identifying the existing frameworks can
demonstrate where the interest in the technology exists and where it can be
miss-ing. This study encountered several blockchain frameworks in development.
However, there are few references to operational needs, testing, and deploy of
the technology. With the widespread use of the technology, either integrating
with pre-existing solutions, replacing legacy systems, or new implementations,
the need for testing, deploying, exploration, and maintenance is expected to
in-tensify.
","[{'version': 'v1', 'created': 'Sun, 24 Mar 2019 19:10:29 GMT'}]",2021-03-16,"[['Tavares', 'Bruno', ''], ['Correia', 'Filipe Figueiredo', ''], ['Restivo', 'André', ''], ['Faria', 'João Pascoal', ''], ['Aguiar', 'Ademar', '']]","['Blockchain', 'applications', 'distributed ledger', 'framework']"
2444,1410.2123,George Grispos,"George Grispos, Tim Storer, William Bradley Glisson","Calm Before the Storm: The Challenges of Cloud Computing in Digital
  Forensics",,"G. Grispos, T. Storer, and W.B. Glisson (2012). Calm Before the
  Storm: The Challenges of Cloud Computing in Digital Forensics. International
  Journal of Digital Crime and Forensics, Volume 4, Issue 2, Pages 28-48",10.4018/jdcf.2012040103,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing is a rapidly evolving information technology (IT) phenomenon.
Rather than procure, deploy and manage a physical IT infrastructure to host
their software applications, organizations are increasingly deploying their
infrastructure into remote, virtualized environments, often hosted and managed
by third parties. This development has significant implications for digital
forensic investigators, equipment vendors, law enforcement, as well as
corporate compliance and audit departments (among others). Much of digital
forensic practice assumes careful control and management of IT assets
(particularly data storage) during the conduct of an investigation. This paper
summarises the key aspects of cloud computing and analyses how established
digital forensic procedures will be invalidated in this new environment.
Several new research challenges addressing this changing context are also
identified and discussed.
","[{'version': 'v1', 'created': 'Wed, 8 Oct 2014 14:02:09 GMT'}]",2014-10-09,"[['Grispos', 'George', ''], ['Storer', 'Tim', ''], ['Glisson', 'William Bradley', '']]","['Digital Forensics', 'Cloud Computing', 'Cloud Forensics', 'Investigation Model', 'ACPO Guidelines', 'Digital Forensics Research Conference']"
2445,1101.0104,Anjan Krishnamurthy,"Anjan K, Jibi Abraham and Mamatha Jadhav V",Design of Transport Layer Based Hybrid Covert Channel Detection Engine,"8 pages, 4 figures, Journal",,10.5121/ijasuc.2010.1409,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Computer network is unpredictable due to information warfare and is prone to
various attacks. Such attacks on network compromise the most important
attribute, the privacy. Most of such attacks are devised using special
communication channel called ""Covert Channel"". The word ""Covert"" stands for
hidden or non-transparent. Network Covert Channel is a concealed communication
path within legitimate network communication that clearly violates security
policies laid down. The non-transparency in covert channel is also referred to
as trapdoor. A trapdoor is unintended design within legitimate communication
whose motto is to leak information. Subliminal channel, a variant of covert
channel works similarly except that the trapdoor is set in a cryptographic
algorithm. A composition of covert channel with subliminal channel is the
""Hybrid Covert Channel"". Hybrid covert channel is homogenous or heterogeneous
mixture of two or more variants of covert channels either active at same
instance or at different instances of time. Detecting such malicious channel
activity plays a vital role in removing threat to the legitimate network. In
this paper, we present a study of multi-trapdoor covert channels and introduce
design of a new detection engine for hybrid covert channel in transport layer
visualized in TCP and SSL.
","[{'version': 'v1', 'created': 'Thu, 30 Dec 2010 16:19:17 GMT'}]",2011-01-04,"[['K', 'Anjan', ''], ['Abraham', 'Jibi', ''], ['Jadhav', 'Mamatha', 'V']]","['Covert Channel', 'Subliminal Channel', 'Hybrid Covert Channel', 'Network Security', 'Trapdoors']"
2446,1810.08649,Marta Bagi\'nska,Marta Bagi\'nska and Piotr E. Srokosz,"The Optimal ANN Model for Predicting Bearing Capacity of Shallow
  Foundations Trained on Scarce Data",KSCE Journal of Civil Engineering 2018,,10.1007/s12205-018-2636-4,,cs.NE cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study is focused on determining the potential of using deep neural
networks (DNNs) to predict the ultimate bearing capacity of shallow foundation
in situations when the experimental data which may be used to train networks is
scarce. Two experiments involving testing over 17000 networks were conducted.
The first experiment was aimed at comparing the accuracy of shallow neural
networks and DNNs predictions. It shows that when the experimental dataset used
for preparing models is small then DNNs have a significant advantage over
shallow networks. The second experiment was conducted to compare the
performance of DNNs consisting of different number of neurons and layers.
Obtained results indicate that the optimal number of layers varies between 5 to
7. Networks with less and - surprisingly - more layers obtain lower accuracy.
Moreover, the number of neurons in DNN has a lower impact on the prediction
accuracy than the number of DNN's layers. DNNs perform very well, even when
trained with only 6 samples. Basing on the results it seems that when
predicting the ultimate bearing capacity with ANN models obtaining small but
high-quality experimental training datasets instead of large training datasets
affected by a higher error is an advisable approach.
","[{'version': 'v1', 'created': 'Sat, 22 Sep 2018 11:17:43 GMT'}]",2018-10-23,"[['Bagińska', 'Marta', ''], ['Srokosz', 'Piotr E.', '']]","['ultimate bearing capacity', 'shallow foundations', 'heuristic algorithms', 'artificial neural networks', 'deep learning']"
2447,1801.01704,Sandeep Kumar Singh,"Javier Mata, Ignacio de Miguel, Ram\'o n J. Dur\'a n, Noem\'i Merayo,
  Sandeep Kumar Singh, Admela Jukan, Mohit Chamania","Artificial Intelligence (AI) Methods in Optical Networks: A
  Comprehensive Survey",,"Optical Switching and Networking, Jan 2018",10.1016/j.osn.2017.12.006,,cs.AI cs.NI,http://creativecommons.org/licenses/by/4.0/,"  Artificial intelligence (AI) is an extensive scientific discipline which
enables computer systems to solve problems by emulating complex biological
processes such as learning, reasoning and self-correction. This paper presents
a comprehensive review of the application of AI techniques for improving
performance of optical communication systems and networks. The use of AI-based
techniques is first studied in applications related to optical transmission,
ranging from the characterization and operation of network components to
performance monitoring, mitigation of nonlinearities, and quality of
transmission estimation. Then, applications related to optical network control
and management are also reviewed, including topics like optical network
planning and operation in both transport and access networks. Finally, the
paper also presents a summary of opportunities and challenges in optical
networking where AI is expected to play a key role in the near future.
","[{'version': 'v1', 'created': 'Fri, 5 Jan 2018 10:51:55 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Jan 2018 11:54:34 GMT'}]",2018-01-16,"[['Mata', 'Javier', ''], ['de Miguel', 'Ignacio', ''], ['n', 'Ramó n J. Durá', ''], ['Merayo', 'Noemí', ''], ['Singh', 'Sandeep Kumar', ''], ['Jukan', 'Admela', ''], ['Chamania', 'Mohit', '']]","['Artificial intelligence', 'machine learning', 'optical communications', 'optical networks', 'optimization', 'survey']"
2448,1610.04790,Emery Berger,"Diogenes Nunez, Samuel Z. Guyer, Emery D. Berger",Prioritized Garbage Collection: Explicit GC Support for Software Caches,to appear in OOPSLA 2016,,10.1145/2983990.2984028,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Programmers routinely trade space for time to increase performance, often in
the form of caching or memoization. In managed languages like Java or
JavaScript, however, this space-time tradeoff is complex. Using more space
translates into higher garbage collection costs, especially at the limit of
available memory. Existing runtime systems provide limited support for
space-sensitive algorithms, forcing programmers into difficult and often
brittle choices about provisioning.
  This paper presents prioritized garbage collection, a cooperative programming
language and runtime solution to this problem. Prioritized GC provides an
interface similar to soft references, called priority references, which
identify objects that the collector can reclaim eagerly if necessary. The key
difference is an API for defining the policy that governs when priority
references are cleared and in what order. Application code specifies a priority
value for each reference and a target memory bound. The collector reclaims
references, lowest priority first, until the total memory footprint of the
cache fits within the bound. We use this API to implement a space-aware
least-recently-used (LRU) cache, called a Sache, that is a drop-in replacement
for existing caches, such as Google's Guava library. The garbage collector
automatically grows and shrinks the Sache in response to available memory and
workload with minimal provisioning information from the programmer. Using a
Sache, it is almost impossible for an application to experience a memory leak,
memory pressure, or an out-of-memory crash caused by software caching.
","[{'version': 'v1', 'created': 'Sat, 15 Oct 2016 22:30:15 GMT'}]",2016-10-18,"[['Nunez', 'Diogenes', ''], ['Guyer', 'Samuel Z.', ''], ['Berger', 'Emery D.', '']]","['garbage collection', 'soft references', 'softwarecaching']"
2449,1801.05376,Arseny Shur,Jeffrey Shallit and Arseny M. Shur,Subword complexity and power avoidance,29 pages. Submitted to TCS,,10.1016/j.tcs.2018.09.010,,cs.FL cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We begin a systematic study of the relations between subword complexity of
infinite words and their power avoidance. Among other things, we show that
  -- the Thue-Morse word has the minimum possible subword complexity over all
overlap-free binary words and all $(\frac 73)$-power-free binary words, but not
over all $(\frac 73)^+$-power-free binary words;
  -- the twisted Thue-Morse word has the maximum possible subword complexity
over all overlap-free binary words, but no word has the maximum subword
complexity over all $(\frac 73)$-power-free binary words;
  -- if some word attains the minimum possible subword complexity over all
square-free ternary words, then one such word is the ternary Thue word;
  -- the recently constructed 1-2-bonacci word has the minimum possible subword
complexity over all \textit{symmetric} square-free ternary words.
","[{'version': 'v1', 'created': 'Tue, 16 Jan 2018 17:20:58 GMT'}]",2020-07-07,"[['Shallit', 'Jeffrey', ''], ['Shur', 'Arseny M.', '']]","['combinatorics on words', 'subword complexity', 'power-free word', 'criticalexponent', 'Thue-Morse word']"
2450,1903.10035,Muhammed Talo,Muhammed Talo,"Automated Classification of Histopathology Images Using Transfer
  Learning",,,10.1016/j.artmed.2019.101743,,cs.CV,http://creativecommons.org/publicdomain/zero/1.0/,"  There is a strong need for automated systems to improve diagnostic quality
and reduce the analysis time in histopathology image processing. Automated
detection and classification of pathological tissue characteristics with
computer-aided diagnostic systems are a critical step in the early diagnosis
and treatment of diseases. Once a pathology image is scanned by a microscope
and loaded onto a computer, it can be used for automated detection and
classification of diseases. In this study, the DenseNet-161 and ResNet-50
pre-trained CNN models have been used to classify digital histopathology
patches into the corresponding whole slide images via transfer learning
technique. The proposed pre-trained models were tested on grayscale and color
histopathology images. The DenseNet-161 pre-trained model achieved a
classification accuracy of 97.89% using grayscale images and the ResNet-50
model obtained the accuracy of 98.87% for color images. The proposed
pre-trained models outperform state-of-the-art methods in all performance
metrics to classify digital pathology patches into 24 categories.
","[{'version': 'v1', 'created': 'Sun, 24 Mar 2019 18:32:35 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Nov 2019 17:25:03 GMT'}]",2019-11-22,"[['Talo', 'Muhammed', '']]","['Medical imaging', 'digital pathology', 'deep learning', 'transfer learning', 'CNN']"
2451,1511.04870,Juergen Zechner,"Gernot Beer and Benjamin Marussig and J\""urgen Zechner and Christian
  D\""unser and Thomas-Peter Fries","Isogeometric Boundary Element Analysis with elasto-plastic inclusions.
  Part 1: Plane problems","21 pages, 16 figures, 1 table",,10.1016/j.cma.2016.03.035,,cs.NA math.NA physics.geo-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work a novel approach is presented for the isogeometric Boundary
Element analysis of domains that contain inclusions with different elastic
properties than the ones used for computing the fundamental solutions. In
addition the inclusion may exhibit inelastic material behavior. In this paper
only plane stress/strain problems are considered.
  In our approach the geometry of the inclusion is described using NURBS basis
functions. The advantage over currently used methods is that no discretization
into cells is required in order to evaluate the arising volume integrals. The
other difference to current approaches is that Kernels of lower singularity are
used in the domain term. The implementation is verified on simple finite and
infinite domain examples with various boundary conditions. Finally a practical
application in geomechanics is presented.
","[{'version': 'v1', 'created': 'Mon, 16 Nov 2015 08:54:43 GMT'}]",2016-08-24,"[['Beer', 'Gernot', ''], ['Marussig', 'Benjamin', ''], ['Zechner', 'Jürgen', ''], ['Dünser', 'Christian', ''], ['Fries', 'Thomas-Peter', '']]","['BEM', 'isogeometric analysis', 'elasto-plasticity', 'inclusions']"
2452,2105.06967,Gabriel Salomon,"Gabriel Salomon, Alceu Britto, Rafael H. Vareto, William R. Schwartz,
  David Menotti",Open-set Face Recognition for Small Galleries Using Siamese Networks,,"2020 International Conference on Systems, Signals and Image
  Processing (IWSSIP), 2020, pp. 161-166",10.1109/IWSSIP48289.2020.9145245,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Face recognition has been one of the most relevant and explored fields of
Biometrics. In real-world applications, face recognition methods usually must
deal with scenarios where not all probe individuals were seen during the
training phase (open-set scenarios). Therefore, open-set face recognition is a
subject of increasing interest as it deals with identifying individuals in a
space where not all faces are known in advance. This is useful in several
applications, such as access authentication, on which only a few individuals
that have been previously enrolled in a gallery are allowed. The present work
introduces a novel approach towards open-set face recognition focusing on small
galleries and in enrollment detection, not identity retrieval. A Siamese
Network architecture is proposed to learn a model to detect if a face probe is
enrolled in the gallery based on a verification-like approach. Promising
results were achieved for small galleries on experiments carried out on
Pubfig83, FRGCv1 and LFW datasets. State-of-the-art methods like HFCN and HPLS
were outperformed on FRGCv1. Besides, a new evaluation protocol is introduced
for experiments in small galleries on LFW.
","[{'version': 'v1', 'created': 'Fri, 14 May 2021 17:16:37 GMT'}]",2021-05-17,"[['Salomon', 'Gabriel', ''], ['Britto', 'Alceu', ''], ['Vareto', 'Rafael H.', ''], ['Schwartz', 'William R.', ''], ['Menotti', 'David', '']]","['open-set face recognition', 'siamese networks', 'facerecognition', 'small galleries']"
2453,1603.03482,Nathan Egge,Nathan E. Egge and Jean-Marc Valin,Predicting Chroma from Luma with Frequency Domain Intra Prediction,"10 pages, 7 figures","Proceedings of SPIE 9410, Visual Information Processing and
  Communication VI, 941009 (March 4, 2015)",10.1117/12.2080837,,cs.MM cs.GR,http://creativecommons.org/licenses/by/4.0/,"  This paper describes a technique for performing intra prediction of the
chroma planes based on the reconstructed luma plane in the frequency domain.
This prediction exploits the fact that while RGB to YUV color conversion has
the property that it decorrelates the color planes globally across an image,
there is still some correlation locally at the block level. Previous proposals
compute a linear model of the spatial relationship between the luma plane (Y)
and the two chroma planes (U and V). In codecs that use lapped transforms this
is not possible since transform support extends across the block boundaries and
thus neighboring blocks are unavailable during intra-prediction. We design a
frequency domain intra predictor for chroma that exploits the same local
correlation with lower complexity than the spatial predictor and which works
with lapped transforms. We then describe a low-complexity algorithm that
directly uses luma coefficients as a chroma predictor based on gain-shape
quantization and band partitioning. An experiment is performed that compares
these two techniques inside the experimental Daala video codec and shows the
lower complexity algorithm to be a better chroma predictor.
","[{'version': 'v1', 'created': 'Thu, 10 Mar 2016 22:55:36 GMT'}]",2016-03-14,"[['Egge', 'Nathan E.', ''], ['Valin', 'Jean-Marc', '']]","['Intra Prediction', 'Lapped Transforms', 'Color Image Coding', 'Chroma Correlation', 'Regression', 'GainShape Quantization', 'Perceptual Vector Quantization']"
2454,1405.0174,Karim Mahmoud,"Karim M. Mohamed, Mohamed A. Ismail, Nagia M. Ghanem","VSCAN: An Enhanced Video Summarization using Density-based Spatial
  Clustering","arXiv admin note: substantial text overlap with arXiv:1401.3590 by
  other authors without attribution",,10.1007/978-3-642-41181-6_74,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present VSCAN, a novel approach for generating static video
summaries. This approach is based on a modified DBSCAN clustering algorithm to
summarize the video content utilizing both color and texture features of the
video frames. The paper also introduces an enhanced evaluation method that
depends on color and texture features. Video Summaries generated by VSCAN are
compared with summaries generated by other approaches found in the literature
and those created by users. Experimental results indicate that the video
summaries generated by VSCAN have a higher quality than those generated by
other approaches.
","[{'version': 'v1', 'created': 'Thu, 1 May 2014 14:36:35 GMT'}]",2014-05-02,"[['Mohamed', 'Karim M.', ''], ['Ismail', 'Mohamed A.', ''], ['Ghanem', 'Nagia M.', '']]","['Video Summarization', 'Color and Texture', 'Clustering', 'Evaluation Method']"
2455,1811.00797,Natalia Soboleva,"Anton Andreychuk (1), Natalia Soboleva (2), Konstantin Yakovlev (2, 3,
  4) ((1) Peoples' Friendship University of Russia, (2) National Research
  University Higher School of Economics, (3) Federal Research Center ''Computer
  Science and Control'' of Russian Academy of Sciences, (4) Moscow Institute of
  Physics and Technology )",eLIAN: Enhanced Algorithm for Angle-constrained Path Finding,,"Kuznetsov S., Osipov G., Stefanuk V. (eds) Artificial
  Intelligence. RCAI 2018. Communications in Computer and Information Science,
  vol 934. Springer, Cham",10.1007/978-3-030-00617-4_19,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Problem of finding 2D paths of special shape, e.g. paths comprised of line
segments having the property that the angle between any two consecutive
segments does not exceed the predefined threshold, is considered in the paper.
This problem is harder to solve than the one when shortest paths of any shape
are sought, since the planer's search space is substantially bigger as multiple
search nodes corresponding to the same location need to be considered. One way
to reduce the search effort is to fix the length of the path's segment and to
prune the nodes that violate the imposed constraint. This leads to
incompleteness and to the sensitivity of the 's performance to chosen parameter
value. In this work we introduce a novel technique that reduces this
sensitivity by automatically adjusting the length of the path's segment
on-the-fly, e.g. during the search. Embedding this technique into the known
grid-based angle-constrained path finding algorithm - LIAN, leads to notable
increase of the planner's effectiveness, e.g. success rate, while keeping
efficiency, e.g. runtime, overhead at reasonable level. Experimental evaluation
shows that LIAN with the suggested enhancements, dubbed eLIAN, solves up to
20\% of tasks more compared to the predecessor. Meanwhile, the solution quality
of eLIAN is nearly the same as the one of LIAN.
","[{'version': 'v1', 'created': 'Fri, 2 Nov 2018 09:54:35 GMT'}]",2018-11-05,"[['Andreychuk', 'Anton', ''], ['Soboleva', 'Natalia', ''], ['Yakovlev', 'Konstantin', '']]","['path planning', 'path finding', 'grid', 'angle-constrained', 'LIAN']"
2456,1111.4345,Yulong Liu,"Yulong Liu, Tiebin Mi and Shidong Li","Compressed Sensing with General Frames via Optimal-dual-based
  $\ell_1$-analysis","34 pages, 8 figures. To appear in IEEE Transactions on Information
  Theory","IEEE Transactions on Information Theory, vol. 58, no. 7, pp.
  4201-4214, July, 2012",10.1109/TIT.2012.2191612,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Compressed sensing with sparse frame representations is seen to have much
greater range of practical applications than that with orthonormal bases. In
such settings, one approach to recover the signal is known as
$\ell_1$-analysis. We expand in this article the performance analysis of this
approach by providing a weaker recovery condition than existing results in the
literature. Our analysis is also broadly based on general frames and
alternative dual frames (as analysis operators). As one application to such a
general-dual-based approach and performance analysis, an optimal-dual-based
technique is proposed to demonstrate the effectiveness of using alternative
dual frames as analysis operators. An iterative algorithm is outlined for
solving the optimal-dual-based $\ell_1$-analysis problem. The effectiveness of
the proposed method and algorithm is demonstrated through several experiments.
","[{'version': 'v1', 'created': 'Fri, 18 Nov 2011 12:53:47 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Feb 2012 09:17:28 GMT'}, {'version': 'v3', 'created': 'Sat, 17 Mar 2012 07:24:41 GMT'}]",2015-03-19,"[['Liu', 'Yulong', ''], ['Mi', 'Tiebin', ''], ['Li', 'Shidong', '']]","['Compressed sensing', 'ℓ1-synthesis', 'ℓ1-analysis', 'optimal-dual-based ℓ1']"
2457,1805.10505,Panagiotis Papadopoulos,"Panagiotis Papadopoulos, Nicolas Kourtellis, Evangelos P. Markatos","Cookie Synchronization: Everything You Always Wanted to Know But Were
  Afraid to Ask",,Proceedings of the 2018 World Wide Web Conference (WWW'19),10.1145/3308558.3313542,,cs.IR cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  User data is the primary input of digital advertising, fueling the free
Internet as we know it. As a result, web companies invest a lot in elaborate
tracking mechanisms to acquire user data that can sell to data markets and
advertisers. However, with same-origin policy, and cookies as a primary
identification mechanism on the web, each tracker knows the same user with a
different ID. To mitigate this, Cookie Synchronization (CSync) came to the
rescue, facilitating an information sharing channel between third parties that
may or not have direct access to the website the user visits. In the
background, with CSync, they merge user data they own, but also reconstruct a
user's browsing history, bypassing the same origin policy. In this paper, we
perform a first to our knowledge in-depth study of CSync in the wild, using a
year-long weblog from 850 real mobile users. Through our study, we aim to
understand the characteristics of the CSync protocol and the impact it has on
web users' privacy. For this, we design and implement CONRAD, a holistic
mechanism to detect CSync events at real time, and the privacy loss on the user
side, even when the synced IDs are obfuscated. Using CONRAD, we find that 97%
of the regular web users are exposed to CSync: most of them within the first
week of their browsing, and the median userID gets leaked, on average, to 3.5
different domains. Finally, we see that CSync increases the number of domains
that track the user by a factor of 6.75.
","[{'version': 'v1', 'created': 'Sat, 26 May 2018 17:00:07 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Mar 2019 21:58:48 GMT'}, {'version': 'v3', 'created': 'Tue, 25 Feb 2020 17:13:54 GMT'}]",2020-02-26,"[['Papadopoulos', 'Panagiotis', ''], ['Kourtellis', 'Nicolas', ''], ['Markatos', 'Evangelos P.', '']]","['Cookie Synchronization', 'Cross-domain tracking', 'HTTP Cookies']"
2458,1310.7769,Renato Fabbri,"Renato Fabbri, Ricardo Fabbri, Deborah C. Antunes, Marilia M. Pisani,
  and Osvaldo N. Oliveira Jr",Temporal stability in human interaction networks,"See ancillary Supporting Information PDF file for further tables and
  figures. More information on code and further files can be found at
  https://github.com/ttm/articleStabilityInteractionNetworks","Physica A: Statistical Mechanics and its Applications, Volume 486,
  15 November 2017, Pages 92-105",10.1016/j.physa.2017.04.109,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper reports on stable (or invariant) properties of human interaction
networks, with benchmarks derived from public email lists. Activity, recognized
through messages sent, along time and topology were observed in snapshots in a
timeline, and at different scales. Our analysis shows that activity is
practically the same for all networks across timescales ranging from seconds to
months. The principal components of the participants in the topological metrics
space remain practically unchanged as different sets of messages are
considered. The activity of participants follows the expected scale-free trace,
thus yielding the hub, intermediary and peripheral classes of vertices by
comparison against the Erd\""os-R\'enyi model. The relative sizes of these three
sectors are essentially the same for all email lists and the same along time.
Typically, $<15\%$ of the vertices are hubs, 15-45\% are intermediary and
$>45\%$ are peripheral vertices. Similar results for the distribution of
participants in the three sectors and for the relative importance of the
topological metrics were obtained for 12 additional networks from Facebook,
Twitter and ParticipaBR. These properties are consistent with the literature
and may be general for human interaction networks, which has important
implications for establishing a typology of participants based on quantitative
criteria.
","[{'version': 'v1', 'created': 'Tue, 29 Oct 2013 11:59:38 GMT'}, {'version': 'v10', 'created': 'Thu, 3 Sep 2015 20:58:33 GMT'}, {'version': 'v11', 'created': 'Mon, 14 Sep 2015 22:45:54 GMT'}, {'version': 'v12', 'created': 'Mon, 2 Nov 2015 20:10:00 GMT'}, {'version': 'v13', 'created': 'Wed, 29 Jun 2016 16:55:01 GMT'}, {'version': 'v14', 'created': 'Tue, 5 Jul 2016 21:59:27 GMT'}, {'version': 'v15', 'created': 'Sun, 29 Oct 2017 02:00:33 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Dec 2014 08:56:10 GMT'}, {'version': 'v3', 'created': 'Tue, 20 Jan 2015 10:58:33 GMT'}, {'version': 'v4', 'created': 'Mon, 23 Feb 2015 17:29:42 GMT'}, {'version': 'v5', 'created': 'Wed, 15 Apr 2015 12:16:53 GMT'}, {'version': 'v6', 'created': 'Wed, 3 Jun 2015 22:52:38 GMT'}, {'version': 'v7', 'created': 'Mon, 22 Jun 2015 23:03:41 GMT'}, {'version': 'v8', 'created': 'Wed, 1 Jul 2015 10:01:45 GMT'}, {'version': 'v9', 'created': 'Sat, 22 Aug 2015 12:00:59 GMT'}]",2017-10-31,"[['Fabbri', 'Renato', ''], ['Fabbri', 'Ricardo', ''], ['Antunes', 'Deborah C.', ''], ['Pisani', 'Marilia M.', ''], ['Oliveira', 'Osvaldo N.', 'Jr']]","['complex networks', 'pattern recognition', 'statistics', 'social network']"
2459,1207.2704,Gaurav Raj,"Gaurav Raj, Ankit Nischal","Efficient Resource Allocation in Resource provisioning policies over
  Resource Cloud Communication Paradigm","8 pages, 4 Figures, International Journal on Cloud Computing:
  Services and Architecture(IJCCSA),Vol.2, No.3, June 2012",,10.5121/ijccsa.2012.2302,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optimal resource utilization for executing tasks within the cloud is one of
the biggest challenges. In executing the task over a cloud, the resource
provisioner is responsible for providing the resources to create virtual
machines. To utilize the resources optimally, the resource provisioner has to
take care of the process of allocating resources to Virtual Machine Manager
(VMM). In this paper, an efficient way to utilize the resources, within the
cloud, to create virtual machines has been proposed considering optimum cost
based on performance factor. This performance factor depends upon the overall
cost of the resource, communication channel cost, reliability and popularity
factor. We have proposed a framework for communication between resource owner
and cloud using Resource Cloud Communication Paradigm (RCCP). We extend the
CloudSim[2] adding provisioner policies and Efficient Resource Allocation (ERA)
algorithm in VMM allocation policy as a decision support for resource
provisioner.
","[{'version': 'v1', 'created': 'Wed, 11 Jul 2012 16:37:51 GMT'}]",2012-07-12,"[['Raj', 'Gaurav', ''], ['Nischal', 'Ankit', '']]","['Cloud Computing', 'Resource Provisioner', 'Virtual Machine Manager', 'Broker Cloud CommunicationParadigm']"
2460,1611.01421,Saeed Reza Kheradpisheh,"Saeed Reza Kheradpisheh, Mohammad Ganjtabesh, Simon J Thorpe,
  Timoth\'ee Masquelier","STDP-based spiking deep convolutional neural networks for object
  recognition",,Neural Networks 2018,10.1016/j.neunet.2017.12.005,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Previous studies have shown that spike-timing-dependent plasticity (STDP) can
be used in spiking neural networks (SNN) to extract visual features of low or
intermediate complexity in an unsupervised manner. These studies, however, used
relatively shallow architectures, and only one layer was trainable. Another
line of research has demonstrated - using rate-based neural networks trained
with back-propagation - that having many layers increases the recognition
robustness, an approach known as deep learning. We thus designed a deep SNN,
comprising several convolutional (trainable with STDP) and pooling layers. We
used a temporal coding scheme where the most strongly activated neurons fire
first, and less activated neurons fire later or not at all. The network was
exposed to natural images. Thanks to STDP, neurons progressively learned
features corresponding to prototypical patterns that were both salient and
frequent. Only a few tens of examples per category were required and no label
was needed. After learning, the complexity of the extracted features increased
along the hierarchy, from edge detectors in the first layer to object
prototypes in the last layer. Coding was very sparse, with only a few thousands
spikes per image, and in some cases the object category could be reasonably
well inferred from the activity of a single higher-order neuron. More
generally, the activity of a few hundreds of such neurons contained robust
category information, as demonstrated using a classifier on Caltech 101,
ETH-80, and MNIST databases. We also demonstrate the superiority of STDP over
other unsupervised techniques such as random crops (HMAX) or auto-encoders.
Taken together, our results suggest that the combination of STDP with latency
coding may be a key to understanding the way that the primate visual system
learns, its remarkable processing speed and its low energy consumption.
","[{'version': 'v1', 'created': 'Fri, 4 Nov 2016 15:25:13 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Nov 2017 14:28:09 GMT'}, {'version': 'v3', 'created': 'Mon, 25 Dec 2017 12:57:57 GMT'}]",2018-03-12,"[['Kheradpisheh', 'Saeed Reza', ''], ['Ganjtabesh', 'Mohammad', ''], ['Thorpe', 'Simon J', ''], ['Masquelier', 'Timothée', '']]","['Spiking Neural Network', 'STDP', 'DeepLearning', 'Object Recognition', 'Temporal Coding']"
2461,1405.6524,Dan Stowell,Dan Stowell and Mark D. Plumbley,"Automatic large-scale classification of bird sounds is strongly improved
  by unsupervised feature learning",,"PeerJ 2:e488, 2014",10.7717/peerj.488,,cs.SD cs.LG,http://creativecommons.org/licenses/by/3.0/,"  Automatic species classification of birds from their sound is a computational
tool of increasing importance in ecology, conservation monitoring and vocal
communication studies. To make classification useful in practice, it is crucial
to improve its accuracy while ensuring that it can run at big data scales. Many
approaches use acoustic measures based on spectrogram-type data, such as the
Mel-frequency cepstral coefficient (MFCC) features which represent a
manually-designed summary of spectral information. However, recent work in
machine learning has demonstrated that features learnt automatically from data
can often outperform manually-designed feature transforms. Feature learning can
be performed at large scale and ""unsupervised"", meaning it requires no manual
data labelling, yet it can improve performance on ""supervised"" tasks such as
classification. In this work we introduce a technique for feature learning from
large volumes of bird sound recordings, inspired by techniques that have proven
useful in other domains. We experimentally compare twelve different feature
representations derived from the Mel spectrum (of which six use this
technique), using four large and diverse databases of bird vocalisations, with
a random forest classifier. We demonstrate that MFCCs are of limited power in
this context, leading to worse performance than the raw Mel spectral data.
Conversely, we demonstrate that unsupervised feature learning provides a
substantial boost over MFCCs and Mel spectra without adding computational
complexity after the model has been trained. The boost is particularly notable
for single-label classification tasks at large scale. The spectro-temporal
activations learned through our procedure resemble spectro-temporal receptive
fields calculated from avian primary auditory forebrain.
","[{'version': 'v1', 'created': 'Mon, 26 May 2014 09:58:20 GMT'}]",2014-07-14,"[['Stowell', 'Dan', ''], ['Plumbley', 'Mark D.', '']]","['bioacoustics', 'machine learning', 'birds', 'classification', 'vocalisation', 'birdsong']"
2462,1903.02079,Nazeeh Ghatasheh,"Nazeeh Ghatasheh, Hossam Faris, Ibrahim Aljarah, Rizik M. H. Al-Sayyed",Optimizing Software Effort Estimation Models Using Firefly Algorithm,9 pages,"Journal of Software Engineering and Applications, 8, 133-142
  (2018)",10.4236/jsea.2015.83014,10.4236/jsea.2015.83014,cs.NE cs.AI cs.LG cs.SE stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Software development effort estimation is considered a fundamental task for
software development life cycle as well as for managing project cost, time and
quality. Therefore, accurate estimation is a substantial factor in projects
success and reducing the risks. In recent years, software effort estimation has
received a considerable amount of attention from researchers and became a
challenge for software industry. In the last two decades, many researchers and
practitioners proposed statistical and machine learning-based models for
software effort estimation. In this work, Firefly Algorithm is proposed as a
metaheuristic optimization method for optimizing the parameters of three
COCOMO-based models. These models include the basic COCOMO model and other two
models proposed in the literature as extensions of the basic COCOMO model. The
developed estimation models are evaluated using different evaluation metrics.
Experimental results show high accuracy and significant error minimization of
Firefly Algorithm over other metaheuristic optimization algorithms including
Genetic Algorithms and Particle Swarm Optimization.
","[{'version': 'v1', 'created': 'Tue, 8 Jan 2019 23:34:43 GMT'}]",2022-08-11,"[['Ghatasheh', 'Nazeeh', ''], ['Faris', 'Hossam', ''], ['Aljarah', 'Ibrahim', ''], ['Al-Sayyed', 'Rizik M. H.', '']]","['Software Quality', 'Effort Estimation', 'Metaheuristic Optimization', 'Firefly Algorithm']"
2463,0803.4370,L.T. Handoko,Z. Akbar and L.T. Handoko,GRID Architecture through a Public Cluster,"5 pages, Proceeding of the 2008 International Conference on Computer
  and Communication Engineering",,10.1109/ICCCE.2008.4580761,FISIKALIPI-08032,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An architecture to enable some blocks consisting of several nodes in a public
cluster connected to different grid collaborations is introduced. It is
realized by inserting a web-service in addition to the standard Globus Toolkit.
The new web-service performs two main tasks : authenticate the digital
certificate contained in an incoming requests and forward it to the designated
block. The appropriate block is mapped with the username of the block's owner
contained in the digital certificate. It is argued that this algorithm opens an
opportunity for any blocks in a public cluster to join various global grids.
","[{'version': 'v1', 'created': 'Mon, 31 Mar 2008 05:05:04 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Apr 2008 13:04:20 GMT'}, {'version': 'v3', 'created': 'Thu, 1 Jan 2009 01:58:27 GMT'}]",2009-03-06,"[['Akbar', 'Z.', ''], ['Handoko', 'L. T.', '']]","['distributed systems', 'public cluster', 'middleware', 'internet applications']"
2464,1707.04771,Andrey Bokovoy,Andrey Bokovoy and Konstantin Yakovlev,Original Loop-closure Detection Algorithm for Monocular vSLAM,,,10.1007/978-3-319-73013-4_19,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vision-based simultaneous localization and mapping (vSLAM) is a
well-established problem in mobile robotics and monocular vSLAM is one of the
most challenging variations of that problem nowadays. In this work we study one
of the core post-processing optimization mechanisms in vSLAM, e.g. loop-closure
detection. We analyze the existing methods and propose original algorithm for
loop-closure detection, which is suitable for dense, semi-dense and
feature-based vSLAM methods. We evaluate the algorithm experimentally and show
that it contribute to more accurate mapping while speeding up the monocular
vSLAM pipeline to the extent the latter can be used in real-time for
controlling small multi-rotor vehicle (drone).
","[{'version': 'v1', 'created': 'Sat, 15 Jul 2017 18:12:11 GMT'}]",2018-06-26,"[['Bokovoy', 'Andrey', ''], ['Yakovlev', 'Konstantin', '']]","['loop-closure', 'vision-based localization and mapping', 'unmanned aerial vehicle', 'SLAM', 'vSLAM']"
2465,2004.00482,Amelia Jim\'enez-S\'anchez,"Amelia Jim\'enez-S\'anchez, Diana Mateus, Sonja Kirchhoff, Chlodwig
  Kirchhoff, Peter Biberthaler, Nassir Navab, Miguel A. Gonz\'alez Ballester,
  Gemma Piella","Medical-based Deep Curriculum Learning for Improved Fracture
  Classification",MICCAI 2019,,10.1007/978-3-030-32226-7_77,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current deep-learning based methods do not easily integrate to clinical
protocols, neither take full advantage of medical knowledge. In this work, we
propose and compare several strategies relying on curriculum learning, to
support the classification of proximal femur fracture from X-ray images, a
challenging problem as reflected by existing intra- and inter-expert
disagreement. Our strategies are derived from knowledge such as medical
decision trees and inconsistencies in the annotations of multiple experts,
which allows us to assign a degree of difficulty to each training sample. We
demonstrate that if we start learning ""easy"" examples and move towards ""hard"",
the model can reach a better performance, even with fewer data. The evaluation
is performed on the classification of a clinical dataset of about 1000 X-ray
images. Our results show that, compared to class-uniform and random strategies,
the proposed medical knowledge-based curriculum, performs up to 15% better in
terms of accuracy, achieving the performance of experienced trauma surgeons.
","[{'version': 'v1', 'created': 'Wed, 1 Apr 2020 14:56:43 GMT'}]",2020-04-02,"[['Jiménez-Sánchez', 'Amelia', ''], ['Mateus', 'Diana', ''], ['Kirchhoff', 'Sonja', ''], ['Kirchhoff', 'Chlodwig', ''], ['Biberthaler', 'Peter', ''], ['Navab', 'Nassir', ''], ['Ballester', 'Miguel A. González', ''], ['Piella', 'Gemma', '']]","['Curriculum learning', 'multi-label classification', 'bone fractures', 'computer-aided diagnosis', 'medical decision trees']"
2466,1410.0328,Qing Wang,Qing Wang and Domenico Giustiniano and Daniele Puccinelli,An Open-Source Research Platform for Embedded Visible Light Networking,"7 pages, 5 figures; Published by the IEEE Wireless Communications
  Special Issue on Visible Light Communications (2015)",,10.1109/MWC.2015.7096291,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the growing interest in Visible Light Communication (VLC), a
reference networking platform based on commercial off-the-shelf components is
not available yet. An open-source platform would lower the barriers to entry to
VLC network research and help the VLC community gain momentum. We introduce
OpenVLC, an open-source VLC research platform based on software-defined
implementation. Built around a credit-card-sized embedded Linux platform with a
simple opto-electronic transceiver front-end, OpenVLC offers a basic physical
layer, a set of essential medium access primitives, as well as interoperability
with Internet protocols. We investigate the performance of OpenVLC and show
examples of how it can be used along with standard network diagnostics tools.
Our software-defined implementation can currently reach throughput in the order
of the basic rate of IEEE 802.15.7 standard. We discuss several techniques that
researchers and engineers could introduce to improve the performance of OpenVLC
and envision several directions that can benefit from OpenVLC by adopting it as
a reference platform.
","[{'version': 'v1', 'created': 'Wed, 1 Oct 2014 19:00:19 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Apr 2015 08:38:13 GMT'}]",2015-05-01,"[['Wang', 'Qing', ''], ['Giustiniano', 'Domenico', ''], ['Puccinelli', 'Daniele', '']]","['Networked VLC', 'open-source platform', 'low-cost', 'software-defined implementation', 'Linux driver']"
2467,1802.10233,Daniel Lemire,"Edmon Begoli, Jes\'us Camacho Rodr\'iguez, Julian Hyde, Michael J.
  Mior, Daniel Lemire","Apache Calcite: A Foundational Framework for Optimized Query Processing
  Over Heterogeneous Data Sources",SIGMOD'18,,10.1145/3183713.3190662,,cs.DB,http://creativecommons.org/licenses/by/4.0/,"  Apache Calcite is a foundational software framework that provides query
processing, optimization, and query language support to many popular
open-source data processing systems such as Apache Hive, Apache Storm, Apache
Flink, Druid, and MapD. Calcite's architecture consists of a modular and
extensible query optimizer with hundreds of built-in optimization rules, a
query processor capable of processing a variety of query languages, an adapter
architecture designed for extensibility, and support for heterogeneous data
models and stores (relational, semi-structured, streaming, and geospatial).
This flexible, embeddable, and extensible architecture is what makes Calcite an
attractive choice for adoption in big-data frameworks. It is an active project
that continues to introduce support for the new types of data sources, query
languages, and approaches to query processing and optimization.
","[{'version': 'v1', 'created': 'Wed, 28 Feb 2018 02:10:36 GMT'}]",2020-10-09,"[['Begoli', 'Edmon', ''], ['Rodríguez', 'Jesús Camacho', ''], ['Hyde', 'Julian', ''], ['Mior', 'Michael J.', ''], ['Lemire', 'Daniel', '']]","['Apache Calcite', 'Relational Semantics', 'Data Management', 'QueryAlgebra', 'Modular Query Optimization', 'Storage Adapters']"
2468,1408.2955,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",A Hoare-like logic of asserted single-pass instruction sequences,"22 pages, the preliminaries have textual overlaps with the
  preliminaries in arXiv:1402.4950 [cs.LO] and earlier papers; introduction and
  conclusions rewritten, explanatory remarks added; introduction partly
  rewritten; 24 pages, clarifying examples added","Scientific Annals of Computer Science, 26(2):125--156 (2016)",10.7561/SACS.2016.2.125,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a formal system for proving the partial correctness of a
single-pass instruction sequence as considered in program algebra by
decomposition into proofs of the partial correctness of segments of the
single-pass instruction sequence concerned. The system is similar to Hoare
logics, but takes into account that, by the presence of jump instructions,
segments of single-pass instruction sequences may have multiple entry points
and multiple exit points. It is intended to support a sound general
understanding of the issues with Hoare-like logics for low-level programming
languages.
","[{'version': 'v1', 'created': 'Wed, 13 Aug 2014 09:41:13 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Dec 2015 14:09:34 GMT'}, {'version': 'v3', 'created': 'Tue, 19 Jul 2016 11:54:17 GMT'}, {'version': 'v4', 'created': 'Wed, 3 May 2017 11:53:03 GMT'}]",2017-06-29,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['Hoare logic', 'asserted single-pass instruction sequence', 'soundness', 'completeness in the sense of Cook']"
2469,1201.2107,Naagesh Bhat S,Naagesh S. Bhat,Design and ASIC implementation of DUC/DDC for communication systems,,"International Journal of VLSI design & Communication Systems
  (VLSICS) Vol.2, No.4, December 2011",10.5121/vlsic.2011.2410,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Communication systems use the concept of transmitting information using the
electrical distribution network as a communication channel. To enable the
transmission data signal modulated on a carrier signal is superimposed on the
electrical wires. Typical power lines are designed to handle 50/60 Hz of AC
power signal; however they can carry the signals up to 500 KHz frequency. This
work aims to aid transmission/reception of an audio signal in the spectrum from
300 Hz to 4000 Hz using PLCC on a tunable carrier frequency in the spectrum
from 200 KHz to 500 KHz. For digital amplitude modulation the sampling rate of
the carrier and the audio signal has to be matched. Tunable carrier generation
can be achieved with Direct Digital Synthesizers at a desired sampling rate.
DSP Sample rate conversion techniques are very useful to make the sampling
circuits to work on their own sampling rates which are fine for the
data/modulated-carrier signal's bandwidth. This also simplifies the complexity
of the sampling circuits. Digital Up Conversion (DUC) and Digital Down
Conversion (DDC) are DSP sample rate conversion techniques which refer to
increasing and decreasing the sampling rate of a signal respectively.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2012 16:46:57 GMT'}]",2012-03-12,"[['Bhat', 'Naagesh S.', '']]","['Power Line Carrier Communication', 'Digital Down-Counter', 'Digital Up-Counter', 'Application Specific Integrated Circuit', 'Multi-VDD', 'TSMC']"
2470,1607.08479,David Guillermo Fajardo Ortiz,"David Fajardo-Ortiz, Josw Ortega-Sanchez-de-Tagle, Victor-M Castano","Hegemonic structure of basic, clinical and patented knowledge on Ebola
  research: a US army reductionist initiative",,Journal of Translational Medicine (2015) 13:124,10.1186/s12967-015-0496-y,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: In this paper, we present an approach to understand how the
basic, clinical and patent knowledge on Ebola is organized and
intercommunicated and what leading factor could be shaping the evolution of the
knowledge translation process for this disease. Methodology: A combination of
citation network analysis; analysis of Medical heading Subject (MeSH) and Gene
Ontology (GO) terms, and quantitative content analysis for patents and
scientific literature, aimed to map the organization of Ebola research was
carried out. Results: We found six putative research fronts (i.e. clusters of
high interconnected papers). Three research fronts are basic research on Ebola
virus structural proteins: glycoprotein, VP40 and VP35, respectively. There is
a fourth research front of basic research papers on pathogenesis, which is the
organizing hub of Ebola research. A fifth research front is pre-clinical
research focused on vaccines and glycoproteins. Finally, a
clinical-epidemiology research front related to the disease outbreaks was
identified. The network structure of patent families shows that the dominant
design is the use of Ebola virus proteins as targets of vaccines and other
immunological treatments. Therefore, patents network organization resembles the
organization of the scientific literature. Specifically, the knowledge on Ebola
would flow from higher (clinical-epidemiology) to intermediated
(cellular-tissular pathogenesis) to lower (molecular interactions) levels of
organization. Conclusion: Our results suggest a strong reductionist approach
for Ebola research probably influenced by the lethality of the disease. On the
other hand, the ownership profile of the patent families network and the main
researches relationship with the United State Army suggest a strong involvement
of this military institution in Ebola research.
","[{'version': 'v1', 'created': 'Tue, 12 Apr 2016 05:48:07 GMT'}]",2016-07-29,"[['Fajardo-Ortiz', 'David', ''], ['Ortega-Sanchez-de-Tagle', 'Josw', ''], ['Castano', 'Victor-M', '']]","['Knowledge translation', 'Emerging disease', 'National security', 'Ebola hemorrhagic fever']"
2471,1812.01886,Benjamin Matthiss,"Benjamin Matthiss, Arghavan Momenifarahani, Kay Ohnmeiss, Martin
  Felder","Influence of Demand and Generation Uncertainty on the Operational
  Efficiency of Smart Grids",6 pages,"2018 7th International Conference on Renewable Energy Research and
  Applications (ICRERA)",10.1109/ICRERA.2018.8566733,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To ensure the smooth and near optimal operation of storage and controllable
generation in a grid with a high share of renewable energies, it is important
to have accurate forecasts for load and generation. But even with the advanced
forecasts available today, the prediction error can have a significant impact
on the operation performance of the system. This paper compares and analyzes
the impact of the prediction-error on the operational performance in case of a
small virtual power plant.
","[{'version': 'v1', 'created': 'Wed, 5 Dec 2018 10:07:33 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Feb 2019 17:24:20 GMT'}]",2019-02-06,"[['Matthiss', 'Benjamin', ''], ['Momenifarahani', 'Arghavan', ''], ['Ohnmeiss', 'Kay', ''], ['Felder', 'Martin', '']]","['smart grids', 'power system control', 'power grids', 'probability distribution']"
2472,1810.09109,Olivier Cardin,"Olivier Cardin (PSI, LS2N, IUT NANTES), William Derigent (CRAN),
  Damien Trentesaux (LAMIH)","Evolution of holonic control architectures towards Industry 4.0: A short
  overview",,"INCOM 2018, 2018, Bergamo, Italy. 51 (11), pp.1243 - 1248, 2018",10.1016/j.ifacol.2018.08.420,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The flexibility claimed by the next generation production systems induces a
deep modification of the behavior and the core itself of the control systems.
Overconnectivity and data management abilities targeted by Industry 4.0
paradigm enable the emergence of more flexible and reactive control systems,
based on the cooperation of autonomous and connected entities in the decision
making process. For the last 20 years, holonic paradigm has become the core
paradigm of those evolutions, and evolved in itself. This contribution aims at
emphasizing the conceptual evolutions in the application of holonic paradigm in
the control architectures of manufacturing systems and highlighting the current
research trends in this field.
","[{'version': 'v1', 'created': 'Mon, 22 Oct 2018 06:49:57 GMT'}]",2018-10-23,"[['Cardin', 'Olivier', '', 'PSI, LS2N, IUT NANTES'], ['Derigent', 'William', '', 'CRAN'], ['Trentesaux', 'Damien', '', 'LAMIH']]","['Manufacturing systems', 'Industrial control', 'Holonic manufacturing systems', 'Control architecture', 'Industry 4.0']"
2473,0811.3387,"Matthias W\""ahlisch","Matthias W\""ahlisch, Thomas C. Schmidt and Georg Wittenburg","Broadcasting in Prefix Space: P2P Data Dissemination with Predictable
  Performance",final version for ICIW'09,"Matthias W\""ahlisch, Thomas C. Schmidt, and Georg Wittenburg,
  ""Broadcasting in Prefix Space: P2P Data Dissemination with Predictable
  Performance,"" in Proc. of the Fourth ICIW: IEEE ComSoc Press, 2009, pp. 74-83",10.1109/ICIW.2009.19,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A broadcast mode may augment peer-to-peer overlay networks with an efficient,
scalable data replication function, but may also give rise to a virtual link
layer in VPN-type solutions. We introduce a simple broadcasting mechanism that
operates in the prefix space of distributed hash tables without signaling. This
paper concentrates on the performance analysis of the prefix flooding scheme.
Starting from simple models of recursive $k$-ary trees, we analytically derive
distributions of hop counts and the replication load. Extensive simulation
results are presented further on, based on an implementation within the OverSim
framework. Comparisons are drawn to Scribe, taken as a general reference model
for group communication according to the shared, rendezvous-point-centered
distribution paradigm. The prefix flooding scheme thereby confirmed its widely
predictable performance and consistently outperformed Scribe in all metrics.
Reverse path selection in overlays is identified as a major cause of
performance degradation.
","[{'version': 'v1', 'created': 'Thu, 20 Nov 2008 17:56:17 GMT'}, {'version': 'v2', 'created': 'Mon, 25 May 2009 15:16:39 GMT'}]",2009-05-25,"[['Wählisch', 'Matthias', ''], ['Schmidt', 'Thomas C.', ''], ['Wittenburg', 'Georg', '']]","['Prefix flooding', 'DHT', 'random recursive kary trees', 'overlay network simulation', 'Pastry', 'Scribe']"
2474,1808.07432,Noah Apthorpe,"Trisha Datta, Noah Apthorpe, Nick Feamster","A Developer-Friendly Library for Smart Home IoT Privacy-Preserving
  Traffic Obfuscation","6 pages, 6 figures","Proceedings of the 2018 Workshop on IoT Security and Privacy,
  pages 43-48, August 2018",10.1145/3229565.3229567,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The number and variety of Internet-connected devices have grown enormously in
the past few years, presenting new challenges to security and privacy. Research
has shown that network adversaries can use traffic rate metadata from consumer
IoT devices to infer sensitive user activities. Shaping traffic flows to fit
distributions independent of user activities can protect privacy, but this
approach has seen little adoption due to required developer effort and overhead
bandwidth costs. Here, we present a Python library for IoT developers to easily
integrate privacy-preserving traffic shaping into their products. The library
replaces standard networking functions with versions that automatically
obfuscate device traffic patterns through a combination of payload padding,
fragmentation, and randomized cover traffic. Our library successfully preserves
user privacy and requires approximately 4 KB/s overhead bandwidth for IoT
devices with low send rates or high latency tolerances. This overhead is
reasonable given normal Internet speeds in American homes and is an improvement
on the bandwidth requirements of existing solutions.
","[{'version': 'v1', 'created': 'Wed, 22 Aug 2018 16:41:03 GMT'}]",2018-08-23,"[['Datta', 'Trisha', ''], ['Apthorpe', 'Noah', ''], ['Feamster', 'Nick', '']]","['Privacy', 'independent link padding', 'traffic shaping', 'Internet of Things']"
2475,1902.00363,Luiz Pessoa,Luiz Pessoa,"Intelligent architectures for robotics: The merging of cognition and
  emotion",7 figures,,10.1016/j.plrev.2019.04.009,,cs.RO cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  What is the place of emotion in intelligent robots? In the past two decades,
researchers have advocated for the inclusion of some emotion-related components
in the general information processing architecture of autonomous agents, say,
for better communication with humans, or to instill a sense of urgency to
action. The framework advanced here goes beyond these approaches and proposes
that emotion and motivation need to be integrated with all aspects of the
architecture. Thus, cognitive-emotional integration is a key design principle.
Emotion is not an ""add on"" that endows a robot with ""feelings"" (for instance,
reporting or expressing its internal state). It allows the significance of
percepts, plans, and actions to be an integral part of all its computations. It
is hypothesized that a sophisticated artificial intelligence cannot be built
from separate cognitive and emotional modules. A hypothetical test inspired by
the Turing test, called the Dolores test, is proposed to test this assertion.
","[{'version': 'v1', 'created': 'Fri, 1 Feb 2019 14:30:50 GMT'}]",2020-01-29,"[['Pessoa', 'Luiz', '']]","['robotics', 'emotion', 'cognition', 'integration', 'Dolores test   Highlights']"
2476,1804.07144,Deepika Singh,"Deepika Singh, Erinc Merdivan, Ismini Psychoula, Johannes Kropf, Sten
  Hanke, Matthieu Geist and Andreas Holzinger",Human Activity Recognition using Recurrent Neural Networks,,"International Cross-Domain Conference for Machine Learning and
  Knowledge Extraction: CD-MAKE 2017",10.1007/978-3-319-66808-6_18,,cs.NE cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human activity recognition using smart home sensors is one of the bases of
ubiquitous computing in smart environments and a topic undergoing intense
research in the field of ambient assisted living. The increasingly large amount
of data sets calls for machine learning methods. In this paper, we introduce a
deep learning model that learns to classify human activities without using any
prior knowledge. For this purpose, a Long Short Term Memory (LSTM) Recurrent
Neural Network was applied to three real world smart home datasets. The results
of these experiments show that the proposed approach outperforms the existing
ones in terms of accuracy and performance.
","[{'version': 'v1', 'created': 'Thu, 19 Apr 2018 13:20:09 GMT'}]",2018-04-20,"[['Singh', 'Deepika', ''], ['Merdivan', 'Erinc', ''], ['Psychoula', 'Ismini', ''], ['Kropf', 'Johannes', ''], ['Hanke', 'Sten', ''], ['Geist', 'Matthieu', ''], ['Holzinger', 'Andreas', '']]","['machine learning', 'deep learning', 'human activity recognition', 'sensors', 'ambient assisted living', 'LSTM']"
2477,1802.09620,Dariusz Dereniowski,Dariusz Dereniowski and Adam Sta\'nski,On tradeoffs between width- and fill-like graph parameters,,Theory of Computing Systems 63(3): 450-465 (2019),10.1007/s00224-018-9882-1,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we consider two two-criteria optimization problems: given an
input graph, the goal is to find its interval (or chordal) supergraph that
minimizes the number of edges and its clique number simultaneously. For the
interval supergraph, the problem can be restated as simultaneous minimization
of the pathwidth $pw(G)$ and the profile $p(G)$ of the input graph $G$. We
prove that for an arbitrary graph $G$ and an integer
$t\in\{1,\ldots,pw(G)+1\}$, there exists an interval supergraph $G'$ of $G$
such that for its clique number it holds
$\omega(G')\leq(1+\frac{2}{t})(pw(G)+1)$ and the number of its edges is bounded
by $|E(G')|\leq(t+2)p(G)$. In other words, the pathwidth and the profile of a
graph can be simultaneously minimized within the factors of $1+\frac{2}{t}$
(plus a small constant) and $t+2$, respectively. Note that for a fixed $t$,
both upper bounds provide constant factor approximations. On the negative side,
we show an example that proves that, for some graphs, there is no solution in
which both parameters are optimal.
  In case of finding a chordal supergraph, the two corresponding graph
parameters that reflect its clique size and number of edges are the treewidth
and fill-in. We obtain that the treewidth and the fill-in problems are also
`orthogonal' in the sense that for some graphs, a solution that minimizes one
of those parameters cannot minimize the other. As a motivating example, we
recall graph searching games which illustrates a need of simultaneous
minimization of these pairs of graph parameters.
","[{'version': 'v1', 'created': 'Mon, 26 Feb 2018 21:44:36 GMT'}]",2021-01-19,"[['Dereniowski', 'Dariusz', ''], ['Stański', 'Adam', '']]","['fill-in', 'graph searching', 'node search', 'pathwidth', 'profile', 'treewidth']"
2478,1610.09902,Shobhit Jain,"Shobhit Jain, Paolo Tiso, Daniel J. Rixen, Johannes B. Rutzmoser","A Quadratic Manifold for Model Order Reduction of Nonlinear Structural
  Dynamics",,,10.1016/j.compstruc.2017.04.005,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the use of a quadratic manifold for the model order
reduction of structural dynamics problems featuring geometric nonlinearities.
The manifold is tangent to a subspace spanned by the most relevant vibration
modes, and its curvature is provided by modal derivatives obtained by
sensitivity analysis of the eigenvalue problem, or its static approximation,
along the vibration modes. The construction of the quadratic manifold requires
minimal computational effort once the vibration modes are known. The reduced
order model is then obtained by Galerkin projection, where the
configuration-dependent tangent space of the manifold is used to project the
discretized equations of motion.
","[{'version': 'v1', 'created': 'Mon, 31 Oct 2016 12:57:21 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Feb 2017 17:11:18 GMT'}]",2017-05-22,"[['Jain', 'Shobhit', ''], ['Tiso', 'Paolo', ''], ['Rixen', 'Daniel J.', ''], ['Rutzmoser', 'Johannes B.', '']]","['Reduced Order Modeling', 'Nonlinear Manifold', 'Geometric Nonlinearities', 'Structural Dynamics']"
2479,1706.05839,Pavel Chebotarev,V.A. Malyshev and P.Yu. Chebotarev,On Optimal Group Claims at Voting in a Stochastic Environment,"13 pages, 9 figures","Automation and Remote Control, June 2017, Vol. 78, Issue 6, pp.
  1087-1100",10.1134/S0005117917060091,,cs.MA cs.SI cs.SY math.OC physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a paradox in the model of social dynamics determined by voting in a
stochastic environment (the ViSE model) called ""pit of losses."" It consists in
the fact that a series of democratic decisions may systematically lead the
society to the states unacceptable for all the voters. The paper examines how
this paradox can be neutralized by the presence in society of a group that
votes for its benefit and can regulate the threshold of its claims. We obtain
and analyze analytical results characterizing the welfare of the whole society,
the group, and the other participants as functions of the said claims
threshold.
","[{'version': 'v1', 'created': 'Mon, 19 Jun 2017 09:09:50 GMT'}]",2019-06-24,"[['Malyshev', 'V. A.', ''], ['Chebotarev', 'P. Yu.', '']]","['ViSE model', 'social dynamics', 'voting', 'stochastic environment', 'pit of losses']"
2480,1711.03473,Michel Melo Silva,"Michel Melo Silva, Washington Luis Souza Ramos, Felipe Cadar Chamone,
  Jo\~ao Pedro Klock Ferreira, Mario Fernando Montenegro Campos, Erickson
  Rangel Nascimento","Making a long story short: A Multi-Importance fast-forwarding egocentric
  videos with the emphasis on relevant objects","Accepted to publication in the Journal of Visual Communication and
  Image Representation (JVCI) 2018. Project website:
  https://www.verlab.dcc.ufmg.br/semantic-hyperlapse",,10.1016/j.jvcir.2018.02.013,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The emergence of low-cost high-quality personal wearable cameras combined
with the increasing storage capacity of video-sharing websites have evoked a
growing interest in first-person videos, since most videos are composed of
long-running unedited streams which are usually tedious and unpleasant to
watch. State-of-the-art semantic fast-forward methods currently face the
challenge of providing an adequate balance between smoothness in visual flow
and the emphasis on the relevant parts. In this work, we present the
Multi-Importance Fast-Forward (MIFF), a fully automatic methodology to
fast-forward egocentric videos facing these challenges. The dilemma of defining
what is the semantic information of a video is addressed by a learning process
based on the preferences of the user. Results show that the proposed method
keeps over $3$ times more semantic content than the state-of-the-art
fast-forward. Finally, we discuss the need of a particular video stabilization
technique for fast-forward egocentric videos.
","[{'version': 'v1', 'created': 'Thu, 9 Nov 2017 17:03:29 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Mar 2018 15:56:26 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Mar 2018 17:59:11 GMT'}]",2018-03-08,"[['Silva', 'Michel Melo', ''], ['Ramos', 'Washington Luis Souza', ''], ['Chamone', 'Felipe Cadar', ''], ['Ferreira', 'João Pedro Klock', ''], ['Campos', 'Mario Fernando Montenegro', ''], ['Nascimento', 'Erickson Rangel', '']]","['Semantic information', 'First-person video', 'Fast-forward', 'Egocentric stabilization']"
2481,1610.07442,Mohsen Ghafoorian,"Mohsen Ghafoorian, Nico Karssemeijer, Tom Heskes, Mayra Bergkamp,
  Joost Wissink, Jiri Obels, Karlijn Keizer, Frank-Erik de Leeuw, Bram van
  Ginneken, Elena Marchiori and Bram Platel","Deep Multi-scale Location-aware 3D Convolutional Neural Networks for
  Automated Detection of Lacunes of Presumed Vascular Origin","11 pages, 7 figures",Neuroimage Clin 14 (2017) 391-399,10.1016/j.nicl.2017.01.033,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lacunes of presumed vascular origin (lacunes) are associated with an
increased risk of stroke, gait impairment, and dementia and are a primary
imaging feature of the small vessel disease. Quantification of lacunes may be
of great importance to elucidate the mechanisms behind neuro-degenerative
disorders and is recommended as part of study standards for small vessel
disease research. However, due to the different appearance of lacunes in
various brain regions and the existence of other similar-looking structures,
such as perivascular spaces, manual annotation is a difficult, elaborative and
subjective task, which can potentially be greatly improved by reliable and
consistent computer-aided detection (CAD) routines.
  In this paper, we propose an automated two-stage method using deep
convolutional neural networks (CNN). We show that this method has good
performance and can considerably benefit readers. We first use a fully
convolutional neural network to detect initial candidates. In the second step,
we employ a 3D CNN as a false positive reduction tool. As the location
information is important to the analysis of candidate structures, we further
equip the network with contextual information using multi-scale analysis and
integration of explicit location features. We trained, validated and tested our
networks on a large dataset of 1075 cases obtained from two different studies.
Subsequently, we conducted an observer study with four trained observers and
compared our method with them using a free-response operating characteristic
analysis. Shown on a test set of 111 cases, the resulting CAD system exhibits
performance similar to the trained human observers and achieves a sensitivity
of 0.974 with 0.13 false positives per slice. A feasibility study also showed
that a trained human observer would considerably benefit once aided by the CAD
system.
","[{'version': 'v1', 'created': 'Mon, 24 Oct 2016 14:51:47 GMT'}, {'version': 'v2', 'created': 'Sat, 29 Oct 2016 13:14:32 GMT'}]",2017-03-01,"[['Ghafoorian', 'Mohsen', ''], ['Karssemeijer', 'Nico', ''], ['Heskes', 'Tom', ''], ['Bergkamp', 'Mayra', ''], ['Wissink', 'Joost', ''], ['Obels', 'Jiri', ''], ['Keizer', 'Karlijn', ''], ['de Leeuw', 'Frank-Erik', ''], ['van Ginneken', 'Bram', ''], ['Marchiori', 'Elena', ''], ['Platel', 'Bram', '']]","['lacunes', 'automated detection', 'convolutional neural networks', 'deep learning', 'multi-scale', 'location-aware']"
2482,1707.04651,Kai Salomaa,"Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa",Outfix-guided insertion,,,10.1016/j.tcs.2017.03.040,,cs.FL,http://creativecommons.org/licenses/by/4.0/,"  Motivated by work on bio-operations on DNA strings, we consider an
outfix-guided insertion operation that can be viewed as a generalization of the
overlap assembly operation on strings studied previously. As the main result we
construct a finite language $L$ such that the outfix-guided insertion closure
of $L$ is non-regular. We consider also the closure properties of regular and
(deterministic) context-free languages under the outfix-guided insertion
operation and decision problems related to outfix-guided insertion. Deciding
whether a language recognized by a deterministic finite automaton is closed
under outfix-guided insertion can be done in polynomial time. The complexity of
the corresponding question for nondeterministic finite automata remains open.
","[{'version': 'v1', 'created': 'Fri, 14 Jul 2017 22:01:36 GMT'}]",2017-07-18,"[['Cho', 'Da-Jung', ''], ['Han', 'Yo-Sub', ''], ['Ng', 'Timothy', ''], ['Salomaa', 'Kai', '']]","['language operations', 'closure properties', 'regular languages']"
2483,1005.1737,Secretary Aircc Journal,"Kavi K. Khedo, Rajiv Perseedoss and Avinash Mungur, University of
  Mauritius, Mauritius",A Wireless Sensor Network Air Pollution Monitoring System,"15 Pages, IJWMN","International Journal of Wireless & Mobile Networks 2.2 (2010)
  31-45",10.5121/ijwmn.2010.2203,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Sensor networks are currently an active research area mainly due to the
potential of their applications. In this paper we investigate the use of
Wireless Sensor Networks (WSN) for air pollution monitoring in Mauritius. With
the fast growing industrial activities on the island, the problem of air
pollution is becoming a major concern for the health of the population. We
proposed an innovative system named Wireless Sensor Network Air Pollution
Monitoring System (WAPMS) to monitor air pollution in Mauritius through the use
of wireless sensors deployed in huge numbers around the island. The proposed
system makes use of an Air Quality Index (AQI) which is presently not available
in Mauritius. In order to improve the efficiency of WAPMS, we have designed and
implemented a new data aggregation algorithm named Recursive Converging
Quartiles (RCQ). The algorithm is used to merge data to eliminate duplicates,
filter out invalid readings and summarise them into a simpler form which
significantly reduce the amount of data to be transmitted to the sink and thus
saving energy. For better power management we used a hierarchical routing
protocol in WAPMS and caused the motes to sleep during idle time.
","[{'version': 'v1', 'created': 'Tue, 11 May 2010 07:44:21 GMT'}]",2010-07-15,"[['Khedo', 'Kavi K.', ''], ['Perseedoss', 'Rajiv', ''], ['Mungur', 'Avinash', ''], ['Mauritius', 'University of', ''], ['Mauritius', '', '']]","['Sensor Networks', 'Routing Protocol', 'Data Aggregation', 'Air Pollution Monitoring', 'Data Fusion']"
2484,1603.00961,Jan Egger,"Tobias L\""uddemann, Jan Egger","Interactive and Scale Invariant Segmentation of the Rectum/Sigmoid via
  User-Defined Templates","6 pages, 4 figures, 1 table, 43 references","SPIE Medical Imaging Conference 2016, Paper 9784-113",10.1117/12.2216226,,cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Among all types of cancer, gynecological malignancies belong to the 4th most
frequent type of cancer among women. Besides chemotherapy and external beam
radiation, brachytherapy is the standard procedure for the treatment of these
malignancies. In the progress of treatment planning, localization of the tumor
as the target volume and adjacent organs of risks by segmentation is crucial to
accomplish an optimal radiation distribution to the tumor while simultaneously
preserving healthy tissue. Segmentation is performed manually and represents a
time-consuming task in clinical daily routine. This study focuses on the
segmentation of the rectum/sigmoid colon as an Organ-At-Risk in gynecological
brachytherapy. The proposed segmentation method uses an interactive,
graph-based segmentation scheme with a user-defined template. The scheme
creates a directed two dimensional graph, followed by the minimal cost closed
set computation on the graph, resulting in an outlining of the rectum. The
graphs outline is dynamically adapted to the last calculated cut. Evaluation
was performed by comparing manual segmentations of the rectum/sigmoid colon to
results achieved with the proposed method. The comparison of the algorithmic to
manual results yielded to a Dice Similarity Coefficient value of 83.85+/-4.08%,
in comparison to 83.97+/-8.08% for the comparison of two manual segmentations
of the same physician. Utilizing the proposed methodology resulted in a median
time of 128 seconds per dataset, compared to 300 seconds needed for pure manual
segmentation.
","[{'version': 'v1', 'created': 'Thu, 3 Mar 2016 03:39:59 GMT'}]",2016-08-24,"[['Lüddemann', 'Tobias', ''], ['Egger', 'Jan', '']]","['Segmentation', 'Interactive', 'Scale Invariant', 'Longitudinal', 'Graph-Cut']"
2485,1807.00556,Julia Lasserre,"Julia Lasserre, Katharina Rasch, Roland Vollgraf",Studio2Shop: from studio photo shoots to fashion articles,"12 pages, 9 figures (Figure 1 has 5 subfigures, Figure 2 has 3
  subfigures), 7 tables","Proceedings of the 7th International Conference on Pattern
  Recognition Applications and Methods (January 16-18, 2018, in Funchal,
  Madeira, Portugal), Vol. 1 (ISBN 978-989-758-276-9), P. 37-48",10.5220/0006544500370048,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fashion is an increasingly important topic in computer vision, in particular
the so-called street-to-shop task of matching street images with shop images
containing similar fashion items. Solving this problem promises new means of
making fashion searchable and helping shoppers find the articles they are
looking for. This paper focuses on finding pieces of clothing worn by a person
in full-body or half-body images with neutral backgrounds. Such images are
ubiquitous on the web and in fashion blogs, and are typically studio photos, we
refer to this setting as studio-to-shop. Recent advances in computational
fashion include the development of domain-specific numerical representations.
Our model Studio2Shop builds on top of such representations and uses a deep
convolutional network trained to match a query image to the numerical feature
vectors of all the articles annotated in this image. Top-$k$ retrieval
evaluation on test query images shows that the correct items are most often
found within a range that is sufficiently small for building realistic visual
search engines for the studio-to-shop setting.
","[{'version': 'v1', 'created': 'Mon, 2 Jul 2018 09:26:58 GMT'}]",2018-07-03,"[['Lasserre', 'Julia', ''], ['Rasch', 'Katharina', ''], ['Vollgraf', 'Roland', '']]","['computer vision', 'deep learning', 'fashion', 'item recognition', 'street-to-shop']"
2486,2107.03158,Markus Bayer,"Markus Bayer, Marc-Andr\'e Kaufhold, Christian Reuter",A Survey on Data Augmentation for Text Classification,"44 pages, 5 figures, 9 tables",ACM Computing Surveys (2022),10.1145/3544558,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data augmentation, the artificial creation of training data for machine
learning by transformations, is a widely studied research field across machine
learning disciplines. While it is useful for increasing a model's
generalization capabilities, it can also address many other challenges and
problems, from overcoming a limited amount of training data, to regularizing
the objective, to limiting the amount data used to protect privacy. Based on a
precise description of the goals and applications of data augmentation and a
taxonomy for existing works, this survey is concerned with data augmentation
methods for textual classification and aims to provide a concise and
comprehensive overview for researchers and practitioners. Derived from the
taxonomy, we divide more than 100 methods into 12 different groupings and give
state-of-the-art references expounding which methods are highly promising by
relating them to each other. Finally, research perspectives that may constitute
a building block for future work are provided.
","[{'version': 'v1', 'created': 'Wed, 7 Jul 2021 11:37:03 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Jul 2021 12:46:29 GMT'}, {'version': 'v3', 'created': 'Tue, 31 Aug 2021 08:54:08 GMT'}, {'version': 'v4', 'created': 'Thu, 17 Mar 2022 12:31:22 GMT'}, {'version': 'v5', 'created': 'Fri, 22 Jul 2022 13:20:30 GMT'}, {'version': 'v6', 'created': 'Thu, 8 Sep 2022 08:21:18 GMT'}]",2022-09-09,"[['Bayer', 'Markus', ''], ['Kaufhold', 'Marc-André', ''], ['Reuter', 'Christian', '']]","['Data Augmentation', 'Low Data Regimes', 'Small Data Analytics']"
2487,1203.0231,Tapalina Bhattasali,"Tapalina Bhattasali, Rituparna Chaki, Sugata Sanyal",Sleep Deprivation Attack Detection in Wireless Sensor Network,"7 pages,4 figures, IJCA Journal February 2012","International Journal of Computer Applications 40(15):19-25,
  February 2012. Published by Foundation of Computer Science, New York, USA",10.5120/5056-7374 10.5120/5056-7374 10.5120/5056-7374 10.5120/5056-7374,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deployment of sensor network in hostile environment makes it mainly
vulnerable to battery drainage attacks because it is impossible to recharge or
replace the battery power of sensor nodes. Among different types of security
threats, low power sensor nodes are immensely affected by the attacks which
cause random drainage of the energy level of sensors, leading to death of the
nodes. The most dangerous type of attack in this category is sleep deprivation,
where target of the intruder is to maximize the power consumption of sensor
nodes, so that their lifetime is minimized. Most of the existing works on sleep
deprivation attack detection involve a lot of overhead, leading to poor
throughput. The need of the day is to design a model for detecting intrusions
accurately in an energy efficient manner. This paper proposes a hierarchical
framework based on distributed collaborative mechanism for detecting sleep
deprivation torture in wireless sensor network efficiently. Proposed model uses
anomaly detection technique in two steps to reduce the probability of false
intrusion.
","[{'version': 'v1', 'created': 'Thu, 1 Mar 2012 16:19:43 GMT'}]",2012-03-02,"[['Bhattasali', 'Tapalina', ''], ['Chaki', 'Rituparna', ''], ['Sanyal', 'Sugata', '']]","['Sleep Deprivation Attack', 'Wireless Sensor Network', 'Hierarchical', 'Collaborative']"
2488,1711.03933,Amritanshu Agrawal,"Akond Rahman, Amritanshu Agrawal, Rahul Krishna, and Alexander Sobran","Characterizing The Influence of Continuous Integration. Empirical
  Results from 250+ Open Source and Proprietary Projects",7 pages. Accepted to SWAN Workshop 2018 co-located with FSE 2018,,10.1145/3278142.3278149,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Continuous integration (CI) tools integrate code changes by automatically
compiling, building, and executing test cases upon submission of code changes.
Use of CI tools is getting increasingly popular, yet how proprietary projects
reap the benefits of CI remains unknown. To investigate the influence of CI on
software development, we analyze 150 open source software (OSS) projects, and
123 proprietary projects. For OSS projects, we observe the expected benefits
after CI adoption, e.g., improvements in bug and issue resolution. However, for
the proprietary projects, we cannot make similar observations. Our findings
indicate that only adoption of CI might not be enough to the improve software
development process. CI can be effective for software development if
practitioners use CI's feedback mechanism efficiently, by applying the practice
of making frequent commits. For our set of proprietary projects we observe
practitioners commit less frequently, and hence not use CI effectively for
obtaining feedback on the submitted code changes. Based on our findings we
recommend industry practitioners to adopt the best practices of CI to reap the
benefits of CI tools for example, making frequent commits.
","[{'version': 'v1', 'created': 'Fri, 10 Nov 2017 17:46:05 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Feb 2018 20:50:52 GMT'}, {'version': 'v3', 'created': 'Thu, 6 Sep 2018 01:59:14 GMT'}, {'version': 'v4', 'created': 'Fri, 14 Sep 2018 13:39:03 GMT'}]",2018-09-17,"[['Rahman', 'Akond', ''], ['Agrawal', 'Amritanshu', ''], ['Krishna', 'Rahul', ''], ['Sobran', 'Alexander', '']]","['Continuous Integration', 'DevOps', 'GitHub', 'Mining Software Repositories', 'Software Development Practice']"
2489,1701.06446,Krzysztof Domino,"Krzysztof Domino, Piotr Gawron","Algorithm for an arbitrary-order cumulant tensor calculation in a
  sliding window of data streams",,"Int. J. Appl. Math. Comput. Sci., 2019, Vol. 29, No. 1, 195-206",10.2478/amcs-2019-0015,,cs.DS cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  High order cumulant tensors carry information about statistics of
non-normally distributed multivariate data. In this work we present a new
efficient algorithm for calculation of cumulants of arbitrary order in a
sliding window for data streams. We showed that this algorithms enables
speedups of cumulants updates compared to current algorithms. This algorithm
can be used for processing on-line high-frequency multivariate data and can
find applications in, e.g., on-line signal filtering and classification of data
streams.
  To present an application of this algorithm, we propose an estimator of
non-Gaussianity of a data stream based on the norms of high-order cumulant
tensors.
  We show how to detect the transition from Gaussian distributed data to
non-Gaussian ones in a~data stream. In order to achieve high implementation
efficiency of operations on super-symmetric tensors, such as cumulant tensors,
we employ the block structure to store and calculate only one hyper-pyramid
part of such tensors.
","[{'version': 'v1', 'created': 'Fri, 20 Jan 2017 11:51:35 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Apr 2018 07:24:48 GMT'}, {'version': 'v3', 'created': 'Thu, 4 Oct 2018 07:39:07 GMT'}]",2022-10-06,"[['Domino', 'Krzysztof', ''], ['Gawron', 'Piotr', '']]","['High order cumulants', 'time-series statistics', 'non-normally distributed data', 'data streaming']"
2490,1808.06489,Anh Nguyen Duc,"Anh Nguyen-Duc, Daniela S. Cruzes, Snarby Terje, Pekka Abrahamsson","Do software firms collaborate or compete? A model of coopetition in
  community-initiated OSS projects",arXiv admin note: text overlap with arXiv:1711.07049,"e-Informatica Software Engineering Journal, 2019",10.5277/e-Inf190102,,cs.CY cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  [Background] An increasing number of commercial firms are participating in
Open Source Software (OSS) projects to reduce their development cost and
increase technical innovativeness. When collaborating with other firms whose
sought values are conflicts of interests, firms may behave uncooperatively
leading to harmful impacts on the common goal. [Aim] This study explores how
software firms both collaborate and compete in OSS projects. [Method] We
adopted a mixed research method on three OSS projects. [Result] We found that
commercial firms participating in community-initiated OSS projects collaborate
in various ways across the organizational boundaries. While most of firms
contribute little, a small number of firms that are very active and account for
large proportions of contributions. We proposed a conceptual model to explain
for coopetition among software firms in OSS projects. The model shows two
aspects of coopetition can be managed at the same time based on firm
gatekeepers. [Conclusion] Firms need to operationalize their coopetition
strategies to maximize value gained from participating in OSS projects.
","[{'version': 'v1', 'created': 'Thu, 16 Aug 2018 18:19:38 GMT'}]",2019-09-13,"[['Nguyen-Duc', 'Anh', ''], ['Cruzes', 'Daniela S.', ''], ['Terje', 'Snarby', ''], ['Abrahamsson', 'Pekka', '']]","['COSS', 'coopetition', 'collaboration', 'competition', 'Open source software', 'case study']"
2491,1511.04717,Fayrouz Soualah-Alila,"Fayrouz Soualah-Alila (L3I), Cyril Faucher (L3I), Fr\'ed\'eric
  Bertrand (L3I), Micka\""el Coustaty (L3I), Antoine Doucet (L3I)","Applying Semantic Web Technologies for Improving the Visibility of
  Tourism Data","ESAIR: Exploiting Semantic Annotations in Information Retrieval, Oct
  2015, Melbourne, Austria. 2015",,10.1145/2810133.2810137,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tourism industry is an extremely information-intensive, complex and dynamic
activity. It can benefit from semantic Web technologies, due to the significant
heterogeneity of information sources and the high volume of on-line data. The
management of semantically diverse annotated tourism data is facilitated by
ontologies that provide methods and standards, which allow flexibility and more
intelligent access to on-line data. This paper provides a description of some
of the early results of the Tourinflux project which aims to apply semantic Web
technologies to support tourist actors in effectively finding and publishing
information on the Web.
","[{'version': 'v1', 'created': 'Sun, 15 Nov 2015 15:55:21 GMT'}]",2015-11-17,"[['Soualah-Alila', 'Fayrouz', '', 'L3I'], ['Faucher', 'Cyril', '', 'L3I'], ['Bertrand', 'Frédéric', '', 'L3I'], ['Coustaty', 'Mickaël', '', 'L3I'], ['Doucet', 'Antoine', '', 'L3I']]","['Tourinflux', 'TourInFrance', 'Ontology', 'Schema']"
2492,1107.3729,Sundararajan Natarajan,Stephane PA Bordas and Sundararajan Natarajan,On the approximation in the smoothed finite element method (SFEM),"14 pages, 9 figures, 1 table; International Journal for Numerical
  Methods in Engineering, 2010",,10.1002/nme.2713,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This letter aims at resolving the issues raised in the recent short
communication [1] and answered by [2] by proposing a systematic approximation
scheme based on non-mapped shape functions, which both allows to fully exploit
the unique advantages of the smoothed finite element method (SFEM) [3, 4, 5, 6,
7, 8, 9] and resolve the existence, linearity and positivity deficiencies
pointed out in [1]. We show that Wachspress interpolants [10] computed in the
physical coordinate system are very well suited to the SFEM, especially when
elements are heavily distorted (obtuse interior angles). The proposed
approximation leads to results which are almost identical to those of the SFEM
initially proposed in [3]. These results that the proposed approximation scheme
forms a strong and rigorous basis for construction of smoothed finite element
methods.
","[{'version': 'v1', 'created': 'Tue, 19 Jul 2011 14:46:28 GMT'}]",2011-07-20,"[['Bordas', 'Stephane PA', ''], ['Natarajan', 'Sundararajan', '']]","['Smoothed Finite Element Method', 'boundary integration', 'Wachspress Interpolants', 'strain smoothing', 'rational basis finite elements', 'SFEM', 'isoparametric']"
2493,1507.03372,Nicol\`o Navarin,"Giovanni Da San Martino, Nicol\`o Navarin, Alessandro Sperduti",Ordered Decompositional DAG Kernels Enhancements,Paper accepted for publication in Neurocomputing,"Neurocomputing, Volume 192, 5 June 2016, Pages 92--103",10.1016/j.neucom.2015.12.110,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we show how the Ordered Decomposition DAGs (ODD) kernel
framework, a framework that allows the definition of graph kernels from tree
kernels, allows to easily define new state-of-the-art graph kernels. Here we
consider a fast graph kernel based on the Subtree kernel (ST), and we propose
various enhancements to increase its expressiveness. The proposed DAG kernel
has the same worst-case complexity as the one based on ST, but an improved
expressivity due to an augmented set of features. Moreover, we propose a novel
weighting scheme for the features, which can be applied to other kernels of the
ODD framework. These improvements allow the proposed kernels to improve on the
classification performances of the ST-based kernel for several real-world
datasets, reaching state-of-the-art performances.
","[{'version': 'v1', 'created': 'Mon, 13 Jul 2015 09:50:41 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Dec 2015 14:03:57 GMT'}]",2016-07-21,"[['Martino', 'Giovanni Da San', ''], ['Navarin', 'Nicolò', ''], ['Sperduti', 'Alessandro', '']]","['Kernel Methods', 'kernel functions', 'Graph Kernels', 'Classification']"
2494,1707.06937,Kathleen Gregory,"Kathleen Gregory, Paul Groth, Helena Cousijn, Andrea Scharnhorst,
  Sally Wyatt","Searching Data: A Review of Observational Data Retrieval Practices in
  Selected Disciplines",,"Journal of the Association for Information Science and Technology.
  (2019). 70(5), 419-432",10.1002/asi.24165,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A cross-disciplinary examination of the user behaviours involved in seeking
and evaluating data is surprisingly absent from the research data discussion.
This review explores the data retrieval literature to identify commonalities in
how users search for and evaluate observational research data. Two analytical
frameworks rooted in information retrieval and science technology studies are
used to identify key similarities in practices as a first step toward
developing a model describing data retrieval.
","[{'version': 'v1', 'created': 'Fri, 21 Jul 2017 15:36:10 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Jul 2018 12:51:08 GMT'}, {'version': 'v3', 'created': 'Tue, 23 Oct 2018 14:43:24 GMT'}, {'version': 'v4', 'created': 'Thu, 12 Mar 2020 09:07:40 GMT'}]",2020-03-13,"[['Gregory', 'Kathleen', ''], ['Groth', 'Paul', ''], ['Cousijn', 'Helena', ''], ['Scharnhorst', 'Andrea', ''], ['Wyatt', 'Sally', '']]","['data retrieval', 'data search', 'data reuse', 'information seeking behavior', 'observational data']"
2495,1002.0937,EPTCS,"Francisco Martins (University of Lisbon), Lu\'is Lopes (University of
  Porto), Jo\~ao Barros (University of Porto)",Towards the Safe Programming of Wireless Sensor Networks,,"EPTCS 17, 2010, pp. 49-62",10.4204/EPTCS.17.5,,cs.PL cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sensor networks are rather challenging to deploy, program, and debug. Current
programming languages for these platforms suffer from a significant semantic
gap between their specifications and underlying implementations. This fact
precludes the development of (type-)safe applications, which would potentially
simplify the task of programming and debugging deployed networks. In this paper
we define a core calculus for programming sensor networks and propose to use it
as an assembly language for developing type-safe, high-level programming
languages.
","[{'version': 'v1', 'created': 'Thu, 4 Feb 2010 09:46:48 GMT'}]",2010-02-05,"[['Martins', 'Francisco', '', 'University of Lisbon'], ['Lopes', 'Luís', '', 'University of\n  Porto'], ['Barros', 'João', '', 'University of Porto']]","['Sensor Networks', 'Programming Languages', 'Process-Calculi']"
2496,1511.08096,Ad\`ele Paul-Hus,"Philippe Mongeon, Adele Paul-Hus","The Journal Coverage of Web of Science and Scopus: a Comparative
  Analysis","Accepted for publication in Scientometrics. 17 pages, 6 Figures, 4
  Tables",,10.1007/s11192-015-1765-5,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bibliometric methods are used in multiple fields for a variety of purposes,
namely for research evaluation. Most bibliometric analyses have in common their
data sources: Thomson Reuters' Web of Science (WoS) and Elsevier's Scopus. This
research compares the journal coverage of both databases in terms of fields,
countries and languages, using Ulrich's extensive periodical directory as a
base for comparison. Results indicate that the use of either WoS or Scopus for
research evaluation may introduces biases that favor Natural Sciences and
Engineering as well as Biomedical Research to the detriment of Social Sciences
and Arts and Humanities. Similarly, English-language journals are
overrepresented to the detriment of other languages. While both databases share
these biases, their coverage differs substantially. As a consequence, the
results of bibliometric analyses may vary depending on the database used.
","[{'version': 'v1', 'created': 'Wed, 25 Nov 2015 15:46:48 GMT'}]",2015-11-26,"[['Mongeon', 'Philippe', ''], ['Paul-Hus', 'Adele', '']]","['Bibliometrics', 'citations indexes', 'Scopus', 'Web of Science', 'research evaluation']"
2497,1408.0651,Matteo Brunelli,Matteo Brunelli and Michele Fedrizzi,"Boundary properties of the inconsistency of pairwise comparisons in
  group decisions","21 pages, 6 figures","European Journal of Operational Research, 240(3), 765-773, 2015",10.1016/j.ejor.2014.07.045,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes an analysis of the effects of consensus and preference
aggregation on the consistency of pairwise comparisons. We define some boundary
properties for the inconsistency of group preferences and investigate their
relation with different inconsistency indices. Some results are presented on
more general dependencies between properties of inconsistency indices and the
satisfaction of boundary properties. In the end, given three boundary
properties and nine indices among the most relevant ones, we will be able to
present a complete analysis of what indices satisfy what properties and offer a
reflection on the interpretation of the inconsistency of group preferences.
","[{'version': 'v1', 'created': 'Mon, 4 Aug 2014 11:45:42 GMT'}]",2016-04-06,"[['Brunelli', 'Matteo', ''], ['Fedrizzi', 'Michele', '']]","['Pairwise comparison matrix', 'inconsistency indices', 'boundary properties', 'group decision making', 'analytic hierarchy process']"
2498,2102.07317,Qi Luo,"Qi Luo, Samitha Samaranayake, Siddhartha Banerjee","Multimodal Mobility Systems: Joint Optimization of Transit Network
  Design and Pricing",'21 ACM/IEEE International Conference on Cyber-Physical Systems,,10.1145/3450267.3450540,,cs.CE cs.SY eess.SY math.OC,http://creativecommons.org/licenses/by/4.0/,"  The performance of multimodal mobility systems relies on the seamless
integration of conventional mass transit services and the advent of
Mobility-on-Demand (MoD) services. Prior work is limited to individually
improving various transport networks' operations or linking a new mode to an
existing system. In this work, we attempt to solve transit network design and
pricing problems of multimodal mobility systems en masse. An operator (public
transit agency or private transit operator) determines the frequency settings
of the mass transit system, flows of the MoD service, and prices for each trip
to optimize the overall welfare. A primal-dual approach, inspired by the market
design literature, yields a compact mixed integer linear programming (MILP)
formulation. However, a key computational challenge remains in allocating an
exponential number of hybrid modes accessible to travelers. We provide a
tractable solution approach through a decomposition scheme and approximation
algorithm that accelerates the computation and enables optimization of
large-scale problem instances. Using a case study in Nashville, Tennessee, we
demonstrate the value of the proposed model. We also show that our algorithm
reduces the average runtime by 60\% compared to advanced MILP solvers. This
result seeks to establish a generic and simple-to-implement way of revamping
and redesigning regional mobility systems in order to meet the increase in
travel demand and integrate traditional fixed-line mass transit systems with
new demand-responsive services.
","[{'version': 'v1', 'created': 'Mon, 15 Feb 2021 03:10:30 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Apr 2021 21:02:54 GMT'}, {'version': 'v3', 'created': 'Fri, 21 May 2021 15:41:34 GMT'}]",2021-05-24,"[['Luo', 'Qi', ''], ['Samaranayake', 'Samitha', ''], ['Banerjee', 'Siddhartha', '']]","['Multimodal mobility systems', 'Market design', 'Mixed Interger Programming']"
2499,1612.02218,Wim Abbeloos,"Stef Van Wolputte, Wim Abbeloos, Stijn Helsen, Abdellatif
  Bey-Temsamani, Toon Goedem\'e","Embedded Line Scan Image Sensors: The Low Cost Alternative for High
  Speed Imaging","2015 International Conference on Image Processing Theory, Tools and
  Applications (IPTA)","Proceedings of the International Conference on Image Processing
  Theory, Tools and Applications (2015) 543-549",10.1109/IPTA.2015.7367207,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a low-cost high-speed imaging line scan system. We
replace an expensive industrial line scan camera and illumination with a
custom-built set-up of cheap off-the-shelf components, yielding a measurement
system with comparative quality while costing about 20 times less. We use a
low-cost linear (1D) image sensor, cheap optics including a LED-based or
LASER-based lighting and an embedded platform to process the images. A
step-by-step method to design such a custom high speed imaging system and
select proper components is proposed. Simulations allowing to predict the final
image quality to be obtained by the set-up has been developed. Finally, we
applied our method in a lab, closely representing the real-life cases. Our
results shows that our simulations are very accurate and that our low-cost line
scan set-up acquired image quality compared to the high-end commercial vision
system, for a fraction of the price.
","[{'version': 'v1', 'created': 'Wed, 7 Dec 2016 12:27:26 GMT'}]",2016-12-08,"[['Van Wolputte', 'Stef', ''], ['Abbeloos', 'Wim', ''], ['Helsen', 'Stijn', ''], ['Bey-Temsamani', 'Abdellatif', ''], ['Goedemé', 'Toon', '']]","['Low-cost', 'Line scan', 'Linear Sensor', 'Embedded', 'Optics']"
2500,1309.5491,"Martin Dr\""axler","Martin Dr\""axler, Johannes Blobel, Philipp Dreimann, Stefan Valentin,
  Holger Karl","Anticipatory Buffer Control and Quality Selection for Wireless Video
  Streaming",,,10.1109/NetSys.2015.7089073,,cs.NI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video streaming is in high demand by mobile users, as recent studies
indicate. In cellular networks, however, the unreliable wireless channel leads
to two major problems. Poor channel states degrade video quality and interrupt
the playback when a user cannot sufficiently fill its local playout buffer:
buffer underruns occur. In contrast to that, good channel conditions cause
common greedy buffering schemes to pile up very long buffers. Such
over-buffering wastes expensive wireless channel capacity.
  To keep buffering in balance, we employ a novel approach. Assuming that we
can predict data rates, we plan the quality and download time of the video
segments ahead. This anticipatory scheduling avoids buffer underruns by
downloading a large number of segments before a channel outage occurs, without
wasting wireless capacity by excessive buffering. We formalize this approach as
an optimization problem and derive practical heuristics for segmented video
streaming protocols (e.g., HLS or MPEG DASH). Simulation results and testbed
measurements show that our solution essentially eliminates playback
interruptions without significantly decreasing video quality.
","[{'version': 'v1', 'created': 'Sat, 21 Sep 2013 15:40:29 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Aug 2014 12:44:16 GMT'}]",2015-04-22,"[['Dräxler', 'Martin', ''], ['Blobel', 'Johannes', ''], ['Dreimann', 'Philipp', ''], ['Valentin', 'Stefan', ''], ['Karl', 'Holger', '']]","['Video Streaming', 'HLS', 'MPEG-DASH', 'Scheduling']"
2501,1512.00061,Syed (Shawon) Rahman,Kathleen Jungck and Shawon Rahman,Cloud Computing Avoids Downfall of Application Service Providers,,,10.5121/ijitcs.2011.1301,,cs.DC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Businesses have become dependent on ever increasing amounts of electronic
information and rapid transaction speeds. Experts such as Diffie speculate that
the end of isolated computing is at hand, and that within the next decade most
businesses will have made the shift to utility computing. In order to cut costs
while still implementing increasingly complex Information Technology services,
many companies turned to Application Service Providers (ASPs). Due to poor
business models, over competition, and poor internet availability and
bandwidth, many ASPs failed with the dot com crash. Other ASPs, however, who
embraced web services architecture and true internet delivery were well placed
as early cloud adopters. With the expanded penetration and bandwidth of
internet services today, better business plans, and a wide divergence of
offering, cloud computing is avoiding the ASP downfall, and is positioned to
emerge as an enduring paradigm in computing
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2015 21:54:58 GMT'}]",2015-12-02,"[['Jungck', 'Kathleen', ''], ['Rahman', 'Shawon', '']]","['Application Service Provider', 'ASP', 'Cloud Computing', 'Utility Computing', 'Virtual Data Center']"
2502,1511.05078,Kevin Boyack,Richard Klavans and Kevin W. Boyack,"Which type of citation analysis generates the most accurate taxonomy of
  scientific and technical knowledge?","26 pages, 4 figures, 7 tables","JASIST, 68(4), pp. 984-998 (2017)",10.1002/asi.23734,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 1965, Derek de Solla Price foresaw the day when a citation-based taxonomy
of science and technology would be delineated and correspondingly used for
science policy. A taxonomy needs to be comprehensive and accurate if it is to
be useful for policy making, especially now that policy makers are utilizing
citation-based indicators to evaluate people, institutions and laboratories.
Determining the accuracy of a taxonomy, however, remains a challenge. Previous
work on the accuracy of partition solutions is sparse, and the results of those
studies, while useful, have not been definitive. In this study we compare the
accuracies of topic-level taxonomies based on the clustering of documents using
direct citation, bibliographic coupling, and co-citation. Using a set of new
gold standards - articles with at least 100 references - we find that direct
citation is better at concentrating references than either bibliographic
coupling or co-citation. Using the assumption that higher concentrations of
references denote more accurate clusters, direct citation thus provides a more
accurate representation of the taxonomy of scientific and technical knowledge
than either bibliographic coupling or co-citation. We also find that
discipline-level taxonomies based on journal schema are highly inaccurate
compared to topic-level taxonomies, and recommend against their use.
","[{'version': 'v1', 'created': 'Mon, 16 Nov 2015 18:35:22 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Feb 2016 22:03:50 GMT'}]",2017-09-12,"[['Klavans', 'Richard', ''], ['Boyack', 'Kevin W.', '']]","['science mapping', 'taxonomy', 'classification', 'direct citation', 'gold standards', 'accuracy']"
2503,1009.0402,Murat Kayri,Murat Kayri and Ozlem Cakir,"An Applied Study on Educational Use of Facebook as a Web 2.0 Tool: The
  Sample Lesson of Computer Networks and Communication",11 pages,,10.5121/ijcsit.2010.2405,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The main aim of the research was to examine educational use of Facebook. The
Computer Networks and Communication lesson was taken as the sample and the
attitudes of the students included in the study group towards Facebook were
measured in a semi-experimental setup. The students on Facebook platform were
examined for about three months and they continued their education
interactively in that virtual environment. After the-three-month-education
period, observations for the students were reported and the attitudes of the
students towards Facebook were measured by three different measurement tools.
As a result, the attitudes of the students towards educational use of Facebook
and their views were heterogeneous. When the average values of the group were
examined, it was reported that the attitudes towards educational use of
Facebook was above a moderate level. Therefore, it might be suggested that
social networks in virtual environments provide continuity in life long
learning.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2010 12:10:47 GMT'}]",2010-09-03,"[['Kayri', 'Murat', ''], ['Cakir', 'Ozlem', '']]","['Social networks', 'Facebook', 'Web 2']"
2504,1907.09867,Stefania  Costantini,Stefania Costantini,About epistemic negation and world views in Epistemic Logic Programs,"Paper presented at the 35th International Conference on Logic
  Programming (ICLP 2019), Las Cruces, New Mexico, USA, 20-25 September 2019,
  16 pages",Theory and Practice of Logic Programming 19 (2019) 790-807,10.1017/S147106841900019X,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider Epistemic Logic Programs, which extend Answer Set
Programming (ASP) with ""epistemic operators"" and ""epistemic negation"", and a
recent approach to the semantics of such programs in terms of World Views. We
propose some observations on the existence and number of world views. We show
how to exploit an extended ASP semantics in order to: (i) provide a
characterization of world views, different from existing ones; (ii) query world
views and query the whole set of world views.
","[{'version': 'v1', 'created': 'Tue, 23 Jul 2019 13:29:10 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Jul 2019 21:09:05 GMT'}]",2020-02-19,"[['Costantini', 'Stefania', '']]","['Answer Set Programming', 'Epistemic Logic Programs', 'Epistemic Negation']"
2505,0711.4217,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",Instruction sequences with dynamically instantiated instructions,25 pages; phrasing improved,"Fundamenta Informaticae, 96(1--2):27--48, 2009",10.3233/FI-2009-165,PRG0710,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study sequential programs that are instruction sequences with dynamically
instantiated instructions. We define the meaning of such programs in two
different ways. In either case, we give a translation by which each program
with dynamically instantiated instructions is turned into a program without
them that exhibits on execution the same behaviour by interaction with some
service. The complexity of the translations differ considerably, whereas the
services concerned are equally simple. However, the service concerned in the
case of the simpler translation is far more powerful than the service concerned
in the other case.
","[{'version': 'v1', 'created': 'Tue, 27 Nov 2007 10:24:34 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Dec 2007 08:06:27 GMT'}, {'version': 'v3', 'created': 'Wed, 2 Jul 2008 08:08:28 GMT'}, {'version': 'v4', 'created': 'Tue, 4 Aug 2009 06:37:50 GMT'}]",2010-01-12,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['instruction sequence', 'dynamically instantiated instruction', 'projection semantics', 'program algebra', 'thread algebra', 'action transforming use mechanism']"
2506,1406.7424,Hiroki Sayama,"Andreas D. Pape, Kenneth J. Kurtz, Hiroki Sayama",Complexity Measures and Concept Learning,"27 pages, 7 tables, 1 figure. Accepted for publication in Journal of
  Mathematical Psychology, in press","Journal of Mathematical Psychology, vol. 64-65, pp. 66-75, 2015",10.1016/j.jmp.2015.01.001,,cs.IT cs.LG math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The nature of concept learning is a core question in cognitive science.
Theories must account for the relative difficulty of acquiring different
concepts by supervised learners. For a canonical set of six category types, two
distinct orderings of classification difficulty have been found. One ordering,
which we call paradigm-specific, occurs when adult human learners classify
objects with easily distinguishable characteristics such as size, shape, and
shading. The general order occurs in all other known cases: when adult humans
classify objects with characteristics that are not readily distinguished (e.g.,
brightness, saturation, hue); for children and monkeys; and when categorization
difficulty is extrapolated from errors in identification learning. The
paradigm-specific order was found to be predictable mathematically by measuring
the logical complexity of tasks, i.e., how concisely the solution can be
represented by logical rules.
  However, logical complexity explains only the paradigm-specific order but not
the general order. Here we propose a new difficulty measurement, information
complexity, that calculates the amount of uncertainty remaining when a subset
of the dimensions are specified. This measurement is based on Shannon entropy.
We show that, when the metric extracts minimal uncertainties, this new
measurement predicts the paradigm-specific order for the canonical six category
types, and when the metric extracts average uncertainties, this new measurement
predicts the general order. Moreover, for learning category types beyond the
canonical six, we find that the minimal-uncertainty formulation correctly
predicts the paradigm-specific order as well or better than existing metrics
(Boolean complexity and GIST) in most cases.
","[{'version': 'v1', 'created': 'Sat, 28 Jun 2014 17:58:59 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Nov 2014 13:42:13 GMT'}, {'version': 'v3', 'created': 'Fri, 23 Jan 2015 16:28:08 GMT'}]",2015-03-03,"[['Pape', 'Andreas D.', ''], ['Kurtz', 'Kenneth J.', ''], ['Sayama', 'Hiroki', '']]","['Concepts', 'Induction', 'Complexity', 'Learning']"
2507,1310.5220,Sumeet Kaur Sehra,"Sumeet Kaur Sehra, Dr. Yadwinder Singh Brar, Dr. Navdeep Kaur","Multi criteria decision making approach for selecting effort estimation
  model",,"International Journal of Computer Applications 39(1):10-17,
  February 2012",10.5120/4783-6989,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Effort Estimation has always been a challenging task for the Project
managers. Many researchers have tried to help them by creating different types
of models. This has been already proved that none is successful for all types
of projects and every type of environment. Analytic Hierarchy Process has been
identified as the tool that would help in Multi Criteria Decision Making.
Researchers have identified that Analytic Hierarchy Process can be used for the
comparison of effort estimation of different models and techniques. But the
problem with traditional Analytic Hierarchy Process is its inability to deal
with the imprecision and subjectivity in the pairwise comparison process. The
motive of this paper is to propose Fuzzy Analytic Hierarchy Process, which can
be used to rectify the subjectivity and imprecision of Analytic Hierarchy
Process and can be used for selecting the type of Model best suited for
estimating the effort for a given problem type or environment. Instead of
single crisp value, Fuzzy Analytic Hierarchy Process uses a range of values to
incorporate decision maker uncertainty. From this range, decision maker can
select the value that reflects his confidence and also he can specify his
attitude like optimistic, pessimistic or moderate. In this work, the comparison
of Analytic Hierarchy Process and Fuzzy Analytic Hierarchy Process is concluded
using a case study of selection of effort estimation model.
","[{'version': 'v1', 'created': 'Sat, 19 Oct 2013 12:12:21 GMT'}]",2013-10-22,"[['Sehra', 'Sumeet Kaur', ''], ['Brar', 'Dr. Yadwinder Singh', ''], ['Kaur', 'Dr. Navdeep', '']]","['Effort Estimation', 'Fuzzy Multiple Criteria Decision Making', 'Expert Judgment', 'Analytic Hierarchy Process']"
2508,1911.10154,Camilo Miguel Signorelli,"Camilo M. Signorelli, Xerxes D. Arsiwalla","Moral Dilemmas for Artificial Intelligence: a position paper on an
  application of Compositional Quantum Cognition","15 pages, 3 figures, Conference paper at Quantum Interaction 2018,
  Nice, France. Published in Lecture Notes in Computer Science, vol 11690,
  Springer, Cham. Online ISBN 978-3-030-35895-2","Quantum Interaction. QI 2018. Lecture Notes in Computer Science,
  vol 11690",10.1007/978-3-030-35895-2_9,,cs.AI cs.CL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Traditionally, the way one evaluates the performance of an Artificial
Intelligence (AI) system is via a comparison to human performance in specific
tasks, treating humans as a reference for high-level cognition. However, these
comparisons leave out important features of human intelligence: the capability
to transfer knowledge and make complex decisions based on emotional and
rational reasoning. These decisions are influenced by current inferences as
well as prior experiences, making the decision process strongly subjective and
apparently biased. In this context, a definition of compositional intelligence
is necessary to incorporate these features in future AI tests. Here, a concrete
implementation of this will be suggested, using recent developments in quantum
cognition, natural language and compositional meaning of sentences, thanks to
categorical compositional models of meaning.
","[{'version': 'v1', 'created': 'Fri, 22 Nov 2019 17:25:32 GMT'}]",2019-11-25,"[['Signorelli', 'Camilo M.', ''], ['Arsiwalla', 'Xerxes D.', '']]","['Moral Dilemmas', 'Moral Test', 'Turing Test', 'Artificial Intelligence', 'Compositional Semantics', 'Natural Language', 'Quantum Cognition']"
2509,2008.09159,Ryan Amos,"Ryan Amos, Gunes Acar, Eli Lucherini, Mihir Kshirsagar, Arvind
  Narayanan, Jonathan Mayer","Privacy Policies over Time: Curation and Analysis of a Million-Document
  Dataset","16 pages, 13 figures, public dataset","In Proceedings of the Web Conference 2021 (WWW '21), April 19-23,
  2021, Ljubljana, Slovenia. ACM, New York, NY, USA, 12 pages",10.1145/3442381.3450048,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Automated analysis of privacy policies has proved a fruitful research
direction, with developments such as automated policy summarization, question
answering systems, and compliance detection. Prior research has been limited to
analysis of privacy policies from a single point in time or from short spans of
time, as researchers did not have access to a large-scale, longitudinal,
curated dataset. To address this gap, we developed a crawler that discovers,
downloads, and extracts archived privacy policies from the Internet Archive's
Wayback Machine. Using the crawler and following a series of validation and
quality control steps, we curated a dataset of 1,071,488 English language
privacy policies, spanning over two decades and over 130,000 distinct websites.
  Our analyses of the data paint a troubling picture of the transparency and
accessibility of privacy policies. By comparing the occurrence of
tracking-related terminology in our dataset to prior web privacy measurements,
we find that privacy policies have consistently failed to disclose the presence
of common tracking technologies and third parties. We also find that over the
last twenty years privacy policies have become even more difficult to read,
doubling in length and increasing a full grade in the median reading level. Our
data indicate that self-regulation for first-party websites has stagnated,
while self-regulation for third parties has increased but is dominated by
online advertising trade associations. Finally, we contribute to the literature
on privacy regulation by demonstrating the historic impact of the GDPR on
privacy policies.
","[{'version': 'v1', 'created': 'Thu, 20 Aug 2020 19:00:37 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Sep 2020 14:55:59 GMT'}, {'version': 'v3', 'created': 'Wed, 26 May 2021 12:24:21 GMT'}, {'version': 'v4', 'created': 'Tue, 20 Jul 2021 19:09:53 GMT'}]",2021-07-22,"[['Amos', 'Ryan', ''], ['Acar', 'Gunes', ''], ['Lucherini', 'Eli', ''], ['Kshirsagar', 'Mihir', ''], ['Narayanan', 'Arvind', ''], ['Mayer', 'Jonathan', '']]","['privacy policy', 'web tracking', 'data protection', 'open dataset']"
2510,1012.5306,Jiapu Zhang,Jiapu Zhang,"An optimization strategy on prion AGAAAAGA amyloid fibril molecular
  modeling","Central European Journal of Bioliogy (2012) DOI:
  10.2478/s11535-011-0088-7",,10.2478/s11535-011-0088-7,,cs.CE physics.bio-ph q-bio.BM q-bio.QM,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  X-ray crystallography and nuclear magnetic resonance (NMR) spectroscopy are
two powerful tools to determine the protein 3D structure. However, not all
proteins can be successfully crystallized, particularly for membrane proteins.
Although NMR spectroscopy is indeed very powerful in determining the 3D
structures of membrane proteins, same as X-ray crystallography, it is still
very time-consuming and expensive. Under many circumstances, due to the
noncrystalline and insoluble nature of some proteins, X-ray and NMR cannot be
used at all. Computational approaches, however, allow us to obtain a
description of the protein 3D structure at a submicroscopic level.
  To the best of the author's knowledge, there is little structural data
available to date on the AGAAAAGA palindrome in the hydrophobic region
(113--120) of prion proteins, which falls just within the N-terminal
unstructured region (1--123) of prion proteins. Many experimental studies have
shown that the AGAAAAGA region has amyloid fibril forming properties and plays
an important role in prion diseases. However, due to the noncrystalline and
insoluble nature of the amyloid fibril, little structural data on the AGAAAAGA
is available. This paper introduces a simple optimization strategy approach to
address the 3D atomic-resolution structure of prion AGAAAAGA amyloid fibrils.
Atomic-resolution structures of prion AGAAAAGA amyloid fibrils got in this
paper are useful for the drive to find treatments for prion diseases in the
field of medicinal chemistry.
","[{'version': 'v1', 'created': 'Thu, 23 Dec 2010 21:25:42 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Apr 2011 02:52:42 GMT'}, {'version': 'v3', 'created': 'Mon, 23 May 2011 05:03:10 GMT'}]",2019-12-11,"[['Zhang', 'Jiapu', '']]","['Prion AGAAAAGA palindrome', 'amyloid fibril', 'molecular modeling', 'priondieseases']"
2511,2006.04153,Wenjie Wang,"Wenjie Wang, Fuli Feng, Xiangnan He, Liqiang Nie, Tat-Seng Chua",Denoising Implicit Feedback for Recommendation,,"2021. In Proceedings of the Fourteenth ACM International
  Conference on Web Search and Data Mining (WSDM'21)",10.1145/3437963.3441800,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ubiquity of implicit feedback makes them the default choice to build
online recommender systems. While the large volume of implicit feedback
alleviates the data sparsity issue, the downside is that they are not as clean
in reflecting the actual satisfaction of users. For example, in E-commerce, a
large portion of clicks do not translate to purchases, and many purchases end
up with negative reviews. As such, it is of critical importance to account for
the inevitable noises in implicit feedback for recommender training. However,
little work on recommendation has taken the noisy nature of implicit feedback
into consideration.
  In this work, we explore the central theme of denoising implicit feedback for
recommender training. We find serious negative impacts of noisy implicit
feedback,i.e., fitting the noisy data prevents the recommender from learning
the actual user preference. Our target is to identify and prune noisy
interactions, so as to improve the quality of recommender training. By
observing the process of normal recommender training, we find that noisy
feedback typically has large loss values in the early stages. Inspired by this
observation, we propose a new training strategy namedAdaptive Denoising
Training(ADT), which adaptively prunes noisy interactions during training.
Specifically, we devise two paradigms for adaptive loss formulation: Truncated
Loss that discards the large-loss samples with a dynamic threshold in each
iteration; and reweighted Loss that adaptively lowers the weight of large-loss
samples. We instantiate the two paradigms on the widely used binary
cross-entropy loss and test the proposed ADT strategies on three representative
recommenders. Extensive experiments on three benchmarks demonstrate that ADT
significantly improves the quality of recommendation over normal training.
","[{'version': 'v1', 'created': 'Sun, 7 Jun 2020 13:55:36 GMT'}, {'version': 'v2', 'created': 'Sun, 3 Jan 2021 09:03:12 GMT'}]",2021-01-05,"[['Wang', 'Wenjie', ''], ['Feng', 'Fuli', ''], ['He', 'Xiangnan', ''], ['Nie', 'Liqiang', ''], ['Chua', 'Tat-Seng', '']]","['Recommender System', 'False-positive Feedback', 'Adaptive DenoisingTraining']"
2512,1710.04312,Kyle Hundman,"Kyle Hundman, Chris A. Mattmann","Measurement Context Extraction from Text: Discovering Opportunities and
  Gaps in Earth Science",,"23rd ACM SIGKDD International Conference on Knowledge Discovery
  and Data Mining, Data-Driven Discovery Workshop, Halifax, Canada, August 2017",,,cs.IR cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose Marve, a system for extracting measurement values, units, and
related words from natural language text. Marve uses conditional random fields
(CRF) to identify measurement values and units, followed by a rule-based system
to find related entities, descriptors and modifiers within a sentence. Sentence
tokens are represented by an undirected graphical model, and rules are based on
part-of-speech and word dependency patterns connecting values and units to
contextual words. Marve is unique in its focus on measurement context and early
experimentation demonstrates Marve's ability to generate high-precision
extractions with strong recall. We also discuss Marve's role in refining
measurement requirements for NASA's proposed HyspIRI mission, a hyperspectral
infrared imaging satellite that will study the world's ecosystems. In general,
our work with HyspIRI demonstrates the value of semantic measurement
extractions in characterizing quantitative discussion contained in large
corpuses of natural language text. These extractions accelerate broad,
cross-cutting research and expose scientists new algorithmic approaches and
experimental nuances. They also facilitate identification of scientific
opportunities enabled by HyspIRI leading to more efficient scientific
investment and research.
","[{'version': 'v1', 'created': 'Wed, 11 Oct 2017 21:37:07 GMT'}]",2017-10-13,"[['Hundman', 'Kyle', ''], ['Mattmann', 'Chris A.', '']]","['Natural Language Processing', 'Knowledge Discovery', 'InformationRetrieval', 'Measurement Extraction', 'Remote Sensing', 'Earth Science']"
2513,2004.12733,Noemi Mauro,"Noemi Mauro, Liliana Ardissono and Federica Cena",Personalized Recommendation of PoIs to People with Autism,,"Proceedings of the 28th ACM Conference on User Modeling,
  Adaptation and Personalization (UMAP 2020)",10.1145/3340631.3394845,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The suggestion of Points of Interest to people with Autism Spectrum Disorder
(ASD) challenges recommender systems research because these users' perception
of places is influenced by idiosyncratic sensory aversions which can mine their
experience by causing stress and anxiety. Therefore, managing individual
preferences is not enough to provide these people with suitable
recommendations. In order to address this issue, we propose a Top-N
recommendation model that combines the user's idiosyncratic aversions with
her/his preferences in a personalized way to suggest the most compatible and
likable Points of Interest for her/him. We are interested in finding a
user-specific balance of compatibility and interest within a recommendation
model that integrates heterogeneous evaluation criteria to appropriately take
these aspects into account. We tested our model on both ASD and ""neurotypical""
people. The evaluation results show that, on both groups, our model outperforms
in accuracy and ranking capability the recommender systems based on item
compatibility, on user preferences, or which integrate these two aspects by
means of a uniform evaluation model.
","[{'version': 'v1', 'created': 'Mon, 27 Apr 2020 12:04:58 GMT'}]",2020-04-28,"[['Mauro', 'Noemi', ''], ['Ardissono', 'Liliana', ''], ['Cena', 'Federica', '']]","['Recommender Systems', 'Autism Spectrum Disorder', 'accessibility']"
2514,1106.3326,Sylvain Lavernhe,"Lo\""ic Andolfatto (LURPA), Ren\'e Mayer (LRFV), Sylvain Lavernhe
  (LURPA)","Adaptive Monte Carlo applied to uncertainty estimation in a five axis
  machine tool link errors identification",,"International Journal of Machine Tools and Manufacture 51, 7-8
  (2011) July-August 2011, Pages 618-627",10.1016/j.ijmachtools.2011.03.006,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge of a machine tool axis to axis location errors allows compensation
and correcting actions to be taken to enhance its volumetric accuracy. Several
procedures exist, involving either lengthy individual test for each geometric
error or faster single tests to identify all errors at once. This study focuses
on the closed kinematic Cartesian chain method which uses a single setup test
to identify the eight link errors of a five axis machine tool. The
identification is based on volumetric error measurements for different poses
with a non-contact measuring instrument called CapBall, developed in house. In
order to evaluate the uncertainty on each identified error, a multi-output
Monte Carlo approach is implemented. Uncertainty sources in the measurement and
identification chain - such as sensors output, machine drift and frame
transformation uncertainties - can be included in the model and propagated to
the identified errors. The estimated uncertainties are finally compared to
experimental results to assess the method. It shows that the effect of the
drift, a disturbance, must be simulated as a function of time the Monte Carlo
approach. The machine drift is found to be an important uncertainty in sources
for the machine tested.
","[{'version': 'v1', 'created': 'Thu, 16 Jun 2011 06:45:06 GMT'}]",2011-06-20,"[['Andolfatto', 'Loïc', '', 'LURPA'], ['Mayer', 'René', '', 'LRFV'], ['Lavernhe', 'Sylvain', '', 'LURPA']]","['Machine tool', 'link errors', 'identification', 'adaptive Monte Carlo', 'uncertainty', 'thermal disturbance']"
2515,1709.02897,Samin Aref,"Samin Aref, David Friggens and Shaun Hendy","Analysing Scientific Collaborations of New Zealand Institutions using
  Scopus Bibliometric Data","10 pages, 15 figures, accepted author copy with link to research
  data, Analysing Scientific Collaborations of New Zealand Institutions using
  Scopus Bibliometric Data. In Proceedings of ACSW 2018: Australasian Computer
  Science Week 2018, January 29-February 2, 2018, Brisbane, QLD, Australia",,10.1145/3167918.3167920,,cs.DL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scientific collaborations are among the main enablers of development in small
national science systems. Although analysing scientific collaborations is a
well-established subject in scientometrics, evaluations of scientific
collaborations within a country remain speculative with studies based on a
limited number of fields or using data too inadequate to be representative of
collaborations at a national level. This study represents a unique view on the
collaborative aspect of scientific activities in New Zealand. We perform a
quantitative study based on all Scopus publications in all subjects for more
than 1500 New Zealand institutions over a period of 6 years to generate an
extensive mapping of scientific collaboration at a national level. The
comparative results reveal the level of collaboration between New Zealand
institutions and business enterprises, government institutions, higher
education providers, and private not for profit organisations in 2010-2015.
Constructing a collaboration network of institutions, we observe a power-law
distribution indicating that a small number of New Zealand institutions account
for a large proportion of national collaborations. Network centrality concepts
are deployed to identify the most central institutions of the country in terms
of collaboration. We also provide comparative results on 15 universities and
Crown research institutes based on 27 subject classifications.
","[{'version': 'v1', 'created': 'Sat, 9 Sep 2017 03:07:03 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Nov 2017 09:44:49 GMT'}, {'version': 'v3', 'created': 'Sun, 17 Dec 2017 22:09:49 GMT'}, {'version': 'v4', 'created': 'Thu, 18 Jan 2018 08:16:19 GMT'}]",2018-01-19,"[['Aref', 'Samin', ''], ['Friggens', 'David', ''], ['Hendy', 'Shaun', '']]","['Big data modelling', 'Scientific collaboration', 'Scientometrics', 'Network analysis', 'Scopus', 'New Zealand']"
2516,1612.08813,Ahmed Mateen Mr.,"Ahmed Mateen, Marriam Nazir, Salman Afsar Awan",Optimization of Test Case Generation using Genetic Algorithm (GA),9 pages,"International Journal of Computer Applications Foundation of
  Computer Science (FCS), NY, USA Volume 151 - Number 7 Year of Publication:
  2016",10.5120/ijca2016911703,,cs.SE cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Testing provides means pertaining to assuring software performance. The total
aim of software industry is actually to make a certain start associated with
high quality software for the end user. However, associated with software
testing has quite a few underlying concerns, which are very important and need
to pay attention on these issues. These issues are effectively generating,
prioritization of test cases, etc. These issues can be overcome by paying
attention and focus. Solitary of the greatest Problems in the software testing
area is usually how to acquire a great proper set associated with cases to
confirm software. Some other strategies and also methodologies are proposed
pertaining to shipping care of most of these issues. Genetic Algorithm (GA)
belongs to evolutionary algorithms. Evolutionary algorithms have a significant
role in the automatic test generation and many researchers are focusing on it.
In this study explored software testing related issues by using the GA
approach. In addition to right after applying some analysis, better solution
produced, that is feasible and reliable. The particular research presents the
implementation of GAs because of its generation of optimized test cases. Along
these lines, this paper gives proficient system for the optimization of test
case generation using genetic algorithm.
","[{'version': 'v1', 'created': 'Wed, 28 Dec 2016 06:55:53 GMT'}]",2016-12-30,"[['Mateen', 'Ahmed', ''], ['Nazir', 'Marriam', ''], ['Awan', 'Salman Afsar', '']]","['Optimization', 'Genetic Algorithm', 'Test case', 'Generation', 'Design', 'Testing']"
2517,1504.02141,Shehroz Khan,"Shehroz S. Khan, Michelle E. Karg, Dana Kulic, Jesse Hoey",Detecting Falls with X-Factor Hidden Markov Models,"27 pages, 4 figures, 3 tables, Applied Soft Computing, 2017","Applied Soft Computing Volume 55, June 2017, Pages 168-177",10.1016/j.asoc.2017.01.034,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identification of falls while performing normal activities of daily living
(ADL) is important to ensure personal safety and well-being. However, falling
is a short term activity that occurs infrequently. This poses a challenge to
traditional classification algorithms, because there may be very little
training data for falls (or none at all). This paper proposes an approach for
the identification of falls using a wearable device in the absence of training
data for falls but with plentiful data for normal ADL. We propose three
`X-Factor' Hidden Markov Model (XHMMs) approaches. The XHMMs model unseen falls
using ""inflated"" output covariances (observation models). To estimate the
inflated covariances, we propose a novel cross validation method to remove
""outliers"" from the normal ADL that serve as proxies for the unseen falls and
allow learning the XHMMs using only normal activities. We tested the proposed
XHMM approaches on two activity recognition datasets and show high detection
rates for falls in the absence of fall-specific training data. We show that the
traditional method of choosing a threshold based on maximum of negative of
log-likelihood to identify unseen falls is ill-posed for this problem. We also
show that supervised classification methods perform poorly when very limited
fall data are available during the training phase.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2015 22:02:27 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Jun 2015 00:57:15 GMT'}, {'version': 'v3', 'created': 'Mon, 21 Sep 2015 23:20:48 GMT'}, {'version': 'v4', 'created': 'Thu, 30 Jun 2016 20:48:13 GMT'}, {'version': 'v5', 'created': 'Fri, 20 Jan 2017 20:18:15 GMT'}]",2018-02-02,"[['Khan', 'Shehroz S.', ''], ['Karg', 'Michelle E.', ''], ['Kulic', 'Dana', ''], ['Hoey', 'Jesse', '']]","['Fall Detection', 'Hidden Markov Models', 'X-Factor', 'Outlier Detection']"
2518,1311.3877,Ratko Tomic V,Ratko V. Tomic,Optimal Networks from Error Correcting Codes,"14 pages, accepted at ANCS 2013 conference","Proc. ACM/IEEE ANCS 2013, pp. 169-180",10.1109/ANCS.2013.6665199,,cs.IT cs.NI math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To address growth challenges facing large Data Centers and supercomputing
clusters a new construction is presented for scalable, high throughput, low
latency networks. The resulting networks require 1.5-5 times fewer switches,
2-6 times fewer cables, have 1.2-2 times lower latency and correspondingly
lower congestion and packet losses than the best present or proposed networks
providing the same number of ports at the same total bisection. These advantage
ratios increase with network size. The key new ingredient is the exact
equivalence discovered between the problem of maximizing network bisection for
large classes of practically interesting Cayley graphs and the problem of
maximizing codeword distance for linear error correcting codes. Resulting
translation recipe converts existent optimal error correcting codes into
optimal throughput networks.
","[{'version': 'v1', 'created': 'Sun, 27 Oct 2013 05:02:53 GMT'}]",2014-03-25,"[['Tomic', 'Ratko V.', '']]","['Data center', 'HPC', 'network topology', 'integrated control plane', 'Ethernet', 'InfiniBand', 'bisection', 'topology']"
2519,cs/0605035,Filip Radlinski,Filip Radlinski and Thorsten Joachims,Query Chains: Learning to Rank from Implicit Feedback,10 pages,"Proceedings of the ACM Conference on Knowledge Discovery and Data
  Mining (KDD), ACM, 2005",,,cs.LG cs.IR,,"  This paper presents a novel approach for using clickthrough data to learn
ranked retrieval functions for web search results. We observe that users
searching the web often perform a sequence, or chain, of queries with a similar
information need. Using query chains, we generate new types of preference
judgments from search engine logs, thus taking advantage of user intelligence
in reformulating queries. To validate our method we perform a controlled user
study comparing generated preference judgments to explicit relevance judgments.
We also implemented a real-world search engine to test our approach, using a
modified ranking SVM to learn an improved ranking function from preference
data. Our results demonstrate significant improvements in the ranking given by
the search engine. The learned rankings outperform both a static ranking
function, as well as one trained without considering query chains.
","[{'version': 'v1', 'created': 'Mon, 8 May 2006 22:05:24 GMT'}]",2007-05-23,"[['Radlinski', 'Filip', ''], ['Joachims', 'Thorsten', '']]","['Search Engines', 'Implicit Feedback', 'Machine Learning', 'Support Vector Machines', 'Clickthrough Data']"
2520,1912.06415,Sudhakar Singh,"Pankaj Singh, Sudhakar Singh, P. K. Mishra, Rakhi Garg","RDD-Eclat: Approaches to Parallelize Eclat Algorithm on Spark RDD
  Framework","16 pages, 6 figures, ICCNCT 2019","ICCNCT 2019, LNDECT 44",10.1007/978-3-030-37051-0_85,ICCNCT-171,cs.DC cs.DB cs.DS cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Initially, a number of frequent itemset mining (FIM) algorithms have been
designed on the Hadoop MapReduce, a distributed big data processing framework.
But, due to heavy disk I/O, MapReduce is found to be inefficient for such
highly iterative algorithms. Therefore, Spark, a more efficient distributed
data processing framework, has been developed with in-memory computation and
resilient distributed dataset (RDD) features to support the iterative
algorithms. On the Spark RDD framework, Apriori and FP-Growth based FIM
algorithms have been designed, but Eclat-based algorithm has not been explored
yet. In this paper, RDD-Eclat, a parallel Eclat algorithm on the Spark RDD
framework is proposed with its five variants. The proposed algorithms are
evaluated on the various benchmark datasets, which shows that RDD-Eclat
outperforms the Spark-based Apriori by many times. Also, the experimental
results show the scalability of the proposed algorithms on increasing the
number of cores and size of the dataset.
","[{'version': 'v1', 'created': 'Fri, 13 Dec 2019 11:23:47 GMT'}]",2019-12-16,"[['Singh', 'Pankaj', ''], ['Singh', 'Sudhakar', ''], ['Mishra', 'P. K.', ''], ['Garg', 'Rakhi', '']]","['Parallel and distributed algorithms', 'frequent itemset mining', 'eclat', 'spark', 'big data analytics']"
2521,1810.00096,Emanuel Onica,"Valentin Ro\c{s}ca, Emanuel Onica, Paul Diac, Ciprian Amariei","Predicting Destinations by Nearest Neighbor Search on Training Vessel
  Routes",,"DEBS 2018, Proceedings of the 12th ACM International Conference on
  Distributed and Event-based Systems, Pages 224-225",10.1145/3210284.3220509,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The DEBS Grand Challenge 2018 is set in the context of maritime route
prediction. Vessel routes are modeled as streams of Automatic Identification
System (AIS) data points selected from real-world tracking data. The challenge
requires to correctly estimate the destination ports and arrival times of
vessel trips, as early as possible. Our proposed solution partitions the
training vessel routes by reported destination port and uses a nearest neighbor
search to find the training routes that are closer to the query AIS point.
Particular improvements have been included as well, such as a way to avoid
changing the predicted ports frequently within one query route and automating
the parameters tuning by the use of a genetic algorithm. This leads to
significant improvements on the final score.
","[{'version': 'v1', 'created': 'Fri, 28 Sep 2018 21:52:56 GMT'}]",2018-10-02,"[['Roşca', 'Valentin', ''], ['Onica', 'Emanuel', ''], ['Diac', 'Paul', ''], ['Amariei', 'Ciprian', '']]","['machine learning', 'ball trees', 'genetic algorithm', 'space partitioning', 'nearest neighbor']"
2522,1402.2904,Bei Yu,Duo Ding and Bei Yu and Joydeep Ghosh and David Z. Pan,"EPIC: Efficient prediction of IC manufacturing hotspots with a unified
  meta-classification formulation",,,10.1109/ASPDAC.2012.6164956,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present EPIC, an efficient and effective predictor for IC
manufacturing hotspots in deep sub-wavelength lithography. EPIC proposes a
unified framework to combine different hotspot detection methods together, such
as machine learning and pattern matching, using mathematical
programming/optimization. EPIC algorithm has been tested on a number of
industry benchmarks under advanced manufacturing conditions. It demonstrates so
far the best capability in selectively combining the desirable features of
various hotspot detection methods (3.5-8.2% accuracy improvement) as well as
significant suppression of the detection noise (e.g., 80% false-alarm
reduction). These characteristics make EPIC very suitable for conducting high
performance physical verification and guiding efficient manufacturability
friendly physical design.
","[{'version': 'v1', 'created': 'Wed, 12 Feb 2014 17:25:05 GMT'}]",2014-02-13,"[['Ding', 'Duo', ''], ['Yu', 'Bei', ''], ['Ghosh', 'Joydeep', ''], ['Pan', 'David Z.', '']]","['Design for Manufacturability', 'Lithography Hotspots', 'MetaClassification', 'Machine Learning', 'Pattern Matching']"
2523,1802.10291,KitIan Kou,Dong Cheng and Kit Ian Kou,FFT Multichannel Interpolation and Application to Image Super-resolution,"29 pages, 5 figures, 5 tables","Signal Processing, Volume 162, September 2019, Pages 21-34",10.1016/j.sigpro.2019.03.025,,cs.IT math.IT math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an innovative set of tools to support a methodology for
the multichannel interpolation (MCI) of a discrete signal. It is shown that a
bandlimited signal $f$ can be exactly reconstructed from finite samples of
$g_k$ ($1\leq k\leq M$) which are the responses of $M$ linear systems with
input $f$. The proposed interpolation can also be applied to approximate
non-bandlimited signals. Quantitative error is analyzed to ensure its
effectiveness in approximating non-bandlimited signals and its Hilbert
transform. Based on the FFT technique, a fast algorithm which brings high
computational efficiency and reliability for MCI is presented. The standout
performance of MCI is illustrated by several simulations. Additionally, the
proposed interpolation is applied to the single image super-resolution (SISR).
Its superior performance in accuracy and speed of SISR is demonstrated by the
experimental studies. Our results are compared qualitatively and quantitatively
with the state-of-the-art methods in image upsampling and reconstruction by
using the standard measurement criteria.
","[{'version': 'v1', 'created': 'Wed, 28 Feb 2018 07:07:15 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Apr 2019 09:43:20 GMT'}]",2019-04-12,"[['Cheng', 'Dong', ''], ['Kou', 'Kit Ian', '']]","['Multichannel interpolation', 'sampling theorem', 'signal reconstruction', 'Hilbert transform', 'error analysis', 'image super-resolution']"
2524,2301.05466,Liwang Zhu,Liwang Zhu and Zhongzhi Zhang,"A Nearly-Linear Time Algorithm for Minimizing Risk of Conflict in Social
  Networks",,"Proceedings of the ACM SIGKDD Conference on Knowledge Discovery
  and Data Mining 2022, pp.2648-2656",10.1145/3534678.3539469,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Concomitant with the tremendous prevalence of online social media platforms,
the interactions among individuals are unprecedentedly enhanced. People are
free to interact with acquaintances, express and exchange their own opinions
through commenting, liking, retweeting on online social media, leading to
resistance, controversy and other important phenomena over controversial social
issues, which have been the subject of many recent works. In this paper, we
study the problem of minimizing risk of conflict in social networks by
modifying the initial opinions of a small number of nodes. We show that the
objective function of the combinatorial optimization problem is monotone and
supermodular. We then propose a na\""{\i}ve greedy algorithm with a $(1-1/e)$
approximation ratio that solves the problem in cubic time. To overcome the
computation challenge for large networks, we further integrate several
effective approximation strategies to provide a nearly linear time algorithm
with a $(1-1/e-\epsilon)$ approximation ratio for any error parameter
$\epsilon>0$. Extensive experiments on various real-world datasets demonstrate
both the efficiency and effectiveness of our algorithms. In particular, the
fast one scales to large networks with more than two million nodes, and
achieves up to $20\times$ speed-up over the state-of-the-art algorithm.
","[{'version': 'v1', 'created': 'Fri, 13 Jan 2023 10:32:12 GMT'}]",2023-01-16,"[['Zhu', 'Liwang', ''], ['Zhang', 'Zhongzhi', '']]","['Opinion dynamics', 'graph algorithm', 'resistance', 'controversy', 'socialnetwork', 'discrete optimization']"
2525,1810.08998,Saad Nadeem,Saad Nadeem and Arie Kaufman,Visualization Framework for Colonoscopy Videos,"SPIE Medical Imaging, 2016 (7 pages, 5 figures)","SPIE Medical Imaging, Vol. 9786, p. 97861T, 2016",10.1117/12.2216963,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a visualization framework for annotating and comparing colonoscopy
videos, where these annotations can then be used for semi-automatic report
generation at the end of the procedure. Currently, there are approximately 14
million colonoscopies performed every year in the US. In this work, we create a
visualization tool to deal with the deluge of colonoscopy videos in a more
effective way. We present an interactive visualization framework for the
annotation and tagging of colonoscopy videos in an easy and intuitive way.
These annotations and tags can later be used for report generation for
electronic medical records and for comparison at an individual as well as group
level. We also present important use cases and medical expert feedback for our
visualization framework.
","[{'version': 'v1', 'created': 'Sun, 21 Oct 2018 18:17:39 GMT'}]",2018-10-23,"[['Nadeem', 'Saad', ''], ['Kaufman', 'Arie', '']]","['Colonoscopy', 'videos', 'annotation', 'report']"
2526,0803.2967,Uwe Aickelin,Uwe Aickelin and Paul White,Building Better Nurse Scheduling Algorithms,,"Annals of Operations Research, 128, pp 159-177, 2004",10.1023/B:ANOR.0000019103.31340.a6,,cs.NE cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of this research is twofold: Firstly, to model and solve a complex
nurse scheduling problem with an integer programming formulation and
evolutionary algorithms. Secondly, to detail a novel statistical method of
comparing and hence building better scheduling algorithms by identifying
successful algorithm modifications. The comparison method captures the results
of algorithms in a single figure that can then be compared using traditional
statistical techniques. Thus, the proposed method of comparing algorithms is an
objective procedure designed to assist in the process of improving an
algorithm. This is achieved even when some results are non-numeric or missing
due to infeasibility. The final algorithm outperforms all previous evolutionary
algorithms, which relied on human expertise for modification.
","[{'version': 'v1', 'created': 'Thu, 20 Mar 2008 11:15:37 GMT'}]",2010-07-05,"[['Aickelin', 'Uwe', ''], ['White', 'Paul', '']]","['Nurse scheduling', 'evolutionary algorithms', 'integer programming', 'statistical comparison method']"
2527,1602.00163,Sabeur Aridhi,"Manel Zoghlami, Sabeur Aridhi, Mondher Maddouri, Engelbert Mephu
  Nguifo","Multiple instance learning for sequence data with across bag
  dependencies",,,10.1007/s13042-019-01021-5,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Multiple Instance Learning (MIL) problem for sequence data, the instances
inside the bags are sequences. In some real world applications such as
bioinformatics, comparing a random couple of sequences makes no sense. In fact,
each instance may have structural and/or functional relations with instances of
other bags. Thus, the classification task should take into account this across
bag relation. In this work, we present two novel MIL approaches for sequence
data classification named ABClass and ABSim. ABClass extracts motifs from
related instances and use them to encode sequences. A discriminative classifier
is then applied to compute a partial classification result for each set of
related sequences. ABSim uses a similarity measure to discriminate the related
instances and to compute a scores matrix. For both approaches, an aggregation
method is applied in order to generate the final classification result. We
applied both approaches to solve the problem of bacterial Ionizing Radiation
Resistance prediction. The experimental results of the presented approaches are
satisfactory.
","[{'version': 'v1', 'created': 'Sat, 30 Jan 2016 21:15:10 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Jun 2020 19:32:08 GMT'}]",2020-06-15,"[['Zoghlami', 'Manel', ''], ['Aridhi', 'Sabeur', ''], ['Maddouri', 'Mondher', ''], ['Nguifo', 'Engelbert Mephu', '']]","['sequence data classification', 'multiple instance learning', 'bacterial ionizing radiation resistance']"
2528,0910.1979,Rajkumar Buyya,"Christian Vecchiola, Suraj Pandey, and Rajkumar Buyya",High-Performance Cloud Computing: A View of Scientific Applications,"13 pages, 9 figures, conference paper","Proceedings of the 10th International Symposium on Pervasive
  Systems, Algorithms and Networks (I-SPAN 2009, IEEE CS Press, USA),
  Kaohsiung, Taiwan, December 14-16, 2009",10.1109/I-SPAN.2009.150,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scientific computing often requires the availability of a massive number of
computers for performing large scale experiments. Traditionally, these needs
have been addressed by using high-performance computing solutions and installed
facilities such as clusters and super computers, which are difficult to setup,
maintain, and operate. Cloud computing provides scientists with a completely
new model of utilizing the computing infrastructure. Compute resources, storage
resources, as well as applications, can be dynamically provisioned (and
integrated within the existing infrastructure) on a pay per use basis. These
resources can be released when they are no more needed. Such services are often
offered within the context of a Service Level Agreement (SLA), which ensure the
desired Quality of Service (QoS). Aneka, an enterprise Cloud computing
solution, harnesses the power of compute resources by relying on private and
public Clouds and delivers to users the desired QoS. Its flexible and service
based infrastructure supports multiple programming paradigms that make Aneka
address a variety of different scenarios: from finance applications to
computational science. As examples of scientific computing in the Cloud, we
present a preliminary case study on using Aneka for the classification of gene
expression data and the execution of fMRI brain imaging workflow.
","[{'version': 'v1', 'created': 'Sun, 11 Oct 2009 07:42:44 GMT'}]",2016-11-15,"[['Vecchiola', 'Christian', ''], ['Pandey', 'Suraj', ''], ['Buyya', 'Rajkumar', '']]","['Scientific computing', 'computational science', 'Cloud computing', 'high-performance computing']"
2529,2103.06138,Marlesson Santana,"Marlesson R. O. Santana, Anderson Soares",Hybrid Model with Time Modeling for Sequential Recommender Systems,"5 pages, 2 figures, WSDM Workshop on Web Tourism 2021","ACM WSDM Workshop on Web Tourism (WSDM Webtour'21), March 12,
  2021, Jerusalem, Israel",,,cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Deep learning based methods have been used successfully in recommender system
problems. Approaches using recurrent neural networks, transformers, and
attention mechanisms are useful to model users' long- and short-term
preferences in sequential interactions. To explore different session-based
recommendation solutions, Booking.com recently organized the WSDM WebTour 2021
Challenge, which aims to benchmark models to recommend the final city in a
trip. This study presents our approach to this challenge. We conducted several
experiments to test different state-of-the-art deep learning architectures for
recommender systems. Further, we proposed some changes to Neural Attentive
Recommendation Machine (NARM), adapted its architecture for the challenge
objective, and implemented training approaches that can be used in any
session-based model to improve accuracy. Our experimental result shows that the
improved NARM outperforms all other state-of-the-art benchmark methods.
","[{'version': 'v1', 'created': 'Sun, 7 Mar 2021 19:28:22 GMT'}]",2021-03-11,"[['Santana', 'Marlesson R. O.', ''], ['Soares', 'Anderson', '']]","['Recommender systems', 'Session-based recommendations', 'Recurrentneural networks', 'Hybrid model', 'Time modeling']"
2530,1507.06882,Luiz Capretz Dr.,"Arif Raza, Luiz Fernando Capretz","Contributors Preference in Open Source Software Usability: An Empirical
  Study",,"International Journal of Software Engineering & Applications
  (IJSEA), 1(2):45-64, 2010",10.5121/ijsea.2010.1204,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The fact that the number of users of open source software (OSS) is
practically un-limited and that ultimately the software quality is determined
by end users experience, makes the usability an even more critical quality
attribute than it is for proprietary software. With the sharp increase in use
of open source projects by both individuals and organizations, the level of
usability and related issues must be addressed more seriously. The research
model of this empirical investigation studies and establishes the relationship
between the key usability factors from contributors perspective and OSS
usability. A data set of 78 OSS contributors that includes architects,
designers, developers, testers and users from 22 open source projects of varied
size has been used to study the research model. The results of this study
provide empirical evidence by indicating that the highlighted key factors play
a significant role in improving OSS usability.
","[{'version': 'v1', 'created': 'Fri, 24 Jul 2015 15:25:46 GMT'}]",2015-07-27,"[['Raza', 'Arif', ''], ['Capretz', 'Luiz Fernando', '']]","['Open Source Software (OSS)', 'Usability', 'Users’ feedback', 'Usability assessment']"
2531,1609.09545,Adrian Bulat,Adrian Bulat and Georgios Tzimiropoulos,"Two-stage Convolutional Part Heatmap Regression for the 1st 3D Face
  Alignment in the Wild (3DFAW) Challenge","Winner of 3D Face Alignment in the Wild (3DFAW) Challenge, ECCV 2016",,10.1007/978-3-319-48881-3_43,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes our submission to the 1st 3D Face Alignment in the Wild
(3DFAW) Challenge. Our method builds upon the idea of convolutional part
heatmap regression [1], extending it for 3D face alignment. Our method
decomposes the problem into two parts: (a) X,Y (2D) estimation and (b) Z
(depth) estimation. At the first stage, our method estimates the X,Y
coordinates of the facial landmarks by producing a set of 2D heatmaps, one for
each landmark, using convolutional part heatmap regression. Then, these
heatmaps, alongside the input RGB image, are used as input to a very deep
subnetwork trained via residual learning for regressing the Z coordinate. Our
method ranked 1st in the 3DFAW Challenge, surpassing the second best result by
more than 22%.
","[{'version': 'v1', 'created': 'Thu, 29 Sep 2016 23:07:01 GMT'}]",2018-08-28,"[['Bulat', 'Adrian', ''], ['Tzimiropoulos', 'Georgios', '']]","['3D face alignment', 'Convolutional Neural Networks', 'Convolutional Part Heatmap Regression']"
2532,1405.1912,M\'arta Czenky,M\'arta Czenky,"The Efficiency Examination of Teaching of Different Normalization
  Methods",,"International Journal of Database Management Systems ( IJDMS )
  Vol.6, No.2, April 2014",10.5121/ijdms.2014.6201,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Normalization is an important database design method, in the course of the
teaching of data modeling the understanding and applying of this method cause
problems for students the most. For improving the efficiency of learning
normalization we looked for alternative normalization methods and introduced
them into education. We made a survey among engineer students how efficient
could they execute the normalization with different methods. We executed
statistical and data mining examinations to decide whether any of the methods
resulted significantly better solutions.
","[{'version': 'v1', 'created': 'Thu, 8 May 2014 13:06:34 GMT'}]",2014-05-09,"[['Czenky', 'Márta', '']]","['Database Design', 'Normalization', 'Dependency Diagram', 'Survey', 'Statistical Examination']"
2533,1801.00390,Muhammad Bilal,"Muhammad Bilal, Shin-Gak Kang",Time Aware Least Recent Used (TLRU) Cache Management Policy in ICN,"5 pages, 8 figures, paper presented in conference IEEE ICACT'14,
  South Korea","Proc. IEEE ICACT, pp. 528-532, Feb. 2014",10.1109/ICACT.2014.6779016,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The information centric networks (ICN) can be viewed as a network of caches.
Conversely, ICN type of cache networks has distinctive features e.g, contents
popularity, usability time of content and other factors inflicts some diverse
requirements for cache eviction policies. In this paper we defined four
important characteristics of a suitable eviction policy for ICN. We analysed
well known eviction policies in view of defined characteristics. Based upon
analysis we propose a new eviction scheme which is well suitable for ICN type
of cache networks.
","[{'version': 'v1', 'created': 'Mon, 1 Jan 2018 04:13:53 GMT'}]",2018-01-03,"[['Bilal', 'Muhammad', ''], ['Kang', 'Shin-Gak', '']]","['Information centric network', 'Content distribution', 'Cache Network', 'cache eviction', 'cache management']"
2534,1809.07069,Roland S. Zimmermann,Roland S. Zimmermann and Julien N. Siems,Faster Training of Mask R-CNN by Focusing on Instance Boundaries,"9 pages, 7 figures, 5 tables",,10.1016/j.cviu.2019.102795,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an auxiliary task to Mask R-CNN, an instance segmentation network,
which leads to faster training of the mask head. Our addition to Mask R-CNN is
a new prediction head, the Edge Agreement Head, which is inspired by the way
human annotators perform instance segmentation. Human annotators copy the
contour of an object instance and only indirectly the occupied instance area.
Hence, the edges of instance masks are particularly useful as they characterize
the instance well. The Edge Agreement Head therefore encourages predicted masks
to have similar image gradients to the ground-truth mask using edge detection
filters. We provide a detailed survey of loss combinations and show
improvements on the MS COCO Mask metrics compared to using no additional loss.
Our approach marginally increases the model size and adds no additional
trainable model variables. While the computational costs are increased
slightly, the increment is negligible considering the high computational cost
of the Mask R-CNN architecture. As the additional network head is only relevant
during training, inference speed remains unchanged compared to Mask R-CNN. In a
default Mask R-CNN setup, we achieve a training speed-up and a relative overall
improvement of 8.1% on the MS COCO metrics compared to the baseline.
","[{'version': 'v1', 'created': 'Wed, 19 Sep 2018 08:54:18 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Oct 2018 15:55:43 GMT'}, {'version': 'v3', 'created': 'Tue, 12 Mar 2019 19:57:57 GMT'}, {'version': 'v4', 'created': 'Sat, 10 Aug 2019 08:55:37 GMT'}]",2019-08-13,"[['Zimmermann', 'Roland S.', ''], ['Siems', 'Julien N.', '']]","['Mask R-CNN', 'Instance Segmentation', 'Computer Vision', 'Auxiliary Task', 'Edge Detection Filter', 'Sobel Filter', 'LaplaceFilter', 'Convolutional Neural Network']"
2535,1805.00445,Geoffrey Fairchild,"Geoffrey Fairchild (1), Byron Tasseff (1), Hari Khalsa (1), Nicholas
  Generous (2), Ashlynn R. Daughton (1), Nileena Velappan (3), Reid Priedhorsky
  (4), Alina Deshpande (3) ((1) Analytics, Intelligence, and Technology
  Division, Los Alamos National Laboratory, Los Alamos, New Mexico, USA, (2)
  Intelligence and Emerging Threats Program Office, Los Alamos National
  Laboratory, Los Alamos, New Mexico, USA, (3) Bioscience Division, Los Alamos
  National Laboratory, Los Alamos, New Mexico, USA, (4) High Performance
  Computing Division, Los Alamos National Laboratory, Los Alamos, New Mexico,
  USA)","Epidemiological data challenges: planning for a more robust future
  through data standards","v2 includes several typo fixes; v3 adds a paragraph on backfill; v4
  adds 2 new paragraphs to the conclusion that address Frontiers reviewer
  comments; v5 adds some minor modifications that address additional reviewer
  comments",,10.3389/fpubh.2018.00336,,cs.CY cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accessible epidemiological data are of great value for emergency preparedness
and response, understanding disease progression through a population, and
building statistical and mechanistic disease models that enable forecasting.
The status quo, however, renders acquiring and using such data difficult in
practice. In many cases, a primary way of obtaining epidemiological data is
through the internet, but the methods by which the data are presented to the
public often differ drastically among institutions. As a result, there is a
strong need for better data sharing practices. This paper identifies, in detail
and with examples, the three key challenges one encounters when attempting to
acquire and use epidemiological data: 1) interfaces, 2) data formatting, and 3)
reporting. These challenges are used to provide suggestions and guidance for
improvement as these systems evolve in the future. If these suggested data and
interface recommendations were adhered to, epidemiological and public health
analysis, modeling, and informatics work would be significantly streamlined,
which can in turn yield better public health decision-making capabilities.
","[{'version': 'v1', 'created': 'Fri, 20 Apr 2018 18:44:04 GMT'}, {'version': 'v2', 'created': 'Wed, 2 May 2018 20:45:05 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Jun 2018 20:28:23 GMT'}, {'version': 'v4', 'created': 'Fri, 17 Aug 2018 18:39:42 GMT'}, {'version': 'v5', 'created': 'Wed, 14 Nov 2018 23:28:37 GMT'}, {'version': 'v6', 'created': 'Sat, 24 Nov 2018 05:29:03 GMT'}]",2018-11-27,"[['Fairchild', 'Geoffrey', ''], ['Tasseff', 'Byron', ''], ['Khalsa', 'Hari', ''], ['Generous', 'Nicholas', ''], ['Daughton', 'Ashlynn R.', ''], ['Velappan', 'Nileena', ''], ['Priedhorsky', 'Reid', ''], ['Deshpande', 'Alina', '']]","['data', 'computational epidemiology', 'public health', 'diseasemodeling', 'informatics', 'disease surveillance']"
2536,1501.06125,Alejandro D\'iaz-Caro,Alejandro D\'iaz-Caro and Gilles Dowek,Proof Normalisation in a Logic Identifying Isomorphic Propositions,,"4th International Conference on Formal Structures for Computation
  and Deduction (FSCD 2019) - LIPIcs 131:14, 2019",10.4230/LIPIcs.FSCD.2019.14,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We define a fragment of propositional logic where isomorphic propositions,
such as $A\land B$ and $B\land A$, or $A\Rightarrow (B\land C)$ and
$(A\Rightarrow B)\land(A\Rightarrow C)$ are identified. We define System I, a
proof language for this logic, and prove its normalisation and consistency.
","[{'version': 'v1', 'created': 'Sun, 25 Jan 2015 08:04:14 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Feb 2015 10:00:31 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Jun 2015 07:26:47 GMT'}, {'version': 'v4', 'created': 'Tue, 7 Aug 2018 13:48:29 GMT'}, {'version': 'v5', 'created': 'Fri, 10 Aug 2018 06:52:19 GMT'}, {'version': 'v6', 'created': 'Fri, 17 Aug 2018 19:10:10 GMT'}, {'version': 'v7', 'created': 'Tue, 12 Feb 2019 18:16:44 GMT'}, {'version': 'v8', 'created': 'Mon, 22 Apr 2019 11:10:47 GMT'}]",2019-12-06,"[['Díaz-Caro', 'Alejandro', ''], ['Dowek', 'Gilles', '']]","['Simply typed lambda calculus', 'Isomorphisms', 'Logic', 'Cut-elimination', 'Proofreduction']"
2537,0705.3992,Tadashi Wadyama,Tadashi Wadayama,"Average Stopping Set Weight Distribution of Redundant Random Matrix
  Ensembles","14 pages, 7 figures, Conference version to appear at the 2007 IEEE
  International Symposium on Information Theory, Nice, France, June 2007",,10.1109/ISIT.2007.4557663,,cs.IT math.IT,,"  In this paper, redundant random matrix ensembles (abbreviated as redundant
random ensembles) are defined and their stopping set (SS) weight distributions
are analyzed. A redundant random ensemble consists of a set of binary matrices
with linearly dependent rows. These linearly dependent rows (redundant rows)
significantly reduce the number of stopping sets of small size. An upper and
lower bound on the average SS weight distribution of the redundant random
ensembles are shown. From these bounds, the trade-off between the number of
redundant rows (corresponding to decoding complexity of BP on BEC) and the
critical exponent of the asymptotic growth rate of SS weight distribution
(corresponding to decoding performance) can be derived. It is shown that, in
some cases, a dense matrix with linearly dependent rows yields asymptotically
(i.e., in the regime of small erasure probability) better performance than
regular LDPC matrices with comparable parameters.
","[{'version': 'v1', 'created': 'Mon, 28 May 2007 01:55:36 GMT'}]",2016-11-15,"[['Wadayama', 'Tadashi', '']]","['LDPC codes', 'Stopping set', 'Weight distribution', 'Ensemble']"
2538,1809.08588,Thorben Casper,"Thorben Casper, David Duque, Sebastian Sch\""ops, Herbert De Gersem","Automated Netlist Generation for 3D Electrothermal and Electromagnetic
  Field Problems","This is a pre-print of an article published in the Journal of
  Computational Electronics. The final authenticated version is available
  online at: https://dx.doi.org/10.1007/s10825-019-01368-6. All numerical
  results can be reproduced by the Matlab code openly available at
  https://github.com/tc88/ANTHEM","Journal of Computational Electronics, 2019",10.1007/s10825-019-01368-6,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a method for the automatic generation of netlists describing
general three-dimensional electrothermal and electromagnetic field problems.
Using a pair of structured orthogonal grids as spatial discretisation, a
one-to-one correspondence between grid objects and circuit elements is obtained
by employing the finite integration technique. The resulting circuit can then
be solved with any standard available circuit simulator, alleviating the need
for the implementation of a custom time integrator. Additionally, the approach
straightforwardly allows for field-circuit coupling simulations by
appropriately stamping the circuit description of lumped devices. As the
computational domain in wave propagation problems must be finite, stamps
representing absorbing boundary conditions are developed as well.
Representative numerical examples are used to validate the approach. The
results obtained by circuit simulation on the generated netlists are compared
with appropriate reference solutions.
","[{'version': 'v1', 'created': 'Sun, 23 Sep 2018 12:49:38 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Oct 2019 08:05:30 GMT'}]",2019-10-16,"[['Casper', 'Thorben', ''], ['Duque', 'David', ''], ['Schöps', 'Sebastian', ''], ['De Gersem', 'Herbert', '']]","['absorbing boundary conditions', 'circuits', 'electromagnetics', 'electrothermal', 'finite integration technique', 'netlists']"
2539,cs/0409001,Valmir Barbosa,"A. O. Stauffer, V. C. Barbosa",Probabilistic heuristics for disseminating information in networks,,"IEEE/ACM Transactions on Networking 15 (2007), 425-435",10.1109/TNET.2007.892877,ES-660/04,cs.NI cs.DC,,"  We study the problem of disseminating a piece of information through all the
nodes of a network, given that it is known originally only to a single node. In
the absence of any structural knowledge on the network other than the nodes'
neighborhoods, this problem is traditionally solved by flooding all the
network's edges. We analyze a recently introduced probabilistic algorithm for
flooding and give an alternative probabilistic heuristic that can lead to some
cost-effective improvements, like better trade-offs between the message and
time complexities involved. We analyze the two algorithms both mathematically
and by means of simulations, always within a random-graph framework and
considering relevant node-degree distributions.
","[{'version': 'v1', 'created': 'Wed, 1 Sep 2004 16:42:11 GMT'}]",2007-06-13,"[['Stauffer', 'A. O.', ''], ['Barbosa', 'V. C.', '']]","['Random networks', 'Probabilistic flooding', 'Heuristic flooding']"
2540,1210.2091,Perry Nicolas,"Magali Mauchand (UTT), Ali Siadat, Nicolas Perry (LGM2B), Alain
  Bernard (IRCCyN)","VCS: Value Chains Simulator, a Tool for Value Analysis of Manufacturing
  Enterprise Processes (A Value-Based Decision Support Tool)",,Journal of Intelligent Manufacturing (2010) 700x-700x,10.1007/s10845-010-0452,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Manufacturing enterprises are facing a competitive challenge. This paper
proposes the use of a value chain based approach to support the modelling and
simulation of manufacturing enterprise processes. The aim is to help experts to
make relevant decisions on product design and/or product manufacturing process
planning. This decision tool is based on the value chain modelling, by
considering the product requirements. In order to evaluate several performance
indicators, a simulation of various potential value chains adapted to market
demand was conducted through a Value Chains Simulator (VCS). A discrete event
simulator is used to perform the simulation of these scenarios and to evaluate
the value as a global performance criterion (balancing cost, quality, delivery
time, services, etc.). An Analytical Hierarchy Process module supports the
analysis process. The value chain model is based on activities and uses the
concepts of resource consumption, while integrating the benefiting entities
view point. A case study in the microelectronic field is carried out to
corroborate the validity of the proposed VCS.
","[{'version': 'v1', 'created': 'Sun, 7 Oct 2012 18:33:51 GMT'}]",2012-10-09,"[['Mauchand', 'Magali', '', 'UTT'], ['Siadat', 'Ali', '', 'LGM2B'], ['Perry', 'Nicolas', '', 'LGM2B'], ['Bernard', 'Alain', '', 'IRCCyN']]","['Value Chain', 'value', 'AHP', 'performance indicator', 'discrete event simulation']"
2541,1711.01912,Ruben Mayer,Ruben Mayer and Christian Mayer and Larissa Laich,"The TensorFlow Partitioning and Scheduling Problem: It's the Critical
  Path!","6 pages. To be published in Proceedings of DIDL '17: Workshop on
  Distributed Infrastructures for Deep Learning, hosted by ACM Middleware 2017
  Conference. https://doi.org/10.1145/3154842.3154843",,10.1145/3154842.3154843,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  State-of-the-art data flow systems such as TensorFlow impose iterative
calculations on large graphs that need to be partitioned on heterogeneous
devices such as CPUs, GPUs, and TPUs. However, partitioning can not be viewed
in isolation. Each device has to select the next graph vertex to be executed,
i.e., perform local scheduling decisions. Both problems, partitioning and
scheduling, are NP-complete by themselves but have to be solved in combination
in order to minimize overall execution time of an iteration. In this paper, we
propose several heuristic strategies to solve the partitioning and scheduling
problem in TensorFlow. We simulate the performance of the proposed strategies
in heterogeneous environments with communication-intensive workloads that are
common to TensorFlow. Our findings indicate that the best partitioning and
scheduling heuristics are those that focus on minimizing the execution time of
the critical path in the graph. Those strategies provide a speed-up of up to 4
times in comparison to strategies that are agnostic to the critical path, such
as hash-based partitioning and FIFO scheduling.
","[{'version': 'v1', 'created': 'Mon, 6 Nov 2017 14:44:05 GMT'}]",2017-11-07,"[['Mayer', 'Ruben', ''], ['Mayer', 'Christian', ''], ['Laich', 'Larissa', '']]","['TensorFlow', 'partitioning', 'scheduling', 'critical path']"
2542,1803.06589,Reza Sadeghi,"Reza Sadeghi, Tanvi Banerjee, William Romine",Early hospital mortality prediction using vital signals,"11 pages, 5 figures, preprint of accepted paper in IEEE&ACM CHASE
  2018 and published in Smart Health journal",Smart Health 9-10 (2018) 265-274,10.1016/j.smhl.2018.07.001,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Early hospital mortality prediction is critical as intensivists strive to
make efficient medical decisions about the severely ill patients staying in
intensive care units. As a result, various methods have been developed to
address this problem based on clinical records. However, some of the laboratory
test results are time-consuming and need to be processed. In this paper, we
propose a novel method to predict mortality using features extracted from the
heart signals of patients within the first hour of ICU admission. In order to
predict the risk, quantitative features have been computed based on the heart
rate signals of ICU patients. Each signal is described in terms of 12
statistical and signal-based features. The extracted features are fed into
eight classifiers: decision tree, linear discriminant, logistic regression,
support vector machine (SVM), random forest, boosted trees, Gaussian SVM, and
K-nearest neighborhood (K-NN). To derive insight into the performance of the
proposed method, several experiments have been conducted using the well-known
clinical dataset named Medical Information Mart for Intensive Care III
(MIMIC-III). The experimental results demonstrate the capability of the
proposed method in terms of precision, recall, F1-score, and area under the
receiver operating characteristic curve (AUC). The decision tree classifier
satisfies both accuracy and interpretability better than the other classifiers,
producing an F1-score and AUC equal to 0.91 and 0.93, respectively. It
indicates that heart rate signals can be used for predicting mortality in
patients in the ICU, achieving a comparable performance with existing
predictions that rely on high dimensional features from clinical records which
need to be processed and may contain missing information.
","[{'version': 'v1', 'created': 'Sun, 18 Mar 2018 00:35:42 GMT'}, {'version': 'v2', 'created': 'Sat, 9 Feb 2019 06:06:50 GMT'}]",2019-02-12,"[['Sadeghi', 'Reza', ''], ['Banerjee', 'Tanvi', ''], ['Romine', 'William', '']]","['intensive care', 'mortality prediction', 'statistical', 'signal-based features']"
2543,1807.04880,Zheng Zhang,"Zheng Zhang, T.T. Wong",Effective Occlusion Handling for Fast Correlation Filter-based Trackers,"www.eecjournal.com/ (Vol-5,Issue-6,November - December 2020)",,10.22161/eec.562,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Correlation filter-based trackers heavily suffer from the problem of multiple
peaks in their response maps incurred by occlusions. Moreover, the whole
tracking pipeline may break down due to the uncertainties brought by shifting
among peaks, which will further lead to the degraded correlation filter model.
To alleviate the drift problem caused by occlusions, we propose a novel scheme
to choose the specific filter model according to different scenarios.
Specifically, an effective measurement function is designed to evaluate the
quality of filter response. A sophisticated strategy is employed to judge
whether occlusions occur, and then decide how to update the filter models. In
addition, we take advantage of both log-polar method and pyramid-like approach
to estimate the best scale of the target. We evaluate our proposed approach on
VOT2018 challenge and OTB100 dataset, whose experimental result shows that the
proposed tracker achieves the promising performance compared against the
state-of-the-art trackers.
","[{'version': 'v1', 'created': 'Fri, 13 Jul 2018 01:23:24 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Dec 2020 08:03:43 GMT'}, {'version': 'v3', 'created': 'Fri, 1 Jan 2021 13:19:18 GMT'}]",2021-01-05,"[['Zhang', 'Zheng', ''], ['Wong', 'T. T.', '']]","['Visual Tracking', 'Correlation Filter', 'Quality Measurement', 'Log-Polar']"
2544,1709.03484,Amit Boyarski,"Amit Boyarski, Alex M. Bronstein, Michael M. Bronstein",Subspace Least Squares Multidimensional Scaling,"Scale Space and Variational Methods in Computer Vision: 6th
  International Conference, SSVM 2017, Kolding, Denmark, June 4-8, 2017","Scale Space and Variational Methods in Computer Vision: 6th
  International Conference, SSVM 2017, Kolding, Denmark, June 4-8, 2017,
  Proceedings, 10302, 681--693",10.1007/978-3-319-58771-4_54,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multidimensional Scaling (MDS) is one of the most popular methods for
dimensionality reduction and visualization of high dimensional data. Apart from
these tasks, it also found applications in the field of geometry processing for
the analysis and reconstruction of non-rigid shapes. In this regard, MDS can be
thought of as a \textit{shape from metric} algorithm, consisting of finding a
configuration of points in the Euclidean space that realize, as isometrically
as possible, some given distance structure. In the present work we cast the
least squares variant of MDS (LS-MDS) in the spectral domain. This uncovers a
multiresolution property of distance scaling which speeds up the optimization
by a significant amount, while producing comparable, and sometimes even better,
embeddings.
","[{'version': 'v1', 'created': 'Mon, 11 Sep 2017 17:35:47 GMT'}]",2017-09-12,"[['Boyarski', 'Amit', ''], ['Bronstein', 'Alex M.', ''], ['Bronstein', 'Michael M.', '']]","['multidimensional scaling', 'SMACOF', 'majorization', 'multi-resolution', 'spectral regularization', 'canonical forms']"
2545,2206.05483,Xiong Peng,"Xiong Peng, Feng Liu, Jingfen Zhang, Long Lan, Junjie Ye, Tongliang
  Liu, Bo Han","Bilateral Dependency Optimization: Defending Against Model-inversion
  Attacks",Accepted to KDD 2022 (Research Track),"Proceedings of the 28th ACM SIGKDD Conference on Knowledge
  Discovery and Data Mining (KDD 2022)",10.1145/3534678.3539376,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Through using only a well-trained classifier, model-inversion (MI) attacks
can recover the data used for training the classifier, leading to the privacy
leakage of the training data. To defend against MI attacks, previous work
utilizes a unilateral dependency optimization strategy, i.e., minimizing the
dependency between inputs (i.e., features) and outputs (i.e., labels) during
training the classifier. However, such a minimization process conflicts with
minimizing the supervised loss that aims to maximize the dependency between
inputs and outputs, causing an explicit trade-off between model robustness
against MI attacks and model utility on classification tasks. In this paper, we
aim to minimize the dependency between the latent representations and the
inputs while maximizing the dependency between latent representations and the
outputs, named a bilateral dependency optimization (BiDO) strategy. In
particular, we use the dependency constraints as a universally applicable
regularizer in addition to commonly used losses for deep neural networks (e.g.,
cross-entropy), which can be instantiated with appropriate dependency criteria
according to different tasks. To verify the efficacy of our strategy, we
propose two implementations of BiDO, by using two different dependency
measures: BiDO with constrained covariance (BiDO-COCO) and BiDO with
Hilbert-Schmidt Independence Criterion (BiDO-HSIC). Experiments show that BiDO
achieves the state-of-the-art defense performance for a variety of datasets,
classifiers, and MI attacks while suffering a minor classification-accuracy
drop compared to the well-trained classifier with no defense, which lights up a
novel road to defend against MI attacks.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2022 10:07:03 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Jun 2022 12:27:49 GMT'}, {'version': 'v3', 'created': 'Sun, 17 Jul 2022 16:39:25 GMT'}]",2022-07-19,"[['Peng', 'Xiong', ''], ['Liu', 'Feng', ''], ['Zhang', 'Jingfen', ''], ['Lan', 'Long', ''], ['Ye', 'Junjie', ''], ['Liu', 'Tongliang', ''], ['Han', 'Bo', '']]","['Deep neural networks', 'model-inversion attacks', 'privacy leakage', 'statistical dependency']"
2546,1902.01091,Isaac Lera,"Isaac Lera, Carlos Guerrero, Carlos Juiz",YAFS: A simulator for IoT scenarios in fog computing,,,10.1109/ACCESS.2019.2927895,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a fog computing simulator for analysing the design and deployment
of applications through customized and dynamical strategies. We model the
relationships among deployed applications, network connections and
infrastructure characteristics through complex network theory, enabling the
integration of topological measures in dynamic and customizable strategies such
as the placement of application modules, workload location, and path routing
and scheduling of services. We present a comparative analysis of the efficiency
and the convergence of results of our simulator with the most referenced
entity, iFogSim. To highlight YAFS functionalities, we model three scenarios
that, to the best of our knowledge, cannot be implemented with current fog
simulators: dynamic allocation of new application modules, dynamic failures of
network nodes and user mobility along the topology.
","[{'version': 'v1', 'created': 'Mon, 4 Feb 2019 09:07:20 GMT'}]",2019-07-19,"[['Lera', 'Isaac', ''], ['Guerrero', 'Carlos', ''], ['Juiz', 'Carlos', '']]","['Simulator', 'Fog Computing', 'Complex Networks', 'Internet of Things']"
2547,1204.0309,K.S.Kuppusamy,K. S. Kuppusamy and G. Aghila,"A Model for Personalized Keyword Extraction from Web Pages using
  Segmentation","6 Pages, 2 Figures","International Journal of Computer Applications (0975 - 8887),
  Volume 42 - No.4, March 2012",10.5120/5681-7720,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The World Wide Web caters to the needs of billions of users in heterogeneous
groups. Each user accessing the World Wide Web might have his / her own
specific interest and would expect the web to respond to the specific
requirements. The process of making the web to react in a customized manner is
achieved through personalization. This paper proposes a novel model for
extracting keywords from a web page with personalization being incorporated
into it. The keyword extraction problem is approached with the help of web page
segmentation which facilitates in making the problem simpler and solving it
effectively. The proposed model is implemented as a prototype and the
experiments conducted on it empirically validate the model's efficiency.
","[{'version': 'v1', 'created': 'Mon, 2 Apr 2012 04:00:16 GMT'}]",2017-11-22,"[['Kuppusamy', 'K. S.', ''], ['Aghila', 'G.', '']]","['Keyword extraction', 'web page segmentation', 'web']"
2548,1102.0899,Michael Del Rose,"Michael DelRose, Christian Wagner, Philip Frederick","Evidence Feed Forward Hidden Markov Model: A New Type of Hidden Markov
  Model","19 pages, International Journal of Artificial Intelligence and
  Applications","International Journal of Artificial Intelligence and Applications
  (IJAIA), Vol. 2, No. 1, Jan 2011",10.5121/ijaia.2011.2101,,cs.AI cs.CV cs.LG math.NA math.PR,http://creativecommons.org/licenses/publicdomain/,"  The ability to predict the intentions of people based solely on their visual
actions is a skill only performed by humans and animals. The intelligence of
current computer algorithms has not reached this level of complexity, but there
are several research efforts that are working towards it. With the number of
classification algorithms available, it is hard to determine which algorithm
works best for a particular situation. In classification of visual human intent
data, Hidden Markov Models (HMM), and their variants, are leading candidates.
  The inability of HMMs to provide a probability in the observation to
observation linkages is a big downfall in this classification technique. If a
person is visually identifying an action of another person, they monitor
patterns in the observations. By estimating the next observation, people have
the ability to summarize the actions, and thus determine, with pretty good
accuracy, the intention of the person performing the action. These visual cues
and linkages are important in creating intelligent algorithms for determining
human actions based on visual observations.
  The Evidence Feed Forward Hidden Markov Model is a newly developed algorithm
which provides observation to observation linkages. The following research
addresses the theory behind Evidence Feed Forward HMMs, provides mathematical
proofs of their learning of these parameters to optimize the likelihood of
observations with a Evidence Feed Forwards HMM, which is important in all
computational intelligence algorithm, and gives comparative examples with
standard HMMs in classification of both visual action data and measurement
data; thus providing a strong base for Evidence Feed Forward HMMs in
classification of many types of problems.
","[{'version': 'v1', 'created': 'Fri, 4 Feb 2011 13:00:06 GMT'}]",2011-02-07,"[['DelRose', 'Michael', ''], ['Wagner', 'Christian', ''], ['Frederick', 'Philip', '']]","['Hidden Markov Model', 'Visual Human Intent Analysis', 'Visual Understanding', 'Image Processing', 'Artificial Intelligence']"
2549,1912.00508,Chang Li,"Chang Li, Haoyun Feng and Maarten de Rijke","Cascading Hybrid Bandits: Online Learning to Rank for Relevance and
  Diversity",,,10.1145/3383313.3412245,,cs.LG cs.IR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Relevance ranking and result diversification are two core areas in modern
recommender systems. Relevance ranking aims at building a ranked list sorted in
decreasing order of item relevance, while result diversification focuses on
generating a ranked list of items that covers a broad range of topics. In this
paper, we study an online learning setting that aims to recommend a ranked list
with $K$ items that maximizes the ranking utility, i.e., a list whose items are
relevant and whose topics are diverse. We formulate it as the cascade hybrid
bandits (CHB) problem. CHB assumes the cascading user behavior, where a user
browses the displayed list from top to bottom, clicks the first attractive
item, and stops browsing the rest. We propose a hybrid contextual bandit
approach, called CascadeHybrid, for solving this problem. CascadeHybrid models
item relevance and topical diversity using two independent functions and
simultaneously learns those functions from user click feedback. We conduct
experiments to evaluate CascadeHybrid on two real-world recommendation
datasets: MovieLens and Yahoo music datasets. Our experimental results show
that CascadeHybrid outperforms the baselines. In addition, we prove theoretical
guarantees on the $n$-step performance demonstrating the soundness of
CascadeHybrid.
","[{'version': 'v1', 'created': 'Sun, 1 Dec 2019 22:03:18 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Dec 2019 16:57:55 GMT'}, {'version': 'v3', 'created': 'Wed, 12 Aug 2020 06:46:20 GMT'}]",2020-08-13,"[['Li', 'Chang', ''], ['Feng', 'Haoyun', ''], ['de Rijke', 'Maarten', '']]","['Online learning to rank', 'contextual bandits', 'recommender system', 'result diversification']"
2550,1703.04568,Mohammad Azzeh,"Mohammad Azzeh, Ali Bou Nassif, Leandro L Minku","An empirical evaluation of ensemble adjustment methods for analogy-based
  effort estimation",,,10.1016/j.jss.2015.01.028,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Objective: This paper investigates the potential of ensemble learning for
variants of adjustment methods used in analogy-based effort estimation. The
number k of analogies to be used is also investigated. Method We perform a
large scale comparison study where many ensembles constructed from n out of 40
possible valid variants of adjustment methods are applied to eight datasets.
The performance of each method was evaluated based on standardized accuracy and
effect size. Results: The results have been subjected to statistical
significance testing, and show reasonable significant improvements on the
predictive performance where ensemble methods are applied. Conclusion: Our
conclusions suggest that ensembles of adjustment methods can work well and
achieve good performance, even though they are not always superior to single
methods. We also recommend constructing ensembles from only linear adjustment
methods, as they have shown better performance and were frequently ranked
higher.
","[{'version': 'v1', 'created': 'Sat, 11 Mar 2017 20:16:37 GMT'}]",2017-03-20,"[['Azzeh', 'Mohammad', ''], ['Nassif', 'Ali Bou', ''], ['Minku', 'Leandro L', '']]","['Cost Estimation', 'Ensemble Learning', 'Analogy Based Estimation', 'Adjustment Methods']"
2551,1501.00180,Rajdeep Borgohain,"Tuhin Borgohain, Amardeep Borgohain, Rajdeep Borgohain, Sugata Sanyal","Multipath Routing of Fragmented Data Transfer in a Smart Grid
  Environment","5 pages, 2 figures",,10.5120/19528-1165,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this paper is to do a general survey on the existing
communication modes inside a smart grid, the existing security loopholes and
their countermeasures. Then we suggest a detailed countermeasure, building upon
the Jigsaw based secure data transfer [8] for enhanced security of the data
flow inside the communication system of a smart grid. The paper has been
written without the consideration of any factor of inoperability between the
various security techniques inside a smart grid
","[{'version': 'v1', 'created': 'Wed, 31 Dec 2014 17:36:58 GMT'}]",2015-06-23,"[['Borgohain', 'Tuhin', ''], ['Borgohain', 'Amardeep', ''], ['Borgohain', 'Rajdeep', ''], ['Sanyal', 'Sugata', '']]","['Smart Grid', 'Multi-path routing', 'Data Transfer']"
2552,0710.0672,Valmir Barbosa,"Fabio R. J. Vieira, Valmir C. Barbosa","Optimization of supply diversity for the self-assembly of simple objects
  in two and three dimensions",Minor typos corrected,"Natural Computing 10 (2011), 551-581",10.1007/s11047-010-9209-x,,cs.NE,,"  The field of algorithmic self-assembly is concerned with the design and
analysis of self-assembly systems from a computational perspective, that is,
from the perspective of mathematical problems whose study may give insight into
the natural processes through which elementary objects self-assemble into more
complex ones. One of the main problems of algorithmic self-assembly is the
minimum tile set problem (MTSP), which asks for a collection of types of
elementary objects (called tiles) to be found for the self-assembly of an
object having a pre-established shape. Such a collection is to be as concise as
possible, thus minimizing supply diversity, while satisfying a set of stringent
constraints having to do with the termination and other properties of the
self-assembly process from its tile types. We present a study of what we think
is the first practical approach to MTSP. Our study starts with the introduction
of an evolutionary heuristic to tackle MTSP and includes results from extensive
experimentation with the heuristic on the self-assembly of simple objects in
two and three dimensions. The heuristic we introduce combines classic elements
from the field of evolutionary computation with a problem-specific variant of
Pareto dominance into a multi-objective approach to MTSP.
","[{'version': 'v1', 'created': 'Wed, 3 Oct 2007 18:29:12 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Oct 2007 13:21:09 GMT'}]",2011-03-14,"[['Vieira', 'Fabio R. J.', ''], ['Barbosa', 'Valmir C.', '']]","['Algorithmic self-assembly', 'Minimum tile set problem', 'Multiobjective evolutionary algorithms']"
2553,2205.09036,Yan Shvartzshnaider,"Shikun Zhang, Yan Shvartzshnaider, Yuanyuan Feng, Helen Nissenbaum,
  Norman Sadeh","Stop the Spread: A Contextual Integrity Perspective on the
  Appropriateness of COVID-19 Vaccination Certificates",,"ACM Conference on Fairness, Accountability, and Transparency, 2022",10.1145/3531146.3533222,,cs.CY cs.CR cs.HC,http://creativecommons.org/licenses/by/4.0/,"  We present an empirical study exploring how privacy influences the acceptance
of vaccination certificate (VC) deployments across different realistic usage
scenarios. The study employed the privacy framework of Contextual Integrity,
which has been shown to be particularly effective in capturing people's privacy
expectations across different contexts. We use a vignette methodology, where we
selectively manipulate salient contextual parameters to learn whether and how
they affect people's attitudes towards VCs. We surveyed 890 participants from a
demographically-stratified sample of the US population to gauge the acceptance
and overall attitudes towards possible VC deployments to enforce vaccination
mandates and the different information flows VCs might entail. Analysis of
results collected as part of this study is used to derive general normative
observations about different possible VC practices and to provide guidance for
the possible deployments of VCs in different contexts.
","[{'version': 'v1', 'created': 'Wed, 18 May 2022 16:15:15 GMT'}, {'version': 'v2', 'created': 'Thu, 19 May 2022 00:42:49 GMT'}]",2022-05-20,"[['Zhang', 'Shikun', ''], ['Shvartzshnaider', 'Yan', ''], ['Feng', 'Yuanyuan', ''], ['Nissenbaum', 'Helen', ''], ['Sadeh', 'Norman', '']]","['information privacy', 'contextual integrity', 'vaccination certificates', 'privacy norms']"
2554,1710.10940,Jean Michel Sellier Ph.D.,Jean Michel Sellier,"Combining Neural Networks and Signed Particles to Simulate Quantum
  Systems More Efficiently",,,10.1016/j.physa.2017.12.122,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently a new formulation of quantum mechanics has been suggested which
describes systems by means of ensembles of classical particles provided with a
sign. This novel approach mainly consists of two steps: the computation of the
Wigner kernel, a multi-dimensional function describing the effects of the
potential over the system, and the field-less evolution of the particles which
eventually create new signed particles in the process. Although this method has
proved to be extremely advantageous in terms of computational resources - as a
matter of fact it is able to simulate in a time-dependent fashion many- body
systems on relatively small machines - the Wigner kernel can represent the
bottleneck of simulations of certain systems. Moreover, storing the kernel can
be another issue as the amount of memory needed is cursed by the dimensionality
of the system. In this work, we introduce a new technique which drastically
reduces the computation time and memory requirement to simulate time-dependent
quantum systems which is based on the use of an appropriately tailored neural
network combined with the signed particle formalism. In particular, the
suggested neural network is able to compute efficiently and reliably the Wigner
kernel without any training as its entire set of weights and biases is
specified by analytical formulas. As a consequence, the amount of memory for
quantum simulations radically drops since the kernel does not need to be stored
anymore as it is now computed by the neural network itself, only on the cells
of the (discretized) phase-space which are occupied by particles. As its is
clearly shown in the final part of this paper, not only this novel approach
drastically reduces the computational time, it also remains accurate. The
author believes this work opens the way towards effective design of quantum
devices, with incredible practical implications.
","[{'version': 'v1', 'created': 'Thu, 19 Oct 2017 18:52:07 GMT'}]",2018-02-14,"[['Sellier', 'Jean Michel', '']]","['Quantum mechanics', 'Neural networks', 'Signed particleformulation', 'Wigner kernel', 'Quantum technology', 'Computer aided design']"
2555,1008.1150,Thomas Hotz,"Carsten Gottschlich, Thomas Hotz, Robert Lorenz, Stefanie Bernhardt,
  Michael Hantschel, Axel Munk",Modeling the growth of fingerprints improves matching for adolescents,,"IEEE Transactions on Information Forensics and Security, vol. 6,
  no. 3, pp. 1165-1169, Sep. 2011",10.1109/TIFS.2011.2143406,,cs.CV stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the effect of growth on the fingerprints of adolescents, based on
which we suggest a simple method to adjust for growth when trying to recover a
juvenile's fingerprint in a database years later. Based on longitudinal data
sets in juveniles' criminal records, we show that growth essentially leads to
an isotropic rescaling, so that we can use the strong correlation between
growth in stature and limbs to model the growth of fingerprints proportional to
stature growth as documented in growth charts. The proposed rescaling leads to
a 72% reduction of the distances between corresponding minutiae for the data
set analyzed. These findings were corroborated by several verification tests.
In an identification test on a database containing 3.25 million right index
fingers at the Federal Criminal Police Office of Germany, the identification
error rate of 20.8% was reduced to 2.1% by rescaling. The presented method is
of striking simplicity and can easily be integrated into existing automated
fingerprint identification systems.
","[{'version': 'v1', 'created': 'Fri, 6 Aug 2010 09:42:20 GMT'}]",2013-04-23,"[['Gottschlich', 'Carsten', ''], ['Hotz', 'Thomas', ''], ['Lorenz', 'Robert', ''], ['Bernhardt', 'Stefanie', ''], ['Hantschel', 'Michael', ''], ['Munk', 'Axel', '']]","['Fingerprint recognition', 'growth', 'matching', 'AFIS', 'shape analysis']"
2556,1611.06840,Luca Prigioniero,"Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero",Minimal and Reduced Reversible Automata,"Preliminary version presented at DCFS 2016 --- Descriptional
  Complexity of Formal Systems, Bucharest, Romania, Jul 5-8, 2016","Lectures Notes in Computer Science, 9777, pp. 168---179, Springer,
  2016",10.1007/978-3-319-41114-9_13,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A condition characterizing the class of regular languages which have several
nonisomorphic minimal reversible automata is presented. The condition concerns
the structure of the minimum automaton accepting the language under
consideration. It is also observed that there exist reduced reversible automata
which are not minimal, in the sense that all the automata obtained by merging
some of their equivalent states are irreversible. Furthermore, a sufficient
condition for the existence of infinitely many reduced reversible automata
accepting a same language is given. It is also proved that, when the language
is accepted by a unique minimal reversible automaton (that does not necessarily
coincide with the minimum deterministic automaton), then no other reduced
reversible automata accepting it can exist.
","[{'version': 'v1', 'created': 'Mon, 21 Nov 2016 15:38:32 GMT'}]",2016-11-22,"[['Lavado', 'Giovanna J.', ''], ['Pighizzini', 'Giovanni', ''], ['Prigioniero', 'Luca', '']]","['reversible automata', 'minimal automata', 'regular languages']"
2557,1112.1336,Guodong Shi,"Guodong Shi, Brian D. O. Anderson, Karl Henrik Johansson","Consensus over Random Graph Processes: Network Borel-Cantelli Lemmas for
  Almost Sure Convergence","IEEE Transactions on Information Theory, In Press",,10.1109/TIT.2015.2468584,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed consensus computation over random graph processes is considered.
The random graph process is defined as a sequence of random variables which
take values from the set of all possible digraphs over the node set. At each
time step, every node updates its state based on a Bernoulli trial, independent
in time and among different nodes: either averaging among the neighbor set
generated by the random graph, or sticking with its current state.
Connectivity-independence and arc-independence are introduced to capture the
fundamental influence of the random graphs on the consensus convergence.
Necessary and/or sufficient conditions are presented on the success
probabilities of the Bernoulli trials for the network to reach a global almost
sure consensus, with some sharp threshold established revealing a consensus
zero-one law. Convergence rates are established by lower and upper bounds of
the $\epsilon$-computation time. We also generalize the concepts of
connectivity/arc independence to their analogues from the $*$-mixing point of
view, so that our results apply to a very wide class of graphical models,
including the majority of random graph models in the literature, e.g.,
Erd\H{o}s-R\'{e}nyi, gossiping, and Markovian random graphs. We show that under
$*$-mixing, our convergence analysis continues to hold and the corresponding
almost sure consensus conditions are established. Finally, we further
investigate almost sure finite-time convergence of random gossiping algorithms,
and prove that the Bernoulli trials play a key role in ensuring finite-time
convergence. These results add to the understanding of the interplay between
random graphs, random computations, and convergence probability for distributed
information processing.
","[{'version': 'v1', 'created': 'Tue, 6 Dec 2011 16:33:04 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Dec 2011 20:00:37 GMT'}, {'version': 'v3', 'created': 'Mon, 7 May 2012 15:27:47 GMT'}, {'version': 'v4', 'created': 'Tue, 9 Dec 2014 12:28:06 GMT'}, {'version': 'v5', 'created': 'Wed, 12 Aug 2015 02:45:59 GMT'}]",2016-11-18,"[['Shi', 'Guodong', ''], ['Anderson', 'Brian D. O.', ''], ['Johansson', 'Karl Henrik', '']]","['Consensus algorithms', 'Random graphs', 'Zero-One law', 'Gossiping']"
2558,1605.05227,Nikolaos Papanikos,Nikolaos Papanikos and Evangelos Papapetrou,"Revisiting XOR-based Network Coding for Energy Efficient Broadcasting in
  Mobile Ad Hoc Networks","17 pages, 21 figures, 4 tables; changed presentation style of
  termination criteria and enriched discussion on CDS-based broadcasting
  (Section 2.1); expanded discussion on the gains of lightweight coding
  approach (Section 5.2); added new experiments that evaluate lightweight
  coding (Section 6); added an overview (and related references) of traditional
  broadcast schemes (section 7.1);corrected typos",,10.1016/j.comcom.2016.07.016,,cs.NI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network coding is commonly used to improve the energy efficiency of
network-wide broadcasting in wireless multi-hop networks. In this work, we
focus on XOR-based broadcasting in mobile ad hoc networks with multiple
sources. We make the observation that the common approach, which is to benefit
from the synergy of XOR network coding with a CDS-based broadcast algorithm,
suffers performance breakdowns. After delving into the details of this synergy,
we attribute this behavior to an important mechanism of the underlying
broadcast algorithm, known as the ""termination criterion"". To tackle the
problem, we propose a termination criterion that is fully compatible with XOR
coding. In addition to that, we revisit the internals of XOR coding. We first
enhance the synergy of XOR coding with the underlying broadcast algorithm by
allowing each mechanism to benefit from information available by the other. In
this way, we manage to improve the pruning efficiency of the CDS-based
algorithm while at the same time we come up with a method for detecting coding
opportunities that has minimal storage and processing requirements compared to
current approaches. Then, for the first time, we use XOR coding as a mechanism
not only for enhancing energy efficiency but also for reducing the
end-to-end-delay. We validate the effectiveness of our proposed algorithm
through extensive simulations on a diverse set of scenarios.
","[{'version': 'v1', 'created': 'Tue, 17 May 2016 16:21:20 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Aug 2016 14:03:19 GMT'}]",2016-08-05,"[['Papanikos', 'Nikolaos', ''], ['Papapetrou', 'Evangelos', '']]","['energy-efficient broadcasting', 'network coding', 'mobile ad hoc network', 'XOR-based coding', 'connected dominating set', 'deterministic broadcasting']"
2559,1903.01084,Shenghua He,"Shenghua He, Kyaw Thu Minn, Lilianna Solnica-Krezel, Mark Anastasio,
  and Hua Li","Automatic microscopic cell counting by use of deeply-supervised density
  regression model",SPIE medical imaging 2019 oral presentation,,10.1117/12.2513045,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurately counting cells in microscopic images is important for medical
diagnoses and biological studies, but manual cell counting is very tedious,
time-consuming, and prone to subjective errors, and automatic counting can be
less accurate than desired. To improve the accuracy of automatic cell counting,
we propose here a novel method that employs deeply-supervised density
regression. A fully convolutional neural network (FCNN) serves as the primary
FCNN for density map regression. Innovatively, a set of auxiliary FCNNs are
employed to provide additional supervision for learning the intermediate layers
of the primary CNN to improve network performance. In addition, the primary CNN
is designed as a concatenating framework to integrate multi-scale features
through shortcut connections in the network, which improves the granularity of
the features extracted from the intermediate CNN layers and further supports
the final density map estimation.
","[{'version': 'v1', 'created': 'Mon, 4 Mar 2019 05:57:43 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Mar 2019 21:47:52 GMT'}, {'version': 'v3', 'created': 'Fri, 22 Mar 2019 15:20:56 GMT'}]",2019-03-25,"[['He', 'Shenghua', ''], ['Minn', 'Kyaw Thu', ''], ['Solnica-Krezel', 'Lilianna', ''], ['Anastasio', 'Mark', ''], ['Li', 'Hua', '']]","['Automatic cell counting', 'microscopic images', 'density regression', 'deeply-supervised learning', 'concatenating network']"
2560,1505.04981,Diederik Aerts,"Diederik Aerts, Sandro Sozzo and Tomas Veloz","A New Fundamental Evidence of Non-Classical Structure in the Combination
  of Natural Concepts","14 pages. arXiv admin note: substantial text overlap with
  arXiv:1503.04260","Philosophical Trasactions of the Royal Society A. 374, 20150095,
  (2015)",10.1098/rsta.2015.0095,,cs.AI quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We recently performed cognitive experiments on conjunctions and negations of
two concepts with the aim of investigating the combination problem of concepts.
Our experiments confirmed the deviations (conceptual vagueness, underextension,
overextension, etc.) from the rules of classical (fuzzy) logic and probability
theory observed by several scholars in concept theory, while our data were
successfully modeled in a quantum-theoretic framework developed by ourselves.
In this paper, we isolate a new, very stable and systematic pattern of
violation of classicality that occurs in concept combinations. In addition, the
strength and regularity of this non-classical effect leads us to believe that
it occurs at a more fundamental level than the deviations observed up to now.
It is our opinion that we have identified a deep non-classical mechanism
determining not only how concepts are combined but, rather, how they are
formed. We show that this effect can be faithfully modeled in a two-sector Fock
space structure, and that it can be exactly explained by assuming that human
thought is the supersposition of two processes, a 'logical reasoning', guided
by 'logic', and a 'conceptual reasoning' guided by 'emergence', and that the
latter generally prevails over the former. All these findings provide a new
fundamental support to our quantum-theoretic approach to human cognition.
","[{'version': 'v1', 'created': 'Tue, 19 May 2015 13:02:21 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Jun 2015 21:47:59 GMT'}]",2016-09-09,"[['Aerts', 'Diederik', ''], ['Sozzo', 'Sandro', ''], ['Veloz', 'Tomas', '']]","['Cognition', 'concept theory', 'quantum modeling', 'concept formation']"
2561,1706.06334,Adri\'an A. D\'iaz-Faes,"Adrian A. Diaz-Faes, Maria Bordons","Making visible the invisible through the analysis of acknowledgements in
  the humanities",14 pages,"Aslib Journal of Information Management 69 (5), 576-590.
  https://doi.org/10.1108/AJIM-01-2017-0008 (2017)",10.1108/AJIM-01-2017-0008,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose: Science is subject to a normative structure that includes how the
contributions and interactions between scientists are rewarded. Authorship and
citations have been the key elements within the reward system of science,
whereas acknowledgements, despite being a well-established element in scholarly
communication, have not received the same attention. This paper aims to put
forward the bearing of acknowledgements in the humanities to bring to the
foreground contributions and interactions that, otherwise, would remain
invisible through traditional indicators of research performance.
  Design/methodology/approach: The study provides a comprehensive framework to
understanding acknowledgements as part of the reward system with a special
focus on its value in the humanities as a reflection of intellectual
indebtedness. The distinctive features of research in the humanities are
outlined and the role of acknowledgements as a source of contributorship
information is reviewed to support these assumptions.
  Findings: Peer interactive communication is the prevailing support thanked in
the acknowledgements of humanities, so the notion of acknowledgements as
super-citations can make special sense in this area. Since single-authored
papers still predominate as publishing pattern in this domain, the study of
acknowledgements might help to understand social interactions and intellectual
influences that lie behind a piece of research and are not visible through
authorship.
  Originality/value: Previous works have proposed and explored the prevailing
acknowledgement types by domain. This paper focuses on the humanities to show
the role of acknowledgements within the reward system and highlight publication
patterns and inherent research features which make acknowledgements
particularly interesting in the area as reflection of the socio-cognitive
structure of research.
","[{'version': 'v1', 'created': 'Tue, 20 Jun 2017 09:24:09 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Jun 2017 17:06:06 GMT'}, {'version': 'v3', 'created': 'Tue, 31 Oct 2017 10:16:04 GMT'}]",2017-11-01,"[['Diaz-Faes', 'Adrian A.', ''], ['Bordons', 'Maria', '']]","['Acknowledgements', 'Reward\xa0 system', 'Super‐citations', 'Contributorship', 'Reward\xa0Triangle', 'Authorship', 'Humanities', 'Sociology\xa0of\xa0Science']"
2562,1405.1815,Deepjoy Das,Deepjoy Das and Dr. Sarat Saharia,"Implementation And Performance Evaluation Of Background Subtraction
  Algorithms",,,10.5121/ijcsa.2014.4206,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The study evaluates three background subtraction techniques. The techniques
ranges from very basic algorithm to state of the art published techniques
categorized based on speed, memory requirements and accuracy. Such a review can
effectively guide the designer to select the most suitable method for a given
application in a principled way. The algorithms used in the study ranges from
varying levels of accuracy and computational complexity. Few of them can also
deal with real time challenges like rain, snow, hails, swaying branches,
objects overlapping, varying light intensity or slow moving objects.
","[{'version': 'v1', 'created': 'Thu, 8 May 2014 06:49:41 GMT'}]",2014-05-09,"[['Das', 'Deepjoy', ''], ['Saharia', 'Dr. Sarat', '']]","['Background subtraction', 'background removal', 'shadow detection', 'background mixture model']"
2563,0911.4416,Arijit  Laha Ph.D.,"Arijit Laha, Nikhil R. Pal, and J. Das","Land cover classification using fuzzy rules and aggregation of
  contextual information through evidence theory","14 pages, 2 figures","IEEE Transactions on Geoscience and Remote Sensing, Vol. 44, No.
  6, pp. 1633-1642, June 2006",10.1109/TGRS.2006.864391,,cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Land cover classification using multispectral satellite image is a very
challenging task with numerous practical applications. We propose a multi-stage
classifier that involves fuzzy rule extraction from the training data and then
generation of a possibilistic label vector for each pixel using the fuzzy rule
base. To exploit the spatial correlation of land cover types we propose four
different information aggregation methods which use the possibilistic class
label of a pixel and those of its eight spatial neighbors for making the final
classification decision. Three of the aggregation methods use Dempster-Shafer
theory of evidence while the remaining one is modeled after the fuzzy k-NN
rule. The proposed methods are tested with two benchmark seven channel
satellite images and the results are found to be quite satisfactory. They are
also compared with a Markov random field (MRF) model-based contextual
classification method and found to perform consistently better.
","[{'version': 'v1', 'created': 'Mon, 23 Nov 2009 14:33:27 GMT'}]",2015-05-14,"[['Laha', 'Arijit', ''], ['Pal', 'Nikhil R.', ''], ['Das', 'J.', '']]","['classifier', 'fuzzy rules', 'rule extraction', 'evidence theory', 'fuzzy k-NN']"
2564,1707.04393,Nicolas Rougier,"Nicolas P. Rougier, Konrad Hinsen, Fr\'ed\'eric Alexandre, Thomas
  Arildsen, Lorena Barba, Fabien C. Y. Benureau, C. Titus Brown, Pierre de
  Buyl, Ozan Caglayan, Andrew P. Davison, Marc Andr\'e Delsuc, Georgios
  Detorakis, Alexandra K. Diem, Damien Drix, Pierre Enel, Beno\^it Girard,
  Olivia Guest, Matt G. Hall, Rafael Neto Henriques, Xavier Hinaut, Kamil S
  Jaron, Mehdi Khamassi, Almar Klein, Tiina Manninen, Pietro Marchesi, Dan
  McGlinn, Christoph Metzner, Owen L. Petchey, Hans Ekkehard Plesser,
  Timoth\'ee Poisot, Karthik Ram, Yoav Ram, Etienne Roesch, Cyrille Rossant,
  Vahid Rostami, Aaron Shifman, Joseph Stachelek, Marcel Stimberg, Frank
  Stollmeier, Federico Vaggi, Guillaume Viejo, Julien Vitay, Anya Vostinar,
  Roman Yurchak, Tiziano Zito",Sustainable computational science: the ReScience initiative,"8 pages, 1 figure",PeerJ Computer Science 3:e142 (2017),10.7717/peerj-cs.142,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Computer science offers a large set of tools for prototyping, writing,
running, testing, validating, sharing and reproducing results, however
computational science lags behind. In the best case, authors may provide their
source code as a compressed archive and they may feel confident their research
is reproducible. But this is not exactly true. James Buckheit and David Donoho
proposed more than two decades ago that an article about computational results
is advertising, not scholarship. The actual scholarship is the full software
environment, code, and data that produced the result. This implies new
workflows, in particular in peer-reviews. Existing journals have been slow to
adapt: source codes are rarely requested, hardly ever actually executed to
check that they produce the results advertised in the article. ReScience is a
peer-reviewed journal that targets computational research and encourages the
explicit replication of already published research, promoting new and
open-source implementations in order to ensure that the original research can
be replicated from its description. To achieve this goal, the whole publishing
chain is radically different from other traditional scientific journals.
ReScience resides on GitHub where each new implementation of a computational
study is made available together with comments, explanations, and software
tests.
","[{'version': 'v1', 'created': 'Fri, 14 Jul 2017 06:14:54 GMT'}, {'version': 'v2', 'created': 'Sat, 11 Nov 2017 07:56:07 GMT'}]",2018-05-31,"[['Rougier', 'Nicolas P.', ''], ['Hinsen', 'Konrad', ''], ['Alexandre', 'Frédéric', ''], ['Arildsen', 'Thomas', ''], ['Barba', 'Lorena', ''], ['Benureau', 'Fabien C. Y.', ''], ['Brown', 'C. Titus', ''], ['de Buyl', 'Pierre', ''], ['Caglayan', 'Ozan', ''], ['Davison', 'Andrew P.', ''], ['Delsuc', 'Marc André', ''], ['Detorakis', 'Georgios', ''], ['Diem', 'Alexandra K.', ''], ['Drix', 'Damien', ''], ['Enel', 'Pierre', ''], ['Girard', 'Benoît', ''], ['Guest', 'Olivia', ''], ['Hall', 'Matt G.', ''], ['Henriques', 'Rafael Neto', ''], ['Hinaut', 'Xavier', ''], ['Jaron', 'Kamil S', ''], ['Khamassi', 'Mehdi', ''], ['Klein', 'Almar', ''], ['Manninen', 'Tiina', ''], ['Marchesi', 'Pietro', ''], ['McGlinn', 'Dan', ''], ['Metzner', 'Christoph', ''], ['Petchey', 'Owen L.', ''], ['Plesser', 'Hans Ekkehard', ''], ['Poisot', 'Timothée', ''], ['Ram', 'Karthik', ''], ['Ram', 'Yoav', ''], ['Roesch', 'Etienne', ''], ['Rossant', 'Cyrille', ''], ['Rostami', 'Vahid', ''], ['Shifman', 'Aaron', ''], ['Stachelek', 'Joseph', ''], ['Stimberg', 'Marcel', ''], ['Stollmeier', 'Frank', ''], ['Vaggi', 'Federico', ''], ['Viejo', 'Guillaume', ''], ['Vitay', 'Julien', ''], ['Vostinar', 'Anya', ''], ['Yurchak', 'Roman', ''], ['Zito', 'Tiziano', '']]","['Open Science', 'Computational Science', 'Reproducibility', 'Replicability', 'Journal', 'Publication']"
2565,1709.04863,Piotr Br\'odka,"Jaros{\l}aw Jankowski, Piotr Br\'odka, Rados{\l}aw Michalski,
  Przemys{\l}aw Kazienko",Seeds Buffering for Information Spreading Processes,"Jankowski, J., Br\'odka, P., Michalski, R., & Kazienko, P. (2017,
  September). Seeds Buffering for Information Spreading Processes. In
  International Conference on Social Informatics (pp. 628-641). Springer",,10.1007/978-3-319-67217-5_37,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Seeding strategies for influence maximization in social networks have been
studied for more than a decade. They have mainly relied on the activation of
all resources (seeds) simultaneously in the beginning; yet, it has been shown
that sequential seeding strategies are commonly better. This research focuses
on studying sequential seeding with buffering, which is an extension to basic
sequential seeding concept. The proposed method avoids choosing nodes that will
be activated through the natural diffusion process, which is leading to better
use of the budget for activating seed nodes in the social influence process.
This approach was compared with sequential seeding without buffering and single
stage seeding. The results on both real and artificial social networks confirm
that the buffer-based consecutive seeding is a good trade-off between the final
coverage and the time to reach it. It performs significantly better than its
rivals for a fixed budget. The gain is obtained by dynamic rankings and the
ability to detect network areas with nodes that are not yet activated and have
high potential of activating their neighbours.
","[{'version': 'v1', 'created': 'Thu, 14 Sep 2017 16:35:04 GMT'}]",2017-09-15,"[['Jankowski', 'Jarosław', ''], ['Bródka', 'Piotr', ''], ['Michalski', 'Radosław', ''], ['Kazienko', 'Przemysław', '']]","['social network', 'social network analysis', 'spread of influence', 'diffusion', 'seed selection', 'sequential   seeding']"
2566,1012.4241,Udita N Katugampola,Udita N. Katugampola,A New Technique for Text Data Compression,Submitted to IJKEDM,"2012 International Symposium on Computer, Consumer and Control,
  2012, pp.405-409",10.1109/IS3C.2012.109,,cs.CR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we use ternary representation of numbers for compressing text
data. We use a binary map for ternary digits and introduce a way to use the
binary 11-pair, which has never been use for coding data before, and we futher
use 4-Digits ternary representation of alphabet with lowercase and uppercase
with some extra symbols that are most commonly used in day to day life. We find
a way to minimize the length of the bits string, which is only possible in
ternary representation thus drastically reducing the length of the code. We
also find some connection between this technique of coding dat and Fibonacci
numbers.
","[{'version': 'v1', 'created': 'Mon, 20 Dec 2010 05:21:03 GMT'}]",2012-06-27,"[['Katugampola', 'Udita N.', '']]","['Coding', 'Data Compression', 'Binary system', 'Ternary System', 'Golden Ratio']"
2567,1308.0143,Afonso S. Bandeira,Afonso S. Bandeira and Dustin G. Mixon,Near-optimal phase retrieval of sparse vectors,,"Wavelets and Sparsity XV, Proceedings of SPIE Optics+Photonics,
  Session 14, 2013",10.1117/12.2024355,,cs.IT math.FA math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many areas of imaging science, it is difficult to measure the phase of
linear measurements. As such, one often wishes to reconstruct a signal from
intensity measurements, that is, perform phase retrieval. In several
applications the signal in question is believed to be sparse. In this paper, we
use ideas from the recently developed polarization method for phase retrieval
and provide an algorithm that is guaranteed to recover a sparse signal from a
number of phaseless linear measurements that scales linearly with the sparsity
of the signal (up to logarithmic factors). This is particularly remarkable
since it is known that a certain popular class of convex methods is not able to
perform recovery unless the number of measurements scales with the square of
the sparsity of the signal. This is a shorter version of a more complete
publication that will appear elsewhere.
","[{'version': 'v1', 'created': 'Thu, 1 Aug 2013 10:17:11 GMT'}]",2015-06-16,"[['Bandeira', 'Afonso S.', ''], ['Mixon', 'Dustin G.', '']]","['Phase Retrieval', 'Sparse Recovery', 'Polarization', 'Angular Synchronization']"
2568,1406.3550,Saraswati Mishra,Saraswati Mishra and Prabhjot Kaur,Energy efficient neighbor selection for flat wireless sensor networks,"7 pages, 5 figures, 1 table,WiMON 2014 conference proceedings, may
  24-25",,10.5121/csit.2014.4511,,cs.NI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we have analyzed energy efficient neighbour selection
algorithms for routing in wireless sensor networks. Since energy saving or
consumption is an important aspect of wireless sensor networks, its precise
usage is highly desirable both for the faithful performance of network and to
increase the network life time. For this work, we have considered a flat
network topology where every node has the same responsibility and capability.
We have compared two energy efficient algorithms and analyzed their
performances with increase in number of nodes, time rounds and node failures.
","[{'version': 'v1', 'created': 'Fri, 13 Jun 2014 14:39:43 GMT'}]",2014-06-16,"[['Mishra', 'Saraswati', ''], ['Kaur', 'Prabhjot', '']]","['Flat Topology', 'Negotiation Based Routing', 'Routing Protocol', 'Wireless Sensor Networks']"
2569,2105.05092,Gihan Jayatilaka,"Vu Tran, Gihan Jayatilaka, Ashwin Ashok, Archan Misra","DeepLight: Robust & Unobtrusive Real-time Screen-Camera Communication
  for Real-World Displays","Accepted for IPSN 2021 (ACM/IEEE International Conference on
  Information Processing in Sensor Networks 2021)",,10.1145/3412382.3458269,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper introduces a novel, holistic approach for robust Screen-Camera
Communication (SCC), where video content on a screen is visually encoded in a
human-imperceptible fashion and decoded by a camera capturing images of such
screen content. We first show that state-of-the-art SCC techniques have two key
limitations for in-the-wild deployment: (a) the decoding accuracy drops rapidly
under even modest screen extraction errors from the captured images, and (b)
they generate perceptible flickers on common refresh rate screens even with
minimal modulation of pixel intensity. To overcome these challenges, we
introduce DeepLight, a system that incorporates machine learning (ML) models in
the decoding pipeline to achieve humanly-imperceptible, moderately high SCC
rates under diverse real-world conditions. Deep-Light's key innovation is the
design of a Deep Neural Network (DNN) based decoder that collectively decodes
all the bits spatially encoded in a display frame, without attempting to
precisely isolate the pixels associated with each encoded bit. In addition,
DeepLight supports imperceptible encoding by selectively modulating the
intensity of only the Blue channel, and provides reasonably accurate screen
extraction (IoU values >= 83%) by using state-of-the-art object detection DNN
pipelines. We show that a fully functional DeepLight system is able to robustly
achieve high decoding accuracy (frame error rate < 0.2) and moderately-high
data goodput (>=0.95Kbps) using a human-held smartphone camera, even over
larger screen-camera distances (approx =2m).
","[{'version': 'v1', 'created': 'Tue, 11 May 2021 14:44:12 GMT'}]",2021-05-13,"[['Tran', 'Vu', ''], ['Jayatilaka', 'Gihan', ''], ['Ashok', 'Ashwin', ''], ['Misra', 'Archan', '']]","['Screen-camera communication', 'Visible light communication', 'Imperceptible', 'Deep neural networks', 'Perception', 'Flicker-free']"
2570,1812.05164,Luiz Capretz Dr.,"Ronnie Santos, Cleyton Magalhaes, Luiz Fernando Capretz, Jorge Correia
  Neto, Fabio Queda Bueno da Silva, Abdelrahman Saher","Computer Games Are Serious Business and so is their Quality:
  Particularities of Software Testing in Game Development from the Perspective
  of Practitioners",,"ACM/IEEE 12th International Symposium on Empirical Software
  Engineering and Measurement (ESEM), Oulu, Finland, Article No. 33, pp. 1-10,
  October 2018",10.1145/3239235.3268923,,cs.CY cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the last several decades, computer games started to have a significant
impact on society. However, although a computer game is a type of software, the
process to conceptualize, produce and deliver a game could involve unusual
features. In software testing, for instance, studies demonstrated the hesitance
of professionals to use automated testing techniques with games, due to the
constant changes in requirements and design, and pointed out the need for
creating testing tools that take into account the flexibility required for the
game development process. Goal. This study aims to improve the current body of
knowledge regarding software testing in game development and point out the
existing particularities observed in software testing considering the
development of a computer game. Method. A mixed-method approach based on a case
study and an opinion survey was applied to collect quantitative and qualitative
data from software professionals regarding the particularities of software
testing in game development. Results. We analyzed over 70 messages posted on
three well-established network of question-and-answer communities related to
software engineering, software testing and game development and received
answers of 38 professionals discussing differences between testing a computer
game and a general software, and identified important aspects to be observed by
practitioners in the process of planning, performing and reporting tests in
this context. Conclusion. Considering computer games, software testing must
focus not only on the common aspects of a general software, but also, track and
investigate issues that could be related to game balance, game physics and
entertainment related-aspects to guarantee the quality of computer games and a
successful testing process.
","[{'version': 'v1', 'created': 'Wed, 12 Dec 2018 21:34:08 GMT'}]",2018-12-14,"[['Santos', 'Ronnie', ''], ['Magalhaes', 'Cleyton', ''], ['Capretz', 'Luiz Fernando', ''], ['Neto', 'Jorge Correia', ''], ['da Silva', 'Fabio Queda Bueno', ''], ['Saher', 'Abdelrahman', '']]","['Game Development', 'Software Testing', 'Mixed-method']"
2571,1705.04504,Mohammed Al-Imari,"Mohammed Al-Imari, Muhammad Ali Imran, and Pei Xiao","Radio Resource Allocation for Multicarrier-Low Density Spreading
  Multiple Access",,"IEEE Transactions on Vehicular Technology, vol. 66, no. 3, pp.
  2382-2393, March 2017",10.1109/TVT.2016.2579168,,cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multicarrier-low density spreading multiple access (MC-LDSMA) is a promising
multiple access technique that enables near optimum multiuser detection. In
MC-LDSMA, each user's symbol spread on a small set of subcarriers, and each
subcarrier is shared by multiple users. The unique structure of MC-LDSMA makes
the radio resource allocation more challenging comparing to some well-known
multiple access techniques. In this paper, we study the radio resource
allocation for single-cell MC-LDSMA system. Firstly, we consider the
single-user case, and derive the optimal power allocation and subcarriers
partitioning schemes. Then, by capitalizing on the optimal power allocation of
the Gaussian multiple access channel, we provide an optimal solution for
MC-LDSMA that maximizes the users' weighted sum-rate under relaxed constraints.
Due to the prohibitive complexity of the optimal solution, suboptimal
algorithms are proposed based on the guidelines inferred by the optimal
solution. The performance of the proposed algorithms and the effect of
subcarrier loading and spreading are evaluated through Monte Carlo simulations.
Numerical results show that the proposed algorithms significantly outperform
conventional static resource allocation, and MC-LDSMA can improve the system
performance in terms of spectral efficiency and fairness in comparison with
OFDMA.
","[{'version': 'v1', 'created': 'Fri, 12 May 2017 10:43:22 GMT'}]",2017-05-15,"[['Al-Imari', 'Mohammed', ''], ['Imran', 'Muhammad Ali', ''], ['Xiao', 'Pei', '']]","['Low density spreading', 'uplink communications', 'radioresource allocation', 'fairness']"
2572,1803.08544,Sumita Mishra,"Sachin Kumar, Sumita Mishra, Pallavi Asthana, Pragya",Automated Detection of Acute Leukemia using K-mean Clustering Algorithm,Presented in ICCCCS 2016,"Advances in Intelligent Systems and Computing, vol 554. Springer,
  2018",10.1007/978-981-10-3773-3_64,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Leukemia is a hematologic cancer which develops in blood tissue and triggers
rapid production of immature and abnormal shaped white blood cells. Based on
statistics it is found that the leukemia is one of the leading causes of death
in men and women alike. Microscopic examination of blood sample or bone marrow
smear is the most effective technique for diagnosis of leukemia. Pathologists
analyze microscopic samples to make diagnostic assessments on the basis of
characteristic cell features. Recently, computerized methods for cancer
detection have been explored towards minimizing human intervention and
providing accurate clinical information. This paper presents an algorithm for
automated image based acute leukemia detection systems. The method implemented
uses basic enhancement, morphology, filtering and segmenting technique to
extract region of interest using k-means clustering algorithm. The proposed
algorithm achieved an accuracy of 92.8% and is tested with Nearest Neighbor
(KNN) and Naive Bayes Classifier on the data-set of 60 samples.
","[{'version': 'v1', 'created': 'Tue, 6 Mar 2018 06:24:01 GMT'}]",2018-03-28,"[['Kumar', 'Sachin', ''], ['Mishra', 'Sumita', ''], ['Asthana', 'Pallavi', ''], ['Pragya', '', '']]","['Image Processing', 'White Blood Cells', 'Leukemia', 'Clustering']"
2573,1107.1970,Gopalakrishnan Tr Nair,"Mary Cherian, T.R.Gopalakrishnan Nair",A Packet Scheduling Strategy in Sensor Networks with SGMH Protocol,"4 pages, 5 figures, IEEE , International Conference ICCCNT 2010,
  India, IEEE Explore- 2010, ISBN 978-1-4211-6591, pp 1-4, 30th September 2010",,10.1109/ICCCNT.2010.5591556,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data communication in sensor networks can have timing constraints like end to
end deadlines. If the deadlines are not met either a catastrophe can happen in
hard real time systems or performance deterioration can occur in soft real time
systems. In real time sensor networks, the recovery of data through
retransmission should be minimized due to the stringent requirements on the
worst case time delays. This paper presents the application of Stop and Go
Multihop protocol (SGMH) at node level in wireless sensor networks for
scheduling and hence to meet the hard real time routing requirements. SGMH is a
distributed multihop packet delivery algorithm. The fractions of the total
available bandwidth on each channel is assigned to several traffic classes by
which the time it takes to traverse each of the hops from the source to the
destination is bounded. It is based on the notion of time frames (Tfr). In
sensor networks packets can have different delay guarantees. Multiple frame
sizes can be assigned for different traffic classes.
","[{'version': 'v1', 'created': 'Mon, 11 Jul 2011 09:00:10 GMT'}]",2016-11-17,"[['Cherian', 'Mary', ''], ['Nair', 'T. R. Gopalakrishnan', '']]","['Wireless Sensor networks (WSN)', 'Distributed    Algorithm', 'Hard Real Time Constraints', 'Stop and Go Multihop protocol', 'Time Frames (Tfr)', 'traffic class']"
2574,1812.07429,Daisuke Yamaguchi,Daisuke Yamaguchi and Kimio Kuramitsu,"CPEG: A Typed Tree Construction from Parsing Expression Grammars with
  Regex-Like Captures","Accepted for publication in the proceedings of the 34th ACM/SIGAPP
  Symposium On Applied Computing (SAC'19)",,10.1145/3297280.3297433,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CPEG is an extended parsing expression grammar with regex-like capture
annotation. Two annotations (capture and left-folding) allow a flexible
construction of syntax trees from arbitrary parsing patterns. More importantly,
CPEG is designed to guarantee structural constraints of syntax trees for any
input strings. This reduces the amount of user code needed to check whether the
intended elements exist.
  To represent the structural constraints, we focus on regular expression
types, a variant formalism of tree automata, which have been intensively
studied in the context of XML schemas. Regular expression type is inferred from
a given CPEG by the type inference that is formally developed in this paper. We
prove the soundness and the uniqueness of the type inference. The type
inference enables a CPEG to serve both as a syntactic specification of the
input and a schematic specification of the output.
","[{'version': 'v1', 'created': 'Tue, 18 Dec 2018 15:23:47 GMT'}]",2018-12-19,"[['Yamaguchi', 'Daisuke', ''], ['Kuramitsu', 'Kimio', '']]","['Parsing', 'parsing expression grammars', 'type inference', 'regular expression types']"
2575,2202.05338,A. Feder Cooper,"A. Feder Cooper and Emanuel Moss and Benjamin Laufer and Helen
  Nissenbaum","Accountability in an Algorithmic Society: Relationality, Responsibility,
  and Robustness in Machine Learning",,"2022 ACM Conference on Fairness, Accountability, and Transparency
  (FAccT '22)",10.1145/3531146.3533150,,cs.CY cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  In 1996, Accountability in a Computerized Society [95] issued a clarion call
concerning the erosion of accountability in society due to the ubiquitous
delegation of consequential functions to computerized systems. Nissenbaum [95]
described four barriers to accountability that computerization presented, which
we revisit in relation to the ascendance of data-driven algorithmic
systems--i.e., machine learning or artificial intelligence--to uncover new
challenges for accountability that these systems present. Nissenbaum's original
paper grounded discussion of the barriers in moral philosophy; we bring this
analysis together with recent scholarship on relational accountability
frameworks and discuss how the barriers present difficulties for instantiating
a unified moral, relational framework in practice for data-driven algorithmic
systems. We conclude by discussing ways of weakening the barriers in order to
do so.
","[{'version': 'v1', 'created': 'Thu, 10 Feb 2022 21:39:02 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Feb 2022 20:39:43 GMT'}, {'version': 'v3', 'created': 'Fri, 13 May 2022 23:55:48 GMT'}]",2022-05-17,"[['Cooper', 'A. Feder', ''], ['Moss', 'Emanuel', ''], ['Laufer', 'Benjamin', ''], ['Nissenbaum', 'Helen', '']]","['accountability', 'relationality', 'moral philosophy', 'robustness', 'data-drivenalgorithmic systems']"
2576,1911.08924,Sujoy Bhore,"Sayan Bandyapadhyay and Aritra Banik and Sujoy Bhore and Martin
  N\""ollenburg",Geometric Planar Networks on Bichromatic Points,Appeared in Theoretical Computer Science (TCS) 2021,,10.1016/j.tcs.2021.09.035,,cs.CG cs.DS,http://creativecommons.org/licenses/by/4.0/,"  We study three classical graph problems - Hamiltonian path, minimum spanning
tree, and minimum perfect matching on geometric graphs induced by bichromatic
(red and blue) points. These problems have been widely studied for points in
the Euclidean plane, and many of them are NP-hard. In this work, we consider
these problems for collinear points. We show that almost all of these problems
can be solved in linear time in this setting.
","[{'version': 'v1', 'created': 'Wed, 20 Nov 2019 14:16:24 GMT'}, {'version': 'v2', 'created': 'Sat, 16 Jul 2022 12:35:38 GMT'}]",2022-07-19,"[['Bandyapadhyay', 'Sayan', ''], ['Banik', 'Aritra', ''], ['Bhore', 'Sujoy', ''], ['Nöllenburg', 'Martin', '']]","['Hamiltonian path', 'minimum spanning tree', 'minimum prefect matching', 'red-blue points', 'collinear points']"
2577,1210.1316,Xi Peng,"Xi Peng, Lei Zhang, Zhang Yi, Kok Kiong Tan","Learning Locality-Constrained Collaborative Representation for Face
  Recognition","16 pages, v2","Pattern Recognition, 47 (9), 2794-2806, 2014",10.1016/j.patcog.2014.03.013,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The model of low-dimensional manifold and sparse representation are two
well-known concise models that suggest each data can be described by a few
characteristics. Manifold learning is usually investigated for dimension
reduction by preserving some expected local geometric structures from the
original space to a low-dimensional one. The structures are generally
determined by using pairwise distance, e.g., Euclidean distance. Alternatively,
sparse representation denotes a data point as a linear combination of the
points from the same subspace. In practical applications, however, the nearby
points in terms of pairwise distance may not belong to the same subspace, and
vice versa. Consequently, it is interesting and important to explore how to get
a better representation by integrating these two models together. To this end,
this paper proposes a novel coding algorithm, called Locality-Constrained
Collaborative Representation (LCCR), which improves the robustness and
discrimination of data representation by introducing a kind of local
consistency. The locality term derives from a biologic observation that the
similar inputs have similar code. The objective function of LCCR has an
analytical solution, and it does not involve local minima. The empirical
studies based on four public facial databases, ORL, AR, Extended Yale B, and
Multiple PIE, show that LCCR is promising in recognizing human faces from
frontal views with varying expression and illumination, as well as various
corruptions and occlusions.
","[{'version': 'v1', 'created': 'Thu, 4 Oct 2012 07:12:49 GMT'}, {'version': 'v2', 'created': 'Sat, 30 Mar 2013 07:12:30 GMT'}]",2016-03-22,"[['Peng', 'Xi', ''], ['Zhang', 'Lei', ''], ['Yi', 'Zhang', ''], ['Tan', 'Kok Kiong', '']]","['Non-sparse representation', 'sparse representation', 'locality consistency', 'ℓ2-minimization', 'partialocclusions', 'additive noise', 'non-additive noise', 'robustness']"
2578,1612.08910,Waqar  Ahmed,"Waqar Ahmed, Osman Hasan, Usman Pervez and Junaid Qadir",Reliability Modeling and Analysis of Communication Networks,82,"W. Ahmed, O. Hasan, U. Pervez and J. Qadir, Reliability Modeling
  and Analysis of Communication Networks, Journal of Network and Computer
  Applications, Elseiver, volume 78, pp. 191-215, 2016",10.1016/j.jnca.2016.11.008,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent times, the functioning of various aspects of modern
society---ranging from the various infrastructural utilities such as electrical
power, water to socio-economical aspects such as telecommunications, business,
commerce, education---has become critically reliant on communication networks,
and particularly on the Internet. With the migration of critical facilities to
the Internet, it has become vitally important to ensure the reliability and
availability of networks. In this paper, we study various modeling and analysis
techniques that can aid in the study of reliability of communication networks.
In this regard, we provide background on the modeling techniques (such as
reliability block diagrams, fault trees, Markov chains, etc.) and analysis
techniques (such as mathematical analytical methods, simulation methods, and
formal methods). Apart from providing the necessary background, we also
critically evaluate the pros and cons of different approaches, and provide a
detailed survey of their applications in communication networks. To the best of
our knowledge, this is the first in-depth review of the application of
reliability modeling and analysis techniques in communication networks.
","[{'version': 'v1', 'created': 'Wed, 28 Dec 2016 15:40:06 GMT'}]",2016-12-30,"[['Ahmed', 'Waqar', ''], ['Hasan', 'Osman', ''], ['Pervez', 'Usman', ''], ['Qadir', 'Junaid', '']]","['Reliability Assessment', 'Communication Networks', 'ReliabilityBlock Diagrams (RBDs)', 'Fault Tree', 'Markov Chain', 'Simulation Tools', 'Formal Methods']"
2579,1703.06180,Tobias Schnabel,"Aman Agarwal, Soumya Basu, Tobias Schnabel, Thorsten Joachims",Effective Evaluation using Logged Bandit Feedback from Multiple Loggers,KDD 2018,,10.1145/3097983.3098155,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurately evaluating new policies (e.g. ad-placement models, ranking
functions, recommendation functions) is one of the key prerequisites for
improving interactive systems. While the conventional approach to evaluation
relies on online A/B tests, recent work has shown that counterfactual
estimators can provide an inexpensive and fast alternative, since they can be
applied offline using log data that was collected from a different policy
fielded in the past. In this paper, we address the question of how to estimate
the performance of a new target policy when we have log data from multiple
historic policies. This question is of great relevance in practice, since
policies get updated frequently in most online systems. We show that naively
combining data from multiple logging policies can be highly suboptimal. In
particular, we find that the standard Inverse Propensity Score (IPS) estimator
suffers especially when logging and target policies diverge -- to a point where
throwing away data improves the variance of the estimator. We therefore propose
two alternative estimators which we characterize theoretically and compare
experimentally. We find that the new estimators can provide substantially
improved estimation accuracy.
","[{'version': 'v1', 'created': 'Fri, 17 Mar 2017 19:29:36 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Jun 2017 11:52:23 GMT'}]",2017-06-27,"[['Agarwal', 'Aman', ''], ['Basu', 'Soumya', ''], ['Schnabel', 'Tobias', ''], ['Joachims', 'Thorsten', '']]","['counterfactual estimators', 'log data', 'implicit feedback', 'of-policyevaluation']"
2580,1407.0848,Diego Mirandola,"Ignacio Cascudo, Ronald Cramer, Diego Mirandola, Gilles Z\'emor",Squares of Random Linear Codes,,"IEEE Transactions on Information Theory, vol. 61, no. 3, pp.
  1159-1173, March 2015",10.1109/TIT.2015.2393251,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a linear code $C$, one can define the $d$-th power of $C$ as the span
of all componentwise products of $d$ elements of $C$. A power of $C$ may
quickly fill the whole space. Our purpose is to answer the following question:
does the square of a code ""typically"" fill the whole space? We give a positive
answer, for codes of dimension $k$ and length roughly $\frac{1}{2}k^2$ or
smaller. Moreover, the convergence speed is exponential if the difference
$k(k+1)/2-n$ is at least linear in $k$. The proof uses random coding and
combinatorial arguments, together with algebraic tools involving the precise
computation of the number of quadratic forms of a given rank, and the number of
their zeros.
","[{'version': 'v1', 'created': 'Thu, 3 Jul 2014 10:15:49 GMT'}, {'version': 'v2', 'created': 'Sat, 27 Dec 2014 10:24:17 GMT'}, {'version': 'v3', 'created': 'Wed, 14 Jan 2015 15:27:38 GMT'}]",2016-11-18,"[['Cascudo', 'Ignacio', ''], ['Cramer', 'Ronald', ''], ['Mirandola', 'Diego', ''], ['Zémor', 'Gilles', '']]","['Error-correcting codes', 'Schur-product codes', 'Randomcodes', 'Quadratic forms']"
2581,2208.07037,Bestoun Ahmed Dr.,"Firas Bayram, Bestoun S. Ahmed, Erik Hallin, Anton Engman","A Drift Handling Approach for Self-Adaptive ML Software in Scalable
  Industrial Processes",5 pages,"The 37th IEEE/ACM International Conference on Automated Software
  Engineering (ASE22) 2022",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most industrial processes in real-world manufacturing applications are
characterized by the scalability property, which requires an automated strategy
to self-adapt machine learning (ML) software systems to the new conditions. In
this paper, we investigate an Electroslag Remelting (ESR) use case process from
the Uddeholms AB steel company. The use case involves predicting the minimum
pressure value for a vacuum pumping event. Taking into account the long time
required to collect new records and efficiently integrate the new machines with
the built ML software system. Additionally, to accommodate the changes and
satisfy the non-functional requirement of the software system, namely
adaptability, we propose an automated and adaptive approach based on a drift
handling technique called importance weighting. The aim is to address the
problem of adding a new furnace to production and enable the adaptability
attribute of the ML software. The overall results demonstrate the improvements
in ML software performance achieved by implementing the proposed approach over
the classical non-adaptive approach.
","[{'version': 'v1', 'created': 'Mon, 15 Aug 2022 07:25:49 GMT'}]",2022-08-16,"[['Bayram', 'Firas', ''], ['Ahmed', 'Bestoun S.', ''], ['Hallin', 'Erik', ''], ['Engman', 'Anton', '']]","['ML software adaptability', 'automated industrial process', 'ElectroslagRemelting (ESR)', 'non-functional requirements', 'changing environments', 'concept drift']"
2582,2105.10484,Jinnian Zhang,"Ze Meng, Jinnian Zhang, Yumeng Li, Jiancheng Li, Tanchao Zhu, Lifeng
  Sun","A General Method For Automatic Discovery of Powerful Interactions In
  Click-Through Rate Prediction",Accepted by ACM SIGIR 2021,,10.1145/3404835.3462842,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modeling powerful interactions is a critical challenge in Click-through rate
(CTR) prediction, which is one of the most typical machine learning tasks in
personalized advertising and recommender systems. Although developing
hand-crafted interactions is effective for a small number of datasets, it
generally requires laborious and tedious architecture engineering for extensive
scenarios. In recent years, several neural architecture search (NAS) methods
have been proposed for designing interactions automatically. However, existing
methods only explore limited types and connections of operators for interaction
generation, leading to low generalization ability. To address these problems,
we propose a more general automated method for building powerful interactions
named AutoPI. The main contributions of this paper are as follows: AutoPI
adopts a more general search space in which the computational graph is
generalized from existing network connections, and the interactive operators in
the edges of the graph are extracted from representative hand-crafted works. It
allows searching for various powerful feature interactions to produce higher
AUC and lower Logloss in a wide variety of applications. Besides, AutoPI
utilizes a gradient-based search strategy for exploration with a significantly
low computational cost. Experimentally, we evaluate AutoPI on a diverse suite
of benchmark datasets, demonstrating the generalizability and efficiency of
AutoPI over hand-crafted architectures and state-of-the-art NAS algorithms.
","[{'version': 'v1', 'created': 'Fri, 21 May 2021 17:48:28 GMT'}]",2021-05-24,"[['Meng', 'Ze', ''], ['Zhang', 'Jinnian', ''], ['Li', 'Yumeng', ''], ['Li', 'Jiancheng', ''], ['Zhu', 'Tanchao', ''], ['Sun', 'Lifeng', '']]","['Click-through Rate Prediction', 'Gradient-based Neural ArchitectureSearch', 'Feature Interaction', 'Interaction Ensemble']"
2583,1909.09848,Danny Yuxing Huang,"Danny Yuxing Huang, Noah Apthorpe, Gunes Acar, Frank Li, Nick Feamster","IoT Inspector: Crowdsourcing Labeled Network Traffic from Smart Home
  Devices at Scale",,"Proceedings of the ACM on Interactive, Mobile, Wearable and
  Ubiquitous Technologies. Volume 4, Issue 2, Article 46. June 2020",10.1145/3397333,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The proliferation of smart home devices has created new opportunities for
empirical research in ubiquitous computing, ranging from security and privacy
to personal health. Yet, data from smart home deployments are hard to come by,
and existing empirical studies of smart home devices typically involve only a
small number of devices in lab settings. To contribute to data-driven smart
home research, we crowdsource the largest known dataset of labeled network
traffic from smart home devices from within real-world home networks. To do so,
we developed and released IoT Inspector, an open-source tool that allows users
to observe the traffic from smart home devices on their own home networks.
Since April 2019, 4,322 users have installed IoT Inspector, allowing us to
collect labeled network traffic from 44,956 smart home devices across 13
categories and 53 vendors. We demonstrate how this data enables new research
into smart homes through two case studies focused on security and privacy.
First, we find that many device vendors use outdated TLS versions and advertise
weak ciphers. Second, we discover about 350 distinct third-party advertiser and
tracking domains on smart TVs. We also highlight other research areas, such as
network management and healthcare, that can take advantage of IoT Inspector's
dataset. To facilitate future reproducible research in smart homes, we will
release the IoT Inspector data to the public.
","[{'version': 'v1', 'created': 'Sat, 21 Sep 2019 15:57:09 GMT'}]",2021-01-20,"[['Huang', 'Danny Yuxing', ''], ['Apthorpe', 'Noah', ''], ['Acar', 'Gunes', ''], ['Li', 'Frank', ''], ['Feamster', 'Nick', '']]","['smart home', 'Internet-of-Things', 'network measurement', 'security', 'privacy']"
2584,0908.0828,Andrew Adamatzky,"Genaro J. Martinez, Andrew Adamatzky, Harold V. McIntosh","Localization dynamics in a binary two-dimensional cellular automaton:
  the Diffusion Rule",Accepted to Journal of Cellular Automata,,10.1007/978-1-84996-217-9_16,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study a two-dimensional cellular automaton (CA), called Diffusion Rule
(DR), which exhibits diffusion-like dynamics of propagating patterns. In
computational experiments we discover a wide range of mobile and stationary
localizations (gliders, oscillators, glider guns, puffer trains, etc), analyze
spatio-temporal dynamics of collisions between localizations, and discuss
possible applications in unconventional computing.
","[{'version': 'v1', 'created': 'Thu, 6 Aug 2009 09:33:34 GMT'}]",2015-05-13,"[['Martinez', 'Genaro J.', ''], ['Adamatzky', 'Andrew', ''], ['McIntosh', 'Harold V.', '']]","['Cellular automata', 'Diffusion Rule', 'semi-totalistic rules', 'particle collisions', 'mean field theory', 'reaction-diffusion', 'unconventionalcomputing']"
2585,1807.04578,Ferdi Kara,"Ezgi Sanli, Ferdi Kara, Hakan Kaya","Effect of the Error Propagation on the Error Performance of Cooperative
  Communications with the Best Relay Selection Schemes","26.IEEE Signal Processing and Communications Applications
  Conference,Izmir,Turkey,2017",,10.1109/SIU.2018.8404742,,cs.IT eess.SP math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, error performance of the cooperative communication systems
with the best relay selection scheme is investigated in the presence of error
propagation from role to destination. The error propagation expression is
derived firstly when the best relay is selected within M relays. The derived
end-to-end BER expression is verified with the computer simulations. It is
shown that the best relay selection does not ensure M+1 diversity order under
the error propagation unlike perfect decoding. In addition, the threshold
selection for the relays has dominant effect on the error performance of the
system.
","[{'version': 'v1', 'created': 'Thu, 12 Jul 2018 12:41:02 GMT'}]",2018-07-13,"[['Sanli', 'Ezgi', ''], ['Kara', 'Ferdi', ''], ['Kaya', 'Hakan', '']]","['Cooperative communication', 'Relay selection', 'errorpropagation']"
2586,1407.1425,Junhao Zhang,"Junhao Zhang, Tongfei Chen, Junfeng Hu","On the relationship between Gaussian stochastic blockmodels and label
  propagation algorithms","22 pages, 17 figures",J. Stat. Mech. (2015) P03009,10.1088/1742-5468/2015/03/P03009,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of community detection receives great attention in recent years.
Many methods have been proposed to discover communities in networks. In this
paper, we propose a Gaussian stochastic blockmodel that uses Gaussian
distributions to fit weight of edges in networks for non-overlapping community
detection. The maximum likelihood estimation of this model has the same
objective function as general label propagation with node preference. The node
preference of a specific vertex turns out to be a value proportional to the
intra-community eigenvector centrality (the corresponding entry in principal
eigenvector of the adjacency matrix of the subgraph inside that vertex's
community) under maximum likelihood estimation. Additionally, the maximum
likelihood estimation of a constrained version of our model is highly related
to another extension of label propagation algorithm, namely, the label
propagation algorithm under constraint. Experiments show that the proposed
Gaussian stochastic blockmodel performs well on various benchmark networks.
","[{'version': 'v1', 'created': 'Sat, 5 Jul 2014 18:28:09 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Sep 2014 15:06:07 GMT'}, {'version': 'v3', 'created': 'Wed, 24 Dec 2014 09:49:36 GMT'}, {'version': 'v4', 'created': 'Tue, 27 Jan 2015 11:34:49 GMT'}]",2015-03-19,"[['Zhang', 'Junhao', ''], ['Chen', 'Tongfei', ''], ['Hu', 'Junfeng', '']]","['random graphs', 'networks', 'clustering techniques', 'analysis of algorithms']"
2587,1908.03809,Jonathan Howe,"Jonathan Howe, Kyle Pula, Aaron A. Reite","Conditional Generative Adversarial Networks for Data Augmentation and
  Adaptation in Remotely Sensed Imagery",,,10.1117/12.2529586,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The difficulty in obtaining labeled data relevant to a given task is among
the most common and well-known practical obstacles to applying deep learning
techniques to new or even slightly modified domains. The data volumes required
by the current generation of supervised learning algorithms typically far
exceed what a human needs to learn and complete a given task. We investigate
ways to expand a given labeled corpus of remote sensed imagery into a larger
corpus using Generative Adversarial Networks (GANs). We then measure how these
additional synthetic data affect supervised machine learning performance on an
object detection task.
  Our data driven strategy is to train GANs to (1) generate synthetic
segmentation masks and (2) generate plausible synthetic remote sensing imagery
corresponding to these segmentation masks. Run sequentially, these GANs allow
the generation of synthetic remote sensing imagery complete with segmentation
labels. We apply this strategy to the data set from ISPRS' 2D Semantic Labeling
Contest - Potsdam, with a follow on vehicle detection task. We find that in
scenarios with limited training data, augmenting the available data with such
synthetically generated data can improve detector performance.
","[{'version': 'v1', 'created': 'Sat, 10 Aug 2019 21:26:54 GMT'}]",2019-09-24,"[['Howe', 'Jonathan', ''], ['Pula', 'Kyle', ''], ['Reite', 'Aaron A.', '']]","['Remote sensing', 'Deep Learning', 'Object Detection', 'Synthetic Data', 'Generative Adversarial Networks']"
2588,2003.14292,Suyu Ge,Suyu Ge and Chuhan Wu and Fangzhao Wu and Tao Qi and Yongfeng Huang,Graph Enhanced Representation Learning for News Recommendation,,,10.1145/3366423.3380050,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the explosion of online news, personalized news recommendation becomes
increasingly important for online news platforms to help their users find
interesting information. Existing news recommendation methods achieve
personalization by building accurate news representations from news content and
user representations from their direct interactions with news (e.g., click),
while ignoring the high-order relatedness between users and news. Here we
propose a news recommendation method which can enhance the representation
learning of users and news by modeling their relatedness in a graph setting. In
our method, users and news are both viewed as nodes in a bipartite graph
constructed from historical user click behaviors. For news representations, a
transformer architecture is first exploited to build news semantic
representations. Then we combine it with the information from neighbor news in
the graph via a graph attention network. For user representations, we not only
represent users from their historically clicked news, but also attentively
incorporate the representations of their neighbor users in the graph. Improved
performances on a large-scale real-world dataset validate the effectiveness of
our proposed method.
","[{'version': 'v1', 'created': 'Tue, 31 Mar 2020 15:27:31 GMT'}]",2020-04-02,"[['Ge', 'Suyu', ''], ['Wu', 'Chuhan', ''], ['Wu', 'Fangzhao', ''], ['Qi', 'Tao', ''], ['Huang', 'Yongfeng', '']]","['News Recommendation', 'Transformer', 'Graph Attention Network']"
2589,2102.02536,Vittorio Lippi,Vittorio Lippi,"Deep Learning Based Model Identification System Exploits the Modular
  Structure of a Bio-Inspired Posture Control Model for Humans and Humanoids","Presented at ICPRAM 2021, International Conference on Pattern
  Recognition Applications and Methods","roceedings of the 10th International Conference on Pattern
  Recognition Applications and Methods - Volume 1: ICPRAM, (2021) ISBN
  978-989-758-486-2, pages 579-585",10.5220/0010245405400547,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  This work presents a system identification procedure based on Convolutional
Neural Networks (CNN) for human posture control using the DEC (Disturbance
Estimation and Compensation) parametric model. The modular structure of the
proposed control model inspired the design of a modular identification
procedure, in the sense that the same neural network is used to identify the
parameters of the modules controlling different degrees of freedom. In this way
the presented examples of body sway induced by external stimuli provide several
training samples at once
","[{'version': 'v1', 'created': 'Thu, 4 Feb 2021 10:54:24 GMT'}]",2021-03-08,"[['Lippi', 'Vittorio', '']]","['Posture Control', 'Deep Learning', 'System Identification', 'Parametric Nonlinear System']"
2590,1102.3002,Ryutaroh Matsumoto,Ryutaroh Matsumoto and Masahito Hayashi,Secure Multiplex Network Coding,"IEEEtran.sty, 7 pages, no figure, Version 2 will appear in Proc.
  NetCod 2011, Beijing, China. Version 3 adds an appendix proving that the
  mutual information can be made exactly zero",,10.1109/ISNETCOD.2011.5979076,,cs.IT cs.CR math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the secure network coding for multicasting, there is loss of information
rate due to inclusion of random bits at the source node. We show a method to
eliminate that loss of information rate by using multiple statistically
independent messages to be kept secret from an eavesdropper. The proposed
scheme is an adaptation of Yamamoto et al.'s secure multiplex coding to the
secure network coding.
","[{'version': 'v1', 'created': 'Tue, 15 Feb 2011 09:09:46 GMT'}, {'version': 'v2', 'created': 'Tue, 17 May 2011 08:00:20 GMT'}, {'version': 'v3', 'created': 'Sun, 5 Jun 2011 13:30:54 GMT'}]",2011-11-09,"[['Matsumoto', 'Ryutaroh', ''], ['Hayashi', 'Masahito', '']]","['information theoretic security', 'network coding', 'secure multiplex coding', 'secure network coding']"
2591,1804.03603,Reuben Binns Dr,"Reuben Binns, Ulrik Lyngs, Max Van Kleek, Jun Zhao, Timothy Libert,
  Nigel Shadbolt",Third Party Tracking in the Mobile Ecosystem,"Corrected missing company info (Linkedin owned by Microsoft). Figures
  for Microsoft and Linkedin re-calculated and added to Table 1",,10.1145/3201064.3201089,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Third party tracking allows companies to identify users and track their
behaviour across multiple digital services. This paper presents an empirical
study of the prevalence of third-party trackers on 959,000 apps from the US and
UK Google Play stores. We find that most apps contain third party tracking, and
the distribution of trackers is long-tailed with several highly dominant
trackers accounting for a large portion of the coverage. The extent of tracking
also differs between categories of apps; in particular, news apps and apps
targeted at children appear to be amongst the worst in terms of the number of
third party trackers associated with them. Third party tracking is also
revealed to be a highly trans-national phenomenon, with many trackers operating
in jurisdictions outside the EU. Based on these findings, we draw out some
significant legal compliance challenges facing the tracking industry.
","[{'version': 'v1', 'created': 'Tue, 10 Apr 2018 15:53:27 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Apr 2018 09:23:34 GMT'}, {'version': 'v3', 'created': 'Thu, 18 Oct 2018 09:19:56 GMT'}]",2018-10-19,"[['Binns', 'Reuben', ''], ['Lyngs', 'Ulrik', ''], ['Van Kleek', 'Max', ''], ['Zhao', 'Jun', ''], ['Libert', 'Timothy', ''], ['Shadbolt', 'Nigel', '']]","['privacy', 'tracking', 'behavioural advertising', 'mobile', 'android', 'staticanalysis', 'data protection']"
2592,1804.06434,Jordan Dworkin,"Jordan D. Dworkin, Russell T. Shinohara, Danielle S. Bassett",The emergent integrated network structure of scientific research,,,10.1371/journal.pone.0216146,,cs.SI stat.AP,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The practice of scientific research is often thought of as individuals and
small teams striving for disciplinary advances. Yet as a whole, this endeavor
more closely resembles a complex system of natural computation, in which
information is obtained, generated, and disseminated more effectively than
would be possible by individuals acting in isolation. Currently, the structure
of this integrated and innovative landscape of scientific ideas is not well
understood. Here we use tools from network science to map the landscape of
interconnected research topics covered in the multidisciplinary journal PNAS
since 2000. We construct networks in which nodes represent topics of study and
edges give the degree to which topics occur in the same papers. The network
displays small-world architecture, with dense connectivity within scientific
clusters and sparse connectivity between clusters. Notably, clusters tend not
to align with assigned article classifications, but instead contain topics from
various disciplines. Using a temporal graph, we find that small-worldness has
increased over time, suggesting growing efficiency and integration of ideas.
Finally, we define a novel measure of interdisciplinarity, which is positively
associated with PNAS's impact factor. Broadly, this work suggests that complex
and dynamic patterns of knowledge emerge from scientific research, and that
structures reflecting intellectual integration may be beneficial for obtaining
scientific insight.
","[{'version': 'v1', 'created': 'Tue, 17 Apr 2018 18:54:56 GMT'}]",2019-06-19,"[['Dworkin', 'Jordan D.', ''], ['Shinohara', 'Russell T.', ''], ['Bassett', 'Danielle S.', '']]","['scientific research', 'knowledge network', 'graph theory', 'human computation']"
2593,1701.00399,Jerome Darmont,"J\'er\^ome Darmont (ERIC), Fadila Bentayeb (ERIC), Omar Boussa\""id
  (ERIC)",Benchmarking data warehouses,arXiv admin note: text overlap with arXiv:0705.1453,"International Journal of Business Intelligence and Data Mining,
  Inderscience, 2007, 2 (1), pp.79-104",10.1504/IJBIDM.2007.012947,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data warehouse architectural choices and optimization techniques are critical
to decision support query performance. To facilitate these choices, the
performance of the designed data warehouse must be assessed, usually with
benchmarks. These tools can either help system users comparing the performances
of different systems, or help system engineers testing the effect of various
design choices. While the Transaction Processing Performance Council's standard
benchmarks address the first point, they are not tunable enough to address the
second one and fail to model different data warehouse schemas. By contrast, our
Data Warehouse Engineering Benchmark (DWEB) allows generating various ad-hoc
synthetic data warehouses and workloads. DWEB is implemented as a Java free
software that can be interfaced with most existing relational database
management systems. The full specifications of DWEB, as well as experiments we
performed to illustrate how our benchmark may be used, are provided in this
paper.
","[{'version': 'v1', 'created': 'Mon, 2 Jan 2017 14:19:24 GMT'}]",2017-01-03,"[['Darmont', 'Jérôme', '', 'ERIC'], ['Bentayeb', 'Fadila', '', 'ERIC'], ['Boussaïd', 'Omar', '', 'ERIC']]","['Data warehouses', 'OLAP', 'Benchmarking', 'Performance evaluation', 'Data warehouse']"
2594,1603.06078,Oliver Nalbach,"Oliver Nalbach, Elena Arabadzhiyska, Dushyant Mehta, Hans-Peter
  Seidel, Tobias Ritschel",Deep Shading: Convolutional Neural Networks for Screen-Space Shading,,,10.1111/cgf.13225,,cs.GR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In computer vision, convolutional neural networks (CNNs) have recently
achieved new levels of performance for several inverse problems where RGB pixel
appearance is mapped to attributes such as positions, normals or reflectance.
In computer graphics, screen-space shading has recently increased the visual
quality in interactive image synthesis, where per-pixel attributes such as
positions, normals or reflectance of a virtual 3D scene are converted into RGB
pixel appearance, enabling effects like ambient occlusion, indirect light,
scattering, depth-of-field, motion blur, or anti-aliasing. In this paper we
consider the diagonal problem: synthesizing appearance from given per-pixel
attributes using a CNN. The resulting Deep Shading simulates various
screen-space effects at competitive quality and speed while not being
programmed by human experts but learned from example images.
","[{'version': 'v1', 'created': 'Sat, 19 Mar 2016 10:29:57 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Aug 2016 11:11:55 GMT'}]",2017-07-10,"[['Nalbach', 'Oliver', ''], ['Arabadzhiyska', 'Elena', ''], ['Mehta', 'Dushyant', ''], ['Seidel', 'Hans-Peter', ''], ['Ritschel', 'Tobias', '']]","['global illumination', 'convolutional neural networks', 'screen-space']"
2595,1908.02553,Chengqing Li,"Lei Chen, Chengqing Li, Chao Li","Security measurement of a medical communication scheme based on chaos
  and DNA coding","17 pages, 9 figures, 8 tables","Journal of Visual Communication and Image Representation, vol. 83,
  art. no. 103424, 2022",10.1016/j.jvcir.2021.103424,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To encrypt sensitive information existing in a color DICOM images, a medical
privacy protection scheme (called as MPPS) based on chaos and DNA coding was
proposed by using two coupled chaotic systems to produce cryptographic
primitives. Relying on some empirical analyses and experimental results, the
designers of MPPS claimed that it can withstand a chosen-plaintext attack and
some other classic attacking models. However, this statement is groundless. In
this paper, we investigate the essential properties of MPPS and DNA coding, and
we then propose an efficient chosen-plaintext attack to disclose its equivalent
secret-key. The attack only needs $\lceil \log_{256}(3\cdot M\cdot N)\rceil+4$
pair of chosen plain-images and the corresponding cipher-images, where $M
\times N$ and ``3"" are the size of the RGB color image and the number of color
channels, respectively. In addition, the other claimed superiorities are
questioned from the perspective of modern cryptography. Both theoretical and
experimental results are presented to support the efficiency of the proposed
attack and the other reported security faults. The proposed cryptanalysis
results will promote the proper application of DNA encoding to protect
multimedia privacy data, especially that in a DICOM image.
","[{'version': 'v1', 'created': 'Wed, 7 Aug 2019 12:18:43 GMT'}, {'version': 'v2', 'created': 'Mon, 9 Nov 2020 07:09:14 GMT'}, {'version': 'v3', 'created': 'Mon, 20 Jun 2022 04:54:32 GMT'}]",2022-06-22,"[['Chen', 'Lei', ''], ['Li', 'Chengqing', ''], ['Li', 'Chao', '']]","['cryptanalysis', 'chaotic cryptography', 'chosen-plaintext attack', 'DNA coding', 'DICOM image security', 'privacyprotection']"
2596,2209.09603,Oliver Gasser,"Said Jawad Saidi, Srdjan Matic, Oliver Gasser, Georgios Smaragdakis,
  Anja Feldmann",Deep Dive into the IoT Backend Ecosystem,,"Proceedings of the 2022 ACM Internet Measurement Conference (IMC
  '22)",10.1145/3517745.3561431,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet of Things (IoT) devices are becoming increasingly ubiquitous, e.g.,
at home, in enterprise environments, and in production lines. To support the
advanced functionalities of IoT devices, IoT vendors as well as service and
cloud companies operate IoT backends -- the focus of this paper. We propose a
methodology to identify and locate them by (a) compiling a list of domains used
exclusively by major IoT backend providers and (b) then identifying their
server IP addresses. We rely on multiple sources, including IoT backend
provider documentation, passive DNS data, and active scanning. For analyzing
IoT traffic patterns, we rely on passive network flows from a major European
ISP.
  Our analysis focuses on the top IoT backends and unveils diverse operational
strategies -- from operating their own infrastructure to utilizing the public
cloud. We find that the majority of the top IoT backend providers are located
in multiple locations and countries. Still, a handful are located only in one
country, which could raise regulatory scrutiny as the client IoT devices are
located in other regions. Indeed, our analysis shows that up to 35% of IoT
traffic is exchanged with IoT backend servers located in other continents. We
also find that at least six of the top IoT backends rely on other IoT backend
providers. We also evaluate if cascading effects among the IoT backend
providers are possible in the event of an outage, a misconfiguration, or an
attack.
","[{'version': 'v1', 'created': 'Tue, 20 Sep 2022 10:31:47 GMT'}]",2022-09-21,"[['Saidi', 'Said Jawad', ''], ['Matic', 'Srdjan', ''], ['Gasser', 'Oliver', ''], ['Smaragdakis', 'Georgios', ''], ['Feldmann', 'Anja', '']]","['Internet of Things (IoT)', 'IoT operation', 'IoT security and privacy', 'Internet Measurement']"
2597,1302.1400,Abdesslem Layeb,"Abdesslem Layeb, Amira Boudra, Wissem Korichi, Salim Chikhi","A new greedy randomized adaptive search procedure for multiobjective RNA
  structural alignment",,"International Journal in Foundations of Computer Science &
  Technology (IJFCST), Vol. 3, No.1,pp. 9-24, January 2013",10.5121/ijfcst.2013.3102,,cs.DS cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  RNA secondary structures prediction is one of the main issues in
bioinformatics. It seeks to elucidate structural conserved regions within a set
of RNA sequences. Unfortunately, finding an accurate conserved structure is a
very hard task to do. Within the present study, the prediction problem is
considered as a multiobjective optimization process in which the structural
conservation and the sensitivity of the multiple alignment are optimized. The
proposed method called GRASPMORSA is based on an aggregate function and GRASP
procedure. The initial solutions are obtained by using a random progressive
local/ global algorithm, and then they are refined by an iterative realignment.
Experiments within a large scale of data have shown the efficacy and
effectiveness of the proposed method and its capacity to reach good quality
solutions.
","[{'version': 'v1', 'created': 'Wed, 6 Feb 2013 15:13:03 GMT'}]",2013-02-07,"[['Layeb', 'Abdesslem', ''], ['Boudra', 'Amira', ''], ['Korichi', 'Wissem', ''], ['Chikhi', 'Salim', '']]","['Bioinformatics', 'multi-objective optimization', 'multiple sequence alignment', 'structural alignment', 'prediction', 'RNAs', 'dominance aggregation method', 'GRASP']"
2598,1405.7944,Shruti Jadon,"Shruti Jadon, Anubhav Singhal, Suma Dawn","Military Simulator - A Case Study of Behaviour Tree and Unity based
  architecture","4 pages, 4 figures. International Journal of Computer Applications
  @2014",,10.5120/15350-3691,Volume 88 - Number 5,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we show how the combination of Behaviour Tree and Utility Based
AI architecture can be used to design more realistic bots for Military
Simulators. In this work, we have designed a mathematical model of a simulator
system which in turn helps in analyzing the results and finding out the various
spaces on which our favorable situation might exist, this is done
geometrically. In the mathematical model, we have explained the matrix
formation and its significance followed up in dynamic programming approach we
explained the possible graph formation which will led improvisation of AI,
latter we explained the possible geometrical structure of the matrix operations
and its impact on a particular decision, we also explained the conditions under
which it tend to fail along with a possible solution in future works.
","[{'version': 'v1', 'created': 'Fri, 30 May 2014 18:22:59 GMT'}]",2019-11-26,"[['Jadon', 'Shruti', ''], ['Singhal', 'Anubhav', ''], ['Dawn', 'Suma', '']]","['Military Simulator', 'Behaviour Tree', 'Ranking Matrix']"
2599,1608.01101,Mayank Singh,"Mayank Singh, Tanmoy Chakraborty, Animesh Mukherjee, Pawan Goyal","Is this conference a top-tier? ConfAssist: An assistive conflict
  resolution framework for conference categorization",,,10.1016/j.joi.2016.08.001,,cs.SI cs.DL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Classifying publication venues into top-tier or non top-tier is quite
subjective and can be debatable at times. In this paper, we propose ConfAssist,
a novel assisting framework for conference categorization that aims to address
the limitations in the existing systems and portals for venue classification.
We start with the hypothesis that top-tier conferences are much more stable
than other conferences and the inherent dynamics of these groups differs to a
very large extent. We identify various features related to the stability of
conferences that might help us separate a top-tier conference from the rest of
the lot. While there are many clear cases where expert agreement can be almost
immediately achieved as to whether a conference is a top-tier or not, there are
equally many cases that can result in a conflict even among the experts.
ConfAssist tries to serve as an aid in such cases by increasing the confidence
of the experts in their decision. An analysis of 110 conferences from 22
sub-fields of computer science clearly favors our hypothesis as the top-tier
conferences are found to exhibit much less fluctuations in the stability
related features than the non top-tier ones. We evaluate our hypothesis using
systems based on conference categorization. For the evaluation, we conducted
human judgment survey with 28 domain experts. The results are impressive with
85.18% classification accuracy. We also compare the dynamics of the newly
started conferences with the older conferences to identify the initial signals
of popularity. The system is applicable to any conference with atleast 5 years
of publication history.
","[{'version': 'v1', 'created': 'Wed, 3 Aug 2016 08:00:39 GMT'}]",2016-09-22,"[['Singh', 'Mayank', ''], ['Chakraborty', 'Tanmoy', ''], ['Mukherjee', 'Animesh', ''], ['Goyal', 'Pawan', '']]","['Venue classification', 'Feature analysis', 'Conflict resolution', 'Entropy']"
2600,1108.1361,E Martin,E Martin and R Bajcsy,"Variability of location management costs with different mobilities and
  timer periods to update locations","ijcnc 2011, 3, 4",,10.5121/ijcnc,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, we examine the Location Management costs in mobile
communication networks utilizing the timer-based method. From the study of the
probabilities that a mobile terminal changes a number of Location Areas between
two calls, we identify a threshold value of 0.7 for the Call-to-Mobility Ratio
(CMR) below which the application of the timer-based method is most
appropriate. We characterize the valley appearing in the evolution of the costs
with the timeout period, showing that the time interval required to reach 90%
of the stabilized costs grows with the mobility index, the paging cost per
Location Area and the movement dimension, in opposition to the behavior
presented by the time interval that achieves the minimum of the costs. The
results obtained for CMRs below the suggested 0.7 threshold show that the
valley appearing in the costs tends to disappear for CMRs within [0.001, 0.7]
in onedimensional movements and within [0.2, 0.7] in two-dimensional ones, and
when the normalized paging cost per Location Area is below 0.3.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2011 16:13:49 GMT'}]",2011-08-08,"[['Martin', 'E', ''], ['Bajcsy', 'R', '']]","['Location Management', 'Signaling Costs', 'Timer-Based Algorithm', 'Wireless Networks']"
2601,1408.6210,Quentin Merigot,"Louis Cuel (LAMA, LJK), Jacques-Olivier Lachaud (LAMA), Quentin
  M\'erigot (MGMI), Boris Thibert (MGMI)","Robust Geometry Estimation using the Generalized Voronoi Covariance
  Measure",,"SIAM Journal on Imaging Sciences, Society for Industrial and
  Applied Mathematics, 2015, pp.1293-1314",10.1137/140977552,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Voronoi Covariance Measure of a compact set K of R^d is a tensor-valued
measure that encodes geometric information on K and which is known to be
resilient to Hausdorff noise but sensitive to outliers. In this article, we
generalize this notion to any distance-like function delta and define the
delta-VCM. We show that the delta-VCM is resilient to Hausdorff noise and to
outliers, thus providing a tool to estimate robustly normals from a point cloud
approximation. We present experiments showing the robustness of our approach
for normal and curvature estimation and sharp feature detection.
","[{'version': 'v1', 'created': 'Tue, 26 Aug 2014 19:07:10 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Nov 2015 12:49:12 GMT'}]",2015-11-05,"[['Cuel', 'Louis', '', 'LAMA, LJK'], ['Lachaud', 'Jacques-Olivier', '', 'LAMA'], ['Mérigot', 'Quentin', '', 'MGMI'], ['Thibert', 'Boris', '', 'MGMI']]","['Geometric Inference', 'Normal estimation', 'Curvature estimation', 'Distance to ameasure', 'Voronoi Covariance Measure', 'Power Diagram']"
2602,1612.03590,Qiulei Dong,Qiulei Dong and Zhanyi Hu,"Statistics of Visual Responses to Object Stimuli from Primate AIT
  Neurons to DNN Neurons",,"Neural Computation, 30, 447-476 (2018)",10.1162/NECO_a_01039,,cs.CV q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cadieu et al. (Cadieu,2014) reported that deep neural networks(DNNs) could
rival the representation of primate inferotemporal cortex for object
recognition. Lehky et al. (Lehky,2011) provided a statistical analysis on
neural responses to object stimuli in primate AIT cortex. They found the
intrinsic dimensionality of object representations in AIT cortex is around 100
(Lehky,2014). Considering the outstanding performance of DNNs in object
recognition, it is worthwhile investigating whether the responses of DNN
neurons have similar response statistics to those of AIT neurons. Following
Lehky et al.'s works, we analyze the response statistics to image stimuli and
the intrinsic dimensionality of object representations of DNN neurons. Our
findings show in terms of kurtosis and Pareto tail index, the response
statistics on single-neuron selectivity and population sparseness of DNN
neurons are fundamentally different from those of IT neurons except some
special cases. By increasing the number of neurons and stimuli, the conclusions
could alter substantially. In addition, with the ascendancy of the
convolutional layers of DNNs, the single-neuron selectivity and population
sparseness of DNN neurons increase, indicating the last convolutional layer is
to learn features for object representations, while the following
fully-connected layers are to learn categorization features. It is also found
that a sufficiently large number of stimuli and neurons are necessary for
obtaining a stable dimensionality. To our knowledge, this is the first work to
analyze the response statistics of DNN neurons comparing with AIT neurons, and
our results provide not only some insights into the discrepancy of DNN neurons
with respect to IT neurons in object representation, but also shed some light
on possible outcomes of IT neurons when the number of recorded neurons and
stimuli is beyond the level in (Lehky,2011,2014).
","[{'version': 'v1', 'created': 'Mon, 12 Dec 2016 10:13:15 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Jan 2017 02:23:42 GMT'}]",2019-06-07,"[['Dong', 'Qiulei', ''], ['Hu', 'Zhanyi', '']]","['Inferotemporal Cortex', 'Single-Neuron Selectivity', 'Population Sparseness', 'Intrinsic Di']"
2603,1006.1178,Secretary Aircc Journal,"Chao Chen and Carlos Pomalaza-Raez (Indiana University - Purdue
  University, USA)","Implementing and Evaluating a Wireless Body Sensor System for Automated
  Physiological Data Acquisition at Home",15 pages,"International Journal of Computer Science and Information
  Technology 2.3 (2010) 24-38",10.5121/ijcsit.2010.2303,,cs.OH,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Advances in embedded devices and wireless sensor networks have resulted in
new and inexpensive health care solutions. This paper describes the
implementation and the evaluation of a wireless body sensor system that
monitors human physiological data at home. Specifically, a waist-mounted
triaxial accelerometer unit is used to record human movements. Sampled data are
transmitted using an IEEE 802.15.4 wireless transceiver to a data logger unit.
The wearable sensor unit is light, small, and consumes low energy, which allows
for inexpensive and unobtrusive monitoring during normal daily activities at
home. The acceleration measurement tests show that it is possible to classify
different human motion through the acceleration reading. The 802.15.4 wireless
signal quality is also tested in typical home scenarios. Measurement results
show that even with interference from nearby IEEE 802.11 signals and microwave
ovens, the data delivery performance is satisfactory and can be improved by
selecting an appropriate channel. Moreover, we found that the wireless signal
can be attenuated by housing materials, home appliances, and even plants.
Therefore, the deployment of wireless body sensor systems at home needs to take
all these factors into consideration.
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2010 06:27:05 GMT'}]",2010-07-15,"[['Chen', 'Chao', '', 'Indiana University - Purdue\n  University, USA'], ['Pomalaza-Raez', 'Carlos', '', 'Indiana University - Purdue\n  University, USA']]","['Physiologic Data Acquisition', 'Wireless Body Sensor System', 'Smart Home Health Care']"
2604,2004.03973,Stefan Wagner,Kai Mindermann and Stefan Wagner,"Fluid Intelligence Doesn't Matter! Effects of Code Examples on the
  Usability of Crypto APIs",2 pages,"In: 42nd International Conference on Software Engineering
  Companion (ICSE '20 Companion). ACM, 2020",10.1145/3377812.3390892,,cs.SE cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Programmers frequently look for the code of previously solved
problems that they can adapt for their own problem. Despite existing example
code on the web, on sites like Stack Overflow, cryptographic Application
Programming Interfaces (APIs) are co monly misused. There is little known about
what makes examples helpful for developers in using crypto APIs. Analogical
problem solving is a psychological theory that investigates how people use
known solutions to solve new problems. There is evidence that the capacity to
reason and solve novel problems a.k.a Fluid Intelligence (Gf ) and structurally
and procedurally similar solutions support problem solving. Aim: Our goal is to
understand whether similarity and Gf also have an effect in the context of
using cryptographic APIs with the help of code examples. Method: We conducted a
controlled experiment with 76 student participants developing with or without
procedurally similar examples, one of two Java crypto libraries and measured
the Gf of the participants as well as the effect on usability (effectiveness,
efficiency, satisfaction) and security bugs. Results: We observed a strong
effect of code examples with a high procedural similarity on all dependent
variables. Fluid intelligence Gf had no effect. It also made no difference
which library the participants used. Conclusions: Example code must be more
highly similar to a concrete solution, not very abstract and generic to have a
positive effect in a development task.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2020 12:37:00 GMT'}]",2020-04-09,"[['Mindermann', 'Kai', ''], ['Wagner', 'Stefan', '']]","['Example Code', 'Intelligence', 'security', 'usability']"
2605,1902.07465,Mehran Hosseini,"Mehran Hosseini, Jo\""el Ouaknine, James Worrell",Termination of Linear Loops over the Integers,Published in ICALP 2019,,10.4230/LIPIcs.ICALP.2019.118,,cs.FL cs.CC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We consider the problem of deciding termination of single-path while loops
with integer variables, affine updates, and affine guard conditions. The
question is whether such a loop terminates on all integer initial values. This
problem is known to be decidable for the subclass of loops whose update
matrices are diagonalisable, but the general case has remained open since being
conjectured decidable by Tiwari in 2004. In this paper we show decidability of
determining termination for arbitrary update matrices, confirming Tiwari's
conjecture. For the class of loops considered in this paper, the question of
deciding termination on a specific initial value is a longstanding open problem
in number theory. The key to our decision procedure is in showing how to
circumvent the difficulties inherent in deciding termination on a fixed initial
value.
","[{'version': 'v1', 'created': 'Wed, 20 Feb 2019 09:32:01 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Apr 2019 21:35:50 GMT'}, {'version': 'v3', 'created': 'Sat, 20 Nov 2021 18:26:48 GMT'}]",2021-11-23,"[['Hosseini', 'Mehran', ''], ['Ouaknine', 'Joël', ''], ['Worrell', 'James', '']]","['Program Verification', 'Loop Termination', 'Integer Affine Programs', 'IntegerLinear Programs']"
2606,1801.05568,Parth Shah,"Parth Shah, Vishvajit Bakarola, Supriya Pati",Image Captioning using Deep Neural Architectures,"Pre-print version of paper accepted at 2017 International Conference
  on Innovations in information Embedded and Communication Systems (ICIIECS)",,10.1109/ICIIECS.2017.8276124,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatically creating the description of an image using any natural
languages sentence like English is a very challenging task. It requires
expertise of both image processing as well as natural language processing. This
paper discuss about different available models for image captioning task. We
have also discussed about how the advancement in the task of object recognition
and machine translation has greatly improved the performance of image
captioning model in recent years. In addition to that we have discussed how
this model can be implemented. In the end, we have also evaluated the
performance of model using standard evaluation matrices.
","[{'version': 'v1', 'created': 'Wed, 17 Jan 2018 06:24:44 GMT'}]",2018-10-03,"[['Shah', 'Parth', ''], ['Bakarola', 'Vishvajit', ''], ['Pati', 'Supriya', '']]","['Deep Learning', 'Deep Neural Network', 'Image Captioning', 'ObjectRecognition', 'Machine Translation', 'Natural Language Processing', 'Natural Language Generation']"
2607,1902.07830,Di Feng,"Di Feng, Christian Haase-Sch\""utz, Lars Rosenbaum, Heinz Hertlein,
  Claudius Glaeser, Fabian Timm, Werner Wiesbeck, Klaus Dietmayer","Deep Multi-modal Object Detection and Semantic Segmentation for
  Autonomous Driving: Datasets, Methods, and Challenges","Update copyright; Interactive platform online:
  https://boschresearch.github.io/multimodalperception/",,10.1109/TITS.2020.2972974,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advancements in perception for autonomous driving are driven by deep
learning. In order to achieve robust and accurate scene understanding,
autonomous vehicles are usually equipped with different sensors (e.g. cameras,
LiDARs, Radars), and multiple sensing modalities can be fused to exploit their
complementary properties. In this context, many methods have been proposed for
deep multi-modal perception problems. However, there is no general guideline
for network architecture design, and questions of ""what to fuse"", ""when to
fuse"", and ""how to fuse"" remain open. This review paper attempts to
systematically summarize methodologies and discuss challenges for deep
multi-modal object detection and semantic segmentation in autonomous driving.
To this end, we first provide an overview of on-board sensors on test vehicles,
open datasets, and background information for object detection and semantic
segmentation in autonomous driving research. We then summarize the fusion
methodologies and discuss challenges and open questions. In the appendix, we
provide tables that summarize topics and methods. We also provide an
interactive online platform to navigate each reference:
https://boschresearch.github.io/multimodalperception/.
","[{'version': 'v1', 'created': 'Thu, 21 Feb 2019 01:11:51 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Apr 2019 09:22:49 GMT'}, {'version': 'v3', 'created': 'Sat, 16 Nov 2019 07:46:43 GMT'}, {'version': 'v4', 'created': 'Sat, 8 Feb 2020 11:15:55 GMT'}]",2020-07-20,"[['Feng', 'Di', ''], ['Haase-Schütz', 'Christian', ''], ['Rosenbaum', 'Lars', ''], ['Hertlein', 'Heinz', ''], ['Glaeser', 'Claudius', ''], ['Timm', 'Fabian', ''], ['Wiesbeck', 'Werner', ''], ['Dietmayer', 'Klaus', '']]","['multi-modality', 'object detection', 'semantic segmentation', 'deep learning', 'autonomous driving']"
2608,1912.01848,Vincent Neiger,"Vincent Neiger, \'Eric Schost",Computing syzygies in finite dimension using fast linear algebra,"34 pages, 7 algorithms, Journal of Complexity",,10.1016/j.jco.2020.101502,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the computation of syzygies of multivariate polynomials in a
finite-dimensional setting: for a $\mathbb{K}[X_1,\dots,X_r]$-module
$\mathcal{M}$ of finite dimension $D$ as a $\mathbb{K}$-vector space, and given
elements $f_1,\dots,f_m$ in $\mathcal{M}$, the problem is to compute syzygies
between the $f_i$'s, that is, polynomials $(p_1,\dots,p_m)$ in
$\mathbb{K}[X_1,\dots,X_r]^m$ such that $p_1 f_1 + \dots + p_m f_m = 0$ in
$\mathcal{M}$. Assuming that the multiplication matrices of the $r$ variables
with respect to some basis of $\mathcal{M}$ are known, we give an algorithm
which computes the reduced Gr\""obner basis of the module of these syzygies, for
any monomial order, using $O(m D^{\omega-1} + r D^\omega \log(D))$ operations
in the base field $\mathbb{K}$, where $\omega$ is the exponent of matrix
multiplication. Furthermore, assuming that $\mathcal{M}$ is itself given as
$\mathcal{M} = \mathbb{K}[X_1,\dots,X_r]^n/\mathcal{N}$, under some assumptions
on $\mathcal{N}$ we show that these multiplication matrices can be computed
from a Gr\""obner basis of $\mathcal{N}$ within the same complexity bound. In
particular, taking $n=1$, $m=1$ and $f_1=1$ in $\mathcal{M}$, this yields a
change of monomial order algorithm along the lines of the FGLM algorithm with a
complexity bound which is sub-cubic in $D$.
","[{'version': 'v1', 'created': 'Wed, 4 Dec 2019 08:36:40 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Jun 2020 10:08:49 GMT'}]",2020-06-22,"[['Neiger', 'Vincent', ''], ['Schost', 'Éric', '']]","['Gr¨obner basis', 'syzygies', 'complexity', 'fast linear algebra']"
2609,1610.03461,Michael Ruderman,Michael Ruderman,On break-away forces in actuated motion systems with nonlinear friction,"4 pages, 5 figures",,10.1016/j.mechatronics.2017.03.007,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The phenomenon of so-called break-away forces, as maximal actuation forces at
which a sticking system begins to slide and thus passes over to a steady
(macro) motion, is well known from engineering practice but still less
understood in its cause-effect relationship. This note analyzes the break-away
behavior of systems with nonlinear friction, which is analytically
well-described by combining the Coulomb friction law with rate-independent
presliding transitions and, when necessary, Stribeck effect of the
velocity-weakening steady-state curve. The break-away conditions are harmonized
with analytic form of the system description and shown to be in accord with a
relationship between the varying break-away force and actuation force rate --
well known from the experiments reported in several independently published
works.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2016 18:47:21 GMT'}]",2017-04-13,"[['Ruderman', 'Michael', '']]","['Friction', 'break-away force', 'nonlinearity', 'presliding', 'modeling', 'stiction force', 'hysteresis']"
2610,1602.08425,Florian Bernard,"Florian Bernard, Luis Salamanca, Johan Thunberg, Alexander Tack,
  Dennis Jentsch, Hans Lamecker, Stefan Zachow, Frank Hertel, Jorge Goncalves,
  Peter Gemmar",Shape-aware Surface Reconstruction from Sparse 3D Point-Clouds,,,10.1016/j.media.2017.02.005,,cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The reconstruction of an object's shape or surface from a set of 3D points
plays an important role in medical image analysis, e.g. in anatomy
reconstruction from tomographic measurements or in the process of aligning
intra-operative navigation and preoperative planning data. In such scenarios,
one usually has to deal with sparse data, which significantly aggravates the
problem of reconstruction. However, medical applications often provide
contextual information about the 3D point data that allow to incorporate prior
knowledge about the shape that is to be reconstructed. To this end, we propose
the use of a statistical shape model (SSM) as a prior for surface
reconstruction. The SSM is represented by a point distribution model (PDM),
which is associated with a surface mesh. Using the shape distribution that is
modelled by the PDM, we formulate the problem of surface reconstruction from a
probabilistic perspective based on a Gaussian Mixture Model (GMM). In order to
do so, the given points are interpreted as samples of the GMM. By using mixture
components with anisotropic covariances that are ""oriented"" according to the
surface normals at the PDM points, a surface-based fitting is accomplished.
Estimating the parameters of the GMM in a maximum a posteriori manner yields
the reconstruction of the surface from the given data points. We compare our
method to the extensively used Iterative Closest Points method on several
different anatomical datasets/SSMs (brain, femur, tibia, hip, liver) and
demonstrate superior accuracy and robustness on sparse data.
","[{'version': 'v1', 'created': 'Fri, 26 Feb 2016 18:30:07 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Feb 2017 11:45:36 GMT'}]",2017-02-16,"[['Bernard', 'Florian', ''], ['Salamanca', 'Luis', ''], ['Thunberg', 'Johan', ''], ['Tack', 'Alexander', ''], ['Jentsch', 'Dennis', ''], ['Lamecker', 'Hans', ''], ['Zachow', 'Stefan', ''], ['Hertel', 'Frank', ''], ['Goncalves', 'Jorge', ''], ['Gemmar', 'Peter', '']]","['Sparse shape reconstruction', 'statistical shape model', 'point distribution model', 'Gaussian mixture model', 'expected conditional maximisation']"
2611,1903.03405,Ian McQuillan,"Mark Daley, Mark Eramian, Christopher Power, Ian McQuillan","From Helmut J\""urgensen's Former Students: The Game of Informatics
  Research",,"Journal of Automata, Languages and Combinatorics, 23, 127-141,
  2018",10.25596/jalc-2018-127,,cs.GL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Personal reflections are given on being students of Helmut J\""urgensen. Then,
we attempt to address his hypothesis that informatics follows trend-like
behaviours through the use of a content analysis of university job
advertisements, and then via simulation techniques from the area of
quantitative economics.
","[{'version': 'v1', 'created': 'Thu, 7 Mar 2019 18:53:52 GMT'}]",2019-03-11,"[['Daley', 'Mark', ''], ['Eramian', 'Mark', ''], ['Power', 'Christopher', ''], ['McQuillan', 'Ian', '']]","['informatics', 'trends', 'hiring practices', 'simulation']"
2612,1911.13207,Claudia Savina Bianchini,"Claudia Bianchini (FORELLIS), Fabrizio Borgia, Maria de Marsico",A concrete example of inclusive design: deaf-oriented accessibility,SCOPUS - ISI?,"The Wiley Handbook of Human Computer Interaction, 2 (chapter 33),
  Wiley (Blackwell), pp.731-756, 2018, 978-1-118-97613-5",10.1002/9781118976005.ch33,pubblicazione #17,cs.HC cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the continuing challenges of Human Computer Interaction research is
the full inclusion of people with special needs into the digital world. In
particular, this crucial category includes people that experiences some kind of
limitation in exploiting traditional information communication channels. One
immediately thinks about blind people, and several researches aim at addressing
their needs. On the contrary, limitations suffered by deaf people are often
underestimated. This often the result of a kind of ignorance or
misunderstanding of the real nature of their communication difficulties. This
chapter aims at both increasing the awareness of deaf problems in the digital
world, and at proposing the project of a comprehensive solution for their
better inclusion. As for the former goal, we will provide a bird's-eye
presentation of history and evolution of understanding of deafness issues, and
of strategies to address them. As for the latter, we will present the design,
implementation and evaluation of the first nucleus of a comprehensive digital
framework to facilitate the access of deaf people into the digital world.
","[{'version': 'v1', 'created': 'Wed, 27 Nov 2019 15:01:57 GMT'}]",2019-12-02,"[['Bianchini', 'Claudia', '', 'FORELLIS'], ['Borgia', 'Fabrizio', ''], ['de Marsico', 'Maria', '']]","['Deafness', 'Sign Languages', 'SignWriting', 'inclusion', 'users with special needs']"
2613,2110.06829,Leo Ardon,"Leo Ardon, Nelson Vadori, Thomas Spooner, Mengda Xu, Jared Vann,
  Sumitra Ganesh",Towards a fully RL-based Market Simulator,,"ACM International Conference on AI in Finance, 2021",10.1145/3490354.3494372,,cs.MA cs.AI cs.LG q-fin.TR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new financial framework where two families of RL-based agents
representing the Liquidity Providers and Liquidity Takers learn simultaneously
to satisfy their objective. Thanks to a parametrized reward formulation and the
use of Deep RL, each group learns a shared policy able to generalize and
interpolate over a wide range of behaviors. This is a step towards a fully
RL-based market simulator replicating complex market conditions particularly
suited to study the dynamics of the financial market under various scenarios.
","[{'version': 'v1', 'created': 'Wed, 13 Oct 2021 16:14:19 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Nov 2021 12:44:40 GMT'}]",2021-11-09,"[['Ardon', 'Leo', ''], ['Vadori', 'Nelson', ''], ['Spooner', 'Thomas', ''], ['Xu', 'Mengda', ''], ['Vann', 'Jared', ''], ['Ganesh', 'Sumitra', '']]","['multi-agent', 'reinforcement learning', 'market making']"
2614,1602.08045,Zhenhao Ge,"Zhenhao Ge, Sudhendu R. Sharma, Mark J. T. Smith",PCA/LDA Approach for Text-Independent Speaker Recognition,"Society of Photo-Optical Instrumentation Engineers (SPIE) Conference
  Series",,10.1117/12.919235,,cs.SD cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Various algorithms for text-independent speaker recognition have been
developed through the decades, aiming to improve both accuracy and efficiency.
This paper presents a novel PCA/LDA-based approach that is faster than
traditional statistical model-based methods and achieves competitive results.
First, the performance based on only PCA and only LDA is measured; then a mixed
model, taking advantages of both methods, is introduced. A subset of the TIMIT
corpus composed of 200 male speakers, is used for enrollment, validation and
testing. The best results achieve 100%; 96% and 95% classification rate at
population level 50; 100 and 200, using 39-dimensional MFCC features with delta
and double delta. These results are based on 12-second text-independent speech
for training and 4-second data for test. These are comparable to the
conventional MFCC-GMM methods, but require significantly less time to train and
operate.
","[{'version': 'v1', 'created': 'Thu, 25 Feb 2016 19:18:06 GMT'}]",2016-10-04,"[['Ge', 'Zhenhao', ''], ['Sharma', 'Sudhendu R.', ''], ['Smith', 'Mark J. T.', '']]","['Speaker Recognition', 'PCA', 'LDA', 'GMM', 'MFCCs']"
2615,1407.7405,Qi Chen,Qi Chen and Raymond W. Yeung,Partition-Symmetrical Entropy Functions,This paper is published in IEEE Transactions on Information Theory,"Issue Date: OCTOBER.2016 Volume: 62 Issue: 10 On page(s): 1-18
  Print ISSN: 0018-9448 Online ISSN: 1557-9654",10.1109/TIT.2016.2600580,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $\cal{N}=\{1,\cdots,n\}$. The entropy function $\bf h$ of a set of $n$
discrete random variables $\{X_i:i\in\cal N\}$ is a $2^n$-dimensional vector
whose entries are ${\bf{h}}({\cal{A}})\triangleq
H(X_{\cal{A}}),\cal{A}\subset{\cal N} $, the (joint) entropies of the subsets
of the set of $n$ random variables with $H(X_\emptyset)=0$ by convention. The
set of all entropy functions for $n$ discrete random variables, denoted by
$\Gamma^*_n$, is called the entropy function region for $n$. Characterization
of $\Gamma^*_n$ and its closure $\overline{\Gamma^*_n}$ are well-known open
problems in information theory. They are important not only because they play
key roles in information theory problems but also they are related to other
subjects in mathematics and physics.
  In this paper, we consider \emph{partition-symmetrical entropy functions}.
Let $p=\{\cal{N}_1,\cdots, \cal{N}_t\}$ be a $t$-partition of $\cal N$. An
entropy function $\bf h$ is called $p$-symmetrical if for all ${\cal A},{\cal
B} \subset {\cal N}$, $\bf{h}({\cal A}) = \bf{h}({\cal B})$ whenever $|{\cal A}
\cap {\cal N}_i| = |{\cal B} \cap {\cal N}_i|$, $i = 1, \cdots,t$. The set of
all the $p$-symmetrical entropy functions, denoted by $\Psi^*_p$, is called
$p$-symmetrical entropy function region. We prove that $\overline{\Psi^*_p}$,
the closure of $\Psi^*_p$, is completely characterized by Shannon-type
information inequalities if and only if $p$ is the $1$-partition or a
$2$-partition with one of its blocks being a singleton.
  The characterization of the partition-symmetrical entropy functions can be
useful for solving some information theory and related problems where symmetry
exists in the structure of the problems.
  Keywords: entropy, entropy function, information inequality, polymatroid.
","[{'version': 'v1', 'created': 'Mon, 28 Jul 2014 13:16:08 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Sep 2016 06:06:47 GMT'}]",2016-09-29,"[['Chen', 'Qi', ''], ['Yeung', 'Raymond W.', '']]","['entropy', 'entropy function', 'information inequality', 'polymatroid']"
2616,1804.04540,John Mashford PhD,"John Mashford, Brad Lane, Vic Ciesielski, Felix Lipkin",A Neural Markovian Multiresolution Image Labeling Algorithm,"replacement provides formal evaluation of MCV algorithm in published
  form","Intelligent Computing. SAI 2020. Advances in Intelligent Systems
  and Computing, vol 1229. Springer, Cham",10.1007/978-3-030-52246-9_27,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the results of formally evaluating the MCV (Markov
concurrent vision) image labeling algorithm which is a (semi-) hierarchical
algorithm commencing with a partition made up of single pixel regions and
merging regions or subsets of regions using a Markov random field (MRF) image
model. It is an example of a general approach to computer vision called
concurrent vision in which the operations of image segmentation and image
classification are carried out concurrently. While many image labeling
algorithms output a single partition, or segmentation, the MCV algorithm
outputs a sequence of partitions and this more elaborate structure may provide
information that is valuable for higher level vision systems. With certain
types of MRF the component of the system for image evaluation can be
implemented as a hardwired feed forward neural network. While being applicable
to images (i.e. 2D signals), the algorithm is equally applicable to 1D signals
(e.g. speech) or 3D signals (e.g. video sequences) (though its performance in
such domains remains to be tested). The algorithm is assessed using subjective
and objective criteria with very good results.
","[{'version': 'v1', 'created': 'Tue, 20 Mar 2018 06:32:35 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Aug 2020 07:53:03 GMT'}]",2020-08-18,"[['Mashford', 'John', ''], ['Lane', 'Brad', ''], ['Ciesielski', 'Vic', ''], ['Lipkin', 'Felix', '']]","['hierarchical', 'Markov random fields', 'region growing', 'partitioning', 'segmentation', 'multiresolution', 'autoregressive Gaussian stochastic process']"
2617,1802.07802,Mohammad Malekzadeh,"Mohammad Malekzadeh, Richard G. Clegg, Andrea Cavallaro and Hamed
  Haddadi",Protecting Sensory Data against Sensitive Inferences,6 pages,,10.1145/3195258.3195260,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is growing concern about how personal data are used when users grant
applications direct access to the sensors of their mobile devices. In fact,
high resolution temporal data generated by motion sensors reflect directly the
activities of a user and indirectly physical and demographic attributes. In
this paper, we propose a feature learning architecture for mobile devices that
provides flexible and negotiable privacy-preserving sensor data transmission by
appropriately transforming raw sensor data. The objective is to move from the
current binary setting of granting or not permission to an application, toward
a model that allows users to grant each application permission over a limited
range of inferences according to the provided services. The internal structure
of each component of the proposed architecture can be flexibly changed and the
trade-off between privacy and utility can be negotiated between the constraints
of the user and the underlying application. We validated the proposed
architecture in an activity recognition application using two real-world
datasets, with the objective of recognizing an activity without disclosing
gender as an example of private information. Results show that the proposed
framework maintains the usefulness of the transformed data for activity
recognition, with an average loss of only around three percentage points, while
reducing the possibility of gender classification to around 50\%, the target
random guess, from more than 90\% when using raw sensor data. We also present
and distribute MotionSense, a new dataset for activity and attribute
recognition collected from motion sensors.
","[{'version': 'v1', 'created': 'Wed, 21 Feb 2018 20:57:08 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Mar 2018 23:56:39 GMT'}, {'version': 'v3', 'created': 'Thu, 12 Apr 2018 10:22:49 GMT'}, {'version': 'v4', 'created': 'Wed, 20 Jun 2018 12:40:12 GMT'}]",2018-06-21,"[['Malekzadeh', 'Mohammad', ''], ['Clegg', 'Richard G.', ''], ['Cavallaro', 'Andrea', ''], ['Haddadi', 'Hamed', '']]","['Privacy', 'Sensor Data', 'Activity Recognition', 'Machine Learning', 'TimeSeries Analysis']"
2618,1505.06032,Dragan Matic,"Dragan Matic, Jozef Kratica, Vladimir Filipovic",Variable Neighborhood Search for solving Bandwidth Coloring Problem,,"Computer Science and Information Systems 2017 Volume 14, Issue 2,
  Pages: 309-327",10.2298/CSIS160320012M,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a variable neighborhood search (VNS) algorithm for
solving bandwidth coloring problem (BCP) and bandwidth multicoloring problem
(BMCP). BCP and BMCP are generalizations of the well known vertex coloring
problem and they are of a great interest from both theoretical and practical
points of view. Presented VNS combines a shaking procedure which perturbs the
colors for an increasing number of vertices and a specific variable
neighborhood descent (VND) procedure, based on the specially designed
arrangement of the vertices which are the subject of re-coloring. By this
approach, local search is split in a series of disjoint procedures, enabling
better choice of the vertices which are addressed to re-color. The experiments
show that proposed method is highly competitive with the state-of-the-art
algorithms and improves 2 out of 33 previous best known solutions for BMCP.
","[{'version': 'v1', 'created': 'Fri, 22 May 2015 11:24:03 GMT'}]",2019-02-20,"[['Matic', 'Dragan', ''], ['Kratica', 'Jozef', ''], ['Filipovic', 'Vladimir', '']]","['Bandwidth Coloring', 'Bandwidth MultiColoring', 'FrequencyAssignment', 'Variable Neighborhood Search', 'Variable Neighborhood Descent']"
2619,1609.03093,Maciej Wielgosz,Maciej Wielgosz and Marcin Pietro\'n,"Using Spatial Pooler of Hierarchical Temporal Memory to classify noisy
  videos with predefined complexity",submitted to Neurocomputing; paper similar to arXiv:1608.01966,"Neurocomputing 240 (2017), 84-97",10.1016/j.neucom.2017.02.046,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper examines the performance of a Spatial Pooler (SP) of a
Hierarchical Temporal Memory (HTM) in the task of noisy object recognition. To
address this challenge, a dedicated custom-designed system based on the SP,
histogram calculation module and SVM classifier was implemented. In addition to
implementing their own version of HTM, the authors also designed a profiler
which is capable of tracing all of the key parameters of the system. This was
necessary, since an analysis and monitoring of the system performance turned
out to be extremely difficult using conventional testing and debugging tools.
The system was initially trained on artificially prepared videos without noise
and then tested with a set of noisy video streams. This approach was intended
to mimic a real life scenario where an agent or a system trained to deal with
ideal objects faces a task of classifying distorted and noisy ones in its
regular working conditions. The authors conducted a series of experiments for
various macro parameters of HTM SP, as well as for different levels of video
reduction ratios. The experiments allowed them to evaluate the performance of
two different system setups (i.e. 'Multiple HTMs' and 'Single HTM') under
various noise conditions with 32--frame video files. Results of all the tests
were compared to SVM baseline setup. It was determined that the system
featuring SP is capable of achieving approximately 12 times the noise reduction
for a video signal with with distorted bits accounting for 13\% of the total.
Furthermore, the system featuring SP performed better also in the experiments
without a noise component and achieved a max F1 score of 0.96. The experiments
also revealed that a rise of column and synapse number of SP has a substantial
impact on the performance of the system. Consequently, the highest F1 score
values were obtained for 256 and 4096 synapses and columns respectively.
","[{'version': 'v1', 'created': 'Sat, 10 Sep 2016 21:51:54 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Dec 2016 11:13:40 GMT'}]",2017-03-14,"[['Wielgosz', 'Maciej', ''], ['Pietroń', 'Marcin', '']]","['Hierarchical Temporal Memory', 'Video processing', 'Object classification', 'OpenCL']"
2620,0912.5502,Serguei Mokhov,"Serguei A. Mokhov, Miao Song and Ching Y. Suen",Writer Identification Using Inexpensive Signal Processing Techniques,"9 pages; 1 figure; presented at CISSE'09 at
  http://conference.cisse2009.org/proceedings.aspx ; includes the the
  application source code; based on MARF described in arXiv:0905.1235",,10.1007/978-90-481-9112-3_74,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose to use novel and classical audio and text signal-processing and
otherwise techniques for ""inexpensive"" fast writer identification tasks of
scanned hand-written documents ""visually"". The ""inexpensive"" refers to the
efficiency of the identification process in terms of CPU cycles while
preserving decent accuracy for preliminary identification. This is a
comparative study of multiple algorithm combinations in a pattern recognition
pipeline implemented in Java around an open-source Modular Audio Recognition
Framework (MARF) that can do a lot more beyond audio. We present our
preliminary experimental findings in such an identification task. We simulate
""visual"" identification by ""looking"" at the hand-written document as a whole
rather than trying to extract fine-grained features out of it prior
classification.
","[{'version': 'v1', 'created': 'Wed, 30 Dec 2009 18:19:53 GMT'}]",2010-06-29,"[['Mokhov', 'Serguei A.', ''], ['Song', 'Miao', ''], ['Suen', 'Ching Y.', '']]","['writer identification', 'Modular Audio Recognition Framework (MARF)', 'signal processing', 'simulation']"
2621,1807.01004,Ian Cassar,"Luca Aceto, Ian Cassar, Adrian Francalanza, Anna Ingolfsdottir",On Runtime Enforcement via Suppressions,38 pages,,10.4230/LIPIcs.CONCUR.2018.34,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Runtime enforcement is a dynamic analysis technique that uses monitors to
enforce the behaviour specified by some correctness property on an executing
system. The enforceability of a logic captures the extent to which the
properties expressible via the logic can be enforced at runtime. We study the
enforceability of Hennessy-Milner Logic with Recursion (muHML) with respect to
suppression enforcement. We develop an operational framework for enforcement
which we then use to formalise when a monitor enforces a muHML property. We
also show that the safety syntactic fragment of the logic, sHML, is enforceable
by providing an automated synthesis function that generates correct suppression
monitors from sHML formulas.
","[{'version': 'v1', 'created': 'Tue, 3 Jul 2018 07:47:03 GMT'}]",2018-07-04,"[['Aceto', 'Luca', ''], ['Cassar', 'Ian', ''], ['Francalanza', 'Adrian', ''], ['Ingolfsdottir', 'Anna', '']]","['Enforceability', 'Suppression Enforcement', 'Monitor Synthesis', 'Logic']"
2622,1706.02621,Sandeep Kumar,"Rajani Kumari, Vivek Kumar Sharma, Sandeep Kumar","Design and Implementation of Modified Fuzzy based CPU Scheduling
  Algorithm",6 Pages,"International Journal of Computer Applications, Volume 77, No 17,
  September 2013","10.5120/13612-1323 10.5120/13612-1323 10.5120/13612-1323
  10.5120/13612-1323",,cs.OS cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  CPU Scheduling is the base of multiprogramming. Scheduling is a process which
decides order of task from a set of multiple tasks that are ready to execute.
There are number of CPU scheduling algorithms available, but it is very
difficult task to decide which one is better. This paper discusses the design
and implementation of modified fuzzy based CPU scheduling algorithm. This paper
present a new set of fuzzy rules. It demonstrates that scheduling done with new
priority improves average waiting time and average turnaround time.
","[{'version': 'v1', 'created': 'Fri, 26 May 2017 16:39:55 GMT'}]",2017-06-09,"[['Kumari', 'Rajani', ''], ['Sharma', 'Vivek Kumar', ''], ['Kumar', 'Sandeep', '']]","['Fuzzy logic', 'Operating System', 'Priority', 'Scheduling Algorithms', 'Turnaround Time', 'Waiting Time']"
2623,1801.04503,Fazle Karim,"Fazle Karim, Somshubra Majumdar, Houshang Darabi, Samuel Harford",Multivariate LSTM-FCNs for Time Series Classification,"18 pages, 2 figures, 5 tables",,10.1016/j.neunet.2019.04.014,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the past decade, multivariate time series classification has received
great attention. We propose transforming the existing univariate time series
classification models, the Long Short Term Memory Fully Convolutional Network
(LSTM-FCN) and Attention LSTM-FCN (ALSTM-FCN), into a multivariate time series
classification model by augmenting the fully convolutional block with a
squeeze-and-excitation block to further improve accuracy. Our proposed models
outperform most state-of-the-art models while requiring minimum preprocessing.
The proposed models work efficiently on various complex multivariate time
series classification tasks such as activity recognition or action recognition.
Furthermore, the proposed models are highly efficient at test time and small
enough to deploy on memory constrained systems.
","[{'version': 'v1', 'created': 'Sun, 14 Jan 2018 03:00:53 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Jul 2019 23:51:37 GMT'}]",2019-07-03,"[['Karim', 'Fazle', ''], ['Majumdar', 'Somshubra', ''], ['Darabi', 'Houshang', ''], ['Harford', 'Samuel', '']]","['Convolutional neural network', 'long short term memory', 'recurrent neuralnetwork', 'multivariate time series classification']"
2624,1005.1739,Secretary Aircc Journal,"A. Sivagami(1), K. Pavai(1), D. Sridharan(1) and S.A.V. Satya
  Murty(2), ((1)Anna University, India, (2)Indira Gandhi Centre for Atomic
  Research, India)","Energy and Link Quality Based Routing for Data Gathering Tree in
  Wireless Sensor Networks Under TINYOS - 2.X","14 Pages, IJWMN","International Journal of Wireless & Mobile Networks 2.2 (2010)
  47-60",10.5121/ijwmn.2010.2204,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Energy is one of the most important and scarce resources in Wireless Sensor
Networks (WSN). WSN nodes work with the embedded operating system called
TinyOS, which addresses the constrains of the WSN nodes such as limited
processing power, memory, energy, etc and it uses the collection Tree Protocol
(CTP) to collect the data from the sensor nodes. It uses either the four-bit
link estimation or Link Estimation Exchange Protocol (LEEP) to predict the bi
directional quality of the wireless link between the nodes and the next hop
candidate is based on the estimated link quality. The residual energy of the
node is an important key factor, which plays a vital role in the lifetime of
the network and hence this has to taken as one of the metric in the parent
selection. In this work, we consider the remaining energy of the node as one of
the metric to decide the parent in addition to the link quality metrics. The
proposed protocol was compared with CTP protocol in terms of number of packets
forwarded by each node and packet reception ratio (PRR) of the network. This
work was simulated in TOSSIM simulator and the same was tested in Crossbow IRIS
radio test bed. The results show that our algorithm performs better than CTP in
terms of load distribution and hence the increased lifetime
","[{'version': 'v1', 'created': 'Tue, 11 May 2010 07:50:36 GMT'}]",2010-07-15,"[['Sivagami', 'A.', ''], ['Pavai', 'K.', ''], ['Sridharan', 'D.', ''], ['Murty', 'S. A. V. Satya', '']]","['Wireless Sensor Networks', 'Energy aware Routing Protocols', 'TinyOS', 'Collection Tree Protocol', 'Energy Measurement', 'TOSSIM']"
2625,1803.05431,Holger Roth,"Holger R. Roth, Hirohisa Oda, Xiangrong Zhou, Natsuki Shimizu, Ying
  Yang, Yuichiro Hayashi, Masahiro Oda, Michitaka Fujiwara, Kazunari Misawa,
  Kensaku Mori","An application of cascaded 3D fully convolutional networks for medical
  image segmentation","Preprint accepted for publication in Computerized Medical Imaging and
  Graphics. Substantial extension of arXiv:1704.06382; Corrected references to
  figure numbers in this version","Computerized Medical Imaging and Graphics, Elsevier, Volume 66,
  June 2018, Pages 90-99",10.1016/j.compmedimag.2018.03.001,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advances in 3D fully convolutional networks (FCN) have made it
feasible to produce dense voxel-wise predictions of volumetric images. In this
work, we show that a multi-class 3D FCN trained on manually labeled CT scans of
several anatomical structures (ranging from the large organs to thin vessels)
can achieve competitive segmentation results, while avoiding the need for
handcrafting features or training class-specific models.
  To this end, we propose a two-stage, coarse-to-fine approach that will first
use a 3D FCN to roughly define a candidate region, which will then be used as
input to a second 3D FCN. This reduces the number of voxels the second FCN has
to classify to ~10% and allows it to focus on more detailed segmentation of the
organs and vessels.
  We utilize training and validation sets consisting of 331 clinical CT images
and test our models on a completely unseen data collection acquired at a
different hospital that includes 150 CT scans, targeting three anatomical
organs (liver, spleen, and pancreas). In challenging organs such as the
pancreas, our cascaded approach improves the mean Dice score from 68.5 to
82.2%, achieving the highest reported average score on this dataset. We compare
with a 2D FCN method on a separate dataset of 240 CT scans with 18 classes and
achieve a significantly higher performance in small organs and vessels.
Furthermore, we explore fine-tuning our models to different datasets.
  Our experiments illustrate the promise and robustness of current 3D FCN based
semantic segmentation of medical images, achieving state-of-the-art results.
Our code and trained models are available for download:
https://github.com/holgerroth/3Dunet_abdomen_cascade.
","[{'version': 'v1', 'created': 'Wed, 14 Mar 2018 07:20:37 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Mar 2018 05:22:07 GMT'}]",2018-04-13,"[['Roth', 'Holger R.', ''], ['Oda', 'Hirohisa', ''], ['Zhou', 'Xiangrong', ''], ['Shimizu', 'Natsuki', ''], ['Yang', 'Ying', ''], ['Hayashi', 'Yuichiro', ''], ['Oda', 'Masahiro', ''], ['Fujiwara', 'Michitaka', ''], ['Misawa', 'Kazunari', ''], ['Mori', 'Kensaku', '']]","['fully convolutional networks', 'deep learning', 'medical imaging', 'computed tomography', 'multi-organ segmentation']"
2626,1810.10322,Petar Radanliev,Petar Radanliev,"Economic impact of IoT cyber risk -- Analysing past and present to
  predict the future developments in IoT risk analysis and IoT cyber insurance","https://ieeexplore.ieee.org/document/8379690;
  https://digital-library.theiet.org/content/conferences/10.1049/cp.2018.0003.
  arXiv admin note: substantial text overlap with arXiv:1809.05229",,10.1049/cp.2018.0003,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is focused on mapping the current evolution of Internet of Things
(IoT) and its associated cyber risks for the Industry 4.0 (I4.0) sector. We
report the results of a qualitative empirical study that correlates academic
literature with 14 - I4.0 frameworks and initiatives. We apply the grounded
theory approach to synthesise the findings from our literature review, to
compare the cyber security frameworks and cyber security quantitative impact
assessment models, with the world leading I4.0 technological trends. From the
findings, we build a new impact assessment model of IoT cyber risk in Industry
4.0. We therefore advance the efforts of integrating standards and governance
into Industry 4.0 and offer a better understanding of economics impact
assessment models for I4.0.
","[{'version': 'v1', 'created': 'Sat, 13 Oct 2018 09:00:46 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Apr 2020 21:47:55 GMT'}]",2020-04-30,"[['Radanliev', 'Petar', '']]","['IoT Cyber Risk', 'IoT risk analysis', 'IoT cyber insurance', 'IoT MicroMort', 'Cyber Value-at-Risk']"
2627,1906.01689,You Xie,"Maximilian Werhahn, You Xie, Mengyu Chu, Nils Thuerey",A Multi-Pass GAN for Fluid Flow Super-Resolution,"SCA 2019, further details at:
  https://ge.in.tum.de/publications/2019-multi-pass-gan/","Proc. ACM Comput. Graph. Interact. Tech. 2, 2, Article 10 (July
  2019)",10.1145/3340251,,cs.GR cs.LG physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel method to up-sample volumetric functions with generative
neural networks using several orthogonal passes. Our method decomposes
generative problems on Cartesian field functions into multiple smaller
sub-problems that can be learned more efficiently. Specifically, we utilize two
separate generative adversarial networks: the first one up-scales slices which
are parallel to the XY-plane, whereas the second one refines the whole volume
along the Z-axis working on slices in the YZ-plane. In this way, we obtain full
coverage for the 3D target function and can leverage spatio-temporal
supervision with a set of discriminators. Additionally, we demonstrate that our
method can be combined with curriculum learning and progressive growing
approaches. We arrive at a first method that can up-sample volumes by a factor
of eight along each dimension, i.e., increasing the number of degrees of
freedom by 512. Large volumetric up-scaling factors such as this one have
previously not been attainable as the required number of weights in the neural
networks renders adversarial training runs prohibitively difficult. We
demonstrate the generality of our trained networks with a series of comparisons
to previous work, a variety of complex 3D results, and an analysis of the
resulting performance.
","[{'version': 'v1', 'created': 'Tue, 4 Jun 2019 19:22:36 GMT'}]",2019-08-06,"[['Werhahn', 'Maximilian', ''], ['Xie', 'You', ''], ['Chu', 'Mengyu', ''], ['Thuerey', 'Nils', '']]","['physics-based deep learning', 'generative models', 'computer animation', 'fluid simulation']"
2628,1810.10581,Abhik Singla,"Abhik Singla, Partha Pratim Roy and Debi Prosad Dogra",Visual Rendering of Shapes on 2D Display Devices Guided by Hand Gestures,"Submitted to Elsevier Displays Journal, 32 pages, 18 figures, 7
  tables",,10.1016/j.displa.2019.03.001,,cs.HC cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Designing of touchless user interface is gaining popularity in various
contexts. Using such interfaces, users can interact with electronic devices
even when the hands are dirty or non-conductive. Also, user with partial
physical disability can interact with electronic devices using such systems.
Research in this direction has got major boost because of the emergence of
low-cost sensors such as Leap Motion, Kinect or RealSense devices. In this
paper, we propose a Leap Motion controller-based methodology to facilitate
rendering of 2D and 3D shapes on display devices. The proposed method tracks
finger movements while users perform natural gestures within the field of view
of the sensor. In the next phase, trajectories are analyzed to extract extended
Npen++ features in 3D. These features represent finger movements during the
gestures and they are fed to unidirectional left-to-right Hidden Markov Model
(HMM) for training. A one-to-one mapping between gestures and shapes is
proposed. Finally, shapes corresponding to these gestures are rendered over the
display using MuPad interface. We have created a dataset of 5400 samples
recorded by 10 volunteers. Our dataset contains 18 geometric and 18
non-geometric shapes such as ""circle"", ""rectangle"", ""flower"", ""cone"", ""sphere""
etc. The proposed methodology achieves an accuracy of 92.87% when evaluated
using 5-fold cross validation method. Our experiments revel that the extended
3D features perform better than existing 3D features in the context of shape
representation and classification. The method can be used for developing useful
HCI applications for smart display devices.
","[{'version': 'v1', 'created': 'Mon, 22 Oct 2018 16:59:52 GMT'}]",2019-04-05,"[['Singla', 'Abhik', ''], ['Roy', 'Partha Pratim', ''], ['Dogra', 'Debi Prosad', '']]","['Gesture recognition', 'shape rendering', 'shape matching', '3D rendering']"
2629,1511.09061,Richard McClatchey,"Khawar Hasham, Kamran Munir and Richard McClatchey","Using Cloud-Aware Provenance to Reproduce Scientific Workflow Execution
  on Cloud","10 pages, 5 figures, 1 table. Proc of the 5th International
  Conference on Cloud Computing and Services Science (CLOSER) Lisbon MAy 2015.
  arXiv admin note: substantial text overlap with arXiv:1502.01539",,10.5220/0005452800490059,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Provenance has been thought of a mechanism to verify a workflow and to
provide workflow reproducibility. This provenance of scientific workflows has
been effectively carried out in Grid based scientific workflow systems.
However, recent adoption of Cloud-based scientific workflows present an
opportunity to investigate the suitability of existing approaches or propose
new approaches to collect provenance information from the Cloud and to utilize
it for workflow repeatability in the Cloud infrastructure. This paper presents
a novel approach that can assist in mitigating this challenge. This approach
can collect Cloud infrastructure information from an outside Cloud client along
with workflow provenance and can establish a mapping between them. This mapping
is later used to re-provision resources on the Cloud for workflow execution.
The reproducibility of the workflow execution is performed by: (a) capturing
the Cloud infrastructure information (virtual machine configuration) along with
the workflow provenance, (b) re-provisioning the similar resources on the Cloud
and re-executing the workflow on them and (c) by comparing the outputs of
workflows. The evaluation of the prototype suggests that the proposed approach
is feasible and can be investigated further. Moreover, there is no reference
reproducibility model exists in literature that can provide guidelines to
achieve this goal in Cloud. This paper also attempts to present a model that is
used in the proposed design to achieve workflow reproducibility in the Cloud
environment.
","[{'version': 'v1', 'created': 'Sun, 29 Nov 2015 18:54:58 GMT'}]",2015-12-01,"[['Hasham', 'Khawar', ''], ['Munir', 'Kamran', ''], ['McClatchey', 'Richard', '']]","['Cloud computing', 'Scientific Workflows', 'Provenance', 'Reproducibility', 'Repeatability']"
2630,1603.01419,Andrew Palmer,"Andrew W. Palmer, Andrew J. Hill, Steven J. Scheding","Methods for Stochastic Collection and Replenishment (SCAR) optimisation
  for persistent autonomy",Revision 1,Robotics and Autonomous Systems 87 (2017) 51-65,10.1016/j.robot.2016.09.011,,cs.RO cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consideration of resources such as fuel, battery charge, and storage space,
is a crucial requirement for the successful persistent operation of autonomous
systems. The Stochastic Collection and Replenishment (SCAR) scenario is
motivated by mining and agricultural scenarios where a dedicated replenishment
agent transports a resource between a centralised replenishment point to agents
using the resource in the field. The agents in the field typically operate
within fixed areas (for example, benches in mining applications, and fields or
orchards in agricultural scenarios), and the motion of the replenishment agent
may be restricted by a road network. Existing research has typically approached
the problem of scheduling the actions of the dedicated replenishment agent from
a short-term and deterministic angle. This paper introduces a method of
incorporating uncertainty in the schedule optimisation through a novel
prediction framework, and a branch and bound optimisation method which uses the
prediction framework to minimise the downtime of the agents. The prediction
framework makes use of several Gaussian approximations to quickly calculate the
risk-weighted cost of a schedule. The anytime nature of the branch and bound
method is exploited within an MPC-like framework to outperform existing
optimisation methods while providing reasonable calculation times in large
scenarios.
","[{'version': 'v1', 'created': 'Fri, 4 Mar 2016 10:52:14 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Jun 2016 23:18:21 GMT'}]",2016-11-10,"[['Palmer', 'Andrew W.', ''], ['Hill', 'Andrew J.', ''], ['Scheding', 'Steven J.', '']]","['Persistent autonomy', 'scheduling', 'uncertainty', 'refuelling', 'recharging']"
2631,1208.5554,Cm Pintea,"Gabriela Czibula, Gloria Cerasela Crisan, Camelia-M. Pintea,
  Istvan-Gergely Czibula",Soft Computing approaches on the Bandwidth Problem,"6 pages, 1 figure; accepted to Informatica",INFORMATICA 24(2):169-180 (2013),10.15388/Informatica.2013.390,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Matrix Bandwidth Minimization Problem (MBMP) seeks for a simultaneous
reordering of the rows and the columns of a square matrix such that the nonzero
entries are collected within a band of small width close to the main diagonal.
The MBMP is a NP-complete problem, with applications in many scientific
domains, linear systems, artificial intelligence, and real-life situations in
industry, logistics, information recovery. The complex problems are hard to
solve, that is why any attempt to improve their solutions is beneficent.
Genetic algorithms and ant-based systems are Soft Computing methods used in
this paper in order to solve some MBMP instances. Our approach is based on a
learning agent-based model involving a local search procedure. The algorithm is
compared with the classical Cuthill-McKee algorithm, and with a hybrid genetic
algorithm, using several instances from Matrix Market collection. Computational
experiments confirm a good performance of the proposed algorithms for the
considered set of MBMP instances. On Soft Computing basis, we also propose a
new theoretical Reinforcement Learning model for solving the MBMP problem.
","[{'version': 'v1', 'created': 'Tue, 28 Aug 2012 04:26:35 GMT'}]",2020-07-28,"[['Czibula', 'Gabriela', ''], ['Crisan', 'Gloria Cerasela', ''], ['Pintea', 'Camelia-M.', ''], ['Czibula', 'Istvan-Gergely', '']]","['Combinatorial optimization', 'Matrix Bandwidth Minimization Problem', 'Soft Computing', 'ReinforcementLearning']"
2632,1508.07371,Vijay Gadepally,"Vijay Gadepally, Jeremy Kepner, William Arcand, David Bestor, Bill
  Bergeron, Chansup Byun, Lauren Edwards, Matthew Hubbell, Peter Michaleas,
  Julie Mullen, Andrew Prout, Antonio Rosa, Charles Yee, Albert Reuther",D4M: Bringing Associative Arrays to Database Engines,,,10.1109/HPEC.2015.7322472,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ability to collect and analyze large amounts of data is a growing problem
within the scientific community. The growing gap between data and users calls
for innovative tools that address the challenges faced by big data volume,
velocity and variety. Numerous tools exist that allow users to store, query and
index these massive quantities of data. Each storage or database engine comes
with the promise of dealing with complex data. Scientists and engineers who
wish to use these systems often quickly find that there is no single technology
that offers a panacea to the complexity of information. When using multiple
technologies, however, there is significant trouble in designing the movement
of information between storage and database engines to support an end-to-end
application along with a steep learning curve associated with learning the
nuances of each underlying technology. In this article, we present the Dynamic
Distributed Dimensional Data Model (D4M) as a potential tool to unify database
and storage engine operations. Previous articles on D4M have showcased the
ability of D4M to interact with the popular NoSQL Accumulo database. Recently
however, D4M now operates on a variety of backend storage or database engines
while providing a federated look to the end user through the use of associative
arrays. In order to showcase how new databases may be supported by D4M, we
describe the process of building the D4M-SciDB connector and present
performance of this connection.
","[{'version': 'v1', 'created': 'Fri, 28 Aug 2015 22:46:56 GMT'}]",2017-01-25,"[['Gadepally', 'Vijay', ''], ['Kepner', 'Jeremy', ''], ['Arcand', 'William', ''], ['Bestor', 'David', ''], ['Bergeron', 'Bill', ''], ['Byun', 'Chansup', ''], ['Edwards', 'Lauren', ''], ['Hubbell', 'Matthew', ''], ['Michaleas', 'Peter', ''], ['Mullen', 'Julie', ''], ['Prout', 'Andrew', ''], ['Rosa', 'Antonio', ''], ['Yee', 'Charles', ''], ['Reuther', 'Albert', '']]","['Big Data', 'Data Analytics', 'Dimensional Analysis', 'Federated Databases']"
2633,0705.2318,Seiji Miyoshi,"Hideto Utsumi, Seiji Miyoshi, Masato Okada","Statistical Mechanics of Nonlinear On-line Learning for Ensemble
  Teachers","13 pages, 9 figures",,10.1143/JPSJ.76.114001,,cs.LG cond-mat.dis-nn,,"  We analyze the generalization performance of a student in a model composed of
nonlinear perceptrons: a true teacher, ensemble teachers, and the student. We
calculate the generalization error of the student analytically or numerically
using statistical mechanics in the framework of on-line learning. We treat two
well-known learning rules: Hebbian learning and perceptron learning. As a
result, it is proven that the nonlinear model shows qualitatively different
behaviors from the linear model. Moreover, it is clarified that Hebbian
learning and perceptron learning show qualitatively different behaviors from
each other. In Hebbian learning, we can analytically obtain the solutions. In
this case, the generalization error monotonically decreases. The steady value
of the generalization error is independent of the learning rate. The larger the
number of teachers is and the more variety the ensemble teachers have, the
smaller the generalization error is. In perceptron learning, we have to
numerically obtain the solutions. In this case, the dynamical behaviors of the
generalization error are non-monotonic. The smaller the learning rate is, the
larger the number of teachers is; and the more variety the ensemble teachers
have, the smaller the minimum value of the generalization error is.
","[{'version': 'v1', 'created': 'Wed, 16 May 2007 09:58:39 GMT'}]",2009-11-13,"[['Utsumi', 'Hideto', ''], ['Miyoshi', 'Seiji', ''], ['Okada', 'Masato', '']]","['on-line learning', 'generalization error', 'ensemble teachers', 'true teacher']"
2634,cs/0311006,Paul M. Aoki,Allison Woodruff and Paul M. Aoki,How Push-To-Talk Makes Talk Less Pushy,10 pages,"Proc. ACM SIGGROUP Conf. on Supporting Group Work, Sanibel Island,
  FL, Nov. 2003, 170-179. ACM Press.",10.1145/958160.958187,,cs.HC,,"  This paper presents an exploratory study of college-age students using
two-way, push-to-talk cellular radios. We describe the observed and reported
use of cellular radio by the participants. We discuss how the half-duplex,
lightweight cellular radio communication was associated with reduced
interactional commitment, which meant the cellular radios could be used for a
wide range of conversation styles. One such style, intermittent conversation,
is characterized by response delays. Intermittent conversation is surprising in
an audio medium, since it is typically associated with textual media such as
instant messaging. We present design implications of our findings.
","[{'version': 'v1', 'created': 'Fri, 7 Nov 2003 02:17:34 GMT'}]",2007-05-23,"[['Woodruff', 'Allison', ''], ['Aoki', 'Paul M.', '']]","['Cellular radio', 'instant messaging', 'two-way radio', 'walkie talkies']"
2635,2105.07960,Martin Zaefferer,"J\""org Stork, Martin Zaefferer, Nils Eisler, Patrick Tichelmann,
  Thomas Bartz-Beielstein, A. E. Eiben",Behavior-based Neuroevolutionary Training in Reinforcement Learning,,,10.1145/3449726.3463171,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In addition to their undisputed success in solving classical optimization
problems, neuroevolutionary and population-based algorithms have become an
alternative to standard reinforcement learning methods. However, evolutionary
methods often lack the sample efficiency of standard value-based methods that
leverage gathered state and value experience. If reinforcement learning for
real-world problems with significant resource cost is considered, sample
efficiency is essential. The enhancement of evolutionary algorithms with
experience exploiting methods is thus desired and promises valuable insights.
This work presents a hybrid algorithm that combines topology-changing
neuroevolutionary optimization with value-based reinforcement learning. We
illustrate how the behavior of policies can be used to create distance and loss
functions, which benefit from stored experiences and calculated state values.
They allow us to model behavior and perform a directed search in the behavior
space by gradient-free evolutionary algorithms and surrogate-based
optimization. For this purpose, we consolidate different methods to generate
and optimize agent policies, creating a diverse population. We exemplify the
performance of our algorithm on standard benchmarks and a purpose-built
real-world problem. Our results indicate that combining methods can enhance the
sample efficiency and learning speed for evolutionary approaches.
","[{'version': 'v1', 'created': 'Mon, 17 May 2021 15:40:42 GMT'}]",2021-05-18,"[['Stork', 'Jörg', ''], ['Zaefferer', 'Martin', ''], ['Eisler', 'Nils', ''], ['Tichelmann', 'Patrick', ''], ['Bartz-Beielstein', 'Thomas', ''], ['Eiben', 'A. E.', '']]","['Neuroevolution', 'Reinforcement Learning', 'Neural Networks', 'Evolutionary Algorithms', 'Surrogate Optimization']"
2636,1308.2475,Farbod Roosta-Khorasani,Farbod Roosta-Khorasani and Uri Ascher,Improved bounds on sample size for implicit matrix trace estimators,,,10.1007/s10208-014-9220-1,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article is concerned with Monte-Carlo methods for the estimation of the
trace of an implicitly given matrix $A$ whose information is only available
through matrix-vector products. Such a method approximates the trace by an
average of $N$ expressions of the form $\ww^t (A\ww)$, with random vectors
$\ww$ drawn from an appropriate distribution. We prove, discuss and experiment
with bounds on the number of realizations $N$ required in order to guarantee a
probabilistic bound on the relative error of the trace estimation upon
employing Rademacher (Hutchinson), Gaussian and uniform unit vector (with and
without replacement) probability distributions.
  In total, one necessary bound and six sufficient bounds are proved, improving
upon and extending similar estimates obtained in the seminal work of Avron and
Toledo (2011) in several dimensions. We first improve their bound on $N$ for
the Hutchinson method, dropping a term that relates to $rank(A)$ and making the
bound comparable with that for the Gaussian estimator.
  We further prove new sufficient bounds for the Hutchinson, Gaussian and the
unit vector estimators, as well as a necessary bound for the Gaussian
estimator, which depend more specifically on properties of the matrix $A$. As
such they may suggest for what type of matrices one distribution or another
provides a particularly effective or relatively ineffective stochastic
estimation method.
","[{'version': 'v1', 'created': 'Mon, 12 Aug 2013 06:57:32 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Jul 2014 23:50:54 GMT'}]",2014-08-20,"[['Roosta-Khorasani', 'Farbod', ''], ['Ascher', 'Uri', '']]","['randomized algorithms', 'trace estimation', 'Monte-Carlo methods', 'implicitlinear operators']"
2637,1805.11297,"Christoph D\""urr","Christoph D\""urr, {\L}ukasz Je\.z and Oscar C. V\'asquez","Scheduling under dynamic speed-scaling for minimizing weighted
  completion time and energy consumption",,"Discrete Applied Mathematics, Volume 196, 11 December 2015, Pages
  20-27",10.1016/j.dam.2014.08.001,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since a few years there is an increasing interest in minimizing the energy
consumption of computing systems. However in a shared computing system, users
want to optimize their experienced quality of service, at the price of a high
energy consumption. In this work, we address the problem of optimizing and
designing mechanisms for a linear combination of weighted completion time and
energy consumption on a single machine with dynamic speed-scaling. We show that
minimizing linear combination reduces to a unit speed scheduling problem under
a polynomial penalty function. In the mechanism design setting, we define a
cost share mechanism and studied its properties, showing that it is truthful
and the overcharging of total cost share is bounded by a constant.
","[{'version': 'v1', 'created': 'Tue, 29 May 2018 08:25:18 GMT'}]",2018-05-30,"[['Dürr', 'Christoph', ''], ['Jeż', 'Łukasz', ''], ['Vásquez', 'Oscar C.', '']]","['scheduling', 'energy management', 'quality of service', 'optimization', 'mechanism design']"
2638,2102.02906,Zaid Saeed Khan,"Bilal Thonnam Thodi, Zaid Saeed Khan, Saif Eddin Jabari, Monica
  Menendez","Incorporating Kinematic Wave Theory into a Deep Learning Method for
  High-Resolution Traffic Speed Estimation","18 pages, 13 figures","IEEE Transactions on Intelligent Transportation Systems, 2022",10.1109/TITS.2022.3157439,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a kinematic wave-based Deep Convolutional Neural Network (Deep
CNN) to estimate high-resolution traffic speed fields from sparse probe vehicle
trajectories. We introduce two key approaches that allow us to incorporate
kinematic wave theory principles to improve the robustness of existing
learning-based estimation methods. First, we propose an anisotropic traffic
kernel for the Deep CNN. The anisotropic kernel explicitly accounts for
space-time correlations in macroscopic traffic and effectively reduces the
number of trainable parameters in the Deep CNN model. Second, we propose to use
simulated data for training the Deep CNN. Using a targeted simulated data for
training provides an implicit way to impose desirable traffic physical features
on the learning model. In the experiments, we highlight the benefits of using
anisotropic kernels and evaluate the transferability of the trained model to
real-world traffic using the Next Generation Simulation (NGSIM) and the German
Highway Drone (HighD) datasets. The results demonstrate that anisotropic
kernels significantly reduce model complexity and model over-fitting, and
improve the physical correctness of the estimated speed fields. We find that
model complexity scales linearly with problem size for anisotropic kernels
compared to quadratic scaling for isotropic kernels. Furthermore, evaluation on
real-world datasets shows acceptable performance, which establishes that
simulation-based training is a viable surrogate to learning from real-world
data. Finally, a comparison with standard estimation techniques shows the
superior estimation accuracy of the proposed method.
","[{'version': 'v1', 'created': 'Thu, 4 Feb 2021 21:51:25 GMT'}, {'version': 'v2', 'created': 'Sat, 12 Feb 2022 10:23:03 GMT'}]",2022-04-12,"[['Thodi', 'Bilal Thonnam', ''], ['Khan', 'Zaid Saeed', ''], ['Jabari', 'Saif Eddin', ''], ['Menendez', 'Monica', '']]","['Traffic state estimation', 'traffic anisotropy', 'kinematic wave theory', 'convolutional neuralnetworks', 'deep learning']"
2639,2008.00202,Malte Ostendorff,Malte Ostendorff,"Contextual Document Similarity for Content-based Literature Recommender
  Systems","In Proceedings of the Doctoral Consortium at ACM/IEEE Joint
  Conference on Digital Libraries (JCDL 2020)","Proceedings of the Doctoral Consortium at ACM/IEEE Joint
  Conference on Digital Libraries (JCDL 2020)",,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To cope with the ever-growing information overload, an increasing number of
digital libraries employ content-based recommender systems. These systems
traditionally recommend related documents with the help of similarity measures.
However, current document similarity measures simply distinguish between
similar and dissimilar documents. This simplification is especially crucial for
extensive documents, which cover various facets of a topic and are often found
in digital libraries. Still, these similarity measures neglect to what facet
the similarity relates. Therefore, the context of the similarity remains
ill-defined. In this doctoral thesis, we explore contextual document similarity
measures, i.e., methods that determine document similarity as a triple of two
documents and the context of their similarity. The context is here a further
specification of the similarity. For example, in the scientific domain,
research papers can be similar with respect to their background, methodology,
or findings. The measurement of similarity in regards to one or more given
contexts will enhance recommender systems. Namely, users will be able to
explore document collections by formulating queries in terms of documents and
their contextual similarities. Thus, our research objective is the development
and evaluation of a recommender system based on contextual similarity. The
underlying techniques will apply established similarity measures and as well as
neural approaches while utilizing semantic features obtained from links between
documents and their text.
","[{'version': 'v1', 'created': 'Sat, 1 Aug 2020 07:42:40 GMT'}]",2020-08-04,"[['Ostendorff', 'Malte', '']]","['document similarity', 'recommender systems', 'natural language processing', 'citation analysis', 'document classification']"
2640,1610.06734,D Thirumulanathan,"D. Thirumulanathan, H. Vinay, Srikrishna Bhashyam, and Rajesh
  Sundaresan","Almost Budget Balanced Mechanisms with Scalar Bids For Allocation of a
  Divisible Good","Accepted for publication in the European Journal of Operational
  Research (EJOR)",,10.1016/j.ejor.2017.04.031,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is about allocation of an infinitely divisible good to several
rational and strategic agents. The allocation is done by a social planner who
has limited information because the agents' valuation functions are taken to be
private information known only to the respective agents. We allow only a scalar
signal, called a bid, from each agent to the social planner. Yang and Hajek
[Jour. on Selected Areas in Comm., 2007] as well as Johari and Tsitsiklis
[Jour. of Oper. Res., 2009] proposed a scalar strategy Vickrey-Clarke-Groves
(SSVCG) mechanism with efficient Nash equilibria. We consider a setting where
the social planner desires minimal budget surplus. Example situations include
fair sharing of Internet resources and auctioning of certain public goods where
revenue maximization is not a consideration. Under the SSVCG framework, we
propose a mechanism that is efficient and comes close to budget balance by
returning much of the payments back to the agents in the form of rebates. We
identify a design criterion for {\em almost budget balance}, impose feasibility
and voluntary participation constraints, simplify the constraints, and arrive
at a convex optimization problem to identify the parameters of the rebate
functions. The convex optimization problem has a linear objective function and
a continuum of linear constraints. We propose a solution method that involves a
finite number of constraints, and identify the number of samples sufficient for
a good approximation.
","[{'version': 'v1', 'created': 'Fri, 21 Oct 2016 10:35:29 GMT'}, {'version': 'v2', 'created': 'Thu, 4 May 2017 11:15:53 GMT'}]",2017-05-05,"[['Thirumulanathan', 'D.', ''], ['Vinay', 'H.', ''], ['Bhashyam', 'Srikrishna', ''], ['Sundaresan', 'Rajesh', '']]","['Auctions/bidding', 'Game theory', 'Economics', 'Linear Programming', 'Uncertain Convex Program']"
2641,0909.0171,Jacob Vosmaer,Mai Gehrke and Jacob Vosmaer,Canonical extension and canonicity via DCPO presentations,"17 pages. Definition 5 was revised slightly, without changing any of
  the results","Theoretical Computer Science 412(25), pp. 2714-2723, 2011",10.1016/j.tcs.2010.12.032,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The canonical extension of a lattice is in an essential way a two-sided
completion. Domain theory, on the contrary, is primarily concerned with
one-sided completeness. In this paper, we show two things. Firstly, that the
canonical extension of a lattice can be given an asymmetric description in two
stages: a free co-directed meet completion, followed by a completion by
\emph{selected} directed joins. Secondly, we show that the general techniques
for dcpo presentations of dcpo algebras used in the second stage of the
construction immediately give us the well-known canonicity result for bounded
lattices with operators.
","[{'version': 'v1', 'created': 'Tue, 1 Sep 2009 12:49:20 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Sep 2010 14:17:38 GMT'}]",2012-02-16,"[['Gehrke', 'Mai', ''], ['Vosmaer', 'Jacob', '']]","['dcpo presentation', 'dcpo algebra', 'lattice theory', 'canonicalextension', 'canonicity']"
2642,2301.08828,Thanveer Shaik Mr,"Thanveer Shaik, Xiaohui Tao, Niall Higgins, Haoran Xie, Raj Gururajan,
  Xujuan Zhou",AI enabled RPM for Mental Health Facility,,"In 1st ACM Workshop on Mobile and Wireless Sensing for Smart
  Healthcare (MWMSSH 2022), October 21, 2022, Sydney, NSW, Australia. ACM, New
  York, NY, USA, 7 pages",10.1145/3556551.3561191,,cs.HC cs.AI cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Mental healthcare is one of the prominent parts of the healthcare industry
with alarming concerns related to patients depression, stress leading to
self-harm and threat to fellow patients and medical staff. To provide a
therapeutic environment for both patients and staff, aggressive or agitated
patients need to be monitored remotely and track their vital signs and physical
activities continuously. Remote patient monitoring (RPM) using non-invasive
technology could enable contactless monitoring of acutely ill patients in a
mental health facility. Enabling the RPM system with AI unlocks a predictive
environment in which future vital signs of the patients can be forecasted. This
paper discusses an AI-enabled RPM system framework with a non-invasive digital
technology RFID using its in-built NCS mechanism to retrieve vital signs and
physical actions of patients. Based on the retrieved time series data, future
vital signs of patients for the upcoming 3 hours and classify their physical
actions into 10 labelled physical activities. This framework assists to avoid
any unforeseen clinical disasters and take precautionary measures with medical
intervention at right time. A case study of a middle-aged PTSD patient treated
with the AI-enabled RPM system is demonstrated in this study.
","[{'version': 'v1', 'created': 'Fri, 20 Jan 2023 23:47:16 GMT'}]",2023-01-24,"[['Shaik', 'Thanveer', ''], ['Tao', 'Xiaohui', ''], ['Higgins', 'Niall', ''], ['Xie', 'Haoran', ''], ['Gururajan', 'Raj', ''], ['Zhou', 'Xujuan', '']]","['RPM', 'AI', 'neural networks', 'mental health monitoring']"
2643,2010.13539,Markus Dahlmanns,"Markus Dahlmanns, Johannes Lohm\""oller, Ina Berenice Fink, Jan
  Pennekamp, Klaus Wehrle, Martin Henze","Easing the Conscience with OPC UA: An Internet-Wide Study on Insecure
  Deployments","10 pages, 7 figures","In Proceedings of the ACM Internet Measurement Conference 2020
  (IMC '20). Association for Computing Machinery, New York, NY, USA, 101-110",10.1145/3419394.3423666,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to increasing digitalization, formerly isolated industrial networks,
e.g., for factory and process automation, move closer and closer to the
Internet, mandating secure communication. However, securely setting up OPC UA,
the prime candidate for secure industrial communication, is challenging due to
a large variety of insecure options. To study whether Internet-facing OPC UA
appliances are configured securely, we actively scan the IPv4 address space for
publicly reachable OPC UA systems and assess the security of their
configurations. We observe problematic security configurations such as missing
access control (on 24% of hosts), disabled security functionality (24%), or use
of deprecated cryptographic primitives (25%) on in total 92% of the reachable
deployments. Furthermore, we discover several hundred devices in multiple
autonomous systems sharing the same security certificate, opening the door for
impersonation attacks. Overall, in this paper, we highlight commonly found
security misconfigurations and underline the importance of appropriate
configuration for security-featuring protocols.
","[{'version': 'v1', 'created': 'Mon, 26 Oct 2020 12:48:20 GMT'}]",2020-10-27,"[['Dahlmanns', 'Markus', ''], ['Lohmöller', 'Johannes', ''], ['Fink', 'Ina Berenice', ''], ['Pennekamp', 'Jan', ''], ['Wehrle', 'Klaus', ''], ['Henze', 'Martin', '']]","['industrial communication', 'network security', 'security configuration']"
2644,1512.09363,Valmir Barbosa,"Fabiano de S. Oliveira, Valmir C. Barbosa",Counting independent terms in big-oh notation,,"Optimization Letters 11 (2017), 1757-1765",10.1007/s11590-016-1092-7,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The field of computational complexity is concerned both with the intrinsic
hardness of computational problems and with the efficiency of algorithms to
solve them. Given such a problem, normally one designs an algorithm to solve it
and sets about establishing bounds on its performance as functions of the
algorithm's variables, particularly upper bounds expressed via the big-oh
notation. But if we were given some inscrutable code and were asked to figure
out its big-oh profile from performance data on a given set of inputs, how hard
would we have to grapple with the various possibilities before zooming in on a
reasonably small set of candidates? Here we show that, even if we restricted
our search to upper bounds given by polynomials, the number of possibilities
could be arbitrarily large for two or more variables. This is unexpected, given
the available body of examples on algorithmic efficiency, and serves to
illustrate the many facets of the big-oh notation, as well as its
counter-intuitive twists.
","[{'version': 'v1', 'created': 'Thu, 31 Dec 2015 20:47:11 GMT'}]",2017-11-13,"[['Oliveira', 'Fabiano de S.', ''], ['Barbosa', 'Valmir C.', '']]","['Analysis of algorithms', 'Asymptotics', 'Big-oh notation', 'Computational complexity']"
2645,1802.07512,Ligang Zhang,"Ligang Zhang, Brijesh Verma, David Stockwell, Sujan Chowdhury","Density Weighted Connectivity of Grass Pixels in Image Frames for
  Biomass Estimation","28 pages, accepted manuscript, Expert Systems with Applications",,10.1016/j.eswa.2018.01.055,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate estimation of the biomass of roadside grasses plays a significant
role in applications such as fire-prone region identification. Current
solutions heavily depend on field surveys, remote sensing measurements and
image processing using reference markers, which often demand big investments of
time, effort and cost. This paper proposes Density Weighted Connectivity of
Grass Pixels (DWCGP) to automatically estimate grass biomass from roadside
image data. The DWCGP calculates the length of continuously connected grass
pixels along a vertical orientation in each image column, and then weights the
length by the grass density in a surrounding region of the column. Grass pixels
are classified using feedforward artificial neural networks and the dominant
texture orientation at every pixel is computed using multi-orientation Gabor
wavelet filter vote. Evaluations on a field survey dataset show that the DWCGP
reduces Root-Mean-Square Error from 5.84 to 5.52 by additionally considering
grass density on top of grass height. The DWCGP shows robustness to
non-vertical grass stems and to changes of both Gabor filter parameters and
surrounding region widths. It also has performance close to human observation
and higher than eight baseline approaches, as well as promising results for
classifying low vs. high fire risk and identifying fire-prone road regions.
","[{'version': 'v1', 'created': 'Wed, 21 Feb 2018 11:07:05 GMT'}]",2018-02-22,"[['Zhang', 'Ligang', ''], ['Verma', 'Brijesh', ''], ['Stockwell', 'David', ''], ['Chowdhury', 'Sujan', '']]","['Image analysis', 'roadside data analysis', 'grass biomass', 'Gabor filter', 'artificial neural networks']"
2646,1201.0017,Denitsa Staicova,Plamen P. Fiziev and Denitsa R. Staicova,Solving systems of transcendental equations involving the Heun functions,"17 pages, 4 figures. Typos corrected, one figure added, some sections
  revised. The article is a rework of the internal report arXiv:1005.5375","American Journal of Computational Mathematics Vol. 02 : 02, pp.95
  (2012)",10.4236/ajcm.2012.22013,SU-TH/29-12-2011,cs.NA astro-ph.IM gr-qc,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Heun functions have wide application in modern physics and are expected
to succeed the hypergeometrical functions in the physical problems of the 21st
century. The numerical work with those functions, however, is complicated and
requires filling the gaps in the theory of the Heun functions and also,
creating new algorithms able to work with them efficiently.
  We propose a new algorithm for solving a system of two nonlinear
transcendental equations with two complex variables based on the M\""uller
algorithm. The new algorithm is particularly useful in systems featuring the
Heun functions and for them, the new algorithm gives distinctly better results
than Newton's and Broyden's methods.
  As an example for its application in physics, the new algorithm was used to
find the quasi-normal modes (QNM) of Schwarzschild black hole described by the
Regge-Wheeler equation. The numerical results obtained by our method are
compared with the already published QNM frequencies and are found to coincide
to a great extent with them. Also discussed are the QNM of the Kerr black hole,
described by the Teukolsky Master equation.
","[{'version': 'v1', 'created': 'Thu, 29 Dec 2011 21:00:35 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Feb 2012 19:59:53 GMT'}]",2012-12-04,"[['Fiziev', 'Plamen P.', ''], ['Staicova', 'Denitsa R.', '']]","['root-finding algorithm', 'M¨uller algorithm', 'two-dimensional M¨ulleralgorithm', 'Regge-Wheeler equation', 'QNM', 'Teukolsky Master equation']"
2647,1704.06687,Mathieu Cliche,"Mathieu Cliche, David Rosenberg, Dhruv Madeka and Connie Yee",Scatteract: Automated extraction of data from scatter plots,"Submitted to ECML PKDD 2017 proceedings, 16 pages","Machine Learning and Knowledge Discovery in Databases. ECML PKDD
  2017. Lecture Notes in Computer Science, vol 10534. Springer, Cham",10.1007/978-3-319-71249-9_9,,cs.CV cs.IR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Charts are an excellent way to convey patterns and trends in data, but they
do not facilitate further modeling of the data or close inspection of
individual data points. We present a fully automated system for extracting the
numerical values of data points from images of scatter plots. We use deep
learning techniques to identify the key components of the chart, and optical
character recognition together with robust regression to map from pixels to the
coordinate system of the chart. We focus on scatter plots with linear scales,
which already have several interesting challenges. Previous work has done fully
automatic extraction for other types of charts, but to our knowledge this is
the first approach that is fully automatic for scatter plots. Our method
performs well, achieving successful data extraction on 89% of the plots in our
test set.
","[{'version': 'v1', 'created': 'Fri, 21 Apr 2017 19:25:32 GMT'}]",2018-10-10,"[['Cliche', 'Mathieu', ''], ['Rosenberg', 'David', ''], ['Madeka', 'Dhruv', ''], ['Yee', 'Connie', '']]","['Computer vision', 'Information retrieval', 'Data visualization']"
2648,1808.06813,Daniel Hienert,"Daniel Hienert, Matthew Mitsui, Philipp Mayr, Chirag Shah, and
  Nicholas J. Belkin",The Role of the Task Topic in Web Search of Different Task Types,"Proceedings of the 2018 Conference on Human Information Interaction &
  Retrieval (CHIIR 2018)",,10.1145/3176349.3176382,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When users are looking for information on the Web, they show different
behavior for different task types, e.g., for fact finding vs. information
gathering tasks. For example, related work in this area has investigated how
this behavior can be measured and applied to distinguish between easy and
difficult tasks. In this work, we look at the searcher's behavior in the domain
of journalism for four different task types, and additionally, for two
different topics in each task type. Search behavior is measured with a number
of session variables and correlated to subjective measures such as task
difficulty, task success and the usefulness of documents. We acknowledge prior
results in this area that task difficulty is correlated to user effort and that
easy and difficult tasks are distinguishable by session variables. However, in
this work, we emphasize the role of the task topic - in and of itself - over
parameters such as the search results and read content pages, dwell times,
session variables and subjective measures such as task difficulty or task
success. With this knowledge researchers should give more attention to the task
topic as an important influence factor for user behavior.
","[{'version': 'v1', 'created': 'Tue, 21 Aug 2018 09:20:55 GMT'}]",2018-08-22,"[['Hienert', 'Daniel', ''], ['Mitsui', 'Matthew', ''], ['Mayr', 'Philipp', ''], ['Shah', 'Chirag', ''], ['Belkin', 'Nicholas J.', '']]","['AND PHRASES User Behavior', 'Web Search', 'Task', 'Topic', 'Session']"
2649,1505.03950,Jie Fan,Jie Fan,Logics of Strong Noncontingency,28 pages,"Notre Dame J. Formal Logic 60, no. 3 (2019), 407-435",10.1215/00294527-2019-0010,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Inspired by Hintikka's treatment of question embedding verbs in [8] and the
variations of noncontingency operator, we propose a logic with strong
noncontingency operator $\blacktriangle$ as the only primitive modality. A
proposition is strongly noncontingent, if no matter whether it is true or
false, it does it necessarily; otherwise, it is weakly contingent. This logic
is not a normal modal logic, since
$\blacktriangle(\phi\to\psi)\to(\blacktriangle\phi\to\blacktriangle\psi)$ is
invalid. We compare the relative expressivity of this logic and other logics,
such as standard modal logic, noncontingency logic, and logic of essence and
accident, and investigate its frame definability. Apart from these results, we
also propose a suitable notion of bisimulation for the logic of strong
noncontingency, based on which we characterize this logic within modal logic
and within first-order logic. We also axiomatize the logic of strong
noncontingency over various frame classes. Our work is also related to the
treatment of agreement operator in [10].
","[{'version': 'v1', 'created': 'Fri, 15 May 2015 03:14:54 GMT'}]",2019-09-18,"[['Fan', 'Jie', '']]","['noncontingency', 'completeness', 'expressivity', 'frame definability', 'bisimulation', 'modal logic of agreement']"
2650,1502.04048,Sebastian Wild,Raphael Reitzig and Sebastian Wild,Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts,v3 adds more context about the problem,"Reitzig, R. & Wild, S. Algorithmica (2017).
  https://doi.org/10.1007/s00453-017-0392-3",10.1007/s00453-017-0392-3,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a set of n sticks of various (not necessarily different) lengths, what
is the largest length so that we can cut k equally long pieces of this length
from the given set of sticks? We analyze the structure of this problem and show
that it essentially reduces to a single call of a selection algorithm; we thus
obtain an optimal linear-time algorithm.
  This algorithm also solves the related envy-free stick-division problem,
which Segal-Halevi, Hassidim, and Aumann (AAMAS, 2015) recently used as their
central primitive operation for the first discrete and bounded envy-free cake
cutting protocol with a proportionality guarantee when pieces can be put to
waste.
","[{'version': 'v1', 'created': 'Fri, 13 Feb 2015 16:22:18 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Apr 2015 13:33:57 GMT'}, {'version': 'v3', 'created': 'Fri, 3 Nov 2017 17:22:24 GMT'}]",2017-11-06,"[['Reitzig', 'Raphael', ''], ['Wild', 'Sebastian', '']]","['envy-free stick division', 'envy-free allocations', 'fair division', 'building fences', 'stick cutting', 'cake cutting with waste', 'proportional apportionment']"
2651,1512.04358,Theodore Patkos,"Theodore Patkos, Dimitris Plexousakis, Abdelghani Chibani, Yacine
  Amirat","An Event Calculus Production Rule System for Reasoning in Dynamic and
  Uncertain Domains","Under consideration in Theory and Practice of Logic Programming
  (TPLP)",Theory and Practice of Logic Programming 16 (2016) 325-352,10.1017/S1471068416000065,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Action languages have emerged as an important field of Knowledge
Representation for reasoning about change and causality in dynamic domains.
This article presents Cerbere, a production system designed to perform online
causal, temporal and epistemic reasoning based on the Event Calculus. The
framework implements the declarative semantics of the underlying logic theories
in a forward-chaining rule-based reasoning system, coupling the high
expressiveness of its formalisms with the efficiency of rule-based systems. To
illustrate its applicability, we present both the modeling of benchmark
problems in the field, as well as its utilization in the challenging domain of
smart spaces. A hybrid framework that combines logic-based with probabilistic
reasoning has been developed, that aims to accommodate activity recognition and
monitoring tasks in smart spaces. Under consideration in Theory and Practice of
Logic Programming (TPLP)
","[{'version': 'v1', 'created': 'Mon, 14 Dec 2015 15:18:58 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Dec 2015 17:57:42 GMT'}]",2020-02-19,"[['Patkos', 'Theodore', ''], ['Plexousakis', 'Dimitris', ''], ['Chibani', 'Abdelghani', ''], ['Amirat', 'Yacine', '']]","['Event Calculus', 'Rule-based Reasoning', 'Smart Environments']"
2652,1406.7770,Peter Duggins,Peter Duggins,"A Psychologically-Motivated Model of Opinion Change with Applications to
  American Politics","18 pages, 10 figures. Keywords: Agent-Based Model, Opinion Dynamics,
  Social Networks, Conformity, Polarization, Extremism","Journal of Artificial Societies and Social Simulation 20 (1) 13,
  (2017)",10.18564/jasss.3316,,cs.MA cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Agent-based models are versatile tools for studying how societal opinion
change, including political polarization and cultural diffusion, emerges from
individual behavior. This study expands agents' psychological realism using
empirically-motivated rules governing interpersonal influence, commitment to
previous beliefs, and conformity in social contexts. Computational experiments
establish that these extensions produce three novel results: (a) sustained
strong diversity of opinions within the population, (b) opinion subcultures,
and (c) pluralistic ignorance. These phenomena arise from a combination of
agents' intolerance, susceptibility and conformity, with extremist agents and
social networks playing important roles. The distribution and dynamics of
simulated opinions reproduce two empirical datasets on Americans' political
opinions.
","[{'version': 'v1', 'created': 'Mon, 30 Jun 2014 15:12:57 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Sep 2016 20:16:43 GMT'}, {'version': 'v3', 'created': 'Mon, 20 Feb 2017 19:59:31 GMT'}]",2017-02-22,"[['Duggins', 'Peter', '']]","['Agent-Based Model', 'Opinion Dynamics', 'Social Networks', 'Conformity', 'Polarization', 'Extremism']"
2653,0706.3008,Areski Flissi,"Areski Flissi (LIFL), Philippe Merle (INRIA Futurs)","A Generic Deployment Framework for Grid Computing and Distributed
  Applications",The original publication is available at http://www.springerlink.com,"OTM 2006, LNCS 4276 (2006) 1402-1411",10.1007/11914952_26,,cs.DC,,"  Deployment of distributed applications on large systems, and especially on
grid infrastructures, becomes a more and more complex task. Grid users spend a
lot of time to prepare, install and configure middleware and application
binaries on nodes, and eventually start their applications. The problem is that
the deployment process is composed of many heterogeneous tasks that have to be
orchestrated in a specific correct order. As a consequence, the automatization
of the deployment process is currently very difficult to reach. To address this
problem, we propose in this paper a generic deployment framework allowing to
automatize the execution of heterogeneous tasks composing the whole deployment
process. Our approach is based on a reification as software components of all
required deployment mechanisms or existing tools. Grid users only have to
describe the configuration to deploy in a simple natural language instead of
programming or scripting how the deployment process is executed. As a toy
example, this framework is used to deploy CORBA component-based applications
and OpenCCM middleware on one thousand nodes of the French Grid5000
infrastructure.
","[{'version': 'v1', 'created': 'Wed, 20 Jun 2007 15:17:47 GMT'}]",2007-06-21,"[['Flissi', 'Areski', '', 'LIFL'], ['Merle', 'Philippe', '', 'INRIA Futurs']]","['Grid computing', 'middleware', 'distributed applications', 'deployment', 'software components']"
2654,1212.2414,Maher Salem,Maher Salem and Ulrich Buehler,"Mining Techniques in Network Security to Enhance Intrusion Detection
  Systems","16 pages, 7 figures","ISSN: 0975-2307 , e-ISSN: 0974-9330, 2012",10.5121/ijnsa,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In intrusion detection systems, classifiers still suffer from several
drawbacks such as data dimensionality and dominance, different network feature
types, and data impact on the classification. In this paper two significant
enhancements are presented to solve these drawbacks. The first enhancement is
an improved feature selection using sequential backward search and information
gain. This, in turn, extracts valuable features that enhance positively the
detection rate and reduce the false positive rate. The second enhancement is
transferring nominal network features to numeric ones by exploiting the
discrete random variable and the probability mass function to solve the problem
of different feature types, the problem of data dominance, and data impact on
the classification. The latter is combined to known normalization methods to
achieve a significant hybrid normalization approach. Finally, an intensive and
comparative study approves the efficiency of these enhancements and shows
better performance comparing to other proposed methods.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2012 13:14:42 GMT'}]",2012-12-12,"[['Salem', 'Maher', ''], ['Buehler', 'Ulrich', '']]","['Sequential Backward Search', 'Information Gain', 'Normalization', 'Probability Mass Function', 'DiscreteRandome Variable']"
2655,1003.5956,Lihong Li,Lihong Li and Wei Chu and John Langford and Xuanhui Wang,"Unbiased Offline Evaluation of Contextual-bandit-based News Article
  Recommendation Algorithms","10 pages, 7 figures, revised from the published version at the WSDM
  2011 conference",,10.1145/1935826.1935878,,cs.LG cs.AI cs.RO stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Contextual bandit algorithms have become popular for online recommendation
systems such as Digg, Yahoo! Buzz, and news recommendation in general.
\emph{Offline} evaluation of the effectiveness of new algorithms in these
applications is critical for protecting online user experiences but very
challenging due to their ""partial-label"" nature. Common practice is to create a
simulator which simulates the online environment for the problem at hand and
then run an algorithm against this simulator. However, creating simulator
itself is often difficult and modeling bias is usually unavoidably introduced.
In this paper, we introduce a \emph{replay} methodology for contextual bandit
algorithm evaluation. Different from simulator-based approaches, our method is
completely data-driven and very easy to adapt to different applications. More
importantly, our method can provide provably unbiased evaluations. Our
empirical results on a large-scale news article recommendation dataset
collected from Yahoo! Front Page conform well with our theoretical results.
Furthermore, comparisons between our offline replay and online bucket
evaluation of several contextual bandit algorithms show accuracy and
effectiveness of our offline evaluation method.
","[{'version': 'v1', 'created': 'Wed, 31 Mar 2010 01:20:07 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Mar 2012 23:33:07 GMT'}]",2015-03-13,"[['Li', 'Lihong', ''], ['Chu', 'Wei', ''], ['Langford', 'John', ''], ['Wang', 'Xuanhui', '']]","['Recommendation', 'multi-armed bandit', 'contextual bandit', 'offline evaluation', 'benchmark dataset']"
2656,2105.07940,Peng Liang,Tingting Bi and Peng Liang and Antony Tang and Xin Xia,"Mining Architecture Tactics and Quality Attributes Knowledge in Stack
  Overflow","Preprint accepted for publication in Journal of Systems and Software,
  2021",,10.1016/j.jss.2021.111005,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Context: Architecture Tactics (ATs) are architectural building blocks that
provide general architectural solutions for addressing Quality Attributes (QAs)
issues. Mining and analyzing QA-AT knowledge can help the software architecture
community better understand architecture design. However, manually capturing
and mining this knowledge is labor-intensive and difficult. Objective: Using
Stack Overflow (SO) as our source, our main goals are to effectively mine such
knowledge; and to have some sense of how developers use ATs with respect to QA
concerns from related discussions. Methods: We applied a semi-automatic
dictionary-based mining approach to extract the QA-AT posts in SO. With the
mined QA-AT posts, we identified the relationships between ATs and QAs.
Results: Our approach allow us to mine QA-AT knowledge effectively with an
F-measure of 0.865 and Performance of 82.2%. Using this mining approach, we are
able to discover architectural synonyms of QAs and ATs used by designers, from
which we discover how developers apply ATs to address quality requirements.
Conclusions: We make two contributions in this work: First, we demonstrated a
semi-automatic approach to mine ATs and QAs from SO posts; Second, we
identified little-known design relationships between QAs and ATs and grouped
architectural design considerations to aid architects make architecture tactics
design decisions.
","[{'version': 'v1', 'created': 'Mon, 17 May 2021 15:27:19 GMT'}]",2021-05-18,"[['Bi', 'Tingting', ''], ['Liang', 'Peng', ''], ['Tang', 'Antony', ''], ['Xia', 'Xin', '']]","['Architecture Tactic', 'Quality Attribute', 'Knowledge Mining', 'Empirical Analysis', 'Stack Overflow']"
2657,2105.10930,Roman Kuznets,Iris van der Giessen and Raheleh Jalali and Roman Kuznets,Uniform interpolation via nested sequents and hypersequents,,,10.1007/978-3-030-88853-4_21,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  A modular proof-theoretic framework was recently developed to prove Craig
interpolation for normal modal logics based on generalizations of sequent
calculi (e.g., nested sequents, hypersequents, and labelled sequents). In this
paper, we turn to uniform interpolation, which is stronger than Craig
interpolation. We develop a constructive method for proving uniform
interpolation via nested sequents and apply it to reprove the uniform
interpolation property for normal modal logics $\mathsf{K}$, $\mathsf{D}$, and
$\mathsf{T}$. We then use the know-how developed for nested sequents to apply
the same method to hypersequents and obtain the first direct proof of uniform
interpolation for $\mathsf{S5}$ via a cut-free sequent-like calculus. While our
method is proof-theoretic, the definition of uniform interpolation for nested
sequents and hypersequents also uses semantic notions, including bisimulation
modulo an atomic proposition.
","[{'version': 'v1', 'created': 'Sun, 23 May 2021 13:14:31 GMT'}]",2021-10-12,"[['van der Giessen', 'Iris', ''], ['Jalali', 'Raheleh', ''], ['Kuznets', 'Roman', '']]","['uniform interpolation', 'nested sequents', 'hypersequents', 'modal logic']"
2658,1209.2614,Venkataramana Kanaparti,"K. Venkataramana, M. Padmavathamma",A threshold secure data sharing scheme for federated clouds,"8 pages, 3 Figures, International Journal of Research in Computer
  Science 2012. arXiv admin note: text overlap with arXiv:1003.3920 by other
  authors",,10.7815/ijorcs.25.2012.044,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing allows users to view computing in a new direction, as it uses
the existing technologies to provide better IT services at low-cost. To offer
high QOS to customers according SLA, cloud services broker or cloud service
provider uses individual cloud providers that work collaboratively to form a
federation of clouds. It is required in applications like Real-time online
interactive applications, weather research and forecasting etc., in which the
data and applications are complex and distributed. In these applications secret
data should be shared, so secure data sharing mechanism is required in
Federated clouds to reduce the risk of data intrusion, the loss of service
availability and to ensure data integrity. So In this paper we have proposed
zero knowledge data sharing scheme where Trusted Cloud Authority (TCA) will
control federated clouds for data sharing where the secret to be exchanged for
computation is encrypted and retrieved by individual cloud at the end. Our
scheme is based on the difficulty of solving the Discrete Logarithm problem
(DLOG) in a finite abelian group of large prime order which is NP-Hard. So our
proposed scheme provides data integrity in transit, data availability when one
of host providers are not available during the computation.
","[{'version': 'v1', 'created': 'Wed, 12 Sep 2012 13:44:48 GMT'}]",2012-09-13,"[['Venkataramana', 'K.', ''], ['Padmavathamma', 'M.', '']]","['Cloud computing', 'Federated clouds', 'Secure Data sharing', 'SMC', 'WRF', 'Encrypted secret', 'primitive polynomial', 'primitive number']"
2659,1807.10664,Roberto Metere,"Roberto Metere, Andreas Lindner, Roberto Guanciale",Sound Transpilation from Binary to Machine-Independent Code,,,10.1007/978-3-319-70848-5_13,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to handle the complexity and heterogeneity of mod- ern instruction
set architectures, analysis platforms share a common design, the adoption of
hardware-independent intermediate representa- tions. The usage of these
platforms to verify systems down to binary-level is appealing due to the high
degree of automation they provide. How- ever, it introduces the need for
trusting the correctness of the translation from binary code to intermediate
language. Achieving a high degree of trust is challenging since this
transpilation must handle (i) all the side effects of the instructions, (ii)
multiple instruction encoding (e.g. ARM Thumb), and (iii) variable instruction
length (e.g. Intel). We overcome these problems by formally modeling one of
such intermediate languages in the interactive theorem prover HOL4 and by
implementing a proof- producing transpiler. This tool translates ARMv8 programs
to the in- termediate language and generates a HOL4 proof that demonstrates the
correctness of the translation in the form of a simulation theorem. We also
show how the transpiler theorems can be used to transfer properties verified on
the intermediate language to the binary code.
","[{'version': 'v1', 'created': 'Fri, 27 Jul 2018 14:49:33 GMT'}]",2018-07-30,"[['Metere', 'Roberto', ''], ['Lindner', 'Andreas', ''], ['Guanciale', 'Roberto', '']]","['binary analysis', 'formal verification', 'proof producing analysis', 'theorem proving']"
2660,1805.09120,Patrice Bellot,"Patrice Bellot (LSIS, DIMAG), Wided Bakari, Mahmoud Neji","A logical representation of Arabic questions toward automatic passage
  extraction from the Web",,"International Journal of Speech Technology, Springer Verlag, 2017,
  20 (2), pp.339 - 353",10.1007/s10772-017-9411-7,,cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the expanding growth of Arabic electronic data on the web, extracting
information, which is actually one of the major challenges of the
question-answering, is essentially used for building corpus of documents. In
fact, building a corpus is a research topic that is currently referred to among
some other major themes of conferences, in Natural Language Processing (NLP),
such as, Information Retrieval (IR), Question-Answering (QA), Automatic Summary
(AS), etc. Generally, a question-answering system provides various passages to
answer the user questions. To make these passages truly informative, this
system needs access to an underlying knowledge base; this requires the
construction of a corpus. The aim of our research is to build an Arabic
question-answering system. In addition, analyzing the question must be the
first step. Next, it is essential to retrieve a passage from the web that can
serve as an appropriate answer. In this paper, we propose a method to analysis
the question and retrieve the passage answer in the Arabic language. For the
question analysis, five factual question types are processed. Additionally, our
purpose is to experiment with the generation of a logic representation from the
declarative form of each question. Several studies, deal with the logic
approaches in question-answering, are discussed in other languages than the
Arabic language. This representation is very promising because it helps us
later in the selection of a justifiable answer. The accuracy of questions that
are correctly analyzed and translated into the logic form achieved 64%. And
then, the results of passages of texts that are automatically generated
achieved an 87% score for accuracy and a 98% score for c@1.
","[{'version': 'v1', 'created': 'Wed, 23 May 2018 13:21:40 GMT'}]",2018-05-24,"[['Bellot', 'Patrice', '', 'LSIS, DIMAG'], ['Bakari', 'Wided', ''], ['Neji', 'Mahmoud', '']]","['Arabic', 'question analysis', 'answer passage retrieval', 'logic representation', 'Word Wide Web']"
2661,1806.00750,Mohamed Grissa,"Mohamed Grissa, Bechir Hamdaoui and Attila A. Yavuz",Location Privacy in Cognitive Radio Networks: A Survey,Published in IEEE Communications Surveys and Tutorials,"IEEE Communications Surveys & Tutorials, vol. 19, no. 3, pp.
  1726-1760, thirdquarter 2017",10.1109/COMST.2017.2693965,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cognitive radio networks (CRNs) have emerged as an essential technology to
enable dynamic and opportunistic spectrum access which aims to exploit
underutilized licensed channels to solve the spectrum scarcity problem. Despite
the great benefits that CRNs offer in terms of their ability to improve
spectrum utilization efficiency, they suffer from user location privacy issues.
Knowing that their whereabouts may be exposed can discourage users from joining
and participating in the CRNs, thereby potentially hindering the adoption and
deployment of this technology in future generation networks. The location
information leakage issue in the CRN context has recently started to gain
attention from the research community due to its importance, and several
research efforts have been made to tackle it. However, to the best of our
knowledge, none of these works have tried to identify the vulnerabilities that
are behind this issue or discuss the approaches that could be deployed to
prevent it. In this paper, we try to fill this gap by providing a comprehensive
survey that investigates the various location privacy risks and threats that
may arise from the different components of this CRN technology, and explores
the different privacy attacks and countermeasure solutions that have been
proposed in the literature to cope with this location privacy issue. We also
discuss some open research problems, related to this issue, that need to be
overcome by the research community to take advantage of the benefits of this
key CRN technology without having to sacrifice the users' privacy.
","[{'version': 'v1', 'created': 'Sun, 3 Jun 2018 08:19:38 GMT'}]",2018-06-05,"[['Grissa', 'Mohamed', ''], ['Hamdaoui', 'Bechir', ''], ['Yavuz', 'Attila A.', '']]","['Location privacy', 'cognitive radio networks', 'dynamic spectrum access', 'privacy preserving protocols']"
2662,1809.00084,Ishtar Nyawira,"Ishtar Nyawira, Kristi Bushman, Iris Qian, Annie Zhang","Understanding Neural Pathways in Zebrafish through Deep Learning and
  High Resolution Electron Microscope Data","8 pages, 5 figures (1a to 5c), PEARC '18: Practice and Experience in
  Advanced Research Computing, July 22--26, 2018, Pittsburgh, PA, USA","PEARC '18 Proceedings of the Practice and Experience on Advanced
  Research Computing, Article No. 65, 2018",10.1145/3219104.3229285,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The tracing of neural pathways through large volumes of image data is an
incredibly tedious and time-consuming process that significantly encumbers
progress in neuroscience. We are exploring deep learning's potential to
automate segmentation of high-resolution scanning electron microscope (SEM)
image data to remove that barrier. We have started with neural pathway tracing
through 5.1GB of whole-brain serial-section slices from larval zebrafish
collected by the Center for Brain Science at Harvard University. This kind of
manual image segmentation requires years of careful work to properly trace the
neural pathways in an organism as small as a zebrafish larva (approximately 5mm
in total body length). In automating this process, we would vastly improve
productivity, leading to faster data analysis and breakthroughs in
understanding the complexity of the brain. We will build upon prior attempts to
employ deep learning for automatic image segmentation extending methods for
unconventional deep learning data.
","[{'version': 'v1', 'created': 'Fri, 31 Aug 2018 23:42:11 GMT'}]",2018-09-05,"[['Nyawira', 'Ishtar', ''], ['Bushman', 'Kristi', ''], ['Qian', 'Iris', ''], ['Zhang', 'Annie', '']]","['Deep Learning', 'Convolutional Neural Networks', 'Machine Learning', 'Artificial Intelligence', 'Biomedical Image Processing']"
2663,1912.06863,Ronny Chevalier,"Ronny Chevalier, David Plaquin, Chris Dalton, Guillaume Hiet","Survivor: A Fine-Grained Intrusion Response and Recovery Approach for
  Commodity Operating Systems","The final version of this paper has been published in the Proceedings
  of the 35th Annual Computer Security Applications Conference (ACSAC), 2019.
  14 pages, 5 figures, 6 tables","Proceedings of the 35th Annual Computer Security Applications
  Conference. ACM, 2019. p. 762-775",10.1145/3359789.3359792,,cs.CR cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the deployment of preventive security mechanisms to protect the
assets and computing platforms of users, intrusions eventually occur. We
propose a novel intrusion survivability approach to withstand ongoing
intrusions. Our approach relies on an orchestration of fine-grained recovery
and per-service responses (e.g., privileges removal). Such an approach may put
the system into a degraded mode. This degraded mode prevents attackers to
reinfect the system or to achieve their goals if they managed to reinfect it.
It maintains the availability of core functions while waiting for patches to be
deployed. We devised a cost-sensitive response selection process to ensure that
while the service is in a degraded mode, its core functions are still
operating. We built a Linux-based prototype and evaluated the effectiveness of
our approach against different types of intrusions. The results show that our
solution removes the effects of the intrusions, that it can select appropriate
responses, and that it allows services to survive when reinfected. In terms of
performance overhead, in most cases, we observed a small overhead, except in
the rare case of services that write many small files asynchronously in a
burst, where we observed a higher but acceptable overhead.
","[{'version': 'v1', 'created': 'Sat, 14 Dec 2019 15:17:00 GMT'}]",2019-12-17,"[['Chevalier', 'Ronny', ''], ['Plaquin', 'David', ''], ['Dalton', 'Chris', ''], ['Hiet', 'Guillaume', '']]","['Intrusion Survivability', 'Intrusion Response', 'Intrusion Recovery']"
2664,1807.07559,Amelia Jim\'enez-S\'anchez,"Amelia Jim\'enez-S\'anchez, Shadi Albarqouni, Diana Mateus",Capsule Networks against Medical Imaging Data Challenges,"10 pages, 3 figures, accepted at MICCAI-LABELS 2018 Workshop","LABELS 2018, CVII 2018, STENT 2018: Intravascular Imaging and
  Computer Assisted Stenting and Large-Scale Annotation of Biomedical Data and
  Expert Label Synthesis pp 150-160",10.1007/978-3-030-01364-6_17,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A key component to the success of deep learning is the availability of
massive amounts of training data. Building and annotating large datasets for
solving medical image classification problems is today a bottleneck for many
applications. Recently, capsule networks were proposed to deal with
shortcomings of Convolutional Neural Networks (ConvNets). In this work, we
compare the behavior of capsule networks against ConvNets under typical
datasets constraints of medical image analysis, namely, small amounts of
annotated data and class-imbalance. We evaluate our experiments on MNIST,
Fashion-MNIST and medical (histological and retina images) publicly available
datasets. Our results suggest that capsule networks can be trained with less
amount of data for the same or better performance and are more robust to an
imbalanced class distribution, which makes our approach very promising for the
medical imaging community.
","[{'version': 'v1', 'created': 'Thu, 19 Jul 2018 17:56:37 GMT'}]",2019-02-05,"[['Jiménez-Sánchez', 'Amelia', ''], ['Albarqouni', 'Shadi', ''], ['Mateus', 'Diana', '']]","['capsule networks', 'small datasets', 'class imbalance']"
2665,1310.8059,Thabet Slimani,Thabet Slimani,Description and Evaluation of Semantic Similarity Measures Approaches,10 pages,"International Journal of Computer Applications 80(10):25-33,
  October 2013. Published by Foundation of Computer Science, New York, USA",10.5120/13897-1851,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, semantic similarity measure has a great interest in Semantic
Web and Natural Language Processing (NLP). Several similarity measures have
been developed, being given the existence of a structured knowledge
representation offered by ontologies and corpus which enable semantic
interpretation of terms. Semantic similarity measures compute the similarity
between concepts/terms included in knowledge sources in order to perform
estimations. This paper discusses the existing semantic similarity methods
based on structure, information content and feature approaches. Additionally,
we present a critical evaluation of several categories of semantic similarity
approaches based on two standard benchmarks. The aim of this paper is to give
an efficient evaluation of all these measures which help researcher and
practitioners to select the measure that best fit for their requirements.
","[{'version': 'v1', 'created': 'Wed, 30 Oct 2013 08:08:43 GMT'}]",2013-10-31,"[['Slimani', 'Thabet', '']]","['Similarity Measure', 'structure-based measures', 'edge-counting', 'feature-based measures', 'hybrid measures', 'Wornet', 'MeSH ontology']"
2666,2105.12842,Dan Zhang,"Dan Zhang, Safeen Huda, Ebrahim Songhori, Kartik Prabhu, Quoc Le, Anna
  Goldie, Azalia Mirhoseini","A Full-Stack Search Technique for Domain Optimized Deep Learning
  Accelerators",Fixed typo,,10.1145/3503222.3507767,,cs.LG cs.AR cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rapidly-changing deep learning landscape presents a unique opportunity
for building inference accelerators optimized for specific datacenter-scale
workloads. We propose Full-stack Accelerator Search Technique (FAST), a
hardware accelerator search framework that defines a broad optimization
environment covering key design decisions within the hardware-software stack,
including hardware datapath, software scheduling, and compiler passes such as
operation fusion and tensor padding. In this paper, we analyze bottlenecks in
state-of-the-art vision and natural language processing (NLP) models, including
EfficientNet and BERT, and use FAST to design accelerators capable of
addressing these bottlenecks. FAST-generated accelerators optimized for single
workloads improve Perf/TDP by 3.7x on average across all benchmarks compared to
TPU-v3. A FAST-generated accelerator optimized for serving a suite of workloads
improves Perf/TDP by 2.4x on average compared to TPU-v3. Our return on
investment analysis shows that FAST-generated accelerators can potentially be
practical for moderate-sized datacenter deployments.
","[{'version': 'v1', 'created': 'Wed, 26 May 2021 21:10:20 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Jan 2022 23:34:48 GMT'}, {'version': 'v3', 'created': 'Tue, 1 Feb 2022 10:18:52 GMT'}]",2022-02-02,"[['Zhang', 'Dan', ''], ['Huda', 'Safeen', ''], ['Songhori', 'Ebrahim', ''], ['Prabhu', 'Kartik', ''], ['Le', 'Quoc', ''], ['Goldie', 'Anna', ''], ['Mirhoseini', 'Azalia', '']]","['machine learning', 'tensor processing unit', 'hardware-software codesign', 'design space exploration', 'operation fusion']"
2667,1901.00450,Andres Ferraro,"Andres Ferraro, Dmitry Bogdanov, Jisang Yoon, KwangSeob Kim and Xavier
  Serra","Automatic playlist continuation using a hybrid recommender system
  combining features from text and audio",5 pages,"Proceeding RecSys Challenge '18 Proceedings of the ACM Recommender
  Systems Challenge 2018",10.1145/3267471.3267473,,cs.IR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ACM RecSys Challenge 2018 focuses on music recommendation in the context
of automatic playlist continuation. In this paper, we describe our approach to
the problem and the final hybrid system that was submitted to the challenge by
our team Cocoplaya. This system consists in combining the recommendations
produced by two different models using ranking fusion. The first model is based
on Matrix Factorization and it incorporates information from tracks' audio and
playlist titles. The second model generates recommendations based on typical
track co-occurrences considering their proximity in the playlists. The proposed
approach is efficient and achieves a good overall performance, with our model
ranked 4th on the creative track of the challenge leaderboard.
","[{'version': 'v1', 'created': 'Wed, 2 Jan 2019 16:49:06 GMT'}]",2019-01-03,"[['Ferraro', 'Andres', ''], ['Bogdanov', 'Dmitry', ''], ['Yoon', 'Jisang', ''], ['Kim', 'KwangSeob', ''], ['Serra', 'Xavier', '']]","['music recommender systems', 'automatic playlist continuation', 'collaborative filtering', 'content-aware recommendation', 'challenges']"
2668,2010.14228,Michael Lyons,"Ivan Poupyrev, Michael J. Lyons, Sidney Fels, Tina Blaine (Bean)",New interfaces for musical expression,"2 pages, This item describes the CHI'01 workshop which started the
  International Conference on New Interfaces for Musical Expression","ACM CHI'01 Extended Abstracts on Human Factors in Computing
  Systems, March 2001 Pages 491-492",10.1145/634067.634348,,cs.HC cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  The rapid evolution of electronics, digital media, advanced materials, and
other areas of technology, is opening up unprecedented opportunities for
musical interface inventors and designers. The possibilities afforded by these
new technologies carry with them the challenges of a complex and often
confusing array of choices for musical composers and performers. New musical
technologies are at least partly responsible for the current explosion of new
musical forms, some of which are controversial and challenge traditional
definitions of music. Alternative musical controllers, currently the leading
edge of the ongoing dialogue between technology and musical culture, involve
many of the issues covered at past CHI meetings. This workshop brings together
interface experts interested in musical controllers and musicians and composers
involved in the development of new musical interfaces.
","[{'version': 'v1', 'created': 'Tue, 27 Oct 2020 11:59:44 GMT'}]",2020-10-28,"[['Poupyrev', 'Ivan', '', 'Bean'], ['Lyons', 'Michael J.', '', 'Bean'], ['Fels', 'Sidney', '', 'Bean'], ['Blaine', 'Tina', '', 'Bean']]","['musical controllers', 'musical expression', 'computer and electronic music', 'sound synthesis', 'MIDI']"
2669,1811.10498,Vajira Thambawita,Vajira Thambawita and Roshan G. Ragel and Dhammike Elkaduwe,"An optimized Parallel Failure-less Aho-Corasick algorithm for DNA
  sequence matching","6 pages, 3 figures, 4 tables, 5 graphs, 2016 IEEE International
  Conference on Information and Automation for Sustainability (ICIAfS)",,10.1109/ICIAFS.2016.7946533,,cs.DC cs.DS cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Aho-Corasick algorithm is multiple patterns searching algorithm running
sequentially in various applications like network intrusion detection and
bioinformatics for finding several input strings within a given large input
string. The parallel version of the Aho-Corasick algorithm is called as
Parallel Failure-less Aho-Corasick algorithm because it doesn't need failure
links like in the original Aho-Corasick algorithm. In this research, we
implemented an application specific parallel failureless Aho-Corasick algorithm
to the general purpose graphics processing unit by applying several cache
optimization techniques for matching DNA sequences. Our parallel Aho-Corasick
algorithm shows better performance than the available parallel Aho-Corasick
algorithm library due to its simplicity and optimized cache memory usage of
graphics processing units for matching DNA sequences.
","[{'version': 'v1', 'created': 'Mon, 26 Nov 2018 16:45:30 GMT'}]",2018-11-27,"[['Thambawita', 'Vajira', ''], ['Ragel', 'Roshan G.', ''], ['Elkaduwe', 'Dhammike', '']]","['Aho-Corasick', 'GPGPU', 'DNA sequence matching']"
2670,1402.2793,Daniel Krzywicki,"D. Krzywicki, {\L}. Faber, A. Byrski, M. Kisiel-Dorohinicki",Computing Agents for Decision Support Systems,,"Future Generation Computer Systems, Volume 37, July 2014, Pages
  390-400",10.1016/j.future.2014.02.002,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In decision support systems, it is essential to get a candidate solution
fast, even if it means resorting to an approximation. This constraint
introduces a scalability requirement with regard to the kind of heuristics
which can be used in such systems. As execution time is bounded, these
algorithms need to give better results and scale up with additional computing
resources instead of additional time. In this paper, we show how multi-agent
systems can fulfil these requirements. We recall as an example the concept of
Evolutionary Multi-Agent Systems, which combine evolutionary and agent
computing paradigms. We describe several possible implementations and present
experimental results demonstrating how additional resources improve the
efficiency of such systems.
","[{'version': 'v1', 'created': 'Wed, 12 Feb 2014 11:42:36 GMT'}, {'version': 'v2', 'created': 'Wed, 21 May 2014 12:24:08 GMT'}]",2014-05-22,"[['Krzywicki', 'D.', ''], ['Faber', 'Ł.', ''], ['Byrski', 'A.', ''], ['Kisiel-Dorohinicki', 'M.', '']]","['Decision Support Systems', 'Multi-agent Systems', 'Scalability', 'Performance']"
2671,1810.07619,Christian Krogh,"Christian Krogh, Johnny Jakobsen and James A. Sherwood","Development of a Computationally Efficient Fabric Model for Optimization
  of Gripper Trajectories in Automated Composite Draping",,"EngOpt 2018: EngOpt 2018 Proceedings of the 6th International
  Conference on Engineering Optimization pp 1107-1118",10.1007/978-3-319-97773-7_96,,cs.CE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  An automated prepreg fabric draping system is being developed which consists
of an array of actuated grippers. It has the ability to pick up a fabric ply
and place it onto a double-curved mold surface. A previous research effort
based on a nonlinear Finite Element model showed that the movements of the
grippers should be chosen carefully to avoid misplacement and induce of
wrinkles in the draped configuration. Thus, the present study seeks to develop
a computationally efficient model of the mechanical behavior of a fabric based
on 2D catenaries which can be used for optimization of the gripper
trajectories. The model includes bending stiffness, large deflections, large
ply shear and a simple contact formulation. The model is found to be quick to
evaluate and gives very reasonable predictions of the displacement field.
","[{'version': 'v1', 'created': 'Wed, 17 Oct 2018 15:36:02 GMT'}]",2021-03-09,"[['Krogh', 'Christian', ''], ['Jakobsen', 'Johnny', ''], ['Sherwood', 'James A.', '']]","['Composites', 'carbon fiber prepreg', 'draping', 'trajectory optimization']"
2672,1111.4034,Sumit Katiyar,"Sumit Katiyar, R. K. Jain and N. K. Agarwal","Proposed Cellular Network for Indian Conditions for Enhancement of
  Spectral Density and Reduction of Power Consumption & RF Pollution","5 pages, 7 figures and IEEE international conference; IEEE
  international conference, ICCCT-2011",,10.1109/ICCCT.2011.6075182,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the exponentially increasing demand for wireless communications the
capacity of current cellular systems will soon become incapable of handling the
growing traffic. Since radio frequencies are diminishing natural resources,
there seems to be a fundamental barrier to further capacity increase. The
solution can be found by using smart antenna systems. Smart or adaptive antenna
arrays consist of an array of antenna elements with signal processing
capability that optimizes the radiation and reception of a desired signal,
dynamically. Smart antenna can place nulls in the direction of interferers via
adapting adaptive updating of weights linked to each antenna element. They thus
cancel out most of the cochannel interference resulting in better quality of
reception and lower dropped calls. Smart antenna can also track the user within
a cell via direction of arrival algorithms. This paper focuses on about the
smart antenna in hierarchical cell clustering (overlay-underlay) with demand
based frequency allocation techniques in cellular mobile radio networks in
INDIA.
","[{'version': 'v1', 'created': 'Thu, 17 Nov 2011 08:42:57 GMT'}]",2016-11-15,"[['Katiyar', 'Sumit', ''], ['Jain', 'R. K.', ''], ['Agarwal', 'N. K.', '']]","['Smart / Adaptive Antenna', 'Co-channel Interference', 'Beam forming', 'Overlay-Underlay Hierarchy', 'Macro', 'Micro and Picocells']"
2673,1405.3539,Fionn Murtagh,"Fionn Murtagh, Adam Ganz","Pattern Recognition in Narrative: Tracking Emotional Expression in
  Context","21 pages, 7 figures","Journal of Data Mining & Digital Humanities, 2015 (May 26, 2015)
  jdmdh:647",10.46298/jdmdh.647,,cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using geometric data analysis, our objective is the analysis of narrative,
with narrative of emotion being the focus in this work. The following two
principles for analysis of emotion inform our work. Firstly, emotion is
revealed not as a quality in its own right but rather through interaction. We
study the 2-way relationship of Ilsa and Rick in the movie Casablanca, and the
3-way relationship of Emma, Charles and Rodolphe in the novel {\em Madame
Bovary}. Secondly, emotion, that is expression of states of mind of subjects,
is formed and evolves within the narrative that expresses external events and
(personal, social, physical) context. In addition to the analysis methodology
with key aspects that are innovative, the input data used is crucial. We use,
firstly, dialogue, and secondly, broad and general description that
incorporates dialogue. In a follow-on study, we apply our unsupervised
narrative mapping to data streams with very low emotional expression. We map
the narrative of Twitter streams. Thus we demonstrate map analysis of general
narratives.
","[{'version': 'v1', 'created': 'Wed, 14 May 2014 15:29:48 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Jan 2015 14:00:50 GMT'}, {'version': 'v3', 'created': 'Mon, 4 May 2015 22:16:39 GMT'}]",2021-07-01,"[['Murtagh', 'Fionn', ''], ['Ganz', 'Adam', '']]","['narrative data mining', 'unsupervised classification', 'hierarchical classification', 'correspondence analysis', 'semantics', 'literature', 'filmscript', 'Twitter']"
2674,1711.06839,Eli (Omid) David,"Eli David, Moshe Koppel, Nathan S. Netanyahu",Genetic Algorithms for Mentor-Assisted Evaluation Function Optimization,"Winner of Best Paper Award in GECCO 2008. arXiv admin note:
  substantial text overlap with arXiv:1711.06840, arXiv:1711.06841","ACM Genetic and Evolutionary Computation Conference (GECCO), pages
  1469-1475, Atlanta, GA, July 2008",10.1145/1389095.1389382,,cs.NE cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we demonstrate how genetic algorithms can be used to reverse
engineer an evaluation function's parameters for computer chess. Our results
show that using an appropriate mentor, we can evolve a program that is on par
with top tournament-playing chess programs, outperforming a two-time World
Computer Chess Champion. This performance gain is achieved by evolving a
program with a smaller number of parameters in its evaluation function to mimic
the behavior of a superior mentor which uses a more extensive evaluation
function. In principle, our mentor-assisted approach could be used in a wide
range of problems for which appropriate mentors are available.
","[{'version': 'v1', 'created': 'Sat, 18 Nov 2017 10:12:02 GMT'}]",2017-11-21,"[['David', 'Eli', ''], ['Koppel', 'Moshe', ''], ['Netanyahu', 'Nathan S.', '']]","['Computer chess', 'Fitness evaluation', 'Games', 'Genetic algorithms', 'Parameter tuning']"
2675,1405.4574,Kristjan Greenewald,Kristjan H. Greenewald and Alfred O. Hero III,"Kronecker PCA Based Spatio-Temporal Modeling of Video for Dismount
  Classification","8 pages. To appear in Proceeding of SPIE DSS. arXiv admin note: text
  overlap with arXiv:1402.5568",,10.1117/12.2050184,,cs.CV stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the application of KronPCA spatio-temporal modeling techniques
[Greenewald et al 2013, Tsiligkaridis et al 2013] to the extraction of
spatiotemporal features for video dismount classification. KronPCA performs a
low-rank type of dimensionality reduction that is adapted to spatio-temporal
data and is characterized by the T frame multiframe mean and covariance of p
spatial features. For further regularization and improved inverse estimation,
we also use the diagonally corrected KronPCA shrinkage methods we presented in
[Greenewald et al 2013]. We apply this very general method to the modeling of
the multivariate temporal behavior of HOG features extracted from pedestrian
bounding boxes in video, with gender classification in a challenging dataset
chosen as a specific application. The learned covariances for each class are
used to extract spatiotemporal features which are then classified, achieving
competitive classification performance.
","[{'version': 'v1', 'created': 'Mon, 19 May 2014 01:22:34 GMT'}]",2015-06-19,"[['Greenewald', 'Kristjan H.', ''], ['Hero', 'Alfred O.', 'III']]","['Gender classification', 'spatio-temporal modeling', 'Kronecker PCA', 'covariance estimation']"
2676,1509.06553,Vidyadhar Rao,"Vidyadhar Rao, Prateek Jain, C.V Jawahar",Diverse Yet Efficient Retrieval using Hash Functions,10 pages,,10.1145/2911996.2911998,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Typical retrieval systems have three requirements: a) Accurate retrieval
i.e., the method should have high precision, b) Diverse retrieval, i.e., the
obtained set of points should be diverse, c) Retrieval time should be small.
However, most of the existing methods address only one or two of the above
mentioned requirements. In this work, we present a method based on randomized
locality sensitive hashing which tries to address all of the above requirements
simultaneously. While earlier hashing approaches considered approximate
retrieval to be acceptable only for the sake of efficiency, we argue that one
can further exploit approximate retrieval to provide impressive trade-offs
between accuracy and diversity. We extend our method to the problem of
multi-label prediction, where the goal is to output a diverse and accurate set
of labels for a given document in real-time. Moreover, we introduce a new
notion to simultaneously evaluate a method's performance for both the precision
and diversity measures. Finally, we present empirical results on several
different retrieval tasks and show that our method retrieves diverse and
accurate images/labels while ensuring $100x$-speed-up over the existing diverse
retrieval approaches.
","[{'version': 'v1', 'created': 'Tue, 22 Sep 2015 11:38:20 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Oct 2015 17:05:25 GMT'}]",2020-08-25,"[['Rao', 'Vidyadhar', ''], ['Jain', 'Prateek', ''], ['Jawahar', 'C. V', '']]","['Randomness', 'Approximation', 'Hash Functions', 'Diversity']"
2677,1608.05170,Cory James Kleinheksel,Cory J. Kleinheksel and Arun K. Somani,"Resource efficient redundancy using quorum-based cycle routing in
  optical networks","17th International Conference on Transparent Optical Networks
  (ICTON), 5-9 July 2015. arXiv admin note: substantial text overlap with
  arXiv:1608.05172, arXiv:1608.05168","2015 17th International Conference on Transparent Optical Networks
  (ICTON), Budapest, 2015, pp. 1-4",10.1109/ICTON.2015.7193340,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a cycle redundancy technique that provides optical
networks almost fault-tolerant point-to-point and multipoint-to-multipoint
communications. The technique more importantly is shown to approximately halve
the necessary light-trail resources in the network while maintaining the
fault-tolerance and dependability expected from cycle-based routing. For
efficiency and distributed control, it is common in distributed systems and
algorithms to group nodes into intersecting sets referred to as quorum sets.
Optimal communication quorum sets forming optical cycles based on light-trails
have been shown to flexibly and efficiently route both point-to-point and
multipoint-to-multipoint traffic requests. Commonly cycle routing techniques
will use pairs of cycles to achieve both routing and fault-tolerance, which
uses substantial resources and creates the potential for underutilization.
Instead, we intentionally utilize redundancy within the quorum cycles for
fault-tolerance such that almost every point-to-point communication occurs in
more than one cycle. The result is a set of cycles with 96.60% - 99.37% fault
coverage, while using 42.9% - 47.18% fewer resources.
","[{'version': 'v1', 'created': 'Thu, 18 Aug 2016 04:35:50 GMT'}]",2016-08-20,"[['Kleinheksel', 'Cory J.', ''], ['Somani', 'Arun K.', '']]","['optical fiber networks', 'WDM networks', 'routing', 'fault tolerance', 'unicast', 'multicast communication']"
2678,1006.1192,Secretary Aircc Journal,Ruchira Naskar and Indranil Sengupta,Secret Sharing and Proactive Renewal of Shares in Hierarchical Groups,20 Pages,"International Journal of Computer Science and Information
  Technology 2.3 (2010) 160-179",10.5121/ijcsit.2010.2312,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Secret sharing in user hierarchy represents a challenging area for research.
Although a lot of work has already been done in this direc- tion, this paper
presents a novel approach to share a secret among a hierarchy of users while
overcoming the limitations of the already exist- ing mechanisms. Our work is
based on traditional (k +1; n)-threshold secret sharing, which is secure as
long as an adversary can compromise not more than k secret shares. But in real
life it is often feasible for an adversary to obtain more than k shares over a
long period of time. So, in our work we also present a way to overcome this
vulnerability, while implementing our hierarchical secret sharing scheme. The
use of Elliptic Curve Cryptography makes the computations easier and faster in
our work.
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2010 07:31:09 GMT'}]",2010-07-15,"[['Naskar', 'Ruchira', ''], ['Sengupta', 'Indranil', '']]","['Threshold secret sharing', 'User hierarchy', 'Proactive secret sharing', 'Elliptic curve cryptography']"
2679,2003.12841,Simone Fontana,"Simone Fontana, Daniele Cattaneo, Augusto Luis Ballardini, Matteo
  Vaghi and Domenico Giorgio Sorrenti",A Benchmark for Point Clouds Registration Algorithms,,"Robotics and Autonomous Systems, 2021, 140: 103734",10.1016/j.robot.2021.103734,,cs.RO cs.CV,http://creativecommons.org/licenses/by-sa/4.0/,"  Point clouds registration is a fundamental step of many point clouds
processing pipelines; however, most algorithms are tested on data that are
collected ad-hoc and not shared with the research community. These data often
cover only a very limited set of use cases; therefore, the results cannot be
generalised. Public datasets proposed until now, taken individually, cover only
a few kinds of environment and mostly a single sensor. For these reasons, we
developed a benchmark, for localization and mapping applications, using
multiple publicly available datasets. In this way, we are able to cover many
kinds of environment and many kinds of sensor that can produce point clouds.
Furthermore, the ground truth has been thoroughly inspected and evaluated to
ensure its quality. For some of the datasets, the accuracy of the ground truth
measuring system was not reported by the original authors, therefore we
estimated it with our own novel method, based on an iterative registration
algorithm. Along with the data, we provide a broad set of registration
problems, chosen to cover different types of initial misalignment, various
degrees of overlap, and different kinds of registration problems. Lastly, we
propose a metric to measure the performances of registration algorithms: it
combines the commonly used rotation and translation errors together, to allow
an objective comparison of the alignments. This work aims at encouraging
authors to use a public and shared benchmark, instead of data collected ad-hoc,
to ensure objectivity and repeatability, two fundamental characteristics in any
scientific field.
","[{'version': 'v1', 'created': 'Sat, 28 Mar 2020 17:02:26 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Apr 2020 09:11:23 GMT'}, {'version': 'v3', 'created': 'Tue, 26 Apr 2022 12:23:52 GMT'}]",2022-04-27,"[['Fontana', 'Simone', ''], ['Cattaneo', 'Daniele', ''], ['Ballardini', 'Augusto Luis', ''], ['Vaghi', 'Matteo', ''], ['Sorrenti', 'Domenico Giorgio', '']]","['benchmark', 'point clouds registration', 'datasets']"
2680,1705.08200,Chaoyang Song,Fang Wan and Chaoyang Song,Logical Learning Through a Hybrid Neural Network with Auxiliary Inputs,"11 pages, 9 figures, 4 tables","Front. Robot. AI, 30 July 2018",10.3389/frobt.2018.00086,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The human reasoning process is seldom a one-way process from an input leading
to an output. Instead, it often involves a systematic deduction by ruling out
other possible outcomes as a self-checking mechanism. In this paper, we
describe the design of a hybrid neural network for logical learning that is
similar to the human reasoning through the introduction of an auxiliary input,
namely the indicators, that act as the hints to suggest logical outcomes. We
generate these indicators by digging into the hidden information buried
underneath the original training data for direct or indirect suggestions. We
used the MNIST data to demonstrate the design and use of these indicators in a
convolutional neural network. We trained a series of such hybrid neural
networks with variations of the indicators. Our results show that these hybrid
neural networks are very robust in generating logical outcomes with inherently
higher prediction accuracy than the direct use of the original input and output
in apparent models. Such improved predictability with reassured logical
confidence is obtained through the exhaustion of all possible indicators to
rule out all illogical outcomes, which is not available in the apparent models.
Our logical learning process can effectively cope with the unknown unknowns
using a full exploitation of all existing knowledge available for learning. The
design and implementation of the hints, namely the indicators, become an
essential part of artificial intelligence for logical learning. We also
introduce an ongoing application setup for this hybrid neural network in an
autonomous grasping robot, namely as_DeepClaw, aiming at learning an optimized
grasping pose through logical learning.
","[{'version': 'v1', 'created': 'Tue, 23 May 2017 12:11:30 GMT'}]",2020-03-10,"[['Wan', 'Fang', ''], ['Song', 'Chaoyang', '']]","['logic reasoning', 'hybrid neural network', 'deep learning', 'robotic grasping']"
2681,1503.00361,Jinseok Kim,Jinseok Kim and Jana Diesner,"Coauthorship networks: A directed network approach considering the order
  and number of coauthors","This is a preprint of an article accepted for publication in Journal
  of the Association for Information Science and Technology",,10.1002/asi.23361,,cs.DL cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many scientific fields, the order of coauthors on a paper conveys
information about each individual's contribution to a piece of joint work. We
argue that in prior network analyses of coauthorship networks, the information
on ordering has been insufficiently considered because ties between authors are
typically symmetrized. This is basically the same as assuming that each
co-author has contributed equally to a paper. We introduce a solution to this
problem by adopting a coauthorship credit allocation model proposed by Kim and
Diesner (2014), which in its core conceptualizes co-authoring as a directed,
weighted, and self-looped network. We test and validate our application of the
adopted framework based on a sample data of 861 authors who have published in
the journal Psychometrika. Results suggest that this novel sociometric approach
can complement traditional measures based on undirected networks and expand
insights into coauthoring patterns such as the hierarchy of collaboration among
scholars. As another form of validation, we also show how our approach
accurately detects prominent scholars in the Psychometric Society affiliated
with the journal.
","[{'version': 'v1', 'created': 'Sun, 1 Mar 2015 22:01:49 GMT'}]",2015-03-31,"[['Kim', 'Jinseok', ''], ['Diesner', 'Jana', '']]","['social network analysis', 'coauthorship network', 'coauthor order', 'bibliometrics', 'sociology of science']"
2682,1706.02434,D\'ario Oliveira,"Dario Augusto Borges Oliveira, Laura Leal-Taixe, Raul Queiroz Feitosa,
  Bodo Rosenhahn","Automatic tracking of vessel-like structures from a single starting
  point",,,10.1016/j.compmedimag.2015.11.002,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The identification of vascular networks is an important topic in the medical
image analysis community. While most methods focus on single vessel tracking,
the few solutions that exist for tracking complete vascular networks are
usually computationally intensive and require a lot of user interaction. In
this paper we present a method to track full vascular networks iteratively
using a single starting point. Our approach is based on a cloud of sampling
points distributed over concentric spherical layers. We also proposed a vessel
model and a metric of how well a sample point fits this model. Then, we
implement the network tracking as a min-cost flow problem, and propose a novel
optimization scheme to iteratively track the vessel structure by inherently
handling bifurcations and paths. The method was tested using both synthetic and
real images. On the 9 different data-sets of synthetic blood vessels, we
achieved maximum accuracies of more than 98\%. We further use the synthetic
data-set to analyse the sensibility of our method to parameter setting, showing
the robustness of the proposed algorithm. For real images, we used coronary,
carotid and pulmonary data to segment vascular structures and present the
visual results. Still for real images, we present numerical and visual results
for networks of nerve fibers in the olfactory system. Further visual results
also show the potential of our approach for identifying vascular networks
topologies. The presented method delivers good results for the several
different datasets tested and have potential for segmenting vessel-like
structures. Also, the topology information, inherently extracted, can be used
for further analysis to computed aided diagnosis and surgical planning.
Finally, the method's modular aspect holds potential for problem-oriented
adjustments and improvements.
","[{'version': 'v1', 'created': 'Thu, 8 Jun 2017 02:45:27 GMT'}]",2017-06-09,"[['Oliveira', 'Dario Augusto Borges', ''], ['Leal-Taixe', 'Laura', ''], ['Feitosa', 'Raul Queiroz', ''], ['Rosenhahn', 'Bodo', '']]","['vascular network tracking', 'linear programming', 'vesselcharacterization', 'medical imaging']"
2683,1509.02597,Tsung-Hui Chang,"Tsung-Hui Chang, Mingyi Hong, Wei-Cheng Liao and Xiangfeng Wang","Asynchronous Distributed ADMM for Large-Scale Optimization- Part I:
  Algorithm and Convergence Analysis",37 pages,,10.1109/TSP.2016.2537271,,cs.DC cs.LG cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aiming at solving large-scale learning problems, this paper studies
distributed optimization methods based on the alternating direction method of
multipliers (ADMM). By formulating the learning problem as a consensus problem,
the ADMM can be used to solve the consensus problem in a fully parallel fashion
over a computer network with a star topology. However, traditional synchronized
computation does not scale well with the problem size, as the speed of the
algorithm is limited by the slowest workers. This is particularly true in a
heterogeneous network where the computing nodes experience different
computation and communication delays. In this paper, we propose an asynchronous
distributed ADMM (AD-AMM) which can effectively improve the time efficiency of
distributed optimization. Our main interest lies in analyzing the convergence
conditions of the AD-ADMM, under the popular partially asynchronous model,
which is defined based on a maximum tolerable delay of the network.
Specifically, by considering general and possibly non-convex cost functions, we
show that the AD-ADMM is guaranteed to converge to the set of
Karush-Kuhn-Tucker (KKT) points as long as the algorithm parameters are chosen
appropriately according to the network delay. We further illustrate that the
asynchrony of the ADMM has to be handled with care, as slightly modifying the
implementation of the AD-ADMM can jeopardize the algorithm convergence, even
under a standard convex setting.
","[{'version': 'v1', 'created': 'Wed, 9 Sep 2015 01:45:08 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Feb 2016 06:02:38 GMT'}]",2016-05-04,"[['Chang', 'Tsung-Hui', ''], ['Hong', 'Mingyi', ''], ['Liao', 'Wei-Cheng', ''], ['Wang', 'Xiangfeng', '']]","['− Distributed optimization', 'ADMM', 'Asynchronous', 'Consensus optimization']"
2684,1807.05754,Meredydd Williams,"Meredydd Williams, Jason R. C. Nurse, Sadie Creese",The Perfect Storm: The Privacy Paradox and the Internet-of-Things,"9 pages, 1 figure, Proceedings of the 11th International Conference
  on Availability, Reliability and Security (ARES) (2016)",,10.1109/ARES.2016.25,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Privacy is a concept found throughout human history and opinion polls suggest
that the public value this principle. However, while many individuals claim to
care about privacy, they are often perceived to express behaviour to the
contrary. This phenomenon is known as the Privacy Paradox and its existence has
been validated through numerous psychological, economic and computer science
studies. Several contributory factors have been suggested including user
interface design, risk salience, social norms and default configurations. We
posit that the further proliferation of the Internet-of-Things (IoT) will
aggravate many of these factors, posing even greater risks to individuals'
privacy. This paper explores the evolution of both the paradox and the IoT,
discusses how privacy risk might alter over the coming years, and suggests
further research required to address a reasonable balance. We believe both
technological and socio-technical measures are necessary to ensure privacy is
protected in a world of ubiquitous technology.
","[{'version': 'v1', 'created': 'Mon, 16 Jul 2018 09:33:34 GMT'}]",2018-07-17,"[['Williams', 'Meredydd', ''], ['Nurse', 'Jason R. C.', ''], ['Creese', 'Sadie', '']]","['Onlineprivacy', 'Privacyparadox', 'Internet-ofThings', 'Privacy by design', 'Socio-technical']"
2685,1907.12737,Hamed Vahdat-Nejad,"Hamed Vahdat-Nejad, Zahra Mazhar Farimani, Arezoo Tavakolifar",Social Internet of Things and New Generation Computing -- A Survey,"IoT, Social computing, Survey",,10.1007/978-3-030-24513-9_8,,cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social Internet of Things (SIoT) tries to overcome the challenges of Internet
of Things (IoT) such as scalability, trust and discovery of resources, by
inspiration from social computing. This survey aims to investigate the research
done on SIoT from two perspectives including application domain and the
integration to the new computing models. For this, a two-dimensional framework
is proposed and the projects are investigated, accordingly. The first dimension
considers and classifies available research from the application domain
perspective and the second dimension performs the same from the integration to
new computing models standpoint. The aim is to technically describe SIoT, to
classify related research, to foster the dissemination of state-of-the-art, and
to discuss open research directions in this field.
","[{'version': 'v1', 'created': 'Sat, 27 Jul 2019 18:49:43 GMT'}]",2019-07-31,"[['Vahdat-Nejad', 'Hamed', ''], ['Farimani', 'Zahra Mazhar', ''], ['Tavakolifar', 'Arezoo', '']]","['Social Internet of Things', 'Application domain', 'Computing model', 'Survey']"
2686,1507.07688,Stefano Albrecht,"Stefano V. Albrecht, Jacob W. Crandall, Subramanian Ramamoorthy",Belief and Truth in Hypothesised Behaviours,44 pages; final manuscript published in Artificial Intelligence (AIJ),,10.1016/j.artint.2016.02.004,,cs.AI cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a long history in game theory on the topic of Bayesian or ""rational""
learning, in which each player maintains beliefs over a set of alternative
behaviours, or types, for the other players. This idea has gained increasing
interest in the artificial intelligence (AI) community, where it is used as a
method to control a single agent in a system composed of multiple agents with
unknown behaviours. The idea is to hypothesise a set of types, each specifying
a possible behaviour for the other agents, and to plan our own actions with
respect to those types which we believe are most likely, given the observed
actions of the agents. The game theory literature studies this idea primarily
in the context of equilibrium attainment. In contrast, many AI applications
have a focus on task completion and payoff maximisation. With this perspective
in mind, we identify and address a spectrum of questions pertaining to belief
and truth in hypothesised types. We formulate three basic ways to incorporate
evidence into posterior beliefs and show when the resulting beliefs are
correct, and when they may fail to be correct. Moreover, we demonstrate that
prior beliefs can have a significant impact on our ability to maximise payoffs
in the long-term, and that they can be computed automatically with consistent
performance effects. Furthermore, we analyse the conditions under which we are
able complete our task optimally, despite inaccuracies in the hypothesised
types. Finally, we show how the correctness of hypothesised types can be
ascertained during the interaction via an automated statistical analysis.
","[{'version': 'v1', 'created': 'Tue, 28 Jul 2015 08:52:45 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Dec 2015 14:39:45 GMT'}, {'version': 'v3', 'created': 'Wed, 2 Mar 2016 18:38:32 GMT'}]",2016-03-03,"[['Albrecht', 'Stefano V.', ''], ['Crandall', 'Jacob W.', ''], ['Ramamoorthy', 'Subramanian', '']]","['Autonomous agents', 'multiagent systems', 'game theory', 'type-based method']"
2687,1007.3384,Emanuele Caglioti,"D. Benedetto, E. Caglioti, G. Cristadoro, M. Degli Esposti",Relative entropy via non-sequential recursive pair substitutions,"13 pages , 2 figures",,10.1088/1742-5468/2010/09/P09010,,cs.IT cond-mat.stat-mech math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The entropy of an ergodic source is the limit of properly rescaled 1-block
entropies of sources obtained applying successive non-sequential recursive
pairs substitutions (see P. Grassberger 2002 ArXiv:physics/0207023 and D.
Benedetto, E. Caglioti and D. Gabrielli 2006 Jour. Stat. Mech. Theo. Exp. 09
doi:10.1088/1742.-5468/2006/09/P09011). In this paper we prove that the cross
entropy and the Kullback-Leibler divergence can be obtained in a similar way.
","[{'version': 'v1', 'created': 'Tue, 20 Jul 2010 09:55:41 GMT'}, {'version': 'v2', 'created': 'Sun, 22 Aug 2010 09:02:10 GMT'}]",2015-05-19,"[['Benedetto', 'D.', ''], ['Caglioti', 'E.', ''], ['Cristadoro', 'G.', ''], ['Esposti', 'M. Degli', '']]","['information theory', 'source and channel coding', 'relative entropy']"
2688,1804.07450,Muaz Niazi,"Yousra Asim, Muaz A. Niazi, Basit Raza, Ahmad Kamran Malik",Personal vs. Know-How Contacts: Which Matter More in Wiki Elections?,"21 pages, 11 figures","Y. Asim, M. A. Niazi, B. Raza et al., ""Personal vs. know-how
  contacts: which matter more in wiki elections?"" Complex Adaptive Systems
  Modeling, vol. 6, no. 1, pp. 4, April 18, 2018",10.1186/s40294-018-0054-6,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of social media affects the real world as well. This study relies on
specific social network measures to investigate the interactions between
election participants and the importance of their contacts. It investigates
whether personal contacts matter more than know-how contacts in wiki election
nominations and voting participation by using standard tools such as Pajek and
Gephi. It further evaluates the significance of a personal contacts in online
wiki elections through a number of different graph-based influence
identification methods. Additionally, the basic characteristics and cohesive
groups in the wiki vote network are explored. This work contributes by
discovering the significance of personal contacts over know-how contacts of a
person in online elections. It is found that personal contacts, i.e. immediate
neighbors (degree centrality) and neighborhood (k-neighbors) of a person have a
positive effect on a person's nomination as an administrator and also
contribute to the active participation of voters in voting. Moreover, know-how
contacts, analyzed by means of measures such as betweenness and closeness
centralities, have a relatively insignificant effect on the selection of a
person. However, know-how contacts in terms of betweenness centrality for
passing information in the network can positively contribute only to the voting
process. These contacts also measured in terms of influence domain and PageRank
can play a vital role in the selection of an admin. Additionally, such contacts
in terms of reachability and brokerage roles have a positive association with
the voting process.
","[{'version': 'v1', 'created': 'Fri, 20 Apr 2018 05:09:56 GMT'}]",2018-04-23,"[['Asim', 'Yousra', ''], ['Niazi', 'Muaz A.', ''], ['Raza', 'Basit', ''], ['Malik', 'Ahmad Kamran', '']]","['Social network analysis', 'Wikipedia', 'Wiki election', 'Request for Adminship']"
2689,2105.09649,Zixiu Wu,"Zixiu Wu, Rim Helaoui, Vivek Kumar, Diego Reforgiato Recupero and
  Daniele Riboni","Towards Detecting Need for Empathetic Response in Motivational
  Interviewing","Accepted to ICMI '20 Companion: Companion Publication of the 2020
  International Conference on Multimodal Interaction (SAMIH'20 Workshop)",,10.1145/3395035.3425228,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Empathetic response from the therapist is key to the success of clinical
psychotherapy, especially motivational interviewing. Previous work on
computational modelling of empathy in motivational interviewing has focused on
offline, session-level assessment of therapist empathy, where empathy captures
all efforts that the therapist makes to understand the client's perspective and
convey that understanding to the client. In this position paper, we propose a
novel task of turn-level detection of client need for empathy. Concretely, we
propose to leverage pre-trained language models and empathy-related general
conversation corpora in a unique labeller-detector framework, where the
labeller automatically annotates a motivational interviewing conversation
corpus with empathy labels to train the detector that determines the need for
therapist empathy. We also lay out our strategies of extending the detector
with additional-input and multi-task setups to improve its detection and
explainability.
","[{'version': 'v1', 'created': 'Thu, 20 May 2021 10:28:46 GMT'}]",2021-05-21,"[['Wu', 'Zixiu', ''], ['Helaoui', 'Rim', ''], ['Kumar', 'Vivek', ''], ['Recupero', 'Diego Reforgiato', ''], ['Riboni', 'Daniele', '']]","['motivational interviewing', 'empathy', 'classification', 'deep learning']"
2690,1606.09279,Phillippe Samer,"Phillippe Samer, Evellyn Cavalcante, Sebasti\'an Urrutia, Johan Oppen","The matching relaxation for a class of generalized set partitioning
  problems","33 pages. A preliminary (4-page) version of this paper was presented
  at CTW 2016 (Cologne-Twente Workshop on Graphs and Combinatorial
  Optimization), with proceedings on Electronic Notes in Discrete Mathematics",,10.1016/j.dam.2018.05.033,,cs.DS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a discrete relaxation for the class of combinatorial
optimization problems which can be described by a set partitioning formulation
under packing constraints. We present two combinatorial relaxations based on
computing maximum weighted matchings in suitable graphs. Besides providing dual
bounds, the relaxations are also used on a variable reduction technique and a
matheuristic. We show how that general method can be tailored to sample
applications, and also perform a successful computational evaluation with
benchmark instances of a problem in maritime logistics.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2016 20:46:08 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Jul 2016 14:07:40 GMT'}, {'version': 'v3', 'created': 'Thu, 4 Aug 2016 01:11:46 GMT'}, {'version': 'v4', 'created': 'Mon, 30 Jan 2017 17:32:59 GMT'}, {'version': 'v5', 'created': 'Fri, 11 May 2018 20:56:44 GMT'}]",2022-08-30,"[['Samer', 'Phillippe', ''], ['Cavalcante', 'Evellyn', ''], ['Urrutia', 'Sebastián', ''], ['Oppen', 'Johan', '']]","['dual bounds', 'matchings', 'set partitioning', 'integer programming']"
2691,1008.1695,Radhika Kotrike,S. V. Sheela and K. R. Radhika,Biometric Authentication using Nonparametric Methods,"20 pages, 17 figures","International Journal of Computer Science and Information
  Technology 2.3 (2010) 114-133",10.5121/ijcsit.2010.2309,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The physiological and behavioral trait is employed to develop biometric
authentication systems. The proposed work deals with the authentication of iris
and signature based on minimum variance criteria. The iris patterns are
preprocessed based on area of the connected components. The segmented image
used for authentication consists of the region with large variations in the
gray level values. The image region is split into quadtree components. The
components with minimum variance are determined from the training samples. Hu
moments are applied on the components. The summation of moment values
corresponding to minimum variance components are provided as input vector to
k-means and fuzzy k-means classifiers. The best performance was obtained for
MMU database consisting of 45 subjects. The number of subjects with zero False
Rejection Rate [FRR] was 44 and number of subjects with zero False Acceptance
Rate [FAR] was 45. This paper addresses the computational load reduction in
off-line signature verification based on minimal features using k-means, fuzzy
k-means, k-nn, fuzzy k-nn and novel average-max approaches. FRR of 8.13% and
FAR of 10% was achieved using k-nn classifier. The signature is a biometric,
where variations in a genuine case, is a natural expectation. In the genuine
signature, certain parts of signature vary from one instance to another. The
system aims to provide simple, fast and robust system using less number of
features when compared to state of art works.
","[{'version': 'v1', 'created': 'Tue, 10 Aug 2010 11:38:29 GMT'}]",2010-08-11,"[['Sheela', 'S. V.', ''], ['Radhika', 'K. R.', '']]","['Off-line Signature', 'Iris', 'Minimum Variance Quadtree Components', 'Hu Moments']"
2692,2102.11469,Anh Viet Do,Anh Viet Do and Mingyu Guo and Aneta Neumann and Frank Neumann,Analysis of Evolutionary Diversity Optimisation for Permutation Problems,"20 pages, 4 figures, 1 table",,10.1145/3561974,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generating diverse populations of high quality solutions has gained interest
as a promising extension to the traditional optimization tasks. This work
contributes to this line of research with an investigation on evolutionary
diversity optimization for three of the most well-studied permutation problems,
namely the Traveling Salesperson Problem (TSP), both symmetric and asymmetric
variants, and Quadratic Assignment Problem (QAP). It includes an analysis of
the worst-case performance of a simple mutation-only evolutionary algorithm
with different mutation operators, using an established diversity measure.
Theoretical results show many mutation operators for these problems guarantee
convergence to maximally diverse populations of sufficiently small size within
cubic to quartic expected run-time. On the other hand, the result on QAP
suggests that strong mutations give poor worst-case performance, as mutation
strength contributes exponentially to the expected run-time. Additionally,
experiments are carried out on QAPLIB and synthetic instances in unconstrained
and constrained settings, and reveal much more optimistic practical
performances, while corroborating the theoretical finding regarding mutation
strength. These results should serve as a baseline for future studies.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2021 03:13:26 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Apr 2021 06:23:55 GMT'}, {'version': 'v3', 'created': 'Fri, 28 Oct 2022 02:51:10 GMT'}, {'version': 'v4', 'created': 'Mon, 31 Oct 2022 02:38:58 GMT'}]",2022-11-01,"[['Do', 'Anh Viet', ''], ['Guo', 'Mingyu', ''], ['Neumann', 'Aneta', ''], ['Neumann', 'Frank', '']]","['evolutionary algorithms', 'diversity maximization', 'traveling salesperson problem', 'quadratic assignmentproblem', 'run-time analysis']"
2693,1003.4831,Yannick Aoustin,"Yannick Aoustin (IRCCyN), Alexander Formal'skii","Ball on a beam: stabilization under saturated input control with large
  basin of attraction",,Multibody System Dynamics 21 (2008) 71-89,10.1007/s11044-008-9128-0,,cs.RO cs.SY physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article is devoted to the stabilization of two underactuated planar
systems, the well-known straight beam-and-ball system and an original circular
beam-and-ball system. The feedback control for each system is designed, using
the Jordan form of its model, linearized near the unstable equilibrium. The
limits on the voltage, fed to the motor, are taken into account explicitly. The
straight beam-and-ball system has one unstable mode in the motion near the
equilibrium point. The proposed control law ensures that the basin of
attraction coincides with the controllability domain. The circular
beam-and-ball system has two unstable modes near the equilibrium point.
Therefore, this device, never considered in the past, is much more difficult to
control than the straight beam-and-ball system. The main contribution is to
propose a simple new control law, which ensures by adjusting its gain
parameters that the basin of attraction arbitrarily can approach the
controllability domain for the linear case. For both nonlinear systems,
simulation results are presented to illustrate the efficiency of the designed
nonlinear control laws and to determine the basin of attraction.
","[{'version': 'v1', 'created': 'Thu, 25 Mar 2010 09:53:22 GMT'}]",2010-12-01,"[['Aoustin', 'Yannick', '', 'IRCCyN'], [""Formal'skii"", 'Alexander', '']]","['saturated control', 'controllability domain', 'Jordan form', 'stabilization', 'basin of attraction']"
2694,1512.06440,Mordechai Shalom,"Arman Boyac{\i}, T{\i}naz Ekim, Mordechai Shalom, Shmuel Zaks",Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid,,"Discrete Mathematics & Theoretical Computer Science, Vol. 19 no.
  1, Graph Theory (June 12, 2017) dmtcs:3708",10.23638/DMTCS-19-1-13,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The families EPT (resp. EPG) Edge Intersection Graphs of Paths in a tree
(resp. in a grid) are well studied graph classes. Recently we introduced the
graph classes Edge-Intersecting and Non-Splitting Paths in a Tree ENPT, and in
a Grid (ENPG). It was shown that ENPG contains an infinite hierarchy of
subclasses that are obtained by restricting the number of bends in the paths.
Motivated by this result, in this work we focus on one bend {ENPG} graphs. We
show that one bend ENPG graphs are properly included in two bend ENPG graphs.
We also show that trees and cycles are one bend ENPG graphs, and characterize
the split graphs and co-bipartite graphs that are one bend ENPG. We prove that
the recognition problem of one bend ENPG split graphs is NP-complete even in a
very restricted subfamily of split graphs. Last we provide a linear time
recognition algorithm for one bend ENPG co-bipartite graphs.
","[{'version': 'v1', 'created': 'Sun, 20 Dec 2015 21:53:54 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Sep 2016 19:57:08 GMT'}, {'version': 'v3', 'created': 'Fri, 9 Jun 2017 14:29:46 GMT'}]",2019-03-14,"[['Boyacı', 'Arman', ''], ['Ekim', 'Tınaz', ''], ['Shalom', 'Mordechai', ''], ['Zaks', 'Shmuel', '']]","['Intersection Graphs', 'Path Graphs', 'EPT Graphs', 'EPG Graphs']"
2695,1207.3576,Padmavathi S,"S. Padmavathi, N. Archana, K. P. Soman",Hierarchical Approach for Total Variation Digital Image Inpainting,"7 pages, 7 figures; International Journal of Computer Science,
  Engineering and Applications (IJCSEA), Voulume 2, Number 3, June 2012, ISSN :
  2230 - 9616 [Online] ; 2231 - 0088 [Print]",,10.5121/ijcsea.2012.2316,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The art of recovering an image from damage in an undetectable form is known
as inpainting. The manual work of inpainting is most often a very time
consuming process. Due to digitalization of this technique, it is automatic and
faster. In this paper, after the user selects the regions to be reconstructed,
the algorithm automatically reconstruct the lost regions with the help of the
information surrounding them. The existing methods perform very well when the
region to be reconstructed is very small, but fails in proper reconstruction as
the area increases. This paper describes a Hierarchical method by which the
area to be inpainted is reduced in multiple levels and Total Variation(TV)
method is used to inpaint in each level. This algorithm gives better
performance when compared with other existing algorithms such as nearest
neighbor interpolation, Inpainting through Blurring and Sobolev Inpainting.
","[{'version': 'v1', 'created': 'Mon, 16 Jul 2012 04:51:07 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Jul 2013 04:25:46 GMT'}]",2013-07-15,"[['Padmavathi', 'S.', ''], ['Archana', 'N.', ''], ['Soman', 'K. P.', '']]","['image inpainting', 'TV Inpainting', 'Interpolation']"
2696,2004.00251,Hong-Gyu Jung,"Jin-Woo Seo, Hong-Gyu Jung, Seong-Whan Lee","Self-Augmentation: Generalizing Deep Networks to Unseen Classes for
  Few-Shot Learning",The first two authors contributed equally to this work,,10.1016/j.neunet.2021.02.007,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Few-shot learning aims to classify unseen classes with a few training
examples. While recent works have shown that standard mini-batch training with
a carefully designed training strategy can improve generalization ability for
unseen classes, well-known problems in deep networks such as memorizing
training statistics have been less explored for few-shot learning. To tackle
this issue, we propose self-augmentation that consolidates self-mix and
self-distillation. Specifically, we exploit a regional dropout technique called
self-mix, in which a patch of an image is substituted into other values in the
same image. Then, we employ a backbone network that has auxiliary branches with
its own classifier to enforce knowledge sharing. Lastly, we present a local
representation learner to further exploit a few training examples for unseen
classes. Experimental results show that the proposed method outperforms the
state-of-the-art methods for prevalent few-shot benchmarks and improves the
generalization ability.
","[{'version': 'v1', 'created': 'Wed, 1 Apr 2020 06:39:08 GMT'}, {'version': 'v2', 'created': 'Fri, 8 May 2020 04:53:01 GMT'}, {'version': 'v3', 'created': 'Tue, 4 Aug 2020 08:37:35 GMT'}]",2021-03-02,"[['Seo', 'Jin-Woo', ''], ['Jung', 'Hong-Gyu', ''], ['Lee', 'Seong-Whan', '']]","['Few-shot Learning', 'Classification', 'Generalization', 'Knowledge Distillation']"
2697,1303.6129,"\""Ozlem Salehi","\""Ozlem Salehi, Abuzer Yakary{\i}lmaz, A. C. Cem Say",Real-Time Vector Automata,14 pages,,10.1007/978-3-642-40164-0_28,,cs.FL cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the computational power of real-time finite automata that have been
augmented with a vector of dimension k, and programmed to multiply this vector
at each step by an appropriately selected $k \times k$ matrix. Only one entry
of the vector can be tested for equality to 1 at any time. Classes of languages
recognized by deterministic, nondeterministic, and ""blind"" versions of these
machines are studied and compared with each other, and the associated classes
for multicounter automata, automata with multiplication, and generalized finite
automata.
","[{'version': 'v1', 'created': 'Mon, 25 Mar 2013 13:48:49 GMT'}]",2016-09-09,"[['Salehi', 'Özlem', ''], ['Yakaryılmaz', 'Abuzer', ''], ['Say', 'A. C. Cem', '']]","['vector automata', 'counter automata', 'automata with multiplication', 'generalized automata']"
2698,1708.01131,Alexander Khoperskov V.,"E.O. Agafonnikova, A.Yu. Klikunova, A.V. Khoperskov","A computer simulation of the Volga River hydrological regime: a problem
  of water-retaining dam optimal location","7 pages, 3 figures","Bulletin of the South Ural State University, Series: Mathematical
  Modelling, Programming and Computer Software, 2017, vol.10, no.3, 148-155",10.14529/mmp170313,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate of a special dam optimal location at the Volga river in area
of the Akhtuba left sleeve beginning (7 \, km to the south of the Volga
Hydroelectric Power Station dam). We claim that a new water-retaining dam can
resolve the key problem of the Volga-Akhtuba floodplain related to insufficient
water amount during the spring flooding due to the overregulation of the Lower
Volga. By using a numerical integration of Saint-Vacant equations we study the
water dynamics across the northern part of the Volga-Akhtuba floodplain with
taking into account its actual topography. As the result we found an amount of
water $V_A$ passing to the Akhtuba during spring period for a given water flow
through the Volga Hydroelectric Power Station (so-called hydrograph which
characterises the water flow per unit of time). By varying the location of the
water-retaining dam $ x_d, y_d $ we obtained various values of $V_A (x_d, y_d)
$ as well as various flow spatial structure on the territory during the flood
period. Gradient descent method provide us the dam coordinated with the maximum
value of ${V_A}$. Such approach to the dam location choice let us to find the
best solution, that the value $V_A$ increases by a factor of 2. Our analysis
demonstrate a good potential of the numerical simulations in the field of
hydraulic works.
","[{'version': 'v1', 'created': 'Tue, 1 Aug 2017 19:55:26 GMT'}]",2017-08-04,"[['Agafonnikova', 'E. O.', ''], ['Klikunova', 'A. Yu.', ''], ['Khoperskov', 'A. V.', '']]","['hydrodynamicsimulation', 'Saint-Venant equations', 'numericalmodel', 'optimization', 'hydrology']"
2699,1501.01657,Abolfazl Asudeh,"Abolfazl Asudeh, Gergely V. Zaruba, Sajal K. Das",A General Model for MAC Protocol Selection in Wireless Sensor Networks,,Ad Hoc Networks 2016,10.1016/j.adhoc.2015.07.005,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless Sensor Networks (WSNs) are being deployed for different
applications, each having its own structure, goals and requirements. Medium
access control (MAC) protocols play a significant role in WSNs and hence should
be tuned to the applications. However, there is no for selecting MAC protocols
for different situations. Therefore, it is hard to decide which MAC protocol is
good for a given situation. Having a precise model for each MAC protocol, on
the other hand, is almost impossible. Using the intuition that the protocols in
the same behavioral category perform similarly, our goal in this paper is to
introduce a general model that selects the protocol(s) that satisfy the given
requirements from the category that performs better for a given context. We
define the Combined Performance Function (CPF) to demonstrate the performance
of different categories protocols for different contexts. Having the general
model, we then discuss the model scalability for adding new protocols,
categories, requirements, and performance criteria. Considering energy
consumption and delay as the initial performance criteria of the model, we
focus on deriving mathematical models for them. The results extracted from CPF
are the same as the well-known rule of thumb for the MAC protocols that
verifies our model. We validate our models with the help of simulation study.
We also implemented the current CPF model in a web page to make the model
online and useful.
","[{'version': 'v1', 'created': 'Wed, 7 Jan 2015 21:35:43 GMT'}]",2016-02-10,"[['Asudeh', 'Abolfazl', ''], ['Zaruba', 'Gergely V.', ''], ['Das', 'Sajal K.', '']]","['Wireless Sensor Networks', 'MAC Protocol Selection', 'General Model']"
2700,1405.5193,Osman Yagan,"Faruk Yavuz, Jun Zhao, Osman Ya\u{g}an, Virgil Gligor","Towards $k$-connectivity of the random graph induced by a pairwise key
  predistribution scheme with unreliable links","The full version (with proofs) of a paper to be presented at IEEE
  International Symposium on Information Theory (ISIT 2014), Honolulu (HI),
  July 2014. 37 pages","IEEE Transactions on Information Theory, 61(11):6251-6271,
  November 2015",10.1109/TIT.2015.2471295,,cs.DM cs.CR cs.IT math.CO math.IT math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the secure and reliable connectivity of wireless sensor networks.
Security is assumed to be ensured by the random pairwise key predistribution
scheme of Chan, Perrig, and Song, and unreliable wireless links are represented
by independent on/off channels. Modeling the network by an intersection of a
random $K$-out graph and an Erd\H{o}s-R\'enyi graph, we present scaling
conditions (on the number of nodes, the scheme parameter $K$, and the
probability of a wireless channel being on) such that the resulting graph
contains no nodes with degree less than $k$ with high probability, when the
number of nodes gets large. Results are given in the form of zero-one laws and
are shown to improve the previous results by Ya\u{g}an and Makowski on the
absence of isolated nodes (i.e., absence of nodes with degree zero). Via
simulations, the established zero-one laws are shown to hold also for the
property of $k$-connectivity; i.e., the property that graph remains connected
despite the deletion of any $k-1$ nodes or edges.
","[{'version': 'v1', 'created': 'Sat, 19 Apr 2014 17:27:58 GMT'}]",2017-01-16,"[['Yavuz', 'Faruk', ''], ['Zhao', 'Jun', ''], ['Yağan', 'Osman', ''], ['Gligor', 'Virgil', '']]","['Wireless Sensor Networks', 'Key Predistribution', 'Random Graphs', 'Minimum NodeDegree', 'k-connectivity', 'Zero-one Laws']"
2701,1601.07108,Naveen Gupta,"Naveen Gupta, Anurag Singh and Hocine Cherifi",Centrality Measures for Networks with Community Structure,"30 pages, 4 figures. Accepted for publication in Physica A. arXiv
  admin note: text overlap with arXiv:1411.6276","Physica A: Statistical Mechanics and its Applications 452 (2016):
  46-59",10.1016/j.physa.2016.01.066,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding the network structure, and finding out the influential nodes is
a challenging issue in the large networks. Identifying the most influential
nodes in the network can be useful in many applications like immunization of
nodes in case of epidemic spreading, during intentional attacks on complex
networks. A lot of research is done to devise centrality measures which could
efficiently identify the most influential nodes in the network. There are two
major approaches to the problem: On one hand, deterministic strategies that
exploit knowledge about the overall network topology in order to find the
influential nodes, while on the other end, random strategies are completely
agnostic about the network structure. Centrality measures that can deal with a
limited knowledge of the network structure are required. Indeed, in practice,
information about the global structure of the overall network is rarely
available or hard to acquire. Even if available, the structure of the network
might be too large that it is too much computationally expensive to calculate
global centrality measures. To that end, a centrality measure is proposed that
requires information only at the community level to identify the influential
nodes in the network. Indeed, most of the real-world networks exhibit a
community structure that can be exploited efficiently to discover the
influential nodes. We performed a comparative evaluation of prominent global
deterministic strategies together with stochastic strategies with an available
and the proposed deterministic community-based strategy. Effectiveness of the
proposed method is evaluated by performing experiments on synthetic and
real-world networks with community structure in the case of immunization of
nodes for epidemic control.
","[{'version': 'v1', 'created': 'Tue, 26 Jan 2016 17:26:58 GMT'}]",2017-01-10,"[['Gupta', 'Naveen', ''], ['Singh', 'Anurag', ''], ['Cherifi', 'Hocine', '']]","['Complex Networks', 'Epidemic Dynamics', 'CommunityStructure', 'Immunization Strategies']"
2702,1406.1677,Ankit Chadha Mr.,"Ankit R. Chadha, Rishikesh Misal, Tanaya Mokashi",Modified Binary Search Algorithm,,"International Journal of Applied Information Systems 7(2):37-40,
  April 2014",10.5120/ijais14-451131,,cs.DS cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a modification to the traditional binary search algorithm
in which it checks the presence of the input element with the middle element of
the given set of elements at each iteration. Modified binary search algorithm
optimizes the worst case of the binary search algorithm by comparing the input
element with the first & last element of the data set along with the middle
element and also checks the input number belongs to the range of numbers
present in the given data set at each iteration there by reducing the time
taken by the worst cases of binary search algorithm.
","[{'version': 'v1', 'created': 'Fri, 6 Jun 2014 13:12:19 GMT'}]",2014-06-09,"[['Chadha', 'Ankit R.', ''], ['Misal', 'Rishikesh', ''], ['Mokashi', 'Tanaya', '']]","['Searching', 'Binary Search', 'Modified Binary Search']"
2703,1809.02333,Shulong Li,"Shulong Li, Panpan Xu, Bin Li, Liyuan Chen, Zhiguo Zhou, Hongxia Hao,
  Yingying Duan, Michael Folkert, Jianhua Ma, Steve Jiang, and Jing Wang","Predicting Lung Nodule Malignancies by Combining Deep Convolutional
  Neural Network and Handcrafted Features","11 pages, 5 figures, 5 tables. This work has been submitted to the
  IEEE for possible publication",,10.1088/1361-6560/ab326a,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To predict lung nodule malignancy with a high sensitivity and specificity, we
propose a fusion algorithm that combines handcrafted features (HF) into the
features learned at the output layer of a 3D deep convolutional neural network
(CNN). First, we extracted twenty-nine handcrafted features, including nine
intensity features, eight geometric features, and twelve texture features based
on grey-level co-occurrence matrix (GLCM) averaged from thirteen directions. We
then trained 3D CNNs modified from three state-of-the-art 2D CNN architectures
(AlexNet, VGG-16 Net and Multi-crop Net) to extract the CNN features learned at
the output layer. For each 3D CNN, the CNN features combined with the 29
handcrafted features were used as the input for the support vector machine
(SVM) coupled with the sequential forward feature selection (SFS) method to
select the optimal feature subset and construct the classifiers. The fusion
algorithm takes full advantage of the handcrafted features and the highest
level CNN features learned at the output layer. It can overcome the
disadvantage of the handcrafted features that may not fully reflect the unique
characteristics of a particular lesion by combining the intrinsic CNN features.
Meanwhile, it also alleviates the requirement of a large scale annotated
dataset for the CNNs based on the complementary of handcrafted features. The
patient cohort includes 431 malignant nodules and 795 benign nodules extracted
from the LIDC/IDRI database. For each investigated CNN architecture, the
proposed fusion algorithm achieved the highest AUC, accuracy, sensitivity, and
specificity scores among all competitive classification models.
","[{'version': 'v1', 'created': 'Fri, 7 Sep 2018 07:43:17 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Dec 2018 13:09:53 GMT'}]",2020-01-08,"[['Li', 'Shulong', ''], ['Xu', 'Panpan', ''], ['Li', 'Bin', ''], ['Chen', 'Liyuan', ''], ['Zhou', 'Zhiguo', ''], ['Hao', 'Hongxia', ''], ['Duan', 'Yingying', ''], ['Folkert', 'Michael', ''], ['Ma', 'Jianhua', ''], ['Jiang', 'Steve', ''], ['Wang', 'Jing', '']]","['Lung Nodule Malignancy', 'convolutional neural network', 'handcrafted feature', 'fusion algorithm', 'Radiomics']"
2704,1201.3496,Tareq Malas,"Tareq M. Malas, Aron J. Ahmadia, Jed Brown, John A. Gunnels, David E.
  Keyes","Optimizing the Performance of Streaming Numerical Kernels on the IBM
  Blue Gene/P PowerPC 450 Processor",,,10.1177/1094342012444795,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several emerging petascale architectures use energy-efficient processors with
vectorized computational units and in-order thread processing. On these
architectures the sustained performance of streaming numerical kernels,
ubiquitous in the solution of partial differential equations, represents a
challenge despite the regularity of memory access. Sophisticated optimization
techniques are required to fully utilize the Central Processing Unit (CPU).
  We propose a new method for constructing streaming numerical kernels using a
high-level assembly synthesis and optimization framework. We describe an
implementation of this method in Python targeting the IBM Blue Gene/P
supercomputer's PowerPC 450 core. This paper details the high-level design,
construction, simulation, verification, and analysis of these kernels utilizing
a subset of the CPU's instruction set.
  We demonstrate the effectiveness of our approach by implementing several
three-dimensional stencil kernels over a variety of cached memory scenarios and
analyzing the mechanically scheduled variants, including a 27-point stencil
achieving a 1.7x speedup over the best previously published results.
","[{'version': 'v1', 'created': 'Tue, 17 Jan 2012 12:39:04 GMT'}]",2015-10-19,"[['Malas', 'Tareq M.', ''], ['Ahmadia', 'Aron J.', ''], ['Brown', 'Jed', ''], ['Gunnels', 'John A.', ''], ['Keyes', 'David E.', '']]","['High Performance Computing', 'Performance Optimization', 'Code Generation', 'SIMD', 'Blue Gene/P']"
2705,2102.04699,Rajiv Kumar V,"Rajiv Kumar, Rishabh Dabral, G. Sivakumar","Learning Unsupervised Cross-domain Image-to-Image Translation Using a
  Shared Discriminator",,,10.5220/0010184102560264,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Unsupervised image-to-image translation is used to transform images from a
source domain to generate images in a target domain without using source-target
image pairs. Promising results have been obtained for this problem in an
adversarial setting using two independent GANs and attention mechanisms. We
propose a new method that uses a single shared discriminator between the two
GANs, which improves the overall efficacy. We assess the qualitative and
quantitative results on image transfiguration, a cross-domain translation task,
in a setting where the target domain shares similar semantics to the source
domain. Our results indicate that even without adding attention mechanisms, our
method performs at par with attention-based methods and generates images of
comparable quality.
","[{'version': 'v1', 'created': 'Tue, 9 Feb 2021 08:26:23 GMT'}]",2021-02-22,"[['Kumar', 'Rajiv', ''], ['Dabral', 'Rishabh', ''], ['Sivakumar', 'G.', '']]","['Image-to-image Translation', 'Unsupervised Learning', 'Cross-domain Image Translation', 'Shared Discriminator', 'Generative Adversarial Networks']"
2706,0708.3811,Damien Chablat,"Mazen Zein (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)","An Exhaustive Study of the Workspaces Tolopogies of all 3R Orthogonal
  Manipulators with Geometric Simplifications",,"Journal of Mechanism and Machine Theory 41, 8 (2006) 971-986",10.1016/j.mechmachtheory.2006.03.013,,cs.RO,,"  This paper proposes a classification of three-revolute orthogonal
manipulators that have at least one of their DH parameters equal to zero. This
classification is based on the topology of their workspace. The workspace is
characterized in a half-cross section by the singular curves. The workspace
topology is defined by the number of cusps and nodes that appear on these
singular curves. The manipulators are classified into different types with
similar kinematic properties. Each type is evaluated according to interesting
kinematic properties such as, whether the workspace is fully reachable with
four inverse kinematic solutions or not, the existence of voids, and the
feasibility of continuous trajectories in the workspace. It is found that
several orthogonal manipulators have a ""well-connected"" workspace, that is,
their workspace is fully accessible with four inverse kinematic solutions and
any continuous trajectory is feasible. This result is of interest for the
design of alternative manipulator geometries.
","[{'version': 'v1', 'created': 'Tue, 28 Aug 2007 15:51:50 GMT'}]",2007-08-29,"[['Zein', 'Mazen', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN'], ['Chablat', 'Damien', '', 'IRCCyN']]","['Workspace', 'classification', 'design parameter', 'node', 'void', 'feasible trajectory']"
2707,1912.01825,Lars Ruthotto,"Lars Ruthotto, Stanley Osher, Wuchen Li, Levon Nurbekyan, Samy Wu Fung","A Machine Learning Framework for Solving High-Dimensional Mean Field
  Game and Mean Field Control Problems","21 pages, 13 figures, 2 table",,10.1073/pnas.1922204117,,cs.LG cs.NA math.NA math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mean field games (MFG) and mean field control (MFC) are critical classes of
multi-agent models for efficient analysis of massive populations of interacting
agents. Their areas of application span topics in economics, finance, game
theory, industrial engineering, crowd motion, and more. In this paper, we
provide a flexible machine learning framework for the numerical solution of
potential MFG and MFC models. State-of-the-art numerical methods for solving
such problems utilize spatial discretization that leads to a
curse-of-dimensionality. We approximately solve high-dimensional problems by
combining Lagrangian and Eulerian viewpoints and leveraging recent advances
from machine learning. More precisely, we work with a Lagrangian formulation of
the problem and enforce the underlying Hamilton-Jacobi-Bellman (HJB) equation
that is derived from the Eulerian formulation. Finally, a tailored neural
network parameterization of the MFG/MFC solution helps us avoid any spatial
discretization. Our numerical results include the approximate solution of
100-dimensional instances of optimal transport and crowd motion problems on a
standard work station and a validation using an Eulerian solver in two
dimensions. These results open the door to much-anticipated applications of MFG
and MFC models that were beyond reach with existing numerical methods.
","[{'version': 'v1', 'created': 'Wed, 4 Dec 2019 06:59:59 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Dec 2019 18:41:41 GMT'}, {'version': 'v3', 'created': 'Sat, 15 Feb 2020 01:15:01 GMT'}]",2022-06-08,"[['Ruthotto', 'Lars', ''], ['Osher', 'Stanley', ''], ['Li', 'Wuchen', ''], ['Nurbekyan', 'Levon', ''], ['Fung', 'Samy Wu', '']]","['mean field games', 'mean field control', 'machine learning', 'optimal control', 'neural networks', 'optimal transport', 'HamiltonJacobi-Bellman equations']"
2708,1903.09312,Hector Barco Cobalea,"Hector Barco Cobalea (1 and 2), Iraia Oribe Garcia (1 and 2), Maria
  Virginia Vargas Viedma (1 and 2), Cruz Enrique Borges (1 and 2), Cristina
  Martin Andonegui (1 and 2), Ainhoa Alonso Vicario (1 and 2) ((1) DeustoTech -
  Fundacion Deusto (2) Facultad Ingenieria, Universidad de Deusto)","New methodology for facilitating the food wastage quantification.
  Identifying gaps and data inconsistencies",Accepted Manuscript version,Journal of Environmental Management. 2019,10.1016/j.jenvman.2018.11.037,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The work aims at providing a new methodology to facilitate the process of
quantifying the food waste according to European standards all along the
agrifood chain combining information that is becoming available at local level.
  This new methodology generates straightforward and easy-to-interpret results
for the decision making process in the framework of the quantification of the
food waste at local and supralocal scale and it provides adequate procedures
which are easy adaptable to the specific circumstances in each municipality.
Moreover, this method could have applications for larger territorial contexts,
as the national scale, detecting possible points for improvement of the current
official figures at this respect.
","[{'version': 'v1', 'created': 'Thu, 7 Mar 2019 13:23:54 GMT'}, {'version': 'v2', 'created': 'Mon, 6 May 2019 07:47:12 GMT'}]",2019-05-07,"[['Cobalea', 'Hector Barco', '', '1 and 2'], ['Garcia', 'Iraia Oribe', '', '1 and 2'], ['Viedma', 'Maria Virginia Vargas', '', '1 and 2'], ['Borges', 'Cruz Enrique', '', '1 and 2'], ['Andonegui', 'Cristina Martin', '', '1 and 2'], ['Vicario', 'Ainhoa Alonso', '', '1 and 2']]","['Food waste', 'food losses', 'quantification methodology', 'food wastage', 'waste quantification', 'agrifood chain']"
2709,1911.09903,Alperen Kantarc{\i},"Rumeysa Bulut, Alperen Kantarc{\i}, Safa Keskin, \c{S}erif Bahtiyar",Blockchain-Based Electronic Voting System for Elections in Turkey,"4 pages, 4 figures, IEEE style","2019 4th International Conference on Computer Science and
  Engineering (UBMK) (2019) 183-188",10.1109/UBMK.2019.8907102,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional elections satisfy neither citizens nor political authorities in
recent years. They are not fully secure since it is easy to attack votes. It
threatens also privacy and transparency of voters. Additionally, it takes too
much time to count the votes. This paper proposes a solution using Blockchain
to eliminate all the disadvantages of conventional elections. Security and data
integrity of votes are absolutely provided theoretically. Voter privacy is
another requirement that is ensured in the system. Lastly, the waiting time for
results decreased significantly in the proposed Blockchain voting system.
","[{'version': 'v1', 'created': 'Fri, 22 Nov 2019 07:40:34 GMT'}]",2019-11-25,"[['Bulut', 'Rumeysa', ''], ['Kantarcı', 'Alperen', ''], ['Keskin', 'Safa', ''], ['Bahtiyar', 'Şerif', '']]","['blockchain', 'e-voting', 'electronic voting', 'internet']"
2710,1804.06139,Yoshiaki Inoue,"Yoshiaki Inoue, Hiroyuki Masuyama, Tetsuya Takine, and Toshiyuki
  Tanaka","A General Formula for the Stationary Distribution of the Age of
  Information and Its Application to Single-Server Queues",Submitted to IEEE Transactions on Information Theory,,10.1109/TIT.2019.2938171,,cs.PF cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the stationary distribution of the age of information
(AoI) in information update systems. We first derive a general formula for the
stationary distribution of the AoI, which holds for a wide class of information
update systems. The formula indicates that the stationary distribution of the
AoI is given in terms of the stationary distributions of the system delay and
the peak AoI. To demonstrate its applicability and usefulness, we analyze the
AoI in single-server queues with four different service disciplines: first-come
first-served (FCFS), preemptive last-come first-served (LCFS), and two variants
of non-preemptive LCFS service disciplines. For the FCFS and the preemptive
LCFS service disciplines, the GI/GI/1, M/GI/1, and GI/M/1 queues are
considered, and for the non-preemptive LCFS service disciplines, the M/GI/1 and
GI/M/1 queues are considered. With these results, we further show comparison
results for the mean AoI's in the M/GI/1 and GI/M/1 queues under those service
disciplines.
","[{'version': 'v1', 'created': 'Tue, 17 Apr 2018 09:52:54 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Jun 2019 23:19:55 GMT'}]",2019-12-16,"[['Inoue', 'Yoshiaki', ''], ['Masuyama', 'Hiroyuki', ''], ['Takine', 'Tetsuya', ''], ['Tanaka', 'Toshiyuki', '']]","['Age of information', 'stationary distribution', 'peak AoI', 'single-server queues', 'FCFS', 'preemptiveLCFS', 'non-preemptive LCFS']"
2711,1911.09045,Saeed Khaki,"Saeed Khaki, Lizhi Wang and Sotirios V. Archontoulis",A CNN-RNN Framework for Crop Yield Prediction,"26 Pages, 14 Figures","Frontiers in Plant Science, 2019",10.3389/fpls.2019.01750,,cs.LG q-bio.QM stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crop yield prediction is extremely challenging due to its dependence on
multiple factors such as crop genotype, environmental factors, management
practices, and their interactions. This paper presents a deep learning
framework using convolutional neural networks (CNN) and recurrent neural
networks (RNN) for crop yield prediction based on environmental data and
management practices. The proposed CNN-RNN model, along with other popular
methods such as random forest (RF), deep fully-connected neural networks
(DFNN), and LASSO, was used to forecast corn and soybean yield across the
entire Corn Belt (including 13 states) in the United States for years 2016,
2017, and 2018 using historical data. The new model achieved a
root-mean-square-error (RMSE) 9% and 8% of their respective average yields,
substantially outperforming all other methods that were tested. The CNN-RNN
have three salient features that make it a potentially useful method for other
crop yield prediction studies. (1) The CNN-RNN model was designed to capture
the time dependencies of environmental factors and the genetic improvement of
seeds over time without having their genotype information. (2) The model
demonstrated the capability to generalize the yield prediction to untested
environments without significant drop in the prediction accuracy. (3) Coupled
with the backpropagation method, the model could reveal the extent to which
weather conditions, accuracy of weather predictions, soil conditions, and
management practices were able to explain the variation in the crop yields.
","[{'version': 'v1', 'created': 'Wed, 20 Nov 2019 17:18:48 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Jan 2020 19:10:32 GMT'}]",2020-01-28,"[['Khaki', 'Saeed', ''], ['Wang', 'Lizhi', ''], ['Archontoulis', 'Sotirios V.', '']]","['crop yield prediction', 'deep learning', 'convolutional neural networks', 'recurrent neural networks', 'feature selection']"
2712,1611.06078,Arief Wicaksana,"Arief Wicaksana (ITB), Arif Sasongko (ITB)","Fast and reconfigurable packet classification engine in FPGA-based
  firewall","in 2011 International Conference on Electrical Engineering and
  Informatics (ICEEI), Jul 2011, Bandung, Indonesia",,10.1109/ICEEI.2011.6021782,,cs.AR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In data communication via internet, security is becoming one of the most
influential aspects. One way to support it is by classifying and filtering
ethernet packets within network devices. Packet classification is a fundamental
task for network devices such as routers, firewalls, and intrusion detection
systems. In this paper we present architecture of fast and reconfigurable
Packet Classification Engine (PCE). This engine is used in FPGA-based firewall.
Our PCE inspects multi-dimensional field of packet header sequentially based on
tree-based algorithm. This algorithm simplifies overall system to a lower scale
and leads to a more secure system. The PCE works with an adaptation of single
cycle processor architecture in the system. Ethernet packet is examined with
PCE based on Source IP Address, Destination IP Address, Source Port,
Destination Port, and Protocol fields of the packet header. These are basic
fields to know whether it is a dangerous or normal packet before inspecting the
content. Using implementation of tree-based algorithm in the architecture,
firewall rules are rebuilt into 24-bit sub-rules which are read as processor
instruction in the inspection process. The inspection process is comparing one
sub-rule with input field of header every clock cycle. The proposed PCE shows
91 MHz clock frequency in Cyclone II EP2C70F896C6 with 13 clocks throughput
average from input to output generation. The use of tree-based algorithm
simplifies the multidimensional packet inspection and gives us reconfigurable
as well as scalable system. The architecture is fast, reliable, and adaptable
and also can maximize the advantages of the algorithm very well. Although the
PCE has high frequency and little amount of clock, filtering speed of a
firewall also depends on the other components, such as packet FIFO buffer. Fast
and reliable FIFO buffer is needed to support the PCE. This PCE also is not
completed with rule update mechanism yet. This proposed PCE is tested as a
component of FPGA-based firewall to filter Ethernet packet with FPGA DE2 Board
using NIOS II platform.
","[{'version': 'v1', 'created': 'Fri, 18 Nov 2016 13:59:39 GMT'}]",2016-11-21,"[['Wicaksana', 'Arief', '', 'ITB'], ['Sasongko', 'Arif', '', 'ITB']]","['Packet Classification Engine', 'Tree-Based Algorithm', 'Processor Architecture']"
2713,2110.11740,Johnnatan Messias,"Johnnatan Messias, Mohamed Alzayat, Balakrishnan Chandrasekaran,
  Krishna P. Gummadi, Patrick Loiseau, Alan Mislove","Selfish & Opaque Transaction Ordering in the Bitcoin Blockchain: The
  Case for Chain Neutrality",This is a pre-print of our paper accepted to appear to ACM IMC 2021,"In Proceedings of the ACM SIGCOMM Internet Measurement Conference
  (IMC 2021)",10.1145/3487552.3487823,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Most public blockchain protocols, including the popular Bitcoin and Ethereum
blockchains, do not formally specify the order in which miners should select
transactions from the pool of pending (or uncommitted) transactions for
inclusion in the blockchain. Over the years, informal conventions or ""norms""
for transaction ordering have, however, emerged via the use of shared software
by miners, e.g., the GetBlockTemplate (GBT) mining protocol in Bitcoin Core.
Today, a widely held view is that Bitcoin miners prioritize transactions based
on their offered ""transaction fee-per-byte."" Bitcoin users are, consequently,
encouraged to increase the fees to accelerate the commitment of their
transactions, particularly during periods of congestion. In this paper, we
audit the Bitcoin blockchain and present statistically significant evidence of
mining pools deviating from the norms to accelerate the commitment of
transactions for which they have (i) a selfish or vested interest, or (ii)
received dark-fee payments via opaque (non-public) side-channels. As
blockchains are increasingly being used as a record-keeping substrate for a
variety of decentralized (financial technology) systems, our findings call for
an urgent discussion on defining neutrality norms that miners must adhere to
when ordering transactions in the chains. Finally, we make our data sets and
scripts publicly available.
","[{'version': 'v1', 'created': 'Fri, 22 Oct 2021 12:29:31 GMT'}]",2021-10-25,"[['Messias', 'Johnnatan', ''], ['Alzayat', 'Mohamed', ''], ['Chandrasekaran', 'Balakrishnan', ''], ['Gummadi', 'Krishna P.', ''], ['Loiseau', 'Patrick', ''], ['Mislove', 'Alan', '']]","['Blockchain', 'transaction commit times', 'transaction ordering']"
2714,1511.03925,M Borkowski,M. Borkowski,"The scalability of the matrices in direct Trefftz method in 2D Laplace
  problem",,,10.1016/j.enganabound.2015.11.010,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an interesting property of the matrices that may be
obtained with the use of direct Trefftz method. It is proved analytically for
2D Laplace problem that values of the elements of matrices describing the
capacitance of two scaled domains are inversely proportional to the scalability
factor. As an example of the application the capacitance extraction problem is
chosen. Concise description of the algorithm in which the scalability property
can be utilized is given. Furthermore some numerical results of the algorithm
are presented.
","[{'version': 'v1', 'created': 'Thu, 12 Nov 2015 15:25:39 GMT'}]",2015-11-19,"[['Borkowski', 'M.', '']]","['direct Trefftz method', '2D potential problem', 'scalable stiffness matrix']"
2715,1606.07802,Kyle Niemeyer,Kyle E. Niemeyer and Chih-Jen Sung,"On the importance of graph search algorithms for DRGEP-based mechanism
  reduction methods","17 pages, 2 figures",Combustion and Flame 158(8) (2011) 1439-1443,10.1016/j.combustflame.2010.12.010,,cs.DS physics.chem-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The importance of graph search algorithm choice to the directed relation
graph with error propagation (DRGEP) method is studied by comparing basic and
modified depth-first search, basic and R-value-based breadth-first search
(RBFS), and Dijkstra's algorithm. By using each algorithm with DRGEP to produce
skeletal mechanisms from a detailed mechanism for n-heptane with
randomly-shuffled species order, it is demonstrated that only Dijkstra's
algorithm and RBFS produce results independent of species order. In addition,
each algorithm is used with DRGEP to generate skeletal mechanisms for n-heptane
covering a comprehensive range of autoignition conditions for pressure,
temperature, and equivalence ratio. Dijkstra's algorithm combined with a
coefficient scaling approach is demonstrated to produce the most compact
skeletal mechanism with a similar performance compared to larger skeletal
mechanisms resulting from the other algorithms. The computational efficiency of
each algorithm is also compared by applying the DRGEP method with each search
algorithm on the large detailed mechanism for n-alkanes covering n-octane to
n-hexadecane with 2115 species and 8157 reactions. Dijkstra's algorithm
implemented with a binary heap priority queue is demonstrated as the most
efficient method, with a CPU cost two orders of magnitude less than the other
search algorithms.
","[{'version': 'v1', 'created': 'Fri, 24 Jun 2016 00:56:21 GMT'}]",2016-06-28,"[['Niemeyer', 'Kyle E.', ''], ['Sung', 'Chih-Jen', '']]","['Mechanism reduction', 'Skeletal mechanism', 'DRG', 'DRGEP', 'Graph search algorithm', 'Dijkstra’s algorithm']"
2716,1705.09346,Minati De,"Ankush Acharyya, Minati De, Subhas C. Nandy and Bodhayan Roy","Range Assignment of Base-Stations Maximizing Coverage Area without
  Interference","27 pages, 15 figures",,10.1016/j.tcs.2019.10.044,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of assigning non-overlapping geometric objects centered
at a given set of points such that the sum of area covered by them is
maximized. If the points are placed on a straight-line and the objects are
disks, then the problem is solvable in polynomial time. However, we show that
the problem is NP-hard even for simplest objects like disks or squares in
${\mathbb{R}}^2$. Eppstein [CCCG, pages 260--265, 2016] proposed a polynomial
time algorithm for maximizing the sum of radii (or perimeter) of
non-overlapping balls or disks when the points are arbitrarily placed on a
plane. We show that Eppstein's algorithm for maximizing sum of perimeter of the
disks in ${\mathbb{R}}^2$ gives a $2$-approximation solution for the sum of
area maximization problem. We propose a PTAS for our problem. These
approximation results are extendible to higher dimensions. All these
approximation results hold for the area maximization problem by regular convex
polygons with even number of edges centered at the given points.
","[{'version': 'v1', 'created': 'Thu, 25 May 2017 20:10:55 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Jul 2017 16:33:13 GMT'}, {'version': 'v3', 'created': 'Thu, 14 Sep 2017 09:57:52 GMT'}]",2022-02-22,"[['Acharyya', 'Ankush', ''], ['De', 'Minati', ''], ['Nandy', 'Subhas C.', ''], ['Roy', 'Bodhayan', '']]","['Quadratic programming', 'discrete packing', 'range assignment in wireless communication', 'NP-hardness', 'approximation algorithm', 'PTAS']"
2717,1701.08122,"Johannes H\""artel","Johannes H\""artel (University of Koblenz-Landau, Germany), Lukas
  H\""artel (University of Koblenz and Landau, Germany, Germany), Ralf L\""ammel
  (Universit\""at Koblenz-Landau, Germany), Andrei Varanovich (Universit\""at
  Koblenz-Landau, Germany), Marcel Heinz (University of Koblenz, Germany)",Interconnected Linguistic Architecture,"The Art, Science, and Engineering of Programming, Vol. 1, Issue 1,
  Article 3","The Art, Science, and Engineering of Programming, 2017, Vol. 1,
  Issue 1, Article 3",10.22152/programming-journal.org/2017/1/3,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The context of the reported research is the documentation of software
technologies such as object/relational mappers, web-application frameworks, or
code generators. We assume that documentation should model a macroscopic view
on usage scenarios of technologies in terms of involved artifacts, leveraged
software languages, data flows, conformance relationships, and others. In
previous work, we referred to such documentation also as 'linguistic
architecture'. The corresponding models may also be referred to as 'megamodels'
while adopting this term from the technological space of modeling/model-driven
engineering. This work is an inquiry into making such documentation less
abstract and more effective by means of connecting (mega)models, systems, and
developer experience in several ways. To this end, we adopt an approach that is
primarily based on prototyping (i.e., implementa- tion of a megamodeling
infrastructure with all conceivable connections) and experimentation with
showcases (i.e., documentation of concrete software technologies). The
knowledge gained by this research is a notion of interconnected linguistic
architecture on the grounds of connecting primary model elements, inferred
model elements, static and runtime system artifacts, traceability links, system
contexts, knowledge resources, plugged interpretations of model elements, and
IDE views. A corresponding suite of aspects of interconnected linguistic
architecture is systematically described. As to the grounding of this research,
we describe a literature survey which tracks scattered occurrences and thus
demonstrates the relevance of the identified aspects of interconnected
linguistic architecture. Further, we describe the MegaL/Xtext+IDE
infrastructure which realizes interconnected linguistic architecture. The
importance of this work lies in providing more formal (ontologically rich,
navigable, verifiable) documentation of software technologies helping
developers to better understand how to use technologies in new systems
(prescriptive mode) or how technologies are used in existing systems
(descriptive mode).
","[{'version': 'v1', 'created': 'Fri, 27 Jan 2017 17:17:11 GMT'}]",2017-02-01,"[['Härtel', 'Johannes', '', 'University of Koblenz-Landau, Germany'], ['Härtel', 'Lukas', '', 'University of Koblenz and Landau, Germany, Germany'], ['Lämmel', 'Ralf', '', 'Universität Koblenz-Landau, Germany'], ['Varanovich', 'Andrei', '', 'Universität\n  Koblenz-Landau, Germany'], ['Heinz', 'Marcel', '', 'University of Koblenz, Germany']]","['Documentation', 'Software technology', 'Linguistic architecture', 'Megamodeling', 'Traceability']"
2718,1904.02468,Lucas Gren,"Lucas Gren, Richard Torkar and Robert Feldt","Group development and group maturity when building agile teams: A
  qualitative and quantitative investigation at eight large companies",,The Journal of Systems and Software 124 (2017) 104-119,10.1016/j.jss.2016.11.024,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The agile approach to projects focuses more on close-knit teams than
traditional waterfall projects, which means that aspects of group maturity
become even more important. This psychological aspect is not much researched in
connection to the building of an ""agile team."" The purpose of this study is to
investigate how building agile teams is connected to a group development model
taken from social psychology. We conducted ten semi-structured interviews with
coaches, Scrum Masters, and managers responsible for the agile process from
seven different companies, and collected survey data from 66 group-members from
four companies (a total of eight different companies). The survey included an
agile measurement tool and the one part of the Group Development Questionnaire.
The results show that the practitioners define group developmental aspects as
key factors to a successful agile transition. Also, the quantitative
measurement of agility was significantly correlated to the group maturity
measurement. We conclude that adding these psychological aspects to the
description of the ""agile team"" could increase the understanding of agility and
partly help define an ""agile team."" We propose that future work should develop
specific guidelines for how software development teams at different maturity
levels might adopt agile principles and practices differently.
","[{'version': 'v1', 'created': 'Thu, 4 Apr 2019 10:51:24 GMT'}]",2019-04-05,"[['Gren', 'Lucas', ''], ['Torkar', 'Richard', ''], ['Feldt', 'Robert', '']]","['agile processes', 'measurement', 'group psychology', 'maturity', 'empirical study']"
2719,1712.01024,Mat\'u\v{s} Sul\'ir,"Mat\'u\v{s} Sul\'ir, Jaroslav Porub\""an",A Quantitative Study of Java Software Buildability,,"Proceedings of the 7th International Workshop on Evaluation and
  Usability of Programming Languages and Tools (PLATEAU 2016), pages 17-25.
  ACM, 2016",10.1145/3001878.3001882,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Researchers, students and practitioners often encounter a situation when the
build process of a third-party software system fails. In this paper, we aim to
confirm this observation present mainly as anecdotal evidence so far. Using a
virtual environment simulating a programmer's one, we try to fully
automatically build target archives from the source code of over 7,200 open
source Java projects. We found that more than 38% of builds ended in failure.
Build log analysis reveals the largest portion of errors are
dependency-related. We also conduct an association study of factors affecting
build success.
","[{'version': 'v1', 'created': 'Mon, 4 Dec 2017 11:51:30 GMT'}]",2017-12-05,"[['Sulír', 'Matúš', ''], ['Porubän', 'Jaroslav', '']]","['Build systems', 'Maven', 'Gradle', 'Ant', 'error logs']"
2720,1304.4811,Yongjune Kim,"Yongjune Kim, Kyoung Lae Cho, Hongrak Son, Jaehong Kim, Jun Jin Kong,
  Jaejin Lee, B. V. K. Vijaya Kumar",Modulation Coding for Flash Memories,"7 pages, 9 figures, Proc. IEEE International Conference on Computing,
  Networking and Communications (ICNC), Jan. 2013",,10.1109/ICCNC.2013.6504220,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aggressive scaling down of flash memories has threatened data reliability
since the scaling down of cell sizes gives rise to more serious degradation
mechanisms such as cell-to-cell interference and lateral charge spreading. The
effect of these mechanisms has pattern dependency and some data patterns are
more vulnerable than other ones. In this paper, we will categorize data
patterns taking into account degradation mechanisms and pattern dependency. In
addition, we propose several modulation coding schemes to improve the data
reliability by transforming original vulnerable data patterns into more robust
ones.
","[{'version': 'v1', 'created': 'Wed, 17 Apr 2013 13:23:42 GMT'}]",2014-12-11,"[['Kim', 'Yongjune', ''], ['Cho', 'Kyoung Lae', ''], ['Son', 'Hongrak', ''], ['Kim', 'Jaehong', ''], ['Kong', 'Jun Jin', ''], ['Lee', 'Jaejin', ''], ['Kumar', 'B. V. K. Vijaya', '']]","['Cell-to-cell interference', 'flash memory', 'lateral']"
2721,1902.09347,Huiru Xiao,"Huiru Xiao, Xin Liu, Yangqiu Song","Efficient Path Prediction for Semi-Supervised and Weakly Supervised
  Hierarchical Text Classification",Aceepted by 2019 World Wide Web Conference (WWW19),,10.1145/3308558.3313658,,cs.LG cs.IR stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Hierarchical text classification has many real-world applications. However,
labeling a large number of documents is costly. In practice, we can use
semi-supervised learning or weakly supervised learning (e.g., dataless
classification) to reduce the labeling cost. In this paper, we propose a path
cost-sensitive learning algorithm to utilize the structural information and
further make use of unlabeled and weakly-labeled data. We use a generative
model to leverage the large amount of unlabeled data and introduce path
constraints into the learning algorithm to incorporate the structural
information of the class hierarchy. The posterior probabilities of both
unlabeled and weakly labeled data can be incorporated with path-dependent
scores. Since we put a structure-sensitive cost to the learning algorithm to
constrain the classification consistent with the class hierarchy and do not
need to reconstruct the feature vectors for different structures, we can
significantly reduce the computational cost compared to structural output
learning. Experimental results on two hierarchical text classification
benchmarks show that our approach is not only effective but also efficient to
handle the semi-supervised and weakly supervised hierarchical text
classification.
","[{'version': 'v1', 'created': 'Mon, 25 Feb 2019 15:11:44 GMT'}]",2019-02-26,"[['Xiao', 'Huiru', ''], ['Liu', 'Xin', ''], ['Song', 'Yangqiu', '']]","['Hierarchical Text Classification', 'Semi-Supervised Learning', 'WeaklySupervised Learning', 'Structured Prediction']"
2722,1711.02880,Celine Comte,"Thomas Bonald (LINCS), C\'eline Comte (LINCS), Fabien Mathieu (LINCS)",Performance of Balanced Fairness in Resource Pools: A Recursive Approach,,"Proceedings of the ACM on Measurement and Analysis of Computing
  Systems , ACM, 2017, 1 (2), pp.1-25. \&\#x27E8;10.1145/3154500\&\#x27E9",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding the performance of a pool of servers is crucial for proper
dimensioning. One of the main challenges is to take into account the complex
interactions between servers that are pooled to process jobs. In particular, a
job can generally not be processed by any server of the cluster due to various
constraints like data locality. In this paper, we represent these constraints
by some assignment graph between jobs and servers. We present a recursive
approach to computing performance metrics like mean response times when the
server capacities are shared according to balanced fairness. While the
computational cost of these formulas can be exponential in the number of
servers in the worst case, we illustrate their practical interest by
introducing broad classes of pool structures that can be exactly analyzed in
polynomial time. This extends considerably the class of models for which
explicit performance metrics are accessible.
","[{'version': 'v1', 'created': 'Wed, 8 Nov 2017 09:38:57 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Dec 2017 07:38:46 GMT'}, {'version': 'v3', 'created': 'Wed, 2 Oct 2019 08:18:45 GMT'}]",2019-10-03,"[['Bonald', 'Thomas', '', 'LINCS'], ['Comte', 'Céline', '', 'LINCS'], ['Mathieu', 'Fabien', '', 'LINCS']]","['Balanced fairness', 'parallel computing', 'performance evaluation']"
2723,1708.07342,Alberto Giaretta,Alberto Giaretta and Nicola Dragoni,"Community Targeted Phishing: A Middle Ground Between Massive and Spear
  Phishing through Natural Language Generation","8 pages, 3 images","Proceedings of 6th International Conference in Software
  Engineering for Defence Applications. SEDA 2018. Advances in Intelligent
  Systems and Computing, vol 925. Springer, Cham",10.1007/978-3-030-14687-0_8,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Looking at today phishing panorama, we are able to identify two diametrically
opposed approaches. On the one hand, massive phishing targets as many people as
possible with generic and preformed texts. On the other hand, spear phishing
targets high-value victims with hand-crafted emails. While nowadays these two
worlds partially intersect, we envision a future where Natural Language
Generation (NLG) techniques will enable attackers to target populous
communities with machine-tailored emails. In this paper, we introduce what we
call Community Targeted Phishing (CTP), alongside with some workflows that
exhibit how NLG techniques can craft such emails. Furthermore, we show how
Advanced NLG techniques could provide phishers new powerful tools to bring up
to the surface new information from complex data-sets, and use such information
to threaten victims' private data.
","[{'version': 'v1', 'created': 'Thu, 24 Aug 2017 10:08:46 GMT'}, {'version': 'v2', 'created': 'Sat, 23 Jun 2018 18:00:49 GMT'}]",2022-09-21,"[['Giaretta', 'Alberto', ''], ['Dragoni', 'Nicola', '']]","['phishing', 'NLG', 'Natural Language Generation']"
2724,1406.0298,Sahabul Alam,Sahabul Alam and Debashis De,Analysis of Security Threats in Wireless Sensor Network,"12 pages, 2 figures. arXiv admin note: substantial text overlap with
  arXiv:0712.4169 by other authors",,10.5121/ijwmn.2014.6204,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless Sensor Network(WSN) is an emerging technology and explored field of
researchers worldwide in the past few years, so does the need for effective
security mechanisms. The sensing technology combined with processing power and
wireless communication makes it lucrative for being exploited in abundance in
future. The inclusion of wireless communication technology also incurs various
types of security threats due to unattended installation of sensor nodes as
sensor networks may interact with sensitive data and /or operate in hostile
unattended environments. These security concerns be addressed from the
beginning of the system design. The intent of this paper is to investigate the
security related issues in wireless sensor networks. In this paper we have
explored general security threats in wireless sensor network with extensive
study.
","[{'version': 'v1', 'created': 'Mon, 2 Jun 2014 09:00:45 GMT'}]",2014-06-03,"[['Alam', 'Sahabul', ''], ['De', 'Debashis', '']]","['Wireless Sensor Networks', 'Security', 'Threats', 'Attacks']"
2725,1101.6029,Fernando Silva,"Ricardo Lopes, V\'itor Santos Costa and Fernando Silva",A Design and Implementation of the Extended Andorra Model,"43 pages, To appear in Theory and Practice of Logic Programming
  (TPLP)",,10.1017/S1471068411000068,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Logic programming provides a high-level view of programming, giving
implementers a vast latitude into what techniques to explore to achieve the
best performance for logic programs. Towards obtaining maximum performance, one
of the holy grails of logic programming has been to design computational models
that could be executed efficiently and that would allow both for a reduction of
the search space and for exploiting all the available parallelism in the
application. These goals have motivated the design of the Extended Andorra
Model, a model where goals that do not constrain non-deterministic goals can
execute first.
  In this work we present and evaluate the Basic design for Extended Andorra
Model (BEAM), a system that builds upon David H. D. Warren's original EAM with
Implicit Control. We provide a complete description and implementation of the
BEAM System as a set of rewrite and control rules. We present the major data
structures and execution algorithms that are required for efficient execution,
and evaluate system performance.
  A detailed performance study of our system is included. Our results show that
the system achieves acceptable base performance, and that a number of
applications benefit from the advanced search inherent to the EAM.
","[{'version': 'v1', 'created': 'Mon, 31 Jan 2011 17:15:09 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Feb 2011 17:10:34 GMT'}]",2011-05-23,"[['Lopes', 'Ricardo', ''], ['Costa', 'Vítor Santos', ''], ['Silva', 'Fernando', '']]","['Logic Programming', 'Implementation', 'Extended Andorra Model']"
2726,1510.06882,Damien Imbs,Damien Imbs and Michel Raynal,"Trading off $t$-Resilience for Efficiency in Asynchronous Byzantine
  Reliable Broadcast",,,10.1142/S0129626416500171,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a simple and efficient reliable broadcast algorithm for
asynchronous message-passing systems made up of $n$ processes, among which up
to $t<n/5$ may behave arbitrarily (Byzantine processes). This algorithm
requires two communication steps and $n^2-1$ messages. When compared to
Bracha's algorithm, which is resilience optimal ($t<n/3$) and requires three
communication steps and $2n^2-n-1$ messages, the proposed algorithm shows an
interesting tradeoff between communication efficiency and $t$-resilience.
","[{'version': 'v1', 'created': 'Fri, 23 Oct 2015 10:29:19 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Sep 2021 07:33:59 GMT'}]",2021-09-29,"[['Imbs', 'Damien', ''], ['Raynal', 'Michel', '']]","['Algorithm', 'Asynchronous system', 'Byzantine process', 'Distributed computing', 'Faulttolerance', 'Message-passing', 'Reliable broadcast']"
2727,1201.0942,Anna Kucerova,Eliska Janouchova and Anna Kucerova,"Competitive Comparison of Optimal Designs of Experiments for
  Sampling-based Sensitivity Analysis","18 pages, 15 figures, 4 tables, CSC2011 special issue, corrected and
  extended after the first review","Computers & Structures, 124, 47-60, 2013",10.1016/j.compstruc.2013.04.009,,cs.CE cs.NA stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, the numerical models of real-world structures are more precise,
more complex and, of course, more time-consuming. Despite the growth of a
computational effort, the exploration of model behaviour remains a complex
task. The sensitivity analysis is a basic tool for investigating the
sensitivity of the model to its inputs. One widely used strategy to assess the
sensitivity is based on a finite set of simulations for a given sets of input
parameters, i.e. points in the design space. An estimate of the sensitivity can
be then obtained by computing correlations between the input parameters and the
chosen response of the model. The accuracy of the sensitivity prediction
depends on the choice of design points called the design of experiments. The
aim of the presented paper is to review and compare available criteria
determining the quality of the design of experiments suitable for
sampling-based sensitivity analysis.
","[{'version': 'v1', 'created': 'Wed, 4 Jan 2012 17:35:27 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Dec 2012 08:11:50 GMT'}]",2014-10-17,"[['Janouchova', 'Eliska', ''], ['Kucerova', 'Anna', '']]","['Design of experiments', 'Space-filling', 'Orthogonality', 'Latin Hypercube Sampling', 'Sampling-based sensitivity analysis']"
2728,0902.1647,Anna Kucerova,"O. Hrstka, A. Kucerova, M. Leps and J. Zeman",A competitive comparison of different types of evolutionary algorithms,"25 pages, 8 figures, 5 tables","Computers & Structures, 81 (18-19), 1979-1990, 2003",10.1016/S0045-7949(03)00217-7,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents comparison of several stochastic optimization algorithms
developed by authors in their previous works for the solution of some problems
arising in Civil Engineering. The introduced optimization methods are: the
integer augmented simulated annealing (IASA), the real-coded augmented
simulated annealing (RASA), the differential evolution (DE) in its original
fashion developed by R. Storn and K. Price and simplified real-coded
differential genetic algorithm (SADE). Each of these methods was developed for
some specific optimization problem; namely the Chebychev trial polynomial
problem, the so called type 0 function and two engineering problems - the
reinforced concrete beam layout and the periodic unit cell problem
respectively. Detailed and extensive numerical tests were performed to examine
the stability and efficiency of proposed algorithms. The results of our
experiments suggest that the performance and robustness of RASA, IASA and SADE
methods are comparable, while the DE algorithm performs slightly worse. This
fact together with a small number of internal parameters promotes the SADE
method as the most robust for practical use.
","[{'version': 'v1', 'created': 'Tue, 10 Feb 2009 13:41:15 GMT'}]",2009-02-11,"[['Hrstka', 'O.', ''], ['Kucerova', 'A.', ''], ['Leps', 'M.', ''], ['Zeman', 'J.', '']]","['optimization', 'evolutionary methods', 'genetic algorithms', 'differential evolution', 'engineering tasks']"
2729,1706.06699,Amirhossein Tavanaei,"Amirhossein Tavanaei, Timothee Masquelier, Anthony Maida",Representation Learning using Event-based STDP,,"Neural Networks, vol. 105, pp. 294-303, 2018",10.1016/j.neunet.2018.05.018,,cs.NE q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although representation learning methods developed within the framework of
traditional neural networks are relatively mature, developing a spiking
representation model remains a challenging problem. This paper proposes an
event-based method to train a feedforward spiking neural network (SNN) layer
for extracting visual features. The method introduces a novel
spike-timing-dependent plasticity (STDP) learning rule and a threshold
adjustment rule both derived from a vector quantization-like objective function
subject to a sparsity constraint. The STDP rule is obtained by the gradient of
a vector quantization criterion that is converted to spike-based,
spatio-temporally local update rules in a spiking network of leaky,
integrate-and-fire (LIF) neurons. Independence and sparsity of the model are
achieved by the threshold adjustment rule and by a softmax function
implementing inhibition in the representation layer consisting of
WTA-thresholded spiking neurons. Together, these mechanisms implement a form of
spike-based, competitive learning. Two sets of experiments are performed on the
MNIST and natural image datasets. The results demonstrate a sparse spiking
visual representation model with low reconstruction loss comparable with
state-of-the-art visual coding approaches, yet our rule is local in both time
and space, thus biologically plausible and hardware friendly.
","[{'version': 'v1', 'created': 'Tue, 20 Jun 2017 23:13:31 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Nov 2017 01:26:09 GMT'}, {'version': 'v3', 'created': 'Fri, 9 Mar 2018 17:24:56 GMT'}]",2018-06-15,"[['Tavanaei', 'Amirhossein', ''], ['Masquelier', 'Timothee', ''], ['Maida', 'Anthony', '']]","['Representation Learning', 'spiking neural networks', 'quantization', 'STDP', 'bio-inspired model']"
2730,1806.02479,Yisu Zhou,"Yisu Zhou, Xiaolin Hu, Bo Zhang",Interlinked Convolutional Neural Networks for Face Parsing,"11 pages, 4 figures, ISNN2015 Conference","International Symposium on Neural Networks. Springer, Cham, 2015",10.1007/978-3-319-25393-0_25,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Face parsing is a basic task in face image analysis. It amounts to labeling
each pixel with appropriate facial parts such as eyes and nose. In the paper,
we present a interlinked convolutional neural network (iCNN) for solving this
problem in an end-to-end fashion. It consists of multiple convolutional neural
networks (CNNs) taking input in different scales. A special interlinking layer
is designed to allow the CNNs to exchange information, enabling them to
integrate local and contextual information efficiently. The hallmark of iCNN is
the extensive use of downsampling and upsampling in the interlinking layers,
while traditional CNNs usually uses downsampling only. A two-stage pipeline is
proposed for face parsing and both stages use iCNN. The first stage localizes
facial parts in the size-reduced image and the second stage labels the pixels
in the identified facial parts in the original image. On a benchmark dataset we
have obtained better results than the state-of-the-art methods.
","[{'version': 'v1', 'created': 'Thu, 7 Jun 2018 01:10:08 GMT'}]",2018-06-08,"[['Zhou', 'Yisu', ''], ['Hu', 'Xiaolin', ''], ['Zhang', 'Bo', '']]","['Convolutional neural network', 'face parsing', 'deep learning', 'scene labeling']"
2731,1507.04907,Martin Kouteck\'y,"Petr Kolman, Martin Kouteck\'y, Hans Raj Tiwary","Extension Complexity, MSO Logic, and Treewidth",Final version accepted by DMTCS,"Discrete Mathematics & Theoretical Computer Science, vol. 22 no.
  4, Discrete Algorithms (October 1, 2020) dmtcs:6811",10.23638/DMTCS-22-4-8,,cs.DS cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the convex hull $P_{\varphi}(G)$ of all satisfying assignments of
a given MSO formula $\varphi$ on a given graph $G$. We show that there exists
an extended formulation of the polytope $P_{\varphi}(G)$ that can be described
by $f(|\varphi|,\tau)\cdot n$ inequalities, where $n$ is the number of vertices
in $G$, $\tau$ is the treewidth of $G$ and $f$ is a computable function
depending only on $\varphi$ and $\tau.$
  In other words, we prove that the extension complexity of $P_{\varphi}(G)$ is
linear in the size of the graph $G$, with a constant depending on the treewidth
of $G$ and the formula $\varphi$. This provides a very general yet very simple
meta-theorem about the extension complexity of polytopes related to a wide
class of problems and graphs. As a corollary of our main result, we obtain an
analogous result % for the weaker MSO$_1$ logic on the wider class of graphs of
bounded cliquewidth.
  Furthermore, we study our main geometric tool which we term the glued product
of polytopes. While the glued product of polytopes has been known since the
'90s, we are the first to show that it preserves decomposability and
boundedness of treewidth of the constraint matrix. This implies that our
extension of $P_\varphi(G)$ is decomposable and has a constraint matrix of
bounded treewidth; so far only few classes of polytopes are known to be
decomposable. These properties make our extension useful in the construction of
algorithms.
","[{'version': 'v1', 'created': 'Fri, 17 Jul 2015 10:31:53 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Nov 2015 19:24:43 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Jul 2016 02:30:32 GMT'}, {'version': 'v4', 'created': 'Sun, 27 Nov 2016 17:08:24 GMT'}, {'version': 'v5', 'created': 'Tue, 28 Feb 2017 11:25:46 GMT'}, {'version': 'v6', 'created': 'Thu, 11 May 2017 20:12:44 GMT'}, {'version': 'v7', 'created': 'Mon, 17 Jun 2019 13:45:25 GMT'}, {'version': 'v8', 'created': 'Mon, 29 Jun 2020 18:02:14 GMT'}, {'version': 'v9', 'created': 'Tue, 29 Sep 2020 15:08:52 GMT'}]",2021-02-10,"[['Kolman', 'Petr', ''], ['Koutecký', 'Martin', ''], ['Tiwary', 'Hans Raj', '']]","['Extension Complexity', 'FPT', 'Courcelle’s Theorem', 'MSO Logic']"
2732,2105.04693,Fabio Caraffini PhD,"Bas van Stein, Fabio Caraffini and Anna V. Kononova",Emergence of Structural Bias in Differential Evolution,,,10.1145/3449726.3463223,,cs.NE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Heuristic optimisation algorithms are in high demand due to the overwhelming
amount of complex optimisation problems that need to be solved. The complexity
of these problems is well beyond the boundaries of applicability of exact
optimisation algorithms and therefore require modern heuristics to find
feasible solutions quickly. These heuristics and their effects are almost
always evaluated and explained by particular problem instances. In previous
works, it has been shown that many such algorithms show structural bias, by
either being attracted to a certain region of the search space or by
consistently avoiding regions of the search space, on a special test function
designed to ensure uniform 'exploration' of the domain. In this paper, we
analyse the emergence of such structural bias for Differential Evolution (DE)
configurations and, specifically, the effect of different mutation, crossover
and correction strategies. We also analyse the emergence of the structural bias
during the run-time of each algorithm. We conclude with recommendations of
which configurations should be avoided in order to run DE unbiased.
","[{'version': 'v1', 'created': 'Mon, 10 May 2021 22:22:27 GMT'}]",2021-05-12,"[['van Stein', 'Bas', ''], ['Caraffini', 'Fabio', ''], ['Kononova', 'Anna V.', '']]","['structural bias', 'algorithmic behaviour', 'differential evolution', 'parameter setting', 'constraints handling']"
2733,1807.01747,Vasile Patrascu,Vasile Patrascu,Shannon entropy for intuitionistic fuzzy information,10 pages,,10.13140/RG.2.2.19707.41764,"Technical Report, R.C.E.I.T-1.6.18",cs.AI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents an extension of Shannon fuzzy entropy for intuitionistic
fuzzy one. Firstly, we presented a new formula for calculating the distance and
similarity of intuitionistic fuzzy information. Then, we constructed measures
for information features like score, certainty and uncertainty. Also, a new
concept was introduced, namely escort fuzzy information. Then, using the escort
fuzzy information, Shannon's formula for intuitionistic fuzzy information was
obtained. It should be underlined that Shannon's entropy for intuitionistic
fuzzy information verifies the four defining conditions of intuitionistic fuzzy
uncertainty. The measures of its two components were also identified: fuzziness
(ambiguity) and incompleteness (ignorance).
","[{'version': 'v1', 'created': 'Mon, 2 Jul 2018 06:06:00 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Jul 2018 13:10:13 GMT'}]",2018-07-09,"[['Patrascu', 'Vasile', '']]","['Intuitionistic fuzzy information', 'escort fuzzy information', 'intuitionistic fuzzy entropy', 'Shannon entropy']"
2734,1902.01483,Nikolaj Tatti,Nikolaj Tatti and Aristides Gionis,Discovering Nested Communities,,,10.1007/978-3-642-40991-2_3,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finding communities in graphs is one of the most well-studied problems in
data mining and social-network analysis. In many real applications, the
underlying graph does not have a clear community structure. In those cases,
selecting a single community turns out to be a fairly ill-posed problem, as the
optimization criterion has to make a difficult choice between selecting a tight
but small community or a more inclusive but sparser community.
  In order to avoid the problem of selecting only a single community we propose
discovering a sequence of nested communities. More formally, given a graph and
a starting set, our goal is to discover a sequence of communities all
containing the starting set, and each community forming a denser subgraph than
the next. Discovering an optimal sequence of communities is a complex
optimization problem, and hence we divide it into two subproblems: 1) discover
the optimal sequence for a fixed order of graph vertices, a subproblem that we
can solve efficiently, and 2) find a good order. We employ a simple heuristic
for discovering an order and we provide empirical and theoretical evidence that
our order is good.
","[{'version': 'v1', 'created': 'Mon, 4 Feb 2019 22:30:08 GMT'}]",2019-02-06,"[['Tatti', 'Nikolaj', ''], ['Gionis', 'Aristides', '']]","['community discovery', 'monotonic segmentation', 'graph mining', 'nested communities']"
2735,1308.6566,Jason McEwen,"Rodney A. Kennedy, Parastoo Sadeghi, Zubair Khalid and Jason D. McEwen","Classification and construction of closed-form kernels for signal
  representation on the 2-sphere","15 pages, 6 figures, Proceedings of Wavelets and Sparsity XV, SPIE
  Optics and Photonics 2013","Proc. SPIE 8858, Wavelets and Sparsity XV, 88580M (2013)",10.1117/12.2026126,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the construction of Reproducing Kernel Hilbert Spaces
(RKHS) on the sphere as an alternative to the conventional Hilbert space using
the inner product that yields the L^2(S^2) function space of finite energy
signals. In comparison with wavelet representations, which have
multi-resolution properties on L^2(S^2), the representations that arise from
the RKHS approach, which uses different inner products, have an overall
smoothness constraint, which may offer advantages and simplifications in
certain contexts. The key contribution of this paper is to construct classes of
closed-form kernels, such as one based on the von Mises-Fisher distribution,
which permits efficient inner product computation using kernel evaluations.
Three classes of RKHS are defined: isotropic kernels and non-isotropic kernels
both with spherical harmonic eigenfunctions, and general anisotropic kernels.
","[{'version': 'v1', 'created': 'Thu, 29 Aug 2013 19:16:15 GMT'}]",2013-12-10,"[['Kennedy', 'Rodney A.', ''], ['Sadeghi', 'Parastoo', ''], ['Khalid', 'Zubair', ''], ['McEwen', 'Jason D.', '']]","['Reproducing kernels', 'RKHS', '2-sphere', 'isotropic kernels']"
2736,1410.2205,Lawrence Nehemiah,Lawrence Nehemiah,"Towards EHR interoperability in Tanzania hospitals: Issues, Challenges
  and Opportunities","8 pages, 3 tables","International Journal of Computer Science, Engineering and
  Applications (IJCSEA) Vol.4, No.4, August 2014 (ISSN:2230 - 9616)",10.5121/ijcsea.2014.4404,,cs.CY,http://creativecommons.org/licenses/by/3.0/,"  This study aimed at identifying the issue, challenges and opportunities from
the health consumers in Tanzania towards interoperability of electronic health
records. Recognizing that we conducted a study to identify the challenges,
issues and opportunities towards health information exchange. The study was
conducted in three major cities of Tanzania. This was in order to come up with
a clear picture of how to implement some EHRs that will be trusted by health
consumers. The participants (n=240) were surveyed on computer usage, EHRs
knowledge, demographics, security and privacy issues. A total of 200 surveys
were completed and returned (83.3% response rate). 67.5% were women, 62.6% had
not heard of EHRs, 73% highly concerned about privacy and security of their
information. 75% believed that introduction of various security mechanisms will
make EHRs more secure. A number of chi-square tests (p<0.05) showed there was a
strong relationship among the variable of age, computer use, EHRs knowledge and
concerns for privacy and security. The study showed that there was a small
difference of 8.5% between those who think EHRs are safer than paper records
and those who think otherwise. The general observation of the study was that in
order to make EHRs successful, then the issue of security, and health consumer
involvement were two key towards the road of successful EHRs in our hospitals
practices and that will make consumers more willing to allow their records to
be shared.
","[{'version': 'v1', 'created': 'Wed, 10 Sep 2014 12:05:37 GMT'}]",2014-10-09,"[['Nehemiah', 'Lawrence', '']]","['Electronic Health Record (EHR)', 'Privacy', 'Security', 'Interoperability', 'Paper-records']"
2737,1706.07913,Mahamad Suhil,"Harsha S. Gowda, Mahamad Suhil, D.S. Guru, and Lavanya Narayana Raju",Semi-supervised Text Categorization Using Recursive K-means Clustering,"11 Pages, 8 Figures, Conference: RTIP2R",,10.1007/978-981-10-4859-3_20,,cs.LG cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a semi-supervised learning algorithm for
classification of text documents. A method of labeling unlabeled text documents
is presented. The presented method is based on the principle of divide and
conquer strategy. It uses recursive K-means algorithm for partitioning both
labeled and unlabeled data collection. The K-means algorithm is applied
recursively on each partition till a desired level partition is achieved such
that each partition contains labeled documents of a single class. Once the
desired clusters are obtained, the respective cluster centroids are considered
as representatives of the clusters and the nearest neighbor rule is used for
classifying an unknown text document. Series of experiments have been conducted
to bring out the superiority of the proposed model over other recent state of
the art models on 20Newsgroups dataset.
","[{'version': 'v1', 'created': 'Sat, 24 Jun 2017 06:08:27 GMT'}]",2017-06-27,"[['Gowda', 'Harsha S.', ''], ['Suhil', 'Mahamad', ''], ['Guru', 'D. S.', ''], ['Raju', 'Lavanya Narayana', '']]","['Unlabeled Text Documents', 'Recursive K-means Algorithm', 'Semisupervised Learning', 'Text Categorization']"
2738,1712.08941,Fabio Crestani Prof.,Kasturi Dewi Varathan and Anastasia Giachanou and Fabio Crestani,Comparative Opinion Mining: A Review,,"Journal of the Association for Information Science and Technology,
  68(4), 2017",10.1002/asi.23716,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Opinion mining refers to the use of natural language processing, text
analysis and computational linguistics to identify and extract subjective
information in textual material. Opinion mining, also known as sentiment
analysis, has received a lot of attention in recent times, as it provides a
number of tools to analyse the public opinion on a number of different topics.
Comparative opinion mining is a subfield of opinion mining that deals with
identifying and extracting information that is expressed in a comparative form
(e.g.~""paper X is better than the Y""). Comparative opinion mining plays a very
important role when ones tries to evaluate something, as it provides a
reference point for the comparison. This paper provides a review of the area of
comparative opinion mining. It is the first review that cover specifically this
topic as all previous reviews dealt mostly with general opinion mining. This
survey covers comparative opinion mining from two different angles. One from
perspective of techniques and the other from perspective of comparative opinion
elements. It also incorporates preprocessing tools as well as dataset that were
used by the past researchers that can be useful to the future researchers in
the field of comparative opinion mining.
","[{'version': 'v1', 'created': 'Sun, 24 Dec 2017 16:16:07 GMT'}]",2017-12-27,"[['Varathan', 'Kasturi Dewi', ''], ['Giachanou', 'Anastasia', ''], ['Crestani', 'Fabio', '']]","['comparative opinion mining', 'entity retrieval', 'relation']"
2739,1807.06435,Josue Tonelli-Cueto,"Peter B\""urgisser and Felipe Cucker and Josu\'e Tonelli-Cueto",Computing the Homology of Semialgebraic Sets I: Lax Formulas,43 pages,"Found Comput Math 20, 71-118 (2020)",10.1007/s10208-019-09418-y,,cs.CG math.AG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe and analyze an algorithm for computing the homology (Betti
numbers and torsion coefficients) of closed semialgebraic sets given by Boolean
formulas without negations over lax polynomial inequalities. The algorithm
works in weak exponential time. This means that outside a subset of data having
exponentially small measure, the cost of the algorithm is single exponential in
the size of the data.
  All previous algorithms solving this problem have doubly exponential
complexity (and this is so for almost all input data). Our algorithm thus
represents an exponential acceleration over state-of-the-art algorithms for all
input data outside a set that vanishes exponentially fast.
","[{'version': 'v1', 'created': 'Tue, 10 Jul 2018 12:53:32 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Dec 2018 11:31:02 GMT'}, {'version': 'v3', 'created': 'Tue, 19 Mar 2019 13:38:23 GMT'}]",2020-12-22,"[['Bürgisser', 'Peter', ''], ['Cucker', 'Felipe', ''], ['Tonelli-Cueto', 'Josué', '']]","['Homology groups', 'Weak complexity', 'Numerical algorithms']"
2740,1904.00616,Aneel Tanwani,GuangXue Zhang and Aneel Tanwani,"ISS Lyapunov Functions for Cascade Switched Systems and Sampled-Data
  Control","The article has been published in Automatica. Minor
  corrections/modifications compared to the journal version are indicated in
  blue colored text","Automatica, 105:216--227, July 2019",10.1016/j.automatica.2019.03.028,,cs.SY math.DS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Input-to-state stability (ISS) of switched systems is studied where the
individual subsystems are connected in a serial cascade configuration, and the
states are allowed to reset at switching times. An ISS Lyapunov function is
associated to each of the two blocks connected in cascade, and these functions
are used as building blocks for constructing ISS Lyapunov function for the
interconnected system. The derivative of individual Lyapunov functions may be
bounded by nonlinear decay functions, and the growth in the value of Lyapunov
function at switching times may also be a nonlinear function of the value of
other Lyapunov functions. The stability of overall hybrid system is analyzed by
constructing a newly constructed ISS-Lyapunov function and deriving lower
bounds on the average dwell-time. The particular case of linear subsystems and
quadratic Lyapunov functions is also studied. The tools are also used for
studying the observer-based feedback stabilization of a nonlinear switched
system with event-based sampling of the output and control inputs. We design
dynamic sampling algorithms based on the proposed Lyapunov functions and
analyze the stability of the resulting closed-loop system.
","[{'version': 'v1', 'created': 'Mon, 1 Apr 2019 07:51:27 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Jan 2020 22:47:40 GMT'}]",2020-01-07,"[['Zhang', 'GuangXue', ''], ['Tanwani', 'Aneel', '']]","['Switched systems', 'input-to-state stability', 'cascade connection', 'multiple Lyapunov functions', 'averagedwell-time', 'output feedback', 'event-based control']"
2741,1801.04267,Luiz Capretz Dr.,"Muasaad Alrasheedi, Luiz Fernando Capretz, Arif Raza","Management's Perspective on Critical Success Factors Affecting Mobile
  Learning in Higher Education Institutions - An Empirical Study",,"Volume 2015, pp. 1-22",10.1177/0735633115620387,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile learning (m-Learning) is considered to be one of the fastest growing
learning platforms. The immense interest in m-Learning is attributed to the
incredible rate of growth of mobile technology and its proliferation into every
aspect of modern life. Despite this, m-Learning has not experienced a similar
adoption rate in the education sector, chiefly higher education. Researchers
have attempted to explain this anomaly by conducting several studies in the
area. However, mostly the research in m-Learning is examined from the
perspective of the students and educators. In this research, it is contended
that there is a third important stakeholder group whose opinion is equally
important in determining the success of m-Learning: the university management.
Although diversified by nature, heads of departments, deans, and IT system
administrators are nevertheless considered members of any university
management. The results of the research show that university commitment to
m-Learning, university learning practices, and change management practices were
the factors critical to the success of m-Learning, from the university
management perspective.
","[{'version': 'v1', 'created': 'Fri, 12 Jan 2018 18:57:10 GMT'}]",2018-01-15,"[['Alrasheedi', 'Muasaad', ''], ['Capretz', 'Luiz Fernando', ''], ['Raza', 'Arif', '']]","['mobile learning', 'higher education', 'university management', 'critical']"
2742,1212.2178,Theresa Migler-VonDollen,"Glencora Borradaile, Jennifer Iglesias, Theresa Migler, Antonio Ochoa,
  Gordon Wilfong, Lisa Zhang",Egalitarian Graph Orientations,,"Journal of Graph Algorithms and Applications vol. 21, no. 4, pp.
  687-708, 2017",10.7155/jgaa.00435,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given an undirected graph, one can assign directions to each of the edges of
the graph, thus orienting the graph. To be as egalitarian as possible, one may
wish to find an orientation such that no vertex is unfairly hit with too many
arcs directed into it. We discuss how this objective arises in problems
resulting from telecommunications. We give optimal, polynomial-time algorithms
for: finding an orientation that minimizes the lexicographic order of the
indegrees and finding a strongly-connected orientation that minimizes the
maximum indegree. We show that minimizing the lexicographic order of the
indegrees is NP-hard when the resulting orientation is required to be acyclic.
","[{'version': 'v1', 'created': 'Mon, 10 Dec 2012 19:44:11 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Apr 2013 22:56:14 GMT'}, {'version': 'v3', 'created': 'Wed, 5 Nov 2014 17:47:28 GMT'}, {'version': 'v4', 'created': 'Thu, 9 Nov 2017 17:57:53 GMT'}]",2017-11-10,"[['Borradaile', 'Glencora', ''], ['Iglesias', 'Jennifer', ''], ['Migler', 'Theresa', ''], ['Ochoa', 'Antonio', ''], ['Wilfong', 'Gordon', ''], ['Zhang', 'Lisa', '']]","['algorithms', 'graph orientation', 'routing algorithms']"
2743,1611.03105,Xinlei Yi,"Xinlei Yi, Jieqiang Wei, Dimos V. Dimarogonas, Karl H. Johansson","Formation Control for Multi-Agent Systems with Connectivity Preservation
  and Event-Triggered Controllers",,,10.1016/j.ifacol.2017.08.1444,,cs.SY math.OC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this paper, event-triggered controllers and corresponding algorithms are
proposed to establish the formation with connectivity preservation for
multi-agent systems. Each agent needs to update its control input and to
broadcast this control input together with the relative state information to
its neighbors at its own triggering times, and to receive information at its
neighbors' triggering times. Two types of system dynamics, single integrators
and double integrators, are considered. As a result, all agents converge to the
formation exponentially with connectivity preservation, and Zeno behavior can
be excluded. Numerical simulations show the effectiveness of the theoretical
results.
","[{'version': 'v1', 'created': 'Thu, 10 Nov 2016 20:56:12 GMT'}, {'version': 'v2', 'created': 'Sat, 12 Nov 2016 00:10:10 GMT'}, {'version': 'v3', 'created': 'Tue, 11 Apr 2017 08:31:49 GMT'}, {'version': 'v4', 'created': 'Wed, 19 Apr 2017 20:20:27 GMT'}]",2019-04-15,"[['Yi', 'Xinlei', ''], ['Wei', 'Jieqiang', ''], ['Dimarogonas', 'Dimos V.', ''], ['Johansson', 'Karl H.', '']]","['Multi-agent systems', 'formation control', 'connectivity', 'event-triggered control']"
2744,2102.02576,Tom Hanika,Tom Hanika and Johannes Hirth,Exploring Scale-Measures of Data Sets,"16 pages, 5 figures",,10.1007/978-3-030-77867-5_17,,cs.AI cs.LG cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Measurement is a fundamental building block of numerous scientific models and
their creation. This is in particular true for data driven science. Due to the
high complexity and size of modern data sets, the necessity for the development
of understandable and efficient scaling methods is at hand. A profound theory
for scaling data is scale-measures, as developed in the field of formal concept
analysis. Recent developments indicate that the set of all scale-measures for a
given data set constitutes a lattice and does hence allow efficient exploring
algorithms. In this work we study the properties of said lattice and propose a
novel scale-measure exploration algorithm that is based on the well-known and
proven attribute exploration approach. Our results motivate multiple
applications in scale recommendation, most prominently (semi-)automatic
scaling.
","[{'version': 'v1', 'created': 'Thu, 4 Feb 2021 12:29:15 GMT'}]",2022-04-26,"[['Hanika', 'Tom', ''], ['Hirth', 'Johannes', '']]","['FCA', 'Conceptual Measures', 'Data Scaling', 'Measurements', 'Formal Concept', 'Lattice']"
2745,1609.08371,Mayank Singh,"Mayank Singh, Rajdeep Sarkar, Pawan Goyal, Animesh Mukherjee, Soumen
  Chakrabarti","Relay-Linking Models for Prominence and Obsolescence in Evolving
  Networks",,"2017. In Proceedings of the 23rd ACM SIGKDD International
  Conference on Knowledge Discovery and Data Mining (KDD '17). ACM, Halifax,
  Canada, 1077-1086",10.1145/3097983.3098146,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rate at which nodes in evolving social networks acquire links (friends,
citations) shows complex temporal dynamics. Preferential attachment and link
copying models, while enabling elegant analysis, only capture rich-gets-richer
effects, not aging and decline. Recent aging models are complex and heavily
parameterized; most involve estimating 1-3 parameters per node. These
parameters are intrinsic: they explain decline in terms of events in the past
of the same node, and do not explain, using the network, where the linking
attention might go instead. We argue that traditional characterization of
linking dynamics are insufficient to judge the faithfulness of models. We
propose a new temporal sketch of an evolving graph, and introduce several new
characterizations of a network's temporal dynamics. Then we propose a new
family of frugal aging models with no per-node parameters and only two global
parameters. Our model is based on a surprising inversion or undoing of triangle
completion, where an old node relays a citation to a younger follower in its
immediate vicinity. Despite very few parameters, the new family of models shows
remarkably better fit with real data. Before concluding, we analyze temporal
signatures for various research communities yielding further insights into
their comparative dynamics. To facilitate reproducible research, we shall soon
make all the codes and the processed dataset available in the public domain.
","[{'version': 'v1', 'created': 'Tue, 27 Sep 2016 12:10:44 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Mar 2017 11:03:47 GMT'}, {'version': 'v3', 'created': 'Wed, 6 Sep 2017 04:32:10 GMT'}]",2017-09-07,"[['Singh', 'Mayank', ''], ['Sarkar', 'Rajdeep', ''], ['Goyal', 'Pawan', ''], ['Mukherjee', 'Animesh', ''], ['Chakrabarti', 'Soumen', '']]","['Network growth models', 'relay-link', 'aging models']"
2746,1902.00548,Weixin Zhang,"Weixin Zhang (The University of Hong Kong, Hong Kong), Bruno Oliveira
  (The University of Hong Kong, Hong Kong)","Shallow EDSLs and Object-Oriented Programming: Beyond Simple
  Compositionality",,"The Art, Science, and Engineering of Programming, 2019, Vol. 3,
  Issue 3, Article 10",10.22152/programming-journal.org/2019/3/10,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Embedded Domain-Specific Languages (EDSLs) are a common and widely
used approach to DSLs in various languages, including Haskell and Scala. There
are two main implementation techniques for EDSLs: shallow embeddings and deep
embeddings. Inquiry: Shallow embeddings are quite simple, but they have been
criticized in the past for being quite limited in terms of modularity and
reuse. In particular, it is often argued that supporting multiple DSL
interpretations in shallow embeddings is difficult. Approach: This paper argues
that shallow EDSLs and Object-Oriented Programming (OOP) are closely related.
Gibbons and Wu already discussed the relationship between shallow EDSLs and
procedural abstraction, while Cook discussed the connection between procedural
abstraction and OOP. We make the transitive step in this paper by connecting
shallow EDSLs directly to OOP via procedural abstraction. The knowledge about
this relationship enables us to improve on implementation techniques for EDSLs.
Knowledge: This paper argues that common OOP mechanisms (including inheritance,
subtyping, and type-refinement) increase the modularity and reuse of shallow
EDSLs when compared to classical procedural abstraction by enabling a simple
way to express multiple, possibly dependent, interpretations. Grounding: We
make our arguments by using Gibbons and Wu's examples, where procedural
abstraction is used in Haskell to model a simple shallow EDSL. We recode that
EDSL in Scala and with an improved OO-inspired Haskell encoding. We further
illustrate our approach with a case study on refactoring a deep external SQL
query processor to make it more modular, shallow, and embedded. Importance:
This work is important for two reasons. Firstly, from an intellectual point of
view, this work establishes the connection between shallow embeddings and OOP,
which enables a better understanding of both concepts. Secondly, this work
illustrates programming techniques that can be used to improve the modularity
and reuse of shallow EDSLs.
","[{'version': 'v1', 'created': 'Fri, 1 Feb 2019 20:16:52 GMT'}]",2019-02-05,"[['Zhang', 'Weixin', '', 'The University of Hong Kong, Hong Kong'], ['Oliveira', 'Bruno', '', 'The University of Hong Kong, Hong Kong']]","['embedded domain-specific languages', 'shallow embedding', 'object-oriented programming']"
2747,1901.06525,Leigh Clark,"Leigh Clark, Nadia Pantidi, Orla Cooney, Philip Doyle, Diego
  Garaialde, Justin Edwards, Brendan Spillane, Christine Murad, Cosmin
  Munteanu, Vincent Wade, Benjamin R. Cowan","What Makes a Good Conversation? Challenges in Designing Truly
  Conversational Agents","Accepted for publication at the 2019 Conference on Human Factors in
  Computing Systems (CHI 2019)",,10.1145/3290605.3300705,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Conversational agents promise conversational interaction but fail to deliver.
Efforts often emulate functional rules from human speech, without considering
key characteristics that conversation must encapsulate. Given its potential in
supporting long-term human-agent relationships, it is paramount that HCI
focuses efforts on delivering this promise. We aim to understand what people
value in conversation and how this should manifest in agents. Findings from a
series of semi-structured interviews show people make a clear dichotomy between
social and functional roles of conversation, emphasising the long-term dynamics
of bond and trust along with the importance of context and relationship stage
in the types of conversations they have. People fundamentally questioned the
need for bond and common ground in agent communication, shifting to more
utilitarian definitions of conversational qualities. Drawing on these findings
we discuss key challenges for conversational agent design, most notably the
need to redefine the design parameters for conversational agent interaction.
","[{'version': 'v1', 'created': 'Sat, 19 Jan 2019 14:00:00 GMT'}]",2019-01-23,"[['Clark', 'Leigh', ''], ['Pantidi', 'Nadia', ''], ['Cooney', 'Orla', ''], ['Doyle', 'Philip', ''], ['Garaialde', 'Diego', ''], ['Edwards', 'Justin', ''], ['Spillane', 'Brendan', ''], ['Murad', 'Christine', ''], ['Munteanu', 'Cosmin', ''], ['Wade', 'Vincent', ''], ['Cowan', 'Benjamin R.', '']]","['Conversational Agents', 'Speech HCI', 'Spoken Dialogue Systems', 'Voice User Interface Design', 'Interviews']"
2748,1308.0094,Gan Zheng,"Gan Zheng, Ioannis Krikidis, Jiangyuan Li, Athina P. Petropulu, and
  Bjorn Ottersten",Improving Physical Layer Secrecy Using Full-Duplex Jamming Receivers,"This manuscript will appear in the IEEE Transactions on Signal
  Processing",,10.1109/TSP.2013.2269049,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies secrecy rate optimization in a wireless network with a
single-antenna source, a multi-antenna destination and a multi-antenna
eavesdropper. This is an unfavorable scenario for secrecy performance as the
system is interference-limited. In the literature, assuming that the receiver
operates in half duplex (HD) mode, the aforementioned problem has been
addressed via use of cooperating nodes who act as jammers to confound the
eavesdropper. This paper investigates an alternative solution, which assumes
the availability of a full duplex (FD) receiver. In particular, while receiving
data, the receiver transmits jamming noise to degrade the eavesdropper channel.
The proposed self-protection scheme eliminates the need for external helpers
and provides system robustness. For the case in which global channel state
information is available, we aim to design the optimal jamming covariance
matrix that maximizes the secrecy rate and mitigates loop interference
associated with the FD operation. We consider both fixed and optimal linear
receiver design at the destination, and show that the optimal jamming
covariance matrix is rank-1, and can be found via an efficient 1-D search. For
the case in which only statistical information on the eavesdropper channel is
available, the optimal power allocation is studied in terms of ergodic and
outage secrecy rates. Simulation results verify the analysis and demonstrate
substantial performance gain over conventional HD operation at the destination.
","[{'version': 'v1', 'created': 'Thu, 1 Aug 2013 04:35:52 GMT'}]",2016-08-24,"[['Zheng', 'Gan', ''], ['Krikidis', 'Ioannis', ''], ['Li', 'Jiangyuan', ''], ['Petropulu', 'Athina P.', ''], ['Ottersten', 'Bjorn', '']]","['Full-duplex', 'physical-layer security', 'jamming', 'beamforming', 'MIMO', 'convex optimization']"
2749,0901.4466,Andrew Adamatzky,Andrew Adamatzky,Physarum boats: If plasmodium sailed it would never leave a port,,"Applied Bionics and Biomechanics, Volume 7, Issue 1 March 2010 ,
  pages 31 - 39",10.1080/11762320902863890,,cs.RO q-bio.CB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Plasmodium of \emph{Physarum polycephalum} is a single huge (visible by naked
eye) cell with myriad of nuclei. The plasmodium is a promising substrate for
non-classical, nature-inspired, computing devices. It is capable for
approximation of shortest path, computation of planar proximity graphs and
plane tessellations, primitive memory and decision-making. The unique
properties of the plasmodium make it an ideal candidate for a role of amorphous
biological robots with massive parallel information processing and distributed
inputs and outputs. We show that when adhered to light-weight object resting on
a water surface the plasmodium can propel the object by oscillating its
protoplasmic pseudopodia. In experimental laboratory conditions and
computational experiments we study phenomenology of the plasmodium-floater
system, and possible mechanisms of controlling motion of objects propelled by
on board plasmodium.
","[{'version': 'v1', 'created': 'Wed, 28 Jan 2009 14:12:32 GMT'}]",2010-11-23,"[['Adamatzky', 'Andrew', '']]","['Physarum polycephalum', 'motility', 'biological robots']"
2750,1711.07871,Ya Ju Fan,Ya Ju Fan,Autoencoder Node Saliency: Selecting Relevant Latent Representations,,"Pattern Recognition, Volume 88, 2019, Pages 643-653",10.1016/j.patcog.2018.12.015,ISSN 0031-3203,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The autoencoder is an artificial neural network model that learns hidden
representations of unlabeled data. With a linear transfer function it is
similar to the principal component analysis (PCA). While both methods use
weight vectors for linear transformations, the autoencoder does not come with
any indication similar to the eigenvalues in PCA that are paired with the
eigenvectors. We propose a novel supervised node saliency (SNS) method that
ranks the hidden nodes by comparing class distributions of latent
representations against a fixed reference distribution. The latent
representations of a hidden node can be described using a one-dimensional
histogram. We apply normalized entropy difference (NED) to measure the
""interestingness"" of the histograms, and conclude a property for NED values to
identify a good classifying node. By applying our methods to real data sets, we
demonstrate the ability of SNS to explain what the trained autoencoders have
learned.
","[{'version': 'v1', 'created': 'Tue, 21 Nov 2017 16:17:14 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Mar 2018 02:09:31 GMT'}]",2019-02-04,"[['Fan', 'Ya Ju', '']]","['Autoencoder', 'latent representations', 'unsupervised learning', 'neural']"
2751,1912.00146,Ishaan Lodha,"Ishaan Lodha (1), Lakshana Kolur (1), K. Sree Hari (1), Honnavalli
  Prasad (1) ((1) PES University, Bangalore)","Secure Wireless Internet of Things Communication using Virtual Private
  Networks",8 pages,,10.1007/978-981-15-2612-1_70,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  The Internet of Things (IoT) is an exploding market as well as a important
focus area for research. Security is a major issue for IoT products and
solutions, with several massive problems that are still commonplace in the
field. In this paper, we have successfully minimized the risk of data
eavesdropping and tampering over the network by securing these communications
using the concept of tunneling. We have implemented this by connecting a router
to the internet via a Virtual Private network while using PPTP and L2TP as the
underlying protocols for the VPN and exploring their cost benefits,
compatibility and most importantly, their feasibility. The main purpose of our
paper is to try to secure IoT networks without adversely affecting the selling
point of IoT.
","[{'version': 'v1', 'created': 'Sat, 30 Nov 2019 07:08:06 GMT'}]",2020-09-01,"[['Lodha', 'Ishaan', '', 'PES University, Bangalore'], ['Kolur', 'Lakshana', '', 'PES University, Bangalore'], ['Hari', 'K. Sree', '', 'PES University, Bangalore'], ['Prasad', 'Honnavalli', '', 'PES University, Bangalore']]","['IoT', 'networks', 'security', 'sensors', 'wireless communication', 'sensor networks']"
2752,1705.10218,Alfio Lazzaro,"Alfio Lazzaro, Joost VandeVondele, Juerg Hutter, Ole Schuett","Increasing the Efficiency of Sparse Matrix-Matrix Multiplication with a
  2.5D Algorithm and One-Sided MPI","In Proceedings of PASC '17, Lugano, Switzerland, June 26-28, 2017, 10
  pages, 4 figures",,10.1145/3093172.3093228,,cs.DC cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Matrix-matrix multiplication is a basic operation in linear algebra and an
essential building block for a wide range of algorithms in various scientific
fields. Theory and implementation for the dense, square matrix case are
well-developed. If matrices are sparse, with application-specific sparsity
patterns, the optimal implementation remains an open question. Here, we explore
the performance of communication reducing 2.5D algorithms and one-sided MPI
communication in the context of linear scaling electronic structure theory. In
particular, we extend the DBCSR sparse matrix library, which is the basic
building block for linear scaling electronic structure theory and low scaling
correlated methods in CP2K. The library is specifically designed to efficiently
perform block-sparse matrix-matrix multiplication of matrices with a relatively
large occupation. Here, we compare the performance of the original
implementation based on Cannon's algorithm and MPI point-to-point
communication, with an implementation based on MPI one-sided communications
(RMA), in both a 2D and a 2.5D approach. The 2.5D approach trades memory and
auxiliary operations for reduced communication, which can lead to a speedup if
communication is dominant. The 2.5D algorithm is somewhat easier to implement
with one-sided communications. A detailed description of the implementation is
provided, also for non ideal processor topologies, since this is important for
actual applications. Given the importance of the precise sparsity pattern, and
even the actual matrix data, which decides the effective fill-in upon
multiplication, the tests are performed within the CP2K package with
application benchmarks. Results show a substantial boost in performance for the
RMA based 2.5D algorithm, up to 1.80x, which is observed to increase with the
number of involved processes in the parallelization.
","[{'version': 'v1', 'created': 'Mon, 29 May 2017 14:42:14 GMT'}]",2017-06-01,"[['Lazzaro', 'Alfio', ''], ['VandeVondele', 'Joost', ''], ['Hutter', 'Juerg', ''], ['Schuett', 'Ole', '']]","['sparse algebra', 'matrix-matrix multiplications', 'MPI parallelization', 'one-sided communications', 'point-to-point communications', 'communication-reducing']"
2753,2107.00212,Amiangshu Bosu,"Sayma Sultana, London Ariel Cavaletto, Amiangshu Bosu","Identifying the Prevalence of Gender Biases among the Computing
  Organizations",,"ACM Celebration of Women in Computing: womENcourage, 2021",,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We have designed an online survey to understand the status quo of four
dimensions of gender biases among the contemporary computing organizations. Our
preliminary results found almost one-third of the respondents have reported
first-hand experiences of encountering gender biases at their jobs.
","[{'version': 'v1', 'created': 'Thu, 1 Jul 2021 04:44:10 GMT'}]",2021-07-02,"[['Sultana', 'Sayma', ''], ['Cavaletto', 'London Ariel', ''], ['Bosu', 'Amiangshu', '']]","['software development', 'gender bias', 'diversity', 'inclusion']"
2754,1901.08715,Neel Doshi D,"Neel Doshi, Kaushik Jayaram, Samantha Castellanos, Scott Kuindersma,
  Robert J Wood","Effective Locomotion at Multiple Stride Frequencies Using Proprioceptive
  Feedback on a Legged Microrobot","The first two authors contributed equally. Currently in review at IOP
  Bioinspiration and Biomimetics",,10.1088/1748-3190/ab295b,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Limitations in actuation, sensing, and computation have forced small legged
robots to rely on carefully tuned, mechanically mediated leg trajectories for
effective locomotion. Recent advances in manufacturing, however, have enabled
the development of small legged robots capable of operation at multiple stride
frequencies using multi-degree-of-freedom leg trajectories. Proprioceptive
sensing and control is key to extending the capabilities of these robots to a
broad range of operating conditions. In this work, we use concomitant sensing
for piezoelectric actuation with a computationally efficient framework for
estimation and control of leg trajectories on a quadrupedal microrobot. We
demonstrate accurate position estimation (< 16% root-mean-square error) and
control (16% root-mean-square tracking error) during locomotion across a wide
range of stride frequencies (10-50 Hz). This capability enables the exploration
of two bioinspired parametric leg trajectories designed to reduce leg slip and
increase locomotion performance (e.g., speed, cost-of-transport, etc.). Using
this approach, we demonstrate high performance locomotion at stride frequencies
of (10-30 Hz) where the robot's natural dynamics result in poor open-loop
locomotion. Furthermore, we validate the biological hypotheses that inspired
the our trajectories and identify regions of highly dynamic locomotion, low
cost-of-transport (3.33), and minimal leg slippage (< 10%).
","[{'version': 'v1', 'created': 'Fri, 25 Jan 2019 02:34:18 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Jan 2019 01:35:20 GMT'}, {'version': 'v3', 'created': 'Wed, 17 Apr 2019 03:43:20 GMT'}, {'version': 'v4', 'created': 'Mon, 3 Jun 2019 12:57:43 GMT'}]",2019-07-02,"[['Doshi', 'Neel', ''], ['Jayaram', 'Kaushik', ''], ['Castellanos', 'Samantha', ''], ['Kuindersma', 'Scott', ''], ['Wood', 'Robert J', '']]","['self-sensing', 'linear-quadratic-gaussiancontrol', 'leggedmicrorobots', 'piezoelectric actuation', 'robust locomotion']"
2755,1804.05492,Bernadette Boscoe,"Bernadette M. Boscoe (Randles), Irene V. Pasquetto, Milena S. Golshan,
  Christine L. Borgman","Using the Jupyter Notebook as a Tool for Open Science: An Empirical
  Study",,"2017 ACM/IEEE Joint Conference on Digital Libraries (JCDL) (2017).
  Toronto, ON, Canada. June 19, 2017 to June 23, 2017, ISBN: 978-1-5386-3862-0
  pp: 1-2",,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As scientific work becomes more computational and data intensive, research
processes and results become more difficult to interpret and reproduce. In this
poster, we show how the Jupyter notebook, a tool originally designed as a free
version of Mathematica notebooks, has evolved to become a robust tool for
scientists to share code, associated computation, and documentation.
","[{'version': 'v1', 'created': 'Mon, 16 Apr 2018 03:40:10 GMT'}]",2018-04-17,"[['Boscoe', 'Bernadette M.', '', 'Randles'], ['Pasquetto', 'Irene V.', ''], ['Golshan', 'Milena S.', ''], ['Borgman', 'Christine L.', '']]","['Jupyter notebooks', 'open science', 'open data', 'data']"
2756,1307.3284,Shuai Yuan,"Shuai Yuan, Jun Wang",Sequential Selection of Correlated Ads by POMDPs,,Proceedings of the ACM CIKM '12. 515-524,10.1145/2396761.2396828,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online advertising has become a key source of revenue for both web search
engines and online publishers. For them, the ability of allocating right ads to
right webpages is critical because any mismatched ads would not only harm web
users' satisfactions but also lower the ad income. In this paper, we study how
online publishers could optimally select ads to maximize their ad incomes over
time. The conventional offline, content-based matching between webpages and ads
is a fine start but cannot solve the problem completely because good matching
does not necessarily lead to good payoff. Moreover, with the limited display
impressions, we need to balance the need of selecting ads to learn true ad
payoffs (exploration) with that of allocating ads to generate high immediate
payoffs based on the current belief (exploitation). In this paper, we address
the problem by employing Partially observable Markov decision processes
(POMDPs) and discuss how to utilize the correlation of ads to improve the
efficiency of the exploration and increase ad incomes in a long run. Our
mathematical derivation shows that the belief states of correlated ads can be
naturally updated using a formula similar to collaborative filtering. To test
our model, a real world ad dataset from a major search engine is collected and
categorized. Experimenting over the data, we provide an analyse of the effect
of the underlying parameters, and demonstrate that our algorithms significantly
outperform other strong baselines.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2013 22:20:32 GMT'}]",2013-07-15,"[['Yuan', 'Shuai', ''], ['Wang', 'Jun', '']]","['computational advertising', 'revenue optimisation', 'correlation', 'POMDPs', 'value iteration']"
2757,1606.06950,Herman Kamper,"Herman Kamper, Aren Jansen, Sharon Goldwater","A segmental framework for fully-unsupervised large-vocabulary speech
  recognition","15 pages, 6 figures, 8 tables",Comput. Speech Lang. 46 (2017) 154-174,10.1016/j.csl.2017.04.008,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Zero-resource speech technology is a growing research area that aims to
develop methods for speech processing in the absence of transcriptions,
lexicons, or language modelling text. Early term discovery systems focused on
identifying isolated recurring patterns in a corpus, while more recent
full-coverage systems attempt to completely segment and cluster the audio into
word-like units---effectively performing unsupervised speech recognition. This
article presents the first attempt we are aware of to apply such a system to
large-vocabulary multi-speaker data. Our system uses a Bayesian modelling
framework with segmental word representations: each word segment is represented
as a fixed-dimensional acoustic embedding obtained by mapping the sequence of
feature frames to a single embedding vector. We compare our system on English
and Xitsonga datasets to state-of-the-art baselines, using a variety of
measures including word error rate (obtained by mapping the unsupervised output
to ground truth transcriptions). Very high word error rates are reported---in
the order of 70--80% for speaker-dependent and 80--95% for speaker-independent
systems---highlighting the difficulty of this task. Nevertheless, in terms of
cluster quality and word segmentation metrics, we show that by imposing a
consistent top-down segmentation while also using bottom-up knowledge from
detected syllable boundaries, both single-speaker and multi-speaker versions of
our system outperform a purely bottom-up single-speaker syllable-based
approach. We also show that the discovered clusters can be made less speaker-
and gender-specific by using an unsupervised autoencoder-like feature extractor
to learn better frame-level features (prior to embedding). Our system's
discovered clusters are still less pure than those of unsupervised term
discovery systems, but provide far greater coverage.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2016 13:51:57 GMT'}, {'version': 'v2', 'created': 'Sat, 16 Sep 2017 09:36:02 GMT'}]",2017-09-19,"[['Kamper', 'Herman', ''], ['Jansen', 'Aren', ''], ['Goldwater', 'Sharon', '']]","['Unsupervised speech processing', 'representationlearning', 'segmentation', 'clustering', 'language acquisition']"
2758,1411.0435,Peter Jung,"Gerhard Wunder, Holger Boche, Thomas Strohmer and Peter Jung",Sparse Signal Processing Concepts for Efficient 5G System Design,"18 pages, 5 figures, accepted for publication in IEEE Access",,10.1109/ACCESS.2015.2407194,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As it becomes increasingly apparent that 4G will not be able to meet the
emerging demands of future mobile communication systems, the question what
could make up a 5G system, what are the crucial challenges and what are the key
drivers is part of intensive, ongoing discussions. Partly due to the advent of
compressive sensing, methods that can optimally exploit sparsity in signals
have received tremendous attention in recent years. In this paper we will
describe a variety of scenarios in which signal sparsity arises naturally in 5G
wireless systems. Signal sparsity and the associated rich collection of tools
and algorithms will thus be a viable source for innovation in 5G wireless
system design. We will discribe applications of this sparse signal processing
paradigm in MIMO random access, cloud radio access networks, compressive
channel-source network coding, and embedded security. We will also emphasize
important open problem that may arise in 5G system design, for which sparsity
will potentially play a key role in their solution.
","[{'version': 'v1', 'created': 'Mon, 3 Nov 2014 11:33:59 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Jan 2015 17:44:01 GMT'}]",2016-11-18,"[['Wunder', 'Gerhard', ''], ['Boche', 'Holger', ''], ['Strohmer', 'Thomas', ''], ['Jung', 'Peter', '']]","['Compressed Sensing', 'Cloud Radio Acess Networks', 'Massive Random Access', 'Embedded Security', 'Source Coding']"
2759,1801.00718,Charles Truong,"Charles Truong, Laurent Oudre, Nicolas Vayatis",Selective review of offline change point detection methods,,"Signal Processing, 167:107299, 2020",10.1016/j.sigpro.2019.107299,,cs.CE stat.CO stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents a selective survey of algorithms for the offline
detection of multiple change points in multivariate time series. A general yet
structuring methodological strategy is adopted to organize this vast body of
work. More precisely, detection algorithms considered in this review are
characterized by three elements: a cost function, a search method and a
constraint on the number of changes. Each of those elements is described,
reviewed and discussed separately. Implementations of the main algorithms
described in this article are provided within a Python package called ruptures.
","[{'version': 'v1', 'created': 'Tue, 2 Jan 2018 16:44:08 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Jan 2019 10:19:28 GMT'}, {'version': 'v3', 'created': 'Thu, 26 Mar 2020 08:54:35 GMT'}]",2020-07-14,"[['Truong', 'Charles', ''], ['Oudre', 'Laurent', ''], ['Vayatis', 'Nicolas', '']]","['change point detection', 'segmentation', 'statistical signal processing']"
2760,1505.05022,Daniela Inclezan,Daniela Inclezan and Michael Gelfond,Modular Action Language ALM,"65 pages, 7 figures. To appear in Theory and Practice of Logic
  Programming (TPLP)",Theory and Practice of Logic Programming 16 (2016) 189-235,10.1017/S1471068415000095,,cs.LO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper introduces a new modular action language, ALM, and illustrates the
methodology of its use. It is based on the approach of Gelfond and Lifschitz
(1993; 1998) in which a high-level action language is used as a front end for a
logic programming system description. The resulting logic programming
representation is used to perform various computational tasks. The methodology
based on existing action languages works well for small and even medium size
systems, but is not meant to deal with larger systems that require structuring
of knowledge. ALM is meant to remedy this problem. Structuring of knowledge in
ALM is supported by the concepts of module (a formal description of a specific
piece of knowledge packaged as a unit), module hierarchy, and library, and by
the division of a system description of ALM into two parts: theory and
structure. A theory consists of one or more modules with a common theme,
possibly organized into a module hierarchy based on a dependency relation. It
contains declarations of sorts, attributes, and properties of the domain
together with axioms describing them. Structures are used to describe the
domain's objects. These features, together with the means for defining classes
of a domain as special cases of previously defined ones, facilitate the
stepwise development, testing, and readability of a knowledge base, as well as
the creation of knowledge representation libraries. To appear in Theory and
Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Tue, 19 May 2015 14:44:25 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Jul 2015 12:11:09 GMT'}]",2020-02-19,"[['Inclezan', 'Daniela', ''], ['Gelfond', 'Michael', '']]","['logic programming', 'reasoning about actions and change', 'action language']"
2761,1505.01903,Waldemar Koczkodaj Prof.,"W.W. Koczkodaj, M. Orlowski","An Algorithm for the Optimal Consistent Approximation to a Pairwise
  Comparisons Matrix by Orthogonal Projections",,"Computers & Mathematics with Applications,34(10): 41-47, 1997",10.1016/S0898-1221(97)00205-8,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The algorithm for finding the optimal consistent approximation of an
inconsistent pairwise comparisons matrix is based on a logarithmic
transformation of a pairwise comparisons matrix into a vector space with the
Euclidean metric. Orthogonal basis is introduced in the vector space. The
orthogonal projection of the transformed matrix onto the space formed by the
images of consistent matrices is the required consistent approximation.
","[{'version': 'v1', 'created': 'Fri, 8 May 2015 01:40:03 GMT'}]",2015-05-11,"[['Koczkodaj', 'W. W.', ''], ['Orlowski', 'M.', '']]","['approximation algorithm', 'pairwise comparisons', 'orthogonal basis', 'comparative judgments', 'inconsistency', 'linear space', 'logarithmic transformation']"
2762,1801.01847,Cam Bermudez,"Camilo Bermudez, Andrew J. Plassard, Larry T. Davis, Allen T. Newton,
  Susan M Resnick, Bennett A. Landman",Learning Implicit Brain MRI Manifolds with Deep Learning,SPIE Medical Imaging 2018,,10.1117/12.2293515,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An important task in image processing and neuroimaging is to extract
quantitative information from the acquired images in order to make observations
about the presence of disease or markers of development in populations. Having
a lowdimensional manifold of an image allows for easier statistical comparisons
between groups and the synthesis of group representatives. Previous studies
have sought to identify the best mapping of brain MRI to a low-dimensional
manifold, but have been limited by assumptions of explicit similarity measures.
In this work, we use deep learning techniques to investigate implicit manifolds
of normal brains and generate new, high-quality images. We explore implicit
manifolds by addressing the problems of image synthesis and image denoising as
important tools in manifold learning. First, we propose the unsupervised
synthesis of T1-weighted brain MRI using a Generative Adversarial Network (GAN)
by learning from 528 examples of 2D axial slices of brain MRI. Synthesized
images were first shown to be unique by performing a crosscorrelation with the
training set. Real and synthesized images were then assessed in a blinded
manner by two imaging experts providing an image quality score of 1-5. The
quality score of the synthetic image showed substantial overlap with that of
the real images. Moreover, we use an autoencoder with skip connections for
image denoising, showing that the proposed method results in higher PSNR than
FSL SUSAN after denoising. This work shows the power of artificial networks to
synthesize realistic imaging data, which can be used to improve image
processing techniques and provide a quantitative framework to structural
changes in the brain.
","[{'version': 'v1', 'created': 'Fri, 5 Jan 2018 17:24:37 GMT'}]",2018-11-27,"[['Bermudez', 'Camilo', ''], ['Plassard', 'Andrew J.', ''], ['Davis', 'Larry T.', ''], ['Newton', 'Allen T.', ''], ['Resnick', 'Susan M', ''], ['Landman', 'Bennett A.', '']]","['Manifold learning', 'deep neural networks', 'image synthesis', 'brain MRI', 'generative adversarial networks']"
2763,1907.13293,Qinghua Lu,"Qinghua Lu, Xiwei Xu, Yue Liu, Ingo Weber, Liming Zhu, Weishan Zhang",uBaaS: A Unified Blockchain as a Service Platform,,"[J]. Future Generation Computer Systems, 2019, 101: 564-575",10.1016/j.future.2019.05.051,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Blockchain is an innovative distributed ledger technology which has attracted
a wide range of interests for building the next generation of applications to
address lack-of-trust issues in business. Blockchain as a service (BaaS) is a
promising solution to improve the productivity of blockchain application
development. However, existing BaaS deployment solutions are mostly
vendor-locked: they are either bound to a cloud provider or a blockchain
platform. In addition to deployment, design and implementation of
blockchain-based applications is a hard task requiring deep expertise.
Therefore, this paper presents a unified blockchain as a service platform
(uBaaS) to support both design and deployment of blockchain-based applications.
The services in uBaaS include deployment as a service, design pattern as a
service and auxiliary services. In uBaaS, deployment as a service is platform
agnostic, which can avoid lock-in to specific cloud platforms, while design
pattern as a service applies design patterns for data management and smart
contract design to address the scalability and security issues of blockchain.
The proposed solutions are evaluated using a real-world quality tracing use
case in terms of feasibility and scalability.
","[{'version': 'v1', 'created': 'Wed, 31 Jul 2019 02:50:08 GMT'}]",2020-10-27,"[['Lu', 'Qinghua', ''], ['Xu', 'Xiwei', ''], ['Liu', 'Yue', ''], ['Weber', 'Ingo', ''], ['Zhu', 'Liming', ''], ['Zhang', 'Weishan', '']]","['Blockchain', 'architecture', 'design patterns', 'deployment', 'blockchain as a service']"
2764,1007.4028,Mario Alviano,"Mario Alviano, Wolfgang Faber and Nicola Leone","Disjunctive ASP with Functions: Decidable Queries and Effective
  Computation","16 pages, 1 figure","Theory and Practice of Logic Programming, 10(4-6): 497-512, 2010",10.1017/S1471068410000244,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Querying over disjunctive ASP with functions is a highly undecidable task in
general. In this paper we focus on disjunctive logic programs with stratified
negation and functions under the stable model semantics (ASP^{fs}). We show
that query answering in this setting is decidable, if the query is finitely
recursive (ASP^{fs}_{fr}). Our proof yields also an effective method for query
evaluation. It is done by extending the magic set technique to ASP^{fs}_{fr}.
We show that the magic-set rewritten program is query equivalent to the
original one (under both brave and cautious reasoning). Moreover, we prove that
the rewritten program is also finitely ground, implying that it is decidable.
Importantly, finitely ground programs are evaluable using existing ASP solvers,
making the class of ASP^{fs}_{fr} queries usable in practice.
","[{'version': 'v1', 'created': 'Thu, 22 Jul 2010 23:54:51 GMT'}]",2010-07-26,"[['Alviano', 'Mario', ''], ['Faber', 'Wolfgang', ''], ['Leone', 'Nicola', '']]","['answer set programming', 'decidability', 'magic sets', 'disjunctive logic programs']"
2765,0907.4705,Yao Yu,"Yao Yu, Athina P.Petropulu and H. Vincent Poor",Compressive Sensing for MIMO Radar,,"Proc. IEEE International Conf. Acoust.Speech Signal Process, pp.
  3017 - 3020, Apr. 2008",10.1109/ICASSP.2009.4960259,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multiple-input multiple-output (MIMO) radar systems have been shown to
achieve superior resolution as compared to traditional radar systems with the
same number of transmit and receive antennas. This paper considers a
distributed MIMO radar scenario, in which each transmit element is a node in a
wireless network, and investigates the use of compressive sampling for
direction-of-arrival (DOA) estimation. According to the theory of compressive
sampling, a signal that is sparse in some domain can be recovered based on far
fewer samples than required by the Nyquist sampling theorem. The DOA of targets
form a sparse vector in the angle space, and therefore, compressive sampling
can be applied for DOA estimation. The proposed approach achieves the superior
resolution of MIMO radar with far fewer samples than other approaches. This is
particularly useful in a distributed scenario, in which the results at each
receive node need to be transmitted to a fusion center for further processing.
","[{'version': 'v1', 'created': 'Mon, 27 Jul 2009 17:08:32 GMT'}]",2016-11-15,"[['Yu', 'Yao', ''], ['Petropulu', 'Athina P.', ''], ['Poor', 'H. Vincent', '']]","['compressive sampling', 'compressive sensing', 'MIMO radar', 'DOA estimation']"
2766,1212.1800,Nizar Rokbani,"Nizar Rokbani, Boudour Ammar Cherif and Adel M. Alimi",Toward Intelligent Biped-Humanoids Gaits Generation,15 pages,"Nizar Rokbani, Boudour Ammar Cherif and Adel M. Alimi (2009).
  Toward Intelligent Biped-Humanoids Gaits Generation, Humanoid Robots, Ben
  Choi (Ed.), ISBN: 978-953-7619-44-2, InTech",10.5772/6732,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this chapter we will highlight our experimental studies on natural human
walking analysis and introduce a biologically inspired design for simple
bipedal locomotion system of humanoid robots. Inspiration comes directly from
human walking analysis and human muscles mechanism and control. A hybrid
algorithm for walking gaits generation is then proposed as an innovative
alternative to classically used kinematics and dynamic equations solving, the
gaits include knee, ankle and hip trajectories. The proposed algorithm is an
intelligent evolutionary based on particle swarm optimization paradigm. This
proposal can be used for small size humanoid robots, with a knee an ankle and a
hip and at least six Degrees of Freedom (DOF).
","[{'version': 'v1', 'created': 'Sat, 8 Dec 2012 15:13:10 GMT'}]",2012-12-11,"[['Rokbani', 'Nizar', ''], ['Cherif', 'Boudour Ammar', ''], ['Alimi', 'Adel M.', '']]","['Human gaits analysis', 'intelligent robotics', 'Humanoid robotics', 'Biped robots', 'evolutionary computing', 'particle swarm optimization.   1']"
2767,1607.06819,Emilio Ferrara,Xinxin Yang and Bo-Chiuan Chen and Mrinmoy Maity and Emilio Ferrara,"Social Politics: Agenda Setting and Political Communication on Social
  Media",,"International Conference on Social Informatics (pp. 330-344).
  Springer. 2016",10.1007/978-3-319-47880-7_20,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media play an increasingly important role in political communication.
Various studies investigated how individuals adopt social media for political
discussion, to share their views about politics and policy, or to mobilize and
protest against social issues. Yet, little attention has been devoted to the
main actors of political discussions: the politicians. In this paper, we
explore the topics of discussion of U.S. President Obama and the 50 U.S. State
Governors using Twitter data and agenda-setting theory as a tool to describe
the patterns of daily political discussion, uncovering the main topics of
attention and interest of these actors. We examine over one hundred thousand
tweets produced by these politicians and identify seven macro-topics of
conversation, finding that Twitter represents a particularly appealing vehicle
of conversation for American opposition politicians. We highlight the main
motifs of political conversation of the two parties, discovering that
Republican and Democrat Governors are more or less similarly active on Twitter
but exhibit different styles of communication. Finally, by reconstructing the
networks of occurrences of Governors' hashtags and keywords related to
political issues, we observe that Republicans form a tight core, with a
stronger shared agenda on many issues of discussion.
","[{'version': 'v1', 'created': 'Fri, 22 Jul 2016 20:00:25 GMT'}]",2017-03-07,"[['Yang', 'Xinxin', ''], ['Chen', 'Bo-Chiuan', ''], ['Maity', 'Mrinmoy', ''], ['Ferrara', 'Emilio', '']]","['related topolitical issues', 'we observe that Republicans form a tight core', 'with astronger shared agenda on many issues of discussion']"
2768,1703.00185,Alessandro Gabbana,"E. Calore, A. Gabbana, J. Kraus, E. Pellegrini, S.F. Schifano, R.
  Tripiccione",Massively parallel lattice-Boltzmann codes on large GPU clusters,,,10.1016/j.parco.2016.08.005,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a massively parallel code for a state-of-the art thermal
lattice- Boltzmann method. Our code has been carefully optimized for
performance on one GPU and to have a good scaling behavior extending to a large
number of GPUs. Versions of this code have been already used for large-scale
studies of convective turbulence. GPUs are becoming increasingly popular in HPC
applications, as they are able to deliver higher performance than traditional
processors. Writing efficient programs for large clusters is not an easy task
as codes must adapt to increasingly parallel architectures, and the overheads
of node-to-node communications must be properly handled. We describe the
structure of our code, discussing several key design choices that were guided
by theoretical models of performance and experimental benchmarks. We present an
extensive set of performance measurements and identify the corresponding main
bot- tlenecks; finally we compare the results of our GPU code with those
measured on other currently available high performance processors. Our results
are a production-grade code able to deliver a sustained performance of several
tens of Tflops as well as a design and op- timization methodology that can be
used for the development of other high performance applications for
computational physics.
","[{'version': 'v1', 'created': 'Wed, 1 Mar 2017 08:59:48 GMT'}]",2017-03-02,"[['Calore', 'E.', ''], ['Gabbana', 'A.', ''], ['Kraus', 'J.', ''], ['Pellegrini', 'E.', ''], ['Schifano', 'S. F.', ''], ['Tripiccione', 'R.', '']]","['Lattice Boltzmann', 'GPU Accelerators', 'Massively ParallelProgramming', 'Heterogeneous systems']"
2769,1511.08431,Gabriele Fici,"Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter,
  Tomasz Wale\'n","On the Greedy Algorithm for the Shortest Common Superstring Problem with
  Reversals",Published in Information Processing Letters,,10.1016/j.ipl.2015.11.015,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study a variation of the classical Shortest Common Superstring (SCS)
problem in which a shortest superstring of a finite set of strings $S$ is
sought containing as a factor every string of $S$ or its reversal. We call this
problem Shortest Common Superstring with Reversals (SCS-R). This problem has
been introduced by Jiang et al., who designed a greedy-like algorithm with
length approximation ratio $4$. In this paper, we show that a natural
adaptation of the classical greedy algorithm for SCS has (optimal) compression
ratio $\frac12$, i.e., the sum of the overlaps in the output string is at least
half the sum of the overlaps in an optimal solution. We also provide a
linear-time implementation of our algorithm.
","[{'version': 'v1', 'created': 'Thu, 26 Nov 2015 15:55:50 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Dec 2015 14:40:40 GMT'}]",2015-12-08,"[['Fici', 'Gabriele', ''], ['Kociumaka', 'Tomasz', ''], ['Radoszewski', 'Jakub', ''], ['Rytter', 'Wojciech', ''], ['Waleń', 'Tomasz', '']]","['Shortest Common Superstring', 'reversal', 'greedy algorithm']"
2770,1501.07135,Imran Khan,"Imran Khan, Fatna Belqasmi, Roch Glitho, Noel Crespi, Monique Morrow,
  Paul Polakos","Wireless Sensor Network Virtualization: Early Architecture and Research
  Perspectives","Accepted for publication on June 27th 2014 in Forthcoming issue of
  IEEE Network Magazine (May/June 2015 issue)","Network, IEEE , vol.29, no.3, pp.104-112, May-June 2015",10.1109/MNET.2015.7113233,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless sensor networks (WSNs) have become pervasive and are used in many
applications and services. Usually the deployments of WSNs are task oriented
and domain specific; thereby precluding re-use when other applications and
services are contemplated. This inevitably leads to the proliferation of
redundant WSN deployments. Virtualization is a technology that can aid in
tackling this issue, as it enables the sharing of resources/infrastructure by
multiple independent entities. In this paper we critically review the state of
the art and propose a novel architecture for WSN virtualization. The proposed
architecture has four layers (physical layer, virtual sensor layer, virtual
sensor access layer and overlay layer) and relies on the constrained
application protocol (CoAP). We illustrate its potential by using it in a
scenario where a single WSN is shared by multiple applications; one of which is
a fire monitoring application. We present the proof-of-concept prototype we
have built along with the performance measurements, and discuss future research
directions.
","[{'version': 'v1', 'created': 'Wed, 28 Jan 2015 15:12:44 GMT'}]",2016-02-09,"[['Khan', 'Imran', ''], ['Belqasmi', 'Fatna', ''], ['Glitho', 'Roch', ''], ['Crespi', 'Noel', ''], ['Morrow', 'Monique', ''], ['Polakos', 'Paul', '']]","['Wireless Sensor Network (WSN)', 'Virtualization', 'Node-level virtualization', 'Network-level virtualization', 'Overlay Networks']"
2771,1808.02101,David Van Horn,"Phuc C. Nguyen, Thomas Gilray, Sam Tobin-Hochstadt, David Van Horn",Size-Change Termination as a Contract,,"Proceedings of the 40th ACM SIGPLAN Conference on Programming
  Language Design and Implementation (PLDI '19), June 22-26, 2019, Phoenix, AZ,
  USA",10.1145/3314221.3314643,,cs.PL,http://creativecommons.org/licenses/by/4.0/,"  Termination is an important but undecidable program property, which has led
to a large body of work on static methods for conservatively predicting or
enforcing termination. One such method is the size-change termination approach
of Lee, Jones, and Ben-Amram, which operates in two phases: (1) abstract
programs into ""size-change graphs,"" and (2) check these graphs for the
size-change property: the existence of paths that lead to infinite decreasing
sequences.
  We transpose these two phases with an operational semantics that accounts for
the run-time enforcement of the size-change property, postponing (or entirely
avoiding) program abstraction. This choice has two key consequences: (1)
size-change termination can be checked at run-time and (2) termination can be
rephrased as a safety property analyzed using existing methods for systematic
abstraction.
  We formulate run-time size-change checks as contracts in the style of Findler
and Felleisen. The result compliments existing contracts that enforce partial
correctness specifications to obtain contracts for total correctness. Our
approach combines the robustness of the size-change principle for termination
with the precise information available at run-time. It has tunable overhead and
can check for nontermination without the conservativeness necessary in static
checking. To obtain a sound and computable termination analysis, we apply
existing abstract interpretation techniques directly to the operational
semantics, avoiding the need for custom abstractions for termination. The
resulting analyzer is competitive with with existing, purpose-built analyzers.
","[{'version': 'v1', 'created': 'Mon, 6 Aug 2018 20:41:56 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Apr 2019 20:41:32 GMT'}]",2019-04-29,"[['Nguyen', 'Phuc C.', ''], ['Gilray', 'Thomas', ''], ['Tobin-Hochstadt', 'Sam', ''], ['Van Horn', 'David', '']]","['termination', 'size-change principle', 'verification']"
2772,1306.1704,Dmytro Karamshuk,"Dmytro Karamshuk, Anastasios Noulas, Salvatore Scellato, Vincenzo
  Nicosia, Cecilia Mascolo","Geo-Spotting: Mining Online Location-based Services for Optimal Retail
  Store Placement","Proceedings of the 19th ACM SIGKDD international conference on
  Knowledge discovery and data mining, Chicago, 2013, Pages 793-801",,10.1145/2487575.2487616,,cs.SI cs.CE physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of identifying the optimal location for a new retail store has
been the focus of past research, especially in the field of land economy, due
to its importance in the success of a business. Traditional approaches to the
problem have factored in demographics, revenue and aggregated human flow
statistics from nearby or remote areas. However, the acquisition of relevant
data is usually expensive. With the growth of location-based social networks,
fine grained data describing user mobility and popularity of places has
recently become attainable.
  In this paper we study the predictive power of various machine learning
features on the popularity of retail stores in the city through the use of a
dataset collected from Foursquare in New York. The features we mine are based
on two general signals: geographic, where features are formulated according to
the types and density of nearby places, and user mobility, which includes
transitions between venues or the incoming flow of mobile users from distant
areas. Our evaluation suggests that the best performing features are common
across the three different commercial chains considered in the analysis,
although variations may exist too, as explained by heterogeneities in the way
retail facilities attract users. We also show that performance improves
significantly when combining multiple features in supervised learning
algorithms, suggesting that the retail success of a business may depend on
multiple factors.
","[{'version': 'v1', 'created': 'Fri, 7 Jun 2013 12:42:06 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Feb 2014 10:48:20 GMT'}]",2014-02-26,"[['Karamshuk', 'Dmytro', ''], ['Noulas', 'Anastasios', ''], ['Scellato', 'Salvatore', ''], ['Nicosia', 'Vincenzo', ''], ['Mascolo', 'Cecilia', '']]","['optimal retail location', 'machine learning', 'location-based services']"
2773,1305.0194,Chantal Cherifi,"Cihan Aksoy, Vincent Labatut, Chantal Cherifi, Jean-Fran\c{c}ois
  Santucci",MATAWS: A Multimodal Approach for Automatic WS Semantic Annotation,,"In International Conference on Networked Digital Technologies,
  Springer CCIS 136),China (2011)",10.1007/978-3-642-22185-9_27,,cs.SE cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many recent works aim at developing methods and tools for the processing of
semantic Web services. In order to be properly tested, these tools must be
applied to an appropriate benchmark, taking the form of a collection of
semantic WS descriptions. However, all of the existing publicly available
collections are limited by their size or their realism (use of randomly
generated or resampled descriptions). Larger and realistic syntactic (WSDL)
collections exist, but their semantic annotation requires a certain level of
automation, due to the number of operations to be processed. In this article,
we propose a fully automatic method to semantically annotate such large WS
collections. Our approach is multimodal, in the sense it takes advantage of the
latent semantics present not only in the parameter names, but also in the type
names and structures. Concept-to-word association is performed by using Sigma,
a mapping of WordNet to the SUMO ontology. After having described in details
our annotation method, we apply it to the larger collection of real-world
syntactic WS descriptions we could find, and assess its efficiency.
","[{'version': 'v1', 'created': 'Wed, 1 May 2013 15:07:18 GMT'}]",2015-02-04,"[['Aksoy', 'Cihan', ''], ['Labatut', 'Vincent', ''], ['Cherifi', 'Chantal', ''], ['Santucci', 'Jean-François', '']]","['Web Service', 'Semantic Web', 'Semantic Annotation', 'Ontology', 'WSDL', 'OWL-S']"
2774,1111.5737,Willy Picard,Wojciech Cellary and Willy Picard,"Agile and Pro-Active Public Administration as a Collaborative Networked
  Organization","6 pages, 2 figures",,10.1145/1930321.1930324,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In highly competitive, globalized economies and societies of always-on-line
people intensively using the Internet and mobile phones, public administrations
have to adapt to new challenges. Enterprises and citizens expect public
administrations to be agile and pro-active to foster development. A way to
achieve agility and pro-activity is application of a model of Collaborative
Network Organizations in its two forms: Virtual Organizations (VO) and Virtual
Organization Breeding Environments (VOBE). In the paper, advantages are shown
of public administration playing a role of a Virtual Organization customer on
the one hand, and a Virtual Organization member on the other hand. It is also
shown how public administration playing a role of a Virtual Organization
Breeding Environment may improve its agility and promote advanced technologies
and management methods among local organizations. It is argued in the paper
that public administration should provide a Virtual Organization Breeding
Environment as a part of public services.
","[{'version': 'v1', 'created': 'Thu, 24 Nov 2011 12:09:40 GMT'}]",2011-11-28,"[['Cellary', 'Wojciech', ''], ['Picard', 'Willy', '']]","['Public administration', 'agility', 'pro-activity', 'virtual organization', 'virtual organization breeding', 'service orientation', 'collaborative networked organization']"
2775,1703.08088,Vineet John,Vineet John,"Rapid-Rate: A Framework for Semi-supervised Real-time Sentiment Trend
  Detection in Unstructured Big Data","11 pages, 6 figures",,10.13140/RG.2.2.32385.04966,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Commercial establishments like restaurants, service centres and retailers
have several sources of customer feedback about products and services, most of
which need not be as structured as rated reviews provided by services like
Yelp, or Amazon, in terms of sentiment conveyed. For instance, Amazon provides
a fine-grained score on a numeric scale for product reviews. Some sources,
however, like social media (Twitter, Facebook), mailing lists (Google Groups)
and forums (Quora) contain text data that is much more voluminous, but
unstructured and unlabelled. It might be in the best interests of a business
establishment to assess the general sentiment towards their brand on these
platforms as well. This text could be pipelined into a system with a built-in
prediction model, with the objective of generating real-time graphs on opinion
and sentiment trends. Although such tasks like the one described about have
been explored with respect to document classification problems in the past, the
implementation described in this paper, by virtue of learning a continuous
function rather than a discrete one, offers a lot more depth of insight as
compared to document classification approaches. This study aims to explore the
validity of such a continuous function predicting model to quantify sentiment
about an entity, without the additional overhead of manual labelling, and
computational preprocessing & feature extraction. This research project also
aims to design and implement a re-usable document regression pipeline as a
framework, Rapid-Rate, that can be used to predict document scores in
real-time.
","[{'version': 'v1', 'created': 'Thu, 23 Mar 2017 14:37:15 GMT'}, {'version': 'v2', 'created': 'Sat, 25 Mar 2017 00:00:00 GMT'}]",2017-03-28,"[['John', 'Vineet', '']]","['natural language processing', 'big data', 'wordembedding', 'regression', 'streaming data processing', 'time-seriesanalytics']"
2776,1209.2738,Samuel Opoku,Samuel King Opoku (Kumasi Polytechnic),A Robust Cryptographic System using Neighborhood-Generated Keys,"9 pages, 2 tables and 4 figures","Samuel King Opoku, ""A Robust Cryptographic System using
  Neighborhood-Generated Keys"". International Journal of Research in Computer
  Science, 2 (5): pp. 1-9, September 2012",10.7815/ijorcs.25.2012.041,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ability to hide information from unauthorized individuals has been a
prevalent issue over the years. Countless algorithms such as DES, AES and SHA
have been developed. These algorithms depend on varying key length and key
management strategies to encrypt and decrypt messages. The size of the
encrypted message is so large that it therefore consumes and wastes valuable
storage space when implemented in organizations that store and handle large
volumes of small data. The ability to share the generated keys securely also
poses a problem. This paper proposes a robust cryptographic algorithm which
generates its keys from the surroundings and already-designed coding schemes.
The proposed system conserves storage space and processing power.The algorithm
is implemented and tested using PHP and MySQL DBMS.
","[{'version': 'v1', 'created': 'Wed, 12 Sep 2012 21:26:39 GMT'}]",2012-09-14,"[['Opoku', 'Samuel King', '', 'Kumasi Polytechnic']]","['Algorithm', 'Cryptography', 'Coding Scheme', 'Key Management', 'Privacy', 'Security']"
2777,1912.07579,Piotr Sapiezynski,"Piotr Sapiezynski, Avijit Ghosh, Levi Kaplan, Aaron Rieke, Alan
  Mislove","Algorithms that ""Don't See Color"": Comparing Biases in Lookalike and
  Special Ad Audiences",,"Proceedings of the 2022 AAAI/ACM Conference on AI, Ethics, and
  Society",10.1145/3514094.3534135,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Researchers and journalists have repeatedly shown that algorithms commonly
used in domains such as credit, employment, healthcare, or criminal justice can
have discriminatory effects. Some organizations have tried to mitigate these
effects by simply removing sensitive features from an algorithm's inputs. In
this paper, we explore the limits of this approach using a unique opportunity.
In 2019, Facebook agreed to settle a lawsuit by removing certain sensitive
features from inputs of an algorithm that identifies users similar to those
provided by an advertiser for ad targeting, making both the modified and
unmodified versions of the algorithm available to advertisers. We develop
methodologies to measure biases along the lines of gender, age, and race in the
audiences created by this modified algorithm, relative to the unmodified one.
Our results provide experimental proof that merely removing demographic
features from a real-world algorithmic system's inputs can fail to prevent
biased outputs. As a result, organizations using algorithms to help mediate
access to important life opportunities should consider other approaches to
mitigating discriminatory effects.
","[{'version': 'v1', 'created': 'Mon, 16 Dec 2019 18:48:15 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Dec 2019 02:52:21 GMT'}, {'version': 'v3', 'created': 'Tue, 31 May 2022 15:36:01 GMT'}]",2022-06-01,"[['Sapiezynski', 'Piotr', ''], ['Ghosh', 'Avijit', ''], ['Kaplan', 'Levi', ''], ['Rieke', 'Aaron', ''], ['Mislove', 'Alan', '']]","['online advertising', 'fairness', 'process fairness']"
2778,1203.0369,Ak Rs,"Abhijit Chowdhury (NSHM College of Management & Technology, Durgapur
  West Bengal, INDIA), Angshu Kumar Sinha (NSHM College of Management &
  Technology, Durgapur West Bengal, INDIA) Saurabh Dutta (Dr. B.C Roy
  Engineering College West Bengal, INDIA)",Introduction of a Triple Prime Symmetric Key Block Cipher,,"International Journal of Computer Applications (0975 - 8887)
  Volume 39 - No.7, February 2012",10.5120/4831-7089,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes to put forward an innovative algorithm for symmetric key
block cipher named as ""Triple Prime Symmetric Key Block Cipher with Variable
Key-Spaces (TPSKBCVK)"" that employs triple prime integers as private key-spaces
of varying lengths to encrypt data files. Principles of modular arithmetic have
been elegantly used in the proposed idea of the cipher. Depending on
observations of the results of implementation of the proposed cipher on a set
of real data files of several types, all results are registered and analyzed.
The strength of the underlying design of the cipher and the liberty of using a
long key-space expectedly makes it reasonably non-susceptible against possible
cryptanalytic intrusions. As a future scope of the work, it is intended to
formulate and employ an improved scheme that will use a carrier media (image or
multimedia data file) for a secure transmission of the private keys.
","[{'version': 'v1', 'created': 'Fri, 2 Mar 2012 04:50:35 GMT'}]",2012-03-19,"[['Chowdhury', 'Abhijit', '', 'NSHM College of Management & Technology, Durgapur\n  West Bengal, INDIA'], ['Sinha', 'Angshu Kumar', '', 'NSHM College of Management &\n  Technology, Durgapur West Bengal, INDIA'], ['Dutta', 'Saurabh', '', 'Dr. B.C Roy\n  Engineering College West Bengal, INDIA']]","['Data Security', 'Cryptography', 'Prime Number', 'Block Cipher']"
2779,2105.04301,Zhewei Chen,"Zhewei Chen, Wenwen Yu, Linyue Zhou",ADASYN-Random Forest Based Intrusion Detection Model,Accepted by SPML 2021,,10.1145/3483207.3483232,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intrusion detection has been a key topic in the field of cyber security, and
the common network threats nowadays have the characteristics of varieties and
variation. Considering the serious imbalance of intrusion detection datasets
will result in low classification performance on attack behaviors of small
sample size and difficulty to detect network attacks accurately and
efficiently, using Adaptive Synthetic Sampling (ADASYN) method to balance
datasets was proposed in this paper. In addition, Random Forest algorithm was
used to train intrusion detection classifiers. Through the comparative
experiment of Intrusion detection on CICIDS 2017 dataset, it is found that
ADASYN with Random Forest performs better. Based on the experimental results,
the improvement of precision, recall, F1 scores and AUC values after ADASYN is
then analyzed. Experiments show that the proposed method can be applied to
intrusion detection with large data, and can effectively improve the
classification accuracy of network attack behaviors. Compared with traditional
machine learning models, it has better performance, generalization ability and
robustness.
","[{'version': 'v1', 'created': 'Mon, 10 May 2021 12:22:36 GMT'}, {'version': 'v2', 'created': 'Wed, 19 May 2021 14:26:18 GMT'}, {'version': 'v3', 'created': 'Thu, 20 May 2021 02:04:09 GMT'}, {'version': 'v4', 'created': 'Tue, 12 Apr 2022 14:03:01 GMT'}, {'version': 'v5', 'created': 'Wed, 13 Apr 2022 08:29:28 GMT'}, {'version': 'v6', 'created': 'Thu, 14 Apr 2022 15:28:45 GMT'}]",2022-04-15,"[['Chen', 'Zhewei', ''], ['Yu', 'Wenwen', ''], ['Zhou', 'Linyue', '']]","['cyber security', 'intrusion detection', 'machine learning', 'random forest', 'class imbalance']"
2780,2208.14244,Tsubasa Nakagawa,"Tsubasa Nakagawa, Shunsuke Kitada, Hitoshi Iyatomi","Expressions Causing Differences in Emotion Recognition in Social
  Networking Service Documents","5 pages, 3 figures. Accepted at the 31st ACM International Conference
  on Information and Knowledge Management (CIKM '22) as a short paper","Proceedings of the 31st ACM International Conference on
  Information and Knowledge Management (CIKM'22), October 17--21, 2022,
  Atlanta, GA, USA",10.1145/3511808.3557599,,cs.CL cs.AI cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is often difficult to correctly infer a writer's emotion from text
exchanged online, and differences in recognition between writers and readers
can be problematic. In this paper, we propose a new framework for detecting
sentences that create differences in emotion recognition between the writer and
the reader and for detecting the kinds of expressions that cause such
differences. The proposed framework consists of a bidirectional encoder
representations from transformers (BERT)-based detector that detects sentences
causing differences in emotion recognition and an analysis that acquires
expressions that characteristically appear in such sentences. The detector,
based on a Japanese SNS-document dataset with emotion labels annotated by both
the writer and three readers of the social networking service (SNS) documents,
detected ""hidden-anger sentences"" with AUC = 0.772; these sentences gave rise
to differences in the recognition of anger. Because SNS documents contain many
sentences whose meaning is extremely difficult to interpret, by analyzing the
sentences detected by this detector, we obtained several expressions that
appear characteristically in hidden-anger sentences. The detected sentences and
expressions do not convey anger explicitly, and it is difficult to infer the
writer's anger, but if the implicit anger is pointed out, it becomes possible
to guess why the writer is angry. Put into practical use, this framework would
likely have the ability to mitigate problems based on misunderstandings.
","[{'version': 'v1', 'created': 'Tue, 30 Aug 2022 13:17:32 GMT'}, {'version': 'v2', 'created': 'Sat, 3 Sep 2022 09:22:31 GMT'}]",2022-09-07,"[['Nakagawa', 'Tsubasa', ''], ['Kitada', 'Shunsuke', ''], ['Iyatomi', 'Hitoshi', '']]","['natural language processing', 'sentiment analysis', 'text mining']"
2781,1901.05214,Lukas Kades,Lukas Kades and Jan M. Pawlowski,"The Discrete Langevin Machine: Bridging the Gap Between Thermodynamic
  and Neuromorphic Systems","25 pages, 16 figures","Phys. Rev. E 101, 063304 (2020)",10.1103/PhysRevE.101.063304,,cs.NE hep-lat physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A formulation of Langevin dynamics for discrete systems is derived as a class
of generic stochastic processes. The dynamics simplify for a two-state system
and suggest a network architecture which is implemented by the Langevin
machine. The Langevin machine represents a promising approach to compute
successfully quantitative exact results of Boltzmann distributed systems by LIF
neurons. Besides a detailed introduction of the dynamics, different simplified
models of a neuromorphic hardware system are studied with respect to a control
of emerging sources of errors.
","[{'version': 'v1', 'created': 'Wed, 16 Jan 2019 10:33:38 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Apr 2019 13:35:12 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Apr 2021 15:41:05 GMT'}]",2021-04-08,"[['Kades', 'Lukas', ''], ['Pawlowski', 'Jan M.', '']]","['Langevin dynamics', 'Discrete systems', 'Boltzmann machine', '¸ Neuromorphic systems', 'LIF neurons', 'BrainScaleS']"
2782,1504.01647,Valmir Barbosa,"Fabio R. J. Vieira, Jos\'e F. de Rezende, Valmir C. Barbosa","Scheduling wireless links by graph multicoloring in the physical
  interference model",,"Computer Networks 99 (2016), 125-133",10.1016/j.comnet.2016.02.008,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scheduling wireless links for simultaneous activation in such a way that all
transmissions are successfully decoded at the receivers and moreover network
capacity is maximized is a computationally hard problem. Usually it is tackled
by heuristics whose output is a sequence of time slots in which every link
appears in exactly one time slot. Such approaches can be interpreted as the
coloring of a graph's vertices so that every vertex gets exactly one color.
Here we introduce a new approach that can be viewed as assigning multiple
colors to each vertex, so that, in the resulting schedule, every link may
appear more than once (though the same number of times for all links). We
report on extensive computational experiments, under the physical interference
model, revealing substantial gains for a variety of randomly generated
networks.
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2015 15:41:37 GMT'}]",2016-03-15,"[['Vieira', 'Fabio R. J.', ''], ['de Rezende', 'José F.', ''], ['Barbosa', 'Valmir C.', '']]","['Wireless mesh networks', 'Link scheduling', 'Physical interference model', 'Graph coloring', 'Graph multicoloring']"
2783,1807.00146,Ralf-Peter Mundani,"J\'er\^ome Frisch (1), Ralf-Peter Mundani (2) ((1) RWTH Aachen
  University, Aachen, Germany, (2) Technische Universit\""at M\""unchen, Munich,
  Germany)","Measuring and comparing the scaling behaviour of a high-performance CFD
  code on different supercomputing infrastructures","8 pages, 8 figures","Proceedings of the 17th International Symposium on Symbolic and
  Numeric Algorithms for Scientific Computing (2015) 371-378",10.1109/SYNASC.2015.63,,cs.PF physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parallel code design is a challenging task especially when addressing
petascale systems for massive parallel processing (MPP), i.e. parallel
computations on several hundreds of thousands of cores. An in-house
computational fluid dynamics code, developed by our group, was designed for
such high-fidelity runs in order to exhibit excellent scalability values. Basis
for this code is an adaptive hierarchical data structure together with an
efficient communication and (numerical) computation scheme that supports MPP.
For a detailled scalability analysis, we performed several experiments on two
of Germany's national supercomputers up to 140,000 processes. In this paper, we
will show the results of those experiments and discuss any bottlenecks that
could be observed while solving engineering-based problems such as porous media
flows or thermal comfort assessments for problem sizes up to several hundred
billion degrees of freedom.
","[{'version': 'v1', 'created': 'Sat, 30 Jun 2018 09:03:39 GMT'}]",2018-07-03,"[['Frisch', 'Jérôme', ''], ['Mundani', 'Ralf-Peter', '']]","['high-performance computing', 'adaptive data structure', 'multi-grid-like solver concept', 'speed-up measurements']"
2784,1903.02236,Eissa Alreshidi Dr.,Eissa Jaber Alreshidi and Mohammad Bilal,Characterizing Human Behaviours Using Statistical Motion Descriptor,,Signal & Image Processing: An International Journal (SIPIJ) 2019,10.5121/sipij.2019.10102,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identifying human behaviors is a challenging research problem due to the
complexity and variation of appearances and postures, the variation of camera
settings, and view angles. In this paper, we try to address the problem of
human behavior identification by introducing a novel motion descriptor based on
statistical features. The method first divide the video into N number of
temporal segments. Then for each segment, we compute dense optical flow, which
provides instantaneous velocity information for all the pixels. We then compute
Histogram of Optical Flow (HOOF) weighted by the norm and quantized into 32
bins. We then compute statistical features from the obtained HOOF forming a
descriptor vector of 192- dimensions. We then train a non-linear multi-class
SVM that classify different human behaviors with the accuracy of 72.1%. We
evaluate our method by using publicly available human action data set.
Experimental results shows that our proposed method out performs state of the
art methods.
","[{'version': 'v1', 'created': 'Wed, 6 Mar 2019 08:19:49 GMT'}]",2019-03-08,"[['Alreshidi', 'Eissa Jaber', ''], ['Bilal', 'Mohammad', '']]","['Support vector machine', 'motion descriptor', 'features', 'human behaviours']"
2785,0807.2829,Thomas Hewer,Thomas D. Hewer and Maziar Nekovee,"Congestion Reduction Using Ad hoc Message Dissemination in Vehicular
  Networks","Workshop, 9 pages, 7 figures","Proceedings of the 4th IEEE International Workshop on
  Vehicle-to-Vehicle Communications, pages 1-7, 2008",10.1007/978-3-642-11284-3_14,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vehicle-to-vehicle communications can be used effectively for intelligent
transport systems (ITS) and location-aware services. The ability to disseminate
information in an ad-hoc fashion allows pertinent information to propagate
faster through the network. In the realm of ITS, the ability to spread warning
information faster and further is of great advantage to the receivers of this
information. In this paper we propose and present a message-dissemination
procedure that uses vehicular wireless protocols for influencing traffic flow,
reducing congestion in road networks. The computational experiments presented
in this paper show how an intelligent driver model (IDM) and car-following
model can be adapted to 'react' to the reception of information. This model
also presents the advantages of coupling together traffic modelling tools and
network simulation tools.
","[{'version': 'v1', 'created': 'Thu, 17 Jul 2008 16:40:53 GMT'}]",2015-05-13,"[['Hewer', 'Thomas D.', ''], ['Nekovee', 'Maziar', '']]","['Vehicular Networks', 'Modelling andSimulations', 'Intelligent Transportation Systems']"
2786,1808.10837,Sameera Horawalavithana,"Sameera Horawalavithana, Clayton Gandy, Juan Arroyo Flores, John
  Skvoretz, Adriana Iamnitchi","Diversity, Topology, and the Risk of Node Re-identification in Labeled
  Social Graphs",,Applied Network Science 2019,10.1007/s41109-019-0148-x,,cs.SI physics.soc-ph,http://creativecommons.org/publicdomain/zero/1.0/,"  Real network datasets provide significant benefits for understanding
phenomena such as information diffusion or network evolution. Yet the privacy
risks raised from sharing real graph datasets, even when stripped of user
identity information, are significant. When nodes have associated attributes,
the privacy risks increase. In this paper we quantitatively study the impact of
binary node attributes on node privacy by employing machine-learning-based
re-identification attacks and exploring the interplay between graph topology
and attribute placement. Our experiments show that the population's diversity
on the binary attribute consistently degrades anonymity.
","[{'version': 'v1', 'created': 'Fri, 31 Aug 2018 16:51:27 GMT'}]",2020-04-28,"[['Horawalavithana', 'Sameera', ''], ['Gandy', 'Clayton', ''], ['Flores', 'Juan Arroyo', ''], ['Skvoretz', 'John', ''], ['Iamnitchi', 'Adriana', '']]","['Node re-identification', 'machine learning attack', 'labeled networks']"
2787,1212.2451,Merad Boudia Omar Rafik,"Omar Rafik Merad Boudia, Mohamed Feham","RSAED: Robust and Secure Aggregation of Encrypted Data in Wireless
  Sensor Networks",15 pages,,10.5121/ijnsa.2012.4601,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, secure in-network aggregation in wireless sensor networks becomes a
challenge issue, there is an extensive research on this area due to the large
number of applications where the sensors are deployed and the security needs.
In the last few years, aggregation of encrypted data has been proposed in order
to maintain secrecy between the sensors and the sink, so the end-to-end data
confidentiality is provided. However, the data integrity was not addressed. In
this paper, we propose RSAED that allows integrity verification at intermediate
nodes, ensures the base station to receive ciphertexts which come only from
legitimate nodes and also improves the efficiency. Through implementation
results, we evaluate our scheme using computation and communication overhead.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2012 16:14:11 GMT'}]",2012-12-12,"[['Boudia', 'Omar Rafik Merad', ''], ['Feham', 'Mohamed', '']]","['Data Aggregation', 'Wireless Sensor Networks', 'Homomorphic encryption', 'Elliptic Curve Cryptography']"
2788,1504.07901,Achraf Ben-Hamadou,"Achraf Ben-Hamadou and Charles Soussen and Walter Blondel and
  Christian Daul and Didier Wolf","Comparative study of image registration techniques for bladder
  video-endoscopy","7 pages, 5 figures","Novel Optical Instrumentation for Biomedical Applications, 737118
  (10 July 2009)",10.1117/12.831772,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bladder cancer is widely spread in the world. Many adequate diagnosis
techniques exist. Video-endoscopy remains the standard clinical procedure for
visual exploration of the bladder internal surface. However, video-endoscopy
presents the limit that the imaged area for each image is about nearly 1cm2.
And, lesions are, typically, spread over several images. The aim of this
contribution is to assess the performance of two mosaicing algorithms leading
to the construction of panoramic maps (one unique image) of bladder walls. The
quantitative comparison study is performed on a set of real endoscopic exam
data and on simulated data relative to bladder phantom.
","[{'version': 'v1', 'created': 'Wed, 29 Apr 2015 15:48:22 GMT'}]",2015-04-30,"[['Ben-Hamadou', 'Achraf', ''], ['Soussen', 'Charles', ''], ['Blondel', 'Walter', ''], ['Daul', 'Christian', ''], ['Wolf', 'Didier', '']]","['Bladder', 'cancer', 'image registration and mosaicing', 'panoramic images']"
2789,1501.02192,Mohammad Alhawarat Dr.,"M. Alhawarat, T. Olde Scheper and N.T. Crook",Investigation of a chaotic spiking neuron model,,"International Journal of Computer Applications 99(17):1-8, August
  2014",10.5120/17462-8258,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Chaos provides many interesting properties that can be used to achieve
computational tasks. Such properties are sensitivity to initial conditions,
space filling, control and synchronization. Chaotic neural models have been
devised to exploit such properties. In this paper, a chaotic spiking neuron
model is investigated experimentally. This investigation is performed to
understand the dynamic behaviours of the model.
  The aim of this research is to investigate the dynamics of the nonlinear
dynamic state neuron (NDS) experimentally. The experimental approach has
revealed some quantitative and qualitative properties of the NDS model such as
the control mechanism, the reset mechanism, and the way the model may exhibit
dynamic behaviours in phase space. It is shown experimentally in this paper
that both the reset mechanism and the self-feed back control mechanism are
important for the NDS model to work and to stabilise to one of the large number
of available unstable periodic orbits (UPOs) that are embedded in its
attractor. The experimental investigation suggests that the internal dynamics
of the NDS neuron provide a rich set of dynamic behaviours that can be
controlled and stabilised. These wide range of dynamic behaviours may be
exploited to carry out information processing tasks.
","[{'version': 'v1', 'created': 'Fri, 9 Jan 2015 16:20:42 GMT'}]",2015-01-12,"[['Alhawarat', 'M.', ''], ['Scheper', 'T. Olde', ''], ['Crook', 'N. T.', '']]","['R¨ossler Attractor', 'Chaotic Spiking Neural Model', 'NonlinearDynamics Investigation']"
2790,1801.04644,Aldeida Aleti Dr,"Aldeida Aleti, Catia Trubiani, Andr\'e van Hoorn, Pooyan Jamshidi","An Efficient Method for Uncertainty Propagation in Robust Software
  Performance Estimation",,,10.1016/j.jss.2018.01.010,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Software engineers often have to estimate the performance of a software
system before having full knowledge of the system parameters, such as workload
and operational profile. These uncertain parameters inevitably affect the
accuracy of quality evaluations, and the ability to judge if the system can
continue to fulfil performance requirements if parameter results are different
from expected. Previous work has addressed this problem by modelling the
potential values of uncertain parameters as probability distribution functions,
and estimating the robustness of the system using Monte Carlo-based methods.
These approaches require a large number of samples, which results in high
computational cost and long waiting times.
  To address the computational inefficiency of existing approaches, we employ
Polynomial Chaos Expansion (PCE) as a rigorous method for uncertainty
propagation and further extend its use to robust performance estimation. The
aim is to assess if the software system is robust, i.e., it can withstand
possible changes in parameter values, and continue to meet performance
requirements. PCE is a very efficient technique, and requires significantly
less computations to accurately estimate the distribution of performance
indices. Through three very different case studies from different phases of
software development and heterogeneous application domains, we show that PCE
can accurately (>97\%) estimate the robustness of various performance indices,
and saves up to 225 hours of performance evaluation time when compared to Monte
Carlo Simulation.
","[{'version': 'v1', 'created': 'Mon, 15 Jan 2018 02:32:54 GMT'}]",2018-01-16,"[['Aleti', 'Aldeida', ''], ['Trubiani', 'Catia', ''], ['van Hoorn', 'André', ''], ['Jamshidi', 'Pooyan', '']]","['Polynomial Chaos Expansion', 'Software Performance Engineering', 'UncertaintyPropagation']"
2791,1111.4499,Somayeh Kafaie,"Somayeh Kafaie, Omid Kashefi and Mohsen Sharifi",A Low-Energy Fast Cyber Foraging Mechanism for Mobile Devices,"12 pages, 7 figures, International Journal of Wireless & Mobile
  Networks (IJWMN)","International Journal of Wireless & Mobile Networks (IJWMN) Vol.
  3, No. 5, October 2011",10.5121/ijwmn.2011.3516,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ever increasing demands for using resource-constrained mobile devices for
running more resource intensive applications nowadays has initiated the
development of cyber foraging solutions that offload parts or whole
computational intensive tasks to more powerful surrogate stationary computers
and run them on behalf of mobile devices as required. The choice of proper mix
of mobile devices and surrogates has remained an unresolved challenge though.
In this paper, we propose a new decision-making mechanism for cyber foraging
systems to select the best locations to run an application, based on context
metrics such as the specifications of surrogates, the specifications of mobile
devices, application specification, and communication network specification.
Experimental results show faster response time and lower energy consumption of
benched applications compared to when applications run wholly on mobile devices
and when applications are offloaded to surrogates blindly for execution.
","[{'version': 'v1', 'created': 'Fri, 18 Nov 2011 21:37:36 GMT'}]",2011-11-22,"[['Kafaie', 'Somayeh', ''], ['Kashefi', 'Omid', ''], ['Sharifi', 'Mohsen', '']]","['Pervasive Computing', 'Cyber Foraging', 'Offloading', 'Surrogate', 'Mobile Computing', 'Resource Constraint']"
2792,1309.3685,Pece Mitrevski,Pece Mitrevski and Marjan Gusev,"On the Performance Potential of Speculative Execution based on Branch
  and Value Prediction",,"International Scientific Journal Facta Universitatis, Series:
  Electronics and Energetics, Vol. 16, No. 1, ISSN: 0353-3670, pp. 83-91, 2003",10.2298/FUEE0301083M,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fluid Stochastic Petri Nets are used to capture the dynamic behavior of an
ILP processor, and discrete-event simulation is applied to assess the
performance potential of predictions and speculative execution in boosting the
performance of ILP processors that fetch, issue, execute and commit a large
number of instructions per cycle.
","[{'version': 'v1', 'created': 'Sat, 14 Sep 2013 16:43:05 GMT'}]",2013-09-17,"[['Mitrevski', 'Pece', ''], ['Gusev', 'Marjan', '']]","['Instruction level parallelism', 'speculative execution', 'branch prediction', 'value prediction', 'fluid stochastic petri nets']"
2793,1610.08871,Nicholas Westlake,"Nicholas Westlake, Hongping Cai and Peter Hall",Detecting People in Artwork with CNNs,"14 pages, plus 3 pages of references; 7 figures in ECCV 2016
  Workshops",,10.1007/978-3-319-46604-0_57,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CNNs have massively improved performance in object detection in photographs.
However research into object detection in artwork remains limited. We show
state-of-the-art performance on a challenging dataset, People-Art, which
contains people from photos, cartoons and 41 different artwork movements. We
achieve this high performance by fine-tuning a CNN for this task, thus also
demonstrating that training CNNs on photos results in overfitting for photos:
only the first three or four layers transfer from photos to artwork. Although
the CNN's performance is the highest yet, it remains less than 60\% AP,
suggesting further work is needed for the cross-depiction problem. The final
publication is available at Springer via
http://dx.doi.org/10.1007/978-3-319-46604-0_57
","[{'version': 'v1', 'created': 'Thu, 27 Oct 2016 16:30:15 GMT'}]",2016-10-28,"[['Westlake', 'Nicholas', ''], ['Cai', 'Hongping', ''], ['Hall', 'Peter', '']]","['CNNs', 'cross-depiction problem', 'object recognition']"
2794,1904.02444,Lucas Gren,"Lucas Gren, Richard Torkar and Robert Feldt","The prospects of a quantitative measurement of agility: A validation
  study on an agile maturity model",,The Journal of Systems and Software 107 (2015) 38-49,10.1016/j.jss.2015.05.008,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Agile development has now become a well-known approach to collaboration in
professional work life. Both researchers and practitioners want validated tools
to measure agility. This study sets out to validate an agile maturity
measurement model with statistical tests and empirical data. First, a pretest
was conducted as a case study including a survey and focus group. Second, the
main study was conducted with 45 employees from two SAP customers in the US. We
used internal consistency (by a Cronbach's alpha) as the main measure for
reliability and analyzed construct validity by exploratory principal factor
analysis (PFA). The results suggest a new categorization of a subset of items
existing in the tool and provides empirical support for these new groups of
factors. However, we argue that more work is needed to reach the point where a
maturity models with quantitative data can be said to validly measure agility,
and even then, such a measurement still needs to include some deeper analysis
with cultural and contextual items.
","[{'version': 'v1', 'created': 'Thu, 4 Apr 2019 10:03:17 GMT'}]",2019-04-05,"[['Gren', 'Lucas', ''], ['Torkar', 'Richard', ''], ['Feldt', 'Robert', '']]","['Agility', 'Measurement', 'Project Management', 'Empirical study', 'Validation']"
2795,1611.07083,Erik Schnetter,"Pekka J\""a\""askel\""ainen, Carlos S\'anchez de La Lama, Erik Schnetter,
  Kalle Raiskila, Jarmo Takala, Heikki Berg",pocl: A Performance-Portable OpenCL Implementation,"This article was published in 2015; it is now openly accessible via
  arxiv",Int J Parallel Prog (2015) 43: 752,10.1007/s10766-014-0320-y,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  OpenCL is a standard for parallel programming of heterogeneous systems. The
benefits of a common programming standard are clear; multiple vendors can
provide support for application descriptions written according to the standard,
thus reducing the program porting effort. While the standard brings the obvious
benefits of platform portability, the performance portability aspects are
largely left to the programmer. The situation is made worse due to multiple
proprietary vendor implementations with different characteristics, and, thus,
required optimization strategies.
  In this paper, we propose an OpenCL implementation that is both portable and
performance portable. At its core is a kernel compiler that can be used to
exploit the data parallelism of OpenCL programs on multiple platforms with
different parallel hardware styles. The kernel compiler is modularized to
perform target-independent parallel region formation separately from the
target-specific parallel mapping of the regions to enable support for various
styles of fine-grained parallel resources such as subword SIMD extensions, SIMD
datapaths and static multi-issue. Unlike previous similar techniques that work
on the source level, the parallel region formation retains the information of
the data parallelism using the LLVM IR and its metadata infrastructure. This
data can be exploited by the later generic compiler passes for efficient
parallelization.
  The proposed open source implementation of OpenCL is also platform portable,
enabling OpenCL on a wide range of architectures, both already commercialized
and on those that are still under research. The paper describes how the
portability of the implementation is achieved. Our results show that most of
the benchmarked applications when compiled using pocl were faster or close to
as fast as the best proprietary OpenCL implementation for the platform at hand.
","[{'version': 'v1', 'created': 'Mon, 21 Nov 2016 22:24:58 GMT'}]",2016-11-23,"[['Jääskeläinen', 'Pekka', ''], ['de La Lama', 'Carlos Sánchez', ''], ['Schnetter', 'Erik', ''], ['Raiskila', 'Kalle', ''], ['Takala', 'Jarmo', ''], ['Berg', 'Heikki', '']]","['OpenCL', 'LLVM', 'GPGPU', 'VLIW', 'SIMD', 'Parallel Programming', 'Heterogeneous Platforms', 'Performance Portability']"
2796,2105.03933,Han Zhang,"Han Zhang, Hongwei Shen, Yiming Qiu, Yunjiang Jiang, Songlin Wang,
  Sulong Xu, Yun Xiao, Bo Long, Wen-Yun Yang","Joint Learning of Deep Retrieval Model and Product Quantization based
  Embedding Index","4 pages, 4 figures; accepted by SIGIR2021",,10.1145/3404835.3462988,,cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Embedding index that enables fast approximate nearest neighbor(ANN) search,
serves as an indispensable component for state-of-the-art deep retrieval
systems. Traditional approaches, often separating the two steps of embedding
learning and index building, incur additional indexing time and decayed
retrieval accuracy. In this paper, we propose a novel method called Poeem,
which stands for product quantization based embedding index jointly trained
with deep retrieval model, to unify the two separate steps within an end-to-end
training, by utilizing a few techniques including the gradient straight-through
estimator, warm start strategy, optimal space decomposition and Givens
rotation. Extensive experimental results show that the proposed method not only
improves retrieval accuracy significantly but also reduces the indexing time to
almost none. We have open sourced our approach for the sake of comparison and
reproducibility.
","[{'version': 'v1', 'created': 'Sun, 9 May 2021 13:17:31 GMT'}, {'version': 'v2', 'created': 'Tue, 11 May 2021 13:09:21 GMT'}, {'version': 'v3', 'created': 'Fri, 28 May 2021 08:32:08 GMT'}]",2021-05-31,"[['Zhang', 'Han', ''], ['Shen', 'Hongwei', ''], ['Qiu', 'Yiming', ''], ['Jiang', 'Yunjiang', ''], ['Wang', 'Songlin', ''], ['Xu', 'Sulong', ''], ['Xiao', 'Yun', ''], ['Long', 'Bo', ''], ['Yang', 'Wen-Yun', '']]","['embedding index', 'neural network', 'information retrieval']"
2797,1005.0340,Moazzam Tiwana,"Moazzam Islam Tiwana, Berna Sayrac and Zwi Altman","Statistical Learning in Automated Troubleshooting: Application to LTE
  Interference Mitigation","IEEE Transactions On Vehicular Technology 2010 IEEE transactions on
  vehicular technology",,10.1109/TVT.2010.2050081,,cs.LG,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper presents a method for automated healing as part of off-line
automated troubleshooting. The method combines statistical learning with
constraint optimization. The automated healing aims at locally optimizing radio
resource management (RRM) or system parameters of cells with poor performance
in an iterative manner. The statistical learning processes the data using
Logistic Regression (LR) to extract closed form (functional) relations between
Key Performance Indicators (KPIs) and Radio Resource Management (RRM)
parameters. These functional relations are then processed by an optimization
engine which proposes new parameter values. The advantage of the proposed
formulation is the small number of iterations required by the automated healing
method to converge, making it suitable for off-line implementation. The
proposed method is applied to heal an Inter-Cell Interference Coordination
(ICIC) process in a 3G Long Term Evolution (LTE) network which is based on
soft-frequency reuse scheme. Numerical simulations illustrate the benefits of
the proposed approach.
","[{'version': 'v1', 'created': 'Mon, 3 May 2010 16:35:49 GMT'}]",2016-11-15,"[['Tiwana', 'Moazzam Islam', ''], ['Sayrac', 'Berna', ''], ['Altman', 'Zwi', '']]","['Statistical learning', 'Logistic Regression', 'automated healing', 'troubleshooting', 'Inter-cellular InterferenceCoordination', 'LTE']"
2798,1207.2708,Gaurav Raj,"Gaurav Raj, Sonika Setia","Effective Cost Mechanism for Cloudlet Retransmission and Prioritized VM
  Scheduling Mechanism over Broker Virtual Machine Communication Framework","10 pages, 5 figures, International Journal on Cloud Computing:
  Services and Architecture(IJCCSA),Vol.2, No.3, June 2012",,10.5121/ijccsa.2012.2305,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In current scenario cloud computing is most widely increasing platform for
task execution. Lot of research is going on to cut down the cost and execution
time. In this paper, we propose an efficient algorithm to have an effective and
fast execution of task assigned by the user. We proposed an effective
communication framework between broker and virtual machine for assigning the
task and fetching the results in optimum time and cost using Broker Virtual
Machine Communication Framework (BVCF). We implement it over cloudsim under VM
scheduling policies by modification based on Virtual Machine Cost. Scheduling
over Virtual Machine as well as over Cloudlets and Retransmission of Cloudlets
are the basic building blocks of the proposed work on which the whole
architecture is dependent. Execution of cloudlets is being analyzed over Round
Robin and FCFS scheduling policy.
","[{'version': 'v1', 'created': 'Wed, 11 Jul 2012 16:57:18 GMT'}]",2012-07-12,"[['Raj', 'Gaurav', ''], ['Setia', 'Sonika', '']]","['Broker Cloud Machine Communication Framework', 'Cloud Computing', 'Cost', 'Scheduling', 'Virtual Machine']"
2799,2205.06085,Philipp Jeitner,"Tianxiang Dai, Philipp Jeitner, Haya Shulman and Michael Waidner","From IP to transport and beyond: cross-layer attacks against
  applications",,"SIGCOMM '21: Proceedings of the 2021 ACM SIGCOMM 2021 Conference,
  August 2021, Pages 836-849",10.1145/3452296.3472933,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We perform the first analysis of methodologies for launching DNS cache
poisoning: manipulation at the IP layer, hijack of the inter-domain routing and
probing open ports via side channels. We evaluate these methodologies against
DNS resolvers in the Internet and compare them with respect to effectiveness,
applicability and stealth. Our study shows that DNS cache poisoning is a
practical and pervasive threat.
  We then demonstrate cross-layer attacks that leverage DNS cache poisoning for
attacking popular systems, ranging from security mechanisms, such as RPKI, to
applications, such as VoIP. In addition to more traditional adversarial goals,
most notably impersonation and Denial of Service, we show for the first time
that DNS cache poisoning can even enable adversaries to bypass cryptographic
defences: we demonstrate how DNS cache poisoning can facilitate BGP prefix
hijacking of networks protected with RPKI even when all the other networks
apply route origin validation to filter invalid BGP announcements. Our study
shows that DNS plays a much more central role in the Internet security than
previously assumed.
  We recommend mitigations for securing the applications and for preventing
cache poisoning.
","[{'version': 'v1', 'created': 'Thu, 12 May 2022 13:36:59 GMT'}]",2022-05-13,"[['Dai', 'Tianxiang', ''], ['Jeitner', 'Philipp', ''], ['Shulman', 'Haya', ''], ['Waidner', 'Michael', '']]","['DNS Cache Poisoning', 'Fragmentation', 'BGP hijacking', 'Side Channels']"
2800,1807.04118,Takumi Ichimura,"Takumi Ichimura, Takuya Uemoto, Akira Hara","Emergence of Altruism Behavior for Multi Feeding Areas in Army Ant
  Social Evolutionary System","6 pages, 11 figures","Proc. of 2014 IEEE International Conference on Systems, Man, and
  Cybernetics (IEEE SMC 2014)",10.1109/SMC.2014.6973902,,cs.MA cs.ET cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Army ants perform the altruism that an ant sacrifices its own well-being for
the benefit of another ants. Army ants build bridges using their own bodies
along the path from a food to the nest. We developed the army ant inspired
social evolutionary system which can perform the altruism. The system has 2
kinds of ant agents, `Major ant' and `Minor ant' and the ants communicate with
each other via pheromones. One ants can recognize them as the signals from the
other ants. The pheromones evaporate with the certain ratio and diffused into
the space of neighbors stochastically. If the optimal bridge is found, the path
through the bridge is the shortest route from foods to the nest. We define the
probability for an ant to leave a bridge at a low occupancy condition of ants
and propose the constructing method of the optimal route. In this paper, the
behaviors of ant under the environment with two or more feeding spots are
observed. Some experimental results show the behaviors of great interest with
respect to altruism of ants. The description in some computer simulation is
reported in this paper.
","[{'version': 'v1', 'created': 'Tue, 10 Jul 2018 04:40:38 GMT'}]",2018-07-12,"[['Ichimura', 'Takumi', ''], ['Uemoto', 'Takuya', ''], ['Hara', 'Akira', '']]","['Army Ants', 'Altruism Behavior', 'Multi Agent System', 'Evolutionary Simulation', 'Swarm library']"
2801,1801.02716,Mehran Mahmoudi,Mehran Mahmoudi and Sarah Nadi,The Android Update Problem: An Empirical Study,"11 pages, 4 figures, 4 tables",,10.1145/3196398.3196434,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Many phone vendors use Android as their underlying OS, but often extend it to
add new functionality and to make it compatible with their specific phones.
When a new version of Android is released, phone vendors need to merge or
re-apply their customizations and changes to the new release. This is a
difficult and time-consuming process, which often leads to late adoption of new
versions. In this paper, we perform an empirical study to understand the nature
of changes that phone vendors make, versus changes made in the original
development of Android. By investigating the overlap of different changes, we
also determine the possibility of having automated support for merging them. We
develop a publicly available tool chain, based on a combination of existing
tools, to study such changes and their overlap. As a proxy case study, we
analyze the changes in the popular community-based variant of Android,
LineageOS, and its corresponding Android versions. We investigate and report
the common types of changes that occur in practice. Our findings show that 83%
of subsystems modified by LineageOS are also modified in the next release of
Android. By taking the nature of overlapping changes into account, we assess
the feasibility of having automated tool support to help phone vendors with the
Android update problem. Our results show that 56% of the changes in LineageOS
have the potential to be safely automated.
","[{'version': 'v1', 'created': 'Mon, 8 Jan 2018 23:12:52 GMT'}, {'version': 'v2', 'created': 'Sat, 17 Mar 2018 19:15:04 GMT'}, {'version': 'v3', 'created': 'Tue, 20 Mar 2018 17:28:10 GMT'}]",2019-03-18,"[['Mahmoudi', 'Mehran', ''], ['Nadi', 'Sarah', '']]","['Android', 'Software evolution', 'Software merging', 'Merge conflicts']"
2802,1607.01989,Erel Segal-Halevi,"Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann",Demand-Flow of Agents with Gross-Substitute Valuations,7 pages. Improved examples and added missing proofs,"Operations Research Letters 44 (2016), pp. 757-760",10.1016/j.orl.2016.09.012,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the class of valuations on indivisible items called
gross-substitute (GS). This class was introduced by Kelso and Crawford (1982)
and is widely used in studies of markets with indivisibilities. GS is a
condition on the demand-flow in a specific scenario: some items become more
expensive while other items retain their price. We prove that GS implies a much
stronger condition, describing the demand-flow in the general scenario in which
all prices may change. We prove that the demand of GS agents always flows
(weakly) downwards, i.e, from items with higher price-increase to items with
lower price-increase. We show that this property is equivalent to GS and is not
true when there are complementarities.
","[{'version': 'v1', 'created': 'Thu, 7 Jul 2016 12:33:22 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Aug 2016 04:55:01 GMT'}, {'version': 'v3', 'created': 'Sun, 2 Oct 2016 00:06:00 GMT'}]",2016-10-18,"[['Segal-Halevi', 'Erel', ''], ['Hassidim', 'Avinatan', ''], ['Aumann', 'Yonatan', '']]","['Gross Substitutes', 'Indivisible Items', 'Utility Functions', 'Demand']"
2803,1204.3850,Yann Disser,"J\'er\'emie Chalopin, Shantanu Das, Yann Disser, Mat\'u\v{s}
  Mihal\'ak, Peter Widmayer","Simple Agents Learn to Find Their Way: An Introduction on Mapping
  Polygons",,Discrete Applied Mathematics 161(10-11) (2013) 1287-1307,10.1016/j.dam.2013.01.006,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper gives an introduction to the problem of mapping simple polygons
with autonomous agents. We focus on minimalistic agents that move from vertex
to vertex along straight lines inside a polygon, using their sensors to gather
local observations at each vertex. Our attention revolves around the question
whether a given configuration of sensors and movement capabilities of the
agents allows them to capture enough data in order to draw conclusions
regarding the global layout of the polygon. In particular, we study the problem
of reconstructing the visibility graph of a simple polygon by an agent moving
either inside or on the boundary of the polygon. Our aim is to provide insight
about the algorithmic challenges faced by an agent trying to map a polygon. We
present an overview of techniques for solving this problem with agents that are
equipped with simple sensorial capabilities. We illustrate these techniques on
examples with sensors that mea- sure angles between lines of sight or identify
the previous location. We give an overview over related problems in
combinatorial geometry as well as graph exploration.
","[{'version': 'v1', 'created': 'Thu, 16 Feb 2012 11:17:25 GMT'}]",2018-12-10,"[['Chalopin', 'Jérémie', ''], ['Das', 'Shantanu', ''], ['Disser', 'Yann', ''], ['Mihalák', 'Matúš', ''], ['Widmayer', 'Peter', '']]","['polygon mapping', 'map construction', 'autonomous agent', 'mobilerobot', 'visibility graph reconstruction']"
2804,0903.3524,Jin-San Cheng,"Jin-San Cheng, Xiao-Shan Gao and Jia Li","Ambient Isotopic Meshing of Implicit Algebraic Surface with
  Singularities","34 pages, 17 Postscript figures",,10.1007/978-3-642-04103-7_9,"MM-preprints, vol. 27, 2008",cs.CG cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A complete method is proposed to compute a certified, or ambient isotopic,
meshing for an implicit algebraic surface with singularities. By certified, we
mean a meshing with correct topology and any given geometric precision. We
propose a symbolic-numeric method to compute a certified meshing for the
surface inside a box containing singularities and use a modified
Plantinga-Vegter marching cube method to compute a certified meshing for the
surface inside a box without singularities. Nontrivial examples are given to
show the effectiveness of the algorithm. To our knowledge, this is the first
method to compute a certified meshing for surfaces with singularities.
","[{'version': 'v1', 'created': 'Fri, 20 Mar 2009 13:53:35 GMT'}]",2015-05-13,"[['Cheng', 'Jin-San', ''], ['Gao', 'Xiao-Shan', ''], ['Li', 'Jia', '']]","['Surface', 'curve', 'topology', 'ambient isotopic meshing', 'marching cube', 'symbolic computation', 'interval arithmetic']"
2805,1405.1616,Conor Smyth,"Valerio Capraro, Conor Smyth, Kalliopi Mylona, Graham A. Niblo",Benevolent characteristics promote cooperative behaviour among humans,,,10.1371/journal.pone.0102881,,cs.GT q-bio.PE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cooperation is fundamental to the evolution of human society. We regularly
observe cooperative behaviour in everyday life and in controlled experiments
with anonymous people, even though standard economic models predict that they
should deviate from the collective interest and act so as to maximise their own
individual payoff. However, there is typically heterogeneity across subjects:
some may cooperate, while others may not. Since individual factors promoting
cooperation could be used by institutions to indirectly prime cooperation, this
heterogeneity raises the important question of who these cooperators are. We
have conducted a series of experiments to study whether benevolence, defined as
a unilateral act of paying a cost to increase the welfare of someone else
beyond one's own, is related to cooperation in a subsequent one-shot anonymous
Prisoner's dilemma. Contrary to the predictions of the widely used inequity
aversion models, we find that benevolence does exist and a large majority of
people behave this way. We also find benevolence to be correlated with
cooperative behaviour. Finally, we show a causal link between benevolence and
cooperation: priming people to think positively about benevolent behaviour
makes them significantly more cooperative than priming them to think
malevolently. Thus benevolent people exist and cooperate more.
","[{'version': 'v1', 'created': 'Wed, 7 May 2014 14:30:04 GMT'}, {'version': 'v2', 'created': 'Thu, 22 May 2014 17:02:41 GMT'}]",2015-06-19,"[['Capraro', 'Valerio', ''], ['Smyth', 'Conor', ''], ['Mylona', 'Kalliopi', ''], ['Niblo', 'Graham A.', '']]","['cooperation', 'prosocial behaviour', 'benevolence', 'altruism', 'inequity aversion']"
2806,2105.06160,Fang Tao Li,"Fangtao Li, Ting Bai, Chenyu Cao, Zihe Liu, Chenghao Yan, Bin Wu","Relation-aware Hierarchical Attention Framework for Video Question
  Answering","9 pages, This paper is accepted by ICMR 2021",,10.1145/3460426.3463635,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video Question Answering (VideoQA) is a challenging video understanding task
since it requires a deep understanding of both question and video. Previous
studies mainly focus on extracting sophisticated visual and language
embeddings, fusing them by delicate hand-crafted networks. However, the
relevance of different frames, objects, and modalities to the question are
varied along with the time, which is ignored in most of existing methods.
Lacking understanding of the the dynamic relationships and interactions among
objects brings a great challenge to VideoQA task. To address this problem, we
propose a novel Relation-aware Hierarchical Attention (RHA) framework to learn
both the static and dynamic relations of the objects in videos. In particular,
videos and questions are embedded by pre-trained models firstly to obtain the
visual and textual features. Then a graph-based relation encoder is utilized to
extract the static relationship between visual objects. To capture the dynamic
changes of multimodal objects in different video frames, we consider the
temporal, spatial, and semantic relations, and fuse the multimodal features by
hierarchical attention mechanism to predict the answer. We conduct extensive
experiments on a large scale VideoQA dataset, and the experimental results
demonstrate that our RHA outperforms the state-of-the-art methods.
","[{'version': 'v1', 'created': 'Thu, 13 May 2021 09:35:42 GMT'}, {'version': 'v2', 'created': 'Fri, 14 May 2021 02:34:56 GMT'}]",2021-05-17,"[['Li', 'Fangtao', ''], ['Bai', 'Ting', ''], ['Cao', 'Chenyu', ''], ['Liu', 'Zihe', ''], ['Yan', 'Chenghao', ''], ['Wu', 'Bin', '']]","['Video Question Answering', 'Hierarchical Attention', 'MultimodalFusion', 'Relation Understanding']"
2807,1405.4628,"Sinan G\""unt\""urk","Evan Chou, Sinan G\""unt\""urk","Distributed noise-shaping quantization: I. Beta duals of finite frames
  and near-optimal quantization of random measurements","19 pages, 2 figures",,10.1007/s00365-016-9344-4,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a new algorithm for the so-called ""Analysis Problem"" in
quantization of finite frame representations which provides a near-optimal
solution in the case of random measurements. The main contributions include the
development of a general quantization framework called distributed
noise-shaping, and in particular, beta duals of frames, as well as the
performance analysis of beta duals in both deterministic and probabilistic
settings. It is shown that for random frames, using beta duals results in
near-optimally accurate reconstructions with respect to both the frame
redundancy and the number of levels that the frame coefficients are quantized
at. More specifically, for any frame $E$ of $m$ vectors in $\mathbb{R}^k$
except possibly from a subset of Gaussian measure exponentially small in $m$
and for any number $L \geq 2$ of quantization levels per measurement to be used
to encode the unit ball in $\mathbb{R}^k$, there is an algorithmic quantization
scheme and a dual frame together which guarantee a reconstruction error of at
most $\sqrt{k}L^{-(1-\eta)m/k}$, where $\eta$ can be arbitrarily small for
sufficiently large problems. Additional features of the proposed algorithm
include low computational cost and parallel implementability.
","[{'version': 'v1', 'created': 'Mon, 19 May 2014 07:33:20 GMT'}, {'version': 'v2', 'created': 'Thu, 5 May 2016 21:18:45 GMT'}]",2016-05-09,"[['Chou', 'Evan', ''], ['Güntürk', 'Sinan', '']]","['Finite frames', 'quantization', 'random matrices', 'noise shaping', 'beta encoding']"
2808,1506.06378,Nate Foster,"Steffen Smolka, Spiridon Eliopoulos, Nate Foster, Arjun Guha",A Fast Compiler for NetKAT,,"ACM SIGPLAN Notices - ICFP '15, Volume 50 Issue 9, September 2015,
  Pages 328-341",10.1145/2784731.2784761,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  High-level programming languages play a key role in a growing number of
networking platforms, streamlining application development and enabling precise
formal reasoning about network behavior. Unfortunately, current compilers only
handle ""local"" programs that specify behavior in terms of hop-by-hop forwarding
behavior, or modest extensions such as simple paths. To encode richer ""global""
behaviors, programmers must add extra state -- something that is tricky to get
right and makes programs harder to write and maintain. Making matters worse,
existing compilers can take tens of minutes to generate the forwarding state
for the network, even on relatively small inputs. This forces programmers to
waste time working around performance issues or even revert to using
hardware-level APIs.
  This paper presents a new compiler for the NetKAT language that handles rich
features including regular paths and virtual networks, and yet is several
orders of magnitude faster than previous compilers. The compiler uses symbolic
automata to calculate the extra state needed to implement ""global"" programs,
and an intermediate representation based on binary decision diagrams to
dramatically improve performance. We describe the design and implementation of
three essential compiler stages: from virtual programs (which specify behavior
in terms of virtual topologies) to global programs (which specify network-wide
behavior in terms of physical topologies), from global programs to local
programs (which specify behavior in terms of single-switch behavior), and from
local programs to hardware-level forwarding tables. We present results from
experiments on real-world benchmarks that quantify performance in terms of
compilation time and forwarding table size.
","[{'version': 'v1', 'created': 'Sun, 21 Jun 2015 15:37:27 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Jun 2015 15:52:52 GMT'}]",2016-11-22,"[['Smolka', 'Steffen', ''], ['Eliopoulos', 'Spiridon', ''], ['Foster', 'Nate', ''], ['Guha', 'Arjun', '']]","['Software-defined networking', 'domain-specific languages', 'NetKAT', 'Frenetic', 'Kleene Algebra with tests', 'virtualization', 'binary decision diagrams']"
2809,1811.04155,Dae Hoon Park,Dae Hoon Park and Yi Chang,"Adversarial Sampling and Training for Semi-Supervised Information
  Retrieval",Published in WWW 2019,,10.1145/3308558.3313416,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ad-hoc retrieval models with implicit feedback often have problems, e.g., the
imbalanced classes in the data set. Too few clicked documents may hurt
generalization ability of the models, whereas too many non-clicked documents
may harm effectiveness of the models and efficiency of training. In addition,
recent neural network-based models are vulnerable to adversarial examples due
to the linear nature in them. To solve the problems at the same time, we
propose an adversarial sampling and training framework to learn ad-hoc
retrieval models with implicit feedback. Our key idea is (i) to augment clicked
examples by adversarial training for better generalization and (ii) to obtain
very informational non-clicked examples by adversarial sampling and training.
Experiments are performed on benchmark data sets for common ad-hoc retrieval
tasks such as Web search, item recommendation, and question answering.
Experimental results indicate that the proposed approaches significantly
outperform strong baselines especially for high-ranked documents, and they
outperform IRGAN in NDCG@5 using only 5% of labeled data for the Web search
task.
","[{'version': 'v1', 'created': 'Fri, 9 Nov 2018 22:57:18 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Oct 2019 01:18:34 GMT'}]",2019-10-21,"[['Park', 'Dae Hoon', ''], ['Chang', 'Yi', '']]","['ad-hoc retrieval', 'adversarial training', 'implicit feedback', 'adversarial sampling']"
2810,1601.07036,Katina Kralevska,"Katina Kralevska, Harald Oeverby and Danilo Gligoroski",Coded Packet Transport for Optical Packet/Burst Switched Networks,IEEE Globecom 2015,Published in 2015 IEEE Global Communications Conference (GLOBECOM),10.1109/GLOCOM.2015.7417372,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the Coded Packet Transport (CPT) scheme, a novel
transport mechanism for Optical Packet/Burst Switched (OPS/OBS) networks. The
CPT scheme exploits the combined benefits of source coding by erasure codes and
path diversity to provide efficient means for recovering from packet loss due
to contentions and path failures, and to provide non-cryptographic secrecy. In
the CPT scheme, erasure coding is employed at the OPS/OBS ingress node to form
coded packets, which are transmitted on disjoint paths from the ingress node to
an egress node in the network. The CPT scheme allows for a unified view of
Quality of Service (QoS) in OPS/OBS networks by linking the interactions
between survivability, performance and secrecy. We provide analytical models
that illustrate how QoS aspects of CPT are affected by the number of disjoint
paths, packet overhead and processing delay.
","[{'version': 'v1', 'created': 'Tue, 26 Jan 2016 14:13:15 GMT'}]",2020-02-14,"[['Kralevska', 'Katina', ''], ['Oeverby', 'Harald', ''], ['Gligoroski', 'Danilo', '']]","['optical packet/burst switching', 'source coding', 'survivability', 'secrecy', 'performance']"
2811,1907.09559,Giovanni Amendola,"Giovanni Amendola, Francesco Ricca, Mirek Truszczynski",Beyond NP: Quantifying over Answer Sets,"Paper presented at the 35th International Conference on Logic
  Programming (ICLP 2019), Las Cruces, New Mexico, USA, 20-25 September 2019,
  16 pages",Theory and Practice of Logic Programming 19 (2019) 705-721,10.1017/S1471068419000140,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Answer Set Programming (ASP) is a logic programming paradigm featuring a
purely declarative language with comparatively high modeling capabilities.
Indeed, ASP can model problems in NP in a compact and elegant way. However,
modeling problems beyond NP with ASP is known to be complicated, on the one
hand, and limited to problems in {\Sigma}^P_2 on the other. Inspired by the way
Quantified Boolean Formulas extend SAT formulas to model problems beyond NP, we
propose an extension of ASP that introduces quantifiers over stable models of
programs. We name the new language ASP with Quantifiers (ASP(Q)). In the paper
we identify computational properties of ASP(Q); we highlight its modeling
capabilities by reporting natural encodings of several complex problems with
applications in artificial intelligence and number theory; and we compare
ASP(Q) with related languages. Arguably, ASP(Q) allows one to model problems in
the Polynomial Hierarchy in a direct way, providing an elegant expansion of ASP
beyond the class NP. Under consideration for acceptance in TPLP.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2019 20:25:58 GMT'}]",2020-02-19,"[['Amendola', 'Giovanni', ''], ['Ricca', 'Francesco', ''], ['Truszczynski', 'Mirek', '']]","['ASP', 'Quantified Logics', 'Polynomial Hierarchy']"
2812,1312.2552,Carlos Olarte,"Moreno Falaschi, Carlos Olarte, Catuscia Palamidessi",Abstract Interpretation of Temporal Concurrent Constraint Programs,,Theory and Practice of Logic Programming 15 (2015) 312-357,10.1017/S1471068413000641,,cs.LO,http://creativecommons.org/licenses/by/3.0/,"  Timed Concurrent Constraint Programming (tcc) is a declarative model for
concurrency offering a logic for specifying reactive systems, i.e. systems that
continuously interact with the environment. The universal tcc formalism (utcc)
is an extension of tcc with the ability to express mobility. Here mobility is
understood as communication of private names as typically done for mobile
systems and security protocols. In this paper we consider the denotational
semantics for tcc, and we extend it to a ""collecting"" semantics for utcc based
on closure operators over sequences of constraints. Relying on this semantics,
we formalize a general framework for data flow analyses of tcc and utcc
programs by abstract interpretation techniques. The concrete and abstract
semantics we propose are compositional, thus allowing us to reduce the
complexity of data flow analyses. We show that our method is sound and
parametric with respect to the abstract domain. Thus, different analyses can be
performed by instantiating the framework. We illustrate how it is possible to
reuse abstract domains previously defined for logic programming to perform, for
instance, a groundness analysis for tcc programs. We show the applicability of
this analysis in the context of reactive systems. Furthermore, we make also use
of the abstract semantics to exhibit a secrecy flaw in a security protocol. We
also show how it is possible to make an analysis which may show that tcc
programs are suspension free. This can be useful for several purposes, such as
for optimizing compilation or for debugging.
","[{'version': 'v1', 'created': 'Mon, 9 Dec 2013 19:28:24 GMT'}]",2020-02-19,"[['Falaschi', 'Moreno', ''], ['Olarte', 'Carlos', ''], ['Palamidessi', 'Catuscia', '']]","['Timed Concurrent Constraint Programming', 'Process Calculi', 'Abstract Interpretation', 'Denotational Semantics', 'Reactive Systems']"
2813,2207.11602,Martin Ukrop,"Emma Riese, Madeleine Lor{\aa}s, Martin Ukrop, Tom\'a\v{s} Effenberger","Challenges Faced by Teaching Assistants in Computer Science Education
  Across Europe",,"ITiCSE '21: Proceedings of the 26th ACM Conference on Innovation
  and Technology in Computer Science Education, Vol. 1, June 2021, Pages
  547-553",10.1145/3430665.3456304,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Teaching assistants (TAs) are heavily used in computer science courses as a
way to handle high enrollment and still being able to offer students individual
tutoring and detailed assessments. TAs are themselves students who take on this
additional role in parallel with their own studies at the same institution.
Previous research has shown that being a TA can be challenging but has mainly
been conducted on TAs from a single institution or within a single course. This
paper offers a multi-institutional, multi-national perspective of challenges
that TAs in computer science face. This has been done by conducting a thematic
analysis of 180 reflective essays written by TAs from three institutions across
Europe. The thematic analysis resulted in five main challenges: becoming a
professional TA, student focused challenges, assessment, defining and using
best practice, and threats to best practice. In addition, these challenges were
all identified within the essays from all three institutions, indicating that
the identified challenges are not particularly context-dependent. Based on
these findings, we also outline implications for educators involved in TA
training and coordinators of computer science courses with TAs.
","[{'version': 'v1', 'created': 'Sat, 23 Jul 2022 21:04:29 GMT'}]",2022-07-26,"[['Riese', 'Emma', ''], ['Lorås', 'Madeleine', ''], ['Ukrop', 'Martin', ''], ['Effenberger', 'Tomáš', '']]","['Teaching assistants', 'TAs', 'challenges']"
2814,2207.08436,Stefano Zacchiroli,"Zeinab Abou Khalil (DGD-I, Inria), Stefano Zacchiroli (LTCI, IP Paris)","Software Artifact Mining in Software Engineering Conferences: A
  Meta-Analysis",,"ACM/IEEE International Symposium on Empirical Software Engineering
  and Measurement (ESEM 2022), Sep 2022, Helsinki, Finland",10.1145/3544902.3546239,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Software development results in the production of various types
of artifacts: source code, version control system metadata, bug reports,
mailing list conversations, test data, etc. Empirical software engineering
(ESE) has thrived mining those artifacts to uncover the inner workings of
software development and improve its practices. But which artifacts are studied
in the field is a moving target, which we study empirically in this paper.Aims:
We quantitatively characterize the most frequently mined and co-mined software
artifacts in ESE research and the research purposes they support.Method: We
conduct a meta-analysis of artifact mining studies published in 11 top
conferences in ESE, for a total of 9621 papers. We use natural language
processing (NLP) techniques to characterize the types of software artifacts
that are most often mined and their evolution over a 16-year period
(2004-2020). We analyze the combinations of artifact types that are most often
mined together, as well as the relationship between study purposes and mined
artifacts.Results: We find that: (1) mining happens in the vast majority of
analyzed papers, (2) source code and test data are the most mined artifacts,
(3) there is an increasing interest in mining novel artifacts, together with
source code, (4) researchers are most interested in the evaluation of software
systems and use all possible empirical signals to support that goal.
","[{'version': 'v1', 'created': 'Mon, 18 Jul 2022 08:41:52 GMT'}]",2022-07-19,"[['Khalil', 'Zeinab Abou', '', 'DGD-I, Inria'], ['Zacchiroli', 'Stefano', '', 'LTCI, IP Paris']]","['software artifacts', 'mining software repository', 'systematic mapping', 'meta-analysis', 'research trends', 'academic conferences']"
2815,1505.07804,Jose Rodrigues Jr,"Jose F. Rodrigues Jr, Agma J. M. Traina, Maria C. F. Oliveira and
  Caetano Traina Jr","The Spatial-Perceptual Design Space: a new comprehension for Data
  Visualization",,Information Visualization 6: 4. 261-279 (2007),10.1057/palgrave.ivs.9500161,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We revisit the design space of visualizations aiming at identifying and
relating its components. In this sense, we establish a model to examine the
process through which visualizations become expressive for users. This model
has leaded us to a taxonomy oriented to the human visual perception, a
conceptualization that provides natural criteria in order to delineate a novel
understanding for the visualization design space. The new organization of
concepts that we introduce is our main contribution: a grammar for the
visualization design based on the review of former works and of classical and
state-of-the-art techniques. Like so, the paper is presented as a survey whose
structure introduces a new conceptualization for the space of techniques
concerning visual analysis.
","[{'version': 'v1', 'created': 'Thu, 28 May 2015 19:14:44 GMT'}]",2015-05-29,"[['Rodrigues', 'Jose F.', 'Jr'], ['Traina', 'Agma J. M.', ''], ['Oliveira', 'Maria C. F.', ''], ['Traina', 'Caetano', 'Jr']]","['InformationVisualization', 'Taxonomy', 'Design Space', 'Visualization Model']"
2816,1808.08098,"Mika M\""antyl\""a","Mika M\""antyl\""a, Ma\""elick Claes, Umar Farooq",Measuring LDA Topic Stability from Clusters of Replicated Runs,"ESEM '18 ACM / IEEE International Symposium on Empirical Software
  Engineering and Measurement (ESEM)}{October 11--12, 2018}{Oulu, Finland}",,10.1145/3239235.3267435,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Unstructured and textual data is increasing rapidly and Latent
Dirichlet Allocation (LDA) topic modeling is a popular data analysis methods
for it. Past work suggests that instability of LDA topics may lead to
systematic errors. Aim: We propose a method that relies on replicated LDA runs,
clustering, and providing a stability metric for the topics. Method: We
generate k LDA topics and replicate this process n times resulting in n*k
topics. Then we use K-medioids to cluster the n*k topics to k clusters. The k
clusters now represent the original LDA topics and we present them like normal
LDA topics showing the ten most probable words. For the clusters, we try
multiple stability metrics, out of which we recommend Rank-Biased Overlap,
showing the stability of the topics inside the clusters. Results: We provide an
initial validation where our method is used for 270,000 Mozilla Firefox commit
messages with k=20 and n=20. We show how our topic stability metrics are
related to the contents of the topics. Conclusions: Advances in text mining
enable us to analyze large masses of text in software engineering but
non-deterministic algorithms, such as LDA, may lead to unreplicable
conclusions. Our approach makes LDA stability transparent and is also
complementary rather than alternative to many prior works that focus on LDA
parameter tuning.
","[{'version': 'v1', 'created': 'Fri, 24 Aug 2018 11:37:40 GMT'}]",2018-09-04,"[['Mäntylä', 'Mika', ''], ['Claes', 'Maëlick', ''], ['Farooq', 'Umar', '']]","['Latent Dirichlet Allocation', 'Replication', 'Stability', 'Similarity', 'Clustering', 'Commit messages', 'Rank-Biased Overlap']"
2817,1408.5490,Kieran Greer Dr,Kieran Greer,New Ideas for Brain Modelling 2,"This is an extended version of arXiv:1403.6274, with a different
  conclusions section as well","K. Arai et al. (eds.), Intelligent Systems in Science and
  Information 2014, Studies in Computational Intelligence, Vol. 591, pp. 23 -
  39, Springer International Publishing Switzerland, 2015",10.1007/978-3-319-14654-6_2,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a relatively simple way of allowing a brain model to
self-organise its concept patterns through nested structures. For a simulation,
time reduction is helpful and it would be able to show how patterns may form
and then fire in sequence, as part of a search or thought process. It uses a
very simple equation to show how the inhibitors in particular, can switch off
certain areas, to allow other areas to become the prominent ones and thereby
define the current brain state. This allows for a small amount of control over
what appears to be a chaotic structure inside of the brain. It is attractive
because it is still mostly mechanical and therefore can be added as an
automatic process, or the modelling of that. The paper also describes how the
nested pattern structure can be used as a basic counting mechanism. Another
mathematical conclusion provides a basis for maintaining memory or concept
patterns. The self-organisation can space itself through automatic processes.
This might allow new neurons to be added in a more even manner and could help
to maintain the concept integrity. The process might also help with finding
memory structures afterwards. This extended version integrates further with the
existing cognitive model and provides some new conclusions.
","[{'version': 'v1', 'created': 'Sat, 23 Aug 2014 11:05:00 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Sep 2014 19:45:56 GMT'}]",2015-03-17,"[['Greer', 'Kieran', '']]","['neural modelling', 'self-organise', 'connection strengths', 'mathematical process']"
2818,1705.05420,Zhe Yu,Zhe Yu and Tim Menzies,FAST$^2$: an Intelligent Assistant for Finding Relevant Papers,"20+3 pages, 6 figures, 5 tables, and 4 algorithms. Accepted by
  Journal of Expert Systems with Applications",,10.1016/j.eswa.2018.11.021,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Literature reviews are essential for any researcher trying to keep up to date
with the burgeoning software engineering literature. FAST$^2$ is a novel tool
for reducing the effort required for conducting literature reviews by assisting
the researchers to find the next promising paper to read (among a set of unread
papers). This paper describes FAST$^2$ and tests it on four large software
engineering literature reviews conducted by Wahono (2015), Hall (2012),
Radjenovi\'c (2013) and Kitchenham (2017). We find that FAST$^2$ is a faster
and robust tool to assist researcher finding relevant SE papers which can
compensate for the errors made by humans during the review process. The
effectiveness of FAST$^2$ can be attributed to three key innovations: (1) a
novel way of applying external domain knowledge (a simple two or three keyword
search) to guide the initial selection of papers---which helps to find relevant
research papers faster with less variances; (2) an estimator of the number of
remaining relevant papers yet to be found---which in practical settings can be
used to decide if the reviewing process needs to be terminated; (3) a novel
self-correcting classification algorithm---automatically corrects itself, in
cases where the researcher wrongly classifies a paper.
","[{'version': 'v1', 'created': 'Mon, 15 May 2017 19:25:41 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Aug 2017 23:54:31 GMT'}, {'version': 'v3', 'created': 'Sat, 20 Jan 2018 22:29:28 GMT'}, {'version': 'v4', 'created': 'Tue, 27 Feb 2018 14:43:19 GMT'}, {'version': 'v5', 'created': 'Thu, 19 Jul 2018 02:04:21 GMT'}, {'version': 'v6', 'created': 'Sun, 11 Nov 2018 15:57:21 GMT'}]",2018-11-16,"[['Yu', 'Zhe', ''], ['Menzies', 'Tim', '']]","['Active learning', 'literature reviews', 'text mining', 'semi-supervised learning', 'relevance feedback', 'selectionprocess']"
2819,1608.08691,Muhammad Ali Raza Anjum,Muhammad Ali Raza Anjum,One-Minute Derivation of The Conjugate Gradient Algorithm,,"Journal of Telematics and Informatics, Vol 4, No 1 (2016): March
  2016",10.12928/jti.v4i1,,cs.DS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the great triumphs in the history of numerical methods was the
discovery of the Conjugate Gradient (CG) algorithm. It could solve a symmetric
positive-definite system of linear equations of dimension N in exactly N steps.
As many practical problems at that time belonged to this category, CG algorithm
became rapidly popular. It remains popular even today due to its immense
computational power. But despite its amazing computational ability, mathematics
of this algorithm is not easy to learn. Lengthy derivations, redundant
notations, and over-emphasis on formal presentation make it much difficult for
a beginner to master this algorithm. This paper aims to serve as a starting
point for such readers. It provides a curt, easy-to-follow but minimalist
derivation of the algorithm by keeping the sufficient steps only, maintaining a
uniform notation, and focusing entirely on the ease of reader.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2016 00:06:31 GMT'}]",2016-09-01,"[['Anjum', 'Muhammad Ali Raza', '']]","['Conjugate Gradient', 'Algorithm', 'Optimization     1']"
2820,1903.00562,Shubhra Kanti Karmaker Santu,"Shubhra Kanti Karmaker Santu, Liangda Li, Yi Chang, ChengXiang Zhai",JIM: Joint Influence Modeling for Collective Search Behavior,,,10.1145/3269206.3271681,,cs.LG cs.IR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Previous work has shown that popular trending events are important external
factors which pose significant influence on user search behavior and also
provided a way to computationally model this influence. However, their problem
formulation was based on the strong assumption that each event poses its
influence independently. This assumption is unrealistic as there are many
correlated events in the real world which influence each other and thus, would
pose a joint influence on the user search behavior rather than posing influence
independently. In this paper, we study this novel problem of Modeling the Joint
Influences posed by multiple correlated events on user search behavior. We
propose a Joint Influence Model based on the Multivariate Hawkes Process which
captures the inter-dependency among multiple events in terms of their influence
upon user search behavior. We evaluate the proposed Joint Influence Model using
two months query-log data from https://search.yahoo.com/. Experimental results
show that the model can indeed capture the temporal dynamics of the joint
influence over time and also achieves superior performance over different
baseline methods when applied to solve various interesting prediction problems
as well as real-word application scenarios, e.g., query auto-completion.
","[{'version': 'v1', 'created': 'Fri, 1 Mar 2019 22:20:47 GMT'}]",2019-03-05,"[['Santu', 'Shubhra Kanti Karmaker', ''], ['Li', 'Liangda', ''], ['Chang', 'Yi', ''], ['Zhai', 'ChengXiang', '']]","['User Search Behavior', 'Joint Influence Model', 'Multivariate HawkesProcess', 'Query Log Analysis', 'Influential Event Identification']"
2821,1012.3697,Daniel Kuntze,"Marcel R. Ackermann, Johannes Bl\""omer, Daniel Kuntze and Christian
  Sohler",Analysis of Agglomerative Clustering,"A preliminary version of this article appeared in Proceedings of the
  28th International Symposium on Theoretical Aspects of Computer Science
  (STACS '11), March 2011, pp. 308-319. This article also appeared in
  Algorithmica. The final publication is available at
  http://link.springer.com/article/10.1007/s00453-012-9717-4","Ackermann, M. R., Bl\""omer, J., Kuntze, D., and Sohler, C. (2014).
  Analysis of Agglomerative Clustering. Algorithmica, 69(1):184-215",10.1007/s00453-012-9717-4,,cs.DS cs.CG cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The diameter $k$-clustering problem is the problem of partitioning a finite
subset of $\mathbb{R}^d$ into $k$ subsets called clusters such that the maximum
diameter of the clusters is minimized. One early clustering algorithm that
computes a hierarchy of approximate solutions to this problem (for all values
of $k$) is the agglomerative clustering algorithm with the complete linkage
strategy. For decades, this algorithm has been widely used by practitioners.
However, it is not well studied theoretically. In this paper, we analyze the
agglomerative complete linkage clustering algorithm. Assuming that the
dimension $d$ is a constant, we show that for any $k$ the solution computed by
this algorithm is an $O(\log k)$-approximation to the diameter $k$-clustering
problem. Our analysis does not only hold for the Euclidean distance but for any
metric that is based on a norm. Furthermore, we analyze the closely related
$k$-center and discrete $k$-center problem. For the corresponding agglomerative
algorithms, we deduce an approximation factor of $O(\log k)$ as well.
","[{'version': 'v1', 'created': 'Thu, 16 Dec 2010 17:46:07 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Apr 2012 09:56:24 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Oct 2012 12:55:49 GMT'}, {'version': 'v4', 'created': 'Fri, 7 Mar 2014 19:37:47 GMT'}]",2014-03-10,"[['Ackermann', 'Marcel R.', ''], ['Blömer', 'Johannes', ''], ['Kuntze', 'Daniel', ''], ['Sohler', 'Christian', '']]","['agglomerative clustering', 'hierarchical clustering', 'complete linkage', 'approximation guarantees']"
2822,1403.3969,Bernhard von Stengel,"Rahul Savani, Bernhard von Stengel",Game Theory Explorer - Software for the Applied Game Theorist,,"Computational Management Science 12:1, 5-33 (2015)",10.1007/s10287-014-0206-x,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the ""Game Theory Explorer"" software tool to create and
analyze games as models of strategic interaction. A game in extensive or
strategic form is created and nicely displayed with a graphical user interface
in a web browser. State-of-the-art algorithms then compute all Nash equilibria
of the game after a mouseclick. In tutorial fashion, we present how the program
is used, and the ideas behind its main algorithms. We report on experiences
with the architecture of the software and its development as an open-source
project.
","[{'version': 'v1', 'created': 'Sun, 16 Mar 2014 22:28:32 GMT'}]",2015-01-07,"[['Savani', 'Rahul', ''], ['von Stengel', 'Bernhard', '']]","['Game theory', 'Nash equilibrium', 'scientific software']"
2823,1309.4396,Panagiotis Bouros Panagiotis Bouros,"Dimitris Sacharidis, Panagiotis Bouros",Routing Directions: Keeping it Fast and Simple,Full version of the SIGSPATIAL'13 paper,"21st ACM SIGSPATIAL International Conference on Advances in
  Geographic Information Systems (ACM SIGSPATIAL GIS 2013), Orlando, Florida,
  USA, November 5-8, 2013",10.1145/2525314.2525362,,cs.DS cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of providing meaningful routing directions over road networks is
of great importance. In many real-life cases, the fastest route may not be the
ideal choice for providing directions in written, spoken text, or for an
unfamiliar neighborhood, or in cases of emergency. Rather, it is often more
preferable to offer ""simple"" directions that are easy to memorize, explain,
understand or follow. However, there exist cases where the simplest route is
considerably longer than the fastest. This paper tries to address this issue,
by finding near-simplest routes which are as short as possible and near-fastest
routes which are as simple as possible. Particularly, we focus on efficiency,
and propose novel algorithms, which are theoretically and experimentally shown
to be significantly faster than existing approaches.
","[{'version': 'v1', 'created': 'Tue, 17 Sep 2013 17:14:49 GMT'}]",2013-09-18,"[['Sacharidis', 'Dimitris', ''], ['Bouros', 'Panagiotis', '']]","['shortest path', 'turn cost', 'near-shortest path']"
2824,1904.03992,Yung-Ting Lee,Yung-Ting Lee and Taisuke Ozaki,"OpenMX Viewer: A web-based crystalline and molecular graphical user
  interface program","16 pages, 4 figures","J. Mol. Graph. Model. 89, 192-198 (2019)",10.1016/j.jmgm.2019.03.013,,cs.HC cond-mat.mtrl-sci,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The OpenMX Viewer (Open source package for Material eXplorer Viewer) is a
web-based graphical user interface (GUI) program for visualization and analysis
of crystalline and molecular structures and 3D grid data in the Gaussian cube
format such as electron density and molecular orbitals. The web-based GUI
program enables us to quickly visualize crystalline and molecular structures by
dragging and dropping XYZ, CIF, or OpenMX input/output files, and analyze
static/dynamic structural properties conveniently in a web browser. Several
basic functionalities such as analysis of Mulliken charges, molecular dynamics,
geometry optimization and band structure are included. In addition, based on
marching cubes, marching tetrahedra and surface nets algorithms with Affine
transformation, 3D isosurface techniques are supported to visualize electron
density and molecular/crystalline orbitals in the cube format with
superposition of a crystalline or molecular structure. Furthermore, the Band
Structure Viewer is implemented for showing a band structure in a web browser.
By accessing the website of the OpenMX Viewer, the latest OpenMX Viewer is
always available for users to visualize various structures and analyze their
properties without installations, upgrades, updates, registration, sign-in and
terminal commands.
","[{'version': 'v1', 'created': 'Tue, 26 Mar 2019 06:48:00 GMT'}]",2019-04-09,"[['Lee', 'Yung-Ting', ''], ['Ozaki', 'Taisuke', '']]","['OpenMX', 'viewer', 'isosurface', 'HTML5', 'WebGL']"
2825,1405.6169,Takeshi Takahashi,Takeshi Takahashi and Youki Kadobayashi and Hiroyuki Fujiwara,Ontological Approach toward Cybersecurity in Cloud Computing,"This is a preprint version of our paper presented in SIN'10, Sept.
  7-11, 2010, Taganrog, Rostov Oblast, Russia, International Conference on
  Security of Information and Networks, 2010",,10.1145/1854099.1854121,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Widespread deployment of the Internet enabled building of an emerging IT
delivery model, i.e., cloud computing. Albeit cloud computing-based services
have rapidly developed, their security aspects are still at the initial stage
of development. In order to preserve cybersecurity in cloud computing,
cybersecurity information that will be exchanged within it needs to be
identified and discussed. For this purpose, we propose an ontological approach
to cybersecurity in cloud computing. We build an ontology for cybersecurity
operational information based on actual cybersecurity operations mainly focused
on non-cloud computing. In order to discuss necessary cybersecurity information
in cloud computing, we apply the ontology to cloud computing. Through the
discussion, we identify essential changes in cloud computing such as data-asset
decoupling and clarify the cybersecurity information required by the changes
such as data provenance and resource dependency information.
","[{'version': 'v1', 'created': 'Tue, 1 Apr 2014 08:10:42 GMT'}]",2014-05-26,"[['Takahashi', 'Takeshi', ''], ['Kadobayashi', 'Youki', ''], ['Fujiwara', 'Hiroyuki', '']]","['cybersecurity', 'cloud computing', 'ontology', 'information exchange']"
2826,1403.7311,Akbar Khan,"Akbar Khan, Pratap Reddy L","Performance Evaluation of Raster Based Shape Vectors in Object
  Recognition","11pages,12 figures","International Journal of Engineering Trends and Technology
  (IJETT), V9(8),378-388 March 2014. ISSN:2231-5381. www.ijettjournal.org.
  published by seventh sense research group",10.14445/22315381/IJETT-V9P274,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Object recognition is still an impediment in the field of computer vision and
multimedia retrieval.Defining an object model is a critical task. Shape
information of an object play a critical role in the process of object
recognition. Extraction of boundary information of an object from the
multimedia data and classifying this information with associated objects is the
primary step towards object recognition. Rasters play an important role while
computing object boundary. The trade-off lies with the dimensionality of the
object versus computational cost while achieving maximum efficiency. In this
treatise an attempt is made to evaluate the performance of circular and spiral
raster models in terms of average retrieval efficiency and computational cost.
","[{'version': 'v1', 'created': 'Fri, 28 Mar 2014 09:18:17 GMT'}]",2014-03-31,"[['Khan', 'Akbar', ''], ['L', 'Pratap Reddy', '']]","['Object recognition', 'shape vectors', 'spiral raster', 'retrieval efficiency', 'computational time', 'computer vision']"
2827,1901.07363,Miroslav Kulich,"Jakub Hv\v{e}zda, Miroslav Kulich, Libor P\v{r}eu\v{c}il",Improved Discrete RRT for Coordinated Multi-robot Planning,,"Proceedings of the 15th International Conference on Informatics in
  Control, Automation and Robotics (ICINCO 2018)",10.5220/0006865901810189,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the problem of coordination of a fleet of mobile robots
- the problem of finding an optimal set of collision-free trajectories for
individual robots in the fleet. Many approaches have been introduced during the
last decades, but a minority of them is practically applicable, i.e. fast,
producing near-optimal solutions, and complete. We propose a novel
probabilistic approach based on the Rapidly Exploring Random Tree algorithm
(RRT) by significantly improving its multi-robot variant for discrete
environments. The presented experimental results show that the proposed
approach is fast enough to solve problems with tens of robots in seconds.
Although the solutions generated by the approach are slightly worse than one of
the best state-of-the-art algorithms presented in (ter Mors et al., 2010), it
solves problems where ter Mors's algorithm fails.
","[{'version': 'v1', 'created': 'Tue, 22 Jan 2019 14:51:12 GMT'}]",2019-01-23,"[['Hvězda', 'Jakub', ''], ['Kulich', 'Miroslav', ''], ['Přeučil', 'Libor', '']]","['Multi-robot systems', 'Trajectory Planning', 'Coordination', 'Rapidly-Exploring Random Tree']"
2828,1406.0032,Pollyanna Gon\c{c}alves,"Pollyanna Gon\c{c}alves and Matheus Ara\'ujo and Fabr\'icio Benevenuto
  and Meeyoung Cha",Comparing and Combining Sentiment Analysis Methods,"Proceedings of the first ACM conference on Online social networks
  (2013) 27-38",,10.1145/2512938.2512951,,cs.CL,http://creativecommons.org/licenses/by/3.0/,"  Several messages express opinions about events, products, and services,
political views or even their author's emotional state and mood. Sentiment
analysis has been used in several applications including analysis of the
repercussions of events in social networks, analysis of opinions about products
and services, and simply to better understand aspects of social communication
in Online Social Networks (OSNs). There are multiple methods for measuring
sentiments, including lexical-based approaches and supervised machine learning
methods. Despite the wide use and popularity of some methods, it is unclear
which method is better for identifying the polarity (i.e., positive or
negative) of a message as the current literature does not provide a method of
comparison among existing methods. Such a comparison is crucial for
understanding the potential limitations, advantages, and disadvantages of
popular methods in analyzing the content of OSNs messages. Our study aims at
filling this gap by presenting comparisons of eight popular sentiment analysis
methods in terms of coverage (i.e., the fraction of messages whose sentiment is
identified) and agreement (i.e., the fraction of identified sentiments that are
in tune with ground truth). We develop a new method that combines existing
approaches, providing the best coverage results and competitive agreement. We
also present a free Web service called iFeel, which provides an open API for
accessing and comparing results across different sentiment methods for a given
text.
","[{'version': 'v1', 'created': 'Fri, 30 May 2014 22:47:49 GMT'}]",2014-06-03,"[['Gonçalves', 'Pollyanna', ''], ['Araújo', 'Matheus', ''], ['Benevenuto', 'Fabrício', ''], ['Cha', 'Meeyoung', '']]","['Sentiment analysis', 'social networks', 'public mood']"
2829,1809.08220,Julliano Rosa Nascimento,"Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R.
  Nascimento",A note on the convexity number for complementary prisms,"10 pages, 2 figures","Discrete Mathematics & Theoretical Computer Science, vol. 21 no.
  4, Graph Theory (July 30, 2019) dmtcs:5629",10.23638/DMTCS-21-4-4,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the geodetic convexity, a set of vertices $S$ of a graph $G$ is
$\textit{convex}$ if all vertices belonging to any shortest path between two
vertices of $S$ lie in $S$. The cardinality $con(G)$ of a maximum proper convex
set $S$ of $G$ is the $\textit{convexity number}$ of $G$. The
$\textit{complementary prism}$ $G\overline{G}$ of a graph $G$ arises from the
disjoint union of the graph $G$ and $\overline{G}$ by adding the edges of a
perfect matching between the corresponding vertices of $G$ and $\overline{G}$.
In this work, we we prove that the decision problem related to the convexity
number is NP-complete even restricted to complementary prisms, we determine
$con(G\overline{G})$ when $G$ is disconnected or $G$ is a cograph, and we
present a lower bound when $diam(G) \neq 3$.
","[{'version': 'v1', 'created': 'Fri, 21 Sep 2018 17:30:01 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Jul 2019 23:14:46 GMT'}, {'version': 'v3', 'created': 'Sat, 13 Jul 2019 16:16:31 GMT'}]",2020-02-19,"[['Castonguay', 'Diane', ''], ['Coelho', 'Erika M. M.', ''], ['Coelho', 'Hebert', ''], ['Nascimento', 'Julliano R.', '']]","['geodetic convexity', 'convex set', 'convexity number', 'complementary prism']"
2830,2102.12563,Stephen MacDonell,Sherlock A. Licorish and Stephen G. MacDonell,Communication and Personality Profiles of Global Software Developers,"Journal Paper, 22 pages, 5 figures, 6 tables, 1 appendix. arXiv admin
  note: substantial text overlap with arXiv:2102.09732","Information and Software Technology 64 (2015), pp.113-131",10.1016/j.infsof.2015.02.004,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Prior research has established that a small proportion of
individuals dominate team communication during global software development. It
is not known, however, how these members' contributions affect their teams'
knowledge diffusion process, or whether their personality profiles are
responsible for their dominant presence. Objective: We set out to address this
gap through the study of repository artifacts. Method: Artifacts from ten teams
were mined from the IBM Rational Jazz repository. We employed social network
analysis (SNA) to group practitioners into two clusters, Top Members and
Others, based on the numbers of messages they communicated and their engagement
in task changes. SNA metrics (density, in-degree and closeness) were then used
to study practitioners' importance in knowledge diffusion. Thereafter, we
performed psycholinguistic analysis on practitioners' messages using linguistic
dimensions that had been previously correlated with the Big Five personality
profiles. Results: For our sample of 146 practitioners we found that Top
Members occupied critical roles in knowledge diffusion, and demonstrated more
openness to experience than the Others. Additionally, all personality profiles
were represented during teamwork, although openness to experience,
agreeableness and extroversion were particularly evident. However, no specific
personality predicted members' involvement in knowledge diffusion. Conclusion:
Task assignment that promotes highly connected team communication networks may
mitigate tacit knowledge loss in global software teams. Additionally, while
members expressing openness to experience are likely to be particularly driven
to perform, this is not entirely responsible for a global team's success.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2021 21:20:17 GMT'}]",2021-02-26,"[['Licorish', 'Sherlock A.', ''], ['MacDonell', 'Stephen G.', '']]","['Human factors', 'Communication', 'Personality', 'SNA', 'Data Mining', 'Psycholinguistics']"
2831,1003.1168,Jianfeng Zhan,"Lei Wang, Jianfeng Zhan, Weisong Shi, Yi Liang, Lin Yuan","In Cloud, Do MTC or HTC Service Providers Benefit from the Economies of
  Scale?",,"Proceedings of 2nd Workshop on Many-Task Computing on Grids and
  Supercomputers, Co-located with ACM/IEEE SC 2009",10.1145/1646468.1646475,,cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we intend to answer one key question to the success of cloud
computing: in cloud, do many task computing (MTC) or high throughput computing
(HTC) service providers, which offer the corresponding computing service to end
users, benefit from the economies of scale? Our research contributions are
three-fold: first, we propose an innovative usage model, called dynamic service
provision (DSP) model, for MTC or HTC service providers. In the DSP model, the
resource provider provides the service of creating and managing runtime
environments for MTC or HTC service providers, and consolidates heterogeneous
MTC or HTC workloads on the cloud platform; second, according to the DSP model,
we design and implement DawningCloud, which provides automatic management for
heterogeneous workloads; third, a comprehensive evaluation of DawningCloud has
been performed in an emulatation experiment. We found that for typical
workloads, in comparison with the previous two cloud solutions, DawningCloud
saves the resource consumption maximally by 46.4% (HTC) and 74.9% (MTC) for the
service providers, and saves the total resource consumption maximally by 29.7%
for the resource provider. At the same time, comparing with the traditional
solution that provides MTC or HTC services with dedicated systems, DawningCloud
is more cost-effective. To this end, we conclude that for typical MTC and HTC
workloads, on the cloud platform, MTC and HTC service providers and the
resource provider can benefit from the economies of scale.
","[{'version': 'v1', 'created': 'Fri, 5 Mar 2010 00:10:19 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Apr 2010 08:09:42 GMT'}, {'version': 'v3', 'created': 'Mon, 21 Jun 2010 05:50:25 GMT'}]",2016-11-18,"[['Wang', 'Lei', ''], ['Zhan', 'Jianfeng', ''], ['Shi', 'Weisong', ''], ['Liang', 'Yi', ''], ['Yuan', 'Lin', '']]","['many task computing', 'high throughput computing', 'cloud computing', 'service providers', 'economies of scale']"
2832,1901.10143,Wolfgang Fuhl,"Wolfgang Fuhl, Enkelejda Kasneci",Learning to Validate the Quality of Detected Landmarks,Will be published in the proceedings of the ICMV 2019 conference,,10.1117/12.2559517,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new loss function for the validation of image landmarks detected
via Convolutional Neural Networks (CNN). The network learns to estimate how
accurate its landmark estimation is. This loss function is applicable to all
regression-based location estimations and allows the exclusion of unreliable
landmarks from further processing. In addition, we formulate a novel batch
balancing approach which weights the importance of samples based on their
produced loss. This is done by computing a probability distribution mapping on
an interval from which samples can be selected using a uniform random selection
scheme. We conducted experiments on the 300W, AFLW, and WFLW facial landmark
datasets. In the first experiments, the influence of our batch balancing
approach is evaluated by comparing it against uniform sampling. In addition, we
evaluated the impact of the validation loss on the landmark accuracy based on
uniform sampling. The last experiments evaluate the correlation of the
validation signal with the landmark accuracy. All experiments were performed
for all three datasets.
","[{'version': 'v1', 'created': 'Tue, 29 Jan 2019 07:19:44 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Jan 2019 08:45:56 GMT'}, {'version': 'v3', 'created': 'Tue, 11 Feb 2020 06:49:47 GMT'}]",2020-05-01,"[['Fuhl', 'Wolfgang', ''], ['Kasneci', 'Enkelejda', '']]","['landmark detection', 'landmark validation', 'deep learning', 'batch creation']"
2833,1609.06826,Kar Wai Lim,"Kar Wai Lim, Wray Buntine",Bibliographic Analysis with the Citation Network Topic Model,"A copy of ACML paper. arXiv admin note: substantial text overlap with
  arXiv:1609.06532","Proceedings of the Sixth Asian Conference on Machine Learning
  (ACML), pp. 142-158. JMLR. 2014",,,cs.DL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bibliographic analysis considers author's research areas, the citation
network and paper content among other things. In this paper, we combine these
three in a topic model that produces a bibliographic model of authors, topics
and documents using a non-parametric extension of a combination of the Poisson
mixed-topic link model and the author-topic model. We propose a novel and
efficient inference algorithm for the model to explore subsets of research
publications from CiteSeerX. Our model demonstrates improved performance in
both model fitting and a clustering task compared to several baselines.
","[{'version': 'v1', 'created': 'Thu, 22 Sep 2016 05:46:46 GMT'}]",2016-09-23,"[['Lim', 'Kar Wai', ''], ['Buntine', 'Wray', '']]","['author-citation network', 'topic model', 'Bayesian non-parametric']"
2834,1612.04600,Joerg Evermann,"Joerg Evermann, Jana-Rebecca Rehse, Peter Fettke",Predicting Process Behaviour using Deep Learning,"34 pages, 10 figures",,10.1016/j.dss.2017.04.003,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predicting business process behaviour is an important aspect of business
process management. Motivated by research in natural language processing, this
paper describes an application of deep learning with recurrent neural networks
to the problem of predicting the next event in a business process. This is both
a novel method in process prediction, which has largely relied on explicit
process models, and also a novel application of deep learning methods. The
approach is evaluated on two real datasets and our results surpass the
state-of-the-art in prediction precision.
","[{'version': 'v1', 'created': 'Wed, 14 Dec 2016 12:33:28 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Mar 2017 17:22:08 GMT'}]",2017-05-05,"[['Evermann', 'Joerg', ''], ['Rehse', 'Jana-Rebecca', ''], ['Fettke', 'Peter', '']]","['Process management', 'Runtime support', 'Process prediction', 'Deep']"
2835,2102.07731,Johannes Sedlmeir,"Tobias Guggenberger and Johannes Sedlmeir and Gilbert Fridgen and
  Andr\'e Luckow","An In-Depth Investigation of the Performance Characteristics of
  Hyperledger Fabric",,"Computers & Industrial Engineering (2022), Volume 173, 108716",10.1016/j.cie.2022.108716,,cs.PF cs.CR cs.DB cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Private permissioned blockchains are deployed in ever greater numbers to
facilitate cross-organizational processes in various industries, particularly
in supply chain management. One popular example of this trend is Hyperledger
Fabric. Compared to public permissionless blockchains, it promises improved
performance and provides certain features that address key requirements of
enterprises. However, also permissioned blockchains are still not as scalable
as centralized systems, and due to the scarcity of theoretical results and
empirical data, their real-world performance cannot be predicted with the
necessary precision. We intend to address this issue by conducting an in-depth
performance analysis of Hyperledger Fabric. The paper presents a detailed
compilation of various performance characteristics using an enhanced version of
the Distributed Ledger Performance Scan (DLPS). Researchers and practitioners
alike can use the various performance properties identified and discussed as
guidelines to better configure and implement their Hyperledger Fabric network.
Likewise, they are encouraged to use the DLPS framework to conduct their
measurements.
","[{'version': 'v1', 'created': 'Mon, 15 Feb 2021 18:30:43 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Jan 2023 21:46:00 GMT'}]",2023-01-05,"[['Guggenberger', 'Tobias', ''], ['Sedlmeir', 'Johannes', ''], ['Fridgen', 'Gilbert', ''], ['Luckow', 'André', '']]","['Benchmarking', 'Blockchain', 'Distributed ledger', 'Scalability', 'Supply']"
2836,1912.00877,Rui Lebre,"Rui Lebre, Eduardo Pinho, Jorge Miguel Silva and Carlos Costa",Dicoogle Framework for Medical Imaging Teaching and Research,"Keywords: Dicoogle, PACS, Medical Imaging, DICOM, Teaching, Learning
  pack",,10.1109/ISCC50000.2020.9219545,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the most noticeable trends in healthcare over the last years is the
continuous growth of data volume produced and its heterogeneity. In the medical
imaging field, the evolution of digital systems is supported by the PACS
concept and the DICOM standard. These technologies are deeply grounded in
medical laboratories, supporting the production and providing healthcare
practitioners with the ability to set up collaborative work environments with
researchers and academia to study and improve healthcare practice. However, the
complexity of those systems and protocols makes difficult and time-consuming to
prototype new ideas or develop applied research, even for skilled users with
training in those environments. Dicoogle emerges as a reference tool to achieve
those objectives through a set of resources aggregated in the form of a
learning pack. It is an open-source PACS archive that, on the one hand,
provides a comprehensive view of the PACS and DICOM technologies and, on the
other hand, provides the user with tools to easily expand its core
functionalities. This paper describes the Dicoogle framework, with particular
emphasis in its Learning Pack package, the resources available and the impact
of the platform in research and academia. It starts by presenting an overview
of its architectural concept, the most recent research backed up by Dicoogle,
some remarks obtained from its use in teaching, and worldwide usage statistics
of the software. Moreover, a comparison between the Dicoogle platform and the
most popular open-source PACS in the market is presented.
","[{'version': 'v1', 'created': 'Mon, 2 Dec 2019 15:56:37 GMT'}]",2021-01-05,"[['Lebre', 'Rui', ''], ['Pinho', 'Eduardo', ''], ['Silva', 'Jorge Miguel', ''], ['Costa', 'Carlos', '']]","['Dicoogle', 'PACS', 'Medical Imaging', 'DICOM', 'Teaching', 'Learning pack']"
2837,1901.08344,Mamoona Asghar Dr.,"Amna Shifa, Mamoona Naveed Asghar, Naila Batool, Martin Fluery",Efficient Lightweight Encryption Algorithm for Smart Video Applications,FIT-2018 Conference Paper,,10.1109/FIT.2018.00032,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The future generation networks: Internet of things (IoT), in combination with
the advanced computer vision techniques poses new challenges for securing
videos for end-users. The visual devices generally have constrained resources
in respects to their low computation power, small memory with limited power
supply. Therefore, to facilitate the video security in smart environment,
lightweight security schemes are required instead of inefficient existing
traditional cryptography algorithms. This research paper provides the solution
to overcome such problems. A novel lightweight cipher algorithm is proposed
here which targets multimedia in IoT with an in-house name EXPer i.e. Extended
permutation with eXclusive OR (XOR). EXPer is a symmetric stream cipher that
consists of simple XOR and left shift operations with three keys of 128 bits.
The proposed cipher algorithm has been tested on various sample videos.
Comparison of proposed algorithm has been made with the traditional cipher
algorithms XOR and Advanced Encryption Standard (AES). Visual results confirm
that EXPer provides security level equivalent to the AES algorithm with less
computational cost than AES. Therefore, it can easily be perceived that the
EXPer is a better replacement of AES for securing real-time video applications
in IoT.
","[{'version': 'v1', 'created': 'Thu, 24 Jan 2019 10:53:44 GMT'}]",2019-01-25,"[['Shifa', 'Amna', ''], ['Asghar', 'Mamoona Naveed', ''], ['Batool', 'Naila', ''], ['Fluery', 'Martin', '']]","['Lightweight encryption', 'video security', 'internet']"
2838,1809.01360,Jukka Ruohonen,"Jukka Ruohonen and Ville Lepp\""anen","Toward Validation of Textual Information Retrieval Techniques for
  Software Weaknesses","Proceedings of the 29th International Conference on Database and
  Expert Systems Applications (DEXA 2018), Regensburg, Springer, pp.~265--277",,10.1007/978-3-319-99133-7_22,,cs.IR cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a preliminary validation of common textual information
retrieval techniques for mapping unstructured software vulnerability
information to distinct software weaknesses. The validation is carried out with
a dataset compiled from four software repositories tracked in the Snyk
vulnerability database. According to the results, the information retrieval
techniques used perform unsatisfactorily compared to regular expression
searches. Although the results vary from a repository to another, the
preliminary validation presented indicates that explicit referencing of
vulnerability and weakness identifiers is preferable for concrete vulnerability
tracking. Such referencing allows the use of keyword-based searches, which
currently seem to yield more consistent results compared to information
retrieval techniques. Further validation work is required for improving the
precision of the techniques, however.
","[{'version': 'v1', 'created': 'Wed, 5 Sep 2018 07:39:23 GMT'}]",2018-09-06,"[['Ruohonen', 'Jukka', ''], ['Leppänen', 'Ville', '']]","['text mining', 'software vulnerability', 'Snyk', 'LSA', 'CVE', 'CWE', 'NVD']"
2839,1005.1759,Secretary Aircc Journal,"Soumen Kanrar and Mohammad Siraj, (King Saud University, Saudi Arabia)","Class Based Admission Control by Complete Partitioning -Video on Demand
  Server","12 Pages, IJCNC","International Journal of Computer Networks & Communications 2.3
  (2010) 101-112",10.5121/ijcnc.2010.2308,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In the next generation network (NGN) environment specific consideration is on
bandwidth minimization, because this reduces the cost of network. In response
to the growing market demand for multimedia traffic transmission, NGN concept
has been produced. The next generation network provides multimedia services
over high speed networks, which supports DVD quality video on demand. Although
it has numerous advantages, more exploration of the large-scale deployment
video on demand is still needed. The focus of the research presented in this
paper is a class based admission control by the complete partitioning of the
video on demand server. In this paper we present analytically and by simulation
how the blockage probability of the server significantly affects the on demand
video request and the service. We also present how the blockage probability
affects the performance of the video on demand server.
","[{'version': 'v1', 'created': 'Tue, 11 May 2010 08:49:45 GMT'}]",2010-07-15,"[['Kanrar', 'Soumen', ''], ['Siraj', 'Mohammad', '']]","['Next Generation Network', 'Video on demand server', 'Blockage Probability', 'partition']"
2840,1711.08060,\'Alvaro L\'opez Garc\'ia,"\'Alvaro L\'opez Garc\'ia, Enol Fern\'andez del Castillo",Efficient image deployment in cloud environments,,"Journal of Network and Computer Applications, Volume 63, 2016,
  Pages 140-149",10.1016/j.jnca.2015.10.015,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The biggest overhead for the instantiation of a virtual machine in a cloud
infrastructure is the time spent in transferring the image of the virtual
machine into the physical node that executes it. This overhead becomes larger
for requests composed of several virtual machines to be started concurrently,
and the illusion of flexibility and elasticity usually associated with the
cloud computing model may vanish. This poses a problem for both the resource
providers and the software developers, since tackling those overheads is not a
trivial issue.
  In this work we implement and evaluate several improvements for virtual
machine image distribution problem in a cloud infrastructure and propose a
method based on BitTorrent and local caching of the virtual machine images that
reduces the transfer time when large requests are made
","[{'version': 'v1', 'created': 'Tue, 21 Nov 2017 21:51:40 GMT'}]",2017-11-23,"[['García', 'Álvaro López', ''], ['del Castillo', 'Enol Fernández', '']]","['Cloud Computing', 'Image Deployment', 'OpenStack', 'Scheduling']"
2841,1409.6359,Bartlomiej Placzek,Bartlomiej Placzek,"Neighborhood Selection and Rules Identification for Cellular Automata: A
  Rough Sets Approach","11 pages, 3 figures","Lecture Notes in Computer Science, vol. 8385, pp. 721-730 (2014)",10.1007/978-3-642-55195-6_68,,cs.AI nlin.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper a method is proposed which uses data mining techniques based on
rough sets theory to select neighborhood and determine update rule for cellular
automata (CA). According to the proposed approach, neighborhood is detected by
reducts calculations and a rule-learning algorithm is applied to induce a set
of decision rules that define the evolution of CA. Experiments were performed
with use of synthetic as well as real-world data sets. The results show that
the introduced method allows identification of both deterministic and
probabilistic CA-based models of real-world phenomena.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 22:11:50 GMT'}]",2014-09-24,"[['Placzek', 'Bartlomiej', '']]","['rough sets', 'cellular automata', 'model identification']"
2842,1610.08336,Elias Mueggler,"Elias Mueggler, Henri Rebecq, Guillermo Gallego, Tobi Delbruck, Davide
  Scaramuzza","The Event-Camera Dataset and Simulator: Event-based Data for Pose
  Estimation, Visual Odometry, and SLAM","7 pages, 4 figures, 3 tables","International Journal of Robotics Research, Vol. 36, Issue 2, pp.
  142-149, Feb. 2017",10.1177/0278364917691115,,cs.RO cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  New vision sensors, such as the Dynamic and Active-pixel Vision sensor
(DAVIS), incorporate a conventional global-shutter camera and an event-based
sensor in the same pixel array. These sensors have great potential for
high-speed robotics and computer vision because they allow us to combine the
benefits of conventional cameras with those of event-based sensors: low
latency, high temporal resolution, and very high dynamic range. However, new
algorithms are required to exploit the sensor characteristics and cope with its
unconventional output, which consists of a stream of asynchronous brightness
changes (called ""events"") and synchronous grayscale frames. For this purpose,
we present and release a collection of datasets captured with a DAVIS in a
variety of synthetic and real environments, which we hope will motivate
research on new algorithms for high-speed and high-dynamic-range robotics and
computer-vision applications. In addition to global-shutter intensity images
and asynchronous events, we provide inertial measurements and ground-truth
camera poses from a motion-capture system. The latter allows comparing the pose
accuracy of ego-motion estimation algorithms quantitatively. All the data are
released both as standard text files and binary files (i.e., rosbag). This
paper provides an overview of the available data and describes a simulator that
we release open-source to create synthetic event-camera data.
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2016 13:59:39 GMT'}, {'version': 'v2', 'created': 'Mon, 31 Oct 2016 13:38:04 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Nov 2016 13:51:11 GMT'}, {'version': 'v4', 'created': 'Wed, 8 Nov 2017 08:40:14 GMT'}]",2017-11-10,"[['Mueggler', 'Elias', ''], ['Rebecq', 'Henri', ''], ['Gallego', 'Guillermo', ''], ['Delbruck', 'Tobi', ''], ['Scaramuzza', 'Davide', '']]","['Event-based cameras', 'visual odometry', 'SLAM', 'simulation']"
2843,1009.0390,Khalid Nawaz,"Khalid Nawaz, Alejandro P. Buchmann","Acdmcp: An adaptive and completely distributed multi-hop clustering
  protocol for wireless sensor networks",,"International Journal of Wireless & Mobile Networks (IJWMN),
  ISSN:0975-3834, 0975-4679, Academy & Industry Research Collaboration Center
  (AIRCC), August 2010",10.5121/ijwmn.2010.2302,,cs.NI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering is a very popular network structuring technique which mainly
addresses the issue of scalability in large scale Wireless Sensor Networks.
Additionally, it has been shown to improve the energy efficiency and prolong
the life of the network. The suggested protocols mostly base their clustering
criteria on some grouping attribute(s) of the nodes. One important attribute
that is largely ignored by most of the existing multi-hop clustering protocols
is the reliability of the communication links between the nodes. In this paper,
we suggest an adaptive and completely distributed multi-hop clustering protocol
that incorporates different notions of reliability of the communication links,
among other things, into a composite metric and uses it in all phases of the
clustering process. The joining criteria for the nodes, which lie at one hop
from the elected cluster heads, to a particular cluster not only consider the
reliability of their communication link with their cluster head but also other
important attributes. The nodes that lie outside the communication range of
cluster heads become cluster members transitively through existing cluster
members utilizing the end-to-end notion of link reliability, between the nodes
and the cluster heads, along with other important attributes. Similarly,
inter-cluster communication paths are selected using a set of criteria that
includes the end-to-end communication link reliability with the sink node along
with other important node and network attributes. We believe that incorporating
link reliability in all phases of clustering process results in an efficient
multi-hop communication hierarchy that has the potential of bringing down the
total communication costs in the network.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2010 10:59:37 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Sep 2010 07:58:24 GMT'}]",2010-09-10,"[['Nawaz', 'Khalid', ''], ['Buchmann', 'Alejandro P.', '']]","['Network Protocols', 'Wireless Sensor Networks', 'Scalability', 'Hierarchical Routing']"
2844,1707.03581,Daniel Ruprecht,"Andreas Naumann, Daniel Ruprecht and Joerg Wensch","Toward transient finite element simulation of thermal deformation of
  machine tools in real-time",,"Computational Mechanics 62(5), pp. 929 - 942, 2018",10.1007/s00466-018-1540-6,,cs.CE cs.NA cs.SY math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finite element models without simplifying assumptions can accurately describe
the spatial and temporal distribution of heat in machine tools as well as the
resulting deformation. In principle, this allows to correct for displacements
of the Tool Centre Point and enables high precision manufacturing. However, the
computational cost of FEM models and restriction to generic algorithms in
commercial tools like ANSYS prevents their operational use since simulations
have to run faster than real-time. For the case where heat diffusion is slow
compared to machine movement, we introduce a tailored implicit-explicit
multi-rate time stepping method of higher order based on spectral deferred
corrections. Using the open-source FEM library DUNE, we show that fully coupled
simulations of the temperature field are possible in real-time for a machine
consisting of a stock sliding up and down on rails attached to a stand.
","[{'version': 'v1', 'created': 'Wed, 12 Jul 2017 07:48:46 GMT'}]",2018-11-20,"[['Naumann', 'Andreas', ''], ['Ruprecht', 'Daniel', ''], ['Wensch', 'Joerg', '']]","['machine tool', 'thermal error', 'real-time simulation', 'numericaltime-stepping', 'spectral deferred corrections']"
2845,1806.11187,Guofei Pang,"Guofei Pang, Liu Yang, George Em Karniadakis","Neural-net-induced Gaussian process regression for function
  approximation and PDE solution",,,10.1016/j.jcp.2019.01.045,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural-net-induced Gaussian process (NNGP) regression inherits both the high
expressivity of deep neural networks (deep NNs) as well as the uncertainty
quantification property of Gaussian processes (GPs). We generalize the current
NNGP to first include a larger number of hyperparameters and subsequently train
the model by maximum likelihood estimation. Unlike previous works on NNGP that
targeted classification, here we apply the generalized NNGP to function
approximation and to solving partial differential equations (PDEs).
Specifically, we develop an analytical iteration formula to compute the
covariance function of GP induced by deep NN with an error-function
nonlinearity. We compare the performance of the generalized NNGP for function
approximations and PDE solutions with those of GPs and fully-connected NNs. We
observe that for smooth functions the generalized NNGP can yield the same order
of accuracy with GP, while both NNGP and GP outperform deep NN. For non-smooth
functions, the generalized NNGP is superior to GP and comparable or superior to
deep NN.
","[{'version': 'v1', 'created': 'Fri, 22 Jun 2018 03:02:36 GMT'}]",2019-03-27,"[['Pang', 'Guofei', ''], ['Yang', 'Liu', ''], ['Karniadakis', 'George Em', '']]","['NN-induced Gaussian process', 'neural network', 'machine learning', 'partial differential equation', 'uncertainty quantification']"
2846,2111.08893,Dipanjan Das,"Dipanjan Das, Priyanka Bose, Nicola Ruaro, Christopher Kruegel,
  Giovanni Vigna",Understanding Security Issues in the NFT Ecosystem,,"ACM Conference on Computer and Communications Security (CCS), 2022",,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Non-Fungible Tokens (NFTs) have emerged as a way to collect digital art as
well as an investment vehicle. Despite having been popularized only recently,
NFT markets have witnessed several high-profile (and high-value) asset sales
and a tremendous growth in trading volumes over the last year. Unfortunately,
these marketplaces have not yet received much security scrutiny. Instead, most
academic research has focused on attacks against decentralized finance (DeFi)
protocols and automated techniques to detect smart contract vulnerabilities. To
the best of our knowledge, we are the first to study the market dynamics and
security issues of the multi-billion dollar NFT ecosystem.
  In this paper, we first present a systematic overview of how the NFT
ecosystem works, and we identify three major actors: marketplaces, external
entities, and users. We perform an in-depth analysis of the top 8 marketplaces
(ranked by transaction volume) to discover potential issues associated with
such marketplaces. Many of these issues can lead to substantial financial
losses. We also collected a large amount of asset and event data pertaining to
the NFTs being traded in the examined marketplaces. We automatically analyze
this data to understand how the entities external to the blockchain are able to
interfere with NFT markets, leading to serious consequences, and quantify the
malicious trading behaviors carried out by users under the cloak of anonymity.
","[{'version': 'v1', 'created': 'Wed, 17 Nov 2021 04:05:09 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Jan 2022 03:51:50 GMT'}, {'version': 'v3', 'created': 'Wed, 27 Apr 2022 04:03:38 GMT'}]",2022-04-28,"[['Das', 'Dipanjan', ''], ['Bose', 'Priyanka', ''], ['Ruaro', 'Nicola', ''], ['Kruegel', 'Christopher', ''], ['Vigna', 'Giovanni', '']]","['Non-fungible token', 'Blockchain', 'Decentralization']"
2847,1107.5408,Ant\'onio Porto,Ant\'onio Porto,A structured alternative to Prolog with simple compositional semantics,"27th Int'l. Conference on Logic Programming (ICLP'11) Special Issue,
  2011","Theory and Practice of Logic Programming 11(4-5), 611-627, 2011",10.1017/S1471068411000202,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Prolog's very useful expressive power is not captured by traditional logic
programming semantics, due mainly to the cut and goal and clause order. Several
alternative semantics have been put forward, exposing operational details of
the computation state. We propose instead to redesign Prolog around structured
alternatives to the cut and clauses, keeping the expressive power and
computation model but with a compositional denotational semantics over much
simpler states-just variable bindings. This considerably eases reasoning about
programs, by programmers and tools such as a partial evaluator, with safe
unfolding of calls through predicate definitions. An if-then-else across
clauses replaces most uses of the cut, but the cut's full power is achieved by
an until construct. Disjunction, conjunction and until, along with unification,
are the primitive goal types with a compositional semantics yielding sequences
of variable-binding solutions. This extends to programs via the usual technique
of a least fixpoint construction. A simple interpreter for Prolog in the
alternative language, and a definition of until in Prolog, establish the
identical expressive power of the two languages. Many useful control constructs
are derivable from the primitives, and the semantic framework illuminates the
discussion of alternative ones. The formalisation rests on a term language with
variable abstraction as in the {\lambda}-calculus. A clause is an abstraction
on the call arguments, a continuation, and the local variables. It can be
inclusive or exclusive, expressing a local case bound to a continuation by
either a disjunction or an if-then-else. Clauses are open definitions, composed
(and closed) with simple functional application ({\beta}-reduction). This paves
the way for a simple account of flexible module composition mechanisms. Cube, a
concrete language with the exposed principles, has been implemented.
","[{'version': 'v1', 'created': 'Wed, 27 Jul 2011 08:24:34 GMT'}]",2011-07-28,"[['Porto', 'António', '']]","['Prolog', 'cut', 'compositional semantics', 'denotational semantics']"
2848,1511.04515,Hao Zhuang,"Hao Zhuang, Wenjian Yu, Ilgweon Kang, Xinan Wang, Chung-Kuan Cheng","An Algorithmic Framework for Efficient Large-Scale Circuit Simulation
  Using Exponential Integrators",6 pages; ACM/IEEE DAC 2015,,10.1145/2744769.2744793,,cs.CE cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an efficient algorithmic framework for time domain circuit
simulation using exponential integrator. This work addresses several critical
issues exposed by previous matrix exponential based circuit simulation
research, and makes it capable of simulating stiff nonlinear circuit system at
a large scale. In this framework, the system's nonlinearity is treated with
exponential Rosenbrock-Euler formulation. The matrix exponential and vector
product is computed using invert Krylov subspace method. Our proposed method
has several distinguished advantages over conventional formulations (e.g., the
well-known backward Euler with Newton-Raphson method). The matrix factorization
is performed only for the conductance/resistance matrix G, without being
performed for the combinations of the capacitance/inductance matrix C and
matrix G, which are used in traditional implicit formulations. Furthermore, due
to the explicit nature of our formulation, we do not need to repeat LU
decompositions when adjusting the length of time steps for error controls. Our
algorithm is better suited to solving tightly coupled post-layout circuits in
the pursuit for full-chip simulation. Our experimental results validate the
advantages of our framework.
","[{'version': 'v1', 'created': 'Sat, 14 Nov 2015 05:57:35 GMT'}]",2016-11-17,"[['Zhuang', 'Hao', ''], ['Yu', 'Wenjian', ''], ['Kang', 'Ilgweon', ''], ['Wang', 'Xinan', ''], ['Cheng', 'Chung-Kuan', '']]","['Circuit Simulation', 'Transient Simulation', 'Exponential Integrators']"
2849,1308.5177,sukhjit Singh Sehra Er.,"Gitanjali, Sukhjit Singh Sehra, Jaiteg Singh",Policy Specification in Role based Access Control on Clouds,,"International Journal of Computer Applications 75(1):39-43, August
  2013",10.5120/13078-0253,,cs.DC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud Computing is a set of IT Services that are provided to a customer over
a network and these services are delivered by third party provider who owns the
infrastructure and reduce the burden at user's end. Nowadays researchers
devoted their work access control method to enhance the security on Cloud. RBAC
is attractive access model because the number of roles is significantly less
hence users can be easily classified according to their roles. The Role-based
Access Control (RBAC) model provides efficient way to manage access to
information while reducing the cost of security administration and complexity
in large networked applications. This paper specify various policies in RBAC on
clouds such as migration policy which helps the user to migrate the database
schema and roles easily to the Cloud using XML with more security. Restriction
policy provide the security enhancement in Role Based Access Model by
restricting the number of transaction per user and if the number of
transactions will increase the admin will come to know through its monitoring
system that unauthorized access has been made and it would be easier to take
action against such happening. This paper proposes backup and restoration
policy in Role Based Access Model in which if the main cloud is crashed or not
working properly then the backup and restoration facility will be available to
avoid the lost of important data. In this case chances of loss of data are very
less so enhance more security on Cloud Computing.
","[{'version': 'v1', 'created': 'Fri, 23 Aug 2013 16:41:56 GMT'}]",2013-08-26,"[['Gitanjali', '', ''], ['Sehra', 'Sukhjit Singh', ''], ['Singh', 'Jaiteg', '']]","['Cloud Computing', 'Migration scheme', 'Role-based Access Control Model', 'Backup and Restoration', 'Restriction policy']"
2850,1404.0627,Mohammed  Javed,"Mohammed Javed, P. Nagabhushan, B.B. Chaudhuri","Extraction of Projection Profile, Run-Histogram and Entropy Features
  Straight from Run-Length Compressed Text-Documents","Published by IEEE in Proceedings of ACPR-2013. arXiv admin note: text
  overlap with arXiv:1403.7783","2013 Second IAPR Asian Conference on Pattern Recognition, Pages
  813-817",10.1109/ACPR.2013.147,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Document Image Analysis, like any Digital Image Analysis requires
identification and extraction of proper features, which are generally extracted
from uncompressed images, though in reality images are made available in
compressed form for the reasons such as transmission and storage efficiency.
However, this implies that the compressed image should be decompressed, which
indents additional computing resources. This limitation induces the motivation
to research in extracting features directly from the compressed image. In this
research, we propose to extract essential features such as projection profile,
run-histogram and entropy for text document analysis directly from run-length
compressed text-documents. The experimentation illustrates that features are
extracted directly from the compressed image without going through the stage of
decompression, because of which the computing time is reduced. The feature
values so extracted are exactly identical to those extracted from uncompressed
images.
","[{'version': 'v1', 'created': 'Wed, 2 Apr 2014 17:34:13 GMT'}]",2014-04-03,"[['Javed', 'Mohammed', ''], ['Nagabhushan', 'P.', ''], ['Chaudhuri', 'B. B.', '']]","['Compressed data', 'Run-length compressed document', 'Projection profile', 'Entropy', 'Run-histogram']"
2851,1305.2865,Sultan Ullah,Sultan Ullah and Zheng Xuefeng and Zhou Feng,"TCloud: A Dynamic Framework and Policies for Access Control across
  Multiple Domains in Cloud Computing",,"International Journal of Computer Applications, Volume 62, No.2,
  January 2013, 01-07",10.5120/10049-4636,,cs.DC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a cloud computing environment, access control policy is an effective means
of fortification cloud users and cloud resources services against security
infringements. Based on analysis of current cloud computing security
characteristics, the preamble of the concept of trust, role-based access
control policy, combined with the characteristics of the cloud computing
environment, there are multiple security management domains, so a new cross
domain framework is for access control is proposed which is based on trust. It
will establish and calculate the degree of trust in the single as well as
multiple domains. Role Based Access Control is used for the implementation of
the access control policies in a single domain environment with the
introduction of the trust concept. In multiple domains the access control will
be based on the conversion of roles. On the basis of trust, and role based
access control model, a new novel framework of flexible cross domain access
control framework is presented. The role assignment and conversion will take
place dynamically.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2013 09:16:17 GMT'}]",2013-05-14,"[['Ullah', 'Sultan', ''], ['Xuefeng', 'Zheng', ''], ['Feng', 'Zhou', '']]","['Trust', 'Security', 'Access Control', 'Multiple – Domains', 'Role Conversion']"
2852,1210.0824,Zoltan Szabo,"Zoltan Szabo, Andras Lorincz","Distributed High Dimensional Information Theoretical Image Registration
  via Random Projections",,"Zoltan Szabo, Andras Lorincz: Distributed High Dimensional
  Information Theoretical Image Registration via Random Projections. Digital
  Signal Processing, 22(6):894-902, 2012",10.1016/j.dsp.2012.04.018,,cs.IT cs.LG math.IT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information theoretical measures, such as entropy, mutual information, and
various divergences, exhibit robust characteristics in image registration
applications. However, the estimation of these quantities is computationally
intensive in high dimensions. On the other hand, consistent estimation from
pairwise distances of the sample points is possible, which suits random
projection (RP) based low dimensional embeddings. We adapt the RP technique to
this task by means of a simple ensemble method. To the best of our knowledge,
this is the first distributed, RP based information theoretical image
registration approach. The efficiency of the method is demonstrated through
numerical examples.
","[{'version': 'v1', 'created': 'Tue, 2 Oct 2012 16:08:53 GMT'}]",2012-10-03,"[['Szabo', 'Zoltan', ''], ['Lorincz', 'Andras', '']]","['random projection', 'information theoretical image registration', 'high dimensional features', 'distributed solution']"
2853,2012.10836,Stephen MacDonell,"Michael F. Bosu, Stephen G. MacDonell","Experience: Quality Benchmarking of Datasets Used in Software Effort
  Estimation","26 pages, Journal, 13 tables, 5 figures","ACM Journal of Data and Information Quality 11(4), pp.1-38
  (Article 19), (2019)",10.1145/3328746,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data is a cornerstone of empirical software engineering (ESE) research and
practice. Data underpin numerous process and project management activities,
including the estimation of development effort and the prediction of the likely
location and severity of defects in code. Serious questions have been raised,
however, over the quality of the data used in ESE. Data quality problems caused
by noise, outliers, and incompleteness have been noted as being especially
prevalent. Other quality issues, although also potentially important, have
received less attention. In this study, we assess the quality of 13 datasets
that have been used extensively in research on software effort estimation. The
quality issues considered in this article draw on a taxonomy that we published
previously based on a systematic mapping of data quality issues in ESE. Our
contributions are as follows: (1) an evaluation of the ""fitness for purpose"" of
these commonly used datasets and (2) an assessment of the utility of the
taxonomy in terms of dataset benchmarking. We also propose a template that
could be used to both improve the ESE data collection/submission process and to
evaluate other such datasets, contributing to enhanced awareness of data
quality issues in the ESE community and, in time, the availability and use of
higher-quality datasets.
","[{'version': 'v1', 'created': 'Sun, 20 Dec 2020 03:37:48 GMT'}]",2020-12-22,"[['Bosu', 'Michael F.', ''], ['MacDonell', 'Stephen G.', '']]","['Data quality', 'benchmarking', 'empirical software engineering', 'software effort estimation', 'noise', 'missing data']"
2854,2102.03679,Jukka Ruohonen,Jukka Ruohonen,A Review of Product Safety Regulations in the European Union,International Cybersecurity Law Review,,10.1365/s43439-022-00057-8,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Product safety has been a concern in Europe ever since the early 1960s.
Despite the long and relatively stable historical lineage of product safety
regulations, new technologies, changes in the world economy, and other major
transformations have in recent years brought product safety again to the
forefront of policy debates. As reforms are also underway, there is a
motivation to review the complex safety policy framework in the European Union
(EU). Thus, building on deliberative policy analysis and interpretative
literature review, this paper reviews the safety policy for non-food consumer
products in the EU. The review covers the historical background and the main
laws, administration and enforcement, standardization and harmonization, laws
enacted for specific products, notifications delivered by national safety
authorities, recalls of dangerous products, and the liability of these. Based
on the review and analysis of these themes and the associated literature, some
current policy challenges are further discussed.
","[{'version': 'v1', 'created': 'Sat, 6 Feb 2021 23:04:17 GMT'}, {'version': 'v2', 'created': 'Thu, 13 May 2021 07:40:07 GMT'}, {'version': 'v3', 'created': 'Sun, 19 Jun 2022 11:22:47 GMT'}]",2022-06-22,"[['Ruohonen', 'Jukka', '']]","['safety', 'consumer protection', 'harmonization', 'standards', 'liability', 'literature review', 'European Union', 'GPSD']"
2855,1610.00852,Joey Hong,"Joey Hong, Chris Mattmann, Paul Ramirez","Ensemble Maximum Entropy Classification and Linear Regression for Author
  Age Prediction","6 pages, 4 figures","2017 IEEE International Conference on Information Reuse and
  Integration (IRI)",10.1109/IRI.2017.48,,cs.LG cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The evolution of the internet has created an abundance of unstructured data
on the web, a significant part of which is textual. The task of author
profiling seeks to find the demographics of people solely from their linguistic
and content-based features in text. The ability to describe traits of authors
clearly has applications in fields such as security and forensics, as well as
marketing. Instead of seeing age as just a classification problem, we also
frame age as a regression one, but use an ensemble chain method that
incorporates the power of both classification and regression to learn the
authors exact age.
","[{'version': 'v1', 'created': 'Tue, 4 Oct 2016 06:01:03 GMT'}]",2019-06-24,"[['Hong', 'Joey', ''], ['Mattmann', 'Chris', ''], ['Ramirez', 'Paul', '']]","['author profiling', 'age prediction', 'maximum entropy', 'regression', 'natural-language processing']"
2856,1611.09017,Gabriele Fici,"P\'eter Burcsi, Gabriele Fici, Zsuzsanna Lipt\'ak, Frank Ruskey, Joe
  Sawada",On Prefix Normal Words and Prefix Normal Forms,To appear in Theoretical Computer Science,"Theoretical Computer Science, 659: 1-13, 2017",10.1016/j.tcs.2016.10.015,,cs.DM cs.FL math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A $1$-prefix normal word is a binary word with the property that no factor
has more $1$s than the prefix of the same length; a $0$-prefix normal word is
defined analogously. These words arise in the context of indexed binary jumbled
pattern matching, where the aim is to decide whether a word has a factor with a
given number of $1$s and $0$s (a given Parikh vector). Each binary word has an
associated set of Parikh vectors of the factors of the word. Using prefix
normal words, we provide a characterization of the equivalence class of binary
words having the same set of Parikh vectors of their factors.
  We prove that the language of prefix normal words is not context-free and is
strictly contained in the language of pre-necklaces, which are prefixes of
powers of Lyndon words. We give enumeration results on $\textit{pnw}(n)$, the
number of prefix normal words of length $n$, showing that, for sufficiently
large $n$, \[ 2^{n-4 \sqrt{n \lg n}} \le \textit{pnw}(n) \le 2^{n - \lg n + 1}.
\]
  For fixed density (number of $1$s), we show that the ordinary generating
function of the number of prefix normal words of length $n$ and density $d$ is
a rational function. Finally, we give experimental results on
$\textit{pnw}(n)$, discuss further properties, and state open problems.
","[{'version': 'v1', 'created': 'Mon, 28 Nov 2016 08:18:50 GMT'}]",2017-01-02,"[['Burcsi', 'Péter', ''], ['Fici', 'Gabriele', ''], ['Lipták', 'Zsuzsanna', ''], ['Ruskey', 'Frank', ''], ['Sawada', 'Joe', '']]","['prefix normal words', 'prefix normal forms', 'binary languages', 'binary jumbled pattern matching', 'pre-necklaces', 'Lyndon words', 'enumeration']"
2857,2207.03723,Liang Liao,"Liang Liao, Kangmin Xu, Haoning Wu, Chaofeng Chen, Wenxiu Sun, Qiong
  Yan, Weisi Lin","Exploring the Effectiveness of Video Perceptual Representation in Blind
  Video Quality Assessment",Will appear on ACM MM 2022,2022 ACM International Conference on Multimedia,,,cs.CV cs.MM eess.IV,http://creativecommons.org/licenses/by/4.0/,"  With the rapid growth of in-the-wild videos taken by non-specialists, blind
video quality assessment (VQA) has become a challenging and demanding problem.
Although lots of efforts have been made to solve this problem, it remains
unclear how the human visual system (HVS) relates to the temporal quality of
videos. Meanwhile, recent work has found that the frames of natural video
transformed into the perceptual domain of the HVS tend to form a straight
trajectory of the representations. With the obtained insight that distortion
impairs the perceived video quality and results in a curved trajectory of the
perceptual representation, we propose a temporal perceptual quality index
(TPQI) to measure the temporal distortion by describing the graphic morphology
of the representation. Specifically, we first extract the video perceptual
representations from the lateral geniculate nucleus (LGN) and primary visual
area (V1) of the HVS, and then measure the straightness and compactness of
their trajectories to quantify the degradation in naturalness and content
continuity of video. Experiments show that the perceptual representation in the
HVS is an effective way of predicting subjective temporal quality, and thus
TPQI can, for the first time, achieve comparable performance to the spatial
quality metric and be even more effective in assessing videos with large
temporal variations. We further demonstrate that by combining with NIQE, a
spatial quality metric, TPQI can achieve top performance over popular
in-the-wild video datasets. More importantly, TPQI does not require any
additional information beyond the video being evaluated and thus can be applied
to any datasets without parameter tuning. Source code is available at
https://github.com/UoLMM/TPQI-VQA.
","[{'version': 'v1', 'created': 'Fri, 8 Jul 2022 07:30:51 GMT'}]",2022-07-11,"[['Liao', 'Liang', ''], ['Xu', 'Kangmin', ''], ['Wu', 'Haoning', ''], ['Chen', 'Chaofeng', ''], ['Sun', 'Wenxiu', ''], ['Yan', 'Qiong', ''], ['Lin', 'Weisi', '']]","['Perceptual trajectories', 'primary visual cortex', 'temporal modeling', 'blind video quality assessment']"
2858,2011.04260,Lijian Lin,"Lijian Lin, Haosheng Chen, Yanjie Liang, Yan Yan, Hanzi Wang","Robust Visual Tracking via Statistical Positive Sample Generation and
  Gradient Aware Learning",6 pages,ACM MM Asia2019,10.1145/3338533.3366556,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, Convolutional Neural Network (CNN) based trackers have
achieved state-of-the-art performance on multiple benchmark datasets. Most of
these trackers train a binary classifier to distinguish the target from its
background. However, they suffer from two limitations. Firstly, these trackers
cannot effectively handle significant appearance variations due to the limited
number of positive samples. Secondly, there exists a significant imbalance of
gradient contributions between easy and hard samples, where the easy samples
usually dominate the computation of gradient. In this paper, we propose a
robust tracking method via Statistical Positive sample generation and Gradient
Aware learning (SPGA) to address the above two limitations. To enrich the
diversity of positive samples, we present an effective and efficient
statistical positive sample generation algorithm to generate positive samples
in the feature space. Furthermore, to handle the issue of imbalance between
easy and hard samples, we propose a gradient sensitive loss to harmonize the
gradient contributions between easy and hard samples. Extensive experiments on
three challenging benchmark datasets including OTB50, OTB100 and VOT2016
demonstrate that the proposed SPGA performs favorably against several
state-of-the-art trackers.
","[{'version': 'v1', 'created': 'Mon, 9 Nov 2020 09:14:58 GMT'}]",2020-11-10,"[['Lin', 'Lijian', ''], ['Chen', 'Haosheng', ''], ['Liang', 'Yanjie', ''], ['Yan', 'Yan', ''], ['Wang', 'Hanzi', '']]","['Visual Tracking', 'Sample Imbalance', 'Positive Sample Generation', 'Gradient Sensitive Loss']"
2859,1803.01896,Edith Zavala,"Edith Zavala, Xavier Franch, Jordi Marco, Alessia Knauss, Daniela
  Damian","SACRE: Supporting contextual requirements' adaptation in modern
  self-adaptive systems in the presence of uncertainty at runtime","45 pages, journal article, 14 figures, 9 tables, CC-BY-NC-ND 4.0
  license","Expert Systems with Applications, Volume 98, 2018, Pages 166-188,
  ISSN 0957-4174,
  (http://www.sciencedirect.com/science/article/pii/S0957417418300095)",10.1016/j.eswa.2018.01.009,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Runtime uncertainty such as unpredictable resource unavailability, changing
environmental conditions and user needs, as well as system intrusions or faults
represents one of the main current challenges of self-adaptive systems.
Moreover, today's systems are increasingly more complex, distributed,
decentralized, etc. and therefore have to reason about and cope with more and
more unpredictable events. Approaches to deal with such changing requirements
in complex today's systems are still missing. This work presents SACRE (Smart
Adaptation through Contextual REquirements), our approach leveraging an
adaptation feedback loop to detect self-adaptive systems' contextual
requirements affected by uncertainty and to integrate machine learning
techniques to determine the best operationalization of context based on sensed
data at runtime. SACRE is a step forward of our former approach ACon which
focus had been on adapting the context in contextual requirements, as well as
their basic implementation. SACRE primarily focuses on architectural decisions,
addressing self-adaptive systems' engineering challenges. Furthering the work
on ACon, in this paper, we perform an evaluation of the entire approach in
different uncertainty scenarios in real-time in the extremely demanding domain
of smart vehicles. The real-time evaluation is conducted in a simulated
environment in which the smart vehicle is implemented through software
components. The evaluation results provide empirical evidence about the
applicability of SACRE in real and complex software system domains.
","[{'version': 'v1', 'created': 'Mon, 5 Mar 2018 19:40:50 GMT'}]",2018-03-07,"[['Zavala', 'Edith', ''], ['Franch', 'Xavier', ''], ['Marco', 'Jordi', ''], ['Knauss', 'Alessia', ''], ['Damian', 'Daniela', '']]","['Self-adaptive systems', 'Decentralized control loops', 'Machine learning', 'Requirements engineering', 'Contextual requirements', 'Requirements adaptation']"
2860,1512.05110,Josep Domingo-Ferrer,J. Domingo-Ferrer and J. Soria-Comas,"From t-closeness to differential privacy and vice versa in data
  anonymization",,"Knowledge-Based Systems, Vol. 74, pp. 151-158, 2015",10.1016/j.knosys.2014.11.011,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  k-Anonymity and {\epsilon}-differential privacy are two mainstream privacy
models, the former introduced to anonymize data sets and the latter to limit
the knowledge gain that results from including one individual in the data set.
Whereas basic k-anonymity only protects against identity disclosure,
t-closeness was presented as an extension of k-anonymity that also protects
against attribute disclosure. We show here that, if not quite equivalent,
t-closeness and {\epsilon}-differential privacy are strongly related to one
another when it comes to anonymizing data sets. Specifically, k-anonymity for
the quasi-identifiers combined with {\epsilon}-differential privacy for the
confidential attributes yields stochastic t-closeness (an extension of
t-closeness), with t a function of k and {\epsilon}. Conversely, t-closeness
can yield {\epsilon}- differential privacy when t = exp({\epsilon}/2) and the
assumptions made by t-closeness about the prior and posterior views of the data
hold
","[{'version': 'v1', 'created': 'Wed, 16 Dec 2015 10:18:14 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Dec 2015 12:07:57 GMT'}]",2015-12-22,"[['Domingo-Ferrer', 'J.', ''], ['Soria-Comas', 'J.', '']]","['t-closeness', 'ε-differential privacy', 'data anonymization']"
2861,1005.4505,Secretary Aircc Journal,"Ulrich Herberg and Thomas Clausen (Ecole Polytechnique, France)","Security Issues in the Optimized Link State Routing Protocol Version 2
  (OLSRV2)","20 Pages, IJNSA","International Journal of Network Security & Its Applications 2.2
  (2010) 162-181",10.5121/ijnsa.2010.2213,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Mobile Ad hoc NETworks (MANETs) are leaving the confines of research
laboratories, to find place in real-world deployments. Outside specialized
domains (military, vehicular, etc.), city-wide communitynetworks are emerging,
connecting regular Internet users with each other, and with the Internet, via
MANETs. Growing to encompass more than a handful of ""trusted participants"", the
question of preserving the MANET network connectivity, even when faced with
careless or malicious participants, arises, and must be addressed. A first step
towards protecting a MANET is to analyze the vulnerabilities of the routing
protocol, managing the connectivity. By understanding how the algorithms of the
routing protocol operate, and how these can be exploited by those with ill
intent, countermeasures can be developed, readying MANETs for wider deployment
and use. This paper takes an abstract look at the algorithms that constitute
the Optimized Link State Routing Protocol version 2 (OLSRv2), and identifies
for each protocol element the possible vulnerabilities and attacks -- in a
certain way, provides a ""cookbook"" for how to best attack an operational OLSRv2
network, or for how to proceed with developing protective countermeasures
against these attacks.
","[{'version': 'v1', 'created': 'Tue, 25 May 2010 08:13:57 GMT'}]",2010-07-15,"[['Herberg', 'Ulrich', '', 'Ecole Polytechnique, France'], ['Clausen', 'Thomas', '', 'Ecole Polytechnique, France']]","['OLSRv2', 'MANET', 'Vulnerability Analysis', 'Security']"
2862,1307.4300,Nisheeth Joshi,"Deepti Bhalla, Nisheeth Joshi and Iti Mathur",Rule Based Transliteration Scheme for English to Punjabi,"International Journal on Natural Language Computing (IJNLC) Vol. 2,
  No.2, April 2013",,10.5121/ijnlc.2013.2207,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine Transliteration has come out to be an emerging and a very important
research area in the field of machine translation. Transliteration basically
aims to preserve the phonological structure of words. Proper transliteration of
name entities plays a very significant role in improving the quality of machine
translation. In this paper we are doing machine transliteration for
English-Punjabi language pair using rule based approach. We have constructed
some rules for syllabification. Syllabification is the process to extract or
separate the syllable from the words. In this we are calculating the
probabilities for name entities (Proper names and location). For those words
which do not come under the category of name entities, separate probabilities
are being calculated by using relative frequency through a statistical machine
translation toolkit known as MOSES. Using these probabilities we are
transliterating our input text from English to Punjabi.
","[{'version': 'v1', 'created': 'Mon, 15 Jul 2013 15:54:43 GMT'}]",2013-07-17,"[['Bhalla', 'Deepti', ''], ['Joshi', 'Nisheeth', ''], ['Mathur', 'Iti', '']]","['Machine Translation', 'Machine Transliteration', 'Name entity recognition', 'Syllabification']"
2863,1311.3633,EPTCS,"Manuela L. Bujorianu (University of Warwick), Marius C. Bujorianu
  (University of Birmingham)",A coordination model for ultra-large scale systems of systems,"In Proceedings AiSoS 2013, arXiv:1311.3195","EPTCS 133, 2013, pp. 84-98",10.4204/EPTCS.133.8,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ultra large multi-agent systems are becoming increasingly popular due to
quick decay of the individual production costs and the potential of speeding up
the solving of complex problems. Examples include nano-robots, or systems of
nano-satellites for dangerous meteorite detection, or cultures of stem cells
for organ regeneration or nerve repair. The topics associated with these
systems are usually dealt within the theories of intelligent swarms or
biologically inspired computation systems. Stochastic models play an important
role and they are based on various formulations of the mechanical statistics.
In these cases, the main assumption is that the swarm elements have a simple
behaviour and that some average properties can be deduced for the entire swarm.
In contrast, complex systems in areas like aeronautics are formed by elements
with sophisticated behaviour, which are even autonomous. In situations like
this, a new approach to swarm coordination is necessary. We present a
stochastic model where the swarm elements are communicating autonomous systems,
the coordination is separated from the component autonomous activity and the
entire swarm can be abstracted away as a piecewise deterministic Markov
process, which constitutes one of the most popular model in stochastic control.
Keywords: ultra large multi-agent systems, system of systems, autonomous
systems, stochastic hybrid systems.
","[{'version': 'v1', 'created': 'Thu, 14 Nov 2013 19:41:34 GMT'}]",2013-11-18,"[['Bujorianu', 'Manuela L.', '', 'University of Warwick'], ['Bujorianu', 'Marius C.', '', 'University of Birmingham']]","['ultra large multi-agent systems', 'system of systems', 'autonomous systems', 'stochastichybrid systems']"
2864,1406.0196,Mansouri Ali mr,Ali Mansouri and Mohamed Salim Bouhlel,A linear algorithm for the grundy number of a tree,,"International Journal of Computer Science & Information Technology
  (IJCSIT) Vol 6, No 1, February 2014",10.5121/ijcsit.2014.6112,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A coloring of a graph G = (V,E) is a partition {V1, V2, . . ., Vk} of V into
independent sets or color classes. A vertex v Vi is a Grundy vertex if it is
adjacent to at least one vertex in each color class Vj . A coloring is a Grundy
coloring if every color class contains at least one Grundy vertex, and the
Grundy number of a graph is the maximum number of colors in a Grundy coloring.
We derive a natural upper bound on this parameter and show that graphs with
sufficiently large girth achieve equality in the bound. In particular, this
gives a linear time algorithm to determine the Grundy number of a tree.
","[{'version': 'v1', 'created': 'Sun, 1 Jun 2014 20:05:44 GMT'}]",2015-02-13,"[['Mansouri', 'Ali', ''], ['Bouhlel', 'Mohamed Salim', '']]","['Graphs', 'Grundy Number', 'Algorithm', 'Linear-time algorithm', 'Coloring of a graph']"
2865,0808.2586,Panos Papadimitratos,"Marcin Poturalski, Panos Papadimitratos, Jean-Pierre Hubaux",Towards Provable Secure Neighbor Discovery in Wireless Networks,,"ACM Computer and Communications Security Conference (CCS) Sixth
  Workshop on Formal Methods in Security Engineering (FMSE), pages 31{42,
  Alexan- dria, VA, USA, October 2008",,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In wireless systems, neighbor discovery (ND) is a fundamental building block:
determining which devices are within direct radio communication is an enabler
for networking protocols and a wide range of applications. To thwart abuse of
ND and the resultant compromise of the dependent functionality of wireless
systems, numerous works proposed solutions to secure ND. Nonetheless, until
very recently, there has been no formal analysis of secure ND protocols. We
close this gap in \cite{asiaccs08}, but we concentrate primarily on the
derivation of an impossibility result for a class of protocols. In this paper,
we focus on reasoning about specific protocols. First, we contribute a number
of extensions and refinements on the framework of [24]. As we are particularly
concerned with the practicality of provably secure ND protocols, we investigate
availability and redefine accordingly the ND specification, and also consider
composability of ND with other protocols. Then, we propose and analyze two
secure ND protocols: We revisit one of the protocols analyzed in [24], and
introduce and prove correct a more elaborate challenge-response protocol.
","[{'version': 'v1', 'created': 'Tue, 19 Aug 2008 12:45:58 GMT'}]",2009-01-05,"[['Poturalski', 'Marcin', ''], ['Papadimitratos', 'Panos', ''], ['Hubaux', 'Jean-Pierre', '']]","['wireless networks security', 'secure neighbor discovery', 'relayattack']"
2866,2105.07585,Yujuan Ding,"Yujuan Ding, Yunshan Ma, Wai Keung Wong, Tat-Seng Chua","Leveraging Two Types of Global Graph for Sequential Fashion
  Recommendation",,,10.1145/3460426.3463638,,cs.IR cs.MM,http://creativecommons.org/publicdomain/zero/1.0/,"  Sequential fashion recommendation is of great significance in online fashion
shopping, which accounts for an increasing portion of either fashion retailing
or online e-commerce. The key to building an effective sequential fashion
recommendation model lies in capturing two types of patterns: the personal
fashion preference of users and the transitional relationships between adjacent
items. The two types of patterns are usually related to user-item interaction
and item-item transition modeling respectively. However, due to the large sets
of users and items as well as the sparse historical interactions, it is
difficult to train an effective and efficient sequential fashion recommendation
model. To tackle these problems, we propose to leverage two types of global
graph, i.e., the user-item interaction graph and item-item transition graph, to
obtain enhanced user and item representations by incorporating higher-order
connections over the graphs. In addition, we adopt the graph kernel of LightGCN
for the information propagation in both graphs and propose a new design for
item-item transition graph. Extensive experiments on two established sequential
fashion recommendation datasets validate the effectiveness and efficiency of
our approach.
","[{'version': 'v1', 'created': 'Mon, 17 May 2021 03:02:04 GMT'}, {'version': 'v2', 'created': 'Tue, 18 May 2021 01:05:22 GMT'}, {'version': 'v3', 'created': 'Sun, 30 May 2021 02:08:48 GMT'}]",2021-06-01,"[['Ding', 'Yujuan', ''], ['Ma', 'Yunshan', ''], ['Wong', 'Wai Keung', ''], ['Chua', 'Tat-Seng', '']]","['Fashion Recommendation', 'Sequential Recommendation', 'GraphNeural Network']"
2867,2102.10925,Ivan Jericevich,Ivan Jericevich and Dharmesh Sing and Tim Gebbie,CoinTossX: An open-source low-latency high-throughput matching engine,"21 pages, 10 figures, 5 tables","SoftwareX Volume 19, July 2022, 101136",10.1016/j.softx.2022.101136,,cs.DC cs.MA q-fin.CP q-fin.TR,http://creativecommons.org/licenses/by/4.0/,"  We deploy and demonstrate the CoinTossX low-latency, high-throughput,
open-source matching engine with orders sent using the Julia and Python
languages. We show how this can be deployed for small-scale local desk-top
testing and discuss a larger scale, but local hosting, with multiple traded
instruments managed concurrently and managed by multiple clients. We then
demonstrate a cloud based deployment using Microsoft Azure, with large-scale
industrial and simulation research use cases in mind. The system is exposed and
interacted with via sockets using UDP SBE message protocols and can be
monitored using a simple web browser interface using HTTP. We give examples
showing how orders can be be sent to the system and market data feeds monitored
using the Julia and Python languages. The system is developed in Java with
orders submitted as binary encodings (SBE) via UDP protocols using the Aeron
Media Driver as the low-latency, high throughput message transport. The system
separates the order-generation and simulation environments e.g. agent-based
model simulation, from the matching of orders, data-feeds and various
modularised components of the order-book system. This ensures a more natural
and realistic asynchronicity between events generating orders, and the events
associated with order-book dynamics and market data-feeds. We promote the use
of Julia as the preferred order submission and simulation environment.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2021 11:50:34 GMT'}]",2022-08-24,"[['Jericevich', 'Ivan', ''], ['Sing', 'Dharmesh', ''], ['Gebbie', 'Tim', '']]","['Market matching-engine', 'Open-source application', 'Microsoft Azure deployment', 'Java web application', 'Julia', 'Python', 'Agent-based modeling', 'JSE']"
2868,1410.1076,Joanna Moulierac,"Fr\'ed\'eric Giroire (Inria Sophia Antipolis / Laboratoire I3S),
  Dorian Mazauric (INRIA Sophia Antipolis / Laboratoire I3S, INRIA Sophia
  Antipolis), Joanna Moulierac (INRIA Sophia Antipolis / Laboratoire I3S)",Energy Efficient Routing by Switching-Off Network Interfaces,,"Energy-Aware Systems and Networking for Sustainable Initiatives
  IGI Global (Ed.) (2012) 207-236",10.4018/978-1-4666-1842-8.ch010,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several studies exhibit that the traffic load of the routers only has a small
influence on their energy consumption. Hence, the power consumption in networks
is strongly related to the number of active network elements, such as
interfaces, line cards, base chassis,... The goal thus is to find a routing
that minimizes the (weighted) number of active network elements used when
routing. In this paper, we consider a simplified architecture where a
connection between two routers is represented as a link joining two network
interfaces. When a connection is not used, both network interfaces can be
turned off. Therefore, in order to reduce power consumption, the goal is to
find the routing that minimizes the number of used links while satisfying all
the demands. We first define formally the problem and we model it as an integer
linear program. Then, we prove that this problem is not in APX, that is there
is no polynomial-time constant-factor approximation algorithm. We propose a
heuristic algorithm for this problem and we also prove some negative results
about basic greedy and probabilistic algorithms. Thus we present a study on
specific topologies, such as trees, grids and complete graphs, that provide
bounds and results useful for real topologies. We then exhibit the gain in
terms of number of network interfaces (leading to a global reduction of
approximately 33 MWh for a medium-sized backbone network) for a set of existing
network topologies: we see that for almost all topologies more than one third
of the network interfaces can be spared for usual ranges of operation. Finally,
we discuss the impact of energy efficient routing on the stretch factor and on
fault tolerance.
","[{'version': 'v1', 'created': 'Sat, 4 Oct 2014 18:38:57 GMT'}]",2014-10-07,"[['Giroire', 'Frédéric', '', 'Inria Sophia Antipolis / Laboratoire I3S'], ['Mazauric', 'Dorian', '', 'INRIA Sophia Antipolis / Laboratoire I3S, INRIA Sophia\n  Antipolis'], ['Moulierac', 'Joanna', '', 'INRIA Sophia Antipolis / Laboratoire I3S']]","['power consumption', 'energy-efficient routing', 'graphs', 'integer linear']"
2869,1404.2824,Gabriele Fici,"P\'eter Burcsi and Gabriele Fici and Zsuzsanna Lipt\'ak and Frank
  Ruskey and Joe Sawada","Normal, Abby Normal, Prefix Normal",Accepted at FUN '14,"LNCS 8496, pages 74-88 (2014)",10.1007/978-3-319-07890-8_7,,cs.FL cs.DM cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A prefix normal word is a binary word with the property that no substring has
more 1s than the prefix of the same length. This class of words is important in
the context of binary jumbled pattern matching. In this paper we present
results about the number $pnw(n)$ of prefix normal words of length $n$, showing
that $pnw(n) =\Omega\left(2^{n - c\sqrt{n\ln n}}\right)$ for some $c$ and
$pnw(n) = O \left(\frac{2^n (\ln n)^2}{n}\right)$. We introduce efficient
algorithms for testing the prefix normal property and a ""mechanical algorithm""
for computing prefix normal forms. We also include games which can be played
with prefix normal words. In these games Alice wishes to stay normal but Bob
wants to drive her ""abnormal"" -- we discuss which parameter settings allow
Alice to succeed.
","[{'version': 'v1', 'created': 'Tue, 1 Apr 2014 07:55:57 GMT'}]",2014-06-23,"[['Burcsi', 'Péter', ''], ['Fici', 'Gabriele', ''], ['Lipták', 'Zsuzsanna', ''], ['Ruskey', 'Frank', ''], ['Sawada', 'Joe', '']]","['prefix normal words', 'binary jumbled pattern matching', 'normal forms', 'enumeration', 'membership testing', 'binary languages']"
2870,1608.04622,Filippo Maria Bianchi,"Sigurd L{\o}kse, Filippo Maria Bianchi and Robert Jenssen","Training Echo State Networks with Regularization through Dimensionality
  Reduction",,,10.1007/s12559-017-9450-z,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we introduce a new framework to train an Echo State Network to
predict real valued time-series. The method consists in projecting the output
of the internal layer of the network on a space with lower dimensionality,
before training the output layer to learn the target task. Notably, we enforce
a regularization constraint that leads to better generalization capabilities.
We evaluate the performances of our approach on several benchmark tests, using
different techniques to train the readout of the network, achieving superior
predictive performance when using the proposed framework. Finally, we provide
an insight on the effectiveness of the implemented mechanics through a
visualization of the trajectory in the phase space and relying on the
methodologies of nonlinear time-series analysis. By applying our method on well
known chaotic systems, we provide evidence that the lower dimensional embedding
retains the dynamical properties of the underlying system better than the
full-dimensional internal states of the network.
","[{'version': 'v1', 'created': 'Tue, 16 Aug 2016 14:41:12 GMT'}]",2017-01-10,"[['Løkse', 'Sigurd', ''], ['Bianchi', 'Filippo Maria', ''], ['Jenssen', 'Robert', '']]","['Echo state network', 'nonlinear time-series analysis', 'dimensionality reduction', 'timeseries prediction']"
2871,1111.5682,Nirmal Fernando,"Nirmal Fernando, Yi Hong, and Emanuele Viterbo",Flip-OFDM for Optical Wireless Communications,"published in IEEE Information Theory Workshop, Paraty Brazil, Sept
  2011",,10.1109/ITW.2011.6089566,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider two uniploar OFDM techniques for optical wireless communications:
asymmetric clipped optical OFDM (ACO-OFDM) and Flip-OFDM. Both techniques can
be used to compensate multipath distortion effects in optical wireless
channels. However, ACO-OFDM has been widely studied in the literature, while
the performance of Flip-OFDM has never been investigated. In this paper, we
conduct the performance analysis of Flip-OFDM and propose additional
modification to the original scheme in order to compare the performance of both
techniques. Finally, it is shown by simulation that both techniques have the
same performance but different hardware complexities. In particular, for slow
fading channels, Flip-OFDM offers 50% saving in hardware complexity over
ACO-OFDM at the receiver.
","[{'version': 'v1', 'created': 'Thu, 24 Nov 2011 06:13:43 GMT'}]",2016-11-15,"[['Fernando', 'Nirmal', ''], ['Hong', 'Yi', ''], ['Viterbo', 'Emanuele', '']]","['Flip-OFDM', 'AsymmetricClippedOpticalOFDM (ACO-OFDM)', 'Optical Wireless Communications', 'Intensity Modulation', 'Direct Detection']"
2872,1807.00208,Luka Humski,"Luka Humski, Damir Pintar, Mihaela Vrani\'c",Exploratory Analysis of Pairwise Interactions in Online Social Networks,"Journal Article published 2 Oct 2017 in Automatika volume 58 issue 4
  on pages 422 to 428",,10.1080/00051144.2018.1468162,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last few decades sociologists were trying to explain human behaviour
by analysing social networks, which requires access to data about interpersonal
relationships. This represented a big obstacle in this research field until the
emergence of online social networks (OSNs), which vastly facilitated the
process of collecting such data. Nowadays, by crawling public profiles on OSNs,
it is possible to build a social graph where ""friends"" on OSN become
represented as connected nodes. OSN connection does not necessarily indicate a
close real-life relationship, but using OSN interaction records may reveal
real-life relationship intensities, a topic which inspired a number of recent
researches. Still, published research currently lacks an extensive exploratory
analysis of OSN interaction records, i.e. a comprehensive overview of users'
interaction via different ways of OSN interaction. In this paper we provide
such an overview by leveraging results of conducted extensive social experiment
which managed to collect records for over 3,200 Facebook users interacting with
over 1,400,000 of their friends. Our exploratory analysis focuses on extracting
population distributions and correlation parameters for 13 interaction
parameters, providing valuable insight in online social network interaction for
future researches aimed at this field of study.
","[{'version': 'v1', 'created': 'Sat, 30 Jun 2018 17:17:35 GMT'}]",2018-07-03,"[['Humski', 'Luka', ''], ['Pintar', 'Damir', ''], ['Vranić', 'Mihaela', '']]","['SNA', 'synthetic data', 'online social networks', 'Facebook', 'feature']"
2873,1807.04435,Shree Prasad M,"Shree M. Prasad, Trilochan Panigrahi, Mahbub Hassan",Direction of Arrival Estimation for Nanoscale Sensor Networks,"6 Pages, 9 figures, Camera Ready Version, NANOCOM '18: ACM The Fifth
  Annual International Conference on Nanoscale Computing and Communication,
  September 5--7, 2018, Reykjavik, Iceland",,10.1145/3233188.3233210,,cs.ET eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nanoscale wireless sensor networks (NWSNs) could be within reach soon using
graphene-based antennas, which resonate in 0.1-10 terahertz band. To conserve
the limited energy available at nanoscale, it is expected that NWSNs will
communicate using extremely short pulses on the order of femtoseconds. Accurate
estimation of direction of arrival (DOA) for such terahertz pulses will help
realize many useful applications for NWSNs. In this paper, using the well-known
MUltiple SIgnal Classification (MUSIC) algorithm, we study DOA estimation for
NWSNs for different energy levels, distances, pulse shapes, and frequencies.
Our analyses reveal that the best DOA estimation is achieved with the first
order Gaussian pulses, which emit their peak energy at 6 THz. Based on Monte
Carlo simulations, we demonstrate that MUSIC algorithm is capable of estimating
DOA with root mean square error less than one degree from a distance of around
6 meter for pulse energy as little as 1 atto Joule.
","[{'version': 'v1', 'created': 'Thu, 12 Jul 2018 06:25:19 GMT'}]",2018-07-13,"[['Prasad', 'Shree M.', ''], ['Panigrahi', 'Trilochan', ''], ['Hassan', 'Mahbub', '']]","['Direction of Arrival', 'MUSIC algorithm', 'Terahertz pulses', 'NanoscaleSensor Networks']"
2874,1706.09569,Inigo Jauregi Unanue,"Inigo Jauregi Unanue, Ehsan Zare Borzeshi, Massimo Piccardi","Recurrent neural networks with specialized word embeddings for
  health-domain named-entity recognition",Journal of Biomedical Informatics (2017),,10.1016/j.jbi.2017.11.007,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background. Previous state-of-the-art systems on Drug Name Recognition (DNR)
and Clinical Concept Extraction (CCE) have focused on a combination of text
""feature engineering"" and conventional machine learning algorithms such as
conditional random fields and support vector machines. However, developing good
features is inherently heavily time-consuming. Conversely, more modern machine
learning approaches such as recurrent neural networks (RNNs) have proved
capable of automatically learning effective features from either random
assignments or automated word ""embeddings"". Objectives. (i) To create a highly
accurate DNR and CCE system that avoids conventional, time-consuming feature
engineering. (ii) To create richer, more specialized word embeddings by using
health domain datasets such as MIMIC-III. (iii) To evaluate our systems over
three contemporary datasets. Methods. Two deep learning methods, namely the
Bidirectional LSTM and the Bidirectional LSTM-CRF, are evaluated. A CRF model
is set as the baseline to compare the deep learning systems to a traditional
machine learning approach. The same features are used for all the models.
Results. We have obtained the best results with the Bidirectional LSTM-CRF
model, which has outperformed all previously proposed systems. The specialized
embeddings have helped to cover unusual words in DDI-DrugBank and DDI-MedLine,
but not in the 2010 i2b2/VA IRB Revision dataset. Conclusion. We present a
state-of-the-art system for DNR and CCE. Automated word embeddings has allowed
us to avoid costly feature engineering and achieve higher accuracy.
Nevertheless, the embeddings need to be retrained over datasets that are
adequate for the domain, in order to adequately cover the domain-specific
vocabulary.
","[{'version': 'v1', 'created': 'Thu, 29 Jun 2017 03:53:55 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Jun 2018 01:44:25 GMT'}]",2018-06-26,"[['Unanue', 'Inigo Jauregi', ''], ['Borzeshi', 'Ehsan Zare', ''], ['Piccardi', 'Massimo', '']]","['Neural networks (computer)', 'Machine learning', 'Artificial intelligence', 'Clinical concept extraction', 'Drugname recognition']"
2875,1406.7061,Sanjay Sahay,Ashu Sharma and S.K. Sahay,"Evolution and Detection of Polymorphic and Metamorphic Malwares: A
  Survey",5 Pages,"International Journal of Computer Applications, 2014, Vol. 90, No.
  2, p. 7",10.5120/15544-4098,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Malwares are big threat to digital world and evolving with high complexity.
It can penetrate networks, steal confidential information from computers, bring
down servers and can cripple infrastructures etc. To combat the threat/attacks
from the malwares, anti- malwares have been developed. The existing
anti-malwares are mostly based on the assumption that the malware structure
does not changes appreciably. But the recent advancement in second generation
malwares can create variants and hence posed a challenge to anti-malwares
developers. To combat the threat/attacks from the second generation malwares
with low false alarm we present our survey on malwares and its detection
techniques.
","[{'version': 'v1', 'created': 'Fri, 27 Jun 2014 04:58:45 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Dec 2015 14:04:44 GMT'}]",2015-12-03,"[['Sharma', 'Ashu', ''], ['Sahay', 'S. K.', '']]","['Malwares', 'Antimalware', 'Polymorphic', 'Metamorphic']"
2876,1907.06417,Raul Fernandez,"Raul Fernandez-Fernandez, Juan G. Victores, David Estevez and Carlos
  Balaguer","Quick, Stat!: A Statistical Analysis of the Quick, Draw! Dataset","12 pages, Eurosim 2019",,10.11128/arep.58,,cs.CV cs.DB eess.IV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The Quick, Draw! Dataset is a Google dataset with a collection of 50 million
drawings, divided in 345 categories, collected from the users of the game
Quick, Draw!. In contrast with most of the existing image datasets, in the
Quick, Draw! Dataset, drawings are stored as time series of pencil positions
instead of a bitmap matrix composed by pixels. This aspect makes this dataset
the largest doodle dataset available at the time. The Quick, Draw! Dataset is
presented as a great opportunity to researchers for developing and studying
machine learning techniques. Due to the size of this dataset and the nature of
its source, there is a scarce of information about the quality of the drawings
contained. In this paper, a statistical analysis of three of the classes
contained in the Quick, Draw! Dataset is depicted: mountain, book and whale.
The goal is to give to the reader a first impression of the data collected in
this dataset. For the analysis of the quality of the drawings, a Classification
Neural Network was trained to obtain a classification score. Using this
classification score and the parameters provided by the dataset, a statistical
analysis of the quality and nature of the drawings contained in this dataset is
provided.
","[{'version': 'v1', 'created': 'Mon, 15 Jul 2019 10:28:34 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Oct 2019 09:07:23 GMT'}]",2019-10-24,"[['Fernandez-Fernandez', 'Raul', ''], ['Victores', 'Juan G.', ''], ['Estevez', 'David', ''], ['Balaguer', 'Carlos', '']]","['Quick', 'Draw! Dataset', 'Statistical Analysis', 'Neural Networks']"
2877,1908.02641,Yair Horesh,"Yair Horesh, Noa Haas, Elhanan Mishraky, Yehezkel S. Resheff, Shir
  Meir Lador","Paired-Consistency: An Example-Based Model-Agnostic Approach to Fairness
  Regularization in Machine Learning","ECML PKDD 2019, Data Science for social good workshop","Machine Learning and Knowledge Discovery in Databases. ECML PKDD
  2019. Communications in Computer and Information Science, vol 1167. Springer,
  Cham",10.1007/978-3-030-43823-4_47,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As AI systems develop in complexity it is becoming increasingly hard to
ensure non-discrimination on the basis of protected attributes such as gender,
age, and race. Many recent methods have been developed for dealing with this
issue as long as the protected attribute is explicitly available for the
algorithm. We address the setting where this is not the case (with either no
explicit protected attribute, or a large set of them). Instead, we assume the
existence of a fair domain expert capable of generating an extension to the
labeled dataset - a small set of example pairs, each having a different value
on a subset of protected variables, but judged to warrant a similar model
response. We define a performance metric - paired consistency. Paired
consistency measures how close the output (assigned by a classifier or a
regressor) is on these carefully selected pairs of examples for which fairness
dictates identical decisions. In some cases consistency can be embedded within
the loss function during optimization and serve as a fairness regularizer, and
in others it is a tool for fair model selection. We demonstrate our method
using the well studied Income Census dataset.
","[{'version': 'v1', 'created': 'Wed, 7 Aug 2019 14:01:37 GMT'}, {'version': 'v2', 'created': 'Sat, 7 Dec 2019 21:58:03 GMT'}]",2020-04-21,"[['Horesh', 'Yair', ''], ['Haas', 'Noa', ''], ['Mishraky', 'Elhanan', ''], ['Resheff', 'Yehezkel S.', ''], ['Lador', 'Shir Meir', '']]","['fairness', 'AI', 'Machine Learning', 'social responsibility']"
2878,1304.5485,Alexander Green,"Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter
  Selinger and Beno\^it Valiron",An Introduction to Quantum Programming in Quipper,"15 pages, RC2013","Lecture Notes in Computer Science 7948:110-124, Springer, 2013",10.1007/978-3-642-38986-3_10,,cs.PL cs.ET quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quipper is a recently developed programming language for expressing quantum
computations. This paper gives a brief tutorial introduction to the language,
through a demonstration of how to make use of some of its key features. We
illustrate many of Quipper's language features by developing a few well known
examples of Quantum computation, including quantum teleportation, the quantum
Fourier transform, and a quantum circuit for addition.
","[{'version': 'v1', 'created': 'Fri, 19 Apr 2013 17:33:33 GMT'}]",2013-07-08,"[['Green', 'Alexander S.', ''], ['Lumsdaine', 'Peter LeFanu', ''], ['Ross', 'Neil J.', ''], ['Selinger', 'Peter', ''], ['Valiron', 'Benoît', '']]","['Quantum Computation', 'Programming Languages', 'Quipper']"
2879,1008.1954,Jonathan Touboul,Jonathan Touboul,On the simulation of nonlinear bidimensional spiking neuron models,,,10.1162/NECO_a_00141,,cs.NA math.DS q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bidimensional spiking models currently gather a lot of attention for their
simplicity and their ability to reproduce various spiking patterns of cortical
neurons, and are particularly used for large network simulations. These models
describe the dynamics of the membrane potential by a nonlinear differential
equation that blows up in finite time, coupled to a second equation for
adaptation. Spikes are emitted when the membrane potential blows up or reaches
a cutoff value. The precise simulation of the spike times and of the adaptation
variable is critical for it governs the spike pattern produced, and is hard to
compute accurately because of the exploding nature of the system at the spike
times. We thoroughly study the precision of fixed time-step integration schemes
for this type of models and demonstrate that these methods produce systematic
errors that are unbounded, as the cutoff value is increased, in the evaluation
of the two crucial quantities: the spike time and the value of the adaptation
variable at this time. Precise evaluation of these quantities therefore involve
very small time steps and long simulation times. In order to achieve a fixed
absolute precision in a reasonable computational time, we propose here a new
algorithm to simulate these systems based on a variable integration step method
that either integrates the original ordinary differential equation or the
equation of the orbits in the phase plane, and compare this algorithm with
fixed time-step Euler scheme and other more accurate simulation algorithms.
","[{'version': 'v1', 'created': 'Wed, 11 Aug 2010 16:47:35 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Aug 2010 16:44:59 GMT'}]",2012-11-07,"[['Touboul', 'Jonathan', '']]","['Nonlinear Bidimensional Neuron Model', 'Numerical Simulation', 'Adap']"
2880,1704.07122,Dariusz Brzezinski,"Dariusz Brzezinski, Jerzy Stefanowski, Robert Susmaga, Izabela
  Szcz\k{e}ch","Visual-Based Analysis of Classification Measures with Applications to
  Imbalanced Data",,,10.1016/j.ins.2018.06.020,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With a plethora of available classification performance measures, choosing
the right metric for the right task requires careful thought. To make this
decision in an informed manner, one should study and compare general properties
of candidate measures. However, analysing measures with respect to complete
ranges of their domain values is a difficult and challenging task. In this
study, we attempt to support such analyses with a specialized visualization
technique, which operates in a barycentric coordinate system using a 3D
tetrahedron. Additionally, we adapt this technique to the context of imbalanced
data and put forward a set of properties which should be taken into account
when selecting a classification performance measure. As a result, we compare 22
popular measures and show important differences in their behaviour. Moreover,
for parametric measures such as the F$_{\beta}$ and IBA$_\alpha$(G-mean), we
analytically derive parameter thresholds that change measure properties.
Finally, we provide an online visualization tool that can aid the analysis of
complete domain ranges of performance measures.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 10:06:36 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Jul 2017 18:49:45 GMT'}]",2020-07-30,"[['Brzezinski', 'Dariusz', ''], ['Stefanowski', 'Jerzy', ''], ['Susmaga', 'Robert', ''], ['Szczęch', 'Izabela', '']]","['classification', 'performance measures', 'visualization', 'barycentric system', 'class imbalance']"
2881,1303.6361,Conrad Sanderson,"Sandra Mau, Shaokang Chen, Conrad Sanderson, Brian C. Lovell","Video Face Matching using Subset Selection and Clustering of
  Probabilistic Multi-Region Histograms",,"International Conference of Image and Vision Computing New Zealand
  (IVCNZ), 2010",10.1109/IVCNZ.2010.6148860,,cs.CV cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Balancing computational efficiency with recognition accuracy is one of the
major challenges in real-world video-based face recognition. A significant
design decision for any such system is whether to process and use all possible
faces detected over the video frames, or whether to select only a few ""best""
faces. This paper presents a video face recognition system based on
probabilistic Multi-Region Histograms to characterise performance trade-offs
in: (i) selecting a subset of faces compared to using all faces, and (ii)
combining information from all faces via clustering. Three face selection
metrics are evaluated for choosing a subset: face detection confidence, random
subset, and sequential selection. Experiments on the recently introduced MOBIO
dataset indicate that the usage of all faces through clustering always
outperformed selecting only a subset of faces. The experiments also show that
the face selection metric based on face detection confidence generally provides
better recognition performance than random or sequential sampling. Moreover,
the optimal number of faces varies drastically across selection metric and
subsets of MOBIO. Given the trade-offs between computational effort,
recognition accuracy and robustness, it is recommended that face feature
clustering would be most advantageous in batch processing (particularly for
video-based watchlists), whereas face selection methods should be limited to
applications with significant computational restrictions.
","[{'version': 'v1', 'created': 'Tue, 26 Mar 2013 01:34:42 GMT'}]",2013-03-27,"[['Mau', 'Sandra', ''], ['Chen', 'Shaokang', ''], ['Sanderson', 'Conrad', ''], ['Lovell', 'Brian C.', '']]","['surveillance', 'local features', 'video processing', 'face matching', 'clustering', 'subset selection', 'efficiency']"
2882,1711.07790,Carl Lundholm,"Anders Logg, Carl Lundholm, Magne Nordaas",Solving Poisson's Equation on the Microsoft HoloLens,"2 pages, 9 figures","In Proceedings of the 23rd ACM Symposium on Virtual Reality
  Software and Technology (VRST 2017). ACM, New York, NY, USA, Article 87",10.1145/3139131.3141777,,cs.GR cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a mixed reality application (HoloFEM) for the Microsoft HoloLens.
The application lets a user define and solve a physical problem governed by
Poisson's equation with the surrounding real world geometry as input data.
Holograms are used to visualise both the problem and the solution. The finite
element method is used to solve Poisson's equation. Solving and visualising
partial differential equations in mixed reality could have potential usage in
areas such as building planning and safety engineering.
","[{'version': 'v1', 'created': 'Fri, 17 Nov 2017 13:44:33 GMT'}]",2017-11-22,"[['Logg', 'Anders', ''], ['Lundholm', 'Carl', ''], ['Nordaas', 'Magne', '']]","['HoloLens', 'Poisson’s equation', 'finite element method', 'FEniCS']"
2883,1401.1326,"J\""urgen M\""unch","Michael Kl\""as, Frank Elberzhager, J\""urgen M\""unch, Klaus Hartjes,
  Olaf von Graevemeyer","Transparent Combination of Expert and Measurement Data for Defect
  Prediction: An Industrial Case Study","10 pages. The final publication is available at
  http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6062145","Proceedings of the 32nd ACM/IEEE International Conference on
  Software Engineering (ICSE '10), pages 119-128, New York, NY, USA, 2010",10.1145/1810295.1810313,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Defining strategies on how to perform quality assurance (QA) and how to
control such activities is a challenging task for organizations developing or
maintaining software and software-intensive systems. Planning and adjusting QA
activities could benefit from accurate estimations of the expected defect
content of relevant artifacts and the effectiveness of important quality
assurance activities. Combining expert opinion with commonly available
measurement data in a hybrid way promises to overcome the weaknesses of purely
data-driven or purely expert-based estimation methods. This article presents a
case study of the hybrid estimation method HyDEEP for estimating defect content
and QA effectiveness in the telecommunication domain. The specific focus of
this case study is the use of the method for gaining quantitative predictions.
This aspect has not been empirically analyzed in previous work. Among other
things, the results show that for defect content estimation, the method
performs significantly better statistically than purely data-based methods,
with a relative error of 0.3 on average (MMRE).
","[{'version': 'v1', 'created': 'Tue, 7 Jan 2014 09:56:17 GMT'}]",2014-01-08,"[['Kläs', 'Michael', ''], ['Elberzhager', 'Frank', ''], ['Münch', 'Jürgen', ''], ['Hartjes', 'Klaus', ''], ['von Graevemeyer', 'Olaf', '']]","['HyDEEP', 'Hybrid estimation', 'Effectiveness', 'Defect content']"
2884,1806.00044,Subhojeet Pramanik,"Subhojeet Pramanik, Aman Hussain",Text normalization using memory augmented neural networks,"9 pages, 10 tables, 3 figures","Speech Communication, Volume 109, 2019, Pages 15-23, ISSN
  0167-6393",10.1016/j.specom.2019.02.003,,cs.CL,http://creativecommons.org/licenses/by-sa/4.0/,"  We perform text normalization, i.e. the transformation of words from the
written to the spoken form, using a memory augmented neural network. With the
addition of dynamic memory access and storage mechanism, we present a neural
architecture that will serve as a language-agnostic text normalization system
while avoiding the kind of unacceptable errors made by the LSTM-based recurrent
neural networks. By successfully reducing the frequency of such mistakes, we
show that this novel architecture is indeed a better alternative. Our proposed
system requires significantly lesser amounts of data, training time and compute
resources. Additionally, we perform data up-sampling, circumventing the data
sparsity problem in some semiotic classes, to show that sufficient examples in
any particular class can improve the performance of our text normalization
system. Although a few occurrences of these errors still remain in certain
semiotic classes, we demonstrate that memory augmented networks with
meta-learning capabilities can open many doors to a superior text normalization
system.
","[{'version': 'v1', 'created': 'Thu, 31 May 2018 18:37:37 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Jul 2018 14:38:54 GMT'}, {'version': 'v3', 'created': 'Wed, 3 Apr 2019 18:44:30 GMT'}]",2019-04-05,"[['Pramanik', 'Subhojeet', ''], ['Hussain', 'Aman', '']]","['text normalization', 'differentiable neural computer', 'deep learning']"
2885,2010.08175,Xuanhong Chen,"Xuanhong Chen, Xirui Yan, Naiyuan Liu, Ting Qiu and Bingbing Ni",Anisotropic Stroke Control for Multiple Artists Style Transfer,ACMMM2020,ACM Multimedia 2020,10.1145/3394171.3413770,,cs.CV cs.AI,http://creativecommons.org/licenses/by-sa/4.0/,"  Though significant progress has been made in artistic style transfer,
semantic information is usually difficult to be preserved in a fine-grained
locally consistent manner by most existing methods, especially when multiple
artists styles are required to transfer within one single model. To circumvent
this issue, we propose a Stroke Control Multi-Artist Style Transfer framework.
On the one hand, we develop a multi-condition single-generator structure which
first performs multi-artist style transfer. On the one hand, we design an
Anisotropic Stroke Module (ASM) which realizes the dynamic adjustment of
style-stroke between the non-trivial and the trivial regions. ASM endows the
network with the ability of adaptive semantic-consistency among various styles.
On the other hand, we present an novel Multi-Scale Projection Discriminator} to
realize the texture-level conditional generation. In contrast to the
single-scale conditional discriminator, our discriminator is able to capture
multi-scale texture clue to effectively distinguish a wide range of artistic
styles. Extensive experimental results well demonstrate the feasibility and
effectiveness of our approach. Our framework can transform a photograph into
different artistic style oil painting via only ONE single model. Furthermore,
the results are with distinctive artistic style and retain the anisotropic
semantic information. The code is already available on github:
https://github.com/neuralchen/ASMAGAN.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2020 05:32:26 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Jun 2021 14:25:27 GMT'}]",2021-06-15,"[['Chen', 'Xuanhong', ''], ['Yan', 'Xirui', ''], ['Liu', 'Naiyuan', ''], ['Qiu', 'Ting', ''], ['Ni', 'Bingbing', '']]","['style transfer', 'non-real image rendering', 'image translation']"
2886,1804.07141,Richard McClatchey,"Barkha Javed, Richard McClatchey, Zaheer Khan, and Jetendr Shamdasani",A Provenance Framework for Policy Analytics in Smart Cities,"7 pages, 1 figure, 1 table","Proc of the International Conference on Internet of Things and Big
  Data (IoTBD 2016), pp 429-434",10.5220/0005931504290434,,cs.CY eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sustainable urban environments based on Internet of Things (IoT) technologies
require appropriate policy management. However, such policies are established
as a result of underlying, potentially complex and long-term policy making
processes. Consequently, better policies require improved and verifiable
planning processes. In order to assess and evaluate the planning process,
transparency of the system is pivotal which can be achieved by tracking the
provenance of policy making process. However, at present no system is available
that can track the complete cycle of urban planning and decision making. We
propose to capture the complete process of policy making and to investigate the
role of IoT provenance to support design-making for policy analytics and
implementation. The environment in which this research will be demonstrated is
that of Smart Cities whose requirements will drive the research process.
","[{'version': 'v1', 'created': 'Mon, 19 Mar 2018 08:33:05 GMT'}]",2018-04-20,"[['Javed', 'Barkha', ''], ['McClatchey', 'Richard', ''], ['Khan', 'Zaheer', ''], ['Shamdasani', 'Jetendr', '']]","['Smart Cities', 'Policy Making', 'Provenance', 'Policy Analytics']"
2887,1907.13419,Anton Ponomarev,"Anton Ponomarev, Julian Hofmann, Lutz Gr\""oll","Characteristics-based Simulink implementation of first-order quasilinear
  partial differential equations",Abridged and updated conference version. Accepted to SIMULTECH 2020,,10.5220/0009569001390146,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper deals with solving first-order quasilinear partial differential
equations in an online simulation environment, such as Simulink, utilizing the
well-known and well-recommended method of characteristics. Compared to the
commonly applied space discretization methods on static grids, the
characteristics-based approach provides better numerical stability. Simulink
subsystem implementing the method of characteristics is developed. It employs
Simulink's built-in solver and its zero-crossing detection algorithm to perform
simultaneous integration of a pool of characteristics as well as to create new
characteristics dynamically and discard the old ones. Numerical accuracy of the
solution thus obtained is established. The subsystem has been tested on a
full-state feedback example and produced better results than the space
discretization-based ""method of lines"". The implementation is available for
download and can be used in a wide range of models.
","[{'version': 'v1', 'created': 'Wed, 31 Jul 2019 11:18:54 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Apr 2020 15:46:33 GMT'}]",2020-07-27,"[['Ponomarev', 'Anton', ''], ['Hofmann', 'Julian', ''], ['Gröll', 'Lutz', '']]","['Partial Differential Equations', 'Simulink', 'Transport', 'Convection', 'Method of Characteristics']"
2888,1709.05227,Matthias Sperber,"Matthias Sperber, Graham Neubig, Jan Niehues, Satoshi Nakamura, Alex
  Waibel",Transcribing Against Time,"Speech Communication, Oct 2017 (preprint)",,10.1016/j.specom.2017.07.006,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the problem of manually correcting errors from an automatic
speech transcript in a cost-sensitive fashion. This is done by specifying a
fixed time budget, and then automatically choosing location and size of
segments for correction such that the number of corrected errors is maximized.
The core components, as suggested by previous research [1], are a utility model
that estimates the number of errors in a particular segment, and a cost model
that estimates annotation effort for the segment. In this work we propose a
dynamic updating framework that allows for the training of cost models during
the ongoing transcription process. This removes the need for transcriber
enrollment prior to the actual transcription, and improves correction
efficiency by allowing highly transcriber-adaptive cost modeling. We first
confirm and analyze the improvements afforded by this method in a simulated
study. We then conduct a realistic user study, observing efficiency
improvements of 15% relative on average, and 42% for the participants who
deviated most strongly from our initial, transcriber-agnostic cost model.
Moreover, we find that our updating framework can capture dynamically changing
factors, such as transcriber fatigue and topic familiarity, which we observe to
have a large influence on the transcriber's working behavior.
","[{'version': 'v1', 'created': 'Fri, 15 Sep 2017 14:19:29 GMT'}]",2017-09-18,"[['Sperber', 'Matthias', ''], ['Neubig', 'Graham', ''], ['Niehues', 'Jan', ''], ['Nakamura', 'Satoshi', ''], ['Waibel', 'Alex', '']]","['Speech transcription', 'error correction', 'cost-sensitive annotation', 'user modeling']"
2889,1809.06970,Shuochao Yao,"Shuochao Yao, Yiran Zhao, Huajie Shao, Shengzhong Liu, Dongxin Liu, Lu
  Su, Tarek Abdelzaher","FastDeepIoT: Towards Understanding and Optimizing Neural Network
  Execution Time on Mobile and Embedded Devices",Accepted by SenSys '18,,10.1145/3274783.3274840,,cs.LG cs.NI cs.PF cs.SY stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks show great potential as solutions to many sensing
application problems, but their excessive resource demand slows down execution
time, pausing a serious impediment to deployment on low-end devices. To address
this challenge, recent literature focused on compressing neural network size to
improve performance. We show that changing neural network size does not
proportionally affect performance attributes of interest, such as execution
time. Rather, extreme run-time nonlinearities exist over the network
configuration space. Hence, we propose a novel framework, called FastDeepIoT,
that uncovers the non-linear relation between neural network structure and
execution time, then exploits that understanding to find network configurations
that significantly improve the trade-off between execution time and accuracy on
mobile and embedded devices. FastDeepIoT makes two key contributions. First,
FastDeepIoT automatically learns an accurate and highly interpretable execution
time model for deep neural networks on the target device. This is done without
prior knowledge of either the hardware specifications or the detailed
implementation of the used deep learning library. Second, FastDeepIoT informs a
compression algorithm how to minimize execution time on the profiled device
without impacting accuracy. We evaluate FastDeepIoT using three different
sensing-related tasks on two mobile devices: Nexus 5 and Galaxy Nexus.
FastDeepIoT further reduces the neural network execution time by $48\%$ to
$78\%$ and energy consumption by $37\%$ to $69\%$ compared with the
state-of-the-art compression algorithms.
","[{'version': 'v1', 'created': 'Wed, 19 Sep 2018 00:43:26 GMT'}]",2018-09-20,"[['Yao', 'Shuochao', ''], ['Zhao', 'Yiran', ''], ['Shao', 'Huajie', ''], ['Liu', 'Shengzhong', ''], ['Liu', 'Dongxin', ''], ['Su', 'Lu', ''], ['Abdelzaher', 'Tarek', '']]","['Deep Learning', 'Execution Time', 'Model Compression', 'MobileComputing', 'Internet of Things']"
2890,2008.12855,Vaibhav Pandey,"Ali Rostami, Vaibhav Pandey, Nitish Nag, Vesper Wang, Ramesh Jain",Personal Food Model,,"Proceedings of the 28th ACM International Conference on Multimedia
  (MM '20), October 12--16, 2020, Seattle, WA, USA",10.1145/3394171.3414691,,cs.MM cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Food is central to life. Food provides us with energy and foundational
building blocks for our body and is also a major source of joy and new
experiences. A significant part of the overall economy is related to food. Food
science, distribution, processing, and consumption have been addressed by
different communities using silos of computational approaches. In this paper,
we adopt a person-centric multimedia and multimodal perspective on food
computing and show how multimedia and food computing are synergistic and
complementary.
  Enjoying food is a truly multimedia experience involving sight, taste, smell,
and even sound, that can be captured using a multimedia food logger. The
biological response to food can be captured using multimodal data streams using
available wearable devices. Central to this approach is the Personal Food
Model. Personal Food Model is the digitized representation of the food-related
characteristics of an individual. It is designed to be used in food
recommendation systems to provide eating-related recommendations that improve
the user's quality of life. To model the food-related characteristics of each
person, it is essential to capture their food-related enjoyment using a
Preferential Personal Food Model and their biological response to food using
their Biological Personal Food Model. Inspired by the power of 3-dimensional
color models for visual processing, we introduce a 6-dimensional taste-space
for capturing culinary characteristics as well as personal preferences. We use
event mining approaches to relate food with other life and biological events to
build a predictive model that could also be used effectively in emerging food
recommendation systems.
","[{'version': 'v1', 'created': 'Fri, 28 Aug 2020 21:36:09 GMT'}]",2020-09-01,"[['Rostami', 'Ali', ''], ['Pandey', 'Vaibhav', ''], ['Nag', 'Nitish', ''], ['Wang', 'Vesper', ''], ['Jain', 'Ramesh', '']]","['Food Computing', 'Personal Food Model', 'Food Recommendation Systems', 'Taste Space', 'Event Mining', 'Personicle']"
2891,1909.10731,Daniel Hienert,"Daniel Hienert, Dagmar Kern, Katarina Boland, Benjamin Zapilko, Peter
  Mutschke","A Digital Library for Research Data and Related Information in the
  Social Sciences",,"In Proceedings of 2019 ACM/IEEE Joint Conference on Digital
  Libraries (JCDL), 148-157",10.1109/JCDL.2019.00030,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the social sciences, researchers search for information on the Web, but
this is most often distributed on different websites, search portals, digital
libraries, data archives, and databases. In this work, we present an integrated
search system for social science information that allows finding information
around research data in a single digital library. Users can search for research
data sets, publications, survey variables, questions from questionnaires,
survey instruments, and tools. Information items are linked to each other so
that users can see, for example, which publications contain data citations to
research data. The integration and linking of different kinds of information
increase their visibility so that it is easier for researchers to find
information for re-use. In a log-based usage study, we found that users search
across different information types, that search sessions contain a high rate of
positive signals and that link information is often explored.
","[{'version': 'v1', 'created': 'Tue, 24 Sep 2019 06:50:55 GMT'}]",2019-09-25,"[['Hienert', 'Daniel', ''], ['Kern', 'Dagmar', ''], ['Boland', 'Katarina', ''], ['Zapilko', 'Benjamin', ''], ['Mutschke', 'Peter', '']]","['Digital Library', 'Research Data', 'Open Data', 'Social Sciences']"
2892,1007.5126,Secretary Ijsea,"Bee Bee Chua (1) and June Verner (2) ((1) University of Technology
  Sydney, Australia and (2) University of New South Wales, Australia)",Examining Requirements Change Rework Effort: A Study,"17 pages, 8 figures","International Journal of Software Engineering & Applications 1.3
  (2010) 48-64",10.5121/ijsea.2010.1304,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Although software managers are generally good at new project estimation,
their experience of scheduling rework tends to be poor. Inconsistent or
incorrect effort estimation can increase the risk that the completion time for
a project will be problematic. To continually alter software maintenance
schedules during software maintenance is a daunting task. Our proposed
framework, validated in a case study confirms that the variables resulting from
requirements changes suffer from a number of problems, e.g., the coding used,
end user involvement and user documentation. Our results clearly show a
significant impact on rework effort as a result of unexpected errors that
correlate with 1) weak characteristics and attributes as described in the
program's source lines of code, especially in data declarations and data
statements, 2) lack of communication between developers and users on a change
effects, and 3) unavailability of user documentation. To keep rework effort
under control, new criteria in change request forms are proposed. These
criteria are shown in a proposed framework; the more case studies that are
validated, the more reliable the result will be in determining the outcome of
effort rework estimation.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2010 07:02:17 GMT'}]",2010-07-30,"[['Chua', 'Bee Bee', ''], ['Verner', 'June', '']]","['requirements change', 'effort rework', 'unexpected errors', 'weak characteristics and attributes', 'change request forms']"
2893,1405.6081,S.M. Ferdous,"S. M. Ferdous, M. Sohel Rahman","An Integer Programming Formulation of the Minimum Common String
  Partition problem",arXiv admin note: text overlap with arXiv:1401.4539,,10.1371/journal.pone.0130266,,cs.DM math.CO math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of finding a minimum common partition of two strings
(MCSP). The problem has its application in genome comparison. MCSP problem is
proved to be NP-hard. In this paper, we develop an Integer Programming (IP)
formulation for the problem and implement it. The experimental results are
compared with the previous state-of-the-art algorithms and are found to be
promising.
","[{'version': 'v1', 'created': 'Fri, 23 May 2014 14:43:11 GMT'}]",2015-06-22,"[['Ferdous', 'S. M.', ''], ['Rahman', 'M. Sohel', '']]","['Integer Programming', 'Stringology', 'Genome Sequencing', 'Combinatorial Optimization', 'String partition']"
2894,2104.12349,Stephen MacDonell,"Amjed Tahir, Kwabena E. Bennin, Stephen G. MacDonell and Stephen
  Marsland",Revisiting the size effect in software fault prediction models,"Conference paper, 11 pages, 8 figures, 7 tables","Proceedings of the 12th International Symposium on Empirical
  Software Engineering and Measurement (ESEM2018). Oulu, Finland, ACM Press,
  pp.1- 10 (Article 23)",10.1145/3239235.3239243,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  BACKGROUND: In object oriented (OO) software systems, class size has been
acknowledged as having an indirect effect on the relationship between certain
artifact characteristics, captured via metrics, and faultproneness, and
therefore it is recommended to control for size when designing fault prediction
models. AIM: To use robust statistical methods to assess whether there is
evidence of any true effect of class size on fault prediction models. METHOD:
We examine the potential mediation and moderation effects of class size on the
relationships between OO metrics and number of faults. We employ regression
analysis and bootstrapping-based methods to investigate the mediation and
moderation effects in two widely-used datasets comprising seventeen systems.
RESULTS: We find no strong evidence of a significant mediation or moderation
effect of class size on the relationships between OO metrics and faults. In
particular, size appears to have a more significant mediation effect on CBO and
Fan-out than other metrics, although the evidence is not consistent in all
examined systems. On the other hand, size does appear to have a significant
moderation effect on WMC and CBO in most of the systems examined. Again, the
evidence provided is not consistent across all examined systems CONCLUSION: We
are unable to confirm if class size has a significant mediation or moderation
effect on the relationships between OO metrics and the number of faults. We
contend that class size does not fully explain the relationships between OO
metrics and the number of faults, and it does not always affect the
strength/magnitude of these relationships. We recommend that researchers
consider the potential mediation and moderation effect of class size when
building their prediction models, but this should be examined independently for
each system.
","[{'version': 'v1', 'created': 'Mon, 26 Apr 2021 05:01:04 GMT'}]",2021-04-27,"[['Tahir', 'Amjed', ''], ['Bennin', 'Kwabena E.', ''], ['MacDonell', 'Stephen G.', ''], ['Marsland', 'Stephen', '']]","['fault prediction', 'object-oriented metrics', 'software quality', 'mediation', 'moderation']"
2895,1809.07048,Jose Carballo,"Jose A. Carballo, Javier Bonilla, Manuel Berenguel, Jes\'us
  Fern\'andez-Reche, Gin\'es Garc\'ia","New approach for solar tracking systems based on computer vision, low
  cost hardware and deep learning","12 pages, 10 figures,","Carballo, J. A., Bonilla, J., Berenguel, M., Fernandez-Reche, J.,
  & Garcia, G. (2018). New approach for solar tracking systems based on
  computer vision, low cost hardware and deep learning. Renewable Energy",10.1016/j.renene.2018.08.101,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, a new approach for Sun tracking systems is presented. Due to
the current system limitations regarding costs and operational problems, a new
approach based on low cost, computer vision open hardware and deep learning has
been developed. The preliminary tests carried out successfully in Plataforma
solar de Almeria (PSA), reveal the great potential and show the new approach as
a good alternative to traditional systems. The proposed approach can provide
key variables for the Sun tracking system control like cloud movements
prediction, block and shadow detection, atmospheric attenuation or measures of
concentrated solar radiation, which can improve the control strategies of the
system and therefore the system performance.
","[{'version': 'v1', 'created': 'Wed, 19 Sep 2018 08:09:04 GMT'}]",2018-09-21,"[['Carballo', 'Jose A.', ''], ['Bonilla', 'Javier', ''], ['Berenguel', 'Manuel', ''], ['Fernández-Reche', 'Jesús', ''], ['García', 'Ginés', '']]","['Solar energy', 'Sun tracking', 'computer vision', 'deep learning', 'Convolutional Neural Networks']"
2896,1811.00919,Sajjad Arshad,"Sajjad Arshad, Amin Kharraz, William Robertson","Identifying Extension-based Ad Injection via Fine-grained Web Content
  Provenance","International Symposium on Research in Attacks, Intrusions and
  Defenses (RAID), Paris, France, September 2016",,10.1007/978-3-319-45719-2_19,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Extensions provide useful additional functionality for web browsers, but are
also an increasingly popular vector for attacks. Due to the high degree of
privilege extensions can hold, extensions have been abused to inject
advertisements into web pages that divert revenue from content publishers and
potentially expose users to malware. Users are often unaware of such practices,
believing the modifications to the page originate from publishers.
Additionally, automated identification of unwanted third-party modifications is
fundamentally difficult, as users are the ultimate arbiters of whether content
is undesired in the absence of outright malice.
  To resolve this dilemma, we present a fine-grained approach to tracking the
provenance of web content at the level of individual DOM elements. In
conjunction with visual indicators, provenance information can be used to
reliably determine the source of content modifications, distinguishing
publisher content from content that originates from third parties such as
extensions. We describe a prototype implementation of the approach called
OriginTracer for Chromium, and evaluate its effectiveness, usability, and
performance overhead through a user study and automated experiments. The
results demonstrate a statistically significant improvement in the ability of
users to identify unwanted third-party content such as injected ads with modest
performance overhead.
","[{'version': 'v1', 'created': 'Fri, 2 Nov 2018 15:10:25 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Feb 2020 00:20:59 GMT'}]",2020-02-17,"[['Arshad', 'Sajjad', ''], ['Kharraz', 'Amin', ''], ['Robertson', 'William', '']]","['Web security', 'Ad injection', 'Browser extension']"
2897,1510.08893,Lorenzo Baraldi,"Lorenzo Baraldi, Costantino Grana and Rita Cucchiara",A Deep Siamese Network for Scene Detection in Broadcast Videos,ACM Multimedia 2015,,10.1145/2733373.2806316,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a model that automatically divides broadcast videos into coherent
scenes by learning a distance measure between shots. Experiments are performed
to demonstrate the effectiveness of our approach by comparing our algorithm
against recent proposals for automatic scene segmentation. We also propose an
improved performance measure that aims to reduce the gap between numerical
evaluation and expected results, and propose and release a new benchmark
dataset.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2015 20:34:15 GMT'}]",2015-11-02,"[['Baraldi', 'Lorenzo', ''], ['Grana', 'Costantino', ''], ['Cucchiara', 'Rita', '']]","['Deep Learning', 'Scene Segmentation', 'Video Re-use']"
2898,1905.03136,Georg Hager,"Dominik Ernst, Georg Hager, Jonas Thies, Gerhard Wellein","Performance Engineering for Real and Complex Tall & Skinny Matrix
  Multiplication Kernels on GPUs","12 pages, 22 figures. Extended version of arXiv:1905.03136v1 for
  journal submission",,10.1007/978-3-030-43229-4_43,,cs.MS cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  General matrix-matrix multiplications with double-precision real and complex
entries (DGEMM and ZGEMM) in vendor-supplied BLAS libraries are best optimized
for square matrices but often show bad performance for tall & skinny matrices,
which are much taller than wide. NVIDIA's current CUBLAS implementation
delivers only a fraction of the potential performance as indicated by the
roofline model in this case. We describe the challenges and key characteristics
of an implementation that can achieve close to optimal performance. We further
evaluate different strategies of parallelization and thread distribution, and
devise a flexible, configurable mapping scheme. To ensure flexibility and allow
for highly tailored implementations we use code generation combined with
autotuning. For a large range of matrix sizes in the domain of interest we
achieve at least 2/3 of the roofline performance and often substantially
outperform state-of-the art CUBLAS results on an NVIDIA Volta GPGPU.
","[{'version': 'v1', 'created': 'Wed, 8 May 2019 15:11:46 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Feb 2020 15:54:31 GMT'}]",2020-06-25,"[['Ernst', 'Dominik', ''], ['Hager', 'Georg', ''], ['Thies', 'Jonas', ''], ['Wellein', 'Gerhard', '']]","['performance engineering', 'complex', 'tall & skinny', 'matrix multiplication', 'CUDA', 'GPU']"
2899,1403.2372,Mehdi Naseriparsa,"Mehdi Naseriparsa, Amir-Masoud Bidgoli, Touraj Varaee","A Hybrid Feature Selection Method to Improve Performance of a Group of
  Classification Algorithms","8 pages. arXiv admin note: substantial text overlap with
  arXiv:1403.1946; and text overlap with arXiv:1106.1813 by other authors","International Journal of Computer Applications,Vol 69,No 17,pp
  28-35,2013",10.5120/12065-8172,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper a hybrid feature selection method is proposed which takes
advantages of wrapper subset evaluation with a lower cost and improves the
performance of a group of classifiers. The method uses combination of sample
domain filtering and resampling to refine the sample domain and two feature
subset evaluation methods to select reliable features. This method utilizes
both feature space and sample domain in two phases. The first phase filters and
resamples the sample domain and the second phase adopts a hybrid procedure by
information gain, wrapper subset evaluation and genetic search to find the
optimal feature space. Experiments carried out on different types of datasets
from UCI Repository of Machine Learning databases and the results show a rise
in the average performance of five classifiers (Naive Bayes, Logistic,
Multilayer Perceptron, Best First Decision Tree and JRIP) simultaneously and
the classification error for these classifiers decreases considerably. The
experiments also show that this method outperforms other feature selection
methods with a lower cost.
","[{'version': 'v1', 'created': 'Sat, 8 Mar 2014 08:04:29 GMT'}]",2014-03-12,"[['Naseriparsa', 'Mehdi', ''], ['Bidgoli', 'Amir-Masoud', ''], ['Varaee', 'Touraj', '']]","['Feature Selection', 'Resampling', 'Information Gain', 'Wrapper Subset  Evaluation']"
2900,1112.3791,Yaser Sadra,"Sodeif Ahadpour, Yaser Sadra, Zahra ArastehFard",A Novel Chaotic Image Encryption using Generalized Threshold Function,"7 pages, 5 figures, Published in international Journal of Computer
  Applications (March 2012)","International Journal of Computer Applications 42(18):25-31, March
  2012",10.5120/5794-8110,,cs.CR physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, after reviewing the main points of image encryption and
threshold function, we introduce the methods of chaotic image encryption based
on pseudorandom bit padding that the bits be generated by the novel generalized
threshold function (segmentation and self-similarity) methods. These methods
decrease periodic effect of the ergodic dynamical systems in randomness of the
chaotic image encryption. The essential idea of this paper is that given
threshold functions of the ergodic dynamical systems. To evaluate the security
of the cipher image of this scheme, the key space analysis, the correlation of
two adjacent pixels and differential attack were performed. This scheme tries
to improve the problem of failure of encryption such as small key space and
level of security.
","[{'version': 'v1', 'created': 'Fri, 16 Dec 2011 12:43:24 GMT'}, {'version': 'v2', 'created': 'Sat, 31 Mar 2012 17:59:07 GMT'}]",2012-04-03,"[['Ahadpour', 'Sodeif', ''], ['Sadra', 'Yaser', ''], ['ArastehFard', 'Zahra', '']]","['Chaotic function', 'Threshold function', 'Bit Padding', 'PRNG']"
2901,1706.05764,Fenglong Ma,"Fenglong Ma, Radha Chitta, Jing Zhou, Quanzeng You, Tong Sun, Jing Gao","Dipole: Diagnosis Prediction in Healthcare via Attention-based
  Bidirectional Recurrent Neural Networks",,,10.1145/3097983.3098088,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predicting the future health information of patients from the historical
Electronic Health Records (EHR) is a core research task in the development of
personalized healthcare. Patient EHR data consist of sequences of visits over
time, where each visit contains multiple medical codes, including diagnosis,
medication, and procedure codes. The most important challenges for this task
are to model the temporality and high dimensionality of sequential EHR data and
to interpret the prediction results. Existing work solves this problem by
employing recurrent neural networks (RNNs) to model EHR data and utilizing
simple attention mechanism to interpret the results. However, RNN-based
approaches suffer from the problem that the performance of RNNs drops when the
length of sequences is large, and the relationships between subsequent visits
are ignored by current RNN-based approaches. To address these issues, we
propose {\sf Dipole}, an end-to-end, simple and robust model for predicting
patients' future health information. Dipole employs bidirectional recurrent
neural networks to remember all the information of both the past visits and the
future visits, and it introduces three attention mechanisms to measure the
relationships of different visits for the prediction. With the attention
mechanisms, Dipole can interpret the prediction results effectively. Dipole
also allows us to interpret the learned medical code representations which are
confirmed positively by medical experts. Experimental results on two real world
EHR datasets show that the proposed Dipole can significantly improve the
prediction accuracy compared with the state-of-the-art diagnosis prediction
approaches and provide clinically meaningful interpretation.
","[{'version': 'v1', 'created': 'Mon, 19 Jun 2017 02:30:58 GMT'}]",2017-06-20,"[['Ma', 'Fenglong', ''], ['Chitta', 'Radha', ''], ['Zhou', 'Jing', ''], ['You', 'Quanzeng', ''], ['Sun', 'Tong', ''], ['Gao', 'Jing', '']]","['Healthcare informatics', 'bidirectional recurrent neural networks', 'atention mechanism']"
2902,1403.5843,Jedidiah McClurg,"Jedidiah McClurg, Hossein Hojjat, Pavol Cerny, Nate Foster",Efficient Synthesis of Network Updates,,,10.1145/2737924.2737980,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software-defined networking (SDN) is revolutionizing the networking industry,
but current SDN programming platforms do not provide automated mechanisms for
updating global configurations on the fly. Implementing updates by hand is
challenging for SDN programmers because networks are distributed systems with
hundreds or thousands of interacting nodes. Even if initial and final
configurations are correct, naively updating individual nodes can lead to
incorrect transient behaviors, including loops, black holes, and access control
violations. This paper presents an approach for automatically synthesizing
updates that are guaranteed to preserve specified properties. We formalize
network updates as a distributed programming problem and develop a synthesis
algorithm based on counterexample-guided search and incremental model checking.
We describe a prototype implementation, and present results from experiments on
real-world topologies and properties demonstrating that our tool scales to
updates involving over one-thousand nodes.
","[{'version': 'v1', 'created': 'Mon, 24 Mar 2014 03:34:49 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Dec 2014 07:31:19 GMT'}, {'version': 'v3', 'created': 'Thu, 16 Apr 2015 20:50:29 GMT'}]",2015-04-20,"[['McClurg', 'Jedidiah', ''], ['Hojjat', 'Hossein', ''], ['Cerny', 'Pavol', ''], ['Foster', 'Nate', '']]","['synthesis', 'verification', 'model checking', 'LTL', 'networkupdates', 'software-defined networking', 'SDN']"
2903,1701.04901,Kedar Kulkarni,Kedar Kulkarni and Adrish Banerjee,"Multi-channel Sensing And Resource Allocation in Energy Constrained
  Cognitive Radio Networks",Accepted for publication in Physical Communication,,10.1016/j.phycom.2017.01.003.,,cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a cognitive radio network in a multi-channel licensed
environment. Secondary user transmits in a channel if the channel is sensed to
be vacant. This results in a tradeoff between sensing time and transmission
time. When secondary users are energy constrained, energy available for
transmission is less if more energy is used in sensing. This gives rise to an
energy tradeoff. For multiple primary channels, secondary users must decide
appropriate sensing time and transmission power in each channel to maximize
average aggregate-bit throughput in each frame duration while ensuring
quality-of-service of primary users. Considering time and energy as limited
resources, we formulate this problem as a resource allocation problem.
Initially a single secondary user scenario is considered and solution is
obtained using decomposition and alternating optimization techniques. Later we
extend the analysis for the case of multiple secondary users. Simulation
results are presented to study effect of channel occupancy, fading and energy
availability on performance of proposed method.
","[{'version': 'v1', 'created': 'Tue, 17 Jan 2017 23:35:37 GMT'}]",2017-01-24,"[['Kulkarni', 'Kedar', ''], ['Banerjee', 'Adrish', '']]","['Cognitive radio', 'energy constrained networks', 'resource allocation', 'sensing-throughput tradeoff']"
2904,1408.3309,Nam Nguyen Nam,Nguyen H. Nam,"Utilizing the Active and Collaborative Learning Model in the
  Introductory Physics Course",,"Journal of Education & Learning, Vol.3 No.3 September, 2014,
  pp.108-124",10.5539/jel.v3n3p108,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Model of active and collaborative learning applied in training specific
subject makes clear advantage due to the goals of knowledge, skills that
students got to develop successful future job. The author exploits the learning
management system of Hanoi National University of Education to establish a
learning environment in the Introductory Physics course Part 2, which supports
to the blended learning, for the 1st year student. The method of pattern
languages is taken to redesign learning content in the framework of ACLM, which
focused on analysing real-life application and doing exercises, with the
support of information and communication technology. Both formative and
summative assessments were used to evaluate competency of students.
","[{'version': 'v1', 'created': 'Thu, 14 Aug 2014 14:59:06 GMT'}]",2014-08-15,"[['Nam', 'Nguyen H.', '']]","['pedagogy', 'active and collaborative learning', 'technology education', 'introductory physics', 'training credit', 'learning environment']"
2905,1601.08116,Tiago Azevedo,"Tiago Azevedo, Rosaldo J. F. Rossetti, Jorge G. Barbosa","Densifying the sparse cloud SimSaaS: The need of a synergy among
  agent-directed simulation, SimSaaS and HLA",,"Proceedings of the 5th International Conference on Simulation and
  Modeling Methodologies, Technologies and Applications (2015) 172-177",10.5220/0005542801720177,,cs.MA cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Modelling & Simulation (M&S) is broadly used in real scenarios where making
physical modifications could be highly expensive. With the so-called Simulation
Software-as-a-Service (SimSaaS), researchers could take advantage of the huge
amount of resource that cloud computing provides. Even so, studying and
analysing a problem through simulation may need several simulation tools, hence
raising interoperability issues. Having this in mind, IEEE developed a standard
for interoperability among simulators named High Level Architecture (HLA).
Moreover, the multi-agent system approach has become recognised as a convenient
approach for modelling and simulating complex systems. Despite all the recent
works and acceptance of these technologies, there is still a great lack of work
regarding synergies among them. This paper shows by means of a literature
review this lack of work or, in other words, the sparse Cloud SimSaaS. The
literature review and the resulting taxonomy are the main contributions of this
paper, as they provide a research agenda illustrating future research
opportunities and trends.
","[{'version': 'v1', 'created': 'Fri, 29 Jan 2016 14:11:37 GMT'}]",2016-02-01,"[['Azevedo', 'Tiago', ''], ['Rossetti', 'Rosaldo J. F.', ''], ['Barbosa', 'Jorge G.', '']]","['Agent-directed simulation', 'Agent-supported simulation', 'HLA', 'High Level Architecture', 'Cloud', 'SimSaaS', 'Simulation Software-as-a-service']"
2906,1608.06690,Dong Liu,"Yuanying Dai, Dong Liu, Feng Wu","A Convolutional Neural Network Approach for Post-Processing in HEVC
  Intra Coding",MMM 2017,,10.1007/978-3-319-51811-4_3,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lossy image and video compression algorithms yield visually annoying
artifacts including blocking, blurring, and ringing, especially at low
bit-rates. To reduce these artifacts, post-processing techniques have been
extensively studied. Recently, inspired by the great success of convolutional
neural network (CNN) in computer vision, some researches were performed on
adopting CNN in post-processing, mostly for JPEG compressed images. In this
paper, we present a CNN-based post-processing algorithm for High Efficiency
Video Coding (HEVC), the state-of-the-art video coding standard. We redesign a
Variable-filter-size Residue-learning CNN (VRCNN) to improve the performance
and to accelerate network training. Experimental results show that using our
VRCNN as post-processing leads to on average 4.6% bit-rate reduction compared
to HEVC baseline. The VRCNN outperforms previously studied networks in
achieving higher bit-rate reduction, lower memory cost, and multiplied
computational speedup.
","[{'version': 'v1', 'created': 'Wed, 24 Aug 2016 02:15:06 GMT'}, {'version': 'v2', 'created': 'Sat, 29 Oct 2016 11:23:20 GMT'}]",2017-02-21,"[['Dai', 'Yuanying', ''], ['Liu', 'Dong', ''], ['Wu', 'Feng', '']]","['Artifact reduction', 'Convolutional neural network (CNN)', 'High Efficiency Video Coding (HEVC)', 'Intra coding', 'Post-processing']"
2907,1303.2365,Rados{\l}aw Michalski,"Jaros{\l}aw Jankowski, Sylwia Ciuberek, Anita Zbieg, Rados{\l}aw
  Michalski",Studying Paths of Participation in Viral Diffusion Process,"In proceedings of the 4th International Conference on Social
  Informatics, SocInfo 2012","Jankowski, J., Ciuberek, S., Zbieg, A., Michalski, R.: Studying
  Paths of Participation in Viral Diffusion Process. K. Aberer et al. (Eds.):
  LNCS, vol. 7710, pp. 503-516, Springer, Berlin Heidelberg (2012)",10.1007/978-3-642-35386-4_37,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Authors propose a conceptual model of participation in viral diffusion
process composed of four stages: awareness, infection, engagement and action.
To verify the model it has been applied and studied in the virtual social chat
environment settings. The study investigates the behavioral paths of actions
that reflect the stages of participation in the diffusion and presents
shortcuts, that lead to the final action, i.e. the attendance in a virtual
event. The results show that the participation in each stage of the process
increases the probability of reaching the final action. Nevertheless, the
majority of users involved in the virtual event did not go through each stage
of the process but followed the shortcuts. That suggests that the viral
diffusion process is not necessarily a linear sequence of human actions but
rather a dynamic system.
","[{'version': 'v1', 'created': 'Sun, 10 Mar 2013 19:24:25 GMT'}]",2013-03-12,"[['Jankowski', 'Jarosław', ''], ['Ciuberek', 'Sylwia', ''], ['Zbieg', 'Anita', ''], ['Michalski', 'Radosław', '']]","['information diffusion', 'online social networks', 'participation model', 'multistage analysis']"
2908,1902.09041,Cagri Ozcaglar,"Cagri Ozcaglar, Sahin Geyik, Brian Schmitz, Prakhar Sharma, Alex
  Shelkovnykov, Yiming Ma, Erik Buchanan",Entity Personalized Talent Search Models with Tree Interaction Features,This paper has been accepted for publication at ACM WWW 2019,,10.1145/3308558.3313672,,cs.AI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Talent Search systems aim to recommend potential candidates who are a good
match to the hiring needs of a recruiter expressed in terms of the recruiter's
search query or job posting. Past work in this domain has focused on linear and
nonlinear models which lack preference personalization in the user-level due to
being trained only with globally collected recruiter activity data. In this
paper, we propose an entity-personalized Talent Search model which utilizes a
combination of generalized linear mixed (GLMix) models and gradient boosted
decision tree (GBDT) models, and provides personalized talent recommendations
using nonlinear tree interaction features generated by the GBDT. We also
present the offline and online system architecture for the productionization of
this hybrid model approach in our Talent Search systems. Finally, we provide
offline and online experiment results benchmarking our entity-personalized
model with tree interaction features, which demonstrate significant
improvements in our precision metrics compared to globally trained
non-personalized models.
","[{'version': 'v1', 'created': 'Mon, 25 Feb 2019 00:00:45 GMT'}]",2019-02-26,"[['Ozcaglar', 'Cagri', ''], ['Geyik', 'Sahin', ''], ['Schmitz', 'Brian', ''], ['Sharma', 'Prakhar', ''], ['Shelkovnykov', 'Alex', ''], ['Ma', 'Yiming', ''], ['Buchanan', 'Erik', '']]","['Search ranking', 'Personalization', 'Nonlinear personalized models', 'GLMix models', 'XGBoost']"
2909,1709.04749,Pekka Abrahamsson,"Carmine Giardino, Xiaofeng Wang and Pekka Abrahamsson",Why Early-Stage Software Startups Fail: A Behavioral Framework,Authors' version of a published article,"In: Lassenius C., Smolander K. (eds) Software Business. Towards
  Continuous Value Delivery. ICSOB 2014. Springer, Cham",10.1007/978-3-319-08738-2_3,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software startups are newly created companies with little operating history
and oriented towards producing cutting-edge products. As their time and
resources are extremely scarce, and one failed project can put them out of
business, startups need effective practices to face with those unique
challenges. However, only few scientific studies attempt to address
characteristics of failure, especially during the early- stage. With this study
we aim to raise our understanding of the failure of early-stage software
startup companies. This state-of-practice investigation was performed using a
literature review followed by a multiple-case study approach. The results
present how inconsistency between managerial strategies and execution can lead
to failure by means of a behavioral framework. Despite strategies reveal the
first need to understand the problem/solution fit, actual executions prioritize
the development of the product to launch on the market as quickly as possible
to verify product/market fit, neglecting the necessary learning process.
","[{'version': 'v1', 'created': 'Thu, 14 Sep 2017 13:02:20 GMT'}]",2017-09-15,"[['Giardino', 'Carmine', ''], ['Wang', 'Xiaofeng', ''], ['Abrahamsson', 'Pekka', '']]","['Software startups', 'customer development', 'lean startup']"
2910,1609.07128,Philipp Fortenbacher,"Philipp Fortenbacher, Andreas Ulbig, G\""oran Andersson","Optimal Placement and Sizing of Distributed Battery Storage in Low
  Voltage Grids using Receding Horizon Control Strategies",,,10.1109/TPWRS.2017.2746261,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a novel methodology for leveraging Receding Horizon
Control (RHC), also known as Model Predictive Control (MPC) strategies for
distributed battery storage in a planning problem using a Benders decomposition
technique. Longer prediction horizons lead to better storage placement
strategies but also higher computational complexity that can quickly become
computationally prohibitive. The here proposed MPC strategy in conjunction with
a Benders decomposition technique effectively reduces the computational
complexity to a manageable level. We use the CIGRE low voltage (LV) benchmark
grid as a case study for solving an optimal placement and sizing problem for
different control strategies with different MPC prediction horizons. The
objective of the MPC strategy is to maximize the photovoltaic (PV) utilization
and minimize battery degradation in a local residential area, while satisfying
all grid constraints. For this case study we show that the economic value of
battery storage is higher when using MPC based storage control strategies than
when using heuristic storage control strategies, because MPC strategies
explicitly exploit the value of forecast information. The economic merit of
this approach can be further increased by explicitly incorporating a battery
degradation model in the MPC strategy.
","[{'version': 'v1', 'created': 'Thu, 22 Sep 2016 19:48:19 GMT'}, {'version': 'v2', 'created': 'Sat, 24 Sep 2016 09:41:28 GMT'}, {'version': 'v3', 'created': 'Thu, 16 Mar 2017 13:11:23 GMT'}, {'version': 'v4', 'created': 'Fri, 25 Aug 2017 14:41:42 GMT'}]",2017-08-28,"[['Fortenbacher', 'Philipp', ''], ['Ulbig', 'Andreas', ''], ['Andersson', 'Göran', '']]","['power systems', 'predictive control', 'energy storage']"
2911,1005.4882,Rumi Ghosh,Rumi Ghosh and Kristina Lerman,Predicting Influential Users in Online Social Networks,,"The fourth SNA-KDD Workshop, Held in conjunction with The 16th ACM
  SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD
  2010)",,,cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Who are the influential people in an online social network? The answer to
this question depends not only on the structure of the network, but also on
details of the dynamic processes occurring on it. We classify these processes
as conservative and non-conservative. A random walk on a network is an example
of a conservative dynamic process, while information spread is
non-conservative. The influence models used to rank network nodes can be
similarly classified, depending on the dynamic process they implicitly emulate.
We claim that in order to correctly rank network nodes, the influence model has
to match the details of the dynamic process. We study a real-world network on
the social news aggregator Digg, which allows users to post and vote for news
stories. We empirically define influence as the number of in-network votes a
user's post generates. This influence measure, and the resulting ranking,
arises entirely from the dynamics of voting on Digg, which represents
non-conservative information flow.
  We then compare predictions of different influence models with this empirical
estimate of influence. The results show that non-conservative models are better
able to predict influential users on Digg. We find that normalized
alpha-centrality metric turns out to be one of the best predictors of
influence. We also present a simple algorithm for computing this metric and the
associated mathematical formulation and analytical proofs.
","[{'version': 'v1', 'created': 'Wed, 26 May 2010 17:17:11 GMT'}]",2010-05-27,"[['Ghosh', 'Rumi', ''], ['Lerman', 'Kristina', '']]","['influence', 'centrality', 'networks']"
2912,1111.6735,Hareesh K,Hareesh.K and Manjaiah D.H,"Peer-to-Peer Live Streaming and Video On Demand Design Issues and its
  Challenges","International Journal of Peer to Peer Networks (IJP2P), Vol.2, No.4,
  October 2011",,10.5121/ijp2p.2011.2401,,cs.NI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Peer-to-Peer Live streaming and Video on Demand is the most popular media
applications over the Internet in recent years. These systems reduce the load
on the server and provide a scalable content distribution. A new paradigm of
P2P network collaborates to build large distributed video applications on
existing networks .But, the problem of designing the system are at par with the
P2P media streaming, live and Video on demand systems. Hence a comprehensive
design comparison is needed to build such kind of system architecture.
Therefore, in this paper we elaborately studied the traditional approaches for
P2P streaming architectures, and its critical design issues, as well as
practicable challenges. Thus, our studies in this paper clearly point the
tangible design issues and its challenges, and other intangible issues for
providing P2P VoD services.
","[{'version': 'v1', 'created': 'Tue, 29 Nov 2011 09:06:57 GMT'}]",2011-11-30,"[['K', 'Hareesh.', ''], ['H', 'Manjaiah D.', '']]","['Video on demand (VoD)', 'Peer to Peer (P2P)', 'Live streaming', 'Tree and  Mesh Topology']"
2913,1309.1271,EPTCS,"Maurice Margenstern (Universit\'e de Lorraine), K.G. Subramamian
  (Universiti Sains Malaysia)",Hyperbolic tilings and formal language theory,"In Proceedings MCU 2013, arXiv:1309.1043","EPTCS 128, 2013, pp. 126-136",10.4204/EPTCS.128.18,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we try to give the appropriate class of languages to which
belong various objects associated with tessellations in the hyperbolic plane.
","[{'version': 'v1', 'created': 'Thu, 5 Sep 2013 08:08:01 GMT'}]",2013-09-06,"[['Margenstern', 'Maurice', '', 'Université de Lorraine'], ['Subramamian', 'K. G.', '', 'Universiti Sains Malaysia']]","['pushdown automata', 'iterated pushdown automata', 'tilings', 'hyperbolic plane', 'tessellations']"
2914,2001.04348,Christine Bauer,Christine Bauer and Eva Zangerle,Leveraging Multi-Method Evaluation for Multi-Stakeholder Settings,"3 pages, ImpactRS 2019, Copenhagen, Denmark","1st Workshop on the Impact of Recommender Systems (ImpactRS 2019),
  co-located with 13th ACM Conference on Recommender Systems (ACM RecSys 2019),
  ceur-ws.org, Vol 2462, Short 3",,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we focus on recommendation settings with multiple stakeholders
with possibly varying goals and interests, and argue that a single evaluation
method or measure is not able to evaluate all relevant aspects in such a
complex setting. We reason that employing a multi-method evaluation, where
multiple evaluation methods or measures are combined and integrated, allows for
getting a richer picture and prevents blind spots in the evaluation outcome.
","[{'version': 'v1', 'created': 'Sat, 14 Dec 2019 21:45:28 GMT'}]",2020-01-14,"[['Bauer', 'Christine', ''], ['Zangerle', 'Eva', '']]","['recommender systems', 'evaluation', 'multi-methods', 'multi-stakeholder', 'user experience']"
2915,1510.06585,Herv\'e Paulino,"F\'abio Soldado, Fernando Alexandre, Herv\'e Paulino","Execution of Compound Multi-Kernel OpenCL Computations in
  Multi-CPU/Multi-GPU Environments","in Concurrency Computat.: Pract. Exper., 2015",,10.1002/cpe.3612,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current computational systems are heterogeneous by nature, featuring a
combination of CPUs and GPUs. As the latter are becoming an established
platform for high-performance computing, the focus is shifting towards the
seamless programming of these hybrid systems as a whole. The distinct nature of
the architectural and execution models in place raises several challenges, as
the best hardware configuration is behaviour and workload dependent. In this
paper, we address the execution of compound, multi-kernel, OpenCL computations
in multi-CPU/multi-GPU environments. We address how these computations may be
efficiently scheduled onto the target hardware, and how the system may adapt
itself to changes in the workload to process and to fluctuations in the CPU's
load. An experimental evaluation attests the performance gains obtained by the
conjoined use of the CPU and GPU devices, when compared to GPU-only executions,
and also by the use of data-locality optimizations in CPU environments.
","[{'version': 'v1', 'created': 'Thu, 22 Oct 2015 11:55:04 GMT'}]",2015-10-23,"[['Soldado', 'Fábio', ''], ['Alexandre', 'Fernando', ''], ['Paulino', 'Hervé', '']]","['Heterogeneous Computing', 'GPU computing', 'Single-System View', 'OpenCL']"
2916,2105.07782,B\'erenger Bramas,B\'erenger Bramas,"A fast vectorized sorting implementation based on the ARM scalable
  vector extension (SVE)","https://gitlab.inria.fr/bramas/arm-sve-sort
  https://peerj.com/articles/cs-769/",PeerJ Computer Science (2021),10.7717/peerj-cs.769,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  The way developers implement their algorithms and how these implementations
behave on modern CPUs are governed by the design and organization of these. The
vectorization units (SIMD) are among the few CPUs' parts that can and must be
explicitly controlled. In the HPC community, the x86 CPUs and their
vectorization instruction sets were de-facto the standard for decades. Each new
release of an instruction set was usually a doubling of the vector length
coupled with new operations. Each generation was pushing for adapting and
improving previous implementations. The release of the ARM scalable vector
extension (SVE) changed things radically for several reasons. First, we expect
ARM processors to equip many supercomputers in the next years. Second, SVE's
interface is different in several aspects from the x86 extensions as it
provides different instructions, uses a predicate to control most operations,
and has a vector size that is only known at execution time. Therefore, using
SVE opens new challenges on how to adapt algorithms including the ones that are
already well-optimized on x86. In this paper, we port a hybrid sort based on
the well-known Quicksort and Bitonic-sort algorithms. We use a Bitonic sort to
process small partitions/arrays and a vectorized partitioning implementation to
divide the partitions. We explain how we use the predicates and how we manage
the non-static vector size. We explain how we efficiently implement the sorting
kernels. Our approach only needs an array of O(log N) for the recursive calls
in the partitioning phase, both in the sequential and in the parallel case. We
test the performance of our approach on a modern ARMv8.2 and assess the
different layers of our implementation by sorting/partitioning integers, double
floating-point numbers, and key/value pairs of integers. Our approach is faster
than the GNU C++ sort algorithm by a speedup factor of 4 on average.
","[{'version': 'v1', 'created': 'Mon, 17 May 2021 12:48:54 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Nov 2021 16:34:36 GMT'}]",2021-11-22,"[['Bramas', 'Bérenger', '']]","['ARM', 'SVE', 'Vectorization', 'Sort']"
2917,1610.02547,Marianne Gauffriau,Marianne Gauffriau,"A categorization of arguments for counting methods for publication and
  citation indicators",,,10.1016/j.joi.2017.05.009,,cs.DL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Most publication and citation indicators are based on datasets with
multi-authored publications and thus a change in counting method will often
change the value of an indicator. Therefore it is important to know why a
specific counting method has been applied. I have identified arguments for
counting methods in a sample of 32 bibliometric studies published in 2016 and
compared the result with discussions of arguments for counting methods in three
older studies. Based on the underlying logics of the arguments I have arranged
the arguments in four groups. Group 1 focuses on arguments related to what an
indicator measures, Group 2 on the additivity of a counting method, Group 3 on
pragmatic reasons for the choice of counting method, and Group 4 on an
indicator's influence on the research community or how it is perceived by
researchers. This categorization can be used to describe and discuss how
bibliometric studies with publication and citation indicators argue for
counting methods.
","[{'version': 'v1', 'created': 'Sat, 8 Oct 2016 15:39:31 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Jun 2017 20:48:14 GMT'}]",2017-06-28,"[['Gauffriau', 'Marianne', '']]","['Publication indicator', 'citation indicator', 'counting method', 'argumentation', 'underlying logic', 'categorization']"
2918,1504.03115,Rasmus Persson,Rasmus A. X. Persson,"Bibliometric author evaluation through linear regression on the coauthor
  network","13 pages, 2 figures",Journal of Informetrics 11 (2017) pp. 299-306,10.1016/j.joi.2017.01.003,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rising trend of coauthored academic works obscures the credit assignment
that is the basis for decisions of funding and career advancements. In this
paper, a simple model based on the assumption of an unvarying ""author ability""
is introduced. With this assumption, the weight of author contributions to a
body of coauthored work can be statistically estimated. The method is tested on
a set of some more than five-hundred authors in a coauthor network from the
CiteSeerX database. The ranking obtained agrees fairly well with that given by
total fractional citation counts for an author, but noticeable differences
exist.
","[{'version': 'v1', 'created': 'Mon, 13 Apr 2015 10:10:19 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Feb 2017 16:06:02 GMT'}]",2017-02-07,"[['Persson', 'Rasmus A. X.', '']]","['multiple authorship', 'statistical method', 'coauthor contribution']"
2919,0707.1926,Vahan Mkrtchyan,V. V. Mkrtchyan,"On trees with a maximum proper partial 0-1 coloring containing a maximum
  matching",4 pages,"Discrete Mathematics 306, (2006), pp. 456-459",10.1016/j.disc.2005.12.019,,cs.DM,,"  I prove that in a tree in which the distance between any two endpoints is
even, there is a maximum proper partial 0-1 coloring such that the edges
colored by 0 form a maximum matching.
","[{'version': 'v1', 'created': 'Fri, 13 Jul 2007 13:05:12 GMT'}]",2007-07-16,"[['Mkrtchyan', 'V. V.', '']]","['Partial proper 0 − 1 coloring', 'Maximum partial proper 0 − 1 coloring', 'Maximum matching']"
2920,1303.6794,Richard Clegg,R. G. Clegg and R. Landa and U. Harder and M. Rio,"A likelihood based framework for assessing network evolution models
  tested on real network data","Presented at ACM/SIMPLEX '09 Workshop, ACM/SIMPLEX '09 Proceedings of
  the 1st Annual Workshop on Simplifying Complex Network for Practitioners 2009",,10.1145/1610304.1610306,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a statistically sound method for using likelihood to
assess potential models of network evolution. The method is tested on data from
five real networks. Data from the internet autonomous system network, from two
photo sharing sites and from a co-authorship network are tested using this
framework.
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2013 11:27:22 GMT'}]",2013-03-28,"[['Clegg', 'R. G.', ''], ['Landa', 'R.', ''], ['Harder', 'U.', ''], ['Rio', 'M.', '']]","['Network topologies', 'likelihood models', 'network evolution']"
2921,1510.06767,E. M. De La Calleja Mora,"E. M. De la Calleja, F. Cervantes, J. De la Calleja",Order-Fractal transition in abstract paintings,,,10.1016/j.aop.2016.04.007,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We report the degree of order of twenty-two Jackson Pollock's paintings using
\emph{Hausdorff-Besicovitch fractal dimension}. Through the maximum value of
each multi-fractal spectrum, the artworks are classify by the year in which
they were painted. It has been reported that Pollock's paintings are fractal
and it increased on his latest works. However our results show that fractal
dimension of the paintings are on a range of fractal dimension with values
close to two. We identify this behavior as a fractal-order transition. Based on
the study of disorder-order transition in physical systems, we interpreted the
fractal-order transition through its dark paint strokes in Pollocks' paintings,
as structured lines following a power law measured by fractal dimension. We
obtain self-similarity in some specific Pollock's paintings, that reveal an
important dependence on the scale of observation. We also characterize by its
fractal spectrum, the called \emph{Teri's Find}. We obtained similar spectrums
between \emph{Teri's Find} and \emph{Number 5} from Pollock, suggesting that
fractal dimension cannot be completely rejected as a quantitative parameter to
authenticate this kind of artworks.
","[{'version': 'v1', 'created': 'Thu, 22 Oct 2015 21:03:50 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Oct 2015 17:35:42 GMT'}, {'version': 'v3', 'created': 'Tue, 12 Apr 2016 12:28:31 GMT'}]",2016-08-24,"[['De la Calleja', 'E. M.', ''], ['Cervantes', 'F.', ''], ['De la Calleja', 'J.', '']]","['Multi-fractal spectrum', 'Order-fractal transition', 'Abstract art']"
2922,1603.02226,Jose Gracia,Huan Zhou and Kamran Idrees and Jos\'e Gracia,"Leveraging MPI-3 Shared-Memory Extensions for Efficient PGAS Runtime
  Systems","12 papers, accepted for publication in EuroPar 2015",,10.1007/978-3-662-48096-0_29,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The relaxed semantics and rich functionality of one-sided communication
primitives of MPI-3 makes MPI an attractive candidate for the implementation of
PGAS models. However, the performance of such implementation suffers from the
fact, that current MPI RMA implementations typically have a large overhead when
source and target of a communication request share a common, local physical
memory. In this paper, we present an optimized PGAS-like runtime system which
uses the new MPI-3 shared-memory extensions to serve intra-node communication
requests and MPI-3 one-sided communication primitives to serve inter-node
communication requests. The performance of our runtime system is evaluated on a
Cray XC40 system through low-level communication benchmarks, a random-access
benchmark and a stencil kernel. The results of the experiments demonstrate that
the performance of our hybrid runtime system matches the performance of
low-level RMA libraries for intra-node transfers, and that of MPI-3 for
inter-node transfers.
","[{'version': 'v1', 'created': 'Mon, 7 Mar 2016 19:45:07 GMT'}]",2016-03-08,"[['Zhou', 'Huan', ''], ['Idrees', 'Kamran', ''], ['Gracia', 'José', '']]","['MPI', 'one-sided communication', 'remote-memory access', 'RMA', 'partitioned global address space', 'PGAS']"
2923,2102.10934,Tingyu Xia,"Tingyu Xia, Yue Wang, Yuan Tian, Yi Chang","Using Prior Knowledge to Guide BERT's Attention in Semantic Textual
  Matching Tasks","10 pages, WWW'21, April19-23, 2021, Ljubljana, Slovenia",,10.1145/3442381.3449988,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of incorporating prior knowledge into a deep
Transformer-based model,i.e.,Bidirectional Encoder Representations from
Transformers (BERT), to enhance its performance on semantic textual matching
tasks. By probing and analyzing what BERT has already known when solving this
task, we obtain better understanding of what task-specific knowledge BERT needs
the most and where it is most needed. The analysis further motivates us to take
a different approach than most existing works. Instead of using prior knowledge
to create a new training task for fine-tuning BERT, we directly inject
knowledge into BERT's multi-head attention mechanism. This leads us to a simple
yet effective approach that enjoys fast training stage as it saves the model
from training on additional data or tasks other than the main task. Extensive
experiments demonstrate that the proposed knowledge-enhanced BERT is able to
consistently improve semantic textual matching performance over the original
BERT model, and the performance benefit is most salient when training data is
scarce.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2021 12:07:16 GMT'}]",2021-02-23,"[['Xia', 'Tingyu', ''], ['Wang', 'Yue', ''], ['Tian', 'Yuan', ''], ['Chang', 'Yi', '']]","['Prior Knowledge', 'Semantic Textual Similarity', 'Deep Neural Networks', 'BERT']"
2924,1609.08239,Pablo Su\'arez-Serrato,"Pablo Su\'arez-Serrato, Margaret E. Roberts, Clayton A. Davis, Filippo
  Menczer","On the influence of social bots in online protests. Preliminary findings
  of a Mexican case study",10 pages,"SocInfo 2016, Part II, LNCS 10047",10.1007/978-3-319-47874-6_19,,cs.CY cs.SI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Social bots can affect online communication among humans. We study this
phenomenon by focusing on #YaMeCanse, the most active protest hashtag in the
history of Twitter in Mexico. Accounts using the hashtag are classified using
the BotOrNot bot detection tool. Our preliminary analysis suggests that bots
played a critical role in disrupting online communication about the protest
movement.
","[{'version': 'v1', 'created': 'Tue, 27 Sep 2016 02:10:37 GMT'}]",2016-09-28,"[['Suárez-Serrato', 'Pablo', ''], ['Roberts', 'Margaret E.', ''], ['Davis', 'Clayton A.', ''], ['Menczer', 'Filippo', '']]","['Social bots', 'Twitter', 'protests']"
2925,1410.0547,Richard Preen,Richard J. Preen and Larry Bull,Design Mining Interacting Wind Turbines,,"Evolutionary Computation (2016), 24(1):89-111",10.1162/EVCO_a_00144,,cs.NE cs.AI cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An initial study of surrogate-assisted evolutionary algorithms used to design
vertical-axis wind turbines wherein candidate prototypes are evaluated under
fan generated wind conditions after being physically instantiated by a 3D
printer has recently been presented. Unlike other approaches, such as
computational fluid dynamics simulations, no mathematical formulations were
used and no model assumptions were made. This paper extends that work by
exploring alternative surrogate modelling and evolutionary techniques. The
accuracy of various modelling algorithms used to estimate the fitness of
evaluated individuals from the initial experiments is compared. The effect of
temporally windowing surrogate model training samples is explored. A
surrogate-assisted approach based on an enhanced local search is introduced;
and alternative coevolution collaboration schemes are examined.
","[{'version': 'v1', 'created': 'Thu, 2 Oct 2014 13:32:59 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Jan 2015 14:20:23 GMT'}]",2016-03-14,"[['Preen', 'Richard J.', ''], ['Bull', 'Larry', '']]","['3D printing', 'Coevolution', 'Fitness approximation', 'Neural network', 'Partnering']"
2926,1308.4368,EPTCS,"Janusz Brzozowski (University of Waterloo), Gareth Davies (University
  of Waterloo)",Maximally Atomic Languages,"In Proceedings AFL 2014, arXiv:1405.5272","EPTCS 151, 2014, pp. 151-161",10.4204/EPTCS.151.10,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The atoms of a regular language are non-empty intersections of complemented
and uncomplemented quotients of the language. Tight upper bounds on the number
of atoms of a language and on the quotient complexities of atoms are known. We
introduce a new class of regular languages, called the maximally atomic
languages, consisting of all languages meeting these bounds. We prove the
following result: If L is a regular language of quotient complexity n and G is
the subgroup of permutations in the transition semigroup T of the minimal DFA
of L, then L is maximally atomic if and only if G is transitive on k-subsets of
1,...,n for 0 <= k <= n and T contains a transformation of rank n-1.
","[{'version': 'v1', 'created': 'Tue, 20 Aug 2013 18:26:21 GMT'}, {'version': 'v2', 'created': 'Thu, 22 May 2014 02:12:59 GMT'}]",2014-05-23,"[['Brzozowski', 'Janusz', '', 'University of Waterloo'], ['Davies', 'Gareth', '', 'University\n  of Waterloo']]","['atom', '´atomaton', 'finite automaton', 'quotient complexity', 'regular language', 'set-transitivegroup', 'state complexity', 'transition semigroup']"
2927,1810.05554,Torsten Zimmermann,"Torsten Zimmermann, Benedikt Wolters, Oliver Hohlfeld, Klaus Wehrle",Is the Web ready for HTTP/2 Server Push?,More information available at https://push.netray.io,"Torsten Zimmermann, Benedikt Wolters, Oliver Hohlfeld, Klaus
  Wehrle. 2018. Is the Web ready for HTTP/2 Server Push?. In CoNEXT '18,
  December 4-7, 2018, Heraklion, Greece. ACM, New York, NY, USA, 7 pages",10.1145/3281411.3281434,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  HTTP/2 supersedes HTTP/1.1 to tackle the performance challenges of the modern
Web. A highly anticipated feature is Server Push, enabling servers to send data
without explicit client requests, thus potentially saving time. Although
guidelines on how to use Server Push emerged, measurements have shown that it
can easily be used in a suboptimal way and hurt instead of improving
performance. We thus tackle the question if the current Web can make better use
of Server Push. First, we enable real-world websites to be replayed in a
testbed to study the effects of different Server Push strategies. Using this,
we next revisit proposed guidelines to grasp their performance impact. Finally,
based on our results, we propose a novel strategy using an alternative server
scheduler that enables to interleave resources. This improves the visual
progress for some websites, with minor modifications to the deployment. Still,
our results highlight the limits of Server Push: a deep understanding of web
engineering is required to make optimal use of it, and not every site will
benefit.
","[{'version': 'v1', 'created': 'Fri, 12 Oct 2018 14:39:47 GMT'}]",2018-10-15,"[['Zimmermann', 'Torsten', ''], ['Wolters', 'Benedikt', ''], ['Hohlfeld', 'Oliver', ''], ['Wehrle', 'Klaus', '']]","['HTTP/2', 'Server Push', 'Interleaving Push']"
2928,1812.06953,Saber Malekzadeh,"Saber Malekzadeh, Mohammad Hossein Gholizadeh, Seyed Naser Razavi",Persian Vowel recognition with MFCC and ANN on PCVC speech dataset,"The 5th International Conference of Electrical Engineering, Computer
  Science and Information Technology 2018",,10.13140/RG.2.2.12187.72486,,cs.SD cs.CL cs.LG eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper a new method for recognition of consonant-vowel phonemes
combination on a new Persian speech dataset titled as PCVC (Persian
Consonant-Vowel Combination) is proposed which is used to recognize Persian
phonemes. In PCVC dataset, there are 20 sets of audio samples from 10 speakers
which are combinations of 23 consonant and 6 vowel phonemes of Persian
language. In each sample, there is a combination of one vowel and one
consonant. First, the consonant phoneme is pronounced and just after it, the
vowel phoneme is pronounced. Each sound sample is a frame of 2 seconds of
audio. In every 2 seconds, there is an average of 0.5 second speech and the
rest is silence. In this paper, the proposed method is the implementations of
the MFCC (Mel Frequency Cepstrum Coefficients) on every partitioned sound
sample. Then, every train sample of MFCC vector is given to a multilayer
perceptron feed-forward ANN (Artificial Neural Network) for training process.
At the end, the test samples are examined on ANN model for phoneme recognition.
After training and testing process, the results are presented in recognition of
vowels. Then, the average percent of recognition for vowel phonemes are
computed.
","[{'version': 'v1', 'created': 'Mon, 17 Dec 2018 18:50:36 GMT'}]",2018-12-18,"[['Malekzadeh', 'Saber', ''], ['Gholizadeh', 'Mohammad Hossein', ''], ['Razavi', 'Seyed Naser', '']]","['PCVC', 'speech dataset', 'Persian', 'MFCC', 'ANN']"
2929,cs/0205053,Paul M. Aoki,"Paul M. Aoki, Rebecca E. Grinter, Amy Hurst, Margaret H. Szymanski,
  James D. Thornton, and Allison Woodruff","Sotto Voce: Exploring the Interplay of Conversation and Mobile Audio
  Spaces",8 pages,"Proc. ACM SIGCHI Conference on Human Factors in Computing Systems,
  Minneapolis, MN, April 2002, 431-438. ACM Press.",10.1145/503376.503454,,cs.HC cs.SD,,"  In addition to providing information to individual visitors, electronic
guidebooks have the potential to facilitate social interaction between visitors
and their companions. However, many systems impede visitor interaction. By
contrast, our electronic guidebook, Sotto Voce, has social interaction as a
primary design goal. The system enables visitors to share audio information -
specifically, they can hear each other's guidebook activity using a
technologically mediated audio eavesdropping mechanism. We conducted a study of
visitors using Sotto Voce while touring a historic house. The results indicate
that visitors are able to use the system effectively, both as a conversational
resource and as an information appliance. More surprisingly, our results
suggest that the technologically mediated audio often cohered the visitors'
conversation and activity to a far greater degree than audio delivered through
the open air.
","[{'version': 'v1', 'created': 'Tue, 21 May 2002 02:55:20 GMT'}]",2007-05-23,"[['Aoki', 'Paul M.', ''], ['Grinter', 'Rebecca E.', ''], ['Hurst', 'Amy', ''], ['Szymanski', 'Margaret H.', ''], ['Thornton', 'James D.', ''], ['Woodruff', 'Allison', '']]","['Electronic guidebooks', 'shared audio', 'interaction analysis']"
2930,1706.07895,Jace Robinson,Jace Robinson and Derek Doran,Seasonality in Dynamic Stochastic Block Models,4 page workshop,,10.1145/3106426.3109424,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sociotechnological and geospatial processes exhibit time varying structure
that make insight discovery challenging. This paper proposes a new statistical
model for such systems, modeled as dynamic networks, to address this challenge.
It assumes that vertices fall into one of k types and that the probability of
edge formation at a particular time depends on the types of the incident nodes
and the current time. The time dependencies are driven by unique seasonal
processes, which many systems exhibit (e.g., predictable spikes in geospatial
or web traffic each day). The paper defines the model as a generative process
and an inference procedure to recover the seasonal processes from data when
they are unknown. Evaluation with synthetic dynamic networks show the recovery
of the latent seasonal processes that drive its formation.
","[{'version': 'v1', 'created': 'Sat, 24 Jun 2017 02:06:04 GMT'}]",2017-06-27,"[['Robinson', 'Jace', ''], ['Doran', 'Derek', '']]","['Dynamic Networks', 'Kalman Filter', 'Structural Time Series', 'StateSpace Model']"
2931,2105.09076,Soumyadeep Dey,"Soumyadeep Dey, Pratik Jawanpuria",Light-weight Document Image Cleanup using Perceptual Loss,"Accepted in 16th International Conference on Document Analysis and
  Recognition 2021 (ICDAR 21)",,10.1007/978-3-030-86334-0_16,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smartphones have enabled effortless capturing and sharing of documents in
digital form. The documents, however, often undergo various types of
degradation due to aging, stains, or shortcoming of capturing environment such
as shadow, non-uniform lighting, etc., which reduces the comprehensibility of
the document images. In this work, we consider the problem of document image
cleanup on embedded applications such as smartphone apps, which usually have
memory, energy, and latency limitations due to the device and/or for best human
user experience. We propose a light-weight encoder decoder based convolutional
neural network architecture for removing the noisy elements from document
images. To compensate for generalization performance with a low network
capacity, we incorporate the perceptual loss for knowledge transfer from
pre-trained deep CNN network in our loss function. In terms of the number of
parameters and product-sum operations, our models are 65-1030 and 3-27 times,
respectively, smaller than existing state-of-the-art document enhancement
models. Overall, the proposed models offer a favorable resource versus accuracy
trade-off and we empirically illustrate the efficacy of our approach on several
real-world benchmark datasets.
","[{'version': 'v1', 'created': 'Wed, 19 May 2021 11:54:28 GMT'}]",2021-09-08,"[['Dey', 'Soumyadeep', ''], ['Jawanpuria', 'Pratik', '']]","['Document cleanup', 'Perceptual loss', 'Document binarization', 'light-weight model']"
2932,1610.01354,Prabhat Kushwaha,Prabhat Kushwaha,"Improved Lower Bound on DHP: Towards the Equivalence of DHP and DLP for
  Important Elliptic Curves Used for Implementation","To keep the paper short, we have not included appendices in the main
  paper. The appendices have been separately added. The reader may refer to
  appendices for the relevant values which have been used to complete Table 1
  and Table 2 in the paper",Journal of Mathematical Cryptology 2018,10.1515/jmc-2017-0053,ISSN: 1862-2976,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 2004, Muzereau et al. showed how to use a reduction algorithm of the
discrete logarithm problem to Diffie-Hellman problem in order to estimate lower
bound on Diffie-Hellman problem on elliptic curves. They presented their
estimates for various elliptic curves that are used in practical applications.
In this paper, we show that a much tighter lower bound for Diffie-Hellman
problem on those curves can be achieved, if one uses the multiplicative group
of a finite field as an auxiliary group. Moreover, improved lower bound
estimates on Diffie-Hellman problem for various recommended curves are also
given which are the tightest; thus, leading us towards the equivalence of
Diffie-Hellman problem and the discrete logarithm problem for these recommended
elliptic curves.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2016 10:46:47 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Nov 2016 09:26:52 GMT'}, {'version': 'v3', 'created': 'Sat, 26 Nov 2016 07:33:25 GMT'}]",2020-11-17,"[['Kushwaha', 'Prabhat', '']]","['Discrete Logarithm problem', 'lower bound of the Diffie-Hellmanproblem', 'elliptic curves used in practical applications']"
2933,1702.00436,Zeon Trevor Fernando,"Zeon Trevor Fernando, Ivana Marenzi, Wolfgang Nejdl","ArchiveWeb: collaboratively extending and exploring web archive
  collections - How would you like to work with your collections?",Published via Springer in International Journal on Digital Libraries,,10.1007/s00799-016-0206-2,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Curated web archive collections contain focused digital content which is
collected by archiving organizations, groups, and individuals to provide a
representative sample covering specific topics and events to preserve them for
future exploration and analysis. In this paper, we discuss how to best support
collaborative construction and exploration of these collections through the
ArchiveWeb system. ArchiveWeb has been developed using an iterative
evaluation-driven design-based research approach, with considerable user
feedback at all stages. The first part of this paper describes the important
insights we gained from our initial requirements engineering phase during the
first year of the project and the main functionalities of the current
ArchiveWeb system for searching, constructing, exploring, and discussing web
archive collections. The second part summarizes the feedback we received on
this version from archiving organizations and libraries, as well as our
corresponding plans for improving and extending the system for the next
release.
","[{'version': 'v1', 'created': 'Wed, 1 Feb 2017 20:05:08 GMT'}]",2017-02-03,"[['Fernando', 'Zeon Trevor', ''], ['Marenzi', 'Ivana', ''], ['Nejdl', 'Wolfgang', '']]","['Working with web archives', 'Collaborativesearch and exploration', 'Web archive requirements andevaluation']"
2934,1404.3017,Gergo Barta,Gergo Barta,A Link-based Approach to Entity Resolution in Social Networks,"10 pages, 5 figures, 2 tables, Second International Conference of
  Database and Data Mining (DBDM 2014)",,10.5121/csit.2014.4409,,cs.IR cs.DS cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social networks initially had been places for people to contact each other,
find friends or new acquaintances. As such they ever proved interesting for
machine aided analysis. Recent developments, however, pivoted social networks
to being among the main fields of information exchange, opinion expression and
debate. As a result there is growing interest in both analyzing and integrating
social network services. In this environment efficient information retrieval is
hindered by the vast amount and varying quality of the user-generated content.
Guiding users to relevant information is a valuable service and also a
difficult task, where a crucial part of the process is accurately resolving
duplicate entities to real-world ones. In this paper we propose a novel
approach that utilizes the principles of link mining to successfully extend the
methodology of entity resolution to multitype problems. The proposed method is
presented using an illustrative social network-based real-world example and
validated by comprehensive evaluation of the results.
","[{'version': 'v1', 'created': 'Fri, 11 Apr 2014 07:11:31 GMT'}]",2014-04-14,"[['Barta', 'Gergo', '']]","['Link mining', 'Entity Resolution', 'Social Networks']"
2935,1607.04765,Ary Setijadi Prihatmanto,"Putri Nhirun Rikasofiadewi, Ary Setijadi Prihatmanto","Design and implementation of audio communication system for
  social-humanoid robot Lumen as an exhibition guide in Electrical Engineering
  Days 2015","Keywords: robot, audio, communication system, speech recognition,
  speech synthesizer, gender identification, Fast Fourier Transform. Kata
  kunci: robot, audio, system komunikasi, speech recognition, speech
  synthesizer, gender identification, Fast Fourier Transform",,10.13140/RG.2.1.3759.7682/1,13209027,cs.HC cs.RO cs.SD,http://creativecommons.org/licenses/by/4.0/,"  Social Robot Lumen is a humanoid robot created to act like human and be human
friend. In this study, Lumen scenario is limited on Lumen as an exhibition
guide in Electrical Engineering Days 2015, a seminar and exhibition of
electrical engineering undergraduate and graduate student of Bandung Institute
of Technology. To be an exhibition guide, Lumen is equipped by Nao robot, a
server, and processing applications. Audio communication system is one of the
processing applications. The purpose of the system is to create verbal
communication that allow Lumen to receive human voice and respond naturally to
it. To be able to communicate like a human, audio communication system is built
with speech recognition module to transform speech data into text, speech
synthesizer module to transform text data into speech, and gender
identification module to distinguish adult female and male voice. Speech
recognition module is implemented using Google Speech Recognition API, speech
synthesizer module is implemented using Acapela engine, and gender
identification module implemented by utilizing speech signal feature that is
extracted using Fast Fourier Transform algorithm. Hardware used for
implementation are Nao robot, computer, and wireless modem.
  -----
  Lumen Robot Sosial Robot merupakan robot humanoid yang diciptakan agar dapat
bersikap seperti manusia dan menjadi teman bagi manusia. Sistem komunikasi
audio merupakan salah satu aplikasi pengolah yang bertujuan agar Lumen dapat
menerima suara manusia dan meresponnya dengan natural, yaitu seperti cara
manusia merespon manusia lainnya. Untuk dapat berkomunikasi seperti manusia,
sistem komunikasi audio dilengkapi dengan tiga buah modul: speech recognition
untuk mengubah data suara menjadi teks, speech synthesizer untuk mengubah data
teks menjadi suara, dan gender identification untuk membedakan suara wanita dan
pria.
","[{'version': 'v1', 'created': 'Sat, 16 Jul 2016 16:50:54 GMT'}]",2016-07-19,"[['Rikasofiadewi', 'Putri Nhirun', ''], ['Prihatmanto', 'Ary Setijadi', '']]","['robot', 'audio', 'communication system', 'speech']"
2936,2203.10280,Xiaojun Ma,"Xiaojun Ma, Qin Chen, Yuanyi Ren, Guojie Song, Liang Wang","Meta-Weight Graph Neural Network: Push the Limits Beyond Global
  Homophily",,"Proceedings of the ACM Web Conference 2022 (WWW '22), April
  25--29, 2022, Virtual Event, Lyon, France",10.1145/3485447.3512100,,cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph Neural Networks (GNNs) show strong expressive power on graph data
mining, by aggregating information from neighbors and using the integrated
representation in the downstream tasks. The same aggregation methods and
parameters for each node in a graph are used to enable the GNNs to utilize the
homophily relational data. However, not all graphs are homophilic, even in the
same graph, the distributions may vary significantly. Using the same
convolution over all nodes may lead to the ignorance of various graph patterns.
Furthermore, many existing GNNs integrate node features and structure
identically, which ignores the distributions of nodes and further limits the
expressive power of GNNs. To solve these problems, we propose Meta Weight Graph
Neural Network (MWGNN) to adaptively construct graph convolution layers for
different nodes. First, we model the Node Local Distribution (NLD) from node
feature, topological structure and positional identity aspects with the
Meta-Weight. Then, based on the Meta-Weight, we generate the adaptive graph
convolutions to perform a node-specific weighted aggregation and boost the node
representations. Finally, we design extensive experiments on real-world and
synthetic benchmarks to evaluate the effectiveness of MWGNN. These experiments
show the excellent expressive power of MWGNN in dealing with graph data with
various distributions.
","[{'version': 'v1', 'created': 'Sat, 19 Mar 2022 09:27:38 GMT'}]",2022-03-22,"[['Ma', 'Xiaojun', ''], ['Chen', 'Qin', ''], ['Ren', 'Yuanyi', ''], ['Song', 'Guojie', ''], ['Wang', 'Liang', '']]","['Graph Neural Networks', 'Representation Power', 'Graph Theory']"
2937,1901.10245,Jun Zhao Dr,"Jun Zhao, Ge Wang, Carys Dally, Petr Slovak, Julian Childs, Max Van
  Klee and Nigel Shadbolt","`I make up a silly name': Understanding Children's Perception of Privacy
  Risks Online","13 pages, 1 figure","CHI Conference on Human Factors in Computing Systems Proceedings
  (CHI 2019), May 4--9, 2019, Glasgow, Scotland Uk",10.1145/3290605.3300336,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Children under 11 are often regarded as too young to comprehend the
implications of online privacy. Perhaps as a result, little research has
focused on younger kids' risk recognition and coping. Such knowledge is,
however, critical for designing efficient safeguarding mechanisms for this age
group. Through 12 focus group studies with 29 children aged 6-10 from UK
schools, we examined how children described privacy risks related to their use
of tablet computers and what information was used by them to identify threats.
We found that children could identify and articulate certain privacy risks
well, such as information oversharing or revealing real identities online;
however, they had less awareness with respect to other risks, such as online
tracking or game promotions. Our findings offer promising directions for
supporting children's awareness of cyber risks and the ability to protect
themselves online.
","[{'version': 'v1', 'created': 'Tue, 29 Jan 2019 12:18:43 GMT'}]",2019-01-30,"[['Zhao', 'Jun', ''], ['Wang', 'Ge', ''], ['Dally', 'Carys', ''], ['Slovak', 'Petr', ''], ['Childs', 'Julian', ''], ['Van Klee', 'Max', ''], ['Shadbolt', 'Nigel', '']]","['Privacy', 'Family Technologies', 'Children', 'Tablet Computers', 'Scaffolding']"
2938,2204.12416,Christopher M. Poskitt,"Lwin Khin Shar, Christopher M. Poskitt, Kyong Jin Shim, Li Ying
  Leonard Wong","XSS for the Masses: Integrating Security in a Web Programming Course
  using a Security Scanner","Accepted by the 27th annual conference on Innovation and Technology
  in Computer Science Education (ITiCSE 2022)","Proc. ITiCSE'22, pages 463-469. ACM, 2022",10.1145/3502718.3524795,,cs.CR cs.CY cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cybersecurity education is considered an important part of undergraduate
computing curricula, but many institutions teach it only in dedicated courses
or tracks. This optionality risks students graduating with limited exposure to
secure coding practices that are expected in industry. An alternative approach
is to integrate cybersecurity concepts across non-security courses, so as to
expose students to the interplay between security and other sub-areas of
computing. In this paper, we report on our experience of applying the security
integration approach to an undergraduate web programming course. In particular,
we added a practical introduction to secure coding, which highlighted the OWASP
Top 10 vulnerabilities by example, and demonstrated how to identify them using
out-of-the-box security scanner tools (e.g. ZAP). Furthermore, we incentivised
students to utilise these tools in their own course projects by offering bonus
marks. To assess the impact of this intervention, we scanned students' project
code over the last three years, finding a reduction in the number of
vulnerabilities. Finally, in focus groups and a survey, students shared that
our intervention helped to raise awareness, but they also highlighted the
importance of grading incentives and the need to teach security content
earlier.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2022 16:20:36 GMT'}]",2022-07-12,"[['Shar', 'Lwin Khin', ''], ['Poskitt', 'Christopher M.', ''], ['Shim', 'Kyong Jin', ''], ['Wong', 'Li Ying Leonard', '']]","['Cybersecurity education', 'web development', 'security integration']"
2939,1408.3253,Z\'ador D\'aniel Kelemen,"Z\'ador D\'aniel Kelemen, G\'abor B\'eny\'asz, Zolt\'an Badinka",A measurement based software quality framework,19 pages,,10.13140/2.1.3484.3528,TKPH-QDTR-201401,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this report we propose a solution to problem of the dependency on the
experience of the software project quality assurance personnel by providing a
transparent, objective and measurement based quality framework. The framework
helps the quality assurance experts making objective and comparable decisions
in software projects by defining and assessing measurable quality goals and
thresholds, directly relating these to an escalation mechanism. First results
of applying the proposed measurement based software quality framework in a real
life case study are also addressed in this report.
","[{'version': 'v1', 'created': 'Thu, 14 Aug 2014 12:06:21 GMT'}, {'version': 'v2', 'created': 'Sun, 17 Aug 2014 08:55:01 GMT'}]",2014-08-19,"[['Kelemen', 'Zádor Dániel', ''], ['Bényász', 'Gábor', ''], ['Badinka', 'Zoltán', '']]","['software measurement', 'metric', 'threshold', 'KPI', 'escalation', 'software quality assurance', 'quality management', 'software quality framework']"
2940,cs/9809036,Peter Stanski,"P. Stanski, S. Giles and A. Zaslavsky","Document Archiving, Replication and Migration Container for Mobile Web
  Users",5 pages,"Proceedings of the 1998 ACM Symposium on Applied Computing
  (SAC98), Feb. 27- March 1, pp. 400-404, ACM, ISBN 0-89791-969-6",,,cs.MA cs.MM,,"  With the increasing use of mobile workstations for a wide variety of tasks
and associated information needs, and with many variations of available
networks, access to data becomes a prime consideration. This paper discusses
issues of workstation mobility and proposes a solution wherein the data
structures are accessed in an encapsulated form - through the Portable File
System (PFS) wrapper. The paper discusses an implementation of the Portable
File System, highlighting the architecture and commenting upon performance of
an experimental system. Although investigations have been focused upon mobile
access of WWW documents, this technique could be applied to any mobile data
access situation.
","[{'version': 'v1', 'created': 'Sun, 20 Sep 1998 12:48:43 GMT'}]",2007-05-23,"[['Stanski', 'P.', ''], ['Giles', 'S.', ''], ['Zaslavsky', 'A.', '']]","['server', 'file-system', 'replication', 'archiving', 'mobility']"
2941,1810.05661,Johannes Kinder,"Blake Loring, Duncan Mitchell, Johannes Kinder","Sound Regular Expression Semantics for Dynamic Symbolic Execution of
  JavaScript","This arXiv version (v4) contains fixes for some typographical errors
  of the PLDI'19 version (the numbering of indices in Section 4.1 and the
  example in Section 4.3)","Proc. ACM SIGPLAN Conf. Programming Language Design and
  Implementation (PLDI), pp. 425-438, ACM, 2019",10.1145/3314221.3314645,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing support for regular expressions in automated test generation or
verification tools is lacking. Common aspects of regular expression engines
found in mainstream programming languages, such as backreferences or greedy
matching, are commonly ignored or imprecisely approximated, leading to poor
test coverage or failed proofs. In this paper, we present the first complete
strategy to faithfully reason about regular expressions in the context of
symbolic execution, focusing on the operators found in JavaScript. We model
regular expression operations using string constraints and classical regular
expressions and use a refinement scheme to address the problem of matching
precedence and greediness. Our survey of over 400,000 JavaScript packages from
the NPM software repository shows that one fifth make use of complex regular
expressions features. We implemented our model in a dynamic symbolic execution
engine for JavaScript and evaluated it on over 1,000 Node.js packages
containing regular expressions, demonstrating that the strategy is effective
and can increase line coverage of programs by up to 30%
","[{'version': 'v1', 'created': 'Wed, 10 Oct 2018 15:51:34 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Dec 2018 12:21:30 GMT'}, {'version': 'v3', 'created': 'Tue, 7 May 2019 12:16:25 GMT'}, {'version': 'v4', 'created': 'Fri, 13 Mar 2020 16:08:14 GMT'}]",2020-03-16,"[['Loring', 'Blake', ''], ['Mitchell', 'Duncan', ''], ['Kinder', 'Johannes', '']]","['Dynamic symbolic execution', 'JavaScript', 'regular expressions', 'SMT']"
2942,1610.06073,Mihir Chauhan,Mihir Chauhan and Aditya Kulai,LiFi - Let There Be Light,"3 Pages, 2 Figures","International Journal of Engineering Trends and Technology,
  october 2015",10.14445/22315381/IJETT-V28P231,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper proclaims a summary of Li-Fi technology. It is an efficient data
communication mechanism involving visible light as a medium of transmission.
This monograph introduces the concept of Li-Fi and its working model.
Furthermore, it discusses its benefits, shortcomings and examines ways to
mitigate the drawbacks. Additionally, it analyzes its present applications and
explores its future scope in the competitive wireless network market.
","[{'version': 'v1', 'created': 'Tue, 3 Nov 2015 04:17:05 GMT'}]",2016-10-20,"[['Chauhan', 'Mihir', ''], ['Kulai', 'Aditya', '']]","['Li-Fi', 'Wi-Fi', 'VLC', 'LED', 'IrDA', 'Attocell']"
2943,2102.08557,Rajagopal Venkatesaramani,"Rajagopal Venkatesaramani, Bradley A. Malin, Yevgeniy Vorobeychik","Re-identification of Individuals in Genomic Datasets Using Public Face
  Images",,,10.1126/sciadv.abg3296,,cs.LG cs.CR cs.CY,http://creativecommons.org/licenses/by/4.0/,"  DNA sequencing is becoming increasingly commonplace, both in medical and
direct-to-consumer settings. To promote discovery, collected genomic data is
often de-identified and shared, either in public repositories, such as OpenSNP,
or with researchers through access-controlled repositories. However, recent
studies have suggested that genomic data can be effectively matched to
high-resolution three-dimensional face images, which raises a concern that the
increasingly ubiquitous public face images can be linked to shared genomic
data, thereby re-identifying individuals in the genomic data. While these
investigations illustrate the possibility of such an attack, they assume that
those performing the linkage have access to extremely well-curated data. Given
that this is unlikely to be the case in practice, it calls into question the
pragmatic nature of the attack. As such, we systematically study this
re-identification risk from two perspectives: first, we investigate how
successful such linkage attacks can be when real face images are used, and
second, we consider how we can empower individuals to have better control over
the associated re-identification risk. We observe that the true risk of
re-identification is likely substantially smaller for most individuals than
prior literature suggests. In addition, we demonstrate that the addition of a
small amount of carefully crafted noise to images can enable a controlled
trade-off between re-identification success and the quality of shared images,
with risk typically significantly lowered even with noise that is imperceptible
to humans.
","[{'version': 'v1', 'created': 'Wed, 17 Feb 2021 03:54:25 GMT'}]",2022-12-21,"[['Venkatesaramani', 'Rajagopal', ''], ['Malin', 'Bradley A.', ''], ['Vorobeychik', 'Yevgeniy', '']]","['genomic privacy', 're-identification', 'face images']"
2944,1610.04761,Lucas Carvalho Cordeiro,"Alessandro Abate, Iury Bessa, Dario Cattaruzza, Lucas Cordeiro,
  Cristina David, Pascal Kesseli and Daniel Kroening","Sound and Automated Synthesis of Digital Stabilizing Controllers for
  Continuous Plants",10 pages,"20th ACM International Conference on Hybrid Systems: Computation
  and Control (HSCC 2017)",10.1145/3049797.3049802,,cs.SY cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern control is implemented with digital microcontrollers, embedded within
a dynamical plant that represents physical components. We present a new
algorithm based on counter-example guided inductive synthesis that automates
the design of digital controllers that are correct by construction. The
synthesis result is sound with respect to the complete range of approximations,
including time discretization, quantization effects, and finite-precision
arithmetic and its rounding errors. We have implemented our new algorithm in a
tool called DSSynth, and are able to automatically generate stable controllers
for a set of intricate plant models taken from the literature within minutes.
","[{'version': 'v1', 'created': 'Sat, 15 Oct 2016 16:34:47 GMT'}, {'version': 'v2', 'created': 'Sat, 22 Oct 2016 13:19:31 GMT'}, {'version': 'v3', 'created': 'Thu, 16 Feb 2017 15:13:02 GMT'}]",2017-02-17,"[['Abate', 'Alessandro', ''], ['Bessa', 'Iury', ''], ['Cattaruzza', 'Dario', ''], ['Cordeiro', 'Lucas', ''], ['David', 'Cristina', ''], ['Kesseli', 'Pascal', ''], ['Kroening', 'Daniel', '']]","['Digital control synthesis', 'CEGIS', 'finite-word-length representation', 'time sampling', 'quantization']"
2945,1903.10527,Ekaterina Tolstaya,"Ekaterina Tolstaya, Fernando Gama, James Paulos, George Pappas, Vijay
  Kumar, Alejandro Ribeiro","Learning Decentralized Controllers for Robot Swarms with Graph Neural
  Networks",,,10.1561/2200000060,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of finding distributed controllers for large networks
of mobile robots with interacting dynamics and sparsely available
communications. Our approach is to learn local controllers that require only
local information and communications at test time by imitating the policy of
centralized controllers using global information at training time. By extending
aggregation graph neural networks to time varying signals and time varying
network support, we learn a single common local controller which exploits
information from distant teammates using only local communication interchanges.
We apply this approach to the problem of flocking to demonstrate performance on
communication graphs that change as the robots move. We examine how a
decreasing communication radius and faster velocities increase the value of
multi-hop information.
","[{'version': 'v1', 'created': 'Mon, 25 Mar 2019 18:00:27 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Sep 2019 19:15:45 GMT'}, {'version': 'v3', 'created': 'Mon, 2 Nov 2020 16:31:06 GMT'}, {'version': 'v4', 'created': 'Wed, 24 Mar 2021 15:50:04 GMT'}]",2021-03-29,"[['Tolstaya', 'Ekaterina', ''], ['Gama', 'Fernando', ''], ['Paulos', 'James', ''], ['Pappas', 'George', ''], ['Kumar', 'Vijay', ''], ['Ribeiro', 'Alejandro', '']]","['Swarms', 'Imitation Learning', 'Graph Neural Networks']"
2946,1601.08162,Tiago Azevedo,"Tiago Azevedo, Rosaldo J. F. Rossetti, Jorge G. Barbosa",A State-of-the-art Integrated Transportation Simulation Platform,,"Proceedings of the 4th International Conference on Models and
  Technologies for Intelligent Transportation Systems (2015) 340-347",10.1109/MTITS.2015.7223277,,cs.MA cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Nowadays, universities and companies have a huge need for simulation and
modelling methodologies. In the particular case of traffic and transportation,
making physical modifications to the real traffic networks could be highly
expensive, dependent on political decisions and could be highly disruptive to
the environment. However, while studying a specific domain or problem,
analysing a problem through simulation may not be trivial and may need several
simulation tools, hence raising interoperability issues. To overcome these
problems, we propose an agent-directed transportation simulation platform,
through the cloud, by means of services. We intend to use the IEEE standard HLA
(High Level Architecture) for simulators interoperability and agents for
controlling and coordination. Our motivations are to allow multiresolution
analysis of complex domains, to allow experts to collaborate on the analysis of
a common problem and to allow co-simulation and synergy of different
application domains. This paper will start by presenting some preliminary
background concepts to help better understand the scope of this work. After
that, the results of a literature review is shown. Finally, the general
architecture of a transportation simulation platform is proposed.
","[{'version': 'v1', 'created': 'Fri, 29 Jan 2016 15:44:21 GMT'}]",2016-02-01,"[['Azevedo', 'Tiago', ''], ['Rossetti', 'Rosaldo J. F.', ''], ['Barbosa', 'Jorge G.', '']]","['Agent-directed simulation', 'Agent-supported simulation', 'HLA', 'High Level Architecture', 'Cloud', 'SimSaaS', 'SimulationSoftware-as-a-service']"
2947,2210.13835,Zhen-Yu Wu,"Zhenyu Wu, Lin Wang, Wei Wang, Tengfei Shi, Chenglizhao Chen, Aimin
  Hao, Shuo Li",Synthetic Data Supervised Salient Object Detection,"9 pages, 8 figures","ACM MM, 2022",10.1145/3503161.3547930,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although deep salient object detection (SOD) has achieved remarkable
progress, deep SOD models are extremely data-hungry, requiring large-scale
pixel-wise annotations to deliver such promising results. In this paper, we
propose a novel yet effective method for SOD, coined SODGAN, which can generate
infinite high-quality image-mask pairs requiring only a few labeled data, and
these synthesized pairs can replace the human-labeled DUTS-TR to train any
off-the-shelf SOD model. Its contribution is three-fold. 1) Our proposed
diffusion embedding network can address the manifold mismatch and is tractable
for the latent code generation, better matching with the ImageNet latent space.
2) For the first time, our proposed few-shot saliency mask generator can
synthesize infinite accurate image synchronized saliency masks with a few
labeled data. 3) Our proposed quality-aware discriminator can select
highquality synthesized image-mask pairs from noisy synthetic data pool,
improving the quality of synthetic data. For the first time, our SODGAN tackles
SOD with synthetic data directly generated from the generative model, which
opens up a new research paradigm for SOD. Extensive experimental results show
that the saliency model trained on synthetic data can achieve $98.4\%$
F-measure of the saliency model trained on the DUTS-TR. Moreover, our approach
achieves a new SOTA performance in semi/weakly-supervised methods, and even
outperforms several fully-supervised SOTA methods. Code is available at
https://github.com/wuzhenyubuaa/SODGAN
","[{'version': 'v1', 'created': 'Tue, 25 Oct 2022 08:36:29 GMT'}]",2022-10-26,"[['Wu', 'Zhenyu', ''], ['Wang', 'Lin', ''], ['Wang', 'Wei', ''], ['Shi', 'Tengfei', ''], ['Chen', 'Chenglizhao', ''], ['Hao', 'Aimin', ''], ['Li', 'Shuo', '']]","['Salient object detection', 'Synthetic data', 'Semi-supervised learning']"
2948,1611.00960,Vania Estrela Dr.,"Vania V. Estrela, Matthias O. Franz, Ricardo T. Lopes, G. P. De Araujo",Adaptive mixed norm optical flow estimation,"8 pages, 4 figures. arXiv admin note: text overlap with
  arXiv:1403.7365","Proc. SPIE 5960, Visual Communications and Image Processing 2005,
  59603W, July 31, 2006, Beijing, China",10.1117/12.632674,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The pel-recursive computation of 2-D optical flow has been extensively
studied in computer vision to estimate motion from image sequences, but it
still raises a wealth of issues, such as the treatment of outliers, motion
discontinuities and occlusion. It relies on spatio-temporal brightness
variations due to motion. Our proposed adaptive regularized approach deals with
these issues within a common framework. It relies on the use of a data-driven
technique called Mixed Norm (MN) to estimate the best motion vector for a given
pixel. In our model, various types of noise can be handled, representing
different sources of error. The motion vector estimation takes into
consideration local image properties and it results from the minimization of a
mixed norm functional with a regularization parameter depending on the
kurtosis. This parameter determines the relative importance of the fourth norm
and makes the functional convex. The main advantage of the developed procedure
is that no knowledge of the noise distribution is necessary. Experiments
indicate that this approach provides robust estimates of the optical flow.
","[{'version': 'v1', 'created': 'Thu, 3 Nov 2016 11:32:46 GMT'}]",2016-11-04,"[['Estrela', 'Vania V.', ''], ['Franz', 'Matthias O.', ''], ['Lopes', 'Ricardo T.', ''], ['De Araujo', 'G. P.', '']]","['Kurtosis', 'mixed norm functional', 'motion estimation', 'optical flow', 'computer vision']"
2949,1512.07818,Ayman Aljarbouh,"Ayman Aljarbouh (HYCOMES), Benoit Caillaud (HYCOMES)",Robust Simulation for Hybrid Systems: Chattering Path Avoidance,"The 56th Conference on Simulation and Modelling (SIMS 56), Oct 2015,
  Link\""oping, Sweden. 2015, Link\""oping University Press",,10.3384/ecp15119175,,cs.CE cs.SY math.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The sliding mode approach is recognized as an efficient tool for treating the
chattering behavior in hybrid systems. However, the amplitude of chattering, by
its nature, is proportional to magnitude of discontinuous control. A possible
scenario is that the solution trajectories may successively enter and exit as
well as slide on switching mani-folds of different dimensions. Naturally, this
arises in dynamical systems and control applications whenever there are
multiple discontinuous control variables. The main contribution of this paper
is to provide a robust computational framework for the most general way to
extend a flow map on the intersection of p intersected (n--1)-dimensional
switching manifolds in at least p dimensions. We explore a new formulation to
which we can define unique solutions for such particular behavior in hybrid
systems and investigate its efficient computation/simulation. We illustrate the
concepts with examples throughout the paper.
","[{'version': 'v1', 'created': 'Thu, 24 Dec 2015 14:07:40 GMT'}]",2015-12-25,"[['Aljarbouh', 'Ayman', '', 'HYCOMES'], ['Caillaud', 'Benoit', '', 'HYCOMES']]","['Hybrid systems', 'Non-smooth dynamical systems', 'Discontinuity mappings', 'Chattering-free simulation', 'Numerical methods']"
2950,1709.08296,Zhenyu Yan,"Zhenyu Yan (1), Yang Li (2), Rui Tan (1), Jun Huang (3) ((1) School of
  Computer Science and Engineering, Nanyang Technological University, (2)
  Advanced Digital Sciences Center, Illinois at Singapore, (3) Center for
  Energy Efficient Computing and Applications, Peking University)","Application-Layer Clock Synchronization for Wearables Using Skin
  Electric Potentials Induced by Powerline Radiation","The 15th ACM Conference on Embedded Networked Sensor Systems (SenSys
  2017)",,10.1145/3131672.3131681,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Design of clock synchronization for networked nodes faces a fundamental
trade-off between synchronization accuracy and universality for heterogeneous
platforms, because a high synchronization accuracy generally requires
platform-dependent hardware-level network packet timestamping. This paper
presents TouchSync, a new indoor clock synchronization approach for wearables
that achieves millisecond accuracy while preserving universality in that it
uses standard system calls only, such as reading system clock, sampling
sensors, and sending/receiving network messages. The design of TouchSync is
driven by a key finding from our extensive measurements that the skin electric
potentials (SEPs) induced by powerline radiation are salient, periodic, and
synchronous on a same wearer and even across different wearers. TouchSync
integrates the SEP signal into the universal principle of Network Time Protocol
and solves an integer ambiguity problem by fusing the ambiguous results in
multiple synchronization rounds to conclude an accurate clock offset between
two synchronizing wearables. With our shared code, TouchSync can be readily
integrated into any wearable applications. Extensive evaluation based on our
Arduino and TinyOS implementations shows that TouchSync's synchronization
errors are below 3 and 7 milliseconds on the same wearer and between two
wearers 10 kilometers apart, respectively.
","[{'version': 'v1', 'created': 'Mon, 25 Sep 2017 03:01:02 GMT'}]",2017-09-26,"[['Yan', 'Zhenyu', ''], ['Li', 'Yang', ''], ['Tan', 'Rui', ''], ['Huang', 'Jun', '']]","['Clock synchronization', 'wearables', 'skin electric potential']"
2951,1210.2506,Sukhpal  Singh,"Sukhpal Singh, Inderveer Chana",Enabling Reusability in Agile Software Development,"8 Pages including 5 figures, Published by Foundation of Computer
  Science, New York, USA","International Journal of Computer Applications, Volume 50, No-13,
  2012, 33-40",10.5120/7834-1132,pxc3881132,cs.SE,http://creativecommons.org/licenses/publicdomain/,"  Software Engineering Discipline is constantly achieving momentum from past
two decades. In last decade, remarkable progress has been observed. New process
models that are introduced from time to time in order to keep pace with
multidimensional demands of the industry. New software development paradigms
are finding its place in industry such as Agile Software Development, Reuse
based Development and Component based Development. But different software
development models fail to satisfy many needs of software industry. As aim of
all the process models is same, i.e., to get quality product, reduce time of
development, productivity improvement and reduction in cost. Still, no single
process model is complete in itself. Software industry is moving towards Agile
Software Development. Agile development does not obviously fit well for
building reusable artifacts. However, with careful attention, and important
modifications made to agile processes, it may be possible to successfully adapt
and put on agile methods to development of reusable objects. The model being
proposed here combines the features of Agile Software Development and
reusability.
","[{'version': 'v1', 'created': 'Tue, 9 Oct 2012 07:16:54 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Feb 2013 22:20:45 GMT'}]",2013-02-08,"[['Singh', 'Sukhpal', ''], ['Chana', 'Inderveer', '']]","['Agile software development', 'Reusability', 'Agile']"
2952,1009.0958,M. Emre Celebi,M. Emre Celebi,Real-Time Implementation of Order-Statistics Based Directional Filters,,IET Image Processing 3 (2009) 1-9,10.1049/iet-ipr:20080080,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vector filters based on order-statistics have proved successful in removing
impulsive noise from color images while preserving edges and fine image
details. Among these filters, the ones that involve the cosine distance
function (directional filters) have particularly high computational
requirements, which limits their use in time critical applications. In this
paper, we introduce two methods to speed up these filters. Experiments on a
diverse set of color images show that the proposed methods provide substantial
computational gains without significant loss of accuracy.
","[{'version': 'v1', 'created': 'Sun, 5 Sep 2010 23:53:27 GMT'}]",2010-09-07,"[['Celebi', 'M. Emre', '']]","['color image processing', 'impulsive noise removal', 'vector order-statistics', 'directional filter']"
2953,2108.13092,Nicolas Tempelmeier,"Nicolas Tempelmeier, Simon Gottschalk, Elena Demidova","GeoVectors: A Linked Open Corpus of OpenStreetMap Embeddings on World
  Scale",,"30th ACM International Conference on Information and Knowledge
  Management (CIKM 2021)",10.1145/3459637.3482004,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  OpenStreetMap (OSM) is currently the richest publicly available information
source on geographic entities (e.g., buildings and roads) worldwide. However,
using OSM entities in machine learning models and other applications is
challenging due to the large scale of OSM, the extreme heterogeneity of entity
annotations, and a lack of a well-defined ontology to describe entity semantics
and properties. This paper presents GeoVectors - a unique, comprehensive
world-scale linked open corpus of OSM entity embeddings covering the entire OSM
dataset and providing latent representations of over 980 million geographic
entities in 180 countries. The GeoVectors corpus captures semantic and
geographic dimensions of OSM entities and makes these entities directly
accessible to machine learning algorithms and semantic applications. We create
a semantic description of the GeoVectors corpus, including identity links to
the Wikidata and DBpedia knowledge graphs to supply context information.
Furthermore, we provide a SPARQL endpoint - a semantic interface that offers
direct access to the semantic and latent representations of geographic entities
in OSM.
","[{'version': 'v1', 'created': 'Mon, 30 Aug 2021 10:00:34 GMT'}]",2021-08-31,"[['Tempelmeier', 'Nicolas', ''], ['Gottschalk', 'Simon', ''], ['Demidova', 'Elena', '']]","['OpenStreetMap', 'OSM Embeddings', 'Semantic Geographic Data']"
2954,1501.02560,Kuang Zhou,"Wiem Maalel (IRISA), Kuang Zhou (IRISA), Arnaud Martin (IRISA), Zied
  Elouedi",Belief Hierarchical Clustering,,"3rd International Conference on Belief Functions, Sep 2014,
  Oxford, United Kingdom. pp.68 - 76",10.1007/978-3-319-11191-9_8,,cs.AI cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the data mining field many clustering methods have been proposed, yet
standard versions do not take into account uncertain databases. This paper
deals with a new approach to cluster uncertain data by using a hierarchical
clustering defined within the belief function framework. The main objective of
the belief hierarchical clustering is to allow an object to belong to one or
several clusters. To each belonging, a degree of belief is associated, and
clusters are combined based on the pignistic properties. Experiments with real
uncertain data show that our proposed method can be considered as a propitious
tool.
","[{'version': 'v1', 'created': 'Mon, 12 Jan 2015 07:55:41 GMT'}]",2015-01-13,"[['Maalel', 'Wiem', '', 'IRISA'], ['Zhou', 'Kuang', '', 'IRISA'], ['Martin', 'Arnaud', '', 'IRISA'], ['Elouedi', 'Zied', '']]","['Clustering', 'Hierarchical clustering', 'Belief function', 'Beliefclustering']"
2955,1603.09048,Kuan-Hao Huang,Kuan-Hao Huang and Hsuan-Tien Lin,Cost-Sensitive Label Embedding for Multi-Label Classification,,,10.1007/s10994-017-5659-z,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Label embedding (LE) is an important family of multi-label classification
algorithms that digest the label information jointly for better performance.
Different real-world applications evaluate performance by different cost
functions of interest. Current LE algorithms often aim to optimize one specific
cost function, but they can suffer from bad performance with respect to other
cost functions. In this paper, we resolve the performance issue by proposing a
novel cost-sensitive LE algorithm that takes the cost function of interest into
account. The proposed algorithm, cost-sensitive label embedding with
multidimensional scaling (CLEMS), approximates the cost information with the
distances of the embedded vectors by using the classic multidimensional scaling
approach for manifold learning. CLEMS is able to deal with both symmetric and
asymmetric cost functions, and effectively makes cost-sensitive decisions by
nearest-neighbor decoding within the embedded vectors. We derive theoretical
results that justify how CLEMS achieves the desired cost-sensitivity.
Furthermore, extensive experimental results demonstrate that CLEMS is
significantly better than a wide spectrum of existing LE algorithms and
state-of-the-art cost-sensitive algorithms across different cost functions.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2016 06:19:02 GMT'}, {'version': 'v2', 'created': 'Thu, 31 Mar 2016 06:08:14 GMT'}, {'version': 'v3', 'created': 'Wed, 1 Jun 2016 08:05:10 GMT'}, {'version': 'v4', 'created': 'Tue, 11 Jul 2017 04:45:25 GMT'}, {'version': 'v5', 'created': 'Sat, 5 Aug 2017 04:05:40 GMT'}]",2019-02-07,"[['Huang', 'Kuan-Hao', ''], ['Lin', 'Hsuan-Tien', '']]","['Multi-label classification', 'Cost-sensitive', 'Label embedding']"
2956,1511.06510,Renaud Gervais,"Renaud Gervais (Potioc), J\'er\'emy Frey (UB, LaBRI, Potioc), Alexis
  Gay, Fabien Lotte (Potioc, LaBRI), Martin Hachet (Potioc, LaBRI)",TOBE: Tangible Out-of-Body Experience,,"Tangible, Embedded and Embodied Interaction (TEI), Feb 2016,
  Eindhoven, Netherlands. 2016, \&lt;http://www.tei-conf.org/16/\&gt;.
  \&lt;10.1145/2839462.2839486\&gt;",10.1145/2839462.2839486,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a toolkit for creating Tangible Out-of-Body Experiences: exposing
the inner states of users using physiological signals such as heart rate or
brain activity. Tobe can take the form of a tangible avatar displaying live
physiological readings to reflect on ourselves and others. Such a toolkit could
be used by researchers and designers to create a multitude of potential
tangible applications, including (but not limited to) educational tools about
Science Technologies Engineering and Mathematics (STEM) and cognitive science,
medical applications or entertainment and social experiences with one or
several users or Tobes involved. Through a co-design approach, we investigated
how everyday people picture their physiology and we validated the acceptability
of Tobe in a scientific museum. We also give a practical example where two
users relax together, with insights on how Tobe helped them to synchronize
their signals and share a moment.
","[{'version': 'v1', 'created': 'Fri, 20 Nov 2015 07:40:01 GMT'}]",2016-08-06,"[['Gervais', 'Renaud', '', 'Potioc'], ['Frey', 'Jérémy', '', 'UB, LaBRI, Potioc'], ['Gay', 'Alexis', '', 'Potioc, LaBRI'], ['Lotte', 'Fabien', '', 'Potioc, LaBRI'], ['Hachet', 'Martin', '', 'Potioc, LaBRI']]","['H.5.1 Multimedia Information Systems Artificial', 'augmented', 'virtual realities; H.5']"
2957,1903.03315,Huyan Huang,Huyan Huang and Yipeng Liu and Ce Zhu,Provable Tensor Ring Completion,,"Signal Processing, vol. 171, p. 107486, 2020",10.1016/j.sigpro.2020.107486,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tensor completion recovers a multi-dimensional array from a limited number of
measurements. Using the recently proposed tensor ring (TR) decomposition, in
this paper we show that a d-order tensor of dimensional size n and TR rank r
can be exactly recovered with high probability by solving a convex optimization
program, given n^{d/2} r^2 ln^7(n^{d/2})samples. The proposed TR incoherence
condition under which the result holds is similar to the matrix incoherence
condition. The experiments on synthetic data verify the recovery guarantee for
TR completion. Moreover, the experiments on real-world data show that our
method improves the recovery performance compared with the state-of-the-art
methods.
","[{'version': 'v1', 'created': 'Fri, 8 Mar 2019 08:04:25 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Mar 2019 12:32:52 GMT'}, {'version': 'v3', 'created': 'Tue, 12 Mar 2019 05:35:21 GMT'}, {'version': 'v4', 'created': 'Sun, 17 Mar 2019 13:15:43 GMT'}, {'version': 'v5', 'created': 'Thu, 21 Mar 2019 02:20:01 GMT'}, {'version': 'v6', 'created': 'Thu, 9 Jan 2020 03:14:22 GMT'}]",2020-03-17,"[['Huang', 'Huyan', ''], ['Liu', 'Yipeng', ''], ['Zhu', 'Ce', '']]","['Tensor completion', 'Tensor ring decomposition', 'Convex']"
2958,1008.1663,EPTCS,Anna Kasprzik (University of Trier),Learning Residual Finite-State Automata Using Observation Tables,"In Proceedings DCFS 2010, arXiv:1008.1270","EPTCS 31, 2010, pp. 205-212",10.4204/EPTCS.31.23,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We define a two-step learner for RFSAs based on an observation table by using
an algorithm for minimal DFAs to build a table for the reversal of the language
in question and showing that we can derive the minimal RFSA from it after some
simple modifications. We compare the algorithm to two other table-based ones of
which one (by Bollig et al. 2009) infers a RFSA directly, and the other is
another two-step learner proposed by the author. We focus on the criterion of
query complexity.
","[{'version': 'v1', 'created': 'Tue, 10 Aug 2010 08:34:18 GMT'}]",2010-08-11,"[['Kasprzik', 'Anna', '', 'University of Trier']]","['Grammatical inference', 'residual languages', 'observation tables']"
2959,1810.08606,Amit Gajbhiye,"Amit Gajbhiye, Sardar Jaf, Noura Al Moubayed, A. Stephen McGough,
  Steven Bradley",An Exploration of Dropout with RNNs for Natural Language Inference,"Accepted in International Conference on Artificial Neural Networks,
  2018",,10.1007/978-3-030-01424-7_16,,cs.CL cs.LG,http://creativecommons.org/publicdomain/zero/1.0/,"  Dropout is a crucial regularization technique for the Recurrent Neural
Network (RNN) models of Natural Language Inference (NLI). However, dropout has
not been evaluated for the effectiveness at different layers and dropout rates
in NLI models. In this paper, we propose a novel RNN model for NLI and
empirically evaluate the effect of applying dropout at different layers in the
model. We also investigate the impact of varying dropout rates at these layers.
Our empirical evaluation on a large (Stanford Natural Language Inference
(SNLI)) and a small (SciTail) dataset suggest that dropout at each feed-forward
connection severely affects the model accuracy at increasing dropout rates. We
also show that regularizing the embedding layer is efficient for SNLI whereas
regularizing the recurrent layer improves the accuracy for SciTail. Our model
achieved an accuracy 86.14% on the SNLI dataset and 77.05% on SciTail.
","[{'version': 'v1', 'created': 'Mon, 22 Oct 2018 17:48:21 GMT'}]",2018-10-23,"[['Gajbhiye', 'Amit', ''], ['Jaf', 'Sardar', ''], ['Moubayed', 'Noura Al', ''], ['McGough', 'A. Stephen', ''], ['Bradley', 'Steven', '']]","['Neural Networks', 'Dropout', 'Natural Language Inference']"
2960,1806.04075,Qian Lin,"Hao Zhou, Ming Chen, Qian Lin, Yong Wang, Xiaobin She, Sifan Liu, Rui
  Gu, Beng Chin Ooi, Junfeng Yang",Overload Control for Scaling WeChat Microservices,"This version has updated the adaptive admission control algorithm by
  merging the errata published in v2",ACM SoCC (2018) 149-161,10.1145/3267809.3267823,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Effective overload control for large-scale online service system is crucial
for protecting the system backend from overload. Conventionally, the design of
overload control is ad-hoc for individual service. However, service-specific
overload control could be detrimental to the overall system due to intricate
service dependencies or flawed implementation of service. Service developers
usually have difficulty to accurately estimate the dynamics of actual workload
during the development of service. Therefore, it is essential to decouple the
overload control from service logic. In this paper, we propose DAGOR, an
overload control scheme designed for the account-oriented microservice
architecture. DAGOR is service agnostic and system-centric. It manages overload
at the microservice granule such that each microservice monitors its load
status in real time and triggers load shedding in a collaborative manner among
its relevant services when overload is detected. DAGOR has been used in the
WeChat backend for five years. Experimental results show that DAGOR can benefit
high success rate of service even when the system is experiencing overload,
while ensuring fairness in the overload control.
","[{'version': 'v1', 'created': 'Mon, 11 Jun 2018 15:58:30 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Dec 2018 05:22:21 GMT'}, {'version': 'v3', 'created': 'Mon, 24 Dec 2018 04:29:41 GMT'}]",2018-12-27,"[['Zhou', 'Hao', ''], ['Chen', 'Ming', ''], ['Lin', 'Qian', ''], ['Wang', 'Yong', ''], ['She', 'Xiaobin', ''], ['Liu', 'Sifan', ''], ['Gu', 'Rui', ''], ['Ooi', 'Beng Chin', ''], ['Yang', 'Junfeng', '']]","['overload control', 'service admission control', 'microservice architecture', 'WeChat']"
2961,1502.00355,Gang Mei,"Kunyang Zhao, Gang Mei, Nengxiong Xu, and Jiayin Zhang","On the Accelerating of Two-dimensional Smart Laplacian Smoothing on the
  GPU","The author declares that this paper has been submitted to the
  International Conference on Computational Science ICCS 2015. 10 pages, 4
  figures","Journal of Information & Computational Science 12:13 (2015)
  5133-5143",10.12733/jics20106587,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a GPU-accelerated implementation of two-dimensional Smart
Laplacian smoothing. This implementation is developed under the guideline of
our paradigm for accelerating Laplacianbased mesh smoothing [13]. Two types of
commonly used data layouts, Array-of-Structures (AoS) and Structure-of-Arrays
(SoA) are used to represent triangular meshes in our implementation. Two
iteration forms that have different choices of the swapping of intermediate
data are also adopted. Furthermore, the feature CUDA Dynamic Parallelism (CDP)
is employed to realize the nested parallelization in Smart Laplacian smoothing.
Experimental results demonstrate that: (1) our implementation can achieve the
speedups of up to 44x on the GPU GT640; (2) the data layout AoS can always
obtain better efficiency than the SoA layout; (3) the form that needs to swap
intermediate nodal coordinates is always slower than the one that does not swap
data; (4) the version of our implementation with the use of the feature CDP is
slightly faster than the version where the CDP is not adopted.
","[{'version': 'v1', 'created': 'Mon, 2 Feb 2015 04:32:42 GMT'}]",2016-01-25,"[['Zhao', 'Kunyang', ''], ['Mei', 'Gang', ''], ['Xu', 'Nengxiong', ''], ['Zhang', 'Jiayin', '']]","['GPU', 'CUDA', 'Mesh Smoothing', 'Laplacian Smoothing', 'Data Dependency']"
2962,1904.01381,Abuzer Yakaryilmaz,"Aleksejs Naumovs, Maksims Dimitrijevs, and Abuzer Yakary{\i}lmaz","The minimal probabilistic and quantum finite automata recognizing
  uncountably many languages with fixed cutpoints","12 pages, minor revisions, changing the format to ""dmtcs-episciences""
  style","Discrete Mathematics & Theoretical Computer Science, vol. 22 no.
  1, Automata, Logic and Semantics (April 30, 2020) dmtcs:6440",10.23638/DMTCS-22-1-13,,cs.FL cs.CC quant-ph,http://creativecommons.org/licenses/by/4.0/,"  It is known that 2-state binary and 3-state unary probabilistic finite
automata and 2-state unary quantum finite automata recognize uncountably many
languages with cutpoints. These results have been obtained by associating each
recognized language with a cutpoint and then by using the fact that there are
uncountably many cutpoints. In this note, we prove the same results for fixed
cutpoints: each recognized language is associated with an automaton (i.e.,
algorithm), and the proofs use the fact that there are uncountably many
automata. For each case, we present a new construction.
","[{'version': 'v1', 'created': 'Tue, 2 Apr 2019 12:52:20 GMT'}, {'version': 'v2', 'created': 'Fri, 10 May 2019 10:52:53 GMT'}, {'version': 'v3', 'created': 'Thu, 2 Apr 2020 16:22:43 GMT'}, {'version': 'v4', 'created': 'Tue, 28 Apr 2020 12:36:57 GMT'}]",2020-08-25,"[['Naumovs', 'Aleksejs', ''], ['Dimitrijevs', 'Maksims', ''], ['Yakaryılmaz', 'Abuzer', '']]","['probabilistic automaton', 'quantum automaton', 'uncountable languages', 'recognition with cutpoint', 'unarylanguages']"
2963,1806.05837,Vaibhav Saini,"Vaibhav Saini, Farima Farmahinifarahani, Yadong Lu, Pierre Baldi, and
  Cristina Lopes",Oreo: Detection of Clones in the Twilight Zone,,"Proceedings of the 26th ACM Joint Meeting on European Software
  Engineering Conference and Symposium on the Foundations of Software
  Engineering (2018) 354-365",10.1145/3236024.3236026,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Source code clones are categorized into four types of increasing difficulty
of detection, ranging from purely textual (Type-1) to purely semantic (Type-4).
Most clone detectors reported in the literature work well up to Type-3, which
accounts for syntactic differences. In between Type-3 and Type-4, however,
there lies a spectrum of clones that, although still exhibiting some syntactic
similarities, are extremely hard to detect -- the Twilight Zone. Most clone
detectors reported in the literature fail to operate in this zone. We present
Oreo, a novel approach to source code clone detection that not only detects
Type-1 to Type-3 clones accurately, but is also capable of detecting
harder-to-detect clones in the Twilight Zone. Oreo is built using a combination
of machine learning, information retrieval, and software metrics. We evaluate
the recall of Oreo on BigCloneBench, and perform manual evaluation for
precision. Oreo has both high recall and precision. More importantly, it pushes
the boundary in detection of clones with moderate to weak syntactic similarity
in a scalable manner.
","[{'version': 'v1', 'created': 'Fri, 15 Jun 2018 07:35:42 GMT'}]",2019-01-15,"[['Saini', 'Vaibhav', ''], ['Farmahinifarahani', 'Farima', ''], ['Lu', 'Yadong', ''], ['Baldi', 'Pierre', ''], ['Lopes', 'Cristina', '']]","['Clone detection', 'Machine Learning', 'Software Metrics', 'InformationRetrieval']"
2964,1903.08974,Jithin Jagannath,"Jithin Jagannath, Sean Furman, Anu Jagannath, Luther Ling, Andrew
  Burger, Andrew Drozd","HELPER: Heterogeneous Efficient Low Power Radio for Enabling Ad Hoc
  Emergency Public Safety Networks",,"Ad Hoc Networks, Volume 89, Pages 218-235, 2019",10.1016/j.adhoc.2019.03.010,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Natural and man-made disasters have been causing destruction and distress to
humanity all over the world. In these scenarios, communication infrastructures
are the most affected entities making emergency response operations extremely
challenging. This invokes a need to equip the affected people and the emergency
responders with the ability to rapidly set up and use independent means of
communication. Therefore, in this work, we present a complete end-to-end
solution that can connect survivors of a disaster with each other and the
authorities using a completely self-sufficient ad hoc network that can be setup
rapidly. Accordingly, we develop a Heterogeneous Efficient Low Power Radio
(HELPER) that acts as an access point for end-users to connect using custom
website application. These HELPERs then coordinate with each other to form a
LoRa based ad hoc network. To this end, we propose a novel cross-layer
optimized distributed energy-efficient routing (SEEK) algorithm that aims to
maximize the network lifetime. The HELPER is prototyped using WiFi enabled
Raspberry Pi and LoRa module that is configured to run using Li-ion batteries.
We implement the required cross-layer protocol stack along with the SEEK
routing algorithm. We have conducted demonstrations to establish the
feasibility of exchanging of text messages over the HELPER network, live map
updates, ability to send distress messages to authorities. Emergency responders
can leverage this technology to remotely monitor the connectivity of the
affected area and alert users of imminent dangers. SEEK algorithm was shown to
outperform a greedy geographical routing algorithm implemented on HELPER
testbed by up to 53 % in terms of network lifetime and up to 28 % in terms of
throughput. Overall, we hope this technology will become instrumental in
improving the efficiency and effectiveness of public safety activities.
","[{'version': 'v1', 'created': 'Thu, 21 Mar 2019 13:09:52 GMT'}]",2019-06-07,"[['Jagannath', 'Jithin', ''], ['Furman', 'Sean', ''], ['Jagannath', 'Anu', ''], ['Ling', 'Luther', ''], ['Burger', 'Andrew', ''], ['Drozd', 'Andrew', '']]","['Emergency ad hoc network', 'cross-layer optimization', 'energy-aware routing', 'publicsafety network', 'end-to-end solution', 'first responders']"
2965,1706.05851,Julia Belyakova,Julia Belyakova,Generic Approach to Certified Static Checking of Module-like Constructs,,,10.1145/3103111.3104045,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider the problem of certified static checking of
module-like constructs of programming languages. We argue that there are
algorithms and properties related to modules that can be defined and proven in
an abstract way. We advocate the design of a generic Coq library, which is
aimed to provide three building blocks for each checking mechanism:
propositional, computable, and correctness proofs. Implemented part of the
library is justified by applying it to a certified static checker of an
extension of STLC.
","[{'version': 'v1', 'created': 'Mon, 19 Jun 2017 09:39:01 GMT'}]",2017-06-20,"[['Belyakova', 'Julia', '']]","['certified software', 'Coq', 'generic programming', 'modules', 'interpreters', 'compilers']"
2966,cs/0101029,Paul M. Aoki,"Paul M. Aoki, Amy Hurst, Allison Woodruff",Tap Tips: Lightweight Discovery of Touchscreen Targets,,"Extended Abstracts, ACM SIGCHI Conf. on Human Factors in Computing
  Systems, Seattle, WA, March 2001, 237-238. ACM Press.",10.1145/634067.634208,,cs.HC,,"  We describe tap tips, a technique for providing touch-screen target location
hints. Tap tips are lightweight in that they are non-modal, appear only when
needed, require a minimal number of user gestures, and do not add to the
standard touchscreen gesture vocabulary. We discuss our implementation of tap
tips in an electronic guidebook system and some usability test results.
","[{'version': 'v1', 'created': 'Fri, 26 Jan 2001 07:27:02 GMT'}]",2007-05-23,"[['Aoki', 'Paul M.', ''], ['Hurst', 'Amy', ''], ['Woodruff', 'Allison', '']]","['Touchscreen', 'imagemap', 'usage tips']"
2967,1611.01286,Stefan Wagner,Stefan Wagner and Michael Meisinger,Integrating a Model of Analytical Quality Assurance into the V-Modell XT,"9 pages in Proceedings of the 3rd international workshop on Software
  quality assurance (SOQUA'06), ACM, 2006",,10.1145/1188895.1188906,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Economic models of quality assurance can be an important tool for decision
makers in software development projects. They enable to base quality assurance
planning on economical factors of the product and the used defect-detection
techniques. A variety of such models has been proposed but many are too
abstract to be used in practice. Furthermore, even the more concrete models
lack an integration with existing software development process models to
increase their applicability. This paper describes an integration of a thorough
stochastic model of the economics of analytical quality assurance with the
systems development process model V-Modell XT. The integration is done in a
modular way by providing a new process module - a concept directly available in
the V-Modell XT for extension purposes - related to analytical quality
assurance. In particular, we describe the work products, roles, and activities
defined in our new process module and their effects on existing V-Modell XT
elements.
","[{'version': 'v1', 'created': 'Fri, 4 Nov 2016 08:24:25 GMT'}]",2016-11-07,"[['Wagner', 'Stefan', ''], ['Meisinger', 'Michael', '']]","['Software quality economics', 'quality costs', 'quality model', 'quality assurance', 'process model', 'V-Modell']"
2968,1804.11149,Sheikh Shams Azam,"Sheikh Shams Azam, Manoj Raju, Venkatesh Pagidimarri, Vamsi
  Kasivajjala",Q-Map: Clinical Concept Mining from Clinical Documents,"6 pages, 1 figure","International Journal of Computer and Information Engineering,
  12(9), 2018, 691 - 696",10.5281/zenodo.1474513,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the past decade, there has been a steep rise in the data-driven analysis
in major areas of medicine, such as clinical decision support system, survival
analysis, patient similarity analysis, image analytics etc. Most of the data in
the field are well-structured and available in numerical or categorical formats
which can be used for experiments directly. But on the opposite end of the
spectrum, there exists a wide expanse of data that is intractable for direct
analysis owing to its unstructured nature which can be found in the form of
discharge summaries, clinical notes, procedural notes which are in human
written narrative format and neither have any relational model nor any standard
grammatical structure. An important step in the utilization of these texts for
such studies is to transform and process the data to retrieve structured
information from the haystack of irrelevant data using information retrieval
and data mining techniques. To address this problem, the authors present Q-Map
in this paper, which is a simple yet robust system that can sift through
massive datasets with unregulated formats to retrieve structured information
aggressively and efficiently. It is backed by an effective mining technique
which is based on a string matching algorithm that is indexed on curated
knowledge sources, that is both fast and configurable. The authors also briefly
examine its comparative performance with MetaMap, one of the most reputed tools
for medical concepts retrieval and present the advantages the former displays
over the latter.
","[{'version': 'v1', 'created': 'Mon, 30 Apr 2018 12:19:03 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Jul 2018 12:24:39 GMT'}]",2020-10-06,"[['Azam', 'Sheikh Shams', ''], ['Raju', 'Manoj', ''], ['Pagidimarri', 'Venkatesh', ''], ['Kasivajjala', 'Vamsi', '']]","['Information Retrieval (IR)', 'Unified Medical LanguageSystem(UMLS)', 'SyntaxBasedAnalysis', 'NaturalLanguageProcessing (NLP)', 'Medical Informatics']"
2969,1602.00370,Jian Tang,"Jian Tang, Jingzhou Liu, Ming Zhang and Qiaozhu Mei",Visualizing Large-scale and High-dimensional Data,WWW 2016,,10.1145/2872427.2883041,,cs.LG cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We study the problem of visualizing large-scale and high-dimensional data in
a low-dimensional (typically 2D or 3D) space. Much success has been reported
recently by techniques that first compute a similarity structure of the data
points and then project them into a low-dimensional space with the structure
preserved. These two steps suffer from considerable computational costs,
preventing the state-of-the-art methods such as the t-SNE from scaling to
large-scale and high-dimensional data (e.g., millions of data points and
hundreds of dimensions). We propose the LargeVis, a technique that first
constructs an accurately approximated K-nearest neighbor graph from the data
and then layouts the graph in the low-dimensional space. Comparing to t-SNE,
LargeVis significantly reduces the computational cost of the graph construction
step and employs a principled probabilistic model for the visualization step,
the objective of which can be effectively optimized through asynchronous
stochastic gradient descent with a linear time complexity. The whole procedure
thus easily scales to millions of high-dimensional data points. Experimental
results on real-world data sets demonstrate that the LargeVis outperforms the
state-of-the-art methods in both efficiency and effectiveness. The
hyper-parameters of LargeVis are also much more stable over different data
sets.
","[{'version': 'v1', 'created': 'Mon, 1 Feb 2016 03:01:33 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Apr 2016 03:59:57 GMT'}]",2016-04-06,"[['Tang', 'Jian', ''], ['Liu', 'Jingzhou', ''], ['Zhang', 'Ming', ''], ['Mei', 'Qiaozhu', '']]","['Visualization', 'big data', 'high-dimensional data']"
2970,1709.03221,Yuriy Brun,"Sainyam Galhotra, Yuriy Brun, Alexandra Meliou",Fairness Testing: Testing Software for Discrimination,"Sainyam Galhotra, Yuriy Brun, and Alexandra Meliou. 2017. Fairness
  Testing: Testing Software for Discrimination. In Proceedings of 2017 11th
  Joint Meeting of the European Software Engineering Conference and the ACM
  SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE),
  Paderborn, Germany, September 4-8, 2017 (ESEC/FSE'17).
  https://doi.org/10.1145/3106237.3106277, ESEC/FSE, 2017",,10.1145/3106237.3106277,,cs.SE cs.AI cs.CY cs.DB cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper defines software fairness and discrimination and develops a
testing-based method for measuring if and how much software discriminates,
focusing on causality in discriminatory behavior. Evidence of software
discrimination has been found in modern software systems that recommend
criminal sentences, grant access to financial products, and determine who is
allowed to participate in promotions. Our approach, Themis, generates efficient
test suites to measure discrimination. Given a schema describing valid system
inputs, Themis generates discrimination tests automatically and does not
require an oracle. We evaluate Themis on 20 software systems, 12 of which come
from prior work with explicit focus on avoiding discrimination. We find that
(1) Themis is effective at discovering software discrimination, (2)
state-of-the-art techniques for removing discrimination from algorithms fail in
many situations, at times discriminating against as much as 98% of an input
subdomain, (3) Themis optimizations are effective at producing efficient test
suites for measuring discrimination, and (4) Themis is more efficient on
systems that exhibit more discrimination. We thus demonstrate that fairness
testing is a critical aspect of the software development cycle in domains with
possible discrimination and provide initial tools for measuring software
discrimination.
","[{'version': 'v1', 'created': 'Mon, 11 Sep 2017 02:45:22 GMT'}]",2017-09-12,"[['Galhotra', 'Sainyam', ''], ['Brun', 'Yuriy', ''], ['Meliou', 'Alexandra', '']]","['Discrimination testing', 'fairness testing', 'software bias', 'testing']"
2971,1505.01342,Zohreh Zahedi,Zohreh Zahedi,"Analyzing readerships of International Iranian publications in Mendeley:
  an altmetrics study",in Persian,,10.6084/m9.figshare.1400482,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, the presence and distribution of both Mendeley readerships and
Web of Science citations for the publications published in the 43 Iranian
international journals indexed in Journal Citation Reports have been
investigated. The aim was to determine the impact, visibility and use of the
publications published by the Iranian international journals in Mendeley
compared to their citation impact; furthermore, to explore if there is any
relation between these two impact indicators (Mendeley readership counts and
WoS citation counts) for these publications. The DOIs of the 1,884 publications
used to extract the readerships data from Mendeley REST API in February 2014
and citations data until end of 2013 calculated using CWTS in-house WoS
database. SPSS (version 21) used to analyze the relationship between the
readerships and citations for those publications. The Mendeley usage
distribution both at the publication level (across publications years, fields
and document types) and at the user level (across users disciplines, academic
status and countries) have been investigated. These information will help to
understand the visibility and usage vs citation pattern and impact of Iranian
scientific outputs.
","[{'version': 'v1', 'created': 'Wed, 6 May 2015 12:38:35 GMT'}]",2015-05-07,"[['Zahedi', 'Zohreh', '']]","['altmetrics', 'Mendeley', 'JCR', 'WoS', 'Iranian international Publications; research evaluation']"
2972,1502.03561,Abba Ari Ado Adamou,"Ado Adamou Abba Ari (1 and 4), Abdelhak Gueroui (1), Nabila Labraoui
  (2) and Blaise Omer Yenke (3) ((1) PRiSM, University of Versailles
  St-Quentin-en-Yvelines France, (2) STIC University of Tlemcen Algeria, (3)
  LASE University of Ngaoundere Cameroon, (4) University of Maroua Cameroon)","Concepts and evolution of research in the field of wireless sensor
  networks",,"International Journal of Computer Networks & Communications. 7.1
  (2015) 81-98",10.5121/ijcnc.2015.7106,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The field of Wireless Sensor Networks (WSNs) is experiencing a resurgence of
interest and a continuous evolution in the scientific and industrial community.
The use of this particular type of ad hoc network is becoming increasingly
important in many contexts, regardless of geographical position and so,
according to a set of possible application. WSNs offer interesting low cost and
easily deployable solutions to perform a remote real time monitoring, target
tracking and recognition of physical phenomenon. The uses of these sensors
organized into a network continue to reveal a set of research questions
according to particularities target applications. Despite difficulties
introduced by sensor resources constraints, research contributions in this
field are growing day by day. In this paper, we present a comprehensive review
of most recent literature of WSNs and outline open research issues in this
field.
","[{'version': 'v1', 'created': 'Thu, 12 Feb 2015 08:27:03 GMT'}, {'version': 'v2', 'created': 'Wed, 13 May 2015 16:29:55 GMT'}]",2015-05-14,"[['Ari', 'Ado Adamou Abba', '', '1 and 4'], ['Gueroui', 'Abdelhak', ''], ['Labraoui', 'Nabila', ''], ['Yenke', 'Blaise Omer', '']]","['WSNs', 'protocols', 'sensor', 'applications', 'routing', 'services', 'survey', 'bio-inspired.  1']"
2973,1903.03366,Victor Kozyakin,Victor Kozyakin,"Caution, DOI! Bibliographic detective story in the era of digitalization","4 pages, title changed, numerous wording changes","Journal of Communications Technology and Electronics, 2019, Vol.
  64, No. 12, pp. 1523-1526",10.1134/S1064226919120076,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An example of inconsistencies in information provided by popular
bibliographic services is described and the reasons for these inconsistencies
are discussed.
","[{'version': 'v1', 'created': 'Fri, 8 Mar 2019 11:02:54 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Mar 2019 12:46:05 GMT'}, {'version': 'v3', 'created': 'Thu, 31 Oct 2019 10:18:02 GMT'}]",2020-02-06,"[['Kozyakin', 'Victor', '']]","['bibliography', 'digital object identifier', 'DOI', 'BibTeX', 'RIS']"
2974,0909.2089,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",Indirect jumps improve instruction sequence performance,"10 pages, definition of maximal internal delay and theorem 1 are
  stated more precise; presentation improved","Scientific Annals of Computer Science, 22(2):253--265, 2012",10.7561/SACS.2012.2.253,PRG0910,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Instruction sequences with direct and indirect jump instructions are as
expressive as instruction sequences with direct jump instructions only. We show
that, in the case where the number of instructions is not bounded, we are faced
with increases of the maximal internal delays of instruction sequences on
execution that are not bounded by a linear function if we strive for acceptable
increases of the lengths of instruction sequences on elimination of indirect
jump instructions.
","[{'version': 'v1', 'created': 'Fri, 11 Sep 2009 05:51:09 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Dec 2011 13:19:53 GMT'}, {'version': 'v3', 'created': 'Fri, 17 Aug 2012 15:06:20 GMT'}]",2012-11-20,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['instruction sequence performance', 'indirect jump instruction', 'maximal internal delay']"
2975,1412.3633,Jan Triska,Jan Triska and Vilem Vychodil,Logic of temporal attribute implications,,,10.1007/s10472-016-9526-6,,cs.LO cs.AI cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study logic for reasoning with if-then formulas describing dependencies
between attributes of objects which are observed in consecutive points in time.
We introduce semantic entailment of the formulas, show its fixed-point
characterization, investigate closure properties of model classes, present an
axiomatization and prove its completeness, and investigate alternative
axiomatizations and normalized proofs. We investigate decidability and
complexity issues of the logic and prove that the entailment problem is NP-hard
and belongs to EXPSPACE. We show that by restricting to predictive formulas,
the entailment problem is decidable in pseudo-linear time.
","[{'version': 'v1', 'created': 'Thu, 11 Dec 2014 12:41:51 GMT'}, {'version': 'v2', 'created': 'Mon, 4 May 2015 08:01:28 GMT'}]",2021-06-17,"[['Triska', 'Jan', ''], ['Vychodil', 'Vilem', '']]","['attribute implication', 'complete axiomatization', 'entailment']"
2976,1510.08877,Mike Thelwall,"Mike Thelwall, Paul Wilson",Regression for citation data: An evaluation of different methods,,"Journal of Informetrics, 8(4), 963-971 (2014)",10.1016/j.joi.2014.09.011,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Citations are increasingly used for research evaluations. It is therefore
important to identify factors affecting citation scores that are unrelated to
scholarly quality or usefulness so that these can be taken into account.
Regression is the most powerful statistical technique to identify these factors
and hence it is important to identify the best regression strategy for citation
data. Citation counts tend to follow a discrete lognormal distribution and, in
the absence of alternatives, have been investigated with negative binomial
regression. Using simulated discrete lognormal data (continuous lognormal data
rounded to the nearest integer) this article shows that a better strategy is to
add one to the citations, take their log and then use the general linear
(ordinary least squares) model for regression (e.g., multiple linear
regression, ANOVA), or to use the generalised linear model without the log.
Reasonable results can also be obtained if all the zero citations are
discarded, the log is taken of the remaining citation counts and then the
general linear model is used, or if the generalised linear model is used with
the continuous lognormal distribution. Similar approaches are recommended for
altmetric data, if it proves to be lognormally distributed.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2015 20:17:11 GMT'}]",2015-11-02,"[['Thelwall', 'Mike', ''], ['Wilson', 'Paul', '']]","['scientometrics', 'informetrics', 'altmetrics', 'citation distributions', 'lognormal', 'powerlaw', 'regression']"
2977,1202.4553,Horia Cornean,"Francois Bentosela, Horia D. Cornean, Nicola Marchetti",MIMO capacity for deterministic channel models: sublinear growth,"12 pages, to appear in Math. Meth. Appl. Sci",,10.1002/mma.2565,,cs.IT math-ph math.IT math.MP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This is the second paper of the authors in a series concerned with the
development of a deterministic model for the transfer matrix of a MIMO system.
Starting from the Maxwell equations, we have described in \cite{BCFM} the
generic structure of such a deterministic transfer matrix. In the current paper
we apply the results of \cite{BCFM} in order to study the (Shannon-Foschini)
capacity behavior of a MIMO system as a function of the deterministic spread
function of the environment, and the number of transmitting and receiving
antennas. The antennas are assumed to fill in a given, fixed volume. Under some
generic assumptions, we prove that the capacity grows much more slowly than
linearly with the number of antennas. These results reinforce previous
heuristic results obtained from statistical models of the transfer matrix,
which also predict a sublinear behavior.
","[{'version': 'v1', 'created': 'Tue, 21 Feb 2012 08:19:10 GMT'}]",2015-06-04,"[['Bentosela', 'Francois', ''], ['Cornean', 'Horia D.', ''], ['Marchetti', 'Nicola', '']]","['MIMO systems', 'Shannon-Foschini capacity', 'deterministic spread function', 'Fredholmdeterminants']"
2978,1507.03923,Mario Alviano,Mario Alviano and Wolfgang Faber and Martin Gebser,"Rewriting recursive aggregates in answer set programming: back to
  monotonicity",,Theory and Practice of Logic Programming 15 (2015) 559-573,10.1017/S1471068415000228,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aggregation functions are widely used in answer set programming for
representing and reasoning on knowledge involving sets of objects collectively.
Current implementations simplify the structure of programs in order to optimize
the overall performance. In particular, aggregates are rewritten into simpler
forms known as monotone aggregates. Since the evaluation of normal programs
with monotone aggregates is in general on a lower complexity level than the
evaluation of normal programs with arbitrary aggregates, any faithful
translation function must introduce disjunction in rule heads in some cases.
However, no function of this kind is known. The paper closes this gap by
introducing a polynomial, faithful, and modular translation for rewriting
common aggregation functions into the simpler form accepted by current solvers.
A prototype system allows for experimenting with arbitrary recursive
aggregates, which are also supported in the recent version 4.5 of the grounder
\textsc{gringo}, using the methods presented in this paper.
  To appear in Theory and Practice of Logic Programming (TPLP), Proceedings of
ICLP 2015.
","[{'version': 'v1', 'created': 'Tue, 14 Jul 2015 16:57:33 GMT'}]",2020-02-19,"[['Alviano', 'Mario', ''], ['Faber', 'Wolfgang', ''], ['Gebser', 'Martin', '']]","['answer set programming; polynomial', 'faithful', 'modular translation; aggregationfunctions']"
2979,1610.05115,Timothy Highley Jr.,"Timothy Highley, Hoang Le","Tropical Vertex-Disjoint Cycles of a Vertex-Colored Digraph: Barter
  Exchange with Multiple Items Per Agent",Published in Discrete Mathematics and Theoretical Computer Science,"Discrete Mathematics & Theoretical Computer Science, vol. 20 no.
  2, Analysis of Algorithms (July 31, 2018) dmtcs:4690",10.23638/DMTCS-20-2-1,,cs.DS cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a barter exchange market, agents bring items and seek to exchange their
items with one another. Agents may agree to a k-way exchange involving a cycle
of k agents. A barter exchange market can be represented by a digraph where the
vertices represent items and the edges out of a vertex indicate the items that
an agent is willing to accept in exchange for that item. It is known that the
problem of finding a set of vertex-disjoint cycles with the maximum total
number of vertices (MAX-SIZE-EXCHANGE) can be solved in polynomial time. We
consider a barter exchange where each agent may bring multiple items, and items
of the same agent are represented by vertices with the same color. A set of
cycles is said to be tropical if for every color there is a cycle that contains
a vertex of that color. We show that the problem of determining whether there
exists a tropical set of vertex-disjoint cycles in a digraph
(TROPICAL-EXCHANGE) is NP-complete and APX-hard. This is equivalent to
determining whether it is possible to arrange an exchange of items among agents
such that every agent trades away at least one item. TROPICAL-MAX-SIZE-EXCHANGE
is a similar problem, where the goal is to find a set of vertex-disjoint cycles
that contains the maximum number of vertices and also contains all of the
colors in the graph. We show that this problem is likewise NP-complete and
APX-hard. For the restricted case where there are at most two vertices of each
color (corresponding to a restriction that each agent may bring at most two
items), both problems remain NP-hard but are in APX. Finally, we consider
MAX-SIZE-TROPICAL-EXCHANGE, where the set of cycles must primarily include as
many colors as possible and secondarily include as many vertices as possible.
We show that this problem is NP-hard.
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2016 01:10:21 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Mar 2017 18:25:43 GMT'}, {'version': 'v3', 'created': 'Thu, 3 Aug 2017 20:16:11 GMT'}, {'version': 'v4', 'created': 'Fri, 6 Apr 2018 21:54:41 GMT'}, {'version': 'v5', 'created': 'Wed, 18 Jul 2018 03:36:20 GMT'}]",2019-03-14,"[['Highley', 'Timothy', ''], ['Le', 'Hoang', '']]","['vertex-disjoint cycles', 'vertex-colored digraph', 'barter exchange', 'kidney exchange', 'assignment problem']"
2980,1211.4867,Fa\^i\c{c}al Felhi,Fa\^i\c{c}al Felhi and Jalel Akaichi,"Adaptation of Web services to the context based on workflow: Approach
  for self-adaptation of service-oriented architectures to the context","14 pages, 4 figures, 1 Code; International Journal of Web & Semantic
  Technology (IJWesT) Vol.3, No.4, October 2012. arXiv admin note: substantial
  text overlap with arXiv:1203.0400 by other authors",,10.5121/ijwest.2012.3401,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The emergence of Web services in the information space, as well as the
advanced technology of SOA, give tremendous opportunities for users in an
ambient space or distant, empowerment and organizations in various fields
application, such as geolocation, E-learning, healthcare, digital government,
etc.. In fact, Web services are a solution for the integration of distributed
information systems, autonomous, heterogeneous and self-adaptable to the
context. However, as Web services can evolve in a dynamic environment in a
well-defined context and according to events automatically, such as time,
temperature, location, authentication, etc.. We are interested in improving
their SOA to empower the Web services to be self adaptive contexts. In this
paper, we propose a new trend of self adaptability of Web services context.
Then applying these requirements in the architecture of the platform of
adaptability to context WComp, by integrating the workflow. Our work is
illustrated by a case study of authentication.
","[{'version': 'v1', 'created': 'Tue, 20 Nov 2012 10:38:45 GMT'}]",2012-12-04,"[['Felhi', 'Faîçal', ''], ['Akaichi', 'Jalel', '']]","['Web services', 'SOA', 'ambient computing', 'adaptability', 'Self-adaptability', 'Aspect', 'platforms']"
2981,1309.0326,Micha{\l} {\L}opuszy\'nski,"Micha{\l} {\L}opuszy\'nski, {\L}ukasz Bolikowski","Tagging Scientific Publications using Wikipedia and Natural Language
  Processing Tools. Comparison on the ArXiv Dataset",,"Communications in Computer and Information Science Volume 416,
  Springer 2014, pp 16-27",10.1007/978-3-319-08425-1_3,,cs.CL cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we compare two simple methods of tagging scientific
publications with labels reflecting their content. As a first source of labels
Wikipedia is employed, second label set is constructed from the noun phrases
occurring in the analyzed corpus. We examine the statistical properties and the
effectiveness of both approaches on the dataset consisting of abstracts from
0.7 million of scientific documents deposited in the ArXiv preprint collection.
We believe that obtained tags can be later on applied as useful document
features in various machine learning tasks (document similarity, clustering,
topic modelling, etc.).
","[{'version': 'v1', 'created': 'Mon, 2 Sep 2013 09:09:27 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Aug 2014 14:30:21 GMT'}, {'version': 'v3', 'created': 'Mon, 3 Nov 2014 14:48:29 GMT'}]",2014-11-04,"[['Łopuszyński', 'Michał', ''], ['Bolikowski', 'Łukasz', '']]","['tagging document collections', 'natural language processing', 'Wikipedia']"
2982,1707.08551,Hao Dong,"Hao Dong, Akara Supratak, Luo Mai, Fangde Liu, Axel Oehmichen, Simiao
  Yu, Yike Guo",TensorLayer: A Versatile Library for Efficient Deep Learning Development,ACM Multimedia 2017,,10.1145/3123266.3129391,,cs.LG cs.DC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning has enabled major advances in the fields of computer vision,
natural language processing, and multimedia among many others. Developing a
deep learning system is arduous and complex, as it involves constructing neural
network architectures, managing training/trained models, tuning optimization
process, preprocessing and organizing data, etc. TensorLayer is a versatile
Python library that aims at helping researchers and engineers efficiently
develop deep learning systems. It offers rich abstractions for neural networks,
model and data management, and parallel workflow mechanism. While boosting
efficiency, TensorLayer maintains both performance and scalability. TensorLayer
was released in September 2016 on GitHub, and has helped people from academia
and industry develop real-world applications of deep learning.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 17:29:49 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Aug 2017 10:26:34 GMT'}, {'version': 'v3', 'created': 'Thu, 3 Aug 2017 14:48:16 GMT'}]",2017-08-04,"[['Dong', 'Hao', ''], ['Supratak', 'Akara', ''], ['Mai', 'Luo', ''], ['Liu', 'Fangde', ''], ['Oehmichen', 'Axel', ''], ['Yu', 'Simiao', ''], ['Guo', 'Yike', '']]","['Deep Learning', 'Reinforcement Learning', 'Parallel Computation', 'Computer Vision', 'Natural Language Processing', 'Data Management']"
2983,1006.1187,Secretary Aircc Journal,"S. V. Sheela and K. R. Radhika (B. M. S. College of Engineering -
  Bangalore, India)",Biometric Authentication using Nonparametric Methods,20 pages,"International Journal of Computer Science and Information
  Technology 2.3 (2010) 114-133",10.5121/ijcsit.2010.2309,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The physiological and behavioral trait is employed to develop biometric
authentication systems. The proposed work deals with the authentication of iris
and signature based on minimum variance criteria. The iris patterns are
preprocessed based on area of the connected components. The segmented image
used for authentication consists of the region with large variations in the
gray level values. The image region is split into quadtree components. The
components with minimum variance are determined from the training samples. Hu
moments are applied on the components. The summation of moment values
corresponding to minimum variance components are provided as input vector to
k-means and fuzzy kmeans classifiers. The best performance was obtained for MMU
database consisting of 45 subjects. The number of subjects with zero False
Rejection Rate [FRR] was 44 and number of subjects with zero False Acceptance
Rate [FAR] was 45. This paper addresses the computational load reduction in
off-line signature verification based on minimal features using k-means, fuzzy
k-means, k-nn, fuzzy k-nn and novel average-max approaches. FRR of 8.13% and
FAR of 10% was achieved using k-nn classifier. The signature is a biometric,
where variations in a genuine case, is a natural expectation. In the genuine
signature, certain parts of signature vary from one instance to another. The
system aims to provide simple, fast and robust system using less number of
features when compared to state of art works.
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2010 07:15:37 GMT'}]",2010-07-15,"[['Sheela', 'S. V.', '', 'B. M. S. College of Engineering -\n  Bangalore, India'], ['Radhika', 'K. R.', '', 'B. M. S. College of Engineering -\n  Bangalore, India']]","['Off-line Signature', 'Iris', 'Minimum Variance Quadtree Components', 'Hu Moments']"
2984,1203.2081,Matthew Felice Pace,Matthew Felice Pace (University of Warwick),BSP vs MapReduce,"13 pages, appeared at ICCS 2012",,10.1016/j.procs.2012.04.026,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The MapReduce framework has been generating a lot of interest in a wide range
of areas. It has been widely adopted in industry and has been used to solve a
number of non-trivial problems in academia. Putting MapReduce on strong
theoretical foundations is crucial in understanding its capabilities. This work
links MapReduce to the BSP model of computation, underlining the relevance of
BSP to modern parallel algorithm design and defining a subclass of BSP
algorithms that can be efficiently implemented in MapReduce.
","[{'version': 'v1', 'created': 'Fri, 9 Mar 2012 13:42:03 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Jun 2012 23:06:58 GMT'}]",2012-06-19,"[['Pace', 'Matthew Felice', '', 'University of Warwick']]","['MapReduce', 'BSP', 'Parallel Algorithms']"
2985,1709.04747,Jerome Darmont,"Ciprian-Octavian Truic\u{a} (UPB), J\'er\^ome Darmont (ERIC)",T${}^2$K${}^2$: The Twitter Top-K Keywords Benchmark,,"21st European Conference on Advances in Databases and Information
  Systems (ADBIS 2017), Sep 2017, Nicosie, Cyprus. Springer, Communications in
  Computer and Information Science, 767, pp.21-28, 2017, New Trends in
  Databases and Information Systems",10.1007/978-3-319-67162-8,,cs.DB cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information retrieval from textual data focuses on the construction of
vocabularies that contain weighted term tuples. Such vocabularies can then be
exploited by various text analysis algorithms to extract new knowledge, e.g.,
top-k keywords, top-k documents, etc. Top-k keywords are casually used for
various purposes, are often computed on-the-fly, and thus must be efficiently
computed. To compare competing weighting schemes and database implementations,
benchmarking is customary. To the best of our knowledge, no benchmark currently
addresses these problems. Hence, in this paper, we present a top-k keywords
benchmark, T${}^2$K${}^2$, which features a real tweet dataset and queries with
various complexities and selectivities. T${}^2$K${}^2$ helps evaluate weighting
schemes and database implementations in terms of computing performance. To
illustrate T${}^2$K${}^2$'s relevance and genericity, we successfully performed
tests on the TF-IDF and Okapi BM25 weighting schemes, on one hand, and on
different relational (Oracle, PostgreSQL) and document-oriented (MongoDB)
database implementations, on the other hand.
","[{'version': 'v1', 'created': 'Thu, 14 Sep 2017 13:01:51 GMT'}]",2017-09-15,"[['Truică', 'Ciprian-Octavian', '', 'UPB'], ['Darmont', 'Jérôme', '', 'ERIC']]","['Top-k keywords', 'Benchmark', 'Term weighting', 'Database systems']"
2986,1210.7669,Pooja Maknikar,Pooja Maknikar,"Performance Evaluation of Different Techniques for texture
  Classification","Performance evaluation of Wavelet transform and Co-occurrence matrix
  method was done using energy as extracted feature on the basis of Time
  complexity and accuracy basis; pp.353-361,2012",,10.5121/csit.2012.2434,,cs.CV,http://creativecommons.org/licenses/by/3.0/,"  Texture is the term used to characterize the surface of a given object or
phenomenon and is an important feature used in image processing and pattern
recognition. Our aim is to compare various Texture analyzing methods and
compare the results based on time complexity and accuracy of classification.
The project describes texture classification using Wavelet Transform and Co
occurrence Matrix. Comparison of features of a sample texture with database of
different textures is performed. In wavelet transform we use the Haar, Symlets
and Daubechies wavelets. We find that, thee Haar wavelet proves to be the most
efficient method in terms of performance assessment parameters mentioned above.
Comparison of Haar wavelet and Co-occurrence matrix method of classification
also goes in the favor of Haar. Though the time requirement is high in the
later method, it gives excellent results for classification accuracy except if
the image is rotated.
","[{'version': 'v1', 'created': 'Mon, 29 Oct 2012 14:05:27 GMT'}]",2012-10-30,"[['Maknikar', 'Pooja', '']]","['texture', 'wavelets', 'co-occurrence matrix', 'comparison']"
2987,1503.06300,Rylan Conway,Rylan T. Conway and Evan W. Sangaline,"A Monte Carlo Simulation Approach for Quantitatively Evaluating Keyboard
  Layouts for Gesture Input","24 pages, 11 figures, 1 table",,10.1016/j.ijhcs.2016.10.001,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Gesture typing is a method of text entry that is ergonomically well-suited to
the form factor of touchscreen devices and allows for much faster input than
tapping each letter individually. The QWERTY keyboard was, however, not
designed with gesture input in mind and its particular layout results in a high
frequency of gesture recognition errors. In this paper, we describe a new
approach to quantifying the frequency of gesture input recognition errors
through the use of modeling and simulating realistically imperfect user input.
We introduce new methodologies for modeling randomized gesture inputs,
efficiently reconstructing words from gestures on arbitrary keyboard layouts,
and using these in conjunction with a frequency weighted lexicon to perform
Monte Carlo evaluations of keyboard error rates or any other arbitrary metric.
An open source framework, Dodona, is also provided that allows for these
techniques to be easily employed and customized in the evaluation of a wide
spectrum of possible keyboards and input methods. Finally, we perform an
optimization procedure over permutations of the QWERTY keyboard to demonstrate
the effectiveness of this approach and describe ways that future analyses can
build upon these results.
","[{'version': 'v1', 'created': 'Sat, 21 Mar 2015 13:32:59 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Nov 2016 16:29:19 GMT'}]",2016-11-22,"[['Conway', 'Rylan T.', ''], ['Sangaline', 'Evan W.', '']]","['touchscreen keyboards', 'gesture input', 'model-based design', 'Monte Carlo simulation']"
2988,1501.01203,Saikat Majumder,"Saikat Majumder, Shrish Verma","Iterative network-channel decoding with cooperative space-time
  transmission","11 pages in International Journal of Ad hoc, Sensor & Ubiquitous
  Computing (IJASUC) Vol.5, No.6, December 2014",,10.5121/ijasuc.2014.5602,,cs.IT cs.MM math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the most efficient methods of exploiting space diversity for portable
wireless devices is cooperative communication utilizing space-time block codes.
In cooperative communication, users besides communicating their own
information, also relay the information of other users. In this paper we
investigate a scheme where cooperation is achieved using two methods, namely,
distributed space-time coding and network coding. Two cooperating users utilize
Alamouti space time code for inter-user cooperation and in addition utilize a
third relay which performs network coding. The third relay does not have any of
its information to be sent. In this paper we propose a scheme utilizing
convolutional code based network coding, instead of conventional XOR based
network code and utilize iterative joint network-channel decoder for efficient
decoding. Extrinsic information transfer (EXIT) chart analysis is performed to
investigate the convergence property of the proposed decoder.
","[{'version': 'v1', 'created': 'Tue, 6 Jan 2015 15:32:35 GMT'}]",2015-01-07,"[['Majumder', 'Saikat', ''], ['Verma', 'Shrish', '']]","['Network coding', 'Iterative decoder', 'Space-time code', 'Cooperative communication']"
2989,0808.2428,Philip Davis,Philip M. Davis,"Author-choice open access publishing in the biological and medical
  literature: a citation analysis",citation changes; final manuscript,"JASIST, 60(1):3-8, 2008",10.1002/asi.20965,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, we analyze the citations to articles published in 11
biological and medical journals from 2003 to 2007 that employ author-choice
open access models. Controlling for known explanatory predictors of citations,
only 2 of the 11 journals show positive and significant open access effects.
Analyzing all journals together, we report a small but significant increase in
article citations of 17%. In addition, there is strong evidence to suggest that
the open access advantage is declining by about 7% per year, from 32% in 2004
to 11% in 2007.
","[{'version': 'v1', 'created': 'Mon, 18 Aug 2008 17:02:59 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Sep 2008 02:24:03 GMT'}, {'version': 'v3', 'created': 'Fri, 12 Dec 2008 19:08:51 GMT'}]",2009-09-29,"[['Davis', 'Philip M.', '']]","['open access publication', 'citation analysis', 'linear regression', 'cost-benefit analysis']"
2990,0808.2668,Panos Papadimitratos,"Marcin Poturalski, Panos Papadimitratos and Jean-Pierre Hubaux","Secure Neighbor Discovery in Wireless Networks: Formal Investigation of
  Possibility",,"ACM Symposium on Information, Computer and Communications Security
  (ASIACCS), pages 189{200, Tokyo, Japan, March 2008",,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless communication enables a broad spectrum of applications, ranging from
commodity to tactical systems. Neighbor discovery (ND), that is, determining
which devices are within direct radio communication, is a building block of
network protocols and applications, and its vulnerability can severely
compromise their functionalities. A number of proposals to secure ND have been
published, but none have analyzed the problem formally. In this paper, we
contribute such an analysis: We build a formal model capturing salient
characteristics of wireless systems, most notably obstacles and interference,
and we provide a specification of a basic variant of the ND problem. Then, we
derive an impossibility result for a general class of protocols we term
""time-based protocols,"" to which many of the schemes in the literature belong.
We also identify the conditions under which the impossibility result is lifted.
Moreover, we explore a second class of protocols we term ""time- and
location-based protocols,"" and prove they can secure ND.
","[{'version': 'v1', 'created': 'Tue, 19 Aug 2008 22:54:32 GMT'}]",2009-01-05,"[['Poturalski', 'Marcin', ''], ['Papadimitratos', 'Panos', ''], ['Hubaux', 'Jean-Pierre', '']]","['wireless networks security', 'secure neighbor discovery', 'relayattack']"
2991,1005.1757,Secretary Aircc Journal,"Ubaid Abbasi and Toufik Ahmed (University of Bordeaux, France)",Architecture for Cooperative Prefetching in P2P Video-on- Demand System,"13 Pages, IJCNC","International Journal of Computer Networks & Communications 2.3
  (2010) 126-138",10.5121/ijcnc.2010.2310,,cs.MM,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Most P2P VoD schemes focused on service architectures and overlays
optimization without considering segments rarity and the performance of
prefetching strategies. As a result, they cannot better support VCRoriented
service in heterogeneous environment having clients using free VCR controls.
Despite the remarkable popularity in VoD systems, there exist no prior work
that studies the performance gap between different prefetching strategies. In
this paper, we analyze and understand the performance of different prefetching
strategies. Our analytical characterization brings us not only a better
understanding of several fundamental tradeoffs in prefetching strategies, but
also important insights on the design of P2P VoD system. On the basis of this
analysis, we finally proposed a cooperative prefetching strategy called
""cooching"". In this strategy, the requested segments in VCR interactivities are
prefetched into session beforehand using the information collected through
gossips. We evaluate our strategy through extensive simulations. The results
indicate that the proposed strategy outperforms the existing prefetching
mechanisms.
","[{'version': 'v1', 'created': 'Tue, 11 May 2010 08:42:18 GMT'}]",2010-07-15,"[['Abbasi', 'Ubaid', '', 'University of Bordeaux, France'], ['Ahmed', 'Toufik', '', 'University of Bordeaux, France']]","['P2P Network', 'Video on Demand (VoD)', 'Data Prefetching', 'Quality of Service (QoS)']"
2992,1904.00003,Duilio Balsamo,"Duilio Balsamo, Paolo Bajardi, Andr\'e Panisson","Firsthand Opiates Abuse on Social Media: Monitoring Geospatial Patterns
  of Interest Through a Digital Cohort",Proceedings of the 2019 World Wide Web Conference (WWW '19),,10.1145/3308558.3313634,,cs.CY cs.SI physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  In the last decade drug overdose deaths reached staggering proportions in the
US. Besides the raw yearly deaths count that is worrisome per se, an alarming
picture comes from the steep acceleration of such rate that increased by 21%
from 2015 to 2016. While traditional public health surveillance suffers from
its own biases and limitations, digital epidemiology offers a new lens to
extract signals from Web and Social Media that might be complementary to
official statistics. In this paper we present a computational approach to
identify a digital cohort that might provide an updated and complementary view
on the opioid crisis. We introduce an information retrieval algorithm suitable
to identify relevant subspaces of discussion on social media, for mining data
from users showing explicit interest in discussions about opioid consumption in
Reddit. Moreover, despite the pseudonymous nature of the user base, almost 1.5
million users were geolocated at the US state level, resembling the census
population distribution with a good agreement. A measure of prevalence of
interest in opiate consumption has been estimated at the state level, producing
a novel indicator with information that is not entirely encoded in the standard
surveillance. Finally, we further provide a domain specific vocabulary
containing informal lexicon and street nomenclature extracted by user-generated
content that can be used by researchers and practitioners to implement novel
digital public health surveillance methodologies for supporting policy makers
in fighting the opioid epidemic.
","[{'version': 'v1', 'created': 'Thu, 28 Mar 2019 15:44:44 GMT'}]",2019-04-02,"[['Balsamo', 'Duilio', ''], ['Bajardi', 'Paolo', ''], ['Panisson', 'André', '']]","['Online disease monitoring', 'Opioid epidemic', 'Reddit']"
2993,1102.1536,Nabil Belgasmi,"Nabil Belgasmi (SOIE), Lamjed Ben Said (SOIE), Khaled Gh\'edira (SOIE)","Evolutionary multiobjective optimization of the multi-location
  transshipment problem",,"Operational Research 8, 2 (2008) 167-183",10.1007/s12351-008-0015-5,,cs.AI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a multi-location inventory system where inventory choices at each
location are centrally coordinated. Lateral transshipments are allowed as
recourse actions within the same echelon in the inventory system to reduce
costs and improve service level. However, this transshipment process usually
causes undesirable lead times. In this paper, we propose a multiobjective model
of the multi-location transshipment problem which addresses optimizing three
conflicting objectives: (1) minimizing the aggregate expected cost, (2)
maximizing the expected fill rate, and (3) minimizing the expected
transshipment lead times. We apply an evolutionary multiobjective optimization
approach using the strength Pareto evolutionary algorithm (SPEA2), to
approximate the optimal Pareto front. Simulation with a wide choice of model
parameters shows the different trades-off between the conflicting objectives.
","[{'version': 'v1', 'created': 'Tue, 8 Feb 2011 08:54:32 GMT'}]",2011-02-10,"[['Belgasmi', 'Nabil', '', 'SOIE'], ['Said', 'Lamjed Ben', '', 'SOIE'], ['Ghédira', 'Khaled', '', 'SOIE']]","['Multi-Location Transshipment Problem', 'Multiobjective Optimization Problems', 'Multiobjective Evolutionary Algorithms', 'Pareto optimality']"
2994,1507.03920,Mario Alviano,Mario Alviano and Rafael Penaloza,Fuzzy Answer Set Computation via Satisfiability Modulo Theories,,Theory and Practice of Logic Programming 15 (2015) 588-603,10.1017/S1471068415000241,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fuzzy answer set programming (FASP) combines two declarative frameworks,
answer set programming and fuzzy logic, in order to model reasoning by default
over imprecise information. Several connectives are available to combine
different expressions; in particular the \Godel and \Luka fuzzy connectives are
usually considered, due to their properties. Although the \Godel conjunction
can be easily eliminated from rule heads, we show through complexity arguments
that such a simplification is infeasible in general for all other connectives.
%, even if bodies are restricted to \Luka or \Godel conjunctions. The paper
analyzes a translation of FASP programs into satisfiability modulo
theories~(SMT), which in general produces quantified formulas because of the
minimality of the semantics. Structural properties of many FASP programs allow
to eliminate the quantification, or to sensibly reduce the number of quantified
variables. Indeed, integrality constraints can replace recursive rules commonly
used to force Boolean interpretations, and completion subformulas can guarantee
minimality for acyclic programs with atomic heads. Moreover, head cycle free
rules can be replaced by shifted subprograms, whose structure depends on the
eliminated head connective, so that ordered completion may replace the
minimality check if also \Luka disjunction in rule bodies is acyclic. The paper
also presents and evaluates a prototype system implementing these translations.
  To appear in Theory and Practice of Logic Programming (TPLP), Proceedings of
ICLP 2015.
","[{'version': 'v1', 'created': 'Tue, 14 Jul 2015 16:52:05 GMT'}]",2020-02-19,"[['Alviano', 'Mario', ''], ['Penaloza', 'Rafael', '']]","['answer set programming', 'fuzzy logic', 'satisfiability modulo theories']"
2995,1802.06305,Mohammad Saeid Mahdavinejad,"Mohammad Saeid Mahdavinejad, Mohammadreza Rezvan, Mohammadamin
  Barekatain, Peyman Adibi, Payam Barnaghi, Amit P. Sheth",Machine learning for Internet of Things data analysis: A survey,Digital Communications and Networks (2017),,10.1016/j.dcan.2017.10.002,,cs.LG cs.CY cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rapid developments in hardware, software, and communication technologies have
allowed the emergence of Internet-connected sensory devices that provide
observation and data measurement from the physical world. By 2020, it is
estimated that the total number of Internet-connected devices being used will
be between 25 and 50 billion. As the numbers grow and technologies become more
mature, the volume of data published will increase. Internet-connected devices
technology, referred to as Internet of Things (IoT), continues to extend the
current Internet by providing connectivity and interaction between the physical
and cyber worlds. In addition to increased volume, the IoT generates Big Data
characterized by velocity in terms of time and location dependency, with a
variety of multiple modalities and varying data quality. Intelligent processing
and analysis of this Big Data is the key to developing smart IoT applications.
This article assesses the different machine learning methods that deal with the
challenges in IoT data by considering smart cities as the main use case. The
key contribution of this study is presentation of a taxonomy of machine
learning algorithms explaining how different techniques are applied to the data
in order to extract higher level information. The potential and challenges of
machine learning for IoT data analytics will also be discussed. A use case of
applying Support Vector Machine (SVM) on Aarhus Smart City traffic data is
presented for a more detailed exploration.
","[{'version': 'v1', 'created': 'Sat, 17 Feb 2018 22:37:17 GMT'}]",2018-02-20,"[['Mahdavinejad', 'Mohammad Saeid', ''], ['Rezvan', 'Mohammadreza', ''], ['Barekatain', 'Mohammadamin', ''], ['Adibi', 'Peyman', ''], ['Barnaghi', 'Payam', ''], ['Sheth', 'Amit P.', '']]","['Machine Learning', 'Internet of Things', 'Smart Data', 'Smart City']"
2996,1810.11573,Fuad Noman,"Fuad Noman, Chee-Ming Ting, Sh-Hussain Salleh, and Hernando Ombao","Short-segment heart sound classification using an ensemble of deep
  convolutional neural networks","8 pages, 1 figure, conference",,10.1109/ICASSP.2019.8682668,,cs.SD cs.LG eess.AS eess.SP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a framework based on deep convolutional neural networks
(CNNs) for automatic heart sound classification using short-segments of
individual heart beats. We design a 1D-CNN that directly learns features from
raw heart-sound signals, and a 2D-CNN that takes inputs of two- dimensional
time-frequency feature maps based on Mel-frequency cepstral coefficients
(MFCC). We further develop a time-frequency CNN ensemble (TF-ECNN) combining
the 1D-CNN and 2D-CNN based on score-level fusion of the class probabilities.
On the large PhysioNet CinC challenge 2016 database, the proposed CNN models
outperformed traditional classifiers based on support vector machine and hidden
Markov models with various hand-crafted time- and frequency-domain features.
Best classification scores with 89.22% accuracy and 89.94% sensitivity were
achieved by the ECNN, and 91.55% specificity and 88.82% modified accuracy by
the 2D-CNN alone on the test set.
","[{'version': 'v1', 'created': 'Sat, 27 Oct 2018 01:32:27 GMT'}]",2020-04-27,"[['Noman', 'Fuad', ''], ['Ting', 'Chee-Ming', ''], ['Salleh', 'Sh-Hussain', ''], ['Ombao', 'Hernando', '']]","['Heart sound classification', 'convolutional neural network', 'ensemble classifiers']"
2997,1608.07960,Lutz Bornmann Dr.,"Werner Marx, Robin Haunschild, Andreas Thor, Lutz Bornmann","Which early works are cited most frequently in climate change research
  literature? A bibliometric approach based on Reference Publication Year
  Spectroscopy",in press at Scientometrics,,10.1007/s11192-016-2115-y,,cs.DL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This bibliometric analysis focuses on the general history of climate change
research and, more specifically, on the discovery of the greenhouse effect.
First, the Reference Publication Year Spectroscopy (RPYS) is applied to a large
publication set on climate change of 222,060 papers published between 1980 and
2014. The references cited therein were extracted and analyzed with regard to
publications, which are cited most frequently. Second, a new method for
establishing a more subject-specific publication set for applying RPYS (based
on the co-citations of a marker reference) is proposed (RPYS-CO). The RPYS of
the climate change literature focuses on the history of climate change research
in total. We identified 35 highly-cited publications across all disciplines,
which include fundamental early scientific works of the 19th century (with a
weak connection to climate change) and some cornerstones of science with a
stronger connection to climate change. By using the Arrhenius (1896) paper as a
RPYS-CO marker paper, we selected only publications specifically discussing the
discovery of the greenhouse effect and the role of carbon dioxide. Also, we
focused on the time period 1800-1850 to reveal the contributions of J.B.J
Fourier in terms of cited references. Using different RPYS approaches in this
study, we were able to identify the complete range of works of the celebrated
icons as well as many less known works relevant for the history of climate
change research. The analyses confirmed the potential of the RPYS method for
historical studies: Seminal papers are detected on the basis of the references
cited by the overall community without any further assumptions.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2016 09:14:48 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Oct 2016 06:27:48 GMT'}]",2017-12-08,"[['Marx', 'Werner', ''], ['Haunschild', 'Robin', ''], ['Thor', 'Andreas', ''], ['Bornmann', 'Lutz', '']]","['Climate change research', 'Citation analysis', 'Reference Publication Year']"
2998,1403.1939,Sandeep Sirsat,Sandeep Sirsat,Extraction of Core Contents from Web Pages,"6 Pages, 3 Figures, 11 references. arXiv admin note: text overlap
  with arXiv:1207.0246 by other authors without attribution","Sandeep Sirsat. ""Extraction of Core Contents from Web Pages"",
  International Journal of Engineering Trends and Technology(IJETT),
  V8(9),484-489 February 2014. ISSN:2231-5381. www.ijettjournal.org. published
  by seventh sense research group",10.14445/22315381/IJETT-V8P285,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The information available on web pages mostly contains semi-structured text
documents which are represented either in XML, or HTML, or XHTML format that
lacks formatted document structure. The document does not discriminate between
the text and the schema that represent the text. Also the amount of structure
used to represent the text depends on the purpose and size of text document. No
semantic is applied to semi-structured documents. This requires extracting core
contents of text document to analyse words or sentences to generate useful
knowledge. This paper discusses several techniques and approaches useful for
extracting core content from semi-structured text documents and their merits
and demerits
","[{'version': 'v1', 'created': 'Sat, 8 Mar 2014 06:49:03 GMT'}]",2014-03-11,"[['Sirsat', 'Sandeep', '']]","['Information Extraction', 'tag based', 'tree based', 'Natural Language Processing', 'Wrappers']"
2999,1402.2959,Sebastien Verel,"Gabriela Ochoa, S\'ebastien Verel (LISIC), Fabio Daolio (ISI), Marco
  Tomassini (ISI)",Local Optima Networks: A New Model of Combinatorial Fitness Landscapes,,"Recent Advances in the Theory and Application of Fitness
  Landscapes, Hendrik Richter, Andries Engelbrecht (Ed.) (2014) 233-262",10.1007/978-3-642-41888-4_9,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This chapter overviews a recently introduced network-based model of
combinatorial landscapes: Local Optima Networks (LON). The model compresses the
information given by the whole search space into a smaller mathematical object
that is a graph having as vertices the local optima and as edges the possible
weighted transitions between them. Two definitions of edges have been proposed:
basin-transition and escape-edges, which capture relevant topological features
of the underlying search spaces. This network model brings a new set of metrics
to characterize the structure of combinatorial landscapes, those associated
with the science of complex networks. These metrics are described, and results
are presented of local optima network extraction and analysis for two selected
combinatorial landscapes: NK landscapes and the quadratic assignment problem.
Network features are found to correlate with and even predict the performance
of heuristic search algorithms operating on these problems.
","[{'version': 'v1', 'created': 'Wed, 12 Feb 2014 20:21:54 GMT'}]",2014-02-13,"[['Ochoa', 'Gabriela', '', 'LISIC'], ['Verel', 'Sébastien', '', 'LISIC'], ['Daolio', 'Fabio', '', 'ISI'], ['Tomassini', 'Marco', '', 'ISI']]","['fitness landscapes', 'complex networks', 'combinatorial optimization', 'local optima', 'basin of attraction', 'NK landscapes', 'Quadratic Assignment Problem']"
3000,1403.7292,Arti Gupta Shambhuprasad,"Arti Gupta, Prof. N.T Deotale",A Mining Method to Create Knowledge Map by Analysing the Data Resource,"6 pages,5 figures, Published with International Journal of
  Engineering Trends and Technology (IJETT)""","International Journal of Engineering Trends and
  Technology(IJETT),V9(9),430-435 March 2014",10.14445/22315381/IJETT-V9P282,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The fundamental step in measuring the robustness of a system is the synthesis
of the so called Process Map.This is generally based on the user raw data
material.Process Maps are of fundamental importance towards the understanding
of the nature of a system in that they indicate which variables are causally
related and which are particularly important.This paper represent the system
Map or business structure map to understand business criteria studying the
various aspects of the company.The business structure map or knowledge map or
Process map are used to increase the growth of the company by giving some
useful measures according to the business criteria.This paper also deals with
the different company strategy to reduce the risk factors.Process Map is
helpful for building such knowledge successfully.Making decisions from such map
in a highly complex situation requires more knowledge and resources.
","[{'version': 'v1', 'created': 'Fri, 28 Mar 2014 07:35:56 GMT'}]",2014-03-31,"[['Gupta', 'Arti', ''], ['Deotale', 'Prof. N. T', '']]","['business structure', 'knowledge map', 'robustness resources', 'system map']"
3001,1611.00558,Jo\~ao Vinagre,"Jo\~ao Vinagre, Al\'ipio M\'ario Jorge, Jo\~ao Gama",Improving incremental recommenders with online bagging,Submitted to EPIA 2017,"In: Oliveira E., Gama J., Vale Z., Lopes Cardoso H. (eds) Progress
  in Artificial Intelligence. EPIA 2017. Lecture Notes in Computer Science, vol
  10423. Springer, Cham",10.1007/978-3-319-65340-2_49,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online recommender systems often deal with continuous, potentially fast and
unbounded flows of data. Ensemble methods for recommender systems have been
used in the past in batch algorithms, however they have never been studied with
incremental algorithms that learn from data streams. We evaluate online bagging
with an incremental matrix factorization algorithm for top-N recommendation
with positive-only -- binary -- ratings. Our results show that online bagging
is able to improve accuracy up to 35% over the baseline, with small
computational overhead.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2016 11:52:49 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Mar 2018 18:22:37 GMT'}]",2018-03-28,"[['Vinagre', 'João', ''], ['Jorge', 'Alípio Mário', ''], ['Gama', 'João', '']]","['Recommender systems', 'bagging', 'matrix factorization', 'data streams']"
3002,1406.3671,Jelena Marasevic,"Jelena Marasevic, Cliff Stein, Gil Zussman","Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks:
  Algorithmic Analysis",Full version of the paper published at ACM MobiHoc'14,,10.1007/s00453-016-0171-6,,cs.NI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers max-min fair rate allocation and routing in energy
harvesting networks where fairness is required among both the nodes and the
time slots. Unlike most previous work on fairness, we focus on multihop
topologies and consider different routing methods. We assume a predictable
energy profile and focus on the design of efficient and optimal algorithms that
can serve as benchmarks for distributed and approximate algorithms. We first
develop an algorithm that obtains a max-min fair rate assignment for any given
(time-variable or time-invariable) unsplittable routing or a routing tree. For
time-invariable unsplittable routing, we also develop an algorithm that finds
routes that maximize the minimum rate assigned to any node in any slot. For
fractional routing, we study the joint routing and rate assignment problem. We
develop an algorithm for the time-invariable case with constant rates. We show
that the time-variable case is at least as hard as the 2-commodity feasible
flow problem and design an FPTAS to combat the high running time. Finally, we
show that finding an unsplittable routing or a routing tree that provides
lexicographically maximum rate assignment (i.e., that is the best in the
max-min fairness terms) is NP-hard, even for a time horizon of a single slot.
Our analysis provides insights into the problem structure and can be applied to
other related fairness problems.
","[{'version': 'v1', 'created': 'Sat, 14 Jun 2014 00:42:23 GMT'}, {'version': 'v2', 'created': 'Sun, 9 Nov 2014 19:57:28 GMT'}]",2016-06-10,"[['Marasevic', 'Jelena', ''], ['Stein', 'Cliff', ''], ['Zussman', 'Gil', '']]","['Energy Harvesting', 'Energy Adaptive Networking', 'Sensor networks', 'Routing', 'Fairness']"
3003,1706.01967,Keet Sugathadasa Mr,"Keet Sugathadasa, Buddhi Ayesha, Nisansa de Silva, Amal Shehan Perera,
  Vindula Jayawardana, Dimuthu Lakmal, Madhavi Perera","Synergistic Union of Word2Vec and Lexicon for Domain Specific Semantic
  Similarity","6 Pages, 3 figures",,10.1109/ICIINFS.2017.8300343,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semantic similarity measures are an important part in Natural Language
Processing tasks. However Semantic similarity measures built for general use do
not perform well within specific domains. Therefore in this study we introduce
a domain specific semantic similarity measure that was created by the
synergistic union of word2vec, a word embedding method that is used for
semantic similarity calculation and lexicon based (lexical) semantic similarity
methods. We prove that this proposed methodology out performs word embedding
methods trained on generic corpus and methods trained on domain specific corpus
but do not use lexical semantic similarity methods to augment the results.
Further, we prove that text lemmatization can improve the performance of word
embedding methods.
","[{'version': 'v1', 'created': 'Tue, 6 Jun 2017 20:45:30 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Jun 2017 01:54:32 GMT'}]",2019-06-07,"[['Sugathadasa', 'Keet', ''], ['Ayesha', 'Buddhi', ''], ['de Silva', 'Nisansa', ''], ['Perera', 'Amal Shehan', ''], ['Jayawardana', 'Vindula', ''], ['Lakmal', 'Dimuthu', ''], ['Perera', 'Madhavi', '']]","['Word Embedding', 'Semantic Similarity', 'Neural Networks', 'Lexicon', 'word2vec']"
3004,1303.0023,Lamiaa Ibrahim Fattouh,Lamiaa Fattouh Ibrahim and Manal El Harby,Enhancing Clustering Algorithm to Plan Efficient Mobile Network,"7 Pages, 14 Figures. arXiv admin note: substantial text overlap with
  arXiv:1302.6602","Lamiaa Fattouh Ibrahim and Manal El Harby. Article: Enhancing
  Clustering Algorithm to Plan Efficient Mobile Network. International Journal
  of Computer Applications 59(18):18-24, December 2012",10.5120/9648-4401,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rapid development in mobile network effective network planning tool
is needed to satisfy the need of customers. However, deciding upon the optimum
placement for the base stations (BS) to achieve best services while reducing
the cost is a complex task requiring vast computational resource. This paper
addresses antenna placement problem or the cell planning problem, involves
locating and configuring infrastructure for mobile networks. The Cluster
Partitioning Around Medoids (PAM) original algorithm has been modified and a
new algorithm M-PAM (Modified-Partitioning Around Medoids) has been proposed by
the authors in a recent work. In the present paper, the M-PAM algorithm is
modified and a new algorithm CWN-PAM (Clustering with Weighted
Node-Partitioning Around Medoids) has been proposed to satisfy the requirements
and constraints. Implementation of this algorithm to a real case study is
presented. Results demonstrate the effectiveness and flexibility of the
modifying algorithm in tackling the important problem of mobile network
planning.
","[{'version': 'v1', 'created': 'Thu, 28 Feb 2013 21:36:25 GMT'}]",2015-07-19,"[['Ibrahim', 'Lamiaa Fattouh', ''], ['Harby', 'Manal El', '']]","['Clustering techniques', 'network planning', 'cell planning', 'mobile network']"
3005,0912.4935,Minghui Jiang,Minghui Jiang,Inapproximability of maximal strip recovery,"A preliminary version of this paper appeared in two parts in the
  Proceedings of the 20th International Symposium on Algorithms and Computation
  (ISAAC 2009) and the Proceedings of the 4th International Frontiers of
  Algorithmics Workshop (FAW 2010)",,10.1007/978-3-642-14553-7_8,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In comparative genomic, the first step of sequence analysis is usually to
decompose two or more genomes into syntenic blocks that are segments of
homologous chromosomes. For the reliable recovery of syntenic blocks, noise and
ambiguities in the genomic maps need to be removed first. Maximal Strip
Recovery (MSR) is an optimization problem proposed by Zheng, Zhu, and Sankoff
for reliably recovering syntenic blocks from genomic maps in the midst of noise
and ambiguities. Given $d$ genomic maps as sequences of gene markers, the
objective of \msr{d} is to find $d$ subsequences, one subsequence of each
genomic map, such that the total length of syntenic blocks in these
subsequences is maximized. For any constant $d \ge 2$, a polynomial-time
2d-approximation for \msr{d} was previously known. In this paper, we show that
for any $d \ge 2$, \msr{d} is APX-hard, even for the most basic version of the
problem in which all gene markers are distinct and appear in positive
orientation in each genomic map. Moreover, we provide the first explicit lower
bounds on approximating \msr{d} for all $d \ge 2$. In particular, we show that
\msr{d} is NP-hard to approximate within $\Omega(d/\log d)$. From the other
direction, we show that the previous 2d-approximation for \msr{d} can be
optimized into a polynomial-time algorithm even if $d$ is not a constant but is
part of the input. We then extend our inapproximability results to several
related problems including \cmsr{d}, \gapmsr{\delta}{d}, and
\gapcmsr{\delta}{d}.
","[{'version': 'v1', 'created': 'Fri, 25 Dec 2009 03:25:15 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Jan 2010 16:18:33 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Jan 2010 17:23:39 GMT'}, {'version': 'v4', 'created': 'Fri, 4 Jun 2010 17:16:01 GMT'}]",2015-05-14,"[['Jiang', 'Minghui', '']]","['computational complexity', 'bioinformatics', 'sequence analysis', 'genome rearrangement']"
3006,1811.10220,Vladimir Mironov,"Vladimir Mironov, Andrey Kudryavtsev, Yuri Alexeev, Alexander
  Moskovsky, Igor Kulikov, Igor Chernykh","Evaluation of Intel Memory Drive Technology Performance for Scientific
  Applications",,"In Proceedings of the Workshop on Memory Centric High Performance
  Computing (MCHPC'18). ACM, New York, NY, USA, 14-21, 2018",10.1145/3286475.3286479,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present benchmark data for Intel Memory Drive Technology
(IMDT), which is a new generation of Software-defined Memory (SDM) based on
Intel ScaleMP collaboration and using 3D XPointTM based Intel Solid-State
Drives (SSDs) called Optane. We studied IMDT performance for synthetic
benchmarks, scientific kernels, and applications. We chose these benchmarks to
represent different patterns for computation and accessing data on disks and
memory. To put performance of IMDT in comparison, we used two memory
configurations: hybrid IMDT DDR4/Optane and DDR4 only systems. The performance
was measured as a percentage of used memory and analyzed in detail. We found
that for some applications DDR4/Optane hybrid configuration outperforms DDR4
setup by up to 20%.
","[{'version': 'v1', 'created': 'Mon, 26 Nov 2018 07:49:13 GMT'}]",2018-11-27,"[['Mironov', 'Vladimir', ''], ['Kudryavtsev', 'Andrey', ''], ['Alexeev', 'Yuri', ''], ['Moskovsky', 'Alexander', ''], ['Kulikov', 'Igor', ''], ['Chernykh', 'Igor', '']]","['Intel Memory Drive Technology', 'Solid State Drives', 'Intel Optane', 'ScaleMP']"
3007,1607.05258,Mohammad Havaei,"Mohammad Havaei and Nicolas Guizard and Hugo Larochelle and
  Pierre-Marc Jodoin",Deep learning trends for focal brain pathology segmentation in MRI,Published in Machine Learning for Health Informatics,,10.1007/978-3-319-50478-0_6,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Segmentation of focal (localized) brain pathologies such as brain tumors and
brain lesions caused by multiple sclerosis and ischemic strokes are necessary
for medical diagnosis, surgical planning and disease development as well as
other applications such as tractography. Over the years, attempts have been
made to automate this process for both clinical and research reasons. In this
regard, machine learning methods have long been a focus of attention. Over the
past two years, the medical imaging field has seen a rise in the use of a
particular branch of machine learning commonly known as deep learning. In the
non-medical computer vision world, deep learning based methods have obtained
state-of-the-art results on many datasets. Recent studies in computer aided
diagnostics have shown deep learning methods (and especially convolutional
neural networks - CNN) to yield promising results. In this chapter, we provide
a survey of CNN methods applied to medical imaging with a focus on brain
pathology segmentation. In particular, we discuss their characteristic
peculiarities and their specific configuration and adjustments that are best
suited to segment medical images. We also underline the intrinsic differences
deep learning methods have with other machine learning methods.
","[{'version': 'v1', 'created': 'Mon, 18 Jul 2016 19:52:00 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Jan 2017 16:41:46 GMT'}, {'version': 'v3', 'created': 'Tue, 24 Jan 2017 02:44:48 GMT'}]",2017-01-25,"[['Havaei', 'Mohammad', ''], ['Guizard', 'Nicolas', ''], ['Larochelle', 'Hugo', ''], ['Jodoin', 'Pierre-Marc', '']]","['Brain tumor segmentation', 'Brain lesion segmentation', 'Deep learning', 'Convolutional neural network']"
3008,1405.3057,Pinar Sen,Pinar Sen and Ali Ozgur Yilmaz,"A Low-Complexity Graph-Based LMMSE Receiver for MIMO ISI Channels with
  M-QAM Modulation","28 pages, 6 figures, 2 tables, submitted to IEEE Transactions on
  Wireless Communications","IEEE Transactions on Wireless Communications , vol.PP, no.99,
  pp.1-1, Dec. 2016",10.1109/TWC.2016.2640962,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a low complexity graph-based linear minimum mean
square error (LMMSE) equalizer in order to remove inter-symbol and inter-stream
interference in multiple input multiple output (MIMO) communication. The
proposed state space representation inflicted on the graph provides linearly
increasing computational complexity with block length. Also, owing to the
Gaussian assumption used in the presented cycle-free factor graph, the
complexity of the suggested equalizer structure is not affected by the size of
the signalling space. In addition, we introduce an efficient way of computing
extrinsic bit log-likelihood ratio (LLR) values for LMMSE estimation compatible
with higher order alphabets which is shown to perform better than the other
methods in the literature. Overall, we provide an efficient receiver structure
reaching high data rates in frequency selective MIMO systems whose performance
is shown to be very close to a genie-aided matched filter bound through
extensive simulations.
","[{'version': 'v1', 'created': 'Tue, 13 May 2014 07:55:25 GMT'}, {'version': 'v2', 'created': 'Fri, 1 May 2015 06:59:39 GMT'}, {'version': 'v3', 'created': 'Mon, 2 Jan 2017 19:10:50 GMT'}]",2017-01-04,"[['Sen', 'Pinar', ''], ['Yilmaz', 'Ali Ozgur', '']]","['Gaussian assumption', 'Gaussian message passing', 'factor graph', 'turbo decoding', 'MIMO ISI channel', 'linear LMMSEequalization', 'extrinsic LLR computation']"
3009,1902.06792,Sobhan Moosavi,"Sobhan Moosavi, Mohammad Hossein Samavatian, Arnab Nandi, Srinivasan
  Parthasarathy and Rajiv Ramnath","Short and Long-term Pattern Discovery Over Large-Scale
  Geo-Spatiotemporal Data","In Proceedings of the 25th ACM SIGKDD International Conference on
  Knowledge Discovery and Data Mining",,10.1145/3292500.3330755,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pattern discovery in geo-spatiotemporal data (such as traffic and weather
data) is about finding patterns of collocation, co-occurrence, cascading, or
cause and effect between geospatial entities. Using simplistic definitions of
spatiotemporal neighborhood (a common characteristic of the existing
general-purpose frameworks) is not semantically representative of
geo-spatiotemporal data. We therefore introduce a new geo-spatiotemporal
pattern discovery framework which defines a semantically correct definition of
neighborhood; and then provides two capabilities, one to explore propagation
patterns and the other to explore influential patterns. Propagation patterns
reveal common cascading forms of geospatial entities in a region. Influential
patterns demonstrate the impact of temporally long-term geospatial entities on
their neighborhood. We apply this framework on a large dataset of traffic and
weather data at countrywide scale, collected for the contiguous United States
over two years. Our important findings include the identification of 90 common
propagation patterns of traffic and weather entities (e.g., rain --> accident
--> congestion), which results in identification of four categories of states
within the US; and interesting influential patterns with respect to the
""location"", ""duration"", and ""type"" of long-term entities (e.g., a major
construction --> more traffic incidents). These patterns and the categorization
of the states provide useful insights on the driving habits and infrastructure
characteristics of different regions in the US, and could be of significant
value for applications such as urban planning and personalized insurance.
","[{'version': 'v1', 'created': 'Thu, 14 Feb 2019 03:07:21 GMT'}, {'version': 'v2', 'created': 'Fri, 17 May 2019 21:34:14 GMT'}]",2019-05-21,"[['Moosavi', 'Sobhan', ''], ['Samavatian', 'Mohammad Hossein', ''], ['Nandi', 'Arnab', ''], ['Parthasarathy', 'Srinivasan', ''], ['Ramnath', 'Rajiv', '']]","['Propagation Patterns', 'Influential Patterns', 'Geo-Spatiotemporal Data']"
3010,1901.05456,Roberto Metere,"Andreas Lindner, Roberto Guanciale, Roberto Metere",TrABin: Trustworthy Analyses of Binaries,"32 pages, 5 figures, journal. arXiv admin note: substantial text
  overlap with arXiv:1807.10664",,10.1016/j.scico.2019.01.001,,cs.PL cs.CR cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Verification of microkernels, device drivers, and crypto routines requires
analyses at the binary level. In order to automate these analyses, in the last
years several binary analysis platforms have been introduced. These platforms
share a common design: the adoption of hardware-independent intermediate
representations, a mechanism to translate architecture dependent code to this
representation, and a set of architecture independent analyses that process the
intermediate representation. The usage of these platforms to verify software
introduces the need for trusting both the correctness of the translation from
binary code to intermediate language (called transpilation) and the correctness
of the analyses. Achieving a high degree of trust is challenging since the
transpilation must handle (i) all the side effects of the instructions, (ii)
multiple instruction encodings (e.g. ARM Thumb), and (iii) variable instruction
length (e.g. Intel). Similarly, analyses can use complex transformations (e.g.
loop unrolling) and simplifications (e.g. partial evaluation) of the artifacts,
whose bugs can jeopardize correctness of the results. We overcome these
problems by developing a binary analysis platform on top of the interactive
theorem prover HOL4. First, we formally model a binary intermediate language
and we prove correctness of several supporting tools (i.e. a type checker).
Then, we implement two proof-producing transpilers, which respectively
translate ARMv8 and CortexM0 programs to the intermediate language and generate
a certificate. This certificate is a HOL4 proof demonstrating correctness of
the translation. As demonstrating analysis, we implement a proof-producing
weakest precondition generator, which can be used to verify that a given
loop-free program fragment satisfies a contract. Finally, we use an AES
encryption implementation to benchmark our platform.
","[{'version': 'v1', 'created': 'Wed, 16 Jan 2019 18:14:10 GMT'}]",2019-01-23,"[['Lindner', 'Andreas', ''], ['Guanciale', 'Roberto', ''], ['Metere', 'Roberto', '']]","['binary analysis', 'formal verification', 'proof producing analysis', 'theorem proving']"
3011,2003.12796,Anti Ingel,"Anti Ingel, Novin Shahroudi, Markus K\""angsepp, Andre T\""attar,
  Viacheslav Komisarenko, Meelis Kull",Correlated daily time series and forecasting in the M4 competition,,"International Journal of Forecasting, 36(1), 121-128 (2020)",10.1016/j.ijforecast.2019.02.018,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We participated in the M4 competition for time series forecasting and
describe here our methods for forecasting daily time series. We used an
ensemble of five statistical forecasting methods and a method that we refer to
as the correlator. Our retrospective analysis using the ground truth values
published by the M4 organisers after the competition demonstrates that the
correlator was responsible for most of our gains over the naive constant
forecasting method. We identify data leakage as one reason for its success,
partly due to test data selected from different time intervals, and partly due
to quality issues in the original time series. We suggest that future
forecasting competitions should provide actual dates for the time series so
that some of those leakages could be avoided by the participants.
","[{'version': 'v1', 'created': 'Sat, 28 Mar 2020 14:17:05 GMT'}, {'version': 'v2', 'created': 'Tue, 31 Mar 2020 12:00:48 GMT'}]",2020-04-01,"[['Ingel', 'Anti', ''], ['Shahroudi', 'Novin', ''], ['Kängsepp', 'Markus', ''], ['Tättar', 'Andre', ''], ['Komisarenko', 'Viacheslav', ''], ['Kull', 'Meelis', '']]","['Forecasting competitions', 'time series', 'correlation', 'data leakage', 'ensembling']"
3012,1802.10514,"Marc Schr\""oder","Tobias Harks, Marc Schroder, Dries Vermeulen",Toll Caps in Privatized Road Networks,"25 pages, 8 figures","European Journal of Operational Research, 2019",10.1016/j.ejor.2019.01.059,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a network pricing game on a parallel network with congestion
effects in which link owners set tolls for travel so as to maximize profit. A
central authority is able to regulate this competition by means of a (uniform)
price cap. The first question we want to answer is how such a cap should be
designed in order to minimize the total congestion. We provide an algorithm
that finds an optimal price cap for networks with affine latency functions and
a full support Wardrop equilibrium. Second, we consider the induced network
performance at an optimal price cap. We show that for two link networks with
affine latency functions, the congestion costs at the optimal price cap are at
most $8/7$ times the optimal congestion costs. For more general latency
functions, this bound goes up to 2 under the assumption that an uncapped Nash
equilibrium exists. However, in general such an equilibrium need not exist and
this can be used to show that optimal price caps can induce arbitrarily
inefficient flows.
","[{'version': 'v1', 'created': 'Wed, 28 Feb 2018 16:26:06 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Mar 2018 15:55:57 GMT'}, {'version': 'v3', 'created': 'Fri, 19 Oct 2018 08:12:28 GMT'}, {'version': 'v4', 'created': 'Mon, 22 Oct 2018 17:13:12 GMT'}, {'version': 'v5', 'created': 'Tue, 12 Feb 2019 20:29:02 GMT'}]",2019-02-14,"[['Harks', 'Tobias', ''], ['Schroder', 'Marc', ''], ['Vermeulen', 'Dries', '']]","['Game theory', 'competition regulation', 'toll caps', 'Nash equilibrium', 'Wardrop equilibrium']"
3013,1501.02482,Jose Teixeira,"Jose Teixeira, Abayomi Baiyere",Crafting a Systematic Literature Review on Open-Source Platforms,"As presented in 10th IFIP WG 2.13 International Conference on Open
  Source Systems, OSS 2014, San Jos\'e, Costa Rica, May 6-9, 2014","IFIP Advances in Information and Communication Technology vol 427
  2014",10.1007/978-3-642-55128-4_16,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This working paper unveils the crafting of a systematic literature review on
open-source platforms. The high-competitive mobile devices market, where
several players such as Apple, Google, Nokia and Microsoft run a platforms- war
with constant shifts in their technological strategies, is gaining increasing
attention from scholars. It matters, then, to review previous literature on
past platforms-wars, such as the ones from the PC and game-console industries,
and assess its implications to the current mobile devices platforms-war. The
paper starts by justifying the purpose and rationale behind this literature
review on open-source platforms. The concepts of open-source software and
computer-based platforms were then discussed both individually and in unison,
in order to clarify the core-concept of 'open-source platform' that guides this
literature review. The detailed design of the employed methodological strategy
is then presented as the central part of this paper. The paper concludes with
preliminary findings organizing previous literature on open-source platforms
for the purpose of guiding future research in this area.
","[{'version': 'v1', 'created': 'Sun, 11 Jan 2015 18:52:12 GMT'}]",2015-01-13,"[['Teixeira', 'Jose', ''], ['Baiyere', 'Abayomi', '']]","['Open-source', 'FLOSS', 'Platforms', 'Ecosystems', 'R&D Management']"
3014,1609.08201,Shahriar Shariat,Shahriar Shariat and Vladimir Pavlovic,"Robust Time-Series Retrieval Using Probabilistic Adaptive Segmental
  Alignment",,Knowl Inf Syst (2016) 49: 91. doi:10.1007/s10115-015-0898-4,10.1007/s10115-015-0898-4,,cs.DB cs.IR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional pairwise sequence alignment is based on matching individual
samples from two sequences, under time monotonicity constraints. However, in
many application settings matching subsequences (segments) instead of
individual samples may bring in additional robustness to noise or local
non-causal perturbations. This paper presents an approach to segmental sequence
alignment that jointly segments and aligns two sequences, generalizing the
traditional per-sample alignment. To accomplish this task, we introduce a
distance metric between segments based on average pairwise distances and then
present a modified pair-HMM (PHMM) that incorporates the proposed distance
metric to solve the joint segmentation and alignment task. We also propose a
relaxation to our model that improves the computational efficiency of the
generic segmental PHMM. Our results demonstrate that this new measure of
sequence similarity can lead to improved classification performance, while
being resilient to noise, on a variety of sequence retrieval problems, from EEG
to motion sequence classification.
","[{'version': 'v1', 'created': 'Mon, 26 Sep 2016 21:53:42 GMT'}]",2016-09-28,"[['Shariat', 'Shahriar', ''], ['Pavlovic', 'Vladimir', '']]","['Time-Series', 'Alignment', 'Segmentation', 'Distance metric', 'Classification']"
3015,0712.1014,Vahan Mkrtchyan,A. V. Tserunyan,"Characterization Of A Class Of Graphs Related To Pairs Of Disjoint
  Matchings","33 pages, 10 figures",Discrete Mathematics 309 (2009) 693--713,10.1016/j.disc.2008.01.004,,cs.DM,,"  For a given graph consider a pair of disjoint matchings the union of which
contains as many edges as possible. Furthermore, consider the relation of the
cardinalities of a maximum matching and the largest matching in those pairs. It
is known that this relation does not exceed 5/4 for any graph. We characterize
the class of graphs for which this relation is precisely 5/4. Our
characterization implies that these graphs contain a spanning subgraph, every
component of which is the minimal graph of this class.
","[{'version': 'v1', 'created': 'Thu, 6 Dec 2007 18:30:50 GMT'}]",2009-03-03,"[['Tserunyan', 'A. V.', '']]","['matching', 'pair of disjoint matchings', 'maximum matching']"
3016,1806.10805,Pau Rodr\'iguez L\'opez,"Pau Rodr\'iguez, Miguel A. Bautista, Jordi Gonz\`alez, Sergio Escalera",Beyond One-hot Encoding: lower dimensional target embedding,Published at Image and Vision Computing,,10.1016/j.imavis.2018.04.004,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Target encoding plays a central role when learning Convolutional Neural
Networks. In this realm, One-hot encoding is the most prevalent strategy due to
its simplicity. However, this so widespread encoding schema assumes a flat
label space, thus ignoring rich relationships existing among labels that can be
exploited during training. In large-scale datasets, data does not span the full
label space, but instead lies in a low-dimensional output manifold. Following
this observation, we embed the targets into a low-dimensional space,
drastically improving convergence speed while preserving accuracy. Our
contribution is two fold: (i) We show that random projections of the label
space are a valid tool to find such lower dimensional embeddings, boosting
dramatically convergence rates at zero computational cost; and (ii) we propose
a normalized eigenrepresentation of the class manifold that encodes the targets
with minimal information loss, improving the accuracy of random projections
encoding while enjoying the same convergence rates. Experiments on CIFAR-100,
CUB200-2011, Imagenet, and MIT Places demonstrate that the proposed approach
drastically improves convergence speed while reaching very competitive accuracy
rates.
","[{'version': 'v1', 'created': 'Thu, 28 Jun 2018 07:34:14 GMT'}]",2018-06-29,"[['Rodríguez', 'Pau', ''], ['Bautista', 'Miguel A.', ''], ['Gonzàlez', 'Jordi', ''], ['Escalera', 'Sergio', '']]","['Error correcting output codes', 'output embeddings', 'deep learning', 'computer vision']"
3017,2102.07057,Xiang Wang,"Xiang Wang, Tinglin Huang, Dingxian Wang, Yancheng Yuan, Zhenguang
  Liu, Xiangnan He, Tat-Seng Chua","Learning Intents behind Interactions with Knowledge Graph for
  Recommendation",WWW 2021 oral presentation,,10.1145/3442381.3450133,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge graph (KG) plays an increasingly important role in recommender
systems. A recent technical trend is to develop end-to-end models founded on
graph neural networks (GNNs). However, existing GNN-based models are
coarse-grained in relational modeling, failing to (1) identify user-item
relation at a fine-grained level of intents, and (2) exploit relation
dependencies to preserve the semantics of long-range connectivity.
  In this study, we explore intents behind a user-item interaction by using
auxiliary item knowledge, and propose a new model, Knowledge Graph-based Intent
Network (KGIN). Technically, we model each intent as an attentive combination
of KG relations, encouraging the independence of different intents for better
model capability and interpretability. Furthermore, we devise a new information
aggregation scheme for GNN, which recursively integrates the relation sequences
of long-range connectivity (i.e., relational paths). This scheme allows us to
distill useful information about user intents and encode them into the
representations of users and items. Experimental results on three benchmark
datasets show that, KGIN achieves significant improvements over the
state-of-the-art methods like KGAT, KGNN-LS, and CKAN. Further analyses show
that KGIN offers interpretable explanations for predictions by identifying
influential intents and relational paths. The implementations are available at
https://github.com/huangtinglin/Knowledge_Graph_based_Intent_Network.
","[{'version': 'v1', 'created': 'Sun, 14 Feb 2021 03:21:36 GMT'}]",2021-02-16,"[['Wang', 'Xiang', ''], ['Huang', 'Tinglin', ''], ['Wang', 'Dingxian', ''], ['Yuan', 'Yancheng', ''], ['Liu', 'Zhenguang', ''], ['He', 'Xiangnan', ''], ['Chua', 'Tat-Seng', '']]","['Recommendation', 'Knowledge Graph', 'Graph Neural Networks']"
3018,1907.12344,Paul Ogris,"Thomas Eiter, Paul Ogris, Konstantin Schekotihin",A Distributed Approach to LARS Stream Reasoning (System paper),16 pages. Under consideration for acceptance in TPLP,Theory and Practice of Logic Programming 19 (2019) 974-989,10.1017/S1471068419000309,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stream reasoning systems are designed for complex decision-making from
possibly infinite, dynamic streams of data. Modern approaches to stream
reasoning are usually performing their computations using stand-alone solvers,
which incrementally update their internal state and return results as the new
portions of data streams are pushed. However, the performance of such
approaches degrades quickly as the rates of the input data and the complexity
of decision problems are growing. This problem was already recognized in the
area of stream processing, where systems became distributed in order to
allocate vast computing resources provided by clouds. In this paper we propose
a distributed approach to stream reasoning that can efficiently split
computations among different solvers communicating their results over data
streams. Moreover, in order to increase the throughput of the distributed
system, we suggest an interval-based semantics for the LARS language, which
enables significant reductions of network traffic. Performed evaluations
indicate that the distributed stream reasoning significantly outperforms
existing stand-alone LARS solvers when the complexity of decision problems and
the rate of incoming data are increasing. Under consideration for acceptance in
Theory and Practice of Logic Programming.
","[{'version': 'v1', 'created': 'Mon, 29 Jul 2019 11:39:05 GMT'}]",2020-02-19,"[['Eiter', 'Thomas', ''], ['Ogris', 'Paul', ''], ['Schekotihin', 'Konstantin', '']]","['Stream reasoning', 'distributed systems', 'Answer Set Programming']"
3019,0909.1051,Gleb Oshanin,"G. Kabatiansky (1,2), G.Oshanin (2,3) ((1) Dobrushin Mathematical
  Laboratory, Institute of Information Transmission Problems, Moscow, Russia,
  (2) Laboratory J.-V. Poncelet, Independent University of Moscow, Russia, (3)
  LPTMC, University Pierre & Marie Curie, Paris, France)",Finding passwords by random walks: How long does it take?,"To appear in J. Phys. A, special issue on ""Random Search Problem:
  Trends and Perspectives"", eds.: MEG da Luz, E Raposo, GM Viswanathan and A
  Grosberg","J. Phys. A 42 No 43, 434016 (2009)",10.1088/1751-8113/42/43/434016,,cs.CR cond-mat.other cs.DS math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We compare an efficiency of a deterministic ""lawnmower"" and random search
strategies for finding a prescribed sequence of letters (a password) of length
M in which all letters are taken from the same Q-ary alphabet. We show that at
best a random search takes two times longer than a ""lawnmower"" search.
","[{'version': 'v1', 'created': 'Sat, 5 Sep 2009 19:25:35 GMT'}]",2015-05-14,"[['Kabatiansky', 'G.', ''], ['Oshanin', 'G.', '']]","['random search', 'random walks', 'first passage times']"
3020,1310.2994,Haipeng Cai,"Haipeng Cai, Jian Chen and Alexander P. Auchus",Depth-dependent Parallel Visualization with 3D Stylized Dense Tubes,"10 pages, 9 figures, 1 table","International Journal of Image and Graphics. Vol. 16, No. 01,
  1650002 (2016)",10.1142/S0219467816500029,,cs.DC cs.GR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a parallel visualization algorithm for the illustrative rendering
of depth-dependent stylized dense tube data at interactive frame rates. While
this computation could be efficiently performed on a GPU device, we target a
parallel framework to enable it to be efficiently running on an ordinary
multi-core CPU platform which is much more available than GPUs for common
users. Our approach is to map the depth information in each tube onto each of
the visual dimensions of shape, color, texture, value, and size on the basis of
Bertin's semiology theory. The purpose is to enable more legible displays in
the dense tube environments. A major contribution of our work is an efficient
and effective parallel depthordering algorithm that makes use of the message
passing interface (MPI) with VTK. We evaluated our framework with
visualizations of depth-stylized tubes derived from 3D diffusion tensor MRI
data by comparing its efficiency with several other alternative parallelization
platforms running the same computations. As our results show, the
parallelization framework we proposed can efficiently render highly dense 3D
data sets like the tube data and thus is useful as a complement to parallel
visualization environments that rely on GPUs.
","[{'version': 'v1', 'created': 'Fri, 11 Oct 2013 00:38:49 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Oct 2013 01:31:31 GMT'}]",2021-11-02,"[['Cai', 'Haipeng', ''], ['Chen', 'Jian', ''], ['Auchus', 'Alexander P.', '']]","['Parallel visualization', 'stylized rendering', 'MPI', 'densedata', 'MRI']"
3021,1701.00185,Jiaming Xu,"Jiaming Xu, Bo Xu, Peng Wang, Suncong Zheng, Guanhua Tian, Jun Zhao,
  Bo Xu",Self-Taught Convolutional Neural Networks for Short Text Clustering,"33 pages, accepted for publication in Neural Networks",,10.1016/j.neunet.2016.12.008,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Short text clustering is a challenging problem due to its sparseness of text
representation. Here we propose a flexible Self-Taught Convolutional neural
network framework for Short Text Clustering (dubbed STC^2), which can flexibly
and successfully incorporate more useful semantic features and learn non-biased
deep text representation in an unsupervised manner. In our framework, the
original raw text features are firstly embedded into compact binary codes by
using one existing unsupervised dimensionality reduction methods. Then, word
embeddings are explored and fed into convolutional neural networks to learn
deep feature representations, meanwhile the output units are used to fit the
pre-trained binary codes in the training process. Finally, we get the optimal
clusters by employing K-means to cluster the learned representations. Extensive
experimental results demonstrate that the proposed framework is effective,
flexible and outperform several popular clustering methods when tested on three
public short text datasets.
","[{'version': 'v1', 'created': 'Sun, 1 Jan 2017 01:57:59 GMT'}]",2017-01-03,"[['Xu', 'Jiaming', ''], ['Xu', 'Bo', ''], ['Wang', 'Peng', ''], ['Zheng', 'Suncong', ''], ['Tian', 'Guanhua', ''], ['Zhao', 'Jun', ''], ['Xu', 'Bo', '']]","['Semantic Clustering', 'Neural Networks', 'Short Text', 'Unsupervised']"
3022,0708.1150,Marko Antonio Rodriguez,"Marko A. Rodriguez, Johah Bollen, Herbert Van de Sompel","A Practical Ontology for the Large-Scale Modeling of Scholarly Artifacts
  and their Usage",,"Proceedings of the IEEE/ACM Joint Conference on Digital Libraries
  (JCDL'07), pp. 278-287, 2007",10.1145/1255175.1255229,,cs.DL cs.AI,,"  The large-scale analysis of scholarly artifact usage is constrained primarily
by current practices in usage data archiving, privacy issues concerned with the
dissemination of usage data, and the lack of a practical ontology for modeling
the usage domain. As a remedy to the third constraint, this article presents a
scholarly ontology that was engineered to represent those classes for which
large-scale bibliographic and usage data exists, supports usage research, and
whose instantiation is scalable to the order of 50 million articles along with
their associated artifacts (e.g. authors and journals) and an accompanying 1
billion usage events. The real world instantiation of the presented abstract
ontology is a semantic network model of the scholarly community which lends the
scholarly process to statistical analysis and computational support. We present
the ontology, discuss its instantiation, and provide some example inference
rules for calculating various scholarly artifact metrics.
","[{'version': 'v1', 'created': 'Wed, 8 Aug 2007 17:06:55 GMT'}]",2007-08-09,"[['Rodriguez', 'Marko A.', ''], ['Bollen', 'Johah', ''], ['Van de Sompel', 'Herbert', '']]","['Resource Description Framework and Schema', 'Web Ontology Language', 'Semantic Networks']"
3023,1807.04662,Jacob Montiel,"Jacob Montiel, Jesse Read, Albert Bifet, Talel Abdessalem",Scikit-Multiflow: A Multi-output Streaming Framework,"5 pages, Open Source Software","Journal of Machine Learning Research, 2019, vol. 1, p. 2915-2914",10.5555/3291125.3309634,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scikit-multiflow is a multi-output/multi-label and stream data mining
framework for the Python programming language. Conceived to serve as a platform
to encourage democratization of stream learning research, it provides multiple
state of the art methods for stream learning, stream generators and evaluators.
scikit-multiflow builds upon popular open source frameworks including
scikit-learn, MOA and MEKA. Development follows the FOSS principles and quality
is enforced by complying with PEP8 guidelines and using continuous integration
and automatic testing. The source code is publicly available at
https://github.com/scikit-multiflow/scikit-multiflow.
","[{'version': 'v1', 'created': 'Thu, 12 Jul 2018 15:03:13 GMT'}]",2020-05-18,"[['Montiel', 'Jacob', ''], ['Read', 'Jesse', ''], ['Bifet', 'Albert', ''], ['Abdessalem', 'Talel', '']]","['Machine Learning', 'Stream Data', 'Multi-output', 'Drift Detection', 'Python']"
3024,1806.00984,Md. Shah Fahad,"Md. Shah Fahad, Jainath Yadav, Gyadhar Pradhan, Akshay Deepak","DNN-HMM based Speaker Adaptive Emotion Recognition using Proposed Epoch
  and MFCC Features",,"Circuits, Systems, and Signal Processing 2020",10.1007/s00034-020-01486-8,,cs.SD cs.AI cs.LG eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Speech is produced when time varying vocal tract system is excited with time
varying excitation source. Therefore, the information present in a speech such
as message, emotion, language, speaker is due to the combined effect of both
excitation source and vocal tract system. However, there is very less
utilization of excitation source features to recognize emotion. In our earlier
work, we have proposed a novel method to extract glottal closure instants
(GCIs) known as epochs. In this paper, we have explored epoch features namely
instantaneous pitch, phase and strength of epochs for discriminating emotions.
We have combined the excitation source features and the well known
Male-frequency cepstral coefficient (MFCC) features to develop an emotion
recognition system with improved performance. DNN-HMM speaker adaptive models
have been developed using MFCC, epoch and combined features. IEMOCAP emotional
database has been used to evaluate the models. The average accuracy for emotion
recognition system when using MFCC and epoch features separately is 59.25% and
54.52% respectively. The recognition performance improves to 64.2% when MFCC
and epoch features are combined.
","[{'version': 'v1', 'created': 'Mon, 4 Jun 2018 06:58:45 GMT'}]",2021-08-09,"[['Fahad', 'Md. Shah', ''], ['Yadav', 'Jainath', ''], ['Pradhan', 'Gyadhar', ''], ['Deepak', 'Akshay', '']]","['Emotion Recognition', 'Epoch Features', 'Deep Neural Network(DNN)', 'Gaussian Mixture Model (GMM)', 'HiddenMorkov Model(HMM)', 'Zero Time Windowing (ZTW)']"
3025,1811.00926,Sajjad Arshad,"Sajjad Arshad, Amin Kharraz, William Robertson","Include Me Out: In-Browser Detection of Malicious Third-Party Content
  Inclusions","International Conference on Financial Cryptography and Data Security
  (FC), Barbados, February 2016",,10.1007/978-3-662-54970-4_26,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern websites include various types of third-party content such as
JavaScript, images, stylesheets, and Flash objects in order to create
interactive user interfaces. In addition to explicit inclusion of third-party
content by website publishers, ISPs and browser extensions are hijacking web
browsing sessions with increasing frequency to inject third-party content
(e.g., ads). However, third-party content can also introduce security risks to
users of these websites, unbeknownst to both website operators and users.
Because of the often highly dynamic nature of these inclusions as well as the
use of advanced cloaking techniques in contemporary malware, it is exceedingly
difficult to preemptively recognize and block inclusions of malicious
third-party content before it has the chance to attack the user's system. In
this paper, we propose a novel approach to achieving the goal of preemptive
blocking of malicious third-party content inclusion through an analysis of
inclusion sequences on the Web. We implemented our approach, called Excision,
as a set of modifications to the Chromium browser that protects users from
malicious inclusions while web pages load. Our analysis suggests that by
adopting our in-browser approach, users can avoid a significant portion of
malicious third-party content on the Web. Our evaluation shows that Excision
effectively identifies malicious content while introducing a low false positive
rate. Our experiments also demonstrate that our approach does not negatively
impact a user's browsing experience when browsing popular websites drawn from
the Alexa Top 500.
","[{'version': 'v1', 'created': 'Fri, 2 Nov 2018 15:15:00 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Feb 2020 00:27:18 GMT'}]",2020-02-17,"[['Arshad', 'Sajjad', ''], ['Kharraz', 'Amin', ''], ['Robertson', 'William', '']]","['Web security', 'Malvertising', 'Machine learning']"
3026,1811.01463,Faiq Khalid,"Faiq Khalid, Muhammad Abdullah Hanif, Semeen Rehman, Muhammad Shafique","Security for Machine Learning-based Systems: Attacks and Challenges
  during Training and Inference",,"International Conference on Frontiers of Information Technology
  (FIT) 2018",10.1109/FIT.2018.00064,INSPEC Accession Number: 18398499,cs.LG cs.CR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The exponential increase in dependencies between the cyber and physical world
leads to an enormous amount of data which must be efficiently processed and
stored. Therefore, computing paradigms are evolving towards machine learning
(ML)-based systems because of their ability to efficiently and accurately
process the enormous amount of data. Although ML-based solutions address the
efficient computing requirements of big data, they introduce (new) security
vulnerabilities into the systems, which cannot be addressed by traditional
monitoring-based security measures. Therefore, this paper first presents a
brief overview of various security threats in machine learning, their
respective threat models and associated research challenges to develop robust
security measures. To illustrate the security vulnerabilities of ML during
training, inferencing and hardware implementation, we demonstrate some key
security threats on ML using LeNet and VGGNet for MNIST and German Traffic Sign
Recognition Benchmarks (GTSRB), respectively. Moreover, based on the security
analysis of ML-training, we also propose an attack that has a very less impact
on the inference accuracy. Towards the end, we highlight the associated
research challenges in developing security measures and provide a brief
overview of the techniques used to mitigate such security threats.
","[{'version': 'v1', 'created': 'Mon, 5 Nov 2018 00:30:21 GMT'}]",2019-04-09,"[['Khalid', 'Faiq', ''], ['Hanif', 'Muhammad Abdullah', ''], ['Rehman', 'Semeen', ''], ['Shafique', 'Muhammad', '']]","['Machine Learning', 'Neural Networks', 'Deep']"
3027,1708.09537,Xiaoyu Ji,"Guoming Zhang, Chen Yan, Xiaoyu Ji, Taimin Zhang, Tianchen Zhang,
  Wenyuan Xu",DolphinAtack: Inaudible Voice Commands,"15 pages, 17 figures","published on ACM Conference on Computer and Communications
  Security (CCS) 2017",10.1145/3133956.3134052,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Speech recognition (SR) systems such as Siri or Google Now have become an
increasingly popular human-computer interaction method, and have turned various
systems into voice controllable systems(VCS). Prior work on attacking VCS shows
that the hidden voice commands that are incomprehensible to people can control
the systems. Hidden voice commands, though hidden, are nonetheless audible. In
this work, we design a completely inaudible attack, DolphinAttack, that
modulates voice commands on ultrasonic carriers (e.g., f > 20 kHz) to achieve
inaudibility. By leveraging the nonlinearity of the microphone circuits, the
modulated low frequency audio commands can be successfully demodulated,
recovered, and more importantly interpreted by the speech recognition systems.
We validate DolphinAttack on popular speech recognition systems, including
Siri, Google Now, Samsung S Voice, Huawei HiVoice, Cortana and Alexa. By
injecting a sequence of inaudible voice commands, we show a few
proof-of-concept attacks, which include activating Siri to initiate a FaceTime
call on iPhone, activating Google Now to switch the phone to the airplane mode,
and even manipulating the navigation system in an Audi automobile. We propose
hardware and software defense solutions. We validate that it is feasible to
detect DolphinAttack by classifying the audios using supported vector machine
(SVM), and suggest to re-design voice controllable systems to be resilient to
inaudible voice command attacks.
","[{'version': 'v1', 'created': 'Thu, 31 Aug 2017 02:28:21 GMT'}]",2017-09-01,"[['Zhang', 'Guoming', ''], ['Yan', 'Chen', ''], ['Ji', 'Xiaoyu', ''], ['Zhang', 'Taimin', ''], ['Zhang', 'Tianchen', ''], ['Xu', 'Wenyuan', '']]","['Voice Controllable Systems', 'Speech Recognition', 'MEMS Microphones', 'Security Analysis', 'Defense']"
3028,1804.05599,Alberto Mart\'in-Mart\'in,"Alberto Mart\'in-Mart\'in, Enrique Orduna-Malea, Emilio Delgado
  L\'opez-C\'ozar","Author-level metrics in the new academic profile platforms: The online
  behaviour of the Bibliometrics community","26 pages, 6 figures, 7 tables","2018, Journal of Informetrics, 12(2), 494-509",10.1016/j.joi.2018.04.001,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The new web-based academic communication platforms do not only enable
researchers to better advertise their academic outputs, making them more
visible than ever before, but they also provide a wide supply of metrics to
help authors better understand the impact their work is making. This study has
three objectives: a) to analyse the uptake of some of the most popular
platforms (Google Scholar Citations, ResearcherID, ResearchGate, Mendeley and
Twitter) by a specific scientific community (bibliometrics, scientometrics,
informetrics, webometrics, and altmetrics); b) to compare the metrics available
from each platform; and c) to determine the meaning of all these new metrics.
To do this, the data available in these platforms about a sample of 811 authors
(researchers in bibliometrics for whom a public profile Google Scholar
Citations was found) were extracted. A total of 31 metrics were analysed. The
results show that a high number of the analysed researchers only had a profile
in Google Scholar Citations (159), or only in Google Scholar Citations and
ResearchGate (142). Lastly, we find two kinds of metrics of online impact.
First, metrics related to connectivity (followers), and second, all metrics
associated to academic impact. This second group can further be divided into
usage metrics (reads, views), and citation metrics. The results suggest that
Google Scholar Citations is the source that provides more comprehensive
citation-related data, whereas Twitter stands out in connectivity-related
metrics.
","[{'version': 'v1', 'created': 'Mon, 16 Apr 2018 10:29:08 GMT'}]",2018-04-17,"[['Martín-Martín', 'Alberto', ''], ['Orduna-Malea', 'Enrique', ''], ['López-Cózar', 'Emilio Delgado', '']]","['Online Academic Profiles', 'Author-Level Metrics', 'Social Media Metrics', 'Google Scholar Citations', 'Altmetrics', 'Citation Impact']"
3029,1005.5437,Secretary Aircc Journal,"Ch.Srinivasa Rao(1), S.Srinivas Kumar(2), B.Chandra Mohan(3), ((1)Sri
  Sai Aditya Institute of Science & Technology, India, (2)JNTUK, India,
  (3)Bapatla Engineering College, India)","Content Based Image Retrieval Using Exact Legendre Moments and Support
  Vector Machine","11 Pages, IJMA","International journal of Multimedia & Its Applications 2.2 (2010)
  69-79",10.5121/ijma.2010.2206,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Content Based Image Retrieval (CBIR) systems based on shape using invariant
image moments, viz., Moment Invariants (MI) and Zernike Moments (ZM) are
available in the literature. MI and ZM are good at representing the shape
features of an image. However, non-orthogonality of MI and poor reconstruction
of ZM restrict their application in CBIR. Therefore, an efficient and
orthogonal moment based CBIR system is needed. Legendre Moments (LM) are
orthogonal, computationally faster, and can represent image shape features
compactly. CBIR system using Exact Legendre Moments (ELM) for gray scale images
is proposed in this work. Superiority of the proposed CBIR system is observed
over other moment based methods, viz., MI and ZM in terms of retrieval
efficiency and retrieval time. Further, the classification efficiency is
improved by employing Support Vector Machine (SVM) classifier. Improved
retrieval results are obtained over existing CBIR algorithm based on Stacked
Euler Vector (SERVE) combined with Modified Moment Invariants (MMI).
","[{'version': 'v1', 'created': 'Sat, 29 May 2010 08:12:16 GMT'}]",2010-07-15,"[['Rao', 'Ch. Srinivasa', ''], ['Kumar', 'S. Srinivas', ''], ['Mohan', 'B. Chandra', '']]","['CBIR', 'LM', 'ELM', 'Feature Extraction', 'Support Vector Machine']"
3030,1507.06925,Luiz Capretz Dr.,"Jie Xu, Danny Ho, Luiz Fernando Capretz","An Empirical Study on the Procedure to Derive Software Quality
  Estimation Models",,"International Journal of Computer Science & Information
  Technology, 2(4):1-16, 2010",10.5121/ijcsit.2010.2401,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software quality assurance has been a heated topic for several decades. If
factors that influence software quality can be identified, they may provide
more insight for better software development management. More precise quality
assurance can be achieved by employing resources according to accurate quality
estimation at the early stages of a project. In this paper, a general procedure
is proposed to derive software quality estimation models and various techniques
are presented to accomplish the tasks in respective steps. Several statistical
techniques together with machine learning method are utilized to verify the
effectiveness of software metrics. Moreover, a neuro-fuzzy approach is adopted
to improve the accuracy of the estimation model. This procedure is carried out
based on data from the ISBSG repository to present its empirical value.
","[{'version': 'v1', 'created': 'Fri, 24 Jul 2015 17:32:44 GMT'}]",2015-07-27,"[['Xu', 'Jie', ''], ['Ho', 'Danny', ''], ['Capretz', 'Luiz Fernando', '']]","['Software Quality Estimation', 'Software Metrics', 'Regression', 'Neural Networks', 'Fuzzy Logic']"
3031,1810.12470,Thomas Gabor,"Thomas Gabor, Lenz Belzner, Claudia Linnhoff-Popien","Inheritance-Based Diversity Measures for Explicit Convergence Control in
  Evolutionary Algorithms","GECCO '18: Genetic and Evolutionary Computation Conference, 2018,
  Kyoto, Japan",,10.1145/3205455.3205630,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Diversity is an important factor in evolutionary algorithms to prevent
premature convergence towards a single local optimum. In order to maintain
diversity throughout the process of evolution, various means exist in
literature. We analyze approaches to diversity that (a) have an explicit and
quantifiable influence on fitness at the individual level and (b) require no
(or very little) additional domain knowledge such as domain-specific distance
functions. We also introduce the concept of genealogical diversity in a broader
study. We show that employing these approaches can help evolutionary algorithms
for global optimization in many cases.
","[{'version': 'v1', 'created': 'Tue, 30 Oct 2018 00:51:02 GMT'}]",2018-10-31,"[['Gabor', 'Thomas', ''], ['Belzner', 'Lenz', ''], ['Linnhoff-Popien', 'Claudia', '']]","['diversity', 'evolutionary algorithms', 'premature convergence', 'optimization', 'genetic drift']"
3032,1701.07645,Yuni Iwamasa,"Yuni Iwamasa, Kazuo Murota, Stanislav Zivny",Discrete Convexity in Joint Winner Property,12 pages,"Discrete Optimization, 28:78--88, 2018",10.1016/j.disopt.2018.01.001,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we reveal a relation between joint winner property (JWP) in
the field of valued constraint satisfaction problems (VCSPs) and
M${}^\natural$-convexity in the field of discrete convex analysis (DCA). We
introduce the M${}^\natural$-convex completion problem, and show that a
function $f$ satisfying the JWP is Z-free if and only if a certain function
$\overline{f}$ associated with $f$ is M${}^\natural$-convex completable. This
means that if a function is Z-free, then the function can be minimized in
polynomial time via M${}^\natural$-convex intersection algorithms. Furthermore
we propose a new algorithm for Z-free function minimization, which is faster
than previous algorithms for some parameter values.
","[{'version': 'v1', 'created': 'Thu, 26 Jan 2017 10:40:44 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Oct 2017 07:29:23 GMT'}, {'version': 'v3', 'created': 'Tue, 8 May 2018 16:03:44 GMT'}]",2018-05-09,"[['Iwamasa', 'Yuni', ''], ['Murota', 'Kazuo', ''], ['Zivny', 'Stanislav', '']]","['valued constraint satisfaction problems', 'discrete convex analysis', 'Mconvexity']"
3033,1705.10051,Jittat Fakcharoenphol,"Adisak Supeesun (Kasetsart University, Bangkok, Thailand) and Jittat
  Fakcharoenphol (Kasetsart University, Bangkok, Thailand)",Learning Network Structures from Contagion,,"Information Processing Letters, Volume 121, May 2017, Pages 11-16",10.1016/j.ipl.2017.01.005,,cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 2014, Amin, Heidari, and Kearns proved that tree networks can be learned
by observing only the infected set of vertices of the contagion process under
the independent cascade model, in both the active and passive query models.
They also showed empirically that simple extensions of their algorithms work on
sparse networks. In this work, we focus on the active model. We prove that a
simple modification of Amin et al.'s algorithm works on more general classes of
networks, namely (i) networks with large girth and low path growth rate, and
(ii) networks with bounded degree. This also provides partial theoretical
explanation for Amin et al.'s experiments on sparse networks.
","[{'version': 'v1', 'created': 'Mon, 29 May 2017 06:53:13 GMT'}]",2017-05-30,"[['Supeesun', 'Adisak', '', 'Kasetsart University, Bangkok, Thailand'], ['Fakcharoenphol', 'Jittat', '', 'Kasetsart University, Bangkok, Thailand']]","['Graph Algorithms', 'Learning', 'Contagion', 'Network Structures', 'Large Girth']"
3034,1810.11934,Shantanu Shahane,"Shantanu Shahane, Narayana R. Aluru, Surya Pratap Vanka","Uncertainty Quantification in Three Dimensional Natural Convection using
  Polynomial Chaos Expansion and Deep Neural Networks",,,10.1016/j.ijheatmasstransfer.2019.05.014,,cs.NA physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper analyzes the effects of input uncertainties on the outputs of a
three dimensional natural convection problem in a differentially heated cubical
enclosure. Two different cases are considered for parameter uncertainty
propagation and global sensitivity analysis. In case A, stochastic variation is
introduced in the two non-dimensional parameters (Rayleigh and Prandtl numbers)
with an assumption that the boundary temperature is uniform. Being a two
dimensional stochastic problem, the polynomial chaos expansion (PCE) method is
used as a surrogate model. Case B deals with non-uniform stochasticity in the
boundary temperature. Instead of the traditional Gaussian process model with
the Karhunen-Lo$\grave{e}$ve expansion, a novel approach is successfully
implemented to model uncertainty in the boundary condition. The boundary is
divided into multiple domains and the temperature imposed on each domain is
assumed to be an independent and identically distributed (i.i.d) random
variable. Deep neural networks are trained with the boundary temperatures as
inputs and Nusselt number, internal temperature or velocities as outputs. The
number of domains which is essentially the stochastic dimension is 4, 8, 16 or
32. Rigorous training and testing process shows that the neural network is able
to approximate the outputs to a reasonable accuracy. For a high stochastic
dimension such as 32, it is computationally expensive to fit the PCE. This
paper demonstrates a novel way of using the deep neural network as a surrogate
modeling method for uncertainty quantification with the number of simulations
much fewer than that required for fitting the PCE, thus, saving the
computational cost.
","[{'version': 'v1', 'created': 'Mon, 29 Oct 2018 03:24:11 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Jan 2019 15:41:30 GMT'}]",2020-10-06,"[['Shahane', 'Shantanu', ''], ['Aluru', 'Narayana R.', ''], ['Vanka', 'Surya Pratap', '']]","['Deep Neural Networks', 'Polynomial Chaos Expansion', 'Natural']"
3035,1512.09287,Vladimir Potapov N.,Vladimir N. Potapov,Partial covering arrays for data hiding and quantization,7 pages,"SEMR, 2018. V. 15, P. 561-569",10.17377/semi.2018.15.045,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of finding a set (partial covering array) $S$ of
vertices of the Boolean $n$-cube having cardinality $2^{n-k}$ and intersecting
with maximum number of $k$-dimensional faces. We prove that the ratio between
the numbers of the $k$-faces containing elements of $S$ to $k$-faces is less
than $1-\frac{1+o(1)}{\sqrt{2\pi k}}$ as $n\rightarrow\infty$ for sufficiently
large $k$. The solution of the problem in the class of linear codes is found.
Connections between this problem, cryptography and an efficiency of
quantization are discussed.
","[{'version': 'v1', 'created': 'Thu, 31 Dec 2015 13:32:24 GMT'}, {'version': 'v2', 'created': 'Sat, 5 Aug 2017 04:48:31 GMT'}]",2018-11-01,"[['Potapov', 'Vladimir N.', '']]","['linear code', 'covering array', 'data hiding', 'wiretap channel', 'quantization', 'wetpaper stegoscheme']"
3036,1402.1245,Aruna  G.R,"Ms.Aruna.G.R, Mr.SivanArulSelvan","A Survey on Delay-Aware Network Structure for Wireless Sensor Networks
  with Consecutive Data Collection Processes","4 pages,3 figures, ""Published with International Journal of
  Engineering Trends and Technology (IJETT)""","IJETT, 7(4),198-201, 2014 published by seventh sense research
  group",10.14445/22315381/IJETT-V7P240,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Wireless Sensor Network (WSN) consists of spatially distributed autonomous
sensors to monitor physical or environmental conditions, such as temperature,
sound, pressure,etc. In sensing applications, data packets are flowing from
sensor nodes to base station. In data collection processes, bottom up approach
is used. In bottom up approach, all nodes send their sensed data packets to
base station directly. In this approach will lead to increased delay, which
will lead to higher energy consumption. To reduce the energy consumption of
sensor nodes,Clustering Algorithm and Low-Energy Adaptive Clustering Hierarchy
(LEACH) are being used. Efficient gathering in Wireless Sensor information
systems, Power Efficient Gathering in Sensor Information System (PEGASIS) is
being used. There are lot of research issues in Wireless Sensor Networks such
as delay, lifetime of network, energy dissipation which needs to be resolved.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2014 05:10:55 GMT'}]",2014-02-07,"[['R', 'Ms. Aruna. G.', ''], ['SivanArulSelvan', 'Mr.', '']]","['energy dissipation', 'Clustering', 'LEACH', 'PEGASIS', 'Data Collection Process', 'Cluster Head', 'Data aggregation']"
3037,1711.08045,\'Alvaro L\'opez Garc\'ia,"\'Alvaro L\'opez Garc\'ia, Enol Fern\'andez del Castillo, Pablo Orviz
  Fern\'andez",Standards for enabling heterogeneous IaaS cloud federations,,"Computer Standards & Interfaces, Volume 47, 2016, Pages 19-23,",10.1016/j.csi.2016.02.002,,cs.NI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Technology market is continuing a rapid growth phase where different resource
providers and Cloud Management Frameworks are positioning to provide ad-hoc
solutions -in terms of management interfaces, information discovery or billing-
trying to differentiate from competitors but that as a result remain
incompatible between them when addressing more complex scenarios like federated
clouds. Grasping interoperability problems present in current infrastructures
is then a must-do, tackled by studying how existing and emerging standards
could enhance user experience in the cloud ecosystem. In this paper we will
review the current open challenges in Infrastructure as a Service cloud
interoperability and federation, as well as point to the potential standards
that should alleviate these problems.
","[{'version': 'v1', 'created': 'Tue, 21 Nov 2017 21:30:19 GMT'}]",2017-11-23,"[['García', 'Álvaro López', ''], ['del Castillo', 'Enol Fernández', ''], ['Fernández', 'Pablo Orviz', '']]","['Cloud Computing', 'Standards', 'Interoperability', 'Federation']"
3038,1803.02250,Tiago Cunha,"Tiago Cunha, Carlos Soares and Andr\'e C.P.L.F. de Carvalho","CF4CF: Recommending Collaborative Filtering algorithms using
  Collaborative Filtering",,,10.1145/3240323.3240378,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic solutions which enable the selection of the best algorithms for a
new problem are commonly found in the literature. One research area which has
recently received considerable efforts is Collaborative Filtering. Existing
work includes several approaches using Metalearning, which relate the
characteristics of datasets with the performance of the algorithms. This work
explores an alternative approach to tackle this problem. Since, in essence,
both are recommendation problems, this work uses Collaborative Filtering
algorithms to select Collaborative Filtering algorithms. Our approach
integrates subsampling landmarkers, which are a data characterization approach
commonly used in Metalearning, with a standard Collaborative Filtering method.
The experimental results show that CF4CF competes with standard Metalearning
strategies in the problem of Collaborative Filtering algorithm selection.
","[{'version': 'v1', 'created': 'Tue, 6 Mar 2018 15:23:46 GMT'}]",2018-10-04,"[['Cunha', 'Tiago', ''], ['Soares', 'Carlos', ''], ['de Carvalho', 'André C. P. L. F.', '']]","['Collaborative Filtering', 'Metalearning', 'Label Ranking']"
3039,2105.04264,Nicholas Kolokotronis,"Christos-Minas Mathas, Konstantinos-Panagiotis Grammatikakis, Costas
  Vassilakis, Nicholas Kolokotronis, Vasiliki-Georgia Bilali, Dimitris
  Kavallieros",Threat Landscape for Smart Grid Systems,,"15th International Conference on Availability, Reliability and
  Security (ARES 2020)",10.1145/3407023.3409229,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smart Grids are energy delivery networks, constituting an evolution of power
grids, in which a bidirectional flow between power providers and consumers is
established. These flows support the transfer of electricity and information,
in order to support automation actions in the context of the energy delivery
network. Insofar, many smart grid implementations and implementation proposals
have emerged, with varying degrees of feature delivery and sophistication.
While smart grids offer many advantages, their distributed nature and
information flow streams between energy producers and consumers enable the
launching of a number of attacks against the smart grid infrastructure, where
the related consequences may range from economic loss to complete failure of
the smart grid. In this paper, we survey the threat landscape of smart grids,
identifying threats that are specific to this infrastructure, providing an
assessment of the severity of the consequences of each attack type, discerning
features that can be utilized to detect attacks and listing methods that can be
used to mitigate them.
","[{'version': 'v1', 'created': 'Mon, 10 May 2021 11:03:05 GMT'}]",2021-05-11,"[['Mathas', 'Christos-Minas', ''], ['Grammatikakis', 'Konstantinos-Panagiotis', ''], ['Vassilakis', 'Costas', ''], ['Kolokotronis', 'Nicholas', ''], ['Bilali', 'Vasiliki-Georgia', ''], ['Kavallieros', 'Dimitris', '']]","['Smart grids', 'security', 'attacks', 'attack detection features', 'attack mitigation']"
3040,2105.07582,Alsharif Abuadbba Dr,"Keelan Evans, Alsharif Abuadbba, Tingmin Wu, Kristen Moore, Mohiuddin
  Ahmed, Ganna Pogrebna, Surya Nepal, Mike Johnstone",RAIDER: Reinforcement-aided Spear Phishing Detector,16 pages,"International Conference on Network and System Security, 2022",10.1007/978-3-031-23020-2_2,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spear Phishing is a harmful cyber-attack facing business and individuals
worldwide. Considerable research has been conducted recently into the use of
Machine Learning (ML) techniques to detect spear-phishing emails. ML-based
solutions may suffer from zero-day attacks; unseen attacks unaccounted for in
the training data. As new attacks emerge, classifiers trained on older data are
unable to detect these new varieties of attacks resulting in increasingly
inaccurate predictions. Spear Phishing detection also faces scalability
challenges due to the growth of the required features which is proportional to
the number of the senders within a receiver mailbox. This differs from
traditional phishing attacks which typically perform only a binary
classification between phishing and benign emails. Therefore, we devise a
possible solution to these problems, named RAIDER: Reinforcement AIded Spear
Phishing DEtectoR. A reinforcement-learning based feature evaluation system
that can automatically find the optimum features for detecting different types
of attacks. By leveraging a reward and penalty system, RAIDER allows for
autonomous features selection. RAIDER also keeps the number of features to a
minimum by selecting only the significant features to represent phishing emails
and detect spear-phishing attacks. After extensive evaluation of RAIDER over
11,000 emails and across 3 attack scenarios, our results suggest that using
reinforcement learning to automatically identify the significant features could
reduce the dimensions of the required features by 55% in comparison to existing
ML-based systems. It also improves the accuracy of detecting spoofing attacks
by 4% from 90% to 94%. In addition, RAIDER demonstrates reasonable detection
accuracy even against a sophisticated attack named Known Sender in which
spear-phishing emails greatly resemble those of the impersonated sender.
","[{'version': 'v1', 'created': 'Mon, 17 May 2021 02:42:54 GMT'}, {'version': 'v2', 'created': 'Sun, 2 Oct 2022 13:30:31 GMT'}, {'version': 'v3', 'created': 'Tue, 3 Jan 2023 11:08:08 GMT'}]",2023-01-04,"[['Evans', 'Keelan', ''], ['Abuadbba', 'Alsharif', ''], ['Wu', 'Tingmin', ''], ['Moore', 'Kristen', ''], ['Ahmed', 'Mohiuddin', ''], ['Pogrebna', 'Ganna', ''], ['Nepal', 'Surya', ''], ['Johnstone', 'Mike', '']]","['Spear Phishing', 'Zero-Day Attack', 'Reinforcement Learning']"
3041,1705.01229,Avery Miller,"Avery Miller, Andrzej Pelc","Deterministic Distributed Construction of $T$-Dominating Sets in Time
  $T$",13 pages,Discrete Applied Mathematics 222: 172-178 (2017),10.1016/j.dam.2017.01.012,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A $k$-dominating set is a set $D$ of nodes of a graph such that, for each
node $v$, there exists a node $w \in D$ at distance at most $k$ from $v$. Our
aim is the deterministic distributed construction of small $T$-dominating sets
in time $T$ in networks modeled as undirected $n$-node graphs and under the
$\cal{LOCAL}$ communication model.
  For any positive integer $T$, if $b$ is the size of a pairwise disjoint
collection of balls of radii at least $T$ in a graph, then $b$ is an obvious
lower bound on the size of a $T$-dominating set. Our first result shows that,
even on rings, it is impossible to construct a $T$-dominating set of size $s$
asymptotically $b$ (i.e., such that $s/b \rightarrow 1$) in time $T$.
  In the range of time $T \in \Theta (\log^* n)$, the size of a $T$-dominating
set turns out to be very sensitive to multiplicative constants in running time.
Indeed, it follows from \cite{KP}, that for time $T=\gamma \log^* n$ with large
constant $\gamma$, it is possible to construct a $T$-dominating set whose size
is a small fraction of $n$. By contrast, we show that, for time $T=\alpha
\log^* n $ for small constant $\alpha$, the size of a $T$-dominating set must
be a large fraction of $n$.
  Finally, when $T \in o (\log^* n)$, the above lower bound implies that, for
any constant $x<1$, it is impossible to construct a $T$-dominating set of size
smaller than $xn$, even on rings. On the positive side, we provide an algorithm
that constructs a $T$-dominating set of size $n- \Theta(T)$ on all graphs.
","[{'version': 'v1', 'created': 'Wed, 3 May 2017 01:49:35 GMT'}]",2017-05-04,"[['Miller', 'Avery', ''], ['Pelc', 'Andrzej', '']]","['T-dominating set', 'LOCAL model', 'distributed algorithm', 'undirected networks']"
3042,1903.03556,Mira Rizkallah,"Mira Rizkallah, Xin Su, Thomas Maugey and Christine Guillemot",Geometry-Aware Graph Transforms for Light Field Compact Representation,,,10.1109/TIP.2019.2928873,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper addresses the problem of energy compaction of dense 4D light fields
by designing geometry-aware local graph-based transforms. Local graphs are
constructed on super-rays that can be seen as a grouping of spatially and
geometry-dependent angularly correlated pixels. Both non separable and
separable transforms are considered. Despite the local support of limited size
defined by the super-rays, the Laplacian matrix of the non separable graph
remains of high dimension and its diagonalization to compute the transform
eigen vectors remains computationally expensive. To solve this problem, we then
perform the local spatio-angular transform in a separable manner. We show that
when the shape of corresponding super-pixels in the different views is not
isometric, the basis functions of the spatial transforms are not coherent,
resulting in decreased correlation between spatial transform coefficients. We
hence propose a novel transform optimization method that aims at preserving
angular correlation even when the shapes of the super-pixels are not isometric.
Experimental results show the benefit of the approach in terms of energy
compaction. A coding scheme is also described to assess the rate-distortion
perfomances of the proposed transforms and is compared to state of the art
encoders namely HEVC and JPEG Pleno VM 1.1.
","[{'version': 'v1', 'created': 'Fri, 8 Mar 2019 16:56:11 GMT'}]",2019-10-23,"[['Rizkallah', 'Mira', ''], ['Su', 'Xin', ''], ['Maugey', 'Thomas', ''], ['Guillemot', 'Christine', '']]","['Light Fields', 'Energy Compaction', 'Transform coding', 'Super-rays', 'Graph FourierTransform']"
3043,1211.2378,Cyril Voyant,"Cyril Voyant (SPE, CHD Castellucio), Marc Muselli (SPE), Christophe
  Paoli (SPE), Marie Laure Nivet (SPE)","Hybrid methodology for hourly global radiation forecasting in
  Mediterranean area",,,10.1016/j.renene.2012.10.049,,cs.NE cs.LG physics.ao-ph stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The renewable energies prediction and particularly global radiation
forecasting is a challenge studied by a growing number of research teams. This
paper proposes an original technique to model the insolation time series based
on combining Artificial Neural Network (ANN) and Auto-Regressive and Moving
Average (ARMA) model. While ANN by its non-linear nature is effective to
predict cloudy days, ARMA techniques are more dedicated to sunny days without
cloud occurrences. Thus, three hybrids models are suggested: the first proposes
simply to use ARMA for 6 months in spring and summer and to use an optimized
ANN for the other part of the year; the second model is equivalent to the first
but with a seasonal learning; the last model depends on the error occurred the
previous hour. These models were used to forecast the hourly global radiation
for five places in Mediterranean area. The forecasting performance was compared
among several models: the 3 above mentioned models, the best ANN and ARMA for
each location. In the best configuration, the coupling of ANN and ARMA allows
an improvement of more than 1%, with a maximum in autumn (3.4%) and a minimum
in winter (0.9%) where ANN alone is the best.
","[{'version': 'v1', 'created': 'Sun, 11 Nov 2012 07:16:56 GMT'}]",2012-11-13,"[['Voyant', 'Cyril', '', 'SPE, CHD Castellucio'], ['Muselli', 'Marc', '', 'SPE'], ['Paoli', 'Christophe', '', 'SPE'], ['Nivet', 'Marie Laure', '', 'SPE']]","['Time Series', 'Artificial Neural Networks', 'ARMA', 'Prediction', 'Global radiation', 'Hybrid model']"
3044,2102.05706,Enrique Ordu\~na-Malea,Enrique Orduna-Malea,Dot-Science Top Level Domain: academic websites or dumpsites?,"24 pages, 11 tables and 6 figures",,10.1007/s11192-020-03832-8,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dot-science was launched in 2015 as a new academic top-level domain (TLD)
aimed to provide 'a dedicated, easily accessible location for global Internet
users with an interest in science'. The main objective of this work is to find
out the general scholarly usage of this top-level domain. In particular, the
following three questions are pursued: usage (number of web domains registered
with the dot-science), purpose (main function and category of websites linked
to these web domains), and impact (websites' visibility and authority). To do
this, 13,900 domain names were gathered through ICANN's Domain Name
Registration Data Lookup database. Each web domain was subsequently
categorized, and data on web impact were obtained from Majestic's API. Based on
the results obtained, it is concluded that the dot-science top-level domain is
scarcely adopted by the academic community, and mainly used by registrar
companies for reselling purposes (35.5% of all web domains were parked).
Websites receiving the highest number of backlinks were generally related to
non-academic websites applying intensive link building practices and offering
leisure or even fraudulent contents. Majestic's Trust Flow metric has been
proved an effective method to filter reputable academic websites. As regards
primary academic-related dot-science web domain categories, 1,175 (8.5% of all
web domains registered) were found, mainly personal academic websites (342 web
domains), blogs (261) and research groups (133). All dubious content reveals
bad practices on the Web, where the tag 'science' is fundamentally used as a
mechanism to deceive search engine algorithms.
","[{'version': 'v1', 'created': 'Wed, 10 Feb 2021 19:26:24 GMT'}]",2021-02-12,"[['Orduna-Malea', 'Enrique', '']]","['Informetrics', 'Webometrics', 'top-level domains', 'scientific communication', 'web authority', 'academic websites']"
3045,1106.6196,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",On the behaviours produced by instruction sequences under execution,"36 pages, consolidates material from arXiv:0811.0436 [cs.PL],
  arXiv:0902.2859 [cs.PL], and arXiv:0905.2257 [cs.PL]; abstract and
  introduction rewritten, examples and proofs added","Fundamenta Informaticae, 120(2):111--144, 2012",10.3233/FI-2012-753,,cs.PL cs.DC cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study several aspects of the behaviours produced by instruction sequences
under execution in the setting of the algebraic theory of processes known as
ACP. We use ACP to describe the behaviours produced by instruction sequences
under execution and to describe two protocols implementing these behaviours in
the case where the processing of instructions takes place remotely. We also
show that all finite-state behaviours considered in ACP can be produced by
instruction sequences under execution.
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2011 11:51:25 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Jun 2012 07:11:09 GMT'}]",2012-12-05,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['instruction sequence', 'remote instruction processing', 'instruction sequence producible process']"
3046,1904.01152,Elias Salom\~ao Helou Neto,"Elias S. Helou, Marcelo V. W. Zibetti, Leon Axel, Kai Tobias Block,
  Ravinder R. Regatte, Gabor T. Herman",The Discrete Fourier Transform for Golden Angle Linogram Sampling,,,10.1088/1361-6420/ab44ee,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Estimation of the Discrete-Time Fourier Transform (DTFT) at points of a
finite domain arises in many imaging applications. A new approach to this task,
the Golden Angle Linogram Fourier Domain (GALFD), is presented, together with a
computationally fast and accurate tool, named Golden Angle Linogram Evaluation
(GALE), for approximating the DTFT at points of a GALFD. A GALFD resembles a
Linogram Fourier Domain (LFD), which is efficient and accurate. A limitation of
linograms is that embedding an LFD into a larger one requires many extra
points, at least doubling the domain's cardinality. The GALFD, on the other
hand, allows for incremental inclusion of relatively few data points.
Approximation error bounds and floating point operations counts are presented
to show that GALE computes accurately and efficiently the DTFT at the points of
a GALFD. The ability to extend the data collection in small increments is
beneficial in applications such as Magnetic Resonance Imaging. Experiments for
simulated and for real-world data are presented to substantiate the theoretical
claims. The mathematical analysis, algorithms, and software developed in the
paper are equally suitable to other angular distributions of rays and therefore
we bring the benefits of linograms to arbitrary radial patterns.
","[{'version': 'v1', 'created': 'Tue, 2 Apr 2019 00:23:13 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Sep 2019 16:50:24 GMT'}]",2020-01-08,"[['Helou', 'Elias S.', ''], ['Zibetti', 'Marcelo V. W.', ''], ['Axel', 'Leon', ''], ['Block', 'Kai Tobias', ''], ['Regatte', 'Ravinder R.', ''], ['Herman', 'Gabor T.', '']]","['discrete Fourier transform', 'golden angle', 'linogram', 'tomography', 'magneticresonance imaging', 'non-equidistant sampling', 'error estimates']"
3047,1609.01759,Wei Fu,"Wei Fu, Tim Menzies, Xipeng Shen",Tuning for Software Analytics: is it Really Necessary?,,Information and Software Technology 76 (2016): 135-146,10.1016/j.infsof.2016.04.017,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Data miners have been widely used in software engineering to, say,
generate defect predictors from static code measures. Such static code defect
predictors perform well compared to manual methods, and they are easy to use
and useful to use. But one of the ""black art"" of data mining is setting the
tunings that control the miner. Objective:We seek simple, automatic, and very
effective method for finding those tunings. Method: For each experiment with
different data sets (from open source JAVA systems), we ran differential
evolution as anoptimizer to explore the tuning space (as a first step) then
tested the tunings using hold-out data. Results: Contrary to our prior
expectations, we found these tunings were remarkably simple: it only required
tens, not thousands,of attempts to obtain very good results. For example, when
learning software defect predictors, this method can quickly find tuningsthat
alter detection precision from 0% to 60%. Conclusion: Since (1) the
improvements are so large, and (2) the tuning is so simple, we need to change
standard methods insoftware analytics. At least for defect prediction, it is no
longer enough to just run a data miner and present the resultwithoutconducting
a tuning optimization study. The implication for other kinds of analytics is
now an open and pressing issue
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2016 20:56:39 GMT'}]",2016-09-12,"[['Fu', 'Wei', ''], ['Menzies', 'Tim', ''], ['Shen', 'Xipeng', '']]","['defect prediction', 'CART', 'random forest', 'differential evolution', 'search-based software engineering']"
3048,1112.2042,Saleh Omari,"Saleh Ali Alomari, Putra Sumari","Statistical Information of the Increased Demand for Watch the VOD with
  the Increased Sophistication in the Mobile Devices,Communications and
  Internet Penetration in Asia","17 pages, 17 figures, 4 tables; The International Journal of
  Multimedia & Its Applications (IJMA) Vol.3, No.4, November 2011",,10.5121/ijma.2011.3415,,cs.MM,http://creativecommons.org/licenses/by/3.0/,"  As the rapid progress of the media streaming applications such as video
streaming can be classified into two types of streaming, Live video streaming,
Video on Demand (VoD). Live video streaming is a service which allows the
clients to watch many TV channels over the internet and the clients able to use
one operation to perform is to switch the channels. Video on Demand (VoD) is
one of the most important applications for the internet of the future and has
become an interactive multimedia service which allows the users to start
watching the video of their choice at anytime and anywhere, especially after
the rapid deployment of the wireless networks and mobile devices. In this paper
provide statistical information about the Internet, communications and mobile
devices etc. This has led to an increased demand for the development,
communication and computational powers of many of the mobile wireless
subscribers/mobile devices such as laptops, PDAs, smart phones and notebook.
These techniques are utilized to obtain a video on demand service with higher
resolution and quality. Another objective in this paper is to see Malaysia
ranked as a fully developed country by the year 2020.
","[{'version': 'v1', 'created': 'Fri, 9 Dec 2011 08:26:23 GMT'}]",2011-12-12,"[['Alomari', 'Saleh Ali', ''], ['Sumari', 'Putra', '']]","['Video-on-Demand', 'Wireless Network', 'Mobile Network', 'TV', 'YouTube & FaceBook']"
3049,1805.06094,Yang Liu,"Yang Liu, Prateek Bansal, Ricardo Daziano, Samitha Samaranayake","A Framework to Integrate Mode Choice in the Design of Mobility-on-Demand
  Systems","31 pages, 11 figures. This manuscript version is made available under
  the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/",,10.1016/j.trc.2018.09.022,,cs.SY math.OC stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobility-on-Demand (MoD) systems are generally designed and analyzed for a
fixed and exogenous demand, but such frameworks fail to answer questions about
the impact of these services on the urban transportation system, such as the
effect of induced demand and the implications for transit ridership. In this
study, we propose a unified framework to design, optimize and analyze MoD
operations within a multimodal transportation system where the demand for a
travel mode is a function of its level of service. An application of Bayesian
optimization (BO) to derive the optimal supply-side MoD parameters (e.g., fleet
size and fare) is also illustrated. The proposed framework is calibrated using
the taxi demand data in Manhattan, New York. Travel demand is served by public
transit and MoD services of varying passenger capacities (1, 4 and 10), and
passengers are predicted to choose travel modes according to a mode choice
model. This choice model is estimated using stated preference data collected in
New York City. The convergence of the multimodal supply-demand system and the
superiority of the BO-based optimization method over earlier approaches are
established through numerical experiments. We finally consider a policy
intervention where the government imposes a tax on the ride-hailing service and
illustrate how the proposed framework can quantify the pros and cons of such
policies for different stakeholders.
","[{'version': 'v1', 'created': 'Wed, 16 May 2018 01:57:52 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Jun 2018 02:45:40 GMT'}, {'version': 'v3', 'created': 'Mon, 13 Aug 2018 03:25:33 GMT'}, {'version': 'v4', 'created': 'Sun, 7 Oct 2018 19:10:56 GMT'}]",2018-10-09,"[['Liu', 'Yang', ''], ['Bansal', 'Prateek', ''], ['Daziano', 'Ricardo', ''], ['Samaranayake', 'Samitha', '']]","['Mode Choice', 'Mobility-on-Demand', 'Bayesian Optimization']"
3050,1812.05239,Kenneth Holstein,"Kenneth Holstein, Jennifer Wortman Vaughan, Hal Daum\'e III, Miro
  Dud\'ik, Hanna Wallach","Improving fairness in machine learning systems: What do industry
  practitioners need?","To appear in the 2019 ACM CHI Conference on Human Factors in
  Computing Systems (CHI 2019)",,10.1145/3290605.3300830,,cs.HC cs.CY cs.LG cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The potential for machine learning (ML) systems to amplify social inequities
and unfairness is receiving increasing popular and academic attention. A surge
of recent work has focused on the development of algorithmic tools to assess
and mitigate such unfairness. If these tools are to have a positive impact on
industry practice, however, it is crucial that their design be informed by an
understanding of real-world needs. Through 35 semi-structured interviews and an
anonymous survey of 267 ML practitioners, we conduct the first systematic
investigation of commercial product teams' challenges and needs for support in
developing fairer ML systems. We identify areas of alignment and disconnect
between the challenges faced by industry practitioners and solutions proposed
in the fair ML research literature. Based on these findings, we highlight
directions for future ML and HCI research that will better address industry
practitioners' needs.
","[{'version': 'v1', 'created': 'Thu, 13 Dec 2018 02:54:24 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Jan 2019 19:30:11 GMT'}]",2019-01-09,"[['Holstein', 'Kenneth', ''], ['Vaughan', 'Jennifer Wortman', ''], ['Daumé', 'Hal', 'III'], ['Dudík', 'Miro', ''], ['Wallach', 'Hanna', '']]","['algorithmic bias', 'fair machine learning', 'product teams', 'needfinding', 'empirical study', 'UX of machine learning']"
3051,2102.04215,Jamie Harris,"Jamie Harris (1) and Jacy Reese Anthis (1 and 2) ((1) Sentience
  Institute, (2) University of Chicago)",The Moral Consideration of Artificial Entities: A Literature Review,"27 pages, 1 figure","Sci Eng Ethics 27, 53 (2021)",10.1007/s11948-021-00331-8,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Ethicists, policy-makers, and the general public have questioned whether
artificial entities such as robots warrant rights or other forms of moral
consideration. There is little synthesis of the research on this topic so far.
We identify 294 relevant research or discussion items in our literature review
of this topic. There is widespread agreement among scholars that some
artificial entities could warrant moral consideration in the future, if not
also the present. The reasoning varies, such as concern for the effects on
artificial entities and concern for the effects on human society. Beyond the
conventional consequentialist, deontological, and virtue ethicist ethical
frameworks, some scholars encourage ""information ethics"" and
""social-relational"" approaches, though there are opportunities for more
in-depth ethical research on the nuances of moral consideration of artificial
entities. There is limited relevant empirical data collection, primarily in a
few psychological studies on current moral and social attitudes of humans
towards robots and other artificial entities. This suggests an important gap
for social science research on how artificial entities will be integrated into
society and the factors that will determine how the interests of sentient
artificial entities are considered.
","[{'version': 'v1', 'created': 'Tue, 26 Jan 2021 11:07:00 GMT'}]",2021-09-29,"[['Harris', 'Jamie', '', '1 and 2'], ['Anthis', 'Jacy Reese', '', '1 and 2']]","['Artificial Intelligence', 'Robots', 'Rights', 'Ethics', 'Philosophy of Technology', 'Suffering Risk']"
3052,1902.00659,M. Hanefi Calp,"Muhammed Hanefi Calp, Muhammet Ali Akcayol","Optimization of Project Scheduling Activities in Dynamic CPM and PERT
  Networks Using Genetic Algorithms",13 pages,,10.19113/sdufbed.35437,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Projects consist of interconnected dimensions such as objective, time,
resource and environment. Use of these dimensions in a controlled way and their
effective scheduling brings the project success. Project scheduling process
includes defining project activities, and estimation of time and resources to
be used for the activities. At this point, the project resource-scheduling
problems have begun to attract more attention after Program Evaluation and
Review Technique (PERT) and Critical Path Method (CPM) are developed one after
the other. However, complexity and difficulty of CPM and PERT processes led to
the use of these techniques through artificial intelligence methods such as
Genetic Algorithm (GA). In this study, an algorithm was proposed and developed,
which determines critical path, critical activities and project completion
duration by using GA, instead of CPM and PERT techniques used for network
analysis within the scope of project management. The purpose of using GA was
that these algorithms are an effective method for solution of complex
optimization problems. Therefore, correct decisions can be made for implemented
project activities by using obtained results. Thus, optimum results were
obtained in a shorter time than the CPM and PERT techniques by using the model
based on the dynamic algorithm. It is expected that this study will contribute
to the performance field (time, speed, low error etc.) of other studies.
","[{'version': 'v1', 'created': 'Sat, 2 Feb 2019 07:22:07 GMT'}]",2019-02-05,"[['Calp', 'Muhammed Hanefi', ''], ['Akcayol', 'Muhammet Ali', '']]","['Project management', 'CPM', 'PERT', 'Project scheduling', 'Genetic algorithm', 'Optimization']"
3053,1812.11422,Bibek Paudel,"Bibek Paudel, Sandro Luck, Abraham Bernstein","Loss Aversion in Recommender Systems: Utilizing Negative User Preference
  to Improve Recommendation Quality","The First International Workshop on Context-Aware Recommendation
  Systems with Big Data Analytics (CARS-BDA), co-organized with the 12th ACM
  International Conference on Web Search and Data Mining, 2019, Melbourne,
  Australia","CARS-BDA, at the 12th ACM International Conference on Web Search
  and Data Mining (WSDM), 2019",,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Negative user preference is an important context that is not sufficiently
utilized by many existing recommender systems. This context is especially
useful in scenarios where the cost of negative items is high for the users. In
this work, we describe a new recommender algorithm that explicitly models
negative user preferences in order to recommend more positive items at the top
of recommendation-lists. We build upon existing machine-learning model to
incorporate the contextual information provided by negative user preference.
With experimental evaluations on two openly available datasets, we show that
our method is able to improve recommendation quality: by improving accuracy and
at the same time reducing the number of negative items at the top of
recommendation-lists. Our work demonstrates the value of the contextual
information provided by negative feedback, and can also be extended to signed
social networks and link prediction in other networks.
","[{'version': 'v1', 'created': 'Sat, 29 Dec 2018 18:49:13 GMT'}]",2021-02-19,"[['Paudel', 'Bibek', ''], ['Luck', 'Sandro', ''], ['Bernstein', 'Abraham', '']]","['recommender systems', 'collaborative filtering', 'metric learning']"
3054,1804.08569,Andrew Paverd,"Arseny Kurnikov, Andrew Paverd, Mohammad Mannan, N. Asokan","Keys in the Clouds: Auditable Multi-device Access to Cryptographic
  Credentials","Extended version of a paper to appear in the 3rd Workshop on
  Security, Privacy, and Identity Management in the Cloud (SECPID) 2018",,10.1145/3230833.3234518,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Personal cryptographic keys are the foundation of many secure services, but
storing these keys securely is a challenge, especially if they are used from
multiple devices. Storing keys in a centralized location, like an
Internet-accessible server, raises serious security concerns (e.g. server
compromise). Hardware-based Trusted Execution Environments (TEEs) are a
well-known solution for protecting sensitive data in untrusted environments,
and are now becoming available on commodity server platforms.
  Although the idea of protecting keys using a server-side TEE is
straight-forward, in this paper we validate this approach and show that it
enables new desirable functionality. We describe the design, implementation,
and evaluation of a TEE-based Cloud Key Store (CKS), an online service for
securely generating, storing, and using personal cryptographic keys. Using
remote attestation, users receive strong assurance about the behaviour of the
CKS, and can authenticate themselves using passwords while avoiding typical
risks of password-based authentication like password theft or phishing. In
addition, this design allows users to i) define policy-based access controls
for keys; ii) delegate keys to other CKS users for a specified time and/or a
limited number of uses; and iii) audit all key usages via a secure audit log.
We have implemented a proof of concept CKS using Intel SGX and integrated this
into GnuPG on Linux and OpenKeychain on Android. Our CKS implementation
performs approximately 6,000 signature operations per second on a single
desktop PC. The latency is in the same order of magnitude as using
locally-stored keys, and 20x faster than smart cards.
","[{'version': 'v1', 'created': 'Mon, 23 Apr 2018 17:09:59 GMT'}, {'version': 'v2', 'created': 'Sat, 2 Jun 2018 02:45:21 GMT'}]",2018-10-04,"[['Kurnikov', 'Arseny', ''], ['Paverd', 'Andrew', ''], ['Mannan', 'Mohammad', ''], ['Asokan', 'N.', '']]","['Cloud', 'Intel SGX', 'Key management']"
3055,1608.01594,K. Tuncay Tekle,"K. Tuncay Tekle, Yanhong A. Liu","Precise Complexity Guarantees for Pointer Analysis via Datalog with
  Extensions","Paper presented at the 32nd International Conference on Logic
  Programming (ICLP 2016), New York City, USA, 16-21 October 2016, 19 pages,
  LaTeX","Theory and Practice of Logic Programming, 16(5-6):916-932, Sept.
  2016, Cambridge University Press",10.1017/S1471068416000405,,cs.PL cs.CC cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pointer analysis is a fundamental static program analysis for computing the
set of objects that an expression can refer to. Decades of research has gone
into developing methods of varying precision and efficiency for pointer
analysis for programs that use different language features, but determining
precisely how efficient a particular method is has been a challenge in itself.
  For programs that use different language features, we consider methods for
pointer analysis using Datalog and extensions to Datalog. When the rules are in
Datalog, we present the calculation of precise time complexities from the rules
using a new algorithm for decomposing rules for obtaining the best
complexities. When extensions such as function symbols and universal
quantification are used, we describe algorithms for efficiently implementing
the extensions and the complexities of the algorithms.
  This paper is under consideration for acceptance in TPLP.
","[{'version': 'v1', 'created': 'Thu, 4 Aug 2016 16:05:13 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Aug 2016 15:46:20 GMT'}]",2021-10-07,"[['Tekle', 'K. Tuncay', ''], ['Liu', 'Yanhong A.', '']]","['Datalog', 'function symbols', 'universal quantification', 'computational complexity', 'static program analysis', 'pointer analysis', 'alias analysis']"
3056,1711.05075,Morad Behandish,Morad Behandish and Horea T. Ilies,Analytic Methods for Geometric Modeling via Spherical Decomposition,"Special Issue on SIAM/ACM symposium on Solid and Physical Modeling
  (SPM'2015) (Best Paper Award, 2nd Place)","Journal of Computer-Aided Design, 70, pp.100-115, 2016",10.1016/j.cad.2015.06.016,CDL-TR-15-07,cs.CG cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Analytic methods are emerging in solid and configuration modeling, while
providing new insights into a variety of shape and motion related problems by
exploiting tools from group morphology, convolution algebras, and harmonic
analysis. However, most convolution-based methods have used uniform grid-based
sampling to take advantage of the fast Fourier transform (FFT) algorithm. We
propose a new paradigm for more efficient computation of analytic correlations
that relies on a grid-free discretization of arbitrary shapes as countable
unions of balls, in turn described as sublevel sets of summations of smooth
radial kernels at adaptively sampled 'knots'. Using a simple geometric lifting
trick, we interpret this combination as a convolution of an impulsive skeletal
density and primitive kernels with conical support, which faithfully embeds
into the convolution formulation of interactions across different objects. Our
approach enables fusion of search-efficient combinatorial data structures
prevalent in time-critical collision and proximity queries with analytic
methods popular in path planning and protein docking, and outperforms uniform
grid-based FFT methods by leveraging nonequispaced FFTs. We provide example
applications in formulating holonomic collision constraints, shape
complementarity metrics, and morphological operations, unified within a single
analytic framework.
","[{'version': 'v1', 'created': 'Tue, 14 Nov 2017 12:16:34 GMT'}]",2017-12-05,"[['Behandish', 'Morad', ''], ['Ilies', 'Horea T.', '']]","['Analytic Methods', 'Shape Correlation', 'Spherical Sampling', 'Fourier Transform', 'Collision Detection']"
3057,1602.08321,Saurabh Joshi,Ganesh Narayanaswamy and Saurabh Joshi and Daniel Kroening,The Virtues of Conflict: Analyzing Modern Concurrency,"13 pages, 5 figures, Accepted at 21st 21st ACM SIGPLAN Symposium on
  Principles and Practice of Parallel Programming",,10.1145/2851141.2851165,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern shared memory multiprocessors permit reordering of memory operations
for performance reasons. These reorderings are often a source of subtle bugs in
programs written for such architectures. Traditional approaches to verify weak
memory programs often rely on interleaving semantics, which is prone to state
space explosion, and thus severely limits the scalability of the analysis. In
recent times, there has been a renewed interest in modelling dynamic executions
of weak memory programs using partial orders. However, such an approach
typically requires ad-hoc mechanisms to correctly capture the data and
control-flow choices/conflicts present in real-world programs. In this work, we
propose a novel, conflict-aware, composable, truly concurrent semantics for
programs written using C/C++ for modern weak memory architectures. We exploit
our symbolic semantics based on general event structures to build an efficient
decision procedure that detects assertion violations in bounded multi-threaded
programs. Using a large, representative set of benchmarks, we show that our
conflict-aware semantics outperforms the state-of-the-art partial-order based
approaches.
","[{'version': 'v1', 'created': 'Fri, 26 Feb 2016 13:48:49 GMT'}]",2016-02-29,"[['Narayanaswamy', 'Ganesh', ''], ['Joshi', 'Saurabh', ''], ['Kroening', 'Daniel', '']]","['Concurrency', 'weak consistency models', 'software', 'verification']"
3058,1509.04037,Samin Aref,Samin Aref and Mark C. Wilson,Measuring Partial Balance in Signed Networks,"Peer-reviewed author copy, 31 pages, 6 figures, 5 tables","Journal of Complex Networks 6, 4 (2018), 566-595",10.1093/comnet/cnx044,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Is the enemy of an enemy necessarily a friend? If not, to what extent does
this tend to hold? Such questions were formulated in terms of signed (social)
networks and necessary and sufficient conditions for a network to be ""balanced""
were obtained around 1960. Since then the idea that signed networks tend over
time to become more balanced has been widely used in several application areas.
However, investigation of this hypothesis has been complicated by the lack of a
standard measure of partial balance, since complete balance is almost never
achieved in practice. We formalize the concept of a measure of partial balance,
discuss various measures, compare the measures on synthetic datasets, and
investigate their axiomatic properties. The synthetic data involves
Erd\H{o}s-R\'enyi and specially structured random graphs. We show that some
measures behave better than others in terms of axioms and ability to
differentiate between graphs. We also use well-known datasets from the
sociology and biology literature, such as Read's New Guinean tribes, gene
regulatory networks related to two organisms, and a network involving senate
bill co-sponsorship. Our results show that substantially different levels of
partial balance is observed under cycle-based, eigenvalue-based, and
frustration-based measures. We make some recommendations for measures to be
used in future work.
","[{'version': 'v1', 'created': 'Mon, 14 Sep 2015 11:23:49 GMT'}, {'version': 'v2', 'created': 'Wed, 11 May 2016 05:01:07 GMT'}, {'version': 'v3', 'created': 'Wed, 28 Sep 2016 00:26:50 GMT'}, {'version': 'v4', 'created': 'Fri, 14 Apr 2017 11:24:50 GMT'}, {'version': 'v5', 'created': 'Tue, 1 Aug 2017 04:43:38 GMT'}, {'version': 'v6', 'created': 'Mon, 20 Aug 2018 04:41:38 GMT'}]",2018-08-21,"[['Aref', 'Samin', ''], ['Wilson', 'Mark C.', '']]","['structural analysis', 'signed networks', 'balance theory', 'axiom', 'frustration index', 'algebraic conflict']"
3059,1310.4389,Ming-Ming Cheng Dr,"Ming-Ming Cheng, Shuai Zheng, Wen-Yan Lin, Jonathan Warrell, Vibhav
  Vineet, Paul Sturgess, Nigel Crook, Niloy Mitra, Philip Torr",ImageSpirit: Verbal Guided Image Parsing,http://mmcheng.net/imagespirit/,"ACM Transactions on Graphics, 2014",10.1145/2682628,,cs.GR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Humans describe images in terms of nouns and adjectives while algorithms
operate on images represented as sets of pixels. Bridging this gap between how
humans would like to access images versus their typical representation is the
goal of image parsing, which involves assigning object and attribute labels to
pixel. In this paper we propose treating nouns as object labels and adjectives
as visual attribute labels. This allows us to formulate the image parsing
problem as one of jointly estimating per-pixel object and attribute labels from
a set of training images. We propose an efficient (interactive time) solution.
Using the extracted labels as handles, our system empowers a user to verbally
refine the results. This enables hands-free parsing of an image into pixel-wise
object/attribute labels that correspond to human semantics. Verbally selecting
objects of interests enables a novel and natural interaction modality that can
possibly be used to interact with new generation devices (e.g. smart phones,
Google Glass, living room devices). We demonstrate our system on a large number
of real-world images with varying complexity. To help understand the tradeoffs
compared to traditional mouse based interactions, results are reported for both
a large scale quantitative evaluation and a user study.
","[{'version': 'v1', 'created': 'Wed, 16 Oct 2013 14:16:31 GMT'}, {'version': 'v2', 'created': 'Wed, 21 May 2014 16:56:03 GMT'}]",2016-12-08,"[['Cheng', 'Ming-Ming', ''], ['Zheng', 'Shuai', ''], ['Lin', 'Wen-Yan', ''], ['Warrell', 'Jonathan', ''], ['Vineet', 'Vibhav', ''], ['Sturgess', 'Paul', ''], ['Crook', 'Nigel', ''], ['Mitra', 'Niloy', ''], ['Torr', 'Philip', '']]","['object class segmentation', 'semantic attributes', 'multilabel CRF', 'image parsing', 'speech interface']"
3060,1610.00468,Stefano Ferretti,Stefano Ferretti,On the Modeling of Musical Solos as Complex Networks,"to appear in Information Science, Elsevier. Please cite the paper
  including such information. arXiv admin note: text overlap with
  arXiv:1603.04979",,10.1016/j.ins.2016.10.007,,cs.SD cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Notes in a musical piece are building blocks employed in non-random ways to
create melodies. It is the ""interaction"" among a limited amount of notes that
allows constructing the variety of musical compositions that have been written
in centuries and within different cultures. Networks are a modeling tool that
is commonly employed to represent a set of entities interacting in some way.
Thus, notes composing a melody can be seen as nodes of a network that are
connected whenever these are played in sequence. The outcome of such a process
results in a directed graph. By using complex network theory, some main metrics
of musical graphs can be measured, which characterize the related musical
pieces. In this paper, we define a framework to represent melodies as networks.
Then, we provide an analysis on a set of guitar solos performed by main
musicians. Results of this study indicate that the presented model can have an
impact on audio and multimedia applications such as music classification,
identification, e-learning, automatic music generation, multimedia
entertainment.
","[{'version': 'v1', 'created': 'Mon, 3 Oct 2016 09:56:43 GMT'}]",2016-10-06,"[['Ferretti', 'Stefano', '']]","['Complex Networks', 'Musical Scores', 'Centrality Measures']"
3061,1511.06586,Chee Seng Chan,"Ven Jyn Kok, Mei Kuan Lim, Chee Seng Chan",Crowd Behavior Analysis: A Review where Physics meets Biology,"Accepted in Neurocomputing, 31 pages, 180 references",Neurocomputing 177 (2016) 342-362,10.1016/j.neucom.2015.11.021,,cs.CV cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although the traits emerged in a mass gathering are often non-deliberative,
the act of mass impulse may lead to irre- vocable crowd disasters. The two-fold
increase of carnage in crowd since the past two decades has spurred significant
advances in the field of computer vision, towards effective and proactive crowd
surveillance. Computer vision stud- ies related to crowd are observed to
resonate with the understanding of the emergent behavior in physics (complex
systems) and biology (animal swarm). These studies, which are inspired by
biology and physics, share surprisingly common insights, and interesting
contradictions. However, this aspect of discussion has not been fully explored.
Therefore, this survey provides the readers with a review of the
state-of-the-art methods in crowd behavior analysis from the physics and
biologically inspired perspectives. We provide insights and comprehensive
discussions for a broader understanding of the underlying prospect of blending
physics and biology studies in computer vision.
","[{'version': 'v1', 'created': 'Fri, 20 Nov 2015 13:19:44 GMT'}]",2017-11-01,"[['Kok', 'Ven Jyn', ''], ['Lim', 'Mei Kuan', ''], ['Chan', 'Chee Seng', '']]","['crowd behavior analysis', 'biologically-inspired', 'physics-inspired', 'computer vision', 'survey']"
3062,1804.08940,Dominik Fischer,"Dominik Fischer, Sanaz Mostaghim, Larissa Albantakis","How swarm size during evolution impacts the behavior, generalizability,
  and brain complexity of animats performing a spatial navigation task","10 pages, 14 figures, GECCO 2018, July 15-19, 2018, Kyoto, Japan",,10.1145/3205455.3205646,,cs.NE nlin.AO q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While it is relatively easy to imitate and evolve natural swarm behavior in
simulations, less is known about the social characteristics of simulated,
evolved swarms, such as the optimal (evolutionary) group size, why individuals
in a swarm perform certain actions, and how behavior would change in swarms of
different sizes. To address these questions, we used a genetic algorithm to
evolve animats equipped with Markov Brains in a spatial navigation task that
facilitates swarm behavior. The animats' goal was to frequently cross between
two rooms without colliding with other animats. Animats were evolved in swarms
of various sizes. We then evaluated the task performance and social behavior of
the final generation from each evolution when placed with swarms of different
sizes in order to evaluate their generalizability across conditions. According
to our experiments, we find that swarm size during evolution matters: animats
evolved in a balanced swarm developed more flexible behavior, higher fitness
across conditions, and, in addition, higher brain complexity.
","[{'version': 'v1', 'created': 'Tue, 24 Apr 2018 10:07:34 GMT'}]",2018-04-25,"[['Fischer', 'Dominik', ''], ['Mostaghim', 'Sanaz', ''], ['Albantakis', 'Larissa', '']]","['Artificial Evolution', 'Multi-Agent System', 'Markov Brains', 'SwarmIntelligence']"
3063,1901.03961,Andrew Adamatzky,"Andrew Adamatzky, Claire Fullarton, Neil Phillips, Ben De Lacy
  Costello, Thomas C. Draper","Thermal switch of oscillation frequency in Belousov-Zhabotinsky liquid
  marbles",,"R. Soc. Open Sci., 2019, 6, 190078",10.1098/rsos.190078,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  External control of oscillation dynamics in the Belousov-Zhabotinsky reaction
is important for many applications including encoding computing schemes. When
considering the BZ reaction there are limited studies dealing with thermal
cycling, particularly cooling, for external control. Recently, liquid marbles
(LMs) have been demonstrated as a means of confining the Belousov-Zhabotinsky
reaction in a system containing a solid-liquid interface. BZ LMs were prepared
by rolling 50 {\mu}l droplets in polyethylene (PE) powder. Oscillations of
electrical potential differences within the marble were recorded by inserting a
pair of electrodes through the LM powder coating into the BZ solution core.
Electrical potential differences of up to 100mV were observed with an average
period of oscillation ca. 44 s. BZ LMs were subsequently frozen to -1oC to
observe changes in the frequency of electrical potential oscillations. The
frequency of oscillations reduced upon freezing to 11mHz cf. 23mHz at ambient
temperature. The oscillation frequency of the frozen BZ LM returned to 23mHz
upon warming to ambient temperature. Several cycles of frequency fluctuations
were able to be achieved.
","[{'version': 'v1', 'created': 'Sun, 13 Jan 2019 11:38:25 GMT'}]",2019-06-21,"[['Adamatzky', 'Andrew', ''], ['Fullarton', 'Claire', ''], ['Phillips', 'Neil', ''], ['Costello', 'Ben De Lacy', ''], ['Draper', 'Thomas C.', '']]","['Belousov-Zhabotinsky reaction', 'oscillations', 'temperature-controlled', 'particle-coated droplets']"
3064,1701.06664,Katina Kralevska,"Danilo Gligoroski, Katina Kralevska, Rune E. Jensen, Per Simonsen",Repair Duality with Locally Repairable and Locally Regenerating Codes,Accepted as a full paper for publication at IEEE DataCom 2017,"2017 IEEE 15th Intl Conf on Dependable, Autonomic and Secure
  Computing, 15th Intl Conf on Pervasive Intelligence and Computing, 3rd Intl
  Conf on Big Data Intelligence and Computing and Cyber Science and Technology
  Congress(DASC/PiCom/DataCom/CyberSciTech), Orlando, FL, 2017, pp. 979-984",10.1109/DASC-PICom-DataCom-CyberSciTec.2017.162,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We construct an explicit family of locally repairable and locally
regenerating codes whose existence was proven in a recent work by Kamath et al.
about codes with local regeneration but no explicit construction was given.
This explicit family of codes is based on HashTag codes. HashTag codes are
recently defined vector codes with different vector length $\alpha$ (also
called a sub-packetization level) that achieve the optimal repair bandwidth of
MSR codes or near-optimal repair bandwidth depending on the sub-packetization
level. We applied the technique of parity-splitting code construction. We show
that the lower bound on the size of the finite field for the presented explicit
code constructions can be lower than the one given in the work of Kamath et al.
Finally, we discuss the importance of having two ways for node repair with
locally regenerating HashTag codes: repair only with local parity nodes or
repair with both local and global parity nodes. To the best of the authors'
knowledge, this is the first work where this duality in repair process is
discussed. We give a practical example and experimental results in Hadoop where
we show the benefits of having this repair duality.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2017 22:50:54 GMT'}, {'version': 'v2', 'created': 'Sat, 28 Jan 2017 11:12:27 GMT'}, {'version': 'v3', 'created': 'Sat, 22 Apr 2017 11:18:37 GMT'}, {'version': 'v4', 'created': 'Wed, 30 Aug 2017 09:29:12 GMT'}]",2020-02-14,"[['Gligoroski', 'Danilo', ''], ['Kralevska', 'Katina', ''], ['Jensen', 'Rune E.', ''], ['Simonsen', 'Per', '']]","['Vector codes', 'Repair bandwidth', 'Repair locality', 'Exact repair', 'Parity-splitting', 'Hadoop']"
3065,1207.6313,Xavier  Mestre,"Francisco Rubio, Xavier Mestre, Walid Hachem",A CLT on the SNR of Diagonally Loaded MVDR Filters,"This is a corrected version of the paper that will appear at IEEE
  Transactions on Signal Processing September 2012",,10.1109/TSP.2012.2197396,,cs.IT math.IT math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies the fluctuations of the signal-to-noise ratio (SNR) of
minimum variance distorsionless response (MVDR) filters implementing diagonal
loading in the estimation of the covariance matrix. Previous results in the
signal processing literature are generalized and extended by considering both
spatially as well as temporarily correlated samples. Specifically, a central
limit theorem (CLT) is established for the fluctuations of the SNR of the
diagonally loaded MVDR filter, under both supervised and unsupervised training
settings in adaptive filtering applications. Our second-order analysis is based
on the Nash-Poincar\'e inequality and the integration by parts formula for
Gaussian functionals, as well as classical tools from statistical asymptotic
theory. Numerical evaluations validating the accuracy of the CLT confirm the
asymptotic Gaussianity of the fluctuations of the SNR of the MVDR filter.
","[{'version': 'v1', 'created': 'Thu, 26 Jul 2012 16:12:54 GMT'}]",2015-06-05,"[['Rubio', 'Francisco', ''], ['Mestre', 'Xavier', ''], ['Hachem', 'Walid', '']]","['CLT', 'SNR', 'RMT']"
3066,1404.1645,Hu Li,"Li Hu, Liu Yuan`an, Yuan Dongming, Hu Hefei, Duan Sirui",Utility Optimal Scheduling in Degree-Limited Satellite Networks,"9 pages, 4 figures. arXiv admin note: text overlap with
  arXiv:1012.1945 by other authors","Journal of Computational Information Systems, v 9, n 9, p
  3723-3731, May 1, 2013",10.12733/jcis6031,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider the problem of flow control together with power
allocation to antennas on satellite with arbitrary link states, so as to
maximize the utility function while stabilizing the network. Inspired by
Lyapunov optimization method, a Degree-Limited Scheduling Algorithm (DLSA) is
proposed with a control parameter V, which requires no stochastic knowledge of
link state. Discussion about implementation is carried out about the complexity
of DLSA and several approximation methods to reduce complexity. Analyze shows
DLSA stabilizes the network and the gap between utility function under DLSA and
the optimal value is arbitrarily close to zero on the order of O(1/V).
Simulation results verify DLSA on a simple network.
","[{'version': 'v1', 'created': 'Mon, 7 Apr 2014 02:17:31 GMT'}]",2014-04-08,"[['Hu', 'Li', ''], ['Yuan`an', 'Liu', ''], ['Dongming', 'Yuan', ''], ['Hefei', 'Hu', ''], ['Sirui', 'Duan', '']]","['Satellite Networks', 'Utility Optimization', 'Lyapunov Drift']"
3067,1501.01075,Omar Abuzaghleh,"Omar Abuzaghleh, Miad Faezipour and Buket D. Barkana","Skincure: An Innovative Smart Phone-Based Application To Assist In
  Melanoma Early Detection And Prevention","appears in Signal & Image Processing : An International Journal
  (SIPIJ) Vol.5, No.6, December 2014",,10.5121/sipij.2014.5601,,cs.CV cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Melanoma spreads through metastasis, and therefore it has been proven to be
very fatal. Statistical evidence has revealed that the majority of deaths
resulting from skin cancer are as a result of melanoma. Further investigations
have shown that the survival rates in patients depend on the stage of the
infection; early detection and intervention of melanoma implicates higher
chances of cure. Clinical diagnosis and prognosis of melanoma is challenging
since the processes are prone to misdiagnosis and inaccuracies due to doctors
subjectivity. This paper proposes an innovative and fully functional
smart-phone based application to assist in melanoma early detection and
prevention. The application has two major components; the first component is a
real-time alert to help users prevent skin burn caused by sunlight; a novel
equation to compute the time for skin to burn is thereby introduced. The second
component is an automated image analysis module which contains image
acquisition, hair detection and exclusion, lesion segmentation, feature
extraction, and classification. The proposed system exploits PH2 Dermoscopy
image database from Pedro Hispano Hospital for development and testing
purposes. The image database contains a total of 200 dermoscopy images of
lesions, including normal, atypical, and melanoma cases. The experimental
results show that the proposed system is efficient, achieving classification of
the normal, atypical and melanoma images with accuracy of 96.3%, 95.7% and
97.5%, respectively.
","[{'version': 'v1', 'created': 'Tue, 6 Jan 2015 04:19:55 GMT'}]",2015-01-07,"[['Abuzaghleh', 'Omar', ''], ['Faezipour', 'Miad', ''], ['Barkana', 'Buket D.', '']]","['Image Segmentation', 'Skin cancer', 'Melanoma']"
3068,1504.02856,Arabinda Dash,Arabinda Dash and Sujaya Kumar Sathua,High Density Noise Removal by Cascading Algorithms,"6 pages, 6 figures",,10.1109/ACCT.2015.100,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An advanced non-linear cascading filter algorithm for the removal of high
density salt and pepper noise from the digital images is proposed. The proposed
method consists of two stages. The first stage Decision base Median Filter
(DMF) acts as the preliminary noise removal algorithm. The second stage is
either Modified Decision Base Partial Trimmed Global Mean Filter (MDBPTGMF) or
Modified Decision Based Unsymmetric Trimmed Median Filter (MDBUTMF) which is
used to remove the remaining noise and enhance the image quality. The DMF
algorithm performs well at low noise density but it fails to remove the noise
at medium and high level. The MDBPTGMF and MDUTMF have excellent performance at
low, medium and high noise density but these reduce the image quality and blur
the image at high noise level. So the basic idea behind this paper is to
combine the advantages of the filters used in both the stages to remove the
Salt and Pepper noise and enhance the image quality at all the noise density
level. The proposed method is tested against different gray scale images and it
gives better Mean Absolute Error (MAE), Peak Signal to Noise Ratio (PSNR) and
Image Enhancement Factor (IEF) than the Adaptive Median Filter (AMF), Decision
Base Unsymmetric Trimmed Median Filter (DBUTMF), Modified Decision Base
Unsymmetric Trimmed Median Filter (MDBUTMF) and Decision Base Partial Trimmed
Global Mean Filter (DBPTGMF).
","[{'version': 'v1', 'created': 'Sat, 11 Apr 2015 10:21:56 GMT'}]",2015-04-14,"[['Dash', 'Arabinda', ''], ['Sathua', 'Sujaya Kumar', '']]","['Salt and Pepper noise', 'Unsymmetric trimmed Mean Filter', 'Unsymmetric Trimmed Median Filter']"
3069,1804.09360,Hamid Hosseinianfar,"Hamid Hosseinianfar, Maite Brandt-Pearce","Analysis of Indoor Uplink Optical Communication Positioning System
  Exploiting Multipath Reflections","9 pages, 13 figures",,10.1109/JPHOT.2020.2991472,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce an uplink optical wireless positioning system for
indoor applications. This technique uses fingerprints based on the indoor
optical wireless channel impulse response for localization. Exploiting the line
of sight peak power (LOS), the second power peak (SPP) of the impulse response,
and the delay between the LOS and SPP, we present a proof of concept design and
theoretical analysis for localization employing a single fixed reference point,
i.e., a photodetector (PD) on the ceiling. Adding more PDs leads to more
accurate transmitter position estimation. As a benchmark, we present analytical
expressions of the Cramer-Rao lower bound (CRLB) for different numbers of PDs
and features. We further present closed form analytical approximations for the
chosen features of the channel impulse response. Simulation results show a root
mean square (RMS) positioning accuracy of 25\,cm and 5\,cm for one and four
PDs, respectively, for a typical indoor room at high SNR. Numerical results
verify that the derived analytic approximations closely match the simulations.
","[{'version': 'v1', 'created': 'Wed, 25 Apr 2018 06:00:51 GMT'}]",2020-05-06,"[['Hosseinianfar', 'Hamid', ''], ['Brandt-Pearce', 'Maite', '']]","['Visible light communication (VLC)', 'Cramer-Raolower bound (CRLB)', 'indoor localization', 'visible light positioning', 'multipath reflections']"
3070,1806.09230,Soochahn Lee Dr,"Kyoung Jin Noh, Sang Jun Park, Soochahn Lee","Scale Space Approximation in Convolutional Neural Networks for Retinal
  Vessel Segmentation","10 pages, 7 figures","Computer Methods and Programs in Biomedicine, Volume 178,
  September 2019, Pages 237-246",10.1016/j.cmpb.2019.06.030Get,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Retinal images have the highest resolution and clarity among medical images.
Thus, vessel analysis in retinal images may facilitate early diagnosis and
treatment of many chronic diseases. In this paper, we propose a novel
multi-scale residual convolutional neural network structure based on a
\emph{scale-space approximation (SSA)} block of layers, comprising subsampling
and subsequent upsampling, for multi-scale representation. Through analysis in
the frequency domain, we show that this block structure is a close
approximation of Gaussian filtering, the operation to achieve scale variations
in scale-space theory. Experimental evaluations demonstrate that the proposed
network outperforms current state-of-the-art methods. Ablative analysis shows
that the SSA is indeed an important factor in performance improvement.
","[{'version': 'v1', 'created': 'Sun, 24 Jun 2018 23:11:54 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Oct 2018 08:09:52 GMT'}]",2021-05-07,"[['Noh', 'Kyoung Jin', ''], ['Park', 'Sang Jun', ''], ['Lee', 'Soochahn', '']]","['retinal images', 'vessel segmentation', 'convolutional neuralnetworks', 'multi-scale representation', 'scale-space approximation', 'residualnetworks']"
3071,1807.06734,Michael Green,"Michael Cerny Green, Ahmed Khalifa, Gabriella A.B. Barros, Andy
  Nealen, Julian Togelius",Generating Levels That Teach Mechanics,"8 pages, 7 figures, PCG Workshop at FDG 2018, 9th International
  Workshop on Procedural Content Generation (PCG2018)",,10.1145/3235765.3235820,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The automatic generation of game tutorials is a challenging AI problem. While
it is possible to generate annotations and instructions that explain to the
player how the game is played, this paper focuses on generating a gameplay
experience that introduces the player to a game mechanic. It evolves small
levels for the Mario AI Framework that can only be beaten by an agent that
knows how to perform specific actions in the game. It uses variations of a
perfect A* agent that are limited in various ways, such as not being able to
jump high or see enemies, to test how failing to do certain actions can stop
the player from beating the level.
","[{'version': 'v1', 'created': 'Wed, 18 Jul 2018 01:47:47 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Sep 2018 21:52:23 GMT'}, {'version': 'v3', 'created': 'Fri, 28 Sep 2018 15:30:52 GMT'}, {'version': 'v4', 'created': 'Mon, 1 Oct 2018 16:15:18 GMT'}]",2018-10-02,"[['Green', 'Michael Cerny', ''], ['Khalifa', 'Ahmed', ''], ['Barros', 'Gabriella A. B.', ''], ['Nealen', 'Andy', ''], ['Togelius', 'Julian', '']]","['Super Mario Bros', 'Search Based Level Generation', 'Feasible Infeasible 2-Population']"
3072,1708.06524,Muaz Niazi,"Amir Hussain, Muaz A. Niazi","Towards a Formal, Visual Framework of Emergent Cognitive Development of
  Scholars","24 pages, 8 figures",Cognitive Computation 6.1 (2014): 113-124,10.1007/s12559-013-9219-y,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding the cognitive evolution of researchers as they progress in the
academia is an important but complex problem, a problem belonging to a class of
problems, which often require the development of models for gaining further
understanding in the intricacies of the domain. The research question that we
address in this paper is how to effectively model this temporal cognitive
mental development of prolific researchers. Our proposed solution to this
problem is based on noting that the academic progression and notability of a
researcher are linked with a progressive increase in the citation count for the
scholar's refereed publications quantified using indices such as the Hirsch
index. In other words, we propose the use of yearly cognitive increment of a
scholar's cognition to be quantifiable using a function of the scholar's
citation index, thereby considering the index as an indicator of the discrete
approximation of the scholar's cognitive development. Using validated
agent-based modeling, a paradigm presented as part of our previous work i.e.
Cognitive Agent-based Computing framework, we present both formal as well as
visual agent-based complex network representations for this cognitive evolution
in the form of a Temporal Cognitive Level Network (TCLN) model. As a proof of
the effectiveness of this approach, we demonstrate validation of the model
using historic data of citations.
","[{'version': 'v1', 'created': 'Tue, 22 Aug 2017 07:47:12 GMT'}]",2017-08-23,"[['Hussain', 'Amir', ''], ['Niazi', 'Muaz A.', '']]","['Agent-based Modeling', 'Cognitive Development', 'Cognitive Agent-based Computing', 'Complex Adaptive System', 'Hirsch Index', 'Complex Networks']"
3073,0910.4668,Damien Robert,"Jean-Charles Faug\`ere (INRIA Rocquencourt), David Lubicz (IRMAR),
  Damien Robert (INRIA Lorraine - LORIA)",Computing modular correspondences for abelian varieties,,,10.1016/j.jalgebra.2011.06.031,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of this paper is to give a higher dimensional equivalent of the
classical modular polynomials $\Phi_\ell(X,Y)$. If $j$ is the $j$-invariant
associated to an elliptic curve $E_k$ over a field $k$ then the roots of
$\Phi_\ell(j,X)$ correspond to the $j$-invariants of the curves which are
$\ell$-isogeneous to $E_k$. Denote by $X_0(N)$ the modular curve which
parametrizes the set of elliptic curves together with a $N$-torsion subgroup.
It is possible to interpret $\Phi_\ell(X,Y)$ as an equation cutting out the
image of a certain modular correspondence $X_0(\ell) \to X_0(1) \times X_0(1)$
in the product $X_0(1) \times X_0(1)$. Let $g$ be a positive integer and
$\overn \in \N^g$. We are interested in the moduli space that we denote by
$\Mn$ of abelian varieties of dimension $g$ over a field $k$ together with an
ample symmetric line bundle $\pol$ and a symmetric theta structure of type
$\overn$. If $\ell$ is a prime and let $\overl=(\ell, ..., \ell)$, there exists
a modular correspondence $\Mln \to \Mn \times \Mn$. We give a system of
algebraic equations defining the image of this modular correspondence.
","[{'version': 'v1', 'created': 'Sat, 24 Oct 2009 17:34:54 GMT'}]",2012-08-13,"[['Faugère', 'Jean-Charles', '', 'INRIA Rocquencourt'], ['Lubicz', 'David', '', 'IRMAR'], ['Robert', 'Damien', '', 'INRIA Lorraine - LORIA']]","['Abelian varieties', 'Theta functions', 'Isogenies', 'Modular correspondences']"
3074,1003.5325,Bruno Goncalves,"Mark Meiss, John Duncan, Bruno Gon\c{c}alves, Jos\'e J. Ramasco,
  Filippo Menczer",What's in a Session: Tracking Individual Behavior on the Web,"10 pages, 13 figures, 1 table","Proceedings of the 20th ACM conference on Hypertext and
  hypermedia, 173-182 (2009)",10.1145/1557914.1557946,,cs.HC cs.MA physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We examine the properties of all HTTP requests generated by a thousand
undergraduates over a span of two months. Preserving user identity in the data
set allows us to discover novel properties of Web traffic that directly affect
models of hypertext navigation. We find that the popularity of Web sites -- the
number of users who contribute to their traffic -- lacks any intrinsic mean and
may be unbounded. Further, many aspects of the browsing behavior of individual
users can be approximated by log-normal distributions even though their
aggregate behavior is scale-free. Finally, we show that users' click streams
cannot be cleanly segmented into sessions using timeouts, affecting any attempt
to model hypertext navigation using statistics of individual sessions. We
propose a strictly logical definition of sessions based on browsing activity as
revealed by referrer URLs; a user may have several active sessions in their
click stream at any one time. We demonstrate that applying a timeout to these
logical sessions affects their statistics to a lesser extent than a purely
timeout-based mechanism.
","[{'version': 'v1', 'created': 'Sat, 27 Mar 2010 21:53:25 GMT'}]",2010-03-30,"[['Meiss', 'Mark', ''], ['Duncan', 'John', ''], ['Gonçalves', 'Bruno', ''], ['Ramasco', 'José J.', ''], ['Menczer', 'Filippo', '']]","['Web traffic', 'Web session', 'popularity', 'navigation', 'click stream']"
3075,1111.2422,Mohammad  Zaidul Karim,"Mohammad Zaidul Karim, Nargis Akter","Optimum Partition Parameter of Divide-and-Conquer Algorithm for Solving
  Closest-Pair Problem",arXiv admin note: substantial text overlap with arXiv:1010.5908,"International Journal of Computer Science & Information Technology
  (IJCSIT) Vol 3, No 5, 2011, 211-219",10.5121/ijcsit.2011.3519,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Divide and Conquer is a well known algorithmic procedure for solving many
kinds of problem. In this procedure, the problem is partitioned into two parts
until the problem is trivially solvable. Finding the distance of the closest
pair is an interesting topic in computer science. With divide and conquer
algorithm we can solve closest pair problem. Here also the problem is
partitioned into two parts until the problem is trivially solvable. But it is
theoretically and practically observed that sometimes partitioning the problem
space into more than two parts can give better performances. In this paper, a
new proposal is given that dividing the problem space into (n) number of parts
can give better result while divide and conquer algorithm is used for solving
the closest pair of point's problem.
","[{'version': 'v1', 'created': 'Thu, 10 Nov 2011 08:49:05 GMT'}]",2011-11-11,"[['Karim', 'Mohammad Zaidul', ''], ['Akter', 'Nargis', '']]","['Divide and conquer', 'Closest pair problem', 'Optimum parameter']"
3076,1812.00715,Sayan Putatunda PhD,Sayan Putatunda,"Care2Vec: A Deep learning approach for the classification of self-care
  problems in physically disabled children","14 pages, 1 figure, submitted to a journal. Added References in the
  new version","Putatunda, S. Care2Vec: a hybrid autoencoder-based approach for
  the classification of self-care problems in physically disabled children.
  Neural Comput & Applic (2020). https://doi.org/10.1007/s00521-020-04943-2",10.1007/s00521-020-04943-2,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate classification of self-care problems in children who suffer from
physical and motor affliction is an important problem in the healthcare
industry. This is a difficult and a time consumming process and it needs the
expertise of occupational therapists. In recent years, healthcare professionals
have opened up to the idea of using expert systems and artificial intelligence
in the diagnosis and classification of self care problems. In this study, we
propose a new deep learning based approach named Care2Vec for solving these
kind of problems and use a real world self care activities dataset that is
based on a conceptual framework designed by the World Health Organization
(WHO). Care2Vec is a mix of unsupervised and supervised learning where we use
Autoencoders and Deep neural networks as a two step modeling process. We found
that Care2Vec has a better prediction accuracy than some of the traditional
methods reported in the literature for solving the self care classification
problem viz. Decision trees and Artificial neural networks.
","[{'version': 'v1', 'created': 'Mon, 3 Dec 2018 12:59:28 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Dec 2019 05:28:42 GMT'}]",2020-05-26,"[['Putatunda', 'Sayan', '']]","['Deep Learning', 'Disability', 'ICF-CY', 'Medical Informatics', 'SCADI', 'Self-Care']"
3077,1901.04832,Zeliang Liu,"Zeliang Liu, C.T. Wu","Exploring the 3D architectures of deep material network in data-driven
  multiscale mechanics","35 pages, 25 figures",,10.1016/j.jmps.2019.03.004,,cs.CE cond-mat.mtrl-sci cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper extends the deep material network (DMN) proposed by Liu et al.
(2019) to tackle general 3-dimensional (3D) problems with arbitrary material
and geometric nonlinearities. It discovers a new way of describing multiscale
heterogeneous materials by a multi-layer network structure and mechanistic
building blocks. The data-driven framework of DMN is discussed in detail about
the offline training and online extrapolation stages. Analytical solutions of
the 3D building block with a two-layer structure in both small- and
finite-strain formulations are derived based on interfacial equilibrium
conditions and kinematic constraints. With linear elastic data generated by
direct numerical simulations on a representative volume element (RVE), the
network can be effectively trained in the offline stage using stochastic
gradient descent and advanced model compression algorithms. Efficiency and
accuracy of DMN on addressing the long-standing 3D RVE challenges with complex
morphologies and material laws are validated through numerical experiments,
including 1) hyperelastic particle-reinforced rubber composite with Mullins
effect; 2) polycrystalline materials with rate-dependent crystal plasticity; 3)
carbon fiber reinforced polymer (CFRP) composites with fiber anisotropic
elasticity and matrix plasticity. In particular, we demonstrate a three-scale
homogenization procedure of CFRP system by concatenating the microscale and
mesoscale material networks. The complete learning and extrapolation procedures
of DMN establish a reliable data-driven framework for multiscale material
modeling and design.
","[{'version': 'v1', 'created': 'Wed, 2 Jan 2019 18:21:38 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Mar 2019 22:43:12 GMT'}, {'version': 'v3', 'created': 'Sun, 5 Jul 2020 22:30:16 GMT'}]",2020-07-07,"[['Liu', 'Zeliang', ''], ['Wu', 'C. T.', '']]","['Machine learning', '3D building-block', 'hyperelasticity', 'crystal plasticity', 'CFRP composites', 'three-scale homogenization']"
3078,1603.00812,Chaomei Chen,Chaomei Chen,Grand Challenges in Measuring and Characterizing Scholarly Impact,6 pages,Front. Res. Metr. Anal 1:4 (2016),10.3389/frma.2016.00004,,cs.DL cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The constantly growing body of scholarly knowledge of science, technology,
and humanities is an asset of the mankind. While new discoveries expand the
existing knowledge, they may simultaneously render some of it obsolete. It is
crucial for scientists and other stakeholders to keep their knowledge up to
date. Policy makers, decision makers, and the general public also need an
efficient communication of scientific knowledge. Several grand challenges
concerning the creation, adaptation, and diffusion of scholarly knowledge, and
advance quantitative and qualitative approaches to the study of scholarly
knowledge are identified.
","[{'version': 'v1', 'created': 'Wed, 2 Mar 2016 18:03:55 GMT'}]",2017-10-24,"[['Chen', 'Chaomei', '']]","['scholarly metrics', 'research assessment', 'scientometrics', 'scholarly communication', 'science and technology studies']"
3079,1208.6428,Jalil Boukhobza,"Pierre Olivier (Lab-STICC), Jalil Boukhobza (Lab-STICC)","A Hardware Time Manager Implementation for the Xenomai Real-Time Kernel
  of Embedded Linux","Embed With Linux (EWiLi) workshop, Lorient : France (2012)","ACM SIGBED Review 9(2) 38-42 9, 2 (2012) 38-42",,,cs.OS cs.AR cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, the use of embedded operating systems in different embedded
projects is subject to a tremendous growth. Embedded Linux is becoming one of
those most popular EOSs due to its modularity, efficiency, reliability, and
cost. One way to make it hard real-time is to include a real-time kernel like
Xenomai. One of the key characteristics of a Real-Time Operating System (RTOS)
is its ability to meet execution time deadlines deterministically. So, the more
precise and flexible the time management can be, the better it can handle
efficiently the determinism for different embedded applications. RTOS time
precision is characterized by a specific periodic interrupt service controlled
by a software time manager. The smaller the period of the interrupt, the better
the precision of the RTOS, the more it overloads the CPU, and though reduces
the overall efficiency of the RTOS. In this paper, we propose to drastically
reduce these overheads by migrating the time management service of Xenomai into
a configurable hardware component to relieve the CPU. The hardware component is
implemented in a Field Programmable Gate Array coupled to the CPU. This work
was achieved in a Master degree project where students could apprehend many
fields of embedded systems: RTOS programming, hardware design, performance
evaluation, etc.
","[{'version': 'v1', 'created': 'Fri, 31 Aug 2012 09:04:05 GMT'}]",2013-12-17,"[['Olivier', 'Pierre', '', 'Lab-STICC'], ['Boukhobza', 'Jalil', '', 'Lab-STICC']]","['Real-Time Operating Systems', 'Embedded Linux', 'Reconfigurable Architectures', 'FPGA', 'Embedded Systems']"
3080,1808.02144,Bogdan Chlebus,"Bogdan S. Chlebus and Vicent Cholvi and Pawel Garncarek and Tomasz
  Jurdzinski and Dariusz R. Kowalski",Routing in Wireless Networks with Interferences,,"Routing in Wireless Networks with Interferences. IEEE
  Communications Letters, 21(9) : 2105 - 2108, 2017",10.1109/LCOMM.2017.2716348,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider dynamic routing in multi-hop wireless networks with adversarial
traffic. The model of wireless communication incorporates interferences caused
by packets' arrivals into the same node that overlap in time. We consider two
classes of adversaries: balanced and unbalanced. We demonstrate that, for each
routing algorithm and an unbalanced adversary, the algorithm is unstable
against this adversary in some networks. We develop a routing algorithm that
has bounded packet latency against each balanced adversary.
","[{'version': 'v1', 'created': 'Mon, 6 Aug 2018 22:50:48 GMT'}]",2018-08-08,"[['Chlebus', 'Bogdan S.', ''], ['Cholvi', 'Vicent', ''], ['Garncarek', 'Pawel', ''], ['Jurdzinski', 'Tomasz', ''], ['Kowalski', 'Dariusz R.', '']]","['Wireless network', 'routing', 'adversarial queuing', 'interference', 'queue size', 'packetlatency']"
3081,1904.02291,Rohit Agrawal,Rohit Agrawal,Finite-Sample Concentration of the Multinomial in Relative Entropy,,"IEEE Trans. Inform. Theory 66(10):6297-6302, 2020",10.1109/TIT.2020.2996134,,cs.IT math.IT math.PR math.ST stat.TH,http://creativecommons.org/licenses/by/4.0/,"  We show that the moment generating function of the Kullback-Leibler
divergence (relative entropy) between the empirical distribution of $n$
independent samples from a distribution $P$ over a finite alphabet of size $k$
(i.e. a multinomial distribution) and $P$ itself is no more than that of a
gamma distribution with shape $k - 1$ and rate $n$. The resulting exponential
concentration inequality becomes meaningful (less than 1) when the divergence
$\varepsilon$ is larger than $(k-1)/n$, whereas the standard method of types
bound requires $\varepsilon > \frac{1}{n} \cdot \log{\binom{n+k-1}{k-1}} \geq
(k-1)/n \cdot \log(1 + n/(k-1))$, thus saving a factor of order $\log(n/k)$ in
the standard regime of parameters where $n\gg k$. As a consequence, we also
obtain finite-sample bounds on all the moments of the empirical divergence
(equivalently, the discrete likelihood-ratio statistic), which are within
constant factors (depending on the moment) of their asymptotic values. Our
proof proceeds via a simple reduction to the case $k = 2$ of a binary alphabet
(i.e. a binomial distribution), and has the property that improvements in the
case of $k = 2$ directly translate to improvements for general $k$. In
particular, we conjecture a bound on the binomial moment generating function
that would almost close the quadratic gap between our finite-sample bound and
the asymptotic moment generating function bound from Wilks' theorem (which does
not hold for finite samples).
","[{'version': 'v1', 'created': 'Thu, 4 Apr 2019 01:03:19 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Oct 2019 16:25:55 GMT'}, {'version': 'v3', 'created': 'Tue, 21 Apr 2020 17:43:27 GMT'}, {'version': 'v4', 'created': 'Mon, 5 Oct 2020 01:07:04 GMT'}]",2020-10-06,"[['Agrawal', 'Rohit', '']]","['Concentration inequalities', 'empirical distributions', 'Kullback–Leibler divergence', 'likelihood-ratio test', 'binomial tail bounds']"
3082,1005.1734,Secretary Aircc Journal,"Stanislav Nonchev and Mikko Valkama (Tampere University of Technology,
  Finland)","Advanced Radio Resource Management for Multi Antenna Packet Radio
  Systems","14 Pages, IJWMN","International Journal of Wireless & Mobile Networks 2.2 (2010)
  1-14",10.5121/ijwmn.2010.2201,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper, we propose fairness-oriented packet scheduling (PS) schemes
with power-efficient control mechanism for future packet radio systems. In
general, the radio resource management functionality plays an important role in
new OFDMA based networks. The control of the network resource division among
the users is performed by packet scheduling functionality based on maximizing
cell coverage and capacity satisfying, and certain quality of service
requirements. Moreover, multiantenna transmit-receive schemes provide
additional flexibility to packet scheduler functionality. In order to mitigate
inter-cell and co-channel interference problems in OFDMA cellular networks soft
frequency reuse with different power masks patterns is used. Stemming from the
earlier enhanced proportional fair scheduler studies for single-input
multiple-output (SIMO) and multiple-input multipleoutput (MIMO) systems, we
extend the development of efficient packet scheduling algorithms by adding
transmit power considerations in the overall priority metrics calculations and
scheduling decisions. Furthermore, we evaluate the proposed scheduling schemes
by simulating practical orthogonal frequency division multiple access (OFDMA)
based packet radio system in terms of throughput, coverage and fairness
distribution among users. As a concrete example, under reduced overall transmit
power constraint and unequal power distribution for different sub-bands, we
demonstrate that by using the proposed power-aware multi-user scheduling
schemes, significant coverage and fairness improvements in the order of 70% and
20%, respectively, can be obtained, at the expense of average throughput loss
of only 15%.
","[{'version': 'v1', 'created': 'Tue, 11 May 2010 07:41:02 GMT'}]",2010-07-15,"[['Nonchev', 'Stanislav', '', 'Tampere University of Technology,\n  Finland'], ['Valkama', 'Mikko', '', 'Tampere University of Technology,\n  Finland']]","['Radio Resource Management', 'Packet Scheduling', 'Soft Frequency Reuse', 'Proportional-fair', 'Power Masks', 'Channel Quality Feedback', 'Fairness', 'Throughput']"
3083,1207.6692,Stanislav Zivny,"David A. Cohen, Martin C. Cooper, Paidi Creed, Peter G. Jeavons,
  Stanislav Zivny",An Algebraic Theory of Complexity for Discrete Optimisation,"26 pages, full version of three conference papers: CP'06, MFCS'11,
  and CP'11",SIAM Journal on Computing 42(5) 1915-1939 (2013),10.1137/130906398,,cs.CC cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Discrete optimisation problems arise in many different areas and are studied
under many different names. In many such problems the quantity to be optimised
can be expressed as a sum of functions of a restricted form. Here we present a
unifying theory of complexity for problems of this kind. We show that the
complexity of a finite-domain discrete optimisation problem is determined by
certain algebraic properties of the objective function, which we call weighted
polymorphisms. We define a Galois connection between sets of rational-valued
functions and sets of weighted polymorphisms and show how the closed sets of
this Galois connection can be characterised.
  These results provide a new approach to studying the complexity of discrete
optimisation. We use this approach to identify certain maximal tractable
subproblems of the general problem, and hence derive a complete classification
of complexity for the Boolean case.
","[{'version': 'v1', 'created': 'Sat, 28 Jul 2012 09:01:36 GMT'}]",2015-03-20,"[['Cohen', 'David A.', ''], ['Cooper', 'Martin C.', ''], ['Creed', 'Paidi', ''], ['Jeavons', 'Peter G.', ''], ['Zivny', 'Stanislav', '']]","['Galois connection', 'valued constraint satisfaction problems', 'constraint optimisation', 'weightedpolymorphisms', 'weighted clones', 'complexity']"
3084,1803.01207,Alexey Shvets,"Alexey Shvets, Alexander Rakhlin, Alexandr A. Kalinin, and Vladimir
  Iglovikov","Automatic Instrument Segmentation in Robot-Assisted Surgery Using Deep
  Learning","9 pages, 3 figures. arXiv admin note: substantial text overlap with
  arXiv:1804.08024","2018 17th IEEE International Conference on Machine Learning and
  Applications (ICMLA)",10.1109/ICMLA.2018.00100,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Semantic segmentation of robotic instruments is an important problem for the
robot-assisted surgery. One of the main challenges is to correctly detect an
instrument's position for the tracking and pose estimation in the vicinity of
surgical scenes. Accurate pixel-wise instrument segmentation is needed to
address this challenge. In this paper we describe our winning solution for
MICCAI 2017 Endoscopic Vision SubChallenge: Robotic Instrument Segmentation.
Our approach demonstrates an improvement over the state-of-the-art results
using several novel deep neural network architectures. It addressed the binary
segmentation problem, where every pixel in an image is labeled as an instrument
or background from the surgery video feed. In addition, we solve a multi-class
segmentation problem, where we distinguish different instruments or different
parts of an instrument from the background. In this setting, our approach
outperforms other methods in every task subcategory for automatic instrument
segmentation thereby providing state-of-the-art solution for this problem. The
source code for our solution is made publicly available at
https://github.com/ternaus/robot-surgery-segmentation
","[{'version': 'v1', 'created': 'Sat, 3 Mar 2018 17:41:55 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Jun 2018 19:50:47 GMT'}]",2019-01-23,"[['Shvets', 'Alexey', ''], ['Rakhlin', 'Alexander', ''], ['Kalinin', 'Alexandr A.', ''], ['Iglovikov', 'Vladimir', '']]","['Medical imaging', 'Robot-assisted surgery', 'Computer vision', 'Imagesegmentation', 'Deep learning']"
3085,1201.5009,Perry Nicolas,"Nicolas Perry (LGM2B), Samar Ammar-Khodja (IRCCyN)",A Knowledge Engineering Method for New Product Development,,"Journal of Decision Systems 19, 1 (2010) pp.117-133",10.3166/jds.19.117-133,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Engineering activities involve large groups of people from different domains
and disciplines. They often generate important information flows that are
difficult to manage. To face these difficulties, a knowledge engineering
process is necessary to structure the information and its use. This paper
presents a deployment of a knowledge capitalization process based on the
enrichment of MOKA methodology to support the integration of Process Planning
knowledge in a CAD System. Our goal is to help different actors to work
collaboratively by proposing one referential view of the domain, the context
and the objectives assuming that it will help them in better decision-making.
","[{'version': 'v1', 'created': 'Sun, 22 Jan 2012 17:03:18 GMT'}]",2012-01-25,"[['Perry', 'Nicolas', '', 'LGM2B'], ['Ammar-Khodja', 'Samar', '', 'IRCCyN']]","['Knowledge-based Engineering', 'Knowledge Processing', 'Capitalization', 'MOKA']"
3086,1412.7818,Sunil Jadav,"Sunil Jadav, Munish Vashistah, Rajeevan Chandel","Carbon Nanotube Based Delay Model For High Speed Energy Efficient on
  Chip Data Transmission Using: Current Mode Technique","12 Figures, appears in Electrical and Electronics Engineering: An
  International Journal, November 2014",,10.14810/elelij.2014.3404,,cs.ET,http://creativecommons.org/licenses/publicdomain/,"  Speed is a major concern for high density VLSI networks. In this paper the
closed form delay model for current mode signalling in VLSI interconnects has
been proposed with resistive load termination. RLC interconnect line is
modelled using characteristic impedance of transmission line and inductive
effect. The inductive effect is dominant at lower technology node is modelled
into an equivalent resistance. In this model first order transfer function is
designed using finite difference equation, and by applying the boundary
conditions at the source and load termination. It has been observed that the
dominant pole determines system response and delay in the proposed model. Using
CNIA tool (carbon nanotube interconnect analyzer) the interconnect line
parameters has been estimated at 45nm technology node. The novel proposed
current mode model superiority has been validated for CNT type of material. It
superiority factor remains to 66.66% as compared to voltage mode signalling.
And current mode dissipates 0.015pJ energy where as VM consume 0.045pJ for a
single bit transmission across the interconnect over CNT material. Secondly the
damping factor of a lumped RLC circuit is shown to be a useful figure of merit.
","[{'version': 'v1', 'created': 'Thu, 25 Dec 2014 12:39:55 GMT'}]",2014-12-30,"[['Jadav', 'Sunil', ''], ['Vashistah', 'Munish', ''], ['Chandel', 'Rajeevan', '']]","['Current Mode', 'Voltage Mode', 'Equivalent resistance', 'VLSI Interconnect. CNIA', 'Nanotubes']"
3087,1203.2340,Helmi Chaouech,"Helmi Chaouech, Ridha Bouallegue",Multiuser Detection in Asynchronous Multibeam Communications,"14 pages, 6 figures","International Journal of Wireless & Mobile Networks (IJWMN),
  February 2012",10.5121/ijwmn.2012.4102,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with multi-user detection techniques in asynchronous
multibeam satellite communications. The proposed solutions are based on
successive interference cancellation architecture (SIC) and channel decoding
algorithms. The aim of these detection methods is to reduce the effect of
cochannel interference due to co-frequency access, and consequently, improves
the capacity of the mulitbeam communications systems, by improving frequency
reuse. Channel estimation allows the determination of interference
coefficients, which helps their effects compensation. The developed multiuser
detections techniques are iterative. Therefore, detection quality is improved
from a stage to another. Moreover, a signals combining method, which is
integrated into these detection solutions, enhances their capability. The
proposed solutions are evaluated through computer simulations, where an
asynchronous multibeam satellite link is considered over an AWGN channel. The
obtained simulation results showed the robustness of these multi-user detection
techniques.
","[{'version': 'v1', 'created': 'Sun, 11 Mar 2012 14:34:28 GMT'}]",2012-03-13,"[['Chaouech', 'Helmi', ''], ['Bouallegue', 'Ridha', '']]","['Mulibeam System', 'Co-Channel Interference', 'SIC', 'Channel Decoding', 'Signals Combining']"
3088,1303.1703,Fatiha Boubekeur,Fatiha Boubekeur and Wassila Azzoug,Concept-based indexing in text information retrieval,"18 pages, 5 tables, 3 figures","International Journal of Computer Science & Information Technology
  (IJCSIT) Vol 5, No 1, February 2013",10.5121/ijcsit,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional information retrieval systems rely on keywords to index documents
and queries. In such systems, documents are retrieved based on the number of
shared keywords with the query. This lexical-focused retrieval leads to
inaccurate and incomplete results when different keywords are used to describe
the documents and queries. Semantic-focused retrieval approaches attempt to
overcome this problem by relying on concepts rather than on keywords to
indexing and retrieval. The goal is to retrieve documents that are semantically
relevant to a given user query. This paper addresses this issue by proposing a
solution at the indexing level. More precisely, we propose a novel approach for
semantic indexing based on concepts identified from a linguistic resource. In
particular, our approach relies on the joint use of WordNet and WordNetDomains
lexical databases for concept identification. Furthermore, we propose a
semantic-based concept weighting scheme that relies on a novel definition of
concept centrality. The resulting system is evaluated on the TIME test
collection. Experimental results show the effectiveness of our proposition over
traditional IR approaches.
","[{'version': 'v1', 'created': 'Thu, 7 Mar 2013 14:46:17 GMT'}]",2013-03-08,"[['Boubekeur', 'Fatiha', ''], ['Azzoug', 'Wassila', '']]","['Information retrieval', 'Concept based indexing', 'concept weighting', 'Word Sense Disambiguation', 'WordNet', 'WordNetDomains']"
3089,0903.4266,Martin Burkhart,"Martin Burkhart, Daniela Brauckhoff, Martin May, Elisa Boschi",The Risk-Utility Tradeoff for IP Address Truncation,,"1st ACM Workshop on Network Data Anonymization (NDA), Fairfax,
  Virginia, USA, October, 2008",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network operators are reluctant to share traffic data due to security and
privacy concerns. Consequently, there is a lack of publicly available traces
for validating and generalizing the latest results in network and security
research. Anonymization is a possible solution in this context; however, it is
unclear how the sanitization of data preserves characteristics important for
traffic analysis. In addition, the privacy-preserving property of
state-of-the-art IP address anonymization techniques has come into question by
recent attacks that successfully identified a large number of hosts in
anonymized traces.
  In this paper, we examine the tradeoff between data utility for anomaly
detection and the risk of host identification for IP address truncation.
Specifically, we analyze three weeks of unsampled and non-anonymized network
traces from a medium-sized backbone network to assess data utility. The risk of
de-anonymizing individual IP addresses is formally evaluated, using a metric
based on conditional entropy.
  Our results indicate that truncation effectively prevents host identification
but degrades the utility of data for anomaly detection. However, the degree of
degradation depends on the metric used and whether network-internal or external
addresses are considered. Entropy metrics are more resistant to truncation than
unique counts and the detection quality of anomalies degrades much faster in
internal addresses than in external addresses. In particular, the usefulness of
internal address counts is lost even for truncation of only 4 bits whereas
utility of external address entropy is virtually unchanged even for truncation
of 20 bits.
","[{'version': 'v1', 'created': 'Wed, 25 Mar 2009 09:06:32 GMT'}]",2009-03-26,"[['Burkhart', 'Martin', ''], ['Brauckhoff', 'Daniela', ''], ['May', 'Martin', ''], ['Boschi', 'Elisa', '']]","['Privacy', 'Anonymization', 'Anomaly Detection']"
3090,1609.01648,Luca Ghiani,"Luca Ghiani, David A. Yambay, Valerio Mura, Gian Luca Marcialis, Fabio
  Roli and Stephanie A. Schuckers","Review of the Fingerprint Liveness Detection (LivDet) competition
  series: 2009 to 2015",,,10.1016/j.imavis.2016.07.002,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A spoof attack, a subset of presentation attacks, is the use of an artificial
replica of a biometric in an attempt to circumvent a biometric sensor. Liveness
detection, or presentation attack detection, distinguishes between live and
fake biometric traits and is based on the principle that additional information
can be garnered above and beyond the data procured by a standard authentication
system to determine if a biometric measure is authentic. The goals for the
Liveness Detection (LivDet) competitions are to compare software-based
fingerprint liveness detection and artifact detection algorithms (Part 1), as
well as fingerprint systems which incorporate liveness detection or artifact
detection capabilities (Part 2), using a standardized testing protocol and
large quantities of spoof and live tests. The competitions are open to all
academic and industrial institutions which have a solution for either
softwarebased or system-based fingerprint liveness detection. The LivDet
competitions have been hosted in 2009, 2011, 2013 and 2015 and have shown
themselves to provide a crucial look at the current state of the art in
liveness detection schemes. There has been a noticeable increase in the number
of participants in LivDet competitions as well as a noticeable decrease in
error rates across competitions. Participants have grown from four to the most
recent thirteen submissions for Fingerprint Part 1. Fingerprints Part 2 has
held steady at two submissions each competition in 2011 and 2013 and only one
for the 2015 edition. The continuous increase of competitors demonstrates a
growing interest in the topic.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2016 16:39:37 GMT'}]",2016-09-07,"[['Ghiani', 'Luca', ''], ['Yambay', 'David A.', ''], ['Mura', 'Valerio', ''], ['Marcialis', 'Gian Luca', ''], ['Roli', 'Fabio', ''], ['Schuckers', 'Stephanie A.', '']]","['Fingerprint', 'Liveness Detection', 'Biometric']"
3091,1403.3594,Cl\'ement Pernet,Erich L. Kaltofen and Cl\'ement Pernet,"Sparse Polynomial Interpolation Codes and their decoding beyond half the
  minimal distance","23 pages, 5 figures, In Proceedings of the International Symposium on
  Symbolic and Algebraic Computation 2014 (ISSAC'14)",,10.1145/2608628.2608660,,cs.SC cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present algorithms performing sparse univariate polynomial interpolation
with errors in the evaluations of the polynomial. Based on the initial work by
Comer, Kaltofen and Pernet [Proc. ISSAC 2012], we define the sparse polynomial
interpolation codes and state that their minimal distance is precisely the
length divided by twice the sparsity. At ISSAC 2012, we have given a decoding
algorithm for as much as half the minimal distance and a list decoding
algorithm up to the minimal distance. Our new polynomial-time list decoding
algorithm uses sub-sequences of the received evaluations indexed by a linear
progression, allowing the decoding for a larger radius, that is, more errors in
the evaluations while returning a list of candidate sparse polynomials. We
quantify this improvement for all typically small values of number of terms and
number of errors, and provide a worst case asymptotic analysis of this
improvement. For instance, for sparsity T = 5 with up to 10 errors we can list
decode in polynomial-time from 74 values of the polynomial with unknown terms,
whereas our earlier algorithm required 2T (E + 1) = 110 evaluations. We then
propose two variations of these codes in characteristic zero, where appropriate
choices of values for the variable yield a much larger minimal distance: the
length minus twice the sparsity.
","[{'version': 'v1', 'created': 'Fri, 14 Mar 2014 14:51:53 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Mar 2014 09:38:31 GMT'}, {'version': 'v3', 'created': 'Wed, 18 Jun 2014 17:16:59 GMT'}]",2014-06-19,"[['Kaltofen', 'Erich L.', ''], ['Pernet', 'Clément', '']]","['sparse polynomial interpolation', 'Blahut’s algorithm', 'Prony’salgorithm', 'exact polynomial fitting with errors']"
3092,1810.11765,Matthias Springer,"Matthias Springer, Hidehiko Masuhara","DynaSOAr: A Parallel Memory Allocator for Object-oriented Programming on
  GPUs with Efficient Memory Access",To appear in ECOOP 2019,,10.4230/LIPIcs.ECOOP.2019.16,,cs.PL,http://creativecommons.org/licenses/by/4.0/,"  Object-oriented programming has long been regarded as too inefficient for
SIMD high-performance computing, despite the fact that many important HPC
applications have an inherent object structure. On SIMD accelerators, including
GPUs, this is mainly due to performance problems with memory allocation and
memory access: There are a few libraries that support parallel memory
allocation directly on accelerator devices, but all of them suffer from
uncoalesed memory accesses.
  We discovered a broad class of object-oriented programs with many important
real-world applications that can be implemented efficiently on massively
parallel SIMD accelerators. We call this class Single-Method Multiple-Objects
(SMMO), because parallelism is expressed by running a method on all objects of
a type.
  To make fast GPU programming available to average programmers, we developed
DynaSOAr, a CUDA framework for SMMO applications. DynaSOAr consists of (1) a
fully-parallel, lock-free, dynamic memory allocator, (2) a data layout DSL and
(3) an efficient, parallel do-all operation. DynaSOAr achieves performance
superior to state-of-the-art GPU memory allocators by controlling both memory
allocation and memory access.
  DynaSOAr improves the usage of allocated memory with a Structure of Arrays
data layout and achieves low memory fragmentation through efficient management
of free and allocated memory blocks with lock-free, hierarchical bitmaps.
Contrary to other allocators, our design is heavily based on atomic operations,
trading raw (de)allocation performance for better overall application
performance. In our benchmarks, DynaSOAr achieves a speedup of application code
of up to 3x over state-of-the-art allocators. Moreover, DynaSOAr manages heap
memory more efficiently than other allocators, allowing programmers to run up
to 2x larger problem sizes with the same amount of memory.
","[{'version': 'v1', 'created': 'Sun, 28 Oct 2018 06:19:31 GMT'}, {'version': 'v2', 'created': 'Sat, 12 Jan 2019 15:53:35 GMT'}, {'version': 'v3', 'created': 'Fri, 5 Apr 2019 01:36:51 GMT'}, {'version': 'v4', 'created': 'Sun, 9 Jun 2019 04:34:35 GMT'}]",2019-06-11,"[['Springer', 'Matthias', ''], ['Masuhara', 'Hidehiko', '']]","['CUDA', 'Data Layout', 'Dynamic Memory Allocation', 'GPUs', 'Object-orientedProgramming', 'SIMD', 'Single-Instruction Multiple-Objects', 'Structure of Arrays']"
3093,2105.04760,Priyanka Nanayakkara,"Priyanka Nanayakkara, Jessica Hullman, Nicholas Diakopoulos","Unpacking the Expressed Consequences of AI Research in Broader Impact
  Statements","12 pages, AAAI/ACM Conference on Artificial Intelligence, Ethics, and
  Society (AIES) 2021; added reference and link to dataset",,10.1145/3461702.3462608,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The computer science research community and the broader public have become
increasingly aware of negative consequences of algorithmic systems. In
response, the top-tier Neural Information Processing Systems (NeurIPS)
conference for machine learning and artificial intelligence research required
that authors include a statement of broader impact to reflect on potential
positive and negative consequences of their work. We present the results of a
qualitative thematic analysis of a sample of statements written for the 2020
conference. The themes we identify broadly fall into categories related to how
consequences are expressed (e.g., valence, specificity, uncertainty), areas of
impacts expressed (e.g., bias, the environment, labor, privacy), and
researchers' recommendations for mitigating negative consequences in the
future. In light of our results, we offer perspectives on how the broader
impact statement can be implemented in future iterations to better align with
potential goals.
","[{'version': 'v1', 'created': 'Tue, 11 May 2021 02:57:39 GMT'}, {'version': 'v2', 'created': 'Sat, 22 May 2021 21:36:14 GMT'}]",2021-05-25,"[['Nanayakkara', 'Priyanka', ''], ['Hullman', 'Jessica', ''], ['Diakopoulos', 'Nicholas', '']]","['AI ethics', 'broader impacts', 'anticipatory governance', 'thematic analysis']"
3094,1111.4639,Leo Lahti,"Leo Lahti, Martin Sch\""afer, Hans-Ulrich Klein, Silvio Bicciato, and
  Martin Dugas","Cancer gene prioritization by integrative analysis of mRNA expression
  and DNA copy number data: a comparative review",PDF file including supplementary material. 9 pages. Preprint,,10.1093/bib/bbs005,,cs.CE q-bio.GN stat.AP stat.ME,http://creativecommons.org/licenses/by/3.0/,"  A variety of genome-wide profiling techniques are available to probe
complementary aspects of genome structure and function. Integrative analysis of
heterogeneous data sources can reveal higher-level interactions that cannot be
detected based on individual observations. A standard integration task in
cancer studies is to identify altered genomic regions that induce changes in
the expression of the associated genes based on joint analysis of genome-wide
gene expression and copy number profiling measurements. In this review, we
provide a comparison among various modeling procedures for integrating
genome-wide profiling data of gene copy number and transcriptional alterations
and highlight common approaches to genomic data integration. A transparent
benchmarking procedure is introduced to quantitatively compare the cancer gene
prioritization performance of the alternative methods. The benchmarking
algorithms and data sets are available at http://intcomp.r-forge.r-project.org
","[{'version': 'v1', 'created': 'Sun, 20 Nov 2011 15:23:09 GMT'}]",2012-03-23,"[['Lahti', 'Leo', ''], ['Schäfer', 'Martin', ''], ['Klein', 'Hans-Ulrich', ''], ['Bicciato', 'Silvio', ''], ['Dugas', 'Martin', '']]","['algorithms', 'cancer', 'data integration', 'DNA copy number', 'gene expression', 'microarrays']"
3095,1903.00388,Shenghua He,"Shenghua He, Kyaw Thu Minn, Lilianna Solnica-Krezel, Hua Li and Mark
  Anastasio","Automatic microscopic cell counting by use of unsupervised adversarial
  domain adaptation and supervised density regression",SPIE Medical imaging 2019 oral presentation,,10.1117/12.2513058,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate cell counting in microscopic images is important for medical
diagnoses and biological studies. However, manual cell counting is very
time-consuming, tedious, and prone to subjective errors. We propose a new
density regression-based method for automatic cell counting that reduces the
need to manually annotate experimental images. A supervised learning-based
density regression model (DRM) is trained with annotated synthetic images (the
source domain) and their corresponding ground truth density maps. A domain
adaptation model (DAM) is built to map experimental images (the target domain)
to the feature space of the source domain. By use of the unsupervised
learning-based DAM and supervised learning-based DRM, a cell density map of a
given target image can be estimated, from which the number of cells can be
counted. Results from experimental immunofluorescent microscopic images of
human embryonic stem cells demonstrate the promising performance of the
proposed counting method.
","[{'version': 'v1', 'created': 'Fri, 1 Mar 2019 16:15:56 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Mar 2019 15:23:09 GMT'}]",2019-03-25,"[['He', 'Shenghua', ''], ['Minn', 'Kyaw Thu', ''], ['Solnica-Krezel', 'Lilianna', ''], ['Li', 'Hua', ''], ['Anastasio', 'Mark', '']]","['Automatic cell counting', 'microscopic images', 'density regression', 'domain adaptation', 'supervisedlearning', 'unsupervised adversarial learning']"
3096,1607.01679,Manuel Blanco Valentin Eng.,"Manuel Blanco Valentin, Clecio Roque De Bom, Marcio Portes de
  Albuquerque, Marcelo Portes de Albuquerque, Elisangela Faria, Maury Duarte
  Correia, Rodrigo Surmas","On a method for Rock Classification using Textural Features and Genetic
  Optimization","13 pages, 3 figures, 1 appendix. Replaced to match the published
  version","Notas Tecnicas do CBPF, v.7, n.1 (2017)",10.7437/NT2236-7640/2017.01.003,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we present a method to classify a set of rock textures based on
a Spectral Analysis and the extraction of the texture Features of the resulted
images. Up to 520 features were tested using 4 different filters and all 31
different combinations were verified. The classification process relies on a
Naive Bayes classifier. We performed two kinds of optimizations: statistical
optimization with covariance-based Principal Component Analysis (PCA) and a
genetic optimization, for 10,000 randomly defined samples, achieving a final
maximum classification success of 91% against the original 70% success ratio
(without any optimization nor filters used). After the optimization 9 types of
features emerged as most relevant.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2016 15:45:21 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Aug 2017 19:16:31 GMT'}]",2017-08-21,"[['Valentin', 'Manuel Blanco', ''], ['De Bom', 'Clecio Roque', ''], ['de Albuquerque', 'Marcio Portes', ''], ['de Albuquerque', 'Marcelo Portes', ''], ['Faria', 'Elisangela', ''], ['Correia', 'Maury Duarte', ''], ['Surmas', 'Rodrigo', '']]","['Haralick Features', 'Genetic Algorithm', 'Texture Classification', 'Na¨ıve Bayes', 'Image Processing', 'Principal Component Analysis']"
3097,1807.04042,Ren\'e B{\o}dker Christensen,Ren\'e B{\o}dker Christensen and Olav Geil,On nested code pairs from the Hermitian curve,28 pages,,10.1016/j.ffa.2020.101742,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nested code pairs play a crucial role in the construction of ramp secret
sharing schemes [Kurihara et al. 2012] and in the CSS construction of quantum
codes [Ketkar et al. 2006]. The important parameters are (1) the codimension,
(2) the relative minimum distance of the codes, and (3) the relative minimum
distance of the dual set of codes. Given values for two of them, one aims at
finding a set of nested codes having parameters with these values and with the
remaining parameter being as large as possible. In this work we study nested
codes from the Hermitian curve. For not too small codimension, we present
improved constructions and provide closed formula estimates on their
performance. For small codimension we show how to choose pairs of one-point
algebraic geometric codes in such a way that one of the relative minimum
distances is larger than the corresponding non-relative minimum distance.
","[{'version': 'v1', 'created': 'Wed, 11 Jul 2018 09:50:18 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Jul 2018 06:47:51 GMT'}, {'version': 'v3', 'created': 'Wed, 2 Sep 2020 07:09:29 GMT'}]",2020-09-03,"[['Christensen', 'René Bødker', ''], ['Geil', 'Olav', '']]","['Algebraic geometric code', 'Asymmetric quantum code', 'Hermitiancurve', 'ramp secret sharing', 'relative minimum distance']"
3098,1812.04197,Haruna Isah,"Haruna Isah, Farhana Zulkernine",A Scalable and Robust Framework for Data Stream Ingestion,6 pages,,10.1109/BigData.2018.8622360,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An essential part of building a data-driven organization is the ability to
handle and process continuous streams of data to discover actionable insights.
The explosive growth of interconnected devices and the social Web has led to a
large volume of data being generated on a continuous basis. Streaming data
sources such as stock quotes, credit card transactions, trending news, traffic
conditions, time-sensitive patients data are not only very common but can
rapidly depreciate if not processed quickly. The ever-increasing volume and
highly irregular nature of data rates pose new challenges to data stream
processing systems. One such challenging but important task is how to
accurately ingest and integrate data streams from various sources and locations
into an analytics platform. These challenges demand new strategies and systems
that can offer the desired degree of scalability and robustness in handling
failures. This paper investigates the fundamental requirements and the state of
the art of existing data stream ingestion systems, propose a scalable and
fault-tolerant data stream ingestion and integration framework that can serve
as a reusable component across many feeds of structured and unstructured input
data in a given platform, and demonstrate the utility of the framework in a
real-world data stream processing case study that integrates Apache NiFi and
Kafka for processing high velocity news articles from across the globe. The
study also identifies best practices and gaps for future research in developing
large-scale data stream processing infrastructure.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2018 02:55:22 GMT'}]",2019-07-23,"[['Isah', 'Haruna', ''], ['Zulkernine', 'Farhana', '']]","['big data', 'data stream ingestion; data integration', 'dataflow management; Kafka', 'NiFi']"
3099,1402.2019,Pedro Hipola,"Amed Leiva-Mederos, Jose A. Senso, Sandor Dominguez-Velasco, Pedro
  Hipola",Authoris: a tool for authority control in the semantic web,"27 pages, 8 figures","Library Hi Tech, Vol. 31 Iss: 3, pp.536 - 553",10.1108/LHT-12-20112-0135,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose: The purpose of this paper is to propose a tool that generates
authority files to be integrated with linked data by means of learning rules.
AUTHORIS is software developed to enhance authority control and information
exchange among bibliographic and non-bibliographic entities.
  Design / methodology / approach: The article analyzes different methods
previously developed for authority control as well as IFLA and ALA standards
for managing bibliographic records. Semantic Web technologies are also
evaluated. AUTHORIS relies on Drupal and incorporates the protocols of Dublin
Core, SIOC, SKOS and FOAF. The tool has also taken into account the
obsolescence of MARC and its substitution by FRBR and RDA. Its effectiveness
was evaluated applying a learning test proposed by RDA. Over 80 percent of the
actions were carried out correctly.
  Findings: The use of learning rules and the facilities of linked data make it
easier for information organizations to reutilize products for authority
control and distribute them in a fair and efficient manner.
  Research limitations / implications: The ISAD-G records were the ones
presenting most errors. EAD was found to be second in the number of errors
produced. The rest of the formats --MARC 21, Dublin Core, FRAD, RDF, OWL, XBRL
and FOAF-- showed fewer than 20 errors in total.
  Practical implications: AUTHORIS offers institutions the means of sharing
data with a high level of stability, helping to detect records that are
duplicated and contributing to lexical disambiguation and data enrichment.
  Originality / value: The software combines the facilities of linked data, the
potency of the algorithms for converting bibliographic data, and the precision
of learning rules.
","[{'version': 'v1', 'created': 'Mon, 10 Feb 2014 02:33:03 GMT'}]",2014-02-11,"[['Leiva-Mederos', 'Amed', ''], ['Senso', 'Jose A.', ''], ['Dominguez-Velasco', 'Sandor', ''], ['Hipola', 'Pedro', '']]","['Authority control software', 'Linked data', 'Records exchange', 'Semantic Web', 'Interoperability', 'Cataloguing']"
3100,1003.5437,Secretary Aircc Journal,"K.Prasanth (1), Dr.K.Duraiswamy (2), K.Jayasudha (3) and
  Dr.C.Chandrasekar (4), ((1) K.S.Rangasamy College of Technology, India, (2)
  K.S.Rangasamy College of Technology, India, (3) K.S.R College of Engineering,
  India, (4) Periyar University, India)","Improved Packet Forwarding Approach in Vehicular Ad Hoc Networks Using
  RDGR Algorithm","14 Pages, IJNGN Journal",International Journal of Next-Generation Networks 2.1 (2010) 64-77,10.5121/ijngn.2010.2106,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks
and will play an important role in public safety communications and commercial
applications. Routing of data in VANETs is a challenging task due to rapidly
changing topology and high speed mobility of vehicles. Position based routing
protocols are becoming popular due to advancement and availability of GPS
devices. One of the critical issues of VANETs are frequent path disruptions
caused by high speed mobility of vehicle that leads to broken links which
results in low throughput and high overhead . This paper argues the use of
information on vehicles' movement information (e.g., position, direction, speed
of vehicles) to predict a possible link-breakage event prior to its occurrence.
So in this paper we propose a Reliable Directional Greedy routing (RDGR), a
reliable position based routing approach which obtains position, speed and
direction of its neighboring nodes from GPS. This approach incorporates
potential score based strategy, which calculates link stability between
neighbor nodes in distributed fashion for reliable forwarding of data packet.
","[{'version': 'v1', 'created': 'Mon, 29 Mar 2010 06:55:33 GMT'}]",2010-07-15,"[['Prasanth', 'K.', ''], ['Duraiswamy', 'Dr. K.', ''], ['Jayasudha', 'K.', ''], ['Chandrasekar', 'Dr. C.', '']]","['Vehicular Ad Hoc Networks', 'Position based routing', 'dynamic topology', 'Reliable Directional Greedy Routing', 'Revival Mobility Model.  1']"
3101,1911.12688,Giulia Orr\`u,"Giulia Orr\`u, Gian Luca Marcialis, Fabio Roli","A novel classification-selection approach for the self updating of
  template-based face recognition systems","This is an original manuscript of an article published by Elsevier in
  Pattern Recognition on 27 November 2019. Available online:
  https://doi.org/10.1016/j.patcog.2019.107121",,10.1016/j.patcog.2019.107121,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The boosting on the need of security notably increased the amount of possible
facial recognition applications, especially due to the success of the Internet
of Things (IoT) paradigm. However, although handcrafted and deep
learning-inspired facial features reached a significant level of compactness
and expressive power, the facial recognition performance still suffers from
intra-class variations such as ageing, facial expressions, lighting changes,
and pose. These variations cannot be captured in a single acquisition and
require multiple acquisitions of long duration, which are expensive and need a
high level of collaboration from the users. Among others, self-update
algorithms have been proposed in order to mitigate these problems.
Self-updating aims to add novel templates to the users' gallery among the
inputs submitted during system operations. Consequently, computational
complexity and storage space tend to be among the critical requirements of
these algorithms. The present paper deals with the above problems by a novel
template-based self-update algorithm, able to keep over time the expressive
power of a limited set of templates stored in the system database. The
rationale behind the proposed approach is in the working hypothesis that a
dominating mode characterises the features' distribution given the client.
Therefore, the key point is to select the best templates around that mode. We
propose two methods, which are tested on systems based on handcrafted features
and deep-learning-inspired autoencoders at the state-of-the-art. Three
benchmark data sets are used. Experimental results confirm that, by effective
and compact feature sets which can support our working hypothesis, the proposed
classification-selection approaches overcome the problem of manual updating
and, in case, stringent computational requirements.
","[{'version': 'v1', 'created': 'Thu, 28 Nov 2019 12:58:17 GMT'}]",2019-12-02,"[['Orrù', 'Giulia', ''], ['Marcialis', 'Gian Luca', ''], ['Roli', 'Fabio', '']]","['self-update', 'face recognition', 'adaptive systems']"
3102,1310.3381,Pinar Sen,"Pinar Sen, Tugcan Aktas, A. Ozgur Yilmaz","A Low-Complexity Graph-Based LMMSE Receiver Designed for Colored Noise
  Induced by FTN-Signaling","6 pages, 6 figures, IEEE Wireless Communications and Networking
  Conference 2014, Istanbul, Turkey",,10.1109/WCNC.2014.6952123,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a low complexity graph-based linear minimum mean square error
(LMMSE) equalizer which considers both the intersymbol interference (ISI) and
the effect of non-white noise inherent in Faster-than-Nyquist (FTN) signaling.
In order to incorporate the statistics of noise signal into the factor graph
over which the LMMSE algorithm is implemented, we suggest a method that models
it as an autoregressive (AR) process. Furthermore, we develop a new mechanism
for exchange of information between the proposed equalizer and the channel
decoder through turbo iterations. Based on these improvements, we show that the
proposed low complexity receiver structure performs close to the optimal
decoder operating in ISI-free ideal scenario without FTN signaling through
simulations.
","[{'version': 'v1', 'created': 'Sat, 12 Oct 2013 14:34:28 GMT'}, {'version': 'v2', 'created': 'Tue, 13 May 2014 08:30:11 GMT'}]",2016-11-17,"[['Sen', 'Pinar', ''], ['Aktas', 'Tugcan', ''], ['Yilmaz', 'A. Ozgur', '']]","['FTN-signaling', 'LMMSEequalization', 'colorednoise', 'AR-process modelling']"
3103,1311.4317,Mohammad Ashraful Hoque Mohammad Ashraful Hoque,"Mohammad Ashraful Hoque, Matti Siekkinen, Jukka K. Nurminen, Mika
  Aalto, Sasu Tarkoma","Mobile Multimedia Streaming Techniques : QoE and Energy Consumption
  Perspective","Accepted in Pervasive and Mobile Computing, Elsevier, May 2014",,10.1016/j.pmcj.2014.05.004,,cs.MM cs.NI,http://creativecommons.org/licenses/by/3.0/,"  Multimedia streaming to mobile devices is challenging for two reasons. First,
the way content is delivered to a client must ensure that the user does not
experience a long initial playback delay or a distorted playback in the middle
of a streaming session. Second, multimedia streaming applications are among the
most energy hungry applications in smartphones. The energy consumption mostly
depends on the delivery techniques and on the power management techniques of
wireless access technologies (Wi-Fi, 3G, and 4G). In order to provide insights
on what kind of streaming techniques exist, how they work on different mobile
platforms, their efforts in providing smooth quality of experience, and their
impact on energy consumption of mobile phones, we did a large set of active
measurements with several smartphones having both Wi-Fi and cellular network
access. Our analysis reveals five different techniques to deliver the content
to the video players. The selection of a technique depends on the mobile
platform, device, player, quality, and service. The results from our traffic
and power measurements allow us to conclude that none of the identified
techniques is optimal because they take none of the following facts into
account: access technology used, user behavior, and user preferences concerning
data waste. We point out the technique with optimal playback buffer
configuration, which provides the most attractive trade-offs in particular
situations.
","[{'version': 'v1', 'created': 'Mon, 18 Nov 2013 10:20:25 GMT'}, {'version': 'v2', 'created': 'Sat, 24 May 2014 13:46:58 GMT'}]",2014-05-27,"[['Hoque', 'Mohammad Ashraful', ''], ['Siekkinen', 'Matti', ''], ['Nurminen', 'Jukka K.', ''], ['Aalto', 'Mika', ''], ['Tarkoma', 'Sasu', '']]","['Performance analysis', 'measurement', 'power consumption', 'wireless multimedia', 'Quality of Experience (QoE)']"
3104,1812.07017,Saber Malekzadeh,"Shahla RezezadehAzar, Ali Ahmadi, Saber Malekzadeh, Maryam Samami","Instrument-Independent Dastgah Recognition of Iranian Classical Music
  Using AzarNet","Submitted to the 27th Iranian Conference on Electrical Engineering
  (ICEE 2019)",,10.13140/RG.2.2.18688.89602,,cs.SD cs.LG eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, AzarNet, a deep neural network (DNN), is proposed to
recognizing seven different Dastgahs of Iranian classical music in Maryam
Iranian classical music (MICM) dataset. Over the last years, there has been
remarkable interest in employing feature learning and DNNs which lead to
decreasing the required engineering effort. DNNs have shown better performance
in many classification tasks such as audio signal classification compares to
shallow processing architectures. Despite image data, audio data need some
preprocessing steps to extract spectra and temporal features. Some
transformations like Short-Time Fourier Transform (STFT) have been used in the
state of art researches to transform audio signals from time-domain to
time-frequency domain to extract both temporal and spectra features. In this
research, the STFT output results which are extracted features are given to
AzarNet for learning and classification processes. It is worth noting that, the
mentioned dataset contains music tracks composed with two instruments (violin
and straw). The overall f1 score of AzarNet on test set, for average of all
seven classes was 86.21% which is the best result ever reported in Dastgah
classification according to our best knowledge.
","[{'version': 'v1', 'created': 'Mon, 17 Dec 2018 19:33:27 GMT'}, {'version': 'v2', 'created': 'Mon, 31 Dec 2018 13:33:41 GMT'}, {'version': 'v3', 'created': 'Wed, 9 Jan 2019 11:26:16 GMT'}]",2019-01-10,"[['RezezadehAzar', 'Shahla', ''], ['Ahmadi', 'Ali', ''], ['Malekzadeh', 'Saber', ''], ['Samami', 'Maryam', '']]","['deep neural network', 'Short-Time Fourier Transform', 'Dastgah', 'AzarNet', 'Maryam Iranian classical music']"
3105,1912.05445,Jacek Komorowski,"Jacek Komorowski, Grzegorz Kurzejamski, Grzegorz Sarwas",FootAndBall: Integrated player and ball detector,arXiv admin note: text overlap with arXiv:1902.07304,,10.5220/0008916000470056,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper describes a deep neural network-based detector dedicated for ball
and players detection in high resolution, long shot, video recordings of soccer
matches. The detector, dubbed FootAndBall, has an efficient fully convolutional
architecture and can operate on input video stream with an arbitrary
resolution. It produces ball confidence map encoding the position of the
detected ball, player confidence map and player bounding boxes tensor encoding
players' positions and bounding boxes. The network uses Feature Pyramid Network
desing pattern, where lower level features with higher spatial resolution are
combined with higher level features with bigger receptive field. This improves
discriminability of small objects (the ball) as larger visual context around
the object of interest is taken into account for the classification. Due to its
specialized design, the network has two orders of magnitude less parameters
than a generic deep neural network-based object detector, such as SSD or YOLO.
This allows real-time processing of high resolution input video stream. Our
code and pre-trained model can be found on the project website:
https://github.com/jac99/FootAndBall .
","[{'version': 'v1', 'created': 'Tue, 10 Dec 2019 09:21:49 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Oct 2020 22:04:30 GMT'}]",2020-10-28,"[['Komorowski', 'Jacek', ''], ['Kurzejamski', 'Grzegorz', ''], ['Sarwas', 'Grzegorz', '']]","['object detection', 'player and ball detection', 'soccer video analysis']"
3106,1904.01576,Anirban Bhattacharjee,"Anirban Bhattacharjee, Ajay Dev Chhokra, Zhuangwei Kang, Hongyang Sun,
  Aniruddha Gokhale, Gabor Karsai","BARISTA: Efficient and Scalable Serverless Serving System for Deep
  Learning Prediction Services",,,10.1109/IC2E.2019.00-10,,cs.DC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pre-trained deep learning models are increasingly being used to offer a
variety of compute-intensive predictive analytics services such as fitness
tracking, speech and image recognition. The stateless and highly parallelizable
nature of deep learning models makes them well-suited for serverless computing
paradigm. However, making effective resource management decisions for these
services is a hard problem due to the dynamic workloads and diverse set of
available resource configurations that have their deployment and management
costs. To address these challenges, we present a distributed and scalable
deep-learning prediction serving system called Barista and make the following
contributions. First, we present a fast and effective methodology for
forecasting workloads by identifying various trends. Second, we formulate an
optimization problem to minimize the total cost incurred while ensuring bounded
prediction latency with reasonable accuracy. Third, we propose an efficient
heuristic to identify suitable compute resource configurations. Fourth, we
propose an intelligent agent to allocate and manage the compute resources by
horizontal and vertical scaling to maintain the required prediction latency.
Finally, using representative real-world workloads for urban transportation
service, we demonstrate and validate the capabilities of Barista.
","[{'version': 'v1', 'created': 'Tue, 2 Apr 2019 01:46:38 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Apr 2019 16:00:14 GMT'}]",2019-12-30,"[['Bhattacharjee', 'Anirban', ''], ['Chhokra', 'Ajay Dev', ''], ['Kang', 'Zhuangwei', ''], ['Sun', 'Hongyang', ''], ['Gokhale', 'Aniruddha', ''], ['Karsai', 'Gabor', '']]","['Resource Management', 'Machine Learning Models', 'Predictive Analytics', 'Serverless Computing', 'Containers']"
3107,2004.05381,Sebastian Feld,"Sebastian Feld (1), Andreas Sedlmeier (1), Markus Friedrich (1), Jan
  Franz (1), Lenz Belzner (2) ((1) Mobile and Distributed Systems Group LMU
  Munich, (2) MaibornWolff Munich)",Bayesian Surprise in Indoor Environments,"10 pages, 16 figures","Proceedings of the 27th ACM SIGSPATIAL International Conference on
  Advances in Geographic Information Systems (SIGSPATIAL '19), 2019, p. 129-138",10.1145/3347146.3359358,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a novel method to identify unexpected structures in 2D
floor plans using the concept of Bayesian Surprise. Taking into account that a
person's expectation is an important aspect of the perception of space, we
exploit the theory of Bayesian Surprise to robustly model expectation and thus
surprise in the context of building structures. We use Isovist Analysis, which
is a popular space syntax technique, to turn qualitative object attributes into
quantitative environmental information. Since isovists are location-specific
patterns of visibility, a sequence of isovists describes the spatial perception
during a movement along multiple points in space. We then use Bayesian Surprise
in a feature space consisting of these isovist readings. To demonstrate the
suitability of our approach, we take ""snapshots"" of an agent's local
environment to provide a short list of images that characterize a traversed
trajectory through a 2D indoor environment. Those fingerprints represent
surprising regions of a tour, characterize the traversed map and enable indoor
LBS to focus more on important regions. Given this idea, we propose to use
""surprise"" as a new dimension of context in indoor location-based services
(LBS). Agents of LBS, such as mobile robots or non-player characters in
computer games, may use the context surprise to focus more on important regions
of a map for a better use or understanding of the floor plan.
","[{'version': 'v1', 'created': 'Sat, 11 Apr 2020 12:09:51 GMT'}]",2020-04-14,"[['Feld', 'Sebastian', ''], ['Sedlmeier', 'Andreas', ''], ['Friedrich', 'Markus', ''], ['Franz', 'Jan', ''], ['Belzner', 'Lenz', '']]","['Bayesian Surprise', 'Novelty', 'Salience', 'Isovist Analysis', 'Indoor LocationBased Service', 'Indoor LBS', 'Indoor Navigation', 'Trajectory Characterization']"
3108,1610.01458,Dariusz Dereniowski,Dariusz Dereniowski and Dorota Urba\'nska,Distributed Searching of Partial Grids,,Theory of Computing Systems 63(8): 1819-1848 (2019),10.1007/s00224-019-09948-6,,cs.DM cs.DC math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the following distributed pursuit-evasion problem. A team of
mobile agents called searchers starts at an arbitrary node of an unknown
$n$-node network. Their goal is to execute a search strategy that guarantees
capturing a fast and invisible intruder regardless of its movements using as
few agents as possible. We restrict our attention to networks that are embedded
into partial grids: nodes are placed on the plane at integer coordinates and
only nodes at distance one can be adjacent. We give a distributed algorithm for
the searchers that allow them to compute a connected and monotone strategy that
guarantees searching any unknown partial grid with the use of $O(\sqrt{n})$
searchers. As for a lower bound, not only there exist partial grids that
require $\Omega(\sqrt{n})$ searchers, but we prove that for each distributed
searching algorithm there is a partial grid that forces the algorithm to use
$\Omega(\sqrt{n})$ searchers but $O(\log n)$ searchers are sufficient in the
offline scenario. This gives a lower bound of $\Omega(\sqrt{n}/\log n)$ in
terms of achievable competitive ratio of any distributed algorithm.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2016 14:47:54 GMT'}]",2021-01-19,"[['Dereniowski', 'Dariusz', ''], ['Urbańska', 'Dorota', '']]","['connected search number', 'distributed searching', 'graph searching', 'partialgrid', 'pursuit-evasion']"
3109,1405.5200,Narzu Tarannum,Narzu Tarannum and Nova Ahmed,Efficient and Reliable Hybrid Cloud Architechture for Big Data,"13 pages, 9 figures, International Journal on Cloud Computing:
  Services and Architecture (IJCCSA), Vol.3, No.6, December 2013",,10.5121/ijccsa.2013.3602,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The objective of our paper is to propose a Cloud computing framework which is
feasible and necessary for handling huge data. In our prototype system we
considered national ID database structure of Bangladesh which is prepared by
election commission of Bangladesh. Using this database we propose an
interactive graphical user interface for Bangladeshi People Search (BDPS) that
use a hybrid structure of cloud computing handled by apache Hadoop where
database is implemented by HiveQL. The infrastructure divides into two parts:
locally hosted cloud which is based on Eucalyptus and the remote cloud which is
implemented on well-known Amazon Web Service (AWS). Some common problems of
Bangladesh aspect which includes data traffic congestion, server time out and
server down issue is also discussed.
","[{'version': 'v1', 'created': 'Thu, 9 Jan 2014 12:46:41 GMT'}]",2014-05-21,"[['Tarannum', 'Narzu', ''], ['Ahmed', 'Nova', '']]","['Cloud Computing', 'AWS', 'Hadoop', 'Eucalyptus', 'HiveQL', 'Election Commission of Bangladesh']"
3110,1407.3675,Archana Vijayan,"Archana Vijayan, Vincy Salam","A New Approach for Super resolution by Using Web Images and FFT Based
  Image Registration","7 pages,4 figures,Published with International Journal of Engineering
  Trends and Technology (IJETT)","International Journal of Engineering Trends and Technology
  (IJETT), V12(9),473-479 June 2014",10.14445/22315381/IJETT-V12P289,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Preserving accuracy is a challenging issue in super resolution images. In
this paper, we propose a new FFT based image registration algorithm and a
sparse based super resolution algorithm to improve the accuracy of super
resolution image. Given a low resolution image, our approach initially extracts
the local descriptors from the input and then the local descriptors from the
whole correlated images using the SIFT algorithm. Once this is completed, it
will compare the local descriptors on the basis of a threshold value. The
retrieved images could be having different focal length, illumination,
inclination and size. To overcome the above differences of the retrieved
images, we propose a new FFT based image registration algorithm. After the
registration stage, we apply a sparse based super resolution on the images for
recreating images with better resolution compared to the input. Based on the
PSSNR calculation and SSIM comparison, we can see that the new methodology
creates a better image than the traditional methods.
","[{'version': 'v1', 'created': 'Sat, 5 Jul 2014 13:10:01 GMT'}]",2014-07-15,"[['Vijayan', 'Archana', ''], ['Salam', 'Vincy', '']]","['SIFT extraction', 'FFT', 'Super resolution', 'Image retrieval', 'Bicubic Interpolation']"
3111,1406.5814,Jessica Liebig,"J. Liebig, A. Rao","Identifying Influential Nodes in Bipartite Networks Using the Clustering
  Coefficient",,,10.1109/SITIS.2014.15,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The identification of influential nodes in complex network can be very
challenging. If the network has a community structure, centrality measures may
fail to identify the complete set of influential nodes, as the hubs and other
central nodes of the network may lie inside only one community. Here we define
a bipartite clustering coefficient that, by taking differently structured
clusters into account, can find important nodes across communities.
","[{'version': 'v1', 'created': 'Mon, 23 Jun 2014 06:26:39 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Mar 2015 05:40:27 GMT'}]",2015-03-23,"[['Liebig', 'J.', ''], ['Rao', 'A.', '']]","['Bipartite networks', 'Clustering coefficient', 'Influential nodes']"
3112,1606.07347,Petros Maragos,Petros Maragos,Dynamical Systems On Weighted Lattices: General Theory,"38 pages, 4 figures",Math. Control Signals Syst. (2017) 29: 21,10.1007/s00498-017-0207-8,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work a theory is developed for unifying large classes of nonlinear
discrete-time dynamical systems obeying a superposition of a weighted maximum
or minimum type. The state vectors and input-output signals evolve on nonlinear
spaces which we call complete weighted lattices and include as special cases
the nonlinear vector spaces of minimax algebra. Their algebraic structure has a
polygonal geometry. Some of the special cases unified include max-plus,
max-product, and probabilistic dynamical systems. We study problems of
representation in state and input-output spaces using lattice monotone
operators, state and output responses using nonlinear convolutions, solving
nonlinear matrix equations using lattice adjunctions, stability and
controllability. We outline applications in state-space modeling of nonlinear
filtering; dynamic programming (Viterbi algorithm) and shortest paths (distance
maps); fuzzy Markov chains; and tracking audio-visual salient events in
multimodal information streams using generalized hidden Markov models with
control inputs.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2016 15:34:53 GMT'}, {'version': 'v2', 'created': 'Sun, 3 Jul 2016 17:23:58 GMT'}, {'version': 'v3', 'created': 'Mon, 1 May 2017 14:55:31 GMT'}, {'version': 'v4', 'created': 'Sat, 9 Dec 2017 21:02:22 GMT'}]",2019-12-10,"[['Maragos', 'Petros', '']]","['nonlinear dynamical systems', 'lattice theory', 'minimax algebra', 'control', 'signal processing']"
3113,2004.04787,Ha Q. Ngo,"Ha Q. Ngo, Christoph Henke, Frank Hees","An End-to-End Learning Approach for Trajectory Prediction in Pedestrian
  Zones",Submitted 23 March 2020,"2020 ACM/IEEE International Conference on Human-Robot Interaction.
  Workshop on The Forgotten in HRI: Incidental Encounters with Robots in Public
  Spaces",,,cs.AI cs.LG cs.RO,http://creativecommons.org/licenses/by/4.0/,"  This paper aims to explore the problem of trajectory prediction in
heterogeneous pedestrian zones, where social dynamics representation is a big
challenge. Proposed is an end-to-end learning framework for prediction accuracy
improvement based on an attention mechanism to learn social interaction from
multi-factor inputs.
","[{'version': 'v1', 'created': 'Thu, 9 Apr 2020 19:56:45 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Jan 2021 22:43:17 GMT'}]",2021-01-06,"[['Ngo', 'Ha Q.', ''], ['Henke', 'Christoph', ''], ['Hees', 'Frank', '']]","['Trajectory prediction', 'attention-based learning', 'social']"
3114,1111.5454,John Rooksby,"John Rooksby, Ian Sommerville","The Management and Use of Social Network Sites in a Government
  Department","Accepted for publication in JCSCW (The Journal of Computer Supported
  Cooperative Work)",Computer Supported Cooperative Work 21(4-5): 397-415 (2012),10.1007/s10606-011-9150-2,,cs.SI cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we report findings from a study of social network site use in a
UK Government department. We have investigated this from a managerial,
organisational perspective. We found at the study site that there are already
several social network technologies in use, and that these: misalign with and
problematize organisational boundaries; blur boundaries between working and
social lives; present differing opportunities for control; have different
visibilities; have overlapping functionality with each other and with other
information technologies; that they evolve and change over time; and that their
uptake is conditioned by existing infrastructure and availability. We find the
organisational complexity that social technologies are often hoped to cut
across is, in reality, something that shapes their uptake and use. We argue the
idea of a single, central social network site for supporting cooperative work
within an organisation will hit the same problems as any effort of
centralisation in organisations. We argue that while there is still plenty of
scope for design and innovation in this area, an important challenge now is in
supporting organisations in managing what can best be referred to as a social
network site 'ecosystem'.
","[{'version': 'v1', 'created': 'Wed, 23 Nov 2011 11:00:10 GMT'}]",2012-10-11,"[['Rooksby', 'John', ''], ['Sommerville', 'Ian', '']]","['Fieldwork', 'Government', 'Organisations', 'Public Administration', 'Social Network']"
3115,1804.03315,Warut Suksompong,Warut Suksompong,Individual and Group Stability in Neutral Restrictions of Hedonic Games,,"Mathematical Social Sciences, 78:1-5 (2015)",10.1016/j.mathsocsci.2015.07.004,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a class of coalition formation games called hedonic games, i.e.,
games in which the utility of a player is completely determined by the
coalition that the player belongs to. We first define the class of
subset-additive hedonic games and show that they have the same representation
power as the class of hedonic games. We then define a restriction of
subset-additive hedonic games that we call subset-neutral hedonic games and
generalize a result by Bogomolnaia and Jackson (2002) by showing the existence
of a Nash stable partition and an individually stable partition in such games.
We also consider neutrally anonymous hedonic games and show that they form a
subclass of the subset-additive hedonic games. Finally, we show the existence
of a core stable partition that is also individually stable in neutrally
anonymous hedonic games by exhibiting an algorithm to compute such a partition.
","[{'version': 'v1', 'created': 'Tue, 10 Apr 2018 02:37:23 GMT'}]",2018-04-19,"[['Suksompong', 'Warut', '']]","['hedonic game', 'coalition formation', 'stability', 'cooperativegame']"
3116,1608.00514,Alireza Davoudi,"Alireza Davoudi, Saeed Shiry Ghidary, Khadijeh Sadatnejad","Dimensionality reduction based on Distance Preservation to Local Mean
  (DPLM) for SPD matrices and its application in BCI",,,10.1088/1741-2552/aa61bb,,cs.NA cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a nonlinear dimensionality reduction algorithm for
the manifold of Symmetric Positive Definite (SPD) matrices that considers the
geometry of SPD matrices and provides a low dimensional representation of the
manifold with high class discrimination. The proposed algorithm, tries to
preserve the local structure of the data by preserving distance to local mean
(DPLM) and also provides an implicit projection matrix. DPLM is linear in terms
of the number of training samples and may use the label information when they
are available in order to performance improvement in classification tasks. We
performed several experiments on the multi-class dataset IIa from BCI
competition IV. The results show that our approach as dimensionality reduction
technique - leads to superior results in comparison with other competitor in
the related literature because of its robustness against outliers. The
experiments confirm that the combination of DPLM with FGMDM as the classifier
leads to the state of the art performance on this dataset.
","[{'version': 'v1', 'created': 'Fri, 29 Jul 2016 15:17:16 GMT'}]",2017-02-23,"[['Davoudi', 'Alireza', ''], ['Ghidary', 'Saeed Shiry', ''], ['Sadatnejad', 'Khadijeh', '']]","['Brain computer interface', 'nonlinear dimentionality reduction', 'Riemannian geometry', 'SPD manifold']"
3117,1108.6003,Joan Serr\`a,"Joan Serr\`a, Massimiliano Zanin, Perfecto Herrera and Xavier Serra","Characterization and exploitation of community structure in cover song
  networks",,"Pattern Recognition Letters 33(9): 1032-1041, 2012",10.1016/j.patrec.2012.02.013,,cs.IR cs.MM cs.SI physics.data-an stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of community detection algorithms is explored within the framework of
cover song identification, i.e. the automatic detection of different audio
renditions of the same underlying musical piece. Until now, this task has been
posed as a typical query-by-example task, where one submits a query song and
the system retrieves a list of possible matches ranked by their similarity to
the query. In this work, we propose a new approach which uses song communities
to provide more relevant answers to a given query. Starting from the output of
a state-of-the-art system, songs are embedded in a complex weighted network
whose links represent similarity (related musical content). Communities inside
the network are then recognized as groups of covers and this information is
used to enhance the results of the system. In particular, we show that this
approach increases both the coherence and the accuracy of the system.
Furthermore, we provide insight into the internal organization of individual
cover song communities, showing that there is a tendency for the original song
to be central within the community. We postulate that the methods and results
presented here could be relevant to other query-by-example tasks.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2011 15:25:20 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Sep 2011 10:46:30 GMT'}]",2012-04-17,"[['Serrà', 'Joan', ''], ['Zanin', 'Massimiliano', ''], ['Herrera', 'Perfecto', ''], ['Serra', 'Xavier', '']]","['Complex networks', 'Community detection', 'Clustering', 'Music']"
3118,1308.6217,Sang Hyun Kim,Sang Hyun Kim and Eric Feron,"Numerical Analysis of Gate Conflict Duration and Passenger Transit Time
  in Airport","Submitted to Transportation Research Part B, and presented at AIAA
  Guidance, Navigation, and Control Conference in 2011 in part",,10.2514/1.D0067,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robustness is as important as efficiency in air transportation. All
components in the air traffic system are connected to form an interactive
network. So, a disturbance that occurs in one component, for example, a severe
delay at an airport, can influence the entire network. Delays are easily
propagated between flights through gates, but the propagation can be reduced if
gate assignments are robust against stochastic delays. In this paper, we
analyze gate delays and suggest an approach that involves assigning gates while
making them robust against stochastic delays. We extract an example flight
schedule from data source and generate schedules with increased traffic to
analyze how the compact flight schedules impact the robustness of gate
assignment. Simulation results show that our approach improves the robustness
of gate assignment. Particularly, the robust gate assignment reduces average
duration of gate conflicts by 96.3% and the number of gate conflicts by 96.7%
compared to the baseline assignment. However, the robust gate assignment
results in longer transit time for passengers, and a trade-off between the
robustness of gate assignment and passenger transit time is presented.
","[{'version': 'v1', 'created': 'Wed, 28 Aug 2013 16:55:24 GMT'}]",2021-11-19,"[['Kim', 'Sang Hyun', ''], ['Feron', 'Eric', '']]","['Robust Gate Assignment', 'Gate Conflict', 'Passenger Transit', 'Tabu Search']"
3119,1804.08380,Sindhu Nagaraja,"Sindhu Nagaraja, Mohamed Elhaddad, Marreddy Ambati, Stefan
  Kollmannsberger, Laura De Lorenzis, Ernst Rank","Phase-field modeling of brittle fracture with multi-level hp-FEM and the
  finite cell method",,"Computational Mechanics, 2018 : ISS 0178-7675, Springer",10.1007/s00466-018-1649-7,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The difficulties in dealing with discontinuities related to a sharp crack are
overcome in the phase-field approach for fracture by modeling the crack as a
diffusive object being described by a continuous field having high gradients.
The discrete crack limit case is approached for a small length-scale parameter
that controls the width of the transition region between the fully broken and
the undamaged phases. From a computational standpoint, this necessitates fine
meshes, at least locally, in order to accurately resolve the phase-field
profile. In the classical approach, phase-field models are computed on a fixed
mesh that is a priori refined in the areas where the crack is expected to
propagate. This on the other hand curbs the convenience of using phase-field
models for unknown crack paths and its ability to handle complex crack
propagation patterns. In this work, we overcome this issue by employing the
multi-level hp-refinement technique that enables a dynamically changing mesh
which in turn allows the refinement to remain local at singularities and high
gradients without problems of hanging nodes. Yet, in case of complex
geometries, mesh generation and in particular local refinement becomes
non-trivial. We address this issue by integrating a two-dimensional phase-field
framework for brittle fracture with the finite cell method (FCM). The FCM based
on high-order finite elements is a non-geometry-conforming discretization
technique wherein the physical domain is embedded into a larger fictitious
domain of simple geometry that can be easily discretized. This facilitates mesh
generation for complex geometries and supports local refinement. Numerical
examples including a comparison to a validation experiment illustrate the
applicability of the multi-level hp-refinement and the FCM in the context of
phase-field simulations.
","[{'version': 'v1', 'created': 'Mon, 23 Apr 2018 12:50:12 GMT'}]",2018-11-08,"[['Nagaraja', 'Sindhu', ''], ['Elhaddad', 'Mohamed', ''], ['Ambati', 'Marreddy', ''], ['Kollmannsberger', 'Stefan', ''], ['De Lorenzis', 'Laura', ''], ['Rank', 'Ernst', '']]","['Phase-field modeling', 'brittle fracture', 'high-order finite elements', 'finite cell method', 'multi-level hp-FEM', 'adaptive refinement']"
3120,1908.00827,Davide Taibi,"Valentina Lenarduzzi, Nyyti Saarim\""aki, Davide Taibi",The Technical Debt Dataset,,"The Fifteenth International Conference on Predictive Models and
  Data Analytics in Software Engineering (PROMISE'19), September 18, 2019,
  Recife, Brazil",10.1145/3345629.3345630,,cs.SE,http://creativecommons.org/licenses/by-sa/4.0/,"  Technical Debt analysis is increasing in popularity as nowadays researchers
and industry are adopting various tools for static code analysis to evaluate
the quality of their code. Despite this, empirical studies on software projects
are expensive because of the time needed to analyze the projects. In addition,
the results are difficult to compare as studies commonly consider different
projects. In this work, we propose the Technical Debt Dataset, a curated set of
project measurement data from 33 Java projects from the Apache Software
Foundation. In the Technical Debt Dataset, we analyzed all commits from
separately defined time frames with SonarQube to collect Technical Debt
information and with Ptidej to detect code smells. Moreover, we extracted all
available commit information from the git logs, the refactoring applied with
Refactoring Miner, and fault information reported in the issue trackers (Jira).
Using this information, we executed the SZZ algorithm to identify the
fault-inducing and -fixing commits. We analyzed 78K commits from the selected
33 projects, detecting 1.8M SonarQube issues, 38K code smells, 28K faults and
57K refactorings. The project analysis took more than 200 days. In this paper,
we describe the data retrieval pipeline together with the tools used for the
analysis. The dataset is made available through CSV files and an SQLite
database to facilitate queries on the data. The Technical Debt Dataset aims to
open up diverse opportunities for Technical Debt research, enabling researchers
to compare results on common projects.
","[{'version': 'v1', 'created': 'Fri, 2 Aug 2019 12:46:05 GMT'}]",2019-08-05,"[['Lenarduzzi', 'Valentina', ''], ['Saarimäki', 'Nyyti', ''], ['Taibi', 'Davide', '']]","['Technical Debt', 'Software Quality', 'Dataset', 'Mining Software Repository', 'Faults', 'SZZ', 'SonarQube']"
3121,0901.3119,Josef Cibulka,Josef Cibulka,Average number of flips in pancake sorting,"21 pages, new computational results for unburnt pancakes (up to n=19)","Theor. Comput. Sci. 412, pp. 822-834 (2011)",10.1016/j.tcs.2010.11.028,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We are given a stack of pancakes of different sizes and the only allowed
operation is to take several pancakes from top and flip them. The unburnt
version requires the pancakes to be sorted by their sizes at the end, while in
the burnt version they additionally need to be oriented burnt-side down. We
present an algorithm with the average number of flips, needed to sort a stack
of n burnt pancakes, equal to 7n/4+O(1) and a randomized algorithm for the
unburnt version with at most 17n/12+O(1) flips on average.
  In addition, we show that in the burnt version, the average number of flips
of any algorithm is at least n+\Omega(n/log n) and conjecture that some
algorithm can reach n+\Theta(n/log n).
  We also slightly increase the lower bound on g(n), the minimum number of
flips needed to sort the worst stack of n burnt pancakes. This bound, together
with the upper bound found by Heydari and Sudborough in 1997, gives the exact
number of flips to sort the previously conjectured worst stack -I_n for n=3 mod
4 and n>=15. Finally we present exact values of f(n) up to n=19 and of g(n) up
to n=17 and disprove a conjecture of Cohen and Blum by showing that the burnt
stack -I_{15} is not the worst one for n=15.
","[{'version': 'v1', 'created': 'Tue, 20 Jan 2009 20:08:57 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Sep 2009 16:17:16 GMT'}]",2011-02-07,"[['Cibulka', 'Josef', '']]","['Pancake problem', 'Burnt pancake problem', 'Permutations', 'Prefix reversals', 'Average-case analysis']"
3122,1707.06810,Ayan Kumar Bhunia,"Ayan Kumar Bhunia, Gautam Kumar, Partha Pratim Roy, R.
  Balasubramanian, Umapada Pal","Text Recognition in Scene Image and Video Frame using Color Channel
  Selection","Multimedia Tools and Applications, Springer",,10.1007/s11042-017-4750-6,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, recognition of text from natural scene image and video frame
has got increased attention among the researchers due to its various
complexities and challenges. Because of low resolution, blurring effect,
complex background, different fonts, color and variant alignment of text within
images and video frames, etc., text recognition in such scenario is difficult.
Most of the current approaches usually apply a binarization algorithm to
convert them into binary images and next OCR is applied to get the recognition
result. In this paper, we present a novel approach based on color channel
selection for text recognition from scene images and video frames. In the
approach, at first, a color channel is automatically selected and then selected
color channel is considered for text recognition. Our text recognition
framework is based on Hidden Markov Model (HMM) which uses Pyramidal Histogram
of Oriented Gradient features extracted from selected color channel. From each
sliding window of a color channel our color-channel selection approach analyzes
the image properties from the sliding window and then a multi-label Support
Vector Machine (SVM) classifier is applied to select the color channel that
will provide the best recognition results in the sliding window. This color
channel selection for each sliding window has been found to be more fruitful
than considering a single color channel for the whole word image. Five
different features have been analyzed for multi-label SVM based color channel
selection where wavelet transform based feature outperforms others. Our
framework has been tested on different publicly available scene/video text
image datasets. For Devanagari script, we collected our own data dataset. The
performances obtained from experimental results are encouraging and show the
advantage of the proposed method.
","[{'version': 'v1', 'created': 'Fri, 21 Jul 2017 09:25:55 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Jul 2017 23:12:13 GMT'}]",2017-07-31,"[['Bhunia', 'Ayan Kumar', ''], ['Kumar', 'Gautam', ''], ['Roy', 'Partha Pratim', ''], ['Balasubramanian', 'R.', ''], ['Pal', 'Umapada', '']]","['Scene Text Recognition', 'Color Channel Selection', 'Hidden Markov Model', 'Multi']"
3123,1601.00260,Gholamreza Anbarjafari,"Pejman Rasti, Hasan Demirel, Gholamreza Anbarjafari","Image Resolution Enhancement by Using Interpolation Followed by
  Iterative Back Projection","4 pages, Signal Processing and Communications Applications Conference
  (SIU), 2013",,10.1109/SIU.2013.6531593,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a new super resolution technique based on the
interpolation followed by registering them using iterative back projection
(IBP). Low resolution images are being interpolated and then the interpolated
images are being registered in order to generate a sharper high resolution
image. The proposed technique has been tested on Lena, Elaine, Pepper, and
Baboon. The quantitative peak signal-to-noise ratio (PSNR) and structural
similarity index (SSIM) results as well as the visual results show the
superiority of the proposed technique over the conventional and state-of-art
image super resolution techniques. For Lena's image, the PSNR is 6.52 dB higher
than the bicubic interpolation.
","[{'version': 'v1', 'created': 'Sun, 3 Jan 2016 08:50:10 GMT'}]",2016-01-05,"[['Rasti', 'Pejman', ''], ['Demirel', 'Hasan', ''], ['Anbarjafari', 'Gholamreza', '']]","['Super resolution', 'Iterative Back Projection', 'Image Registeration']"
3124,1804.03412,Christoph Matthies,Christoph Matthies,"Scrum2Kanban: Integrating Kanban and Scrum in a University Software
  Engineering Capstone Course",,"Proceedings of the 2nd International Workshop on Software
  Engineering Education for Millennials (SEEM '18). 2018, ACM, New York, NY,
  USA, 48-55",10.1145/3194779.3194784,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using university capstone courses to teach agile software development
methodologies has become commonplace, as agile methods have gained support in
professional software development. This usually means students are introduced
to and work with the currently most popular agile methodology: Scrum. However,
as the agile methods employed in the industry change and are adapted to
different contexts, university courses must follow suit. A prime example of
this is the Kanban method, which has recently gathered attention in the
industry. In this paper, we describe a capstone course design, which adds the
hands-on learning of the lean principles advocated by Kanban into a capstone
project run with Scrum. This both ensures that students are aware of recent
process frameworks and ideas as well as gain a more thorough overview of how
agile methods can be employed in practice. We describe the details of the
course and analyze the participating students' perceptions as well as our
observations. We analyze the development artifacts, created by students during
the course in respect to the two different development methodologies. We
further present a summary of the lessons learned as well as recommendations for
future similar courses. The survey conducted at the end of the course revealed
an overwhelmingly positive attitude of students towards the integration of
Kanban into the course.
","[{'version': 'v1', 'created': 'Tue, 10 Apr 2018 09:19:44 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Sep 2018 09:39:31 GMT'}]",2018-09-07,"[['Matthies', 'Christoph', '']]","['Agile methods', 'capstone course', 'Scrum', 'Kanban']"
3125,1208.5341,Cm Pintea,"Camelia-M. Pintea, Camelia Chira, D. Dumitrescu, Petrica C. Pop",Sensitive Ants in Solving the Generalized Vehicle Routing Problem,5 pages,"INT J COMPUT COMMUN, VI(4):731-738 (2011)",10.15837/ijccc.2011.4.2098,,cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The idea of sensitivity in ant colony systems has been exploited in hybrid
ant-based models with promising results for many combinatorial optimization
problems. Heterogeneity is induced in the ant population by endowing individual
ants with a certain level of sensitivity to the pheromone trail. The variable
pheromone sensitivity within the same population of ants can potentially
intensify the search while in the same time inducing diversity for the
exploration of the environment. The performance of sensitive ant models is
investigated for solving the generalized vehicle routing problem. Numerical
results and comparisons are discussed and analysed with a focus on emphasizing
any particular aspects and potential benefits related to hybrid ant-based
models.
","[{'version': 'v1', 'created': 'Mon, 27 Aug 2012 09:12:58 GMT'}]",2020-07-28,"[['Pintea', 'Camelia-M.', ''], ['Chira', 'Camelia', ''], ['Dumitrescu', 'D.', ''], ['Pop', 'Petrica C.', '']]","['ant-based models', 'optimization', 'sensitivity', 'complex problems']"
3126,2102.10992,Andr\'es Chacoma,"A. Chacoma, D. H. Zanette",Word frequency-rank relationship in tagged texts,,,10.1016/j.physa.2021.126020,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze the frequency-rank relationship in sub-vocabularies corresponding
to three different grammatical classes (nouns, verbs, and others) in a
collection of literary works in English, whose words have been automatically
tagged according to their grammatical role. Comparing with a null hypothesis
which assumes that words belonging to each class are uniformly distributed
across the frequency-ranked vocabulary of the whole work, we disclose
statistically significant differences between the three classes. This results
point to the fact that frequency-rank relationships may reflect linguistic
features associated with grammatical function.
","[{'version': 'v1', 'created': 'Sun, 7 Feb 2021 15:17:51 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Jun 2021 12:38:11 GMT'}]",2021-06-11,"[['Chacoma', 'A.', ''], ['Zanette', 'D. H.', '']]","['Frequency-rank statistics', 'Grammatical function', 'Linguisticregularities', 'Language processing', 'Quantitative linguistics']"
3127,1902.00526,Amir Saeidi,"Amir Saeidi (Utrecht University, Netherlands), Jurriaan Hage (Utrecht
  University, Netherlands), Ravi Khadka (Utrecht University, Netherlands),
  Slinger Jansen (Utrecht University, Netherlands)","Applications of Multi-view Learning Approaches for Software
  Comprehension",,"The Art, Science, and Engineering of Programming, 2019, Vol. 3,
  Issue 3, Article 14",10.22152/programming-journal.org/2019/3/14,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Program comprehension concerns the ability of an individual to make an
understanding of an existing software system to extend or transform it.
Software systems comprise of data that are noisy and missing, which makes
program understanding even more difficult. A software system consists of
various views including the module dependency graph, execution logs,
evolutionary information and the vocabulary used in the source code, that
collectively defines the software system. Each of these views contain unique
and complementary information; together which can more accurately describe the
data. In this paper, we investigate various techniques for combining different
sources of information to improve the performance of a program comprehension
task. We employ state-of-the-art techniques from learning to 1) find a suitable
similarity function for each view, and 2) compare different multi-view learning
techniques to decompose a software system into high-level units and give
component-level recommendations for refactoring of the system, as well as
cross-view source code search. The experiments conducted on 10 relatively large
Java software systems show that by fusing knowledge from different views, we
can guarantee a lower bound on the quality of the modularization and even
improve upon it. We proceed by integrating different sources of information to
give a set of high-level recommendations as to how to refactor the software
system. Furthermore, we demonstrate how learning a joint subspace allows for
performing cross-modal retrieval across views, yielding results that are more
aligned with what the user intends by the query. The multi-view approaches
outlined in this paper can be employed for addressing problems in software
engineering that can be encoded in terms of a learning problem, such as
software bug prediction and feature location.
","[{'version': 'v1', 'created': 'Fri, 1 Feb 2019 19:07:49 GMT'}]",2019-02-05,"[['Saeidi', 'Amir', '', 'Utrecht University, Netherlands'], ['Hage', 'Jurriaan', '', 'Utrecht\n  University, Netherlands'], ['Khadka', 'Ravi', '', 'Utrecht University, Netherlands'], ['Jansen', 'Slinger', '', 'Utrecht University, Netherlands']]","['software modularization', 'recommender systems', 'source code search', 'data mining for software']"
3128,1505.00294,Nirav Bhatt,Nirav Bhatt and Arun Ayyar,Monotonous (Semi-)Nonnegative Matrix Factorization,,,10.1145/2732587.2732600,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nonnegative matrix factorization (NMF) factorizes a non-negative matrix into
product of two non-negative matrices, namely a signal matrix and a mixing
matrix. NMF suffers from the scale and ordering ambiguities. Often, the source
signals can be monotonous in nature. For example, in source separation problem,
the source signals can be monotonously increasing or decreasing while the
mixing matrix can have nonnegative entries. NMF methods may not be effective
for such cases as it suffers from the ordering ambiguity. This paper proposes
an approach to incorporate notion of monotonicity in NMF, labeled as monotonous
NMF. An algorithm based on alternating least-squares is proposed for recovering
monotonous signals from a data matrix. Further, the assumption on mixing matrix
is relaxed to extend monotonous NMF for data matrix with real numbers as
entries. The approach is illustrated using synthetic noisy data. The results
obtained by monotonous NMF are compared with standard NMF algorithms in the
literature, and it is shown that monotonous NMF estimates source signals well
in comparison to standard NMF algorithms when the underlying sources signals
are monotonous.
","[{'version': 'v1', 'created': 'Fri, 1 May 2015 23:58:17 GMT'}]",2015-05-05,"[['Bhatt', 'Nirav', ''], ['Ayyar', 'Arun', '']]","['Nonnegative matrix factorization', 'Monotonicity', 'Unsupervised learning', 'Blind sourceseparation']"
3129,1607.00890,Lutz Bornmann Dr.,Lutz Bornmann and Robin Haunschild,"Citation score normalized by cited references (CSNCR): The introduction
  of a new citation impact indicator",Accepted for publication in the Journal of Informetrics,,10.1016/j.joi.2016.07.002,,cs.DL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a new field-normalized indicator is introduced, which is
rooted in early insights in bibliometrics, and is compared with several
established field-normalized indicators (e.g. the mean normalized citation
score, MNCS, and indicators based on percentile approaches). Garfield (1979)
emphasizes that bare citation counts from different fields cannot be compared
for evaluative purposes, because the ""citation potential"" can vary
significantly between the fields. Garfield (1979) suggests that ""the most
accurate measure of citation potential is the average number of references per
paper published in a given field"". Based on this suggestion, the new indicator
is basically defined as follows: the citation count of a focal paper is divided
by the mean number of cited references in a field to normalize citations. The
new indicator is called citation score normalized by cited references (CSNCR).
The theoretical analysis of the CSNCR shows that it has the properties of
consistency and homogeneous normalization. The close relation of the new
indicator to the MNCS is discussed. The empirical comparison of the CSNCR with
other field-normalized indicators shows that it is slightly poorer able to
field-normalize citation counts than other cited-side normalized indicators
(e.g. the MNCS), but its results are favorable compared to two citing-side
indicator variants (SNCS indicators). Taken as a whole, the results of this
study confirm the ability of established indicators to field-normalize
citations.
","[{'version': 'v1', 'created': 'Mon, 4 Jul 2016 14:00:45 GMT'}]",2017-07-04,"[['Bornmann', 'Lutz', ''], ['Haunschild', 'Robin', '']]","['Citation score normalized by cited references (CSNCR)', 'bibliometrics', 'field-normalization']"
3130,2011.14838,Taqwa Saeed,"Taqwa Saeed, Sergi Abadal, Christos Liaskos, Andreas Pitsillides,
  Hamidreza Taghvaee, Albert Cabellos-Aparicio, Marios Lestas, Eduard Alarcon",Workload Characterization of Programmable Metasurfaces,,"Proceedings of the Sixth Annual ACM International Conference on
  Nanoscale Computing and Communication, year 2019, page 1-6",,,cs.NI cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Metasurfaces are envisaged to play a key role in next-generation wireless
systems due to their powerful control over electromagnetic waves. The last
decade has witnessed huge advances in this regard, shifting from static to
programmable metasurfaces. The HyperSurface (HSF) paradigm takes one step
further by integrating a network of controllers within the device with the aim
of adding intelligence, connectivity, and autonomy. However, little is known
about the traffic that this network will have to support as the target
electromagnetic function or boundary conditions change. In this paper, we lay
down the foundations of a methodology to characterize the workload of
programmable metasurfaces and then employ it to analyze the case of beam
steering HSFs. We observe that traffic is bursty and highly dependent on the
position of the target. These results will enable the early-stage evaluation of
intra-HSF networks, as well as the estimation of the system performance and
cost.
","[{'version': 'v1', 'created': 'Tue, 10 Nov 2020 09:02:25 GMT'}]",2020-12-01,"[['Saeed', 'Taqwa', ''], ['Abadal', 'Sergi', ''], ['Liaskos', 'Christos', ''], ['Pitsillides', 'Andreas', ''], ['Taghvaee', 'Hamidreza', ''], ['Cabellos-Aparicio', 'Albert', ''], ['Lestas', 'Marios', ''], ['Alarcon', 'Eduard', '']]","['Programmable Metasurface', 'Integrated Network', 'Traffic Analysis']"
3131,1901.05717,Stefano Forti,Antonio Brogi and Stefano Forti and Carlos Guerrero and Isaac Lera,"How to Place Your Apps in the Fog -- State of the Art and Open
  Challenges",,"Software Practice and Experience, 1-22, 2019",10.1002/spe.2766,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fog computing aims at extending the Cloud towards the IoT so to achieve
improved QoS and to empower latency-sensitive and bandwidth-hungry
applications. The Fog calls for novel models and algorithms to distribute
multi-service applications in such a way that data processing occurs wherever
it is best-placed, based on both functional and non-functional requirements.
This survey reviews the existing methodologies to solve the application
placement problem in the Fog, while pursuing three main objectives. First, it
offers a comprehensive overview on the currently employed algorithms, on the
availability of open-source prototypes, and on the size of test use cases.
Second, it classifies the literature based on the application and Fog
infrastructure characteristics that are captured by available models, with a
focus on the considered constraints and the optimised metrics. Finally, it
identifies some open challenges in application placement in the Fog.
","[{'version': 'v1', 'created': 'Thu, 17 Jan 2019 10:21:27 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Nov 2019 18:13:00 GMT'}]",2019-11-28,"[['Brogi', 'Antonio', ''], ['Forti', 'Stefano', ''], ['Guerrero', 'Carlos', ''], ['Lera', 'Isaac', '']]","['fog computing', 'application placement', 'service placement', 'application deployment', 'optimisation algo']"
3132,2110.11462,Jan S. Rellermeyer,Vincent van Rijn and Jan S. Rellermeyer,"A Fresh Look at the Architecture and Performance of Contemporary
  Isolation Platforms",,"Proceedings of the 22nd ACM/IFIP International Middleware
  Conference, 2022",10.1145/3464298.3493404,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  With the ever-increasing pervasiveness of the cloud computing paradigm,
strong isolation guarantees and low performance overhead from isolation
platforms are paramount. An ideal isolation platform offers both: an
impermeable isolation boundary while imposing a negligible performance
overhead. In this paper, we examine various isolation platforms (containers,
secure containers, hypervisors, unikernels), and conduct a wide array of
experiments to measure the performance overhead and degree of isolation offered
by the platforms. We find that container platforms have the best, near-native,
performance while the newly emerging secure containers suffer from various
overheads. The highest degree of isolation is achieved by unikernels, closely
followed by traditional containers.
","[{'version': 'v1', 'created': 'Thu, 21 Oct 2021 20:16:41 GMT'}]",2021-10-25,"[['van Rijn', 'Vincent', ''], ['Rellermeyer', 'Jan S.', '']]","['Containers', 'Virtual Machines', 'Performance']"
3133,1810.09803,Bertrand Corn\'elusse,"Bertrand Corn\'elusse, Iacopo Savelli, Simone Paoletti, Antonio
  Giannitrapani and Antonio Vicino",A Community Microgrid Architecture with an Internal Local Market,"16 pages, 15 figures",,10.1016/j.apenergy.2019.03.109,,cs.SY econ.GN q-fin.EC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work fits in the context of community microgrids, where members of a
community can exchange energy and services among themselves, without going
through the usual channels of the public electricity grid. We introduce and
analyze a framework to operate a community microgrid, and to share the
resulting revenues and costs among its members. A market-oriented pricing of
energy exchanges within the community is obtained by implementing an internal
local market based on the marginal pricing scheme. The market aims at
maximizing the social welfare of the community, thanks to the more efficient
allocation of resources, the reduction of the peak power to be paid, and the
increased amount of reserve, achieved at an aggregate level. A community
microgrid operator, acting as a benevolent planner, redistributes revenues and
costs among the members, in such a way that the solution achieved by each
member within the community is not worse than the solution it would achieve by
acting individually. In this way, each member is incentivized to participate in
the community on a voluntary basis. The overall framework is formulated in the
form of a bilevel model, where the lower level problem clears the market, while
the upper level problem plays the role of the community microgrid operator.
Numerical results obtained on a real test case implemented in Belgium show
around 54% cost savings on a yearly scale for the community, as compared to the
case when its members act individually.
","[{'version': 'v1', 'created': 'Tue, 23 Oct 2018 12:05:51 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Jan 2019 09:39:31 GMT'}, {'version': 'v3', 'created': 'Wed, 20 Feb 2019 17:43:05 GMT'}]",2019-04-23,"[['Cornélusse', 'Bertrand', ''], ['Savelli', 'Iacopo', ''], ['Paoletti', 'Simone', ''], ['Giannitrapani', 'Antonio', ''], ['Vicino', 'Antonio', '']]","['Community microgrid', 'energy market', 'marginal pricing', 'bilevel programming']"
3134,1412.6787,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",Instruction sequence size complexity of parity,"12 pages, the preliminaries are largely the same as the preliminaries
  in arXiv:1312.1812 [cs.PL] and some earlier papers; 13 pages, minor errors
  corrected; 13 pages, presentation improved; 14 pages, remarks about related
  work added; 14 pages, presentation improved","Fundamenta Informaticae, 149(3):297--309, 2016",10.3233/FI-2016-1450,,cs.CC cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Each Boolean function can be computed by a single-pass instruction sequence
that contains only instructions to set and get the content of Boolean
registers, forward jump instructions, and a termination instruction. Auxiliary
Boolean registers are not necessary for this. In the current paper, we show
that, in the case of the parity functions, shorter instruction sequences are
possible with the use of an auxiliary Boolean register in the presence of
instructions to complement the content of auxiliary Boolean registers. This
result supports, in a setting where programs are instruction sequences acting
on Boolean registers, a basic intuition behind the storage of auxiliary data,
namely the intuition that this makes possible a reduction of the size of a
program.
","[{'version': 'v1', 'created': 'Sun, 21 Dec 2014 14:29:29 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Jun 2015 07:44:17 GMT'}, {'version': 'v3', 'created': 'Sat, 28 May 2016 09:38:30 GMT'}, {'version': 'v4', 'created': 'Thu, 30 Jun 2016 08:29:13 GMT'}, {'version': 'v5', 'created': 'Fri, 15 Jul 2016 09:44:32 GMT'}]",2016-12-30,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['Boolean function family', 'instruction sequence size', 'non-uniform complexity measure', 'parity function']"
3135,1210.1935,Chung-Chieh Fang,Chung-Chieh Fang,"Saddle-Node Bifurcation Associated with Parasitic Inductor Resistance in
  Boost Converters",Minor revision from a manuscript dated in 2010,"Some parts of this manuscript are published in International
  Journal of Electronics, 100(8), pp. 1147-1174, Aug. 2013",10.1080/00207217.2012.743072,,cs.SY math.DS nlin.CD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Saddle-node bifurcation occurs in a boost converter when parasitic inductor
resistance is modeled. Closed-form critical conditions of the bifurcation are
derived. If the parasitic inductor resistance is modeled, the saddle-node
bifurcation occurs in the voltage mode control or in the current mode control
with the voltage loop closed, but not in the current mode control with the
voltage loop open. If the parasitic inductor resistance is not modeled, the
saddle-node bifurcation does not occur, and one may be misled by the wrong
dynamics and the wrong steady-state solutions. The saddle-node bifurcation
still exists even in a boost converter with a popular type-III compensator.
When the saddle-node bifurcation occurs, multiple steady-state solutions may
coexist. The converter may operate with a voltage jump from one solution to
another. Care should be taken in the compensator design to ensure that only the
desired solution is stabilized. In industry practice, the solution with a
higher duty cycle (and thus the saddle-node bifurcation) may be prevented by
placing a limitation on the maximum duty cycle.
","[{'version': 'v1', 'created': 'Sat, 6 Oct 2012 08:56:46 GMT'}]",2015-08-18,"[['Fang', 'Chung-Chieh', '']]","['DC-DC power conversion', 'voltage mode control', 'current mode control', 'parasiticresistance', 'saddle-node bifurcation']"
3136,1211.0886,Brent Jason Lance,"Brent J. Lance, Scott E. Kerick, Anthony J. Ries, Kelvin S. Oie, Kaleb
  McDowell",Brain Computer Interface Technologies in the Coming Decades,"41 pages, 3 figures","Proceedings of the IEEE, vol.100, no.Special Centennial Issue,
  pp.1585-1599, May 13 2012",10.1109/JPROC.2012.2184830,,cs.HC cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As the proliferation of technology dramatically infiltrates all aspects of
modern life, in many ways the world is becoming so dynamic and complex that
technological capabilities are overwhelming human capabilities to optimally
interact with and leverage those technologies. Fortunately, these technological
advancements have also driven an explosion of neuroscience research over the
past several decades, presenting engineers with a remarkable opportunity to
design and develop flexible and adaptive brain-based neurotechnologies that
integrate with and capitalize on human capabilities and limitations to improve
human-system interactions. Major forerunners of this conception are
brain-computer interfaces (BCIs), which to this point have been largely focused
on improving the quality of life for particular clinical populations and
include, for example, applications for advanced communications with paralyzed
or locked in patients as well as the direct control of prostheses and
wheelchairs. Near-term applications are envisioned that are primarily task
oriented and are targeted to avoid the most difficult obstacles to development.
In the farther term, a holistic approach to BCIs will enable a broad range of
task-oriented and opportunistic applications by leveraging pervasive
technologies and advanced analytical approaches to sense and merge critical
brain, behavioral, task, and environmental information. Communications and
other applications that are envisioned to be broadly impacted by BCIs are
highlighted; however, these represent just a small sample of the potential of
these technologies.
","[{'version': 'v1', 'created': 'Mon, 5 Nov 2012 15:13:45 GMT'}]",2012-11-06,"[['Lance', 'Brent J.', ''], ['Kerick', 'Scott E.', ''], ['Ries', 'Anthony J.', ''], ['Oie', 'Kelvin S.', ''], ['McDowell', 'Kaleb', '']]","['EEG', 'Brain-Computer Interface', 'Human-Computer Interaction', 'Pervasive']"
3137,1801.01733,Purushottam Dixit,Purushottam D. Dixit,"Entropy production rate as a criterion for inconsistency in decision
  theory",To appear in Journal of Statistical Physics,,10.1088/1742-5468/aac137,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Individual and group decisions are complex, often involving choosing an apt
alternative from a multitude of options. Evaluating pairwise comparisons breaks
down such complex decision problems into tractable ones. Pairwise comparison
matrices (PCMs) are regularly used to solve multiple-criteria decision-making
(MCDM) problems, for example, using Saaty's analytic hierarchy process (AHP)
framework. However, there are two significant drawbacks of using PCMs. First,
humans evaluate PCMs in an inconsistent manner. Second, not all entries of a
large PCM can be reliably filled by human decision makers. We address these two
issues by first establishing a novel connection between PCMs and
time-irreversible Markov processes. Specifically, we show that every PCM
induces a family of dissipative maximum path entropy random walks (MERW) over
the set of alternatives. We show that only `consistent' PCMs correspond to
detailed balanced MERWs. We identify the non-equilibrium entropy production in
the induced MERWs as a metric of inconsistency of the underlying PCMs. Notably,
the entropy production satisfies all of the recently laid out criteria for
reasonable consistency indices. We also propose an approach to use incompletely
filled PCMs in AHP. Potential future avenues are discussed as well.
  keywords: analytic hierarchy process, markov chains, maximum entropy
","[{'version': 'v1', 'created': 'Fri, 5 Jan 2018 12:06:56 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Apr 2018 14:18:07 GMT'}]",2018-06-13,"[['Dixit', 'Purushottam D.', '']]","['analytic hierarchy process', 'markov chains', 'maximum entropy']"
3138,1808.02056,Xiang Li,"Jiasha Liu, Xiang Li, Hui Ren, Quanzheng Li","Multi-Estimator Full Left Ventricle Quantification through Ensemble
  Learning","Jiasha Liu, Xiang Li and Hui Ren contribute equally to this work",,10.1007/978-3-030-12029-0_49,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cardiovascular disease accounts for 1 in every 4 deaths in United States.
Accurate estimation of structural and functional cardiac parameters is crucial
for both diagnosis and disease management. In this work, we develop an ensemble
learning framework for more accurate and robust left ventricle (LV)
quantification. The framework combines two 1st-level modules: direct estimation
module and a segmentation module. The direct estimation module utilizes
Convolutional Neural Network (CNN) to achieve end-to-end quantification. The
CNN is trained by taking 2D cardiac images as input and cardiac parameters as
output. The segmentation module utilizes a U-Net architecture for obtaining
pixel-wise prediction of the epicardium and endocardium of LV from the
background. The binary U-Net output is then analyzed by a separate CNN for
estimating the cardiac parameters. We then employ linear regression between the
1st-level predictor and ground truth to learn a 2nd-level predictor that
ensembles the results from 1st-level modules for the final estimation.
Preliminary results by testing the proposed framework on the LVQuan18 dataset
show superior performance of the ensemble learning model over the two base
modules.
","[{'version': 'v1', 'created': 'Mon, 6 Aug 2018 18:25:46 GMT'}]",2021-03-24,"[['Liu', 'Jiasha', ''], ['Li', 'Xiang', ''], ['Ren', 'Hui', ''], ['Li', 'Quanzheng', '']]","['segmentation', 'direct estimation', 'ensemble learning']"
3139,1907.06826,Yulong Cao,"Yulong Cao, Chaowei Xiao, Benjamin Cyr, Yimeng Zhou, Won Park, Sara
  Rampazzi, Qi Alfred Chen, Kevin Fu, Z. Morley Mao","Adversarial Sensor Attack on LiDAR-based Perception in Autonomous
  Driving","Accepted at the ACM Conference on Computer and Communications
  Security (CCS), 2019",,10.1145/3319535.3339815,,cs.CR cs.CV eess.SP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Autonomous Vehicles (AVs), one fundamental pillar is perception, which
leverages sensors like cameras and LiDARs (Light Detection and Ranging) to
understand the driving environment. Due to its direct impact on road safety,
multiple prior efforts have been made to study its the security of perception
systems. In contrast to prior work that concentrates on camera-based
perception, in this work we perform the first security study of LiDAR-based
perception in AV settings, which is highly important but unexplored. We
consider LiDAR spoofing attacks as the threat model and set the attack goal as
spoofing obstacles close to the front of a victim AV. We find that blindly
applying LiDAR spoofing is insufficient to achieve this goal due to the machine
learning-based object detection process. Thus, we then explore the possibility
of strategically controlling the spoofed attack to fool the machine learning
model. We formulate this task as an optimization problem and design modeling
methods for the input perturbation function and the objective function. We also
identify the inherent limitations of directly solving the problem using
optimization and design an algorithm that combines optimization and global
sampling, which improves the attack success rates to around 75%. As a case
study to understand the attack impact at the AV driving decision level, we
construct and evaluate two attack scenarios that may damage road safety and
mobility. We also discuss defense directions at the AV system, sensor, and
machine learning model levels.
","[{'version': 'v1', 'created': 'Tue, 16 Jul 2019 04:00:56 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Aug 2019 13:26:03 GMT'}]",2019-08-21,"[['Cao', 'Yulong', ''], ['Xiao', 'Chaowei', ''], ['Cyr', 'Benjamin', ''], ['Zhou', 'Yimeng', ''], ['Park', 'Won', ''], ['Rampazzi', 'Sara', ''], ['Chen', 'Qi Alfred', ''], ['Fu', 'Kevin', ''], ['Mao', 'Z. Morley', '']]","['Adversarial machine learning', 'Sensor attack', 'Autonomous driving']"
3140,1810.12624,Ciriaco Andrea D'Angelo,"Giovanni Abramo, Ciriaco Andrea D'Angelo, Anastasiia Soldatenkova","An investigation on the skewness patterns and fractal nature of research
  productivity distributions at field and discipline level",,"Abramo, G., D'Angelo, C.A., Soldatenkova, A. (2017). An
  investigation on the skewness patterns and fractal nature of research
  productivity distributions at field and discipline level. Journal of
  Informetrics, 11(1), 324-335",10.1016/j.joi.2017.02.001,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper provides an empirical examination of how research productivity
distributions differ across scientific fields and disciplines. Productivity is
measured using the FSS indicator, which embeds both quantity and impact of
output. The population studied consists of over 31,000 scientists in 180 fields
(10 aggregate disciplines) of a national research system. The Characteristic
Scores and Scale technique is used to investigate the distribution patterns for
the different fields and disciplines. Research productivity distributions are
found to be asymmetrical at the field level, although the degree of skewness
varies substantially among the fields within the aggregate disciplines. We also
examine whether the field productivity distributions show a fractal nature,
which reveals an exception more than a rule. Differently, for the disciplines,
the partitions of the distributions show skewed patterns that are highly
similar.
","[{'version': 'v1', 'created': 'Tue, 30 Oct 2018 10:17:10 GMT'}]",2018-10-31,"[['Abramo', 'Giovanni', ''], [""D'Angelo"", 'Ciriaco Andrea', ''], ['Soldatenkova', 'Anastasiia', '']]","['Bibliometrics', 'research evaluation', 'FSS', 'Italy', 'CSS']"
3141,0912.3461,Susan Khor,Susan Khor,Application of Graph Coloring to Biological Networks,,"IET Syst. Biol. -- May 2010 -- Volume 4, Issue 3, p.185-192",10.1049/iet-syb.2009.0038,,cs.CE q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore the application of graph coloring to biological networks,
specifically protein-protein interaction (PPI) networks. First, we find that
given similar conditions (i.e. number of nodes, number of links, degree
distribution and clustering), fewer colors are needed to color disassortative
(high degree nodes tend to connect to low degree nodes and vice versa) than
assortative networks. Fewer colors create fewer independent sets which in turn
imply higher concurrency potential for a network. Since PPI networks tend to be
disassortative, we suggest that in addition to functional specificity and
stability proposed previously by Maslov and Sneppen (Science 296, 2002), the
disassortative nature of PPI networks may promote the ability of cells to
perform multiple, crucial and functionally diverse tasks concurrently. Second,
since graph coloring is closely related to the presence of cliques in a graph,
the significance of node coloring information to the problem of identifying
protein complexes, i.e. dense subgraphs in a PPI network, is investigated. We
find that for PPI networks where 1% to 11% of nodes participate in at least one
identified protein complex, such as H. sapien (DIP20070219, DIP20081014 and
HPRD070609), DSATUR (a well-known complete graph coloring algorithm) node
coloring information can improve the quality (homogeneity and separation) of
initial candidate complexes. This finding may help to improve existing protein
complex detection methods, and/or suggest new methods.
","[{'version': 'v1', 'created': 'Thu, 17 Dec 2009 17:01:13 GMT'}]",2010-05-25,"[['Khor', 'Susan', '']]","['graph coloring', 'biological networks', 'degree-degree correlation', 'concurrency', 'protein']"
3142,1309.2690,Eleazar Chukwuka Mr,Eleazar Chukwuka and Kamran Arshad,Energt Efficient MAC Protocols for Wireless Sensor Network: A Survey,16 pages,,10.5121/ijwmn.2013.5406,,cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless Sensor Network (WSN) is an attractive choice for a variety of
applications as no wired infrastructure is needed. Other wireless networks are
not as energy constrained as WSNs, because they may be plugged into the mains
supply or equipped with batteries that are rechargeable and replaceable. Among
others, one of the main sources of energy depletion in WSN is communications
controlled by the Medium Access Control (MAC) protocols. An extensive survey of
energy efficient MAC protocols is presented in this article. We categorise WSN
MAC protocols in the following categories: controlled access (CA), random
access (RA), slotted protocols (SP) and hybrid protocols (HP). We further
discuss how energy efficient MAC protocols have developed from fixed sleep/wake
cycles through adaptive to dynamic cycles, thus becoming more responsive to
traffic load variations. Finally we present open research questions on MAC
layer design for WSNs in terms of energy efficiency
","[{'version': 'v1', 'created': 'Tue, 10 Sep 2013 23:20:26 GMT'}]",2013-09-12,"[['Chukwuka', 'Eleazar', ''], ['Arshad', 'Kamran', '']]","['Wireless sensor networks', 'MAC protocols', 'Energy conservation']"
3143,1211.4289,Loc Tran H,Loc Tran,"Application of three graph Laplacian based semi-supervised learning
  methods to protein function prediction problem","16 pages, 9 tables",,10.5121/ijbb.2013.3202,,cs.LG cs.CE q-bio.QM stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Protein function prediction is the important problem in modern biology. In
this paper, the un-normalized, symmetric normalized, and random walk graph
Laplacian based semi-supervised learning methods will be applied to the
integrated network combined from multiple networks to predict the functions of
all yeast proteins in these multiple networks. These multiple networks are
network created from Pfam domain structure, co-participation in a protein
complex, protein-protein interaction network, genetic interaction network, and
network created from cell cycle gene expression measurements. Multiple networks
are combined with fixed weights instead of using convex optimization to
determine the combination weights due to high time complexity of convex
optimization method. This simple combination method will not affect the
accuracy performance measures of the three semi-supervised learning methods.
Experiment results show that the un-normalized and symmetric normalized graph
Laplacian based methods perform slightly better than random walk graph
Laplacian based method for integrated network. Moreover, the accuracy
performance measures of these three semi-supervised learning methods for
integrated network are much better than the best accuracy performance measures
of these three methods for the individual network.
","[{'version': 'v1', 'created': 'Mon, 19 Nov 2012 02:59:14 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Dec 2012 11:36:19 GMT'}, {'version': 'v3', 'created': 'Thu, 11 Jul 2013 10:29:29 GMT'}]",2013-07-12,"[['Tran', 'Loc', '']]","['semi-supervised learning', 'graph Laplacian', 'yeast', 'protein', 'function']"
3144,1901.11440,Garrett Goodman,"William Romine, Tanvi Banerjee, Garrett Goodman","Toward Sensor-based Sleep Monitoring with Electrodermal Activity
  Measures","9 pages, 1 figure, 1 table, journal","Sensors 2019, 19(6), 1417",10.3390/s19061417,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We use self-report and electrodermal activity (EDA) wearable sensor data from
77 nights of sleep on six participants to test the efficacy of EDA data for
sleep monitoring. We used factor analysis to find latent factors in the EDA
data, and causal model search to find the most probable graphical model
accounting for self-reported sleep efficiency (SE), sleep quality (SQ), and the
latent EDA factors. Structural equation modeling was used to confirm fit of the
extracted graph. Based on the generated graph, logistic regression and naive
Bayes models were used to test the efficacy of the EDA data in predicting SE
and SQ. Six EDA features extracted from the total signal over a night's sleep
could be explained by two latent factors, EDA Magnitude and EDA Storms. EDA
Magnitude performed as a strong predictor for SE to aid detection of
substantial changes in time asleep. The performance of EDA Magnitured and SE in
classifying SQ showed promise for wearable sleep monitoring applications.
However, our data suggest that obtaining a more accurate sensor-based measure
of SE will be necessary before smaller changes in SQ can be detected from EDA
sensor data alone.
","[{'version': 'v1', 'created': 'Thu, 31 Jan 2019 16:00:32 GMT'}]",2019-03-26,"[['Romine', 'William', ''], ['Banerjee', 'Tanvi', ''], ['Goodman', 'Garrett', '']]","['wearable sensor', 'electrodermal activity', 'sleep', 'model search']"
3145,1311.0955,Eugene d'Eon,Eugene d'Eon,A Dual-Beam Method-of-Images 3D Searchlight BSSRDF,added clarifying text and 1 figure to illustrate the method,,10.1145/2614106.2614140,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a novel BSSRDF for rendering translucent materials. Angular
effects lacking in previous BSSRDF models are incorporated by using a dual-beam
formulation. We employ a Placzek's Lemma interpretation of the method of images
and discard diffusion theory. Instead, we derive a plane-parallel
transformation of the BSSRDF to form the associated BRDF and optimize the image
confiurations such that the BRDF is close to the known analytic solutions for
the associated albedo problem. This ensures reciprocity, accurate colors, and
provides an automatic level-of-detail transition for translucent objects that
appear at various distances in an image. Despite optimizing the subsurface
fluence in a plane-parallel setting, we find that this also leads to fairly
accurate fluence distributions throughout the volume in the original 3D
searchlight problem. Our method-of-images modifications can also improve the
accuracy of previous BSSRDFs.
","[{'version': 'v1', 'created': 'Tue, 5 Nov 2013 03:25:38 GMT'}, {'version': 'v2', 'created': 'Sat, 7 Dec 2013 04:17:37 GMT'}]",2021-02-19,"[[""d'Eon"", 'Eugene', '']]","['BSSRDF', 'translucent materials', 'multiple-scattering', 'searchlight problem', 'transport theory']"
3146,1610.00760,Dany Vohl,"Dany Vohl, David G. Barnes, Christopher J. Fluke, Govinda Poudel,
  Nellie Georgiou-Karistianis, Amr H. Hassan, Yuri Benovitski, Tsz Ho Wong,
  Owen Kaluza, Toan D. Nguyen, C. Paul Bonnington",Large-scale comparative visualisation of sets of multidimensional data,"26 pages, 11 figures, 5 tables. Accepted for publication in PeerJ
  Computer Science",,10.7717/peerj-cs.88,,cs.HC astro-ph.IM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present encube $-$ a qualitative, quantitative and comparative
visualisation and analysis system, with application to high-resolution,
immersive three-dimensional environments and desktop displays. encube extends
previous comparative visualisation systems by considering: 1) the integration
of comparative visualisation and analysis into a unified system; 2) the
documentation of the discovery process; and 3) an approach that enables
scientists to continue the research process once back at their desktop. Our
solution enables tablets, smartphones or laptops to be used as interaction
units for manipulating, organising, and querying data. We highlight the
modularity of encube, allowing additional functionalities to be included as
required. Additionally, our approach supports a high level of collaboration
within the physical environment. We show how our implementation of encube
operates in a large-scale, hybrid visualisation and supercomputing environment
using the CAVE2 at Monash University, and on a local desktop, making it a
versatile solution. We discuss how our approach can help accelerate the
discovery rate in a variety of research scenarios.
","[{'version': 'v1', 'created': 'Mon, 3 Oct 2016 21:25:05 GMT'}]",2016-10-07,"[['Vohl', 'Dany', ''], ['Barnes', 'David G.', ''], ['Fluke', 'Christopher J.', ''], ['Poudel', 'Govinda', ''], ['Georgiou-Karistianis', 'Nellie', ''], ['Hassan', 'Amr H.', ''], ['Benovitski', 'Yuri', ''], ['Wong', 'Tsz Ho', ''], ['Kaluza', 'Owen', ''], ['Nguyen', 'Toan D.', ''], ['Bonnington', 'C. Paul', '']]","['Scientific data visualisation', 'Comparative Visualisation', 'Tiled-display', 'Immersive environments', 'CAVE2']"
3147,1403.7257,EPTCS,"A.P. van der Meer (Nspyre), R. Kherrazi (Nspyre), M. Hamilton (Nspyre)","Using Formal Specifications to Support Model Based Testing ASDSpec: A
  Tool Combining the Best of Two Techniques","In Proceedings MBT 2014, arXiv:1403.7044","EPTCS 141, 2014, pp. 1-13",10.4204/EPTCS.141.1,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Formal methods and testing are two important approaches that assist in the
development of high quality software. For long time these approaches have been
seen as competitors and there was very little interaction between the two
communities. In recent years a new consensus has developed in which they are
seen as more complementary. In this report we present an approach based on the
ASD(Analytical Software Design) suite by Verum and the Microsoft Spec Explorer
Model Based Testing(MBT) tool. ASD is a model-based design approach that can
produce verified software components that can be combined into complete
systems. However, ASD cannot verify existing components, nor complex component
interactions involving data transfers. We have developed a tool that allows us
to convert ASD models to Spec Explorer, allowing us to do more complete
verification of software systems using dynamic testing at little additional
cost and effort. We demonstrate this by applying our approach to an
industrial-size case study.
","[{'version': 'v1', 'created': 'Fri, 28 Mar 2014 01:04:18 GMT'}]",2014-03-31,"[['van der Meer', 'A. P.', '', 'Nspyre'], ['Kherrazi', 'R.', '', 'Nspyre'], ['Hamilton', 'M.', '', 'Nspyre']]","['Model Based Testing', 'Formal Verification', 'Dynamic Testing', 'Static Verification', 'EMF', 'ASD', 'Spec Explorer']"
3148,1810.12553,Yuan Mao,"Yixiong Liang, Yuan Mao, Jiazhi Xia, Yao Xiang, Jianfeng Liu",Scale-Invariant Structure Saliency Selection for Fast Image Fusion,,,10.1016/j.neucom.2019.04.043,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a fast yet effective method for pixel-level
scale-invariant image fusion in spatial domain based on the scale-space theory.
Specifically, we propose a scale-invariant structure saliency selection scheme
based on the difference-of-Gaussian (DoG) pyramid of images to build the
weights or activity map. Due to the scale-invariant structure saliency
selection, our method can keep both details of small size objects and the
integrity information of large size objects in images. In addition, our method
is very efficient since there are no complex operation involved and easy to be
implemented and therefore can be used for fast high resolution images fusion.
Experimental results demonstrate the proposed method yields competitive or even
better results comparing to state-of-the-art image fusion methods both in terms
of visual quality and objective evaluation metrics. Furthermore, the proposed
method is very fast and can be used to fuse the high resolution images in
real-time. Code is available at https://github.com/yiqingmy/Fusion.
","[{'version': 'v1', 'created': 'Tue, 30 Oct 2018 07:22:21 GMT'}]",2020-01-20,"[['Liang', 'Yixiong', ''], ['Mao', 'Yuan', ''], ['Xia', 'Jiazhi', ''], ['Xiang', 'Yao', ''], ['Liu', 'Jianfeng', '']]","['scale-space theory', 'difference-of-Gaussian pyramid', 'scale-invariant saliency map', 'guided filtering']"
3149,1809.08325,Quirin Scheitle,"Quirin Scheitle, Oliver Gasser, Theodor Nolte, Johanna Amann, Lexi
  Brent, Georg Carle, Ralph Holz, Thomas C. Schmidt, Matthias W\""ahlisch","The Rise of Certificate Transparency and Its Implications on the
  Internet Ecosystem",To be published at ACM IMC 2018,"Proceedings of the ACM Internet Measurement Conference (IMC), pp.
  343-349, 2018",10.1145/3278532.3278562,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we analyze the evolution of Certificate Transparency (CT) over
time and explore the implications of exposing certificate DNS names from the
perspective of security and privacy. We find that certificates in CT logs have
seen exponential growth. Website support for CT has also constantly increased,
with now 33% of established connections supporting CT. With the increasing
deployment of CT, there are also concerns of information leakage due to all
certificates being visible in CT logs. To understand this threat, we introduce
a CT honeypot and show that data from CT logs is being used to identify targets
for scanning campaigns only minutes after certificate issuance. We present and
evaluate a methodology to learn and validate new subdomains from the vast
number of domains extracted from CT logged certificates.
","[{'version': 'v1', 'created': 'Fri, 21 Sep 2018 21:50:18 GMT'}]",2018-11-12,"[['Scheitle', 'Quirin', ''], ['Gasser', 'Oliver', ''], ['Nolte', 'Theodor', ''], ['Amann', 'Johanna', ''], ['Brent', 'Lexi', ''], ['Carle', 'Georg', ''], ['Holz', 'Ralph', ''], ['Schmidt', 'Thomas C.', ''], ['Wählisch', 'Matthias', '']]","['Certificate Transparency', 'Phishing', 'Honeypot']"
3150,1405.3556,Flavio Cruz,"Flavio Cruz, Ricardo Rocha, Seth Copen Goldstein and Frank Pfenning","A Linear Logic Programming Language for Concurrent Programming over
  Graph Structures","ICLP 2014, TPLP 2014",Theory and Practice of Logic Programming 14 (2014) 493-507,10.1017/S1471068414000167,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We have designed a new logic programming language called LM (Linear Meld) for
programming graph-based algorithms in a declarative fashion. Our language is
based on linear logic, an expressive logical system where logical facts can be
consumed. Because LM integrates both classical and linear logic, LM tends to be
more expressive than other logic programming languages. LM programs are
naturally concurrent because facts are partitioned by nodes of a graph data
structure. Computation is performed at the node level while communication
happens between connected nodes. In this paper, we present the syntax and
operational semantics of our language and illustrate its use through a number
of examples.
","[{'version': 'v1', 'created': 'Wed, 14 May 2014 16:02:41 GMT'}]",2020-02-19,"[['Cruz', 'Flavio', ''], ['Rocha', 'Ricardo', ''], ['Goldstein', 'Seth Copen', ''], ['Pfenning', 'Frank', '']]","['Language Design', 'Semantics', 'Linear Logic', 'Concurrent Programming', 'Graphs']"
3151,1002.3724,Francesco Silvestri,"Sara Nasso (1), Francesco Silvestri (1), Francesco Tisiot (1), Barbara
  Di Camillo (1), Andrea Pietracaprina (1) and Gianna Maria Toffolo (1) ((1)
  Department of Information Engineering, University of Padova)","An Optimized Data Structure for High Throughput 3D Proteomics Data:
  mzRTree","Paper details: 10 pages, 7 figures, 2 tables. To be published in
  Journal of Proteomics. Source code available at
  http://www.dei.unipd.it/mzrtree",Journal of Proteomics 73(6) (2010) 1176-1182,10.1016/j.jprot.2010.02.006,,cs.CE cs.DS q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As an emerging field, MS-based proteomics still requires software tools for
efficiently storing and accessing experimental data. In this work, we focus on
the management of LC-MS data, which are typically made available in standard
XML-based portable formats. The structures that are currently employed to
manage these data can be highly inefficient, especially when dealing with
high-throughput profile data. LC-MS datasets are usually accessed through 2D
range queries. Optimizing this type of operation could dramatically reduce the
complexity of data analysis. We propose a novel data structure for LC-MS
datasets, called mzRTree, which embodies a scalable index based on the R-tree
data structure. mzRTree can be efficiently created from the XML-based data
formats and it is suitable for handling very large datasets. We experimentally
show that, on all range queries, mzRTree outperforms other known structures
used for LC-MS data, even on those queries these structures are optimized for.
Besides, mzRTree is also more space efficient. As a result, mzRTree reduces
data analysis computational costs for very large profile datasets.
","[{'version': 'v1', 'created': 'Fri, 19 Feb 2010 17:17:02 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Feb 2010 08:18:47 GMT'}]",2010-04-27,"[['Nasso', 'Sara', ''], ['Silvestri', 'Francesco', ''], ['Tisiot', 'Francesco', ''], ['Di Camillo', 'Barbara', ''], ['Pietracaprina', 'Andrea', ''], ['Toffolo', 'Gianna Maria', '']]","['proteomic data formats', 'R-tree; profile data', 'scalability', 'massive dataset']"
3152,2007.02135,Indika Kumara Weerasingha Dewage,"Indika Kumara and Zoe Vasileiou and Georgios Meditskos and Damian A.
  Tamburri and Willem-Jan Van Den Heuvel and Anastasios Karakostas and Stefanos
  Vrochidis and Ioannis Kompatsiaris",Towards Semantic Detection of Smells in Cloud Infrastructure Code,"5 pages, 6 figures. The 10 th International Conference on Web
  Intelligence, Mining and Semantics (WIMS 2020)","In The 10th International Conference on Web Intelligence, Mining
  and Semantics (WIMS 2020), June 30-July 3, 2020, Biarritz, France. ACM, New
  York, NY, USA, 5 pages",10.1145/3405962.3405979,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated deployment and management of Cloud applications relies on
descriptions of their deployment topologies, often referred to as
Infrastructure Code. As the complexity of applications and their deployment
models increases, developers inadvertently introduce software smells to such
code specifications, for instance, violations of good coding practices, modular
structure, and more. This paper presents a knowledge-driven approach enabling
developers to identify the aforementioned smells in deployment descriptions. We
detect smells with SPARQL-based rules over pattern-based OWL 2 knowledge graphs
capturing deployment models. We show the feasibility of our approach with a
prototype and three case studies.
","[{'version': 'v1', 'created': 'Sat, 4 Jul 2020 16:29:54 GMT'}]",2020-07-07,"[['Kumara', 'Indika', ''], ['Vasileiou', 'Zoe', ''], ['Meditskos', 'Georgios', ''], ['Tamburri', 'Damian A.', ''], ['Heuvel', 'Willem-Jan Van Den', ''], ['Karakostas', 'Anastasios', ''], ['Vrochidis', 'Stefanos', ''], ['Kompatsiaris', 'Ioannis', '']]","['Infrastructure Code', 'Cloud Computing', 'OWL 2', 'Infrastructure Code Smells', 'Defects', 'TOSCA', 'Deployment']"
3153,1904.01508,Stavros Shiaeles Dr,"Michael Siracusano, Stavros Shiaeles, Bogdan Ghita",Detection of LDDoS Attacks Based on TCP Connection Parameters,,,10.1109/GIIS.2018.8635701,,cs.NI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Low-rate application layer distributed denial of service (LDDoS) attacks are
both powerful and stealthy. They force vulnerable webservers to open all
available connections to the adversary, denying resources to real users.
Mitigation advice focuses on solutions that potentially degrade quality of
service for legitimate connections. Furthermore, without accurate detection
mechanisms, distributed attacks can bypass these defences. A methodology for
detection of LDDoS attacks, based on characteristics of malicious TCP flows, is
proposed within this paper. Research will be conducted using combinations of
two datasets: one generated from a simulated network, the other from the
publically available CIC DoS dataset. Both contain the attacks slowread,
slowheaders and slowbody, alongside legitimate web browsing. TCP flow features
are extracted from all connections. Experimentation was carried out using six
supervised AI algorithms to categorise attack from legitimate flows. Decision
trees and k-NN accurately classified up to 99.99% of flows, with exceptionally
low false positive and false negative rates, demonstrating the potential of AI
in LDDoS detection.
","[{'version': 'v1', 'created': 'Tue, 12 Mar 2019 16:56:17 GMT'}]",2019-04-03,"[['Siracusano', 'Michael', ''], ['Shiaeles', 'Stavros', ''], ['Ghita', 'Bogdan', '']]","['DoS', 'LDoS', 'LDDoS', 'Distributed Denial of']"
3154,1210.2089,Perry Nicolas,"Alain Bernard (IRCCyN), Jean-Charles Delplace (Cetim), Nicolas Perry
  (IRCCyN), Serge Gabriel",Integration of CAD and rapid manufacturing for sand casting optimisation,,,10.1108/13552540310502220,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to reduce the time and costs of the products development in the sand
casting process, the SMC Colombier Fontaine company has carried out a study
based on tooling manufacturing with a new rapid prototyping process. This
evolution allowed the adequacy of the geometry used for the simulation to the
tooling employed physically in the production. This allowed a reduction of the
wall thickness to 4mm and retained reliable manufacturing process.
","[{'version': 'v1', 'created': 'Sun, 7 Oct 2012 18:32:04 GMT'}]",2012-10-09,"[['Bernard', 'Alain', '', 'IRCCyN'], ['Delplace', 'Jean-Charles', '', 'Cetim'], ['Perry', 'Nicolas', '', 'IRCCyN'], ['Gabriel', 'Serge', '']]","['CAD', 'Sand casting', 'Simulation', 'Rapid']"
3155,1409.6873,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",Probabilistic thread algebra,"25 pages (arXiv admin note: text overlap with arXiv:1408.2955,
  arXiv:1402.4950); some simplifications made; substantially revised","Scientific Annals of Computer Science 25(2):211--243, 2015",10.7561/SACS.2015.2.211,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We add probabilistic features to basic thread algebra and its extensions with
thread-service interaction and strategic interleaving. Here, threads represent
the behaviours produced by instruction sequences under execution and services
represent the behaviours exhibited by the components of execution environments
of instruction sequences. In a paper concerned with probabilistic instruction
sequences, we proposed several kinds of probabilistic instructions and gave an
informal explanation for each of them. The probabilistic features added to the
extension of basic thread algebra with thread-service interaction make it
possible to give a formal explanation in terms of non-probabilistic
instructions and probabilistic services. The probabilistic features added to
the extensions of basic thread algebra with strategic interleaving make it
possible to cover strategies corresponding to probabilistic scheduling
algorithms.
","[{'version': 'v1', 'created': 'Wed, 24 Sep 2014 09:43:39 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Sep 2014 10:54:08 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Jul 2015 10:06:30 GMT'}]",2016-02-05,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['basic thread algebra', 'probabilistic thread', 'probabilistic service', 'probabilistic interleaving strategy', 'probabilistic instruction']"
3156,1709.02767,Lu-Xing Yang,"Cheng Pan, Lu-Xing Yang, Xiaofan Yang, Yingbo Wu, Yuan Yan Tang",A cost-effective rumor-containing strategy,,,10.1016/j.physa.2018.02.025,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the issue of suppressing a rumor using the truth in a
cost-effective way. First, an individual-level dynamical model capturing the
rumor-truth mixed spreading processes is proposed. On this basis, the
cost-effective rumor-containing problem is modeled as an optimization problem.
Extensive experiments show that finding a cost-effective rumor-containing
strategy boils down to enhancing the first truth-spreading rate until the cost
effectiveness of the rumor-containing strategy reaches the first turning point.
This finding greatly reduces the time spent for solving the optimization
problem. The influences of different factors on the optimal cost effectiveness
of a rumor-containing strategy are examined through computer simulations. We
believe our findings help suppress rumors in a cost-effective way. To our
knowledge, this is the first time the rumor-containing problem is treated this
way.
","[{'version': 'v1', 'created': 'Fri, 8 Sep 2017 16:32:08 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Dec 2017 08:41:52 GMT'}]",2018-04-04,"[['Pan', 'Cheng', ''], ['Yang', 'Lu-Xing', ''], ['Yang', 'Xiaofan', ''], ['Wu', 'Yingbo', ''], ['Tang', 'Yuan Yan', '']]","['Rumor containment', 'rumor-truth mixed spreading model', 'effectiveness', 'cost', 'constrained optimization']"
3157,1505.03084,AbdelRahim Elmadany,"AbdelRahim A. Elmadany, Sherif M. Abdou, Mervat Gheith","A Survey of Arabic Dialogues Understanding for Spontaneous Dialogues and
  Instant Message",,"International Journal on Natural Language Computing (IJNLC) Vol.
  4, No.2,April 2015",10.5121/ijnlc.2015.4206,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Building dialogues systems interaction has recently gained considerable
attention, but most of the resources and systems built so far are tailored to
English and other Indo-European languages. The need for designing systems for
other languages is increasing such as Arabic language. For this reasons, there
are more interest for Arabic dialogue acts classification task because it a key
player in Arabic language understanding to building this systems. This paper
surveys different techniques for dialogue acts classification for Arabic. We
describe the main existing techniques for utterances segmentations and
classification, annotation schemas, and test corpora for Arabic dialogues
understanding that have introduced in the literature
","[{'version': 'v1', 'created': 'Tue, 12 May 2015 16:38:39 GMT'}]",2015-05-13,"[['Elmadany', 'AbdelRahim A.', ''], ['Abdou', 'Sherif M.', ''], ['Gheith', 'Mervat', '']]","['Arabic Natural Language Processing', 'Dialogue Acts', 'Spoken Dialogue Acts', 'Dialogue language understanding', 'Arabic Dialogue corpora   1']"
3158,2102.04925,Chuhan Wu,"Chuhan Wu, Fangzhao Wu, Yang Cao, Yongfeng Huang, Xing Xie","FedGNN: Federated Graph Neural Network for Privacy-Preserving
  Recommendation",,,10.1038/s41467-022-30714-9,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Graph neural network (GNN) is widely used for recommendation to model
high-order interactions between users and items. Existing GNN-based
recommendation methods rely on centralized storage of user-item graphs and
centralized model learning. However, user data is privacy-sensitive, and the
centralized storage of user-item graphs may arouse privacy concerns and risk.
In this paper, we propose a federated framework for privacy-preserving
GNN-based recommendation, which can collectively train GNN models from
decentralized user data and meanwhile exploit high-order user-item interaction
information with privacy well protected. In our method, we locally train GNN
model in each user client based on the user-item graph inferred from the local
user-item interaction data. Each client uploads the local gradients of GNN to a
server for aggregation, which are further sent to user clients for updating
local GNN models. Since local gradients may contain private information, we
apply local differential privacy techniques to the local gradients to protect
user privacy. In addition, in order to protect the items that users have
interactions with, we propose to incorporate randomly sampled items as pseudo
interacted items for anonymity. To incorporate high-order user-item
interactions, we propose a user-item graph expansion method that can find
neighboring users with co-interacted items and exchange their embeddings for
expanding the local user-item graphs in a privacy-preserving way. Extensive
experiments on six benchmark datasets validate that our approach can achieve
competitive results with existing centralized GNN-based recommendation methods
and meanwhile effectively protect user privacy.
","[{'version': 'v1', 'created': 'Tue, 9 Feb 2021 16:30:53 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Mar 2021 08:27:46 GMT'}]",2022-10-12,"[['Wu', 'Chuhan', ''], ['Wu', 'Fangzhao', ''], ['Cao', 'Yang', ''], ['Huang', 'Yongfeng', ''], ['Xie', 'Xing', '']]","['Personalized recommendation', 'Graph neural network', 'Privacypreserving', 'Federated learning']"
3159,1812.04611,Bernhard von Stengel,"Bharat Adsul, Jugal Garg, Ruta Mehta, Milind Sohoni, Bernhard von
  Stengel",Fast Algorithms for Rank-1 Bimatrix Games,"New in v4: detailed comparison with Theobald (2009) on page 6.
  Footnotes removed. Final version accepted by OPERATIONS RESEARCH","Operations Research, Articles in Advance 04 Jun 2020",10.1287/opre.2020.1981,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rank of a bimatrix game is the matrix rank of the sum of the two payoff
matrices. This paper comprehensively analyzes games of rank one, and shows the
following: (1) For a game of rank r, the set of its Nash equilibria is the
intersection of a generically one-dimensional set of equilibria of
parameterized games of rank r-1 with a hyperplane. (2) One equilibrium of a
rank-1 game can be found in polynomial time. (3) All equilibria of a rank-1
game can be found by following a piecewise linear path. In contrast, such a
path-following method finds only one equilibrium of a bimatrix game. (4) The
number of equilibria of a rank-1 game may be exponential. (5) There is a
homeomorphism between the space of bimatrix games and their equilibrium
correspondence that preserves rank. It is a variation of the homeomorphism used
for the concept of strategic stability of an equilibrium component.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2018 18:52:37 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Jan 2019 17:13:44 GMT'}, {'version': 'v3', 'created': 'Tue, 20 Aug 2019 13:42:23 GMT'}, {'version': 'v4', 'created': 'Sun, 22 Dec 2019 22:30:08 GMT'}]",2020-06-16,"[['Adsul', 'Bharat', ''], ['Garg', 'Jugal', ''], ['Mehta', 'Ruta', ''], ['Sohoni', 'Milind', ''], ['von Stengel', 'Bernhard', '']]","['bimatrix game', 'Nash equilibrium', 'rank-1 game', 'polynomialtime algorithm', 'homeomorphism']"
3160,1907.07075,Alexander Hagg,"Alexander Hagg, Martin Zaefferer, J\""org Stork, Adam Gaier",Prediction of neural network performance by phenotypic modeling,,,10.1145/3319619.3326815,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Surrogate models are used to reduce the burden of expensive-to-evaluate
objective functions in optimization. By creating models which map genomes to
objective values, these models can estimate the performance of unknown inputs,
and so be used in place of expensive objective functions. Evolutionary
techniques such as genetic programming or neuroevolution commonly alter the
structure of the genome itself. A lack of consistency in the genotype is a
fatal blow to data-driven modeling techniques: interpolation between points is
impossible without a common input space. However, while the dimensionality of
genotypes may differ across individuals, in many domains, such as controllers
or classifiers, the dimensionality of the input and output remains constant. In
this work we leverage this insight to embed differing neural networks into the
same input space. To judge the difference between the behavior of two neural
networks, we give them both the same input sequence, and examine the difference
in output. This difference, the phenotypic distance, can then be used to
situate these networks into a common input space, allowing us to produce
surrogate models which can predict the performance of neural networks
regardless of topology. In a robotic navigation task, we show that models
trained using this phenotypic embedding perform as well or better as those
trained on the weight values of a fixed topology neural network. We establish
such phenotypic surrogate models as a promising and flexible approach which
enables surrogate modeling even for representations that undergo structural
changes.
","[{'version': 'v1', 'created': 'Tue, 16 Jul 2019 15:37:51 GMT'}]",2019-07-17,"[['Hagg', 'Alexander', ''], ['Zaefferer', 'Martin', ''], ['Stork', 'Jörg', ''], ['Gaier', 'Adam', '']]","['Surrogate Models', 'Neural Networks', 'Distance Metrics']"
3161,2102.08235,Fannie Liu,"Fannie Liu, Chunjong Park, Yu Jiang Tham, Tsung-Yu Tsai, Laura
  Dabbish, Geoff Kaufman and Andr\'es Monroy-Hern\'andez",Significant Otter: Understanding the Role of Biosignals in Communication,"CHI Conference on Human Factors in Computing Systems (CHI '21), May
  8--13, 2021, Yokohama, Japan",,10.1145/3411764.3445200,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  With the growing ubiquity of wearable devices, sensed physiological responses
provide new means to connect with others. While recent research demonstrates
the expressive potential for biosignals, the value of sharing these personal
data remains unclear. To understand their role in communication, we created
Significant Otter, an Apple Watch/iPhone app that enables romantic partners to
share and respond to each other's biosignals in the form of animated otter
avatars. In a one-month study with 20 couples, participants used Significant
Otter with biosignals sensing OFF and ON. We found that while sensing OFF
enabled couples to keep in touch, sensing ON enabled easier and more authentic
communication that fostered social connection. However, the addition of
biosignals introduced concerns about autonomy and agency over the messages they
sent. We discuss design implications and future directions for communication
systems that recommend messages based on biosignals.
","[{'version': 'v1', 'created': 'Tue, 16 Feb 2021 15:48:53 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Apr 2021 20:43:07 GMT'}]",2021-04-19,"[['Liu', 'Fannie', ''], ['Park', 'Chunjong', ''], ['Tham', 'Yu Jiang', ''], ['Tsai', 'Tsung-Yu', ''], ['Dabbish', 'Laura', ''], ['Kaufman', 'Geoff', ''], ['Monroy-Hernández', 'Andrés', '']]","['computer-mediated communication', 'biosignals', 'interpersonal communication', 'social connection', 'smartwatches', 'heart rate', 'couples']"
3162,1701.08088,Jerome Darmont,"Hadj Mahboubi (ERIC), J\'er\^ome Darmont (ERIC)",Query Performance Optimization in XML Data Warehouses,"arXiv admin note: substantial text overlap with arXiv:0809.1981,
  arXiv:0809.1963","E-Strategies for Resource Management Systems: Planning and
  Implementation, IGI Global, pp.232-253, 2010",10.4018/978-1-61692-016-6.ch014,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  XML data warehouses form an interesting basis for decision-support
applications that exploit complex data. However, native-XML database management
systems (DBMSs) currently bear limited performances and it is necessary to
research for ways to optimize them. In this chapter, we present two such
techniques. First, we propose a join index that is specifically adapted to the
multidimensional architecture of XML warehouses. It eliminates join operations
while preserving the information contained in the original warehouse. Second,
we present a strategy for selecting XML materialized views by clustering the
query workload. To validate these proposals, we measure the response time of a
set of decision-support XQueries over an XML data warehouse, with and without
using our optimization techniques. Our experimental results demonstrate their
efficiency, even when queries are complex and data are voluminous.
","[{'version': 'v1', 'created': 'Fri, 27 Jan 2017 15:53:04 GMT'}]",2017-01-30,"[['Mahboubi', 'Hadj', '', 'ERIC'], ['Darmont', 'Jérôme', '', 'ERIC']]","['XML data warehouses', 'XML join index', 'XML materialized view selection', 'XQuery']"
3163,1809.01847,Zuzana Majdisova,"Zuzana Majdisova, Vaclav Skala, Michal Smolik","Determination of Stationary Points and Their Bindings in Dataset using
  RBF Methods",,"In Computational and Statistical Methods in Intelligent Systems
  (CoMeSySo 2018), Vol.859 of Advances in Intelligent Systems and Computing
  series, pp.213-224, ISBN 978-3-030-00210-7, Springer, 2019",10.1007/978-3-030-00211-4_20,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stationary points of multivariable function which represents some surface
have an important role in many application such as computer vision, chemical
physics, etc. Nevertheless, the dataset describing the surface for which a
sampling function is not known is often given. Therefore, it is necessary to
propose an approach for finding the stationary points without knowledge of the
sampling function.
  In this paper, an algorithm for determining a set of stationary points of
given sampled surface and detecting the bindings between these stationary
points (such as stationary points lie on line segment, circle, etc.) is
presented. Our approach is based on the piecewise RBF interpolation of the
given dataset.
","[{'version': 'v1', 'created': 'Thu, 6 Sep 2018 07:06:47 GMT'}]",2018-09-07,"[['Majdisova', 'Zuzana', ''], ['Skala', 'Vaclav', ''], ['Smolik', 'Michal', '']]","['Stationary points', 'RBF interpolation', 'Shape parameter', 'Shape detection', 'Nearest neighbor']"
3164,1808.10596,Zhaochun Ren,"Xisen Jin, Wenqiang Lei, Zhaochun Ren, Hongshen Chen, Shangsong Liang,
  Yihong Zhao, Dawei Yin","Explicit State Tracking with Semi-Supervision for Neural Dialogue
  Generation",,"The 27th ACM International Conference on Information and Knowledge
  Management, 2018",10.1145/3269206.3271683,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The task of dialogue generation aims to automatically provide responses given
previous utterances. Tracking dialogue states is an important ingredient in
dialogue generation for estimating users' intention. However, the
\emph{expensive nature of state labeling} and the \emph{weak interpretability}
make the dialogue state tracking a challenging problem for both task-oriented
and non-task-oriented dialogue generation: For generating responses in
task-oriented dialogues, state tracking is usually learned from manually
annotated corpora, where the human annotation is expensive for training; for
generating responses in non-task-oriented dialogues, most of existing work
neglects the explicit state tracking due to the unlimited number of dialogue
states.
  In this paper, we propose the \emph{semi-supervised explicit dialogue state
tracker} (SEDST) for neural dialogue generation. To this end, our approach has
two core ingredients: \emph{CopyFlowNet} and \emph{posterior regularization}.
Specifically, we propose an encoder-decoder architecture, named
\emph{CopyFlowNet}, to represent an explicit dialogue state with a
probabilistic distribution over the vocabulary space. To optimize the training
procedure, we apply a posterior regularization strategy to integrate indirect
supervision. Extensive experiments conducted on both task-oriented and
non-task-oriented dialogue corpora demonstrate the effectiveness of our
proposed model. Moreover, we find that our proposed semi-supervised dialogue
state tracker achieves a comparable performance as state-of-the-art supervised
learning baselines in state tracking procedure.
","[{'version': 'v1', 'created': 'Fri, 31 Aug 2018 04:27:41 GMT'}]",2018-09-03,"[['Jin', 'Xisen', ''], ['Lei', 'Wenqiang', ''], ['Ren', 'Zhaochun', ''], ['Chen', 'Hongshen', ''], ['Liang', 'Shangsong', ''], ['Zhao', 'Yihong', ''], ['Yin', 'Dawei', '']]","['Dialogue generation', 'Dialogue state tracking', 'Semi-supervised learning', 'Posterior regularization']"
3165,1608.00798,Xianwen Wang,"Xianwen Wang, Zhichao Fang and Xinhui Guo",Tracking the Digital Footprints to Scholarly Articles from Social Media,"16 pages, 9 figures, Scientometrics, 2016",,10.1007/s11192-016-2086-z,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scholarly articles are discussed and shared on social media, which generates
altmetrics. On the opposite side, what is the impact of social media on the
dissemination of scholarly articles and how to measure it? What are the
visiting patterns? Investigating these issues, the purpose of this study is to
seek a solution to fill the research gap, specifically, to explore the dynamic
visiting patterns directed by social media, and examine the effects of social
buzz on the article visits. Using the unique real referral data of 110
scholarly articles, which are daily updated in a 90-day period, this paper
proposes a novel method to make analysis. We find that visits from social media
are fast to accumulate but decay rapidly. Twitter and Facebook are the two most
important social referrals that directing people to scholarly articles, the two
are about the same and account for over 95% of the total social referral
directed visits. There is synchronism between tweets and tweets resulted
visits. Social media and open access are playing important roles in
disseminating scholarly articles and promoting public understanding science,
which are confirmed quantitatively for the first time with real data in this
study.
","[{'version': 'v1', 'created': 'Tue, 2 Aug 2016 12:59:31 GMT'}]",2016-08-03,"[['Wang', 'Xianwen', ''], ['Fang', 'Zhichao', ''], ['Guo', 'Xinhui', '']]","['Altmetrics', 'Social media', 'Twitter', 'Facebook', 'PeerJ', 'Public understanding science']"
3166,1503.07073,John Wickerson,"Mark Batty, Alastair F. Donaldson, and John Wickerson",Overhauling SC Atomics in C11 and OpenCL,"Published in the proceedings of the 43rd Annual ACM SIGPLAN-SIGACT
  Symposium on Principles of Programming Languages (POPL), 2016","ACM SIGPLAN Notices - POPL '16. Volume 51, Issue 1, January 2016",10.1145/2837614.2837637,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the conceptual simplicity of sequential consistency (SC), the
semantics of SC atomic operations and fences in the C11 and OpenCL memory
models is subtle, leading to convoluted prose descriptions that translate to
complex axiomatic formalisations. We conduct an overhaul of SC atomics in C11,
reducing the associated axioms in both number and complexity. A consequence of
our simplification is that the SC operations in an execution no longer need to
be totally ordered. This relaxation enables, for the first time, efficient and
exhaustive simulation of litmus tests that use SC atomics. We extend our
improved C11 model to obtain the first rigorous memory model formalisation for
OpenCL (which extends C11 with support for heterogeneous many-core
programming). In the OpenCL setting, we refine the SC axioms still further to
give a sensible semantics to SC operations that employ a 'memory scope' to
restrict their visibility to specific threads. Our overhaul requires slight
strengthenings of both the C11 and the OpenCL memory models, causing some
behaviours to become disallowed. We argue that these strengthenings are
natural, and that all of the formalised C11 and OpenCL compilation schemes of
which we are aware (Power and x86 CPUs for C11, AMD GPUs for OpenCL) remain
valid in our revised models. Using the Herd memory model simulator, we show
that our overhaul leads to an exponential improvement in simulation time for
C11 litmus tests compared with the original model, making exhaustive simulation
competitive, time-wise, with the non-exhaustive CDSChecker tool.
","[{'version': 'v1', 'created': 'Tue, 24 Mar 2015 15:23:16 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Jul 2015 09:15:29 GMT'}, {'version': 'v3', 'created': 'Wed, 16 Nov 2016 14:43:28 GMT'}]",2016-11-17,"[['Batty', 'Mark', ''], ['Donaldson', 'Alastair F.', ''], ['Wickerson', 'John', '']]","['Formal methods', 'graphics processing unit (GPU)', 'heterogeneous programming', 'HOL theorem prover', 'language design', 'program simulation', 'weak memory models']"
3167,1307.6930,Faisal Lone,"Faisal Rasheed Lone, Arjun Puri, Sudesh Kumar","Performance Comparison of Reed Solomon Code and BCH Code over Rayleigh
  Fading Channel","4 pages,3 figures,1 table. ""Published with International Journal of
  Computer Applications (IJCA)""","International Journal of Computer Applications 71(20):23-26, June
  2013",10.5120/12603-9397,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data transmission over a communication channel is prone to a number of
factors that can render the data unreliable or inconsistent by introducing
noise, crosstalk or various other disturbances. A mechanism has to be in place
that detects these anomalies in the received data and corrects it to get the
data back as it was meant to be sent by the sender. Over the years a number of
error detection and correction methodologies have been devised to send and
receive the data in a consistent and correct form. The best of these
methodologies ensure that the data is received correctly by the receiver in
minimum number of retransmissions. In this paper performance of Reed Solomon
Code (RS) and BCH Code is compared over Rayleigh fading channel.
","[{'version': 'v1', 'created': 'Fri, 26 Jul 2013 06:26:02 GMT'}]",2013-07-29,"[['Lone', 'Faisal Rasheed', ''], ['Puri', 'Arjun', ''], ['Kumar', 'Sudesh', '']]","['RS Code', 'BCH Code', 'Rayleigh Fading Channel', 'Modulation']"
3168,1901.10855,Alessandro Betti,"Alessandro Betti, Maria Luisa Lo Trovato, Fabio Salvatore Leonardi,
  Giuseppe Leotta, Fabrizio Ruffini and Ciro Lanzetta",Predictive Maintenance in Photovoltaic Plants with a Big Data Approach,"Preprint of the 33rd EUPVSEC Proceeding, 25-29 September 2017,
  Amsterdam. Plenary Presentation","33rd European Photovoltaic Solar Energy Conference and Exhibition
  (EUPVSEC), pages 1895-1900 (2017)",10.4229/EUPVSEC20172017-6DP.2.4,,cs.LG cs.SY stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel and flexible solution for fault prediction based
on data collected from SCADA system. Fault prediction is offered at two
different levels based on a data-driven approach: (a) generic fault/status
prediction and (b) specific fault class prediction, implemented by means of two
different machine learning based modules built on an unsupervised clustering
algorithm and a Pattern Recognition Neural Network, respectively. Model has
been assessed on a park of six photovoltaic (PV) plants up to 10 MW and on more
than one hundred inverter modules of three different technology brands. The
results indicate that the proposed method is effective in (a) predicting
incipient generic faults up to 7 days in advance with sensitivity up to 95% and
(b) anticipating damage of specific fault classes with times ranging from few
hours up to 7 days. The model is easily deployable for on-line monitoring of
anomalies on new PV plants and technologies, requiring only the availability of
historical SCADA and fault data, fault taxonomy and inverter electrical
datasheet. Keywords: Data Mining, Fault Prediction, Inverter Module, Key
Performance Indicator, Lost Production
","[{'version': 'v1', 'created': 'Tue, 29 Jan 2019 16:06:22 GMT'}]",2019-01-31,"[['Betti', 'Alessandro', ''], ['Trovato', 'Maria Luisa Lo', ''], ['Leonardi', 'Fabio Salvatore', ''], ['Leotta', 'Giuseppe', ''], ['Ruffini', 'Fabrizio', ''], ['Lanzetta', 'Ciro', '']]","['Data Mining', 'Fault Prediction', 'Inverter Module', 'Key Performance Indicator', 'Lost Production']"
3169,1707.04639,Richard Yang,"Richard R. Yang, Mike Borowczak","Predictive Liability Models and Visualizations of High Dimensional
  Retail Employee Data",,,10.1145/3194206.3195587,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Employee theft and dishonesty is a major contributor to loss in the retail
industry. Retailers have reported the need for more automated analytic tools to
assess the liability of their employees. In this work, we train and optimize
several machine learning models for regression prediction and analysis on this
data, which will help retailers identify and manage risky employees. Since the
data we use is very high dimensional, we use feature selection techniques to
identify the most contributing factors to an employee's assessed risk. We also
use dimension reduction and data embedding techniques to present this dataset
in a easy to interpret format.
","[{'version': 'v1', 'created': 'Fri, 14 Jul 2017 21:10:32 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Jan 2018 03:19:56 GMT'}, {'version': 'v3', 'created': 'Thu, 29 Mar 2018 01:59:19 GMT'}]",2018-03-30,"[['Yang', 'Richard R.', ''], ['Borowczak', 'Mike', '']]","['Retail liability assessment', 'Regression analysis', 'Feature selection', 'Data embedding']"
3170,2211.09568,Daniele Cono D'Elia,"Cristian Assaiante, Daniele Cono D'Elia, Giuseppe Antonio Di Luna and
  Leonardo Querzoni",Where Did My Variable Go? Poking Holes in Incomplete Debug Information,"Full online version (includes an Appendix not in the ASPLOS
  proceedings)","Proceedings of ASPLOS 2023 - 28th ACM International Conference on
  Architectural Support for Programming Languages and Operating Systems",,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The availability of debug information for optimized executables can largely
ease crucial tasks such as crash analysis. Source-level debuggers use this
information to display program state in terms of source code, allowing users to
reason on it even when optimizations alter program structure extensively. A few
recent endeavors have proposed effective methodologies for identifying
incorrect instances of debug information, which can mislead users by presenting
them with an inconsistent program state.
  In this work, we identify and study a related important problem: the
completeness of debug information. Unlike correctness issues for which an
unoptimized executable can serve as reference, we find there is no analogous
oracle to deem when the cause behind an unreported part of program state is an
unavoidable effect of optimization or a compiler implementation defect. In this
scenario, we argue that empirically derived conjectures on the expected
availability of debug information can serve as an effective means to expose
classes of these defects.
  We propose three conjectures involving variable values and study how often
synthetic programs compiled with different configurations of the popular gcc
and LLVM compilers deviate from them. We then discuss techniques to pinpoint
the optimizations behind such violations and minimize bug reports accordingly.
Our experiments revealed, among others, 24 bugs already confirmed by the
developers of the gcc-gdb and clang-lldb ecosystems.
","[{'version': 'v1', 'created': 'Thu, 17 Nov 2022 14:54:08 GMT'}]",2022-11-18,"[['Assaiante', 'Cristian', ''], [""D'Elia"", 'Daniele Cono', ''], ['Di Luna', 'Giuseppe Antonio', ''], ['Querzoni', 'Leonardo', '']]","['Debuggers', 'compiler bugs', 'compiler optimizations']"
3171,1505.03579,Stefano Salsano,"Stefano Salsano, Pier Luigi Ventre, Francesco Lombardo, Giuseppe
  Siracusano, Matteo Gerola, Elio Salvadori, Michele Santuari, Mauro
  Campanella, Luca Prete","Hybrid IP/SDN networking: open implementation and experiment management
  tools","Accepted for publication in IEEE Transaction of Network and Service
  Management - December 2015 http://dx.doi.org/10.1109/TNSM.2015.2507622",,10.1109/TNSM.2015.2507622,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The introduction of SDN in large-scale IP provider networks is still an open
issue and different solutions have been suggested so far. In this paper we
propose a hybrid approach that allows the coexistence of traditional IP routing
with SDN based forwarding within the same provider domain. The solution is
called OSHI - Open Source Hybrid IP/SDN networking as we have fully implemented
it combining and extending Open Source software. We discuss the OSHI system
architecture and the design and implementation of advanced services like Pseudo
Wires and Virtual Switches. In addition, we describe a set of Open Source
management tools for the emulation of the proposed solution using either the
Mininet emulator or distributed physical testbeds. We refer to this suite of
tools as Mantoo (Management tools). Mantoo includes an extensible web-based
graphical topology designer, which provides different layered network ""views""
(e.g. from physical links to service relationships among nodes). The suite can
validate an input topology, automatically deploy it over a Mininet emulator or
a distributed SDN testbed and allows access to emulated nodes by opening
consoles in the web GUI. Mantoo provides also tools to evaluate the performance
of the deployed nodes.
","[{'version': 'v1', 'created': 'Thu, 14 May 2015 00:27:12 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Oct 2015 11:08:05 GMT'}, {'version': 'v3', 'created': 'Wed, 2 Dec 2015 08:18:19 GMT'}, {'version': 'v4', 'created': 'Tue, 5 Jan 2016 17:31:40 GMT'}, {'version': 'v5', 'created': 'Wed, 6 Jan 2016 15:44:39 GMT'}]",2016-01-07,"[['Salsano', 'Stefano', ''], ['Ventre', 'Pier Luigi', ''], ['Lombardo', 'Francesco', ''], ['Siracusano', 'Giuseppe', ''], ['Gerola', 'Matteo', ''], ['Salvadori', 'Elio', ''], ['Santuari', 'Michele', ''], ['Campanella', 'Mauro', ''], ['Prete', 'Luca', '']]","['Software Defined Networking', 'Open Source', 'Network management tools', 'Emulation']"
3172,2105.07789,Lukas Drees,"Lukas Drees, Laura Verena Junker-Frohn, Jana Kierdorf, Ribana Roscher","Temporal Prediction and Evaluation of Brassica Growth in the Field using
  Conditional Generative Adversarial Networks","38 pages, 10 figures, 2 tables",Computers and Electronics in Agriculture 190 (2021) 106415,10.1016/j.compag.2021.106415,,cs.CV cs.LG cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Farmers frequently assess plant growth and performance as basis for making
decisions when to take action in the field, such as fertilization, weed
control, or harvesting. The prediction of plant growth is a major challenge, as
it is affected by numerous and highly variable environmental factors. This
paper proposes a novel monitoring approach that comprises high-throughput
imaging sensor measurements and their automatic analysis to predict future
plant growth. Our approach's core is a novel machine learning-based generative
growth model based on conditional generative adversarial networks, which is
able to predict the future appearance of individual plants. In experiments with
RGB time-series images of laboratory-grown Arabidopsis thaliana and field-grown
cauliflower plants, we show that our approach produces realistic, reliable, and
reasonable images of future growth stages. The automatic interpretation of the
generated images through neural network-based instance segmentation allows the
derivation of various phenotypic traits that describe plant growth.
","[{'version': 'v1', 'created': 'Mon, 17 May 2021 13:00:01 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Jan 2022 18:10:49 GMT'}]",2022-01-28,"[['Drees', 'Lukas', ''], ['Junker-Frohn', 'Laura Verena', ''], ['Kierdorf', 'Jana', ''], ['Roscher', 'Ribana', '']]","['generativeadversarialnetworks', 'agriculture', 'cauliflower', 'prediction', 'plant growth']"
3173,2004.11793,Thomas Vogel,"Ricardo Diniz Caldas (1 and 2), Arthur Rodrigues (2), Eric Bernd Gil
  (2), Gena\'ina Nunes Rodrigues (2), Thomas Vogel (3), Patrizio Pelliccione (1
  and 4) ((1) Chalmers | University of Gothenburg, Sweden, (2) University of
  Bras\'ilia, DF, Brazil, (3) Humboldt-Universit\""at zu Berlin, Germany, (4)
  University of L'Aquila, Italy)","A Hybrid Approach Combining Control Theory and AI for Engineering
  Self-Adaptive Systems",,"IEEE/ACM 15th International Symposium on Software Engineering for
  Adaptive and Self-Managing Systems (SEAMS 2020)",10.1145/3387939.3391595,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Control theoretical techniques have been successfully adopted as methods for
self-adaptive systems design to provide formal guarantees about the
effectiveness and robustness of adaptation mechanisms. However, the
computational effort to obtain guarantees poses severe constraints when it
comes to dynamic adaptation. In order to solve these limitations, in this
paper, we propose a hybrid approach combining software engineering, control
theory, and AI to design for software self-adaptation. Our solution proposes a
hierarchical and dynamic system manager with performance tuning. Due to the gap
between high-level requirements specification and the internal knob behavior of
the managed system, a hierarchically composed components architecture seek the
separation of concerns towards a dynamic solution. Therefore, a two-layered
adaptive manager was designed to satisfy the software requirements with
parameters optimization through regression analysis and evolutionary
meta-heuristic. The optimization relies on the collection and processing of
performance, effectiveness, and robustness metrics w.r.t control theoretical
metrics at the offline and online stages. We evaluate our work with a prototype
of the Body Sensor Network (BSN) in the healthcare domain, which is largely
used as a demonstrator by the community. The BSN was implemented under the
Robot Operating System (ROS) architecture, and concerns about the system
dependability are taken as adaptation goals. Our results reinforce the
necessity of performing well on such a safety-critical domain and contribute
with substantial evidence on how hybrid approaches that combine control and
AI-based techniques for engineering self-adaptive systems can provide effective
adaptation.
","[{'version': 'v1', 'created': 'Fri, 24 Apr 2020 15:19:28 GMT'}]",2020-04-27,"[['Caldas', 'Ricardo Diniz', '', '1 and 2'], ['Rodrigues', 'Arthur', '', '1\n  and 4'], ['Gil', 'Eric Bernd', '', '1\n  and 4'], ['Rodrigues', 'Genaína Nunes', '', '1\n  and 4'], ['Vogel', 'Thomas', '', '1\n  and 4'], ['Pelliccione', 'Patrizio', '', '1\n  and 4']]","['hybrid', 'self-adaptive software', 'control theory', 'optimization']"
3174,1711.06763,Adam \.Zychowski,"Adam \.Zychowski, Abhishek Gupta, Jacek Ma\'ndziuk, Yew Soon Ong","Addressing Expensive Multi-objective Games with Postponed Preference
  Articulation via Memetic Co-evolution",,"Knowledge-Based Systems, 2018, vol. 154, 17-31",10.1016/j.knosys.2018.05.012,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents algorithmic and empirical contributions demonstrating
that the convergence characteristics of a co-evolutionary approach to tackle
Multi-Objective Games (MOGs) with postponed preference articulation can often
be hampered due to the possible emergence of the so-called Red Queen effect.
Accordingly, it is hypothesized that the convergence characteristics can be
significantly improved through the incorporation of memetics (local solution
refinements as a form of lifelong learning), as a promising means of mitigating
(or at least suppressing) the Red Queen phenomenon by providing a guiding hand
to the purely genetic mechanisms of co-evolution. Our practical motivation is
to address MOGs of a time-sensitive nature that are characterized by
computationally expensive evaluations, wherein there is a natural need to
reduce the total number of true function evaluations consumed in achieving good
quality solutions. To this end, we propose novel enhancements to
co-evolutionary approaches for tackling MOGs, such that memetic local
refinements can be efficiently applied on evolved candidate strategies by
searching on computationally cheap surrogate payoff landscapes (that preserve
postponed preference conditions). The efficacy of the proposal is demonstrated
on a suite of test MOGs that have been designed.
","[{'version': 'v1', 'created': 'Fri, 17 Nov 2017 23:10:21 GMT'}]",2022-08-17,"[['Żychowski', 'Adam', ''], ['Gupta', 'Abhishek', ''], ['Mańdziuk', 'Jacek', ''], ['Ong', 'Yew Soon', '']]","['multi-objective games', 'Red Queen effect', 'surrogate-assisted memetic algorithm']"
3175,1907.07673,Deepak Pahwa,"Deepak Pahwa, Binil Starly","Network Based Pricing for 3D Printing Services in Two-Sided
  Manufacturing-as-a-Service Marketplace","Manuscript accepted July 4th, 2019; Rapid Prototyping Journal",,10.1108/RPJ-01-2019-0018,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper presents approaches to determine a network based pricing for 3D
printing services in the context of a two-sided manufacturing-as-a-service
marketplace. The intent is to provide cost analytics to enable service bureaus
to better compete in the market by moving away from setting ad-hoc and
subjective prices. A data mining approach with machine learning methods is used
to estimate a price range based on the profile characteristics of 3D printing
service suppliers. The model considers factors such as supplier experience,
supplier capabilities, customer reviews and ratings from past orders, and scale
of operations among others to estimate a price range for suppliers' services.
Data was gathered from existing marketplace websites, which was then used to
train and test the model. The model demonstrates an accuracy of 65% for US
based suppliers and 59% for Europe based suppliers to classify a supplier's 3D
Printer listing in one of the seven price categories. The improvement over
baseline accuracy of 25% demonstrates that machine learning based methods are
promising for network based pricing in manufacturing marketplaces. Conventional
methodologies for pricing services through activity based costing are
inefficient in strategically pricing 3D printing service offering in a
connected marketplace. As opposed to arbitrarily determining prices, this work
proposes an approach to determine prices through data mining methods to
estimate competitive prices. Such tools can be built into online marketplaces
to help independent service bureaus to determine service price rates.
","[{'version': 'v1', 'created': 'Wed, 17 Jul 2019 19:14:55 GMT'}]",2019-07-19,"[['Pahwa', 'Deepak', ''], ['Starly', 'Binil', '']]","['Data Mining', '3D Printing', 'Decentralized Manufacturing', 'Price Prediction', 'Machine Learning', 'Network Based Pricing', 'Sharing Economy']"
3176,1809.09047,"Jarkko Peltom\""aki","Jarkko Peltom\""aki and Markus A. Whiteland",On $k$-abelian Equivalence and Generalized Lagrange Spectra,"16 pages, 1 figure","Acta Arithmetica, Vol. 194.2, 135-154 (2020)",10.4064/aa180927-10-9,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the set of $k$-abelian critical exponents of all Sturmian words. It
has been proven that in the case $k = 1$ this set coincides with the Lagrange
spectrum. Thus the sets obtained when $k > 1$ can be viewed as generalized
Lagrange spectra. We characterize these generalized spectra in terms of the
usual Lagrange spectrum and prove that when $k > 1$ the spectrum is a dense
non-closed set. This is in contrast with the case $k = 1$, where the spectrum
is a closed set containing a discrete part and a half-line. We describe
explicitly the least accumulation points of the generalized spectra. Our
geometric approach allows the study of $k$-abelian powers in Sturmian words by
means of continued fractions.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2018 16:46:56 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Sep 2019 07:39:12 GMT'}]",2020-04-09,"[['Peltomäki', 'Jarkko', ''], ['Whiteland', 'Markus A.', '']]","['Sturmian word', 'k-abelian equivalence', 'Lagrange spectrum', 'continued fraction']"
3177,1902.08744,Martianus Frederic Ezerman,"Zuling Chang, Martianus Frederic Ezerman and Adamas Aqsa Fahreza",On Greedy Algorithms for Binary de Bruijn Sequences,,"Applicable Algebra in Engineering, Communication and Computing,
  2021",10.1007/s00200-020-00459-3,,cs.IT cs.DS math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a general greedy algorithm for binary de Bruijn sequences, called
Generalized Prefer-Opposite (GPO) Algorithm, and its modifications. By
identifying specific feedback functions and initial states, we demonstrate that
most previously-known greedy algorithms that generate binary de Bruijn
sequences are particular cases of our new algorithm.
","[{'version': 'v1', 'created': 'Sat, 23 Feb 2019 06:10:34 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Jan 2020 15:30:50 GMT'}]",2021-05-27,"[['Chang', 'Zuling', ''], ['Ezerman', 'Martianus Frederic', ''], ['Fahreza', 'Adamas Aqsa', '']]","['Binary periodic sequence', 'de Bruijn sequence', 'greedy algorithm', 'feedback function', 'state graph']"
3178,1901.00758,Wiktor Daszczuk,"Bogdan Czejdo, Wiktor B. Daszczuk, Waldemar Grabski, Sambit
  Bhattacharya","Cooperation of Multiple Autonomous Robots and Analysis of their Swarm
  Behavior","8 pages, 10 figures. arXiv admin note: text overlap with
  arXiv:1705.04263","Autobusy-TEST Vol. 226, 2018, No. 12, pp.872-879",10.24136/atest.2018.516,,cs.RO cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we extended previous studies of cooperating autonomous robots
to include situations when environmental changes and changes in the number of
robots in the swarm can affect the efficiency to execute tasks assigned to the
swarm of robots. We have presented a novel approach based on partition of the
robot behavior. The sub-diagrams describing sub-routs allowed us to model
advanced interactions between autonomous robots using limited number of state
combinations avoiding combinatorial explosion of reachability. We identified
the systems for which we can ensure the correctness of robots interactions. New
techniques were presented to verify and analyze combined robots' behavior. The
partitioned diagrams allowed us to model advanced interactions between
autonomous robots and detect irregularities such as deadlocks, lack of
termination etc. The techniques were presented to verify and analyze combined
robots' behavior using model checking approach. The described system, Dedan
verifier, is still under development. In the near future, timed and
probabilistic verification are planned.
","[{'version': 'v1', 'created': 'Fri, 28 Dec 2018 20:07:48 GMT'}]",2019-01-04,"[['Czejdo', 'Bogdan', ''], ['Daszczuk', 'Wiktor B.', ''], ['Grabski', 'Waldemar', ''], ['Bhattacharya', 'Sambit', '']]","['autonomous robots', 'behavior verification', 'model checking', 'Integrated Model of Distributed Systems', 'deadlock', 'termination']"
3179,1303.6106,Anna Zygmunt,"Anna Zygmunt, Jaros{\l}aw Ko\'zlak, Leszek Siwik",Agent-based environment for knowledge integration,"Computational Science - ICCS 2009, 9th International Conference,
  Baton Rouge, LA, USA, May 25-27, 2009, Proceedings, Part II, pp. 885-894","ICCS 2009, LNCS 5545, 2009",10.1007/978-3-642-01973-9,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Representing knowledge with the use of ontology description languages offers
several advantages arising from knowledge reusability, possibilities of
carrying out reasoning processes and the use of existing concepts of knowledge
integration. In this work we are going to present an environment for the
integration of knowledge expressed in such a way. Guaranteeing knowledge
integration is an important element during the development of the Semantic Web.
Thanks to this, it is possible to obtain access to services which offer
knowledge contained in various distributed databases associated with
semantically described web portals. We will present the advantages of the
multi-agent approach while solving this problem. Then, we will describe an
example of its application in systems supporting company management knowledge
in the process of constructing supply-chains.
","[{'version': 'v1', 'created': 'Mon, 25 Mar 2013 12:03:44 GMT'}]",2013-04-09,"[['Zygmunt', 'Anna', ''], ['Koźlak', 'Jarosław', ''], ['Siwik', 'Leszek', '']]","['multi-agent systems', 'knowledge integration', 'supply-chains management']"
3180,1211.3466,Pece Mitrevski,Tome Dimovski and Pece Mitrevski,"On the Performance Potential of Connection Fault-Tolerant Commit
  Processing in Mobile Environment",,"International Journal of Wireless & Mobile Networks (IJWMN) Vol.
  4, No. 5, October 2012",10.5121/ijwmn.2012.4503,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile inventory, mobile commerce, banking and/or commercial applications are
some distinctive examples that increasingly use distributed transactions. It is
inevitably harder to design efficient commit protocols, due to some intrinsic
mobile environment limitations. A handful of protocols for transaction
processing have been offered, but the majority considers only a limited number
of communication models. We introduce an improved Connection Fault-Tolerant
model and evaluate its performance potential by comparing results in several
deferent scenarios, as well as its contribution to the overall mobile
transaction commit rate. Our performance analysis, conducted using
general-purpose discrete-event simulation programming language, evaluates the
effect of (i) ad-hoc communication between mobile hosts and (ii) the employment
of an appropriate decision algorithm for mobile host agents. Conjointly, they
substantially improve commit rate. In respect of the stochastic nature of
random network disconnections, we determine connection timeout values that
contribute the most to the highest perceived ad-hoc communication impact.
","[{'version': 'v1', 'created': 'Thu, 15 Nov 2012 00:11:12 GMT'}]",2012-11-16,"[['Dimovski', 'Tome', ''], ['Mitrevski', 'Pece', '']]","['Distributed Mobile Transactions', 'Ad-hoc Communication', 'Commit Protocol', 'Decision Algorithm', 'Performance Analysis']"
3181,1711.04216,Todd Davies,Stanley J. Rosenschein and Todd Davies,"Coordination Technology for Active Support Networks: Context,
  Needfinding, and Design","16 pages, 4 figures, Scheduled to appear in AI & Society, 33(1), 2018","AI & Society 33(1):113-123, 2018",10.1007/s00146-017-0778-4,,cs.HC cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Coordination is a key problem for addressing goal-action gaps in many human
endeavors. We define interpersonal coordination as a type of communicative
action characterized by low interpersonal belief and goal conflict. Such
situations are particularly well described as having collectively
""intelligent"", ""common good"" solutions, viz., ones that almost everyone would
agree constitute social improvements. Coordination is useful across the
spectrum of interpersonal communication -- from isolated individuals to
organizational teams. Much attention has been paid to coordination in teams and
organizations. In this paper we focus on the looser interpersonal structures we
call active support networks (ASNs), and on technology that meets their needs.
We describe two needfinding investigations focused on social support, which
examined (a) four application areas for improving coordination in ASNs: (i)
academic coaching, (ii) vocational training, (iii) early learning intervention,
and (iv) volunteer coordination; and (b) existing technology relevant to ASNs.
We find a thus-far unmet need for personal task management software that allows
smooth integration with an individual's active support network. Based on
identified needs, we then describe an open architecture for coordination that
has been developed into working software. The design includes a set of
capabilities we call ""social prompting,"" as well as templates for accomplishing
multi-task goals, and an engine that controls coordination in the network. The
resulting tool is currently available and in continuing development. We explain
its use in ASNs with an example. Follow-up studies are underway in which the
technology is being applied in existing support networks.
","[{'version': 'v1', 'created': 'Sun, 12 Nov 2017 01:47:02 GMT'}]",2018-02-09,"[['Rosenschein', 'Stanley J.', ''], ['Davies', 'Todd', '']]","['coordination', 'social prompting', 'communicative action', 'attitude-behavior gap', 'intention-action gap', 'active support networks']"
3182,1803.06235,Anas Shatnawi,"Anas Shatnawi, Hudhaifa Shatnawi, Mohamed Aymen Saied, Zakarea Al
  Shara, Houari Sahraoui, Abdelhak Seriai","Identifying Components from Object-Oriented APIs Based on Dynamic
  Analysis","11 pages, 5 figures","Anas Shatnawi, Hudhaifa Shatnawi, Mohamed Aymen Saied, Zakarea Al
  Shara, Houari Sahraoui, and Abdelhak Seriai. 2018. Identifying Software
  Components from Object-Oriented APIs Based on Dynamic Analysis. In ICPC18,
  2018, Gothenburg, Sweden",10.1145/3196321.3196349,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The reuse at the component level is generally more effective than the one at
the object-oriented class level. This is due to the granularity level where
components expose their functionalities at an abstract level compared to the
fine-grained object-oriented classes. Moreover, components clearly define their
dependencies through their provided and required interfaces in an explicit way
that facilitates the understanding of how to reuse these components. Therefore,
several component identification approaches have been proposed to identify
components based on the analysis object-oriented software applications.
Nevertheless, most of the existing component identification approaches did not
consider co-usage dependencies between API classes to identify classes/methods
that can be reused to implement a specific scenario. In this paper, we propose
an approach to identify reusable software components in object-oriented APIs,
based on the interactions between client applications and the targeted API. As
we are dealing with actual clients using the API, dynamic analysis allows to
better capture the instances of API usage. Approaches using static analysis are
usually limited by the difficulty of handling dynamic features such as
polymorphism and class loading. We evaluate our approach by applying it to
three Java APIs with eight client applications from the DaCapo benchmark.
DaCapo provides a set of pre-defined usage scenarios. The results show that our
component identification approach has a very high precision.
","[{'version': 'v1', 'created': 'Fri, 16 Mar 2018 13:56:06 GMT'}]",2018-03-19,"[['Shatnawi', 'Anas', ''], ['Shatnawi', 'Hudhaifa', ''], ['Saied', 'Mohamed Aymen', ''], ['Shara', 'Zakarea Al', ''], ['Sahraoui', 'Houari', ''], ['Seriai', 'Abdelhak', '']]","['Software components', 'reverse engineering', 'object-oriented APIs', 'dynamic analysis', 'source code', 'understandability', 'reuse']"
3183,1705.05824,Ruben Mayer,"Ruben Mayer, Muhammad Adnan Tariq, Kurt Rothermel","Minimizing Communication Overhead in Window-Based Parallel Complex Event
  Processing","In Proceedings of ACM International Conference on Distributed and
  Event-Based Systems, Barcelona, Spain, June 19 - 23, 2017 (DEBS '17), 12
  pages. DOI: http://dx.doi.org/10.1145/3093742.3093914",,10.1145/3093742.3093914,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed Complex Event Processing has emerged as a well-established
paradigm to detect situations of interest from basic sensor streams, building
an operator graph between sensors and applications. In order to detect event
patterns that correspond to situations of interest, each operator correlates
events on its incoming streams according to a sliding window mechanism. To
increase the throughput of an operator, different windows can be assigned to
different operator instances---i.e., identical operator copies---which process
them in parallel. This implies that events that are part of multiple
overlapping windows are replicated to different operator instances. The
communication overhead of replicating the events can be reduced by assigning
overlapping windows to the same operator instance. However, this imposes a
higher processing load on the single operator instance, possibly overloading
it. In this paper, we address the trade-off between processing load and
communication overhead when assigning overlapping windows to a single operator
instance. Controlling the trade-off is challenging and cannot be solved with
traditional reactive methods. To this end, we propose a model-based batch
scheduling controller building on prediction. Evaluations show that our
approach is able to significantly save bandwidth, while keeping a user-defined
latency bound in the operator instances.
","[{'version': 'v1', 'created': 'Tue, 16 May 2017 17:52:17 GMT'}]",2017-05-17,"[['Mayer', 'Ruben', ''], ['Tariq', 'Muhammad Adnan', ''], ['Rothermel', 'Kurt', '']]","['Complex Event Processing', 'Data Parallelization', 'CommunicationOverhead']"
3184,1304.3393,Jorge Gomes,"Jorge Gomes, Anders Lyhne Christensen",Generic Behaviour Similarity Measures for Evolutionary Swarm Robotics,"Initial submission. Final version to appear in GECCO 2013 and
  dl.acm.org","Genetic and Evolutionary Computation Conference (GECCO). pp.
  199-206. ACM Press (2013)",10.1145/2463372.2463398,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Novelty search has shown to be a promising approach for the evolution of
controllers for swarm robotics. In existing studies, however, the experimenter
had to craft a domain dependent behaviour similarity measure to use novelty
search in swarm robotics applications. The reliance on hand-crafted similarity
measures places an additional burden to the experimenter and introduces a bias
in the evolutionary process. In this paper, we propose and compare two
task-independent, generic behaviour similarity measures: combined state count
and sampled average state. The proposed measures use the values of sensors and
effectors recorded for each individual robot of the swarm. The characterisation
of the group-level behaviour is then obtained by combining the sensor-effector
values from all the robots. We evaluate the proposed measures in an aggregation
task and in a resource sharing task. We show that the generic measures match
the performance of domain dependent measures in terms of solution quality. Our
results indicate that the proposed generic measures operate as effective
behaviour similarity measures, and that it is possible to leverage the benefits
of novelty search without having to craft domain specific similarity measures.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2013 18:58:13 GMT'}]",2017-03-14,"[['Gomes', 'Jorge', ''], ['Christensen', 'Anders Lyhne', '']]","['Evolutionary swarm robotics', 'novelty search', 'behaviourcharacterisation']"
3185,1607.06544,Albert Reuther,"Albert Reuther, Chansup Byun, William Arcand, David Bestor, Bill
  Bergeron, Matthew Hubbell, Michael Jones, Peter Michaleas, Andrew Prout,
  Antonio Rosa, Jeremy Kepner",Scheduler Technologies in Support of High Performance Data Analysis,"6 pages, 5 figures, IEEE High Performance Extreme Computing
  Conference 2016",,10.1109/HPEC.2016.7761604,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Job schedulers are a key component of scalable computing infrastructures.
They orchestrate all of the work executed on the computing infrastructure and
directly impact the effectiveness of the system. Recently, job workloads have
diversified from long-running, synchronously-parallel simulations to include
short-duration, independently parallel high performance data analysis (HPDA)
jobs. Each of these job types requires different features and scheduler tuning
to run efficiently. A number of schedulers have been developed to address both
job workload and computing system heterogeneity. High performance computing
(HPC) schedulers were designed to schedule large-scale scientific modeling and
simulations on supercomputers. Big Data schedulers were designed to schedule
data processing and analytic jobs on clusters. This paper compares and
contrasts the features of HPC and Big Data schedulers with a focus on
accommodating both scientific computing and high performance data analytic
workloads. Job latency is critical for the efficient utilization of scalable
computing infrastructures, and this paper presents the results of job launch
benchmarking of several current schedulers: Slurm, Son of Grid Engine, Mesos,
and Yarn. We find that all of these schedulers have low utilization for
short-running jobs. Furthermore, employing multilevel scheduling significantly
improves the utilization across all schedulers.
","[{'version': 'v1', 'created': 'Fri, 22 Jul 2016 03:02:04 GMT'}]",2018-03-06,"[['Reuther', 'Albert', ''], ['Byun', 'Chansup', ''], ['Arcand', 'William', ''], ['Bestor', 'David', ''], ['Bergeron', 'Bill', ''], ['Hubbell', 'Matthew', ''], ['Jones', 'Michael', ''], ['Michaleas', 'Peter', ''], ['Prout', 'Andrew', ''], ['Rosa', 'Antonio', ''], ['Kepner', 'Jeremy', '']]","['Scheduler', 'resource manager', 'job scheduler', 'high']"
3186,1507.08268,Laurent Jacques,"Amirafshar Moshtaghpour, Laurent Jacques, Valerio Cambareri, Kevin
  Degraux, Christophe De Vleeschouwer","Consistent Basis Pursuit for Signal and Matrix Estimates in Quantized
  Compressed Sensing","Keywords: Quantized compressed sensing, quantization, consistency,
  error decay, low-rank, sparsity. 10 pages, 3 figures. Note abbout this
  version: title change, typo corrections, clarification of the context, adding
  a comparison with BPDQ",,10.1109/LSP.2015.2497543,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper focuses on the estimation of low-complexity signals when they are
observed through $M$ uniformly quantized compressive observations. Among such
signals, we consider 1-D sparse vectors, low-rank matrices, or compressible
signals that are well approximated by one of these two models. In this context,
we prove the estimation efficiency of a variant of Basis Pursuit Denoise,
called Consistent Basis Pursuit (CoBP), enforcing consistency between the
observations and the re-observed estimate, while promoting its low-complexity
nature. We show that the reconstruction error of CoBP decays like $M^{-1/4}$
when all parameters but $M$ are fixed. Our proof is connected to recent bounds
on the proximity of vectors or matrices when (i) those belong to a set of small
intrinsic ""dimension"", as measured by the Gaussian mean width, and (ii) they
share the same quantized (dithered) random projections. By solving CoBP with a
proximal algorithm, we provide some extensive numerical observations that
confirm the theoretical bound as $M$ is increased, displaying even faster error
decay than predicted. The same phenomenon is observed in the special, yet
important case of 1-bit CS.
","[{'version': 'v1', 'created': 'Wed, 29 Jul 2015 19:13:06 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Oct 2015 07:11:40 GMT'}]",2016-04-27,"[['Moshtaghpour', 'Amirafshar', ''], ['Jacques', 'Laurent', ''], ['Cambareri', 'Valerio', ''], ['Degraux', 'Kevin', ''], ['De Vleeschouwer', 'Christophe', '']]","['Quantized compressed sensing', 'quantization', 'consistency', 'error decay', 'low-rank', 'sparsity']"
3187,1502.01526,Jing Wang,"Jing Wang, Jie Shen, Ping Li",Object Proposal with Kernelized Partial Ranking,,"Pattern Recognition, 2017",10.1016/j.patcog.2017.03.022,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Object proposals are an ensemble of bounding boxes with high potential to
contain objects. In order to determine a small set of proposals with a high
recall, a common scheme is extracting multiple features followed by a ranking
algorithm which however, incurs two major challenges: {\bf 1)} The ranking
model often imposes pairwise constraints between each proposal, rendering the
problem away from an efficient training/testing phase; {\bf 2)} Linear kernels
are utilized due to the computational and memory bottleneck of training a
kernelized model.
  In this paper, we remedy these two issues by suggesting a {\em kernelized
partial ranking model}. In particular, we demonstrate that {\bf i)} our partial
ranking model reduces the number of constraints from $O(n^2)$ to $O(nk)$ where
$n$ is the number of all potential proposals for an image but we are only
interested in top-$k$ of them that has the largest overlap with the ground
truth; {\bf ii)} we permit non-linear kernels in our model which is often
superior to the linear classifier in terms of accuracy. For the sake of
mitigating the computational and memory issues, we introduce a consistent
weighted sampling~(CWS) paradigm that approximates the non-linear kernel as
well as facilitates an efficient learning. In fact, as we will show, training a
linear CWS model amounts to learning a kernelized model. Extensive experiments
demonstrate that equipped with the non-linear kernel and the partial ranking
algorithm, recall at top-$k$ proposals can be substantially improved.
","[{'version': 'v1', 'created': 'Thu, 5 Feb 2015 12:58:29 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Aug 2016 15:06:59 GMT'}, {'version': 'v3', 'created': 'Thu, 18 May 2017 15:57:36 GMT'}]",2017-05-19,"[['Wang', 'Jing', ''], ['Shen', 'Jie', ''], ['Li', 'Ping', '']]","['Object proposal', 'Partial ranking', 'Consistent weighted sampling']"
3188,1109.0085,Chaiwat Jassadapakorn,Chaiwat Jassadapakorn and Prabhas Chongstitvatana,"Self-Adaptation Mechanism to Control the Diversity of the Population in
  Genetic Algorithm","17 pages, 12 figures","International Journal of Computer Science & Information Technology
  (IJCSIT), Vol 3, No 4, August 2011",10.5121/ijcsit.2011.3409,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the problems in applying Genetic Algorithm is that there is some
situation where the evolutionary process converges too fast to a solution which
causes it to be trapped in local optima. To overcome this problem, a proper
diversity in the candidate solutions must be determined. Most existing
diversity-maintenance mechanisms require a problem specific knowledge to setup
parameters properly. This work proposes a method to control diversity of the
population without explicit parameter setting. A self-adaptation mechanism is
proposed based on the competition of preference characteristic in mating. It
can adapt the population toward proper diversity for the problems. The
experiments are carried out to measure the effectiveness of the proposed method
based on nine well-known test problems. The performance of the adaptive method
is comparable to traditional Genetic Algorithm with the best parameter setting.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2011 04:01:27 GMT'}]",2011-09-02,"[['Jassadapakorn', 'Chaiwat', ''], ['Chongstitvatana', 'Prabhas', '']]","['Genetic Algorithm', 'Population Diversity', 'Diversity Control']"
3189,1706.00363,Stefan Marr,"Stefan Marr, Carmen Torres Lopez, Dominik Aumayr, Elisa Gonzalez Boix,
  Hanspeter M\""ossenb\""ock","A Concurrency-Agnostic Protocol for Multi-Paradigm Concurrent Debugging
  Tools",International Symposium on Dynamic Languages,,10.1145/3133841.3133842,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today's complex software systems combine high-level concurrency models. Each
model is used to solve a specific set of problems. Unfortunately, debuggers
support only the low-level notions of threads and shared memory, forcing
developers to reason about these notions instead of the high-level concurrency
models they chose.
  This paper proposes a concurrency-agnostic debugger protocol that decouples
the debugger from the concurrency models employed by the target application. As
a result, the underlying language runtime can define custom breakpoints,
stepping operations, and execution events for each concurrency model it
supports, and a debugger can expose them without having to be specifically
adapted.
  We evaluated the generality of the protocol by applying it to SOMns, a
Newspeak implementation, which supports a diversity of concurrency models
including communicating sequential processes, communicating event loops,
threads and locks, fork/join parallelism, and software transactional memory. We
implemented 21 breakpoints and 20 stepping operations for these concurrency
models. For none of these, the debugger needed to be changed. Furthermore, we
visualize all concurrent interactions independently of a specific concurrency
model. To show that tooling for a specific concurrency model is possible, we
visualize actor turns and message sends separately.
","[{'version': 'v1', 'created': 'Thu, 1 Jun 2017 16:05:14 GMT'}, {'version': 'v2', 'created': 'Sun, 29 Oct 2017 16:31:18 GMT'}]",2017-10-31,"[['Marr', 'Stefan', ''], ['Lopez', 'Carmen Torres', ''], ['Aumayr', 'Dominik', ''], ['Boix', 'Elisa Gonzalez', ''], ['Mössenböck', 'Hanspeter', '']]","['Debugging', 'Tooling', 'Concurrency', 'Breakpoints', 'Stepping', 'Visualization']"
3190,1511.06545,Souradeep Chakraborty,"Souradeep Chakraborty, Pabitra Mitra","A dense subgraph based algorithm for compact salient image region
  detection","33 pages, 18 figures, Single column manuscript pre-print, Accepted at
  Computer Vision and Image Understanding, Elsevier",,10.1016/j.cviu.2015.12.005,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an algorithm for graph based saliency computation that utilizes
the underlying dense subgraphs in finding visually salient regions in an image.
To compute the salient regions, the model first obtains a saliency map using
random walks on a Markov chain. Next, k-dense subgraphs are detected to further
enhance the salient regions in the image. Dense subgraphs convey more
information about local graph structure than simple centrality measures. To
generate the Markov chain, intensity and color features of an image in addition
to region compactness is used. For evaluating the proposed model, we do
extensive experiments on benchmark image data sets. The proposed method
performs comparable to well-known algorithms in salient region detection.
","[{'version': 'v1', 'created': 'Fri, 20 Nov 2015 10:09:13 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Dec 2015 12:31:16 GMT'}]",2015-12-29,"[['Chakraborty', 'Souradeep', ''], ['Mitra', 'Pabitra', '']]","['Visual saliency', 'Markov chain', 'Equilibrium distribution', 'Randomwalk', 'k-dense subgraph', 'Compactness']"
3191,2102.04652,Xiangzeng Zhou,Xiangzeng Zhou and Pan Pan and Yun Zheng and Yinghui Xu and Rong Jin,Large Scale Long-tailed Product Recognition System at Alibaba,Acccepted by CIKM 2020,"In Proceedings of the 29th ACM International Conference on
  Information and Knowledge Management (CIKM20), 3353-3356 (2020)",10.1145/3340531.3417445,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A practical large scale product recognition system suffers from the
phenomenon of long-tailed imbalanced training data under the E-commercial
circumstance at Alibaba. Besides product images at Alibaba, plenty of image
related side information (e.g. title, tags) reveal rich semantic information
about images. Prior works mainly focus on addressing the long tail problem in
visual perspective only, but lack of consideration of leveraging the side
information. In this paper, we present a novel side information based large
scale visual recognition co-training~(SICoT) system to deal with the long tail
problem by leveraging the image related side information. In the proposed
co-training system, we firstly introduce a bilinear word attention module
aiming to construct a semantic embedding over the noisy side information. A
visual feature and semantic embedding co-training scheme is then designed to
transfer knowledge from classes with abundant training data (head classes) to
classes with few training data (tail classes) in an end-to-end fashion.
Extensive experiments on four challenging large scale datasets, whose numbers
of classes range from one thousand to one million, demonstrate the scalable
effectiveness of the proposed SICoT system in alleviating the long tail
problem. In the visual search platform
Pailitao\footnote{http://www.pailitao.com} at Alibaba, we settle a practical
large scale product recognition application driven by the proposed SICoT
system, and achieve a significant gain of unique visitor~(UV) conversion rate.
","[{'version': 'v1', 'created': 'Tue, 9 Feb 2021 05:34:30 GMT'}]",2021-02-10,"[['Zhou', 'Xiangzeng', ''], ['Pan', 'Pan', ''], ['Zheng', 'Yun', ''], ['Xu', 'Yinghui', ''], ['Jin', 'Rong', '']]","['product recognition', 'long-tailed', 'attention', 'side information', 'cotraining']"
3192,1706.03711,James Cheney,Wilmer Ricciotti and James Cheney,Strongly Normalizing Audited Computation,,,10.4230/LIPIcs.CSL.2017.36,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Auditing is an increasingly important operation for computer programming, for
example in security (e.g. to enable history-based access control) and to enable
reproducibility and accountability (e.g. provenance in scientific programming).
Most proposed auditing techniques are ad hoc or treat auditing as a
second-class, extralinguistic operation; logical or semantic foundations for
auditing are not yet well-established. Justification Logic (JL) offers one such
foundation; Bavera and Bonelli introduced a computational interpretation of JL
called $\lambda^h$ that supports auditing. However, $\lambda^h$ is technically
complex and strong normalization was only established for special cases. In
addition, we show that the equational theory of $\lambda^h$ is inconsistent. We
introduce a new calculus $\lambda^{hc}$ that is simpler than $\lambda^h$,
consistent, and strongly normalizing. Our proof of strong normalization is
formalized in Nominal Isabelle.
","[{'version': 'v1', 'created': 'Mon, 12 Jun 2017 16:19:51 GMT'}]",2017-09-12,"[['Ricciotti', 'Wilmer', ''], ['Cheney', 'James', '']]","['Lambda calculus', 'Justification Logic', 'Strong Normalization', 'AuditedComputation']"
3193,2003.10354,Joymallya Chakraborty Mr.,"Joymallya Chakraborty, Suvodeep Majumder, Zhe Yu, Tim Menzies",Fairway: A Way to Build Fair ML Software,"ESEC/FSE'20: The 28th ACM Joint European Software Engineering
  Conference and Symposium on the Foundations of Software Engineering","ESEC/FSE'2020: The 28th ACM Joint European Software Engineering
  Conference and Symposium on the Foundations of Software Engineering,
  Sacramento, California, United States, November 8-13, 2020",10.1145/3368089.3409697,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning software is increasingly being used to make decisions that
affect people's lives. But sometimes, the core part of this software (the
learned model), behaves in a biased manner that gives undue advantages to a
specific group of people (where those groups are determined by sex, race,
etc.). This ""algorithmic discrimination"" in the AI software systems has become
a matter of serious concern in the machine learning and software engineering
community. There have been works done to find ""algorithmic bias"" or ""ethical
bias"" in the software system. Once the bias is detected in the AI software
system, the mitigation of bias is extremely important. In this work, we
a)explain how ground-truth bias in training data affects machine learning model
fairness and how to find that bias in AI software,b)propose a
methodFairwaywhich combines pre-processing and in-processing approach to remove
ethical bias from training data and trained model. Our results show that we can
find bias and mitigate bias in a learned model, without much damaging the
predictive performance of that model. We propose that (1) test-ing for bias and
(2) bias mitigation should be a routine part of the machine learning software
development life cycle. Fairway offers much support for these two purposes.
","[{'version': 'v1', 'created': 'Mon, 23 Mar 2020 16:16:15 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Apr 2020 16:35:12 GMT'}, {'version': 'v3', 'created': 'Fri, 24 Apr 2020 00:31:13 GMT'}, {'version': 'v4', 'created': 'Sat, 23 May 2020 05:01:17 GMT'}, {'version': 'v5', 'created': 'Thu, 27 Aug 2020 18:58:24 GMT'}, {'version': 'v6', 'created': 'Tue, 6 Oct 2020 08:03:36 GMT'}]",2020-10-07,"[['Chakraborty', 'Joymallya', ''], ['Majumder', 'Suvodeep', ''], ['Yu', 'Zhe', ''], ['Menzies', 'Tim', '']]","['Software Fairness', 'Fairness Metrics', 'Bias Mitigation']"
3194,1303.1667,Almir Artero Olivette,"Francisco Assis da Silva, Almir Olivette Artero, Maria Stela Veludo de
  Paiva, Ricardo Luis Barbosa","ALPRS - A New Approach for License Plate Recognition using the Sift
  Algorithm",,"Signal & Image Processing : An International Journal (SIPIJ)
  Vol.4, No.1, February 2013",10.5121/sipij.2013.4102,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new approach for the automatic license plate
recognition, which includes the SIFT algorithm in step to locate the plate in
the input image. In this new approach, besides the comparison of the features
obtained with the SIFT algorithm, the correspondence between the spatial
orientations and the positioning associated with the keypoints is also
observed. Afterwards, an algorithm is used for the character recognition of the
plates, very fast, which makes it possible its application in real time. The
results obtained with the proposed approach presented very good success rates,
so much for locating the characters in the input image, as for their
recognition.
","[{'version': 'v1', 'created': 'Thu, 7 Mar 2013 12:49:49 GMT'}]",2013-03-08,"[['da Silva', 'Francisco Assis', ''], ['Artero', 'Almir Olivette', ''], ['de Paiva', 'Maria Stela Veludo', ''], ['Barbosa', 'Ricardo Luis', '']]","['License Plate Recognition', 'Character Recognition', 'SIFT']"
3195,1811.11197,Richard Garcia-Lebron,"Richard Garcia-Lebron, David J. Myers, Shouhuai Xu and Jie Sun",Node Diversification in Complex Networks by Decentralized Coloring,,Journal of Complex Networks (2018),10.1093/comnet/cny031,,cs.SI cs.CR cs.DS cs.MA physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop a decentralized coloring approach to diversify the nodes in a
complex network. The key is the introduction of a local conflict index that
measures the color conflicts arising at each node which can be efficiently
computed using only local information. We demonstrate via both synthetic and
real-world networks that the proposed approach significantly outperforms random
coloring as measured by the size of the largest color-induced connected
component. Interestingly, for scale-free networks further improvement of
diversity can be achieved by tuning a degree-biasing weighting parameter in the
local conflict index.
","[{'version': 'v1', 'created': 'Tue, 27 Nov 2018 19:02:36 GMT'}]",2018-12-04,"[['Garcia-Lebron', 'Richard', ''], ['Myers', 'David J.', ''], ['Xu', 'Shouhuai', ''], ['Sun', 'Jie', '']]","['decentralized coloring', 'network connectivity', 'iterative optimization']"
3196,1603.01793,Andrey Shanin V,J. Poblet-Puig and A. V. Shanin,A New Numerical Method for Solving the Acoustic Radiation Problem,,"Poblet-Puig J., Shanin A.V., A new numerical method for solving
  the acoustic radiation problem. Acoustical Physics. Vol. 64, no. 2. PP.
  252-259 (2018)",10.1134/S1063771018020148,,cs.NA cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A numerical method of solving the problem of acoustic wave radiation in the
presence of a rigid scatterer is described. It combines the finite element
method and the boundary algebraic equations. In the proposed method, the
exterior domain around the scatterer is discretized, so that there appear an
infinite domain with regular discretization and a relatively small layer with
irregular mesh. For the infinite regular mesh, the boundary algebraic equation
method is used with spurious resonance suppression according to Burton and
Miller. In the thin layer with irregular mesh, the finite element method is
used. The proposed method is characterized by simple implementation, fair
accuracy, and absence of spurious resonances.
","[{'version': 'v1', 'created': 'Sun, 6 Mar 2016 06:21:30 GMT'}, {'version': 'v2', 'created': 'Thu, 17 May 2018 08:51:02 GMT'}]",2018-05-18,"[['Poblet-Puig', 'J.', ''], ['Shanin', 'A. V.', '']]","['boundary integral', 'Helmholtz', 'FEM', 'wave', 'scattering']"
3197,1901.05347,Stefano Forti,Stefano Forti and Gian-Luigi Ferrari and Antonio Brogi,"Secure Cloud-Edge Deployments, with Trust",,"Future Generation Computer Systems, 2019",10.1016/j.future.2019.08.020,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Assessing the security level of IoT applications to be deployed to
heterogeneous Cloud-Edge infrastructures operated by different providers is a
non-trivial task. In this article, we present a methodology that permits to
express security requirements for IoT applications, as well as infrastructure
security capabilities, in a simple and declarative manner, and to automatically
obtain an explainable assessment of the security level of the possible
application deployments. The methodology also considers the impact of trust
relations among different stakeholders using or managing Cloud-Edge
infrastructures. A lifelike example is used to showcase the prototyped
implementation of the methodology.
","[{'version': 'v1', 'created': 'Wed, 16 Jan 2019 15:31:41 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Sep 2019 07:04:29 GMT'}]",2019-09-06,"[['Forti', 'Stefano', ''], ['Ferrari', 'Gian-Luigi', ''], ['Brogi', 'Antonio', '']]","['secure application deployment', 'declarative programming', 'probabilistic reasoning']"
3198,1502.01181,Julien Mineraud,"Julien Mineraud, Oleksiy Mazhelis, Xiang Su and Sasu Tarkoma",A gap analysis of Internet-of-Things platforms,"15 pages, 4 figures, 3 tables, Accepted for publication in Computer
  Communications, special issue on the Internet of Things: Research challenges
  and solutions",,10.1016/j.comcom.2016.03.015,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We are experiencing an abundance of Internet-of-Things (IoT) middleware
solutions that provide connectivity for sensors and actuators to the Internet.
To gain a widespread adoption, these middleware solutions, referred to as
platforms, have to meet the expectations of different players in the IoT
ecosystem, including device providers, application developers, and end-users,
among others. In this article, we evaluate a representative sample of these
platforms, both proprietary and open-source, on the basis of their ability to
meet the expectations of different IoT users. The evaluation is thus more
focused on how ready and usable these platforms are for IoT ecosystem players,
rather than on the peculiarities of the underlying technological layers. The
evaluation is carried out as a gap analysis of the current IoT landscape with
respect to (i) the support for heterogeneous sensing and actuating
technologies, (ii) the data ownership and its implications for security and
privacy, (iii) data processing and data sharing capabilities, (iv) the support
offered to application developers, (v) the completeness of an IoT ecosystem,
and (vi) the availability of dedicated IoT marketplaces. The gap analysis aims
to highlight the deficiencies of today's solutions to improve their integration
to tomorrow's ecosystems. In order to strengthen the finding of our analysis,
we conducted a survey among the partners of the Finnish IoT program, counting
over 350 experts, to evaluate the most critical issues for the development of
future IoT platforms. Based on the results of our analysis and our survey, we
conclude this article with a list of recommendations for extending these IoT
platforms in order to fill in the gaps.
","[{'version': 'v1', 'created': 'Wed, 4 Feb 2015 12:57:20 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Nov 2015 13:26:21 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Mar 2016 10:21:41 GMT'}]",2016-03-17,"[['Mineraud', 'Julien', ''], ['Mazhelis', 'Oleksiy', ''], ['Su', 'Xiang', ''], ['Tarkoma', 'Sasu', '']]","['Internet of Things', 'IoT platforms', 'IoT marketplace', 'gap analysis', 'IoT ecosystem']"
3199,1812.03859,Gennady Ososkov Alexeevich,"Dmitriy Baranov, Sergey Mitsyn, Pavel Goncharov, Gennady Ososkov",The particle track reconstruction based on deep learning neural networks,"8 pages, 3 figures, CHEP 2018, the 23rd International Conference on
  Computing in High Energy and Nuclear Physics, Sofia, Bulgaria on July 9-13,
  2018. arXiv admin note: text overlap with arXiv:1811.06002",,10.1051/epjconf/201921406018,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  One of the most important problems of data processing in high energy and
nuclear physics is the event reconstruction. Its main part is the track
reconstruction procedure which consists in looking for all tracks that
elementary particles leave when they pass through a detector among a huge
number of points, so-called hits, produced when flying particles fire detector
coordinate planes. Unfortunately, the tracking is seriously impeded by the
famous shortcoming of multiwired, strip in GEM detectors due to the appearance
in them a lot of fake hits caused by extra spurious crossings of fired strips.
Since the number of those fakes is several orders of magnitude greater than for
true hits, one faces with the quite serious difficulty to unravel possible
track-candidates via true hits ignoring fakes. On the basis of our previous
two-stage approach based on hits preprocessing using directed K-d tree search
followed by a deep neural classifier we introduce here two new tracking
algorithms. Both algorithms combine those two stages in one while using
different types of deep neural nets. We show that both proposed deep networks
do not require any special preprocessing stage, are more accurate, faster and
can be easier parallelized. Preliminary results of our new approaches for
simulated events are presented.
","[{'version': 'v1', 'created': 'Fri, 7 Dec 2018 08:18:35 GMT'}]",2019-10-02,"[['Baranov', 'Dmitriy', ''], ['Mitsyn', 'Sergey', ''], ['Goncharov', 'Pavel', ''], ['Ososkov', 'Gennady', '']]","['tracking', 'GEM detector', 'directed search', 'recurrent neural network', 'YOLO convolutional neural network']"
3200,1303.2966,Francesco Flammini,"Francesco Flammini, Nicola Mazzocca, Antonio Orazzo","Automatic instantiation of abstract tests on specific configurations for
  large critical control systems",,,10.5555/1552138.1552139,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer-based control systems have grown in size, complexity, distribution
and criticality. In this paper a methodology is presented to perform an
abstract testing of such large control systems in an efficient way: an abstract
test is specified directly from system functional requirements and has to be
instantiated in more test runs to cover a specific configuration, comprising
any number of control entities (sensors, actuators and logic processes). Such a
process is usually performed by hand for each installation of the control
system, requiring a considerable time effort and being an error prone
verification activity. To automate a safe passage from abstract tests, related
to the so called generic software application, to any specific installation, an
algorithm is provided, starting from a reference architecture and a state-based
behavioural model of the control software. The presented approach has been
applied to a railway interlocking system, demonstrating its feasibility and
effectiveness in several years of testing experience.
","[{'version': 'v1', 'created': 'Tue, 12 Mar 2013 17:47:01 GMT'}]",2022-06-29,"[['Flammini', 'Francesco', ''], ['Mazzocca', 'Nicola', ''], ['Orazzo', 'Antonio', '']]","['Dependability', 'Functional Testing', 'Configuration Coverage', 'Railway Interlocking']"
3201,1811.04122,Helge Spieker,"Helge Spieker, Arnaud Gotlieb, Dusica Marijan, Morten Mossige","Reinforcement Learning for Automatic Test Case Prioritization and
  Selection in Continuous Integration","Spieker, H., Gotlieb, A., Marijan, D., & Mossige, M. (2017).
  Reinforcement Learning for Automatic Test Case Prioritization and Selection
  in Continuous Integration. In Proceedings of 26th International Symposium on
  Software Testing and Analysis (ISSTA'17) (pp. 12--22). ACM",,10.1145/3092703.3092709,,cs.SE cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Testing in Continuous Integration (CI) involves test case prioritization,
selection, and execution at each cycle. Selecting the most promising test cases
to detect bugs is hard if there are uncertainties on the impact of committed
code changes or, if traceability links between code and tests are not
available. This paper introduces Retecs, a new method for automatically
learning test case selection and prioritization in CI with the goal to minimize
the round-trip time between code commits and developer feedback on failed test
cases. The Retecs method uses reinforcement learning to select and prioritize
test cases according to their duration, previous last execution and failure
history. In a constantly changing environment, where new test cases are created
and obsolete test cases are deleted, the Retecs method learns to prioritize
error-prone test cases higher under guidance of a reward function and by
observing previous CI cycles. By applying Retecs on data extracted from three
industrial case studies, we show for the first time that reinforcement learning
enables fruitful automatic adaptive test case selection and prioritization in
CI and regression testing.
","[{'version': 'v1', 'created': 'Fri, 9 Nov 2018 20:08:58 GMT'}]",2018-11-13,"[['Spieker', 'Helge', ''], ['Gotlieb', 'Arnaud', ''], ['Marijan', 'Dusica', ''], ['Mossige', 'Morten', '']]","['Regression testing', 'Test case prioritization', 'Test case selection', 'Reinforcement Learning', 'Machine Learning', 'Continuous Integration']"
3202,1204.2138,Mohammadi Akheela Khanum Mrs,Munesh Chandra Trivedi and Mohammadi Akheela Khanum,Role of context in usability evaluations: A review,"10 pages, 2 tables, ACIJ- Vol3.No.2 March 2012",,10.5121/acij.2012.3208,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Usability is often defined as the ability of a system to carry out specific
tasks by specific users in a specific context. Usability evaluation involves
testing the system for its expected usability. Usability testing is performed
in natural environment (field) or artificial environment (laboratory). The
result of usability evaluation is affected by the environment in which it is
carried out. Previous studies have focused only on the physical environment
(lab and field) effect on the results but rarely focused on the effect of
social environment (people present during testing). Therefore, this study aims
to review how important it is to take context into account during usability
evaluation. Context is explored through the theory of behaviour settings,
according to which behaviour of individuals is strongly influenced by the
physical as well as the social environment in which they function. The result
of this review indicates that the physical and social context plays a
substantial role in usability evaluations. Further, it also suggests that the
usability evaluation model should encompass context as an important component
in the framework.
","[{'version': 'v1', 'created': 'Tue, 10 Apr 2012 13:18:51 GMT'}]",2012-04-11,"[['Trivedi', 'Munesh Chandra', ''], ['Khanum', 'Mohammadi Akheela', '']]","['Usability evaluation', 'context', 'physical context', 'social context', 'theory of behaviour settings  1']"
3203,1903.01330,Fantin Girard,"Fantin Girard, Conrad Kavalec, Farida Cheriet","Joint segmentation and classification of retinal arteries/veins from
  fundus images",Preprint accepted in Artificial Intelligence in Medicine,"Artificial Intelligence in Medicine, Volume 94, 2019, Pages
  96-109, ISSN 0933-3657",10.1016/j.artmed.2019.02.004,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Objective Automatic artery/vein (A/V) segmentation from fundus images is
required to track blood vessel changes occurring with many pathologies
including retinopathy and cardiovascular pathologies. One of the clinical
measures that quantifies vessel changes is the arterio-venous ratio (AVR) which
represents the ratio between artery and vein diameters. This measure
significantly depends on the accuracy of vessel segmentation and classification
into arteries and veins. This paper proposes a fast, novel method for semantic
A/V segmentation combining deep learning and graph propagation.
  Methods A convolutional neural network (CNN) is proposed to jointly segment
and classify vessels into arteries and veins. The initial CNN labeling is
propagated through a graph representation of the retinal vasculature, whose
nodes are defined as the vessel branches and edges are weighted by the cost of
linking pairs of branches. To efficiently propagate the labels, the graph is
simplified into its minimum spanning tree.
  Results The method achieves an accuracy of 94.8% for vessels segmentation.
The A/V classification achieves a specificity of 92.9% with a sensitivity of
93.7% on the CT-DRIVE database compared to the state-of-the-art-specificity and
sensitivity, both of 91.7%.
  Conclusion The results show that our method outperforms the leading previous
works on a public dataset for A/V classification and is by far the fastest.
  Significance The proposed global AVR calculated on the whole fundus image
using our automatic A/V segmentation method can better track vessel changes
associated to diabetic retinopathy than the standard local AVR calculated only
around the optic disc.
","[{'version': 'v1', 'created': 'Mon, 4 Mar 2019 16:17:33 GMT'}]",2019-03-05,"[['Girard', 'Fantin', ''], ['Kavalec', 'Conrad', ''], ['Cheriet', 'Farida', '']]","['CNN', 'Artery and vein classification', 'Vessel segmentation', 'Fundus images', 'Retina']"
3204,1904.01709,Anil Yaman,"Anil Yaman, Giovanni Iacca, Decebal Constantin Mocanu, Matt Coler,
  George Fletcher, Mykola Pechenizkiy","Evolving Plasticity for Autonomous Learning under Changing Environmental
  Conditions",Evolutionary Computation Journal,"Evolutionary Computation 1 25, 2020",10.1162/evco_a_00286,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A fundamental aspect of learning in biological neural networks is the
plasticity property which allows them to modify their configurations during
their lifetime. Hebbian learning is a biologically plausible mechanism for
modeling the plasticity property in artificial neural networks (ANNs), based on
the local interactions of neurons. However, the emergence of a coherent global
learning behavior from local Hebbian plasticity rules is not very well
understood. The goal of this work is to discover interpretable local Hebbian
learning rules that can provide autonomous global learning. To achieve this, we
use a discrete representation to encode the learning rules in a finite search
space. These rules are then used to perform synaptic changes, based on the
local interactions of the neurons. We employ genetic algorithms to optimize
these rules to allow learning on two separate tasks (a foraging and a
prey-predator scenario) in online lifetime learning settings. The resulting
evolved rules converged into a set of well-defined interpretable types, that
are thoroughly discussed. Notably, the performance of these rules, while
adapting the ANNs during the learning tasks, is comparable to that of offline
learning methods such as hill climbing.
","[{'version': 'v1', 'created': 'Tue, 2 Apr 2019 23:45:14 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Mar 2020 17:36:09 GMT'}, {'version': 'v3', 'created': 'Mon, 7 Dec 2020 17:00:17 GMT'}]",2021-03-16,"[['Yaman', 'Anil', ''], ['Iacca', 'Giovanni', ''], ['Mocanu', 'Decebal Constantin', ''], ['Coler', 'Matt', ''], ['Fletcher', 'George', ''], ['Pechenizkiy', 'Mykola', '']]","['Interpretable synaptic plasticity rules', 'Hebbian learning', 'evolving networks', 'continuous learning', 'evolution of learning']"
3205,1706.05643,Vasile Patrascu,Vasile Patrascu,"Entropy, neutro-entropy and anti-entropy for neutrosophic information",14 pages,,10.13140/RG.2.2.29001.95848,Technical Report TI.1.6.2017,cs.AI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This approach presents a multi-valued representation of the neutrosophic
information. It highlights the link between the bifuzzy information and
neutrosophic one. The constructed deca-valued structure shows the neutrosophic
information complexity. This deca-valued structure led to construction of two
new concepts for the neutrosophic information: neutro-entropy and anti-entropy.
These two concepts are added to the two existing: entropy and non-entropy.
Thus, we obtained the following triad: entropy, neutro-entropy and
anti-entropy.
","[{'version': 'v1', 'created': 'Sun, 18 Jun 2017 13:01:59 GMT'}]",2017-06-20,"[['Patrascu', 'Vasile', '']]","['neutrosophic information', 'entropy', 'neutro-entropy', 'anti-entropy', 'nonentropy']"
3206,1009.1170,Saipunidzam Mahamad,"Saipunidzam Mahamad, Mohammad Noor Ibrahim and Shakirah Mohd Taib",M-Learning: A New Paradigm of Learning Mathematics in Malaysia,"Wireless technology, teaching mathematics, flexible learning,
  m-Learning","International journal of computer science & information Technology
  (IJCSIT) Vol 2 No 4 (2010) pp 76-86",10.5121/ijcsit.2010.2407,0810ijcsit07,cs.MM cs.CY cs.MS,http://creativecommons.org/licenses/by/3.0/,"  M-Learning is a new learning paradigm of the new social structure with mobile
and wireless technologies.Smart school is one of the four flagship applications
for Multimedia Super Corridor (MSC) under Malaysian government initiative to
improve education standard in the country. With the advances of mobile devices
technologies, mobile learning could help the government in realizing the
initiative. This paper discusses the prospect of implementing mobile learning
for primary school students. It indicates significant and challenges and
analysis of user perceptions on potential mobile applications through a survey
done in primary school context. The authors propose the m-Learning for
mathematics by allowing the extension of technology in the traditional
classroom in term of learning and teaching.
","[{'version': 'v1', 'created': 'Mon, 6 Sep 2010 22:33:38 GMT'}]",2010-09-08,"[['Mahamad', 'Saipunidzam', ''], ['Ibrahim', 'Mohammad Noor', ''], ['Taib', 'Shakirah Mohd', '']]","['Wireless technology', 'teaching mathematics', 'flexible learning', 'm-Learning;']"
3207,1906.00026,Charith Perera,"Rhys Beckett, Charith Perera",IoT Skullfort: Exploring the Impact of Internet Connected Cosplay,,"Proceedings of the 2019 ACM International Joint Conference and
  2019 International Symposium on Pervasive and Ubiquitous Computing and
  Wearable Computers",,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we explore the potential impact of Internet of Things (IoT)
technology may have on the cosplay community. We developed a costume (an IoT
Skullfort) and embedded IoT technology to enhance its capabilities and user
interactions. Sensing technologies are widely used in many different wearable
domains including cosplay scenarios. However, in most of these scenarios,
typical interaction pattern is that the costume responds to its environment or
the player's behaviour (e.g., colour of lights may get changed when player
moves hands). In contrast, our research focuses on exploring scenarios where
the audience (third party) get to manipulate the costume behaviour (e.g., the
audience get to change the colour of the Skullfort using a mobile application).
We believe such an audience (third party) influenced cosplay brings new
opportunities for enhanced entertainment. However, it also creates significant
challenges. We report the results gathered through a focus group conducted in
collaboration with cosplay community experts.
","[{'version': 'v1', 'created': 'Tue, 28 May 2019 09:48:24 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Jul 2019 12:36:04 GMT'}]",2019-07-09,"[['Beckett', 'Rhys', ''], ['Perera', 'Charith', '']]","['Internt of Things', 'Cosplay', 'Fabricated Costumes']"
3208,2202.08901,Anubrata Das,"Li Shi, Nilavra Bhattacharya, Anubrata Das, Matthew Lease, Jacek
  Gwidzka","The Effects of Interactive AI Design on User Behavior: An Eye-tracking
  Study of Fact-checking COVID-19 Claims",,"Published in ACM SIGIR Conference on Human Information Interaction
  and Retrieval (CHIIR 2022), March 14 --- 18, 2022, Regensburg, Germany",10.1145/3498366.3505786,,cs.HC cs.CL cs.IR,http://creativecommons.org/licenses/by/4.0/,"  We conducted a lab-based eye-tracking study to investigate how the
interactivity of an AI-powered fact-checking system affects user interactions,
such as dwell time, attention, and mental resources involved in using the
system. A within-subject experiment was conducted, where participants used an
interactive and a non-interactive version of a mock AI fact-checking system and
rated their perceived correctness of COVID-19 related claims. We collected
web-page interactions, eye-tracking data, and mental workload using NASA-TLX.
We found that the presence of the affordance of interactively manipulating the
AI system's prediction parameters affected users' dwell times, and
eye-fixations on AOIs, but not mental workload. In the interactive system,
participants spent the most time evaluating claims' correctness, followed by
reading news. This promising result shows a positive role of interactivity in a
mixed-initiative AI-powered system.
","[{'version': 'v1', 'created': 'Thu, 17 Feb 2022 21:08:57 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Mar 2022 20:47:34 GMT'}]",2022-03-16,"[['Shi', 'Li', ''], ['Bhattacharya', 'Nilavra', ''], ['Das', 'Anubrata', ''], ['Lease', 'Matthew', ''], ['Gwidzka', 'Jacek', '']]","['Fact-checking', 'Interactivity', 'Mixed-initiative', 'Eye-tracking']"
3209,1806.10156,Susanne Claus,"Susanne Claus, Pierre Kerfriden",A CutFEM method for two-phase flow problems,,,10.1016/j.cma.2019.01.009,,cs.NA math.NA,http://creativecommons.org/licenses/by/4.0/,"  In this article, we present a cut finite element method for two-phase
Navier-Stokes flows. The main feature of the method is the formulation of a
unified continuous interior penalty stabilisation approach for, on the one
hand, stabilising advection and the pressure-velocity coupling and, on the
other hand, stabilising the cut region. The accuracy of the algorithm is
enhanced by the development of extended fictitious domains to guarantee a well
defined velocity from previous time steps in the current geometry. Finally, the
robustness of the moving-interface algorithm is further improved by the
introduction of a curvature smoothing technique that reduces spurious
velocities. The algorithm is shown to perform remarkably well for low capillary
number flows, and is a first step towards flexible and robust CutFEM algorithms
for the simulation of microfluidic devices.
","[{'version': 'v1', 'created': 'Tue, 26 Jun 2018 18:07:04 GMT'}]",2019-05-01,"[['Claus', 'Susanne', ''], ['Kerfriden', 'Pierre', '']]","['cut finite element method', 'two-phase flow', 'micro-fluidic devices', 'level settechnique', 'continuous interior penalty']"
3210,1903.02937,Masoud Behzadinasab,"Masoud Behzadinasab, John T. Foster","On the stability of the generalized, finite deformation correspondence
  model of peridynamics",,,10.1016/j.ijsolstr.2019.07.030,,cs.NA cs.CE physics.class-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A class of peridynamic material models known as constitutive correspondence
models provide a bridge between classical continuum mechanics and peridynamics.
These models are useful because they allow well-established local constitutive
theories to be used within the nonlocal framework of peridynamics. A recent
finite deformation correspondence theory (Foster and Xu, 2018) was developed
and reported to improve stability properties of the original correspondence
model (Silling et al., 2007). This paper presents a stability analysis that
indicates the reported advantages of the new theory were overestimated.
Homogeneous deformations are analyzed and shown to exibit unstable material
behavior at the continuum level. Additionally, the effects of a particle
discretization on the stability of the model are reported. Numerical examples
demonstrate the large errors induced by the unstable behavior. Stabilization
strategies and practical applications of the new finite deformation model are
discussed.
","[{'version': 'v1', 'created': 'Tue, 5 Mar 2019 05:03:19 GMT'}]",2019-08-29,"[['Behzadinasab', 'Masoud', ''], ['Foster', 'John T.', '']]","['Peridynamics', 'constitutive correspondence', 'finite deformation', 'stability', 'nonlocal', 'meshless']"
3211,1607.01924,Shangbin Wu,"Shangbin Wu, Sooyoung Hur, Kuyeon Whang, and Maziar Nekovee","Intra-cluster Characteristics of 28 GHz Wireless Channel in Urban Micro
  Street Canyon",,,10.1109/GLOCOM.2016.7841916,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates intra-cluster channel characteristics of non
line-of-sight (NLOS) 28 GHz channels in street canyon scenarios. These channel
characteristics include cluster numbers, number of subpaths within each
cluster, intra-cluster delay spreads, and intra-cluster angular spreads. Both
measurement and ray tracing results are presented and compared. Furthermore,
distribution fittings are performed and models and parameters for different
intra-cluster channel characteristics are proposed.
","[{'version': 'v1', 'created': 'Thu, 7 Jul 2016 08:57:37 GMT'}]",2017-02-09,"[['Wu', 'Shangbin', ''], ['Hur', 'Sooyoung', ''], ['Whang', 'Kuyeon', ''], ['Nekovee', 'Maziar', '']]","['millimeter wave', 'ray tracing', 'channel measurement', 'intra-cluster channel characteristics']"
3212,0809.1593,Daniil Ryabko,"Boris Ryabko, Daniil Ryabko",Constructing Perfect Steganographic Systems,,"Information and Computation, 2011, Vol. 209, No. 9, pp. 1223-1230",10.1016/j.ic.2011.06.004,,cs.CR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose steganographic systems for the case when covertexts (containers)
are generated by a finite-memory source with possibly unknown statistics. The
probability distributions of covertexts with and without hidden information are
the same; this means that the proposed stegosystems are perfectly secure, i.e.
an observer cannot determine whether hidden information is being transmitted.
The speed of transmission of hidden information can be made arbitrary close to
the theoretical limit - the Shannon entropy of the source of covertexts. An
interesting feature of the suggested stegosystems is that they do not require
any (secret or public) key.
  At the same time, we outline some principled computational limitations on
steganography. We show that there are such sources of covertexts, that any
stegosystem that has linear (in the length of the covertext) speed of
transmission of hidden text must have an exponential Kolmogorov complexity.
This shows, in particular, that some assumptions on the sources of covertext
are necessary.
","[{'version': 'v1', 'created': 'Tue, 9 Sep 2008 16:09:52 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Jul 2011 09:54:42 GMT'}]",2012-02-28,"[['Ryabko', 'Boris', ''], ['Ryabko', 'Daniil', '']]","['Steganography', 'Kolmogorov complexity', 'Information Theory', 'Shannon entropy']"
3213,1612.07603,Wenji Li,"Zhun Fan, Wenji Li, Xinye Cai, Hui Li, Caimin Wei, Qingfu Zhang,
  Kalyanmoy Deb and Erik D. Goodman","Difficulty Adjustable and Scalable Constrained Multi-objective Test
  Problem Toolkit","28 pages,8 figures, 7 tables",,10.1162/evco_a_00259,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-objective evolutionary algorithms (MOEAs) have progressed significantly
in recent decades, but most of them are designed to solve unconstrained
multi-objective optimization problems. In fact, many real-world multi-objective
problems contain a number of constraints. To promote research on constrained
multi-objective optimization, we first propose a problem classification scheme
with three primary types of difficulty, which reflect various types of
challenges presented by real-world optimization problems, in order to
characterize the constraint functions in constrained multi-objective
optimization problems (CMOPs). These are feasibility-hardness,
convergence-hardness and diversity-hardness. We then develop a general toolkit
to construct difficulty-adjustable and scalable CMOPs (DAS-CMOPs, or DAS-CMaOPs
when the number of objectives is greater than three) with three types of
parameterized constraint functions developed to capture the three proposed
types of difficulty. Based on this toolkit, we suggest nine
difficulty-adjustable and scalable CMOPs and nine CMaOPs. The experimental
results reveal that mechanisms in MOEA/D-CDP may be more effective in solving
convergence-hard DAS-CMOPs, while mechanisms of NSGA-II-CDP may be more
effective in solving DAS-CMOPs with simultaneous diversity-, feasibility- and
convergence-hardness. Mechanisms in C-NSGA-III may be more effective in solving
feasibility-hard CMaOPs, while mechanisms of C-MOEA/DD may be more effective in
solving CMaOPs with convergence-hardness. In addition, none of them can solve
these problems efficiently, which stimulates us to continue to develop new
CMOEAs and CMaOEAs to solve the suggested DAS-CMOPs and DAS-CMaOPs.
","[{'version': 'v1', 'created': 'Wed, 21 Dec 2016 14:36:29 GMT'}, {'version': 'v2', 'created': 'Sat, 16 Sep 2017 07:09:08 GMT'}, {'version': 'v3', 'created': 'Tue, 28 May 2019 08:46:23 GMT'}]",2019-05-29,"[['Fan', 'Zhun', ''], ['Li', 'Wenji', ''], ['Cai', 'Xinye', ''], ['Li', 'Hui', ''], ['Wei', 'Caimin', ''], ['Zhang', 'Qingfu', ''], ['Deb', 'Kalyanmoy', ''], ['Goodman', 'Erik D.', '']]","['Constrained Problems', 'Evolutionary Multi-objective Optimization', 'Test Problems', 'Controlled Difficulties']"
3214,0711.0834,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",An interface group for process components,"26 pages; section on non-associativity of component composition
  added, examples added","Fundamenta Informaticae, 99(4):355--382, 2010",10.3233/FI-2010-254,PRG0707,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We take a process component as a pair of an interface and a behaviour. We
study the composition of interacting process components in the setting of
process algebra. We formalize the interfaces of interacting process components
by means of an interface group. An interesting feature of the interface group
is that it allows for distinguishing between expectations and promises in
interfaces of process components. This distinction comes into play in case
components with both client and server behaviour are involved.
","[{'version': 'v1', 'created': 'Tue, 6 Nov 2007 10:45:02 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Dec 2008 08:19:38 GMT'}]",2010-07-12,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['interface group', 'process component', 'process algebra']"
3215,1004.0381,Soummya Kar,Soummya Kar and Jos\'e M. F. Moura,"Gossip and Distributed Kalman Filtering: Weak Consensus under Weak
  Detectability","Submitted to the IEEE Transactions, 30 pages.",,10.1109/TSP.2010.2100385,,cs.IT math.DS math.IT math.OC math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents the gossip interactive Kalman filter (GIKF) for
distributed Kalman filtering for networked systems and sensor networks, where
inter-sensor communication and observations occur at the same time-scale. The
communication among sensors is random; each sensor occasionally exchanges its
filtering state information with a neighbor depending on the availability of
the appropriate network link. We show that under a weak distributed
detectability condition:
  1. the GIKF error process remains stochastically bounded, irrespective of the
instability properties of the random process dynamics; and
  2. the network achieves \emph{weak consensus}, i.e., the conditional
estimation error covariance at a (uniformly) randomly selected sensor converges
in distribution to a unique invariant measure on the space of positive
semi-definite matrices (independent of the initial state.)
  To prove these results, we interpret the filtered states (estimates and error
covariances) at each node in the GIKF as stochastic particles with local
interactions. We analyze the asymptotic properties of the error process by
studying as a random dynamical system the associated switched (random) Riccati
equation, the switching being dictated by a non-stationary Markov chain on the
network graph.
","[{'version': 'v1', 'created': 'Fri, 2 Apr 2010 19:48:51 GMT'}]",2015-05-18,"[['Kar', 'Soummya', ''], ['Moura', 'José M. F.', '']]","['Gossip', 'Kalman filter', 'consensus', 'random dynamical systems', 'random algebraic Riccati']"
3216,1107.5492,Lotfi Salhi Mr,Lotfi Salhi and Kais Ouni,"Application of Gammachirp Auditory Filter as a Continuous Wavelet
  Analysis","16 pages, 17 figures;
  http://airccse.org/journal/sipij/papers/2011sipij10.pdf",,10.5121/sipij,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new method on the use of the gammachirp auditory filter
based on a continuous wavelet analysis. The gammachirp auditory filter is
designed to provide a spectrum reflecting the spectral properties of the
cochlea, which is responsible for frequency analysis in the human auditory
system. The impulse response of the theoretical gammachirp auditory filter that
has been developed by Irino and Patterson can be used as the kernel for wavelet
transform which approximates the frequency response of the cochlea. This study
implements the gammachirp auditory filter described by Irino as an analytical
wavelet and examines its application to a different speech signals.
  The obtained results will be compared with those obtained by two other
predefined wavelet families that are Morlet and Mexican Hat. The results show
that the gammachirp wavelet family gives results that are comparable to ones
obtained by Morlet and Mexican Hat wavelet family.
","[{'version': 'v1', 'created': 'Wed, 27 Jul 2011 14:42:52 GMT'}]",2011-07-28,"[['Salhi', 'Lotfi', ''], ['Ouni', 'Kais', '']]","['Gammachirp', 'Wavelet Transform', 'Cochlear Filter', 'speech Processing']"
3217,1409.0325,Drazen Lucanin MSc,"Dra\v{z}en Lu\v{c}anin, Foued Jrad, Ivona Brandic, Achim Streit",Energy-Aware Cloud Management through Progressive SLA Specification,"14 pages, conference",,10.1007/978-3-319-14609-6,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Novel energy-aware cloud management methods dynamically reallocate
computation across geographically distributed data centers to leverage regional
electricity price and temperature differences. As a result, a managed VM may
suffer occasional downtimes. Current cloud providers only offer high
availability VMs, without enough flexibility to apply such energy-aware
management. In this paper we show how to analyse past traces of dynamic cloud
management actions based on electricity prices and temperatures to estimate VM
availability and price values. We propose a novel SLA specification approach
for offering VMs with different availability and price values guaranteed over
multiple SLAs to enable flexible energy-aware cloud management. We determine
the optimal number of such SLAs as well as their availability and price
guaranteed values. We evaluate our approach in a user SLA selection simulation
using Wikipedia and Grid'5000 workloads. The results show higher customer
conversion and 39% average energy savings per VM.
","[{'version': 'v1', 'created': 'Mon, 1 Sep 2014 08:35:08 GMT'}]",2015-03-18,"[['Lučanin', 'Dražen', ''], ['Jrad', 'Foued', ''], ['Brandic', 'Ivona', ''], ['Streit', 'Achim', '']]","['cloud computing', 'SLA', 'pricing', 'energy efficiency']"
3218,1905.03156,Zhongyuan Hau,"Zhongyuan Hau, John H. Castellanos and Jianying Zhou","Evaluating Cascading Impact of Attacks on Resilience of Industrial
  Control Systems: A Design-Centric Modeling Approach",,,10.1145/3384941.3409587,,cs.CR cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A design-centric modeling approach was proposed to model the behaviour of the
physical processes controlled by Industrial Control Systems (ICS) and study the
cascading impact of data-oriented attacks. A threat model was used as input to
guide the construction of the CPS model where control components which are
within the adversary's intent and capabilities are extracted. The relevant
control components are subsequently modeled together with their control
dependencies and operational design specifications. The approach was
demonstrated and validated on a water treatment testbed. Attacks were simulated
on the testbed model where its resilience to attacks was evaluated using
proposed metrics such as Impact Ratio and Time-to-Critical-State. From the
analysis of the attacks, design strengths and weaknesses were identified and
design improvements were recommended to increase the testbed's resilience to
attacks.
","[{'version': 'v1', 'created': 'Wed, 8 May 2019 15:32:49 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Jul 2020 02:25:50 GMT'}]",2020-07-20,"[['Hau', 'Zhongyuan', ''], ['Castellanos', 'John H.', ''], ['Zhou', 'Jianying', '']]","['Cyber-Physical Systems Security', 'Dynamical Systems Modeling', 'Cascading Impact of Attacks', 'Security Evaluation', 'Resilience Engineering']"
3219,1911.13168,Mehrdad Noori,"Sina Mohammadi, Mehrdad Noori, Ali Bahri, Sina Ghofrani Majelan,
  Mohammad Havaei",CAGNet: Content-Aware Guidance for Salient Object Detection,"25 pages, 10 figures, 5 tables, Accepted by Elsevier, Pattern
  Recognition","Pattern Recognition, Volume 103, 2020, 107303, ISSN 0031-3203",10.1016/j.patcog.2020.107303,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Beneficial from Fully Convolutional Neural Networks (FCNs), saliency
detection methods have achieved promising results. However, it is still
challenging to learn effective features for detecting salient objects in
complicated scenarios, in which i) non-salient regions may have ""salient-like""
appearance; ii) the salient objects may have different-looking regions. To
handle these complex scenarios, we propose a Feature Guide Network which
exploits the nature of low-level and high-level features to i) make foreground
and background regions more distinct and suppress the non-salient regions which
have ""salient-like"" appearance; ii) assign foreground label to
different-looking salient regions. Furthermore, we utilize a Multi-scale
Feature Extraction Module (MFEM) for each level of abstraction to obtain
multi-scale contextual information. Finally, we design a loss function which
outperforms the widely-used Cross-entropy loss. By adopting four different
pre-trained models as the backbone, we prove that our method is very general
with respect to the choice of the backbone model. Experiments on five
challenging datasets demonstrate that our method achieves the state-of-the-art
performance in terms of different evaluation metrics. Additionally, our
approach contains fewer parameters than the existing ones, does not need any
post-processing, and runs fast at a real-time speed of 28 FPS when processing a
480 x 480 image.
","[{'version': 'v1', 'created': 'Fri, 29 Nov 2019 16:03:47 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Apr 2020 20:11:23 GMT'}]",2020-04-07,"[['Mohammadi', 'Sina', ''], ['Noori', 'Mehrdad', ''], ['Bahri', 'Ali', ''], ['Majelan', 'Sina Ghofrani', ''], ['Havaei', 'Mohammad', '']]","['Saliency detection', 'Fully convolutional neural networks', 'Attention guidance']"
3220,1307.7472,Puneet Kumar,"Puneet Kumar, Dharminder Kumar, Narendra Kumar","Improved Service Delivery and Cost Effective Framework for e-Governance
  in India","4 pages, 3 figures Published with International Journal of Computer
  Applications (IJCA)","International Journal of Computer Applications 74(2):20-23, July
  2013. New York, USA",10.5120/12858-9577,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In current era, the involvement of technologies like virtualization,
consolidation and cloud computing, and adoption of free and open source
software in designing and deploying e-governance that can reduce the total cost
associated with and hence the financial burden abide by the state and central
governments. The success of any e-governance project depends upon its
utilization by the intended group and so there accessibility needs to be
enhanced drastically by reengineered framework. Here, we design an Improved
Service Delivery and Cost Effective Framework for e-Governance that will be
useful for success of e-governance projects and the delivery mechanism in India
by using free and open access software for development and deployment of
e-governance applications, virtualization and consolidation techniques for
management of e-services and cloud computing for enhancing the accessibility of
services.
","[{'version': 'v1', 'created': 'Mon, 29 Jul 2013 06:31:24 GMT'}]",2013-07-30,"[['Kumar', 'Puneet', ''], ['Kumar', 'Dharminder', ''], ['Kumar', 'Narendra', '']]","['ICT', 'FOSS', 'GDCs', 'G-Cloud', 'TCO', 'NeGP']"
3221,1906.01388,Md Johirul Islam,Md Johirul Islam and Giang Nguyen and Rangeet Pan and Hridesh Rajan,A Comprehensive Study on Deep Learning Bug Characteristics,,"The ACM Joint European Software Engineering Conference and
  Symposium on the Foundations of Software Engineering (ESEC/FSE) (Aug. 2019)",,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning has gained substantial popularity in recent years. Developers
mainly rely on libraries and tools to add deep learning capabilities to their
software. What kinds of bugs are frequently found in such software? What are
the root causes of such bugs? What impacts do such bugs have? Which stages of
deep learning pipeline are more bug prone? Are there any antipatterns?
Understanding such characteristics of bugs in deep learning software has the
potential to foster the development of better deep learning platforms,
debugging mechanisms, development practices, and encourage the development of
analysis and verification frameworks. Therefore, we study 2716 high-quality
posts from Stack Overflow and 500 bug fix commits from Github about five
popular deep learning libraries Caffe, Keras, Tensorflow, Theano, and Torch to
understand the types of bugs, root causes of bugs, impacts of bugs, bug-prone
stage of deep learning pipeline as well as whether there are some common
antipatterns found in this buggy software. The key findings of our study
include: data bug and logic bug are the most severe bug types in deep learning
software appearing more than 48% of the times, major root causes of these bugs
are Incorrect Model Parameter (IPS) and Structural Inefficiency (SI) showing up
more than 43% of the times. We have also found that the bugs in the usage of
deep learning libraries have some common antipatterns that lead to a strong
correlation of bug types among the libraries.
","[{'version': 'v1', 'created': 'Mon, 3 Jun 2019 14:40:36 GMT'}]",2019-06-05,"[['Islam', 'Md Johirul', ''], ['Nguyen', 'Giang', ''], ['Pan', 'Rangeet', ''], ['Rajan', 'Hridesh', '']]","['Deep learning software', 'Q&A forums', 'Bugs', 'Deep learning bugs', 'Empirical Study of Bugs']"
3222,2210.08042,Song Gao,"Jinmeng Rao, Song Gao, Michelle Miller, Alfonso Morales","Measuring Network Resilience via Geospatial Knowledge Graph: a Case
  Study of the US Multi-Commodity Flow Network","9 pages, 5 figures, GeoKG'22","The 1st ACM SIGSPATIAL International Workshop on Geospatial
  Knowledge Graphs (GeoKG '22), November 1, 2022, Seattle, WA, USA",10.1145/3557990.3567569,,cs.SI cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Quantifying the resilience in the food system is important for food security
issues. In this work, we present a geospatial knowledge graph (GeoKG)-based
method for measuring the resilience of a multi-commodity flow network.
Specifically, we develop a CFS-GeoKG ontology to describe geospatial semantics
of a multi-commodity flow network comprehensively, and design resilience
metrics that measure the node-level and network-level dependence of
single-sourcing, distant, or non-adjacent suppliers/customers in food supply
chains. We conduct a case study of the US state-level agricultural
multi-commodity flow network with hierarchical commodity types. The results
indicate that, by leveraging GeoKG, our method supports measuring both
node-level and network-level resilience across space and over time and also
helps discover concentration patterns of agricultural resources in the spatial
network at different geographic scales.
","[{'version': 'v1', 'created': 'Sun, 9 Oct 2022 23:12:16 GMT'}]",2022-10-18,"[['Rao', 'Jinmeng', ''], ['Gao', 'Song', ''], ['Miller', 'Michelle', ''], ['Morales', 'Alfonso', '']]","['resilience', 'knowledge graph', 'smart foodsheds', 'food supply chain', 'commodity flow survey']"
3223,1903.00904,Xuhong Wang,"Xuhong Wang, Ying Du, Shijie Lin, Ping Cui, Yuntian Shen and Yupu Yang","adVAE: A self-adversarial variational autoencoder with Gaussian anomaly
  prior knowledge for anomaly detection",This paper has been accepted by Knowledge-based Systems,,10.1016/j.knosys.2019.105187,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, deep generative models have become increasingly popular in
unsupervised anomaly detection. However, deep generative models aim at
recovering the data distribution rather than detecting anomalies. Besides, deep
generative models have the risk of overfitting training samples, which has
disastrous effects on anomaly detection performance. To solve the above two
problems, we propose a Self-adversarial Variational Autoencoder with a Gaussian
anomaly prior assumption. We assume that both the anomalous and the normal
prior distribution are Gaussian and have overlaps in the latent space.
Therefore, a Gaussian transformer net T is trained to synthesize anomalous but
near-normal latent variables. Keeping the original training objective of
Variational Autoencoder, besides, the generator G tries to distinguish between
the normal latent variables and the anomalous ones synthesized by T, and the
encoder E is trained to discriminate whether the output of G is real. These new
objectives we added not only give both G and E the ability to discriminate but
also introduce additional regularization to prevent overfitting. Compared with
the SOTA baselines, the proposed model achieves significant improvements in
extensive experiments. Datasets and our model are available at a Github
repository.
","[{'version': 'v1', 'created': 'Sun, 3 Mar 2019 13:26:19 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Nov 2019 03:37:40 GMT'}, {'version': 'v3', 'created': 'Thu, 14 Nov 2019 12:20:13 GMT'}]",2019-11-15,"[['Wang', 'Xuhong', ''], ['Du', 'Ying', ''], ['Lin', 'Shijie', ''], ['Cui', 'Ping', ''], ['Shen', 'Yuntian', ''], ['Yang', 'Yupu', '']]","['anomaly detection', 'outlier detection', 'novelty detection', 'deep generative model', 'variational autoencoder']"
3224,1811.12173,Alexandre Hocquet,"Alexandre Hocquet, Fr\'ed\'eric Wieber","""Only the Initiates Will Have the Secrets Revealed"": Computational
  Chemists and the Openness of Scientific Software",,"IEEE Annals of the History of Computing, vol. 39, no. 4, pp.
  40-58, October-December 2017",10.1109/MAHC.2018.1221048,halshs-01916969,cs.CY physics.chem-ph physics.hist-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computational chemistry is a scientific field within which the computer is a
pivotal element. This scientific community emerged in the 1980s and was
involved with two major industries: the computer manufacturers and the
pharmaceutical industry, the latter becoming a potential market for the former
through molecular modeling software packages. We aim to address the difficult
relationships between scientific modeling methods and the software implementing
these methods throughout the 1990s. Developing, using, licensing, and
distributing software leads to multiple tensions among the actors in
intertwined academic and industrial contexts. The Computational Chemistry
mailing List (CCL), created in 1991, constitutes a valuable corpus for
revealing the tensions associated with software within the community. We
analyze in detail two flame wars that exemplify these tensions. We conclude
that models and software must be addressed together. Interrelations between
both imply that openness in computational science is complex.
","[{'version': 'v1', 'created': 'Sat, 24 Nov 2018 03:23:31 GMT'}]",2018-11-30,"[['Hocquet', 'Alexandre', ''], ['Wieber', 'Frédéric', '']]","['scientific software', 'computational chemistry', 'software users', 'openness', 'history of chemistry', 'mailing list', 'flame wars']"
3225,1806.02878,Harini Suresh,"Harini Suresh, Jen J. Gong and John Guttag","Learning Tasks for Multitask Learning: Heterogenous Patient Populations
  in the ICU",KDD 2018,,10.1145/3219819.3219930,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning approaches have been effective in predicting adverse
outcomes in different clinical settings. These models are often developed and
evaluated on datasets with heterogeneous patient populations. However, good
predictive performance on the aggregate population does not imply good
performance for specific groups.
  In this work, we present a two-step framework to 1) learn relevant patient
subgroups, and 2) predict an outcome for separate patient populations in a
multi-task framework, where each population is a separate task. We demonstrate
how to discover relevant groups in an unsupervised way with a
sequence-to-sequence autoencoder. We show that using these groups in a
multi-task framework leads to better predictive performance of in-hospital
mortality both across groups and overall. We also highlight the need for more
granular evaluation of performance when dealing with heterogeneous populations.
","[{'version': 'v1', 'created': 'Thu, 7 Jun 2018 19:36:19 GMT'}]",2018-06-11,"[['Suresh', 'Harini', ''], ['Gong', 'Jen J.', ''], ['Guttag', 'John', '']]","['clinical risk models', 'multi-task learning', 'patient subpopulationdiscovery']"
3226,2205.05739,Avinash Madasu,"Avinash Madasu, Junier Oliva, Gedas Bertasius",Learning to Retrieve Videos by Asking Questions,,ACM Multimedia 2022,10.1145/3503161.3548361,,cs.CV cs.AI cs.CL cs.HC cs.MA,http://creativecommons.org/licenses/by/4.0/,"  The majority of traditional text-to-video retrieval systems operate in static
environments, i.e., there is no interaction between the user and the agent
beyond the initial textual query provided by the user. This can be sub-optimal
if the initial query has ambiguities, which would lead to many falsely
retrieved videos. To overcome this limitation, we propose a novel framework for
Video Retrieval using Dialog (ViReD), which enables the user to interact with
an AI agent via multiple rounds of dialog, where the user refines retrieved
results by answering questions generated by an AI agent. Our novel multimodal
question generator learns to ask questions that maximize the subsequent video
retrieval performance using (i) the video candidates retrieved during the last
round of interaction with the user and (ii) the text-based dialog history
documenting all previous interactions, to generate questions that incorporate
both visual and linguistic cues relevant to video retrieval. Furthermore, to
generate maximally informative questions, we propose an Information-Guided
Supervision (IGS), which guides the question generator to ask questions that
would boost subsequent video retrieval accuracy. We validate the effectiveness
of our interactive ViReD framework on the AVSD dataset, showing that our
interactive method performs significantly better than traditional
non-interactive video retrieval systems. We also demonstrate that our proposed
approach generalizes to the real-world settings that involve interactions with
real humans, thus, demonstrating the robustness and generality of our framework
","[{'version': 'v1', 'created': 'Wed, 11 May 2022 19:14:39 GMT'}, {'version': 'v2', 'created': 'Fri, 13 May 2022 16:39:43 GMT'}, {'version': 'v3', 'created': 'Sat, 16 Jul 2022 06:06:53 GMT'}]",2022-07-19,"[['Madasu', 'Avinash', ''], ['Oliva', 'Junier', ''], ['Bertasius', 'Gedas', '']]","['interactive video retrieval', 'dialog generation', 'multi-modal learning']"
3227,1804.04105,Qing Ke,Qing Ke,Comparing scientific and technological impact of biomedical research,,"Journal of Informetrics 12, 706-717 (2018)",10.1016/j.joi.2018.06.010,,cs.DL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditionally, the number of citations that a scholarly paper receives from
other papers is used as the proxy of its scientific impact. Yet citations can
come from domains outside the scientific community, and one such example is
through patented technologies---paper can be cited by patents, achieving
technological impact. While the scientific impact of papers has been
extensively studied, the technological aspect remains less known in the
literature. Here we aim to fill this gap by presenting a comparative study on
how 919 thousand biomedical papers are cited by U.S. patents and by other
papers over time. We observe a positive correlation between citations from
patents and from papers, but there is little overlap between the two domains in
either the most cited papers, or papers with the most delayed recognition. We
also find that the two types of citations exhibit distinct temporal variations,
with patent citations lagging behind paper citations for a median of 6 years
for the majority of papers. Our work contributes to the understanding of the
technological impact of papers.
","[{'version': 'v1', 'created': 'Wed, 11 Apr 2018 17:22:19 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Jul 2018 21:31:10 GMT'}]",2018-07-05,"[['Ke', 'Qing', '']]","['patent-to-paper citation', 'non-patent reference', 'technological impact']"
3228,1002.4392,Serguei Mokhov,"Xin Tong, Joey Paquet, and Serguei A. Mokhov",Complete Context Calculus Design and Implementation in GIPSY,"21 page; 18 listings; 2 figures; a complete version of the referenced
  simple context calculus implementation",,10.1109/COMPSAC.2008.200,,cs.FL cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the integration into the GIPSY of Lucx's context calculus
defined in Wan's PhD thesis. We start by defining different types of tag sets,
then we explain the concept of context, the types of context and the context
calculus operators. Finally, we present how context entities have been
abstracted into Java classes and embedded into the GIPSY system.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2010 19:29:43 GMT'}]",2010-02-24,"[['Tong', 'Xin', ''], ['Paquet', 'Joey', ''], ['Mokhov', 'Serguei A.', '']]","['Context-driven computation', 'Intensional programming', 'Context calculus', 'Tagset']"
3229,1207.3607,Hocine Cherifi,"Can Demirkesen (BIT Lab, LJK), Hocine Cherifi (BIT Lab, Le2i)","Fusing image representations for classification using support vector
  machines","Image and Vision Computing New Zealand, 2009. IVCNZ '09. 24th
  International Conference, Wellington : Nouvelle-Z\'elande (2009)",,10.1109/IVCNZ.2009.5378367,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to improve classification accuracy different image representations
are usually combined. This can be done by using two different fusing schemes.
In feature level fusion schemes, image representations are combined before the
classification process. In classifier fusion, the decisions taken separately
based on individual representations are fused to make a decision. In this paper
the main methods derived for both strategies are evaluated. Our experimental
results show that classifier fusion performs better. Specifically Bayes belief
integration is the best performing strategy for image classification task.
","[{'version': 'v1', 'created': 'Mon, 16 Jul 2012 09:23:06 GMT'}]",2012-07-17,"[['Demirkesen', 'Can', '', 'BIT Lab, LJK'], ['Cherifi', 'Hocine', '', 'BIT Lab, Le2i']]","['image categorization', 'feature level fusion', 'classifier']"
3230,1212.5331,Ameer Albaham,"Ameer Tawfik Albaham, Naomie Salim",Adapting Voting Techniques for Online Forum Thread Retrieval,"The original publication is available at
  http://www.springerlink.com/. Fixing minor typos. arXiv admin note: text
  overlap with arXiv:1212.5590","Advanced Machine Learning Technologies and Applications, 2012,
  322, 439-448",10.1007/978-3-642-35326-0_44,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online forums or message boards are rich knowledge-based communities. In
these communities, thread retrieval is an essential tool facilitating
information access. However, the issue on thread search is how to combine
evidence from text units(messages) to estimate thread relevance. In this paper,
we first rank a list of messages, then we score threads by aggregating their
ranked messages' scores. To aggregate the message scores, we adopt several
voting techniques that have been applied in ranking aggregates tasks such as
blog distillation and expert finding. The experimental result shows that many
voting techniques should be preferred over a baseline that treats a thread as a
concatenation of its message texts.
","[{'version': 'v1', 'created': 'Fri, 21 Dec 2012 04:22:13 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Jan 2013 08:37:47 GMT'}]",2013-01-17,"[['Albaham', 'Ameer Tawfik', ''], ['Salim', 'Naomie', '']]","['Forum thread search', 'Ranking aggregates', 'Voting techniques']"
3231,1004.4063,Aline Parreau,"Olivier Delmas (LaBRI), Sylvain Gravier (IF), Mickael Montassier
  (LaBRI), Aline Parreau (IF)",On two variations of identifying codes,,"Discrete Mathematics 311, 17 (2011) 1948-1956",10.1016/j.disc.2011.05.018,,cs.DM cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identifying codes have been introduced in 1998 to model fault-detection in
multiprocessor systems. In this paper, we introduce two variations of
identifying codes: weak codes and light codes. They correspond to
fault-detection by successive rounds. We give exact bounds for those two
definitions for the family of cycles.
","[{'version': 'v1', 'created': 'Fri, 23 Apr 2010 07:51:31 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Jun 2011 14:48:12 GMT'}]",2011-06-21,"[['Delmas', 'Olivier', '', 'LaBRI'], ['Gravier', 'Sylvain', '', 'IF'], ['Montassier', 'Mickael', '', 'LaBRI'], ['Parreau', 'Aline', '', 'IF']]","['identifying codes', 'cycles', 'metric basis']"
3232,1107.0431,H. Reiju Mihara,"Masahiro Kumabe, H. Reiju Mihara","Preference aggregation theory without acyclicity: The core without
  majority dissatisfaction",27+3 pages,Games and Economic Behavior (2011) 72:187-201,10.1016/j.geb.2010.06.008,,cs.GT math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Acyclicity of individual preferences is a minimal assumption in social choice
theory. We replace that assumption by the direct assumption that preferences
have maximal elements on a fixed agenda. We show that the core of a simple game
is nonempty for all profiles of such preferences if and only if the number of
alternatives in the agenda is less than the Nakamura number of the game. The
same is true if we replace the core by the core without majority
dissatisfaction, obtained by deleting from the agenda all the alternatives that
are non-maximal for all players in a winning coalition. Unlike the core, the
core without majority dissatisfaction depends only on the players' sets of
maximal elements and is included in the union of such sets. A result for an
extended framework gives another sense in which the core without majority
dissatisfaction behaves better than the core.
","[{'version': 'v1', 'created': 'Sun, 3 Jul 2011 06:34:06 GMT'}]",2011-07-05,"[['Kumabe', 'Masahiro', ''], ['Mihara', 'H. Reiju', '']]","['Core', 'Nakamura number', 'kappa number', 'simple games', 'voting games', 'maximal elements', 'acyclic preferences', 'limit ordinals']"
3233,1601.07414,Marco Scarsini,"Ga\""etan Fournier and Marco Scarsini",Location Games on Networks: Existence and Efficiency of Equilibria,"38 pages, 10 figures",,10.1287/moor.2017.0921,,cs.GT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a game where a finite number of retailers choose a location,
given that their potential consumers are distributed on a network. Retailers do
not compete on price but only on location, therefore each consumer shops at the
closest store. We show that when the number of retailers is large enough, the
game admits a pure Nash equilibrium and we construct it. We then compare the
equilibrium cost borne by the consumers with the cost that could be achieved if
the retailers followed the dictate of a benevolent planner. We perform this
comparison in term of the price of anarchy, i.e., the ratio of the worst
equilibrium cost and the optimal cost, and the price of stability, i.e., the
ratio of the best equilibrium cost and the optimal cost. We show that,
asymptotically in the number of retailers, these ratios are bounded by two and
one, respectively.
","[{'version': 'v1', 'created': 'Wed, 27 Jan 2016 15:40:52 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Apr 2017 11:17:03 GMT'}]",2019-01-03,"[['Fournier', 'Gaëtan', ''], ['Scarsini', 'Marco', '']]","['Price of anarchy', 'price of stability', 'location games on networks', 'Hotelling games', 'pure equilibria', 'large games']"
3234,1409.2156,Ashraf Shahin,Ashraf A. Shahin,Variability Modeling for Customizable SaaS Applications,"11 pages, 10 figures",,10.5121/ijcsit.2014.6503,,cs.SE cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most of current Software-as-a-Service (SaaS) applications are developed as
customizable service-oriented applications that serve a large number of tenants
(users) by one application instance. The current rapid evolution of SaaS
applications increases the demand to study the commonality and variability in
software product lines that produce customizable SaaS applications. During
runtime, Customizability is required to achieve different tenants'
requirements. During the development process, defining and realizing commonalty
and variability in SaaS applications' families is required to develop reusable,
flexible, and customizable SaaS applications at lower costs, in shorter time,
and with higher quality. In this paper, Orthogonal Variability Model (OVM) is
used to model variability in a separated model, which is used to generate
simple and understandable customization model. Additionally, Service oriented
architecture Modeling Language (SoaML) is extended to define and realize
commonalty and variability during the development of SaaS applications.
","[{'version': 'v1', 'created': 'Sun, 7 Sep 2014 19:22:46 GMT'}]",2014-11-10,"[['Shahin', 'Ashraf A.', '']]","['Service-Oriented Architecture', 'SoaML', 'SaaS', 'Variability Modelling', 'Customization Modelling']"
3235,1705.03487,Lav Varshney,"Masahiro Kazama, Minami Sugimoto, Chizuru Hosokawa, Keisuke
  Matsushima, Lav R. Varshney, and Yoshiki Ishikawa",A neural network system for transformation of regional cuisine style,,,10.3389/fict.2018.00014,,cs.CY cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel system which can transform a recipe into any selected
regional style (e.g., Japanese, Mediterranean, or Italian). This system has two
characteristics. First the system can identify the degree of regional cuisine
style mixture of any selected recipe and visualize such regional cuisine style
mixtures using barycentric Newton diagrams. Second, the system can suggest
ingredient substitutions through an extended word2vec model, such that a recipe
becomes more authentic for any selected regional cuisine style. Drawing on a
large number of recipes from Yummly, an example shows how the proposed system
can transform a traditional Japanese recipe, Sukiyaki, into French style.
","[{'version': 'v1', 'created': 'Sat, 6 May 2017 18:35:35 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Jun 2018 15:27:02 GMT'}]",2018-06-26,"[['Kazama', 'Masahiro', ''], ['Sugimoto', 'Minami', ''], ['Hosokawa', 'Chizuru', ''], ['Matsushima', 'Keisuke', ''], ['Varshney', 'Lav R.', ''], ['Ishikawa', 'Yoshiki', '']]","['food', 'big data', 'regional cuisine style', 'newton diagram', 'neural network', 'word2vec']"
3236,1702.08010,Arthur-Jozsef Molnar,"Maria Iuliana Bocicor, Arthur-Jozsef Molnar, Cristian Taslitchi","Preventing Hospital Acquired Infections Through a Workflow-Based
  Cyber-Physical System","Proceedings of ENASE 2016, ISBN: 978-989-758-189-2",,10.5220/0005916900630068,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hospital acquired infections (HAI) are infections acquired within the
hospital from healthcare workers, patients or from the environment, but which
have no connection to the initial reason for the patient's hospital admission.
HAI are a serious world-wide problem, leading to an increase in mortality
rates, duration of hospitalisation as well as significant economic burden on
hospitals. Although clear preventive guidelines exist, studies show that
compliance to them is frequently poor. This paper details the software
perspective for an innovative, business process software based cyber-physical
system that will be implemented as part of a European Union-funded research
project. The system is composed of a network of sensors mounted in different
sites around the hospital, a series of wearables used by the healthcare workers
and a server side workflow engine. For better understanding, we describe the
system through the lens of a single, simple clinical workflow that is
responsible for a significant portion of all hospital infections. The goal is
that when completed, the system will be configurable in the sense of
facilitating the creation and automated monitoring of those clinical workflows
that when combined, account for over 90\% of hospital infections.
","[{'version': 'v1', 'created': 'Sun, 26 Feb 2017 09:40:36 GMT'}]",2017-02-28,"[['Bocicor', 'Maria Iuliana', ''], ['Molnar', 'Arthur-Jozsef', ''], ['Taslitchi', 'Cristian', '']]","['Hospital acquired infection', 'nosocomial infection', 'outbreak', 'clinical workflow monitoring', 'cyber-physicalsystem']"
3237,0912.2554,EPTCS,"Fuad Abujarad (Michigan State University), Borzoo Bonakdarpour
  (VERIMAG), Sandeep S. Kulkarni (Michigan State University)","Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed
  Programs",,"EPTCS 14, 2009, pp. 92-106",10.4204/EPTCS.14.7,,cs.DC cs.SC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Previous work has shown that there are two major complexity barriers in the
synthesis of fault-tolerant distributed programs: (1) generation of fault-span,
the set of states reachable in the presence of faults, and (2) resolving
deadlock states, from where the program has no outgoing transitions. Of these,
the former closely resembles with model checking and, hence, techniques for
efficient verification are directly applicable to it. Hence, we focus on
expediting the latter with the use of multi-core technology.
  We present two approaches for parallelization by considering different design
choices. The first approach is based on the computation of equivalence classes
of program transitions (called group computation) that are needed due to the
issue of distribution (i.e., inability of processes to atomically read and
write all program variables). We show that in most cases the speedup of this
approach is close to the ideal speedup and in some cases it is superlinear. The
second approach uses traditional technique of partitioning deadlock states
among multiple threads. However, our experiments show that the speedup for this
approach is small. Consequently, our analysis demonstrates that a simple
approach of parallelizing the group computation is likely to be the effective
method for using multi-core computing in the context of deadlock resolution.
","[{'version': 'v1', 'created': 'Mon, 14 Dec 2009 00:15:37 GMT'}]",2009-12-15,"[['Abujarad', 'Fuad', '', 'Michigan State University'], ['Bonakdarpour', 'Borzoo', '', 'VERIMAG'], ['Kulkarni', 'Sandeep S.', '', 'Michigan State University']]","['Program transformation', 'Symbolic synthesis', 'Multi-core algorithm', 'Distributed programs']"
3238,1911.09064,Lucas Gren,"Lucas Gren, Alfredo Goldman and Christian Jacobsson",Agile Ways of Working: A Team Maturity Perspective,,"Journal of Software: Evolution and Process, 2019",10.1002/smr.2244,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the agile approach to managing software development projects comes an
increased dependability on well functioning teams, since many of the practices
are built on teamwork. The objective of this study was to investigate if, and
how, team development from a group psychological perspective is related to some
work practices of agile teams. Data were collected from 34 agile teams (200
individuals) from six software development organizations and one university in
both Brazil and Sweden using the Group Development Questionnaire (Scale IV) and
the Perceptive Agile Measurement (PAM). The result indicates a strong
correlation between levels of group maturity and the two agile practices
\emph{iterative development} and \emph{retrospectives}. We, therefore, conclude
that agile teams at different group development stages adopt parts of team
agility differently, thus confirming previous studies but with more data and by
investigating concrete and applied agile practices. We thereby add evidence to
the hypothesis that an agile implementation and management of agile projects
need to be adapted to the group maturity levels of the agile teams.
","[{'version': 'v1', 'created': 'Wed, 20 Nov 2019 17:56:21 GMT'}]",2019-11-26,"[['Gren', 'Lucas', ''], ['Goldman', 'Alfredo', ''], ['Jacobsson', 'Christian', '']]","['group maturity', 'agile software development', 'iterative developments', 'teams']"
3239,1806.03023,Lorenzo Sabattini,"Valeria Villani, Lorenzo Sabattini, Alessio Levratti, Cesare Fantuzzi",An Industrial Social Network for Sharing Knowledge Among Operators,,"Proceedings of the 16th IFAC Symposium on Information Control
  Problems in Manufacturing (INCOM 2018)",10.1016/j.ifacol.2018.08.233,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the increasing complexity of modern automatic machines typically used
in several industrial applications, the need for assistive technologies is
becoming very relevant. Typical approaches consist in designing advanced and
adaptive human-machine interfaces (HMIs) that can be effectively used by any
operator and that provide guided procedures for the most common situations.
However, when dealing with complex systems, infrequent and unforeseen
situations may happen, whose solution require the experience owned by a limited
number of skilled operators. To this end, in this paper we propose an
industrial social network concept to allow an effective exchange of information
among the operators and to facilitate the solution of unforeseen events, such
as unscheduled maintenance activities or troubleshooting.
","[{'version': 'v1', 'created': 'Fri, 8 Jun 2018 08:39:05 GMT'}]",2020-03-06,"[['Villani', 'Valeria', ''], ['Sabattini', 'Lorenzo', ''], ['Levratti', 'Alessio', ''], ['Fantuzzi', 'Cesare', '']]","['Human-machine interface', 'Human-centered design', 'Man/machine systems', 'Userinterfaces', 'Industry automation']"
3240,1802.10089,Daolin Ma,Daolin Ma and Alberto Rodriguez,"Friction Variability in Planar Pushing Data: Anisotropic Friction and
  Data-collection Bias","8 pages, 13 figures",,10.1109/LRA.2018.2851026,,cs.RO physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Friction plays a key role in manipulating objects. Most of what we do with
our hands, and most of what robots do with their grippers, is based on the
ability to control frictional forces. This paper aims to better understand the
variability and predictability of planar friction. In particular, we focus on
the analysis of a recent dataset on planar pushing by Yu et al. [1] devised to
create a data-driven footprint of planar friction.
  We show in this paper how we can explain a significant fraction of the
observed unconventional phenomena, e.g., stochasticity and multi-modality, by
combining the effects of material non-homogeneity, anisotropy of friction and
biases due to data collection dynamics, hinting that the variability is
explainable but inevitable in practice.
  We introduce an anisotropic friction model and conduct simulation experiments
comparing with more standard isotropic friction models. The anisotropic
friction between object and supporting surface results in convergence of
initial condition during the automated data collection. Numerical results
confirm that the anisotropic friction model explains the bias in the dataset
and the apparent stochasticity in the outcome of a push. The fact that the data
collection process itself can originate biases in the collected datasets,
resulting in deterioration of trained models, calls attention to the data
collection dynamics.
","[{'version': 'v1', 'created': 'Tue, 27 Feb 2018 16:13:17 GMT'}, {'version': 'v2', 'created': 'Thu, 17 May 2018 12:58:29 GMT'}, {'version': 'v3', 'created': 'Fri, 18 May 2018 12:56:28 GMT'}, {'version': 'v4', 'created': 'Fri, 22 Jun 2018 22:02:02 GMT'}]",2018-08-07,"[['Ma', 'Daolin', ''], ['Rodriguez', 'Alberto', '']]","['(Contact Modeling; Calibration', 'Identification; Performance Evaluation', 'Benchmarking)']"
3241,1803.04861,Silvia Bartolucci,"Silvia Bartolucci, Pauline Bernat, Daniel Joseph",SHARVOT: secret SHARe-based VOTing on the blockchain,"WETSEB'18:IEEE/ACM 1st International Workshop on Emerging Trends in
  Software Engineering for Blockchain. 5 pages, 2 figures",,10.1145/3194113.3194118,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, there has been a growing interest in using online technologies to
design protocols for secure electronic voting. The main challenges include vote
privacy and anonymity, ballot irrevocability and transparency throughout the
vote counting process. The introduction of the blockchain as a basis for
cryptocurrency protocols, provides for the exploitation of the immutability and
transparency properties of these distributed ledgers.
  In this paper, we discuss possible uses of the blockchain technology to
implement a secure and fair voting system. In particular, we introduce a secret
share-based voting system on the blockchain, the so-called SHARVOT protocol.
Our solution uses Shamir's Secret Sharing to enable on-chain, i.e. within the
transactions script, votes submission and winning candidate determination. The
protocol is also using a shuffling technique, Circle Shuffle, to de-link voters
from their submissions.
","[{'version': 'v1', 'created': 'Tue, 13 Mar 2018 14:57:55 GMT'}]",2018-03-14,"[['Bartolucci', 'Silvia', ''], ['Bernat', 'Pauline', ''], ['Joseph', 'Daniel', '']]","['Voting', 'secret sharing', 'asymmetric encryption', 'blockchain network']"
3242,1510.01018,Huimin Lu,"Huimin Lu, Yujie Li, Shota Nakashima, Seiichi Serikawa",Single Image Dehazing through Improved Atmospheric Light Estimation,Multimedia Tools and Applications (2015),,10.1007/s11042-015-2977-7,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Image contrast enhancement for outdoor vision is important for smart car
auxiliary transport systems. The video frames captured in poor weather
conditions are often characterized by poor visibility. Most image dehazing
algorithms consider to use a hard threshold assumptions or user input to
estimate atmospheric light. However, the brightest pixels sometimes are objects
such as car lights or streetlights, especially for smart car auxiliary
transport systems. Simply using a hard threshold may cause a wrong estimation.
In this paper, we propose a single optimized image dehazing method that
estimates atmospheric light efficiently and removes haze through the estimation
of a semi-globally adaptive filter. The enhanced images are characterized with
little noise and good exposure in dark regions. The textures and edges of the
processed images are also enhanced significantly.
","[{'version': 'v1', 'created': 'Mon, 5 Oct 2015 02:50:42 GMT'}]",2015-10-06,"[['Lu', 'Huimin', ''], ['Li', 'Yujie', ''], ['Nakashima', 'Shota', ''], ['Serikawa', 'Seiichi', '']]","['image dehazing', 'image restoration', 'image enhancement', 'atmospheric light estimation']"
3243,1804.03567,Valdemar \v{S}v\'abensk\'y,"Valdemar \v{S}v\'abensk\'y, Jan Vykopal, Milan Cermak, Martin
  La\v{s}tovi\v{c}ka",Enhancing Cybersecurity Skills by Creating Serious Games,"ACM ITiCSE 2018 conference, 6 pages, 1 figure, 2 tables",,10.1145/3197091.3197123,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Adversary thinking is an essential skill for cybersecurity experts, enabling
them to understand cyber attacks and set up effective defenses. While this
skill is commonly exercised by Capture the Flag games and hands-on activities,
we complement these approaches with a key innovation: undergraduate students
learn methods of network attack and defense by creating educational games in a
cyber range. In this paper, we present the design of two courses, instruction
and assessment techniques, as well as our observations over the last three
semesters. The students report they had a unique opportunity to deeply
understand the topic and practice their soft skills, as they presented their
results at a faculty open day event. Their peers, who played the created games,
rated the quality and educational value of the games overwhelmingly positively.
Moreover, the open day raised awareness about cybersecurity and research and
development in this field at our faculty. We believe that sharing our teaching
experience will be valuable for instructors planning to introduce active
learning of cybersecurity and adversary thinking.
","[{'version': 'v1', 'created': 'Tue, 3 Apr 2018 09:31:47 GMT'}]",2018-04-11,"[['Švábenský', 'Valdemar', ''], ['Vykopal', 'Jan', ''], ['Cermak', 'Milan', ''], ['Laštovička', 'Martin', '']]","['cybersecurity', 'game-based learning', 'project-based learning']"
3244,1108.5499,Wajeb Gharibi,"Wajeb Gharibi, Omar Saeed Al-Mushayt",A Note on Separable Nonlinear Least Squares Problem,"3 pages; IEEE, 2011 International Conference on Future Computer
  Sciences and Application (ICFCSA 2011), Jun. 18- 19, 2011, Hong Kong",,10.1109/ICFCSA.2011.19,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Separable nonlinear least squares (SNLS)problem is a special class of
nonlinear least squares (NLS)problems, whose objective function is a mixture of
linear and nonlinear functions. It has many applications in many different
areas, especially in Operations Research and Computer Sciences. They are
difficult to solve with the infinite-norm metric. In this paper, we give a
short note on the separable nonlinear least squares problem, unseparated scheme
for NLS, and propose an algorithm for solving mixed linear-nonlinear
minimization problem, method of which results in solving a series of least
squares separable problems.
","[{'version': 'v1', 'created': 'Sun, 28 Aug 2011 14:36:39 GMT'}]",2016-11-17,"[['Gharibi', 'Wajeb', ''], ['Al-Mushayt', 'Omar Saeed', '']]","['Nonlinear least squares problem', 'infinite-norm minimization problem', 'Lagrangian dual', 'subgradient method', 'least squares']"
3245,1712.08858,Tom Hanika,"Tom Hanika and Jens Zumbr\""agel",Towards Collaborative Conceptual Exploration,"15 pages, 2 figures","Graph-Based Representation and Reasoning, 120-134, LNAI 10872,
  Springer",10.1007/978-3-319-91379-7_10,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In domains with high knowledge distribution a natural objective is to create
principle foundations for collaborative interactive learning environments. We
present a first mathematical characterization of a collaborative learning
group, a consortium, based on closure systems of attribute sets and the
well-known attribute exploration algorithm from formal concept analysis. To
this end, we introduce (weak) local experts for subdomains of a given knowledge
domain. These entities are able to refute and potentially accept a given
(implicational) query for some closure system that is a restriction of the
whole domain. On this we build up a consortial expert and show first insights
about the ability of such an expert to answer queries. Furthermore, we depict
techniques on how to cope with falsely accepted implications and on combining
counterexamples. Using notions from combinatorial design theory we further
expand those insights as far as providing first results on the decidability
problem if a given consortium is able to explore some target domain.
Applications in conceptual knowledge acquisition as well as in collaborative
interactive ontology learning are at hand.
","[{'version': 'v1', 'created': 'Sat, 23 Dec 2017 23:25:08 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Mar 2018 15:16:40 GMT'}]",2020-08-26,"[['Hanika', 'Tom', ''], ['Zumbrägel', 'Jens', '']]","['Formal Concept Analysis', 'Implications', 'Attribute Exploration', 'Collaborative Knowledge Acquisition', 'Collaborative Interactive Learning']"
3246,1805.11911,Nils Gessert,"Nils Gessert, Torben Priegnitz, Thore Saathoff, Sven-Thomas Antoni,
  David Meyer, Moritz Franz Hamann, Klaus-Peter J\""unemann, Christoph Otte,
  Alexander Schlaefer","Needle Tip Force Estimation using an OCT Fiber and a Fused convGRU-CNN
  Architecture",Accepted for Publication at MICCAI 2018,,10.1007/978-3-030-00937-3_26,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Needle insertion is common during minimally invasive interventions such as
biopsy or brachytherapy. During soft tissue needle insertion, forces acting at
the needle tip cause tissue deformation and needle deflection. Accurate needle
tip force measurement provides information on needle-tissue interaction and
helps detecting and compensating potential misplacement. For this purpose we
introduce an image-based needle tip force estimation method using an optical
fiber imaging the deformation of an epoxy layer below the needle tip over time.
For calibration and force estimation, we introduce a novel deep learning-based
fused convolutional GRU-CNN model which effectively exploits the
spatio-temporal data structure. The needle is easy to manufacture and our model
achieves a mean absolute error of 1.76 +- 1.5 mN with a cross-correlation
coefficient of 0.9996, clearly outperforming other methods. We test needles
with different materials to demonstrate that the approach can be adapted for
different sensitivities and force ranges. Furthermore, we validate our approach
in an ex-vivo prostate needle insertion scenario.
","[{'version': 'v1', 'created': 'Wed, 30 May 2018 11:53:17 GMT'}]",2018-09-17,"[['Gessert', 'Nils', ''], ['Priegnitz', 'Torben', ''], ['Saathoff', 'Thore', ''], ['Antoni', 'Sven-Thomas', ''], ['Meyer', 'David', ''], ['Hamann', 'Moritz Franz', ''], ['Jünemann', 'Klaus-Peter', ''], ['Otte', 'Christoph', ''], ['Schlaefer', 'Alexander', '']]","['Force Estimation', 'Optical Coherence Tomography', 'Convolutional GRU', 'Convolution Neural Network', 'Needle Placement']"
3247,1507.05539,Tom Ameloot,"Tom J. Ameloot, Jan Van den Bussche, William R. Marczak, Peter Alvaro,
  Joseph M. Hellerstein",Putting Logic-Based Distributed Systems on Stable Grounds,To appear in Theory and Practice of Logic Programming (TPLP),Theory and Practice of Logic Programming 16 (2016) 378-417,10.1017/S1471068415000381,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the Declarative Networking paradigm, Datalog-like languages are used to
express distributed computations. Whereas recently formal operational semantics
for these languages have been developed, a corresponding declarative semantics
has been lacking so far. The challenge is to capture precisely the amount of
nondeterminism that is inherent to distributed computations due to concurrency,
networking delays, and asynchronous communication. This paper shows how a
declarative, model-based semantics can be obtained by simply using the
well-known stable model semantics for Datalog with negation. We show that the
model-based semantics matches previously proposed formal operational semantics.
","[{'version': 'v1', 'created': 'Mon, 20 Jul 2015 15:45:42 GMT'}, {'version': 'v2', 'created': 'Sat, 25 Jul 2015 08:43:42 GMT'}]",2020-02-19,"[['Ameloot', 'Tom J.', ''], ['Bussche', 'Jan Van den', ''], ['Marczak', 'William R.', ''], ['Alvaro', 'Peter', ''], ['Hellerstein', 'Joseph M.', '']]","['Dedalus', 'Datalog', 'stable model semantics', 'distributed system', 'asynchronouscommunication']"
3248,1802.06159,Shuo Zhang,Shuo Zhang and Krisztian Balog,Ad Hoc Table Retrieval using Semantic Similarity,The web conference 2018 (WWW'18),,10.1145/3178876.3186067,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce and address the problem of ad hoc table retrieval: answering a
keyword query with a ranked list of tables. This task is not only interesting
on its own account, but is also being used as a core component in many other
table-based information access scenarios, such as table completion or table
mining. The main novel contribution of this work is a method for performing
semantic matching between queries and tables. Specifically, we (i) represent
queries and tables in multiple semantic spaces (both discrete sparse and
continuous dense vector representations) and (ii) introduce various similarity
measures for matching those semantic representations. We consider all possible
combinations of semantic representations and similarity measures and use these
as features in a supervised learning model. Using a purpose-built test
collection based on Wikipedia tables, we demonstrate significant and
substantial improvements over a state-of-the-art baseline.
","[{'version': 'v1', 'created': 'Fri, 16 Feb 2018 23:20:49 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Feb 2018 08:31:25 GMT'}, {'version': 'v3', 'created': 'Thu, 8 Mar 2018 12:42:14 GMT'}]",2018-03-09,"[['Zhang', 'Shuo', ''], ['Balog', 'Krisztian', '']]","['Table retrieval', 'table search', 'semantic matching', 'semantic representations', 'semantic similarity']"
3249,1204.3052,Vasanth Raja Chittampally,"Chittampally Vasanth Raja, Srinivas Balasubramanian, Prakash S
  Raghavendra","Heterogeneous Highly Parallel Implementation of Matrix Exponentiation
  Using GPU","15 pages, 12 figures, International Journal of Distributed and
  Parallel systems (IJDPS) ISSN : 0976 - 9757 [Online] ; 2229 - 3957 [Print]","International Journal of Distributed and Parallel Systems, Vol 3,
  No. 2, March 2012 issue",10.5121/ijdps.2012.3209,,cs.DC cs.MS cs.NA,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The vision of super computer at every desk can be realized by powerful and
highly parallel CPUs or GPUs or APUs. Graphics processors once specialized for
the graphics applications only, are now used for the highly computational
intensive general purpose applications. Very expensive GFLOPs and TFLOP
performance has become very cheap with the GPGPUs. Current work focuses mainly
on the highly parallel implementation of Matrix Exponentiation. Matrix
Exponentiation is widely used in many areas of scientific community ranging
from highly critical flight, CAD simulations to financial, statistical
applications. Proposed solution for Matrix Exponentiation uses OpenCL for
exploiting the hyper parallelism offered by the many core GPGPUs. It employs
many general GPU optimizations and architectural specific optimizations. This
experimentation covers the optimizations targeted specific to the Scientific
Graphics cards (Tesla-C2050). Heterogeneous Highly Parallel Matrix
Exponentiation method has been tested for matrices of different sizes and with
different powers. The devised Kernel has shown 1000X speedup and 44 fold
speedup with the naive GPU Kernel.
","[{'version': 'v1', 'created': 'Fri, 13 Apr 2012 17:13:50 GMT'}]",2012-04-16,"[['Raja', 'Chittampally Vasanth', ''], ['Balasubramanian', 'Srinivas', ''], ['Raghavendra', 'Prakash S', '']]","['Matrix Exponentiation', 'GPGPU', 'OpenCL', 'Highly Parallel Matrix Exponentiation']"
3250,1307.4990,Purnendu  Banerjee,Purnendu Banerjee and B. B. Chaudhuri,Video Text Localization using Wavelet and Shearlet Transforms,arXiv admin note: text overlap with arXiv:1101.0553 by other authors,,10.1117/12.2036077,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Text in video is useful and important in indexing and retrieving the video
documents efficiently and accurately. In this paper, we present a new method of
text detection using a combined dictionary consisting of wavelets and a
recently introduced transform called shearlets. Wavelets provide optimally
sparse expansion for point-like structures and shearlets provide optimally
sparse expansions for curve-like structures. By combining these two features we
have computed a high frequency sub-band to brighten the text part. Then K-means
clustering is used for obtaining text pixels from the Standard Deviation (SD)
of combined coefficient of wavelets and shearlets as well as the union of
wavelets and shearlets features. Text parts are obtained by grouping
neighboring regions based on geometric properties of the classified output
frame of unsupervised K-means classification. The proposed method tested on a
standard as well as newly collected database shows to be superior to some
existing methods.
","[{'version': 'v1', 'created': 'Thu, 18 Jul 2013 15:58:19 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Nov 2013 11:57:23 GMT'}]",2015-06-16,"[['Banerjee', 'Purnendu', ''], ['Chaudhuri', 'B. B.', '']]","['Video text frame', 'Wavelet', 'Shearlet', 'K-means', 'Text localization']"
3251,1609.07630,Renato J Cintra,"P. A. M. Oliveira, R. J. Cintra, F. M. Bayer, S. Kulasekera, A.
  Madanayake, V. A. Coutinho","Low-complexity Image and Video Coding Based on an Approximate Discrete
  Tchebichef Transform","Fixed diagonal matrix, 11 pages, 5 figures, 4 tables",,10.1109/TCSVT.2016.2515378,,cs.MM cs.CV cs.DS stat.CO stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The usage of linear transformations has great relevance for data
decorrelation applications, like image and video compression. In that sense,
the discrete Tchebichef transform (DTT) possesses useful coding and
decorrelation properties. The DTT transform kernel does not depend on the input
data and fast algorithms can be developed to real time applications. However,
the DTT fast algorithm presented in literature possess high computational
complexity. In this work, we introduce a new low-complexity approximation for
the DTT. The fast algorithm of the proposed transform is multiplication-free
and requires a reduced number of additions and bit-shifting operations. Image
and video compression simulations in popular standards shows good performance
of the proposed transform. Regarding hardware resource consumption for FPGA
shows 43.1% reduction of configurable logic blocks and ASIC place and route
realization shows 57.7% reduction in the area-time figure when compared with
the 2-D version of the exact DTT.
","[{'version': 'v1', 'created': 'Sat, 24 Sep 2016 14:49:31 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Apr 2017 21:18:07 GMT'}, {'version': 'v3', 'created': 'Fri, 12 Jul 2019 17:05:20 GMT'}]",2019-07-15,"[['Oliveira', 'P. A. M.', ''], ['Cintra', 'R. J.', ''], ['Bayer', 'F. M.', ''], ['Kulasekera', 'S.', ''], ['Madanayake', 'A.', ''], ['Coutinho', 'V. A.', '']]","['Approximate transforms', 'discrete Tchebichef transform', 'fast algorithms', 'image and video coding']"
3252,1208.2169,Khaled Merit,Khaled Merit and Abdelazziz Ouamri,"Securing Speech in GSM Networks using DES with Random Permutation and
  Inversion Algorithm",,"International Journal of Distributed and Parallel Systems (IJDPS)
  Vol.3, No.4, July 2012, 157-164",10.5121/ijdps.2012.3416,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Global System for Mobile Communications (GSM) is one of the most commonly
used cellular technologies in the world. One of the objectives in mobile
communication systems is the security of the exchanged data. GSM employs many
cryptographic algorithms for security like A5/1, A5/2 and A5/3. Even so, these
algorithms do not provide sufficient level of security for protecting the
confidentiality of GSM. Therefore, it is desirable to increase security by
additional encryption methods. This paper presents a voice encryption method
called: ""DES with Random permutation and Inversion"", based on current voice
channel, which overcomes data channel's insufficiencies and solves the problem
of penetrating the RPE-LTP vocoder by the encrypted voice. The proposed method
fulfils an end-to-end secured communication in the GSM; insure a good
compatibility to all GSM networks, and easy implementation without any
modification in these systems.
","[{'version': 'v1', 'created': 'Fri, 10 Aug 2012 13:39:24 GMT'}]",2012-08-13,"[['Merit', 'Khaled', ''], ['Ouamri', 'Abdelazziz', '']]","['Security', 'GSM', 'Speech channel', 'DES', 'Speech codec']"
3253,1908.00891,Alberto F. Mart\'in,Santiago Badia and Alberto F. Mart\'in,"A tutorial-driven introduction to the parallel finite element library
  FEMPAR v1.0.0",,,10.1016/j.cpc.2019.107059,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work is a user guide to the FEMPAR scientific software library. FEMPAR
is an open-source object-oriented framework for the simulation of partial
differential equations (PDEs) using finite element methods on
distributed-memory platforms. It provides a rich set of tools for numerical
discretization and built-in scalable solvers for the resulting linear systems
of equations. An application expert that wants to simulate a PDE-governed
problem has to extend the framework with a description of the weak form of the
PDE at hand (and additional perturbation terms for non-conforming
approximations). We show how to use the library by going through three
different tutorials. The first tutorial simulates a linear PDE (Poisson
equation) in a serial environment for a structured mesh using both continuous
and discontinuous Galerkin finite element methods. The second tutorial extends
it with adaptive mesh refinement on octree meshes. The third tutorial is a
distributed-memory version of the previous one that combines a scalable octree
handler and a scalable domain decomposition solver. The exposition is
restricted to linear PDEs and simple geometries to keep it concise. The
interested user can dive into more tutorials available in the FEMPAR public
repository to learn about further capabilities of the library, e.g., nonlinear
PDEs and nonlinear solvers, time integration, multi-field PDEs, block
preconditioning, or unstructured mesh handling.
","[{'version': 'v1', 'created': 'Fri, 2 Aug 2019 14:45:02 GMT'}]",2019-11-26,"[['Badia', 'Santiago', ''], ['Martín', 'Alberto F.', '']]","['Mathematical Software', 'Finite Elements', 'Object-Oriented Programming', 'PartialDifferential Equations']"
3254,1407.2717,Babatunde Olabenjo,"Olabenjo Babatunde, Omar Al-Debagy","A Comparative Review Of Internet Protocol Version 4 (IPv4) and Internet
  Protocol Version 6 (IPv6)","4 pages, 2 tables, Published with International Journal of Computer
  Trends and Technology (IJCTT)","Olabenjo Babatunde , Omar Al-Debagy.""A Comparative Review Of
  Internet Protocol Version 4 (IPv4) and Internet Protocol Version 6 (IPv6)"".
  International Journal of Computer Trends and Technology (IJCTT) V13(1):10-13,
  July 2014",10.14445/22312803/IJCTT-V13P103,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many computers and devices are becoming more connected to the internet in
recent years; the use of the Internet Protocol (IP) has made the connectivity
and identification of these devices possible in large scale. In this paper, we
will discuss the evolution of Internet Protocol version 4 (IPv4), its features,
issues and limitations and how Internet Protocol version 6 (IPv6) tends to
solve some of these issues including the differences and transition between
these two protocols.
","[{'version': 'v1', 'created': 'Thu, 10 Jul 2014 07:29:00 GMT'}]",2014-07-11,"[['Babatunde', 'Olabenjo', ''], ['Al-Debagy', 'Omar', '']]","['IPv4', 'IPv6', 'Networking', 'Internet']"
3255,1508.00051,Yan Fang,"Yan Fang, Victor V. Yashin, Donald M. Chiarulli, Steven P. Levitan",A Simplified Phase Model for Oscillator Based Computing,2015 IEEE Computer Society Annual Symposium on VLSI (ISVLSI),,10.1109/ISVLSI.2015.44,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Building oscillator based computing systems with emerging nano-device
technologies has become a promising solution for unconventional computing tasks
like computer vision and pattern recognition. However, simulation and analysis
of these systems is both time and compute intensive due to the nonlinearity of
new devices and the complex behavior of coupled oscillators. In order to speed
up the simulation of coupled oscillator systems, we propose a simplified phase
model to perform phase and frequency synchronization prediction based on a
synthesis of earlier models. Our model can predict the frequency locking
behavior with several orders of magnitude speedup compared to direct
evaluation, enabling the effective and efficient simulation of the large
numbers of oscillators required for practical computing systems.
","[{'version': 'v1', 'created': 'Fri, 31 Jul 2015 23:26:11 GMT'}]",2016-11-15,"[['Fang', 'Yan', ''], ['Yashin', 'Victor V.', ''], ['Chiarulli', 'Donald M.', ''], ['Levitan', 'Steven P.', '']]","['Non-Boolean Computing', 'Oscillator Based Computing', 'Coupled Oscillators', 'Phase Model', 'Synchronization']"
3256,1804.10388,Elias Alevizos,"Elias Alevizos, Alexander Artikis, Georgios Paliouras",Event Forecasting with Pattern Markov Chains,,,10.1145/3093742.3093920,,cs.DB cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a system for online probabilistic event forecasting. We assume
that a user is interested in detecting and forecasting event patterns, given in
the form of regular expressions. Our system can consume streams of events and
forecast when the pattern is expected to be fully matched. As more events are
consumed, the system revises its forecasts to reflect possible changes in the
state of the pattern. The framework of Pattern Markov Chains is used in order
to learn a probabilistic model for the pattern, with which forecasts with
guaranteed precision may be produced, in the form of intervals within which a
full match is expected. Experimental results from real-world datasets are shown
and the quality of the produced forecasts is explored, using both precision
scores and two other metrics: spread, which refers to the ""focusing resolution""
of a forecast (interval length), and distance, which captures how early a
forecast is reported.
","[{'version': 'v1', 'created': 'Fri, 27 Apr 2018 08:33:12 GMT'}]",2018-12-18,"[['Alevizos', 'Elias', ''], ['Artikis', 'Alexander', ''], ['Paliouras', 'Georgios', '']]","['Complex event processing', 'Stream processing', 'Finite Automata', 'RegularExpressions']"
3257,0909.3091,Xin Liu,"Xin Liu, John Kountouriotis, Athina P. Petropulu and Kapil R. Dandekar","ALOHA With Collision Resolution(ALOHA-CR): Theory and Software Defined
  Radio Implementation",,,10.1109/TSP.2010.2048315,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A cross-layer scheme, namely ALOHA With Collision Resolution (ALOHA-CR), is
proposed for high throughput wireless communications in a cellular scenario.
Transmissions occur in a time-slotted ALOHA-type fashion but with an important
difference: simultaneous transmissions of two users can be successful. If more
than two users transmit in the same slot the collision cannot be resolved and
retransmission is required. If only one user transmits, the transmitted packet
is recovered with some probability, depending on the state of the channel. If
two users transmit the collision is resolved and the packets are recovered by
first over-sampling the collision signal and then exploiting independent
information about the two users that is contained in the signal polyphase
components. The ALOHA-CR throughput is derived under the infinite backlog
assumption and also under the assumption of finite backlog. The contention
probability is determined under these two assumptions in order to maximize the
network throughput and maintain stability. Queuing delay analysis for network
users is also conducted. The performance of ALOHA-CR is demonstrated on the
Wireless Open Access Research Platform (WARP) test-bed containing five software
defined radio nodes. Analysis and test-bed results indicate that ALOHA-CR leads
to significant increase in throughput and reduction of service delays.
","[{'version': 'v1', 'created': 'Wed, 16 Sep 2009 19:46:12 GMT'}]",2015-05-14,"[['Liu', 'Xin', ''], ['Kountouriotis', 'John', ''], ['Petropulu', 'Athina P.', ''], ['Dandekar', 'Kapil R.', '']]","['multi-user system', 'blind source separation', 'MIMO systems', 'collision resolution', 'soft']"
3258,1807.04638,Monica Hernandez,Monica Hernandez,"PDE-constrained LDDMM via geodesic shooting and inexact
  Gauss-Newton-Krylov optimization using the incremental adjoint Jacobi
  equations",,,10.1088/1361-6560/aaf598,,cs.NA cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The class of non-rigid registration methods proposed in the framework of
PDE-constrained Large Deformation Diffeomorphic Metric Mapping is a
particularly interesting family of physically meaningful diffeomorphic
registration methods. Inexact Newton-Krylov optimization has shown an excellent
numerical accuracy and an extraordinarily fast convergence rate in this
framework. However, the Galerkin representation of the non-stationary velocity
fields does not provide proper geodesic paths. In this work, we propose a
method for PDE-constrained LDDMM parameterized in the space of initial velocity
fields under the EPDiff equation. The derivation of the gradient and the
Hessian-vector products are performed on the final velocity field and
transported backward using the adjoint and the incremental adjoint Jacobi
equations. This way, we avoid the complex dependence on the initial velocity
field in the derivations and the computation of the adjoint equation and its
incremental counterpart. The proposed method provides geodesics in the
framework of PDE-constrained LDDMM, and it shows performance competitive to
benchmark PDE-constrained LDDMM and EPDiff-LDDMM methods.
","[{'version': 'v1', 'created': 'Wed, 11 Jul 2018 14:08:16 GMT'}]",2019-01-30,"[['Hernandez', 'Monica', '']]","['PDE-constrained', 'diffeomorphic registration', 'Gauss-Newton-Krylovoptimization', 'geodesic shooting', 'incremental adjoint Jacobi equations']"
3259,1611.05626,Jesus Garcia Galan,"Jes\'us Garc\'ia-Gal\'an, Liliana Pasquale, George Grispos and Bashar
  Nuseibeh",Towards Adaptive Compliance,Position paper at SEAMS'16,,10.1145/2897053.2897070,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mission critical software is often required to comply with multiple
regulations, standards or policies. Recent paradigms, such as cloud computing,
also require software to operate in heterogeneous, highly distributed, and
changing environments. In these environments, compliance requirements can vary
at runtime and traditional compliance management techniques, which are normally
applied at design time, may no longer be sufficient. In this paper, we motivate
the need for adaptive compliance by illustrating possible compliance concerns
determined by runtime variability. We further motivate our work by means of a
cloud computing scenario, and present two main contributions. First, we propose
and justify a process to support adaptive compliance that ex- tends the
traditional compliance management lifecycle with the activities of the
Monitor-Analyse-Plan-Execute (MAPE) loop, and enacts adaptation through
re-configuration. Second, we explore the literature on software compliance and
classify existing work in terms of the activities and concerns of adaptive
compliance. In this way, we determine how the literature can support our
proposal and what are the open research challenges that need to be addressed in
order to fully support adaptive compliance.
","[{'version': 'v1', 'created': 'Thu, 17 Nov 2016 10:23:44 GMT'}]",2016-11-18,"[['García-Galán', 'Jesús', ''], ['Pasquale', 'Liliana', ''], ['Grispos', 'George', ''], ['Nuseibeh', 'Bashar', '']]","['adaptive compliance', 'challenges', 'compliance as a service', 'self-adaptation']"
3260,1407.6245,Fran\c{c}ois Boulogne,"Stefan van der Walt, Johannes L. Sch\""onberger, Juan Nunez-Iglesias,
  Fran\c{c}ois Boulogne, Joshua D. Warner, Neil Yager, Emmanuelle Gouillart,
  Tony Yu, the scikit-image contributors",scikit-image: Image processing in Python,Distributed under Creative Commons CC-BY 4.0. Published in PeerJ,,10.7717/peerj.453,,cs.MS cs.CV,http://creativecommons.org/licenses/by/3.0/,"  scikit-image is an image processing library that implements algorithms and
utilities for use in research, education and industry applications. It is
released under the liberal ""Modified BSD"" open source license, provides a
well-documented API in the Python programming language, and is developed by an
active, international team of collaborators. In this paper we highlight the
advantages of open source to achieve the goals of the scikit-image library, and
we showcase several real-world image processing applications that use
scikit-image.
","[{'version': 'v1', 'created': 'Wed, 23 Jul 2014 14:55:21 GMT'}]",2014-07-24,"[['van der Walt', 'Stefan', ''], ['Schönberger', 'Johannes L.', ''], ['Nunez-Iglesias', 'Juan', ''], ['Boulogne', 'François', ''], ['Warner', 'Joshua D.', ''], ['Yager', 'Neil', ''], ['Gouillart', 'Emmanuelle', ''], ['Yu', 'Tony', ''], ['contributors', 'the scikit-image', '']]","['image processing', 'reproducible research', 'education', 'visualization']"
3261,1208.6421,Muneendra Ojha,Muneendra Ojha,"A Novel Service Oriented Model for Query Identification and Solution
  Development using Semantic Web and Multi Agent System","7 pages, 4 figures, Published with International Journal of Computer
  Applications (IJCA)","International Journal of Computer Applications 35(9):12-18, 2011",10.5120/4428-6165,,cs.MA cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose to develop service model architecture by merging
multi-agentsystems and semantic web technology. The proposed architecture works
in two stages namely, Query Identification and Solution Development. A person
referred to as customer will submit the problem details or requirements which
will be referred to as a query. Anyone who can provide a service will need to
register with the registrar module of the architecture. Services can be
anything ranging from expert consultancy in the field of agriculture to
academic research, from selling products to manufacturing goods, from medical
help to legal issues or even providing logistics. Query submitted by customer
is first parsed and then iteratively understood with the help of domain experts
and the customer to get a precise set of properties. Query thus identified will
be solved again with the help of intelligent agent systems which will search
the semantic web for all those who can find or provide a solution. A workable
solution workflow is created and then depending on the requirements, using the
techniques of negotiation or auctioning, solution is implemented to complete
the service for customer. This part is termed as solution development. In this
service oriented architecture, we first try to analyze the complex set of user
requirements then try to provide best possible solution in an optimized way by
combining better information searches through semantic web and better workflow
provisioning using multi agent systems.
","[{'version': 'v1', 'created': 'Fri, 31 Aug 2012 08:38:33 GMT'}]",2012-09-03,"[['Ojha', 'Muneendra', '']]","['Semantic Web', 'Multi-Agent System', 'Service Oriented']"
3262,1707.05344,Zhihui Zhu,"Zhihui Zhu, Santhosh Karnik, Mark A. Davenport, Justin Romberg,
  Michael B. Wakin","The Eigenvalue Distribution of Discrete Periodic Time-Frequency Limiting
  Operators",,,10.1109/LSP.2017.2751578,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bandlimiting and timelimiting operators play a fundamental role in analyzing
bandlimited signals that are approximately timelimited (or vice versa). In this
paper, we consider a time-frequency (in the discrete Fourier transform (DFT)
domain) limiting operator whose eigenvectors are known as the periodic discrete
prolate spheroidal sequences (PDPSSs). We establish new nonasymptotic results
on the eigenvalue distribution of this operator. As a byproduct, we also
characterize the eigenvalue distribution of a set of submatrices of the DFT
matrix, which is of independent interest.
","[{'version': 'v1', 'created': 'Mon, 17 Jul 2017 18:10:16 GMT'}]",2018-02-14,"[['Zhu', 'Zhihui', ''], ['Karnik', 'Santhosh', ''], ['Davenport', 'Mark A.', ''], ['Romberg', 'Justin', ''], ['Wakin', 'Michael B.', '']]","['periodic discrete prolate spheroidal sequences', 'partialdiscrete Fourier transform matrix', 'eigenvalue distribution', 'timefrequency analysis']"
3263,2001.11274,Alfonso White,"Alfonso White, Daniela M. Romano",Scalable Psychological Momentum Forecasting in Esports,"8 pages, 8 figures","Proceedings of Workshop SUM '20: State-based User Modelling, The
  13th ACM International Conference on Web Search and Data Mining (WSDM '20),
  2020",10.13140/RG.2.2.21224.21769,,cs.LG cs.AI cs.HC cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The world of competitive Esports and video gaming has seen and continues to
experience steady growth in popularity and complexity. Correspondingly, more
research on the topic is being published, ranging from social network analyses
to the benchmarking of advanced artificial intelligence systems in playing
against humans. In this paper, we present ongoing work on an intelligent agent
recommendation engine that suggests actions to players in order to maximise
success and enjoyment, both in the space of in-game choices, as well as
decisions made around play session timing in the broader context. By leveraging
temporal data and appropriate models, we show that a learned representation of
player psychological momentum, and of tilt, can be used, in combination with
player expertise, to achieve state-of-the-art performance in pre- and
post-draft win prediction. Our progress toward fulfilling the potential for
deriving optimal recommendations is documented.
","[{'version': 'v1', 'created': 'Thu, 30 Jan 2020 11:57:40 GMT'}, {'version': 'v2', 'created': 'Sat, 15 Feb 2020 01:16:19 GMT'}]",2020-02-18,"[['White', 'Alfonso', ''], ['Romano', 'Daniela M.', '']]","['Psychological momentum', 'recommender systems', 'recurrent neuralnetworks', 'multiplayer online battle arenas']"
3264,1612.02149,Sergio Cabello,"Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein,
  Christian Knauer",Covering many points with a small-area box,,"J. Computational Geometry 10 (1): 207-222, 2019",10.20382/jocg.v10i1a8,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $P$ be a set of $n$ points in the plane. We show how to find, for a given
integer $k>0$, the smallest-area axis-parallel rectangle that covers $k$ points
of $P$ in $O(nk^2 \log n+ n\log^2 n)$ time. We also consider the problem of,
given a value $\alpha>0$, covering as many points of $P$ as possible with an
axis-parallel rectangle of area at most $\alpha$. For this problem we give a
probabilistic $(1-\varepsilon)$-approximation that works in near-linear time:
In $O((n/\varepsilon^4)\log^3 n \log (1/\varepsilon))$ time we find an
axis-parallel rectangle of area at most $\alpha$ that, with high probability,
covers at least $(1-\varepsilon)\mathrm{\kappa^*}$ points, where
$\mathrm{\kappa^*}$ is the maximum possible number of points that could be
covered.
","[{'version': 'v1', 'created': 'Wed, 7 Dec 2016 08:41:46 GMT'}, {'version': 'v2', 'created': 'Fri, 25 May 2018 08:24:15 GMT'}]",2019-07-12,"[['de Berg', 'Mark', ''], ['Cabello', 'Sergio', ''], ['Cheong', 'Otfried', ''], ['Eppstein', 'David', ''], ['Knauer', 'Christian', '']]","['geometric optimization', 'covering', 'axis-parallel rectangle', 'near-linear time', 'approximation algorithm']"
3265,1703.08198,Daniel Lemire,Antonio Badia and Daniel Lemire,"On Desirable Semantics of Functional Dependencies over Databases with
  Incomplete Information",to appear in Fundamenta Informaticae,Fundamenta Informaticae 158 (2018) 327-352,10.3233/FI-2018-1651,,cs.DB,http://creativecommons.org/licenses/by/4.0/,"  Codd's relational model describes just one possible world. To better cope
with incomplete information, extended database models allow several possible
worlds. Vague tables are one such convenient extended model where attributes
accept sets of possible values (e.g., the manager is either Jill or Bob).
However, conceptual database design in such cases remains an open problem. In
particular, there is no canonical definition of functional dependencies (FDs)
over possible worlds (e.g., each employee has just one manager). We identify
several desirable properties that the semantics of such FDs should meet
including Armstrong's axioms, the independence from irrelevant attributes,
seamless satisfaction and implied by strong satisfaction. We show that we can
define FDs such that they have all our desirable properties over vague tables.
However, we also show that no notion of FD can satisfy all our desirable
properties over a more general model (disjunctive tables). Our work formalizes
a trade-off between having a general model and having well-behaved FDs.
","[{'version': 'v1', 'created': 'Thu, 23 Mar 2017 18:29:03 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Apr 2017 20:08:04 GMT'}]",2018-03-01,"[['Badia', 'Antonio', ''], ['Lemire', 'Daniel', '']]","['Relational Database', 'Functional Dependencies', 'Database Design', 'Incomplete Information', 'Conceptual Design']"
3266,2105.10816,Shadab Hussain,"Shadab Hussain, Dr. Santosh Kumar Nanda, Susmith Barigidad, Shadab
  Akhtar, Md Suaib, Niranjan K. Ray","Novel Deep Learning Architecture for Heart Disease Prediction using
  Convolutional Neural Network",,,10.1109/OCIT53463.2021.00076,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Healthcare is one of the most important aspects of human life. Heart disease
is known to be one of the deadliest diseases which is hampering the lives of
many people around the world. Heart disease must be detected early so the loss
of lives can be prevented. The availability of large-scale data for medical
diagnosis has helped developed complex machine learning and deep learning-based
models for automated early diagnosis of heart diseases. The classical
approaches have been limited in terms of not generalizing well to new data
which have not been seen in the training set. This is indicated by a large gap
in training and test accuracies. This paper proposes a novel deep learning
architecture using a 1D convolutional neural network for classification between
healthy and non-healthy persons to overcome the limitations of classical
approaches. Various clinical parameters are used for assessing the risk profile
in the patients which helps in early diagnosis. Various techniques are used to
avoid overfitting in the proposed network. The proposed network achieves over
97% training accuracy and 96% test accuracy on the dataset. The accuracy of the
model is compared in detail with other classification algorithms using various
performance parameters which proves the effectiveness of the proposed
architecture.
","[{'version': 'v1', 'created': 'Sat, 22 May 2021 22:00:57 GMT'}, {'version': 'v2', 'created': 'Tue, 25 May 2021 15:22:08 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Sep 2021 21:13:10 GMT'}, {'version': 'v4', 'created': 'Sun, 26 Dec 2021 21:36:13 GMT'}]",2021-12-28,"[['Hussain', 'Shadab', ''], ['Nanda', 'Dr. Santosh Kumar', ''], ['Barigidad', 'Susmith', ''], ['Akhtar', 'Shadab', ''], ['Suaib', 'Md', ''], ['Ray', 'Niranjan K.', '']]","['Heart Disease Prediction', 'Healthcare', 'Deep Learning', '1D Convolutional Neural Network', 'Embedding Layer', 'Overfitting']"
3267,1504.07082,Bharathi Pilar,"B.H.Shekar, Bharathi Pilar","Shape Representation and Classification through Pattern Spectrum and
  Local Binary Pattern - A Decision Level Fusion Approach","Fifth International Conference on Signals and Image Processing
  (ICSIP) 2014",,10.1109/ICSIP.2014.41,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a decision level fused local Morphological Pattern
Spectrum(PS) and Local Binary Pattern (LBP) approach for an efficient shape
representation and classification. This method makes use of Earth Movers
Distance(EMD) as the measure in feature matching and shape retrieval process.
The proposed approach has three major phases : Feature Extraction, Construction
of hybrid spectrum knowledge base and Classification. In the first phase,
feature extraction of the shape is done using pattern spectrum and local binary
pattern method. In the second phase, the histograms of both pattern spectrum
and local binary pattern are fused and stored in the knowledge base. In the
third phase, the comparison and matching of the features, which are represented
in the form of histograms, is done using Earth Movers Distance(EMD) as metric.
The top-n shapes are retrieved for each query shape. The accuracy is tested by
means of standard Bulls eye score method. The experiments are conducted on
publicly available shape datasets like Kimia-99, Kimia-216 and MPEG-7. The
comparative study is also provided with the well known approaches to exhibit
the retrieval accuracy of the proposed approach.
","[{'version': 'v1', 'created': 'Mon, 27 Apr 2015 13:38:20 GMT'}]",2015-04-28,"[['Shekar', 'B. H.', ''], ['Pilar', 'Bharathi', '']]","['Pattern spectra', 'Earth Movers Distance', 'Histogrammatching', 'Shape retrieval', 'Local Binary Pattern']"
3268,1208.2115,Ismael Etxeberria-Agiriano,"Ismael Etxeberria-Agiriano, Isidro Calvo, Liliana Montero and Ivan
  Alonso","A DDS-Based Scalable and Reconfigurable Framework for Cyber-Physical
  Systems","13 pages, 6 figures","International Journal of Software Engineering & Applications
  (IJSEA), vol. 3, no. 4 (2012) 25-37",10.5121/ijsea.2012.3403,,cs.DC cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Cyber-Physical Systems (CPSs) involve the interconnection of heterogeneous
computing devices which are closely integrated with the physical processes
under control. Often, these systems are resource-constrained and require
specific features such as the ability to adapt in a timeliness and efficient
fashion to dynamic environments. Also, they must support fault tolerance and
avoid single points of failure. This paper describes a scalable framework for
CPSs based on the OMG DDS standard. The proposed solution allows reconfiguring
this kind of systems at run-time and managing efficiently their resources.
","[{'version': 'v1', 'created': 'Fri, 10 Aug 2012 08:47:10 GMT'}]",2012-08-13,"[['Etxeberria-Agiriano', 'Ismael', ''], ['Calvo', 'Isidro', ''], ['Montero', 'Liliana', ''], ['Alonso', 'Ivan', '']]","['CPS', 'Distributed Systems', 'Fault-tolerance', 'DDS', 'Middleware']"
3269,1812.05964,Thomas Rolinger,"Thomas B. Rolinger, Tyler A. Simon, Christopher D. Krieger",An Empirical Evaluation of Allgatherv on Multi-GPU Systems,"2018 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid
  Computing (CCGRID)",,10.1109/CCGRID.2018.00027,,cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Applications for deep learning and big data analytics have compute and memory
requirements that exceed the limits of a single GPU. However, effectively
scaling out an application to multiple GPUs is challenging due to the
complexities of communication between the GPUs, particularly for collective
communication with irregular message sizes. In this work, we provide a
performance evaluation of the Allgatherv routine on multi-GPU systems, focusing
on GPU network topology and the communication library used. We present results
from the OSU-micro benchmark as well as conduct a case study for sparse tensor
factorization, one application that uses Allgatherv with highly irregular
message sizes. We extend our existing tensor factorization tool to run on
systems with different node counts and varying number of GPUs per node. We then
evaluate the communication performance of our tool when using traditional MPI,
CUDA-aware MVAPICH and NCCL across a suite of real-world data sets on three
different systems: a 16-node cluster with one GPU per node, NVIDIA's DGX-1 with
8 GPUs and Cray's CS-Storm with 16 GPUs. Our results show that irregularity in
the tensor data sets produce trends that contradict those in the OSU
micro-benchmark, as well as trends that are absent from the benchmark.
","[{'version': 'v1', 'created': 'Fri, 14 Dec 2018 14:46:25 GMT'}]",2018-12-17,"[['Rolinger', 'Thomas B.', ''], ['Simon', 'Tyler A.', ''], ['Krieger', 'Christopher D.', '']]","['GPU', 'collective communication', 'MVAPICH', 'NCCL', 'DGX-1', 'NVLink', 'tensors', 'irregular']"
3270,1511.05869,Jeff Jones Dr,Jeff Jones,"Mechanisms Inducing Parallel Computation in a Model of Physarum
  polycephalum Transport Networks",,"Transport Networks, Parallel Processing Letters, (25), 1, 1540004
  (2015)",10.1142/S0129626415400046,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  P. polycephalum may be considered as a spatially represented parallel
unconventional computing substrate, but how can this `computer' be programmed?
In this paper we examine and catalogue individual low-level mechanisms which
may be used to induce network formation and adaptation in a multi-agent model
of P. polycephalum. These mechanisms include those intrinsic to the model
(particle sensor angle, rotation angle, and scaling parameters) and those
mediated by the environment (stimulus loca- tion, distance, angle,
concentration, engulfment and consumption of nutrients, and the presence of
simulated light irradiation, repellents and obstacles). The mechanisms in- duce
a concurrent integration of chemoattractant and chemorepellent gradients
diffusing within the 2D lattice upon which the agent population resides,
stimulating growth, move- ment, morphological adaptation and network
minimisation. Chemoattractant gradients, and their modulation by the engulfment
and consumption of nutrients by the model population, represent an efficient
outsourcing of spatial computation. The mechanisms may prove useful in
understanding the search strategies and adaptation of distributed organisms
within their environment, in understanding the minimal requirements for com-
plex adaptive behaviours, and in developing methods of spatially programming
parallel unconventional computers and robotic devices.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2015 16:43:55 GMT'}]",2016-10-23,"[['Jones', 'Jeff', '']]","['Unconventional Computing', 'Slime Mould', 'Morphological Adaptation', 'Multiagent', 'Material Computation']"
3271,1207.3869,Chathuranga Widanapathirana,"Chathuranga Widanapathirana, Y. Ahmet \c{S}ekercio\v{g}lu, Milosh V.
  Ivanovich, Paul G. Fitzpatrick, and Jonathan C. Li","Automated Inference System for End-To-End Diagnosis of Network
  Performance Issues in Client-Terminal Devices",arXiv admin note: substantial text overlap with arXiv:1207.3560,"International Journal of Computer Networks & Communications
  (IJCNC) 2012; ISSN: 0975-2293/(e)0974-9322",10.5121/ijcnc.2012.4303,,cs.NI cs.AI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional network diagnosis methods of Client-Terminal Device (CTD)
problems tend to be laborintensive, time consuming, and contribute to increased
customer dissatisfaction. In this paper, we propose an automated solution for
rapidly diagnose the root causes of network performance issues in CTD. Based on
a new intelligent inference technique, we create the Intelligent Automated
Client Diagnostic (IACD) system, which only relies on collection of
Transmission Control Protocol (TCP) packet traces. Using soft-margin Support
Vector Machine (SVM) classifiers, the system (i) distinguishes link problems
from client problems and (ii) identifies characteristics unique to the specific
fault to report the root cause. The modular design of the system enables
support for new access link and fault types. Experimental evaluation
demonstrated the capability of the IACD system to distinguish between faulty
and healthy links and to diagnose the client faults with 98% accuracy. The
system can perform fault diagnosis independent of the user's specific TCP
implementation, enabling diagnosis of diverse range of client devices
","[{'version': 'v1', 'created': 'Tue, 17 Jul 2012 03:51:57 GMT'}]",2012-07-18,"[['Widanapathirana', 'Chathuranga', ''], ['Şekercioǧlu', 'Y. Ahmet', ''], ['Ivanovich', 'Milosh V.', ''], ['Fitzpatrick', 'Paul G.', ''], ['Li', 'Jonathan C.', '']]","['Automated Diagnosis', 'Intelligent Inference', 'TCP', 'Support Vector Machines', 'Network Fault']"
3272,1801.07150,Muhammad Abulaish,"Muhammad Abulaish, Jahiruddin",A Novel Weighted Distance Measure for Multi-Attributed Graph,,"Muhammad Abulaish and Jahiruddin, A Novel Weighted Distance
  Measure for Multi-Attributed Graph, In Proceedings of the 10th Annual ACM
  India Conference (COMPUTE), Bhopal, India, Nov. 16-18, 2017, pp. 1-9",,,cs.SI cs.AI cs.DS cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to exponential growth of complex data, graph structure has become
increasingly important to model various entities and their interactions, with
many interesting applications including, bioinformatics, social network
analysis, etc. Depending on the complexity of the data, the underlying graph
model can be a simple directed/undirected and/or weighted/un-weighted graph to
a complex graph (aka multi-attributed graph) where vertices and edges are
labelled with multi-dimensional vectors. In this paper, we present a novel
weighted distance measure based on weighted Euclidean norm which is defined as
a function of both vertex and edge attributes, and it can be used for various
graph analysis tasks including classification and cluster analysis. The
proposed distance measure has flexibility to increase/decrease the weightage of
edge labels while calculating the distance between vertex-pairs. We have also
proposed a MAGDist algorithm, which reads multi-attributed graph stored in CSV
files containing the list of vertex vectors and edge vectors, and calculates
the distance between each vertex-pair using the proposed weighted distance
measure. Finally, we have proposed a multi-attributed similarity graph
generation algorithm, MAGSim, which reads the output of MAGDist algorithm and
generates a similarity graph that can be analysed using classification and
clustering algorithms. The significance and accuracy of the proposed distance
measure and algorithms is evaluated on Iris and Twitter data sets, and it is
found that the similarity graph generated by our proposed method yields better
clustering results than the existing similarity graph generation methods.
","[{'version': 'v1', 'created': 'Mon, 22 Jan 2018 15:46:40 GMT'}]",2018-01-23,"[['Abulaish', 'Muhammad', ''], ['Jahiruddin', '', '']]","['Data mining', 'Clustering', 'Multi-attributed graph', 'Weighted distancemeasure', 'Similarity measure']"
3273,1310.7443,Surya Prasath,"V. B. S. Prasath, Juan C. Moreno","On Convergent Finite Difference Schemes for Variational - PDE Based
  Image Processing","23 pages, 12 figures, 2 tables","Computational and Applied Mathematics, 2017",10.1007/s40314-016-0414-9,,cs.CV math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study an adaptive anisotropic Huber functional based image restoration
scheme. By using a combination of L2-L1 regularization functions, an adaptive
Huber functional based energy minimization model provides denoising with edge
preservation in noisy digital images. We study a convergent finite difference
scheme based on continuous piecewise linear functions and use a variable
splitting scheme, namely the Split Bregman, to obtain the discrete minimizer.
Experimental results are given in image denoising and comparison with additive
operator splitting, dual fixed point, and projected gradient schemes illustrate
that the best convergence rates are obtained for our algorithm.
","[{'version': 'v1', 'created': 'Mon, 16 Sep 2013 23:07:39 GMT'}]",2017-11-22,"[['Prasath', 'V. B. S.', ''], ['Moreno', 'Juan C.', '']]","['Image restoration', 'Adaptive denoising', 'Finite differences', 'Convergence', 'Huber functional']"
3274,1807.02603,Helio M. de Oliveira,H. M. de Oliveira and Raydonal Ospina,A Note on the Shannon Entropy of Short Sequences,3 figures,,10.14209/SBRT.2018.8,,cs.IT math.IT stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For source sequences of length L symbols we proposed to use a more realistic
value to the usual benchmark of number of code letters by source letters. Our
idea is based on a quantifier of information fluctuation of a source, F(U),
which corresponds to the second central moment of the random variable that
measures the information content of a source symbol. An alternative
interpretation of typical sequences is additionally provided through this
approach.
","[{'version': 'v1', 'created': 'Sat, 7 Jul 2018 02:13:18 GMT'}]",2019-09-27,"[['de Oliveira', 'H. M.', ''], ['Ospina', 'Raydonal', '']]","['Shannon entropy', 'information fluctuation', 'sourcecoding', 'typical sequences']"
3275,1803.06397,Bernhard Kratzwald,"Bernhard Kratzwald, Suzana Ilic, Mathias Kraus, Stefan Feuerriegel,
  Helmut Prendinger","Deep learning for affective computing: text-based emotion recognition in
  decision support",Accepted by Decision Support Systems (DSS),,10.1016/j.dss.2018.09.002,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Emotions widely affect human decision-making. This fact is taken into account
by affective computing with the goal of tailoring decision support to the
emotional states of individuals. However, the accurate recognition of emotions
within narrative documents presents a challenging undertaking due to the
complexity and ambiguity of language. Performance improvements can be achieved
through deep learning; yet, as demonstrated in this paper, the specific nature
of this task requires the customization of recurrent neural networks with
regard to bidirectional processing, dropout layers as a means of
regularization, and weighted loss functions. In addition, we propose
sent2affect, a tailored form of transfer learning for affective computing: here
the network is pre-trained for a different task (i.e. sentiment analysis),
while the output layer is subsequently tuned to the task of emotion
recognition. The resulting performance is evaluated in a holistic setting
across 6 benchmark datasets, where we find that both recurrent neural networks
and transfer learning consistently outperform traditional machine learning.
Altogether, the findings have considerable implications for the use of
affective computing.
","[{'version': 'v1', 'created': 'Fri, 16 Mar 2018 21:05:13 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Mar 2018 15:37:32 GMT'}, {'version': 'v3', 'created': 'Mon, 26 Mar 2018 15:42:57 GMT'}, {'version': 'v4', 'created': 'Tue, 10 Apr 2018 09:41:12 GMT'}, {'version': 'v5', 'created': 'Mon, 20 Aug 2018 17:10:52 GMT'}, {'version': 'v6', 'created': 'Mon, 10 Sep 2018 09:07:30 GMT'}]",2018-11-14,"[['Kratzwald', 'Bernhard', ''], ['Ilic', 'Suzana', ''], ['Kraus', 'Mathias', ''], ['Feuerriegel', 'Stefan', ''], ['Prendinger', 'Helmut', '']]","['Affective computing', 'Emotion recognition', 'Deep learning', 'Natural languageprocessing', 'Text mining', 'Transfer learning']"
3276,1603.04199,Matthieu Perrin,"Matthieu Perrin (LINA), Achour Mostefaoui (LINA), Claude Jard (LINA)",Causal Consistency: Beyond Memory,"21st ACM SIGPLAN Symposium on Principles and Practice of Parallel
  Programming, Mar 2016, Barcelone, Spain",,10.1145/2851141.2851170,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In distributed systems where strong consistency is costly when not
impossible, causal consistency provides a valuable abstraction to represent
program executions as partial orders. In addition to the sequential program
order of each computing entity, causal order also contains the semantic links
between the events that affect the shared objects -- messages emission and
reception in a communication channel , reads and writes on a shared register.
Usual approaches based on semantic links are very difficult to adapt to other
data types such as queues or counters because they require a specific analysis
of causal dependencies for each data type. This paper presents a new approach
to define causal consistency for any abstract data type based on sequential
specifications. It explores, formalizes and studies the differences between
three variations of causal consistency and highlights them in the light of
PRAM, eventual consistency and sequential consistency: weak causal consistency,
that captures the notion of causality preservation when focusing on convergence
; causal convergence that mixes weak causal consistency and convergence; and
causal consistency, that coincides with causal memory when applied to shared
memory.
","[{'version': 'v1', 'created': 'Mon, 14 Mar 2016 10:43:01 GMT'}]",2016-03-15,"[['Perrin', 'Matthieu', '', 'LINA'], ['Mostefaoui', 'Achour', '', 'LINA'], ['Jard', 'Claude', '', 'LINA']]","['Causal consistency', 'Consistency criteria', 'Pipelinedconsistency', 'Sequential consistency', 'Shared objects', 'Weakcausal consistency']"
3277,1812.00276,Tony Mason,Tony Mason and Ada Gavrilovska and David A. Joyner,Collaboration Versus Cheating,"7 pages, 1 figure, 5 tables, SIGCSE 2019",,10.1145/3287324.3287443,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We outline how we detected programming plagiarism in an introductory online
course for a master's of science in computer science program, how we achieved a
statistically significant reduction in programming plagiarism by combining a
clear explanation of university and class policy on academic honesty reinforced
with a short but formal assessment, and how we evaluated plagiarism rates
before SIGand after implementing our policy and assessment.
","[{'version': 'v1', 'created': 'Sat, 1 Dec 2018 22:41:42 GMT'}]",2018-12-04,"[['Mason', 'Tony', ''], ['Gavrilovska', 'Ada', ''], ['Joyner', 'David A.', '']]","['MOSS', 'Academic Honesty', 'Honor Codes', 'Plagiarism', 'MOOC', 'Online', 'OMSCS']"
3278,2009.03257,Leon Moonen,Carl Martin Rosenberg and Leon Moonen,"Improving Problem Identification via Automated Log Clustering using
  Dimensionality Reduction",,"Published in ESEM'18, Proceedings of the 12th ACM/IEEE
  International Symposium on Empirical Software Engineering and Measurement,
  October 2018, Article: 16, pp. 1-10,",10.1145/3239235.3239248,,cs.SE cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Goal: We consider the problem of automatically grouping logs of runs that
failed for the same underlying reasons, so that they can be treated more
effectively, and investigate the following questions: (1) Does an approach
developed to identify problems in system logs generalize to identifying
problems in continuous deployment logs? (2) How does dimensionality reduction
affect the quality of automated log clustering? (3) How does the criterion used
for merging clusters in the clustering algorithm affect clustering quality?
  Method: We replicate and extend earlier work on clustering system log files
to assess its generalization to continuous deployment logs. We consider the
optional inclusion of one of these dimensionality reduction techniques:
Principal Component Analysis (PCA), Latent Semantic Indexing (LSI), and
Non-negative Matrix Factorization (NMF). Moreover, we consider three
alternative cluster merge criteria (Single Linkage, Average Linkage, and
Weighted Linkage), in addition to the Complete Linkage criterion used in
earlier work. We empirically evaluate the 16 resulting configurations on
continuous deployment logs provided by our industrial collaborator.
  Results: Our study shows that (1) identifying problems in continuous
deployment logs via clustering is feasible, (2) including NMF significantly
improves overall accuracy and robustness, and (3) Complete Linkage performs
best of all merge criteria analyzed.
  Conclusions: We conclude that problem identification via automated log
clustering is improved by including dimensionality reduction, as it decreases
the pipeline's sensitivity to parameter choice, thereby increasing its
robustness for handling different inputs.
","[{'version': 'v1', 'created': 'Mon, 7 Sep 2020 17:26:18 GMT'}]",2020-09-08,"[['Rosenberg', 'Carl Martin', ''], ['Moonen', 'Leon', '']]","['Continuous engineering', 'failure diagnosis', 'log analysis', 'log mining']"
3279,2105.10707,Yifan Jia,"Yifan Jia, Jingyi Wang, Christopher M. Poskitt, Sudipta Chattopadhyay,
  Jun Sun, Yuqi Chen","Adversarial Attacks and Mitigation for Anomaly Detectors of
  Cyber-Physical Systems","Accepted by the International Journal of Critical Infrastructure
  Protection (IJCIP)","Int. J. Crit. Infrastructure Prot. 34:100452, 2021",10.1016/j.ijcip.2021.100452,,cs.CR cs.AI cs.LG cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The threats faced by cyber-physical systems (CPSs) in critical infrastructure
have motivated research into a multitude of attack detection mechanisms,
including anomaly detectors based on neural network models. The effectiveness
of anomaly detectors can be assessed by subjecting them to test suites of
attacks, but less consideration has been given to adversarial attackers that
craft noise specifically designed to deceive them. While successfully applied
in domains such as images and audio, adversarial attacks are much harder to
implement in CPSs due to the presence of other built-in defence mechanisms such
as rule checkers(or invariant checkers). In this work, we present an
adversarial attack that simultaneously evades the anomaly detectors and rule
checkers of a CPS. Inspired by existing gradient-based approaches, our
adversarial attack crafts noise over the sensor and actuator values, then uses
a genetic algorithm to optimise the latter, ensuring that the neural network
and the rule checking system are both deceived.We implemented our approach for
two real-world critical infrastructure testbeds, successfully reducing the
classification accuracy of their detectors by over 50% on average, while
simultaneously avoiding detection by rule checkers. Finally, we explore whether
these attacks can be mitigated by training the detectors on adversarial
samples.
","[{'version': 'v1', 'created': 'Sat, 22 May 2021 12:19:03 GMT'}]",2021-06-16,"[['Jia', 'Yifan', ''], ['Wang', 'Jingyi', ''], ['Poskitt', 'Christopher M.', ''], ['Chattopadhyay', 'Sudipta', ''], ['Sun', 'Jun', ''], ['Chen', 'Yuqi', '']]","['Cyber-physical systems', 'industrial control systems', 'anomaly detectors', 'neural networks', 'adversarial attacks', 'testingdefence mechanisms']"
3280,1303.6803,Marc Hellmuth,Marc Hellmuth and Wilfried Imrich and Tomas Kupka,"Partial Star Products: A Local Covering Approach for the Recognition of
  Approximate Cartesian Product Graphs",,,10.1007/s11786-013-0156-7,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is concerned with the recognition of approximate graph products
with respect to the Cartesian product. Most graphs are prime, although they can
have a rich product-like structure. The proposed algorithms are based on a
local approach that covers a graph by small subgraphs, so-called partial star
products, and then utilizes this information to derive the global factors and
an embedding of the graph under investigation into Cartesian product graphs.
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2013 12:16:31 GMT'}, {'version': 'v2', 'created': 'Wed, 8 May 2013 15:23:29 GMT'}, {'version': 'v3', 'created': 'Mon, 17 Jun 2013 10:59:41 GMT'}]",2014-07-14,"[['Hellmuth', 'Marc', ''], ['Imrich', 'Wilfried', ''], ['Kupka', 'Tomas', '']]","['Cartesian product', 'approximate product', 'partial star product', 'product relation']"
3281,2003.13352,Juan Quiroz,"Juan C Quiroz, Liliana Laranjo, Catalin Tufanaru, Ahmet Baki
  Kocaballi, Dana Rezazadegan, Shlomo Berkovsky, Enrico Coiera","Empirical Analysis of Zipf's Law, Power Law, and Lognormal Distributions
  in Medical Discharge Reports","Reduced word count to 3000, moved methods details to appendices","International Journal of Medical Informatics (2020), 104324",10.1016/j.ijmedinf.2020.104324,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bayesian modelling and statistical text analysis rely on informed probability
priors to encourage good solutions. This paper empirically analyses whether
text in medical discharge reports follow Zipf's law, a commonly assumed
statistical property of language where word frequency follows a discrete power
law distribution. We examined 20,000 medical discharge reports from the
MIMIC-III dataset. Methods included splitting the discharge reports into
tokens, counting token frequency, fitting power law distributions to the data,
and testing whether alternative distributions--lognormal, exponential,
stretched exponential, and truncated power law--provided superior fits to the
data. Results show that discharge reports are best fit by the truncated power
law and lognormal distributions. Our findings suggest that Bayesian modelling
and statistical text analysis of discharge report text would benefit from using
truncated power law and lognormal probability priors.
","[{'version': 'v1', 'created': 'Mon, 30 Mar 2020 11:34:53 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Jun 2020 02:02:06 GMT'}, {'version': 'v3', 'created': 'Fri, 17 Jul 2020 01:35:40 GMT'}]",2020-11-09,"[['Quiroz', 'Juan C', ''], ['Laranjo', 'Liliana', ''], ['Tufanaru', 'Catalin', ''], ['Kocaballi', 'Ahmet Baki', ''], ['Rezazadegan', 'Dana', ''], ['Berkovsky', 'Shlomo', ''], ['Coiera', 'Enrico', '']]","['Data mining', 'MIMIC-III dataset', 'machine learning', 'maximum likelihood estimation', 'power-law']"
3282,1612.00997,Samar Shailendra,"Samar Shailendra, R. Bhattacharjee, Sanjay K. Bose","Improving congestion control for Concurrent Multipath Transfer through
  bandwidth estimation based resource pooling","8th International Conference on Information, Communications and
  Signal Processing, ICICS 2012",,10.1109/ICICS.2011.6174285,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stream Control Transmission Protocol (SCTP) was introduced in 2001 as a
multipath variant to traditional transport protocols, i.e. Transmission Control
Protocol (TCP) and User Datagram Protocol (UDP). Concurrent Multipath Transfer
(CMT) has been proposed as an extension for SCTP to support concurrent usage of
available multiple paths. In this paper, we propose a new congestion control
algorithm for CMT-SCTP based on the principle of resource pooling. We use the
connection bandwidth estimates to obtain the collection of the network
resources being used by different flows on multiple paths. Based on these
bandwidth estimates, we have used the bandwidth estimation based resource
pooling approach to adjust the congestion window of the respective paths. We
compare our proposed scheme with CMT-SCTP through ns-2 based simulations.
","[{'version': 'v1', 'created': 'Sat, 3 Dec 2016 18:19:47 GMT'}]",2016-12-06,"[['Shailendra', 'Samar', ''], ['Bhattacharjee', 'R.', ''], ['Bose', 'Sanjay K.', '']]","['Stream Control Transmission Protocol', 'Concurrent Multipath Transfer', 'Congestion Control', 'Bandwidth Estimates', 'Resource Pooling']"
3283,1803.08850,Feichen Shen PhD,"Feichen Shen, David W Larson, James M. Naessens, Elizabeth B.
  Habermann, Hongfang Liu, Sunghwan Sohn","Detection of Surgical Site Infection Utilizing Automated Feature
  Generation in Clinical Notes",,,10.1007/s41666-018-0042-9,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Postsurgical complications (PSCs) are known as a deviation from the normal
postsurgical course and categorized by severity and treatment requirements.
Surgical site infection (SSI) is one of major PSCs and the most common
healthcare-associated infection, resulting in increased length of hospital stay
and cost. In this work, we assessed an automated way to generate lexicon (i.e.,
keyword features) from clinical narratives using sublanguage analysis with
heuristics to detect SSI and evaluated these keywords with medical experts. To
further validate our approach, we also conducted decision tree algorithm on
cohort using automatically generated keywords. The results show that our
framework was able to identify SSI keywords from clinical narratives and to
support search-based natural language processing (NLP) approaches by augmenting
search queries.
","[{'version': 'v1', 'created': 'Fri, 23 Mar 2018 15:55:14 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Mar 2018 16:36:10 GMT'}]",2018-12-10,"[['Shen', 'Feichen', ''], ['Larson', 'David W', ''], ['Naessens', 'James M.', ''], ['Habermann', 'Elizabeth B.', ''], ['Liu', 'Hongfang', ''], ['Sohn', 'Sunghwan', '']]","['postsurgical complication', 'feature generation', 'machine learning', 'natural language processing']"
3284,2006.09467,Nikolaj Tatti,"Sami Hanhij\""arvi, Markus Ojala, Niko Vuokko, Kai Puolam\""aki, Nikolaj
  Tatti, Heikki Mannila","Tell Me Something I Don't Know: Randomization Strategies for Iterative
  Data Mining",,"KDD 2009: Proceedings of the 15th ACM SIGKDD international
  conference on Knowledge discovery and data mining",10.1145/1557019.1557065,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a wide variety of data mining methods available, and it is generally
useful in exploratory data analysis to use many different methods for the same
dataset. This, however, leads to the problem of whether the results found by
one method are a reflection of the phenomenon shown by the results of another
method, or whether the results depict in some sense unrelated properties of the
data. For example, using clustering can give indication of a clear cluster
structure, and computing correlations between variables can show that there are
many significant correlations in the data. However, it can be the case that the
correlations are actually determined by the cluster structure.
  In this paper, we consider the problem of randomizing data so that previously
discovered patterns or models are taken into account. The randomization methods
can be used in iterative data mining. At each step in the data mining process,
the randomization produces random samples from the set of data matrices
satisfying the already discovered patterns or models. That is, given a data set
and some statistics (e.g., cluster centers or co-occurrence counts) of the
data, the randomization methods sample data sets having similar values of the
given statistics as the original data set. We use Metropolis sampling based on
local swaps to achieve this. We describe experiments on real data that
demonstrate the usefulness of our approach. Our results indicate that in many
cases, the results of, e.g., clustering actually imply the results of, say,
frequent pattern discovery.
","[{'version': 'v1', 'created': 'Tue, 16 Jun 2020 19:20:50 GMT'}]",2020-06-18,"[['Hanhijärvi', 'Sami', ''], ['Ojala', 'Markus', ''], ['Vuokko', 'Niko', ''], ['Puolamäki', 'Kai', ''], ['Tatti', 'Nikolaj', ''], ['Mannila', 'Heikki', '']]","['Statistical significance', 'matrix randomization', 'inverse frequent set mining']"
3285,1808.08713,Jeremy Frey,"J\'er\'emy Frey, Jessica Cauchard (IDC)","Remote Biofeedback Sharing, Opportunities and Challenges","WellComp - UbiComp/ISWC'18 Adjunct, Oct 2018, Singapore, Singapore.
  http://ubicomp.org/ubicomp2018/",,10.1145/3267305.3267701,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Biofeedback is commonly used to regulate one's state, for example to manage
stress. The underlying idea is that by perceiving a feedback about their
physiological activity, a user can act upon it. In this paper we describe
through two recent projects how biofeedback could be leveraged to share one's
state at distance. Such extension of biofeedback could answer to the need of
belonging, further widening the applications of the technology in terms of
well-being.
","[{'version': 'v1', 'created': 'Mon, 27 Aug 2018 07:29:05 GMT'}]",2018-08-28,"[['Frey', 'Jérémy', '', 'IDC'], ['Cauchard', 'Jessica', '', 'IDC']]","['Biofeedback', 'Tangible interface', 'Remote Communication']"
3286,1812.04571,Pawel Mlynarski,"Pawel Mlynarski, Herv\'e Delingette, Antonio Criminisi, Nicholas
  Ayache",Deep Learning with Mixed Supervision for Brain Tumor Segmentation,Submitted to SPIE Journal of Medical Imaging,,10.1117/1.JMI.6.3.034002,,cs.CV cs.LG eess.IV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most of the current state-of-the-art methods for tumor segmentation are based
on machine learning models trained on manually segmented images. This type of
training data is particularly costly, as manual delineation of tumors is not
only time-consuming but also requires medical expertise. On the other hand,
images with a provided global label (indicating presence or absence of a tumor)
are less informative but can be obtained at a substantially lower cost. In this
paper, we propose to use both types of training data (fully-annotated and
weakly-annotated) to train a deep learning model for segmentation. The idea of
our approach is to extend segmentation networks with an additional branch
performing image-level classification. The model is jointly trained for
segmentation and classification tasks in order to exploit information contained
in weakly-annotated images while preventing the network to learn features which
are irrelevant for the segmentation task. We evaluate our method on the
challenging task of brain tumor segmentation in Magnetic Resonance images from
BRATS 2018 challenge. We show that the proposed approach provides a significant
improvement of segmentation performance compared to the standard supervised
learning. The observed improvement is proportional to the ratio between
weakly-annotated and fully-annotated images available for training.
","[{'version': 'v1', 'created': 'Mon, 10 Dec 2018 16:03:27 GMT'}]",2019-08-21,"[['Mlynarski', 'Pawel', ''], ['Delingette', 'Hervé', ''], ['Criminisi', 'Antonio', ''], ['Ayache', 'Nicholas', '']]","['Semi-supervised learning', 'Convolutional Neural Networks', 'segmentation', 'tumor', 'MRI']"
3287,1611.02054,Michal Nowicki,Jan Wietrzykowski and Micha{\l} Nowicki and Piotr Skrzypczy\'nski,"Adopting the FAB-MAP algorithm for indoor localization with WiFi
  fingerprints",,,10.1007/978-3-319-54042-9_58,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Personal indoor localization is usually accomplished by fusing information
from various sensors. A common choice is to use the WiFi adapter that provides
information about Access Points that can be found in the vicinity.
Unfortunately, state-of-the-art approaches to WiFi-based localization often
employ very dense maps of the WiFi signal distribution, and require a
time-consuming process of parameter selection. On the other hand, camera images
are commonly used for visual place recognition, detecting whenever the user
observes a scene similar to the one already recorded in a database. Visual
place recognition algorithms can work with sparse databases of recorded scenes
and are in general simple to parametrize. Therefore, we propose a WiFi-based
global localization method employing the structure of the well-known FAB-MAP
visual place recognition algorithm. Similarly to FAB-MAP our method uses
Chow-Liu trees to estimate a joint probability distribution of re-observation
of a place given a set of features extracted at places visited so far. However,
we are the first who apply this idea to recorded WiFi scans instead of visual
words. The new method is evaluated on the UJIIndoorLoc dataset used in the
EvAAL competition, allowing fair comparison with other solutions.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2016 13:55:35 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Apr 2017 06:29:48 GMT'}]",2017-05-01,"[['Wietrzykowski', 'Jan', ''], ['Nowicki', 'Michał', ''], ['Skrzypczyński', 'Piotr', '']]","['WiFi', 'indoor localization', 'FAB-MAP', 'Chow-Liu tree']"
3288,1203.1203,Gabriele Fici,"Michelangelo Bucci, Alessandro De Luca, Gabriele Fici",Enumeration and Structure of Trapezoidal Words,Accepted for publication in Theoretical Computer Science,"Theoretical Computer Science 468, 12-22 (2013)",10.1016/j.tcs.2012.11.007,,cs.FL math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Trapezoidal words are words having at most $n+1$ distinct factors of length
$n$ for every $n\ge 0$. They therefore encompass finite Sturmian words. We give
combinatorial characterizations of trapezoidal words and exhibit a formula for
their enumeration. We then separate trapezoidal words into two disjoint
classes: open and closed. A trapezoidal word is closed if it has a factor that
occurs only as a prefix and as a suffix; otherwise it is open. We investigate
open and closed trapezoidal words, in relation with their special factors. We
prove that Sturmian palindromes are closed trapezoidal words and that a closed
trapezoidal word is a Sturmian palindrome if and only if its longest repeated
prefix is a palindrome. We also define a new class of words, \emph{semicentral
words}, and show that they are characterized by the property that they can be
written as $uxyu$, for a central word $u$ and two different letters $x,y$.
Finally, we investigate the prefixes of the Fibonacci word with respect to the
property of being open or closed trapezoidal words, and show that the sequence
of open and closed prefixes of the Fibonacci word follows the Fibonacci
sequence.
","[{'version': 'v1', 'created': 'Tue, 6 Mar 2012 14:04:29 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Oct 2012 23:06:07 GMT'}]",2013-01-22,"[['Bucci', 'Michelangelo', ''], ['De Luca', 'Alessandro', ''], ['Fici', 'Gabriele', '']]","['Sturmian words', 'trapezoidal words', 'rich words', 'closed words', 'special factors', 'palindromes', 'enumerative formula']"
3289,1611.06925,Antonio Graells,"Antonio Graells, Francisco Carrabina","Robust Design of H-infinity Controller for a Launch Vehicle Autopilot
  against Disturbances","6 pages, 6 figures","IOSR Journal of Electrical and Electronics Engineering
  (IOSR-JEEE), Volume 11, Issue 5, PP 135-140, 2016",10.9790/1676-110502135140,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Atmospheric flight phase of a launch vehicle is utilized to evaluate the
performance of an H-infinity controller in the presence of disturbances.
Dynamics of the vehicle is linearly modeled using time-varying parameters. An
operating point was found to design a robust command tracker using H-infinity
control theory that guarantees a stable maneuver. At the end, the controller
was employed on the launch vehicle to assess the capability of control design
on the linearized aerospace vehicle. Experimental results illustrate the
excellent performance of the H-infinity controller and accurate tracking
implemented by the autopilot. Also the robustness of the entire system against
disturbances is demonstrated to be acceptable.
","[{'version': 'v1', 'created': 'Mon, 21 Nov 2016 18:13:27 GMT'}]",2016-11-22,"[['Graells', 'Antonio', ''], ['Carrabina', 'Francisco', '']]","['H∞ control', 'Launch vehicle', 'robust controller']"
3290,2210.07311,Gai Liu,"Gai Liu, Umar Farooq, Chengyan Zhao, Xia Liu, Nian Sun",Linker Code Size Optimization for Native Mobile Applications,,"In Proceedings of the 32nd ACM SIGPLAN International Conference on
  Compiler Construction, 2023",10.1145/3578360.3580256,,cs.NI cs.PL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Modern mobile applications have grown rapidly in binary size, which restricts
user growth and hinders updates for existing users. Thus, reducing the binary
size is important for application developers. Recent studies have shown the
possibility of using link-time code size optimizations by re-invoking certain
compiler optimizations on the linked intermediate representation of the
program. However, such methods often incur significant build time overhead and
require intrusive changes to the existing build pipeline.
  In this paper, we propose several novel optimization techniques that do not
require significant customization to the build pipeline and reduce binary size
with low build time overhead. As opposed to re-invoking the compiler during
link time, we perform true linker optimization directly as optimization passes
within the linker. This enables more optimization opportunities such as
pre-compiled libraries that prior work often could not optimize. We evaluate
our techniques on several commercial iOS applications including NewsFeedApp,
ShortVideoApp, and CollaborationSuiteApp, each with hundreds of millions of
daily active users. Our techniques on average achieve 18.4% binary size
reduction across the three commercial applications without any user-perceivable
performance degradations.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2022 17:39:16 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Nov 2022 19:29:47 GMT'}, {'version': 'v3', 'created': 'Thu, 19 Jan 2023 01:23:24 GMT'}]",2023-01-20,"[['Liu', 'Gai', ''], ['Farooq', 'Umar', ''], ['Zhao', 'Chengyan', ''], ['Liu', 'Xia', ''], ['Sun', 'Nian', '']]","['Code Size Optimization', 'Static Analysis', 'iOS']"
3291,1804.07232,Mark Jones Dr,"Leo van Iersel, Mark Jones, Steven Kelk",A third strike against perfect phylogeny,"This article has been accepted for publication in Systematic Biology
  Published by Oxford University Press",,10.1093/sysbio/syz009,,cs.DM math.CO q-bio.PE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Perfect phylogenies are fundamental in the study of evolutionary trees
because they capture the situation when each evolutionary trait emerges only
once in history; if such events are believed to be rare, then by Occam's Razor
such parsimonious trees are preferable as a hypothesis of evolution. A
classical result states that 2-state characters permit a perfect phylogeny
precisely if each subset of 2 characters permits one. More recently, it was
shown that for 3-state characters the same property holds but for size-3
subsets. A long-standing open problem asked whether such a constant exists for
each number of states. More precisely, it has been conjectured that for any
fixed integer $r$, there exists a constant $f(r)$ such that a set of $r$-state
characters $C$ has a perfect phylogeny if and only if every subset of at most
$f(r)$ characters has a perfect phylogeny. In this paper, we show that this
conjecture is false. In particular, we show that for any constant $t$, there
exists a set $C$ of $8$-state characters such that $C$ has no perfect
phylogeny, but there exists a perfect phylogeny for every subset of $t$
characters. This negative result complements the two negative results
(""strikes"") of Bodlaender et al. We reflect on the consequences of this third
strike, pointing out that while it does close off some routes for efficient
algorithm development, many others remain open.
","[{'version': 'v1', 'created': 'Thu, 19 Apr 2018 15:31:27 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Jan 2019 11:10:40 GMT'}]",2019-04-30,"[['van Iersel', 'Leo', ''], ['Jones', 'Mark', ''], ['Kelk', 'Steven', '']]","['Perfect Phylogeny; Local Obstructions Conjecture', 'Four Gamete Condition', 'Phylogenetic Tree', 'Maximum Parsimony']"
3292,1412.3624,Mostafa Zaman Chowdhury,"Mostafa Zaman Chowdhury, Muhammad Shahin Uddin, and Yeong Min Jang","Dynamic Channel Allocation for Class-Based QoS Provisioning and Call
  Admission in Visible Light Communication",,"The Arabian Journal for Science and Engineering. vol. 39, no. 2,
  pp. 1007-1016, Feb. 2014",10.1007/s13369-013-0680-4,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Provisioning of quality of service (QoS) is a key issue in visible light
communication (VLC) system as well as in other wireless communication systems.
Due to the fact that QoS requirements are not as strict for all traffic types,
more calls of higher priority traffic classes can be accommodated by blocking
some more calls of lower priority traffic classes. Diverse types of high data
rate traffic are supported by existing wireless communication systems while the
resource is limited. Hence, priority based resource allocation can ensure the
service quality for the calls of important traffic class. The fixed guard
channels to prioritize any class of calls always reduce the channel
utilization. In this paper we propose a priority based dynamic channel
reservation scheme for higher priority calls that does not reduce the channel
utilization significantly. The number of reserved channels for each of the
individual traffic classes is calculated using real-time observation of the
call arrival rates of all the traffic classes. The features of the scheme allow
reduction of the call blocking probability of higher priority calls along with
the increase of the channel utilization. The proposed Markov Chain model is
expected to be very much effective for the queuing analysis especially for the
priority scheme of any number of traffic classes. The numerical results show
that the proposed scheme is able to attain reasonable call blocking probability
of higher priority calls without sacrificing channel utilization.
","[{'version': 'v1', 'created': 'Thu, 11 Dec 2014 12:15:12 GMT'}]",2014-12-12,"[['Chowdhury', 'Mostafa Zaman', ''], ['Uddin', 'Muhammad Shahin', ''], ['Jang', 'Yeong Min', '']]","['QoS', 'visible light communication', 'priority users', 'call blocking']"
3293,2210.05364,Yu Wei Tan,"Yu Wei Tan, Xiaohan Cui and Anand Bhojan","Hybrid MBlur: Using Ray Tracing to Solve the Partial Occlusion Artifacts
  in Real-Time Rendering of Motion Blur Effect",,ACM SIGGRAPH 2020 Posters,10.1145/3388770.3407436,,cs.GR,http://creativecommons.org/licenses/by/4.0/,"  For a foreground object in motion, details of its background which would
otherwise be hidden are uncovered through its inner blur. This paper presents a
novel hybrid motion blur rendering technique combining post-process image
filtering and hardware-accelerated ray tracing. In each frame, we advance rays
recursively into the scene to retrieve background information for inner blur
regions and apply a post-process filtering pass on the ray-traced background
and rasterized colour before compositing them together. Our approach achieves
more accurate partial occlusion semi-transparencies for moving objects while
maintaining interactive frame rates.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2022 11:47:59 GMT'}]",2022-10-12,"[['Tan', 'Yu Wei', ''], ['Cui', 'Xiaohan', ''], ['Bhojan', 'Anand', '']]","['real-time', 'motion blur', 'ray tracing', 'post-processing', 'hybrid rendering', 'games']"
3294,1809.08726,Kilol Gupta,Tuhin Chakrabarty and Kilol Gupta,Context-Aware Attention for Understanding Twitter Abuse,"The full published version of this work is available at:
  \url{https://www.aclweb.org/anthology/W19-3508/}. Please use the version
  published in the ACL anthology for citation purposes","Proc. 3rd Workshop on Abusive Language Online, pp. 70-79, 2019",10.18653/v1/W19-3508,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The original goal of any social media platform is to facilitate users to
indulge in healthy and meaningful conversations. But more often than not, it
has been found that it becomes an avenue for wanton attacks. We want to
alleviate this issue and hence we try to provide a detailed analysis of how
abusive behavior can be monitored in Twitter. The complexity of the natural
language constructs makes this task challenging. We show how applying
contextual attention to Long Short Term Memory networks help us give near state
of art results on multiple benchmarks abuse detection data sets from Twitter.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2018 02:18:01 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jan 2020 22:34:49 GMT'}]",2020-01-31,"[['Chakrabarty', 'Tuhin', ''], ['Gupta', 'Kilol', '']]","['Natural Language Processing', 'Attention Mechanism', 'Online AbuseDetection', 'deep learning']"
3295,2105.10528,Alexander Mattick,"Alexander Mattick, Martin Mayr, Mathias Seuret, Andreas Maier, Vincent
  Christlein","SmartPatch: Improving Handwritten Word Imitation with Patch
  Discriminators","to be published the in 16th International Conference on Document
  Analysis and Recognition 2021 ICDAR",,10.1007/978-3-030-86549-8_18,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As of recent generative adversarial networks have allowed for big leaps in
the realism of generated images in diverse domains, not the least of which
being handwritten text generation. The generation of realistic-looking
hand-written text is important because it can be used for data augmentation in
handwritten text recognition (HTR) systems or human-computer interaction. We
propose SmartPatch, a new technique increasing the performance of current
state-of-the-art methods by augmenting the training feedback with a tailored
solution to mitigate pen-level artifacts. We combine the well-known patch loss
with information gathered from the parallel trained handwritten text
recognition system and the separate characters of the word. This leads to a
more enhanced local discriminator and results in more realistic and
higher-quality generated handwritten words.
","[{'version': 'v1', 'created': 'Fri, 21 May 2021 18:34:21 GMT'}]",2021-09-16,"[['Mattick', 'Alexander', ''], ['Mayr', 'Martin', ''], ['Seuret', 'Mathias', ''], ['Maier', 'Andreas', ''], ['Christlein', 'Vincent', '']]","['Offline handwriting generation', 'generative adversarial networks', 'patch discriminator']"
3296,1505.01631,Ruven Pillay,"Citlalli Gamez Serna, Ruven Pillay, Alain Tremeau","Data Fusion of Objects Using Techniques Such as Laser Scanning,
  Structured Light and Photogrammetry for Cultural Heritage Applications",,"Computational Color Imaging, Lecture Notes in Computer Science,
  Springer, 2015, pp. 208-224",10.1007/978-3-319-15979-9_20,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a semi-automatic 2D-3D local registration pipeline
capable of coloring 3D models obtained from 3D scanners by using uncalibrated
images. The proposed pipeline exploits the Structure from Motion (SfM)
technique in order to reconstruct a sparse representation of the 3D object and
obtain the camera parameters from image feature matches. We then coarsely
register the reconstructed 3D model to the scanned one through the Scale
Iterative Closest Point (SICP) algorithm. SICP provides the global scale,
rotation and translation parameters, using minimal manual user intervention. In
the final processing stage, a local registration refinement algorithm optimizes
the color projection of the aligned photos on the 3D object removing the
blurring/ghosting artefacts introduced due to small inaccuracies during the
registration. The proposed pipeline is capable of handling real world cases
with a range of characteristics from objects with low level geometric features
to complex ones.
","[{'version': 'v1', 'created': 'Thu, 7 May 2015 09:03:20 GMT'}]",2015-05-08,"[['Serna', 'Citlalli Gamez', ''], ['Pillay', 'Ruven', ''], ['Tremeau', 'Alain', '']]","['Cultural heritage', '3D reconstruction', '2D-3D registration', 'local error']"
3297,1802.09598,Sam Staton,"Sam Staton, Dario Stein, Hongseok Yang, Nathanael L. Ackerman, Cameron
  E. Freer, Daniel M. Roy",The Beta-Bernoulli process and algebraic effects,To appear in Proc. ICALP 2018,"Proceedings of the 45th International Colloquium on Automata,
  Languages, and Programming (ICALP 2018), 141:1-141:15, 2018",10.4230/LIPIcs.ICALP.2018.141,,cs.PL,http://creativecommons.org/licenses/by/4.0/,"  In this paper we use the framework of algebraic effects from programming
language theory to analyze the Beta-Bernoulli process, a standard building
block in Bayesian models. Our analysis reveals the importance of abstract data
types, and two types of program equations, called commutativity and
discardability. We develop an equational theory of terms that use the
Beta-Bernoulli process, and show that the theory is complete with respect to
the measure-theoretic semantics, and also in the syntactic sense of Post. Our
analysis has a potential for being generalized to other stochastic processes
relevant to Bayesian modelling, yielding new understanding of these processes
from the perspective of programming.
","[{'version': 'v1', 'created': 'Mon, 26 Feb 2018 20:49:20 GMT'}, {'version': 'v2', 'created': 'Tue, 15 May 2018 08:53:38 GMT'}]",2018-09-11,"[['Staton', 'Sam', ''], ['Stein', 'Dario', ''], ['Yang', 'Hongseok', ''], ['Ackerman', 'Nathanael L.', ''], ['Freer', 'Cameron E.', ''], ['Roy', 'Daniel M.', '']]","['Beta-Bernoulli process', 'Algebraic effects', 'Probabilistic programming', 'Exchangeability']"
3298,1507.04319,Dustin Mixon,"Dustin G. Mixon, Jesse Peterson",Learning Boolean functions with concentrated spectra,,,10.1117/12.2189112,,cs.LG cs.IT math.FA math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses the theory and application of learning Boolean functions
that are concentrated in the Fourier domain. We first estimate the VC dimension
of this function class in order to establish a small sample complexity of
learning in this case. Next, we propose a computationally efficient method of
empirical risk minimization, and we apply this method to the MNIST database of
handwritten digits. These results demonstrate the effectiveness of our model
for modern classification tasks. We conclude with a list of open problems for
future investigation.
","[{'version': 'v1', 'created': 'Wed, 15 Jul 2015 18:38:00 GMT'}]",2016-01-20,"[['Mixon', 'Dustin G.', ''], ['Peterson', 'Jesse', '']]","['classification', 'Boolean functions', 'sparsity', 'MNIST']"
3299,1709.08071,Stefano Albrecht,"Stefano V. Albrecht, Peter Stone","Autonomous Agents Modelling Other Agents: A Comprehensive Survey and
  Open Problems","Final manuscript (46 pages), published in Artificial Intelligence
  Journal. The arXiv version also contains a table of contents after the
  abstract, but is otherwise identical to the AIJ version. Keywords: autonomous
  agents, multiagent systems, modelling other agents, opponent modelling",,10.1016/j.artint.2018.01.002,,cs.AI cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Much research in artificial intelligence is concerned with the development of
autonomous agents that can interact effectively with other agents. An important
aspect of such agents is the ability to reason about the behaviours of other
agents, by constructing models which make predictions about various properties
of interest (such as actions, goals, beliefs) of the modelled agents. A variety
of modelling approaches now exist which vary widely in their methodology and
underlying assumptions, catering to the needs of the different sub-communities
within which they were developed and reflecting the different practical uses
for which they are intended. The purpose of the present article is to provide a
comprehensive survey of the salient modelling methods which can be found in the
literature. The article concludes with a discussion of open problems which may
form the basis for fruitful future research.
","[{'version': 'v1', 'created': 'Sat, 23 Sep 2017 16:10:52 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Feb 2018 15:54:18 GMT'}]",2018-02-12,"[['Albrecht', 'Stefano V.', ''], ['Stone', 'Peter', '']]","['autonomous agents', 'multiagent systems', 'modelling other agents', 'opponent modelling']"
3300,1502.00054,Bengi Aygun,"Bengi Aygun, Mate Boban, and Alexander M. Wyglinski","ECPR: Environment- and Context-aware Combined Power and Rate Distributed
  Congestion Control for Vehicular Communications","37 Pages, 12 Figures, 5 Tables, Elsevier Computer Communications, May
  2016",,10.1016/j.comcom.2016.05.015,COMCOM5336,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Safety and efficiency applications in vehicular networks rely on the exchange
of periodic messages between vehicles. These messages contain position, speed,
heading, and other vital information that makes the vehicles aware of their
surroundings. The drawback of exchanging periodic cooperative messages is that
they generate significant channel load. Decentralized Congestion Control (DCC)
algorithms have been proposed to minimize the channel load. However, while the
rationale for periodic message exchange is to improve awareness, existing DCC
algorithms do not use awareness as a metric for deciding when, at what power,
and at what rate the periodic messages need to be sent in order to make sure
all vehicles are informed. We propose an environment- and context-aware DCC
algorithm combines power and rate control in order to improve cooperative
awareness by adapting to both specific propagation environments (e.g., urban
intersections, open highways, suburban roads) as well as application
requirements (e.g., different target cooperative awareness range). Studying
various operational conditions (e.g., speed, direction, and application
requirement), ECPR adjusts the transmit power of the messages in order to reach
the desired awareness ratio at the target distance while at the same time
controlling the channel load using an adaptive rate control algorithm. By
performing extensive simulations, including realistic propagation as well as
environment modeling and realistic vehicle operational environments (varying
demand on both awareness range and rate), we show that ECPR can increase
awareness by 20% while keeping the channel load and interference at almost the
same level. When permitted by the awareness requirements, ECPR can improve the
average message rate by 18% compared to algorithms that perform rate adaptation
only.
","[{'version': 'v1', 'created': 'Sat, 31 Jan 2015 01:34:02 GMT'}, {'version': 'v2', 'created': 'Sun, 5 Jun 2016 20:03:33 GMT'}]",2016-06-07,"[['Aygun', 'Bengi', ''], ['Boban', 'Mate', ''], ['Wyglinski', 'Alexander M.', '']]","['Congestion control', 'awareness control', 'vehicle-to-vehiclecommunication', 'VANET']"
3301,1705.00307,Jaeyong Rho,"Jaeyong Rho, Takuya Azumi, Mayo Nakagawa, Kenya Sato, Nobuhiko Nishio","Scheduling Parallel and Distributed Processing for Automotive Data
  Stream Management System","Accepted for publication at Journal of Parallel and Distributed
  Computing (Elsevier) 2017",J. Parallel Distrib. Comput. 109: 286-300 (2017),10.1016/j.jpdc.2017.06.012,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, to analyze end-to-end timing behavior in heterogeneous
processor and network environments accurately, we adopt a heterogeneous
selection value on communication contention (HSV_CC) algorithm, which can
synchronize tasks and messages simultaneously, for stream processing
distribution. In order to adapt HSV_CC to automotive data stream management
system (DSMSs), one must address three issues: (i) previous task and message
schedules might lead to less efficient resource usages; (ii) the conventional
method to determine the task scheduling order may not be best suited to deal
with stream processing graphs, and; (iii) there is a need to be able to
schedule tasks with time-varying computational requirements efficiently. To
address (i), we propose the heterogeneous value with load balancing and
communication contention (HVLB_CC) (A) algorithm, which considers load
balancing in addition to the parameters considered by the HSV_CC algorithm. We
propose HVLB_CC (B) to address issue (ii). HVLB_CC (B) can deal with stream
processing task graphs and more various directed acyclic graphs to prevent
assigning a higher priority to successor tasks. In addition, to address issue
(iii), we propose HVLB_CC_IC. To schedule tasks more efficiently with various
computation times, HVLB_CC_IC utilizes schedule holes left in processors. These
idle time slots can be used for the execution of an optional part to generate
more precise data results by applying imprecise computation models.
Experimental results demonstrate that the proposed algorithms improve minimum
schedule length, accuracy, and load balancing significantly compared to the
HSV_CC algorithm. In addition, the proposed HVLB_CC (B) algorithm can schedule
more varied task graphs without reducing performance, and, using imprecise
computation models, HVLB_CC_IC yields higher precision data than HVLB_CC
without imprecise computation models.
","[{'version': 'v1', 'created': 'Sun, 30 Apr 2017 12:39:38 GMT'}, {'version': 'v2', 'created': 'Sun, 18 Jun 2017 06:09:29 GMT'}]",2017-09-12,"[['Rho', 'Jaeyong', ''], ['Azumi', 'Takuya', ''], ['Nakagawa', 'Mayo', ''], ['Sato', 'Kenya', ''], ['Nishio', 'Nobuhiko', '']]","['automotive data stream management system', 'heterogeneous processor and network', 'load balancing', 'list scheduling', 'imprecise computation']"
3302,1307.4716,Mehdi Bahrami,Mehdi Bahrami,"Cloud Template, a Big Data Solution",JSCSE Journal Publication,"International Journal of Soft Computing and Software Engineering
  [JSCSE], Vol. 3, No. 2, pp. 13-16, 2013",10.7321/jscse.v3.n2.2,,cs.DC cs.NI cs.SE cs.SI,http://creativecommons.org/licenses/by/3.0/,"  Today cloud computing has become as a new concept for hosting and delivering
different services over the Internet for big data solutions. Cloud computing is
attractive to different business owners of both small and enterprise as it
eliminates the requirement for users to plan ahead for provisioning, and allows
enterprises to start from the small and increase resources only when there is a
rise in service demand. Despite the fact that cloud computing offers huge
opportunities to the IT industry, the development of cloud computing technology
is currently has several issues. This study presents an idea for introducing
cloud templates which will be used for analyzing, designing, developing and
implementing cloud computing systems. We will present a template based design
for cloud computing systems, highlighting its key concepts, architectural
principles and state of the art implementation, as well as research challenges
and future work requirements. The aim of this idea is to provide a better
understanding of the design challenges of cloud computing and identify
important research directions in this big data increasingly important area. We
will describe a series of studies by which we and other researchers have
assessed the effectiveness of these techniques in practical situations.
Finally, in this study we will show how this idea could be implemented in a
practical and useful way in industry.
","[{'version': 'v1', 'created': 'Wed, 17 Jul 2013 18:17:25 GMT'}, {'version': 'v2', 'created': 'Mon, 5 Aug 2013 00:15:39 GMT'}]",2013-08-06,"[['Bahrami', 'Mehdi', '']]","['Software Architecture', 'Cloud Computing', 'Software Template', 'Big Data']"
3303,1609.08004,Jose Rodrigues Jr,"Bruno Machado, Jonatan Orue, Mauro Arruda, Cleidimar Santos, Diogo
  Sarath, Wesley Goncalves, Gercina Silva, Hemerson Pistori, Antonia Roel, Jose
  Rodrigues-Jr","BioLeaf: a professional mobile application to measure foliar damage
  caused by insect herbivory",,Computers and Electronics in Agriculture 129: 1. 44-55 (2016),10.1016/j.compag.2016.09.007,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Soybean is one of the ten greatest crops in the world, answering for
billion-dollar businesses every year. This crop suffers from insect herbivory
that costs millions from producers. Hence, constant monitoring of the crop
foliar damage is necessary to guide the application of insecticides. However,
current methods to measure foliar damage are expensive and dependent on
laboratory facilities, in some cases, depending on complex devices. To cope
with these shortcomings, we introduce an image processing methodology to
measure the foliar damage in soybean leaves. We developed a non-destructive
imaging method based on two techniques, Otsu segmentation and Bezier curves, to
estimate the foliar loss in leaves with or without border damage. We
instantiate our methodology in a mobile application named BioLeaf, which is
freely distributed for smartphone users. We experimented with real-world leaves
collected from a soybean crop in Brazil. Our results demonstrated that BioLeaf
achieves foliar damage quantification with precision comparable to that of
human specialists. With these results, our proposal might assist soybean
producers, reducing the time to measure foliar damage, reducing analytical
costs, and defining a commodity application that is applicable not only to soy,
but also to different crops such as cotton, bean, potato, coffee, and
vegetables.
","[{'version': 'v1', 'created': 'Mon, 26 Sep 2016 14:59:50 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Sep 2016 01:02:57 GMT'}]",2016-09-28,"[['Machado', 'Bruno', ''], ['Orue', 'Jonatan', ''], ['Arruda', 'Mauro', ''], ['Santos', 'Cleidimar', ''], ['Sarath', 'Diogo', ''], ['Goncalves', 'Wesley', ''], ['Silva', 'Gercina', ''], ['Pistori', 'Hemerson', ''], ['Roel', 'Antonia', ''], ['Rodrigues-Jr', 'Jose', '']]","['foliar herbivory', 'leaf area measurement', 'plant-herbivore interactions', 'plant defoliation analysis', 'feeding injury']"
3304,1803.04225,Philipp Mayr,"Fariba Karimi, Philipp Mayr, Fakhri Momeni","Analyzing the network structure and gender differences among the members
  of the Networked Knowledge Organization Systems (NKOS) community","14 pages, 6 figures, accepted paper in International Journal on
  Digital Libraries (IJDL)",,10.1007/s00799-018-0243-0,,cs.SI cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we analyze a major part of the research output of the
Networked Knowledge Organization Systems (NKOS) community in the period 2000 to
2016 from a network analytical perspective. We focus on the papers presented at
the European and U.S. NKOS workshops and in addition four special issues on
NKOS in the last 16 years. For this purpose, we have generated an open dataset,
the ""NKOS bibliography"" which covers the bibliographic information of the
research output. We analyze the co-authorship network of this community which
results in 123 papers with a sum of 256 distinct authors. We use standard
network analytic measures such as degree, betweenness and closeness centrality
to describe the co-authorship network of the NKOS dataset. First, we
investigate global properties of the network over time. Second, we analyze the
centrality of the authors in the NKOS network. Lastly, we investigate gender
differences in collaboration behavior in this community. Our results show that
apart from differences in centrality measures of the scholars, they have higher
tendency to collaborate with those in the same institution or the same
geographic proximity. We also find that homophily is higher among women in this
community. Apart from small differences in closeness and clustering among men
and women, we do not find any significant dissimilarities with respect to other
centralities.
","[{'version': 'v1', 'created': 'Mon, 12 Mar 2018 12:44:29 GMT'}]",2018-12-24,"[['Karimi', 'Fariba', ''], ['Mayr', 'Philipp', ''], ['Momeni', 'Fakhri', '']]","['NKOS workshops', 'Network analysis', 'Co-authorship networks', 'gender', 'homophily']"
3305,1406.2400,Normunds Gr\=uz\=itis,Dana Dann\'ells and Normunds Gr\=uz\=itis,"Controlled Natural Language Generation from a Multilingual
  FrameNet-based Grammar",,"Controlled Natural Language, Lecture Notes in Computer Science,
  Vol. 8625, Springer, 2014, pp. 155-166",10.1007/978-3-319-10223-8_15,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a currently bilingual but potentially multilingual
FrameNet-based grammar library implemented in Grammatical Framework. The
contribution of this paper is two-fold. First, it offers a methodological
approach to automatically generate the grammar based on semantico-syntactic
valence patterns extracted from FrameNet-annotated corpora. Second, it provides
a proof of concept for two use cases illustrating how the acquired multilingual
grammar can be exploited in different CNL applications in the domains of arts
and tourism.
","[{'version': 'v1', 'created': 'Tue, 10 Jun 2014 01:01:48 GMT'}]",2016-07-07,"[['Dannélls', 'Dana', ''], ['Grūzītis', 'Normunds', '']]","['Controlled Natural Language', 'FrameNet', 'Natural LanguageGeneration', 'Multilinguality', 'Grammatical Framework']"
3306,1904.02479,Evgeniy Yudin,V. N. Zadorozhnyi and E.B. Yudin,"The investigation of social networks based on multi-component random
  graphs",,J. Phys.: Conf. Ser. 944 012124 (2018),10.1088/1742-6596/944/1/012124,,cs.SI physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  The methods of non-homogeneous random graphs calibration are developed for
social networks simulation. The graphs are calibrated by the degree
distributions of the vertices and the edges. The mathematical foundation of the
methods is formed by the theory of random graphs with the nonlinear
preferential attachment rule and the theory of Erdos-Renyi random graphs. In
fact, well-calibrated network graph models and computer experiments with these
models would help developers (owners) of the networks to predict their
development correctly and to choose effective strategies for controlling
network projects.
","[{'version': 'v1', 'created': 'Thu, 4 Apr 2019 11:02:21 GMT'}]",2019-04-05,"[['Zadorozhnyi', 'V. N.', ''], ['Yudin', 'E. B.', '']]","['random graphs', 'degree distributions of vertices and edges (arcs)', 'nonlinear preferential attachment rule']"
3307,1409.8020,Deepu John,"C.J. Deepu, X.Y. Xu, X.D. Zou, L.B. Yao, and Y. Lian",An ECG-on-Chip for Wearable Cardiac Monitoring Devices,,"5th IEEE International Symposium on Electronic Design Test and
  Applications 2010",10.1109/DELTA.2010.43,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a highly integrated, low power chip solution for ECG
signal processing in wearable devices. The chip contains an instrumentation
amplifier with programmable gain, a band-pass filter, a 12-bit SAR ADC, a novel
QRS detector, 8K on-chip SRAM, and relevant control circuitry and CPU
interfaces. The analog front end circuits accurately senses and digitizes the
raw ECG signal, which is then filtered to extract the QRS. The sampling
frequency used is 256 Hz. ECG samples are buffered locally on an asynchronous
FIFO and is read out using a faster clock, as and when it is required by the
host CPU via an SPI interface. The chip was designed and implemented in 0.35um
standard CMOS process. The analog core operates at 1V while the digital
circuits and SRAM operate at 3.3V. The chip total core area is 5.74 mm^2 and
consumes 9.6uW. Small size and low power consumption make this design suitable
for usage in wearable heart monitoring devices.
","[{'version': 'v1', 'created': 'Mon, 29 Sep 2014 08:14:15 GMT'}]",2014-09-30,"[['Deepu', 'C. J.', ''], ['Xu', 'X. Y.', ''], ['Zou', 'X. D.', ''], ['Yao', 'L. B.', ''], ['Lian', 'Y.', '']]","['Electrocardiography', 'QRS detection', 'ECG-on-Chip', 'Low Power design', 'Wearable devices']"
3308,1903.12520,Anurag Illendula,"Anurag Illendula, Amit Sheth",Multimodal Emotion Classification,"Accepted at the 2nd Emoji Workshop co-located with The Web Conference
  2019",Companion Proceedings of the 2019 World Wide Web Conference,10.1145/3308560.3316549,,cs.CV cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Most NLP and Computer Vision tasks are limited to scarcity of labelled data.
In social media emotion classification and other related tasks, hashtags have
been used as indicators to label data. With the rapid increase in emoji usage
of social media, emojis are used as an additional feature for major social NLP
tasks. However, this is less explored in case of multimedia posts on social
media where posts are composed of both image and text. At the same time, w.e
have seen a surge in the interest to incorporate domain knowledge to improve
machine understanding of text. In this paper, we investigate whether domain
knowledge for emoji can improve the accuracy of emotion classification task. We
exploit the importance of different modalities from social media post for
emotion classification task using state-of-the-art deep learning architectures.
Our experiments demonstrate that the three modalities (text, emoji and images)
encode different information to express emotion and therefore can complement
each other. Our results also demonstrate that emoji sense depends on the
textual context, and emoji combined with text encodes better information than
considered separately. The highest accuracy of 71.98\% is achieved with a
training data of 550k posts.
","[{'version': 'v1', 'created': 'Wed, 13 Mar 2019 07:54:29 GMT'}]",2019-04-01,"[['Illendula', 'Anurag', ''], ['Sheth', 'Amit', '']]","['Emoji Understanding', 'Emotion Classification', 'Multimodal Analysis']"
3309,0909.0764,Serguei Mokhov,"Aihua Wu, Joey Paquet, and Serguei A. Mokhov","Object-Oriented Intensional Programming: Intensional Classes Using Java
  and Lucid","27 pages, 8 listings, 2 tables, 5 figures",,10.1109/SERA.2010.29,,cs.PL cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article introduces Object-Oriented Intensional Programming (OO-IP), a
new hybrid language between Object-Oriented and Intensional Programming
Languages in the sense of the latest evolutions of Lucid. This new hybrid
language combines the essential characteristics of Lucid and Java, and
introduces the notion of object streams which makes it is possible that each
element in a Lucid stream to be an object with embedded intensional properties.
Interestingly, this hybrid language also brings to Java objects the power to
explicitly express and manipulate the notion of context, creating the novel
concept of intensional object, i.e. objects whose evaluation is
context-dependent, which are here demonstrated to be translatable into standard
objects. By this new approach, we extend the use and meaning of the notion of
intensional objects and enrich the meaning of object streams in Lucid and
semantics of intensional objects in Java.
","[{'version': 'v1', 'created': 'Thu, 3 Sep 2009 21:13:44 GMT'}]",2010-07-09,"[['Wu', 'Aihua', ''], ['Paquet', 'Joey', ''], ['Mokhov', 'Serguei A.', '']]","['intensional programming', 'Java', 'object-oriented programming', 'hybrid programming languages', 'General Intensional Programming System (GISPY)']"
3310,1404.1462,Pallavi Sudhakar,"Pallavi.V.S, Dr. Rukmani Devi.D","Design of a High Speed FPGA-Based Classifier for Efficient Packet
  Classification","6 pages, 6 figures, ""Published with International Journal of Computer
  Trends and Technology (IJCTT)"", ""National Conference on Modern Electronics
  and Signal Processing (2014)- Velammal Engineering College"", ""Recent Trends
  in Information Technology (2014)- R.M.K College of Engineering and
  Technology""","Pallavi.V.S, Dr.Rukmani Devi.D Article: Design of a High Speed
  FPGA-Based Classifier for Efficient Packet Classification. International
  Journal of Computer Trends and Technology(IJCTT) 9(3):123-128,Mar 2014",10.14445/22312803/IJCTT-V9P126,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Packet classification is a vital and complicated task as the processing of
packets should be done at a specified line speed. In order to classify a packet
as belonging to a particular flow or set of flows, network nodes must perform a
search over a set of filters using multiple fields of the packet as the search
key. Hence the matching of packets should be much faster and simpler for quick
processing and classification. A hardware accelerator or a classifier has been
proposed here using a modified version of the HyperCuts packet classification
algorithm. A new pre-cutting process has been implemented to reduce the memory
size to fit in an FPGA. This classifier can classify packets with high speed
and with a power consumption factor of less than 3W. This methodology removes
the need for floating point division to be performed by replacing the region
compaction scheme of HyperCuts by pre-cutting, while classifying the packets
and concentrates on classifying the packets at the core of the network.
","[{'version': 'v1', 'created': 'Sat, 5 Apr 2014 11:06:40 GMT'}]",2014-04-08,"[['S', 'Pallavi. V.', ''], ['D', 'Dr. Rukmani Devi.', '']]","['Classifier', 'high throughput', 'low power', 'packet classification', 'pipelining', 'region compaction', 'pre-cutting']"
3311,1603.06496,Sheng Zou,Sheng Zou and Alina Zare,"Instance Influence Estimation for Hyperspectral Target Signature
  Characterization using Extended Functions of Multiple Instances","Published, Proceedings of the SPIE, 2016",,10.1117/12.2228154,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Extended Functions of Multiple Instances (eFUMI) algorithm is a
generalization of Multiple Instance Learning (MIL). In eFUMI, only bag level
(i.e. set level) labels are needed to estimate target signatures from mixed
data. The training bags in eFUMI are labeled positive if any data point in a
bag contains or represents any proportion of the target signature and are
labeled as a negative bag if all data points in the bag do not represent any
target. From these imprecise labels, eFUMI has been shown to be effective at
estimating target signatures in hyperspectral subpixel target detection
problems. One motivating scenario for the use of eFUMI is where an analyst
circles objects/regions of interest in a hyperspectral scene such that the
target signatures of these objects can be estimated and be used to determine
whether other instances of the object appear elsewhere in the image collection.
The regions highlighted by the analyst serve as the imprecise labels for eFUMI.
Often, an analyst may want to iteratively refine their imprecise labels. In
this paper, we present an approach for estimating the influence on the
estimated target signature if the label for a particular input data point is
modified. This ""instance influence estimation"" guides an analyst to focus on
(re-)labeling the data points that provide the largest change in the resulting
estimated target signature and, thus, reduce the amount of time an analyst
needs to spend refining the labels for a hyperspectral scene. Results are shown
on real hyperspectral sub-pixel target detection data sets.
","[{'version': 'v1', 'created': 'Mon, 21 Mar 2016 16:54:41 GMT'}]",2016-09-21,"[['Zou', 'Sheng', ''], ['Zare', 'Alina', '']]","['eFUMI', 'interactive labeling', 'influence', 'target proportion', 'residual error']"
3312,2201.09595,Maria Tsfasman,"Maria Tsfasman, Avinash Saravanan, Dekel Viner, Daan Goslinga, Sarah
  de Wolf, Chirag Raman, Catholijn M. Jonker, Catharine Oertel","Towards a Real-time Measure of the Perception of Anthropomorphism in
  Human-robot Interaction",,"MuCAI'21: Proceedings of the 2nd ACM Multimedia Workshop on
  Multimodal Conversational AI, 2021",10.1145/3475959.3485394,,cs.HC cs.AI cs.RO eess.AS eess.SP,http://creativecommons.org/licenses/by/4.0/,"  How human-like do conversational robots need to look to enable long-term
human-robot conversation? One essential aspect of long-term interaction is a
human's ability to adapt to the varying degrees of a conversational partner's
engagement and emotions. Prosodically, this can be achieved through
(dis)entrainment. While speech-synthesis has been a limiting factor for many
years, restrictions in this regard are increasingly mitigated. These
advancements now emphasise the importance of studying the effect of robot
embodiment on human entrainment. In this study, we conducted a between-subjects
online human-robot interaction experiment in an educational use-case scenario
where a tutor was either embodied through a human or a robot face. 43
English-speaking participants took part in the study for whom we analysed the
degree of acoustic-prosodic entrainment to the human or robot face,
respectively. We found that the degree of subjective and objective perception
of anthropomorphism positively correlates with acoustic-prosodic entrainment.
","[{'version': 'v1', 'created': 'Mon, 24 Jan 2022 11:10:37 GMT'}]",2022-01-25,"[['Tsfasman', 'Maria', ''], ['Saravanan', 'Avinash', ''], ['Viner', 'Dekel', ''], ['Goslinga', 'Daan', ''], ['de Wolf', 'Sarah', ''], ['Raman', 'Chirag', ''], ['Jonker', 'Catholijn M.', ''], ['Oertel', 'Catharine', '']]","['multi-modal', 'human-robot interaction', 'prosody', 'acoustic-prosodicentrainment']"
3313,2202.09921,Fran\c{c}ois Ollivier,Fran\c{c}ois Ollivier,"Extending Flat Motion Planning to Non-flat Systems. Experiments on
  Aircraft Models Using Maple","28 pages, 11 figures","ISSAC '22: Proceedings of the 2022 International Symposium on
  Symbolic and Algebraic Computation, ACM Press, July 2022, Pages 499--507",10.1145/3476446.3536179,,cs.SC cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aircraft models may be considered as flat if one neglects some terms
associated to aerodynamics. Computational experiments in Maple show that in
some cases a suitably designed feed-back allows to follow such trajectories,
when applied to the non-flat model. However some maneuvers may be hard or even
impossible to achieve with this flat approximation. In this paper, we propose
an iterated process to compute a more achievable trajectory, starting from the
flat reference trajectory. More precisely, the unknown neglected terms in the
flat model are iteratively re-evaluated using the values obtained at the
previous step. This process may be interpreted as a new trajectory
parametrization, using an infinite number of derivatives, a property that may
be called \emph{generalized flatness}. We illustrate the pertinence of this
approach in flight conditions of increasing difficulties, from single engine
flight, to aileron roll.
","[{'version': 'v1', 'created': 'Sun, 20 Feb 2022 22:33:03 GMT'}, {'version': 'v2', 'created': 'Sat, 30 Apr 2022 17:11:05 GMT'}, {'version': 'v3', 'created': 'Thu, 12 May 2022 16:46:30 GMT'}]",2022-07-14,"[['Ollivier', 'François', '']]","['flat systems', 'motion planning', 'aircraft control', 'Newton operator', 'symbolic-numeric computation', 'generalized flatness']"
3314,1812.01550,Amritanshu Agrawal,"Amritanshu Agrawal, Tim Menzies, Leandro L. Minku, Markus Wagner, Zhe
  Yu","Better Software Analytics via ""DUO"": Data Mining Algorithms
  Using/Used-by Optimizers","35 Pages, Accepted to EMSE Journal",,10.1007/s10664-020-09808-9,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper claims that a new field of empirical software engineering research
and practice is emerging: data mining using/used-by optimizers for empirical
studies or DUO. For example, data miners can generate models that are explored
by optimizers. Also, optimizers can advise how to best adjust the control
parameters of a data miner. This combined approach acts like an agent leaning
over the shoulder of an analyst that advises ""ask this question next"" or
""ignore that problem, it is not relevant to your goals"". Further, those agents
can help us build ""better"" predictive models, where ""better"" can be either
greater predictive accuracy or faster modeling time (which, in turn, enables
the exploration of a wider range of options). We also caution that the era of
papers that just use data miners is coming to an end. Results obtained from an
unoptimized data miner can be quickly refuted, just by applying an optimizer to
produce a different (and better performing) model. Our conclusion, hence, is
that for software analytics it is possible, useful and necessary to combine
data mining and optimization using DUO.
","[{'version': 'v1', 'created': 'Tue, 4 Dec 2018 17:42:04 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Dec 2019 14:10:54 GMT'}]",2020-08-31,"[['Agrawal', 'Amritanshu', ''], ['Menzies', 'Tim', ''], ['Minku', 'Leandro L.', ''], ['Wagner', 'Markus', ''], ['Yu', 'Zhe', '']]","['Software analytics', 'data mining', 'optimization', 'evolutionary algorithms']"
3315,1603.09227,Christoph Meier,"Christoph Meier, Alexander Popp and Wolfgang A. Wall","A Finite Element Approach for the Line-to-Line Contact Interaction of
  Thin Beams with Arbitrary Orientation","37 pages, submitted to Computer Methods in Applied Mechanics and
  Engineering",,10.1016/j.cma.2016.05.012,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The objective of this work is the development of a novel finite element
formulation describing the contact interaction of slender beams in complex 3D
configurations involving arbitrary beam-to-beam orientations. It is shown in a
mathematically concise manner that standard beam contact models based on a
point-wise contact force fail to describe a considerable range of
configurations, which are, however, likely to occur in practical applications.
On the contrary, the formulation proposed here models beam-to-beam contact by
means of distributed line forces, a procedure that is shown to be applicable
for arbitrary geometrical configurations. The proposed formulation is based on
a Gauss-point-to-segment type contact discretization and a penalty
regularization of the contact constraint. By means of detailed theoretical and
numerical investigations, it is shown that this approach is more suitable for
beam contact than possible alternatives based on mortar type contact
discretizations or constraint enforcement by means of Lagrange multipliers. The
proposed formulation is enhanced by a consistently linearized integration
interval segmentation avoiding numerical integration across strong
discontinuities. In combination with a smoothed contact force law and the
employed C1-continuous beam elements, this procedure drastically reduces the
numerical integration error, an essential prerequisite for optimal spatial
convergence rates. The resulting line-to-line contact algorithm is supplemented
by contact contributions of the beam endpoints, which represent boundary minima
of the underlying minimal distance problem. Finally, a series of numerical test
cases is analyzed in order to investigate the accuracy and consistency of the
proposed formulation regarding integration error, spatial convergence behavior
and resulting contact force distributions.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2016 14:53:02 GMT'}]",2018-05-28,"[['Meier', 'Christoph', ''], ['Popp', 'Alexander', ''], ['Wall', 'Wolfgang A.', '']]","['Beam contact', 'Line-to-line contact', 'Thin fibers', 'Finite elements', 'C1-continuous Kirchhoff beams']"
3316,1911.12028,Konstantin Bulatov,Olga Petrova and Konstantin Bulatov and Vladimir L. Arlazarov,"Methods of Weighted Combination for Text Field Recognition in a Video
  Stream","6 pages, 4 figures, 1 table, accepted and presented at International
  Conference on Machine Vision 2019 (ICMV 2019)","Proc. SPIE 11433 ICMV-2019 (2020), 114332L",10.1117/12.2559378,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to a noticeable expansion of document recognition applicability, there is
a high demand for recognition on mobile devices. A mobile camera, unlike a
scanner, cannot always ensure the absence of various image distortions,
therefore the task of improving the recognition precision is relevant. The
advantage of mobile devices over scanners is the ability to use video stream
input, which allows to get multiple images of a recognized document. Despite
this, not enough attention is currently paid to the issue of combining
recognition results obtained from different frames when using video stream
input. In this paper we propose a weighted text string recognition results
combination method and weighting criteria, and provide experimental data for
verifying their validity and effectiveness. Based on the obtained results, it
is concluded that the use of such weighted combination is appropriate for
improving the quality of the video stream recognition result.
","[{'version': 'v1', 'created': 'Wed, 27 Nov 2019 08:48:54 GMT'}]",2020-02-12,"[['Petrova', 'Olga', ''], ['Bulatov', 'Konstantin', ''], ['Arlazarov', 'Vladimir L.', '']]","['mobile recognition', 'video stream', 'optical character recognition', 'anytime algorithms']"
3317,1609.00045,Cong Zhang,"Cong Zhang, Jiangchuan Liu and Haiyang Wang","Towards Hybrid Cloud-assisted Crowdsourced Live Streaming: Measurement
  and Analysis",,,10.1145/2910642.2910644,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crowdsourced Live Streaming (CLS), most notably Twitch.tv, has seen explosive
growth in its popularity in the past few years. In such systems, any user can
lively broadcast video content of interest to others, e.g., from a game player
to many online viewers. To fulfill the demands from both massive and
heterogeneous broadcasters and viewers, expensive server clusters have been
deployed to provide video ingesting and transcoding services. Despite the
existence of highly popular channels, a significant portion of the channels is
indeed unpopular. Yet as our measurement shows, these broadcasters are
consuming considerable system resources; in particular, 25% (resp. 30%) of
bandwidth (resp. computation) resources are used by the broadcasters who do not
have any viewers at all. In this paper, we closely examine the challenge of
handling unpopular live-broadcasting channels in CLS systems and present a
comprehensive solution for service partitioning on hybrid cloud. The
trace-driven evaluation shows that our hybrid cloud-assisted design can smartly
assign ingesting and transcoding tasks to the elastic cloud virtual machines,
providing flexible system deployment cost-effectively.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2016 21:14:57 GMT'}]",2016-09-02,"[['Zhang', 'Cong', ''], ['Liu', 'Jiangchuan', ''], ['Wang', 'Haiyang', '']]","['Crowdsourced Live Streaming', 'Hybrid Cloud', 'WorkloadMigration', 'Twitch']"
3318,1905.10565,Pepa Atanasova,"Pepa Atanasova, Georgi Karadzhov, Yasen Kiprov, Preslav Nakov,
  Fabrizio Sebastiani","Evaluating Variable-Length Multiple-Option Lists in Chatbots and Mobile
  Search","4 pages, in Proceeding of SIGIR 2019","Final version published in Proceedings of the 42nd ACM Conference
  on Research and Development in Information Retrieval (SIGIR 2016), Paris, FR,
  2019, pp. 997-1000",10.1145/3331184.3331308,,cs.IR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, the proliferation of smart mobile devices has lead to the
gradual integration of search functionality within mobile platforms. This has
created an incentive to move away from the ""ten blue links'' metaphor, as
mobile users are less likely to click on them, expecting to get the answer
directly from the snippets. In turn, this has revived the interest in Question
Answering. Then, along came chatbots, conversational systems, and messaging
platforms, where the user needs could be better served with the system asking
follow-up questions in order to better understand the user's intent. While
typically a user would expect a single response at any utterance, a system
could also return multiple options for the user to select from, based on
different system understandings of the user's intent. However, this possibility
should not be overused, as this practice could confuse and/or annoy the user.
How to produce good variable-length lists, given the conflicting objectives of
staying short while maximizing the likelihood of having a correct answer
included in the list, is an underexplored problem. It is also unclear how to
evaluate a system that tries to do that. Here we aim to bridge this gap. In
particular, we define some necessary and some optional properties that an
evaluation measure fit for this purpose should have. We further show that
existing evaluation measures from the IR tradition are not entirely suitable
for this setup, and we propose novel evaluation measures that address it
satisfactorily.
","[{'version': 'v1', 'created': 'Sat, 25 May 2019 10:22:15 GMT'}]",2021-09-22,"[['Atanasova', 'Pepa', ''], ['Karadzhov', 'Georgi', ''], ['Kiprov', 'Yasen', ''], ['Nakov', 'Preslav', ''], ['Sebastiani', 'Fabrizio', '']]","['Chatbots', 'Mobile Search', 'Evaluation Measures']"
3319,1307.7259,Valmir Barbosa,"Leonardo I. L. Oliveira, Valmir C. Barbosa, F\'abio Protti",The predecessor-existence problem for k-reversible processes,,"Theoretical Computer Science 562 (2015), 406-418",10.1016/j.tcs.2014.10.018,,cs.DS nlin.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For k>=1, we consider the graph dynamical system known as a k-reversible
process. In such process, each vertex in the graph has one of two possible
states at each discrete time. Each vertex changes its state between the present
time and the next if and only if it currently has at least k neighbors in a
state different than its own. Given a k-reversible process and a configuration
of states assigned to the vertices, the Predecessor Existence problem consists
of determining whether this configuration can be generated by the process from
another configuration within exactly one time step. We can also extend the
problem by asking for the number of configurations from which a given
configuration is reachable within one time step. Predecessor Existence can be
solved in polynomial time for k=1, but for k>1 we show that it is NP-complete.
When the graph in question is a tree we show how to solve it in O(n) time and
how to count the number of predecessor configurations in O(n^2) time. We also
solve Predecessor Existence efficiently for the specific case of 2-reversible
processes when the maximum degree of a vertex in the graph is no greater than
3. For this case we present an algorithm that runs in O(n) time.
","[{'version': 'v1', 'created': 'Sat, 27 Jul 2013 13:31:08 GMT'}]",2014-12-01,"[['Oliveira', 'Leonardo I. L.', ''], ['Barbosa', 'Valmir C.', ''], ['Protti', 'Fábio', '']]","['k-reversible processes', 'Garden-of-Eden configurations', 'Predecessor-existence problem', 'Graph dynamical systems']"
3320,1809.10537,Pablo Gil Pereira,Pablo Gil Pereira and Andreas Schmidt and Thorsten Herfet,Cross-Layer Effects on Training Neural Algorithms for Video Streaming,,,10.1145/3210445.3210453,,cs.NI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays Dynamic Adaptive Streaming over HTTP (DASH) is the most prevalent
solution on the Internet for multimedia streaming and responsible for the
majority of global traffic. DASH uses adaptive bit rate (ABR) algorithms, which
select the video quality considering performance metrics such as throughput and
playout buffer level. Pensieve is a system that allows to train ABR algorithms
using reinforcement learning within a simulated network environment and is
outperforming existing approaches in terms of achieved performance. In this
paper, we demonstrate that the performance of the trained ABR algorithms
depends on the implementation of the simulated environment used to train the
neural network. We also show that the used congestion control algorithm impacts
the algorithms' performance due to cross-layer effects.
","[{'version': 'v1', 'created': 'Thu, 27 Sep 2018 14:25:10 GMT'}]",2018-09-28,"[['Pereira', 'Pablo Gil', ''], ['Schmidt', 'Andreas', ''], ['Herfet', 'Thorsten', '']]","['dynamic adaptive streaming', 'cross-layer efects', 'congestion control']"
3321,1802.10164,Mohammad Etemad,"Mohammad Etemad, Amilcar Soares Junior and Stan Matwin","Predicting Transportation Modes of GPS Trajectories using Feature
  Engineering and Noise Removal",6 pages,,10.1007/978-3-319-89656-4_24,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding transportation mode from GPS (Global Positioning System) traces
is an essential topic in the data mobility domain. In this paper, a framework
is proposed to predict transportation modes. This framework follows a sequence
of five steps: (i) data preparation, where GPS points are grouped in trajectory
samples; (ii) point features generation; (iii) trajectory features extraction;
(iv) noise removal; (v) normalization. We show that the extraction of the new
point features: bearing rate, the rate of rate of change of the bearing rate
and the global and local trajectory features, like medians and percentiles
enables many classifiers to achieve high accuracy (96.5%) and f1 (96.3%)
scores. We also show that the noise removal task affects the performance of all
the models tested. Finally, the empirical tests where we compare this work
against state-of-art transportation mode prediction strategies show that our
framework is competitive and outperforms most of them.
","[{'version': 'v1', 'created': 'Tue, 27 Feb 2018 21:07:21 GMT'}]",2019-02-22,"[['Etemad', 'Mohammad', ''], ['Junior', 'Amilcar Soares', ''], ['Matwin', 'Stan', '']]","['Feature engineering', 'Noise removal', 'Trajectory classification']"
3322,1701.01636,Pece Mitrevski,Ilija S. Hristoski and Pece J. Mitrevski,"Evaluation of Business-Oriented Performance Metrics in e-Commerce using
  Web-based Simulation","16 pages, 11 figures, 2 tables","Emerging Research and Solutions in ICT (ERSICT), 1(1):1-16, 2016",10.20544/ERSICT.01.16.P01,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Web 2.0 paradigm has radically changed the way businesses are run all
around the world. Moreover, e-Commerce has overcome in daily shopping
activities. For management teams, the assessment, evaluation, and forecasting
of online incomes and other business-oriented performance measures have become
'a holy grail', the ultimate question imposing their current and future
e-Commerce projects. Within the paper, we describe the development of a
Web-based simulation model, suitable for their estimation, taking into account
multiple operation profiles and scenarios. Specifically, we put focus on
introducing specific classes of e-Customers, as well as the workload
characterization of an arbitrary e-Commerce website. On the other hand, we
employ and embed the principles of the system thinking approach and the system
dynamics into the proposed solution. As a result, a complete simulation model
has been developed, available online. The model, which includes numerous
adjustable input variables, can be successfully utilized in making
'what-if'-like insights into a plethora of business-oriented performance
metrics for an arbitrary e-Commerce website. This project is, also, a great
example of the power delivered by InsightMaker, free-of-charge Web-based
software, suitable for a collaborative online development of models following
the systems thinking paradigm.
","[{'version': 'v1', 'created': 'Fri, 6 Jan 2017 13:55:06 GMT'}]",2017-01-09,"[['Hristoski', 'Ilija S.', ''], ['Mitrevski', 'Pece J.', '']]","['e-Commerce', 'business-oriented performance metrics', 'evaluation', 'Web-based simulation', 'system dynamics']"
3323,1407.6699,Eduardo Vega-Fuentes,"Eduardo Vega-Fuentes, Juan Manuel Cerezo-Sanchez, Sonia Leon-del
  Rosario and Aurelio Vega-Martinez",Fuzzy inference system for integrated VVC in isolated power systems,arXiv admin note: substantial text overlap with arXiv:1401.1632,"International Journal of Artificial Intelligence & Aplications,
  (IJAIA), January 2014, Volume 5, Number 1, pp 91-106",10.5121/ijaia.2014.5107,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a fuzzy inference system for integrated volt/var control
(VVC) in distribution substations. The purpose is go forward to automation
distribution applying conservation voltage reduction (CVR) in isolated power
systems where control capabilities are limited. A fuzzy controller has been
designed. Working as an on-line tool, it has been tested under real conditions
and it has managed the operation during a whole day in a distribution
substation. Within the limits of control capabilities of the system, the
controller maintained successfully an acceptable voltage profile, power factor
values over 0,98 and it has ostensibly improved the performance given by an
optimal power flow based automation system. CVR savings during the test are
evaluated and the aim to integrate it in the VVC is presented.
","[{'version': 'v1', 'created': 'Mon, 10 Feb 2014 12:30:47 GMT'}]",2014-07-25,"[['Vega-Fuentes', 'Eduardo', ''], ['Cerezo-Sanchez', 'Juan Manuel', ''], ['Rosario', 'Sonia Leon-del', ''], ['Vega-Martinez', 'Aurelio', '']]","['Conservation Voltage Reduction', 'Distribution Automation', 'Fuzzy Inference Systems', 'Isolated Power Systems', 'Volt/Var Control']"
3324,1005.2050,Secretary Aircc Journal,"Hafedh Zayani (1) and Kamel Barkaoui (2) and Rahma Ben Ayed (1), ((1)
  National Engineering School of Tunis (ENIT), Tunisia, (2) CNAM - CEDRIC,
  France)","Probabilistic verification and evaluation of Backoff procedure of the
  WSN ECo-MAC protocol","15 Pages, IJWMN 2010","International Journal of Wireless & Mobile Networks 2.2 (2010)
  156-170",10.5121/ijwmn.2010.2211,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Communication protocols and techniques are often evaluated using simulation
techniques. However, the use of formal modeling and analysis techniques for
verification and evaluation in particular for Wireless Sensor Networks (WSN)
becomes a necessity. In this paper we present a formal analysis of the backoff
procedure integrated in the medium access control protocol named ECo-MAC
designed for WSN. We describe this backoff procedure in terms of discrete time
Markov chains (DTMCs) and evaluated using the well known probabilistic model
checker PRISM. After checking the different invariants of the proposed model,
we study the effect of contention window length (in number of time contention
unit) on the acceptable number of simultaneous senders in a neighborhood of a
given receiver. The obtained quantitative results confirm those provided by the
simulation using OPNET tool and justify the validity of the adopted value for
the time contention unit TCU.
","[{'version': 'v1', 'created': 'Wed, 12 May 2010 11:24:09 GMT'}]",2010-07-15,"[['Zayani', 'Hafedh', ''], ['Barkaoui', 'Kamel', ''], ['Ayed', 'Rahma Ben', '']]","['Wireless Sensor Network', 'ECo-MAC protocol', 'probabilistic model checking']"
3325,1701.00546,Sabeur Aridhi,"Sabeur Aridhi, Alberto Montresor, Yannis Velegrakis",BLADYG: A Graph Processing Framework for Large Dynamic Graphs,,,10.1016/j.bdr.2017.05.003,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, distributed processing of large dynamic graphs has become very
popular, especially in certain domains such as social network analysis, Web
graph analysis and spatial network analysis. In this context, many
distributed/parallel graph processing systems have been proposed, such as
Pregel, GraphLab, and Trinity. These systems can be divided into two
categories: (1) vertex-centric and (2) block-centric approaches. In
vertex-centric approaches, each vertex corresponds to a process, and message
are exchanged among vertices. In block-centric approaches, the unit of
computation is a block, a connected subgraph of the graph, and message
exchanges occur among blocks. In this paper, we are considering the issues of
scale and dynamism in the case of block-centric approaches. We present bladyg,
a block-centric framework that addresses the issue of dynamism in large-scale
graphs. We present an implementation of BLADYG on top of akka framework. We
experimentally evaluate the performance of the proposed framework.
","[{'version': 'v1', 'created': 'Mon, 2 Jan 2017 22:25:33 GMT'}]",2018-05-07,"[['Aridhi', 'Sabeur', ''], ['Montresor', 'Alberto', ''], ['Velegrakis', 'Yannis', '']]","['Distributed graph processing', 'Dynamic graphs', 'akka framework']"
3326,1912.01879,"Halit Murat G\""ursu","Serkut Ayva\c{s}{\i}k, H. Murat G\""ursu, Wolfgang Kellerer",Veni Vidi Dixi: Reliable Wireless Communication with Depth Images,"Accepted for publication in CoNext 2019 with reproducibility badges.
  The measurements and the processing codes are available at
  https://gitlab.lrz.de/lkn_measurements/vvd_measurements for your evaluation",,10.1145/3359989.3365418,,cs.IT cs.CV cs.LG cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The upcoming industrial revolution requires deployment of critical wireless
sensor networks for automation and monitoring purposes. However, the
reliability of the wireless communication is rendered unpredictable by mobile
elements in the communication environment such as humans or mobile robots which
lead to dynamically changing radio environments. Changes in the wireless
channel can be monitored with frequent pilot transmission. However, that would
stress the battery life of sensors. In this work a new wireless channel
estimation technique, Veni Vidi Dixi, VVD, is proposed. VVD leverages the
redundant information in depth images obtained from the surveillance cameras in
the communication environment and utilizes Convolutional Neural Networks CNNs
to map the depth images of the communication environment to complex wireless
channel estimations. VVD increases the wireless communication reliability
without the need for frequent pilot transmission and with no additional
complexity on the receiver. The proposed method is tested by conducting
measurements in an indoor environment with a single mobile human. Up to authors
best knowledge our work is the first to obtain complex wireless channel
estimation from only depth images without any pilot transmission. The collected
wireless trace, depth images and codes are publicly available.
","[{'version': 'v1', 'created': 'Wed, 4 Dec 2019 10:21:34 GMT'}]",2019-12-05,"[['Ayvaşık', 'Serkut', ''], ['Gürsu', 'H. Murat', ''], ['Kellerer', 'Wolfgang', '']]","['Channel Estimation', 'Convolutional Neural Networks', 'Dataset']"
3327,1810.12494,Yiming Lei,"Yiming Lei, Yukun Tian, Hongming Shan, Junping Zhang, Ge Wang,
  Mannudeep Kalra","Shape and Margin-Aware Lung Nodule Classification in Low-dose CT Images
  via Soft Activation Mapping",,,10.1016/j.media.2019.101628,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A number of studies on lung nodule classification lack clinical/biological
interpretations of the features extracted by convolutional neural network
(CNN). The methods like class activation mapping (CAM) and gradient-based CAM
(Grad-CAM) are tailored for interpreting localization and classification tasks
while they ignored fine-grained features. Therefore, CAM and Grad-CAM cannot
provide optimal interpretation for lung nodule categorization task in low-dose
CT images, in that fine-grained pathological clues like discrete and irregular
shape and margins of nodules are capable of enhancing sensitivity and
specificity of nodule classification with regards to CNN. In this paper, we
first develop a soft activation mapping (SAM) to enable fine-grained lung
nodule shape \& margin (LNSM) feature analysis with a CNN so that it can access
rich discrete features. Secondly, by combining high-level convolutional
features with SAM, we further propose a high-level feature enhancement scheme
(HESAM) to localize LNSM features. Experiments on the LIDC-IDRI dataset
indicate that 1) SAM captures more fine-grained and discrete attention regions
than existing methods, 2) HESAM localizes more accurately on LNSM features and
obtains the state-of-the-art predictive performance, reducing the false
positive rate, and 3) we design and conduct a visually matching experiment
which incorporates radiologists study to increase the confidence level of
applying our method to clinical diagnosis.
","[{'version': 'v1', 'created': 'Tue, 30 Oct 2018 02:29:30 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Dec 2019 12:23:40 GMT'}]",2019-12-18,"[['Lei', 'Yiming', ''], ['Tian', 'Yukun', ''], ['Shan', 'Hongming', ''], ['Zhang', 'Junping', ''], ['Wang', 'Ge', ''], ['Kalra', 'Mannudeep', '']]","['Low-dose CT', 'lung nodule classification', 'fine-grained features', 'convolutional neural network', 'soft activation mapping']"
3328,1908.01528,Till Blume,"Till Blume, David Richerby and Ansgar Scherp","FLUID: A Common Model for Semantic Structural Graph Summaries Based on
  Equivalence Relations",Accepted author manuscript to appear in Theoretical Computer Science,,10.1016/j.tcs.2020.12.019,,cs.DB,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Summarization is a widespread method for handling very large graphs. The task
of structural graph summarization is to compute a concise but meaningful
synopsis of the key structural information of a graph. As summaries may be used
for many different purposes, there is no single concept or model of graph
summaries. We have studied existing structural graph summaries for large-scale
(semantic) graphs. Despite their different concepts and purposes, we found
commonalities in the graph structures they capture. We use these commonalities
to provide for the first time a formally defined common model, FLUID (FLexible
graph sUmmarIes for Data graphs), that allows us to flexibly define structural
graph summaries. FLUID allows graph summaries to be quickly defined, adapted,
and compared for different purposes and datasets. To this end, FLUID provides
features of structural summarization based on equivalence relations such as
distinction of types and properties, direction of edges, bisimulation, and
inference. We conduct a detailed complexity analysis of the features provided
by FLUID. We show that graph summaries defined with FLUID can be computed in
the worst case in time $\mathcal{O}(n^2)$ w.r.t. $n$, the number of edges in
the data graph. An empirical analysis of large-scale web graphs with billions
of edges indicates a typical running time of $\Theta(n)$. Based on the formal
FLUID model, one can quickly define and modify various structural graph
summaries from the literature and beyond.
","[{'version': 'v1', 'created': 'Mon, 5 Aug 2019 09:14:54 GMT'}, {'version': 'v2', 'created': 'Sun, 16 Aug 2020 15:20:07 GMT'}, {'version': 'v3', 'created': 'Mon, 4 Jan 2021 11:40:52 GMT'}]",2021-01-05,"[['Blume', 'Till', ''], ['Richerby', 'David', ''], ['Scherp', 'Ansgar', '']]","['Structural graph summary', 'Semantic graphs', 'Parameterized formal model']"
3329,1804.07655,Andreas Steyven,"Emma Hart, Andreas S.W. Steyven, Ben Paechter","Evolution of a Functionally Diverse Swarm via a Novel Decentralised
  Quality-Diversity Algorithm",In GECCO 2018,,10.1145/3205455.3205481,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The presence of functional diversity within a group has been demonstrated to
lead to greater robustness, higher performance and increased problem-solving
ability in a broad range of studies that includes insect groups, human groups
and swarm robotics. Evolving group diversity however has proved challenging
within Evolutionary Robotics, requiring reproductive isolation and careful
attention to population size and selection mechanisms. To tackle this issue, we
introduce a novel, decentralised, variant of the MAP-Elites illumination
algorithm which is hybridised with a well-known distributed evolutionary
algorithm (mEDEA). The algorithm simultaneously evolves multiple diverse
behaviours for multiple robots, with respect to a simple token-gathering task.
Each robot in the swarm maintains a local archive defined by two pre-specified
functional traits which is shared with robots it come into contact with. We
investigate four different strategies for sharing, exploiting and combining
local archives and compare results to mEDEA. Experimental results show that in
contrast to previous claims, it is possible to evolve a functionally diverse
swarm without geographical isolation, and that the new method outperforms mEDEA
in terms of the diversity, coverage and precision of the evolved swarm.
","[{'version': 'v1', 'created': 'Fri, 20 Apr 2018 14:57:26 GMT'}]",2018-04-23,"[['Hart', 'Emma', ''], ['Steyven', 'Andreas S. W.', ''], ['Paechter', 'Ben', '']]","['Functional Diversity', 'Evolutionary Robotics', 'Map-Elites']"
3330,1608.02023,Jun Zhou,"Jun Zhou, Haozhou Yu, Karen Smith, Colin Wilder, Hongkai Yu, Song Wang","Identifying Designs from Incomplete, Fragmented Cultural Heritage
  Objects by Curve-Pattern Matching","In Journal of Electronic Imaging, 2017",,10.1117/1.JEI.26.1.011022,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Study of cultural-heritage objects with embellished realistic and abstract
designs made up of connected and intertwined curves crosscuts a number of
related disciplines, including archaeology, art history, and heritage
management. However, many objects, such as pottery sherds found in the
archaeological record, are fragmentary, making the underlying complete designs
unknowable at the scale of the sherd fragment. The challenge to reconstruct and
study complete designs is stymied because 1) most fragmentary cultural-heritage
objects contain only a small portion of the underlying full design, 2) in the
case of a stamping application, the same design may be applied multiple times
with spatial overlap on one object, and 3) curve patterns detected on an object
are usually incomplete and noisy. As a result, classical curve-pattern matching
algorithms, such as Chamfer matching, may perform poorly in identifying the
underlying design. In this paper, we develop a new partial-to-global curve
matching algorithm to address these challenges and better identify the full
design from a fragmented cultural heritage object. Specifically, we develop the
algorithm to identify the designs of the carved wooden paddles of the
Southeastern Woodlands from unearthed pottery sherds. A set of pottery sherds
from the Snow Collection, curated at Georgia Southern University, are used to
test the proposed algorithm, with promising results.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2016 21:09:53 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Jan 2017 21:40:03 GMT'}]",2017-01-09,"[['Zhou', 'Jun', ''], ['Yu', 'Haozhou', ''], ['Smith', 'Karen', ''], ['Wilder', 'Colin', ''], ['Yu', 'Hongkai', ''], ['Wang', 'Song', '']]","['cultural heritage', 'Southeastern Woodlands', 'pottery sherd classification', 'partial matching', 'composite curvepatterns', 'design identification']"
3331,1710.10403,Cheng-Hao Cai,"Cheng-Hao Cai, Yanyan Xu, Dengfeng Ke, Kaile Su, Jing Sun",Trainable back-propagated functional transfer matrices,"39 pages, 4 figures, submitted as a journal article",Appl. Intell. (2018),10.1007/s10489-018-1266-3,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Connections between nodes of fully connected neural networks are usually
represented by weight matrices. In this article, functional transfer matrices
are introduced as alternatives to the weight matrices: Instead of using real
weights, a functional transfer matrix uses real functions with trainable
parameters to represent connections between nodes. Multiple functional transfer
matrices are then stacked together with bias vectors and activations to form
deep functional transfer neural networks. These neural networks can be trained
within the framework of back-propagation, based on a revision of the delta
rules and the error transmission rule for functional connections. In
experiments, it is demonstrated that the revised rules can be used to train a
range of functional connections: 20 different functions are applied to neural
networks with up to 10 hidden layers, and most of them gain high test
accuracies on the MNIST database. It is also demonstrated that a functional
transfer matrix with a memory function can roughly memorise a non-cyclical
sequence of 400 digits.
","[{'version': 'v1', 'created': 'Sat, 28 Oct 2017 06:59:18 GMT'}]",2018-09-13,"[['Cai', 'Cheng-Hao', ''], ['Xu', 'Yanyan', ''], ['Ke', 'Dengfeng', ''], ['Su', 'Kaile', ''], ['Sun', 'Jing', '']]","['Functional Transfer Matrices', 'Deep learning', 'Trainable functional']"
3332,1912.02636,Qingxiang Wang,"Qingxiang Wang, Chad Brown, Cezary Kaliszyk, Josef Urban","Exploration of Neural Machine Translation in Autoformalization of
  Mathematics in Mizar","The 9th ACM SIGPLAN International Conference on Certified Programs
  and Proofs",,10.1145/3372885.3373827,,cs.LO cs.CL cs.LG,http://creativecommons.org/licenses/by/4.0/,"  In this paper we share several experiments trying to automatically translate
informal mathematics into formal mathematics. In our context informal
mathematics refers to human-written mathematical sentences in the LaTeX format;
and formal mathematics refers to statements in the Mizar language. We conducted
our experiments against three established neural network-based machine
translation models that are known to deliver competitive results on translating
between natural languages. To train these models we also prepared four
informal-to-formal datasets. We compare and analyze our results according to
whether the model is supervised or unsupervised. In order to augment the data
available for auto-formalization and improve the results, we develop a custom
type-elaboration mechanism and integrate it in the supervised translation.
","[{'version': 'v1', 'created': 'Thu, 5 Dec 2019 15:13:15 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Dec 2019 09:29:01 GMT'}]",2019-12-16,"[['Wang', 'Qingxiang', ''], ['Brown', 'Chad', ''], ['Kaliszyk', 'Cezary', ''], ['Urban', 'Josef', '']]","['Automating Formalization', 'Proof Assistants', 'Neural Machine Translation', 'Mizar', 'Machine Learning']"
3333,1911.09041,Laura Koesten,"Laura Koesten, Kathleen Gregory, Paul Groth, Elena Simperl",Talking datasets: Understanding data sensemaking behaviours,"26 pages, 7 figures, 6 tables",,10.1016/j.ijhcs.2020.102562,,cs.HC cs.DL,http://creativecommons.org/licenses/by/4.0/,"  The sharing and reuse of data are seen as critical to solving the most
complex problems of today. Despite this potential, relatively little is known
about a key step in data reuse: people's behaviours involved in data-centric
sensemaking. We aim to address this gap by presenting a mixed-methods study
combining in-depth interviews, a think-aloud task and a screen recording
analysis with 31 researchers as they summarised and interacted with both
familiar and unfamiliar data. We use our findings to identify and detail common
activity patterns and necessary data attributes across three clusters of
sensemaking activities: inspecting data, engaging with content, and placing
data within broader contexts. We conclude by proposing design recommendations
for tools and documentation practices which can be used to facilitate
sensemaking and subsequent data reuse.
","[{'version': 'v1', 'created': 'Wed, 20 Nov 2019 17:14:18 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Jan 2020 17:17:03 GMT'}, {'version': 'v3', 'created': 'Sat, 18 Jul 2020 16:36:18 GMT'}]",2022-11-10,"[['Koesten', 'Laura', ''], ['Gregory', 'Kathleen', ''], ['Groth', 'Paul', ''], ['Simperl', 'Elena', '']]","['sensemaking', 'human computer interaction', 'human data interaction', 'data reuse', 'data sharing']"
3334,1307.6976,Reza Azizi,Reza Azizi,"Performance study and simulation of an anycast protocol for wireless
  mobile ad hoc networks","15 pages, 20 figures, 1 table","International Journal of Wireless & Mobile Networks (IJWMN) Vol.
  5, No. 3, June 2013",10.5121/ijwmn.2013.5302,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper conducts a detailed simulation study of stateless anycast routing
in a mobile wireless ad hoc network. The model covers all the fundamental
aspects of such networks with a routing mechanism using a scheme of
orientation-dependent inter-node communication links. The simulation system
Winsim is used which explicitly represents parallelism of events and processes
in the network. The purpose of these simulations is to investigate the effect
of node s maximum speed, and different TTL over the network performance under
two different scenarios. Simulation study investigates five practically
important performance metrics of a wireless mobile ad hoc network and shows the
dependence of this metrics on the transmission radius, link availability, and
maximal possible node speed.
","[{'version': 'v1', 'created': 'Fri, 26 Jul 2013 09:45:54 GMT'}]",2013-07-29,"[['Azizi', 'Reza', '']]","['Mobile Wireless Ad Hoc Networks', 'Network Protocols', 'Anycast', 'Simulation', 'Performance Evaluation']"
3335,1403.7293,Roshan Ragel,"D. Jayasinghe, R. G. Ragel, D. Elkaduwe","Constant time encryption as a countermeasure against remote cache timing
  attacks",,"Information and Automation for Sustainability (ICIAfS), 2012 IEEE
  6th International Conference on, 27-29 Sept 2012, pp 129-134, Beijing",10.1109/ICIAFS.2012.6419893,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rijndael was standardized in 2001 by National Institute of Standard and
Technology as the Advanced Encryption Standard (AES). AES is still being used
to encrypt financial, military and even government confidential data. In 2005,
Bernstein illustrated a remote cache timing attack on AES using the
client-server architecture and therefore proved a side channel in its software
implementation. Over the years, a number of countermeasures have been proposed
against cache timing attacks both using hardware and software. Although the
software based countermeasures are flexible and easy to deploy, most of such
countermeasures are vulnerable to statistical analysis. In this paper, we
propose a novel software based countermeasure against cache timing attacks,
known as constant time encryption, which we believe is secure against
statistical analysis. The countermeasure we proposed performs rescheduling of
instructions such that the encryption rounds will consume constant time
independent of the cache hits and misses. Through experiments, we prove that
our countermeasure is secure against Bernstein's cache timing attack.
","[{'version': 'v1', 'created': 'Fri, 28 Mar 2014 07:37:26 GMT'}]",2014-03-31,"[['Jayasinghe', 'D.', ''], ['Ragel', 'R. G.', ''], ['Elkaduwe', 'D.', '']]","['side channel', 'cache timing attack', 'constant time encryption']"
3336,1812.07867,Stefan Wagner,Simone V. Spiegler and Christoph Heinecke and Stefan Wagner,Leadership Gap in Agile Teams: How Teams and Scrum Masters Mature,"15 pages, 2 figures",,10.1007/978-3-030-19034-7_3,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivation: How immature teams can become agile is a question that puzzles
practitioners and researchers alike. Scrum is one method that supports agile
working. Empirical research on the Scrum Master role remains scarce and reveals
contradicting results. While the Scrum Master role is often centred on one
person in rather immature teams, the role is expected to be shared among
multiple members in mature teams. Objective: Therefore, we aim to understand
how the Scrum Master role changes while the team matures. Method: We applied
Grounded Theory and conducted qualitative interviews with 53 practitioners of
29 software and non-software project teams from Robert Bosch GmbH. Results: We
discovered that Scrum Masters initially plays nine leadership roles which they
transfer to the team while it matures. Roles can be transferred by providing a
leadership gap, which allows team members to take on a leadership role, and by
providing an internal team environment with communication on equal terms,
psychological safety, transparency, shared understanding, shared purpose and
self-efficacy. Conclusion: The Scrum Master role changes while the team
matures. Trust and freedom to take over a leadership role in teams are
essential enablers. Our results support practitioners in implementing agile
teams in established companies.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2018 10:48:33 GMT'}]",2021-02-10,"[['Spiegler', 'Simone V.', ''], ['Heinecke', 'Christoph', ''], ['Wagner', 'Stefan', '']]","['Agile Teams', 'Scrum Master Role', 'Maturity']"
3337,1408.5094,Marco Montali,"Diego Calvanese and Marco Montali and Montserrat Estanol and Ernest
  Teniente","Verifiable UML Artifact-Centric Business Process Models (Extended
  Version)","Extended version of ""Verifiable UML Artifact-Centric Business Process
  Models"" - to appear in the Proceedings of CIKM 2014",,10.1145/2661829.2662050,,cs.DB cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Artifact-centric business process models have gained increasing momentum
recently due to their ability to combine structural (i.e., data related) with
dynamical (i.e., process related) aspects. In particular, two main lines of
research have been pursued so far: one tailored to business artefact modeling
languages and methodologies, the other focused on the foundations for their
formal verification. In this paper, we merge these two lines of research, by
showing how recent theoretical decidability results for verification can be
fruitfully transferred to a concrete UML-based modeling methodology. In
particular, we identify additional steps in the methodology that, in
significant cases, guarantee the possibility of verifying the resulting models
against rich first-order temporal properties. Notably, our results can be
seamlessly transferred to different languages for the specification of the
artifact lifecycles.
","[{'version': 'v1', 'created': 'Thu, 21 Aug 2014 18:22:21 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Aug 2014 14:09:33 GMT'}]",2014-08-27,"[['Calvanese', 'Diego', ''], ['Montali', 'Marco', ''], ['Estanol', 'Montserrat', ''], ['Teniente', 'Ernest', '']]","['Business artifacts', 'formal verification', 'UML', 'BPM']"
3338,1005.1771,Amparo Fuster-Sabater,Amparo Fuster-Sabater and Pino Caballero-Gil,On the Use of Cellular Automata in Symmetric Cryptography,"25 pages, 0 figures","Acta Applicandae Mathematicae. Volume 93, Numbers 1-3, pp.
  215-236. Sept 2006. Springer.",10.1007/s10440-006-9041-6,,cs.CR cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, pseudorandom sequence generators based on finite fields have
been analyzed from the point of view of their cryptographic application. In
fact, a class of nonlinear sequence generators has been modelled in terms of
linear cellular automata. The algorithm that converts the given generator into
a linear model based on automata is very simple and is based on the
concatenation of a basic structure. Once the generator has been linearized, a
cryptanalytic attack that exploits the weaknesses of such a model has been
developed. Linear cellular structures easily model sequence generators with
application in stream cipher cryptography.
","[{'version': 'v1', 'created': 'Tue, 11 May 2010 09:17:47 GMT'}]",2010-05-12,"[['Fuster-Sabater', 'Amparo', ''], ['Caballero-Gil', 'Pino', '']]","['automata', 'finite fields', 'cryptography', 'sequence generator']"
3339,1707.02759,Guillermo de Bernardo,"Sandra Alvarez-Garcia, Guillermo de Bernardo, Nieves R. Brisaboa,
  Gonzalo Navarro",A succinct data structure for self-indexing ternary relations,"This research has received funding from the European Union's Horizon
  2020 research and innovation programme under the Marie Sk{\l}odowska-Curie
  Actions H2020-MSCA-RISE-2015 BIRDS GA No. 690941, Journal of Discrete
  Algorithms (2017)",,10.1016/j.jda.2016.10.002,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The representation of binary relations has been intensively studied and many
different theoretical and practical representations have been proposed to
answer the usual queries in multiple domains. However, ternary relations have
not received as much attention, even though many real-world applications
require the processing of ternary relations. In this paper we present a new
compressed and self-indexed data structure that we call Interleaved $K^2$-tree
(I$K^2$-tree), designed to compactly represent and efficiently query general
ternary relations. The I$K^2$-tree is an evolution of an existing data
structure, the $K^2$-tree, initially designed to represent Web graphs and later
applied to other domains. The I$K^2$-tree is able to extend the $K^2$-tree to
represent a ternary relation, based on the idea of decomposing it into a
collection of binary relations but providing indexing capabilities in all the
three dimensions. We present different ways to use I$K^2$-tree to model
different types of ternary relations using as reference two typical domains:
RDF and Temporal Graphs. We also experimentally evaluate our representations
comparing them in space usage and performance with other solutions of the state
of the art.
","[{'version': 'v1', 'created': 'Mon, 10 Jul 2017 09:06:19 GMT'}]",2017-07-11,"[['Alvarez-Garcia', 'Sandra', ''], ['de Bernardo', 'Guillermo', ''], ['Brisaboa', 'Nieves R.', ''], ['Navarro', 'Gonzalo', '']]","['Compressed Data Structures', 'Ternary Relations', 'RDF', 'TemporalGraphs', 'K2-tree']"
3340,1710.10225,Davide Maiorca,"Davide Maiorca, Ambra Demontis, Battista Biggio, Fabio Roli and
  Giorgio Giacinto",Adversarial Detection of Flash Malware: Limitations and Open Issues,,"Computers and Security, Volume 96, September 2020, 101901",10.1016/j.cose.2020.101901,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During the past four years, Flash malware has become one of the most
insidious threats to detect, with almost 600 critical vulnerabilities targeting
Adobe Flash disclosed in the wild. Research has shown that machine learning can
be successfully used to detect Flash malware by leveraging static analysis to
extract information from the structure of the file or its bytecode. However,
the robustness of Flash malware detectors against well-crafted evasion attempts
- also known as adversarial examples - has never been investigated. In this
paper, we propose a security evaluation of a novel, representative Flash
detector that embeds a combination of the prominent, static features employed
by state-of-the-art tools. In particular, we discuss how to craft adversarial
Flash malware examples, showing that it suffices to manipulate the
corresponding source malware samples slightly to evade detection. We then
empirically demonstrate that popular defense techniques proposed to mitigate
evasion attempts, including re-training on adversarial examples, may not always
be sufficient to ensure robustness. We argue that this occurs when the feature
vectors extracted from adversarial examples become indistinguishable from those
of benign data, meaning that the given feature representation is intrinsically
vulnerable. In this respect, we are the first to formally define and
quantitatively characterize this vulnerability, highlighting when an attack can
be countered by solely improving the security of the learning algorithm, or
when it requires also considering additional features. We conclude the paper by
suggesting alternative research directions to improve the security of
learning-based Flash malware detectors.
","[{'version': 'v1', 'created': 'Fri, 27 Oct 2017 16:20:04 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Jul 2020 07:16:52 GMT'}]",2020-07-15,"[['Maiorca', 'Davide', ''], ['Demontis', 'Ambra', ''], ['Biggio', 'Battista', ''], ['Roli', 'Fabio', ''], ['Giacinto', 'Giorgio', '']]","['Adobe Flash', 'Malware Detection', 'Secure Machine Learning', 'Adversarial Training', 'Computer Security']"
3341,1811.10831,Swagata Duari,Swagata Duari and Vasudha Bhatnagar,sCAKE: Semantic Connectivity Aware Keyword Extraction,"40 pages, 7 figures, 13 tables, submitted to Journal of Information
  Sciences",Information Sciences 477C (2019) pp. 100-117,10.1016/j.ins.2018.10.034,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Keyword Extraction is an important task in several text analysis endeavors.
In this paper, we present a critical discussion of the issues and challenges
ingraph-based keyword extraction methods, along with comprehensive empirical
analysis. We propose a parameterless method for constructing graph of text that
captures the contextual relation between words. A novel word scoring method is
also proposed based on the connection between concepts. We demonstrate that
both proposals are individually superior to those followed by the
state-of-the-art graph-based keyword extraction algorithms. Combination of the
proposed graph construction and scoring methods leads to a novel, parameterless
keyword extraction method (sCAKE) based on semantic connectivity of words in
the document.
  Motivated by limited availability of NLP tools for several languages, we also
design and present a language-agnostic keyword extraction (LAKE) method. We
eliminate the need of NLP tools by using a statistical filter to identify
candidate keywords before constructing the graph. We show that the resulting
method is a competent solution for extracting keywords from documents
oflanguages lacking sophisticated NLP support.
","[{'version': 'v1', 'created': 'Tue, 27 Nov 2018 06:22:33 GMT'}]",2018-11-28,"[['Duari', 'Swagata', ''], ['Bhatnagar', 'Vasudha', '']]","['Automatic Keyword Extraction', 'Text Graph', 'Semantic']"
3342,0901.0055,Mokshay Madiman,"Mokshay Madiman, Adam Marcus, Prasad Tetali","Entropy and set cardinality inequalities for partition-determined
  functions","26 pages. v2: Revised version incorporating referee feedback plus
  inclusion of some additional corollaries and discussion. v3: Final version
  with minor corrections. To appear in Random Structures and Algorithms","Random Structures and Algorithms, Vol. 40, pp. 399-424, 2012",10.1002/rsa.20385,,cs.IT math.CO math.IT math.NT math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new notion of partition-determined functions is introduced, and several
basic inequalities are developed for the entropy of such functions of
independent random variables, as well as for cardinalities of compound sets
obtained using these functions. Here a compound set means a set obtained by
varying each argument of a function of several variables over a set associated
with that argument, where all the sets are subsets of an appropriate algebraic
structure so that the function is well defined. On the one hand, the entropy
inequalities developed for partition-determined functions imply entropic
analogues of general inequalities of Pl\""unnecke-Ruzsa type. On the other hand,
the cardinality inequalities developed for compound sets imply several
inequalities for sumsets, including for instance a generalization of
inequalities proved by Gyarmati, Matolcsi and Ruzsa (2010). We also provide
partial progress towards a conjecture of Ruzsa (2007) for sumsets in nonabelian
groups. All proofs are elementary and rely on properly developing certain
information-theoretic inequalities.
","[{'version': 'v1', 'created': 'Wed, 31 Dec 2008 04:30:15 GMT'}, {'version': 'v2', 'created': 'Sun, 12 Jun 2011 00:51:32 GMT'}, {'version': 'v3', 'created': 'Wed, 10 Aug 2011 03:55:13 GMT'}]",2012-06-05,"[['Madiman', 'Mokshay', ''], ['Marcus', 'Adam', ''], ['Tetali', 'Prasad', '']]","['Sumsets', 'additive combinatorics', 'entropy inequalities', 'cardinality inequalities']"
3343,1207.3868,Md. Hasnat Kabir Dr,"Saleh Masum, M. Hasnat Kabir, Md. Matiqul Islam, Rifat Ara Shams and
  Shaikh Enayet Ullah","Impact of Different Spreading Codes Using FEC on DWT Based MC-CDMA
  System","10 Pages; International Journal of Mobile Network Communications &
  Telematics (IJMNCT) Vol.2, No.3, June 2012",,10.5121/ijmnct.2012.2301,,cs.IT cs.PF math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The effect of different spreading codes in DWT based MC-CDMA wireless
communication system is investigated. In this paper, we present the Bit Error
Rate (BER) performance of different spreading codes (Walsh-Hadamard code,
Orthogonal gold code and Golay complementary sequences) using Forward Error
Correction (FEC) of the proposed system. The data is analyzed and is compared
among different spreading codes in both coded and uncoded cases. It is found
via computer simulation that the performance of the proposed coded system is
much better than that of the uncoded system irrespective of the spreading codes
and all the spreading codes show approximately similar nature for both coded
and uncoded in all modulation schemes.
","[{'version': 'v1', 'created': 'Tue, 17 Jul 2012 03:46:43 GMT'}]",2012-07-18,"[['Masum', 'Saleh', ''], ['Kabir', 'M. Hasnat', ''], ['Islam', 'Md. Matiqul', ''], ['Shams', 'Rifat Ara', ''], ['Ullah', 'Shaikh Enayet', '']]","['DWT', 'MC-CDMA', 'FEC', 'Walsh Hadamard', 'Gold', 'Golay']"
3344,0906.1360,S\'ilvio Duarte Queir\'os M.,Silvio M. Duarte Queiros,"On the effectiveness of a binless entropy estimator for generalised
  entropic forms",10 pages. 5 Figures. 2 Appendices with 2 figures,"Phys. Rev. E 80, 062101 (2009)",10.1103/PhysRevE.80.062101,,cs.IT cs.DS math.IT math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this manuscript we discuss the effectiveness of the Kozachenko-Leonenko
entropy estimator when generalised to cope with entropic forms customarily
applied to study systems evincing asymptotic scale invariance and dependence
(either linear or non-linear type). We show that when the variables are
independently and identically distributed the estimator is only valuable along
the whole domain if the data follow the uniform distribution, whereas for other
distributions the estimator is only effectual in the limit of the
Boltzmann-Gibbs-Shanon entropic form. We also analyse the influence of the
dependence (linear and non-linear) between variables on the accuracy of the
estimator between variables. As expected in the last case the estimator looses
efficiency for the Boltzmann-Gibbs-Shanon entropic form as well.
","[{'version': 'v1', 'created': 'Sun, 7 Jun 2009 14:37:40 GMT'}, {'version': 'v2', 'created': 'Sat, 12 Sep 2009 12:29:12 GMT'}, {'version': 'v3', 'created': 'Mon, 4 Jan 2010 00:01:19 GMT'}]",2010-01-04,"[['Queiros', 'Silvio M. Duarte', '']]","['entropy estimation', 'finite systems', 'non-additive entropy']"
3345,1810.09582,Nils Gessert,"Nils Gessert and Martin Gromniak and Matthias Schl\""uter and Alexander
  Schlaefer","Two-path 3D CNNs for calibration of system parameters for OCT-based
  motion compensation",Accepted at SPIE: Medical Imaging 2019,,10.1117/12.2512823,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic motion compensation and adjustment of an intraoperative imaging
modality's field of view is a common problem during interventions. Optical
coherence tomography (OCT) is an imaging modality which is used in
interventions due to its high spatial resolution of few micrometers and its
temporal resolution of potentially several hundred volumes per second. However,
performing motion compensation with OCT is problematic due to its small field
of view which might lead to tracked objects being lost quickly. We propose a
novel deep learning-based approach that directly learns input parameters of
motors that move the scan area for motion compensation from optical coherence
tomography volumes. We design a two-path 3D convolutional neural network (CNN)
architecture that takes two volumes with an object to be tracked as its input
and predicts the necessary motor input parameters to compensate the object's
movement. In this way, we learn the calibration between object movement and
system parameters for motion compensation with arbitrary objects. Thus, we
avoid error-prone hand-eye calibration and handcrafted feature tracking from
classical approaches. We achieve an average correlation coefficient of 0.998
between predicted and ground-truth motor parameters which leads to sub-voxel
accuracy. Furthermore, we show that our deep learning model is real-time
capable for use with the system's high volume acquisition frequency.
","[{'version': 'v1', 'created': 'Mon, 22 Oct 2018 22:14:38 GMT'}]",2019-03-12,"[['Gessert', 'Nils', ''], ['Gromniak', 'Martin', ''], ['Schlüter', 'Matthias', ''], ['Schlaefer', 'Alexander', '']]","['Deep Learning', '3D CNN', 'Motion Compensation', 'OCT']"
3346,1008.1658,EPTCS,"Xiaoxue Piao (Queen's University), Kai Salomaa (Queen's University)","Transformations Between Different Types of Unranked Bottom-Up Tree
  Automata","In Proceedings DCFS 2010, arXiv:1008.1270","EPTCS 31, 2010, pp. 159-168",10.4204/EPTCS.31.18,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the representational state complexity of unranked tree automata.
The bottom-up computation of an unranked tree automaton may be either
deterministic or nondeterministic, and further variants arise depending on
whether the horizontal string languages defining the transitions are
represented by a DFA or an NFA. Also, we consider for unranked tree automata
the alternative syntactic definition of determinism introduced by Cristau et
al. (FCT'05, Lect. Notes Comput. Sci. 3623, pp. 68-79).
  We establish upper and lower bounds for the state complexity of conversions
between different types of unranked tree automata.
","[{'version': 'v1', 'created': 'Tue, 10 Aug 2010 08:33:53 GMT'}]",2010-08-11,"[['Piao', 'Xiaoxue', '', ""Queen's University""], ['Salomaa', 'Kai', '', ""Queen's University""]]","['tree automata', 'unranked trees', 'state complexity', 'nondeterminism']"
3347,2001.01047,Muhammad Haroon Shakeel,"Muhammad Haroon Shakeel, Asim Karim","Adapting Deep Learning for Sentiment Classification of Code-Switched
  Informal Short Text",,The 35th ACM/SIGAPP Symposium on Applied Computing (SAC) 2020,10.1145/3341105.3374091,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, an abundance of short text is being generated that uses nonstandard
writing styles influenced by regional languages. Such informal and
code-switched content are under-resourced in terms of labeled datasets and
language models even for popular tasks like sentiment classification. In this
work, we (1) present a labeled dataset called MultiSenti for sentiment
classification of code-switched informal short text, (2) explore the
feasibility of adapting resources from a resource-rich language for an informal
one, and (3) propose a deep learning-based model for sentiment classification
of code-switched informal short text. We aim to achieve this without any
lexical normalization, language translation, or code-switching indication. The
performance of the proposed models is compared with three existing multilingual
sentiment classification models. The results show that the proposed model
performs better in general and adapting character-based embeddings yield
equivalent performance while being computationally more efficient than training
word-based domain-specific embeddings.
","[{'version': 'v1', 'created': 'Sat, 4 Jan 2020 06:31:15 GMT'}]",2020-04-07,"[['Shakeel', 'Muhammad Haroon', ''], ['Karim', 'Asim', '']]","['Deep learning', 'sentiment classification', 'code-switching', 'RomanUrdu', 'informal language']"
3348,1811.08696,Giovanni Abramo,"Giovanni Abramo, Ciriaco Andrea D'Angelo, Alessandro Caprasecca","The contribution of star scientists to overall sex differences in
  research productivity",,"Abramo, G., D'Angelo, C.A., Caprasecca, A. (2009). The
  contribution of star scientists to overall sex differences in research
  productivity. Scientometrics, 81(1), 137-156",10.1007/s11192-008-2131-7,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The state of the art on the issue of sex differences in research efficiency
agrees in recognizing higher performances for males, however there are
divergences in explaining the possible causes. One of the causes advanced is
that there are sex differences in the availability of aptitude at the ""high
end"". By comparing sex differences in concentration and performance of Italian
academic star scientists to the case in the population complement, this work
aims to verify if star, or ""high-end"", scientists play a preponderant role in
determining higher performance among males. The study reveals the existence of
a greater relative concentration of males among star scientists, as well as a
performance gap between male and female star scientists that is greater than
for the rest of the population. In the latter subpopulation the performance gap
between the two sexs is seen as truly marginal.
","[{'version': 'v1', 'created': 'Wed, 21 Nov 2018 11:46:51 GMT'}]",2018-11-22,"[['Abramo', 'Giovanni', ''], [""D'Angelo"", 'Ciriaco Andrea', ''], ['Caprasecca', 'Alessandro', '']]","['Star scientists', 'sex differences', 'university', 'research performance', 'bibliometrics']"
3349,2112.04381,Costas Iordanou,"Costas Iordanou, Fragkiskos Papadopoulos","Topology and Geometry of the Third-Party Domains Ecosystem: Measurement
  and Applications",,"ACM SIGCOMM Computer Communication Review (CCR), vol. 52, issue 4,
  pp 12-25, October 2022",10.1145/3577929.3577932,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the years, web content has evolved from simple text and static images
hosted on a single server to a complex, interactive and multimedia-rich content
hosted on different servers. As a result, a modern website during its loading
time fetches content not only from its owner's domain but also from a range of
third-party domains providing additional functionalities and services. Here, we
infer the network of the third-party domains by observing the domains'
interactions within users' browsers from all over the globe. We find that this
network possesses structural properties commonly found in complex networks,
such as power-law degree distribution, strong clustering, and small-world
property. These properties imply that a hyperbolic geometry underlies the
ecosystem's topology. We use statistical inference methods to find the domains'
coordinates in this geometry, which abstract how popular and similar the
domains are. The hyperbolic map we obtain is meaningful, revealing the
large-scale organization of the ecosystem. Furthermore, we show that it
possesses predictive power, providing us the likelihood that third-party
domains are co-hosted; belong to the same legal entity; or merge under the same
entity in the future in terms of company acquisition. We also find that
complementarity instead of similarity is the dominant force driving future
domains' merging. These results provide a new perspective on understanding the
ecosystem's organization and performing related inferences and predictions.
","[{'version': 'v1', 'created': 'Mon, 6 Dec 2021 11:02:01 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Dec 2022 15:20:42 GMT'}]",2022-12-22,"[['Iordanou', 'Costas', ''], ['Papadopoulos', 'Fragkiskos', '']]","['Third-Party Domains', 'Network Topology', 'Hyperbolic Embedding', 'Applications']"
3350,1811.01753,Patrick Krauss,"Achim Schilling, Claus Metzner, Jonas Rietsch, Richard Gerum, Holger
  Schulze, Patrick Krauss","How deep is deep enough? -- Quantifying class separability in the hidden
  layers of deep neural networks",,"Neural Networks Volume 139, July 2021, Pages 278-293",10.1016/j.neunet.2021.03.035,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks typically outperform more traditional machine learning
models in their ability to classify complex data, and yet is not clear how the
individual hidden layers of a deep network contribute to the overall
classification performance. We thus introduce a Generalized Discrimination
Value (GDV) that measures, in a non-invasive manner, how well different data
classes separate in each given network layer. The GDV can be used for the
automatic tuning of hyper-parameters, such as the width profile and the total
depth of a network. Moreover, the layer-dependent GDV(L) provides new insights
into the data transformations that self-organize during training: In the case
of multi-layer perceptrons trained with error backpropagation, we find that
classification of highly complex data sets requires a temporal {\em reduction}
of class separability, marked by a characteristic 'energy barrier' in the
initial part of the GDV(L) curve. Even more surprisingly, for a given data set,
the GDV(L) is running through a fixed 'master curve', independently from the
total number of network layers. Furthermore, applying the GDV to Deep Belief
Networks reveals that also unsupervised training with the Contrastive
Divergence method can systematically increase class separability over tens of
layers, even though the system does not 'know' the desired class labels. These
results indicate that the GDV may become a useful tool to open the black box of
deep learning.
","[{'version': 'v1', 'created': 'Mon, 5 Nov 2018 14:46:12 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Jun 2019 13:09:32 GMT'}]",2022-10-03,"[['Schilling', 'Achim', ''], ['Metzner', 'Claus', ''], ['Rietsch', 'Jonas', ''], ['Gerum', 'Richard', ''], ['Schulze', 'Holger', ''], ['Krauss', 'Patrick', '']]","['Deep Learning', 'Unsupervised Feature Extraction', 'Hyperparameter Optimization', 'Cluster Analysis', 'Representation Learning']"
3351,0902.0922,Yassine Ariba,"Yann Labit (LAAS), Yassine Ariba (LAAS), Fr\'ed\'eric Gouaisbaut
  (LAAS)","On Designing Lyapunov-Krasovskii Based AQM for Routers Supporting TCP
  Flows",,"46th IEEE Conference on Decision and Control, New Orleans :
  \'Etats-Unis d'Am\'erique (2007)",10.1109/CDC.2007.4434673,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For the last few years, we assist to a growing interest of designing AQM
(Active Queue Management) using control theory. In this paper, we focus on the
synthesis of an AQM based on the Lyapunov theory for time delay systems. With
the help of a recently developed Lyapunov-Krasovskii functional and using a
state space representation of a linearized fluid model of TCP, two robust AQMs
stabilizing the TCP model are constructed. Notice that our results are
constructive and the synthesis problem is reduced to a convex optimization
scheme expressed in terms of linear matrix inequalities (LMIs). Finally, an
example extracted from the literature and simulations via {\it NS simulator}
support our study.
","[{'version': 'v1', 'created': 'Thu, 5 Feb 2009 15:24:57 GMT'}]",2009-02-06,"[['Labit', 'Yann', '', 'LAAS'], ['Ariba', 'Yassine', '', 'LAAS'], ['Gouaisbaut', 'Frédéric', '', 'LAAS']]","['Active Queue Management', 'congestion problem', 'Lineartime delay systems', 'Lyapunov-Krasovskii functional', 'LMIs']"
3352,1711.06765,Eli (Omid) David,"Sarit Chicotay, Eli David, Nathan S. Netanyahu",A Two-Phase Genetic Algorithm for Image Registration,,"ACM Genetic and Evolutionary Computation Conference (GECCO), pp.
  189-190, Berlin, Germany, July 2017",10.1145/3067695.3076017,,cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image Registration (IR) is the process of aligning two (or more) images of
the same scene taken at different times, different viewpoints and/or by
different sensors. It is an important, crucial step in various image analysis
tasks where multiple data sources are integrated/fused, in order to extract
high-level information.
  Registration methods usually assume a relevant transformation model for a
given problem domain. The goal is to search for the ""optimal"" instance of the
transformation model assumed with respect to a similarity measure in question.
  In this paper we present a novel genetic algorithm (GA)-based approach for
IR. Since GA performs effective search in various optimization problems, it
could prove useful also for IR. Indeed, various GAs have been proposed for IR.
However, most of them assume certain constraints, which simplify the
transformation model, restrict the search space or make additional
preprocessing requirements. In contrast, we present a generalized GA-based
solution for an almost fully affine transformation model, which achieves
competitive results without such limitations using a two-phase method and a
multi-objective optimization (MOO) approach.
  We present good results for multiple dataset and demonstrate the robustness
of our method in the presence of noisy data.
","[{'version': 'v1', 'created': 'Fri, 17 Nov 2017 23:15:19 GMT'}]",2017-11-21,"[['Chicotay', 'Sarit', ''], ['David', 'Eli', ''], ['Netanyahu', 'Nathan S.', '']]","['Computer Vision', 'Genetic Algorithms', 'Image Registration', 'MultiObjective Optimization', 'Normalized Cross Correlation']"
3353,1212.4375,Christoph Hofer-Temmel,Bernhard C. Geiger and Christoph Temmel,"Lumpings of Markov chains, entropy rate preservation, and higher-order
  lumpability",,,10.1239/jap/1421763331,,cs.IT math.IT math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A lumping of a Markov chain is a coordinate-wise projection of the chain. We
characterise the entropy rate preservation of a lumping of an aperiodic and
irreducible Markov chain on a finite state space by the random growth rate of
the cardinality of the realisable preimage of a finite-length trajectory of the
lumped chain and by the information needed to reconstruct original trajectories
from their lumped images. Both are purely combinatorial criteria, depending
only on the transition graph of the Markov chain and the lumping function. A
lumping is strongly k-lumpable, iff the lumped process is a k-th order Markov
chain for each starting distribution of the original Markov chain. We
characterise strong k-lumpability via tightness of stationary entropic bounds.
In the sparse setting, we give sufficient conditions on the lumping to both
preserve the entropy rate and be strongly k-lumpable.
","[{'version': 'v1', 'created': 'Tue, 18 Dec 2012 15:03:09 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Jan 2013 13:29:02 GMT'}, {'version': 'v3', 'created': 'Tue, 30 Jul 2013 12:22:03 GMT'}, {'version': 'v4', 'created': 'Wed, 9 Oct 2013 13:18:52 GMT'}, {'version': 'v5', 'created': 'Thu, 26 Feb 2015 15:01:12 GMT'}, {'version': 'v6', 'created': 'Mon, 20 Apr 2015 16:01:36 GMT'}]",2015-04-21,"[['Geiger', 'Bernhard C.', ''], ['Temmel', 'Christoph', '']]","['lumping', 'entropy rate loss', 'functional hidden Markov model', 'stronglumpability', 'higher order Markov chain']"
3354,2005.13876,Christian Otto,"Jianwei Shi, Christian Otto, Anett Hoppe, Peter Holtz, Ralph Ewerth","Investigating Correlations of Automatically Extracted Multimodal
  Features and Lecture Video Quality",,"SALMM '19: Proceedings of the 1st International Workshop on Search
  as Learning with Multimedia Information, co-located with ACM Multimedia 2019",10.1145/3347451.3356731,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ranking and recommendation of multimedia content such as videos is usually
realized with respect to the relevance to a user query. However, for lecture
videos and MOOCs (Massive Open Online Courses) it is not only required to
retrieve relevant videos, but particularly to find lecture videos of high
quality that facilitate learning, for instance, independent of the video's or
speaker's popularity. Thus, metadata about a lecture video's quality are
crucial features for learning contexts, e.g., lecture video recommendation in
search as learning scenarios. In this paper, we investigate whether
automatically extracted features are correlated to quality aspects of a video.
A set of scholarly videos from a Mass Open Online Course (MOOC) is analyzed
regarding audio, linguistic, and visual features. Furthermore, a set of
cross-modal features is proposed which are derived by combining transcripts,
audio, video, and slide content. A user study is conducted to investigate the
correlations between the automatically collected features and human ratings of
quality aspects of a lecture video. Finally, the impact of our features on the
knowledge gain of the participants is discussed.
","[{'version': 'v1', 'created': 'Thu, 28 May 2020 09:46:53 GMT'}]",2020-05-29,"[['Shi', 'Jianwei', ''], ['Otto', 'Christian', ''], ['Hoppe', 'Anett', ''], ['Holtz', 'Peter', ''], ['Ewerth', 'Ralph', '']]","['multimodal', 'video assessment', 'correlation', 'knowledge gain']"
3355,1304.3177,S\'ergio Medeiros,Fabio Mascarenhas and S\'ergio Medeiros and Roberto Ierusalimschy,"On the Relation between Context-Free Grammars and Parsing Expression
  Grammars",,,10.1016/j.scico.2014.01.012,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context-Free Grammars (CFGs) and Parsing Expression Grammars (PEGs) have
several similarities and a few differences in both their syntax and semantics,
but they are usually presented through formalisms that hinder a proper
comparison. In this paper we present a new formalism for CFGs that highlights
the similarities and differences between them. The new formalism borrows from
PEGs the use of parsing expressions and the recognition-based semantics. We
show how one way of removing non-determinism from this formalism yields a
formalism with the semantics of PEGs. We also prove, based on these new
formalisms, how LL(1) grammars define the same language whether interpreted as
CFGs or as PEGs, and also show how strong-LL(k), right-linear, and LL-regular
grammars have simple language-preserving translations from CFGs to PEGs.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2013 01:50:16 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Feb 2014 22:46:27 GMT'}]",2014-02-17,"[['Mascarenhas', 'Fabio', ''], ['Medeiros', 'Sérgio', ''], ['Ierusalimschy', 'Roberto', '']]","['Context-free grammars', 'parsing expression grammars', 'parsing', 'LL(1)', 'LL(k)', 'LL-regular', 'right-linear grammars', 'natural semantics']"
3356,1803.06253,Diego Marcos,"Diego Marcos, Michele Volpi, Benjamin Kellenberger and Devis Tuia","Land cover mapping at very high resolution with rotation equivariant
  CNNs: towards small yet accurate models",,"ISPRS Journal of Photogrammetry and Remote Sensing, 2018",10.1016/j.isprsjprs.2018.01.021,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In remote sensing images, the absolute orientation of objects is arbitrary.
Depending on an object's orientation and on a sensor's flight path, objects of
the same semantic class can be observed in different orientations in the same
image. Equivariance to rotation, in this context understood as responding with
a rotated semantic label map when subject to a rotation of the input image, is
therefore a very desirable feature, in particular for high capacity models,
such as Convolutional Neural Networks (CNNs). If rotation equivariance is
encoded in the network, the model is confronted with a simpler task and does
not need to learn specific (and redundant) weights to address rotated versions
of the same object class. In this work we propose a CNN architecture called
Rotation Equivariant Vector Field Network (RotEqNet) to encode rotation
equivariance in the network itself. By using rotating convolutions as building
blocks and passing only the the values corresponding to the maximally
activating orientation throughout the network in the form of orientation
encoding vector fields, RotEqNet treats rotated versions of the same object
with the same filter bank and therefore achieves state-of-the-art performances
even when using very small architectures trained from scratch. We test RotEqNet
in two challenging sub-decimeter resolution semantic labeling problems, and
show that we can perform better than a standard CNN while requiring one order
of magnitude less parameters.
","[{'version': 'v1', 'created': 'Fri, 16 Mar 2018 14:48:58 GMT'}]",2018-03-19,"[['Marcos', 'Diego', ''], ['Volpi', 'Michele', ''], ['Kellenberger', 'Benjamin', ''], ['Tuia', 'Devis', '']]","['Semantic labeling', 'Deep learning', 'Rotation invariance', 'Sub-decimeter resolution']"
3357,1309.2208,Md. Amir Khusru  Akhtar Prof.,Md. Amir Khusru Akhtar and G. Sahoo,"A Novel Methodology to Overcome Routing Misbehavior in MANET using
  Retaliation Model","16 pages, 6 figures, 3 tables","International Journal of Wireless & Mobile Networks (IJWMN) Vol.
  5, No. 4, August 2013",10.5121/ijwmn.2013.5414,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  MANET is a cooperative network in which nodes are responsible for forwarding
as well as routing. Noncooperation is still a big challenge that certainly
degrades the performance and reliability of a MANET. This paper presents a
novel methodology to overcome routing misbehavior in MANET using Retaliation
Model. In this model node misbehavior is watched and an equivalent misbehavior
is given in return. This model employs several parameters such as number of
packets forwarded, number of packets received for forwarding, packet forwarding
ratio etc. to calculate Grade and Bonus Points. The Grade is used to isolate
selfish nodes from the routing paths and the Bonus Points defines the number of
packets dropped by an honest node in retaliation over its misconducts. The
implementation is done in ""GloMoSim"" on top of the DSR protocol. We obtained up
to 40% packet delivery ratio with a cost of a minimum of 7.5% overhead compared
to DSR. To minimize total control traffic overhead we have included the FG
Model with our model and it reduces the overhead up to 75%. This model enforces
cooperation due to its stricter punishment strategy and justifies its name.
","[{'version': 'v1', 'created': 'Mon, 9 Sep 2013 16:18:06 GMT'}]",2013-09-10,"[['Akhtar', 'Md. Amir Khusru', ''], ['Sahoo', 'G.', '']]","['Retaliation', 'Grade', 'Bonus Points', 'Neighbor', 'Cooperation']"
3358,1311.3632,EPTCS,"Alessandro Mignogna (ALES S.r.l.), Leonardo Mangeruca (ALES S.r.l.),
  Beno\^it Boyer (INRIA), Axel Legay (INRIA), Alexandre Arnold (EADS)",SoS contract verification using statistical model checking,"In Proceedings AiSoS 2013, arXiv:1311.3195","EPTCS 133, 2013, pp. 67-83",10.4204/EPTCS.133.7,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Exhaustive formal verification for systems of systems (SoS) is impractical
and cannot be applied on a large scale. In this paper we propose to use
statistical model checking for efficient verification of SoS. We address three
relevant aspects for systems of systems: 1) the model of the SoS, which
includes stochastic aspects; 2) the formalization of the SoS requirements in
the form of contracts; 3) the tool-chain to support statistical model checking
for SoS. We adapt the SMC technique for application to heterogeneous SoS. We
extend the UPDM/SysML specification language to express the SoS requirements
that the implemented strategies over the SoS must satisfy. The requirements are
specified with a new contract language specifically designed for SoS, targeting
a high-level English- pattern language, but relying on an accurate semantics
given by the standard temporal logics. The contracts are verified against the
UPDM/SysML specification using the Statistical Model Checker (SMC) PLASMA
combined with the simulation engine DESYRE, which integrates heterogeneous
behavioral models through the functional mock-up interface (FMI) standard. The
tool-chain allows computing an estimation of the satisfiability of the
contracts by the SoS. The results help the system architect to trade-off
different solutions to guide the evolution of the SoS.
","[{'version': 'v1', 'created': 'Thu, 14 Nov 2013 19:41:25 GMT'}]",2013-11-15,"[['Mignogna', 'Alessandro', '', 'ALES S.r.l.'], ['Mangeruca', 'Leonardo', '', 'ALES S.r.l.'], ['Boyer', 'Benoît', '', 'INRIA'], ['Legay', 'Axel', '', 'INRIA'], ['Arnold', 'Alexandre', '', 'EADS']]","['Systems of systems', 'verification', 'statistical model checking', 'UPDM', 'SysML', 'simulation']"
3359,1106.2686,Praveen Srivastava Mr,"Praveen Ranjan Srivastava, Km Baby","Automated Software Testing Using Metahurestic Technique Based on An Ant
  Colony Optimization","Electronic System Design (ISED), 2010 International Symposium on
  Issue Date: 20-22 Dec. 2010 On page(s): 235 - 240 Location: Bhubaneswar Print
  ISBN: 978-1-4244-8979-4 INSPEC Accession Number: 11835766 Digital Object
  Identifier: 10.1109/ISED.2010.52",,10.1109/ISED.2010.52,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software testing is an important and valuable part of the software
development life cycle. Due to time, cost and other circumstances, exhaustive
testing is not feasible that's why there is a need to automate the software
testing process. Testing effectiveness can be achieved by the State Transition
Testing (STT) which is commonly used in real time, embedded and web-based type
of software systems. Aim of the current paper is to present an algorithm by
applying an ant colony optimization technique, for generation of optimal and
minimal test sequences for behavior specification of software. Present paper
approach generates test sequence in order to obtain the complete software
coverage. This paper also discusses the comparison between two metaheuristic
techniques (Genetic Algorithm and Ant Colony optimization) for transition based
testing
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2011 12:17:44 GMT'}]",2011-06-15,"[['Srivastava', 'Praveen Ranjan', ''], ['Baby', 'Km', '']]","['Software Testing', 'Ant Colony Optimization (ACO)', 'Genetic Algorithm (GA)', 'State Transition Testing (STT)', 'Test Data']"
3360,1412.8266,Jonathan Passerat-Palmbach,"Jonathan Passerat-Palmbach (ISIMA, UBP, LIMOS), David Hill (LIMOS,
  UBP, ISIMA)","How to Correctly Deal With Pseudorandom Numbers in Manycore Environments
  - Application to GPU programming with Shoverand",,"IEEE High Performance Computing and Simulation conference 2012,
  Jul 2012, Madrid, Spain. pp.25 - 31",10.1109/HPCSim.2012.6266887,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stochastic simulations are often sensitive to the source of randomness that
character-izes the statistical quality of their results. Consequently, we need
highly reliable Random Number Generators (RNGs) to feed such applications.
Recent developments try to shrink the computa-tion time by relying more and
more General Purpose Graphics Processing Units (GP-GPUs) to speed-up stochastic
simulations. Such devices bring new parallelization possibilities, but they
also introduce new programming difficulties. Since RNGs are at the base of any
stochastic simulation, they also need to be ported to GP-GPU. There is still a
lack of well-designed implementations of quality-proven RNGs on GP-GPU
platforms. In this paper, we introduce ShoveRand, a frame-work defining common
rules to generate random numbers uniformly on GP-GPU. Our framework is designed
to cope with any GPU-enabled development platform and to expose a
straightfor-ward interface to users. We also provide an existing RNG
implementation with this framework to demonstrate its efficiency in both
development and ease of use.
","[{'version': 'v1', 'created': 'Mon, 29 Dec 2014 06:35:00 GMT'}]",2014-12-30,"[['Passerat-Palmbach', 'Jonathan', '', 'ISIMA, UBP, LIMOS'], ['Hill', 'David', '', 'LIMOS,\n  UBP, ISIMA']]","['pseudorandom numbers', 'manycore', 'GP-GPU', 'High Performance Computing', 'Shoverand', 'stochastic simulation']"
3361,1608.00302,Beishui Liao,Beishui Liao and Kang Xu and Huaxin Huang,"Formulating Semantics of Probabilistic Argumentation by Characterizing
  Subgraphs: Theory and Empirical Results","First version submitted to JLC on Feb 12, 2016. This is the final
  version, accepted by JLC on Nov 28, 2016",,10.1093/logcom/exx035,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In existing literature, while approximate approaches based on Monte-Carlo
simulation technique have been proposed to compute the semantics of
probabilistic argumentation, how to improve the efficiency of computation
without using simulation technique is still an open problem. In this paper, we
address this problem from the following two perspectives. First, conceptually,
we define specific properties to characterize the subgraphs of a PrAG with
respect to a given extension, such that the probability of a set of arguments E
being an extension can be defined in terms of these properties, without (or
with less) construction of subgraphs. Second, computationally, we take
preferred semantics as an example, and develop algorithms to evaluate the
efficiency of our approach. The results show that our approach not only
dramatically decreases the time for computing p(E^\sigma), but also has an
attractive property, which is contrary to that of existing approaches: the
denser the edges of a PrAG are or the bigger the size of a given extension E
is, the more efficient our approach computes p(E^\sigma). Meanwhile, it is
shown that under complete and preferred semantics, the problems of determining
p(E^\sigma) are fixed-parameter tractable.
","[{'version': 'v1', 'created': 'Mon, 1 Aug 2016 02:34:07 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Nov 2016 21:16:47 GMT'}]",2017-10-25,"[['Liao', 'Beishui', ''], ['Xu', 'Kang', ''], ['Huang', 'Huaxin', '']]","['Probabilistic Argumentation', 'Computational Complexity', 'Computational Efficiency', 'Characterized Subgraphs', 'Fixed-ParameterTractability']"
3362,1809.05888,Sanjay Sahay,"Mohit Sewak, Sanjay K. Sahay and Hemant Rathore",An investigation of a deep learning based malware detection system,"13 Pages, 4 figures","ACM, pp. 26, Proceedings of the 13th International Conference on
  Availability, Reliability and Security (ARES), 27-30 Aug., 2018, University
  of Hamburg, Germany",10.1145/3230833.3230835,,cs.CR cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate a Deep Learning based system for malware detection. In the
investigation, we experiment with different combination of Deep Learning
architectures including Auto-Encoders, and Deep Neural Networks with varying
layers over Malicia malware dataset on which earlier studies have obtained an
accuracy of (98%) with an acceptable False Positive Rates (1.07%). But these
results were done using extensive man-made custom domain features and investing
corresponding feature engineering and design efforts. In our proposed approach,
besides improving the previous best results (99.21% accuracy and a False
Positive Rate of 0.19%) indicates that Deep Learning based systems could
deliver an effective defense against malware. Since it is good in automatically
extracting higher conceptual features from the data, Deep Learning based
systems could provide an effective, general and scalable mechanism for
detection of existing and unknown malware.
","[{'version': 'v1', 'created': 'Sun, 16 Sep 2018 14:39:28 GMT'}]",2018-09-18,"[['Sewak', 'Mohit', ''], ['Sahay', 'Sanjay K.', ''], ['Rathore', 'Hemant', '']]","['Malware', 'Deep Learning', 'Machine Learning', 'Auto Encoders', 'Deep Neural Networks', 'Malicia', 'Cyber Security']"
3363,1809.00182,Mateusz Trokielewicz,Mateusz Trokielewicz and Adam Czajka and Piotr Maciejewicz,"Iris Recognition Under Biologically Troublesome Conditions - Effects of
  Aging, Diseases and Post-mortem Changes",Accepted manuscript version of the BIOSIGNALS 2017 paper,"Proceedings of the 10th International Joint Conference on
  Biomedical Engineering Systems and Technologies - Volume 4: BIOSIGNALS, pages
  253-258, 2017, Porto, Portugal",10.5220/0006251702530258,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the most comprehensive analysis of iris recognition
reliability in the occurrence of various biological processes happening
naturally and pathologically in the human body, including aging, illnesses, and
post-mortem changes to date. Insightful conclusions are offered in relation to
all three of these aspects. Extensive regression analysis of the template aging
phenomenon shows that differences in pupil dilation, combined with certain
quality factors of the sample image and the progression of time itself can
significantly degrade recognition accuracy. Impactful effects can also be
observed when iris recognition is employed with eyes affected by certain eye
pathologies or (even more) with eyes of the deceased subjects. Notably,
appropriate databases are delivered to the biometric community to stimulate
further research in these utterly important areas of iris biometrics studies.
Finally, some open questions are stated to inspire further discussions and
research on these important topics. To Authors' best knowledge, this is the
only scientific study of iris recognition reliability of such a broad scope and
novelty.
","[{'version': 'v1', 'created': 'Sat, 1 Sep 2018 13:51:07 GMT'}]",2018-09-05,"[['Trokielewicz', 'Mateusz', ''], ['Czajka', 'Adam', ''], ['Maciejewicz', 'Piotr', '']]","['biometrics', 'iris recognition', 'reliability', 'aging', 'ocular pathologies', 'post-mortem']"
3364,1902.08684,Dejan Lavbi\v{c},Marko Po\v{z}enel and Dejan Lavbi\v{c},Discovering Language of the Stocks,"15 pages, 2 figures, 5 tables","Frontiers in Artificial Intelligence and Applications - Databases
  and Information Systems X 315 2019",10.3233/978-1-61499-941-6-243,,cs.CE q-fin.ST,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stock prediction has always been attractive area for researchers and
investors since the financial gains can be substantial. However, stock
prediction can be a challenging task since stocks are influenced by a multitude
of factors whose influence vary rapidly through time. This paper proposes a
novel approach (Word2Vec) for stock trend prediction combining NLP and Japanese
candlesticks. First, we create a simple language of Japanese candlesticks from
the source OHLC data. Then, sentences of words are used to train the NLP
Word2Vec model where training data classification also takes into account
trading commissions. Finally, the model is used to predict trading actions. The
proposed approach was compared to three trading models Buy & Hold, MA and MACD
according to the yield achieved. We first evaluated Word2Vec on three shares of
Apple, Microsoft and Coca-Cola where it outperformed the comparative models.
Next we evaluated Word2Vec on stocks from Russell Top 50 Index where our
Word2Vec method was also very successful in test phase and only fall behind the
Buy & Hold method in validation phase. Word2Vec achieved positive results in
all scenarios while the average yields of MA and MACD were still lower compared
to Word2Vec.
","[{'version': 'v1', 'created': 'Wed, 13 Feb 2019 15:56:51 GMT'}]",2019-02-26,"[['Poženel', 'Marko', ''], ['Lavbič', 'Dejan', '']]","['Stock price prediction', 'Word2Vec', 'Japanese candlesticks', 'Trading strategy', 'NLP']"
3365,1903.09030,Juan Maro\~nas,"Juan Maro\~nas, Roberto Paredes, Daniel Ramos",Generative Models For Deep Learning with Very Scarce Data,,,10.1007/978-3-030-13469-3_3,,cs.LG stat.ML,http://creativecommons.org/publicdomain/zero/1.0/,"  The goal of this paper is to deal with a data scarcity scenario where deep
learning techniques use to fail. We compare the use of two well established
techniques, Restricted Boltzmann Machines and Variational Auto-encoders, as
generative models in order to increase the training set in a classification
framework. Essentially, we rely on Markov Chain Monte Carlo (MCMC) algorithms
for generating new samples. We show that generalization can be improved
comparing this methodology to other state-of-the-art techniques, e.g.
semi-supervised learning with ladder networks. Furthermore, we show that RBM is
better than VAE generating new samples for training a classifier with good
generalization capabilities.
","[{'version': 'v1', 'created': 'Thu, 21 Mar 2019 14:38:45 GMT'}]",2020-03-02,"[['Maroñas', 'Juan', ''], ['Paredes', 'Roberto', ''], ['Ramos', 'Daniel', '']]","['Data Scarcity', 'Generative Models', 'Data augmentation', 'Markov Chain Monte Carlo algorithms']"
3366,1811.12278,Torgeir Dings{\o}yr,"Finn Olav Bj{\o}rnson, Torgeir Dings{\o}yr","Knowledge Management in Software Engineering: A Systematic Review of
  Studied Concepts, Findings and Research Methods Used",Postprint of article,"Bj{\o}rnson, F. O., & Dings{\o}yr, T. (2008). Knowledge Management
  in Software Engineering: A Systematic Review of Studied Concepts and Research
  Methods Used. Information and Software Technology, 50(11), 1055-1168",10.1016/j.infsof.2008.03.006,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Software engineering is knowledge-intensive work, and how to manage software
engineering knowledge has received much attention. This systematic review
identifies empirical studies of knowledge management initiatives in software
engineering, and discusses the concepts studied, the major findings, and the
research methods used. Seven hundred and sixty-two articles were identified, of
which 68 were studies in an industry context. Of these, 29 were empirical
studies and 39 reports of lessons learned. More than half of the empirical
studies were case studies. The majority of empirical studies relate to
technocratic and behavioural aspects of knowledge management, while there are
few studies relating to economic, spatial and cartographic approaches. A
finding reported across multiple papers was the need to not focus exclusively
on explicit knowledge, but also consider tacit knowledge. We also describe
implications for research and for practice.
","[{'version': 'v1', 'created': 'Thu, 29 Nov 2018 16:12:27 GMT'}]",2018-11-30,"[['Bjørnson', 'Finn Olav', ''], ['Dingsøyr', 'Torgeir', '']]","['software engineering', 'knowledge management', 'learning software']"
3367,2007.14084,"Serhan G\""ul","Serhan G\""ul, Sebastian Bosse, Dimitri Podborski, Thomas Schierl,
  Cornelius Hellge",Kalman Filter-based Head Motion Prediction for Cloud-based Mixed Reality,"Accepted at the ACM Multimedia Conference (ACMMM) 2020. 9 pages, 9
  figures","Proceedings of the 28th ACM International Conference on Multimedia
  (2020) 3632-3641",10.1145/3394171.3413699,,cs.MM eess.IV eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Volumetric video allows viewers to experience highly-realistic 3D content
with six degrees of freedom in mixed reality (MR) environments. Rendering
complex volumetric videos can require a prohibitively high amount of
computational power for mobile devices. A promising technique to reduce the
computational burden on mobile devices is to perform the rendering at a cloud
server. However, cloud-based rendering systems suffer from an increased
interaction (motion-to-photon) latency that may cause registration errors in MR
environments. One way of reducing the effective latency is to predict the
viewer's head pose and render the corresponding view from the volumetric video
in advance. In this paper, we design a Kalman filter for head motion prediction
in our cloud-based volumetric video streaming system. We analyze the
performance of our approach using recorded head motion traces and compare its
performance to an autoregression model for different prediction intervals
(look-ahead times). Our results show that the Kalman filter can predict head
orientations 0.5 degrees more accurately than the autoregression model for a
look-ahead time of 60 ms.
","[{'version': 'v1', 'created': 'Tue, 28 Jul 2020 09:41:22 GMT'}]",2021-03-12,"[['Gül', 'Serhan', ''], ['Bosse', 'Sebastian', ''], ['Podborski', 'Dimitri', ''], ['Schierl', 'Thomas', ''], ['Hellge', 'Cornelius', '']]","['volumetric video', 'augmented reality', 'mixed reality', 'cloud-based rendering', 'head motion prediction', 'Kalman filter', 'time series analysis']"
3368,1612.09433,Cedric Buron,"C\'edric Buron (LIP6), Sylvain Ductor (LIP6), Zahia Guessoum (LIP6,
  CRESTIC)",Curiosity-Aware Bargaining,,"STAIRS 2016, Aug 2016, The Hague, Netherlands. IOS Press, 284, pp.
  27 -- 38, Frontiers in Artificial Intelligence and Applications",10.3233/978-1-61499-682-8-27,,cs.AI cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Opponent modeling consists in modeling the strategy or preferences of an
agent thanks to the data it provides. In the context of automated negotiation
and with machine learning, it can result in an advantage so overwhelming that
it may restrain some casual agents to be part of the bargaining process. We
qualify as ""curious"" an agent driven by the desire of negotiating in order to
collect information and improve its opponent model. However, neither
curiosity-based rational-ity nor curiosity-robust protocol have been studied in
automatic negotiation. In this paper, we rely on mechanism design to propose
three extensions of the standard bargaining protocol that limit information
leak. Those extensions are supported by an enhanced rationality model, that
considers the exchanged information. Also, they are theoretically analyzed and
experimentally evaluated.
","[{'version': 'v1', 'created': 'Fri, 30 Dec 2016 09:31:17 GMT'}]",2017-01-02,"[['Buron', 'Cédric', '', 'LIP6'], ['Ductor', 'Sylvain', '', 'LIP6'], ['Guessoum', 'Zahia', '', 'LIP6,\n  CRESTIC']]","['Automated Negotiation', 'Bargaining', 'Opponent Modeling', 'Rationality', 'Mechanism Design', 'Curiosity']"
3369,1008.1700,Murat Manguoglu,Murat Manguoglu,A domain decomposing parallel sparse linear system solver,To appear in Journal of Computational and Applied Mathematics,"Journal of Computational and Applied Mathematics, Volume 236,
  Issue 3, 2011, Pages 319-325",10.1016/j.cam.2011.07.017,,cs.NA cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The solution of large sparse linear systems is often the most time-consuming
part of many science and engineering applications. Computational fluid
dynamics, circuit simulation, power network analysis, and material science are
just a few examples of the application areas in which large sparse linear
systems need to be solved effectively. In this paper we introduce a new
parallel hybrid sparse linear system solver for distributed memory
architectures that contains both direct and iterative components. We show that
by using our solver one can alleviate the drawbacks of direct and iterative
solvers, achieving better scalability than with direct solvers and more
robustness than with classical preconditioned iterative solvers. Comparisons to
well-known direct and iterative solvers on a parallel architecture are
provided.
","[{'version': 'v1', 'created': 'Tue, 10 Aug 2010 12:14:09 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Aug 2011 14:00:10 GMT'}]",2011-09-20,"[['Manguoglu', 'Murat', '']]","['sparse linear systems', 'parallel solvers', 'direct solvers', 'iterativesolvers']"
3370,1310.2079,Faten Kharbat,Ajayeb Abu Dabbes and Faten Kharbat,"Mining The Relationship Between Demographic Variables And Brand
  Associations","10 pages, 2 tables, 1 figure, Journal paper","Abu Daabes, A. and Kharbat F., (2013), Mining the Relationship
  Between Demographic Variables and Brand Associations, The International
  Journal of Managing Value and Supply Chains, vol 4, no 3",10.5121/ijmvsc.2013.4301,,cs.CY cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This research aims to mine the relationship between demographic variables and
brand associations, and study the relative importance of these variables. The
study is conducted on fast-food restaurant brands chains in Jordan. The result
ranks and evaluates the demographic variables in relation with the brand
associations for the selected sample. Discovering brand associations according
to demographic variables reveals many facts and linkages in the context of
Jordanian culture. Suggestions are given accordingly for marketers to benefits
from to build their strategies and direct their decisions. Also, data mining
technique used in this study reflects a new trend for studying and analyzing
marketing samples.
","[{'version': 'v1', 'created': 'Tue, 8 Oct 2013 10:30:28 GMT'}]",2013-10-09,"[['Dabbes', 'Ajayeb Abu', ''], ['Kharbat', 'Faten', '']]","['Brand Associations', 'Branding', 'Service Marketing', 'Demographic Variables', 'X-Means Algorithm', 'Data Mining', 'Ranking', 'ReilefF']"
3371,1703.08803,Arnaud Blouin,"Val\'eria Lelli and Arnaud Blouin and Benoit Baudry and Fabien Coulon
  and Olivier Beaudoux",Automatic Detection of GUI Design Smells: The Case of Blob Listener,,"Proceedings of the 8th ACM SIGCHI Symposium on Engineering
  Interactive Computing Systems (EICS'16), pp.263-274, 2016",10.1145/2933242.2933260,,cs.SE cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graphical User Interfaces (GUIs) intensively rely on event-driven
programming: widgets send GUI events, which capture users' interactions, to
dedicated objects called controllers. Controllers implement several GUI
listeners that handle these events to produce GUI commands. In this work, we
conducted an empirical study on 13 large Java Swing open-source software
systems. We study to what extent the number of GUI commands that a GUI listener
can produce has an impact on the change-and fault-proneness of the GUI listener
code. We identify a new type of design smell, called Blob listener that
characterizes GUI listeners that can produce more than two GUI commands. We
show that 21 % of the analyzed GUI controllers are Blob listeners. We propose a
systematic static code analysis procedure that searches for Blob listener that
we implement in InspectorGuidget. We conducted experiments on six software
systems for which we manually identified 37 instances of Blob listener.
InspectorGuidget successfully detected 36 Blob listeners out of 37. The results
exhibit a precision of 97.37 % and a recall of 97.59 %. Finally, we propose
coding practices to avoid the use of Blob listeners.
","[{'version': 'v1', 'created': 'Sun, 26 Mar 2017 10:40:21 GMT'}]",2017-03-28,"[['Lelli', 'Valéria', ''], ['Blouin', 'Arnaud', ''], ['Baudry', 'Benoit', ''], ['Coulon', 'Fabien', ''], ['Beaudoux', 'Olivier', '']]","['User interface', 'design smell', 'software validation', 'code quality']"
3372,1611.05066,Patrick Wensing,Patrick M. Wensing and Jean-Jacques Slotine,Sparse Control for Dynamic Movement Primitives,"extended conference version. added new proofs in the appendix, a few
  remarks in the main body",,10.1016/j.ifacol.2017.08.1789,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the use of spatially-sparse inputs to influence global
changes in the behavior of Dynamic Movement Primitives (DMPs). The dynamics of
DMPs are analyzed through the framework of contraction theory as networked
hierarchies of contracting or transversely contracting systems. Within this
framework, sparsely-inhibited rhythmic DMPs (SI-RDMPs) are introduced to both
inhibit or enable rhythmic primitives through spatially-sparse modification of
the DMP dynamics. SI-RDMPs are demonstrated in experiments to manage start-stop
transitions for walking experiments with the MIT Cheetah. New analytical
results on the coupling of oscillators with diverse natural frequencies are
also discussed.
","[{'version': 'v1', 'created': 'Tue, 15 Nov 2016 21:34:48 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Dec 2016 22:52:05 GMT'}]",2021-05-12,"[['Wensing', 'Patrick M.', ''], ['Slotine', 'Jean-Jacques', '']]","['Dynamic movement primitives', 'central pattern generators', 'contraction analysis', 'nonlinear oscillators', 'legged locomotion', 'networked systems']"
3373,1311.5728,Sascha Kurz,"Maurice Koster, Sascha Kurz, Ines Lindner and Stefan Napel",The Prediction value,"26 pages, 2 tables",,10.1007/s00355-016-1012-x,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the prediction value (PV) as a measure of players' informational
importance in probabilistic TU games. The latter combine a standard TU game and
a probability distribution over the set of coalitions. Player $i$'s prediction
value equals the difference between the conditional expectations of $v(S)$ when
$i$ cooperates or not. We characterize the prediction value as a special member
of the class of (extended) values which satisfy anonymity, linearity and a
consistency property. Every $n$-player binomial semivalue coincides with the PV
for a particular family of probability distributions over coalitions. The PV
can thus be regarded as a power index in specific cases. Conversely, some
semivalues -- including the Banzhaf but not the Shapley value -- can be
interpreted in terms of informational importance.
","[{'version': 'v1', 'created': 'Fri, 22 Nov 2013 12:05:28 GMT'}]",2017-07-10,"[['Koster', 'Maurice', ''], ['Kurz', 'Sascha', ''], ['Lindner', 'Ines', ''], ['Napel', 'Stefan', '']]","['influence', 'voting games', 'cooperative games', 'Banzhaf value', 'Shapley value']"
3374,1806.01623,Manh Duong Phung,"V.T. Hoang, M.D. Phung, Q.P. Ha","Adaptive twisting sliding mode control for quadrotor unmanned aerial
  vehicles",2017 11th Asian Control Conference (ASCC),,10.1109/ASCC.2017.8287250,,cs.SY cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work addresses the problem of robust attitude control of quadcopters.
First, the mathematical model of the quadcopter is derived considering factors
such as nonlinearity, external disturbances, uncertain dynamics and strong
coupling. An adaptive twisting sliding mode control algorithm is then developed
with the objective of controlling the quadcopter to track desired attitudes
under various conditions. For this, the twisting sliding mode control law is
modified with a proposed gain adaptation scheme to improve the control
transient and tracking performance. Extensive simulation studies and
comparisons with experimental data have been carried out for a Solo quadcopter.
The results show that the proposed control scheme can achieve strong robustness
against disturbances while is adaptable to parametric variations.
","[{'version': 'v1', 'created': 'Tue, 5 Jun 2018 12:07:46 GMT'}]",2018-06-06,"[['Hoang', 'V. T.', ''], ['Phung', 'M. D.', ''], ['Ha', 'Q. P.', '']]","['Quadcopter', 'attitude control', 'adaptive twisting sliding mode control']"
3375,1612.01586,Yongxing Wang,"Yongxing Wang, Peter Jimack, Mark Walkley","A One-Field Monolithic Fictitious Domain Method for Fluid-Structure
  Interactions",arXiv admin note: substantial text overlap with arXiv:1608.04998,,10.1016/j.cma.2017.01.023,,cs.CE physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, we present a one-field monolithic fictitious domain (FD)
method for simulation of general fluid-structure interactions (FSI). One-field
means only one velocity field is solved in the whole domain, based upon the use
of an appropriate L2 projection. Monolithic means the fluid and solid equations
are solved synchronously (rather than sequentially). We argue that the proposed
method has the same generality and robustness as FD methods with distributed
Lagrange multiplier (DLM) but is significantly more computationally efficient
(because of one-field) whilst being very straightforward to implement. The
method is described in detail, followed by the presentation of multiple
computational examples in order to validate it across a wide range of fluid and
solid parameters and interactions.
","[{'version': 'v1', 'created': 'Mon, 5 Dec 2016 23:19:53 GMT'}]",2017-04-05,"[['Wang', 'Yongxing', ''], ['Jimack', 'Peter', ''], ['Walkley', 'Mark', '']]","['Fluid-Structure interaction', 'Finite element', 'Fictitious domain', 'Monolithic method', 'One-field fictitious domain method']"
3376,1307.7102,Dr. Nadeem Javaid,"Q. Nadeem, N. Javaid, S. N. Mohammad, M. Y. Khan, S. Sarfraz, M. Gull","SIMPLE: Stable Increased-throughput Multi-hop Protocol for Link
  Efficiency in Wireless Body Area Networks","IEEE 8th International Conference on Broadband and Wireless
  Computing, Communication and Applications (BWCCA'13), Compiegne, France",,10.1109/BWCCA.2013.42,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we propose a reliable, power efficient and high throughput
routing protocol for Wireless Body Area Networks (WBANs). We use multi-hop
topology to achieve minimum energy consumption and longer network lifetime. We
propose a cost function to select parent node or forwarder. Proposed cost
function selects a parent node which has high residual energy and minimum
distance to sink. Residual energy parameter balances the energy consumption
among the sensor nodes while distance parameter ensures successful packet
delivery to sink. Simulation results show that our proposed protocol maximize
the network stability period and nodes stay alive for longer period. Longer
stability period contributes high packet delivery to sink which is major
interest for continuous patient monitoring.
","[{'version': 'v1', 'created': 'Fri, 26 Jul 2013 17:18:11 GMT'}]",2016-11-15,"[['Nadeem', 'Q.', ''], ['Javaid', 'N.', ''], ['Mohammad', 'S. N.', ''], ['Khan', 'M. Y.', ''], ['Sarfraz', 'S.', ''], ['Gull', 'M.', '']]","['Wireless body Area Network', 'Cost Function', 'Residual Energy']"
3377,1705.03233,Adamantios Ntakaris Mr,"Adamantios Ntakaris, Martin Magris, Juho Kanniainen, Moncef Gabbouj,
  Alexandros Iosifidis","Benchmark Dataset for Mid-Price Forecasting of Limit Order Book Data
  with Machine Learning Methods",Published: Journal of Forecasting,,10.1002/for.2543,,cs.CE q-fin.TR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Managing the prediction of metrics in high-frequency financial markets is a
challenging task. An efficient way is by monitoring the dynamics of a limit
order book to identify the information edge. This paper describes the first
publicly available benchmark dataset of high-frequency limit order markets for
mid-price prediction. We extracted normalized data representations of time
series data for five stocks from the NASDAQ Nordic stock market for a time
period of ten consecutive days, leading to a dataset of ~4,000,000 time series
samples in total. A day-based anchored cross-validation experimental protocol
is also provided that can be used as a benchmark for comparing the performance
of state-of-the-art methodologies. Performance of baseline approaches are also
provided to facilitate experimental comparisons. We expect that such a
large-scale dataset can serve as a testbed for devising novel solutions of
expert systems for high-frequency limit order book data analysis.
","[{'version': 'v1', 'created': 'Tue, 9 May 2017 08:56:06 GMT'}, {'version': 'v2', 'created': 'Mon, 22 May 2017 13:26:57 GMT'}, {'version': 'v3', 'created': 'Tue, 30 May 2017 18:24:20 GMT'}, {'version': 'v4', 'created': 'Thu, 23 Aug 2018 20:46:23 GMT'}, {'version': 'v5', 'created': 'Wed, 11 Mar 2020 16:38:56 GMT'}]",2020-03-12,"[['Ntakaris', 'Adamantios', ''], ['Magris', 'Martin', ''], ['Kanniainen', 'Juho', ''], ['Gabbouj', 'Moncef', ''], ['Iosifidis', 'Alexandros', '']]","['high-frequency trading', 'limit order book', 'mid-price', 'machinelearning', 'ridge regression', 'single hidden feedforward neural network']"
3378,1711.04556,Libor Bukata,"Libor Bukata, Premysl Sucha, Zdenek Hanzalek","Solving the Resource Constrained Project Scheduling Problem Using the
  Parallel Tabu Search Designed for the CUDA Platform",Published in Journal of Parallel and Distributed Computing,"Journal of Parallel and Distributed Computing, 77 (2015), 58-68",10.1016/j.jpdc.2014.11.005,,cs.DC cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the paper, a parallel Tabu Search algorithm for the Resource Constrained
Project Scheduling Problem is proposed. To deal with this NP-hard combinatorial
problem many optimizations have been performed. For example, a resource
evaluation algorithm is selected by a heuristic and an effective Tabu List was
designed. In addition to that, a capacity-indexed resource evaluation algorithm
was proposed and the GPU (Graphics Processing Unit) version uses a homogeneous
model to reduce the required communication bandwidth. According to the
experiments, the GPU version outperforms the optimized parallel CPU version
with respect to the computational time and the quality of solutions. In
comparison with other existing heuristics, the proposed solution often gives
better quality solutions.
","[{'version': 'v1', 'created': 'Mon, 13 Nov 2017 12:52:49 GMT'}]",2017-11-15,"[['Bukata', 'Libor', ''], ['Sucha', 'Premysl', ''], ['Hanzalek', 'Zdenek', '']]","['Resource Constrained Project Scheduling Problem', 'Parallel Tabu Search', 'CUDA', 'homogeneous model', 'GPU']"
3379,1902.07831,Yilun Zhou,"Yilun Zhou, Steven Schockaert, Julie A. Shah","Predicting ConceptNet Path Quality Using Crowdsourced Assessments of
  Naturalness",In Proceedings of the Web Conference (WWW) 2019,,10.1145/3308558.3313486,,cs.CL cs.AI,http://creativecommons.org/licenses/by/4.0/,"  In many applications, it is important to characterize the way in which two
concepts are semantically related. Knowledge graphs such as ConceptNet provide
a rich source of information for such characterizations by encoding relations
between concepts as edges in a graph. When two concepts are not directly
connected by an edge, their relationship can still be described in terms of the
paths that connect them. Unfortunately, many of these paths are uninformative
and noisy, which means that the success of applications that use such path
features crucially relies on their ability to select high-quality paths. In
existing applications, this path selection process is based on relatively
simple heuristics. In this paper we instead propose to learn to predict path
quality from crowdsourced human assessments. Since we are interested in a
generic task-independent notion of quality, we simply ask human participants to
rank paths according to their subjective assessment of the paths' naturalness,
without attempting to define naturalness or steering the participants towards
particular indicators of quality. We show that a neural network model trained
on these assessments is able to predict human judgments on unseen paths with
near optimal performance. Most notably, we find that the resulting path
selection method is substantially better than the current heuristic approaches
at identifying meaningful paths.
","[{'version': 'v1', 'created': 'Thu, 21 Feb 2019 01:12:07 GMT'}]",2019-02-27,"[['Zhou', 'Yilun', ''], ['Schockaert', 'Steven', ''], ['Shah', 'Julie A.', '']]","['Crowdsourcing', 'Knowledge Graph', 'Feature Selection', 'Commonsense Knowledge', 'ConceptNet']"
3380,1008.1848,Kamaljit  I Lakhtaria,Kamaljit I. Lakhtaria,Enhancing QOS and QOE in IMS enabled next generation networks,,,10.5121/jgraphoc.2010.2206,"International journal on applications of graph theory in wireless ad
  hoc networks and sensor networks (GRAPH-HOC) Vol.2, No.2, June 2010",cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Managing network complexity, accommodating greater numbers of subscribers,
improving coverage to support data services (e.g. email, video, and music
downloads), keeping up to speed with fast-changing technology, and driving
maximum value from existing networks - all while reducing CapEX and OpEX and
ensuring Quality of Service (QoS) for the network and Quality of Experience
(QoE) for the user. These are just some of the pressing business issues faced
by mobileservice providers, summarized by the demand to ""achieve more, for
less."" The ultimate goal of optimization techniques at the network and
application layer is to ensure End-user perceived QoS. The next generation
networks (NGN), a composite environment of proven telecommunications and
Internet-oriented mechanisms have become generally recognized as the
telecommunications environment of the future. However, the nature of the NGN
environment presents several complex issues regarding quality assurance that
have not existed in the legacy environments (e.g., multi-network, multi-vendor,
and multi-operator IP-based telecommunications environment, distributed
intelligence, third-party provisioning, fixed-wireless and mobile access,
etc.). In this Research Paper, a service aware policy-based approach to NGN
quality assurance is presented, taking into account both perceptual quality of
experience and technologydependant quality of service issues. The respective
procedures, entities, mechanisms, and profiles are discussed. The purpose of
the presented approach is in research, development, and discussion of pursuing
the end-to-end controllability of the quality of the multimedia NGN-based
communications in an environment that is best effort in its nature and promotes
end user's access agnosticism, service agility, and global mobility.
","[{'version': 'v1', 'created': 'Wed, 11 Aug 2010 07:47:27 GMT'}]",2010-08-12,"[['Lakhtaria', 'Kamaljit I.', '']]","['NGN', 'IMS', 'VAS', 'QoS', 'QoE']"
3381,1209.2659,Leticia Davila-Nicanor,"Leticia D\'avila-Nicanor, Pedro Mej\'ia-Alvarez",Reliability improvement with PSP of Web-based software application,"17 pages, 7 figures,IEEE Fourth International Conference on Quality
  Software QSIC 04","Computer Science & Engineering: An International Journal
  (CSEIJ),Vol.2, No.4, 2012, 9-25",10.5121/cseij.2012.2402,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In diverse industrial and academic environments, the quality of the software
has been evaluated using different analytic studies. The contribution of the
present work is focused on the development of a methodology in order to improve
the evaluation and analysis of the reliability of web-based software
applications. The Personal Software Process (PSP) was introduced in our
methodology for improving the quality of the process and the product. The
Evaluation + Improvement (Ei) process is performed in our methodology to
evaluate and improve the quality of the software system. We tested our
methodology in a web-based software system and used statistical modeling theory
for the analysis and evaluation of the reliability. The behavior of the system
under ideal conditions was evaluated and compared against the operation of the
system executing under real conditions. The results obtained demonstrated the
effectiveness and applicability of our methodology.
","[{'version': 'v1', 'created': 'Wed, 12 Sep 2012 16:45:20 GMT'}]",2012-09-13,"[['Dávila-Nicanor', 'Leticia', ''], ['Mejía-Alvarez', 'Pedro', '']]","['Reliability Models', 'Web Applications', 'Improvement', 'PSP']"
3382,1108.1351,Raied Salman Dr,"Raied Salman, Vojislav Kecman, Qi Li, Robert Strack and Erik Test",Fast k-means algorithm clustering,"16 pages, Wimo2011; International Journal of Computer Networks &
  Communications (IJCNC) Vol.3, No.4, July 2011",,10.5121/ijcnc.2011.3402,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  k-means has recently been recognized as one of the best algorithms for
clustering unsupervised data. Since k-means depends mainly on distance
calculation between all data points and the centers, the time cost will be high
when the size of the dataset is large (for example more than 500millions of
points). We propose a two stage algorithm to reduce the time cost of distance
calculation for huge datasets. The first stage is a fast distance calculation
using only a small portion of the data to produce the best possible location of
the centers. The second stage is a slow distance calculation in which the
initial centers used are taken from the first stage. The fast and slow stages
represent the speed of the movement of the centers. In the slow stage, the
whole dataset can be used to get the exact location of the centers. The time
cost of the distance calculation for the fast stage is very low due to the
small size of the training data chosen. The time cost of the distance
calculation for the slow stage is also minimized due to small number of
iterations. Different initial locations of the clusters have been used during
the test of the proposed algorithms. For large datasets, experiments show that
the 2-stage clustering method achieves better speed-up (1-9 times).
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2011 15:37:23 GMT'}]",2011-08-08,"[['Salman', 'Raied', ''], ['Kecman', 'Vojislav', ''], ['Li', 'Qi', ''], ['Strack', 'Robert', ''], ['Test', 'Erik', '']]","['Data Mining', 'Clustering', 'k-means algorithm', 'Distance Calculation']"
3383,1907.11819,Thiago Santos,"Thiago T. Santos, Leonardo L. de Souza, Andreza A. dos Santos and
  Sandra Avila","Grape detection, segmentation and tracking using deep neural networks
  and three-dimensional association",,"Computers and Electronics in Agriculture, 170, 105-247 (2020)",10.1016/J.COMPAG.2020.105247,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Agricultural applications such as yield prediction, precision agriculture and
automated harvesting need systems able to infer the crop state from low-cost
sensing devices. Proximal sensing using affordable cameras combined with
computer vision has seen a promising alternative, strengthened after the advent
of convolutional neural networks (CNNs) as an alternative for challenging
pattern recognition problems in natural images. Considering fruit growing
monitoring and automation, a fundamental problem is the detection, segmentation
and counting of individual fruits in orchards. Here we show that for wine
grapes, a crop presenting large variability in shape, color, size and
compactness, grape clusters can be successfully detected, segmented and tracked
using state-of-the-art CNNs. In a test set containing 408 grape clusters from
images taken on a trellis-system based vineyard, we have reached an F 1 -score
up to 0.91 for instance segmentation, a fine separation of each cluster from
other structures in the image that allows a more accurate assessment of fruit
size and shape. We have also shown as clusters can be identified and tracked
along video sequences recording orchard rows. We also present a public dataset
containing grape clusters properly annotated in 300 images and a novel
annotation methodology for segmentation of complex objects in natural images.
The presented pipeline for annotation, training, evaluation and tracking of
agricultural patterns in images can be replicated for different crops and
production systems. It can be employed in the development of sensing components
for several agricultural and environmental applications.
","[{'version': 'v1', 'created': 'Fri, 26 Jul 2019 23:45:51 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Aug 2019 20:47:46 GMT'}, {'version': 'v3', 'created': 'Fri, 7 Feb 2020 11:36:18 GMT'}]",2020-02-10,"[['Santos', 'Thiago T.', ''], ['de Souza', 'Leonardo L.', ''], ['Santos', 'Andreza A. dos', ''], ['Avila', 'Sandra', '']]","['fruit detection', 'yield prediction', 'computer vision', 'deep learning']"
3384,1405.3557,Iaakov Exman,"Iaakov Exman, Gilad Amar and Ran Shaltiel",The Interestingness Tool for Search in the Web,"13 pages, 6 figures, 4 tables, 3rd SKY'2012 International Workshop on
  Software Knowledge, Barcelona, Spain, October 2012, SciTePress, Portugal",,10.5220/0004178900540063,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interestingness,as the composition of Relevance and Unexpectedness, has been
tested by means of Web search cases studies and led to promising results. But
for thorough investigation and routine practical application one needs a
flexible and robust tool. This work describes such an Interestingness based
search tool, its software architecture and actual implementation. One of its
flexibility traits is the choice of Interestingness functions: it may work with
Match-Mismatch and Tf-Idf, among other functions. The tool has been
experimentally verified by application to various domains of interest. It has
been validated by comparison of results with those of commercial search engines
and results from differing Interestingness functions.
","[{'version': 'v1', 'created': 'Wed, 14 May 2014 16:03:14 GMT'}]",2014-05-15,"[['Exman', 'Iaakov', ''], ['Amar', 'Gilad', ''], ['Shaltiel', 'Ran', '']]","['Interestingness', 'Relevance', 'Unexpectedness', 'Web Search', 'MatchMismatch', 'Tf-Idf', 'Interestingness Tool']"
3385,1505.01902,Waldemar Koczkodaj Prof.,"S. Bozoki, J. Fulop, W.W. Koczkodaj",An LP-based inconsistency monitoring of pairwise comparison matrices,,"Mathematical and Computer Modelling, v.54(1-2),789-793, 2011",10.1016/j.mcm.2011.03.026,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A distance-based inconsistency indicator, defined by the third author for the
consistency-driven pairwise comparisons method, is extended to the incomplete
case. The corresponding optimization problem is transformed into an equivalent
linear programming problem. The results can be applied in the process of
filling in the matrix as the decision maker gets automatic feedback. As soon as
a serious error occurs among the matrix elements, even due to a misprint, a
significant increase in the inconsistency index is reported. The high
inconsistency may be alarmed not only at the end of the process of filling in
the matrix but also during the completion process. Numerical examples are also
provided.
","[{'version': 'v1', 'created': 'Fri, 8 May 2015 01:25:57 GMT'}]",2015-05-11,"[['Bozoki', 'S.', ''], ['Fulop', 'J.', ''], ['Koczkodaj', 'W. W.', '']]","['linear programming', 'incomplete data', 'inconsistency analysis', 'pairwise comparisons']"
3386,1207.2606,Neji Hasni,Neji Hasni and Ridha Bouallegue,Ontology for Mobile Phone Operating Systems,"13 pages, 14 figures","International Journal of Wireless & Mobile Networks (IJWMN) Vol.
  4, No. 3, June 2012",10.5121/ijwmn.2012.4311,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This ongoing study deals with an important part of a line of research that
constitutes a challenging burden. It is an initial investigation into the
development of a Holistic Framework for Cellular Communication (HFCC). The main
purpose is to establish mechanisms by which existing wireless cellular
communication components and models can work holistically together. It
demonstrates that establishing a mathematical framework that allows existing
cellular communication technologies (and tools supporting those technologies)
to seamlessly interact is technically feasible. The longer-term future goals
are to actually improve the interoperability, the efficiency of mobile
communication, calls quality, and reliability by applying the framework to
specific development efforts.
","[{'version': 'v1', 'created': 'Wed, 11 Jul 2012 12:06:32 GMT'}]",2012-07-12,"[['Hasni', 'Neji', ''], ['Bouallegue', 'Ridha', '']]","['Interoperability', 'Ontology', 'Feature modeling', 'HFCC', 'OWL']"
3387,1802.06180,Bilal Farooq,"Bilal Farooq, Elisabetta Cherchi, Anae Sobhani","Virtual Immersive Reality for Stated Preference Travel Behaviour
  Experiments: A Case Study of Autonomous Vehicles on Urban Roads",Accepted in Journal of Transportation Research Record on 16-02-2016,,10.1177/0361198118776810,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stated preference experiments have been known to suffer from the lack of
realism. This issue is particularly visible when the scenario doesn't have a
well understood prior reference e.g. in case of the autonomous vehicles related
scenarios. We present Virtual Immersive Reality Environment (VIRE) that is
capable of developing highly realistic, immersive, and interactive choice
scenario. We demonstrate the use of VIRE in the pedestrian preferences related
to autonomous vehicles and associated infrastructure changes on urban streets
of Montr\'eal. The results are compared with predominantly used approaches i.e.
text-only and visual aid. We show that VIRE results in better understanding of
the scenario and consistent results.
","[{'version': 'v1', 'created': 'Sat, 17 Feb 2018 03:20:27 GMT'}]",2018-09-18,"[['Farooq', 'Bilal', ''], ['Cherchi', 'Elisabetta', ''], ['Sobhani', 'Anae', '']]","['virtual reality', 'augmented reality', 'stated preference experiment', 'behavioural analysis', 'autonomous vehicle', 'pedestrian behaviour']"
3388,1303.4017,Bernard Yannou,"Benachir Medjdoub (LGI, The Martin Centre), Bernard Yannou (LGI)",Separating Topology and Geometry in Space Planning,,"Computer Aided-Design 32, 1 (2000) 39-61",10.1016/S0010-4485(99)00084-6,,cs.AI physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We are dealing with the problem of space layout planning here. We present an
architectural conceptual CAD approach. Starting with design specifications in
terms of constraints over spaces, a specific enumeration heuristics leads to a
complete set of consistent conceptual design solutions named topological
solutions. These topological solutions which do not presume any precise
definitive dimension correspond to the sketching step that an architect carries
out from the Design specifications on a preliminary design phase in
architecture.
","[{'version': 'v1', 'created': 'Sat, 16 Mar 2013 20:12:49 GMT'}]",2013-03-19,"[['Medjdoub', 'Benachir', '', 'LGI, The Martin Centre'], ['Yannou', 'Bernard', '', 'LGI']]","['space layout planning', 'topological solution', 'heuristics', 'optimization', 'constraints', 'conceptual design', 'preliminary design']"
3389,1211.2776,Gwenael Delaval,"Gwena\""el Delaval (INRIA Grenoble Rh\^one-Alpes / LIG Laboratoire
  d'Informatique de Grenoble), Alain Girault (INRIA Grenoble Rh\^one-Alpes /
  LIG Laboratoire d'Informatique de Grenoble), Marc Pouzet (LRI)","A Type System for the Automatic Distribution of Higher-order Synchronous
  Dataflow Programs",,"LCTES - ACM International Conference on Languages, Compilers, and
  Tools for Embedded Systems (2008) 101-110",10.1145/1375657.1375672,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the design of distributed systems with synchronous dataflow
programming languages. As modular design entails handling both architectural
and functional modularity, our first contribution is to extend an existing
synchronous dataflow programming language with primitives allowing the
description of a distributed architecture and the localization of some
expressions onto some processors. We also present a distributed semantics to
formalize the distributed execution of synchronous programs. Our second
contribution is to provide a type system, in order to infer the localization of
non-annotated values by means of type inference and to ensure, at compilation
time, the consistency of the distribution. Our third contribution is to provide
a type-directed projection operation to obtain automatically,from a centralized
typed program, the local program to be executed by each computing resource. The
type system as well as the automatic distribution mechanism has been fully
implemented in the compiler of an existing synchronous data-flow programming
language.
","[{'version': 'v1', 'created': 'Mon, 12 Nov 2012 20:40:59 GMT'}]",2012-11-13,"[['Delaval', 'Gwenaël', '', ""INRIA Grenoble Rhône-Alpes / LIG Laboratoire\n  d'Informatique de Grenoble""], ['Girault', 'Alain', '', ""INRIA Grenoble Rhône-Alpes /\n  LIG Laboratoire d'Informatique de Grenoble""], ['Pouzet', 'Marc', '', 'LRI']]","['Synchronous programming', 'distribution', 'type systems', 'functional programming']"
3390,1808.01956,Borislav Stoyanov,"Mihaela Todorova, Borislav Stoyanov, Krzysztof Szczypiorski, Krasimir
  Kordov",SHAH: Hash Function based on Irregularly Decimated Chaotic Map,"accepted for publication in International Journal of Electronics and
  Telecommunications, vol. 64",,10.24425/123546,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel hash function based on irregularly
decimated chaotic map. The hash function called SHAH is based on two Tinkerbell
maps filtered with irregular decimation rule. Exact study has been provided on
the novel scheme using distribution analysis, sensitivity analysis, static
analysis of diffusion and confusion, and collision analysis. The experimental
data show that SHAH satisfied admirable level of security.
","[{'version': 'v1', 'created': 'Sun, 29 Jul 2018 16:13:50 GMT'}, {'version': 'v2', 'created': 'Sun, 19 Aug 2018 16:30:59 GMT'}]",2018-11-06,"[['Todorova', 'Mihaela', ''], ['Stoyanov', 'Borislav', ''], ['Szczypiorski', 'Krzysztof', ''], ['Kordov', 'Krasimir', '']]","['Hashfunction', 'Chaoticfunctions', 'Shrinkingdecimation rule', 'Pseudo-random number generator']"
3391,1209.2550,Pinki Nayak,"Pinki Nayak, Rekha Agarwal, and Seema Verma","Energy aware routing scheme for mobile ad hoc network using variable
  range transmission",11 pages,"International Journal of Ad hoc, Sensor & Ubiquitous Computing
  (IJASUC) Vol.3, No.4, 2012, 53-63",10.5121/ijasuc.2012.3406,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses a new energy aware routing scheme which uses variable
transmission range. The protocol has been incorporated along with the route
discovery procedure of AODV as a case study. Both the protocols are simulated
using Network Simulator and comparisons are made to analyze their performance
based on energy consumption, network lifetime and number of alive nodes metrics
for different network scenarios. The results show that EAR makes effective node
energy utilization.
","[{'version': 'v1', 'created': 'Wed, 12 Sep 2012 10:31:52 GMT'}]",2012-09-13,"[['Nayak', 'Pinki', ''], ['Agarwal', 'Rekha', ''], ['Verma', 'Seema', '']]","['MANET', 'AODV', 'energy aware routing', 'variable range transmission']"
3392,1501.06721,Daniel Krzywicki,"D. Krzywicki, W. Turek, A. Byrski, M. Kisiel-Dorohinicki",Massively-concurrent Agent-based Evolutionary Computing,"Journal of Computational Science, Available online 29 July 2015",,10.1016/j.jocs.2015.07.003,,cs.MA cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The fusion of the multi-agent paradigm with evolutionary computation yielded
promising results in many optimization problems. Evolutionary multi-agent
system (EMAS) are more similar to biological evolution than classical
evolutionary algorithms. However, technological limitations prevented the use
of fully asynchronous agents in previous EMAS implementations. In this paper we
present a new algorithm for agent-based evolutionary computations. The
individuals are represented as fully autonomous and asynchronous agents. An
efficient implementation of this algorithm was possible through the use of
modern technologies based on functional languages (namely Erlang and Scala),
which natively support lightweight processes and asynchronous communication.
Our experiments show that such an asynchronous approach is both faster and more
efficient in solving common optimization problems.
","[{'version': 'v1', 'created': 'Tue, 27 Jan 2015 10:03:14 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Aug 2015 07:19:25 GMT'}]",2015-08-13,"[['Krzywicki', 'D.', ''], ['Turek', 'W.', ''], ['Byrski', 'A.', ''], ['Kisiel-Dorohinicki', 'M.', '']]","['Multi-agent systems', 'Evolutionary computing', 'Functionalprogramming']"
3393,1402.2760,Yoann Dieudonn\'e,"J\'er\'emie Chalopin, Yoann Dieudonn\'e, Arnaud Labourel, Andrzej Pelc",Rendezvous in Networks in Spite of Delay Faults,,Distributed Computing 29(3) (2016) 187-205,10.1007/s00446-015-0259-2,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two mobile agents, starting from different nodes of an unknown network, have
to meet at the same node. Agents move in synchronous rounds using a
deterministic algorithm. Each agent has a different label, which it can use in
the execution of the algorithm, but it does not know the label of the other
agent. Agents do not know any bound on the size of the network. In each round
an agent decides if it remains idle or if it wants to move to one of the
adjacent nodes. Agents are subject to delay faults: if an agent incurs a fault
in a given round, it remains in the current node, regardless of its decision.
If it planned to move and the fault happened, the agent is aware of it. We
consider three scenarios of fault distribution: random (independently in each
round and for each agent with constant probability 0 < p < 1), unbounded adver-
sarial (the adversary can delay an agent for an arbitrary finite number of
consecutive rounds) and bounded adversarial (the adversary can delay an agent
for at most c consecutive rounds, where c is unknown to the agents). The
quality measure of a rendezvous algorithm is its cost, which is the total
number of edge traversals. For random faults, we show an algorithm with cost
polynomial in the size n of the network and polylogarithmic in the larger label
L, which achieves rendezvous with very high probability in arbitrary networks.
By contrast, for unbounded adversarial faults we show that rendezvous is not
feasible, even in the class of rings. Under this scenario we give a rendezvous
algorithm with cost O(nl), where l is the smaller label, working in arbitrary
trees, and we show that \Omega(l) is the lower bound on rendezvous cost, even
for the two-node tree. For bounded adversarial faults, we give a rendezvous
algorithm working for arbitrary networks, with cost polynomial in n, and
logarithmic in the bound c and in the larger label L.
","[{'version': 'v1', 'created': 'Wed, 12 Feb 2014 08:34:07 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Oct 2015 17:41:05 GMT'}]",2018-12-10,"[['Chalopin', 'Jérémie', ''], ['Dieudonné', 'Yoann', ''], ['Labourel', 'Arnaud', ''], ['Pelc', 'Andrzej', '']]","['rendezvous', 'deterministic algorithm', 'mobile agent', 'delay fault']"
3394,1204.0368,Shahrbanoo Majlesi,"Majlesi Shahrbanoo, Mehrpour Ali, and Mohsenzadeh Mehran",An Approach for Agile SOA Development using Agile Principals,"8 pages, 1 figure, 1 table;
  http://airccse.org/journal/ijcsit2012_curr.html",,10.5121/ijcsit.2012.4118,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In dynamic and turbulent business environment, the need for success and
survival of any organization is the ability of adapting to changes efficiently
and cost-effectively. So, for developing software applications, one of the
methods is Service Oriented Architecture (SOA) methodology and other is Agile
Methodology. Since embracing changes is the indispensable concept of SOA
development as well as Agile Development, using an appropriate SOA methodology
able to adapt changes even during system development with the preservation of
software quality is necessary. In this paper, a new approach consisted of five
steps is presented to add agility to SOA methodologies. This approach, before
any SOA-based development, helps architect(s) to determine Core Business
Processes (CBPs) by using agile principals for establishing Core Architecture.
The most important advantage of this approach according to the results of case
study is possibility of embracing changes with the preservation of software
quality in SOA developments.
","[{'version': 'v1', 'created': 'Mon, 2 Apr 2012 11:13:05 GMT'}]",2012-04-03,"[['Shahrbanoo', 'Majlesi', ''], ['Ali', 'Mehrpour', ''], ['Mehran', 'Mohsenzadeh', '']]","['Agile SOA', 'Agile Development Methodology', 'Core Business Process (CBPs)', 'Core Architecture']"
3395,1809.03016,Sohom Mukherjee,"Sohom Mukherjee, Arif Ahmed, Debi Prosad Dogra, Samarjit Kar, Partha
  Pratim Roy","Fingertip Detection and Tracking for Recognition of Air-Writing in
  Videos","32 pages, 10 figures, 2 tables. Submitted to Journal of Expert
  Systems with Applications","Expert Systems with Applications Volume 136, 1 December 2019,
  Pages 217-229",10.1016/j.eswa.2019.06.034,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Air-writing is the process of writing characters or words in free space using
finger or hand movements without the aid of any hand-held device. In this work,
we address the problem of mid-air finger writing using web-cam video as input.
In spite of recent advances in object detection and tracking, accurate and
robust detection and tracking of the fingertip remains a challenging task,
primarily due to small dimension of the fingertip. Moreover, the initialization
and termination of mid-air finger writing is also challenging due to the
absence of any standard delimiting criterion. To solve these problems, we
propose a new writing hand pose detection algorithm for initialization of
air-writing using the Faster R-CNN framework for accurate hand detection
followed by hand segmentation and finally counting the number of raised fingers
based on geometrical properties of the hand. Further, we propose a robust
fingertip detection and tracking approach using a new signature function called
distance-weighted curvature entropy. Finally, a fingertip velocity-based
termination criterion is used as a delimiter to mark the completion of the
air-writing gesture. Experiments show the superiority of the proposed fingertip
detection and tracking algorithm over state-of-the-art approaches giving a mean
precision of 73.1 % while achieving real-time performance at 18.5 fps, a
condition which is of vital importance to air-writing. Character recognition
experiments give a mean accuracy of 96.11 % using the proposed air-writing
system, a result which is comparable to that of existing handwritten character
recognition systems.
","[{'version': 'v1', 'created': 'Sun, 9 Sep 2018 18:10:59 GMT'}]",2019-07-01,"[['Mukherjee', 'Sohom', ''], ['Ahmed', 'Arif', ''], ['Dogra', 'Debi Prosad', ''], ['Kar', 'Samarjit', ''], ['Roy', 'Partha Pratim', '']]","['Air-writing', 'Hand pose detection', 'Fingertip']"
3396,1803.08858,Chiara Boldrini,"Chiara Boldrini and Mustafa Toprak and Marco Conti and Andrea
  Passarella",Twitter and the Press: an Ego-Centred Analysis,Accepted at OSNED 2018 - colocated with WWW'18,,10.1145/3184558.3191596,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ego networks have proved to be a valuable tool for understanding the
relationships that individuals establish with their peers, both in offline and
online social networks. Particularly interesting are the cognitive constraints
associated with the interactions between the ego and the members of their ego
network, whereby individuals cannot maintain meaningful interactions with more
than 150 people, on average. In this work, we focus on the ego networks of
journalists on Twitter, and we investigate whether they feature the same
characteristics observed for other relevant classes of Twitter users, like
politicians and generic users. Our findings are that journalists are generally
more active and interact with more people than generic users. Their ego network
structure is very aligned with reference models derived from the social brain
hypothesis and observed in general human ego networks. Remarkably, the
similarity is even higher than the one of politicians and generic users ego
networks. This may imply a greater cognitive involvement with Twitter than with
other social interaction means. Moreover, the ego networks of journalists are
much stabler than those of politicians and generic users, and the ego-alter
ties are often information-driven.
","[{'version': 'v1', 'created': 'Fri, 23 Mar 2018 16:07:05 GMT'}]",2018-03-26,"[['Boldrini', 'Chiara', ''], ['Toprak', 'Mustafa', ''], ['Conti', 'Marco', ''], ['Passarella', 'Andrea', '']]","['online social networks', 'ego networks', 'Twitter', 'journalists']"
3397,1903.08936,Henrique Becker,"Henrique Becker, Luciana S. Buriol","An empirical analysis of exact algorithms for the unbounded knapsack
  problem","42 pages, 7 tables (one in conclusions, the rest in appendix), 2
  diagrams, 1 algorithm, 8 plots",,10.1016/j.ejor.2019.02.011,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work presents an empirical analysis of exact algorithms for the
unbounded knapsack problem, which includes seven algorithms from the
literature, two commercial solvers, and more than ten thousand instances. The
terminating step-off, a dynamic programming algorithm from 1966, presented the
lowest mean time to solve the most recent benchmark from the literature. The
threshold and collective dominances are properties of the unbounded knapsack
problem first discussed in 1998, and exploited by the current state-of-the-art
algorithms. The terminating step-off algorithm did not exploit such dominances,
but has an alternative mechanism for dealing with dominances which does not
explicitly exploits collective and threshold dominances. Also, the pricing
subproblems found when solving hard cutting stock problems with column
generation can cause branch-and-bound algorithms to display worst-case times.
The authors present a new class of instances which favors the branch-and-bound
approach over the dynamic programming approach but do not have high amounts of
simple, multiple and collective dominated items. This behaviour illustrates how
the definition of hard instances changes among algorithm approachs. The codes
used for solving the unbounded knapsack problem and for instance generation are
all available online.
","[{'version': 'v1', 'created': 'Thu, 21 Mar 2019 11:55:05 GMT'}]",2019-03-22,"[['Becker', 'Henrique', ''], ['Buriol', 'Luciana S.', '']]","['Combinatorial optimization', 'Unbounded Knapsack Problem', 'Dynamic Programming', 'Integer Programming', 'Branch and Bound']"
3398,1706.04263,"Matthias W\""ahlisch","Andreas Reuter, Randy Bush, \'Italo Cunha, Ethan Katz-Bassett, Thomas
  C. Schmidt, Matthias W\""ahlisch","Towards a Rigorous Methodology for Measuring Adoption of RPKI Route
  Validation and Filtering",,"ACM SIGCOMM CCR 48(1) pp. 19--27, 2018",10.1145/3211852.3211856,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A proposal to improve routing security---Route Origin Authorization
(ROA)---has been standardized. A ROA specifies which network is allowed to
announce a set of Internet destinations. While some networks now specify ROAs,
little is known about whether other networks check routes they receive against
these ROAs, a process known as Route Origin Validation (ROV). Which networks
blindly accept invalid routes? Which reject them outright? Which de-preference
them if alternatives exist?
  Recent analysis attempts to use uncontrolled experiments to characterize ROV
adoption by comparing valid routes and invalid routes. However, we argue that
gaining a solid understanding of ROV adoption is impossible using currently
available data sets and techniques. Our measurements suggest that, although
some ISPs are not observed using invalid routes in uncontrolled experiments,
they are actually using different routes for (non-security) traffic engineering
purposes, without performing ROV. We conclude with a description of a
controlled, verifiable methodology for measuring ROV and present three ASes
that do implement ROV, confirmed by operators.
","[{'version': 'v1', 'created': 'Tue, 13 Jun 2017 21:38:41 GMT'}, {'version': 'v2', 'created': 'Sun, 2 Jul 2017 22:20:04 GMT'}, {'version': 'v3', 'created': 'Sat, 5 May 2018 15:36:42 GMT'}]",2018-05-08,"[['Reuter', 'Andreas', ''], ['Bush', 'Randy', ''], ['Cunha', 'Ítalo', ''], ['Katz-Bassett', 'Ethan', ''], ['Schmidt', 'Thomas C.', ''], ['Wählisch', 'Matthias', '']]","['BGP', 'RPKI', 'routing policies', 'Internet security']"
3399,1709.06672,Steffen Lewitzka,Steffen Lewitzka,Reasoning about proof and knowledge,"51 pages. The final corrected version is published in Annals of Pure
  and Applied Logic (2018), https://doi.org/10.1016/j.apal.2018.10.001","Annals of Pure and Applied Logic, Volume 170, Issue 2, February
  2019, Pages 218-250",10.1016/j.apal.2018.10.001,TR-PGCOMP-006/2017,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In previous work [Lewitzka, Log. J. IGPL 2017], we presented a hierarchy of
classical modal systems, along with algebraic semantics, for the reasoning
about intuitionistic truth, belief and knowledge. Deviating from G\""odel's
interpretation of IPC in S4, our modal systems contain IPC in the way
established in [Lewitzka, J. Log. Comp. 2015]. The modal operator can be viewed
as a predicate for intuitionistic truth, i.e. proof. Epistemic principles are
partially adopted from Intuitionistic Epistemic Logic IEL [Artemov and
Protopopescu, Rev. Symb. Log. 2016]. In the present paper, we show that the
S5-style systems of our hierarchy correspond to an extended
Brouwer-Heyting-Kolmogorov interpretation and are complete w.r.t. a relational
semantics based on intuitionistic general frames. In this sense, our S5-style
logics are adequate and complete systems for the reasoning about proof combined
with belief or knowledge. The proposed relational semantics is a uniform
framework in which also IEL can be modeled. Verification-based intuitionistic
knowledge formalized in IEL turns out to be a special case of the kind of
knowledge described by our S5-style systems.
","[{'version': 'v1', 'created': 'Tue, 19 Sep 2017 23:02:27 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Oct 2017 03:40:36 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Jun 2018 07:00:02 GMT'}, {'version': 'v4', 'created': 'Fri, 28 Dec 2018 23:24:18 GMT'}]",2019-01-01,"[['Lewitzka', 'Steffen', '']]","['modal logic', 'epistemic logic', 'intuitionistic logic', 'proof predicate', 'BHK interpretation', 'general frame', 'non-Fregean logic', 'self-reference']"
3400,1901.09037,Ziwei Xu,"Ziwei Xu (Polytech Nantes, DUKe, LS2N), Mounira Harzallah (LINA),
  Fabrice Guillet (LINA)",Comparing of Term Clustering Frameworks for Modular Ontology Learning,,"10th International Joint Conference on Knowledge Discovery,
  Knowledge Engineering and Knowledge Management, Sep 2018, Seville, Spain.
  SCITEPRESS - Science and Technology Publications; SCITEPRESS - Science and
  Technology Publications, pp.128-135, 2018, Proceedings of the 10th
  International Joint Conference on Knowledge Discovery, Knowledge Engineering
  and Knowledge Management - Volume 2: KEOD",10.5220/0006960401280135,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper aims to use term clustering to build a modular ontology according
to core ontology from domain-specific text. The acquisition of semantic
knowledge focuses on noun phrase appearing with the same syntactic roles in
relation to a verb or its preposition combination in a sentence. The
construction of this co-occurrence matrix from context helps to build feature
space of noun phrases, which is then transformed to several encoding
representations including feature selection and dimensionality reduction. In
addition, the content has also been presented with the construction of word
vectors. These representations are clustered respectively with K-Means and
Affinity Propagation (AP) methods, which differentiate into the term clustering
frameworks. Due to the randomness of K-Means, iteration efforts are adopted to
find the optimal parameter. The frameworks are evaluated extensively where AP
shows dominant effectiveness for co-occurred terms and NMF encoding technique
is salient by its promising facilities in feature compression.
","[{'version': 'v1', 'created': 'Fri, 25 Jan 2019 15:04:02 GMT'}]",2019-01-29,"[['Xu', 'Ziwei', '', 'Polytech Nantes, DUKe, LS2N'], ['Harzallah', 'Mounira', '', 'LINA'], ['Guillet', 'Fabrice', '', 'LINA']]","['Text Mining', 'Feature Extraction', 'Ontology Learning', 'Term Clustering']"
3401,1804.08335,Ioanna Symeonidou,"Angelos Charalambidis, Panos Rondogiannis and Ioanna Symeonidou","Approximation Fixpoint Theory and the Well-Founded Semantics of
  Higher-Order Logic Programs","Paper presented at the 34nd International Conference on Logic
  Programming (ICLP 2018), Oxford, UK, July 14 to July 17, 2018 31 pages, LaTeX",Theory and Practice of Logic Programming 18 (2018) 421-437,10.1017/S1471068418000108,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We define a novel, extensional, three-valued semantics for higher-order logic
programs with negation. The new semantics is based on interpreting the types of
the source language as three-valued Fitting-monotonic functions at all levels
of the type hierarchy. We prove that there exists a bijection between such
Fitting-monotonic functions and pairs of two-valued-result functions where the
first member of the pair is monotone-antimonotone and the second member is
antimonotone-monotone. By deriving an extension of consistent approximation
fixpoint theory (Denecker et al. 2004) and utilizing the above bijection, we
define an iterative procedure that produces for any given higher-order logic
program a distinguished extensional model. We demonstrate that this model is
actually a minimal one. Moreover, we prove that our construction generalizes
the familiar well-founded semantics for classical logic programs, making in
this way our proposal an appealing formulation for capturing the well-founded
semantics for higher-order logic programs. This paper is under consideration
for acceptance in TPLP.
","[{'version': 'v1', 'created': 'Mon, 23 Apr 2018 11:13:44 GMT'}]",2019-07-25,"[['Charalambidis', 'Angelos', ''], ['Rondogiannis', 'Panos', ''], ['Symeonidou', 'Ioanna', '']]","['Higher-Order Logic Programming', 'Negation in Logic Programming', 'Approximation Fixpoint Theory']"
3402,1804.03830,Takayasu Moriya,"Takayasu Moriya, Holger R. Roth, Shota Nakamura, Hirohisa Oda, Kai
  Nagara, Masahiro Oda, Kensaku Mori","Unsupervised Segmentation of 3D Medical Images Based on Clustering and
  Deep Representation Learning","This paper was presented at SPIE Medical Imaging 2018, Houston, TX,
  USA","Proc. SPIE 10578, Medical Imaging 2018: Biomedical Applications in
  Molecular, Structural, and Functional Imaging, 1057820 (12 March 2018)",10.1117/12.2293414,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel unsupervised segmentation method for 3D medical
images. Convolutional neural networks (CNNs) have brought significant advances
in image segmentation. However, most of the recent methods rely on supervised
learning, which requires large amounts of manually annotated data. Thus, it is
challenging for these methods to cope with the growing amount of medical
images. This paper proposes a unified approach to unsupervised deep
representation learning and clustering for segmentation. Our proposed method
consists of two phases. In the first phase, we learn deep feature
representations of training patches from a target image using joint
unsupervised learning (JULE) that alternately clusters representations
generated by a CNN and updates the CNN parameters using cluster labels as
supervisory signals. We extend JULE to 3D medical images by utilizing 3D
convolutions throughout the CNN architecture. In the second phase, we apply
k-means to the deep representations from the trained CNN and then project
cluster labels to the target image in order to obtain the fully segmented
image. We evaluated our methods on three images of lung cancer specimens
scanned with micro-computed tomography (micro-CT). The automatic segmentation
of pathological regions in micro-CT could further contribute to the
pathological examination process. Hence, we aim to automatically divide each
image into the regions of invasive carcinoma, noninvasive carcinoma, and normal
tissue. Our experiments show the potential abilities of unsupervised deep
representation learning for medical image segmentation.
","[{'version': 'v1', 'created': 'Wed, 11 Apr 2018 06:30:30 GMT'}]",2018-04-13,"[['Moriya', 'Takayasu', ''], ['Roth', 'Holger R.', ''], ['Nakamura', 'Shota', ''], ['Oda', 'Hirohisa', ''], ['Nagara', 'Kai', ''], ['Oda', 'Masahiro', ''], ['Mori', 'Kensaku', '']]","['Segmentation', 'Micro-CT', 'Representation Learning', 'Unsupervised Learning', 'Deep Learning']"
3403,1012.5913,Daniel Gayo Avello,Daniel Gayo-Avello,All liaisons are dangerous when all your friends are known to us,"10 pages, 5 tables",,10.1145/1995966.1995991,,cs.SI cs.CY cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online Social Networks (OSNs) are used by millions of users worldwide.
Academically speaking, there is little doubt about the usefulness of
demographic studies conducted on OSNs and, hence, methods to label unknown
users from small labeled samples are very useful. However, from the general
public point of view, this can be a serious privacy concern. Thus, both topics
are tackled in this paper: First, a new algorithm to perform user profiling in
social networks is described, and its performance is reported and discussed.
Secondly, the experiments --conducted on information usually considered
sensitive-- reveal that by just publicizing one's contacts privacy is at risk
and, thus, measures to minimize privacy leaks due to social graph data mining
are outlined.
","[{'version': 'v1', 'created': 'Wed, 29 Dec 2010 11:31:45 GMT'}]",2013-09-16,"[['Gayo-Avello', 'Daniel', '']]","['Online Social Networks', 'Twitter', 'graph labeling', 'privacy']"
3404,1903.10583,Felipe A. Louza,"Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao",Algorithms to compute the Burrows-Wheeler Similarity Distribution,Accepted to TCS,,10.1016/j.tcs.2019.03.012,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Burrows-Wheeler transform (BWT) is a well studied text transformation
widely used in data compression and text indexing. The BWT of two strings can
also provide similarity measures between them, based on the observation that
the more their symbols are intermixed in the transformation, the more the
strings are similar. In this article we present two new algorithms to compute
similarity measures based on the BWT for string collections. In particular, we
present practical and theoretical improvements to the computation of the
Burrows-Wheeler similarity distribution for all pairs of strings in a
collection. Our algorithms take advantage of the BWT computed for the
concatenation of all strings, and use compressed data structures that allow
reducing the running time with a small memory footprint, as shown by a set of
experiments with real and artificial datasets.
","[{'version': 'v1', 'created': 'Mon, 25 Mar 2019 20:21:17 GMT'}]",2020-09-10,"[['Louza', 'Felipe A.', ''], ['Telles', 'Guilherme P.', ''], ['Gog', 'Simon', ''], ['Zhao', 'Liang', '']]","['Burrows-Wheeler transform', 'string similarity', 'string collections', 'compressed data structures', 'parallel algorithms']"
3405,1806.09727,Helio M. de Oliveira,"A. J. A. Paschoal, R. M. Campello de Souza, H. M. de Oliveira",The Hamming and Golay Number-Theoretic Transforms,"5 pages, 2 figures",,10.14209/SBRT.2018.179,XXXVI Simp\'osio Brasileiro de Telecomunica\c{c}\~oes SBrT 2018,cs.IT eess.SP math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  New number-theoretic transforms are derived from known linear block codes
over finite fields. In particular, two new such transforms are built from
perfect codes, namely the \textit {Hamming number-theoretic transform} and the
\textit {Golay number-theoretic transform}. A few properties of these new
transforms are presented.
","[{'version': 'v1', 'created': 'Mon, 25 Jun 2018 23:28:20 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Sep 2018 12:21:32 GMT'}]",2019-09-27,"[['Paschoal', 'A. J. A.', ''], ['de Souza', 'R. M. Campello', ''], ['de Oliveira', 'H. M.', '']]","['Number-theoretic transforms (NTT)', 'Finite fields', 'Linear block codes', 'Perfect codes', 'Perfect transforms']"
3406,1901.05808,Sumanth Chennupati,"Sumanth Chennupati, Ganesh Sistu, Senthil Yogamani and Samir Rawashdeh","AuxNet: Auxiliary tasks enhanced Semantic Segmentation for Automated
  Driving",Accepted as a Short Paper for a poster presentation at VISAPP 2019,,10.5220/0007684106450652,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Decision making in automated driving is highly specific to the environment
and thus semantic segmentation plays a key role in recognizing the objects in
the environment around the car. Pixel level classification once considered a
challenging task which is now becoming mature to be productized in a car.
However, semantic annotation is time consuming and quite expensive. Synthetic
datasets with domain adaptation techniques have been used to alleviate the lack
of large annotated datasets. In this work, we explore an alternate approach of
leveraging the annotations of other tasks to improve semantic segmentation.
Recently, multi-task learning became a popular paradigm in automated driving
which demonstrates joint learning of multiple tasks improves overall
performance of each tasks. Motivated by this, we use auxiliary tasks like depth
estimation to improve the performance of semantic segmentation task. We propose
adaptive task loss weighting techniques to address scale issues in multi-task
loss functions which become more crucial in auxiliary tasks. We experimented on
automotive datasets including SYNTHIA and KITTI and obtained 3% and 5%
improvement in accuracy respectively.
","[{'version': 'v1', 'created': 'Thu, 17 Jan 2019 14:32:06 GMT'}]",2019-03-25,"[['Chennupati', 'Sumanth', ''], ['Sistu', 'Ganesh', ''], ['Yogamani', 'Senthil', ''], ['Rawashdeh', 'Samir', '']]","['Semantic Segmentation', 'Multitask Learning', 'Auxiliary Tasks', 'Automated Driving']"
3407,1612.08036,Agata Mosinska,"Agata Mosinska, Jakub Tarnawski, Pascal Fua","Active Learning and Proofreading for Delineation of Curvilinear
  Structures",extended version with fast reconstruction,"Proc. of Medical Image Computing and Computer-Assisted
  Intervention (MICCAI) 2017, pages 165-173",10.1007/978-3-319-66185-8_19,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many state-of-the-art delineation methods rely on supervised machine learning
algorithms. As a result, they require manually annotated training data, which
is tedious to obtain. Furthermore, even minor classification errors may
significantly affect the topology of the final result. In this paper we propose
a generic approach to addressing both of these problems by taking into account
the influence of a potential misclassification on the resulting delineation. In
an Active Learning context, we identify parts of linear structures that should
be annotated first in order to train a classifier effectively. In a
proofreading context, we similarly find regions of the resulting reconstruction
that should be verified in priority to obtain a nearly-perfect result. In both
cases, by focusing the attention of the human expert on potential
classification mistakes which are the most critical parts of the delineation,
we reduce the amount of required supervision. We demonstrate the effectiveness
of our approach on microscopy images depicting blood vessels and neurons.
","[{'version': 'v1', 'created': 'Fri, 23 Dec 2016 17:01:31 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Mar 2017 11:06:03 GMT'}]",2017-09-12,"[['Mosinska', 'Agata', ''], ['Tarnawski', 'Jakub', ''], ['Fua', 'Pascal', '']]","['Active Learning', 'Proofreading', 'Delineation', 'Light Microscopy', 'Mixed IntegerProgramming']"
3408,1508.00188,Guofeng Cao,"Feixiong Luo, Guofeng Cao, Kevin Mulligan, Xiang Li","Explore Spatiotemporal and Demographic Characteristics of Human Mobility
  via Twitter: A Case Study of Chicago",,,10.1016/j.apgeog.2016.03.001,,cs.SI cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Characterizing human mobility patterns is essential for understanding human
behaviors and the interactions with socioeconomic and natural environment. With
the continuing advancement of location and Web 2.0 technologies, location-based
social media (LBSM) have been gaining widespread popularity in the past few
years. With an access to locations of users, profiles and the contents of the
social media posts, the LBSM data provided a novel modality of data source for
human mobility study. By exploiting the explicit location footprints and mining
the latent demographic information implied in the LBSM data, the purpose of
this paper is to investigate the spatiotemporal characteristics of human
mobility with a particular focus on the impact of demography. We first collect
geo-tagged Twitter feeds posted in the conterminous United States area, and
organize the collection of feeds using the concept of space-time trajectory
corresponding to each Twitter user. Commonly human mobility measures, including
detected home and activity centers, are derived for each user trajectory. We
then select a subset of Twitter users that have detected home locations in the
city of Chicago as a case study, and apply name analysis to the names provided
in user profiles to learn the implicit demographic information of Twitter
users, including race/ethnicity, gender and age. Finally we explore the
spatiotemporal distribution and mobility characteristics of Chicago Twitter
users, and investigate the demographic impact by comparing the differences
across three demographic dimensions (race/ethnicity, gender and age). We found
that, although the human mobility measures of different demographic groups
generally follow the generic laws (e.g., power law distribution), the
demographic information, particular the race/ethnicity group, significantly
affects the urban human mobility patterns.
","[{'version': 'v1', 'created': 'Sun, 2 Aug 2015 04:16:44 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Apr 2016 15:24:10 GMT'}]",2016-04-14,"[['Luo', 'Feixiong', ''], ['Cao', 'Guofeng', ''], ['Mulligan', 'Kevin', ''], ['Li', 'Xiang', '']]","['Human mobility', 'geodemography', 'social media', 'Twitter', 'name analysis', 'Chicago']"
3409,2208.05641,Timothy Woinoski,T. J. Woinoski and I. V. Bajic,Towards Automated Key-Point Detection in Images with Partial Pool View,,"Proceedings of the 5th International ACM Workshop on Multimedia
  Content Analysis in Sports (MMSports '22), October 10, 2022, Lisboa, Portugal",10.1145/3552437.3555705,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Sports analytics has been an up-and-coming field of research among
professional sporting organizations and academic institutions alike. With the
insurgence and collection of athlete data, the primary goal of such analysis is
to improve athletes' performance in a measurable and quantifiable manner. This
work is aimed at alleviating some of the challenges encountered in the
collection of adequate swimming data. Past works on this subject have shown
that the detection and tracking of swimmers is feasible, but not without
challenges. Among these challenges are pool localization and determining the
relative positions of the swimmers relative to the pool. This work presents two
contributions towards solving these challenges. First, we present a pool model
with invariant key-points relevant for swimming analytics. Second, we study the
detectability of such key-points in images with partial pool view, which are
challenging but also quite common in swimming race videos.
","[{'version': 'v1', 'created': 'Thu, 11 Aug 2022 05:06:00 GMT'}]",2022-08-12,"[['Woinoski', 'T. J.', ''], ['Bajic', 'I. V.', '']]","['Swimming', 'Deep Learning', 'Field Localization', 'Key-Point Detection']"
3410,1610.05141,"Lorenz H\""ubschle-Schneider","Peter Sanders, Sebastian Lamm, Lorenz H\""ubschle-Schneider, Emanuel
  Schrade and Carsten Dachsbacher","Efficient Random Sampling -- Parallel, Vectorized, Cache-Efficient, and
  Online",,"ACM Transactions on Mathematical Software (TOMS), Volume 44, Issue
  3 (April 2018), pages 29:1-29:14",10.1145/3157734,,cs.DS cs.DC cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of sampling $n$ numbers from the range
$\{1,\ldots,N\}$ without replacement on modern architectures. The main result
is a simple divide-and-conquer scheme that makes sequential algorithms more
cache efficient and leads to a parallel algorithm running in expected time
$\mathcal{O}(n/p+\log p)$ on $p$ processors, i.e., scales to massively parallel
machines even for moderate values of $n$. The amount of communication between
the processors is very small (at most $\mathcal{O}(\log p)$) and independent of
the sample size. We also discuss modifications needed for load balancing,
online sampling, sampling with replacement, Bernoulli sampling, and
vectorization on SIMD units or GPUs.
","[{'version': 'v1', 'created': 'Mon, 17 Oct 2016 14:38:02 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Nov 2019 15:27:42 GMT'}]",2019-11-18,"[['Sanders', 'Peter', ''], ['Lamm', 'Sebastian', ''], ['Hübschle-Schneider', 'Lorenz', ''], ['Schrade', 'Emanuel', ''], ['Dachsbacher', 'Carsten', '']]","['Random sampling', 'hypergeometric random deviates', 'parallel algorithms', 'communication efficient algorithms']"
3411,2105.04132,Xuan Yang,"Xuan Yang, Shanshan Li, Zhengchao Chen, Jocelyn Chanussot, Xiuping
  Jia, Bing Zhang, Baipeng Li, Pan Chen","An Attention-Fused Network for Semantic Segmentation of
  Very-High-Resolution Remote Sensing Imagery","35 pages. Published by ISPRS Journal of Photogrammetry and Remote
  Sensing","ISPRS Journal of Photogrammetry and Remote Sensing, 177: 238-262,
  2021",10.1016/j.isprsjprs.2021.05.004,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semantic segmentation is an essential part of deep learning. In recent years,
with the development of remote sensing big data, semantic segmentation has been
increasingly used in remote sensing. Deep convolutional neural networks (DCNNs)
face the challenge of feature fusion: very-high-resolution remote sensing image
multisource data fusion can increase the network's learnable information, which
is conducive to correctly classifying target objects by DCNNs; simultaneously,
the fusion of high-level abstract features and low-level spatial features can
improve the classification accuracy at the border between target objects. In
this paper, we propose a multipath encoder structure to extract features of
multipath inputs, a multipath attention-fused block module to fuse multipath
features, and a refinement attention-fused block module to fuse high-level
abstract features and low-level spatial features. Furthermore, we propose a
novel convolutional neural network architecture, named attention-fused network
(AFNet). Based on our AFNet, we achieve state-of-the-art performance with an
overall accuracy of 91.7% and a mean F1 score of 90.96% on the ISPRS Vaihingen
2D dataset and an overall accuracy of 92.1% and a mean F1 score of 93.44% on
the ISPRS Potsdam 2D dataset.
","[{'version': 'v1', 'created': 'Mon, 10 May 2021 06:23:27 GMT'}, {'version': 'v2', 'created': 'Fri, 28 May 2021 11:21:24 GMT'}]",2021-05-31,"[['Yang', 'Xuan', ''], ['Li', 'Shanshan', ''], ['Chen', 'Zhengchao', ''], ['Chanussot', 'Jocelyn', ''], ['Jia', 'Xiuping', ''], ['Zhang', 'Bing', ''], ['Li', 'Baipeng', ''], ['Chen', 'Pan', '']]","['semantic segmentation', 'deep learning', 'very-high-resolution imagery', 'attention-fused network', 'ISPRS', 'convolutional neural network']"
3412,1804.05764,Samuel Remedios,"Samuel Remedios, Dzung L. Pham, John A. Butman, Snehashis Roy","Classifying magnetic resonance image modalities with convolutional
  neural networks",Github: https://github.com/sremedios/phinet,,10.1117/12.2293943,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Magnetic Resonance (MR) imaging allows the acquisition of images with
different contrast properties depending on the acquisition protocol and the
magnetic properties of tissues. Many MR brain image processing techniques, such
as tissue segmentation, require multiple MR contrasts as inputs, and each
contrast is treated differently. Thus it is advantageous to automate the
identification of image contrasts for various purposes, such as facilitating
image processing pipelines, and managing and maintaining large databases via
content-based image retrieval (CBIR). Most automated CBIR techniques focus on a
two-step process: extracting features from data and classifying the image based
on these features. We present a novel 3D deep convolutional neural network
(CNN)-based method for MR image contrast classification. The proposed CNN
automatically identifies the MR contrast of an input brain image volume.
Specifically, we explored three classification problems: (1) identify
T1-weighted (T1-w), T2-weighted (T2-w), and fluid-attenuated inversion recovery
(FLAIR) contrasts, (2) identify pre vs post-contrast T1, (3) identify pre vs
post-contrast FLAIR. A total of 3418 image volumes acquired from multiple sites
and multiple scanners were used. To evaluate each task, the proposed model was
trained on 2137 images and tested on the remaining 1281 images. Results showed
that image volumes were correctly classified with 97.57% accuracy.
","[{'version': 'v1', 'created': 'Mon, 16 Apr 2018 16:08:39 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Apr 2018 01:47:16 GMT'}]",2018-04-18,"[['Remedios', 'Samuel', ''], ['Pham', 'Dzung L.', ''], ['Butman', 'John A.', ''], ['Roy', 'Snehashis', '']]","['magnetic resonance imaging', 'MRI', 'TBI', 'content-based image retrieval', 'deep learning', 'convolutionalneural network']"
3413,1203.1905,Valmir Barbosa,"Fabio R. J. Vieira, Jos\'e F. de Rezende, Valmir C. Barbosa, Serge
  Fdida","Local heuristic for the refinement of multi-path routing in wireless
  mesh networks",,"Computer Networks 57 (2013), 273-285",10.1016/j.comnet.2012.09.009,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider wireless mesh networks and the problem of routing end-to-end
traffic over multiple paths for the same origin-destination pair with minimal
interference. We introduce a heuristic for path determination with two
distinguishing characteristics. First, it works by refining an extant set of
paths, determined previously by a single- or multi-path routing algorithm.
Second, it is totally local, in the sense that it can be run by each of the
origins on information that is available no farther than the node's immediate
neighborhood. We have conducted extensive computational experiments with the
new heuristic, using AODV and OLSR, as well as their multi-path variants, as
underlying routing methods. For two different CSMA settings (as implemented by
802.11) and one TDMA setting running a path-oriented link scheduling algorithm,
we have demonstrated that the new heuristic is capable of improving the average
throughput network-wide. When working from the paths generated by the
multi-path routing algorithms, the heuristic is also capable to provide a more
evenly distributed traffic pattern.
","[{'version': 'v1', 'created': 'Thu, 8 Mar 2012 20:20:48 GMT'}]",2013-02-11,"[['Vieira', 'Fabio R. J.', ''], ['de Rezende', 'José F.', ''], ['Barbosa', 'Valmir C.', ''], ['Fdida', 'Serge', '']]","['Wireless mesh networks', 'Multi-path routing', 'Path coupling', 'Disjoint paths', 'Mutual interference']"
3414,1410.1995,Kiran Kumar v,"V. Kiran Kumar (Dravidian University, Kuppam)","Semantic Web Approach towards Interoperability and Privacy issues in
  Social Networks",5 Pages,,10.5121/ijwsc.2014.5302,,cs.SE cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Social Web is a set of social relations that link people through World
Wide Web. This Social Web encompasses how the websites and software are
designed and developed to support social relations. The new paradigms, tools
and web services introduced by Social Web are widely accepted by internet
users. The main drawbacks of these tools are it acts as independent data silos;
hence interoperability among applications is a complex issue. This paper
focuses on this issue and how best we can use semantic web technologies to
achieve interoperability among applications.
","[{'version': 'v1', 'created': 'Wed, 8 Oct 2014 06:43:01 GMT'}]",2014-10-09,"[['Kumar', 'V. Kiran', '', 'Dravidian University, Kuppam']]","['Social Web', 'Semantic Web', 'interoperability', 'Web']"
3415,1208.3071,Anisur Molla Rahaman,"Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal",Fast Distributed PageRank Computation,14 pages,"Theoretical Computer Science, Volume 561, Pages 113-121, 2015",10.1016/j.tcs.2014.04.003,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the last decade, PageRank has gained importance in a wide range of
applications and domains, ever since it first proved to be effective in
determining node importance in large graphs (and was a pioneering idea behind
Google's search engine). In distributed computing alone, PageRank vector, or
more generally random walk based quantities have been used for several
different applications ranging from determining important nodes, load
balancing, search, and identifying connectivity structures. Surprisingly,
however, there has been little work towards designing provably efficient
fully-distributed algorithms for computing PageRank. The difficulty is that
traditional matrix-vector multiplication style iterative methods may not always
adapt well to the distributed setting owing to communication bandwidth
restrictions and convergence rates.
  In this paper, we present fast random walk-based distributed algorithms for
computing PageRanks in general graphs and prove strong bounds on the round
complexity. We first present a distributed algorithm that takes $O\big(\log
n/\eps \big)$ rounds with high probability on any graph (directed or
undirected), where $n$ is the network size and $\eps$ is the reset probability
used in the PageRank computation (typically $\eps$ is a fixed constant). We
then present a faster algorithm that takes $O\big(\sqrt{\log n}/\eps \big)$
rounds in undirected graphs. Both of the above algorithms are scalable, as each
node sends only small ($\polylog n$) number of bits over each edge per round.
To the best of our knowledge, these are the first fully distributed algorithms
for computing PageRank vector with provably efficient running time.
","[{'version': 'v1', 'created': 'Wed, 15 Aug 2012 09:36:02 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Nov 2015 10:55:10 GMT'}]",2015-11-26,"[['Sarma', 'Atish Das', ''], ['Molla', 'Anisur Rahaman', ''], ['Pandurangan', 'Gopal', ''], ['Upfal', 'Eli', '']]","['PageRank', 'Distributed Algorithm', 'Random Walk', 'Monte Carlo Method']"
3416,2107.12433,Jos\'e Su\'arez-Varela,"Jos\'e Su\'arez-Varela, Miquel Ferriol-Galm\'es, Albert L\'opez, Paul
  Almasan, Guillermo Bern\'ardez, David Pujol-Perich, Krzysztof Rusek, Lo\""ick
  Bonniot, Christoph Neumann, Fran\c{c}ois Schnitzler, Fran\c{c}ois Ta\""iani,
  Martin Happ, Christian Maier, Jia Lei Du, Matthias Herlich, Peter Dorfinger,
  Nick Vincent Hainke, Stefan Venz, Johannes Wegener, Henrike Wissing, Bo Wu,
  Shihan Xiao, Pere Barlet-Ros, Albert Cabellos-Aparicio","The Graph Neural Networking Challenge: A Worldwide Competition for
  Education in AI/ML for Networks",,"ACM SIGCOMM Computer Communication Review, Vol. 51, No. 3, pp.
  9-16, 2021",10.1145/3477482.3477485,,cs.NI cs.AI cs.GL cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  During the last decade, Machine Learning (ML) has increasingly become a hot
topic in the field of Computer Networks and is expected to be gradually adopted
for a plethora of control, monitoring and management tasks in real-world
deployments. This poses the need to count on new generations of students,
researchers and practitioners with a solid background in ML applied to
networks. During 2020, the International Telecommunication Union (ITU) has
organized the ""ITU AI/ML in 5G challenge'', an open global competition that has
introduced to a broad audience some of the current main challenges in ML for
networks. This large-scale initiative has gathered 23 different challenges
proposed by network operators, equipment manufacturers and academia, and has
attracted a total of 1300+ participants from 60+ countries. This paper narrates
our experience organizing one of the proposed challenges: the ""Graph Neural
Networking Challenge 2020''. We describe the problem presented to participants,
the tools and resources provided, some organization aspects and participation
statistics, an outline of the top-3 awarded solutions, and a summary with some
lessons learned during all this journey. As a result, this challenge leaves a
curated set of educational resources openly available to anyone interested in
the topic.
","[{'version': 'v1', 'created': 'Mon, 26 Jul 2021 18:52:00 GMT'}]",2021-07-28,"[['Suárez-Varela', 'José', ''], ['Ferriol-Galmés', 'Miquel', ''], ['López', 'Albert', ''], ['Almasan', 'Paul', ''], ['Bernárdez', 'Guillermo', ''], ['Pujol-Perich', 'David', ''], ['Rusek', 'Krzysztof', ''], ['Bonniot', 'Loïck', ''], ['Neumann', 'Christoph', ''], ['Schnitzler', 'François', ''], ['Taïani', 'François', ''], ['Happ', 'Martin', ''], ['Maier', 'Christian', ''], ['Du', 'Jia Lei', ''], ['Herlich', 'Matthias', ''], ['Dorfinger', 'Peter', ''], ['Hainke', 'Nick Vincent', ''], ['Venz', 'Stefan', ''], ['Wegener', 'Johannes', ''], ['Wissing', 'Henrike', ''], ['Wu', 'Bo', ''], ['Xiao', 'Shihan', ''], ['Barlet-Ros', 'Pere', ''], ['Cabellos-Aparicio', 'Albert', '']]","['Network AI', 'Machine Learning', 'Graph Neural Networks']"
3417,1608.01611,Harits Ar Rosyid,"Harits Ar Rosyid, Matt Palmerlee, Ke Chen","Deploying learning materials to game content for serious education game
  development: A case study",,,10.1016/j.entcom.2018.01.001,,cs.AI cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ultimate goals of serious education games (SEG) are to facilitate
learning and maximizing enjoyment during playing SEGs. In SEG development,
there are normally two spaces to be taken into account: knowledge space
regarding learning materials and content space regarding games to be used to
convey learning materials. How to deploy the learning materials seamlessly and
effectively into game content becomes one of the most challenging problems in
SEG development. Unlike previous work where experts in education have to be
used heavily, we proposed a novel approach that works toward minimizing the
efforts of education experts in mapping learning materials to content space.
For a proof-of-concept, we apply the proposed approach in developing an SEG
game, named \emph{Chem Dungeon}, as a case study in order to demonstrate the
effectiveness of our proposed approach. This SEG game has been tested with a
number of users, and the user survey suggests our method works reasonably well.
","[{'version': 'v1', 'created': 'Thu, 4 Aug 2016 16:56:31 GMT'}]",2018-01-09,"[['Rosyid', 'Harits Ar', ''], ['Palmerlee', 'Matt', ''], ['Chen', 'Ke', '']]","['serious educational game', 'serious game development', 'learning material deployment', 'game content generation', 'ChemDungeon', 'user survey']"
3418,2205.11934,Luigi Quaranta,"Luigi Quaranta, Fabio Calefato, Filippo Lanubile",Pynblint: a Static Analyzer for Python Jupyter Notebooks,2 pages,"Proc. of 2022 IEEE/ACM 1st Conference on AI Engineering - Software
  Engineering for AI (CAIN), May 16-24, 2022, Pittsburgh, PA, USA",10.1145/3522664.3528612,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Jupyter Notebook is the tool of choice of many data scientists in the early
stages of ML workflows. The notebook format, however, has been criticized for
inducing bad programming practices; indeed, researchers have already shown that
open-source repositories are inundated by poor-quality notebooks. Low-quality
output from the prototypical stages of ML workflows constitutes a clear
bottleneck towards the productization of ML models. To foster the creation of
better notebooks, we developed Pynblint, a static analyzer for Jupyter
notebooks written in Python. The tool checks the compliance of notebooks (and
surrounding repositories) with a set of empirically validated best practices
and provides targeted recommendations when violations are detected.
","[{'version': 'v1', 'created': 'Tue, 24 May 2022 09:56:03 GMT'}]",2022-05-25,"[['Quaranta', 'Luigi', ''], ['Calefato', 'Fabio', ''], ['Lanubile', 'Filippo', '']]","['Computational notebooks', 'lint', 'software quality', 'data science', 'machine learning']"
3419,2105.07028,Michael Crusoe,"Michael R. Crusoe, Sanne Abeln, Alexandru Iosup, Peter Amstutz, John
  Chilton, Neboj\v{s}a Tijani\'c, Herv\'e M\'enager, Stian Soiland-Reyes,
  Bogdan Gavrilovic, Carole Goble (for the CWL Community)","Methods Included: Standardizing Computational Reuse and Portability with
  the Common Workflow Language","8 pages, 3 figures. For the LaTex source code of this paper, see
  https://github.com/mr-c/cwl_methods_included",Commun. ACM 65 (2022) 54-63,10.1145/3486897,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Computational Workflows are widely used in data analysis, enabling innovation
and decision-making. In many domains (bioinformatics, image analysis, & radio
astronomy) the analysis components are numerous and written in multiple
different computer languages by third parties. However, many competing workflow
systems exist, severely limiting portability of such workflows, thereby
hindering the transfer of workflows between different systems, between
different projects and different settings, leading to vendor lock-ins and
limiting their generic re-usability. Here we present the Common Workflow
Language (CWL) project which produces free and open standards for describing
command-line tool based workflows. The CWL standards provide a common but
reduced set of abstractions that are both used in practice and implemented in
many popular workflow systems. The CWL language is declarative, which allows
expressing computational workflows constructed from diverse software tools,
executed each through their command-line interface. Being explicit about the
runtime environment and any use of software containers enables portability and
reuse. Workflows written according to the CWL standards are a reusable
description of that analysis that are runnable on a diverse set of computing
environments. These descriptions contain enough information for advanced
optimization without additional input from workflow authors. The CWL standards
support polylingual workflows, enabling portability and reuse of such
workflows, easing for example scholarly publication, fulfilling regulatory
requirements, collaboration in/between academic research and industry, while
reducing implementation costs. CWL has been taken up by a wide variety of
domains, and industries and support has been implemented in many major workflow
systems.
","[{'version': 'v1', 'created': 'Fri, 14 May 2021 18:44:48 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Aug 2021 16:02:52 GMT'}]",2022-05-24,"[['Crusoe', 'Michael R.', '', 'for the CWL Community'], ['Abeln', 'Sanne', '', 'for the CWL Community'], ['Iosup', 'Alexandru', '', 'for the CWL Community'], ['Amstutz', 'Peter', '', 'for the CWL Community'], ['Chilton', 'John', '', 'for the CWL Community'], ['Tijanić', 'Nebojša', '', 'for the CWL Community'], ['Ménager', 'Hervé', '', 'for the CWL Community'], ['Soiland-Reyes', 'Stian', '', 'for the CWL Community'], ['Gavrilovic', 'Bogdan', '', 'for the CWL Community'], ['Goble', 'Carole', '', 'for the CWL Community']]","['workflows', 'computational data analysis', 'CWL', 'scientific workflows', 'standards']"
3420,2104.12731,Julian Posada,"Julian Posada, Nicholas Weller, Wendy H. Wong","We Haven't Gone Paperless Yet: Why the Printing Press Can Help Us
  Understand Data and AI",,"Proceedings of the 2021 AAAI/ACM Conference on AI, Ethics, and
  Society (AIES '21)",10.1145/3461702.3462604,,cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  How should we understand the social and political effects of the datafication
of human life? This paper argues that the effects of data should be understood
as a constitutive shift in social and political relations. We explore how
datafication, or quantification of human and non-human factors into binary
code, affects the identity of individuals and groups. This fundamental shift
goes beyond economic and ethical concerns, which has been the focus of other
efforts to explore the effects of datafication and AI. We highlight that
technologies such as datafication and AI (and previously, the printing press)
both disrupted extant power arrangements, leading to decentralization, and
triggered a recentralization of power by new actors better adapted to
leveraging the new technology. We use the analogy of the printing press to
provide a framework for understanding constitutive change. The printing press
example gives us more clarity on 1) what can happen when the medium of
communication drastically alters how information is communicated and stored; 2)
the shift in power from state to private actors; and 3) the tension of
simultaneously connecting individuals while driving them towards narrower
communities through algorithmic analyses of data.
","[{'version': 'v1', 'created': 'Mon, 26 Apr 2021 17:22:47 GMT'}]",2021-04-27,"[['Posada', 'Julian', ''], ['Weller', 'Nicholas', ''], ['Wong', 'Wendy H.', '']]","['Printing press', 'politics of data', 'corporations', 'governance']"
3421,2105.03680,Maciej Swiechowski PhD,Maciej \'Swiechowski,"A Crossover That Matches Diverse Parents Together in Evolutionary
  Algorithms",Accepted to GECCO 2021,,10.1145/3449726.3459431,,cs.NE cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Crossover and mutation are the two main operators that lead to new solutions
in evolutionary approaches. In this article, a new method of performing the
crossover phase is presented. The problem of choice is evolutionary decision
tree construction. The method aims at finding such individuals that together
complement each other. Hence we say that they are diversely specialized. We
propose the way of calculating the so-called complementary fitness. In several
empirical experiments, we evaluate the efficacy of the method proposed in four
variants and compare it to a fitness-rank-based approach. One variant emerges
clearly as the best approach, whereas the remaining ones are below the
baseline.
","[{'version': 'v1', 'created': 'Sat, 8 May 2021 11:43:26 GMT'}]",2021-05-11,"[['Świechowski', 'Maciej', '']]","['Decision making', 'Evolutionary programming', 'Fitness evaluation', 'Recombination operators', 'Empirical study']"
3422,2010.08365,Li Yuan,"Li Yuan, Yichen Zhou, Shuning Chang, Ziyuan Huang, Yunpeng Chen,
  Xuecheng Nie, Tao Wang, Jiashi Feng, Shuicheng Yan","Toward Accurate Person-level Action Recognition in Videos of Crowded
  Scenes","1'st Place in ACM Multimedia Grand Challenge: Human in Events,
  Track4: Person-level Action Recognition in Complex Events",ACM Multimedia 2020,10.1145/3394171.3416301,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detecting and recognizing human action in videos with crowded scenes is a
challenging problem due to the complex environment and diversity events. Prior
works always fail to deal with this problem in two aspects: (1) lacking
utilizing information of the scenes; (2) lacking training data in the crowd and
complex scenes. In this paper, we focus on improving spatio-temporal action
recognition by fully-utilizing the information of scenes and collecting new
data. A top-down strategy is used to overcome the limitations. Specifically, we
adopt a strong human detector to detect the spatial location of each frame. We
then apply action recognition models to learn the spatio-temporal information
from video frames on both the HIE dataset and new data with diverse scenes from
the internet, which can improve the generalization ability of our model.
Besides, the scenes information is extracted by the semantic segmentation model
to assistant the process. As a result, our method achieved an average 26.05
wf\_mAP (ranking 1st place in the ACM MM grand challenge 2020: Human in
Events).
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2020 13:08:50 GMT'}]",2020-10-19,"[['Yuan', 'Li', ''], ['Zhou', 'Yichen', ''], ['Chang', 'Shuning', ''], ['Huang', 'Ziyuan', ''], ['Chen', 'Yunpeng', ''], ['Nie', 'Xuecheng', ''], ['Wang', 'Tao', ''], ['Feng', 'Jiashi', ''], ['Yan', 'Shuicheng', '']]","['Action recognition', 'person detection', 'human in events']"
3423,1606.08085,Madeleine Kotzagiannidis,"Madeleine S. Kotzagiannidis, Pier Luigi Dragotti","Sampling and Reconstruction of Sparse Signals on Circulant Graphs - An
  Introduction to Graph-FRI",To appear in Appl. Comput. Harmon. Anal. (2017),,10.1016/j.acha.2017.10.003,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the objective of employing graphs toward a more generalized theory of
signal processing, we present a novel sampling framework for (wavelet-)sparse
signals defined on circulant graphs which extends basic properties of Finite
Rate of Innovation (FRI) theory to the graph domain, and can be applied to
arbitrary graphs via suitable approximation schemes. At its core, the
introduced Graph-FRI-framework states that any K-sparse signal on the vertices
of a circulant graph can be perfectly reconstructed from its
dimensionality-reduced representation in the graph spectral domain, the Graph
Fourier Transform (GFT), of minimum size 2K. By leveraging the recently
developed theory of e-splines and e-spline wavelets on graphs, one can
decompose this graph spectral transformation into the multiresolution low-pass
filtering operation with a graph e-spline filter, and subsequent transformation
to the spectral graph domain; this allows to infer a distinct sampling pattern,
and, ultimately, the structure of an associated coarsened graph, which
preserves essential properties of the original, including circularity and,
where applicable, the graph generating set.
","[{'version': 'v1', 'created': 'Sun, 26 Jun 2016 20:56:06 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Oct 2017 23:34:31 GMT'}]",2017-10-24,"[['Kotzagiannidis', 'Madeleine S.', ''], ['Dragotti', 'Pier Luigi', '']]","['graph signal processing', 'sampling on graphs', 'sparse sampling', 'graphwavelet', 'finite rate of innovation']"
3424,1408.2687,Tamjid Rahman,Tamjid Rahman and M. Rokonuzzaman,"A Noble Methodology for Users Work Process Driven Software Requirements
  for Smart Handheld Devices","18 pages, 9 figures",,10.5121/ijsea.2014.5402,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Requirement engineering is a key ingredient for software development to be
effective. Apart from the traditional software requirement which is not much
appropriate for new emerging software such as smart handheld device based
software. In many perspectives of requirement engineering, traditional and new
emerging software are not similar. Whereas requirement engineering of
traditional software needs more research, it is obvious that new emerging
software needs methodically and in-depth research for improved productivity,
quality, risk management and validity. In particular, the result of this paper
shows that how effective requirement engineering can improve in project
negotiation, project planning, managing feature creep, testing, defect, rework
and product quality. This paper also shows a new methodology which is focused
on users work process applicable for eliciting the requirement of traditional
software and any new type software of smart handheld device such as iPad. As an
example, the paper shows how the methodology will be applied as a software
requirement of iPad-based software for play-group students.
","[{'version': 'v1', 'created': 'Tue, 12 Aug 2014 10:50:35 GMT'}]",2014-08-13,"[['Rahman', 'Tamjid', ''], ['Rokonuzzaman', 'M.', '']]","['Requirement engineering', 'smart handheld device', 'users’ work process']"
3425,2105.10197,Raphael Fischer,"Katharina Morik and Helena Kotthaus and Raphael Fischer and Sascha
  M\""ucke and Matthias Jakobs and Nico Piatkowski and Andreas Pauly and Lukas
  Heppe and Danny Heinrich","Yes We Care! -- Certification for Machine Learning Methods through the
  Care Label Framework",,"Frontiers in Artificial Intelligence, September 2022",10.3389/frai.2022.975029,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Machine learning applications have become ubiquitous. Their applications
range from embedded control in production machines over process optimization in
diverse areas (e.g., traffic, finance, sciences) to direct user interactions
like advertising and recommendations. This has led to an increased effort of
making machine learning trustworthy. Explainable and fair AI have already
matured. They address the knowledgeable user and the application engineer.
However, there are users that want to deploy a learned model in a similar way
as their washing machine. These stakeholders do not want to spend time in
understanding the model, but want to rely on guaranteed properties. What are
the relevant properties? How can they be expressed to the stakeholder without
presupposing machine learning knowledge? How can they be guaranteed for a
certain implementation of a machine learning model? These questions move far
beyond the current state of the art and we want to address them here. We
propose a unified framework that certifies learning methods via care labels.
They are easy to understand and draw inspiration from well-known certificates
like textile labels or property cards of electronic devices. Our framework
considers both, the machine learning theory and a given implementation. We test
the implementation's compliance with theoretical properties and bounds.
","[{'version': 'v1', 'created': 'Fri, 21 May 2021 08:15:21 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Dec 2022 08:48:50 GMT'}]",2022-12-23,"[['Morik', 'Katharina', ''], ['Kotthaus', 'Helena', ''], ['Fischer', 'Raphael', ''], ['Mücke', 'Sascha', ''], ['Jakobs', 'Matthias', ''], ['Piatkowski', 'Nico', ''], ['Pauly', 'Andreas', ''], ['Heppe', 'Lukas', ''], ['Heinrich', 'Danny', '']]","['trustworthy AI', 'testing machine learning', 'certification', 'probabilistic graphical models', 'care labels']"
3426,1701.03636,Jan Zeman,"Alena Zemanov\'a, Jan Zeman, and Michal \v{S}ejnoha","Comparison of viscoelastic finite element models for laminated glass
  beams","30 pages, 11 figures, 8 tables, 1 algorithm","International Journal of Mechanical Sciences 131--132, 380--395,
  (2017)",10.1016/j.ijmecsci.2017.05.035,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Laminated glass elements, which consist of stiff elastic glass layers
connected with a compliant viscoelastic polymer foil, exhibit geometrically
non-linear and time/temperature-sensitive behavior. In computational modeling,
the viscoelastic effects are often neglected or a detailed continuum
formulation typically based on the volumetric-deviatoric elastic-viscoelastic
split is used for the interlayer. Four layerwise beam theories are introduced
in this paper, which differ in the non-linear beam formulation at the layer
level (von K\'{a}rm\'{a}n/Reissner) and in constitutive assumptions for the
interlayer (a viscoelastic solid with the time-independent bulk modulus/Poisson
ratio). We perform detailed verification and validation studies at different
temperatures and compare the accuracy of the selected formulation with
simplified elastic solutions used in practice. We show that all the four
formulations predict very similar responses. Therefore, our suggestion is to
use the most straightforward formulation that combines the von K\'{a}rm\'{a}n
model with the assumption of time-independent Poisson ratio. The simplified
elastic model mostly provides a response in satisfactory agreement with full
viscoelastic solutions. However, it can lead to unsafe or inaccurate
predictions for rapid changes of loading. These findings provide a suitable
basis for extensions towards laminated plates and glass layer fracture, owing
to the modular format of layerwise theories.
","[{'version': 'v1', 'created': 'Fri, 13 Jan 2017 11:53:56 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Jun 2017 12:09:07 GMT'}]",2017-12-11,"[['Zemanová', 'Alena', ''], ['Zeman', 'Jan', ''], ['Šejnoha', 'Michal', '']]","['Laminated glass', 'finite element method', 'finite strain Reissner model', 'von K´arm´anassumptions', 'generalized Maxwell model', 'Williams-Landel-Ferry equation']"
3427,1707.08739,EPTCS,"Emiliano Catonini (Higher School of Economics, Moscow)",Rationalizability and Epistemic Priority Orderings,"In Proceedings TARK 2017, arXiv:1707.08250","EPTCS 251, 2017, pp. 102-117",10.4204/EPTCS.251.8,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  At the beginning of a dynamic game, players may have exogenous theories about
how the opponents are going to play. Suppose that these theories are commonly
known. Then, players will refine their first-order beliefs, and challenge their
own theories, through strategic reasoning. I develop and characterize
epistemically a new solution concept, Selective Rationalizability, which
accomplishes this task under the following assumption: when the observed
behavior is not compatible with the beliefs in players' rationality and
theories of all orders, players keep the orders of belief in rationality that
are per se compatible with the observed behavior, and drop the incompatible
beliefs in the theories. Thus, Selective Rationalizability captures Common
Strong Belief in Rationality (Battigalli and Siniscalchi, 2002) and refines
Extensive-Form Rationalizability (Pearce, 1984; BS, 2002), whereas
Strong-$\Delta$-Rationalizability (Battigalli, 2003; Battigalli and
Siniscalchi, 2003) captures the opposite epistemic priority choice. Selective
Rationalizability can be extended to encompass richer epistemic priority
orderings among different theories of opponents' behavior. This allows to
establish a surprising connection with strategic stability (Kohlberg and
Mertens, 1986).
","[{'version': 'v1', 'created': 'Thu, 27 Jul 2017 07:46:53 GMT'}]",2017-07-28,"[['Catonini', 'Emiliano', '', 'Higher School of Economics, Moscow']]","['Forward induction', 'Strong Belief', 'Strong Rationalizability', 'Strong-∆-Rationalizability', 'Strategic Stability']"
3428,1309.5067,Abdoulaye Tall,"Abdoulaye Tall, Richard Combes, Zwi Altman and Eitan Altman","Distributed coordination of self-organizing mechanisms in communication
  networks","submitted to IEEE TCNS. arXiv admin note: substantial text overlap
  with arXiv:1209.1236",,10.1109/TCNS.2014.2357511,,cs.NI cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The fast development of the Self-Organizing Network (SON) technology in
mobile networks renders the problem of coordinating SON functionalities
operating simultaneously critical. SON functionalities can be viewed as control
loops that may need to be coordinated to guarantee conflict free operation, to
enforce stability of the network and to achieve performance gain. This paper
proposes a distributed solution for coordinating SON functionalities. It uses
Rosen's concave games framework in conjunction with convex optimization. The
SON functionalities are modeled as linear Ordinary Differential Equation
(ODE)s. The stability of the system is first evaluated using a basic control
theory approach. The coordination solution consists in finding a linear map
(called coordination matrix) that stabilizes the system of SON functionalities.
It is proven that the solution remains valid in a noisy environment using
Stochastic Approximation. A practical example involving three different SON
functionalities deployed in Base Stations (BSs) of a Long Term Evolution (LTE)
network demonstrates the usefulness of the proposed method.
","[{'version': 'v1', 'created': 'Thu, 19 Sep 2013 18:22:55 GMT'}]",2016-11-17,"[['Tall', 'Abdoulaye', ''], ['Combes', 'Richard', ''], ['Altman', 'Zwi', ''], ['Altman', 'Eitan', '']]","['Self-Organizing Networks', 'Concave Games', 'SONCoordination', 'Stochastic Approximation']"
3429,0810.3442,Adam Lipowski,Adam Lipowski and Dorota Lipowska,Language structure in the n-object naming game,minor changes,"Phys. Rev. E 80, 056107 (2009)",10.1103/PhysRevE.80.056107,,cs.CL cs.MA physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We examine a naming game with two agents trying to establish a common
vocabulary for n objects. Such efforts lead to the emergence of language that
allows for an efficient communication and exhibits some degree of homonymy and
synonymy. Although homonymy reduces the communication efficiency, it seems to
be a dynamical trap that persists for a long, and perhaps indefinite, time. On
the other hand, synonymy does not reduce the efficiency of communication, but
appears to be only a transient feature of the language. Thus, in our model the
role of synonymy decreases and in the long-time limit it becomes negligible. A
similar rareness of synonymy is observed in present natural languages. The role
of noise, that distorts the communicated words, is also examined. Although, in
general, the noise reduces the communication efficiency, it also regroups the
words so that they are more evenly distributed within the available ""verbal""
space.
","[{'version': 'v1', 'created': 'Sun, 19 Oct 2008 23:59:37 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Nov 2009 18:15:28 GMT'}]",2015-05-13,"[['Lipowski', 'Adam', ''], ['Lipowska', 'Dorota', '']]","['naming game', 'language evolution', 'noise']"
3430,2102.11434,Saber Kazeminasab,"Saber Kazeminasab, Vahid Janfaza, Moein Razavi, and M. Katherine Banks","Smart Navigation for In-pipe Robots with Multi-phase Motion Control and
  Particle Filter",,"2021 IEEE International Conference on Electro Information
  Technology (EIT), (2021) 342-349",10.1109/EIT51626.2021.9491887,,cs.RO cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  In-pipe robots are promising solutions for condition assessment, leak
detection, water quality monitoring in a variety of other tasks in pipeline
networks. Smart navigation is an extremely challenging task for these robots as
a result of highly uncertain and disturbing environment for operation. Wireless
communication to control these robots during operation is not feasible if the
pipe material is metal since the radio signals are destroyed in the pipe
environment, and hence, this challenge is still unsolved. In this paper, we
introduce a method for smart navigation for our previously designed in-pipe
robot [1] based on particle filtering and a two-phase motion controller. The
robot is given the map of the operation path with a novel approach and the
particle filtering determines the straight and non-straight configurations of
the pipeline. In the straight paths, the robot follows a linear quadratic
regulator (LQR) and proportional-integral-derivative (PID) based controller
that stabilizes the robot and tracks a desired velocity. In non-straight paths,
the robot follows the trajectory that a motion trajectory generator block plans
for the robot. The proposed method is a promising solution for smart navigation
without the need for wireless communication and capable of inspecting long
distances in water distribution systems.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2021 00:41:45 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Sep 2021 00:44:35 GMT'}, {'version': 'v3', 'created': 'Wed, 1 Dec 2021 20:43:33 GMT'}]",2021-12-03,"[['Kazeminasab', 'Saber', ''], ['Janfaza', 'Vahid', ''], ['Razavi', 'Moein', ''], ['Banks', 'M. Katherine', '']]","['Particle Filtering', 'Smart Navigation', 'Motion']"
3431,1908.01344,Lesandro Ponciano,Lesandro Ponciano and Thiago Emmanuel Pereira,"Characterising Volunteers' Task Execution Patterns Across Projects on
  Multi-Project Citizen Science Platforms","XVIII Brazilian Symposium on Human Factors in Computing Systems
  (IHC'19), October 21-25, 2019, Vit\'oria, ES, Brazil","In Proceedings of IHC 2019. ACM, US. 11 pages (2019)",10.1145/3357155.3358441,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Citizen science projects engage people in activities that are part of a
scientific research effort. On multi-project citizen science platforms,
scientists can create projects consisting of tasks. Volunteers, in turn,
participate in executing the project's tasks. Such type of platforms seeks to
connect volunteers and scientists' projects, adding value to both. However,
little is known about volunteer's cross-project engagement patterns and the
benefits of such patterns for scientists and volunteers. This work proposes a
Goal, Question, and Metric (GQM) approach to analyse volunteers' cross-project
task execution patterns and employs the Semiotic Inspection Method (SIM) to
analyse the communicability of the platform's cross-project features. In doing
so, it investigates what are the features of platforms to foster volunteers'
cross-project engagement, to what extent multi-project platforms facilitate the
attraction of volunteers to perform tasks in new projects, and to what extent
multi-project participation increases engagement on the platforms. Results from
analyses on real platforms show that volunteers tend to explore multiple
projects, but they perform tasks regularly in just a few of them; few projects
attract much attention from volunteers; volunteers recruited from other
projects on the platform tend to get more engaged than those recruited outside
the platform. System inspection shows that platforms still lack personalised
and explainable recommendations of projects and tasks. The findings are
translated into useful claims about how to design and manage multi-project
platforms.
","[{'version': 'v1', 'created': 'Sun, 4 Aug 2019 14:00:49 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Aug 2019 01:07:07 GMT'}, {'version': 'v3', 'created': 'Wed, 9 Oct 2019 04:29:55 GMT'}]",2019-10-10,"[['Ponciano', 'Lesandro', ''], ['Pereira', 'Thiago Emmanuel', '']]","['citizen science', 'human computation', 'engagement', 'projects', 'GQM']"
3432,1902.02560,Ermin Sakic,"Ermin Sakic, Nemanja {\DH}eri\'c, Wolfgang Kellerer","MORPH: An Adaptive Framework for Efficient and Byzantine Fault-Tolerant
  SDN Control Plane",,"IEEE Journal on Selected Areas in Communications ( Volume: 36 ,
  Issue: 10 , Oct. 2018 )",10.1109/JSAC.2018.2869938,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current approaches to tackle the single point of failure in SDN entail a
distributed operation of SDN controller instances. Their state synchronization
process is reliant on the assumption of a correct decision-making in the
controllers. Successful introduction of SDN in the critical infrastructure
networks also requires catering to the issue of unavailable, unreliable (e.g.
buggy), and malicious controller failures. We propose MORPH, a framework
tolerant to unavailability and Byzantine failures, which distinguishes and
localizes faulty controller instances and appropriately reconfigures the
control plane. Our controller-switch connection assignment leverages the
awareness of the source of failure to optimize the number of active controllers
and minimize the controller and switch reconfiguration delays. The proposed
re-assignment executes dynamically after each successful failure
identification. We require 2FM + FA +1 controllers to tolerate FM malicious and
FA availability-induced failures. After a successful detection of FM malicious
controllers, MORPH reconfigures the control plane to require a single
controller message to forward the system state. Moreover, we outline and
present a solution to the practical correctness issues related to the
statefulness of the distributed SDN controller applications, previously ignored
in the literature. We base our performance analysis on a resource-aware routing
application, deployed in an emulated testbed comprising up to 16 controllers
and up to 34 switches, so to tolerate up to 5 unique Byzantine and additional 5
availability-induced controller failures (a total of 10 unique controller
failures). We quantify and highlight the dynamic decrease in the packet and CPU
load and the response time after each successful failure detection.
","[{'version': 'v1', 'created': 'Thu, 7 Feb 2019 10:42:56 GMT'}]",2019-02-08,"[['Sakic', 'Ermin', ''], ['Ðerić', 'Nemanja', ''], ['Kellerer', 'Wolfgang', '']]","['Byzantine fault tolerance', 'SDN', 'distributedcontrol plane', 'reliability', 'availability', 'empirical study']"
3433,1702.08379,Paul Jaeger,"Paul Jaeger, Sebastian Bickelhaupt, Frederik Bernd Laun, Wolfgang
  Lederer, Daniel Heidi, Tristan Anselm Kuder, Daniel Paech, David Bonekamp,
  Alexander Radbruch, Stefan Delorme, Heinz-Peter Schlemmer, Franziska Steudle
  and Klaus H. Maier-Hein",Revealing Hidden Potentials of the q-Space Signal in Breast Cancer,Accepted conference paper at MICCAI 2017,,10.1007/978-3-319-66182-7_76,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mammography screening for early detection of breast lesions currently suffers
from high amounts of false positive findings, which result in unnecessary
invasive biopsies. Diffusion-weighted MR images (DWI) can help to reduce many
of these false-positive findings prior to biopsy. Current approaches estimate
tissue properties by means of quantitative parameters taken from generative,
biophysical models fit to the q-space encoded signal under certain assumptions
regarding noise and spatial homogeneity. This process is prone to fitting
instability and partial information loss due to model simplicity. We reveal
unexplored potentials of the signal by integrating all data processing
components into a convolutional neural network (CNN) architecture that is
designed to propagate clinical target information down to the raw input images.
This approach enables simultaneous and target-specific optimization of image
normalization, signal exploitation, global representation learning and
classification. Using a multicentric data set of 222 patients, we demonstrate
that our approach significantly improves clinical decision making with respect
to the current state of the art.
","[{'version': 'v1', 'created': 'Mon, 27 Feb 2017 17:06:20 GMT'}, {'version': 'v2', 'created': 'Wed, 17 May 2017 09:02:54 GMT'}, {'version': 'v3', 'created': 'Mon, 22 May 2017 08:14:59 GMT'}]",2017-11-30,"[['Jaeger', 'Paul', ''], ['Bickelhaupt', 'Sebastian', ''], ['Laun', 'Frederik Bernd', ''], ['Lederer', 'Wolfgang', ''], ['Heidi', 'Daniel', ''], ['Kuder', 'Tristan Anselm', ''], ['Paech', 'Daniel', ''], ['Bonekamp', 'David', ''], ['Radbruch', 'Alexander', ''], ['Delorme', 'Stefan', ''], ['Schlemmer', 'Heinz-Peter', ''], ['Steudle', 'Franziska', ''], ['Maier-Hein', 'Klaus H.', '']]","['q-Space Imaging', 'Diffusion Imaging', 'Deep Learning', 'Diffusion Kurtosis Imaging', 'Lesion Classification', 'Convolutional Networks']"
3434,1109.0428,Leghmizi  Said,Said Leghmizi and Sheng Liu,A survey of fuzzy control for stabilized platforms,,"International Journal of Computer Science & Engineering Survey
  (IJCSES) Vol.2, No.3, August 2011",10.5121/ijcses.2011.2304,,cs.SY,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper focusses on the application of fuzzy control techniques (fuzzy
type-1 and type-2) and their hybrid forms (Hybrid adaptive fuzzy controller and
fuzzy-PID controller) in the area of stabilized platforms. It represents an
attempt to cover the basic principles and concepts of fuzzy control in
stabilization and position control, with an outline of a number of recent
applications used in advanced control of stabilized platform. Overall, in this
survey we will make some comparisons with the classical control techniques such
us PID control to demonstrate the advantages and disadvantages of the
application of fuzzy control techniques.
","[{'version': 'v1', 'created': 'Fri, 2 Sep 2011 12:38:39 GMT'}]",2011-09-05,"[['Leghmizi', 'Said', ''], ['Liu', 'Sheng', '']]","['Fuzzy control', 'PID control', 'Stabilized Platforms']"
3435,0709.0170,Alexander Wolff,"Xavier Goaoc and Jan Kratochvil and Yoshio Okamoto and Chan-Su Shin
  and Andreas Spillner and Alexander Wolff",Untangling a Planar Graph,"(v5) Minor, mostly linguistic changes",,10.1007/s00454-008-9130-6,,cs.CG cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A straight-line drawing $\delta$ of a planar graph $G$ need not be plane, but
can be made so by \emph{untangling} it, that is, by moving some of the vertices
of $G$. Let shift$(G,\delta)$ denote the minimum number of vertices that need
to be moved to untangle $\delta$. We show that shift$(G,\delta)$ is NP-hard to
compute and to approximate. Our hardness results extend to a version of
\textsc{1BendPointSetEmbeddability}, a well-known graph-drawing problem.
  Further we define fix$(G,\delta)=n-shift(G,\delta)$ to be the maximum number
of vertices of a planar $n$-vertex graph $G$ that can be fixed when untangling
$\delta$. We give an algorithm that fixes at least $\sqrt{((\log n)-1)/\log
\log n}$ vertices when untangling a drawing of an $n$-vertex graph $G$. If $G$
is outerplanar, the same algorithm fixes at least $\sqrt{n/2}$ vertices. On the
other hand we construct, for arbitrarily large $n$, an $n$-vertex planar graph
$G$ and a drawing $\delta_G$ of $G$ with fix$(G,\delta_G) \le \sqrt{n-2}+1$ and
an $n$-vertex outerplanar graph $H$ and a drawing $\delta_H$ of $H$ with
fix$(H,\delta_H) \le 2 \sqrt{n-1}+1$. Thus our algorithm is asymptotically
worst-case optimal for outerplanar graphs.
","[{'version': 'v1', 'created': 'Mon, 3 Sep 2007 08:59:34 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Feb 2008 08:46:19 GMT'}, {'version': 'v3', 'created': 'Thu, 6 Nov 2008 21:53:18 GMT'}, {'version': 'v4', 'created': 'Wed, 12 Nov 2008 13:15:12 GMT'}, {'version': 'v5', 'created': 'Tue, 27 Jan 2009 21:38:25 GMT'}]",2009-01-27,"[['Goaoc', 'Xavier', ''], ['Kratochvil', 'Jan', ''], ['Okamoto', 'Yoshio', ''], ['Shin', 'Chan-Su', ''], ['Spillner', 'Andreas', ''], ['Wolff', 'Alexander', '']]","['Graph drawing', 'straight-line drawing', 'planarity', 'NP-hardness', 'hardness of approximation', 'moving vertices', 'untangling', 'point-set embeddability']"
3436,1006.1433,EPTCS,Beno\^it Valiron,Semantics of a Typed Algebraic Lambda-Calculus,,"EPTCS 26, 2010, pp. 147-158",10.4204/EPTCS.26.14,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Algebraic lambda-calculi have been studied in various ways, but their
semantics remain mostly untouched. In this paper we propose a semantic analysis
of a general simply-typed lambda-calculus endowed with a structure of vector
space. We sketch the relation with two established vectorial lambda-calculi.
Then we study the problems arising from the addition of a fixed point
combinator and how to modify the equational theory to solve them. We sketch an
algebraic vectorial PCF and its possible denotational interpretations.
","[{'version': 'v1', 'created': 'Tue, 8 Jun 2010 01:16:56 GMT'}]",2010-06-09,"[['Valiron', 'Benoît', '']]","['typed lambda-calculus', 'module over ring and semi-ring', 'fixpoints', 'semantics', 'computational model']"
3437,1907.12455,Zhipeng Xu,Zhipeng Xu and Xiaolong Huang and Fabian Jimenez and Yuefan Deng,A new record of graph enumeration enabled by parallel processing,,"Mathematics (MDPI), 7(12), 1214(2019)",10.3390/math7121214,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using three supercomputers, we broke a record set in 2011, in the enumeration
of non-isomorphic regular graphs by expanding the sequence of A006820 in Online
Encyclopedia of Integer Sequences (OEIS), to achieve the number for 4-regular
graphs of order 23 as 429,668,180,677,439, while discovering serval optimal
regular graphs with minimum average shortest path lengths (ASPL) that can be
used as interconnection networks for parallel computers. The number of
4-regular graphs and the optimal graphs, extremely time-consuming to calculate,
result from a method we adapt from GENREG, a classical regular graph generator,
to fit for supercomputers' strengths of using thousands of processor cores.
","[{'version': 'v1', 'created': 'Mon, 29 Jul 2019 14:28:49 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Aug 2019 21:44:56 GMT'}, {'version': 'v3', 'created': 'Thu, 29 Aug 2019 20:24:26 GMT'}, {'version': 'v4', 'created': 'Fri, 13 Sep 2019 22:04:22 GMT'}, {'version': 'v5', 'created': 'Wed, 23 Oct 2019 22:37:17 GMT'}]",2019-12-11,"[['Xu', 'Zhipeng', ''], ['Huang', 'Xiaolong', ''], ['Jimenez', 'Fabian', ''], ['Deng', 'Yuefan', '']]","['Regular graph', 'parallel computing', 'dynamical scheduling']"
3438,1310.2365,Dhanamma Jagli,"Mrs.Dhanamma Jagli, Mrs.Rohini Temkar",The Unified Approach For Organizational Network Vulnerability Assessment,"12 pages,5Figures","International Journal of Software Engineering & Applications
  (IJSEA),Vol.4, No.5, September 2013",10.5121/ijsea.2013.4503,,cs.SE,http://creativecommons.org/licenses/by/3.0/,"  The present business network infrastructure is quickly varying with latest
servers, services, connections, and ports added often, at times day by day, and
with a uncontrollably inflow of laptops, storage media and wireless networks.
With the increasing amount of vulnerabilities and exploits coupled with the
recurrent evolution of IT infrastructure, organizations at present require more
numerous vulnerability assessments. In this paper new approach the Unified
process for Network vulnerability Assessments hereafter called as a unified NVA
is proposed for network vulnerability assessment derived from Unified Software
Development Process or Unified Process, it is a popular iterative and
incremental software development process framework.
","[{'version': 'v1', 'created': 'Wed, 9 Oct 2013 06:08:38 GMT'}]",2013-10-10,"[['Jagli', 'Mrs. Dhanamma', ''], ['Temkar', 'Mrs. Rohini', '']]","['Network vulvernability', 'object oriented modelin', 'UML', 'Unified process']"
3439,2106.00102,Michal Kompan,"Juraj Visnovsky, Ondrej Kassak, Michal Kompan, Maria Bielikova",The Cold-start Problem: Minimal Users' Activity Estimation,"1st Workshop on Recommender Systems for Television and online Video
  (RecSysTV) in conjunction with 8th ACM Conference on Recommender Systems,
  2014","1st Workshop on Recommender Systems for Television and online
  Video (RecSysTV) in conjunction with 8th ACM Conference on Recommender
  Systems, 2014",,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Cold-start problem, which arises upon the new users arrival, is one of the
fundamental problems in today's recommender approaches. Moreover, in some
domains as TV or multime-dia-items take long time to experience by users, thus
users usually do not provide rich preference information. In this paper we
analyze the minimal amount of ratings needs to be done by a user over a set of
items, in order to solve or reduce the cold-start problem. In our analysis we
applied clustering data mining technique in order to identify minimal amount of
item's ratings required from recommender system's users, in order to be
assigned to a correct cluster. In this context, cluster quality is being
monitored and in case of reaching certain cluster quality threshold, the
rec-ommender system could start to generate recommendations for given user, as
in this point cold-start problem is considered as resolved. Our proposed
approach is applicable to any domain in which user preferences are received
based on explicit items rating. Our experiments are performed within the movie
and jokes recommendation domain using the MovieLens and Jester dataset.
","[{'version': 'v1', 'created': 'Mon, 31 May 2021 21:09:23 GMT'}]",2021-06-15,"[['Visnovsky', 'Juraj', ''], ['Kassak', 'Ondrej', ''], ['Kompan', 'Michal', ''], ['Bielikova', 'Maria', '']]","['Clustering', 'cold-start problem', 'k-means algorithm', 'collaborative filtering', 'item rating']"
3440,1812.02496,David Robben,"David Robben, Anna M.M. Boers, Henk A. Marquering, Lucianne L.C.M.
  Langezaal, Yvo B.W.E.M. Roos, Robert J. van Oostenbrugge, Wim H. van Zwam,
  Diederik W.J. Dippel, Charles B.L.M. Majoie, Aad van der Lugt, Robin Lemmens,
  Paul Suetens","Prediction of final infarct volume from native CT perfusion and
  treatment parameters using deep learning",Accepted for publication in Medical Image Analysis,,10.1016/j.media.2019.101589,,cs.CV physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CT Perfusion (CTP) imaging has gained importance in the diagnosis of acute
stroke. Conventional perfusion analysis performs a deconvolution of the
measurements and thresholds the perfusion parameters to determine the tissue
status. We pursue a data-driven and deconvolution-free approach, where a deep
neural network learns to predict the final infarct volume directly from the
native CTP images and metadata such as the time parameters and treatment. This
would allow clinicians to simulate various treatments and gain insight into
predicted tissue status over time. We demonstrate on a multicenter dataset that
our approach is able to predict the final infarct and effectively uses the
metadata. An ablation study shows that using the native CTP measurements
instead of the deconvolved measurements improves the prediction.
","[{'version': 'v1', 'created': 'Thu, 6 Dec 2018 12:34:18 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Oct 2019 12:21:53 GMT'}]",2019-10-21,"[['Robben', 'David', ''], ['Boers', 'Anna M. M.', ''], ['Marquering', 'Henk A.', ''], ['Langezaal', 'Lucianne L. C. M.', ''], ['Roos', 'Yvo B. W. E. M.', ''], ['van Oostenbrugge', 'Robert J.', ''], ['van Zwam', 'Wim H.', ''], ['Dippel', 'Diederik W. J.', ''], ['Majoie', 'Charles B. L. M.', ''], ['van der Lugt', 'Aad', ''], ['Lemmens', 'Robin', ''], ['Suetens', 'Paul', '']]","['Stroke', 'CT Perfusion', 'Final Infarct Prediction', 'Deep Learning']"
3441,1601.00455,Andrew Adamatzky,Ramon Alonso-Sanz and Andrew Adamatzky,Actin automata with memory,"Accepted for publication in ""International Journal of Bifurcation and
  Chaos""",,10.1142/S021812741650019X,,cs.ET nlin.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Actin is a globular protein which forms long polar filaments in eukaryotic.
The actin filaments play roles of cytoskeleton, motility units , information
processing and learning. We model actin filament as a double chain of finite
state machines, nodes, which take states `0' and `1'. The states are
abstractions of absence and presence of a sub-threshold charge on an actin
units corresponding to the nodes. All nodes update their state in parallel in
discrete time. A node updates its current state depending on states of two
closest neighbours in the node chain and two closest neighbours in the
complementary chain. Previous models of actin automata considered momentary
state transitions of nodes. We enrich the actin automata model by assuming that
states of nodes depends not only on the current states of neighbouring node but
also on their past states. Thus, we assess the effect of memory of past states
on the dynamics of acting automata. We demonstrate in computational experiments
that memory slows down propagation of perturbations, decrease entropy of
space-time patterns generated, transforms travelling localisations to
stationary oscillators, and stationary oscillations to still patterns.
","[{'version': 'v1', 'created': 'Mon, 4 Jan 2016 11:24:53 GMT'}]",2016-03-23,"[['Alonso-Sanz', 'Ramon', ''], ['Adamatzky', 'Andrew', '']]","['Actin', 'automata', 'polymers', 'dynamics', 'memory']"
3442,1305.3978,Puneet Kumar Mr.,"Puneet Kumar, Dharminder Kumar","A Conceptual E-Governance Framework for Improving Child Immunization
  Process in India",Published with International Journal of Computer Applications (IJCA),"Puneet Kumar, Dharminder Kumar. Article: A Conceptual E-Governance
  Framework, International Journal of Computer Applications 69(1):39-43, May
  2013. Published by Foundation of Computer Science, New York, USA",10.5120/11808-7464,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  India is country having high population and great variations in the
educational level, economic conditions, population densities, cultures and
awareness levels. Due to these variations the immunization process is not so
much successful as per expectations of the state and central governments. In
some zones the significant amount of vaccines are wasted whereas some are
running out of vaccines. One of the reasons for such an imbalance is improper
quantity estimation of vaccines in a particular zone. Further a huge amount of
liquidity will be wasted in the form of vaccines. If we inculcate ICT
(Information and Communication Technology) in the process of immunization then
the problem can be rectified to some extent and hence we are proposing a
conceptual model using ICT to improve the process of vaccination.
","[{'version': 'v1', 'created': 'Fri, 17 May 2013 04:46:02 GMT'}]",2013-05-20,"[['Kumar', 'Puneet', ''], ['Kumar', 'Dharminder', '']]","['ICT', 'e-Governance', 'UIDAI', 'e-health', 'health care', 'PCTNS']"
3443,1707.05828,Maria Van Der Walt,"H.N. Mhaskar, S.V. Pereverzyev and M.D. van der Walt",A deep learning approach to diabetic blood glucose prediction,,"Front. Appl. Math. Stat., 14 July 2017",10.3389/fams.2017.00014,,cs.LG math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the question of 30-minute prediction of blood glucose levels
measured by continuous glucose monitoring devices, using clinical data. While
most studies of this nature deal with one patient at a time, we take a certain
percentage of patients in the data set as training data, and test on the
remainder of the patients; i.e., the machine need not re-calibrate on the new
patients in the data set. We demonstrate how deep learning can outperform
shallow networks in this example. One novelty is to demonstrate how a
parsimonious deep representation can be constructed using domain knowledge.
","[{'version': 'v1', 'created': 'Tue, 18 Jul 2017 19:21:29 GMT'}]",2017-07-20,"[['Mhaskar', 'H. N.', ''], ['Pereverzyev', 'S. V.', ''], ['van der Walt', 'M. D.', '']]","['deep learning', 'deep neural network', 'diffusion geometry', 'continuousglucose monitoring', 'blood glucose prediction']"
3444,1808.07276,Haodong Li,Haodong Li and Bin Li and Shunquan Tan and Jiwu Huang,"Identification of Deep Network Generated Images Using Disparities in
  Color Components","Published in Signal Processing. Please cite: H. Li, B. Li, S. Tan, J.
  Huang, Identification of Deep Network Generated Images Using Disparities in
  Color Components, Signal Processing, Signal Processing 174 (2020) 107616",Signal Processing 174 (2020) 107616,10.1016/j.sigpro.2020.107616,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the powerful deep network architectures, such as generative adversarial
networks, one can easily generate photorealistic images. Although the generated
images are not dedicated for fooling human or deceiving biometric
authentication systems, research communities and public media have shown great
concerns on the security issues caused by these images. This paper addresses
the problem of identifying deep network generated (DNG) images. Taking the
differences between camera imaging and DNG image generation into
considerations, we analyze the disparities between DNG images and real images
in different color components. We observe that the DNG images are more
distinguishable from real ones in the chrominance components, especially in the
residual domain. Based on these observations, we propose a feature set to
capture color image statistics for identifying DNG images. Additionally, we
evaluate several detection situations, including the training-testing data are
matched or mismatched in image sources or generative models and detection with
only real images. Extensive experimental results show that the proposed method
can accurately identify DNG images and outperforms existing methods when the
training and testing data are mismatched. Moreover, when the GAN model is
unknown, our methods also achieves good performance with one-class
classification by using only real images for training.
","[{'version': 'v1', 'created': 'Wed, 22 Aug 2018 08:38:11 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Feb 2019 04:53:14 GMT'}, {'version': 'v3', 'created': 'Mon, 31 Aug 2020 02:12:53 GMT'}]",2020-09-01,"[['Li', 'Haodong', ''], ['Li', 'Bin', ''], ['Tan', 'Shunquan', ''], ['Huang', 'Jiwu', '']]","['Image generative model', 'generative adversarial networks', 'fakeimage identification', 'color disparities', 'statistical feature']"
3445,1511.08592,Fabrizio Montecchiani,"Therese Biedl, Giuseppe Liotta, Fabrizio Montecchiani",On Visibility Representations of Non-planar Graphs,,,10.1007/s00454-017-9939-y,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A rectangle visibility representation (RVR) of a graph consists of an
assignment of axis-aligned rectangles to vertices such that for every edge
there exists a horizontal or vertical line of sight between the rectangles
assigned to its endpoints. Testing whether a graph has an RVR is known to be
NP-hard. In this paper, we study the problem of finding an RVR under the
assumption that an embedding in the plane of the input graph is fixed and we
are looking for an RVR that reflects this embedding. We show that in this case
the problem can be solved in polynomial time for general embedded graphs and in
linear time for 1-plane graphs (i.e., embedded graphs having at most one
crossing per edge). The linear time algorithm uses a precise list of forbidden
configurations, which extends the set known for straight-line drawings of
1-plane graphs. These forbidden configurations can be tested for in linear
time, and so in linear time we can test whether a 1-plane graph has an RVR and
either compute such a representation or report a negative witness. Finally, we
discuss some extensions of our study to the case when the embedding is not
fixed but the RVR can have at most one crossing per edge.
","[{'version': 'v1', 'created': 'Fri, 27 Nov 2015 09:44:17 GMT'}]",2019-09-04,"[['Biedl', 'Therese', ''], ['Liotta', 'Giuseppe', ''], ['Montecchiani', 'Fabrizio', '']]","['Visibility Representations', '1-Planarity', 'Recognition Algorithm', 'Forbidden Configurationor']"
3446,1611.06620,Richard Oentaryo,"Jovian Lin, Richard J. Oentaryo, Ee-Peng Lim, Casey Vu, Adrian Vu,
  Agus T. Kwee, Philips K. Prasetyo","A Business Zone Recommender System Based on Facebook and Urban Planning
  Data",,"Proceedings of the European Conference on Information Retrieval,
  2016, pp. 641-647",10.1007/978-3-319-30671-1_47,,cs.SI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present ZoneRec---a zone recommendation system for physical businesses in
an urban city, which uses both public business data from Facebook and urban
planning data. The system consists of machine learning algorithms that take in
a business' metadata and outputs a list of recommended zones to establish the
business in. We evaluate our system using data of food businesses in Singapore
and assess the contribution of different feature groups to the recommendation
quality.
","[{'version': 'v1', 'created': 'Mon, 21 Nov 2016 00:47:44 GMT'}]",2016-11-22,"[['Lin', 'Jovian', ''], ['Oentaryo', 'Richard J.', ''], ['Lim', 'Ee-Peng', ''], ['Vu', 'Casey', ''], ['Vu', 'Adrian', ''], ['Kwee', 'Agus T.', ''], ['Prasetyo', 'Philips K.', '']]","['Facebook', 'social media', 'business', 'location recommendation']"
3447,1502.05145,Inga Ivanova,Inga Ivanova and Loet Leydesdorff,"Knowledge-generating Efficiency in Innovation Systems: The relation
  between structural and temporal effects",,Technological Forecasting and Social Change 96 (July 2015) 254-265,10.1016/j.techfore.2015.04.001,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using time series of US patents per million inhabitants, knowledge-generating
cycles can be distinguished. These cycles partly coincide with Kondratieff long
waves. The changes in the slopes between them indicate discontinuities in the
knowledge-generating paradigms. The knowledge-generating paradigms can be
modeled in terms of interacting dimensions (for example, in
university-industry-government relations) that set limits to the maximal
efficiency of innovation systems. The maximum values of the parameters in the
model are of the same order as the regression coefficients of the empirical
waves. The mechanism of the increase in the dimensionality is specified as
self-organization which leads to the breaking of existing relations into the
more diversified structure of a fractal-like network. This breaking can be
modeled in analogy to 2D and 3D (Koch) snowflakes. The boost of knowledge
generation leads to newly emerging technologies that can be expected to be more
diversified and show shorter life cycles than before. Time spans of the
knowledge-generating cycles can also be analyzed in terms of Fibonacci numbers.
This perspective allows for forecasting expected dates of future possible
paradigm changes. In terms of policy implications, this suggests a shift in
focus from the manufacturing technologies to developing new organizational
technologies and formats of human interactions
","[{'version': 'v1', 'created': 'Wed, 18 Feb 2015 07:52:48 GMT'}]",2019-12-18,"[['Ivanova', 'Inga', ''], ['Leydesdorff', 'Loet', '']]","['knowledge generation', 'cycles', 'efficiency analysis', 'fractal', 'Fibonacci numbers', 'forecast']"
3448,1612.08234,Mohammad Reza Hooshmandasl,M. Rajaati and M. R. Hooshmandasl and M. J. Dinneen and A. Shakiba,"On fixed-parameter tractability of the mixed domination problem for
  graphs with bounded tree-width","Accepted for the publication in the Journal of Discrete Mathematics &
  Theoretical Computer Science (DMTCS). 25 pages, 4 figures, 17 tables, 4
  algorithms","Discrete Mathematics & Theoretical Computer Science, vol. 20 no.
  2, Graph Theory (July 31, 2018) dmtcs:4686",10.23638/DMTCS-20-2-2,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A mixed dominating set for a graph $G = (V,E)$ is a set $S\subseteq V \cup E$
such that every element $x \in (V \cup E) \backslash S$ is either adjacent or
incident to an element of $S$. The mixed domination number of a graph $G$,
denoted by $\gamma_m(G)$, is the minimum cardinality of mixed dominating sets
of $G$. Any mixed dominating set with the cardinality of $\gamma_m(G)$ is
called a minimum mixed dominating set. The mixed domination set (MDS) problem
is to find a minimum mixed dominating set for a graph $G$ and is known to be an
NP-complete problem. In this paper, we present a novel approach to find all of
the mixed dominating sets, called the AMDS problem, of a graph with bounded
tree-width $tw$. Our new technique of assigning power values to edges and
vertices, and combining with dynamic programming, leads to a fixed-parameter
algorithm of time $O(3^{tw^{2}}\times tw^2 \times |V|)$. This shows that MDS is
fixed-parameter tractable with respect to tree-width. In addition, we
theoretically improve the proposed algorithm to solve the MDS problem in
$O(6^{tw} \times |V|)$ time.
","[{'version': 'v1', 'created': 'Sun, 25 Dec 2016 04:14:24 GMT'}, {'version': 'v2', 'created': 'Tue, 22 May 2018 05:51:34 GMT'}, {'version': 'v3', 'created': 'Sat, 14 Jul 2018 17:22:15 GMT'}]",2019-03-14,"[['Rajaati', 'M.', ''], ['Hooshmandasl', 'M. R.', ''], ['Dinneen', 'M. J.', ''], ['Shakiba', 'A.', '']]","['Mixed Domination', 'Tree decomposition', 'Tree-width', 'Fixed-parameter tractable']"
3449,1507.05033,Alejandro Frery,Luis Gomez and Luis Alvarez and Luis Mazorra and Alejandro C. Frery,"Classification of Complex Wishart Matrices with a Diffusion-Reaction
  System guided by Stochastic Distances",Accepted for publication in Philosophical Transactions A,,10.1098/rsta.2015.0118,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new method for PolSAR (Polarimetric Synthetic Aperture Radar)
imagery classification based on stochastic distances in the space of random
matrices obeying complex Wishart distributions. Given a collection of
prototypes $\{Z_m\}_{m=1}^M$ and a stochastic distance $d(.,.)$, we classify
any random matrix $X$ using two criteria in an iterative setup. Firstly, we
associate $X$ to the class which minimizes the weighted stochastic distance
$w_md(X,Z_m)$, where the positive weights $w_m$ are computed to maximize the
class discrimination power. Secondly, we improve the result by embedding the
classification problem into a diffusion-reaction partial differential system
where the diffusion term smooths the patches within the image, and the reaction
term tends to move the pixel values towards the closest class prototype. In
particular, the method inherits the benefits of speckle reduction by
diffusion-like methods. Results on synthetic and real PolSAR data show the
performance of the method.
","[{'version': 'v1', 'created': 'Fri, 17 Jul 2015 17:10:47 GMT'}]",2016-02-17,"[['Gomez', 'Luis', ''], ['Alvarez', 'Luis', ''], ['Mazorra', 'Luis', ''], ['Frery', 'Alejandro C.', '']]","['PolSAR images', 'Classification', 'Diffusion-Reaction system']"
3450,1707.03717,Amanda Ramcharan,"Amanda Ramcharan, Kelsee Baranowski, Peter McCloskey, Babuali Ahmed,
  James Legg, and David Hughes",Using Transfer Learning for Image-Based Cassava Disease Detection,"10 pages, 4 figures",Frontiers in Plant Science 2017 vol. 8 p. 1852,10.3389/fpls.2017.01852,,cs.CV cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cassava is the third largest source of carbohydrates for human food in the
world but is vulnerable to virus diseases, which threaten to destabilize food
security in sub-Saharan Africa. Novel methods of cassava disease detection are
needed to support improved control which will prevent this crisis. Image
recognition offers both a cost effective and scalable technology for disease
detection. New transfer learning methods offer an avenue for this technology to
be easily deployed on mobile devices. Using a dataset of cassava disease images
taken in the field in Tanzania, we applied transfer learning to train a deep
convolutional neural network to identify three diseases and two types of pest
damage (or lack thereof). The best trained model accuracies were 98% for brown
leaf spot (BLS), 96% for red mite damage (RMD), 95% for green mite damage
(GMD), 98% for cassava brown streak disease (CBSD), and 96% for cassava mosaic
disease (CMD). The best model achieved an overall accuracy of 93% for data not
used in the training process. Our results show that the transfer learning
approach for image recognition of field images offers a fast, affordable, and
easily deployable strategy for digital plant disease detection.
","[{'version': 'v1', 'created': 'Mon, 19 Jun 2017 15:01:59 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Aug 2017 19:29:43 GMT'}]",2017-11-07,"[['Ramcharan', 'Amanda', ''], ['Baranowski', 'Kelsee', ''], ['McCloskey', 'Peter', ''], ['Ahmed', 'Babuali', ''], ['Legg', 'James', ''], ['Hughes', 'David', '']]","['cassava disease detection', 'convolutional neural networks', 'transfer learning', 'mobile epidemiology', 'Inception v3 model']"
3451,1212.4336,Dr. Nadeem Javaid,"Syed Hassan Ahmed, Safdar H. Bouk, N. Javaid, Iwao Sasase","Combined Human, Antenna Orientation in Elevation Direction and Ground
  Effect on RSSI in Wireless Sensor Networks","10th IEEE International Conference on Frontiers of Information
  Technology (FIT 12), 2012",,10.1109/FIT.2012.17,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we experimentally investigate the combined effect of human,
antenna orientation in elevation direction and the ground effect on the
Received Signal Strength Indicator (RSSI) parameter in the Wireless Sensor
Network (WSN). In experiment, we use MICAz motes and consider different
scenarios where antenna of the transmitter node is tilted in elevation
direction. The motes were placed on the ground to take into account the ground
effect on the RSSI. The effect of one, two and four persons on the RSSI is
recorded. For one and two persons, different walking paces e.g. slow, medium
and fast pace, are analysed. However, in case of four persons, random movement
is carried out between the pair of motes. The experimental results show that
some antenna orientation angles have drastic effect on the RSSI, even without
any human activity. The fluctuation count and range of RSSI in different
scenarios with same walking pace are completely different. Therefore, an
efficient human activity algorithm is need that effectively takes into count
the antenna elevation and other parameters to accurately detect the human
activity in the WSN deployment region.
","[{'version': 'v1', 'created': 'Tue, 18 Dec 2012 13:00:46 GMT'}]",2016-11-17,"[['Ahmed', 'Syed Hassan', ''], ['Bouk', 'Safdar H.', ''], ['Javaid', 'N.', ''], ['Sasase', 'Iwao', '']]","['MICAz', 'antenna orientation', 'WSN', 'RSSI', 'ground effect']"
3452,1603.06635,Riccardo Aragona,Federico Giacon and Riccardo Aragona and Massimiliano Sala,A proof of security for a key-policy RS-ABE scheme,,"JP Journal of Algebra, Number Theory and Applications, Vol. 40,
  No. 1, 2018",10.17654/NT040010029,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A revocable-storage attribute-based encryption (RS-ABE) scheme is an
encryption scheme which extends attribute-based encryption by intro- ducing
user revocation. A key-policy RS-ABE scheme links each key to an access
structure. We propose a new key-policy RS-ABE scheme whose security we prove in
term of indistinguishability under a chosen-plaintext attack (IND-CPA).
","[{'version': 'v1', 'created': 'Mon, 21 Mar 2016 22:12:40 GMT'}]",2019-04-26,"[['Giacon', 'Federico', ''], ['Aragona', 'Riccardo', ''], ['Sala', 'Massimiliano', '']]","['Key Policy', 'Attribute Based Encryption', 'Bilinear Group']"
3453,1006.3610,Secretary Aircc Journal,"Kaushik Ghosh (1), Sarbani Roy (2), Pradip K.Das (1) ((1) Mody
  Institute of Technology, India,(2)Jadavpur University, India)","I-Min: An Intelligent Fermat Point Based Energy Efficient Geographic
  Packet Forwarding Technique for Wireless Sensor and Ad Hoc Networks",11 Pages,"International journal on applications of graph theory in wireless
  ad hoc networks and sensor networks 2.2 (2010) 34-44",10.5121/jgraphoc.2010.2204,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Energy consumption and delay incurred in packet delivery are the two
important metrics for measuring the performance of geographic routing protocols
for Wireless Adhoc and Sensor Networks (WASN). A protocol capable of ensuring
both lesser energy consumption and experiencing lesser delay in packet delivery
is thus suitable for networks which are delay sensitive and energy hungry at
the same time. Thus a smart packet forwarding technique addressing both the
issues is thus the one looked for by any geographic routing protocol. In the
present paper we have proposed a Fermat point based forwarding technique which
reduces the delay experienced during packet delivery as well as the energy
consumed for transmission and reception of data packets.
","[{'version': 'v1', 'created': 'Fri, 18 Jun 2010 05:16:45 GMT'}]",2019-08-17,"[['Ghosh', 'Kaushik', ''], ['Roy', 'Sarbani', ''], ['Das', 'Pradip K.', '']]","['Geographic routing', 'Fermat point', 'Wireless Adhoc', 'Sensor Network(WASN)']"
3454,0801.3097,Zhu Han,"Jianwei Huang, Zhu Han, Mung Chiang, H. Vincent Poor","Auction-based Resource Allocation for Multi-relay Asynchronous
  Cooperative Networks","To appear in the Proceedings of the 2008 IEEE International
  Conference on Acoustics, Speech and Signal Processing, Las Vegas, NV, March
  30 to April 4, 2008",,10.1109/ICASSP.2008.4518870,,cs.IT math.IT,,"  Resource allocation is considered for cooperative transmissions in
multiple-relay wireless networks. Two auction mechanisms, SNR auctions and
power auctions, are proposed to distributively coordinate the allocation of
power among multiple relays. In the SNR auction, a user chooses the relay with
the lowest weighted price. In the power auction, a user may choose to use
multiple relays simultaneously, depending on the network topology and the
relays' prices. Sufficient conditions for the existence (in both auctions) and
uniqueness (in the SNR auction) of the Nash equilibrium are given. The fairness
of the SNR auction and efficiency of the power auction are further discussed.
It is also proven that users can achieve the unique Nash equilibrium
distributively via best response updates in a completely asynchronous manner.
","[{'version': 'v1', 'created': 'Sun, 20 Jan 2008 17:25:56 GMT'}]",2016-11-15,"[['Huang', 'Jianwei', ''], ['Han', 'Zhu', ''], ['Chiang', 'Mung', ''], ['Poor', 'H. Vincent', '']]","['Wireless Networks', 'Relay Networks', 'Auction Theory', 'Power Control', 'Resource Allocation']"
3455,1607.01642,Chengqing Li,"Chengqing Li, Dongdong Lin, Jinhu L\""u",Cryptanalyzing an Image-Scrambling Encryption Algorithm of Pixel Bits,7 pages,"IEEE MultiMedia, vol. 24, no. 3, pp. 64-71, 2017",10.1109/MMUL.2017.3051512,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Position scrambling (permutation) is widely used in multimedia encryption
schemes and some international encryption standards, such as the Data
Encryption Standard and the Advanced Encryption Standard. In this article, the
authors re-evaluate the security of a typical image-scrambling encryption
algorithm (ISEA). Using the internal correlation remaining in the cipher image,
they disclose important visual information of the corresponding plain image in
a ciphertext-only attack scenario. Furthermore, they found that the real
scrambling domain--the position-scrambling scope of ISEA's scrambled
elements--can be used to support an efficient known or chosen-plaintext attack
on it. Detailed experimental results have verified these points and demonstrate
that some advanced multimedia processing techniques can facilitate the
cryptanalysis of multimedia encryption algorithms.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2016 14:39:45 GMT'}, {'version': 'v2', 'created': 'Sun, 6 Aug 2017 06:23:57 GMT'}]",2017-08-08,"[['Li', 'Chengqing', ''], ['Lin', 'Dongdong', ''], ['Lü', 'Jinhu', '']]","['Ciphertext-only attack', 'known-plaintext attack', 'cryptanalysis', 'image encryption', 'template matching']"
3456,1108.3149,David Gontier,"David Gontier, Martin Vetterli","Sampling based on timing: Time encoding machines on shift-invariant
  subspaces",submitted to Applied and Computationnal Harmonic Analysis,,10.1016/j.acha.2013.02.002,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sampling information using timing is a new approach in sampling theory. The
question is how to map amplitude information into the timing domain. One such
encoder, called time encoding machine, was introduced by Lazar and Toth in [23]
for the special case of band-limited functions. In this paper, we extend their
result to the general framework of shift-invariant subspaces. We prove that
time encoding machines may be considered as non-uniform sampling devices, where
time locations are unknown a priori. Using this fact, we show that perfect
representation and reconstruction of a signal with a time encoding machine is
possible whenever this device satisfies some density property. We prove that
this method is robust under timing quantization, and therefore can lead to the
design of simple and energy efficient sampling devices.
","[{'version': 'v1', 'created': 'Tue, 16 Aug 2011 03:51:10 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Jan 2013 20:04:34 GMT'}]",2013-07-02,"[['Gontier', 'David', ''], ['Vetterli', 'Martin', '']]","['Time encoding machine', 'Integrate-and-fire', 'Shift-invariant subspaces', 'Quantization', 'Reproducingkernels', 'Non-uniform sampling', 'Signal representation']"
3457,0802.4089,Joel Ratsaby,Joel Ratsaby,"An algorithmic complexity interpretation of Lin's third law of
  information theory",,,10.3390/entropy-e10010006,,cs.CC cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Instead of static entropy we assert that the Kolmogorov complexity of a
static structure such as a solid is the proper measure of disorder (or
chaoticity). A static structure in a surrounding perfectly-random universe acts
as an interfering entity which introduces local disruption in randomness. This
is modeled by a selection rule $R$ which selects a subsequence of the random
input sequence that hits the structure. Through the inequality that relates
stochasticity and chaoticity of random binary sequences we maintain that Lin's
notion of stability corresponds to the stability of the frequency of 1s in the
selected subsequence. This explains why more complex static structures are less
stable. Lin's third law is represented as the inevitable change that static
structure undergo towards conforming to the universe's perfect randomness.
","[{'version': 'v1', 'created': 'Thu, 28 Feb 2008 12:41:08 GMT'}, {'version': 'v2', 'created': 'Sun, 16 Mar 2008 15:50:02 GMT'}]",2015-05-13,"[['Ratsaby', 'Joel', '']]","['Entropy', 'Randomness', 'Information theory', 'Algorithmic complexity', 'Binary sequences']"
3458,1711.07828,Gabriel Spadon,"Bruno B. Machado, Gabriel Spadon, Mauro S. Arruda, Wesley N.
  Goncalves, Andre C. P. L. F. Carvalho, Jose F. Rodrigues-Jr","A smartphone application to measure the quality of pest control spraying
  machines via image analysis","Paper to be published on the 33rd ACM/SIGAPP Symposium On Applied
  Computing (SAC), 2018",,10.1145/3167132.3167237,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The need for higher agricultural productivity has demanded the intensive use
of pesticides. However, their correct use depends on assessment methods that
can accurately predict how well the pesticides' spraying covered the intended
crop region. Some methods have been proposed in the literature, but their high
cost and low portability harm their widespread use. This paper proposes and
experimentally evaluates a new methodology based on the use of a
smartphone-based mobile application, named DropLeaf. Experiments performed
using DropLeaf showed that, in addition to its versatility, it can predict with
high accuracy the pesticide spraying. DropLeaf is a five-fold image-processing
methodology based on: (i) color space conversion, (ii) threshold noise removal,
(iii) convolutional operations of dilation and erosion, (iv) detection of
contour markers in the water-sensitive card, and, (v) identification of
droplets via the marker-controlled watershed transformation. The authors
performed successful experiments over two case studies, the first using a set
of synthetic cards and the second using a real-world crop. The proposed tool
can be broadly used by farmers equipped with conventional mobile phones,
improving the use of pesticides with health, environmental and financial
benefits.
","[{'version': 'v1', 'created': 'Tue, 21 Nov 2017 15:04:07 GMT'}, {'version': 'v2', 'created': 'Sat, 2 Dec 2017 10:03:16 GMT'}, {'version': 'v3', 'created': 'Sat, 16 Dec 2017 20:50:15 GMT'}]",2017-12-19,"[['Machado', 'Bruno B.', ''], ['Spadon', 'Gabriel', ''], ['Arruda', 'Mauro S.', ''], ['Goncalves', 'Wesley N.', ''], ['Carvalho', 'Andre C. P. L. F.', ''], ['Rodrigues-Jr', 'Jose F.', '']]","['Mobile Application', 'Image Processing', 'Pesticide Spraying Analysis', 'Deposition Analysis']"
3459,1706.01123,Dandan Huang,"Dandan Huang, Melanie Tory and Lyn Bartram",A Field Study of On-Calendar Visualizations,,"Proceeding GI '16 Proceedings of the 42nd Graphics Interface
  Conference Pages 13-20, 2016",10.20380/GI2016.03,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feedback tools help people to monitor information about themselves to improve
their health, sustainability practices, or personal well-being. Yet reasoning
about personal data (e.g., pedometer counts, blood pressure readings, or home
electricity consumption) to gain a deep understanding of your current practices
and how to change can be challenging with the data alone. We integrate
quantitative feedback data within a personal digital calendar; this approach
aims to make the feedback data readily accessible and more comprehensible. We
report on an eight-week field study of an on-calendar visualization tool.
Results showed that a personal calendar can provide rich context for people to
reason about their feedback data. The on-calendar visualization enabled people
to quickly identify and reason about regular patterns and anomalies. Based on
our results, we also derived a model of the behavior feedback process that
extends existing technology adoption models. With that, we reflected on
potential barriers for the ongoing use of feedback tools.
","[{'version': 'v1', 'created': 'Sun, 4 Jun 2017 18:33:57 GMT'}]",2017-06-06,"[['Huang', 'Dandan', ''], ['Tory', 'Melanie', ''], ['Bartram', 'Lyn', '']]","['Personal visualization', 'feedback design', 'physical activities', 'field study', 'digital calendar']"
3460,1904.01079,Mikhail (Michael) Raskin,Michael Raskin and Christoph Welzel,Working with first-order proofs and provers,4 pages. Accepted at European Lisp Symposium 2019,,10.5281/zenodo.2633990,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Verifying software correctness has always been an important and complicated
task. Recently, formal proofs of critical properties of algorithms and even
implementations are becoming practical. Currently, the most powerful automated
proof search tools use first-order logic while popular interactive proof
assistants use higher-order logic.
  We present our work-in-progress set of tools that aim to eventually provide a
usable first-order logic computer-assisted proof environment.
","[{'version': 'v1', 'created': 'Mon, 18 Mar 2019 11:45:50 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Apr 2019 04:23:29 GMT'}]",2019-04-10,"[['Raskin', 'Michael', ''], ['Welzel', 'Christoph', '']]","['automated reasoning', 'computer-aided proofs', 'first-order logic', 'verification']"
3461,1406.0253,Soorajprasad M H,"M H Soorajprasad, Balapradeep K N, Antony P J",VirtuMob : Remote Desktop Virtualization Solution for Smarphones,"5 Pages, 4 Figures, Published with International Journal of Computer
  Trends and Technology (IJCTT). arXiv admin note: text overlap with
  arXiv:1310.5850 by other authors without attribution","International Journal of Computer Trends and Technology (IJCTT)
  V11(4):169-173,May 2014",10.14445/22312803/IJCTT-V11P136,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobility is an important attribute in todays computing world. Mobile
devices,smartphone and tablet PC are becoming an integral part of human life
because they are most effective and convenient communication tools. This paper
proposes a system to connect and access the desktops of remote computer systems
using an android based Smartphone. Virtual Network Computing based architecture
is used to develop the proposed system. Through a VirtuMob viewer provided on
the users Smartphone, the user will be able to access and manipulate the
desktops of remote computers. Several functionality such as viewing the
desktop, mouse operations, keyboard operations, manipulation of documents can
be performed from the Smartphone. VirtuMob server should be running on the
remote system and it must be attached to a network. VirtuMob Accelerator is
used to process the RFB frames of the desktop, perform Encoding of the frames
and then relay the frames to the viewer over the internet. Several Encoding
techniques are studied and analysed to determine which is best suited for the
proposed system.
","[{'version': 'v1', 'created': 'Mon, 2 Jun 2014 06:06:28 GMT'}]",2014-06-03,"[['Soorajprasad', 'M H', ''], ['N', 'Balapradeep K', ''], ['J', 'Antony P', '']]","['Virtual Network Computing', 'Remote Frame Buffer', 'Remote Control', 'Remote Desktop']"
3462,1609.06622,Ellen Murphy,"Ellen Murphy (University of Bath, United Kingdom), Tom Crick (Cardiff
  Metropolitan University, United Kingdom), James H. Davenport (University of
  Bath, United Kingdom)",An Analysis of Introductory Programming Courses at UK Universities,,"The Art, Science, and Engineering of Programming, 2017, Vol. 1,
  Issue 2, Article 18",10.22152/programming-journal.org/2017/1/18,,cs.CY cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: In the context of exploring the art, science and engineering of
programming, the question of which programming languages should be taught first
has been fiercely debated since computer science teaching started in
universities. Failure to grasp programming readily almost certainly implies
failure to progress in computer science. Inquiry: What first programming
languages are being taught? There have been regular national-scale surveys in
Australia and New Zealand, with the only US survey reporting on a small subset
of universities. This the first such national survey of universities in the UK.
Approach: We report the results of the first survey of introductory programming
courses (N=80) taught at UK universities as part of their first year computer
science (or related) degree programmes, conducted in the first half of 2016. We
report on student numbers, programming paradigm, programming languages and
environment/tools used, as well as the underpinning rationale for these
choices. Knowledge: The results in this first UK survey indicate a dominance of
Java at a time when universities are still generally teaching students who are
new to programming (and computer science), despite the fact that Python is
perceived, by the same respondents, to be both easier to teach as well as to
learn. Grounding: We compare the results of this survey with a related survey
conducted since 2010 (as well as earlier surveys from 2001 and 2003) in
Australia and New Zealand. Importance: This survey provides a starting point
for valuable pedagogic baseline data for the analysis of the art, science and
engineering of programming, in the context of substantial computer science
curriculum reform in UK schools, as well as increasing scrutiny of teaching
excellence and graduate employability for UK universities.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2016 16:23:39 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Apr 2017 00:09:47 GMT'}]",2017-04-04,"[['Murphy', 'Ellen', '', 'University of Bath, United Kingdom'], ['Crick', 'Tom', '', 'Cardiff\n  Metropolitan University, United Kingdom'], ['Davenport', 'James H.', '', 'University of\n  Bath, United Kingdom']]","['introductory programming', 'programming pedagogy', 'programming environments', 'programming']"
3463,1403.7259,EPTCS,"Kalou Cabrera Castillos (LAAS-CNRS), Fr\'ed\'eric Dadeau (FEMTO-ST
  Institute/INRIA CASSIS Project), Jacques Julliand (FEMTO-ST Institute)",Coverage Criteria for Model-Based Testing using Property Patterns,"In Proceedings MBT 2014, arXiv:1403.7044","EPTCS 141, 2014, pp. 29-43",10.4204/EPTCS.141.3,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present in this paper a model-based testing approach aiming at generating
test cases from a UML/OCL model and a given test property. The property is
expressed using a dedicated formalism based on patterns, and automatically
translated into an automaton. We propose new automata coverage criteria that
are tailored to the property automata we consider. These criteria are based on
the coverage of a relevant subset of the transitions related to the original
property, aiming at producing test cases that illustrate the dynamics of the
system described in the property. In addition, we propose to produce test cases
that can ensure the robustness of the system w.r.t. the property, by mutating
the property automaton, in order to try to provoke events that would be
forbidden by the property. This approach has been implemented into a large tool
set and it has been experimented on realistic case studies, in the context of
industrial research projects.
","[{'version': 'v1', 'created': 'Fri, 28 Mar 2014 01:04:41 GMT'}]",2014-03-31,"[['Castillos', 'Kalou Cabrera', '', 'LAAS-CNRS'], ['Dadeau', 'Frédéric', '', 'FEMTO-ST\n  Institute/INRIA CASSIS Project'], ['Julliand', 'Jacques', '', 'FEMTO-ST Institute']]","['Model-Based Testing', 'UML/OCL', 'property patterns', 'coverage criteria', 'automata mutation']"
3464,2105.11794,Diana C. Hernandez-Bocanegra,Diana C. Hernandez-Bocanegra and Juergen Ziegler,"Effects of interactivity and presentation on review-based explanations
  for recommendations",,"Human-Computer Interaction INTERACT 2021. INTERACT 2021. Lecture
  Notes in Computer Science, vol 12933. Springer, Cham., 597-618",10.1007/978-3-030-85616-8_35,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  User reviews have become an important source for recommending and explaining
products or services. Particularly, providing explanations based on user
reviews may improve users' perception of a recommender system (RS). However,
little is known about how review-based explanations can be effectively and
efficiently presented to users of RS. We investigate the potential of
interactive explanations in review-based RS in the domain of hotels, and
propose an explanation scheme inspired by dialog models and formal argument
structures. Additionally, we also address the combined effect of interactivity
and different presentation styles (i.e. using only text, a bar chart or a
table), as well as the influence that different user characteristics might have
on users' perception of the system and its explanations. To such effect, we
implemented a review-based RS using a matrix factorization explanatory method,
and conducted a user study. Our results show that providing more interactive
explanations in review-based RS has a significant positive influence on the
perception of explanation quality, effectiveness and trust in the system by
users, and that user characteristics such as rational decision-making style and
social awareness also have a significant influence on this perception.
","[{'version': 'v1', 'created': 'Tue, 25 May 2021 09:54:42 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Sep 2021 13:42:34 GMT'}]",2021-09-06,"[['Hernandez-Bocanegra', 'Diana C.', ''], ['Ziegler', 'Juergen', '']]","['Recommender systems', 'explanations', 'user study', 'user characteristics']"
3465,2201.11884,A. Feder Cooper,A. Feder Cooper and Gili Vidan,"Making the Unaccountable Internet: The Changing Meaning of Accounting in
  the Early ARPANET",,"2022 ACM Conference on Fairness, Accountability, and Transparency
  (FAccT '22)",10.1145/3531146.3533137,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Contemporary concerns over the governance of technological systems often run
up against narratives about the technical infeasibility of designing mechanisms
for accountability. While in recent AI ethics literature these concerns have
been deliberated predominantly in relation to ML, other instances in computing
history also presented circumstances in which computer scientists needed to
un-muddle what it means to design accountable systems. One such compelling
narrative can be found in canonical histories of the Internet that highlight
how its original designers' commitment to the ""End-to-End"" architectural
principle precluded other features from being implemented, resulting in the
fast-growing, generative, but ultimately unaccountable network we have today.
This paper offers a critique of such technologically essentialist notions of
accountability and the characterization of the ""unaccountable Internet"" as an
unintended consequence. It explores the changing meaning of accounting and its
relationship to accountability in a selected corpus of requests for comments
(RFCs) concerning the early Internet's design from the 1970s and 80s. We
characterize four ways of conceptualizing accounting: as billing, as
measurement, as management, and as policy, and demonstrate how an understanding
of accountability was constituted through these shifting meanings. We link
together the administrative and technical mechanisms of accounting for shared
resources in a distributed system and an emerging notion of accountability as a
social, political, and technical category, arguing that the former is
constitutive of the latter. Recovering this history is not only important for
understanding the processes that shaped the Internet, but also serves as a
starting point for unpacking the complicated political choices that are
involved in designing accountability mechanisms for other technological systems
today.
","[{'version': 'v1', 'created': 'Fri, 28 Jan 2022 01:42:58 GMT'}, {'version': 'v2', 'created': 'Tue, 10 May 2022 02:26:23 GMT'}, {'version': 'v3', 'created': 'Wed, 11 May 2022 17:34:05 GMT'}]",2022-05-12,"[['Cooper', 'A. Feder', ''], ['Vidan', 'Gili', '']]","['Accountability', 'Accounting', 'Accountable systems', 'Internet governance', 'Resource sharing']"
3466,1708.00930,Paolo Bestagini,"Mauro Barni, Luca Bondi, Nicol\`o Bonettini, Paolo Bestagini, Andrea
  Costanzo, Marco Maggini, Benedetta Tondi, Stefano Tubaro","Aligned and Non-Aligned Double JPEG Detection Using Convolutional Neural
  Networks","Submitted to Journal of Visual Communication and Image Representation
  (first submission: March 20, 2017; second submission: August 2, 2017)",,10.1016/j.jvcir.2017.09.003,,cs.CR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the wide diffusion of JPEG coding standard, the image forensic
community has devoted significant attention to the development of double JPEG
(DJPEG) compression detectors through the years. The ability of detecting
whether an image has been compressed twice provides paramount information
toward image authenticity assessment. Given the trend recently gained by
convolutional neural networks (CNN) in many computer vision tasks, in this
paper we propose to use CNNs for aligned and non-aligned double JPEG
compression detection. In particular, we explore the capability of CNNs to
capture DJPEG artifacts directly from images. Results show that the proposed
CNN-based detectors achieve good performance even with small size images (i.e.,
64x64), outperforming state-of-the-art solutions, especially in the non-aligned
case. Besides, good results are also achieved in the commonly-recognized
challenging case in which the first quality factor is larger than the second
one.
","[{'version': 'v1', 'created': 'Wed, 2 Aug 2017 21:11:27 GMT'}]",2017-10-11,"[['Barni', 'Mauro', ''], ['Bondi', 'Luca', ''], ['Bonettini', 'Nicolò', ''], ['Bestagini', 'Paolo', ''], ['Costanzo', 'Andrea', ''], ['Maggini', 'Marco', ''], ['Tondi', 'Benedetta', ''], ['Tubaro', 'Stefano', '']]","['Image forensics', 'double JPEG detection', 'double JPEGlocalization', 'convolutional neural networks']"
3467,1701.07681,"Patrick Sch\""afer","Patrick Sch\""afer and Ulf Leser",Fast and Accurate Time Series Classification with WEASEL,,"Proceedings of the 2017 ACM on Conference on Information and
  Knowledge Management (CIKM '17). ACM, 637-646",10.1145/3132847.3132980,,cs.DS cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Time series (TS) occur in many scientific and commercial applications,
ranging from earth surveillance to industry automation to the smart grids. An
important type of TS analysis is classification, which can, for instance,
improve energy load forecasting in smart grids by detecting the types of
electronic devices based on their energy consumption profiles recorded by
automatic sensors. Such sensor-driven applications are very often characterized
by (a) very long TS and (b) very large TS datasets needing classification.
However, current methods to time series classification (TSC) cannot cope with
such data volumes at acceptable accuracy; they are either scalable but offer
only inferior classification quality, or they achieve state-of-the-art
classification quality but cannot scale to large data volumes.
  In this paper, we present WEASEL (Word ExtrAction for time SEries
cLassification), a novel TSC method which is both scalable and accurate. Like
other state-of-the-art TSC methods, WEASEL transforms time series into feature
vectors, using a sliding-window approach, which are then analyzed through a
machine learning classifier. The novelty of WEASEL lies in its specific method
for deriving features, resulting in a much smaller yet much more discriminative
feature set. On the popular UCR benchmark of 85 TS datasets, WEASEL is more
accurate than the best current non-ensemble algorithms at orders-of-magnitude
lower classification and training times, and it is almost as accurate as
ensemble classifiers, whose computational complexity makes them inapplicable
even for mid-size datasets. The outstanding robustness of WEASEL is also
confirmed by experiments on two real smart grid datasets, where it
out-of-the-box achieves almost the same accuracy as highly tuned,
domain-specific methods.
","[{'version': 'v1', 'created': 'Thu, 26 Jan 2017 13:09:48 GMT'}]",2017-12-19,"[['Schäfer', 'Patrick', ''], ['Leser', 'Ulf', '']]","['Time Series', 'Classification', 'Feature Selection', 'Bag-of-patterns', 'Word Co-Occurrences']"
3468,1306.4905,Martin Trnecka,"Radim Belohlavek, Martin Trnecka","From-Below Approximations in Boolean Matrix Factorization: Geometry and
  New Algorithm",,,10.1016/j.jcss.2015.06.002,,cs.NA cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present new results on Boolean matrix factorization and a new algorithm
based on these results. The results emphasize the significance of
factorizations that provide from-below approximations of the input matrix.
While the previously proposed algorithms do not consider the possibly different
significance of different matrix entries, our results help measure such
significance and suggest where to focus when computing factors. An experimental
evaluation of the new algorithm on both synthetic and real data demonstrates
its good performance in terms of good coverage by the first k factors as well
as a small number of factors needed for exact decomposition and indicates that
the algorithm outperforms the available ones in these terms. We also propose
future research topics.
","[{'version': 'v1', 'created': 'Thu, 20 Jun 2013 15:19:22 GMT'}]",2015-06-26,"[['Belohlavek', 'Radim', ''], ['Trnecka', 'Martin', '']]","['Boolean matrix', 'Matrix decomposition', 'Closure structures', 'Concept lattice', 'Approximation algorithm']"
3469,1106.1852,Gregory D. Saxton,"Kristen Lovejoy, Richard Waters, Gregory D. Saxton","Engaging Stakeholders through Twitter: How Nonprofit Organizations are
  Getting More Out of 140 Characters or Less","In press, Public Relations Review; 10 pages",,10.1016/j.pubrev.2012.01.005,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  140 characters seems like too small a space for any meaningful information to
be exchanged, but Twitter users have found creative ways to get the most out of
each Tweet by using different communication tools. This paper looks into how 73
nonprofit organizations use Twitter to engage stakeholders not only through
their tweets, but also through other various communication methods.
Specifically, it looks into the organizations' utilization of tweet frequency,
following behavior, hyperlinks, hashtags, public messages, retweets, and
multimedia files. After analyzing 4,655 tweets, the study found that the
nation's largest nonprofits are not using Twitter to maximize stakeholder
involvement. Instead, they continue to use social media as a one-way
communication channel, as less than 20% of their total tweets demonstrate
conversations and roughly 16% demonstrate indirect connections to specific
users.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2011 16:39:51 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Feb 2012 19:31:52 GMT'}]",2012-02-20,"[['Lovejoy', 'Kristen', ''], ['Waters', 'Richard', ''], ['Saxton', 'Gregory D.', '']]","['Stakeholder Engagement', 'Social Networking', 'Nonprofit Organizations', 'Twitter', 'Social Media']"
3470,1810.11094,Dominique Vaufreydaz,"Thomas Guntz (PERVASIVE), James Crowley (PERVASIVE), Dominique
  Vaufreydaz (PERVASIVE), Raffaella Balzarini (PERVASIVE), Philippe Dessus
  (LSE, PERVASIVE)","The Role of Emotion in Problem Solving: First Results from Observing
  Chess",,"ICMI 2018 - Workshop at 20th ACM International Conference on
  Multimodal Interaction, Oct 2018, Boulder, Colorado, United States. pp.1-13",,,cs.HC cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present results from recent experiments that suggest that
chess players associate emotions to game situations and reactively use these
associations to guide search for planning and problem solving. We describe the
design of an instrument for capturing and interpreting multimodal signals of
humans engaged in solving challenging problems. We review results from a pilot
experiment with human experts engaged in solving challenging problems in Chess
that revealed an unexpected observation of rapid changes in emotion as players
attempt to solve challenging problems. We propose a cognitive model that
describes the process by which subjects select chess chunks for use in
interpretation of the game situation and describe initial results from a second
experiment designed to test this model.
","[{'version': 'v1', 'created': 'Wed, 17 Oct 2018 06:35:31 GMT'}]",2018-10-29,"[['Guntz', 'Thomas', '', 'PERVASIVE'], ['Crowley', 'James', '', 'PERVASIVE'], ['Vaufreydaz', 'Dominique', '', 'PERVASIVE'], ['Balzarini', 'Raffaella', '', 'PERVASIVE'], ['Dessus', 'Philippe', '', 'LSE, PERVASIVE']]","['Working memory', 'Concept Formation', 'Chunking', 'Situation Modeling', 'Emotions', 'Problem Solving']"
3471,1306.0222,Ibrahim Kabiru Musa,Ibrahim Kabiru Musa and Stuart Walker,"Hybrid Optical and Electrical Network Flows Scheduling in Cloud Data
  Centres","17 pages 11 figures, Journal paper","International Journal of Computer Science & Information Technology
  (IJCSIT) Vol 5, No 2, April 2013",10.5121/ijcsit.2013.5201,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hybrid intra-data centre networks, with optical and electrical capabilities,
are attracting research interest in recent years. This is attributed to the
emergence of new bandwidth greedy applications and novel computing paradigms. A
key decision to make in networks of this type is the selection and placement of
suitable flows for switching in circuit network. Here, we propose an efficient
strategy for flow selection and placement suitable for hybrid Intra-cloud data
centre networks. We further present techniques for investigating bottlenecks in
a packet networks and for the selection of flows to switch in circuit network.
The bottleneck technique is verified on a Software Defined Network (SDN)
testbed. We also implemented the techniques presented here in a scalable
simulation experiment to investigate the impact of flow selection on network
performance. Results obtained from scalable simulation experiment indicate a
considerable improvement on average throughput, lower configuration delay, and
stability of offloaded flows
","[{'version': 'v1', 'created': 'Sun, 2 Jun 2013 15:56:00 GMT'}]",2013-06-04,"[['Musa', 'Ibrahim Kabiru', ''], ['Walker', 'Stuart', '']]","['Cloud computing', 'Optical Network', 'Hybrid Network', 'Openflow', 'Laplace Graph']"
3472,1208.1149,Bartlomiej Placzek,Bart{\l}omiej P{\l}aczek,Uncertainty-dependent data collection in vehicular sensor networks,"10 pages, 6 figures","Communications in Computer and Information Science, vol. 291, pp.
  430-439, 2012",10.1007/978-3-642-31217-5_45,,cs.NI cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vehicular sensor networks (VSNs) are built on top of vehicular ad-hoc
networks (VANETs) by equipping vehicles with sensing devices. These new
technologies create a huge opportunity to extend the sensing capabilities of
the existing road traffic control systems and improve their performance.
Efficient utilisation of wireless communication channel is one of the basic
issues in the vehicular networks development. This paper presents and evaluates
data collection algorithms that use uncertainty estimates to reduce data
transmission in a VSN-based road traffic control system.
","[{'version': 'v1', 'created': 'Mon, 6 Aug 2012 12:43:57 GMT'}]",2012-08-07,"[['Płaczek', 'Bartłomiej', '']]","['VSN', 'VANET', 'data collection', 'road traffic control']"
3473,1809.07082,Matthias Lenga,"Matthias Lenga, Tobias Klinder, Christian B\""urger, Jens von Berg,
  Astrid Franz, Cristian Lorenz",Deep Learning Based Rib Centerline Extraction and Labeling,"This paper was accepted for presentation at the MICCAI MSKI 2018
  Workshop",,10.1007/978-3-030-11166-3_9,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated extraction and labeling of rib centerlines is a typically needed
prerequisite for more advanced assisted reading tools that help the radiologist
to efficiently inspect all 24 ribs in a CT volume. In this paper, we combine a
deep learning-based rib detection with a dedicated centerline extraction
algorithm applied to the detection result for the purpose of fast, robust and
accurate rib centerline extraction and labeling from CT volumes. More
specifically, we first apply a fully convolutional neural network (FCNN) to
generate a probability map for detecting the first rib pair, the twelfth rib
pair, and the collection of all intermediate ribs. In a second stage, a newly
designed centerline extraction algorithm is applied to this multi-label
probability map. Finally, the distinct detection of first and twelfth rib
separately, allows to derive individual rib labels by simple sorting and
counting the detected centerlines. We applied our method to CT volumes from 116
patients which included a variety of different challenges and achieved a
centerline accuracy of 0.787 mm with respect to manual centerline annotations.
  This article is a preprint version of: Lenga M., Klinder T., B\""urger C., von
Berg J., Franz A., Lorenz C. (2019) Deep Learning Based Rib Centerline
Extraction and Labeling. In: Vrtovec T., Yao J., Zheng G., Pozo J. (eds)
Computational Methods and Clinical Applications in Musculoskeletal Imaging.
MSKI 2018. Lecture Notes in Computer Science, vol 11404. Springer, Cham
","[{'version': 'v1', 'created': 'Wed, 19 Sep 2018 09:09:23 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Jan 2019 20:56:28 GMT'}]",2019-01-16,"[['Lenga', 'Matthias', ''], ['Klinder', 'Tobias', ''], ['Bürger', 'Christian', ''], ['von Berg', 'Jens', ''], ['Franz', 'Astrid', ''], ['Lorenz', 'Cristian', '']]","['Rib segmentation', 'deep learning', 'fully convolutional neuralnetworks', 'whole-body CT scans', 'trauma']"
3474,1804.02771,Zhao Chen,"Zhao Chen, Vijay Badrinarayanan, Gilad Drozdov, Andrew Rabinovich",Estimating Depth from RGB and Sparse Sensing,"European Conference on Computer Vision (ECCV) 2018. Updated to
  camera-ready version with additional experiments","In: European Conference on Computer Vision. pp. 176-192. Springer
  (2018)",10.1007/978-3-030-01225-0_11,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a deep model that can accurately produce dense depth maps given an
RGB image with known depth at a very sparse set of pixels. The model works
simultaneously for both indoor/outdoor scenes and produces state-of-the-art
dense depth maps at nearly real-time speeds on both the NYUv2 and KITTI
datasets. We surpass the state-of-the-art for monocular depth estimation even
with depth values for only 1 out of every ~10000 image pixels, and we
outperform other sparse-to-dense depth methods at all sparsity levels. With
depth values for 1/256 of the image pixels, we achieve a mean absolute error of
less than 1% of actual depth on indoor scenes, comparable to the performance of
consumer-grade depth sensor hardware. Our experiments demonstrate that it would
indeed be possible to efficiently transform sparse depth measurements obtained
using e.g. lower-power depth sensors or SLAM systems into high-quality dense
depth maps.
","[{'version': 'v1', 'created': 'Sun, 8 Apr 2018 22:46:10 GMT'}, {'version': 'v2', 'created': 'Sun, 9 Dec 2018 22:28:40 GMT'}]",2018-12-11,"[['Chen', 'Zhao', ''], ['Badrinarayanan', 'Vijay', ''], ['Drozdov', 'Gilad', ''], ['Rabinovich', 'Andrew', '']]","['Sparse-to-Dense Depth', 'Depth Estimation', 'Deep Learning']"
3475,2105.08007,Lun Du,"Lun Du, Xu Chen, Fei Gao, Qiang Fu, Kunqing Xie, Shi Han and Dongmei
  Zhang","Understanding and Improvement of Adversarial Training for Network
  Embedding from an Optimization Perspective","11 pages, 0 figures, accepted by WSDM'22",,10.1145/3488560.3498474,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network Embedding aims to learn a function mapping the nodes to Euclidean
space contribute to multiple learning analysis tasks on networks. However, the
noisy information behind the real-world networks and the overfitting problem
both negatively impact the quality of embedding vectors. To tackle these
problems, researchers utilize Adversarial Training for Network Embedding
(AdvTNE) and achieve state-of-the-art performance. Unlike the mainstream
methods introducing perturbations on the network structure or the data feature,
AdvTNE directly perturbs the model parameters, which provides a new chance to
understand the mechanism behind. In this paper, we explain AdvTNE theoretically
from an optimization perspective. Considering the Power-law property of
networks and the optimization objective, we analyze the reason for its
excellent results. According to the above analysis, we propose a new activation
to enhance the performance of AdvTNE. We conduct extensive experiments on four
real networks to validate the effectiveness of our method in node
classification and link prediction. The results demonstrate that our method is
superior to the state-of-the-art baseline methods.
","[{'version': 'v1', 'created': 'Mon, 17 May 2021 16:41:53 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Dec 2021 00:48:21 GMT'}]",2021-12-16,"[['Du', 'Lun', ''], ['Chen', 'Xu', ''], ['Gao', 'Fei', ''], ['Fu', 'Qiang', ''], ['Xie', 'Kunqing', ''], ['Han', 'Shi', ''], ['Zhang', 'Dongmei', '']]","['network embedding', 'adversarial training', 'optimization method', 'saturation region problem']"
3476,1610.01578,Krzysztof Cpa{\l}ka,"Krzysztof Cpalka, Marcin Zalasinski, Leszek Rutkowski","A new algorithm for identity verification based on the analysis of a
  handwritten dynamic signature","34 pages, 7 figures","Applied Soft Computing, vol. 43, pp. 47-56, 2016",10.1016/j.asoc.2016.02.017,,cs.CV cs.AI cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identity verification based on authenticity assessment of a handwritten
signature is an important issue in biometrics. There are many effective methods
for signature verification taking into account dynamics of a signing process.
Methods based on partitioning take a very important place among them. In this
paper we propose a new approach to signature partitioning. Its most important
feature is the possibility of selecting and processing of hybrid partitions in
order to increase a precision of the test signature analysis. Partitions are
formed by a combination of vertical and horizontal sections of the signature.
Vertical sections correspond to the initial, middle, and final time moments of
the signing process. In turn, horizontal sections correspond to the signature
areas associated with high and low pen velocity and high and low pen pressure
on the surface of a graphics tablet. Our previous research on vertical and
horizontal sections of the dynamic signature (created independently) led us to
develop the algorithm presented in this paper. Selection of sections, among
others, allows us to define the stability of the signing process in the
partitions, promoting signature areas of greater stability (and vice versa). In
the test of the proposed method two databases were used: public MCYT-100 and
paid BioSecure.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2016 19:32:55 GMT'}]",2016-10-06,"[['Cpalka', 'Krzysztof', ''], ['Zalasinski', 'Marcin', ''], ['Rutkowski', 'Leszek', '']]","['biometrics', 'on-line signature', 'dynamic signature', 'identityverification', 'computational intelligence', 'fuzzy system', 'interpretability']"
3477,1811.09496,"Christian Sch\""on","Christian Sch\""on (1), Jens Dittrich (1), Richard M\""uller (2) ((1)
  Saarland Informatics Campus, (2) Deutscher Wetterdienst)","The Error is the Feature: how to Forecast Lightning using a Model
  Prediction Error","10 pages, 7 figures",,10.1145/3292500.3330682,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the progress within the last decades, weather forecasting is still a
challenging and computationally expensive task. Current satellite-based
approaches to predict thunderstorms are usually based on the analysis of the
observed brightness temperatures in different spectral channels and emit a
warning if a critical threshold is reached. Recent progress in data science
however demonstrates that machine learning can be successfully applied to many
research fields in science, especially in areas dealing with large datasets. We
therefore present a new approach to the problem of predicting thunderstorms
based on machine learning. The core idea of our work is to use the error of
two-dimensional optical flow algorithms applied to images of meteorological
satellites as a feature for machine learning models. We interpret that optical
flow error as an indication of convection potentially leading to thunderstorms
and lightning. To factor in spatial proximity we use various manual convolution
steps. We also consider effects such as the time of day or the geographic
location. We train different tree classifier models as well as a neural network
to predict lightning within the next few hours (called nowcasting in
meteorology) based on these features. In our evaluation section we compare the
predictive power of the different models and the impact of different features
on the classification result. Our results show a high accuracy of 96% for
predictions over the next 15 minutes which slightly decreases with increasing
forecast period but still remains above 83% for forecasts of up to five hours.
The high false positive rate of nearly 6% however needs further investigation
to allow for an operational use of our approach.
","[{'version': 'v1', 'created': 'Fri, 23 Nov 2018 14:36:23 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Feb 2019 12:42:40 GMT'}]",2019-12-04,"[['Schön', 'Christian', ''], ['Dittrich', 'Jens', ''], ['Müller', 'Richard', '']]","['tree classifier', 'neural networks', 'lightning prediction', 'satellite images', 'optical flow']"
3478,1007.5158,Secretary Iju,"Ayman Atia and Jiro Tanaka (University of Tsukuba, Japan)",Interaction With Tilting Gestures In Ubiquitous Environments,"13 pages, 10 figures",International Journal Of UbiComp 1.3 (2010) 1-13,10.5121/iju.2010.1301,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper, we introduce a tilting interface that controls direction based
applications in ubiquitous environments. A tilt interface is useful for
situations that require remote and quick interactions or that are executed in
public spaces. We explored the proposed tilting interface with different
application types and classified the tilting interaction techniques. Augmenting
objects with sensors can potentially address the problem of the lack of
intuitive and natural input devices in ubiquitous environments. We have
conducted an experiment to test the usability of the proposed tilting interface
to compare it with conventional input devices and hand gestures. The experiment
results showed greater improvement of the tilt gestures in comparison with hand
gestures in terms of speed, accuracy, and user satisfaction.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2010 09:18:05 GMT'}]",2019-08-14,"[['Atia', 'Ayman', '', 'University of Tsukuba, Japan'], ['Tanaka', 'Jiro', '', 'University of Tsukuba, Japan']]","['Interaction in ubiquitous environments', 'Tilt gestures', 'Human computer interaction']"
3479,1207.2619,Mutaz Al-Debei,"Mutaz M. Al-Debei, Mohammad Mourhaf Al Asswad, Sergio de Cesare and
  Mark Lycett","Conceptual Modelling and The Quality of Ontologies: Endurantism Vs.
  Perdurantism",,"International Journal of Database Management Systems, 4(3), 2012",10.5121/ijdms.2012.4301,,cs.AI cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ontologies are key enablers for sharing precise and machine-understandable
semantics among different applications and parties. Yet, for ontologies to meet
these expectations, their quality must be of a good standard. The quality of an
ontology is strongly based on the design method employed. This paper addresses
the design problems related to the modelling of ontologies, with specific
concentration on the issues related to the quality of the conceptualisations
produced. The paper aims to demonstrate the impact of the modelling paradigm
adopted on the quality of ontological models and, consequently, the potential
impact that such a decision can have in relation to the development of software
applications. To this aim, an ontology that is conceptualised based on the
Object-Role Modelling (ORM) approach (a representative of endurantism) is
re-engineered into a one modelled on the basis of the Object Paradigm (OP) (a
representative of perdurantism). Next, the two ontologies are analytically
compared using the specified criteria. The conducted comparison highlights that
using the OP for ontology conceptualisation can provide more expressive,
reusable, objective and temporal ontologies than those conceptualised on the
basis of the ORM approach.
","[{'version': 'v1', 'created': 'Wed, 11 Jul 2012 12:44:16 GMT'}]",2012-07-13,"[['Al-Debei', 'Mutaz M.', ''], ['Asswad', 'Mohammad Mourhaf Al', ''], ['de Cesare', 'Sergio', ''], ['Lycett', 'Mark', '']]","['Ontology', 'Ontology Engineering', 'Ontology Quality', 'Conceptual Modelling Paradigms', 'Object-Role Modelling', 'Object-Paradigm', 'Perdurantism', 'Endurantism']"
3480,1809.01580,Tzu-Heng Lin,"Tzu-Heng Lin, Chen Gao, Yong Li",Recommender Systems with Characterized Social Regularization,to appear in CIKM 2018,,10.1145/3269206.3269234,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social recommendation, which utilizes social relations to enhance recommender
systems, has been gaining increasing attention recently with the rapid
development of online social network. Existing social recommendation methods
are based on the fact that users preference or decision is influenced by their
social friends' behaviors. However, they assume that the influences of social
relation are always the same, which violates the fact that users are likely to
share preference on diverse products with different friends. In this paper, we
present a novel CSR (short for Characterized Social Regularization) model by
designing a universal regularization term for modeling variable social
influence. Our proposed model can be applied to both explicit and implicit
iteration. Extensive experiments on a real-world dataset demonstrate that CSR
significantly outperforms state-of-the-art social recommendation methods.
","[{'version': 'v1', 'created': 'Wed, 5 Sep 2018 15:34:03 GMT'}]",2018-09-06,"[['Lin', 'Tzu-Heng', ''], ['Gao', 'Chen', ''], ['Li', 'Yong', '']]","['Recommender Systems', 'Social Recommendation', 'Characterized Social Regularization', 'Matrix Factorization']"
3481,1908.00632,Andrew Adamatzky,"Andrew Adamatzky, Michail-Antisthenis Tsompanas, Thomas C. Draper,
  Richard Mayne",Liquid Marble Photosensor,,"ChemPhysChem, 2020, 21, 90-98",10.1002/cphc.201900949,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A liquid marble is a liquid droplet coated by a hydrophobic power. The liquid
marble does not wet adjacent surfaces and therefore can be manipulated as a dry
soft body. A Belousov-Zhabotinsky (BZ) reaction is an oscillatory chemical
reaction exhibiting waves of oxidation. We demonstrate how to make a
photo-sensor from BZ medium liquid marbles. We insert electrodes into a liquid
marble, prepared from BZ solution and coated with polyethylene powder. The
electrodes record a potential difference which oscillates due to oxidation
wave-fronts crossing the electrodes. When the BZ marble is illuminated by a
light source, the oxidation wave-fronts are hindered and, thus, the electrical
potential recorded ceases to oscillate. We characterise several types of
responses of BZ marble photosensors to various stimuli, and provide
explanations of the recorded activity. BZ liquid marble photosensors may find
applications in the fields of liquid electronics, soft robotics and
unconventional computing.
","[{'version': 'v1', 'created': 'Thu, 1 Aug 2019 21:10:57 GMT'}]",2021-05-12,"[['Adamatzky', 'Andrew', ''], ['Tsompanas', 'Michail-Antisthenis', ''], ['Draper', 'Thomas C.', ''], ['Mayne', 'Richard', '']]","['liquid marbles', 'Belousov-Zhabotinsky reaction', 'photoresponse', 'liquidelectronics', 'chemical sensor']"
3482,2209.09592,Gido Schoenmacker,"Clara Rus, Jeffrey Luppes, Harrie Oosterhuis, Gido H. Schoenmacker",Closing the Gender Wage Gap: Adversarial Fairness in Job Recommendation,,"RecSys in HR'22: The 2nd Workshop on Recommender Systems for Human
  Resources, in conjunction with the 16th ACM Conference on Recommender
  Systems, September 18-23, 2022, Seattle, USA",,,cs.LG cs.IR,http://creativecommons.org/licenses/by/4.0/,"  The goal of this work is to help mitigate the already existing gender wage
gap by supplying unbiased job recommendations based on resumes from job
seekers. We employ a generative adversarial network to remove gender bias from
word2vec representations of 12M job vacancy texts and 900k resumes. Our results
show that representations created from recruitment texts contain algorithmic
bias and that this bias results in real-world consequences for recommendation
systems. Without controlling for bias, women are recommended jobs with
significantly lower salary in our data. With adversarially fair
representations, this wage gap disappears, meaning that our debiased job
recommendations reduce wage discrimination. We conclude that adversarial
debiasing of word representations can increase real-world fairness of systems
and thus may be part of the solution for creating fairness-aware recommendation
systems.
","[{'version': 'v1', 'created': 'Tue, 20 Sep 2022 10:11:40 GMT'}]",2022-09-22,"[['Rus', 'Clara', ''], ['Luppes', 'Jeffrey', ''], ['Oosterhuis', 'Harrie', ''], ['Schoenmacker', 'Gido H.', '']]","['Generative adversarial networks', 'Fairness-aware machine learning', 'Recruitment', 'Gender bias']"
3483,0812.0070,L.T. Handoko,"I. Firmansyah, Z. Akbar, B. Hermanto and L.T. Handoko","An Integrated Software-based Solution for Modular and Self-independent
  Networked Robot","9 pages, Proceeding of the 10th International Conference on Control,
  Automation, Robotics and Vision",,10.1109/ICARCV.2008.4795695,FISIKALIPI-08078,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An integrated software-based solution for a modular and self-independent
networked robot is introduced. The wirelessly operatable robot has been
developed mainly for autonomous monitoring works with full control over web.
The integrated software solution covers three components : a) the digital
signal processing unit for data retrieval and monitoring system; b) the
externally executable codes for control system; and c) the web programming for
interfacing the end-users with the robot. It is argued that this integrated
software-based approach is crucial to realize a flexible, modular and low
development cost mobile monitoring apparatus.
","[{'version': 'v1', 'created': 'Sat, 29 Nov 2008 12:52:54 GMT'}]",2009-03-06,"[['Firmansyah', 'I.', ''], ['Akbar', 'Z.', ''], ['Hermanto', 'B.', ''], ['Handoko', 'L. T.', '']]","['networked robot', 'mobile monitoring', 'digital processing']"
3484,1809.06911,David Orden,"David Orden and Encarnaci\'on Fern\'andez-Fern\'andez and Jos\'e M.
  Rodr\'iguez-Nogales and Josefina Vila-Crespo","Testing SensoGraph, a geometric approach for fast sensory evaluation","21 pages, 7 figures, 3 tables. Accepted at Food Quality and
  Preference","Food Quality and Preference 72 (2019), 1-9",10.1016/j.foodqual.2018.09.005,,cs.CG cs.AI cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces SensoGraph, a novel approach for fast sensory
evaluation using two-dimensional geometric techniques. In the tasting sessions,
the assessors follow their own criteria to place samples on a tablecloth,
according to the similarity between samples. In order to analyse the data
collected, first a geometric clustering is performed to each tablecloth,
extracting connections between the samples. Then, these connections are used to
construct a global similarity matrix. Finally, a graph drawing algorithm is
used to obtain a 2D consensus graphic, which reflects the global opinion of the
panel by (1) positioning closer those samples that have been globally perceived
as similar and (2) showing the strength of the connections between samples. The
proposal is validated by performing four tasting sessions, with three types of
panels tasting different wines, and by developing a new software to implement
the proposed techniques. The results obtained show that the graphics provide
similar positionings of the samples as the consensus maps obtained by multiple
factor analysis (MFA), further providing extra information about connections
between samples, not present in any previous method. The main conclusion is
that the use of geometric techniques provides information complementary to MFA,
and of a different type. Finally, the method proposed is computationally able
to manage a significantly larger number of assessors than MFA, which can be
useful for the comparison of pictures by a huge number of consumers, via the
Internet.
","[{'version': 'v1', 'created': 'Sun, 16 Sep 2018 07:38:31 GMT'}]",2018-09-25,"[['Orden', 'David', ''], ['Fernández-Fernández', 'Encarnación', ''], ['Rodríguez-Nogales', 'José M.', ''], ['Vila-Crespo', 'Josefina', '']]","['Sensory analysis', 'Wines', 'Projective Mapping', 'MultidimensionalScaling', 'Geometric graphs']"
3485,1611.08898,Dominik Kempa,"Juha K\""arkk\""ainen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi,
  Arseny M. Shur",On the Size of Lempel-Ziv and Lyndon Factorizations,12 pages,,10.4230/LIPIcs.STACS.2017.45,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lyndon factorization and Lempel-Ziv (LZ) factorization are both important
tools for analysing the structure and complexity of strings, but their
combinatorial structure is very different. In this paper, we establish the
first direct connection between the two by showing that while the Lyndon
factorization can be bigger than the non-overlapping LZ factorization (which we
demonstrate by describing a new, non-trivial family of strings) it is never
more than twice the size.
","[{'version': 'v1', 'created': 'Sun, 27 Nov 2016 19:44:12 GMT'}]",2020-12-08,"[['Kärkkäinen', 'Juha', ''], ['Kempa', 'Dominik', ''], ['Nakashima', 'Yuto', ''], ['Puglisi', 'Simon J.', ''], ['Shur', 'Arseny M.', '']]","['Lempel-Ziv factorization', 'Lempel-Ziv parsing', 'LZ', 'Lyndon word', 'Lyndonfactorization', 'Standard factorization']"
3486,1512.00054,Syed (Shawon) Rahman,Charles DeVoe and Shawon Rahman,Incident Response Plan for a Small to Medium Sized Hospital,,,10.5121/ijnsa.2013.5201,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most small to medium health care organizations do not have the capability to
address cyber incidents within the organization. Those that do are poorly
trained and ill equipped. These health care organizations are subject to
various laws that address privacy concerns, proper handling of financial
information, and Personally Identifiable Information. Currently an IT staff
handles responses to these incidents in an Ad Hoc manner. A properly trained,
staffed, and equipped Cyber Incident Response Team is needed to quickly respond
to these incidents to minimize data loss, and provide forensic data for the
purpose of notification, disciplinary action, legal action, and to remove the
risk vector. This paper will use the proven Incident Command System model used
in emergency services to show any sized agency can have an adequate CIRT
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2015 21:40:58 GMT'}]",2015-12-02,"[['DeVoe', 'Charles', ''], ['Rahman', 'Shawon', '']]","['Incident Response', 'Cyber Incidents', 'Incident Response Team', 'HIPAA', 'HITECH Act']"
3487,1907.05620,Kui Liu,"Anil Koyuncu, Kui Liu, Tegawend\'e F. Bissyand\'e, Dongsun Kim, Martin
  Monperrus, Jacques Klein and Yves Le Traon",iFixR: Bug Report driven Program Repair,Accepted by FSE 2019,"Proceedings of the 27th ACM Joint Meeting on European Software
  Engineering Conference and Symposium on the Foundations of Software
  Engineering, 2019",10.1145/3338906.3338935,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Issue tracking systems are commonly used in modern software development for
collecting feedback from users and developers. An ultimate automation target of
software maintenance is then the systematization of patch generation for
user-reported bugs. Although this ambition is aligned with the momentum of
automated program repair, the literature has, so far, mostly focused on
generate-and-validate setups where fault localization and patch generation are
driven by a well-defined test suite. On the one hand, however, the common (yet
strong) assumption on the existence of relevant test cases does not hold in
practice for most development settings: many bugs are reported without the
available test suite being able to reveal them. On the other hand, for many
projects, the number of bug reports generally outstrips the resources available
to triage them. Towards increasing the adoption of patch generation tools by
practitioners, we investigate a new repair pipeline, iFixR, driven by bug
reports: (1) bug reports are fed to an IR-based fault localizer; (2) patches
are generated from fix patterns and validated via regression testing; (3) a
prioritized list of generated patches is proposed to developers. We evaluate
iFixR on the Defects4J dataset, which we enriched (i.e., faults are linked to
bug reports) and carefully-reorganized (i.e., the timeline of test-cases is
naturally split). iFixR generates genuine/plausible patches for 21/44 Defects4J
faults with its IR-based fault localizer. iFixR accurately places a
genuine/plausible patch among its top-5 recommendation for 8/13 of these faults
(without using future test cases in generation-and-validation).
","[{'version': 'v1', 'created': 'Fri, 12 Jul 2019 08:35:40 GMT'}]",2019-08-20,"[['Koyuncu', 'Anil', ''], ['Liu', 'Kui', ''], ['Bissyandé', 'Tegawendé F.', ''], ['Kim', 'Dongsun', ''], ['Monperrus', 'Martin', ''], ['Klein', 'Jacques', ''], ['Traon', 'Yves Le', '']]","['Information retrieval', 'fault localization', 'automatic patch generation']"
3488,1812.01175,Md Fazlul Kader PhD,"Md. Fazlul Kader, Mohammed Belal Uddin, S.M. Riazul Islam, and Soo
  Young Shin","Capacity and outage analysis of a dual-hop decode-and-forward
  relay-aided NOMA scheme","Accepted for possible publication in Digital Signal Processing,
  Elsevier. 22 pages, 11 figures","Digital Signal Processing, 2019",10.1016/j.dsp.2019.02.014,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Non-orthogonal multiple access (NOMA) is regarded as a candidate radio access
technique for the next generation wireless networks because of its manifold
spectral gains. A two-phase cooperative relaying strategy (CRS) is proposed in
this paper by exploiting the concept of both downlink and uplink NOMA (termed
as DU-CNOMA). In the proposed protocol, a transmitter considered as a source
transmits a NOMA composite signal consisting of two symbols to the destination
and relay during the first phase, following the principle of downlink NOMA. In
the second phase, the relay forwards the symbol decoded by successive
interference cancellation to the destination, whereas the source transmits a
new symbol to the destination in parallel with the relay, following the
principle of uplink NOMA. The ergodic sum capacity, outage probability, and
outage sum capacity are investigated comprehensively along with analytical
derivations, under both perfect and imperfect successive interference
cancellation. The performance improvement of the proposed DU-CNOMA over the
conventional CRS using NOMA, is proved through analysis and computer
simulation. Furthermore, the correctness of the author's analysis is proved
through a strong agreement between simulation and analytical results.
","[{'version': 'v1', 'created': 'Tue, 4 Dec 2018 02:45:15 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Feb 2019 03:13:33 GMT'}]",2019-02-26,"[['Kader', 'Md. Fazlul', ''], ['Uddin', 'Mohammed Belal', ''], ['Islam', 'S. M. Riazul', ''], ['Shin', 'Soo Young', '']]","['Cooperative relaying', 'Downlink', 'Ergodic capacity', 'Non-orthogonal multiple access', 'Successive interference cancellation', 'Uplink']"
3489,1808.01520,Agust\'in Mista,"Agust\'in Mista, Alejandro Russo, John Hughes",Branching Processes for QuickCheck Generators,Extended version,,10.1145/3242744.3242747,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In QuickCheck (or, more generally, random testing), it is challenging to
control random data generators' distributions---specially when it comes to
user-defined algebraic data types (ADT). In this paper, we adapt results from
an area of mathematics known as branching processes, and show how they help to
analytically predict (at compile-time) the expected number of generated
constructors, even in the presence of mutually recursive or composite ADTs.
Using our probabilistic formulas, we design heuristics capable of automatically
adjusting probabilities in order to synthesize generators which distributions
are aligned with users' demands. We provide a Haskell implementation of our
mechanism in a tool called DRaGeN and perform case studies with real-world
applications. When generating random values, our synthesized QuickCheck
generators show improvements in code coverage when compared with those
automatically derived by state-of-the-art tools.
","[{'version': 'v1', 'created': 'Sat, 4 Aug 2018 19:03:14 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Aug 2018 16:19:16 GMT'}]",2018-08-08,"[['Mista', 'Agustín', ''], ['Russo', 'Alejandro', ''], ['Hughes', 'John', '']]","['Branching process', 'QuickCheck', 'Testing', 'Haskell']"
3490,1102.2008,Wolfgang Mulzer,Esther Ezra and Wolfgang Mulzer,"Convex Hull of Points Lying on Lines in o(n log n) Time after
  Preprocessing","26 pages, 5 figures, 1 appendix; a preliminary version appeared at
  SoCG 2011","Computational Geometry: Theory and Applications (CGTA), 46(4),
  2013, pp. 417-434",10.1016/j.comgeo.2012.03.004,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by the desire to cope with data imprecision, we study methods for
taking advantage of preliminary information about point sets in order to speed
up the computation of certain structures associated with them.
  In particular, we study the following problem: given a set L of n lines in
the plane, we wish to preprocess L such that later, upon receiving a set P of n
points, each of which lies on a distinct line of L, we can construct the convex
hull of P efficiently. We show that in quadratic time and space it is possible
to construct a data structure on L that enables us to compute the convex hull
of any such point set P in O(n alpha(n) log* n) expected time. If we further
assume that the points are ""oblivious"" with respect to the data structure, the
running time improves to O(n alpha(n)). The analysis applies almost verbatim
when L is a set of line-segments, and yields similar asymptotic bounds. We
present several extensions, including a trade-off between space and query time
and an output-sensitive algorithm. We also study the ""dual problem"" where we
show how to efficiently compute the (<= k)-level of n lines in the plane, each
of which lies on a distinct point (given in advance).
  We complement our results by Omega(n log n) lower bounds under the algebraic
computation tree model for several related problems, including sorting a set of
points (according to, say, their x-order), each of which lies on a given line
known in advance. Therefore, the convex hull problem under our setting is
easier than sorting, contrary to the ""standard"" convex hull and sorting
problems, in which the two problems require Theta(n log n) steps in the worst
case (under the algebraic computation tree model).
","[{'version': 'v1', 'created': 'Wed, 9 Feb 2011 23:38:26 GMT'}, {'version': 'v2', 'created': 'Sat, 9 Jul 2011 19:20:51 GMT'}, {'version': 'v3', 'created': 'Sat, 22 Dec 2012 08:53:57 GMT'}]",2012-12-27,"[['Ezra', 'Esther', ''], ['Mulzer', 'Wolfgang', '']]","['data imprecision', 'convex hull', 'planar arrangements', 'geometric data structures', 'randomizedconstructions']"
3491,1907.09729,Juntang Zhuang,"Juntang Zhuang, Nicha C. Dvornek, Xiaoxiao Li, Pamela Ventola, James
  S. Duncan",Invertible Network for Classification and Biomarker Selection for ASD,,"Medical Image Computing and Computer-Assisted Intervention 2019,
  MICCAI",10.1007/978-3-030-32248-9_78,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Determining biomarkers for autism spectrum disorder (ASD) is crucial to
understanding its mechanisms. Recently deep learning methods have achieved
success in the classification task of ASD using fMRI data. However, due to the
black-box nature of most deep learning models, it's hard to perform biomarker
selection and interpret model decisions. The recently proposed invertible
networks can accurately reconstruct the input from its output, and have the
potential to unravel the black-box representation. Therefore, we propose a
novel method to classify ASD and identify biomarkers for ASD using the
connectivity matrix calculated from fMRI as the input. Specifically, with
invertible networks, we explicitly determine the decision boundary and the
projection of data points onto the boundary. Like linear classifiers, the
difference between a point and its projection onto the decision boundary can be
viewed as the explanation. We then define the importance as the explanation
weighted by the gradient of prediction $w.r.t$ the input, and identify
biomarkers based on this importance measure. We perform a regression task to
further validate our biomarker selection: compared to using all edges in the
connectivity matrix, using the top 10\% important edges we generate a lower
regression error on 6 different severity scores. Our experiments show that the
invertible network is both effective at ASD classification and interpretable,
allowing for discovery of reliable biomarkers.
","[{'version': 'v1', 'created': 'Tue, 23 Jul 2019 07:31:39 GMT'}]",2019-10-14,"[['Zhuang', 'Juntang', ''], ['Dvornek', 'Nicha C.', ''], ['Li', 'Xiaoxiao', ''], ['Ventola', 'Pamela', ''], ['Duncan', 'James S.', '']]","['invertible network', 'ASD', 'biomarker', 'regression']"
3492,2102.02543,Vittorio Lippi,"Vittorio Lippi, Christoph Maurer and Thomas Mergner","The Importance of Models in Data Analysis with Small Human Movement
  Datasets -- Inspirations from Neurorobotics Applied to Posture Control of
  Humanoids and Humans","Presented at ICPRAM 2021, The International Conference on Pattern
  Recognition Applications and Methods","roceedings of the 10th International Conference on Pattern
  Recognition Applications and Methods - Volume 1: ICPRAM, (2021) ISBN
  978-989-758-486-2, pages 579-585",10.5220/0010297005790585,,cs.RO cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  This work presents a system identification procedure based on Convolutional
Neural Networks (CNN) for human posture control using the DEC (Disturbance
Estimation and Compensation) parametric model. The modular structure of the
proposed control model inspired the design of a modular identification
procedure, in the sense that the same neural network is used to identify the
parameters of the modules controlling different degrees of freedom. In this way
the presented examples of body sway induced by external stimuli provide several
training samples at once.
","[{'version': 'v1', 'created': 'Thu, 4 Feb 2021 11:02:11 GMT'}]",2021-03-08,"[['Lippi', 'Vittorio', ''], ['Maurer', 'Christoph', ''], ['Mergner', 'Thomas', '']]","['Posture Control', 'Machine Learning', 'Neurorobotics', 'Parametric Nonlinear Systems']"
3493,1902.00546,Hrshikesh Arora,"Hrshikesh Arora (Victoria University of Wellington, New Zealand),
  Marco Servetto (Victoria University Wellington, New Zealand), Bruno C. D. S.
  Oliveira (The University of Hong Kong, Hong Kong)",Separating Use and Reuse to Improve Both,,"The Art, Science, and Engineering of Programming, 2019, Vol. 3,
  Issue 3, Article 12",10.22152/programming-journal.org/2019/3/12,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Trait composition has inspired new research in the area of code
reuse for object oriented (OO) languages. One of the main advantages of this
kind of composition is that it makes possible to separate subtyping from
subclassing; which is good for code-reuse, design and reasoning. However,
handling of state within traits is difficult, verbose or inelegant. Inquiry: We
identify the this-leaking problem as the fundamental limitation that prevents
the separation of subtyping from subclassing in conventional OO languages. We
explain that the concept of trait composition addresses this problem, by
distinguishing code designed for use (as a type) from code designed for reuse
(i.e. inherited). We are aware of at least 3 concrete independently designed
research languages following this methodology: TraitRecordJ, Package Templates
and DeepFJig. Approach: In this paper, we design $42_\mu$ a new language, where
we improve use and reuse and support the This type and family polymorphism by
distinguishing code designed for use from code designed for reuse. In this way
$42_\mu$ synthesise the 3 approaches above, and improves them with abstract
state operations: a new elegant way to handle state composition in trait based
languages. Knowledge and Grounding: Using case studies, we show that $42_\mu$'s
model of traits with abstract state operations is more usable and compact than
prior work. We formalise our work and prove that type errors cannot arise from
composing well typed code. Importance: This work is the logical core of the
programming language 42. This shows that the ideas presented in this paper can
be applicable to a full general purpose language. This form of composition is
very flexible and could be used in many new languages.
","[{'version': 'v1', 'created': 'Fri, 1 Feb 2019 20:16:32 GMT'}]",2019-02-05,"[['Arora', 'Hrshikesh', '', 'Victoria University of Wellington, New Zealand'], ['Servetto', 'Marco', '', 'Victoria University Wellington, New Zealand'], ['Oliveira', 'Bruno C. D. S.', '', 'The University of Hong Kong, Hong Kong']]","['trait composition', 'subtyping', 'code reuse']"
3494,1309.2199,Przemyslaw Grabowicz Mr,"Przemyslaw A. Grabowicz, Luca Maria Aiello, V\'ictor M. Egu\'iluz,
  Alejandro Jaimes","Distinguishing Topical and Social Groups Based on Common Identity and
  Bond Theory","10 pages, 6 figures, 2 tables","2013. In Proceedings of the sixth ACM international conference on
  Web search and data mining (WSDM '13). ACM, New York, NY, USA, 627-636",10.1145/2433396.2433475,,cs.SI cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social groups play a crucial role in social media platforms because they form
the basis for user participation and engagement. Groups are created explicitly
by members of the community, but also form organically as members interact. Due
to their importance, they have been studied widely (e.g., community detection,
evolution, activity, etc.). One of the key questions for understanding how such
groups evolve is whether there are different types of groups and how they
differ. In Sociology, theories have been proposed to help explain how such
groups form. In particular, the common identity and common bond theory states
that people join groups based on identity (i.e., interest in the topics
discussed) or bond attachment (i.e., social relationships). The theory has been
applied qualitatively to small groups to classify them as either topical or
social. We use the identity and bond theory to define a set of features to
classify groups into those two categories. Using a dataset from Flickr, we
extract user-defined groups and automatically-detected groups, obtained from a
community detection algorithm. We discuss the process of manual labeling of
groups into social or topical and present results of predicting the group label
based on the defined features. We directly validate the predictions of the
theory showing that the metrics are able to forecast the group type with high
accuracy. In addition, we present a comparison between declared and detected
groups along topicality and sociality dimensions.
","[{'version': 'v1', 'created': 'Mon, 9 Sep 2013 15:47:00 GMT'}]",2013-09-10,"[['Grabowicz', 'Przemyslaw A.', ''], ['Aiello', 'Luca Maria', ''], ['Eguíluz', 'Víctor M.', ''], ['Jaimes', 'Alejandro', '']]","['Social Media', 'Groups', 'Bond theory', 'Identity theory', 'Flickr']"
3495,1705.02108,Rajat Tandon,"Abhinav Palia, Rajat Tandon",Optimizing noise level for perturbing geo-location data,10 pages and 3 figures,"FICC 2018: Advances in Information and Communication Networks pp
  63-73",10.1007/978-3-030-03405-4_5,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  With the tremendous increase in the number of smart phones, app stores have
been overwhelmed with applications requiring geo-location access in order to
provide their users better services through personalization. Revealing a user's
location to these third party apps, no matter at what frequency, is a severe
privacy breach which can have unpleasant social consequences. In order to
prevent inference attacks derived from geo-location data, a number of location
obfuscation techniques have been proposed in the literature. However, none of
them provides any objective measure of privacy guarantee. Some work has been
done to define differential privacy for geo-location data in the form of
geo-indistinguishability with l privacy guarantee. These techniques do not
utilize any prior background information about the Points of Interest (PoIs) of
a user and apply Laplacian noise to perturb all the location coordinates.
Intuitively, the utility of such a mechanism can be improved if the noise
distribution is derived after considering some prior information about PoIs.
  In this paper, we apply the standard definition of differential privacy on
geo-location data. We use first principles to model various privacy and utility
constraints, prior background information available about the PoIs
(distribution of PoI locations in a 1D plane) and the granularity of the input
required by different types of apps, in order to produce a more accurate and a
utility maximizing differentially private algorithm for geo-location data at
the OS level. We investigate this for a particular category of apps and for
some specific scenarios. This will also help us to verify that whether
Laplacian noise is still the optimal perturbation when we have such prior
information.
","[{'version': 'v1', 'created': 'Fri, 5 May 2017 07:28:54 GMT'}]",2019-01-03,"[['Palia', 'Abhinav', ''], ['Tandon', 'Rajat', '']]","['differential privacy', 'utility', 'Points of Interest', 'geo-location data']"
3496,1608.06673,Wojciech Mazurczyk,Krzysztof Cabaj and Wojciech Mazurczyk,"Using Software-Defined Networking for Ransomware Mitigation: the Case of
  CryptoWall","9 pages, 6 figures","IEEE Network, vol. 30, 2016, pp. 14-20",10.1109/MNET.2016.1600110NM,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Currently, different forms of ransomware are increasingly threatening
Internet users. Modern ransomware encrypts important user data and it is only
possible to recover it once a ransom has been paid. In this paper we show how
Software-Defined Networking (SDN) can be utilized to improve ransomware
mitigation. In more detail, we analyze the behavior of popular ransomware -
CryptoWall - and, based on this knowledge, we propose two real-time mitigation
methods. Then we designed the SDN-based system, implemented using OpenFlow,
which facilitates a timely reaction to this threat, and is a crucial factor in
the case of crypto ransomware. What is important is that such a design does not
significantly affect overall network performance. Experimental results confirm
that the proposed approach is feasible and efficient.
","[{'version': 'v1', 'created': 'Wed, 24 Aug 2016 00:16:22 GMT'}]",2018-04-10,"[['Cabaj', 'Krzysztof', ''], ['Mazurczyk', 'Wojciech', '']]","['ransomware', 'malware', 'software-defined networking', 'network security']"
3497,1111.3934,Bill Hibbard,Bill Hibbard,Model-based Utility Functions,"24 pages, extensive revisions","Journal of Artificial General Intelligence 3(1) 1-24, 2012",10.2478/v10229-011-0013-5,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Orseau and Ring, as well as Dewey, have recently described problems,
including self-delusion, with the behavior of agents using various definitions
of utility functions. An agent's utility function is defined in terms of the
agent's history of interactions with its environment. This paper argues, via
two examples, that the behavior problems can be avoided by formulating the
utility function in two steps: 1) inferring a model of the environment from
interactions, and 2) computing utility as a function of the environment model.
Basing a utility function on a model that the agent must learn implies that the
utility function must initially be expressed in terms of specifications to be
matched to structures in the learned model. These specifications constitute
prior assumptions about the environment so this approach will not work with
arbitrary environments. But the approach should work for agents designed by
humans to act in the physical world. The paper also addresses the issue of
self-modifying agents and shows that if provided with the possibility to modify
their utility functions agents will not choose to do so, under some usual
assumptions.
","[{'version': 'v1', 'created': 'Wed, 16 Nov 2011 20:13:54 GMT'}, {'version': 'v2', 'created': 'Sat, 12 May 2012 16:05:46 GMT'}]",2012-05-15,"[['Hibbard', 'Bill', '']]","['rational agent', 'utility function', 'self-delusion', 'self-modification']"
3498,1711.04705,Dmitrij Koznov Mr,"D.V. Luciv, D.V. Koznov, G.A. Chernishev, A.N. Terekhov",Detecting Near Duplicates in Software Documentation,,"Luciv, D.V., Koznov, D.V., Chernishev, G.A. et al. Program Comput
  Soft (2018) 44: 335",10.1134/S0361768818050079,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Contemporary software documentation is as complicated as the software itself.
During its lifecycle, the documentation accumulates a lot of near duplicate
fragments, i.e. chunks of text that were copied from a single source and were
later modified in different ways. Such near duplicates decrease documentation
quality and thus hamper its further utilization. At the same time, they are
hard to detect manually due to their fuzzy nature. In this paper we give a
formal definition of near duplicates and present an algorithm for their
detection in software documents. This algorithm is based on the exact software
clone detection approach: the software clone detection tool Clone Miner was
adapted to detect exact duplicates in documents. Then, our algorithm uses these
exact duplicates to construct near ones. We evaluate the proposed algorithm
using the documentation of 19 open source and commercial projects. Our
evaluation is very comprehensive - it covers various documentation types:
design and requirement specifications, programming guides and API
documentation, user manuals. Overall, the evaluation shows that all kinds of
software documentation contain a significant number of both exact and near
duplicates. Next, we report on the performed manual analysis of the detected
near duplicates for the Linux Kernel Documentation. We present both quantative
and qualitative results of this analysis, demonstrate algorithm strengths and
weaknesses, and discuss the benefits of duplicate management in software
documents.
","[{'version': 'v1', 'created': 'Mon, 13 Nov 2017 17:05:36 GMT'}]",2018-10-10,"[['Luciv', 'D. V.', ''], ['Koznov', 'D. V.', ''], ['Chernishev', 'G. A.', ''], ['Terekhov', 'A. N.', '']]","['software documentation', 'near duplicates', 'documentation reuse', 'software clonedetection']"
3499,1802.08831,Mai Zhu,"Mai Zhu, Bo Chang, Chong Fu",Convolutional Neural Networks combined with Runge-Kutta Methods,"26 pages, 2 figures",Neural Computing and Applications (2022),10.1007/s00521-022-07785-2,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A convolutional neural network can be constructed using numerical methods for
solving dynamical systems, since the forward pass of the network can be
regarded as a trajectory of a dynamical system. However, existing models based
on numerical solvers cannot avoid the iterations of implicit methods, which
makes the models inefficient at inference time. In this paper, we reinterpret
the pre-activation Residual Networks (ResNets) and their variants from the
dynamical systems view. We consider that the iterations of implicit Runge-Kutta
methods are fused into the training of these models. Moreover, we propose a
novel approach to constructing network models based on high-order Runge-Kutta
methods in order to achieve higher efficiency. Our proposed models are referred
to as the Runge-Kutta Convolutional Neural Networks (RKCNNs). The RKCNNs are
evaluated on multiple benchmark datasets. The experimental results show that
RKCNNs are vastly superior to other dynamical system network models: they
achieve higher accuracy with much fewer resources. They also expand the family
of network models based on numerical methods for dynamical systems.
","[{'version': 'v1', 'created': 'Sat, 24 Feb 2018 10:31:24 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Mar 2018 03:58:18 GMT'}, {'version': 'v3', 'created': 'Tue, 10 Apr 2018 13:36:03 GMT'}, {'version': 'v4', 'created': 'Sat, 14 Apr 2018 08:22:15 GMT'}, {'version': 'v5', 'created': 'Sat, 19 May 2018 02:17:21 GMT'}, {'version': 'v6', 'created': 'Thu, 17 Jan 2019 08:59:44 GMT'}, {'version': 'v7', 'created': 'Fri, 9 Sep 2022 13:56:00 GMT'}]",2022-10-18,"[['Zhu', 'Mai', ''], ['Chang', 'Bo', ''], ['Fu', 'Chong', '']]","['Convolutional Neural Network', 'Runge–Kutta methods', 'dynamical system', 'ODE', 'image classification']"
3500,2105.09978,Ayrat Khalimov,"L\'eo Exibard, Emmanuel Filiot, Ayrat Khalimov","A Generic Solution to Register-bounded Synthesis with an Application to
  Discrete Orders","Previously this version appeared as arXiv:2205.01952 which was
  submitted as a new work by accident. This is a full version of same-name
  paper accepted to ICALP'22",,10.4230/LIPIcs.ICALP.2022.116,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study synthesis of reactive systems interacting with environments using an
infinite data domain. A popular formalism for specifying and modelling such
systems is register automata and transducers. They extend finite-state automata
by adding registers to store data values and to compare the incoming data
values against stored ones. Synthesis from nondeterministic or universal
register automata is undecidable in general. However, its register-bounded
variant, where additionally a bound on the number of registers in a sought
transducer is given, is known to be decidable for universal register automata
which can compare data for equality, i.e., for data domain (N,=). This paper
extends the decidability border to the domain (N,<) of natural numbers with
linear order. Our solution is generic: we define a sufficient condition on data
domains (regular approximability) for decidability of register-bounded
synthesis. The condition is satisfied by natural data domains like (N,<). It
allows one to use simple language-theoretic arguments and avoid technical
game-theoretic reasoning. Further, by defining a generic notion of reducibility
between data domains, we show the decidability of synthesis in the domain
(N^d,<^d) of tuples of numbers equipped with the component-wise partial order
and in the domain (\Sigma^*,\prec) of finite strings with the prefix relation.
","[{'version': 'v1', 'created': 'Thu, 20 May 2021 18:21:21 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Sep 2021 06:54:48 GMT'}, {'version': 'v3', 'created': 'Fri, 15 Oct 2021 12:41:25 GMT'}, {'version': 'v4', 'created': 'Fri, 20 May 2022 12:15:50 GMT'}]",2022-05-23,"[['Exibard', 'Léo', ''], ['Filiot', 'Emmanuel', ''], ['Khalimov', 'Ayrat', '']]","['Synthesis', 'Register Automata', 'Transducers', 'Ordered Data Domains']"
3501,1511.03597,Wei Jeng,"Wei Jeng, Spencer DesAutels, Daqing He, Lei Li","Information exchange on an academic social networking site: A
  multidiscipline comparison on researchgate Q&A",,"(2017) Journal of the Association for Information Science and
  Technology. 68(3), 638-652",10.1002/asi.23692,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing popularity of academic social networking sites (ASNSs)
requires studies on the usage of ASNSs among scholars and evaluations of the
effectiveness of these ASNSs. However, it is unclear whether current ASNSs have
fulfilled their design goal, as scholars' actual online interactions on these
platforms remain unexplored. To fill the gap, this article presents a study
based on data collected from ResearchGate. Adopting a mixed-method design by
conducting qualitative content analysis and statistical analysis on 1,128 posts
collected from ResearchGate Q&A, we examine how scholars exchange information
and resources, and how their practices vary across three distinct disciplines:
library and information services, history of art, and astrophysics. Our results
show that the effect of a questioner's intention (i.e., seeking information or
discussion) is greater than disciplinary factors in some circumstances. Across
the three disciplines, responses to questions provide various resources,
including experts' contact details, citations, links to Wikipedia, images, and
so on. We further discuss several implications of the understanding of
scholarly information exchange and the design of better academic social
networking interfaces, which should stimulate scholarly interactions by
minimizing confusion, improving the clarity of questions, and promoting
scholarly content management.
","[{'version': 'v1', 'created': 'Wed, 11 Nov 2015 18:31:16 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Feb 2017 18:53:00 GMT'}]",2017-02-15,"[['Jeng', 'Wei', ''], ['DesAutels', 'Spencer', ''], ['He', 'Daqing', ''], ['Li', 'Lei', '']]","['Information exchange', 'scholarly information sharing', 'academic social networking', 'social Q&A', 'informal scholarly communication']"
3502,1112.5790,Hanan Alhazmi,Hanan Alhazmi and Nadine Akkari,"An Overview of Context-Aware Vertical Handover Schemes in Heterogeneous
  Networks","12 pages, 9 figures, Journal","International Journal of Computer Science & Engineering Survey
  (IJCSES) Vol.2, No.4, November 2011",10.5121/ijcses.2011.2403,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As wireless access technologies grow rapidly, the recent studies have focused
on granting mobile users the ability of roaming across different wireless
networks in a seamless manner thus offering seamless mobility. The different
characteristics of each wireless technology with regards to QoS brought many
challenges for provisioning the continuous services (audio/video streaming) in
a seamless way. In this paper, we intend to review the existing context-aware
methods which offered solutions for service continuity. We looked at the types
of context information used in each solution. Through this study, it is clear
that context awareness plays a significant role in handover process in order to
satisfy users demanding seamless services. Therefore, the goal of this paper is
to compare the existing methods grouped as general, IMS based, and WLAN/WiMAX
solutions in terms of several criteria, such as interworking architecture,
service continuity, and QoS provisioning.
","[{'version': 'v1', 'created': 'Sun, 25 Dec 2011 18:13:50 GMT'}]",2011-12-30,"[['Alhazmi', 'Hanan', ''], ['Akkari', 'Nadine', '']]","['Seamless Service Continuity', 'Context Awareness', 'Next Generation Wireless Networks', 'Vertical Handover (VHO)', 'WLAN/WiMAX interworking']"
3503,2112.03210,Sandra Sajeev,"Sandra Sajeev, Jade Huang, Nikos Karampatziakis, Matthew Hall,
  Sebastian Kochman, and Weizhu Chen",Contextual Bandit Applications in Customer Support Bot,in KDD 2021,"KDD '21: Proceedings of the 27th ACM SIGKDD Conference on
  Knowledge Discovery & Data Mining (August 2021) Pages 3522-3530",10.1145/3447548.3467165,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Virtual support agents have grown in popularity as a way for businesses to
provide better and more accessible customer service. Some challenges in this
domain include ambiguous user queries as well as changing support topics and
user behavior (non-stationarity). We do, however, have access to partial
feedback provided by the user (clicks, surveys, and other events) which can be
leveraged to improve the user experience. Adaptable learning techniques, like
contextual bandits, are a natural fit for this problem setting. In this paper,
we discuss real-world implementations of contextual bandits (CB) for the
Microsoft virtual agent. It includes intent disambiguation based on
neural-linear bandits (NLB) and contextual recommendations based on a
collection of multi-armed bandits (MAB). Our solutions have been deployed to
production and have improved key business metrics of the Microsoft virtual
agent, as confirmed by A/B experiments. Results include a relative increase of
over 12% in problem resolution rate and relative decrease of over 4% in
escalations to a human operator. While our current use cases focus on intent
disambiguation and contextual recommendation for support bots, we believe our
methods can be extended to other domains.
","[{'version': 'v1', 'created': 'Mon, 6 Dec 2021 18:07:34 GMT'}]",2021-12-07,"[['Sajeev', 'Sandra', ''], ['Huang', 'Jade', ''], ['Karampatziakis', 'Nikos', ''], ['Hall', 'Matthew', ''], ['Kochman', 'Sebastian', ''], ['Chen', 'Weizhu', '']]","['multi-armed bandits', 'contextual bandits', 'chat bots']"
3504,2211.12716,Jiawei Zhan,"Jiawei Zhan, Jun Liu, Wei Tang, Guannan Jiang, Xi Wang, Bin-Bin Gao,
  Tianliang Zhang, Wenlong Wu, Wei Zhang, Chengjie Wang, Yuan Xie","Global Meets Local: Effective Multi-Label Image Classification via
  Category-Aware Weak Supervision","12 pages, 10 figures, published in ACMMM 2022","Proceedings of the 30th ACM International Conference on
  Multimedia. 2022: 6318-6326",10.1145/3503161.3547834,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Multi-label image classification, which can be categorized into
label-dependency and region-based methods, is a challenging problem due to the
complex underlying object layouts. Although region-based methods are less
likely to encounter issues with model generalizability than label-dependency
methods, they often generate hundreds of meaningless or noisy proposals with
non-discriminative information, and the contextual dependency among the
localized regions is often ignored or over-simplified. This paper builds a
unified framework to perform effective noisy-proposal suppression and to
interact between global and local features for robust feature learning.
Specifically, we propose category-aware weak supervision to concentrate on
non-existent categories so as to provide deterministic information for local
feature learning, restricting the local branch to focus on more high-quality
regions of interest. Moreover, we develop a cross-granularity attention module
to explore the complementary information between global and local features,
which can build the high-order feature correlation containing not only
global-to-local, but also local-to-local relations. Both advantages guarantee a
boost in the performance of the whole network. Extensive experiments on two
large-scale datasets (MS-COCO and VOC 2007) demonstrate that our framework
achieves superior performance over state-of-the-art methods.
","[{'version': 'v1', 'created': 'Wed, 23 Nov 2022 05:39:17 GMT'}]",2022-11-24,"[['Zhan', 'Jiawei', ''], ['Liu', 'Jun', ''], ['Tang', 'Wei', ''], ['Jiang', 'Guannan', ''], ['Wang', 'Xi', ''], ['Gao', 'Bin-Bin', ''], ['Zhang', 'Tianliang', ''], ['Wu', 'Wenlong', ''], ['Zhang', 'Wei', ''], ['Wang', 'Chengjie', ''], ['Xie', 'Yuan', '']]","['multi-label classification', 'image recognition', 'region proposal', 'weaksupervision', 'self-attention']"
3505,1902.01494,Eshan Singh,"Eshan Singh, Keerthikumara Devarajegowda, Sebastian Simon, Ralf
  Schnieder, Karthik Ganesan, Mohammad R. Fadiheh, Dominik Stoffel, Wolfgang
  Kunz, Clark Barrett, Wolfgang Ecker and Subhasish Mitra","Symbolic QED Pre-silicon Verification for Automotive Microcontroller
  Cores: Industrial Case Study",,,10.23919/DATE.2019.8715271,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an industrial case study that demonstrates the practicality and
effectiveness of Symbolic Quick Error Detection (Symbolic QED) in detecting
logic design flaws (logic bugs) during pre-silicon verification. Our study
focuses on several microcontroller core designs (~1,800 flip-flops, ~70,000
logic gates) that have been extensively verified using an industrial
verification flow and used for various commercial automotive products. The
results of our study are as follows: 1. Symbolic QED detected all logic bugs in
the designs that were detected by the industrial verification flow (which
includes various flavors of simulation-based verification and formal
verification). 2. Symbolic QED detected additional logic bugs that were not
recorded as detected by the industrial verification flow. (These additional
bugs were also perhaps detected by the industrial verification flow.) 3.
Symbolic QED enables significant design productivity improvements: (a) 8X
improved (i.e., reduced) verification effort for a new design (8 person-weeks
for Symbolic QED vs. 17 person-months using the industrial verification flow).
(b) 60X improved verification effort for subsequent designs (2 person-days for
Symbolic QED vs. 4-7 person-months using the industrial verification flow). (c)
Quick bug detection (runtime of 20 seconds or less), together with short
counterexamples (10 or fewer instructions) for quick debug, using Symbolic QED.
","[{'version': 'v1', 'created': 'Mon, 4 Feb 2019 23:16:53 GMT'}]",2019-10-16,"[['Singh', 'Eshan', ''], ['Devarajegowda', 'Keerthikumara', ''], ['Simon', 'Sebastian', ''], ['Schnieder', 'Ralf', ''], ['Ganesan', 'Karthik', ''], ['Fadiheh', 'Mohammad R.', ''], ['Stoffel', 'Dominik', ''], ['Kunz', 'Wolfgang', ''], ['Barrett', 'Clark', ''], ['Ecker', 'Wolfgang', ''], ['Mitra', 'Subhasish', '']]","['Bounded Model Checking', 'Formal verification', 'Presilicon verification', 'Symbolic Quick Error Detection']"
3506,1911.09315,Alberto Barbado Gonzalez,"Alberto Barbado, \'Oscar Corcho, Richard Benjamins","Rule Extraction in Unsupervised Anomaly Detection for Model
  Explainability: Application to OneClass SVM","23 pages, 18 figures","Expert Systems with Applications Volume 189, 1 March 2022, 116100",10.1016/j.eswa.2021.116100,,cs.LG cs.AI,http://creativecommons.org/licenses/by-sa/4.0/,"  OneClass SVM is a popular method for unsupervised anomaly detection. As many
other methods, it suffers from the black box problem: it is difficult to
justify, in an intuitive and simple manner, why the decision frontier is
identifying data points as anomalous or non anomalous. Such type of problem is
being widely addressed for supervised models. However, it is still an uncharted
area for unsupervised learning. In this paper, we evaluate several rule
extraction techniques over OneClass SVM models, as well as present alternative
designs for some of those algorithms. Together with that, we propose algorithms
to compute metrics related with eXplainable Artificial Intelligence (XAI)
regarding the ""comprehensibility"", ""representativeness"", ""stability"" and
""diversity"" of the extracted rules. We evaluate our proposals with different
datasets, including real-world data coming from industry. With this, our
proposal contributes to extend XAI techniques to unsupervised machine learning
models.
","[{'version': 'v1', 'created': 'Thu, 21 Nov 2019 07:14:43 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Apr 2020 11:10:00 GMT'}, {'version': 'v3', 'created': 'Sat, 6 Jun 2020 09:21:27 GMT'}, {'version': 'v4', 'created': 'Mon, 29 Jun 2020 07:07:28 GMT'}, {'version': 'v5', 'created': 'Thu, 1 Apr 2021 08:24:04 GMT'}]",2021-11-08,"[['Barbado', 'Alberto', ''], ['Corcho', 'Óscar', ''], ['Benjamins', 'Richard', '']]","['XAI', 'OneClass SVM', 'unsupervised learning', 'rule extraction', 'anomaly detection', 'metrics']"
3507,1806.03211,Jordan Dworkin,"Jordan D. Dworkin, Russell T. Shinohara, Danielle S. Bassett",The landscape of NeuroImage-ing research,,,10.1016/j.neuroimage.2018.09.005,,cs.SI stat.AP,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  As the field of neuroimaging grows, it can be difficult for scientists within
the field to gain and maintain a detailed understanding of its ever-changing
landscape. While collaboration and citation networks highlight important
contributions within the field, the roles of and relations among specific areas
of study can remain quite opaque. Here, we apply techniques from network
science to map the landscape of neuroimaging research documented in the journal
NeuroImage over the past decade. We create a network in which nodes represent
research topics, and edges give the degree to which these topics tend to be
covered in tandem. The network displays small-world architecture, with
communities characterized by common imaging modalities and medical
applications, and with bridges that integrate these distinct subfields. Using
node-level analysis, we quantify the structural roles of individual topics
within the neuroimaging landscape, and find high levels of clustering within
the structural MRI subfield as well as increasing participation among topics
related to psychiatry. The overall prevalence of a topic is unrelated to the
prevalence of its neighbors, but the degree to which a topic becomes more or
less popular over time is strongly related to changes in the prevalence of its
neighbors. Broadly, this work presents a cohesive model for understanding the
landscape of neuroimaging research across the field, in broad subfields, and
within specific topic areas.
","[{'version': 'v1', 'created': 'Fri, 8 Jun 2018 15:14:06 GMT'}]",2019-01-24,"[['Dworkin', 'Jordan D.', ''], ['Shinohara', 'Russell T.', ''], ['Bassett', 'Danielle S.', '']]","['knowledge network', 'graph theory', 'neuroimaging']"
3508,1503.08289,Matteo Brunelli,Matteo Brunelli,"Recent advances on inconsistency indices for pairwise comparisons - a
  commentary","13 pages, 2 figures","Fundamenta Informaticae, 144(3-4), 321-332, 2016",10.3233/FI-2016-1338,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper recalls the definition of consistency for pairwise comparison
matrices and briefly presents the concept of inconsistency index in connection
to other aspects of the theory of pairwise comparisons. By commenting on a
recent contribution by Koczkodaj and Szwarc, it will be shown that the
discussion on inconsistency indices is far from being over, and the ground is
still fertile for debates.
","[{'version': 'v1', 'created': 'Sat, 28 Mar 2015 10:24:43 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Jul 2015 08:56:35 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Mar 2016 14:47:12 GMT'}]",2016-03-11,"[['Brunelli', 'Matteo', '']]","['Pairwise comparisons', 'valued preference relations', 'consistency', 'inconsistency index', 'analytic hierarchy process']"
3509,1308.5133,Uwe Aickelin,"Naisan Benatar, Uwe Aickelin and Jonathan M. Garibald","Performance Measurement Under Increasing Environmental Uncertainty In
  The Context of Interval Type-2 Fuzzy Logic Based Robotic Sailing",International Conference on Fuzzy Systems 2013 (Fuzz-IEEE 2013),,10.2139/ssrn.2828470,,cs.RO cs.NE cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Performance measurement of robotic controllers based on fuzzy logic,
operating under uncertainty, is a subject area which has been somewhat ignored
in the current literature. In this paper standard measures such as RMSE are
shown to be inappropriate for use under conditions where the environmental
uncertainty changes significantly between experiments. An overview of current
methods which have been applied by other authors is presented, followed by a
design of a more sophisticated method of comparison. This method is then
applied to a robotic control problem to observe its outcome compared with a
single measure. Results show that the technique described provides a more
robust method of performance comparison than less complex methods allowing
better comparisons to be drawn.
","[{'version': 'v1', 'created': 'Fri, 23 Aug 2013 14:25:07 GMT'}]",2016-11-17,"[['Benatar', 'Naisan', ''], ['Aickelin', 'Uwe', ''], ['Garibald', 'Jonathan M.', '']]","['Interval Type-2 Fuzzy', 'Robot Boat control', 'FuzzyControl', 'Performance measures', 'Uncertainty']"
3510,1705.06936,Tomasz Grel,"Robert Adamski, Tomasz Grel, Maciej Klimek and Henryk Michalewski",Atari games and Intel processors,,,10.1007/978-3-319-75931-9_1,,cs.DC cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The asynchronous nature of the state-of-the-art reinforcement learning
algorithms such as the Asynchronous Advantage Actor-Critic algorithm, makes
them exceptionally suitable for CPU computations. However, given the fact that
deep reinforcement learning often deals with interpreting visual information, a
large part of the train and inference time is spent performing convolutions. In
this work we present our results on learning strategies in Atari games using a
Convolutional Neural Network, the Math Kernel Library and TensorFlow 0.11rc0
machine learning framework. We also analyze effects of asynchronous
computations on the convergence of reinforcement learning algorithms.
","[{'version': 'v1', 'created': 'Fri, 19 May 2017 11:19:45 GMT'}]",2018-04-17,"[['Adamski', 'Robert', ''], ['Grel', 'Tomasz', ''], ['Klimek', 'Maciej', ''], ['Michalewski', 'Henryk', '']]","['reinforcement learning', 'deep learning', 'Atari games', 'asynchronouscomputations']"
3511,1707.08342,Yann Dauxais,"Thomas Guyet (1), Andr\'e Happe, Yann Dauxais (2) ((1) LACODAM, (2)
  UR1)",Declarative Sequential Pattern Mining of Care Pathways,,"Conference on Artificial Intelligence in Medicine in Europe, Jun
  2017, Vienna, Austria. 24, pp.1161 - 266, 2017",10.1002/pds.3879,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sequential pattern mining algorithms are widely used to explore care pathways
database, but they generate a deluge of patterns, mostly redundant or useless.
Clinicians need tools to express complex mining queries in order to generate
less but more significant patterns. These algorithms are not versatile enough
to answer complex clinician queries. This article proposes to apply a
declarative pattern mining approach based on Answer Set Programming paradigm.
It is exemplified by a pharmaco-epidemiological study investigating the
possible association between hospitalization for seizure and antiepileptic drug
switch from a french medico-administrative database.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 09:49:21 GMT'}]",2017-07-27,"[['Guyet', 'Thomas', ''], ['Happe', 'André', ''], ['Dauxais', 'Yann', '']]","['answer set programming', 'epidemiology', 'medico-administrative databases', 'patient care pathways']"
3512,1812.07873,Manh Duong Phung,"V.T. Hoang, M.D. Phung, T.H. Dinh, Q.P. Ha",Angle-Encoded Swarm Optimization for UAV Formation Path Planning,"In Proceedings of The 2018 IEEE/RSJ International Conference on
  Intelligent Robots and Systems (IROS 2018), pp. 5239-5244",,10.1109/IROS.2018.8593930,,cs.RO cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel and feasible path planning technique for a group
of unmanned aerial vehicles (UAVs) conducting surface inspection of
infrastructure. The ultimate goal is to minimise the travel distance of UAVs
while simultaneously avoid obstacles, and maintain altitude constraints as well
as the shape of the UAV formation. A multiple-objective optimisation algorithm,
called the Angle-encoded Particle Swarm Optimization (theta-PSO) algorithm, is
proposed to accelerate the swarm convergence with angular velocity and position
being used for the location of particles. The whole formation is modelled as a
virtual rigid body and controlled to maintain a desired geometric shape among
the paths created while the centroid of the group follows a pre-determined
trajectory. Based on the testbed of 3DR Solo drones equipped with a proprietary
Mission Planner, and the Internet-of-Things (IoT) for multi-directional
transmission and reception of data between the UAVs, extensive experiments have
been conducted for triangular formation maintenance along a monorail bridge.
The results obtained confirm the feasibility and effectiveness of the proposed
approach.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2018 10:56:59 GMT'}]",2019-01-16,"[['Hoang', 'V. T.', ''], ['Phung', 'M. D.', ''], ['Dinh', 'T. H.', ''], ['Ha', 'Q. P.', '']]","['Quadcopter', 'θ-PSO', 'path planning', 'IoT', 'triangularformation', 'collision avoidance']"
3513,1711.03660,Long Chen,"Long Chen, Jigang Wu, Xinxiang Zhang","TARCO: Two-Stage Auction for D2D Relay Aided Computation Resource
  Allocation in Hetnet","22 pages, 9 figures, Working paper, SUBMITTED to IEEE TRANSACTIONS ON
  SERVICES COMPUTING","IEEE Transactions on Services Computing, 2018",10.1109/TSC.2018.2792024,"vol. PP, no. 99 (Neither the final version Nor revise version)",cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In heterogeneous cellular network, task scheduling for computation offloading
is one of the biggest challenges. Most works focus on alleviating heavy burden
of macro base stations by moving the computation tasks on macro-cell user
equipment (MUE) to remote cloud or small-cell base stations. But the
selfishness of network users is seldom considered. Motivated by the cloud edge
computing, this paper provides incentive for task transfer from macro cell
users to small cell base stations. The proposed incentive scheme utilizes small
cell user equipment to provide relay service. The problem of computation
offloading is modelled as a two-stage auction, in which the remote MUEs with
common social character can form a group and then buy the computation resource
of small-cell base stations with the relay of small cell user equipment. A
two-stage auction scheme named TARCO is contributed to maximize utilities for
both sellers and buyers in the network. The truthful, individual rationality
and budget balance of the TARCO are also proved in this paper. In addition, two
algorithms are proposed to further refine TARCO on the social welfare of the
network. Extensive simulation results demonstrate that, TARCO is better than
random algorithm by about 104.90% in terms of average utility of MUEs, while
the performance of TARCO is further improved up to 28.75% and 17.06% by the
proposed two algorithms, respectively.
","[{'version': 'v1', 'created': 'Fri, 10 Nov 2017 01:07:16 GMT'}]",2018-01-12,"[['Chen', 'Long', ''], ['Wu', 'Jigang', ''], ['Zhang', 'Xinxiang', '']]","['Auction', 'Computation Offloading', 'HetNet', 'incentive', 'Relay']"
3514,1812.04530,Alireza Aghamohammadi,"Alireza Aghamohammadi, Maliheh Izadi, Abbas Heydarnoori","Generating Summaries for Methods of Event-Driven Programs: an Android
  Case Study",,,10.1016/j.jss.2020.110800,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The lack of proper documentation makes program comprehension a cumbersome
process for developers. Source code summarization is one of the existing
solutions to this problem. Lots of approaches have been proposed to summarize
source code in recent years. A prevalent weakness of these solutions is that
they do not pay much attention to interactions among elements of a software. An
element is simply a callable code snippet such as a method or even a clickable
button. As a result, these approaches cannot be applied to event-driven
programs, such as Android applications, because they have specific features
such as numerous interactions between their elements. To tackle this problem,
we propose a novel approach based on deep neural networks and dynamic call
graphs to generate summaries for methods of event-driven programs. First, we
collect a set of comment/code pairs from Github and train a deep neural network
on the set. Afterward, by exploiting a dynamic call graph, the Pagerank
algorithm, and the pre-trained deep neural network, we generate summaries. An
empirical evaluation with 14 real-world Android applications and 42
participants indicates 32.3% BLEU4 which is a definite improvement compared to
the existing state-of-the-art techniques. We also assessed the informativeness
and naturalness of our generated summaries from developers' perspectives and
showed they are sufficiently understandable and informative.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2018 16:42:47 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Jul 2020 12:01:44 GMT'}, {'version': 'v3', 'created': 'Sat, 1 Aug 2020 11:00:35 GMT'}]",2020-08-31,"[['Aghamohammadi', 'Alireza', ''], ['Izadi', 'Maliheh', ''], ['Heydarnoori', 'Abbas', '']]","['Source Code Summarization', 'Neural', 'Machine Translation', 'Event-DrivenPrograms', 'Deep Learning']"
3515,1806.09410,"David K\""ugler","David K\""ugler, Alexander Distergoft, Arjan Kuijper, Anirban
  Mukhopadhyay",Exploring Adversarial Examples: Patterns of One-Pixel Attacks,Figure 4 corrected from published Version to correct y-axis labels,"Understanding and Interpreting Machine Learning in Medical Image
  Computing Applications Lecture Notes in Computer Science vol. 11038. Springer
  International Publishing, Cham (2018)",10.1007/978-3-030-02628-8_8,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Failure cases of black-box deep learning, e.g. adversarial examples, might
have severe consequences in healthcare. Yet such failures are mostly studied in
the context of real-world images with calibrated attacks. To demystify the
adversarial examples, rigorous studies need to be designed. Unfortunately,
complexity of the medical images hinders such study design directly from the
medical images. We hypothesize that adversarial examples might result from the
incorrect mapping of image space to the low dimensional generation manifold by
deep networks. To test the hypothesis, we simplify a complex medical problem
namely pose estimation of surgical tools into its barest form. An analytical
decision boundary and exhaustive search of the one-pixel attack across multiple
image dimensions let us localize the regions of frequent successful one-pixel
attacks at the image space.
","[{'version': 'v1', 'created': 'Mon, 25 Jun 2018 12:20:49 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Nov 2018 16:34:57 GMT'}]",2018-11-14,"[['Kügler', 'David', ''], ['Distergoft', 'Alexander', ''], ['Kuijper', 'Arjan', ''], ['Mukhopadhyay', 'Anirban', '']]","['CNN', 'Adversarial Examples', 'One-pixel Attack', 'Deep Learning Fails']"
3516,1301.1886,Fabrizio Pecoraro,Daniela Luzi and Fabrizio Pecoraro,An Information System to Support and Monitor Clinical Trial Process,"16 pages, 1 table, 5 figures; International Journal of Computer
  Science & Information Technology (IJCSIT) Vol 4, No 6, December 2012",,10.5121/ijcsit.2012.4602,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The demand of transparency of clinical research results, the need of
accelerating the process of transferring innovation in the daily medical
practice as well as assuring patient safety and product efficacy make it
necessary to extend the functionality of traditional trial registries. These
new systems should combine different functionalities to track the information
exchange, support collaborative work, manage regulatory documents and monitor
the entire clinical investigation (CIV) lifecycle. This is the approach used to
develop MEDIS, a Medical Device Information System, described in this paper
under the perspective of the business process, and the underlining
architecture. Moreover, MEDIS was designed on the basis of Health Level 7 (HL7)
v.3 standards and methodology to make it interoperable with similar registries,
but also to facilitate information exchange between different health
information systems.
","[{'version': 'v1', 'created': 'Wed, 9 Jan 2013 15:19:20 GMT'}]",2013-01-10,"[['Luzi', 'Daniela', ''], ['Pecoraro', 'Fabrizio', '']]","['Clinical trial business process', 'Medical devices', 'System architecture', 'Data model', 'Trial registry']"
3517,1305.3041,Magnus Find,"Joan Boyar, Magnus Find",Cancellation-Free Circuits in Unbounded and Bounded Depth,"IMADA-preprint 2013. This article supersedes arXiv:1207.5321. The
  publication is available from ScienceDirect",,10.1016/j.tcs.2014.10.014,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the notion of ""cancellation-free"" circuits. This is a restriction of
linear Boolean circuits (XOR circuits), but can be considered as being
equivalent to previously studied models of computation. The notion was coined
by Boyar and Peralta in a study of heuristics for a particular circuit
minimization problem. They asked how large a gap there can be between the
smallest cancellation-free circuit and the smallest linear circuit. We show
that the difference can be a factor $\Omega(n/\log^{2}n)$. This improves on a
recent result by Sergeev and Gashkov who have studied a similar problem.
Furthermore, our proof holds for circuits of constant depth. We also study the
complexity of computing the Sierpinski matrix using cancellation-free circuits
and give a tight $\Omega(n\log n)$ lower bound.
","[{'version': 'v1', 'created': 'Tue, 14 May 2013 07:13:03 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Oct 2014 07:28:23 GMT'}]",2014-10-20,"[['Boyar', 'Joan', ''], ['Find', 'Magnus', '']]","['Circuit Complexity', 'Cancellation-free', 'Linear Circuits']"
3518,2003.12848,Anil Yaman,"Anil Yaman, Giovanni Iacca",Distributed Embodied Evolution over Networks,,Applied Soft Computing (2020) 106993,10.1016/j.asoc.2020.106993,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In several network problems the optimum behavior of the agents (i.e., the
nodes of the network) is not known before deployment. Furthermore, the agents
might be required to adapt, i.e. change their behavior based on the environment
conditions. In these scenarios, offline optimization is usually costly and
inefficient, while online methods might be more suitable. In this work, we use
a distributed Embodied Evolution approach to optimize spatially distributed,
locally interacting agents by allowing them to exchange their behavior
parameters and learn from each other to adapt to a certain task within a given
environment. Our results on several test scenarios show that the local exchange
of information, performed by means of crossover of behavior parameters with
neighbors, allows the network to conduct the optimization process more
efficiently than the cases where local interactions are not allowed, even when
there are large differences on the optimal behavior parameters within each
agent's neighborhood.
","[{'version': 'v1', 'created': 'Sat, 28 Mar 2020 17:34:48 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Apr 2020 17:47:17 GMT'}, {'version': 'v3', 'created': 'Mon, 1 Jun 2020 15:45:05 GMT'}, {'version': 'v4', 'created': 'Mon, 21 Dec 2020 01:58:50 GMT'}]",2020-12-22,"[['Yaman', 'Anil', ''], ['Iacca', 'Giovanni', '']]","['Embodied Evolution', 'Distributed Evolution', 'Genetic Algorithms', 'Networks', 'IoT']"
3519,1307.3648,David Gajser,David Gajser,Verifying Time Complexity of Deterministic Turing Machines,"18 pages, 1 figure","Theoretical Computer Science, Volume 600, p. 86-97, 2015",10.1016/j.tcs.2015.07.028,,cs.LO cs.CC cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that, for all reasonable functions $T(n)=o(n\log n)$, we can
algorithmically verify whether a given one-tape Turing machine runs in time at
most $T(n)$. This is a tight bound on the order of growth for the function $T$
because we prove that, for $T(n)\geq(n+1)$ and $T(n)=\Omega(n\log n)$, there
exists no algorithm that would verify whether a given one-tape Turing machine
runs in time at most $T(n)$.
  We give results also for the case of multi-tape Turing machines. We show that
we can verify whether a given multi-tape Turing machine runs in time at most
$T(n)$ iff $T(n_0)< (n_0+1)$ for some $n_0\in\mathbb{N}$.
  We prove a very general undecidability result stating that, for any class of
functions $\mathcal{F}$ that contains arbitrary large constants, we cannot
verify whether a given Turing machine runs in time $T(n)$ for some
$T\in\mathcal{F}$. In particular, we cannot verify whether a Turing machine
runs in constant, polynomial or exponential time.
","[{'version': 'v1', 'created': 'Sat, 13 Jul 2013 14:21:35 GMT'}, {'version': 'v2', 'created': 'Mon, 19 May 2014 07:55:01 GMT'}]",2019-01-15,"[['Gajser', 'David', '']]","['Turing machine', 'running time', 'decidable', 'crossing sequence', 'regular expression']"
3520,2102.09732,Stephen MacDonell,Sherlock A. Licorish and Stephen G. MacDonell,Personality Profiles of Global Software Developers,"Conference paper, 11 pages, 3 figures, 5 tables. arXiv admin note:
  text overlap with arXiv:2102.06317","Proceedings of the 18th International Conference on Evaluation and
  Assessment in Software Engineering (EASE2014). London, UK, ACM Press, pp.1-10",10.1145/2601248.2601265,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Individuals' personality traits have been shown to influence their
behavior during team work. In particular, positive group attitudes are said to
be essential for distributed and global software development efforts where
collaboration is critical to project success. Objective: Given this, we have
sought to study the influence of global software practitioners' personality
profiles from a psycholinguistic perspective. Method: Artifacts from ten teams
were selected from the IBM Rational Jazz repository and mined. We employed
social network analysis (SNA) techniques to identify and group practitioners
into two clusters based on the numbers of messages they communicated, Top
Members and Others, and used standard statistical techniques to assess
practitioners' engagement in task changes associated with work items. We then
performed psycholinguistic analysis on practitioners' messages using linguistic
dimensions of the LIWC tool that had been previously correlated with the Big
Five personality profiles. Results: For our sample of 146 practitioners, we
found that the Top Members demonstrated more openness to experience than the
Other practitioners. Additionally, practitioners involved in usability-related
tasks were found to be highly extroverted, and coders were most neurotic and
conscientious. Conclusion: High levels of organizational and inter-personal
skills may be useful for those operating in distributed settings, and
personality diversity is likely to boost team performance.
","[{'version': 'v1', 'created': 'Fri, 19 Feb 2021 04:14:45 GMT'}]",2021-02-22,"[['Licorish', 'Sherlock A.', ''], ['MacDonell', 'Stephen G.', '']]","['Software engineering', 'Human factors', 'Personality', 'Empirical study', 'Psycholinguistics', 'Jazz']"
3521,1606.08226,"D\""om\""ot\""or P\'alv\""olgyi","D\""om\""ot\""or P\'alv\""olgyi",Weak embeddings of posets to the Boolean lattice,,"Discrete Mathematics & Theoretical Computer Science, Vol. 20 no.
  1, Graph Theory (January 24, 2018) dmtcs:4232",10.23638/DMTCS-20-1-7,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The goal of this paper is to prove that several variants of deciding whether
a poset can be (weakly) embedded into a small Boolean lattice, or to a few
consecutive levels of a Boolean lattice, are NP-complete, answering a question
of Griggs and of Patkos. As an equivalent reformulation of one of these
problems, we also derive that it is NP-complete to decide whether a given graph
can be embedded to the two middle levels of some hypercube.
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2016 11:47:24 GMT'}, {'version': 'v2', 'created': 'Tue, 23 May 2017 12:48:48 GMT'}, {'version': 'v3', 'created': 'Fri, 24 Nov 2017 20:16:12 GMT'}, {'version': 'v4', 'created': 'Tue, 23 Jan 2018 11:26:09 GMT'}]",2019-03-14,"[['Pálvölgyi', 'Dömötör', '']]","['extremal combinatorics', 'forbidden subposet', 'NP-completeness']"
3522,2011.03516,Yusuke Izawa,Yusuke Izawa and Hidehiko Masuhara,"Amalgamating Different JIT Compilations in a Meta-tracing JIT Compiler
  Framework",,"Proceedings of the 16th ACM SIGPLAN International Symposium on
  Dynamic Languages (DLS 2020)",10.1145/3426422.3426977,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many modern virtual machines, such as JVMs, .NET Framework, and V8, employ a
just-in-time (JIT) compiler to achieve their high-performance. There are two
major compilation strategies; trace-based compilation and method-based
compilation. They have their own advantages and disadvantages, so we presume
that applying suitable strategies for different program parts is essential for
faster execution. This paper proposes a new approach called the meta-hybrid JIT
compiler framework, which combined the two strategies in a single meta-JIT
compiler framework. We implemented the BacCaml framework for proof-of-concept.
We also report that some programs actually ran faster by the hybrid compilation
in our experiments.
","[{'version': 'v1', 'created': 'Fri, 6 Nov 2020 18:47:42 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Nov 2020 10:03:21 GMT'}, {'version': 'v3', 'created': 'Mon, 30 Nov 2020 08:43:23 GMT'}]",2020-12-01,"[['Izawa', 'Yusuke', ''], ['Masuhara', 'Hidehiko', '']]","['JIT compiler', 'language implementation framework', 'meta-tracing JIT compiler', 'RPython']"
3523,2006.07042,Nicolas Grislain,"Nicolas Grislain, Nicolas Perrin and Antoine Thabault",Recurrent Neural Networks for Stochastic Control in Real-Time Bidding,,"2019. Proceedings of the 25th ACM SIGKDD International Conference
  on Knowledge Discovery & Data Mining. Association for Computing Machinery,
  New York, NY, USA",10.1145/3292500.3330749,,cs.LG cs.AI cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bidding in real-time auctions can be a difficult stochastic control task;
especially if underdelivery incurs strong penalties and the market is very
uncertain. Most current works and implementations focus on optimally delivering
a campaign given a reasonable forecast of the market. Practical implementations
have a feedback loop to adjust and be robust to forecasting errors, but no
implementation, to the best of our knowledge, uses a model of market risk and
actively anticipates market shifts. Solving such stochastic control problems in
practice is actually very challenging. This paper proposes an approximate
solution based on a Recurrent Neural Network (RNN) architecture that is both
effective and practical for implementation in a production environment. The RNN
bidder provisions everything it needs to avoid missing its goal. It also
deliberately falls short of its goal when buying the missing impressions would
cost more than the penalty for not reaching it.
","[{'version': 'v1', 'created': 'Fri, 12 Jun 2020 09:53:10 GMT'}]",2020-06-15,"[['Grislain', 'Nicolas', ''], ['Perrin', 'Nicolas', ''], ['Thabault', 'Antoine', '']]","['Ad-tech', 'Auctions', 'Real-Time Bidding', 'Recurrent Neural Network', 'Stochastic Control', 'RNN', 'RTB']"
3524,1902.01360,M. Hanefi Calp,"Murat Dener, M. Hanefi Calp","Solving The Exam Scheduling Problems in Central Exams With Genetic
  Algorithms",14 pages,,10.22531/muglajsci.423185,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is the efficient use of resources expected from an exam scheduling
application. There are various criteria for efficient use of resources and for
all tests to be carried out at minimum cost in the shortest possible time. It
is aimed that educational institutions with such criteria successfully carry
out central examination organizations. In the study, a two-stage genetic
algorithm was developed. In the first stage, the assignment of courses to
sessions was carried out. In the second stage, the students who participated in
the test session were assigned to examination rooms. Purposes of the study are
increasing the number of joint students participating in sessions, using the
minimum number of buildings in the same session, and reducing the number of
supervisors using the minimum number of classrooms possible. In this study, a
general purpose exam scheduling solution for educational institutions was
presented. The developed system can be used in different central examinations
to create originality. Given the results of the sample application, it is seen
that the proposed genetic algorithm gives successful results.1
","[{'version': 'v1', 'created': 'Mon, 4 Feb 2019 18:21:37 GMT'}]",2019-02-05,"[['Dener', 'Murat', ''], ['Calp', 'M. Hanefi', '']]","['Central Exams', 'Genetic Algorithm', 'Exam Scheduling Problem', 'Solving']"
3525,1309.0694,Nicolas Trotignon,"Fr\'ed\'eric Maffray, Nicolas Trotignon, Kristina Vu\v{s}kovi\'c","Algorithms for square-$3PC(\cdot, \cdot)$-free Berge graphs",,"SIAM Journal on Discrete Mathematics, 22(1):51-71, 2008",10.1137/050628520,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the class of graphs containing no odd hole, no odd antihole, and
no configuration consisting of three paths between two nodes such that any two
of the paths induce a hole, and at least two of the paths are of length 2. This
class generalizes claw-free Berge graphs and square-free Berge graphs. We give
a combinatorial algorithm of complexity $O(n^{7})$ to find a clique of maximum
weight in such a graph. We also consider several subgraph-detection problems
related to this class.
","[{'version': 'v1', 'created': 'Tue, 3 Sep 2013 14:22:42 GMT'}]",2016-03-27,"[['Maffray', 'Frédéric', ''], ['Trotignon', 'Nicolas', ''], ['Vušković', 'Kristina', '']]","['recognition algorithm', 'maximum weight clique algorithm', 'combinatorialalgorithms', 'perfect graphs', 'star decompositions']"
3526,1304.4051,Mehmet Aydin,Mehmet Emin Aydin,Coordinating metaheuristic agents with swarm intelligence,,"Journal of Intelligent Manufacturing, 23 (4), pp:991-999, 2012",10.1007/s10845-010-0435-y,,cs.MA cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Coordination of multi agent systems remains as a problem since there is no
prominent method to completely solve this problem. Metaheuristic agents are
specific implementations of multi-agent systems, which imposes working together
to solve optimisation problems with metaheuristic algorithms. The idea borrowed
from swarm intelligence seems working much better than those implementations
suggested before. This paper reports the performance of swarms of simulated
annealing agents collaborating with particle swarm optimization algorithm. The
proposed approach is implemented for multidimensional knapsack problem and has
resulted much better than some other works published before.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2013 11:09:41 GMT'}]",2013-04-16,"[['Aydin', 'Mehmet Emin', '']]","['metaheuristic agents', '· swarm intelligence', '· particle swarm optimization', '· simulated annealing']"
3527,1905.03587,Tamara Radivilova A,Igor Ivanisenko and Tamara Radivilova,The multifractal load balancing method,"2 pages, 2 figures. arXiv admin note: substantial text overlap with
  arXiv:1904.09227","2015 Second International Scientific-Practical Conference Problems
  of Infocommunications Science and Technology (PIC S&T)",10.1109/INFOCOMMST.2015.7357289,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The load-balancing system, built on the basis of a subsystem load balancer
and subsystem control and monitoring that closely interact with each other was
propose in work. This system is presented as a queuing system with priority
service discipline. In the described queuing system parallel processing flow
applications occur in the multiple serving devices and successive junction of
them into unified stream is done. The method of multifractal load balancing is
submited on the basis of the developed system of load balancing.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2019 12:04:11 GMT'}]",2019-05-10,"[['Ivanisenko', 'Igor', ''], ['Radivilova', 'Tamara', '']]","['load balancing', 'distributed system', 'queuing']"
3528,1704.08957,Felix Beierle,"Ingo Friese, Rebecca Copeland, Sebastian G\""ond\""or, Felix Beierle,
  Axel K\""upper, Ricardo Lopes Pereira, Jean-Michel Crom","Cross-Domain Discovery of Communication Peers. Identity Mapping and
  Discovery Services (IMaDS)","Accepted for publication at the 2017 European Conference on Networks
  and Communications (EuCNC)",,10.1109/EuCNC.2017.7980642,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The upcoming WebRTC-based browser-to-browser communication services present
new challenges for user discovery in peer-to-peer mode. Even more so, if we
wish to enable different web communication services to interact. This paper
presents Identity Mapping and Discovery Service (IMaDS), a global, scalable,
service independent discovery service that enables users of web-based
peer-to-peer applications to discover other users whom to communicate with. It
also provides reachability and presence information. For that, user identities
need to be mapped to any compatible service identity as well as to a globally
unique, service-independent identity. This mapping and discovery process is
suitable for multiple identifier formats and personal identifying properties,
but it supports user-determined privacy options. IMaDS operates across
different service domains dynamically, using context information. Users and
devices have profiles containing context and other specific information that
can be discovered by a search engine. The search results reveal the user's
allocated globally unique identifier (GUID), which is then resolved to a list
of the user's service domains identities, using a DHT-based directory service.
Service-specific directories allow tracking of active endpoints, where users
are currently logged on and can be contacted.
","[{'version': 'v1', 'created': 'Fri, 28 Apr 2017 14:34:05 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Nov 2017 16:12:56 GMT'}]",2017-11-20,"[['Friese', 'Ingo', ''], ['Copeland', 'Rebecca', ''], ['Göndör', 'Sebastian', ''], ['Beierle', 'Felix', ''], ['Küpper', 'Axel', ''], ['Pereira', 'Ricardo Lopes', ''], ['Crom', 'Jean-Michel', '']]","['discovery', 'identity mapping', 'communication endpoints', 'GUID', 'WebRTC', 'DHT', 'registry']"
3529,1804.08891,Nikolaos Polatidis Dr,"Nikolaos Polatidis, Christos K. Georgiadis","A multi-level collaborative filtering method that improves
  recommendations",,"Polatidis, Nikolaos, and Christos K. Georgiadis. A multi-level
  collaborative filtering method that improves recommendations. Expert Systems
  with Applications 48 (2016): 100-110",10.1016/j.eswa.2015.11.023,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Collaborative filtering is one of the most used approaches for providing
recommendations in various online environments. Even though collaborative
recommendation methods have been widely utilized due to their simplicity and
ease of use, accuracy is still an issue. In this paper we propose a multi-level
recommendation method with its main purpose being to assist users in decision
making by providing recommendations of better quality. The proposed method can
be applied in different online domains that use collaborative recommender
systems, thus improving the overall user experience. The efficiency of the
proposed method is shown by providing an extensive experimental evaluation
using five real datasets and with comparisons to alternatives.
","[{'version': 'v1', 'created': 'Tue, 24 Apr 2018 08:20:45 GMT'}]",2018-04-25,"[['Polatidis', 'Nikolaos', ''], ['Georgiadis', 'Christos K.', '']]","['Collaborative Filtering', 'Similarity', 'Multi-level', 'Hybrid', 'Recommender System']"
3530,0705.3740,Gilles Z\'emor,"J. Bringer, H. Chabanne, G. Cohen, B. Kindarji, G. Z\'emor",Optimal Iris Fuzzy Sketches,"9 pages. Submitted to the IEEE Conference on Biometrics: Theory,
  Applications and Systems, 2007 Washington DC","Biometrics: Theory, Applications, and Systems, 2007. BTAS 2007.
  First IEEE International Conference on",10.1109/BTAS.2007.4401904,,cs.CR,,"  Fuzzy sketches, introduced as a link between biometry and cryptography, are a
way of handling biometric data matching as an error correction issue. We focus
here on iris biometrics and look for the best error-correcting code in that
respect. We show that two-dimensional iterative min-sum decoding leads to
results near the theoretical limits. In particular, we experiment our
techniques on the Iris Challenge Evaluation (ICE) database and validate our
findings.
","[{'version': 'v1', 'created': 'Fri, 25 May 2007 10:38:14 GMT'}]",2008-04-02,"[['Bringer', 'J.', ''], ['Chabanne', 'H.', ''], ['Cohen', 'G.', ''], ['Kindarji', 'B.', ''], ['Zémor', 'G.', '']]","['Iris', 'biometry', 'fuzzy sketches', 'min-sum decoding']"
3531,2209.13540,Gard Spreemann,"Vegard Edvardsen, Gard Spreemann, Jeriek Van den Abeele","FORLORN: A Framework for Comparing Offline Methods and Reinforcement
  Learning for Optimization of RAN Parameters",,"Q2SWinet '22: Proceedings of the 18th ACM International Symposium
  on QoS and Security for Wireless and Mobile Networks on 18th ACM
  International Symposium on QoS and Security for Wireless and Mobile Networks
  (2022) 37-44",10.1145/3551661.3561363,,cs.NI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The growing complexity and capacity demands for mobile networks necessitate
innovative techniques for optimizing resource usage. Meanwhile, recent
breakthroughs have brought Reinforcement Learning (RL) into the domain of
continuous control of real-world systems. As a step towards RL-based network
control, this paper introduces a new framework for benchmarking the performance
of an RL agent in network environments simulated with ns-3. Within this
framework, we demonstrate that an RL agent without domain-specific knowledge
can learn how to efficiently adjust Radio Access Network (RAN) parameters to
match offline optimization in static scenarios, while also adapting on the fly
in dynamic scenarios, in order to improve the overall user experience. Our
proposed framework may serve as a foundation for further work in developing
workflows for designing RL-based RAN control algorithms.
","[{'version': 'v1', 'created': 'Thu, 8 Sep 2022 12:58:09 GMT'}]",2022-10-28,"[['Edvardsen', 'Vegard', ''], ['Spreemann', 'Gard', ''], ['Abeele', 'Jeriek Van den', '']]","['network optimization', 'reinforcement learning', 'network simulation']"
3532,1808.05128,Abhijit Mahalunkar,"Abhijit Mahalunkar, John D. Kelleher","Using Regular Languages to Explore the Representational Capacity of
  Recurrent Neural Architectures",International Conference of Artificial Neural Networks (ICANN) 2018,,10.1007/978-3-030-01424-7_19,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The presence of Long Distance Dependencies (LDDs) in sequential data poses
significant challenges for computational models. Various recurrent neural
architectures have been designed to mitigate this issue. In order to test these
state-of-the-art architectures, there is growing need for rich benchmarking
datasets. However, one of the drawbacks of existing datasets is the lack of
experimental control with regards to the presence and/or degree of LDDs. This
lack of control limits the analysis of model performance in relation to the
specific challenge posed by LDDs. One way to address this is to use synthetic
data having the properties of subregular languages. The degree of LDDs within
the generated data can be controlled through the k parameter, length of the
generated strings, and by choosing appropriate forbidden strings. In this
paper, we explore the capacity of different RNN extensions to model LDDs, by
evaluating these models on a sequence of SPk synthesized datasets, where each
subsequent dataset exhibits a longer degree of LDD. Even though SPk are simple
languages, the presence of LDDs does have significant impact on the performance
of recurrent neural architectures, thus making them prime candidate in
benchmarking tasks.
","[{'version': 'v1', 'created': 'Wed, 15 Aug 2018 15:20:49 GMT'}]",2018-10-09,"[['Mahalunkar', 'Abhijit', ''], ['Kelleher', 'John D.', '']]","['Sequential Models', 'Long Distance Dependency', 'RecurrentNeural Networks', 'Regular Languages', 'Strictly Piecewise Languages']"
3533,1707.05377,Fernando Concatto,"Fernando Concatto (1), Wellington Zunino (1), Luigi A. Giancoli (1),
  Rafael Santiago (1), Lu\'is C. Lamb (2) ((1) Universidade do Vale do
  Itaja\'i, (2) Federal University of Rio Grande do Sul)",Genetic Algorithm for Epidemic Mitigation by Removing Relationships,"GECCO '17 - Proceedings of the Genetic and Evolutionary Computation
  Conference",,10.1145/3071178.3071218,,cs.SI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Min-SEIS-Cluster is an optimization problem which aims at minimizing the
infection spreading in networks. In this problem, nodes can be susceptible to
an infection, exposed to an infection, or infectious. One of the main features
of this problem is the fact that nodes have different dynamics when interacting
with other nodes from the same community. Thus, the problem is characterized by
distinct probabilities of infecting nodes from both the same and from different
communities. This paper presents a new genetic algorithm that solves the
Min-SEIS-Cluster problem. This genetic algorithm surpassed the current
heuristic of this problem significantly, reducing the number of infected nodes
during the simulation of the epidemics. The results therefore suggest that our
new genetic algorithm is the state-of-the-art heuristic to solve this problem.
","[{'version': 'v1', 'created': 'Mon, 17 Jul 2017 19:15:35 GMT'}]",2017-07-19,"[['Concatto', 'Fernando', ''], ['Zunino', 'Wellington', ''], ['Giancoli', 'Luigi A.', ''], ['Santiago', 'Rafael', ''], ['Lamb', 'Luís C.', '']]","['Influence Spreading', 'Epidemic Mitigation', 'Genetic Algorithms']"
3534,1006.0876,Secretary Aircc Journal,"Mohamed Salah Gouider and Amine Farhat, (Institut Sup\'erieur de
  Gestion, Tunisia)","Building a Data Warehouse for National Social Security Fund of the
  Republic of Tunisia",13 pages,"International Journal of Database Management Systems 2.2 (2010)
  102-114",10.5121/ijdms.2010.2207,,cs.DB,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The amounts of data available to decision makers are increasingly important,
given the network availability, low cost storage and diversity of applications.
To maximize the potential of these data within the National Social Security
Fund (NSSF) in Tunisia, we have built a data warehouse as a multidimensional
database, cleaned, homogenized, historicized and consolidated. We used Oracle
Warehouse Builder to extract, transform and load the source data into the Data
Warehouse, by applying the KDD process. We have implemented the Data Warehouse
as an Oracle OLAP. The knowledge extraction has been performed using the Oracle
Discoverer tool. This allowed users to take maximum advantage of knowledge as a
regular report or as ad hoc queries. We started by implementing the main topic
for this public institution, accounting for the movements of insured persons.
The great success that has followed the completion of this work has encouraged
the NSSF to complete the achievement of other topics of interest within the
NSSF. We suggest in the near future to use Multidimensional Data Mining to
extract hidden knowledge and that are not predictable by the OLAP.
","[{'version': 'v1', 'created': 'Fri, 4 Jun 2010 12:03:32 GMT'}]",2010-07-15,"[['Gouider', 'Mohamed Salah', ''], ['Farhat', 'Amine', '']]","['OLAP', 'Knowledge Discovery from Database', 'Social Security Fund', 'Oracle Warehouse Builder', 'Oracle Discoverer']"
3535,1403.2548,Neenu George,"Neenu George, T.K.Parani","Detection of Node Clones in Wireless Sensor Network Using Detection
  Protocols","6 pages,5 figures,""Published with International Journal of
  Engineering Trends and Technology (IJETT)""Volume8 Number 6-Feb2014","nternational Journal of Engineering Trends and Technology (IJETT)
  Volume8 Number 6-Feb2014",10.14445/22315381/IJETT-V8P253,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless sensor networks consist of hundreds to thousands of sensor nodes and
are widely used in civilian and security applications. One of the serious
physical attacks faced by the wireless sensor network is node clone attack.
Thus two node clone detection protocols are introduced via distributed hash
table and randomly directed exploration to detect node clones. The former is
based on a hash table value which is already distributed and provides key based
facilities like checking and caching to detect node clones. The later one is
using probabilistic directed forwarding technique and border determination. The
simulation results for storage consumption, communication cost and detection
probability is done using NS2 and obtained randomly directed exploration is the
best one having low communication cost and storage consumption and has good
detection probability.
  Keywords: wireless sensor networks (wsn), distributed hash table, randomly
directed exploration.
","[{'version': 'v1', 'created': 'Tue, 11 Mar 2014 12:06:26 GMT'}]",2014-03-12,"[['George', 'Neenu', ''], ['Parani', 'T. K.', '']]","['wireless sensor networks (wsn)', 'distributed hash table', 'randomly directed exploration']"
3536,1406.1560,EPTCS,"John Cowles (University of Wyoming), Ruben Gamboa (University of
  Wyoming)","Equivalence of the Traditional and Non-Standard Definitions of Concepts
  from Real Analysis","In Proceedings ACL2 2014, arXiv:1406.1238","EPTCS 152, 2014, pp. 89-100",10.4204/EPTCS.152.8,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  ACL2(r) is a variant of ACL2 that supports the irrational real and complex
numbers. Its logical foundation is based on internal set theory (IST), an
axiomatic formalization of non-standard analysis (NSA). Familiar ideas from
analysis, such as continuity, differentiability, and integrability, are defined
quite differently in NSA-some would argue the NSA definitions are more
intuitive. In previous work, we have adopted the NSA definitions in ACL2(r),
and simply taken as granted that these are equivalent to the traditional
analysis notions, e.g., to the familiar epsilon-delta definitions. However, we
argue in this paper that there are circumstances when the more traditional
definitions are advantageous in the setting of ACL2(r), precisely because the
traditional notions are classical, so they are unencumbered by IST limitations
on inference rules such as induction or the use of pseudo-lambda terms in
functional instantiation. To address this concern, we describe a formal proof
in ACL2(r) of the equivalence of the traditional and non-standards definitions
of these notions.
","[{'version': 'v1', 'created': 'Fri, 6 Jun 2014 01:48:01 GMT'}]",2014-06-09,"[['Cowles', 'John', '', 'University of Wyoming'], ['Gamboa', 'Ruben', '', 'University of\n  Wyoming']]","['ACL2(r)', 'non-standard analysis', 'real analysis']"
3537,0706.2732,Cyrille Chavet,"Cyrille Chavet (LESTER), Philippe Coussy (LESTER), Pascal Urard (STM),
  Eric Martin (LESTER)",A Design Methodology for Space-Time Adapter,ISBN : 978-1-59593-606-8,"Proceedings of the 2007 ACM Great Lakes Symposium on VLSI
  (12/03/2007) 347",,,cs.AR,,"  This paper presents a solution to efficiently explore the design space of
communication adapters. In most digital signal processing (DSP) applications,
the overall architecture of the system is significantly affected by
communication architecture, so the designers need specifically optimized
adapters. By explicitly modeling these communications within an effective
graph-theoretic model and analysis framework, we automatically generate an
optimized architecture, named Space-Time AdapteR (STAR). Our design flow inputs
a C description of Input/Output data scheduling, and user requirements
(throughput, latency, parallelism...), and formalizes communication constraints
through a Resource Constraints Graph (RCG). The RCG properties enable an
efficient architecture space exploration in order to synthesize a STAR
component. The proposed approach has been tested to design an industrial data
mixing block example: an Ultra-Wideband interleaver.
","[{'version': 'v1', 'created': 'Tue, 19 Jun 2007 14:18:57 GMT'}]",2007-06-20,"[['Chavet', 'Cyrille', '', 'LESTER'], ['Coussy', 'Philippe', '', 'LESTER'], ['Urard', 'Pascal', '', 'STM'], ['Martin', 'Eric', '', 'LESTER']]","['Communication and interface synthesis', 'RTL design', 'Digital Signal Processing', 'Multimedia Applications']"
3538,0804.4384,Vitaly Skachek,"Mark F. Flanagan, Vitaly Skachek, Eimear Byrne, Marcus Greferath",Linear-Programming Decoding of Nonbinary Linear Codes,"To appear in the IEEE Transactions on Information Theory. 54 pages, 5
  figures",,10.1109/TIT.2009.2025571,CSI-01-01,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A framework for linear-programming (LP) decoding of nonbinary linear codes
over rings is developed. This framework facilitates linear-programming based
reception for coded modulation systems which use direct modulation mapping of
coded symbols. It is proved that the resulting LP decoder has the
'maximum-likelihood certificate' property. It is also shown that the decoder
output is the lowest cost pseudocodeword. Equivalence between pseudocodewords
of the linear program and pseudocodewords of graph covers is proved. It is also
proved that if the modulator-channel combination satisfies a particular
symmetry condition, the codeword error rate performance is independent of the
transmitted codeword. Two alternative polytopes for use with linear-programming
decoding are studied, and it is shown that for many classes of codes these
polytopes yield a complexity advantage for decoding. These polytope
representations lead to polynomial-time decoders for a wide variety of
classical nonbinary linear codes. LP decoding performance is illustrated for
the [11,6] ternary Golay code with ternary PSK modulation over AWGN, and in
this case it is shown that the performance of the LP decoder is comparable to
codeword-error-rate-optimum hard-decision based decoding. LP decoding is also
simulated for medium-length ternary and quaternary LDPC codes with
corresponding PSK modulations over AWGN.
","[{'version': 'v1', 'created': 'Mon, 28 Apr 2008 12:05:35 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Jun 2009 19:45:12 GMT'}, {'version': 'v3', 'created': 'Thu, 4 Jun 2009 21:39:00 GMT'}]",2016-11-15,"[['Flanagan', 'Mark F.', ''], ['Skachek', 'Vitaly', ''], ['Byrne', 'Eimear', ''], ['Greferath', 'Marcus', '']]","['Linear-programming decoding', 'LDPC codes', 'pseudocodewords', 'coded modulation']"
3539,2105.08957,Nimra Zaheer,"Nimra Zaheer, Obaid Ullah Ahmad, Ammar Ahmed, Muhammad Shehryar Khan,
  Mudassir Shabbir",SEMOUR: A Scripted Emotional Speech Repository for Urdu,accepted in CHI 2021,,10.1145/3411764.3445171,,cs.SD eess.AS,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Designing reliable Speech Emotion Recognition systems is a complex task that
inevitably requires sufficient data for training purposes. Such extensive
datasets are currently available in only a few languages, including English,
German, and Italian. In this paper, we present SEMOUR, the first scripted
database of emotion-tagged speech in the Urdu language, to design an Urdu
Speech Recognition System. Our gender-balanced dataset contains 15,040 unique
instances recorded by eight professional actors eliciting a syntactically
complex script. The dataset is phonetically balanced, and reliably exhibits a
varied set of emotions as marked by the high agreement scores among human
raters in experiments. We also provide various baseline speech emotion
prediction scores on the database, which could be used for various applications
like personalized robot assistants, diagnosis of psychological disorders, and
getting feedback from a low-tech-enabled population, etc. On a random test
sample, our model correctly predicts an emotion with a state-of-the-art 92%
accuracy.
","[{'version': 'v1', 'created': 'Wed, 19 May 2021 07:15:03 GMT'}]",2021-05-20,"[['Zaheer', 'Nimra', ''], ['Ahmad', 'Obaid Ullah', ''], ['Ahmed', 'Ammar', ''], ['Khan', 'Muhammad Shehryar', ''], ['Shabbir', 'Mudassir', '']]","['Emotional speech', 'speech dataset', 'digital recording', 'speech emotionrecognition', 'Urdu language', 'human annotation', 'machine learning', 'deep learning']"
3540,1709.08309,Masato Kikuchi,"Masato Kikuchi, Eiko Yamamoto, Mitsuo Yoshida, Masayuki Okabe, Kyoji
  Umemura","Using Conservative Estimation for Conditional Probability instead of
  Ignoring Infrequent Case","The 2016 International Conference on Advanced Informatics: Concepts,
  Theory and Application (ICAICTA2016)",,10.1109/ICAICTA.2016.7803098,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are several estimators of conditional probability from observed
frequencies of features. In this paper, we propose using the lower limit of
confidence interval on posterior distribution determined by the observed
frequencies to ascertain conditional probability. In our experiments, this
method outperformed other popular estimators.
","[{'version': 'v1', 'created': 'Mon, 25 Sep 2017 04:20:33 GMT'}]",2017-09-26,"[['Kikuchi', 'Masato', ''], ['Yamamoto', 'Eiko', ''], ['Yoshida', 'Mitsuo', ''], ['Okabe', 'Masayuki', ''], ['Umemura', 'Kyoji', '']]","['Conservative estimation', 'Conditional probability', 'Confidence interval', 'Lower limit']"
3541,0906.0862,Daniel Karapetyan,Gregory Gutin and Daniel Karapetyan,A Memetic Algorithm for the Multidimensional Assignment Problem,14 pages,Lecture Notes in Computer Science 5752 (2009) 125-129,10.1007/978-3-642-03751-1_12,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Multidimensional Assignment Problem (MAP or s-AP in the case of s
dimensions) is an extension of the well-known assignment problem. The most
studied case of MAP is 3-AP, though the problems with larger values of s have
also a number of applications. In this paper we propose a memetic algorithm for
MAP that is a combination of a genetic algorithm with a local search procedure.
The main contribution of the paper is an idea of dynamically adjusted
generation size, that yields an outstanding flexibility of the algorithm to
perform well for both small and large fixed running times. The results of
computational experiments for several instance families show that the proposed
algorithm produces solutions of very high quality in a reasonable time and
outperforms the state-of-the art 3-AP memetic algorithm.
","[{'version': 'v1', 'created': 'Thu, 4 Jun 2009 09:44:59 GMT'}]",2010-03-30,"[['Gutin', 'Gregory', ''], ['Karapetyan', 'Daniel', '']]","['Multidimensional Assignment Problem', 'Metaheuristic', 'Genetic Algorithm', 'Memetic Algorithm']"
3542,1411.0654,EPTCS,"Gustavo Gonzalez-Granadillo (Institut Mines-T\'el\'ecom, T\'el\'ecom
  SudParis, France), Christophe Ponchel (Cassidian CyberSecurity, France),
  Gregory Blanc (Institut Mines-T\'el\'ecom, T\'el\'ecom SudParis, France),
  Herv\'e Debar (Institut Mines-T\'el\'ecom, T\'el\'ecom SudParis, France)",Combining Technical and Financial Impacts for Countermeasure Selection,"In Proceedings AIDP 2014, arXiv:1410.3226","EPTCS 165, 2014, pp. 1-14",10.4204/EPTCS.165.1,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Research in information security has generally focused on providing a
comprehensive interpretation of threats, vulnerabilities, and attacks, in
particular to evaluate their danger and prioritize responses accordingly. Most
of the current approaches propose advanced techniques to detect intrusions and
complex attacks but few of these approaches propose well defined methodologies
to react against a given attack. In this paper, we propose a novel and
systematic method to select security countermeasures from a pool of candidates,
by ranking them based on the technical and financial impact associated to each
alternative. The method includes industrial evaluation and simulations of the
impact associated to a given security measure which allows to compute the
return on response investment for different candidates. A simple case study is
proposed at the end of the paper to show the applicability of the model.
","[{'version': 'v1', 'created': 'Thu, 16 Oct 2014 05:53:30 GMT'}]",2014-11-04,"[['Gonzalez-Granadillo', 'Gustavo', '', 'Institut Mines-Télécom, Télécom\n  SudParis, France'], ['Ponchel', 'Christophe', '', 'Cassidian CyberSecurity, France'], ['Blanc', 'Gregory', '', 'Institut Mines-Télécom, Télécom SudParis, France'], ['Debar', 'Hervé', '', 'Institut Mines-Télécom, Télécom SudParis, France']]","['Cyber Protection Level', 'Countermeasure Selection', 'Complex Attacks', 'Security Metrics', 'Decision Support']"
3543,1812.03083,Heba Aly,Heba Aly and Ashok Agrawala,"Hapi: A Robust Pseudo-3D Calibration-Free WiFi-based Indoor Localization
  System","Accepted for publication in MobiQuitous 2018 - the 15th International
  Conference on Mobile and Ubiquitous Systems: Computing, Networking and
  Services",,10.1145/3286978.3286980,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present Hapi, a novel system that uses off-the-shelf
standard WiFi to provide pseudo-3D indoor localization. It estimates the user's
floor and her 2D location on that floor. Hapi is calibration-free, only
requiring the building's floorplans and its WiFi APs' installation location for
deployment. Our analysis shows that while a user can hear APs from nearby
floors as well as her floor, she will typically only receive signals from
spatially closer APs in distant floors, as compared to APs in her floor. This
is due to signal attenuation by floors/ceilings along with the 3D distance
between the APs and the user. Hapi leverages this observation to achieve
accurate and robust location estimates. A deep-learning based method is
proposed to identify the user's floor. Then, the identified floor along with
the user's visible APs from all floors are used to estimate her 2D location
through a novel RSS-Rank Gaussian-based method. Additionally, we present a
regression based method to predict Hapi's location estimates' quality and
employ it within a Kalman Filter to further refine the accuracy. Our evaluation
results, from deployment on various android devices over 6 months with 13
subjects in 5 different up to 9 floors multistory buildings, show that Hapi can
identify the user's exact floor up to 95.2% of the time and her 2D location
with a median accuracy of 3.5m, achieving 52.1% and 76.0% improvement over
related calibration-free state-of-the-art systems respectively.
","[{'version': 'v1', 'created': 'Sun, 25 Nov 2018 23:46:08 GMT'}]",2018-12-10,"[['Aly', 'Heba', ''], ['Agrawala', 'Ashok', '']]","['Indoor localization', 'WiFi-based localization', 'floor-level localization', 'calibration-free', '3D indoor location']"
3544,1409.0348,Peter Kraker,"Peter Kraker, Christian Schl\""ogl, Kris Jack, and Stefanie Lindstaedt","Visualization of Co-Readership Patterns from an Online Reference
  Management System",Accepted for publication in the Journal of Informetrics,"Journal of Informetrics, Volume 9, Issue 1, January 2015, Pages
  169-182",10.1016/j.joi.2014.12.003,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we analyze the adequacy and applicability of readership
statistics recorded in social reference management systems for creating
knowledge domain visualizations. First, we investigate the distribution of
subject areas in user libraries of educational technology researchers on
Mendeley. The results show that around 69% of the publications in an average
user library can be attributed to a single subject area. Then, we use
co-readership patterns to map the field of educational technology. The
resulting visualization prototype, based on the most read publications in this
field on Mendeley, reveals 13 topic areas of educational technology research.
The visualization is a recent representation of the field: 80% of the
publications included were published within ten years of data collection. The
characteristics of the readers, however, introduce certain biases to the
visualization. Knowledge domain visualizations based on readership statistics
are therefore multifaceted and timely, but it is important that the
characteristics of the underlying sample are made transparent.
","[{'version': 'v1', 'created': 'Mon, 1 Sep 2014 09:56:18 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Dec 2014 15:12:09 GMT'}]",2015-01-14,"[['Kraker', 'Peter', ''], ['Schlögl', 'Christian', ''], ['Jack', 'Kris', ''], ['Lindstaedt', 'Stefanie', '']]","['relational scientometrics', 'topical distribution', 'knowledge domain']"
3545,2105.04651,Daniel Cohen,"Daniel Cohen, Bhaskar Mitra, Oleg Lesota, Navid Rekabsaz and Carsten
  Eickhoff","Not All Relevance Scores are Equal: Efficient Uncertainty and
  Calibration Modeling for Deep Retrieval Models",ACM SIGIR preprint,,10.1145/3404835.3462951,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In any ranking system, the retrieval model outputs a single score for a
document based on its belief on how relevant it is to a given search query.
While retrieval models have continued to improve with the introduction of
increasingly complex architectures, few works have investigated a retrieval
model's belief in the score beyond the scope of a single value. We argue that
capturing the model's uncertainty with respect to its own scoring of a document
is a critical aspect of retrieval that allows for greater use of current models
across new document distributions, collections, or even improving effectiveness
for down-stream tasks. In this paper, we address this problem via an efficient
Bayesian framework for retrieval models which captures the model's belief in
the relevance score through a stochastic process while adding only negligible
computational overhead. We evaluate this belief via a ranking based calibration
metric showing that our approximate Bayesian framework significantly improves a
retrieval model's ranking effectiveness through a risk aware reranking as well
as its confidence calibration. Lastly, we demonstrate that this additional
uncertainty information is actionable and reliable on down-stream tasks
represented via cutoff prediction.
","[{'version': 'v1', 'created': 'Mon, 10 May 2021 20:15:53 GMT'}]",2021-05-12,"[['Cohen', 'Daniel', ''], ['Mitra', 'Bhaskar', ''], ['Lesota', 'Oleg', ''], ['Rekabsaz', 'Navid', ''], ['Eickhoff', 'Carsten', '']]","['uncertainty', 'neural networks', 'calibration', 'search']"
3546,1807.04998,Dejan Lavbi\v{c},"Dejan Lavbi\v{c}, Iztok Lajovic, and Marjan Krisper",Facilitating information system development with Panoramic view on data,"24 pages, 5 figures, 10 tables",Computer Science and Information Systems 4 (2010) 737-767,10.2298/CSIS091122031L,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing amount of information and the absence of an effective tool for
assisting users with minimal technical knowledge lead us to use associative
thinking paradigm for implementation of a software solution - Panorama. In this
study, we present object recognition process, based on context + focus
information visualization techniques, as a foundation for realization of
Panorama. We show that user can easily define data vocabulary of selected
domain that is furthermore used as the application framework. The purpose of
Panorama approach is to facilitate software development of certain problem
domains by shortening the Software Development Life Cycle with minimizing the
impact of implementation, review and maintenance phase. Our approach is focused
on using and updating data vocabulary by users without extensive programming
skills. Panorama therefore facilitates traversing through data by following
associations where user does not need to be familiar with the query language,
the data structure and does not need to know the problem domain fully. Our
approach has been verified by detailed comparison to existing approaches and in
an experiment by implementing selected use cases. The results confirmed that
Panorama fits problem domains with emphasis on data oriented rather than ones
with process oriented aspects. In such cases the development of selected
problem domains is shortened up to 25%, where emphasis is mainly on analysis,
logical design and testing, while omitting physical design and programming,
which is performed automatically by Panorama tool.
","[{'version': 'v1', 'created': 'Fri, 13 Jul 2018 10:39:46 GMT'}]",2018-07-16,"[['Lavbič', 'Dejan', ''], ['Lajovic', 'Iztok', ''], ['Krisper', 'Marjan', '']]","['Software development', 'associative thinking', 'object recognition', 'rapid application development']"
3547,1304.1568,Odemir Bruno PhD,Jo\~ao Batista Florindo and Odemir Martinez Bruno,Multiscale Fractal Descriptors Applied to Texture Classification,"5 pages, 4 figures","Journal of Physics: Conference Series, 410, 012022, 2013",10.1088/1742-6596/410/1/012022,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work proposes the combination of multiscale transform with fractal
descriptors employed in the classification of gray-level texture images. We
apply the space-scale transform (derivative + Gaussian filter) over the
Bouligand-Minkowski fractal descriptors, followed by a threshold over the
filter response, aiming at attenuating noise effects caused by the final part
of this response. The method is tested in the classification of a well-known
data set (Brodatz) and compared with other classical texture descriptor
techniques. The results demonstrate the advantage of the proposed approach,
achieving a higher success rate with a reduced amount of descriptors.
","[{'version': 'v1', 'created': 'Thu, 4 Apr 2013 22:07:27 GMT'}]",2013-04-08,"[['Florindo', 'João Batista', ''], ['Bruno', 'Odemir Martinez', '']]","['Fractal descriptors', 'multiscale transform', 'image analysis', 'pattern recognition']"
3548,1408.1675,James Cheney,James Cheney and Amal Ahmed and Umut A. Acar,Database Queries that Explain their Work,PPDP 2014,,10.1145/2643135.2643143,,cs.PL cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Provenance for database queries or scientific workflows is often motivated as
providing explanation, increasing understanding of the underlying data sources
and processes used to compute the query, and reproducibility, the capability to
recompute the results on different inputs, possibly specialized to a part of
the output. Many provenance systems claim to provide such capabilities;
however, most lack formal definitions or guarantees of these properties, while
others provide formal guarantees only for relatively limited classes of
changes. Building on recent work on provenance traces and slicing for
functional programming languages, we introduce a detailed tracing model of
provenance for multiset-valued Nested Relational Calculus, define trace slicing
algorithms that extract subtraces needed to explain or recompute specific parts
of the output, and define query slicing and differencing techniques that
support explanation. We state and prove correctness properties for these
techniques and present a proof-of-concept implementation in Haskell.
","[{'version': 'v1', 'created': 'Thu, 7 Aug 2014 18:29:38 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Aug 2014 17:02:26 GMT'}, {'version': 'v3', 'created': 'Tue, 12 Aug 2014 10:50:02 GMT'}]",2014-08-13,"[['Cheney', 'James', ''], ['Ahmed', 'Amal', ''], ['Acar', 'Umut A.', '']]","['provenance', 'database queries', 'slicing']"
3549,1711.01228,Yong-Xian Wang,Yong-Xian Wang and Zheng-Hua Wang,"A Fast Successive Over-Relaxation Algorithm for Force-Directed Network
  Graph Drawing","17 pages, 4 figures, 1 table",Sci. China Inf. Sci. (2012) 55: 677,10.1007/s11432-011-4208-9,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Force-directed approach is one of the most widely used methods in graph
drawing research. There are two main problems with the traditional
force-directed algorithms. First, there is no mature theory to ensure the
convergence of iteration sequence used in the algorithm and further, it is hard
to estimate the rate of convergence even if the convergence is satisfied.
Second, the running time cost is increased intolerablely in drawing large-
scale graphs, and therefore the advantages of the force-directed approach are
limited in practice. This paper is focused on these problems and presents a
sufficient condition for ensuring the convergence of iterations. We then
develop a practical heuristic algorithm for speeding up the iteration in
force-directed approach using a successive over-relaxation (SOR) strategy. The
results of computational tests on the several benchmark graph datasets used
widely in graph drawing research show that our algorithm can dramatically
improve the performance of force-directed approach by decreasing both the
number of iterations and running time, and is 1.5 times faster than the latter
on average.
","[{'version': 'v1', 'created': 'Fri, 3 Nov 2017 16:33:42 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Mar 2018 15:14:14 GMT'}]",2018-03-12,"[['Wang', 'Yong-Xian', ''], ['Wang', 'Zheng-Hua', '']]","['graph drawing', 'graph layout', 'successive over-relaxation', 'forcedirected algorithm']"
3550,1609.01926,Giovanni Carmantini,"Giovanni Sirio Carmantini, Peter beim Graben, Mathieu Desroches,
  Serafim Rodrigues","A modular architecture for transparent computation in Recurrent Neural
  Networks",,,10.1016/j.neunet.2016.09.001,,cs.NE cs.AI cs.CL cs.FL cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computation is classically studied in terms of automata, formal languages and
algorithms; yet, the relation between neural dynamics and symbolic
representations and operations is still unclear in traditional eliminative
connectionism. Therefore, we suggest a unique perspective on this central
issue, to which we would like to refer as to transparent connectionism, by
proposing accounts of how symbolic computation can be implemented in neural
substrates. In this study we first introduce a new model of dynamics on a
symbolic space, the versatile shift, showing that it supports the real-time
simulation of a range of automata. We then show that the Goedelization of
versatile shifts defines nonlinear dynamical automata, dynamical systems
evolving on a vectorial space. Finally, we present a mapping between nonlinear
dynamical automata and recurrent artificial neural networks. The mapping
defines an architecture characterized by its granular modularity, where data,
symbolic operations and their control are not only distinguishable in
activation space, but also spatially localizable in the network itself, while
maintaining a distributed encoding of symbolic representations. The resulting
networks simulate automata in real-time and are programmed directly, in absence
of network training. To discuss the unique characteristics of the architecture
and their consequences, we present two examples: i) the design of a Central
Pattern Generator from a finite-state locomotive controller, and ii) the
creation of a network simulating a system of interactive automata that supports
the parsing of garden-path sentences as investigated in psycholinguistics
experiments.
","[{'version': 'v1', 'created': 'Wed, 7 Sep 2016 10:44:28 GMT'}]",2016-09-08,"[['Carmantini', 'Giovanni Sirio', ''], ['Graben', 'Peter beim', ''], ['Desroches', 'Mathieu', ''], ['Rodrigues', 'Serafim', '']]","['Automata Theory', 'Recurrent Artificial Neural Networks', 'Representation Theory', 'Nonlinear Dynamical Automata', 'Neural SymbolicComputation', 'Versatile Shift']"
3551,1210.0794,Nahla Jlaiel,"Nahla Jlaiel, Khouloud Madhbouh, Mohamed Ben Ahmed","A Semantic Approach for Automatic Structuring and Analysis of Software
  Process Patterns","08 pages, 10 figures, Published with International Journal of
  Computer Applications (IJCA)","Nahla Jlaiel, Khouloud Madhbouh and Mohamed Ben Ahmed. Article: A
  Semantic Approach for Automatic Structuring and Analysis of Software Process
  Patterns. International Journal of Computer Applications 54(15):24-31,
  September 2012",10.5120/8643-2503,,cs.AI cs.CL,http://creativecommons.org/licenses/by/3.0/,"  The main contribution of this paper, is to propose a novel semantic approach
based on a Natural Language Processing technique in order to ensure a semantic
unification of unstructured process patterns which are expressed not only in
different formats but also, in different forms. This approach is implemented
using the GATE text engineering framework and then evaluated leading up to
high-quality results motivating us to continue in this direction.
","[{'version': 'v1', 'created': 'Tue, 2 Oct 2012 14:56:07 GMT'}]",2012-10-03,"[['Jlaiel', 'Nahla', ''], ['Madhbouh', 'Khouloud', ''], ['Ahmed', 'Mohamed Ben', '']]","['Software process patterns', 'patterns unification', 'patterns analysis', 'patterns structuring', 'patterns reuse']"
3552,1305.5750,Khalid Raza,"Khalid Raza, Rajni Jaiswal","Reconstruction and Analysis of Cancer-specific Gene Regulatory Networks
  from Gene Expression Profiles","10 pages, 1 figure, 2 tables","International Journal on Bioinformatics & Biosciences (IJBB),
  3(2):25-34, June 2013",10.5121/ijbb.2013.3103,,cs.SY cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The main goal of Systems Biology research is to reconstruct biological
networks for its topological analysis so that reconstructed networks can be
used for the identification of various kinds of disease. The availability of
high-throughput data generated by microarray experiments fueled researchers to
use whole-genome gene expression profiles to understand cancer and to
reconstruct key cancer-specific gene regulatory network. Now, the researchers
are taking a keen interest in the development of algorithm for the
reconstruction of gene regulatory network from whole genome expression
profiles. In this study, a cancer-specific gene regulatory network (prostate
cancer) has been constructed using a simple and novel statistics based
approach. First, significant genes differentially expressing them self in the
disease condition has been identified using a two-stage filtering approach
t-test and fold-change measure. Next, regulatory relationships between the
identified genes has been computed using Pearson correlation coefficient. The
obtained results has been validated with the available databases and
literature. We obtained a cancer-specific regulatory network of 29 genes with a
total of 55 regulatory relations in which some of the genes has been identified
as hub genes that can act as drug target for the cancer diagnosis.
","[{'version': 'v1', 'created': 'Thu, 23 May 2013 19:21:45 GMT'}, {'version': 'v2', 'created': 'Sun, 30 Jun 2013 18:21:52 GMT'}]",2013-07-02,"[['Raza', 'Khalid', ''], ['Jaiswal', 'Rajni', '']]","['Gene regulatory network', 'microarray analysis', 'prostate cancer', 'differentially expressed genes']"
3553,1805.08059,Sandra Dylus,"Sandra Dylus (CAU Kiel, Germany), Jan Christiansen (Flensburg
  University of Applied Sciences, Germany), Finn Teegen (University of Kiel,
  Germany)",One Monad to Prove Them All,,"The Art, Science, and Engineering of Programming, 2019, Vol. 3,
  Issue 3, Article 8",10.22152/programming-journal.org/2019/3/8,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One Monad to Prove Them All is a modern fairy tale about curiosity and
perseverance, two important properties of a successful PhD student. We follow
the PhD student Mona on her adventure of proving properties about Haskell
programs in the proof assistant Coq. On the one hand, as a PhD student in
computer science Mona observes an increasing demand for correct software
products. In particular, because of the large amount of existing software,
verifying existing software products becomes more important. Verifying programs
in the functional programming language Haskell is no exception. On the other
hand, Mona is delighted to see that communities in the area of theorem proving
are becoming popular. Thus, Mona sets out to learn more about the interactive
theorem prover Coq and verifying Haskell programs in Coq. To prove properties
about a Haskell function in Coq, Mona has to translate the function into Coq
code. As Coq programs have to be total and Haskell programs are often not, Mona
has to model partiality explicitly in Coq. In her quest for a solution Mona
finds an ancient manuscript that explains how properties about Haskell
functions can be proven in the proof assistant Agda by translating Haskell
programs into monadic Agda programs. By instantiating the monadic program with
a concrete monad instance the proof can be performed in either a total or a
partial setting. Mona discovers that the proposed transformation does not work
in Coq due to a restriction in the termination checker. In fact the
transformation does not work in Agda anymore as well, as the termination
checker in Agda has been improved. We follow Mona on an educational journey
through the land of functional programming where she learns about concepts like
free monads and containers as well as basics and restrictions of proof
assistants like Coq. These concepts are well-known individually, but their
interplay gives rise to a solution for Mona's problem based on the originally
proposed monadic tranformation that has not been presented before. When Mona
starts to test her approach by proving a statement about simple Haskell
functions, she realizes that her approach has an additional advantage over the
original idea in Agda. Mona's final solution not only works for a specific
monad instance but even allows her to prove monad-generic properties. Instead
of proving properties over and over again for specific monad instances she is
able to prove properties that hold for all monads representable by a
container-based instance of the free monad. In order to strengthen her
confidence in the practicability of her approach, Mona evaluates her approach
in a case study that compares two implementations for queues. In order to share
the results with other functional programmers the fairy tale is available as a
literate Coq file. If you are a citizen of the land of functional programming
or are at least familiar with its customs, had a journey that involved
reasoning about functional programs of your own, or are just a curious soul
looking for the next story about monads and proofs, then this tale is for you.
","[{'version': 'v1', 'created': 'Mon, 21 May 2018 13:54:58 GMT'}, {'version': 'v2', 'created': 'Sun, 10 Jun 2018 10:45:23 GMT'}, {'version': 'v3', 'created': 'Mon, 1 Oct 2018 14:25:19 GMT'}, {'version': 'v4', 'created': 'Fri, 1 Feb 2019 18:59:40 GMT'}]",2019-02-04,"[['Dylus', 'Sandra', '', 'CAU Kiel, Germany'], ['Christiansen', 'Jan', '', 'Flensburg\n  University of Applied Sciences, Germany'], ['Teegen', 'Finn', '', 'University of Kiel,\n  Germany']]","['Haskell', 'monads', 'free monad', 'containers', 'verification']"
3554,1705.05952,Dat Quoc Nguyen,"Dat Quoc Nguyen, Mark Dras, Mark Johnson","A Novel Neural Network Model for Joint POS Tagging and Graph-based
  Dependency Parsing","v2: also include universal POS tagging, UAS and LAS accuracies w.r.t
  gold-standard segmentation on Universal Dependencies 2.0 - CoNLL 2017 shared
  task test data; in CoNLL 2017",,10.18653/v1/K17-3014,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a novel neural network model that learns POS tagging and
graph-based dependency parsing jointly. Our model uses bidirectional LSTMs to
learn feature representations shared for both POS tagging and dependency
parsing tasks, thus handling the feature-engineering problem. Our extensive
experiments, on 19 languages from the Universal Dependencies project, show that
our model outperforms the state-of-the-art neural network-based
Stack-propagation model for joint POS tagging and transition-based dependency
parsing, resulting in a new state of the art. Our code is open-source and
available together with pre-trained models at:
https://github.com/datquocnguyen/jPTDP
","[{'version': 'v1', 'created': 'Tue, 16 May 2017 23:09:00 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Jun 2017 18:25:57 GMT'}]",2017-08-10,"[['Nguyen', 'Dat Quoc', ''], ['Dras', 'Mark', ''], ['Johnson', 'Mark', '']]","['Neural network', 'POS tagging', 'Dependency parsing', 'BidirectionalLSTM', 'Universal Dependencies', 'Multilingual parsing']"
3555,1403.7294,Roshan Ragel,"D. Herath, C. Lakmali, and R. G. Ragel","Accelerating string matching for bio-computing applications on
  multi-core CPUs",,"Industrial and Information Systems (ICIIS), 2012 7th IEEE
  International Conference on, 6-9 Aug. 2012, pp. 1-6, Chennai",10.1109/ICIInfS.2012.6304784,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Huge amount of data in the form of strings are being handled in bio-computing
applications and searching algorithms are quite frequently used in them. Many
methods utilizing on both software and hardware are being proposed to
accelerate processing of such data. The typical hardware-based acceleration
techniques either require special hardware such as general purpose graphics
processing units (GPGPUs) or need building a new hardware such as an FPGA based
design. On the other hard, software-based acceleration techniques are easier
since they only require some changes in the software code or the software
architecture. Typical software-based techniques make use of computers connected
over a network, also known as a network grid to accelerate the processing. In
this paper, we test the hypothesis that multi-core architectures should provide
better performance in this kind of computation, but still it would depend on
the algorithm selected as well as the programming model being utilized. We
present the acceleration of a string-searching algorithm on a multi-core CPU
via a POSIX thread based implementation. Our implementation on an 8-core
processor (that supports 16-threads) resulted in 9x throughput improvement
compared to a single thread implementation.
","[{'version': 'v1', 'created': 'Fri, 28 Mar 2014 07:44:23 GMT'}]",2014-03-31,"[['Herath', 'D.', ''], ['Lakmali', 'C.', ''], ['Ragel', 'R. G.', '']]","['string matching', 'bio-computing algorithms', 'multi']"
3556,1911.08916,Saimunur Rahman,"Saimunur Rahman, Lei Wang, Changming Sun, Luping Zhou",Deep Learning based HEp-2 Image Classification: A Comprehensive Review,Published in Medical Image Analysis,Medical Image Analysis (2020): 101764,10.1016/j.media.2020.101764,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classification of HEp-2 cell patterns plays a significant role in the
indirect immunofluorescence test for identifying autoimmune diseases in the
human body. Many automatic HEp-2 cell classification methods have been proposed
in recent years, amongst which deep learning based methods have shown
impressive performance. This paper provides a comprehensive review of the
existing deep learning based HEp-2 cell image classification methods. These
methods perform HEp-2 image classification at two levels, namely, cell-level
and specimen-level. Both levels are covered in this review. At each level, the
methods are organized with a deep network usage based taxonomy. The core idea,
notable achievements, and key strengths and weaknesses of each method are
critically analyzed. Furthermore, a concise review of the existing HEp-2
datasets that are commonly used in the literature is given. The paper ends with
a discussion on novel opportunities and future research directions in this
field. It is hoped that this paper would provide readers with a thorough
reference of this novel, challenging, and thriving field.
","[{'version': 'v1', 'created': 'Wed, 20 Nov 2019 14:03:27 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Aug 2020 09:32:42 GMT'}]",2020-08-07,"[['Rahman', 'Saimunur', ''], ['Wang', 'Lei', ''], ['Sun', 'Changming', ''], ['Zhou', 'Luping', '']]","['HEp-2 Classification', 'Cell Classification', 'Deep Learning', 'Review']"
3557,1404.0437,Nasser Mohieddin Abukhdeir,Robert Suderman and Daniel Lizotte and Nasser Mohieddin Abukhdeir,"Theory and Application of Shapelets to the Analysis of Surface
  Self-assembly Imaging","11 pages, 8 figures, submitted to the Journal of Computational
  Physics",,10.1103/PhysRevE.00.003300,,cs.CV physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A method for quantitative analysis of local pattern strength and defects in
surface self-assembly imaging is presented and applied to images of stripe and
hexagonal ordered domains. The presented method uses ""shapelet"" functions which
were originally developed for quantitative analysis of images of galaxies
($\propto 10^{20}\mathrm{m}$). In this work, they are used instead to quantify
the presence of translational order in surface self-assembled films ($\propto
10^{-9}\mathrm{m}$) through reformulation into ""steerable"" filters. The
resulting method is both computationally efficient (with respect to the number
of filter evaluations), robust to variation in pattern feature shape, and,
unlike previous approaches, is applicable to a wide variety of pattern types.
An application of the method is presented which uses a nearest-neighbour
analysis to distinguish between uniform (defect-free) and non-uniform
(strained, defect-containing) regions within imaged self-assembled domains,
both with striped and hexagonal patterns.
","[{'version': 'v1', 'created': 'Wed, 2 Apr 2014 03:01:39 GMT'}]",2015-02-27,"[['Suderman', 'Robert', ''], ['Lizotte', 'Daniel', ''], ['Abukhdeir', 'Nasser Mohieddin', '']]","['surface self-assembly', 'pattern recognition', 'shapelets', 'image processing', 'machine learning']"
3558,1812.11119,Arseny Shur,Elena A. Petrova and Arseny M. Shur,Transition Property For Cube-Free Words,"14 pages, 5 figures",,10.1007/978-3-030-19955-5\_27,,cs.FL math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study cube-free words over arbitrary non-unary finite alphabets and prove
the following structural property: for every pair $(u,v)$ of $d$-ary cube-free
words, if $u$ can be infinitely extended to the right and $v$ can be infinitely
extended to the left respecting the cube-freeness property, then there exists a
""transition"" word $w$ over the same alphabet such that $uwv$ is cube free. The
crucial case is the case of the binary alphabet, analyzed in the central part
of the paper.
  The obtained ""transition property"", together with the developed technique,
allowed us to solve cube-free versions of three old open problems by Restivo
and Salemi. Besides, it has some further implications for combinatorics on
words; e.g., it implies the existence of infinite cube-free words of very big
subword (factor) complexity.
","[{'version': 'v1', 'created': 'Fri, 28 Dec 2018 17:16:27 GMT'}]",2020-07-07,"[['Petrova', 'Elena A.', ''], ['Shur', 'Arseny M.', '']]","['Power-free word', 'cube-free word', 'extendable word', 'transition property']"
3559,1701.05232,Alexander Evako V,Alexander V. Evako,"Structure of a Parabolic Partial Differential Equation on Graphs and
  Digital spaces. Solution of PDE on Digital Spaces: a Klein Bottle, a
  Projective Plane, a 4D Sphere and a Moebius Band","11-pages, 11 figures, accepted for publication in International
  Journal of Discrete Mathematics. arXiv admin note: text overlap with
  arXiv:1507.08109","International Journal of Discrete Mathematics. Vol. 1, No. 1,
  2016, pp. 5-14, http://www.sciencepublishinggroup.com/j/dmath",10.11648/j.dmath.20160101.12,,cs.DM math-ph math.AP math.MP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies the structure of a parabolic partial differential equation
on graphs and digital n-dimensional manifolds, which are digital models of
continuous n-manifolds. Conditions for the existence of solutions of equations
are determined and investigated. Numerical solutions of the equation on a Klein
bottle, a projective plane, a 4D sphere and a Moebius strip are presented.
","[{'version': 'v1', 'created': 'Wed, 18 Jan 2017 20:55:45 GMT'}]",2017-05-03,"[['Evako', 'Alexander V.', '']]","['Parabolic PDE', 'Graph', 'Digital Surface', 'Digital Topology', 'Moebius Strip', 'Klein Bottle', 'Projective Plane']"
3560,1707.03587,Konstantin Avrachenkov,"Konstantin Avrachenkov (NEO), Aleksei Kondratev, Vladimir Mazalov",Cooperative Game Theory Approaches for Network Partitioning,,,10.1086/jar.33.4.3629752,,cs.SI cs.GT cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper is devoted to game-theoretic methods for community detection in
networks. The traditional methods for detecting community structure are based
on selecting denser subgraphs inside the network. Here we propose to use the
methods of cooperative game theory that highlight not only the link density but
also the mechanisms of cluster formation. Specifically, we suggest two
approaches from cooperative game theory: the first approach is based on the
Myerson value, whereas the second approach is based on hedonic games. Both
approaches allow to detect clusters with various resolution. However, the
tuning of the resolution parameter in the hedonic games approach is
particularly intuitive. Furthermore, the modularity based approach and its
generalizations can be viewed as particular cases of the hedonic games.
","[{'version': 'v1', 'created': 'Wed, 12 Jul 2017 08:10:56 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Jul 2017 09:01:42 GMT'}]",2017-07-28,"[['Avrachenkov', 'Konstantin', '', 'NEO'], ['Kondratev', 'Aleksei', ''], ['Mazalov', 'Vladimir', '']]","['Network partitioning', 'community detection', 'cooperative games', 'Myerson value', 'hedonic games']"
3561,0709.0428,Noelle Carbonell,"Suzanne Kieffer (INRIA Rocquencourt / INRIA Lorraine - LORIA),
  No\""elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)",Oral messages improve visual search,4 pages,"Dans Proceedings of ACM Working Conference on Advanced Visual
  Interfaces - ACM Working Conference on Advanced Visual Interfaces (AVI 2006),
  Venezia : Italie (2006)",,,cs.HC,,"  Input multimodality combining speech and hand gestures has motivated numerous
usability studies. Contrastingly, issues relating to the design and ergonomic
evaluation of multimodal output messages combining speech with visual
modalities have not yet been addressed extensively. The experimental study
presented here addresses one of these issues. Its aim is to assess the actual
efficiency and usability of oral system messages including brief spatial
information for helping users to locate objects on crowded displays rapidly.
Target presentation mode, scene spatial structure and task difficulty were
chosen as independent variables. Two conditions were defined: the visual target
presentation mode (VP condition) and the multimodal target presentation mode
(MP condition). Each participant carried out two blocks of visual search tasks
(120 tasks per block, and one block per condition). Scene target presentation
mode, scene structure and task difficulty were found to be significant factors.
Multimodal target presentation proved to be more efficient than visual target
presentation. In addition, participants expressed very positive judgments on
multimodal target presentations which were preferred to visual presentations by
a majority of participants. Besides, the contribution of spatial messages to
visual search speed and accuracy was influenced by scene spatial structure and
task difficulty: (i) messages improved search efficiency to a lesser extent for
2D array layouts than for some other symmetrical layouts, although the use of
2D arrays for displaying pictures is currently prevailing; (ii) message
usefulness increased with task difficulty. Most of these results are
statistically significant.
","[{'version': 'v1', 'created': 'Tue, 4 Sep 2007 13:27:33 GMT'}]",2007-09-05,"[['Kieffer', 'Suzanne', '', 'INRIA Rocquencourt / INRIA Lorraine - LORIA'], ['Carbonell', 'Noëlle', '', 'INRIA Rocquencourt / INRIA Lorraine - LORIA']]","['Visual search', 'Multimodal system messages', 'Speech and graphics', 'Usability study', 'Experimental evaluation', 'Visual target spotting']"
3562,1701.08259,Nitin Malik Dr,"Smriti Tikoo, Nitin Malik","Detection, Segmentation and Recognition of Face and its Features Using
  Neural Network","Google Scholar Indexed Journal, 5 pages, 10 figures, Journal of
  Biosensors and Bioelectronics, vol. 7, no. 2, June-Sept 2016",,10.4172/2155-6210.1000210,,cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Face detection and recognition has been prevalent with research scholars and
diverse approaches have been incorporated till date to serve purpose. The
rampant advent of biometric analysis systems, which may be full body scanners,
or iris detection and recognition systems and the finger print recognition
systems, and surveillance systems deployed for safety and security purposes
have contributed to inclination towards same. Advances has been made with
frontal view, lateral view of the face or using facial expressions such as
anger, happiness and gloominess, still images and video image to be used for
detection and recognition. This led to newer methods for face detection and
recognition to be introduced in achieving accurate results and economically
feasible and extremely secure. Techniques such as Principal Component analysis
(PCA), Independent component analysis (ICA), Linear Discriminant Analysis
(LDA), have been the predominant ones to be used. But with improvements needed
in the previous approaches Neural Networks based recognition was like boon to
the industry. It not only enhanced the recognition but also the efficiency of
the process. Choosing Backpropagation as the learning method was clearly out of
its efficiency to recognize nonlinear faces with an acceptance ratio of more
than 90% and execution time of only few seconds.
","[{'version': 'v1', 'created': 'Sat, 28 Jan 2017 06:44:31 GMT'}]",2017-01-31,"[['Tikoo', 'Smriti', ''], ['Malik', 'Nitin', '']]","['Face detection', 'Biometric analysis', 'Recognition', 'Backpropagation', 'Neural Networks']"
3563,1708.06561,Basavaraju H T,"P. Shivakumara, D. S. Guru, and H.T. Basavaraju",Color and Gradient Features for Text Segmentation from Video Frames,,"Multimedia Processing, Communication and Computing Applications
  (pp. 267-278). Springer, New Delhi (2013)",10.1007/978-81-322-1143-3_22,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Text segmentation in a video is drawing attention of researchers in the field
of image processing, pattern recognition and document image analysis because it
helps in annotating and labeling video events accurately. We propose a novel
idea of generating an enhanced frame from the R, G, and B channels of an input
frame by grouping high and low values using Min-Max clustering criteria. We
also perform sliding window on enhanced frame to group high and low values from
the neighboring pixel values to further enhance the frame. Subsequently, we use
k-means with k=2 clustering algorithm to separate text and non-text regions.
The fully connected components will be identified in the skeleton of the frame
obtained by k-means clustering. Concept of connected component analysis based
on gradient feature has been adapted for the purpose of symmetry verification.
The components which satisfy symmetric verification are selected to be the
representatives of text regions and they are permitted to grow to cover their
respective region fully containing text. The method is tested on variety of
video frames to evaluate the performance of the method in terms of recall,
precision and f-measure. The results show that method is promising and
encouraging.
","[{'version': 'v1', 'created': 'Tue, 22 Aug 2017 11:10:57 GMT'}]",2017-08-23,"[['Shivakumara', 'P.', ''], ['Guru', 'D. S.', ''], ['Basavaraju', 'H. T.', '']]","['Min-Max clustering', 'Sliding window', 'K-means', 'Connected component analysis', 'Symmetry verification', 'Text detection']"
3564,1804.10775,Khalid Raza,Khalid Raza,Fuzzy logic based approaches for gene regulatory network inference,"29 pages, 12 figures and 1 table","Artificial Intelligence in Medicine, (2020) Elsevier, 97: 189-203",10.1016/j.artmed.2018.12.004,,cs.CE q-bio.MN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rapid advancement in high-throughput techniques has fueled the generation
of large volume of biological data rapidly with low cost. Some of these
techniques are microarray and next generation sequencing which provides genome
level insight of living cells. As a result, the size of most of the biological
databases, such as NCBI-GEO, NCBI-SRA, is exponentially growing. These
biological data are analyzed using computational techniques for knowledge
discovery - which is one of the objectives of bioinformatics research. Gene
regulatory network (GRN) is a gene-gene interaction network which plays pivotal
role in understanding gene regulation process and disease studies. From the
last couple of decades, the researchers are interested in developing
computational algorithms for GRN inference (GRNI) using high-throughput
experimental data. Several computational approaches have been applied for
inferring GRN from gene expression data including statistical techniques
(correlation coefficient), information theory (mutual information), regression
based approaches, probabilistic approaches (Bayesian networks, naive byes),
artificial neural networks, and fuzzy logic. The fuzzy logic, along with its
hybridization with other intelligent approach, is well studied in GRNI due to
its several advantages. In this paper, we present a consolidated review on
fuzzy logic and its hybrid approaches for GRNI developed during last two
decades.
","[{'version': 'v1', 'created': 'Sat, 28 Apr 2018 09:49:08 GMT'}]",2020-05-01,"[['Raza', 'Khalid', '']]","['Fuzzy logic', 'gene regulatory network', 'network inference', 'fuzzy clustering', 'fuzzy inference system', 'systems biology']"
3565,1609.01233,James P. Crutchfield,Ryan G. James and James P. Crutchfield,Multivariate Dependence Beyond Shannon Information,"10 pages, 6 figures, 3 tables;
  http://csc.ucdavis.edu/~cmg/compmech/pubs/mdbsi.htm",,10.3390/e19100531,,cs.IT cond-mat.stat-mech math.IT math.ST stat.ML stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurately determining dependency structure is critical to discovering a
system's causal organization. We recently showed that the transfer entropy
fails in a key aspect of this---measuring information flow---due to its
conflation of dyadic and polyadic relationships. We extend this observation to
demonstrate that this is true of all such Shannon information measures when
used to analyze multivariate dependencies. This has broad implications,
particularly when employing information to express the organization and
mechanisms embedded in complex systems, including the burgeoning efforts to
combine complex network theory with information theory. Here, we do not suggest
that any aspect of information theory is wrong. Rather, the vast majority of
its informational measures are simply inadequate for determining the meaningful
dependency structure within joint probability distributions. Therefore, such
information measures are inadequate for discovering intrinsic causal relations.
We close by demonstrating that such distributions exist across an arbitrary set
of variables.
","[{'version': 'v1', 'created': 'Mon, 5 Sep 2016 17:38:07 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Sep 2016 23:07:39 GMT'}]",2017-11-22,"[['James', 'Ryan G.', ''], ['Crutchfield', 'James P.', '']]","['stochastic process', 'transfer entropy', 'causation entropy', 'partial information decomposition', 'networkscience', 'causality']"
3566,2206.13413,Yuyang Gao,"Yuyang Gao, Tong Steven Sun, Guangji Bai, Siyi Gu, Sungsoo Ray Hong,
  Liang Zhao",RES: A Robust Framework for Guiding Visual Explanation,Published in KDD 2022,"In Proceedings of the 28th ACM SIGKDD Conference on Knowledge
  Discovery and Data Mining (KDD '22), August 14-18, 2022, Washington, DC, USA",10.1145/3534678.3539419,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Despite the fast progress of explanation techniques in modern Deep Neural
Networks (DNNs) where the main focus is handling ""how to generate the
explanations"", advanced research questions that examine the quality of the
explanation itself (e.g., ""whether the explanations are accurate"") and improve
the explanation quality (e.g., ""how to adjust the model to generate more
accurate explanations when explanations are inaccurate"") are still relatively
under-explored. To guide the model toward better explanations, techniques in
explanation supervision - which add supervision signals on the model
explanation - have started to show promising effects on improving both the
generalizability as and intrinsic interpretability of Deep Neural Networks.
However, the research on supervising explanations, especially in vision-based
applications represented through saliency maps, is in its early stage due to
several inherent challenges: 1) inaccuracy of the human explanation annotation
boundary, 2) incompleteness of the human explanation annotation region, and 3)
inconsistency of the data distribution between human annotation and model
explanation maps. To address the challenges, we propose a generic RES framework
for guiding visual explanation by developing a novel objective that handles
inaccurate boundary, incomplete region, and inconsistent distribution of human
annotations, with a theoretical justification on model generalizability.
Extensive experiments on two real-world image datasets demonstrate the
effectiveness of the proposed framework on enhancing both the reasonability of
the explanation and the performance of the backbone DNNs model.
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2022 16:06:27 GMT'}]",2022-06-28,"[['Gao', 'Yuyang', ''], ['Sun', 'Tong Steven', ''], ['Bai', 'Guangji', ''], ['Gu', 'Siyi', ''], ['Hong', 'Sungsoo Ray', ''], ['Zhao', 'Liang', '']]","['Explainability', 'Interpretability', 'Robustness', 'Visual Explanation']"
3567,1404.3706,Samir Lemes,"Samir Lemes, Damir Strbac, Malik Cabaravdic",Using industrial robot to manipulate the measured object in CMM,,"International Journal of Advanced Robotic Systems: Industrial
  Robots, Antonio Visioli (Ed.), Vol. 10, 281: 2013, IF 0.82, ISSN 1729-8806",10.5772/56585,,cs.RO,http://creativecommons.org/licenses/by/3.0/,"  Coordinate measuring machines (CMMs) are widely used to check dimensions of
manufactured parts, especially in automotive industry. The major obstacles in
automation of these measurements are fixturing and clamping assemblies, which
are required in order to position the measured object within the CMM. This
paper describes how an industrial robot can be used to manipulate the measured
object within the CMM work space, in order to enable automation of complex
geometry measurement.
","[{'version': 'v1', 'created': 'Mon, 14 Apr 2014 19:29:02 GMT'}]",2014-04-15,"[['Lemes', 'Samir', ''], ['Strbac', 'Damir', ''], ['Cabaravdic', 'Malik', '']]","['Industrial Robot', 'CMM', 'Measurement']"
3568,1812.03862,Manu Kumar Gupta,"Veeraruna Kavitha, Manu K. Gupta, Veronique Capdevielle, Rahul Kishor
  and Majed Haddad",Speed Based Optimal Power Control in Small Cell Networks,,Computer Communication 2019,10.1016/j.comcom.2019.04.009,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Small cell networks promise good quality of service (QoS) even for cell edge
users, however pose challenges to cater to the high-speed users. The major
difficulty being that of frequent handovers and the corresponding handover
losses, which significantly depend upon the speed of the user. It was shown
previously that the optimal cell size increases with speed. Thus, in scenarios
with diverse users (speeds spanning over large ranges), it would be inefficient
to serve all users using common cell radius and it is practically infeasible to
design different cell sizes for different speeds. Alternatively, we propose to
allocate power to a user based on its speed, e.g., higher power virtually
increases the cell size. We solve well known Hamiltonian Jacobi equations under
certain assumptions to obtain a power law, optimal for load factor and busy
probability, for any given average power constraint and cell size. The optimal
power control turns out to be linear in speed. We build a system level
simulator for small cell network, using elaborate Monte-Carlo simulations, and
show that the performance of the system improves significantly with linear
power law. The power law is tested even for the cases, for which the system
does not satisfy the assumptions required by the theory. For example, the
linear power law has significant improvement in comparison with the 'equal
power' system, even in presence of time varying and random interference. We
observe good improvement in almost all cases with improvements up to 89\% for
certain configurations.
","[{'version': 'v1', 'created': 'Mon, 10 Dec 2018 15:12:26 GMT'}]",2019-06-27,"[['Kavitha', 'Veeraruna', ''], ['Gupta', 'Manu K.', ''], ['Capdevielle', 'Veronique', ''], ['Kishor', 'Rahul', ''], ['Haddad', 'Majed', '']]","['Small cell networks', 'mobility', 'power control', 'drop probability', 'constrained optimization']"
3569,1801.00588,Xi Zhang,"Xi Zhang, Yunjia Zhang, Senzhang Wang, Yuntao Yao, Binxing Fang,
  Philip S. Yu",Improving Stock Market Prediction via Heterogeneous Information Fusion,Accepted by Knowledge-Based Systems,,10.1016/j.knosys.2017.12.025,,cs.SI physics.soc-ph q-fin.ST,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional stock market prediction approaches commonly utilize the
historical price-related data of the stocks to forecast their future trends. As
the Web information grows, recently some works try to explore financial news to
improve the prediction. Effective indicators, e.g., the events related to the
stocks and the people's sentiments towards the market and stocks, have been
proved to play important roles in the stocks' volatility, and are extracted to
feed into the prediction models for improving the prediction accuracy. However,
a major limitation of previous methods is that the indicators are obtained from
only a single source whose reliability might be low, or from several data
sources but their interactions and correlations among the multi-sourced data
are largely ignored.
  In this work, we extract the events from Web news and the users' sentiments
from social media, and investigate their joint impacts on the stock price
movements via a coupled matrix and tensor factorization framework.
Specifically, a tensor is firstly constructed to fuse heterogeneous data and
capture the intrinsic relations among the events and the investors' sentiments.
Due to the sparsity of the tensor, two auxiliary matrices, the stock
quantitative feature matrix and the stock correlation matrix, are constructed
and incorporated to assist the tensor decomposition. The intuition behind is
that stocks that are highly correlated with each other tend to be affected by
the same event. Thus, instead of conducting each stock prediction task
separately and independently, we predict multiple correlated stocks
simultaneously through their commonalities, which are enabled via sharing the
collaboratively factorized low rank matrices between matrices and the tensor.
Evaluations on the China A-share stock data and the HK stock data in the year
2015 demonstrate the effectiveness of the proposed model.
","[{'version': 'v1', 'created': 'Tue, 2 Jan 2018 09:30:39 GMT'}]",2018-01-03,"[['Zhang', 'Xi', ''], ['Zhang', 'Yunjia', ''], ['Wang', 'Senzhang', ''], ['Yao', 'Yuntao', ''], ['Fang', 'Binxing', ''], ['Yu', 'Philip S.', '']]","['social media', 'stock correlation', 'tensor factorization', 'stock']"
3570,1811.12099,Felix Rath,"Felix Rath, Daniel Schemmel, Klaus Wehrle","Interoperability-Guided Testing of QUIC Implementations using Symbolic
  Execution",6 pages,,10.1145/3284850.3284853,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The main reason for the standardization of network protocols, like QUIC, is
to ensure interoperability between implementations, which poses a challenging
task. Manual tests are currently used to test the different existing
implementations for interoperability, but given the complex nature of network
protocols, it is hard to cover all possible edge cases.
  State-of-the-art automated software testing techniques, such as Symbolic
Execution (SymEx), have proven themselves capable of analyzing complex
real-world software and finding hard to detect bugs. We present a SymEx-based
method for finding interoperability issues in QUIC implementations, and explore
its merit in a case study that analyzes the interoperability of picoquic and
QUANT. We find that, while SymEx is able to analyze deep interactions between
different implementations and uncovers several bugs, in order to enable
efficient interoperability testing, implementations need to provide additional
information about their current protocol state.
","[{'version': 'v1', 'created': 'Thu, 29 Nov 2018 12:41:38 GMT'}]",2018-11-30,"[['Rath', 'Felix', ''], ['Schemmel', 'Daniel', ''], ['Wehrle', 'Klaus', '']]","['QUIC', 'Interoperability Testing', 'Symbolic Execution']"
3571,1806.09880,Benjamin Unger,Benjamin Unger and Serkan Gugercin,Kolmogorov $n$-widths for linear dynamical systems,S. Adv Comput Math (2019),,10.1007/s10444-019-09701-0,,cs.SY math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Kolmogorov $n$-widths and Hankel singular values are two commonly used
concepts in model reduction. Here we show that for the special case of linear
time-invariant dynamical (LTI) systems, these two concepts are directly
connected. More specifically, the greedy search applied to the Hankel operator
of an LTI system resembles the minimizing subspace for the Kolmogorov n-width
and the Kolmogorov $n$-width of an LTI system equals its $(n+1)st$ Hankel
singular value once the subspaces are appropriately defined. We also establish
a lower bound for the Kolmorogov $n$-width for parametric LTI systems and
illustrate that the method of active subspaces can be viewed as the dual
concept to the minimizing subspace for the Kolmogorov $n$-width.
","[{'version': 'v1', 'created': 'Tue, 26 Jun 2018 09:53:19 GMT'}]",2019-05-20,"[['Unger', 'Benjamin', ''], ['Gugercin', 'Serkan', '']]","['model reduction', 'Hankel singular values', 'Kolmogorov n-width', 'Hankel operator', 'reduced basis method', 'active subspaces']"
3572,1507.06927,Luiz Capretz Dr.,"Faheem Ahmed, Piers Campbell, Ahmad Jaffar, Luiz Fernando Capretz","Myths and Realities about Online Forums in Open Source Software
  Development: An Empirical Study",,"The Open Software Engineering Journal, Volume 4, 52-63, 2010",10.2174/1875107X01004010052,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of free and open source software (OSS) is gaining momentum due to the
ever increasing availability and use of the Internet. Organizations are also
now adopting open source software, despite some reservations, in particular
regarding the provision and availability of support. Some of the biggest
concerns about free and open source software are post release software defects
and their rectification, management of dynamic requirements and support to the
users. A common belief is that there is no appropriate support available for
this class of software. A contradictory argument is that due to the active
involvement of Internet users in online forums, there is in fact a large
resource available that communicates and manages the provision of support. The
research model of this empirical investigation examines the evidence available
to assess whether this commonly held belief is based on facts given the current
developments in OSS or simply a myth, which has developed around OSS
development. We analyzed a dataset consisting of 1880 open source software
projects covering a broad range of categories in this investigation. The
results show that online forums play a significant role in managing software
defects, implementation of new requirements and providing support to the users
in open source software and have become a major source of assistance in
maintenance of the open source projects.
","[{'version': 'v1', 'created': 'Fri, 24 Jul 2015 17:39:03 GMT'}]",2015-07-27,"[['Ahmed', 'Faheem', ''], ['Campbell', 'Piers', ''], ['Jaffar', 'Ahmad', ''], ['Capretz', 'Luiz Fernando', '']]","['Open source software', 'empirical study', 'online forums', 'software defect management', 'online communities']"
3573,1802.07525,Michail-Antisthenis Tsompanas,"Michail-Antisthenis Tsompanas, Andrew Adamatzky, Ioannis Ieropoulos,
  Neil Phillips, Georgios Ch. Sirakoulis, John Greenman",Modelling Microbial Fuel Cells using lattice Boltzmann methods,,,10.1109/TCBB.2018.2831223,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An accurate modelling of bio-electrochemical processes that govern Microbial
Fuel Cells (MFCs) and mapping their behaviour according to several parameters
will enhance the development of MFC technology and enable their successful
implementation in well defined applications. The geometry of the electrodes is
among key parameters determining efficiency of MFCs due to the formation of a
biofilm of anodophilic bacteria on the anode electrode, which is a decisive
factor for the functionality of the device. We simulate the bio-electrochemical
processes in an MFC while taking into account the geometry of the electrodes.
Namely, lattice Boltzmann methods are used to simulate the fluid dynamics and
the advection-diffusion phenomena in the anode compartment. The model is
verified on voltage and current outputs of a single MFC derived from laboratory
experiments under continuous flow.
","[{'version': 'v1', 'created': 'Wed, 21 Feb 2018 11:48:49 GMT'}]",2020-05-22,"[['Tsompanas', 'Michail-Antisthenis', ''], ['Adamatzky', 'Andrew', ''], ['Ieropoulos', 'Ioannis', ''], ['Phillips', 'Neil', ''], ['Sirakoulis', 'Georgios Ch.', ''], ['Greenman', 'John', '']]","['microbial fuel cells', 'lattice Boltzmann', 'modelling', 'agent-based model', 'bio-electrochemicalprocesses']"
3574,1811.11941,Felix Hamza-Lup,"Felix G. Hamza-Lup, Shane Farrar, Erik Leon",Interactive X-ray and proton therapy training and simulation,,"International Journal on Computer Assisted Radiology and Surgery,
  Vol. 10(10) (2015), pp. 1675-1683",10.1007/s11548-015-1229-7,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  External beam X-ray therapy (XRT) and proton therapy (PT) are effective and
widely accepted forms of treatment for many types of cancer. However, the
procedures require extensive computerized planning. Current planning systems
for both XRT and PT have insufficient visual aid to combine real patient data
with the treatment device geometry to account for unforeseen collisions among
system components and the patient. We are proposing a cost-effective method to
extract patient specific S-reps in real time, and combine them with the
treatment system geometry to provide a comprehensive simulation of the XRT/PT
treatment room. The X3D standard is used to implement and deploy the simulator
on the web, enabling its use not only for remote specialists' collaboration,
simulation, and training, but also for patient education.
","[{'version': 'v1', 'created': 'Thu, 29 Nov 2018 03:24:03 GMT'}]",2018-11-30,"[['Hamza-Lup', 'Felix G.', ''], ['Farrar', 'Shane', ''], ['Leon', 'Erik', '']]","['proton therapy', 'x-ray therapy', 'e-Learning', 'X3D', 'radiation therapy']"
3575,1802.09660,George Leu,George Leu and Hussein Abbass,"Computational Red Teaming in a Sudoku Solving Context: Neural Network
  Based Skill Representation and Acquisition",,"Proceedings in Adaptation, Learning and Optimization, vol. 5,
  Springer, 2016",10.1007/978-3-319-27000-5_26,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we provide an insight into the skill representation, where
skill representation is seen as an essential part of the skill assessment stage
in the Computational Red Teaming process. Skill representation is demonstrated
in the context of Sudoku puzzle, for which the real human skills used in Sudoku
solving, along with their acquisition, are represented computationally in a
cognitively plausible manner, by using feed-forward neural networks with
back-propagation, and supervised learning. The neural network based skills are
then coupled with a hard-coded constraint propagation computational Sudoku
solver, in which the solving sequence is kept hard-coded, and the skills are
represented through neural networks. The paper demonstrates that the modified
solver can achieve different levels of proficiency, depending on the amount of
skills acquired through the neural networks. Results are encouraging for
developing more complex skill and skill acquisition models usable in general
frameworks related to the skill assessment aspect of Computational Red Teaming.
","[{'version': 'v1', 'created': 'Tue, 27 Feb 2018 00:49:45 GMT'}]",2018-02-28,"[['Leu', 'George', ''], ['Abbass', 'Hussein', '']]","['neural network', 'domain propagation', 'skill acquisition', 'supervised learning']"
3576,1404.7843,Farhan Farhan,Farhan Farhan,Study of Timing Synchronization in MIMO-OFDM Systems Using DVB-T,,,10.5121/ijit.2014.3201,,cs.IT math.IT,http://creativecommons.org/licenses/by/3.0/,"  OFDM (Orthogonal Frequency Division Multiplexing)provides the promising
physical layer for 4G and 3GPP LTE Systems in terms of efficient use of
bandwidth and data rates. This paper highlights the implementation of OFDM in
Digital Video Broadcasting-Terrestrial (DVB-T). It mainly focuses on the timing
offset problem present in OFDM systems and its proposed solution using Cyclic
Prefix (CP) as a modified SC (Schmidl and COX) algorithm. It also highlights
the timing synchronization as well as performance comparison through bit error
rate. Synchronization issues in OFDM are important and can lead to information
loss if not properly addressed. Simulations were performed to implement DVB-T
system and to compare different synchronization methods under certain
distribution model.
","[{'version': 'v1', 'created': 'Wed, 30 Apr 2014 19:29:20 GMT'}]",2014-05-01,"[['Farhan', 'Farhan', '']]","['OFDM', 'Timing', 'Synchronization', 'DVB', 'BER  1']"
3577,1808.09242,Steven Van Rossem,"Steven Van Rossem, Wouter Tavernier, Didier Colle, Mario Pickavet,
  Piet Demeester",Introducing Development Features for Virtualized Network Services,,"IEEE Communications Magazine ( Volume: 56, Issue: 8, August 2018 )",10.1109/MCOM.2018.1600104,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network virtualization and softwarizing network functions are trends aiming
at higher network efficiency, cost reduction and agility. They are driven by
the evolution in Software Defined Networking (SDN) and Network Function
Virtualization (NFV). This shows that software will play an increasingly
important role within telecommunication services, which were previously
dominated by hardware appliances. Service providers can benefit from this, as
it enables faster introduction of new telecom services, combined with an agile
set of possibilities to optimize and fine-tune their operations. However, the
provided telecom services can only evolve if the adequate software tools are
available. In this article, we explain how the development, deployment and
maintenance of such an SDN/NFV-based telecom service puts specific requirements
on the platform providing it. A Software Development Kit (SDK) is introduced,
allowing service providers to adequately design, test and evaluate services
before they are deployed in production and also update them during their
lifetime. This continuous cycle between development and operations, a concept
known as DevOps, is a well known strategy in software development. To extend
its context further to SDN/NFV-based services, the functionalities provided by
traditional cloud platforms are not yet sufficient. By giving an overview of
the currently available tools and their limitations, the gaps in DevOps for
SDN/NFV services are highlighted. The benefit of such an SDK is illustrated by
a secure content delivery network service (enhanced with deep packet inspection
and elastic routing capabilities). With this use-case, the dynamics between
developing and deploying a service are further illustrated.
","[{'version': 'v1', 'created': 'Tue, 28 Aug 2018 12:03:39 GMT'}]",2018-08-29,"[['Van Rossem', 'Steven', ''], ['Tavernier', 'Wouter', ''], ['Colle', 'Didier', ''], ['Pickavet', 'Mario', ''], ['Demeester', 'Piet', '']]","['Network Function Virtualization', 'Software Defined Networking', 'Service Function Chaining', 'Software Development Kit', 'DevOps', 'SDN/NFV-based telecom service']"
3578,1504.00191,Sanjay Sahay,"Rajendra Kumar Roul, Shubham Rohan Asthana, Sanjay Kumar Sahay","Automated Document Indexing via Intelligent Hierarchical Clustering: A
  Novel Approach","6 Pages, 3 Figures. IEEE Xplore, ICHPCA-2014",,10.1109/ICHPCA.2014.7045347,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rising quantity of textual data available in electronic format, the
need to organize it become a highly challenging task. In the present paper, we
explore a document organization framework that exploits an intelligent
hierarchical clustering algorithm to generate an index over a set of documents.
The framework has been designed to be scalable and accurate even with large
corpora. The advantage of the proposed algorithm lies in the need for minimal
inputs, with much of the hierarchy attributes being decided in an automated
manner using statistical methods. The use of topic modeling in a pre-processing
stage ensures robustness to a range of variations in the input data. For
experimental work 20-Newsgroups dataset has been used. The F- measure of the
proposed approach has been compared with the traditional K-Means and K-Medoids
clustering algorithms. Test results demonstrate the applicability, efficiency
and effectiveness of our proposed approach. After extensive experimentation, we
conclude that the framework shows promise for further research and specialized
commercial applications.
","[{'version': 'v1', 'created': 'Wed, 1 Apr 2015 12:08:36 GMT'}]",2015-04-02,"[['Roul', 'Rajendra Kumar', ''], ['Asthana', 'Shubham Rohan', ''], ['Sahay', 'Sanjay Kumar', '']]","['Hierarchical Clustering', 'Indexing', 'Latent DirichletAllocation', 'Latent Semantic Indexing', 'Topic Modeling']"
3579,1901.10002,Harini Suresh,"Harini Suresh, John V. Guttag","A Framework for Understanding Sources of Harm throughout the Machine
  Learning Life Cycle",,"EAAMO 2021: Equity and Access in Algorithms, Mechanisms, and
  Optimization",10.1145/3465416.3483305,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As machine learning (ML) increasingly affects people and society, awareness
of its potential unwanted consequences has also grown. To anticipate, prevent,
and mitigate undesirable downstream consequences, it is critical that we
understand when and how harm might be introduced throughout the ML life cycle.
In this paper, we provide a framework that identifies seven distinct potential
sources of downstream harm in machine learning, spanning data collection,
development, and deployment. In doing so, we aim to facilitate more productive
and precise communication around these issues, as well as more direct,
application-grounded ways to mitigate them.
","[{'version': 'v1', 'created': 'Mon, 28 Jan 2019 21:00:20 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Jan 2020 22:34:24 GMT'}, {'version': 'v3', 'created': 'Mon, 17 Feb 2020 15:25:42 GMT'}, {'version': 'v4', 'created': 'Tue, 15 Jun 2021 14:16:55 GMT'}, {'version': 'v5', 'created': 'Wed, 1 Dec 2021 21:37:38 GMT'}]",2021-12-03,"[['Suresh', 'Harini', ''], ['Guttag', 'John V.', '']]","['fairness in machine learning', 'societal implications of machine learning', 'algorithmic bias', 'AI ethics', 'allocative harm', 'representationalharm']"
3580,2008.04860,Jerin Philip,"Jerin Philip, Shashank Siripragada, Vinay P. Namboodiri, C.V. Jawahar","Revisiting Low Resource Status of Indian Languages in Machine
  Translation","10 pages, few figures, Preprint under review","8th ACM IKDD CODS and 26th COMAD (CODS COMAD 2021), January 2--4,
  2021, Bangalore, India",10.1145/3430984.3431026,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Indian language machine translation performance is hampered due to the lack
of large scale multi-lingual sentence aligned corpora and robust benchmarks.
Through this paper, we provide and analyse an automated framework to obtain
such a corpus for Indian language neural machine translation (NMT) systems. Our
pipeline consists of a baseline NMT system, a retrieval module, and an
alignment module that is used to work with publicly available websites such as
press releases by the government. The main contribution towards this effort is
to obtain an incremental method that uses the above pipeline to iteratively
improve the size of the corpus as well as improve each of the components of our
system. Through our work, we also evaluate the design choices such as the
choice of pivoting language and the effect of iterative incremental increase in
corpus size. Our work in addition to providing an automated framework also
results in generating a relatively larger corpus as compared to existing
corpora that are available for Indian languages. This corpus helps us obtain
substantially improved results on the publicly available WAT evaluation
benchmark and other standard evaluation benchmarks.
","[{'version': 'v1', 'created': 'Tue, 11 Aug 2020 17:05:13 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Nov 2020 09:29:26 GMT'}]",2020-11-05,"[['Philip', 'Jerin', ''], ['Siripragada', 'Shashank', ''], ['Namboodiri', 'Vinay P.', ''], ['Jawahar', 'C. V.', '']]","['parallel corpus', 'machine translation', 'information retrieval']"
3581,1802.07648,Nicolas Gillis,"Maryam Abdolali, Nicolas Gillis, Mohammad Rahmati","Scalable and Robust Sparse Subspace Clustering Using Randomized
  Clustering and Multilayer Graphs","25 pages, v2: typos corrected","Signal Processing 163, pp. 166-180, 2019",10.1016/j.sigpro.2019.05.017,,cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sparse subspace clustering (SSC) is one of the current state-of-the-art
methods for partitioning data points into the union of subspaces, with strong
theoretical guarantees. However, it is not practical for large data sets as it
requires solving a LASSO problem for each data point, where the number of
variables in each LASSO problem is the number of data points. To improve the
scalability of SSC, we propose to select a few sets of anchor points using a
randomized hierarchical clustering method, and, for each set of anchor points,
solve the LASSO problems for each data point allowing only anchor points to
have a non-zero weight (this reduces drastically the number of variables). This
generates a multilayer graph where each layer corresponds to a different set of
anchor points. Using the Grassmann manifold of orthogonal matrices, the shared
connectivity among the layers is summarized within a single subspace. Finally,
we use $k$-means clustering within that subspace to cluster the data points,
similarly as done by spectral clustering in SSC. We show on both synthetic and
real-world data sets that the proposed method not only allows SSC to scale to
large-scale data sets, but that it is also much more robust as it performs
significantly better on noisy data and on data with close susbspaces and
outliers, while it is not prone to oversegmentation.
","[{'version': 'v1', 'created': 'Wed, 21 Feb 2018 16:21:42 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Feb 2018 06:59:12 GMT'}]",2019-08-06,"[['Abdolali', 'Maryam', ''], ['Gillis', 'Nicolas', ''], ['Rahmati', 'Mohammad', '']]","['sparse subspace clustering', 'randomized clustering', 'hierarchical clustering', 'multilayergraph', 'spectral clustering']"
3582,1310.7428,Dmitry Bugaychenko,"Dmitry Bugaychenko, Alexandr Dzuba",Musical recommendations and personalization in a social network,"This is a full version of a 4 pages article published at ACM RecSys
  2013",,10.1145/2507157.2507192,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a set of algorithms used for music recommendations and
personalization in a general purpose social network www.ok.ru, the second
largest social network in the CIS visited by more then 40 millions users per
day. In addition to classical recommendation features like ""recommend a
sequence"" and ""find similar items"" the paper describes novel algorithms for
construction of context aware recommendations, personalization of the service,
handling of the cold-start problem, and more. All algorithms described in the
paper are working on-line and are able to detect and address changes in the
user's behavior and needs in the real time.
  The core component of the algorithms is a taste graph containing information
about different entities (users, tracks, artists, etc.) and relations between
them (for example, user A likes song B with certainty X, track B created by
artist C, artist C is similar to artist D with certainty Y and so on). Using
the graph it is possible to select tracks a user would most probably like, to
arrange them in a way that they match each other well, to estimate which items
from a fixed list are most relevant for the user, and more.
  In addition, the paper describes the approach used to estimate algorithms
efficiency and analyze the impact of different recommendation related features
on the users' behavior and overall activity at the service.
","[{'version': 'v1', 'created': 'Mon, 28 Oct 2013 14:30:52 GMT'}]",2013-10-29,"[['Bugaychenko', 'Dmitry', ''], ['Dzuba', 'Alexandr', '']]","['musical recommendations', 'personalization', 'random walk']"
3583,2105.06858,Andrea Raffo,"Chiara Romanengo, Andrea Raffo, Yifan Qie, Nabil Anwer, Bianca
  Falcidieno","Fit4CAD: A point cloud benchmark for fitting simple geometric primitives
  in CAD objects",,,10.1016/j.cag.2021.09.013,,cs.GR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose Fit4CAD, a benchmark for the evaluation and comparison of methods
for fitting simple geometric primitives in point clouds representing CAD
objects. This benchmark is meant to help both method developers and those who
want to identify the best performing tools. The Fit4CAD dataset is composed by
225 high quality point clouds, each of which has been obtained by sampling a
CAD object. The way these elements were created by using existing platforms and
datasets makes the benchmark easily expandable. The dataset is already split
into a training set and a test set. To assess performance and accuracy of the
different primitive fitting methods, various measures are defined. To
demonstrate the effective use of Fit4CAD, we have tested it on two methods
belonging to two different categories of approaches to the primitive fitting
problem: a clustering method based on a primitive growing framework and a
parametric method based on the Hough transform.
","[{'version': 'v1', 'created': 'Fri, 14 May 2021 14:32:08 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Jul 2021 11:55:02 GMT'}, {'version': 'v3', 'created': 'Tue, 5 Oct 2021 09:00:56 GMT'}]",2021-10-06,"[['Romanengo', 'Chiara', ''], ['Raffo', 'Andrea', ''], ['Qie', 'Yifan', ''], ['Anwer', 'Nabil', ''], ['Falcidieno', 'Bianca', '']]","['Benchmarking', 'Geometric primitive fitting', 'CAD objects', 'Quality measures']"
3584,1808.07044,Shinhoo Kang,"Shinhoo Kang, Tan Bui-Thanh, Todd Arbogast","A Hybridized Discontinuous Galerkin Method for A Linear Degenerate
  Elliptic Equation Arising from Two-Phase Mixtures","20 pages, 6 figures, 8 tables",,10.1016/j.cma.2019.03.018,,cs.CE cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop a high-order hybridized discontinuous Galerkin (HDG) method for a
linear degenerate elliptic equation arising from a two-phase mixture of mantle
convection or glacier dynamics. We show that the proposed HDG method is
well-posed by using an energy approach. We derive ${\it a priori}$ error
estimates for the proposed HDG method on simplicial meshes in both two- and
three-dimensions. The error analysis shows that the convergence rates are
optimal for both the scaled pressure and the scaled velocity for non-degenerate
problems and are sub-optimal by half order for degenerate ones. Several
numerical results are presented to confirm the theoretical estimates. We also
enhance the HDG solutions by post-processing. The superconvergence rates of
$(k+2)$ and $(k+\frac{3}{2})$ are observed for both a non-degenerate case and a
degenerate case away from the degeneracy. Degenerate problems with low
regularity solutions are also studied, and numerical results show that
high-order methods are beneficial in terms of accuracy.
","[{'version': 'v1', 'created': 'Tue, 21 Aug 2018 17:52:59 GMT'}, {'version': 'v2', 'created': 'Sun, 18 Nov 2018 03:08:20 GMT'}]",2019-05-01,"[['Kang', 'Shinhoo', ''], ['Bui-Thanh', 'Tan', ''], ['Arbogast', 'Todd', '']]","['discontinuous Galerkin methods', 'hybridization', 'degenerate elliptic equation', 'two-phase mixtures', 'error estimates']"
3585,1405.6170,Atul  Singh Kushwah Mr.,"Mr. Atul Singh Kushwah, Mr. Sachin Manglasheril",Performance Estimation of 2*3 MIMO-MC-CDMA in Rayleigh Fading Channel,"4 pages, 3 figures and 2 tables","Mr. Atul Singh Kushwah , Mr. Sachin Manglasheril.""Performance
  Estimation of 2*3 MIMO-MC-CDMA in Rayleigh Fading Channel"". International
  Journal of Computer Trends and Technology (IJCTT) V9(1):32-35, March 2014",10.14445/22312803/IJCTT-V9P107,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we analyze the performance of 2by3 MIMOMCCDMA system in MATLAB
which greatly reduces BER by increasing the efficiency of system. MIMO and
MCCDMA system arrangement is used to decrease bit error rate and also figure a
new system called MCCDMA which is multiple user and multiple access system used
to enhance the performance of the system. MCCDMA is a narrowband flat fading in
character which changes frequency selective to several narrowband flat fading
multiple parallel subcarriers to enhance the effectiveness of the system. Now
this MCCDMA further improved by grouping by 2by3 MIMO system which make use of
ZF decoder at the receiver to reduce BER in which half rate convolutional
encoded Alamouti STBC block code is intended for channel encoding as transmit
diversity for MIMO with multiple transmit and receive antennas. Main
improvement of using MIMOMCCDMA is for reducing complication of system and also
for dropping BER and finally increasing gain of the system. Then we estimate
the system in different modulation techniques like, 64QAM, 8PSK, 16QAM, QPSK,
32QAM and 8QAM using MATLAB in Rayleigh fading channel.
","[{'version': 'v1', 'created': 'Wed, 12 Mar 2014 14:27:01 GMT'}]",2014-05-26,"[['Kushwah', 'Mr. Atul Singh', ''], ['Manglasheril', 'Mr. Sachin', '']]","['MIMO-MC-CDMA', 'CDMA', 'MIMO and OFDM']"
3586,1912.06180,Victor Costa,"Victor Costa, Nuno Louren\c{c}o, Jo\~ao Correia and Penousal Machado","COEGAN: Evaluating the Coevolution Effect in Generative Adversarial
  Networks","Published in GECCO 2019. arXiv admin note: text overlap with
  arXiv:1912.06172",,10.1145/3321707.3321746,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generative adversarial networks (GAN) present state-of-the-art results in the
generation of samples following the distribution of the input dataset. However,
GANs are difficult to train, and several aspects of the model should be
previously designed by hand. Neuroevolution is a well-known technique used to
provide the automatic design of network architectures which was recently
expanded to deep neural networks. COEGAN is a model that uses neuroevolution
and coevolution in the GAN training algorithm to provide a more stable training
method and the automatic design of neural network architectures. COEGAN makes
use of the adversarial aspect of the GAN components to implement coevolutionary
strategies in the training algorithm. Our proposal was evaluated in the
Fashion-MNIST and MNIST dataset. We compare our results with a baseline based
on DCGAN and also with results from a random search algorithm. We show that our
method is able to discover efficient architectures in the Fashion-MNIST and
MNIST datasets. The results also suggest that COEGAN can be used as a training
algorithm for GANs to avoid common issues, such as the mode collapse problem.
","[{'version': 'v1', 'created': 'Thu, 12 Dec 2019 19:43:04 GMT'}]",2019-12-16,"[['Costa', 'Victor', ''], ['Lourenço', 'Nuno', ''], ['Correia', 'João', ''], ['Machado', 'Penousal', '']]","['neuroevolution', 'coevolution', 'generative adversarial networks']"
3587,2006.11103,Arthur Drichel,"Arthur Drichel, Ulrike Meyer, Samuel Sch\""uppen, Dominik Teubert",Analyzing the Real-World Applicability of DGA Classifiers,"Accepted at The 15th International Conference on Availability,
  Reliability and Security (ARES 2020)","In The 15th International Conference on Availability, Reliability
  and Security (ARES 2020), ACM, 11 pages",10.1145/3407023.3407030,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Separating benign domains from domains generated by DGAs with the help of a
binary classifier is a well-studied problem for which promising performance
results have been published. The corresponding multiclass task of determining
the exact DGA that generated a domain enabling targeted remediation measures is
less well studied. Selecting the most promising classifier for these tasks in
practice raises a number of questions that have not been addressed in prior
work so far. These include the questions on which traffic to train in which
network and when, just as well as how to assess robustness against adversarial
attacks. Moreover, it is unclear which features lead a classifier to a decision
and whether the classifiers are real-time capable. In this paper, we address
these issues and thus contribute to bringing DGA detection classifiers closer
to practical use. In this context, we propose one novel classifier based on
residual neural networks for each of the two tasks and extensively evaluate
them as well as previously proposed classifiers in a unified setting. We not
only evaluate their classification performance but also compare them with
respect to explainability, robustness, and training and classification speed.
Finally, we show that our newly proposed binary classifier generalizes well to
other networks, is time-robust, and able to identify previously unknown DGAs.
","[{'version': 'v1', 'created': 'Fri, 19 Jun 2020 12:34:05 GMT'}]",2020-06-22,"[['Drichel', 'Arthur', ''], ['Meyer', 'Ulrike', ''], ['Schüppen', 'Samuel', ''], ['Teubert', 'Dominik', '']]","['DGA detection', 'machine learning', 'real-world applicability']"
3588,1808.00829,Sebastian Eibl,"Sebastian Eibl and Ulrich R\""ude","A Systematic Comparison of Dynamic Load Balancing Algorithms for
  Massively Parallel Rigid Particle Dynamics",,,10.1016/j.cpc.2019.06.020,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As compute power increases with time, more involved and larger simulations
become possible. However, it gets increasingly difficult to efficiently use the
provided computational resources. Especially in particle-based simulations with
a spatial domain partitioning large load imbalances can occur due to the
simulation being dynamic. Then a static domain partitioning may not be
suitable. This can deteriorate the overall runtime of the simulation
significantly. Sophisticated load balancing strategies must be designed to
alleviate this problem. In this paper we conduct a systematic evaluation of the
performance of six different load balancing algorithms. Our tests cover a wide
range of simulation sizes, and employ one of the largest supercomputers
available. In particular we study the runtime and memory complexity of all
components of the simulation carefully. When progressing to extreme scale
simulations it is essential to identify bottlenecks and to predict the scaling
behaviour. Scaling experiments are shown for up to over one million processes.
The performance of each algorithm is analyzed with respect to the quality of
the load balancing and its runtime costs. For all tests, the waLBerla
multiphysics framework is employed.
","[{'version': 'v1', 'created': 'Thu, 2 Aug 2018 14:22:03 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Aug 2019 08:06:50 GMT'}]",2019-08-05,"[['Eibl', 'Sebastian', ''], ['Rüde', 'Ulrich', '']]","['Runtime Domain Partitioning', 'Runtime Load Balancing', 'Rigid Body Dynamics', 'Discrete']"
3589,1902.09238,Ruihan Hu,"Ruihan Hu, Qijun Huang, Sheng Chang, Hao Wang and Jin He","The MBPEP: a deep ensemble pruning algorithm providing high quality
  uncertainty prediction","20 pages, 7 figures",Applied Intelligence(2019),10.1007/s10489-019-01421-8,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning algorithms have been effectively applied into various real
world tasks. However, it is difficult to provide high-quality machine learning
solutions to accommodate an unknown distribution of input datasets; this
difficulty is called the uncertainty prediction problems. In this paper, a
margin-based Pareto deep ensemble pruning (MBPEP) model is proposed. It
achieves the high-quality uncertainty estimation with a small value of the
prediction interval width (MPIW) and a high confidence of prediction interval
coverage probability (PICP) by using deep ensemble networks. In addition to
these networks, unique loss functions are proposed, and these functions make
the sub-learners available for standard gradient descent learning. Furthermore,
the margin criterion fine-tuning-based Pareto pruning method is introduced to
optimize the ensembles. Several experiments including predicting uncertainties
of classification and regression are conducted to analyze the performance of
MBPEP. The experimental results show that MBPEP achieves a small interval width
and a low learning error with an optimal number of ensembles. For the
real-world problems, MBPEP performs well on input datasets with unknown
distributions datasets incomings and improves learning performance on a multi
task problem when compared to that of each single model.
","[{'version': 'v1', 'created': 'Mon, 25 Feb 2019 12:52:29 GMT'}]",2019-02-26,"[['Hu', 'Ruihan', ''], ['Huang', 'Qijun', ''], ['Chang', 'Sheng', ''], ['Wang', 'Hao', ''], ['He', 'Jin', '']]","['uncertainty prediction', 'ensemble pruning', 'loss function', 'margin criterion tuning']"
3590,1807.03932,Bo Jiang,"Bo Jiang, Ye Liu, and W.K. Chan",ContractFuzzer: Fuzzing Smart Contracts for Vulnerability Detection,"To appear in ASE 2018, Montpellier, France. 10 pages",,10.1145/3238147.3238177,,cs.SE cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Decentralized cryptocurrencies feature the use of blockchain to transfer
values among peers on networks without central agency. Smart contracts are
programs running on top of the blockchain consensus protocol to enable people
make agreements while minimizing trusts. Millions of smart contracts have been
deployed in various decentralized applications. The security vulnerabilities
within those smart contracts pose significant threats to their applications.
Indeed, many critical security vulnerabilities within smart contracts on
Ethereum platform have caused huge financial losses to their users. In this
work, we present ContractFuzzer, a novel fuzzer to test Ethereum smart
contracts for security vulnerabilities. ContractFuzzer generates fuzzing inputs
based on the ABI specifications of smart contracts, defines test oracles to
detect security vulnerabilities, instruments the EVM to log smart contracts
runtime behaviors, and analyzes these logs to report security vulnerabilities.
Our fuzzing of 6991 smart contracts has flagged more than 459 vulnerabilities
with high precision. In particular, our fuzzing tool successfully detects the
vulnerability of the DAO contract that leads to USD 60 million loss and the
vulnerabilities of Parity Wallet that have led to the loss of $30 million and
the freezing of USD 150 million worth of Ether.
","[{'version': 'v1', 'created': 'Wed, 11 Jul 2018 02:32:54 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Aug 2018 01:03:39 GMT'}]",2018-08-06,"[['Jiang', 'Bo', ''], ['Liu', 'Ye', ''], ['Chan', 'W. K.', '']]","['Fuzzing', 'Fuzzer', 'Smart contract', 'Vulnerability', 'Testoracle', 'Ethereum', 'Blockchain']"
3591,1611.00559,Areg Karapetyan Dr.,"Areg Karapetyan, Majid Khonji, Chi-Kin Chau, and Khaled Elbassioni","Online Algorithm for Demand Response with Inelastic Demands and Apparent
  Power Constraint","An extended version of parts of this work appeared in the paper
  published under the title ""A Competitive Scheduling Algorithm for Online
  Demand Response in Islanded Microgrids"" in the IEEE Transactions on Power
  Systems journal","""A Competitive Scheduling Algorithm for Online Demand Response in
  Islanded Microgrids"", IEEE Transactions on Power Systems, Vol 36, No 4, Pages
  3430-3440, Dec 2020",10.1109/TPWRS.2020.3046144,,cs.DS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A classical problem in power systems is to allocate in-coming (elastic or
inelastic) demands without violating the operating constraints of electric
networks in an online fashion. Although online decision problems have been
well-studied in the literature, a unique challenge arising in power systems is
the presence of non-linear constraints, a departure from the traditional
settings. A particular example is the capacity constraint of apparent power,
which gives rise to a quadratic constraint, rather than typical linear
constraints. In this paper, we present a competitive randomized online
algorithm for deciding whether a sequence of inelastic demands can be allocated
for the requested intervals, subject to the total satisfiable apparent power
within a time-varying capacity constraint. We also consider an alternative
setting with nodal voltage constraint, using a variant of the online algorithm.
Finally, simulation studies are provided to evaluate the algorithms
empirically.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2016 11:53:31 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Oct 2021 05:17:26 GMT'}]",2021-10-26,"[['Karapetyan', 'Areg', ''], ['Khonji', 'Majid', ''], ['Chau', 'Chi-Kin', ''], ['Elbassioni', 'Khaled', '']]","['Demand response management', 'inelastic demands', 'apparent power constraint', 'competitive online algorithm']"
3592,cs/0608083,Paul M. Aoki,"Paul M. Aoki, Margaret H. Szymanski, Luke Plurkowski, James D.
  Thornton, Allison Woodruff, Weilie Yi","Where's the ""Party"" in ""Multi-Party""? Analyzing the Structure of
  Small-Group Sociable Talk",10 pages,"Proc. ACM Conf. on Computer Supported Cooperative Work, Banff,
  Alberta, Canada, Nov. 2006, 393-402. ACM Press.",10.1145/1180875.1180934,,cs.HC,,"  Spontaneous multi-party interaction - conversation among groups of three or
more participants - is part of daily life. While automated modeling of such
interactions has received increased attention in ubiquitous computing research,
there is little applied research on the organization of this highly dynamic and
spontaneous sociable interaction within small groups. We report here on an
applied conversation analytic study of small-group sociable talk, emphasizing
structural and temporal aspects that can inform computational models. In
particular, we examine the mechanics of multiple simultaneous conversational
floors - how participants initiate a new floor amidst an on-going floor, and
how they subsequently show their affiliation with one floor over another. We
also discuss the implications of these findings for the design of ""smart""
multi-party applications.
","[{'version': 'v1', 'created': 'Mon, 21 Aug 2006 01:42:52 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Sep 2006 03:57:25 GMT'}]",2007-05-23,"[['Aoki', 'Paul M.', ''], ['Szymanski', 'Margaret H.', ''], ['Plurkowski', 'Luke', ''], ['Thornton', 'James D.', ''], ['Woodruff', 'Allison', ''], ['Yi', 'Weilie', '']]","['Sociable talk', 'conversation analysis', 'small group interaction']"
3593,1705.08338,Aidin Ferdowsi,"Aidin Ferdowsi, Walid Saad, Behrouz Maham, Narayan B. Mandayam","A Colonel Blotto Game for Interdependence-Aware Cyber-Physical Systems
  Security in Smart Cities",,,10.1145/3063386.3063765,,cs.GT cs.IT cs.SY math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smart cities must integrate a number of interdependent cyber-physical systems
that operate in a coordinated manner to improve the well-being of the city's
residents. A cyber-physical system (CPS) is a system of computational elements
controlling physical entities. Large-scale CPSs are more vulnerable to attacks
due to the cyber-physical interdependencies that can lead to cascading failures
which can have a significant detrimental effect on a city. In this paper, a
novel approach is proposed for analyzing the problem of allocating security
resources, such as firewalls and anti-malware, over the various cyber
components of an interdependent CPS to protect the system against imminent
attacks. The problem is formulated as a Colonel Blotto game in which the
attacker seeks to allocate its resources to compromise the CPS, while the
defender chooses how to distribute its resources to defend against potential
attacks. To evaluate the effects of defense and attack, various CPS factors are
considered including human-CPS interactions as well as physical and topological
characteristics of a CPS such as flow and capacity of interconnections and
minimum path algorithms. Results show that, for the case in which the attacker
is not aware of the CPS interdependencies, the defender can have a higher
payoff, compared to the case in which the attacker has complete information.
The results also show that, in the case of more symmetric nodes, due to
interdependencies, the defender achieves its highest payoff at the equilibrium
compared to the case with independent, asymmetric nodes.
","[{'version': 'v1', 'created': 'Tue, 23 May 2017 14:54:28 GMT'}]",2017-07-18,"[['Ferdowsi', 'Aidin', ''], ['Saad', 'Walid', ''], ['Maham', 'Behrouz', ''], ['Mandayam', 'Narayan B.', '']]","['game theory', 'CPS security', 'CPS optimization']"
3594,1407.6684,V.P. Binu,V.P. Binu and A. Sreekumar,Efficient Multi Secret Sharing with Generalized Access Structures,"arXiv admin note: substantial text overlap with arXiv:1406.5596,
  arXiv:1407.3609","International Journal of Computer Applications , Volume 90 -
  Number 12 Year of Publication: 2014",10.5120/15769-4446,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-secret sharing is an extension of secret sharing technique where
several secrets are shared between the participants, each according to a
specified access structure. The secrets can be reconstructed according to the
access structure by participants using their private shares.Each participant
has to hold a single share, additional information are made available in a
public bulletin board.The scheme is computationally efficient and also each
participant can verify the shares of the other participants and also the
reconstructed secret.The scheme does not need any secure channel also.
","[{'version': 'v1', 'created': 'Thu, 24 Jul 2014 18:40:57 GMT'}]",2014-07-25,"[['Binu', 'V. P.', ''], ['Sreekumar', 'A.', '']]","['access structure', 'dynamic participants', 'cheating detection']"
3595,1810.08016,Mikhail Aliev,"Yulia S. Chernyshova, Mikhail A. Aliev, Ekaterina S. Gushchanskaia and
  Alexander V. Sheshkus","Optical Font Recognition in Smartphone-Captured Images, and its
  Applicability for ID Forgery Detection",,,10.1117/12.2522955,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider the problem of detecting counterfeit identity
documents in images captured with smartphones. As the number of documents
contain special fonts, we study the applicability of convolutional neural
networks (CNNs) for detection of the conformance of the fonts used with the
ones, corresponding to the government standards. Here, we use multi-task
learning to differentiate samples by both fonts and characters and compare the
resulting classifier with its analogue trained for binary font classification.
We train neural networks for authenticity estimation of the fonts used in
machine-readable zones and ID numbers of the Russian national passport and test
them on samples of individual characters acquired from 3238 images of the
Russian national passport. Our results show that the usage of multi-task
learning increases sensitivity and specificity of the classifier. Moreover, the
resulting CNNs demonstrate high generalization ability as they correctly
classify fonts which were not present in the training set. We conclude that the
proposed method is sufficient for authentication of the fonts and can be used
as a part of the forgery detection system for images acquired with a smartphone
camera.
","[{'version': 'v1', 'created': 'Thu, 18 Oct 2018 12:44:05 GMT'}]",2019-03-26,"[['Chernyshova', 'Yulia S.', ''], ['Aliev', 'Mikhail A.', ''], ['Gushchanskaia', 'Ekaterina S.', ''], ['Sheshkus', 'Alexander V.', '']]","['OCR', 'OFR', 'convolutional neural networks', 'train data synthesis', 'forgery detection', 'document']"
3596,1811.01813,Ciriaco Andrea D'Angelo,"Giovanni Abramo, Ciriaco Andrea D'Angelo, Marco Solazzi","Assessing public-private research collaboration: is it possible to
  compare university performance?",,"Scientometrics. 84(1), 173-197 (2010)",10.1007/s11192-009-0104-0,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is widely recognized that collaboration between the public and private
research sectors should be stimulated and supported, as a means of favoring
innovation and regional development. This work takes a bibliometric approach,
based on co-authorship of scientific publications, to propose a model for
comparative measurement of the performance of public research institutions in
collaboration with the domestic industry collaboration with the private sector.
The model relies on an identification and disambiguation algorithm developed by
the authors to link each publication to its real authors. An example of
application of the model is given, for the case of the academic system and
private enterprises in Italy. The study demonstrates that for each scientific
discipline and each national administrative region, it is possible to measure
the performance of individual universities in both intra-regional and
extra-regional collaboration, normalized with respect to advantages of
location. Such results may be useful in informing regional policies and
merit-based public funding of research organizations.
","[{'version': 'v1', 'created': 'Mon, 5 Nov 2018 15:53:11 GMT'}]",2018-11-06,"[['Abramo', 'Giovanni', ''], [""D'Angelo"", 'Ciriaco Andrea', ''], ['Solazzi', 'Marco', '']]","['University–industry research collaboration', 'knowledge spillovers', 'bibliometrics', 'coauthorship', 'Italy']"
3597,1403.7726,Ayman I. Madbouly,"Ayman I. Madbouly, Amr M. Gody, Tamer M. Barakat","Relevant Feature Selection Model Using Data Mining for Intrusion
  Detection System","12 Pages, 3 figures, 5 tables, Published with ""International Journal
  of Engineering Trends and Technology (IJETT)"". arXiv admin note: text overlap
  with arXiv:1208.5997 by other authors without attribution","International Journal of Engineering Trends and Technology
  (IJETT), V9(10),501-512 March 2014",10.14445/22315381/IJETT-V9P296,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network intrusions have become a significant threat in recent years as a
result of the increased demand of computer networks for critical systems.
Intrusion detection system (IDS) has been widely deployed as a defense measure
for computer networks. Features extracted from network traffic can be used as
sign to detect anomalies. However with the huge amount of network traffic,
collected data contains irrelevant and redundant features that affect the
detection rate of the IDS, consumes high amount of system resources, and
slowdown the training and testing process of the IDS. In this paper, a new
feature selection model is proposed; this model can effectively select the most
relevant features for intrusion detection. Our goal is to build a lightweight
intrusion detection system by using a reduced features set. Deleting irrelevant
and redundant features helps to build a faster training and testing process, to
have less resource consumption as well as to maintain high detection rates. The
effectiveness and the feasibility of our feature selection model were verified
by several experiments on KDD intrusion detection dataset. The experimental
results strongly showed that our model is not only able to yield high detection
rates but also to speed up the detection process.
","[{'version': 'v1', 'created': 'Sun, 30 Mar 2014 09:41:17 GMT'}]",2014-04-01,"[['Madbouly', 'Ayman I.', ''], ['Gody', 'Amr M.', ''], ['Barakat', 'Tamer M.', '']]","['Intrusion detection system', 'traffic classification', 'network security', 'supervised learning', 'feature selection', 'data mining']"
3598,1312.2730,Aur\'elie Lagoutte,"Aur\'elie Lagoutte, Th\'eophile Trunck","Clique-Stable Set separation in perfect graphs with no balanced
  skew-partitions",arXiv admin note: text overlap with arXiv:1308.6444,"Discrete Mathematics, 339(6):1809-1825, 2016",10.1016/j.disc.2016.02.005,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Inspired by a question of Yannakakis on the Vertex Packing polytope of
perfect graphs, we study the Clique-Stable Set Separation in a non-hereditary
subclass of perfect graphs. A cut (B,W) of G (a bipartition of V(G)) separates
a clique K and a stable set S if $K\subseteq B$ and $S\subseteq W$. A
Clique-Stable Set Separator is a family of cuts such that for every clique K,
and for every stable set S disjoint from K, there exists a cut in the family
that separates K and S. Given a class of graphs, the question is to know
whether every graph of the class admits a Clique-Stable Set Separator
containing only polynomially many cuts. It is open for the class of all graphs,
and also for perfect graphs, which was Yannakakis' original question. Here we
investigate on perfect graphs with no balanced skew-partition; the balanced
skew-partition was introduced in the proof of the Strong Perfect Graph Theorem.
Recently, Chudnovsky, Trotignon, Trunck and Vuskovic proved that forbidding
this unfriendly decomposition permits to recursively decompose Berge graphs
using 2-join and complement 2-join until reaching a basic graph, and they found
an efficient combinatorial algorithm to color those graphs. We apply their
decomposition result to prove that perfect graphs with no balanced
skew-partition admit a quadratic-size Clique-Stable Set Separator, by taking
advantage of the good behavior of 2-join with respect to this property. We then
generalize this result and prove that the Strong Erdos-Hajnal property holds in
this class, which means that every such graph has a linear-size biclique or
complement biclique. This property does not hold for all perfect graphs (Fox
2006), and moreover when the Strong Erdos-Hajnal property holds in a hereditary
class of graphs, then both the Erdos-Hajnal property and the polynomial
Clique-Stable Set Separation hold.
","[{'version': 'v1', 'created': 'Tue, 10 Dec 2013 09:52:10 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Jun 2015 10:41:34 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Feb 2016 09:55:45 GMT'}]",2017-04-17,"[['Lagoutte', 'Aurélie', ''], ['Trunck', 'Théophile', '']]","['Clique-Stable Set separation', 'perfect graph', 'trigraph', '2-join']"
3599,1706.07979,Gr\'egoire Montavon,"Gr\'egoire Montavon, Wojciech Samek, Klaus-Robert M\""uller",Methods for Interpreting and Understanding Deep Neural Networks,"14 pages, 10 figures",,10.1016/j.dsp.2017.10.011,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper provides an entry point to the problem of interpreting a deep
neural network model and explaining its predictions. It is based on a tutorial
given at ICASSP 2017. It introduces some recently proposed techniques of
interpretation, along with theory, tricks and recommendations, to make most
efficient use of these techniques on real data. It also discusses a number of
practical applications.
","[{'version': 'v1', 'created': 'Sat, 24 Jun 2017 16:25:06 GMT'}]",2017-11-15,"[['Montavon', 'Grégoire', ''], ['Samek', 'Wojciech', ''], ['Müller', 'Klaus-Robert', '']]","['deep neural networks', 'activation maximization', 'sensitivity analysis', 'Taylor decomposition', 'layer-wiserelevance propagation']"
3600,1301.3999,Deepali Virmani,"Deepali Virmani, Satbir Jain","Stable Routing for achieving Quality of Service in wireless Sensor
  Networks","7 pages,6 figures; IJCA Special Issue on MANETs, 2010",,10.5120/1010-47,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Networking in Wireless Sensor networks is a challenging task due to the lack
of resources in the network as well as the frequent changes in network
topology. Although lots of research has been done on supporting QoS in the
Internet and other networks, but they are not suitable for wireless sensor
networks and still QoS support for such networks remains an open problem. In
this paper, a new scheme has been proposed for achieving QoS in terms of packet
delivery, multiple connections, better power management and stable routes in
case of failure. It offers quick adaptation to distributed processing, dynamic
linking, low processing overhead and loop freedom at all times. The proposed
scheme has been incorporated using QDPRA protocol and by extensive simulation
the performance has been studied, and it is clearly shown that the proposed
scheme performs very well for different network scenarios.
","[{'version': 'v1', 'created': 'Thu, 17 Jan 2013 07:28:15 GMT'}]",2013-01-18,"[['Virmani', 'Deepali', ''], ['Jain', 'Satbir', '']]","['Wireless Sensor Networks', 'Virtual Nodes', 'Self Stabilization', 'Power aware']"
3601,1907.10469,Bernardo Cuteri,"Bernardo Cuteri, Carmine Dodaro, Francesco Ricca, Peter Sch\""uller",Partial Compilation of ASP Programs,"Paper presented at the 35th International Conference on Logic
  Programming (ICLP 2019), Las Cruces, New Mexico, USA, 20-25 September 2019,
  16 pages, 6 figures",Theory and Practice of Logic Programming 19 (2019) 857-873,10.1017/S1471068419000231,,cs.LO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Answer Set Programming (ASP) is a well-known declarative formalism in logic
programming. Efficient implementations made it possible to apply ASP in many
scenarios, ranging from deductive databases applications to the solution of
hard combinatorial problems. State-of-the-art ASP systems are based on the
traditional ground\&solve approach and are general-purpose implementations,
i.e., they are essentially built once for any kind of input program. In this
paper, we propose an extended architecture for ASP systems, in which parts of
the input program are compiled into an ad-hoc evaluation algorithm (i.e., we
obtain a specific binary for a given program), and might not be subject to the
grounding step. To this end, we identify a condition that allows the
compilation of a sub-program, and present the related partial compilation
technique. Importantly, we have implemented the new approach on top of a
well-known ASP solver and conducted an experimental analysis on
publicly-available benchmarks. Results show that our compilation-based approach
improves on the state of the art in various scenarios, including cases in which
the input program is stratified or the grounding blow-up makes the evaluation
unpractical with traditional ASP systems.
","[{'version': 'v1', 'created': 'Wed, 24 Jul 2019 14:42:57 GMT'}]",2020-02-19,"[['Cuteri', 'Bernardo', ''], ['Dodaro', 'Carmine', ''], ['Ricca', 'Francesco', ''], ['Schüller', 'Peter', '']]","['Answer set programming', 'Grounding bottleneck', 'Compilation']"
3602,1907.10208,Liang Zhou,"Liang Zhou, Rudolf Netzel, Daniel Weiskopf, Chris Johnson",Spectral Visualization Sharpening,Symposium of Applied Perception'19,,10.1145/3343036.3343133,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a perceptually-guided visualization sharpening
technique. We analyze the spectral behavior of an established comprehensive
perceptual model to arrive at our approximated model based on an adapted
weighting of the bandpass images from a Gaussian pyramid. The main benefit of
this approximated model is its controllability and predictability for
sharpening color-mapped visualizations. Our method can be integrated into any
visualization tool as it adopts generic image-based post-processing, and it is
intuitive and easy to use as viewing distance is the only parameter. Using
highly diverse datasets, we show the usefulness of our method across a wide
range of typical visualizations.
","[{'version': 'v1', 'created': 'Wed, 24 Jul 2019 02:24:57 GMT'}]",2019-07-25,"[['Zhou', 'Liang', ''], ['Netzel', 'Rudolf', ''], ['Weiskopf', 'Daniel', ''], ['Johnson', 'Chris', '']]","['Visualization', 'perception', 'contrast', 'color']"
3603,1805.08554,Holger Dell,"Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof","More Consequences of Falsifying SETH and the Orthogonal Vectors
  Conjecture",To appear in the proceedings of STOC'18,,10.1145/3188745.3188938,,cs.CC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Strong Exponential Time Hypothesis and the OV-conjecture are two popular
hardness assumptions used to prove a plethora of lower bounds, especially in
the realm of polynomial-time algorithms. The OV-conjecture in moderate
dimension states there is no $\epsilon>0$ for which an
$O(N^{2-\epsilon})\mathrm{poly}(D)$ time algorithm can decide whether there is
a pair of orthogonal vectors in a given set of size $N$ that contains
$D$-dimensional binary vectors.
  We strengthen the evidence for these hardness assumptions. In particular, we
show that if the OV-conjecture fails, then two problems for which we are far
from obtaining even tiny improvements over exhaustive search would have
surprisingly fast algorithms. If the OV conjecture is false, then there is a
fixed $\epsilon>0$ such that:
  (1) For all $d$ and all large enough $k$, there is a randomized algorithm
that takes $O(n^{(1-\epsilon)k})$ time to solve the Zero-Weight-$k$-Clique and
Min-Weight-$k$-Clique problems on $d$-hypergraphs with $n$ vertices. As a
consequence, the OV-conjecture is implied by the Weighted Clique conjecture.
  (2) For all $c$, the satisfiability of sparse TC1 circuits on $n$ inputs
(that is, circuits with $cn$ wires, depth $c\log n$, and negation, AND, OR, and
threshold gates) can be computed in time ${O((2-\epsilon)^n)}$.
","[{'version': 'v1', 'created': 'Tue, 22 May 2018 12:53:08 GMT'}]",2018-05-23,"[['Abboud', 'Amir', ''], ['Bringmann', 'Karl', ''], ['Dell', 'Holger', ''], ['Nederlof', 'Jesper', '']]","['fine-grained complexity', 'OV', 'clique', 'satisfiability', 'threshold circuits']"
3604,1504.01782,Abbas Kiani,Abbas Kiani and Nirwan Ansari,Profit Maximization for Geographical Dispersed Green Data Centers,,"IEEE Transactions on Smart Grid, 2016",10.1109/TSG.2016.2562565,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper aims at maximizing the profit associated with running
geographically dispersed green data centers, which offer multiple classes of
service. To this end, we formulate an optimization framework which relies on
the accuracy of the G/D/1 queue in characterizing the workload distribution,
and taps on the merits of the workload decomposition into green and brown
workload served by green and brown energy resources. Moreover, we take into
account of not only the Service Level Agreements (SLAs) between the data
centers and clients but also different deregulated electricity markets of data
centers located at different regions. We prove the convexity of our
optimization problem and the performance of the proposed workload distribution
strategy is evaluated via simulations.
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2015 23:39:59 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Aug 2015 00:05:21 GMT'}, {'version': 'v3', 'created': 'Wed, 25 Nov 2015 20:21:43 GMT'}]",2018-02-07,"[['Kiani', 'Abbas', ''], ['Ansari', 'Nirwan', '']]","['Data centers', 'Cost of Electricity', 'Green energy']"
3605,1201.4522,Rajkumar Buyya,"Rajkumar Buyya, Saurabh Kumar Garg, and Rodrigo N. Calheiros","SLA-Oriented Resource Provisioning for Cloud Computing: Challenges,
  Architecture, and Solutions","10 pages, 7 figures, Conference Keynote Paper: 2011 IEEE
  International Conference on Cloud and Service Computing (CSC 2011, IEEE
  Press, USA), Hong Kong, China, December 12-14, 2011","Proceedings of the 2011 IEEE International Conference on Cloud and
  Service Computing (CSC 2011, IEEE Press, USA), Hong Kong, China, December
  12-14, 2011",10.1109/CSC.2011.6138522,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing systems promise to offer subscription-oriented,
enterprise-quality computing services to users worldwide. With the increased
demand for delivering services to a large number of users, they need to offer
differentiated services to users and meet their quality expectations. Existing
resource management systems in data centers are yet to support Service Level
Agreement (SLA)-oriented resource allocation, and thus need to be enhanced to
realize cloud computing and utility computing. In addition, no work has been
done to collectively incorporate customer-driven service management,
computational risk management, and autonomic resource management into a
market-based resource management system to target the rapidly changing
enterprise requirements of Cloud computing. This paper presents vision,
challenges, and architectural elements of SLA-oriented resource management. The
proposed architecture supports integration of marketbased provisioning policies
and virtualisation technologies for flexible allocation of resources to
applications. The performance results obtained from our working prototype
system shows the feasibility and effectiveness of SLA-based resource
provisioning in Clouds.
","[{'version': 'v1', 'created': 'Sun, 22 Jan 2012 01:41:04 GMT'}]",2016-11-18,"[['Buyya', 'Rajkumar', ''], ['Garg', 'Saurabh Kumar', ''], ['Calheiros', 'Rodrigo N.', '']]","['Cloud Computing', 'Data Centers', 'Service Level Agreements', 'Resource Provisioning', 'Autonomic Management']"
3606,1304.3841,Ramon Ferrer i Cancho,Ramon Ferrer-i-Cancho and Haitao Liu,"The risks of mixing dependency lengths from sequences of different
  length","Laguage and referencing has been improved; Eqs. 7, 11, B7 and B8 have
  been corrected","Glottotheory 5 (2), 143-155 (2014)",10.1515/glot-2014-0014,,cs.CL physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mixing dependency lengths from sequences of different length is a common
practice in language research. However, the empirical distribution of
dependency lengths of sentences of the same length differs from that of
sentences of varying length and the distribution of dependency lengths depends
on sentence length for real sentences and also under the null hypothesis that
dependencies connect vertices located in random positions of the sequence. This
suggests that certain results, such as the distribution of syntactic dependency
lengths mixing dependencies from sentences of varying length, could be a mere
consequence of that mixing. Furthermore, differences in the global averages of
dependency length (mixing lengths from sentences of varying length) for two
different languages do not simply imply a priori that one language optimizes
dependency lengths better than the other because those differences could be due
to differences in the distribution of sentence lengths and other factors.
","[{'version': 'v1', 'created': 'Sat, 13 Apr 2013 20:19:50 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Sep 2014 10:24:00 GMT'}]",2014-12-03,"[['Ferrer-i-Cancho', 'Ramon', ''], ['Liu', 'Haitao', '']]","['syntactic dependency', 'syntax', 'dependency length']"
3607,2102.12505,Utako Yamamoto,"Utako Yamamoto, Megumi Nakao, Masayuki Ohzeki, Junko Tokuno, Toyofumi
  Fengshi Chen-Yoshikawa, and Tetsuya Matsuda","Kernel-based framework to estimate deformations of pneumothorax lung
  using relative position of anatomical landmarks","10 pages, 6 figures","Expert Systems with Applications, 183(2021), 115288",10.1016/j.eswa.2021.115288,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In video-assisted thoracoscopic surgeries, successful procedures of nodule
resection are highly dependent on the precise estimation of lung deformation
between the inflated lung in the computed tomography (CT) images during
preoperative planning and the deflated lung in the treatment views during
surgery. Lungs in the pneumothorax state during surgery have a large volume
change from normal lungs, making it difficult to build a mechanical model. The
purpose of this study is to develop a deformation estimation method of the 3D
surface of a deflated lung from a few partial observations. To estimate
deformations for a largely deformed lung, a kernel regression-based solution
was introduced. The proposed method used a few landmarks to capture the partial
deformation between the 3D surface mesh obtained from preoperative CT and the
intraoperative anatomical positions. The deformation for each vertex of the
entire mesh model was estimated per-vertex as a relative position from the
landmarks. The landmarks were placed in the anatomical position of the lung's
outer contour. The method was applied on nine datasets of the left lungs of
live Beagle dogs. Contrast-enhanced CT images of the lungs were acquired. The
proposed method achieved a local positional error of vertices of 2.74 mm,
Hausdorff distance of 6.11 mm, and Dice similarity coefficient of 0.94.
Moreover, the proposed method could estimate lung deformations from a small
number of training cases and a small observation area. This study contributes
to the data-driven modeling of pneumothorax deformation of the lung.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2021 19:00:17 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Aug 2021 17:11:55 GMT'}]",2021-08-20,"[['Yamamoto', 'Utako', ''], ['Nakao', 'Megumi', ''], ['Ohzeki', 'Masayuki', ''], ['Tokuno', 'Junko', ''], ['Chen-Yoshikawa', 'Toyofumi Fengshi', ''], ['Matsuda', 'Tetsuya', '']]","['deformation estimation', 'kernel regression', 'lung surgery', 'medical imaging', 'pneumothorax']"
3608,1901.10050,Emilia Ciupan,"Emilia Ciupan, Mihai Ciupan, Daniela-Corina Jucan","Determining the Mechanical Properties of a New Composite Material Using
  Artificial Neural Networks","6 pages, 4 figures, Published with International Journal of
  Engineering Trends and Technology (IJETT)","International Journal of Engineering Trends and Technology 66.2
  (2018): 103-108",10.14445/22315381/IJETT-V66P218,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper studies the possibility of using artificial neural networks (ANN)
to determine certain mechanical properties of a new composite material. This
new material is obtained by a mixture of hemp and polypropylene fibres. The
material was developed for the industry of upholstered furniture. Specifically,
it is intended for the making of elements of the support structure of some
upholstered goods (chairs, armchairs, sofa sides) with the objective of
replacing wood. The paper aims to calculate the following mechanical
properties: maximum tensile strength and maximum elongation.
","[{'version': 'v1', 'created': 'Fri, 11 Jan 2019 17:34:30 GMT'}]",2019-01-30,"[['Ciupan', 'Emilia', ''], ['Ciupan', 'Mihai', ''], ['Jucan', 'Daniela-Corina', '']]","['ANN', 'Mechanical properties', 'Composite material', 'Hemp']"
3609,1809.02052,Maurizio Ferrari Dacrema,Maurizio Ferrari Dacrema and Paolo Cremonesi,"Eigenvalue analogy for confidence estimation in item-based recommender
  systems",,"Proceedings of the Late-Breaking Results track part of the Twelfth
  ACM Conference on Recommender Systems (RecSys 2018)",,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Item-item collaborative filtering (CF) models are a well known and studied
family of recommender systems, however current literature does not provide any
theoretical explanation of the conditions under which item-based
recommendations will succeed or fail.
  We investigate the existence of an ideal item-based CF method able to make
perfect recommendations. This CF model is formalized as an eigenvalue problem,
where estimated ratings are equivalent to the true (unknown) ratings multiplied
by a user-specific eigenvalue of the similarity matrix. Preliminary experiments
show that the magnitude of the eigenvalue is proportional to the accuracy of
recommendations for that user and therefore it can provide reliable measure of
confidence.
","[{'version': 'v1', 'created': 'Fri, 31 Aug 2018 10:22:19 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Oct 2018 21:23:03 GMT'}]",2019-07-16,"[['Dacrema', 'Maurizio Ferrari', ''], ['Cremonesi', 'Paolo', '']]","['Recommender confidence', 'Inverse eigenvalue', 'Item-based CF']"
3610,2005.12607,Markus Borg,"Markus Borg, Joakim Wernberg, Thomas Olsson, Ulrik Franke, Martin
  Andersson","Illuminating a Blind Spot in Digitalization -- Software Development in
  Sweden's Private and Public Sector",,"In Proc. of the 1st International Workshop on Governance in
  Software Engineering (IEEE/ACM 42nd International Conference on Software
  Engineering Workshops (ICSEW'20), May 23-29, 2020, Seoul, Republic of Korea)",,,cs.CY cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As Netscape co-founder Marc Andreessen famously remarked in 2011, software is
eating the world - becoming a pervasive invisible critical infrastructure. Data
on the distribution of software use and development in society is scarce, but
we compile results from two novel surveys to provide a fuller picture of the
role software plays in the public and private sectors in Sweden, respectively.
Three out of ten Swedish firms, across industry sectors, develop software
in-house. The corresponding figure for Sweden's government agencies is four out
of ten, i.e., the public sector should not be underestimated. The
digitalization of society will continue, thus the demand for software
developers will further increase. Many private firms report that the limited
supply of software developers in Sweden is directly affecting their expansion
plans. Based on our findings, we outline directions that need additional
research to allow evidence-informed policy-making. We argue that such work
should ideally be conducted by academic researchers and national statistics
agencies in collaboration.
","[{'version': 'v1', 'created': 'Tue, 26 May 2020 09:55:19 GMT'}]",2020-05-27,"[['Borg', 'Markus', ''], ['Wernberg', 'Joakim', ''], ['Olsson', 'Thomas', ''], ['Franke', 'Ulrik', ''], ['Andersson', 'Martin', '']]","['software business', 'public sector', 'survey', 'policy-making']"
3611,1102.1497,Kazushi Mimura,"Kazushi Mimura, Florent Cousseau, Masato Okada","Belief Propagation for Error Correcting Codes and Lossy Compression
  Using Multilayer Perceptrons","18 pages, 18 figures","J. Phys. Soc. Jpn., 80, 3, 034802 (2011)",10.1143/JPSJ.80.034802,,cs.IT math.IT physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The belief propagation (BP) based algorithm is investigated as a potential
decoder for both of error correcting codes and lossy compression, which are
based on non-monotonic tree-like multilayer perceptron encoders. We discuss
that whether the BP can give practical algorithms or not in these schemes. The
BP implementations in those kind of fully connected networks unfortunately
shows strong limitation, while the theoretical results seems a bit promising.
Instead, it reveals it might have a rich and complex structure of the solution
space via the BP-based algorithms.
","[{'version': 'v1', 'created': 'Tue, 8 Feb 2011 03:49:56 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Mar 2011 10:53:52 GMT'}]",2015-03-18,"[['Mimura', 'Kazushi', ''], ['Cousseau', 'Florent', ''], ['Okada', 'Masato', '']]","['belief propagation', 'lossy compression', 'error correcting code', 'committee machine', 'paritymachine', 'replica method', 'statistical mechanics']"
3612,2204.09036,Oleg Sychev,Oleg Sychev,"Write a Line: Tests with Answer Templates and String Completion Hints
  for Self-Learning in a CS1 Course","9 pages, 5 tables, 3 figures, ICSE-SEET 2022","Proceedings - 44th ACM/IEEE International Conference on Software
  Engineering: Software Engineering Education and Training, ICSE-SEET 2022.
  Pages 265 - 276",10.1109/ICSE-SEET55299.2022.9794157,,cs.CY,http://creativecommons.org/licenses/by-sa/4.0/,"  One of the important scaffolding tasks in programming learning is writing a
line of code performing the necessary action. This allows students to practice
skills in a playground with instant feedback before writing more complex
programs and increases their proficiency when solving programming problems.
However, answers in the form of program code have high variability. Among the
possible approaches to grading and providing feedback, we chose template
matching. This paper reports the results of using regular-expression-based
questions with string completion hints in a CS1 course for 4 years with 497
students. The evaluation results show that Perl-compatible regular expressions
provide good precision and recall (more than 99\%) when used for questions
requiring writing a single line of code while being able to provide
string-completion feedback regardless of how wrong the initial student's answer
is. After introducing formative quizzes with string-completion hints to the
course, the number of questions that teachers and teaching assistants received
about questions in the formative quizzes dropped considerably: most of the
training question attempts resulted in finding the correct answer without help
from the teaching staff. However, some of the students use formative quizzes
just to learn correct answers without actually trying to answer the questions.
","[{'version': 'v1', 'created': 'Tue, 19 Apr 2022 17:53:35 GMT'}]",2022-08-11,"[['Sychev', 'Oleg', '']]","['regular expressions', 'short-answer questions', 'feedback generation', 'online learning', 'introductory programming courses']"
3613,1404.3026,Todd Bodnar,"Todd Bodnar, Victoria C Barclay, Nilam Ram, Conrad S Tucker, Marcel
  Salath\'e","On the Ground Validation of Online Diagnosis with Twitter and Medical
  Records","Presented at of WWW2014. WWW'14 Companion, April 7-11, 2014, Seoul,
  Korea",,10.1145/2567948.2579272,,cs.SI cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media has been considered as a data source for tracking disease.
However, most analyses are based on models that prioritize strong correlation
with population-level disease rates over determining whether or not specific
individual users are actually sick. Taking a different approach, we develop a
novel system for social-media based disease detection at the individual level
using a sample of professionally diagnosed individuals. Specifically, we
develop a system for making an accurate influenza diagnosis based on an
individual's publicly available Twitter data. We find that about half (17/35 =
48.57%) of the users in our sample that were sick explicitly discuss their
disease on Twitter. By developing a meta classifier that combines text
analysis, anomaly detection, and social network analysis, we are able to
diagnose an individual with greater than 99% accuracy even if she does not
discuss her health.
","[{'version': 'v1', 'created': 'Fri, 11 Apr 2014 07:55:51 GMT'}]",2014-04-14,"[['Bodnar', 'Todd', ''], ['Barclay', 'Victoria C', ''], ['Ram', 'Nilam', ''], ['Tucker', 'Conrad S', ''], ['Salathé', 'Marcel', '']]","['Twitter', 'Validation', 'Digital Epidemiology', 'Remote Diagnosis']"
3614,1802.06517,Ahmed Attia,"Ahmed Attia, Alen Alexanderian, Arvind K. Saibaba","Goal-Oriented Optimal Design of Experiments for Large-Scale Bayesian
  Linear Inverse Problems","25 pages, 13 figures",,10.1088/1361-6420/aad210,,cs.CE math.NA math.OC stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop a framework for goal-oriented optimal design of experiments
(GOODE) for large-scale Bayesian linear inverse problems governed by PDEs. This
framework differs from classical Bayesian optimal design of experiments (ODE)
in the following sense: we seek experimental designs that minimize the
posterior uncertainty in the experiment end-goal, e.g., a quantity of interest
(QoI), rather than the estimated parameter itself. This is suitable for
scenarios in which the solution of an inverse problem is an intermediate step
and the estimated parameter is then used to compute a QoI. In such problems, a
GOODE approach has two benefits: the designs can avoid wastage of experimental
resources by a targeted collection of data, and the resulting design criteria
are computationally easier to evaluate due to the often low-dimensionality of
the QoIs. We present two modified design criteria, A-GOODE and D-GOODE, which
are natural analogues of classical Bayesian A- and D-optimal criteria. We
analyze the connections to other ODE criteria, and provide interpretations for
the GOODE criteria by using tools from information theory. Then, we develop an
efficient gradient-based optimization framework for solving the GOODE
optimization problems. Additionally, we present comprehensive numerical
experiments testing the various aspects of the presented approach. The driving
application is the optimal placement of sensors to identify the source of
contaminants in a diffusion and transport problem. We enforce sparsity of the
sensor placements using an $\ell_1$-norm penalty approach, and propose a
practical strategy for specifying the associated penalty parameter.
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 04:56:59 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Jun 2018 04:40:55 GMT'}]",2018-08-15,"[['Attia', 'Ahmed', ''], ['Alexanderian', 'Alen', ''], ['Saibaba', 'Arvind K.', '']]","['Design of Experiments', 'Inverse Problems', 'Sensor placement']"
3615,1712.08285,Emanuel Onica,"Ciprian Amariei, Paul Diac, Emanuel Onica","Grand Challenge: Optimized Stage Processing for Anomaly Detection on
  Numerical Data Streams",,"DEBS 2017, Proceedings of the 11th ACM International Conference on
  Distributed and Event-based Systems, Pages 286-291",10.1145/3093742.3095101,,cs.PF cs.DS cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The 2017 Grand Challenge focused on the problem of automatic detection of
anomalies for manufacturing equipment. This paper reports the technical details
of a solution focused on particular optimizations of the processing stages.
These included customized input parsing, fine tuning of a k-means clustering
algorithm and probability analysis using a lazy flavor of a Markov chain. We
have observed in our custom implementation that carefully tweaking these
processing stages at single node level by leveraging various data stream
characteristics can yield good performance results. We start the paper with
several observations concerning the input data stream, following with our
solution description with details on particular optimizations, and we conclude
with evaluation and a discussion of obtained results.
","[{'version': 'v1', 'created': 'Fri, 22 Dec 2017 02:31:16 GMT'}]",2017-12-25,"[['Amariei', 'Ciprian', ''], ['Diac', 'Paul', ''], ['Onica', 'Emanuel', '']]","['data stream processing', 'algorithm optimization', 'event based systems']"
3616,1809.02351,Lucas Gren,"Lucas Gren, Alessia Knauss and Christoph Johann Stettina","Non-Technical Individual Skills are Weakly Connected to the Maturity of
  Agile Practices","18 pages, 1 figure","Information and Software Technology, 99, Pages 11-20. 2018",10.1016/j.infsof.2018.02.006,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Existing knowledge in agile software development suggests that
individual competency (e.g. skills) is a critical success factor for agile
projects. While assuming that technical skills are important for every kind of
software development project, many researchers suggest that non-technical
individual skills are especially important in agile software development.
Objective: In this paper, we investigate whether non-technical individual
skills can predict the use of agile practices. Method: Through creating a set
of multiple linear regression models using a total of 113 participants from
agile teams in six software development organizations from The Netherlands and
Brazil, we analyzed the predictive power of non-technical individual skills in
relation to agile practices. Results: The results show that there is
surprisingly low power in using non-technical individual skills to predict
(i.e. explain variance in) the mature use of agile practices in software
development. Conclusions: Therefore, we conclude that looking at non-technical
individual skills is not the optimal level of analysis when trying to
understand, and explain, the mature use of agile practices in the software
development context. We argue that it is more important to focus on the
non-technical skills as a team-level capacity instead of assuring that all
individuals possess such skills when understanding the use of the agile
practices.
","[{'version': 'v1', 'created': 'Fri, 7 Sep 2018 08:35:54 GMT'}]",2018-09-10,"[['Gren', 'Lucas', ''], ['Knauss', 'Alessia', ''], ['Stettina', 'Christoph Johann', '']]","['skills', 'agile practices', 'code quality', 'empirical study']"
3617,1501.06419,Diego Mirandola,Diego Mirandola and Gilles Z\'emor,Critical pairs for the Product Singleton Bound,,"Information Theory, IEEE Transactions on (Volume:61 , Issue: 9 ),
  2015",10.1109/TIT.2015.2450207,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We characterize Product-MDS pairs of linear codes, i.e.\ pairs of codes $C,D$
whose product under coordinatewise multiplication has maximum possible minimum
distance as a function of the code length and the dimensions $\dim C, \dim D$.
We prove in particular, for $C=D$, that if the square of the code $C$ has
minimum distance at least $2$, and $(C,C)$ is a Product-MDS pair, then either
$C$ is a generalized Reed-Solomon code, or $C$ is a direct sum of self-dual
codes. In passing we establish coding-theory analogues of classical theorems of
additive combinatorics.
","[{'version': 'v1', 'created': 'Mon, 26 Jan 2015 14:48:04 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Aug 2015 10:09:01 GMT'}]",2015-08-21,"[['Mirandola', 'Diego', ''], ['Zémor', 'Gilles', '']]","['Error-correcting codes', 'Schur-product codes', 'Product Singleton Bound']"
3618,1305.0379,Nader Ale Ebrahim,"Masood Fooladi, Hadi Salehi, Melor Md Yunus, Maryam Farhadi, Arezoo
  Aghaei Chadegani, Hadi Farhadi and Nader Ale Ebrahim",Does Criticisms Overcome the Praises of Journal Impact Factor?,"7 pages, No figure","Asian Social Science vol. 9, no. 5, pp. 176-182, April 27, 2013",10.5539/ass.v9n5p176,,cs.DL,http://creativecommons.org/licenses/by/3.0/,"  Journal impact factor (IF) as a gauge of influence and impact of a particular
journal comparing with other journals in the same area of research, reports the
mean number of citations to the published articles in particular journal.
Although, IF attracts more attention and being used more frequently than other
measures, it has been subjected to criticisms, which overcome the advantages of
IF. Critically, extensive use of IF may result in destroying editorial and
researchers behaviour, which could compromise the quality of scientific
articles. Therefore, it is the time of the timeliness and importance of a new
invention of journal ranking techniques beyond the journal impact factor.
","[{'version': 'v1', 'created': 'Thu, 2 May 2013 09:27:11 GMT'}]",2013-05-03,"[['Fooladi', 'Masood', ''], ['Salehi', 'Hadi', ''], ['Yunus', 'Melor Md', ''], ['Farhadi', 'Maryam', ''], ['Chadegani', 'Arezoo Aghaei', ''], ['Farhadi', 'Hadi', ''], ['Ebrahim', 'Nader Ale', '']]","['impact factor (IF)', 'journal ranking', 'criticism', 'praise', 'scopus', 'web of science', 'self-citation']"
3619,1208.3691,Usman Khan,Mohammadreza Doostmohammadian and Usman A. Khan,"On the genericity properties in networked estimation: Topology design
  and sensor placement",submitted for IEEE journal publication,"M. Doostmohammadian and U. A. Khan, ""On the genericity properties
  in distributed estimation: Topology design and sensor placement,"" in IEEE
  JSTSP--Adaptation and Learning over Complex Networks, vol. 7, no. 2, pp.
  195-204, Apr. 2013",10.1109/JSTSP.2013.2246135,,cs.MA cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider networked estimation of linear, discrete-time
dynamical systems monitored by a network of agents. In order to minimize the
power requirement at the (possibly, battery-operated) agents, we require that
the agents can exchange information with their neighbors only \emph{once per
dynamical system time-step}; in contrast to consensus-based estimation where
the agents exchange information until they reach a consensus. It can be
verified that with this restriction on information exchange, measurement fusion
alone results in an unbounded estimation error at every such agent that does
not have an observable set of measurements in its neighborhood. To over come
this challenge, state-estimate fusion has been proposed to recover the system
observability. However, we show that adding state-estimate fusion may not
recover observability when the system matrix is structured-rank ($S$-rank)
deficient.
  In this context, we characterize the state-estimate fusion and measurement
fusion under both full $S$-rank and $S$-rank deficient system matrices.
","[{'version': 'v1', 'created': 'Fri, 17 Aug 2012 21:10:56 GMT'}]",2015-03-13,"[['Doostmohammadian', 'Mohammadreza', ''], ['Khan', 'Usman A.', '']]","['Networked estimation', 'Observability', 'Structured system theory', 'Generic rank']"
3620,cs/0609026,Arnaud Legout,"Arnaud Legout (INRIA Sophia Antipolis / INRIA Rh\^one-Alpes),
  Guillaume Urvoy-Keller (EURECOM), Pietro Michiardi (EURECOM)",Rarest First and Choke Algorithms Are Enough,,Dans ACM SIGCOMM/USENIX IMC'2006,,,cs.NI,,"  The performance of peer-to-peer file replication comes from its piece and
peer selection strategies. Two such strategies have been introduced by the
BitTorrent protocol: the rarest first and choke algorithms. Whereas it is
commonly admitted that BitTorrent performs well, recent studies have proposed
the replacement of the rarest first and choke algorithms in order to improve
efficiency and fairness. In this paper, we use results from real experiments to
advocate that the replacement of the rarest first and choke algorithms cannot
be justified in the context of peer-to-peer file replication in the Internet.
We instrumented a BitTorrent client and ran experiments on real torrents with
different characteristics. Our experimental evaluation is peer oriented,
instead of tracker oriented, which allows us to get detailed information on all
exchanged messages and protocol events. We go beyond the mere observation of
the good efficiency of both algorithms. We show that the rarest first algorithm
guarantees close to ideal diversity of the pieces among peers. In particular,
on our experiments, replacing the rarest first algorithm with source or network
coding solutions cannot be justified. We also show that the choke algorithm in
its latest version fosters reciprocation and is robust to free riders. In
particular, the choke algorithm is fair and its replacement with a bit level
tit-for-tat solution is not appropriate. Finally, we identify new areas of
improvements for efficient peer-to-peer file replication protocols.
","[{'version': 'v1', 'created': 'Wed, 6 Sep 2006 19:44:35 GMT'}]",2016-08-16,"[['Legout', 'Arnaud', '', 'INRIA Sophia Antipolis / INRIA Rhône-Alpes'], ['Urvoy-Keller', 'Guillaume', '', 'EURECOM'], ['Michiardi', 'Pietro', '', 'EURECOM']]","['BitTorrent', 'choke algorithm', 'rarest first algorithm', 'peer-to-peer']"
3621,1807.02562,Stefano Markidis Prof.,"Steven Wei-der Chien and Stefano Markidis and Rami Karim and Erwin
  Laure and Sai Narasimhamurthy","Exploring Scientific Application Performance Using Large Scale Object
  Storage",Preprint submitted to WOPSSS workshop at ISC 2018,,10.1007/978-3-030-02465-9_8,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the major performance and scalability bottlenecks in large scientific
applications is parallel reading and writing to supercomputer I/O systems. The
usage of parallel file systems and consistency requirements of POSIX, that all
the traditional HPC parallel I/O interfaces adhere to, pose limitations to the
scalability of scientific applications. Object storage is a widely used storage
technology in cloud computing and is more frequently proposed for HPC workload
to address and improve the current scalability and performance of I/O in
scientific applications. While object storage is a promising technology, it is
still unclear how scientific applications will use object storage and what the
main performance benefits will be. This work addresses these questions, by
emulating an object storage used by a traditional scientific application and
evaluating potential performance benefits. We show that scientific applications
can benefit from the usage of object storage on large scales.
","[{'version': 'v1', 'created': 'Fri, 6 Jul 2018 20:49:18 GMT'}]",2019-01-30,"[['Chien', 'Steven Wei-der', ''], ['Markidis', 'Stefano', ''], ['Karim', 'Rami', ''], ['Laure', 'Erwin', ''], ['Narasimhamurthy', 'Sai', '']]","['Scientific Applications', 'Object Storage', 'Parallel I/O', 'HPC', 'HDF5']"
3622,1310.0282,Yu Liu,"Yu Liu, Zhengwei Sui, Chaogui Kang, Yong Gao","Uncovering patterns of inter-urban trip and spatial interaction from
  social media check-in data","20 pages, 10 figures",PLoS ONE 9(1): e86026,10.1371/journal.pone.0086026,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The article revisits spatial interaction and distance decay from the
perspective of human mobility patterns and spatially-embedded networks based on
an empirical data set. We extract nationwide inter-urban movements in China
from a check-in data set that covers half million individuals and 370 cities to
analyze the underlying patterns of trips and spatial interactions. By fitting
the gravity model, we find that the observed spatial interactions are governed
by a power law distance decay effect. The obtained gravity model also well
reproduces the exponential trip displacement distribution. However, due to the
ecological fallacy issue, the movement of an individual may not obey the same
distance decay effect. We also construct a spatial network where the edge
weights denote the interaction strengths. The communities detected from the
network are spatially connected and roughly consistent with province
boundaries. We attribute this pattern to different distance decay parameters
between intra-province and inter-province trips.
","[{'version': 'v1', 'created': 'Tue, 1 Oct 2013 13:25:01 GMT'}, {'version': 'v2', 'created': 'Sun, 17 Nov 2013 05:01:14 GMT'}]",2015-04-01,"[['Liu', 'Yu', ''], ['Sui', 'Zhengwei', ''], ['Kang', 'Chaogui', ''], ['Gao', 'Yong', '']]","['social media check-in data', 'human mobility', 'spatial interaction', 'community detection', 'distance decay']"
3623,1901.11331,Masahiro Kobayashi,Masahiro Kobayashi and Kazuho Watanabe,"Generalized Dirichlet-process-means for $f$-separable distortion
  measures",,"Neurocomputing, vol. 458, 2021, pp. 667-689",10.1016/j.neucom.2020.03.123,,cs.LG cs.IT math.IT stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  DP-means clustering was obtained as an extension of $K$-means clustering.
While it is implemented with a simple and efficient algorithm, it can estimate
the number of clusters simultaneously. However, DP-means is specifically
designed for the average distortion measure. Therefore, it is vulnerable to
outliers in data, and can cause large maximum distortion in clusters. In this
work, we extend the objective function of the DP-means to $f$-separable
distortion measures and propose a unified learning algorithm to overcome the
above problems by selecting the function $f$. Further, the influence function
of the estimated cluster center is analyzed to evaluate the robustness against
outliers. We demonstrate the performance of the generalized method by numerical
experiments using real datasets.
","[{'version': 'v1', 'created': 'Thu, 31 Jan 2019 12:36:59 GMT'}, {'version': 'v2', 'created': 'Sat, 29 Jun 2019 03:12:40 GMT'}, {'version': 'v3', 'created': 'Thu, 1 Jul 2021 09:02:16 GMT'}]",2021-08-26,"[['Kobayashi', 'Masahiro', ''], ['Watanabe', 'Kazuho', '']]","['Clustering', 'Dirichlet-process-means', 'f-separable distortionmeasures', 'Bregman divergence', 'Influence function', 'Maximum distortion']"
3624,1309.2402,Ke Xu,"Rui Fan, Jichang Zhao, Yan Chen and Ke Xu",Anger is More Influential Than Joy: Sentiment Correlation in Weibo,,"PLoS ONE 9(10): e110184, 2014",10.1371/journal.pone.0110184,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent years have witnessed the tremendous growth of the online social media.
In China, Weibo, a Twitter-like service, has attracted more than 500 million
users in less than four years. Connected by online social ties, different users
influence each other emotionally. We find the correlation of anger among users
is significantly higher than that of joy, which indicates that angry emotion
could spread more quickly and broadly in the network. While the correlation of
sadness is surprisingly low and highly fluctuated. Moreover, there is a
stronger sentiment correlation between a pair of users if they share more
interactions. And users with larger number of friends posses more significant
sentiment influence to their neighborhoods. Our findings could provide insights
for modeling sentiment influence and propagation in online social networks.
","[{'version': 'v1', 'created': 'Tue, 10 Sep 2013 07:59:02 GMT'}]",2014-10-17,"[['Fan', 'Rui', ''], ['Zhao', 'Jichang', ''], ['Chen', 'Yan', ''], ['Xu', 'Ke', '']]","['Sentiment influence', 'Emotion propagation', 'Sentiment analysis', 'Onlinesocial network', 'Weibo']"
3625,1804.08554,Yuriy Zacchia Lun,"Y. Zacchia Lun, J. Wheatley, A. D'Innocenzo, A. Abate","Approximate Abstractions of Markov Chains with Interval Decision
  Processes (Extended Version)","Extended version of the paper accepted for the presentation at the
  IFAC Conference on Analysis and Design of Hybrid Systems (ADHS 2018)","IFAC-PapersOnLine 51 (16), 2018, pp. 91--96",10.1016/j.ifacol.2018.08.016,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work introduces a new abstraction technique for reducing the state space
of large, discrete-time labelled Markov chains. The abstraction leverages the
semantics of interval Markov decision processes and the existing notion of
approximate probabilistic bisimulation. Whilst standard abstractions make use
of abstract points that are taken from the state space of the concrete model
and which serve as representatives for sets of concrete states, in this work
the abstract structure is constructed considering abstract points that are not
necessarily selected from the states of the concrete model, rather they are a
function of these states. The resulting model presents a smaller one-step
bisimulation error, when compared to a like-sized, standard Markov chain
abstraction. We outline a method to perform probabilistic model checking, and
show that the computational complexity of the new method is comparable to that
of standard abstractions based on approximate probabilistic bisimulations.
","[{'version': 'v1', 'created': 'Mon, 23 Apr 2018 16:41:23 GMT'}]",2019-03-08,"[['Lun', 'Y. Zacchia', ''], ['Wheatley', 'J.', ''], [""D'Innocenzo"", 'A.', ''], ['Abate', 'A.', '']]","['Markov models', 'formal verification', 'error analysis']"
3626,1503.06091,Bin Jiang,"Ding Ma, Mats Sandberg and Bin Jiang",Characterizing the Heterogeneity of the OpenStreetMap Data and Community,"13 pages, 6 figures, and 8 tables","ISPRS International Journal of Geo-Information, 4(2), 535-550,
  2015",10.3390/ijgi4020535,,cs.SI nlin.AO physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  OpenStreetMap (OSM) constitutes an unprecedented, free, geographic
information source contributed by millions of individuals, resulting in a
database of great volume and heterogeneity. In this study, we characterize the
heterogeneity of the entire OSM database and historical archive in the context
of big data. We consider all users, geographic elements, and user contributions
from an eight-year data archive, at a size of 692 GB. We rely on some nonlinear
methods such as power-law statistics and head/tail breaks to uncover and
illustrate the underlying scaling properties. All three aspects (users,
elements, and contributions) demonstrate striking power laws or heavy-tailed
distributions. The heavy-tailed distributions imply that there are far more
small elements than large ones, far more inactive users than active ones, and
far more lightly edited elements than heavily edited ones. Furthermore, about
500 users in the core group of the OSM are highly networked in terms of
collaboration.
  Keywords: OpenStreetMap, big data, power laws, head/tail breaks, ht-index
","[{'version': 'v1', 'created': 'Tue, 3 Mar 2015 12:16:19 GMT'}, {'version': 'v2', 'created': 'Sat, 28 Mar 2015 14:53:26 GMT'}]",2015-05-20,"[['Ma', 'Ding', ''], ['Sandberg', 'Mats', ''], ['Jiang', 'Bin', '']]","['OpenStreetMap', 'big data', 'power laws', 'head/tail breaks', 'ht-index']"
3627,1807.04616,W. Cyrus Proctor,"W. Cyrus Proctor, Mike Packard, Anagha Jamthe, Richard Cardone, Joseph
  Stubbs","Virtualizing the Stampede2 Supercomputer with Applications to HPC in the
  Cloud","6 pages, 0 figures, PEARC '18: Practice and Experience in Advanced
  Research Computing, July 22--26, 2018, Pittsburgh, PA, USA",,10.1145/3219104.3219131,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Methods developed at the Texas Advanced Computing Center (TACC) are described
and demonstrated for automating the construction of an elastic, virtual cluster
emulating the Stampede2 high performance computing (HPC) system. The cluster
can be built and/or scaled in a matter of minutes on the Jetstream self-service
cloud system and shares many properties of the original Stampede2, including:
i) common identity management, ii) access to the same file systems, iii)
equivalent software application stack and module system, iv) similar job
scheduling interface via Slurm.
  We measure time-to-solution for a number of common scientific applications on
our virtual cluster against equivalent runs on Stampede2 and develop an
application profile where performance is similar or otherwise acceptable. For
such applications, the virtual cluster provides an effective form of ""cloud
bursting"" with the potential to significantly improve overall turnaround time,
particularly when Stampede2 is experiencing long queue wait times. In addition,
the virtual cluster can be used for test and debug without directly impacting
Stampede2. We conclude with a discussion of how science gateways can leverage
the TACC Jobs API web service to incorporate this cloud bursting technique
transparently to the end user.
","[{'version': 'v1', 'created': 'Thu, 12 Jul 2018 14:09:26 GMT'}]",2018-07-13,"[['Proctor', 'W. Cyrus', ''], ['Packard', 'Mike', ''], ['Jamthe', 'Anagha', ''], ['Cardone', 'Richard', ''], ['Stubbs', 'Joseph', '']]","['HPC', 'Cloud', 'Virtualization', 'Middleware']"
3628,1406.2744,Krispin Davies,"Krispin A. Davies, Alejandro Ramirez-Serrano, Graeme N. Wilson,
  Mahmoud Mustafa",Rapid Control Selection through Hill-Climbing Methods,"5th International Conference on Intelligent Robotics and Applications
  (ICIRA 2012) Original text available at:
  http://link.springer.com/chapter/10.1007%2F978-3-642-33515-0_55","5th International Conference, ICIRA 2012, Montreal, Canada,
  October 3-5, 2012, Proceedings, Part II, pp. 561-570, Oct. 2012",10.1007/978-3-642-33515-0_55,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consider the problem of control selection in complex dynamical and
environmental scenarios where model predictive control (MPC) proves
particularly effective. As the performance of MPC is highly dependent on the
efficiency of its incorporated search algorithm, this work examined hill
climbing as an alternative to traditional systematic or random search
algorithms. The relative performance of a candidate hill climbing algorithm was
compared to representative systematic and random algorithms in a set of
systematic tests and in a real-world control scenario. These tests indicated
that hill climbing can provide significantly improved search efficiency when
the control space has a large number of dimensions or divisions along each
dimension. Furthermore, this demonstrated that there was little increase in
search times associated with a significant increase in the number of control
configurations considered.
","[{'version': 'v1', 'created': 'Wed, 11 Jun 2014 00:03:58 GMT'}]",2014-06-12,"[['Davies', 'Krispin A.', ''], ['Ramirez-Serrano', 'Alejandro', ''], ['Wilson', 'Graeme N.', ''], ['Mustafa', 'Mahmoud', '']]","['Hill Climbing Search', 'Model Predictive Control', 'Random Search', 'GridRefinement Search', 'Mobile Robots']"
3629,1808.05900,Christoph Ager,"Christoph Ager, Benedikt Schott, Magnus Winter, Wolfgang A. Wall","A Nitsche-based cut finite element method for the coupling of
  incompressible fluid flow with poroelasticity","25 pages, 13 figures",,10.1016/j.cma.2019.03.015,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The focus of this contribution is the numerical treatment of interface
coupled problems concerning the interaction of incompressible fluid flow and
permeable, elastic structures. The main emphasis is on extending the range of
applicability of available formulations on especially three aspects. These
aspects are the incorporation of a more general poroelasticity formulation, the
use of the cut finite element method (CutFEM) to allow for large interface
motion and topological changes of the fluid domain, and the application of a
novel Nitsche-based approach to incorporate the Beavers-Joseph (-Saffmann)
tangential interface condition. This last aspect allows one to extend the
practicable range of applicability of the proposed formulation down to very low
porosities and permeabilities which is important in several examples in
application. Different aspects of the presented formulation are analyzed in a
numerical example including spatial convergence, the sensitivity of the
solution to the Nitsche penalty parameters, varying porosities and
permeabilities, and a varying Beavers-Joseph interface model constant. Finally,
a numerical example analyzing the fluid induced bending of a poroelastic beam
provides evidence of the general applicability of the presented approach.
","[{'version': 'v1', 'created': 'Fri, 17 Aug 2018 15:22:07 GMT'}]",2019-05-01,"[['Ager', 'Christoph', ''], ['Schott', 'Benedikt', ''], ['Winter', 'Magnus', ''], ['Wall', 'Wolfgang A.', '']]","['fluid-poroelasticity interaction', 'poroelasticity', 'CutFEM', 'Nitsche’s method', 'Beavers-Joseph condition']"
3630,1904.01675,Brent Hecht,"T. Stockx, B. Hecht, J. Sch\""oning","SubwayPS: Towards Enabling Smartphone Positioning in Underground Public
  Transportation Systems","Proceedings of the ACM SIGSPATIAL International Conference on
  Advances in Geographic Information Systems 2014 (ACM SIGSPATIAL 2014)",,10.1145/2666310.2666396,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Thanks to rapid advances in technologies like GPS and Wi-Fi positioning,
smartphone users are able to determine their location almost everywhere they
go. This is not true, however, of people who are traveling in underground
public transportation networks, one of the few types of high-traffic areas
where smartphones do not have access to accurate position information. In this
paper, we introduce the problem of underground transport positioning on
smartphones and present SubwayPS, an accelerometer-based positioning technique
that allows smartphones to determine their location substantially better than
baseline approaches, even deep beneath city streets. We highlight several
immediate applications of positioning in subway networks in domains ranging
from mobile advertising to mobile maps and present MetroNavigator, a
proof-of-concept smartphone and smartwatch app that notifies users of upcoming
points-of-interest and alerts them when it is time to get ready to exit the
train.
","[{'version': 'v1', 'created': 'Tue, 2 Apr 2019 21:31:55 GMT'}]",2019-04-04,"[['Stockx', 'T.', ''], ['Hecht', 'B.', ''], ['Schöning', 'J.', '']]","['mobile navigation', 'positioning', 'mobile devices', 'underground public transport', 'GPS', 'accelerometer']"
3631,1802.05859,Martin Koutecky,"Martin Kouteck\'y, Asaf Levin, Shmuel Onn","A Parameterized Strongly Polynomial Algorithm for Block Structured
  Integer Programs",,,10.4230/LIPIcs.ICALP.2018.85,,cs.DS cs.CC cs.DM math.CO math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The theory of $n$-fold integer programming has been recently emerging as an
important tool in parameterized complexity. The input to an $n$-fold integer
program (IP) consists of parameter $A$, dimension $n$, and numerical data of
binary encoding length $L$. It was known for some time that such programs can
be solved in polynomial time using $O(n^{g(A)}L)$ arithmetic operations where
$g$ is an exponential function of the parameter. In 2013 it was shown that it
can be solved in fixed-parameter tractable (FPT) time using $O(f(A)n^3L)$
arithmetic operations for a single-exponential function $f$. This, and a faster
algorithm for a special case of combinatorial $n$-fold IP, have led to several
very recent breakthroughs in the parameterized complexity of scheduling,
stringology, and computational social choice. In 2015 it was shown that it can
be solved in strongly polynomial time using $O(n^{g(A)})$ arithmetic
operations.
  Here we establish a result which subsumes all three of the above results by
showing that $n$-fold IP can be solved in strongly polynomial FPT time using
$O(f(A)n^3)$ arithmetic operations. In fact, our results are much more general,
briefly outlined as follows.
  - There is a strongly polynomial algorithm for ILP whenever a so-called
Graver-best oracle is realizable for it.
  - Graver-best oracles for the large classes of multi-stage stochastic and
tree-fold ILPs can be realized in FPT time. Together with the previous oracle
algorithm, this newly shows two large classes of ILP to be strongly polynomial;
in contrast, only few classes of ILP were previously known to be strongly
polynomial.
  - We show that ILP is FPT parameterized by the largest coefficient
$\|A\|_\infty$ and the primal or dual treedepth of $A$, and that this
parameterization cannot be relaxed, signifying substantial progress in
understanding the parameterized complexity of ILP.
","[{'version': 'v1', 'created': 'Fri, 16 Feb 2018 08:14:53 GMT'}]",2021-02-25,"[['Koutecký', 'Martin', ''], ['Levin', 'Asaf', ''], ['Onn', 'Shmuel', '']]","['integer programming', 'parameterized complexity', 'Graver basis', 'n-foldinteger programming']"
3632,0706.1179,Hichem Geryville,"Hichem Geryville (LIESP), Abdelaziz Bouras (LIESP), Yacine Ouzrout
  (LIESP), Nikolaos Sapidis",Collaborative product and process model: Multiple Viewpoints approach,391-398,"Innovative Products and Services through Collaborative Networks
  (2006) 542",10.1000/ISBN0-85358-228-9,,cs.OH cs.IR,,"  The design and development of complex products invariably involves many
actors who have different points of view on the problem they are addressing,
the product being developed, and the process by which it is being developed.
The actors' viewpoints approach was designed to provide an organisational
framework in which these different perspectives or points of views, and their
relationships, could be explicitly gathered and formatted (by actor activity's
focus). The approach acknowledges the inevitability of multiple interpretation
of product information as different views, promotes gathering of actors'
interests, and encourages retrieved adequate information while providing
support for integration through PLM and/or SCM collaboration. In this paper, we
present our multiple viewpoints approach, and we illustrate it by an industrial
example on cyclone vessel product.
","[{'version': 'v1', 'created': 'Fri, 8 Jun 2007 13:09:13 GMT'}]",2007-06-11,"[['Geryville', 'Hichem', '', 'LIESP'], ['Bouras', 'Abdelaziz', '', 'LIESP'], ['Ouzrout', 'Yacine', '', 'LIESP'], ['Sapidis', 'Nikolaos', '']]","['Viewpoints', 'exchange information', 'product information', 'process information', 'product lifecycle management']"
3633,1902.02380,Artem Grachev,Artem M. Grachev and Dmitry I. Ignatov and Andrey V. Savchenko,Compression of Recurrent Neural Networks for Efficient Language Modeling,"25 pages, 3 tables, 4 figures",,10.1016/j.asoc.2019.03.057,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recurrent neural networks have proved to be an effective method for
statistical language modeling. However, in practice their memory and run-time
complexity are usually too large to be implemented in real-time offline mobile
applications. In this paper we consider several compression techniques for
recurrent neural networks including Long-Short Term Memory models. We make
particular attention to the high-dimensional output problem caused by the very
large vocabulary size. We focus on effective compression methods in the context
of their exploitation on devices: pruning, quantization, and matrix
decomposition approaches (low-rank factorization and tensor train
decomposition, in particular). For each model we investigate the trade-off
between its size, suitability for fast inference and perplexity. We propose a
general pipeline for applying the most suitable methods to compress recurrent
neural networks for language modeling. It has been shown in the experimental
study with the Penn Treebank (PTB) dataset that the most efficient results in
terms of speed and compression-perplexity balance are obtained by matrix
decomposition techniques.
","[{'version': 'v1', 'created': 'Wed, 6 Feb 2019 19:49:22 GMT'}]",2019-04-09,"[['Grachev', 'Artem M.', ''], ['Ignatov', 'Dmitry I.', ''], ['Savchenko', 'Andrey V.', '']]","['Recurrent neural network compression', 'language modeling', 'mobile devices', 'low-rank factorization']"
3634,0906.3469,Panos Giannopoulos,"Panos Giannopoulos, Christian Knauer, Gunter Rote, Daniel Werner","The parameterized complexity of some geometric problems in unbounded
  dimension",,"Proc. 4th Int. Workshop on Parameterized and Exact
  Computation-IWPEC 2009, Copenhagen, September 2009, Herausgeber: Jianer Chen
  und Fedor V. Fomin, Lecture Notes in Computer Science, 5917, Springer-Verlag,
  2009, pp. 198-209",10.1007/978-3-642-11269-0_16,,cs.CG cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the parameterized complexity of the following fundamental geometric
problems with respect to the dimension $d$: i) Given $n$ points in $\Rd$,
compute their minimum enclosing cylinder. ii) Given two $n$-point sets in
$\Rd$, decide whether they can be separated by two hyperplanes. iii) Given a
system of $n$ linear inequalities with $d$ variables, find a maximum-size
feasible subsystem. We show that (the decision versions of) all these problems
are W[1]-hard when parameterized by the dimension $d$. %and hence not solvable
in ${O}(f(d)n^c)$ time, for any computable function $f$ and constant $c$
%(unless FPT=W[1]). Our reductions also give a $n^{\Omega(d)}$-time lower bound
(under the Exponential Time Hypothesis).
","[{'version': 'v1', 'created': 'Thu, 18 Jun 2009 15:44:18 GMT'}]",2015-02-18,"[['Giannopoulos', 'Panos', ''], ['Knauer', 'Christian', ''], ['Rote', 'Gunter', ''], ['Werner', 'Daniel', '']]","['parameterized complexity', 'geometric dimension', 'lower bounds', 'minimumenclosing cylinder', 'maximum feasible subsystem', '2-linear separability']"
3635,1907.12489,Frederik Dennig,"Frederik L. Dennig, Tom Polk, Zudi Lin, Tobias Schreck, Hanspeter
  Pfister, and Michael Behrisch",FDive: Learning Relevance Models using Pattern-based Similarity Measures,"12 pages, 7 figures, 2 tables, LaTeX; corrected typo; added DOI","2019 IEEE Conference on Visual Analytics Science and Technology
  (VAST)",10.1109/VAST47406.2019.8986940,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The detection of interesting patterns in large high-dimensional datasets is
difficult because of their dimensionality and pattern complexity. Therefore,
analysts require automated support for the extraction of relevant patterns. In
this paper, we present FDive, a visual active learning system that helps to
create visually explorable relevance models, assisted by learning a
pattern-based similarity. We use a small set of user-provided labels to rank
similarity measures, consisting of feature descriptor and distance function
combinations, by their ability to distinguish relevant from irrelevant data.
Based on the best-ranked similarity measure, the system calculates an
interactive Self-Organizing Map-based relevance model, which classifies data
according to the cluster affiliation. It also automatically prompts further
relevance feedback to improve its accuracy. Uncertain areas, especially near
the decision boundaries, are highlighted and can be refined by the user. We
evaluate our approach by comparison to state-of-the-art feature selection
techniques and demonstrate the usefulness of our approach by a case study
classifying electron microscopy images of brain cells. The results show that
FDive enhances both the quality and understanding of relevance models and can
thus lead to new insights for brain research.
","[{'version': 'v1', 'created': 'Mon, 29 Jul 2019 15:37:43 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Jul 2019 09:10:47 GMT'}, {'version': 'v3', 'created': 'Thu, 23 Apr 2020 15:09:51 GMT'}]",2020-04-24,"[['Dennig', 'Frederik L.', ''], ['Polk', 'Tom', ''], ['Lin', 'Zudi', ''], ['Schreck', 'Tobias', ''], ['Pfister', 'Hanspeter', ''], ['Behrisch', 'Michael', '']]","['Visual analytics', 'similarity measure selection', 'relevance feedback', 'active learning', 'self-organizing maps']"
3636,1709.04491,Lukasz Augustyniak,"{\L}ukasz Augustyniak, Krzysztof Rajda, Tomasz Kajdanowicz",Method for Aspect-Based Sentiment Annotation Using Rhetorical Analysis,,,10.1007/978-3-319-54472-4_72,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper fills a gap in aspect-based sentiment analysis and aims to present
a new method for preparing and analysing texts concerning opinion and
generating user-friendly descriptive reports in natural language. We present a
comprehensive set of techniques derived from Rhetorical Structure Theory and
sentiment analysis to extract aspects from textual opinions and then build an
abstractive summary of a set of opinions. Moreover, we propose aspect-aspect
graphs to evaluate the importance of aspects and to filter out unimportant ones
from the summary. Additionally, the paper presents a prototype solution of data
flow with interesting and valuable results. The proposed method's results
proved the high accuracy of aspect detection when applied to the gold standard
dataset.
","[{'version': 'v1', 'created': 'Wed, 13 Sep 2017 18:17:56 GMT'}]",2017-09-15,"[['Augustyniak', 'Łukasz', ''], ['Rajda', 'Krzysztof', ''], ['Kajdanowicz', 'Tomasz', '']]","['sentiment analysis', 'opinion mining', 'aspect-based sentimentanalysis', 'rhetorical analysis', 'Rhetorical Structure Theory']"
3637,1912.02707,Eli (Omid) David,"Daniel Rika, Dror Sholomon, Eli David, Nathan S. Netanyahu","A Novel Hybrid Scheme Using Genetic Algorithms and Deep Learning for the
  Reconstruction of Portuguese Tile Panels",,"ACM Genetic and Evolutionary Computation Conference (GECCO), pages
  1319-1327, Prague, Czech Republic, July 2019",10.1145/3321707.3321821,,cs.CV cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel scheme, based on a unique combination of genetic
algorithms (GAs) and deep learning (DL), for the automatic reconstruction of
Portuguese tile panels, a challenging real-world variant of the jigsaw puzzle
problem (JPP) with important national heritage implications. Specifically, we
introduce an enhanced GA-based puzzle solver, whose integration with a novel
DL-based compatibility measure (DLCM) yields state-of-the-art performance,
regarding the above application. Current compatibility measures consider
typically (the chromatic information of) edge pixels (between adjacent tiles),
and help achieve high accuracy for the synthetic JPP variant. However, such
measures exhibit rather poor performance when applied to the Portuguese tile
panels, which are susceptible to various real-world effects, e.g.,
monochromatic panels, non-squared tiles, edge degradation, etc. To overcome
such difficulties, we have developed a novel DLCM to extract high-level
texture/color statistics from the entire tile information.
  Integrating this measure with our enhanced GA-based puzzle solver, we have
demonstrated, for the first time, how to deal most effectively with large-scale
real-world problems, such as the Portuguese tile problem. Specifically, we have
achieved 82% accuracy for the reconstruction of Portuguese tile panels with
unknown piece rotation and puzzle dimension (compared to merely 3.5% average
accuracy achieved by the best method known for solving this problem variant).
The proposed method outperforms even human experts in several cases, correcting
their mistakes in the manual tile assembly.
","[{'version': 'v1', 'created': 'Wed, 4 Dec 2019 06:24:21 GMT'}]",2019-12-06,"[['Rika', 'Daniel', ''], ['Sholomon', 'Dror', ''], ['David', 'Eli', ''], ['Netanyahu', 'Nathan S.', '']]","['Real World Applications', 'Genetic Algorithm', 'Reconstruction', 'DeepLearning', 'Jigsaw Puzzle Problem', 'Portuguese Tile Panels']"
3638,2105.04247,Alexander Hagg,"Alexander Hagg, Sebastian Berns, Alexander Asteroth, Simon Colton,
  Thomas B\""ack","Expressivity of Parameterized and Data-driven Representations in Quality
  Diversity Search","For code for reproducing experiments, see
  https://github.com/alexander-hagg/ExpressivityGECCO2021",,10.1145/3449639.3459287,,cs.LG cs.NE,http://creativecommons.org/licenses/by/4.0/,"  We consider multi-solution optimization and generative models for the
generation of diverse artifacts and the discovery of novel solutions. In cases
where the domain's factors of variation are unknown or too complex to encode
manually, generative models can provide a learned latent space to approximate
these factors. When used as a search space, however, the range and diversity of
possible outputs are limited to the expressivity and generative capabilities of
the learned model. We compare the output diversity of a quality diversity
evolutionary search performed in two different search spaces: 1) a predefined
parameterized space and 2) the latent space of a variational autoencoder model.
We find that the search on an explicit parametric encoding creates more diverse
artifact sets than searching the latent space. A learned model is better at
interpolating between known data points than at extrapolating or expanding
towards unseen examples. We recommend using a generative model's latent space
primarily to measure similarity between artifacts rather than for search and
generation. Whenever a parametric encoding is obtainable, it should be
preferred over a learned representation as it produces a higher diversity of
solutions.
","[{'version': 'v1', 'created': 'Mon, 10 May 2021 10:27:43 GMT'}]",2021-05-11,"[['Hagg', 'Alexander', ''], ['Berns', 'Sebastian', ''], ['Asteroth', 'Alexander', ''], ['Colton', 'Simon', ''], ['Bäck', 'Thomas', '']]","['Quality Diversity', 'Generative Models', 'Variational Autoencoder']"
3639,1908.01167,Amar Ranjan Dash,"Amar Ranjan Dash, Sandipta Kumar Sahu, B Kewal",An Optimized Disk Scheduling Algorithm With Bad-Sector Management,"21 pages, 21 figures, 3 table, International Journal of Computer
  Science, Engineering and Applications (IJCSEA)","International Journal of Computer Science, Engineering and
  Applications (IJCSEA), AIRCC, 2019, Vol. 9(3), pp 1-21, DOI
  :10.5012/ijcsea.2019.9301",10.5012/ijcsea.2019.9301,,cs.OS cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In high performance computing, researchers try to optimize the CPU Scheduling
algorithms, for faster and efficient working of computers. But a process needs
both CPU bound and I/O bound for completion of its execution. With
modernization of computers the speed of processor, hard-disk, and I/O devices
increases gradually. Still the data access speed of hard-disk is much less than
the speed of the processor. So when processor receives a data from secondary
memory it executes immediately and again it have to wait for receiving another
data. So the slowness of the hard-disk becomes a bottleneck in the performance
of processor. Researchers try to develop and optimize the traditional disk
scheduling algorithms for faster data transfer to and from secondary data
storage devices. In this paper we try to evolve an optimized scheduling
algorithm by reducing the seek time, the rotational latency, and the data
transfer time in runtime. This algorithm has the feature to manage the
bad-sectors of the hard-disk. It also attempts to reduce power consumption and
heat reduction by minimizing bad sector reading time.
","[{'version': 'v1', 'created': 'Sat, 3 Aug 2019 13:16:51 GMT'}]",2019-08-06,"[['Dash', 'Amar Ranjan', ''], ['Sahu', 'Sandipta Kumar', ''], ['Kewal', 'B', '']]","['Algorithm Optimization', 'Bad-Sector', 'Disk Scheduling', 'Multi-Platter Hard-disk', 'Operating System.    1']"
3640,1711.05472,Stefan Wagner,"Elmar Juergens and Florian Deissenboeck and Martin Feilkas and
  Benjamin Hummel and Bernhard Schaetz and Stefan Wagner and Christoph Domann
  and Jonathan Streit","Can clone detection support quality assessments of requirements
  specifications?","10 pages, 5 figures","Proceedings of the 32nd ACM/IEEE International Conference on
  Software Engineering - Volume 2. Pages 79-88. ACM, 2010",10.1145/1810295.1810308,,cs.SE cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to their pivotal role in software engineering, considerable effort is
spent on the quality assurance of software requirements specifications. As they
are mainly described in natural language, relatively few means of automated
quality assessment exist. However, we found that clone detection, a technique
widely applied to source code, is promising to assess one important quality
aspect in an automated way, namely redundancy that stems from copy&paste
operations. This paper describes a large-scale case study that applied clone
detection to 28 requirements specifications with a total of 8,667 pages. We
report on the amount of redundancy found in real-world specifications, discuss
its nature as well as its consequences and evaluate in how far existing code
clone detection approaches can be applied to assess the quality of requirements
specifications in practice.
","[{'version': 'v1', 'created': 'Wed, 15 Nov 2017 09:33:44 GMT'}]",2017-11-16,"[['Juergens', 'Elmar', ''], ['Deissenboeck', 'Florian', ''], ['Feilkas', 'Martin', ''], ['Hummel', 'Benjamin', ''], ['Schaetz', 'Bernhard', ''], ['Wagner', 'Stefan', ''], ['Domann', 'Christoph', ''], ['Streit', 'Jonathan', '']]","['Redundancy', 'Requirements Specification', 'Clone Detection']"
3641,1510.04972,Weiyi Sun,"Weiyi Sun, Anna Rumshisky, Ozlem Uzuner","Normalization of Relative and Incomplete Temporal Expressions in
  Clinical Narratives",Draft version,Journal of the American Medical Informatics Association (2015),10.1093/jamia/ocu004,,cs.CL cs.AI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze the RI-TIMEXes in temporally annotated corpora and propose two
hypotheses regarding the normalization of RI-TIMEXes in the clinical narrative
domain: the anchor point hypothesis and the anchor relation hypothesis. We
annotate the RI-TIMEXes in three corpora to study the characteristics of
RI-TMEXes in different domains. This informed the design of our RI-TIMEX
normalization system for the clinical domain, which consists of an anchor point
classifier, an anchor relation classifier and a rule-based RI-TIMEX text span
parser. We experiment with different feature sets and perform error analysis
for each system component. The annotation confirmed the hypotheses that we can
simplify the RI-TIMEXes normalization task using two multi-label classifiers.
Our system achieves anchor point classification, anchor relation classification
and rule-based parsing accuracy of 74.68%, 87.71% and 57.2% (82.09% under
relaxed matching criteria) respectively on the held-out test set of the 2012
i2b2 temporal relation challenge. Experiments with feature sets reveals some
interesting findings such as the verbal tense feature does not inform the
anchor relation classification in clinical narratives as much as the tokens
near the RI-TIMEX. Error analysis shows that underrepresented anchor point and
anchor relation classes are difficult to detect. We formulate the RI-TIMEX
normalization problem as a pair of multi-label classification problems.
Considering only the RI-TIMEX extraction and normalization, the system achieves
statistically significant improvement over the RI-TIMEX results of the best
systems in the 2012 i2b2 challenge.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2015 18:35:13 GMT'}]",2015-10-19,"[['Sun', 'Weiyi', ''], ['Rumshisky', 'Anna', ''], ['Uzuner', 'Ozlem', '']]","['Temporal Reasoning', 'Medical Language Processing', 'Temporal ExpressionNormalization']"
3642,1512.07067,Brodu Etienne,"Etienne Brodu (DICE), St\'ephane Fr\'enot (DICE), Fr\'ed\'eric Obl\'e",Transforming Javascript Event-Loop Into a Pipeline,,"Symposium on Applied Computing, Apr 2016, Pisa, Italy. 2016,
  http://www.acm.org/conferences/sac/sac2016/",10.1145/2851613.2851745,,cs.PL cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The development of a real-time web application often starts with a
feature-driven approach allowing to quickly react to users feedbacks. However,
this approach poorly scales in performance. Yet, the user-base can increase by
an order of magnitude in a matter of hours. This first approach is unable to
deal with the highest connections spikes. It leads the development team to
shift to a scalable approach often linked to new development paradigm such as
dataflow programming. This shift of technology is disruptive and
continuity-threatening. To avoid it, we propose to abstract the feature-driven
development into a more scalable high-level language. Indeed, reasoning on this
high-level language allows to dynamically cope with user-base size evolutions.
We propose a compilation approach that transforms a Javascript, single-threaded
real-time web application into a network of small independent parts
communicating by message streams. We named these parts fluxions, by contraction
between a flow (flux in french) and a function. The independence of these parts
allows their execution to be parallel, and to organize an application on
several processors to cope with its load, in a similar way network routers do
with IP traffic. We test this approach by applying the compiler to a real web
application. We transform this application to parallelize the execution of an
independent part and present the result.
","[{'version': 'v1', 'created': 'Tue, 22 Dec 2015 13:01:48 GMT'}]",2015-12-23,"[['Brodu', 'Etienne', '', 'DICE'], ['Frénot', 'Stéphane', '', 'DICE'], ['Oblé', 'Frédéric', '']]","['Flow programming', 'Web', 'Javascript']"
3643,cs/0507019,Paul M. Aoki,Paul M. Aoki and Allison Woodruff,"Making Space for Stories: Ambiguity in the Design of Personal
  Communication Systems",10 pages,"Proc. ACM SIGCHI Conf. on Human Factors in Computing Systems,
  Portland, OR, Apr. 2005, 181-190. ACM Press.",10.1145/1054972.1054998,,cs.HC,,"  Pervasive personal communication technologies offer the potential for
important social benefits for individual users, but also the potential for
significant social difficulties and costs. In research on face-to-face social
interaction, ambiguity is often identified as an important resource for
resolving social difficulties. In this paper, we discuss two design cases of
personal communication systems, one based on fieldwork of a commercial system
and another based on an unrealized design concept. The cases illustrate how
user behavior concerning a particular social difficulty, unexplained
unresponsiveness, can be influenced by technological issues that result in
interactional ambiguity. The cases also highlight the need to balance the
utility of ambiguity against the utility of usability and communicative
clarity.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2005 21:29:09 GMT'}]",2008-04-18,"[['Aoki', 'Paul M.', ''], ['Woodruff', 'Allison', '']]","['Mediated communication', 'ambiguity', 'face-work', 'push-totalk', 'leases']"
3644,1903.07913,Antonio E. Porreca,"Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca",Complexity of the dynamics of reaction systems,Preprint,"Information and Computation, Volume 267, August 2019, Pages 96-109",10.1016/j.ic.2019.03.006,,cs.FL cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reaction systems are discrete dynamical systems inspired by bio-chemical
processes, whose dynamical behaviour is expressed by set-theoretic operations
on finite sets. Reaction systems thus provide a description of bio-chemical
phenomena that complements the more traditional approaches, for instance those
based on differential equations. A comprehensive list of decision problems
about the dynamical behavior of reaction systems (such as cycles and
fixed/periodic points, attractors, and reachability) is provided along with the
corresponding computational complexity, which ranges from tractable problems to
PSPACE-complete problems.
","[{'version': 'v1', 'created': 'Tue, 19 Mar 2019 10:11:11 GMT'}]",2020-08-05,"[['Dennunzio', 'Alberto', ''], ['Formenti', 'Enrico', ''], ['Manzoni', 'Luca', ''], ['Porreca', 'Antonio E.', '']]","['reaction systems', 'computational complexity', 'natural computing', 'discrete dynamical systems']"
3645,1701.08068,Enver Solan,"Enver Solan, Sven Dirkmann, Mirko Hansen, Dietmar Schroeder, Hermann
  Kohlstedt, Martin Ziegler, Thomas Mussenbrock, and Karlheinz Ochs","An Enhanced Lumped Element Electrical Model of a Double Barrier
  Memristive Device",,,10.1088/1361-6463/aa69ae,,cs.ET physics.ins-det,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The massive parallel approach of neuromorphic circuits leads to effective
methods for solving complex problems. It has turned out that resistive
switching devices with a continuous resistance range are potential candidates
for such applications. These devices are memristive systems - nonlinear
resistors with memory. They are fabricated in nanotechnology and hence
parameter spread during fabrication may aggravate reproducible analyses. This
issue makes simulation models of memristive devices worthwhile.
  Kinetic Monte-Carlo simulations based on a distributed model of the device
can be used to understand the underlying physical and chemical phenomena.
However, such simulations are very time-consuming and neither convenient for
investigations of whole circuits nor for real-time applications, e.g. emulation
purposes. Instead, a concentrated model of the device can be used for both fast
simulations and real-time applications, respectively. We introduce an enhanced
electrical model of a valence change mechanism (VCM) based double barrier
memristive device (DBMD) with a continuous resistance range. This device
consists of an ultra-thin memristive layer sandwiched between a tunnel barrier
and a Schottky-contact. The introduced model leads to very fast simulations by
using usual circuit simulation tools while maintaining physically meaningful
parameters.
  Kinetic Monte-Carlo simulations based on a distributed model and experimental
data have been utilized as references to verify the concentrated model.
","[{'version': 'v1', 'created': 'Thu, 19 Jan 2017 09:29:11 GMT'}]",2017-06-02,"[['Solan', 'Enver', ''], ['Dirkmann', 'Sven', ''], ['Hansen', 'Mirko', ''], ['Schroeder', 'Dietmar', ''], ['Kohlstedt', 'Hermann', ''], ['Ziegler', 'Martin', ''], ['Mussenbrock', 'Thomas', ''], ['Ochs', 'Karlheinz', '']]","['memristive devices', 'resistive switching', 'neuromorphic circuits', 'electricalmodeling', 'nanoelectronics']"
3646,0711.3128,Anne-Marie Vercoustre,"Anne-Marie Vercoustre (INRIA Rocquencourt / INRIA Sophia Antipolis),
  James A. Thom (RMIT), Jovan Pehcevski (INRIA Rocquencourt / INRIA Sophia
  Antipolis)",Entity Ranking in Wikipedia,to appear,Dans the 23rd Annual ACM Symposium on Applied Computing (2008),,,cs.IR,,"  The traditional entity extraction problem lies in the ability of extracting
named entities from plain text using natural language processing techniques and
intensive training from large document collections. Examples of named entities
include organisations, people, locations, or dates. There are many research
activities involving named entities; we are interested in entity ranking in the
field of information retrieval. In this paper, we describe our approach to
identifying and ranking entities from the INEX Wikipedia document collection.
Wikipedia offers a number of interesting features for entity identification and
ranking that we first introduce. We then describe the principles and the
architecture of our entity ranking system, and introduce our methodology for
evaluation. Our preliminary results show that the use of categories and the
link structure of Wikipedia, together with entity examples, can significantly
improve retrieval effectiveness.
","[{'version': 'v1', 'created': 'Tue, 20 Nov 2007 12:40:23 GMT'}]",2007-11-21,"[['Vercoustre', 'Anne-Marie', '', 'INRIA Rocquencourt / INRIA Sophia Antipolis'], ['Thom', 'James A.', '', 'RMIT'], ['Pehcevski', 'Jovan', '', 'INRIA Rocquencourt / INRIA Sophia\n  Antipolis']]","['Entity Ranking', 'XML Retrieval', 'Test collection']"
3647,1404.7279,Michael  Gr. Voskoglou Prof. Dr.,Michael Gr. Voskoglou,"Assessing the players'performance in the game of bridge: A fuzzy logic
  approach","6 pages, 2 figures, 2 tables","American Journal of Applied Mathematics and Statistics, vol. 2,
  no. 3 (2014), 115-120",10.12691/ajams-2-3-5,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Contract bridge occupies nowadays a position of great prestige being,
together with chess, the only mind games officially recognized by the
International Olympic Committee. In the present paper an innovative method for
assessing the total performance of bridge- players' belonging to groups of
special interest(e.g. different bridge clubs during a tournament, men and
women, new and old players, etc) is introduced, which is based on principles of
fuzzy logic. For this, the cohorts under assessment are represented as fuzzy
subsets of a set of linguistic labels characterizing their performance and the
centroid defuzzification method is used to convert the fuzzy data collected
from the game to a crisp number. This new method of assessment could be used
informally as a complement of the official bridge-scoring methods for
statistical and other obvious reasons. Two real applications related to
simultaneous tournaments with pre-dealt boards, organized by the Hellenic
Bridge Federation, are also presented, illustrating the importance of our
results in practice.
","[{'version': 'v1', 'created': 'Tue, 29 Apr 2014 08:56:44 GMT'}]",2014-04-30,"[['Voskoglou', 'Michael Gr.', '']]","['Contract bridge', 'Fuzzy sets', 'Centroid defuzzification method']"
3648,1808.09825,Mandar Gogate,"Ahsan Adeel, Mandar Gogate, Amir Hussain","Contextual Audio-Visual Switching For Speech Enhancement in Real-World
  Environments","16 pages, 7 figures. arXiv admin note: substantial text overlap with
  arXiv:1808.00046","Information Fusion, 2019",10.1016/j.inffus.2019.08.008,ISSN 1566-2535,cs.CV cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human speech processing is inherently multimodal, where visual cues (lip
movements) help to better understand the speech in noise. Lip-reading driven
speech enhancement significantly outperforms benchmark audio-only approaches at
low signal-to-noise ratios (SNRs). However, at high SNRs or low levels of
background noise, visual cues become fairly less effective for speech
enhancement. Therefore, a more optimal, context-aware audio-visual (AV) system
is required, that contextually utilises both visual and noisy audio features
and effectively accounts for different noisy conditions. In this paper, we
introduce a novel contextual AV switching component that contextually exploits
AV cues with respect to different operating conditions to estimate clean audio,
without requiring any SNR estimation. The switching module switches between
visual-only (V-only), audio-only (A-only), and both AV cues at low, high and
moderate SNR levels, respectively. The contextual AV switching component is
developed by integrating a convolutional neural network and long-short-term
memory network. For testing, the estimated clean audio features are utilised by
the developed novel enhanced visually derived Wiener filter for clean audio
power spectrum estimation. The contextual AV speech enhancement method is
evaluated under real-world scenarios using benchmark Grid and ChiME3 corpora.
For objective testing, perceptual evaluation of speech quality is used to
evaluate the quality of the restored speech. For subjective testing, the
standard mean-opinion-score method is used. The critical analysis and
comparative study demonstrate the outperformance of proposed contextual AV
approach, over A-only, V-only, spectral subtraction, and log-minimum mean
square error based speech enhancement methods at both low and high SNRs,
revealing its capability to tackle spectro-temporal variation in any real-world
noisy condition.
","[{'version': 'v1', 'created': 'Tue, 28 Aug 2018 17:27:11 GMT'}]",2019-09-24,"[['Adeel', 'Ahsan', ''], ['Gogate', 'Mandar', ''], ['Hussain', 'Amir', '']]","['Contextual Learning', 'Speech Enhancement', 'Wiener Filtering', 'Audio-Visual', 'Deep Learning']"
3649,1812.03398,Yu Zhang,"Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sariyuce, Srikanta
  Tirthapura",FLEET: Butterfly Estimation from a Bipartite Graph Stream,"This is the author's version of the work. It is posted here by
  permission of ACM for your personal use. Not for redistribution. The
  definitive version was published in Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet
  Erdem Sariyuce and Srikanta Tirthapura. ""FLEET: Butterfly Estimation from a
  Bipartite Graph Stream"". The 28th ACM International Conference on Information
  and Knowledge Management",,10.1145/3357384.3357983,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider space-efficient single-pass estimation of the number of
butterflies, a fundamental bipartite graph motif, from a massive bipartite
graph stream where each edge represents a connection between entities in two
different partitions. We present a space lower bound for any streaming
algorithm that can estimate the number of butterflies accurately, as well as
FLEET, a suite of algorithms for accurately estimating the number of
butterflies in the graph stream. Estimates returned by the algorithms come with
provable guarantees on the approximation error, and experiments show good
tradeoffs between the space used and the accuracy of approximation. We also
present space-efficient algorithms for estimating the number of butterflies
within a sliding window of the most recent elements in the stream. While there
is a significant body of work on counting subgraphs such as triangles in a
unipartite graph stream, our work seems to be one of the few to tackle the case
of bipartite graph streams.
","[{'version': 'v1', 'created': 'Sat, 8 Dec 2018 22:43:19 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Aug 2019 20:17:36 GMT'}]",2019-08-30,"[['Sanei-Mehri', 'Seyed-Vahid', ''], ['Zhang', 'Yu', ''], ['Sariyuce', 'Ahmet Erdem', ''], ['Tirthapura', 'Srikanta', '']]","['butterfly counting', 'rectangle counting', 'data stream']"
3650,1202.5685,Lavanya Sivakumar  PhD,Lavanya Sivakumar and Matthias Dehmer,Information inequalities and Generalized Graph Entropies,A preliminary version. To be submitted to a journal,(2012) PLoS ONE 7(6): e38159,10.1371/journal.pone.0038159,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, we discuss the problem of establishing relations between
information measures assessed for network structures. Two types of entropy
based measures namely, the Shannon entropy and its generalization, the
R\'{e}nyi entropy have been considered for this study. Our main results involve
establishing formal relationship, in the form of implicit inequalities, between
these two kinds of measures when defined for graphs. Further, we also state and
prove inequalities connecting the classical partition-based graph entropies and
the functional-based entropy measures. In addition, several explicit
inequalities are derived for special classes of graphs.
","[{'version': 'v1', 'created': 'Sat, 25 Feb 2012 19:19:29 GMT'}]",2013-01-24,"[['Sivakumar', 'Lavanya', ''], ['Dehmer', 'Matthias', '']]","['Information Measures', 'Information inequalities', 'Topological complexity', 'Shannon Entropy', 'R´enyi Entropy', 'Networks']"
3651,1807.03088,Chunlei Li,"Zibi Xiao, Xiangyong Zeng, Chunlei Li and Tor Helleseth","Corrigendum to New Generalized Cyclotomic Binary Sequences of Period
  $p^2$","In the appended corrigendum, we pointed out that the proof of Lemma 6
  in the paper only holds for $f=2$ and gave a proof for any $f=2^r$ when $p$
  is a non-Wieferich prime",,10.1007/s10623-017-0408-7,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  New generalized cyclotomic binary sequences of period $p^2$ are proposed in
this paper, where $p$ is an odd prime. The sequences are almost balanced and
their linear complexity is determined. The result shows that the proposed
sequences have very large linear complexity if $p$ is a non-Wieferich prime.
","[{'version': 'v1', 'created': 'Mon, 9 Jul 2018 13:03:57 GMT'}]",2018-07-10,"[['Xiao', 'Zibi', ''], ['Zeng', 'Xiangyong', ''], ['Li', 'Chunlei', ''], ['Helleseth', 'Tor', '']]","['binary sequence', 'linear complexity', 'cyclotomy', 'generalized cyclotomicsequence']"
3652,1309.5931,Gabriel Kronberger,"Michael Kommenda and Gabriel Kronberger and Christoph Feilmayr and
  Michael Affenzeller","Data Mining using Unguided Symbolic Regression on a Blast Furnace
  Dataset","Presented at Workshop for Heuristic Problem Solving, Computer Aided
  Systems Theory - EUROCAST 2011. The final publication is available at
  http://link.springer.com/chapter/10.1007/978-3-642-27549-4_51","Computer Aided Systems Theory - EUROCAST 2011, Lecture Notes in
  Computer Science Volume 6927, 2012, pp 400-407",10.1007/978-3-642-27549-4_51,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper a data mining approach for variable selection and knowledge
extraction from datasets is presented. The approach is based on unguided
symbolic regression (every variable present in the dataset is treated as the
target variable in multiple regression runs) and a novel variable relevance
metric for genetic programming. The relevance of each input variable is
calculated and a model approximating the target variable is created. The
genetic programming configurations with different target variables are executed
multiple times to reduce stochastic effects and the aggregated results are
displayed as a variable interaction network. This interaction network
highlights important system components and implicit relations between the
variables. The whole approach is tested on a blast furnace dataset, because of
the complexity of the blast furnace and the many interrelations between the
variables. Finally the achieved results are discussed with respect to existing
knowledge about the blast furnace process.
","[{'version': 'v1', 'created': 'Mon, 23 Sep 2013 19:35:29 GMT'}]",2013-09-24,"[['Kommenda', 'Michael', ''], ['Kronberger', 'Gabriel', ''], ['Feilmayr', 'Christoph', ''], ['Affenzeller', 'Michael', '']]","['Variable Selection', 'Genetic Programming', 'Data Mining', 'Blast Furnace']"
3653,1811.09063,Bas van der Velden,"Bas H.M. van der Velden, Bob D. de Vos, Claudette E. Loo, Hugo J.
  Kuijf, Ivana Isgum, Kenneth G.A. Gilhuijs","Response monitoring of breast cancer on DCE-MRI using convolutional
  neural network-generated seed points and constrained volume growing","This work has been accepted for SPIE Medical Imaging 2019,
  Computer-Aided Diagnosis conference, Paper 10950-12","Medical Imaging 2019: Computer-Aided Diagnosis (Vol. 10950, p.
  109500D). International Society for Optics and Photonics",10.1117/12.2508358,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Response of breast cancer to neoadjuvant chemotherapy (NAC) can be monitored
using the change in visible tumor on magnetic resonance imaging (MRI). In our
current workflow, seed points are manually placed in areas of enhancement
likely to contain cancer. A constrained volume growing method uses these
manually placed seed points as input and generates a tumor segmentation. This
method is rigorously validated using complete pathological embedding. In this
study, we propose to exploit deep learning for fast and automatic seed point
detection, replacing manual seed point placement in our existing and
well-validated workflow. The seed point generator was developed in early breast
cancer patients with pathology-proven segmentations (N=100), operated shortly
after MRI. It consisted of an ensemble of three independently trained fully
convolutional dilated neural networks that classified breast voxels as tumor or
non-tumor. Subsequently, local maxima were used as seed points for volume
growing in patients receiving NAC (N=10). The percentage of tumor volume change
was evaluated against semi-automatic segmentations. The primary cancer was
localized in 95% of the tumors at the cost of 0.9 false positive per patient.
False positives included focally enhancing regions of unknown origin and parts
of the intramammary blood vessels. Volume growing from the seed points showed a
median tumor volume decrease of 70% (interquartile range: 50%-77%), comparable
to the semi-automatic segmentations (median: 70%, interquartile range 23%-76%).
To conclude, a fast and automatic seed point generator was developed, fully
automating a well-validated semi-automatic workflow for response monitoring of
breast cancer to neoadjuvant chemotherapy.
","[{'version': 'v1', 'created': 'Thu, 22 Nov 2018 09:02:41 GMT'}]",2019-04-04,"[['van der Velden', 'Bas H. M.', ''], ['de Vos', 'Bob D.', ''], ['Loo', 'Claudette E.', ''], ['Kuijf', 'Hugo J.', ''], ['Isgum', 'Ivana', ''], ['Gilhuijs', 'Kenneth G. A.', '']]","['Breast cancer', 'dynamic contrast-enhanced MRI', 'neoadjuvant chemotherapy', 'response monitoring', 'deep learning', 'machine learning', 'seed points', 'segmentation']"
3654,1907.09300,"J\""org Stork","J\""org Stork, Martin Zaefferer, Thomas Bartz-Beielstein, A. E. Eiben","Surrogate Models for Enhancing the Efficiency of Neuroevolution in
  Reinforcement Learning","This is the authors version of the work. It is posted here for your
  personal use. Not for redistribution. The definitive Version of Record was
  published in Genetic and Evolutionary Computation Conference (GECCO 2019)","2019, Genetic and Evolutionary Computation Conference (GECCO
  2019), Prague, Czech Republic. ACM, New York, NY, USA",10.1145/3321707.3321829,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last years, reinforcement learning received a lot of attention. One
method to solve reinforcement learning tasks is Neuroevolution, where neural
networks are optimized by evolutionary algorithms. A disadvantage of
Neuroevolution is that it can require numerous function evaluations, while not
fully utilizing the available information from each fitness evaluation. This is
especially problematic when fitness evaluations become expensive. To reduce the
cost of fitness evaluations, surrogate models can be employed to partially
replace the fitness function. The difficulty of surrogate modeling for
Neuroevolution is the complex search space and how to compare different
networks. To that end, recent studies showed that a kernel based approach,
particular with phenotypic distance measures, works well. These kernels compare
different networks via their behavior (phenotype) rather than their topology or
encoding (genotype). In this work, we discuss the use of surrogate model-based
Neuroevolution (SMB-NE) using a phenotypic distance for reinforcement learning.
In detail, we investigate a) the potential of SMB-NE with respect to evaluation
efficiency and b) how to select adequate input sets for the phenotypic distance
measure in a reinforcement learning problem. The results indicate that we are
able to considerably increase the evaluation efficiency using dynamic input
sets.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2019 13:14:23 GMT'}]",2019-07-23,"[['Stork', 'Jörg', ''], ['Zaefferer', 'Martin', ''], ['Bartz-Beielstein', 'Thomas', ''], ['Eiben', 'A. E.', '']]","['Neuroevolution', 'Surrogate Models', 'Reinforcement Learning']"
3655,1705.10621,Vincent Labatut,"Vincent Labatut (LIA), G\""unce Keziban Orman",Community Structure Characterization,,"Encyclopedia of Social Network Analysis and Mining, 2nd Edition,
  Springer, 2017",10.1007/978-1-4614-7163-9_110151-1,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This entry discusses the problem of describing some communities identified in
a complex network of interest, in a way allowing to interpret them. We suppose
the community structure has already been detected through one of the many
methods proposed in the literature. The question is then to know how to extract
valuable information from this first result, in order to allow human
interpretation. This requires subsequent processing, which we describe in the
rest of this entry.
","[{'version': 'v1', 'created': 'Tue, 30 May 2017 13:32:16 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Apr 2018 08:46:52 GMT'}]",2018-05-18,"[['Labatut', 'Vincent', '', 'LIA'], ['Orman', 'Günce Keziban', '']]","['Community Structure', 'Community Features', 'Mesoscale Characterization', 'Cluster Description', 'Community Evolution', 'Attributed Networks', 'Dynamic Networks']"
3656,2102.06950,Hui Li,"Si Chen, Yuqiu Qian, Hui Li, Chen Lin","Sequential Recommendation in Online Games with Multiple Sequences, Tasks
  and User Levels",Accepted in SSTD'21,,10.1145/3469830.3470906,,cs.AI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online gaming is growing faster than ever before, with increasing challenges
of providing better user experience. Recommender systems (RS) for online games
face unique challenges since they must fulfill players' distinct desires, at
different user levels, based on their action sequences of various action types.
Although many sequential RS already exist, they are mainly single-sequence,
single-task, and single-user-level. In this paper, we introduce a new
sequential recommendation model for multiple sequences, multiple tasks, and
multiple user levels (abbreviated as M$^3$Rec) in Tencent Games platform, which
can fully utilize complex data in online games. We leverage Graph Neural
Network and multi-task learning to design M$^3$Rec in order to model the
complex information in the heterogeneous sequential recommendation scenario of
Tencent Games. We verify the effectiveness of M$^3$Rec on three online games of
Tencent Games platform, in both offline and online evaluations. The results
show that M$^3$Rec successfully addresses the challenges of recommendation in
online games, and it generates superior recommendations compared with
state-of-the-art sequential recommendation approaches.
","[{'version': 'v1', 'created': 'Sat, 13 Feb 2021 16:02:14 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Jun 2021 13:16:16 GMT'}]",2021-06-22,"[['Chen', 'Si', ''], ['Qian', 'Yuqiu', ''], ['Li', 'Hui', ''], ['Lin', 'Chen', '']]","['online games', 'sequential recommender systems', 'multi-task learning', 'graph neural network']"
3657,1507.05272,Emilia Oikarinen,"Laura Koponen and Emilia Oikarinen and Tomi Janhunen and Laura
  S\""ail\""a",Optimizing Phylogenetic Supertrees Using Answer Set Programming,"To appear in Theory and Practice of Logic Programming (TPLP),
  Proceedings of ICLP 2015",Theory and Practice of Logic Programming 15 (2015) 604-619,10.1017/S1471068415000265,,cs.CE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The supertree construction problem is about combining several phylogenetic
trees with possibly conflicting information into a single tree that has all the
leaves of the source trees as its leaves and the relationships between the
leaves are as consistent with the source trees as possible. This leads to an
optimization problem that is computationally challenging and typically
heuristic methods, such as matrix representation with parsimony (MRP), are
used. In this paper we consider the use of answer set programming to solve the
supertree construction problem in terms of two alternative encodings. The first
is based on an existing encoding of trees using substructures known as
quartets, while the other novel encoding captures the relationships present in
trees through direct projections. We use these encodings to compute a
genus-level supertree for the family of cats (Felidae). Furthermore, we compare
our results to recent supertrees obtained by the MRP method.
","[{'version': 'v1', 'created': 'Sun, 19 Jul 2015 10:19:08 GMT'}]",2020-02-19,"[['Koponen', 'Laura', ''], ['Oikarinen', 'Emilia', ''], ['Janhunen', 'Tomi', ''], ['Säilä', 'Laura', '']]","['answer set programming', 'phylogenetic supertree', 'quartets', 'projections', 'Felidae']"
3658,1306.2069,{\L}ukasz Czajka,{\L}ukasz Czajka,Confluence of an extension of Combinatory Logic by Boolean constants,,,10.4230/LIPIcs.FSCD.2017.14,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show confluence of a conditional term rewriting system CL-pc${}^1$, which
is an extension of Combinatory Logic by Boolean constants. This solves problem
15 from the RTA list of open problems. The proof has been fully formalised in
the Coq proof assistant.
","[{'version': 'v1', 'created': 'Sun, 9 Jun 2013 22:31:13 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Aug 2015 16:13:49 GMT'}, {'version': 'v3', 'created': 'Fri, 10 Mar 2017 15:24:26 GMT'}, {'version': 'v4', 'created': 'Fri, 7 Jul 2017 14:43:40 GMT'}]",2017-07-10,"[['Czajka', 'Łukasz', '']]","['combinatory logic', 'conditional linearization', 'unique normal form property', 'confluence']"
3659,1807.07356,Guotai Wang,"Guotai Wang, Wenqi Li, Michael Aertsen, Jan Deprest, Sebastien
  Ourselin, Tom Vercauteren","Aleatoric uncertainty estimation with test-time augmentation for medical
  image segmentation with convolutional neural networks","13 pages, 8 figures, accepted by NeuroComputing",,10.1016/j.neucom.2019.01.103,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the state-of-the-art performance for medical image segmentation, deep
convolutional neural networks (CNNs) have rarely provided uncertainty
estimations regarding their segmentation outputs, e.g., model (epistemic) and
image-based (aleatoric) uncertainties. In this work, we analyze these different
types of uncertainties for CNN-based 2D and 3D medical image segmentation
tasks. We additionally propose a test-time augmentation-based aleatoric
uncertainty to analyze the effect of different transformations of the input
image on the segmentation output. Test-time augmentation has been previously
used to improve segmentation accuracy, yet not been formulated in a consistent
mathematical framework. Hence, we also propose a theoretical formulation of
test-time augmentation, where a distribution of the prediction is estimated by
Monte Carlo simulation with prior distributions of parameters in an image
acquisition model that involves image transformations and noise. We compare and
combine our proposed aleatoric uncertainty with model uncertainty. Experiments
with segmentation of fetal brains and brain tumors from 2D and 3D Magnetic
Resonance Images (MRI) showed that 1) the test-time augmentation-based
aleatoric uncertainty provides a better uncertainty estimation than calculating
the test-time dropout-based model uncertainty alone and helps to reduce
overconfident incorrect predictions, and 2) our test-time augmentation
outperforms a single-prediction baseline and dropout-based multiple
predictions.
","[{'version': 'v1', 'created': 'Thu, 19 Jul 2018 11:58:14 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Jul 2018 08:26:59 GMT'}, {'version': 'v3', 'created': 'Thu, 31 Jan 2019 06:07:11 GMT'}]",2019-02-12,"[['Wang', 'Guotai', ''], ['Li', 'Wenqi', ''], ['Aertsen', 'Michael', ''], ['Deprest', 'Jan', ''], ['Ourselin', 'Sebastien', ''], ['Vercauteren', 'Tom', '']]","['Uncertainty estimation', 'convolutional neural networks', 'medical image segmentation', 'data augmentation']"
3660,1309.2078,Pedro Neto,"Pedro Neto, Nuno Mendes",Direct off-line robot programming via a common CAD package,,"Robotics and Autonomous Systems, Vol. 61, No. 8, pp. 896-910, 2013",10.1016/j.robot.2013.02.005,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper focuses on intuitive and direct off-line robot programming from a
CAD drawing running on a common 3-D CAD package. It explores the most suitable
way to represent robot motion in a CAD drawing, how to automatically extract
such motion data from the drawing, make the mapping of data from the virtual
(CAD model) to the real environment and the process of automatic generation of
robot paths/programs. In summary, this study aims to present a novel CAD-based
robot programming system accessible to anyone with basic knowledge of CAD and
robotics. Experiments on different manipulation tasks show the effectiveness
and versatility of the proposed approach.
","[{'version': 'v1', 'created': 'Mon, 9 Sep 2013 09:20:49 GMT'}]",2013-09-10,"[['Neto', 'Pedro', ''], ['Mendes', 'Nuno', '']]","['Robot Programming', 'CAD', 'Off-Line', 'Drawings']"
3661,1305.2966,Ali Shokouhi rostami,"Mostafa Azami, Manij Ranjbar, Ali Shokouhi rostami, Amir Jahani Amiri","Increasing the Network life Time by Simulated Annealing Algorithm in WSN
  with Point Coverage","15 pages, 8 figures","International Journal of Ad hoc, Sensor & Ubiquitous Computing (
  IJASUC ), 4(2), 31-45, 2013",10.5121/ijasuc.2013.4203,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  Since we are not able to replace the battery in a wireless sensor networks
(WSNs), the issues of energy and lifetime are the most important parameters. In
asymmetrical networks, different sensors with various abilities are used. Super
nodes, with higher power and wider range of communication in comparison with
common sensors, are used to cause connectivity and transmit data to base
stations in these networks. It is crucial to select the parameters of fit
function and monitoring sensors optimally in a point covering network. In this
paper, we utilized an algorithm to select monitoring sensors. The selection is
done by using a novel algorithm that used by simulated annealing. This
selection takes remained energy into consideration. This method increases
lifetime, decreases and balances energy consumption as confirmed by simulation
results.
","[{'version': 'v1', 'created': 'Mon, 13 May 2013 22:14:20 GMT'}]",2013-05-15,"[['Azami', 'Mostafa', ''], ['Ranjbar', 'Manij', ''], ['rostami', 'Ali Shokouhi', ''], ['Amiri', 'Amir Jahani', '']]","['Asymmetrical Sensor Networks', 'Energy', 'Lifetime']"
3662,1803.08097,Jinghui Cheng,"Jinghui Cheng, Micayla Goodrum, Ronald Metoyer, Jane Cleland-Huang","How Do Practitioners Perceive Assurance Cases in Safety-Critical
  Software Systems?",,,10.1145/3195836.3195838,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Safety-critical software systems are those whose failure or malfunction could
result in casualty and/or serious financial loss. In such systems, safety
assurance cases (SACs) are an emerging approach that adopts a proactive
strategy to produce structuralized safety justifications and arguments. While
SACs are recommended in many software-intensive safety-critical domains, the
lack of knowledge regarding the practitioners' perspectives on using SACs
hinders effective adoption of this approach. To gain such knowledge, we
interviewed nine practitioners and safety experts who focused on
safety-critical software systems. In general, our participants found the SAC
approach beneficial for communication of safety arguments and management of
safety issues in a multidisciplinary setting. The challenges they faced when
using SACs were primarily associated with (1) a lack of tool support, (2)
insufficient process integration, and (3) scarcity of experienced personnel. To
overcome those challenges, our participants suggested tactics that focused on
creating direct safety arguments. Process and organizational adjustments are
also needed to streamline SAC analysis and creation. Finally, our participants
emphasized the importance of knowledge sharing about SACs across
software-intensive safety-critical domains.
","[{'version': 'v1', 'created': 'Wed, 21 Mar 2018 19:25:24 GMT'}]",2018-03-23,"[['Cheng', 'Jinghui', ''], ['Goodrum', 'Micayla', ''], ['Metoyer', 'Ronald', ''], ['Cleland-Huang', 'Jane', '']]","['Safety-critical systems', 'safety assurance case', 'practitioner perspectives', 'empirical study']"
3663,1002.2897,Raphael Chenouard,"Raphael Chenouard (LINA), Laurent Granvilliers (LINA), Ricardo Soto
  (LINA)",Model-Driven Constraint Programming,,"International Conference on Principles and Practice of Declarative
  Programming, Valence : Spain (2008)",10.1145/1389449.1389479,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Constraint programming can definitely be seen as a model-driven paradigm. The
users write programs for modeling problems. These programs are mapped to
executable models to calculate the solutions. This paper focuses on efficient
model management (definition and transformation). From this point of view, we
propose to revisit the design of constraint-programming systems. A model-driven
architecture is introduced to map solving-independent constraint models to
solving-dependent decision models. Several important questions are examined,
such as the need for a visual highlevel modeling language, and the quality of
metamodeling techniques to implement the transformations. A main result is the
s-COMMA platform that efficiently implements the chain from modeling to solving
constraint problems
","[{'version': 'v1', 'created': 'Mon, 15 Feb 2010 15:47:29 GMT'}]",2010-02-16,"[['Chenouard', 'Raphael', '', 'LINA'], ['Granvilliers', 'Laurent', '', 'LINA'], ['Soto', 'Ricardo', '', 'LINA']]","['Constraint Modeling Languages', 'Constraint Programming', 'Metamodeling', 'Model Transformation']"
3664,1902.01821,Giuseppe Ng,Giuseppe C. Ng,"A Study of an Agile Methodology with Scrum Approach to the Filipino
  Company-Sponsored I.T. Capstone Program",,"International Journal of Computing Sciences Research (ISSN print:
  2546-0552; ISSN online: 2546-115X) Vol. 2, No. 2, 2018",10.25147/ijcsr.2017.001.1.25,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Purpose - The research aims to show the relevance of company client sponsored
student projects in the University of Asia and the Pacific Information
Technology (UA&P IT) Capstone Program through the use ofan Agile Methodology
with Scrum Approach. Method - The modified program is employed on two batches
with content analysis and survey results as benchmarks. Results - Surveys at
the end of the sprints for both clients and students revealed that the length
of the sprint was a critical factor in the development of the information
system, and that students learned from addressing additional challenges such as
academic load, team pressure and communication issues. Conclusion - Over-all
results showed that clients were impressed and keen to adopt the student works.
Recommendations - Maintainability aspects of the research can be analyzed for
future studies. Increasing the sample size with additional batches could lead
to discovery of additional factors not previously seen. Research Implications -
The research could help improve other Capstone Programs while improving
communication with company clients.
","[{'version': 'v1', 'created': 'Mon, 4 Feb 2019 03:09:36 GMT'}]",2019-02-06,"[['Ng', 'Giuseppe C.', '']]","['Agile', 'Company Client Sponsored Student Projects', 'Scrum', 'Sprint', 'Capstone Program   INTRODUCTION']"
3665,1907.06836,Arash Dargahi Nobari,"Arash Dargahi Nobari, Mahmood Neshati and Sajad Sotudeh Gharebagh","Quality-aware skill translation models for expert finding on
  StackOverflow","Published in Information Systems journal, volume 87","Information Systems, Volume 87, 2020",10.1016/j.is.2019.07.003,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  StackOverflow has become an emerging resource for talent recognition in
recent years. While users exploit technical language on StackOverflow,
recruiters try to find the relevant candidates for jobs using their own
terminology. This procedure implies a gap which exists between recruiters and
candidates terms. Due to this gap, the state-of-the-art expert finding models
cannot effectively address the expert finding problem on StackOverflow. We
propose two translation models to bridge this gap. The first approach is a
statistical method and the second is based on word embedding approach.
Utilizing several translations for a given query during the scoring step, the
result of each intermediate query is blended together to obtain the final
ranking. Here, we propose a new approach which takes the quality of documents
into account in scoring step. We have made several observations to visualize
the effectiveness of the translation approaches and also the quality-aware
scoring approach. Our experiments indicate the following: First, while
statistical and word embedding translation approaches provide different
translations for each query, both can considerably improve the recall. Besides,
the quality-aware scoring approach can improve the precision remarkably.
Finally, our best proposed method can improve the MAP measure up to 46% on
average, in comparison with the state-of-the-art expert finding approach.
","[{'version': 'v1', 'created': 'Tue, 16 Jul 2019 04:45:49 GMT'}]",2019-07-17,"[['Nobari', 'Arash Dargahi', ''], ['Neshati', 'Mahmood', ''], ['Gharebagh', 'Sajad Sotudeh', '']]","['Expertise Retrieval', 'Statistical Machine Translation', 'Semantic Matching', 'StackOverflow', 'Expert Finding', 'Word Embedding']"
3666,1401.3973,Joan Serr\`a,Joan Serr\`a and Josep Lluis Arcos,"An Empirical Evaluation of Similarity Measures for Time Series
  Classification","28 pages, 5 figures, 3 tables","Knowledge-Based Systems 67: 305-314, 2014",10.1016/j.knosys.2014.04.035,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Time series are ubiquitous, and a measure to assess their similarity is a
core part of many computational systems. In particular, the similarity measure
is the most essential ingredient of time series clustering and classification
systems. Because of this importance, countless approaches to estimate time
series similarity have been proposed. However, there is a lack of comparative
studies using empirical, rigorous, quantitative, and large-scale assessment
strategies. In this article, we provide an extensive evaluation of similarity
measures for time series classification following the aforementioned
principles. We consider 7 different measures coming from alternative measure
`families', and 45 publicly-available time series data sets coming from a wide
variety of scientific domains. We focus on out-of-sample classification
accuracy, but in-sample accuracies and parameter choices are also discussed.
Our work is based on rigorous evaluation methodologies and includes the use of
powerful statistical significance tests to derive meaningful conclusions. The
obtained results show the equivalence, in terms of accuracy, of a number of
measures, but with one single candidate outperforming the rest. Such findings,
together with the followed methodology, invite researchers on the field to
adopt a more consistent evaluation criteria and a more informed decision
regarding the baseline measures to which new developments should be compared.
","[{'version': 'v1', 'created': 'Thu, 16 Jan 2014 10:21:44 GMT'}]",2016-05-18,"[['Serrà', 'Joan', ''], ['Arcos', 'Josep Lluis', '']]","['Time Series', 'Similarity', 'Classification', 'Evaluation']"
3667,1505.00412,Gonzalo Galiano,Gonzalo Galiano and Juli\'an Velasco,"On a fast bilateral filtering formulation using functional
  rearrangements","29 pages, Journal of Mathematical Imaging and Vision, 2015. arXiv
  admin note: substantial text overlap with arXiv:1406.7128",,10.1007/s10851-015-0583-y,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce an exact reformulation of a broad class of neighborhood filters,
among which the bilateral filters, in terms of two functional rearrangements:
the decreasing and the relative rearrangements.
  Independently of the image spatial dimension (one-dimensional signal, image,
volume of images, etc.), we reformulate these filters as integral operators
defined in a one-dimensional space corresponding to the level sets measures.
  We prove the equivalence between the usual pixel-based version and the
rearranged version of the filter. When restricted to the discrete setting, our
reformulation of bilateral filters extends previous results for the so-called
fast bilateral filtering. We, in addition, prove that the solution of the
discrete setting, understood as constant-wise interpolators, converges to the
solution of the continuous setting.
  Finally, we numerically illustrate computational aspects concerning quality
approximation and execution time provided by the rearranged formulation.
","[{'version': 'v1', 'created': 'Sun, 3 May 2015 09:50:33 GMT'}]",2015-05-05,"[['Galiano', 'Gonzalo', ''], ['Velasco', 'Julián', '']]","['Neighborhood filters', 'bilateral filter', 'decreasing rearrangement', 'relative rearrangement', 'denoising']"
3668,1610.09516,Sanjaya Wijeratne,"Lakshika Balasuriya, Sanjaya Wijeratne, Derek Doran, Amit Sheth",Finding Street Gang Members on Twitter,"8 pages, 9 figures, 2 tables, Published as a full paper at 2016
  IEEE/ACM International Conference on Advances in Social Networks Analysis and
  Mining (ASONAM 2016)","The 2016 IEEE/ACM Int. Conf. on Advances in Social Networks
  Analysis and Mining. vol. 8, pp. 685-692. San Francisco, CA, USA (2016)",,,cs.SI cs.CL cs.CY cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most street gang members use Twitter to intimidate others, to present
outrageous images and statements to the world, and to share recent illegal
activities. Their tweets may thus be useful to law enforcement agencies to
discover clues about recent crimes or to anticipate ones that may occur.
Finding these posts, however, requires a method to discover gang member Twitter
profiles. This is a challenging task since gang members represent a very small
population of the 320 million Twitter users. This paper studies the problem of
automatically finding gang members on Twitter. It outlines a process to curate
one of the largest sets of verifiable gang member profiles that have ever been
studied. A review of these profiles establishes differences in the language,
images, YouTube links, and emojis gang members use compared to the rest of the
Twitter population. Features from this review are used to train a series of
supervised classifiers. Our classifier achieves a promising F1 score with a low
false positive rate.
","[{'version': 'v1', 'created': 'Sat, 29 Oct 2016 14:30:57 GMT'}]",2016-11-01,"[['Balasuriya', 'Lakshika', ''], ['Wijeratne', 'Sanjaya', ''], ['Doran', 'Derek', ''], ['Sheth', 'Amit', '']]","['Street Gangs', 'Twitter Profile Identification', 'GangActivity Understanding', 'Social Media Analysis']"
3669,1808.10594,Benjamin Lucas,"Benjamin Lucas, Ahmed Shifaz, Charlotte Pelletier, Lachlan O'Neill,
  Nayyar Zaidi, Bart Goethals, Francois Petitjean, and Geoffrey I. Webb","Proximity Forest: An effective and scalable distance-based classifier
  for time series","30 pages, 12 figures",,10.1007/s10618-019-00617-3,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Research into the classification of time series has made enormous progress in
the last decade. The UCR time series archive has played a significant role in
challenging and guiding the development of new learners for time series
classification. The largest dataset in the UCR archive holds 10 thousand time
series only; which may explain why the primary research focus has been in
creating algorithms that have high accuracy on relatively small datasets.
  This paper introduces Proximity Forest, an algorithm that learns accurate
models from datasets with millions of time series, and classifies a time series
in milliseconds. The models are ensembles of highly randomized Proximity Trees.
Whereas conventional decision trees branch on attribute values (and usually
perform poorly on time series), Proximity Trees branch on the proximity of time
series to one exemplar time series or another; allowing us to leverage the
decades of work into developing relevant measures for time series. Proximity
Forest gains both efficiency and accuracy by stochastic selection of both
exemplars and similarity measures.
  Our work is motivated by recent time series applications that provide orders
of magnitude more time series than the UCR benchmarks. Our experiments
demonstrate that Proximity Forest is highly competitive on the UCR archive: it
ranks among the most accurate classifiers while being significantly faster. We
demonstrate on a 1M time series Earth observation dataset that Proximity Forest
retains this accuracy on datasets that are many orders of magnitude greater
than those in the UCR repository, while learning its models at least 100,000
times faster than current state of the art models Elastic Ensemble and COTE.
","[{'version': 'v1', 'created': 'Fri, 31 Aug 2018 04:17:44 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Dec 2018 03:04:59 GMT'}]",2019-02-12,"[['Lucas', 'Benjamin', ''], ['Shifaz', 'Ahmed', ''], ['Pelletier', 'Charlotte', ''], [""O'Neill"", 'Lachlan', ''], ['Zaidi', 'Nayyar', ''], ['Goethals', 'Bart', ''], ['Petitjean', 'Francois', ''], ['Webb', 'Geoffrey I.', '']]","['time series classification', 'scalable classification', 'time-warpsimilarity measures', 'ensemble']"
3670,1907.07356,Andrew Adamatzky,"Alessandro Chiolerio and Thomas C. Draper and Richard Mayne and Andrew
  Adamatzky",On resistance switching and oscillations in tubulin microtubule droplets,,"J. Colloid Interface Sci., 2020, 560, 589-595",10.1016/j.jcis.2019.10.065,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study electrical properties of Taxol-stabilised microtubule (MT) ensembles
in a droplet of water. We demonstrate that the MT droplets act as electrical
switches. Also, a stimulation of a MT droplet with a positive fast impulse
causes oscillation of the droplet's resistance. The findings will pave a way
towards future designs of MT-based sensing and computing devices, including
data storage and featuring liquid state.
","[{'version': 'v1', 'created': 'Wed, 17 Jul 2019 06:27:47 GMT'}]",2021-05-12,"[['Chiolerio', 'Alessandro', ''], ['Draper', 'Thomas C.', ''], ['Mayne', 'Richard', ''], ['Adamatzky', 'Andrew', '']]","['Tubulin', 'Microtubules', 'Resistance switching', 'Oscillations', 'smartfluid systems']"
3671,1911.09534,Yunior Ram\'irez-Cruz,"Xihui Chen, Ema K\""epuska, Sjouke Mauw, Yunior Ram\'irez-Cruz","Active Re-identification Attacks on Periodically Released Dynamic Social
  Graphs",,"Computer Security - ESORICS 2020. Springer, Lecture Notes in
  Computer Science 12309, pp. 185-205, 2020",10.1007/978-3-030-59013-0_10,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Active re-identification attacks pose a serious threat to privacy-preserving
social graph publication. Active attackers create fake accounts to build
structural patterns in social graphs which can be used to re-identify
legitimate users on published anonymised graphs, even without additional
background knowledge. So far, this type of attacks has only been studied in the
scenario where the inherently dynamic social graph is published once. In this
paper, we present the first active re-identification attack in the more
realistic scenario where a dynamic social graph is periodically published. The
new attack leverages tempo-structural patterns for strengthening the adversary.
Through a comprehensive set of experiments on real-life and synthetic dynamic
social graphs, we show that our new attack substantially outperforms the most
effective static active attack in the literature by increasing the success
probability of re-identification by more than two times and efficiency by
almost 10 times. Moreover, unlike the static attack, our new attack is able to
remain at the same level of effectiveness and efficiency as the publication
process advances. We conduct a study on the factors that may thwart our new
attack, which can help design graph anonymising methods with a better balance
between privacy and utility.
","[{'version': 'v1', 'created': 'Thu, 21 Nov 2019 15:20:09 GMT'}]",2020-09-15,"[['Chen', 'Xihui', ''], ['Këpuska', 'Ema', ''], ['Mauw', 'Sjouke', ''], ['Ramírez-Cruz', 'Yunior', '']]","['privacy-preserving social graph publication', 're-identification attack', 'activeadversary', 'dynamic social networks']"
3672,2011.10653,Abe Leite,Abe Leite and Sa\'ul A. Blanco,"Effects of Human vs. Automatic Feedback on Students' Understanding of AI
  Concepts and Programming Style","Published in SIGCSE '20: Proceedings of the 51st ACM Technical
  Symposium on Computer Science Education","SIGCSE '20: Proceedings of the 51st ACM Technical Symposium on
  Computer Science Education (Feb 2020) 44-50",10.1145/3328778.3366921,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of automatic grading tools has become nearly ubiquitous in large
undergraduate programming courses, and recent work has focused on improving the
quality of automatically generated feedback. However, there is a relative lack
of data directly comparing student outcomes when receiving computer-generated
feedback and human-written feedback. This paper addresses this gap by splitting
one 90-student class into two feedback groups and analyzing differences in the
two cohorts' performance. The class is an intro to AI with programming HW
assignments. One group of students received detailed computer-generated
feedback on their programming assignments describing which parts of the
algorithms' logic was missing; the other group additionally received
human-written feedback describing how their programs' syntax relates to issues
with their logic, and qualitative (style) recommendations for improving their
code. Results on quizzes and exam questions suggest that human feedback helps
students obtain a better conceptual understanding, but analyses found no
difference between the groups' ability to collaborate on the final project. The
course grade distribution revealed that students who received human-written
feedback performed better overall; this effect was the most pronounced in the
middle two quartiles of each group. These results suggest that feedback about
the syntax-logic relation may be a primary mechanism by which human feedback
improves student outcomes.
","[{'version': 'v1', 'created': 'Fri, 20 Nov 2020 21:40:32 GMT'}]",2020-11-24,"[['Leite', 'Abe', ''], ['Blanco', 'Saúl A.', '']]","['automatic grading', 'student outcomes', 'feedback', 'references to syntax', 'programming style', 'syntax-logic relation']"
3673,1912.00766,Tim Ziemer,Tim Ziemer and Holger Schultheis,Three Orthogonal Dimensions for Psychoacoustic Sonification,"Keywords: Auditory Display, Audition, Noise/acoustics, Sound Design,
  Interpretability",,10.21785/icad2019.018,,cs.SD eess.AS q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Objective: Three perceptually orthogonal auditory dimensions for
multidimensional and multivariate data sonification are identified and
experimentally validated. Background: Psychoacoustic investigations have shown
that orthogonal acoustical parameters may interfere perceptually. The
literature hardly offers any solutions to this problem, and previous auditory
display approaches have failed to implement auditory dimensions that are
perceived orthogonally by a user. In this study we demonstrate how a location
in three-dimensional space can be sonified unambiguously by the implementation
of perceptually orthogonal psychoacoustic attributes in monophonic playback.
Method: Perceptually orthogonal auditory attributes are identified from
literature research and experience in music and psychoacoustic research. We
carried out an experiment with 21 participants who identified sonified
locations in two-dimensional space. Results: With just 5 minutes of explanation
and exploration, naive users can interpret our multidimensional sonification
with high accuracy. Conclusion: We identified a set of perceptually orthogonal
auditory dimensions suitable for three-dimensional data sonification.
Application: Three-dimensional data sonification promises blind navigation,
e.g. for unmanned vehicles, and reliable real-time monitoring of multivariate
data, e.g., in the patient care sector.
","[{'version': 'v1', 'created': 'Thu, 28 Nov 2019 13:19:50 GMT'}]",2020-01-22,"[['Ziemer', 'Tim', ''], ['Schultheis', 'Holger', '']]","['Auditory Display', 'Audition', 'Noise/acoustics', 'Sound Design', 'Interpretability']"
3674,1805.11166,Hugo Jair  Escalante,"Miguel A. Alvarez-Carmona, Luis Pellegrin, Manuel Montes-y-G\'omez,
  Fernando S\'anchez-Vega, Hugo Jair Escalante, A. Pastor L\'opez-Monroy, Luis
  Villase\~nor-Pineda, Esa\'u Villatoro-Tello",A visual approach for age and gender identification on Twitter,,"Miguel A. Alvarez-Carmona, Luis Pellegrin et al. A visual approach
  for age and gender identification on Twitter. Journal of Intelligent and
  Fuzzy Systems, vol. 34, no. 5, pp. 3133-3145, 2018",10.3233/JIFS-169497,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The goal of Author Profiling (AP) is to identify demographic aspects (e.g.,
age, gender) from a given set of authors by analyzing their written texts.
Recently, the AP task has gained interest in many problems related to computer
forensics, psychology, marketing, but specially in those related with social
media exploitation. As known, social media data is shared through a wide range
of modalities (e.g., text, images and audio), representing valuable information
to be exploited for extracting valuable insights from users. Nevertheless, most
of the current work in AP using social media data has been devoted to analyze
textual information only, and there are very few works that have started
exploring the gender identification using visual information. Contrastingly,
this paper focuses in exploiting the visual modality to perform both age and
gender identification in social media, specifically in Twitter. Our goal is to
evaluate the pertinence of using visual information in solving the AP task.
Accordingly, we have extended the Twitter corpus from PAN 2014, incorporating
posted images from all the users, making a distinction between tweeted and
retweeted images. Performed experiments provide interesting evidence on the
usefulness of visual information in comparison with traditional textual
representations for the AP task.
","[{'version': 'v1', 'created': 'Mon, 28 May 2018 20:31:18 GMT'}]",2018-05-30,"[['Alvarez-Carmona', 'Miguel A.', ''], ['Pellegrin', 'Luis', ''], ['Montes-y-Gómez', 'Manuel', ''], ['Sánchez-Vega', 'Fernando', ''], ['Escalante', 'Hugo Jair', ''], ['López-Monroy', 'A. Pastor', ''], ['Villaseñor-Pineda', 'Luis', ''], ['Villatoro-Tello', 'Esaú', '']]","['Visual author profiling', 'age identification', 'gender identification', 'social media', 'twitter', 'CNN representation']"
3675,1902.01990,Milad Afzalan,"Milad Afzalan, Farrokh Jazizadeh",An Automated Spectral Clustering for Multi-scale Data,"Submitted to Neurocomputing, 2019",,10.1016/j.neucom.2019.03.008,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spectral clustering algorithms typically require a priori selection of input
parameters such as the number of clusters, a scaling parameter for the affinity
measure, or ranges of these values for parameter tuning. Despite efforts for
automating the process of spectral clustering, the task of grouping data in
multi-scale and higher dimensional spaces is yet to be explored. This study
presents a spectral clustering heuristic algorithm that obviates the need for
an input by estimating the parameters from the data itself. Specifically, it
introduces the heuristic of iterative eigengap search with (1) global scaling
and (2) local scaling. These approaches estimate the scaling parameter and
implement iterative eigengap quantification along a search tree to reveal
dissimilarities at different scales of a feature space and identify clusters.
The performance of these approaches has been tested on various real-world
datasets of power variation with multi-scale nature and gene expression. Our
findings show that iterative eigengap search with a PCA-based global scaling
scheme can discover different patterns with an accuracy of higher than 90% in
most cases without asking for a priori input information.
","[{'version': 'v1', 'created': 'Wed, 6 Feb 2019 00:57:08 GMT'}]",2019-03-20,"[['Afzalan', 'Milad', ''], ['Jazizadeh', 'Farrokh', '']]","['spectral clustering', 'multi-scale data', 'automated clustering', 'high-dimensional features', 'time-series', 'eigengap']"
3676,1611.03056,Amr Abed,"Amr S. Abed, Charles Clancy, David S. Levy",Intrusion Detection System for Applications using Linux Containers,"The final publication is available at
  http://link.springer.com/chapter/10.1007%2F978-3-319-24858-5_8. arXiv admin
  note: substantial text overlap with arXiv:1611.03053","STM 2015. LNCS, vol. 9331, pp. 123-135. Springer, Heidelberg
  (2015)",10.1007/978-3-319-24858-5_8,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linux containers are gaining increasing traction in both individual and
industrial use, and as these containers get integrated into mission-critical
systems, real-time detection of malicious cyber attacks becomes a critical
operational requirement. This paper introduces a real-time host-based intrusion
detection system that can be used to passively detect malfeasance against
applications within Linux containers running in a standalone or in a cloud
multi-tenancy environment. The demonstrated intrusion detection system uses
bags of system calls monitored from the host kernel for learning the behavior
of an application running within a Linux container and determining anomalous
container behavior. Performance of the approach using a database application
was measured and results are discussed.
","[{'version': 'v1', 'created': 'Wed, 9 Nov 2016 19:37:55 GMT'}]",2017-01-05,"[['Abed', 'Amr S.', ''], ['Clancy', 'Charles', ''], ['Levy', 'David S.', '']]","['Intrusion Detection', 'Anomaly Detection', 'System Call Monitoring', 'Container Security', 'Security in Cloud Computing']"
3677,1505.01818,Taha Yasseri,Taha Yasseri and Jonathan Bright,"Wikipedia traffic data and electoral prediction: towards theoretically
  informed models","submitted to EPJ Data Science. Additional File 1 available at
  https://drive.google.com/open?id=0BxaGC-YCTO6SWkJhRXlrMVRYVlE","EPJ Data Science, 5: 22 (2016)",10.1140/epjds/s13688-016-0083-3,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This aim of this article is to explore the potential use of Wikipedia page
view data for predicting electoral results. Responding to previous critiques of
work using socially generated data to predict elections, which have argued that
these predictions take place without any understanding of the mechanism which
enables them, we first develop a theoretical model which highlights why people
might seek information online at election time, and how this activity might
relate to overall electoral outcomes, focussing especially on how different
types of parties such as new and established parties might generate different
information seeking patterns. We test this model on a novel dataset drawn from
a variety of countries in the 2009 and 2014 European Parliament elections. We
show that while Wikipedia offers little insight into absolute vote outcomes, it
offers a good information about changes in both overall turnout at elections
and in vote share for particular parties. These results are used to enhance
existing theories about the drivers of aggregate patterns in online information
seeking.
","[{'version': 'v1', 'created': 'Tue, 5 May 2015 21:42:46 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Jul 2015 22:22:05 GMT'}, {'version': 'v3', 'created': 'Thu, 19 Nov 2015 21:29:46 GMT'}, {'version': 'v4', 'created': 'Fri, 22 Jan 2016 23:14:35 GMT'}]",2023-01-05,"[['Yasseri', 'Taha', ''], ['Bright', 'Jonathan', '']]","['Social Data', 'Elections', 'Prediction', 'Big Data', 'Wikipedia', 'Public Opinion']"
3678,1603.09660,Benjamin Marussig,"Benjamin Marussig, J\""urgen Zechner, Gernot Beer and Thomas-Peter
  Fries",Stable Isogeometric Analysis of Trimmed Geometries,,,10.1016/j.cma.2016.07.040,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore extended B-splines as a stable basis for isogeometric analysis
with trimmed parameter spaces. The stabilization is accomplished by an
appropriate substitution of B-splines that may lead to ill-conditioned system
matrices. The construction for non-uniform knot vectors is presented. The
properties of extended B-splines are examined in the context of interpolation,
potential, and linear elasticity problems and excellent results are attained.
The analysis is performed by an isogeometric boundary element formulation using
collocation. It is argued that extended B-splines provide a flexible and simple
stabilization scheme which ideally suits the isogeometric paradigm.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2016 16:19:05 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Jul 2016 16:43:01 GMT'}]",2017-04-05,"[['Marussig', 'Benjamin', ''], ['Zechner', 'Jürgen', ''], ['Beer', 'Gernot', ''], ['Fries', 'Thomas-Peter', '']]","['Isogeometric Analysis', 'Trimmed NURBS', 'Extended B-splines', 'Non-uniform', 'WEB-splines', 'Stabilization']"
3679,1608.07623,Matthew Wright,"Matthew A. Wright, Roberto Horowitz, Alex A. Kurzhanskiy",A dynamic system characterization of road network node models,"Appeared at NOLCOS 2016, 10th IFAC Symposium on Nonlinear Control
  Systems","IFAC-PapersOnLine, Volume 49, Issue 18, 2016, Pages 1054-1059",10.1016/j.ifacol.2016.10.307,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The propagation of traffic congestion along roads is a commonplace nonlinear
phenomenon. When many roads are connected in a network, congestion can spill
from one road to others as drivers queue to enter a congested road, creating
further nonlinearities in the network dynamics. This paper considers the node
model problem, which refers to methods for solving for cross-flows when roads
meet at a junction. We present a simple hybrid dynamic system that, given a
macroscopic snapshot of the roads entering and exiting a node, intuitively
models the node's throughflows over time. This dynamic system produces
solutions to the node model problem that are equal to those produced by many
popular node models without intuitive physical meanings. We also show how the
earlier node models can be rederived as executions of our dynamic system. The
intuitive physical description supplied by our system provides a base for
control of the road junction system dynamics, as well as the emergent network
dynamics.
","[{'version': 'v1', 'created': 'Fri, 26 Aug 2016 22:59:48 GMT'}]",2019-06-18,"[['Wright', 'Matthew A.', ''], ['Horowitz', 'Roberto', ''], ['Kurzhanskiy', 'Alex A.', '']]","['Hybrid systems', 'Road traffic', 'Transportation', 'Automata', 'Subsystems']"
3680,1806.01552,Jerome Darmont,"Ayb\""uk\""e Ozt\""urk (ERIC, ArAr), St\'ephane Lallich (ERIC),
  J\'er\^ome Darmont (ERIC)",A Visual Quality Index for Fuzzy C-Means,,"14th International Conference on Artificial Intelligence
  Applications and Innovations (AIAI 2018), May 2018, Rhodes, Greece. Springer,
  IFIP Advances in Information and Communication Technology, 519, pp.546-555,
  2018, http://easyconferences.eu/aiai2018/",10.1007/978-3-319-92007-8,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cluster analysis is widely used in the areas of machine learning and data
mining. Fuzzy clustering is a particular method that considers that a data
point can belong to more than one cluster. Fuzzy clustering helps obtain
flexible clusters, as needed in such applications as text categorization. The
performance of a clustering algorithm critically depends on the number of
clusters, and estimating the optimal number of clusters is a challenging task.
Quality indices help estimate the optimal number of clusters. However, there is
no quality index that can obtain an accurate number of clusters for different
datasets. Thence, in this paper, we propose a new cluster quality index
associated with a visual, graph-based solution that helps choose the optimal
number of clusters in fuzzy partitions. Moreover, we validate our theoretical
results through extensive comparison experiments against state-of-the-art
quality indices on a variety of numerical real-world and artificial datasets.
","[{'version': 'v1', 'created': 'Tue, 5 Jun 2018 08:27:40 GMT'}]",2018-06-06,"[['Oztürk', 'Aybükë', '', 'ERIC, ArAr'], ['Lallich', 'Stéphane', '', 'ERIC'], ['Darmont', 'Jérôme', '', 'ERIC']]","['Fuzzy Clustering', 'Fuzzy C-Means', 'Quality Indices', 'VisualIndex', 'Elbow Rule']"
3681,1808.00727,Christoph Redl,Christoph Redl,Inlining External Sources in Answer Set Programs,"Under consideration in Theory and Practice of Logic Programming
  (TPLP)",Theory and Practice of Logic Programming 19 (2019) 360-411,10.1017/S147106841800056X,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  HEX-programs are an extension of answer set programs (ASP) with external
sources. To this end, external atoms provide a bidirectional interface between
the program and an external source. The traditional evaluation algorithm for
HEX-programs is based on guessing truth values of external atoms and verifying
them by explicit calls of the external source. The approach was optimized by
techniques that reduce the number of necessary verification calls or speed them
up, but the remaining external calls are still expensive. In this paper we
present an alternative evaluation approach based on inlining of external atoms,
motivated by existing but less general approaches for specialized formalisms
such as DL-programs. External atoms are then compiled away such that no
verification calls are necessary. The approach is implemented in the dlvhex
reasoner. Experiments show a significant performance gain. Besides performance
improvements, we further exploit inlining for extending previous (semantic)
characterizations of program equivalence from ASP to HEX-programs, including
those of strong equivalence, uniform equivalence and H, B -equivalence.
Finally, based on these equivalence criteria, we characterize also
inconsistency of programs wrt. extensions. Since well-known ASP extensions
(such as constraint ASP) are special cases of HEX, the results are interesting
beyond the particular formalism. Under consideration in Theory and Practice of
Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Thu, 2 Aug 2018 09:32:20 GMT'}]",2020-02-19,"[['Redl', 'Christoph', '']]","['Answer Set Programming', 'External Computation', 'HEX-Programs', 'Inlining', 'Equivalence']"
3682,1112.6222,Rafi Muhammad,"Muhammad Rafi, M. Maujood, M. M. Fazal, S. M. Ali",A comparison of two suffix tree-based document clustering algorithms,"Information and Emerging Technologies (ICIET), 2010 International
  Conference",,10.1109/2010.5625688,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Document clustering as an unsupervised approach extensively used to navigate,
filter, summarize and manage large collection of document repositories like the
World Wide Web (WWW). Recently, focuses in this domain shifted from traditional
vector based document similarity for clustering to suffix tree based document
similarity, as it offers more semantic representation of the text present in
the document. In this paper, we compare and contrast two recently introduced
approaches to document clustering based on suffix tree data model. The first is
an Efficient Phrase based document clustering, which extracts phrases from
documents to form compact document representation and uses a similarity measure
based on common suffix tree to cluster the documents. The second approach is a
frequent word/word meaning sequence based document clustering, it similarly
extracts the common word sequence from the document and uses the common
sequence/ common word meaning sequence to perform the compact representation,
and finally, it uses document clustering approach to cluster the compact
documents. These algorithms are using agglomerative hierarchical document
clustering to perform the actual clustering step, the difference in these
approaches are mainly based on extraction of phrases, model representation as a
compact document, and the similarity measures used for clustering. This paper
investigates the computational aspect of the two algorithms, and the quality of
results they produced.
","[{'version': 'v1', 'created': 'Thu, 29 Dec 2011 04:25:10 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Jan 2012 15:40:29 GMT'}]",2012-01-11,"[['Rafi', 'Muhammad', ''], ['Maujood', 'M.', ''], ['Fazal', 'M. M.', ''], ['Ali', 'S. M.', '']]","['Document Clustering', 'Feature Extraction', 'Document Representation Model', 'Suffix Tree', 'Similarity Measure']"
3683,1811.11242,Gerrit van den Burg,"Gerrit J.J. van den Burg, Alfredo Nazabal, Charles Sutton",Wrangling Messy CSV Files by Detecting Row and Type Patterns,,"Data Mining and Knowledge Discovery (July, 2019)",10.1007/s10618-019-00646-y,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is well known that data scientists spend the majority of their time on
preparing data for analysis. One of the first steps in this preparation phase
is to load the data from the raw storage format. Comma-separated value (CSV)
files are a popular format for tabular data due to their simplicity and
ostensible ease of use. However, formatting standards for CSV files are not
followed consistently, so each file requires manual inspection and potentially
repair before the data can be loaded, an enormous waste of human effort for a
task that should be one of the simplest parts of data science. The first and
most essential step in retrieving data from CSV files is deciding on the
dialect of the file, such as the cell delimiter and quote character. Existing
dialect detection approaches are few and non-robust. In this paper, we propose
a dialect detection method based on a novel measure of data consistency of
parsed data files. Our method achieves 97% overall accuracy on a large corpus
of real-world CSV files and improves the accuracy on messy CSV files by almost
22% compared to existing approaches, including those in the Python standard
library.
","[{'version': 'v1', 'created': 'Tue, 27 Nov 2018 20:26:33 GMT'}]",2019-07-29,"[['Burg', 'Gerrit J. J. van den', ''], ['Nazabal', 'Alfredo', ''], ['Sutton', 'Charles', '']]","['Data Wrangling', 'Data Parsing', 'Comma Separated Values']"
3684,1006.3726,Daniel Lemire,"Hazel Webb, Daniel Lemire and Owen Kaser",Diamond Dicing,29 pages,"Data & Knowledge Engineering, Volume 86, July 2013, Pages 1-18",10.1016/j.datak.2013.01.001,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In OLAP, analysts often select an interesting sample of the data. For
example, an analyst might focus on products bringing revenues of at least 100
000 dollars, or on shops having sales greater than 400 000 dollars. However,
current systems do not allow the application of both of these thresholds
simultaneously, selecting products and shops satisfying both thresholds. For
such purposes, we introduce the diamond cube operator, filling a gap among
existing data warehouse operations.
  Because of the interaction between dimensions the computation of diamond
cubes is challenging. We compare and test various algorithms on large data sets
of more than 100 million facts. We find that while it is possible to implement
diamonds in SQL, it is inefficient. Indeed, our custom implementation can be a
hundred times faster than popular database engines (including a row-store and a
column-store).
","[{'version': 'v1', 'created': 'Fri, 18 Jun 2010 15:38:04 GMT'}, {'version': 'v2', 'created': 'Mon, 30 May 2011 16:48:25 GMT'}, {'version': 'v3', 'created': 'Wed, 16 Jan 2013 15:30:06 GMT'}, {'version': 'v4', 'created': 'Wed, 23 Jul 2014 19:18:35 GMT'}]",2014-07-25,"[['Webb', 'Hazel', ''], ['Lemire', 'Daniel', ''], ['Kaser', 'Owen', '']]","['OLAP', 'information retrieval', 'multidimensional queries']"
3685,1107.3212,Josef Urban,"Jesse Alama, Michael Kohlhase, Adam Naumowicz, Piotr Rudnicki, Josef
  Urban and Lionel Mamane",Licensing the Mizar Mathematical Library,"To appear in The Conference of Intelligent Computer Mathematics: CICM
  2011","Intelligent Computer Mathematics 2011, LNCS 6824, pp. 133-148",10.1007/978-3-642-22673-1_10,,cs.DL cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Mizar Mathematical Library (MML) is a large corpus of formalised
mathematical knowledge. It has been constructed over the course of many years
by a large number of authors and maintainers. Yet the legal status of these
efforts of the Mizar community has never been clarified. In 2010, after many
years of loose deliberations, the community decided to investigate the issue of
licensing the content of the MML, thereby clarifying and crystallizing the
status of the texts, the text's authors, and the library's long-term
maintainers. The community has settled on a copyright and license policy that
suits the peculiar features of Mizar and its community. In this paper we
discuss the copyright and license solutions. We offer our experience in the
hopes that the communities of other libraries of formalised mathematical
knowledge might take up the legal and scientific problems that we addressed for
Mizar.
","[{'version': 'v1', 'created': 'Sat, 16 Jul 2011 09:06:49 GMT'}]",2011-07-27,"[['Alama', 'Jesse', ''], ['Kohlhase', 'Michael', ''], ['Naumowicz', 'Adam', ''], ['Rudnicki', 'Piotr', ''], ['Urban', 'Josef', ''], ['Mamane', 'Lionel', '']]","['free culture', 'open data', 'free licensing', 'formal mathematics', 'mizar']"
3686,2102.08779,Emmanouil Papadogiannakis,"Emmanouil Papadogiannakis, Panagiotis Papadopoulos, Nicolas Kourtellis
  and Evangelos P. Markatos","User Tracking in the Post-cookie Era: How Websites Bypass GDPR Consent
  to Track Users","12 pages, Published at The Web Conference 2021 (WWW 2021). Please
  cite the WWW version; Made source code publicly available",,10.1145/3442381.3450056,,cs.CY cs.CR,http://creativecommons.org/licenses/by/4.0/,"  During the past few years, mostly as a result of the GDPR and the CCPA,
websites have started to present users with cookie consent banners. These
banners are web forms where the users can state their preference and declare
which cookies they would like to accept, if such option exists. Although
requesting consent before storing any identifiable information is a good start
towards respecting the user privacy, yet previous research has shown that
websites do not always respect user choices. Furthermore, considering the ever
decreasing reliance of trackers on cookies and actions browser vendors take by
blocking or restricting third-party cookies, we anticipate a world where
stateless tracking emerges, either because trackers or websites do not use
cookies, or because users simply refuse to accept any.
  In this paper, we explore whether websites use more persistent and
sophisticated forms of tracking in order to track users who said they do not
want cookies. Such forms of tracking include first-party ID leaking, ID
synchronization, and browser fingerprinting. Our results suggest that websites
do use such modern forms of tracking even before users had the opportunity to
register their choice with respect to cookies. To add insult to injury, when
users choose to raise their voice and reject all cookies, user tracking only
intensifies. As a result, users' choices play very little role with respect to
tracking: we measured that more than 75% of tracking activities happened before
users had the opportunity to make a selection in the cookie consent banner, or
when users chose to reject all cookies.
","[{'version': 'v1', 'created': 'Wed, 17 Feb 2021 14:11:10 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Feb 2022 15:22:35 GMT'}]",2022-02-11,"[['Papadogiannakis', 'Emmanouil', ''], ['Papadopoulos', 'Panagiotis', ''], ['Kourtellis', 'Nicolas', ''], ['Markatos', 'Evangelos P.', '']]","['User Tracking', 'GDPR', 'User Consent', 'Web fingerprinting']"
3687,1403.7048,Fabio Zanasi,"Filippo Bonchi, Pawel Sobocinski, Fabio Zanasi",Interacting Hopf Algebras,,,10.1016/j.jpaa.2016.06.002,,cs.LO math.CT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the theory IH of interacting Hopf algebras, parametrised over a
principal ideal domain R. The axioms of IH are derived using Lack's approach to
composing PROPs: they feature two Hopf algebra and two Frobenius algebra
structures on four different monoid-comonoid pairs. This construction is
instrumental in showing that IH is isomorphic to the PROP of linear relations
(i.e. subspaces) over the field of fractions of R.
","[{'version': 'v1', 'created': 'Thu, 27 Mar 2014 14:21:30 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Apr 2014 16:36:26 GMT'}, {'version': 'v3', 'created': 'Tue, 2 Dec 2014 18:15:42 GMT'}, {'version': 'v4', 'created': 'Wed, 11 Nov 2015 19:54:13 GMT'}]",2016-12-01,"[['Bonchi', 'Filippo', ''], ['Sobocinski', 'Pawel', ''], ['Zanasi', 'Fabio', '']]","['PROP', 'distributive law', 'Frobenius algebra', 'Hopf algebra', 'string diagram', 'linear algebra']"
3688,1405.3675,Marco Comini PhD,"Marco Comini, Laura Titolo, Alicia Villanueva",Abstract Diagnosis for tccp using a Linear Temporal Logic,,Theory and Practice of Logic Programming 14 (2014) 787-801,10.1017/S1471068414000349,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic techniques for program verification usually suffer the well-known
state explosion problem. Most of the classical approaches are based on browsing
the structure of some form of model (which represents the behavior of the
program) to check if a given specification is valid. This implies that a part
of the model has to be built, and sometimes the needed fragment is quite huge.
  In this work, we provide an alternative automatic decision method to check
whether a given property, specified in a linear temporal logic, is valid w.r.t.
a tccp program. Our proposal (based on abstract interpretation techniques) does
not require to build any model at all. Our results guarantee correctness but,
as usual when using an abstract semantics, completeness is lost.
","[{'version': 'v1', 'created': 'Wed, 14 May 2014 20:18:48 GMT'}]",2020-02-19,"[['Comini', 'Marco', ''], ['Titolo', 'Laura', ''], ['Villanueva', 'Alicia', '']]","['concurrent constraint paradigm', 'linear temporal logic', 'abstract diagnosis', 'decision procedures', 'program verification']"
3689,1805.00464,Shini Renjith,Shini Renjith,"Detection of Fraudulent Sellers in Online Marketplaces using Support
  Vector Machine Approach","6 pages, 9 figures, Published with International Journal of
  Engineering Trends and Technology (IJETT)","IJETT, V57(1),48-53 March 2018. ISSN:2231-5381.
  www.ijettjournal.org",10.14445/22315381/IJETT-V57P210,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The e-commerce share in the global retail spend is showing a steady increase
over the years indicating an evident shift of consumer attention from bricks
and mortar to clicks in retail sector. In recent years, online marketplaces
have become one of the key contributors to this growth. As the business model
matures, the number and types of frauds getting reported in the area is also
growing on a daily basis. Fraudulent e-commerce buyers and their transactions
are being studied in detail and multiple strategies to control and prevent them
are discussed. Another area of fraud happening in marketplaces are on the
seller side and is called merchant fraud. Goods/services offered and sold at
cheap rates, but never shipped is a simple example of this type of fraud. This
paper attempts to suggest a framework to detect such fraudulent sellers with
the help of machine learning techniques. The model leverages the historic data
from the marketplace and detect any possible fraudulent behaviours from sellers
and alert to the marketplace.
","[{'version': 'v1', 'created': 'Tue, 17 Apr 2018 05:35:19 GMT'}]",2018-05-02,"[['Renjith', 'Shini', '']]","['Online Marketplace', 'Fraud Detection', 'Machine Learning', 'Supervised Learning', 'Support Vector Machines']"
3690,0908.2578,Alain Gerard,"Claudiu-Florinel Bisu (MPS), Jean-Yves K'Nevez (LMP), Philippe Darnis
  (LGM2B), Raynald Laheurte (LMP), Alain G\'erard (LMP)",New method to characterize a machining system: application in turning,,"Int. J. of Mat. Form. 2, 2 (2009) 93-105",10.1007/s12289-009-0395-y,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many studies simulates the machining process by using a single degree of
freedom spring-mass sytem to model the tool stiffness, or the workpiece
stiffness, or the unit tool-workpiece stiffness in modelings 2D. Others impose
the tool action, or use more or less complex modelings of the efforts applied
by the tool taking account the tool geometry. Thus, all these models remain
two-dimensional or sometimes partially three-dimensional. This paper aims at
developing an experimental method allowing to determine accurately the real
three-dimensional behaviour of a machining system (machine tool, cutting tool,
tool-holder and associated system of force metrology six-component
dynamometer). In the work-space model of machining, a new experimental
procedure is implemented to determine the machining system elastic behaviour.
An experimental study of machining system is presented. We propose a machining
system static characterization. A decomposition in two distinct blocks of the
system ""Workpiece-Tool-Machine"" is realized. The block Tool and the block
Workpiece are studied and characterized separately by matrix stiffness and
displacement (three translations and three rotations). The Castigliano's theory
allows us to calculate the total stiffness matrix and the total displacement
matrix. A stiffness center point and a plan of tool tip static displacement are
presented in agreement with the turning machining dynamic model and especially
during the self induced vibration. These results are necessary to have a good
three-dimensional machining system dynamic characterization.
","[{'version': 'v1', 'created': 'Tue, 18 Aug 2009 14:29:42 GMT'}]",2009-08-19,"[['Bisu', 'Claudiu-Florinel', '', 'MPS'], [""K'Nevez"", 'Jean-Yves', '', 'LMP'], ['Darnis', 'Philippe', '', 'LGM2B'], ['Laheurte', 'Raynald', '', 'LMP'], ['Gérard', 'Alain', '', 'LMP']]","['experimental model', 'displacement plan', 'self-excited vibrations', 'turning}']"
3691,1406.5946,Jan Broekaert,"Lorena P\'erez-Garc\'ia, Jan Broekaert and Nicole Note",Is a `Wirikuta empowerment' of the Huichol measurable on the Internet?,"14 pages, 1 figure, 4 graphs (submitted to journal)","Internet Research, 26, 5, 1269 - 1290 (2016)",10.1108/IntR-07-2014-0185,,cs.SI cs.CY cs.IR physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current social and activist movements find the opportunity in social media to
effectively impact on the agenda of governing bodies and create `global'
perceptions -- it is often claimed. Content related to the social and activist
movements is online, to be accessed, supported or disputed and distributed from
virtually anywhere at any time, in the public sphere of the Internet. This
activity allows the enlargement of social movements and would increase the
empowerment in the concerned communities. The aim of this explorative study is
to assess whether the temporal evolution of the Normalised Web Distance (NWD)
--as defined by Cilibrasi & Vit\'anyi (2007)-- between identifying terms
concerning this activism could be used to measure the progress or decline of
social empowerment through the Internet. The NWD relies on the page count
number of single and joint queries, which in our study have been registered
using a freely available web browser (e.g. Google Search) providing a time
search window for temporal query results. To explore this meta-data technique,
we introduce the case of a perceived Wirikuta online movement, which originated
in Mexico with the aim to protect the Huichols' sacred land and water resources
from open mining projects for silver ore. We conducted a small scale Internet
study relating the key terms `Wirikuta', `Huichol', and `Wixarika' and their
co-occurrence with seven positive qualifiers (e.g. `sacred land'), five
negative qualifiers (e.g. `violence') and one neutral qualifier (`table') over
time, annually from 1994 till 2013. We confirm close semantic clustering over
time of traditional indigeneous identity terms of the Huichol, and observe a
slight convergence of key terms to `mines' and less pronounced to `sacred land'
and a divergence with respect to `ancestors' indicating a complex image of a
tendency of empowerment.
","[{'version': 'v1', 'created': 'Mon, 23 Jun 2014 15:32:14 GMT'}]",2016-12-07,"[['Pérez-García', 'Lorena', ''], ['Broekaert', 'Jan', ''], ['Note', 'Nicole', '']]","['ICT', 'social empowerment', 'Normalized Web Distance', 'temporal evolution']"
3692,1309.7009,S. Alireza Banani Dr.,"S. Alireza Banani, Raviraj Adve","Analyzing the Reduced Required BS Density due to CoMP in Cellular
  Networks","Accepted for presentation in IEEE Globecom Conf., to be held in
  Atlanta, USA, Dec. 2013. arXiv admin note: text overlap with arXiv:1302.1592",,10.1109/GLOCOM.2013.6831371,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we investigate the benefit of base station (BS) cooperation in
the uplink of coordinated multi-point (CoMP) networks. Our figure of merit is
the required BS density required to meet a chosen rate coverage. Our model
assumes a 2-D network of BSs on a regular hexagonal lattice in which path loss,
lognormal shadowing and Rayleigh fading affect the signal received from users.
Accurate closed-form expressions are first presented for the sum-rate coverage
probability and ergodic sum-rate at each point of the cooperation region. Then,
for a chosen quality of user rate, the required density of BS is derived based
on the minimum value of rate coverage probability in the cooperation region.
The approach guarantees that the achievable rate in the entire coverage region
is above a target rate with chosen probability. The formulation allows
comparison between different orders of BS cooperation, quantifying the reduced
required BS density from higher orders of cooperation.
","[{'version': 'v1', 'created': 'Thu, 26 Sep 2013 18:43:17 GMT'}]",2016-11-15,"[['Banani', 'S. Alireza', ''], ['Adve', 'Raviraj', '']]","['BS density', 'coordinated multi-point', 'lognormal shadowing', 'multiuser', 'rate coverage probability']"
3693,1304.7217,Oleg Kupervasser,"Oleg Kupervasser, Alexander Rubinstein","Correction of inertial navigation system's errors by the help of
  video-based navigator based on Digital Terrarium Map","32 pages, 18 figures, Positioning Vol.4 No.1, February 2013. arXiv
  admin note: substantial text overlap with arXiv:1107.0399, arXiv:1107.1470,
  arXiv:1106.6341",,10.4236/pos.2013.41010,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with the error analysis of a novel navigation algorithm that
uses as input the sequence of images acquired from a moving camera and a
Digital Terrain (or Elevation) Map (DTM/DEM). More specifically, it has been
shown that the optical flow derived from two consecutive camera frames can be
used in combination with a DTM to estimate the position, orientation and
ego-motion parameters of the moving camera. As opposed to previous works, the
proposed approach does not require an intermediate explicit reconstruction of
the 3D world. In the present work the sensitivity of the algorithm outlined
above is studied. The main sources for errors are identified to be the
optical-flow evaluation and computation, the quality of the information about
the terrain, the structure of the observed terrain and the trajectory of the
camera. By assuming appropriate characterization of these error sources, a
closed form expression for the uncertainty of the pose and motion of the camera
is first developed and then the influence of these factors is confirmed using
extensive numerical simulations. The main conclusion of this paper is to
establish that the proposed navigation algorithm generates accurate estimates
for reasonable scenarios and error sources, and thus can be effectively used as
part of a navigation system of autonomous vehicles.
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2013 20:46:49 GMT'}]",2013-04-29,"[['Kupervasser', 'Oleg', ''], ['Rubinstein', 'Alexander', '']]","['video-based navigator', 'Digital Terrarium Map', 'autonomous vehicles', 'inertial navigation']"
3694,0911.4752,Yao Yu,"Yao Yu, Athina P. Petropulu and H. Vincent Poor",MIMO Radar Using Compressive Sampling,"39 pages and 14 figures. Y. Yu, A. P. Petropulu and H. V. Poor, ""MIMO
  Radar Using Compressive Sampling,"" IEEE Journal of Selected Topics in Signal
  Processing, to appear in Feb. 2010",,10.1109/JSTSP.2009.2038973,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A MIMO radar system is proposed for obtaining angle and Doppler information
on potential targets. Transmitters and receivers are nodes of a small scale
wireless network and are assumed to be randomly scattered on a disk. The
transmit nodes transmit uncorrelated waveforms. Each receive node applies
compressive sampling to the received signal to obtain a small number of
samples, which the node subsequently forwards to a fusion center. Assuming that
the targets are sparsely located in the angle- Doppler space, based on the
samples forwarded by the receive nodes the fusion center formulates an
l1-optimization problem, the solution of which yields target angle and Doppler
information. The proposed approach achieves the superior resolution of MIMO
radar with far fewer samples than required by other approaches. This implies
power savings during the communication phase between the receive nodes and the
fusion center. Performance in the presence of a jammer is analyzed for the case
of slowly moving targets. Issues related to forming the basis matrix that spans
the angle-Doppler space, and for selecting a grid for that space are discussed.
Extensive simulation results are provided to demonstrate the performance of the
proposed approach at difference jammer and noise levels.
","[{'version': 'v1', 'created': 'Wed, 25 Nov 2009 03:19:13 GMT'}]",2015-05-14,"[['Yu', 'Yao', ''], ['Petropulu', 'Athina P.', ''], ['Poor', 'H. Vincent', '']]","['Compressive sampling', 'MIMO Radar', 'DOA estimation', 'Doppler estimation']"
3695,1307.7170,Antonio Franchi,Antonio Franchi and Paolo Stegagno and Giuseppe Oriolo,"Decentralized Multi-Robot Encirclement of a 3D Target with Guaranteed
  Collision Avoidance",Accepted for Autonomous Robots - Springer,"Autonomous Robots February 2016, Volume 40, Issue 2, pp 245-265,
  First online: 11 July 2015",10.1007/s10514-015-9450-3,,cs.SY cs.MA cs.RO math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a control framework for achieving encirclement of a target moving
in 3D using a multi-robot system. Three variations of a basic control strategy
are proposed for different versions of the encirclement problem, and their
effectiveness is formally established. An extension ensuring maintenance of a
safe inter-robot distance is also discussed. The proposed framework is fully
decentralized and only requires local communication among robots; in
particular, each robot locally estimates all the relevant global quantities. We
validate the proposed strategy through simulations on kinematic point robots
and quadrotor UAVs, as well as experiments on differential-drive wheeled mobile
robots.
","[{'version': 'v1', 'created': 'Fri, 26 Jul 2013 21:16:52 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Jun 2015 11:52:27 GMT'}]",2016-05-24,"[['Franchi', 'Antonio', ''], ['Stegagno', 'Paolo', ''], ['Oriolo', 'Giuseppe', '']]","['Distributed Robot Systems', 'Motion Control', 'Multi-robot Decentralized Control', 'Encirclement', 'Escorting', 'Entrapment']"
3696,1307.3712,Khalid Raza,Khalid Raza and Rafat Parveen,"Reconstruction of gene regulatory network of colon cancer using
  information theoretic approach","5 pages, 4 figures, 1 table","Confluence 2013: The Next Generation Information Technology Summit
  (4th International Conference), pp. 461 - 466",10.1049/cp.2013.2357,,cs.CE cs.ET cs.SY q-bio.MN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reconstruction of gene regulatory networks or 'reverse-engineering' is a
process of identifying gene interaction networks from experimental microarray
gene expression profile through computation techniques. In this paper, we tried
to reconstruct cancer-specific gene regulatory network using information
theoretic approach - mutual information. The considered microarray data
consists of large number of genes with 20 samples - 12 samples from colon
cancer patient and 8 from normal cell. The data has been preprocessed and
normalized. A t-test statistics has been applied to filter differentially
expressed genes. The interaction between filtered genes has been computed using
mutual information and ten different networks has been constructed with varying
number of interactions ranging from 30 to 500. We performed the topological
analysis of the reconstructed network, revealing a large number of interactions
in colon cancer. Finally, validation of the inferred results has been done with
available biological databases and literature.
","[{'version': 'v1', 'created': 'Sun, 14 Jul 2013 08:51:19 GMT'}]",2014-08-25,"[['Raza', 'Khalid', ''], ['Parveen', 'Rafat', '']]","['Gene regulatory networks', 'microarray', 'colon cancer', 'systems biology']"
3697,1612.03770,James Aimone,"Timothy J. Draelos, Nadine E. Miner, Christopher C. Lamb, Jonathan A.
  Cox, Craig M. Vineyard, Kristofor D. Carlson, William M. Severa, Conrad D.
  James, and James B. Aimone",Neurogenesis Deep Learning,"8 pages, 8 figures, Accepted to 2017 International Joint Conference
  on Neural Networks (IJCNN 2017)",,10.1109/IJCNN.2017.7965898,SAND2017-2174 C,cs.NE cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural machine learning methods, such as deep neural networks (DNN), have
achieved remarkable success in a number of complex data processing tasks. These
methods have arguably had their strongest impact on tasks such as image and
audio processing - data processing domains in which humans have long held clear
advantages over conventional algorithms. In contrast to biological neural
systems, which are capable of learning continuously, deep artificial networks
have a limited ability for incorporating new information in an already trained
network. As a result, methods for continuous learning are potentially highly
impactful in enabling the application of deep networks to dynamic data sets.
Here, inspired by the process of adult neurogenesis in the hippocampus, we
explore the potential for adding new neurons to deep layers of artificial
neural networks in order to facilitate their acquisition of novel information
while preserving previously trained data representations. Our results on the
MNIST handwritten digit dataset and the NIST SD 19 dataset, which includes
lower and upper case letters and digits, demonstrate that neurogenesis is well
suited for addressing the stability-plasticity dilemma that has long challenged
adaptive machine learning algorithms.
","[{'version': 'v1', 'created': 'Mon, 12 Dec 2016 16:25:23 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Mar 2017 16:45:11 GMT'}]",2017-07-11,"[['Draelos', 'Timothy J.', ''], ['Miner', 'Nadine E.', ''], ['Lamb', 'Christopher C.', ''], ['Cox', 'Jonathan A.', ''], ['Vineyard', 'Craig M.', ''], ['Carlson', 'Kristofor D.', ''], ['Severa', 'William M.', ''], ['James', 'Conrad D.', ''], ['Aimone', 'James B.', '']]","['deep learning', 'autoencoder', 'class conditional sampling', 'replay', 'hippocampus', 'deep neural networks']"
3698,2102.07359,Weijia Zhang,"Weijia Zhang, Hao Liu, Fan Wang, Tong Xu, Haoran Xin, Dejing Dou, Hui
  Xiong","Intelligent Electric Vehicle Charging Recommendation Based on
  Multi-Agent Reinforcement Learning","12 pages, 10 figures",,10.1145/3442381.3449934,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Electric Vehicle (EV) has become a preferable choice in the modern
transportation system due to its environmental and energy sustainability.
However, in many large cities, EV drivers often fail to find the proper spots
for charging, because of the limited charging infrastructures and the
spatiotemporally unbalanced charging demands. Indeed, the recent emergence of
deep reinforcement learning provides great potential to improve the charging
experience from various aspects over a long-term horizon. In this paper, we
propose a framework, named Multi-Agent Spatio-Temporal Reinforcement Learning
(Master), for intelligently recommending public accessible charging stations by
jointly considering various long-term spatiotemporal factors. Specifically, by
regarding each charging station as an individual agent, we formulate this
problem as a multi-objective multi-agent reinforcement learning task. We first
develop a multi-agent actor-critic framework with the centralized attentive
critic to coordinate the recommendation between geo-distributed agents.
Moreover, to quantify the influence of future potential charging competition,
we introduce a delayed access strategy to exploit the knowledge of future
charging competition during training. After that, to effectively optimize
multiple learning objectives, we extend the centralized attentive critic to
multi-critics and develop a dynamic gradient re-weighting strategy to
adaptively guide the optimization direction. Finally, extensive experiments on
two real-world datasets demonstrate that Master achieves the best comprehensive
performance compared with nine baseline approaches.
","[{'version': 'v1', 'created': 'Mon, 15 Feb 2021 06:23:59 GMT'}]",2021-02-16,"[['Zhang', 'Weijia', ''], ['Liu', 'Hao', ''], ['Wang', 'Fan', ''], ['Xu', 'Tong', ''], ['Xin', 'Haoran', ''], ['Dou', 'Dejing', ''], ['Xiong', 'Hui', '']]","['Charging station recommendation', 'multi-agent reinforcement learning', 'multi-objective optimization']"
3699,2105.06609,Abdul Syahid,"Abdul Syahid, Nur Mukminatien","Thirty years of TEFLIN Journal: A bibliometric portrait through the lens
  of Microsoft Academic",,"TEFLIN Journal, 32(1), 2021",10.15639/teflinjournal.v32i1/134-166,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Bibliometric studies are a rare undertaking in the field of English language
teaching, especially at a journal level. To celebrate the 30th anniversary of
TEFLIN Journal, this study exhibits a bibliometric portrait of its publication,
indexation, and citation from 1990 to 2019. Two pieces of free software were
adopted to conduct the descriptive and network analyses of bibliographic data
from Microsoft Academic. The publication and citation metrics have risen during
its lifetime. The bibliographic network identifies the most productive authors,
institutions, and countries along with the co-authorship pattern, type of
top-cited articles, and top-used keywords. The articles relatedness is also
sighted in terms of the citation frequency and number of shared references.
Even though the analyses were complicated by some missing articles and improper
indexation, this study could still take a full-length bibliometric portrait of
the journal during its 30-year journey between the commitment to competence and
the quest for higher impact.
","[{'version': 'v1', 'created': 'Fri, 14 May 2021 01:32:57 GMT'}]",2021-05-17,"[['Syahid', 'Abdul', ''], ['Mukminatien', 'Nur', '']]","['bibliographic databases', 'bibliometrics', 'journal articles', 'state of the']"
3700,1912.00286,Alexey Svyatkovskiy,"Alexey Svyatkovskiy, Julian Kates-Harbeck, William Tang","Training Distributed Deep Recurrent Neural Networks with Mixed Precision
  on GPU Clusters",,"Published in Proceedings of the Machine Learning on HPC
  Environments (MLHPC) at the Supercomputing conference 2017",10.1145/3146347.3146358,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we evaluate training of deep recurrent neural networks with
half-precision floats. We implement a distributed, data-parallel, synchronous
training algorithm by integrating TensorFlow and CUDA-aware MPI to enable
execution across multiple GPU nodes and making use of high-speed interconnects.
We introduce a learning rate schedule facilitating neural network convergence
at up to $O(100)$ workers.
  Strong scaling tests performed on clusters of NVIDIA Pascal P100 GPUs show
linear runtime and logarithmic communication time scaling for both single and
mixed precision training modes. Performance is evaluated on a scientific
dataset taken from the Joint European Torus (JET) tokamak, containing
multi-modal time series of sensory measurements leading up to deleterious
events called plasma disruptions, and the benchmark Large Movie Review
Dataset~\cite{imdb}. Half-precision significantly reduces memory and network
bandwidth, allowing training of state-of-the-art models with over 70 million
trainable parameters while achieving a comparable test set performance as
single precision.
","[{'version': 'v1', 'created': 'Sat, 30 Nov 2019 23:57:48 GMT'}]",2019-12-03,"[['Svyatkovskiy', 'Alexey', ''], ['Kates-Harbeck', 'Julian', ''], ['Tang', 'William', '']]","['Neural networks', 'distributed computing', 'floating point precision']"
3701,1811.02165,Syed Muhammad Atif,"Sameer Qazi, Syed Muhammad Atif and Muhammad Bilal Kadri","A Novel Compressed Sensing Technique for Traffic Matrix Estimation of
  Software Defined Cloud Networks","The paper has been published in KSII TRANSACTIONS ON INTERNET AND
  INFORMATION SYSTEMS VOL. 12, NO. 10, Oct. 2018. It contains 25 pages, 23
  equations, 1 algorithm and 12 Figures","KSII Transactions on Internet and Information Systems, vol. 12,
  no. 10, pp. 4678-4702, 2018",10.3837/tiis.2018.10.004,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traffic Matrix estimation has always caught attention from researchers for
better network management and future planning. With the advent of high traffic
loads due to Cloud Computing platforms and Software Defined Networking based
tunable routing and traffic management algorithms on the Internet, it is more
necessary as ever to be able to predict current and future traffic volumes on
the network. For large networks such origin-destination traffic prediction
problem takes the form of a large under-constrained and under-determined system
of equations with a dynamic measurement matrix. In this work, we present our
Compressed Sensing with Dynamic Model Estimation (CS-DME) architecture suitable
for modern software defined networks. Our main contributions are: (1) we
formulate an approach in which measurement matrix in the compressed sensing
scheme can be accurately and dynamically estimated through a reformulation of
the problem based on traffic demands. (2) We show that the problem formulation
using a dynamic measurement matrix based on instantaneous traffic demands may
be used instead of a stationary binary routing matrix which is more suitable to
modern Software Defined Networks that are constantly evolving in terms of
routing by inspection of its Eigen Spectrum using two real world datasets. (3)
We also show that linking this compressed measurement matrix dynamically with
the measured parameters can lead to acceptable estimation of Origin Destination
(OD) Traffic flows with marginally poor results with other state-of-art schemes
relying on fixed measurement matrices. (4) Furthermore, using this compressed
reformulated problem, a new strategy for selection of vantage points for most
efficient traffic matrix estimation is also presented through a secondary
compression technique based on subset of link measurements.
","[{'version': 'v1', 'created': 'Tue, 6 Nov 2018 05:08:53 GMT'}]",2018-11-07,"[['Qazi', 'Sameer', ''], ['Atif', 'Syed Muhammad', ''], ['Kadri', 'Muhammad Bilal', '']]","['Cloud Networks', 'Software Defined Networks', 'Traffic Matrix Estimation', 'Constrained Optimization']"
3702,1003.5775,Secretary Aircc Journal,"Ye Ouyang (1) and M. Hosein Fallah (1), ((1)Stevens Institute of
  Technology, USA)","The impact of cell site re-homing on the performance of umts core
  networks","14 Pages, IJNGN Journal",International Journal of Next-Generation Networks 2.1 (2010) 49-62,10.5121/ijngn.2010.2105,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Mobile operators currently prefer optimizing their radio networks via
re-homing or cutting over the cell sites in 2G or 3G networks. The core
network, as the parental part of radio network, is inevitably impacted by the
re-homing in radio domain. This paper introduces the cell site re-homing in
radio network and analyzes its impact on the performance of GSM/UMTS core
network. The possible re-homing models are created and analyzed for core
networks. The paper concludes that appropriate re-homing in radio domain, using
correct algorithms, not only optimizes the radio network but also helps improve
the QoS of the core network and saves the carriers' OPEX and CAPEX on their
core networks.
","[{'version': 'v1', 'created': 'Tue, 30 Mar 2010 09:56:20 GMT'}]",2010-07-15,"[['Ouyang', 'Ye', ''], ['Fallah', 'M. Hosein', '']]","['UMTS', 'WCDMA', 'GSM', 'Core Network', 'Rehoming', 'Network Optimization', 'Network Dimension', 'Network Plan']"
3703,1303.1732,Zungeru Adamu Murtala,A.M. Zungeru,Design and Development of an Ultrasonic Motion Detector,"7 figures, 13 pages","A.M. Zungeru. Design and Development of an Ultrasonic Motion
  Detector, International Journal of Security, Privacy and Trust Management
  (IJSPTM), vol. 2(1), pp. 1-13, 2013",10.5121/ijsptm.2013.2101,,cs.OH physics.ins-det,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ultrasonic motion detector devices emit ultrasonic sound energy into an
area of interest (monitored area), and this further reacts to a change in the
reflected energy pattern. The system uses a technique that is based on a
frequency shift in reflected energy to detect a movement or change in position
(motion). In this system, ultrasonic sound is transmitted from the transmitting
device which is normally in the form of energy. The transmitted sound utilizes
air as its medium and this travel in a wave type motion. The wave is reflected
back from the surroundings in the room/hallway and the device hears a pitch
characteristic of the protected environment. In this system, the wave pattern
is disturbed and reflected back more quickly, thus increasing the pitch and
signaling an alarm whenever motion is detected. The main contribution of this
work is the design of a circuit that can sense motion through movement of
anything, a low cost and portable motion detector, and the design of a circuit
that can be used to trigger another circuit whether to ON or OFF depending on
the circuit attached to it. Generally, the design is made to detect movement or
moving object in a an enclosed area. In this work, a transmitter transducer
generates a signal at a frequency of 40khz, and when the signal is blocked by
any moving object, and this in turn, triggers a buzzer via a timing circuit.
This system works on the principle of the signal interference by a moving body,
and the system is dependent on the presence of an intruder or moving object
within a monitored area. The system after design and construction was tested
and found to work in accordance with specifications.
","[{'version': 'v1', 'created': 'Thu, 7 Mar 2013 16:10:33 GMT'}]",2013-03-08,"[['Zungeru', 'A. M.', '']]","['Security system', 'Motion Detector', 'Transducers', 'Buzzer', 'Ultrasonic Sound', 'Electronic Circuit Design']"
3704,1412.7927,Raunaq Vohra,"Kratarth Goel, Raunaq Vohra, and J.K. Sahoo","Polyphonic Music Generation by Modeling Temporal Dependencies Using a
  RNN-DBN","8 pages, A4, 1 figure, 1 table, ICANN 2014 oral presentation. arXiv
  admin note: text overlap with arXiv:1206.6392 by other authors","Lecture Notes in Computer Science Volume 8681, 2014, pp 217-224",10.1007/978-3-319-11179-7_28,,cs.LG cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a generic technique to model temporal dependencies
and sequences using a combination of a recurrent neural network and a Deep
Belief Network. Our technique, RNN-DBN, is an amalgamation of the memory state
of the RNN that allows it to provide temporal information and a multi-layer DBN
that helps in high level representation of the data. This makes RNN-DBNs ideal
for sequence generation. Further, the use of a DBN in conjunction with the RNN
makes this model capable of significantly more complex data representation than
an RBM. We apply this technique to the task of polyphonic music generation.
","[{'version': 'v1', 'created': 'Fri, 26 Dec 2014 11:08:42 GMT'}]",2014-12-30,"[['Goel', 'Kratarth', ''], ['Vohra', 'Raunaq', ''], ['Sahoo', 'J. K.', '']]","['Deep architectures', 'recurrent neural networks', 'music generation', 'creative machine learning', 'Deep Belief Networks', 'generative models']"
3705,1507.08417,Gabriele D'Angelo,"Gabriele D'Angelo, Stefano Ferretti",Highly intensive data dissemination in complex networks,,"Journal of Parallel and Distributed Computing, Elsevier, vol. 99
  (January 2017). ISSN: 0743-7315",10.1016/j.jpdc.2016.08.004,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a study on data dissemination in unstructured
Peer-to-Peer (P2P) network overlays. The absence of a structure in unstructured
overlays eases the network management, at the cost of non-optimal mechanisms to
spread messages in the network. Thus, dissemination schemes must be employed
that allow covering a large portion of the network with a high probability
(e.g.~gossip based approaches). We identify principal metrics, provide a
theoretical model and perform the assessment evaluation using a high
performance simulator that is based on a parallel and distributed architecture.
A main point of this study is that our simulation model considers
implementation technical details, such as the use of caching and Time To Live
(TTL) in message dissemination, that are usually neglected in simulations, due
to the additional overhead they cause. Outcomes confirm that these technical
details have an important influence on the performance of dissemination schemes
and that the studied schemes are quite effective to spread information in P2P
overlay networks, whatever their topology. Moreover, the practical usage of
such dissemination mechanisms requires a fine tuning of many parameters, the
choice between different network topologies and the assessment of behaviors
such as free riding. All this can be done only using efficient simulation tools
to support both the network design phase and, in some cases, at runtime.
","[{'version': 'v1', 'created': 'Thu, 30 Jul 2015 08:40:44 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Aug 2016 14:30:04 GMT'}, {'version': 'v3', 'created': 'Mon, 26 Sep 2016 09:51:58 GMT'}]",2016-09-27,"[[""D'Angelo"", 'Gabriele', ''], ['Ferretti', 'Stefano', '']]","['Data dissemination', 'Simulation', 'Complex Networks', 'PerformanceEvaluation']"
3706,1208.4942,Cm Pintea,Camelia-M. Pintea,"A Unifying Survey of Reinforced, Sensitive and Stigmergic Agent-Based
  Approaches for E-GTSP","9 pages, 2 figures",Informatica. 26(3) (2015). 509-522,10.15388/Informatica.2015.61,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Generalized Traveling Salesman Problem (GTSP) is one of the NP-hard
combinatorial optimization problems. A variant of GTSP is E-GTSP where E,
meaning equality, has the constraint: exactly one node from a cluster of a
graph partition is visited. The main objective of the E-GTSP is to find a
minimum cost tour passing through exactly one node from each cluster of an
undirected graph. Agent-based approaches involving are successfully used
nowadays for solving real life complex problems. The aim of the current paper
is to illustrate some variants of agent-based algorithms including ant-based
models with specific properties for solving E-GTSP.
","[{'version': 'v1', 'created': 'Fri, 24 Aug 2012 10:23:37 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Feb 2014 11:02:59 GMT'}]",2021-03-16,"[['Pintea', 'Camelia-M.', '']]","['Combinatorial Optimization', 'Multi-Agent Systems', 'Ant Colony Optimization']"
3707,0909.1623,Sudarshan Shinde,Sudarshan Shinde,Two channel paraunitary filter banks based on linear canonical transform,"10 pages, IEEE format",,10.1109/TSP.2010.2089681,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper a two channel paraunitary filter bank is proposed, which is
based on linear canonical transform, instead of discrete Fourier transform.
Input-output relation for such a filter bank are derived in terms of polyphase
matrices and modulation matrices. It is shown that like conventional filter
banks, the LCT based paraunitary filter banks need only one filter to be
designed and rest of the filters can be obtained from it. It is also shown that
LCT based paraunitary filter banks can be designed by using conventional
power-symmetric filter design in Fourier domain.
","[{'version': 'v1', 'created': 'Wed, 9 Sep 2009 06:57:41 GMT'}]",2016-11-17,"[['Shinde', 'Sudarshan', '']]","['Sub-band decomposition', 'filter banks', 'linear canonical transform. paraunitray', 'power-symmetric', 'fractional Fourier transform']"
3708,0708.1962,Mihai Oltean,"Mihai Oltean, Oana Muntean",Exact Cover with light,"20 pages, 4 figures, New Generation Computing, accepted, 2007","New Generation Computing, Springer-Verlag, Vol. 26, Issue 4, pp.
  327-344, 2008",10.1007/s00354-008-0049-5,,cs.AR cs.DC,,"  We suggest a new optical solution for solving the YES/NO version of the Exact
Cover problem by using the massive parallelism of light. The idea is to build
an optical device which can generate all possible solutions of the problem and
then to pick the correct one. In our case the device has a graph-like
representation and the light is traversing it by following the routes given by
the connections between nodes. The nodes are connected by arcs in a special way
which lets us to generate all possible covers (exact or not) of the given set.
For selecting the correct solution we assign to each item, from the set to be
covered, a special integer number. These numbers will actually represent delays
induced to light when it passes through arcs. The solution is represented as a
subray arriving at a certain moment in the destination node. This will tell us
if an exact cover does exist or not.
","[{'version': 'v1', 'created': 'Tue, 14 Aug 2007 21:41:55 GMT'}]",2009-02-07,"[['Oltean', 'Mihai', ''], ['Muntean', 'Oana', '']]","['Optical Computing', 'Unconventional Computing', 'NaturalComputing', 'NP-complete Problems', 'Exact Cover']"
3709,1207.3884,Md. Hasnat Kabir Dr,"Rifat Ara Shams, M. Hasnat Kabir, Sheikh Enayet Ullah","Effect of Interleaved FEC Code on Wavelet Based MC-CDMA System with
  Alamouti STBC in Different Modulation Schemes",,"International Journal of Computer Science, Engineering and
  Information Technology (IJCSEIT), Vol.2, No.1, February 2012, 23-33",10.5121/ijcseit.2012.2103,,cs.IT cs.PF math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the impact of Forward Error Correction (FEC) code namely
Trellis code with interleaver on the performance of wavelet based MC-CDMA
wireless communication system with the implementation of Alamouti antenna
diversity scheme has been investigated in terms of Bit Error Rate (BER) as a
function of Signal-to-Noise Ratio (SNR) per bit. Simulation of the system under
proposed study has been done in M-ary modulation schemes (MPSK, MQAM and DPSK)
over AWGN and Rayleigh fading channel incorporating Walsh Hadamard code as
orthogonal spreading code to discriminate the message signal for individual
user. It is observed via computer simulation that the performance of the
interleaved coded based proposed system outperforms than that of the uncoded
system in all modulation schemes over Rayleigh fading channel.
","[{'version': 'v1', 'created': 'Tue, 17 Jul 2012 05:34:09 GMT'}]",2012-07-18,"[['Shams', 'Rifat Ara', ''], ['Kabir', 'M. Hasnat', ''], ['Ullah', 'Sheikh Enayet', '']]","['DWT', 'MC-CDMA', 'Trellis Code', 'Alamouti', 'AWGN', 'Rayleigh Fading']"
3710,1601.01054,Matthew A. Wright,"Matthew A. Wright, Gabriel Gomes, Roberto Horowitz, Alex A.
  Kurzhanskiy",On node models for high-dimensional road networks,"The abstract on this info page is slightly abbreviated, please see
  the paper for the full abstract","Transportation Research Part B: Methodological, vol. 105, pp.
  212-234, November 2017",10.1016/j.trb.2017.09.001,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Macroscopic traffic models are necessary for simulation and study of
traffic's complex macro-scale dynamics, and are often used by practitioners for
road network planning, integrated corridor management, and other applications.
These models have two parts: a link model, which describes traffic flow
behavior on individual roads, and a node model, which describes behavior at
road junctions. As the road networks under study become larger and more complex
--- nowadays often including arterial networks --- the node model becomes more
important. This paper focuses on the first order node model and has two main
contributions. First, we formalize the multi-commodity flow distribution at a
junction as an optimization problem with all the necessary constraints. Most
interesting here is the formalization of input flow priorities. Then, we
discuss a very common ""conservation of turning fractions"" or
""first-in-first-out"" (FIFO) constraint, and how it often produces unrealistic
spillback. This spillback occurs when, at a diverge, a queue develops for a
movement that only a few lanes service, but FIFO requires that all lanes
experience spillback from this queue. As we show, avoiding this unrealistic
spillback while retaining FIFO in the node model requires complicated network
topologies. Our second contribution is a ""partial FIFO"" mechanism that avoids
this unrealistic spillback, and a node model and solution algorithm that
incorporates this mechanism. The partial FIFO mechanism is parameterized
through intervals that describe how individual movements influence each other,
can be intuitively described from physical lane geometry and turning movement
rules, and allows tuning to describe a link as having anything between full
FIFO and no FIFO. Excepting the FIFO constraint, the present node model also
fits within the well-established ""general class of first-order node models"" for
multi-commodity flows.
","[{'version': 'v1', 'created': 'Wed, 6 Jan 2016 02:33:29 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Nov 2016 18:10:33 GMT'}, {'version': 'v3', 'created': 'Sat, 2 Sep 2017 00:20:12 GMT'}]",2017-09-22,"[['Wright', 'Matthew A.', ''], ['Gomes', 'Gabriel', ''], ['Horowitz', 'Roberto', ''], ['Kurzhanskiy', 'Alex A.', '']]","['macroscopic first order traffic model', 'first order node model', 'multi-commodity traffic', 'dynamictraffic assignment', 'dynamic network loading']"
3711,1707.08645,Yuan Zong,"Yuan Zong, Xiaohua Huang, Wenming Zheng, Zhen Cui, Guoying Zhao","Learning a Target Sample Re-Generator for Cross-Database
  Micro-Expression Recognition",To appear at ACM Multimedia 2017,,10.1109/TIP.2018.2797479,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate the cross-database micro-expression recognition
problem, where the training and testing samples are from two different
micro-expression databases. Under this setting, the training and testing
samples would have different feature distributions and hence the performance of
most existing micro-expression recognition methods may decrease greatly. To
solve this problem, we propose a simple yet effective method called Target
Sample Re-Generator (TSRG) in this paper. By using TSRG, we are able to
re-generate the samples from target micro-expression database and the
re-generated target samples would share same or similar feature distributions
with the original source samples. For this reason, we can then use the
classifier learned based on the labeled source samples to accurately predict
the micro-expression categories of the unlabeled target samples. To evaluate
the performance of the proposed TSRG method, extensive cross-database
micro-expression recognition experiments designed based on SMIC and CASME II
databases are conducted. Compared with recent state-of-the-art cross-database
emotion recognition methods, the proposed TSRG achieves more promising results.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 21:13:45 GMT'}]",2018-04-04,"[['Zong', 'Yuan', ''], ['Huang', 'Xiaohua', ''], ['Zheng', 'Wenming', ''], ['Cui', 'Zhen', ''], ['Zhao', 'Guoying', '']]","['Cross-database micro-expression recognition', 'micro-expressionrecognition', 'domain adaptation', 'transfer learning']"
3712,1804.07663,Andreas Steyven,"Andreas Steyven, Emma Hart, Ben Paechter","An Investigation of Environmental Influence on the Benefits of
  Adaptation Mechanisms in Evolutionary Swarm Robotics",In GECCO 2017,,10.1145/3071178.3071232,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A robotic swarm that is required to operate for long periods in a potentially
unknown environment can use both evolution and individual learning methods in
order to adapt. However, the role played by the environment in influencing the
effectiveness of each type of learning is not well understood. In this paper,
we address this question by analysing the performance of a swarm in a range of
simulated, dynamic environments where a distributed evolutionary algorithm for
evolving a controller is augmented with a number of different individual
learning mechanisms. The learning mechanisms themselves are defined by
parameters which can be either fixed or inherited. We conduct experiments in a
range of dynamic environments whose characteristics are varied so as to present
different opportunities for learning. Results enable us to map environmental
characteristics to the most effective learning algorithm.
","[{'version': 'v1', 'created': 'Fri, 20 Apr 2018 15:13:47 GMT'}]",2018-04-23,"[['Steyven', 'Andreas', ''], ['Hart', 'Emma', ''], ['Paechter', 'Ben', '']]","['Evolutionary Swarm Robotics', 'Environment', 'Learning']"
3713,2008.01212,Fernando Benjamin Perez Maurera,"Fernando Benjam\'in P\'erez Maurera, Maurizio Ferrari Dacrema, Lorenzo
  Saule, Mario Scriminaci, Paolo Cremonesi",ContentWise Impressions: An Industrial Dataset with Impressions Included,"8 pages, 2 figures","Proceedings of the 29th ACM International Conference on
  Information & Knowledge Management (CIKM 2020)",10.1145/3340531.3412774,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, we introduce the ContentWise Impressions dataset, a
collection of implicit interactions and impressions of movies and TV series
from an Over-The-Top media service, which delivers its media contents over the
Internet. The dataset is distinguished from other already available multimedia
recommendation datasets by the availability of impressions, i.e., the
recommendations shown to the user, its size, and by being open-source. We
describe the data collection process, the preprocessing applied, its
characteristics, and statistics when compared to other commonly used datasets.
We also highlight several possible use cases and research questions that can
benefit from the availability of user impressions in an open-source dataset.
Furthermore, we release software tools to load and split the data, as well as
examples of how to use both user interactions and impressions in several common
recommendation algorithms.
","[{'version': 'v1', 'created': 'Mon, 3 Aug 2020 21:46:38 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Sep 2020 12:51:09 GMT'}]",2021-01-08,"[['Maurera', 'Fernando Benjamín Pérez', ''], ['Dacrema', 'Maurizio Ferrari', ''], ['Saule', 'Lorenzo', ''], ['Scriminaci', 'Mario', ''], ['Cremonesi', 'Paolo', '']]","['Implicit Feedback', 'Impressions', 'Dataset', 'Collaborative Filtering', 'Open Source']"
3714,1302.1676,Deepali Virmani,"Deepali Virmani, Satbir Jain","Comparison of Proposed Data Dissemination Protocols for Sensor Networks
  Using J-Sim","8 pages, 9 figures",,10.1109/IADCC.2009.4809182,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A distinguishing characteristic of wireless sensor networks is the
opportunity to exploit characteristics of the application at lower layers. This
paper reports on the results of a simulation comparison of proposed data
dissemination protocols using the J-Sim simulator for the WSN protocols:
Forwarding Diffusion Data Dissemination(FDDDP), Decentralized Data
Dissemination(DDDP), Credit Broadcast Data Dissemination (CBDDP), Energy Aware
& Geographical Data Dissemination (EAGDDP) .Our performance provides useful
insights for the network designer such as which protocols (and design choices)
scale control traffic well, improve data delivery or reduce overall energy
consumption,improves routing overhead and maximizes the bandwidth utilization.
The static pre configuration of the cell size in DDDP, is one of the reasons
why DDDP exhibits larger routing overhead than FDDDP by 74.2% on average.
Although CBDDP produces approximately 94.6% smaller overhead than DDDP and
90.7% smaller than FDDDP, because of statically configured amount credit CBDDP
delivers on average 7.5 times more of the redundant data packets than DDDP and
FDDDP.EAGDDP improves the delivery by 80% on average and makes a balance of
energy consumption .We suggest that making these protocols truly self-learning
can significantly improve their performance.
","[{'version': 'v1', 'created': 'Thu, 7 Feb 2013 09:10:55 GMT'}]",2013-02-08,"[['Virmani', 'Deepali', ''], ['Jain', 'Satbir', '']]","['Data dissemination', 'energy aware', 'geographical', 'cell size', 'credits']"
3715,1208.1922,Probir Roy,"Probir Roy, Md. Mejbah Ul Alam and Nishita Das","Heuristic based task scheduling in multiprocessor systems with genetic
  algorithm by choosing the eligible processor",,"IJDPS, Vol.3, No.4, (July 2012) 111-121",10.5121/ijdps.2012.3412,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In multiprocessor systems, one of the main factors of systems' performance is
task scheduling. The well the task be distributed among the processors the well
be the performance. Again finding the optimal solution of scheduling the tasks
into the processors is NP-complete, that is, it will take a lot of time to find
the optimal solution. Many evolutionary algorithms (e.g. Genetic Algorithm,
Simulated annealing) are used to reach the near optimal solution in linear
time. In this paper we propose a heuristic for genetic algorithm based task
scheduling in multiprocessor systems by choosing the eligible processor on
educated guess. From comparison it is found that this new heuristic based GA
takes less computation time to reach the suboptimal solution.
","[{'version': 'v1', 'created': 'Thu, 9 Aug 2012 14:34:20 GMT'}]",2012-08-10,"[['Roy', 'Probir', ''], ['Alam', 'Md. Mejbah Ul', ''], ['Das', 'Nishita', '']]","['Multiprocessor', 'task scheduling', 'heuristic', 'genetic algorithm']"
3716,2102.03140,Giuseppe Paolo Mr,"Giuseppe Paolo (1 and 2), Alexandre Coninx (1), Stephane Doncieux (1),
  Alban Laflaqui\`ere (2) ((1) ISIR, (2) SBRE)",Sparse Reward Exploration via Novelty Search and Emitters,"In 2021 Genetic and Evolutionary Computation Conference (GECCO 21),
  July, 2021, Lille, France. ACM, New York, NY, USA, 11 pages",,10.1145/3449639.3459314,,cs.NE cs.AI cs.LG cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reward-based optimization algorithms require both exploration, to find
rewards, and exploitation, to maximize performance. The need for efficient
exploration is even more significant in sparse reward settings, in which
performance feedback is given sparingly, thus rendering it unsuitable for
guiding the search process. In this work, we introduce the SparsE Reward
Exploration via Novelty and Emitters (SERENE) algorithm, capable of efficiently
exploring a search space, as well as optimizing rewards found in potentially
disparate areas. Contrary to existing emitters-based approaches, SERENE
separates the search space exploration and reward exploitation into two
alternating processes. The first process performs exploration through Novelty
Search, a divergent search algorithm. The second one exploits discovered reward
areas through emitters, i.e. local instances of population-based optimization
algorithms. A meta-scheduler allocates a global computational budget by
alternating between the two processes, ensuring the discovery and efficient
exploitation of disjoint reward areas. SERENE returns both a collection of
diverse solutions covering the search space and a collection of high-performing
solutions for each distinct reward area. We evaluate SERENE on various sparse
reward environments and show it compares favorably to existing baselines.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2021 12:34:54 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Apr 2021 08:33:19 GMT'}]",2021-04-19,"[['Paolo', 'Giuseppe', '', '1 and 2'], ['Coninx', 'Alexandre', '', 'ISIR'], ['Doncieux', 'Stephane', '', 'ISIR'], ['Laflaquière', 'Alban', '', 'SBRE']]","['Novelty search', 'sparse rewards', 'emitters', 'evolutionary algorithm', 'quality diversity']"
3717,1911.08729,Stefan Lessmann,"Robin M. Gubela, Stefan Lessmann, Szymon Jaroszewicz","Response Transformation and Profit Decomposition for Revenue Uplift
  Modeling",53 pages including online appendix,European Journal of Operational Research 2019,10.1016/j.ejor.2019.11.030,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Uplift models support decision-making in marketing campaign planning.
Estimating the causal effect of a marketing treatment, an uplift model
facilitates targeting communication to responsive customers and efficient
allocation of marketing budgets. Research into uplift models focuses on
conversion models to maximize incremental sales. The paper introduces uplift
modeling strategies for maximizing incremental revenues. If customers differ in
their spending behavior, revenue maximization is a more plausible business
objective compared to maximizing conversions. The proposed methodology entails
a transformation of the prediction target, customer-level revenues, that
facilitates implementing a causal uplift model using standard machine learning
algorithms. The distribution of campaign revenues is typically zero-inflated
because of many non-buyers. Remedies to this modeling challenge are
incorporated in the proposed revenue uplift strategies in the form of two-stage
models. Empirical experiments using real-world e-commerce data confirm the
merits of the proposed revenue uplift strategy over relevant alternatives
including uplift models for conver-sion and recently developed causal machine
learning algorithms. To quantify the degree to which improved targeting
decisions raise return on marketing, the paper develops a decomposition of
campaign profit. Applying the decomposition to a digital coupon targeting
campaign, the paper provides evidence that revenue uplift modeling, as well as
causal machine learning, can improve cam-paign profit substantially.
","[{'version': 'v1', 'created': 'Wed, 20 Nov 2019 06:36:07 GMT'}]",2019-11-21,"[['Gubela', 'Robin M.', ''], ['Lessmann', 'Stefan', ''], ['Jaroszewicz', 'Szymon', '']]","['OR in Marketing', 'Profit Analytics', 'Uplift Model', 'Causal Machine Learning']"
3718,1901.07694,Jonathan Dodge,"Jonathan Dodge, Q. Vera Liao, Yunfeng Zhang, Rachel K. E. Bellamy and
  Casey Dugan","Explaining Models: An Empirical Study of How Explanations Impact
  Fairness Judgment",,,10.1145/3301275.3302310,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ensuring fairness of machine learning systems is a human-in-the-loop process.
It relies on developers, users, and the general public to identify fairness
problems and make improvements. To facilitate the process we need effective,
unbiased, and user-friendly explanations that people can confidently rely on.
Towards that end, we conducted an empirical study with four types of
programmatically generated explanations to understand how they impact people's
fairness judgments of ML systems. With an experiment involving more than 160
Mechanical Turk workers, we show that: 1) Certain explanations are considered
inherently less fair, while others can enhance people's confidence in the
fairness of the algorithm; 2) Different fairness problems--such as model-wide
fairness issues versus case-specific fairness discrepancies--may be more
effectively exposed through different styles of explanation; 3) Individual
differences, including prior positions and judgment criteria of algorithmic
fairness, impact how people react to different styles of explanation. We
conclude with a discussion on providing personalized and adaptive explanations
to support fairness judgments of ML systems.
","[{'version': 'v1', 'created': 'Wed, 23 Jan 2019 02:29:28 GMT'}]",2019-01-24,"[['Dodge', 'Jonathan', ''], ['Liao', 'Q. Vera', ''], ['Zhang', 'Yunfeng', ''], ['Bellamy', 'Rachel K. E.', ''], ['Dugan', 'Casey', '']]","['Fairness', 'Machine Learning', 'Explanation', 'Empirical Studies']"
3719,1612.03461,Renato J Cintra,"V. A. Coutinho, R. J. Cintra, F. M. Bayer, S. Kulasekera, A.
  Madanayake",Low-complexity Pruned 8-point DCT Approximations for Image Encoding,"13 pages, 6 figures, 3 tables",,10.1109/CONIELECOMP.2015.7086923,,cs.MM cs.DS stat.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two multiplierless pruned 8-point discrete cosine transform (DCT)
approximation are presented. Both transforms present lower arithmetic
complexity than state-of-the-art methods. The performance of such new methods
was assessed in the image compression context. A JPEG-like simulation was
performed, demonstrating the adequateness and competitiveness of the introduced
methods. Digital VLSI implementation in CMOS technology was also considered.
Both presented methods were realized in Berkeley Emulation Engine (BEE3).
","[{'version': 'v1', 'created': 'Sun, 11 Dec 2016 19:41:44 GMT'}]",2016-12-13,"[['Coutinho', 'V. A.', ''], ['Cintra', 'R. J.', ''], ['Bayer', 'F. M.', ''], ['Kulasekera', 'S.', ''], ['Madanayake', 'A.', '']]","['Approximate discrete cosine transform', 'pruning', 'pruned DCT', 'HEVC']"
3720,2202.05387,Ahmed El-Kishky,"Ahmed El-Kishky, Thomas Markovich, Serim Park, Chetan Verma, Baekjin
  Kim, Ramy Eskander, Yury Malkov, Frank Portman, Sof\'ia Samaniego, Ying Xiao,
  Aria Haghighi","TwHIN: Embedding the Twitter Heterogeneous Information Network for
  Personalized Recommendation",,"Proceedings of the 28th ACM SIGKDD Conference on Knowledge
  Discovery and Data Mining (2022)",10.1145/3534678.3539080,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social networks, such as Twitter, form a heterogeneous information network
(HIN) where nodes represent domain entities (e.g., user, content, advertiser,
etc.) and edges represent one of many entity interactions (e.g, a user
re-sharing content or ""following"" another). Interactions from multiple relation
types can encode valuable information about social network entities not fully
captured by a single relation; for instance, a user's preference for accounts
to follow may depend on both user-content engagement interactions and the other
users they follow. In this work, we investigate knowledge-graph embeddings for
entities in the Twitter HIN (TwHIN); we show that these pretrained
representations yield significant offline and online improvement for a diverse
range of downstream recommendation and classification tasks: personalized ads
rankings, account follow-recommendation, offensive content detection, and
search ranking. We discuss design choices and practical challenges of deploying
industry-scale HIN embeddings, including compressing them to reduce end-to-end
model latency and handling parameter drift across versions.
","[{'version': 'v1', 'created': 'Fri, 11 Feb 2022 01:06:34 GMT'}, {'version': 'v2', 'created': 'Mon, 5 Sep 2022 19:08:49 GMT'}]",2022-09-07,"[['El-Kishky', 'Ahmed', ''], ['Markovich', 'Thomas', ''], ['Park', 'Serim', ''], ['Verma', 'Chetan', ''], ['Kim', 'Baekjin', ''], ['Eskander', 'Ramy', ''], ['Malkov', 'Yury', ''], ['Portman', 'Frank', ''], ['Samaniego', 'Sofía', ''], ['Xiao', 'Ying', ''], ['Haghighi', 'Aria', '']]","['heterogeneous information network', 'social network', 'recommendation system', 'embedding', 'graph embedding', 'twitter']"
3721,1407.3986,Haritha Raveendran,"Haritha Raveendran, Deepa Thomas",Image Fusion Using LEP Filtering and Bilinear Interpolation,"5 pages. 4 figures, Published with International Journal of
  Engineering Trends and Technology (IJETT)","International Journal of Engineering Trends and Technology
  (IJETT), V12(9),427-431 June 2014",10.14445/22315381/IJETT-V12P282,,cs.CV,http://creativecommons.org/licenses/by/3.0/,"  Image Fusion is the process in which core information from a set of component
images is merged to form a single image, which is more informative and complete
than the component input images in quality and appearance. This paper presents
a fast and effective image fusion method for creating high quality fused images
by merging component images. In the proposed method, the input image is broken
down to a two-scale image representation with a base layer having large scale
variations in intensity, and a detail layer containing small scale details.
Here fusion of the base and detail layers is implemented by means of a Local
Edge preserving filtering based technique. The proposed method is an efficient
image fusion technique in which the noise component is very low and quality of
the resultant image is high so that it can be used for applications like
medical image processing, requiring very accurate edge preserved images.
Performance is tested by calculating PSNR and SSIM of images. The benefit of
the proposed method is that it removes noise without altering the underlying
structures of the image. This paper also presents an image zooming technique
using bilinear interpolation in which a portion of the input image is cropped
and bilinear interpolation is applied. Experimental results showed that the
when PSNR value is calculated, the noise is found to be very low for the
resultant image portion.
","[{'version': 'v1', 'created': 'Sat, 5 Jul 2014 13:12:39 GMT'}]",2014-07-16,"[['Raveendran', 'Haritha', ''], ['Thomas', 'Deepa', '']]","['LEP Filtering', 'Bilinear interpolation', 'PSNR', 'Naturalness', 'Sharpness', 'SSIM', 'Two-scale decomposition']"
3722,1112.3756,Mohamed El-Zawawy Dr.,Mohamed A. El-Zawawy,Probabilistic pointer analysis for multithreaded programs,12 pages,ScienceAsia 37 (2011): 344-354,10.2306/scienceasia1513-1874.2011.37.344,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of pointers and data-structures based on pointers results in circular
memory references that are interpreted by a vital compiler analysis, namely
pointer analysis. For a pair of memory references at a program point, a typical
pointer analysis specifies if the points-to relation between them may exist,
definitely does not exist, or definitely exists. The ""may be"" case, which
describes the points-to relation for most of the pairs, cannot be dealt with by
most compiler optimizations. This is so to guarantee the soundness of these
optimizations. However, the ""may be"" case can be capitalized by the modern
class of speculative optimizations if the probability that two memory
references alias can be measured. Focusing on multithreading, a prevailing
technique of programming, this paper presents a new flow-sensitive technique
for probabilistic pointer analysis of multithreaded programs. The proposed
technique has the form of a type system and calculates the probability of every
points-to relation at each program point. The key to our approach is to
calculate the points-to information via a post-type derivation. The use of type
systems has the advantage of associating each analysis results with a
justification (proof) for the correctness of the results. This justification
has the form of a type derivation and is very much required in applications
like certified code.
","[{'version': 'v1', 'created': 'Fri, 16 Dec 2011 10:52:35 GMT'}]",2011-12-19,"[['El-Zawawy', 'Mohamed A.', '']]","['Static analysis', 'Speculative optimizations', 'Probabilistic alias analysis', 'Distributed programs', 'Semantics of multithreaded programs', 'Type systems']"
3723,1807.11618,Kamal Al-Sabahi Ph.D.,"Kamal Al-Sabahi, Zuping Zhang, Jun Long, Khaled Alwesabi","An Enhanced Latent Semantic Analysis Approach for Arabic Document
  Summarization","This is a pre-print of an article published in Arabian Journal for
  Science and Engineering. The final authenticated version is available online
  at: https://doi.org/10.1007/s13369-018-3286-z","K. Al-Sabahi, Z. Zhang, J. Long, and K. Alwesabi, ""An Enhanced
  Latent Semantic Analysis Approach for Arabic Document Summarization,"" Arabian
  Journal for Science and Engineering, journal article May 05 2018",10.1007/s13369-018-3286-z,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The fast-growing amount of information on the Internet makes the research in
automatic document summarization very urgent. It is an effective solution for
information overload. Many approaches have been proposed based on different
strategies, such as latent semantic analysis (LSA). However, LSA, when applied
to document summarization, has some limitations which diminish its performance.
In this work, we try to overcome these limitations by applying statistic and
linear algebraic approaches combined with syntactic and semantic processing of
text. First, the part of speech tagger is utilized to reduce the dimension of
LSA. Then, the weight of the term in four adjacent sentences is added to the
weighting schemes while calculating the input matrix to take into account the
word order and the syntactic relations. In addition, a new LSA-based sentence
selection algorithm is proposed, in which the term description is combined with
sentence description for each topic which in turn makes the generated summary
more informative and diverse. To ensure the effectiveness of the proposed
LSA-based sentence selection algorithm, extensive experiment on Arabic and
English are done. Four datasets are used to evaluate the new model, Linguistic
Data Consortium (LDC) Arabic Newswire-a corpus, Essex Arabic Summaries Corpus
(EASC), DUC2002, and Multilingual MSS 2015 dataset. Experimental results on the
four datasets show the effectiveness of the proposed model on Arabic and
English datasets. It performs comprehensively better compared to the
state-of-the-art methods.
","[{'version': 'v1', 'created': 'Tue, 31 Jul 2018 00:50:15 GMT'}]",2018-08-01,"[['Al-Sabahi', 'Kamal', ''], ['Zhang', 'Zuping', ''], ['Long', 'Jun', ''], ['Alwesabi', 'Khaled', '']]","['Latent semantic analysis', 'Automatic text summarization', 'Singular value decomposition', 'Adjacent Weight', 'Part of Speech ((POS']"
3724,1306.0282,Jinyou  Xiao,"Junjie Rong, Lihua Wen, Jinyou Xiao","An efficient method for evaluating BEM singular integrals on curved
  elements with application in acoustic analysis","19 Pages, 10 figures","Engineering Analysis with Boundary Elements, 2014, 38: 83-93",10.1016/j.enganabound.2013.10.014,,cs.CE math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The polar coordinate transformation (PCT) method has been extensively used to
treat various singular integrals in the boundary element method (BEM). However,
the resultant integrands of the PCT tend to become nearly singular when (1) the
aspect ratio of the element is large or (2) the field point is closed to the
element boundary; thus a large number of quadrature points are needed to
achieve a relatively high accuracy. In this paper, the first problem is
circumvented by using a conformal transformation so that the geometry of the
curved physical element is preserved in the transformed domain. The second
problem is alleviated by using a sigmoidal transformation, which makes the
quadrature points more concentrated around the near singularity.
  By combining the proposed two transformations with the Guiggiani's method in
[M. Guiggiani, \emph{et al}.
  A general algorithm for the numerical solution of hypersingular boundary
integral equations.
  \emph{ASME Journal of Applied Mechanics}, 59(1992), 604-614], one obtains an
efficient and robust numerical method for computing the weakly-, strongly- and
hyper-singular integrals in high-order BEM with curved elements. Numerical
integration results show that, compared with the original PCT, the present
method can reduce the number of quadrature points considerably, for given
accuracy. For further verification, the method is incorporated into a 2-order
Nystr\""om BEM code for solving acoustic Burton-Miller boundary integral
equation. It is shown that the method can retain the convergence rate of the
BEM with much less quadrature points than the existing PCT. The method is
implemented in C language and freely available.
","[{'version': 'v1', 'created': 'Mon, 3 Jun 2013 03:09:47 GMT'}]",2015-11-16,"[['Rong', 'Junjie', ''], ['Wen', 'Lihua', ''], ['Xiao', 'Jinyou', '']]","['singular integrals', 'boundary element method', 'Nystr¨om method', 'acoustics']"
3725,1901.09234,Josue Tonelli-Cueto,"Felipe Cucker, Alperen A. Erg\""ur, Josue Tonelli-Cueto",Plantinga-Vegter algorithm takes average polynomial time,"8 pages, correction of typos","ACM Symposium on Symbolic and Algebraic Computation (ISSAC), 2019",10.1145/3326229.3326252,,cs.CG math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We exhibit a condition-based analysis of the adaptive subdivision algorithm
due to Plantinga and Vegter. The first complexity analysis of the PV Algorithm
is due to Burr, Gao and Tsigaridas who proved a $O\big(2^{\tau d^{4}\log
d}\big)$ worst-case cost bound for degree $d$ plane curves with maximum
coefficient bit-size $\tau$. This exponential bound, it was observed, is in
stark contrast with the good performance of the algorithm in practice. More in
line with this performance, we show that, with respect to a broad family of
measures, the expected time complexity of the PV Algorithm is bounded by
$O(d^7)$ for real, degree $d$, plane curves. We also exhibit a smoothed
analysis of the PV Algorithm that yields similar complexity estimates. To
obtain these results we combine robust probabilistic techniques coming from
geometric functional analysis with condition numbers and the continuous
amortization paradigm introduced by Burr, Krahmer and Yap. We hope this will
motivate a fruitful exchange of ideas between the different approaches to
numerical computation.
","[{'version': 'v1', 'created': 'Sat, 26 Jan 2019 15:38:32 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Apr 2019 18:25:46 GMT'}]",2019-07-24,"[['Cucker', 'Felipe', ''], ['Ergür', 'Alperen A.', ''], ['Tonelli-Cueto', 'Josue', '']]","['computational algebraic geometry', 'numerical methods', 'adaptive subdivision methods', 'isotopy of curves', 'complexity']"
3726,1707.02435,Rex Bringula,"Rex P. Bringula, Julius Jan M. Sarmiento, Roselle S. Basa","Computer Self-efficacy and Its Relationship with Web Portal Usage:
  Evidence from the University of the East","6 pages, International Journal of Computing Sciences Research, 2017",,10.25147/ijcsr.2017.001.1.02,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  The University of the East Web Portal is an academic, web based system that
provides educational electronic materials and e-learning services. To fully
optimize its usage, it is imperative to determine the factors that relate to
its usage. Thus, this study, to determine the computer self-efficacy of the
faculty members of the University of the East and its relationship with their
web portal usage, was conceived. Using a validated questionnaire, the profile
of the respondents, their computer self-efficacy, and web portal usage were
gathered. Data showed that the respondents were relatively young (M = 40 years
old), majority had masters degree (f = 85, 72%), most had been using the web
portal for four semesters (f = 60, 51%), and the large part were intermediate
web portal users (f = 69, 59%). They were highly skilled in using the computer
(M = 4.29) and skilled in using the Internet (M = 4.28). E-learning services (M
= 3.29) and online library resources (M = 3.12) were only used occasionally.
Pearson correlation revealed that age was positively correlated with online
library resources (r = 0.267, p < 0.05) and a negative relationship existed
between perceived skill level in using the portal and online library resources
usage (r = -0.206, p < 0.05). A 2x2 chi square revealed that the highest
educational attainment had a significant relationship with online library
resources (chi square = 5.489, df = 1, p < 0.05). Basic computer (r = 0.196, p
< 0.05) and Internet skills (r = 0.303, p < 0.05) were significantly and
positively related with e-learning services usage but not with online library
resources usage. Other individual factors such as attitudes towards the web
portal and anxiety towards using the web portal can be investigated.
","[{'version': 'v1', 'created': 'Sat, 8 Jul 2017 13:06:40 GMT'}]",2017-07-11,"[['Bringula', 'Rex P.', ''], ['Sarmiento', 'Julius Jan M.', ''], ['Basa', 'Roselle S.', '']]","['computer skills', 'Internet skills', 'portal usage', 'self-efficacy', 'web portal']"
3727,2105.09088,Imran Shafique Ansari,"Md. Ibrahim, A. S. M. Badrudduza, Md. Shakhawat Hossen, Milton Kumar
  Kundu, and Imran Shafique Ansari","Enhancing Security of TAS/MRC Based Mixed RF-UOWC System with Induced
  Underwater Turbulence Effect",,,10.1109/JSYST.2021.3123515,,cs.IT eess.SP math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Post commercial deployment of fifth-generation (5G) technologies, the
consideration of sixth-generation (6G) networks is drawing remarkable attention
from research communities. Researchers suggest that similar to 5G, 6G
technology must be human-centric where high secrecy together with high data
rate will be the key features. These challenges can be easily overcome
utilizing PHY security techniques over high-frequency free-space or underwater
optical wireless communication (UOWC) technologies. But in long-distance
communication, turbulence components drastically affect the optical signals,
leading to the invention of the combination of radio-frequency (RF) links with
optical links. This work deals with the secrecy performance analysis of a mixed
RF-UOWC system where an eavesdropper tries to intercept RF communications. RF
and optical links undergo $\eta-\mu$ and mixture exponential generalized Gamma
distributions, respectively. To keep pace with the high data rate of optical
technologies, we exploit the antenna selection scheme at the source and maximal
ratio combining diversity at the relay and eavesdropper, while the eavesdropper
is unaware of the antenna selection scheme. We derive closed-form expressions
of average secrecy capacity, secrecy outage probability, and strictly positive
secrecy capacity to demonstrate the impacts of the system parameters on the
secrecy behavior. Finally, the expressions are corroborated via Monte-Carlo
simulations.
","[{'version': 'v1', 'created': 'Wed, 19 May 2021 12:18:55 GMT'}, {'version': 'v2', 'created': 'Sun, 21 Nov 2021 10:13:48 GMT'}]",2022-12-21,"[['Ibrahim', 'Md.', ''], ['Badrudduza', 'A. S. M.', ''], ['Hossen', 'Md. Shakhawat', ''], ['Kundu', 'Milton Kumar', ''], ['Ansari', 'Imran Shafique', '']]","['Maximal ratio combining', 'physical layer security', 'secure outage probability', 'transmit antenna selection', 'under water optics']"
3728,1702.08192,Christian Wachinger,"Christian Wachinger, Martin Reuter, Tassilo Klein",DeepNAT: Deep Convolutional Neural Network for Segmenting Neuroanatomy,"Accepted for publication in NeuroImage, special issue ""Brain
  Segmentation and Parcellation"", 2017",,10.1016/j.neuroimage.2017.02.035,,cs.CV cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce DeepNAT, a 3D Deep convolutional neural network for the
automatic segmentation of NeuroAnaTomy in T1-weighted magnetic resonance
images. DeepNAT is an end-to-end learning-based approach to brain segmentation
that jointly learns an abstract feature representation and a multi-class
classification. We propose a 3D patch-based approach, where we do not only
predict the center voxel of the patch but also neighbors, which is formulated
as multi-task learning. To address a class imbalance problem, we arrange two
networks hierarchically, where the first one separates foreground from
background, and the second one identifies 25 brain structures on the
foreground. Since patches lack spatial context, we augment them with
coordinates. To this end, we introduce a novel intrinsic parameterization of
the brain volume, formed by eigenfunctions of the Laplace-Beltrami operator. As
network architecture, we use three convolutional layers with pooling, batch
normalization, and non-linearities, followed by fully connected layers with
dropout. The final segmentation is inferred from the probabilistic output of
the network with a 3D fully connected conditional random field, which ensures
label agreement between close voxels. The roughly 2.7 million parameters in the
network are learned with stochastic gradient descent. Our results show that
DeepNAT compares favorably to state-of-the-art methods. Finally, the purely
learning-based method may have a high potential for the adaptation to young,
old, or diseased brains by fine-tuning the pre-trained network with a small
training sample on the target application, where the availability of larger
datasets with manual annotations may boost the overall segmentation accuracy in
the future.
","[{'version': 'v1', 'created': 'Mon, 27 Feb 2017 08:53:31 GMT'}]",2017-02-28,"[['Wachinger', 'Christian', ''], ['Reuter', 'Martin', ''], ['Klein', 'Tassilo', '']]","['Brain segmentation', 'deep learning', 'convolutional neural networks', 'multi-task learning', 'conditional randomfield']"
3729,1810.09146,Natsuki Urabe,"Natsuki Urabe, Ichiro Hasuo",Quantitative Simulations by Matrices,"Extended version of [Urabe & Hasuo, CONCUR 2014]","Information and Computation, Volume 252, February 2017, Pages
  110-137",10.1016/j.ic.2016.03.007,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce notions of simulation between semiring-weighted automata as
models of quantitative systems. Our simulations are instances of the
categorical/coalgebraic notions previously studied by Hasuo---hence soundness
against language inclusion comes for free---but are concretely presented as
matrices that are subject to linear inequality constraints. Pervasiveness of
these formalisms allows us to exploit existing algorithms in: searching for a
simulation, and hence verifying quantitative correctness that is formulated as
language inclusion. Transformations of automata that aid search for simulations
are introduced, too. This verification workflow is implemented for the
plus-times and max-plus semirings. Furthermore, an extension to weighted tree
automata is presented and implemented.
","[{'version': 'v1', 'created': 'Mon, 22 Oct 2018 09:22:16 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Nov 2018 12:51:49 GMT'}]",2018-11-19,"[['Urabe', 'Natsuki', ''], ['Hasuo', 'Ichiro', '']]","['Kleisli category', 'simulation', 'language inclusion', 'weighted automaton', 'tropical semiring']"
3730,1405.6741,Mahboobeh Houshmand,"Mahboobeh Houshmand, Morteza Saheb Zamani, Mehdi Sedighi, Mona
  Arabzadeh","Decomposition of Diagonal Hermitian Quantum Gates Using
  Multiple-Controlled Pauli Z Gates","To Appear in ACM Journal on Emerging Technologies in Computing
  Systems","ACM Journal of Emerging Technologies in Computing Systems (JETC),
  Vol. 11, No. 3, Article 28, 2014",,,cs.ET quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quantum logic decomposition refers to decomposing a given quantum gate to a
set of physically implementable gates. An approach has been presented to
decompose arbitrary diagonal quantum gates to a set of multiplexed-rotation
gates around z axis. In this paper, a special class of diagonal quantum gates,
namely diagonal Hermitian quantum gates, is considered and a new perspective to
the decomposition problem with respect to decomposing these gates is presented.
It is first shown that these gates can be decomposed to a set that solely
consists of multiple-controlled Z gates. Then a binary representation for the
diagonal Hermitian gates is introduced. It is shown that the binary
representations of multiple-controlled Z gates form a basis for the vector
space that is produced by the binary representations of all diagonal Hermitian
quantum gates. Moreover, the problem of decomposing a given diagonal Hermitian
gate is mapped to the problem of writing its binary representation in the
specific basis mentioned above. Moreover, CZ gate is suggested to be the
two-qubit gate in the decomposition library, instead of previously used CNOT
gate. Experimental results show that the proposed approach can lead to circuits
with lower costs in comparison with the previous ones.
","[{'version': 'v1', 'created': 'Mon, 26 May 2014 20:21:12 GMT'}]",2015-12-14,"[['Houshmand', 'Mahboobeh', ''], ['Zamani', 'Morteza Saheb', ''], ['Sedighi', 'Mehdi', ''], ['Arabzadeh', 'Mona', '']]","['Diagonal Hermitian quantum gates', 'Optimization', 'Decomposition']"
3731,1804.03437,Wojciech Skaba,Wojciech Skaba,The AGINAO Self-Programming Engine,Journal of Artificial General Intelligence,Journal of Artificial General Intelligence 3(3) 2012,10.2478/v10229-011-0018-0,,cs.AI,http://creativecommons.org/licenses/by/4.0/,"  The AGINAO is a project to create a human-level artificial general
intelligence system (HL AGI) embodied in the Aldebaran Robotics' NAO humanoid
robot. The dynamical and open-ended cognitive engine of the robot is
represented by an embedded and multi-threaded control program, that is
self-crafted rather than hand-crafted, and is executed on a simulated Universal
Turing Machine (UTM). The actual structure of the cognitive engine emerges as a
result of placing the robot in a natural preschool-like environment and running
a core start-up system that executes self-programming of the cognitive layer on
top of the core layer. The data from the robot's sensory devices supplies the
training samples for the machine learning methods, while the commands sent to
actuators enable testing hypotheses and getting a feedback. The individual
self-created subroutines are supposed to reflect the patterns and concepts of
the real world, while the overall program structure reflects the spatial and
temporal hierarchy of the world dependencies. This paper focuses on the details
of the self-programming approach, limiting the discussion of the applied
cognitive architecture to a necessary minimum.
","[{'version': 'v1', 'created': 'Tue, 10 Apr 2018 10:29:14 GMT'}]",2018-04-11,"[['Skaba', 'Wojciech', '']]","['artificial general intelligence', 'NAO', 'self-programming', 'virtual machine', 'cognitive architecture']"
3732,1912.03593,Alex Hanna,"Alex Hanna, Emily Denton, Andrew Smart, Jamila Smith-Loud",Towards a Critical Race Methodology in Algorithmic Fairness,"Conference on Fairness, Accountability, and Transparency (FAT* '20),
  January 27-30, 2020, Barcelona, Spain",,10.1145/3351095.3372826,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  We examine the way race and racial categories are adopted in algorithmic
fairness frameworks. Current methodologies fail to adequately account for the
socially constructed nature of race, instead adopting a conceptualization of
race as a fixed attribute. Treating race as an attribute, rather than a
structural, institutional, and relational phenomenon, can serve to minimize the
structural aspects of algorithmic unfairness. In this work, we focus on the
history of racial categories and turn to critical race theory and sociological
work on race and ethnicity to ground conceptualizations of race for fairness
research, drawing on lessons from public health, biomedical research, and
social survey research. We argue that algorithmic fairness researchers need to
take into account the multidimensionality of race, take seriously the processes
of conceptualizing and operationalizing race, focus on social processes which
produce racial inequality, and consider perspectives of those most affected by
sociotechnical systems.
","[{'version': 'v1', 'created': 'Sun, 8 Dec 2019 01:42:23 GMT'}]",2019-12-10,"[['Hanna', 'Alex', ''], ['Denton', 'Emily', ''], ['Smart', 'Andrew', ''], ['Smith-Loud', 'Jamila', '']]","['algorithmic fairness', 'critical race theory', 'race and ethnicity']"
3733,1509.02099,Francois Marmier,"Jacques Lamothe (Mines Albi-Carmaux), Fran\c{c}ois Marmier (Mines
  Albi-Carmaux), Matthieu Dupuy (Mines Albi-Carmaux), Paul Gaborit (Mines
  Albi-Carmaux), Lionel Dupont (Mines Albi-Carmaux)","Scheduling rules to minimize total tardiness in a parallel machine
  problem with setup and calendar constraints",,"Computers and Operations Research, 2012, 39 (6), pp.1236-1244.",10.1016/j.cor.2010.07.007,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quality control lead times are one of most significant causes of loss of time
in the pharmaceutical and cosmetics industries. This is partly due to the
organization of laboratories that feature parallel multipurpose machines for
chromatographic analyses. The testing process requires long setup times and
operators are needed to launch the process. The various controls are
non-preemptive and are characterized by a release date, a due date and
available routings. These quality processes lead to significant delays, and we
therefore evaluate the total tardiness criterion. Previous heuristics were
defined for the total tardiness criterion, parallel machines, and setup such as
ATC (Apparent Tardiness Cost) and ATCS (ATC with setups). We propose new rules
and a simulated annealing procedure in order to minimize total tardiness.
","[{'version': 'v1', 'created': 'Mon, 7 Sep 2015 15:56:57 GMT'}]",2015-09-08,"[['Lamothe', 'Jacques', '', 'Mines Albi-Carmaux'], ['Marmier', 'François', '', 'Mines\n  Albi-Carmaux'], ['Dupuy', 'Matthieu', '', 'Mines Albi-Carmaux'], ['Gaborit', 'Paul', '', 'Mines\n  Albi-Carmaux'], ['Dupont', 'Lionel', '', 'Mines Albi-Carmaux']]","['Scheduling', 'parallel machine', 'heuristics', 'simulated annealing']"
3734,1108.1410,Dusan Jakovetic,"Dusan Jakovetic, Jose M. F. Moura, Joao Xavier",Distributed Detection over Noisy Networks: Large Deviations Analysis,"30 pages, journal, submitted August 2nd, 2011",,10.1109/TSP.2012.2197395,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the large deviations performance of consensus+innovations
distributed detection over noisy networks, where sensors at a time step k
cooperate with immediate neighbors (consensus) and assimilate their new
observations (innovation.) We show that, even under noisy communication,
\emph{all sensors} can achieve exponential decay e^{-k C_{\mathrm{dis}}} of the
detection error probability, even when certain (or most) sensors cannot detect
the event of interest in isolation. We achieve this by designing a single time
scale stochastic approximation type distributed detector with the optimal
weight sequence {\alpha_k}, by which sensors weigh their neighbors' messages.
The optimal design of {\alpha_k} balances the opposing effects of communication
noise and information flow from neighbors: larger, slowly decaying \alpha_k
improves information flow but injects more communication noise. Further, we
quantify the best achievable C_{\mathrm{dis}} as a function of the sensing
signal and noise, communication noise, and network connectivity. Finally, we
find a threshold on the communication noise power below which a sensor that can
detect the event in isolation still improves its detection by cooperation
through noisy links.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2011 20:50:46 GMT'}]",2015-05-30,"[['Jakovetic', 'Dusan', ''], ['Moura', 'Jose M. F.', ''], ['Xavier', 'Joao', '']]","['Noisy communication', 'distributed detection', 'Chernoff information', 'large deviations']"
3735,1512.04832,Amos Korman,"Liah Kor, Amos Korman (GANG, LIAFA), David Peleg",Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification,,"Theory of Computing Systems, Springer Verlag, 2013,
  \&lt;10.1007/s00224-013-9479-7\&gt;",10.1007/s00224-013-9479-7,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces the notion of distributed verification without
preprocessing. It focuses on the Minimum-weight Spanning Tree (MST)
verification problem and establishes tight upper and lower bounds for the time
and message complexities of this problem. Specifically, we provide an MST
verification algorithm that achieves simultaneously O(m) messages and O($\sqrt$
n+D) time, where m is the number of edges in the given graph G, n is the number
of nodes, and D is G's diameter. On the other hand, we show that any MST
verification algorithm must send {\Omega}(m) messages and incur
{\Omega}($\sqrt$ n + D) time in worst case. Our upper bound result appears to
indicate that the verification of an MST may be easier than its construction,
since for MST construction, both lower bounds of {\Omega}(m) messages and
{\Omega}($\sqrt$ n+D time hold, but at the moment there is no known distributed
algorithm that constructs an MST and achieves simultaneously O(m) messages and
O($\sqrt$ n + D) time. Specifically, the best known time-optimal algorithm
(using O($\sqrt$ n + D) time) requires O(m + n 3/2) messages, and the best
known message-optimal algorithm (using O(m) messages) requires O(n) time. On
the other hand, our lower bound results indicate that the verification of an
MST is not significantly easier than its construction.
","[{'version': 'v1', 'created': 'Tue, 15 Dec 2015 16:01:53 GMT'}]",2015-12-16,"[['Kor', 'Liah', '', 'GANG, LIAFA'], ['Korman', 'Amos', '', 'GANG, LIAFA'], ['Peleg', 'David', '']]","['Distributed algorithms', 'distributed verification', 'labeling schemes', 'minimum-weightspanning tree']"
3736,1512.07491,Hui Li,"Hui Li (INL), Alain Fourmigue, S\'ebastien Le Beux (INL), Xavier
  Letartre (INL), Ian O 'Connor (INL), Gabriela Nicolescu",Thermal Aware Design Method for VCSEL-Based On-Chip Optical Interconnect,"IEEE International Conference on Design Automation and Test in Europe
  (DATE 2015), Mar 2015, Grenoble, France. 2015",,10.7873/DATE.2015.0479,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optical Network-on-Chip (ONoC) is an emerging technology considered as one of
the key solutions for future generation on-chip interconnects. However, silicon
photonic devices in ONoC are highly sensitive to temperature variation, which
leads to a lower efficiency of Vertical-Cavity Surface-Emitting Lasers
(VCSELs), a resonant wavelength shift of Microring Resonators (MR), and results
in a lower Signal to Noise Ratio (SNR). In this paper, we propose a methodology
enabling thermal-aware design for optical interconnects relying on
CMOS-compatible VCSEL. Thermal simulations allow designing ONoC interfaces with
low gradient temperature and analytical models allow evaluating the SNR.
","[{'version': 'v1', 'created': 'Wed, 23 Dec 2015 14:29:24 GMT'}]",2015-12-24,"[['Li', 'Hui', '', 'INL'], ['Fourmigue', 'Alain', '', 'INL'], ['Beux', 'Sébastien Le', '', 'INL'], ['Letartre', 'Xavier', '', 'INL'], [""'Connor"", 'Ian O', '', 'INL'], ['Nicolescu', 'Gabriela', '']]","['ONoC', 'design methodology', 'thermal simulation']"
3737,1705.08382,Thanh Thoa Pham Thi Dr.,"Thanh Thoa Pham Thi, Markus Helfert","Monitoring Information Quality within Web Service Composition and
  Execution","International Conference on Information Systems Development, ISD
  2011, Springer",,10.1007/978-1-4614-4951-5_47,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The composition of web services is a promising approach enabling flexible and
loose integration of business applications. Numerous approaches related to web
services composition have been developed usually following three main phases:
the service discovery is based on the semantic description of advertised
services, i.e. the functionality of the service, meanwhile the service
selection is based on non- functional quality dimensions of service, and
finally the service composition aims to support an underlying process. Most of
those approaches explore techniques of static or dynamic design for an optimal
service composition. One important aspect so far is mostly neglected, focusing
on the output produced of composite web services. In this paper, in contrast to
many prominent approaches we introduce a data quality perspective on web
services. Based on a data quality management approach, we propose a framework
for analyzing data produced by the composite service execution. Utilising
process information together with data in service logs, our approach allows
identifying problems in service composition and execution. Analyzing the
service execution history our approach helps to improve common approaches of
service selection and composition.
","[{'version': 'v1', 'created': 'Sat, 22 Apr 2017 14:44:40 GMT'}]",2017-05-24,"[['Thi', 'Thanh Thoa Pham', ''], ['Helfert', 'Markus', '']]","['service composition', 'service orchestration', 'data quality', 'business rules', 'business process']"
3738,1610.02534,Chengqing Li,"Chengqing Li, Shujun Li, Muhammad Asim, Juana Nunez, Gonzalo Alvarez,
  Guanrong Chen",On the security defects of an image encryption scheme,14 pages; 8 figures; 5 tables,"Image and Vision Computing, 27(9): 1371-1381, 2009",10.1016/j.imavis.2008.12.008,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies the security of a recently-proposed chaos-based image
encryption scheme, and points out the following problems: 1) there exist a
number of invalid keys and weak keys, and some keys are partially equivalent
for encryption/decryption; 2) given one chosen plain-image, a subkey $K_{10}$
can be guessed with a smaller computational complexity than that of the simple
brute-force attack; 3) given at most 128 chosen plain-images, a
chosen-plaintext attack can possibly break the following part of the secret
key: $\{K_i\bmod 128\}_{i=4}^{10}$, which works very well when $K_{10}$ is not
too large; 4) when $K_{10}$ is relatively small, a known-plaintext attack can
be carried out with only one known plain-image to recover some visual
information of any other plain-images encrypted by the same key.
","[{'version': 'v1', 'created': 'Sat, 8 Oct 2016 14:16:42 GMT'}]",2016-10-11,"[['Li', 'Chengqing', ''], ['Li', 'Shujun', ''], ['Asim', 'Muhammad', ''], ['Nunez', 'Juana', ''], ['Alvarez', 'Gonzalo', ''], ['Chen', 'Guanrong', '']]","['cryptanalysis', 'image encryption', 'chaos', 'known-plaintext attack', 'chosen-plaintext attack']"
3739,2102.09805,Mesam Zarei,Seyed Meysam Zarei and Reza Fotohi,"Defense against flooding attacks using probabilistic thresholds in the
  internet of things ecosystem","19 pages, 8 Figure, 9 Table",Security and Privacy. 2021;e152,10.1002/spy2.152,,cs.CR cs.NI,http://creativecommons.org/licenses/by/4.0/,"  The Internet of Things (IoT) ecosystem allows communication between billions
of devices worldwide that are collecting data autonomously. The vast amount of
data generated by these devices must be controlled totally securely. The
centralized solutions are not capable of responding to these concerns due to
security challenges problems. Thus, the Average Packet Transmission RREQ
(APT-RREQ) as an effective solution, has been employed to overcome these
concerns to allow for entirely secure communication between devices. In this
paper, an approach called LSFA-IoT is proposed that protects the AODV routing
protocol as well as the IoT network against flooding. The proposed method is
divided into two main phases; The first phase includes a physical layer
intrusion and attack detection system used to detect attacks, and the second
phase involves detecting incorrect events through APT-RREQ messages. The
simulation results indicated the superiority of the proposed method in terms of
False Positive Rate (FPR), False Negative Rate (FPR), Detection Rate (DR), and
Packet Delivery Rate (PDR) compared to REATO and IRAD. Also, the simulation
results show how the proposed approach can significantly increase the security
of each thing and network security.
","[{'version': 'v1', 'created': 'Fri, 19 Feb 2021 08:36:59 GMT'}]",2021-02-22,"[['Zarei', 'Seyed Meysam', ''], ['Fotohi', 'Reza', '']]","['Internet of Things (IoT)', 'Flooding attacks', 'Routing security']"
3740,1203.1765,Kom Guillaume,"Guillaume Kom, Alain Tiedeu, Martin Kom, John Ngundam","A comparative evaluation of two algorithms of detection of masses on
  mammograms","9 pages, 5 figures, 1 table, Vol.3, No.1, February 2012,pp19-27;
  Signal & Image Processing : An International Journal (SIPIJ),2012",,10.5121/sipij.2012.3102,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we implement and carry out the comparison of two methods of
computer-aided-detection of masses on mammograms. The two algorithms basically
consist of 3 steps each: segmentation, binarization and noise suppression using
different techniques for each step. A database of 60 images was used to compare
the performance of the two algorithms in terms of general detection efficiency,
conservation of size and shape of detected masses.
","[{'version': 'v1', 'created': 'Thu, 8 Mar 2012 12:07:27 GMT'}]",2012-03-09,"[['Kom', 'Guillaume', ''], ['Tiedeu', 'Alain', ''], ['Kom', 'Martin', ''], ['Ngundam', 'John', '']]","['Computer-aided-detection', 'contrast-enhancement', 'segmentation', 'binarization']"
3741,1602.00621,Marius Nicolae,Marius Nicolae and Sanguthevar Rajasekaran,On pattern matching with k mismatches and few don't cares,"Information Processing Letters, Available online 27 October 2016,
  ISSN 0020-0190",,10.1016/j.ipl.2016.10.003,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of pattern matching with $k$ mismatches, where there
can be don't care or wild card characters in the pattern. Specifically, given a
pattern $P$ of length $m$ and a text $T$ of length $n$, we want to find all
occurrences of $P$ in $T$ that have no more than $k$ mismatches. The pattern
can have don't care characters, which match any character. Without don't cares,
the best known algorithm for pattern matching with $k$ mismatches has a runtime
of $O(n\sqrt{k \log k})$. With don't cares in the pattern, the best
deterministic algorithm has a runtime of $O(nk polylog m)$. Therefore, there is
an important gap between the versions with and without don't cares.
  In this paper we give an algorithm whose runtime increases with the number of
don't cares. We define an {\em island} to be a maximal length substring of $P$
that does not contain don't cares. Let $q$ be the number of islands in $P$. We
present an algorithm that runs in $O(n\sqrt{k\log m}+n\min\{\sqrt[3]{qk\log^2
m},\sqrt{q\log m}\})$ time. If the number of islands $q$ is $O(k)$ this runtime
becomes $O(n\sqrt{k\log m})$, which essentially matches the best known runtime
for pattern matching with $k$ mismatches without don't cares. If the number of
islands $q$ is $O(k^2)$, this algorithm is asymptotically faster than the
previous best algorithm for pattern matching with $k$ mismatches with don't
cares in the pattern.
","[{'version': 'v1', 'created': 'Mon, 1 Feb 2016 18:08:47 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Oct 2016 18:12:13 GMT'}]",2016-10-31,"[['Nicolae', 'Marius', ''], ['Rajasekaran', 'Sanguthevar', '']]","['pattern matching with k mismatches and don’t cares', 'kmismatches with wild cards', 'k mismatches with don’t cares in the pattern']"
3742,1108.6239,Alfredo Braunstein,Alfredo Braunstein and Farbod Kayhan and Riccardo Zecchina,"Efficient data compression from statistical physics of codes over finite
  fields","10 pages, 4 figures","Phys. Rev. E 84, 051111 (2011)",10.1103/PhysRevE.84.051111,,cs.IT cond-mat.stat-mech math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we discuss a novel data compression technique for binary
symmetric sources based on the cavity method over a Galois Field of order q
(GF(q)). We present a scheme of low complexity and near optimal empirical
performance. The compression step is based on a reduction of sparse low density
parity check codes over GF(q) and is done through the so called reinforced
belief-propagation equations. These reduced codes appear to have a non-trivial
geometrical modification of the space of codewords which makes such compression
computationally feasible. The computational complexity is O(d.n.q.log(q)) per
iteration, where d is the average degree of the check nodes and n is the number
of bits. For our code ensemble, decompression can be done in a time linear in
the code's length by a simple leaf-removal algorithm.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2011 14:27:20 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Oct 2011 12:31:33 GMT'}]",2013-09-03,"[['Braunstein', 'Alfredo', ''], ['Kayhan', 'Farbod', ''], ['Zecchina', 'Riccardo', '']]","['cavity method', 'reinforced belief propagation', 'source coding', 'lossy compression', 'optimization onrandom graphs']"
3743,1101.0858,Animashree Anandkumar,"Paul Balister, B\'ela Bollob\'as, Animashree Anandkumar, Alan Willsky","Energy-Latency Tradeoff for In-Network Function Computation in Random
  Networks",A shorter version appears in Proc. of IEEE INFOCOM 2011,,10.1109/INFCOM.2011.5934949,,cs.NI math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of designing policies for in-network function computation with
minimum energy consumption subject to a latency constraint is considered. The
scaling behavior of the energy consumption under the latency constraint is
analyzed for random networks, where the nodes are uniformly placed in growing
regions and the number of nodes goes to infinity. The special case of sum
function computation and its delivery to a designated root node is considered
first. A policy which achieves order-optimal average energy consumption in
random networks subject to the given latency constraint is proposed. The
scaling behavior of the optimal energy consumption depends on the path-loss
exponent of wireless transmissions and the dimension of the Euclidean region
where the nodes are placed. The policy is then extended to computation of a
general class of functions which decompose according to maximal cliques of a
proximity graph such as the $k$-nearest neighbor graph or the geometric random
graph. The modified policy achieves order-optimal energy consumption albeit for
a limited range of latency constraints.
","[{'version': 'v1', 'created': 'Wed, 5 Jan 2011 00:37:48 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Jan 2011 01:31:45 GMT'}]",2016-11-17,"[['Balister', 'Paul', ''], ['Bollobás', 'Béla', ''], ['Anandkumar', 'Animashree', ''], ['Willsky', 'Alan', '']]","['Function computation', 'latency-energy tradeoff', 'Euclidean random graphs', 'minimumbroadcast problem']"
3744,1907.12325,Maksim Jenihhin,"Adeboye Stephen Oyeniran, Raimund Ubar, Maksim Jenihhin, Cemil Cem
  Gursoy, Jaan Raik",Mixed-level identification of fault redundancy in microprocessors,2019 IEEE Latin American Test Symposium (LATS),"2019 IEEE Latin American Test Symposium (LATS), Santiago, Chile,
  2019, pp. 1-6",10.1109/LATW.2019.8704591,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new high-level implementation independent functional fault model for
control faults in microprocessors is introduced. The fault model is based on
the instruction set, and is specified as a set of data constraints to be
satisfied by test data generation. We show that the high-level test, which
satisfies these data constraints, will be sufficient to guarantee the detection
of all non-redundant low level faults. The paper proposes a simple and fast
simulation based method of generating test data, which satisfy the constraints
prescribed by the proposed fault model, and a method of evaluating the
high-level control fault coverage for the proposed fault model and for the
given test. A method is presented for identification of the high-level
redundant faults, and it is shown that a test, which provides 100% coverage of
non-redundant high-level faults, will also guarantee 100% non-redundant SAF
coverage, whereas all gate-level SAF not covered by the test are identified as
redundant. Experimental results of test generation for the execution part of a
microprocessor support the results presented in the paper.
","[{'version': 'v1', 'created': 'Mon, 29 Jul 2019 10:47:27 GMT'}]",2019-07-30,"[['Oyeniran', 'Adeboye Stephen', ''], ['Ubar', 'Raimund', ''], ['Jenihhin', 'Maksim', ''], ['Gursoy', 'Cemil Cem', ''], ['Raik', 'Jaan', '']]","['processor core testing', 'high-level control fault model', 'high-level fault simulation', 'fault coverage', 'fault redundancy']"
3745,1804.03357,Yasushi Tanaka,"Yasushi Tanaka, Hajimu Iida, Yasuhiro Takemura",A Manga-Driven System Requirements Development PBL Exercise,SEEM2018,,10.1145/3194779.3194788,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We conducted a Project-Based Learning (PBL)-type exercise incorporating
Japanese cartoon (manga) techniques into Requirements Development (RD)
processes. Manga has established techniques, such as those for character
setting and story development, that we thought are also valid for RD processes.
Using this manga-driven method, students were able to clarify high-level
project goals early in the development life-cycle, and succeeded in defining
high quality and unique system ideas.
","[{'version': 'v1', 'created': 'Tue, 10 Apr 2018 06:26:20 GMT'}]",2018-04-11,"[['Tanaka', 'Yasushi', ''], ['Iida', 'Hajimu', ''], ['Takemura', 'Yasuhiro', '']]","['PBL', 'requirements development', 'manga']"
3746,1511.09324,Alejandro D\'iaz-Caro,Alejandro D\'iaz-Caro and Pablo E. Mart\'inez L\'opez,"Isomorphisms considered as equalities: Projecting functions and
  enhancing partial application through and implementation of lambda+","A prototype writen in Haskell can be found at
  http://diaz-caro.web.unq.edu.ar/IsoAsEq-v1.0.tar.gz","ACM Proceedings of IFL'15(9), 2015",10.1145/2897336.2897346,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an implementation of lambda+, a recently introduced simply typed
lambda-calculus with pairs where isomorphic types are made equal. The rewrite
system of lambda+ is a rewrite system modulo an equivalence relation, which
makes its implementation non-trivial. We also extend lambda+ with natural
numbers and general recursion and use Beki\'c's theorem to split mutual
recursions. This splitting, together with the features of lambda+, allows for a
novel way of program transformation by reduction, by projecting a function
before it is applied in order to simplify it. Also, currying together with the
associativity and commutativity of pairs gives an enhanced form of partial
application.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2015 14:30:29 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Feb 2016 16:33:07 GMT'}]",2018-11-06,"[['Díaz-Caro', 'Alejandro', ''], ['López', 'Pablo E. Martínez', '']]","['λ-calculus', 'type isomorphisms', 'implementation']"
3747,1303.1243,M.M.A. Hashem,"Md. Amjad Hossain, Md. Kawser Hossain, and M.M.A. Hashem","A Generalized Hybrid Real-Coded Quantum Evolutionary Algorithm Based on
  Particle Swarm Theory with Arithmetic Crossover",http://airccse.org/journal/jcsit/0810ijcsit15.pdf,"International Journal of Computers Science and Information
  Technology (IJCSIT), Vol. 2, No. 4, pp.172-187, (2010)",10.5121/ijcsit.2010.2415,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a generalized Hybrid Real-coded Quantum Evolutionary
Algorithm (HRCQEA) for optimizing complex functions as well as combinatorial
optimization. The main idea of HRCQEA is to devise a new technique for mutation
and crossover operators. Using the evolutionary equation of PSO a
Single-Multiple gene Mutation (SMM) is designed and the concept of Arithmetic
Crossover (AC) is used in the new Crossover operator. In HRCQEA, each triploid
chromosome represents a particle and the position of the particle is updated
using SMM and Quantum Rotation Gate (QRG), which can make the balance between
exploration and exploitation. Crossover is employed to expand the search space,
Hill Climbing Selection (HCS) and elitism help to accelerate the convergence
speed. Simulation results on Knapsack Problem and five benchmark complex
functions with high dimension show that HRCQEA performs better in terms of
ability to discover the global optimum and convergence speed.
","[{'version': 'v1', 'created': 'Wed, 6 Mar 2013 02:55:20 GMT'}]",2013-03-07,"[['Hossain', 'Md. Amjad', ''], ['Hossain', 'Md. Kawser', ''], ['Hashem', 'M. M. A.', '']]","['Hybrid Algorithm', 'Evolutionary Algorithm', 'Particle Swarm Optimization', 'Quantum Evolutionary Algorithm', 'Arithmetic Crossover']"
3748,1804.09427,Antonio Rivero Ostoic,J. Antonio Rivero Ostoic,"Compositional Equivalence with actor attributes: Positional analysis of
  the the Florentine Families network","14 pages, 5 figures, II tables",,10.21307/connections-2017-004,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper extends Compositional Equivalence ---which is a structural
correspondence type aimed for multiplex networks--- by incorporating actor
attributes in the modelling of the network relational structure as diagonal
matrices. As an illustration, we construct the positional system of the
Florentine families' network in the 15th century with Business and Marriage
ties together with relevant characteristics acquired from the actors such as
families' financial Wealth and their number of Priorates. Different
representations of the cumulated person hierarchies reveal that adding Wealth
in the modelling provides a more accurate picture of what the substantial
narrative says about this network.
","[{'version': 'v1', 'created': 'Wed, 25 Apr 2018 08:44:53 GMT'}]",2022-02-08,"[['Ostoic', 'J. Antonio Rivero', '']]","['Multiplex networks', 'Positional analysis', 'Actor attributes']"
3749,1502.01424,Helio M. de Oliveira,"V.V. Vermehren, J.E. Wesen and H.M. de Oliveira",Close Approximations for Daublets and their Spectra,"6 pages, 6 figures, 3 tables. Conference: International
  Telecommunication Symposium, ITS 2010, Manaus, AM , Brazil",,10.14209/SBRT.2010.68,,cs.NA math.CA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper offers a new regard on compactly supported wavelets derived from
FIR filters. Although being continuous wavelets, analytical formulation are
lacking for such wavelets. Close approximations for daublets (Daubechies
wavelets) and their spectra are introduced here. The frequency detection
properties of daublets are investigated through scalograms derived from these
new analytical expressions. These near-daublets have been implemented on the
Matlab wavelet toolbox and a few scalograms presented. This approach can be
valuable for wavelet synthesis from hardware or for application involving
continuous wavelet-based systems, such as wavelet OFDM.
","[{'version': 'v1', 'created': 'Thu, 5 Feb 2015 03:33:34 GMT'}]",2019-09-27,"[['Vermehren', 'V. V.', ''], ['Wesen', 'J. E.', ''], ['de Oliveira', 'H. M.', '']]","['Wavelets', 'compactly support', 'Fourier', 'Scalogram', 'OFDM']"
3750,1811.09036,Isidro Cortes-Ciriano PhD,Isidro Cortes Ciriano and Andreas Bender,"KekuleScope: prediction of cancer cell line sensitivity and compound
  potency using convolutional neural networks trained on compound images",,,10.1186/s13321-019-0364-5,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The application of convolutional neural networks (ConvNets) to harness
high-content screening images or 2D compound representations is gaining
increasing attention in drug discovery. However, existing applications often
require large data sets for training, or sophisticated pretraining schemes.
Here, we show using 33 IC50 data sets from ChEMBL 23 that the in vitro activity
of compounds on cancer cell lines and protein targets can be accurately
predicted on a continuous scale from their Kekule structure representations
alone by extending existing architectures, which were pretrained on unrelated
image data sets. We show that the predictive power of the generated models is
comparable to that of Random Forest (RF) models and fully-connected Deep Neural
Networks trained on circular (Morgan) fingerprints. Notably, including
additional fully-connected layers further increases the predictive power of the
ConvNets by up to 10%. Analysis of the predictions generated by RF models and
ConvNets shows that by simply averaging the output of the RF models and
ConvNets we obtain significantly lower errors in prediction for multiple data
sets, although the effect size is small, than those obtained with either model
alone, indicating that the features extracted by the convolutional layers of
the ConvNets provide complementary predictive signal to Morgan fingerprints.
Lastly, we show that multi-task ConvNets trained on compound images permit to
model COX isoform selectivity on a continuous scale with errors in prediction
comparable to the uncertainty of the data. Overall, in this work we present a
set of ConvNet architectures for the prediction of compound activity from their
Kekule structure representations with state-of-the-art performance, that
require no generation of compound descriptors or use of sophisticated image
processing techniques.
","[{'version': 'v1', 'created': 'Thu, 22 Nov 2018 06:45:22 GMT'}, {'version': 'v2', 'created': 'Sat, 22 Jun 2019 10:50:20 GMT'}]",2019-06-25,"[['Ciriano', 'Isidro Cortes', ''], ['Bender', 'Andreas', '']]","['Convolutional Neural Networks', 'Deep Learning', 'Drug Discovery', 'Bioactivity Modelling', 'Random Forest', 'Cytotoxicity', 'ChEMBL']"
3751,1208.2518,Lovro \v{S}ubelj,"Lovro \v{S}ubelj, Marko Bajec","Software systems through complex networks science: Review, analysis and
  applications",,"Proceedings of the KDD Workshop on Software Mining 2012
  (SoftwareMining '12), pp. 8",10.1145/2384416.2384418,,cs.SI cs.SE physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Complex software systems are among most sophisticated human-made systems, yet
only little is known about the actual structure of 'good' software. We here
study different software systems developed in Java from the perspective of
network science. The study reveals that network theory can provide a prominent
set of techniques for the exploratory analysis of large complex software
system. We further identify several applications in software engineering, and
propose different network-based quality indicators that address software
design, efficiency, reusability, vulnerability, controllability and other. We
also highlight various interesting findings, e.g., software systems are highly
vulnerable to processes like bug propagation, however, they are not easily
controllable.
","[{'version': 'v1', 'created': 'Mon, 13 Aug 2012 08:05:18 GMT'}]",2013-05-24,"[['Šubelj', 'Lovro', ''], ['Bajec', 'Marko', '']]","['Software systems', 'Software engineering', 'Software networks', 'Network analysis']"
3752,1908.01338,Sudhakar Singh,"Pankaj Singh, Sudhakar Singh, P. K. Mishra, Rakhi Garg",A Data Structure Perspective to the RDD-based Apriori Algorithm on Spark,14 pages,"International Journal of Information Technology, Springer, 2019",10.1007/s41870-019-00337-3,BJIT-D-18-00717,cs.DC cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During the recent years, a number of efficient and scalable frequent itemset
mining algorithms for big data analytics have been proposed by many
researchers. Initially, MapReduce-based frequent itemset mining algorithms on
Hadoop cluster were proposed. Although, Hadoop has been developed as a cluster
computing system for handling and processing big data, but the performance of
Hadoop does not meet the expectation for the iterative algorithms of data
mining, due to its high I/O, and writing and then reading intermediate results
in the disk. Consequently, Spark has been developed as another cluster
computing infrastructure which is much faster than Hadoop due to its in-memory
computation. It is highly suitable for iterative algorithms and supports batch,
interactive, iterative, and stream processing of data. Many frequent itemset
mining algorithms have been re-designed on the Spark, and most of them are
Apriori-based. All these Spark-based Apriori algorithms use Hash Tree as the
underlying data structure. This paper investigates the efficiency of various
data structures for the Spark-based Apriori. Although, the data structure
perspective has been investigated previously, but for MapReduce-based Apriori,
and it must be re-investigated in the distributed computing environment of
Spark. The considered underlying data structures are Hash Tree, Trie, and Hash
Table Trie. The experimental results on the benchmark datasets show that the
performance of Spark-based Apriori with Trie and Hash Table Trie are almost
similar but both perform many times better than Hash Tree in the distributed
computing environment of Spark.
","[{'version': 'v1', 'created': 'Sun, 4 Aug 2019 13:13:28 GMT'}]",2019-08-06,"[['Singh', 'Pankaj', ''], ['Singh', 'Sudhakar', ''], ['Mishra', 'P. K.', ''], ['Garg', 'Rakhi', '']]","['Parallel and Distributed Algorithms', 'Big Data Analytics', 'Frequent Itemset Mining', 'Apriori', 'Spark', 'RDD']"
3753,1908.03121,Patrick Diehl,"Gregor Dai{\ss} and Parsa Amini and John Biddiscombe and Patrick Diehl
  and Juhan Frank and Kevin Huck and Hartmut Kaiser and Dominic Marcello and
  David Pfander and Dirk Pfl\""uger","From Piz Daint to the Stars: Simulation of Stellar Mergers using
  High-Level Abstractions",Accepted at SC19,,10.1145/3295500.3356221,,cs.DC cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the simulation of stellar mergers, which requires complex
simulations with high computational demands. We have developed Octo-Tiger, a
finite volume grid-based hydrodynamics simulation code with Adaptive Mesh
Refinement which is unique in conserving both linear and angular momentum to
machine precision. To face the challenge of increasingly complex, diverse, and
heterogeneous HPC systems, Octo-Tiger relies on high-level programming
abstractions.
  We use HPX with its futurization capabilities to ensure scalability both
between nodes and within, and present first results replacing MPI with
libfabric achieving up to a 2.8x speedup. We extend Octo-Tiger to heterogeneous
GPU-accelerated supercomputers, demonstrating node-level performance and
portability. We show scalability up to full system runs on Piz Daint. For the
scenario's maximum resolution, the compute-critical parts (hydrodynamics and
gravity) achieve 68.1% parallel efficiency at 2048 nodes.
","[{'version': 'v1', 'created': 'Thu, 8 Aug 2019 15:35:02 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Aug 2019 16:40:40 GMT'}]",2019-11-28,"[['Daiß', 'Gregor', ''], ['Amini', 'Parsa', ''], ['Biddiscombe', 'John', ''], ['Diehl', 'Patrick', ''], ['Frank', 'Juhan', ''], ['Huck', 'Kevin', ''], ['Kaiser', 'Hartmut', ''], ['Marcello', 'Dominic', ''], ['Pfander', 'David', ''], ['Pflüger', 'Dirk', '']]","['binary star merger', 'high-level abstractions', 'accelerators', 'libfabric', 'HPX', 'asynchronous', 'futures']"
3754,1303.0004,Denis Krotov,"Denis Krotov (Sobolev Institute of Mathematics, Novosibirsk, Russia),
  Vladimir Potapov (Sobolev Institute of Mathematics, Novosibirsk, Russia)",Constructions of transitive latin hypercubes,"18 pages. v3: revised, accepted version; v2: the paper has been
  completely rewritten (v1 can contain incorrect statements)","Eur. J. Comb. 54, 2016, 51-64",10.1016/j.ejc.2015.12.001,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A function $f:\{0,...,q-1\}^n\to\{0,...,q-1\}$ invertible in each argument is
called a latin hypercube. A collection $(\pi_0,\pi_1,...,\pi_n)$ of
permutations of $\{0,...,q-1\}$ is called an autotopism of a latin hypercube
$f$ if $\pi_0f(x_1,...,x_n)=f(\pi_1x_1,...,\pi_n x_n)$ for all $x_1$, ...,
$x_n$. We call a latin hypercube isotopically transitive (topolinear) if its
group of autotopisms acts transitively (regularly) on all $q^n$ collections of
argument values. We prove that the number of nonequivalent topolinear latin
hypercubes grows exponentially with respect to $\sqrt{n}$ if $q$ is even and
exponentially with respect to $n^2$ if $q$ is divisible by a square. We show a
connection of the class of isotopically transitive latin squares with the class
of G-loops, known in noncommutative algebra, and establish the existence of a
topolinear latin square that is not a group isotope. We characterize the class
of isotopically transitive latin hypercubes of orders $q=4$ and $q=5$.
Keywords: transitive code, propelinear code, latin square, latin hypercube,
autotopism, G-loop.
","[{'version': 'v1', 'created': 'Thu, 28 Feb 2013 21:00:01 GMT'}, {'version': 'v2', 'created': 'Mon, 4 May 2015 14:17:37 GMT'}, {'version': 'v3', 'created': 'Wed, 28 Aug 2019 05:32:29 GMT'}]",2019-08-29,"[['Krotov', 'Denis', '', 'Sobolev Institute of Mathematics, Novosibirsk, Russia'], ['Potapov', 'Vladimir', '', 'Sobolev Institute of Mathematics, Novosibirsk, Russia']]","['transitive code', 'propelinear code', 'latin square', 'latin hypercube', 'autotopism', 'G-loop']"
3755,2102.03270,Jinseok Kim,Jinseok Kim and Jana Diesner,Over-time measurement of triadic closure in coauthorship networks,19 pages,"Social Network Analysis and Mining, 7(1), 1-12 (2017)",10.1007/s13278-017-0428-3,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Applying the concept of triadic closure to coauthorship networks means that
scholars are likely to publish a joint paper if they have previously coauthored
with the same people. Prior research has identified moderate to high (20% to
40%) closure rates; suggesting that this mechanism is a reasonable explanation
for tie formation between future coauthors. We show how calculating triadic
closure based on prior operationalizations of closure, namely Newman's measure
for one-mode networks (NCC) and Opsahl's measure for two-mode networks (OCC),
may lead to higher amounts of closure as compared to measuring closure over
time via a metric that we introduce and test in this paper. Based on empirical
experiments using four large-scale, longitudinal datasets, we find a lower
bound of about 1~3% closure rates and an upper bound of about 4~7%. These
results motivate research on new explanatory factors for the formation of
coauthorship links.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2021 16:23:15 GMT'}]",2021-02-08,"[['Kim', 'Jinseok', ''], ['Diesner', 'Jana', '']]","['clustering coefficient', 'transitivity', 'triadic closure', 'scientific collaboration networks']"
3756,1805.05854,Xin-She Yang,"Asma Chakri, Rabia Khelif, Mohamed Benouaret, Xin-She Yang",New directional bat algorithm for continuous optimization problems,,"Expert Systems with Applications, vol. 69, 159-175 (2017)",10.1016/j.eswa.2016.10.050,,cs.NE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bat algorithm (BA) is a recent optimization algorithm based on swarm
intelligence and inspiration from the echolocation behavior of bats. One of the
issues in the standard bat algorithm is the premature convergence that can
occur due to the low exploration ability of the algorithm under some
conditions. To overcome this deficiency, directional echolocation is introduced
to the standard bat algorithm to enhance its exploration and exploitation
capabilities. In addition to such directional echolocation, three other
improvements have been embedded into the standard bat algorithm to enhance its
performance. The new proposed approach, namely the directional Bat Algorithm
(dBA), has been then tested using several standard and non-standard benchmarks
from the CEC2005 benchmark suite. The performance of dBA has been compared with
ten other algorithms and BA variants using non-parametric statistical tests.
The statistical test results show the superiority of the directional bat
algorithm.
","[{'version': 'v1', 'created': 'Sun, 22 Apr 2018 10:36:56 GMT'}]",2018-05-16,"[['Chakri', 'Asma', ''], ['Khelif', 'Rabia', ''], ['Benouaret', 'Mohamed', ''], ['Yang', 'Xin-She', '']]","['Bio-inspired algorithm', 'Directional bat algorithm', 'Optimization', 'Unconstrained optimization', 'Swarm intelligence']"
3757,1611.05170,Charith Perera,"Luiz H. Nunes, Julio C. Estrella, Alexandre C. B. Delbem, Charith
  Perera, Stephan Reiff-Marganiec","The Effects of Relative Importance of User Constraints in Cloud of
  Things Resource Discovery: A Case Study","Proceedings of the 9th IEEE/ACM International Conference on Utility
  and Cloud Computing (UCC 2016) Shaghai, China, December, 2016","Proceedings of the 9th IEEE/ACM International Conference on
  Utility and Cloud Computing (UCC 2016) Shaghai, China, December, 2016",,,cs.AI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the last few years, the number of smart objects connected to the
Internet has grown exponentially in comparison to the number of services and
applications. The integration between Cloud Computing and Internet of Things,
named as Cloud of Things, plays a key role in managing the connected things,
their data and services. One of the main challenges in Cloud of Things is the
resource discovery of the smart objects and their reuse in different contexts.
Most of the existent work uses some kind of multi-criteria decision analysis
algorithm to perform the resource discovery, but do not evaluate the impact
that the user constraints has in the final solution. In this paper, we analyse
the behaviour of the SAW, TOPSIS and VIKOR multi-objective decision analyses
algorithms and the impact of user constraints on them. We evaluated the quality
of the proposed solutions using the Pareto-optimality concept.
","[{'version': 'v1', 'created': 'Wed, 16 Nov 2016 07:15:03 GMT'}]",2016-11-17,"[['Nunes', 'Luiz H.', ''], ['Estrella', 'Julio C.', ''], ['Delbem', 'Alexandre C. B.', ''], ['Perera', 'Charith', ''], ['Reiff-Marganiec', 'Stephan', '']]","['Internet of Things', 'Resource Discovery', 'Multi-Objective', 'Optimization', 'Sensor Search', 'Multiple-Criteria decision analysis']"
3758,1805.00355,Debasmit Das,"Debasmit Das, C.S. George Lee",Sample-to-Sample Correspondence for Unsupervised Domain Adaptation,"Final version appeared in Engineering Applications of Artificial
  Intelligence. Mostly, the related work in this version is different from the
  published version",,10.1016/j.engappai.2018.05.001,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The assumption that training and testing samples are generated from the same
distribution does not always hold for real-world machine-learning applications.
The procedure of tackling this discrepancy between the training (source) and
testing (target) domains is known as domain adaptation. We propose an
unsupervised version of domain adaptation that considers the presence of only
unlabelled data in the target domain. Our approach centers on finding
correspondences between samples of each domain. The correspondences are
obtained by treating the source and target samples as graphs and using a convex
criterion to match them. The criteria used are first-order and second-order
similarities between the graphs as well as a class-based regularization. We
have also developed a computationally efficient routine for the convex
optimization, thus allowing the proposed method to be used widely. To verify
the effectiveness of the proposed method, computer simulations were conducted
on synthetic, image classification and sentiment classification datasets.
Results validated that the proposed local sample-to-sample matching method
out-performs traditional moment-matching methods and is competitive with
respect to current local domain-adaptation methods.
","[{'version': 'v1', 'created': 'Tue, 1 May 2018 14:12:57 GMT'}, {'version': 'v2', 'created': 'Fri, 30 Nov 2018 16:48:03 GMT'}, {'version': 'v3', 'created': 'Tue, 4 Dec 2018 06:27:40 GMT'}]",2018-12-05,"[['Das', 'Debasmit', ''], ['Lee', 'C. S. George', '']]","['Unsupervised Domain Adaptation', 'Correspondence', 'Convex Optimization', 'Image Classification', 'Sentiment Classification']"
3759,1803.05392,Viliam Lisy PhD.,"Jiri Cermak, Viliam Lisy, Branislav Bosansky","Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in
  Extensive-Form Games",,"Cermak, Jiri, Viliam Lisy, and Branislav Bosansky. ""Automated
  construction of bounded-loss imperfect-recall abstractions in extensive-form
  games."" Artificial Intelligence 282 (2020): 103248",10.1016/j.artint.2020.103248,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Extensive-form games (EFGs) model finite sequential interactions between
players. The amount of memory required to represent these games is the main
bottleneck of algorithms for computing optimal strategies and the size of these
strategies is often impractical for real-world applications. A common approach
to tackle the memory bottleneck is to use information abstraction that removes
parts of information available to players thus reducing the number of decision
points in the game. However, existing information-abstraction techniques are
either specific for a particular domain, they do not provide any quality
guarantees, or they are applicable to very small subclasses of EFGs. We present
domain-independent abstraction methods for creating imperfect recall
abstractions in extensive-form games that allow computing strategies that are
(near) optimal in the original game. To this end, we introduce two novel
algorithms, FPIRA and CFR+IRA, based on fictitious play and counterfactual
regret minimization. These algorithms can start with an arbitrary domain
specific, or the coarsest possible, abstraction of the original game. The
algorithms iteratively detect the missing information they require for
computing a strategy for the abstract game that is (near) optimal in the
original game. This information is then included back into the abstract game.
Moreover, our algorithms are able to exploit imperfect-recall abstractions that
allow players to forget even history of their own actions. However, the
algorithms require traversing the complete unabstracted game tree. We
experimentally show that our algorithms can closely approximate Nash
equilibrium of large games using abstraction with as little as 0.9% of
information sets of the original game. Moreover, the results suggest that
memory savings increase with the increasing size of the original games.
","[{'version': 'v1', 'created': 'Wed, 14 Mar 2018 16:40:50 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Apr 2020 17:03:44 GMT'}]",2020-04-16,"[['Cermak', 'Jiri', ''], ['Lisy', 'Viliam', ''], ['Bosansky', 'Branislav', '']]","['Extensive-Form Games', 'Information Abstraction', 'ImperfectRecall', 'Nash Equilibrium', 'Fictitious Play', 'Counterfactual Regret Minimization']"
3760,1902.09953,David Orden,"Omar Aloui and Jessica Flores and David Orden and Landolf
  Rhode-Barbarigos",Cellular morphogenesis of three-dimensional tensegrity structures,"31 pages, 17 figures","Computer Methods in Applied Mechanics and Engineering. Volume 346,
  1 April 2019, Pages 85-108",10.1016/j.cma.2018.10.048,,cs.CG cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The topology and form finding of tensegrity structures have been studied
extensively since the introduction of the tensegrity concept. However, most of
these studies address topology and form separately, where the former
represented a research focus of rigidity theory and graph theory, while the
latter attracted the attention of structural engineers. In this paper, a
biomimetic approach for the combined topology and form finding of spatial
tensegrity systems is introduced. Tensegrity cells, elementary infinitesimally
rigid self-stressed structures that have been proven to compose any tensegrity,
are used to generate more complex tensegrity structures through the
morphogenesis mechanisms of adhesion and fusion. A methodology for constructing
a basis to describe the self-stress space is also provided. Through the
definition of self-stress, the cellular morphogenesis method can integrate
design considerations, such as a desired shape or number of nodes and members,
providing great flexibility and control over the tensegrity structure
generated.
","[{'version': 'v1', 'created': 'Fri, 15 Feb 2019 15:40:03 GMT'}]",2019-02-27,"[['Aloui', 'Omar', ''], ['Flores', 'Jessica', ''], ['Orden', 'David', ''], ['Rhode-Barbarigos', 'Landolf', '']]","['tensegrity', 'form finding', 'topology', 'self-stress', 'equilibrium', 'cellular morphogenesis.   1']"
3761,1905.07289,Shunsuke Kitada,"Shunsuke Kitada, Hitoshi Iyatomi, Yoshifumi Seki","Conversion Prediction Using Multi-task Conditional Attention Networks to
  Support the Creation of Effective Ad Creative","9 pages, 6 figures. Accepted at The 25th ACM SIGKDD Conference on
  Knowledge Discovery and Data Mining (KDD 2019) as an applied data science
  paper","Proceedings of the 25th ACM SIGKDD International Conference on
  Knowledge Discovery & Data Mining (KDD '19), August 4--8, 2019, Anchorage,
  AK, USA",10.1145/3292500.3330789,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurately predicting conversions in advertisements is generally a
challenging task, because such conversions do not occur frequently. In this
paper, we propose a new framework to support creating high-performing ad
creatives, including the accurate prediction of ad creative text conversions
before delivering to the consumer. The proposed framework includes three key
ideas: multi-task learning, conditional attention, and attention highlighting.
Multi-task learning is an idea for improving the prediction accuracy of
conversion, which predicts clicks and conversions simultaneously, to solve the
difficulty of data imbalance. Furthermore, conditional attention focuses
attention of each ad creative with the consideration of its genre and target
gender, thus improving conversion prediction accuracy. Attention highlighting
visualizes important words and/or phrases based on conditional attention. We
evaluated the proposed framework with actual delivery history data (14,000
creatives displayed more than a certain number of times from Gunosy Inc.), and
confirmed that these ideas improve the prediction performance of conversions,
and visualize noteworthy words according to the creatives' attributes.
","[{'version': 'v1', 'created': 'Fri, 17 May 2019 14:25:27 GMT'}]",2019-09-04,"[['Kitada', 'Shunsuke', ''], ['Iyatomi', 'Hitoshi', ''], ['Seki', 'Yoshifumi', '']]","['Online Advertising', 'Supporting Ad Creative Creation', 'RecurrentNeural Network', 'Multi-task Learning', 'Attention Mechanism']"
3762,1806.08894,Sajad Mousavi,"Seyed Sajad Mousavi, Michael Schukat, Enda Howley",Deep Reinforcement Learning: An Overview,Proceedings of SAI Intelligent Systems Conference (IntelliSys) 2016,,10.1007/978-3-319-56991-8_32,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, a specific machine learning method called deep learning has
gained huge attraction, as it has obtained astonishing results in broad
applications such as pattern recognition, speech recognition, computer vision,
and natural language processing. Recent research has also been shown that deep
learning techniques can be combined with reinforcement learning methods to
learn useful representations for the problems with high dimensional raw data
input. This chapter reviews the recent advances in deep reinforcement learning
with a focus on the most used deep architectures such as autoencoders,
convolutional neural networks and recurrent neural networks which have
successfully been come together with the reinforcement learning framework.
","[{'version': 'v1', 'created': 'Sat, 23 Jun 2018 02:18:26 GMT'}]",2018-06-26,"[['Mousavi', 'Seyed Sajad', ''], ['Schukat', 'Michael', ''], ['Howley', 'Enda', '']]","['Reinforcement learning', 'Deep Reinforcement learning', 'Deep leaning', 'Neuralnetworks', 'MDPs', 'Observable MDPs']"
3763,0904.4458,Michael Goodrich,Michael T. Goodrich,"Learning Character Strings via Mastermind Queries, with a Case Study
  Involving mtDNA","Full version of related paper appearing in IEEE Symposium on Security
  and Privacy 2009, ""The Mastermind Attack on Genomic Data."" This version
  corrects the proofs of what are now Theorems 2 and 4.",,10.1109/TIT.2012.2208581,,cs.DS cs.CR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the degree to which a character string, $Q$, leaks details about
itself any time it engages in comparison protocols with a strings provided by a
querier, Bob, even if those protocols are cryptographically guaranteed to
produce no additional information other than the scores that assess the degree
to which $Q$ matches strings offered by Bob. We show that such scenarios allow
Bob to play variants of the game of Mastermind with $Q$ so as to learn the
complete identity of $Q$. We show that there are a number of efficient
implementations for Bob to employ in these Mastermind attacks, depending on
knowledge he has about the structure of $Q$, which show how quickly he can
determine $Q$. Indeed, we show that Bob can discover $Q$ using a number of
rounds of test comparisons that is much smaller than the length of $Q$, under
reasonable assumptions regarding the types of scores that are returned by the
cryptographic protocols and whether he can use knowledge about the distribution
that $Q$ comes from. We also provide the results of a case study we performed
on a database of mitochondrial DNA, showing the vulnerability of existing
real-world DNA data to the Mastermind attack.
","[{'version': 'v1', 'created': 'Tue, 28 Apr 2009 18:12:24 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Apr 2010 05:31:22 GMT'}]",2016-11-15,"[['Goodrich', 'Michael T.', '']]","['character strings', 'Mastermind', 'mitochondrial DNA']"
3764,1307.3396,Karnavel Kuppusamy,"R. Swaminathan, K. Karnavel",Software as a Service - Common Service Bus (SAAS-CSB),,,10.5121/cseij.2013.3301,,cs.DC cs.SE,http://creativecommons.org/licenses/by/3.0/,"  Software-as-a-Service (SaaS) is a form of cloud computing that relieves the
user from the concern of hardware, software installation and management. It is
an emerging business model that delivers software applications to the users
through Web-based technology. Software vendors have varying requirements and
SaaS applications most typically support such requirements. The various
applications used by unique customers in a single instance are known as
Multi-Tenancy. There would be a delay in service when the user sends the data
from multiple applications to multiple destinations and from multiple
applications to single destination due to the use of single CSB. This problem
can be overcome by using multiple CSB concepts and hence multiple senders can
efficiently send their data to multiple receivers at the same time. The
multiple clouds are monitored and managed by the SaaS-CSB portal. The idea of
SaaS-CSB Portal is to provide a single pane of glass for the user to consume
and govern any service from any cloud. Thus, SaaS-CSB application allows
companies to save their IT cost and valuable time.
","[{'version': 'v1', 'created': 'Fri, 12 Jul 2013 10:25:28 GMT'}]",2013-07-15,"[['Swaminathan', 'R.', ''], ['Karnavel', 'K.', '']]","['cloud computing', 'SaaS', 'Multi-Tenancy', 'CSB and SaaS-CSB portal']"
3765,2105.04221,Abdulkareem Alsudais,"Abdulkareem Alsudais, Wafa Alotaibi, Faye Alomary","Similarities between Arabic Dialects: Investigating Geographical
  Proximity",,"Inf. Process. Manag., vol. 59, no. 1, p. 102770, 2022",10.1016/j.ipm.2021.102770.,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The automatic classification of Arabic dialects is an ongoing research
challenge, which has been explored in recent work that defines dialects based
on increasingly limited geographic areas like cities and provinces. This paper
focuses on a related yet relatively unexplored topic: the effects of the
geographical proximity of cities located in Arab countries on their dialectical
similarity. Our work is twofold, reliant on: 1) comparing the textual
similarities between dialects using cosine similarity and 2) measuring the
geographical distance between locations. We study MADAR and NADI, two
established datasets with Arabic dialects from many cities and provinces. Our
results indicate that cities located in different countries may in fact have
more dialectical similarity than cities within the same country, depending on
their geographical proximity. The correlation between dialectical similarity
and city proximity suggests that cities that are closer together are more
likely to share dialectical attributes, regardless of country borders. This
nuance provides the potential for important advancements in Arabic dialect
research because it indicates that a more granular approach to dialect
classification is essential to understanding how to frame the problem of Arabic
dialects identification.
","[{'version': 'v1', 'created': 'Mon, 10 May 2021 09:32:21 GMT'}]",2021-10-04,"[['Alsudais', 'Abdulkareem', ''], ['Alotaibi', 'Wafa', ''], ['Alomary', 'Faye', '']]","['Arabic natural language processing', 'Arabic dialects', 'geolocation', 'textual']"
3766,1007.5195,Miguel Gomez-Zamalloa,"Miguel G\'omez-Zamalloa, Elvira Albert and Germ\'an Puebla",Test Case Generation for Object-Oriented Imperative Languages in CLP,,"Miguel G\'omez-Zamalloa, Elvira Albert, Germ\'an Puebla: Test Case
  Generation for Object-Oriented Imperative Languages in CLP. TPLP 10(4-6):
  659-674 (2010)",10.1017/S1471068410000347,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Testing is a vital part of the software development process. Test Case
Generation (TCG) is the process of automatically generating a collection of
test cases which are applied to a system under test. White-box TCG is usually
performed by means of symbolic execution, i.e., instead of executing the
program on normal values (e.g., numbers), the program is executed on symbolic
values representing arbitrary values. When dealing with an object-oriented (OO)
imperative language, symbolic execution becomes challenging as, among other
things, it must be able to backtrack, complex heap-allocated data structures
should be created during the TCG process and features like inheritance, virtual
invocations and exceptions have to be taken into account. Due to its inherent
symbolic execution mechanism, we pursue in this paper that Constraint Logic
Programming (CLP) has a promising unexploited application field in TCG. We will
support our claim by developing a fully CLP-based framework to TCG of an OO
imperative language, and by assessing it on a corresponding implementation on a
set of challenging Java programs. A unique characteristic of our approach is
that it handles all language features using only CLP and without the need of
developing specific constraint operators (e.g., to model the heap).
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2010 11:53:56 GMT'}]",2010-07-30,"[['Gómez-Zamalloa', 'Miguel', ''], ['Albert', 'Elvira', ''], ['Puebla', 'Germán', '']]","['Test case generation', 'Symbolic execution', 'Constraint logic programming']"
3767,1809.10200,Edouard Oyallon,"Edouard Oyallon and Eugene Belilovsky and Sergey Zagoruyko and Michal
  Valko",Compressing the Input for CNNs with the First-Order Scattering Transform,,ECCV 2018,10.1007/978-3-030-01240-3_19,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the first-order scattering transform as a candidate for reducing the
signal processed by a convolutional neural network (CNN). We show theoretical
and empirical evidence that in the case of natural images and sufficiently
small translation invariance, this transform preserves most of the signal
information needed for classification while substantially reducing the spatial
resolution and total signal size. We demonstrate that cascading a CNN with this
representation performs on par with ImageNet classification models, commonly
used in downstream tasks, such as the ResNet-50. We subsequently apply our
trained hybrid ImageNet model as a base model on a detection system, which has
typically larger image inputs. On Pascal VOC and COCO detection tasks we
demonstrate improvements in the inference speed and training memory consumption
compared to models trained directly on the input image.
","[{'version': 'v1', 'created': 'Thu, 27 Sep 2018 10:14:46 GMT'}]",2018-10-01,"[['Oyallon', 'Edouard', ''], ['Belilovsky', 'Eugene', ''], ['Zagoruyko', 'Sergey', ''], ['Valko', 'Michal', '']]","['CNN', 'SIFT', 'image descriptors', 'first-order scattering']"
3768,1904.04174,John Lawson,"Rod Burns, John Lawson, Duncan McBain and Daniel Soutar",Accelerated Neural Networks on OpenCL Devices Using SYCL-DNN,"4 pages, 3 figures. In International Workshop on OpenCL (IWOCL '19),
  May 13-15, 2019, Boston",,10.1145/3318170.3318183,,cs.LG cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the past few years machine learning has seen a renewed explosion of
interest, following a number of studies showing the effectiveness of neural
networks in a range of tasks which had previously been considered incredibly
hard. Neural networks' effectiveness in the fields of image recognition and
natural language processing stems primarily from the vast amounts of data
available to companies and researchers, coupled with the huge amounts of
compute power available in modern accelerators such as GPUs, FPGAs and ASICs.
There are a number of approaches available to developers for utilizing GPGPU
technologies such as SYCL, OpenCL and CUDA, however many applications require
the same low level mathematical routines. Libraries dedicated to accelerating
these common routines allow developers to easily make full use of the available
hardware without requiring low level knowledge of the hardware themselves,
however such libraries are often provided by hardware manufacturers for
specific hardware such as cuDNN for Nvidia hardware or MIOpen for AMD hardware.
  SYCL-DNN is a new open-source library dedicated to providing accelerated
routines for neural network operations which are hardware and vendor agnostic.
Built on top of the SYCL open standard and written entirely in standard C++,
SYCL-DNN allows a user to easily accelerate neural network code for a wide
range of hardware using a modern C++ interface. The library is tested on AMD's
OpenCL for GPU, Intel's OpenCL for CPU and GPU, ARM's OpenCL for Mali GPUs as
well as ComputeAorta's OpenCL for R-Car CV engine and host CPU. In this talk we
will present performance figures for SYCL-DNN on this range of hardware, and
discuss how high performance was achieved on such a varied set of accelerators
with such different hardware features.
","[{'version': 'v1', 'created': 'Mon, 8 Apr 2019 16:29:40 GMT'}]",2019-04-09,"[['Burns', 'Rod', ''], ['Lawson', 'John', ''], ['McBain', 'Duncan', ''], ['Soutar', 'Daniel', '']]","['SYCL', 'OpenCL', 'neural networks', 'GPGPU', 'machine learning']"
3769,1807.10899,Martianus Frederic Ezerman,"Alfred Marcel Bruckstein, Martianus Frederic Ezerman, Adamas Aqsa
  Fahreza, San Ling",Holographic Sensing,22 pages with 6 figures,"Applied and Computational Harmonic Analysis Volume 49, Issue 1,
  July 2020, Pages 296-315",10.1016/j.acha.2019.03.001,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Holographic representations of data encode information in packets of equal
importance that enable progressive recovery. The quality of recovered data
improves as more and more packets become available. This progressive recovery
of the information is independent of the order in which packets become
available. Such representations are ideally suited for distributed storage and
for the transmission of data packets over networks with unpredictable delays
and or erasures.
  Several methods for holographic representations of signals and images have
been proposed over the years and multiple description information theory also
deals with such representations. Surprisingly, however, these methods had not
been considered in the classical framework of optimal least-squares estimation
theory, until very recently. We develop a least-squares approach to the design
of holographic representation for stochastic data vectors, relying on the
framework widely used in modeling signals and images.
","[{'version': 'v1', 'created': 'Sat, 28 Jul 2018 06:45:05 GMT'}]",2021-03-01,"[['Bruckstein', 'Alfred Marcel', ''], ['Ezerman', 'Martianus Frederic', ''], ['Fahreza', 'Adamas Aqsa', ''], ['Ling', 'San', '']]","['cyclostationary data', 'fusion frame', 'holographic representation', 'meansquared error estimation', 'stochastic data', 'Wiener Filter']"
3770,1704.08818,Yong Xia,"Benteng Ma, Yong Xia","A Tribe Competition-Based Genetic Algorithm for Feature Selection in
  Pattern Classification",,,10.1016/j.asoc.2017.04.042,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feature selection has always been a critical step in pattern recognition, in
which evolutionary algorithms, such as the genetic algorithm (GA), are most
commonly used. However, the individual encoding scheme used in various GAs
would either pose a bias on the solution or require a pre-specified number of
features, and hence may lead to less accurate results. In this paper, a tribe
competition-based genetic algorithm (TCbGA) is proposed for feature selection
in pattern classification. The population of individuals is divided into
multiple tribes, and the initialization and evolutionary operations are
modified to ensure that the number of selected features in each tribe follows a
Gaussian distribution. Thus each tribe focuses on exploring a specific part of
the solution space. Meanwhile, tribe competition is introduced to the evolution
process, which allows the winning tribes, which produce better individuals, to
enlarge their sizes, i.e. having more individuals to search their parts of the
solution space. This algorithm, therefore, avoids the bias on solutions and
requirement of a pre-specified number of features. We have evaluated our
algorithm against several state-of-the-art feature selection approaches on 20
benchmark datasets. Our results suggest that the proposed TCbGA algorithm can
identify the optimal feature subset more effectively and produce more accurate
pattern classification.
","[{'version': 'v1', 'created': 'Fri, 28 Apr 2017 06:25:50 GMT'}]",2017-05-01,"[['Ma', 'Benteng', ''], ['Xia', 'Yong', '']]","['Feature selection', 'pattern classification', 'evolutionary algorithms', 'genetic algorithm', 'tribe competition']"
3771,1604.01183,Guilherme D. da Fonseca,"Sunil Arya, Guilherme D. da Fonseca, David M. Mount",Approximate Polytope Membership Queries,"Preliminary results of this paper appeared in ""Approximate Polytope
  Membership Queries"", in Proc. ACM Sympos. Theory Comput. (STOC), 2011,
  579-586 and ""Polytope Approximation and the Mahler Volume"", in Proc. ACM-SIAM
  Sympos. Discrete Algorithms (SODA), 2012, 29-42","SIAM J. Comput., 47(1), 1-51, 2018",10.1137/16M1061096,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the polytope membership problem, a convex polytope $K$ in $\mathbb{R}^d$
is given, and the objective is to preprocess $K$ into a data structure so that,
given any query point $q \in \mathbb{R}^d$, it is possible to determine
efficiently whether $q \in K$. We consider this problem in an approximate
setting. Given an approximation parameter $\varepsilon$, the query can be
answered either way if the distance from $q$ to $K$'s boundary is at most
$\varepsilon$ times $K$'s diameter. We assume that the dimension $d$ is fixed,
and $K$ is presented as the intersection of $n$ halfspaces. Previous solutions
to approximate polytope membership were based on straightforward applications
of classic polytope approximation techniques by Dudley (1974) and Bentley et
al. (1982). The former is optimal in the worst-case with respect to space, and
the latter is optimal with respect to query time.
  We present four main results. First, we show how to combine the two above
techniques to obtain a simple space-time trade-off. Second, we present an
algorithm that dramatically improves this trade-off. In particular, for any
constant $\alpha \ge 4$, this data structure achieves query time
$O(1/\varepsilon^{(d-1)/\alpha})$ and space roughly $O(1/\varepsilon^{(d-1)(1 -
O(\log \alpha)/\alpha)})$. We do not know whether this space bound is tight,
but our third result shows that there is a convex body such that our algorithm
achieves a space of at least $\Omega(
1/\varepsilon^{(d-1)(1-O(\sqrt{\alpha})/\alpha} )$. Our fourth result shows
that it is possible to reduce approximate Euclidean nearest neighbor searching
to approximate polytope membership queries. Combined with the above results,
this provides significant improvements to the best known space-time trade-offs
for approximate nearest neighbor searching in $\mathbb{R}^d$.
","[{'version': 'v1', 'created': 'Tue, 5 Apr 2016 09:03:03 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Jun 2017 09:13:34 GMT'}]",2018-01-11,"[['Arya', 'Sunil', ''], ['da Fonseca', 'Guilherme D.', ''], ['Mount', 'David M.', '']]","['Polytope membership', 'nearest-neighbor searching', 'geometric retrieval', 'space-time tradeoffs', 'approximation algorithms', 'convex approximation', 'Mahler volume']"
3772,1511.01954,Jose Oramas,Jose Oramas M. and Tinne Tuytelaars,"Recovering hard-to-find object instances by sampling context-based
  object proposals",Computer Vision and Image Understanding (CVIU),,10.1016/j.cviu.2016.08.007,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we focus on improving object detection performance in terms of
recall. We propose a post-detection stage during which we explore the image
with the objective of recovering missed detections. This exploration is
performed by sampling object proposals in the image. We analyze four different
strategies to perform this sampling, giving special attention to strategies
that exploit spatial relations between objects. In addition, we propose a novel
method to discover higher-order relations between groups of objects.
Experiments on the challenging KITTI dataset show that our proposed
relations-based proposal generation strategies can help improving recall at the
cost of a relatively low amount of object proposals.
","[{'version': 'v1', 'created': 'Thu, 5 Nov 2015 23:39:19 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Jul 2016 14:50:24 GMT'}, {'version': 'v3', 'created': 'Tue, 4 Oct 2016 08:30:40 GMT'}]",2016-10-05,"[['M.', 'Jose Oramas', ''], ['Tuytelaars', 'Tinne', '']]","['Object Detection', 'Object Proposal Generation', 'Context-based Reasoning', 'Relational Learning']"
3773,1405.0580,Prabhjot Kaur,Prabhjot Kaur,Web Content Classification: A Survey,"5 pages, 1 figure. arXiv admin note: text overlap with
  arXiv:1307.1024, arXiv:1310.4647 by other authors","International Journal of Computer Trends and Technology (IJCTT)
  V10(2):97-101, Apr 2014",10.14445/22312803/IJCTT-V10P117,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As the information contained within the web is increasing day by day,
organizing this information could be a necessary requirement.The data mining
process is to extract information from a data set and transform it into an
understandable structure for further use. Classification of web page content is
essential to many tasks in web information retrieval such as maintaining web
directories and focused crawling.The uncontrolled type of nature of web content
presents additional challenges to web page classification as compared to the
traditional text classification, but the interconnected nature of hypertext
also provides features that can assist the process. In this paper the web
classification is discussed in detail and its importance in field of data
mining is explored.
","[{'version': 'v1', 'created': 'Sat, 3 May 2014 12:57:50 GMT'}]",2014-05-22,"[['Kaur', 'Prabhjot', '']]","['Data mining', 'Web page Classification', 'Feature']"
3774,2102.09150,Decky Aspandi,"Decky Aspandi, Federico Sukno, Bj\""orn Schuller and Xavier Binefa","An Enhanced Adversarial Network with Combined Latent Features for
  Spatio-Temporal Facial Affect Estimation in the Wild",Accepted Version on VISAPP 2021,,10.5220/0010332001720181,,cs.CV cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Affective Computing has recently attracted the attention of the research
community, due to its numerous applications in diverse areas. In this context,
the emergence of video-based data allows to enrich the widely used spatial
features with the inclusion of temporal information. However, such
spatio-temporal modelling often results in very high-dimensional feature spaces
and large volumes of data, making training difficult and time consuming. This
paper addresses these shortcomings by proposing a novel model that efficiently
extracts both spatial and temporal features of the data by means of its
enhanced temporal modelling based on latent features. Our proposed model
consists of three major networks, coined Generator, Discriminator, and
Combiner, which are trained in an adversarial setting combined with curriculum
learning to enable our adaptive attention modules. In our experiments, we show
the effectiveness of our approach by reporting our competitive results on both
the AFEW-VA and SEWA datasets, suggesting that temporal modelling improves the
affect estimates both in qualitative and quantitative terms. Furthermore, we
find that the inclusion of attention mechanisms leads to the highest accuracy
improvements, as its weights seem to correlate well with the appearance of
facial movements, both in terms of temporal localisation and intensity.
Finally, we observe the sequence length of around 160\,ms to be the optimum one
for temporal modelling, which is consistent with other relevant findings
utilising similar lengths.
","[{'version': 'v1', 'created': 'Thu, 18 Feb 2021 04:10:12 GMT'}]",2021-02-19,"[['Aspandi', 'Decky', ''], ['Sukno', 'Federico', ''], ['Schuller', 'Björn', ''], ['Binefa', 'Xavier', '']]","['Affective Computing', 'Temporal Modelling', 'Adversarial Learning']"
3775,1202.6444,Marcos Villagra,"Marcos Villagra, Masaki Nakanishi, Shigeru Yamashita, Yasuhiko
  Nakashima","Tensor Rank and Strong Quantum Nondeterminism in Multiparty
  Communication","In v3 corrected some lesser typos. Extended abstract in Proc. of
  TAMC'12, LNCS 7287, pp. 400-411, 2012","IEICE Transactions on Information and Systems Vol. E96.D (2013)
  No. 1 pp. 1-8",10.1587/transinf.E96.D.1,,cs.CC quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we study quantum nondeterminism in multiparty communication.
There are three (possibly) different types of nondeterminism in quantum
computation: i) strong, ii) weak with classical proofs, and iii) weak with
quantum proofs. Here we focus on the first one. A strong quantum
nondeterministic protocol accepts a correct input with positive probability,
and rejects an incorrect input with probability 1. In this work we relate
strong quantum nondeterministic multiparty communication complexity to the rank
of the communication tensor in the Number-On-Forehead and Number-In-Hand
models. In particular, by extending the definition proposed by de Wolf to {\it
nondeterministic tensor-rank} ($nrank$), we show that for any boolean function
$f$ when there is no prior shared entanglement between the players, 1) in the
Number-On-Forehead model, the cost is upper-bounded by the logarithm of
$nrank(f)$; 2) in the Number-In-Hand model, the cost is lower-bounded by the
logarithm of $nrank(f)$. Furthermore, we show that when the number of players
is $o(\log\log n)$ we have that $NQP\nsubseteq BQP$ for Number-On-Forehead
communication.
","[{'version': 'v1', 'created': 'Wed, 29 Feb 2012 05:18:13 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Jun 2012 08:11:31 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Oct 2012 01:34:34 GMT'}]",2013-08-13,"[['Villagra', 'Marcos', ''], ['Nakanishi', 'Masaki', ''], ['Yamashita', 'Shigeru', ''], ['Nakashima', 'Yasuhiko', '']]","['communication complexity', 'multiparty communication', 'quantum computation', 'quantum nondeterminism', 'tensor rank']"
3776,1907.08475,Bernhard Bermeitinger,"Bernhard Bermeitinger, Tomas Hrycej, Siegfried Handschuh",Representational Capacity of Deep Neural Networks -- A Computing Study,,"2019 11th International Conference on Knowledge Discovery and
  Information Retrieval (KDIR)",10.5220/0008364305320538,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is some theoretical evidence that deep neural networks with multiple
hidden layers have a potential for more efficient representation of
multidimensional mappings than shallow networks with a single hidden layer. The
question is whether it is possible to exploit this theoretical advantage for
finding such representations with help of numerical training methods. Tests
using prototypical problems with a known mean square minimum did not confirm
this hypothesis. Minima found with the help of deep networks have always been
worse than those found using shallow networks. This does not directly
contradict the theoretical findings---it is possible that the superior
representational capacity of deep networks is genuine while finding the mean
square minimum of such deep networks is a substantially harder problem than
with shallow ones.
","[{'version': 'v1', 'created': 'Fri, 19 Jul 2019 11:56:09 GMT'}]",2019-10-08,"[['Bermeitinger', 'Bernhard', ''], ['Hrycej', 'Tomas', ''], ['Handschuh', 'Siegfried', '']]","['deep learning', 'artificial neural networks', 'optimization', 'conjugate gradient']"
3777,1512.05596,Nazmul Islam,"Shinsuke Tamura, Hazim A. Haddad, Nazmul Islam, Kazi Md. Rokibul Alam","An Incoercible E-Voting Scheme Based on Revised Simplified Verifiable
  Re-encryption Mix-nets",,Information Security and Computer Fraud 3 (2015) 32-38,10.12691/iscf-3-2-2,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Simplified verifiable re-encryption mix-net (SVRM) is revised and a scheme
for e-voting systems is developed based on it. The developed scheme enables
e-voting systems to satisfy all essential requirements of elections. Namely,
they satisfy requirements about privacy, verifiability, fairness and
robustness. It also successfully protects voters from coercers except cases
where the coercers force voters to abstain from elections. In detail, voters
can conceal correspondences between them and their votes, anyone can verify the
accuracy of election results, and interim election results are concealed from
any entity. About incoercibility, provided that erasable-state voting booths
which disable voters to memorize complete information exchanged between them
and election authorities for constructing votes are available, coercer C cannot
know candidates that voters coerced by C had chosen even if the candidates are
unique to the voters. In addition, elections can be completed without
reelections even when votes were handled illegitimately.
","[{'version': 'v1', 'created': 'Thu, 17 Dec 2015 14:30:01 GMT'}]",2015-12-18,"[['Tamura', 'Shinsuke', ''], ['Haddad', 'Hazim A.', ''], ['Islam', 'Nazmul', ''], ['Alam', 'Kazi Md. Rokibul', '']]","['‒ revised-SVRM', 'anonymous credential', 'inferior votes', 'erasable-state voting booth.   1']"
3778,1402.2217,Nirbhay Chaubey Kumar,"Akshai Aggarwal, Savita Gandhi, Nirbhay Chaubey","Performance Analysis of AODV, DSDV and DSR in MANETs","11 Pages, 8 Figure and 2 Tables",,10.5121/ijdps.2011.2615,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile Ad hoc Networks (MANETs) are considered as a new paradigm of
infrastructure-less mobile wireless communication systems. MANETs are being
widely studied and it is the technology that is attracting a large variety of
applications. Routing in MANETs is considered a challenging task due to the
unpredictable changes in the network topology, resulting from the random and
frequent movement of the nodes and due to the absence of any centralized
control [1][2]. In this paper, we evaluate the performance of reactive routing
protocols, Ad hoc On demand Distance Vector (AODV) and Dynamic Source Routing
(DSR) and proactive routing protocol Destination Sequenced Distance Vector
(DSDV). The major goal of this study is to analyze the performance of well
known MANETs routing protocol in high mobility case under low, medium and high
density scenario. Unlike military applications, most of the other applications
of MANETs require moderate to high mobility. Hence it becomes important to
study the impact of high mobility on the performance of these routing
protocols. The performance is analyzed with respect to Average End-to-End
Delay, Normalized Routing Load (NRL), Packet Delivery Fraction (PDF) and
Throughput. Simulation results verify that AODV gives better performance as
compared to DSR and DSDV.
","[{'version': 'v1', 'created': 'Mon, 10 Feb 2014 17:20:35 GMT'}]",2014-02-11,"[['Aggarwal', 'Akshai', ''], ['Gandhi', 'Savita', ''], ['Chaubey', 'Nirbhay', '']]","['MANETs', 'Routing Protocols', 'AODV', 'DSDV', 'DSR', 'NS-2']"
3779,1308.3603,Renaud Lambiotte,"Vsevolod Salnikov, Daniel Schien, Hyejin Youn, Renaud Lambiotte and
  Michael T. Gastner",The geography and carbon footprint of mobile phone use in Cote d'Ivoire,"23 pages, 8 figures, 1 table","EPJ Data Science 2014, 3:3",10.1140/epjds21,,cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The newly released Orange D4D mobile phone data base provides new insights
into the use of mobile technology in a developing country. Here we perform a
series of spatial data analyses that reveal important geographic aspects of
mobile phone use in Cote d'Ivoire. We first map the locations of base stations
with respect to the population distribution and the number and duration of
calls at each base station. On this basis, we estimate the energy consumed by
the mobile phone network. Finally, we perform an analysis of inter-city
mobility, and identify high-traffic roads in the country.
","[{'version': 'v1', 'created': 'Fri, 16 Aug 2013 11:14:57 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Feb 2014 13:48:27 GMT'}]",2014-02-25,"[['Salnikov', 'Vsevolod', ''], ['Schien', 'Daniel', ''], ['Youn', 'Hyejin', ''], ['Lambiotte', 'Renaud', ''], ['Gastner', 'Michael T.', '']]","['mobile phone', 'Cote d’Ivoire', 'carbon footprint', 'human mobility']"
3780,1804.02690,Linjie Deng,"Linjie Deng, Yanxiang Gong, Yi Lin, Jingwen Shuai, Xiaoguang Tu,
  Yuefei Zhang, Zheng Ma, Mei Xie",Detecting Multi-Oriented Text with Corner-based Region Proposals,,"Neurocomputing, Volume 334, 21 March 2019, Pages 134-142",10.1016/j.neucom.2019.01.013,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Previous approaches for scene text detection usually rely on manually defined
sliding windows. This work presents an intuitive two-stage region-based method
to detect multi-oriented text without any prior knowledge regarding the textual
shape. In the first stage, we estimate the possible locations of text instances
by detecting and linking corners instead of shifting a set of default anchors.
The quadrilateral proposals are geometry adaptive, which allows our method to
cope with various text aspect ratios and orientations. In the second stage, we
design a new pooling layer named Dual-RoI Pooling which embeds data
augmentation inside the region-wise subnetwork for more robust classification
and regression over these proposals. Experimental results on public benchmarks
confirm that the proposed method is capable of achieving comparable performance
with state-of-the-art methods. The code is publicly available at
https://github.com/xhzdeng/crpn
","[{'version': 'v1', 'created': 'Sun, 8 Apr 2018 13:36:03 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Jun 2019 00:50:50 GMT'}]",2019-06-04,"[['Deng', 'Linjie', ''], ['Gong', 'Yanxiang', ''], ['Lin', 'Yi', ''], ['Shuai', 'Jingwen', ''], ['Tu', 'Xiaoguang', ''], ['Zhang', 'Yuefei', ''], ['Ma', 'Zheng', ''], ['Xie', 'Mei', '']]","['Multi-Oriented Text Detection', 'Dual-RoI Pooling', 'Corner-based Region Proposal Network']"
3781,1108.1462,Nibedita  Adhikari,Chitta Ranjan Tripathy and Nibedita Adhikari,"On a New Multicomputer Interconnection Topology for Massively Parallel
  Systems","16 pages, 11 figures","International Journal of Distributed and Parallel Systems,Vol2,
  No.4,July2011",10.5121/ijdps.2011.2414,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a new interconnection network topology called Balanced
Varietal Hypercube (BVH), suitable for massively parallel systems. The proposed
topology being a hybrid structure retains almost all the attractive properties
of Balanced Hypercube and Varietal Hypercube. The topology, various parameters,
routing and broadcasting of Balanced Varietal Hypercube are presented. The
performance of the Balanced Varietal Hypercube is compared with other networks.
In terms of diameter, cost and average distance and reliability the proposed
network is found to be better than the Hypercube, Balanced Hypercube and
Varietal Hypercube. Also it is more reliable and cost-effective than Hypercube
and Balanced Hypercube.
","[{'version': 'v1', 'created': 'Sat, 6 Aug 2011 08:03:43 GMT'}]",2011-08-09,"[['Tripathy', 'Chitta Ranjan', ''], ['Adhikari', 'Nibedita', '']]","['Interconnection Network', 'Routing', 'Broadcasting', 'Performance analysis', 'Reliability']"
3782,1502.00120,Andreas de Vries,Cem Kiyak and Andreas de Vries,"Electricity markets regarding the operational flexibility of power
  plants","6 pages, 2 figures, 3 tables","Modern Economy 8 (4), 2017",10.4236/me.2017.84043,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Electricity market mechanisms designed to steer sustainable generation of
electricity play an important role for the energy transition intended to
mitigate climate change. One of the major problems is to complement volatile
renewable energy sources by operationally flexible capacity reserves. In this
paper a proposal is given to determine prices on electricity markets taking
into account the operational flexibility of power plants, such that the costs
of long-term capacity reserves can be paid by short-term electricity spot
markets. For this purpose, a measure of operational flexibility is introduced
enabling to compute an inflexibility fee charging each individual power plant
on a wholesale electricity spot market. The total sum of inflexibility fees
accumulated on the spot markets then can be used to finance a capacity market
keeping the necessary reserves to warrant grid reliability. Here each reserve
power plant then gets a reliability payment depending on its operational
flexibility. The proposal is applied to a small exemplary grid, illustrating
its main idea and also revealing the caveat that too high fees paradoxically
could create incentives to employ highly flexible power plants on the spot
market rather than to run them as backup capacity.
","[{'version': 'v1', 'created': 'Sat, 31 Jan 2015 15:10:18 GMT'}]",2017-05-01,"[['Kiyak', 'Cem', ''], ['de Vries', 'Andreas', '']]","['electricity markets', 'market mechanism', 'operational flexibility of power plants', 'flexibility measure', 'renewable energy', 'capacity market', 'energy transition']"
3783,2202.07832,Feng Xia,"Xiangtai Chen, Tao Tang, Jing Ren, Ivan Lee, Honglong Chen, Feng Xia","Heterogeneous Graph Learning for Explainable Recommendation over
  Academic Networks","8 pages, 5 figures","The 20th IEEE/WIC/ACM International Conference on Web Intelligence
  and Intelligent Agent Technology (2021)",,,cs.SI cs.AI cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  With the explosive growth of new graduates with research degrees every year,
unprecedented challenges arise for early-career researchers to find a job at a
suitable institution. This study aims to understand the behavior of academic
job transition and hence recommend suitable institutions for PhD graduates.
Specifically, we design a deep learning model to predict the career move of
early-career researchers and provide suggestions. The design is built on top of
scholarly/academic networks, which contains abundant information about
scientific collaboration among scholars and institutions. We construct a
heterogeneous scholarly network to facilitate the exploring of the behavior of
career moves and the recommendation of institutions for scholars. We devise an
unsupervised learning model called HAI (Heterogeneous graph Attention InfoMax)
which aggregates attention mechanism and mutual information for institution
recommendation. Moreover, we propose scholar attention and meta-path attention
to discover the hidden relationships between several meta-paths. With these
mechanisms, HAI provides ordered recommendations with explainability. We
evaluate HAI upon a real-world dataset against baseline methods. Experimental
results verify the effectiveness and efficiency of our approach.
","[{'version': 'v1', 'created': 'Wed, 16 Feb 2022 02:40:09 GMT'}]",2022-02-17,"[['Chen', 'Xiangtai', ''], ['Tang', 'Tao', ''], ['Ren', 'Jing', ''], ['Lee', 'Ivan', ''], ['Chen', 'Honglong', ''], ['Xia', 'Feng', '']]","['academic social networks', 'recommender systems', 'explainability', 'graph learning', 'heterogeneous networks']"
3784,1709.08027,Dmytro Terletskyi,Dmytro Terletskyi,"Object-Oriented Knowledge Representation and Data Storage Using
  Inhomogeneous Classes",2 figures,"Information and Software Technologies, Volume 756 of the series
  Communications in Computer and Information Science, 2017, pp. 48-61",10.1007/978-3-319-67642-5_5,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper contains analysis of concept of a class within different
object-oriented knowledge representation models. The main attention is paid to
structure of the class and its efficiency in the context of data storage, using
object-relational mapping. The main achievement of the paper is extension of
concept of homogeneous class of objects by introducing concepts of single-core
and multi-core inhomogeneous classes of objects, which allow simultaneous
defining of a few different types within one class of objects, avoiding
duplication of properties and methods in representation of types, decreasing
sizes of program codes and providing more efficient information storage in the
databases. In addition, the paper contains results of experiment, which show
that data storage in relational database, using proposed extensions of the
class, in some cases is more efficient in contrast to usage of homogeneous
classes of objects.
","[{'version': 'v1', 'created': 'Sat, 23 Sep 2017 09:09:04 GMT'}]",2018-11-02,"[['Terletskyi', 'Dmytro', '']]","['class', 'homogeneous class', 'single-core inhomogeneous class', 'core of level m', 'multi-core inhomogeneous class']"
3785,1511.01508,Bryan Poling,Bryan Poling and Gilad Lerman,Enhancing Feature Tracking With Gyro Regularization,Preprint submitted to Image and Vision Computing,Image and Vision Computing 50 (2016) 42-58,10.1016/j.imavis.2016.01.004,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a deeply integrated method of exploiting low-cost gyroscopes to
improve general purpose feature tracking. Most previous methods use gyroscopes
to initialize and bound the search for features. In contrast, we use them to
regularize the tracking energy function so that they can directly assist in the
tracking of ambiguous and poor-quality features. We demonstrate that our simple
technique offers significant improvements in performance over conventional
template-based tracking methods, and is in fact competitive with more complex
and computationally expensive state-of-the-art trackers, but at a fraction of
the computational cost. Additionally, we show that the practice of initializing
template-based feature trackers like KLT (Kanade-Lucas-Tomasi) using
gyro-predicted optical flow offers no advantage over using a careful
optical-only initialization method, suggesting that some deeper level of
integration, like the method we propose, is needed in order to realize a
genuine improvement in tracking performance from these inertial sensors.
","[{'version': 'v1', 'created': 'Wed, 4 Nov 2015 21:04:07 GMT'}]",2016-06-16,"[['Poling', 'Bryan', ''], ['Lerman', 'Gilad', '']]","['feature tracking', 'optical flow', 'inertial sensors', 'gyroscopesSupp. Webpage http//www-users.math.umn']"
3786,1808.02185,Xiao-Feng Xie,Xiao-Feng Xie,Round-Table Group Optimization for Sequencing Problems,,"International Journal of Applied Metaheuristic Computing 2012,
  3(4), 1-24",10.4018/jamc.2012100101,,cs.NE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this paper, a round-table group optimization (RTGO) algorithm is
presented. RTGO is a simple metaheuristic framework using the insights of
research on group creativity. In a cooperative group, the agents work in
iterative sessions to search innovative ideas in a common problem landscape.
Each agent has one base idea stored in its individual memory, and one social
idea fed by a round-table group support mechanism in each session. The idea
combination and improvement processes are respectively realized by using a
recombination search (XS) strategy and a local search (LS) strategy, to build
on the base and social ideas. RTGO is then implemented for solving two
difficult sequencing problems, i.e., the flowshop scheduling problem and the
quadratic assignment problem. The domain-specific LS strategies are adopted
from existing algorithms, whereas a general XS class, called socially biased
combination (SBX), is realized in a modular form. The performance of RTGO is
then evaluated on commonly-used benchmark datasets. Good performance on
different problems can be achieved by RTGO using appropriate SBX operators.
Furthermore, RTGO is able to outperform some existing methods, including
methods using the same LS strategies.
","[{'version': 'v1', 'created': 'Tue, 7 Aug 2018 02:22:26 GMT'}]",2018-08-08,"[['Xie', 'Xiao-Feng', '']]","['Meta-heuristic frameworks', 'Group creativity', 'Sequencing problems', 'Globaloptimization', 'Recombination search', 'Idea combination process', 'Social-biased learning']"
3787,1407.0566,Jacopo Staiano,"Jacopo Staiano, Nuria Oliver, Bruno Lepri, Rodrigo de Oliveira,
  Michele Caraviello, Nicu Sebe","Money Walks: A Human-Centric Study on the Economics of Personal Mobile
  Data","15 pages, 2 figures. To appear in ACM International Joint Conference
  on Pervasive and Ubiquitous Computing (Ubicomp 2014)",,10.1145/2632048.2632074,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the context of a myriad of mobile apps which collect personally
identifiable information (PII) and a prospective market place of personal data,
we investigate a user-centric monetary valuation of mobile PII. During a 6-week
long user study in a living lab deployment with 60 participants, we collected
their daily valuations of 4 categories of mobile PII (communication, e.g.
phonecalls made/received, applications, e.g. time spent on different apps,
location and media, photos taken) at three levels of complexity (individual
data points, aggregated statistics and processed, i.e. meaningful
interpretations of the data). In order to obtain honest valuations, we employ a
reverse second price auction mechanism. Our findings show that the most
sensitive and valued category of personal information is location. We report
statistically significant associations between actual mobile usage, personal
dispositions, and bidding behavior. Finally, we outline key implications for
the design of mobile services and future markets of personal data.
","[{'version': 'v1', 'created': 'Wed, 2 Jul 2014 13:45:12 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Jul 2014 18:09:32 GMT'}]",2014-07-11,"[['Staiano', 'Jacopo', ''], ['Oliver', 'Nuria', ''], ['Lepri', 'Bruno', ''], ['de Oliveira', 'Rodrigo', ''], ['Caraviello', 'Michele', ''], ['Sebe', 'Nicu', '']]","['used in a searchengine', 'photos shared in a social network', 'etc']"
3788,1502.04634,Danko Ilik,Danko Ilik,The exp-log normal form of types,,"POPL 2017 Proceedings of the 44th ACM SIGPLAN Symposium on
  Principles of Programming Languages. Pages 387-399. Paris, France -- January
  15 - 21, 2017",10.1145/3009837.3009841,,cs.LO cs.PL math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lambda calculi with algebraic data types lie at the core of functional
programming languages and proof assistants, but conceal at least two
fundamental theoretical problems already in the presence of the simplest
non-trivial data type, the sum type. First, we do not know of an explicit and
implemented algorithm for deciding the beta-eta-equality of terms---and this in
spite of the first decidability results proven two decades ago. Second, it is
not clear how to decide when two types are essentially the same, i.e.
isomorphic, in spite of the meta-theoretic results on decidability of the
isomorphism.
  In this paper, we present the exp-log normal form of types---derived from the
representation of exponential polynomials via the unary exponential and
logarithmic functions---that any type built from arrows, products, and sums,
can be isomorphically mapped to. The type normal form can be used as a simple
heuristic for deciding type isomorphism, thanks to the fact that it is a
systematic application of the high-school identities.
  We then show that the type normal form allows to reduce the standard beta-eta
equational theory of the lambda calculus to a specialized version of itself,
while preserving the completeness of equality on terms. We end by describing an
alternative representation of normal terms of the lambda calculus with sums,
together with a Coq-implemented converter into/from our new term calculus. The
difference with the only other previously implemented heuristic for deciding
interesting instances of eta-equality by Balat, Di Cosmo, and Fiore, is that we
exploit the type information of terms substantially and this often allows us to
obtain a canonical representation of terms without performing sophisticated
term analyses.
","[{'version': 'v1', 'created': 'Mon, 16 Feb 2015 17:14:52 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Jun 2015 18:34:09 GMT'}, {'version': 'v3', 'created': 'Tue, 10 May 2016 09:41:43 GMT'}, {'version': 'v4', 'created': 'Thu, 30 Jun 2016 13:39:23 GMT'}]",2019-05-21,"[['Ilik', 'Danko', '']]","['sum type', 'eta equality', 'normal type', 'normal term', 'typeisomorphism', 'type-directed partial evaluation']"
3789,1706.03160,Lin Wu,"Lin Wu, Yang Wang, Junbin Gao, Xue Li","Deep Adaptive Feature Embedding with Local Sample Distributions for
  Person Re-identification",Published on Pattern Recognition,,10.1016/j.patcog.2017.08.029,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Person re-identification (re-id) aims to match pedestrians observed by
disjoint camera views. It attracts increasing attention in computer vision due
to its importance to surveillance system. To combat the major challenge of
cross-view visual variations, deep embedding approaches are proposed by
learning a compact feature space from images such that the Euclidean distances
correspond to their cross-view similarity metric. However, the global Euclidean
distance cannot faithfully characterize the ideal similarity in a complex
visual feature space because features of pedestrian images exhibit unknown
distributions due to large variations in poses, illumination and occlusion.
Moreover, intra-personal training samples within a local range are robust to
guide deep embedding against uncontrolled variations, which however, cannot be
captured by a global Euclidean distance. In this paper, we study the problem of
person re-id by proposing a novel sampling to mine suitable \textit{positives}
(i.e. intra-class) within a local range to improve the deep embedding in the
context of large intra-class variations. Our method is capable of learning a
deep similarity metric adaptive to local sample structure by minimizing each
sample's local distances while propagating through the relationship between
samples to attain the whole intra-class minimization. To this end, a novel
objective function is proposed to jointly optimize similarity metric learning,
local positive mining and robust deep embedding. This yields local
discriminations by selecting local-ranged positive samples, and the learned
features are robust to dramatic intra-class variations. Experiments on
benchmarks show state-of-the-art results achieved by our method.
","[{'version': 'v1', 'created': 'Sat, 10 Jun 2017 00:49:43 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Sep 2017 02:37:44 GMT'}]",2017-09-08,"[['Wu', 'Lin', ''], ['Wang', 'Yang', ''], ['Gao', 'Junbin', ''], ['Li', 'Xue', '']]","['Deep feature embedding', 'Person re-identification', 'Local positive']"
3790,1601.00027,Thomas Fuchs,Thomas J. Fuchs and Joachim M. Buhmann,Computational Pathology: Challenges and Promises for Tissue Analysis,,"Computerized Medical Imaging and Graphics, vol. 35, 7-8, p.
  515-530, 2011",10.1016/j.compmedimag.2011.02.006,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The histological assessment of human tissue has emerged as the key challenge
for detection and treatment of cancer. A plethora of different data sources
ranging from tissue microarray data to gene expression, proteomics or
metabolomics data provide a detailed overview of the health status of a
patient. Medical doctors need to assess these information sources and they rely
on data driven automatic analysis tools. Methods for classification, grouping
and segmentation of heterogeneous data sources as well as regression of noisy
dependencies and estimation of survival probabilities enter the processing
workflow of a pathology diagnosis system at various stages. This paper reports
on state-of-the-art of the design and effectiveness of computational pathology
workflows and it discusses future research directions in this emergent field of
medical informatics and diagnostic machine learning.
","[{'version': 'v1', 'created': 'Thu, 31 Dec 2015 22:33:44 GMT'}]",2016-01-05,"[['Fuchs', 'Thomas J.', ''], ['Buhmann', 'Joachim M.', '']]","['Computational Pathology', 'Machine Learning', 'Medical Imaging', 'Survival Statistics', 'Cancer Research']"
3791,1501.01422,Baher Mawlawi,"Baher Mawlawi (CITI Insa Lyon / Inria Grenoble Rh\^one-Alpes, CEA -
  LETI, INSA Lyon), Jean-Baptiste Dor\'e (CEA - LETI)","CSMA/CA Bottleneck Remediation in Saturation Mode with New Backoff
  Strategy",,"6th International Workshop on Multiple Access Communications,
  2013, pp.70 - 81",10.1007/978-3-319-03871-1_7,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many modern wireless networks integrate carrier sense mul-tiple
access/collision avoidance (CSMA/CA) with exponential backoff as medium access
control (MAC) technique. In order to decrease the MAC overhead and the
collision probability, we propose in this paper a new backoff strategy leading
to better saturation throughput and access de-lay performance comparing to the
classical protocol. We investigate the CSMA/CA with RTS/CTS technique, and we
show that our strategy reaches better saturation throughput and access delay
especially in dense networks. This proposed strategy distributes users over all
the backoff stages to solve the bottleneck problem present in the first backoff
stage. Finally, we analyze our strategy and we compare it to the classical one
modeled by Markov chain. Analytical and simulation results show the improvment
in term of saturation throughput. Cumulative density func-tion (CDF) of the
access delay illustrates the important gain obtained by the proposed strategy.
","[{'version': 'v1', 'created': 'Wed, 7 Jan 2015 09:55:48 GMT'}]",2015-01-08,"[['Mawlawi', 'Baher', '', 'CITI Insa Lyon / Inria Grenoble Rhône-Alpes, CEA -\n  LETI, INSA Lyon'], ['Doré', 'Jean-Baptiste', '', 'CEA - LETI']]","['Carrier sense multiple access/collision avoidance (CSMA/CA)', 'Markovchain', 'delay', 'throughput', 'backoff algorithm']"
3792,1404.2759,Bendaoud Fayssal,"Fayssal Bendaoud, Marwen Abdennebi and Fedoua Didi",Survey On Scheduling And Radio Resources Allocation In Lte,,"International Journal of Next Generation Network ( IJNGN ), Volume
  6, March 2014",10.5121/ijngn.2014.6102,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper focuses on an essential task of the enhanced NodeB eNodeB element
in LTE architecture, the Radio Resource Manager RRM, which aims to accept or
reject requests for connection to the network based on some constraints and
ensuring optimal distribution of radio resources between Users Equipments UEs.
Its main functionalities include Admission Control AC and Packet Scheduling PS.
This paper will center mainly on the PS part of the RRM task, which performs
the radio resource allocation in both uplink and downlink directions. Several
approaches and algorithms have been proposed in the literature to address this
need ie : allocate resources efficiently, the diversity and multitude of
algorithms is related to the factors considered for the optimal management of
radio resource, specifically, the traffic type and the QoS Quality of Service
requested by the UE. In this article, an art's state of the radio resource
allocation strategies and a detailed study of several scheduling algorithms
proposed for LTE (uplink and downlink) are made. Therefore, we offer our
evaluation and criticism.
","[{'version': 'v1', 'created': 'Thu, 10 Apr 2014 09:57:27 GMT'}]",2014-04-15,"[['Bendaoud', 'Fayssal', ''], ['Abdennebi', 'Marwen', ''], ['Didi', 'Fedoua', '']]","['Enhanced NodeB eNodeB', 'LTE', 'Radio Resource manager RRM', 'Admission Control AC', 'Packet SchedulerPS']"
3793,1807.02964,Mohammad Masudur Rahman,Mohammad Masudur Rahman and Chanchal K. Roy,"QUICKAR: Automatic Query Reformulation for Concept Location using
  Crowdsourced Knowledge","The 31st IEEE/ACM International Conference on Automated Software
  Engineering (ASE 2016), pp. 220--225, Singapore, September 2016","Proc. ASE 2016, pp. 220--225",10.1145/2970276.2970362,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  During maintenance, software developers deal with numerous change requests
made by the users of a software system. Studies show that the developers find
it challenging to select appropriate search terms from a change request during
concept location. In this paper, we propose a novel technique--QUICKAR--that
automatically suggests helpful reformulations for a given query by leveraging
the crowdsourced knowledge from Stack Overflow. It determines semantic
similarity or relevance between any two terms by analyzing their adjacent word
lists from the programming questions of Stack Overflow, and then suggests
semantically relevant queries for concept location. Experiments using 510
queries from two software systems suggest that our technique can improve or
preserve the quality of 76% of the initial queries on average which is
promising. Comparison with one baseline technique validates our preliminary
findings, and also demonstrates the potential of our technique.
","[{'version': 'v1', 'created': 'Mon, 9 Jul 2018 07:00:01 GMT'}]",2018-07-10,"[['Rahman', 'Mohammad Masudur', ''], ['Roy', 'Chanchal K.', '']]","['Query reformulation', 'crowdsourced knowledge', 'semantic relevance', 'word co-occurrence', 'adjacency list', 'Stack Overflow']"
3794,1603.00074,Jonathan Skaza,Jonathan Skaza and Brian Blais,Modeling the Infectiousness of Twitter Hashtags,,,10.1016/j.physa.2016.08.038,,cs.SI q-bio.PE stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study applies dynamical and statistical modeling techniques to quantify
the proliferation and popularity of trending hashtags on Twitter. Using
time-series data reflecting actual tweets in New York City and San Francisco,
we present estimates for the dynamics (i.e., rates of infection and recovery)
of several hundred trending hashtags using an epidemic modeling framework
coupled with Bayesian Markov Chain Monte Carlo (MCMC) methods. This
methodological strategy is an extension of techniques traditionally used to
model the spread of infectious disease. We demonstrate that in some models,
hashtags can be grouped by infectiousness, possibly providing a method for
quantifying the trendiness of a topic.
","[{'version': 'v1', 'created': 'Mon, 29 Feb 2016 22:21:42 GMT'}]",2016-09-21,"[['Skaza', 'Jonathan', ''], ['Blais', 'Brian', '']]","['Twitter dynamics', 'trending', 'SIR', 'SIRI', 'MCMC', 'informationdiffusion']"
3795,1703.06712,Stefan Wagner,Stefan Wagner,Scrum for cyber-physical systems: a process proposal,"6 pages, 3 figures, RCoSE 2014 Proceedings of the 1st International
  Workshop on Rapid Continuous Software Engineering. ACM, 2014","RCoSE 2014 Proceedings of the 1st International Workshop on Rapid
  Continuous Software Engineering. ACM, 2014",10.1145/2593812.2593819,,cs.SE cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Agile development processes and especially Scrum are changing the state of
the practice in software development. Many companies in the classical IT sector
have adopted them to successfully tackle various challenges from the rapidly
changing environments and increasingly complex software systems. Companies
developing software for embedded or cyber-physical systems, however, are still
hesitant to adopt such processes. Despite successful applications of Scrum and
other agile methods for cyber-physical systems, there is still no complete
process that maps their specific challenges to practices in Scrum. We propose
to fill this gap by treating all design artefacts in such a development in the
same way: In software development, the final design is already the product, in
hardware and mechanics it is the starting point of production. We sketch the
Scrum extension Scrum CPS by showing how Scrum could be used to develop all
design artefacts for a cyber physical system. Hardware and mechanical parts
that might not be available yet are simulated. With this approach, we can
directly and iteratively build the final software and produce detailed models
for the hardware and mechanics production in parallel. We plan to further
detail Scrum CPS and apply it first in a series of student projects to gather
more experience before testing it in an industrial case study.
","[{'version': 'v1', 'created': 'Mon, 20 Mar 2017 12:45:43 GMT'}]",2017-11-15,"[['Wagner', 'Stefan', '']]","['Scrum', 'Agile', 'Cyber-physical']"
3796,1912.03747,\'Oscar Gil Viyuela,\'Oscar Gil Viyuela and Alberto Sanfeliu,"Effects of a Social Force Model reward in Robot Navigation based on Deep
  Reinforcement Learning","This is a preprint. This paper has been accepted to the fourth
  Iberian Robotics Conference (Robot 2019)",,10.1007/978-3-030-36150-1_18,,cs.RO cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this paper is proposed an inclusion of the Social Force Model (SFM) into a
concrete Deep Reinforcement Learning (RL) framework for robot navigation. These
types of techniques have demonstrated to be useful to deal with different types
of environments to achieve a goal. In Deep RL, a description of the world to
describe the states and a reward adapted to the environment are crucial
elements to get the desire behaviour and achieve a high performance. For this
reason, this work adds a dense reward function based on SFM and uses the forces
in the states like an additional description. Furthermore, obstacles are added
to improve the behaviour of works that only consider moving agents. This SFM
inclusion can offer a better description of the obstacles for the navigation.
Several simulations have been done to check the effects of these modifications
in the average performance.
","[{'version': 'v1', 'created': 'Sun, 8 Dec 2019 19:43:50 GMT'}]",2019-12-10,"[['Viyuela', 'Óscar Gil', ''], ['Sanfeliu', 'Alberto', '']]","['Robot Navigation', 'Deep Reinforcement Learning', 'SocialForce Model', 'dense reward function']"
3797,1606.04253,Vladimir Lysikov,"Markus Bl\""aser, Vladimir Lysikov",On degeneration of tensors and algebras,11 pages; accepted at MFCS 2016,"41st International Symposium on Mathematical Foundations of
  Computer Science (MFCS 2016), LIPIcs vol.58, pp. 19:1--19:11, 2016",10.4230/LIPIcs.MFCS.2016.19,,cs.CC math.AG,http://creativecommons.org/licenses/by/4.0/,"  An important building block in all current asymptotically fast algorithms for
matrix multiplication are tensors with low border rank, that is, tensors whose
border rank is equal or very close to their size. To find new asymptotically
fast algorithms for matrix multiplication, it seems to be important to
understand those tensors whose border rank is as small as possible, so called
tensors of minimal border rank.
  We investigate the connection between degenerations of associative algebras
and degenerations of their structure tensors in the sense of Strassen. It
allows us to describe an open subset of $n \times n \times n$ tensors of
minimal border rank in terms of smoothability of commutative algebras. We
describe the smoothable algebra associated to the Coppersmith-Winograd tensor
and prove a lower bound for the border rank of the tensor used in the ""easy
construction"" of Coppersmith and Winograd.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2016 08:47:35 GMT'}]",2016-08-25,"[['Bläser', 'Markus', ''], ['Lysikov', 'Vladimir', '']]","['bilinear complexity', 'border rank', 'commutative algebras', 'lower bounds']"
3798,1608.05889,Jing Wang,"Jing Wang and Meng Wang and Peipei Li and Luoqi Liu and Zhongqiu Zhao
  and Xuegang Hu and Xindong Wu",Online Feature Selection with Group Structure Analysis,"IEEE Transactions on Knowledge and Data Engineering,2015",,10.1109/TKDE.2015.2441716,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online selection of dynamic features has attracted intensive interest in
recent years. However, existing online feature selection methods evaluate
features individually and ignore the underlying structure of feature stream.
For instance, in image analysis, features are generated in groups which
represent color, texture and other visual information. Simply breaking the
group structure in feature selection may degrade performance. Motivated by this
fact, we formulate the problem as an online group feature selection. The
problem assumes that features are generated individually but there are group
structure in the feature stream. To the best of our knowledge, this is the
first time that the correlation among feature stream has been considered in the
online feature selection process. To solve this problem, we develop a novel
online group feature selection method named OGFS. Our proposed approach
consists of two stages: online intra-group selection and online inter-group
selection. In the intra-group selection, we design a criterion based on
spectral analysis to select discriminative features in each group. In the
inter-group selection, we utilize a linear regression model to select an
optimal subset. This two-stage procedure continues until there are no more
features arriving or some predefined stopping conditions are met. %Our method
has been applied Finally, we apply our method to multiple tasks including image
classification %, face verification and face verification. Extensive empirical
studies performed on real-world and benchmark data sets demonstrate that our
method outperforms other state-of-the-art online feature selection %method
methods.
","[{'version': 'v1', 'created': 'Sun, 21 Aug 2016 02:39:48 GMT'}]",2016-08-23,"[['Wang', 'Jing', ''], ['Wang', 'Meng', ''], ['Li', 'Peipei', ''], ['Liu', 'Luoqi', ''], ['Zhao', 'Zhongqiu', ''], ['Hu', 'Xuegang', ''], ['Wu', 'Xindong', '']]","['Online feature selection', 'Streaming feature', 'Group structure', 'Classification', 'Face Verification']"
3799,1901.10736,Christian Schilling,"Sergiy Bogomolov, Marcelo Forets, Goran Frehse, Kostiantyn Potomkin,
  Christian Schilling",JuliaReach: a Toolbox for Set-Based Reachability,"Accepted in Proceedings of HSCC'19: 22nd ACM International Conference
  on Hybrid Systems: Computation and Control (HSCC'19)",HSCC 2019,10.1145/3302504.3311804,,cs.SY math.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present JuliaReach, a toolbox for set-based reachability analysis of
dynamical systems. JuliaReach consists of two main packages: Reachability,
containing implementations of reachability algorithms for continuous and hybrid
systems, and LazySets, a standalone library that implements state-of-the-art
algorithms for calculus with convex sets. The library offers both concrete and
lazy set representations, where the latter stands for the ability to delay set
computations until they are needed. The choice of the programming language
Julia and the accompanying documentation of our toolbox allow researchers to
easily translate set-based algorithms from mathematics to software in a
platform-independent way, while achieving runtime performance that is
comparable to statically compiled languages. Combining lazy operations in high
dimensions and explicit computations in low dimensions, JuliaReach can be
applied to solve complex, large-scale problems.
","[{'version': 'v1', 'created': 'Wed, 30 Jan 2019 10:02:35 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Mar 2019 09:17:47 GMT'}]",2022-05-03,"[['Bogomolov', 'Sergiy', ''], ['Forets', 'Marcelo', ''], ['Frehse', 'Goran', ''], ['Potomkin', 'Kostiantyn', ''], ['Schilling', 'Christian', '']]","['reachability analysis', 'hybrid systems', 'lazy computation']"
3800,1904.01672,Brent Hecht,"J. Sch\""oning, B. Hecht, M. Raubal, A. Kr\""uger, M. Marsh, and M. Rohs","Improving Interaction with Virtual Globes through Spatial Thinking:
  Helping Users Ask ""Why?""","Proceedings of the International Conference on Intelligent User
  Interfaces (IUI 2008)",,10.1145/1378773.1378790,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Virtual globes have progressed from little-known technology to broadly
popular software in a mere few years. We investigated this phenomenon through a
survey and discovered that, while virtual globes are en vogue, their use is
restricted to a small set of tasks so simple that they do not involve any
spatial thinking. Spatial thinking requires that users ask ""what is where"" and
""why""; the most common virtual globe tasks only include the ""what"". Based on
the results of this survey, we have developed a multi-touch virtual globe
derived from an adapted virtual globe paradigm designed to widen the potential
uses of the technology by helping its users to inquire about both the ""what is
where"" and ""why"" of spatial distribution. We do not seek to provide users with
full GIS (geographic information system) functionality, but rather we aim to
facilitate the asking and answering of simple ""why"" questions about general
topics that appeal to a wide virtual globe user base.
","[{'version': 'v1', 'created': 'Tue, 2 Apr 2019 21:29:33 GMT'}]",2019-04-04,"[['Schöning', 'J.', ''], ['Hecht', 'B.', ''], ['Raubal', 'M.', ''], ['Krüger', 'A.', ''], ['Marsh', 'M.', ''], ['Rohs', 'M.', '']]","['Virtual Globes', 'Spatial Thinking', 'Multi-Touch Interaction', 'Wall-Size Interfaces', 'Artificial Intelligence', 'Wikipedia', 'Semantic Relatedness']"
3801,1912.06442,Delia Velasco-Montero,"Delia Velasco-Montero (1), Jorge Fern\'andez-Berni (1), Ricardo
  Carmona-Gal\'an (1), \'Angel Rodr\'iguez-V\'azquez (1) ((1) Instituto de
  Microelectr\'onica de Sevilla (Universidad de Sevilla-CSIC))","PreVIous: A Methodology for Prediction of Visual Inference Performance
  on IoT Devices",18 pages. 7 figures,,10.1109/JIOT.2020.2981684,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents PreVIous, a methodology to predict the performance of
convolutional neural networks (CNNs) in terms of throughput and energy
consumption on vision-enabled devices for the Internet of Things. CNNs
typically constitute a massive computational load for such devices, which are
characterized by scarce hardware resources to be shared among multiple
concurrent tasks. Therefore, it is critical to select the optimal CNN
architecture for a particular hardware platform according to prescribed
application requirements. However, the zoo of CNN models is already vast and
rapidly growing. To facilitate a suitable selection, we introduce a prediction
framework that allows to evaluate the performance of CNNs prior to their actual
implementation. The proposed methodology is based on PreVIousNet, a neural
network specifically designed to build accurate per-layer performance
predictive models. PreVIousNet incorporates the most usual parameters found in
state-of-the-art network architectures. The resulting predictive models for
inference time and energy have been tested against comprehensive
characterizations of seven well-known CNN models running on two different
software frameworks and two different embedded platforms. To the best of our
knowledge, this is the most extensive study in the literature concerning CNN
performance prediction on low-power low-cost devices. The average deviation
between predictions and real measurements is remarkably low, ranging from 3% to
10%. This means state-of-the-art modeling accuracy. As an additional asset, the
fine-grained a priori analysis provided by PreVIous could also be exploited by
neural architecture search engines.
","[{'version': 'v1', 'created': 'Fri, 13 Dec 2019 12:41:40 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Mar 2020 08:08:46 GMT'}]",2020-03-18,"[['Velasco-Montero', 'Delia', ''], ['Fernández-Berni', 'Jorge', ''], ['Carmona-Galán', 'Ricardo', ''], ['Rodríguez-Vázquez', 'Ángel', '']]","['Vision-Enabled IoT', 'Edge Devices', 'Deep Learning', 'Convolutional Neural Networks', 'Inference Performance', 'NeuralArchitecture Search']"
3802,1902.08149,Paul Gastin,Manfred Droste and Paul Gastin,Aperiodic Weighted Automata and Weighted First-Order Logic,An extended abstract of the paper appeared at MFCS'19,,10.4230/LIPIcs.MFCS.2019.76,,cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  By fundamental results of Sch\""utzenberger, McNaughton and Papert from the
1970s, the classes of first-order definable and aperiodic languages coincide.
Here, we extend this equivalence to a quantitative setting. For this, weighted
automata form a general and widely studied model. We define a suitable notion
of a weighted first-order logic. Then we show that this weighted first-order
logic and aperiodic polynomially ambiguous weighted automata have the same
expressive power. Moreover, we obtain such equivalence results for suitable
weighted sublogics and finitely ambiguous or unambiguous aperiodic weighted
automata. Our results hold for general weight structures, including all
semirings, average computations of costs, bounded lattices, and others.
","[{'version': 'v1', 'created': 'Thu, 21 Feb 2019 17:23:30 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Aug 2019 10:18:37 GMT'}, {'version': 'v3', 'created': 'Mon, 30 Sep 2019 16:18:55 GMT'}]",2019-10-01,"[['Droste', 'Manfred', ''], ['Gastin', 'Paul', '']]","['Weighted automata', 'weighted logic', 'aperiodic automata', 'first-order logic', 'unambiguous', 'finitely ambiguous', 'polynomially ambiguous']"
3803,0909.1381,Goutam Paul,"Sayan Bhattacharya, Goutam Paul, Swagato Sanyal","On Necessary and Sufficient Number of Cops in the Game of Cops and
  Robber in Multidimensional Grids","This is a revised and extended version of the poster paper with the
  same title that has been presented in the 8th Asian Symposium on Computer
  Mathematics (ASCM), December 15-17, 2007, Singapore","Discrete Applied Mathematics, pages 1745--1751, vol. 158, no. 16,
  August 2010",10.1016/j.dam.2010.06.014,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We theoretically analyze the Cops and Robber Game for the first time in a
multidimensional grid. It is shown that for an $n$-dimensional grid, at least
$n$ cops are necessary to ensure capture of the robber. We also present a set
of cop strategies for which $n$ cops are provably sufficient to catch the
robber. Further, for two-dimensional grid, we provide an efficient cop strategy
for which the robber is caught even by a single cop under certain conditions.
","[{'version': 'v1', 'created': 'Tue, 8 Sep 2009 03:55:29 GMT'}]",2015-06-12,"[['Bhattacharya', 'Sayan', ''], ['Paul', 'Goutam', ''], ['Sanyal', 'Swagato', '']]","['Cops and Robber', 'Game', 'Graph', 'Grid', 'Winning Strategy']"
3804,1007.1282,Vladimir Pestov,Vladimir Pestov,"A note on sample complexity of learning binary output neural networks
  under fixed input distributions","6 pages, latex in IEEE conference proceedings format","Proc. 2010 Eleventh Brazilian Symposium on Neural Networks (S\~ao
  Bernardo do Campo, SP, Brazil, 23-28 October 2010), IEEE Computer Society,
  2010, pp. 7-12",10.1109/SBRN.2010.10,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that the learning sample complexity of a sigmoidal neural network
constructed by Sontag (1992) required to achieve a given misclassification
error under a fixed purely atomic distribution can grow arbitrarily fast: for
any prescribed rate of growth there is an input distribution having this rate
as the sample complexity, and the bound is asymptotically tight. The rate can
be superexponential, a non-recursive function, etc. We further observe that
Sontag's ANN is not Glivenko-Cantelli under any input distribution having a
non-atomic part.
","[{'version': 'v1', 'created': 'Thu, 8 Jul 2010 03:58:25 GMT'}]",2016-11-17,"[['Pestov', 'Vladimir', '']]","['PAC learnability', 'fixed distribution learning', 'sample complexity', 'infinite VC dimension', 'witness of irregularity', 'Sontag’s ANN', 'precompactness']"
3805,1711.07655,Eli (Omid) David,"Eli David, Iddo Greental",Genetic Algorithms for Evolving Deep Neural Networks,,"ACM Genetic and Evolutionary Computation Conference (GECCO), pages
  1451-1452, Vancouver, Canada, July 2014",10.1145/2598394.2602287,,cs.NE cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, deep learning methods applying unsupervised learning to
train deep layers of neural networks have achieved remarkable results in
numerous fields. In the past, many genetic algorithms based methods have been
successfully applied to training neural networks. In this paper, we extend
previous work and propose a GA-assisted method for deep learning. Our
experimental results indicate that this GA-assisted approach improves the
performance of a deep autoencoder, producing a sparser neural network.
","[{'version': 'v1', 'created': 'Tue, 21 Nov 2017 07:23:32 GMT'}]",2017-11-22,"[['David', 'Eli', ''], ['Greental', 'Iddo', '']]","['Genetic algorithms', 'Deep learning', 'Neural networks', 'Autoencoders']"
3806,1705.08747,"Jarkko Peltom\""aki","Jarkko Peltom\""aki and Ville Salo",On winning shifts of marked uniform substitutions,Extended version of a paper presented at RuFiDiM IV,"RAIRO - Theoretical Informatics and Applications, Vol. 53.1-2,
  51-66 (2019)",10.1051/ita/2018007,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The second author introduced with I. T\""orm\""a a two-player word-building
game [Playing with Subshifts, Fund. Inform. 132 (2014), 131--152]. The game has
a predetermined (possibly finite) choice sequence $\alpha_1$, $\alpha_2$,
$\ldots$ of integers such that on round $n$ the player $A$ chooses a subset
$S_n$ of size $\alpha_n$ of some fixed finite alphabet and the player $B$ picks
a letter from the set $S_n$. The outcome is determined by whether the word
obtained by concatenating the letters $B$ picked lies in a prescribed target
set $X$ (a win for player $A$) or not (a win for player $B$). Typically, we
consider $X$ to be a subshift. The winning shift $W(X)$ of a subshift $X$ is
defined as the set of choice sequences for which $A$ has a winning strategy
when the target set is the language of $X$. The winning shift $W(X)$ mirrors
some properties of $X$. For instance, $W(X)$ and $X$ have the same entropy.
Virtually nothing is known about the structure of the winning shifts of
subshifts common in combinatorics on words. In this paper, we study the winning
shifts of subshifts generated by marked uniform substitutions, and show that
these winning shifts, viewed as subshifts, also have a substitutive structure.
Particularly, we give an explicit description of the winning shift for the
generalized Thue-Morse substitutions. It is known that $W(X)$ and $X$ have the
same factor complexity. As an example application, we exploit this connection
to give a simple derivation of the first difference and factor complexity
functions of subshifts generated by marked substitutions. We describe these
functions in particular detail for the generalized Thue-Morse substitutions.
","[{'version': 'v1', 'created': 'Wed, 24 May 2017 13:23:17 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Sep 2018 13:54:26 GMT'}]",2019-09-17,"[['Peltomäki', 'Jarkko', ''], ['Salo', 'Ville', '']]","['two-player game', 'winning shift', 'marked substitution', 'factor complexity', 'generalized ThueMorse word']"
3807,1701.00646,Paul Weng,Paul Weng,From Preference-Based to Multiobjective Sequential Decision-Making,accepted at MIWAI 2017,,10.1007/978-3-319-49397-8_20,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a link between preference-based and multiobjective
sequential decision-making. While transforming a multiobjective problem to a
preference-based one is quite natural, the other direction is a bit less
obvious. We present how this transformation (from preference-based to
multiobjective) can be done under the classic condition that preferences over
histories can be represented by additively decomposable utilities and that the
decision criterion to evaluate policies in a state is based on expectation.
This link yields a new source of multiobjective sequential decision-making
problems (i.e., when reward values are unknown) and justifies the use of
solving methods developed in one setting in the other one.
","[{'version': 'v1', 'created': 'Tue, 3 Jan 2017 10:57:06 GMT'}]",2017-01-04,"[['Weng', 'Paul', '']]","['Sequential decision-making', 'Preference-based Reinforcement Learning', 'Multiobjective Markov decision process', 'Multiobjective Reinforcement Learning']"
3808,2105.06296,David Moss,"Mengxi Tan, Xingyuan Xu, and David J. Moss","Optical neuromorphic processing at Tera-OP/s speeds based on Kerr
  soliton crystal microcombs","28 pages, 21 figures, 110 references. arXiv admin note: substantial
  text overlap with arXiv:2011.07393","SPIE Integrated Optics: Devices, Materials, and Technologies XXV
  Paper 11689-38, PW21O-OE201-67 January (2021)",10.1117/12.2584017,,cs.ET physics.optics,http://creativecommons.org/licenses/by/4.0/,"  Convolutional neural networks (CNNs), inspired by biological visual cortex
systems, are a powerful category of artificial neural networks that can extract
the hierarchical features of raw data to greatly reduce the network parametric
complexity and enhance the predicting accuracy. They are of significant
interest for machine learning tasks such as computer vision, speech
recognition, playing board games and medical diagnosis. Optical neural networks
offer the promise of dramatically accelerating computing speed to overcome the
inherent bandwidth bottleneck of electronics. Here, we demonstrate a universal
optical vector convolutional accelerator operating beyond 10 TeraOPS (TOPS:
operations per second), generating convolutions of images of 250,000 pixels
with 8 bit resolution for 10 kernels simultaneously, enough for facial image
recognition. We then use the same hardware to sequentially form a deep optical
CNN with ten output neurons, achieving successful recognition of full 10 digits
with 900 pixel handwritten digit images with 88% accuracy. Our results are
based on simultaneously interleaving temporal, wavelength and spatial
dimensions enabled by an integrated microcomb source. This approach is scalable
and trainable to much more complex networks for demanding applications such as
unmanned vehicle and real time video recognition.
","[{'version': 'v1', 'created': 'Wed, 12 May 2021 05:22:32 GMT'}]",2021-05-14,"[['Tan', 'Mengxi', ''], ['Xu', 'Xingyuan', ''], ['Moss', 'David J.', '']]","['Optical neural networks', 'neuromorphic processor', 'microcomb', 'convolutional accelerator']"
3809,1802.05324,Anh Tuan Nguyen,"Anh Tuan Nguyen, Jian Xu, Diu Khue Luu, Qi Zhao, and Zhi Yang","Advancing System Performance with Redundancy: From Biological to
  Artificial Designs",,"Neural Computation, MIT Press, 2019",10.1162/neco_a_01166,,cs.IT cs.NE math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Redundancy is a fundamental characteristic of many biological processes such
as those in the genetic, visual, muscular and nervous system; yet its function
has not been fully understood. The conventional interpretation of redundancy is
that it serves as a fault-tolerance mechanism, which leads to redundancy's de
facto application in man-made systems for reliability enhancement. On the
contrary, our previous works have demonstrated an example where redundancy can
be engineered solely for enhancing other aspects of the system, namely accuracy
and precision. This design was inspired by the binocular structure of the human
vision which we believe may share a similar operation. In this paper, we
present a unified theory describing how such utilization of redundancy is
feasible through two complementary mechanisms: representational redundancy
(RPR) and entangled redundancy (ETR). Besides the previous works, we point out
two additional examples where our new understanding of redundancy can be
applied to justify a system's superior performance. One is the human
musculoskeletal system (HMS) - a biological instance, and one is the deep
residual neural network (ResNet) - an artificial counterpart. We envision that
our theory would provide a framework for the future development of bio-inspired
redundant artificial systems as well as assist the studies of the fundamental
mechanisms governing various biological processes.
","[{'version': 'v1', 'created': 'Wed, 14 Feb 2018 21:13:38 GMT'}]",2019-02-04,"[['Nguyen', 'Anh Tuan', ''], ['Xu', 'Jian', ''], ['Luu', 'Diu Khue', ''], ['Zhao', 'Qi', ''], ['Yang', 'Zhi', '']]","['Representational redundancy', 'entangled redundancy', 'precision enhance']"
3810,1608.04667,Lovedeep Gondara,Lovedeep Gondara,Medical image denoising using convolutional denoising autoencoders,"To appear: 6 pages, paper to be published at the Fourth Workshop on
  Data Mining in Biomedical Informatics and Healthcare at ICDM, 2016",,10.1109/ICDMW.2016.0041,,cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image denoising is an important pre-processing step in medical image
analysis. Different algorithms have been proposed in past three decades with
varying denoising performances. More recently, having outperformed all
conventional methods, deep learning based models have shown a great promise.
These methods are however limited for requirement of large training sample size
and high computational costs. In this paper we show that using small sample
size, denoising autoencoders constructed using convolutional layers can be used
for efficient denoising of medical images. Heterogeneous images can be combined
to boost sample size for increased denoising performance. Simplest of networks
can reconstruct images with corruption levels so high that noise and signal are
not differentiable to human eye.
","[{'version': 'v1', 'created': 'Tue, 16 Aug 2016 16:39:20 GMT'}, {'version': 'v2', 'created': 'Sun, 18 Sep 2016 01:09:57 GMT'}]",2017-02-21,"[['Gondara', 'Lovedeep', '']]","['Image denoising', 'denoising autoencoder', 'convolutional autoencoder']"
3811,1501.06180,Shanshan Zhang,"Shanshan Zhang, Christian Bauckhage, Dominik A. Klein, Armin B.
  Cremers",Exploring Human Vision Driven Features for Pedestrian Detection,"Accepted for publication in IEEE Transactions on Circuits and Systems
  for Video Technology (TCSVT)",,10.1109/TCSVT.2015.2397199,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by the center-surround mechanism in the human visual attention
system, we propose to use average contrast maps for the challenge of pedestrian
detection in street scenes due to the observation that pedestrians indeed
exhibit discriminative contrast texture. Our main contributions are first to
design a local, statistical multi-channel descriptorin order to incorporate
both color and gradient information. Second, we introduce a multi-direction and
multi-scale contrast scheme based on grid-cells in order to integrate
expressive local variations. Contributing to the issue of selecting most
discriminative features for assessing and classification, we perform extensive
comparisons w.r.t. statistical descriptors, contrast measurements, and scale
structures. This way, we obtain reasonable results under various
configurations. Empirical findings from applying our optimized detector on the
INRIA and Caltech pedestrian datasets show that our features yield
state-of-the-art performance in pedestrian detection.
","[{'version': 'v1', 'created': 'Sun, 25 Jan 2015 16:52:41 GMT'}]",2016-11-17,"[['Zhang', 'Shanshan', ''], ['Bauckhage', 'Christian', ''], ['Klein', 'Dominik A.', ''], ['Cremers', 'Armin B.', '']]","['center-surround contrast', 'human vision', 'channels', 'multi-direction', 'multi-scale', 'pedestrian detection']"
3812,1703.01203,Alexander Gorban,"A.N. Gorban, I.Y. Tyukin",Stochastic Separation Theorems,"6 pages, accepted for publication in Neural Networks (Letter section)","Neural Networks 94 (2017), 255-259",10.1016/j.neunet.2017.07.014,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  The problem of non-iterative one-shot and non-destructive correction of
unavoidable mistakes arises in all Artificial Intelligence applications in the
real world. Its solution requires robust separation of samples with errors from
samples where the system works properly. We demonstrate that in (moderately)
high dimension this separation could be achieved with probability close to one
by linear discriminants. Surprisingly, separation of a new image from a very
large set of known images is almost always possible even in moderately high
dimensions by linear functionals, and coefficients of these functionals can be
found explicitly. Based on fundamental properties of measure concentration, we
show that for $M<a\exp(b{n})$ random $M$-element sets in $\mathbb{R}^n$ are
linearly separable with probability $p$, $p>1-\vartheta$, where $1>\vartheta>0$
is a given small constant. Exact values of $a,b>0$ depend on the probability
distribution that determines how the random $M$-element sets are drawn, and on
the constant $\vartheta$. These {\em stochastic separation theorems} provide a
new instrument for the development, analysis, and assessment of machine
learning methods and algorithms in high dimension. Theoretical statements are
illustrated with numerical examples.
","[{'version': 'v1', 'created': 'Fri, 3 Mar 2017 15:27:38 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Apr 2017 16:47:51 GMT'}, {'version': 'v3', 'created': 'Thu, 3 Aug 2017 17:37:06 GMT'}]",2017-09-05,"[['Gorban', 'A. N.', ''], ['Tyukin', 'I. Y.', '']]","['Fisher’s discriminant', 'random set', 'measure concentration', 'linear separability', 'machine learning', 'extreme point']"
3813,cs/0306017,Panos Rondogiannis,"Panos Rondogiannis, William W. Wadge",Minimum Model Semantics for Logic Programs with Negation-as-Failure,28 pages,ACM Trans. Comput. Log. 6(2): 441-467 (2005),,,cs.LO cs.AI cs.PL,,"  We give a purely model-theoretic characterization of the semantics of logic
programs with negation-as-failure allowed in clause bodies. In our semantics
the meaning of a program is, as in the classical case, the unique minimum model
in a program-independent ordering. We use an expanded truth domain that has an
uncountable linearly ordered set of truth values between False (the minimum
element) and True (the maximum), with a Zero element in the middle. The truth
values below Zero are ordered like the countable ordinals. The values above
Zero have exactly the reverse order. Negation is interpreted as reflection
about Zero followed by a step towards Zero; the only truth value that remains
unaffected by negation is Zero. We show that every program has a unique minimum
model M_P, and that this model can be constructed with a T_P iteration which
proceeds through the countable ordinals. Furthermore, we demonstrate that M_P
can also be obtained through a model intersection construction which
generalizes the well-known model intersection theorem for classical logic
programming. Finally, we show that by collapsing the true and false values of
the infinite-valued model M_P to (the classical) True and False, we obtain a
three-valued model identical to the well-founded one.
","[{'version': 'v1', 'created': 'Tue, 3 Jun 2003 12:12:40 GMT'}]",2011-06-20,"[['Rondogiannis', 'Panos', ''], ['Wadge', 'William W.', '']]","['Negation-as-failure', 'non-monotonic reasoning', 'well-founded model']"
3814,1807.11429,Arjun Pakrashi,"Arjun Pakrashi, Brian Mac Namee","Kalman Filter-based Heuristic Ensemble (KFHE): A new perspective on
  multi-class ensemble classification using Kalman filters",,"Volume 485, June 2019, Pages 456-485",10.1016/j.ins.2019.02.017,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a new perspective on multi-class ensemble
classification that considers training an ensemble as a state estimation
problem. The new perspective considers the final ensemble classifier model as a
static state, which can be estimated using a Kalman filter that combines noisy
estimates made by individual classifier models. A new algorithm based on this
perspective, the Kalman Filter-based Heuristic Ensemble (KFHE), is also
presented in this paper which shows the practical applicability of the new
perspective. Experiments performed on 30 datasets compare KFHE with
state-of-the-art multi-class ensemble classification algorithms and show the
potential and effectiveness of the new perspective and algorithm. Existing
ensemble approaches trade off classification accuracy against robustness to
class label noise, but KFHE is shown to be significantly better or at least as
good as the state-of-the-art algorithms for datasets both with and without
class label noise.
","[{'version': 'v1', 'created': 'Mon, 30 Jul 2018 16:38:51 GMT'}, {'version': 'v2', 'created': 'Sat, 29 Sep 2018 21:02:48 GMT'}, {'version': 'v3', 'created': 'Thu, 21 Feb 2019 21:22:03 GMT'}]",2019-02-25,"[['Pakrashi', 'Arjun', ''], ['Mac Namee', 'Brian', '']]","['Classification', 'Multi-class', 'Ensemble', 'Kalman filter', 'Heuristic']"
3815,2006.04599,Aylin Caliskan,Akshat Pandey and Aylin Caliskan,"Disparate Impact of Artificial Intelligence Bias in Ridehailing
  Economy's Price Discrimination Algorithms","16 pages, 3 tables, 8 figures","AAAI/ACM Conference on Artificial Intelligence, Ethics, and
  Society (AAAI/ACM AIES 2021)",10.1145/3461702.3462561,,cs.CY cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Ridehailing applications that collect mobility data from individuals to
inform smart city planning predict each trip's fare pricing with automated
algorithms that rely on artificial intelligence (AI). This type of AI
algorithm, namely a price discrimination algorithm, is widely used in the
industry's black box systems for dynamic individualized pricing. Lacking
transparency, studying such AI systems for fairness and disparate impact has
not been possible without access to data used in generating the outcomes of
price discrimination algorithms. Recently, in an effort to enhance transparency
in city planning, the city of Chicago regulation mandated that transportation
providers publish anonymized data on ridehailing. As a result, we present the
first large-scale measurement of the disparate impact of price discrimination
algorithms used by ridehailing applications.
  The application of random effects models from the meta-analysis literature
combines the city-level effects of AI bias on fare pricing from census tract
attributes, aggregated from the American Community Survey. An analysis of 100
million ridehailing samples from the city of Chicago indicates a significant
disparate impact in fare pricing of neighborhoods due to AI bias learned from
ridehailing utilization patterns associated with demographic attributes.
Neighborhoods with larger non-white populations, higher poverty levels, younger
residents, and high education levels are significantly associated with higher
fare prices, with combined effect sizes, measured in Cohen's d, of -0.32,
-0.28, 0.69, and 0.24 for each demographic, respectively. Further, our methods
hold promise for identifying and addressing the sources of disparate impact in
AI algorithms learning from datasets that contain U.S. geolocations.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2020 13:51:03 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Jun 2020 21:06:33 GMT'}, {'version': 'v3', 'created': 'Fri, 19 Jun 2020 00:45:59 GMT'}, {'version': 'v4', 'created': 'Mon, 22 Jun 2020 19:43:31 GMT'}, {'version': 'v5', 'created': 'Thu, 8 Apr 2021 14:42:09 GMT'}, {'version': 'v6', 'created': 'Mon, 3 May 2021 20:35:37 GMT'}]",2021-05-05,"[['Pandey', 'Akshat', ''], ['Caliskan', 'Aylin', '']]","['AI ethics', 'algorithmic bias', 'disparate impact', 'geolocation', 'prediction', 'price discrimination']"
3816,1603.06201,Gong Cheng,"Gong Cheng, Junwei Han",A Survey on Object Detection in Optical Remote Sensing Images,"This manuscript is the accepted version for ISPRS Journal of
  Photogrammetry and Remote Sensing","ISPRS Journal of Photogrammetry and Remote Sensing, 117: 11-28,
  2016",10.1016/j.isprsjprs.2016.03.014,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Object detection in optical remote sensing images, being a fundamental but
challenging problem in the field of aerial and satellite image analysis, plays
an important role for a wide range of applications and is receiving significant
attention in recent years. While enormous methods exist, a deep review of the
literature concerning generic object detection is still lacking. This paper
aims to provide a review of the recent progress in this field. Different from
several previously published surveys that focus on a specific object class such
as building and road, we concentrate on more generic object categories
including, but are not limited to, road, building, tree, vehicle, ship,
airport, urban-area. Covering about 270 publications we survey 1) template
matching-based object detection methods, 2) knowledge-based object detection
methods, 3) object-based image analysis (OBIA)-based object detection methods,
4) machine learning-based object detection methods, and 5) five publicly
available datasets and three standard evaluation metrics. We also discuss the
challenges of current studies and propose two promising research directions,
namely deep learning-based feature representation and weakly supervised
learning-based geospatial object detection. It is our hope that this survey
will be beneficial for the researchers to have better understanding of this
research field.
","[{'version': 'v1', 'created': 'Sun, 20 Mar 2016 11:09:30 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Mar 2016 03:13:29 GMT'}]",2016-04-05,"[['Cheng', 'Gong', ''], ['Han', 'Junwei', '']]","['Object detection', 'optical remote sensing images', 'template matching', 'object-based image analysis']"
3817,1405.3094,Olfa Boubaker,Olfa Boubaker,"The inverted Pendulum: A fundamental Benchmark in Control Theory and
  Robotics","IEEE International Conference on Education and e-Learning Innovations
  (ICEELI), 1-3 July 2012, Sousse, Tunisia",,10.1109/ICEELI.2012.6360606,,cs.RO cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For at least fifty years, the inverted pendulum has been the most popular
benchmark, among others, for teaching and researches in control theory and
robotics. This paper presents the key motivations for the use of that system
and explains, in details, the main reflections on how the inverted pendulum
benchmark gives an effective and efficient application. Several real
experiences, virtual models and web-based remote control laboratories will be
presented with emphasis on the practical design implementation of this system.
A bibliographical survey of different design control approaches and trendy
robotic problems will be presented through applications to the inverted
pendulum system. In total, 150 references in the open literature, dating back
to 1960, are compiled to provide an overall picture of historical, current and
challenging developments.
","[{'version': 'v1', 'created': 'Tue, 13 May 2014 10:38:02 GMT'}]",2014-05-14,"[['Boubaker', 'Olfa', '']]","['Inverted pendulum', 'Control theory', 'Robotics']"
3818,1807.01439,Sarathkumar Rangarajan,Sarathkumar Rangarajan,Qos-Based Web Service Discovery And Selection Using Machine Learning,"8 Pages, 3 Figures","Rangarajan, S. (2018) Qos-based web service discovery and
  selection using machine learning. EAI Endorsed Transactions on Scalable
  Information Systems 18. doi:10.4108/eai.29-5-2018.154809",10.4108/eai.29-5-2018.154809,,cs.CY cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In service computing, the same target functions can be achieved by multiple
Web services from different providers. Due to the functional similarities, the
client needs to consider the non-functional criteria. However, Quality of
Service provided by the developer suffers from scarcity and lack of
reliability. In addition, the reputation of the service providers is an
important factor, especially those with little experience, to select a service.
Most of the previous studies were focused on the user's feedbacks for
justifying the selection. Unfortunately, not all the users provide the feedback
unless they had extremely good or bad experience with the service. In this
vision paper, we propose a novel architecture for the web service discovery and
selection. The core component is a machine learning based methodology to
predict the QoS properties using source code metrics. The credibility value and
previous usage count are used to determine the reputation of the service.
","[{'version': 'v1', 'created': 'Wed, 4 Jul 2018 03:39:10 GMT'}]",2018-07-05,"[['Rangarajan', 'Sarathkumar', '']]","['Web Service', 'WSDL', 'QoS prediction', 'Machine learning', 'Service Provider reputation']"
3819,1903.03518,Ian McQuillan,"Joey Eremondi, Oscar H. Ibarra, Ian McQuillan",Insertion Operations on Deterministic Reversal-Bounded Counter Machines,,,10.1016/j.jcss.2018.02.003,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several insertion operations are studied applied to languages accepted by
one-way and two-way deterministic reversal-bounded multicounter machines. These
operations are defined by the ideals obtained from relations such as the
prefix, infix, suffix, and outfix relations, as well as operations defined from
inverses of a type of deterministic transducer with reversal-bounded counters
attached. The question of whether the resulting languages can always be
accepted by deterministic machines with the same number (or larger number) of
input-turns (resp., counters, counter-reversals, etc.) is investigated.
","[{'version': 'v1', 'created': 'Fri, 8 Mar 2019 15:46:04 GMT'}]",2019-03-11,"[['Eremondi', 'Joey', ''], ['Ibarra', 'Oscar H.', ''], ['McQuillan', 'Ian', '']]","['Automata and Logic', 'Counter Machines', 'Insertion Operations', 'Reversal-Bounds', 'Determinism', 'Finite']"
3820,1809.08888,Anca Dumitrache,"Anca Dumitrache, Oana Inel, Benjamin Timmermans, Carlos Ortiz,
  Robert-Jan Sips, Lora Aroyo, Chris Welty",Empirical Methodology for Crowdsourcing Ground Truth,in publication at the Semantic Web Journal,,10.3233/SW-200415,,cs.HC,http://creativecommons.org/licenses/by-sa/4.0/,"  The process of gathering ground truth data through human annotation is a
major bottleneck in the use of information extraction methods for populating
the Semantic Web. Crowdsourcing-based approaches are gaining popularity in the
attempt to solve the issues related to volume of data and lack of annotators.
Typically these practices use inter-annotator agreement as a measure of
quality. However, in many domains, such as event detection, there is ambiguity
in the data, as well as a multitude of perspectives of the information
examples. We present an empirically derived methodology for efficiently
gathering of ground truth data in a diverse set of use cases covering a variety
of domains and annotation tasks. Central to our approach is the use of
CrowdTruth metrics that capture inter-annotator disagreement. We show that
measuring disagreement is essential for acquiring a high quality ground truth.
We achieve this by comparing the quality of the data aggregated with CrowdTruth
metrics with majority vote, over a set of diverse crowdsourcing tasks: Medical
Relation Extraction, Twitter Event Identification, News Event Extraction and
Sound Interpretation. We also show that an increased number of crowd workers
leads to growth and stabilization in the quality of annotations, going against
the usual practice of employing a small number of annotators.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2018 13:04:56 GMT'}]",2022-09-21,"[['Dumitrache', 'Anca', ''], ['Inel', 'Oana', ''], ['Timmermans', 'Benjamin', ''], ['Ortiz', 'Carlos', ''], ['Sips', 'Robert-Jan', ''], ['Aroyo', 'Lora', ''], ['Welty', 'Chris', '']]","['CrowdTruth', 'ground truth gathering', 'annotator disagreement', 'semantic interpretation', 'medical', 'event extraction', 'relation extraction']"
3821,1002.4014,Ciro Russo,"Salvatore Rampone, Ciro Russo",A fuzzified BRAIN algorithm for learning DNF from incomplete data,,"Electronic Journal of Applied Statistical Analysis, Vol. 5, Issue
  2, 256-270, 2012",10.1285/i20705948v5n2p256,,cs.IT cs.AI math.IT math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aim of this paper is to address the problem of learning Boolean functions
from training data with missing values. We present an extension of the BRAIN
algorithm, called U-BRAIN (Uncertainty-managing Batch Relevance-based
Artificial INtelligence), conceived for learning DNF Boolean formulas from
partial truth tables, possibly with uncertain values or missing bits.
  Such an algorithm is obtained from BRAIN by introducing fuzzy sets in order
to manage uncertainty. In the case where no missing bits are present, the
algorithm reduces to the original BRAIN.
","[{'version': 'v1', 'created': 'Sun, 21 Feb 2010 20:40:50 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Aug 2010 17:31:53 GMT'}, {'version': 'v3', 'created': 'Thu, 16 Jun 2011 13:39:12 GMT'}]",2015-08-31,"[['Rampone', 'Salvatore', ''], ['Russo', 'Ciro', '']]","['Boolean function', 'DNF', 'Learning algorithm', 'Missing Values']"
3822,1007.4864,Martin Macko,"Martin Macko, Kate Larson, \v{L}ubo\v{s} Steskal",Braess's Paradox for Flows Over Time,"19 pages, 6 figures, an extended version of paper accepted for SAGT
  2010",,10.1007/978-3-642-16170-4_23,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the properties of Braess's paradox in the context of the model of
congestion games with flow over time introduced by Koch and Skutella. We
compare them to the well known properties of Braess's paradox for Wardrop's
model of games with static flows. We show that there are networks which do not
admit Braess's paradox in Wardrop's model, but which admit it in the model with
flow over time. Moreover, there is a topology that admits a much more severe
Braess's ratio for this model. Further, despite its symmetry for games with
static flow, we show that Braess's paradox is not symmetric for flows over
time. We illustrate that there are network topologies which exhibit Braess's
paradox, but for which the transpose does not. Finally, we conjecture a
necessary and sufficient condition of existence of Braess's paradox in a
network, and prove the condition of existence of the paradox either in the
network or in its transpose.
","[{'version': 'v1', 'created': 'Wed, 28 Jul 2010 03:11:56 GMT'}]",2015-05-19,"[['Macko', 'Martin', ''], ['Larson', 'Kate', ''], ['Steskal', 'Ľuboš', '']]","['Flows over time', 'Braess’s paradox', 'Dynamic flows', 'Selfish routing', 'Congestiongames']"
3823,1905.02361,Xiang Zhang,"Xiang Zhang, Lina Yao, Feng Yuan",Adversarial Variational Embedding for Robust Semi-supervised Learning,"9 pages, Accepted by Research Track in KDD 2019",,10.1145/3292500.3330966,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semi-supervised learning is sought for leveraging the unlabelled data when
labelled data is difficult or expensive to acquire. Deep generative models
(e.g., Variational Autoencoder (VAE)) and semisupervised Generative Adversarial
Networks (GANs) have recently shown promising performance in semi-supervised
classification for the excellent discriminative representing ability. However,
the latent code learned by the traditional VAE is not exclusive (repeatable)
for a specific input sample, which prevents it from excellent classification
performance. In particular, the learned latent representation depends on a
non-exclusive component which is stochastically sampled from the prior
distribution. Moreover, the semi-supervised GAN models generate data from
pre-defined distribution (e.g., Gaussian noises) which is independent of the
input data distribution and may obstruct the convergence and is difficult to
control the distribution of the generated data. To address the aforementioned
issues, we propose a novel Adversarial Variational Embedding (AVAE) framework
for robust and effective semi-supervised learning to leverage both the
advantage of GAN as a high quality generative model and VAE as a posterior
distribution learner. The proposed approach first produces an exclusive latent
code by the model which we call VAE++, and meanwhile, provides a meaningful
prior distribution for the generator of GAN. The proposed approach is evaluated
over four different real-world applications and we show that our method
outperforms the state-of-the-art models, which confirms that the combination of
VAE++ and GAN can provide significant improvements in semisupervised
classification.
","[{'version': 'v1', 'created': 'Tue, 7 May 2019 05:47:01 GMT'}, {'version': 'v2', 'created': 'Wed, 8 May 2019 02:47:48 GMT'}]",2019-05-09,"[['Zhang', 'Xiang', ''], ['Yao', 'Lina', ''], ['Yuan', 'Feng', '']]","['Variational Autoencoder', 'Generative Adversarial Networks', 'Representation Learning', 'Semi-supervised Classification']"
3824,1211.2194,Khalid Raza,Khalid Raza and Akhilesh Mishra,"A Novel Anticlustering Filtering Algorithm for the Prediction of Genes
  as a Drug Target","6 pages, 2 figures and 1 table","American Journal of Biomedical Engineering 2012, 2(5):206-211",10.5923/j.ajbe.20120205.03,,cs.CE q-bio.GN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The high-throughput data generated by microarray experiments provides
complete set of genes being expressed in a given cell or in an organism under
particular conditions. The analysis of these enormous data has opened a new
dimension for the researchers. In this paper we describe a novel algorithm to
microarray data analysis focusing on the identification of genes that are
differentially expressed in particular internal or external conditions and
which could be potential drug targets. The algorithm uses the time-series gene
expression data as an input and recognizes genes which are expressed
differentially. This algorithm implements standard statistics-based gene
functional investigations, such as the log transformation, mean, log-sigmoid
function, coefficient of variations, etc. It does not use clustering analysis.
The proposed algorithm has been implemented in Perl. The time-series gene
expression data on yeast Saccharomyces cerevisiae from the Stanford Microarray
Database (SMD)consisting of 6154 genes have been taken for the validation of
the algorithm. The developed method extracted 48 genes out of total 6154 genes.
These genes are mostly responsible for the yeast's resistants at a high
temperature.
","[{'version': 'v1', 'created': 'Fri, 9 Nov 2012 17:41:16 GMT'}]",2012-11-12,"[['Raza', 'Khalid', ''], ['Mishra', 'Akhilesh', '']]","['Microarray Data Analysis', 'Gene Expression', 'Differentially Expressed Genes', 'Drug Target']"
3825,1701.02189,Simon Kramer,Simon Kramer,A Modularity Bug in Java 8,,"Theoretical and Applied Informatics, Volume 28, Issue 3, 2016",10.20904/283001,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We demonstrate a modularity bug in the interface system of Java 8 on the
practical example of a textbook design of a modular interface for vector
spaces. Our example originates in our teaching of modular object-oriented
design in Java 8 to undergraduate students, simply following standard
programming practices and mathematical definitions. The bug shows up as a
compilation error and should be fixed with a language extension due to the
importance of best practices (design fidelity).
","[{'version': 'v1', 'created': 'Mon, 2 Jan 2017 06:53:48 GMT'}]",2017-05-02,"[['Kramer', 'Simon', '']]","['component-based software construction', 'interface specifications', 'object-oriented programming', 'programming-language pragmatics']"
3826,0909.2234,Jayakrishnan Unnikrishnan,"Jayakrishnan Unnikrishnan, Dayu Huang, Sean Meyn, Amit Surana and
  Venugopal Veeravalli",Universal and Composite Hypothesis Testing via Mismatched Divergence,"Accepted to IEEE Transactions on Information Theory, July 2010",,10.1109/TIT.2011.2104670,,cs.IT cs.LG math.IT math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For the universal hypothesis testing problem, where the goal is to decide
between the known null hypothesis distribution and some other unknown
distribution, Hoeffding proposed a universal test in the nineteen sixties.
Hoeffding's universal test statistic can be written in terms of
Kullback-Leibler (K-L) divergence between the empirical distribution of the
observations and the null hypothesis distribution. In this paper a modification
of Hoeffding's test is considered based on a relaxation of the K-L divergence
test statistic, referred to as the mismatched divergence. The resulting
mismatched test is shown to be a generalized likelihood-ratio test (GLRT) for
the case where the alternate distribution lies in a parametric family of the
distributions characterized by a finite dimensional parameter, i.e., it is a
solution to the corresponding composite hypothesis testing problem. For certain
choices of the alternate distribution, it is shown that both the Hoeffding test
and the mismatched test have the same asymptotic performance in terms of error
exponents. A consequence of this result is that the GLRT is optimal in
differentiating a particular distribution from others in an exponential family.
It is also shown that the mismatched test has a significant advantage over the
Hoeffding test in terms of finite sample size performance. This advantage is
due to the difference in the asymptotic variances of the two test statistics
under the null hypothesis. In particular, the variance of the K-L divergence
grows linearly with the alphabet size, making the test impractical for
applications involving large alphabet distributions. The variance of the
mismatched divergence on the other hand grows linearly with the dimension of
the parameter space, and can hence be controlled through a prudent choice of
the function class defining the mismatched divergence.
","[{'version': 'v1', 'created': 'Fri, 11 Sep 2009 18:35:52 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Apr 2010 16:49:01 GMT'}, {'version': 'v3', 'created': 'Thu, 9 Sep 2010 06:56:44 GMT'}]",2016-11-15,"[['Unnikrishnan', 'Jayakrishnan', ''], ['Huang', 'Dayu', ''], ['Meyn', 'Sean', ''], ['Surana', 'Amit', ''], ['Veeravalli', 'Venugopal', '']]","['Generalized Likelihood-Ratio Test', 'Hypothesis testing', 'Kullback–Leibler information', 'Online']"
3827,1509.05592,Changsoo Je,"Kwang Hee Lee, Changsoo Je, Sang Wook Lee",Color-Stripe Structured Light Robust to Surface Color and Discontinuity,"10 pages, 9 figures, 8th Asian Conference on Computer Vision (ACCV),
  Tokyo, Japan, November 2007, Proceedings, Part II","Computer Vision - ACCV 2007, LNCS 4844, pp. 507-516, Springer
  Berlin Heidelberg, November 14, 2007",10.1007/978-3-540-76390-1_50,,cs.CV cs.GR physics.optics,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multiple color stripes have been employed for structured light-based rapid
range imaging to increase the number of uniquely identifiable stripes. The use
of multiple color stripes poses two problems: (1) object surface color may
disturb the stripe color and (2) the number of adjacent stripes required for
identifying a stripe may not be maintained near surface discontinuities such as
occluding boundaries. In this paper, we present methods to alleviate those
problems. Log-gradient filters are employed to reduce the influence of object
colors, and color stripes in two and three directions are used to increase the
chance of identifying correct stripes near surface discontinuities.
Experimental results demonstrate the effectiveness of our methods.
","[{'version': 'v1', 'created': 'Fri, 18 Sep 2015 11:26:19 GMT'}]",2015-09-21,"[['Lee', 'Kwang Hee', ''], ['Je', 'Changsoo', ''], ['Lee', 'Sang Wook', '']]","['Structured light', 'color stripes', 'range imaging', 'active vision', 'surface color', 'surface discontinuity', 'projector-camera system', '3D modeling']"
3828,1705.08684,Andrea Tassi,"Ioannis Mavromatis, Andrea Tassi, Robert J. Piechocki, Andrew Nix",MmWave System for Future ITS: A MAC-layer Approach for V2X Beam Steering,Accepted for publication in IEEE VTC Fall 2017 conference proceedings,,10.1109/VTCFall.2017.8288267,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Millimeter Waves (mmWave) systems have the potential of enabling
multi-gigabit-per-second communications in future Intelligent Transportation
Systems (ITSs). Unfortunately, because of the increased vehicular mobility,
they require frequent antenna beam realignments - thus significantly increasing
the in-band Beamforming (BF) overhead. In this paper, we propose Smart
Motion-prediction Beam Alignment (SAMBA), a MAC-layer algorithm that exploits
the information broadcast via DSRC beacons by all vehicles. Based on this
information, overhead-free BF is achieved by estimating the position of the
vehicle and predicting its motion. Moreover, adapting the beamwidth with
respect to the estimated position can further enhance the performance. Our
investigation shows that SAMBA outperforms the IEEE 802.11ad BF strategy,
increasing the data rate by more than twice for sparse vehicle density while
enhancing the network throughput proportionally to the number of vehicles.
Furthermore, SAMBA was proven to be more efficient compared to legacy BF
algorithm under highly dynamic vehicular environments and hence, a viable
solution for future ITS services.
","[{'version': 'v1', 'created': 'Wed, 24 May 2017 10:13:49 GMT'}]",2022-09-05,"[['Mavromatis', 'Ioannis', ''], ['Tassi', 'Andrea', ''], ['Piechocki', 'Robert J.', ''], ['Nix', 'Andrew', '']]","['ConnectedAutonomousVehicles', 'mmWave', 'Beamforming', 'Heterogeneity', 'MAC layer', 'Vehicle-to-EverythingCommunications']"
3829,2009.00611,Krutarth Patel,"Krutarth Patel, Cornelia Caragea, Mark Phillips, Nathaniel Fox",Identifying Documents In-Scope of a Collection from Web Archives,10 pages,"In Proceedings of the ACM/IEEE Joint Conference on Digital
  Libraries in 2020 (JCDL 2020)",10.1145/3383583.3398540,,cs.IR cs.CL cs.DL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web archive data usually contains high-quality documents that are very useful
for creating specialized collections of documents, e.g., scientific digital
libraries and repositories of technical reports. In doing so, there is a
substantial need for automatic approaches that can distinguish the documents of
interest for a collection out of the huge number of documents collected by web
archiving institutions. In this paper, we explore different learning models and
feature representations to determine the best performing ones for identifying
the documents of interest from the web archived data. Specifically, we study
both machine learning and deep learning models and ""bag of words"" (BoW)
features extracted from the entire document or from specific portions of the
document, as well as structural features that capture the structure of
documents. We focus our evaluation on three datasets that we created from three
different Web archives. Our experimental results show that the BoW classifiers
that focus only on specific portions of the documents (rather than the full
text) outperform all compared methods on all three datasets.
","[{'version': 'v1', 'created': 'Wed, 2 Sep 2020 16:22:23 GMT'}]",2020-09-03,"[['Patel', 'Krutarth', ''], ['Caragea', 'Cornelia', ''], ['Phillips', 'Mark', ''], ['Fox', 'Nathaniel', '']]","['Text classification', 'Web archiving', 'Digital libraries']"
3830,1305.2876,Ricardo Fabbri,"Ricardo Fabbri, Ivan N. Bastos, Francisco D. Moura Neto, Francisco J.
  P. Lopes, Wesley N. Goncalves, Odemir M. Bruno",Multi-q Pattern Classification of Polarization Curves,"12 pages, 7 figures",,10.1016/j.physa.2013.09.048,,cs.CE cs.CV,http://creativecommons.org/licenses/by/3.0/,"  Several experimental measurements are expressed in the form of
one-dimensional profiles, for which there is a scarcity of methodologies able
to classify the pertinence of a given result to a specific group. The
polarization curves that evaluate the corrosion kinetics of electrodes in
corrosive media are an application where the behavior is chiefly analyzed from
profiles. Polarization curves are indeed a classic method to determine the
global kinetics of metallic electrodes, but the strong nonlinearity from
different metals and alloys can overlap and the discrimination becomes a
challenging problem. Moreover, even finding a typical curve from replicated
tests requires subjective judgement. In this paper we used the so-called
multi-q approach based on the Tsallis statistics in a classification engine to
separate multiple polarization curve profiles of two stainless steels. We
collected 48 experimental polarization curves in aqueous chloride medium of two
stainless steel types, with different resistance against localized corrosion.
Multi-q pattern analysis was then carried out on a wide potential range, from
cathodic up to anodic regions. An excellent classification rate was obtained,
at a success rate of 90%, 80%, and 83% for low (cathodic), high (anodic), and
both potential ranges, respectively, using only 2% of the original profile
data. These results show the potential of the proposed approach towards
efficient, robust, systematic and automatic classification of highly non-linear
profile curves.
","[{'version': 'v1', 'created': 'Fri, 10 May 2013 04:31:49 GMT'}]",2015-06-15,"[['Fabbri', 'Ricardo', ''], ['Bastos', 'Ivan N.', ''], ['Neto', 'Francisco D. Moura', ''], ['Lopes', 'Francisco J. P.', ''], ['Goncalves', 'Wesley N.', ''], ['Bruno', 'Odemir M.', '']]","['profile pattern classification', 'polarization curve', 'Tsallis entropy', 'multi-q pattern analysis']"
3831,1803.04211,B\'erenger Bramas,B\'erenger Bramas,"Increasing the Degree of Parallelism Using Speculative Execution in
  Task-based Runtime Systems","24 pages, https://peerj.com/articles/cs-183/",PeerJ Computer Science 5:e183 2019,10.7717/peerj-cs.183,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Task-based programming models have demonstrated their efficiency in the
development of scientific applications on modern high-performance platforms.
They allow delegation of the management of parallelization to the runtime
system (RS), which is in charge of the data coherency, the scheduling, and the
assignment of the work to the computational units. However, some applications
have a limited degree of parallelism such that no matter how efficient the RS
implementation, they may not scale on modern multicore CPUs. In this paper, we
propose using speculation to unleash the parallelism when it is uncertain if
some tasks will modify data, and we formalize a new methodology to enable
speculative execution in a graph of tasks. This description is partially
implemented in our new C++ RS called SPETABARU, which is capable of executing
tasks in advance if some others are not certain to modify the data. We study
the behavior of our approach to compute Monte Carlo and replica exchange Monte
Carlo simulations.
","[{'version': 'v1', 'created': 'Mon, 12 Mar 2018 11:59:19 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Mar 2019 08:00:05 GMT'}]",2019-03-20,"[['Bramas', 'Bérenger', '']]","['STF', 'Monte-Carlo', 'Speculation', 'Task-based']"
3832,1710.01842,Oren Lederman,"Oren Lederman, Dan Calacci, Angus MacMullen, Daniel C. Fehder, Fiona
  E.Murray, Alex 'Sandy' Pentland","Open Badges: A Low-Cost Toolkit for Measuring Team Communication and
  Dynamics",,"Lederman, O., Calacci, D., MacMullen, A., Fehder, D. C., Murray,
  F., & Pentland, A. S. (2016). Open badges: A low-cost toolkit for measuring
  team communication and dynamics. In Social, Cultural, and Behavioral Modeling",,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present Open Badges, an open-source framework an toolkit for measuring and
shaping face-to-face social interactions using either custom hardware devices
or smart phones, and real-time web-based visualizations. Open Badges is a
modular system that allows researchers to monitor and collect interaction data
from people engaged in real-life social settings. In this paper we describe the
technical aspects of the Open Badges project and the motivation for its
creation.
","[{'version': 'v1', 'created': 'Thu, 5 Oct 2017 00:58:19 GMT'}]",2017-10-06,"[['Lederman', 'Oren', ''], ['Calacci', 'Dan', ''], ['MacMullen', 'Angus', ''], ['Fehder', 'Daniel C.', ''], ['Murray', 'Fiona E.', ''], ['Pentland', ""Alex 'Sandy'"", '']]","['group interaction', 'communication', 'team performance', 'wearable computing', 'sociometric badges']"
3833,1203.0440,Pierre de Leusse,Pierre de Leusse and Theo Dimitrakos,SOA-based security governance middleware,,"SECURWARE 2010: the fourth international conference on Emerging
  security information, systems and technologies : 18-25 July 2010, Venice,
  Italy, eds. Reijo Savola et al., IEEE, 2010, ISBN-13 978- 0-7695-4095-5",10.1109/SECURWARE.2010.17,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Business requirements for rapid operational efficiency, customer
responsiveness as well as rapid adaptability are actively driving the need for
ever increasing communication and integration apabilities of software assets.
In this context, security, although acknowledged as being a necessity, is often
perceived as a hindrance. Indeed, dynamic environments require flexible and
understandable security that can be customized, adapted and reconfigured
dynamically to face changing requirements. In this paper, the authors propose
SOA based security governance middleware that handles security requirements on
behalf of a resource exposed through it. The middleware aims at providing
different security settings through the use of managed compositions of security
services called profiles. The main added value of this work compared to
existing handlers or centralized approaches lies in its enhanced flexibility
and transparency.
","[{'version': 'v1', 'created': 'Fri, 2 Mar 2012 12:17:54 GMT'}]",2012-03-05,"[['de Leusse', 'Pierre', ''], ['Dimitrakos', 'Theo', '']]","['SOA', 'SOA governance', 'SOA security', 'SOA']"
3834,1812.11339,Nieto Gregoire,"Gr\'egoire Nieto (LJK), Fr\'ed\'eric Devernay (PRIMA), James Crowley
  (PERVASIVE)",Rendu bas\'e image avec contraintes sur les gradients,"in French. Traitement du Signal, Lavoisier, A para\^itre",,10.3166/HSP.x.1-26,,cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-view image-based rendering consists in generating a novel view of a
scene from a set of source views. In general, this works by first doing a
coarse 3D reconstruction of the scene, and then using this reconstruction to
establish correspondences between source and target views, followed by blending
the warped views to get the final image. Unfortunately, discontinuities in the
blending weights, due to scene geometry or camera placement, result in
artifacts in the target view. In this paper, we show how to avoid these
artifacts by imposing additional constraints on the image gradients of the
novel view. We propose a variational framework in which an energy functional is
derived and optimized by iteratively solving a linear system. We demonstrate
this method on several structured and unstructured multi-view datasets, and
show that it numerically outperforms state-of-the-art methods, and eliminates
artifacts that result from visibility discontinuities
","[{'version': 'v1', 'created': 'Sat, 29 Dec 2018 11:16:39 GMT'}]",2019-01-01,"[['Nieto', 'Grégoire', '', 'LJK'], ['Devernay', 'Frédéric', '', 'PRIMA'], ['Crowley', 'James', '', 'PERVASIVE']]","['Image-Based Rendering', '3D Reconstruction', 'Computational Photography']"
3835,1907.11354,EPTCS,"Paul Tarau, Jan Wielemaker, Tom Schrijvers",Lazy Stream Programming in Prolog,"In Proceedings ICLP 2019, arXiv:1909.07646","EPTCS 306, 2019, pp. 224-237",10.4204/EPTCS.306.26,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, stream processing has become a prominent approach for
incrementally handling large amounts of data, with special support and
libraries in many programming languages. Unfortunately, support in Prolog has
so far been lacking and most existing approaches are ad-hoc. To remedy this
situation, we present lazy stream generators as a unified Prolog interface for
stateful computations on both finite and infinite sequences of data that are
produced incrementally through I/O and/or algorithmically.
  We expose stream generators to the application programmer in two ways: 1)
through an abstract sequence manipulation API, convenient for defining custom
generators, and 2) as idiomatic lazy lists, compatible with many existing list
predicates. We define an algebra of stream generator operations that extends
Prolog via an embedded language interpreter, provides a compact notation for
composing generators and supports moving between the two isomorphic
representations.
  As a special instance, we introduce answer stream generators that encapsulate
the work of coroutining first-class logic engines and support interoperation
between forward recursive AND-streams and backtracking-generated OR-streams.
  Keywords: lazy stream generators, lazy lists, first-class logic engines,
stream combinators, AND-stream / OR-stream interoperation, Prolog extensions
","[{'version': 'v1', 'created': 'Fri, 26 Jul 2019 01:24:45 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Sep 2019 13:31:37 GMT'}]",2019-09-20,"[['Tarau', 'Paul', ''], ['Wielemaker', 'Jan', ''], ['Schrijvers', 'Tom', '']]","['lazy stream generators', 'lazy lists', 'first-class logic engines', 'stream combinators', 'AND-stream / OR-stream interoperation', 'Prolog extensions']"
3836,1901.05344,Georg Hager,"Francesco Cremonesi, Georg Hager, Gerhard Wellein, Felix Sch\""urmann","Analytic Performance Modeling and Analysis of Detailed Neuron
  Simulations","18 pages, 6 figures, 15 tables",,10.1177/1094342020912528,,cs.PF cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Big science initiatives are trying to reconstruct and model the brain by
attempting to simulate brain tissue at larger scales and with increasingly more
biological detail than previously thought possible. The exponential growth of
parallel computer performance has been supporting these developments, and at
the same time maintainers of neuroscientific simulation code have strived to
optimally and efficiently exploit new hardware features. Current state of the
art software for the simulation of biological networks has so far been
developed using performance engineering practices, but a thorough analysis and
modeling of the computational and performance characteristics, especially in
the case of morphologically detailed neuron simulations, is lacking. Other
computational sciences have successfully used analytic performance engineering
and modeling methods to gain insight on the computational properties of
simulation kernels, aid developers in performance optimizations and eventually
drive co-design efforts, but to our knowledge a model-based performance
analysis of neuron simulations has not yet been conducted.
  We present a detailed study of the shared-memory performance of
morphologically detailed neuron simulations based on the Execution-Cache-Memory
(ECM) performance model. We demonstrate that this model can deliver accurate
predictions of the runtime of almost all the kernels that constitute the neuron
models under investigation. The gained insight is used to identify the main
governing mechanisms underlying performance bottlenecks in the simulation. The
implications of this analysis on the optimization of neural simulation software
and eventually co-design of future hardware architectures are discussed. In
this sense, our work represents a valuable conceptual and quantitative
contribution to understanding the performance properties of biological networks
simulations.
","[{'version': 'v1', 'created': 'Wed, 16 Jan 2019 15:28:06 GMT'}]",2020-06-25,"[['Cremonesi', 'Francesco', ''], ['Hager', 'Georg', ''], ['Wellein', 'Gerhard', ''], ['Schürmann', 'Felix', '']]","['Analytic performance modeling', 'execution-cache-memory model', 'biological neural networks', 'morphologically detailedneuron models']"
3837,1606.07502,Biljana Risteska Stojkoska Dr,"Biljana Stojkoska, Ilinka Ivanoska and Danco Davcev","Wireless Sensor Networks Localization Methods: Multidimensional Scaling
  vs. Semidefinite Programming Approach",12 pages,"ICT Innovations 2009, Ohrid, Macedonia, pp.145-155, Print ISBN
  978-3-642-10780-1, Online ISBN 978-3-642-10781-8",10.1007/978-3-642-10781-8_16,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the recent development of technology, wireless sensor networks are
becoming an important part of many applications such as health and medical
applications, military applications, agriculture monitoring, home and office
applications, environmental monitoring, etc. Knowing the location of a sensor
is important, but GPS receivers and ophisticated sensors are too expensive and
require processing power. Therefore, the localization wireless sensor network
problem is a growing field of interest. The aim of this paper is to give a
comparison of wireless sensor network localization methods, and therefore,
multidimensional scaling and semidefinite programming are chosen for this
research. Multidimensional scaling is a simple mathematical technique
widely-discussed that solves the wireless sensor networks localization problem.
In contrast, semidefinite programming is a relatively new field of optimization
with a growing use, although being more complex. In this paper, using extensive
simulations, a detailed overview of these two approaches is given, regarding
different network topologies, various network parameters and performance
issues. The performances of both techniques are highly satisfactory and
estimation errors are minimal
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2016 22:46:52 GMT'}]",2016-06-27,"[['Stojkoska', 'Biljana', ''], ['Ivanoska', 'Ilinka', ''], ['Davcev', 'Danco', '']]","['Wireless Sensor Networks', 'Semidefinite programming', 'multidimensional scaling', 'localization techniques']"
3838,1808.10785,Matthew Roddy,"Matthew Roddy, Gabriel Skantze, Naomi Harte",Multimodal Continuous Turn-Taking Prediction Using Multiscale RNNs,Accepted for ICMI18,,10.1145/3242969.3242997,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In human conversational interactions, turn-taking exchanges can be
coordinated using cues from multiple modalities. To design spoken dialog
systems that can conduct fluid interactions it is desirable to incorporate cues
from separate modalities into turn-taking models. We propose that there is an
appropriate temporal granularity at which modalities should be modeled. We
design a multiscale RNN architecture to model modalities at separate timescales
in a continuous manner. Our results show that modeling linguistic and acoustic
features at separate temporal rates can be beneficial for turn-taking modeling.
We also show that our approach can be used to incorporate gaze features into
turn-taking models.
","[{'version': 'v1', 'created': 'Fri, 31 Aug 2018 14:38:50 GMT'}]",2018-09-03,"[['Roddy', 'Matthew', ''], ['Skantze', 'Gabriel', ''], ['Harte', 'Naomi', '']]","['Turn-Taking', 'Spoken-Dialog Systems', 'Neural Networks']"
3839,1905.05006,Wenjie Hu,"Wenjie Hu, Yang Yang, Ziqiang Cheng, Carl Yang and Xiang Ren",Time-Series Event Prediction with Evolutionary State Graph,A long version of EvoNet (WSDM 2021),"Proceedings of the Fourteenth ACM International Conference on Web
  Search and Data Mining, 2021",,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The accurate and interpretable prediction of future events in time-series
data often requires the capturing of representative patterns (or referred to as
states) underpinning the observed data. To this end, most existing studies
focus on the representation and recognition of states, but ignore the changing
transitional relations among them. In this paper, we present evolutionary state
graph, a dynamic graph structure designed to systematically represent the
evolving relations (edges) among states (nodes) along time. We conduct analysis
on the dynamic graphs constructed from the time-series data and show that
changes on the graph structures (e.g., edges connecting certain state nodes)
can inform the occurrences of events (i.e., time-series fluctuation). Inspired
by this, we propose a novel graph neural network model, Evolutionary State
Graph Network (EvoNet), to encode the evolutionary state graph for accurate and
interpretable time-series event prediction. Specifically, Evolutionary State
Graph Network models both the node-level (state-to-state) and graph-level
(segment-to-segment) propagation, and captures the node-graph
(state-to-segment) interactions over time. Experimental results based on five
real-world datasets show that our approach not only achieves clear improvements
compared with 11 baselines, but also provides more insights towards explaining
the results of event predictions.
","[{'version': 'v1', 'created': 'Fri, 10 May 2019 07:11:17 GMT'}, {'version': 'v2', 'created': 'Mon, 20 May 2019 09:10:33 GMT'}, {'version': 'v3', 'created': 'Tue, 18 Aug 2020 04:41:46 GMT'}, {'version': 'v4', 'created': 'Wed, 25 Nov 2020 08:04:26 GMT'}]",2020-11-26,"[['Hu', 'Wenjie', ''], ['Yang', 'Yang', ''], ['Cheng', 'Ziqiang', ''], ['Yang', 'Carl', ''], ['Ren', 'Xiang', '']]","['Time series prediction', 'evolutionary state graph', 'graph networks']"
3840,1511.06815,Ju Shen Dr.,"Xinzhong Lu, Ju Shen, Saverio Perugini, Jianjun Yang","An Immersive Telepresence System using RGB-D Sensors and Head Mounted
  Display",IEEE International Symposium on Multimedia 2015,,10.1109/ISM.2015.108,,cs.CV cs.HC cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a tele-immersive system that enables people to interact with each
other in a virtual world using body gestures in addition to verbal
communication. Beyond the obvious applications, including general online
conversations and gaming, we hypothesize that our proposed system would be
particularly beneficial to education by offering rich visual contents and
interactivity. One distinct feature is the integration of egocentric pose
recognition that allows participants to use their gestures to demonstrate and
manipulate virtual objects simultaneously. This functionality enables the
instructor to ef- fectively and efficiently explain and illustrate complex
concepts or sophisticated problems in an intuitive manner. The highly
interactive and flexible environment can capture and sustain more student
attention than the traditional classroom setting and, thus, delivers a
compelling experience to the students. Our main focus here is to investigate
possible solutions for the system design and implementation and devise
strategies for fast, efficient computation suitable for visual data processing
and network transmission. We describe the technique and experiments in details
and provide quantitative performance results, demonstrating our system can be
run comfortably and reliably for different application scenarios. Our
preliminary results are promising and demonstrate the potential for more
compelling directions in cyberlearning.
","[{'version': 'v1', 'created': 'Sat, 21 Nov 2015 01:57:47 GMT'}]",2016-11-17,"[['Lu', 'Xinzhong', ''], ['Shen', 'Ju', ''], ['Perugini', 'Saverio', ''], ['Yang', 'Jianjun', '']]","['Tele-immersive systems', 'video conferencing', 'RGBD systems', 'virtual reality', 'virtual environments', 'interactivemedia', 'head-mounted display (HMD)']"
3841,2105.06247,Hao Zhang,"Hao Zhang, Aixin Sun, Wei Jing, Guoshun Nan, Liangli Zhen, Joey Tianyi
  Zhou, Rick Siow Mong Goh",Video Corpus Moment Retrieval with Contrastive Learning,"11 pages, 7 figures and 6 tables. Accepted by SIGIR 2021",,10.1145/3404835.3462874,,cs.CL cs.CV cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a collection of untrimmed and unsegmented videos, video corpus moment
retrieval (VCMR) is to retrieve a temporal moment (i.e., a fraction of a video)
that semantically corresponds to a given text query. As video and text are from
two distinct feature spaces, there are two general approaches to address VCMR:
(i) to separately encode each modality representations, then align the two
modality representations for query processing, and (ii) to adopt fine-grained
cross-modal interaction to learn multi-modal representations for query
processing. While the second approach often leads to better retrieval accuracy,
the first approach is far more efficient. In this paper, we propose a Retrieval
and Localization Network with Contrastive Learning (ReLoCLNet) for VCMR. We
adopt the first approach and introduce two contrastive learning objectives to
refine video encoder and text encoder to learn video and text representations
separately but with better alignment for VCMR. The video contrastive learning
(VideoCL) is to maximize mutual information between query and candidate video
at video-level. The frame contrastive learning (FrameCL) aims to highlight the
moment region corresponds to the query at frame-level, within a video.
Experimental results show that, although ReLoCLNet encodes text and video
separately for efficiency, its retrieval accuracy is comparable with baselines
adopting cross-modal interaction learning.
","[{'version': 'v1', 'created': 'Thu, 13 May 2021 12:54:39 GMT'}]",2021-05-14,"[['Zhang', 'Hao', ''], ['Sun', 'Aixin', ''], ['Jing', 'Wei', ''], ['Nan', 'Guoshun', ''], ['Zhen', 'Liangli', ''], ['Zhou', 'Joey Tianyi', ''], ['Goh', 'Rick Siow Mong', '']]","['Moment Localization', 'Temporal Video Grounding', 'Video CorpusMoment Retrieval', 'Cross-modal Retrieval', 'Contrastive Learning']"
3842,cs/0605068,Bruno Salvy,"Alin Bostan (INRIA Rocquencourt), Fr\'ed\'eric Chyzak (INRIA
  Rocquencourt), Bruno Salvy (INRIA Rocquencourt), Thomas Cluzeau (INRIA Sophia
  Antipolis)",Low Complexity Algorithms for Linear Recurrences,"This is the author's version of the work. It is posted here by
  permission of ACM for your personal use. Not for redistribution","ISSAC'06, pages 31--38, ACM Press, 2006",10.1145/1145768.1145781,,cs.SC,,"  We consider two kinds of problems: the computation of polynomial and rational
solutions of linear recurrences with coefficients that are polynomials with
integer coefficients; indefinite and definite summation of sequences that are
hypergeometric over the rational numbers. The algorithms for these tasks all
involve as an intermediate quantity an integer $N$ (dispersion or root of an
indicial polynomial) that is potentially exponential in the bit size of their
input. Previous algorithms have a bit complexity that is at least quadratic in
$N$. We revisit them and propose variants that exploit the structure of
solutions and avoid expanding polynomials of degree $N$. We give two
algorithms: a probabilistic one that detects the existence or absence of
nonzero polynomial and rational solutions in $O(\sqrt{N}\log^{2}N)$ bit
operations; a deterministic one that computes a compact representation of the
solution in $O(N\log^{3}N)$ bit operations. Similar speed-ups are obtained in
indefinite and definite hypergeometric summation. We describe the results of an
implementation.
","[{'version': 'v1', 'created': 'Tue, 16 May 2006 10:03:04 GMT'}]",2008-04-03,"[['Bostan', 'Alin', '', 'INRIA Rocquencourt'], ['Chyzak', 'Frédéric', '', 'INRIA\n  Rocquencourt'], ['Salvy', 'Bruno', '', 'INRIA Rocquencourt'], ['Cluzeau', 'Thomas', '', 'INRIA Sophia\n  Antipolis']]","['Computer algebra', 'polynomial and rational solutions', 'linear recurrences', 'summation', 'creative telescoping', 'complexity']"
3843,2205.11941,Luigi Quaranta,Luigi Quaranta,"Assessing the Quality of Computational Notebooks for a Frictionless
  Transition from Exploration to Production",5 pages,"Proc. of 2022 IEEE/ACM 44th International Conference on Software
  Engineering Companion (ICSE 22 Companion), May 21-29, 2022, Pittsburgh, PA,
  USA",10.1145/3510454.3517055,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The massive trend of integrating data-driven AI capabilities into traditional
software systems is rising new intriguing challenges. One of such challenges is
achieving a smooth transition from the explorative phase of Machine Learning
projects - in which data scientists build prototypical models in the lab - to
their production phase - in which software engineers translate prototypes into
production-ready AI components. To narrow down the gap between these two
phases, tools and practices adopted by data scientists might be improved by
incorporating consolidated software engineering solutions. In particular,
computational notebooks have a prominent role in determining the quality of
data science prototypes. In my research project, I address this challenge by
studying the best practices for collaboration with computational notebooks and
proposing proof-of-concept tools to foster guidelines compliance.
","[{'version': 'v1', 'created': 'Tue, 24 May 2022 10:13:38 GMT'}]",2022-05-25,"[['Quaranta', 'Luigi', '']]","['Software Engineering', 'Artificial Intelligence', 'Data Science', 'MachineLearning', 'computational notebooks', 'static analysis tools', 'linters']"
3844,1905.03560,L\'eo Exibard,"L\'eo Exibard, Emmanuel Filiot, Isma\""el Jecker","The Complexity of Transducer Synthesis from Multi-Sequential
  Specifications",MFCS 2018,,10.4230/LIPIcs.MFCS.2018.46,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The transducer synthesis problem on finite words asks, given a specification
$S \subseteq I \times O$, where $I$ and $O$ are sets of finite words, whether
there exists an implementation $f: I \rightarrow O$ which (1) fulfils the
specification, i.e., $(i,f(i))\in S$ for all $i\in I$, and (2) can be defined
by some input-deterministic (aka sequential) transducer $\mathcal{T}_f$. If
such an implementation $f$ exists, the procedure should also output
$\mathcal{T}_f$. The realisability problem is the corresponding decision
problem.
  For specifications given by synchronous transducers (which read and write
alternately one symbol), this is the finite variant of the classical synthesis
problem on $\omega$-words, solved by B\""uchi and Landweber in 1969, and the
realisability problem is known to be ExpTime-c in both finite and $\omega$-word
settings. For specifications given by asynchronous transducers (which can write
a batch of symbols, or none, in a single step), the realisability problem is
known to be undecidable.
  We consider here the class of multi-sequential specifications, defined as
finite unions of sequential transducers over possibly incomparable domains. We
provide optimal decision procedures for the realisability problem in both the
synchronous and asynchronous setting, showing that it is PSpace-c. Moreover,
whenever the specification is realisable, we expose the construction of a
sequential transducer that realises it and has a size that is doubly
exponential, which we prove to be optimal.
","[{'version': 'v1', 'created': 'Thu, 9 May 2019 12:09:52 GMT'}]",2019-05-10,"[['Exibard', 'Léo', ''], ['Filiot', 'Emmanuel', ''], ['Jecker', 'Ismaël', '']]","['Transducers', 'Multi-Sequentiality', 'Synthesis']"
3845,1504.07350,Heri Ramampiaro,Massimiliano Ruocco and Heri Ramampiaro,Geo-Temporal Distribution of Tag Terms for Event-Related Image Retrieval,,"Information Processing & Management Journal (IPM), 51(1), pp.
  92-110. 2015",10.1016/j.ipm.2014.09.001,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Media sharing applications, such as Flickr and Panoramio, contain a large
amount of pictures related to real life events. For this reason, the
development of effective methods to retrieve these pictures is important, but
still a challenging task. Recognizing this importance, and to improve the
retrieval effectiveness of tag-based event retrieval systems, we propose a new
method to extract a set of geographical tag features from raw geo-spatial
profiles of user tags. The main idea is to use these features to select the
best expansion terms in a machine learning-based query expansion approach.
Specifically, we apply rigorous statistical exploratory analysis of spatial
point patterns to extract the geo-spatial features. We use the features both to
summarize the spatial characteristics of the spatial distribution of a single
term, and to determine the similarity between the spatial profiles of two terms
-- i.e., term-to-term spatial similarity. To further improve our approach, we
investigate the effect of combining our geo-spatial features with temporal
features on choosing the expansion terms. To evaluate our method, we perform
several experiments, including well-known feature analyses. Such analyses show
how much our proposed geo-spatial features contribute to improve the overall
retrieval performance. The results from our experiments demonstrate the
effectiveness and viability of our method.
","[{'version': 'v1', 'created': 'Tue, 28 Apr 2015 05:38:34 GMT'}]",2015-04-29,"[['Ruocco', 'Massimiliano', ''], ['Ramampiaro', 'Heri', '']]","['Information Retrieval', 'Spatial Profile', 'Tag Relatedness', 'QueryExpansion', 'Event Retrieval', 'Social Media Retrieval']"
3846,cs/0101035,Paul M. Aoki,"Allison Woodruff, Paul M. Aoki, Amy Hurst, Margaret H. Szymanski","The Guidebook, the Friend, and the Room: Visitor Experience in a
  Historic House",,"Extended Abstracts, ACM SIGCHI Conf. on Human Factors in Computing
  Systems, Seattle, WA, March 2001, 273-274. ACM Press.",10.1145/634067.634229,,cs.HC,,"  In this paper, we describe an electronic guidebook prototype and report on a
study of its use in a historic house. Supported by mechanisms in the guidebook,
visitors constructed experiences that had a high degree of interaction with
three entities: the guidebook, their companions, and the house and its
contents. For example, we found that most visitors played audio descriptions
played through speakers (rather than using headphones or reading textual
descriptions) to facilitate communication with their companions.
","[{'version': 'v1', 'created': 'Sun, 28 Jan 2001 07:14:46 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Feb 2001 04:48:43 GMT'}]",2007-05-23,"[['Woodruff', 'Allison', ''], ['Aoki', 'Paul M.', ''], ['Hurst', 'Amy', ''], ['Szymanski', 'Margaret H.', '']]","['Electronic guidebooks', 'historic houses', 'museums']"
3847,1806.11555,Marcelo Fernandes,Matheus F. Torquato and Marcelo A. C. Fernandes,High-Performance Parallel Implementation of Genetic Algorithm on FPGA,"27 pages, 16 figures",,10.1007/s00034-019-01037-w,,cs.DC cs.AI cs.AR eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Genetic Algorithms (GAs) are used to solve search and optimization problems
in which an optimal solution can be found using an iterative process with
probabilistic and non-deterministic transitions. However, depending on the
problem's nature, the time required to find a solution can be high in
sequential machines due to the computational complexity of genetic algorithms.
This work proposes a parallel implementation of a genetic algorithm on
field-programmable gate array (FPGA). Optimization of the system's processing
time is the main goal of this project. Results associated with the processing
time and area occupancy (on FPGA) for various population sizes are analyzed.
Studies concerning the accuracy of the GA response for the optimization of two
variables functions were also evaluated for the hardware implementation.
However, the high-performance implementation proposes in this paper is able to
work with more variable from some adjustments on hardware architecture.
","[{'version': 'v1', 'created': 'Wed, 20 Jun 2018 18:30:27 GMT'}]",2019-01-23,"[['Torquato', 'Matheus F.', ''], ['Fernandes', 'Marcelo A. C.', '']]","['Parallel implementation', 'FPGA', 'Genetic algorithms', 'Reconfigurable computing']"
3848,1810.10795,Martin Siggel,"Martin Siggel, Jan Kleinert, Tobias Stollenwerk, and Reinhold Maierl","TiGL - An Open Source Computational Geometry Library for Parametric
  Aircraft Design",,Math.Comput.Sci. (2019),10.1007/s11786-019-00401-y,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces the software TiGL: TiGL is an open source high-fidelity
geometry modeler that is used in the conceptual and preliminary aircraft and
helicopter design phase. It creates full three-dimensional models of aircraft
from their parametric CPACS description. Due to its parametric nature, it is
typically used for aircraft design analysis and optimization. First, we present
the use-case and architecture of TiGL. Then, we discuss it's geometry module,
which is used to generate the B-spline based surfaces of the aircraft. The
backbone of TiGL is its surface generator for curve network interpolation,
based on Gordon surfaces. One major part of this paper explains the
mathematical foundation of Gordon surfaces on B-splines and how we achieve the
required curve network compatibility. Finally, TiGL's aircraft component module
is introduced, which is used to create the external and internal parts of
aircraft, such as wings, flaps, fuselages, engines or structural elements.
","[{'version': 'v1', 'created': 'Thu, 25 Oct 2018 09:13:10 GMT'}]",2019-07-29,"[['Siggel', 'Martin', ''], ['Kleinert', 'Jan', ''], ['Stollenwerk', 'Tobias', ''], ['Maierl', 'Reinhold', '']]","['aircraft', 'geometry', 'Gordon surface', 'B-splines', 'CPACS']"
3849,1706.05283,Myoung Hoon Ha,Myoung Hoon Ha and Byung-Ro Moon,"The Evolution of Neural Network-Based Chart Patterns: A Preliminary
  Study","8 pages, In proceedings of Genetic and Evolutionary Computation
  Conference (GECCO 2017), Berlin, Germany",,10.1145/3071178.3071192,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A neural network-based chart pattern represents adaptive parametric features,
including non-linear transformations, and a template that can be applied in the
feature space. The search of neural network-based chart patterns has been
unexplored despite its potential expressiveness. In this paper, we formulate a
general chart pattern search problem to enable cross-representational
quantitative comparison of various search schemes. We suggest a HyperNEAT
framework applying state-of-the-art deep neural network techniques to find
attractive neural network-based chart patterns; These techniques enable a fast
evaluation and search of robust patterns, as well as bringing a performance
gain. The proposed framework successfully found attractive patterns on the
Korean stock market. We compared newly found patterns with those found by
different search schemes, showing the proposed approach has potential.
","[{'version': 'v1', 'created': 'Thu, 6 Apr 2017 01:53:52 GMT'}]",2017-06-19,"[['Ha', 'Myoung Hoon', ''], ['Moon', 'Byung-Ro', '']]","['chart pattern', 'HyperNEAT', 'neural network']"
3850,1307.3057,Chittaranjan Pradhan,Chittaranjan Pradhan and Ajay Kumar Bisoi,Chaotic Variations of AES Algorithm,"IJCCMS, 7 pages","International Journal of Chaos, Control, Modelling and Simulation
  (IJCCMS) Vol.2, No.2, June 2013",10.5121/ijccms.2013.2203,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advanced Encryption Standard (AES) algorithm is considered as a secured
algorithm. Still, some security issues lie in the S-Box and the key used. In
this paper, we have tried to give focus on the security of the key used. Here,
the proposed modified algorithms for the AES have been simulated and tested
with different chaotic variations such as 1-D logistic chaos equation, cross
chaos equation as well as combination of both. For the evaluation purpose, the
CPU time has been taken as the parameter. Though the variations of AES
algorithms are taking some more time as compared to the standard AES algorithm,
still the variations can be taken into consideration in case of more sensitive
information. As we are giving more security to the key used for AES algorithm,
our proposed algorithms are very much secured from unauthorized people.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2013 11:19:15 GMT'}]",2013-07-12,"[['Pradhan', 'Chittaranjan', ''], ['Bisoi', 'Ajay Kumar', '']]","['AES Algorithm', '1-D Logistic Chaotic Equation', 'Cross-Chaos', 'Encryption', 'Decryption']"
3851,1610.09058,Riley Murray,Riley Murray and Samir Khuller and Megan Chao,"Scheduling Distributed Clusters of Parallel Machines: Primal-Dual and
  LP-based Approximation Algorithms [Full Version]","A shorter version of this paper (one that omitted several proofs)
  appeared in the proceedings of the 2016 European Symposium on Algorithms","Leibniz International Proceedings in Informatics (LIPIcs), Volume
  58, 2016, pages 68:1--68:17",10.4230/LIPIcs.ESA.2016.68,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Map-Reduce computing framework rose to prominence with datasets of such
size that dozens of machines on a single cluster were needed for individual
jobs. As datasets approach the exabyte scale, a single job may need distributed
processing not only on multiple machines, but on multiple clusters. We consider
a scheduling problem to minimize weighted average completion time of N jobs on
M distributed clusters of parallel machines. In keeping with the scale of the
problems motivating this work, we assume that (1) each job is divided into M
""subjobs"" and (2) distinct subjobs of a given job may be processed
concurrently.
  When each cluster is a single machine, this is the NP-Hard concurrent open
shop problem. A clear limitation of such a model is that a serial processing
assumption sidesteps the issue of how different tasks of a given subjob might
be processed in parallel. Our algorithms explicitly model clusters as pools of
resources and effectively overcome this issue.
  Under a variety of parameter settings, we develop two constant factor
approximation algorithms for this problem. The first algorithm uses an LP
relaxation tailored to this problem from prior work. This LP-based algorithm
provides strong performance guarantees. Our second algorithm exploits a
surprisingly simple mapping to the special case of one machine per cluster.
This mapping-based algorithm is combinatorial and extremely fast. These are the
first constant factor approximations for this problem.
","[{'version': 'v1', 'created': 'Fri, 28 Oct 2016 02:14:25 GMT'}]",2016-10-31,"[['Murray', 'Riley', ''], ['Khuller', 'Samir', ''], ['Chao', 'Megan', '']]","['approximation algorithms', 'distributed computing', 'machine scheduling', 'LP relaxations', 'primal-dual algorithms']"
3852,1703.07116,Niek Tax,"Niek Tax and Benjamin Dalmas and Natalia Sidorova and Wil M P van der
  Aalst and Sylvie Norre",Interest-Driven Discovery of Local Process Models,"submitted to the International Conference on Business Process
  Management (BPM) 2017","Information Systems (2018), 1-31",10.1016/j.is.2018.04.006,,cs.DB cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Local Process Models (LPM) describe structured fragments of process behavior
occurring in the context of less structured business processes. Traditional LPM
discovery aims to generate a collection of process models that describe highly
frequent behavior, but these models do not always provide useful answers for
questions posed by process analysts aiming at business process improvement. We
propose a framework for goal-driven LPM discovery, based on utility functions
and constraints. We describe four scopes on which these utility functions and
constrains can be defined, and show that utility functions and constraints on
different scopes can be combined to form composite utility
functions/constraints. Finally, we demonstrate the applicability of our
approach by presenting several actionable business insights discovered with LPM
discovery on two real life data sets.
","[{'version': 'v1', 'created': 'Tue, 21 Mar 2017 09:57:59 GMT'}]",2018-06-19,"[['Tax', 'Niek', ''], ['Dalmas', 'Benjamin', ''], ['Sidorova', 'Natalia', ''], ['van der Aalst', 'Wil M P', ''], ['Norre', 'Sylvie', '']]","['Process Discovery', 'Pattern Mining', 'Goal-driven Data Mining']"
3853,2106.15230,Caglar Demir,"Caglar Demir, Diego Moussallem, Stefan Heindorf, Axel-Cyrille Ngonga
  Ngomo",Convolutional Hypercomplex Embeddings for Link Prediction,,"The 13th Asian Conference on Machine Learning, ACML 2021",,,cs.LG cs.IR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Knowledge graph embedding research has mainly focused on the two smallest
normed division algebras, $\mathbb{R}$ and $\mathbb{C}$. Recent results suggest
that trilinear products of quaternion-valued embeddings can be a more effective
means to tackle link prediction. In addition, models based on convolutions on
real-valued embeddings often yield state-of-the-art results for link
prediction. In this paper, we investigate a composition of convolution
operations with hypercomplex multiplications. We propose the four approaches
QMult, OMult, ConvQ and ConvO to tackle the link prediction problem. QMult and
OMult can be considered as quaternion and octonion extensions of previous
state-of-the-art approaches, including DistMult and ComplEx. ConvQ and ConvO
build upon QMult and OMult by including convolution operations in a way
inspired by the residual learning framework. We evaluated our approaches on
seven link prediction datasets including WN18RR, FB15K-237 and YAGO3-10.
Experimental results suggest that the benefits of learning hypercomplex-valued
vector representations become more apparent as the size and complexity of the
knowledge graph grows. ConvO outperforms state-of-the-art approaches on
FB15K-237 in MRR, Hit@1 and Hit@3, while QMult, OMult, ConvQ and ConvO
outperform state-of-the-approaches on YAGO3-10 in all metrics. Results also
suggest that link prediction performances can be further improved via
prediction averaging. To foster reproducible research, we provide an
open-source implementation of approaches, including training and evaluation
scripts as well as pretrained models.
","[{'version': 'v1', 'created': 'Tue, 29 Jun 2021 10:26:51 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Nov 2021 09:36:15 GMT'}]",2021-11-19,"[['Demir', 'Caglar', ''], ['Moussallem', 'Diego', ''], ['Heindorf', 'Stefan', ''], ['Ngomo', 'Axel-Cyrille Ngonga', '']]","['Convolution', 'Hypercomplex Embeddings', 'Link Prediction', 'Residual Learning']"
3854,1107.6004,Kostas N. Oikonomou,"Kostas N. Oikonomou, Peter D. Grunwald",Explicit Bounds for Entropy Concentration under Linear Constraints,"1) An error affecting sec. 3 has been corrected: the parameters delta
  and theta cannot be chosen independently. Sec. 3 has been revised up to
  Theorem 3.15 in sec. 3.6. 2) Some minor updates in sec. 4. 3) Some proofs
  used in both sec. 3 and sec. 4 have been unified (This version to appear in
  IEEE Transactions on Information Theory, December 2015)",,10.1109/TIT.2015.2458951,,cs.IT math.IT physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consider the set of all sequences of $n$ outcomes, each taking one of $m$
values, that satisfy a number of linear constraints. If $m$ is fixed while $n$
increases, most sequences that satisfy the constraints result in frequency
vectors whose entropy approaches that of the maximum entropy vector satisfying
the constraints. This well-known ""entropy concentration"" phenomenon underlies
the maximum entropy method.
  Existing proofs of the concentration phenomenon are based on limits or
asymptotics and unrealistically assume that constraints hold precisely,
supporting maximum entropy inference more in principle than in practice. We
present, for the first time, non-asymptotic, explicit lower bounds on $n$ for a
number of variants of the concentration result to hold to any prescribed
accuracies, with the constraints holding up to any specified tolerance, taking
into account the fact that allocations of discrete units can satisfy
constraints only approximately. Again unlike earlier results, we measure
concentration not by deviation from the maximum entropy value, but by the
$\ell_1$ and $\ell_2$ distances from the maximum entropy-achieving frequency
vector. One of our results holds independently of the alphabet size $m$ and is
based on a novel proof technique using the multi-dimensional Berry-Esseen
theorem. We illustrate and compare our results using various detailed examples.
","[{'version': 'v1', 'created': 'Fri, 29 Jul 2011 16:04:40 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Oct 2011 18:57:50 GMT'}, {'version': 'v3', 'created': 'Tue, 23 Sep 2014 13:18:00 GMT'}, {'version': 'v4', 'created': 'Wed, 18 Mar 2015 16:07:05 GMT'}, {'version': 'v5', 'created': 'Wed, 30 Sep 2015 19:28:54 GMT'}]",2016-11-18,"[['Oikonomou', 'Kostas N.', ''], ['Grunwald', 'Peter D.', '']]","['maximum entropy', 'concentration', 'linear inequalities', 'tolerances', 'central limit theorem']"
3855,1602.00878,Jihad Fahs,Jihad Fahs and Ibrahim Abou-Faycal,"On Properties of the Support of Capacity-Achieving Distributions for
  Additive Noise Channel Models with Input Cost Constraints","Accepted for publication in the IEEE Transactions on Information
  Theory with minor modifications on the current version",,10.1109/TIT.2017.2771815,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the classical problem of characterizing the channel capacity and its
achieving distribution in a generic fashion. We derive a simple relation
between three parameters: the input-output function, the input cost function
and the noise probability density function, one which dictates the type of the
optimal input. In Layman terms we prove that the support of the optimal input
is bounded whenever the cost grows faster than a cut-off rate equal to the
logarithm of the noise PDF evaluated at the input-output function. Furthermore,
we prove a converse statement that says whenever the cost grows slower than the
cut-off rate, the optimal input has necessarily an unbounded support. In
addition, we show how the discreteness of the optimal input is guaranteed
whenever the triplet satisfy some analyticity properties. We argue that a
suitable cost function to be imposed on the channel input is one that grows
similarly to the cut-off rate. Our results are valid for any cost function that
is super-logarithmic. They summarize a large number of previous channel
capacity results and give new ones for a wide range of communication channel
models, such as Gaussian mixtures, generalized-Gaussians and heavy-tailed noise
models, that we state along with numerical computations.
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2016 11:01:11 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Nov 2017 20:01:22 GMT'}]",2017-11-17,"[['Fahs', 'Jihad', ''], ['Abou-Faycal', 'Ibrahim', '']]","['Channel capacity', 'memoryless channels', 'non-linear channels', 'input cost function', 'logarithmic']"
3856,2205.15943,Cameron Ballard,"Cameron Ballard, Ian Goldstein, Pulak Mehta, Genesis Smothers, Kejsi
  Take, Victoria Zhong, Rachel Greenstadt, Tobias Lauinger, Damon McCoy","Conspiracy Brokers: Understanding the Monetization of YouTube Conspiracy
  Theories",,"WWW 2022 Proceedings of the ACM Web Conference, April 2022, Pages
  2707-2718",10.1145/3485447.3512142,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Conspiracy theories are increasingly a subject of research interest as
society grapples with their rapid growth in areas such as politics or public
health. Previous work has established YouTube as one of the most popular sites
for people to host and discuss different theories. In this paper, we present an
analysis of monetization methods of conspiracy theorist YouTube creators and
the types of advertisers potentially targeting this content. We collect 184,218
ad impressions from 6,347 unique advertisers found on conspiracy-focused
channels and mainstream YouTube content. We classify the ads into business
categories and compare their prevalence between conspiracy and mainstream
content. We also identify common offsite monetization methods. In comparison
with mainstream content, conspiracy videos had similar levels of ads from
well-known brands, but an almost eleven times higher prevalence of likely
predatory or deceptive ads. Additionally, we found that conspiracy channels
were more than twice as likely as mainstream channels to use offsite
monetization methods, and 53% of the demonetized channels we observed were
linking to third-party sites for alternative monetization opportunities. Our
results indicate that conspiracy theorists on YouTube had many potential
avenues to generate revenue, and that predatory ads were more frequently served
for conspiracy videos.
","[{'version': 'v1', 'created': 'Tue, 31 May 2022 16:42:52 GMT'}]",2022-06-01,"[['Ballard', 'Cameron', ''], ['Goldstein', 'Ian', ''], ['Mehta', 'Pulak', ''], ['Smothers', 'Genesis', ''], ['Take', 'Kejsi', ''], ['Zhong', 'Victoria', ''], ['Greenstadt', 'Rachel', ''], ['Lauinger', 'Tobias', ''], ['McCoy', 'Damon', '']]","['Conspiracy Videos', 'Monetization', 'Online Ads', 'Misinformation']"
3857,1705.01821,D Thirumulanathan,"D. Thirumulanathan, Rajesh Sundaresan, and Y Narahari",On Optimal Mechanisms in the Two-Item Single-Buyer Unit-Demand Setting,,"Journal of Mathematical Economics (JME), vol. 82, pp.31--60, 2019",10.1016/j.jmateco.2019.01.005,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of designing a revenue-optimal mechanism in the
two-item, single-buyer, unit-demand setting when the buyer's valuations, $(z_1,
z_2)$, are uniformly distributed in an arbitrary rectangle
$[c,c+b_1]\times[c,c+b_2]$ in the positive quadrant. We provide a complete and
explicit solution for arbitrary nonnegative values of $(c,b_1,b_2)$. We
identify five simple structures, each with at most five (possibly stochastic)
menu items, and prove that the optimal mechanism has one of the five
structures. We also characterize the optimal mechanism as a function of $b_1,
b_2$, and $c$. When $c$ is low, the optimal mechanism is a posted price
mechanism with an exclusion region; when $c$ is high, it is a posted price
mechanism without an exclusion region. Our results are the first to show the
existence of optimal mechanisms with no exclusion region, to the best of our
knowledge.
","[{'version': 'v1', 'created': 'Thu, 4 May 2017 12:47:39 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Jun 2017 10:17:20 GMT'}, {'version': 'v3', 'created': 'Wed, 31 Jan 2018 19:59:35 GMT'}, {'version': 'v4', 'created': 'Wed, 26 Sep 2018 07:26:28 GMT'}, {'version': 'v5', 'created': 'Tue, 5 Mar 2019 09:23:56 GMT'}]",2019-03-06,"[['Thirumulanathan', 'D.', ''], ['Sundaresan', 'Rajesh', ''], ['Narahari', 'Y', '']]","['Game theory', 'Economics', 'Optimal Auctions', 'StochasticOrders', 'Convex Optimization']"
3858,1701.08513,Diego Valsesia,"Diego Valsesia, Enrico Magli","Fast and Lightweight Rate Control for Onboard Predictive Coding of
  Hyperspectral Images",,,10.1109/LGRS.2016.2644726,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predictive coding is attractive for compression of hyperspecral images
onboard of spacecrafts in light of the excellent rate-distortion performance
and low complexity of recent schemes. In this letter we propose a rate control
algorithm and integrate it in a lossy extension to the CCSDS-123 lossless
compression recommendation. The proposed rate algorithm overhauls our previous
scheme by being orders of magnitude faster and simpler to implement, while
still providing the same accuracy in terms of output rate and comparable or
better image quality.
","[{'version': 'v1', 'created': 'Mon, 30 Jan 2017 08:45:39 GMT'}]",2017-01-31,"[['Valsesia', 'Diego', ''], ['Magli', 'Enrico', '']]","['Rate control', 'predictive coding', 'hyperspectral images']"
3859,0809.3908,Vinay Joseph,"Vinod Sharma, Utpal Mukherji, Vinay Joseph, Shrey Gupta",Optimal Energy Management Policies for Energy Harvesting Sensor Nodes,"Submitted to the IEEE Transactions on Wireless Communications; 22
  pages with 10 figures",,10.1109/TWC.2010.04.080749,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study a sensor node with an energy harvesting source. The generated energy
can be stored in a buffer. The sensor node periodically senses a random field
and generates a packet. These packets are stored in a queue and transmitted
using the energy available at that time. We obtain energy management policies
that are throughput optimal, i.e., the data queue stays stable for the largest
possible data rate. Next we obtain energy management policies which minimize
the mean delay in the queue.We also compare performance of several easily
implementable sub-optimal energy management policies. A greedy policy is
identified which, in low SNR regime, is throughput optimal and also minimizes
mean delay.
","[{'version': 'v1', 'created': 'Tue, 23 Sep 2008 13:05:22 GMT'}]",2016-11-17,"[['Sharma', 'Vinod', ''], ['Mukherji', 'Utpal', ''], ['Joseph', 'Vinay', ''], ['Gupta', 'Shrey', '']]","['Optimal energy management policies', 'energy harvesting', 'sensor networks']"
3860,1805.04605,Adrian Dalca,"Adrian V. Dalca, Guha Balakrishnan, John Guttag, Mert R. Sabuncu",Unsupervised Learning for Fast Probabilistic Diffeomorphic Registration,"MICCAI 2018 (Oral Presentation). Proceedings: LNCS 11070, pp 729-738","LNCS 11070, pp 729-738, Springer. 2018",10.1007/978-3-030-00928-1_82,,cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional deformable registration techniques achieve impressive results and
offer a rigorous theoretical treatment, but are computationally intensive since
they solve an optimization problem for each image pair. Recently,
learning-based methods have facilitated fast registration by learning spatial
deformation functions. However, these approaches use restricted deformation
models, require supervised labels, or do not guarantee a diffeomorphic
(topology-preserving) registration. Furthermore, learning-based registration
tools have not been derived from a probabilistic framework that can offer
uncertainty estimates. In this paper, we present a probabilistic generative
model and derive an unsupervised learning-based inference algorithm that makes
use of recent developments in convolutional neural networks (CNNs). We
demonstrate our method on a 3D brain registration task, and provide an
empirical analysis of the algorithm. Our approach results in state of the art
accuracy and very fast runtimes, while providing diffeomorphic guarantees and
uncertainty estimates. Our implementation is available online at
http://voxelmorph.csail.mit.edu .
","[{'version': 'v1', 'created': 'Fri, 11 May 2018 22:12:01 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Sep 2018 13:28:36 GMT'}]",2019-03-15,"[['Dalca', 'Adrian V.', ''], ['Balakrishnan', 'Guha', ''], ['Guttag', 'John', ''], ['Sabuncu', 'Mert R.', '']]","['medical image registration', 'diffeomorphic registration', 'probabilistic modeling', 'convolutional neural networks', 'variational inference', 'uncertainty estimation']"
3861,1505.01340,Damien Desfontaines,"Cristian S. Calude, Damien Desfontaines",Universality and Almost Decidability,,Fundamenta Informaticae XXI (2014) 1001-1008,10.3233/FI-2012-0000,CDMTCS-462,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present and study new definitions of universal and programmable universal
unary functions and consider a new simplicity criterion: almost decidability of
the halting set. A set of positive integers S is almost decidable if there
exists a decidable and generic (i.e. a set of natural density one) set whose
intersection with S is decidable. Every decidable set is almost decidable, but
the converse implication is false. We prove the existence of infinitely many
universal functions whose halting sets are generic (negligible, i.e. have
density zero) and (not) almost decidable. One result - namely, the existence of
infinitely many universal functions whose halting sets are generic (negligible)
and not almost decidable - solves an open problem in [9]. We conclude with some
open problems.
","[{'version': 'v1', 'created': 'Wed, 6 May 2015 12:32:07 GMT'}]",2015-05-07,"[['Calude', 'Cristian S.', ''], ['Desfontaines', 'Damien', '']]","['Universal function', 'halting set', 'density', 'generic and negligible sets', 'almost decidable set']"
3862,1810.10206,Jean-Daniel Taupiac,"Jean-Daniel Taupiac (ICAR), Nancy Rodriguez (ICAR), Olivier Strauss
  (ICAR)","Immercity: a curation content application in Virtual and Augmented
  reality",,"10th International Conference, VAMR 2018, Held as Part of HCI
  International 2018, II (2), Springer, 2018, Virtual, Augmented and Mixed
  Reality: Applications in Health, Cultural Heritage, and Industry,
  978-3-319-91583-8. https://link.springer.com/book/10.1007/978-3-319-91584-5",10.1007/978-3-319-91584-5_18,,cs.GR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When working with emergent and appealing technologies as Virtual Reality,
Mixed Reality and Augmented Reality, the issue of definitions appear very
often. Indeed, our experience with various publics allows us to notice that
technology definitions pose ambiguity and representation problems for informed
as well as novice users. In this paper we present Immercity, a content curation
system designed in the context of a collaboration between the University of
Montpellier and CapGemi-ni, to deliver a technology watch. It is also used as a
testbed for our experiences with Virtual, Mixed and Augmented reality to
explore new interaction techniques and devices, artificial intelligence
integration, visual affordances, performance , etc. But another, very
interesting goal appeared: use Immercity to communicate about Virtual, Mixed
and Augmented Reality by using them as a support.
","[{'version': 'v1', 'created': 'Wed, 24 Oct 2018 06:23:46 GMT'}]",2018-10-25,"[['Taupiac', 'Jean-Daniel', '', 'ICAR'], ['Rodriguez', 'Nancy', '', 'ICAR'], ['Strauss', 'Olivier', '', 'ICAR']]","['Virtual Reality', 'Augmented Reality', 'Curation Content']"
3863,1707.04714,Ali Dehghantanha,"Michael Hopkins, Ali Dehghantanha",Exploit Kits: The production line of the Cybercrime Economy,"2015 2nd International Conference on Information Security and Cyber
  Forensics, InfoSec 2015",,10.1109/InfoSec.2015.7435501,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The annual cost of Cybercrime to the global economy is estimated to be around
400 billion dollar in support of which Exploit Kits have been providing
enabling technology.This paper reviews the recent developments in Exploit Kit
capability and how these are being applied in practice.In doing so it paves the
way for better understanding of the exploit kits economy that may better help
in combatting them and considers industry preparedness to respond.
","[{'version': 'v1', 'created': 'Sat, 15 Jul 2017 09:32:20 GMT'}]",2017-07-18,"[['Hopkins', 'Michael', ''], ['Dehghantanha', 'Ali', '']]","['Exploit Kit', 'Driveby', 'Malware', 'Malvertising']"
3864,2102.09260,Milan Straka,"Milan Straka, Lucia Piatrikov\'a, Peter van Bokhoven, \v{L}ubo\v{s}
  Buzna","A matrix approach to detect temporal behavioral patterns at electric
  vehicle charging stations","8 pages, 5 figures, conference paper",Transportation Research Procedia (2021),10.1016/j.trpro.2021.07.186,,cs.LG cs.AI cs.CE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Based on the electric vehicle (EV) arrival times and the duration of EV
connection to the charging station, we identify charging patterns and derive
groups of charging stations with similar charging patterns applying two
approaches. The ruled based approach derives the charging patterns by
specifying a set of time intervals and a threshold value. In the second
approach, we combine the modified l-p norm (as a matrix dissimilarity measure)
with hierarchical clustering and apply them to automatically identify charging
patterns and groups of charging stations associated with such patterns. A
dataset collected in a large network of public charging stations is used to
test both approaches. Using both methods, we derived charging patterns. The
first, rule-based approach, performed well at deriving predefined patterns and
the latter, hierarchical clustering, showed the capability of delivering
unexpected charging patterns.
","[{'version': 'v1', 'created': 'Thu, 18 Feb 2021 10:37:32 GMT'}]",2022-08-03,"[['Straka', 'Milan', ''], ['Piatriková', 'Lucia', ''], ['van Bokhoven', 'Peter', ''], ['Buzna', 'Ľuboš', '']]","['electromobility', 'clustering', 'charging stations', 'data analysis;']"
3865,1407.3269,Sakyasingha Dasgupta,"Guanjiao Ren, Weihai Chen, Sakyasingha Dasgupta, Christoph
  Kolodziejski, Florentin W\""org\""otter, Poramate Manoonpong","Multiple chaotic central pattern generators with learning for legged
  locomotion and malfunction compensation","48 pages, 16 figures, Information Sciences 2014",,10.1016/j.ins.2014.05.001,,cs.AI cs.LG cs.NE cs.RO,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  An originally chaotic system can be controlled into various periodic
dynamics. When it is implemented into a legged robot's locomotion control as a
central pattern generator (CPG), sophisticated gait patterns arise so that the
robot can perform various walking behaviors. However, such a single chaotic CPG
controller has difficulties dealing with leg malfunction. Specifically, in the
scenarios presented here, its movement permanently deviates from the desired
trajectory. To address this problem, we extend the single chaotic CPG to
multiple CPGs with learning. The learning mechanism is based on a simulated
annealing algorithm. In a normal situation, the CPGs synchronize and their
dynamics are identical. With leg malfunction or disability, the CPGs lose
synchronization leading to independent dynamics. In this case, the learning
mechanism is applied to automatically adjust the remaining legs' oscillation
frequencies so that the robot adapts its locomotion to deal with the
malfunction. As a consequence, the trajectory produced by the multiple chaotic
CPGs resembles the original trajectory far better than the one produced by only
a single CPG. The performance of the system is evaluated first in a physical
simulation of a quadruped as well as a hexapod robot and finally in a real
six-legged walking machine called AMOSII. The experimental results presented
here reveal that using multiple CPGs with learning is an effective approach for
adaptive locomotion generation where, for instance, different body parts have
to perform independent movements for malfunction compensation.
","[{'version': 'v1', 'created': 'Fri, 11 Jul 2014 14:21:22 GMT'}]",2014-09-02,"[['Ren', 'Guanjiao', ''], ['Chen', 'Weihai', ''], ['Dasgupta', 'Sakyasingha', ''], ['Kolodziejski', 'Christoph', ''], ['Wörgötter', 'Florentin', ''], ['Manoonpong', 'Poramate', '']]","['multi-legged robot', 'central pattern generator (CPG)', 'learning']"
3866,1310.4572,EPTCS,"Xian Xu (East China University of Science and Technology, Shanghai,
  China P.R.)",On Context Bisimulation for Parameterized Higher-order Processes,"In Proceedings ICE 2013, arXiv:1310.4019","EPTCS 131, 2013, pp. 37-51",10.4204/EPTCS.131.5,,cs.LO cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies context bisimulation for higher-order processes, in the
presence of parameterization (viz. abstraction). We show that the extension of
higher-order processes with process parameterization retains the
characterization of context bisimulation by a much simpler form of bisimulation
called normal bisimulation (viz. they are coincident), in which universal
quantifiers are eliminated; whereas it is not the same with name
parameterization. These results clarify further the bisimulation theory of
higher-order processes, and also shed light on the essential distinction
between the two kinds of parameterization.
","[{'version': 'v1', 'created': 'Thu, 17 Oct 2013 03:47:57 GMT'}]",2013-10-18,"[['Xu', 'Xian', '', 'East China University of Science and Technology, Shanghai,\n  China P.R.']]","['Context Bisimulation', 'Normal Bisimulation', 'Higher-order', 'Processes']"
3867,1911.11926,Filipi Nascimento Silva,"Filipi Nascimento Silva, Aditya Tandon, Diego Raphael Amancio,
  Alessandro Flammini, Filippo Menczer, Sta\v{s}a Milojevi\'c and Santo
  Fortunato",Recency predicts bursts in the evolution of author citations,"12 pages, 7 figures",,10.1162/qss_a_00070,,cs.DL cs.CL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The citations process for scientific papers has been studied extensively. But
while the citations accrued by authors are the sum of the citations of their
papers, translating the dynamics of citation accumulation from the paper to the
author level is not trivial. Here we conduct a systematic study of the
evolution of author citations, and in particular their bursty dynamics. We find
empirical evidence of a correlation between the number of citations most
recently accrued by an author and the number of citations they receive in the
future. Using a simple model where the probability for an author to receive new
citations depends only on the number of citations collected in the previous
12-24 months, we are able to reproduce both the citation and burst size
distributions of authors across multiple decades.
","[{'version': 'v1', 'created': 'Wed, 27 Nov 2019 02:52:02 GMT'}]",2020-11-18,"[['Silva', 'Filipi Nascimento', ''], ['Tandon', 'Aditya', ''], ['Amancio', 'Diego Raphael', ''], ['Flammini', 'Alessandro', ''], ['Menczer', 'Filippo', ''], ['Milojević', 'Staša', ''], ['Fortunato', 'Santo', '']]","['Citation dynamics', 'authors', 'recency', 'preferential attachment']"
3868,1808.06604,Megan McCracken,Megan McCracken,"Artificial Neural Networks in Fluid Dynamics: A Novel Approach to the
  Navier-Stokes Equations","4 pages, 8 figures, PEARC '18: Practice and Experience in Advanced
  Research Computing, July 22--26, 2018, Pittsburgh, PA, USA",,10.1145/3219104.3229262,,cs.NA cs.NE physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural networks have been used to solve different types of large data related
problems in many different fields.This project takes a novel approach to
solving the Navier-Stokes Equations for turbulence by training a neural network
using Bayesian Cluster and SOM neighbor weighting to map ionospheric velocity
fields based on 3-dimensional inputs. Parameters used in this problem included
the velocity, Reynolds number, Prandtl number, and temperature. In this project
data was obtained from Johns-Hopkins University to train the neural network
using MATLAB. The neural network was able to map the velocity fields within a
sixty-seven percent accuracy of the validation data used. Further studies will
focus on higher accuracy and solving further non-linear differential equations
using convolutional neural networks.
","[{'version': 'v1', 'created': 'Sun, 19 Aug 2018 14:46:57 GMT'}]",2018-08-22,"[['McCracken', 'Megan', '']]","['ACM proceedings', 'Fluid Dynamics', 'Velocity Fields', 'Neural Networks', 'Navier-Stokes']"
3869,2109.02967,Berta Serracanta Pujol,"Berta Serracanta, Jordi Paillisse, Albert Cabellos, Anna Claiborne,
  Alberto Rodriguez-Natal, Dave Ward and Fabio Maino",Wide Area Network Autoscaling for Cloud Applications,"6 pages, 5 figures","Proceedings of the ACM SIGCOMM 2021 Workshop on
  Network-Application Integration Pages 1-6",10.1145/3472727.3472797,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern cloud orchestrators like Kubernetes provide a versatile and robust way
to host applications at scale. One of their key features is autoscaling, which
automatically adjusts cloud resources (compute, memory, storage) in order to
adapt to the demands of applications. However, the scope of cloud autoscaling
is limited to the datacenter hosting the cloud and it doesn't apply uniformly
to the allocation of network resources. In I/O-constrained or data-in-motion
use cases this can lead to severe performance degradation for the application.
For example, when the load on a cloud service increases and the Wide Area
Network (WAN) connecting the datacenter to the Internet becomes saturated, the
application flows experience an increase in delay and loss. In many cases this
is dealt with overprovisioning network capacity, which introduces additional
costs and inefficiencies.
  On the other hand, thanks to the concept of ""Network as Code"", the WAN
exposes a set of APIs that can be used to dynamically allocate and de-allocate
capacity on-demand. In this paper we propose extending the concept of cloud
autoscaling into the network to address this limitation. This way, applications
running in the cloud can communicate their networking requirements, like
bandwidth or traffic profile, to a Software-Defined Networking (SDN) controller
or Network as a Service (NaaS) platform. Moreover, we aim to define the
concepts of vertical and horizontal autoscaling applied to networking. We
present a prototype that automatically allocates bandwidth to the underlay
network, according to the requirements of the applications hosted in
Kubernetes. Finally, we discuss open research challenges.
","[{'version': 'v1', 'created': 'Tue, 7 Sep 2021 09:47:42 GMT'}]",2021-09-08,"[['Serracanta', 'Berta', ''], ['Paillisse', 'Jordi', ''], ['Cabellos', 'Albert', ''], ['Claiborne', 'Anna', ''], ['Rodriguez-Natal', 'Alberto', ''], ['Ward', 'Dave', ''], ['Maino', 'Fabio', '']]","['Autoscaling', 'Wide Area Networks', 'Kubernetes', 'Cloud Computing', 'Network-Application Interface']"
3870,1910.09242,Andres Ferraro,"Andres Ferraro, Kjell Lemstr\""om","On large-scale genre classification in symbolically encoded music by
  automatic identification of repeating patterns",,"Proceedings of the 5th International Conference on Digital
  Libraries for Musicology (DLfM '18). ACM, New York, NY, USA, 34-37. 2018",10.1145/3273024.3273035,,cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The importance of repetitions in music is well-known. In this paper, we study
music repetitions in the context of effective and efficient automatic genre
classification in large-scale music-databases. We aim at enhancing the access
and organization of pieces of music in Digital Libraries by allowing automatic
categorization of entire collections by considering only their musical content.
We handover to the public a set of genre-specific patterns to support research
in musicology. The patterns can be used, for instance, to explore and analyze
the relations between musical genres. There are many existing algorithms that
could be used to identify and extract repeating patterns in symbolically
encoded music. In our case, the extracted patterns are used as representations
of the pieces of music on the underlying corpus and, consecutively, to train
and evaluate a classifier to automatically identify genres. In this paper, we
apply two very fast algorithms enabling us to experiment on large and diverse
corpora. Thus, we are able to find patterns with strong discrimination power
that can be used in various applications. We carried out experiments on a
corpus containing over 40,000 MIDI files annotated with at least one genre. The
experiments suggest that our approach is scalable and capable of dealing with
real-world-size music collections.
","[{'version': 'v1', 'created': 'Mon, 21 Oct 2019 09:58:00 GMT'}]",2019-10-22,"[['Ferraro', 'Andres', ''], ['Lemström', 'Kjell', '']]","['Music information retrieval', 'pattern detection', 'automaticgenre classification']"
3871,1806.03014,Masahiro Oda,"Masahiro Oda, Takayuki Kitasaka, Kazuhiro Furukawa, Ryoji Miyahara,
  Yoshiki Hirooka, Hidemi Goto, Nassir Navab, Kensaku Mori","Machine learning-based colon deformation estimation method for
  colonoscope tracking","Accepted paper for oral presentation at SPIE Medical Imaging 2018,
  Houston, TX, USA","SPIE Medical Imaging 2018: Image-Guided Procedures, Robotic
  Interventions, and Modeling",10.1117/12.2293936,"Published in Proceedings of SPIE 10576, Medical Imaging 2018:
  Image-Guided Procedures, Robotic Interventions, and Modeling, 1057619",cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a colon deformation estimation method, which can be used
to estimate colon deformations during colonoscope insertions. Colonoscope
tracking or navigation system that navigates a physician to polyp positions
during a colonoscope insertion is required to reduce complications such as
colon perforation. A previous colonoscope tracking method obtains a colonoscope
position in the colon by registering a colonoscope shape and a colon shape. The
colonoscope shape is obtained using an electromagnetic sensor, and the colon
shape is obtained from a CT volume. However, large tracking errors were
observed due to colon deformations occurred during colonoscope insertions. Such
deformations make the registration difficult. Because the colon deformation is
caused by a colonoscope, there is a strong relationship between the colon
deformation and the colonoscope shape. An estimation method of colon
deformations occur during colonoscope insertions is necessary to reduce
tracking errors. We propose a colon deformation estimation method. This method
is used to estimate a deformed colon shape from a colonoscope shape. We use the
regression forests algorithm to estimate a deformed colon shape. The regression
forests algorithm is trained using pairs of colon and colonoscope shapes, which
contains deformations occur during colonoscope insertions. As a preliminary
study, we utilized the method to estimate deformations of a colon phantom. In
our experiments, the proposed method correctly estimated deformed colon phantom
shapes.
","[{'version': 'v1', 'created': 'Fri, 8 Jun 2018 08:15:29 GMT'}]",2018-06-11,"[['Oda', 'Masahiro', ''], ['Kitasaka', 'Takayuki', ''], ['Furukawa', 'Kazuhiro', ''], ['Miyahara', 'Ryoji', ''], ['Hirooka', 'Yoshiki', ''], ['Goto', 'Hidemi', ''], ['Navab', 'Nassir', ''], ['Mori', 'Kensaku', '']]","['Colon', 'colonoscope tracking', 'deformation estimation']"
3872,0804.1777,Dariusz Dereniowski,Dariusz Dereniowski,Phutball is PSPACE-hard,"13 pages, 7 figures",Theoretical Computer Science 411 (2010) 3971-3978,10.1016/j.tcs.2010.08.019,,cs.GT cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the $n\times n$ game of Phutball. It is shown that, given an
arbitrary position of stones on the board, it is a PSPACE-hard problem to
determine whether the specified player can win the game, regardless of the
opponent's choices made during the game.
","[{'version': 'v1', 'created': 'Thu, 10 Apr 2008 18:22:47 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Mar 2009 19:27:23 GMT'}]",2021-03-05,"[['Dereniowski', 'Dariusz', '']]","['computational complexity', 'games', 'Phutball', 'Pspace hardness']"
3873,1308.1214,Shariful Alam,"Sk. Shariful Alam, Lucio Marcenaro and Carlo Regazzoni",Opportunistic Spectrum Sensing and Transmissions,,"Cognitive Radio and Interference Management: Technology and
  Strategy. IGI Global, 2013. 1-28",10.4018/978-1-4666-2005-6.ch001,,cs.NI cs.ET,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Nowadays, cognitive radio is one of the most promising paradigms in the arena
of wireless communications, as it aims at the proficient use of radio
resources. Proper utilization of the radio spectrum requires dynamic spectrum
accessing. To this end, spectrum sensing is undoubtedly necessary. In this
chapter, various approaches for dynamic spectrum access scheme are presented,
together with a survey of spectrum sensing methodologies for cognitive radio.
Moreover, the challenges are analyzed that are associated with spectrum sensing
and dynamic spectrum access techniques. Sensing beacon transmitted from
different cognitive terminals creates significant interference to the primary
users if proper precautions have not be not taken into consideration.
Consequently, cognitive radio transmitter power control will be finally
addressed to analyze energy efficiency aspects.
","[{'version': 'v1', 'created': 'Tue, 6 Aug 2013 09:22:30 GMT'}]",2013-08-13,"[['Alam', 'Sk. Shariful', ''], ['Marcenaro', 'Lucio', ''], ['Regazzoni', 'Carlo', '']]","['Cognitive radio networks', 'dynamic spectrum access (DSA)', 'collaborative spectrum sensing', 'power control (PC)', 'energy-efficient sensing']"
3874,1811.09570,Aditya Sundararajan,"Aditya Sundararajan and Tanwir Khan and Amir Moghadasi and Arif I.
  Sarwat","A Survey on Synchrophasor Data Quality and Cybersecurity Challenges, and
  Evaluation of their Interdependencies",18 pages,,10.1007/s40565-018-0473-6,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Synchrophasor devices guarantee situation awareness for real-time monitoring
and operational visibility of the smart grid. With their widespread
implementation, significant challenges have emerged, especially in
communication, data quality and cybersecurity. The existing literature treats
these challenges as separate problems, when in reality, they have a complex
interplay. This paper conducts a comprehensive review of quality and
cybersecurity challenges for synchrophasors, and identifies the
interdependencies between them. It also summarizes different methods used to
evaluate the dependency and surveys how quality checking methods can be used to
detect potential cyber-attacks. In doing so, this paper serves as a starting
point for researchers entering the fields of synchrophasor data analytics and
security.
","[{'version': 'v1', 'created': 'Fri, 23 Nov 2018 17:25:54 GMT'}]",2018-11-26,"[['Sundararajan', 'Aditya', ''], ['Khan', 'Tanwir', ''], ['Moghadasi', 'Amir', ''], ['Sarwat', 'Arif I.', '']]","['Synchrophasors', 'data quality', 'cybersecurity', 'methodologies']"
3875,2203.15312,Xiao Pan,"Xiao Pan, Peike Li, Zongxin Yang, Huiling Zhou, Chang Zhou, Hongxia
  Yang, Jingren Zhou, Yi Yang",In-N-Out Generative Learning for Dense Unsupervised Video Segmentation,Accepted by ACM MM 2022,ACM MM 2022,10.1145/3503161.3547909,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we focus on unsupervised learning for Video Object
Segmentation (VOS) which learns visual correspondence (i.e., the similarity
between pixel-level features) from unlabeled videos. Previous methods are
mainly based on the contrastive learning paradigm, which optimize either in
image level or pixel level. Image-level optimization (e.g., the spatially
pooled feature of ResNet) learns robust high-level semantics but is sub-optimal
since the pixel-level features are optimized implicitly. By contrast,
pixel-level optimization is more explicit, however, it is sensitive to the
visual quality of training data and is not robust to object deformation. To
complementarily perform these two levels of optimization in a unified
framework, we propose the In-aNd-Out (INO) generative learning from a purely
generative perspective with the help of naturally designed class tokens and
patch tokens in Vision Transformer (ViT). Specifically, for image-level
optimization, we force the out-view imagination from local to global views on
class tokens, which helps capture high-level semantics, and we name it as
out-generative learning. As to pixel-level optimization, we perform in-view
masked image modeling on patch tokens, which recovers the corrupted parts of an
image via inferring its fine-grained structure, and we term it as in-generative
learning. To discover the temporal information better, we additionally force
the inter-frame consistency from both feature and affinity matrix levels.
Extensive experiments on DAVIS-2017 val and YouTube-VOS 2018 val show that our
INO outperforms previous state-of-the-art methods by significant margins. Code
is available: https://github.com/pansanity666/INO_VOS
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2022 07:56:21 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Apr 2022 08:12:07 GMT'}, {'version': 'v3', 'created': 'Fri, 29 Apr 2022 08:06:12 GMT'}, {'version': 'v4', 'created': 'Mon, 24 Oct 2022 12:04:45 GMT'}]",2022-10-25,"[['Pan', 'Xiao', ''], ['Li', 'Peike', ''], ['Yang', 'Zongxin', ''], ['Zhou', 'Huiling', ''], ['Zhou', 'Chang', ''], ['Yang', 'Hongxia', ''], ['Zhou', 'Jingren', ''], ['Yang', 'Yi', '']]","['unsupervised video object segmentation', 'self-supervised learning', 'dense prediction', 'generative learning']"
3876,1904.02760,Rens Hoegen,"Rens Hoegen, Deepali Aneja, Daniel McDuff and Mary Czerwinski",An End-to-End Conversational Style Matching Agent,,"Proceedings of the 19th ACM International Conference on
  Intelligent Virtual Agents (2019) 111-118",10.1145/3308532.3329473,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an end-to-end voice-based conversational agent that is able to
engage in naturalistic multi-turn dialogue and align with the interlocutor's
conversational style. The system uses a series of deep neural network
components for speech recognition, dialogue generation, prosodic analysis and
speech synthesis to generate language and prosodic expression with qualities
that match those of the user. We conducted a user study (N=30) in which
participants talked with the agent for 15 to 20 minutes, resulting in over 8
hours of natural interaction data. Users with high consideration conversational
styles reported the agent to be more trustworthy when it matched their
conversational style. Whereas, users with high involvement conversational
styles were indifferent. Finally, we provide design guidelines for multi-turn
dialogue interactions using conversational style adaptation.
","[{'version': 'v1', 'created': 'Thu, 4 Apr 2019 19:29:56 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Aug 2019 22:04:37 GMT'}]",2019-08-15,"[['Hoegen', 'Rens', ''], ['Aneja', 'Deepali', ''], ['McDuff', 'Daniel', ''], ['Czerwinski', 'Mary', '']]","['conversational agent', 'conversational style', 'dialogue', 'artificial intelligence']"
3877,1912.06172,Victor Costa,"Victor Costa, Nuno Louren\c{c}o and Penousal Machado",Coevolution of Generative Adversarial Networks,Published in EvoApplications 2019,,10.1007/978-3-030-16692-2_32,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generative adversarial networks (GAN) became a hot topic, presenting
impressive results in the field of computer vision. However, there are still
open problems with the GAN model, such as the training stability and the
hand-design of architectures. Neuroevolution is a technique that can be used to
provide the automatic design of network architectures even in large search
spaces as in deep neural networks. Therefore, this project proposes COEGAN, a
model that combines neuroevolution and coevolution in the coordination of the
GAN training algorithm. The proposal uses the adversarial characteristic
between the generator and discriminator components to design an algorithm using
coevolution techniques. Our proposal was evaluated in the MNIST dataset. The
results suggest the improvement of the training stability and the automatic
discovery of efficient network architectures for GANs. Our model also partially
solves the mode collapse problem.
","[{'version': 'v1', 'created': 'Thu, 12 Dec 2019 19:29:09 GMT'}]",2019-12-16,"[['Costa', 'Victor', ''], ['Lourenço', 'Nuno', ''], ['Machado', 'Penousal', '']]","['neuroevolution', 'coevolution', 'generative adversarial networks']"
3878,1907.07055,Szymon Talaga,"Szymon Talaga, Andrzej Nowak","Homophily as a Process Generating Social Networks: Insights from Social
  Distance Attachment Model","22 pages; 11 figures. Published version. Introduction, theory and
  discussion differ somewhat from the earlier preprint versions","Journal of Artificial Societies and Social Simulation, 23(2) 6,
  2020",10.18564/jasss.4252,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real-world social networks often exhibit high levels of clustering, positive
degree assortativity, short average path lengths (small-world property) and
right-skewed but rarely power law degree distributions. On the other hand
homophily, defined as the propensity of similar agents to connect to each
other, is one of the most fundamental social processes observed in many human
and animal societies. In this paper we examine the extent to which homophily is
sufficient to produce the typical structural properties of social networks. To
do so, we conduct a simulation study based on the Social Distance Attachment
(SDA) model, a particular kind of Random Geometric Graph (RGG), in which nodes
are embedded in a social space and connection probabilities depend functionally
on distances between nodes. We derive the form of the model from first
principles based on existing analytical results and argue that the mathematical
construction of RGGs corresponds directly to the homophily principle, so they
provide a good model for it. We find that homophily, especially when combined
with a random edge rewiring, is sufficient to reproduce many of the
characteristic features of social networks. Additionally, we devise a hybrid
model combining SDA with the configuration model that allows generating
homophilic networks with arbitrary degree sequences and we use it to study
interactions of homophily with processes imposing constraints on degree
distributions. We show that the effects of homophily on clustering are robust
with respect to distribution constraints, while degree assortativity can be
highly dependent on the particular kind of enforced degree sequence.
","[{'version': 'v1', 'created': 'Tue, 16 Jul 2019 15:12:04 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Jul 2019 00:34:45 GMT'}, {'version': 'v3', 'created': 'Thu, 2 Apr 2020 13:08:36 GMT'}]",2020-04-03,"[['Talaga', 'Szymon', ''], ['Nowak', 'Andrzej', '']]","['social networks', 'homophily', 'social distance attachment', 'configuration model']"
3879,1310.0307,Nikola Bani\'c,Nikola Bani\'c and Sven Lon\v{c}ari\'c,"Using the Random Sprays Retinex Algorithm for Global Illumination
  Estimation","Part of the Proceedings of the Croatian Computer Vision Workshop,
  CCVW 2013, Year 1",,10.1109/LSP.2013.2285960,UniZg-CRV-CCVW/2013/0010,cs.CV,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper the use of Random Sprays Retinex (RSR) algorithm for global
illumination estimation is proposed and its feasibility tested. Like other
algorithms based on the Retinex model, RSR also provides local illumination
estimation and brightness adjustment for each pixel and it is faster than other
path-wise Retinex algorithms. As the assumption of the uniform illumination
holds in many cases, it should be possible to use the mean of local
illumination estimations of RSR as a global illumination estimation for images
with (assumed) uniform illumination allowing also the accuracy to be easily
measured. Therefore we propose a method for estimating global illumination
estimation based on local RSR results. To our best knowledge this is the first
time that RSR algorithm is used to obtain global illumination estimation. For
our tests we use a publicly available color constancy image database for
testing. The results are presented and discussed and it turns out that the
proposed method outperforms many existing unsupervised color constancy
algorithms. The source code is available at
http://www.fer.unizg.hr/ipg/resources/color_constancy/.
","[{'version': 'v1', 'created': 'Tue, 1 Oct 2013 14:13:24 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Oct 2013 13:11:27 GMT'}]",2015-06-17,"[['Banić', 'Nikola', ''], ['Lončarić', 'Sven', '']]","['white balance', 'color constancy', 'Retinex', 'RandomSprays Retinex', 'sampling']"
3880,1803.04715,Nghi Bui,"Nghi D. Q. Bui, Lingxiao Jiang","Hierarchical Learning of Cross-Language Mappings through Distributed
  Vector Representations for Code",Accepted at ICSE'18,,10.1145/3183399.3183427,,cs.LG cs.CL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Translating a program written in one programming language to another can be
useful for software development tasks that need functionality implementations
in different languages. Although past studies have considered this problem,
they may be either specific to the language grammars, or specific to certain
kinds of code elements (e.g., tokens, phrases, API uses). This paper proposes a
new approach to automatically learn cross-language representations for various
kinds of structural code elements that may be used for program translation. Our
key idea is two folded: First, we normalize and enrich code token streams with
additional structural and semantic information, and train cross-language vector
representations for the tokens (a.k.a. shared embeddings based on word2vec, a
neural-network-based technique for producing word embeddings; Second,
hierarchically from bottom up, we construct shared embeddings for code elements
of higher levels of granularity (e.g., expressions, statements, methods) from
the embeddings for their constituents, and then build mappings among code
elements across languages based on similarities among embeddings.
  Our preliminary evaluations on about 40,000 Java and C# source files from 9
software projects show that our approach can automatically learn shared
embeddings for various code elements in different languages and identify their
cross-language mappings with reasonable Mean Average Precision scores. When
compared with an existing tool for mapping library API methods, our approach
identifies many more mappings accurately. The mapping results and code can be
accessed at
https://github.com/bdqnghi/hierarchical-programming-language-mapping. We
believe that our idea for learning cross-language vector representations with
code structural information can be a useful step towards automated program
translation.
","[{'version': 'v1', 'created': 'Tue, 13 Mar 2018 10:30:55 GMT'}]",2018-03-14,"[['Bui', 'Nghi D. Q.', ''], ['Jiang', 'Lingxiao', '']]","['software maintenance', 'language mapping', 'word2vec', 'syntactic structure', 'program translation']"
3881,1610.04065,Rainer Plaga,"Alexander Spenke, Ralph Breithaupt, and Rainer Plaga",An arbiter PUF secured by remote random reconfigurations of an FPGA,,"Franz, Papadimitratos (Eds.): Trust and Trustworthy Computing. 9th
  International Conference, TRUST 2016, Vienna, Austria, August 29-30, 2016,
  Proceedings. Lecture Notes in Computer Science, Vol. 9824, p. 140 - 158",10.1007/978-3-319-45572-3_8,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a practical and highly secure method for the authentication of
chips based on a new concept for implementing strong Physical Unclonable
Function (PUF) on field programmable gate arrays (FPGA). Its qualitatively
novel feature is a remote reconfiguration in which the delay stages of the PUF
are arranged to a random pattern within a subset of the FPGA's gates. Before
the reconfiguration is performed during authentication the PUF simply does not
exist. Hence even if an attacker has the chip under control previously she can
gain no useful information about the PUF. This feature, together with a strict
renunciation of any error correction and challenge selection criteria that
depend on individual properties of the PUF that goes into the field make our
strong PUF construction immune to all machine learning attacks presented in the
literature. More sophisticated attacks on our strong-PUF construction will be
difficult, because they require the attacker to learn or directly measure the
properties of the complete FPGA. A fully functional reference implementation
for a secure ""chip biometrics"" is presented. We remotely configure ten 64-stage
arbiter PUFs out of 1428 lookup tables within a time of 25 seconds and then
receive one ""fingerprint"" from each PUF within 1 msec.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2016 11:50:08 GMT'}]",2016-10-14,"[['Spenke', 'Alexander', ''], ['Breithaupt', 'Ralph', ''], ['Plaga', 'Rainer', '']]","['Strong Physical Unclonable functions (PUFs)', 'Biometricsof chips', 'Silicon Biometrics', 'Field programmable gate arrays']"
3882,2102.06025,Liuyihan Song,"Liuyihan Song and Pan Pan and Kang Zhao and Hao Yang and Yiming Chen
  and Yingya Zhang and Yinghui Xu and Rong Jin",Large-Scale Training System for 100-Million Classification at Alibaba,"Accepted by KDD 2020. In Proceedings of the 26th ACM SIGKDD
  International Conference on Knowledge Discovery & Data Mining (2020)",,10.1145/3394486.3403342,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last decades, extreme classification has become an essential topic for
deep learning. It has achieved great success in many areas, especially in
computer vision and natural language processing (NLP). However, it is very
challenging to train a deep model with millions of classes due to the memory
and computation explosion in the last output layer. In this paper, we propose a
large-scale training system to address these challenges. First, we build a
hybrid parallel training framework to make the training process feasible.
Second, we propose a novel softmax variation named KNN softmax, which reduces
both the GPU memory consumption and computation costs and improves the
throughput of training. Then, to eliminate the communication overhead, we
propose a new overlapping pipeline and a gradient sparsification method.
Furthermore, we design a fast continuous convergence strategy to reduce total
training iterations by adaptively adjusting learning rate and updating model
parameters. With the help of all the proposed methods, we gain 3.9$\times$
throughput of our training system and reduce almost 60\% of training
iterations. The experimental results show that using an in-house 256 GPUs
cluster, we could train a classifier of 100 million classes on Alibaba Retail
Product Dataset in about five days while achieving a comparable accuracy with
the naive softmax training process.
","[{'version': 'v1', 'created': 'Tue, 9 Feb 2021 06:53:31 GMT'}]",2021-02-12,"[['Song', 'Liuyihan', ''], ['Pan', 'Pan', ''], ['Zhao', 'Kang', ''], ['Yang', 'Hao', ''], ['Chen', 'Yiming', ''], ['Zhang', 'Yingya', ''], ['Xu', 'Yinghui', ''], ['Jin', 'Rong', '']]","['Extreme Classification', 'Distributed Deep Learning', 'KNN Softmax', 'Communication Optimization', 'Fast Convergence']"
3883,1701.08119,David H. Lorenz,"David H. Lorenz (Open University of Israel, Israel), Boaz Rosenan
  (University of Haifa, Israel)","Application Embedding: A Language Approach to Declarative Web
  Programming","The Art, Science, and Engineering of Programming, Vol. 1, Issue 1,
  Article 2","The Art, Science, and Engineering of Programming, 2017, Vol. 1,
  Issue 1, Article 2",10.22152/programming-journal.org/2017/1/2,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since the early days of the Web, web application developers have aspired to
develop much of their applications declaratively. However, one aspect of the
application, namely its business-logic is constantly left imperative. In this
work we present Application Embedding, a novel approach to application
development which allows all aspects of an application, including its
business-logic, to be programmed declaratively.
  We develop this approach in a two-step process. First, we draw a mapping
between web applications and Domain-Specific Languages (DSLs). Second, we note
that out of the two methods for implementing DSLs, namely as either internal or
external, most traditional web applications correspond to external DSLs, while
the the technique that corresponds to DSL embedding (implementing internal
DSLs) is left mostly unexplored.
  By projecting the well-known technique of DSL embedding onto web
applications, we derive a novel technique--Application Embedding. Application
embedding offers a separation of code assets that encourages reuse of
imperative code, while keeping all application-specific assets, including those
specifying its business- logic, declarative.
  As validation, we implemented a simple, though nontrivial web application
using the proposed separation of assets. This implementation includes an
application-agnostic imperative host application named FishTank, intended to be
applicable for a wide variety of web applications, and a declarative definition
of the different aspects of the specific application, intended to be loaded on
that host.
  Our method of separation of code assets facilitates a better separation of
work, in comparison to traditional methods. By this separation, host
application developers can focus mostly on the extra-functional aspects of a
web application, namely on improving performance, scalability, and
availability, while developers of an embedded application can focus on the
functional aspects of their application, without worrying about extra-
functional concerns. The reusability of the host application makes the effort
put into a better implementation cost-effective, since it can benefit all
applications built on top of it.
","[{'version': 'v1', 'created': 'Fri, 27 Jan 2017 17:11:59 GMT'}]",2017-03-02,"[['Lorenz', 'David H.', '', 'Open University of Israel, Israel'], ['Rosenan', 'Boaz', '', 'University of Haifa, Israel']]","['Domain-specific languages (DSLs)', 'Logic programming (LP)', 'Web application']"
3884,1312.2873,Vissarion Fisikopoulos,"Ioannis Z. Emiris, Vissarion Fisikopoulos",Efficient Random-Walk Methods for Approximating Polytope Volume,"15 pages, 2 figures, 8 tables, in Proc. of SoCG'14",ACM Transactions on Mathematical Software 2018,10.1145/3194656,,cs.CG cs.MS,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We experimentally study the fundamental problem of computing the volume of a
convex polytope given as an intersection of linear inequalities. We implement
and evaluate practical randomized algorithms for accurately approximating the
polytope's volume in high dimensions (e.g. one hundred). To carry out this
efficiently we experimentally correlate the effect of parameters, such as
random walk length and number of sample points, on accuracy and runtime.
Moreover, we exploit the problem's geometry by implementing an iterative
rounding procedure, computing partial generations of random points and
designing fast polytope boundary oracles. Our publicly available code is
significantly faster than exact computation and more accurate than existing
approximation methods. We provide volume approximations for the Birkhoff
polytopes B_11,...,B_15, whereas exact methods have only computed that of B_10.
","[{'version': 'v1', 'created': 'Tue, 10 Dec 2013 16:58:04 GMT'}, {'version': 'v2', 'created': 'Sat, 29 Mar 2014 11:37:07 GMT'}]",2021-04-26,"[['Emiris', 'Ioannis Z.', ''], ['Fisikopoulos', 'Vissarion', '']]","['volume approximation', 'general dimension', 'random walk', 'polytope oracle', 'algorithm engineering', 'ray shooting']"
3885,1610.03761,Shehroz Khan,"Shehroz S. Khan, Babak Taati","Detecting Unseen Falls from Wearable Devices using Channel-wise Ensemble
  of Autoencoders","25 pages, 6 figures, 4 Tables","Expert Systems with Applications, Volume 87, 30 November 2017,
  Pages 280-290",10.1016/j.eswa.2017.06.011,,cs.CV cs.AI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A fall is an abnormal activity that occurs rarely, so it is hard to collect
real data for falls. It is, therefore, difficult to use supervised learning
methods to automatically detect falls. Another challenge in using machine
learning methods to automatically detect falls is the choice of engineered
features. In this paper, we propose to use an ensemble of autoencoders to
extract features from different channels of wearable sensor data trained only
on normal activities. We show that the traditional approach of choosing a
threshold as the maximum of the reconstruction error on the training normal
data is not the right way to identify unseen falls. We propose two methods for
automatic tightening of reconstruction error from only the normal activities
for better identification of unseen falls. We present our results on two
activity recognition datasets and show the efficacy of our proposed method
against traditional autoencoder models and two standard one-class
classification methods.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2016 15:55:06 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Oct 2016 18:00:04 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Mar 2017 20:51:59 GMT'}]",2018-02-07,"[['Khan', 'Shehroz S.', ''], ['Taati', 'Babak', '']]","['fall detection', 'one-class classification', 'autoencoders', 'anomalydetection']"
3886,1801.01443,Wellington Pinheiro dos Santos,"Filipe Rolim Cordeiro, Wellington Pinheiro dos Santos, Abel
  Guilhermino da Silva Filho","A semi-supervised fuzzy GrowCut algorithm to segment and classify
  regions of interest of mammographic images",,"Expert Systems With Applications, 65 (2016), 116-126",10.1016/j.eswa.2016.08.016,,cs.CV cs.AI cs.IR cs.NE eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  According to the World Health Organization, breast cancer is the most common
form of cancer in women. It is the second leading cause of death among women
round the world, becoming the most fatal form of cancer. Mammographic image
segmentation is a fundamental task to support image analysis and diagnosis,
taking into account shape analysis of mammary lesions and their borders.
However, mammogram segmentation is a very hard process, once it is highly
dependent on the types of mammary tissues. In this work we present a new
semi-supervised segmentation algorithm based on the modification of the GrowCut
algorithm to perform automatic mammographic image segmentation once a region of
interest is selected by a specialist. In our proposal, we used fuzzy Gaussian
membership functions to modify the evolution rule of the original GrowCut
algorithm, in order to estimate the uncertainty of a pixel being object or
background. The main impact of the proposed method is the significant reduction
of expert effort in the initialization of seed points of GrowCut to perform
accurate segmentation, once it removes the need of selection of background
seeds. We also constructed an automatic point selection process based on the
simulated annealing optimization method, avoiding the need of human
intervention. The proposed approach was qualitatively compared with other
state-of-the-art segmentation techniques, considering the shape of segmented
regions. In order to validate our proposal, we built an image classifier using
a classical multilayer perceptron. We used Zernike moments to extract segmented
image features. This analysis employed 685 mammograms from IRMA breast cancer
database, using fat and fibroid tissues. Results show that the proposed
technique could achieve a classification rate of 91.28\% for fat tissues,
evidencing the feasibility of our approach.
","[{'version': 'v1', 'created': 'Sun, 3 Dec 2017 17:31:01 GMT'}]",2018-01-08,"[['Cordeiro', 'Filipe Rolim', ''], ['Santos', 'Wellington Pinheiro dos', ''], ['Filho', 'Abel Guilhermino da Silva', '']]","['breast cancer', 'mammographic image analysis', 'semi-supervised']"
3887,1405.6773,Taejun Park,"Dongmyoung Kim, Taejun Park, Hyoil Kim, and Sunghyun Choi","Load Balancing in Two-Tier Cellular Networks with Open and Hybrid Access
  Femtocells","17 pages, The shorter version is submitted to IEEE/ACM Transactions
  on Networking",,10.1109/TNET.2016.2527835,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Femtocell base station (BS) is a low-power, low-price BS based on cellular
communication technology. It is expected to become a cost-effective solution
for improving the communication performance of indoor users, whose traffic
demands are large in general. There are mainly three access strategies for
femtocell, i.e., closed access, open access and hybrid access strategies. While
it has been generally known that open/hybrid access femtocells contribute more
to enhancing the system-wide performance than closed access femtocells, the
operating parameters of both macro and femtocells should be carefully chosen
according to the mobile operator's policy, consumer's requirements, and so on.
We propose long-term parameter optimization schemes, which maximize the average
throughput of macrocell users while guaranteeing some degree of benefits to
femtocell owners. To achieve this goal, we jointly optimize the ratio of
dedicated resources for femtocells as well as the femtocell service area in
open access femtocell networks through the numerical analysis. It is proved
that the optimal parameter selection of open access femtocell is a convex
optimization problem in typical environments. Then, we extend our algorithm to
hybrid access femtocells where some intra-femtocell resources are dedicated
only for femtocell owners while remaining resources are shared with foreign
macrocell users. Our evaluation results show that the proposed parameter
optimization schemes significantly enhance the performance of macrocell users
thanks to the large offloading gain. The benefits provided to femtocell users
are also adaptively maintained according to the femtocell users' requirements.
The results in this paper provide insights about the situations where femtocell
deployment on dedicated channels is preferred to the co-channel deployment.
","[{'version': 'v1', 'created': 'Tue, 27 May 2014 02:37:50 GMT'}]",2016-11-18,"[['Kim', 'Dongmyoung', ''], ['Park', 'Taejun', ''], ['Kim', 'Hyoil', ''], ['Choi', 'Sunghyun', '']]","['Femtocell', 'two-tier cellular networks', 'load balancing', 'coverage control']"
3888,1409.3176,Jifeng Xuan,"Jifeng Xuan (INRIA Lille - Nord Europe), Martin Monperrus (INRIA Lille
  - Nord Europe)",Test Case Purification for Improving Fault Localization,,"FSE - 22nd ACM SIGSOFT International Symposium on the Foundations
  of Software Engineering (2014)",10.1145/2635868.2635906,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finding and fixing bugs are time-consuming activities in software
development. Spectrum-based fault localization aims to identify the faulty
position in source code based on the execution trace of test cases. Failing
test cases and their assertions form test oracles for the failing behavior of
the system under analysis. In this paper, we propose a novel concept of
spectrum driven test case purification for improving fault localization. The
goal of test case purification is to separate existing test cases into small
fractions (called purified test cases) and to enhance the test oracles to
further localize faults. Combining with an original fault localization
technique (e.g., Tarantula), test case purification results in better ranking
the program statements. Our experiments on 1800 faults in six open-source Java
programs show that test case purification can effectively improve existing
fault localization techniques.
","[{'version': 'v1', 'created': 'Wed, 10 Sep 2014 18:28:53 GMT'}]",2018-07-06,"[['Xuan', 'Jifeng', '', 'INRIA Lille - Nord Europe'], ['Monperrus', 'Martin', '', 'INRIA Lille\n  - Nord Europe']]","['Test case purification', 'spectrum-based fault localization', 'testcase atomization', 'dynamic program slicing']"
3889,1312.0127,Kim Bauters,"Kim Bauters, Steven Schockaert, Martine De Cock, Dirk Vermeir","Characterizing and Extending Answer Set Semantics using Possibility
  Theory","39 pages and 16 pages appendix with proofs. This article has been
  accepted for publication in Theory and Practice of Logic Programming,
  Copyright Cambridge University Press",Theory and Practice of Logic Programming 15 (2015) 79-116,10.1017/S147106841300063X,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Answer Set Programming (ASP) is a popular framework for modeling
combinatorial problems. However, ASP cannot easily be used for reasoning about
uncertain information. Possibilistic ASP (PASP) is an extension of ASP that
combines possibilistic logic and ASP. In PASP a weight is associated with each
rule, where this weight is interpreted as the certainty with which the
conclusion can be established when the body is known to hold. As such, it
allows us to model and reason about uncertain information in an intuitive way.
In this paper we present new semantics for PASP, in which rules are interpreted
as constraints on possibility distributions. Special models of these
constraints are then identified as possibilistic answer sets. In addition,
since ASP is a special case of PASP in which all the rules are entirely
certain, we obtain a new characterization of ASP in terms of constraints on
possibility distributions. This allows us to uncover a new form of disjunction,
called weak disjunction, that has not been previously considered in the
literature. In addition to introducing and motivating the semantics of weak
disjunction, we also pinpoint its computational complexity. In particular,
while the complexity of most reasoning tasks coincides with standard
disjunctive ASP, we find that brave reasoning for programs with weak
disjunctions is easier.
","[{'version': 'v1', 'created': 'Sat, 30 Nov 2013 17:12:48 GMT'}]",2020-02-19,"[['Bauters', 'Kim', ''], ['Schockaert', 'Steven', ''], ['De Cock', 'Martine', ''], ['Vermeir', 'Dirk', '']]","['logic programming', 'answer set programming', 'possibility theory']"
3890,1008.0201,Sanja Singer,"Sanja Singer, Sasa Singer, Vedran Novakovic, Aleksandar Uscumlic and
  Vedran Dunjko",Novel Modifications of Parallel Jacobi Algorithms,Accepted for publication in Numerical Algorithms,Numer. Algorithms 59 (2012) 1-27,10.1007/s11075-011-9473-6,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe two main classes of one-sided trigonometric and hyperbolic
Jacobi-type algorithms for computing eigenvalues and eigenvectors of Hermitian
matrices. These types of algorithms exhibit significant advantages over many
other eigenvalue algorithms. If the matrices permit, both types of algorithms
compute the eigenvalues and eigenvectors with high relative accuracy.
  We present novel parallelization techniques for both trigonometric and
hyperbolic classes of algorithms, as well as some new ideas on how pivoting in
each cycle of the algorithm can improve the speed of the parallel one-sided
algorithms. These parallelization approaches are applicable to both
distributed-memory and shared-memory machines.
  The numerical testing performed indicates that the hyperbolic algorithms may
be superior to the trigonometric ones, although, in theory, the latter seem
more natural.
","[{'version': 'v1', 'created': 'Sun, 1 Aug 2010 19:21:45 GMT'}, {'version': 'v2', 'created': 'Tue, 17 May 2011 20:10:44 GMT'}]",2020-03-18,"[['Singer', 'Sanja', ''], ['Singer', 'Sasa', ''], ['Novakovic', 'Vedran', ''], ['Uscumlic', 'Aleksandar', ''], ['Dunjko', 'Vedran', '']]","['Hermitian matrices', 'eigenvalues', 'Jacobi algorithm', 'parallelization']"
3891,1408.5699,Bernhard Rumpe,"Andreas Ganser, Horst Lichter, Alexander Roth, Bernhard Rumpe",Proactive Quality Guidance for Model Evolution in Model Libraries,"10 pages, figures. Appears in Models and Evolution Workshop
  Proceedings of the ACM/IEEE 16th International Conference on Model Driven
  Engineering Languages and Systems, Miami, Florida (USA), September 30, 2013",,10.1007/s11219-015-9298-y,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Model evolution in model libraries differs from general model evolution. It
limits the scope to the manageable and allows to develop clear concepts,
approaches, solutions, and methodologies. Looking at model quality in evolving
model libraries, we focus on quality concerns related to reusability. In this
paper, we put forward our proactive quality guidance approach for model
evolution in model libraries. It uses an editing-time assessment linked to a
lightweight quality model, corresponding metrics, and simplified reviews. All
of which help to guide model evolution by means of quality gates fostering
model reusability.
","[{'version': 'v1', 'created': 'Mon, 25 Aug 2014 09:34:50 GMT'}]",2016-11-17,"[['Ganser', 'Andreas', ''], ['Lichter', 'Horst', ''], ['Roth', 'Alexander', ''], ['Rumpe', 'Bernhard', '']]","['Model Evolution', 'Model Quality', 'Model Libraries']"
3892,2210.09802,Xiaoyu Fan,"Xiaoyu Fan, Kun Chen, Guosai Wang, Mingchun Zhuang, Yi Li and Wei Xu","NFGen: Automatic Non-linear Function Evaluation Code Generator for
  General-purpose MPC Platforms","20 pages, full version of CCS22 paper","CCS '22, Proceedings of the 2022 ACM SIGSAC Conference on Computer
  and Communications Security, November 7--11, 2022, Los Angeles, CA, USA",10.1145/3548606.3560565,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Due to the absence of a library for non-linear function evaluation, so-called
general-purpose secure multi-party computation (MPC) are not as ''general'' as
MPC programmers expect. Prior arts either naively reuse plaintext methods,
resulting in suboptimal performance and even incorrect results, or handcraft ad
hoc approximations for specific functions or platforms. We propose a general
technique, NFGen, that utilizes pre-computed discrete piecewise polynomials to
accurately approximate generic functions using fixed-point numbers. We
implement it using a performance-prediction-based code generator to support
different platforms. Conducting extensive evaluations of 23 non-linear
functions against six MPC protocols on two platforms, we demonstrate
significant performance, accuracy, and generality improvements over existing
methods.
","[{'version': 'v1', 'created': 'Tue, 18 Oct 2022 12:25:22 GMT'}]",2022-10-19,"[['Fan', 'Xiaoyu', ''], ['Chen', 'Kun', ''], ['Wang', 'Guosai', ''], ['Zhuang', 'Mingchun', ''], ['Li', 'Yi', ''], ['Xu', 'Wei', '']]","['Secure Multi-Party Computation (MPC)', 'Non-linear Function Evaluation', 'Automatic Code Generation']"
3893,1901.04325,Philipp Krause,Isolde Adler and Philipp Klaus Krause,A lower bound on the tree-width of graphs with irrelevant vertices,,,10.1016/j.jctb.2018.12.008,,cs.DM math.CO,http://creativecommons.org/licenses/by-sa/4.0/,"  For their famous algorithm for the disjoint paths problem, Robertson and
Seymour proved that there is a function $f$ such that if the tree-width of a
graph $G$ with $k$ pairs of terminals is at least $f(k)$, then $G$ contains a
solution-irrelevant vertex (Graph Minors. XXII., JCTB 2012). We give a
single-exponential lower bound on $f$. This bound even holds for planar graphs.
","[{'version': 'v1', 'created': 'Mon, 14 Jan 2019 14:00:22 GMT'}]",2019-01-15,"[['Adler', 'Isolde', ''], ['Krause', 'Philipp Klaus', '']]","['disjoint paths problem', 'irrelevant vertex', 'vital linkage', 'uniquelinkage', 'planar graph', 'tree-width']"
3894,1805.02399,Nilavra Bhattacharya,"Nilavra Bhattacharya, Jacek Gwizdka",Relating Eye-Tracking Measures With Changes In Knowledge on Search Tasks,"ACM Symposium on Eye Tracking Research and Applications (ETRA), June
  14-17, 2018, Warsaw, Poland","Proceedings of the 2018 ACM Symposium on Eye Tracking Research &
  Applications",10.1145/3204493.3204579,,cs.HC cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We conducted an eye-tracking study where 30 participants performed searches
on the web. We measured their topical knowledge before and after each task.
Their eye-fixations were labelled as ""reading"" or ""scanning"". The series of
reading fixations in a line, called ""reading-sequences"" were characterized by
their length in pixels, fixation duration, and the number of fixations making
up the sequence. We hypothesize that differences in knowledge-change of
participants are reflected in their eye-tracking measures related to reading.
Our results show that the participants with higher change in knowledge differ
significantly in terms of their total reading-sequence-length,
reading-sequence-duration, and number of reading fixations, when compared to
participants with lower knowledge-change.
","[{'version': 'v1', 'created': 'Mon, 7 May 2018 08:33:59 GMT'}]",2019-08-16,"[['Bhattacharya', 'Nilavra', ''], ['Gwizdka', 'Jacek', '']]","['eye-tracking', 'knowledge assessment', 'search as learning']"
3895,1907.07367,Zekun Ye,"Zekun Ye, Yunqi Huang, Lvzhou Li, Yuyi Wang",Query complexity of generalized Simon's problem,,"Information and Computation, 104790 (2021)",10.1016/j.ic.2021.104790,,cs.CC,http://creativecommons.org/licenses/by/4.0/,"  Simon's problem plays an important role in the history of quantum algorithms,
as it inspired Shor to discover the celebrated quantum algorithm solving
integer factorization in polynomial time. Besides, the quantum algorithm for
Simon's problem has been recently applied to break symmetric cryptosystems.
Generalized Simon's problem, denoted by $\mathsf{GSP}(p,n,k)$, is a natural
extension of Simon's problem. In this paper we consider the query complexity of
$\mathsf{GSP}(p,n,k)$. First, it is not difficult to design a quantum algorithm
solving the above problem with query complexity of $O(n-k)$. However, so far it
is not clear what is the classical query complexity of the problem, and
revealing this complexity is necessary for clarifying the computational power
gap between quantum and classical computing on the problem.
  To tackle this problem, we prove that any classical (deterministic or
randomized) algorithm for $\mathsf{GSP}(p,n,k)$ has to query at least
$\Omega\left(\max\{k, \sqrt{p^{n-k}}\}\right)$ values and any classical
nonadaptive deterministic algorithm for $\mathsf{GSP}(p,n,k)$ has to query at
least $\Omega\left(\max\{k, \sqrt{k \cdot p^{n-k}}\}\right)$ values. Hence, we
clearly show the classical computing model is less powerful than the quantum
counterpart, in terms of query complexity for the generalized Simon's problem.
Moreover, we obtain an upper bound $O\left(\max\{k, \sqrt{k \cdot
p^{n-k}}\}\right)$ on the classical deterministic query complexity of
$\mathsf{GSP}(p,n,k)$, by devising a subtle classical algorithm based on group
theory and the divide-and-conquer approach. Therefore, we have an almost full
characterization of the classical deterministic query complexity of the
generalized Simon's problem.
","[{'version': 'v1', 'created': 'Wed, 17 Jul 2019 07:40:27 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Jul 2019 07:17:42 GMT'}, {'version': 'v3', 'created': 'Thu, 2 Jan 2020 12:23:56 GMT'}, {'version': 'v4', 'created': 'Mon, 3 May 2021 14:19:04 GMT'}, {'version': 'v5', 'created': 'Mon, 16 Aug 2021 02:23:08 GMT'}, {'version': 'v6', 'created': 'Sat, 4 Sep 2021 01:51:11 GMT'}]",2021-09-07,"[['Ye', 'Zekun', ''], ['Huang', 'Yunqi', ''], ['Li', 'Lvzhou', ''], ['Wang', 'Yuyi', '']]","['Simon’s problem', 'query complexity', 'quantum computing', 'grouptheory']"
3896,2102.10532,Michael Maher,Michael J. Maher,Relative Expressiveness of Defeasible Logics II,Includes extensive appendix,"Theory and Practice of Logic Programming 13(4-5): 579-592, 2013",10.1017/S1471068413000367,,cs.LO cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  (Maher 2012) introduced an approach for relative expressiveness of defeasible
logics, and two notions of relative expressiveness were investigated. Using the
first of these definitions of relative expressiveness, we show that all the
defeasible logics in the DL framework are equally expressive under this
formulation of relative expressiveness. The second formulation of relative
expressiveness is stronger than the first. However, we show that logics
incorporating individual defeat are equally expressive as the corresponding
logics with team defeat. Thus the only differences in expressiveness of logics
in DL arise from differences in how ambiguity is handled. This completes the
study of relative expressiveness in DL begun in \cite{Maher12}.
","[{'version': 'v1', 'created': 'Sun, 21 Feb 2021 07:01:50 GMT'}]",2021-02-23,"[['Maher', 'Michael J.', '']]","['defeasible logic', 'non-monotonic reasoning', 'relative expressiveness']"
3897,1808.05322,Thierry Denoeux,Thierry Denoeux,Decision-Making with Belief Functions: a Review,,"International Journal of Approximate Reasoning, vol. 109, Pages
  87-110, 2019",10.1016/j.ijar.2019.03.009,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Approaches to decision-making under uncertainty in the belief function
framework are reviewed. Most methods are shown to blend criteria for decision
under ignorance with the maximum expected utility principle of Bayesian
decision theory. A distinction is made between methods that construct a
complete preference relation among acts, and those that allow incomparability
of some acts due to lack of information. Methods developed in the imprecise
probability framework are applicable in the Dempster-Shafer context and are
also reviewed. Shafer's constructive decision theory, which substitutes the
notion of goal for that of utility, is described and contrasted with other
approaches. The paper ends by pointing out the need to carry out deeper
investigation of fundamental issues related to decision-making with belief
functions and to assess the descriptive, normative and prescriptive values of
the different approaches.
","[{'version': 'v1', 'created': 'Thu, 16 Aug 2018 01:52:46 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Dec 2019 08:02:05 GMT'}]",2019-12-13,"[['Denoeux', 'Thierry', '']]","['Dempster-Shafer theory', 'evidence theory', 'decision under uncertainty']"
3898,2102.09670,Tao Yang,Tao Yang and Qingyao Ai,Maximizing Marginal Fairness for Dynamic Learning to Rank,"10 pages, 7 figures",,10.1145/3442381.3449901,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Rankings, especially those in search and recommendation systems, often
determine how people access information and how information is exposed to
people. Therefore, how to balance the relevance and fairness of information
exposure is considered as one of the key problems for modern IR systems. As
conventional ranking frameworks that myopically sorts documents with their
relevance will inevitably introduce unfair result exposure, recent studies on
ranking fairness mostly focus on dynamic ranking paradigms where result
rankings can be adapted in real-time to support fairness in groups (i.e.,
races, genders, etc.). Existing studies on fairness in dynamic learning to
rank, however, often achieve the overall fairness of document exposure in
ranked lists by significantly sacrificing the performance of result relevance
and fairness on the top results. To address this problem, we propose a fair and
unbiased ranking method named Maximal Marginal Fairness (MMF). The algorithm
integrates unbiased estimators for both relevance and merit-based fairness
while providing an explicit controller that balances the selection of documents
to maximize the marginal relevance and fairness in top-k results. Theoretical
and empirical analysis shows that, with small compromises on long list
fairness, our method achieves superior efficiency and effectiveness comparing
to the state-of-the-art algorithms in both relevance and fairness for top-k
rankings.
","[{'version': 'v1', 'created': 'Thu, 18 Feb 2021 23:34:04 GMT'}]",2021-02-22,"[['Yang', 'Tao', ''], ['Ai', 'Qingyao', '']]","['Learning to Rank', 'Ranking Fairness', 'Unbiased Learning']"
3899,1902.10247,Hadi Zare,"Kayvan Bijari, Hadi Zare, Emad Kebriaei, Hadi Veisi","Leveraging Deep Graph-Based Text Representation for Sentiment Polarity
  Applications","33 pages, 6 figures, 6 Tables, Accepted for publication in Expert
  Systems With Applications Journal","Expert Systems with Applications Volume 144, 15 April 2020, 113090",10.1016/j.eswa.2019.113090,,cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the last few years, machine learning over graph structures has
manifested a significant enhancement in text mining applications such as event
detection, opinion mining, and news recommendation. One of the primary
challenges in this regard is structuring a graph that encodes and encompasses
the features of textual data for the effective machine learning algorithm.
Besides, exploration and exploiting of semantic relations is regarded as a
principal step in text mining applications. However, most of the traditional
text mining methods perform somewhat poor in terms of employing such relations.
In this paper, we propose a sentence-level graph-based text representation
which includes stop words to consider semantic and term relations. Then, we
employ a representation learning approach on the combined graphs of sentences
to extract the latent and continuous features of the documents. Eventually, the
learned features of the documents are fed into a deep neural network for the
sentiment classification task. The experimental results demonstrate that the
proposed method substantially outperforms the related sentiment analysis
approaches based on several benchmark datasets. Furthermore, our method can be
generalized on different datasets without any dependency on pre-trained word
embeddings.
","[{'version': 'v1', 'created': 'Sat, 23 Feb 2019 16:38:35 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Aug 2019 12:25:14 GMT'}, {'version': 'v3', 'created': 'Fri, 15 Nov 2019 07:45:35 GMT'}]",2019-11-26,"[['Bijari', 'Kayvan', ''], ['Zare', 'Hadi', ''], ['Kebriaei', 'Emad', ''], ['Veisi', 'Hadi', '']]","['Sentiment Analysis', 'Graph Representation', 'Representation']"
3900,1502.04823,Hui Zhang,"Hui Zhang, Kiduk Yang, Elin Jacob",Topic Level Disambiguation for Weak Queries,,"Journal of Information Science Theory and Practice, 1(3), 33-46",10.1633/JISTaP.2013.1.3.3,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite limited success, information retrieval (IR) systems today are not
intelligent or reliable. IR systems return poor search results when users
formulate their information needs into incomplete or ambiguous queries (i.e.,
weak queries). Therefore, one of the main challenges in modern IR research is
to provide consistent results across all queries by improving the performance
on weak queries. However, existing IR approaches such as query expansion are
not overly effective because they make little effort to analyze and exploit the
meanings of the queries. Furthermore, word sense disambiguation approaches,
which rely on textual context, are ineffective against weak queries that are
typically short. Motivated by the demand for a robust IR system that can
consistently provide highly accurate results, the proposed study implemented a
novel topic detection that leveraged both the language model and structural
knowledge of Wikipedia and systematically evaluated the effect of query
disambiguation and topic-based retrieval approaches on TREC collections. The
results not only confirm the effectiveness of the proposed topic detection and
topic-based retrieval approaches but also demonstrate that query disambiguation
does not improve IR as expected.
","[{'version': 'v1', 'created': 'Tue, 17 Feb 2015 08:14:51 GMT'}]",2015-02-18,"[['Zhang', 'Hui', ''], ['Yang', 'Kiduk', ''], ['Jacob', 'Elin', '']]","['Topic Detection', 'Query Disambiguation', 'Language Model', 'Information Retrieval', 'Natural LanguageProcessing']"
3901,1803.08426,Erick Lavoie,"Erick Lavoie, Laurie Hendren, Frederic Desprez, Miguel Correia",Pando: Personal Volunteer Computing in Browsers,"14 pages, 12 figures, 2 tables",,10.1145/3361525.3361539,,cs.DC,http://creativecommons.org/licenses/by-sa/4.0/,"  The large penetration and continued growth in ownership of personal
electronic devices represents a freely available and largely untapped source of
computing power. To leverage those, we present Pando, a new volunteer computing
tool based on a declarative concurrent programming model and implemented using
JavaScript, WebRTC, and WebSockets. This tool enables a dynamically varying
number of failure-prone personal devices contributed by volunteers to
parallelize the application of a function on a stream of values, by using the
devices' browsers. We show that Pando can provide throughput improvements
compared to a single personal device, on a variety of compute-bound
applications including animation rendering and image processing. We also show
the flexibility of our approach by deploying Pando on personal devices
connected over a local network, on Grid5000, a French-wide computing grid in a
virtual private network, and seven PlanetLab nodes distributed in a wide area
network over Europe.
","[{'version': 'v1', 'created': 'Thu, 22 Mar 2018 16:05:10 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Mar 2019 14:42:05 GMT'}, {'version': 'v3', 'created': 'Fri, 6 Sep 2019 12:31:57 GMT'}]",2021-04-16,"[['Lavoie', 'Erick', ''], ['Hendren', 'Laurie', ''], ['Desprez', 'Frederic', ''], ['Correia', 'Miguel', '']]","['Volunteer Computing', 'Personal Volunteer Computing', 'Web Technologies', 'JavaScript', 'WebRTC', 'WebSocket']"
3902,2105.07203,Grzegorz Kwasniewski,"Grzegorz Kwasniewski, Tal Ben-Nun, Lukas Gianinazzi, Alexandru
  Calotoiu, Timo Schneider, Alexandros Nikolaos Ziogas, Maciej Besta, Torsten
  Hoefler","Pebbles, Graphs, and a Pinch of Combinatorics: Towards Tight I/O Lower
  Bounds for Statically Analyzable Programs","13 pages, 4 figures, published at Proceedings of the 33rd ACM
  Symposium on Parallelism in Algorithms and Architectures (SPAA'21)",,10.1145/3409964.3461796,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Determining I/O lower bounds is a crucial step in obtaining
communication-efficient parallel algorithms, both across the memory hierarchy
and between processors. Current approaches either study specific algorithms
individually, disallow programmatic motifs such as recomputation, or produce
asymptotic bounds that exclude important constants. We propose a novel approach
for obtaining precise I/O lower bounds on a general class of programs, which we
call Simple Overlap Access Programs (SOAP). SOAP analysis covers a wide variety
of algorithms, from ubiquitous computational kernels to full scientific
computing applications. Using the red-blue pebble game and combinatorial
methods, we are able to bound the I/O of the SOAP-induced Computational
Directed Acyclic Graph (CDAG), taking into account multiple statements,
input/output reuse, and optimal tiling. To deal with programs that are outside
of our representation (e.g., non-injective access functions), we describe
methods to approximate them with SOAP. To demonstrate our method, we analyze 38
different applications, including kernels from the Polybench benchmark suite,
deep learning operators, and -- for the first time -- applications in
unstructured physics simulations, numerical weather prediction stencil
compositions, and full deep neural networks. We derive tight I/O bounds for
several linear algebra kernels, such as Cholesky decomposition, improving the
existing reported bounds by a factor of two. For stencil applications, we
improve the existing bounds by a factor of up to 14. We implement our method as
an open-source tool, which can derive lower bounds directly from provided C
code.
","[{'version': 'v1', 'created': 'Sat, 15 May 2021 11:35:00 GMT'}]",2021-05-18,"[['Kwasniewski', 'Grzegorz', ''], ['Ben-Nun', 'Tal', ''], ['Gianinazzi', 'Lukas', ''], ['Calotoiu', 'Alexandru', ''], ['Schneider', 'Timo', ''], ['Ziogas', 'Alexandros Nikolaos', ''], ['Besta', 'Maciej', ''], ['Hoefler', 'Torsten', '']]","['I/O complexity', 'red-blue pebble game', 'parallel scheduling model']"
3903,1305.4947,Arthur Carvalho,Arthur Carvalho and Aluizio F. R. Araujo,Improving NSGA-II with an Adaptive Mutation Operator,,,10.1145/1570256.1570387,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The performance of a Multiobjective Evolutionary Algorithm (MOEA) is
crucially dependent on the parameter setting of the operators. The most desired
control of such parameters presents the characteristic of adaptiveness, i.e.,
the capacity of changing the value of the parameter, in distinct stages of the
evolutionary process, using feedbacks from the search for determining the
direction and/or magnitude of changing. Given the great popularity of the
algorithm NSGA-II, the objective of this research is to create adaptive
controls for each parameter existing in this MOEA. With these controls, we
expect to improve even more the performance of the algorithm.
  In this work, we propose an adaptive mutation operator that has an adaptive
control which uses information about the diversity of candidate solutions for
controlling the magnitude of the mutation. A number of experiments considering
different problems suggest that this mutation operator improves the ability of
the NSGA-II for reaching the Pareto optimal Front and for getting a better
diversity among the final solutions.
","[{'version': 'v1', 'created': 'Tue, 21 May 2013 20:13:53 GMT'}]",2013-05-23,"[['Carvalho', 'Arthur', ''], ['Araujo', 'Aluizio F. R.', '']]","['Evolutionary Multiobjective Optimization', 'Parameter Control', 'Adaptive Mutation Operator']"
3904,1701.01960,Hiroki Okada,Hiroki Okada and Ken Umeno,"Randomness Evaluation with the Discrete Fourier Transform Test Based on
  Exact Analysis of the Reference Distribution","22 pages, 4 figures",,10.1109/TIFS.2017.2656473,T-IFS-06137-2016.R2,cs.CR stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the problems in the discrete Fourier transform (DFT)
test included in NIST SP 800-22 released by the National Institute of Standards
and Technology (NIST), which is a collection of tests for evaluating both
physical and pseudo-random number generators for cryptographic applications.
The most crucial problem in the DFT test is that its reference distribution of
the test statistic is not derived mathematically but rather numerically
estimated, the DFT test for randomness is based on a pseudo-random number
generator (PRNG). Therefore, the present DFT test should not be used unless the
reference distribution is mathematically derived. Here, we prove that a power
spectrum, which is a component of the test statistic, follows a chi-squared
distribution with 2 degrees of freedom. Based on this fact, we propose a test
whose reference distribution of the test statistic is mathematically derived.
Furthermore, the results of testing non-random sequences and several PRNGs
showed that the proposed test is more reliable and definitely more sensitive
than the present DFT test.
","[{'version': 'v1', 'created': 'Sun, 8 Jan 2017 14:02:52 GMT'}]",2018-03-08,"[['Okada', 'Hiroki', ''], ['Umeno', 'Ken', '']]","['Computer security', 'random sequences', 'statistical analysis']"
3905,1706.09172,Sebastian Baltes,Sebastian Baltes and Stephan Diehl,Sketches and Diagrams in Practice,"12 pages, 2 figures, Proceedings of the 22nd ACM SIGSOFT
  International Symposium on Foundations of Software Engineering (FSE 2014),
  ACM, 2014, pp. 530-541",,10.1145/2635868.2635891,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sketches and diagrams play an important role in the daily work of software
developers. In this paper, we investigate the use of sketches and diagrams in
software engineering practice. To this end, we used both quantitative and
qualitative methods. We present the results of an exploratory study in three
companies and an online survey with 394 participants. Our participants included
software developers, software architects, project managers, consultants, as
well as researchers. They worked in different countries and on projects from a
wide range of application areas. Most questions in the survey were related to
the last sketch or diagram that the participants had created. Contrary to our
expectations and previous work, the majority of sketches and diagrams contained
at least some UML elements. However, most of them were informal. The most
common purposes for creating sketches and diagrams were designing, explaining,
and understanding, but analyzing requirements was also named often. More than
half of the sketches and diagrams were created on analog media like paper or
whiteboards and have been revised after creation. Most of them were used for
more than a week and were archived. We found that the majority of participants
related their sketches to methods, classes, or packages, but not to source code
artifacts with a lower level of abstraction.
","[{'version': 'v1', 'created': 'Wed, 28 Jun 2017 08:51:41 GMT'}]",2017-06-29,"[['Baltes', 'Sebastian', ''], ['Diehl', 'Stephan', '']]","['Sketches', 'Diagrams', 'Empirical Study', 'Source Code Artifacts']"
3906,1604.08698,Petra Wiederhold,"P. Wiederhold, H. Reyes",Relative Convex Hull Determination from Convex Hulls in the Plane,"15 pages, 4 figures, Conference paper published. We corrected two
  typing errors in Definition 2: $I_S$ has to be defined based on $O_S$, and
  $I_E$ has to be defined based on $O_E$ (not just using $O$). These errors
  appeared in the text of the original conference paper, which also contained
  the pseudocode of an algorithm where $I_S$ and $I_E$ appeared as correctly
  defined","Proc. of IWCIA 2015 (Int. Workshop on Combinatorial Image
  Analysis, Nov. 2015, Kolkata, India), Springer Switzerland, LNCS 9448, pp.
  46-60, 2015",10.1007/978-3-319-26145-4_4,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new algorithm for the determination of the relative convex hull in the
plane of a simple polygon A with respect to another simple polygon B which
contains A, is proposed. The relative convex hull is also known as geodesic
convex hull, and the problem of its determination in the plane is equivalent to
find the shortest curve among all Jordan curves lying in the difference set of
B and A and encircling A. Algorithms solving this problem known from
Computational Geometry are based on the triangulation or similar decomposition
of that difference set. The algorithm presented here does not use such
decomposition, but it supposes that A and B are given as ordered sequences of
vertices. The algorithm is based on convex hull calculations of A and B and of
smaller polygons and polylines, it produces the output list of vertices of the
relative convex hull from the sequence of vertices of the convex hull of A.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2016 06:12:59 GMT'}]",2016-05-02,"[['Wiederhold', 'P.', ''], ['Reyes', 'H.', '']]","['Relative convex hull', 'geodesic convex hull', 'shortest Jordan curve', 'shortest path', 'minimal length polygon', 'minimal perimeterpolygon']"
3907,1309.1939,Ramon Ferrer i Cancho,Ramon Ferrer-i-Cancho,"The placement of the head that minimizes online memory: a complex
  systems approach","Minor changes (language improved; typos in Eqs. 5, 6 and 13
  corrected)","Language Dynamics and Change 5 (1), 114-137 (2015)",10.1163/22105832-00501007,,cs.CL nlin.AO physics.data-an physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is well known that the length of a syntactic dependency determines its
online memory cost. Thus, the problem of the placement of a head and its
dependents (complements or modifiers) that minimizes online memory is
equivalent to the problem of the minimum linear arrangement of a star tree.
However, how that length is translated into cognitive cost is not known. This
study shows that the online memory cost is minimized when the head is placed at
the center, regardless of the function that transforms length into cost,
provided only that this function is strictly monotonically increasing. Online
memory defines a quasi-convex adaptive landscape with a single central minimum
if the number of elements is odd and two central minima if that number is even.
We discuss various aspects of the dynamics of word order of subject (S), verb
(V) and object (O) from a complex systems perspective and suggest that word
orders tend to evolve by swapping adjacent constituents from an initial or
early SOV configuration that is attracted towards a central word order by
online memory minimization. We also suggest that the stability of SVO is due to
at least two factors, the quasi-convex shape of the adaptive landscape in the
online memory dimension and online memory adaptations that avoid regression to
SOV. Although OVS is also optimal for placing the verb at the center, its low
frequency is explained by its long distance to the seminal SOV in the
permutation space.
","[{'version': 'v1', 'created': 'Sun, 8 Sep 2013 08:31:09 GMT'}, {'version': 'v2', 'created': 'Sun, 15 Mar 2015 07:12:49 GMT'}]",2020-09-24,"[['Ferrer-i-Cancho', 'Ramon', '']]","['word order', 'head placement', 'adaptive landscape', 'neutrality', 'language dynamics', 'language evolution']"
3908,1801.05459,Emil Pricop,"Emil Pricop, Sanda Florentina Mihalache, Nicolae Paraschiv, Jaouhar
  Fattahi, Florin Zamfir",Considerations regarding security issues impact on systems availability,"Paper accepted for 2016 8th International Conference on Electronics,
  Computers and Artificial Intelligence (ECAI 2016) Proceedings, Ploiesti,
  Romania","2016 8th International Conference on Electronics, Computers and
  Artificial Intelligence (ECAI)",10.1109/ECAI.2016.7861110,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Control systems behavior can be analyzed taking into account a large number
of parameters: performances, reliability, availability, security. Each control
system presents various security vulnerabilities that affect in lower or higher
measure its functioning. In this paper the authors present a method to assess
the impact of security issues on the systems availability. A fuzzy model for
estimating the availability of the system based on the security level and
achieved availability coefficient (depending on MTBF and MTR) is developed and
described. The results of the fuzzy inference system (FIS) are presented in the
last section of the paper.
","[{'version': 'v1', 'created': 'Tue, 16 Jan 2018 19:34:38 GMT'}]",2019-08-30,"[['Pricop', 'Emil', ''], ['Mihalache', 'Sanda Florentina', ''], ['Paraschiv', 'Nicolae', ''], ['Fattahi', 'Jaouhar', ''], ['Zamfir', 'Florin', '']]","['availability', 'security', 'availability coefficient']"
3909,1908.02986,Maksim Jenihhin,"Adeboye Stephen Oyeniran, Raimund Ubar, Maksim Jenihhin, Cemil Cem
  G\""ursoy, Jaan Raik","High-Level Combined Deterministic and Pseudoexhuastive Test Generation
  for RISC Processors","2019 IEEE European Test Symposium (ETS). arXiv admin note: text
  overlap with arXiv:1907.12325",,10.1109/ETS.2019.8791526,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent safety standards set stringent requirements for the target fault
coverage in embedded microprocessors, with the objective to guarantee
robustness and functional safety of the critical electronic systems. This
motivates the need for improving the quality of test generation for
microprocessors. A new high-level implementation-independent test generation
method for RISC processors is proposed. The set of instructions of the
processor is partitioned nto groups. For each group, a dedicated test template
is created, to be used for generating two test programs, for testing the
control and the data paths respectively. For testing the control part, a novel
high-level control fault model is proposed. Using this model, a set of
deterministic test data operands are generated for each instruction of the
given group. The advantage of the high-level fault model is that it covers
larger than SAF fault class including multiple fault coverage in the control
part. For generating the data path test, pseudoexhaustive data operands are
used. We investigated the feasibility of the approach and demonstrated high
efficiency of the generated test programs for testing the execute module of the
miniMIPS RISC processor.
","[{'version': 'v1', 'created': 'Thu, 8 Aug 2019 09:29:59 GMT'}]",2019-09-04,"[['Oyeniran', 'Adeboye Stephen', ''], ['Ubar', 'Raimund', ''], ['Jenihhin', 'Maksim', ''], ['Gürsoy', 'Cemil Cem', ''], ['Raik', 'Jaan', '']]","['RISC processors', 'high-level fault model', 'highlevel test generation', 'deterministic and pseudo-exhaustive tests', 'control and data path tests']"
3910,1603.01090,Janez \v{Z}erovnik,"David Kaljun, Joze Petri\v{s}i\v{c}, Janez \v{Z}erovnik","Using Newton's method to model a spatial light distribution of a LED
  with attached secondary optics","submitted to Journal of Mecanical enginering (Strojni\v{s}ki vestnik,
  Ljubljana)","Journal of Mechanical Engineering 62(2016)5, 307-317",10.5545/sv-jme.2015.3234,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In design of optical systems based on LED (Light emitting diode) technology,
a crucial task is to handle the unstructured data describing properties of
optical elements in standard formats. This leads to the problem of data fitting
within an appropriate model. Newton's method is used as an upgrade of
previously developed most promising discrete optimization heuristics showing
improvement of both performance and quality of solutions. Experiment also
indicates that a combination of an algorithm that finds promising initial
solutions as a preprocessor to Newton's method may be a winning idea, at least
on some datasets of instances.
","[{'version': 'v1', 'created': 'Thu, 3 Mar 2016 13:23:24 GMT'}]",2016-04-27,"[['Kaljun', 'David', ''], ['Petrišič', 'Joze', ''], ['Žerovnik', 'Janez', '']]","['least squares function fitting', 'Newton method', 'discreteoptimization', 'local search', 'light distribution', 'LED']"
3911,1907.11015,Ochilbek Rakhmanov,Ochilbek Rakhmanov,"A new approach (extra vertex) and generalization of Shoelace Algorithm
  usage in convex polygon (Point-in-Polygon)","5 pages, 11 figures, 2 tables. 2018 14th International Conference on
  Electronics Computer and Computation (ICECCO)",,10.1109/ICECCO.2018.8634725,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we aim to bring new approach into usage of Shoelace Algorithm
for area calculation in convex polygons on Cartesian coordinate system, with
concentration on point in polygon concept. Generalization of usage of the
concept will be proposed for line segment and polygons. Testing of new method
will be done using Python language. Results of tests show that the new approach
is more effective than the current one.
","[{'version': 'v1', 'created': 'Thu, 25 Jul 2019 12:48:10 GMT'}]",2019-07-26,"[['Rakhmanov', 'Ochilbek', '']]","['Shoelace Algorithm', 'Point in polygon', 'Area of polygon', 'Python']"
3912,1608.03545,James Ross,James Ross and David Richie,An OpenSHMEM Implementation for the Adapteva Epiphany Coprocessor,"14 pages, 9 figures, OpenSHMEM 2016: Third workshop on OpenSHMEM and
  Related Technologies",,10.1007/978-3-319-50995-2_10,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper reports the implementation and performance evaluation of the
OpenSHMEM 1.3 specification for the Adapteva Epiphany architecture within the
Parallella single-board computer. The Epiphany architecture exhibits massive
many-core scalability with a physically compact 2D array of RISC CPU cores and
a fast network-on-chip (NoC). While fully capable of MPMD execution, the
physical topology and memory-mapped capabilities of the core and network
translate well to Partitioned Global Address Space (PGAS) programming models
and SPMD execution with SHMEM.
","[{'version': 'v1', 'created': 'Thu, 11 Aug 2016 17:42:16 GMT'}]",2017-01-18,"[['Ross', 'James', ''], ['Richie', 'David', '']]","['OpenSHMEM', 'Network-on-Chip (NoC)', 'Single-Board Computer', 'Performance Evaluation']"
3913,1806.09523,Krishnendu Rarhi,"Pratyusa Mukherjee, Krishnendu Rarhi, Abhishek Bhattacharya",Cryptanalysis of a Chaotic Key based Image Encryption Scheme,,,10.1007/978-981-13-1501-5_14,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Security of multimedia data is a major concern due to its widespread
transmission over various communication channels. Hence design and study of
good image encryption schemes has become a major research topic. During the
last few decades, there has been a increasing in chaos-based cryptography. This
paper proposes an attack on a recently proposed chaos based image encryption
scheme. The cryptosystem under study proceed by first shuffling the original
image to disturb the arrangement of pixels by applying a chaotic map several
times. Second, a keystream is generated using Chen's chaotic system to mix it
with the shuffled pixels to finally obtain the cipher image. A chosen
ciphertext attack can be done to recover the system without any knowledge of
the key. It simply demands two pairs of plaintext-ciphertext to completely
break the cryptosystem.
","[{'version': 'v1', 'created': 'Thu, 21 Jun 2018 05:07:32 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Sep 2018 03:57:21 GMT'}]",2018-09-27,"[['Mukherjee', 'Pratyusa', ''], ['Rarhi', 'Krishnendu', ''], ['Bhattacharya', 'Abhishek', '']]","['Cryptanalysis', 'Chaos', 'Keystream', 'Shuffle', 'Chosen-ciphertext attack', 'Image Encryption']"
3914,1207.2630,Sujatha Srinivasan,Sujatha Srinivasan and Sivakumar Ramakrishnan,Nugget Discovery with a Multi-objective Cultural Algorithm,"Published in Computer Science and Engineering: An International
  Journal, 15 pages","Sujatha Srinivasan & Sivakumar Ramakrishnan, NUGGET DISCOVERY WITH
  A MULTI-OBJECTIVE CULTURAL ALGORITHM , Computer Science & Engineering: An
  International Journal (CSEIJ), Vol.2, No.3, June 2012",10.5121/cseij.2012.2302,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Partial classification popularly known as nugget discovery comes under
descriptive knowledge discovery. It involves mining rules for a target class of
interest. Classification ""If-Then"" rules are the most sought out by decision
makers since they are the most comprehensible form of knowledge mined by data
mining techniques. The rules have certain properties namely the rule metrics
which are used to evaluate them. Mining rules with user specified properties
can be considered as a multi-objective optimization problem since the rules
have to satisfy more than one property to be used by the user. Cultural
algorithm (CA) with its knowledge sources have been used in solving many
optimization problems. However research gap exists in using cultural algorithm
for multi-objective optimization of rules. In the current study a
multi-objective cultural algorithm is proposed for partial classification.
Results of experiments on benchmark data sets reveal good performance.
","[{'version': 'v1', 'created': 'Wed, 11 Jul 2012 13:18:55 GMT'}]",2012-07-12,"[['Srinivasan', 'Sujatha', ''], ['Ramakrishnan', 'Sivakumar', '']]","['Multi-objective optimization', 'Classification', 'Cultural algorithm', 'Nugget discovery', 'Data mining']"
3915,0804.0558,Fahem Kebair,"Fahem Kebair (LITIS), Fr\'ed\'eric Serin (LITIS), Cyrille Bertelle
  (LITIS)",Agent-Based Perception of an Environment in an Emergency Situation,,"Dans Proceedings of the World Congress on Engineering -
  Proceedings of the World Congress on Engineering, London : Royaume-Uni (2007)","10.1007/978-988-98671-5-7,978-988-98671-2-6",,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We are interested in the problem of multiagent systems development for risk
detecting and emergency response in an uncertain and partially perceived
environment. The evaluation of the current situation passes by three stages
inside the multiagent system. In a first time, the situation is represented in
a dynamic way. The second step, consists to characterise the situation and
finally, it is compared with other similar known situations. In this paper, we
present an information modelling of an observed environment, that we have
applied on the RoboCupRescue Simulation System. Information coming from the
environment are formatted according to a taxonomy and using semantic features.
The latter are defined thanks to a fine ontology of the domain and are managed
by factual agents that aim to represent dynamically the current situation.
","[{'version': 'v1', 'created': 'Thu, 3 Apr 2008 13:45:43 GMT'}]",2008-12-18,"[['Kebair', 'Fahem', '', 'LITIS'], ['Serin', 'Frédéric', '', 'LITIS'], ['Bertelle', 'Cyrille', '', 'LITIS']]","['Factual agent', 'Multiagent system', 'Ontology', 'Semantic feature', 'Taxonomy']"
3916,1701.07123,EPTCS,"Guillermo Vigueras (IMDEA Software Institute), Manuel Carro (IMDEA
  Software Institute and Universidad Polit\'ecnica de Madrid), Salvador Tamarit
  (Universidad Polit\'ecnica de Madrid), Julio Mari\~no (Universidad
  Polit\'ecnica de Madrid)","Towards Automatic Learning of Heuristics for Mechanical Transformations
  of Procedural Code","In Proceedings PROLE 2016, arXiv:1701.03069. This paper is based on
  arXiv:1603.03022, and has a thorough description of the proposed approach","EPTCS 237, 2017, pp. 52-67",10.4204/EPTCS.237.4,EPTCS 1701,cs.PL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The current trends in next-generation exascale systems go towards integrating
a wide range of specialized (co-)processors into traditional supercomputers.
Due to the efficiency of heterogeneous systems in terms of Watts and FLOPS per
surface unit, opening the access of heterogeneous platforms to a wider range of
users is an important problem to be tackled. However, heterogeneous platforms
limit the portability of the applications and increase development complexity
due to the programming skills required. Program transformation can help make
programming heterogeneous systems easier by defining a step-wise transformation
process that translates a given initial code into a semantically equivalent
final code, but adapted to a specific platform. Program transformation systems
require the definition of efficient transformation strategies to tackle the
combinatorial problem that emerges due to the large set of transformations
applicable at each step of the process. In this paper we propose a machine
learning-based approach to learn heuristics to define program transformation
strategies. Our approach proposes a novel combination of reinforcement learning
and classification methods to efficiently tackle the problems inherent to this
type of systems. Preliminary results demonstrate the suitability of this
approach.
","[{'version': 'v1', 'created': 'Wed, 25 Jan 2017 01:20:34 GMT'}]",2017-01-26,"[['Vigueras', 'Guillermo', '', 'IMDEA Software Institute'], ['Carro', 'Manuel', '', 'IMDEA\n  Software Institute and Universidad Politécnica de Madrid'], ['Tamarit', 'Salvador', '', 'Universidad Politécnica de Madrid'], ['Mariño', 'Julio', '', 'Universidad\n  Politécnica de Madrid']]","['Program Transformation', 'Machine Learning', 'Heterogeneous Systems']"
3917,1704.06346,J Joaquin Garcia-Luna-Aceves,J.J. Garcia-Luna-Aceves,"ADN: An Information-Centric Networking Architecture for the Internet of
  Things",10 pages,,10.1145/3054977.3054995,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Forwarding data by name has been assumed to be a necessary aspect of an
information-centric redesign of the current Internet architecture that makes
content access, dissemination, and storage more efficient. The Named Data
Networking (NDN) and Content-Centric Networking (CCNx) architectures are the
leading examples of such an approach. However, forwarding data by name incurs
storage and communication complexities that are orders of magnitude larger than
solutions based on forwarding data using addresses. Furthermore, the specific
algorithms used in NDN and CCNx have been shown to have a number of
limitations. The Addressable Data Networking (ADN) architecture is introduced
as an alternative to NDN and CCNx. ADN is particularly attractive for
large-scale deployments of the Internet of Things (IoT), because it requires
far less storage and processing in relaying nodes than NDN. ADN allows things
and data to be denoted by names, just like NDN and CCNx do. However, instead of
replacing the waist of the Internet with named-data forwarding, ADN uses an
address-based forwarding plane and introduces an information plane that
seamlessly maps names to addresses without the involvement of end-user
applications. Simulation results illustrate the order of magnitude savings in
complexity that can be attained with ADN compared to NDN.
","[{'version': 'v1', 'created': 'Thu, 20 Apr 2017 21:32:34 GMT'}]",2017-04-24,"[['Garcia-Luna-Aceves', 'J. J.', '']]","['Content-centric networking', 'IoT', 'forwarding']"
3918,1208.2762,EPTCS,"Michael Vielhaber (Hochschule Bremerhaven, Germany)",Computing by Temporal Order: Asynchronous Cellular Automata,"In Proceedings AUTOMATA&JAC 2012, arXiv:1208.2498","EPTCS 90, 2012, pp. 166-176",10.4204/EPTCS.90.14,,cs.FL cs.CC cs.DM nlin.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our concern is the behaviour of the elementary cellular automata with state
set 0,1 over the cell set Z/nZ (one-dimensional finite wrap-around case), under
all possible update rules (asynchronicity).
  Over the torus Z/nZ (n<= 11),we will see that the ECA with Wolfram rule 57
maps any v in F_2^n to any w in F_2^n, varying the update rule.
  We furthermore show that all even (element of the alternating group)
bijective functions on the set F_2^n = 0,...,2^n-1, can be computed by ECA57,
by iterating it a sufficient number of times with varying update rules, at
least for n <= 10. We characterize the non-bijective functions computable by
asynchronous rules.
","[{'version': 'v1', 'created': 'Tue, 14 Aug 2012 01:55:32 GMT'}]",2012-08-15,"[['Vielhaber', 'Michael', '', 'Hochschule Bremerhaven, Germany']]","['Cellular automata', 'asynchronous', 'update rule', 'universality']"
3919,1403.0613,Zhiguo Long,"Sanjiang Li, Zhiguo Long, Weiming Liu, Matt Duckham, Alan Both",On Redundant Topological Constraints,"An extended abstract appears in Proceedings of the 14th International
  Conference on the Principles of Knowledge Representation and Reasoning
  (KR-14), Vienna, Austria, July 20-24, 2014",Artificial Intelligence 225 (2015) 51-76,10.1016/j.artint.2015.03.010,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Region Connection Calculus (RCC) is a well-known calculus for
representing part-whole and topological relations. It plays an important role
in qualitative spatial reasoning, geographical information science, and
ontology. The computational complexity of reasoning with RCC5 and RCC8 (two
fragments of RCC) as well as other qualitative spatial/temporal calculi has
been investigated in depth in the literature. Most of these works focus on the
consistency of qualitative constraint networks. In this paper, we consider the
important problem of redundant qualitative constraints. For a set $\Gamma$ of
qualitative constraints, we say a constraint $(x R y)$ in $\Gamma$ is redundant
if it is entailed by the rest of $\Gamma$. A prime subnetwork of $\Gamma$ is a
subset of $\Gamma$ which contains no redundant constraints and has the same
solution set as $\Gamma$. It is natural to ask how to compute such a prime
subnetwork, and when it is unique.
  In this paper, we show that this problem is in general intractable, but
becomes tractable if $\Gamma$ is over a tractable subalgebra $\mathcal{S}$ of a
qualitative calculus. Furthermore, if $\mathcal{S}$ is a subalgebra of RCC5 or
RCC8 in which weak composition distributes over nonempty intersections, then
$\Gamma$ has a unique prime subnetwork, which can be obtained in cubic time by
removing all redundant constraints simultaneously from $\Gamma$. As a
byproduct, we show that any path-consistent network over such a distributive
subalgebra is weakly globally consistent and minimal. A thorough empirical
analysis of the prime subnetwork upon real geographical data sets demonstrates
the approach is able to identify significantly more redundant constraints than
previously proposed algorithms, especially in constraint networks with larger
proportions of partial overlap relations.
","[{'version': 'v1', 'created': 'Mon, 3 Mar 2014 22:01:16 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Feb 2015 15:22:28 GMT'}]",2017-02-21,"[['Li', 'Sanjiang', ''], ['Long', 'Zhiguo', ''], ['Liu', 'Weiming', ''], ['Duckham', 'Matt', ''], ['Both', 'Alan', '']]","['Qualitative spatial reasoning', 'Region connection calculus', 'Redundancy', 'Prime subnetwork', 'Distributive subalgebra']"
3920,1902.09904,Yechong Huang,"Yechong Huang, Jiahang Xu, Yuncheng Zhou, Tong Tong, Xiahai Zhuang,
  the Alzheimer's Disease Neuroimaging Initiative","Diagnosis of Alzheimer's Disease via Multi-modality 3D Convolutional
  Neural Network","21 pages, 5 figures, 9 tables",https://www.frontiersin.org/articles/10.3389/fnins.2019.00509/full,10.3389/fnins.2019.00509,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Alzheimer's Disease (AD) is one of the most concerned neurodegenerative
diseases. In the last decade, studies on AD diagnosis attached great
significance to artificial intelligence (AI)-based diagnostic algorithms. Among
the diverse modality imaging data, T1-weighted MRI and 18F-FDGPET are widely
researched for this task. In this paper, we propose a novel convolutional
neural network (CNN) to fuse the multi-modality information including T1-MRI
and FDG-PDT images around the hippocampal area for the diagnosis of AD.
Different from the traditional machine learning algorithms, this method does
not require manually extracted features, and utilizes the stateof-art 3D
image-processing CNNs to learn features for the diagnosis and prognosis of AD.
To validate the performance of the proposed network, we trained the classifier
with paired T1-MRI and FDG-PET images using the ADNI datasets, including 731
Normal (NL) subjects, 647 AD subjects, 441 stable MCI (sMCI) subjects and 326
progressive MCI (pMCI) subjects. We obtained the maximal accuracies of 90.10%
for NL/AD task, 87.46% for NL/pMCI task, and 76.90% for sMCI/pMCI task. The
proposed framework yields comparative results against state-of-the-art
approaches. Moreover, the experimental results have demonstrated that (1)
segmentation is not a prerequisite by using CNN, (2) the hippocampal area
provides enough information to give a reference to AD diagnosis. Keywords:
Alzheimer's Disease, Multi-modality, Image Classification, CNN, Deep Learning,
Hippocampal
","[{'version': 'v1', 'created': 'Tue, 26 Feb 2019 13:01:44 GMT'}]",2019-08-20,"[['Huang', 'Yechong', ''], ['Xu', 'Jiahang', ''], ['Zhou', 'Yuncheng', ''], ['Tong', 'Tong', ''], ['Zhuang', 'Xiahai', ''], ['Initiative', ""the Alzheimer's Disease Neuroimaging"", '']]","['Alzheimer’s Disease', 'Multi-modality', 'Image Classification', 'CNN', 'Deep Learning', 'Hippocampal']"
3921,1703.06959,Natali Ruchansky,"Natali Ruchansky, Sungyong Seo, Yan Liu",CSI: A Hybrid Deep Model for Fake News Detection,"In Proceedings of the 26th ACM International Conference on
  Information and Knowledge Management (CIKM) 2017",,10.1145/3132847.3132877,,cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The topic of fake news has drawn attention both from the public and the
academic communities. Such misinformation has the potential of affecting public
opinion, providing an opportunity for malicious parties to manipulate the
outcomes of public events such as elections. Because such high stakes are at
play, automatically detecting fake news is an important, yet challenging
problem that is not yet well understood. Nevertheless, there are three
generally agreed upon characteristics of fake news: the text of an article, the
user response it receives, and the source users promoting it. Existing work has
largely focused on tailoring solutions to one particular characteristic which
has limited their success and generality. In this work, we propose a model that
combines all three characteristics for a more accurate and automated
prediction. Specifically, we incorporate the behavior of both parties, users
and articles, and the group behavior of users who propagate fake news.
Motivated by the three characteristics, we propose a model called CSI which is
composed of three modules: Capture, Score, and Integrate. The first module is
based on the response and text; it uses a Recurrent Neural Network to capture
the temporal pattern of user activity on a given article. The second module
learns the source characteristic based on the behavior of users, and the two
are integrated with the third module to classify an article as fake or not.
Experimental analysis on real-world data demonstrates that CSI achieves higher
accuracy than existing models, and extracts meaningful latent representations
of both users and articles.
","[{'version': 'v1', 'created': 'Mon, 20 Mar 2017 20:33:32 GMT'}, {'version': 'v2', 'created': 'Sun, 26 Mar 2017 17:29:45 GMT'}, {'version': 'v3', 'created': 'Thu, 1 Jun 2017 06:00:56 GMT'}, {'version': 'v4', 'created': 'Sun, 3 Sep 2017 22:05:42 GMT'}]",2017-09-05,"[['Ruchansky', 'Natali', ''], ['Seo', 'Sungyong', ''], ['Liu', 'Yan', '']]","['Fake news detection', 'Neural networks', 'Deep learning', 'Social networks', 'Group anomaly detection', 'Temporal analysis']"
3922,1706.08602,Masaki Ogura Dr.,Masaki Ogura and Victor M. Preciado,Second-Order Moment-Closure for Tighter Epidemic Thresholds,,,10.1016/j.sysconle.2018.01.006,,cs.SI q-bio.PE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the dynamics of contagious spreading processes taking
place in complex contact networks. We specifically present a lower-bound on the
decay rate of the number of nodes infected by a
susceptible-infected-susceptible (SIS) stochastic spreading process. A precise
quantification of this decay rate is crucial for designing efficient strategies
to contain epidemic outbreaks. However, existing lower-bounds on the decay rate
based on first-order mean-field approximations are often accompanied by a large
error resulting in inefficient containment strategies. To overcome this
deficiency, we derive a lower-bound based on a second-order moment-closure of
the stochastic SIS processes. The proposed second-order bound is theoretically
guaranteed to be tighter than existing first-order bounds. We also present
various numerical simulations to illustrate how our lower-bound drastically
improves the performance of existing first-order lower-bounds in practical
scenarios, resulting in more efficient strategies for epidemic containment.
","[{'version': 'v1', 'created': 'Mon, 26 Jun 2017 21:26:10 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Sep 2017 21:57:19 GMT'}]",2019-03-19,"[['Ogura', 'Masaki', ''], ['Preciado', 'Victor M.', '']]","['Complex networks', 'spreading processes', 'stochastic processes', 'stability']"
3923,0902.0261,Tomoyuki Yamakami,Tomoyuki Yamakami,Immunity and Pseudorandomness of Context-Free Languages,"A4, 23 pages, 10 pt. A complete revision of the initial version that
  was posted in February 2009","Theoretical Computer Science, vol. 412, pp.6432-6450, 2011",10.1016/j.tcs.2011.07.013,,cs.CC cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We discuss the computational complexity of context-free languages,
concentrating on two well-known structural properties---immunity and
pseudorandomness. An infinite language is REG-immune (resp., CFL-immune) if it
contains no infinite subset that is a regular (resp., context-free) language.
We prove that (i) there is a context-free REG-immune language outside REG/n and
(ii) there is a REG-bi-immune language that can be computed deterministically
using logarithmic space. We also show that (iii) there is a CFL-simple set,
where a CFL-simple language is an infinite context-free language whose
complement is CFL-immune. Similar to the REG-immunity, a REG-primeimmune
language has no polynomially dense subsets that are also regular. We further
prove that (iv) there is a context-free language that is REG/n-bi-primeimmune.
Concerning pseudorandomness of context-free languages, we show that (v) CFL
contains REG/n-pseudorandom languages. Finally, we prove that (vi) against
REG/n, there exists an almost 1-1 pseudorandom generator computable in
nondeterministic pushdown automata equipped with a write-only output tape and
(vii) against REG, there is no almost 1-1 weakly pseudorandom generator
computable deterministically in linear time by a single-tape Turing machine.
","[{'version': 'v1', 'created': 'Mon, 2 Feb 2009 12:21:23 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Jul 2011 13:18:33 GMT'}]",2011-09-20,"[['Yamakami', 'Tomoyuki', '']]","['regular language', 'context-free language', 'immune', 'simple', 'primeimmune', 'pseudorandom', 'pseudorandom generator', 'swapping lemma']"
3924,1509.00594,Jian Gao,Jian Gao and Tao Zhou,"Evaluating user reputation in online rating systems via an iterative
  group-based ranking method","12 pages, 9 figures, 2 tables","Physica A: Statistical Mechanics and its Applications. 473 (2017):
  546-560",10.1016/j.physa.2017.01.055,,cs.IR cs.SI physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reputation is a valuable asset in online social lives and it has drawn
increased attention. How to evaluate user reputation in online rating systems
is especially significant due to the existence of spamming attacks. To address
this issue, so far, a variety of methods have been proposed, including
network-based methods, quality-based methods and group-based ranking method. In
this paper, we propose an iterative group-based ranking (IGR) method by
introducing an iterative reputation-allocation process into the original
group-based ranking (GR) method. More specifically, users with higher
reputation have higher weights in dominating the corresponding group sizes. The
reputation of users and the corresponding group sizes are iteratively updated
until they become stable. Results on two real data sets suggest that the
proposed IGR method has better performance and its robustness is considerably
improved comparing with the original GR method. Our work highlights the
positive role of users' grouping behavior towards a better reputation
evaluation.
","[{'version': 'v1', 'created': 'Wed, 2 Sep 2015 07:58:13 GMT'}]",2017-01-24,"[['Gao', 'Jian', ''], ['Zhou', 'Tao', '']]","['Rating systems', 'Reputation evaluation', 'Ranking method', 'Spamming attack', 'Iterative refinement']"
3925,1602.00585,Yinong Wang,"Yinong Wang, Jianhua Yao, Holger R. Roth, Joseph E. Burns, Ronald M.
  Summers",Improving Vertebra Segmentation through Joint Vertebra-Rib Atlases,"Manuscript to be presented at SPIE Medical Imaging 2016, 27 February
  - 3 March, 2016, San Diego, California, USA",,10.1117/12.2217118,,cs.CV,http://creativecommons.org/publicdomain/zero/1.0/,"  Accurate spine segmentation allows for improved identification and
quantitative characterization of abnormalities of the vertebra, such as
vertebral fractures. However, in existing automated vertebra segmentation
methods on computed tomography (CT) images, leakage into nearby bones such as
ribs occurs due to the close proximity of these visibly intense structures in a
3D CT volume. To reduce this error, we propose the use of joint vertebra-rib
atlases to improve the segmentation of vertebrae via multi-atlas joint label
fusion. Segmentation was performed and evaluated on CTs containing 106 thoracic
and lumbar vertebrae from 10 pathological and traumatic spine patients on an
individual vertebra level basis. Vertebra atlases produced errors where the
segmentation leaked into the ribs. The use of joint vertebra-rib atlases
produced a statistically significant increase in the Dice coefficient from 92.5
$\pm$ 3.1% to 93.8 $\pm$ 2.1% for the left and right transverse processes and a
decrease in the mean and max surface distance from 0.75 $\pm$ 0.60mm and 8.63
$\pm$ 4.44mm to 0.30 $\pm$ 0.27mm and 3.65 $\pm$ 2.87mm, respectively.
","[{'version': 'v1', 'created': 'Mon, 1 Feb 2016 16:36:42 GMT'}]",2016-06-14,"[['Wang', 'Yinong', ''], ['Yao', 'Jianhua', ''], ['Roth', 'Holger R.', ''], ['Burns', 'Joseph E.', ''], ['Summers', 'Ronald M.', '']]","['vertebra segmentation', 'multi-atlas registration', 'joint label fusion']"
3926,2206.13876,Oliver Gasser,"Khwaja Zubair Sediqi, Lars Prehn, Oliver Gasser","Hyper-Specific Prefixes: Gotta Enjoy the Little Things in Interdomain
  Routing","See https://hyperspecifics.io/ for continuously updated HSP analyses
  and statistics","ACM SIGCOMM Computer Communication Review (CCR) Volume 52 Issue 2,
  April 2022",10.1145/3544912.3544916,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autonomous Systems (ASes) exchange reachability information between each
other using BGP -- the de-facto standard inter-AS routing protocol. While IPv4
(IPv6) routes more specific than /24 (/48) are commonly filtered (and hence not
propagated), route collectors still observe many of them. In this work, we take
a closer look at those ""hyper-specific"" prefixes (HSPs). In particular, we
analyze their prevalence, use cases, and whether operators use them
intentionally or accidentally. While their total number increases over time,
most HSPs can only be seen by route collector peers. Nonetheless, some HSPs can
be seen constantly throughout an entire year and propagate widely. We find that
most HSPs represent (internal) routes to peering infrastructure or are related
to address block relocations or blackholing. While hundreds of operators
intentionally add HSPs to well-known routing databases, we observe that many
HSPs are possibly accidentally leaked routes.
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2022 10:32:38 GMT'}]",2022-06-29,"[['Sediqi', 'Khwaja Zubair', ''], ['Prehn', 'Lars', ''], ['Gasser', 'Oliver', '']]","['BGP', 'routing', 'hyper-specific prefixes']"
3927,1801.05832,Renato J Cintra,"D. F. G. Coelho, R. J. Cintra, V. S. Dimitrov",Efficient Computation of the 8-point DCT via Summation by Parts,"Fixed Fig. 1 with the block diagram of the proposed architecture.
  Manuscript contains 13 pages, 4 figures, 2 tables",J Sign Process Syst (2017),10.1007/s11265-017-1270-6,,cs.DS cs.NA math.NA stat.CO stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a new fast algorithm for the 8-point discrete cosine
transform (DCT) based on the summation-by-parts formula. The proposed method
converts the DCT matrix into an alternative transformation matrix that can be
decomposed into sparse matrices of low multiplicative complexity. The method is
capable of scaled and exact DCT computation and its associated fast algorithm
achieves the theoretical minimal multiplicative complexity for the 8-point DCT.
Depending on the nature of the input signal simplifications can be introduced
and the overall complexity of the proposed algorithm can be further reduced.
Several types of input signal are analyzed: arbitrary, null mean, accumulated,
and null mean/accumulated signal. The proposed tool has potential application
in harmonic detection, image enhancement, and feature extraction, where input
signal DC level is discarded and/or the signal is required to be integrated.
","[{'version': 'v1', 'created': 'Wed, 17 Jan 2018 19:21:15 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Mar 2018 21:43:07 GMT'}]",2018-03-30,"[['Coelho', 'D. F. G.', ''], ['Cintra', 'R. J.', ''], ['Dimitrov', 'V. S.', '']]","['DCT', 'Fast Algorithms', 'Image Processing']"
3928,1903.12452,Oscar Araque,"Rodrigo Barbado, Oscar Araque and Carlos A. Iglesias","A framework for fake review detection in online consumer electronics
  retailers","Information Processing & Management, 11 pages","Information Processing & Management, ISSN 0306-4573, Volume 56,
  Issue 4, July 2019",10.1016/j.ipm.2019.03.002,,cs.CL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The impact of online reviews on businesses has grown significantly during
last years, being crucial to determine business success in a wide array of
sectors, ranging from restaurants, hotels to e-commerce. Unfortunately, some
users use unethical means to improve their online reputation by writing fake
reviews of their businesses or competitors. Previous research has addressed
fake review detection in a number of domains, such as product or business
reviews in restaurants and hotels. However, in spite of its economical
interest, the domain of consumer electronics businesses has not yet been
thoroughly studied. This article proposes a feature framework for detecting
fake reviews that has been evaluated in the consumer electronics domain. The
contributions are fourfold: (i) Construction of a dataset for classifying fake
reviews in the consumer electronics domain in four different cities based on
scraping techniques; (ii) definition of a feature framework for fake review
detection; (iii) development of a fake review classification method based on
the proposed framework and (iv) evaluation and analysis of the results for each
of the cities under study. We have reached an 82% F-Score on the classification
task and the Ada Boost classifier has been proven to be the best one by
statistical means according to the Friedman test.
","[{'version': 'v1', 'created': 'Fri, 29 Mar 2019 11:24:40 GMT'}]",2019-04-01,"[['Barbado', 'Rodrigo', ''], ['Araque', 'Oscar', ''], ['Iglesias', 'Carlos A.', '']]","['Fake Review', 'Sentiment Analysis', 'Machine Learning', 'Data Analysis', 'Web Analytics']"
3929,1708.00931,Sanchit Alekh,"Abhinav Gupta, Agrim Khanna, Anmol Jagetia, Devansh Sharma, Sanchit
  Alekh, Vaibhav Choudhary",Combining Keystroke Dynamics and Face Recognition for User Verification,,,10.1109/CSE.2015.37,,cs.HC cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The massive explosion and ubiquity of computing devices and the outreach of
the web have been the most defining events of the century so far. As more and
more people gain access to the internet, traditional know-something and
have-something authentication methods such as PINs and passwords are proving to
be insufficient for prohibiting unauthorized access to increasingly personal
data on the web. Therefore, the need of the hour is a user-verification system
that is not only more reliable and secure, but also unobtrusive and
minimalistic. Keystroke Dynamics is a novel Biometric Technique; it is not only
unobtrusive, but also transparent and inexpensive. The fusion of keystroke
dynamics and Face Recognition engenders the most desirable characteristics of a
verification system. Our implementation uses Hidden Markov Models (HMM) for
modelling the Keystroke Dynamics, with the help of two widely used Feature
Vectors: Keypress Latency and Keypress Duration. On the other hand, Face
Recognition makes use of the traditional Eigenfaces approach.The results show
that the system has a high precision, with a False Acceptance Rate of 5.4% and
a False Rejection Rate of 9.2%. Moreover, it is also future-proof, as the
hardware requirements, i.e. camera and keyboard (physical or on-screen), have
become an indispensable part of modern computing.
","[{'version': 'v1', 'created': 'Wed, 2 Aug 2017 21:13:59 GMT'}]",2017-08-04,"[['Gupta', 'Abhinav', ''], ['Khanna', 'Agrim', ''], ['Jagetia', 'Anmol', ''], ['Sharma', 'Devansh', ''], ['Alekh', 'Sanchit', ''], ['Choudhary', 'Vaibhav', '']]","['Keystroke Dynamics', 'Biometrics', 'Computer']"
3930,1907.12047,Avi Segal,"Avi Segal, Kobi Gal, Guy Shani, Bracha Shapira",A difficulty ranking approach to personalization in E-learning,,"International Journal of Human-Computer Studies, Volume 130,
  October 2019, Pages 261-272",10.1016/j.ijhcs.2019.07.002,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The prevalence of e-learning systems and on-line courses has made educational
material widely accessible to students of varying abilities and backgrounds.
There is thus a growing need to accommodate for individual differences in
e-learning systems. This paper presents an algorithm called EduRank for
personalizing educational content to students that combines a collaborative
filtering algorithm with voting methods. EduRank constructs a difficulty
ranking for each student by aggregating the rankings of similar students using
different aspects of their performance on common questions. These aspects
include grades, number of retries, and time spent solving questions. It infers
a difficulty ranking directly over the questions for each student, rather than
ordering them according to the student's predicted score. The EduRank algorithm
was tested on two data sets containing thousands of students and a million
records. It was able to outperform the state-of-the-art ranking approaches as
well as a domain expert. EduRank was used by students in a classroom activity,
where a prior model was incorporated to predict the difficulty rankings of
students with no prior history in the system. It was shown to lead students to
solve more difficult questions than an ordering by a domain expert, without
reducing their performance.
","[{'version': 'v1', 'created': 'Sun, 28 Jul 2019 08:54:06 GMT'}]",2019-07-30,"[['Segal', 'Avi', ''], ['Gal', 'Kobi', ''], ['Shani', 'Guy', ''], ['Shapira', 'Bracha', '']]","['Artificial Intelligence', 'e-learning', 'ranking algorithms', 'human-computer decision-making']"
3931,1801.05367,Ekta Vats,"Anders Hast, Per Cullhed, and Ekta Vats","TexT - Text Extractor Tool for Handwritten Document Transcription and
  Annotation",,"Digital Libraries and Multimedia Archives. IRCDL 2018.
  Communications in Computer and Information Science, vol 806. Springer, Cham",10.1007/978-3-319-73165-0_8,,cs.DL cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a framework for semi-automatic transcription of
large-scale historical handwritten documents and proposes a simple
user-friendly text extractor tool, TexT for transcription. The proposed
approach provides a quick and easy transcription of text using computer
assisted interactive technique. The algorithm finds multiple occurrences of the
marked text on-the-fly using a word spotting system. TexT is also capable of
performing on-the-fly annotation of handwritten text with automatic generation
of ground truth labels, and dynamic adjustment and correction of user generated
bounding box annotations with the word being perfectly encapsulated. The user
can view the document and the found words in the original form or with
background noise removed for easier visualization of transcription results. The
effectiveness of TexT is demonstrated on an archival manuscript collection from
well-known publicly available dataset.
","[{'version': 'v1', 'created': 'Wed, 22 Nov 2017 12:05:33 GMT'}]",2018-02-22,"[['Hast', 'Anders', ''], ['Cullhed', 'Per', ''], ['Vats', 'Ekta', '']]","['Handwritten Text Recognition', 'transcription', 'annotation', 'TexT', 'word spotting', 'historical documents']"
3932,1006.3371,Secretary Aircc Journal,"Kamaljit I. Lakhtaria (Atmiya Institute of Technology & Science,
  India)",Enhancing QoS and QoE in IMS Enabled Next Generation Networks,11 Pages,"International journal on applications of graph theory in wireless
  ad hoc networks and sensor networks 2.2 (2010) 61-71",10.5121/jgraphoc.2010.2206,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Managing network complexity, accommodating greater numbers of subscribers,
improving coverage to support data services (e.g. email, video, and music
downloads), keeping up to speed with fast-changing technology, and driving
maximum value from existing networks - all while reducing CapEX and OpEX and
ensuring Quality of Service (QoS) for the network and Quality of Experience
(QoE) for the user. These are just some of the pressing business issues faced
by mobileservice providers, summarized by the demand to ""achieve more, for
less."" The ultimate goal of optimization techniques at the network and
application layer is to ensure End-user perceived QoS. The next generation
networks (NGN), a composite environment of proven telecommunications and
Internet-oriented mechanisms have become generally recognized as the
telecommunications environment of the future. However, the nature of the NGN
environment presents several complex issues regarding quality assurance that
have not existed in the legacy environments (e.g., multi-network, multi-vendor,
and multi-operator IP-based telecommunications environment, distributed
intelligence, third-party provisioning, fixed-wireless and mobile access,
etc.). In this Research Paper, a service aware policy-based approach to NGN
quality assurance is presented, taking into account both perceptual quality of
experience and technologydependant quality of service issues. The respective
procedures, entities, mechanisms, and profiles are discussed. The purpose of
the presented approach is in research, development, and discussion of pursuing
the end-to-end controllability of the quality of the multimedia NGN-based
communications in an environment that is best effort in its nature and promotes
end user's access agnosticism, service agility, and global mobility.
","[{'version': 'v1', 'created': 'Thu, 17 Jun 2010 05:03:37 GMT'}]",2010-07-15,"[['Lakhtaria', 'Kamaljit I.', '', 'Atmiya Institute of Technology & Science,\n  India']]","['NGN', 'IMS', 'VAS', 'QoS', 'QoE']"
3933,1604.01787,Yanwei Cui,"Yanwei Cui, Laetitia Chapel, S\'ebastien Lef\`evre",A Subpath Kernel for Learning Hierarchical Image Representations,"10th IAPR-TC-15 International Workshop, GbRPR 2015, Beijing, China,
  May 13-15, 2015. Proceedings",,10.1007/978-3-319-18224-7_4,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tree kernels have demonstrated their ability to deal with hierarchical data,
as the intrinsic tree structure often plays a discriminative role. While such
kernels have been successfully applied to various domains such as nature
language processing and bioinformatics, they mostly concentrate on ordered
trees and whose nodes are described by symbolic data. Meanwhile, hierarchical
representations have gained increasing interest to describe image content. This
is particularly true in remote sensing, where such representations allow for
revealing different objects of interest at various scales through a tree
structure. However, the induced trees are unordered and the nodes are equipped
with numerical features. In this paper, we propose a new structured kernel for
hierarchical image representations which is built on the concept of subpath
kernel. Experimental results on both artificial and remote sensing datasets
show that the proposed kernel manages to deal with the hierarchical nature of
the data, leading to better classification rates.
","[{'version': 'v1', 'created': 'Wed, 6 Apr 2016 20:04:17 GMT'}]",2016-04-08,"[['Cui', 'Yanwei', ''], ['Chapel', 'Laetitia', ''], ['Lefèvre', 'Sébastien', '']]","['Hierarchical representation', 'image classification', 'structuredkernels', 'subpath kernel']"
3934,1711.03989,Rute Sofia,"Andrea Nascimento, Rute Sofia, Tiago Condeixa, Susana Sargento",A Characterization of Mobility Management in User-centric Networks,New2AN 2011,,10.1007/978-3-642-22875-9_29,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobility management is a key aspect to consider in future Internet
architectures, as these architectures include a highly nomadic end-user which
often relies on services provided by multi-access networks. In contrast,
today's mobility management solutions were designed having in mind simpler
scenarios and requirements from the network and where roaming could often be
taken care of with previously established agreements. With a more dynamic
behavior in the network, and also with a more prominent role from the end-user,
mobility management has to deal with additional requirements derived from new
Internet paradigms. To assist in understanding such requirements and also how
to deal with them, this paper proposes a starting point to dismantle current
mobility management notions. Our contribution is an initial proposal on
defining mobility management in concrete functional blocks, their interaction,
as well as a potential grouping which later can assist in deriving novel and
more flexible mobility management architectures.
","[{'version': 'v1', 'created': 'Fri, 10 Nov 2017 19:12:29 GMT'}]",2017-11-15,"[['Nascimento', 'Andrea', ''], ['Sofia', 'Rute', ''], ['Condeixa', 'Tiago', ''], ['Sargento', 'Susana', '']]","['Wireless networks', 'mobility management', 'user-centricity']"
3935,1908.01587,Amir Mosavi Prof,"Muhammad Zubair Asghar, Fazli Subhan, Muhammad Imran, Fazal Masud
  Kundi, Shahboddin Shamshirband, Amir Mosavi, Peter Csiba, Annamaria R.
  Varkonyi-Koczy","Performance Evaluation of Supervised Machine Learning Techniques for
  Efficient Detection of Emotions from Online Content","30 pages, 13 tables, 1 figure",,10.20944/preprints201908.0019.v1,,cs.IR cs.CL cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Emotion detection from the text is an important and challenging problem in
text analytics. The opinion-mining experts are focusing on the development of
emotion detection applications as they have received considerable attention of
online community including users and business organization for collecting and
interpreting public emotions. However, most of the existing works on emotion
detection used less efficient machine learning classifiers with limited
datasets, resulting in performance degradation. To overcome this issue, this
work aims at the evaluation of the performance of different machine learning
classifiers on a benchmark emotion dataset. The experimental results show the
performance of different machine learning classifiers in terms of different
evaluation metrics like precision, recall ad f-measure. Finally, a classifier
with the best performance is recommended for the emotion classification.
","[{'version': 'v1', 'created': 'Mon, 5 Aug 2019 16:48:22 GMT'}]",2019-08-06,"[['Asghar', 'Muhammad Zubair', ''], ['Subhan', 'Fazli', ''], ['Imran', 'Muhammad', ''], ['Kundi', 'Fazal Masud', ''], ['Shamshirband', 'Shahboddin', ''], ['Mosavi', 'Amir', ''], ['Csiba', 'Peter', ''], ['Varkonyi-Koczy', 'Annamaria R.', '']]","['emotion classification', 'machine learning classifiers', 'ISEAR dataset', 'performance evaluation', 'data science', 'opinion-mining']"
3936,2105.08980,Philipp Schepper,"D\'aniel Marx, Govind S. Sankar, Philipp Schepper","Degrees and Gaps: Tight Complexity Results of General Factor Problems
  Parameterized by Treewidth and Cutwidth",Full version of the paper accepted for ICALP 2021,,10.4230/LIPIcs.ICALP.2021.95,,cs.CC cs.DS,http://creativecommons.org/licenses/by/4.0/,"  For the General Factor problem we are given an undirected graph $G$ and for
each vertex $v\in V(G)$ a finite set $B_v$ of non-negative integers. The task
is to decide if there is a subset $S\subseteq E(G)$ such that $deg_S(v)\in B_v$
for all vertices $v$ of $G$. The maxgap of a finite integer set $B$ is the
largest $d\ge 0$ such that there is an $a\ge 0$ with $[a,a+d+1]\cap
B=\{a,a+d+1\}$. Cornu\'ejols (1988) showed that if the maxgap of all sets $B_v$
is at most 1, then the decision version of General Factor is poly-time
solvable. Dudycz and Paluch (2018) extended this result for the minimization
and maximization versions. Using convolution techniques from van Rooij (2020),
we improve upon the previous algorithm by Arulselvan et al. (2018) and present
an algorithm counting the number of solutions of a certain size in time
$O^*((M+1)^k)$, given a tree decomposition of width $k$, where $M=\max_v \max
B_v$.
  We prove that this algorithm is essentially optimal for all cases that are
not polynomial time solvable for the decision, minimization or maximization
versions. We prove that such improvements are not possible even for $B$-Factor,
which is General Factor on graphs where all sets $B_v$ agree with the fixed set
$B$. We show that for every fixed $B$ where the problem is NP-hard, our new
algorithm cannot be significantly improved: assuming the Strong Exponential
Time Hypothesis (SETH), no algorithm can solve $B$-Factor in time $O^*((\max
B+1-\epsilon)^k)$ for any $\epsilon>0$. We extend this bound to the counting
version of $B$-Factor for arbitrary, non-trivial sets $B$, assuming #SETH.
  We also investigate the parameterization of the problem by cutwidth. Unlike
for treewidth, a larger set $B$ does not make the problem harder: Given a
linear layout of width $k$ we give a $O^*(2^k)$ algorithm for any $B$ and
provide a matching lower bound that this is optimal for the NP-hard cases.
","[{'version': 'v1', 'created': 'Wed, 19 May 2021 08:26:18 GMT'}]",2021-10-20,"[['Marx', 'Dániel', ''], ['Sankar', 'Govind S.', ''], ['Schepper', 'Philipp', '']]","['General Factor', 'General Matching', 'Treewidth', 'Cutwidth']"
3937,1501.05724,Arnaud Martin,"Amira Essaid, Arnaud Martin (IRISA), Gr\'egory Smits, Boutheina Ben
  Yaghlane",Uncertainty in Ontology Matching: A Decision Rule-Based Approach,,"International Conference on Information Processing and Management
  of Uncertainty in Knowledge-Based Systems (IPMU), Jul 2014, Montpellier,
  France. pp.46 - 55",10.1007/978-3-319-08795-5_6,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Considering the high heterogeneity of the ontologies pub-lished on the web,
ontology matching is a crucial issue whose aim is to establish links between an
entity of a source ontology and one or several entities from a target ontology.
Perfectible similarity measures, consid-ered as sources of information, are
combined to establish these links. The theory of belief functions is a powerful
mathematical tool for combining such uncertain information. In this paper, we
introduce a decision pro-cess based on a distance measure to identify the best
possible matching entities for a given source entity.
","[{'version': 'v1', 'created': 'Fri, 23 Jan 2015 07:17:37 GMT'}]",2015-01-26,"[['Essaid', 'Amira', '', 'IRISA'], ['Martin', 'Arnaud', '', 'IRISA'], ['Smits', 'Grégory', ''], ['Yaghlane', 'Boutheina Ben', '']]","['Theory of belief functions', 'decision rule', 'Jousselme distance', 'ontology matching']"
3938,2105.10124,Jianghong Zhou,"Jianghong Zhou, Eugene Agichtein",RLIRank: Learning to Rank with Reinforcement Learning for Dynamic Search,"Proceedings of The Web Conference 2020 (WWW '20), April 20--24, 2020,
  Taipei, Taiwan","WWW '20: Proceedings of The Web Conference 2020 April 2020 Pages
  2842-2848",10.1145/3366423.3380047,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  To support complex search tasks, where the initial information requirements
are complex or may change during the search, a search engine must adapt the
information delivery as the user's information requirements evolve. To support
this dynamic ranking paradigm effectively, search result ranking must
incorporate both the user feedback received, and the information displayed so
far. To address this problem, we introduce a novel reinforcement learning-based
approach, RLIrank. We first build an adapted reinforcement learning framework
to integrate the key components of the dynamic search. Then, we implement a new
Learning to Rank (LTR) model for each iteration of the dynamic search, using a
recurrent Long Short Term Memory neural network (LSTM), which estimates the
gain for each next result, learning from each previously ranked document. To
incorporate the user's feedback, we develop a word-embedding variation of the
classic Rocchio Algorithm, to help guide the ranking towards the high-value
documents. Those innovations enable RLIrank to outperform the previously
reported methods from the TREC Dynamic Domain Tracks 2017 and exceed all the
methods in 2016 TREC Dynamic Domain after multiple search iterations, advancing
the state of the art for dynamic search.
","[{'version': 'v1', 'created': 'Fri, 21 May 2021 04:30:17 GMT'}]",2021-05-24,"[['Zhou', 'Jianghong', ''], ['Agichtein', 'Eugene', '']]","['dynamic search ranking', 'deep reinforcement Learning to Rank', 'Learning to Rank for dynamic search']"
3939,1612.05827,\'Atila Jones,"\'Atila A. Jones, F\'abio Protti and Renata R. Del-Vecchio",Cograph generation with linear delay,"22 pages, 3 figures. Submitted to Theoretical Computer Science","Theoretical Computer Science Volume 713, 22 February 2018, Pages
  1-10",10.1016/j.tcs.2017.12.037,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cographs have always been a research target in areas such as coloring, graph
decomposition, and spectral theory. In this work, we present an algorithm to
generate all unlabeled cographs with $n$ vertices, based on the generation of
cotrees. The delay of our algorithm (time spent between two consecutive
outputs) is $O(n)$. The time needed to generate the first output is also
$O(n)$, which gives an overall $O(n\,M_n)$ time complexity, where $M_n$ is the
number of unlabeled cographs with $n$ vertices. The algorithm avoids the
generation of duplicates (isomorphic outputs) and produces, as a by-product, a
linear ordering of unlabeled cographs wih $n$ vertices.
","[{'version': 'v1', 'created': 'Sat, 17 Dec 2016 21:32:44 GMT'}]",2018-10-31,"[['Jones', 'Átila A.', ''], ['Protti', 'Fábio', ''], ['Del-Vecchio', 'Renata R.', '']]","['Cographs', 'Enumarative Combinatorics', 'EnumerativeAlgorithms']"
3940,1401.1152,Radek Stefan,"Michal Bene\v{s}, Radek \v{S}tefan","Hygro-thermo-mechanical analysis of spalling in concrete walls at high
  temperatures as a moving boundary problem",,,10.1016/j.ijheatmasstransfer.2015.01.050,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A mathematical model allowing coupled hygro-thermo-mechanical analysis of
spalling in concrete walls at high temperatures by means of the moving boundary
problem is presented. A simplified mechanical approach to account for effects
of thermal stresses and pore pressure build-up on spalling is incorporated into
the model. The numerical algorithm based on finite element discretization in
space and the semi-implicit method for discretization in time is presented. The
validity of the developed model is carefully examined by a comparison between
experimental tests performed by Kalifa et al. (2000) and Mindeguia (2009) on
concrete prismatic specimens under unidirectional heating of temperature of 600
${\deg}$C and ISO 834 fire curve and the results obtained from the numerical
model.
","[{'version': 'v1', 'created': 'Mon, 6 Jan 2014 17:42:41 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Jan 2014 08:46:25 GMT'}, {'version': 'v3', 'created': 'Fri, 9 Jan 2015 14:24:19 GMT'}]",2015-02-13,"[['Beneš', 'Michal', ''], ['Štefan', 'Radek', '']]","['concrete', 'high temperature', 'spalling', 'hygro-thermo-mechanical analysis', 'movingboundary', 'thermal stress', 'pore pressure', 'finite element method']"
3941,1801.03563,Nia Dowell,"Nia Dowell, Tristian Nixon, and Arthur Graesser","Group Communication Analysis: A Computational Linguistics Approach for
  Detecting Sociocognitive Roles in Multi-Party Interactions",,Behavior Research Methods 2018,10.3758/s13428-018-1102-z,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Roles are one of the most important concepts in understanding human
sociocognitive behavior. During group interactions, members take on different
roles within the discussion. Roles have distinct patterns of behavioral
engagement (i.e., active or passive, leading or following), contribution
characteristics (i.e., providing new information or echoing given material),
and social orientation (i.e., individual or group). Different combinations of
these roles can produce characteristically different group outcomes, being
either less or more productive towards collective goals. In online
collaborative learning environments, this can lead to better or worse learning
outcomes for the individual participants. In this study, we propose and
validate a novel approach for detecting emergent roles from the participants'
contributions and patterns of interaction. Specifically, we developed a group
communication analysis (GCA) by combining automated computational linguistic
techniques with analyses of the sequential interactions of online group
communication. The GCA was applied to three large collaborative interaction
datasets (participant N = 2,429; group N = 3,598). Cluster analyses and linear
mixed-effects modeling were used to assess the validity of the GCA approach and
the influence of learner roles on student and group performance. The results
indicate that participants' patterns in linguistic coordination and cohesion
are representative of the roles that individuals play in collaborative
discussions. More broadly, GCA provides a framework for researchers to explore
the micro intra- and interpersonal patterns associated with the participants'
roles and the sociocognitive processes related to successful collaboration.
","[{'version': 'v1', 'created': 'Sun, 7 Jan 2018 15:18:21 GMT'}]",2018-08-22,"[['Dowell', 'Nia', ''], ['Nixon', 'Tristian', ''], ['Graesser', 'Arthur', '']]","['Group communication analysis', 'social roles', 'group interaction', 'computational']"
3942,1502.02245,Yuantao Gu,Xinyue Shen and Yuantao Gu,"Restricted Isometry Property of Subspace Projection Matrix Under Random
  Compression","11 pages, 1 figure, journal paper",,10.1109/LSP.2015.2402206,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Structures play a significant role in the field of signal processing. As a
representative of structural data, low rank matrix along with its restricted
isometry property (RIP) has been an important research topic in compressive
signal processing. Subspace projection matrix is a kind of low rank matrix with
additional structure, which allows for further reduction of its intrinsic
dimension. This leaves room for improving its own RIP, which could work as the
foundation of compressed subspace projection matrix recovery. In this work, we
study the RIP of subspace projection matrix under random orthonormal
compression. Considering the fact that subspace projection matrices of $s$
dimensional subspaces in $\mathbb{R}^N$ form an $s(N-s)$ dimensional
submanifold in $\mathbb{R}^{N\times N}$, our main concern is transformed to the
stable embedding of such submanifold into $\mathbb{R}^{N\times N}$. The result
is that by $O(s(N-s)\log N)$ number of random measurements the RIP of subspace
projection matrix is guaranteed.
","[{'version': 'v1', 'created': 'Sun, 8 Feb 2015 13:21:11 GMT'}]",2015-06-23,"[['Shen', 'Xinyue', ''], ['Gu', 'Yuantao', '']]","['restricted isometry property', 'subspace projection matrix', 'low rankmatrix', 'manifold stable embedding', 'compressive signal processing']"
3943,1908.00500,Frederik Dennig,"David Pomerenke, Frederik L. Dennig, Daniel A. Keim, Johannes Fuchs,
  Michael Blumenschein","Slope-Dependent Rendering of Parallel Coordinates to Reduce Density
  Distortion and Ghost Clusters","5 pages, 5 figures, LaTeX; added DOI",2019 IEEE Visualization Conference (VIS),10.1109/VISUAL.2019.8933706,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parallel coordinates are a popular technique to visualize multi-dimensional
data. However, they face a significant problem influencing the perception and
interpretation of patterns. The distance between two parallel lines differs
based on their slope. Vertical lines are rendered longer and closer to each
other than horizontal lines. This problem is inherent in the technique and has
two main consequences: (1) clusters which have a steep slope between two axes
are visually more prominent than horizontal clusters. (2) Noise and clutter can
be perceived as clusters, as a few parallel vertical lines visually emerge as a
ghost cluster. Our paper makes two contributions: First, we formalize the
problem and show its impact. Second, we present a novel technique to reduce the
effects by rendering the polylines of the parallel coordinates based on their
slope: horizontal lines are rendered with the default width, lines with a steep
slope with a thinner line. Our technique avoids density distortions of
clusters, can be computed in linear time, and can be added on top of most
parallel coordinate variations. To demonstrate the usefulness, we show examples
and compare them to the classical rendering.
","[{'version': 'v1', 'created': 'Thu, 1 Aug 2019 16:51:00 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Apr 2020 15:21:07 GMT'}]",2020-04-24,"[['Pomerenke', 'David', ''], ['Dennig', 'Frederik L.', ''], ['Keim', 'Daniel A.', ''], ['Fuchs', 'Johannes', ''], ['Blumenschein', 'Michael', '']]","['Parallel coordinates', 'rendering', 'density distortion']"
3944,1905.02196,Wenjie Hu,"Wenjie Hu, Jay Harshadbhai Patel, Zoe-Alanah Robert, Paul Novosad,
  Samuel Asher, Zhongyi Tang, Marshall Burke, David Lobell, Stefano Ermon","Mapping Missing Population in Rural India: A Deep Learning Approach with
  Satellite Imagery",7 pages,"AAAI/ACM Conference on AI, Ethics, and Society (AIES '19), January
  27-28, 2019, Honolulu, HI, USA",10.1145/3306618.3314263,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Millions of people worldwide are absent from their country's census.
Accurate, current, and granular population metrics are critical to improving
government allocation of resources, to measuring disease control, to responding
to natural disasters, and to studying any aspect of human life in these
communities. Satellite imagery can provide sufficient information to build a
population map without the cost and time of a government census. We present two
Convolutional Neural Network (CNN) architectures which efficiently and
effectively combine satellite imagery inputs from multiple sources to
accurately predict the population density of a region. In this paper, we use
satellite imagery from rural villages in India and population labels from the
2011 SECC census. Our best model achieves better performance than previous
papers as well as LandScan, a community standard for global population
distribution.
","[{'version': 'v1', 'created': 'Sat, 4 May 2019 18:33:22 GMT'}]",2019-05-08,"[['Hu', 'Wenjie', ''], ['Patel', 'Jay Harshadbhai', ''], ['Robert', 'Zoe-Alanah', ''], ['Novosad', 'Paul', ''], ['Asher', 'Samuel', ''], ['Tang', 'Zhongyi', ''], ['Burke', 'Marshall', ''], ['Lobell', 'David', ''], ['Ermon', 'Stefano', '']]","['deep learning', 'convolutional neural network', 'computer vision', 'satellite imagery', 'census', 'population']"
3945,1608.06716,Mahamad Suhil,"D. S. Guru, Mahamad Suhil and P. Lolika",A Novel Approach for Shot Boundary Detection in Videos,"12 pages, 2 figures, 2 tables; Conference: Multimedia Processing,
  Communication and Computing Applications, 2012","ICMCCA, Springer LNEE 213, pp. 209-220, Springer India (2013)",10.1007/978-81-322-1143-3_17,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel approach for video shot boundary detection. The
proposed approach is based on split and merge concept. A fisher linear
discriminant criterion is used to guide the process of both splitting and
merging. For the purpose of capturing the between class and within class
scatter we employ 2D2 FLD method which works on texture feature of regions in
each frame of a video. Further to reduce the complexity of the process we
propose to employ spectral clustering to group related regions together to a
single there by achieving reduction in dimension. The proposed method is
experimentally also validated on a cricket video. It is revealed that shots
obtained by the proposed approach are highly cohesive and loosely coupled
","[{'version': 'v1', 'created': 'Wed, 24 Aug 2016 05:19:52 GMT'}]",2016-08-25,"[['Guru', 'D. S.', ''], ['Suhil', 'Mahamad', ''], ['Lolika', 'P.', '']]","['shot boundary detection', 'split and merge', 'FLD', 'texture', 'spectral clustering']"
3946,2011.13305,Carsten Hahn,"Carsten Hahn, Sebastian Feld, Hannes Schroter","Predictive Collision Management for Time and Risk Dependent Path
  Planning",Extended version of the SIGSPATIAL '20 paper,"Proceedings of the 28th ACM SIGSPATIAL International Conference on
  Advances in Geographic Information Systems (SIGSPATIAL '20), 2020, Pages
  405-408",10.1145/3397536.3422252,,cs.LG cs.AI cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autonomous agents such as self-driving cars or parcel robots need to
recognize and avoid possible collisions with obstacles in order to move
successfully in their environment. Humans, however, have learned to predict
movements intuitively and to avoid obstacles in a forward-looking way. The task
of collision avoidance can be divided into a global and a local level.
Regarding the global level, we propose an approach called ""Predictive Collision
Management Path Planning"" (PCMP). At the local level, solutions for collision
avoidance are used that prevent an inevitable collision. Therefore, the aim of
PCMP is to avoid unnecessary local collision scenarios using predictive
collision management. PCMP is a graph-based algorithm with a focus on the time
dimension consisting of three parts: (1) movement prediction, (2) integration
of movement prediction into a time-dependent graph, and (3) time and
risk-dependent path planning. The algorithm combines the search for a shortest
path with the question: is the detour worth avoiding a possible collision
scenario? We evaluate the evasion behavior in different simulation scenarios
and the results show that a risk-sensitive agent can avoid 47.3% of the
collision scenarios while making a detour of 1.3%. A risk-averse agent avoids
up to 97.3% of the collision scenarios with a detour of 39.1%. Thus, an agent's
evasive behavior can be controlled actively and risk-dependent using PCMP.
","[{'version': 'v1', 'created': 'Thu, 26 Nov 2020 14:15:54 GMT'}]",2020-11-30,"[['Hahn', 'Carsten', ''], ['Feld', 'Sebastian', ''], ['Schroter', 'Hannes', '']]","['Time and Risk Dependent Path Planning', 'Trajectory Prediction', 'Artificial Neural Networks', 'Autonomous Agents']"
3947,1304.5107,Pablo Dorta-Gonzalez,Pablo Dorta-Gonzalez and Maria Isabel Dorta-Gonzalez,"Comparing journals from different fields of Science and Social Science
  through a JCR Subject Categories Normalized Impact Factor","28 pages, 4 tables and 5 figures. arXiv admin note: text overlap with
  arXiv:1007.4749 by other authors","Scientometrics 95(2), 645-672 (2013)",10.1007/s11192-012-0929-9,,cs.DL physics.soc-ph stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The journal Impact Factor (IF) is not comparable among fields of Science and
Social Science because of systematic differences in publication and citation
behaviour across disciplines. In this work, a decomposing of the field
aggregate impact factor into five normally distributed variables is presented.
Considering these factors, a Principal Component Analysis is employed to find
the sources of the variance in the JCR subject categories of Science and Social
Science. Although publication and citation behaviour differs largely across
disciplines, principal components explain more than 78% of the total variance
and the average number of references per paper is not the primary factor
explaining the variance in impact factors across categories. The Categories
Normalized Impact Factor (CNIF) based on the JCR subject category list is
proposed and compared with the IF. This normalization is achieved by
considering all the indexing categories of each journal. An empirical
application, with one hundred journals in two or more subject categories of
economics and business, shows that the gap between rankings is reduced around
32% in the journals analyzed. This gap is obtained as the maximum distance
among the ranking percentiles from all categories where each journal is
included.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2013 12:36:49 GMT'}]",2013-04-19,"[['Dorta-Gonzalez', 'Pablo', ''], ['Dorta-Gonzalez', 'Maria Isabel', '']]","['citation', 'impact factor', 'journal evaluation', 'source normalized indicator', 'JCR subject categories']"
3948,1706.06920,Anton Eremeev,"A.V. Eremeev, Yu.V. Kovalenko","Genetic Algorithm with Optimal Recombination for the Asymmetric
  Travelling Salesman Problem","Proc. of The 11th International Conference on Large-Scale Scientific
  Computations (LSSC-17), June 5 - 9, 2017, Sozopol, Bulgaria",,10.1007/978-3-319-73441-5_36,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new genetic algorithm with optimal recombination for the
asymmetric instances of travelling salesman problem. The algorithm incorporates
several new features that contribute to its effectiveness: (i) Optimal
recombination problem is solved within crossover operator. (ii) A new mutation
operator performs a random jump within 3-opt or 4-opt neighborhood. (iii)
Greedy constructive heuristic of W.Zhang and 3-opt local search heuristic are
used to generate the initial population. A computational experiment on TSPLIB
instances shows that the proposed algorithm yields competitive results to other
well-known memetic algorithms for asymmetric travelling salesman problem.
","[{'version': 'v1', 'created': 'Wed, 21 Jun 2017 14:14:13 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Dec 2017 04:44:07 GMT'}]",2017-12-20,"[['Eremeev', 'A. V.', ''], ['Kovalenko', 'Yu. V.', '']]","['Genetic Algorithm', 'Optimal Recombination', 'Local Search']"
3949,2102.05444,Nicolas Heist,Nicolas Heist and Heiko Paulheim,Information Extraction From Co-Occurring Similar Entities,"Preprint of a paper accepted for the research track of the Web
  Conference (WWW'21), April 19-23, 2021, Ljubljana, Slovenia",,10.1145/3442381.3449836,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Knowledge about entities and their interrelations is a crucial factor of
success for tasks like question answering or text summarization. Publicly
available knowledge graphs like Wikidata or DBpedia are, however, far from
being complete. In this paper, we explore how information extracted from
similar entities that co-occur in structures like tables or lists can help to
increase the coverage of such knowledge graphs. In contrast to existing
approaches, we do not focus on relationships within a listing (e.g., between
two entities in a table row) but on the relationship between a listing's
subject entities and the context of the listing. To that end, we propose a
descriptive rule mining approach that uses distant supervision to derive rules
for these relationships based on a listing's context. Extracted from a suitable
data corpus, the rules can be used to extend a knowledge graph with novel
entities and assertions. In our experiments we demonstrate that the approach is
able to extract up to 3M novel entities and 30M additional assertions from
listings in Wikipedia. We find that the extracted information is of high
quality and thus suitable to extend Wikipedia-based knowledge graphs like
DBpedia, YAGO, and CaLiGraph. For the case of DBpedia, this would result in an
increase of covered entities by roughly 50%.
","[{'version': 'v1', 'created': 'Wed, 10 Feb 2021 14:03:59 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Feb 2021 09:23:03 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Feb 2021 10:17:09 GMT'}]",2021-02-16,"[['Heist', 'Nicolas', ''], ['Paulheim', 'Heiko', '']]","['Entity co-occurrence', 'Information extraction', 'Novel entity detection', 'CaLiGraph', 'DBpedia']"
3950,1806.11316,Oluwaseun Ajao,"Oluwaseun Ajao, Deepayan Bhowmik and Shahrzad Zargari",Fake News Identification on Twitter with Hybrid CNN and RNN Models,5 Pages,"Oluwaseun Ajao, Deepayan Bhowmik, and Shahrzad Zargari. 2018. Fake
  News Identification on Twitter with Hybrid CNN and RNN Models. In Proceedings
  of the International Conference on Social Media & Society, Copenhagen,
  Denmark (SMSociety)",10.1145/3217804.3217917,Jul 2018,cs.SI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem associated with the propagation of fake news continues to grow at
an alarming scale. This trend has generated much interest from politics to
academia and industry alike. We propose a framework that detects and classifies
fake news messages from Twitter posts using hybrid of convolutional neural
networks and long-short term recurrent neural network models. The proposed work
using this deep learning approach achieves 82% accuracy. Our approach
intuitively identifies relevant features associated with fake news stories
without previous knowledge of the domain.
","[{'version': 'v1', 'created': 'Fri, 29 Jun 2018 09:36:46 GMT'}]",2018-07-02,"[['Ajao', 'Oluwaseun', ''], ['Bhowmik', 'Deepayan', ''], ['Zargari', 'Shahrzad', '']]","['Fake News', 'Twitter', 'Social Media']"
3951,cs/0404054,Matthias Bauer,Matthias Bauer,New Covert Channels in HTTP,7 pages,"Proceedings of the 2003 ACM Workshop on Privacy in the Electronic
  Society",,,cs.CR cs.NI,,"  This paper presents new methods enabling anonymous communication on the
Internet. We describe a new protocol that allows us to create an anonymous
overlay network by exploiting the web browsing activities of regular users. We
show that the overlay network provides an anonymity set greater than the set of
senders and receivers in a realistic threat model. In particular, the protocol
provides unobservability in our threat model.
","[{'version': 'v1', 'created': 'Mon, 26 Apr 2004 17:20:30 GMT'}]",2007-05-23,"[['Bauer', 'Matthias', '']]","['Covert channel', 'HTTP', 'mixnetwork', 'anonymity']"
3952,1502.06111,Renaud Lacour,"Kathrin Klamroth, Renaud Lacour, Daniel Vanderpooten","On the representation of the search region in multi-objective
  optimization","27 pages, to appear in European Journal of Operational Research",,10.1016/j.ejor.2015.03.031,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a finite set $N$ of feasible points of a multi-objective optimization
(MOO) problem, the search region corresponds to the part of the objective space
containing all the points that are not dominated by any point of $N$, i.e. the
part of the objective space which may contain further nondominated points. In
this paper, we consider a representation of the search region by a set of tight
local upper bounds (in the minimization case) that can be derived from the
points of $N$. Local upper bounds play an important role in methods for
generating or approximating the nondominated set of an MOO problem, yet few
works in the field of MOO address their efficient incremental determination. We
relate this issue to the state of the art in computational geometry and provide
several equivalent definitions of local upper bounds that are meaningful in
MOO. We discuss the complexity of this representation in arbitrary dimension,
which yields an improved upper bound on the number of solver calls in
epsilon-constraint-like methods to generate the nondominated set of a discrete
MOO problem. We analyze and enhance a first incremental approach which operates
by eliminating redundancies among local upper bounds. We also study some
properties of local upper bounds, especially concerning the issue of redundant
local upper bounds, that give rise to a new incremental approach which avoids
such redundancies. Finally, the complexities of the incremental approaches are
compared from the theoretical and empirical points of view.
","[{'version': 'v1', 'created': 'Sat, 21 Feb 2015 15:58:57 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Mar 2015 19:00:39 GMT'}, {'version': 'v3', 'created': 'Mon, 13 Apr 2015 13:45:23 GMT'}]",2015-04-14,"[['Klamroth', 'Kathrin', ''], ['Lacour', 'Renaud', ''], ['Vanderpooten', 'Daniel', '']]","['Multiple objective programming', 'Search region', 'Local upperbounds', 'Generic solution approaches']"
3953,1406.3496,Hadi Fanaee-T,Hadi Fanaee-T and Jo\~ao Gama,"EigenEvent: An Algorithm for Event Detection from Complex Data Streams
  in Syndromic Surveillance","To appear in Intelligent Data Analysis Journal, vol. 19(3), 2015","PP. 597-616, Vol. 19, No. 3, June 2015, Intelligent Data Analysis",10.3233/IDA-150734,,cs.AI cs.LG stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Syndromic surveillance systems continuously monitor multiple pre-diagnostic
daily streams of indicators from different regions with the aim of early
detection of disease outbreaks. The main objective of these systems is to
detect outbreaks hours or days before the clinical and laboratory confirmation.
The type of data that is being generated via these systems is usually
multivariate and seasonal with spatial and temporal dimensions. The algorithm
What's Strange About Recent Events (WSARE) is the state-of-the-art method for
such problems. It exhaustively searches for contrast sets in the multivariate
data and signals an alarm when find statistically significant rules. This
bottom-up approach presents a much lower detection delay comparing the existing
top-down approaches. However, WSARE is very sensitive to the small-scale
changes and subsequently comes with a relatively high rate of false alarms. We
propose a new approach called EigenEvent that is neither fully top-down nor
bottom-up. In this method, we instead of top-down or bottom-up search, track
changes in data correlation structure via eigenspace techniques. This new
methodology enables us to detect both overall changes (via eigenvalue) and
dimension-level changes (via eigenvectors). Experimental results on hundred
sets of benchmark data reveals that EigenEvent presents a better overall
performance comparing state-of-the-art, in particular in terms of the false
alarm rate.
","[{'version': 'v1', 'created': 'Fri, 13 Jun 2014 10:38:09 GMT'}]",2015-04-30,"[['Fanaee-T', 'Hadi', ''], ['Gama', 'João', '']]","['Event Detection', 'Complex Data Streams', 'Tensor Decomposition', 'Syndromic Surveillance']"
3954,1807.02221,Ganna Pogrebna Dr,"Marco Del Vecchio, Alexander Kharlamov, Glenn Parry, Ganna Pogrebna","The Data Science of Hollywood: Using Emotional Arcs of Movies to Drive
  Business Model Innovation in Entertainment Industries",,"Journal of the Operational Research Society, 2020",10.1080/01605682.2019.1705194,,cs.CL cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Much of business literature addresses the issues of consumer-centric design:
how can businesses design customized services and products which accurately
reflect consumer preferences? This paper uses data science natural language
processing methodology to explore whether and to what extent emotions shape
consumer preferences for media and entertainment content. Using a unique
filtered dataset of 6,174 movie scripts, we generate a mapping of screen
content to capture the emotional trajectory of each motion picture. We then
combine the obtained mappings into clusters which represent groupings of
consumer emotional journeys. These clusters are used to predict overall success
parameters of the movies including box office revenues, viewer satisfaction
levels (captured by IMDb ratings), awards, as well as the number of viewers'
and critics' reviews. We find that like books all movie stories are dominated
by 6 basic shapes. The highest box offices are associated with the Man in a
Hole shape which is characterized by an emotional fall followed by an emotional
rise. This shape results in financially successful movies irrespective of genre
and production budget. Yet, Man in a Hole succeeds not because it produces most
""liked"" movies but because it generates most ""talked about"" movies.
Interestingly, a carefully chosen combination of production budget and genre
may produce a financially successful movie with any emotional shape.
Implications of this analysis for generating on-demand content and for driving
business model innovation in entertainment industries are discussed.
","[{'version': 'v1', 'created': 'Fri, 6 Jul 2018 01:59:42 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Jul 2018 22:39:44 GMT'}]",2020-03-23,"[['Del Vecchio', 'Marco', ''], ['Kharlamov', 'Alexander', ''], ['Parry', 'Glenn', ''], ['Pogrebna', 'Ganna', '']]","['sentiment analysis', 'sentiment mining', 'consumer-centric design', 'entertainment', 'emotions', 'storytelling']"
3955,1303.1971,Mariana de Azevedo Santos Mrs.,"Mariana de Azevedo Santos, Paulo Henrique de Souza Bermejo, Marcelo
  Silva de Oliveira, Adriano Ol\'impio Tonelli, Enio J\'unior Seidel","Improving the management of cost and scope in software projects using
  agile practices",47-64pp,"International Journal of Computer Science & Information Technology
  (IJCSIT) Vol 5, No 1, February 2013",10.5121/ijcsit.2013.5104,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  While organizations want to develop software products with reduced cost and
flexible scope, stories about the applicability of agile practices to improve
project development and performance in the software industry are scarce and
focused on specific methodologies such as Scrum and XP. Given these facts, this
paper aims to investigate, through practitioners' perceptions of value, which
agile practices are being used to improve two performance criteria for software
projects-cost and scope. Using a multivariate statistical technique known as
Exploratory Factor Analysis (EFA), the results suggest that the use of agile
practices can be represented in factors which describe different applications
in software development process to improve cost and scope. Also, we conclude
that some agile practices should be used together in order to get better
efficiency on cost and scope in four development aspects: improving (a) team
abilities, (b)management of requirements, (c) quality of the code developed,
and (d) delivery of software on-budget and on-time.
","[{'version': 'v1', 'created': 'Fri, 8 Mar 2013 12:28:44 GMT'}]",2013-03-11,"[['Santos', 'Mariana de Azevedo', ''], ['Bermejo', 'Paulo Henrique de Souza', ''], ['de Oliveira', 'Marcelo Silva', ''], ['Tonelli', 'Adriano Olímpio', ''], ['Seidel', 'Enio Júnior', '']]","['Agile practices', 'Factor Analysis', 'software project management', 'scope', 'cost', 'software engineering']"
3956,1312.2083,Beena R,"R.Beena, S.Sarala",Code Coverage Based Test Case Selection and Prioritization,"11 pages,4 figures,10 tables","International Journal of Software Engineering & Applications
  (IJSEA), Vol.4, No.6, November 2013",10.5121/ijsea.2013.4604,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Regression Testing is exclusively executed to guarantee the desirable
functionality of existing software after pursuing quite a few amendments or
variations in it. Perhaps, it testifies the quality of the modified software by
concealing the regressions or software bugs in both functional and
non-functional applications of the system. In fact, the maintenance of test
suite is enormous as it necessitates a big investment of time and money on test
cases on a large scale. So, minimizing the test suite becomes the indispensable
requisite to lessen the budget on regression testing. Precisely, this research
paper aspires to present an innovative approach for the effective selection and
prioritization of test cases which in return may procure a maximum code
average.
","[{'version': 'v1', 'created': 'Sat, 7 Dec 2013 10:52:50 GMT'}]",2013-12-10,"[['Beena', 'R.', ''], ['Sarala', 'S.', '']]","['Test Case Selection', 'Test Case Prioritization', 'Code Coverage']"
3957,1810.08111,Nils Dorsch,"Nils Dorsch, Fabian Kurtz, Christian Wietfeld","Enabling Hard Service Guarantees in Software-Defined Smart Grid
  Infrastructures","63 pages, 17 figures","Computer Networks, Volume 147, 24 December 2018, Pages 112-131",10.1016/j.comnet.2018.10.008,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information and Communication Technology (ICT) infrastructures play a key
role in the evolution from traditional power systems to Smart Grids.
Increasingly fluctuating power flows, sparked by the transition towards
sustainable energy generation, become a major issue for power grid stability.
To deal with this challenge, future Smart Grids require precise monitoring and
control, which in turn demand for reliable, real-time capable and
cost-efficient communications. For this purpose, we propose applying
Software-Defined Networking (SDN) to handle the manifold requirements of Smart
Grid communications. To achieve reliability, our approach encompasses fast
recovery after failures in the communication network and dynamic service-aware
network (re-)configuration. Network Calculus (NC) logic is embedded into our
SDN controller for meeting latency requirements imposed by the standard IEC
61850 of the International Electrotechnical Committee (IEC). Thus, routing
provides delay-optimal paths under consideration of existing cross traffic.
Also, continuous latency bound compliance is ensured by combining NC delay
supervision with means of flexible reconfiguration. For evaluation we consider
the well-known Nordic 32 test system, on which we map a corresponding
communication network in both experiment and emulation. The described
functionalities are validated, employing realistic IEC 61850 transmissions and
distributed control traffic. Our results show that hard service guarantees can
be ensured with the help of the proposed SDN solution. On this basis, we derive
extremely time critical services, which must not be subjected to flexible
reconfiguration.
","[{'version': 'v1', 'created': 'Thu, 18 Oct 2018 15:34:29 GMT'}]",2018-10-19,"[['Dorsch', 'Nils', ''], ['Kurtz', 'Fabian', ''], ['Wietfeld', 'Christian', '']]","['Smart Grid Communications', 'Mission Critical Systems', 'Hard']"
3958,1804.02445,Noah Siegel,"Noah Siegel, Nicholas Lourie, Russell Power, Waleed Ammar",Extracting Scientific Figures with Distantly Supervised Neural Networks,"10 pages, 5 figures, paper accepted at JCDL 2018",,10.1145/3197026.3197040,,cs.DL cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Non-textual components such as charts, diagrams and tables provide key
information in many scientific documents, but the lack of large labeled
datasets has impeded the development of data-driven methods for scientific
figure extraction. In this paper, we induce high-quality training labels for
the task of figure extraction in a large number of scientific documents, with
no human intervention. To accomplish this we leverage the auxiliary data
provided in two large web collections of scientific documents (arXiv and
PubMed) to locate figures and their associated captions in the rasterized PDF.
We share the resulting dataset of over 5.5 million induced labels---4,000 times
larger than the previous largest figure extraction dataset---with an average
precision of 96.8%, to enable the development of modern data-driven methods for
this task. We use this dataset to train a deep neural network for end-to-end
figure detection, yielding a model that can be more easily extended to new
domains compared to previous work. The model was successfully deployed in
Semantic Scholar, a large-scale academic search engine, and used to extract
figures in 13 million scientific documents.
","[{'version': 'v1', 'created': 'Fri, 6 Apr 2018 20:22:47 GMT'}, {'version': 'v2', 'created': 'Wed, 30 May 2018 19:13:53 GMT'}]",2018-06-01,"[['Siegel', 'Noah', ''], ['Lourie', 'Nicholas', ''], ['Power', 'Russell', ''], ['Ammar', 'Waleed', '']]","['Figure Extraction', 'Distant Supervision', 'Deep Learning', 'Neural Networks', 'Computer Vision']"
3959,1107.2990,Sotirios Kentros,Sotirios Kentros and Aggelos Kiayias,Solving the At-Most-Once Problem with Nearly Optimal Effectiveness,"Updated Version. A Brief Announcement was published in PODC 2011. An
  Extended Abstract was published in the proceeding of ICDCN 2012. A full
  version was published in Theoretical Computer Science, Volume 496, 22 July
  2013, Pages 69 - 88","Theoretical Computer Science, Volume 496, 22 July 2013, Pages
  69-88, ISSN 0304-3975",10.1016/j.tcs.2013.04.017,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We present and analyze a wait-free deterministic algorithm for solving the
at-most-once problem: how m shared-memory fail-prone processes perform
asynchronously n jobs at most once. Our algorithmic strategy provides for the
first time nearly optimal effectiveness, which is a measure that expresses the
total number of jobs completed in the worst case. The effectiveness of our
algorithm equals n-2m+2. This is up to an additive factor of m close to the
known effectiveness upper bound n-m+1 over all possible algorithms and improves
on the previously best known deterministic solutions that have effectiveness
only n-log m o(n). We also present an iterative version of our algorithm that
for any $m = O\left(\sqrt[3+\epsilon]{n/\log n}\right)$ is both
effectiveness-optimal and work-optimal, for any constant $\epsilon > 0$. We
then employ this algorithm to provide a new algorithmic solution for the
Write-All problem which is work optimal for any
$m=O\left(\sqrt[3+\epsilon]{n/\log n}\right)$.
","[{'version': 'v1', 'created': 'Fri, 15 Jul 2011 04:24:38 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Dec 2013 00:32:22 GMT'}]",2013-12-04,"[['Kentros', 'Sotirios', ''], ['Kiayias', 'Aggelos', '']]","['at-most-once problem', 'task allocation', 'write-all', 'I/O automata', 'asynchronous sharedmemory', 'deterministic algorithms', 'distributed computing']"
3960,1211.3871,Neelamadhab Padhy Padhy,"Neelamadhab Padhy, Rasmita Panigrahi",Multi Relational Data Mining Approaches: A Data Mining Technique,"10 pages, 1 Figure, 3 Tables ""Published with International Journal of
  Computer Applications (IJCA)""",,10.5120/9207-3742,,cs.DB,http://creativecommons.org/licenses/publicdomain/,"  The multi relational data mining approach has developed as an alternative way
for handling the structured data such that RDBMS. This will provides the mining
in multiple tables directly. In MRDM the patterns are available in multiple
tables (relations) from a relational database. As the data are available over
the many tables which will affect the many problems in the practice of the data
mining. To deal with this problem, one either constructs a single table by
Propositionalisation, or uses a Multi-Relational Data Mining algorithm. MRDM
approaches have been successfully applied in the area of bioinformatics. Three
popular pattern finding techniques classification, clustering and association
are frequently used in MRDM. Multi relational approach has developed as an
alternative for analyzing the structured data such as relational database. MRDM
allowing applying directly in the data mining in multiple tables. To avoid the
expensive joining operations and semantic losses we used the MRDM technique.
This paper focuses some of the application areas of MRDM and feature directions
as well as the comparison of ILP, GM, SSDM and MRDM
","[{'version': 'v1', 'created': 'Fri, 16 Nov 2012 12:07:11 GMT'}]",2012-11-19,"[['Padhy', 'Neelamadhab', ''], ['Panigrahi', 'Rasmita', '']]","['Data Mining', 'Multi-Relational Data mining', 'Inductive logic programming', 'Selection graph', 'Tuple ID propagation']"
3961,1405.6163,Borui Li,"Borui Li, Chundi Mu, Tao Wang, Qian Peng","Revised Version of a JCIT Paper-Comparison of Feature Point Extraction
  Algorithms for Vision Based Autonomous Aerial Refueling",,"Journal of Convergence Information Technology. 2012, 7(20):
  108-118",10.4156/jcit.vol7.issue20.14,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This is a revised version of our paper published in Journal of Convergence
Information Technology(JCIT): ""Comparison of Feature Point Extraction
Algorithms for Vision Based Autonomous Aerial Refueling"". We corrected some
errors including measurement unit errors, spelling errors and so on. Since the
published papers in JCIT are not allowed to be modified, we submit the revised
version to arXiv.org to make the paper more rigorous and not to confuse other
researchers.
","[{'version': 'v1', 'created': 'Mon, 28 Apr 2014 16:12:43 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Jun 2014 11:30:23 GMT'}]",2014-06-05,"[['Li', 'Borui', ''], ['Mu', 'Chundi', ''], ['Wang', 'Tao', ''], ['Peng', 'Qian', '']]","['Autonomous aerial refueling', 'Unmanned aerial vehicle', 'Computer vision', 'Feature point']"
3962,1611.03350,Giacomo Berardi,"Giacomo Berardi, Diego Ceccarelli, Andrea Esuli and Diego Marcheggiani",On the Impact of Entity Linking in Microblog Real-Time Filtering,"6 pages, 1 figure, 1 table. SAC 2015, Salamanca, Spain - April 13 -
  17, 2015","Proceedings of the 30th Annual ACM Symposium on Applied Computing
  (SAC 2015). pp 1066-1071. Salamanca, ES, 2015",10.1145/2695664.2695761,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Microblogging is a model of content sharing in which the temporal locality of
posts with respect to important events, either of foreseeable or unforeseeable
nature, makes applica- tions of real-time filtering of great practical
interest. We propose the use of Entity Linking (EL) in order to improve the
retrieval effectiveness, by enriching the representation of microblog posts and
filtering queries. EL is the process of recognizing in an unstructured text the
mention of relevant entities described in a knowledge base. EL of short pieces
of text is a difficult task, but it is also a scenario in which the information
EL adds to the text can have a substantial impact on the retrieval process. We
implement a start-of-the-art filtering method, based on the best systems from
the TREC Microblog track realtime adhoc retrieval and filtering tasks , and
extend it with a Wikipedia-based EL method. Results show that the use of EL
significantly improves over non-EL based versions of the filtering methods.
","[{'version': 'v1', 'created': 'Thu, 10 Nov 2016 15:40:14 GMT'}]",2016-11-11,"[['Berardi', 'Giacomo', ''], ['Ceccarelli', 'Diego', ''], ['Esuli', 'Andrea', ''], ['Marcheggiani', 'Diego', '']]","['Real-time filtering', 'Microblogging', 'Entity Linking']"
3963,2107.14768,Khalil Damak,"Khalil Damak, Sami Khenissi, Olfa Nasraoui",Debiased Explainable Pairwise Ranking from Implicit Feedback,"11 pages, 2 figures, Accepted at RecSys '21","Fifteenth ACM Conference on Recommender Systems (RecSys '21),
  September 27-October 1, 2021, Amsterdam, Netherlands. ACM, New York, NY, USA",10.1145/3460231.3474274,,cs.IR cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent work in recommender systems has emphasized the importance of fairness,
with a particular interest in bias and transparency, in addition to predictive
accuracy. In this paper, we focus on the state of the art pairwise ranking
model, Bayesian Personalized Ranking (BPR), which has previously been found to
outperform pointwise models in predictive accuracy, while also being able to
handle implicit feedback. Specifically, we address two limitations of BPR: (1)
BPR is a black box model that does not explain its outputs, thus limiting the
user's trust in the recommendations, and the analyst's ability to scrutinize a
model's outputs; and (2) BPR is vulnerable to exposure bias due to the data
being Missing Not At Random (MNAR). This exposure bias usually translates into
an unfairness against the least popular items because they risk being
under-exposed by the recommender system. In this work, we first propose a novel
explainable loss function and a corresponding Matrix Factorization-based model
called Explainable Bayesian Personalized Ranking (EBPR) that generates
recommendations along with item-based explanations. Then, we theoretically
quantify additional exposure bias resulting from the explainability, and use it
as a basis to propose an unbiased estimator for the ideal EBPR loss. The result
is a ranking model that aptly captures both debiased and explainable user
preferences. Finally, we perform an empirical study on three real-world
datasets that demonstrate the advantages of our proposed models.
","[{'version': 'v1', 'created': 'Fri, 30 Jul 2021 17:19:37 GMT'}]",2021-08-02,"[['Damak', 'Khalil', ''], ['Khenissi', 'Sami', ''], ['Nasraoui', 'Olfa', '']]","['Fairness in AI', 'Debiased Machine Learning', 'Pairwise Ranking', 'Explainability', 'Exposure Bias']"
3964,1812.03296,Yuri G. Gordienko,"Oleksandr Kovalchuk, Yuri Gordienko, Sergii Stirenko",Impact of MQTT Based Sensor Network Architecture on Delivery Delay Time,"10 pages, 5 figures, 3 tables","In Proc. 2019 IEEE 39th International Conference on Electronics
  and Nanotechnology (ELNANO), 838 - 842 (2019)",10.1109/ELNANO.2019.8783323,,cs.NI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this study is to present two new architectures of the
complexes of embedded systems in the context of the Internet of Things. The
proposed new schemes use the MQTT protocol, but provide both an autonomous
operation and an online mode. This is achieved by adding one additional layer,
which consists of its own MQTT-broker and critical messages handler, so that in
case of the Internet access disappearance, the system could continue to respond
to changes. The research of message delivery delays has been carried out for
the proposed models. The comparative analysis was conducted to identify the
advantages and disadvantages of both solutions.
","[{'version': 'v1', 'created': 'Sat, 8 Dec 2018 10:06:09 GMT'}]",2019-08-05,"[['Kovalchuk', 'Oleksandr', ''], ['Gordienko', 'Yuri', ''], ['Stirenko', 'Sergii', '']]","['Internet of Things', 'embedded systems', 'MQTT protocol', 'architecture of communication']"
3965,1301.2780,Joydeep Basu,Joydeep Basu and Tarun Kanti Bhattacharyya,"Microelectromechanical Resonators for Radio Frequency Communication
  Applications",,"Microsystem Technologies, Oct 2011, vol. 17(10-11), pp. 1557-1580",10.1007/s00542-011-1332-9,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the past few years, microelectromechanical system (MEMS) based on-chip
resonators have shown significant potential for sensing and high frequency
signal processing applications. This is due to their excellent features like
small size, large frequency-quality factor product, low power consumption, low
cost batch fabrication, and integrability with CMOS IC technology. Radio
frequency communication circuits like reference oscillators, filters, and
mixers based on such MEMS resonators can be utilized for meeting the increasing
count of RF components likely to be demanded by the next generation
multi-band/multi-mode wireless devices. MEMS resonators can provide a feasible
alternative to the present day well established quartz crystal technology that
is riddled with major drawbacks like relatively large size, high cost, and low
compatibility with IC chips. This article presents a survey of the developments
in this field of resonant MEMS structures with detailed enumeration on the
various micromechanical resonator types, modes of vibration, equivalent
mechanical and electrical models, materials and technologies used for
fabrication, and the application of the resonators for implementing oscillators
and filters. These are followed by a discussion on the challenges for RF MEMS
technology in comparison to quartz crystal technology; like high precision,
stability, reliability, need for hermetic packaging etc. which remain to be
addressed for enabling the inclusion of micromechanical resonators into
tomorrow's highly integrated communication systems.
","[{'version': 'v1', 'created': 'Sun, 13 Jan 2013 14:38:35 GMT'}]",2013-01-15,"[['Basu', 'Joydeep', ''], ['Bhattacharyya', 'Tarun Kanti', '']]","['filter', 'microelectromechanical system', 'MEMS resonator', 'MEMS-CMOS integration', 'oscillator', 'quality factor', 'RF MEMS', 'wireless communication']"
3966,0910.4049,Nizami Gasilov,"N. Gasilov, \c{S}ahin Emrah Amrahov, A. Golayoglu Fatullayev, H. I.
  Karakas, O. Akin",A Geometric Approach to Solve Fuzzy Linear Systems,,"CMES: Computer Modeling in Engineering & Sciences, Vol. 75, No. 3,
  pp. 189-204, 2011",10.3970/cmes.2011.075.189,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, linear systems with a crisp real coefficient matrix and with a
vector of fuzzy triangular numbers on the right-hand side are studied. A new
method, which is based on the geometric representations of linear
transformations, is proposed to find solutions. The method uses the fact that a
vector of fuzzy triangular numbers forms a rectangular prism in n-dimensional
space and that the image of a parallelepiped is also a parallelepiped under a
linear transformation. The suggested method clarifies why in general case
different approaches do not generate solutions as fuzzy numbers. It is
geometrically proved that if the coefficient matrix is a generalized
permutation matrix, then the solution of a fuzzy linear system (FLS) is a
vector of fuzzy numbers irrespective of the vector on the right-hand side. The
most important difference between this and previous papers on FLS is that the
solution is sought as a fuzzy set of vectors (with real components) rather than
a vector of fuzzy numbers. Each vector in the solution set solves the given FLS
with a certain possibility. The suggested method can also be applied in the
case when the right-hand side is a vector of fuzzy numbers in parametric form.
However, in this case, -cuts of the solution can not be determined by geometric
similarity and additional computations are needed.
","[{'version': 'v1', 'created': 'Wed, 21 Oct 2009 11:20:37 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Apr 2011 08:06:58 GMT'}]",2011-11-03,"[['Gasilov', 'N.', ''], ['Amrahov', 'Şahin Emrah', ''], ['Fatullayev', 'A. Golayoglu', ''], ['Karakas', 'H. I.', ''], ['Akin', 'O.', '']]","['fuzzy linear system', 'triangular fuzzy number', 'generalized permutation matrix']"
3967,1805.11533,Zhenyu Tang,"Nicolas Morales, Zhenyu Tang, Dinesh Manocha","Receiver Placement for Speech Enhancement using Sound Propagation
  Optimization",,"Applied Acoustics Volume 155, 1 December 2019, Pages 53-62",10.1016/j.apacoust.2019.04.037,,cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A common problem in acoustic design is the placement of speakers or receivers
for public address systems, telecommunications, and home smart speakers or
digital personal assistants. We present a novel algorithm to automatically
place a speaker or receiver in a room to improve the intelligibility of spoken
phrases in a design. Our technique uses a sound propagation optimization
formulation to maximize the Speech Transmission Index (STI) by computing an
optimal location of the sound receiver. We use an efficient and accurate hybrid
sound propagation technique on complex 3D models to compute the Room Impulse
Responses (RIR) and evaluate their impact on the STI. The overall algorithm
computes a globally optimal position of the receiver that reduces the effects
of reverberation and noise over many source positions. We evaluate our
algorithm on various indoor 3D models, all showing significant improvement in
STI, based on accurate sound propagation.
","[{'version': 'v1', 'created': 'Tue, 29 May 2018 15:10:42 GMT'}, {'version': 'v2', 'created': 'Wed, 30 May 2018 00:41:16 GMT'}, {'version': 'v3', 'created': 'Sat, 24 Nov 2018 22:26:40 GMT'}]",2020-02-11,"[['Morales', 'Nicolas', ''], ['Tang', 'Zhenyu', ''], ['Manocha', 'Dinesh', '']]","['acoustic design', 'sound propagation', 'speech intelligibility']"
3968,1512.07281,Bruno Gon\c{c}alves,"Qian Zhang, Bruno Gon\c{c}alves",Topical differences between Chinese language Twitter and Sina Weibo,"5 pages, 2 figures, 2 tables, 2 algorithms","2nd Natural Language Processing for Informal Text (NLPIT), 625
  (2016)",10.1145/2872518.2890562,,cs.SI cs.CL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sina Weibo, China's most popular microblogging platform, is currently used by
over $500M$ users and is considered to be a proxy of Chinese social life. In
this study, we contrast the discussions occurring on Sina Weibo and on Chinese
language Twitter in order to observe two different strands of Chinese culture:
people within China who use Sina Weibo with its government imposed restrictions
and those outside that are free to speak completely anonymously. We first
propose a simple ad-hoc algorithm to identify topics of Tweets and Weibo.
Different from previous works on micro-message topic detection, our algorithm
considers topics of the same contents but with different \#tags. Our algorithm
can also detect topics for Tweets and Weibos without any \#tags. Using a large
corpus of Weibo and Chinese language tweets, covering the period from January
$1$ to December $31$, $2012$, we obtain a list of topics using clustered \#tags
that we can then use to compare the two platforms. Surprisingly, we find that
there are no common entries among the Top $100$ most popular topics.
Furthermore, only $9.2\%$ of tweets correspond to the Top $1000$ topics on Sina
Weibo platform, and conversely only $4.4\%$ of weibos were found to discuss the
most popular Twitter topics. Our results reveal significant differences in
social attention on the two platforms, with most popular topics on Sina Weibo
relating to entertainment while most tweets corresponded to cultural or
political contents that is practically non existent in Sina Weibo.
","[{'version': 'v1', 'created': 'Tue, 22 Dec 2015 22:13:31 GMT'}]",2016-04-13,"[['Zhang', 'Qian', ''], ['Gonçalves', 'Bruno', '']]","['Topic detection on short-message', 'Social Attention', 'Twitter', 'Weibo', 'Social media', 'Online Behavior']"
3969,2008.01699,Murari Mandal,"Murari Mandal, Lav Kush Kumar, Santosh Kumar Vipparthi","MOR-UAV: A Benchmark Dataset and Baselines for Moving Object Recognition
  in UAV Videos",,ACM Multimedia (ACM MM-2020),,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visual data collected from Unmanned Aerial Vehicles (UAVs) has opened a new
frontier of computer vision that requires automated analysis of aerial
images/videos. However, the existing UAV datasets primarily focus on object
detection. An object detector does not differentiate between the moving and
non-moving objects. Given a real-time UAV video stream, how can we both
localize and classify the moving objects, i.e. perform moving object
recognition (MOR)? The MOR is one of the essential tasks to support various UAV
vision-based applications including aerial surveillance, search and rescue,
event recognition, urban and rural scene understanding.To the best of our
knowledge, no labeled dataset is available for MOR evaluation in UAV videos.
Therefore, in this paper, we introduce MOR-UAV, a large-scale video dataset for
MOR in aerial videos. We achieve this by labeling axis-aligned bounding boxes
for moving objects which requires less computational resources than producing
pixel-level estimates. We annotate 89,783 moving object instances collected
from 30 UAV videos, consisting of 10,948 frames in various scenarios such as
weather conditions, occlusion, changing flying altitude and multiple camera
views. We assigned the labels for two categories of vehicles (car and heavy
vehicle). Furthermore, we propose a deep unified framework MOR-UAVNet for MOR
in UAV videos. Since, this is a first attempt for MOR in UAV videos, we present
16 baseline results based on the proposed framework over the MOR-UAV dataset
through quantitative and qualitative experiments. We also analyze the
motion-salient regions in the network through multiple layer visualizations.
The MOR-UAVNet works online at inference as it requires only few past frames.
Moreover, it doesn't require predefined target initialization from user.
Experiments also demonstrate that the MOR-UAV dataset is quite challenging.
","[{'version': 'v1', 'created': 'Tue, 4 Aug 2020 17:02:29 GMT'}, {'version': 'v2', 'created': 'Sat, 8 Aug 2020 04:28:59 GMT'}]",2020-08-11,"[['Mandal', 'Murari', ''], ['Kumar', 'Lav Kush', ''], ['Vipparthi', 'Santosh Kumar', '']]","['Remote sensing', 'UAV', 'aerial vehicular vision', 'moving object recognition', 'deep learning']"
3970,1304.6379,Firas Ajil Jassim,Firas A. Jassim,"Semi-Optimal Edge Detector based on Simple Standard Deviation with
  Adjusted Thresholding","6 pages, 1 table, 6 figures","International Journal of Computer Applications,Volume 68, No.2,
  April 2013",10.5120/11555-6834,,cs.CV,http://creativecommons.org/licenses/by/3.0/,"  This paper proposes a novel method which combines both median filter and
simple standard deviation to accomplish an excellent edge detector for image
processing. First of all, a denoising process must be applied on the grey scale
image using median filter to identify pixels which are likely to be
contaminated by noise. The benefit of this step is to smooth the image and get
rid of the noisy pixels. After that, the simple statistical standard deviation
could be computed for each 2X2 window size. If the value of the standard
deviation inside the 2X2 window size is greater than a predefined threshold,
then the upper left pixel in the 2?2 window represents an edge. The visual
differences between the proposed edge detector and the standard known edge
detectors have been shown to support the contribution in this paper.
","[{'version': 'v1', 'created': 'Tue, 23 Apr 2013 18:53:58 GMT'}]",2013-04-24,"[['Jassim', 'Firas A.', '']]","['Computer vision', 'edge detection', 'median filter', 'standard deviation']"
3971,1610.00457,Dinesh Dash,"Dinesh Dash, Anurag Dasgupta","Energy Efficient Restoring of Barrier Coverage in Wireless Sensor
  Networks Using Limited Mobility Sensors","20 pages, 8 figures","IET Wireless Sensor System, 2017",10.1049/iet-wss.2017.0020,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Wireless Sensor Networks, sensors are used for tracking objects,
monitoring health and observing a region/territory for different environmental
parameters. Coverage problem in sensor network ensures quality of monitoring a
given region. Depending on applications different measures of coverage are
there. Barrier coverage is a type of coverage, which ensures all paths that
cross the boundary of a region intersect at least one sensor's sensing region.
The goal of the sensors is to detect intruders as they cross the boundary or as
they penetrate a protected area. The sensors are dependent on their battery
life. Restoring barrier coverage on sensor failure using mobile sensors with
minimum total displacement is the primary objective of this paper. A
centralized barrier coverage restoring scheme is proposed to increase the
robustness of the network. We formulate restoring barrier coverage as bipartite
matching problem. A distributed restoring of barrier coverage algorithm is also
proposed, which restores it by first finding existing alternate barrier. If
alternate barrier is not found, an alternate barrier is reconstructed by
shifting existing sensors in a cascaded manner. Detailed simulation results are
shown to evaluate the performance of our algorithms.
","[{'version': 'v1', 'created': 'Mon, 3 Oct 2016 09:18:16 GMT'}]",2017-11-16,"[['Dash', 'Dinesh', ''], ['Dasgupta', 'Anurag', '']]","['Restoring Coverage', 'Barrier Coverage', 'Coverage Problem', 'Wireless Sensor Network']"
3972,1108.4469,EPTCS,"Kirstin Peters, Jens-Wolfhard Schicke, Uwe Nestmann",Synchrony vs Causality in the Asynchronous Pi-Calculus,"In Proceedings EXPRESS 2011, arXiv:1108.4077","EPTCS 64, 2011, pp. 89-103",10.4204/EPTCS.64.7,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the relation between process calculi that differ in their either
synchronous or asynchronous interaction mechanism. Concretely, we are
interested in the conditions under which synchronous interaction can be
implemented using just asynchronous interactions in the pi-calculus. We assume
a number of minimal conditions referring to the work of Gorla: a ""good""
encoding must be compositional and preserve and reflect computations,
deadlocks, divergence, and success. Under these conditions, we show that it is
not possible to encode synchronous interactions without introducing additional
causal dependencies in the translation.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2011 01:23:43 GMT'}]",2011-08-24,"[['Peters', 'Kirstin', ''], ['Schicke', 'Jens-Wolfhard', ''], ['Nestmann', 'Uwe', '']]","['asynchrony', 'distributed systems', 'causality', 'pi-calculus']"
3973,2105.11220,Kissami Imad,"Imad Kissami, Christophe Cerin, Fayssal Benkhaldoun, Gilles Scarella",Towards Parallel CFD computation for the ADAPT framework,,"In: Carretero J., Garcia-Blas J., Ko R., Mueller P., Nakano K.
  (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2016.
  Lecture Notes in Computer Science, vol 10048. Springer, Cham",10.1007/978-3-319-49583-5_28,,cs.DC,http://creativecommons.org/publicdomain/zero/1.0/,"  In order to run Computational Fluid Dynamics (CFD) codes on large scale
infrastructures, parallel computing has to be used because of the computational
intensive nature of the problems. In this paper we investigate the ADAPT
platform where we couple flow Partial Differential Equations and a Poisson
equation. This leads to a linear system which we solve using direct methods.
The implementation deals with the MUMPS parallel multi-frontal direct solver
and mesh partitioning methods using METIS to improve the performance of the
framework. We also investigate, in this paper, how the mesh partitioning
methods are able to optimize the mesh cell distribution for the ADAPT solver.
The experience gained in this paper facilitates the move to the 3D version of
ADAPT and the move to a Service Oriented view of ADAPT as future work.
","[{'version': 'v1', 'created': 'Mon, 24 May 2021 11:57:58 GMT'}]",2021-05-25,"[['Kissami', 'Imad', ''], ['Cerin', 'Christophe', ''], ['Benkhaldoun', 'Fayssal', ''], ['Scarella', 'Gilles', '']]","['Unstructured mesh', 'Mesh partitioning', 'Parallel direct solver', 'Multi-frontal method', 'MUMPS', 'METIS', 'Multi-physics', 'Multi-scale andMultilevel Algorithms']"
3974,1803.03963,Song Guo,"Song Guo, Kai Wang, Hong Kang, Yujun Zhang, Yingqi Gao, Tao Li","BTS-DSN: Deeply Supervised Neural Network with Short Connections for
  Retinal Vessel Segmentation",,"International Journal of Medical Informatics 126, 105-113 (Jun,
  2019)",10.1016/j.ijmedinf.2019.03.015,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background and Objective: The condition of vessel of the human eye is an
important factor for the diagnosis of ophthalmological diseases. Vessel
segmentation in fundus images is a challenging task due to complex vessel
structure, the presence of similar structures such as microaneurysms and
hemorrhages, micro-vessel with only one to several pixels wide, and
requirements for finer results. Methods:In this paper, we present a multi-scale
deeply supervised network with short connections (BTS-DSN) for vessel
segmentation. We used short connections to transfer semantic information
between side-output layers. Bottom-top short connections pass low level
semantic information to high level for refining results in high-level
side-outputs, and top-bottom short connection passes much structural
information to low level for reducing noises in low-level side-outputs. In
addition, we employ cross-training to show that our model is suitable for real
world fundus images. Results: The proposed BTS-DSN has been verified on DRIVE,
STARE and CHASE_DB1 datasets, and showed competitive performance over other
state-of-the-art methods. Specially, with patch level input, the network
achieved 0.7891/0.8212 sensitivity, 0.9804/0.9843 specificity, 0.9806/0.9859
AUC, and 0.8249/0.8421 F1-score on DRIVE and STARE, respectively. Moreover, our
model behaves better than other methods in cross-training experiments.
Conclusions: BTS-DSN achieves competitive performance in vessel segmentation
task on three public datasets. It is suitable for vessel segmentation. The
source code of our method is available at https://github.com/guomugong/BTS-DSN.
","[{'version': 'v1', 'created': 'Sun, 11 Mar 2018 14:10:28 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Sep 2019 02:06:55 GMT'}]",2019-09-24,"[['Guo', 'Song', ''], ['Wang', 'Kai', ''], ['Kang', 'Hong', ''], ['Zhang', 'Yujun', ''], ['Gao', 'Yingqi', ''], ['Li', 'Tao', '']]","['vessel segmentation', 'fundus image', 'deep supervision', 'short connection']"
3975,1207.3315,Jonathan Heras,"J\'onathan Heras, Mar\'ia Poza, and Julio Rubio","Verifying an algorithm computing Discrete Vector Fields for digital
  imaging",Published in the Calculemus track of the CICM 2012 congress,"Calculemus 2012, Lecture Notes in Computer Science, 7362, pages
  215--229, 2012",10.1007/978-3-642-31374-5_15,,cs.AI cs.LO cs.MS math.AT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a formalization of an algorithm to construct
admissible discrete vector fields in the Coq theorem prover taking advantage of
the SSReflect library. Discrete vector fields are a tool which has been
welcomed in the homological analysis of digital images since it provides a
procedure to reduce the amount of information but preserving the homological
properties. In particular, thanks to discrete vector fields, we are able to
compute, inside Coq, homological properties of biomedical images which
otherwise are out of the reach of this system.
","[{'version': 'v1', 'created': 'Fri, 13 Jul 2012 17:42:52 GMT'}]",2012-07-16,"[['Heras', 'Jónathan', ''], ['Poza', 'María', ''], ['Rubio', 'Julio', '']]","['Discrete Vector Fields', 'Haskell', 'Coq', 'SSReflect', 'Integration']"
3976,1703.08434,Kojo Sarfo Gyamfi,"Kojo Sarfo Gyamfi, James Brusey, Andrew Hunt and Elena Gaura","Linear classifier design under heteroscedasticity in Linear Discriminant
  Analysis",,,10.1016/j.eswa.2017.02.039,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Under normality and homoscedasticity assumptions, Linear Discriminant
Analysis (LDA) is known to be optimal in terms of minimising the Bayes error
for binary classification. In the heteroscedastic case, LDA is not guaranteed
to minimise this error. Assuming heteroscedasticity, we derive a linear
classifier, the Gaussian Linear Discriminant (GLD), that directly minimises the
Bayes error for binary classification. In addition, we also propose a local
neighbourhood search (LNS) algorithm to obtain a more robust classifier if the
data is known to have a non-normal distribution. We evaluate the proposed
classifiers on two artificial and ten real-world datasets that cut across a
wide range of application areas including handwriting recognition, medical
diagnosis and remote sensing, and then compare our algorithm against existing
LDA approaches and other linear classifiers. The GLD is shown to outperform the
original LDA procedure in terms of the classification accuracy under
heteroscedasticity. While it compares favourably with other existing
heteroscedastic LDA approaches, the GLD requires as much as 60 times lower
training time on some datasets. Our comparison with the support vector machine
(SVM) also shows that, the GLD, together with the LNS, requires as much as 150
times lower training time to achieve an equivalent classification accuracy on
some of the datasets. Thus, our algorithms can provide a cheap and reliable
option for classification in a lot of expert systems.
","[{'version': 'v1', 'created': 'Fri, 24 Mar 2017 14:45:12 GMT'}]",2017-03-27,"[['Gyamfi', 'Kojo Sarfo', ''], ['Brusey', 'James', ''], ['Hunt', 'Andrew', ''], ['Gaura', 'Elena', '']]","['LDA', 'Heteroscedasticity', 'Bayes Error', 'Linear Classifier']"
3977,1808.03233,Chengrun Yang,"Chengrun Yang, Yuji Akimoto, Dae Won Kim, Madeleine Udell",OBOE: Collaborative Filtering for AutoML Model Selection,,,10.1145/3292500.3330909,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Algorithm selection and hyperparameter tuning remain two of the most
challenging tasks in machine learning. Automated machine learning (AutoML)
seeks to automate these tasks to enable widespread use of machine learning by
non-experts. This paper introduces OBOE, a collaborative filtering method for
time-constrained model selection and hyperparameter tuning. OBOE forms a matrix
of the cross-validated errors of a large number of supervised learning models
(algorithms together with hyperparameters) on a large number of datasets, and
fits a low rank model to learn the low-dimensional feature vectors for the
models and datasets that best predict the cross-validated errors. To find
promising models for a new dataset, OBOE runs a set of fast but informative
algorithms on the new dataset and uses their cross-validated errors to infer
the feature vector for the new dataset. OBOE can find good models under
constraints on the number of models fit or the total time budget. To this end,
this paper develops a new heuristic for active learning in time-constrained
matrix completion based on optimal experiment design. Our experiments
demonstrate that OBOE delivers state-of-the-art performance faster than
competing approaches on a test bed of supervised learning problems. Moreover,
the success of the bilinear model used by OBOE suggests that AutoML may be
simpler than was previously understood.
","[{'version': 'v1', 'created': 'Thu, 9 Aug 2018 16:56:04 GMT'}, {'version': 'v2', 'created': 'Mon, 20 May 2019 19:55:26 GMT'}]",2019-05-22,"[['Yang', 'Chengrun', ''], ['Akimoto', 'Yuji', ''], ['Kim', 'Dae Won', ''], ['Udell', 'Madeleine', '']]","['AutoML', 'meta-learning', 'time-constrained', 'model selection', 'collaborative filtering']"
3978,1607.01485,Normunds Gruzitis,"John J. Camilleri, Normunds Gruzitis, Gerardo Schneider",Extracting Formal Models from Normative Texts,,"Natural Language Processing and Information Systems, Lecture Notes
  in Computer Science, Vol. 9612, Springer, 2016, pp. 403-408",10.1007/978-3-319-41754-7_40,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Normative texts are documents based on the deontic notions of obligation,
permission, and prohibition. Our goal is to model such texts using the C-O
Diagram formalism, making them amenable to formal analysis, in particular
verifying that a text satisfies properties concerning causality of actions and
timing constraints. We present an experimental, semi-automatic aid to bridge
the gap between a normative text and its formal representation. Our approach
uses dependency trees combined with our own rules and heuristics for extracting
the relevant components. The resulting tabular data can then be converted into
a C-O Diagram.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2016 06:25:07 GMT'}]",2016-07-07,"[['Camilleri', 'John J.', ''], ['Gruzitis', 'Normunds', ''], ['Schneider', 'Gerardo', '']]","['information extraction', 'normative texts', 'C-O diagrams']"
3979,2004.01023,Alexander Schindler,"Alexander Schindler, Andrew Lindley, Anahid Jalali, Martin Boyer,
  Sergiu Gordea, Ross King","Multi-Modal Video Forensic Platform for Investigating Post-Terrorist
  Attack Scenarios",,"In Proceedings of the 11th ACM Multimedia Systems Conference
  (MMSys2020), June 06-11, 2020, Istanbul, Turkey",,,cs.MM cs.CV cs.CY cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The forensic investigation of a terrorist attack poses a significant
challenge to the investigative authorities, as often several thousand hours of
video footage must be viewed. Large scale Video Analytic Platforms (VAP) assist
law enforcement agencies (LEA) in identifying suspects and securing evidence.
Current platforms focus primarily on the integration of different computer
vision methods and thus are restricted to a single modality. We present a video
analytic platform that integrates visual and audio analytic modules and fuses
information from surveillance cameras and video uploads from eyewitnesses.
Videos are analyzed according their acoustic and visual content. Specifically,
Audio Event Detection is applied to index the content according to
attack-specific acoustic concepts. Audio similarity search is utilized to
identify similar video sequences recorded from different perspectives. Visual
object detection and tracking are used to index the content according to
relevant concepts. Innovative user-interface concepts are introduced to harness
the full potential of the heterogeneous results of the analytical modules,
allowing investigators to more quickly follow-up on leads and eyewitness
reports.
","[{'version': 'v1', 'created': 'Thu, 2 Apr 2020 14:29:27 GMT'}]",2020-04-03,"[['Schindler', 'Alexander', ''], ['Lindley', 'Andrew', ''], ['Jalali', 'Anahid', ''], ['Boyer', 'Martin', ''], ['Gordea', 'Sergiu', ''], ['King', 'Ross', '']]","['Audio Event Detection', 'Audio Similarity', 'Visual Object Detection', 'Large Scale Computing', 'Multi-Modal Systems']"
3980,1403.1314,Roshan Ragel,"R. G. Ragel, P. Herath and U. Senanayake",Authorship detection of SMS messages using unigrams,,"Industrial and Information Systems (ICIIS), 2013 8th IEEE
  International Conference on, pp. 387-392 , 17-20 Dec. 2013",10.1109/ICIInfS.2013.6732015,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  SMS messaging is a popular media of communication. Because of its popularity
and privacy, it could be used for many illegal purposes. Additionally, since
they are part of the day to day life, SMSes can be used as evidence for many
legal disputes. Since a cellular phone might be accessible to people close to
the owner, it is important to establish the fact that the sender of the message
is indeed the owner of the phone. For this purpose, the straight forward
solutions seem to be the use of popular stylometric methods. However, in
comparison with the data used for stylometry in the literature, SMSes have
unusual characteristics making it hard or impossible to apply these methods in
a conventional way. Our target is to come up with a method of authorship
detection of SMS messages that could still give a usable accuracy. We argue
that, considering the methods of author attribution, the best method that could
be applied to SMS messages is an n-gram method. To prove our point, we checked
two different methods of distribution comparison with varying number of
training and testing data. We specifically try to compare how well our
algorithms work under less amount of testing data and large number of candidate
authors (which we believe to be the real world scenario) against controlled
tests with less number of authors and selected SMSes with large number of
words. To counter the lack of information in an SMS message, we propose the
method of stacking together few SMSes.
","[{'version': 'v1', 'created': 'Thu, 6 Mar 2014 01:33:55 GMT'}]",2014-03-07,"[['Ragel', 'R. G.', ''], ['Herath', 'P.', ''], ['Senanayake', 'U.', '']]","['author attributing', 'SMS messaging', 'stylometry unigrams']"
3981,1502.01865,Stasys Jukna,Stasys Jukna,Lower Bounds for Monotone Counting Circuits,20 pages,Discrete Applied Mathematics 213 (2016) 139-152,10.1016/j.dam.2016.04.024,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A {+,x}-circuit counts a given multivariate polynomial f, if its values on
0-1 inputs are the same as those of f; on other inputs the circuit may output
arbitrary values. Such a circuit counts the number of monomials of f evaluated
to 1 by a given 0-1 input vector (with multiplicities given by their
coefficients). A circuit decides $f$ if it has the same 0-1 roots as f. We
first show that some multilinear polynomials can be exponentially easier to
count than to compute them, and can be exponentially easier to decide than to
count them. Then we give general lower bounds on the size of counting circuits.
","[{'version': 'v1', 'created': 'Fri, 6 Feb 2015 11:55:33 GMT'}]",2018-05-30,"[['Jukna', 'Stasys', '']]","['arithmetic circuits', 'boolean circuits', 'counting complexity', 'lower bounds']"
3982,1612.01395,Siegfried Cools,Siegfried Cools and Wim Vanroose,"The communication-hiding pipelined BiCGStab method for the parallel
  solution of large unsymmetric linear systems","24 pages, 5 figures, 4 tables, 45 references","Parallel Computing 65, pp. 1-20, July 2017",10.1016/j.parco.2017.04.005,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A High Performance Computing alternative to traditional Krylov subspace
methods, pipelined Krylov subspace solvers offer better scalability in the
strong scaling limit compared to standard Krylov subspace methods for large and
sparse linear systems. The typical synchronization bottleneck is mitigated by
overlapping time-consuming global communication phases with local computations
in the algorithm. This paper describes a general framework for deriving the
pipelined variant of any Krylov subspace algorithm. The proposed framework was
implicitly used to derive the pipelined Conjugate Gradient (p-CG) method in
""Hiding global synchronization latency in the preconditioned Conjugate Gradient
algorithm"" by P. Ghysels and W. Vanroose, Parallel Computing, 40(7):224--238,
2014. The pipelining framework is subsequently illustrated by formulating a
pipelined version of the BiCGStab method for the solution of large unsymmetric
linear systems on parallel hardware. A residual replacement strategy is
proposed to account for the possible loss of attainable accuracy and robustness
by the pipelined BiCGStab method. It is shown that the pipelined algorithm
improves scalability on distributed memory machines, leading to significant
speedups compared to standard preconditioned BiCGStab.
","[{'version': 'v1', 'created': 'Mon, 5 Dec 2016 15:30:52 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Jan 2017 16:19:36 GMT'}, {'version': 'v3', 'created': 'Mon, 24 Apr 2017 11:54:34 GMT'}]",2017-04-25,"[['Cools', 'Siegfried', ''], ['Vanroose', 'Wim', '']]","['Parallellization', 'Global communication', 'Latency hiding', 'Krylov subspace methods', 'Bi-Conjugate Gradient Stabilized', 'Residual replacement']"
3983,1312.3389,Yun Fan,"Yun Fan, San Ling, Hongwei Liu",Matrix Product Codes over Finite Commutative Frobenius Rings,Des. Codes Cryptogr. published online: 19 Jul 2012,,10.1007/s10623-012-9726-y,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Properties of matrix product codes over finite commutative Frobenius rings
are investigated. The minimum distance of matrix product codes constructed with
several types of matrices is bounded in different ways. The duals of matrix
product codes are also explicitly described in terms of matrix product codes.
","[{'version': 'v1', 'created': 'Thu, 12 Dec 2013 02:53:47 GMT'}]",2013-12-13,"[['Fan', 'Yun', ''], ['Ling', 'San', ''], ['Liu', 'Hongwei', '']]","['matrix product code', 'Frobenius ring', 'minimum distance', 'dual code', 'quasi-cycliccode']"
3984,1311.0801,Tad Hogg,Tad Hogg,"Using Surface-Motions for Locomotion of Microscopic Robots in Viscous
  Fluids","14 figures and two Quicktime animations of the locomotion methods
  described in the paper, each showing one period of the motion over a time of
  0.5 milliseconds; version 2 has minor clarifications and corrected typos",J. of Micro-Bio Robotics 9(3) 61-77 (2014),10.1007/s12213-014-0074-z,,cs.RO physics.bio-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Microscopic robots could perform tasks with high spatial precision, such as
acting in biological tissues on the scale of individual cells, provided they
can reach precise locations. This paper evaluates the feasibility of in vivo
locomotion for micron-size robots. Two appealing methods rely only on surface
motions: steady tangential motion and small amplitude oscillations. These
methods contrast with common microorganism propulsion based on flagella or
cilia, which are more likely to damage nearby cells if used by robots made of
stiff materials. The power potentially available to robots in tissue supports
speeds ranging from one to hundreds of microns per second, over the range of
viscosities found in biological tissue. We discuss design trade-offs among
propulsion method, speed, power, shear forces and robot shape, and relate those
choices to robot task requirements. This study shows that realizing such
locomotion requires substantial improvements in fabrication capabilities and
material properties over current technology.
","[{'version': 'v1', 'created': 'Mon, 4 Nov 2013 18:21:47 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Jul 2014 15:49:23 GMT'}]",2014-07-23,"[['Hogg', 'Tad', '']]","['nanomedicine', 'nanorobot', 'locomotion', 'viscous fluid']"
3985,2209.11453,Luigi Quaranta,"Fabio Calefato, Filippo Lanubile, Luigi Quaranta",A Preliminary Investigation of MLOps Practices in GitHub,"Presented at ESEM '22, the 16th ACM / IEEE International Symposium on
  Empirical Software Engineering and Measurement","Proceedings of the 16th ACM / IEEE International Symposium on
  Empirical Software Engineering and Measurement (ESEM 2022), September 2022,
  Pages 283-288",10.1145/3544902.3546636,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background. The rapid and growing popularity of machine learning (ML)
applications has led to an increasing interest in MLOps, that is, the practice
of continuous integration and deployment (CI/CD) of ML-enabled systems. Aims.
Since changes may affect not only the code but also the ML model parameters and
the data themselves, the automation of traditional CI/CD needs to be extended
to manage model retraining in production. Method. In this paper, we present an
initial investigation of the MLOps practices implemented in a set of ML-enabled
systems retrieved from GitHub, focusing on GitHub Actions and CML, two
solutions to automate the development workflow. Results. Our preliminary
results suggest that the adoption of MLOps workflows in open-source GitHub
projects is currently rather limited. Conclusions. Issues are also identified,
which can guide future research work.
","[{'version': 'v1', 'created': 'Fri, 23 Sep 2022 07:29:56 GMT'}]",2022-09-26,"[['Calefato', 'Fabio', ''], ['Lanubile', 'Filippo', ''], ['Quaranta', 'Luigi', '']]","['CI/CD', 'automated workflows', 'ML-enabled systems', 'GitHub Actions', 'CML']"
3986,1911.12466,Ali Javed,"Ali Javed, Scott D. Hamshaw, Donna M. Rizzo, and Byung Suk Lee","Analysis of Hydrological and Suspended Sediment Events from Mad River
  Watershed using Multivariate Time Series Clustering",Corrected typo in title,"Journal of Hydrology, 593:125802, 2021",10.1016/j.jhydrol.2020.125802,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hydrological storm events are a primary driver for transporting water quality
constituents such as turbidity, suspended sediments and nutrients. Analyzing
the concentration (C) of these water quality constituents in response to
increased streamflow discharge (Q), particularly when monitored at high
temporal resolution during a hydrological event, helps to characterize the
dynamics and flux of such constituents. A conventional approach to storm event
analysis is to reduce the C-Q time series to two-dimensional (2-D) hysteresis
loops and analyze these 2-D patterns. While effective and informative to some
extent, this hysteresis loop approach has limitations because projecting the
C-Q time series onto a 2-D plane obscures detail (e.g., temporal variation)
associated with the C-Q relationships. In this paper, we address this issue
using a multivariate time series clustering approach. Clustering is applied to
sequences of river discharge and suspended sediment data (acquired through
turbidity-based monitoring) from six watersheds located in the Lake Champlain
Basin in the northeastern United States. While clusters of the hydrological
storm events using the multivariate time series approach were found to be
correlated to 2-D hysteresis loop classifications and watershed locations, the
clusters differed from the 2-D hysteresis classifications. Additionally, using
available meteorological data associated with storm events, we examine the
characteristics of computational clusters of storm events in the study
watersheds and identify the features driving the clustering approach.
","[{'version': 'v1', 'created': 'Thu, 28 Nov 2019 00:04:21 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Mar 2020 19:15:35 GMT'}]",2022-02-04,"[['Javed', 'Ali', ''], ['Hamshaw', 'Scott D.', ''], ['Rizzo', 'Donna M.', ''], ['Lee', 'Byung Suk', '']]","['Hydrological storm event analysis', 'streamflow', 'suspended sediment', 'clustering', 'multivariatetime series']"
3987,1312.2867,Chanabasayya Vastrad M,Doreswamy and Chanabasayya M. Vastrad,"Study Of E-Smooth Support Vector Regression And Comparison With E-
  Support Vector Regression And Potential Support Vector Machines For
  Prediction For The Antitubercular Activity Of Oxazolines And Oxazoles
  Derivatives",,"Published International Journal on Soft Computing, Artificial
  Intelligence and Applications (IJSCAI), Vol.2, No.2, April 2013",10.5121/ijscai.2013.2204,,cs.CE cs.LO,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  A new smoothing method for solving ? -support vector regression (?-SVR),
tolerating a small error in fitting a given data sets nonlinearly is proposed
in this study. Which is a smooth unconstrained optimization reformulation of
the traditional linear programming associated with a ?-insensitive support
vector regression. We term this redeveloped problem as ?-smooth support vector
regression (?-SSVR). The performance and predictive ability of ?-SSVR are
investigated and compared with other methods such as LIBSVM (?-SVR) and P-SVM
methods. In the present study, two Oxazolines and Oxazoles molecular descriptor
data sets were evaluated. We demonstrate the merits of our algorithm in a
series of experiments. Primary experimental results illustrate that our
proposed approach improves the regression performance and the learning
efficiency. In both studied cases, the predictive ability of the ?- SSVR model
is comparable or superior to those obtained by LIBSVM and P-SVM. The results
indicate that ?-SSVR can be used as an alternative powerful modeling method for
regression studies. The experimental results show that the presented algorithm
?-SSVR, plays better precisely and effectively than LIBSVMand P-SVM in
predicting antitubercular activity.
","[{'version': 'v1', 'created': 'Tue, 10 Dec 2013 16:44:56 GMT'}]",2013-12-13,"[['Doreswamy', '', ''], ['Vastrad', 'Chanabasayya M.', '']]","['ε-SSVR', 'Newton-Armijo', 'LIBSVM', 'P-SVM']"
3988,1804.05349,Jerzy Proficz,Jerzy Proficz,"Improving all-reduce collective operations for imbalanced process
  arrival patterns","Published in Journal of Supercomputing, 22 pages, 12 figures and 5
  tables",,10.1007/s11227-018-2356-z,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Two new algorithms for the all-reduce operation, optimized for imbalanced
process arrival patterns (PAPs) are presented: (i) sorted linear tree (SLT),
(ii) pre-reduced ring (PRR) as well as a new way of on-line PAP detection,
including process arrival time (PAT) estimations and their distribution between
cooperating processes was introduced. The idea, pseudo-code, implementation
details, benchmark for performance evaluation and a real case example for
machine learning are provided. The results of the experiments were described
and analyzed, showing that the proposed solution has high scalability and
improved performance in comparison with the usually used ring and Rabenseifner
algorithms.
","[{'version': 'v1', 'created': 'Sun, 15 Apr 2018 12:34:35 GMT'}]",2018-04-17,"[['Proficz', 'Jerzy', '']]","['All-reduce', 'Pre-reduced ring', 'Sorted linear tree', 'Process arrivalpattern', 'MPI']"
3989,1908.01719,Van-Dang Nguyen,"Van-Dang Nguyen, Massimiliano Leoni, Tamara Dancheva, Johan Jansson,
  Johan Hoffman, Demian Wassermann, Jing-Rebecca Li",Portable simulation framework for diffusion MRI,,,10.1016/j.jmr.2019.106611,,cs.CE physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The numerical simulation of the diffusion MRI signal arising from complex
tissue micro-structures is helpful for understanding and interpreting imaging
data as well as for designing and optimizing MRI sequences. The discretization
of the Bloch-Torrey equation by finite elements is a more recently developed
approach for this purpose, in contrast to random walk simulations, which has a
longer history. While finite elements discretization is more difficult to
implement than random walk simulations, the approach benefits from a long
history of theoretical and numerical developments by the mathematical and
engineering communities. In particular, software packages for the automated
solutions of partial differential equations using finite elements
discretization, such as FEniCS, are undergoing active support and development.
However, because diffusion MRI simulation is a relatively new application area,
there is still a gap between the simulation needs of the MRI community and the
available tools provided by finite elements software packages. In this paper,
we address two potential difficulties in using FEniCS for diffusion MRI
simulation. First, we simplified software installation by the use of FEniCS
containers that are completely portable across multiple platforms. Second, we
provide a portable simulation framework based on Python and whose code is open
source. This simulation framework can be seamlessly integrated with cloud
computing resources such as Google Colaboratory notebooks working on a web
browser or with Google Cloud Platform with MPI parallelization. We show
examples illustrating the accuracy, the computational times, and parallel
computing capabilities. The framework contributes to reproducible science and
open-source software in computational diffusion MRI with the hope that it will
help to speed up method developments and stimulate research collaborations.
","[{'version': 'v1', 'created': 'Mon, 5 Aug 2019 16:51:58 GMT'}]",2019-10-23,"[['Nguyen', 'Van-Dang', ''], ['Leoni', 'Massimiliano', ''], ['Dancheva', 'Tamara', ''], ['Jansson', 'Johan', ''], ['Hoffman', 'Johan', ''], ['Wassermann', 'Demian', ''], ['Li', 'Jing-Rebecca', '']]","['Cloud computing', 'diffusion MRI', 'Bloch-Torrey equation', 'interfaceconditions', 'pseudo-periodic conditions', 'FEniCS']"
3990,1907.08657,Dany Haddad,Dany Haddad and Joydeep Ghosh,"Learning More From Less: Towards Strengthening Weak Supervision for
  Ad-Hoc Retrieval",SIGIR 2019,,10.1145/3331184.3331272,,cs.IR cs.LG,http://creativecommons.org/publicdomain/zero/1.0/,"  The limited availability of ground truth relevance labels has been a major
impediment to the application of supervised methods to ad-hoc retrieval. As a
result, unsupervised scoring methods, such as BM25, remain strong competitors
to deep learning techniques which have brought on dramatic improvements in
other domains, such as computer vision and natural language processing. Recent
works have shown that it is possible to take advantage of the performance of
these unsupervised methods to generate training data for learning-to-rank
models. The key limitation to this line of work is the size of the training set
required to surpass the performance of the original unsupervised method, which
can be as large as $10^{13}$ training examples. Building on these insights, we
propose two methods to reduce the amount of training data required. The first
method takes inspiration from crowdsourcing, and leverages multiple
unsupervised rankers to generate soft, or noise-aware, training labels. The
second identifies harmful, or mislabeled, training examples and removes them
from the training set. We show that our methods allow us to surpass the
performance of the unsupervised baseline with far fewer training examples than
previous works.
","[{'version': 'v1', 'created': 'Fri, 19 Jul 2019 19:27:14 GMT'}]",2019-07-23,"[['Haddad', 'Dany', ''], ['Ghosh', 'Joydeep', '']]","['Information retrieval', 'Noisy Labels', 'Weak Supervision', 'Neural Network', 'Deep Learning']"
3991,1712.09862,Hengchuan Tan,"Heng Chuan Tan, Maode Ma, Houda Labiod (INFRES), Peter Han Joo Chong
  (AUT), Jun Zhang (INFRES)",A non-biased trust model for wireless mesh networks,,"International Journal of Communication Systems, Wiley, 2016, 30
  (9)",10.1002/dac.3200,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Trust models that rely on recommendation trusts are vulnerable to badmouthing
and ballot-stuffing attacks. To cope with these attacks, existing trust models
use different trust aggregation techniques to process the recommendation trusts
and combine them with the direct trust values to form a combined trust value.
However, these trust models are biased as recommendation trusts that deviate
too much from one's own opinion are discarded. In this paper, we propose a
non-biased trust model that considers every recommendation trusts available
regardless they are good or bad. Our trust model is based on a combination of 2
techniques: the dissimilarity test and the Dempster-Shafer Theory. The
dissimilarity test determines the amount of conflict between 2 trust records,
whereas the Dempster-Shafer Theory assigns belief functions based on the
results of the dissimilarity test. Numerical results show that our trust model
is robust against reputation-based attacks when compared to trust aggregation
techniques such as the linear opinion pooling, subjective logic model,
entropy-based probability model, and regression analysis. In addition, our
model has been extensively tested using network simulator NS-3 in an
Infrastructure-based wireless mesh networks and a Hybrid-based wireless mesh
networks to demonstrate that it can mitigate blackhole and grayhole attacks.
","[{'version': 'v1', 'created': 'Thu, 28 Dec 2017 14:00:33 GMT'}]",2017-12-29,"[['Tan', 'Heng Chuan', '', 'INFRES'], ['Ma', 'Maode', '', 'INFRES'], ['Labiod', 'Houda', '', 'INFRES'], ['Chong', 'Peter Han Joo', '', 'AUT'], ['Zhang', 'Jun', '', 'INFRES']]","['Wireless Mesh Networks', 'Information Fusion', 'Recommendation based Trust Model', 'Reputation']"
3992,1612.04970,Tomas Maul,"Kien Tuong Phan, Tomas Henrique Maul, Tuong Thuy Vu, Lai Weng Kin","Improving Neural Network Generalization by Combining Parallel Circuits
  with Dropout","Pre-print. The final publication is available at Springer via
  http://dx.doi.org/10.1007/978-3-319-46675-0_63",,10.1007/978-3-319-46675-0_63,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In an attempt to solve the lengthy training times of neural networks, we
proposed Parallel Circuits (PCs), a biologically inspired architecture.
Previous work has shown that this approach fails to maintain generalization
performance in spite of achieving sharp speed gains. To address this issue, and
motivated by the way Dropout prevents node co-adaption, in this paper, we
suggest an improvement by extending Dropout to the PC architecture. The paper
provides multiple insights into this combination, including a variety of fusion
approaches. Experiments show promising results in which improved error rates
are achieved in most cases, whilst maintaining the speed advantage of the PC
approach.
","[{'version': 'v1', 'created': 'Thu, 15 Dec 2016 08:38:58 GMT'}]",2016-12-16,"[['Phan', 'Kien Tuong', ''], ['Maul', 'Tomas Henrique', ''], ['Vu', 'Tuong Thuy', ''], ['Kin', 'Lai Weng', '']]","['Deep Learning', 'Parallel Circuit', 'Dropout', 'DropCircuit']"
3993,1306.1332,Ferdous Barbhuiya Ahmed,"Ferdous A Barbhuiya, Santosh Biswas, Sukumar Nandi","An Active Host-Based Intrusion Detection System for ARP-Related Attacks
  and its Verification","International Journal of Network Security & Its Applications (IJNSA),
  Vol.3, No.3, May 2011","Journal of Information Assurance and Security. ISSN 1554-1010
  Volume 7 (2012) pp. 284-295",10.5121/ijnsa.2011.3311,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spoofing with falsified IP-MAC pair is the first step in most of the LAN
based-attacks. Address Resolution Protocol (ARP) is stateless, which is the
main cause that makes spoofing possible. Several network level and host level
mechanisms have been proposed to detect and mitigate ARP spoofing but each of
them has their own drawback. In this paper we propose a Host-based Intrusion
Detection system for LAN attacks, which works without any extra constraint like
static IP-MAC, modifying ARP etc. The proposed scheme is verified under all
possible attack scenarios. The scheme is successfully validated in a test bed
with various attack scenarios and the results show the effectiveness of the
proposed technique.
","[{'version': 'v1', 'created': 'Thu, 6 Jun 2013 08:11:25 GMT'}]",2013-07-26,"[['Barbhuiya', 'Ferdous A', ''], ['Biswas', 'Santosh', ''], ['Nandi', 'Sukumar', '']]","['Active Detection', 'ARP spoofing', 'host based ids', 'LAN attack', 'Verification']"
3994,1403.1523,Changchuan Yin Dr.,"Changchuan Yin, Xuemeng E. Yin, Jiasong Wang","A Novel Method for Comparative Analysis of DNA Sequences by
  Ramanujan-Fourier Transform",Ramanujan-Fourier transform and DNA sequences,,10.1089/cmb.2014.0120,,cs.CE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Alignment-free sequence analysis approaches provide important alternatives
over multiple sequence alignment (MSA) in biological sequence analysis because
alignment-free approaches have low computation complexity and are not dependent
on high level of sequence identity, however, most of the existing
alignment-free methods do not employ true full information content of sequences
and thus can not accurately reveal similarities and differences among DNA
sequences. We present a novel alignment-free computational method for sequence
analysis based on Ramanujan-Fourier transform (RFT), in which complete
information of DNA sequences is retained. We represent DNA sequences as four
binary indicator sequences and apply RFT on the indicator sequences to convert
them into frequency domain. The Euclidean distance of the complete RFT
coefficients of DNA sequences are used as similarity measure. To address the
different lengths in Euclidean space of RFT coefficients, we pad zeros to short
DNA binary sequences so that the binary sequences equal the longest length in
the comparison sequence data. Thus, the DNA sequences are compared in the same
dimensional frequency space without information loss. We demonstrate the
usefulness of the proposed method by presenting experimental results on
hierarchical clustering of genes and genomes. The proposed method opens a new
channel to biological sequence analysis, classification, and structural module
identification.
","[{'version': 'v1', 'created': 'Thu, 6 Mar 2014 18:29:52 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Jun 2014 18:35:05 GMT'}]",2016-08-02,"[['Yin', 'Changchuan', ''], ['Yin', 'Xuemeng E.', ''], ['Wang', 'Jiasong', '']]","['Ramanujan-Fourier transform', 'Similarity measure', 'Phylogenetic trees', 'Cluster analysis', 'DNA sequence']"
3995,1708.00675,Mohammad Hossein Ferdowsi,"Mohammad Hossein Ferdowsi, Ebrahim Sabzikar",Optical Target Tracking by Scheduled Range Measurements,,Optical Engineering 54.4 (2015): 044101-044101,10.1117/1.OE.54.4.044101,,cs.SY cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, optical target tracking, by regular target bearing
measurements and target range in a lower and scheduled measurement rate is
considered. Variance of the target range estimation error is used as scheduling
criterion. For this purpose, target dynamic state vector in modified spherical
coordinates is stated in such a way that all target states be decoupled from
range-related target state. Target state dynamic equations in modified
spherical coordinates for nearly constant velocity, nearly constant
acceleration and coordinated turn rate kinematic models, are analytically
derived. For resulted state dynamic equations, a UKF-IMM filter with range
measurement scheduling is utilized as a tracking filter. It is shown that
target states are estimated properly and applied filter has high performance in
maneuvering target tracking.
","[{'version': 'v1', 'created': 'Wed, 2 Aug 2017 09:55:11 GMT'}]",2017-08-03,"[['Ferdowsi', 'Mohammad Hossein', ''], ['Sabzikar', 'Ebrahim', '']]","['target tracking', 'modified spherical coordinates', 'measurement scheduling', 'UKF', 'IMM']"
3996,1911.08964,Louis Dublois,"Louis Dublois, Michael Lampis, and Vangelis Th. Paschos",New Algorithms for Mixed Dominating Set,This paper has been accepted to IPEC 2020,"Discrete Mathematics & Theoretical Computer Science, vol. 23 no.
  1, Discrete Algorithms (April 30, 2021) dmtcs:7407",10.46298/dmtcs.6824,,cs.DS cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A mixed dominating set is a collection of vertices and edges that dominates
all vertices and edges of a graph. We study the complexity of exact and
parameterized algorithms for \textsc{Mixed Dominating Set}, resolving some open
questions. In particular, we settle the problem's complexity parameterized by
treewidth and pathwidth by giving an algorithm running in time $O^*(5^{tw})$
(improving the current best $O^*(6^{tw})$), as well as a lower bound showing
that our algorithm cannot be improved under the Strong Exponential Time
Hypothesis (SETH), even if parameterized by pathwidth (improving a lower bound
of $O^*((2 - \varepsilon)^{pw})$). Furthermore, by using a simple but so far
overlooked observation on the structure of minimal solutions, we obtain
branching algorithms which improve both the best known FPT algorithm for this
problem, from $O^*(4.172^k)$ to $O^*(3.510^k)$, and the best known
exponential-time exact algorithm, from $O^*(2^n)$ and exponential space, to
$O^*(1.912^n)$ and polynomial space.
","[{'version': 'v1', 'created': 'Wed, 20 Nov 2019 15:24:47 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Oct 2020 13:38:43 GMT'}, {'version': 'v3', 'created': 'Tue, 12 Jan 2021 10:50:58 GMT'}, {'version': 'v4', 'created': 'Wed, 14 Apr 2021 14:18:12 GMT'}, {'version': 'v5', 'created': 'Mon, 26 Apr 2021 14:57:44 GMT'}]",2021-10-04,"[['Dublois', 'Louis', ''], ['Lampis', 'Michael', ''], ['Paschos', 'Vangelis Th.', '']]","['FPT Algorithms', 'Exact Algorithms', 'Mixed Domination']"
3997,1904.08847,Ezio Bartocci,"Ezio Bartocci, Luca Bortolussi, Michele Loreti, Laura Nenzi",Monitoring Mobile and Spatially Distributed Cyber-Physical Systems,,"MEMOCODE 2017, ACM, pp 146--155, 2017",10.1145/3127041.3127050,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cyber-Physical Systems~(CPS) consist of collaborative, networked and tightly
intertwined computational (logical) and physical components, each operating at
different spatial and temporal scales. Hence, the spatial and temporal
requirements play an essential role for their correct and safe execution.
Furthermore, the local interactions among the system components result in
global spatio-temporal emergent behaviors often impossible to predict at the
design time. In this work, we pursue a complementary approach by introducing
STREL a novel spatio-temporal logic that enables the specification of
spatio-temporal requirements and their monitoring over the execution of mobile
and spatially distributed CPS. Our logic extends the Signal Temporal Logic with
two novel spatial operators reach and escape from which is possible to derive
other spatial modalities such as everywhere, somewhere and surround. These
operators enable a monitoring procedure where the satisfaction of the property
at each location depends only on the satisfaction of its neighbours, opening
the way to future distributed online monitoring algorithms. We propose both a
qualitative and quantitative semantics based on constraint semirings, an
algebraic structure suitable for constraint satisfaction and optimisation. We
prove that, for a subclass of models, all the spatial properties expressed with
reach and escape, using euclidean distance, satisfy all the model
transformations using rotation, reflection and translation. Finally, we provide
an offline monitoring algorithm for STREL and, to demonstrate the feasibility
of our approach, we show its application using the monitoring of a simulated
mobile ad-hoc sensor network as running example.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2019 22:02:33 GMT'}]",2019-04-19,"[['Bartocci', 'Ezio', ''], ['Bortolussi', 'Luca', ''], ['Loreti', 'Michele', ''], ['Nenzi', 'Laura', '']]","['Runtime Verification', 'Monitoring', 'Cyber-Physical Systems', 'SpatioTemporal Logic']"
3998,1707.06828,Ayan Kumar Bhunia,"Partha Pratim Roy, Ayan Kumar Bhunia, Umapada Pal","HMM-based Writer Identification in Music Score Documents without
  Staff-Line Removal","Expert Systems with Applications, Elsevier(2017)",,10.1016/j.eswa.2017.07.031,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Writer identification from musical score documents is a challenging task due
to its inherent problem of overlapping of musical symbols with staff lines.
Most of the existing works in the literature of writer identification in
musical score documents were performed after a preprocessing stage of staff
lines removal. In this paper we propose a novel writer identification framework
in musical documents without removing staff lines from documents. In our
approach, Hidden Markov Model has been used to model the writing style of the
writers without removing staff lines. The sliding window features are extracted
from musical score lines and they are used to build writer specific HMM models.
Given a query musical sheet, writer specific confidence for each musical line
is returned by each writer specific model using a loglikelihood score. Next, a
loglikelihood score in page level is computed by weighted combination of these
scores from the corresponding line images of the page. A novel Factor Analysis
based feature selection technique is applied in sliding window features to
reduce the noise appearing from staff lines which proves efficiency in writer
identification performance.In our framework we have also proposed a novel score
line detection approach in musical sheet using HMM. The experiment has been
performed in CVC-MUSCIMA dataset and the results obtained that the proposed
approach is efficient for score line detection and writer identification
without removing staff lines. To get the idea of computation time of our
method, detail analysis of execution time is also provided.
","[{'version': 'v1', 'created': 'Fri, 21 Jul 2017 10:34:05 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Jul 2017 23:11:51 GMT'}]",2017-07-31,"[['Roy', 'Partha Pratim', ''], ['Bhunia', 'Ayan Kumar', ''], ['Pal', 'Umapada', '']]","['Music Score Documents', 'Writer Identification', 'Hidden Markov Model', 'Factor Analysis']"
3999,1304.2612,Yu Zhang,Leo Yu Zhang and Xiaobo Hu and Yuansheng Liu and Kwok-Wo Wong,A chaotic image encryption scheme owning temp-value feedback,"10 pages, 4 figures",,10.1016/j.cnsns.2014.03.016,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel efficient chaotic image encryption scheme, in
which the temp-value feedback mechanism is introduced to the permutation and
diffusion procedures. Firstly, a simple trick is played to map the plain-image
pixels to the initial condition of the Logistic map. Then, a pseudorandom
number sequence (PRNS) is obtained from iterating the map. The permutation
procedure is carried out by a permutation sequence which is generated by
comparing the PRNS and its sorted version. The diffusion procedure is composed
of two reversely executed rounds. During each round, the current plain-image
pixel and the last cipher-image pixel are used to produce the current
cipher-image pixel with the help of the Logistic map and a pseudorandom number
generated by the Chen system. To enhance the efficiency, only expanded XOR
operation and modulo 256 addition are employed during diffusion. Experimental
results show that the new scheme owns a large key space and can resist the
differential attack. It is also efficient.
","[{'version': 'v1', 'created': 'Tue, 9 Apr 2013 14:36:15 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Jan 2014 14:14:08 GMT'}]",2014-05-30,"[['Zhang', 'Leo Yu', ''], ['Hu', 'Xiaobo', ''], ['Liu', 'Yuansheng', ''], ['Wong', 'Kwok-Wo', '']]","['image encryption', 'Chen system', 'Logistic map', 'permutation', 'diffusion']"
4000,1806.01304,Armin Eftekhari,"Armin Eftekhari, Raphael A. Hauser, and Andreas Grammenos",MOSES: A Streaming Algorithm for Linear Dimensionality Reduction,,,10.1109/TPAMI.2019.2919597,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces Memory-limited Online Subspace Estimation Scheme
(MOSES) for both estimating the principal components of streaming data and
reducing its dimension. More specifically, in various applications such as
sensor networks, the data vectors are presented sequentially to a user who has
limited storage and processing time available. Applied to such problems, MOSES
can provide a running estimate of leading principal components of the data that
has arrived so far and also reduce its dimension.
  MOSES generalises the popular incremental Singular Vale Decomposition (iSVD)
to handle thin blocks of data, rather than just vectors. This minor
generalisation in part allows us to complement MOSES with a comprehensive
statistical analysis, thus providing the first theoretically-sound variant of
iSVD, which has been lacking despite the empirical success of this method. This
generalisation also enables us to concretely interpret MOSES as an approximate
solver for the underlying non-convex optimisation program. We find that MOSES
consistently surpasses the state of the art in our numerical experiments with
both synthetic and real-world datasets, while being computationally
inexpensive.
","[{'version': 'v1', 'created': 'Mon, 4 Jun 2018 18:10:46 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Jun 2019 08:45:19 GMT'}, {'version': 'v3', 'created': 'Sun, 23 Feb 2020 10:13:19 GMT'}]",2021-02-12,"[['Eftekhari', 'Armin', ''], ['Hauser', 'Raphael A.', ''], ['Grammenos', 'Andreas', '']]","['Principal component analysis', 'Linear dimensionality reduction', 'Subspace identification', 'Streaming algorithms', 'Non-convex optimisation']"
4001,1902.07057,Zhenyu Yan,"Zhenyu Yan, Qun Song, Rui Tan, Yang Li and Adams Wai Kin Kong","Towards Touch-to-Access Device Authentication Using Induced Body
  Electric Potentials","16 pages, accepted to the 25th Annual International Conference on
  Mobile Computing and Networking (MobiCom 2019), October 21-25, 2019, Los
  Cabos, Mexico",,10.1145/3300061.3300118,,cs.HC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents TouchAuth, a new touch-to-access device authentication
approach using induced body electric potentials (iBEPs) caused by the indoor
ambient electric field that is mainly emitted from the building's electrical
cabling. The design of TouchAuth is based on the electrostatics of iBEP
generation and a resulting property, i.e., the iBEPs at two close locations on
the same human body are similar, whereas those from different human bodies are
distinct. Extensive experiments verify the above property and show that
TouchAuth achieves high-profile receiver operating characteristics in
implementing the touch-to-access policy. Our experiments also show that a range
of possible interfering sources including appliances' electromagnetic
emanations and noise injections into the power network do not affect the
performance of TouchAuth. A key advantage of TouchAuth is that the iBEP sensing
requires a simple analog-to-digital converter only, which is widely available
on microcontrollers. Compared with existing approaches including intra-body
communication and physiological sensing, TouchAuth is a low-cost, lightweight,
and convenient approach for authorized users to access the smart objects found
in indoor environments.
","[{'version': 'v1', 'created': 'Sat, 16 Feb 2019 04:02:09 GMT'}]",2019-02-20,"[['Yan', 'Zhenyu', ''], ['Song', 'Qun', ''], ['Tan', 'Rui', ''], ['Li', 'Yang', ''], ['Kong', 'Adams Wai Kin', '']]","['Device authentication', 'wearables', 'induced body electric potential']"
4002,1812.00111,Swapneel Mehta,"Swapneel Mehta, Prasanth Kothuri, Daniel Lanza Garcia",A Big Data Architecture for Log Data Storage and Analysis,,,10.1007/978-981-10-8797-4_22,,cs.DC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an architecture for analysing database connection logs across
different instances of databases within an intranet comprising over 10,000
users and associated devices. Our system uses Flume agents to send
notifications to a Hadoop Distributed File System for long-term storage and
ElasticSearch and Kibana for short-term visualisation, effectively creating a
data lake for the extraction of log data. We adopt machine learning models with
an ensemble of approaches to filter and process the indicators within the data
and aim to predict anomalies or outliers using feature vectors built from this
log data.
","[{'version': 'v1', 'created': 'Sat, 1 Dec 2018 00:50:45 GMT'}]",2018-12-04,"[['Mehta', 'Swapneel', ''], ['Kothuri', 'Prasanth', ''], ['Garcia', 'Daniel Lanza', '']]","['Very  Large  Databases', 'Big  Data  Analysis', 'Log  Data  Storage', 'Machine Learning', 'Anomaly Detection']"
4003,1405.2590,Ilias Tachmazidis,"Ilias Tachmazidis, Grigoris Antoniou and Wolfgang Faber",Efficient Computation of the Well-Founded Semantics over Big Data,"16 pages, 4 figures, ICLP 2014, 30th International Conference on
  Logic Programming July 19-22, Vienna, Austria",Theory and Practice of Logic Programming 14 (2014) 445-459,10.1017/S1471068414000131,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data originating from the Web, sensor readings and social media result in
increasingly huge datasets. The so called Big Data comes with new scientific
and technological challenges while creating new opportunities, hence the
increasing interest in academia and industry. Traditionally, logic programming
has focused on complex knowledge structures/programs, so the question arises
whether and how it can work in the face of Big Data. In this paper, we examine
how the well-founded semantics can process huge amounts of data through mass
parallelization. More specifically, we propose and evaluate a parallel approach
using the MapReduce framework. Our experimental results indicate that our
approach is scalable and that well-founded semantics can be applied to billions
of facts. To the best of our knowledge, this is the first work that addresses
large scale nonmonotonic reasoning without the restriction of stratification
for predicates of arbitrary arity. To appear in Theory and Practice of Logic
Programming (TPLP).
","[{'version': 'v1', 'created': 'Sun, 11 May 2014 21:57:50 GMT'}]",2020-02-19,"[['Tachmazidis', 'Ilias', ''], ['Antoniou', 'Grigoris', ''], ['Faber', 'Wolfgang', '']]","['Well-Founded Semantics', 'Big Data', 'MapReduce Framework']"
4004,1903.03929,Satyananda Kashyap,"Satyananda Kashyap, Ipek Oguz, Honghai Zhang, Milan Sonka","Automated Segmentation of Knee MRI Using Hierarchical Classifiers and
  Just Enough Interaction Based Learning: Data from Osteoarthritis Initiative","KEYWORDS: Graph based segmentation; Just enough interaction;
  LOGISMOS; Neighborhood approximation forests; Osteoarthritis; Random forest
  classifier; knee MRI PMID: 28626842 PMCID: PMC5471813","Med Image Comput Comput Assist Interv. 2016 Oct;9901:344-351. doi:
  10.1007/978-3-319-46723-8_40. Epub 2016 Oct 2",10.1007/978-3-319-46723-8_40,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a fully automated learning-based approach for segmenting knee
cartilage in the presence of osteoarthritis (OA). The algorithm employs a
hierarchical set of two random forest classifiers. The first is a neighborhood
approximation forest, the output probability map of which is utilized as a
feature set for the second random forest (RF) classifier. The output
probabilities of the hierarchical approach are used as cost functions in a
Layered Optimal Graph Segmentation of Multiple Objects and Surfaces (LOGISMOS).
In this work, we highlight a novel post-processing interaction called
just-enough interaction (JEI) which enables quick and accurate generation of a
large set of training examples. Disjoint sets of 15 and 13 subjects were used
for training and tested on another disjoint set of 53 knee datasets. All images
were acquired using a double echo steady state (DESS) MRI sequence and are from
the osteoarthritis initiative (OAI) database. Segmentation performance using
the learning-based cost function showed significant reduction in segmentation
errors ($p< 0.05$) in comparison with conventional gradient-based cost
functions.
","[{'version': 'v1', 'created': 'Sun, 10 Mar 2019 06:01:23 GMT'}]",2019-03-12,"[['Kashyap', 'Satyananda', ''], ['Oguz', 'Ipek', ''], ['Zhang', 'Honghai', ''], ['Sonka', 'Milan', '']]","['Graph based segmentation', 'knee MRI', 'Random Forest classifier', 'Neighborhood Approximation Forests', 'Osteoarthritis', 'Just EnoughInteraction', 'LOGISMOS']"
4005,1706.03335,Amber Nigam,Amber Nigam,Exploring Automated Essay Scoring for Nonnative English Speakers,Accepted for publication at EUROPHRAS 2017,,10.26615/978-2-9701095-2-5_004,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated Essay Scoring (AES) has been quite popular and is being widely
used. However, lack of appropriate methodology for rating nonnative English
speakers' essays has meant a lopsided advancement in this field. In this paper,
we report initial results of our experiments with nonnative AES that learns
from manual evaluation of nonnative essays. For this purpose, we conducted an
exercise in which essays written by nonnative English speakers in test
environment were rated both manually and by the automated system designed for
the experiment. In the process, we experimented with a few features to learn
about nuances linked to nonnative evaluation. The proposed methodology of
automated essay evaluation has yielded a correlation coefficient of 0.750 with
the manual evaluation.
","[{'version': 'v1', 'created': 'Sun, 11 Jun 2017 10:18:46 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Jun 2017 09:52:35 GMT'}, {'version': 'v3', 'created': 'Fri, 29 Sep 2017 07:08:50 GMT'}]",2018-02-02,"[['Nigam', 'Amber', '']]","['Automated Essay Scoring (AES)', 'Natural Language Processing', 'Machine Learning', 'Latent Semantic Analysis (LSA)', 'Random Forest']"
4006,1706.08777,Tjeerd Boonstra,"Tjeerd W. Boonstra, Mark E. Larsen, Samuel Townsend, and Helen
  Christensen",Validation of a smartphone app to map social networks of proximity,"20 pages, 5 figures","PLOS One, 2017",10.1371/journal.pone.0189877,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social network analysis is a prominent approach to investigate interpersonal
relationships. Most studies use self-report data to quantify the connections
between participants and construct social networks. In recent years smartphones
have been used as an alternative to map networks by assessing the proximity
between participants based on Bluetooth and GPS data. While most studies have
handed out specially programmed smartphones to study participants, we developed
an application for iOS and Android to collect Bluetooth data from participants
own smartphones. In this study, we compared the networks estimated with the
smartphone app to those obtained from sociometric badges and self-report data.
Participants (n=21) installed the app on their phone and wore a sociometric
badge during office hours. Proximity data was collected for 4 weeks. A
contingency table revealed a significant association between proximity data
(rho = 0.17, p<0.0001), but the marginal odds were higher for the app (8.6%)
than for the badges (1.3%), indicating that dyads were more often detected by
the app. We then compared the networks that were estimated using the proximity
and self-report data. All three networks were significantly correlated,
although the correlation with self-reported data was lower for the app (rho =
0.25) than for badges (rho = 0.67). The scanning rates of the app varied
considerably between devices and was lower on iOS than on Android. The
association between the app and the badges increased when the network was
estimated between participants whose app recorded more regularly. These
findings suggest that the accuracy of proximity networks can be further
improved by reducing missing data and restricting the interpersonal distance at
which interactions are detected.
","[{'version': 'v1', 'created': 'Tue, 27 Jun 2017 11:06:20 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Dec 2017 04:26:57 GMT'}]",2017-12-13,"[['Boonstra', 'Tjeerd W.', ''], ['Larsen', 'Mark E.', ''], ['Townsend', 'Samuel', ''], ['Christensen', 'Helen', '']]","['social\tnetwork\tanalysis', 'graph\ttheory', 'Bluetooth', 'pervasive\tcomputing']"
4007,1405.1523,Bart Bogaerts,"Bart Bogaerts, Joachim Jansen, Maurice Bruynooghe, Broes De Cat, Joost
  Vennekens and Marc Denecker",Simulating dynamic systems using Linear Time Calculus theories,,Theory and Practice of Logic Programming 14 (2014) 477-492,10.1017/S1471068414000155,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To appear in Theory and Practice of Logic Programming (TPLP).
  Dynamic systems play a central role in fields such as planning, verification,
and databases. Fragmented throughout these fields, we find a multitude of
languages to formally specify dynamic systems and a multitude of systems to
reason on such specifications. Often, such systems are bound to one specific
language and one specific inference task. It is troublesome that performing
several inference tasks on the same knowledge requires translations of your
specification to other languages. In this paper we study whether it is possible
to perform a broad set of well-studied inference tasks on one specification.
More concretely, we extend IDP3 with several inferences from fields concerned
with dynamic specifications.
","[{'version': 'v1', 'created': 'Wed, 7 May 2014 07:38:13 GMT'}]",2020-02-19,"[['Bogaerts', 'Bart', ''], ['Jansen', 'Joachim', ''], ['Bruynooghe', 'Maurice', ''], ['De Cat', 'Broes', ''], ['Vennekens', 'Joost', ''], ['Denecker', 'Marc', '']]","['Dynamic systems', 'progression', 'simulation', 'knowledge base system', 'inferences']"
4008,1803.05741,Marco Tulio Valente,"Jailton Coelho, Marco Tulio Valente, Luciana L. Silva, Andre Hora",Why We Engage in FLOSS: Answers from Core Developers,"Accepted at CHASE 2018: 11th International Workshop on Cooperative
  and Human Aspects of Software Engineering (8 pages)",,10.1145/3195836.3195848,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The maintenance and evolution of Free/Libre Open Source Software (FLOSS)
projects demand the constant attraction of core developers. In this paper, we
report the results of a survey with 52 developers, who recently became core
contributors of popular GitHub projects. We reveal their motivations to assume
a key role in FLOSS projects (e.g., improving the projects because they are
also using it), the project characteristics that most helped in their
engagement process (e.g., a friendly community), and the barriers faced by the
surveyed core developers (e.g., lack of time of the project leaders). We also
compare our results with related studies about others kinds of open source
contributors (casual, one-time, and newcomers).
","[{'version': 'v1', 'created': 'Thu, 15 Mar 2018 13:34:13 GMT'}]",2018-08-09,"[['Coelho', 'Jailton', ''], ['Valente', 'Marco Tulio', ''], ['Silva', 'Luciana L.', ''], ['Hora', 'Andre', '']]","['Core Developers', 'GitHub', 'Open Source Software']"
4009,1705.08061,Changtong Luo,"Changtong Luo, Chen Chen, Zonglin Jiang",A divide and conquer method for symbolic regression,"International Journal of Computational Methods, Published: 22 October
  2021",,10.1142/S0219876221420020,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Symbolic regression aims to find a function that best explains the
relationship between independent variables and the objective value based on a
given set of sample data. Genetic programming (GP) is usually considered as an
appropriate method for the problem since it can optimize functional structure
and coefficients simultaneously. However, the convergence speed of GP might be
too slow for large scale problems that involve a large number of variables.
Fortunately, in many applications, the target function is separable or
partially separable. This feature motivated us to develop a new method, divide
and conquer (D&C), for symbolic regression, in which the target function is
divided into a number of sub-functions and the sub-functions are then
determined by any of a GP algorithm. The separability is probed by a new
proposed technique, Bi-Correlation test (BiCT). D&C powered GP has been tested
on some real-world applications, and the study shows that D&C can help GP to
get the target function much more rapidly.
","[{'version': 'v1', 'created': 'Tue, 23 May 2017 02:53:28 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Jun 2017 04:08:56 GMT'}]",2022-09-26,"[['Luo', 'Changtong', ''], ['Chen', 'Chen', ''], ['Jiang', 'Zonglin', '']]","['Mathematical modeling', 'Genetic programming', 'Symbolicregression', 'Artificial intelligence', 'Divide and conquer']"
4010,1805.10042,Gabriele Fici,"Golnaz Badkobeh, Gabriele Fici, Simon J. Puglisi",Algorithms for Anti-Powers in Strings,,"Published in Informnation Processing Letters Volume 137, September
  2018, Pages 57-60",10.1016/j.ipl.2018.05.003,,cs.DS cs.DM cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A string $S[1,n]$ is a power (or tandem repeat) of order $k$ and period $n/k$
if it can decomposed into $k$ consecutive equal-length blocks of letters.
Powers and periods are fundamental to string processing, and algorithms for
their efficient computation have wide application and are heavily studied.
Recently, Fici et al. (Proc. ICALP 2016) defined an {\em anti-power} of order
$k$ to be a string composed of $k$ pairwise-distinct blocks of the same length
($n/k$, called {\em anti-period}). Anti-powers are a natural converse to
powers, and are objects of combinatorial interest in their own right. In this
paper we initiate the algorithmic study of anti-powers. Given a string $S$, we
describe an optimal algorithm for locating all substrings of $S$ that are
anti-powers of a specified order. The optimality of the algorithm follows form
a combinatorial lemma that provides a lower bound on the number of distinct
anti-powers of a given order: we prove that a string of length $n$ can contain
$\Theta(n^2/k)$ distinct anti-powers of order $k$.
","[{'version': 'v1', 'created': 'Fri, 25 May 2018 08:54:26 GMT'}]",2018-05-28,"[['Badkobeh', 'Golnaz', ''], ['Fici', 'Gabriele', ''], ['Puglisi', 'Simon J.', '']]","['Anti-powers', 'Combinatorial algorithms', 'Combinatorics on Words']"
4011,1703.01054,Aneesh Sharma Aneesh Sharma,Aneesh Sharma and C. Seshadhri and Ashish Goel,"When Hashes Met Wedges: A Distributed Algorithm for Finding High
  Similarity Vectors",,,10.1145/3038912.3052633,,cs.SI cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finding similar user pairs is a fundamental task in social networks, with
numerous applications in ranking and personalization tasks such as link
prediction and tie strength detection. A common manifestation of user
similarity is based upon network structure: each user is represented by a
vector that represents the user's network connections, where pairwise cosine
similarity among these vectors defines user similarity. The predominant task
for user similarity applications is to discover all similar pairs that have a
pairwise cosine similarity value larger than a given threshold $\tau$. In
contrast to previous work where $\tau$ is assumed to be quite close to 1, we
focus on recommendation applications where $\tau$ is small, but still
meaningful. The all pairs cosine similarity problem is computationally
challenging on networks with billions of edges, and especially so for settings
with small $\tau$. To the best of our knowledge, there is no practical solution
for computing all user pairs with, say $\tau = 0.2$ on large social networks,
even using the power of distributed algorithms.
  Our work directly addresses this challenge by introducing a new algorithm ---
WHIMP --- that solves this problem efficiently in the MapReduce model. The key
insight in WHIMP is to combine the ""wedge-sampling"" approach of Cohen-Lewis for
approximate matrix multiplication with the SimHash random projection techniques
of Charikar. We provide a theoretical analysis of WHIMP, proving that it has
near optimal communication costs while maintaining computation cost comparable
with the state of the art. We also empirically demonstrate WHIMP's scalability
by computing all highly similar pairs on four massive data sets, and show that
it accurately finds high similarity pairs. In particular, we note that WHIMP
successfully processes the entire Twitter network, which has tens of billions
of edges.
","[{'version': 'v1', 'created': 'Fri, 3 Mar 2017 06:41:02 GMT'}]",2017-03-06,"[['Sharma', 'Aneesh', ''], ['Seshadhri', 'C.', ''], ['Goel', 'Ashish', '']]","['Similarity search', 'nearest neighbor search', 'matrix multiplication', 'wedge sampling']"
4012,1902.01506,Jackson Killian,"Jackson A. Killian, Bryan Wilder, Amit Sharma, Daksha Shah, Vinod
  Choudhary, Bistra Dilkina, Milind Tambe","Learning to Prescribe Interventions for Tuberculosis Patients Using
  Digital Adherence Data","10 pages, 6 figures","KDD 2019: The 25th ACM SIGKDD Conference on Knowledge Discovery
  and Data Mining",10.1145/3292500.3330777,,cs.LG cs.CY stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Digital Adherence Technologies (DATs) are an increasingly popular method for
verifying patient adherence to many medications. We analyze data from one city
served by 99DOTS, a phone-call-based DAT deployed for Tuberculosis (TB)
treatment in India where nearly 3 million people are afflicted with the disease
each year. The data contains nearly 17,000 patients and 2.1M dose records. We
lay the groundwork for learning from this real-world data, including a method
for avoiding the effects of unobserved interventions in training data used for
machine learning. We then construct a deep learning model, demonstrate its
interpretability, and show how it can be adapted and trained in different
clinical scenarios to better target and improve patient care. In the real-time
risk prediction setting our model could be used to proactively intervene with
21% more patients and before 76% more missed doses than current heuristic
baselines. For outcome prediction, our model performs 40% better than baseline
methods, allowing cities to target more resources to clinics with a heavier
burden of patients at risk of failure. Finally, we present a case study
demonstrating how our model can be trained in an end-to-end decision focused
learning setting to achieve 15% better solution quality in an example decision
problem faced by health workers.
","[{'version': 'v1', 'created': 'Tue, 5 Feb 2019 00:59:44 GMT'}, {'version': 'v2', 'created': 'Fri, 24 May 2019 01:05:38 GMT'}, {'version': 'v3', 'created': 'Mon, 24 Jun 2019 07:19:55 GMT'}]",2020-01-03,"[['Killian', 'Jackson A.', ''], ['Wilder', 'Bryan', ''], ['Sharma', 'Amit', ''], ['Shah', 'Daksha', ''], ['Choudhary', 'Vinod', ''], ['Dilkina', 'Bistra', ''], ['Tambe', 'Milind', '']]","['tuberculosis', 'treatment adherence', 'predictive modeling', 'interpretability', 'digital adherence technology', 'machine learning']"
4013,1606.05787,Xiufeng Liu,"Xiufeng Liu, Per Sieverts Nielsen",A Hybrid ICT-Solution for Smart Meter Data Analytics,"Energy, 2016",,10.1016/j.energy.2016.05.068,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smart meters are increasingly used worldwide. Smart meters are the advanced
meters capable of measuring energy consumption at a fine-grained time interval,
e.g., every 15 minutes. Smart meter data are typically bundled with social
economic data in analytics, such as meter geographic locations, weather
conditions and user information, which makes the data sets very sizable and the
analytics complex. Data mining and emerging cloud computing technologies make
collecting, processing, and analyzing the so-called big data possible. This
paper proposes an innovative ICT-solution to streamline smart meter data
analytics. The proposed solution offers an information integration pipeline for
ingesting data from smart meters, a scalable platform for processing and mining
big data sets, and a web portal for visualizing analytics results. The
implemented system has a hybrid architecture of using Spark or Hive for big
data processing, and using the machine learning toolkit, MADlib, for doing
in-database data analytics in PostgreSQL database. This paper evaluates the key
technologies of the proposed ICT-solution, and the results show the
effectiveness and efficiency of using the system for both batch and online
analytics.
","[{'version': 'v1', 'created': 'Sat, 18 Jun 2016 18:07:37 GMT'}]",2016-06-21,"[['Liu', 'Xiufeng', ''], ['Nielsen', 'Per Sieverts', '']]","['ICT-solution', 'Smart Meter Data', 'Big Data', 'Data Analytics']"
4014,1707.07312,Kaylen Pfisterer,"Kaylen J. Pfisterer, Robert Amelard, Audrey G. Chung, Alexander Wong","A new take on measuring relative nutritional density: The feasibility of
  using a deep neural network to assess commercially-prepared pureed food
  concentrations",,,10.1016/j.jfoodeng.2017.10.016,,cs.CV physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dysphagia affects 590 million people worldwide and increases risk for
malnutrition. Pureed food may reduce choking, however preparation differences
impact nutrient density making quality assurance necessary. This paper is the
first study to investigate the feasibility of computational pureed food
nutritional density analysis using an imaging system. Motivated by a
theoretical optical dilution model, a novel deep neural network (DNN) was
evaluated using 390 samples from thirteen types of commercially prepared purees
at five dilutions. The DNN predicted relative concentration of the puree sample
(20%, 40%, 60%, 80%, 100% initial concentration). Data were captured using
same-side reflectance of multispectral imaging data at different polarizations
at three exposures. Experimental results yielded an average top-1 prediction
accuracy of 92.2+/-0.41% with sensitivity and specificity of 83.0+/-15.0% and
95.0+/-4.8%, respectively. This DNN imaging system for nutrient density
analysis of pureed food shows promise as a novel tool for nutrient quality
assurance.
","[{'version': 'v1', 'created': 'Sun, 23 Jul 2017 14:57:23 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Nov 2017 14:54:09 GMT'}]",2017-11-06,"[['Pfisterer', 'Kaylen J.', ''], ['Amelard', 'Robert', ''], ['Chung', 'Audrey G.', ''], ['Wong', 'Alexander', '']]","['nutrient sensing', 'deep learning', 'image processing', 'pur´eed food']"
4015,1305.3038,Li Gongming,"Gongming Li, Hong An",Phase-Priority based Directory Coherence for Multicore Processor,"15 pages. International Journal of Computer Science, Engineering and
  Information Technology, April 2013",,10.5121/ijcseit.2013.3201,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As the number of cores in a single chip increases, a typical implementation
of coherence protocol adds significant hardware and complexity overhead.
Besides, the performance of CMP system depends on the data access latency,
which is highly affected by coherence protocol and on-chip interconnect. In
this paper, we propose PPB (Phase-Priority Based) cache coherence protocol, an
optimization of modern directory coherence protocol. We take advantage of the
observation that transient states occur in directory coherence protocol,
resulting in some unnecessary transient states and stalling. PPB cache
coherence protocol decouples a coherence transaction and introduces the idea of
phase message. This phase is considered as the priority of the message.
Additionally, we also add new priority-based arbitrators in on-chip network to
support PPB cache coherence protocol. This mechanism in on-chip network can
support effective cache access, which makes the on-chip network more efficient.
Our analysis on an execution-driven full system simulator using SPLASH-2
benchmark shows that PPB cache coherence outperforms a MESI based directory,
and the number of unnecessary transient states and stalling reduces up to 24%.
Also it reported the speedup of 7.4%. Other advantages of this strategy are
reduced delay of flits and significantly less energy consumption in on-chip
network.
","[{'version': 'v1', 'created': 'Tue, 14 May 2013 06:56:10 GMT'}]",2013-05-15,"[['Li', 'Gongming', ''], ['An', 'Hong', '']]","['Directory Cache Coherence', 'Chip Multiprocessors', 'Priority Cache Coherence']"
4016,1902.10756,Fazle Karim,"Fazle Karim, Somshubra Majumdar, Houshang Darabi","Insights into LSTM Fully Convolutional Networks for Time Series
  Classification","8 pages, 4 tables, 1 figure",,10.1109/ACCESS.2019.2916828,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Long Short Term Memory Fully Convolutional Neural Networks (LSTM-FCN) and
Attention LSTM-FCN (ALSTM-FCN) have shown to achieve state-of-the-art
performance on the task of classifying time series signals on the old
University of California-Riverside (UCR) time series repository. However, there
has been no study on why LSTM-FCN and ALSTM-FCN perform well. In this paper, we
perform a series of ablation tests (3627 experiments) on LSTM-FCN and ALSTM-FCN
to provide a better understanding of the model and each of its sub-module.
Results from the ablation tests on ALSTM-FCN and LSTM-FCN show that the LSTM
and the FCN blocks perform better when applied in a conjoined manner. Two
z-normalizing techniques, z-normalizing each sample independently and
z-normalizing the whole dataset, are compared using a Wilcoxson signed-rank
test to show a statistical difference in performance. In addition, we provide
an understanding of the impact dimension shuffle has on LSTM-FCN by comparing
its performance with LSTM-FCN when no dimension shuffle is applied. Finally, we
demonstrate the performance of the LSTM-FCN when the LSTM block is replaced by
a GRU, basic RNN, and Dense Block.
","[{'version': 'v1', 'created': 'Wed, 27 Feb 2019 19:55:54 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Mar 2019 23:49:12 GMT'}, {'version': 'v3', 'created': 'Mon, 1 Jul 2019 23:59:03 GMT'}]",2019-07-03,"[['Karim', 'Fazle', ''], ['Majumdar', 'Somshubra', ''], ['Darabi', 'Houshang', '']]","['Convolutional Neural Network', 'Long Short TermMemory Recurrent Neural Network', 'Time Series Classification']"
4017,1903.11588,Alina Costea,"Gh. Miscoi, A. Costea, R.I. \c{T}icu, C. Pomazan","Algorithms of evaluation of the waiting time and the modelling of the
  terminal activity",,"Ponte Journal, 2016",10.21506/j.ponte.2016.8.17,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper approaches the application of the waiting model with Poisson
inputs and priorities in the port activity. The arrival of ships in the
maritime terminal is numerically modelled, and specific parameters for the
distribution functions of service and of inputs are determined, in order to
establish the waiting time of ships in the seaport and a stationary process.
The modelling is based on waiting times and on the traffic coefficient.
","[{'version': 'v1', 'created': 'Wed, 20 Mar 2019 09:06:13 GMT'}]",2019-03-28,"[['Miscoi', 'Gh.', ''], ['Costea', 'A.', ''], ['Ţicu', 'R. I.', ''], ['Pomazan', 'C.', '']]","['priority classes', 'comprehensive service', 'traffic coefficient', 'waiting time', 'stationary conditions  1']"
4018,1304.2641,Jin-Kao Hao,"Yan Jin, Jin-Kao Hao and Jean-Philippe Hamiez",A memetic algorithm for the minimum sum coloring problem,Submitted manuscript,"Computers & Operations Research 43(3): 318-327, 2014",10.1016/j.cor.2013.09.019,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given an undirected graph $G$, the Minimum Sum Coloring problem (MSCP) is to
find a legal assignment of colors (represented by natural numbers) to each
vertex of $G$ such that the total sum of the colors assigned to the vertices is
minimized. This paper presents a memetic algorithm for MSCP based on a tabu
search procedure with two neighborhoods and a multi-parent crossover operator.
Experiments on a set of 77 well-known DIMACS and COLOR 2002-2004 benchmark
instances show that the proposed algorithm achieves highly competitive results
in comparison with five state-of-the-art algorithms. In particular, the
proposed algorithm can improve the best known results for 17 instances. We also
provide upper bounds for 18 additional instances for the first time.
","[{'version': 'v1', 'created': 'Tue, 9 Apr 2013 15:54:53 GMT'}]",2014-02-07,"[['Jin', 'Yan', ''], ['Hao', 'Jin-Kao', ''], ['Hamiez', 'Jean-Philippe', '']]","['Sum coloring', 'memetic algorithm', 'heuristics', 'combinatorial optimization']"
4019,1710.10899,Michael Lass,"Michael Lass and Stephan Mohr and Hendrik Wiebeler and Thomas D.
  K\""uhne and Christian Plessl","A Massively Parallel Algorithm for the Approximate Calculation of
  Inverse p-th Roots of Large Sparse Matrices",,,10.1145/3218176.3218231,,cs.DC cs.MS cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the submatrix method, a highly parallelizable method for the
approximate calculation of inverse p-th roots of large sparse symmetric
matrices which are required in different scientific applications. We follow the
idea of Approximate Computing, allowing imprecision in the final result in
order to be able to utilize the sparsity of the input matrix and to allow
massively parallel execution. For an n x n matrix, the proposed algorithm
allows to distribute the calculations over n nodes with only little
communication overhead. The approximate result matrix exhibits the same
sparsity pattern as the input matrix, allowing for efficient reuse of allocated
data structures.
  We evaluate the algorithm with respect to the error that it introduces into
calculated results, as well as its performance and scalability. We demonstrate
that the error is relatively limited for well-conditioned matrices and that
results are still valuable for error-resilient applications like
preconditioning even for ill-conditioned matrices. We discuss the execution
time and scaling of the algorithm on a theoretical level and present a
distributed implementation of the algorithm using MPI and OpenMP. We
demonstrate the scalability of this implementation by running it on a
high-performance compute cluster comprised of 1024 CPU cores, showing a speedup
of 665x compared to single-threaded execution.
","[{'version': 'v1', 'created': 'Mon, 30 Oct 2017 12:33:35 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Feb 2018 13:18:53 GMT'}, {'version': 'v3', 'created': 'Thu, 12 Apr 2018 13:50:40 GMT'}]",2020-03-06,"[['Lass', 'Michael', ''], ['Mohr', 'Stephan', ''], ['Wiebeler', 'Hendrik', ''], ['Kühne', 'Thomas D.', ''], ['Plessl', 'Christian', '']]","['approximate computing', 'linear algebra', 'matrix inversion', 'matrixp-th roots', 'numeric algorithm', 'parallel computing']"
4020,0801.4592,Yue Wang,"Yue Wang, John C. S. Lui, Dah-Ming Chiu","Understanding the Paradoxical Effects of Power Control on the Capacity
  of Wireless Networks","I refined the previous version in many places, including the title.
  to appear in IEEE Transactions on Wireless Communications",,10.1109/T-WC.2009.080142,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent works show conflicting results: network capacity may increase or
decrease with higher transmission power under different scenarios. In this
work, we want to understand this paradox. Specifically, we address the
following questions: (1)Theoretically, should we increase or decrease
transmission power to maximize network capacity? (2) Theoretically, how much
network capacity gain can we achieve by power control? (3) Under realistic
situations, how do power control, link scheduling and routing interact with
each other? Under which scenarios can we expect a large capacity gain by using
higher transmission power? To answer these questions, firstly, we prove that
the optimal network capacity is a non-decreasing function of transmission
power. Secondly, we prove that the optimal network capacity can be increased
unlimitedly by higher transmission power in some network configurations.
However, when nodes are distributed uniformly, the gain of optimal network
capacity by higher transmission power is upper-bounded by a positive constant.
Thirdly, we discuss why network capacity in practice may increase or decrease
with higher transmission power under different scenarios using carrier sensing
and the minimum hop-count routing. Extensive simulations are carried out to
verify our analysis.
","[{'version': 'v1', 'created': 'Wed, 30 Jan 2008 02:51:11 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Sep 2008 04:03:33 GMT'}]",2016-11-17,"[['Wang', 'Yue', ''], ['Lui', 'John C. S.', ''], ['Chiu', 'Dah-Ming', '']]","['Network Capacity', 'Power Control', 'Routing', 'LinkScheduling']"
4021,1808.00714,Elena Kirshanova,Elena Kirshanova,Improved Quantum Information Set Decoding,"This is a full and corrected version of the paper appeared in
  PQCrypto2018",,10.1007/978-3-319-79063-3_24,,cs.IT math.IT quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present quantum information set decoding (ISD) algorithms
for binary linear codes. First, we give an alternative view on the quantum walk
based algorithms proposed by Kachigar and Tillich (PQCrypto'17). It is more
general and allows to consider any ISD algorithm that has certain properties.
The algorithms of May-Meuer-Thomae and Becker-Jeux-May-Meuer satisfy these
properties. Second, we translate May-Ozerov Near Neighbour technique
(Eurocrypt'15) to an `update-and-query' language more suitable for the quantum
walk framework. First, this re-interpretation makes possible to analyse a
broader class of algorithms and, second, allows us to combine Near Neighbour
search with the quantum walk framework and use both techniques to give a
quantum version of Dumer's ISD with Near Neighbour.
","[{'version': 'v1', 'created': 'Thu, 2 Aug 2018 09:04:26 GMT'}]",2018-08-03,"[['Kirshanova', 'Elena', '']]","['information set decoding', 'quantum walk', 'near neighbour']"
4022,1801.00182,Xiao-Yun Zhou,"Xiao-Yun Zhou, Guang-Zhong Yang, Su-Lin Lee","A Real-time and Registration-free Framework for Dynamic Shape
  Instantiation","35 Pages, 11 figures",Medical Image Analysis 44 (2017): 86-97,10.1016/j.media.2017.11.009,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real-time 3D navigation during minimally invasive procedures is an essential
yet challenging task, especially when considerable tissue motion is involved.
To balance image acquisition speed and resolution, only 2D images or
low-resolution 3D volumes can be used clinically. In this paper, a real-time
and registration-free framework for dynamic shape instantiation, generalizable
to multiple anatomical applications, is proposed to instantiate high-resolution
3D shapes of an organ from a single 2D image intra-operatively. Firstly, an
approximate optimal scan plane was determined by analyzing the pre-operative 3D
statistical shape model (SSM) of the anatomy with sparse principal component
analysis (SPCA) and considering practical constraints . Secondly, kernel
partial least squares regression (KPLSR) was used to learn the relationship
between the pre-operative 3D SSM and a synchronized 2D SSM constructed from 2D
images obtained at the approximate optimal scan plane. Finally, the derived
relationship was applied to the new intra-operative 2D image obtained at the
same scan plane to predict the high-resolution 3D shape intra-operatively. A
major feature of the proposed framework is that no extra registration between
the pre-operative 3D SSM and the synchronized 2D SSM is required. Detailed
validation was performed on studies including the liver and right ventricle
(RV) of the heart. The derived results (mean accuracy of 2.19mm on patients and
computation speed of 1ms) demonstrate its potential clinical value for
real-time, high-resolution, dynamic and 3D interventional guidance.
","[{'version': 'v1', 'created': 'Sat, 30 Dec 2017 19:25:09 GMT'}]",2018-01-03,"[['Zhou', 'Xiao-Yun', ''], ['Yang', 'Guang-Zhong', ''], ['Lee', 'Su-Lin', '']]","['Image-guided interventions', 'Dynamic shape instantiation', '3D']"
4023,1403.4462,Andrzej  Cichocki,"A. Cichocki, D. Mandic, A-H. Phan, C. Caiafa, G. Zhou, Q. Zhao, and L.
  De Lathauwer","Tensor Decompositions for Signal Processing Applications From Two-way to
  Multiway Component Analysis",,,10.1109/MSP.2013.2297439,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The widespread use of multi-sensor technology and the emergence of big
datasets has highlighted the limitations of standard flat-view matrix models
and the necessity to move towards more versatile data analysis tools. We show
that higher-order tensors (i.e., multiway arrays) enable such a fundamental
paradigm shift towards models that are essentially polynomial and whose
uniqueness, unlike the matrix methods, is guaranteed under verymild and natural
conditions. Benefiting fromthe power ofmultilinear algebra as theirmathematical
backbone, data analysis techniques using tensor decompositions are shown to
have great flexibility in the choice of constraints that match data properties,
and to find more general latent components in the data than matrix-based
methods. A comprehensive introduction to tensor decompositions is provided from
a signal processing perspective, starting from the algebraic foundations, via
basic Canonical Polyadic and Tucker models, through to advanced cause-effect
and multi-view data analysis schemes. We show that tensor decompositions enable
natural generalizations of some commonly used signal processing paradigms, such
as canonical correlation and subspace techniques, signal separation, linear
regression, feature extraction and classification. We also cover computational
aspects, and point out how ideas from compressed sensing and scientific
computing may be used for addressing the otherwise unmanageable storage and
manipulation problems associated with big datasets. The concepts are supported
by illustrative real world case studies illuminating the benefits of the tensor
framework, as efficient and promising tools for modern signal processing, data
analysis and machine learning applications; these benefits also extend to
vector/matrix data through tensorization. Keywords: ICA, NMF, CPD, Tucker
decomposition, HOSVD, tensor networks, Tensor Train.
","[{'version': 'v1', 'created': 'Mon, 17 Mar 2014 11:03:58 GMT'}]",2015-06-19,"[['Cichocki', 'A.', ''], ['Mandic', 'D.', ''], ['Phan', 'A-H.', ''], ['Caiafa', 'C.', ''], ['Zhou', 'G.', ''], ['Zhao', 'Q.', ''], ['De Lathauwer', 'L.', '']]","['ICA', 'NMF', 'CPD', 'Tucker decomposition', 'HOSVD', 'tensor networks', 'Tensor Train']"
4024,1808.06686,Ekraam Sabir,"Ekraam Sabir, Wael AbdAlmageed, Yue Wu and Prem Natarajan",Deep Multimodal Image-Repurposing Detection,To be published at ACM Multimeda 2018 (orals),,10.1145/3240508.3240707,,cs.MM cs.AI cs.CV cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nefarious actors on social media and other platforms often spread rumors and
falsehoods through images whose metadata (e.g., captions) have been modified to
provide visual substantiation of the rumor/falsehood. This type of modification
is referred to as image repurposing, in which often an unmanipulated image is
published along with incorrect or manipulated metadata to serve the actor's
ulterior motives. We present the Multimodal Entity Image Repurposing (MEIR)
dataset, a substantially challenging dataset over that which has been
previously available to support research into image repurposing detection. The
new dataset includes location, person, and organization manipulations on
real-world data sourced from Flickr. We also present a novel, end-to-end, deep
multimodal learning model for assessing the integrity of an image by combining
information extracted from the image with related information from a knowledge
base. The proposed method is compared against state-of-the-art techniques on
existing datasets as well as MEIR, where it outperforms existing methods across
the board, with AUC improvement up to 0.23.
","[{'version': 'v1', 'created': 'Mon, 20 Aug 2018 20:47:56 GMT'}]",2018-08-22,"[['Sabir', 'Ekraam', ''], ['AbdAlmageed', 'Wael', ''], ['Wu', 'Yue', ''], ['Natarajan', 'Prem', '']]","['Rumor detection', 'fake news', 'computer vision', 'deep learning', 'multitask learning']"
4025,1311.5904,J. C. D\'iaz-V\'elez,"M. G. Aartsen, R. Abbasi, M. Ackermann, J. Adams, J. A. Aguilar, M.
  Ahlers, D. Altmann, C. Arguelles, J. Auffenberg, X. Bai, M. Baker, S. W.
  Barwick, V. Baum, R. Bay, J. J. Beatty, J. Becker Tjus, K.-H. Becker, S.
  BenZvi, P. Berghaus, D. Berley, E. Bernardini, A. Bernhard, D. Z. Besson, G.
  Binder, D. Bindig, M. Bissok, E. Blaufuss, J. Blumenthal, D. J. Boersma, C.
  Bohm, D. Bose, S. B\""oser, O. Botner, L. Brayeur, H.-P. Bretz, A. M. Brown,
  R. Bruijn, J. Casey, M. Casier, D. Chirkin, A. Christov, B. Christy, K.
  Clark, L. Classen, F. Clevermann, S. Coenders, S. Cohen, D. F. Cowen, A. H.
  Cruz Silva, M. Danninger, J. Daughhetee, J. C. Davis, M. Day, C. De Clercq,
  S. De Ridder, P. Desiati, K. D. de Vries, M. de With, T. DeYoung, J. C.
  D\'iaz-V\'elez, M. Dunkman, R. Eagan, B. Eberhardt, B. Eichmann, J. Eisch, S.
  Euler, P. A. Evenson, O. Fadiran, A. R. Fazely, A. Fedynitch, J. Feintzeig,
  T. Feusels, K. Filimonov, C. Finley, T. Fischer-Wasels, S. Flis, A.
  Franckowiak, K. Frantzen, T. Fuchs, T. K. Gaisser, J. Gallagher, L. Gerhardt,
  L. Gladstone, T. Gl\""usenkamp, A. Goldschmidt, G. Golup, J. G. Gonzalez, J.
  A. Goodman, D. G\'ora, D. T. Grandmont, D. Grant, P. Gretskov, J. C. Groh, A.
  Gro{\ss}, C. Ha, A. Haj Ismail, P. Hallen, A. Hallgren, F. Halzen, K. Hanson,
  D. Hebecker, D. Heereman, D. Heinen, K. Helbing, R. Hellauer, S. Hickford, G.
  C. Hill, K. D. Hoffman, R. Hoffmann, A. Homeier, K. Hoshina, F. Huang, W.
  Huelsnitz, P. O. Hulth, K. Hultqvist, S. Hussain, A. Ishihara, E. Jacobi, J.
  Jacobsen, K. Jagielski, G. S. Japaridze, K. Jero, O. Jlelati, B. Kaminsky, A.
  Kappes, T. Karg, A. Karle, M. Kauer, J. L. Kelley, J. Kiryluk, J. Kl\""as, S.
  R. Klein, J.-H. K\""ohne, G. Kohnen, H. Kolanoski, L. K\""opke, C. Kopper, S.
  Kopper, D. J. Koskinen, M. Kowalski, M. Krasberg, A. Kriesten, K. Krings, G.
  Kroll, J. Kunnen, N. Kurahashi, T. Kuwabara, M. Labare, H. Landsman, M. J.
  Larson, M. Lesiak-Bzdak, M. Leuermann, J. Leute, J. L\""unemann, O. Mac\'ias,
  J. Madsen, G. Maggi, R. Maruyama, K. Mase, H. S. Matis, F. McNally, K.
  Meagher, M. Merck, G. Merino, T. Meures, S. Miarecki, E. Middell, N. Milke,
  J. Miller, L. Mohrmann, T. Montaruli, R. Morse, R. Nahnhauer, U. Naumann, H.
  Niederhausen, S. C. Nowicki, D. R. Nygren, A. Obertacke, S. Odrowski, A.
  Olivas, A. Omairat, A. O'Murchadha, L. Paul, J. A. Pepper, C. P\'erez de los
  Heros, C. Pfendner, D. Pieloth, E. Pinat, J. Posselt, P. B. Price, G. T.
  Przybylski, M. Quinnan, L. R \""adel, I. Rae, M. Rameez, K. Rawlins, P. Redl,
  R. Reimann, E. Resconi, W. Rhode, M. Ribordy, M. Richman, B. Riedel, J. P.
  Rodrigues, C. Rott, T. Ruhe, B. Ruzybayev, D. Ryckbosch, S. M. Saba, H.-G.
  Sander, M. Santander, S. Sarkar, K. Schatto, F. Scheriau, T. Schmidt, M.
  Schmitz, S. Schoenen, S. Sch\""oneberg, A. Sch\""onwald, A. Schukraft, L.
  Schulte, D. Schultz, O. Schulz, D. Seckel, Y. Sestayo, S. Seunarine, R.
  Shanidze, C. Sheremata, M. W. E. Smith, D. Soldin, G. M. Spiczak, C.
  Spiering, M. Stamatikos, T. Stanev, N. A. Stanisha, A. Stasik, T.
  Stezelberger, R. G. Stokstad, A. St\""o{\ss}l, E. A. Strahler, R. Str\""om, N.
  L. Strotjohann, G. W. Sullivan, H. Taavola, I. Taboada, A. Tamburro, A. Tepe,
  S. Ter-Antonyan, G. Te\v{s}i\'c, S. Tilav, P. A. Toale, M. N. Tobin, S.
  Toscano, M. Tselengidou, E. Unger, M. Usner, S. Vallecorsa, N. van
  Eijndhoven, A. Van Overloop, J. van Santen, M. Vehring, M. Voge, M. Vraeghe,
  C. Walck, T. Waldenmaier, M. Wallraff, Ch. Weaver, M. Wellons, C. Wendt, S.
  Westerhoff, N. Whitehorn, K. Wiebe, C. H. Wiebusch, D. R. Williams, H.
  Wissing, M. Wolf, T. R. Wood, K. Woschnagg, D. L. Xu, X. W. Xu, J. P. Yanez,
  G. Yodh, S. Yoshida, P. Zarzhitsky, J. Ziemann, S. Zierke, M. Zoll","The IceProd Framework: Distributed Data Processing for the IceCube
  Neutrino Observatory",,"Journal of Parallel & Distributed Computing 75:198,2015",10.1016/j.jpdc.2014.08.001,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  IceCube is a one-gigaton instrument located at the geographic South Pole,
designed to detect cosmic neutrinos, iden- tify the particle nature of dark
matter, and study high-energy neutrinos themselves. Simulation of the IceCube
detector and processing of data require a significant amount of computational
resources. IceProd is a distributed management system based on Python, XML-RPC
and GridFTP. It is driven by a central database in order to coordinate and
admin- ister production of simulations and processing of data produced by the
IceCube detector. IceProd runs as a separate layer on top of other middleware
and can take advantage of a variety of computing resources, including grids and
batch systems such as CREAM, Condor, and PBS. This is accomplished by a set of
dedicated daemons that process job submission in a coordinated fashion through
the use of middleware plugins that serve to abstract the details of job
submission and job management from the framework.
","[{'version': 'v1', 'created': 'Fri, 22 Nov 2013 21:16:58 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Jul 2014 22:31:16 GMT'}, {'version': 'v3', 'created': 'Fri, 22 Aug 2014 21:31:55 GMT'}]",2016-02-23,"[['Aartsen', 'M. G.', ''], ['Abbasi', 'R.', ''], ['Ackermann', 'M.', ''], ['Adams', 'J.', ''], ['Aguilar', 'J. A.', ''], ['Ahlers', 'M.', ''], ['Altmann', 'D.', ''], ['Arguelles', 'C.', ''], ['Auffenberg', 'J.', ''], ['Bai', 'X.', ''], ['Baker', 'M.', ''], ['Barwick', 'S. W.', ''], ['Baum', 'V.', ''], ['Bay', 'R.', ''], ['Beatty', 'J. J.', ''], ['Tjus', 'J. Becker', ''], ['Becker', 'K. -H.', ''], ['BenZvi', 'S.', ''], ['Berghaus', 'P.', ''], ['Berley', 'D.', ''], ['Bernardini', 'E.', ''], ['Bernhard', 'A.', ''], ['Besson', 'D. Z.', ''], ['Binder', 'G.', ''], ['Bindig', 'D.', ''], ['Bissok', 'M.', ''], ['Blaufuss', 'E.', ''], ['Blumenthal', 'J.', ''], ['Boersma', 'D. J.', ''], ['Bohm', 'C.', ''], ['Bose', 'D.', ''], ['Böser', 'S.', ''], ['Botner', 'O.', ''], ['Brayeur', 'L.', ''], ['Bretz', 'H. -P.', ''], ['Brown', 'A. M.', ''], ['Bruijn', 'R.', ''], ['Casey', 'J.', ''], ['Casier', 'M.', ''], ['Chirkin', 'D.', ''], ['Christov', 'A.', ''], ['Christy', 'B.', ''], ['Clark', 'K.', ''], ['Classen', 'L.', ''], ['Clevermann', 'F.', ''], ['Coenders', 'S.', ''], ['Cohen', 'S.', ''], ['Cowen', 'D. F.', ''], ['Silva', 'A. H. Cruz', ''], ['Danninger', 'M.', ''], ['Daughhetee', 'J.', ''], ['Davis', 'J. C.', ''], ['Day', 'M.', ''], ['De Clercq', 'C.', ''], ['De Ridder', 'S.', ''], ['Desiati', 'P.', ''], ['de Vries', 'K. D.', ''], ['de With', 'M.', ''], ['DeYoung', 'T.', ''], ['Díaz-Vélez', 'J. C.', ''], ['Dunkman', 'M.', ''], ['Eagan', 'R.', ''], ['Eberhardt', 'B.', ''], ['Eichmann', 'B.', ''], ['Eisch', 'J.', ''], ['Euler', 'S.', ''], ['Evenson', 'P. A.', ''], ['Fadiran', 'O.', ''], ['Fazely', 'A. R.', ''], ['Fedynitch', 'A.', ''], ['Feintzeig', 'J.', ''], ['Feusels', 'T.', ''], ['Filimonov', 'K.', ''], ['Finley', 'C.', ''], ['Fischer-Wasels', 'T.', ''], ['Flis', 'S.', ''], ['Franckowiak', 'A.', ''], ['Frantzen', 'K.', ''], ['Fuchs', 'T.', ''], ['Gaisser', 'T. K.', ''], ['Gallagher', 'J.', ''], ['Gerhardt', 'L.', ''], ['Gladstone', 'L.', ''], ['Glüsenkamp', 'T.', ''], ['Goldschmidt', 'A.', ''], ['Golup', 'G.', ''], ['Gonzalez', 'J. G.', ''], ['Goodman', 'J. A.', ''], ['Góra', 'D.', ''], ['Grandmont', 'D. T.', ''], ['Grant', 'D.', ''], ['Gretskov', 'P.', ''], ['Groh', 'J. C.', ''], ['Groß', 'A.', ''], ['Ha', 'C.', ''], ['Ismail', 'A. Haj', ''], ['Hallen', 'P.', ''], ['Hallgren', 'A.', ''], ['Halzen', 'F.', ''], ['Hanson', 'K.', ''], ['Hebecker', 'D.', ''], ['Heereman', 'D.', ''], ['Heinen', 'D.', ''], ['Helbing', 'K.', ''], ['Hellauer', 'R.', ''], ['Hickford', 'S.', ''], ['Hill', 'G. C.', ''], ['Hoffman', 'K. D.', ''], ['Hoffmann', 'R.', ''], ['Homeier', 'A.', ''], ['Hoshina', 'K.', ''], ['Huang', 'F.', ''], ['Huelsnitz', 'W.', ''], ['Hulth', 'P. O.', ''], ['Hultqvist', 'K.', ''], ['Hussain', 'S.', ''], ['Ishihara', 'A.', ''], ['Jacobi', 'E.', ''], ['Jacobsen', 'J.', ''], ['Jagielski', 'K.', ''], ['Japaridze', 'G. S.', ''], ['Jero', 'K.', ''], ['Jlelati', 'O.', ''], ['Kaminsky', 'B.', ''], ['Kappes', 'A.', ''], ['Karg', 'T.', ''], ['Karle', 'A.', ''], ['Kauer', 'M.', ''], ['Kelley', 'J. L.', ''], ['Kiryluk', 'J.', ''], ['Kläs', 'J.', ''], ['Klein', 'S. R.', ''], ['Köhne', 'J. -H.', ''], ['Kohnen', 'G.', ''], ['Kolanoski', 'H.', ''], ['Köpke', 'L.', ''], ['Kopper', 'C.', ''], ['Kopper', 'S.', ''], ['Koskinen', 'D. J.', ''], ['Kowalski', 'M.', ''], ['Krasberg', 'M.', ''], ['Kriesten', 'A.', ''], ['Krings', 'K.', ''], ['Kroll', 'G.', ''], ['Kunnen', 'J.', ''], ['Kurahashi', 'N.', ''], ['Kuwabara', 'T.', ''], ['Labare', 'M.', ''], ['Landsman', 'H.', ''], ['Larson', 'M. J.', ''], ['Lesiak-Bzdak', 'M.', ''], ['Leuermann', 'M.', ''], ['Leute', 'J.', ''], ['Lünemann', 'J.', ''], ['Macías', 'O.', ''], ['Madsen', 'J.', ''], ['Maggi', 'G.', ''], ['Maruyama', 'R.', ''], ['Mase', 'K.', ''], ['Matis', 'H. S.', ''], ['McNally', 'F.', ''], ['Meagher', 'K.', ''], ['Merck', 'M.', ''], ['Merino', 'G.', ''], ['Meures', 'T.', ''], ['Miarecki', 'S.', ''], ['Middell', 'E.', ''], ['Milke', 'N.', ''], ['Miller', 'J.', ''], ['Mohrmann', 'L.', ''], ['Montaruli', 'T.', ''], ['Morse', 'R.', ''], ['Nahnhauer', 'R.', ''], ['Naumann', 'U.', ''], ['Niederhausen', 'H.', ''], ['Nowicki', 'S. C.', ''], ['Nygren', 'D. R.', ''], ['Obertacke', 'A.', ''], ['Odrowski', 'S.', ''], ['Olivas', 'A.', ''], ['Omairat', 'A.', ''], [""O'Murchadha"", 'A.', ''], ['Paul', 'L.', ''], ['Pepper', 'J. A.', ''], ['Heros', 'C. Pérez de los', ''], ['Pfendner', 'C.', ''], ['Pieloth', 'D.', ''], ['Pinat', 'E.', ''], ['Posselt', 'J.', ''], ['Price', 'P. B.', ''], ['Przybylski', 'G. T.', ''], ['Quinnan', 'M.', ''], ['ädel', 'L. R', ''], ['Rae', 'I.', ''], ['Rameez', 'M.', ''], ['Rawlins', 'K.', ''], ['Redl', 'P.', ''], ['Reimann', 'R.', ''], ['Resconi', 'E.', ''], ['Rhode', 'W.', ''], ['Ribordy', 'M.', ''], ['Richman', 'M.', ''], ['Riedel', 'B.', ''], ['Rodrigues', 'J. P.', ''], ['Rott', 'C.', ''], ['Ruhe', 'T.', ''], ['Ruzybayev', 'B.', ''], ['Ryckbosch', 'D.', ''], ['Saba', 'S. M.', ''], ['Sander', 'H. -G.', ''], ['Santander', 'M.', ''], ['Sarkar', 'S.', ''], ['Schatto', 'K.', ''], ['Scheriau', 'F.', ''], ['Schmidt', 'T.', ''], ['Schmitz', 'M.', ''], ['Schoenen', 'S.', ''], ['Schöneberg', 'S.', ''], ['Schönwald', 'A.', ''], ['Schukraft', 'A.', ''], ['Schulte', 'L.', ''], ['Schultz', 'D.', ''], ['Schulz', 'O.', ''], ['Seckel', 'D.', ''], ['Sestayo', 'Y.', ''], ['Seunarine', 'S.', ''], ['Shanidze', 'R.', ''], ['Sheremata', 'C.', ''], ['Smith', 'M. W. E.', ''], ['Soldin', 'D.', ''], ['Spiczak', 'G. M.', ''], ['Spiering', 'C.', ''], ['Stamatikos', 'M.', ''], ['Stanev', 'T.', ''], ['Stanisha', 'N. A.', ''], ['Stasik', 'A.', ''], ['Stezelberger', 'T.', ''], ['Stokstad', 'R. G.', ''], ['Stößl', 'A.', ''], ['Strahler', 'E. A.', ''], ['Ström', 'R.', ''], ['Strotjohann', 'N. L.', ''], ['Sullivan', 'G. W.', ''], ['Taavola', 'H.', ''], ['Taboada', 'I.', ''], ['Tamburro', 'A.', ''], ['Tepe', 'A.', ''], ['Ter-Antonyan', 'S.', ''], ['Tešić', 'G.', ''], ['Tilav', 'S.', ''], ['Toale', 'P. A.', ''], ['Tobin', 'M. N.', ''], ['Toscano', 'S.', ''], ['Tselengidou', 'M.', ''], ['Unger', 'E.', ''], ['Usner', 'M.', ''], ['Vallecorsa', 'S.', ''], ['van Eijndhoven', 'N.', ''], ['Van Overloop', 'A.', ''], ['van Santen', 'J.', ''], ['Vehring', 'M.', ''], ['Voge', 'M.', ''], ['Vraeghe', 'M.', ''], ['Walck', 'C.', ''], ['Waldenmaier', 'T.', ''], ['Wallraff', 'M.', ''], ['Weaver', 'Ch.', ''], ['Wellons', 'M.', ''], ['Wendt', 'C.', ''], ['Westerhoff', 'S.', ''], ['Whitehorn', 'N.', ''], ['Wiebe', 'K.', ''], ['Wiebusch', 'C. H.', ''], ['Williams', 'D. R.', ''], ['Wissing', 'H.', ''], ['Wolf', 'M.', ''], ['Wood', 'T. R.', ''], ['Woschnagg', 'K.', ''], ['Xu', 'D. L.', ''], ['Xu', 'X. W.', ''], ['Yanez', 'J. P.', ''], ['Yodh', 'G.', ''], ['Yoshida', 'S.', ''], ['Zarzhitsky', 'P.', ''], ['Ziemann', 'J.', ''], ['Zierke', 'S.', ''], ['Zoll', 'M.', '']]","['Data Management', 'Grid Computing', 'Monitoring', 'Distributed Computing']"
4026,2012.01635,Xiaoming Liu,"Xiaoming Liu, Shaocong Wu, Zhaohan Zhang, and Chao Shen",Unify Local and Global Information for Top-$N$ Recommendation,Accepted by SIGIR 2022 as Full Paper,"Proceedings of the 45th International ACM SIGIR Conference on
  Research and Development in Information Retrieval, 2022",10.1145/3477495.3532070,,cs.IR cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Knowledge graph (KG), integrating complex information and containing rich
semantics, is widely considered as side information to enhance the
recommendation systems. However, most of the existing KG-based methods
concentrate on encoding the structural information in the graph, without
utilizing the collaborative signals in user-item interaction data, which are
important for understanding user preferences. Therefore, the representations
learned by these models are insufficient for representing semantic information
of users and items in the recommendation environment. The combination of both
kinds of data provides a good chance to solve this problem. To tackle this
research gap, we propose a novel duet representation learning framework named
\sysname to fuse local information (user-item interaction data) and global
information (external knowledge graph) for the top-$N$ recommendation, which is
composed of two separate sub-models. One learns the local representations by
discovering the inner correlations in local information with a knowledge-aware
co-attention mechanism, and another learns the global representations by
encoding the knowledge associations in global information with a relation-aware
attention network. The two sub-models are jointly trained as part of the
semantic fusion network to compute the user preferences, which discriminates
the contribution of the two sub-models under the special context. We conduct
experiments on two real-world datasets, and the evaluations show that KADM
significantly outperforms state-of-art methods. Further ablation studies
confirm that the duet architecture performs significantly better than either
sub-model on the recommendation tasks.
","[{'version': 'v1', 'created': 'Thu, 3 Dec 2020 01:52:14 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Apr 2022 00:48:14 GMT'}]",2022-04-28,"[['Liu', 'Xiaoming', ''], ['Wu', 'Shaocong', ''], ['Zhang', 'Zhaohan', ''], ['Shen', 'Chao', '']]","['Recommendation System', 'Duet Representation Learning', 'Collaborative Signals', 'Knowledge Graph', 'Local and Global Information']"
4027,1008.2855,Behnam Dezfouli,"Behnam Dezfouli, Marjan Radi, Shukor Abd Razak","A Cross-Layer Approach for Minimizing Interference and Latency of Medium
  Access in Wireless Sensor Networks","17 pages, 16 figures","International journal of Computer Networks & Communications, vol.
  2, 2010, pp. 126-142",10.5121/ijcnc.2010.2411,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In low power wireless sensor networks, MAC protocols usually employ periodic
sleep/wake schedule to reduce idle listening time. Even though this mechanism
is simple and efficient, it results in high end-to-end latency and low
throughput. On the other hand, the previously proposed CSMA/CA-based MAC
protocols have tried to reduce inter-node interference at the cost of increased
latency and lower network capacity. In this paper we propose IAMAC, a CSMA/CA
sleep/wake MAC protocol that minimizes inter-node interference, while also
reduces per-hop delay through cross-layer interactions with the network layer.
Furthermore, we show that IAMAC can be integrated into the SP architecture to
perform its inter-layer interactions. Through simulation, we have extensively
evaluated the performance of IAMAC in terms of different performance metrics.
Simulation results confirm that IAMAC reduces energy consumption per node and
leads to higher network lifetime compared to S-MAC and Adaptive S-MAC, while it
also provides lower latency than S-MAC. Throughout our evaluations we have
considered IAMAC in conjunction with two error recovery methods, i.e., ARQ and
Seda. It is shown that using Seda as the error recovery mechanism of IAMAC
results in higher throughput and lifetime compared to ARQ.
","[{'version': 'v1', 'created': 'Tue, 17 Aug 2010 09:54:15 GMT'}]",2010-08-18,"[['Dezfouli', 'Behnam', ''], ['Radi', 'Marjan', ''], ['Razak', 'Shukor Abd', '']]","['Wireless Sensor Networks', 'MAC', 'IAMAC', 'Tree-Based Routing', 'Cross-Layer Optimization', 'Interference']"
4028,1204.1414,Rajab Legnain,"Rajab M. Legnain, Roshdy H. M. Hafez and Abdelgader M. Legnain",Improved Spatial Modulation for High Spectral Efficiency,"7 pages, 4 figures, 1 table, International Journal of Distributed and
  Parallel Systems (IJDPS) Vol.3, No.2, March 2012",,10.5121/ijdps.2012.3202,,cs.SY cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spatial Modulation (SM) is a technique that can enhance the capacity of MIMO
schemes by exploiting the index of transmit antenna to convey information bits.
In this paper, we describe this technique, and present a new MIMO transmission
scheme that combines SM and spatial multiplexing. In the basic form of SM, only
one out of MT available antennas is selected for transmission in any given
symbol interval. We propose to use more than one antenna to transmit several
symbols simultaneously. This would increase the spectral efficiency. At the
receiver, an optimal detector is employed to jointly estimate the transmitted
symbols as well as the index of the active transmit antennas. In this paper we
evaluate the performance of this scheme in an uncorrelated Rayleigh fading
channel. The simulations results show that the proposed scheme outperforms the
optimal SM and V-BLAST (Vertical Bell Laboratories Layered space-time at high
signal-to-noise ratio (SNR). For example, if we seek a spectral efficiency of 8
bits/s/Hz at bit error rate (BER) of 10^-5, the proposed scheme provides 5dB
and 7dB improvements over SM and V-BLAST, respectively.
","[{'version': 'v1', 'created': 'Fri, 6 Apr 2012 06:02:40 GMT'}]",2012-04-09,"[['Legnain', 'Rajab M.', ''], ['Hafez', 'Roshdy H. M.', ''], ['Legnain', 'Abdelgader M.', '']]","['Spatial Modulation (SM)', 'MIMO systems', 'Maximum Likelihood detection']"
4029,1601.00847,David Breuer,"David Breuer, Zoran Nikoloski","DeFiNe: an optimisation-based method for robust disentangling of
  filamentous networks",,"Sci Rep, 2015, 5:18267",10.1038/srep18267,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Thread-like structures are pervasive across scales, from polymeric proteins
to root systems to galaxy filaments, and their characteristics can be readily
investigated in the network formalism. Yet, network links usually represent
only parts of filaments, which, when neglected, may lead to erroneous
conclusions from network-based analyses. The existing alternatives to detect
filaments in network representations require tuning of parameters over a large
range of values and treat all filaments equally, thus, precluding automated
analysis of diverse filamentous systems. Here, we propose a fully automated and
robust optimisation-based approach to detect filaments of consistent
intensities and angles in a given network. We test and demonstrate the accuracy
of our solution with contrived, biological, and cosmic filamentous structures.
In particular, we show that the proposed approach provides powerful automated
means to study properties of individual actin filaments in their network
context. Our solution is made publicly available as an open-source tool,
DeFiNe, facilitating decomposition of any given network into individual
filaments.
","[{'version': 'v1', 'created': 'Mon, 4 Jan 2016 10:23:08 GMT'}]",2017-06-01,"[['Breuer', 'David', ''], ['Nikoloski', 'Zoran', '']]","['polymers', 'cytoskeleton', 'networks', 'path cover', 'computational complexity']"
4030,2203.13231,Eric Schulte,"Eric Schulte, Michael D. Brown, Vlad Folts",A Broad Comparative Evaluation of x86-64 Binary Rewriters,"16 pages, 14 tables, 5 figures","In Cyber Security Experimentation and Test Workshop (CSET 2022),
  August 8, 2022, Virtual, CA, USA. ACM, New York, NY, USA",10.1145/3546096.3546112,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Binary rewriting is a rapidly-maturing technique for modifying software for
instrumentation, customization, optimization, and hardening without access to
source code. Unfortunately, the practical applications of binary rewriting
tools are often unclear to users because their limitations are glossed over in
the literature. This, among other challenges, has prohibited the widespread
adoption of these tools. To address this shortcoming, we collect ten popular
binary rewriters and assess their generality across a broad range of input
binary classes and the functional reliability of the resulting rewritten
binaries. Additionally, we evaluate the performance of the rewriters themselves
as well as the rewritten binaries they produce.
  The goal of this broad evaluation is to establish a shared context for future
research and development of binary rewriting tools by providing a state of the
practice for their capabilities. To support potential binary rewriter users, we
also identify input binary features that are predictive of tool success and
show that a simple decision tree model can accurately predict whether a
particular tool can rewrite a target binary. The binary rewriters, our corpus
of 3344 sample binaries, and the evaluation infrastructure itself are all
freely available as open-source software.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2022 17:43:56 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Jul 2022 13:46:44 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Sep 2022 18:41:19 GMT'}]",2022-09-09,"[['Schulte', 'Eric', ''], ['Brown', 'Michael D.', ''], ['Folts', 'Vlad', '']]","['Binary Rewriting', 'Binary Analysis', 'Binary Recompilation']"
4031,1003.3558,Secretary Aircc Journal,"Neeraj Kumar (1), Manoj Kumar (1), R.B. Patel (2) ((1) SMVD
  University, Katra (J&K), India, (2) MITS University, Rajassthan, India)","Coverage and Connectivity Aware Neural Network Based Energy Efficient
  Routing in Wireless Sensor Networks","16 Pages, JGraph-Hoc Journal","International journal on applications of graph theory in wireless
  ad hoc networks and sensor networks 2.1 (2010) 45-60",10.5121/jgraphhoc.2010.2105,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  There are many challenges when designing and deploying wireless sensor
networks (WSNs). One of the key challenges is how to make full use of the
limited energy to prolong the lifetime of the network, because energy is a
valuable resource in WSNs. The status of energy consumption should be
continuously monitored after network deployment. In this paper, we propose
coverage and connectivity aware neural network based energy efficient routing
in WSN with the objective of maximizing the network lifetime. In the proposed
scheme, the problem is formulated as linear programming (LP) with coverage and
connectivity aware constraints. Cluster head selection is proposed using
adaptive learning in neural networks followed by coverage and connectivity
aware routing with data transmission. The proposed scheme is compared with
existing schemes with respect to the parameters such as number of alive nodes,
packet delivery fraction, and node residual energy. The simulation results show
that the proposed scheme can be used in wide area of applications in WSNs.
","[{'version': 'v1', 'created': 'Thu, 18 Mar 2010 11:43:35 GMT'}]",2012-07-04,"[['Kumar', 'Neeraj', ''], ['Kumar', 'Manoj', ''], ['Patel', 'R. B.', '']]","['Sensor networks', 'Energy Efficiency', 'Routing metric', 'Linear Programming', 'Neural Networks', 'coverage and connectivity']"
4032,1801.00938,Jukka Ruohonen,Jukka Ruohonen,A Look at the Time Delays in CVSS Vulnerability Scoring,http://www.sciencedirect.com/science/article/pii/S2210832717302995,"Applied Computing and Informatics (published online in December
  2017)",10.1016/j.aci.2017.12.002,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This empirical paper examines the time delays that occur between the
publication of Common Vulnerabilities and Exposures (CVEs) in the National
Vulnerability Database (NVD) and the Common Vulnerability Scoring System (CVSS)
information attached to published CVEs. According to the empirical results
based on regularized regression analysis of over eighty thousand archived
vulnerabilities, (i) the CVSS content does not statistically influence the time
delays, which, however, (ii) are strongly affected by a decreasing annual
trend. In addition to these results, the paper contributes to the empirical
research tradition of software vulnerabilities by a couple of insights on
misuses of statistical methodology.
","[{'version': 'v1', 'created': 'Wed, 3 Jan 2018 09:47:34 GMT'}]",2018-01-12,"[['Ruohonen', 'Jukka', '']]","['software vulnerability', 'vulnerability severity', 'severity scoring', 'database maintenance', 'cyber security']"
4033,1806.03155,Joberto Martins,"Eliseu Oliveira (UNIFACS), Rafael Freitas, Joberto Martins (UNIFACS)","Evaluating CBR Similarity Functions for BAM Switching in Networks with
  Dynamic Traffic Profile",https://lrsm.ibisc.univ-evry.fr/Advance2017/,,10.5281/zenodo.1291127,,cs.NI cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In an increasingly complex scenario for network management, a solution that
allows configuration in more autonomous way with less intervention of the
network manager is expected. This paper presents an evaluation of similarity
functions that are necessary in the context of using a learning strategy for
finding solutions. The learning approach considered is based on Case-Based
Reasoning (CBR) and is applied to a network scenario where different Bandwidth
Allocation Models (BAMs) behaviors are used and must be eventually switched
looking for the best possible network operation. In this context, it is
required to identify and configure an adequate similarity function that will be
used in the learning process to recover similar solutions previously
considered. This paper introduces the similarity functions, explains the
relevant aspects of the learning process in which the similarity function plays
a role and, finally, presents a proof of concept for a specific similarity
function adopted. Results show that the similarity function was capable to get
similar results from the existing use case database. As such, the use of
similarity functions with CBR technique has proved to be potentially
satisfactory for supporting BAM switching decisions mostly driven by the
dynamics of input traffic profile.
","[{'version': 'v1', 'created': 'Fri, 8 Jun 2018 13:48:52 GMT'}]",2018-06-19,"[['Oliveira', 'Eliseu', '', 'UNIFACS'], ['Freitas', 'Rafael', '', 'UNIFACS'], ['Martins', 'Joberto', '', 'UNIFACS']]","['CBR -Case-Based Reasoning', 'Network Management', 'BAM – Bandwidth Allocation Models', 'MAM', 'RDM', 'AllocTC-Sharing']"
4034,1905.02758,Michael Teutsch,"Kevin Fritz, Daniel K\""onig, Ulrich Klauck, Michael Teutsch","Generalization ability of region proposal networks for multispectral
  person detection",,"SPIE Proceedings Volume 10988, Automatic Target Recognition XXIX;
  109880Y (2019)",10.1117/12.2520705,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multispectral person detection aims at automatically localizing humans in
images that consist of multiple spectral bands. Usually, the visual-optical
(VIS) and the thermal infrared (IR) spectra are combined to achieve higher
robustness for person detection especially in insufficiently illuminated
scenes. This paper focuses on analyzing existing detection approaches for their
generalization ability. Generalization is a key feature for machine learning
based detection algorithms that are supposed to perform well across different
datasets. Inspired by recent literature regarding person detection in the VIS
spectrum, we perform a cross-validation study to empirically determine the most
promising dataset to train a well-generalizing detector. Therefore, we pick one
reference Deep Convolutional Neural Network (DCNN) architecture and three
different multispectral datasets. The Region Proposal Network (RPN) originally
introduced for object detection within the popular Faster R-CNN is chosen as a
reference DCNN. The reason is that a stand-alone RPN is able to serve as a
competitive detector for two-class problems such as person detection.
Furthermore, current state-of-the-art approaches initially apply an RPN
followed by individual classifiers. The three considered datasets are the KAIST
Multispectral Pedestrian Benchmark including recently published improved
annotations for training and testing, the Tokyo Multi-spectral Semantic
Segmentation dataset, and the OSU Color-Thermal dataset including recently
released annotations. The experimental results show that the KAIST
Multispectral Pedestrian Benchmark with its improved annotations provides the
best basis to train a DCNN with good generalization ability compared to the
other two multispectral datasets. On average, this detection model achieves a
log-average Miss Rate (MR) of 29.74 % evaluated on the reasonable test subsets
of the three datasets.
","[{'version': 'v1', 'created': 'Tue, 7 May 2019 18:29:00 GMT'}]",2019-05-21,"[['Fritz', 'Kevin', ''], ['König', 'Daniel', ''], ['Klauck', 'Ulrich', ''], ['Teutsch', 'Michael', '']]","['Human Detection', 'Visual Surveillance', 'Multispectral Images', 'Deep Learning', 'DCNNs']"
4035,1812.07096,Christos Liaskos K.,"Christos Liaskos, Shuai Nie, Ageliki Tsioliaridou, Andreas
  Pitsillides, Sotiris Ioannidis, Ian Akyildiz","A Novel Communication Paradigm for High Capacity and Security via
  Programmable Indoor Wireless Environments in Next Generation Wireless Systems","This work was partially funded by the European Union via the Horizon
  2020: Future Emerging Topics call (FETOPEN), grant EU736876, project
  VISORSURF. admin note: significant overlap with arXiv:1805.06677",,10.1016/j.adhoc.2018.11.001,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless communication environments comprise passive objects that cause
performance degradation and eavesdropping concerns due to anomalous scattering.
This paper proposes a new paradigm, where scattering becomes software-defined
and, subsequently, optimizable across wide frequency ranges. Through the
proposed programmable wireless environments, the path loss, multi-path fading
and interference effects can be controlled and mitigated. Moreover, the
eavesdropping can be prevented via novel physical layer security capabilities.
The core technology of this new paradigm is the concept of metasurfaces, which
are planar intelligent structures whose effects on impinging electromagnetic
waves are fully defined by their micro-structure. Their control over impinging
waves has been demonstrated to span from 1 GHz to 10 THz. This paper
contributes the software-programmable wireless environment, consisting of
several HyperSurface tiles (programmable metasurfaces) controlled by a central
server. HyperSurfaces are a novel class of metasurfaces whose structure and,
hence, electromagnetic behavior can be altered and controlled via a software
interface. Multiple networked tiles coat indoor objects, allowing fine-grained,
customizable reflection, absorption or polarization overall. A central server
calculates and deploys the optimal electromagnetic interaction per tile, to the
benefit of communicating devices. Realistic simulations using full 3D
ray-tracing demonstrate the groundbreaking performance and security potential
of the proposed approach in 2.4 GHz and 60 GHz frequencies.
","[{'version': 'v1', 'created': 'Thu, 8 Nov 2018 14:30:10 GMT'}]",2018-12-19,"[['Liaskos', 'Christos', ''], ['Nie', 'Shuai', ''], ['Tsioliaridou', 'Ageliki', ''], ['Pitsillides', 'Andreas', ''], ['Ioannidis', 'Sotiris', ''], ['Akyildiz', 'Ian', '']]","['Wireless', 'performance', 'Physical Layer Security', 'ControlledPropagation', 'Metasurfaces', 'Intelligent Surfaces', 'Millimeter wave']"
4036,1108.1472,Lachhman Das Dhomeja,"Lachhman Das, Yasir Arfat, Azhar Shah, Khalil Khoumbati",System Support for Managing Invalid Bindings,,"Lachhman Das Dhomeja, Yasir Arfat Malkani, Azhar Ali Shah and
  Khalil Khoumbati, ""System Support For Managing Invalid Bindings"",
  International Journal of UbiComp (IJU), Vol.2, No.3, July 2011",10.5121/iju.2011.2303,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context-aware adaptation is a central aspect of pervasive computing
applications, enabling them to adapt and perform tasks based on contextual
information. One of the aspects of context-aware adaptation is reconfiguration
in which bindings are created between application component and remote services
in order to realize new behaviour in response to contextual information.
Various research efforts provide reconfiguration support and allow the
development of adaptive context-aware applications from high-level
specifications, but don't consider failure conditions that might arise during
execution of such applications, making bindings between application and remote
services invalid. To this end, we propose and implement our design approach to
reconfiguration to manage invalid bindings. The development and modification of
adaptive context-aware applications is a complex task, and an issue of an
invalidity of bindings further complicates development efforts. To reduce the
development efforts, our approach provides an application-transparent solution
where the issue of the invalidity of bindings is handled by our system,
Policy-Based Contextual Reconfiguration and Adaptation (PCRA), not by an
application developer. In this paper, we present and describe our approach to
managing invalid bindings and compare it with other approaches to this problem.
We also provide performance evaluation of our approach.
","[{'version': 'v1', 'created': 'Sat, 6 Aug 2011 09:34:01 GMT'}]",2011-08-09,"[['Das', 'Lachhman', ''], ['Arfat', 'Yasir', ''], ['Shah', 'Azhar', ''], ['Khoumbati', 'Khalil', '']]","['Reconfiguration', 'Virtual Stub', 'context-aware adaptation', 'Invalid Bindings']"
4037,0903.3114,Karsten Held,"Karsten Held, Elena Rota Kops, Bernd J. Krause, William M. Wells III,
  Ron Kikinis, Hans-Wilhelm Mueller-Gaertner",Markov Random Field Segmentation of Brain MR Images,"34 pages, 10 figures; the paper (published in 1997) has introduced
  the concept of Markov random field to the segmentation of medical MR images.
  For the published version see http://dx.doi.org/10.1109/42.650883","IEEE Trans. Med. Imag. vol. 16, p. 878 (1997)",10.1109/42.650883,,cs.CV cond-mat.stat-mech physics.data-an physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a fully-automatic 3D-segmentation technique for brain MR images.
Using Markov random fields the segmentation algorithm captures three important
MR features, i.e. non-parametric distributions of tissue intensities,
neighborhood correlations and signal inhomogeneities. Detailed simulations and
real MR images demonstrate the performance of the segmentation algorithm. The
impact of noise, inhomogeneity, smoothing and structure thickness is analyzed
quantitatively. Even single echo MR images are well classified into gray
matter, white matter, cerebrospinal fluid, scalp-bone and background. A
simulated annealing and an iterated conditional modes implementation are
presented.
  Keywords: Magnetic Resonance Imaging, Segmentation, Markov Random Fields
","[{'version': 'v1', 'created': 'Wed, 18 Mar 2009 09:38:29 GMT'}]",2009-03-20,"[['Held', 'Karsten', ''], ['Kops', 'Elena Rota', ''], ['Krause', 'Bernd J.', ''], ['Wells', 'William M.', 'III'], ['Kikinis', 'Ron', ''], ['Mueller-Gaertner', 'Hans-Wilhelm', '']]","['Magnetic Resonance Imaging', 'Segmentation', 'Markov Random Fields']"
4038,1911.11395,Raiyan Abdul Baten,"Raiyan Abdul Baten, Daryl Bagley, Ashely Tenesaca, Famous Clark, James
  P. Bagrow, Gourab Ghoshal, Mohammed Ehsan Hoque","Creativity in temporal social networks: How divergent thinking is
  impacted by one's choice of peers",,"J. R. Soc. Interface, 17: 20200667, 2020",10.1098/rsif.2020.0667,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Creativity is viewed as one of the most important skills in the context of
future-of-work. In this paper, we explore how the dynamic (self-organizing)
nature of social networks impacts the fostering of creative ideas. We run 6
trials (N=288) of a web-based experiment involving divergent ideation tasks. We
find that network connections gradually adapt to individual creative
performances, as the participants predominantly seek to follow high-performing
peers for creative inspirations. We unearth both opportunities and bottlenecks
afforded by such self-organization. While exposure to high-performing peers is
associated with better creative performances of the followers, we see a
counter-effect that choosing to follow the same peers introduces semantic
similarities in the followers' ideas. We formulate an agent-based simulation
model to capture these intuitions in a tractable manner, and experiment with
corner cases of various simulation parameters to assess the generality of the
findings. Our findings may help design large-scale interventions to improve the
creative aptitude of people interacting in a social network.
","[{'version': 'v1', 'created': 'Tue, 26 Nov 2019 08:27:05 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Oct 2020 19:01:01 GMT'}, {'version': 'v3', 'created': 'Mon, 7 Dec 2020 19:49:48 GMT'}]",2020-12-09,"[['Baten', 'Raiyan Abdul', ''], ['Bagley', 'Daryl', ''], ['Tenesaca', 'Ashely', ''], ['Clark', 'Famous', ''], ['Bagrow', 'James P.', ''], ['Ghoshal', 'Gourab', ''], ['Hoque', 'Mohammed Ehsan', '']]","['Network science', 'creativity', 'dynamic social networks']"
4039,1611.00812,Jiemin Chen,"Jianguo Li, Yong Tang and Jiemin Chen","Leveraging tagging and rating for recommendation: RMF meets weighted
  diffusion on tripartite graphs",,,10.1016/j.physa.2017.04.121,,cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender systems (RSs) have been a widely exploited approach to solving
the information overload problem. However, the performance is still limited due
to the extreme sparsity of the rating data. With the popularity of Web 2.0, the
social tagging system provides more external information to improve
recommendation accuracy. Although some existing approaches combine the matrix
factorization models with co-occurrence properties and context of tags, they
neglect the issue of tag sparsity without the commonly associated tags problem
that would also result in inaccurate recommendations. Consequently, in this
paper, we propose a novel hybrid collaborative filtering model named
WUDiff_RMF, which improves Regularized Matrix Factorization (RMF) model by
integrating Weighted User-Diffusion-based CF algorithm(WUDiff) that obtains the
information of similar users from the weighted tripartite user-item-tag graph.
This model aims to capture the degree correlation of the user-item-tag
tripartite network to enhance the performance of recommendation. Experiments
conducted on four real-world datasets demonstrate that our approach
significantly performs better than already widely used methods in the accuracy
of recommendation. Moreover, results show that WUDiff_RMF can alleviate the
data sparsity, especially in the circumstance that users have made few ratings
and few tags.
","[{'version': 'v1', 'created': 'Tue, 1 Nov 2016 02:59:04 GMT'}]",2017-05-24,"[['Li', 'Jianguo', ''], ['Tang', 'Yong', ''], ['Chen', 'Jiemin', '']]","['Regularized matrix factorization', 'Collaborative filtering', 'Tag', 'Diffusion', 'Tripartite graphs']"
4040,1407.5093,Michael Horton,"Michael Horton, Joachim Gudmundsson, Sanjay Chawla, Jo\""el Estephan",Classification of Passes in Football Matches using Spatiotemporal Data,10 pages,,10.1145/3105576,,cs.LG cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A knowledgeable observer of a game of football (soccer) can make a subjective
evaluation of the quality of passes made between players during the game. We
investigate the problem of producing an automated system to make the same
evaluation of passes. We present a model that constructs numerical predictor
variables from spatiotemporal match data using feature functions based on
methods from computational geometry, and then learns a classification function
from labelled examples of the predictor variables. Furthermore, the learned
classifiers are analysed to determine if there is a relationship between the
complexity of the algorithm that computed the predictor variable and the
importance of the variable to the classifier. Experimental results show that we
are able to produce a classifier with 85.8% accuracy on classifying passes as
Good, OK or Bad, and that the predictor variables computed using complex
methods from computational geometry are of moderate importance to the learned
classifiers. Finally, we show that the inter-rater agreement on pass
classification between the machine classifier and a human observer is of
similar magnitude to the agreement between two observers.
","[{'version': 'v1', 'created': 'Fri, 18 Jul 2014 06:42:35 GMT'}]",2017-08-22,"[['Horton', 'Michael', ''], ['Gudmundsson', 'Joachim', ''], ['Chawla', 'Sanjay', ''], ['Estephan', 'Joël', '']]","['sports analysis', 'football', 'soccer', 'movement analysis', 'classification', 'machine learning']"
4041,1709.05874,Fernando Almeida Dr.,"Jose Ferreira, Fernando Almeida, Jose Monteiro",Building an Effective Data Warehousing for Financial Sector,10 pages,"Automatic Control and Information Sciences, 3(1), 2017",10.12691/acis-3-1-4,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents the implementation process of a Data Warehouse and a
multidimensional analysis of business data for a holding company in the
financial sector. The goal is to create a business intelligence system that, in
a simple, quick but also versatile way, allows the access to updated,
aggregated, real and/or projected information, regarding bank account balances.
The established system extracts and processes the operational database
information which supports cash management information by using Integration
Services and Analysis Services tools from Microsoft SQL Server. The end-user
interface is a pivot table, properly arranged to explore the information
available by the produced cube. The results have shown that the adoption of
online analytical processing cubes offers better performance and provides a
more automated and robust process to analyze current and provisional aggregated
financial data balances compared to the current process based on static reports
built from transactional databases.
","[{'version': 'v1', 'created': 'Mon, 18 Sep 2017 11:50:28 GMT'}]",2017-09-19,"[['Ferreira', 'Jose', ''], ['Almeida', 'Fernando', ''], ['Monteiro', 'Jose', '']]","['data warehouse', 'OLAP cube', 'data analysis', 'information system', 'business intelligence', 'pivot tables']"
4042,1604.01175,Guilherme D. da Fonseca,"Sunil Arya, Guilherme D. da Fonseca, David M. Mount",On the Combinatorial Complexity of Approximating Polytopes,"In Proceedings of the 32nd International Symposium Computational
  Geometry (SoCG 2016) and accepted to SoCG 2016 special issue of Discrete and
  Computational Geometry","Discrete & Computational Geometry, Volume 58, Issue 4, pp 849-870,
  2017",10.1007/s00454-016-9856-5,,cs.CG math.MG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Approximating convex bodies succinctly by convex polytopes is a fundamental
problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$
is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an
error parameter $\varepsilon > 0$, the objective is to determine a polytope of
minimum combinatorial complexity whose Hausdorff distance from $K$ is at most
$\varepsilon \cdot \mathrm{diam}(K)$. By combinatorial complexity we mean the
total number of faces of all dimensions of the polytope. A well-known result by
Dudley implies that $O(1/\varepsilon^{(d-1)/2})$ facets suffice, and a dual
result by Bronshteyn and Ivanov similarly bounds the number of vertices, but
neither result bounds the total combinatorial complexity. We show that there
exists an approximating polytope whose total combinatorial complexity is
$\tilde{O}(1/\varepsilon^{(d-1)/2})$, where $\tilde{O}$ conceals a
polylogarithmic factor in $1/\varepsilon$. This is a significant improvement
upon the best known bound, which is roughly $O(1/\varepsilon^{d-2})$.
  Our result is based on a novel combination of both old and new ideas. First,
we employ Macbeath regions, a classical structure from the theory of convexity.
The construction of our approximating polytope employs a new stratified
placement of these regions. Second, in order to analyze the combinatorial
complexity of the approximating polytope, we present a tight analysis of a
width-based variant of B\'{a}r\'{a}ny and Larman's economical cap covering.
Finally, we use a deterministic adaptation of the witness-collector technique
(developed recently by Devillers et al.) in the context of our stratified
construction.
","[{'version': 'v1', 'created': 'Tue, 5 Apr 2016 08:45:11 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Jul 2016 12:08:59 GMT'}, {'version': 'v3', 'created': 'Sat, 3 Dec 2016 19:13:41 GMT'}, {'version': 'v4', 'created': 'Wed, 21 Dec 2016 15:36:10 GMT'}]",2018-01-11,"[['Arya', 'Sunil', ''], ['da Fonseca', 'Guilherme D.', ''], ['Mount', 'David M.', '']]","['Convex polytopes', 'polytope approximation', 'combinatorial complexity', 'Macbeath regions']"
4043,1509.08973,Tadahiro Taniguchi,"Tadahiro Taniguchi, Takayuki Nagai, Tomoaki Nakamura, Naoto Iwahashi,
  Tetsuya Ogata, and Hideki Asoh",Symbol Emergence in Robotics: A Survey,submitted to Advanced Robotics,"Advanced Robotics, 30:11-12, 706-728, 2016",10.1080/01691864.2016.1164622,,cs.AI cs.CL cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Humans can learn the use of language through physical interaction with their
environment and semiotic communication with other people. It is very important
to obtain a computational understanding of how humans can form a symbol system
and obtain semiotic skills through their autonomous mental development.
Recently, many studies have been conducted on the construction of robotic
systems and machine-learning methods that can learn the use of language through
embodied multimodal interaction with their environment and other systems.
Understanding human social interactions and developing a robot that can
smoothly communicate with human users in the long term, requires an
understanding of the dynamics of symbol systems and is crucially important. The
embodied cognition and social interaction of participants gradually change a
symbol system in a constructive manner. In this paper, we introduce a field of
research called symbol emergence in robotics (SER). SER is a constructive
approach towards an emergent symbol system. The emergent symbol system is
socially self-organized through both semiotic communications and physical
interactions with autonomous cognitive developmental agents, i.e., humans and
developmental robots. Specifically, we describe some state-of-art research
topics concerning SER, e.g., multimodal categorization, word discovery, and a
double articulation analysis, that enable a robot to obtain words and their
embodied meanings from raw sensory--motor information, including visual
information, haptic information, auditory information, and acoustic speech
signals, in a totally unsupervised manner. Finally, we suggest future
directions of research in SER.
","[{'version': 'v1', 'created': 'Tue, 29 Sep 2015 23:16:48 GMT'}]",2023-01-18,"[['Taniguchi', 'Tadahiro', ''], ['Nagai', 'Takayuki', ''], ['Nakamura', 'Tomoaki', ''], ['Iwahashi', 'Naoto', ''], ['Ogata', 'Tetsuya', ''], ['Asoh', 'Hideki', '']]","['Developmental robotics', 'language acquisition', 'semiotics', 'symbol emergence', 'symbolgrounding']"
4044,1512.03169,D\'avid Szab\'o,"D\'avid Szab\'o, Attila K\H{o}r\""osi, J\'ozsef B\'ir\'o, Andr\'as
  Guly\'as",Deductive Way of Reasoning about the Internet AS Level Topology,,"Chin. Phys. B . 2015, 24(11): 118901",10.1088/1674-1056/24/11/118901,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our current understanding about the AS level topology of the Internet is
based on measurements and inductive-type models which set up rules describing
the behavior (node and edge dynamics) of the individual ASes and generalize the
consequences of these individual actions for the complete AS ecosystem using
induction. In this paper we suggest a third, deductive approach in which we
have premises for the whole AS system and the consequences of these premises
are determined through deductive reasoning. We show that such a deductive
approach can give complementary insights into the topological properties of the
AS graph. While inductive models can mostly reflect high level statistics (e.g.
degree distribution, clustering, diameter), deductive reasoning can identify
omnipresent subgraphs and peering likelihood. We also propose a model, called
YEAS, incorporating our deductive analytical findings that produces topologies
contain both traditional and novel metrics for the AS level Internet.
","[{'version': 'v1', 'created': 'Thu, 10 Dec 2015 08:30:35 GMT'}]",2015-12-11,"[['Szabó', 'Dávid', ''], ['Kőrösi', 'Attila', ''], ['Bíró', 'József', ''], ['Gulyás', 'András', '']]","['Internet topology', 'Complex network analysis', 'Model']"
4045,2105.07190,Gesina Schwalbe,"Gesina Schwalbe, Bettina Finzel","A Comprehensive Taxonomy for Explainable Artificial Intelligence: A
  Systematic Survey of Surveys on Methods and Concepts","71 pages, 7 figures, 6 tables; published as part of Special Issue on
  Explainable and Interpretable Machine Learning and Data Mining, in Data
  Mining and Knowledge Discovery Journal",Data Min Knowl Disc 37 (2023) 1-59,10.1007/s10618-022-00867-8,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  In the meantime, a wide variety of terminologies, motivations, approaches,
and evaluation criteria have been developed within the research field of
explainable artificial intelligence (XAI). With the amount of XAI methods
vastly growing, a taxonomy of methods is needed by researchers as well as
practitioners: To grasp the breadth of the topic, compare methods, and to
select the right XAI method based on traits required by a specific use-case
context. Many taxonomies for XAI methods of varying level of detail and depth
can be found in the literature. While they often have a different focus, they
also exhibit many points of overlap. This paper unifies these efforts and
provides a complete taxonomy of XAI methods with respect to notions present in
the current state of research. In a structured literature analysis and
meta-study, we identified and reviewed more than 50 of the most cited and
current surveys on XAI methods, metrics, and method traits. After summarizing
them in a survey of surveys, we merge terminologies and concepts of the
articles into a unified structured taxonomy. Single concepts therein are
illustrated by more than 50 diverse selected example methods in total, which we
categorize accordingly. The taxonomy may serve both beginners, researchers, and
practitioners as a reference and wide-ranging overview of XAI method traits and
aspects. Hence, it provides foundations for targeted, use-case-oriented, and
context-sensitive future research.
","[{'version': 'v1', 'created': 'Sat, 15 May 2021 09:52:00 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Dec 2021 15:31:26 GMT'}, {'version': 'v3', 'created': 'Tue, 17 May 2022 13:58:08 GMT'}, {'version': 'v4', 'created': 'Mon, 9 Jan 2023 07:50:38 GMT'}]",2023-01-10,"[['Schwalbe', 'Gesina', ''], ['Finzel', 'Bettina', '']]","['Explainable Artificial Intelligence', 'Interpretability', 'Taxonomy', 'Meta-Analysis', 'Survey-of-surveys', 'Review']"
4046,1902.06421,Mohammad Saidur Rahman,"Mohammad Saidur Rahman, Payap Sirinam, Nate Mathews, Kantha Girish
  Gangadhara, Matthew Wright",Tik-Tok: The Utility of Packet Timing in Website Fingerprinting Attacks,"Accepted in Privacy Enhancing Technologies Symposium (PETS) 2020.
  Code for reproducing the results are available in
  https://github.com/msrocean/Tik_Tok/",Privacy Enhancing Technologies Symposium (PETS) 2020,10.2478/popets-2020-0043,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A passive local eavesdropper can leverage Website Fingerprinting (WF) to
deanonymize the web browsing activity of Tor users. The value of timing
information to WF has often been discounted in recent works due to the
volatility of low-level timing information. In this paper, we more carefully
examine the extent to which packet timing can be used to facilitate WF attacks.
We first propose a new set of timing-related features based on burst-level
characteristics to further identify more ways that timing patterns could be
used by classifiers to identify sites. Then we evaluate the effectiveness of
both raw timing and directional timing which is a combination of raw timing and
direction in a deep-learning-based WF attack. Our closed-world evaluation shows
that directional timing performs best in most of the settings we explored,
achieving: (i) 98.4% in undefended Tor traffic; (ii) 93.5% on WTF-PAD traffic,
several points higher than when only directional information is used; and (iii)
64.7% against onion sites, 12% higher than using only direction. Further
evaluations in the open-world setting show small increases in both precision
(+2%) and recall (+6%) with directional-timing on WTF-PAD traffic. To further
investigate the value of timing information, we perform an information leakage
analysis on our proposed handcrafted features. Our results show that while
timing features leak less information than directional features, the
information contained in each feature is mutually exclusive to one another and
can thus improve the robustness of a classifier.
","[{'version': 'v1', 'created': 'Mon, 18 Feb 2019 06:45:58 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Jun 2019 03:42:47 GMT'}, {'version': 'v3', 'created': 'Mon, 16 Dec 2019 05:31:00 GMT'}, {'version': 'v4', 'created': 'Mon, 16 Mar 2020 18:24:47 GMT'}]",2020-10-12,"[['Rahman', 'Mohammad Saidur', ''], ['Sirinam', 'Payap', ''], ['Mathews', 'Nate', ''], ['Gangadhara', 'Kantha Girish', ''], ['Wright', 'Matthew', '']]","['Anonymity Systems', 'Attack', 'Website Fingerprinting', 'Privacy', 'Tor;']"
4047,2201.09953,Raffi Khatchadourian,"Tatiana Castro V\'elez, Raffi Khatchadourian, Mehdi Bagherzadeh, Anita
  Raja","Challenges in Migrating Imperative Deep Learning Programs to Graph
  Execution: An Empirical Study","International Conference on Mining Software Repositories, MSR 2022.
  ACM/IEEE, ACM, May 2022","ACM/IEEE International Conference on Mining Software Repositories,
  May 2022",10.1145/3524842.3528455,,cs.SE cs.LG cs.PL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Efficiency is essential to support responsiveness w.r.t. ever-growing
datasets, especially for Deep Learning (DL) systems. DL frameworks have
traditionally embraced deferred execution-style DL code that supports symbolic,
graph-based Deep Neural Network (DNN) computation. While scalable, such
development tends to produce DL code that is error-prone, non-intuitive, and
difficult to debug. Consequently, more natural, less error-prone imperative DL
frameworks encouraging eager execution have emerged but at the expense of
run-time performance. While hybrid approaches aim for the ""best of both
worlds,"" the challenges in applying them in the real world are largely unknown.
We conduct a data-driven analysis of challenges -- and resultant bugs --
involved in writing reliable yet performant imperative DL code by studying 250
open-source projects, consisting of 19.7 MLOC, along with 470 and 446 manually
examined code patches and bug reports, respectively. The results indicate that
hybridization: (i) is prone to API misuse, (ii) can result in performance
degradation -- the opposite of its intention, and (iii) has limited application
due to execution mode incompatibility. We put forth several recommendations,
best practices, and anti-patterns for effectively hybridizing imperative DL
code, potentially benefiting DL practitioners, API designers, tool developers,
and educators.
","[{'version': 'v1', 'created': 'Mon, 24 Jan 2022 21:12:38 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Feb 2022 23:11:57 GMT'}, {'version': 'v3', 'created': 'Tue, 5 Apr 2022 22:33:41 GMT'}]",2022-07-20,"[['Vélez', 'Tatiana Castro', ''], ['Khatchadourian', 'Raffi', ''], ['Bagherzadeh', 'Mehdi', ''], ['Raja', 'Anita', '']]","['empirical studies', 'deep learning', 'imperative programs', 'hybrid programming paradigms', 'graph-based execution', 'software evolution']"
4048,1806.03156,Joberto Martins,"Maxli Campos (UNIFACS), Joberto Martins (UNIFACS)","A SDN-based Flexible System for On-the-Fly Monitoring and Treatment of
  Security Events",https://lrsm.ibisc.univ-evry.fr/Advance2017/,,10.5281/zenodo.1291094,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Software Defined Networking (SDN) paradigm decouples control and data
planes, offering high programmability and a global view of the network.
However, it is a challenge not only provide security in these next generation
networks as well as allow that network attacks could be subjected to an
incident and forensic treatment procedure. This paper proposes the
implementation of flexible mechanisms of monitoring and treatment of security
events categorized per type of attack and associated with whitelist and
blacklist resources by means of the SDN controller programmability. The
resources to perform intrusion and attack analysis are validated by means of a
real SDN/OpenFlow testbed.
","[{'version': 'v1', 'created': 'Fri, 8 Jun 2018 13:49:24 GMT'}]",2018-06-18,"[['Campos', 'Maxli', '', 'UNIFACS'], ['Martins', 'Joberto', '', 'UNIFACS']]","['OpenFlow', 'SDN', 'Threats', 'Incident Response']"
4049,1802.08157,Abele Simona,"Abele Simona, Luca Bonaventura, Thomas Pugnat, Barbara Dalena","High order time integrators for the simulation of charged particle
  motion in magnetic quadrupoles","39 pages, 18 figures",,10.1016/j.cpc.2019.01.018,,cs.CE cs.NA physics.acc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Magnetic quadrupoles are essential components of particle accelerators like
the Large Hadron Collider. In order to study numerically the stability of the
particle beam crossing a quadrupole, a large number of particle revolutions in
the accelerator must be simulated, thus leading to the necessity to preserve
numerically invariants of motion over a long time interval and to a substantial
computational cost, mostly related to the repeated evaluation of the magnetic
vector potential. In this paper, in order to reduce this cost, we first
consider a specific gauge transformation that allows to reduce significantly
the number of vector potential evaluations. We then analyze the sensitivity of
the numerical solution to the interpolation procedure required to compute
magnetic vector potential data from gridded precomputed values at the locations
required by high order time integration methods. Finally, we compare several
high order integration techniques, in order to assess their accuracy and
efficiency for these long term simulations. Explicit high order Lie methods are
considered, along with implicit high order symplectic integrators and
conventional explicit Runge Kutta methods. Among symplectic methods, high order
Lie integrators yield optimal results in terms of cost/accuracy ratios, but non
symplectic Runge Kutta methods perform remarkably well even in very long term
simulations. Furthermore, the accuracy of the field reconstruction and
interpolation techniques are shown to be limiting factors for the accuracy of
the particle tracking procedures.
","[{'version': 'v1', 'created': 'Thu, 22 Feb 2018 16:47:22 GMT'}]",2019-06-26,"[['Simona', 'Abele', ''], ['Bonaventura', 'Luca', ''], ['Pugnat', 'Thomas', ''], ['Dalena', 'Barbara', '']]","['Magnetic fields', 'Particle accelerators', 'Hamilton equations', 'Symplectic methods', 'High order ODE methods']"
4050,1705.04133,Roland Schmehl,"Rolf van der Vlugt, Anna Bley, Michael Noom, Roland Schmehl",Quasi-Steady Model of a Pumping Kite Power System,,"Renewable Energy, 2019",10.1016/j.renene.2018.07.023,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The traction force of a kite can be used to drive a cyclic motion for
extracting wind energy from the atmosphere. This paper presents a novel
quasi-steady modelling framework for predicting the power generated over a full
pumping cycle. The cycle is divided into traction, retraction and transition
phases, each described by an individual set of analytic equations. The effect
of gravity on the airborne system components is included in the framework. A
trade-off is made between modelling accuracy and computation speed such that
the model is specifically useful for system optimisation and scaling in
economic feasibility studies. Simulation results are compared to experimental
measurements of a 20 kW kite power system operated up to a tether length of 720
m. Simulation and experiment agree reasonably well, both for moderate and for
strong wind conditions, indicating that the effect of gravity has to be taken
into account for a predictive performance simulation.
","[{'version': 'v1', 'created': 'Wed, 10 May 2017 10:19:51 GMT'}, {'version': 'v2', 'created': 'Wed, 9 May 2018 12:43:58 GMT'}]",2018-08-24,"[['van der Vlugt', 'Rolf', ''], ['Bley', 'Anna', ''], ['Noom', 'Michael', ''], ['Schmehl', 'Roland', '']]","['Airborne Wind Energy', 'Kite Power', 'Pumping Cycle', 'Traction Power Generation']"
4051,2102.06560,Ming-Chang Lee,"Ming-Chang Lee, Jia-Chun Lin, and Ernst Gunnar Gran","How Far Should We Look Back to Achieve Effective Real-Time Time-Series
  Anomaly Detection?","12 pages, 5 figures, and 9 tables, Proceedings of the 35th
  International Conference on Advanced Information Network-ing and Applications
  (AINA 2021)",,10.1007/978-3-030-75100-5_13,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Anomaly detection is the process of identifying unexpected events or
ab-normalities in data, and it has been applied in many different areas such as
system monitoring, fraud detection, healthcare, intrusion detection, etc.
Providing real-time, lightweight, and proactive anomaly detection for time
series with neither human intervention nor domain knowledge could be highly
valuable since it reduces human effort and enables appropriate countermeasures
to be undertaken before a disastrous event occurs. To our knowledge, RePAD
(Real-time Proactive Anomaly Detection algorithm) is a generic approach with
all above-mentioned features. To achieve real-time and lightweight detection,
RePAD utilizes Long Short-Term Memory (LSTM) to detect whether or not each
upcoming data point is anomalous based on short-term historical data points.
However, it is unclear that how different amounts of historical data points
affect the performance of RePAD. Therefore, in this paper, we investigate the
impact of different amounts of historical data on RePAD by introducing a set of
performance metrics that cover novel detection accuracy measures, time
efficiency, readiness, and resource consumption, etc. Empirical experiments
based on real-world time series datasets are conducted to evaluate RePAD in
different scenarios, and the experimental results are presented and discussed.
","[{'version': 'v1', 'created': 'Fri, 12 Feb 2021 14:51:05 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Oct 2021 13:01:39 GMT'}, {'version': 'v3', 'created': 'Sun, 25 Sep 2022 15:25:00 GMT'}, {'version': 'v4', 'created': 'Sun, 4 Dec 2022 23:08:34 GMT'}, {'version': 'v5', 'created': 'Fri, 30 Dec 2022 18:50:36 GMT'}, {'version': 'v6', 'created': 'Mon, 9 Jan 2023 23:33:00 GMT'}]",2023-01-11,"[['Lee', 'Ming-Chang', ''], ['Lin', 'Jia-Chun', ''], ['Gran', 'Ernst Gunnar', '']]","['anomaly detection', 'time series', 'unsupervised learning', 'machine learning', 'LSTM', 'Look-Back', 'Predict-Forward strategy']"
4052,1701.02490,Han Cai,"Han Cai, Kan Ren, Weinan Zhang, Kleanthis Malialis, Jun Wang, Yong Yu,
  Defeng Guo",Real-Time Bidding by Reinforcement Learning in Display Advertising,WSDM 2017,,10.1145/3018661.3018702,,cs.LG cs.AI cs.GT,http://creativecommons.org/licenses/by/4.0/,"  The majority of online display ads are served through real-time bidding (RTB)
--- each ad display impression is auctioned off in real-time when it is just
being generated from a user visit. To place an ad automatically and optimally,
it is critical for advertisers to devise a learning algorithm to cleverly bid
an ad impression in real-time. Most previous works consider the bid decision as
a static optimization problem of either treating the value of each impression
independently or setting a bid price to each segment of ad volume. However, the
bidding for a given ad campaign would repeatedly happen during its life span
before the budget runs out. As such, each bid is strategically correlated by
the constrained budget and the overall effectiveness of the campaign (e.g., the
rewards from generated clicks), which is only observed after the campaign has
completed. Thus, it is of great interest to devise an optimal bidding strategy
sequentially so that the campaign budget can be dynamically allocated across
all the available impressions on the basis of both the immediate and future
rewards. In this paper, we formulate the bid decision process as a
reinforcement learning problem, where the state space is represented by the
auction information and the campaign's real-time parameters, while an action is
the bid price to set. By modeling the state transition via auction competition,
we build a Markov Decision Process framework for learning the optimal bidding
policy to optimize the advertising performance in the dynamic real-time bidding
environment. Furthermore, the scalability problem from the large real-world
auction volume and campaign budget is well handled by state value approximation
using neural networks.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2017 09:30:29 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Jan 2017 01:37:39 GMT'}]",2017-01-13,"[['Cai', 'Han', ''], ['Ren', 'Kan', ''], ['Zhang', 'Weinan', ''], ['Malialis', 'Kleanthis', ''], ['Wang', 'Jun', ''], ['Yu', 'Yong', ''], ['Guo', 'Defeng', '']]","['Bid Optimization', 'Reinforcement Learning', 'Display Ads']"
4053,1808.03209,Piotr Jurkiewicz,"Piotr Jurkiewicz, Robert W\'ojcik, Jerzy Dom\.za{\l}, Andrzej
  Kamisi\'nski",Testing Implementation of FAMTAR: Adaptive Multipath Routing,,Computer Communications 149 (2020) 300-311,10.1016/j.comcom.2019.10.029,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Flow-Aware Multi-Topology Adaptive Routing (FAMTAR) is a new approach to
multipath and adaptive routing in IP networks which enables automatic use of
alternative paths when the primary one becomes congested. It provides more
efficient network resource utilization and higher quality of transmission
compared to standard IP routing. However, thus far it has only been evaluated
through simulations. In this paper we share our experiences from building a
real-time FAMTAR router and present results of its tests in a physical network.
The results are in line with those obtained previously through simulations and
they open the way to implementation of a production grade FAMTAR router.
","[{'version': 'v1', 'created': 'Thu, 9 Aug 2018 15:52:38 GMT'}, {'version': 'v2', 'created': 'Sat, 2 Mar 2019 16:16:58 GMT'}, {'version': 'v3', 'created': 'Fri, 1 Nov 2019 18:25:00 GMT'}]",2019-11-05,"[['Jurkiewicz', 'Piotr', ''], ['Wójcik', 'Robert', ''], ['Domżał', 'Jerzy', ''], ['Kamisiński', 'Andrzej', '']]","['router', 'multipath routing', 'adaptive routing', 'SDN', 'traffic engineering', 'Click Modular Router', 'testing']"
4054,2105.04272,Nicholas Kolokotronis,"Gueltoum Bendiab, Konstantinos-Panagiotis Grammatikakis, Ioannis
  Koufos, Nicholas Kolokotronis, and Stavros Shiaeles",Advanced Metering Infrastructures: Security Risks and Mitigation,,"15th International Conference on Availability, Reliability and
  Security (ARES 2020)",10.1145/3407023.3409312,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Energy providers are moving to the smart meter era, encouraging consumers to
install, free of charge, these devices in their homes, automating consumption
readings submission and making consumers life easier. However, the increased
deployment of such smart devices brings a lot of security and privacy risks. In
order to overcome such risks, Intrusion Detection Systems are presented as
pertinent tools that can provide network-level protection for smart devices
deployed in home environments. In this context, this paper is exploring the
problems of Advanced Metering Infrastructures (AMI) and proposing a novel
Machine Learning (ML) Intrusion Prevention System (IPS) to get optimal
decisions based on a variety of factors and graphical security models able to
tackle zero-day attacks.
","[{'version': 'v1', 'created': 'Mon, 10 May 2021 11:16:58 GMT'}]",2021-05-11,"[['Bendiab', 'Gueltoum', ''], ['Grammatikakis', 'Konstantinos-Panagiotis', ''], ['Koufos', 'Ioannis', ''], ['Kolokotronis', 'Nicholas', ''], ['Shiaeles', 'Stavros', '']]","['Cyber-security', 'power grid', 'intrusion detection', 'malware detection', 'attack mitigation', 'graphical security models']"
4055,2105.11427,Yunke Zhang,"Yunke Zhang, Chi Wang, Miaomiao Cui, Peiran Ren, Xuansong Xie,
  Xian-sheng Hua, Hujun Bao, Qixing Huang, Weiwei Xu",Attention-guided Temporally Coherent Video Object Matting,"10 pages, 6 figures, MM '21 camera-ready",,10.1145/3474085.3475623,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a novel deep learning-based video object matting method
that can achieve temporally coherent matting results. Its key component is an
attention-based temporal aggregation module that maximizes image matting
networks' strength for video matting networks. This module computes temporal
correlations for pixels adjacent to each other along the time axis in feature
space, which is robust against motion noises. We also design a novel loss term
to train the attention weights, which drastically boosts the video matting
performance. Besides, we show how to effectively solve the trimap generation
problem by fine-tuning a state-of-the-art video object segmentation network
with a sparse set of user-annotated keyframes. To facilitate video matting and
trimap generation networks' training, we construct a large-scale video matting
dataset with 80 training and 28 validation foreground video clips with
ground-truth alpha mattes. Experimental results show that our method can
generate high-quality alpha mattes for various videos featuring appearance
change, occlusion, and fast motion. Our code and dataset can be found at:
https://github.com/yunkezhang/TCVOM
","[{'version': 'v1', 'created': 'Mon, 24 May 2021 17:34:57 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Jul 2021 10:17:08 GMT'}, {'version': 'v3', 'created': 'Thu, 29 Jul 2021 16:12:46 GMT'}]",2021-07-30,"[['Zhang', 'Yunke', ''], ['Wang', 'Chi', ''], ['Cui', 'Miaomiao', ''], ['Ren', 'Peiran', ''], ['Xie', 'Xuansong', ''], ['Hua', 'Xian-sheng', ''], ['Bao', 'Hujun', ''], ['Huang', 'Qixing', ''], ['Xu', 'Weiwei', '']]","['datasets', 'neural networks', 'video matting', 'attention mechanism']"
4056,2102.05656,Reza Fotohi,Hossein Pakdel and Reza Fotohi,"A firefly algorithm for power management in wireless sensor networks
  (WSNs)","7 Figures, 1 Table, J Supercomput (2021)",,10.1007/s11227-021-03639-1,,cs.NI cs.CR,http://creativecommons.org/licenses/by/4.0/,"  In wireless sensor networks (WSNs), designing a stable, low-power routing
protocol is a major challenge because successive changes in links or breakdowns
destabilize the network topology. Therefore, choosing the right route in this
type of network due to resource constraints and their operating environment is
one of the most important challenges in these networks. Therefore, the main
purpose of these networks is to collect appropriate routing information about
the environment around the network sensors while observing the energy
consumption of the sensors. One of the important approaches to reduce energy
consumption in sensor networks is the use of the clustering technique, but in
most clustering methods, only the criterion of the amount of energy of the
cluster or the distance of members to the cluster has been considered.
Therefore, in this paper, a method is presented using the firefly algorithm and
using the four criteria of residual energy, noise rate, number of hops, and
distance. The proposed method called EM-FIREFLY is introduced which selects the
best cluster head with high attractiveness and based on the fitness function
and transfers the data packets through these cluster head to the sink. The
proposed method is evaluated with NS-2 simulator and compared with the
algorithm-PSO and optimal clustering methods. The evaluation results show the
efficiency of the EM-FIREFLY method in maximum relative load and network
lifetime criteria compared to other methods discussed in this article.
","[{'version': 'v1', 'created': 'Wed, 10 Feb 2021 18:37:55 GMT'}]",2021-02-12,"[['Pakdel', 'Hossein', ''], ['Fotohi', 'Reza', '']]","['Wireless Sensor Networks (WSNs)', 'Power Management', 'Network Lifetime']"
4057,1806.02957,Mohammad Amin Nabian,"Mohammad Amin Nabian, Hadi Meidani","A Deep Neural Network Surrogate for High-Dimensional Random Partial
  Differential Equations",,"Probabilistic Engineering Mechanics, 57, pp.14-25 (2019)",10.1016/j.probengmech.2019.05.001,,cs.LG cs.NA cs.NE physics.comp-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Developing efficient numerical algorithms for the solution of high
dimensional random Partial Differential Equations (PDEs) has been a challenging
task due to the well-known curse of dimensionality. We present a new solution
framework for these problems based on a deep learning approach. Specifically,
the random PDE is approximated by a feed-forward fully-connected deep residual
network, with either strong or weak enforcement of initial and boundary
constraints. The framework is mesh-free, and can handle irregular computational
domains. Parameters of the approximating deep neural network are determined
iteratively using variants of the Stochastic Gradient Descent (SGD) algorithm.
The satisfactory accuracy of the proposed frameworks is numerically
demonstrated on diffusion and heat conduction problems, in comparison with the
converged Monte Carlo-based finite element results.
","[{'version': 'v1', 'created': 'Fri, 8 Jun 2018 03:24:50 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Aug 2018 23:59:31 GMT'}]",2019-10-17,"[['Nabian', 'Mohammad Amin', ''], ['Meidani', 'Hadi', '']]","['Deep learning', 'deep neural networks', 'residual networks', 'random partial differentialequations', 'curse of dimensionality', 'least squares']"
4058,2102.06690,Youngjun Cho,Youngjun Cho,"Rethinking Eye-blink: Assessing Task Difficulty through Physiological
  Representation of Spontaneous Blinking","[Accepted version] In Proceedings of CHI Conference on Human Factors
  in Computing Systems (CHI '21), May 8-13, 2021, Yokohama, Japan. ACM, New
  York, NY, USA. 19 Pages. https://doi.org/10.1145/3411764.3445577",,10.1145/3411764.3445577,,cs.HC cs.AI cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Continuous assessment of task difficulty and mental workload is essential in
improving the usability and accessibility of interactive systems. Eye tracking
data has often been investigated to achieve this ability, with reports on the
limited role of standard blink metrics. Here, we propose a new approach to the
analysis of eye-blink responses for automated estimation of task difficulty.
The core module is a time-frequency representation of eye-blink, which aims to
capture the richness of information reflected on blinking. In our first study,
we show that this method significantly improves the sensitivity to task
difficulty. We then demonstrate how to form a framework where the represented
patterns are analyzed with multi-dimensional Long Short-Term Memory recurrent
neural networks for their non-linear mapping onto difficulty-related
parameters. This framework outperformed other methods that used hand-engineered
features. This approach works with any built-in camera, without requiring
specialized devices. We conclude by discussing how Rethinking Eye-blink can
benefit real-world applications.
","[{'version': 'v1', 'created': 'Fri, 12 Feb 2021 18:47:13 GMT'}]",2021-02-15,"[['Cho', 'Youngjun', '']]","['Eye-blink', 'Mental Workload Assessment', 'Task Difficulty', 'Physiological Representation', 'Physiological Computing', 'Eye-blink Spectrogram']"
4059,2105.09605,Yu Wang,"Yu Wang, Xin Xin, Zaiqiao Meng, Xiangnan He, Joemon Jose, Fuli Feng",Learning Robust Recommenders through Cross-Model Agreement,"12 pages, 23 figures",World Wide Web Conference 2022,10.1145/3485447.3512202,,cs.IR cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Learning from implicit feedback is one of the most common cases in the
application of recommender systems. Generally speaking, interacted examples are
considered as positive while negative examples are sampled from uninteracted
ones. However, noisy examples are prevalent in real-world implicit feedback. A
noisy positive example could be interacted but it actually leads to negative
user preference. A noisy negative example which is uninteracted because of
unawareness of the user could also denote potential positive user preference.
Conventional training methods overlook these noisy examples, leading to
sub-optimal recommendations. In this work, we propose a novel framework to
learn robust recommenders from implicit feedback. Through an empirical study,
we find that different models make relatively similar predictions on clean
examples which denote the real user preference, while the predictions on noisy
examples vary much more across different models. Motivated by this observation,
we propose denoising with cross-model agreement(DeCA) which aims to minimize
the KL-divergence between the real user preference distributions parameterized
by two recommendation models while maximizing the likelihood of data
observation. We employ the proposed DeCA on four state-of-the-art
recommendation models and conduct experiments on four datasets. Experimental
results demonstrate that DeCA significantly improves recommendation performance
compared with normal training and other denoising methods. Codes will be
open-sourced.
","[{'version': 'v1', 'created': 'Thu, 20 May 2021 08:59:44 GMT'}, {'version': 'v2', 'created': 'Sun, 24 Oct 2021 12:51:42 GMT'}, {'version': 'v3', 'created': 'Sun, 13 Mar 2022 05:31:10 GMT'}]",2022-03-15,"[['Wang', 'Yu', ''], ['Xin', 'Xin', ''], ['Meng', 'Zaiqiao', ''], ['He', 'Xiangnan', ''], ['Jose', 'Joemon', ''], ['Feng', 'Fuli', '']]","['Recommender System', 'Denoised Recommendation', 'Robust Learning', 'Implicit Feedback']"
4060,1512.00306,Luiz Capretz Dr.,"Wei Lin Du, Luiz Fernando Capretz, Ali Bou Nassif, Danny Ho",A Hybrid Intelligent Model for Software Cost Estimation,,"Journal of Computer Science, 9(11):1506-1513, 2013",10.3844/ajbb.2013.1506-1513,,cs.SE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate software development effort estimation is critical to the success of
software projects. Although many techniques and algorithmic models have been
developed and implemented by practitioners, accurate software development
effort prediction is still a challenging endeavor in the field of software
engineering, especially in handling uncertain and imprecise inputs and
collinear characteristics. In this paper, a hybrid in-telligent model combining
a neural network model integrated with fuzzy model (neuro-fuzzy model) has been
used to improve the accuracy of estimating software cost. The performance of
the proposed model is assessed by designing and conducting evaluation with
published project and industrial data. Results have shown that the proposed
model demonstrates the ability of improving the estimation accuracy by 18%
based on the Mean Magnitude of Relative Error (MMRE) criterion.
","[{'version': 'v1', 'created': 'Tue, 1 Dec 2015 15:47:29 GMT'}]",2015-12-02,"[['Du', 'Wei Lin', ''], ['Capretz', 'Luiz Fernando', ''], ['Nassif', 'Ali Bou', ''], ['Ho', 'Danny', '']]","['Hybrid Intelligent Model', 'Software Cost Estimation', 'Neuro-Fuzzy', 'Predictive Model']"
4061,2102.07864,Conor Kelton,"Conor Kelton, Matteo Varvello, Andrius Aucinas, Benjamin Livshits",Browselite: A Private Data Saving Solution for the Web,"12 pages, 10 Figures",,10.1145/3442381.3449885,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  The median webpage has increased in size by more than 80% in the last 4
years. This extra complexity allows for a rich browsing experience, but it
hurts the majority of mobile users which still pay for their traffic. This has
motivated several data-saving solutions, which aim at reducing the complexity
of webpages by transforming their content. Despite each method being unique,
they either reduce user privacy by further centralizing web traffic through
data-saving middleboxes or introduce web compatibility (Webcompat) issues by
removing content that breaks pages in unpredictable ways. In this paper, we
argue that data-saving is still possible without impacting either users privacy
or Webcompat. Our main observation is that Web images make up a large portion
of Web traffic and have negligible impact on Webcompat. To this end we make two
main contributions. First, we quantify the potential savings that image
manipulation, such as dimension resizing, quality compression, and transcoding,
enables at large scale: 300 landing and 880 internal pages. Next, we design and
build Browselite, an entirely client-side tool that achieves such data savings
through opportunistically instrumenting existing server-side tooling to perform
image compression, while simultaneously reducing the total amount of image data
fetched. The effect of Browselite on the user experience is quantified using
standard page load metrics and a real user study of over 200 users across 50
optimized web pages. Browselite allows for similar savings to middlebox
approaches, while offering additional security, privacy, and Webcompat
guarantees.
","[{'version': 'v1', 'created': 'Mon, 15 Feb 2021 22:00:50 GMT'}]",2021-02-17,"[['Kelton', 'Conor', ''], ['Varvello', 'Matteo', ''], ['Aucinas', 'Andrius', ''], ['Livshits', 'Benjamin', '']]","['Web', 'Browsers', 'Performance', 'Optimizations', 'Images', 'Data saving']"
4062,1912.00312,Bilge Mutlu PhD,"Eric Deng, Bilge Mutlu, Maja Mataric",Embodiment in Socially Interactive Robots,"The official publication is available from now publishers via
  https://www.nowpublishers.com/article/Details/ROB-056","Foundations and Trends in Robotics: Vol. 7: No. 4, pp 251-356
  (2019)",10.1561/2300000056,,cs.RO cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Physical embodiment is a required component for robots that are structurally
coupled with their real-world environments. However, most socially interactive
robots do not need to physically interact with their environments in order to
perform their tasks. When and why should embodied robots be used instead of
simpler and cheaper virtual agents? This paper reviews the existing work that
explores the role of physical embodiment in socially interactive robots. This
class consists of robots that are not only capable of engaging in social
interaction with humans, but are using primarily their social capabilities to
perform their desired functions. Socially interactive robots provide
entertainment, information, and/or assistance; this last category is typically
encompassed by socially assistive robotics. In all cases, such robots can
achieve their primary functions without performing functional physical work. To
comprehensively evaluate the existing body of work on embodiment, we first
review work from established related fields including psychology, philosophy,
and sociology. We then systematically review 65 studies evaluating aspects of
embodiment published from 2003 to 2017 in major peer-reviewed robotics
publication venues. We examine relevant aspects of the selected studies,
focusing on the embodiments compared, tasks evaluated, social roles of robots,
and measurements. We introduce three taxonomies for the types of robot
embodiment, robot social roles, and human-robot tasks. These taxonomies are
used to deconstruct the design and interaction spaces of socially interactive
robots and facilitate analysis and discussion of the reviewed studies. We use
this newly-defined methodology to critically discuss existing works, revealing
topics within embodiment research for social interaction, assistive robotics,
and service robotics.
","[{'version': 'v1', 'created': 'Sun, 1 Dec 2019 03:58:44 GMT'}]",2019-12-03,"[['Deng', 'Eric', ''], ['Mutlu', 'Bilge', ''], ['Mataric', 'Maja', '']]","['Embodiment', 'Human-Robot Interaction', 'Social Robotics', 'Product Design', 'Human-Computer Interaction', 'Service Robots', 'Reporting Guidelines', 'Methodology']"
4063,2102.08881,Andry Alamsyah,"Andry Alamsyah, Yahya Peranginangin, Intan Muchtadi-Alamsyah, Budi
  Rahardjo, Kuspriyanto","Graph Sampling Approach for Reducing Computational Complexity of
  Large-Scale Social Network","7 pages, 2 figures","Journal of Innovative Technology and Education, Vol. 3, 2016",10.12988/jite.2016.6828,,cs.SI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Online social network services provide a platform for human social
interactions. Nowadays, many kinds of online interactions generate large-scale
social network data. Network analysis helps to mine knowledge and pattern from
the relationship between actors inside the network. This approach is important
to support predictions and the decision-making process in many real-world
applications. The social network analysis methodology, which borrows approaches
from graph theory provides several metrics that enabled us to measure specific
properties of the networks. Some of the metrics calculations were built with no
scalability in minds, thus it is computationally expensive. In this paper, we
propose a graph sampling approach to reduce social network size, thus reducing
computation operations. The performance comparison between natural graph
sampling strategies using edge random sampling, node random sampling, and
random walks are presented on each selected graph property. We found that the
performance of graph sampling strategies depends on graph properties measured.
","[{'version': 'v1', 'created': 'Wed, 17 Feb 2021 17:25:09 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Feb 2021 01:48:28 GMT'}]",2021-02-19,"[['Alamsyah', 'Andry', ''], ['Peranginangin', 'Yahya', ''], ['Muchtadi-Alamsyah', 'Intan', ''], ['Rahardjo', 'Budi', ''], ['Kuspriyanto', '', '']]","['Graph Sampling', 'Graph Theory', 'Large-Scale Social Network', 'Computational Complexity', 'Social Network Analysis']"
4064,1604.08685,Jiajun Wu,"Jiajun Wu, Tianfan Xue, Joseph J. Lim, Yuandong Tian, Joshua B.
  Tenenbaum, Antonio Torralba, William T. Freeman",Single Image 3D Interpreter Network,"ECCV 2016 (oral). The first two authors contributed equally to this
  work",,10.1007/978-3-319-46466-4_22,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding 3D object structure from a single image is an important but
difficult task in computer vision, mostly due to the lack of 3D object
annotations in real images. Previous work tackles this problem by either
solving an optimization task given 2D keypoint positions, or training on
synthetic data with ground truth 3D information. In this work, we propose 3D
INterpreter Network (3D-INN), an end-to-end framework which sequentially
estimates 2D keypoint heatmaps and 3D object structure, trained on both real
2D-annotated images and synthetic 3D data. This is made possible mainly by two
technical innovations. First, we propose a Projection Layer, which projects
estimated 3D structure to 2D space, so that 3D-INN can be trained to predict 3D
structural parameters supervised by 2D annotations on real images. Second,
heatmaps of keypoints serve as an intermediate representation connecting real
and synthetic data, enabling 3D-INN to benefit from the variation and abundance
of synthetic 3D objects, without suffering from the difference between the
statistics of real and synthesized images due to imperfect rendering. The
network achieves state-of-the-art performance on both 2D keypoint estimation
and 3D structure recovery. We also show that the recovered 3D information can
be used in other vision applications, such as 3D rendering and image retrieval.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2016 04:52:46 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Oct 2016 19:35:54 GMT'}]",2016-10-06,"[['Wu', 'Jiajun', ''], ['Xue', 'Tianfan', ''], ['Lim', 'Joseph J.', ''], ['Tian', 'Yuandong', ''], ['Tenenbaum', 'Joshua B.', ''], ['Torralba', 'Antonio', ''], ['Freeman', 'William T.', '']]","['3D Structure', 'Single Image 3D Reconstruction', 'KeypointEstimation', 'Neural Network', 'Synthetic Data']"
4065,1504.01381,Hyungmin Cho,"Hyungmin Cho, Chen-Yong Cher, Thomas Shepherd, Subhasish Mitra",Understanding Soft Errors in Uncore Components,"to be published in Proceedings of the 52nd Annual Design Automation
  Conference",,10.1145/2744769.2744923,,cs.OH cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The effects of soft errors in processor cores have been widely studied.
However, little has been published about soft errors in uncore components, such
as memory subsystem and I/O controllers, of a System-on-a-Chip (SoC). In this
work, we study how soft errors in uncore components affect system-level
behaviors. We have created a new mixed-mode simulation platform that combines
simulators at two different levels of abstraction, and achieves 20,000x speedup
over RTL-only simulation. Using this platform, we present the first study of
the system-level impact of soft errors inside various uncore components of a
large-scale, multi-core SoC using the industrial-grade, open-source OpenSPARC
T2 SoC design. Our results show that soft errors in uncore components can
significantly impact system-level reliability. We also demonstrate that uncore
soft errors can create major challenges for traditional system-level checkpoint
recovery techniques. To overcome such recovery challenges, we present a new
replay recovery technique for uncore components belonging to the memory
subsystem. For the L2 cache controller and the DRAM controller components of
OpenSPARC T2, our new technique reduces the probability that an application run
fails to produce correct results due to soft errors by more than 100x with
3.32% and 6.09% chip-level area and power impact, respectively.
","[{'version': 'v1', 'created': 'Mon, 6 Apr 2015 16:22:00 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Apr 2015 17:57:02 GMT'}, {'version': 'v3', 'created': 'Fri, 8 May 2015 17:20:49 GMT'}]",2015-05-11,"[['Cho', 'Hyungmin', ''], ['Cher', 'Chen-Yong', ''], ['Shepherd', 'Thomas', ''], ['Mitra', 'Subhasish', '']]","['Soft Error', 'Uncore Components', 'Simulation', 'Recovery']"
4066,1803.07827,Ayan Mahalanobis,Upendra Kapshikar and Ayan Mahalanobis,A Quantum-Secure Niederreiter Cryptosystem using Quasi-Cyclic Codes,"Fixed some typos, in particular one in the proof of Lemma 5.6","In Proceedings of the 15th International Joint Conference on
  e-Business and Telecommunications (ICETE 2018) - Volume 2 SECRYPT, pages
  340-347",10.5330/0006843005060513,,cs.CR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we describe a new Niederreiter cryptosystem based on
quasi-cyclic $\frac{m-1}{m}$ codes that is quantum-secure. This new
cryptosystem has good transmission rate compared to the one using binary Goppa
codes and uses smaller keys.
","[{'version': 'v1', 'created': 'Wed, 21 Mar 2018 10:03:41 GMT'}, {'version': 'v2', 'created': 'Thu, 21 May 2020 05:57:40 GMT'}]",2020-05-22,"[['Kapshikar', 'Upendra', ''], ['Mahalanobis', 'Ayan', '']]","['Niederreiter Cryptosystem', 'Post-quantum Cryptograpy', 'Quasi-Cyclic codes']"
4067,1611.07163,Stefan Wagner,Rainer Niedermayr and Elmar Juergens and Stefan Wagner,Will My Tests Tell Me If I Break This Code?,"7 pages, 3 figures","Proceedings of the International Workshop on Continuous Software
  Evolution and Delivery (CSED '16). ACM, 2016",10.1145/2896941.2896944,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated tests play an important role in software evolution because they can
rapidly detect faults introduced during changes. In practice, code-coverage
metrics are often used as criteria to evaluate the effectiveness of test suites
with focus on regression faults. However, code coverage only expresses which
portion of a system has been executed by tests, but not how effective the tests
actually are in detecting regression faults. Our goal was to evaluate the
validity of code coverage as a measure for test effectiveness. To do so, we
conducted an empirical study in which we applied an extreme mutation testing
approach to analyze the tests of open-source projects written in Java. We
assessed the ratio of pseudo-tested methods (those tested in a way such that
faults would not be detected) to all covered methods and judged their impact on
the software project. The results show that the ratio of pseudo-tested methods
is acceptable for unit tests but not for system tests (that execute large
portions of the whole system). Therefore, we conclude that the coverage metric
is only a valid effectiveness indicator for unit tests.
","[{'version': 'v1', 'created': 'Tue, 22 Nov 2016 06:44:39 GMT'}]",2016-11-23,"[['Niedermayr', 'Rainer', ''], ['Juergens', 'Elmar', ''], ['Wagner', 'Stefan', '']]","['Regression Testing', 'Test Suite Effectiveness', 'Code Coverage', 'Mutation Testing']"
4068,1701.04617,Carlos Vega,"Carlos Vega, Paula Roquero, Javier Aracil","Multi-Gbps HTTP Traffic Analysis in Commodity Hardware Based on Local
  Knowledge of TCP Streams","19 pages, 10 figures. This manuscript version is made available under
  the CC-BY-NC-ND 4.0 license",Computer Networks Volume 113; 11 February 2017; Pages 258-268,10.1016/j.comnet.2017.01.001,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose and implement novel techniques for performance
evaluation of web traffic (response time, response code, etc.), with no
reassembly of the underlying TCP connection, which severely restricts the
traffic analysis throughput. Furthermore, our proposed software for HTTP
traffic analysis runs in standard hardware, which is very cost-effective.
Besides, we present sub-TCP connection load balancing techniques that
significantly increase throughput at the expense of losing very few HTTP
transactions. Such techniques provide performance evaluation statistics which
are indistinguishable from the single-threaded alternative with full TCP
connection reassembly.
","[{'version': 'v1', 'created': 'Tue, 17 Jan 2017 11:03:28 GMT'}]",2017-01-18,"[['Vega', 'Carlos', ''], ['Roquero', 'Paula', ''], ['Aracil', 'Javier', '']]","['HTTP', 'Traffic Analysis', 'High Speed Analysis']"
4069,1305.5240,Robert Kent,Robert E. Kent,FOLE: The First-order Logical Environment,"Conceptual Structures for STEM Research and Education, 20th
  International Conference on Conceptual Structures, ICCS 2013, Mumbai, India,
  January 10-12, 2013. Proceedings. Can be found online at:
  http://link.springer.com/chapter/10.1007%2F978-3-642-35786-2_15","Lecture Notes in Computer Science, Volume 7735, 2013, pp 210-230.
  Springer Berlin Heidelberg",10.1007/978-3-642-35786-2_15,,cs.LO math.CT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the first-order logical environment FOLE. Institutions
in general, and logical environments in particular, give equivalent
heterogeneous and homogeneous representations for logical systems. As such,
they offer a rigorous and principled approach to distributed interoperable
information systems via system consequence. Since FOLE is a particular logical
environment, this provides a rigorous and principled approach to distributed
interoperable first-order information systems. The FOLE represents the
formalism and semantics of first-order logic in a classification form. By using
an interpretation form, a companion approach defines the formalism and
semantics of first-order logical/relational database systems. In a strict
sense, the two forms have transformational passages (generalized inverses)
between one another. The classification form of first-order logic in the FOLE
corresponds to ideas discussed in the Information Flow Framework (IFF). The
FOLE representation follows a conceptual structures approach, that is
completely compatible with formal concept analysis and information flow.
","[{'version': 'v1', 'created': 'Wed, 22 May 2013 19:29:37 GMT'}]",2013-05-23,"[['Kent', 'Robert E.', '']]","['schema', 'specification', 'structure', 'logical environment']"
4070,1804.04021,Henrik Barthels M.Sc.,"Henrik Barthels, Marcin Copik, Paolo Bientinesi",The Generalized Matrix Chain Algorithm,,"Proceedings of 2018 IEEE/ACM International Symposium on Code
  Generation and Optimization, Vienna, Austria, February 24-28, 2018",10.1145/3168804,,cs.MS cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a generalized version of the matrix chain algorithm
to generate efficient code for linear algebra problems, a task for which human
experts often invest days or even weeks of works. The standard matrix chain
problem consists in finding the parenthesization of a matrix product $M := A_1
A_2 \cdots A_n$ that minimizes the number of scalar operations. In practical
applications, however, one frequently encounters more complicated expressions,
involving transposition, inversion, and matrix properties. Indeed, the
computation of such expressions relies on a set of computational kernels that
offer functionality well beyond the simple matrix product. The challenge then
shifts from finding an optimal parenthesization to finding an optimal mapping
of the input expression to the available kernels. Furthermore, it is often the
case that a solution based on the minimization of scalar operations does not
result in the optimal solution in terms of execution time. In our experiments,
the generated code outperforms other libraries and languages on average by a
factor of about 9. The motivation for this work comes from the fact
that---despite great advances in the development of compilers---the task of
mapping linear algebra problems to optimized kernels is still to be done
manually. In order to relieve the user from this complex task, new techniques
for the compilation of linear algebra expressions have to be developed.
","[{'version': 'v1', 'created': 'Tue, 10 Apr 2018 16:32:49 GMT'}]",2018-04-12,"[['Barthels', 'Henrik', ''], ['Copik', 'Marcin', ''], ['Bientinesi', 'Paolo', '']]","['matrix chain problem', 'linear algebra', 'compiler']"
4071,1808.09218,Filipe Ribeiro,"Filipe N. Ribeiro, Koustuv Saha, Mahmoudreza Babaei, Lucas Henrique,
  Johnnatan Messias, Fabricio Benevenuto, Oana Goga, Krishna P. Gummadi, Elissa
  M. Redmiles","On Microtargeting Socially Divisive Ads: A Case Study of Russia-Linked
  Ad Campaigns on Facebook","This is a preprint of a full paper accepted at ACM FAT*'19 (ACM
  Conference on Fairness, Accountability, and Transparency). Please cite that
  version instead",,10.1145/3287560.3287580,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Targeted advertising is meant to improve the efficiency of matching
advertisers to their customers. However, targeted advertising can also be
abused by malicious advertisers to efficiently reach people susceptible to
false stories, stoke grievances, and incite social conflict. Since targeted ads
are not seen by non-targeted and non-vulnerable people, malicious ads are
likely to go unreported and their effects undetected. This work examines a
specific case of malicious advertising, exploring the extent to which political
ads from the Russian Intelligence Research Agency (IRA) run prior to 2016 U.S.
elections exploited Facebook's targeted advertising infrastructure to
efficiently target ads on divisive or polarizing topics (e.g., immigration,
race-based policing) at vulnerable sub-populations. In particular, we do the
following: (a) We conduct U.S. census-representative surveys to characterize
how users with different political ideologies report, approve, and perceive
truth in the content of the IRA ads. Our surveys show that many ads are
""divisive"": they elicit very different reactions from people belonging to
different socially salient groups. (b) We characterize how these divisive ads
are targeted to sub-populations that feel particularly aggrieved by the status
quo. Our findings support existing calls for greater transparency of content
and targeting of political ads. (c) We particularly focus on how the Facebook
ad API facilitates such targeting. We show how the enormous amount of personal
data Facebook aggregates about users and makes available to advertisers enables
such malicious targeting.
","[{'version': 'v1', 'created': 'Tue, 28 Aug 2018 11:02:08 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Aug 2018 15:26:41 GMT'}, {'version': 'v3', 'created': 'Fri, 31 Aug 2018 22:08:47 GMT'}, {'version': 'v4', 'created': 'Wed, 21 Nov 2018 23:18:01 GMT'}]",2018-11-26,"[['Ribeiro', 'Filipe N.', ''], ['Saha', 'Koustuv', ''], ['Babaei', 'Mahmoudreza', ''], ['Henrique', 'Lucas', ''], ['Messias', 'Johnnatan', ''], ['Benevenuto', 'Fabricio', ''], ['Goga', 'Oana', ''], ['Gummadi', 'Krishna P.', ''], ['Redmiles', 'Elissa M.', '']]","['advertisements', 'targeting', 'social divisiveness', 'news media', 'socialmedia', 'perception bias']"
4072,1612.02067,Sotiris Papatheodorou,"Sotiris Papatheodorou, Anthony Tzes and Yiannis Stergiopoulos",Collaborative Visual Area Coverage,"26 pages, 14 figures, submitted to Robotics and Autonomous Systems on
  October 31 2016. arXiv admin note: substantial text overlap with
  arXiv:1612.02065",,10.1016/j.robot.2017.03.005,,cs.SY cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article examines the problem of visual area coverage by a network of
Mobile Aerial Agents (MAAs). Each MAA is assumed to be equipped with a
downwards facing camera with a conical field of view which covers all points
within a circle on the ground. The diameter of that circle is proportional to
the altitude of the MAA, whereas the quality of the covered area decreases with
the altitude. A distributed control law that maximizes a joint coverage-quality
criterion by adjusting the MAAs' spatial coordinates is developed. The
effectiveness of the proposed control scheme is evaluated through simulation
studies.
","[{'version': 'v1', 'created': 'Tue, 6 Dec 2016 23:09:42 GMT'}]",2017-11-27,"[['Papatheodorou', 'Sotiris', ''], ['Tzes', 'Anthony', ''], ['Stergiopoulos', 'Yiannis', '']]","['Cooperative Control', 'Autonomous Systems', 'Area Coverage', 'Robotic']"
4073,1810.07960,Bolun Zheng,"Bolun Zheng, Rui Sun, Xiang Tian, Yaowu Chen","S-Net: A Scalable Convolutional Neural Network for JPEG Compression
  Artifact Reduction",accepted by Journal of Electronic Imaging,,10.1117/1.JEI.27.4.043037,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent studies have used deep residual convolutional neural networks (CNNs)
for JPEG compression artifact reduction. This study proposes a scalable CNN
called S-Net. Our approach effectively adjusts the network scale dynamically in
a multitask system for real-time operation with little performance loss. It
offers a simple and direct technique to evaluate the performance gains obtained
with increasing network depth, and it is helpful for removing redundant network
layers to maximize the network efficiency. We implement our architecture using
the Keras framework with the TensorFlow backend on an NVIDIA K80 GPU server. We
train our models on the DIV2K dataset and evaluate their performance on public
benchmark datasets. To validate the generality and universality of the proposed
method, we created and utilized a new dataset, called WIN143, for
over-processed images evaluation. Experimental results indicate that our
proposed approach outperforms other CNN-based methods and achieves
state-of-the-art performance.
","[{'version': 'v1', 'created': 'Thu, 18 Oct 2018 09:21:44 GMT'}]",2019-07-24,"[['Zheng', 'Bolun', ''], ['Sun', 'Rui', ''], ['Tian', 'Xiang', ''], ['Chen', 'Yaowu', '']]","['compression artifact reduction', 'encoder-decoder model', 'scalable convolutional neural network', 'depth evaluation']"
4074,1703.04298,Stefan Wagner,"Klaus Lochmann, Jasmin Ramadani, Stefan Wagner","Are Comprehensive Quality Models Necessary for Evaluating Software
  Quality?","10 pages, 3 figures, Proceedings of the 9th International Conference
  on Predictive Models in Software Engineering (PROMISE '13). ACM Press, 2013","Proceedings of the 9th International Conference on Predictive
  Models in Software Engineering (PROMISE '13). ACM, 2013",10.1145/2499393.2499404,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The concept of software quality is very complex and has many facets.
Reflecting all these facets and at the same time measuring everything related
to these facets results in comprehensive but large quality models and extensive
measurements. In contrast, there are also many smaller, focused quality models
claiming to evaluate quality with few measures.
  We investigate if and to what extent it is possible to build a focused
quality model with similar evaluation results as a comprehensive quality model
but with far less measures needed to be collected and, hence, reduced effort.
We make quality evaluations with the comprehensive Quamoco base quality model
and build focused quality models based on the same set of measures and data
from over 2,000 open source systems. We analyse the ability of the focused
model to predict the results of the Quamoco model by comparing them with a
random predictor as a baseline. We calculate the standardised accuracy measure
SA and effect sizes.
  We found that for the Quamoco model and its 378 automatically collected
measures, we can build a focused model with only 10 measures but an accuracy of
61% and a medium to high effect size. We conclude that we can build focused
quality models to get an impression of a system's quality similar to
comprehensive models. However, when including manually collected measures, the
accuracy of the models stayed below 50%. Hence, manual measures seem to have a
high impact and should therefore not be ignored in a focused model.
","[{'version': 'v1', 'created': 'Mon, 13 Mar 2017 09:25:08 GMT'}]",2017-11-15,"[['Lochmann', 'Klaus', ''], ['Ramadani', 'Jasmin', ''], ['Wagner', 'Stefan', '']]","['Software quality', 'quality model', 'quality evaluation']"
4075,1511.05027,Philippe Moser,"Philippe Moser, Frank Stephan","Depth, Highness and DNR degrees","journal version, dmtcs","Discrete Mathematics & Theoretical Computer Science, Vol. 19 no.
  4, FCT '15, special issue FCT'15 (October 26, 2017) dmtcs:4012",10.23638/DMTCS-19-4-2,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study Bennett deep sequences in the context of recursion theory; in
particular we investigate the notions of O(1)-deepK, O(1)-deepC , order-deep K
and order-deep C sequences. Our main results are that Martin-Loef random sets
are not order-deepC , that every many-one degree contains a set which is not
O(1)-deepC , that O(1)-deepC sets and order-deepK sets have high or DNR Turing
degree and that no K-trival set is O(1)-deepK.
","[{'version': 'v1', 'created': 'Mon, 16 Nov 2015 16:40:28 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Oct 2017 17:08:43 GMT'}]",2019-03-14,"[['Moser', 'Philippe', ''], ['Stephan', 'Frank', '']]","['Bennett logical depth', 'Kolmogorov complexity', 'algorithmic randomness theory', 'computability and randomness']"
4076,2102.04701,Linda Gesenhues,"Linda Gesenhues, Marek Behr","Simulating dense granular flow using the $\mu$($I$)-rheology within a
  space-time framework",,,10.1002/fld.5014,,cs.CE cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A space-time framework is applied to simulate dense granular flow. Two
different numerical experiments are performed: a column collapse and a dam
break on an inclined plane. The experiments are modeled as two-phase flows. The
dense granular material is represented by a constitutive model, the
$\mu$($I$)-rheology, that is based on the Coulomb's friction law, such that the
normal stress applied by the pressure is related to the tangential stress. The
model represents a complex shear thinning viscoplastic material behavior. The
interface between the dense granular material and the surrounding light fluid
is captured with a level set function. Due to discontinuities close to the the
interface, the mesh requires a sufficient resolution. The space-time approach
allows unstructured meshes in time and, therefore a well refined mesh in the
temporal direction around the interface. In this study, results and performance
of a flat and a simplex space time discretization are verified and analyzed.
","[{'version': 'v1', 'created': 'Tue, 9 Feb 2021 08:36:21 GMT'}]",2021-09-01,"[['Gesenhues', 'Linda', ''], ['Behr', 'Marek', '']]","['dense granular flow', 'finite element', 'level set', 'non-Newtonian', 'space-time', 'two-phase flows', '휇(퐼)-rheology']"
4077,2204.04423,Shinpei Hayashi,"Keisuke Isemoto, Takashi Kobayashi, Shinpei Hayashi","Revisiting the Effect of Branch Handling Strategies on Change
  Recommendation","11 pages, ICPC 2022","Proceedings of the 30th IEEE/ACM International Conference on
  Program Comprehension, 162-172, 2022",10.1145/3524610.3527870,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although literature has noted the effects of branch handling strategies on
change recommendation based on evolutionary coupling, they have been tested in
a limited experimental setting. Additionally, the branches characteristics that
lead to these effects have not been investigated. In this study, we revisited
the investigation conducted by Kovalenko et al. on the effect to change
recommendation using two different branch handling strategies: including
changesets from commits on a branch and excluding them. In addition to the
setting by Kovalenko et al., we introduced another setting to compare:
extracting a changeset for a branch from a merge commit at once. We compared
the change recommendation results and the similarity of the extracted
co-changes to those in the future obtained using two strategies through 30
open-source software systems. The results show that handling commits on a
branch separately is often more appropriate in change recommendation, although
the comparison in an additional setting resulted in a balanced performance
among the branch handling strategies. Additionally, we found that the merge
commit size and the branch length positively influence the change
recommendation results.
","[{'version': 'v1', 'created': 'Sat, 9 Apr 2022 08:16:40 GMT'}]",2022-12-06,"[['Isemoto', 'Keisuke', ''], ['Kobayashi', 'Takashi', ''], ['Hayashi', 'Shinpei', '']]","['Change recommendation', 'evolutionary coupling', 'version control', 'Git']"
4078,1811.12686,Thai T. Vu,"Thai T. Vu, Nguyen Van Huynh, Dinh Thai Hoang, Diep N. Nguyen, and
  Eryk Dutkiewicz","Offloading Energy Efficiency with Delay Constraint for Cooperative
  Mobile Edge Computing Networks","6 pages, 6 figures, accepted for presentation at the 2018 Global
  Communications Conference (IEEE GLOBECOM)",,10.1109/GLOCOM.2018.8647856,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel edge computing network architecture that enables edge
nodes to cooperate in sharing computing and radio resources to minimize the
total energy consumption of mobile users while meeting their delay
requirements. To find the optimal task offloading decisions for mobile users,
we first formulate the joint task offloading and resource allocation
optimization problem as a mixed integer non-linear programming (MINLP). The
optimization involves both binary (offloading decisions) and real variables
(resource allocations), making it an NP-hard and computational intractable
problem. To circumvent, we relax the binary decision variables to transform the
MINLP to a relaxed optimization problem with real variables. After proving that
the relaxed problem is a convex one, we propose two solutions namely ROP and
IBBA. ROP is adopted from the interior point method and IBBA is developed from
the branch and bound algorithm. Through the numerical results, we show that our
proposed approaches allow minimizing the total energy consumption and meet all
delay requirements for mobile users.
","[{'version': 'v1', 'created': 'Fri, 30 Nov 2018 09:39:13 GMT'}]",2019-06-11,"[['Vu', 'Thai T.', ''], ['Van Huynh', 'Nguyen', ''], ['Hoang', 'Dinh Thai', ''], ['Nguyen', 'Diep N.', ''], ['Dutkiewicz', 'Eryk', '']]","['Task offloading', 'mobile edge computing', 'resource allocation', 'MINLP', 'branch-and-bound algorithm']"
4079,1607.06021,Dariusz Dereniowski,Dariusz Dereniowski and Wieslaw Kubiak,Shared multi-processor scheduling,,European Journal of Operational Research 261(2): 503-514 (2017),10.1016/j.ejor.2017.03.002,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study shared multi-processor scheduling problem where each job can be
executed on its private processor and simultaneously on one of many processors
shared by all jobs in order to reduce the job's completion time due to
processing time overlap. The total weighted overlap of all jobs is to be
maximized. The problem models subcontracting scheduling in supply chains and
divisible load scheduling in computing. We show that synchronized schedules
that complete each job at the same time on its private processor and shared
processors, if any is actually used by the job, include optimal schedules. We
prove that the problem is NP-hard in the strong sense for jobs with arbitrary
weights, and we give an efficient, polynomial-time algorithm for the problem
with equal weights.
","[{'version': 'v1', 'created': 'Wed, 20 Jul 2016 16:50:41 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Mar 2017 14:01:22 GMT'}]",2021-03-05,"[['Dereniowski', 'Dariusz', ''], ['Kubiak', 'Wieslaw', '']]","['combinatorial optimization', 'divisible jobs', 'shared processors', 'subcontracting', 'supply chains']"
4080,1204.1868,Konstantinos Chorianopoulos,Konstantinos Chorianopoulos,User-based key frame detection in social web video,"4 pages, 4 figures",,10.1145/2382636.2382642,,cs.MM cs.HC cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video search results and suggested videos on web sites are represented with a
video thumbnail, which is manually selected by the video up-loader among three
randomly generated ones (e.g., YouTube). In contrast, we present a grounded
user-based approach for automatically detecting interesting key-frames within a
video through aggregated users' replay interactions with the video player.
Previous research has focused on content-based systems that have the benefit of
analyzing a video without user interactions, but they are monolithic, because
the resulting video thumbnails are the same regardless of the user preferences.
We constructed a user interest function, which is based on aggregate video
replays, and analyzed hundreds of user interactions. We found that the local
maximum of the replaying activity stands for the semantics of information rich
videos, such as lecture, and how-to. The concept of user-based key-frame
detection could be applied to any video on the web, in order to generate a
user-based and dynamic video thumbnail in search results.
","[{'version': 'v1', 'created': 'Mon, 9 Apr 2012 12:23:36 GMT'}]",2018-04-17,"[['Chorianopoulos', 'Konstantinos', '']]","['User-based', 'social', 'implicit', 'video', 'key-frame', 'thumbnail']"
4081,0804.2337,Bruno Salvy,"Alin Bostan (INRIA Rocquencourt), Bruno Salvy (INRIA Rocquencourt),
  \'Eric Schost",Power Series Composition and Change of Basis,,,10.1145/1390768.1390806,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efficient algorithms are known for many operations on truncated power series
(multiplication, powering, exponential, ...). Composition is a more complex
task. We isolate a large class of power series for which composition can be
performed efficiently. We deduce fast algorithms for converting polynomials
between various bases, including Euler, Bernoulli, Fibonacci, and the
orthogonal Laguerre, Hermite, Jacobi, Krawtchouk, Meixner and
Meixner-Pollaczek.
","[{'version': 'v1', 'created': 'Tue, 15 Apr 2008 09:43:27 GMT'}]",2013-06-19,"[['Bostan', 'Alin', '', 'INRIA Rocquencourt'], ['Salvy', 'Bruno', '', 'INRIA Rocquencourt'], ['Schost', 'Éric', '']]","['Fast algorithms', 'transposed algorithms', 'basisconversion', 'orthogonal polynomials']"
4082,1102.2599,Xinhua Wang,"Xinhua Wang, Bijan Shirinzadeh",Rapid-convergent nonlinear differentiator,"26 pages, 15 figures","Mechanical Systems and Signal Processing, vol. 28, 2012, 414-431",10.1016/j.ymssp.2011.09.026,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A nonlinear differentiator being fit for rapid convergence is presented,
which is based on singular perturbation technique. The differentiator design
can not only sufficiently reduce the chattering phenomenon of derivative
estimation by introducing a continuous power function, but the dynamical
performances are also improved by adding linear correction terms to the
nonlinear ones. Moreover, strong robustness ability is obtained by integrating
nonlinear items and the linear filter. The merits of the rapid-convergent
differentiator include the excellent dynamical performances, restraining noises
sufficiently, avoiding the chattering phenomenon and being not based on system
model. The theoretical results are confirmed by computer simulations and an
experiment.
","[{'version': 'v1', 'created': 'Sun, 13 Feb 2011 14:52:24 GMT'}, {'version': 'v2', 'created': 'Wed, 6 May 2015 00:17:28 GMT'}]",2015-05-07,"[['Wang', 'Xinhua', ''], ['Shirinzadeh', 'Bijan', '']]","['Differentiator', 'singular perturbation', 'rapid convergence', 'chattering phenomenon']"
4083,1112.0213,"Andr\'e Gr\""uning","Andr\'e Gr\""uning and Ioana Sporea","Supervised Learning of Logical Operations in Layered Spiking Neural
  Networks with Spike Train Encoding","15 pages, 4 figures","Neural Processing Letters October 2012, Volume 36, Issue 2, pp
  117-134",10.1007/s11063-012-9225-1,,cs.NE q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Few algorithms for supervised training of spiking neural networks exist that
can deal with patterns of multiple spikes, and their computational properties
are largely unexplored. We demonstrate in a set of simulations that the ReSuMe
learning algorithm can be successfully applied to layered neural networks.
Input and output patterns are encoded as spike trains of multiple precisely
timed spikes, and the network learns to transform the input trains into target
output trains. This is done by combining the ReSuMe learning algorithm with
multiplicative scaling of the connections of downstream neurons.
  We show in particular that layered networks with one hidden layer can learn
the basic logical operations, including Exclusive-Or, while networks without
hidden layer cannot, mirroring an analogous result for layered networks of rate
neurons.
  While supervised learning in spiking neural networks is not yet fit for
technical purposes, exploring computational properties of spiking neural
networks advances our understanding of how computations can be done with spike
trains.
","[{'version': 'v1', 'created': 'Thu, 1 Dec 2011 15:37:09 GMT'}]",2014-02-05,"[['Grüning', 'André', ''], ['Sporea', 'Ioana', '']]","['Spiking Neural Networks', 'Supervised Learning', 'Logical Operation', 'Spike Trains']"
4084,1902.00672,Hadrien Van Lierde,Hadrien Van Lierde and Tommy W. S. Chow,Query-oriented text summarization based on hypergraph transversals,"This is the unrefereed Author's Original Version (or pre-print
  Version) of the article","Information Processing & Management, Volume 56, Issue 4, July
  2019, Pages 1317-1338",10.1016/j.ipm.2019.03.003,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing graph- and hypergraph-based algorithms for document summarization
represent the sentences of a corpus as the nodes of a graph or a hypergraph in
which the edges represent relationships of lexical similarities between
sentences. Each sentence of the corpus is then scored individually, using
popular node ranking algorithms, and a summary is produced by extracting highly
scored sentences. This approach fails to select a subset of jointly relevant
sentences and it may produce redundant summaries that are missing important
topics of the corpus. To alleviate this issue, a new hypergraph-based
summarizer is proposed in this paper, in which each node is a sentence and each
hyperedge is a theme, namely a group of sentences sharing a topic. Themes are
weighted in terms of their prominence in the corpus and their relevance to a
user-defined query. It is further shown that the problem of identifying a
subset of sentences covering the relevant themes of the corpus is equivalent to
that of finding a hypergraph transversal in our theme-based hypergraph. Two
extensions of the notion of hypergraph transversal are proposed for the purpose
of summarization, and polynomial time algorithms building on the theory of
submodular functions are proposed for solving the associated discrete
optimization problems. The worst-case time complexity of the proposed
algorithms is squared in the number of terms, which makes it cheaper than the
existing hypergraph-based methods. A thorough comparative analysis with related
models on DUC benchmark datasets demonstrates the effectiveness of our
approach, which outperforms existing graph- or hypergraph-based methods by at
least 6% of ROUGE-SU4 score.
","[{'version': 'v1', 'created': 'Sat, 2 Feb 2019 08:52:44 GMT'}]",2019-04-17,"[['Van Lierde', 'Hadrien', ''], ['Chow', 'Tommy W. S.', '']]","['Query-Oriented Text Summarization', 'Hypergraph Theory', 'Hypergraph Transversal', 'Sentence Clustering', 'Submodular SetFunctions']"
4085,1907.06054,Yuantao Gu,"Gen Li, Xingyu Xu, Yuantao Gu","Lower Bound for RIP Constants and Concentration of Sum of Top Order
  Statistics","24 pages, 1 figure",,10.1109/TSP.2020.2985848,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Restricted Isometry Property (RIP) is of fundamental importance in the theory
of compressed sensing and forms the base of many exact and robust recovery
guarantees in this field. A quantitative description of RIP involves bounding
the so-called RIP constants of measurement matrices. In this respect, it is
noteworthy that most results in the literature concerning RIP are upper bounds
of RIP constants, which can be interpreted as a theoretical guarantee of
successful sparse recovery. On the contrary, the land of lower bounds for RIP
constants remains uncultivated. Lower bounds of RIP constants, if exist, can be
interpreted as the fundamental limit aspect of successful sparse recovery. In
this paper, the lower bound of RIP constants Gaussian random matrices are
derived, along with a guide for generalization to sub-Gaussian random matrices.
This provides a new proof of the fundamental limit that the minimal number of
measurements needed to enforce the RIP of order $s$ is $\Omega(s\log({\rm
e}N/s))$, which is more straight-forward than the classical Gelfand width
argument. Furthermore, in the proof, we propose a useful technical tool
featuring the concentration phenomenon for top-$k$ sum of a sequence of i.i.d.
random variables, which is closely related to mainstream problems in statistics
and is of independent interest.
","[{'version': 'v1', 'created': 'Sat, 13 Jul 2019 11:42:34 GMT'}]",2020-07-15,"[['Li', 'Gen', ''], ['Xu', 'Xingyu', ''], ['Gu', 'Yuantao', '']]","['Lower bound', 'compressed sensing', 'order statistics', 'restricted isometry']"
4086,1711.06663,Mart\'in Villanueva,Mart\'in Villanueva and Mauricio Araya,"Multiresolution and Hierarchical Analysis of Astronomical Spectroscopic
  Cubes using 3D Discrete Wavelet Transform","Presented at the 8th International Conference on Pattern Recognition
  Systems, Madrid-Spain, 2017",,10.1049/cp.2017.0145,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The intrinsically hierarchical and blended structure of interstellar
molecular clouds, plus the always increasing resolution of astronomical
instruments, demand advanced and automated pattern recognition techniques for
identifying and connecting source components in spectroscopic cubes. We extend
the work done in multiresolution analysis using Wavelets for astronomical 2D
images to 3D spectroscopic cubes, combining the results with the Dendrograms
approach to offer a hierarchical representation of connections between sources
at different scale levels. We test our approach in real data from the ALMA
observatory, exploring different Wavelet families and assessing the main
parameter for source identification (i.e., RMS) at each level. Our approach
shows that is feasible to perform multiresolution analysis for the spatial and
frequency domains simultaneously rather than analyzing each spectral channel
independently.
","[{'version': 'v1', 'created': 'Fri, 17 Nov 2017 18:37:00 GMT'}, {'version': 'v2', 'created': 'Sat, 25 Nov 2017 20:51:45 GMT'}]",2017-11-28,"[['Villanueva', 'Martín', ''], ['Araya', 'Mauricio', '']]","['Source Identification', 'Multiresolution Analysis', 'Wavelets', 'Hierarchical Relations']"
4087,1306.0404,Jun He,"Jun He, Dejiao Zhang, Laura Balzano, Tao Tao",Iterative Grassmannian Optimization for Robust Image Alignment,"Preprint submitted to the special issue of the Image and Vision
  Computing Journal on the theme ""The Best of Face and Gesture 2013""","Image and Vision Computing, 32(10), 800-813, 2014",10.1016/j.imavis.2014.02.015,,cs.CV math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robust high-dimensional data processing has witnessed an exciting development
in recent years, as theoretical results have shown that it is possible using
convex programming to optimize data fit to a low-rank component plus a sparse
outlier component. This problem is also known as Robust PCA, and it has found
application in many areas of computer vision. In image and video processing and
face recognition, the opportunity to process massive image databases is
emerging as people upload photo and video data online in unprecedented volumes.
However, data quality and consistency is not controlled in any way, and the
massiveness of the data poses a serious computational challenge. In this paper
we present t-GRASTA, or ""Transformed GRASTA (Grassmannian Robust Adaptive
Subspace Tracking Algorithm)"". t-GRASTA iteratively performs incremental
gradient descent constrained to the Grassmann manifold of subspaces in order to
simultaneously estimate a decomposition of a collection of images into a
low-rank subspace, a sparse part of occlusions and foreground objects, and a
transformation such as rotation or translation of the image. We show that
t-GRASTA is 4 $\times$ faster than state-of-the-art algorithms, has half the
memory requirement, and can achieve alignment for face images as well as
jittered camera surveillance images.
","[{'version': 'v1', 'created': 'Mon, 3 Jun 2013 13:49:14 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Jun 2013 14:08:47 GMT'}]",2015-04-21,"[['He', 'Jun', ''], ['Zhang', 'Dejiao', ''], ['Balzano', 'Laura', ''], ['Tao', 'Tao', '']]","['Robust subspace learning', 'Grassmannian optimization', 'Imagealignment', 'ADMM (Alternating Direction Method of Multipliers)']"
4088,1606.09452,Bartlomiej Placzek,Bartlomiej Placzek and Marcin Bernas,"Data Suppression Algorithms for Surveillance Applications of Wireless
  Sensor and Actor Networks",,"Communications in Computer and Information Science, vol. 522, pp.
  23-32, Springer International Publishing, 2015",10.1007/978-3-319-19419-6_3,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces algorithms for surveillance applications of wireless
sensor and actor networks (WSANs) that reduce communication cost by suppressing
unnecessary data transfers. The objective of the considered WSAN system is to
capture and eliminate distributed targets in the shortest possible time.
Computational experiments were performed to evaluate effectiveness of the
proposed algorithms. The experimental results show that a considerable
reduction of the communication costs together with a performance improvement of
the WSAN system can be obtained by using the communication algorithms that are
based on spatiotemporal and decision aware suppression methods.
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2016 12:18:01 GMT'}]",2016-07-01,"[['Placzek', 'Bartlomiej', ''], ['Bernas', 'Marcin', '']]","['wireless sensor and actor networks', 'data suppression', 'targettracking', 'surveillance applications']"
4089,1110.0209,Carlos Granell,Alain Tamayo and Carlos Granell and Joaqu\'in Huerta,Dealing with large schema sets in mobile SOS-based applications,"9 pages, 2 tables, 7 figures","COM.Geo '11 Proceedings of the 2nd International Conference on
  Computing for Geospatial Research & Applications, ACM, no 16, 2011",10.1145/1999320.1999336,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although the adoption of OGC Web Services for server, desktop and web
applications has been successful, its penetration in mobile devices has been
slow. One of the main reasons is the performance problems associated with XML
processing as it consumes a lot of memory and processing time, which are scarce
resources in a mobile device. In this paper we propose an algorithm to generate
efficient code for XML data binding for mobile SOS-based applications. The
algorithm take advantage of the fact that individual implementations use only
some portions of the standards' schemas, which allows the simplification of
large XML schema sets in an application-specific manner by using a subset of
XML instance files conforming to these schemas.
","[{'version': 'v1', 'created': 'Sun, 2 Oct 2011 18:08:34 GMT'}]",2011-10-04,"[['Tamayo', 'Alain', ''], ['Granell', 'Carlos', ''], ['Huerta', 'Joaquín', '']]","['XML Schema', 'Web Services', 'Geospatial Information', 'XMLData Binding', 'Sensor Observation Services']"
4090,1307.2560,Tejaswi Agarwal,"Saurabh Jha, Tejaswi Agarwal and B. Rajesh Kanna","Exploiting Data Parallelism in the yConvex Hypergraph Algorithm for
  Image Representation using GPGPUs","1 page, 1 figure published in Proceedings of the 27th ACM
  International Conference on Supercomputing, ICS 2013, Eugene, Oregon, USA",ACM 978-1-4503-2130-3/13/06 2013,,,cs.DC cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To define and identify a region-of-interest (ROI) in a digital image, the
shape descriptor of the ROI has to be described in terms of its boundary
characteristics. To address the generic issues of contour tracking, the yConvex
Hypergraph (yCHG) model was proposed by Kanna et al [1]. In this work, we
propose a parallel approach to implement the yCHG model by exploiting massively
parallel cores of NVIDIA's Compute Unified Device Architecture (CUDA). We
perform our experiments on the MODIS satellite image database by NASA, and
based on our analysis we observe that the performance of the serial
implementation is better on smaller images, but once the threshold is achieved
in terms of image resolution, the parallel implementation outperforms its
sequential counterpart by 2 to 10 times (2x-10x). We also conclude that an
increase in the number of hyperedges in the ROI of a given size does not impact
the performance of the overall algorithm.
","[{'version': 'v1', 'created': 'Sun, 23 Jun 2013 22:31:49 GMT'}]",2013-07-10,"[['Jha', 'Saurabh', ''], ['Agarwal', 'Tejaswi', ''], ['Kanna', 'B. Rajesh', '']]","['Parallel Processing', 'GPGPU', 'Image Analysis']"
4091,1303.5870,Delgado Lopez-Cozar emilio,"Emilio Delgado Lopez-Cozar, Alvaro Cabezas-Clavijo","Ranking journals: Could Google Scholar Metrics be an alternative to
  Journal Citation Reports and Scimago Journal Rank?","26 pages, 5 tables","Delgado-Lopez-Cozar, Emilio and Cabezas-Clavijo, Alvaro (2013).
  Ranking journals: could Google Scholar Metrics be an alternative to Journal
  Citation Reports and Scimago Journal Rank? Learned Publishing, 26(2), 101-114",10.1087/20130206,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The launch of Google Scholar Metrics as a tool for assessing scientific
journals may be serious competition for Thomson Reuters Journal Citation
Reports, and for Scopus powered Scimago Journal Rank. A review of these
bibliometric journal evaluation products is performed. We compare their main
characteristics from different approaches: coverage, indexing policies, search
and visualization, bibliometric indicators, results analysis options, economic
cost and differences in their ranking of journals. Despite its shortcomings,
Google Scholar Metrics is a helpful tool for authors and editors in identifying
core journals. As an increasingly useful tool for ranking scientific journals,
it may also challenge established journals products
","[{'version': 'v1', 'created': 'Sat, 23 Mar 2013 17:44:50 GMT'}]",2013-03-26,"[['Lopez-Cozar', 'Emilio Delgado', ''], ['Cabezas-Clavijo', 'Alvaro', '']]","['Google Scholar Metrics', 'Journal Citation Reports', 'Scimago Journal Rank', 'GSM', 'JCR', 'SJR', 'Google']"
4092,1411.2212,Mehdi Masoudi,"Mehdi Masoudi, Milad Mazaheri, Aliakbar Rezaei and Keivan Navi","Designing high-speed, low-power full adder cells based on carbon
  nanotube technology","13 Pages, 13 Figures, 2 Tables",,10.5121/vlsic.2014.5503,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents novel high speed and low power full adder cells based
on carbon nanotube field effect transistor (CNFET). Four full adder cells are
proposed in this article. First one (named CN9P4G) and second one (CN9P8GBUFF)
utilizes 13 and 17 CNFETs respectively. Third design that we named CN10PFS uses
only 10 transistors and is full swing. Finally, CN8P10G uses 18 transistors and
divided into two modules, causing Sum and Cout signals are produced in a
parallel manner. All inputs have been used straight, without inverting. These
designs also used the special feature of CNFET that is controlling the
threshold voltage by adjusting the diameters of CNFETs to achieve the best
performance and right voltage levels. All simulation performed using Synopsys
HSPICE software and the proposed designs are compared to other classical and
modern CMOS and CNFET-based full adder cells in terms of delay, power
consumption and power delay product.
","[{'version': 'v1', 'created': 'Sun, 9 Nov 2014 09:26:43 GMT'}]",2014-11-11,"[['Masoudi', 'Mehdi', ''], ['Mazaheri', 'Milad', ''], ['Rezaei', 'Aliakbar', ''], ['Navi', 'Keivan', '']]","['Full Adder', 'CNT', 'Carbon Nanotube Field Effect Transistor', 'High Speed', 'Low Power', 'High Performance & Power Delay Product']"
4093,0911.0130,Graham Norton,Graham H. Norton,Minimal Polynomial Algorithms for Finite Sequences,"Section 2 added, remarks and references expanded. To appear in IEEE
  Transactions on Information Theory.",,10.1109/TIT.2010.2054150,,cs.IT cs.DM cs.SC math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that a straightforward rewrite of a known minimal polynomial
algorithm yields a simpler version of a recent algorithm of A. Salagean.
","[{'version': 'v1', 'created': 'Mon, 2 Nov 2009 04:06:37 GMT'}, {'version': 'v2', 'created': 'Mon, 9 Nov 2009 01:45:52 GMT'}, {'version': 'v3', 'created': 'Wed, 17 Mar 2010 05:12:49 GMT'}]",2016-11-17,"[['Norton', 'Graham H.', '']]","['Berlekamp-Massey algorithm', 'characteristic polynomial', 'finite sequence', 'minimal polynomial']"
4094,1807.06100,Suhad Faisal Behadili,"Suhad Faisal Behadili, Cyrille Bertelle, and Loay E. George",Human Trajectories Characteristics,arXiv admin note: text overlap with arXiv:1807.04865,"ISBN 978-93-84422-51-6 Proceedings of 2016 International
  Conference on Urban Planning, Transport and Construction Engineering
  (ICUPTCE'16), Pattaya, Jan. 2-3, 2016 pp. 30-36",10.17758/UR.U0116318,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Communication devices (mobile networks, social media platforms) are produced
digital traces for their users either voluntarily or not. This type of
collective data can give powerful indications on their effect on urban systems
design and development. For understanding the collective human behavior of
urban city, the modeling techniques could be used. In this study the most
important feature of human mobility is considered, which is the radius of
gyration . This parameter is used to measure how (far /frequent) the
individuals are shift inside specific observed region.
","[{'version': 'v1', 'created': 'Fri, 13 Jul 2018 00:10:49 GMT'}]",2018-07-18,"[['Behadili', 'Suhad Faisal', ''], ['Bertelle', 'Cyrille', ''], ['George', 'Loay E.', '']]","['modelling', 'Armada', 'probability distribution', 'radius of gyration']"
4095,1504.06474,Weifeng Liu,"Weifeng Liu, Brian Vinter","Speculative Segmented Sum for Sparse Matrix-Vector Multiplication on
  Heterogeneous Processors","22 pages, 8 figures, Published at Parallel Computing (PARCO)",,10.1016/j.parco.2015.04.004,,cs.MS cs.DC math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sparse matrix-vector multiplication (SpMV) is a central building block for
scientific software and graph applications. Recently, heterogeneous processors
composed of different types of cores attracted much attention because of their
flexible core configuration and high energy efficiency. In this paper, we
propose a compressed sparse row (CSR) format based SpMV algorithm utilizing
both types of cores in a CPU-GPU heterogeneous processor. We first
speculatively execute segmented sum operations on the GPU part of a
heterogeneous processor and generate a possibly incorrect results. Then the CPU
part of the same chip is triggered to re-arrange the predicted partial sums for
a correct resulting vector. On three heterogeneous processors from Intel, AMD
and nVidia, using 20 sparse matrices as a benchmark suite, the experimental
results show that our method obtains significant performance improvement over
the best existing CSR-based SpMV algorithms. The source code of this work is
downloadable at https://github.com/bhSPARSE/Benchmark_SpMV_using_CSR
","[{'version': 'v1', 'created': 'Fri, 24 Apr 2015 11:23:38 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Sep 2015 09:59:24 GMT'}]",2015-09-15,"[['Liu', 'Weifeng', ''], ['Vinter', 'Brian', '']]","['Sparse matrices', 'Sparse matrix-vector multiplication', 'Compressed sparse row', 'Speculativeexecution', 'Segmented sum', 'Heterogeneous processor']"
4096,1802.09007,Du\v{s}an Knop,Kate\v{r}ina Altmanov\'a and Du\v{s}an Knop and Martin Kouteck\'y,Evaluating and Tuning n-fold Integer Programming,24 pages,,10.4230/LIPIcs.SEA.2018.10,,cs.DS cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, algorithmic breakthroughs in stringology, computational
social choice, scheduling, etc., were achieved by applying the theory of
so-called $n$-fold integer programming. An $n$-fold integer program (IP) has a
highly uniform block structured constraint matrix. Hemmecke, Onn, and Romanchuk
[Math. Programming, 2013] showed an algorithm with runtime $a^{O(rst + r^2s)}
n^3$, where $a$ is the largest coefficient, $r,s$, and $t$ are dimensions of
blocks of the constraint matrix and $n$ is the total dimension of the IP; thus,
an algorithm efficient if the blocks are of small size and with small
coefficients. The algorithm works by iteratively improving a feasible solution
with augmenting steps, and $n$-fold IPs have the special property that
augmenting steps are guaranteed to exist in a not-too-large neighborhood.
  We have implemented the algorithm and learned the following along the way.
The original algorithm is practically unusable, but we discover a series of
improvements which make its evaluation possible. Crucially, we observe that a
certain constant in the algorithm can be treated as a tuning parameter, which
yields an efficient heuristic (essentially searching in a
smaller-than-guaranteed neighborhood). Furthermore, the algorithm uses an
overly expensive strategy to find a ""best"" step, while finding only an
""approximatelly best"" step is much cheaper, yet sufficient for quick
convergence. Using this insight, we improve the asymptotic dependence on $n$
from $n^3$ to $n^2 \log n$.
  We show that decreasing the tuning parameter initially leads to an increased
number of iterations needed for convergence and eventually to getting stuck in
local optima, as expected. However, surprisingly small values of the parameter
already exhibit good behavior. Second, our new strategy for finding
""approximatelly best"" steps wildly outperforms the original construction.
","[{'version': 'v1', 'created': 'Sun, 25 Feb 2018 13:59:12 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Apr 2019 12:06:51 GMT'}]",2019-04-08,"[['Altmanová', 'Kateřina', ''], ['Knop', 'Dušan', ''], ['Koutecký', 'Martin', '']]","['n-fold integer programming', 'integer programming', 'analysis of algorithms', 'primal heuristic', 'local search']"
4097,1504.03871,Saeed Reza Kheradpisheh,"Saeed Reza Kheradpisheh, Mohammad Ganjtabesh, Timoth\'ee Masquelier","Bio-inspired Unsupervised Learning of Visual Features Leads to Robust
  Invariant Object Recognition",,Neurocomputing 205 (2016) 382-392,10.1016/j.neucom.2016.04.029,,cs.CV q-bio.NC,http://creativecommons.org/licenses/by/4.0/,"  Retinal image of surrounding objects varies tremendously due to the changes
in position, size, pose, illumination condition, background context, occlusion,
noise, and nonrigid deformations. But despite these huge variations, our visual
system is able to invariantly recognize any object in just a fraction of a
second. To date, various computational models have been proposed to mimic the
hierarchical processing of the ventral visual pathway, with limited success.
Here, we show that the association of both biologically inspired network
architecture and learning rule significantly improves the models' performance
when facing challenging invariant object recognition problems. Our model is an
asynchronous feedforward spiking neural network. When the network is presented
with natural images, the neurons in the entry layers detect edges, and the most
activated ones fire first, while neurons in higher layers are equipped with
spike timing-dependent plasticity. These neurons progressively become selective
to intermediate complexity visual features appropriate for object
categorization. The model is evaluated on 3D-Object and ETH-80 datasets which
are two benchmarks for invariant object recognition, and is shown to outperform
state-of-the-art models, including DeepConvNet and HMAX. This demonstrates its
ability to accurately recognize different instances of multiple object classes
even under various appearance conditions (different views, scales, tilts, and
backgrounds). Several statistical analysis techniques are used to show that our
model extracts class specific and highly informative features.
","[{'version': 'v1', 'created': 'Wed, 15 Apr 2015 11:47:21 GMT'}, {'version': 'v2', 'created': 'Sun, 3 May 2015 12:40:59 GMT'}, {'version': 'v3', 'created': 'Tue, 28 Jun 2016 10:54:22 GMT'}]",2017-02-14,"[['Kheradpisheh', 'Saeed Reza', ''], ['Ganjtabesh', 'Mohammad', ''], ['Masquelier', 'Timothée', '']]","['View-Invariant Object Recognition', 'Visual Cortex', 'STDP', 'Spiking Neurons', 'TemporalCoding']"
4098,1705.01151,Elisabeth de Turckheim,"Lorenzo Cassi, Ag\'enor Lahatte, Ismael Rafols, Pierre Sautier,
  \'Elisabeth de Turckheim","Improving fitness: Mapping research priorities against societal needs on
  obesity","37 pages, 10 figures. Section 3: We partly revised the text
  describing the first topic map (Fig. 2). We changed Fig. 4 (same data).
  Section 5: We added a warning against a too rapid political interpretation of
  the lack of similarity between the two maps. Section 7: We acknowledged that
  parameter choices are questionable and discussed this issue",Journal of Informetrics 11 (2017) 1095-1113,10.1016/j.joi.2017.09.010,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Science policy is increasingly shifting towards an emphasis in societal
problems or grand challenges. As a result, new evaluative tools are needed to
help assess not only the knowledge production side of research programmes or
organisations, but also the articulation of research agendas with societal
needs. In this paper, we present an exploratory investigation of science supply
and societal needs on the grand challenge of obesity -an emerging health
problem with enormous social costs. We illustrate a potential approach that
uses topic modelling to explore: (a) how scientific publications can be used to
describe existing priorities in science production; (b) how records of
questions posed in the European parliament can be used as an instance of
mapping discourse of social needs; (c) how the comparison between the two may
show (mis)alignments between societal concerns and scientific outputs. While
this is a technical exercise, we propose that this type of mapping methods can
be useful for informing strategic planning and evaluation in funding agencies.
","[{'version': 'v1', 'created': 'Tue, 2 May 2017 19:29:44 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Oct 2017 13:22:37 GMT'}]",2017-10-16,"[['Cassi', 'Lorenzo', ''], ['Lahatte', 'Agénor', ''], ['Rafols', 'Ismael', ''], ['Sautier', 'Pierre', ''], ['de Turckheim', 'Élisabeth', '']]","['research agenda', 'science mapping', 'societal needs', 'obesity', 'topic modeling']"
4099,1610.01925,Mohamad Ivan Fanany,"L. M. Rasdi Rere, Mohamad Ivan Fanany, and Aniati Murni Arymurthy",Metaheuristic Algorithms for Convolution Neural Network,"Article ID 1537325, 13 pages. Received 29 January 2016; Revised 15
  April 2016; Accepted 10 May 2016. Academic Editor: Martin Hagan. in Hindawi
  Publishing. Computational Intelligence and Neuroscience Volume 2016 (2016)","Computational Intelligence and Neuroscience Volume 2016 (2016),
  Article ID 1537325, 13 pages",10.1155/2016/1537325,1537325,cs.CV cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A typical modern optimization technique is usually either heuristic or
metaheuristic. This technique has managed to solve some optimization problems
in the research area of science, engineering, and industry. However,
implementation strategy of metaheuristic for accuracy improvement on
convolution neural networks (CNN), a famous deep learning method, is still
rarely investigated. Deep learning relates to a type of machine learning
technique, where its aim is to move closer to the goal of artificial
intelligence of creating a machine that could successfully perform any
intellectual tasks that can be carried out by a human. In this paper, we
propose the implementation strategy of three popular metaheuristic approaches,
that is, simulated annealing, differential evolution, and harmony search, to
optimize CNN. The performances of these metaheuristic methods in optimizing CNN
on classifying MNIST and CIFAR dataset were evaluated and compared.
Furthermore, the proposed methods are also compared with the original CNN.
Although the proposed methods show an increase in the computation time, their
accuracy has also been improved (up to 7.14 percent).
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2016 16:11:06 GMT'}]",2016-10-10,"[['Rere', 'L. M. Rasdi', ''], ['Fanany', 'Mohamad Ivan', ''], ['Arymurthy', 'Aniati Murni', '']]","['metaheuristic', 'convolution neural network', 'deep learning', 'simulatedannealing', 'differential evolution', 'harmony search']"
4100,1607.00931,Ian McQuillan,Joey Eremondi and Oscar H. Ibarra and Ian McQuillan,Deletion Operations on Deterministic Families of Automata,"20 pages, accepted version to Information and Computation",,10.1016/j.ic.2017.07.009,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many different deletion operations are investigated applied to languages
accepted by one-way and two-way deterministic reversal-bounded multicounter
machines, deterministic pushdown automata, and finite automata. Operations
studied include the prefix, suffix, infix and outfix operations, as well as
left and right quotient with languages from different families. It is often
expected that language families defined from deterministic machines will not be
closed under deletion operations. However, here, it is shown that one-way
deterministic reversal-bounded multicounter languages are closed under right
quotient with languages from many different language families; even those
defined by nondeterministic machines such as the context-free languages. Also,
it is shown that when starting with one-way deterministic machines with one
counter that makes only one reversal, taking the left quotient with languages
from many different language families -- again including those defined by
nondeterministic machines such as the context-free languages -- yields only
one-way deterministic reversal-bounded multicounter languages (by increasing
the number of counters). However, if there are two more reversals on the
counter, or a second 1-reversal-bounded counter, taking the left quotient (or
even just the suffix operation) yields languages that can neither be accepted
by deterministic reversal-bounded multicounter machines, nor by 2-way
nondeterministic machines with one reversal-bounded counter.
","[{'version': 'v1', 'created': 'Mon, 4 Jul 2016 15:30:04 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Oct 2016 02:21:20 GMT'}]",2019-03-08,"[['Eremondi', 'Joey', ''], ['Ibarra', 'Oscar H.', ''], ['McQuillan', 'Ian', '']]","['Automata and Logic', 'Counter Machines', 'Deletion Operations', 'Reversal-Bounds', 'Determinism', 'Finite Automata']"
4101,1007.3159,Fabrizio Riguzzi PhD,"Marco Gavanelli and Fabrizio Riguzzi and Michela Milano and Paolo
  Cagnoli",Logic-Based Decision Support for Strategic Environmental Assessment,"17 pages, 1 figure, 26th Int'l. Conference on Logic Programming
  (ICLP'10)","Theory and Practice of Logic Programming, 26th Int'l. Conference
  on Logic Programming (ICLP'10) Special Issue, 10(4-6), 643-658, 2010",10.1017/S1471068410000335,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Strategic Environmental Assessment is a procedure aimed at introducing
systematic assessment of the environmental effects of plans and programs. This
procedure is based on the so-called coaxial matrices that define dependencies
between plan activities (infrastructures, plants, resource extractions,
buildings, etc.) and positive and negative environmental impacts, and
dependencies between these impacts and environmental receptors. Up to now, this
procedure is manually implemented by environmental experts for checking the
environmental effects of a given plan or program, but it is never applied
during the plan/program construction. A decision support system, based on a
clear logic semantics, would be an invaluable tool not only in assessing a
single, already defined plan, but also during the planning process in order to
produce an optimized, environmentally assessed plan and to study possible
alternative scenarios. We propose two logic-based approaches to the problem,
one based on Constraint Logic Programming and one on Probabilistic Logic
Programming that could be, in the future, conveniently merged to exploit the
advantages of both. We test the proposed approaches on a real energy plan and
we discuss their limitations and advantages.
","[{'version': 'v1', 'created': 'Mon, 19 Jul 2010 14:36:54 GMT'}]",2010-07-20,"[['Gavanelli', 'Marco', ''], ['Riguzzi', 'Fabrizio', ''], ['Milano', 'Michela', ''], ['Cagnoli', 'Paolo', '']]","['Strategic Environmental Assessment', 'Regional Planning', 'Constraint LogicProgramming', 'Probabilistic Logic Programming', 'Causality']"
4102,1609.01277,Christian Jacobs,"Christian T. Jacobs, Satya P. Jammy, Neil D. Sandham","OpenSBLI: A framework for the automated derivation and parallel
  execution of finite difference solvers on a range of computer architectures","Author accepted version, with a small amendment: the link in the
  ""Code Availability"" section has been updated, and now refers to the OpenSBLI
  source code repository on GitHub. Accepted for publication in the Journal of
  Computational Science on 8 November 2016",Journal of Computational Science 18 (2017) 12-23,10.1016/j.jocs.2016.11.001,,cs.MS cs.SC cs.SE physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Exascale computing will feature novel and potentially disruptive hardware
architectures. Exploiting these to their full potential is non-trivial.
Numerical modelling frameworks involving finite difference methods are
currently limited by the 'static' nature of the hand-coded discretisation
schemes and repeatedly may have to be re-written to run efficiently on new
hardware. In contrast, OpenSBLI uses code generation to derive the model's code
from a high-level specification. Users focus on the equations to solve, whilst
not concerning themselves with the detailed implementation. Source-to-source
translation is used to tailor the code and enable its execution on a variety of
hardware.
","[{'version': 'v1', 'created': 'Mon, 5 Sep 2016 10:11:31 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Nov 2016 17:17:48 GMT'}]",2016-12-06,"[['Jacobs', 'Christian T.', ''], ['Jammy', 'Satya P.', ''], ['Sandham', 'Neil D.', '']]","['High-Performance Computing', 'Code Generation', 'Computational Fluid Dynamics', 'Finite Difference Methods', 'GraphicsProcessing Units']"
4103,1303.2201,Emanuele D'Osualdo,"Emanuele D'Osualdo, Jonathan Kochems, C.-H. Luke Ong",Automatic Verification of Erlang-Style Concurrency,"12 pages plus appendix, 4 figures, 1 table. The tool is available at
  http://mjolnir.cs.ox.ac.uk/soter/",,10.1007/978-3-642-38856-9_24,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an approach to verify safety properties of Erlang-style,
higher-order concurrent programs automatically. Inspired by Core Erlang, we
introduce Lambda-Actor, a prototypical functional language with
pattern-matching algebraic data types, augmented with process creation and
asynchronous message-passing primitives. We formalise an abstract model of
Lambda-Actor programs called Actor Communicating System (ACS) which has a
natural interpretation as a vector addition system, for which some verification
problems are decidable. We give a parametric abstract interpretation framework
for Lambda-Actor and use it to build a polytime computable, flow-based,
abstract semantics of Lambda-Actor programs, which we then use to bootstrap the
ACS construction, thus deriving a more accurate abstract model of the input
program. We have constructed Soter, a tool implementation of the verification
method, thereby obtaining the first fully-automatic, infinite-state model
checker for a core fragment of Erlang. We find that in practice our abstraction
technique is accurate enough to verify an interesting range of safety
properties. Though the ACS coverability problem is Expspace-complete, Soter can
analyse these verification problems surprisingly efficiently.
","[{'version': 'v1', 'created': 'Sat, 9 Mar 2013 12:10:01 GMT'}]",2016-01-11,"[[""D'Osualdo"", 'Emanuele', ''], ['Kochems', 'Jonathan', ''], ['Ong', 'C. -H. Luke', '']]","['Verification', 'Infinite-State Model Checking', 'StaticAnalysis', 'Petri Nets', 'Erlang']"
4104,1204.1644,Abdullah Alaraj,Abdullah M. Alaraj,Optimizing One Fair Document Exchange Protocol,"12 pages, 2 figures, Journal article","International Journal of Network Security & Its Applications
  (IJNSA), Vol.4, No.1, January 2012",10.5121/ijnsa.2012.4101,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an efficient fair document exchange protocol. The
exchange of the documents will be between two parties. The protocol is based on
the verifiable and recoverable encryption of a document's key. This verifiable
and recoverable encryption of the document's key will allow one party to verify
the encrypted key. It will also ensure this party that the Semi Trusted Third
Party will be able to recover the key if the other party misbehaves. The
protocol also incorporates the concept of enforcing the honesty of one party.
The proposed protocol consists of only three messages and is more efficient
than related protocols.
","[{'version': 'v1', 'created': 'Sat, 7 Apr 2012 14:30:27 GMT'}]",2012-04-10,"[['Alaraj', 'Abdullah M.', '']]","['Fair Document Exchange', 'Fair Exchange Protocols', 'e-Commerce', 'Security', 'Protocols']"
4105,1107.1676,Riccardo Albertoni,"Monica De Martino, Riccardo Albertoni","A multilingual/multicultural semantic-based approach to improve Data
  Sharing in an SDI for Nature Conservation",,"International Journal of Spatial Data Infrastructures Research,
  2011, Vol.6, 206-233",10.2902/1725-0463.2011.06.art10,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper proposes an approach to transcend multicultural and multilingual
barriers in the use and reuse of geographical data at the European level. The
approach aims at sharing scientific terms in the field of nature conservation
with the goal of assisting different user communities with metadata compilation
and information discovery. A multi-thesauri solution is proposed, based on a
Common Thesaurus Framework for Nature Conservation, where different well-known
Knowledge Organization Systems are assembled and shared. It has been designed
according to semantic web and W3C recommendations employing SKOS standard
models and Linked Data to publish the thesauri as a whole in
machine-understandable format. The outcome is a powerful framework satisfying
the requirements of modularity and openness for further thesaurus extension and
updating, interlinking among thesauri, and exploitability from other systems.
The paper supports the employment of Linked Data to deal with terminologies in
complex domains such as nature conservation and it proposes a hands-on recipe
to publish thesauri in the framework.
","[{'version': 'v1', 'created': 'Fri, 8 Jul 2011 16:50:38 GMT'}]",2011-07-11,"[['De Martino', 'Monica', ''], ['Albertoni', 'Riccardo', '']]","['Knowledge Organization Systems', 'Linked Data', 'Nature Conservation', 'Multilingual/multicultural Issue']"
4106,1509.02604,Tsung-Hui Chang,"Tsung-Hui Chang, Wei-Cheng Liao, Mingyi Hong and Xiangfeng Wang","Asynchronous Distributed ADMM for Large-Scale Optimization- Part II:
  Linear Convergence Analysis and Numerical Performance","submitted for publication, 28 pages",,10.1109/TSP.2016.2537261,,cs.DC cs.LG cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The alternating direction method of multipliers (ADMM) has been recognized as
a versatile approach for solving modern large-scale machine learning and signal
processing problems efficiently. When the data size and/or the problem
dimension is large, a distributed version of ADMM can be used, which is capable
of distributing the computation load and the data set to a network of computing
nodes. Unfortunately, a direct synchronous implementation of such algorithm
does not scale well with the problem size, as the algorithm speed is limited by
the slowest computing nodes. To address this issue, in a companion paper, we
have proposed an asynchronous distributed ADMM (AD-ADMM) and studied its
worst-case convergence conditions. In this paper, we further the study by
characterizing the conditions under which the AD-ADMM achieves linear
convergence. Our conditions as well as the resulting linear rates reveal the
impact that various algorithm parameters, network delay and network size have
on the algorithm performance. To demonstrate the superior time efficiency of
the proposed AD-ADMM, we test the AD-ADMM on a high-performance computer
cluster by solving a large-scale logistic regression problem.
","[{'version': 'v1', 'created': 'Wed, 9 Sep 2015 02:07:27 GMT'}]",2016-05-04,"[['Chang', 'Tsung-Hui', ''], ['Liao', 'Wei-Cheng', ''], ['Hong', 'Mingyi', ''], ['Wang', 'Xiangfeng', '']]","['− Distributed optimization', 'ADMM', 'Asynchronous', 'Consensus optimization']"
4107,1309.2086,Pedro Neto,"Pedro Neto, Nuno Mendes, Ricardo Ara\'ujo, J. Norberto Pires, A. Paulo
  Moreira","High-level robot programming based on CAD: dealing with unpredictable
  environments",Industrial Robot: An International Journal,"Industrial Robot: An International Journal, Vol. 39 Iss: 3, 2012,
  pp.294 - 303",10.1108/01439911211217125,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose - The purpose of this paper is to present a CAD-based human-robot
interface that allows non-expert users to teach a robot in a manner similar to
that used by human beings to teach each other.
  Design/methodology/approach - Intuitive robot programming is achieved by
using CAD drawings to generate robot programs off-line. Sensory feedback allows
minimization of the effects of uncertainty, providing information to adjust the
robot paths during robot operation.
  Findings - It was found that it is possible to generate a robot program from
a common CAD drawing and run it without any major concerns about calibration or
CAD model accuracy.
  Research limitations/implications - A limitation of the proposed system has
to do with the fact that it was designed to be used for particular
technological applications.
  Practical implications - Since most manufacturing companies have CAD packages
in their facilities today, CAD-based robot programming may be a good option to
program robots without the need for skilled robot programmers.
  Originality/value - The paper proposes a new CAD-based robot programming
system. Robot programs are directly generated from a CAD drawing running on a
commonly available 3D CAD package (Autodesk Inventor) and not from a
commercial, computer aided robotics (CAR) software, making it a simple CAD
integrated solution. This is a low-cost and low-setup time system where no
advanced robot programming skills are required to operate it. In summary, robot
programs are generated with a high-level of abstraction from the robot
language.
","[{'version': 'v1', 'created': 'Mon, 9 Sep 2013 09:46:38 GMT'}]",2013-09-10,"[['Neto', 'Pedro', ''], ['Mendes', 'Nuno', ''], ['Araújo', 'Ricardo', ''], ['Pires', 'J. Norberto', ''], ['Moreira', 'A. Paulo', '']]","['CAD', 'Industrial Robotics', 'High-Level Programming', 'Sensory Feedback', 'Unpredictable Environments']"
4108,1711.01904,Christian Ikenmeyer,"Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir
  Lysikov, Andrey Mokhov, Karteek Sreenivasaiah",On the complexity of hazard-free circuits,,"J. ACM 66(4), Article 25 (2019)",10.1145/3320123,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of constructing hazard-free Boolean circuits dates back to the
1940s and is an important problem in circuit design. Our main lower-bound
result unconditionally shows the existence of functions whose circuit
complexity is polynomially bounded while every hazard-free implementation is
provably of exponential size. Previous lower bounds on the hazard-free
complexity were only valid for depth 2 circuits. The same proof method yields
that every subcubic implementation of Boolean matrix multiplication must have
hazards.
  These results follow from a crucial structural insight: Hazard-free
complexity is a natural generalization of monotone complexity to all (not
necessarily monotone) Boolean functions. Thus, we can apply known monotone
complexity lower bounds to find lower bounds on the hazard-free complexity. We
also lift these methods from the monotone setting to prove exponential
hazard-free complexity lower bounds for non-monotone functions.
  As our main upper-bound result we show how to efficiently convert a Boolean
circuit into a bounded-bit hazard-free circuit with only a polynomially large
blow-up in the number of gates. Previously, the best known method yielded
exponentially large circuits in the worst case, so our algorithm gives an
exponential improvement.
  As a side result we establish the NP-completeness of several hazard detection
problems.
","[{'version': 'v1', 'created': 'Mon, 6 Nov 2017 14:27:46 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Apr 2018 21:36:35 GMT'}]",2021-01-01,"[['Ikenmeyer', 'Christian', ''], ['Komarath', 'Balagopal', ''], ['Lenzen', 'Christoph', ''], ['Lysikov', 'Vladimir', ''], ['Mokhov', 'Andrey', ''], ['Sreenivasaiah', 'Karteek', '']]","['Hazards', 'Boolean circuits', 'Monotone circuits', 'computational complexity']"
4109,1504.06582,Alexander Gribov,Alexander Gribov,Approximate Fitting of a Circular Arc When Two Points Are Known,"15 pages, 4 figures, extended abstract published at the conference","Approximate Fitting a Circular Arc When Two Points Are Known, in
  2017 14th IAPR International Conference on Document Analysis and Recognition
  (ICDAR), vol. 02, November 2017, pp. 15-16",10.1109/ICDAR.2017.255,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The task of approximating points with circular arcs is performed in many
applications, such as polyline compression, noise filtering, and feature
recognition. However, the development of algorithms that perform a significant
amount of circular arcs fitting requires an efficient way of fitting circular
arcs with complexity O(1). The elegant solution to this task based on an
eigenvector problem for a square nonsymmetrical matrix is described in [1]. For
the compression algorithm described in [2], it is necessary to solve this task
when two points on the arc are known. This paper describes a different approach
to efficiently fitting the arcs and solves the task when one or two points are
known.
","[{'version': 'v1', 'created': 'Fri, 24 Apr 2015 17:52:30 GMT'}, {'version': 'v2', 'created': 'Tue, 5 May 2015 22:50:45 GMT'}, {'version': 'v3', 'created': 'Thu, 11 Oct 2018 01:28:42 GMT'}]",2018-10-12,"[['Gribov', 'Alexander', '']]","['arc fitting', 'optimization', 'compression', 'generalization']"
4110,1304.3745,Khadoudja Ghanem,Khadoudja Ghanem,Towards more accurate clustering method by using dynamic time warping,"12 pages, 1 figure, 2 tables, journal. arXiv admin note: text overlap
  with arXiv:1206.3509 by other authors","International Journal of Data Mining & Knowledge Management
  Process (IJDKP) Vol.3, No.2, March 2013",10.5121/ijdkp.2013.3207,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An intrinsic problem of classifiers based on machine learning (ML) methods is
that their learning time grows as the size and complexity of the training
dataset increases. For this reason, it is important to have efficient
computational methods and algorithms that can be applied on large datasets,
such that it is still possible to complete the machine learning tasks in
reasonable time. In this context, we present in this paper a more accurate
simple process to speed up ML methods. An unsupervised clustering algorithm is
combined with Expectation, Maximization (EM) algorithm to develop an efficient
Hidden Markov Model (HMM) training. The idea of the proposed process consists
of two steps. In the first step, training instances with similar inputs are
clustered and a weight factor which represents the frequency of these instances
is assigned to each representative cluster. Dynamic Time Warping technique is
used as a dissimilarity function to cluster similar examples. In the second
step, all formulas in the classical HMM training algorithm (EM) associated with
the number of training instances are modified to include the weight factor in
appropriate terms. This process significantly accelerates HMM training while
maintaining the same initial, transition and emission probabilities matrixes as
those obtained with the classical HMM training algorithm. Accordingly, the
classification accuracy is preserved. Depending on the size of the training
set, speedups of up to 2200 times is possible when the size is about 100.000
instances. The proposed approach is not limited to training HMMs, but it can be
employed for a large variety of MLs methods.
","[{'version': 'v1', 'created': 'Fri, 12 Apr 2013 22:23:53 GMT'}]",2013-04-16,"[['Ghanem', 'Khadoudja', '']]","['Dynamic Time Warping', 'clustering', 'Hidden Markov Models']"
4111,1304.3313,Hema Latha S,"Hemalatha S, U Dinesh Acharya, Renuka A, Priya R. Kamath",A Secure Color Image Steganography In Transform Domain,8 pages,"International Journal on Cryptography and Information Security
  (IJCIS), Vol.3, No.1, March 2013",10.5121/ijcis.2013.3103,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Steganography is the art and science of covert communication. The secret
information can be concealed in content such as image, audio, or video. This
paper provides a novel image steganography technique to hide both image and key
in color cover image using Discrete Wavelet Transform (DWT) and Integer Wavelet
Transform (IWT). There is no visual difference between the stego image and the
cover image. The extracted image is also similar to the secret image. This is
proved by the high PSNR (Peak Signal to Noise Ratio), value for both stego and
extracted secret image. The results are compared with the results of similar
techniques and it is found that the proposed technique is simple and gives
better PSNR values than others.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2013 14:20:28 GMT'}]",2013-04-12,"[['S', 'Hemalatha', ''], ['Acharya', 'U Dinesh', ''], ['A', 'Renuka', ''], ['Kamath', 'Priya R.', '']]","['Steganography', 'DWT', 'IWT', 'PSNR', 'YCbCr']"
4112,1701.07172,Prabhat Kushwaha,Prabhat Kushwaha and Ayan Mahalanobis,A Probabilistic Baby-Step Giant-Step Algorithm,,SECRYPT 2017,10.5220/0006396304010406,ISBN 978-989-758-259-2,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a new algorithm to solve the discrete logarithm problem is
presented which is similar to the usual baby-step giant-step algorithm. Our
algorithm exploits the order of the discrete logarithm in the multiplicative
group of a finite field. Using randomization with parallelized collision
search, our algorithm indicates some weakness in NIST curves over prime fields
which are considered to be the most conservative and safest curves among all
NIST curves.
","[{'version': 'v1', 'created': 'Wed, 25 Jan 2017 06:03:28 GMT'}]",2020-11-17,"[['Kushwaha', 'Prabhat', ''], ['Mahalanobis', 'Ayan', '']]","['Discrete logarithm problem', 'baby-step giant-step algorithm', 'NISTcurves over prime fields', 'parallelized collision search']"
4113,2204.14047,Wei Sun,"Wei Sun, Xiongkuo Min, Wei Lu, Guangtao Zhai","A Deep Learning based No-reference Quality Assessment Model for UGC
  Videos",Accepted by ACM MM 2022,"Proceedings of the 30th ACM International Conference on Multimedia
  (2022) 856-865",10.1145/3503161.3548329,,cs.CV cs.MM eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quality assessment for User Generated Content (UGC) videos plays an important
role in ensuring the viewing experience of end-users. Previous UGC video
quality assessment (VQA) studies either use the image recognition model or the
image quality assessment (IQA) models to extract frame-level features of UGC
videos for quality regression, which are regarded as the sub-optimal solutions
because of the domain shifts between these tasks and the UGC VQA task. In this
paper, we propose a very simple but effective UGC VQA model, which tries to
address this problem by training an end-to-end spatial feature extraction
network to directly learn the quality-aware spatial feature representation from
raw pixels of the video frames. We also extract the motion features to measure
the temporal-related distortions that the spatial features cannot model. The
proposed model utilizes very sparse frames to extract spatial features and
dense frames (i.e. the video chunk) with a very low spatial resolution to
extract motion features, which thereby has low computational complexity. With
the better quality-aware features, we only use the simple multilayer perception
layer (MLP) network to regress them into the chunk-level quality scores, and
then the temporal average pooling strategy is adopted to obtain the video-level
quality score. We further introduce a multi-scale quality fusion strategy to
solve the problem of VQA across different spatial resolutions, where the
multi-scale weights are obtained from the contrast sensitivity function of the
human visual system. The experimental results show that the proposed model
achieves the best performance on five popular UGC VQA databases, which
demonstrates the effectiveness of the proposed model. The code will be publicly
available.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2022 12:45:21 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Oct 2022 07:26:06 GMT'}]",2022-10-21,"[['Sun', 'Wei', ''], ['Min', 'Xiongkuo', ''], ['Lu', 'Wei', ''], ['Zhai', 'Guangtao', '']]","['video quality assessment', 'UGC videos', 'deep learning', 'feature fusion']"
4114,1602.08857,Changming Li,"Changming Li, Jun Zhang, Shenghui Song, and K. B. Letaief",Selective Uplink Training for Massive MIMO Systems,"6 pages, 3 figures, accepted to IEEE International Conference on
  Communications (ICC) 2016, Kuala Lumpur, Malaysia",,10.1109/ICC.2016.7511214,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As a promising technique to meet the drastically growing demand for both high
throughput and uniform coverage in the fifth generation (5G) wireless networks,
massive multiple-input multiple-output (MIMO) systems have attracted
significant attention in recent years. However, in massive MIMO systems, as the
density of mobile users (MUs) increases, conventional uplink training methods
will incur prohibitively high training overhead, which is proportional to the
number of MUs. In this paper, we propose a selective uplink training method for
massive MIMO systems, where in each channel block only part of the MUs will
send uplink pilots for channel training, and the channel states of the
remaining MUs are predicted from the estimates in previous blocks, taking
advantage of the channels' temporal correlation. We propose an efficient
algorithm to dynamically select the MUs to be trained within each block and
determine the optimal uplink training length. Simulation results show that the
proposed training method provides significant throughput gains compared to the
existing methods, while much lower estimation complexity is achieved. It is
observed that the throughput gain becomes higher as the MU density increases.
","[{'version': 'v1', 'created': 'Mon, 29 Feb 2016 08:27:51 GMT'}]",2016-11-17,"[['Li', 'Changming', ''], ['Zhang', 'Jun', ''], ['Song', 'Shenghui', ''], ['Letaief', 'K. B.', '']]","['Uplink massive MIMO', 'selective training', 'temporal correlation', 'dynamic user selection']"
4115,1612.01870,Etienne Moutot,"Mika Hirvensalo, Etienne Moutot, Abuzer Yakary{\i}lmaz",On the computational power of affine automata,12 pages. Accepted to LATA2017,,10.1007/978-3-319-53733-7_30,,cs.FL,http://creativecommons.org/licenses/by/4.0/,"  We investigate the computational power of affine automata (AfAs) introduced
in [4]. In particular, we present a simpler proof for how to change the
cutpoint for any affine language and a method how to reduce error in bounded
error case. Moreover, we address to the question of [4] by showing that any
affine language can be recognized by an AfA with certain limitation on the
entries of affine states and transition matrices. Lastly, we present the first
languages shown to be not recognized by AfAs with bounded-error.
","[{'version': 'v1', 'created': 'Tue, 6 Dec 2016 15:36:57 GMT'}]",2018-06-19,"[['Hirvensalo', 'Mika', ''], ['Moutot', 'Etienne', ''], ['Yakaryılmaz', 'Abuzer', '']]","['non-classical models of automata', 'affine automata', 'cutpointlanguages', 'bounded error', 'compact sets', 'error reduction']"
4116,1302.1335,Raghu Anantharangachar,"Raghu Anantharangachar, Srinivasan Ramani, S Rajagopalan",Ontology Guided Information Extraction from Unstructured Text,,"International Journal of Web & Semantic Technology (IJWesT) Vol.4,
  No.1, January 2013",10.5121/ijwest.2013.4102,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we describe an approach to populate an existing ontology with
instance information present in the natural language text provided as input. An
ontology is defined as an explicit conceptualization of a shared domain. This
approach starts with a list of relevant domain ontologies created by human
experts, and techniques for identifying the most appropriate ontology to be
extended with information from a given text. Then we demonstrate heuristics to
extract information from the unstructured text and for adding it as structured
information to the selected ontology. This identification of the relevant
ontology is critical, as it is used in identifying relevant information in the
text. We extract information in the form of semantic triples from the text,
guided by the concepts in the ontology. We then convert the extracted
information about the semantic class instances into Resource Description
Framework (RDF3) and append it to the existing domain ontology. This enables us
to perform more precise semantic queries over the semantic triple store thus
created. We have achieved 95% accuracy of information extraction in our
implementation.
","[{'version': 'v1', 'created': 'Wed, 6 Feb 2013 12:19:43 GMT'}]",2013-02-07,"[['Anantharangachar', 'Raghu', ''], ['Ramani', 'Srinivasan', ''], ['Rajagopalan', 'S', '']]","['Ontology', 'Information Extraction', 'Knowledge Extraction', 'Semantic web', 'Ontology Based InformationExtraction']"
4117,1303.2261,Yuantao Gu,"Yuantao Gu, Jian Jin, and Shunliang Mei",l_0 Norm Constraint LMS Algorithm for Sparse System Identification,"10 pages, 5 figures","IEEE Signal Processing Letters, 16(9):774-777, 2009",10.1109/LSP.2009.2024736,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to improve the performance of Least Mean Square (LMS) based system
identification of sparse systems, a new adaptive algorithm is proposed which
utilizes the sparsity property of such systems. A general approximating
approach on $l_0$ norm -- a typical metric of system sparsity, is proposed and
integrated into the cost function of the LMS algorithm. This integration is
equivalent to add a zero attractor in the iterations, by which the convergence
rate of small coefficients, that dominate the sparse system, can be effectively
improved. Moreover, using partial updating method, the computational complexity
is reduced. The simulations demonstrate that the proposed algorithm can
effectively improve the performance of LMS-based identification algorithms on
sparse system.
","[{'version': 'v1', 'created': 'Sat, 9 Mar 2013 19:44:29 GMT'}]",2015-06-15,"[['Gu', 'Yuantao', ''], ['Jin', 'Jian', ''], ['Mei', 'Shunliang', '']]","['adaptive filter', 'sparsity', 'l0 norm', 'Least Mean Square (LMS)']"
4118,2105.07366,Stephen MacDonell,"Solomon Mensah, Jacky Keung, Stephen G. MacDonell, Michael Franklin
  Bosu, and Kwabena Ebo Bennin","Investigating the Significance of the Bellwether Effect to Improve
  Software Effort Prediction: Further Empirical Study","Journal paper, 23 pages, 8 figures, 9 tables","IEEE Transactions on Reliability 67(3)(2018), pp.1176-1198",10.1109/TR.2018.2839718,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: In addressing how best to estimate how much effort is required to
develop software, a recent study found that using exemplary and recently
completed projects [forming Bellwether moving windows (BMW)] in software effort
prediction (SEP) models leads to relatively improved accuracy. More studies
need to be conducted to determine whether the BMW yields improved accuracy in
general, since different sizing and aging parameters of the BMW are known to
affect accuracy. Objective: To investigate the existence of exemplary projects
(Bellwethers) with defined window size and age parameters, and whether their
use in SEP improves prediction accuracy. Method: We empirically investigate the
moving window assumption based on the theory that the prediction outcome of a
future event depends on the outcomes of prior events. Sampling of Bellwethers
was undertaken using three introduced Bellwether methods (SSPM, SysSam, and
RandSam). The ergodic Markov chain was used to determine the stationarity of
the Bell-wethers. Results: Empirical results show that 1) Bellwethers exist in
SEP and 2) the BMW has an approximate size of 50 to 80 exemplary projects that
should not be more than 2 years old relative to the new projects to be
estimated. Conclusion: The study's results add further weight to the
recommended use of Bellwethers for improved prediction accuracy in SEP.
","[{'version': 'v1', 'created': 'Sun, 16 May 2021 06:15:30 GMT'}]",2021-05-18,"[['Mensah', 'Solomon', ''], ['Keung', 'Jacky', ''], ['MacDonell', 'Stephen G.', ''], ['Bosu', 'Michael Franklin', ''], ['Bennin', 'Kwabena Ebo', '']]","['Bellwether effect', 'Bellwether moving window (BMW)', 'growing portfolio (GP)', 'Markov chains', 'software effort prediction (SEP)']"
4119,0807.3582,Shashi Kiran Chilappagari,"Shashi Kiran Chilappagari, Dung Viet Nguyen, Bane Vasic and Michael W.
  Marcellin",Error Correction Capability of Column-Weight-Three LDPC Codes: Part II,"7 pages, 7 figures, submitted to IEEE Transactions on Information
  Theory (July 2008)",,10.1109/TIT.2009.2015990,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The relation between the girth and the error correction capability of
column-weight-three LDPC codes is investigated. Specifically, it is shown that
the Gallager A algorithm can correct $g/2-1$ errors in $g/2$ iterations on a
Tanner graph of girth $g \geq 10$.
","[{'version': 'v1', 'created': 'Wed, 23 Jul 2008 01:04:27 GMT'}]",2016-11-15,"[['Chilappagari', 'Shashi Kiran', ''], ['Nguyen', 'Dung Viet', ''], ['Vasic', 'Bane', ''], ['Marcellin', 'Michael W.', '']]","['Low-density parity-check codes', 'Gallager A algorithm', 'error floor', 'girth']"
4120,1412.8461,Yanhong Annie Liu,Yanhong A. Liu and Scott D. Stoller and Bo Lin,From Clarity to Efficiency for Distributed Algorithms,,"ACM Transactions on Programming Languages and Systems (TOPLAS),
  39(3), pages 12:1-12:41, July 2017, ACM Press",10.1145/2994595,,cs.PL cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article describes a very high-level language for clear description of
distributed algorithms and optimizations necessary for generating efficient
implementations. The language supports high-level control flows where complex
synchronization conditions can be expressed using high-level queries,
especially logic quantifications, over message history sequences.
Unfortunately, the programs would be extremely inefficient, including consuming
unbounded memory, if executed straightforwardly.
  We present new optimizations that automatically transform complex
synchronization conditions into incremental updates of necessary auxiliary
values as messages are sent and received. The core of the optimizations is the
first general method for efficient implementation of logic quantifications. We
have developed an operational semantics of the language, implemented a
prototype of the compiler and the optimizations, and successfully used the
language and implementation on a variety of important distributed algorithms.
","[{'version': 'v1', 'created': 'Mon, 29 Dec 2014 20:52:34 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Jan 2015 21:25:03 GMT'}, {'version': 'v3', 'created': 'Wed, 6 Jan 2016 21:09:01 GMT'}, {'version': 'v4', 'created': 'Sun, 12 Mar 2017 02:34:40 GMT'}]",2021-10-07,"[['Liu', 'Yanhong A.', ''], ['Stoller', 'Scott D.', ''], ['Lin', 'Bo', '']]","['distributed algorithms', 'high-level queries andupdates', 'incrementalization', 'logic quantifications', 'messagehistories', 'synchronization conditions', 'yield points']"
4121,1203.1878,Saptarsi Goswami Mr,"Saptarsi Goswami, Samiran Ghosh, Amlan Chakrabarti",Outlier detection from ETL Execution trace,"2011 3rd International Conference on Electronics Computer Technology
  (ICECT 2011)",,10.1109/ICECTECH.2011.5942112,,cs.DB,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Extract, Transform, Load (ETL) is an integral part of Data Warehousing (DW)
implementation. The commercial tools that are used for this purpose captures
lot of execution trace in form of various log files with plethora of
information. However there has been hardly any initiative where any proactive
analyses have been done on the ETL logs to improve their efficiency. In this
paper we utilize outlier detection technique to find the processes varying most
from the group in terms of execution trace. As our experiment was carried on
actual production processes, any outlier we would consider as a signal rather
than a noise. To identify the input parameters for the outlier detection
algorithm we employ a survey among developer community with varied mix of
experience and expertise. We use simple text parsing to extract these features
from the logs, as shortlisted from the survey. Subsequently we applied outlier
detection technique (Clustering based) on the logs. By this process we reduced
our domain of detailed analysis from 500 logs to 44 logs (8 Percentage). Among
the 5 outlier cluster, 2 of them are genuine concern, while the other 3 figure
out because of the huge number of rows involved.
","[{'version': 'v1', 'created': 'Thu, 8 Mar 2012 18:30:25 GMT'}]",2012-03-09,"[['Goswami', 'Saptarsi', ''], ['Ghosh', 'Samiran', ''], ['Chakrabarti', 'Amlan', '']]","['ETL', 'Data Warehousing', 'Outlier detection', 'Clustering', 'Log files']"
4122,1512.03862,EPTCS,"Bishoksan Kafle (Roskilde University, Denmark), John P. Gallagher
  (Roskilde University, Denmark and IMDEA Software Institute, Spain), Pierre
  Ganty (IMDEA Software Institute, Spain)",Decomposition by tree dimension in Horn clause verification,"In Proceedings VPT 2015, arXiv:1512.02215","EPTCS 199, 2015, pp. 1-14",10.4204/EPTCS.199.1,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we investigate the use of the concept of tree dimension in Horn
clause analysis and verification. The dimension of a tree is a measure of its
non-linearity - for example a list of any length has dimension zero while a
complete binary tree has dimension equal to its height. We apply this concept
to trees corresponding to Horn clause derivations. A given set of Horn clauses
P can be transformed into a new set of clauses P=<k, whose derivation trees are
the subset of P's derivation trees with dimension at most k. Similarly, a set
of clauses P>k can be obtained from P whose derivation trees have dimension at
least k + 1. In order to prove some property of all derivations of P, we
systematically apply these transformations, for various values of k, to
decompose the proof into separate proofs for P=<k and P>k (which could be
executed in parallel). We show some preliminary results indicating that
decomposition by tree dimension is a potentially useful proof technique. We
also investigate the use of existing automatic proof tools to prove some
interesting properties about dimension(s) of feasible derivation trees of a
given program.
","[{'version': 'v1', 'created': 'Sat, 12 Dec 2015 02:02:27 GMT'}]",2015-12-15,"[['Kafle', 'Bishoksan', '', 'Roskilde University, Denmark'], ['Gallagher', 'John P.', '', 'Roskilde University, Denmark and IMDEA Software Institute, Spain'], ['Ganty', 'Pierre', '', 'IMDEA Software Institute, Spain']]","['Tree dimension', 'proof decomposition', 'program transformation', 'Horn clauses']"
4123,1612.00992,Mark Howison,"David Berenbaum, Dwyer Deighan, Thomas Marlow, Ashley Lee, Scott
  Frickel, Mark Howison","Mining Spatio-temporal Data on Industrialization from Historical
  Registries",,Journal of Environmental Informatics 34(1): 28-34 (2019),10.3808/jei.201700381,,cs.CV cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the growing availability of big data in many fields, historical data
on socioevironmental phenomena are often not available due to a lack of
automated and scalable approaches for collecting, digitizing, and assembling
them. We have developed a data-mining method for extracting tabulated, geocoded
data from printed directories. While scanning and optical character recognition
(OCR) can digitize printed text, these methods alone do not capture the
structure of the underlying data. Our pipeline integrates both page layout
analysis and OCR to extract tabular, geocoded data from structured text. We
demonstrate the utility of this method by applying it to scanned manufacturing
registries from Rhode Island that record 41 years of industrial land use. The
resulting spatio-temporal data can be used for socioenvironmental analyses of
industrialization at a resolution that was not previously possible. In
particular, we find strong evidence for the dispersion of manufacturing from
the urban core of Providence, the state's capital, along the Interstate 95
corridor to the north and south.
","[{'version': 'v1', 'created': 'Sat, 3 Dec 2016 17:54:03 GMT'}]",2021-04-21,"[['Berenbaum', 'David', ''], ['Deighan', 'Dwyer', ''], ['Marlow', 'Thomas', ''], ['Lee', 'Ashley', ''], ['Frickel', 'Scott', ''], ['Howison', 'Mark', '']]","['structured text', 'historical data', 'geocoding', 'page layout analysis', 'socio-environmental analysis']"
4124,1310.1194,Krzysztof Bana\'s,Filip Kru\.zel and Krzysztof Bana\'s,"Vectorized OpenCL implementation of numerical integration for higher
  order finite elements","published online in Computers and Mathematics with Applications:
  http://www.sciencedirect.com/science/article/pii/S089812211300521X","Computers & Mathematics with Applications, Volume 66, Issue 10,
  December 2013, Pages 2030-2044",10.1016/j.camwa.2013.08.026,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In our work we analyze computational aspects of the problem of numerical
integration in finite element calculations and consider an OpenCL
implementation of related algorithms for processors with wide vector registers.
  As a platform for testing the implementation we choose the PowerXCell
processor, being an example of the Cell Broadband Engine (CellBE) architecture.
Although the processor is considered old for today's standards (its design
dates back to year 2001), we investigate its performance due to two features
that it shares with recent Xeon Phi family of coprocessors: wide vector units
and relatively slow connection of computing cores with main global memory. The
performed analysis of parallelization options can also be used for designing
numerical integration algorithms for other processors with vector registers,
such as contemporary x86 microprocessors.
","[{'version': 'v1', 'created': 'Fri, 4 Oct 2013 08:08:04 GMT'}]",2014-03-03,"[['Krużel', 'Filip', ''], ['Banaś', 'Krzysztof', '']]","['finite elements', 'numerical integration', 'PowerXCell processor', 'OpenCL', 'higher order approximation', 'vectorization']"
4125,1912.05849,Constantinos Patsakis,Constantinos Patsakis and Fran Casino,"Exploiting Statistical and Structural Features for the Detection of
  Domain Generation Algorithms",,"Journal of Information Security and Applications, Volume 58, 2021",10.1016/j.jisa.2020.102725,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, malware campaigns have reached a high level of sophistication,
thanks to the use of cryptography and covert communication channels over
traditional protocols and services. In this regard, a typical approach to evade
botnet identification and takedown mechanisms is the use of domain fluxing
through the use of Domain Generation Algorithms (DGAs). These algorithms
produce an overwhelming amount of domain names that the infected device tries
to communicate with to find the Command and Control server, yet only a small
fragment of them is actually registered. Due to the high number of domain
names, the blacklisting approach is rendered useless. Therefore, the botmaster
may pivot the control dynamically and hinder botnet detection mechanisms. To
counter this problem, many security mechanisms result in solutions that try to
identify domains from a DGA based on the randomness of their name.
  In this work, we explore hard to detect families of DGAs, as they are
constructed to bypass these mechanisms. More precisely, they are based on the
use of dictionaries so the domains seem to be user-generated. Therefore, the
corresponding generated domains pass many filters that look for, e.g. high
entropy strings. To address this challenge, we propose an accurate and
efficient probabilistic approach to detect them. We test and validate the
proposed solution through extensive experiments with a sound dataset containing
all the wordlist-based DGA families that exhibit this behaviour and compare it
with other state-of-the-art methods, practically showing the efficacy and
prevalence of our proposal.
","[{'version': 'v1', 'created': 'Thu, 12 Dec 2019 09:42:17 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Jan 2021 18:03:27 GMT'}]",2021-01-25,"[['Patsakis', 'Constantinos', ''], ['Casino', 'Fran', '']]","['Malware', 'Botnets', 'Domain Generation Algorithm', 'DNS']"
4126,1109.0166,Bahram Amini,"Bahram Amini, Roliana Ibrahim, Mohd Shahizan Othman","Discovering the Impact of Knowledge in Recommender Systems: A
  Comparative Study","14 pages, 3 tables; International Journal of Computer Science &
  Engineering Survey (IJCSES) Vol.2, No.3, August 2011",,10.5121/ijcses.2011.2301,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender systems engage user profiles and appropriate filtering techniques
to assist users in finding more relevant information over the large volume of
information. User profiles play an important role in the success of
recommendation process since they model and represent the actual user needs.
However, a comprehensive literature review of recommender systems has
demonstrated no concrete study on the role and impact of knowledge in user
profiling and filtering approache. In this paper, we review the most prominent
recommender systems in the literature and examine the impression of knowledge
extracted from different sources. We then come up with this finding that
semantic information from the user context has substantial impact on the
performance of knowledge based recommender systems. Finally, some new clues for
improvement the knowledge-based profiles have been proposed.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2011 12:08:19 GMT'}]",2011-09-02,"[['Amini', 'Bahram', ''], ['Ibrahim', 'Roliana', ''], ['Othman', 'Mohd Shahizan', '']]","['Recommendation Systems', 'User Profile', 'Knowledge-based Recommender System', 'Semantic Web']"
4127,1611.08294,Wojciech Mazurczyk,"Krzysztof Cabaj, Marcin Gregorczyk, Wojciech Mazurczyk","Software-Defined Networking-based Crypto Ransomware Detection Using HTTP
  Traffic Characteristics","14 pages, 13 figures, 3 tables","Computers & Electrical Engineering, vol. 66, 2017, pp. 353-368",10.1016/j.compeleceng.2017.10.012,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ransomware is currently the key threat for individual as well as corporate
Internet users. Especially dangerous is crypto ransomware that encrypts
important user data and it is only possible to recover it once a ransom has
been paid. Therefore devising efficient and effective countermeasures is a
rising necessity. In this paper we present a novel Software-Defined Networking
(SDN) based detection approach that utilizes characteristics of ransomware
communication. Based on the observation of network communication of two crypto
ransomware families, namely CryptoWall and Locky we conclude that analysis of
the HTTP messages' sequences and their respective content sizes is enough to
detect such threats. We show feasibility of our approach by designing and
evaluating the proof-of-concept SDN-based detection system. Experimental
results confirm that the proposed approach is feasible and efficient.
","[{'version': 'v1', 'created': 'Thu, 24 Nov 2016 19:43:10 GMT'}]",2018-04-10,"[['Cabaj', 'Krzysztof', ''], ['Gregorczyk', 'Marcin', ''], ['Mazurczyk', 'Wojciech', '']]","['ransomware', 'malware', 'software-defined networking', 'network security']"
4128,1908.01031,Adam Gudy\'s,"Adam Gudy\'s, Marek Sikora, {\L}ukasz Wr\'obel",RuleKit: A Comprehensive Suite for Rule-Based Learning,"5 pages, 3 figures",,10.1016/j.knosys.2020.105480,,cs.LG cs.AI cs.IR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rule-based models are often used for data analysis as they combine
interpretability with predictive power. We present RuleKit, a versatile tool
for rule learning. Based on a sequential covering induction algorithm, it is
suitable for classification, regression, and survival problems. The presence of
a user-guided induction facilitates verifying hypotheses concerning data
dependencies which are expected or of interest. The powerful and flexible
experimental environment allows straightforward investigation of different
induction schemes. The analysis can be performed in batch mode, through
RapidMiner plug-in, or R package. A documented Java API is also provided for
convenience. The software is publicly available at GitHub under GNU AGPL-3.0
license.
","[{'version': 'v1', 'created': 'Fri, 2 Aug 2019 19:53:46 GMT'}]",2020-01-28,"[['Gudyś', 'Adam', ''], ['Sikora', 'Marek', ''], ['Wróbel', 'Łukasz', '']]","['rule learning', 'classification', 'regression', 'survival analysis', 'user-guided induction', 'knowledge discovery']"
4129,1601.08021,Soumya Banerjee,Soumya Banerjee,"A Biologically Inspired Model of Distributed Online Communication
  Supporting Efficient Search and Diffusion of Innovation","16 pages, 1 figure",,10.7906/indecs.14.1.2,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We inhabit a world that is not only small but supports efficient
decentralized search - an individual using local information can establish a
line of communication with another completely unknown individual. Here we
augment a hierarchical social network model with communication between and
within communities. We argue that organization into communities would decrease
overall decentralized search times. We take inspiration from the biological
immune system which organizes search for pathogens in a hybrid modular
strategy. Our strategy has relevance in search for rare amounts of information
in online social networks. Our work also has implications for design of
efficient online networks that could have an impact on networks of human
collaboration, scientific collaboration and networks used in targeted manhunts.
Real world systems, like online social networks, have high associated delays
for long-distance links, since they are built on top of physical networks. Such
systems have been shown to densify. Hence such networks will have a
communication cost due to space and the requirement of maintaining connections.
We have incorporated such a non-spatial cost to communication. We introduce the
notion of a community size that increases with the size of the system, which is
shown to reduce the time to search for information in networks. Our final
strategy balances search times and participation costs and is shown to decrease
time to find information in decentralized search in online social networks. Our
strategy also balances strong-ties and weak-ties over long distances and may
ultimately lead to more productive and innovative networks of human
communication and enterprise. We hope that this work will lay the foundation
for strategies aimed at producing global scale human interaction networks that
are sustainable and lead to a more networked, diverse and prosperous society.
","[{'version': 'v1', 'created': 'Fri, 29 Jan 2016 10:06:47 GMT'}]",2016-02-01,"[['Banerjee', 'Soumya', '']]","['Social computing', 'complex systems', 'social dynamics', 'innovation diffusion', 'artificial immune system']"
4130,1412.8004,Mohammad Javad Dousti,"Mohammad Javad Dousti, Alireza Shafaei, and Massoud Pedram",Squash: A Scalable Quantum Mapper Considering Ancilla Sharing,,,10.1145/2591513.2591523,,cs.ET quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quantum algorithms for solving problems of interesting size often result in
circuits with a very large number of qubits and quantum gates. Fortunately,
these algorithms also tend to contain a small number of repetitively-used
quantum kernels. Identifying the quantum logic blocks that implement such
quantum kernels is critical to the complexity management for realizing the
corresponding quantum circuit. Moreover, quantum computation requires some type
of quantum error correction coding to combat decoherence, which in turn results
in a large number of ancilla qubits in the circuit. Sharing the ancilla qubits
among quantum operations (even though this sharing can increase the overall
circuit latency) is important in order to curb the resource demand of the
quantum algorithm. This paper presents a multi-core reconfigurable quantum
processor architecture, called Requp, which supports a layered approach to
mapping a quantum algorithm and ancilla sharing. More precisely, a scalable
quantum mapper, called Squash, is introduced, which divides a given quantum
circuit into a number of quantum kernels- each kernel comprises k parts such
that each part will run on exactly one of k available cores. Experimental
results demonstrate that Squash can handle large-scale quantum algorithms while
providing an effective mechanism for sharing ancilla qubits.
","[{'version': 'v1', 'created': 'Sat, 27 Dec 2014 00:15:36 GMT'}]",2014-12-30,"[['Dousti', 'Mohammad Javad', ''], ['Shafaei', 'Alireza', ''], ['Pedram', 'Massoud', '']]","['Quantum computing', 'mapping', 'physical design', 'scalable algorithms', 'ancilla sharing']"
4131,1603.08389,"Wolfgang L\""ohr","Nihat Ay, Wolfgang L\""ohr",The Umwelt of an Embodied Agent -- A Measure-Theoretic Definition,16 pages,"Theory in Biosciences, 134 no. 3, pp. 105-116, 2015",10.1007/s12064-015-0217-3,,cs.IT math.IT math.PR nlin.AO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a general model of the sensorimotor loop of an agent interacting
with the world. This formalises Uexk\""ull's notion of a \emph{function-circle}.
Here, we assume a particular causal structure, mechanistically described in
terms of Markov kernels. In this generality, we define two $\sigma$-algebras of
events in the world that describe two respective perspectives: (1) the
perspective of an external observer, (2) the intrinsic perspective of the
agent. Not all aspects of the world, seen from the external perspective, are
accessible to the agent. This is expressed by the fact that the second
$\sigma$-algebra is a subalgebra of the first one. We propose the smaller one
as formalisation of Uexk\""ull's \emph{Umwelt} concept. We show that, under
continuity and compactness assumptions, the global dynamics of the world can be
simplified without changing the internal process. This simplification can serve
as a minimal world model that the system must have in order to be consistent
with the internal process.
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2016 14:37:36 GMT'}]",2016-09-12,"[['Ay', 'Nihat', ''], ['Löhr', 'Wolfgang', '']]","['Umwelt', 'function-circle', 'sensorimotor loop', 'embodied agent', 'intrinsic perspective', 'external observer', 'σ-algebra']"
4132,1201.4049,Anna Kucerova,"Bojana V. Rosi\'c and Anna Ku\v{c}erov\'a and Jan S\'ykora and Oliver
  Pajonk and Alexander Litvinenko and Hermann G. Matthies",Parameter Identification in a Probabilistic Setting,"29 pages, 16 figures","Engineering Structures, 50, 179-196, 2013",10.1016/j.engstruct.2012.12.029,,cs.NA cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parameter identification problems are formulated in a probabilistic language,
where the randomness reflects the uncertainty about the knowledge of the true
values. This setting allows conceptually easily to incorporate new information,
e.g. through a measurement, by connecting it to Bayes's theorem. The unknown
quantity is modelled as a (may be high-dimensional) random variable. Such a
description has two constituents, the measurable function and the measure. One
group of methods is identified as updating the measure, the other group changes
the measurable function. We connect both groups with the relatively recent
methods of functional approximation of stochastic problems, and introduce
especially in combination with the second group of methods a new procedure
which does not need any sampling, hence works completely deterministically. It
also seems to be the fastest and more reliable when compared with other
methods. We show by example that it also works for highly nonlinear non-smooth
problems with non-Gaussian measures.
","[{'version': 'v1', 'created': 'Thu, 19 Jan 2012 13:00:34 GMT'}]",2013-03-19,"[['Rosić', 'Bojana V.', ''], ['Kučerová', 'Anna', ''], ['Sýkora', 'Jan', ''], ['Pajonk', 'Oliver', ''], ['Litvinenko', 'Alexander', ''], ['Matthies', 'Hermann G.', '']]","['parameter identification', 'Bayesian update', 'linear Bayes', 'Kalman filter', 'polynomial chaos']"
4133,1811.01815,Ciriaco Andrea D'Angelo,"Giovanni Abramo, Ciriaco Andrea D'Angelo, Flavia Di Costa","Testing the trade-off between productivity and quality in research
  activities",,"Journal of the American Society for Information Science and
  Technology, 61(1), 132-140 (2010)",10.1002/asi.21254,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years there has been an increasingly pressing need for the
evaluation of results from public sector research activity, particularly to
permit the efficient allocation of ever scarcer resources. Many of the studies
and evaluation exercises that have been conducted at the national and
international level emphasize the quality dimension of research output, while
neglecting that of productivity. This work is intended to test for the possible
existence of correlation between quantity and quality of scientific production
and determine whether the most productive researchers are also those that
achieve results that are qualitatively better than those of their colleagues.
The analysis proposed refers to the entire Italian university system and is
based on the observation of production in the hard sciences by above 26,000
researchers in the period 2001 to 2005. The results show that the output of
more productive researchers is superior in quality than that of less productive
researchers. The relation between productivity and quality results as largely
insensitive to the types of indicators or the test methods applied and also
seems to differ little among the various disciplines examined.
","[{'version': 'v1', 'created': 'Mon, 5 Nov 2018 15:56:33 GMT'}]",2018-11-06,"[['Abramo', 'Giovanni', ''], [""D'Angelo"", 'Ciriaco Andrea', ''], ['Di Costa', 'Flavia', '']]","['Research productivity', 'research impact', 'research evaluation', 'university', 'bibliometrics']"
4134,1612.04884,Rao Muhammad Anwer,"Fahad Shahbaz Khan, Joost van de Weijer, Rao Muhammad Anwer, Andrew D.
  Bagdanov, Michael Felsberg, Jorma Laaksonen","Scale Coding Bag of Deep Features for Human Attribute and Action
  Recognition",To appear in Machine Vision and Applications,,10.1007/s00138-017-0871-1,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most approaches to human attribute and action recognition in still images are
based on image representation in which multi-scale local features are pooled
across scale into a single, scale-invariant encoding. Both in bag-of-words and
the recently popular representations based on convolutional neural networks,
local features are computed at multiple scales. However, these multi-scale
convolutional features are pooled into a single scale-invariant representation.
We argue that entirely scale-invariant image representations are sub-optimal
and investigate approaches to scale coding within a Bag of Deep Features
framework.
  Our approach encodes multi-scale information explicitly during the image
encoding stage. We propose two strategies to encode multi-scale information
explicitly in the final image representation. We validate our two scale coding
techniques on five datasets: Willow, PASCAL VOC 2010, PASCAL VOC 2012,
Stanford-40 and Human Attributes (HAT-27). On all datasets, the proposed scale
coding approaches outperform both the scale-invariant method and the standard
deep features of the same network. Further, combining our scale coding
approaches with standard deep features leads to consistent improvement over the
state-of-the-art.
","[{'version': 'v1', 'created': 'Wed, 14 Dec 2016 23:44:23 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Mar 2018 12:11:49 GMT'}]",2018-03-28,"[['Khan', 'Fahad Shahbaz', ''], ['van de Weijer', 'Joost', ''], ['Anwer', 'Rao Muhammad', ''], ['Bagdanov', 'Andrew D.', ''], ['Felsberg', 'Michael', ''], ['Laaksonen', 'Jorma', '']]","['Action Recognition', 'Attribute Recognition', 'Bag of Deep Features']"
4135,2003.12477,Jan Baumeister,"Jan Baumeister and Bernd Finkbeiner and Maximilian Schwenger and Hazem
  Torfah",FPGA Stream-Monitoring of Real-time Properties,,ACM Transactions on Embedded Computing Systems 2019,,,cs.DC cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An essential part of cyber-physical systems is the online evaluation of
real-time data streams. Especially in systems that are intrinsically
safety-critical, a dedicated monitoring component inspecting data streams to
detect problems at runtime greatly increases the confidence in a safe
execution. Such a monitor needs to be based on a specification language capable
of expressing complex, high-level properties using only the accessible
low-level signals. Moreover, tight constraints on computational resources
exacerbate the requirements on the monitor. Thus, several existing approaches
to monitoring are not applicable due to their dependence on an operating
system. We present an FPGA-based monitoring approach by compiling an RTLola
specification into synthesizable VHDL code. RTLola is a stream-based
specification language capable of expressing complex real-time properties while
providing an upper bound on the execution time and memory requirements. The
statically determined memory bound allows for a compilation to an FPGA with a
fixed size. An advantage of FPGAs is a simple integration process in existing
systems and superb executing time. The compilation results in a highly parallel
implementation thanks to the modular nature of RTLola specifications. This
further increases the maximal event rate the monitor can handle.
","[{'version': 'v1', 'created': 'Wed, 18 Mar 2020 14:49:20 GMT'}]",2021-04-13,"[['Baumeister', 'Jan', ''], ['Finkbeiner', 'Bernd', ''], ['Schwenger', 'Maximilian', ''], ['Torfah', 'Hazem', '']]","['Real-time Properties', 'Runtime Verification', 'FPGA']"
4136,1201.3316,Murat Guzeltepe Mr,"Murat G\""uzeltepe",Codes over Hurwitz integers,11 pages,,10.1016/j.disc.2012.10.020,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, we obtain new classes of linear codes over Hurwitz integers
equipped with a new metric. We refer to the metric as Hurwitz metric. The codes
with respect to Hurwitz metric use in coded modu- lation schemes based on
quadrature amplitude modulation (QAM)-type constellations, for which neither
Hamming metric nor Lee metric. Also, we define decoding algorithms for these
codes when up to two coordinates of a transmitted code vector are effected by
error of arbitrary Hurwitz weight.
","[{'version': 'v1', 'created': 'Fri, 13 Jan 2012 13:58:47 GMT'}]",2014-10-21,"[['Güzeltepe', 'Murat', '']]","['Block codes', 'Cyclic codes', 'Syndrome decoding']"
4137,1208.2767,EPTCS,"Mathilde Noual (LIP, ENS de Lyon, IXXI, Institut rh\^one-alpin des
  syst\`emes complexes), Damien Regnault (IBISC, Universit\'e d'Evry - Val
  d'Essonne), Sylvain Sen\'e (IBISC, Universit\'e d'Evry - Val d'Essonne, IXXI,
  Institut rh\^one-alpin des syst\`emes complexes)","Boolean networks synchronism sensitivity and XOR circulant networks
  convergence time","In Proceedings AUTOMATA&JAC 2012, arXiv:1208.2498","EPTCS 90, 2012, pp. 37-52",10.4204/EPTCS.90.4,,cs.FL cs.CC cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper are presented first results of a theoretical study on the role
of non-monotone interactions in Boolean automata networks. We propose to
analyse the contribution of non-monotony to the diversity and complexity in
their dynamical behaviours according to two axes. The first one consists in
supporting the idea that non-monotony has a peculiar influence on the
sensitivity to synchronism of such networks. It leads us to the second axis
that presents preliminary results and builds an understanding of the dynamical
behaviours, in particular concerning convergence times, of specific
non-monotone Boolean automata networks called XOR circulant networks.
","[{'version': 'v1', 'created': 'Tue, 14 Aug 2012 02:02:02 GMT'}]",2012-08-15,"[['Noual', 'Mathilde', '', 'LIP, ENS de Lyon, IXXI, Institut rhône-alpin des\n  systèmes complexes'], ['Regnault', 'Damien', '', ""IBISC, Université d'Evry - Val\n  d'Essonne""], ['Sené', 'Sylvain', '', ""IBISC, Université d'Evry - Val d'Essonne, IXXI,\n  Institut rhône-alpin des systèmes complexes""]]","['Boolean automata networks', 'synchronism sensitivity', 'XOR circulant networks', 'convergence time']"
4138,1610.08475,David Arroyo,David Arroyo and Fernando Hernandez and Amalia B. Or\'ue,"Cryptanalysis of a Classical chaos-based cryptosystem with some quantum
  cryptography features","Accepted in International Journal of Bifurcation and Chaos, In Press",,10.1142/S0218127417500043,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The application of synchronization theory to build up new cryptosystems has
been a hot topic during the last two decades. In this paper we analyze a recent
proposal in this field. We pinpoint the main limitations of the software
implementation of chaos-based systems designed on the grounds of
synchronization theory. In addition, we show that the cryptosystem under
evaluation possesses serious security problems that imply a clear reduction of
the key space.
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2016 19:34:25 GMT'}]",2017-03-08,"[['Arroyo', 'David', ''], ['Hernandez', 'Fernando', ''], ['Orúe', 'Amalia B.', '']]","['chaos-based cryptography', 'cryptanalysis', 'stream ciphers', 'parameters fitting', 'globaloptimization', 'brute-force attacks']"
4139,0911.2804,Thomas Fernique,"Olivier Bodini, Thomas Fernique, Michael Rao, Eric Remila",Distances on Rhombus Tilings,"18 pages, 9 figures, submitted to Theoretical Computer Science
  (special issue of DGCI'09)",Theor. Comput. Sci. 412(36): 4787-4794 (2011),10.1016/j.tcs.2011.04.015,,cs.DM cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rhombus tilings of a simply connected domain of the Euclidean plane are
known to form a flip-connected space (a flip is the elementary operation on
rhombus tilings which rotates 180{\deg} a hexagon made of three rhombi).
Motivated by the study of a quasicrystal growth model, we are here interested
in better understanding how ""tight"" rhombus tiling spaces are flip-connected.
We introduce a lower bound (Hamming-distance) on the minimal number of flips to
link two tilings (flip-distance), and we investigate whether it is sharp. The
answer depends on the number n of different edge directions in the tiling:
positive for n=3 (dimer tilings) or n=4 (octogonal tilings), but possibly
negative for n=5 (decagonal tilings) or greater values of n. A standard proof
is provided for the n=3 and n=4 cases, while the complexity of the n=5 case led
to a computer-assisted proof (whose main result can however be easily checked
by hand).
","[{'version': 'v1', 'created': 'Sat, 14 Nov 2009 20:29:27 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Mar 2011 16:53:33 GMT'}]",2011-12-07,"[['Bodini', 'Olivier', ''], ['Fernique', 'Thomas', ''], ['Rao', 'Michael', ''], ['Remila', 'Eric', '']]","['computer-assisted proof', 'flip', 'phason', 'pseudoline arrangement', 'quasicrystal', 'rhombus tiling', 'tiling space']"
4140,1903.09477,Gregor Ulm,"Gregor Ulm, Simon Smith, Adrian Nilsson, Emil Gustavsson, Mats
  Jirstrand","Facilitating Rapid Prototyping in the OODIDA Data Analytics Platform via
  Active-Code Replacement","24 pages, 4 figures, 3 code listings, 1 table","Array Vol. 8, December 2020 (100043)",10.1016/j.array.2020.100043,,cs.DC cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  OODIDA (On-board/Off-board Distributed Data Analytics) is a platform for
distributed real-time analytics, targeting fleets of reference vehicles in the
automotive industry. Its users are data analysts. The bulk of the data
analytics tasks are performed by clients (on-board), while a central cloud
server performs supplementary tasks (off-board). OODIDA can be automatically
packaged and deployed, which necessitates restarting parts of the system, or
all of it. As this is potentially disruptive, we added the ability to execute
user-defined Python modules on clients as well as the server. These modules can
be replaced without restarting any part of the system; they can even be
replaced between iterations of an ongoing assignment. This feature is referred
to as active-code replacement. It facilitates use cases such as iterative A/B
testing of machine learning algorithms or modifying experimental algorithms
on-the-fly. Consistency of results is achieved by majority vote, which prevents
tainted state. Active-code replacement can be done in less than a second in an
idealized setting whereas a standard deployment takes many orders of magnitude
more time. The main contribution of this paper is the description of a
relatively straightforward approach to active-code replacement that is very
user-friendly. It enables a data analyst to quickly execute custom code on the
cloud server as well as on client devices. Sensible safeguards and design
decisions ensure that this feature can be used by non-specialists who are not
familiar with the implementation of OODIDA in general or this feature in
particular. As a consequence of adding the active-code replacement feature,
OODIDA is now very well-suited for rapid prototyping.
","[{'version': 'v1', 'created': 'Fri, 22 Mar 2019 12:46:34 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Sep 2019 13:26:01 GMT'}, {'version': 'v3', 'created': 'Tue, 25 Feb 2020 10:36:43 GMT'}, {'version': 'v4', 'created': 'Wed, 30 Dec 2020 10:34:47 GMT'}]",2021-01-01,"[['Ulm', 'Gregor', ''], ['Smith', 'Simon', ''], ['Nilsson', 'Adrian', ''], ['Gustavsson', 'Emil', ''], ['Jirstrand', 'Mats', '']]","['Distributed computing', 'Concurrent computing', 'DistributedData Processing', 'Hot Swapping', 'Code Replacement', 'Erlang']"
4141,2105.11888,Saman Ahmadi,"Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby",Bi-objective Search with Bi-directional A*,"16 pages, 4 figures, in Proceedings of The European Symposium on
  Algorithms 2021 (ESA21), Changes: including the backward search of BOBA*",,10.4230/LIPIcs.ESA.2021.3,,cs.AI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bi-objective search is a well-known algorithmic problem, concerned with
finding a set of optimal solutions in a two-dimensional domain. This problem
has a wide variety of applications such as planning in transport systems or
optimal control in energy systems. Recently, bi-objective A*-based search
(BOA*) has shown state-of-the-art performance in large networks. This paper
develops a bi-directional and parallel variant of BOA*, enriched with several
speed-up heuristics. Our experimental results on 1,000 benchmark cases show
that our bi-directional A* algorithm for bi-objective search (BOBA*) can
optimally solve all of the benchmark cases within the time limit, outperforming
the state of the art BOA*, bi-objective Dijkstra and bi-directional
bi-objective Dijkstra by an average runtime improvement of a factor of five
over all of the benchmark instances.
","[{'version': 'v1', 'created': 'Tue, 25 May 2021 12:46:25 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Jul 2021 04:32:30 GMT'}]",2022-03-10,"[['Ahmadi', 'Saman', ''], ['Tack', 'Guido', ''], ['Harabor', 'Daniel', ''], ['Kilby', 'Philip', '']]","['Bi-objective search', 'heuristic search', 'shortest path problems']"
4142,1608.08434,Byungjae Lee,"Byungjae Lee, Enkhbayar Erdenee, Songguo Jin, and Phill Kyu Rhee",Multi-Class Multi-Object Tracking using Changing Point Detection,,,10.1007/978-3-319-48881-3,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a robust multi-class multi-object tracking (MCMOT)
formulated by a Bayesian filtering framework. Multi-object tracking for
unlimited object classes is conducted by combining detection responses and
changing point detection (CPD) algorithm. The CPD model is used to observe
abrupt or abnormal changes due to a drift and an occlusion based spatiotemporal
characteristics of track states. The ensemble of convolutional neural network
(CNN) based object detector and Lucas-Kanede Tracker (KLT) based motion
detector is employed to compute the likelihoods of foreground regions as the
detection responses of different object classes. Extensive experiments are
performed using lately introduced challenging benchmark videos; ImageNet VID
and MOT benchmark dataset. The comparison to state-of-the-art video tracking
techniques shows very encouraging results.
","[{'version': 'v1', 'created': 'Tue, 30 Aug 2016 13:07:05 GMT'}]",2018-05-30,"[['Lee', 'Byungjae', ''], ['Erdenee', 'Enkhbayar', ''], ['Jin', 'Songguo', ''], ['Rhee', 'Phill Kyu', '']]","['Multi-class and multi-object tracking', 'changing point detection', 'entity transition', 'object detection from video', 'convolutional neural network']"
4143,1811.04247,Geesara Prathap Kulathunga,"Geesara Prathap, Ilya Afanasyev","Deep Learning Approach for Building Detection in Satellite Multispectral
  Imagery",,,10.1109/IS.2018.8710471,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Building detection from satellite multispectral imagery data is being a
fundamental but a challenging problem mainly because it requires correct
recovery of building footprints from high-resolution images. In this work, we
propose a deep learning approach for building detection by applying numerous
enhancements throughout the process. Initial dataset is preprocessed by 2-sigma
percentile normalization. Then data preparation includes ensemble modelling
where 3 models were created while incorporating OpenStreetMap data. Binary
Distance Transformation (BDT) is used for improving data labeling process and
the U-Net (Convolutional Networks for Biomedical Image Segmentation) is
modified by adding batch normalization wrappers. Afterwards, it is explained
how each component of our approach is correlated with the final detection
accuracy. Finally, we compare our results with winning solutions of SpaceNet 2
competition for real satellite multispectral images of Vegas, Paris, Shanghai
and Khartoum, demonstrating the importance of our solution for achieving higher
building detection accuracy.
","[{'version': 'v1', 'created': 'Sat, 10 Nov 2018 12:53:37 GMT'}]",2020-10-12,"[['Prathap', 'Geesara', ''], ['Afanasyev', 'Ilya', '']]","['Building detection', 'Satellite multispectral imagery', 'Batch normalization', 'Binary distance transformation (BDT)', 'UNet', 'OpenStreetMap data']"
4144,1706.01513,Keith Feldman,"Keith Feldman, Louis Faust, Xian Wu, Chao Huang, and Nitesh V. Chawla","Beyond Volume: The Impact of Complex Healthcare Data on the Machine
  Learning Pipeline","Healthcare Informatics, Machine Learning, Knowledge Discovery: 20
  Pages, 1 Figure","Towards Integrative Machine Learning and Knowledge Extraction,
  LNCS vol 10344 (2017) 150-169",10.1007/978-3-319-69775-8_9,,cs.CY cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  From medical charts to national census, healthcare has traditionally operated
under a paper-based paradigm. However, the past decade has marked a long and
arduous transformation bringing healthcare into the digital age. Ranging from
electronic health records, to digitized imaging and laboratory reports, to
public health datasets, today, healthcare now generates an incredible amount of
digital information. Such a wealth of data presents an exciting opportunity for
integrated machine learning solutions to address problems across multiple
facets of healthcare practice and administration. Unfortunately, the ability to
derive accurate and informative insights requires more than the ability to
execute machine learning models. Rather, a deeper understanding of the data on
which the models are run is imperative for their success. While a significant
effort has been undertaken to develop models able to process the volume of data
obtained during the analysis of millions of digitalized patient records, it is
important to remember that volume represents only one aspect of the data. In
fact, drawing on data from an increasingly diverse set of sources, healthcare
data presents an incredibly complex set of attributes that must be accounted
for throughout the machine learning pipeline. This chapter focuses on
highlighting such challenges, and is broken down into three distinct
components, each representing a phase of the pipeline. We begin with attributes
of the data accounted for during preprocessing, then move to considerations
during model building, and end with challenges to the interpretation of model
output. For each component, we present a discussion around data as it relates
to the healthcare domain and offer insight into the challenges each may impose
on the efficiency of machine learning techniques.
","[{'version': 'v1', 'created': 'Thu, 1 Jun 2017 20:34:41 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Jan 2018 15:05:34 GMT'}]",2018-01-29,"[['Feldman', 'Keith', ''], ['Faust', 'Louis', ''], ['Wu', 'Xian', ''], ['Huang', 'Chao', ''], ['Chawla', 'Nitesh V.', '']]","['Healthcare Informatics', 'Machine Learning', 'Knowledge Discovery']"
4145,1001.2112,Tobias Renk,"Tobias Renk, Holger Jaekel, Friedrich Jondral, Deniz Gunduz, Andrea
  Goldsmith",Outage Capacity of Bursty Amplify-and-Forward with Incremental Relaying,"5 pages, 3 figures, submitted to IEEE International Symposium on
  Information Theory, Austin, TX, June 13-18, 2010",,10.1109/ISITA.2010.5649511,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We derive the outage capacity of a bursty version of the amplify-and-forward
(BAF) protocol for small signal-to-noise ratios when incremental relaying is
used. We show that the ratio between the outage capacities of BAF and the
cut-set bound is independent of the relay position and that BAF is outage
optimal for certain conditions on the target rate R. This is in contrast to
decode-and-forward with incremental relaying, where the relay location strongly
determines the performance of the cooperative protocol. We further derive the
outage capacity for a network consisting of an arbitrary number of relay nodes.
In this case the relays transmit in subsequent partitions of the overall
transmission block and the destination accumulates signal-to-noise ratio until
it is able to decode.
","[{'version': 'v1', 'created': 'Wed, 13 Jan 2010 09:39:28 GMT'}]",2016-11-17,"[['Renk', 'Tobias', ''], ['Jaekel', 'Holger', ''], ['Jondral', 'Friedrich', ''], ['Gunduz', 'Deniz', ''], ['Goldsmith', 'Andrea', '']]","['cooperative communications', 'incremental relaying', 'bursty amplify-and-forward', 'ǫ-outage capacity']"
4146,2102.06442,Siamak Mehrkanoon,"Jesus Garcia Fernandez, Siamak Mehrkanoon",Broad-UNet: Multi-scale feature learning for nowcasting tasks,"9 pages, 11 figures",,10.1016/j.neunet.2021.08.036,,cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  Weather nowcasting consists of predicting meteorological components in the
short term at high spatial resolutions. Due to its influence in many human
activities, accurate nowcasting has recently gained plenty of attention. In
this paper, we treat the nowcasting problem as an image-to-image translation
problem using satellite imagery. We introduce Broad-UNet, a novel architecture
based on the core UNet model, to efficiently address this problem. In
particular, the proposed Broad-UNet is equipped with asymmetric parallel
convolutions as well as Atrous Spatial Pyramid Pooling (ASPP) module. In this
way, The the Broad-UNet model learns more complex patterns by combining
multi-scale features while using fewer parameters than the core UNet model. The
proposed model is applied on two different nowcasting tasks, i.e. precipitation
maps and cloud cover nowcasting. The obtained numerical results show that the
introduced Broad-UNet model performs more accurate predictions compared to the
other examined architectures.
","[{'version': 'v1', 'created': 'Fri, 12 Feb 2021 11:06:44 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Oct 2021 13:09:27 GMT'}]",2021-10-27,"[['Fernandez', 'Jesus Garcia', ''], ['Mehrkanoon', 'Siamak', '']]","['Satellite imagery', 'Precipitation forecasting', 'cloud cover forecasting', 'Deep learning', 'Convolutional neural network', 'U-Net']"
4147,1912.04964,Dimiter Dobrev,Dimiter Dobrev,"Before we can find a model, we must forget about perfection",,"Serdica Journal of Computing, Vol. 15, Number 2, 2021, pp. 85-128",10.55630/sjc.2021.15.85-128,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With Reinforcement Learning we assume that a model of the world does exist.
We assume furthermore that the model in question is perfect (i.e. it describes
the world completely and unambiguously). This article will demonstrate that it
does not make sense to search for the perfect model because this model is too
complicated and practically impossible to find. We will show that we should
abandon the pursuit of perfection and pursue Event-Driven (ED) models instead.
These models are generalization of Markov Decision Process (MDP) models. This
generalization is essential because nothing can be found without it. Rather
than a single MDP, we will aim to find a raft of neat simple ED models each one
describing a simple dependency or property. In other words, we will replace the
search for a singular and complex perfect model with a search for a large
number of simple models.
","[{'version': 'v1', 'created': 'Tue, 10 Dec 2019 20:20:34 GMT'}]",2022-12-05,"[['Dobrev', 'Dimiter', '']]","['Artificial Intelligence', 'Reinforcement Learning', 'Partial Observability', 'Event-Driven Model', 'Definition of Object']"
4148,1705.01076,Rafa{\l} Skinderowicz,Rafa{\l} Skinderowicz,An improved Ant Colony System for the Sequential Ordering Problem,"30 pages, 8 tables, 11 figures",,10.1016/j.cor.2017.04.012,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is not rare that the performance of one metaheuristic algorithm can be
improved by incorporating ideas taken from another. In this article we present
how Simulated Annealing (SA) can be used to improve the efficiency of the Ant
Colony System (ACS) and Enhanced ACS when solving the Sequential Ordering
Problem (SOP). Moreover, we show how the very same ideas can be applied to
improve the convergence of a dedicated local search, i.e. the SOP-3-exchange
algorithm. A statistical analysis of the proposed algorithms both in terms of
finding suitable parameter values and the quality of the generated solutions is
presented based on a series of computational experiments conducted on SOP
instances from the well-known TSPLIB and SOPLIB2006 repositories. The proposed
ACS-SA and EACS-SA algorithms often generate solutions of better quality than
the ACS and EACS, respectively. Moreover, the EACS-SA algorithm combined with
the proposed SOP-3-exchange-SA local search was able to find 10 new best
solutions for the SOP instances from the SOPLIB2006 repository, thus improving
the state-of-the-art results as known from the literature. Overall, the best
known or improved solutions were found in 41 out of 48 cases.
","[{'version': 'v1', 'created': 'Tue, 2 May 2017 17:17:26 GMT'}]",2017-05-03,"[['Skinderowicz', 'Rafał', '']]","['Ant Colony System', 'Simulated Annealing', 'Sequential Ordering Problem', 'combinatorial optimization']"
4149,1904.02368,Stefanos Leonardos Mr.,"Nikos Leonardos, Stefanos Leonardos, Georgios Piliouras",Oceanic Games: Centralization Risks and Incentives in Blockchain Mining,"[Best Paper Award] at the International Conference on Mathematical
  Research for Blockchain Economy (MARBLE 2019)","Mathematical Research for Blockchain Economy, Springer
  International Publishing, pp.:183-199, (2020)",10.1007/978-3-030-37110-4_13,,cs.GT cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To participate in the distributed consensus of permissionless blockchains,
prospective nodes -- or miners -- provide proof of designated, costly
resources. However, in contrast to the intended decentralization, current data
on blockchain mining unveils increased concentration of these resources in a
few major entities, typically mining pools. To study strategic considerations
in this setting, we employ the concept of Oceanic Games, Milnor and Shapley
(1978). Oceanic Games have been used to analyze decision making in corporate
settings with small numbers of dominant players (shareholders) and large
numbers of individually insignificant players, the ocean. Unlike standard
equilibrium models, they focus on measuring the value (or power) per entity and
per unit of resource} in a given distribution of resources. These values are
viewed as strategic components in coalition formations, mergers and resource
acquisitions. Considering such issues relevant to blockchain governance and
long-term sustainability, we adapt oceanic games to blockchain mining and
illustrate the defined concepts via examples. The application of existing
results reveals incentives for individual miners to merge in order to increase
the value of their resources. This offers an alternative perspective to the
observed centralization and concentration of mining power. Beyond numerical
simulations, we use the model to identify issues relevant to the design of
future cryptocurrencies and formulate prospective research questions.
","[{'version': 'v1', 'created': 'Thu, 4 Apr 2019 06:12:47 GMT'}, {'version': 'v2', 'created': 'Sun, 19 May 2019 12:08:21 GMT'}, {'version': 'v3', 'created': 'Thu, 30 May 2019 01:04:26 GMT'}, {'version': 'v4', 'created': 'Sun, 18 Jul 2021 13:11:58 GMT'}]",2021-07-20,"[['Leonardos', 'Nikos', ''], ['Leonardos', 'Stefanos', ''], ['Piliouras', 'Georgios', '']]","['Blockchain', 'Cryptocurrencies', 'Resources', 'Mining Pools', 'Oceanic Games', 'Values']"
4150,0909.5091,Stefano Zacchiroli,"Ralf Treinen (PPS), Stefano Zacchiroli (PPS)",Expressing advanced user preferences in component installation,,"IWOCE 2009: 1st international workshop on Open component
  ecosystems, Amsterdam : Netherlands (2009)",10.1145/1595800.1595806,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  State of the art component-based software collections - such as FOSS
distributions - are made of up to dozens of thousands components, with complex
inter-dependencies and conflicts. Given a particular installation of such a
system, each request to alter the set of installed components has potentially
(too) many satisfying answers. We present an architecture that allows to
express advanced user preferences about package selection in FOSS
distributions. The architecture is composed by a distribution-independent
format for describing available and installed packages called CUDF (Common
Upgradeability Description Format), and a foundational language called MooML to
specify optimization criteria. We present the syntax and semantics of CUDF and
MooML, and discuss the partial evaluation mechanism of MooML which allows to
gain efficiency in package dependency solvers.
","[{'version': 'v1', 'created': 'Mon, 28 Sep 2009 13:31:17 GMT'}]",2009-09-29,"[['Treinen', 'Ralf', '', 'PPS'], ['Zacchiroli', 'Stefano', '', 'PPS']]","['FOSS', 'upgrade', 'packages', 'selection', 'preferences']"
4151,1903.07273,Michael Biehl,"Michael Biehl, Fthi Abadi, Christina G\""opfert, and Barbara Hammer","Prototype-based classifiers in the presence of concept drift: A
  modelling framework","Accepted contribution to WSOM+ 2019, Barcelona/Spain, June 2019 13th
  International Workshop on Self-Organizing Maps and Learning Vector
  Quantization, Clustering and Data Visualization 11 pages",,10.1007/978-3-030-19642-4,,cs.LG cond-mat.dis-nn stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a modelling framework for the investigation of prototype-based
classifiers in non-stationary environments. Specifically, we study Learning
Vector Quantization (LVQ) systems trained from a stream of high-dimensional,
clustered data.We consider standard winner-takes-all updates known as LVQ1.
Statistical properties of the input data change on the time scale defined by
the training process. We apply analytical methods borrowed from statistical
physics which have been used earlier for the exact description of learning in
stationary environments. The suggested framework facilitates the computation of
learning curves in the presence of virtual and real concept drift. Here we
focus on timedependent class bias in the training data. First results
demonstrate that, while basic LVQ algorithms are suitable for the training in
non-stationary environments, weight decay as an explicit mechanism of
forgetting does not improve the performance under the considered drift
processes.
","[{'version': 'v1', 'created': 'Mon, 18 Mar 2019 06:51:03 GMT'}]",2019-04-08,"[['Biehl', 'Michael', ''], ['Abadi', 'Fthi', ''], ['G\x7föpfert', 'Christina', ''], ['Hammer', 'Barbara', '']]","['LVQ', 'concept drift', 'weight decay', 'supervised learning']"
4152,0706.3430,Caleb Lo,"Caleb K. Lo, Robert W. Heath Jr. and Sriram Vishwanath","The Impact of Channel Feedback on Opportunistic Relay Selection for
  Hybrid-ARQ in Wireless Networks","30 pages, 9 figures, submitted to the IEEE Transactions on Vehicular
  Technology, revised March 2008",,10.1109/TVT.2008.928896,,cs.IT math.IT,,"  This paper presents a decentralized relay selection protocol for a dense
wireless network and describes channel feedback strategies that improve its
performance. The proposed selection protocol supports hybrid
automatic-repeat-request transmission where relays forward parity information
to the destination in the event of a decoding error. Channel feedback is
employed for refining the relay selection process and for selecting an
appropriate transmission mode in a proposed adaptive modulation transmission
framework. An approximation of the throughput of the proposed adaptive
modulation strategy is presented, and the dependence of the throughput on
system parameters such as the relay contention probability and the adaptive
modulation switching point is illustrated via maximization of this
approximation. Simulations show that the throughput of the proposed selection
strategy is comparable to that yielded by a centralized selection approach that
relies on geographic information.
","[{'version': 'v1', 'created': 'Sat, 23 Jun 2007 06:19:41 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Jan 2008 21:15:03 GMT'}, {'version': 'v3', 'created': 'Tue, 1 Apr 2008 00:02:32 GMT'}]",2016-11-15,"[['Lo', 'Caleb K.', ''], ['Heath', 'Robert W.', 'Jr.'], ['Vishwanath', 'Sriram', '']]","['Adaptive modulation', 'automatic repeat request', 'convolutional codes', 'relays']"
4153,0812.5064,Qiang Li,"Qiang Li, Zhuo Chen, Yan He, Jing-ping Jiang",A Novel Clustering Algorithm Based Upon Games on Evolving Network,"17 pages, 5 figures, 3 tables","Expert Systems with Applications, 2010",10.1016/j.eswa.2010.02.050,,cs.LG cs.CV cs.GT nlin.AO,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper introduces a model based upon games on an evolving network, and
develops three clustering algorithms according to it. In the clustering
algorithms, data points for clustering are regarded as players who can make
decisions in games. On the network describing relationships among data points,
an edge-removing-and-rewiring (ERR) function is employed to explore in a
neighborhood of a data point, which removes edges connecting to neighbors with
small payoffs, and creates new edges to neighbors with larger payoffs. As such,
the connections among data points vary over time. During the evolution of
network, some strategies are spread in the network. As a consequence, clusters
are formed automatically, in which data points with the same evolutionarily
stable strategy are collected as a cluster, so the number of evolutionarily
stable strategies indicates the number of clusters. Moreover, the experimental
results have demonstrated that data points in datasets are clustered reasonably
and efficiently, and the comparison with other algorithms also provides an
indication of the effectiveness of the proposed algorithms.
","[{'version': 'v1', 'created': 'Tue, 30 Dec 2008 13:22:31 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Mar 2010 13:30:08 GMT'}]",2010-03-22,"[['Li', 'Qiang', ''], ['Chen', 'Zhuo', ''], ['He', 'Yan', ''], ['Jiang', 'Jing-ping', '']]","['Unsupervised learning', 'data clustering', 'evolutionary game theory', 'evolutionarily stable strategy']"
4154,1609.03438,Joerg Puehrer,"Gerhard Brewka, Stefan Ellmauthaler, Ricardo Gon\c{c}alves, Matthias
  Knorr, Jo\~ao Leite, J\""org P\""uhrer","Reactive Multi-Context Systems: Heterogeneous Reasoning in Dynamic
  Environments",,Artificial Intelligence 256 (2018) 68-104,10.1016/j.artint.2017.11.007,,cs.LO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Managed multi-context systems (mMCSs) allow for the integration of
heterogeneous knowledge sources in a modular and very general way. They were,
however, mainly designed for static scenarios and are therefore not well-suited
for dynamic environments in which continuous reasoning over such heterogeneous
knowledge with constantly arriving streams of data is necessary. In this paper,
we introduce reactive multi-context systems (rMCSs), a framework for reactive
reasoning in the presence of heterogeneous knowledge sources and data streams.
We show that rMCSs are indeed well-suited for this purpose by illustrating how
several typical problems arising in the context of stream reasoning can be
handled using them, by showing how inconsistencies possibly occurring in the
integration of multiple knowledge sources can be handled, and by arguing that
the potential non-determinism of rMCSs can be avoided if needed using an
alternative, more skeptical well-founded semantics instead with beneficial
computational properties. We also investigate the computational complexity of
various reasoning problems related to rMCSs. Finally, we discuss related work,
and show that rMCSs do not only generalize mMCSs to dynamic settings, but also
capture/extend relevant approaches w.r.t. dynamics in knowledge representation
and stream reasoning.
","[{'version': 'v1', 'created': 'Mon, 12 Sep 2016 15:12:00 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Dec 2016 11:20:56 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Dec 2017 08:59:56 GMT'}]",2017-12-12,"[['Brewka', 'Gerhard', ''], ['Ellmauthaler', 'Stefan', ''], ['Gonçalves', 'Ricardo', ''], ['Knorr', 'Matthias', ''], ['Leite', 'João', ''], ['Pührer', 'Jörg', '']]","['Heterogeneous knowledge', 'Stream reasoning', 'Knowledge integration', 'Reactive systems', 'Dynamic systems']"
4155,2105.06109,Kishor Datta Gupta,Kishor Datta Gupta and Dipankar Dasgupta,"Negative Selection Algorithm Research and Applications in the last
  decade: A Review","Dataset and code: https://github.com/kishordgupta/OCC_DATASET and
  https://github.com/kishordgupta/pyod",,10.1109/TAI.2021.3114661,,cs.NE cs.AI,http://creativecommons.org/licenses/by/4.0/,"  The Negative selection Algorithm (NSA) is one of the important methods in the
field of Immunological Computation (or Artificial Immune Systems). Over the
years, some progress was made which turns this algorithm (NSA) into an
efficient approach to solve problems in different domain. This review takes
into account these signs of progress during the last decade and categorizes
those based on different characteristics and performances. Our study shows that
NSA's evolution can be labeled in four ways highlighting the most notable NSA
variations and their limitations in different application domains. We also
present alternative approaches to NSA for comparison and analysis. It is
evident that NSA performs better for nonlinear representation than most of the
other methods, and it can outperform neural-based models in computation time.
We summarize NSA's development and highlight challenges in NSA research in
comparison with other similar models.
","[{'version': 'v1', 'created': 'Thu, 13 May 2021 06:58:03 GMT'}]",2022-05-10,"[['Gupta', 'Kishor Datta', ''], ['Dasgupta', 'Dipankar', '']]","['Negative Selection Algorithm', 'Artificial Immune System', 'Immunological Computation', 'Negative DataRepresentation']"
4156,1806.08269,Krishnendu Rarhi,"Krishnendu Rarhi, Rhea Bonnerji, Simanta Sarkar, Abhishek Bhattacharya",COZMO-A New Lightweight Stream Cipher,,,10.7287/peerj.preprints.6571,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with the merger of the two lightweight stream ciphers: A5by1
and Trivium. The idea is to make the key stream generation more secure and to
remove the attacks of the individual algorithms. The bits generated by the
Trivium cipher will act as the input of the A5by1 cipher. The registers used in
the A5by1 cipher will be filled by the output bits of the Trivium cipher. The
three registers will then be connected to generate an output which will be our
required key stream.
","[{'version': 'v1', 'created': 'Thu, 21 Jun 2018 14:41:02 GMT'}]",2018-06-22,"[['Rarhi', 'Krishnendu', ''], ['Bonnerji', 'Rhea', ''], ['Sarkar', 'Simanta', ''], ['Bhattacharya', 'Abhishek', '']]","['Lightweight stream cipher', 'A5/1', 'Trivium']"
4157,1807.05854,Jacob Shermeyer,Jacob Shermeyer,"Assessment of electrical and infrastructure recovery in Puerto Rico
  following hurricane Maria using a multisource time series of satellite
  imagery","15 pages, 5 figures, 5 videos",,10.1117/12.2325585,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Puerto Rico suffered severe damage from the category 5 hurricane (Maria) in
September 2017. Total monetary damages are estimated to be ~92 billion USD, the
third most costly tropical cyclone in US history. The response to this damage
has been tempered and slow moving, with recent estimates placing 45% of the
population without power three months after the storm. Consequently, we
developed a unique data-fusion mapping approach called the Urban Development
Index (UDI) and new open source tool, Comet Time Series (CometTS), to analyze
the recovery of electricity and infrastructure in Puerto Rico. Our approach
incorporates a combination of time series visualizations and change detection
mapping to create depictions of power or infrastructure loss. It also provides
a unique independent assessment of areas that are still struggling to recover.
For this workflow, our time series approach combines nighttime imagery from the
Suomi National Polar-orbiting Partnership Visible Infrared Imaging Radiometer
Suite (NPP VIIRS), multispectral imagery from two Landsat satellites, US Census
data, and crowd-sourced building footprint labels. Based upon our approach we
can identify and evaluate: 1) the recovery of electrical power compared to
pre-storm levels, 2) the location of potentially damaged infrastructure that
has yet to recover from the storm, and 3) the number of persons without power
over time. As of May 31, 2018, declined levels of observed brightness across
the island indicate that 13.9% +/- ~5.6% of persons still lack power and/or
that 13.2% +/- ~5.3% of infrastructure has been lost. In comparison, the Puerto
Rico Electric Power Authority states that less than 1% of their customers still
are without power.
","[{'version': 'v1', 'created': 'Mon, 16 Jul 2018 13:38:57 GMT'}]",2018-12-12,"[['Shermeyer', 'Jacob', '']]","['Electrification', 'Time Series', 'Hurricane', 'Infrastructure', 'Recovery', 'Puerto Rico']"
4158,1612.04831,Utkarsh Upadhyay,"Utkarsh Upadhyay, Isabel Valera, Manuel Gomez-Rodriguez",Uncovering the Dynamics of Crowdlearning and the Value of Knowledge,"To appear in Tenth ACM International conference on Web Search and
  Data Mining (WSDM) in 2017",,10.1145/3018661.3018685,,cs.SI cs.LG physics.soc-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning from the crowd has become increasingly popular in the Web and social
media. There is a wide variety of crowdlearning sites in which, on the one
hand, users learn from the knowledge that other users contribute to the site,
and, on the other hand, knowledge is reviewed and curated by the same users
using assessment measures such as upvotes or likes.
  In this paper, we present a probabilistic modeling framework of
crowdlearning, which uncovers the evolution of a user's expertise over time by
leveraging other users' assessments of her contributions. The model allows for
both off-site and on-site learning and captures forgetting of knowledge. We
then develop a scalable estimation method to fit the model parameters from
millions of recorded learning and contributing events. We show the
effectiveness of our model by tracing activity of ~25 thousand users in Stack
Overflow over a 4.5 year period. We find that answers with high knowledge value
are rare. Newbies and experts tend to acquire less knowledge than users in the
middle range. Prolific learners tend to be also proficient contributors that
post answers with high knowledge value.
","[{'version': 'v1', 'created': 'Wed, 14 Dec 2016 21:00:11 GMT'}]",2016-12-16,"[['Upadhyay', 'Utkarsh', ''], ['Valera', 'Isabel', ''], ['Gomez-Rodriguez', 'Manuel', '']]","['User modelling; Education; Markets', 'crowds; Social', 'information networks']"
4159,1006.5226,Damien Chablat,"Liang Ma (IRCCyN, DIE), Wei Zhang (DIE), Huanzhang Fu (DIE), Yang Guo
  (DIE), Damien Chablat (IRCCyN), Fouad Bennis (IRCCyN)","A Framework for Interactive Work Design based on Digital Work Analysis
  and Simulation",,"Human Factors and Ergonomics in Manufacturing 20, 4 (2010) 339-352",10.1002/hfm.20178,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the flexibility and adaptability of human, manual handling work is
still very important in industry, especially for assembly and maintenance work.
Well-designed work operation can improve work efficiency and quality; enhance
safety, and lower cost. Most traditional methods for work system analysis need
physical mock-up and are time consuming. Digital mockup (DMU) and digital human
modeling (DHM) techniques have been developed to assist ergonomic design and
evaluation for a specific worker population (e.g. 95 percentile); however, the
operation adaptability and adjustability for a specific individual are not
considered enough. In this study, a new framework based on motion tracking
technique and digital human simulation technique is proposed for motion-time
analysis of manual operations. A motion tracking system is used to track a
worker's operation while he/she is conducting a manual handling work. The
motion data is transferred to a simulation computer for real time digital human
simulation. The data is also used for motion type recognition and analysis
either online or offline for objective work efficiency evaluation and
subjective work task evaluation. Methods for automatic motion recognition and
analysis are presented. Constraints and limitations of the proposed method are
discussed.
","[{'version': 'v1', 'created': 'Sun, 27 Jun 2010 17:30:13 GMT'}]",2010-07-28,"[['Ma', 'Liang', '', 'IRCCyN, DIE'], ['Zhang', 'Wei', '', 'DIE'], ['Fu', 'Huanzhang', '', 'DIE'], ['Guo', 'Yang', '', 'DIE'], ['Chablat', 'Damien', '', 'IRCCyN'], ['Bennis', 'Fouad', '', 'IRCCyN']]","['Methods-time measurement (MTM)', 'Maynard operation sequence technique (MOST)', 'motion']"
4160,1304.4184,Srikantaiah K C,"K. C. Srikantaiah, N. Krishna Kumar, K. R. Venugopal, L. M. Patnaik","Bidirectional Growth based Mining and Cyclic Behaviour Analysis of Web
  Sequential Patterns",19 pages,"International Journal of Data Mining & Knowledge Management
  Process (IJDKP) Vol.3, No.2, March 2013",10.5121/ijdkp.2013.3204,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web sequential patterns are important for analyzing and understanding users
behaviour to improve the quality of service offered by the World Wide Web. Web
Prefetching is one such technique that utilizes prefetching rules derived
through Cyclic Model Analysis of the mined Web sequential patterns. The more
accurate the prediction and more satisfying the results of prefetching if we
use a highly efficient and scalable mining technique such as the Bidirectional
Growth based Directed Acyclic Graph. In this paper, we propose a novel
algorithm called Bidirectional Growth based mining Cyclic behavior Analysis of
web sequential Patterns (BGCAP) that effectively combines these strategies to
generate prefetching rules in the form of 2-sequence patterns with Periodicity
and threshold of Cyclic Behaviour that can be utilized to effectively prefetch
Web pages, thus reducing the users perceived latency. As BGCAP is based on
Bidirectional pattern growth, it performs only (log n+1) levels of recursion
for mining n Web sequential patterns. Our experimental results show that
prefetching rules generated using BGCAP is 5-10 percent faster for different
data sizes and 10-15% faster for a fixed data size than TD-Mine. In addition,
BGCAP generates about 5-15 percent more prefetching rules than TD-Mine.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2013 17:36:57 GMT'}]",2013-04-16,"[['Srikantaiah', 'K. C.', ''], ['Kumar', 'N. Krishna', ''], ['Venugopal', 'K. R.', ''], ['Patnaik', 'L. M.', '']]","['Cyclic Behaviour', 'Periodicity', 'Sequential Pattern Analysis', 'Web Prefetching', 'Web Sequential Pattern Mining']"
4161,1709.08115,Ali Yekkehkhany,"Ali Yekkehkhany, Avesta Hojjati, Mohammad H Hajiesmaili","GB-PANDAS: Throughput and heavy-traffic optimality analysis for affinity
  scheduling","IFIP WG 7.3 Performance 2017 - The 35th International Symposium on
  Computer Performance, Modeling, Measurements and Evaluation 2017",,10.1145/3199524.3199528,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dynamic affinity scheduling has been an open problem for nearly three
decades. The problem is to dynamically schedule multi-type tasks to
multi-skilled servers such that the resulting queueing system is both stable in
the capacity region (throughput optimality) and the mean delay of tasks is
minimized at high loads near the boundary of the capacity region (heavy-traffic
optimality). As for applications, data-intensive analytics like MapReduce,
Hadoop, and Dryad fit into this setting, where the set of servers is
heterogeneous for different task types, so the pair of task type and server
determines the processing rate of the task. The load balancing algorithm used
in such frameworks is an example of affinity scheduling which is desired to be
both robust and delay optimal at high loads when hot-spots occur. Fluid model
planning, the MaxWeight algorithm, and the generalized $c\mu$-rule are among
the first algorithms proposed for affinity scheduling that have theoretical
guarantees on being optimal in different senses, which will be discussed in the
related work section. All these algorithms are not practical for use in data
center applications because of their non-realistic assumptions. The
join-the-shortest-queue-MaxWeight (JSQ-MaxWeight), JSQ-Priority, and
weighted-workload algorithms are examples of load balancing policies for
systems with two and three levels of data locality with a rack structure. In
this work, we propose the Generalized-Balanced-Pandas algorithm (GB-PANDAS) for
a system with multiple levels of data locality and prove its throughput
optimality. We prove this result under an arbitrary distribution for service
times, whereas most previous theoretical work assumes geometric distribution
for service times. The extensive simulation results show that the GB-PANDAS
algorithm alleviates the mean delay and has a better performance than the
JSQ-MaxWeight algorithm by twofold
","[{'version': 'v1', 'created': 'Sat, 23 Sep 2017 20:38:25 GMT'}]",2019-01-15,"[['Yekkehkhany', 'Ali', ''], ['Hojjati', 'Avesta', ''], ['Hajiesmaili', 'Mohammad H', '']]","['Afnity scheduling', 'MapReduce', 'near-data scheduling', 'data locality', 'data center', 'big data']"
4162,1808.02712,Tao Zheng,Tao Zheng,"An Effective Framework for Constructing Exponent Lattice Basis of
  Nonzero Algebraic Numbers","8 pages,no figure,18 conferences",,10.1145/3326229.3326243,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computing a basis for the exponent lattice of algebraic numbers is a basic
problem in the field of computational number theory with applications to many
other areas. The main cost of a well-known algorithm
\cite{ge1993algorithms,kauers2005algorithms} solving the problem is on
computing the primitive element of the extended field generated by the given
algebraic numbers. When the extended field is of large degree, the problem
seems intractable by the tool implementing the algorithm. In this paper, a
special kind of exponent lattice basis is introduced. An important feature of
the basis is that it can be inductively constructed, which allows us to deal
with the given algebraic numbers one by one when computing the basis. Based on
this, an effective framework for constructing exponent lattice basis is
proposed. Through computing a so-called pre-basis first and then solving some
linear Diophantine equations, the basis can be efficiently constructed. A new
certificate for multiplicative independence and some techniques for decreasing
degrees of algebraic numbers are provided to speed up the computation. The new
algorithm has been implemented with Mathematica and its effectiveness is
verified by testing various examples. Moreover, the algorithm is applied to
program verification for finding invariants of linear loops.
","[{'version': 'v1', 'created': 'Wed, 8 Aug 2018 10:28:11 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Jan 2019 08:15:31 GMT'}, {'version': 'v3', 'created': 'Wed, 8 May 2019 18:53:05 GMT'}]",2019-12-17,"[['Zheng', 'Tao', '']]","['Exponent Lattice Basis', 'Multiplicative dependence', 'Multiplicativerelation', 'Diophantine equation', 'Algebraic number']"
4163,1811.10868,Yu Han,"Yu Han, Zhongru Wang, Qiang Ruan and Binxing Fang",Sapiens Chain: A Blockchain-based Cybersecurity Framework,,,10.5121/csit.2018.81509,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, cybersecurity becomes more and more important due to the rapid
development of Internet. However, existing methods are in reality highly
sensitive to attacks and are far more vulnerable than expected, as they are
lack of trustable measures. In this paper, to address the aforementioned
problems, we propose a blockchain-based cybersecurity framework, termed as
Sapiens Chain, which can protect the privacy of the anonymous users and ensure
that the transactions are immutable by providing decentralized and trustable
services. Integrating semantic analysis, symbolic execution, and routing
learning methods into intelligent auditing, this framework can achieve good
accuracy for detecting hidden vulnerabilities. In addition, a revenue incentive
mechanism, which aims to donate participants, is built. The practical results
demonstrate the effectiveness of the proposed framework.
","[{'version': 'v1', 'created': 'Tue, 27 Nov 2018 08:27:49 GMT'}]",2018-11-28,"[['Han', 'Yu', ''], ['Wang', 'Zhongru', ''], ['Ruan', 'Qiang', ''], ['Fang', 'Binxing', '']]","['Cybersecurity', 'Blockchain', 'Decentralized Model']"
4164,1907.11105,Raoul Heese,"Raoul Heese and Micha{\l} Walczak and Lukas Morand and Dirk Helm and
  Michael Bortz","The Good, the Bad and the Ugly: Augmenting a black-box model with expert
  knowledge",International Conference on Artificial Neural Networks (ICANN) 2019,"Artificial Neural Networks and Machine Learning - ICANN 2019:
  Workshop and Special Sessions. ICANN 2019. Lecture Notes in Computer Science
  11731 (2019) 391-395",10.1007/978-3-030-30493-5_38,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address a non-unique parameter fitting problem in the context of material
science. In particular, we propose to resolve ambiguities in parameter space by
augmenting a black-box artificial neural network (ANN) model with two different
levels of expert knowledge and benchmark them against a pure black-box model.
","[{'version': 'v1', 'created': 'Wed, 24 Jul 2019 09:15:01 GMT'}, {'version': 'v2', 'created': 'Mon, 11 May 2020 17:07:49 GMT'}]",2020-05-12,"[['Heese', 'Raoul', ''], ['Walczak', 'Michał', ''], ['Morand', 'Lukas', ''], ['Helm', 'Dirk', ''], ['Bortz', 'Michael', '']]","['expert knowledge', 'mixture of experts', 'custom loss']"
4165,2208.14656,Yang Sun,"Yang Sun, Christopher M. Poskitt, Jun Sun, Yuqi Chen, Zijiang Yang","LawBreaker: An Approach for Specifying Traffic Laws and Fuzzing
  Autonomous Vehicles","Accepted by the 37th IEEE/ACM International Conference on Automated
  Software Engineering (ASE 2022)","Proc. ASE'22, Article No. 62, pages 1-12. ACM, 2022",10.1145/3551349.3556897,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autonomous driving systems (ADSs) must be tested thoroughly before they can
be deployed in autonomous vehicles. High-fidelity simulators allow them to be
tested against diverse scenarios, including those that are difficult to
recreate in real-world testing grounds. While previous approaches have shown
that test cases can be generated automatically, they tend to focus on weak
oracles (e.g. reaching the destination without collisions) without assessing
whether the journey itself was undertaken safely and satisfied the law. In this
work, we propose LawBreaker, an automated framework for testing ADSs against
real-world traffic laws, which is designed to be compatible with different
scenario description languages. LawBreaker provides a rich driver-oriented
specification language for describing traffic laws, and a fuzzing engine that
searches for different ways of violating them by maximising specification
coverage. To evaluate our approach, we implemented it for Apollo+LGSVL and
specified the traffic laws of China. LawBreaker was able to find 14 violations
of these laws, including 173 test cases that caused accidents.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2022 07:03:03 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Oct 2022 14:40:47 GMT'}]",2023-01-09,"[['Sun', 'Yang', ''], ['Poskitt', 'Christopher M.', ''], ['Sun', 'Jun', ''], ['Chen', 'Yuqi', ''], ['Yang', 'Zijiang', '']]","['Autonomous vehicles', 'traffic laws', 'fuzzing', 'STL', 'LGSVL', 'Apollo']"
4166,1907.05916,Yahui Liu,"Yahui Liu, Marco De Nadai, Gloria Zen, Nicu Sebe, Bruno Lepri","Gesture-to-Gesture Translation in the Wild via Category-Independent
  Conditional Maps","15 pages, 12 figures","27th ACM International Conference on Multimedia, 2019",10.1145/3343031.3351020,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent works have shown Generative Adversarial Networks (GANs) to be
particularly effective in image-to-image translations. However, in tasks such
as body pose and hand gesture translation, existing methods usually require
precise annotations, e.g. key-points or skeletons, which are time-consuming to
draw. In this work, we propose a novel GAN architecture that decouples the
required annotations into a category label - that specifies the gesture type -
and a simple-to-draw category-independent conditional map - that expresses the
location, rotation and size of the hand gesture. Our architecture synthesizes
the target gesture while preserving the background context, thus effectively
dealing with gesture translation in the wild. To this aim, we use an attention
module and a rolling guidance approach, which loops the generated images back
into the network and produces higher quality images compared to competing
works. Thus, our GAN learns to generate new images from simple annotations
without requiring key-points or skeleton labels. Results on two public datasets
show that our method outperforms state of the art approaches both
quantitatively and qualitatively. To the best of our knowledge, no work so far
has addressed the gesture-to-gesture translation in the wild by requiring
user-friendly annotations.
","[{'version': 'v1', 'created': 'Fri, 12 Jul 2019 18:39:27 GMT'}, {'version': 'v2', 'created': 'Sat, 27 Jul 2019 10:24:21 GMT'}, {'version': 'v3', 'created': 'Wed, 31 Jul 2019 08:55:11 GMT'}]",2019-11-11,"[['Liu', 'Yahui', ''], ['De Nadai', 'Marco', ''], ['Zen', 'Gloria', ''], ['Sebe', 'Nicu', ''], ['Lepri', 'Bruno', '']]","['GANs', 'image translation', 'hand gesture']"
4167,1807.04130,Mohammad Masudur Rahman,"Mohammad Masudur Rahman, Chanchal K. Roy, Jesse Redl and Jason A.
  Collins","CORRECT: Code Reviewer Recommendation at GitHub for Vendasta
  Technologies","The 31st IEEE/ACM International Conference on Automated Software
  Engineering (ASE 2016), pp. 792--797, Singapore, September 2016. arXiv admin
  note: substantial text overlap with arXiv:1807.02965","Proc. ASE 2016, pp. 792--797",10.1145/2970276.2970283,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Peer code review locates common coding standard violations and simple logical
errors in the early phases of software development, and thus, reduces overall
cost. Unfortunately, at GitHub, identifying an appropriate code reviewer for a
pull request is challenging given that reliable information for reviewer
identification is often not readily available. In this paper, we propose a code
reviewer recommendation tool--CORRECT--that considers not only the relevant
cross-project work experience (e.g., external library experience) of a
developer but also her experience in certain specialized technologies (e.g.,
Google App Engine) associated with a pull request for determining her expertise
as a potential code reviewer. We design our tool using client-server
architecture, and then package the solution as a Google Chrome plug-in. Once
the developer initiates a new pull request at GitHub, our tool automatically
analyzes the request, mines two relevant histories, and then returns a ranked
list of appropriate code reviewers for the request within the browser's
context.
  Demo: https://www.youtube.com/watch?v=rXU1wTD6QQ0
","[{'version': 'v1', 'created': 'Mon, 9 Jul 2018 06:50:03 GMT'}]",2018-07-12,"[['Rahman', 'Mohammad Masudur', ''], ['Roy', 'Chanchal K.', ''], ['Redl', 'Jesse', ''], ['Collins', 'Jason A.', '']]","['Code reviewer recommendation', 'cross-project experience', 'specialized technology experience', 'GitHub', 'pull request']"
4168,1708.01143,Marcelo Saval Calvo,"Marcelo Saval-Calvo and Jorge Azorin-Lopez and Andres Fuster-Guillo
  and Jose Garcia-Rodriguez","Three-dimensional planar model estimation using multi-constraint
  knowledge based on k-means and RANSAC",,"Applied Soft Computing, Vol. 34, p. 572-586 (2015)",10.1016/j.asoc.2015.05.007,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Plane model extraction from three-dimensional point clouds is a necessary
step in many different applications such as planar object reconstruction,
indoor mapping and indoor localization. Different RANdom SAmple Consensus
(RANSAC)-based methods have been proposed for this purpose in recent years. In
this study, we propose a novel method-based on RANSAC called Multiplane Model
Estimation, which can estimate multiple plane models simultaneously from a
noisy point cloud using the knowledge extracted from a scene (or an object) in
order to reconstruct it accurately. This method comprises two steps: first, it
clusters the data into planar faces that preserve some constraints defined by
knowledge related to the object (e.g., the angles between faces); and second,
the models of the planes are estimated based on these data using a novel
multi-constraint RANSAC. We performed experiments in the clustering and RANSAC
stages, which showed that the proposed method performed better than
state-of-the-art methods.
","[{'version': 'v1', 'created': 'Thu, 3 Aug 2017 13:58:18 GMT'}]",2017-08-04,"[['Saval-Calvo', 'Marcelo', ''], ['Azorin-Lopez', 'Jorge', ''], ['Fuster-Guillo', 'Andres', ''], ['Garcia-Rodriguez', 'Jose', '']]","['computer vision', 'model extraction', 'RANSAC multi-plane', 'three-dimensional planes']"
4169,2109.00868,Celine Comte,"Mark van der Boor (TU/e), C\'eline Comte (TU/e)","Load Balancing in Heterogeneous Server Clusters: Insights From a
  Product-Form Queueing Model",,"2021 IEEE/ACM 29th International Symposium on Quality of Service
  (IWQOS), Jun 2021, Tokyo, Japan. pp.1-10",10.1109/IWQOS52092.2021.9521355,,cs.NI math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efficiently exploiting servers in data centers requires performance analysis
methods that account not only for the stochastic nature of demand but also for
server heterogeneity. Although several recent works proved optimality results
for heterogeneity-aware variants of classical load-balancing algorithms in the
many-server regime, we still lack a fundamental understanding of the impact of
heterogeneity on performance in finite-size systems. In this paper, we consider
a load-balancing algorithm that leads to a product-form queueing model and can
therefore be analyzed exactly even when the number of servers is finite. We
develop new analytical methods that exploit its product-form stationary
distribution to understand the joint impact of the speeds and buffer lengths of
servers on performance. These analytical results are supported and complemented
by numerical evaluations that cover a large variety of scenarios.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2021 12:30:43 GMT'}]",2021-09-03,"[['van der Boor', 'Mark', '', 'TU/e'], ['Comte', 'Céline', '', 'TU/e']]","['Load balancing', 'performance analysis', 'product-form queueing model', 'Jackson network', 'insensitivity']"
4170,1611.08830,Daniel M\'endez Fern\'andez,"J. Eckhardt, A. Vogelsang, D. M\'endez Fern\'andez",On the Distinction of Functional and Quality Requirements in Practice,"Proceedings of the 17th International Conference on Product-Focused
  Software Process Improvement, 2016",,10.1007/978-3-319-49094-6_3,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Requirements are often divided into functional requirements (FRs) and quality
requirements (QRs). However, we still have little knowledge about to which
extent this distinction makes sense from a practical perspective. In this
paper, we report on a survey we conducted with 103 practitioners to explore
whether and, if so, why they handle requirements labeled as FRs differently
from those labeled as QRs. We additionally asked for consequences of this
distinction w.r.t. the development process. Our results indicate that the
development process for requirements of the two classes strongly differs (e.g.,
in testing). We identified a number of reasons why practitioners do (or do not)
distinguish between QRs and FRs in their documentation and we analyzed both
problems and benefits that arise from that. We found, for instance, that many
reasons are based on expectations rather than on evidence. Those expectations
are, in fact, not reflected in specific negative or positive consequences per
se. It therefore seems more important that the decision whether to make an
explicit distinction or not should be made consciously such that people are
also aware of the risks that this distinction bears so that they may take
appropriate countermeasures.
","[{'version': 'v1', 'created': 'Sun, 27 Nov 2016 12:17:20 GMT'}]",2016-11-29,"[['Eckhardt', 'J.', ''], ['Vogelsang', 'A.', ''], ['Fernández', 'D. Méndez', '']]","['Quality requirements', 'functional requirements', 'survey']"
4171,1302.1667,Meriem Meriem,"Meriem Zerkouk, Abdallah Mhamed, Belhadri Messabih",A user profile based access control model and architecture,"10 pages, 3 figures","International Journal of Computer Networks & Communications
  (IJCNC) Vol.5, No.1, January 2013",10.5121/ijcnc.2013.5112,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Personalization and adaptation to the user profile capability are the hottest
issues to ensure ambient assisted living and context awareness in nowadays
environments. With the growing healthcare and wellbeing context aware
applications, modeling security policies becomes an important issue in the
design of future access control models. This requires rich semantics using
ontology modeling for the management of services provided to dependant people.
However, current access control models remain unsuitable due to lack of
personalization, adaptability and smartness to the handicap situation. In this
paper, we propose a novel adaptable access control model and its related
architecture in which the security policy is based on the handicap situation
analyzed from the monitoring of userss behavior in order to grant a service
using any assistive device within intelligent environment. the design of our
model is an ontology-learning and evolving security policy for predicting the
future actions of dependent people. This is reached by reasoning about
historical data, contextual data and user behavior according to the access
rules that are used in the inference engine to provide the right service
according to the users needs.
","[{'version': 'v1', 'created': 'Thu, 7 Feb 2013 08:14:24 GMT'}, {'version': 'v2', 'created': 'Sun, 10 Feb 2013 18:39:48 GMT'}]",2013-02-12,"[['Zerkouk', 'Meriem', ''], ['Mhamed', 'Abdallah', ''], ['Messabih', 'Belhadri', '']]","['Ambient assisted living', 'personalization', 'adaptation', 'authentication', 'authorization', 'context awareness', 'user profile', 'access control']"
4172,2105.04117,KayYen Wong,"KayYen Wong, Miriam Redi, Diego Saez-Trumper","Wiki-Reliability: A Large Scale Dataset for Content Reliability on
  Wikipedia","Proceedings of the 44th International ACM SIGIR Conference on
  Research and Development in Information Retrieval (SIGIR '21), 2021",,10.1145/3404835.3463253,,cs.IR cs.CL cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  Wikipedia is the largest online encyclopedia, used by algorithms and web
users as a central hub of reliable information on the web. The quality and
reliability of Wikipedia content is maintained by a community of volunteer
editors. Machine learning and information retrieval algorithms could help scale
up editors' manual efforts around Wikipedia content reliability. However, there
is a lack of large-scale data to support the development of such research. To
fill this gap, in this paper, we propose Wiki-Reliability, the first dataset of
English Wikipedia articles annotated with a wide set of content reliability
issues. To build this dataset, we rely on Wikipedia ""templates"". Templates are
tags used by expert Wikipedia editors to indicate content issues, such as the
presence of ""non-neutral point of view"" or ""contradictory articles"", and serve
as a strong signal for detecting reliability issues in a revision. We select
the 10 most popular reliability-related templates on Wikipedia, and propose an
effective method to label almost 1M samples of Wikipedia article revisions as
positive or negative with respect to each template. Each positive/negative
example in the dataset comes with the full article text and 20 features from
the revision's metadata. We provide an overview of the possible downstream
tasks enabled by such data, and show that Wiki-Reliability can be used to train
large-scale models for content reliability prediction. We release all data and
code for public use.
","[{'version': 'v1', 'created': 'Mon, 10 May 2021 05:07:03 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Jun 2021 11:57:14 GMT'}]",2021-06-02,"[['Wong', 'KayYen', ''], ['Redi', 'Miriam', ''], ['Saez-Trumper', 'Diego', '']]","['Wikipedia', 'Dataset', 'NLP', 'Reliability', 'Hoaxes', 'POV', 'Unreferenced']"
4173,1908.03630,Loris Nanni,"Alessandra Lumini, Loris Nanni, Alice Codogno, Filippo Berno",Learning morphological operators for skin detection,,Journal of Artificial Intelligence and Systems (2019),10.33969/AIS.2019.11004,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we propose a novel post processing approach for skin detectors
based on trained morphological operators. The first step, consisting in skin
segmentation is performed according to an existing skin detection approach is
performed for skin segmentation, then a second step is carried out consisting
in the application of a set of morphological operators to refine the resulting
mask. Extensive experimental evaluation performed considering two different
detection approaches (one based on deep learning and a handcrafted one) carried
on 10 different datasets confirms the quality of the proposed method.
","[{'version': 'v1', 'created': 'Fri, 9 Aug 2019 21:05:11 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Sep 2019 22:01:10 GMT'}]",2019-10-01,"[['Lumini', 'Alessandra', ''], ['Nanni', 'Loris', ''], ['Codogno', 'Alice', ''], ['Berno', 'Filippo', '']]","['Skin classification', 'skin detection', 'skin segmentation', 'Convolutional Neural Networks', 'Morphological operators']"
4174,2105.05361,Philippe Laban,"Philippe Laban, Andrew Hsi, John Canny, Marti A. Hearst","The Summary Loop: Learning to Write Abstractive Summaries Without
  Examples","ACL2020, 16 pages, 9 figures",Association for Computational Linguistics (2020) 5135-5150,10.18653/v1/2020.acl-main.460,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work presents a new approach to unsupervised abstractive summarization
based on maximizing a combination of coverage and fluency for a given length
constraint. It introduces a novel method that encourages the inclusion of key
terms from the original document into the summary: key terms are masked out of
the original document and must be filled in by a coverage model using the
current generated summary. A novel unsupervised training procedure leverages
this coverage model along with a fluency model to generate and score summaries.
When tested on popular news summarization datasets, the method outperforms
previous unsupervised methods by more than 2 R-1 points, and approaches results
of competitive supervised methods. Our model attains higher levels of
abstraction with copied passages roughly two times shorter than prior work, and
learns to compress and merge sentences without supervision.
","[{'version': 'v1', 'created': 'Tue, 11 May 2021 23:19:46 GMT'}]",2021-05-13,"[['Laban', 'Philippe', ''], ['Hsi', 'Andrew', ''], ['Canny', 'John', ''], ['Hearst', 'Marti A.', '']]","['of the document', '• fluency of generated language', 'and• brevity of generated summaries']"
4175,1706.07238,Daniele Falavigna,"Shahab Jalalvand and Matteo Negri and Daniele Falavigna and Marco
  Matassoni and Marco Turchi",Automatic Quality Estimation for ASR System Combination,,,10.1016/j.csl.2017.06.003,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recognizer Output Voting Error Reduction (ROVER) has been widely used for
system combination in automatic speech recognition (ASR). In order to select
the most appropriate words to insert at each position in the output
transcriptions, some ROVER extensions rely on critical information such as
confidence scores and other ASR decoder features. This information, which is
not always available, highly depends on the decoding process and sometimes
tends to over estimate the real quality of the recognized words. In this paper
we propose a novel variant of ROVER that takes advantage of ASR quality
estimation (QE) for ranking the transcriptions at ""segment level"" instead of:
i) relying on confidence scores, or ii) feeding ROVER with randomly ordered
hypotheses. We first introduce an effective set of features to compensate for
the absence of ASR decoder information. Then, we apply QE techniques to perform
accurate hypothesis ranking at segment-level before starting the fusion
process. The evaluation is carried out on two different tasks, in which we
respectively combine hypotheses coming from independent ASR systems and
multi-microphone recordings. In both tasks, it is assumed that the ASR decoder
information is not available. The proposed approach significantly outperforms
standard ROVER and it is competitive with two strong oracles that e xploit
prior knowledge about the real quality of the hypotheses to be combined.
Compared to standard ROVER, the abs olute WER improvements in the two
evaluation scenarios range from 0.5% to 7.3%.
","[{'version': 'v1', 'created': 'Thu, 22 Jun 2017 10:11:34 GMT'}]",2017-06-23,"[['Jalalvand', 'Shahab', ''], ['Negri', 'Matteo', ''], ['Falavigna', 'Daniele', ''], ['Matassoni', 'Marco', ''], ['Turchi', 'Marco', '']]","['automatic speech recognition', 'quality estimation', 'system combination']"
4176,1406.4237,Eswari J,Eswari.J and Dr. S. Jeyadevi,"An Evolutionary Approach for Optimal Citing and Sizing of Micro-Grid in
  Radial Distribution Systems",,"J.Eswari , Dr.S.Jeyadevi. ""An Evolutionary Approach for Optimal
  Citing and Sizing of Micro-Grid in Radial Distribution Systems"",
  International Journal of Engineering Trends and Technology (IJETT),
  V11(9),429-433 May 2014",10.14445/22315381/IJETT-V11P286,,cs.NE,http://creativecommons.org/licenses/by/3.0/,"  This Paper presents the methodology of penetration of Micro-Grids (MG) in the
radial distribution system (RDS). The aim of this paper is to minimize a total
real power loss that descends the performance of the radial distribution system
by integrating various renewable resources as Distributed Generation (DG). The
combination of different types of renewable energy resources contributes a
sustainable MG. These resources are optimally sized and located using
evolutionary approach in various penetration levels. The optimal solutions are
experimented with IEEE 33 radial distribution system using Particle Swarm
Optimization (PSO) technique. The results are quite promising and authenticate
its potential to solve problem in radial distribution system effectively.
","[{'version': 'v1', 'created': 'Tue, 17 Jun 2014 04:52:23 GMT'}]",2014-06-18,"[['J', 'Eswari.', ''], ['Jeyadevi', 'Dr. S.', '']]","['MG', 'DG', 'PSO', 'RDS']"
4177,1609.06532,Kar Wai Lim,Kar Wai Lim and Wray Buntine,"Bibliographic Analysis on Research Publications using Authors,
  Categorical Labels and the Citation Network",Preprint for Journal Machine Learning,"Machine Learning 103(2):185-213, 2016",10.1007/s10994-016-5554-z,,cs.DL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bibliographic analysis considers the author's research areas, the citation
network and the paper content among other things. In this paper, we combine
these three in a topic model that produces a bibliographic model of authors,
topics and documents, using a nonparametric extension of a combination of the
Poisson mixed-topic link model and the author-topic model. This gives rise to
the Citation Network Topic Model (CNTM). We propose a novel and efficient
inference algorithm for the CNTM to explore subsets of research publications
from CiteSeerX. The publication datasets are organised into three corpora,
totalling to about 168k publications with about 62k authors. The queried
datasets are made available online. In three publicly available corpora in
addition to the queried datasets, our proposed model demonstrates an improved
performance in both model fitting and document clustering, compared to several
baselines. Moreover, our model allows extraction of additional useful knowledge
from the corpora, such as the visualisation of the author-topics network.
Additionally, we propose a simple method to incorporate supervision into topic
modelling to achieve further improvement on the clustering task.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2016 12:44:37 GMT'}]",2016-09-22,"[['Lim', 'Kar Wai', ''], ['Buntine', 'Wray', '']]","['Bibliographic analysis', 'Topic model', 'Bayesian nonparametric', 'Author-citationnetwork', 'Pitman-Yor process']"
4178,1909.00955,Kien Nguyen,"Kien Nguyen, Jingyun Yang, Yijun Lin, Jianfa Lin, Yao-Yi Chiang, Cyrus
  Shahabi","Los Angeles Metro Bus Data Analysis Using GPS Trajectory and Schedule
  Data (Demo Paper)","SIGSPATIAL'18, demo paper, 4 pages","26th ACM SIGSPATIAL International Conference on Advances in
  Geographic Information Systems (SIGSPATIAL '18), 2018",10.1145/3274895.3274911,,cs.DB cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the widespread installation of location-enabled devices on public
transportation, public vehicles are generating massive amounts of trajectory
data in real time. However, using these trajectory data for meaningful analysis
requires careful considerations in storing, managing, processing, and
visualizing the data. Using the location data of the Los Angeles Metro bus
system, along with publicly available bus schedule data, we conduct a data
processing and analyses study to measure the performance of the public
transportation system in Los Angeles utilizing a number of metrics including
travel-time reliability, on-time performance, bus bunching, and travel-time
estimation. We demonstrate the visualization of the data analysis results
through an interactive web-based application. The developed algorithms and
system provide powerful tools to detect issues and improve the efficiency of
public transportation systems.
","[{'version': 'v1', 'created': 'Tue, 3 Sep 2019 05:01:44 GMT'}]",2019-09-04,"[['Nguyen', 'Kien', ''], ['Yang', 'Jingyun', ''], ['Lin', 'Yijun', ''], ['Lin', 'Jianfa', ''], ['Chiang', 'Yao-Yi', ''], ['Shahabi', 'Cyrus', '']]","['Public transportation', 'GPS bus', 'Map Matching', 'GPS trajectory']"
4179,1809.06587,Kaushal Shah,Kaushal Shah and Devesh C. Jinwala,"Performance Analysis of Symmetric Key Ciphers in Linear and Grid Based
  Sensor Networks",Cryptography and Information Security (CRIS-2018),,10.5121/csit.2018.80405,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The linear and grid based Wireless Sensor Networks (WSN) are formed by
applications where objects being monitored are either placed in linear or grid
based form. E.g. monitoring oil, water or gas pipelines; perimeter
surveillance; monitoring traffic level of city streets, goods warehouse
monitoring. The security of data is a critical issue for all such applications
and as the devices used for the monitoring purpose have several resource
constraints (bandwidth, storage capacity, battery life); it is significant to
have a lightweight security solution. Therefore, we consider symmetric key
based solutions proposed in the literature as asymmetric based solutions
require more computation, energy and storage of keys. We analyse the symmetric
ciphers with respect to the performance parameters: RAM, ROM consumption and
number of CPU cycles. We perform this simulation analysis in Contiki Cooja by
considering an example scenario on two different motes namely: Sky and Z1. The
aim of this analysis is to come up with the best suited symmetric key based
cipher for the linear and grid based WSN.
","[{'version': 'v1', 'created': 'Tue, 18 Sep 2018 08:31:40 GMT'}]",2018-09-19,"[['Shah', 'Kaushal', ''], ['Jinwala', 'Devesh C.', '']]","['Linear and Grid Based Wireless Sensor Networks', 'Symmetric Key Based Ciphers', 'Performance Analysis', 'Contiki Cooja']"
4180,2208.00428,Haofeng Li,Jiutao Yue and Haofeng Li and Pengxu Wei and Guanbin Li and Liang Lin,Robust Real-World Image Super-Resolution against Adversarial Attacks,"ACM-MM 2021, Code:
  https://github.com/lhaof/Robust-SR-against-Adversarial-Attacks","Proceedings of the 29th ACM International Conference on Multimedia
  (2021) 5148-5157",10.1145/3474085,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently deep neural networks (DNNs) have achieved significant success in
real-world image super-resolution (SR). However, adversarial image samples with
quasi-imperceptible noises could threaten deep learning SR models. In this
paper, we propose a robust deep learning framework for real-world SR that
randomly erases potential adversarial noises in the frequency domain of input
images or features. The rationale is that on the SR task clean images or
features have a different pattern from the attacked ones in the frequency
domain. Observing that existing adversarial attacks usually add high-frequency
noises to input images, we introduce a novel random frequency mask module that
blocks out high-frequency components possibly containing the harmful
perturbations in a stochastic manner. Since the frequency masking may not only
destroys the adversarial perturbations but also affects the sharp details in a
clean image, we further develop an adversarial sample classifier based on the
frequency domain of images to determine if applying the proposed mask module.
Based on the above ideas, we devise a novel real-world image SR framework that
combines the proposed frequency mask modules and the proposed adversarial
classifier with an existing super-resolution backbone network. Experiments show
that our proposed method is more insensitive to adversarial attacks and
presents more stable SR results than existing models and defenses.
","[{'version': 'v1', 'created': 'Sun, 31 Jul 2022 13:26:33 GMT'}]",2022-08-02,"[['Yue', 'Jiutao', ''], ['Li', 'Haofeng', ''], ['Wei', 'Pengxu', ''], ['Li', 'Guanbin', ''], ['Lin', 'Liang', '']]","['Real-world image super-resolution', 'Adversarial robustness', 'Adversarial attack', 'Deep neural networks']"
4181,1106.1236,EPTCS,"Sten Gr\""uner, Frank G. Radmacher, Wolfgang Thomas (RWTH Aachen
  University)",Connectivity Games over Dynamic Networks,"In Proceedings GandALF 2011, arXiv:1106.0814","EPTCS 54, 2011, pp. 131-145",10.4204/EPTCS.54.10,,cs.GT cs.CC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A game-theoretic model for the study of dynamic networks is analyzed. The
model is motivated by communication networks that are subject to failure of
nodes and where the restoration needs resources. The corresponding two-player
game is played between ""Destructor"" (who can delete nodes) and ""Constructor""
(who can restore or even create nodes under certain conditions). We also
include the feature of information flow by allowing Constructor to change
labels of adjacent nodes. As objective for Constructor the network property to
be connected is considered, either as a safety condition or as a reachability
condition (in the latter case starting from a non-connected network). We show
under which conditions the solvability of the corresponding games for
Constructor is decidable, and in this case obtain upper and lower complexity
bounds, as well as algorithms derived from winning strategies. Due to the
asymmetry between the players, safety and reachability objectives are not dual
to each other and are treated separately.
","[{'version': 'v1', 'created': 'Tue, 7 Jun 2011 01:06:40 GMT'}]",2011-06-08,"[['Grüner', 'Sten', '', 'RWTH Aachen\n  University'], ['Radmacher', 'Frank G.', '', 'RWTH Aachen\n  University'], ['Thomas', 'Wolfgang', '', 'RWTH Aachen\n  University']]","['infinite games', 'dynamic networks', 'fault-tolerant systems']"
4182,2102.06501,Kai-Kristian Kemell,"Kai-Kristian Kemell, Eveliina Ventil\""a, Petri Kettunen, Tommi
  Mikkonen","Amidst Uncertainty -- or Not? Decision-Making in Early-Stage Software
  Startups",,"In: Hyrynsalmi S., Suoranta M., Nguyen-Duc A., Tyrv\""ainen P.,
  Abrahamsson P. (eds) Software Business. ICSOB 2019. Lecture Notes in Business
  Information Processing, vol 370. Springer, Cham.
  https://doi.org/10.1007/978-3-030-33742-1_29",10.1007/978-3-030-33742-1_29,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is commonly claimed that the initial stages of any startup business are
dominated by continuous, extended uncertainty, in an environment that has even
been described as chaotic. Consequently, decisions are made in uncertain
circumstances, so making the right decision is crucial to successful business.
However, little currently exists in the way of empirical studies into this
supposed uncertainty. In this paper, we study decision-making in early-stage
software startups by means of a single, in-depth case study. Based on our data,
we argue that software startups do not work in a chaotic environment, nor are
they characterized by unique uncertainty unlike that experienced by other
firms.
","[{'version': 'v1', 'created': 'Thu, 11 Feb 2021 11:26:36 GMT'}]",2021-02-15,"[['Kemell', 'Kai-Kristian', ''], ['Ventilä', 'Eveliina', ''], ['Kettunen', 'Petri', ''], ['Mikkonen', 'Tommi', '']]","['Software Startups', 'Entrepreneurship', 'Decision-making', 'Cynefin Framework', 'In-Depth Case Study']"
4183,2102.12699,Marzieh Masoumi,"Marzieh Masoumi, Ahmad Keshavarz, Reza Fotohi",File fragment recognition based on content and statistical features,"16 pages, 7 figures, 8 tables. Multimed Tools Appl (2021)",,10.1007/s11042-021-10681-x,,cs.CR cs.MM,http://creativecommons.org/licenses/by/4.0/,"  Nowadays, the speed up development and use of digital devices such as
smartphones have put people at risk of internet crimes. The evidence of present
crimes in a computer file can be easily unreachable by changing the prefix of a
file or other algorithms. In more complex cases, either file divided into
different parts or the parts of a file that has information about the file type
are deleted, where the file fragment recognition issue is discussed. The known
files are divided into different fragments, and different classification
algorithms are used to solve the problems of file fragment recognition. The
issue of identifying the type of file fragment due to its importance in
cybercrime issues as well as antivirus has been highly emphasized and has been
addressed in many articles. Increasing the accuracy in this field on the types
of widely used files due to the sensitivity of the subject of recognizing the
type of file under study is the main goal of researchers in this field. Failure
to identify the correct type of file will lead to deviations of the results and
evidence from the main issue or failure to conclude. In this paper, first, the
file is divided into different fragments. Then, the file fragment features,
which are obtained from Binary Frequency Distribution, are reduced by 2 feature
reduction algorithms; Sequential Forward Selection algorithm as well as
Sequential Floating Forward Selection algorithm to delete sparse features that
result in increased accuracy and speed. Finally, the reduced features are given
to 3 Multiclass classifier algorithms, Multilayer Perceptron, Support Vector
Machines, and K-Nearest Neighbor for classification and comparison of the
results. The proposed recognition algorithm can recognize 6 types of useful
files and may distinguish a type of file fragments with higher accuracy than
the similar works done.
","[{'version': 'v1', 'created': 'Thu, 25 Feb 2021 06:00:25 GMT'}]",2021-02-26,"[['Masoumi', 'Marzieh', ''], ['Keshavarz', 'Ahmad', ''], ['Fotohi', 'Reza', '']]","['Multiclass classifier algorithms', 'Feature Reduction', 'File Fragments', 'File Fragment Recognition', 'SFS', 'SFFS']"
4184,1109.1133,Shervan Fekri ershad,Shervan Fekri Ershad,"Color Texture Classification Approach Based on Combination of Primitive
  Pattern Units and Statistical Features","The International Journal of Multimedia & Its Applications (IJMA)
  Vol.3, No.3, August 2011",,10.5121/ijma.2011.3301,,cs.CV cs.AI,http://creativecommons.org/licenses/by/3.0/,"  Texture classification became one of the problems which has been paid much
attention on by image processing scientists since late 80s. Consequently, since
now many different methods have been proposed to solve this problem. In most of
these methods the researchers attempted to describe and discriminate textures
based on linear and non-linear patterns. The linear and non-linear patterns on
any window are based on formation of Grain Components in a particular order.
Grain component is a primitive unit of morphology that most meaningful
information often appears in the form of occurrence of that. The approach which
is proposed in this paper could analyze the texture based on its grain
components and then by making grain components histogram and extracting
statistical features from that would classify the textures. Finally, to
increase the accuracy of classification, proposed approach is expanded to color
images to utilize the ability of approach in analyzing each RGB channels,
individually. Although, this approach is a general one and it could be used in
different applications, the method has been tested on the stone texture and the
results can prove the quality of approach.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2011 10:24:07 GMT'}]",2011-09-07,"[['Ershad', 'Shervan Fekri', '']]","['Texture classification', 'Grain Components', 'statistical feature', 'primitive pattern unit']"
4185,1306.1901,Roberto Bagnara,"Roberto Bagnara, Fred Mesnard",Eventual Linear Ranking Functions,10 pages,,10.1145/2505879.2505884,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Program termination is a hot research topic in program analysis. The last few
years have witnessed the development of termination analyzers for programming
languages such as C and Java with remarkable precision and performance. These
systems are largely based on techniques and tools coming from the field of
declarative constraint programming. In this paper, we first recall an algorithm
based on Farkas' Lemma for discovering linear ranking functions proving
termination of a certain class of loops. Then we propose an extension of this
method for showing the existence of eventual linear ranking functions, i.e.,
linear functions that become ranking functions after a finite unrolling of the
loop. We show correctness and completeness of this algorithm.
","[{'version': 'v1', 'created': 'Sat, 8 Jun 2013 10:10:05 GMT'}]",2013-07-26,"[['Bagnara', 'Roberto', ''], ['Mesnard', 'Fred', '']]","['termination analysis', 'ranking function', 'eventual linear ranking function']"
4186,1706.08709,Hela Jedda,"Hela Jedda, Muhammad Mudussir Ayub, Jawad Munir, Amine Mezghani and
  Josef A. Nossek","Power- and Spectral Efficient Communication System Design Using 1-Bit
  Quantization",,,10.1109/ISWCS.2015.7454349,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Improving the power efficiency and spectral efficiency of communication
systems has been one of the major research goals over the recent years.
However, there is a tradeoff in achieving both goals at the same time. In this
work, we consider the joint optimization of the power amplifier and a pulse
shaping filter over a single-input single-output (SISO) additive white Gaussian
noise (AWGN) channel using 1-bit analog-todigital (ADC) and digital-to-analog
(DAC) converters. The goal of the optimization is the selection of the optimal
system parameters in order to maximize the desired figure-of-merit (FOM) which
is the product of power efficiency and spectral efficiency. Simulation results
give an insight in choosing the optimal parameters of the pulse shaping filter
and power amplifier to maximize the desired FOM.
","[{'version': 'v1', 'created': 'Tue, 27 Jun 2017 08:06:53 GMT'}]",2017-06-28,"[['Jedda', 'Hela', ''], ['Ayub', 'Muhammad Mudussir', ''], ['Munir', 'Jawad', ''], ['Mezghani', 'Amine', ''], ['Nossek', 'Josef A.', '']]","['Green Communication', 'Power Efficiency', 'SpectralEfficiency', '1-Bit Quantization']"
4187,1512.00750,Reginald Smith,Reginald D. Smith,A Mutual Information Approach to Calculating Nonlinearity,"13 pages, 2 figures","STAT, 4, 291-303 (2015)",10.1002/sta4.96,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new method to measure nonlinear dependence between two variables is
described using mutual information to analyze the separate linear and nonlinear
components of dependence. This technique, which gives an exact value for the
proportion of linear dependence, is then compared with another common test for
linearity, the Brock, Dechert and Scheinkman (BDS) test.
","[{'version': 'v1', 'created': 'Sun, 29 Nov 2015 17:44:36 GMT'}]",2015-12-17,"[['Smith', 'Reginald D.', '']]","['information', 'linear models', 'nonparametric methods', 'regression']"
4188,1211.2251,Pietro Codara,"Pietro Codara, Ottavio M. D'Antona","Independent subsets of powers of paths, and Fibonacci cubes",Preprint submitted to Electronic Notes in Discrete Mathematics,Electronic Notes in Discrete Mathematics 40 (2013) 65-69,10.1016/j.endm.2013.05.013,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide a formula for the number of edges of the Hasse diagram of the
independent subsets of the h-th power of a path ordered by inclusion. For h=1
such a value is the number of edges of a Fibonacci cube. We show that, in
general, the number of edges of the diagram is obtained by convolution of a
Fibonacci-like sequence with itself.
","[{'version': 'v1', 'created': 'Fri, 9 Nov 2012 21:30:06 GMT'}]",2014-01-22,"[['Codara', 'Pietro', ''], [""D'Antona"", 'Ottavio M.', '']]","['Independent subset', 'path', 'power of graph', 'Fibonacci cube']"
4189,1703.09041,Huan Li,"Huan Li, Zhongzhi Zhang","Maximum matchings in scale-free networks with identical degree
  distribution",,,10.1016/j.tcs.2017.02.027,,cs.SI cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The size and number of maximum matchings in a network have found a large
variety of applications in many fields. As a ubiquitous property of diverse
real systems, power-law degree distribution was shown to have a profound
influence on size of maximum matchings in scale-free networks, where the size
of maximum matchings is small and a perfect matching often does not exist. In
this paper, we study analytically the maximum matchings in two scale-free
networks with identical degree sequence, and show that the first network has no
perfect matchings, while the second one has many. For the first network, we
determine explicitly the size of maximum matchings, and provide an exact
recursive solution for the number of maximum matchings. For the second one, we
design an orientation and prove that it is Pfaffian, based on which we derive a
closed-form expression for the number of perfect matchings. Moreover, we
demonstrate that the entropy for perfect matchings is equal to that
corresponding to the extended Sierpi\'nski graph with the same average degree
as both studied scale-free networks. Our results indicate that power-law degree
distribution alone is not sufficient to characterize the size and number of
maximum matchings in scale-free networks.
","[{'version': 'v1', 'created': 'Mon, 27 Mar 2017 12:49:24 GMT'}]",2017-03-28,"[['Li', 'Huan', ''], ['Zhang', 'Zhongzhi', '']]","['Maximum matching', 'Perfect matching', 'Pfaffian orientation', 'Scale-free network', 'Complex network']"
4190,1404.3992,Mahima Sharma,"Aditi Kalyani, Hemant Kumud, Shashi Pal Singh, Ajai Kumar",Assessing the Quality of MT Systems for Hindi to English Translation,,"International Journal of Computer Applications, Volume 89, No 15,
  March 2014",10.5120/15711-4629,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evaluation plays a vital role in checking the quality of MT output. It is
done either manually or automatically. Manual evaluation is very time consuming
and subjective, hence use of automatic metrics is done most of the times. This
paper evaluates the translation quality of different MT Engines for
Hindi-English (Hindi data is provided as input and English is obtained as
output) using various automatic metrics like BLEU, METEOR etc. Further the
comparison automatic evaluation results with Human ranking have also been
given.
","[{'version': 'v1', 'created': 'Tue, 15 Apr 2014 17:13:26 GMT'}]",2015-06-19,"[['Kalyani', 'Aditi', ''], ['Kumud', 'Hemant', ''], ['Singh', 'Shashi Pal', ''], ['Kumar', 'Ajai', '']]","['Automatic MT Evaluation', 'BLEU', 'METEOR', 'NIST', 'Morphologically Rich Languages']"
4191,1812.05788,Chen Ma,"Chen Ma, Li Chen, Junhai Yong","AU R-CNN: Encoding Expert Prior Knowledge into R-CNN for Action Unit
  Detection","14 pages,10 figures, published on Neurocomputing",Neurocomputing 355 (2019) 35-47,10.1016/j.neucom.2019.03.082,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detecting action units (AUs) on human faces is challenging because various
AUs make subtle facial appearance change over various regions at different
scales. Current works have attempted to recognize AUs by emphasizing important
regions. However, the incorporation of expert prior knowledge into region
definition remains under-exploited, and current AU detection approaches do not
use regional convolutional neural networks (R-CNN) with expert prior knowledge
to directly focus on AU-related regions adaptively. By incorporating expert
prior knowledge, we propose a novel R-CNN based model named AU R-CNN. The
proposed solution offers two main contributions: (1) AU R-CNN directly observes
different facial regions, where various AUs are located. Specifically, we
define an AU partition rule which encodes the expert prior knowledge into the
region definition and RoI-level label definition. This design produces
considerably better detection performance than existing approaches. (2) We
integrate various dynamic models (including convolutional long short-term
memory, two stream network, conditional random field, and temporal action
localization network) into AU R-CNN and then investigate and analyze the reason
behind the performance of dynamic models. Experiment results demonstrate that
\textit{only} static RGB image information and no optical flow-based AU R-CNN
surpasses the one fused with dynamic models. AU R-CNN is also superior to
traditional CNNs that use the same backbone on varying image resolutions.
State-of-the-art recognition performance of AU detection is achieved. The
complete network is end-to-end trainable. Experiments on BP4D and DISFA
datasets show the effectiveness of our approach. The implementation code is
available online.
","[{'version': 'v1', 'created': 'Fri, 14 Dec 2018 05:23:49 GMT'}, {'version': 'v2', 'created': 'Sun, 25 Aug 2019 11:56:47 GMT'}]",2019-08-27,"[['Ma', 'Chen', ''], ['Chen', 'Li', ''], ['Yong', 'Junhai', '']]","['Action unit detection', 'Expert prior knowledge', 'R-CNN', 'Facial Action Coding System']"
4192,1407.2106,Irina Trubitsyna,"Marco Calautti, Sergio Greco, Francesca Spezzano and Irina Trubitsyna","Checking Termination of Bottom-Up Evaluation of Logic Programs with
  Function Symbols","36 pages, 7 figures",Theory and Practice of Logic Programming 15 (2014) 854-889,10.1017/S1471068414000623,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, there has been an increasing interest in the bottom-up evaluation
of the semantics of logic programs with complex terms. The presence of function
symbols in the program may render the ground instantiation infinite, and
finiteness of models and termination of the evaluation procedure, in the
general case, are not guaranteed anymore. Since the program termination problem
is undecidable in the general case, several decidable criteria (called program
termination criteria) have been recently proposed. However, current conditions
are not able to identify even simple programs, whose bottom-up execution always
terminates. The paper introduces new decidable criteria for checking
termination of logic programs with function symbols under bottom-up evaluation,
by deeply analyzing the program structure. First, we analyze the propagation of
complex terms among arguments by means of the extended version of the argument
graph called propagation graph. The resulting criterion, called
Gamma-acyclicity, generalizes most of the decidable criteria proposed so far.
Next, we study how rules may activate each other and define a more powerful
criterion, called safety. This criterion uses the so-called safety function
able to analyze how rules may activate each other and how the presence of some
arguments in a rule limits its activation. We also study the application of the
proposed criteria to bound queries and show that the safety criterion is
well-suited to identify relevant classes of programs and bound queries.
Finally, we propose a hierarchy of classes of terminating programs, called
k-safety, where the k-safe class strictly includes the (k-1)-safe class. Note:
To appear in Theory and Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Tue, 8 Jul 2014 14:27:18 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Jul 2014 08:08:46 GMT'}, {'version': 'v3', 'created': 'Fri, 11 Jul 2014 07:49:22 GMT'}]",2015-10-07,"[['Calautti', 'Marco', ''], ['Greco', 'Sergio', ''], ['Spezzano', 'Francesca', ''], ['Trubitsyna', 'Irina', '']]","['Logic programming with function symbols', 'bottom-up execution', 'programtermination', 'stable models']"
4193,1706.05288,Mohammad Hosseini,"Mohammad Hosseini, Yu Jiang, Ali Yekkehkhany, Richard R. Berlin, Lui
  Sha","A Mobile Geo-Communication Dataset for Physiology-Aware DASH in Rural
  Ambulance Transport","Proceedings of the 8th ACM on Multimedia Systems Conference
  (MMSys'17), Pages 158-163, Taipei, Taiwan, June 20 - 23, 2017",,10.1145/3083187.3083211,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Use of telecommunication technologies for remote, continuous monitoring of
patients can enhance effectiveness of emergency ambulance care during transport
from rural areas to a regional center hospital. However, the communication
along the various routes in rural areas may have wide bandwidth ranges from 2G
to 4G; some regions may have only lower satellite bandwidth available.
Bandwidth fluctuation together with real-time communication of various clinical
multimedia pose a major challenge during rural patient ambulance transport.;
AB@The availability of a pre-transport route-dependent communication bandwidth
database is an important resource in remote monitoring and clinical multimedia
transmission in rural ambulance transport. Here, we present a geo-communication
dataset from extensive profiling of 4 major US mobile carriers in Illinois,
from the rural location of Hoopeston to the central referral hospital center at
Urbana. In collaboration with Carle Foundation Hospital, we developed a
profiler, and collected various geographical and communication traces for
realistic emergency rural ambulance transport scenarios. Our dataset is to
support our ongoing work of proposing ""physiology-aware DASH"", which is
particularly useful for adaptive remote monitoring of critically ill patients
in emergency rural ambulance transport. It provides insights on ensuring higher
Quality of Service (QoS) for most critical clinical multimedia in response to
changes in patients' physiological states and bandwidth conditions. Our dataset
is available online for research community.
","[{'version': 'v1', 'created': 'Fri, 16 Jun 2017 14:28:53 GMT'}]",2017-06-19,"[['Hosseini', 'Mohammad', ''], ['Jiang', 'Yu', ''], ['Yekkehkhany', 'Ali', ''], ['Berlin', 'Richard R.', ''], ['Sha', 'Lui', '']]","['Physiology-aware DASH', 'network profling', 'bandwidth', 'GPS']"
4194,1501.07467,Hamed Zamani,"Hamed Zamani, Azadeh Shakery, Pooya Moradi","Regression and Learning to Rank Aggregation for User Engagement
  Evaluation","In Proceedings of the 2014 ACM Recommender Systems Challenge,
  RecSysChallenge '14",,10.1145/2668067.2668077,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  User engagement refers to the amount of interaction an instance (e.g., tweet,
news, and forum post) achieves. Ranking the items in social media websites
based on the amount of user participation in them, can be used in different
applications, such as recommender systems. In this paper, we consider a tweet
containing a rating for a movie as an instance and focus on ranking the
instances of each user based on their engagement, i.e., the total number of
retweets and favorites it will gain.
  For this task, we define several features which can be extracted from the
meta-data of each tweet. The features are partitioned into three categories:
user-based, movie-based, and tweet-based. We show that in order to obtain good
results, features from all categories should be considered. We exploit
regression and learning to rank methods to rank the tweets and propose to
aggregate the results of regression and learning to rank methods to achieve
better performance. We have run our experiments on an extended version of
MovieTweeting dataset provided by ACM RecSys Challenge 2014. The results show
that learning to rank approach outperforms most of the regression models and
the combination can improve the performance significantly.
","[{'version': 'v1', 'created': 'Thu, 29 Jan 2015 14:54:12 GMT'}]",2015-01-30,"[['Zamani', 'Hamed', ''], ['Shakery', 'Azadeh', ''], ['Moradi', 'Pooya', '']]","['Twitter', 'User engagement', 'Ranking aggregation']"
4195,1509.04619,Hamid Tizhoosh,"Zehra Camlica, H.R. Tizhoosh, Farzad Khalvati","Medical Image Classification via SVM using LBP Features from
  Saliency-Based Folded Data","To appear in proceedings of The 14th International Conference on
  Machine Learning and Applications (IEEE ICMLA 2015), Miami, Florida, USA,
  2015",,10.1109/ICMLA.2015.131,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Good results on image classification and retrieval using support vector
machines (SVM) with local binary patterns (LBPs) as features have been
extensively reported in the literature where an entire image is retrieved or
classified. In contrast, in medical imaging, not all parts of the image may be
equally significant or relevant to the image retrieval application at hand. For
instance, in lung x-ray image, the lung region may contain a tumour, hence
being highly significant whereas the surrounding area does not contain
significant information from medical diagnosis perspective. In this paper, we
propose to detect salient regions of images during training and fold the data
to reduce the effect of irrelevant regions. As a result, smaller image areas
will be used for LBP features calculation and consequently classification by
SVM. We use IRMA 2009 dataset with 14,410 x-ray images to verify the
performance of the proposed approach. The results demonstrate the benefits of
saliency-based folding approach that delivers comparable classification
accuracies with state-of-the-art but exhibits lower computational cost and
storage requirements, factors highly important for big data analytics.
","[{'version': 'v1', 'created': 'Tue, 15 Sep 2015 16:08:08 GMT'}]",2016-11-17,"[['Camlica', 'Zehra', ''], ['Tizhoosh', 'H. R.', ''], ['Khalvati', 'Farzad', '']]","['Image classification', 'saliency', 'folding', 'local binarypatterns', 'support vector machines']"
4196,1404.4136,Richa Gupta Ms,"Richa Gupta, Sunny Gupta, Anuradha Singhal",Big Data: Overview,"3 pages, 1 figure","International Journal of Computer Trends and Technology (IJCTT)
  9(5):1-3, March 2014",10.14445/22312803/IJCTT-V9150,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Big data is data that exceeds the processing capacity of traditional
databases. The data is too big to be processed by a single machine. New and
innovative methods are required to process and store such large volumes of
data. This paper provides an overview on big data, its importance in our live
and some technologies to handle big data.
","[{'version': 'v1', 'created': 'Wed, 16 Apr 2014 04:58:57 GMT'}]",2014-04-17,"[['Gupta', 'Richa', ''], ['Gupta', 'Sunny', ''], ['Singhal', 'Anuradha', '']]","['Big data', 'MapReduce', 'volume', 'velocity', 'variety']"
4197,2105.12710,Mohamed Ali Souibgui,"Sana Khamekhem Jemni and Mohamed Ali Souibgui and Yousri Kessentini
  and Alicia Forn\'es","Enhance to Read Better: A Multi-Task Adversarial Network for Handwritten
  Document Image Enhancement",Accepted in Pattern Recognition,,10.1016/j.patcog.2021.108370,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Handwritten document images can be highly affected by degradation for
different reasons: Paper ageing, daily-life scenarios (wrinkles, dust, etc.),
bad scanning process and so on. These artifacts raise many readability issues
for current Handwritten Text Recognition (HTR) algorithms and severely devalue
their efficiency. In this paper, we propose an end to end architecture based on
Generative Adversarial Networks (GANs) to recover the degraded documents into a
clean and readable form. Unlike the most well-known document binarization
methods, which try to improve the visual quality of the degraded document, the
proposed architecture integrates a handwritten text recognizer that promotes
the generated document image to be more readable. To the best of our knowledge,
this is the first work to use the text information while binarizing handwritten
documents. Extensive experiments conducted on degraded Arabic and Latin
handwritten documents demonstrate the usefulness of integrating the recognizer
within the GAN architecture, which improves both the visual quality and the
readability of the degraded document images. Moreover, we outperform the state
of the art in H-DIBCO challenges, after fine tuning our pre-trained model with
synthetically degraded Latin handwritten images, on this task.
","[{'version': 'v1', 'created': 'Wed, 26 May 2021 17:44:45 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Oct 2021 15:30:46 GMT'}]",2021-10-27,"[['Jemni', 'Sana Khamekhem', ''], ['Souibgui', 'Mohamed Ali', ''], ['Kessentini', 'Yousri', ''], ['Fornés', 'Alicia', '']]","['Handwritten Document Image Binarization', 'DocumentEnhancement', 'Handwriting Text Recognition', 'Generative AdversarialNetworks', 'Recurrent Neural Networks']"
4198,1001.1122,Alexander Gorban,"A. N. Gorban, A. Zinovyev","Principal manifolds and graphs in practice: from molecular biology to
  dynamical systems","12 pages, 9 figures","International Journal of Neural Systems, Vol. 20, No. 3 (2010)
  219-232",10.1142/S0129065710002383,,cs.NE cs.AI,http://creativecommons.org/licenses/by/3.0/,"  We present several applications of non-linear data modeling, using principal
manifolds and principal graphs constructed using the metaphor of elasticity
(elastic principal graph approach). These approaches are generalizations of the
Kohonen's self-organizing maps, a class of artificial neural networks. On
several examples we show advantages of using non-linear objects for data
approximation in comparison to the linear ones. We propose four numerical
criteria for comparing linear and non-linear mappings of datasets into the
spaces of lower dimension. The examples are taken from comparative political
science, from analysis of high-throughput data in molecular biology, from
analysis of dynamical systems.
","[{'version': 'v1', 'created': 'Thu, 7 Jan 2010 17:46:17 GMT'}, {'version': 'v2', 'created': 'Sun, 25 Jul 2010 19:30:37 GMT'}]",2010-07-27,"[['Gorban', 'A. N.', ''], ['Zinovyev', 'A.', '']]","['Kohonen neural networks', 'self-organizing maps', 'principal manifolds', 'principal graphs', 'data visualization']"
4199,1807.02965,Mohammad Masudur Rahman,"Mohammad Masudur Rahman, Chanchal K. Roy and Jason A. Collins","CORRECT: Code Reviewer Recommendation in GitHub Based on Cross-Project
  and Technology Experience","The 38th International Conference on Software Engineering (Companion
  volume) (ICSE 2016), pp. 222--231, Austin Texas, USA, May 2016","Proc. ICSE-C 2016, pp. 222--231",10.1145/2889160.2889244,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Peer code review locates common coding rule violations and simple logical
errors in the early phases of software development, and thus reduces overall
cost. However, in GitHub, identifying an appropriate code reviewer for a pull
request is a non-trivial task given that reliable information for reviewer
identification is often not readily available. In this paper, we propose a code
reviewer recommendation technique that considers not only the relevant
cross-project work history (e.g., external library experience) but also the
experience of a developer in certain specialized technologies associated with a
pull request for determining her expertise as a potential code reviewer. We
first motivate our technique using an exploratory study with 10 commercial
projects and 10 associated libraries external to those projects. Experiments
using 17,115 pull requests from 10 commercial projects and six open source
projects show that our technique provides 85%--92% recommendation accuracy,
about 86% precision and 79%--81% recall in code reviewer recommendation, which
are highly promising. Comparison with the state-of-the-art technique also
validates the empirical findings and the superiority of our recommendation
technique.
","[{'version': 'v1', 'created': 'Mon, 9 Jul 2018 07:01:04 GMT'}]",2018-07-10,"[['Rahman', 'Mohammad Masudur', ''], ['Roy', 'Chanchal K.', ''], ['Collins', 'Jason A.', '']]","['Code reviewer recommendation', 'cross-project experience', 'specialized technology experience', 'GitHub', 'pull request']"
4200,1008.1667,EPTCS,"Cristian Calude (University of Auckland), Kai Salomaa (Queen's
  University), Tania Roblot (University of Auckland)",Finite-State Complexity and the Size of Transducers,"In Proceedings DCFS 2010, arXiv:1008.1270","EPTCS 31, 2010, pp. 38-47",10.4204/EPTCS.31.6,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finite-state complexity is a variant of algorithmic information theory
obtained by replacing Turing machines with finite transducers. We consider the
state-size of transducers needed for minimal descriptions of arbitrary strings
and, as our main result, we show that the state-size hierarchy with respect to
a standard encoding is infinite. We consider also hierarchies yielded by more
general computable encodings.
","[{'version': 'v1', 'created': 'Tue, 10 Aug 2010 08:35:05 GMT'}]",2010-08-11,"[['Calude', 'Cristian', '', 'University of Auckland'], ['Salomaa', 'Kai', '', ""Queen's\n  University""], ['Roblot', 'Tania', '', 'University of Auckland']]","['finite transducers', 'descriptional complexity', 'state-size hierarchy', 'computability']"
4201,1304.4453,Christian Lorenz Staudt,Christian L. Staudt and Henning Meyerhenke,"Engineering Parallel Algorithms for Community Detection in Massive
  Networks","14 pages, first presented at the 2013 International Conference on
  Parallel Processing, revised accepted for IEEE Transactions on Parallel and
  Distributed Systems (TPDS)",,10.1109/TPDS.2015.2390633,,cs.DC cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The amount of graph-structured data has recently experienced an enormous
growth in many applications. To transform such data into useful information,
fast analytics algorithms and software tools are necessary. One common graph
analytics kernel is disjoint community detection (or graph clustering). Despite
extensive research on heuristic solvers for this task, only few parallel codes
exist, although parallelism will be necessary to scale to the data volume of
real-world applications. We address the deficit in computing capability by a
flexible and extensible community detection framework with shared-memory
parallelism. Within this framework we design and implement efficient parallel
community detection heuristics: A parallel label propagation scheme; the first
large-scale parallelization of the well-known Louvain method, as well as an
extension of the method adding refinement; and an ensemble scheme combining the
above. In extensive experiments driven by the algorithm engineering paradigm,
we identify the most successful parameters and combinations of these
algorithms. We also compare our implementations with state-of-the-art
competitors. The processing rate of our fastest algorithm often reaches 50M
edges/second. We recommend the parallel Louvain method and our variant with
refinement as both qualitatively strong and fast. Our methods are suitable for
massive data sets with billions of edges.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2013 14:03:38 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Jan 2014 11:55:40 GMT'}, {'version': 'v3', 'created': 'Fri, 25 Jul 2014 13:47:47 GMT'}, {'version': 'v4', 'created': 'Mon, 2 Feb 2015 13:27:38 GMT'}]",2015-02-03,"[['Staudt', 'Christian L.', ''], ['Meyerhenke', 'Henning', '']]","['Disjoint community detection', 'graph clustering', 'parallel Louvain method', 'parallel algorithm engineering', 'networkanalysis']"
4202,1807.07173,Qiang Hao,"Qiang Hao, April Galyardt, Bradley Barnes, Robert Maribe Branch, Ewan
  Wright","Automatic Identification of Ineffective Online Student Questions in
  Computing Education",,"Proceedings of IEEE Frontiers in Education (FIE' 18), San Jose,
  CA, 2018",10.1109/FIE.2018.8658642,,cs.HC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This Research Full Paper explores automatic identification of ineffective
learning questions in the context of large-scale computer science classes. The
immediate and accurate identification of ineffective learning questions opens
the door to possible automated facilitation on a large scale, such as alerting
learners to revise questions and providing adaptive question revision
suggestions. To achieve this, 983 questions were collected from a question &
answer platform implemented by an introductory programming course over three
semesters in a large research university in the Southeastern United States.
Questions were firstly manually classified into three hierarchical categories:
1) learning-irrelevant questions, 2) effective learning-relevant questions, 3)
ineffective learningrelevant questions. The inter-rater reliability of the
manual classification (Cohen's Kappa) was .88. Four different machine learning
algorithms were then used to automatically classify the questions, including
Naive Bayes Multinomial, Logistic Regression, Support Vector Machines, and
Boosted Decision Tree. Both flat and single path strategies were explored, and
the most effective algorithms under both strategies were identified and
discussed. This study contributes to the automatic determination of learning
question quality in computer science, and provides evidence for the feasibility
of automated facilitation of online question & answer in large scale computer
science classes.
","[{'version': 'v1', 'created': 'Wed, 18 Jul 2018 22:21:19 GMT'}, {'version': 'v2', 'created': 'Sun, 7 Oct 2018 18:10:07 GMT'}, {'version': 'v3', 'created': 'Sun, 10 Mar 2019 19:47:53 GMT'}]",2019-03-12,"[['Hao', 'Qiang', ''], ['Galyardt', 'April', ''], ['Barnes', 'Bradley', ''], ['Branch', 'Robert Maribe', ''], ['Wright', 'Ewan', '']]","['online help seeking', 'automatic question classification', 'computing education', 'student questions', 'learning question classification', 'educational data mining']"
4203,1607.08673,Tamara Kolda,Sinan Aksoy and Tamara G. Kolda and Ali Pinar,Measuring and Modeling Bipartite Graphs with Community Structure,,"Journal of Complex Networks, Vol. 5, No. 4, pp. 581-603, 2017",10.1093/comnet/cnx001,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network science is a powerful tool for analyzing complex systems in fields
ranging from sociology to engineering to biology. This paper is focused on
generative models of large-scale bipartite graphs, also known as two-way graphs
or two-mode networks. We propose two generative models that can be easily tuned
to reproduce the characteristics of real-world networks, not just
qualitatively, but quantitatively. The characteristics we consider are the
degree distributions and the metamorphosis coefficient. The metamorphosis
coefficient, a bipartite analogue of the clustering coefficient, is the
proportion of length-three paths that participate in length-four cycles. Having
a high metamorphosis coefficient is a necessary condition for close-knit
community structure. We define edge, node, and degreewise metamorphosis
coefficients, enabling a more detailed understanding of the bipartite
connectivity that is not explained by degree distribution alone. Our first
model, bipartite Chung-Lu (CL), is able to reproduce real-world degree
distributions, and our second model, bipartite block two-level Erd\""os-R\'enyi
(BTER), reproduces both the degree distributions as well as the degreewise
metamorphosis coefficients. We demonstrate the effectiveness of these models on
several real-world data sets.
","[{'version': 'v1', 'created': 'Fri, 29 Jul 2016 01:26:54 GMT'}, {'version': 'v2', 'created': 'Sat, 29 Oct 2016 23:29:48 GMT'}]",2017-09-20,"[['Aksoy', 'Sinan', ''], ['Kolda', 'Tamara G.', ''], ['Pinar', 'Ali', '']]","['bipartite generative graph model', 'two-way graph model', 'two-mode network', 'metamorphosiscoefficient', 'bipartite clustering coefficient', 'complex networks']"
4204,1901.06528,Vivek Kumar Mr.,"Vivek Kumar, Atul Samadhiya","Image De-Noising For Salt and Pepper Noise by Introducing New Enhanced
  Filter","5 pages, 3 Figures, 2 Tables, International Conference on Innovations
  in Engineering and Technology (ICIET'2013) Dec. 25-26, 2013 Bangkok
  (Thailand)","ICIET'2013 pp 53-57, 2013",10.15242/IIE.E1213577,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When an image is formed, factors such as lighting (spectra, source, and
intensity) and camera characteristics (sensor response, lenses) affect the
appearance of the image. Therefore, the prime factor that reduces the quality
of the image is noise. It hides the important details and information of
images. In order to enhance the qualities of the image, the removal of noises
become imperative and that should not at the cost of any loss of image
information. Noise removal is one of the pre-processing stages of image
processing. In this paper a new method for the enhancement of grayscale images
is introduced, when images are corrupted by fixed valued impulse noise (salt
and pepper noise). The proposed methodology ensures a better output for the low
and medium density of fixed value impulse noise as compared to the other famous
filters like Standard Median Filter (SMF), Decision Based Median Filter (DBMF)
and Modified Decision Based Median Filter (MDBMF) etc. The main objective of
the proposed method was to improve peak signal to noise ratio (PSNR), visual
perception and reduction in the blurring of the image. The proposed algorithm
replaced the noisy pixel by trimmed mean value. When previous pixel values, 0s,
and 255s are present in the particular window and all the pixel values are 0s
and 255s then the remaining noisy pixels are replaced by mean value. The
gray-scale image of mandrill and Lena were tested via the proposed method. The
experimental result shows better peak signal to noise ratio (PSNR), mean square
error values with better visual and human perception.
","[{'version': 'v1', 'created': 'Sat, 19 Jan 2019 14:10:49 GMT'}]",2019-01-23,"[['Kumar', 'Vivek', ''], ['Samadhiya', 'Atul', '']]","['Blurring', 'Human and visual perception', 'Modified Nonlinear filter', 'Salt and Pepper noise', 'Mean Square Error', 'Peak Signal to Noise Ratio']"
4205,1809.02724,Francesca Lonetti,"Antonia Bertolino, Said Daoudagh, Francesca Lonetti, Eda Marchetti",An automated model-based test oracle for access control systems,7 pages,"Proceedings of the 13th International Workshop on Automation of
  Software Test, pp. 2-8. ACM, 2018",10.1145/3194733.3194743,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the context of XACML-based access control systems, an intensive testing
activity is among the most adopted means to assure that sensible information or
resources are correctly accessed. Unfortunately, it requires a huge effort for
manual inspection of results: thus automated verdict derivation is a key aspect
for improving the cost-effectiveness of testing. To this purpose, we introduce
XACMET, a novel approach for automated model-based oracle definition. XACMET
defines a typed graph, called the XAC-Graph, that models the XACML policy
evaluation. The expected verdict of a specific request execution can thus be
automatically derived by executing the corresponding path in such graph. Our
validation of the XACMET prototype implementation confirms the effectiveness of
the proposed approach.
","[{'version': 'v1', 'created': 'Sat, 8 Sep 2018 00:38:16 GMT'}]",2018-09-11,"[['Bertolino', 'Antonia', ''], ['Daoudagh', 'Said', ''], ['Lonetti', 'Francesca', ''], ['Marchetti', 'Eda', '']]","['XACML', 'Testing', 'Oracle derivation']"
4206,1708.06525,Xiaojun Xu,"Xiaojun Xu and Chang Liu and Qian Feng and Heng Yin and Le Song and
  Dawn Song","Neural Network-based Graph Embedding for Cross-Platform Binary Code
  Similarity Detection",ACM CCS 17,,10.1145/3133956.3134018,,cs.CR cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of cross-platform binary code similarity detection aims at
detecting whether two binary functions coming from different platforms are
similar or not. It has many security applications, including plagiarism
detection, malware detection, vulnerability search, etc. Existing approaches
rely on approximate graph matching algorithms, which are inevitably slow and
sometimes inaccurate, and hard to adapt to a new task. To address these issues,
in this work, we propose a novel neural network-based approach to compute the
embedding, i.e., a numeric vector, based on the control flow graph of each
binary function, then the similarity detection can be done efficiently by
measuring the distance between the embeddings for two functions. We implement a
prototype called Gemini. Our extensive evaluation shows that Gemini outperforms
the state-of-the-art approaches by large margins with respect to similarity
detection accuracy. Further, Gemini can speed up prior art's embedding
generation time by 3 to 4 orders of magnitude and reduce the required training
time from more than 1 week down to 30 minutes to 10 hours. Our real world case
studies demonstrate that Gemini can identify significantly more vulnerable
firmware images than the state-of-the-art, i.e., Genius. Our research showcases
a successful application of deep learning on computer security problems.
","[{'version': 'v1', 'created': 'Tue, 22 Aug 2017 07:53:51 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Jul 2018 10:44:46 GMT'}, {'version': 'v3', 'created': 'Thu, 26 Jul 2018 06:25:31 GMT'}, {'version': 'v4', 'created': 'Fri, 27 Jul 2018 05:52:22 GMT'}]",2018-07-30,"[['Xu', 'Xiaojun', ''], ['Liu', 'Chang', ''], ['Feng', 'Qian', ''], ['Yin', 'Heng', ''], ['Song', 'Le', ''], ['Song', 'Dawn', '']]","['Binary Code', 'Similarity Detection', 'Neural Network']"
4207,1310.4856,Matthieu Picantin,Ines Klimann and Jean Mairesse and Matthieu Picantin,Implementing Computations in Automaton (Semi)groups,"12 pages, 4 figures, 3 tables, CIAA 2012","CIAA 2012, LNCS 7381, pp.240-252, 2012. (N. Moreira and R.Reis
  Eds.)",10.1142/S021819671250052X,,cs.FL math.GR,http://creativecommons.org/licenses/publicdomain/,"  We consider the growth, order, and finiteness problems for automaton
(semi)groups. We propose new implementations and compare them with the existing
ones. As a result of extensive experimentations, we propose some conjectures on
the order of finite automaton (semi)groups.
","[{'version': 'v1', 'created': 'Thu, 17 Oct 2013 21:01:37 GMT'}]",2013-10-21,"[['Klimann', 'Ines', ''], ['Mairesse', 'Jean', ''], ['Picantin', 'Matthieu', '']]","['automaton (semi)groups', 'growth', 'order', 'finiteness', 'minimization']"
4208,1804.03547,Yujiang Wang,"Yujiang Wang, Jie Shen, Stavros Petridis, Maja Pantic","A real-time and unsupervised face Re-Identification system for
  Human-Robot Interaction","Code implementation in Python is available at:
  https://github.com/ibug-group/face_reid","Pattern Recognition Letters, Volume 128, 1 December 2019, Pages
  559-568",10.1016/j.patrec.2018.04.009,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the context of Human-Robot Interaction (HRI), face Re-Identification (face
Re-ID) aims to verify if certain detected faces have already been observed by
robots. The ability of distinguishing between different users is crucial in
social robots as it will enable the robot to tailor the interaction strategy
toward the users' individual preferences. So far face recognition research has
achieved great success, however little attention has been paid to the realistic
applications of Face Re-ID in social robots. In this paper, we present an
effective and unsupervised face Re-ID system which simultaneously re-identifies
multiple faces for HRI. This Re-ID system employs Deep Convolutional Neural
Networks to extract features, and an online clustering algorithm to determine
the face's ID. Its performance is evaluated on two datasets: the TERESA video
dataset collected by the TERESA robot, and the YouTube Face Dataset (YTF
Dataset). We demonstrate that the optimised combination of techniques achieves
an overall 93.55% accuracy on TERESA dataset and an overall 90.41% accuracy on
YTF dataset. We have implemented the proposed method into a software module in
the HCI^2 Framework for it to be further integrated into the TERESA robot, and
has achieved real-time performance at 10~26 Frames per second.
","[{'version': 'v1', 'created': 'Tue, 10 Apr 2018 14:07:45 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Apr 2018 15:20:31 GMT'}, {'version': 'v3', 'created': 'Thu, 24 Mar 2022 11:04:37 GMT'}]",2022-03-25,"[['Wang', 'Yujiang', ''], ['Shen', 'Jie', ''], ['Petridis', 'Stavros', ''], ['Pantic', 'Maja', '']]","['Real-Time Face Re-Identification', 'Open Set Re-ID', 'Multiple Re-ID', 'Human-Robot Interaction', 'CNN Descriptors', 'Online Clustering']"
4209,1902.09436,Tanweer Alam,"Tanweer Alam, Mohamed Benaida",The Role of Cloud-MANET Framework in the Internet of Things (IoT),arXiv admin note: text overlap with arXiv:1902.09744,"International Journal of Online Engineering (iJOE). ISSN:
  2626-8493, Vol 14, No 12 (2018)",10.3991/ijoe.v14i12.8338,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  In the next generation of computing, Mobile ad-hoc network (MANET) will play
a very important role in the Internet of Things (IoT). The MANET is a kind of
wireless networks that are self-organizing and auto connected in a
decentralized system. Every device in MANET can be moved freely from one
location to another in any direction. They can create a network with their
neighbors smart devices and forward data to another device. The IoT-Cloud-MANET
framework of smart devices is composed of IoT, cloud computing, and MANET. This
framework can access and deliver cloud services to the MANET users through
their smart devices in the IoT framework where all computations, data handling,
and resource management are performed. The smart devices can move from one
location to another within the range of the MANET network. Various MANETs can
connect to the same cloud, they can use cloud service in a real time. For
connecting the smart device of MANET to cloud needs integration with mobile
apps. My main contribution in this research links a new methodology for
providing secure communication on the internet of smart devices using MANET
Concept in 5G. The research methodology uses the correct and efficient
simulation of the desired study and can be implemented in a framework of the
Internet of Things in 5G.
","[{'version': 'v1', 'created': 'Mon, 25 Feb 2019 17:00:17 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Jun 2020 14:30:24 GMT'}]",2020-06-09,"[['Alam', 'Tanweer', ''], ['Benaida', 'Mohamed', '']]","['Mobile Ad Hoc Networks (MANET)', 'Cloud Computing', 'Internet of Things (IoT)', 'Smart Devices', '5G Network']"
4210,1408.3731,Micha{\l} {\L}opuszy\'nski,"Micha{\l} Jungiewicz, Micha{\l} {\L}opuszy\'nski",Unsupervised Keyword Extraction from Polish Legal Texts,,"Lecture Notes in Computer Science, Volume 8686, Springer 2014, pp
  65-70",10.1007/978-3-319-10888-9_7,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we present an application of the recently proposed unsupervised
keyword extraction algorithm RAKE to a corpus of Polish legal texts from the
field of public procurement. RAKE is essentially a language and domain
independent method. Its only language-specific input is a stoplist containing a
set of non-content words. The performance of the method heavily depends on the
choice of such a stoplist, which should be domain adopted. Therefore, we
complement RAKE algorithm with an automatic approach to selecting non-content
words, which is based on the statistical properties of term distribution.
","[{'version': 'v1', 'created': 'Sat, 16 Aug 2014 10:09:28 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Nov 2014 14:38:44 GMT'}]",2014-11-04,"[['Jungiewicz', 'Michał', ''], ['Łopuszyński', 'Michał', '']]","['keyword extraction', 'unsupervised learning', 'legal texts']"
4211,1801.04886,Khaza Anuarul Hoque,"Khaza Anuarul Hoque, Otmane Ait Mohamed, Yvon Savaria","Dependability modeling and optimization of triple modular redundancy
  partitioning for SRAM-based FPGAs","Published in Reliability Engineering & System Safety Volume 182,
  February 2019, Pages 107-119","Reliability Engineering & System Safety Volume 182, February 2019,
  Pages 107-119",10.1016/j.ress.2018.10.011,,cs.DC cs.AR cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  SRAM-based FPGAs are popular in the aerospace industry for their field
programmability and low cost. However, they suffer from cosmic
radiation-induced Single Event Upsets (SEUs). Triple Modular Redundancy (TMR)
is a well-known technique to mitigate SEUs in FPGAs that is often used with
another SEU mitigation technique known as configuration scrubbing. Traditional
TMR provides protection against a single fault at a time, while partitioned TMR
provides improved reliability and availability. In this paper, we present a
methodology to analyze TMR partitioning at early design stage using
probabilistic model checking. The proposed formal model can capture both single
and multiple-cell upset scenarios, regardless of any assumption of equal
partition sizes. Starting with a high-level description of a design, a Markov
model is constructed from the Data Flow Graph (DFG) using a specified number of
partitions, a component characterization library and a user defined scrub rate.
Such a model and exhaustive analysis captures all the considered failures and
repairs possible in the system within the radiation environment. Various
reliability and availability properties are then verified automatically using
the PRISM model checker exploring the relationship between the scrub frequency
and the number of TMR partitions required to meet the design requirements.
Also, the reported results show that based on a known voter failure rate, it is
possible to find an optimal number of partitions at early design stages using
our proposed method.
","[{'version': 'v1', 'created': 'Thu, 11 Jan 2018 19:00:22 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Mar 2018 20:38:27 GMT'}, {'version': 'v3', 'created': 'Tue, 8 Oct 2019 17:11:31 GMT'}]",2019-10-09,"[['Hoque', 'Khaza Anuarul', ''], ['Mohamed', 'Otmane Ait', ''], ['Savaria', 'Yvon', '']]","['SEU', 'TMR', 'probabilistic model checking', 'SRAM-based FPGA']"
4212,1507.08101,Moritz Kreutzer,"Moritz Kreutzer, Jonas Thies, Melven R\""ohrig-Z\""ollner, Andreas
  Pieper, Faisal Shahzad, Martin Galgon, Achim Basermann, Holger Fehske, Georg
  Hager, and Gerhard Wellein","GHOST: Building blocks for high performance sparse linear algebra on
  heterogeneous systems","32 pages, 11 figures",,10.1007/s10766-016-0464-z,,cs.DC cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While many of the architectural details of future exascale-class high
performance computer systems are still a matter of intense research, there
appears to be a general consensus that they will be strongly heterogeneous,
featuring ""standard"" as well as ""accelerated"" resources. Today, such resources
are available as multicore processors, graphics processing units (GPUs), and
other accelerators such as the Intel Xeon Phi. Any software infrastructure that
claims usefulness for such environments must be able to meet their inherent
challenges: massive multi-level parallelism, topology, asynchronicity, and
abstraction. The ""General, Hybrid, and Optimized Sparse Toolkit"" (GHOST) is a
collection of building blocks that targets algorithms dealing with sparse
matrix representations on current and future large-scale systems. It implements
the ""MPI+X"" paradigm, has a pure C interface, and provides hybrid-parallel
numerical kernels, intelligent resource management, and truly heterogeneous
parallelism for multicore CPUs, Nvidia GPUs, and the Intel Xeon Phi. We
describe the details of its design with respect to the challenges posed by
modern heterogeneous supercomputers and recent algorithmic developments.
Implementation details which are indispensable for achieving high efficiency
are pointed out and their necessity is justified by performance measurements or
predictions based on performance models. The library code and several
applications are available as open source. We also provide instructions on how
to make use of GHOST in existing software packages, together with a case study
which demonstrates the applicability and performance of GHOST as a component
within a larger software stack.
","[{'version': 'v1', 'created': 'Wed, 29 Jul 2015 11:08:57 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Dec 2015 16:08:56 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Feb 2016 12:28:41 GMT'}]",2016-10-05,"[['Kreutzer', 'Moritz', ''], ['Thies', 'Jonas', ''], ['Röhrig-Zöllner', 'Melven', ''], ['Pieper', 'Andreas', ''], ['Shahzad', 'Faisal', ''], ['Galgon', 'Martin', ''], ['Basermann', 'Achim', ''], ['Fehske', 'Holger', ''], ['Hager', 'Georg', ''], ['Wellein', 'Gerhard', '']]","['sparse linear algebra', 'heterogeneous computing', 'software library', 'taskparallelism', 'large scale computing']"
4213,1412.3628,Mostafa Zaman Chowdhury,"Mostafa Zaman Chowdhury, Tuan Nguyen, Young-Il Kim, Won Ryu, and Yeong
  Min Jang","Radio Resource Allocation for Scalable Video Services over Wireless
  Cellular Networks",,"Wireless Personal Communications, vol. 74, no 3, pp. 1061-1079,
  Feb. 2014",10.1007/s11277-013-1344-0,,cs.MM cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Good quality video services always require higher bandwidth. Hence, to
provide the video services e.g., multicast/broadcast services (MBS) and unicast
services along with the existing voice, internet, and other background traffic
services over the wireless cellular networks, it is required to efficiently
manage the wireless resources in order to reduce the overall forced call
termination probability, to maximize the overall service quality, and to
maximize the revenue. Fixed bandwidth allocation for the MBS sessions either
reduces the quality of the MBS videos and bandwidth utilization or increases
the overall forced call termination probability and of course the handover call
dropping probability as well. Scalable Video Coding (SVC) technique allows the
variable bit rate allocation for the video services. In this paper, we propose
a bandwidth allocation scheme that efficiently allocates bandwidth among the
MBS sessions and the non-MBS traffic calls (e.g., voice, unicast, internet, and
other background traffic). The proposed scheme reduces the bandwidth allocation
for the MBS sessions during the congested traffic condition only to accommodate
more calls in the system. Instead of allocating fixed bandwidths for the BMS
sessions and the non-MBS traffic, our scheme allocates variable bandwidths for
them. However, the minimum quality of the videos is guaranteed by allocating
minimum bandwidth for them. Using the mathematical and numerical analyses, we
show that the proposed scheme maximizes the bandwidth utilization and
significantly reduces the overall forced call termination probability as well
as the handover call dropping probability.
","[{'version': 'v1', 'created': 'Thu, 11 Dec 2014 12:35:11 GMT'}]",2014-12-12,"[['Chowdhury', 'Mostafa Zaman', ''], ['Nguyen', 'Tuan', ''], ['Kim', 'Young-Il', ''], ['Ryu', 'Won', ''], ['Jang', 'Yeong Min', '']]","['MBS', 'scalable', 'QoS', 'bandwidth allocation', 'video session', 'call dropping probability', 'call blocking probability', 'bandwidth utilization']"
4214,1612.04590,Stefan Wagner,Stefan Wagner,"A literature survey of the quality economics of defect-detection
  techniques","10 pages, 3 figures","Proceedings of the 2006 ACM/IEEE International Symposium on
  Empirical Software Engineering (ISESE '06). Pages 194-203. ACM, 2006",10.1145/1159733.1159763,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the last decades, a considerable amount of empirical knowledge about the
efficiency of defect-detection techniques has been accumulated. Also a few
surveys have summarised those studies with different focuses, usually for a
specific type of technique. This work reviews the results of empirical studies
and associates them with a model of software quality economics. This allows a
better comparison of the different techniques and supports the application of
the model in practice as several parameters can be approximated with typical
average values. The main contributions are the provision of average values of
several interesting quantities w.r.t. defect detection and the identification
of areas that need further research because of the limited knowledge available.
","[{'version': 'v1', 'created': 'Wed, 14 Dec 2016 11:49:21 GMT'}]",2016-12-15,"[['Wagner', 'Stefan', '']]","['Software quality economics', 'quality cost', 'cost/benefit', 'defectdetection techniques', 'literature survey']"
4215,1702.00394,Markus von Hoegen,"J\""org Schr\""oder, Markus von Hoegen, Patrizio Neff",The exponentiated Hencky energy: Anisotropic extension and case studies,submitted to Computational Mechanics,,10.1007/s00466-017-1466-4,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose an anisotropic extension of the isotropic
exponentiated Hencky energy, based on logarithmic strain invariants. Unlike
other elastic formulations, the isotropic exponentiated Hencky elastic energy
has been derived solely on differential geometric grounds, involving the
geodesic distance of the deformation gradient F to the group of rotations. We
formally extend this approach towards anisotropy by defining additional
anisotropic logarithmic strain invariants with the help of suitable structural
tensors and consider our findings for selected case studies.
","[{'version': 'v1', 'created': 'Wed, 1 Feb 2017 18:57:38 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Sep 2017 13:07:06 GMT'}]",2017-10-10,"[['Schröder', 'Jörg', ''], ['von Hoegen', 'Markus', ''], ['Neff', 'Patrizio', '']]","['Hencky energy', 'logarithmic strain tensor', 'anisotropy', 'strain invariants', 'biomechanics']"
4216,2003.02526,"Serhan G\""ul","Serhan G\""ul, Dimitri Podborski, Jangwoo Son, Gurdeep Singh Bhullar,
  Thomas Buchholz, Thomas Schierl, Cornelius Hellge","Cloud Rendering-based Volumetric Video Streaming System for Mixed
  Reality Services","4 pages, 2 figures",11th ACM Multimedia Systems Conference (MMSys) 2020,10.1145/3339825.3393583,,cs.MM eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Volumetric video is an emerging technology for immersive representation of 3D
spaces that captures objects from all directions using multiple cameras and
creates a dynamic 3D model of the scene. However, processing volumetric content
requires high amounts of processing power and is still a very demanding task
for today's mobile devices. To mitigate this, we propose a volumetric video
streaming system that offloads the rendering to a powerful cloud/edge server
and only sends the rendered 2D view to the client instead of the full
volumetric content. We use 6DoF head movement prediction techniques, WebRTC
protocol and hardware video encoding to ensure low-latency in different parts
of the processing chain. We demonstrate our system using both a browser-based
client and a Microsoft HoloLens client. Our application contains generic
interfaces that allow for easy deployment of various augmented/mixed reality
clients using the same server implementation.
","[{'version': 'v1', 'created': 'Thu, 5 Mar 2020 10:44:37 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Jul 2020 13:43:21 GMT'}]",2020-07-17,"[['Gül', 'Serhan', ''], ['Podborski', 'Dimitri', ''], ['Son', 'Jangwoo', ''], ['Bhullar', 'Gurdeep Singh', ''], ['Buchholz', 'Thomas', ''], ['Schierl', 'Thomas', ''], ['Hellge', 'Cornelius', '']]","['volumetric video', 'augmented reality', 'mixed reality', 'edge cloud', 'cloud rendering']"
4217,1304.6099,Anna Kucerova,A. Kucerova and M. Leps,"Soft computing-based calibration of microplane M4 model parameters:
  Methodology and validation","24 pages, 12 figures, 14 tables, submitted to Advances in Engineering
  Software, corrected and extended after the first review","Advances in Engineering Software, 72, 226-235, 2014",10.1016/j.advengsoft.2014.01.013,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Constitutive models for concrete based on the microplane concept have
repeatedly proven their ability to well-reproduce its non-linear response on
material as well as structural scales. The major obstacle to a routine
application of this class of models is, however, the calibration of
microplane-related constants from macroscopic data. The goal of this paper is
two-fold: (i) to introduce the basic ingredients of a robust inverse procedure
for the determination of dominant parameters of the M4 model proposed by Bazant
and co-workers based on cascade Artificial Neural Networks trained by
Evolutionary Algorithm and (ii) to validate the proposed methodology against a
representative set of experimental data. The obtained results demonstrate that
the soft computing-based method is capable of delivering the searched response
with an accuracy comparable to the values obtained by expert users.
","[{'version': 'v1', 'created': 'Fri, 19 Apr 2013 08:11:55 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Jul 2013 10:10:35 GMT'}]",2014-10-17,"[['Kucerova', 'A.', ''], ['Leps', 'M.', '']]","['computational simulation of concrete', 'microplane model M4', 'inverseanalysis', 'neural networks', 'global sensitivity analysis', 'evolutionary algorithm']"
4218,1402.2308,Nathan Kallus,Nathan Kallus,Predicting Crowd Behavior with Big Public Data,,,10.1145/2567948.2579233,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With public information becoming widely accessible and shared on today's web,
greater insights are possible into crowd actions by citizens and non-state
actors such as large protests and cyber activism. We present efforts to predict
the occurrence, specific timeframe, and location of such actions before they
occur based on public data collected from over 300,000 open content web sources
in 7 languages, from all over the world, ranging from mainstream news to
government publications to blogs and social media. Using natural language
processing, event information is extracted from content such as type of event,
what entities are involved and in what role, sentiment and tone, and the
occurrence time range of the event discussed. Statements made on Twitter about
a future date from the time of posting prove particularly indicative. We
consider in particular the case of the 2013 Egyptian coup d'etat. The study
validates and quantifies the common intuition that data on social media (beyond
mainstream news sources) are able to predict major events.
","[{'version': 'v1', 'created': 'Mon, 10 Feb 2014 21:23:14 GMT'}]",2014-02-12,"[['Kallus', 'Nathan', '']]","['Web and social media mining', 'Twitter analysis', 'Crowd behavior', 'Forecasting', 'Event extraction', 'Temporal analytics', 'Sentiment analysis', 'Online activism']"
4219,1512.04295,Lukas Cavigelli,"Lukas Cavigelli, Luca Benini",Origami: A 803 GOp/s/W Convolutional Network Accelerator,14 pages,,10.1109/TCSVT.2016.2592330,,cs.CV cs.AI cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An ever increasing number of computer vision and image/video processing
challenges are being approached using deep convolutional neural networks,
obtaining state-of-the-art results in object recognition and detection,
semantic segmentation, action recognition, optical flow and superresolution.
Hardware acceleration of these algorithms is essential to adopt these
improvements in embedded and mobile computer vision systems. We present a new
architecture, design and implementation as well as the first reported silicon
measurements of such an accelerator, outperforming previous work in terms of
power-, area- and I/O-efficiency. The manufactured device provides up to 196
GOp/s on 3.09 mm^2 of silicon in UMC 65nm technology and can achieve a power
efficiency of 803 GOp/s/W. The massively reduced bandwidth requirements make it
the first architecture scalable to TOp/s performance.
","[{'version': 'v1', 'created': 'Mon, 14 Dec 2015 13:06:43 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Jan 2016 22:56:41 GMT'}]",2016-11-11,"[['Cavigelli', 'Lukas', ''], ['Benini', 'Luca', '']]","['Computer Vision', 'Convolutional Networks', 'VLSI']"
4220,1702.00374,Arthur Azevedo de Amorim,"Arthur Azevedo de Amorim, Marco Gaboardi, Justin Hsu, Shin-ya
  Katsumata, Ikram Cherigui",A Semantic Account of Metric Preservation,,,10.1145/3009837.3009890,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Program sensitivity measures how robust a program is to small changes in its
input, and is a fundamental notion in domains ranging from differential privacy
to cyber-physical systems. A natural way to formalize program sensitivity is in
terms of metrics on the input and output spaces, requiring that an
$r$-sensitive function map inputs that are at distance $d$ to outputs that are
at distance at most $r \cdot d$. Program sensitivity is thus an analogue of
Lipschitz continuity for programs.
  Reed and Pierce introduced Fuzz, a functional language with a linear type
system that can express program sensitivity. They show soundness operationally,
in the form of a metric preservation property. Inspired by their work, we study
program sensitivity and metric preservation from a denotational point of view.
In particular, we introduce metric CPOs, a novel semantic structure for
reasoning about computation on metric spaces, by endowing CPOs with a
compatible notion of distance. This structure is useful for reasoning about
metric properties of programs, and specifically about program sensitivity. We
demonstrate metric CPOs by giving a model for the deterministic fragment of
Fuzz.
","[{'version': 'v1', 'created': 'Wed, 1 Feb 2017 17:50:42 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Jul 2017 16:29:58 GMT'}, {'version': 'v3', 'created': 'Sun, 23 Oct 2022 14:46:19 GMT'}]",2022-10-25,"[['de Amorim', 'Arthur Azevedo', ''], ['Gaboardi', 'Marco', ''], ['Hsu', 'Justin', ''], ['Katsumata', 'Shin-ya', ''], ['Cherigui', 'Ikram', '']]","['domain theory', 'program sensitivity', 'metric spaces', 'Lipschitz continuity']"
4221,1908.01819,Andrea Zugarini,"Giuseppe Marra and Andrea Zugarini and Stefano Melacci and Marco
  Maggini","An Unsupervised Character-Aware Neural Approach to Word and Context
  Representation Learning",,"Lecture Notes in Computer Science, vol 11141. Springer, Cham 2018",10.1007/978-3-030-01424-7_13,,cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last few years, neural networks have been intensively used to develop
meaningful distributed representations of words and contexts around them. When
these representations, also known as ""embeddings"", are learned from
unsupervised large corpora, they can be transferred to different tasks with
positive effects in terms of performances, especially when only a few
supervisions are available. In this work, we further extend this concept, and
we present an unsupervised neural architecture that jointly learns word and
context embeddings, processing words as sequences of characters. This allows
our model to spot the regularities that are due to the word morphology, and to
avoid the need of a fixed-sized input vocabulary of words. We show that we can
learn compact encoders that, despite the relatively small number of parameters,
reach high-level performances in downstream tasks, comparing them with related
state-of-the-art approaches or with fully supervised methods.
","[{'version': 'v1', 'created': 'Fri, 19 Jul 2019 09:34:11 GMT'}]",2019-08-07,"[['Marra', 'Giuseppe', ''], ['Zugarini', 'Andrea', ''], ['Melacci', 'Stefano', ''], ['Maggini', 'Marco', '']]","['Recurrent Neural Networks', 'Unsupervised Learning', 'Wordand Context Embeddings', 'Natural Language Processing', 'Deep Learning']"
4222,1608.00724,Darren Strash,Darren Strash,"On the Power of Simple Reductions for the Maximum Independent Set
  Problem","13 pages; 1 figure; 3 tables; Appeared at the 22nd International
  Conference on Computing and Combinatorics (COCOON 2016)",,10.1007/978-3-319-42634-1_28,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reductions---rules that reduce input size while maintaining the ability to
compute an optimal solution---are critical for developing efficient maximum
independent set algorithms in both theory and practice. While several simple
reductions have previously been shown to make small domain-specific instances
tractable in practice, it was only recently shown that advanced reductions (in
a measure-and-conquer approach) can be used to solve real-world networks on
millions of vertices [Akiba and Iwata, TCS 2016]. In this paper we compare
these state-of-the-art reductions against a small suite of simple reductions,
and come to two conclusions: just two simple reductions---vertex folding and
isolated vertex removal---are sufficient for many real-world instances, and
further, the power of the advanced rules comes largely from their initial
application (i.e., kernelization), and not their repeated application during
branch-and-bound. As a part of our comparison, we give the first experimental
evaluation of a reduction based on maximum critical independent sets, and show
it is highly effective in practice for medium-sized networks.
","[{'version': 'v1', 'created': 'Tue, 2 Aug 2016 08:15:21 GMT'}]",2016-08-03,"[['Strash', 'Darren', '']]","['maximum independent set', 'minimum vertex cover', 'kernelization', 'reductions', 'exact algorithms']"
4223,1406.5633,Timothy Molter,M. Alexander Nugent and Timothy W. Molter,Thermodynamic-RAM Technology Stack,,,10.1080/17445760.2017.1314472,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a technology stack or specification describing the multiple
levels of abstraction and specialization needed to implement a neuromorphic
processor (NPU) based on the previously-described concept of AHaH Computing and
integrate it into today's digital computing systems. The general purpose NPU
implementation described here is called Thermodynamic-RAM (kT-RAM) and is just
one of many possible architectures, each with varying advantages and trade
offs. Bringing us closer to brain-like neural computation, kT-RAM will provide
a general-purpose adaptive hardware resource to existing computing platforms
enabling fast and low-power machine learning capabilities that are currently
hampered by the separation of memory and processing, a.k.a the von Neumann
bottleneck. Because understanding such a processor based on non-traditional
principles can be difficult, by presenting the various levels of the stack from
the bottom up, layer by layer, explaining kT-RAM becomes a much easier task.
The levels of the Thermodynamic-RAM technology stack include the memristor,
synapse, AHaH node, kT-RAM, instruction set, sparse spike encoding, kT-RAM
emulator, and SENSE server.
","[{'version': 'v1', 'created': 'Sat, 21 Jun 2014 17:03:11 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Mar 2017 11:32:23 GMT'}]",2017-04-26,"[['Nugent', 'M. Alexander', ''], ['Molter', 'Timothy W.', '']]","['neuromorphic', 'memristor', 'artificial intelligence', 'machine learning']"
4224,1308.2762,Debajit Sensarma,Debajit Sensarma and Koushik Majumder,"An efficient ant based qos aware intelligent temporally ordered routing
  algorithm for manets","15 pages, 7 figures, International Journal of Computer Networks &
  Communications (IJCNC) Vol.5, No.4, July 2013",,10.5121/ijcnc.2013.5415,,cs.NI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Mobile Ad hoc network (MANET) is a self configurable network connected by
wireless links. This type of network is only suitable for temporary
communication links as it is infrastructure-less and there is no centralised
control. Providing QoS aware routing is a challenging task in this type of
network due to dynamic topology and limited resources. The main purpose of QoS
aware routing is to find a feasible path from source to destination which will
satisfy two or more end to end QoS constrains. Therefore, the task of designing
an efficient routing algorithm which will satisfy all the quality of service
requirements and be robust and adaptive is considered as a highly challenging
problem. In this work we have designed a new efficient and energy aware
multipath routing algorithm based on ACO framework, inspired by the behaviours
of biological ants. Basically by considering QoS constraints and artificial
ants we have designed an intelligent version of classical Temporally Ordered
Routing Algorithm (TORA) which will increase network lifetime and decrease
packet loss and average end to end delay that makes this algorithm suitable for
real time and multimedia applications.
","[{'version': 'v1', 'created': 'Tue, 13 Aug 2013 06:08:01 GMT'}]",2013-08-14,"[['Sensarma', 'Debajit', ''], ['Majumder', 'Koushik', '']]","['MANET', 'Ant Colony Optimization', 'TORA', 'QoS Routing']"
4225,0802.2001,Uwe Aickelin,Uwe Aickelin and Kathryn Dowsland,"Exploiting problem structure in a genetic algorithm approach to a nurse
  rostering problem",,"Journal of Scheduling, 3(3), pp 139-153, 2000",10.1002/(SICI)1099-1425(200005/06)3:3<139::AID-JOS41>3.0.CO;2-2,,cs.NE cs.CE,,"  There is considerable interest in the use of genetic algorithms to solve
problems arising in the areas of scheduling and timetabling. However, the
classical genetic algorithm paradigm is not well equipped to handle the
conflict between objectives and constraints that typically occurs in such
problems. In order to overcome this, successful implementations frequently make
use of problem specific knowledge. This paper is concerned with the development
of a GA for a nurse rostering problem at a major UK hospital. The structure of
the constraints is used as the basis for a co-evolutionary strategy using
co-operating sub-populations. Problem specific knowledge is also used to define
a system of incentives and disincentives, and a complementary mutation
operator. Empirical results based on 52 weeks of live data show how these
features are able to improve an unsuccessful canonical GA to the point where it
is able to provide a practical solution to the problem
","[{'version': 'v1', 'created': 'Thu, 14 Feb 2008 11:25:37 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Mar 2008 16:56:56 GMT'}, {'version': 'v3', 'created': 'Fri, 16 May 2008 10:44:23 GMT'}]",2010-07-05,"[['Aickelin', 'Uwe', ''], ['Dowsland', 'Kathryn', '']]","['manpower scheduling', 'genetic algorithms', 'heuristics', 'co-evolution']"
4226,2204.02947,Przemyslaw Grabowicz,"Przemyslaw Grabowicz, Nicholas Perello, Aarshee Mishra",Marrying Fairness and Explainability in Supervised Learning,"23 pages, 17 figures","2022 ACM Conference on Fairness, Accountability, and Transparency
  (FAccT '22)",10.1145/3531146.3533236,,cs.LG cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning algorithms that aid human decision-making may inadvertently
discriminate against certain protected groups. We formalize direct
discrimination as a direct causal effect of the protected attributes on the
decisions, while induced discrimination as a change in the causal influence of
non-protected features associated with the protected attributes. The
measurements of marginal direct effect (MDE) and SHapley Additive exPlanations
(SHAP) reveal that state-of-the-art fair learning methods can induce
discrimination via association or reverse discrimination in synthetic and
real-world datasets. To inhibit discrimination in algorithmic systems, we
propose to nullify the influence of the protected attribute on the output of
the system, while preserving the influence of remaining features. We introduce
and study post-processing methods achieving such objectives, finding that they
yield relatively high model accuracy, prevent direct discrimination, and
diminishes various disparity measures, e.g., demographic disparity.
","[{'version': 'v1', 'created': 'Wed, 6 Apr 2022 17:26:58 GMT'}, {'version': 'v2', 'created': 'Sat, 14 May 2022 20:43:20 GMT'}]",2022-05-17,"[['Grabowicz', 'Przemyslaw', ''], ['Perello', 'Nicholas', ''], ['Mishra', 'Aarshee', '']]","['machine learning', 'explainability', 'algorithmic fairness', 'discrimination', 'supervised learning']"
4227,0904.1110,David Nowak,David Nowak,On formal verification of arithmetic-based cryptographic primitives,13 pages,"In Information Security and Cryptology - ICISC 2008, 11th
  International Conference, Seoul, Korea, December 3-5, 2008, Proceedings,
  volume 5461 of Lecture Notes in Computer Science, pages 368-382, Springer",10.1007/978-3-642-00730-9_23,,cs.CR cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cryptographic primitives are fundamental for information security: they are
used as basic components for cryptographic protocols or public-key
cryptosystems. In many cases, their security proofs consist in showing that
they are reducible to computationally hard problems. Those reductions can be
subtle and tedious, and thus not easily checkable. On top of the proof
assistant Coq, we had implemented in previous work a toolbox for writing and
checking game-based security proofs of cryptographic primitives. In this paper
we describe its extension with number-theoretic capabilities so that it is now
possible to write and check arithmetic-based cryptographic primitives in our
toolbox. We illustrate our work by machine checking the game-based proofs of
unpredictability of the pseudo-random bit generator of Blum, Blum and Shub, and
semantic security of the public-key cryptographic scheme of Goldwasser and
Micali.
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2009 11:04:39 GMT'}]",2009-04-08,"[['Nowak', 'David', '']]","['machine formalization', 'cryptographic primitives', 'CSPRBG', 'semantic security']"
4228,2205.05512,Michele Loi Dr.,Michele Loi and Christoph Heitz,"Is calibration a fairness requirement? An argument from the point of
  view of moral philosophy and decision theory","Changes relative to the Conference version:(a) footnote 9 and 13
  revealing a hidden assumption and correcting the expected utility formula for
  the case in which the assumption does not hold; (b) a mathematical proof of
  the main thesis for the case in which the assumption is relaxed","2022 ACM Conference on Fairness, Accountability, and Transparency
  (FAccT '22), June 21-24, 2022, Seoul, Republic of Korea",10.1145/3531146.3533245,,cs.LG cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we provide a moral analysis of two criteria of statistical
fairness debated in the machine learning literature: 1) calibration between
groups and 2) equality of false positive and false negative rates between
groups. In our paper, we focus on moral arguments in support of either measure.
The conflict between group calibration vs. false positive and false negative
rate equality is one of the core issues in the debate about group fairness
definitions among practitioners. For any thorough moral analysis, the meaning
of the term fairness has to be made explicit and defined properly. For our
paper, we equate fairness with (non-)discrimination, which is a legitimate
understanding in the discussion about group fairness. More specifically, we
equate it with prima facie wrongful discrimination in the sense this is used in
Prof. Lippert-Rasmussen's treatment of this definition. In this paper, we argue
that a violation of group calibration may be unfair in some cases, but not
unfair in others. This is in line with claims already advanced in the
literature, that algorithmic fairness should be defined in a way that is
sensitive to context. The most important practical implication is that
arguments based on examples in which fairness requires between-group
calibration, or equality in the false-positive/false-negative rates, do no
generalize. For it may be that group calibration is a fairness requirement in
one case, but not in another.
","[{'version': 'v1', 'created': 'Wed, 11 May 2022 14:03:33 GMT'}, {'version': 'v2', 'created': 'Mon, 23 May 2022 18:09:19 GMT'}, {'version': 'v3', 'created': 'Sun, 19 Jun 2022 16:06:31 GMT'}]",2022-06-22,"[['Loi', 'Michele', ''], ['Heitz', 'Christoph', '']]","['calibration', 'fairness', 'equalized\todds', 'opportunity', 'prediction']"
4229,1908.00085,Ana Lucic,"Ana Lucic, Hinda Haned, Maarten de Rijke","Why Does My Model Fail? Contrastive Local Explanations for Retail
  Forecasting",To appear in ACM FAT* 2020,"Proceedings of the 2020 Conference on Fairness, Accountability,
  and Transparency",10.1145/3351095.3372824,,cs.HC cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In various business settings, there is an interest in using more complex
machine learning techniques for sales forecasting. It is difficult to convince
analysts, along with their superiors, to adopt these techniques since the
models are considered to be ""black boxes,"" even if they perform better than
current models in use. We examine the impact of contrastive explanations about
large errors on users' attitudes towards a ""black-box'"" model. We propose an
algorithm, Monte Carlo Bounds for Reasonable Predictions. Given a large error,
MC-BRP determines (1) feature values that would result in a reasonable
prediction, and (2) general trends between each feature and the target, both
based on Monte Carlo simulations. We evaluate on a real dataset with real users
by conducting a user study with 75 participants to determine if explanations
generated by MC-BRP help users understand why a prediction results in a large
error, and if this promotes trust in an automatically-learned model. Our study
shows that users are able to answer objective questions about the model's
predictions with overall 81.1% accuracy when provided with these contrastive
explanations. We show that users who saw MC-BRP explanations understand why the
model makes large errors in predictions significantly more than users in the
control group. We also conduct an in-depth analysis on the difference in
attitudes between Practitioners and Researchers, and confirm that our results
hold when conditioning on the users' background.
","[{'version': 'v1', 'created': 'Wed, 17 Jul 2019 12:57:06 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Nov 2019 14:51:52 GMT'}]",2021-08-20,"[['Lucic', 'Ana', ''], ['Haned', 'Hinda', ''], ['de Rijke', 'Maarten', '']]","['Explainability', 'Interpretability', 'Erroneous predictions']"
4230,1609.02500,Denis Tom\`e,"Denis Tome', Luca Bondi, Emanuele Plebani, Luca Baroffio, Danilo Pau,
  Stefano Tubaro",Reduced Memory Region Based Deep Convolutional Neural Network Detection,IEEE 2016 ICCE-Berlin,"2016 IEEE 6th International Conference on Consumer Electronics -
  Berlin (ICCE-Berlin)",10.1109/ICCE-Berlin.2016.7684706,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Accurate pedestrian detection has a primary role in automotive safety: for
example, by issuing warnings to the driver or acting actively on car's brakes,
it helps decreasing the probability of injuries and human fatalities. In order
to achieve very high accuracy, recent pedestrian detectors have been based on
Convolutional Neural Networks (CNN). Unfortunately, such approaches require
vast amounts of computational power and memory, preventing efficient
implementations on embedded systems. This work proposes a CNN-based detector,
adapting a general-purpose convolutional network to the task at hand. By
thoroughly analyzing and optimizing each step of the detection pipeline, we
develop an architecture that outperforms methods based on traditional image
features and achieves an accuracy close to the state-of-the-art while having
low computational complexity. Furthermore, the model is compressed in order to
fit the tight constrains of low power devices with a limited amount of embedded
memory available. This paper makes two main contributions: (1) it proves that a
region based deep neural network can be finely tuned to achieve adequate
accuracy for pedestrian detection (2) it achieves a very low memory usage
without reducing detection accuracy on the Caltech Pedestrian dataset.
","[{'version': 'v1', 'created': 'Thu, 8 Sep 2016 17:16:38 GMT'}]",2018-08-09,"[[""Tome'"", 'Denis', ''], ['Bondi', 'Luca', ''], ['Plebani', 'Emanuele', ''], ['Baroffio', 'Luca', ''], ['Pau', 'Danilo', ''], ['Tubaro', 'Stefano', '']]","['Window proposals', 'CNN', 'Object Detection', 'finetuning', 'embedded systems']"
4231,1811.02309,Ali Reihanian,"Ali Reihanian, Mohammad-Reza Feizi-Derakhshi, Hadi S. Aghdasi","An Enhanced Multi-Objective Biogeography-Based Optimization for
  Overlapping Community Detection in Social Networks with Node Attributes","1. This paper has been published in the journal of ""Information
  Sciences"". 2. https://doi.org/10.1016/j.ins.2022.11.125","Information Sciences, 622, pp.903-929 (2023)",10.1016/j.ins.2022.11.125,,cs.SI cs.NE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Community detection is one of the most important and interesting issues in
social network analysis. In recent years, simultaneous considering of nodes'
attributes and topological structures of social networks in the process of
community detection has attracted the attentions of many scholars, and this
consideration has been recently used in some community detection methods to
increase their efficiencies and to enhance their performances in finding
meaningful and relevant communities. But the problem is that most of these
methods tend to find non-overlapping communities, while many real-world
networks include communities that often overlap to some extent. In order to
solve this problem, an evolutionary algorithm called MOBBO-OCD, which is based
on multi-objective biogeography-based optimization (BBO), is proposed in this
paper to automatically find overlapping communities in a social network with
node attributes with synchronously considering the density of connections and
the similarity of nodes' attributes in the network. In MOBBO-OCD, an extended
locus-based adjacency representation called OLAR is introduced to encode and
decode overlapping communities. Based on OLAR, a rank-based migration operator
along with a novel two-phase mutation strategy and a new double-point crossover
are used in the evolution process of MOBBO-OCD to effectively lead the
population into the evolution path. In order to assess the performance of
MOBBO-OCD, a new metric called alpha_SAEM is proposed in this paper, which is
able to evaluate the goodness of both overlapping and non-overlapping
partitions with considering the two aspects of node attributes and linkage
structure. Quantitative evaluations reveal that MOBBO-OCD achieves favorable
results which are quite superior to the results of 15 relevant community
detection algorithms in the literature.
","[{'version': 'v1', 'created': 'Tue, 6 Nov 2018 12:09:36 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Nov 2021 22:10:16 GMT'}, {'version': 'v3', 'created': 'Wed, 28 Dec 2022 11:16:14 GMT'}]",2022-12-29,"[['Reihanian', 'Ali', ''], ['Feizi-Derakhshi', 'Mohammad-Reza', ''], ['Aghdasi', 'Hadi S.', '']]","['Overlapping Community Detection', 'Node Attributes', 'Topological Structure', 'Biogeography-Based Optimization', 'Multi']"
4232,1811.00111,David G\'omez-Guti\'errez,"David G\'omez-Guti\'errez, Carlos Renato V\'azquez, Sergej
  \v{C}elikovsk\'y, Juan Diego S\'anchez-Torres and Javier Ruiz Le\'on","On finite-time and fixed-time consensus algorithms for dynamic networks
  switching among disconnected digraphs","Please cite the publisher's version}. For the publisher's version and
  full citation details see: https://doi.org/10.1080/00207179.2018.1543896 The
  following links provide access, for a limited time, to a free copy of the
  publisher's version:
  https://www.tandfonline.com/eprint/FSW8JJRVPHMXJ3XUUXZH/full?target=10.1080/00207179.2018.1543896","International Journal of Control, 93(9), 2120-2134, 2020",10.1080/00207179.2018.1543896,,cs.SY cs.MA math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of this paper is to analyze a class of consensus algorithms with
finite-time or fixed-time convergence for dynamic networks formed by agents
with first-order dynamics. In particular, in the analyzed class a single
evaluation of a nonlinear function of the consensus error is performed per each
node. The classical assumption of switching among connected graphs is dropped
here, allowing to represent failures and intermittent communications between
agents. Thus, conditions to guarantee finite and fixed-time convergence, even
while switching among disconnected graphs, are provided. Moreover, the
algorithms of the considered class are shown to be computationally simpler than
previously proposed finite-time consensus algorithms for dynamic networks,
which is an important feature in scenarios with computationally limited nodes
and energy efficiency requirements such as in sensor networks. The performance
of the considered consensus algorithms is illustrated through simulations,
comparing it to existing approaches for dynamic networks with finite-time and
fixed-time convergence. It is shown that the settling time of the considered
algorithms grows slower when the number of nodes increases than with other
consensus algorithms for dynamic networks.
","[{'version': 'v1', 'created': 'Wed, 31 Oct 2018 20:53:01 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Jun 2021 23:30:55 GMT'}]",2021-06-29,"[['Gómez-Gutiérrez', 'David', ''], ['Vázquez', 'Carlos Renato', ''], ['Čelikovský', 'Sergej', ''], ['Sánchez-Torres', 'Juan Diego', ''], ['León', 'Javier Ruiz', '']]","['Finite-time consensus', 'Fixed-time consensus', 'dynamical networks', 'multi-agentsystems', 'multiple interacting autonomous agents', 'self-organizing systems']"
4233,1409.8563,Daniel Ruprecht,"Andrea Arteaga, Daniel Ruprecht, Rolf Krause","A stencil-based implementation of Parareal in the C++ domain specific
  embedded language STELLA",,"Applied Mathematics and Computation 267, pp. 727-741, 2015",10.1016/j.amc.2014.12.055,,cs.DC math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In view of the rapid rise of the number of cores in modern supercomputers,
time-parallel methods that introduce concurrency along the temporal axis are
becoming increasingly popular. For the solution of time-dependent partial
differential equations, these methods can add another direction for concurrency
on top of spatial parallelization. The paper presents an implementation of the
time-parallel Parareal method in a C++ domain specific language for stencil
computations (STELLA). STELLA provides both an OpenMP and a CUDA backend for a
shared memory parallelization, using the CPU or GPU inside a node for the
spatial stencils. Here, we intertwine this node-wise spatial parallelism with
the time-parallel Parareal. This is done by adding an MPI-based implementation
of Parareal, which allows us to parallelize in time across nodes. The
performance of Parareal with both backends is analyzed in terms of speedup,
parallel efficiency and energy-to-solution for an advection-diffusion problem
with a time-dependent diffusion coefficient.
","[{'version': 'v1', 'created': 'Tue, 30 Sep 2014 14:34:13 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Dec 2014 12:55:41 GMT'}]",2015-09-22,"[['Arteaga', 'Andrea', ''], ['Ruprecht', 'Daniel', ''], ['Krause', 'Rolf', '']]","['Parareal', 'STELLA', 'GPU', 'CPU', 'parallel-in-time', 'stencil computation', 'speedup', 'energy consumption']"
4234,1809.00168,Mateusz Trokielewicz,Mateusz Trokielewicz and Adam Czajka and Piotr Maciejewicz,Implications of Ocular Pathologies for Iris Recognition Reliability,Image and Vision Computing (2016),,10.1016/j.imavis.2016.08.001,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an analysis of how iris recognition is influenced by eye
disease and an appropriate dataset comprising 2996 images of irises taken from
230 distinct eyes (including 184 affected by more than 20 different eye
conditions). The images were collected in near infrared and visible light
during routine ophthalmological examination. The experimental study carried out
utilizing four independent iris recognition algorithms (MIRLIN, VeriEye, OSIRIS
and IriCore) renders four valuable results. First, the enrollment process is
highly sensitive to those eye conditions that obstruct the iris or cause
geometrical distortions. Second, even those conditions that do not produce
visible changes to the structure of the iris may increase the dissimilarity
between samples of the same eyes. Third, eye conditions affecting the geometry
or the tissue structure of the iris or otherwise producing obstructions
significantly decrease same-eye similarity and have a lower, yet still
statistically significant, influence on impostor comparison scores. Fourth, for
unhealthy eyes, the most prominent effect of disease on iris recognition is to
cause segmentation errors. To our knowledge this paper describes the largest
database of iris images for disease-affected eyes made publicly available to
researchers and offers the most comprehensive study of what we can expect when
iris recognition is employed for diseased eyes.
","[{'version': 'v1', 'created': 'Sat, 1 Sep 2018 13:03:48 GMT'}]",2018-09-05,"[['Trokielewicz', 'Mateusz', ''], ['Czajka', 'Adam', ''], ['Maciejewicz', 'Piotr', '']]","['iris recognition', 'ocular disease', 'biometrics', 'ophthalmology']"
4235,1808.05376,Silverio Mart\'inez-Fern\'andez,"Silverio Mart\'inez-Fern\'andez, Petar Jovanovic, Xavier Franch, and
  Andreas Jedlitschka",Towards Automated Data Integration in Software Analytics,"This is an author's accepted manuscript of a paper to be published by
  ACM in the 12th International Workshop on Real-Time Business Intelligence and
  Analytics (BIRTE@VLDB) 2018. The final authenticated version will be
  available through https://doi.org/10.1145/3242153.3242159",,10.1145/3242153.3242159,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software organizations want to be able to base their decisions on the latest
set of available data and the real-time analytics derived from them. In order
to support ""real-time enterprise"" for software organizations and provide
information transparency for diverse stakeholders, we integrate heterogeneous
data sources about software analytics, such as static code analysis, testing
results, issue tracking systems, network monitoring systems, etc. To deal with
the heterogeneity of the underlying data sources, we follow an ontology-based
data integration approach in this paper and define an ontology that captures
the semantics of relevant data for software analytics. Furthermore, we focus on
the integration of such data sources by proposing two approaches: a static and
a dynamic one. We first discuss the current static approach with a predefined
set of analytic views representing software quality factors and further
envision how this process could be automated in order to dynamically build
custom user analysis using a semi-automatic platform for managing the lifecycle
of analytics infrastructures.
","[{'version': 'v1', 'created': 'Thu, 16 Aug 2018 08:22:59 GMT'}]",2018-08-17,"[['Martínez-Fernández', 'Silverio', ''], ['Jovanovic', 'Petar', ''], ['Franch', 'Xavier', ''], ['Jedlitschka', 'Andreas', '']]","['Data integration', 'real-time enterprise', 'ontology', 'software analytics']"
4236,1807.06084,Mischa Schmidt,Mischa Schmidt and Christer {\AA}hlund,"Smart buildings as Cyber-Physical Systems: Data-driven predictive
  control strategies for energy efficiency",45 pages,"Renewable and Sustainable Energy Reviews Volume 90, July 2018",10.1016/j.rser.2018.04.013,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to its significant contribution to global energy usage and the associated
greenhouse gas emissions, existing building stock's energy efficiency must
improve. Predictive building control promises to contribute to that by
increasing the efficiency of building operations. Predictive control
complements other means to increase performance such as refurbishments as well
as modernizations of systems. This survey reviews recent works and
contextualizes these with the current state of the art of interrelated topics
in data handling, building automation, distributed control, and semantics. The
comprehensive overview leads to seven research questions guiding future
research directions.
","[{'version': 'v1', 'created': 'Fri, 13 Jul 2018 13:58:58 GMT'}]",2018-07-18,"[['Schmidt', 'Mischa', ''], ['Åhlund', 'Christer', '']]","['Energy Efficiency', 'Predictive Control', 'Cyber-Physical System', 'Existing Buildings']"
4237,1305.4064,Syed Muhammad Arsalan Bashir Mr.,Syed Muhammad Arsalan Bashir,"Font Acknowledgment and Character Extraction of Digital and Scanned
  Images","5 pages, 5 figures, 1 table, Published with International Journal of
  Computer Applications (IJCA)","International Journal of Computer Applications 70(8):1-5, May 2013",10.5120/11979-7850,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The font recognition and character extraction is of immense importance as
these are many scenarios where data are in such a form, which cannot be
processed like in image form or as a hard copy. So the procedure developed in
this paper is basically related to identifying the font (Times New Roman, Arial
and Comic Sans MS) and afterwards recovering the text using simple correlation
based method where the binary templates are correlated to the input image text
characters. All of this extraction is done in the presence of a little noise as
images may have noisy patterns due to photocopying. The significance of this
method exists in extraction of data from various monitoring (Surveillance)
camera footages or even more. The method is developed on Matlab\c{opyright}
which takes input image and recovers text and font information from it in a
text file.
","[{'version': 'v1', 'created': 'Fri, 17 May 2013 13:05:31 GMT'}]",2013-05-20,"[['Bashir', 'Syed Muhammad Arsalan', '']]","['Font recognition', 'character extraction', 'optical font']"
4238,1908.03716,Junyu Gao,"Junyu Gao, Qi Wang, Yuan Yuan","SCAR: Spatial-/Channel-wise Attention Regression Networks for Crowd
  Counting",accepted by Neurocomputing,,10.1016/j.neucom.2019.08.018,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, crowd counting is a hot topic in crowd analysis. Many CNN-based
counting algorithms attain good performance. However, these methods only focus
on the local appearance features of crowd scenes but ignore the large-range
pixel-wise contextual and crowd attention information. To remedy the above
problems, in this paper, we introduce the Spatial-/Channel-wise Attention
Models into the traditional Regression CNN to estimate the density map, which
is named as ""SCAR"". It consists of two modules, namely Spatial-wise Attention
Model (SAM) and Channel-wise Attention Model (CAM). The former can encode the
pixel-wise context of the entire image to more accurately predict density maps
at the pixel level. The latter attempts to extract more discriminative features
among different channels, which aids model to pay attention to the head region,
the core of crowd scenes. Intuitively, CAM alleviates the mistaken estimation
for background regions. Finally, two types of attention information and
traditional CNN's feature maps are integrated by a concatenation operation.
Furthermore, the extensive experiments are conducted on four popular datasets,
Shanghai Tech Part A/B, GCC, and UCF_CC_50 Dataset. The results show that the
proposed method achieves state-of-the-art results.
","[{'version': 'v1', 'created': 'Sat, 10 Aug 2019 09:20:18 GMT'}]",2019-08-13,"[['Gao', 'Junyu', ''], ['Wang', 'Qi', ''], ['Yuan', 'Yuan', '']]","['Crowd counting', 'crowd analysis', 'attention model', 'density mapestimation']"
4239,1807.02492,Keke Zhai,"Keke Zhai, Tania Banerjee, David Zwick, Jason Hackl and Sanjay Ranka",Dynamic Load Balancing for Compressible Multiphase Turbulence,"This paper has been accepted by ACM International Conference on
  Supercomputing (ICS) 2018",,10.1145/3205289.3205304,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CMT-nek is a new scientific application for performing high fidelity
predictive simulations of particle laden explosively dispersed turbulent flows.
CMT-nek involves detailed simulations, is compute intensive and is targeted to
be deployed on exascale platforms. The moving particles are the main source of
load imbalance as the application is executed on parallel processors. In a
demonstration problem, all the particles are initially in a closed container
until a detonation occurs and the particles move apart. If all processors get
an equal share of the fluid domain, then only some of the processors get
sections of the domain that are initially laden with particles, leading to
disparate load on the processors. In order to eliminate load imbalance in
different processors and to speedup the makespan, we present different load
balancing algorithms for CMT-nek on large scale multi-core platforms consisting
of hundred of thousands of cores. The detailed process of the load balancing
algorithms are presented. The performance of the different load balancing
algorithms are compared and the associated overheads are analyzed. Evaluations
on the application with and without load balancing are conducted and these show
that with load balancing, simulation time becomes faster by a factor of up to
$9.97$.
","[{'version': 'v1', 'created': 'Fri, 6 Jul 2018 17:05:44 GMT'}]",2018-07-09,"[['Zhai', 'Keke', ''], ['Banerjee', 'Tania', ''], ['Zwick', 'David', ''], ['Hackl', 'Jason', ''], ['Ranka', 'Sanjay', '']]","['Dynamic Load Balancing', 'Map', 'Remap', 'Parallel Computing']"
4240,0803.2174,Mirela Damian,"Mirela Damian, Saurav Pandit and Sriram Pemmaraju",Local Approximation Schemes for Topology Control,"11 pages, 6 figures","Proceedings of the 25th ACM Symposium on Principles of Distributed
  Computing, pages 208-218, July 2006",,,cs.DS cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a distributed algorithm on wireless ad-hoc networks that
runs in polylogarithmic number of rounds in the size of the network and
constructs a linear size, lightweight, (1+\epsilon)-spanner for any given
\epsilon > 0. A wireless network is modeled by a d-dimensional \alpha-quasi
unit ball graph (\alpha-UBG), which is a higher dimensional generalization of
the standard unit disk graph (UDG) model. The d-dimensional \alpha-UBG model
goes beyond the unrealistic ``flat world'' assumption of UDGs and also takes
into account transmission errors, fading signal strength, and physical
obstructions. The main result in the paper is this: for any fixed \epsilon > 0,
0 < \alpha \le 1, and d \ge 2, there is a distributed algorithm running in
O(\log n \log^* n) communication rounds on an n-node, d-dimensional \alpha-UBG
G that computes a (1+\epsilon)-spanner G' of G with maximum degree \Delta(G') =
O(1) and total weight w(G') = O(w(MST(G)). This result is motivated by the
topology control problem in wireless ad-hoc networks and improves on existing
topology control algorithms along several dimensions. The technical
contributions of the paper include a new, sequential, greedy algorithm with
relaxed edge ordering and lazy updating, and clustering techniques for
filtering out unnecessary edges.
","[{'version': 'v1', 'created': 'Fri, 14 Mar 2008 14:37:12 GMT'}]",2008-03-17,"[['Damian', 'Mirela', ''], ['Pandit', 'Saurav', ''], ['Pemmaraju', 'Sriram', '']]","['Spanners', 'Topology control', 'Wireless ad-hocnetworks', 'Unit ball graphs']"
4241,1510.04780,Kan Ren,"Chenhao Zhu, Kan Ren, Xuan Liu, Haofen Wang, Yiding Tian and Yong Yu","A Graph Traversal Based Approach to Answer Non-Aggregation Questions
  Over DBpedia","In the proceedings of the 5th Joint International Semantic Technology
  (JIST2015): https://link.springer.com/chapter/10.1007/978-3-319-31676-5_16",,10.1007/978-3-319-31676-5_16,,cs.CL cs.IR,http://creativecommons.org/publicdomain/zero/1.0/,"  We present a question answering system over DBpedia, filling the gap between
user information needs expressed in natural language and a structured query
interface expressed in SPARQL over the underlying knowledge base (KB). Given
the KB, our goal is to comprehend a natural language query and provide
corresponding accurate answers. Focusing on solving the non-aggregation
questions, in this paper, we construct a subgraph of the knowledge base from
the detected entities and propose a graph traversal method to solve both the
semantic item mapping problem and the disambiguation problem in a joint way.
Compared with existing work, we simplify the process of query intention
understanding and pay more attention to the answer path ranking. We evaluate
our method on a non-aggregation question dataset and further on a complete
dataset. Experimental results show that our method achieves best performance
compared with several state-of-the-art systems.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2015 05:35:59 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Aug 2018 03:08:54 GMT'}]",2018-08-17,"[['Zhu', 'Chenhao', ''], ['Ren', 'Kan', ''], ['Liu', 'Xuan', ''], ['Wang', 'Haofen', ''], ['Tian', 'Yiding', ''], ['Yu', 'Yong', '']]","['Question Answering', 'Non-aggregation Questions', 'LinkedData', 'Graph Traversal', 'Path Ranking']"
4242,1402.6787,Austin Benson,"Austin R. Benson, Carlos Riquelme, Sven Schmit",Learning multifractal structure in large networks,,"Proceedings of the 20th ACM SIGKDD international conference on
  Knowledge discovery and data mining (KDD), 2014",10.1145/2623330.2623718,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generating random graphs to model networks has a rich history. In this paper,
we analyze and improve upon the multifractal network generator (MFNG)
introduced by Palla et al. We provide a new result on the probability of
subgraphs existing in graphs generated with MFNG. From this result it follows
that we can quickly compute moments of an important set of graph properties,
such as the expected number of edges, stars, and cliques. Specifically, we show
how to compute these moments in time complexity independent of the size of the
graph and the number of recursive levels in the generative model. We leverage
this theory to a new method of moments algorithm for fitting large networks to
MFNG. Empirically, this new approach effectively simulates properties of
several social and information networks. In terms of matching subgraph counts,
our method outperforms similar algorithms used with the Stochastic Kronecker
Graph model. Furthermore, we present a fast approximation algorithm to generate
graph instances following the multi- fractal structure. The approximation
scheme is an improvement over previous methods, which ran in time complexity
quadratic in the number of vertices. Combined, our method of moments and fast
sampling scheme provide the first scalable framework for effectively modeling
large networks with MFNG.
","[{'version': 'v1', 'created': 'Thu, 27 Feb 2014 04:24:40 GMT'}]",2018-01-08,"[['Benson', 'Austin R.', ''], ['Riquelme', 'Carlos', ''], ['Schmit', 'Sven', '']]","['graph mining', 'real-world networks', 'multifractal', 'method of moments', 'graph sampling', 'stochastic kronecker graph', 'random graphs', 'modeling']"
4243,1612.01459,Qiuwei Li,Qiuwei Li and Gongguo Tang,"Approximate Support Recovery of Atomic Line Spectral Estimation: A Tale
  of Resolution and Precision",,,10.1016/j.acha.2018.09.005,,cs.IT math.IT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work investigates the parameter estimation performance of
super-resolution line spectral estimation using atomic norm minimization. The
focus is on analyzing the algorithm's accuracy of inferring the frequencies and
complex magnitudes from noisy observations. When the Signal-to-Noise Ratio is
reasonably high and the true frequencies are separated by $O(\frac{1}{n})$, the
atomic norm estimator is shown to localize the correct number of frequencies,
each within a neighborhood of size $O(\sqrt{{\log n}/{n^3}} \sigma)$ of one of
the true frequencies. Here $n$ is half the number of temporal samples and
$\sigma^2$ is the Gaussian noise variance. The analysis is based on a
primal-dual witness construction procedure. The obtained error bound matches
the Cram\'er-Rao lower bound up to a logarithmic factor. The relationship
between resolution (separation of frequencies) and precision or accuracy of the
estimator is highlighted. Our analysis also reveals that the atomic norm
minimization can be viewed as a convex way to solve a $\ell_1$-norm
regularized, nonlinear and nonconvex least-squares problem to global
optimality.
","[{'version': 'v1', 'created': 'Mon, 5 Dec 2016 18:22:09 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Sep 2018 15:17:54 GMT'}, {'version': 'v3', 'created': 'Tue, 23 Oct 2018 04:33:56 GMT'}]",2018-10-24,"[['Li', 'Qiuwei', ''], ['Tang', 'Gongguo', '']]","['atomic norm', 'line spectral estimation', 'primal-dual witness construction', 'super-resolution', 'support recovery']"
4244,1904.01723,Haozhen Zhao,"Fusheng Wei, Han Qin, Shi Ye, Haozhen Zhao","Empirical Study of Deep Learning for Text Classification in Legal
  Document Review",2018 IEEE International Conference on Big Data (Big Data),,10.1109/BigData.2018.8622157,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predictive coding has been widely used in legal matters to find relevant or
privileged documents in large sets of electronically stored information. It
saves the time and cost significantly. Logistic Regression (LR) and Support
Vector Machines (SVM) are two popular machine learning algorithms used in
predictive coding. Recently, deep learning received a lot of attentions in many
industries. This paper reports our preliminary studies in using deep learning
in legal document review. Specifically, we conducted experiments to compare
deep learning results with results obtained using a SVM algorithm on the four
datasets of real legal matters. Our results showed that CNN performed better
with larger volume of training dataset and should be a fit method in the text
classification in legal industry.
","[{'version': 'v1', 'created': 'Wed, 3 Apr 2019 01:00:41 GMT'}]",2019-04-04,"[['Wei', 'Fusheng', ''], ['Qin', 'Han', ''], ['Ye', 'Shi', ''], ['Zhao', 'Haozhen', '']]","['text classification', 'deep learning', 'CNN', 'legal']"
4245,1901.06153,Fabio Caraffini,Fabio Caraffini and Anna V. Kononova and David Corne,Infeasibility and structural bias in Differential Evolution,"Journal paper, 30 pages plus further extended results made available
  online at www.cse.dmu.ac.uk/~fcaraf00/BIAS/BIAS_DE_EXTENDED_RESULTS.pdf",,10.1016/j.ins.2019.05.019,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper thoroughly investigates a range of popular DE configurations to
identify components responsible for the emergence of structural bias - recently
identified tendency of the algorithm to prefer some regions of the search space
for reasons directly unrelated to the objective function values. Such tendency
was already studied in GA and PSO where a connection was established between
the strength of structural bias and population sizes and potential weaknesses
of these algorithms was highlighted. For DE, this study goes further and
extends the range of aspects that can contribute to presence of structural bias
by including algorithmic component which is usually overlooked - constraint
handling technique. A wide range of DE configurations were subjected to the
protocol for testing for bias. Results suggest that triggering mechanism for
the bias in DE differs to the one previously found for GA and PSO - no clear
dependency on population size exists. Setting of DE parameters is based on a
separate study which on its own leads to interesting directions of new
research. Overall, DE turned out to be robust against structural bias - only
DE/current-to-best/1/bin is clearly biased but this effect is mitigated by the
use of penalty constraint handling technique.
","[{'version': 'v1', 'created': 'Fri, 18 Jan 2019 09:53:43 GMT'}]",2021-05-25,"[['Caraffini', 'Fabio', ''], ['Kononova', 'Anna V.', ''], ['Corne', 'David', '']]","['structural bias', 'algorithmic design', 'differential evolution', 'population-based algorithms', 'optimisation']"
4246,1901.06081,Sheng He,Sheng He and Lambert Schomaker,"DeepOtsu: Document Enhancement and Binarization using Iterative Deep
  Learning",Accepted by Pattern Recognition,,10.1016/j.patcog.2019.01.025,,cs.CV,http://creativecommons.org/publicdomain/zero/1.0/,"  This paper presents a novel iterative deep learning framework and apply it
for document enhancement and binarization. Unlike the traditional methods which
predict the binary label of each pixel on the input image, we train the neural
network to learn the degradations in document images and produce the uniform
images of the degraded input images, which allows the network to refine the
output iteratively. Two different iterative methods have been studied in this
paper: recurrent refinement (RR) which uses the same trained neural network in
each iteration for document enhancement and stacked refinement (SR) which uses
a stack of different neural networks for iterative output refinement. Given the
learned uniform and enhanced image, the binarization map can be easy to obtain
by a global or local threshold. The experimental results on several public
benchmark data sets show that our proposed methods provide a new clean version
of the degraded image which is suitable for visualization and promising results
of binarization using the global Otsu's threshold based on the enhanced images
learned iteratively by the neural network.
","[{'version': 'v1', 'created': 'Fri, 18 Jan 2019 04:23:51 GMT'}]",2019-01-21,"[['He', 'Sheng', ''], ['Schomaker', 'Lambert', '']]","['Document enhancement and binarization', 'Convolutional neuralnetworks', 'Iterative deep learning', 'Recurrent refinement']"
4247,2102.07564,Giulia Preti,"Giulia Preti, Gianmarco De Francisci Morales and Francesco Bonchi",STruD: Truss Decomposition of Simplicial Complexes,,Proceedings of The Web Conference 2021,10.1145/3442381.3450073,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  A simplicial complex is a generalization of a graph: a collection of n-ary
relationships (instead of binary as the edges of a graph), named simplices. In
this paper, we develop a new tool to study the structure of simplicial
complexes: we generalize the graph notion of truss decomposition to complexes,
and show that this more powerful representation gives rise to different
properties compared to the graph-based one. This power, however, comes with
important computational challenges derived from the combinatorial explosion
caused by the downward closure property of complexes. Drawing upon ideas from
itemset mining and similarity search, we design a memory-aware algorithm,
dubbed STruD, which is able to efficiently compute the truss decomposition of a
simplicial complex. STruD adapts its behavior to the amount of available memory
by storing intermediate data in a compact way. We then devise a variant that
computes directly the n simplices of maximum trussness. By applying STruD to
several datasets, we prove its scalability, and provide an analysis of their
structure. Finally, we show that the truss decomposition can be seen as a
filtration, and as such it can be used to study the persistent homology of a
dataset, a method for computing topological features at different spatial
resolutions, prominent in Topological Data Analysis.
","[{'version': 'v1', 'created': 'Mon, 15 Feb 2021 14:04:28 GMT'}]",2021-02-16,"[['Preti', 'Giulia', ''], ['Morales', 'Gianmarco De Francisci', ''], ['Bonchi', 'Francesco', '']]","['Graph mining', 'truss decomposition', 'simplicial complex', 'higherorder', 'topological data analysis']"
4248,1307.4171,Revati Shriram,"Revati Shriram, M. Sundhararajan, Nivedita Daimiwal","Human Brain Mapping based on COLD Signal Hemodynamic Response and
  Electrical Neuroimaging","5 pages. arXiv admin note: substantial text overlap with
  arXiv:1212.3786",,10.5120/10464-5175,,cs.ET q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To understand Working of Human Brain measurements related to the brain
function are required. These measurements should be possibly non-invasive.
Brain should be disturbed as less as possible during the measurement.
Integration of various modalities plays a vital role in understanding the
cognitive and the behavioral changes in the human brain. It is an important
source of converging evidence about specific aspects of neural functions and
dysfunctions under certain pathological conditions. Focal changes in cortical
blood flow are tightly coupled with the changes in neuronal activity. This
constitutes the option to map the hemodynamic response and infer principles of
the cortical processing, even of complex tasks. The very high temporal
resolution of EEG and good spatial resolution by NIRS make this concurrent
measurement unique to study the spatio-temporal dynamics of large scale
neuronal networks in the human brain. Such integration of two techniques will
help to overcome the limitations of a specific method. Such as insensitivity of
electroencephalogram (EEG) to unsynchronized neural events or lack of near
infrared spectroscopy (NIRS) to low metabolic demand. A combination of EEG and
NIRS will be more informative than the two separate analyses in both
modalities.
","[{'version': 'v1', 'created': 'Tue, 16 Jul 2013 06:06:03 GMT'}]",2015-06-16,"[['Shriram', 'Revati', ''], ['Sundhararajan', 'M.', ''], ['Daimiwal', 'Nivedita', '']]","['EEG', 'NIRS', 'Brain Mapping', 'Imaging', 'ICA', 'SVM', 'Spectral Analysis']"
4249,1802.04742,Thomas Vandal,"Thomas Vandal, Evan Kodra, Jennifer Dy, Sangram Ganguly, Ramakrishna
  Nemani, Auroop R. Ganguly","Quantifying Uncertainty in Discrete-Continuous and Skewed Data with
  Bayesian Deep Learning",10 Pages,"The 24th ACM SIGKDD International Conference on Knowledge
  Discovery & Data Mining, August 19--23, 2018, London, United Kingdom",10.1145/3219819.3219996,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep Learning (DL) methods have been transforming computer vision with
innovative adaptations to other domains including climate change. For DL to
pervade Science and Engineering (S&E) applications where risk management is a
core component, well-characterized uncertainty estimates must accompany
predictions. However, S&E observations and model-simulations often follow
heavily skewed distributions and are not well modeled with DL approaches, since
they usually optimize a Gaussian, or Euclidean, likelihood loss. Recent
developments in Bayesian Deep Learning (BDL), which attempts to capture
uncertainties from noisy observations, aleatoric, and from unknown model
parameters, epistemic, provide us a foundation. Here we present a
discrete-continuous BDL model with Gaussian and lognormal likelihoods for
uncertainty quantification (UQ). We demonstrate the approach by developing UQ
estimates on `DeepSD', a super-resolution based DL model for Statistical
Downscaling (SD) in climate applied to precipitation, which follows an
extremely skewed distribution. We find that the discrete-continuous models
outperform a basic Gaussian distribution in terms of predictive accuracy and
uncertainty calibration. Furthermore, we find that the lognormal distribution,
which can handle skewed distributions, produces quality uncertainty estimates
at the extremes. Such results may be important across S&E, as well as other
domains such as finance and economics, where extremes are often of significant
interest. Furthermore, to our knowledge, this is the first UQ model in SD where
both aleatoric and epistemic uncertainties are characterized.
","[{'version': 'v1', 'created': 'Tue, 13 Feb 2018 17:07:13 GMT'}, {'version': 'v2', 'created': 'Thu, 24 May 2018 16:35:23 GMT'}]",2018-05-25,"[['Vandal', 'Thomas', ''], ['Kodra', 'Evan', ''], ['Dy', 'Jennifer', ''], ['Ganguly', 'Sangram', ''], ['Nemani', 'Ramakrishna', ''], ['Ganguly', 'Auroop R.', '']]","['Bayesian Deep Learning', 'Uncertainty Quantification', 'Climate Downscaling', 'Super-resolution', 'Precipitation Estimation']"
4250,1901.01541,Andrea Arcuri,Andrea Arcuri,Many Independent Objective (MIO) Algorithm for Test Suite Generation,,"In: Menzies T., Petke J. (eds) Search Based Software Engineering.
  SSBSE 2017. Lecture Notes in Computer Science, vol 10452. Springer, Cham",10.1007/978-3-319-66299-2_1,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatically generating test suites is intrinsically a multi-objective
problem, as any of the testing targets (e.g, statements to execute or mutants
to kill) is an objective on its own. Test suite generation has peculiarities
that are quite different from other more regular optimisation problems. For
example, given an existing test suite, one can add more tests to cover the
remaining objectives. One would like the smallest number of small tests to
cover as many objectives as possible, but that is a secondary goal compared to
covering those targets in the first place. Furthermore, the amount of
objectives in software testing can quickly become unmanageable, in the order of
(tens/hundreds of) thousands, especially for system testing of industrial size
systems. Traditional multi-objective optimisation algorithms can already start
to struggle with just four or five objectives to optimize. To overcome these
issues, different techniques have been proposed, like for example the Whole
Test Suite (WTS) approach and the Many-Objective Sorting Algorithm (MOSA).
However, those techniques might not scale well to very large numbers of
objectives and limited search budgets (a typical case in system testing). In
this paper, we propose a novel algorithm, called Many Independent Objective
(MIO) algorithm. This algorithm is designed and tailored based on the specific
properties of test suite generation. An empirical study, on a set of artificial
and actual software, shows that the MIO algorithm can achieve higher coverage
compared to WTS and MOSA, as it can better exploit the peculiarities of test
suite generation.
","[{'version': 'v1', 'created': 'Sun, 6 Jan 2019 13:35:02 GMT'}]",2019-01-08,"[['Arcuri', 'Andrea', '']]","['test generation', 'SBSE', 'SBST', 'MOO']"
4251,1405.4095,Xuzhen Zhu,"Xuzhen Zhu, Hui Tian, Shimin Cai",Personalized recommendation with corrected similarity,"13 pages, 2 figures, 2 tables. arXiv admin note: text overlap with
  arXiv:0805.4127 by other authors",,10.1088/1742-5468/2014/07/P07004,,cs.IR cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Personalized recommendation attracts a surge of interdisciplinary researches.
Especially, similarity based methods in applications of real recommendation
systems achieve great success. However, the computations of similarities are
overestimated or underestimated outstandingly due to the defective strategy of
unidirectional similarity estimation. In this paper, we solve this drawback by
leveraging mutual correction of forward and backward similarity estimations,
and propose a new personalized recommendation index, i.e., corrected similarity
based inference (CSI). Through extensive experiments on four benchmark
datasets, the results show a greater improvement of CSI in comparison with
these mainstream baselines. And the detailed analysis is presented to unveil
and understand the origin of such difference between CSI and mainstream
indices.
","[{'version': 'v1', 'created': 'Fri, 16 May 2014 08:50:59 GMT'}]",2014-07-30,"[['Zhu', 'Xuzhen', ''], ['Tian', 'Hui', ''], ['Cai', 'Shimin', '']]","['Personalized recommendation', 'user-object network', 'corrected similarity']"
4252,1101.0250,Jaydip Sen,Jaydip Sen,"An Adaptive and Multi-Service Routing Protocol for Wireless Sensor
  Networks","6 pages, 8 figures. 16th IEEE Asia-Pacific Conference on
  Communications (APCC) 2010, Auckland, New Zealand, October 31 - November 3,
  2010",,10.1109/APCC.2010.5679779,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless Sensor Networks (WSNs) are highly distributed networks consisting of
a large number of tiny, low-cost, light-weight wireless nodes deployed to
monitor an environment or a system. Each node in a WSN consists of three
subsystems: the sensor subsystem which senses the environment, the processing
subsystem which performs local computations on the sensed data, and the
communication subsystem which is responsible for message exchange with
neighboring sensor nodes. While an individual sensor node has limited sensing
region, processing power, and energy, networking a large number of sensor nodes
give rise to a robust, reliable, and accurate sensor network covering a wide
region. Thus, routing in WSNs is a very important issue. This paper presents a
query-based routing protocol for a WSN that provides different levels of
Quality of Service (QoS): energy-efficiency, reliability, low latency and
fault-tolerance-under different application scenarios. The algorithm has low
computational complexity but can dynamically guarantee different QoS support
depending on the requirement of the applications. The novelty of the proposed
algorithm is its ability to provide multiple QoS support without
reconfiguration and redeployment of the sensor nodes. The algorithm is
implemented in network simulator ns-2 and its performance has been evaluated.
The results show that the algorithm is more efficient than some of the
currently existing routing algorithms for WSNs.
","[{'version': 'v1', 'created': 'Fri, 31 Dec 2010 12:49:32 GMT'}]",2016-11-15,"[['Sen', 'Jaydip', '']]","['wireless sensor networks', 'routing', 'quality of service', 'energy-efficiency', 'reliability', 'latency']"
4253,1901.11139,Matthew Kirchner,Matthew R. Kirchner,"A Level Set Approach to Online Sensing and Trajectory Optimization with
  Time Delays","Updated formatting to comply with publications guidelines. Corrected
  some minor typos. To appear in the proceedings of the 10th IFAC Symposium on
  Intelligent Autonomous Vehicles","IFAC PapersOnLine, volume 52, issue 8, pp. 301-306, 2019",10.1016/j.ifacol.2019.08.087,,cs.SY eess.SP math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Presented is a method to compute certain classes of Hamilton-Jacobi equations
that result from optimal control and trajectory generation problems with time
delays. Many robotic control and trajectory problems have limited information
of the operating environment a priori and must continually perform online
trajectory optimization in real time after collecting measurements. The sensing
and optimization can induce a significant time delay, and must be accounted for
when computing the trajectory. This paper utilizes the generalized Hopf
formula, which avoids the exponential dimensional scaling typical of other
numerical methods for computing solutions to the Hamilton-Jacobi equation. We
present as an example a robot that incrementally predicts a communication
channel from measurements as it travels. As part of this example, we introduce
a seemingly new generalization of a non-parametric formulation of robotic
communication channel estimation. New communication measurements are used to
improve the channel estimate and online trajectory optimization with time-delay
compensation is performed.
","[{'version': 'v1', 'created': 'Wed, 30 Jan 2019 23:10:51 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Jun 2019 17:52:43 GMT'}]",2019-10-22,"[['Kirchner', 'Matthew R.', '']]","['Time Delay Systems', 'Hamilton–Jacobi Equation', 'Generalized Hopf Formula', 'Viscosity Solution', 'Optimal Control', 'Communication Seeking Robotics']"
4254,1706.04741,Irina Asavoae,"Irina Mariuca Asavoae and Hoang Nga Nguyen and Markus Roggenbach and
  Siraj Ahmed Shaikh","Software Model Checking: A Promising Approach to Verify Mobile App
  Security","2 pages, 2 figures, FTFJP'17",,10.1145/3103111.3104040,,cs.SE cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this position paper we advocate software model checking as a technique
suitable for security analysis of mobile apps. Our recommendation is based on
promising results that we achieved on analysing app collusion in the context of
the Android operating system. Broadly speaking, app collusion appears when, in
performing a threat, several apps are working together, i.e., they exchange
information which they could not obtain on their own. In this context, we
developed the Kandroid tool, which provides an encoding of the Android/Smali
code semantics within the K framework. Kandroid allows for software model
checking of Android APK files. Though our experience so far is limited to
collusion, we believe the approach to be applicable to further security
properties as well as other mobile operating systems.
","[{'version': 'v1', 'created': 'Thu, 15 Jun 2017 05:12:41 GMT'}]",2017-06-16,"[['Asavoae', 'Irina Mariuca', ''], ['Nguyen', 'Hoang Nga', ''], ['Roggenbach', 'Markus', ''], ['Shaikh', 'Siraj Ahmed', '']]","['Sofware Model Checking', 'Android', 'Collusion', 'MobileSecurity']"
4255,1307.8322,EPTCS,"Ryma Abassi (University of Carthage, sup'com), Sihem Guemara El Fatmi
  (University of Carthage, sup'com)",Delegation Management Modeling in a Security Policy based Environment,"In Proceedings SCSS 2012, arXiv:1307.8029","EPTCS 122, 2013, pp. 85-95",10.4204/EPTCS.122.8,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security Policies (SP) constitute the core of communication networks
protection infrastructures. It offers a set of rules allowing differentiating
between legitimate actions and prohibited ones and consequently, associates
each entity in the network with a set of permissions and privileges. Moreover,
in today's technological society and to allow applications perpetuity,
communication networks must support the collaboration between entities to face
up any unavailability or flinching. This collaboration must be governed by
security mechanisms according to the established permissions and privileges.
Delegation is a common practice that is used to simplify the sharing of
responsibilities and privileges. The delegation process in a SP environment can
be implanted through the use of adequate formalisms and modeling. The main
contribution of this paper is then, the proposition of a generic and formal
modeling of delegation process. This modeling is based on three steps composing
the delegation life cycle: negotiation used for delegation initiation,
verification of the SP respect while delegating and revocation of an
established delegation. Hence, we propose to deal with each step according to
the main delegation characteristics and extend them by some new specificities.
","[{'version': 'v1', 'created': 'Wed, 31 Jul 2013 13:54:12 GMT'}]",2013-08-01,"[['Abassi', 'Ryma', '', ""University of Carthage, sup'com""], ['Fatmi', 'Sihem Guemara El', '', ""University of Carthage, sup'com""]]","['security policy', 'delegation', 'revocation', 'multiplicity', 'affiliation', 'monotonicity']"
4256,1612.09087,Farshad Roohbakhshan,Farshad Roohbakhshan and Roger A. Sauer,"Efficient isogeometric thin shell formulations for soft biological
  materials","Typos are removed. Remark 3.4 is added. Eq. (18) in the previous
  version is removed. Thus, the equations get renumbered. Example 5.5 is
  updated. Minor typos in Eqs. (17), (80), (145) and (146), are corrected. They
  do not affect the results",Biomech Model Mechanobiol (2017) 16:1569,10.1007/s10237-017-0906-6,,cs.CE cond-mat.soft,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents three different constitutive approaches to model thin
rotation-free shells based on the Kirchhoff-Love hypothesis. One approach is
based on numerical integration through the shell thickness while the other two
approaches do not need any numerical integration and so they are
computationally more efficient. The formulation is designed for large
deformations and allows for geometrical and material nonlinearities, which
makes it very suitable for the modeling of soft tissues. Furthermore, six
different isotropic and anisotropic material models, which are commonly used to
model soft biological materials, are examined for the three proposed
constitutive approaches. Following an isogeometric approach, NURBS-based finite
elements are used for the discretization of the shell surface. Several
numerical examples are investigated to demonstrate the capabilities of the
formulation. Those include the contact simulation during balloon angioplasty.
","[{'version': 'v1', 'created': 'Thu, 29 Dec 2016 10:02:43 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Oct 2017 14:33:41 GMT'}]",2017-10-25,"[['Roohbakhshan', 'Farshad', ''], ['Sauer', 'Roger A.', '']]","['Angioplasty', 'contact modeling', 'isogeometric analysis', 'Kirchhoff–Love shell', 'softbiological materials', 'thin rotation-free shells']"
4257,1911.09077,Alberto Ordonez Pereira,"Alberto Ord\'o\~nez, Gonzalo Navarro and Nieves R. Brisaboa",Grammar Compressed Sequences with Rank/Select Support,"This research has received funding from the European Union's Horizon
  2020 research and innovation programme under the Marie Sk{\l}odowska-Curie
  Actions H2020-MSCA-RISE-2015 BIRDS GA No. 690941","Journal of Discrete Algorithms 43, pp. 54-71 (2017)",10.1016/j.jda.2016.10.001,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sequence representations supporting not only direct access to their symbols,
but also rank/select operations, are a fundamental building block in many
compressed data structures. Several recent applications need to represent
highly repetitive sequences, and classical statistical compression proves
ineffective. We introduce, instead, grammar-based representations for
repetitive sequences, which use up to 6% of the space needed by statistically
compressed representations, and support direct access and rank/select
operations within tens of microseconds. We demonstrate the impact of our
structures in text indexing applications.
","[{'version': 'v1', 'created': 'Wed, 20 Nov 2019 18:29:30 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Nov 2019 21:32:34 GMT'}]",2019-11-25,"[['Ordóñez', 'Alberto', ''], ['Navarro', 'Gonzalo', ''], ['Brisaboa', 'Nieves R.', '']]","['Grammar compression', 'repetitive sequences', 'text indexing']"
4258,1702.02263,Emilio Ferrara,"Adam Badawy, Emilio Ferrara",The Rise of Jihadist Propaganda on Social Networks,"22 pages, 9 figures, 7 tables","Journal of Computational Social Science, 2018",10.1007/s42001-018-0015-z,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using a dataset of over 1.9 million messages posted on Twitter by about
25,000 ISIS members, we explore how ISIS makes use of social media to spread
its propaganda and to recruit militants from the Arab world and across the
globe. By distinguishing between violence-driven, theological, and sectarian
content, we trace the connection between online rhetoric and key events on the
ground. To the best of our knowledge, ours is one of the first studies to focus
on Arabic content, while most literature focuses on English content. Our
findings yield new important insights about how social media is used by radical
militant groups to target the Arab-speaking world, and reveal important
patterns in their propaganda efforts.
","[{'version': 'v1', 'created': 'Wed, 8 Feb 2017 03:28:55 GMT'}]",2018-06-21,"[['Badawy', 'Adam', ''], ['Ferrara', 'Emilio', '']]","['Computational Social Science', 'Social Media', 'Twitter', 'ISIS', 'Islamic Radicalization']"
4259,1005.0092,Andrei Sukhov M,"E.S. Sagatov, A.M. Sukhov, P. Calyam","Influence of distortions of key frames on video transfer in wireless
  networks","6 pages, 4 figures, 2 Tables",,10.1109/ISVC.2010.5656258,,cs.NI cs.MM,http://creativecommons.org/licenses/by/3.0/,"  In this paper it is shown that for substantial increase of video quality in
wireless network it is necessary to execute two obligatory points on
modernization of the communication scheme. The player on the received part
should throw back automatically duplicated RTP packets, server of streaming
video should duplicate the packets containing the information of key frames.
Coefficients of the mathematical model describing video quality in wireless
network have been found for WiFi and 3G standards and codecs MPEG-2 and MPEG-4
(DivX). The special experimental technique which has allowed collecting and
processing the data has been developed for calculation of values of factors.
","[{'version': 'v1', 'created': 'Sat, 1 May 2010 17:15:36 GMT'}]",2017-02-20,"[['Sagatov', 'E. S.', ''], ['Sukhov', 'A. M.', ''], ['Calyam', 'P.', '']]","['VVoIP', 'wireless networks', 'streaming video']"
4260,1903.02810,Dorothee Henke,Christoph Buchheim and Dorothee Henke,"The robust bilevel continuous knapsack problem with uncertain
  coefficients in the follower's objective","An extended version of Section 8 of v2 can be found at
  arXiv:2108.12303","Journal of Global Optimization 83(4), 803-824 (2022)",10.1007/s10898-021-01117-9,,cs.DS cs.DM math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a bilevel continuous knapsack problem where the leader controls
the capacity of the knapsack and the follower chooses an optimal packing
according to his own profits, which may differ from those of the leader. To
this bilevel problem, we add uncertainty in a natural way, assuming that the
leader does not have full knowledge about the follower's problem. More
precisely, adopting the robust optimization approach and assuming that the
follower's profits belong to a given uncertainty set, our aim is to compute a
solution that optimizes the worst-case follower's reaction from the leader's
perspective. By investigating the complexity of this problem with respect to
different types of uncertainty sets, we make first steps towards better
understanding the combination of bilevel optimization and robust combinatorial
optimization. We show that the problem can be solved in polynomial time for
both discrete and interval uncertainty, but that the same problem becomes
NP-hard when each coefficient can independently assume only a finite number of
values. In particular, this demonstrates that replacing uncertainty sets by
their convex hulls may change the problem significantly, in contrast to the
situation in classical single-level robust optimization. For general polytopal
uncertainty, the problem again turns out to be NP-hard, and the same is true
for ellipsoidal uncertainty even in the uncorrelated case. All presented
hardness results already apply to the evaluation of the leader's objective
function.
","[{'version': 'v1', 'created': 'Thu, 7 Mar 2019 10:15:54 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Mar 2020 16:09:41 GMT'}, {'version': 'v3', 'created': 'Thu, 29 Jul 2021 12:34:23 GMT'}, {'version': 'v4', 'created': 'Tue, 11 Jan 2022 17:02:47 GMT'}]",2022-07-19,"[['Buchheim', 'Christoph', ''], ['Henke', 'Dorothee', '']]","['bilevel optimization', 'robust optimization', 'interval order']"
4261,0801.3702,Sharon Betz,"Tim Holliday, Andrea J. Goldsmith, and H. Vincent Poor","Joint source and channel coding for MIMO systems: Is it better to be
  robust or quick?","To appear in the IEEE Transactions on Information Theory, Vol. 54,
  No. 4, April 2008","IEEE Transactions on Information Theory, Vol. 54, No. 4, April
  2008",10.1109/TIT.2008.917725,,cs.IT math.IT,,"  We develop a framework to optimize the tradeoff between diversity,
multiplexing, and delay in MIMO systems to minimize end-to-end distortion. We
first focus on the diversity-multiplexing tradeoff in MIMO systems, and develop
analytical results to minimize distortion of a vector quantizer concatenated
with a space-time MIMO channel code. In the high SNR regime we obtain a
closed-form expression for the end-to-end distortion as a function of the
optimal point on the diversity-multiplexing tradeoff curve. For large but
finite SNR we find this optimal point via convex optimization. We then consider
MIMO systems using ARQ retransmission to provide additional diversity at the
expense of delay. For sources without a delay constraint, distortion is
minimized by maximizing the ARQ window size. This results in an ARQ-enhanced
multiplexing-diversity tradeoff region, with distortion minimized over this
region in the same manner as without ARQ. Under a source delay constraint the
problem formulation changes to account for delay distortion associated with
random message arrival and random ARQ completion times. We use a dynamic
programming formulation to capture the channel diversity-multiplexing tradeoff
at finite SNR as well as the random arrival and retransmission dynamics; we
solve for the optimal multiplexing-diversity-delay tradeoff to minimize
end-to-end distortion associated with the source encoder, channel, and ARQ
retransmissions. Our results show that a delay-sensitive system should adapt
its operating point on the diversity-multiplexing-delay tradeoff region to the
system dynamics. We provide numerical results that demonstrate significant
performance gains of this adaptive policy over a static allocation of
diversity/multiplexing in the channel code and a static ARQ window size.
","[{'version': 'v1', 'created': 'Thu, 24 Jan 2008 04:13:48 GMT'}]",2008-04-09,"[['Holliday', 'Tim', ''], ['Goldsmith', 'Andrea J.', ''], ['Poor', 'H. Vincent', '']]","['ARQ', 'diversity-multiplexing-delay tradeoff', 'joint source-channel coding', 'MIMO channels']"
4262,1707.06257,Subhash Kak,Subhash Kak,The Limits to Machine Consciousness,"14 pages, 8 figures","Journal of Artificial Intelligence and Consciousness, August 2021",10.1142/s2705078521500193,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is generally accepted that machines can replicate cognitive tasks
performed by conscious agents as long as they are not based on the capacity of
awareness. We consider several views on the nature of subjective awareness,
which is fundamental for self-reflection and review, and present reasons why
this property is not computable. We argue that consciousness is more than an
epiphenomenon and assuming it to be a separate category is consistent with both
quantum mechanics and cognitive science. We speak of two kinds of
consciousness, little-C and big-C, and discuss the significance of this
classification in analyzing the current academic debates in the field. The
interaction between the system and the measuring apparatus of the experimenter
is examined both from the perspectives of decoherence and the quantum Zeno
effect. These ideas are used as context to address the question of limits to
machine consciousness.
","[{'version': 'v1', 'created': 'Mon, 17 Jul 2017 21:35:35 GMT'}]",2021-08-17,"[['Kak', 'Subhash', '']]","['machine consciousness', 'artificial intelligence', 'quantum Zeno effect']"
4263,1812.05442,Jesus Bonilla,Jes\'us Bonilla and Santiago Badia,Maximum-principle preserving space-time isogeometric analysis,,,10.1016/j.cma.2019.05.042,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we propose a nonlinear stabilization technique for
convection-diffusion-reaction and pure transport problems discretized with
space-time isogeometric analysis. The stabilization is based on a
graph-theoretic artificial diffusion operator and a novel shock detector for
isogeometric analysis. Stabilization in time and space directions are performed
similarly, which allow us to use high-order discretizations in time without any
CFL-like condition. The method is proven to yield solutions that satisfy the
discrete maximum principle (DMP) unconditionally for arbitrary order. In
addition, the stabilization is linearity preserving in a space-time sense.
Moreover, the scheme is proven to be Lipschitz continuous ensuring that the
nonlinear problem is well-posed. Solving large problems using a space-time
discretization can become highly costly. Therefore, we also propose a
partitioned space-time scheme that allows us to select the length of every time
slab, and solve sequentially for every subdomain. As a result, the
computational cost is reduced while the stability and convergence properties of
the scheme remain unaltered. In addition, we propose a twice differentiable
version of the stabilization scheme, which enjoys the same stability properties
while the nonlinear convergence is significantly improved. Finally, the
proposed schemes are assessed with numerical experiments. In particular, we
considered steady and transient pure convection and convection-diffusion
problems in one and two dimensions.
","[{'version': 'v1', 'created': 'Thu, 13 Dec 2018 14:26:50 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Nov 2019 18:23:45 GMT'}]",2019-11-18,"[['Bonilla', 'Jesús', ''], ['Badia', 'Santiago', '']]","['Isogeometric analysis', 'discrete maximum principle', 'monotonicity', 'high-order', 'space–time']"
4264,1604.08268,Diederik Aerts,"Diederik Aerts, Lyneth Beltran, Massimiliano Sassoli de Bianchi,
  Sandro Sozzo and Tomas Veloz",Quantum Cognition Beyond Hilbert Space I: Fundamentals,"10 pages, 2 figures","In de Barros J., Coecke B., Pothos E. (Eds), Quantum Interaction.
  QI 2016 (pp. 81-98). Lecture Notes in Computer Science, vol 10106. Springer,
  Cham (2017)",10.1007/978-3-319-52289-0_7,,cs.AI quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The formalism of quantum theory in Hilbert space has been applied with
success to the modeling and explanation of several cognitive phenomena, whereas
traditional cognitive approaches were problematical. However, this 'quantum
cognition paradigm' was recently challenged by its proven impossibility to
simultaneously model 'question order effects' and 'response replicability'. In
Part I of this paper we describe sequential dichotomic measurements within an
operational and realistic framework for human cognition elaborated by
ourselves, and represent them in a quantum-like 'extended Bloch representation'
where the Born rule of quantum probability does not necessarily hold. In Part
II we apply this mathematical framework to successfully model question order
effects, response replicability and unpacking effects, thus opening the way
toward quantum cognition beyond Hilbert space.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2016 23:30:29 GMT'}]",2019-02-12,"[['Aerts', 'Diederik', ''], ['Beltran', 'Lyneth', ''], ['de Bianchi', 'Massimiliano Sassoli', ''], ['Sozzo', 'Sandro', ''], ['Veloz', 'Tomas', '']]","['Human cognition', 'cognitive modeling', 'quantum structures', 'general tension-reduction model']"
4265,1811.03606,Jurriaan Rot,"Filippo Bonchi, Tom van Bussel, Matias David Lee, Jurriaan Rot",Bisimilarity of Open Terms in Stream GSOS,,"Science of Computer Programming, Volume 172, pages 1-26, 2019,
  Elsevier",10.1016/j.scico.2018.10.007,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stream GSOS is a specification format for operations and calculi on infinite
sequences. The notion of bisimilarity provides a canonical proof technique for
equivalence of closed terms in such specifications. In this paper, we focus on
open terms, which may contain variables, and which are equivalent whenever they
denote the same stream for every possible instantiation of the variables. Our
main contribution is to capture equivalence of open terms as bisimilarity on
certain Mealy machines, providing a concrete proof technique. Moreover, we
introduce an enhancement of this technique, called bisimulation up-to
substitutions, and show how to combine it with other up-to techniques to obtain
a powerful method for proving equivalence of open terms.
","[{'version': 'v1', 'created': 'Thu, 8 Nov 2018 18:40:39 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Feb 2019 15:13:09 GMT'}]",2019-02-13,"[['Bonchi', 'Filippo', ''], ['van Bussel', 'Tom', ''], ['Lee', 'Matias David', ''], ['Rot', 'Jurriaan', '']]","['bisimilarity', 'streams', 'open terms', 'GSOS', 'operational semantics']"
4266,1912.04034,Swapnil Kumar,"Sasikanth Goteti, Swapnil Kumar",Novel Approach for Solving a Variant of Equal Flow Problem,10 pages,,10.7287/peerj.preprints.27264v1,,cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article we consider a certain sub class of Integer Equal Flow
problem, which are known NP hard [8]. Currently there exist no direct solutions
for the same. It is a common problem in various inventory management systems.
Here we discuss a local minima solution which uses projection of the convex
spaces to resolve the equal flows and turn the problem into a known linear
integer programming or constraint satisfaction problem which have reasonable
known solutions and can be effectively solved using simplex or other standard
optimization strategies.
","[{'version': 'v1', 'created': 'Mon, 9 Dec 2019 13:38:44 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Dec 2019 07:39:13 GMT'}]",2019-12-11,"[['Goteti', 'Sasikanth', ''], ['Kumar', 'Swapnil', '']]","['Integer Equal Flow', 'Transportation', 'Constraint Satisfaction']"
4267,1911.10317,Pratik Kayal,"Davinder Singh, Naman Jain, Pranjali Jain, Pratik Kayal, Sudhakar
  Kumawat, Nipun Batra",PlantDoc: A Dataset for Visual Plant Disease Detection,"5 Pages, 6 figures, 3 tables",,10.1145/3371158.3371196,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  India loses 35% of the annual crop yield due to plant diseases. Early
detection of plant diseases remains difficult due to the lack of lab
infrastructure and expertise. In this paper, we explore the possibility of
computer vision approaches for scalable and early plant disease detection. The
lack of availability of sufficiently large-scale non-lab data set remains a
major challenge for enabling vision based plant disease detection. Against this
background, we present PlantDoc: a dataset for visual plant disease detection.
Our dataset contains 2,598 data points in total across 13 plant species and up
to 17 classes of diseases, involving approximately 300 human hours of effort in
annotating internet scraped images. To show the efficacy of our dataset, we
learn 3 models for the task of plant disease classification. Our results show
that modelling using our dataset can increase the classification accuracy by up
to 31%. We believe that our dataset can help reduce the entry barrier of
computer vision techniques in plant disease detection.
","[{'version': 'v1', 'created': 'Sat, 23 Nov 2019 06:45:03 GMT'}]",2019-11-26,"[['Singh', 'Davinder', ''], ['Jain', 'Naman', ''], ['Jain', 'Pranjali', ''], ['Kayal', 'Pratik', ''], ['Kumawat', 'Sudhakar', ''], ['Batra', 'Nipun', '']]","['Deep Learning', 'Object Detection', 'Image Classification']"
4268,1901.09527,Erel Segal-Halevi,Elad Aigner-Horev and Erel Segal-Halevi,"Envy-free Matchings in Bipartite Graphs and their Applications to Fair
  Division","Appeared in Information Sciences, 587:164--187. But during the
  production, the main theorem text was deleted. The arXiv version is the
  correct one","Information Sciences, 2022, 587:164--187. Note: during the
  production, the main theorem text was deleted. The arXiv version is the
  correct one",10.1016/j.ins.2021.11.059,,cs.DS cs.GT math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A matching in a bipartite graph with parts X and Y is called envy-free if no
unmatched vertex in X is a adjacent to a matched vertex in Y. Every perfect
matching is envy-free, but envy-free matchings exist even when perfect
matchings do not. We prove that every bipartite graph has a unique partition
such that all envy-free matchings are contained in one of the partition sets.
Using this structural theorem, we provide a polynomial-time algorithm for
finding an envy-free matching of maximum cardinality. For edge-weighted
bipartite graphs, we provide a polynomial-time algorithm for finding a
maximum-cardinality envy-free matching of minimum total weight. We show how
envy-free matchings can be used in various fair division problems with either
continuous resources (""cakes"") or discrete ones. In particular, we propose a
symmetric algorithm for proportional cake-cutting, an algorithm for
1-out-of-(2n-2) maximin-share allocation of discrete goods, and an algorithm
for 1-out-of-floor(2n/3) maximin-share allocation of discrete bads among n
agents.
","[{'version': 'v1', 'created': 'Mon, 28 Jan 2019 06:03:25 GMT'}, {'version': 'v2', 'created': 'Thu, 30 May 2019 10:56:16 GMT'}, {'version': 'v3', 'created': 'Sun, 15 Sep 2019 19:31:33 GMT'}, {'version': 'v4', 'created': 'Tue, 22 Dec 2020 09:15:57 GMT'}, {'version': 'v5', 'created': 'Mon, 22 Nov 2021 06:45:59 GMT'}, {'version': 'v6', 'created': 'Thu, 14 Apr 2022 10:23:16 GMT'}]",2022-04-15,"[['Aigner-Horev', 'Elad', ''], ['Segal-Halevi', 'Erel', '']]","['Fair Division', 'Cake cutting', 'Maximin Share', 'Bipartite Graphs', 'Perfect Matching', 'Maximum Matching']"
4269,1409.6253,Matteo Camilli M.Sc.,Matteo Camilli,Constructing Coverability Graphs for Time Basic Petri Nets,13 pages,,10.1109/SYNASC.2016.036,,cs.LO cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Time-Basic Petri nets, is a powerful formalism for modeling real-time systems
where time constraints are expressed through time functions of marking's time
description associated with transition, representing possible firing times. We
introduce a technique for coverability analysis based on the building of a
finite graph. This technique further exploits the time anonymous concept [5,6],
in order to deal with topologically unbounded nets, exploits the concept of a
coverage of TA tokens, i.e., a sort of {\omega} anonymous timestamp. Such a
coverability analysis technique is able to construct coverability trees/graphs
for unbounded Time-Basic Petri net models. The termination of the algorithm is
guaranteed as long as, within the input model, tokens growing without limit,
can be anonymized. This means that we are able to manage models that do not
exhibit Zeno behavior and do not express actions depending on infinite past
events. This is actually a reasonable limitation because, generally, real-world
examples do not exhibit such a behavior.
","[{'version': 'v1', 'created': 'Fri, 19 Sep 2014 10:59:38 GMT'}]",2021-03-15,"[['Camilli', 'Matteo', '']]","['real-time systems', 'Time Basic Petri nets', 'infinite-states systems', 'reachability problems', 'coverability analysis']"
4270,1603.07086,Kai Mindermann,Kai Mindermann,"Are easily usable security libraries possible and how should experts
  work together to create them?","ICSE 16 May 16-16 2016, Austin, TX, USA (CHASE)",,10.1145/2897586.2897610,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to non-experts also developing security relevant applications it is
necessary to support them too. Some improvements in the current research may
not reach or impact these developers. Nonetheless these developers use security
libraries. There are findings that even their usage is not easily possible and
applications are left vulnerable to supposedly treated threats. So it is
important to improve the usability of the security libraries. This is itself is
not straightforward because of a required maturing process for example. By
getting together experts of different involved areas, especially cryptographic
and API-usability experts, both of the problems can be tackled.
","[{'version': 'v1', 'created': 'Wed, 23 Mar 2016 08:06:08 GMT'}]",2016-03-24,"[['Mindermann', 'Kai', '']]","['Abstraction', 'API', 'developer knowledge']"
4271,1204.1259,Bal\'azs Hidasi,"Bal\'azs Hidasi, Domonkos Tikk","Fast ALS-based tensor factorization for context-aware recommendation
  from implicit feedback","Accepted for ECML/PKDD 2012, presented on 25th September 2012,
  Bristol, UK","Proceedings of the 2012 European conference on Machine Learning
  and Knowledge Discovery in Databases - Volume Part II",10.1007/978-3-642-33486-3_5,,cs.LG cs.IR cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Albeit, the implicit feedback based recommendation problem - when only the
user history is available but there are no ratings - is the most typical
setting in real-world applications, it is much less researched than the
explicit feedback case. State-of-the-art algorithms that are efficient on the
explicit case cannot be straightforwardly transformed to the implicit case if
scalability should be maintained. There are few if any implicit feedback
benchmark datasets, therefore new ideas are usually experimented on explicit
benchmarks. In this paper, we propose a generic context-aware implicit feedback
recommender algorithm, coined iTALS. iTALS apply a fast, ALS-based tensor
factorization learning method that scales linearly with the number of non-zero
elements in the tensor. The method also allows us to incorporate diverse
context information into the model while maintaining its computational
efficiency. In particular, we present two such context-aware implementation
variants of iTALS. The first incorporates seasonality and enables to
distinguish user behavior in different time intervals. The other views the user
history as sequential information and has the ability to recognize usage
pattern typical to certain group of items, e.g. to automatically tell apart
product types or categories that are typically purchased repetitively
(collectibles, grocery goods) or once (household appliances). Experiments
performed on three implicit datasets (two proprietary ones and an implicit
variant of the Netflix dataset) show that by integrating context-aware
information with our factorization framework into the state-of-the-art implicit
recommender algorithm the recommendation quality improves significantly.
","[{'version': 'v1', 'created': 'Thu, 5 Apr 2012 15:34:30 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Apr 2013 15:33:31 GMT'}]",2013-04-05,"[['Hidasi', 'Balázs', ''], ['Tikk', 'Domonkos', '']]","['recommender systems', 'tensor factorization', 'context awareness', 'implicit feedback']"
4272,1904.01725,Haozhen Zhao,"Han Qin, Kit Riehle, Haozhen Zhao",Using Google Analytics to Support Cybersecurity Forensics,2017 IEEE International Conference on Big Data (Big Data),,10.1109/BigData.2017.8258385,,cs.IR cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web traffic is a valuable data source, typically used in the marketing space
to track brand awareness and advertising effectiveness. However, web traffic is
also a rich source of information for cybersecurity monitoring efforts. To
better understand the threat of malicious cyber actors, this study develops a
methodology to monitor and evaluate web activity using data archived from
Google Analytics. Google Analytics collects and aggregates web traffic,
including information about web visitors' location, date and time of visit,
visited webpages, and searched keywords. This study seeks to streamline
analysis of this data and uses rule-based anomaly detection and predictive
modeling to identify web traffic that deviates from normal patterns. Rather
than evaluating pieces of web traffic individually, the methodology seeks to
emulate real user behavior by creating a new unit of analysis: the user
session. User sessions group individual pieces of traffic from the same
location and date, which transforms the available information from single
point-in-time snapshots to dynamic sessions showing users' trajectory and
intent. The result is faster and better insight into large volumes of noisy web
traffic.
","[{'version': 'v1', 'created': 'Wed, 3 Apr 2019 01:01:52 GMT'}]",2019-04-04,"[['Qin', 'Han', ''], ['Riehle', 'Kit', ''], ['Zhao', 'Haozhen', '']]","['Cybersecurity', 'Google Analytics', 'Predictive']"
4273,1705.10093,Ali Nassif,"Cuauht\'emoc L\'opez-Mart\'in, Ali Bou Nassif, Alain Abran","A training process for improving the quality of software projects
  developed by a practitioner",,,10.1016/j.jss.2017.05.050,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: The quality of a software product depends on the quality of the
software process followed in developing the product. Therefore, many higher
education institutions (HEI) and software organizations have implemented
software process improvement (SPI) training courses to improve the software
quality. Objective: Because the duration of a course is a concern for HEI and
software organizations, we investigate whether the quality of software projects
will be improved by reorganizing the activities of the ten assignments of the
original personal software process (PSP) course into a modified PSP having
fewer assignments (i.e., seven assignments). Method: The assignments were
developed by following a modified PSP with fewer assignments but including the
phases, forms, standards, and logs suggested in the original PSP. The
measurement of the quality of the software assignments was based on defect
density. Results: When the activities in the original PSP were reordered into
fewer assignments, as practitioners progress through the PSP training, the
defect density improved with statistical significance. Conclusions: Our
modified PSP could be applied in academy and industrial environments which are
concerned in the sense of reducing the PSP training time
","[{'version': 'v1', 'created': 'Mon, 29 May 2017 09:47:15 GMT'}]",2017-05-30,"[['López-Martín', 'Cuauhtémoc', ''], ['Nassif', 'Ali Bou', ''], ['Abran', 'Alain', '']]","['Software engineering education and training', 'software process improvement', 'software quality improvement', 'personal software process']"
4274,1207.2584,Niranjan Kumar Ray,"Niranjan Kumar Ray, Harsh Bardhan Sharma and Ashok Kumar Turuk","Network Lifetime Analysis of AODV, DSR and ZRP at Different Network
  Parameters","12 pages, 11 figures","International Journal of Mobile Network Communications &
  Telematics (IJMNCT) Vol.2, No.3, June 2012",10.5121/ijmnct.2012.2304,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  Enhancement of network lifetime is a key design criterion for most of the
energy constrained networks as nodes are battery operated. In multi-hop
wireless network, proper utilization of battery power is very much necessary to
maintain network connectivity. If the battery power of a node drains quickly
then its connectivity in its neighborhood will be lost. So the study of network
lifetime is very much crucial as compared to other network parameters.
Considering this importance we made an attempt to study the behaviour of three
most common routing protocols in ad hoc network. Extensive simulations are done
on AODV, DSR and ZRP to determine the network lifetime at different node
mobility and at different network load. Simulation results suggest that AODV is
the most energy efficient protocol as compared to other
","[{'version': 'v1', 'created': 'Wed, 11 Jul 2012 10:32:55 GMT'}]",2012-07-12,"[['Ray', 'Niranjan Kumar', ''], ['Sharma', 'Harsh Bardhan', ''], ['Turuk', 'Ashok Kumar', '']]","['Network lifetime', 'Routing Protocols', 'Energy efficiency Wireless Network', 'Mobile ad hoc Network']"
4275,1305.2755,Issam Sahmoudi issam sahmoudi,Issam Sahmoudi and Abdelmonaime Lachkar,Clustering Web Search Results For Effective Arabic Language Browsing,,"International Journal on Natural Language Computing (IJNLC) Vol.
  2, No.2, April 2013",10.5121/ijnlc.2013.2202,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The process of browsing Search Results is one of the major problems with
traditional Web search engines for English, European, and any other languages
generally, and for Arabic Language particularly. This process is absolutely
time consuming and the browsing style seems to be unattractive. Organizing Web
search results into clusters facilitates users quick browsing through search
results. Traditional clustering techniques (data-centric clustering algorithms)
are inadequate since they don't generate clusters with highly readable names or
cluster labels. To solve this problem, Description-centric algorithms such as
Suffix Tree Clustering (STC) algorithm have been introduced and used
successfully and extensively with different adapted versions for English,
European, and Chinese Languages. However, till the day of writing this paper,
in our knowledge, STC algorithm has been never applied for Arabic Web Snippets
Search Results Clustering.In this paper, we propose first, to study how STC can
be applied for Arabic Language? We then illustrate by example that is
impossible to apply STC after Arabic Snippets pre-processing (stem or root
extraction) because the Merging process yields many redundant clusters.
Secondly, to overcome this problem, we propose to integrate STC in a new scheme
taking into a count the Arabic language properties in order to get the web more
and more adapted to Arabic users. The proposed approach automatically clusters
the web search results into high quality, and high significant clusters labels.
The obtained clusters not only are coherent, but also can convey the contents
to the users concisely and accurately. Therefore the Arabic users can decide at
a glance whether the contents of a cluster are of interest.....
","[{'version': 'v1', 'created': 'Mon, 13 May 2013 12:28:34 GMT'}]",2013-05-14,"[['Sahmoudi', 'Issam', ''], ['Lachkar', 'Abdelmonaime', '']]","['Browsing', 'Arabic Language', 'Arabic Web Snippets', 'Suffix Tree Clustering', 'Web search engines;']"
4276,1512.00539,Nima Namvar,"Nima Namvar, Walid Saad, Behrouz Maham","Cell Selection in Wireless Two-Tier Networks: A Context-Aware Matching
  Game","11 pages, 11 figures, Journal article in ICST Wireless Spectrum, 2014",,10.4108/ws.1.2.e2,,cs.NI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The deployment of small cell networks is seen as a major feature of the next
generation of wireless networks. In this paper, a novel approach for cell
association in small cell networks is proposed. The proposed approach exploits
new types of information extracted from the users' devices and environment to
improve the way in which users are assigned to their serving base stations.
Examples of such context information include the devices' screen size and the
users' trajectory. The problem is formulated as a matching game with
externalities and a new, distributed algorithm is proposed to solve this game.
The proposed algorithm is shown to reach a stable matching whose properties are
studied. Simulation results show that the proposed context-aware matching
approach yields significant performance gains, in terms of the average utility
per user, when compared with a classical max-SINR approach.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2015 01:27:46 GMT'}]",2015-12-04,"[['Namvar', 'Nima', ''], ['Saad', 'Walid', ''], ['Maham', 'Behrouz', '']]","['Small Cell Networks', 'Context Information', 'User-Cell Association', 'Stable Matching']"
4277,1302.2395,Joshua James,"Joshua I. James, Pavel Gladyshev, Yuandong Zhu","Signature Based Detection of User Events for Post-Mortem Forensic
  Analysis","15 pages, 4 figures, 5 tables, 1 appendix, 2nd International
  Conference on Digital Forensics and Cyber Crime","James, J.I., P. Gladyshev, Y. Zhu. (2011) ""Signature Based
  Detection of User Events for Post-Mortem Forensic Analysis"". Digital
  Forensics and Cyber Crime. Vol 53. pp 96-109. Springer",10.1007/978-3-642-19513-6_8,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a novel approach to user event reconstruction by
showing the practicality of generating and implementing signature-based
analysis methods to reconstruct high-level user actions from a collection of
low-level traces found during a post-mortem forensic analysis of a system.
Traditional forensic analysis and the inferences an investigator normally makes
when given digital evidence, are examined. It is then demonstrated that this
natural process of inferring high-level events from low-level traces may be
encoded using signature-matching techniques. Simple signatures using the
defined method are created and applied for three popular Windows-based programs
as a proof of concept.
","[{'version': 'v1', 'created': 'Mon, 11 Feb 2013 04:24:13 GMT'}]",2013-02-13,"[['James', 'Joshua I.', ''], ['Gladyshev', 'Pavel', ''], ['Zhu', 'Yuandong', '']]","['Digital Forensics', 'Event Reconstruction', 'Signature Detection', 'User Actions', 'User Events', 'Investigator inference']"
4278,2105.11240,Nastaran Bajalan,Saeed Bajalan and Nastaran Bajalan,"Novel ANN method for solving ordinary and fractional Black-Scholes
  equation",,,10.1155/2021/5511396,,cs.LG cs.NA math.NA,http://creativecommons.org/licenses/by/4.0/,"  The main aim of this study is to introduce a 2-layered Artificial Neural
Network (ANN) for solving the Black-Scholes partial differential equation (PDE)
of either fractional or ordinary orders. Firstly, a discretization method is
employed to change the model into a sequence of Ordinary Differential Equations
(ODE). Then each of these ODEs is solved with the aid of an ANN. Adam
optimization is employed as the learning paradigm since it can add the
foreknowledge of slowing down the process of optimization when getting close to
the actual optimum solution. The model also takes advantage of fine tuning for
speeding up the process and domain mapping to confront infinite domain issue.
Finally, the accuracy, speed, and convergence of the method for solving several
types of Black-Scholes model are reported.
","[{'version': 'v1', 'created': 'Mon, 17 May 2021 15:10:15 GMT'}]",2021-08-04,"[['Bajalan', 'Saeed', ''], ['Bajalan', 'Nastaran', '']]","['Artificial intelligence', 'Fractional Black-Scholes', 'Adam optimization', 'Adaptive']"
4279,1304.3541,Ramin Maazallahi,Ramin Maazallahi and Aliakbar Niknafs,"A modified dna computing approach to tackle the exponential solution
  space of the graph coloring problem","7 pages, 3 figures, 1 table, International Journal in Foundations of
  Computer Science & Technology (IJFCST), Vol. 3, No.2, March 2013","International Journal in Foundations of Computer Science &
  Technology (IJFCST), Vol. 3, No.2, March 2013",10.5121/ijfcst.2013.3201,,cs.CC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although it has been evidenced that DNA computing is able to solve the graph
coloring problem in a polynomial time complexity, but the exponential solution
space is still a restrictive factor in applying this technique for solving
really large problems. In this paper a modified DNA computing approach based on
Adleman-Lipton model is proposed which tackles the mentioned restriction by
coloring the vertices one by one. In each step, it expands the DNA strands
encoding promising solutions and discards those which encode infeasible ones. A
sample graph is colored by simulating the proposed approach and shows a notable
reduction in the number of DNA strands used.
","[{'version': 'v1', 'created': 'Fri, 12 Apr 2013 05:34:44 GMT'}]",2013-04-15,"[['Maazallahi', 'Ramin', ''], ['Niknafs', 'Aliakbar', '']]","['DNA Computing', 'Graph Coloring', 'Exponential Solution Space', 'Adleman-Lipton', 'NP-Complete']"
4280,1903.00884,Yasir Hussain,"Yasir Hussain, Zhiqiu Huang, Yu Zhou, Senzhang Wang","CodeGRU: Context-aware Deep Learning with Gated Recurrent Unit for
  Source Code Modeling",,"Information and Software Technology. Volume 125, September 2020,
  106309",10.1016/j.infsof.2020.106309,,cs.NE cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently deep learning based Natural Language Processing (NLP) models have
shown great potential in the modeling of source code. However, a major
limitation of these approaches is that they take source code as simple tokens
of text and ignore its contextual, syntactical and structural dependencies. In
this work, we present CodeGRU, a gated recurrent unit based source code
language model that is capable of capturing source code's contextual,
syntactical and structural dependencies. We introduce a novel approach which
can capture the source code context by leveraging the source code token types.
Further, we adopt a novel approach which can learn variable size context by
taking into account source code's syntax, and structural information. We
evaluate CodeGRU with real-world data set and it shows that CodeGRU outperforms
the state-of-the-art language models and help reduce the vocabulary size up to
24.93\%. Unlike previous works, we tested CodeGRU with an independent test set
which suggests that our methodology does not requisite the source code comes
from the same domain as training data while providing suggestions. We further
evaluate CodeGRU with two software engineering applications: source code
suggestion, and source code completion. Our experiment confirms that the source
code's contextual information can be vital and can help improve the software
language models. The extensive evaluation of CodeGRU shows that it outperforms
the state-of-the-art models. The results further suggest that the proposed
approach can help reduce the vocabulary size and is of practical use for
software developers.
","[{'version': 'v1', 'created': 'Sun, 3 Mar 2019 11:44:08 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Jul 2020 12:12:00 GMT'}]",2020-07-15,"[['Hussain', 'Yasir', ''], ['Huang', 'Zhiqiu', ''], ['Zhou', 'Yu', ''], ['Wang', 'Senzhang', '']]","['Deep Neural Networks', 'Source Code', 'Code Suggestion', 'CodeGeneration']"
4281,1608.05179,Wei Ma,Wei Ma and Xun Liu,"Improving the Efficiency of DAMAS for Sound Source Localization via
  Wavelet Compression Computational Grid","15 pages, 6 figures, 2 tables, 23 conferences",,10.1016/j.jsv.2017.02.005,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Phased microphone arrays are used widely in the applications for acoustic
source localization. Deconvolution approaches such as DAMAS successfully
overcome the spatial resolution limit of the conventional delay-and-sum (DAS)
beamforming method. However deconvolution approaches require high computational
effort compared to conventional DAS beamforming method. This paper presents a
novel method that serves to improve the efficiency of DAMAS via wavelet
compression computational grid rather than via optimizing DAMAS algorithm. In
this method, the efficiency of DAMAS increases with compression ratio. This
method can thus save lots of run time in industrial applications for sound
source localization, particularly when sound sources are just located in a
small extent compared with scanning plane and a band of angular frequency needs
to be calculated. In addition, this method largely retains the spatial
resolution of DAMAS on original computational grid, although with a minor
deficiency that the occurrence probability of aliasing increasing slightly for
complicated sound source.
","[{'version': 'v1', 'created': 'Thu, 18 Aug 2016 05:16:38 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Aug 2016 14:31:34 GMT'}]",2017-02-14,"[['Ma', 'Wei', ''], ['Liu', 'Xun', '']]","['microphone arrays', 'beamforming', 'DAMAS', 'wavelet compression']"
4282,1701.00877,Tom Hanika,"Daniel Borchmann, Tom Hanika, Sergei Obiedkov",On the Usability of Probably Approximately Correct Implication Bases,"17 pages, 8 figures; typos added, corrected x-label on graphs",,10.1007/978-3-319-59271-8_5,,cs.AI cs.LG cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We revisit the notion of probably approximately correct implication bases
from the literature and present a first formulation in the language of formal
concept analysis, with the goal to investigate whether such bases represent a
suitable substitute for exact implication bases in practical use-cases. To this
end, we quantitatively examine the behavior of probably approximately correct
implication bases on artificial and real-world data sets and compare their
precision and recall with respect to their corresponding exact implication
bases. Using a small example, we also provide qualitative insight that
implications from probably approximately correct bases can still represent
meaningful knowledge from a given data set.
","[{'version': 'v1', 'created': 'Wed, 4 Jan 2017 00:45:37 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Jan 2017 23:39:05 GMT'}]",2017-12-27,"[['Borchmann', 'Daniel', ''], ['Hanika', 'Tom', ''], ['Obiedkov', 'Sergei', '']]","['Formal Concept Analysis', 'Implications', 'Query Learning', 'PAC Learning']"
4283,1007.4040,Yisong Wang,Yisong Wang and Jia-Huai You and Li Yan Yuan and Yi-Dong Shen,Loop Formulas for Description Logic Programs,"29 pages, 1 figures (in pdf), a short version appeared in ICLP'10","yisong Wang, Jia-Huai You, Li-Yan Yuan, Yi-Dong Shen: Loop
  formulas for description logic programs. TPLP 10(4-6): 531-545 (2010)",10.1017/S1471068410000268,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Description Logic Programs (dl-programs) proposed by Eiter et al. constitute
an elegant yet powerful formalism for the integration of answer set programming
with description logics, for the Semantic Web. In this paper, we generalize the
notions of completion and loop formulas of logic programs to description logic
programs and show that the answer sets of a dl-program can be precisely
captured by the models of its completion and loop formulas. Furthermore, we
propose a new, alternative semantics for dl-programs, called the {\em canonical
answer set semantics}, which is defined by the models of completion that
satisfy what are called canonical loop formulas. A desirable property of
canonical answer sets is that they are free of circular justifications. Some
properties of canonical answer sets are also explored.
","[{'version': 'v1', 'created': 'Fri, 23 Jul 2010 04:48:19 GMT'}]",2010-07-26,"[['Wang', 'Yisong', ''], ['You', 'Jia-Huai', ''], ['Yuan', 'Li Yan', ''], ['Shen', 'Yi-Dong', '']]","['Semantic web', 'description logic programs', 'answer sets', 'loop formulas']"
4284,2105.03799,Dr.Vijay Bhaskar Semwal,"Vijay Bhaskar Semwal, Neha Gaud and G.C.Nandi","Human Gait State Prediction Using Cellular Automata and Classification
  Using ELM","Machine Intelligence and Signal Analysis conference. Published in
  book Advances in Intelligent Systems and Computing, vol 748. Springer,
  Singapore. arXiv admin note: substantial text overlap with arXiv:1710.06548",,10.1007/978-981-13-0923-6,,cs.RO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this research article, we have reported periodic cellular automata rules
for different gait state prediction and classification of the gait data using
extreme machine Leaning (ELM). This research is the first attempt to use
cellular automaton to understand the complexity of bipedal walk. Due to
nonlinearity, varying configurations throughout the gait cycle and the passive
joint located at the unilateral foot-ground contact in bipedal walk resulting
variation of dynamic descriptions and control laws from phase to phase for
human gait is making difficult to predict the bipedal walk states. We have
designed the cellular automata rules which will predict the next gait state of
bipedal steps based on the previous two neighbour states. We have designed
cellular automata rules for normal walk. The state prediction will help to
correctly design the bipedal walk. The normal walk depends on next two states
and has total 8 states. We have considered the current and previous states to
predict next state. So we have formulated 16 rules using cellular automata, 8
rules for each leg. The priority order maintained using the fact that if right
leg in swing phase then left leg will be in stance phase. To validate the model
we have classified the gait Data using ELM [1] and achieved accuracy 60%. We
have explored the trajectories and compares with another gait trajectories.
Finally we have presented the error analysis for different joints.
","[{'version': 'v1', 'created': 'Sat, 8 May 2021 23:47:32 GMT'}]",2021-05-11,"[['Semwal', 'Vijay Bhaskar', ''], ['Gaud', 'Neha', ''], ['Nandi', 'G. C.', '']]","['Cellular Automata (CA)', 'Human Gait', 'Bipedal Control', 'Humanoid Robot', 'Extreme Learning Machine (ELM)', 'Pseudo Inverse']"
4285,1607.05830,Alexandra Silva,"Steffen Smolka, Praveen Kumar, Nate Foster, Dexter Kozen, Alexandra
  Silva",Cantor meets Scott: Semantic Foundations for Probabilistic Networks,"to appear at POPL 2017, Paris",,10.1145/3009837.3009843,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  ProbNetKAT is a probabilistic extension of NetKAT with a denotational
semantics based on Markov kernels. The language is expressive enough to
generate continuous distributions, which raises the question of how to compute
effectively in the language. This paper gives an new characterization of
ProbNetKAT's semantics using domain theory, which provides the foundation
needed to build a practical implementation. We show how to use the semantics to
approximate the behavior of arbitrary ProbNetKAT programs using distributions
with finite support. We develop a prototype implementation and show how to use
it to solve a variety of problems including characterizing the expected
congestion induced by different routing schemes and reasoning probabilistically
about reachability in a network.
","[{'version': 'v1', 'created': 'Wed, 20 Jul 2016 06:05:07 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Jul 2016 02:24:52 GMT'}, {'version': 'v3', 'created': 'Tue, 9 Aug 2016 21:31:19 GMT'}, {'version': 'v4', 'created': 'Tue, 20 Sep 2016 04:59:36 GMT'}, {'version': 'v5', 'created': 'Mon, 21 Nov 2016 02:34:53 GMT'}, {'version': 'v6', 'created': 'Sat, 15 Dec 2018 09:01:32 GMT'}]",2018-12-18,"[['Smolka', 'Steffen', ''], ['Kumar', 'Praveen', ''], ['Foster', 'Nate', ''], ['Kozen', 'Dexter', ''], ['Silva', 'Alexandra', '']]","['Software-defined networking', 'Probabilistic semantics', 'Kleene algebra with tests', 'Domain theory', 'NetKAT']"
4286,1811.04463,Fayyaz Minhas,"Kanza Hamid, Amina Asif, Wajid Abbasi, Durre Sabih and Fayyaz Minhas",Machine Learning with Abstention for Automated Liver Disease Diagnosis,"Preprint version before submission for publication. complete version
  published in proc. 15th International Conference on Frontiers of Information
  Technology (FIT 2017), December 18-20, 2017, Islamabad, Pakistan.
  http://ieeexplore.ieee.org/document/8261064/","15th IEEE International Conference on Frontiers of Information
  Technology (FIT 2017), December 18-20, 2017, Islamabad, Pakistan",10.1109/FIT.2017.00070,,cs.LG cs.CV eess.IV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel approach for detection of liver abnormalities in
an automated manner using ultrasound images. For this purpose, we have
implemented a machine learning model that can not only generate labels (normal
and abnormal) for a given ultrasound image but it can also detect when its
prediction is likely to be incorrect. The proposed model abstains from
generating the label of a test example if it is not confident about its
prediction. Such behavior is commonly practiced by medical doctors who, when
given insufficient information or a difficult case, can chose to carry out
further clinical or diagnostic tests before generating a diagnosis. However,
existing machine learning models are designed in a way to always generate a
label for a given example even when the confidence of their prediction is low.
We have proposed a novel stochastic gradient based solver for the learning with
abstention paradigm and use it to make a practical, state of the art method for
liver disease classification. The proposed method has been benchmarked on a
data set of approximately 100 patients from MINAR, Multan, Pakistan and our
results show that the proposed scheme offers state of the art classification
performance.
","[{'version': 'v1', 'created': 'Sun, 11 Nov 2018 19:37:40 GMT'}]",2019-03-26,"[['Hamid', 'Kanza', ''], ['Asif', 'Amina', ''], ['Abbasi', 'Wajid', ''], ['Sabih', 'Durre', ''], ['Minhas', 'Fayyaz', '']]","['Ultrasound', 'Liver disease', 'learning with']"
4287,2105.06083,Zihan Wang,"Zihan Wang, Hongye Song, Zhaochun Ren, Pengjie Ren, Zhumin Chen,
  Xiaozhong Liu, Hongsong Li, Maarten de Rijke","Cross-Domain Contract Element Extraction with a Bi-directional Feedback
  Clause-Element Relation Network",Accepted by SIGIR2021,,10.1145/3404835.3462873,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Contract element extraction (CEE) is the novel task of automatically
identifying and extracting legally relevant elements such as contract dates,
payments, and legislation references from contracts. Automatic methods for this
task view it as a sequence labeling problem and dramatically reduce human
labor. However, as contract genres and element types may vary widely, a
significant challenge for this sequence labeling task is how to transfer
knowledge from one domain to another, i.e., cross-domain CEE. Cross-domain CEE
differs from cross-domain named entity recognition (NER) in two important ways.
First, contract elements are far more fine-grained than named entities, which
hinders the transfer of extractors. Second, the extraction zones for
cross-domain CEE are much larger than for cross-domain NER. As a result, the
contexts of elements from different domains can be more diverse. We propose a
framework, the Bi-directional Feedback cLause-Element relaTion network
(Bi-FLEET), for the cross-domain CEE task that addresses the above challenges.
Bi-FLEET has three main components: (1) a context encoder, (2) a clause-element
relation encoder, and (3) an inference layer. To incorporate invariant
knowledge about element and clause types, a clause-element graph is constructed
across domains and a hierarchical graph neural network is adopted in the
clause-element relation encoder. To reduce the influence of context variations,
a multi-task framework with a bi-directional feedback scheme is designed in the
inference layer, conducting both clause classification and element extraction.
The experimental results over both cross-domain NER and CEE tasks show that
Bi-FLEET significantly outperforms state-of-the-art baselines.
","[{'version': 'v1', 'created': 'Thu, 13 May 2021 05:14:36 GMT'}]",2021-05-14,"[['Wang', 'Zihan', ''], ['Song', 'Hongye', ''], ['Ren', 'Zhaochun', ''], ['Ren', 'Pengjie', ''], ['Chen', 'Zhumin', ''], ['Liu', 'Xiaozhong', ''], ['Li', 'Hongsong', ''], ['de Rijke', 'Maarten', '']]","['Legal information extraction and retrieval', 'Cross-domain information extraction', 'Contract element', 'Sequence labeling', 'Transferlearning']"
4288,1811.11946,Pranav Ganti,"Pranav Ganti, Steven L. Waslander",Network Uncertainty Informed Semantic Feature Selection for Visual SLAM,Published in: 2019 16th Conference on Computer and Robot Vision (CRV),,10.1109/CRV.2019.00024,,cs.CV cs.RO,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In order to facilitate long-term localization using a visual simultaneous
localization and mapping (SLAM) algorithm, careful feature selection can help
ensure that reference points persist over long durations and the runtime and
storage complexity of the algorithm remain consistent. We present SIVO
(Semantically Informed Visual Odometry and Mapping), a novel
information-theoretic feature selection method for visual SLAM which
incorporates semantic segmentation and neural network uncertainty into the
feature selection pipeline. Our algorithm selects points which provide the
highest reduction in Shannon entropy between the entropy of the current state
and the joint entropy of the state, given the addition of the new feature with
the classification entropy of the feature from a Bayesian neural network. Each
selected feature significantly reduces the uncertainty of the vehicle state and
has been detected to be a static object (building, traffic sign, etc.)
repeatedly with a high confidence. This selection strategy generates a sparse
map which can facilitate long-term localization. The KITTI odometry dataset is
used to evaluate our method, and we also compare our results against ORB_SLAM2.
Overall, SIVO performs comparably to the baseline method while reducing the map
size by almost 70%.
","[{'version': 'v1', 'created': 'Thu, 29 Nov 2018 03:53:17 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Aug 2019 15:00:41 GMT'}]",2019-09-02,"[['Ganti', 'Pranav', ''], ['Waslander', 'Steven L.', '']]","['Localization', 'Mapping', 'SLAM', 'Deep Learning', 'Information Theory', 'Semantic Segmentation']"
4289,1907.10451,Yabin Zhu,"Yabin Zhu, Chenglong Li, Bin Luo, Jin Tang, Xiao Wang",Dense Feature Aggregation and Pruning for RGBT Tracking,arXiv admin note: text overlap with arXiv:1811.09855,ACM International Conference on Multimedia.2019,10.1145/3343031.3350928,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  How to perform effective information fusion of different modalities is a core
factor in boosting the performance of RGBT tracking. This paper presents a
novel deep fusion algorithm based on the representations from an end-to-end
trained convolutional neural network. To deploy the complementarity of features
of all layers, we propose a recursive strategy to densely aggregate these
features that yield robust representations of target objects in each modality.
In different modalities, we propose to prune the densely aggregated features of
all modalities in a collaborative way. In a specific, we employ the operations
of global average pooling and weighted random selection to perform channel
scoring and selection, which could remove redundant and noisy features to
achieve more robust feature representation. Experimental results on two RGBT
tracking benchmark datasets suggest that our tracker achieves clear
state-of-the-art against other RGB and RGBT tracking methods.
","[{'version': 'v1', 'created': 'Wed, 24 Jul 2019 13:51:24 GMT'}]",2019-08-12,"[['Zhu', 'Yabin', ''], ['Li', 'Chenglong', ''], ['Luo', 'Bin', ''], ['Tang', 'Jin', ''], ['Wang', 'Xiao', '']]","['RGBT tracking', 'dense aggregation', 'recursive fusion', 'feature pruning']"
4290,1503.00426,Yuantao Gu,Laming Chen and Yuantao Gu,On the Null Space Constant for $l_p$ Minimization,"11 pages, 2 figure, journal manuscript",,10.1109/LSP.2015.2416003,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The literature on sparse recovery often adopts the $l_p$ ""norm"" $(p\in[0,1])$
as the penalty to induce sparsity of the signal satisfying an underdetermined
linear system. The performance of the corresponding $l_p$ minimization problem
can be characterized by its null space constant. In spite of the NP-hardness of
computing the constant, its properties can still help in illustrating the
performance of $l_p$ minimization. In this letter, we show the strict increase
of the null space constant in the sparsity level $k$ and its continuity in the
exponent $p$. We also indicate that the constant is strictly increasing in $p$
with probability $1$ when the sensing matrix ${\bf A}$ is randomly generated.
Finally, we show how these properties can help in demonstrating the performance
of $l_p$ minimization, mainly in the relationship between the the exponent $p$
and the sparsity level $k$.
","[{'version': 'v1', 'created': 'Mon, 2 Mar 2015 07:01:40 GMT'}]",2015-06-24,"[['Chen', 'Laming', ''], ['Gu', 'Yuantao', '']]","['Sparse recovery', 'null space constant', 'ℓp minimization', 'monotonicity', 'continuity']"
4291,1307.6246,Pekka Malo,"Ankur Sinha, Pekka Malo, Anton Frantsev, Kalyanmoy Deb","Finding Optimal Strategies in a Multi-Period Multi-Leader-Follower
  Stackelberg Game Using an Evolutionary Algorithm",To be published in Computers and Operations Research,,10.1016/j.cor.2013.07.010,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stackelberg games are a classic example of bilevel optimization problems,
which are often encountered in game theory and economics. These are complex
problems with a hierarchical structure, where one optimization task is nested
within the other. Despite a number of studies on handling bilevel optimization
problems, these problems still remain a challenging territory, and existing
methodologies are able to handle only simple problems with few variables under
assumptions of continuity and differentiability. In this paper, we consider a
special case of a multi-period multi-leader-follower Stackelberg competition
model with non-linear cost and demand functions and discrete production
variables. The model has potential applications, for instance in aircraft
manufacturing industry, which is an oligopoly where a few giant firms enjoy a
tremendous commitment power over the other smaller players. We solve cases with
different number of leaders and followers, and show how the entrance or exit of
a player affects the profits of the other players. In the presence of various
model complexities, we use a computationally intensive nested evolutionary
strategy to find an optimal solution for the model. The strategy is evaluated
on a test-suite of bilevel problems, and it has been shown that the method is
successful in handling difficult bilevel problems.
","[{'version': 'v1', 'created': 'Tue, 23 Jul 2013 21:15:06 GMT'}]",2013-07-25,"[['Sinha', 'Ankur', ''], ['Malo', 'Pekka', ''], ['Frantsev', 'Anton', ''], ['Deb', 'Kalyanmoy', '']]","['Game theory', 'bilevel optimization', 'Stackelberg games', 'multi-leader-follower problem', 'evolutionary algorithm']"
4292,1204.4200,Richard Preen,Richard J. Preen and Larry Bull,Discrete Dynamical Genetic Programming in XCS,arXiv admin note: substantial text overlap with arXiv:1201.5604,"In Proceedings of the 11th annual conference on genetic and
  evolutionary computation, GECCO '09, pp. 1299-1306. ACM, 2009",10.1145/1569901.1570075,,cs.AI cs.LG cs.NE cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A number of representation schemes have been presented for use within
Learning Classifier Systems, ranging from binary encodings to neural networks.
This paper presents results from an investigation into using a discrete
dynamical system representation within the XCS Learning Classifier System. In
particular, asynchronous random Boolean networks are used to represent the
traditional condition-action production system rules. It is shown possible to
use self-adaptive, open-ended evolution to design an ensemble of such discrete
dynamical systems within XCS to solve a number of well-known test problems.
","[{'version': 'v1', 'created': 'Wed, 18 Apr 2012 20:30:23 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Oct 2014 12:20:46 GMT'}]",2014-10-21,"[['Preen', 'Richard J.', ''], ['Bull', 'Larry', '']]","['Learning Classifier Systems', 'Random Boolean Networks', 'Reinforcement Learning', 'Self-Adaptation', 'XCS']"
4293,1309.2334,Saleh Almowuena,Saleh Almowuena,"An Efficient Key Agreement Scheme for Wireless Sensor Networks Using
  Third Parties","15 pages, 6 figures","International Journal of Ad hoc, Sensor & Ubiquitous Computing
  (IJASUC) Vol.4, No.4, August 2013",10.5121/ijasuc.2013.4401,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper contributes to the challenging field of security for wireless
sensor networks by introducing a key agreement scheme in which sensor nodes
create secure radio connections with their neighbours depending on the aid of
third parties. These third parties are responsible only for the pair-wise key
establishment among sensor nodes, so they do not observe the physical
phenomenon nor route data packets to other nodes. The proposed method is
explained here with respect to four important issues: how secret shares are
distributed, how local neighbours are discovered, how legitimate third parties
are verified, and how secure channels are established. Moreover, the
performance of the scheme is analyzed with regards to five metrics: local
connectivity, resistance to node capture, memory usage, communication overhead,
and computational burden. Our scheme not only secures the transmission channels
of nodes but also guarantees high local connectivity of the sensor network, low
usage of memory resources, perfect network resilience against node capture, and
complete prevention against impersonation attacks. As it is demonstrated in
this paper, using a number of third parties equals to 10% of the total number
of sensor nodes in the area of interest, the proposed method can achieve at
least 99.42% local connectivity with a very low usage of available storage
resources (less than 385 bits on each sensor node).
","[{'version': 'v1', 'created': 'Mon, 9 Sep 2013 21:56:20 GMT'}]",2013-09-11,"[['Almowuena', 'Saleh', '']]","['Key Agreement', 'Wireless Sensor Network', 'Third Party', 'Trust Establishment', 'Secure Channel']"
4294,1309.2057,Sapan Naik j,Sapan Naik and Nikunj Patel,Single image super resolution in spatial and wavelet domain,"10 pages, 5 figures, 1 table, sample code given","The International Journal of Multimedia & Its Applications (IJMA)
  Vol.5, No.4, August 2013",10.5121/ijma.2013.5402,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently single image super resolution is very important research area to
generate high resolution image from given low resolution image. Algorithms of
single image resolution are mainly based on wavelet domain and spatial domain.
Filters support to model the regularity of natural images is exploited in
wavelet domain while edges of images get sharp during up sampling in spatial
domain. Here single image super resolution algorithm is presented which based
on both spatial and wavelet domain and take the advantage of both. Algorithm is
iterative and use back projection to minimize reconstruction error. Wavelet
based denoising method is also introduced to remove noise.
","[{'version': 'v1', 'created': 'Mon, 9 Sep 2013 07:33:50 GMT'}]",2013-09-10,"[['Naik', 'Sapan', ''], ['Patel', 'Nikunj', '']]","['Super resolution', 'Up-sampling', 'Wavelet', 'Back Projection']"
4295,1709.07781,Raphael Hiesgen,"Raphael Hiesgen, Dominik Charousset, Thomas C. Schmidt","OpenCL Actors - Adding Data Parallelism to Actor-based Programming with
  CAF",28 pages,"Springer LNCS 10789, pp. 59--93, 2018",10.1007/978-3-030-00302-9_3,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The actor model of computation has been designed for a seamless support of
concurrency and distribution. However, it remains unspecific about data
parallel program flows, while available processing power of modern many core
hardware such as graphics processing units (GPUs) or coprocessors increases the
relevance of data parallelism for general-purpose computation.
  In this work, we introduce OpenCL-enabled actors to the C++ Actor Framework
(CAF). This offers a high level interface for accessing any OpenCL device
without leaving the actor paradigm. The new type of actor is integrated into
the runtime environment of CAF and gives rise to transparent message passing in
distributed systems on heterogeneous hardware. Following the actor logic in
CAF, OpenCL kernels can be composed while encapsulated in C++ actors, hence
operate in a multi-stage fashion on data resident at the GPU. Developers are
thus enabled to build complex data parallel programs from primitives without
leaving the actor paradigm, nor sacrificing performance. Our evaluations on
commodity GPUs, an Nvidia TESLA, and an Intel PHI reveal the expected linear
scaling behavior when offloading larger workloads. For sub-second duties, the
efficiency of offloading was found to largely differ between devices. Moreover,
our findings indicate a negligible overhead over programming with the native
OpenCL API.
","[{'version': 'v1', 'created': 'Fri, 22 Sep 2017 14:35:27 GMT'}]",2018-10-16,"[['Hiesgen', 'Raphael', ''], ['Charousset', 'Dominik', ''], ['Schmidt', 'Thomas C.', '']]","['Actor Model', 'C++', 'GPGPU Computing', 'OpenCL', 'Coprocessor']"
4296,1804.06169,Mandy Neumann,"Mandy Neumann, Christopher Michels, Philipp Schaer, Ralf Schenkel",Prioritizing and Scheduling Conferences for Metadata Harvesting in dblp,submitted to JCDL 2018,,10.1145/3197026.3197069,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Maintaining literature databases and online bibliographies is a core
responsibility of metadata aggregators such as digital libraries. In the
process of monitoring all the available data sources the question arises which
data source should be prioritized. Based on a broad definition of information
quality we are looking for different ways to find the best fitting and most
promising conference candidates to harvest next. We evaluate different
conference ranking features by using a pseudo-relevance assessment and a
component-based evaluation of our approach.
","[{'version': 'v1', 'created': 'Tue, 17 Apr 2018 11:28:01 GMT'}]",2018-04-18,"[['Neumann', 'Mandy', ''], ['Michels', 'Christopher', ''], ['Schaer', 'Philipp', ''], ['Schenkel', 'Ralf', '']]","['Bibliography', 'dblp', 'digital libraries', 'metadata harvesting', 'ranking', 'pseudo-relevance', 'scheduling']"
4297,1903.12264,Timur Osadchiy,"Timur Osadchiy, Ivan Poliakov, Patrick Olivier, Maisie Rowland, Emma
  Foster","Validation of a recommender system for prompting omitted foods in online
  dietary assessment surveys",,"PervasiveHealth 2019 Proceedings of the 13th EAI International
  Conference on Pervasive Computing Technologies for Healthcare",10.1145/3329189.3329191,ISBN: 978-1-4503-6126-2,cs.CY cs.HC cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recall assistance methods are among the key aspects that improve the accuracy
of online dietary assessment surveys. These methods still mainly rely on
experience of trained interviewers with nutritional background, but data driven
approaches could improve cost-efficiency and scalability of automated dietary
assessment. We evaluated the effectiveness of a recommender algorithm developed
for an online dietary assessment system called Intake24, that automates the
multiple-pass 24-hour recall method. The recommender builds a model of eating
behavior from recalls collected in past surveys. Based on foods they have
already selected, the model is used to remind respondents of associated foods
that they may have omitted to report. The performance of prompts generated by
the model was compared to that of prompts hand-coded by nutritionists in two
dietary studies. The results of our studies demonstrate that the recommender
system is able to capture a higher number of foods omitted by respondents of
online dietary surveys than prompts hand-coded by nutritionists. However, the
considerably lower precision of generated prompts indicates an opportunity for
further improvement of the system.
","[{'version': 'v1', 'created': 'Wed, 20 Mar 2019 16:42:54 GMT'}]",2019-06-06,"[['Osadchiy', 'Timur', ''], ['Poliakov', 'Ivan', ''], ['Olivier', 'Patrick', ''], ['Rowland', 'Maisie', ''], ['Foster', 'Emma', '']]","['Dietary assessment', 'Healthcare technology', 'Usability', 'RecommenderSystems']"
4298,1512.03859,EPTCS,"Alexei P. Lisitsa (Department of Computer Science, The University of
  Liverpool), Andrei P. Nemytykh (Program Systems Institute, Russian Academy of
  Sciences)","Finite Countermodel Based Verification for Program Transformation (A
  Case Study)","In Proceedings VPT 2015, arXiv:1512.02215","EPTCS 199, 2015, pp. 15-32",10.4204/EPTCS.199.2,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Both automatic program verification and program transformation are based on
program analysis. In the past decade a number of approaches using various
automatic general-purpose program transformation techniques (partial deduction,
specialization, supercompilation) for verification of unreachability properties
of computing systems were introduced and demonstrated. On the other hand, the
semantics based unfold-fold program transformation methods pose themselves
diverse kinds of reachability tasks and try to solve them, aiming at improving
the semantics tree of the program being transformed. That means some
general-purpose verification methods may be used for strengthening program
transformation techniques. This paper considers the question how finite
countermodels for safety verification method might be used in Turchin's
supercompilation method. We extract a number of supercompilation sub-algorithms
trying to solve reachability problems and demonstrate use of an external
countermodel finder for solving some of the problems.
","[{'version': 'v1', 'created': 'Sat, 12 Dec 2015 01:59:00 GMT'}]",2015-12-15,"[['Lisitsa', 'Alexei P.', '', 'Department of Computer Science, The University of\n  Liverpool'], ['Nemytykh', 'Andrei P.', '', 'Program Systems Institute, Russian Academy of\n  Sciences']]","['program specialization', 'supercompilation', 'program analysis', 'program transformation', 'safety verification', 'finite countermodels']"
4299,2105.06757,Rick Boks,"Rick Boks, Anna V. Kononova, Hao Wang","Quantifying the Impact of Boundary Constraint Handling Methods on
  Differential Evolution","9 pages, 2 figures. To be published in the 2021 Genetic and
  Evolutionary Computation Conference Companion",,10.1145/3449726.3463214,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Constraint handling is one of the most influential aspects of applying
metaheuristics to real-world applications, which can hamper the search progress
if treated improperly. In this work, we focus on a particular case - the box
constraints, for which many boundary constraint handling methods (BCHMs) have
been proposed. We call for the necessity of studying the impact of BCHMs on
metaheuristics' performance and behavior, which receives seemingly little
attention in the field. We target quantifying such impacts through systematic
benchmarking by investigating 28 major variants of Differential Evolution (DE)
taken from the modular DE framework (by combining different mutation and
crossover operators) and $13$ commonly applied BCHMs, resulting in $28 \times
13 = 364$ algorithm instances after pairing DE variants with BCHMs. After
executing the algorithm instances on the well-known BBOB/COCO problem set, we
analyze the best-reached objective function value (performance-wise) and the
percentage of repaired solutions (behavioral) using statistical ranking methods
for each combination of mutation, crossover, and BBOB function group. Our
results clearly show that the choice of BCHMs substantially affects the
empirical performance as well as the number of generated infeasible solutions,
which allows us to provide general guidelines for selecting an appropriate BCHM
for a given scenario.
","[{'version': 'v1', 'created': 'Fri, 14 May 2021 10:36:10 GMT'}]",2021-05-17,"[['Boks', 'Rick', ''], ['Kononova', 'Anna V.', ''], ['Wang', 'Hao', '']]","['optimization', 'metaheuristics', 'differential evolution', 'feasibility', 'boundary constraint handling', 'benchmarking']"
4300,1804.08208,Peng Gao,"Peng Gao, Yipeng Ma, Ke Song, Chao Li, Fei Wang, Liyi Xiao, Yan Zhang",High Performance Visual Tracking with Circular and Structural Operators,Accepted to Knowledge-Based SYSTEMS,,10.1016/j.knosys.2018.08.008,,cs.CV cs.AI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a novel circular and structural operator tracker (CSOT) is
proposed for high performance visual tracking, it not only possesses the
powerful discriminative capability of SOSVM but also efficiently inherits the
superior computational efficiency of DCF. Based on the proposed circular and
structural operators, a set of primal confidence score maps can be obtained by
circular correlating feature maps with their corresponding structural
correlation filters. Furthermore, an implicit interpolation is applied to
convert the multi-resolution feature maps to the continuous domain and make all
primal confidence score maps have the same spatial resolution. Then, we exploit
an efficient ensemble post-processor based on relative entropy, which can
coalesce primal confidence score maps and create an optimal confidence score
map for more accurate localization. The target is localized on the peak of the
optimal confidence score map. Besides, we introduce a collaborative
optimization strategy to update circular and structural operators by
iteratively training structural correlation filters, which significantly
reduces computational complexity and improves robustness. Experimental results
demonstrate that our approach achieves state-of-the-art performance in mean AUC
scores of 71.5% and 69.4% on the OTB-2013 and OTB-2015 benchmarks respectively,
and obtains a third-best expected average overlap (EAO) score of 29.8% on the
VOT-2017 benchmark.
","[{'version': 'v1', 'created': 'Mon, 23 Apr 2018 01:08:43 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Jul 2018 08:34:03 GMT'}, {'version': 'v3', 'created': 'Sat, 13 Oct 2018 07:06:14 GMT'}]",2019-05-14,"[['Gao', 'Peng', ''], ['Ma', 'Yipeng', ''], ['Song', 'Ke', ''], ['Li', 'Chao', ''], ['Wang', 'Fei', ''], ['Xiao', 'Liyi', ''], ['Zhang', 'Yan', '']]","['Visual tracking', 'circular and structural operators', 'ensemble post-processor', 'collaborative optimization']"
4301,1503.08715,Andrey Shchurov,Andrey A. Shchurov,Industrial Computing Systems: A Case Study of Fault Tolerance Analysis,6 figures,"International Journal of Computer Trends and Technology (IJCTT)
  V21(1):50-55, March 2015. ISSN:2231-2803",10.14445/22312803/IJCTT-V21P110,,cs.SY cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fault tolerance is a key factor of industrial computing systems design. But
in practical terms, these systems, like every commercial product, are under
great financial constraints and they have to remain in operational state as
long as possible due to their commercial attractiveness. This work provides an
analysis of the instantaneous failure rate of these systems at the end of their
life-time period. On the basis of this analysis, we determine the effect of a
critical increase in the system failure rate and the basic condition of its
existence. The next step determines the maintenance scheduling which can help
to avoid this effect and to extend the system life-time in fault-tolerant mode.
","[{'version': 'v1', 'created': 'Mon, 30 Mar 2015 15:38:45 GMT'}]",2015-03-31,"[['Shchurov', 'Andrey A.', '']]","['reliable computing system', 'fault tolerance', 'maintenance scheduling']"
4302,1803.02700,Ronny Chevalier,"Ronny Chevalier (1 and 2), Maugan Villatel (1), David Plaquin (1),
  Guillaume Hiet (2) ((1) HP Labs, (2) CIDRE Team, CentraleSup\'elec, Inria,
  CNRS, IRISA)","Co-processor-based Behavior Monitoring: Application to the Detection of
  Attacks Against the System Management Mode","The final version of this paper has been published in the Proceedings
  of the 33rd Annual Computer Security Applications Conference (ACSAC), 2017.
  13 pages, 5 figures",,10.1145/3134600.3134622,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Highly privileged software, such as firmware, is an attractive target for
attackers. Thus, BIOS vendors use cryptographic signatures to ensure firmware
integrity at boot time. Nevertheless, such protection does not prevent an
attacker from exploiting vulnerabilities at runtime. To detect such attacks, we
propose an event-based behavior monitoring approach that relies on an isolated
co-processor. We instrument the code executed on the main CPU to send
information about its behavior to the monitor. This information helps to
resolve the semantic gap issue. Our approach does not depend on a specific
model of the behavior nor on a specific target. We apply this approach to
detect attacks targeting the System Management Mode (SMM), a highly privileged
x86 execution mode executing firmware code at runtime. We model the behavior of
SMM using invariants of its control-flow and relevant CPU registers (CR3 and
SMBASE). We instrument two open-source firmware implementations: EDK II and
coreboot. We evaluate the ability of our approach to detect state-of-the-art
attacks and its runtime execution overhead by simulating an x86 system coupled
with an ARM Cortex A5 co-processor. The results show that our solution detects
intrusions from the state of the art, without any false positives, while
remaining acceptable in terms of performance overhead in the context of the SMM
(i.e., less than the 150 $\mu$s threshold defined by Intel).
","[{'version': 'v1', 'created': 'Wed, 7 Mar 2018 15:01:40 GMT'}]",2018-03-08,"[['Chevalier', 'Ronny', '', '1 and 2'], ['Villatel', 'Maugan', ''], ['Plaquin', 'David', ''], ['Hiet', 'Guillaume', '']]","['Hardware-based monitoring', 'firmware', 'SMM', 'co-processor', 'CFI']"
4303,1007.3336,Pegah Sattari,"Pegah Sattari, Christina Fragouli, Athina Markopoulou",Active Topology Inference using Network Coding,,,10.1016/j.phycom.2012.02.006,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our goal is to infer the topology of a network when (i) we can send probes
between sources and receivers at the edge of the network and (ii) intermediate
nodes can perform simple network coding operations, i.e., additions. Our key
intuition is that network coding introduces topology-dependent correlation in
the observations at the receivers, which can be exploited to infer the
topology. For undirected tree topologies, we design hierarchical clustering
algorithms, building on our prior work. For directed acyclic graphs (DAGs),
first we decompose the topology into a number of two-source, two-receiver
(2-by-2) subnetwork components and then we merge these components to
reconstruct the topology. Our approach for DAGs builds on prior work on
tomography, and improves upon it by employing network coding to accurately
distinguish among all different 2-by-2 components. We evaluate our algorithms
through simulation of a number of realistic topologies and compare them to
active tomographic techniques without network coding. We also make connections
between our approach and alternatives, including passive inference, traceroute,
and packet marking.
","[{'version': 'v1', 'created': 'Tue, 20 Jul 2010 05:00:00 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Feb 2013 07:50:16 GMT'}]",2013-02-07,"[['Sattari', 'Pegah', ''], ['Fragouli', 'Christina', ''], ['Markopoulou', 'Athina', '']]","['Network Tomography', 'Network Coding', 'Topology Inference']"
4304,1612.07379,Jhony Heriberto Giraldo Zuluaga,"Jhony-Heriberto Giraldo-Zuluaga, Geman Diez, Alexander Gomez, Tatiana
  Martinez, Mariana Pe\~nuela Vasquez, Jesus Francisco Vargas Bonilla, Augusto
  Salazar","Automatic Identification of Scenedesmus Polymorphic Microalgae from
  Microscopic Images","This is a pre-print of an article published in Pattern Analysis and
  Applications. The final authenticated version is available online at:
  https://doi.org/10.1007/s10044-017-0662-3, Pattern Anal Applic (2017)",,10.1007/s10044-017-0662-3,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Microalgae counting is used to measure biomass quantity. Usually, it is
performed in a manual way using a Neubauer chamber and expert criterion, with
the risk of a high error rate. This paper addresses the methodology for
automatic identification of Scenedesmus microalgae (used in the methane
production and food industry) and applies it to images captured by a digital
microscope. The use of contrast adaptive histogram equalization for
pre-processing, and active contours for segmentation are presented. The
calculation of statistical features (Histogram of Oriented Gradients, Hu and
Zernike moments) with texture features (Haralick and Local Binary Patterns
descriptors) are proposed for algae characterization. Scenedesmus algae can
build coenobia consisting of 1, 2, 4 and 8 cells. The amount of algae of each
coenobium helps to determine the amount of lipids, proteins, and other
substances in a given sample of a algae crop. The knowledge of the quantity of
those elements improves the quality of bioprocess applications. Classification
of coenobia achieves accuracies of 98.63% and 97.32% with Support Vector
Machine (SVM) and Artificial Neural Network (ANN), respectively. According to
the results it is possible to consider the proposed methodology as an
alternative to the traditional technique for algae counting. The database used
in this paper is publicly available for download.
","[{'version': 'v1', 'created': 'Wed, 21 Dec 2016 23:09:01 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Oct 2017 16:13:18 GMT'}]",2017-10-24,"[['Giraldo-Zuluaga', 'Jhony-Heriberto', ''], ['Diez', 'Geman', ''], ['Gomez', 'Alexander', ''], ['Martinez', 'Tatiana', ''], ['Vasquez', 'Mariana Peñuela', ''], ['Bonilla', 'Jesus Francisco Vargas', ''], ['Salazar', 'Augusto', '']]","['Microalgae recognition', 'microorganism classification', 'Scenedesmus']"
4305,1903.00547,Zhihao Jiang,"Zhihao Jiang, Haoyu Zhao",An FPTAS for Stochastic Unbounded Min-Knapsack Problem,24 pages,"In Chen Y., Deng X., Lu M. (eds) Frontiers in Algorithmics. FAW
  2019. Lecture Notes in Computer Science, vol 11458. Springer, Cham",10.1007/978-3-030-18126-0_11,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the stochastic unbounded min-knapsack problem
($\textbf{Min-SUKP}$). The ordinary unbounded min-knapsack problem states that:
There are $n$ types of items, and there is an infinite number of items of each
type. The items of the same type have the same cost and weight. We want to
choose a set of items such that the total weight is at least $W$ and the total
cost is minimized. The \prob~generalizes the ordinary unbounded min-knapsack
problem to the stochastic setting, where the weight of each item is a random
variable following a known distribution and the items of the same type follow
the same weight distribution. In \prob, different types of items may have
different cost and weight distributions. In this paper, we provide an FPTAS for
$\textbf{Min-SUKP}$, i.e., the approximate value our algorithm computes is at
most $(1+\epsilon)$ times the optimum, and our algorithm runs in
$poly(1/\epsilon,n,\log W)$ time.
","[{'version': 'v1', 'created': 'Fri, 1 Mar 2019 21:40:08 GMT'}]",2019-04-16,"[['Jiang', 'Zhihao', ''], ['Zhao', 'Haoyu', '']]","['Stochastic Knapsack', 'Renewal Decision Problem', 'Approximation Algorithms']"
4306,2111.14596,Jun Zhao Dr,Anirudh Ekambaranathan and Jun Zhao and Max Van Kleek,"""Money makes the world go around'': Identifying Barriers to Better
  Privacy in Children's Apps From Developers' Perspectives","15 pages, 4 tables, Proceedings of the 2021 ACM Conference on Human
  Factors in Computing Systems","Proceedings of the 2021 ACM Conference on Human Factors in
  Computing Systems",10.1145/3411764.3445599,,cs.HC cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The industry for children's apps is thriving at the cost of children's
privacy: these apps routinely disclose children's data to multiple data
trackers and ad networks. As children spend increasing time online, such
exposure accumulates to long-term privacy risks. In this paper, we used a
mixed-methods approach to investigate why this is happening and how developers
might change their practices. We base our analysis against 5 leading data
protection frameworks that set out requirements and recommendations for data
collection in children's apps. To understand developers' perspectives and
constraints, we conducted 134 surveys and 20 semi-structured interviews with
popular Android children's app developers. Our analysis revealed that
developers largely respect children's best interests; however, they have to
make compromises due to limited monetisation options, perceived harmlessness of
certain third-party libraries, and lack of availability of design guidelines.
We identified concrete approaches and directions for future research to help
overcome these barriers.
","[{'version': 'v1', 'created': 'Mon, 29 Nov 2021 15:27:55 GMT'}]",2021-11-30,"[['Ekambaranathan', 'Anirudh', ''], ['Zhao', 'Jun', ''], ['Van Kleek', 'Max', '']]","['children’s privacy', 'age-appropriate design', 'developer practices', 'developer values', 'children’s apps']"
4307,1809.03551,Claude Gravel,"Claude Gravel, Daniel Panario, and David Thomson",Unicyclic Strong Permutations,,,10.1007/s12095-019-00384-4,,cs.CR math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study some properties of a certain kind of permutation
$\sigma$ over $\mathbb{F}_{2}^{n}$, where $n$ is a positive integer. The
desired properties for $\sigma$ are: (1) the algebraic degree of each component
function is $n-1$; (2) the permutation is unicyclic; (3) the number of terms of
the algebraic normal form of each component is at least $2^{n-1}$. We call
permutations that satisfy these three properties simultaneously unicyclic
strong permutations. We prove that our permutations $\sigma$ always have high
algebraic degree and that the average number of terms of each component
function tends to $2^{n-1}$. We also give a condition on the cycle structure of
$\sigma$. We observe empirically that for $n$ even, our construction does not
provide unicylic permutations. For $n$ odd, $n \leq 11$, we conduct an
exhaustive search of all $\sigma$ given our construction for specific examples
of unicylic strong permutations. We also present some empirical results on the
difference tables and linear approximation tables of $\sigma$.
","[{'version': 'v1', 'created': 'Mon, 10 Sep 2018 19:03:59 GMT'}, {'version': 'v2', 'created': 'Sat, 30 Mar 2019 13:20:29 GMT'}, {'version': 'v3', 'created': 'Thu, 11 Jul 2019 04:09:18 GMT'}]",2019-07-12,"[['Gravel', 'Claude', ''], ['Panario', 'Daniel', ''], ['Thomson', 'David', '']]","['boolean functions', 'finite fields', 'permutations', 'algebraicdegree', 'differential uniformity', 'Walsh spectra']"
4308,1609.02744,Joseph Antony A,"Joseph Antony, Kevin McGuinness, Neil Welch, Joe Coyle, Andy
  Franklyn-Miller, Noel E. O'Connor, Kieran Moran","An Interactive Segmentation Tool for Quantifying Fat in Lumbar Muscles
  using Axial Lumbar-Spine MRI",,"IRBM 37(1), 11-22 (2016)",10.1016/j.irbm.2015.10.004,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present an interactive tool that can be used to quantify fat
infiltration in lumbar muscles, which is useful in studying fat infiltration
and lower back pain (LBP) in adults. Currently, a qualitative assessment by
visual grading via a 5-point scale is used to study fat infiltration in lumbar
muscles from an axial view of lumbar-spine MR Images. However, a quantitative
approach (on a continuous scale of 0-100\%) may provide a greater insight. In
this paper, we propose a method to precisely quantify the fat deposition /
infiltration in a user-defined region of the lumbar muscles, which may aid
better diagnosis and analysis. The key steps are interactively segmenting the
region of interest (ROI) from the lumbar muscles using the well known livewire
technique, identifying fatty regions in the segmented region based on
variable-selection of threshold and softness levels, automatically detecting
the center of the spinal column and fragmenting the lumbar muscles into smaller
regions with reference to the center of the spinal column, computing key
parameters [such as total and region-wise fat content percentage, total-cross
sectional area (TCSA) and functional cross-sectional area (FCSA)] and exporting
the computations and associated patient information from the MRI, into a
database. A standalone application using MATLAB R2014a was developed to perform
the required computations along with an intuitive graphical user interface
(GUI).
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2016 11:13:58 GMT'}]",2016-09-12,"[['Antony', 'Joseph', ''], ['McGuinness', 'Kevin', ''], ['Welch', 'Neil', ''], ['Coyle', 'Joe', ''], ['Franklyn-Miller', 'Andy', ''], [""O'Connor"", 'Noel E.', ''], ['Moran', 'Kieran', '']]","['lumbar muscles', 'fat infiltration', 'visual grading', 'quantitative approach', 'livewire', 'center of spinal column', 'fat percentage', 'graphical user interface']"
4309,1806.11150,S\'ergio Medeiros,S\'ergio Medeiros and Fabio Mascarenhas,Syntax Error Recovery in Parsing Expression Grammars,Published on ACM Symposium On Applied Computing 2018,,10.1145/3167132.3167261,,cs.PL cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parsing Expression Grammars (PEGs) are a formalism used to describe top-down
parsers with backtracking. As PEGs do not provide a good error recovery
mechanism, PEG-based parsers usually do not recover from syntax errors in the
input, or recover from syntax errors using ad-hoc, implementation-specific
features. The lack of proper error recovery makes PEG parsers unsuitable for
using with Integrated Development Environments (IDEs), which need to build
syntactic trees even for incomplete, syntactically invalid programs.
  We propose a conservative extension, based on PEGs with labeled failures,
that adds a syntax error recovery mechanism for PEGs. This extension associates
recovery expressions to labels, where a label now not only reports a syntax
error but also uses this recovery expression to reach a synchronization point
in the input and resume parsing. We give an operational semantics of PEGs with
this recovery mechanism, and use an implementation based on such semantics to
build a robust parser for the Lua language. We evaluate the effectiveness of
this parser, alone and in comparison with a Lua parser with automatic error
recovery generated by ANTLR, a popular parser generator.
","[{'version': 'v1', 'created': 'Thu, 28 Jun 2018 19:20:06 GMT'}]",2018-07-02,"[['Medeiros', 'Sérgio', ''], ['Mascarenhas', 'Fabio', '']]","['parsing', 'syntax error recovery', 'parsing expression grammars', 'parsercombinators', 'combinator parsing']"
4310,1707.07383,Mustafa Mukadam,"Mustafa Mukadam, Jing Dong, Xinyan Yan, Frank Dellaert and Byron Boots","Continuous-Time Gaussian Process Motion Planning via Probabilistic
  Inference","The International Journal of Robotics Research (IJRR), 2018, Volume
  37, Issue 11",,10.1177/0278364918790369,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a novel formulation of motion planning, for continuous-time
trajectories, as probabilistic inference. We first show how smooth
continuous-time trajectories can be represented by a small number of states
using sparse Gaussian process (GP) models. We next develop an efficient
gradient-based optimization algorithm that exploits this sparsity and GP
interpolation. We call this algorithm the Gaussian Process Motion Planner
(GPMP). We then detail how motion planning problems can be formulated as
probabilistic inference on a factor graph. This forms the basis for GPMP2, a
very efficient algorithm that combines GP representations of trajectories with
fast, structure-exploiting inference via numerical optimization. Finally, we
extend GPMP2 to an incremental algorithm, iGPMP2, that can efficiently replan
when conditions change. We benchmark our algorithms against several
sampling-based and trajectory optimization-based motion planning algorithms on
planning problems in multiple environments. Our evaluation reveals that GPMP2
is several times faster than previous algorithms while retaining robustness. We
also benchmark iGPMP2 on replanning problems, and show that it can find
successful solutions in a fraction of the time required by GPMP2 to replan from
scratch.
","[{'version': 'v1', 'created': 'Mon, 24 Jul 2017 03:00:32 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Sep 2017 16:40:07 GMT'}, {'version': 'v3', 'created': 'Thu, 22 Nov 2018 05:40:37 GMT'}]",2018-11-26,"[['Mukadam', 'Mustafa', ''], ['Dong', 'Jing', ''], ['Yan', 'Xinyan', ''], ['Dellaert', 'Frank', ''], ['Boots', 'Byron', '']]","['Motion planning', 'Gaussian processes', 'probabilistic inference', 'factor graphs', 'trajectory optimization']"
4311,2003.03707,Shuo Yang,"Shuo Yang, Wei Yu, Ying Zheng, Hongxun Yao, Tao Mei",Adaptive Semantic-Visual Tree for Hierarchical Embeddings,,The 27th ACM Multimedia (2019) 2097-2105,10.1145/3343031.3350995,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Merchandise categories inherently form a semantic hierarchy with different
levels of concept abstraction, especially for fine-grained categories. This
hierarchy encodes rich correlations among various categories across different
levels, which can effectively regularize the semantic space and thus make
predictions less ambiguous. However, previous studies of fine-grained image
retrieval primarily focus on semantic similarities or visual similarities. In a
real application, merely using visual similarity may not satisfy the need of
consumers to search merchandise with real-life images, e.g., given a red coat
as a query image, we might get a red suit in recall results only based on
visual similarity since they are visually similar. But the users actually want
a coat rather than suit even the coat is with different color or texture
attributes. We introduce this new problem based on photoshopping in real
practice. That's why semantic information are integrated to regularize the
margins to make ""semantic"" prior to ""visual"". To solve this new problem, we
propose a hierarchical adaptive semantic-visual tree (ASVT) to depict the
architecture of merchandise categories, which evaluates semantic similarities
between different semantic levels and visual similarities within the same
semantic class simultaneously. The semantic information satisfies the demand of
consumers for similar merchandise with the query while the visual information
optimizes the correlations within the semantic class. At each level, we set
different margins based on the semantic hierarchy and incorporate them as prior
information to learn a fine-grained feature embedding. To evaluate our
framework, we propose a new dataset named JDProduct, with hierarchical labels
collected from actual image queries and official merchandise images on an
online shopping application. Extensive experimental results on the public
CARS196 and CUB-
","[{'version': 'v1', 'created': 'Sun, 8 Mar 2020 03:36:42 GMT'}]",2020-03-10,"[['Yang', 'Shuo', ''], ['Yu', 'Wei', ''], ['Zheng', 'Ying', ''], ['Yao', 'Hongxun', ''], ['Mei', 'Tao', '']]","['feature embedding', 'dataset', 'merchandise image retrieval']"
4312,1404.1836,Yazad Baldawala,"Sagar Tirodkar, Yazad Baldawala, Sagar Ulane, Ashok Jori",Improved 3-Dimensional Security in Cloud Computing,"6 Pages, 10 Figures, Published with International Journal of Computer
  Trends and Technology (IJCTT)","International Journal of Computer Trends and Technology (IJCTT)
  V9(5):242-247, March 2014. Published by Seventh Sense Research Group",10.14445/22312803/IJCTT-V9P145,,cs.CR cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing is a trending technology in the field of Information
Technology as it allows sharing of resources over a network. The reason Cloud
computing gained traction so rapidly was because of its performance,
availability and low cost among other features. Besides these features,
companies are still refraining from binding their business with cloud computing
due to the fear of data leakage. The focus of this paper is on the problem of
data leakage. It proposes a framework which works in two phases. The first
phase consists of data encryption and classification which is performed before
storing the data. In this phase, the client may want to encrypt his data prior
to uploading. After encryption, data is classified using three parameters
namely Confidentiality [C], Integrity [I] and Availability [A]. With the help
of proposed algorithm, criticality rating (Cr) of the data is calculated.
According to the Cr, security will be provided on the basis of the 3 Dimensions
proposed in this paper. The second phase consists of data retrieval by the
client. As per the concept of 3D, users who want to access their data need to
be authenticated, to avoid data from being compromised. Before every access to
data, the users identity is verified for authorization. After the user is
authorized for data access, if the data is encrypted, the user can decrypt the
same.
","[{'version': 'v1', 'created': 'Mon, 7 Apr 2014 16:25:15 GMT'}]",2014-04-08,"[['Tirodkar', 'Sagar', ''], ['Baldawala', 'Yazad', ''], ['Ulane', 'Sagar', ''], ['Jori', 'Ashok', '']]","['Availability', 'Cloud Security', 'Confidentiality', 'Data Leakage', 'Decryption', 'Encryption', 'Integrity']"
4313,1809.06656,Boleslaw Szymanski,"Jaroslaw Jankowski, Boleslaw K. Szymanski, Przemyslaw Kazienko,
  Radoslaw Michalski, Piotr Brodka",Probing Limits of Information Spread with Sequential Seeding,,"Scientific Reports, 8:13966, Sept. 2018",10.1038/S41598-018-32081-2,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider here information spread which propagates with certain probability
from nodes just activated to their not yet activated neighbors. Diffusion
cascades can be triggered by activation of even a small set of nodes. Such
activation is commonly performed in a single stage. A novel approach based on
sequential seeding is analyzed here resulting in three fundamental
contributions. First, we propose a coordinated execution of randomized choices
to enable precise comparison of different algorithms in general. We apply it
here when the newly activated nodes at each stage of spreading attempt to
activate their neighbors. Then, we present a formal proof that sequential
seeding delivers at least as large coverage as the single stage seeding does.
Moreover, we also show that, under modest assumptions, sequential seeding
achieves coverage provably better than the single stage based approach using
the same number of seeds and node ranking. Finally, we present experimental
results showing how single stage and sequential approaches on directed and
undirected graphs compare to the well-known greedy approach to provide the
objective measure of the sequential seeding benefits. Surprisingly, applying
sequential seeding to a simple degree-based selection leads to higher coverage
than achieved by the computationally expensive greedy approach currently
considered to be the best heuristic.
","[{'version': 'v1', 'created': 'Tue, 18 Sep 2018 12:00:57 GMT'}]",2018-09-20,"[['Jankowski', 'Jaroslaw', ''], ['Szymanski', 'Boleslaw K.', ''], ['Kazienko', 'Przemyslaw', ''], ['Michalski', 'Radoslaw', ''], ['Brodka', 'Piotr', '']]","['diffusion', 'social network', 'seed selection', 'influence maximization', 'sequential seeding']"
4314,1610.00327,Chen Hajaj,"Chen Hajaj, Noam Hazon and David Sarne","Improving Comparison Shopping Agents' Competence through Selective Price
  Disclosure","20 pages, 20 figures, 4 tables, Electronic Commerce Research and
  Applications 2015","Electronic Commerce Research and Applications Volume 14, Issue 6,
  October-November 2015, Pages 563-581",10.1016/j.elerap.2015.08.006,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The plethora of comparison shopping agents (CSAs) in today's markets enables
buyers to query more than a single CSA when shopping, and an inter-CSAs
competition naturally arises. We suggest a new approach, termed ""selective
price disclosure"", which improves the attractiveness of a CSA by removing some
of the prices in the outputted list. The underlying idea behind this approach
is to affect the buyer's beliefs regarding the chance of obtaining more
attractive prices. The paper presents two methods, which are suitable for
fully-rational buyers, for deciding which prices among those known to the CSA
should be disclosed. The effectiveness and efficiency of the methods are
evaluated using real data collected from five CSAs. The methods are also
evaluated with human subjects, showing that selective price disclosure can be
highly effective in this case as well, however, the disclosed subset of prices
should be extracted in a different (simplistic) manner.
","[{'version': 'v1', 'created': 'Sun, 2 Oct 2016 18:15:10 GMT'}]",2016-11-08,"[['Hajaj', 'Chen', ''], ['Hazon', 'Noam', ''], ['Sarne', 'David', '']]","['E-commerce', 'Comparison shopping agents', 'Information disclosure', 'Belief']"
4315,1808.05205,Ken C. L. Wong,"Ken C. L. Wong, Tanveer Syeda-Mahmood, Mehdi Moradi","Building medical image classifiers with very limited data using
  segmentation networks",This paper was accepted by Medical Image Analysis,Medical Image Analysis 49 (2018) 105-116,10.1016/j.media.2018.07.010,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning has shown promising results in medical image analysis, however,
the lack of very large annotated datasets confines its full potential. Although
transfer learning with ImageNet pre-trained classification models can alleviate
the problem, constrained image sizes and model complexities can lead to
unnecessary increase in computational cost and decrease in performance. As many
common morphological features are usually shared by different classification
tasks of an organ, it is greatly beneficial if we can extract such features to
improve classification with limited samples. Therefore, inspired by the idea of
curriculum learning, we propose a strategy for building medical image
classifiers using features from segmentation networks. By using a segmentation
network pre-trained on similar data as the classification task, the machine can
first learn the simpler shape and structural concepts before tackling the
actual classification problem which usually involves more complicated concepts.
Using our proposed framework on a 3D three-class brain tumor type
classification problem, we achieved 82% accuracy on 191 testing samples with 91
training samples. When applying to a 2D nine-class cardiac semantic level
classification problem, we achieved 86% accuracy on 263 testing samples with
108 training samples. Comparisons with ImageNet pre-trained classifiers and
classifiers trained from scratch are presented.
","[{'version': 'v1', 'created': 'Wed, 15 Aug 2018 17:52:09 GMT'}]",2018-08-16,"[['Wong', 'Ken C. L.', ''], ['Syeda-Mahmood', 'Tanveer', ''], ['Moradi', 'Mehdi', '']]","['image segmentation', 'image classification', 'deep learning', 'transfer learning', 'convolutional neuralnetwork', 'fully convolutional network']"
4316,1609.06568,Kar Wai Lim,"Kar Wai Lim, Scott Sanner, Shengbo Guo","On the Mathematical Relationship between Expected n-call@k and the
  Relevance vs. Diversity Trade-off",SIGIR short paper,"Proceedings of the 35th Annual ACM SIG Information Retrieval
  Conference (SIGIR), pp. 1117-1118. ACM. 2012",10.1145/2348283.2348497,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It has been previously noted that optimization of the n-call@k relevance
objective (i.e., a set-based objective that is 1 if at least n documents in a
set of k are relevant, otherwise 0) encourages more result set diversification
for smaller n, but this statement has never been formally quantified. In this
work, we explicitly derive the mathematical relationship between expected
n-call@k and the relevance vs. diversity trade-off --- through fortuitous
cancellations in the resulting combinatorial optimization, we show the
trade-off is a simple and intuitive function of n (notably independent of the
result set size k e n), where diversification increases as n approaches 1.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2016 14:11:27 GMT'}]",2016-09-22,"[['Lim', 'Kar Wai', ''], ['Sanner', 'Scott', ''], ['Guo', 'Shengbo', '']]","['diversity', 'set-based relevance', 'maximal marginal relevance']"
4317,1809.07294,Xin Yi,"Xin Yi, Ekta Walia, Paul Babyn",Generative Adversarial Network in Medical Imaging: A Review,"24 pages; v4; added missing references from before Jan 1st 2019;
  accepted to MedIA",,10.1016/j.media.2019.101552,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generative adversarial networks have gained a lot of attention in the
computer vision community due to their capability of data generation without
explicitly modelling the probability density function. The adversarial loss
brought by the discriminator provides a clever way of incorporating unlabeled
samples into training and imposing higher order consistency. This has proven to
be useful in many cases, such as domain adaptation, data augmentation, and
image-to-image translation. These properties have attracted researchers in the
medical imaging community, and we have seen rapid adoption in many traditional
and novel applications, such as image reconstruction, segmentation, detection,
classification, and cross-modality synthesis. Based on our observations, this
trend will continue and we therefore conducted a review of recent advances in
medical imaging using the adversarial training scheme with the hope of
benefiting researchers interested in this technique.
","[{'version': 'v1', 'created': 'Wed, 19 Sep 2018 16:44:36 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Mar 2019 16:17:34 GMT'}, {'version': 'v3', 'created': 'Tue, 2 Jul 2019 20:29:29 GMT'}, {'version': 'v4', 'created': 'Wed, 4 Sep 2019 01:01:58 GMT'}]",2019-09-05,"[['Yi', 'Xin', ''], ['Walia', 'Ekta', ''], ['Babyn', 'Paul', '']]","['Deep learning', 'Generative adversarial network', 'Generative model', 'Medical imaging', 'Review']"
4318,1901.09292,Najwa Kouka,"Najwa Kouka, Raja Fdhila and Adel M. Alimi","Multi Objective Particle Swarm Optimization based Cooperative Agents
  with Automated Negotiation",,,10.1007/978-3-319-70093-9_28,,cs.NE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper investigates a new hybridization of multi-objective particle swarm
optimization (MOPSO) and cooperative agents (MOPSO-CA) to handle the problem of
stagnation encounters in MOPSO, which leads solutions to trap in local optima.
The proposed approach involves a new distribution strategy based on the idea of
having a set of a sub-population, each of which is processed by one agent. The
number of the sub-population and agents are adjusted dynamically through the
Pareto ranking. This method allocates a dynamic number of sub-population as
required to improve diversity in the search space. Additionally, agents are
used for better management for the exploitation within a sub-population, and
for exploration among sub-populations. Furthermore, we investigate the
automated negotiation within agents in order to share the best knowledge. To
validate our approach, several benchmarks are performed. The results show that
the introduced variant ensures the trade-off between the exploitation and
exploration with respect to the comparative algorithms
","[{'version': 'v1', 'created': 'Sun, 27 Jan 2019 00:27:56 GMT'}]",2019-01-29,"[['Kouka', 'Najwa', ''], ['Fdhila', 'Raja', ''], ['Alimi', 'Adel M.', '']]","['Multi Objective Optimization Problems', 'Particle Swarm Optimization', 'Multi Agent System', 'Distributed Architecture', 'Automated Negotiation']"
4319,1702.08817,Stefano Bennati,"Stefano Bennati, Evangelos Pournaras","Privacy-enhancing Aggregation of Internet of Things Data via Sensors
  Grouping",,,10.1016/j.scs.2018.02.013,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Big data collection practices using Internet of Things (IoT) pervasive
technologies are often privacy-intrusive and result in surveillance, profiling,
and discriminatory actions over citizens that in turn undermine the
participation of citizens to the development of sustainable smart cities.
Nevertheless, real-time data analytics and aggregate information from IoT
devices open up tremendous opportunities for managing smart city
infrastructures. The privacy-enhancing aggregation of distributed sensor data,
such as residential energy consumption or traffic information, is the research
focus of this paper. Citizens have the option to choose their privacy level by
reducing the quality of the shared data at a cost of a lower accuracy in data
analytics services. A baseline scenario is considered in which IoT sensor data
are shared directly with an untrustworthy central aggregator. A grouping
mechanism is introduced that improves privacy by sharing data aggregated first
at a group level compared as opposed to sharing data directly to the central
aggregator. Group-level aggregation obfuscates sensor data of individuals, in a
similar fashion as differential privacy and homomorphic encryption schemes,
thus inference of privacy-sensitive information from single sensors becomes
computationally harder compared to the baseline scenario. The proposed system
is evaluated using real-world data from two smart city pilot projects. Privacy
under grouping increases, while preserving the accuracy of the baseline
scenario. Intra-group influences of privacy by one group member on the other
ones are measured and fairness on privacy is found to be maximized between
group members with similar privacy choices. Several grouping strategies are
compared. Grouping by proximity of privacy choices provides the highest privacy
gains. The implications of the strategy on the design of incentives mechanisms
are discussed.
","[{'version': 'v1', 'created': 'Tue, 28 Feb 2017 15:14:24 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Aug 2017 09:56:58 GMT'}, {'version': 'v3', 'created': 'Sun, 24 Dec 2017 11:27:47 GMT'}, {'version': 'v4', 'created': 'Thu, 1 Mar 2018 10:34:01 GMT'}]",2018-05-24,"[['Bennati', 'Stefano', ''], ['Pournaras', 'Evangelos', '']]","['privacy', 'Internet of Things', 'Smart City', 'network', 'sensor', 'grouping', 'agent', 'aggregation']"
4320,0804.0524,Uwe Aickelin,Jingpeng Li and Uwe Aickelin,Bayesian Optimisation Algorithm for Nurse Scheduling,,"Scalable Optimization via Probabilistic Modeling: From Algorithms
  to Applications (Studies in Computational Intelligence), edited by M Pelikan,
  K Sastry and E Cantu Paz, Chapter 17, pp 315-332, Springer, 2006",10.1007/978-3-540-34954-9_14,,cs.NE cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our research has shown that schedules can be built mimicking a human
scheduler by using a set of rules that involve domain knowledge. This chapter
presents a Bayesian Optimization Algorithm (BOA) for the nurse scheduling
problem that chooses such suitable scheduling rules from a set for each nurses
assignment. Based on the idea of using probabilistic models, the BOA builds a
Bayesian network for the set of promising solutions and samples these networks
to generate new candidate solutions. Computational results from 52 real data
instances demonstrate the success of this approach. It is also suggested that
the learning mechanism in the proposed algorithm may be suitable for other
scheduling problems.
","[{'version': 'v1', 'created': 'Thu, 3 Apr 2008 11:14:11 GMT'}]",2010-07-05,"[['Li', 'Jingpeng', ''], ['Aickelin', 'Uwe', '']]","['Nurse Scheduling', 'Bayesian Optimization Algorithm', 'Probabilistic Modeling']"
4321,2203.00638,Wentao Zhang,"Wentao Zhang, Yu Shen, Zheyu Lin, Yang Li, Xiaosen Li, Wen Ouyang,
  Yangyu Tao, Zhi Yang, Bin Cui","PaSca: a Graph Neural Architecture Search System under the Scalable
  Paradigm","13 pages, 8 figures. arXiv admin note: text overlap with
  arXiv:2104.09880",The ACM Web Conference 2022,10.1145/3485447.3511986,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph neural networks (GNNs) have achieved state-of-the-art performance in
various graph-based tasks. However, as mainstream GNNs are designed based on
the neural message passing mechanism, they do not scale well to data size and
message passing steps. Although there has been an emerging interest in the
design of scalable GNNs, current researches focus on specific GNN design,
rather than the general design space, limiting the discovery of potential
scalable GNN models. This paper proposes PasCa, a new paradigm and system that
offers a principled approach to systemically construct and explore the design
space for scalable GNNs, rather than studying individual designs. Through
deconstructing the message passing mechanism, PasCa presents a novel Scalable
Graph Neural Architecture Paradigm (SGAP), together with a general architecture
design space consisting of 150k different designs. Following the paradigm, we
implement an auto-search engine that can automatically search well-performing
and scalable GNN architectures to balance the trade-off between multiple
criteria (e.g., accuracy and efficiency) via multi-objective optimization.
Empirical studies on ten benchmark datasets demonstrate that the representative
instances (i.e., PasCa-V1, V2, and V3) discovered by our system achieve
consistent performance among competitive baselines. Concretely, PasCa-V3
outperforms the state-of-the-art GNN method JK-Net by 0.4\% in terms of
predictive accuracy on our large industry dataset while achieving up to
$28.3\times$ training speedups.
","[{'version': 'v1', 'created': 'Tue, 1 Mar 2022 17:26:50 GMT'}]",2022-03-02,"[['Zhang', 'Wentao', ''], ['Shen', 'Yu', ''], ['Lin', 'Zheyu', ''], ['Li', 'Yang', ''], ['Li', 'Xiaosen', ''], ['Ouyang', 'Wen', ''], ['Tao', 'Yangyu', ''], ['Yang', 'Zhi', ''], ['Cui', 'Bin', '']]","['Graph Neural Networks', 'Scalable Graph Learning', 'Design Space']"
4322,0912.5494,Serguei Mokhov,"Miao Song, Serguei A. Mokhov and Peter Grogono",Teaching Physical Based Animation via OpenGL Slides,"12 pages; 7 figures; the poster is presented at C32SE'09 and the
  paper at CISSE'09 at http://conference.cisse2009.org/proceedings.aspx ; there
  are an executable demo and its source code",,10.1007/978-90-481-9112-3_82 10.1145/1557626.1557647,,cs.GR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work expands further our earlier poster presentation and integration of
the OpenGL Slides Framework (OGLSF) - to make presentations with real-time
animated graphics where each slide is a scene with tidgets - and physical based
animation of elastic two-, three-layer softbody objects. The whole project is
very interactive, and serves dual purpose - delivering the teaching material in
a classroom setting with real running animated examples as well as releasing
the source code to the students to show how the actual working things are made.
","[{'version': 'v1', 'created': 'Wed, 30 Dec 2009 17:53:18 GMT'}]",2010-07-06,"[['Song', 'Miao', ''], ['Mokhov', 'Serguei A.', ''], ['Grogono', 'Peter', '']]","['education', 'presentation', 'softbody', 'real-time', 'frameworks', 'OpenGL', 'physical-based modeling']"
4323,2111.08195,Tianyue Zheng,"Tianyue Zheng, Zhe Chen, Shujie Zhang, Chao Cai, Jun Luo","MoRe-Fi: Motion-robust and Fine-grained Respiration Monitoring via
  Deep-Learning UWB Radar",14 pages,"SenSys '21: Proceedings of the 19th ACM Conference on Embedded
  Networked Sensor Systems November 2021",10.1145/3485730.3485932,,cs.LG eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crucial for healthcare and biomedical applications, respiration monitoring
often employs wearable sensors in practice, causing inconvenience due to their
direct contact with human bodies. Therefore, researchers have been constantly
searching for contact-free alternatives. Nonetheless, existing contact-free
designs mostly require human subjects to remain static, largely confining their
adoptions in everyday environments where body movements are inevitable.
Fortunately, radio-frequency (RF) enabled contact-free sensing, though
suffering motion interference inseparable by conventional filtering, may offer
a potential to distill respiratory waveform with the help of deep learning. To
realize this potential, we introduce MoRe-Fi to conduct fine-grained
respiration monitoring under body movements. MoRe-Fi leverages an IR-UWB radar
to achieve contact-free sensing, and it fully exploits the complex radar signal
for data augmentation. The core of MoRe-Fi is a novel variational
encoder-decoder network; it aims to single out the respiratory waveforms that
are modulated by body movements in a non-linear manner. Our experiments with 12
subjects and 66-hour data demonstrate that MoRe-Fi accurately recovers
respiratory waveform despite the interference caused by body movements. We also
discuss potential applications of MoRe-Fi for pulmonary disease diagnoses.
","[{'version': 'v1', 'created': 'Tue, 16 Nov 2021 02:48:16 GMT'}]",2021-11-17,"[['Zheng', 'Tianyue', ''], ['Chen', 'Zhe', ''], ['Zhang', 'Shujie', ''], ['Cai', 'Chao', ''], ['Luo', 'Jun', '']]","['Respiratory waveform recovery', 'contact-free RF-sensing', 'commercialgrade radars', 'deep learning', 'variational encoder-decoder']"
4324,1810.08983,Pedro Hecht,Pedro Hecht,"PQC: Triple Decomposition Problem Applied To GL(d, Fp) - A Secure
  Framework For Canonical Non-Commutative Cryptography","9 pages, 1 Appendix included, 8 Tables",,10.13140/RG.2.2.23240.78082,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Post-Quantum Cryptography (PQC) attempts to find cryptographic protocols
resistant to attacks using Shor polynomial time algorithm for numerical field
problems or Grover search algorithm. A mostly overlooked but valuable line of
solutions is provided by non-commutative algebraic structures, specifically
canonical protocols that rely on one-way trapdoor functions (OWTF). Here we
develop an algebraic framework who could be applied to different asymmetric
protocols like D-H KE (Diffie-Hellman key exchange), Public Key Encryption,
Digital Signature, ZKP (zero-knowledge proof) authentication, Oblivious
Transfer, Multi-Party Computing, and so on. The trapdoor one-way functions
selected are (a) Triple decomposition Problem (TDP) developed by Kurt, where a
known element is factored into a product of three unknown factors and (b) a new
version of conjugacy search that we refer from now on as Blind Conjugacy Search
Problem (BCSP). Our platform structure is the general linear group GL(d,F_p)
d-square non-singular matrices of prime field values. We give support to the
fact that this framework is cryptographically secure against classical attacks
like linear algebra attacks, length-based attacks, side-channel attacks against
square (or duplicate) and multiply (or sum) algorithm, high sensitivity to
pseudo random deterministic generators, etc. At same time it is immune against
quantum attacks (using Grover and Shor), if the size parameters are carefully
selected. Semantic security and IND-CCA2 compliance for this framework is
discussed.
","[{'version': 'v1', 'created': 'Sun, 21 Oct 2018 15:57:22 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Oct 2018 10:42:56 GMT'}]",2018-10-26,"[['Hecht', 'Pedro', '']]","['Post-Quantum Cryptography', 'Non-Commutative Cryptography', 'General Linear Group', 'Linear Algebra', 'Triple Decomposition Problem', 'OWTF', 'IND-CCA2']"
4325,1507.07301,James J.Q. Yu,James J.Q. Yu and Victor O.K. Li,"A Social Spider Algorithm for Solving the Non-convex Economic Load
  Dispatch Problem",,,10.1016/j.neucom.2015.07.037,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Economic Load Dispatch (ELD) is one of the essential components in power
system control and operation. Although conventional ELD formulation can be
solved using mathematical programming techniques, modern power system
introduces new models of the power units which are non-convex,
non-differentiable, and sometimes non-continuous. In order to solve such
non-convex ELD problems, in this paper we propose a new approach based on the
Social Spider Algorithm (SSA). The classical SSA is modified and enhanced to
adapt to the unique characteristics of ELD problems, e.g., valve-point effects,
multi-fuel operations, prohibited operating zones, and line losses. To
demonstrate the superiority of our proposed approach, five widely-adopted test
systems are employed and the simulation results are compared with the
state-of-the-art algorithms. In addition, the parameter sensitivity is
illustrated by a series of simulations. The simulation results show that SSA
can solve ELD problems effectively and efficiently.
","[{'version': 'v1', 'created': 'Mon, 27 Jul 2015 05:30:15 GMT'}]",2015-07-28,"[['Yu', 'James J. Q.', ''], ['Li', 'Victor O. K.', '']]","['Economic load dispatch', 'Social spider algorithm', 'non-convex optimization', 'valve-point effect']"
4326,2005.00886,Salvatore D'Oro,"Salvatore D'Oro, Leonardo Bonati, Francesco Restuccia, Michele Polese,
  Michele Zorzi and Tommaso Melodia",Sl-EDGE: Network Slicing at the Edge,,ACM Mobihoc 2020,10.1145/3397166.3409133,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network slicing of multi-access edge computing (MEC) resources is expected to
be a pivotal technology to the success of 5G networks and beyond. The key
challenge that sets MEC slicing apart from traditional resource allocation
problems is that edge nodes depend on tightly-intertwined and
strictly-constrained networking, computation and storage resources. Therefore,
instantiating MEC slices without incurring in resource over-provisioning is
hardly addressable with existing slicing algorithms. The main innovation of
this paper is Sl-EDGE, a unified MEC slicing framework that allows network
operators to instantiate heterogeneous slice services (e.g., video streaming,
caching, 5G network access) on edge devices. We first describe the architecture
and operations of Sl-EDGE, and then show that the problem of optimally
instantiating joint network-MEC slices is NP-hard. Thus, we propose
near-optimal algorithms that leverage key similarities among edge nodes and
resource virtualization to instantiate heterogeneous slices 7.5x faster and
within 0.25 of the optimum. We first assess the performance of our algorithms
through extensive numerical analysis, and show that Sl-EDGE instantiates slices
6x more efficiently then state-of-the-art MEC slicing algorithms. Furthermore,
experimental results on a 24-radio testbed with 9 smartphones demonstrate that
Sl-EDGE provides at once highly-efficient slicing of joint LTE connectivity,
video streaming over WiFi, and ffmpeg video transcoding.
","[{'version': 'v1', 'created': 'Sat, 2 May 2020 16:56:45 GMT'}]",2022-02-23,"[[""D'Oro"", 'Salvatore', ''], ['Bonati', 'Leonardo', ''], ['Restuccia', 'Francesco', ''], ['Polese', 'Michele', ''], ['Zorzi', 'Michele', ''], ['Melodia', 'Tommaso', '']]","['Network Slicing', '5G', 'Multi-access Edge Computing (MEC)', 'RadioAccess Network (RAN)']"
4327,1801.04618,Adrien Guatto,"Adrien Guatto, Sam Westrick, Ram Raghunathan, Umut Acar, Matthew Fluet",Hierarchical Memory Management for Mutable State,"15 pages, 14 figures, PPoPP 2018",,10.1145/3178487.3178494,,cs.PL cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is well known that modern functional programming languages are naturally
amenable to parallel programming. Achieving efficient parallelism using
functional languages, however, remains difficult. Perhaps the most important
reason for this is their lack of support for efficient in-place updates, i.e.,
mutation, which is important for the implementation of both parallel algorithms
and the run-time system services (e.g., schedulers and synchronization
primitives) used to execute them.
  In this paper, we propose techniques for efficient mutation in parallel
functional languages. To this end, we couple the memory manager with the thread
scheduler to make reading and updating data allocated by nested threads
efficient. We describe the key algorithms behind our technique, implement them
in the MLton Standard ML compiler, and present an empirical evaluation. Our
experiments show that the approach performs well, significantly improving
efficiency over existing functional language implementations.
","[{'version': 'v1', 'created': 'Sun, 14 Jan 2018 22:25:44 GMT'}, {'version': 'v2', 'created': 'Sun, 18 Feb 2018 11:00:48 GMT'}]",2018-02-20,"[['Guatto', 'Adrien', ''], ['Westrick', 'Sam', ''], ['Raghunathan', 'Ram', ''], ['Acar', 'Umut', ''], ['Fluet', 'Matthew', '']]","['parallel functional language implementation', 'garbage collection', 'hierarchical heaps', 'mutation', 'promotion']"
4328,1803.07780,Huy-Hieu Pham,"Huy-Hieu Pham, Louahdi Khoudour, Alain Crouzil, Pablo Zegers, and
  Sergio A. Velastin","Learning and Recognizing Human Action from Skeleton Movement with Deep
  Residual Neural Networks","The 8th International Conference of Pattern Recognition Systems
  (ICPRS 2017), Madrid, Spain",,10.1049/cp.2017.0154,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Automatic human action recognition is indispensable for almost artificial
intelligent systems such as video surveillance, human-computer interfaces,
video retrieval, etc. Despite a lot of progress, recognizing actions in an
unknown video is still a challenging task in computer vision. Recently, deep
learning algorithms have proved its great potential in many vision-related
recognition tasks. In this paper, we propose the use of Deep Residual Neural
Networks (ResNets) to learn and recognize human action from skeleton data
provided by Kinect sensor. Firstly, the body joint coordinates are transformed
into 3D-arrays and saved in RGB images space. Five different deep learning
models based on ResNet have been designed to extract image features and
classify them into classes. Experiments are conducted on two public video
datasets for human action recognition containing various challenges. The
results show that our method achieves the state-of-the-art performance
comparing with existing approaches.
","[{'version': 'v1', 'created': 'Wed, 21 Mar 2018 07:43:44 GMT'}]",2018-03-22,"[['Pham', 'Huy-Hieu', ''], ['Khoudour', 'Louahdi', ''], ['Crouzil', 'Alain', ''], ['Zegers', 'Pablo', ''], ['Velastin', 'Sergio A.', '']]","['Action recognition', 'ResNet', 'Skeleton', 'Kinect']"
4329,1807.11112,Huy Tu,Huy Tu and Vivek Nair,Is One Hyperparameter Optimizer Enough?,"7 pages, 2 columns, accepted for SWAN18",,10.1145/3278142.3278145,,cs.AI cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hyperparameter tuning is the black art of automatically finding a good
combination of control parameters for a data miner. While widely applied in
empirical Software Engineering, there has not been much discussion on which
hyperparameter tuner is best for software analytics. To address this gap in the
literature, this paper applied a range of hyperparameter optimizers (grid
search, random search, differential evolution, and Bayesian optimization) to
defect prediction problem. Surprisingly, no hyperparameter optimizer was
observed to be `best' and, for one of the two evaluation measures studied here
(F-measure), hyperparameter optimization, in 50\% cases, was no better than
using default configurations.
  We conclude that hyperparameter optimization is more nuanced than previously
believed. While such optimization can certainly lead to large improvements in
the performance of classifiers used in software analytics, it remains to be
seen which specific optimizers should be applied to a new dataset.
","[{'version': 'v1', 'created': 'Sun, 29 Jul 2018 21:26:12 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Aug 2018 17:33:25 GMT'}, {'version': 'v3', 'created': 'Wed, 5 Sep 2018 21:56:46 GMT'}, {'version': 'v4', 'created': 'Tue, 2 Oct 2018 19:30:21 GMT'}]",2018-10-04,"[['Tu', 'Huy', ''], ['Nair', 'Vivek', '']]","['Defect Prediction', 'SBSE', 'Hyperparameter Tuning']"
4330,1811.01692,Carmine Dodaro,Carmine Dodaro and Francesco Ricca,The External Interface for Extending WASP,"22 pages, 1 figure, Under consideration in Theory and Practice of
  Logic Programming (TPLP)",Theory and Practice of Logic Programming 20 (2020) 225-248,10.1017/S1471068418000558,,cs.LO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Answer set programming (ASP) is a successful declarative formalism for
knowledge representation and reasoning. The evaluation of ASP programs is
nowadays based on the Conflict-Driven Clause Learning (CDCL) backtracking
search algorithm. Recent work suggested that the performance of CDCL-based
implementations can be considerably improved on specific benchmarks by
extending their solving capabilities with custom heuristics and propagators.
However, embedding such algorithms into existing systems requires expert
knowledge of the internals of ASP implementations. The development of effective
solver extensions can be made easier by providing suitable programming
interfaces. In this paper, we present the interface for extending the
CDCL-based ASP solver WASP. The interface is both general, i.e. it can be used
for providing either new branching heuristics and propagators, and external,
i.e. the implementation of new algorithms requires no internal modifications of
WASP. Moreover, we review the applications of the interface witnessing it can
be successfully used to extend WASP for solving effectively hard instances of
both real-world and synthetic problems. Under consideration in Theory and
Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Mon, 5 Nov 2018 14:04:48 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Nov 2018 09:58:31 GMT'}]",2020-02-19,"[['Dodaro', 'Carmine', ''], ['Ricca', 'Francesco', '']]","['Knowledge Representation and Reasoning', 'Answer Set Programming', 'Application Programming Interface', 'Propagators', 'Choice Heuristics']"
4331,1812.05320,Zineb Mcharfi,"Zineb Mcharfi, Bouchra El Asri and Abdelaziz Kriouile","A Dynamic Tracing Model for Agile Software Product Lines Domain
  Engineering from Features to Structural Elements: An Approach Based on
  Dynamic Routing","8 pages, 3 figures","International Journal of Computer Science Issues (IJCSI), volume
  13 Issue 5 (September 2016) 94-101",10.20943/01201605.94101,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Even if the benefit of implementing Software Product Lines is well
established, adopting such a large system is still a complex choice to make: it
is hard to implement, needs a good knowledge of market growth and a clear
vision of the enterprise objectives for long term. Therefore, many companies
remain unwilling to adopt such an approach, unless they gain flexibility and
get guarantees. Flexibility can be achieved by adopting an Agile Software
Product Line approach, to make sure changes are rapidly implemented and product
adapted to market evolution. Guarantees can be acquired by tracing elements and
the relations between them. However, tracing in Agile Software Product Line
context still needs to gain maturity as it is costly and therefore rarely
adopted. In this paper, we discuss the added value of traceability for Agile
Software Product Lines, and present our tracing model inspired from dynamic
network routing.
","[{'version': 'v1', 'created': 'Thu, 13 Dec 2018 09:06:35 GMT'}]",2018-12-14,"[['Mcharfi', 'Zineb', ''], ['Asri', 'Bouchra El', ''], ['Kriouile', 'Abdelaziz', '']]","['Software Product Lines', 'Agile Software Product Lines', 'traceability', 'trace model', 'dynamic routing']"
4332,1505.00449,Jin-Kao Hao,"Yan Jin, Jean-Philippe Hamiez, Jin-Kao Hao",Algorithms for the minimum sum coloring problem: a review,,,10.1007/s10462-016-9485-7,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Minimum Sum Coloring Problem (MSCP) is a variant of the well-known vertex
coloring problem which has a number of AI related applications. Due to its
theoretical and practical relevance, MSCP attracts increasing attention. The
only existing review on the problem dates back to 2004 and mainly covers the
history of MSCP and theoretical developments on specific graphs. In recent
years, the field has witnessed significant progresses on approximation
algorithms and practical solution algorithms. The purpose of this review is to
provide a comprehensive inspection of the most recent and representative MSCP
algorithms. To be informative, we identify the general framework followed by
practical solution algorithms and the key ingredients that make them
successful. By classifying the main search strategies and putting forward the
critical elements of the reviewed methods, we wish to encourage future
development of more powerful methods and motivate new applications.
","[{'version': 'v1', 'created': 'Sun, 3 May 2015 16:48:38 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Jun 2016 19:33:42 GMT'}]",2016-06-14,"[['Jin', 'Yan', ''], ['Hamiez', 'Jean-Philippe', ''], ['Hao', 'Jin-Kao', '']]","['Sum coloring', 'Approximation algorithms', 'Heuristics and metaheuristics', 'Local search', 'Evolutionary algorithms']"
4333,1107.2126,Sahin Emrah Amrahov,\c{S}ahin Emrah Amrahov and Iman N. Askerzade,Strong Solutions of the Fuzzy Linear Systems,11 pages,"CMES: Computer Modeling in Engineering & Sciences, Vol. 76, No. 4,
  pp. 207-216, 2011",10.3970/cmes.2011.076.207,,cs.NA cs.AI cs.IT math.IT math.LO math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a fuzzy linear system with crisp coefficient matrix and with an
arbitrary fuzzy number in parametric form on the right-hand side. It is known
that the well-known existence and uniqueness theorem of a strong fuzzy solution
is equivalent to the following: The coefficient matrix is the product of a
permutation matrix and a diagonal matrix. This means that this theorem can be
applicable only for a special form of linear systems, namely, only when the
system consists of equations, each of which has exactly one variable. We prove
an existence and uniqueness theorem, which can be use on more general systems.
The necessary and sufficient conditions of the theorem are dependent on both
the coefficient matrix and the right-hand side. This theorem is a
generalization of the well-known existence and uniqueness theorem for the
strong solution.
","[{'version': 'v1', 'created': 'Mon, 11 Jul 2011 20:04:01 GMT'}, {'version': 'v2', 'created': 'Sun, 21 Aug 2011 06:12:18 GMT'}]",2011-11-01,"[['Amrahov', 'Şahin Emrah', ''], ['Askerzade', 'Iman N.', '']]","['Fuzzy linear system', 'Fuzzy number', 'Strong solution', 'Nonnegative matrix']"
4334,1307.8257,Mauro Femminella,"Mauro Femminella, Francesco Giacinti, and Gianluca Reali",Enhancing Java Call Control with Media Server Control functions,"Accepted for publication in IEEE Communications Magazine, Design and
  Implementation (D&I) Series",,10.1109/MCOM.2013.6619577,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel abstraction layer for application service
implementation compliant with the Java Call Control (JCC) specifications. It
simplifies creation of multimedia services using the Session Initiation
Protocol (SIP) and the Media Gateway Control Protocol (MGCP). In order to show
its effectiveness, we have implemented a JCC Resource Adaptor for a JAIN
Service Logic Execution Environment (JSLEE), using the Mobicents application
server, which is the only existing open source JSLEE implementation.
Experimental results, obtained by implementing a complex VoIP service, show
both a significant simplification of service implementation and improved
performance over legacy solutions.
","[{'version': 'v1', 'created': 'Wed, 31 Jul 2013 09:20:25 GMT'}]",2016-11-15,"[['Femminella', 'Mauro', ''], ['Giacinti', 'Francesco', ''], ['Reali', 'Gianluca', '']]","['Java Call Control (JCC)', 'MGCP', 'SIP', 'JSLEE']"
4335,1604.07202,Mathura Bai Baikadolla,"B.Mathura Bai, N.Mangathayaru, B.Padmaja Rani",An Approach to Find Missing Values in Medical Datasets,"7 pages,ACM Digital Library, ICEMIS September 2015",,10.1145/2832987.2833083,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mining medical datasets is a challenging problem before data mining
researchers as these datasets have several hidden challenges compared to
conventional datasets.Starting from the collection of samples through field
experiments and clinical trials to performing classification,there are numerous
challenges at every stage in the mining process. The preprocessing phase in the
mining process itself is a challenging issue when, we work on medical datasets.
One of the prime challenges in mining medical datasets is handling missing
values which is part of preprocessing phase. In this paper, we address the
issue of handling missing values in medical dataset consisting of categorical
attribute values. The main contribution of this research is to use the proposed
imputation measure to estimate and fix the missing values. We discuss a case
study to demonstrate the working of proposed measure.
","[{'version': 'v1', 'created': 'Mon, 25 Apr 2016 11:16:26 GMT'}]",2016-04-26,"[['Bai', 'B. Mathura', ''], ['Mangathayaru', 'N.', ''], ['Rani', 'B. Padmaja', '']]","['medical record', 'missing values', 'prediction', 'classification']"
4336,0812.0956,Florian Hartig,"Florian Hartig, Martin Horn, Martin Drechsler","EcoTRADE - a multi player network game of a tradable permit market for
  biodiversity credits","3 pages, 1 figure","Environmental Modelling & Software, 2010, 25, 1479-1480",10.1016/j.envsoft.2009.01.003,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  EcoTRADE is a multi player network game of a virtual biodiversity credit
market. Each player controls the land use of a certain amount of parcels on a
virtual landscape. The biodiversity credits of a particular parcel depend on
neighboring parcels, which may be owned by other players. The game can be used
to study the strategies of players in experiments or classroom games and also
as a communication tool for stakeholders participating in credit markets that
include spatially interdependent credits.
","[{'version': 'v1', 'created': 'Thu, 4 Dec 2008 15:43:16 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Sep 2010 16:53:24 GMT'}]",2010-09-06,"[['Hartig', 'Florian', ''], ['Horn', 'Martin', ''], ['Drechsler', 'Martin', '']]","['biodiversity', 'conservation', 'tradable permits', 'EcoTRADE', 'classroom games']"
4337,1805.08302,Daniel M\'endez Fern\'andez,Daniel M\'endez Fern\'andez and Jan-Hendrik Passoth,Empirical Software Engineering: From Discipline to Interdiscipline,"Preprint accepted by Journal of Systems and Software (controversy
  corner)",,10.1016/j.jss.2018.11.019,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Empirical software engineering has received much attention in recent years
and coined the shift from a more design-science-driven engineering discipline
to an insight-oriented, and theory-centric one. Yet, we still face many
challenges, among which some increase the need for interdisciplinary research.
This is especially true for the investigation of human-centric aspects of
software engineering. Although we can already observe an increased recognition
of the need for more interdisciplinary research in (empirical) software
engineering, such research configurations come with challenges barely discussed
from a scientific point of view. In this position paper, we critically reflect
upon the epistemological setting of empirical software engineering and
elaborate its configuration as an Interdiscipline. In particular, we (1)
elaborate a pragmatic view on empirical research for software engineering
reflecting a cyclic process for knowledge creation, (2) motivate a path towards
symmetrical interdisciplinary research, and (3) adopt five rules of thumb from
other interdisciplinary collaborations in our field before concluding with new
emerging challenges. This shall support stopping to treating empirical software
engineering as a developing discipline moving towards a paradigmatic stage of
normal science, but as a configuration of symmetric interdisciplinary teams and
research methods.
","[{'version': 'v1', 'created': 'Mon, 21 May 2018 21:55:24 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Nov 2018 06:51:46 GMT'}, {'version': 'v3', 'created': 'Sat, 17 Nov 2018 07:39:44 GMT'}]",2018-11-20,"[['Fernández', 'Daniel Méndez', ''], ['Passoth', 'Jan-Hendrik', '']]","['Empirical Software Engineering', 'Interdisciplinary Research', 'Symmetrical Collaboration', 'Science & Technology Studies']"
4338,1804.04346,EPTCS,Maike Schwammberger (University of Oldenburg),"Introducing Liveness into Multi-lane Spatial Logic lane change
  controllers using UPPAAL","In Proceedings SCAV 2018, arXiv:1804.03406","EPTCS 269, 2018, pp. 17-31",10.4204/EPTCS.269.3,,cs.LO cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With Multi-lane Spatial Logic (MLSL) a powerful approach to formally reason
about and prove safety of autonomous traffic manoeuvres was introduced.
Extended timed automata controllers using MLSL were constructed to commit safe
lane change manoeuvres on highways. However, the approach has only few
implementation and verification results. We thus strenghen the MLSL approach by
implementing their lane change controller in UPPAAL and confirming the safety
of the lane change protocol. We also detect the unlive behaviour of the
original controller and thus extend it to finally verify liveness of the new
lane change controller.
","[{'version': 'v1', 'created': 'Thu, 12 Apr 2018 06:52:46 GMT'}]",2018-04-13,"[['Schwammberger', 'Maike', '', 'University of Oldenburg']]","['Autonomous cars', 'Multi-lane Spatial Logic', 'Automotive-Controlling TimedAutomata', 'UPPAAL', 'Safety', 'Liveness']"
4339,1901.07960,Christoph M Augustin,"Miguel A. Rodriguez, Christoph M. Augustin, Shawn C. Shadden",FEniCS Mechanics: A Package for Continuum Mechanics Simulations,"This work was supported in part from the NSF award 1663747 and the
  NSF GRFP. Additionally, this project has received funding from the European
  Union's Horizon 2020 research and innovation programme under the Marie
  Sklodowska-Curie Action H2020-MSCA-IF-2016 InsiliCardio, GA No. 750835","SoftwareX 9:107-111, 2019",10.1016/j.softx.2018.10.005,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  FEniCS Mechanics is a Python package to facilitate computational mechanics
simulations. The Python library dolfin, from the FEniCS Project, is used to
formulate and numerically solve the problem in variational form. The general
balance laws from continuum mechanics are used to enable rapid prototyping of
different material laws. In addition to its generality, FEniCS Mechanics also
checks the input provided by users to ensure that problem definitions are
physically consistent. In turn, this code enables simulations of custom
mechanics problems to be more accessible to those with limited programming or
mechanics knowledge.
","[{'version': 'v1', 'created': 'Mon, 21 Jan 2019 14:47:05 GMT'}]",2019-01-30,"[['Rodriguez', 'Miguel A.', ''], ['Augustin', 'Christoph M.', ''], ['Shadden', 'Shawn C.', '']]","['computational mechanics', 'fluid mechanics', 'solid mechanics', 'finite elementmethod']"
4340,1606.07981,Amir Hosein Zamanian,"Amir Hosein Zamanian, Abdolreza Ohadi","Gear fault diagnosis based on Gaussian correlation of vibrations signals
  and wavelet coefficients",,,10.1016/j.asoc.2011.06.020,,cs.IT cs.CE cs.LG math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The features of non-stationary multi-component signals are often difficult to
be extracted for expert systems. In this paper, a new method for feature
extraction that is based on maximization of local Gaussian correlation function
of wavelet coefficients and signal is presented. The effect of empirical mode
decomposition (EMD) to decompose multi-component signals to intrinsic mode
functions (IMFs), before using of local Gaussian correlation is discussed. The
experimental vibration signals from two gearbox systems are used to show the
efficiency of the presented method. Linear support vector machine (SVM) is
utilized to classify feature sets extracted with the presented method. The
obtained results show that the features extracted in this method have excellent
ability to classify faults without any additional feature selection; it is also
shown that EMD can improve or degrade features according to the utilized
feature reduction method.
","[{'version': 'v1', 'created': 'Sun, 26 Jun 2016 00:16:44 GMT'}]",2016-06-30,"[['Zamanian', 'Amir Hosein', ''], ['Ohadi', 'Abdolreza', '']]","['Gear', 'Gaussian-Correlation', 'Wavelet', 'EMD', 'SVM', 'Fault Detection']"
4341,1509.00649,Frederic Blanqui,Fr\'ed\'eric Blanqui (DEDUCTEAM),"Termination of rewrite relations on $\lambda$-terms based on Girard's
  notion of reducibility",,,10.1016/j.tcs.2015.07.045,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we show how to extend the notion of reducibility introduced by
Girard for proving the termination of $\beta$-reduction in the polymorphic
$\lambda$-calculus, to prove the termination of various kinds of rewrite
relations on $\lambda$-terms, including rewriting modulo some equational theory
and rewriting with matching modulo $\beta$$\eta$, by using the notion of
computability closure. This provides a powerful termination criterion for
various higher-order rewriting frameworks, including Klop's Combinatory
Reductions Systems with simple types and Nipkow's Higher-order Rewrite Systems.
","[{'version': 'v1', 'created': 'Wed, 2 Sep 2015 11:45:12 GMT'}]",2015-09-03,"[['Blanqui', 'Frédéric', '', 'DEDUCTEAM']]","['termination', 'rewriting', 'λ-calculus', 'types', 'Girard’s reducibility', 'rewriting modulo', 'matchingmodulo βη', 'patterns `a la Miller']"
4342,2111.08538,Tatev Karen Aslanyan,"Tatev Karen Aslanyan, Flavius Frasincar","Utilizing Textual Reviews in Latent Factor Models for Recommender
  Systems",,"The 36th ACM/SIGAPP Symposium on Applied Computing (SAC '21),
  March 22--26, 2021, Virtual Event, Republic of Korea",10.1145/3412841.3442065,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most of the existing recommender systems are based only on the rating data,
and they ignore other sources of information that might increase the quality of
recommendations, such as textual reviews, or user and item characteristics.
Moreover, the majority of those systems are applicable only on small datasets
(with thousands of observations) and are unable to handle large datasets (with
millions of observations). We propose a recommender algorithm that combines a
rating modelling technique (i.e., Latent Factor Model) with a topic modelling
method based on textual reviews (i.e., Latent Dirichlet Allocation), and we
extend the algorithm such that it allows adding extra user- and item-specific
information to the system. We evaluate the performance of the algorithm using
Amazon.com datasets with different sizes, corresponding to 23 product
categories. After comparing the built model to four other models we found that
combining textual reviews with ratings leads to better recommendations.
Moreover, we found that adding extra user and item features to the model
increases its prediction accuracy, which is especially true for medium and
large datasets.
","[{'version': 'v1', 'created': 'Tue, 16 Nov 2021 15:07:51 GMT'}]",2021-11-17,"[['Aslanyan', 'Tatev Karen', ''], ['Frasincar', 'Flavius', '']]","['e-commerce', 'LDA', 'Latent Factor Model', 'recommender systems', 'textual reviews']"
4343,1007.5139,Secretary  Ijaia,"Anuradha Banerjee (1) and Paramartha Dutta (2) ((1) Kalyani Govt.
  Engg. College, India and (2) Visva-Bharati University, India)","Reputation-Based Attack-Resistant Cooperation Stimulation (RACS) For
  Mobile Ad hoc Networks","20 pages, 4 figures","International Journal of Artificial Intelligence & Applications
  1.3 (2010) 71-90",10.5121/ijaia.2010.1306,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In mobile ad hoc networks (MANET), nodes usually belong to different
authorities and pursue different goals. In order to maximize their own
performance, nodes in such networks tend to be selfish and are not willing to
forward packets for benefit of others. Meanwhile, some nodes may behave
maliciously and try to disrupt the network through wasting other nodes
resources in a very large scale. In this article, we present a reputation-based
attack resistant cooperation stimulation (RACS) system which ensures that
damage caused by malicious nodes can be bounded and cooperation among the
selfish nodes can be enforced. Mathematical analyses of the system as well as
the simulation results have confirmed effectiveness of our proposed system.
RACS is completely self-organizing and distributed. It does not require any
tamper-proof hardware or central management policy.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2010 07:54:51 GMT'}]",2010-07-30,"[['Banerjee', 'Anuradha', ''], ['Dutta', 'Paramartha', '']]","['Ad Hoc Network', 'attack-resistant', 'cooperation', 'fuzzy', 'malicious', 'selfish']"
4344,1810.07768,David Droeschel,"Nicola Krombach and David Droeschel and Sebastian Houben and Sven
  Behnke",Feature-based visual odometry prior for real-time semi-dense stereo SLAM,,,10.1016/j.robot.2018.08.002,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robust and fast motion estimation and mapping is a key prerequisite for
autonomous operation of mobile robots. The goal of performing this task solely
on a stereo pair of video cameras is highly demanding and bears conflicting
objectives: on one hand, the motion has to be tracked fast and reliably, on the
other hand, high-level functions like navigation and obstacle avoidance depend
crucially on a complete and accurate environment representation. In this work,
we propose a two-layer approach for visual odometry and SLAM with stereo
cameras that runs in real-time and combines feature-based matching with
semi-dense direct image alignment. Our method initializes semi-dense depth
estimation, which is computationally expensive, from motion that is tracked by
a fast but robust keypoint-based method. Experiments on public benchmark and
proprietary datasets show that our approach is faster than state-of-the-art
methods without losing accuracy and yields comparable map building
capabilities. Moreover, our approach is shown to handle large inter-frame
motion and illumination changes much more robustly than its direct
counterparts.
","[{'version': 'v1', 'created': 'Wed, 17 Oct 2018 20:18:20 GMT'}]",2018-10-19,"[['Krombach', 'Nicola', ''], ['Droeschel', 'David', ''], ['Houben', 'Sebastian', ''], ['Behnke', 'Sven', '']]","['visual simultaneous localization and mapping', 'visual odometry', 'feature-based SLAM', 'semi-dense SLAM']"
4345,0803.0378,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",Thread algebra for poly-threading,"24 pages, sections 9, 10, and 11 are added","Formal Aspects of Computing, 23(4):567--583, 2011",10.1007/s00165-011-0178-3,PRG0810,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Threads as considered in basic thread algebra are primarily looked upon as
behaviours exhibited by sequential programs on execution. It is a fact of life
that sequential programs are often fragmented. Consequently, fragmented program
behaviours are frequently found. In this paper, we consider this phenomenon. We
extend basic thread algebra with the barest mechanism for sequencing of threads
that are taken for fragments. This mechanism, called poly-threading, supports
both autonomous and non-autonomous thread selection in sequencing. We relate
the resulting theory to the algebraic theory of processes known as ACP and use
it to describe analytic execution architectures suited for fragmented programs.
We also consider the case where the steps of fragmented program behaviours are
interleaved in the ways of non-distributed and distributed multi-threading.
","[{'version': 'v1', 'created': 'Tue, 4 Mar 2008 07:18:46 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Jul 2008 12:31:50 GMT'}]",2011-06-17,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['poly-threading', 'thread algebra', 'process algebra', 'execution architecture', 'non-distributed multi-threading', 'distributed multi-threading']"
4346,1502.05168,Rekha Vaidyanathan,"Rekha Vaidyanathan, Sujoy Das, Namita Srivastava","Query Expansion Strategy based on Pseudo Relevance Feedback and Term
  Weight Scheme for Monolingual Retrieval",,"International Journal of Computer Applications 105(8):1-6,
  November 2014",10.5120/18394-9646,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Query Expansion using Pseudo Relevance Feedback is a useful and a popular
technique for reformulating the query. In our proposed query expansion method,
we assume that relevant information can be found within a document near the
central idea. The document is normally divided into sections, paragraphs and
lines. The proposed method tries to extract keywords that are closer to the
central theme of the document. The expansion terms are obtained by
equi-frequency partition of the documents obtained from pseudo relevance
feedback and by using tf-idf scores. The idf factor is calculated for number of
partitions in documents. The group of words for query expansion is selected
using the following approaches: the highest score, average score and a group of
words that has maximum number of keywords. As each query behaved differently
for different methods, the effect of these methods in selecting the words for
query expansion is investigated. From this initial study, we extend the
experiment to develop a rule-based statistical model that automatically selects
the best group of words incorporating the tf-idf scoring and the 3 approaches
explained here, in the future. The experiments were performed on FIRE 2011
Adhoc Hindi and English test collections on 50 queries each, using Terrier as
retrieval engine.
","[{'version': 'v1', 'created': 'Wed, 18 Feb 2015 09:55:37 GMT'}]",2015-02-19,"[['Vaidyanathan', 'Rekha', ''], ['Das', 'Sujoy', ''], ['Srivastava', 'Namita', '']]","['Pseudo Relevance Feedback', 'Query Expansion', 'tf-idf', 'equifrequency partition']"
4347,1303.2054,Wajdi Dhifli Wajdi DHIFLI,"Wajdi Dhifli, Rabie Saidi, Engelbert Mephu Nguifo","Mining Representative Unsubstituted Graph Patterns Using Prior
  Similarity Matrix",,"Information Systems (Elsevier) 69: 155-163, 2017",10.1016/j.is.2017.05.006,,cs.CE cs.LG,http://creativecommons.org/licenses/publicdomain/,"  One of the most powerful techniques to study protein structures is to look
for recurrent fragments (also called substructures or spatial motifs), then use
them as patterns to characterize the proteins under study. An emergent trend
consists in parsing proteins three-dimensional (3D) structures into graphs of
amino acids. Hence, the search of recurrent spatial motifs is formulated as a
process of frequent subgraph discovery where each subgraph represents a spatial
motif. In this scope, several efficient approaches for frequent subgraph
discovery have been proposed in the literature. However, the set of discovered
frequent subgraphs is too large to be efficiently analyzed and explored in any
further process. In this paper, we propose a novel pattern selection approach
that shrinks the large number of discovered frequent subgraphs by selecting the
representative ones. Existing pattern selection approaches do not exploit the
domain knowledge. Yet, in our approach we incorporate the evolutionary
information of amino acids defined in the substitution matrices in order to
select the representative subgraphs. We show the effectiveness of our approach
on a number of real datasets. The results issued from our experiments show that
our approach is able to considerably decrease the number of motifs while
enhancing their interestingness.
","[{'version': 'v1', 'created': 'Fri, 8 Mar 2013 16:57:18 GMT'}]",2018-03-02,"[['Dhifli', 'Wajdi', ''], ['Saidi', 'Rabie', ''], ['Nguifo', 'Engelbert Mephu', '']]","['Feature selection', 'graph mining', 'representative unsubstituted subgraphs', 'spatial motifs', 'protein structures']"
4348,1908.06512,Harvineet Singh,"Moumita Sinha, Vishwa Vinay, Harvineet Singh","Modeling Time to Open of Emails with a Latent State for User Engagement
  Level","9 pages, 5 figures, WSDM'18, February 5-9, 2018, Marina Del Rey, CA,
  USA, https://dl.acm.org/citation.cfm?id=3159683","Proceedings of the Eleventh ACM International Conference on Web
  Search and Data Mining (WSDM 2018). ACM, New York, NY, USA, 531-539",10.1145/3159652.3159683,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Email messages have been an important mode of communication, not only for
work, but also for social interactions and marketing. When messages have time
sensitive information, it becomes relevant for the sender to know what is the
expected time within which the email will be read by the recipient. In this
paper we use a survival analysis framework to predict the time to open an email
once it has been received. We use the Cox Proportional Hazards (CoxPH) model
that offers a way to combine various features that might affect the event of
opening an email. As an extension, we also apply a mixture model (MM) approach
to CoxPH that distinguishes between recipients, based on a latent state of how
prone to opening the messages each individual is. We compare our approach with
standard classification and regression models. While the classification model
provides predictions on the likelihood of an email being opened, the regression
model provides prediction of the real-valued time to open. The use of survival
analysis based methods allows us to jointly model both the open event as well
as the time-to-open. We experimented on a large real-world dataset of marketing
emails sent in a 3-month time duration. The mixture model achieves the best
accuracy on our data where a high proportion of email messages go unopened.
","[{'version': 'v1', 'created': 'Sun, 18 Aug 2019 20:55:27 GMT'}]",2019-08-20,"[['Sinha', 'Moumita', ''], ['Vinay', 'Vishwa', ''], ['Singh', 'Harvineet', '']]","['Email interaction data', 'survival analysis', 'time-to-event prediction', 'enterprise email marketing', 'Cox-proportional hazards model']"
4349,1912.11564,Christine Bauer,Markus Schedl and Christine Bauer,"Online Music Listening Culture of Kids and Adolescents: Listening
  Analysis and Music Recommendation Tailored to the Young","4 pages, 1 figure, 1 table, KidRec 2017","1st International Workshop on Children and Recommender Systems
  (KidRec 2017), co-located with 11th ACM Conference on Recommender Systems
  (RecSys 2017), Como, Italy, 27 August",,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we analyze a large dataset of user-generated music listening
events from Last.fm, focusing on users aged 6 to 18 years. Our contribution is
two-fold. First, we study the music genre preferences of this young user group
and analyze these preferences for homogeneity within more fine-grained age
groups and with respect to gender and countries. Second, we investigate the
performance of a collaborative filtering recommender when tailoring music
recommendations to different age groups. We find that doing so improves
performance for all user groups up to 18 years, but decreases performance for
adult users aged 19 years and older.
","[{'version': 'v1', 'created': 'Tue, 24 Dec 2019 23:31:39 GMT'}]",2019-12-30,"[['Schedl', 'Markus', ''], ['Bauer', 'Christine', '']]","['music genre preferences', 'recommender systems', 'youth culture']"
4350,1005.5440,Secretary Aircc Journal,"Surender Kumar(1), R.K.Chauhan(2), Parveen Kumar(3), ((1)Haryana
  College of Tech. & Mgmt. India, (2)Kurukshetra University, India, (3)MIET -
  Meerut, India)","A Low Overhead Minimum Process Global Snapshop Collection Algorithm for
  Mobile Distributed System","19 Pages, IJMA","International journal of Multimedia & Its Applications 2.2 (2010)
  12-30",10.5121/ijma.2010.2202,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Coordinated checkpointing is an effective fault tolerant technique in
distributed system as it avoids the domino effect and require minimum storage
requirement. Most of the earlier coordinated checkpoint algorithms block their
computation during checkpointing and forces minimum-process or non-blocking but
forces all nodes to takes checkpoint even though many of them may not be
necessary or non-blocking minimum-process but takes useless checkpoints or
reduced useless checkpoint but has higher synchronization message overhead or
has high checkpoint request propagation time. Hence in mobile distributed
systems there is a great need of minimizing the number of communication message
and checkpointing overhead as it raise new issues such as mobility, low
bandwidth of wireless channels, frequently disconnections, limited battery
power and lack of reliable stable storage on mobile nodes. In this paper, we
propose a minimum-process coordinated checkpointing algorithm for mobile
distributed system where no useless checkpoints are taken, no blocking of
processes takes place and enforces a minimum-number of processes to take
checkpoints. Our algorithm imposes low memory and computation overheads on MH's
and low communication overheads on wireless channels. It avoids awakening of an
MH if it is not required to take its checkpoint and has reduced latency time as
each process involved in a global checkpoint can forward its own decision
directly to the checkpoint initiator.
","[{'version': 'v1', 'created': 'Sat, 29 May 2010 08:29:45 GMT'}]",2010-07-15,"[['Kumar', 'Surender', ''], ['Chauhan', 'R. K.', ''], ['Kumar', 'Parveen', '']]","['Fault tolerance', 'coordinated checkpointing', 'consistent global state', 'mobile distributed system']"
4351,0908.3957,Jerome Darmont,"Hadj Mahboubi (ERIC), J\'er\^ome Darmont (ERIC)",Enhancing XML Data Warehouse Query Performance by Fragmentation,,"24th Annual ACM Symposium on Applied Computing (SAC 09), Hawaii :
  United States (2009)",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  XML data warehouses form an interesting basis for decision-support
applications that exploit heterogeneous data from multiple sources. However,
XML-native database systems currently suffer from limited performances in terms
of manageable data volume and response time for complex analytical queries.
Fragmenting and distributing XML data warehouses (e.g., on data grids) allow to
address both these issues. In this paper, we work on XML warehouse
fragmentation. In relational data warehouses, several studies recommend the use
of derived horizontal fragmentation. Hence, we propose to adapt it to the XML
context. We particularly focus on the initial horizontal fragmentation of
dimensions' XML documents and exploit two alternative algorithms. We
experimentally validate our proposal and compare these alternatives with
respect to a unified XML warehouse model we advocate for.
","[{'version': 'v1', 'created': 'Thu, 27 Aug 2009 09:12:08 GMT'}]",2009-08-28,"[['Mahboubi', 'Hadj', '', 'ERIC'], ['Darmont', 'Jérôme', '', 'ERIC']]","['XML data warehouses', 'Multidimensional model', 'XML-nativedatabases', 'performance', 'fragmentation']"
4352,1510.06124,David Guillermo Fajardo Ortiz,David Fajardo and Victor Castano,"Hierarchy of knowledge translation: from health problems to ad-hoc drug
  design",,"Current Medicinal Chemistry, 2016 23 (26), 3000-3012",10.2174/0929867323666160617101823,,cs.SI cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An innovative approach to analyze the complexity of translating novel
molecular entities and nanomaterials into pharmaceutical alternatives (i.e.,
knowledge translation, KT) is discussed. First, some key concepts on the
organization and translation of the biomedical knowledge (paradigms, homophily,
power law distributions, hierarchy, modularity, and research fronts) are
reviewed. Then, we propose a model for the knowledge translation (KT) in Drug
Discovery that considers the complexity of interdisciplinary communication.
Specifically, we address two highly relevant aspects: 1) A successful KT
requires the emergence of organized bodies of inter-and transdisciplinary
research, and 2) The hierarchical and modular topological organization of these
bodies of knowledge. We focused on a set of previously-published studies on KT
which rely on a combination of network analysis and computer-assisted analysis
of the contents of scientific literature and patents. The selected studies
provide a duo of complementary perspectives: the demand of knowledge (cervical
cancer and Ebola hemorrhagic fever) and the supply of knowledge (liposomes and
nanoparticles to treat cancer and the paradigmatic Doxil, the first nanodrug to
be approved).
","[{'version': 'v1', 'created': 'Wed, 21 Oct 2015 03:39:07 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Oct 2015 04:38:56 GMT'}, {'version': 'v3', 'created': 'Mon, 26 Oct 2015 18:31:03 GMT'}]",2016-09-20,"[['Fajardo', 'David', ''], ['Castano', 'Victor', '']]","['Biomedical knowledge', 'translational hubs', 'trading zones', 'scientific cultures']"
4353,1507.06753,Novarun Deb,"Novarun Deb, Nabendu Chaki, Aditya Ghose",Extracting State Transition Models from i* Models,"41 pages, 13 figures, 5 tables, submitted to the Journal of Systems
  and Software, pending resubmission","Journal of Systems and Software, Elsevier, Volume 121, November
  2016, Pages 265-280",10.1016/j.jss.2016.03.038,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  i* models are inherently sequence agnostic. There is an immediate need to
bridge the gap between such a sequence agnostic model and an industry
implemented process modelling standard like Business Process Modelling Notation
(BPMN). This work is an attempt to build State Transition Models from i*
models. In this paper, we first spell out the Naive Algorithm formally, which
is on the lines of Formal Tropos. We demonstrate how the growth of the State
Transition Model Space can be mapped to the problem of finding the number of
possible paths between the Least Upper Bound (LUB) and the Greatest Lower Bound
(GLB) of a k-dimensional hypercube Lattice structure. We formally present the
mathematics for doing a quantitative analysis of the space growth. The Naive
Algorithm has its main drawback in the hyperexponential explosion caused in the
State Transition Model space. This is identified and the Semantic Implosion
Algorithm is proposed which exploits the temporal information embedded within
the i* model of an enterprise to reduce the rate of growth of the State
Transition Model space. A comparative quantitative analysis between the two
approaches concludes the superiority of the Semantic Implosion Algorithm.
","[{'version': 'v1', 'created': 'Fri, 24 Jul 2015 06:32:55 GMT'}]",2019-05-15,"[['Deb', 'Novarun', ''], ['Chaki', 'Nabendu', ''], ['Ghose', 'Aditya', '']]","['i∗', 'state transition model', 'model transformation']"
4354,1504.06961,Daniel Hienert,"Daniel Hienert, Wilko van Hoek, Alina Weber and Dagmar Kern",WHOSE - A Tool for Whole-Session Analysis in IIR,"In Advances in Information Retrieval: 37th European Conference on IR
  Research, ECIR 2015, Vienna, Austria, March 29 - April 2, 2015. Proceedings,
  Lecture Notes in Computer Science 9022, 172-183",,10.1007/978-3-319-16354-3_18,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the main challenges in Interactive Information Retrieval (IIR)
evaluation is the development and application of re-usable tools that allow
researchers to analyze search behavior of real users in different environments
and different domains, but with comparable results. Furthermore, IIR recently
focuses more on the analysis of whole sessions, which includes all user
interactions that are carried out within a session but also across several
sessions by the same user. Some frameworks have already been proposed for the
evaluation of controlled experiments in IIR, but yet no framework is available
for interactive evaluation of search behavior from real-world information
retrieval (IR) systems with real users. In this paper we present a framework
for whole-session evaluation that can also utilize these uncontrolled data
sets. The logging component can easily be integrated into real-world IR systems
for generating and analyzing new log data. Furthermore, due to a supplementary
mapping it is also possible to analyze existing log data. For every IR system
different actions and filters can be defined. This allows system operators and
researchers to use the framework for the analysis of user search behavior in
their IR systems and to compare it with others. Using a graphical user
interface they have the possibility to interactively explore the data set from
a broad overview down to individual sessions.
","[{'version': 'v1', 'created': 'Mon, 27 Apr 2015 08:06:21 GMT'}]",2015-04-28,"[['Hienert', 'Daniel', ''], ['van Hoek', 'Wilko', ''], ['Weber', 'Alina', ''], ['Kern', 'Dagmar', '']]","['Interactive Information Retrieval', 'Sessions', 'Analysis', 'Evaluation', 'Logging']"
4355,2105.05150,Jennifer D'Souza,"Grischa Fraumann, Jennifer D'Souza, and Kim Holmberg",Eigenfactor,"In book: Handbook Bibliometrics | Edition: De Gruyter Reference |
  Chapter: 4.7 | Publisher: De Gruyter Saur",,10.1515/9783110646610-025,,cs.DL cs.SI,http://creativecommons.org/licenses/by/4.0/,"  The Eigenfactor is a journal metric, which was developed by Bergstrom and his
colleagues at the University of Washington. They invented the Eigenfactor as a
response to the criticism against the use of simple citation counts. The
Eigenfactor makes use of the network structure of citations, i.e. citations
between journals, and establishes the importance, influence or impact of a
journal based on its location in a network of journals. The importance is
defined based on the number of citations between journals. As such, the
Eigenfactor algorithm is based on Eigenvector centrality. While journal-based
metrics have been criticized, the Eigenfactor has also been suggested as an
alternative in the widely used San Francisco Declaration on Research Assessment
(DORA).
","[{'version': 'v1', 'created': 'Tue, 4 May 2021 06:06:31 GMT'}]",2021-05-12,"[['Fraumann', 'Grischa', ''], [""D'Souza"", 'Jennifer', ''], ['Holmberg', 'Kim', '']]","['Eigenfactor', 'alternative metrics', 'metrics', 'journals', 'bibliometrics', 'JournalImpact Factor', 'citations', 'rating']"
4356,1202.5154,Gabriele Fici,Jean-Marc F\'edou and Gabriele Fici,Vertical representation of $C^{\infty}$-words,Published in Theoretical Computer Science,"Theoretical Computer Science 565: 90-101, 2015",10.1016/j.tcs.2014.11.011,,cs.DM cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new framework for dealing with $C^{\infty}$-words, based on
their left and right frontiers. This allows us to give a compact representation
of them, and to describe the set of $C^{\infty}$-words through an infinite
directed acyclic graph $G$. This graph is defined by a map acting on the
frontiers of $C^{\infty}$-words. We show that this map can be defined
recursively and with no explicit references to $C^{\infty}$-words. We then show
that some important conjectures on $C^{\infty}$-words follow from analogous
statements on the structure of the graph $G$.
","[{'version': 'v1', 'created': 'Thu, 23 Feb 2012 11:23:19 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Feb 2013 17:43:27 GMT'}, {'version': 'v3', 'created': 'Fri, 19 Dec 2014 16:00:09 GMT'}]",2014-12-22,"[['Fédou', 'Jean-Marc', ''], ['Fici', 'Gabriele', '']]","['Kolakoski word', 'C∞-words', 'directed acyclic graph', 'recursive function', 'directed set']"
4357,1901.08201,William Caicedo-Torres,William Caicedo-Torres and Jairo Gutierrez,"ISeeU: Visually interpretable deep learning for mortality prediction
  inside the ICU",,"Journal of Biomedical Informatics, 98, 103269 (2019)",10.1016/j.jbi.2019.103269,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To improve the performance of Intensive Care Units (ICUs), the field of
bio-statistics has developed scores which try to predict the likelihood of
negative outcomes. These help evaluate the effectiveness of treatments and
clinical practice, and also help to identify patients with unexpected outcomes.
However, they have been shown by several studies to offer sub-optimal
performance. Alternatively, Deep Learning offers state of the art capabilities
in certain prediction tasks and research suggests deep neural networks are able
to outperform traditional techniques. Nevertheless, a main impediment for the
adoption of Deep Learning in healthcare is its reduced interpretability, for in
this field it is crucial to gain insight on the why of predictions, to assure
that models are actually learning relevant features instead of spurious
correlations. To address this, we propose a deep multi-scale convolutional
architecture trained on the Medical Information Mart for Intensive Care III
(MIMIC-III) for mortality prediction, and the use of concepts from coalitional
game theory to construct visual explanations aimed to show how important these
inputs are deemed by the network. Our results show our model attains state of
the art performance while remaining interpretable. Supporting code can be found
at https://github.com/williamcaicedo/ISeeU.
","[{'version': 'v1', 'created': 'Thu, 24 Jan 2019 02:32:46 GMT'}]",2019-08-23,"[['Caicedo-Torres', 'William', ''], ['Gutierrez', 'Jairo', '']]","['Deep Learning', 'MIMIC-III', 'ICU', 'Shapley Values']"
4358,2112.02556,Hing Lun Chan,Hing Lun Chan,Windmills of the minds: an algorithm for Fermat's Two Squares Theorem,"14 pages, 6 tables, 10 figures. In Proceedings of the 11th ACM
  SIGPLAN International Conference on Certified Programs and Proofs (CPP 2022),
  January 17-18, 2022, Philadelphia, PA, USA","CPP 2022: Proceedings of the 11th ACM SIGPLAN International
  Conference on Certified Programs and Proofs, January 2022, pages 251-264",10.1145/3497775.3503673,,cs.LO math.NT,http://creativecommons.org/licenses/by/4.0/,"  The two squares theorem of Fermat is a gem in number theory, with a
spectacular one-sentence ""proof from the Book"". Here is a formalisation of this
proof, with an interpretation using windmill patterns. The theory behind
involves involutions on a finite set, especially the parity of the number of
fixed points in the involutions. Starting as an existence proof that is
non-constructive, there is an ingenious way to turn it into a constructive one.
This gives an algorithm to compute the two squares by iterating the two
involutions alternatively from a known fixed point.
","[{'version': 'v1', 'created': 'Sun, 5 Dec 2021 12:40:16 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Jan 2022 09:00:47 GMT'}]",2022-01-17,"[['Chan', 'Hing Lun', '']]","['Number Theory', 'Algorithm', 'Iteractive TheoremProving']"
4359,0906.5475,Yong-Hyuk Kim,Yong-Hyuk Kim and Yourim Yoon,"A Note on Mathematical Modelling of Practical Multicampaign Assignment
  and Its Computational Complexity","14 pages, 1 figure","Proceedings of the 2010 ACM Symposium on Applied Computing (SAC),
  pages 94-98, 2010",,,cs.CC cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Within personalized marketing, a recommendation issue known as multicampaign
assignment is to overcome a critical problem, known as the multiple
recommendation problem which occurs when running several personalized campaigns
simultaneously. This paper mainly deals with the hardness of multicampaign
assignment, which is treated as a very challenging problem in marketing. The
objective in this problem is to find a customer-campaign matrix which maximizes
the effectiveness of multiple campaigns under some constraints. We present a
realistic response suppression function, which is designed to be more
practical, and explain how this can be learned from historical data. Moreover,
we provide a proof that this more realistic version of the problem is NP-hard,
thus justifying to use of heuristics presented in previous work.
","[{'version': 'v1', 'created': 'Tue, 30 Jun 2009 13:53:03 GMT'}]",2010-05-04,"[['Kim', 'Yong-Hyuk', ''], ['Yoon', 'Yourim', '']]","['Computational complexity', 'personalized marketing', 'multicampaign assignment']"
4360,1204.1603,Narendra Pareek,Narendra K Pareek,Design and Analysis of a Novel Digital Image Encryption Scheme,"15 pages, 5 figures",,10.5121/ijnsa.2012.4207,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a new image encryption scheme using a secret key of 144-bits
is proposed. In the substitution process of the scheme, image is divided into
blocks and subsequently into color components. Each color component is modified
by performing bitwise operation which depends on secret key as well as a few
most significant bits of its previous and next color component. Three rounds
are taken to complete substitution process. To make cipher more robust, a
feedback mechanism is also applied by modifying used secret key after
encrypting each block. Further, resultant image is partitioned into several key
based dynamic sub-images. Each sub-image passes through the scrambling process
where pixels of sub-image are reshuffled within itself by using a generated
magic square matrix. Five rounds are taken for scrambling process. The propose
scheme is simple, fast and sensitive to the secret key. Due to high order of
substitution and permutation, common attacks like linear and differential
cryptanalysis are infeasible. The experimental results show that the proposed
encryption technique is efficient and has high security features.
","[{'version': 'v1', 'created': 'Sat, 7 Apr 2012 06:53:30 GMT'}]",2012-04-10,"[['Pareek', 'Narendra K', '']]","['Encryption', 'Secret key', 'Substitution', 'Scrambling', 'Security', 'Image cipher']"
4361,1712.09876,Emanuel Onica,"Mihai Rotaru, Florentin Olariu, Emanuel Onica, Etienne Rivi\`ere",Reliable Messaging to Millions of Users with MigratoryData,,"Middleware 2017 - Proceedings of the 18th ACM/IFIP/USENIX
  Middleware Conference: Industrial Track, Pages 1-7",10.1145/3154448.3154449,,cs.DC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web-based notification services are used by a large range of businesses to
selectively distribute live updates to customers, following the
publish/subscribe (pub/sub) model. Typical deployments can involve millions of
subscribers expecting ordering and delivery guarantees together with low
latencies. Notification services must be vertically and horizontally scalable,
and adopt replication to provide a reliable service. We report our experience
building and operating MigratoryData, a highly-scalable notification service.
We discuss the typical requirements of MigratoryData customers, and describe
the architecture and design of the service, focusing on scalability and fault
tolerance. Our evaluation demonstrates the ability of MigratoryData to handle
millions of concurrent connections and support a reliable notification service
despite server failures and network disconnections.
","[{'version': 'v1', 'created': 'Thu, 28 Dec 2017 14:48:28 GMT'}]",2017-12-29,"[['Rotaru', 'Mihai', ''], ['Olariu', 'Florentin', ''], ['Onica', 'Emanuel', ''], ['Rivière', 'Etienne', '']]","['Publish/subscribe', 'Scalability', 'Dependability']"
4362,1501.02476,Jose Teixeira,"Salman Mian, Jose Teixeira, Eija Koskivaara","Open-Source Software Implications in the Competitive Mobile Platforms
  Market","As presented on the 11th IFIP WG 6.11 Conference on e-Business,
  e-Services, and e-Society, I3E 2011, Kaunas, Lithuania, October 12-14, IFIP
  Advances in Information and Communication Technology Volume 353 Year 2011",,10.1007/978-3-642-55128-4_16,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The era of the PC platform left a legacy of competitive strategies for the
future technologies to follow. However, this notion became more complicated,
once the future grew out to be a present with huge bundle of innovative
technologies, Internet capabilities, communication possibilities, and ease in
life. A major step of moving from a product phone to a smart phone, eventually
to a mobile device has created a new industry with humongous potential for
further developments. The current mobile platform market is witnessing a
platforms-war with big players such as Apple, Google, Nokia and Microsoft in a
major role. An important aspect of today's mobile platform market is the
contributions made through open source initiatives which promote innovation.
This paper gives an insight into the open-source software strategies of the
leading players and its implications on the market. It first gives a precise
overview of the past leading to the current mobile platform market share state.
Then it briefs about the open-source software components used and released by
Apple, Google and Nokia platforms, leading to their mobile platform strategies
with regard to open source. Finally, the paper assesses the situation from the
point of view of communities of software developers complementing each
platform. The authors identified relevant implications of the open-source
phenomenon in the mobile-industry.
","[{'version': 'v1', 'created': 'Sun, 11 Jan 2015 17:58:20 GMT'}]",2015-01-13,"[['Mian', 'Salman', ''], ['Teixeira', 'Jose', ''], ['Koskivaara', 'Eija', '']]","['Open-source', 'Platform-strategies', 'Mobile-industry', 'Mobileplatforms', 'iOS', 'Android', 'Symbian', 'Maemo']"
4363,1706.01177,Yu Shi,"Yu Shi, Po-Wei Chan, Honglei Zhuang, Huan Gui and Jiawei Han","PReP: Path-Based Relevance from a Probabilistic Perspective in
  Heterogeneous Information Networks","10 pages. In Proceedings of the 23nd ACM SIGKDD International
  Conference on Knowledge Discovery and Data Mining, Halifax, Nova Scotia,
  Canada, ACM, 2017",,10.1145/3097983.3097990,,cs.SI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As a powerful representation paradigm for networked and multi-typed data, the
heterogeneous information network (HIN) is ubiquitous. Meanwhile, defining
proper relevance measures has always been a fundamental problem and of great
pragmatic importance for network mining tasks. Inspired by our probabilistic
interpretation of existing path-based relevance measures, we propose to study
HIN relevance from a probabilistic perspective. We also identify, from
real-world data, and propose to model cross-meta-path synergy, which is a
characteristic important for defining path-based HIN relevance and has not been
modeled by existing methods. A generative model is established to derive a
novel path-based relevance measure, which is data-driven and tailored for each
HIN. We develop an inference algorithm to find the maximum a posteriori (MAP)
estimate of the model parameters, which entails non-trivial tricks. Experiments
on two real-world datasets demonstrate the effectiveness of the proposed model
and relevance measure.
","[{'version': 'v1', 'created': 'Mon, 5 Jun 2017 02:28:15 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Feb 2019 22:21:18 GMT'}]",2019-02-22,"[['Shi', 'Yu', ''], ['Chan', 'Po-Wei', ''], ['Zhuang', 'Honglei', ''], ['Gui', 'Huan', ''], ['Han', 'Jiawei', '']]","['Heterogeneous information networks', 'graph mining', 'meta-paths', 'relevance measures']"
4364,1704.08065,Marios Isaakidis,"Carmela Troncoso, Marios Isaakidis, George Danezis, and Harry Halpin","Systematizing Decentralization and Privacy: Lessons from 15 Years of
  Research and Deployments",,Proceedings on Privacy Enhancing Technologies (2017) 404-426,10.1515/popets-2017-0056,,cs.CR cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Decentralized systems are a subset of distributed systems where multiple
authorities control different components and no authority is fully trusted by
all. This implies that any component in a decentralized system is potentially
adversarial. We revise fifteen years of research on decentralization and
privacy, and provide an overview of key systems, as well as key insights for
designers of future systems. We show that decentralized designs can enhance
privacy, integrity, and availability but also require careful trade-offs in
terms of system complexity, properties provided, and degree of
decentralization. These trade-offs need to be understood and navigated by
designers. We argue that a combination of insights from cryptography,
distributed systems, and mechanism design, aligned with the development of
adequate incentives, are necessary to build scalable and successful
privacy-preserving decentralized systems.
","[{'version': 'v1', 'created': 'Wed, 26 Apr 2017 11:40:55 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Jun 2017 11:54:31 GMT'}, {'version': 'v3', 'created': 'Wed, 28 Jun 2017 13:23:54 GMT'}]",2022-01-17,"[['Troncoso', 'Carmela', ''], ['Isaakidis', 'Marios', ''], ['Danezis', 'George', ''], ['Halpin', 'Harry', '']]","['Decentralization', 'Privacy', 'Peer-to-peer', 'Systematization of Knowledge']"
4365,1501.02347,Marwane  Ben Hcine,"Marwane Ben Hcine, Ridha Bouallegue","Highly Accurate Log Skew Normal Approximation to the Sum of Correlated
  Lognormals","12 pages, 6 figures, NeTCoM, CSIT, GRAPH-HOC, SPTM - 2014",,10.5121/csit.2014.41304,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several methods have been proposed to approximate the sum of correlated
lognormal RVs. However the accuracy of each method relies highly on the region
of the resulting distribution being examined, and the individual lognormal
parameters, i.e., mean and variance. There is no such method which can provide
the needed accuracy for all cases. This paper propose a universal yet very
simple approximation method for the sum of correlated lognormals based on log
skew normal approximation. The main contribution on this work is to propose an
analytical method for log skew normal parameters estimation. The proposed
method provides highly accurate approximation to the sum of correlated
lognormal distributions over the whole range of dB spreads for any correlation
coefficient. Simulation results show that our method outperforms all previously
proposed methods and provides an accuracy within 0.01 dB for all cases.
","[{'version': 'v1', 'created': 'Sat, 10 Jan 2015 12:38:06 GMT'}]",2015-01-13,"[['Hcine', 'Marwane Ben', ''], ['Bouallegue', 'Ridha', '']]","['Correlated Lognormal Sum', 'Log Skew Normal', 'Interference', 'Outage Probability']"
4366,1709.03777,Fabio Calefato,Fabio Calefato and Filippo Lanubile,Establishing Personal Trust-based Connections in Distributed Teams,6 pages (to appear),Internet Technology Letters. 2017;e6,10.1002/itl2.6,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Trust is a factor that dramatically contributes to the success or failure of
distributed software teams. We present a research model showing that social
communication between distant developers enables the affective appraisal of
trustworthiness even from a distance, thus increasing project performance. To
overcome the limitations of self-reported data, typically questionnaires, we
focus on software projects following a pull request-based development model and
approximate the overall performance of a software project with the history of
successful collaborations occurring between developers.
","[{'version': 'v1', 'created': 'Tue, 12 Sep 2017 10:30:59 GMT'}, {'version': 'v2', 'created': 'Sun, 1 Oct 2017 15:40:33 GMT'}]",2017-10-03,"[['Calefato', 'Fabio', ''], ['Lanubile', 'Filippo', '']]","['collaboration', 'distributed software teams', 'project performance', 'pull request', 'socialcommunication', 'trust']"
4367,1603.02964,Taroq Alshugran,"Tariq Alshugran, Julius Dichter","A Framework for Extracting and Modeling HIPAA Privacy Rules for
  Healthcare Applications",,"Health Informatics - An Internation Journal, vol. 5, no. 1, pp.
  1-10, 2016",10.5121/hiij.2016.5101,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Some organizations use software applications to manage their customers'
personal, medical, or financial information. In the United States, those
software applications are obligated to preserve users' privacy and to comply
with the United States federal privacy laws and regulations. To formally
guarantee compliance with those regulations, it is essential to extract and
model the privacy rules from the text of the law using a formal framework. In
this work we propose a goal-oriented framework for modeling and extracting the
privacy requirements from regulatory text using natural language processing
techniques.
","[{'version': 'v1', 'created': 'Wed, 9 Mar 2016 16:57:18 GMT'}]",2016-03-10,"[['Alshugran', 'Tariq', ''], ['Dichter', 'Julius', '']]","['Privacy Policies', 'Data Modelling', 'Law Formalization', 'Data privacy', 'Role engineering']"
4368,1007.1388,Georg Hager,"Christian Feichtinger, Johannes Habich, Harald Koestler, Georg Hager,
  Ulrich Ruede, Gerhard Wellein","A Flexible Patch-Based Lattice Boltzmann Parallelization Approach for
  Heterogeneous GPU-CPU Clusters","20 pages, 12 figures","Parallel Computing 37(9), 536-549 (2011)",10.1016/j.parco.2011.03.005,,cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sustaining a large fraction of single GPU performance in parallel
computations is considered to be the major problem of GPU-based clusters. In
this article, this topic is addressed in the context of a lattice Boltzmann
flow solver that is integrated in the WaLBerla software framework. We propose a
multi-GPU implementation using a block-structured MPI parallelization, suitable
for load balancing and heterogeneous computations on CPUs and GPUs. The
overhead required for multi-GPU simulations is discussed in detail and it is
demonstrated that the kernel performance can be sustained to a large extent.
With our GPU implementation, we achieve nearly perfect weak scalability on
InfiniBand clusters. However, in strong scaling scenarios multi-GPUs make less
efficient use of the hardware than IBM BG/P and x86 clusters. Hence, a cost
analysis must determine the best course of action for a particular simulation
task. Additionally, weak scaling results of heterogeneous simulations conducted
on CPUs and GPUs simultaneously are presented using clusters equipped with
varying node configurations.
","[{'version': 'v1', 'created': 'Thu, 8 Jul 2010 14:27:05 GMT'}]",2012-03-01,"[['Feichtinger', 'Christian', ''], ['Habich', 'Johannes', ''], ['Koestler', 'Harald', ''], ['Hager', 'Georg', ''], ['Ruede', 'Ulrich', ''], ['Wellein', 'Gerhard', '']]","['Lattice Boltzmann Method', 'MPI', 'CUDA', 'Heterogeneous Computations']"
4369,0903.4251,Artur Ferreira,"Artur Ferreira, Arlindo Oliveira, Mario Figueiredo","On the Use of Suffix Arrays for Memory-Efficient Lempel-Ziv Data
  Compression","10 pages, submited to IEEE - Data Compression Conference 2009",,10.1109/DCC.2009.50,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Much research has been devoted to optimizing algorithms of the Lempel-Ziv
(LZ) 77 family, both in terms of speed and memory requirements. Binary search
trees and suffix trees (ST) are data structures that have been often used for
this purpose, as they allow fast searches at the expense of memory usage.
  In recent years, there has been interest on suffix arrays (SA), due to their
simplicity and low memory requirements. One key issue is that an SA can solve
the sub-string problem almost as efficiently as an ST, using less memory. This
paper proposes two new SA-based algorithms for LZ encoding, which require no
modifications on the decoder side. Experimental results on standard benchmarks
show that our algorithms, though not faster, use 3 to 5 times less memory than
the ST counterparts. Another important feature of our SA-based algorithms is
that the amount of memory is independent of the text to search, thus the memory
that has to be allocated can be defined a priori. These features of low and
predictable memory requirements are of the utmost importance in several
scenarios, such as embedded systems, where memory is at a premium and speed is
not critical. Finally, we point out that the new algorithms are general, in the
sense that they are adequate for applications other than LZ compression, such
as text retrieval and forward/backward sub-string search.
","[{'version': 'v1', 'created': 'Wed, 25 Mar 2009 19:25:24 GMT'}]",2016-11-17,"[['Ferreira', 'Artur', ''], ['Oliveira', 'Arlindo', ''], ['Figueiredo', 'Mario', '']]","['LZ compression', 'suffix arrays', 'suffix trees', 'information retrieval', 'sub-stringsearch']"
4370,1811.03416,"Carl \""Ohman","Carl \""Ohman, David Watson","Are the Dead Taking Over Facebook? A Big Data Approach to the Future of
  Death Online","22 pages, 4 figures. Big Data & Society (2019)",,10.1177/2053951719842540,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  We project the future accumulation of profiles belonging to deceased Facebook
users. Our analysis suggests that a minimum of 1.4 billion users will pass away
before 2100 if Facebook ceases to attract new users as of 2018. If the network
continues expanding at current rates, however, this number will exceed 4.9
billion. In both cases, a majority of the profiles will belong to non-Western
users. In discussing our findings, we draw on the emerging scholarship on
digital preservation and stress the challenges arising from curating the
profiles of the deceased. We argue that an exclusively commercial approach to
data preservation poses important ethical and political risks that demand
urgent consideration. We call for a scalable, sustainable, and dignified
curation model that incorporates the interests of multiple stakeholders.
","[{'version': 'v1', 'created': 'Tue, 30 Oct 2018 10:25:12 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Jan 2019 08:46:57 GMT'}, {'version': 'v3', 'created': 'Tue, 26 Mar 2019 10:11:31 GMT'}, {'version': 'v4', 'created': 'Mon, 6 May 2019 09:29:57 GMT'}]",2019-05-07,"[['Öhman', 'Carl', ''], ['Watson', 'David', '']]","['Death online', 'digital afterlife', 'mortality', 'ethics', 'digital preservation', 'Facebook']"
4371,1706.06859,Kazuyuki Hara,"Kazuyuki Hara, Daisuke Saitoh, and Hayaru Shouno",Analysis of dropout learning regarded as ensemble learning,"9 pages, 8 figures, submitted to Conference","A. E. P. VIlla et al. (Eds.): ICANN 2016 ( Part II, LNCS 9887, pp.
  1-8, 2016)",10.1007/978-3-319-44781-0_9,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning is the state-of-the-art in fields such as visual object
recognition and speech recognition. This learning uses a large number of
layers, huge number of units, and connections. Therefore, overfitting is a
serious problem. To avoid this problem, dropout learning is proposed. Dropout
learning neglects some inputs and hidden units in the learning process with a
probability, p, and then, the neglected inputs and hidden units are combined
with the learned network to express the final output. We find that the process
of combining the neglected hidden units with the learned network can be
regarded as ensemble learning, so we analyze dropout learning from this point
of view.
","[{'version': 'v1', 'created': 'Tue, 20 Jun 2017 04:19:57 GMT'}]",2017-06-22,"[['Hara', 'Kazuyuki', ''], ['Saitoh', 'Daisuke', ''], ['Shouno', 'Hayaru', '']]","['Dropout learning', 'overfitting', 'regularization', 'ensemble learning', 'soft-committee machine', 'teacher-student formulation']"
4372,1706.08420,Ruben Mayer,"Christian Mayer, Ruben Mayer, Majd Abdo","StreamLearner: Distributed Incremental Machine Learning on Event
  Streams: Grand Challenge","Christian Mayer, Ruben Mayer, and Majd Abdo. 2017. StreamLearner:
  Distributed Incremental Machine Learning on Event Streams: Grand Challenge.
  In Proceedings of the 11th ACM International Conference on Distributed and
  Event-based Systems (DEBS '17), 298-303",,10.1145/3093742.3095103,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today, massive amounts of streaming data from smart devices need to be
analyzed automatically to realize the Internet of Things. The Complex Event
Processing (CEP) paradigm promises low-latency pattern detection on event
streams. However, CEP systems need to be extended with Machine Learning (ML)
capabilities such as online training and inference in order to be able to
detect fuzzy patterns (e.g., outliers) and to improve pattern recognition
accuracy during runtime using incremental model training. In this paper, we
propose a distributed CEP system denoted as StreamLearner for ML-enabled
complex event detection. The proposed programming model and data-parallel
system architecture enable a wide range of real-world applications and allow
for dynamically scaling up and out system resources for low-latency,
high-throughput event processing. We show that the DEBS Grand Challenge 2017
case study (i.e., anomaly detection in smart factories) integrates seamlessly
into the StreamLearner API. Our experiments verify scalability and high event
throughput of StreamLearner.
","[{'version': 'v1', 'created': 'Mon, 26 Jun 2017 14:54:18 GMT'}]",2017-06-27,"[['Mayer', 'Christian', ''], ['Mayer', 'Ruben', ''], ['Abdo', 'Majd', '']]","['Complex Event Processing', 'Machine Learning', 'Stream Processing']"
4373,1810.09487,Philipp Tschandl MD PhD,"Philipp Tschandl, Giuseppe Argenziano, Majid Razmara, Jordan Yap","Diagnostic Accuracy of Content Based Dermatoscopic Image Retrieval with
  Deep Classification Features",,"Tschandl P, Argenziano G, Razmara M, Yap J. Diagnostic Accuracy of
  Content Based Dermatoscopic Image Retrieval with Deep Classification
  Features. Br J Dermatol 2018 Sep 12. doi: 10.1111/bjd.17189",10.1111/bjd.17189,,cs.CV cs.HC cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Background: Automated classification of medical images through neural
networks can reach high accuracy rates but lack interpretability.
  Objectives: To compare the diagnostic accuracy obtained by using content
based image retrieval (CBIR) to retrieve visually similar dermatoscopic images
with corresponding disease labels against predictions made by a neural network.
  Methods: A neural network was trained to predict disease classes on
dermatoscopic images from three retrospectively collected image datasets
containing 888, 2750 and 16691 images respectively. Diagnosis predictions were
made based on the most commonly occurring diagnosis in visually similar images,
or based on the top-1 class prediction of the softmax output from the network.
Outcome measures were area under the ROC curve for predicting a malignant
lesion (AUC), multiclass-accuracy and mean average precision (mAP), measured on
unseen test images of the corresponding dataset.
  Results: In all three datasets the skin cancer predictions from CBIR
(evaluating the 16 most similar images) showed AUC values similar to softmax
predictions (0.842, 0.806 and 0.852 versus 0.830, 0.810 and 0.847 respectively;
p-value>0.99 for all). Similarly, the multiclass-accuracy of CBIR was
comparable to softmax predictions. Networks trained for detecting only 3
classes performed better on a dataset with 8 classes when using CBIR as
compared to softmax predictions (mAP 0.184 vs. 0.368 and 0.198 vs. 0.403
respectively).
  Conclusions: Presenting visually similar images based on features from a
neural network shows comparable accuracy to the softmax probability-based
diagnoses of convolutional neural networks. CBIR may be more helpful than a
softmax classifier in improving diagnostic accuracy of clinicians in a routine
clinical setting.
","[{'version': 'v1', 'created': 'Mon, 22 Oct 2018 18:20:01 GMT'}]",2018-10-24,"[['Tschandl', 'Philipp', ''], ['Argenziano', 'Giuseppe', ''], ['Razmara', 'Majid', ''], ['Yap', 'Jordan', '']]","['Dermatoscopy', 'SkinCancer', 'VisualSearch', 'Neural Networks', 'CBIR']"
4374,1108.3629,EPTCS,"Gabriele Fici (Laboratoire I3S, CNRS and Universit\'e de Nice-Sophia
  Antipolis)",A Classification of Trapezoidal Words,"In Proceedings WORDS 2011, arXiv:1108.3412","EPTCS 63, 2011, pp. 129-137",10.4204/EPTCS.63.18,,cs.FL math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Trapezoidal words are finite words having at most n+1 distinct factors of
length n, for every n>=0. They encompass finite Sturmian words. We distinguish
trapezoidal words into two disjoint subsets: open and closed trapezoidal words.
A trapezoidal word is closed if its longest repeated prefix has exactly two
occurrences in the word, the second one being a suffix of the word. Otherwise
it is open. We show that open trapezoidal words are all primitive and that
closed trapezoidal words are all Sturmian. We then show that trapezoidal
palindromes are closed (and therefore Sturmian). This allows us to characterize
the special factors of Sturmian palindromes. We end with several open problems.
","[{'version': 'v1', 'created': 'Thu, 18 Aug 2011 03:53:45 GMT'}]",2011-08-19,"[['Fici', 'Gabriele', '', 'Laboratoire I3S, CNRS and Université de Nice-Sophia\n  Antipolis']]","['trapezoidal words', 'Sturmian words', 'special factors', 'palindromes']"
4375,2105.11731,Meng-Jiun Chiou,"Meng-Jiun Chiou, Chun-Yu Liao, Li-Wei Wang, Roger Zimmermann and
  Jiashi Feng","ST-HOI: A Spatial-Temporal Baseline for Human-Object Interaction
  Detection in Videos","Accepted at ACM ICMR'21 Workshop on Intelligent Cross-Data Analysis
  and Retrieval. The dataset and source code are available at
  https://github.com/coldmanck/VidHOI",,10.1145/3463944.3469097,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Detecting human-object interactions (HOI) is an important step toward a
comprehensive visual understanding of machines. While detecting non-temporal
HOIs (e.g., sitting on a chair) from static images is feasible, it is unlikely
even for humans to guess temporal-related HOIs (e.g., opening/closing a door)
from a single video frame, where the neighboring frames play an essential role.
However, conventional HOI methods operating on only static images have been
used to predict temporal-related interactions, which is essentially guessing
without temporal contexts and may lead to sub-optimal performance. In this
paper, we bridge this gap by detecting video-based HOIs with explicit temporal
information. We first show that a naive temporal-aware variant of a common
action detection baseline does not work on video-based HOIs due to a
feature-inconsistency issue. We then propose a simple yet effective
architecture named Spatial-Temporal HOI Detection (ST-HOI) utilizing temporal
information such as human and object trajectories, correctly-localized visual
features, and spatial-temporal masking pose features. We construct a new video
HOI benchmark dubbed VidHOI where our proposed approach serves as a solid
baseline.
","[{'version': 'v1', 'created': 'Tue, 25 May 2021 07:54:35 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Jun 2021 09:10:17 GMT'}]",2021-06-25,"[['Chiou', 'Meng-Jiun', ''], ['Liao', 'Chun-Yu', ''], ['Wang', 'Li-Wei', ''], ['Zimmermann', 'Roger', ''], ['Feng', 'Jiashi', '']]","['Human-Object Interaction', 'Action Detection', 'Video Understanding']"
4376,1210.2688,George  Fletcher,"George H. L. Fletcher, Marc Gyssens, Dirk Leinders, Jan Van den
  Bussche, Dirk Van Gucht, Stijn Vansummeren","Similarity and bisimilarity notions appropriate for characterizing
  indistinguishability in fragments of the calculus of relations","36 pages, Journal of Logic and Computation 2014",,10.1093/logcom/exu018,,cs.LO cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by applications in databases, this paper considers various
fragments of the calculus of binary relations. The fragments are obtained by
leaving out, or keeping in, some of the standard operators, along with some
derived operators such as set difference, projection, coprojection, and
residuation. For each considered fragment, a characterization is obtained for
when two given binary relational structures are indistinguishable by
expressions in that fragment. The characterizations are based on appropriately
adapted notions of simulation and bisimulation.
","[{'version': 'v1', 'created': 'Tue, 9 Oct 2012 18:48:08 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Nov 2013 13:47:27 GMT'}, {'version': 'v3', 'created': 'Fri, 28 Mar 2014 15:04:11 GMT'}]",2014-03-31,"[['Fletcher', 'George H. L.', ''], ['Gyssens', 'Marc', ''], ['Leinders', 'Dirk', ''], ['Bussche', 'Jan Van den', ''], ['Van Gucht', 'Dirk', ''], ['Vansummeren', 'Stijn', '']]","['calculus of relations', 'indistinguishability', 'bisimulation', 'simulation', 'coprojection', 'residuation']"
4377,1808.05979,Khalid Raza,Tarun Kumar Gupta and Khalid Raza,"Optimizing Deep Neural Network Architecture: A Tabu Search Based
  Approach","15 pages, 2 figures, 2 algorithms, 2 tables","Neural Processing Letters (2020), Springer",10.1007/s11063-020-10234-7,,cs.LG cs.AI cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The performance of Feedforward neural network (FNN) fully de-pends upon the
selection of architecture and training algorithm. FNN architecture can be
tweaked using several parameters, such as the number of hidden layers, number
of hidden neurons at each hidden layer and number of connections between
layers. There may be exponential combinations for these architectural
attributes which may be unmanageable manually, so it requires an algorithm
which can automatically design an optimal architecture with high generalization
ability. Numerous optimization algorithms have been utilized for FNN
architecture determination. This paper proposes a new methodology which can
work on the estimation of hidden layers and their respective neurons for FNN.
This work combines the advantages of Tabu search (TS) and Gradient descent with
momentum backpropagation (GDM) training algorithm to demonstrate how Tabu
search can automatically select the best architecture from the populated
architectures based on minimum testing error criteria. The proposed approach
has been tested on four classification benchmark dataset of different size.
","[{'version': 'v1', 'created': 'Fri, 17 Aug 2018 20:12:26 GMT'}]",2020-05-01,"[['Gupta', 'Tarun Kumar', ''], ['Raza', 'Khalid', '']]","['Tabu search (TS)', 'Feedforward neural network (FNN)', 'hidden layer', 'hidden neurons', 'optimization', 'architecture']"
4378,1609.00096,Manh Duong Phung,"Tran Hiep Dinh, Minh Trien Pham, Manh Duong Phung, Duc Manh Nguyen,
  Van Manh Hoang, Quang Vinh Tran","Image segmentation based on histogram of depth and an application in
  driver distraction detection","6 pages In 13th International Conference on Control Automation
  Robotics & Vision (ICARCV), 2014",,10.1109/ICARCV.2014.7064437,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study proposes an approach to segment human object from a depth image
based on histogram of depth values. The region of interest is first extracted
based on a predefined threshold for histogram regions. A region growing process
is then employed to separate multiple human bodies with the same depth
interval. Our contribution is the identification of an adaptive growth
threshold based on the detected histogram region. To demonstrate the
effectiveness of the proposed method, an application in driver distraction
detection was introduced. After successfully extracting the driver's position
inside the car, we came up with a simple solution to track the driver motion.
With the analysis of the difference between initial and current frame, a change
of cluster position or depth value in the interested region, which cross the
preset threshold, is considered as a distracted activity. The experiment
results demonstrated the success of the algorithm in detecting typical
distracted driving activities such as using phone for calling or texting,
adjusting internal devices and drinking in real time.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2016 03:19:43 GMT'}]",2016-09-02,"[['Dinh', 'Tran Hiep', ''], ['Pham', 'Minh Trien', ''], ['Phung', 'Manh Duong', ''], ['Nguyen', 'Duc Manh', ''], ['Hoang', 'Van Manh', ''], ['Tran', 'Quang Vinh', '']]","['depth image', 'object segmentation', 'histogram of depth', 'distracted driving', 'Kinect']"
4379,1606.09000,Till Fluschnik,"Ren\'e van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter,
  Manuel Sorge, and Ond\v{r}ej Such\'y","The parameterized complexity of finding secluded solutions to some
  classical optimization problems on graphs","Compared to the previous version, this version additionally shows
  that Small Secluded s-t-Separator is fixed-parameter tractable parameterized
  by the combination of the solution size and the open neighborhood size
  (Theorem 3.5). To appear in Discrete Optimization","Discrete Optimzation 30:20-50, 2018",10.1016/j.disopt.2018.05.002,,cs.CC cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work studies the parameterized complexity of finding secluded solutions
to classical combinatorial optimization problems on graphs such as finding
minimum s-t separators, feedback vertex sets, dominating sets, maximum
independent sets, and vertex deletion problems for hereditary graph properties:
Herein, one searches not only to minimize or maximize the size of the solution,
but also to minimize the size of its neighborhood. This restriction has
applications in secure routing and community detection.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2016 08:42:35 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Nov 2016 09:41:17 GMT'}, {'version': 'v3', 'created': 'Wed, 31 May 2017 12:33:05 GMT'}, {'version': 'v4', 'created': 'Thu, 1 Jun 2017 07:04:31 GMT'}, {'version': 'v5', 'created': 'Tue, 22 May 2018 12:16:02 GMT'}]",2019-11-14,"[['van Bevern', 'René', ''], ['Fluschnik', 'Till', ''], ['Mertzios', 'George B.', ''], ['Molter', 'Hendrik', ''], ['Sorge', 'Manuel', ''], ['Suchý', 'Ondřej', '']]","['Neighborhood', 'Feedback Vertex Set', 'Vertex Deletion', 'Separator', 'Dominating Set']"
4380,1709.04621,Raula Gaikovina Kula Dr,"Raula Gaikovina Kula, Daniel M. German, Ali Ouni, Takashi Ishio,
  Katsuro Inoue","Do Developers Update Their Library Dependencies? An Empirical Study on
  the Impact of Security Advisories on Library Migration",37 Pages,Empirical Software Engineering 2017,10.1007/s10664-017-9521-5,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Third-party library reuse has become common practice in contemporary software
development, as it includes several benefits for developers. Library
dependencies are constantly evolving, with newly added features and patches
that fix bugs in older versions. To take full advantage of third-party reuse,
developers should always keep up to date with the latest versions of their
library dependencies. In this paper, we investigate the extent of which
developers update their library dependencies. Specifically, we conducted an
empirical study on library migration that covers over 4,600 GitHub software
projects and 2,700 library dependencies. Results show that although many of
these systems rely heavily on dependencies, 81.5% of the studied systems still
keep their outdated dependencies. In the case of updating a vulnerable
dependency, the study reveals that affected developers are not likely to
respond to a security advisory. Surveying these developers, we find that 69% of
the interviewees claim that they were unaware of their vulnerable dependencies.
Furthermore, developers are not likely to prioritize library updates, citing it
as extra effort and added responsibility. This study concludes that even though
third-party reuse is commonplace, the practice of updating a dependency is not
as common for many developers.
","[{'version': 'v1', 'created': 'Thu, 14 Sep 2017 05:59:50 GMT'}]",2017-09-15,"[['Kula', 'Raula Gaikovina', ''], ['German', 'Daniel M.', ''], ['Ouni', 'Ali', ''], ['Ishio', 'Takashi', ''], ['Inoue', 'Katsuro', '']]","['software reuse', 'software maintenance', 'security vulnerabilities']"
4381,1811.10123,Ariel Noyman,"Ariel Noyman, Tobias Holtz, Johannes Kroger, Jorg Rainer Noennig, Kent
  Larson","Finding Places: HCI Platform for Public Participation in Refugees
  Accommodation Process","Procedia Computer Science, 9 pages, 2 figures","Procedia Computer Science Volume 112, 2017, Pages 2463-2472",10.1016/j.procs.2017.08.180,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the conception, development and deployment of a novel
HCI system for public participation and decision making. This system was
applied for the process of allocating refugee accommodation in the City of
Hamburg within the FindingPlaces project in 2016. The CityScope a rapid
prototyping platform for urban planning and decision making offered a technical
solution which was complemented by a workshop process to facilitate effective
interaction of multiple participants and stakeholder groups. This paper
presents the origins of CS and the evolution of the tangible user interface
approach to urban planning and public participation. It further outlines
technical features of the system, including custom hardware and software in
use, utilization in real time as well as technical constraints and limitations.
Special focus is on the adaptation of the CS technology to the specific demands
of Hamburg FP project, whose procedures, processes, and results are reflected.
The final section analyzes success factors as well as shortcomings of the
approach, and indicates further R&D as well as application scenarios for the
CS.
","[{'version': 'v1', 'created': 'Mon, 26 Nov 2018 00:11:14 GMT'}]",2018-11-27,"[['Noyman', 'Ariel', ''], ['Holtz', 'Tobias', ''], ['Kroger', 'Johannes', ''], ['Noennig', 'Jorg Rainer', ''], ['Larson', 'Kent', '']]","['CityScope', 'Participation', 'Tangible User Interface', 'Refugee Accommodation', 'Interactive Mapping']"
4382,2102.08153,Dmitry Kulyabov,Anna V. Korolkova and Dmitry S. Kulyabov and Michal Hnati\v{c},"Practical application of the multi-model approach in the study of
  complex systems",in English; in Russian,,10.1007/978-3-030-66471-8_40,,cs.OH,http://creativecommons.org/licenses/by/4.0/,"  Different kinds of models are used to study various natural and technical
phenomena. Usually, the researcher is limited to using a certain kind of model
approach, not using others (or even not realizing the existence of other model
approaches). The authors believe that a complete study of a certain phenomenon
should cover several model approaches. The paper describes several model
approaches which we used in the study of the random early detection algorithm
for active queue management. Both the model approaches themselves and their
implementation and the results obtained are described.
","[{'version': 'v1', 'created': 'Tue, 16 Feb 2021 13:51:11 GMT'}]",2021-02-17,"[['Korolkova', 'Anna V.', ''], ['Kulyabov', 'Dmitry S.', ''], ['Hnatič', 'Michal', '']]","['active queue management', 'mathematical modeling', 'simulation', 'surrogate modeling', 'stochasticsystems']"
4383,1705.11050,David George,"David George, Xianghua Xie and Gary KL Tam",3D Mesh Segmentation via Multi-branch 1D Convolutional Neural Networks,"14 pages, 9 figures, 5 tables",Graphical Models 96 (2018) 1-10,10.1016/j.gmod.2018.01.001,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is an increasing interest in applying deep learning to 3D mesh
segmentation. We observe that 1) existing feature-based techniques are often
slow or sensitive to feature resizing, 2) there are minimal comparative studies
and 3) techniques often suffer from reproducibility issue. This study
contributes in two ways. First, we propose a novel convolutional neural network
(CNN) for mesh segmentation. It uses 1D data, filters and a multi-branch
architecture for separate training of multi-scale features. Together with a
novel way of computing conformal factor (CF), our technique clearly
out-performs existing work. Secondly, we publicly provide implementations of
several deep learning techniques, namely, neural networks (NNs), autoencoders
(AEs) and CNNs, whose architectures are at least two layers deep. The
significance of this study is that it proposes a robust form of CF, offers a
novel and accurate CNN technique, and a comprehensive study of several deep
learning techniques for baseline comparison.
","[{'version': 'v1', 'created': 'Wed, 31 May 2017 12:10:32 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Feb 2018 13:29:19 GMT'}]",2018-02-09,"[['George', 'David', ''], ['Xie', 'Xianghua', ''], ['Tam', 'Gary KL', '']]","['Mesh Segmentation', 'Mesh Processing', 'Deep Learning']"
4384,1703.07135,Dhruv Khandelwal,"Dhruv Khandelwal, Siep Weiland and Amol Khalate",Robust Fault Diagnosis by Optimal Input Design for Self-sensing Systems,Accepted in IFAC World Congress 2017,,10.1016/j.ifacol.2017.08.213,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a methodology for model based robust fault diagnosis and
a methodology for input design to obtain optimal diagnosis of faults. The
proposed algorithm is suitable for real time implementation. Issues of
robustness are addressed for the input design and fault diagnosis
methodologies. The proposed technique allows robust fault diagnosis under
suitable conditions on the system uncertainty. The designed input and fault
diagnosis techniques are illustrated by numerical simulation.
","[{'version': 'v1', 'created': 'Tue, 21 Mar 2017 10:41:10 GMT'}]",2020-01-16,"[['Khandelwal', 'Dhruv', ''], ['Weiland', 'Siep', ''], ['Khalate', 'Amol', '']]","['Active Fault Diagnosis', 'FDI for linear systems', 'Structural analysis', 'residualevaluation methods']"
4385,1902.00545,Philipp Seifer,"Philipp Seifer (University of Koblenz-Landau, Germany), Martin
  Leinberger (University of Koblenz-Landau, Germany), Ralf L\""ammel (University
  of Koblenz-Landau, Germany), Steffen Staab (University of Koblenz-Landau and
  University of Southampton, Germany)",Semantic Query Integration With Reason,,"The Art, Science, and Engineering of Programming, 2019, Vol. 3,
  Issue 3, Article 13",10.22152/programming-journal.org/2019/3/13,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph-based data models allow for flexible data representation. In
particular, semantic data based on RDF and OWL fuels use cases ranging from
general knowledge graphs to domain specific knowledge in various technological
or scientific domains. The flexibility of such approaches, however, makes
programming with semantic data tedious and error-prone. In particular the
logics-based data descriptions employed by OWL are problematic for existing
error-detecting techniques, such as type systems. In this paper, we present
DOTSpa, an advanced integration of semantic data into programming. We embed
description logics, the logical foundations of OWL, into the type checking
process of a statically typed programming language and provide typed data
access through an embedding of the query language SPARQL. In addition, we
demonstrate a concrete implementation of the approach, by extending the Scala
programming language. We qualitatively compare programs using our approach to
equivalent programs using a state-of-the-art library, in terms of how both
frameworks aid users in the handling of typical failure scenarios.
","[{'version': 'v1', 'created': 'Fri, 1 Feb 2019 20:16:13 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Feb 2019 13:55:11 GMT'}]",2019-02-06,"[['Seifer', 'Philipp', '', 'University of Koblenz-Landau, Germany'], ['Leinberger', 'Martin', '', 'University of Koblenz-Landau, Germany'], ['Lämmel', 'Ralf', '', 'University\n  of Koblenz-Landau, Germany'], ['Staab', 'Steffen', '', 'University of Koblenz-Landau and\n  University of Southampton, Germany']]","['DSL implementation', 'compiler extension', 'type checking', 'language integration']"
4386,1803.07311,Sebastian Baltes,"Sebastian Baltes, Lorik Dumani, Christoph Treude, Stephan Diehl","SOTorrent: Reconstructing and Analyzing the Evolution of Stack Overflow
  Posts","12 pages, 9 figures, 15th International Conference on Mining Software
  Repositories (MSR 2018), ACM, 2018",,10.1145/3196398.3196430,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stack Overflow (SO) is the most popular question-and-answer website for
software developers, providing a large amount of code snippets and free-form
text on a wide variety of topics. Like other software artifacts, questions and
answers on SO evolve over time, for example when bugs in code snippets are
fixed, code is updated to work with a more recent library version, or text
surrounding a code snippet is edited for clarity. To be able to analyze how
content on SO evolves, we built SOTorrent, an open dataset based on the
official SO data dump. SOTorrent provides access to the version history of SO
content at the level of whole posts and individual text or code blocks. It
connects SO posts to other platforms by aggregating URLs from text blocks and
by collecting references from GitHub files to SO posts. In this paper, we
describe how we built SOTorrent, and in particular how we evaluated 134
different string similarity metrics regarding their applicability for
reconstructing the version history of text and code blocks. Based on a first
analysis using the dataset, we present insights into the evolution of SO posts,
e.g., that post edits are usually small, happen soon after the initial creation
of the post, and that code is rarely changed without also updating the
surrounding text. Further, our analysis revealed a close relationship between
post edits and comments. Our vision is that researchers will use SOTorrent to
investigate and understand the evolution of SO posts and their relation to
other platforms such as GitHub.
","[{'version': 'v1', 'created': 'Tue, 20 Mar 2018 09:09:36 GMT'}, {'version': 'v2', 'created': 'Mon, 7 May 2018 11:17:26 GMT'}]",2018-05-08,"[['Baltes', 'Sebastian', ''], ['Dumani', 'Lorik', ''], ['Treude', 'Christoph', ''], ['Diehl', 'Stephan', '']]","['stack overflow', 'software evolution', 'open dataset', 'code snippets']"
4387,1810.07097,Mohammad Shokri,"Mohammad Shokri, Ahad Harati, Kimya Taba",Salient Object Detection in Video using Deep Non-Local Neural Networks,Submitted to Journal of Visual Communication and Image Representation,,10.1016/j.jvcir.2020.102769,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detection of salient objects in image and video is of great importance in
many computer vision applications. In spite of the fact that the state of the
art in saliency detection for still images has been changed substantially over
the last few years, there have been few improvements in video saliency
detection. This paper investigates the use of recently introduced non-local
neural networks in video salient object detection. Non-local neural networks
are applied to capture global dependencies and hence determine the salient
objects. The effect of non-local operations is studied separately on static and
dynamic saliency detection in order to exploit both appearance and motion
features. A novel deep non-local neural network architecture is introduced for
video salient object detection and tested on two well-known datasets DAVIS and
FBMS. The experimental results show that the proposed algorithm outperforms
state-of-the-art video saliency detection methods.
","[{'version': 'v1', 'created': 'Tue, 16 Oct 2018 15:55:57 GMT'}]",2020-02-24,"[['Shokri', 'Mohammad', ''], ['Harati', 'Ahad', ''], ['Taba', 'Kimya', '']]","['Video Saliency Detection', 'Deep Learning', 'Non-Local Neural Networks', 'Fully']"
4388,2211.16008,Joonhyunng Kim,"Joonhyung Kim, Kyeongho Lee and Jongsun Park","A Charge Domain P-8T SRAM Compute-In-Memory with Low-Cost DAC/ADC
  Operation for 4-bit Input Processing",Presented at ISLPED 2022,"in Proc. ACM/IEEE Int. Symp. Low Power Electron. and Design 6
  (2022) 1-6",10.1145/3531437.3539718,ISLPED/2022/08,cs.AR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a low cost PMOS-based 8T (P-8T) SRAM Compute-In-Memory
(CIM) architecture that efficiently per-forms the multiply-accumulate (MAC)
operations between 4-bit input activations and 8-bit weights. First, bit-line
(BL) charge-sharing technique is employed to design the low-cost and reliable
digital-to-analog conversion of 4-bit input activations in the pro-posed SRAM
CIM, where the charge domain analog computing provides variation tolerant and
linear MAC outputs. The 16 local arrays are also effectively exploited to
implement the analog mul-tiplication unit (AMU) that simultaneously produces 16
multipli-cation results between 4-bit input activations and 1-bit weights. For
the hardware cost reduction of analog-to-digital converter (ADC) without
sacrificing DNN accuracy, hardware aware sys-tem simulations are performed to
decide the ADC bit-resolutions and the number of activated rows in the proposed
CIM macro. In addition, for the ADC operation, the AMU-based reference col-umns
are utilized for generating ADC reference voltages, with which low-cost 4-bit
coarse-fine flash ADC has been designed. The 256X80 P-8T SRAM CIM macro
implementation using 28nm CMOS process shows that the proposed CIM shows the
accuracies of 91.46% and 66.67% with CIFAR-10 and CIFAR-100 dataset,
respectively, with the energy efficiency of 50.07-TOPS/W.
","[{'version': 'v1', 'created': 'Tue, 29 Nov 2022 08:15:27 GMT'}]",2022-11-30,"[['Kim', 'Joonhyung', ''], ['Lee', 'Kyeongho', ''], ['Park', 'Jongsun', '']]","['SRAM', 'Compute-In-Memory', 'CIM', 'BL Charge-sharing', 'MAC operation']"
4389,1901.05041,Alexander Panchenko,"Matthias Schildw\""achter, Alexander Bondarenko, Julian Zenker,
  Matthias Hagen, Chris Biemann, and Alexander Panchenko",Answering Comparative Questions: Better than Ten-Blue-Links?,"In Proceeding of 2019 Conference on Human Information Interaction and
  Retrieval (CHIIR '19), March 10--14, 2019, Glasgow, United Kingdom",,10.1145/3295750.3298916,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  We present CAM (comparative argumentative machine), a novel open-domain IR
system to argumentatively compare objects with respect to information extracted
from the Common Crawl. In a user study, the participants obtained 15% more
accurate answers using CAM compared to a ""traditional"" keyword-based search and
were 20% faster in finding the answer to comparative questions.
","[{'version': 'v1', 'created': 'Tue, 15 Jan 2019 20:50:28 GMT'}]",2019-01-17,"[['Schildwächter', 'Matthias', ''], ['Bondarenko', 'Alexander', ''], ['Zenker', 'Julian', ''], ['Hagen', 'Matthias', ''], ['Biemann', 'Chris', ''], ['Panchenko', 'Alexander', '']]","['HCI', 'Comparative Question Answering', 'Keyword Search', 'NaturalLanguage Processing']"
4390,2105.07902,David \'Alvarez Robert,"David \'Alvarez, Kevin Sala, Marcos Maro\~nas, Aleix Roca, Vicen\c{c}
  Beltran",Advanced Synchronization Techniques for Task-based Runtime Systems,"14 pages, 11 figures. Published in the 26th ACM SIGPLAN Symposium on
  Principles and Practice of Parallel Programming (PPoPP'21)","Proceedings of the 26th ACM SIGPLAN Symposium on Principles and
  Practice of Parallel Programming (2021) 334-347",10.1145/3437801.3441601,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Task-based programming models like OmpSs-2 and OpenMP provide a flexible
data-flow execution model to exploit dynamic, irregular and nested parallelism.
Providing an efficient implementation that scales well with small granularity
tasks remains a challenge, and bottlenecks can manifest in several runtime
components. In this paper, we analyze the limiting factors in the scalability
of a task-based runtime system and propose individual solutions for each of the
challenges, including a wait-free dependency system and a novel scalable
scheduler design based on delegation. We evaluate how the optimizations impact
the overall performance of the runtime, both individually and in combination.
We also compare the resulting runtime against state of the art OpenMP
implementations, showing equivalent or better performance, especially for
fine-grained tasks.
","[{'version': 'v1', 'created': 'Mon, 17 May 2021 14:32:54 GMT'}]",2021-05-18,"[['Álvarez', 'David', ''], ['Sala', 'Kevin', ''], ['Maroñas', 'Marcos', ''], ['Roca', 'Aleix', ''], ['Beltran', 'Vicenç', '']]","['parallel programming models', 'OmpSs-2', 'OpenMP', 'task-based runtimes', 'data dependencies', 'lock-free', 'waitfree']"
4391,1707.08470,Amit Sheth,"Sujan Perera, Pablo N. Mendes, Adarsh Alex, Amit Sheth, Krishnaprasad
  Thirunarayan",Implicit Entity Linking in Tweets,"This paper was accepted at the Extended Semantic Web Conference 2016
  as a full research track paper",,10.1007/978-3-319-34129-3_8,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the years, Twitter has become one of the largest communication platforms
providing key data to various applications such as brand monitoring, trend
detection, among others. Entity linking is one of the major tasks in natural
language understanding from tweets and it associates entity mentions in text to
corresponding entries in knowledge bases in order to provide unambiguous
interpretation and additional con- text. State-of-the-art techniques have
focused on linking explicitly mentioned entities in tweets with reasonable
success. However, we argue that in addition to explicit mentions i.e. The movie
Gravity was more ex- pensive than the mars orbiter mission entities (movie
Gravity) can also be mentioned implicitly i.e. This new space movie is crazy.
you must watch it!. This paper introduces the problem of implicit entity
linking in tweets. We propose an approach that models the entities by
exploiting their factual and contextual knowledge. We demonstrate how to use
these models to perform implicit entity linking on a ground truth dataset with
397 tweets from two domains, namely, Movie and Book. Specifically, we show: 1)
the importance of linking implicit entities and its value addition to the
standard entity linking task, and 2) the importance of exploiting contextual
knowledge associated with an entity for linking their implicit mentions. We
also make the ground truth dataset publicly available to foster the research in
this new research area.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 14:36:58 GMT'}]",2017-07-27,"[['Perera', 'Sujan', ''], ['Mendes', 'Pablo N.', ''], ['Alex', 'Adarsh', ''], ['Sheth', 'Amit', ''], ['Thirunarayan', 'Krishnaprasad', '']]","['Implicit entities', 'Modeling entities', 'Entity linking', 'Knowledge graphs', 'Contextual knowledge', 'Dynamic knowledge']"
4392,1806.03019,Masahiro Oda Dr.,"Masahiro Oda, Natsuki Shimizu, Holger R. Roth, Ken'ichi Karasawa,
  Takayuki Kitasaka, Kazunari Misawa, Michitaka Fujiwara, Daniel Rueckert,
  Kensaku Mori","3D FCN Feature Driven Regression Forest-Based Pancreas Localization and
  Segmentation","Presented in MICCAI 2017 workshop, DLMIA 2017 (Deep Learning in
  Medical Image Analysis and Multimodal Learning for Clinical Decision Support)","DLMIA 2017, ML-CDS 2017: Deep Learning in Medical Image Analysis
  and Multimodal Learning for Clinical Decision Support, pp.222-230",10.1007/978-3-319-67558-9_26,Published in LNCS Vol.10553,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a fully automated atlas-based pancreas segmentation
method from CT volumes utilizing 3D fully convolutional network (FCN)
feature-based pancreas localization. Segmentation of the pancreas is difficult
because it has larger inter-patient spatial variations than other organs.
Previous pancreas segmentation methods failed to deal with such variations. We
propose a fully automated pancreas segmentation method that contains novel
localization and segmentation. Since the pancreas neighbors many other organs,
its position and size are strongly related to the positions of the surrounding
organs. We estimate the position and the size of the pancreas (localized) from
global features by regression forests. As global features, we use intensity
differences and 3D FCN deep learned features, which include automatically
extracted essential features for segmentation. We chose 3D FCN features from a
trained 3D U-Net, which is trained to perform multi-organ segmentation. The
global features include both the pancreas and surrounding organ information.
After localization, a patient-specific probabilistic atlas-based pancreas
segmentation is performed. In evaluation results with 146 CT volumes, we
achieved 60.6% of the Jaccard index and 73.9% of the Dice overlap.
","[{'version': 'v1', 'created': 'Fri, 8 Jun 2018 08:34:30 GMT'}]",2018-06-11,"[['Oda', 'Masahiro', ''], ['Shimizu', 'Natsuki', ''], ['Roth', 'Holger R.', ''], ['Karasawa', ""Ken'ichi"", ''], ['Kitasaka', 'Takayuki', ''], ['Misawa', 'Kazunari', ''], ['Fujiwara', 'Michitaka', ''], ['Rueckert', 'Daniel', ''], ['Mori', 'Kensaku', '']]","['Segmentation', 'Pancreas', 'Fully convolutional network', 'Regression forest']"
4393,1412.3987,Vissarion Fisikopoulos,"Ioannis Z. Emiris, Vissarion Fisikopoulos, Bernd G\""artner",Efficient edge-skeleton computation for polytopes defined by oracles,"22 pages, 2 figures",Journal of Symbolic Computation 2016,10.1016/j.jsc.2015.06.001,,cs.CG cs.SC math.OC,http://creativecommons.org/licenses/by/3.0/,"  In general dimension, there is no known total polynomial algorithm for either
convex hull or vertex enumeration, i.e. an algorithm whose complexity depends
polynomially on the input and output sizes. It is thus important to identify
problems (and polytope representations) for which total polynomial-time
algorithms can be obtained. We offer the first total polynomial-time algorithm
for computing the edge-skeleton (including vertex enumeration) of a polytope
given by an optimization or separation oracle, where we are also given a
superset of its edge directions. We also offer a space-efficient variant of our
algorithm by employing reverse search. All complexity bounds refer to the
(oracle) Turing machine model. There is a number of polytope classes naturally
defined by oracles; for some of them neither vertex nor facet representation is
obvious. We consider two main applications, where we obtain (weakly) total
polynomial-time algorithms: Signed Minkowski sums of convex polytopes, where
polytopes can be subtracted provided the signed sum is a convex polytope, and
computation of secondary, resultant, and discriminant polytopes. Further
applications include convex combinatorial optimization and convex integer
programming, where we offer a new approach, thus removing the complexity's
exponential dependence in the dimension.
","[{'version': 'v1', 'created': 'Fri, 12 Dec 2014 13:34:22 GMT'}]",2021-04-26,"[['Emiris', 'Ioannis Z.', ''], ['Fisikopoulos', 'Vissarion', ''], ['Gärtner', 'Bernd', '']]","['general dimension', 'polytope oracle', 'edge-skeleton', 'total polynomialtime', 'linear optimization', 'vertex enumeration']"
4394,1809.10032,Taha Yasseri,Rachel Dinh and Patrick Gildersleve and Chris Blex and Taha Yasseri,"Computational Courtship: Understanding the Evolution of Online Dating
  through Large-scale Data Analysis","Preprint, under review","J Comput Soc Sc 5, 401-426 (2022)",10.1007/s42001-021-00132-w,,cs.CY cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Have we become more tolerant of dating people of different social backgrounds
compared to ten years ago? Has the rise of online dating exacerbated or
alleviated gender inequalities in modern courtship? Are the most attractive
people on these platforms necessarily the most successful? In this work, we
examine the mate preferences and communication patterns of male and female
users of the online dating site eHarmony over the past decade to identify how
attitudes and behaviors have changed over this time period. While other studies
have investigated disparities in user behavior between male and female users,
this study is unique in its longitudinal approach. Specifically, we analyze how
men and women differ in their preferences for certain traits in potential
partners and how those preferences have changed over time. The second line of
inquiry investigates to what extent physical attractiveness determines the rate
of messages a user receives, and how this relationship varies between men and
women. Thirdly, we explore whether online dating practices between males and
females have become more equal over time or if biases and inequalities have
remained constant (or increased). Fourthly, we study the behavioural traits in
sending and replying to messages based on one's own experience of receiving
messages and being replied to. Finally, we found that similarity between
profiles is not a predictor for success except for the number of children and
smoking habits. This work could have broader implications for shifting gender
norms and social attitudes, reflected in online courtship rituals. Apart from
the data-based research, we connect the results to existing theories that
concern the role of ICTs in societal change. As searching for love online
becomes increasingly common across generations and geographies, these findings
may shed light on how people can build relationships through the Internet.
","[{'version': 'v1', 'created': 'Wed, 26 Sep 2018 14:47:24 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Dec 2018 11:55:30 GMT'}, {'version': 'v3', 'created': 'Sun, 28 Jun 2020 14:48:42 GMT'}]",2023-01-05,"[['Dinh', 'Rachel', ''], ['Gildersleve', 'Patrick', ''], ['Blex', 'Chris', ''], ['Yasseri', 'Taha', '']]","['\u200bOnline Dating', 'Gender', 'Mating', 'Communication', 'Homophily']"
4395,1002.0214,Serge Samper,"Serge Samper (SYMME), Pierre-Antoine Adragna (SYMME), Hugues
  Favreliere (SYMME), Maurice Pillet (SYMME)","Modeling of 2D and 3D Assemblies Taking Into Account Form Errors of
  Plane Surfaces",,"Journal of Computing and Information Science in Engineering 9, 4
  (2009) 041005",10.1115/1.3249575,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The tolerancing process links the virtual and the real worlds. From the
former, tolerances define a variational geometrical language (geometric
parameters). From the latter, there are values limiting those parameters. The
beginning of a tolerancing process is in this duality. As high precision
assemblies cannot be analyzed with the assumption that form errors are
negligible, we propose to apply this process to assemblies with form errors
through a new way of allowing to parameterize forms and solve their assemblies.
The assembly process is calculated through a method of allowing to solve the 3D
assemblies of pairs of surfaces having form errors using a static equilibrium.
We have built a geometrical model based on the modal shapes of the ideal
surface. We compute for the completely deterministic contact points between
this pair of shapes according to a given assembly process. The solution gives
an accurate evaluation of the assembly performance. Then we compare the results
with or without taking into account the form errors. When we analyze a batch of
assemblies, the problem is to compute for the nonconformity rate of a pilot
production according to the functional requirements. We input probable errors
of surfaces (position, orientation, and form) in our calculus and we evaluate
the quality of the results compared with the functional requirements. The pilot
production then can or cannot be validated.
","[{'version': 'v1', 'created': 'Mon, 1 Feb 2010 10:15:35 GMT'}]",2010-02-02,"[['Samper', 'Serge', '', 'SYMME'], ['Adragna', 'Pierre-Antoine', '', 'SYMME'], ['Favreliere', 'Hugues', '', 'SYMME'], ['Pillet', 'Maurice', '', 'SYMME']]","['3D assembly', 'form errors', 'modal analysis', 'positioning force', 'statistical analysis', 'non conformity rate']"
4396,1510.04821,Evgenii Kotelnikov,"Evgenii Kotelnikov, Laura Kov\'acs, Giles Reger and Andrei Voronkov",The Vampire and the FOOL,,,10.1145/2854065.2854071,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents new features recently implemented in the theorem prover
Vampire, namely support for first-order logic with a first class boolean sort
(FOOL) and polymorphic arrays. In addition to having a first class boolean
sort, FOOL also contains if-then-else and let-in expressions. We argue that
presented extensions facilitate reasoning-based program analysis, both by
increasing the expressivity of first-order reasoners and by gains in
efficiency.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2015 09:24:17 GMT'}, {'version': 'v2', 'created': 'Sat, 5 Dec 2015 12:34:21 GMT'}]",2015-12-08,"[['Kotelnikov', 'Evgenii', ''], ['Kovács', 'Laura', ''], ['Reger', 'Giles', ''], ['Voronkov', 'Andrei', '']]","['automated theorem proving', 'first-order logic', 'program analysis', 'program verification', 'Vampire', 'TPTP']"
4397,1407.2206,Sanil Shanker  KP,"Sanil Shanker KP, Aaron Turner, Elizabeth Sherly, Jim Austin",Sequential Data Mining using Correlation Matrix Memory,"Networking and Information Technology (ICNIT), 2010 International
  Conference on",,10.1109/ICNIT.2010.5508469,,cs.OH,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper proposes a method for sequential data mining using correlation
matrix memory. Here, we use the concept of the Logical Match to mine the
indices of the sequential pattern. We demonstrate the uniqueness of the method
with both the artificial and the real datum taken from NCBI databank.
","[{'version': 'v1', 'created': 'Sun, 6 Jul 2014 15:21:35 GMT'}]",2014-07-09,"[['KP', 'Sanil Shanker', ''], ['Turner', 'Aaron', ''], ['Sherly', 'Elizabeth', ''], ['Austin', 'Jim', '']]","['Correlation  matrix  memory', 'Logical  Match', 'Sequential data mining']"
4398,1405.7290,Christian Jacobs,"Christian T. Jacobs, Alexandros Avdis, Gerard J. Gorman, Matthew D.
  Piggott","PyRDM: A Python-based library for automating the management and online
  publication of scientific software and data","Revised version. The main changes are: Added pdfLaTeX to the
  dependencies list; Improved Figure 1 to show the 'publish' option selected in
  Diamond; Added two paragraphs to explain why users would want to use PyRDM;
  Added some content on the PyRDM roadmap, and also some content regarding
  engagement with libraries and research software engineers",Journal of Open Research Software 2:e28 (2014) 1-6,10.5334/jors.bj,,cs.CE cs.DL cs.MS,http://creativecommons.org/licenses/by/3.0/,"  The recomputability and reproducibility of results from scientific software
requires access to both the source code and all associated input and output
data. However, the full collection of these resources often does not accompany
the key findings published in journal articles, thereby making it difficult or
impossible for the wider scientific community to verify the correctness of a
result or to build further research on it. This paper presents a new
Python-based library, PyRDM, whose functionality aims to automate the process
of sharing the software and data via online, citable repositories such as
Figshare. The library is integrated into the workflow of an open-source
computational fluid dynamics package, Fluidity, to demonstrate an example of
its usage.
","[{'version': 'v1', 'created': 'Wed, 28 May 2014 16:07:12 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Aug 2014 10:48:05 GMT'}]",2015-12-24,"[['Jacobs', 'Christian T.', ''], ['Avdis', 'Alexandros', ''], ['Gorman', 'Gerard J.', ''], ['Piggott', 'Matthew D.', '']]","['scientific software', 'data', 'automated publication', 'reproducibility', 'recomputability', 'Python', 'Figshare', 'GitHub']"
4399,1901.04068,Evangelos Kipouridis,"Evangelos Kipouridis, and Kostas Tsichlas",Longest Common Subsequence on Weighted Sequences,"This is an updated version of the paper accepted at CPM 2020 (Best
  Paper Award). Includes all proofs that did not fit the page limit, and
  corrections to some typos",,10.4230/LIPIcs.CPM.2020.19,,cs.CC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the general problem of the Longest Common Subsequence (LCS) on
weighted sequences. Weighted sequences are an extension of classical strings,
where in each position every letter of the alphabet may occur with some
probability. Previous results presented a PTAS and noticed that no FPTAS is
possible unless P=NP. In this paper we essentially close the gap between upper
and lower bounds by improving both. First of all, we provide an EPTAS for
bounded alphabets (which is the most natural case), and prove that there does
not exist any EPTAS for unbounded alphabets unless FPT=W[1]. Furthermore, under
the Exponential Time Hypothesis, we provide a lower bound which shows that no
significantly better PTAS can exist for unbounded alphabets. As a side note, we
prove that it is sufficient to work with only one threshold in the general
variant of the problem.
","[{'version': 'v1', 'created': 'Sun, 13 Jan 2019 21:28:35 GMT'}, {'version': 'v2', 'created': 'Sun, 19 Jul 2020 21:42:57 GMT'}]",2020-07-21,"[['Kipouridis', 'Evangelos', ''], ['Tsichlas', 'Kostas', '']]","['WLCS', 'LCS', 'weighted sequences', 'approximation algorithms', 'lower bound']"
4400,1911.11139,Amin Omidvar,"Amin Omidvar, Hossein Poormodheji, Aijun An, Gordon Edall",Learning to Determine the Quality of News Headlines,"10 Pages, Accepted at the 12th International Conference on Agents and
  Artificial Intelligence (ICAART) 2020",,10.5220/0009367504010409,,cs.IR cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today, most newsreaders read the online version of news articles rather than
traditional paper-based newspapers. Also, news media publishers rely heavily on
the income generated from subscriptions and website visits made by newsreaders.
Thus, online user engagement is a very important issue for online newspapers.
Much effort has been spent on writing interesting headlines to catch the
attention of online users. On the other hand, headlines should not be
misleading (e.g., clickbaits); otherwise, readers would be disappointed when
reading the content. In this paper, we propose four indicators to determine the
quality of published news headlines based on their click count and dwell time,
which are obtained by website log analysis. Then, we use soft target
distribution of the calculated quality indicators to train our proposed deep
learning model which can predict the quality of unpublished news headlines. The
proposed model not only processes the latent features of both headline and body
of the article to predict its headline quality but also considers the semantic
relation between headline and body as well. To evaluate our model, we use a
real dataset from a major Canadian newspaper. Results show our proposed model
outperforms other state-of-the-art NLP models.
","[{'version': 'v1', 'created': 'Tue, 26 Nov 2019 00:09:30 GMT'}, {'version': 'v2', 'created': 'Sun, 19 Apr 2020 23:42:19 GMT'}]",2020-04-21,"[['Omidvar', 'Amin', ''], ['Poormodheji', 'Hossein', ''], ['An', 'Aijun', ''], ['Edall', 'Gordon', '']]","['Headline Quality', 'Deep Learning', 'NLP']"
4401,1602.00572,Daniel Romero,"Daniel M. Romero, Brian Uzzi, and Jon Kleinberg",Social Networks Under Stress,"12 pages, 8 figures, Proceedings of the 25th ACM International World
  Wide Web Conference (WWW) 2016",,10.1145/2872427.2883063l,,cs.SI cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social network research has begun to take advantage of fine-grained
communications regarding coordination, decision-making, and knowledge sharing.
These studies, however, have not generally analyzed how external events are
associated with a social network's structure and communicative properties.
Here, we study how external events are associated with a network's change in
structure and communications. Analyzing a complete dataset of millions of
instant messages among the decision-makers in a large hedge fund and their
network of outside contacts, we investigate the link between price shocks,
network structure, and change in the affect and cognition of decision-makers
embedded in the network. When price shocks occur the communication network
tends not to display structural changes associated with adaptiveness. Rather,
the network ""turtles up"". It displays a propensity for higher clustering,
strong tie interaction, and an intensification of insider vs. outsider
communication. Further, we find changes in network structure predict shifts in
cognitive and affective processes, execution of new transactions, and local
optimality of transactions better than prices, revealing the important
predictive relationship between network structure and collective behavior
within a social network.
","[{'version': 'v1', 'created': 'Mon, 1 Feb 2016 15:58:29 GMT'}]",2016-02-02,"[['Romero', 'Daniel M.', ''], ['Uzzi', 'Brian', ''], ['Kleinberg', 'Jon', '']]","['Social Networks', 'Organizations', 'Temporal Dynamics', 'Collective Behavior']"
4402,0907.3342,Gerard Bloch,"Mustapha Ouladsine (LSIS), G\'erard Bloch (CRAN), Xavier Dovifaaz
  (CRAN)",Neural Modeling and Control of Diesel Engine with Pollution Constraints,15 pages,"Journal of Intelligent and Robotic Systems 41, 2-3 (2005) 157-171",10.1007/s10846-005-3806-y,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper describes a neural approach for modelling and control of a
turbocharged Diesel engine. A neural model, whose structure is mainly based on
some physical equations describing the engine behaviour, is built for the
rotation speed and the exhaust gas opacity. The model is composed of three
interconnected neural submodels, each of them constituting a nonlinear
multi-input single-output error model. The structural identification and the
parameter estimation from data gathered on a real engine are described. The
neural direct model is then used to determine a neural controller of the
engine, in a specialized training scheme minimising a multivariable criterion.
Simulations show the effect of the pollution constraint weighting on a
trajectory tracking of the engine speed. Neural networks, which are flexible
and parsimonious nonlinear black-box models, with universal approximation
capabilities, can accurately describe or control complex nonlinear systems,
with little a priori theoretical knowledge. The presented work extends optimal
neuro-control to the multivariable case and shows the flexibility of neural
optimisers. Considering the preliminary results, it appears that neural
networks can be used as embedded models for engine control, to satisfy the more
and more restricting pollutant emission legislation. Particularly, they are
able to model nonlinear dynamics and outperform during transients the control
schemes based on static mappings.
","[{'version': 'v1', 'created': 'Mon, 20 Jul 2009 05:58:24 GMT'}]",2019-08-24,"[['Ouladsine', 'Mustapha', '', 'LSIS'], ['Bloch', 'Gérard', '', 'CRAN'], ['Dovifaaz', 'Xavier', '', 'CRAN']]","['Diesel engine', 'nonlinear modelling', 'neural networks', 'neural controller', 'pollution reduction']"
4403,1810.09113,Frank Nielsen,Frank Nielsen and Richard Nock,The Bregman chord divergence,10 pages,GSI 2019: Geometric Science of Information pp 299-308,10.1007/978-3-030-26980-7_31,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distances are fundamental primitives whose choice significantly impacts the
performances of algorithms in machine learning and signal processing. However
selecting the most appropriate distance for a given task is an endeavor.
Instead of testing one by one the entries of an ever-expanding dictionary of
{\em ad hoc} distances, one rather prefers to consider parametric classes of
distances that are exhaustively characterized by axioms derived from first
principles. Bregman divergences are such a class. However fine-tuning a Bregman
divergence is delicate since it requires to smoothly adjust a functional
generator. In this work, we propose an extension of Bregman divergences called
the Bregman chord divergences. This new class of distances does not require
gradient calculations, uses two scalar parameters that can be easily tailored
in applications, and generalizes asymptotically Bregman divergences.
","[{'version': 'v1', 'created': 'Mon, 22 Oct 2018 07:11:11 GMT'}]",2020-10-01,"[['Nielsen', 'Frank', ''], ['Nock', 'Richard', '']]","['Bregman divergence', 'Jensen divergence', 'skewed divergence', 'clustering', 'information fusion']"
4404,1908.01894,Alex Weaver,"Michael Dinitz, Magn\'us M. Halld\'orsson, Calvin Newport, and Alex
  Weaver",The Capacity of Smartphone Peer-to-Peer Networks,,,10.4230/LIPIcs.DISC.2019.14,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study three capacity problems in the mobile telephone model, a network
abstraction that models the peer-to-peer communication capabilities implemented
in most commodity smartphone operating systems. The capacity of a network
expresses how much sustained throughput can be maintained for a set of
communication demands, and is therefore a fundamental bound on the usefulness
of a network. Because of this importance, wireless network capacity has been
active area of research for the last two decades.
  The three capacity problems that we study differ in the structure of the
communication demands. The first problem is pairwise capacity, where the
demands are (source, destination) pairs. Pairwise capacity is one of the most
classical definitions, as it was analyzed in the seminal paper of Gupta and
Kumar on wireless network capacity. The second problem we study is broadcast
capacity, in which a single source must deliver packets to all other nodes in
the network. Finally, we turn our attention to all-to-all capacity, in which
all nodes must deliver packets to all other nodes. In all three of these
problems we characterize the optimal achievable throughput for any given
network, and design algorithms which asymptotically match this performance. We
also study these problems in networks generated randomly by a process
introduced by Gupta and Kumar, and fully characterize their achievable
throughput.
  Interestingly, the techniques that we develop for all-to-all capacity also
allow us to design a one-shot gossip algorithm that runs within a
polylogarithmic factor of optimal in every graph. This largely resolves an open
question from previous work on the one-shot gossip problem in this model.
","[{'version': 'v1', 'created': 'Mon, 5 Aug 2019 22:52:48 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Aug 2019 18:27:11 GMT'}]",2019-08-09,"[['Dinitz', 'Michael', ''], ['Halldórsson', 'Magnús M.', ''], ['Newport', 'Calvin', ''], ['Weaver', 'Alex', '']]","['Capacity', 'Wireless', 'Mobile Telephone', 'Throughput']"
4405,1810.09558,Houssam Nassif,"Daniel N Hill, Houssam Nassif, Yi Liu, Anand Iyer, S V N Vishwanathan",An Efficient Bandit Algorithm for Realtime Multivariate Optimization,KDD'17 Audience Appreciation Award,"Daniel N. Hill, Houssam Nassif, Yi Liu, Anand Iyer, and S. V. N.
  Vishwanathan. 2017. An Efficient Bandit Algorithm for Realtime Multivariate
  Optimization. In Proceedings of KDD'17, Halifax, NS, Canada, pp. 1813-1821,
  2017",10.1145/3097983.3098184,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optimization is commonly employed to determine the content of web pages, such
as to maximize conversions on landing pages or click-through rates on search
engine result pages. Often the layout of these pages can be decoupled into
several separate decisions. For example, the composition of a landing page may
involve deciding which image to show, which wording to use, what color
background to display, etc. Such optimization is a combinatorial problem over
an exponentially large decision space. Randomized experiments do not scale well
to this setting, and therefore, in practice, one is typically limited to
optimizing a single aspect of a web page at a time. This represents a missed
opportunity in both the speed of experimentation and the exploitation of
possible interactions between layout decisions.
  Here we focus on multivariate optimization of interactive web pages. We
formulate an approach where the possible interactions between different
components of the page are modeled explicitly. We apply bandit methodology to
explore the layout space efficiently and use hill-climbing to select optimal
content in realtime. Our algorithm also extends to contextualization and
personalization of layout selection. Simulation results show the suitability of
our approach to large decision spaces with strong interactions between content.
We further apply our algorithm to optimize a message that promotes adoption of
an Amazon service. After only a single week of online optimization, we saw a
21% conversion increase compared to the median layout. Our technique is
currently being deployed to optimize content across several locations at
Amazon.com.
","[{'version': 'v1', 'created': 'Mon, 22 Oct 2018 21:09:38 GMT'}]",2018-10-24,"[['Hill', 'Daniel N', ''], ['Nassif', 'Houssam', ''], ['Liu', 'Yi', ''], ['Iyer', 'Anand', ''], ['Vishwanathan', 'S V N', '']]","['Multivariate optimization', 'multi-armed bandit', 'hill-climbing', 'A/Btesting']"
4406,1708.00251,Michael Gadermayr,"Michael Gadermayr, Ann-Kathrin Dombrowski, Barbara Mara Klinkhammer,
  Peter Boor, Dorit Merhof",CNN Cascades for Segmenting Whole Slide Images of the Kidney,,,10.1016/j.compmedimag.2018.11.002,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the increasing availability of whole slide scanners facilitating
digitization of histopathological tissue, there is a strong demand for the
development of computer based image analysis systems. In this work, the focus
is on the segmentation of the glomeruli constituting a highly relevant
structure in renal histopathology, which has not been investigated before in
combination with CNNs. We propose two different CNN cascades for segmentation
applications with sparse objects. These approaches are applied to the problem
of glomerulus segmentation and compared with conventional fully-convolutional
networks. Overall, with the best performing cascade approach, single CNNs are
outperformed and a pixel-level Dice similarity coefficient of 0.90 is obtained.
Combined with qualitative and further object-level analyses the obtained
results are assessed as excellent also compared to recent approaches. In
conclusion, we can state that especially one of the proposed cascade networks
proved to be a highly powerful tool for segmenting the renal glomeruli
providing best segmentation accuracies and also keeping the computing time at a
low level.
","[{'version': 'v1', 'created': 'Tue, 1 Aug 2017 11:13:04 GMT'}]",2020-04-24,"[['Gadermayr', 'Michael', ''], ['Dombrowski', 'Ann-Kathrin', ''], ['Klinkhammer', 'Barbara Mara', ''], ['Boor', 'Peter', ''], ['Merhof', 'Dorit', '']]","['cascades', 'neural networks', 'fully convolutional networks', 'glomeruli', 'kidney']"
4407,1903.10433,Qitan Wu,"Qitian Wu, Hengrui Zhang, Xiaofeng Gao, Peng He, Paul Weng, Han Gao,
  Guihai Chen","Dual Graph Attention Networks for Deep Latent Representation of
  Multifaceted Social Effects in Recommender Systems",Accepted by WWW2019 as a full paper with oral presentation,,10.1145/3308558.3313442,,cs.IR cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social recommendation leverages social information to solve data sparsity and
cold-start problems in traditional collaborative filtering methods. However,
most existing models assume that social effects from friend users are static
and under the forms of constant weights or fixed constraints. To relax this
strong assumption, in this paper, we propose dual graph attention networks to
collaboratively learn representations for two-fold social effects, where one is
modeled by a user-specific attention weight and the other is modeled by a
dynamic and context-aware attention weight. We also extend the social effects
in user domain to item domain, so that information from related items can be
leveraged to further alleviate the data sparsity problem. Furthermore,
considering that different social effects in two domains could interact with
each other and jointly influence user preferences for items, we propose a new
policy-based fusion strategy based on contextual multi-armed bandit to weigh
interactions of various social effects. Experiments on one benchmark dataset
and a commercial dataset verify the efficacy of the key components in our
model. The results show that our model achieves great improvement for
recommendation accuracy compared with other state-of-the-art social
recommendation methods.
","[{'version': 'v1', 'created': 'Mon, 25 Mar 2019 16:14:01 GMT'}]",2019-03-26,"[['Wu', 'Qitian', ''], ['Zhang', 'Hengrui', ''], ['Gao', 'Xiaofeng', ''], ['He', 'Peng', ''], ['Weng', 'Paul', ''], ['Gao', 'Han', ''], ['Chen', 'Guihai', '']]","['Social Recommendation', 'Graph Atention Network', 'Social Efect', 'Representation Learning', 'Contextual Multi-Armed Bandit']"
4408,1808.02862,Roozbeh Khodambashi,"Behafarid Darvish, Siamak Najarian, Elham Shirzad and Roozbeh
  Khodambashi",A Novel Tactile Force Probe for Tissue Stiffness Classification,,"American Journal of Applied Sciences 6 (3): 512-517, 2009",10.3844/ajassp.2009.512.517,,cs.RO physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, we have proposed a new type of tactile sensor that is capable
of detecting the stiffness of soft objects. The sensor consists of a brass
cylinder with an axial bore. An iron core can easily move inside the bore.
Three peripheral bobbins were machined in the cylinder around which three coils
have been wound. One of the coils was excited with an alternating current which
caused a voltage to be induced in two other coils. A return spring was used to
return the core to its initial position after it has been moved. The sensor was
pressed against the surface of the object whose stiffness was going to be
measured. The position of the core in this state was depended on the stiffness
of the given object and the spring constant and was measured by measuring the
change in the induced voltage in secondary coils. The proposed sensor was
capable of measuring two contact parameters namely the applied force and the
stiffness of the object. Using the data of this sensor, three different
objects, made of polyurethane, silicon rubber and paraffin gel were
discriminated. Thus, this sensor could be used in robot hands and minimally
invasive surgery tools to improve their operation.
","[{'version': 'v1', 'created': 'Wed, 8 Aug 2018 17:06:22 GMT'}]",2018-08-13,"[['Darvish', 'Behafarid', ''], ['Najarian', 'Siamak', ''], ['Shirzad', 'Elham', ''], ['Khodambashi', 'Roozbeh', '']]","['Tactile sensor', 'contact force', 'softness classification', 'minimally invasive surgery']"
4409,2112.07259,Yazheng Yang,"Yazheng Yang, Boyuan Pan, Deng Cai, Huan Sun",TopNet: Learning from Neural Topic Model to Generate Long Stories,"KDD2021, 9 pages","Yang, Yazheng, Boyuan Pan, Deng Cai, and Huan Sun. ""TopNet:
  Learning from Neural Topic Model to Generate Long Stories."" In Proceedings of
  the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pp.
  1997-2005. 2021",10.1145/3447548.3467410,,cs.LG cs.CL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Long story generation (LSG) is one of the coveted goals in natural language
processing. Different from most text generation tasks, LSG requires to output a
long story of rich content based on a much shorter text input, and often
suffers from information sparsity. In this paper, we propose \emph{TopNet} to
alleviate this problem, by leveraging the recent advances in neural topic
modeling to obtain high-quality skeleton words to complement the short input.
In particular, instead of directly generating a story, we first learn to map
the short text input to a low-dimensional topic distribution (which is
pre-assigned by a topic model). Based on this latent topic distribution, we can
use the reconstruction decoder of the topic model to sample a sequence of
inter-related words as a skeleton for the story. Experiments on two benchmark
datasets show that our proposed framework is highly effective in skeleton word
selection and significantly outperforms the state-of-the-art models in both
automatic evaluation and human evaluation.
","[{'version': 'v1', 'created': 'Tue, 14 Dec 2021 09:47:53 GMT'}]",2021-12-15,"[['Yang', 'Yazheng', ''], ['Pan', 'Boyuan', ''], ['Cai', 'Deng', ''], ['Sun', 'Huan', '']]","['Long Story Generation', 'Story Telling', 'Topic Model', 'Natural Language Processing', 'Deep Learning']"
4410,2102.08710,Miguel Caballer,"Miguel Caballer, Marica Antonacci, Zden\v{e}k \v{S}ustr, Michele
  Perniola, Germ\'an Molt\'o",Deployment of Elastic Virtual Hybrid Clusters Across Cloud Sites,"33 pages, 11 figures","J Grid Computing 19, 4 (2021)",10.1007/s10723-021-09543-5,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Virtual clusters are widely used computing platforms than can be deployed in
multiple cloud platforms. The ability to dynamically grow and shrink the number
of nodes has paved the way for customised elastic computing both for High
Performance Computing and High Throughput Computing workloads. However,
elasticity is typically restricted to a single cloud site, thus hindering the
ability to provision computational resources from multiple geographically
distributed cloud sites. To this aim, this paper introduces an architecture of
open-source components that coherently deploy a virtual elastic cluster across
multiple cloud sites to perform large-scale computing. These hybrid virtual
elastic clusters are automatically deployed and configured using an
Infrastructure as Code (IaC) approach on a distributed hybrid testbed that
spans different organizations, including on-premises and public clouds,
supporting automated tunneling of communications across the cluster nodes with
advanced VPN topologies. The results indicate that cluster-based computing of
embarrassingly parallel jobs can benefit from hybrid virtual clusters that
aggregate computing resources from multiple cloud back-ends and bring them
together into a dedicated, albeit virtual network.
  The work presented in this article has been partially funded by the European
Union's (EU) Horizon 2020 research project DEEP Hybrid-DataCloud (grant
agreement No 777435).
","[{'version': 'v1', 'created': 'Wed, 17 Feb 2021 11:48:12 GMT'}]",2021-02-18,"[['Caballer', 'Miguel', ''], ['Antonacci', 'Marica', ''], ['Šustr', 'Zdeněk', ''], ['Perniola', 'Michele', ''], ['Moltó', 'Germán', '']]","['Cloud Computing', 'Network virtualization', 'Cluster computing']"
4411,1806.01140,Peter Gracar,Peter Gracar and Alexandre Stauffer,"Percolation of Lipschitz surface and tight bounds on the spread of
  information among mobile agents",arXiv admin note: text overlap with arXiv:1701.08021,,10.4230/LIPIcs.APPROX-RANDOM.2018.39,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of spread of information among mobile agents on the
torus. The agents are initially distributed as a Poisson point process on the
torus, and move as independent simple random walks. Two agents can share
information whenever they are at the same vertex of the torus. We study the
so-called flooding time: the amount of time it takes for information to be
known by all agents. We establish a tight upper bound on the flooding time, and
introduce a technique which we believe can be applicable to analyze other
processes involving mobile agents.
","[{'version': 'v1', 'created': 'Mon, 4 Jun 2018 14:16:52 GMT'}]",2019-04-02,"[['Gracar', 'Peter', ''], ['Stauffer', 'Alexandre', '']]","['Lipschitz surface', 'spread of information', 'flooding time', 'moving agents']"
4412,1406.5000,Ravi Khatwal,"Ravi Khatwal, Manoj Kumar Jain","Application Specific Cache Simulation Analysis for Application Specific
  Instruction set Processor",ASIP simulation,,10.5120/15782-4526,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An Efficient Simulation of application specific instruction-set processors
(ASIP) is a challenging onus in the area of VLSI design. This paper
reconnoiters the possibility of use of ASIP simulators for ASIP Simulation.
This proposed study allow as the simulation of the cache memory design with
various ASIP simulators like Simple scalar and VEX. In this paper we have
implemented the memory configuration according to desire application. These
simulators performs the cache related results such as cache name, sets, cache
associativity, cache block size, cache replacement policy according to specific
application.
","[{'version': 'v1', 'created': 'Thu, 19 Jun 2014 10:40:23 GMT'}]",2014-06-20,"[['Khatwal', 'Ravi', ''], ['Jain', 'Manoj Kumar', '']]","['ASIP Simulators', 'VEX Simulator', 'SimpleScalar Simulator', 'Simulation', 'Cache Memory Design']"
4413,1410.1729,Andrey Shchurov,Andrey A. Shchurov,A Formal Model of Distributed Systems For Test Generation Missions,"6 pages, 9 figures","International Journal of Computer Trends and Technology (IJCTT)
  V15(2):128-133, September 2014",10.14445/22312803/IJCTT-V15P128,,cs.SE cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, deployment of distributed systems sets high requirements for
procedures and tools for the complex testing of these systems - virtualization
and cloud technologies make another level of system complexity. As a possible
solution, it is necessary to determine a formal list of control objectives -
checklists. The automated generation of checklists involves analyzing system
models (with the analysis covering paths in a model). But complex distributed
systems are usually a set of coexisting topologies which interact and depend on
each other and it is necessary to use several models in order to cover
different aspects. This work introduces a formal four layered model for test
generation missions on the basis of the component-based approach and the
concept of layered networks. The interlayer mapping determines how the
topological properties on different layers affect each other and, as a
consequence, represents technologies (virtualization, clustering, etc.) used to
build distributed systems
","[{'version': 'v1', 'created': 'Mon, 6 Oct 2014 10:57:38 GMT'}]",2014-10-08,"[['Shchurov', 'Andrey A.', '']]","['Formal models', 'multi-layer graphs', 'distributed systems', 'automated test generation']"
4414,0802.0603,Julien Bringer,Julien Bringer and Herve Chabanne,"Trusted-HB: a low-cost version of HB+ secure against Man-in-The-Middle
  attacks",submitted to IEEE Transactions on Information Theory,IEEE Trans. IT. 54:9 (2008) 4339-4342,10.1109/TIT.2008.928290,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since the introduction at Crypto'05 by Juels and Weis of the protocol HB+, a
lightweight protocol secure against active attacks but only in a detection
based-model, many works have tried to enhance its security. We propose here a
new approach to achieve resistance against Man-in-The-Middle attacks. Our
requirements - in terms of extra communications and hardware - are surprisingly
low.
","[{'version': 'v1', 'created': 'Tue, 5 Feb 2008 20:39:03 GMT'}]",2009-01-08,"[['Bringer', 'Julien', ''], ['Chabanne', 'Herve', '']]","['RFID', 'HB+ protocol', 'Low-cost cryptography', 'Authentication', 'Man-in-The-Middle attacks']"
4415,1309.2426,Rashmi Rai,"Rashmi Rai, G.Sahoo, S.Mehfuz","Securing Software as a Service Model of Cloud Computing: Issues and
  Solutions",,"International Journal on Cloud Computing: Services and
  Architecture (IJCCSA) ,Vol.3, No.4, August 2013",10.5121/ijccsa.2013.3401,,cs.DC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing, undoubtedly, has become the buzzword in the IT industry
today. Looking at the potential impact it has on numerous business applications
as well as in our everyday life, it can certainly be said that this disruptive
technology is here to stay. Many of the features that make cloud computing
attractive, have not just challenged the existing security system, but have
also revealed new security issues. This paper provides an insightful analysis
of the existing status on cloud computing security issues based on a detailed
survey carried by the author. It also makes an attempt to describe the security
challenges in Software as a Service (SaaS) model of cloud computing and also
endeavors to provide future security research directions.
","[{'version': 'v1', 'created': 'Tue, 10 Sep 2013 09:23:16 GMT'}]",2013-09-11,"[['Rai', 'Rashmi', ''], ['Sahoo', 'G.', ''], ['Mehfuz', 'S.', '']]","['Cloud Computing', 'Software as a Service', 'Security Challenges']"
4416,1104.1905,Carsten Lemmen,Carsten Lemmen and Detlef Gronenborn and Kai W. Wirtz,A simulation of the Neolithic transition in Western Eurasia,"Accepted Author Manuscript version accepted for publication in
  Journal of Archaeological Science. A definitive version will be subsequently
  published in the Journal of Archaological Science","Journal of Archaeological Science Vol 38 (12), pp. 3459-3470, 2011",10.1016/j.jas.2011.08.008,,cs.MA q-bio.PE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Farming and herding were introduced to Europe from the Near East and
Anatolia; there are, however, considerable arguments about the mechanisms of
this transition. Were it people who moved and outplaced the indigenous hunter-
gatherer groups or admixed with them? Or was it just material and information
that moved-the Neolithic Package-consisting of domesticated plants and animals
and the knowledge of its use? The latter process is commonly referred to as
cultural diffusion and the former as demic diffusion. Despite continuous and
partly combined efforts by archaeologists, anthropologists, linguists,
paleontologists and geneticists a final resolution of the debate has not yet
been reached. In the present contribution we interpret results from the Global
Land Use and technological Evolution Simulator (GLUES), a mathematical model
for regional sociocultural development embedded in the western Eurasian
geoenvironmental context during the Holocene. We demonstrate that the model is
able to realistically hindcast the expansion speed and the inhomogeneous
space-time evolution of the transition to agropastoralism in Europe. GLUES, in
contrast to models that do not resolve endogenous sociocultural dynamics, also
describes and explains how and why the Neolithic advanced in stages. In the
model analysis, we uncouple the mechanisms of migration and information
exchange. We find that (1) an indigenous form of agropastoralism could well
have arisen in certain Mediterranean landscapes, but not in Northern and
Central Europe, where it depended on imported technology and material, (2) both
demic diffusion by migration or cultural diffusion by trade may explain the
western European transition equally well, (3) [...]
","[{'version': 'v1', 'created': 'Mon, 11 Apr 2011 11:15:04 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Aug 2011 08:14:41 GMT'}]",2011-11-08,"[['Lemmen', 'Carsten', ''], ['Gronenborn', 'Detlef', ''], ['Wirtz', 'Kai W.', '']]","['Europe', 'Linearbandkeramik', 'cultural diffusion', 'demic diffusion', 'agriculture', 'adaptation', 'migration', 'modelling']"
4417,1812.03058,Tobias Kapp\'e,"Tobias Kapp\'e and Paul Brunet and Bas Luttik and Alexandra Silva and
  Fabio Zanasi","On Series-Parallel Pomset Languages: Rationality, Context-Freeness and
  Automata",Accepted manuscript,,10.1016/j.jlamp.2018.12.001,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Concurrent Kleene Algebra (CKA) is a formalism to study concurrent programs.
Like previous Kleene Algebra extensions, developing a correspondence between
denotational and operational perspectives is important, for both foundations
and applications. This paper takes an important step towards such a
correspondence, by precisely relating bi-Kleene Algebra (BKA), a fragment of
CKA, to a novel type of automata, pomset automata (PAs). We show that PAs can
implement the BKA semantics of series-parallel rational expressions, and that a
class of PAs can be translated back to these expressions. We also characterise
the behavior of general PAs in terms of context-free pomset grammars;
consequently, universality, equivalence and series-parallel rationality of
general PAs are undecidable.
","[{'version': 'v1', 'created': 'Fri, 7 Dec 2018 15:04:39 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Dec 2018 10:51:49 GMT'}]",2018-12-17,"[['Kappé', 'Tobias', ''], ['Brunet', 'Paul', ''], ['Luttik', 'Bas', ''], ['Silva', 'Alexandra', ''], ['Zanasi', 'Fabio', '']]","['Concurrency', 'Series-Rational Expressions', 'Kleene Algebra', 'Pomsets', 'Pomset Automata', 'Brzozowski derivatives', 'Kleene theorem']"
4418,2103.07779,Robin Swezey,"Robin Swezey, Young-joo Chung",Recommending Short-lived Dynamic Packages for Golf Booking Services,,"In Proceedings of the 24th ACM International on Conference on
  Information and Knowledge Management (CIKM 2015). Association for Computing
  Machinery, New York, NY, USA, 1779-1782",10.1145/2806416.2806608,,cs.IR cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce an approach to recommending short-lived dynamic packages for
golf booking services. Two challenges are addressed in this work. The first is
the short life of the items, which puts the system in a state of a permanent
cold start. The second is the uninformative nature of the package attributes,
which makes clustering or figuring latent packages challenging. Although such
settings are fairly pervasive, they have not been studied in traditional
recommendation research, and there is thus a call for original approaches for
recommender systems. In this paper, we introduce a hybrid method that leverages
user analysis and its relation to the packages, as well as package pricing and
environmental analysis, and traditional collaborative filtering. The proposed
approach achieved appreciable improvement in precision compared with baselines.
","[{'version': 'v1', 'created': 'Sat, 13 Mar 2021 19:48:04 GMT'}]",2021-03-16,"[['Swezey', 'Robin', ''], ['Chung', 'Young-joo', '']]","['Dynamic packages', 'cold-start', 'recommendation', 'field study', 'user analysis']"
4419,1405.5704,Rolando Trujillo-Rasua,"Rolando Trujillo-Rasua, Benjamin Martin, Gildas Avoine","Distance-bounding facing both mafia and distance frauds: Technical
  report*","This 23-page long document contains content accepted for publication
  at the IEEE Transactions on Wireless Communications",,10.1109/TWC.2014.2323979,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Contactless technologies such as RFID, NFC, and sensor networks are
vulnerable to mafia and distance frauds. Both frauds aim at passing an
authentication protocol by cheating on the actual distance between the prover
and the verifier. To cope these security issues, distance-bounding protocols
have been designed. However, none of the current proposals simultaneously
resists to these two frauds without requiring additional memory and
computation. The situation is even worse considering that just a few
distance-bounding protocols are able to deal with the inherent background noise
on the communication channels. This article introduces a noise-resilient
distance-bounding protocol that resists to both mafia and distance frauds. The
security of the protocol is analyzed with respect to these two frauds in both
scenarios, namely noisy and noiseless channels. Analytical expressions for the
adversary's success probabilities are provided, and are illustrated by
experimental results. The analysis, performed in an already existing framework
for fairness reasons, demonstrates the undeniable advantage of the introduced
lightweight design over the previous proposals.
","[{'version': 'v1', 'created': 'Thu, 22 May 2014 10:23:35 GMT'}]",2016-11-17,"[['Trujillo-Rasua', 'Rolando', ''], ['Martin', 'Benjamin', ''], ['Avoine', 'Gildas', '']]","['Authentication', 'distance-bounding', 'relay attack', 'mafia fraud', 'distance fraud', 'noise']"
4420,1604.08059,Hui Huang,Hui Huang,New Bounds for Hypergeometric Creative Telescoping,"8 pages, ISSAC 2016 submission",,10.1145/2930889.2930893,,cs.SC math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Based on a modified version of Abramov-Petkov\v{s}ek reduction, a new
algorithm to compute minimal telescopers for bivariate hypergeometric terms was
developed last year. We investigate further in this paper and present a new
argument for the termination of this algorithm, which provides an independent
proof of the existence of telescopers and even enables us to derive lower as
well as upper bounds for the order of telescopers for hypergeometric terms.
Compared to the known bounds in the literature, our bounds are sometimes
better, and never worse than the known ones.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2016 13:28:12 GMT'}, {'version': 'v2', 'created': 'Sun, 1 May 2016 13:53:59 GMT'}, {'version': 'v3', 'created': 'Sat, 7 May 2016 03:36:19 GMT'}, {'version': 'v4', 'created': 'Fri, 13 May 2016 12:48:42 GMT'}]",2016-05-16,"[['Huang', 'Hui', '']]","['Modified Abramov-Petkovˇsek reduction', 'Hypergeometricterm', 'Telescoper', 'Order bound']"
4421,1805.10049,Niranjan Saikumar,"Lennart van Duist, Gijs van der Gugten, Daan Toten, Niranjan Saikumar,
  Hassan HosseinNia",FLOreS - Fractional order loop shaping MATLAB toolbox,"3rd IFAC Conference on Advances in Proportional-Integral-Derivative
  Control 2018",,10.1016/j.ifacol.2018.06.152,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel toolbox named FLOreS is presented for intuitive design of fractional
order controllers (FOC) using industry standard loop shaping technique. This
will allow control engineers to use frequency response data (FRD) of the plant
to design FOCs by shaping the open loop to meet the necessary specifications of
stability, robustness, tracking, precision and bandwidth. FLOreS provides a
graphical approach using closed-loop sensitivity functions for overall insight
into system performance. The main advantage over existing optimization
toolboxes for FOC is that the engineer can use prior knowledge and expertise of
plant during design of FOC. Different approximation methods for fractional
order filters are also included for greater freedom of final implementation.
This combined with the included example plants enables additionally to be used
as an educational tool. FLOreS has been used for design and implementation of
both integer and fractional order controllers on a precision stage to prove
industry readiness.
","[{'version': 'v1', 'created': 'Fri, 25 May 2018 09:03:38 GMT'}]",2018-07-02,"[['van Duist', 'Lennart', ''], ['van der Gugten', 'Gijs', ''], ['Toten', 'Daan', ''], ['Saikumar', 'Niranjan', ''], ['HosseinNia', 'Hassan', '']]","['Motion Control', 'Loop shaping', 'Fractional order', 'FOPID']"
4422,1502.06691,Kwangsu Lee,"Kwangsu Lee, Dong Hoon Lee, Moti Yung","Sequential Aggregate Signatures with Short Public Keys without Random
  Oracles",39 pages in Theoret. Comput. Sci. (2015),,10.1016/j.tcs.2015.02.019,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The notion of aggregate signature has been motivated by applications and it
enables any user to compress different signatures signed by different signers
on different messages into a short signature. Sequential aggregate signature,
in turn, is a special kind of aggregate signature that only allows a signer to
add his signature into an aggregate signature in sequential order. This latter
scheme has applications in diversified settings such as in reducing bandwidth
of certificate chains and in secure routing protocols. Lu, Ostrovsky, Sahai,
Shacham, and Waters (EUROCRYPT 2006) presented the first sequential aggregate
signature scheme in the standard model. The size of their public key, however,
is quite large (i.e., the number of group elements is proportional to the
security parameter), and therefore, they suggested as an open problem the
construction of such a scheme with short keys.
  In this paper, we propose the first sequential aggregate signature schemes
with short public keys (i.e., a constant number of group elements) in prime
order (asymmetric) bilinear groups that are secure under static assumptions in
the standard model. Furthermore, our schemes employ a constant number of
pairing operations per message signing and message verification operation.
Technically, we start with a public-key signature scheme based on the recent
dual system encryption technique of Lewko and Waters (TCC 2010). This technique
cannot directly provide an aggregate signature scheme since, as we observed,
additional elements should be published in a public key to support aggregation.
Thus, our constructions are careful augmentation techniques for the dual system
technique to allow it to support sequential aggregate signature schemes. We
also propose a multi-signature scheme with short public parameters in the
standard model.
","[{'version': 'v1', 'created': 'Tue, 24 Feb 2015 05:51:56 GMT'}]",2015-02-25,"[['Lee', 'Kwangsu', ''], ['Lee', 'Dong Hoon', ''], ['Yung', 'Moti', '']]","['Public-key signature', 'Aggregate signature', 'Sequential aggregate signature', 'Dual system encryption', 'Bilinear maps']"
4423,2003.12419,Vlad-Florin Dr\u{a}goi,Vlad-Florin Dr\u{a}goi and Simon R. Cowell and Valeriu Beiu,"Tight Bounds on the Coeffcients of Consecutive $k$-out-of-$n$:$F$
  Systems","10 pages, 3 figures, accepted for presentation at the International
  Conference on Computers Communications and Control (ICCCC), May 2020","Intelligent Methods in Computing, Communications and Control.
  ICCCC 2020",10.1007/978-3-030-53651-0_3,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we compute the coefficients of the reliability polynomial of a
consecutive-$k$-out-of-$n$:$F$ system, in Bernstein basis, using the
generalized Pascal coefficients. Based on well-known combinatorial properties
of the generalized Pascal triangle we determine simple closed formulae for the
reliability polynomial of a consecutive system for particular ranges of $k$.
Moreover, for the remaining ranges of $k$ (where we were not able to determine
simple closed formulae), we establish easy to calculate sharp bounds for the
reliability polynomial of a consecutive system.
","[{'version': 'v1', 'created': 'Fri, 27 Mar 2020 13:57:20 GMT'}]",2021-12-14,"[['Drăgoi', 'Vlad-Florin', ''], ['Cowell', 'Simon R.', ''], ['Beiu', 'Valeriu', '']]","['Consecutive systems', 'Generalized Pascal triangles', 'Bernstein basis', 'Reliability polynomial']"
4424,1902.00712,Flavio Moraes,"Flavio C. D. Moraes, Ana Lia Leonel, Pedro H. C. Torres, Pedro R.
  Jacobi, Sandra Momm",Climate Change and Social Sciences: a bibliometric analysis,13 pages 10 figures,"V!rus, Sao Carlos, 20 (2020)",10.4237/virus_journal,,cs.DL cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The complexity of emergent wicked problems, such as climate change,
culminates in a reformulation of how we think about society and mobilize
scientists from various disciplines to seek solutions and perspectives on the
problem. From an epistemological point of view, it is essential to evaluate how
such topics can be developed inside the academic arena but, to do that, it is
necessary to perform complex analysis of the great number of recent academic
publications. In this work, we discuss how climate change has been addressed by
social sciences in practice. Can we observe the development of a new
epistemology by the emergence of the climate change debate? Are there
contributions in academic journals within the field of social sciences
addressing climate change? Which journals are these? Who are the authors? To
answer these questions, we developed an innovative method combining different
tools to search, filter, and analyze the impact of the academic production
related to climate change in social sciences in the most relevant journals.
","[{'version': 'v1', 'created': 'Sat, 2 Feb 2019 13:00:26 GMT'}, {'version': 'v2', 'created': 'Sun, 26 Jul 2020 05:53:51 GMT'}, {'version': 'v3', 'created': 'Tue, 4 Aug 2020 18:18:11 GMT'}]",2020-08-06,"[['Moraes', 'Flavio C. D.', ''], ['Leonel', 'Ana Lia', ''], ['Torres', 'Pedro H. C.', ''], ['Jacobi', 'Pedro R.', ''], ['Momm', 'Sandra', '']]","['Bibliometric analysis', 'Algorithms', 'Climate change', 'Social Sciences', 'Natural Sciences']"
4425,1501.01083,Mohana S H,"S.H. Mohana, C.J. Prabhakar",Stem-Calyx Recognition of an Apple using Shape Descriptors,"15 pages, 10 figures and 2 tables in Signal & Image Processing : An
  International Journal (SIPIJ) Vol.5, No.6, December 2014",,10.5121/sipij.2014.5602,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper presents a novel method to recognize stem - calyx of an apple
using shape descriptors. The main drawback of existing apple grading techniques
is that stem - calyx part of an apple is treated as defects, this leads to poor
grading of apples. In order to overcome this drawback, we proposed an approach
to recognize stem-calyx and differentiated from true defects based on shape
features. Our method comprises of steps such as segmentation of apple using
grow-cut method, candidate objects such as stem-calyx and small defects are
detected using multi-threshold segmentation. The shape features are extracted
from detected objects using Multifractal, Fourier and Radon descriptor and
finally stem-calyx regions are recognized and differentiated from true defects
using SVM classifier. The proposed algorithm is evaluated using experiments
conducted on apple image dataset and results exhibit considerable improvement
in recognition of stem-calyx region compared to other techniques.
","[{'version': 'v1', 'created': 'Tue, 6 Jan 2015 05:51:23 GMT'}]",2015-01-07,"[['Mohana', 'S. H.', ''], ['Prabhakar', 'C. J.', '']]","['Stem-calyx recognition', 'Grow-cut', 'Multithreshold segmentation', 'Multifractal dimension', 'Radon transform', 'Fourier transform', 'SVM             1']"
4426,1101.0198,Sasikala Subramaniam,"S.K. Jayanthi, S. Sasikala",Link Spam Detection based on DBSpamClust with Fuzzy C-means Clustering,10 PAGES 6 FIGURES,"International Journal of Next-Generation Networks (IJNGN) Vol.2,
  No.4, December 2010",10.5121/ijngn.2010.2401,,cs.IR cs.IT cs.SI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Search engine became omnipresent means for ingoing to the web. Spamming
Search engine is the technique to deceiving the ranking in search engine and it
inflates the ranking. Web spammers have taken advantage of the vulnerability of
link based ranking algorithms by creating many artificial references or links
in order to acquire higher-than-deserved ranking n search engines' results.
Link based algorithms such as PageRank, HITS utilizes the structural details of
the hyperlinks for ranking the content in the web. In this paper an algorithm
DBSpamClust is proposed for link spam detection. As showing through experiments
such a method can filter out web spam effectively
","[{'version': 'v1', 'created': 'Fri, 31 Dec 2010 03:58:45 GMT'}]",2011-01-04,"[['Jayanthi', 'S. K.', ''], ['Sasikala', 'S.', '']]","['DBSpamClust', 'Link spam', 'HITS', 'PageRank', 'Hub', 'Authority', 'Search engine']"
4427,1207.3867,Md. Hasnat Kabir Dr,"M. G. Rashed, M. Hasnat Kabir, M. Sajjadur Rahim, and Sk. Enayet Ullah",CBHRP: A Cluster Based Routing Protocol for Wireless Sensor Network,11 pages,"Computer Science & Engineering: An International Journal (CSEIJ),
  Vol.1, No.3, August 2011",10.5121/cseij.2011.1301,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new two layer hierarchical routing protocol called Cluster Based
Hierarchical Routing Protocol (CBHRP) is proposed in this paper. It is an
extension of LEACH routing protocol. We introduce cluster head-set idea for
cluster-based routing where several clusters are formed with the deployed
sensors to collect information from target field. On rotation basis, a head-set
member receives data from the neighbor nodes and transmits the aggregated
results to the distance base station. This protocol reduces energy consumption
quite significantly and prolongs the life time of sensor network. It is found
that CBHRP performs better than other well accepted hierarchical routing
protocols like LEACH in term of energy consumption and time requirement.
","[{'version': 'v1', 'created': 'Tue, 17 Jul 2012 03:38:06 GMT'}]",2012-07-18,"[['Rashed', 'M. G.', ''], ['Kabir', 'M. Hasnat', ''], ['Rahim', 'M. Sajjadur', ''], ['Ullah', 'Sk. Enayet', '']]","['Wireless Sensor Network', 'Cluster', 'Protocols', 'Routing']"
4428,1907.09239,Tom Hanika,Maximilian Stubbemann and Tom Hanika and Gerd Stumme,Orometric Methods in Bounded Metric Data,"8 Pages, 1 figure",,10.1007/978-3-030-44584-3_39,,cs.AI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A large amount of data accommodated in knowledge graphs (KG) is actually
metric. For example, the Wikidata KG contains a plenitude of metric facts about
geographic entities like cities, chemical compounds or celestial objects. In
this paper, we propose a novel approach that transfers orometric (topographic)
measures to bounded metric spaces. While these methods were originally designed
to identify relevant mountain peaks on the surface of the earth, we demonstrate
a notion to use them for metric data sets in general. Notably, metric sets of
items inclosed in knowledge graphs. Based on this we present a method for
identifying outstanding items using the transferred valuations functions
'isolation' and 'prominence'. Building up on this we imagine an item
recommendation process. To demonstrate the relevance of the novel valuations
for such processes we use item sets from the Wikidata knowledge graph. We then
evaluate the usefulness of 'isolation' and 'prominence' empirically in a
supervised machine learning setting. In particular, we find structurally
relevant items in the geographic population distributions of Germany and
France.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2019 11:30:06 GMT'}]",2020-10-27,"[['Stubbemann', 'Maximilian', ''], ['Hanika', 'Tom', ''], ['Stumme', 'Gerd', '']]","['metric spaces', 'orometric functions', 'knowledge graphs', 'classification']"
4429,1801.04380,Linnan Wang,"Linnan Wang, Jinmian Ye, Yiyang Zhao, Wei Wu, Ang Li, Shuaiwen Leon
  Song, Zenglin Xu, Tim Kraska","SuperNeurons: Dynamic GPU Memory Management for Training Deep Neural
  Networks","PPoPP '2018: 23nd ACM SIGPLAN Symposium on Principles and Practice of
  Parallel Programming",,10.1145/3178487.3178491,,cs.DC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Going deeper and wider in neural architectures improves the accuracy, while
the limited GPU DRAM places an undesired restriction on the network design
domain. Deep Learning (DL) practitioners either need change to less desired
network architectures, or nontrivially dissect a network across multiGPUs.
These distract DL practitioners from concentrating on their original machine
learning tasks. We present SuperNeurons: a dynamic GPU memory scheduling
runtime to enable the network training far beyond the GPU DRAM capacity.
SuperNeurons features 3 memory optimizations, \textit{Liveness Analysis},
\textit{Unified Tensor Pool}, and \textit{Cost-Aware Recomputation}, all
together they effectively reduce the network-wide peak memory usage down to the
maximal memory usage among layers. We also address the performance issues in
those memory saving techniques. Given the limited GPU DRAM, SuperNeurons not
only provisions the necessary memory for the training, but also dynamically
allocates the memory for convolution workspaces to achieve the high
performance. Evaluations against Caffe, Torch, MXNet and TensorFlow have
demonstrated that SuperNeurons trains at least 3.2432 deeper network than
current ones with the leading performance. Particularly, SuperNeurons can train
ResNet2500 that has $10^4$ basic network layers on a 12GB K40c.
","[{'version': 'v1', 'created': 'Sat, 13 Jan 2018 04:11:41 GMT'}]",2018-01-17,"[['Wang', 'Linnan', ''], ['Ye', 'Jinmian', ''], ['Zhao', 'Yiyang', ''], ['Wu', 'Wei', ''], ['Li', 'Ang', ''], ['Song', 'Shuaiwen Leon', ''], ['Xu', 'Zenglin', ''], ['Kraska', 'Tim', '']]","['Neural Networks', 'GPU Memory Management', 'Runtime Scheduling']"
4430,2105.10756,Caglar Yildirim,"Caglar Yildirim, Tara OGrady",The Efficacy of a Virtual Reality-Based Mindfulness Intervention,"2020 IEEE International Conference on Artificial Intelligence and
  Virtual Reality (AIVR)",,10.1109/AIVR50618.2020.00035,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Mindfulness can be defined as increased awareness of and sustained
attentiveness to the present moment. Recently, there has been a growing
interest in the applications of mindfulness for empirical research in wellbeing
and the use of virtual reality (VR) environments and 3D interfaces as a conduit
for mindfulness training. Accordingly, the current experiment investigated
whether a brief VR-based mindfulness intervention could induce a greater level
of state mindfulness, when compared to an audio-based intervention and control
group. Results indicated two mindfulness interventions, VR-based and
audio-based, induced a greater state of mindfulness, compared to the control
group. Participants in the VR-based mindfulness intervention group reported a
greater state of mindfulness than those in the guided audio group, indicating
the immersive mindfulness intervention was more robust. Collectively, these
results provide empirical support for the efficaciousness of a brief VR-based
mindfulness intervention in inducing a robust state of mindfulness in
laboratory settings.
","[{'version': 'v1', 'created': 'Sat, 22 May 2021 16:12:06 GMT'}]",2021-05-25,"[['Yildirim', 'Caglar', ''], ['OGrady', 'Tara', '']]","['Virtual reality', 'mindfulness', 'mindfulness induction; virtual mindfulness', 'attention']"
4431,1807.07298,Joeran Beel,"Joeran Beel and Andrew Collins and Oliver Kopp and Linus W. Dietz and
  Petr Knoth","Online Evaluations for Everyone: Mr. DLib's Living Lab for Scholarly
  Recommendations","Published at the 41st European Conference on Information Retrieval
  (ECIR) 2019",,10.1007/978-3-030-15719-7_27,,cs.IR cs.DL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the first 'living lab' for scholarly recommender systems. This
lab allows recommender-system researchers to conduct online evaluations of
their novel algorithms for scholarly recommendations, i.e., recommendations for
research papers, citations, conferences, research grants, etc. Recommendations
are delivered through the living lab's API to platforms such as reference
management software and digital libraries. The living lab is built on top of
the recommender-system as-a-service Mr. DLib. Current partners are the
reference management software JabRef and the CORE research team. We present the
architecture of Mr. DLib's living lab as well as usage statistics on the first
sixteen months of operating it. During this time, 1,826,643 recommendations
were delivered with an average click-through rate of 0.21%.
","[{'version': 'v1', 'created': 'Thu, 19 Jul 2018 08:55:09 GMT'}, {'version': 'v2', 'created': 'Wed, 22 May 2019 08:42:02 GMT'}]",2019-05-23,"[['Beel', 'Joeran', ''], ['Collins', 'Andrew', ''], ['Kopp', 'Oliver', ''], ['Dietz', 'Linus W.', ''], ['Knoth', 'Petr', '']]","['recommender system evaluation', 'living lab', 'online evaluation']"
4432,2105.12195,Joymallya Chakraborty Mr.,"Joymallya Chakraborty, Suvodeep Majumder, Tim Menzies",Bias in Machine Learning Software: Why? How? What to do?,,"ESEC/FSE'2021: The 29th ACM Joint European Software Engineering
  Conference and Symposium on the Foundations of Software Engineering
  (ESEC/FSE), Athens, Greece, August 23-28, 2021",10.1145/3468264.3468537,,cs.LG cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Increasingly, software is making autonomous decisions in case of criminal
sentencing, approving credit cards, hiring employees, and so on. Some of these
decisions show bias and adversely affect certain social groups (e.g. those
defined by sex, race, age, marital status). Many prior works on bias mitigation
take the following form: change the data or learners in multiple ways, then see
if any of that improves fairness. Perhaps a better approach is to postulate
root causes of bias and then applying some resolution strategy. This paper
postulates that the root causes of bias are the prior decisions that affect-
(a) what data was selected and (b) the labels assigned to those examples. Our
Fair-SMOTE algorithm removes biased labels; and rebalances internal
distributions such that based on sensitive attribute, examples are equal in
both positive and negative classes. On testing, it was seen that this method
was just as effective at reducing bias as prior approaches. Further, models
generated via Fair-SMOTE achieve higher performance (measured in terms of
recall and F1) than other state-of-the-art fairness improvement algorithms. To
the best of our knowledge, measured in terms of number of analyzed learners and
datasets, this study is one of the largest studies on bias mitigation yet
presented in the literature.
","[{'version': 'v1', 'created': 'Tue, 25 May 2021 20:15:50 GMT'}, {'version': 'v2', 'created': 'Mon, 31 May 2021 21:37:02 GMT'}, {'version': 'v3', 'created': 'Fri, 9 Jul 2021 06:35:38 GMT'}]",2021-07-12,"[['Chakraborty', 'Joymallya', ''], ['Majumder', 'Suvodeep', ''], ['Menzies', 'Tim', '']]","['Software Fairness', 'Fairness Metrics', 'Bias Mitigation']"
4433,2102.04257,Kevin McKee,"Nenad Tomasev, Kevin R. McKee, Jackie Kay, Shakir Mohamed","Fairness for Unobserved Characteristics: Insights from Technological
  Impacts on Queer Communities","Proceedings of the 2021 AAAI/ACM Conference on AI, Ethics, and
  Society (AIES 2021)",,10.1145/3461702.3462540,,cs.CY cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advances in algorithmic fairness have largely omitted sexual orientation and
gender identity. We explore queer concerns in privacy, censorship, language,
online safety, health, and employment to study the positive and negative
effects of artificial intelligence on queer communities. These issues
underscore the need for new directions in fairness research that take into
account a multiplicity of considerations, from privacy preservation, context
sensitivity and process fairness, to an awareness of sociotechnical impact and
the increasingly important role of inclusive and participatory research
processes. Most current approaches for algorithmic fairness assume that the
target characteristics for fairness--frequently, race and legal gender--can be
observed or recorded. Sexual orientation and gender identity are prototypical
instances of unobserved characteristics, which are frequently missing, unknown
or fundamentally unmeasurable. This paper highlights the importance of
developing new approaches for algorithmic fairness that break away from the
prevailing assumption of observed characteristics.
","[{'version': 'v1', 'created': 'Wed, 3 Feb 2021 18:52:54 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Feb 2021 21:04:58 GMT'}, {'version': 'v3', 'created': 'Wed, 28 Apr 2021 16:39:10 GMT'}]",2021-04-29,"[['Tomasev', 'Nenad', ''], ['McKee', 'Kevin R.', ''], ['Kay', 'Jackie', ''], ['Mohamed', 'Shakir', '']]","['algorithmic fairness', 'queer communities', 'sexual orientation', 'genderidentity', 'machine learning', 'marginalised groups']"
4434,0901.3751,Daniel Lemire,"Daniel Lemire, Owen Kaser, Kamel Aouiche",Sorting improves word-aligned bitmap indexes,,"Data & Knowledge Engineering, Volume 69, Issue 1, 2010, Pages 3-28",10.1016/j.datak.2009.08.006,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bitmap indexes must be compressed to reduce input/output costs and minimize
CPU usage. To accelerate logical operations (AND, OR, XOR) over bitmaps, we use
techniques based on run-length encoding (RLE), such as Word-Aligned Hybrid
(WAH) compression. These techniques are sensitive to the order of the rows: a
simple lexicographical sort can divide the index size by 9 and make indexes
several times faster. We investigate row-reordering heuristics. Simply
permuting the columns of the table can increase the sorting efficiency by 40%.
Secondary contributions include efficient algorithms to construct and aggregate
bitmaps. The effect of word length is also reviewed by constructing 16-bit,
32-bit and 64-bit indexes. Using 64-bit CPUs, we find that 64-bit indexes are
slightly faster than 32-bit indexes despite being nearly twice as large.
","[{'version': 'v1', 'created': 'Fri, 23 Jan 2009 19:01:06 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Mar 2009 00:27:46 GMT'}, {'version': 'v3', 'created': 'Mon, 1 Jun 2009 14:19:15 GMT'}, {'version': 'v4', 'created': 'Mon, 8 Jun 2009 20:04:04 GMT'}, {'version': 'v5', 'created': 'Mon, 3 Feb 2014 19:03:18 GMT'}, {'version': 'v6', 'created': 'Tue, 23 Sep 2014 00:36:49 GMT'}, {'version': 'v7', 'created': 'Fri, 29 Jul 2016 20:24:07 GMT'}]",2016-08-02,"[['Lemire', 'Daniel', ''], ['Kaser', 'Owen', ''], ['Aouiche', 'Kamel', '']]","['Multidimensional Databases', 'Indexing', 'Compression', 'Gray codes']"
4435,1803.00124,Abdulaziz Alayba,"Abdulaziz M. Alayba, Vasile Palade, Matthew England and Rahat Iqbal",Improving Sentiment Analysis in Arabic Using Word Representation,Authors accepted version of submission for ASAR 2018,"Proc. 2nd International Workshop on Arabic and Derived Script
  Analysis and Recognition (ASAR '18), pp. 13-18. IEEE, 2018",10.1109/ASAR.2018.8480191,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The complexities of Arabic language in morphology, orthography and dialects
makes sentiment analysis for Arabic more challenging. Also, text feature
extraction from short messages like tweets, in order to gauge the sentiment,
makes this task even more difficult. In recent years, deep neural networks were
often employed and showed very good results in sentiment classification and
natural language processing applications. Word embedding, or word distributing
approach, is a current and powerful tool to capture together the closest words
from a contextual text. In this paper, we describe how we construct Word2Vec
models from a large Arabic corpus obtained from ten newspapers in different
Arab countries. By applying different machine learning algorithms and
convolutional neural networks with different text feature selections, we report
improved accuracy of sentiment classification (91%-95%) on our publicly
available Arabic language health sentiment dataset [1]
","[{'version': 'v1', 'created': 'Wed, 28 Feb 2018 22:46:19 GMT'}, {'version': 'v2', 'created': 'Fri, 30 Mar 2018 19:17:50 GMT'}]",2018-10-17,"[['Alayba', 'Abdulaziz M.', ''], ['Palade', 'Vasile', ''], ['England', 'Matthew', ''], ['Iqbal', 'Rahat', '']]","['Arabic Sentiment Analysis', 'Machine Learning', 'Convolutional Neural Networks', 'Word Embedding', 'Word2Vec for Arabic', 'Lexicon']"
4436,1511.05334,Pierre Lescanne,"Katarzyna Grygiel (TCS), Pierre Lescanne (TCS, LIP)","Counting and Generating Terms in the Binary Lambda Calculus (Extended
  version)",extended version of arXiv:1401.0379,J. Funct. Prog. 25 (2015) e24,10.1017/S0956796815000271,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a paper entitled Binary lambda calculus and combinatory logic, John Tromp
presents a simple way of encoding lambda calculus terms as binary sequences. In
what follows, we study the numbers of binary strings of a given size that
represent lambda terms and derive results from their generating functions,
especially that the number of terms of size n grows roughly like 1.963447954.
.. n. In a second part we use this approach to generate random lambda terms
using Boltzmann samplers.
","[{'version': 'v1', 'created': 'Tue, 17 Nov 2015 10:20:01 GMT'}]",2016-01-06,"[['Grygiel', 'Katarzyna', '', 'TCS'], ['Lescanne', 'Pierre', '', 'TCS, LIP']]","['lambda calculus', 'combinatorics', 'functional programming', 'test', 'random generator', 'ranking', 'unranking', 'Boltzmann sampler']"
4437,1502.00166,Marijn ten Thij,"Marijn ten Thij, Tanneke Ouboter, Daniel Worm, Nelly Litvak, Hans van
  den Berg and Sandjai Bhulai",Modelling of trends in Twitter using retweet graph dynamics,"16 pages, 5 figures, presented at WAW 2014","Algorithms and Models for the Web Graph, 11th International
  Workshop, WAW 2014, Beijing, China, December 17-18, 2014, Proceedings pp
  132-147, Lecture Notes in Computer Science, Springer",10.1007/978-3-319-13123-8_11,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we model user behaviour in Twitter to capture the emergence of
trending topics. For this purpose, we first extensively analyse tweet datasets
of several different events. In particular, for these datasets, we construct
and investigate the retweet graphs. We find that the retweet graph for a
trending topic has a relatively dense largest connected component (LCC). Next,
based on the insights obtained from the analyses of the datasets, we design a
mathematical model that describes the evolution of a retweet graph by three
main parameters. We then quantify, analytically and by simulation, the
influence of the model parameters on the basic characteristics of the retweet
graph, such as the density of edges and the size and density of the LCC.
Finally, we put the model in practice, estimate its parameters and compare the
resulting behavior of the model to our datasets.
","[{'version': 'v1', 'created': 'Sat, 31 Jan 2015 21:45:17 GMT'}]",2015-02-03,"[['Thij', 'Marijn ten', ''], ['Ouboter', 'Tanneke', ''], ['Worm', 'Daniel', ''], ['Litvak', 'Nelly', ''], ['Berg', 'Hans van den', ''], ['Bhulai', 'Sandjai', '']]","['Retweet graph', 'Twitter', 'graph dynamics', 'random graph model']"
4438,1504.04818,Mingsheng Long,"Mingsheng Long, Yue Cao, Jianmin Wang, Philip S. Yu",Composite Correlation Quantization for Efficient Multimodal Retrieval,,,10.1145/2911451.2911493,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efficient similarity retrieval from large-scale multimodal database is
pervasive in modern search engines and social networks. To support queries
across content modalities, the system should enable cross-modal correlation and
computation-efficient indexing. While hashing methods have shown great
potential in achieving this goal, current attempts generally fail to learn
isomorphic hash codes in a seamless scheme, that is, they embed multiple
modalities in a continuous isomorphic space and separately threshold embeddings
into binary codes, which incurs substantial loss of retrieval accuracy. In this
paper, we approach seamless multimodal hashing by proposing a novel Composite
Correlation Quantization (CCQ) model. Specifically, CCQ jointly finds
correlation-maximal mappings that transform different modalities into
isomorphic latent space, and learns composite quantizers that convert the
isomorphic latent features into compact binary codes. An optimization framework
is devised to preserve both intra-modal similarity and inter-modal correlation
through minimizing both reconstruction and quantization errors, which can be
trained from both paired and partially paired data in linear time. A
comprehensive set of experiments clearly show the superior effectiveness and
efficiency of CCQ against the state of the art hashing methods for both
unimodal and cross-modal retrieval.
","[{'version': 'v1', 'created': 'Sun, 19 Apr 2015 10:16:50 GMT'}, {'version': 'v2', 'created': 'Sun, 22 May 2016 08:46:41 GMT'}]",2016-05-24,"[['Long', 'Mingsheng', ''], ['Cao', 'Yue', ''], ['Wang', 'Jianmin', ''], ['Yu', 'Philip S.', '']]","['Hashing', 'quantization', 'multimodal retrieval', 'correlation analysis']"
4439,1912.03854,Ramy Shahin,"Ramy Shahin, Marsha Chechik",Variability-aware Datalog,PADL'20 paper,,10.1007/978-3-030-39197-3_14,,cs.PL cs.DB cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Variability-aware computing is the efficient application of programs to
different sets of inputs that exhibit some variability. One example is program
analyses applied to Software Product Lines (SPLs). In this paper we present the
design and development of a variability-aware version of the Souffl\'{e}
Datalog engine. The engine can take facts annotated with Presence Conditions
(PCs) as input, and compute the PCs of its inferred facts, eliminating facts
that do not exist in any valid configuration. We evaluate our variability-aware
Souffl\'{e} implementation on several fact sets annotated with PCs to measure
the associated overhead in terms of processing time and database size.
","[{'version': 'v1', 'created': 'Mon, 9 Dec 2019 05:05:07 GMT'}]",2021-02-09,"[['Shahin', 'Ramy', ''], ['Chechik', 'Marsha', '']]","['Variability-aware Programming', 'Product-line Engineering', 'Soufflé']"
4440,1801.02853,Mohammad Riyaz Belgaum,Zeyad M. Alfawaer and Mohammad Riyaz Belgaum,An enhanced Multipath Strategy in Mobile Ad hoc Routing Protocols,,"Proceedings of the 9th IEEE-GCC Conference and Exhibition 2017,
  9-11 May 2017, Gulf Convension Centre, Manama, Bahrain, ISBN:
  978-1-5386-2755-6, ISSN: 2473-9391, pp 1120-1125, Published by IEEE",10.1109/IEEEGCC.2017.8448106,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The various routing protocols in Mobile Ad hoc Networks follow different
strategies to send the information from one node to another. The nodes in the
network are non static and they move randomly and are prone to link failure
which makes always to find new routes to the destination. This research mainly
focused on the study of the characteristics of multipath routing protocols in
MANETS. Two of the multipath routing protocols were investigated and a
comparative study along with simulation using NS2 was done between DSR and AODV
to propose an enhanced approach to reach the destination maintaining the QoS. A
possible optimization to the DSR and AODV routing protocols was proposed to
make no node to be overburdened by distributing the load after finding the
alternate multipath routes which were discovered in the Route discovery
process. The simulation shows that the differences in the protocol highlighted
major differences with the protocol performance. These differences have been
analyzed with various network size, mobility, and network load. A new search
table named Search of Next Node Enquiry Table (SONNET) was proposed to find the
best neighbor node. Using SONNET the node selects the neighbor which can be
reached in less number of hops and with less time delay and maintaining the
QoS.
","[{'version': 'v1', 'created': 'Tue, 9 Jan 2018 09:40:34 GMT'}]",2020-10-02,"[['Alfawaer', 'Zeyad M.', ''], ['Belgaum', 'Mohammad Riyaz', '']]","['MANETS', 'DSR Protocol', 'AODV Protocol', 'SONNET']"
4441,1410.0176,David Lillis,"David Lillis, Rem Collier, Mauro Dragone, G. M. P. O'Hare",An Agent-Based Approach to Component Management,"In Proceedings of the 8th International Conference on Autonomous
  Agents and Multi-Agent Systems (AAMAS '09), Budapest, Hungary, 2009",,10.1145/1558013.1558086,,cs.MA cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper details the implementation of a software framework that aids the
development of distributed and self-configurable software systems. This
framework is an instance of a novel integration strategy called SoSAA (SOcially
Situated Agent Architecture), which combines Component-Based Software
Engineering and Agent-Oriented Software Engineering, drawing its inspiration
from hybrid agent control architectures. The framework defines a complete
construction process by enhancing a simple component-based framework with
reasoning and self-awareness capabilities through a standardized interface.
  The capabilities of the resulting framework are demonstrated through its
application to a non-trivial Multi Agent System (MAS). The system in question
is a pre-existing Information Retrieval (IR) system that has not previously
taken advantage of CBSE principles. In this paper we contrast these two systems
so as to highlight the benefits of using this new hybrid approach. We also
outline how component-based elements may be integrated into the Agent Factory
agent-oriented application framework.
","[{'version': 'v1', 'created': 'Wed, 1 Oct 2014 10:55:44 GMT'}]",2014-10-02,"[['Lillis', 'David', ''], ['Collier', 'Rem', ''], ['Dragone', 'Mauro', ''], [""O'Hare"", 'G. M. P.', '']]","['Distributed Systems', 'Methodologies', 'Agent-oriented Software Engineering']"
4442,1707.06070,Nicolas Robinson-Garcia,"Nicolas Robinson-Garcia, Philippe Mongeon, Wei Jeng and Rodrigo Costas","DataCite as a novel bibliometric source: Coverage, strengths and
  limitations",Paper accepted for publication in Journal of Informetrics,"Journal of Informetrics, 11(3), 841-854 (2017)",10.1016/j.joi.2017.07.003,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper explores the characteristics of DataCite to determine its
possibilities and potential as a new bibliometric data source to analyze the
scholarly production of open data. Open science and the increasing data sharing
requirements from governments, funding bodies, institutions and scientific
journals has led to a pressing demand for the development of data metrics. As a
very first step towards reliable data metrics, we need to better comprehend the
limitations and caveats of the information provided by sources of open data. In
this paper, we critically examine records downloaded from the DataCite's OAI
API and elaborate a series of recommendations regarding the use of this source
for bibliometric analyses of open data. We highlight issues related to metadata
incompleteness, lack of standardization, and ambiguous definitions of several
fields. Despite these limitations, we emphasize DataCite's value and potential
to become one of the main sources for data metrics development.
","[{'version': 'v1', 'created': 'Wed, 19 Jul 2017 13:14:44 GMT'}]",2017-10-13,"[['Robinson-Garcia', 'Nicolas', ''], ['Mongeon', 'Philippe', ''], ['Jeng', 'Wei', ''], ['Costas', 'Rodrigo', '']]","['Data sharing', 'data citations', 'bibliometric sources', 'open data', 'data infrastructure', 'data metrics', 'DataCite']"
4443,cs/0105010,Jianjun Zhao,Jianjun Zhao,On Assessing the Complexity of Software Architectures,4 pages,"Proceedings of the 3rd International Software Architecture
  Workshop (ISAW3), pp.163-166, ACM SIGSOFT, November 1998",,,cs.SE,,"  This paper proposes some new architectural metrics which are appropriate for
evaluating the architectural attributes of a software system. The main feature
of our approach is to assess the complexity of a software architecture by
analyzing various types of architectural dependences in the architecture.
","[{'version': 'v1', 'created': 'Sat, 5 May 2001 09:18:11 GMT'}]",2007-05-23,"[['Zhao', 'Jianjun', '']]","['Architectural description lanaguage', 'Architectural metric', 'Dependence analysis', 'Software architecture']"
4444,1902.00496,Shelly Rathee,"A. Mishra, H. Mishra, S. Rathee","Examining the Presence of Gender Bias in Customer Reviews Using Word
  Embedding",,,10.13140/RG.2.2.15426.02240,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Humans have entered the age of algorithms. Each minute, algorithms shape
countless preferences from suggesting a product to a potential life partner. In
the marketplace algorithms are trained to learn consumer preferences from
customer reviews because user-generated reviews are considered the voice of
customers and a valuable source of information to firms. Insights mined from
reviews play an indispensable role in several business activities ranging from
product recommendation, targeted advertising, promotions, segmentation etc. In
this research, we question whether reviews might hold stereotypic gender bias
that algorithms learn and propagate Utilizing data from millions of
observations and a word embedding approach, GloVe, we show that algorithms
designed to learn from human language output also learn gender bias. We also
examine why such biases occur: whether the bias is caused because of a negative
bias against females or a positive bias for males. We examine the impact of
gender bias in reviews on choice and conclude with policy implications for
female consumers, especially when they are unaware of the bias, and the ethical
implications for firms.
","[{'version': 'v1', 'created': 'Fri, 1 Feb 2019 18:36:09 GMT'}]",2019-02-04,"[['Mishra', 'A.', ''], ['Mishra', 'H.', ''], ['Rathee', 'S.', '']]","['Gender bias', 'natural language processing', 'customer reviews', 'text analysis', 'wordembedding']"
4445,1903.03265,Felix Hamza-Lup,"Felix G. Hamza-Lup, William H. Baird",Feel the Static and Kinetic Friction,,"EuroHaptics, 2012, pp. 181-192",10.1007/978--3--642--31401--8_17,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multimodal simulations augment the presentation of abstract concepts
facilitating theoretical models understanding and learning. Most simulations
only engage two of our five senses: sight and hearing. If we employ additional
sensory communication channels in simulations, we may gain a deeper
understanding of illustrated concepts by increasing the communication bandwidth
and providing alternative perspectives. We implemented the sense of touch in 3D
simulations to teach important concepts in introductory physics. Specifically,
we developed a visual/haptic simulation for friction. We prove that interactive
3D haptic simulations, if carefully developed and deployed, are useful in
engaging students and allowing them to understand concepts faster. We
hypothesize that large scale deployment of such haptic-based simulators in
science laboratories is now possible due to the advancements in haptic software
and hardware technology.
","[{'version': 'v1', 'created': 'Fri, 8 Mar 2019 03:36:48 GMT'}]",2019-03-11,"[['Hamza-Lup', 'Felix G.', ''], ['Baird', 'William H.', '']]","['Haptics', 'Friction', 'Physics', 'e-Learning']"
4446,1108.0141,K.Savitha,K.Savitha and C.Chandrasekar,"Trusted Network Selection using SAW and TOPSIS Algorithms for
  Heterogeneous Wireless Networks",arXiv admin note: substantial text overlap with arXiv:1106.2402,,10.5120/3125-4300,,cs.NI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Seamless continuity is the main goal in fourth generation Wireless networks
(FGWNs), to achieve this ""HANDOVER"" technique is used, when a mobile
terminal(MT) is in overlapping area for service continuity, Handover mechanism
are mainly used. In Heterogeneous wireless networks main challenge is continual
connection among the different networks like WiFi, WiMax, WLAN, WPAN etc. In
this paper, Vertical handover decision schemes are compared and Multi Attribute
Decision Making (MADM) is used to choose the best network from the available
Visitor networks (VTs) for the continuous connection by the mobile terminal. In
our work we mainly concentrated to the handover decision phase and to reduce
the processing delay in the period of handover. MADM algorithms SAW and TOPSIS
where compared to reduce the processing delay by using NS2 to evaluate the
parameters for processing delay.
","[{'version': 'v1', 'created': 'Sun, 31 Jul 2011 05:57:22 GMT'}]",2012-04-01,"[['Savitha', 'K.', ''], ['Chandrasekar', 'C.', '']]","['Handover', 'Vertical handover decision schemes', 'Multi attribute decision making']"
4447,1808.08999,Florian Reitz,Florian Reitz,"Harnessing Historical Corrections to build Test Collections for Named
  Entity Disambiguation",Preprint of a paper accepted at TPDL 2018,,10.1007/978-3-030-00066-0_4,,cs.DL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Matching mentions of persons to the actual persons (the name disambiguation
problem) is central for several digital library applications. Scientists have
been working on algorithms to create this matching for decades without finding
a universal solution. One problem is that test collections for this problem are
often small and specific to a certain collection. In this work, we present an
approach that can create large test collections from historical metadata with
minimal extra cost. We apply this approach to the DBLP collection to generate
two freely available test collections. One collection focuses on the properties
of defects and one on the evaluation of disambiguation algorithms.
","[{'version': 'v1', 'created': 'Mon, 27 Aug 2018 19:05:02 GMT'}]",2018-08-29,"[['Reitz', 'Florian', '']]","['name disambiguation', 'historical metadata', 'dblp']"
4448,1710.10977,Andr\'e G. C. Guerra,"Andr\'e G. C. Guerra, Ant\'onio S\'ergio Ferreira, Maria Costa, Diego
  Nodar-L\'opez, Fernando Aguado Agelet","Integrating Small Satellite Communication in an Autonomous Vehicle
  Network: A Case for Oceanography","11 pages, 10 figures, 4 tables","A.G.C. Guerra, A.S. Ferreira, M. Costa, D. Nodar-L\'opez, F.
  Aguado Agelet, Integrating small satellite communication in an autonomous
  vehicle network: A case for oceanography, Acta Astronaut. 145 (2018) 229-237",10.1016/j.actaastro.2018.01.022,,cs.NI physics.app-ph physics.space-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Small satellites and autonomous vehicles have greatly evolved in the last few
decades. Hundreds of small satellites have been launched with increasing
functionalities, in the last few years. Likewise, numerous autonomous vehicles
have been built, with decreasing costs and form-factor payloads. Here we focus
on combining these two multifaceted assets in an incremental way, with an
ultimate goal of alleviating the logistical expenses in remote oceanographic
operations. The first goal is to create a highly reliable and constantly
available communication link for a network of autonomous vehicles, taking
advantage of the small satellite lower cost, with respect to conventional
spacecraft, and its higher flexibility. We have developed a test platform as a
proving ground for this network, by integrating a satellite software defined
radio on an unmanned air vehicle, creating a system of systems, and several
tests have been run successfully, over land. As soon as the satellite is fully
operational, we will start to move towards a cooperative network of autonomous
vehicles and small satellites, with application in maritime operations, both
\textit{in-situ} and remote sensing.
","[{'version': 'v1', 'created': 'Mon, 30 Oct 2017 14:33:16 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Apr 2018 14:09:19 GMT'}]",2018-04-18,"[['Guerra', 'André G. C.', ''], ['Ferreira', 'António Sérgio', ''], ['Costa', 'Maria', ''], ['Nodar-López', 'Diego', ''], ['Agelet', 'Fernando Aguado', '']]","['Small Satellites', 'Autonomous Vehicles', 'Satellite Communication', 'System of Systems', 'Maritime Operations', 'Field Trials']"
4449,1912.02036,Son Nguyen Hong,"Nguyen Hong Son, Ha Thanh Dung","The method of detecting online password attacks based on high-level
  protocol analysis and clustering techniques","13 pages, 7 figures","International Journal of Computer Networks & Communications
  (IJCNC) Vol.11, No.6, November 2019",10.5121/ijcnc.2019.11605,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although there have been many solutions applied, the safety challenges
related to the password security mechanism are not reduced. The reason for this
is that while the means and tools to support password attacks are becoming more
and more abundant, the number of transaction systems through the Internet is
increasing, and new services systems appear. For example, IoT also uses
password-based authentication. In this context, consolidating password-based
authentication mechanisms is critical, but monitoring measures for timely
detection of attacks also play an important role in this battle. The password
attack detection solutions being used need to be supplemented and improved to
meet the new situation. In this paper we propose a solution that automatically
detects online password attacks in a way that is based solely on the network,
using unsupervised learning techniques and protected application orientation.
Our solution, therefore, minimizes dependence on the factors encountered by
host-based or supervised learning solutions. The certainty of the solution
comes from using the results of an in-depth analysis of attack characteristics
to build the detection capacity of the mechanism. The solution was implemented
experimentally on the real system and gave positive results.
","[{'version': 'v1', 'created': 'Wed, 4 Dec 2019 15:01:17 GMT'}]",2019-12-05,"[['Son', 'Nguyen Hong', ''], ['Dung', 'Ha Thanh', '']]","['Online password attack detection', 'unsupervised learning', 'protocol analysis', 'DBSCAN clustering algorithm  1']"
4450,1807.11876,Emma Frejinger,"Eric Larsen, S\'ebastien Lachapelle, Yoshua Bengio, Emma Frejinger,
  Simon Lacoste-Julien, Andrea Lodi","Predicting Tactical Solutions to Operational Planning Problems under
  Imperfect Information",,"INFORMS Journal on Computing 34(1):227-242, 2021",10.1287/ijoc.2021.1091,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper offers a methodological contribution at the intersection of
machine learning and operations research. Namely, we propose a methodology to
quickly predict expected tactical descriptions of operational solutions
(TDOSs). The problem we address occurs in the context of two-stage stochastic
programming where the second stage is demanding computationally. We aim to
predict at a high speed the expected TDOS associated with the second stage
problem, conditionally on the first stage variables. This may be used in
support of the solution to the overall two-stage problem by avoiding the online
generation of multiple second stage scenarios and solutions. We formulate the
tactical prediction problem as a stochastic optimal prediction program, whose
solution we approximate with supervised machine learning. The training dataset
consists of a large number of deterministic operational problems generated by
controlled probabilistic sampling. The labels are computed based on solutions
to these problems (solved independently and offline), employing appropriate
aggregation and subselection methods to address uncertainty. Results on our
motivating application on load planning for rail transportation show that deep
learning models produce accurate predictions in very short computing time
(milliseconds or less). The predictive accuracy is close to the lower bounds
calculated based on sample average approximation of the stochastic prediction
programs.
","[{'version': 'v1', 'created': 'Tue, 31 Jul 2018 15:39:37 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Sep 2018 10:32:07 GMT'}, {'version': 'v3', 'created': 'Tue, 12 Mar 2019 00:55:53 GMT'}, {'version': 'v4', 'created': 'Mon, 1 Mar 2021 14:19:29 GMT'}]",2022-06-10,"[['Larsen', 'Eric', ''], ['Lachapelle', 'Sébastien', ''], ['Bengio', 'Yoshua', ''], ['Frejinger', 'Emma', ''], ['Lacoste-Julien', 'Simon', ''], ['Lodi', 'Andrea', '']]","['supervised learning', 'deep learning', 'integer linear programming', 'stochastic programming']"
4451,1907.09560,Carmine Dodaro,"Giovanni Amendola, Carmine Dodaro, Francesco Ricca",Better Paracoherent Answer Sets with Less Resources,"Paper presented at the 35th International Conference on Logic
  Programming (ICLP 2019), Las Cruces, New Mexico, USA, 20-25 September 2019,
  15 pages",Theory and Practice of Logic Programming 19 (2019) 757-772,10.1017/S1471068419000176,,cs.LO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Answer Set Programming (ASP) is a well-established formalism for logic
programming. Problem solving in ASP requires to write an ASP program whose
answers sets correspond to solutions. Albeit the non-existence of answer sets
for some ASP programs can be considered as a modeling feature, it turns out to
be a weakness in many other cases, and especially for query answering.
Paracoherent answer set semantics extend the classical semantics of ASP to draw
meaningful conclusions also from incoherent programs, with the result of
increasing the range of applications of ASP. State of the art implementations
of paracoherent ASP adopt the semi-equilibrium semantics, but cannot be lifted
straightforwardly to compute efficiently the (better) split semi-equilibrium
semantics that discards undesirable semi-equilibrium models. In this paper an
efficient evaluation technique for computing a split semi-equilibrium model is
presented. An experiment on hard benchmarks shows that better paracoherent
answer sets can be computed consuming less computational resources than
existing methods. Under consideration for acceptance in TPLP.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2019 20:27:43 GMT'}]",2020-02-19,"[['Amendola', 'Giovanni', ''], ['Dodaro', 'Carmine', ''], ['Ricca', 'Francesco', '']]","['Answer Set Programming', 'Paracoherent reasoning', 'Semi-equilibrium models']"
4452,1107.5030,Miguel Areias,Miguel Areias and Ricardo Rocha,"On Combining Linear-Based Strategies for Tabled Evaluation of Logic
  Programs","16 pages, 9 figures, International Conference on Logic Programming
  (ICLP 2011)","Theory and Practice of Logic Programming, Volume 11, Special Issue
  4-5, July 2011, pp 681-696 Published Cambridge University Press 2011",10.1017/S147106841100024X,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tabled evaluation is a recognized and powerful technique that overcomes some
limitations of traditional Prolog systems in dealing with recursion and
redundant sub-computations. We can distinguish two main categories of tabling
mechanisms: suspension-based tabling and linear tabling. While suspension-based
mechanisms are considered to obtain better results in general, they have more
memory space requirements and are more complex and harder to implement than
linear tabling mechanisms. Arguably, the SLDT and DRA strategies are the two
most successful extensions to standard linear tabled evaluation. In this work,
we propose a new strategy, named DRS, and we present a framework, on top of the
Yap system, that supports the combination of all these three strategies. Our
implementation shares the underlying execution environment and most of the data
structures used to implement tabling in Yap. We thus argue that all these
common features allows us to make a first and fair comparison between these
different linear tabling strategies and, therefore, better understand the
advantages and weaknesses of each, when used solely or combined with the
others.
","[{'version': 'v1', 'created': 'Mon, 25 Jul 2011 19:44:27 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Jul 2011 10:12:46 GMT'}]",2011-07-27,"[['Areias', 'Miguel', ''], ['Rocha', 'Ricardo', '']]","['Linear Tabling', 'Integration', 'Implementation']"
4453,1902.09244,Viktoria Hauder,"Viktoria A. Hauder, Andreas Beham, Sebastian Raggl, Sophie N. Parragh,
  Michael Affenzeller","Resource-constrained multi-project scheduling with activity and time
  flexibility",,"Computers & Industrial Engineering, 106857 (2020)",10.1016/j.cie.2020.106857,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Project scheduling in manufacturing environments often requires flexibility
in terms of the selection and the exact length of alternative production
activities. Moreover, the simultaneous scheduling of multiple lots is mandatory
in many production planning applications. To meet these requirements, a new
resource-constrained project scheduling problem (RCPSP) is introduced where
both decisions (activity flexibility and time flexibility) are integrated.
Besides the minimization of makespan, two new alternative objectives are
presented: maximization of balanced length of selected activities (time
balance) and maximization of balanced resource utilization (resource balance).
New mixed integer and constraint programming (CP) models are proposed for the
developed integrated flexible project scheduling problem. Benchmark instances
on an already existing flexible RCPSP and the newly developed problem are
solved to optimality. The real-world applicability of the suggested CP models
is shown by additionally solving a large industry case.
","[{'version': 'v1', 'created': 'Mon, 25 Feb 2019 13:08:53 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Oct 2020 07:54:09 GMT'}]",2020-10-26,"[['Hauder', 'Viktoria A.', ''], ['Beham', 'Andreas', ''], ['Raggl', 'Sebastian', ''], ['Parragh', 'Sophie N.', ''], ['Affenzeller', 'Michael', '']]","['Multi-project scheduling', 'activity and time flexibility', 'constraintprogramming', 'manufacturing']"
4454,2010.04836,Jiahao Chen,Jiahao Chen and Manuela Veloso,"Paying down metadata debt: learning the representation of concepts using
  topic models","8 pages, 4 figures. Data set available in paper source","Proceedings of the 1st ACM International Conference on AI in
  Finance (ICAIF '20), October 15-16, 2020, New York, NY, USA",10.1145/3383455.3422537,,cs.LG cs.AI cs.DL cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a data management problem called metadata debt, to identify the
mapping between data concepts and their logical representations. We describe
how this mapping can be learned using semisupervised topic models based on
low-rank matrix factorizations that account for missing and noisy labels,
coupled with sparsity penalties to improve localization and interpretability.
We introduce a gauge transformation approach that allows us to construct
explicit associations between topics and concept labels, and thus assign
meaning to topics. We also show how to use this topic model for semisupervised
learning tasks like extrapolating from known labels, evaluating possible errors
in existing labels, and predicting missing features. We show results from this
topic model in predicting subject tags on over 25,000 datasets from Kaggle.com,
demonstrating the ability to learn semantically meaningful features.
","[{'version': 'v1', 'created': 'Fri, 9 Oct 2020 22:42:38 GMT'}]",2020-10-13,"[['Chen', 'Jiahao', ''], ['Veloso', 'Manuela', '']]","['topic model', 'semisupervised learning', 'controlled vocabulary']"
4455,1808.08710,Laurent Beaudou,"Laurent Beaudou, Giacomo Kahn and Matthieu Rosenfeld",Bisplit graphs satisfy the Chen-Chv\'atal conjecture,,"Discrete Mathematics & Theoretical Computer Science, vol. 21 no.
  1, ICGT 2018 (May 29, 2019) dmtcs:5509",10.23638/DMTCS-21-1-5,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we give a lengthy proof of a small result! A graph is bisplit
if its vertex set can be partitioned into three stable sets with two of them
inducing a complete bipartite graph. We prove that these graphs satisfy the
Chen-Chv\'atal conjecture: their metric space (in the usual sense) has a
universal line (in an unusual sense) or at least as many lines as the number of
vertices.
","[{'version': 'v1', 'created': 'Mon, 27 Aug 2018 07:19:53 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Aug 2018 07:31:17 GMT'}, {'version': 'v3', 'created': 'Thu, 7 Mar 2019 08:13:12 GMT'}, {'version': 'v4', 'created': 'Thu, 23 May 2019 13:13:31 GMT'}]",2021-01-04,"[['Beaudou', 'Laurent', ''], ['Kahn', 'Giacomo', ''], ['Rosenfeld', 'Matthieu', '']]","['bisplit graphs', 'Chen-Chv´atal conjecture', 'distances']"
4456,1510.03145,Ravikant Dindokar,Ravikant Dindokar and Yogesh Simmhan,Elastic Resource Allocation for Distributed Graph Processing Platforms,,"Proceedings of the 16th IEEE/ACM International Symposium on
  Cluster, Cloud and Grid Computing (CCGrid), Cartagena, Colombia, 2016",10.1109/CCGrid.2016.97,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed graph platforms like Pregel have used vertex- centric programming
models to process the growing corpus of graph datasets using commodity
clusters. The irregular structure of graphs cause load imbalances across
machines operating on graph partitions, and this is exacerbated for
non-stationary graph algorithms such as traversals, where not all parts of the
graph are active at the same time. As a result, such graph platforms, even as
they scale, do not make efficient use of distributed resources. Clouds offer
elastic virtual machines that can be leveraged to improve the resource
utilization for such platforms and hence reduce the monetary cost for their
execution. In this paper, we propose strategies for elastic placement of graph
partitions on Cloud VMs for subgraphcentric programming model to reduce the
cost of execution compared to a static placement, even as we minimize the
increase in makespan. These strategies are innovative in modeling the graph
algorithms behavior. We validate our strategies for several graphs, using
runtime tra- ces for their distributed execution of a Breadth First Search
(BFS) algorithms on our subgraph-centric GoFFish graph platform. Our strategies
are able to reduce the cost of exe- cution by up to 42%, compared to a static
placement, while achieving a makespan that is within 29% of the optimal
","[{'version': 'v1', 'created': 'Mon, 12 Oct 2015 05:41:05 GMT'}]",2019-05-13,"[['Dindokar', 'Ravikant', ''], ['Simmhan', 'Yogesh', '']]","['Graph processing', 'Elastic Scheduling', 'Big Data', 'Cloud Computing', 'Distributed System']"
4457,1706.08609,Artemy Kolchinsky,"Artemy Kolchinsky, Nakul Dhande, Kengjeun Park, Yong-Yeol Ahn","The Minor Fall, the Major Lift: Inferring Emotional Valence of Musical
  Chords through Lyrics","Royal Society Open Science, 2017","Royal Society Open Science, 2017",10.1098/rsos.150081,,cs.CL cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the association between musical chords and lyrics by analyzing
a large dataset of user-contributed guitar tablatures. Motivated by the idea
that the emotional content of chords is reflected in the words used in
corresponding lyrics, we analyze associations between lyrics and chord
categories. We also examine the usage patterns of chords and lyrics in
different musical genres, historical eras, and geographical regions. Our
overall results confirms a previously known association between Major chords
and positive valence. We also report a wide variation in this association
across regions, genres, and eras. Our results suggest possible existence of
different emotional associations for other types of chords.
","[{'version': 'v1', 'created': 'Mon, 26 Jun 2017 21:34:29 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Dec 2017 05:07:37 GMT'}]",2022-11-22,"[['Kolchinsky', 'Artemy', ''], ['Dhande', 'Nakul', ''], ['Park', 'Kengjeun', ''], ['Ahn', 'Yong-Yeol', '']]","['sentiment analysis', 'musicology', 'text']"
4458,1903.12371,Mohammadreza Doostmohammadian,"Mohammadreza Doostmohammadian, Hamid R. Rabiee, Usman A. Khan","Cyber-Social Systems: Modeling, Inference, and Optimal Design","12 pages, 7 figures","IEEE systems journal, 2019",10.1109/JSYST.2019.2900027,,cs.SY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper models the cyber-social system as a cyber-network of agents
monitoring states of individuals in a social network. The state of each
individual is represented by a social node and the interactions among
individuals are represented by a social link. In the cyber-network each node
represents an agent and the links represent information sharing among agents.
Agents make an observation of social states and perform distributed inference.
In this direction, the contribution of this work is threefold: (i) A novel
distributed inference protocol is proposed that makes no assumption on the rank
of the underlying social system. This is significant as most protocols in the
literature only work on full-rank systems. (ii) A novel agent classification is
developed, where it is shown that connectivity requirement on the cyber-network
differs for each type. This is particularly important in finding the minimal
number of observations and minimal connectivity of the cyber-network as the
next contribution. (iii) The cost-optimal design of cyber-network constraint
with distributed observability is addressed. This problem is subdivided into
sensing cost optimization and networking cost optimization where both are
claimed to be NP-hard. We solve both problems for certain types of social
networks and find polynomial-order solutions.
","[{'version': 'v1', 'created': 'Fri, 29 Mar 2019 06:45:05 GMT'}]",2020-04-22,"[['Doostmohammadian', 'Mohammadreza', ''], ['Rabiee', 'Hamid R.', ''], ['Khan', 'Usman A.', '']]","['Observability and Estimation', 'LSI systems', 'Combinatorial optimization', 'SCC', 'Contraction']"
4459,1207.3882,Md. Hasnat Kabir Dr,"Md. Golam Rashed, M. Hasnat Kabir, Shaikh Enayet Ullah","WEP: An Energy Efficient Protocol for Cluster Based Heterogeneous
  Wireless Sensor Network",7 Pages,"International Journal of Distributed and Parallel Systems (IJDPS)
  Vol.2, No.2, March 2011, 54-60",10.5121/ijdps.2011.2205,,cs.IT cs.PF math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop an energy-efficient routing protocol in order to enhance the
stability period of wireless sensor networks. This protocol is called weighted
election protocol (WEP). It introduces a scheme to combine clustering strategy
with chain routing algorithm for satisfy both energy and stable period
constrains under heterogeneous environment in WSNs. Simulation results show
that new one performs better than LEACH, SEP and HEARP in terms of stability
period and network lifetime. It is also found that longer stability period
strongly depend on higher values of extra energy during its heterogeneous
settings.
","[{'version': 'v1', 'created': 'Tue, 17 Jul 2012 05:25:56 GMT'}]",2012-07-18,"[['Rashed', 'Md. Golam', ''], ['Kabir', 'M. Hasnat', ''], ['Ullah', 'Shaikh Enayet', '']]","['Sensor Networks', 'Routing protocol', 'Stability', 'Energy consumption', 'Clustering hierarchy']"
4460,2106.03309,Stephen MacDonell,Sherlock A. Licorish and Stephen G. MacDonell,"Adopting Softer Approaches in the Study of Repository Data: A
  Comparative Analysis","Conference paper, 8 pages, 7 tables. arXiv admin note: text overlap
  with arXiv:2102.06317","Proceedings of the 17th International Conference on Evaluation and
  Assessment in Software Engineering (EASE2013). Porto de Galinhas, Brazil, ACM
  Press, pp.240-245",10.1145/2460999.2461035,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Given the acknowledged need to understand the people processes
enacted during software development, software repositories and mailing lists
have become a focus for many studies. However, researchers have tended to use
mostly mathematical and frequency-based techniques to examine the software
artifacts contained within them. Objective: There is growing recognition that
these approaches uncover only a partial picture of what happens during software
projects, and deeper contextual approaches may provide further understanding of
the intricate nature of software teams' dynamics. We demonstrate the relevance
and utility of such approaches in this study. Method: We use psycholinguistics
and directed content analysis (CA) to study the way project tasks drive teams'
attitudes and knowledge sharing. We compare the outcomes of these two
approaches and offer methodological advice for researchers using similar forms
of repository data. Results: Our analysis reveals significant differences in
the way teams work given their portfolio of tasks and the distribution of
roles. Conclusion: We overcome the limitations associated with employing purely
quantitative approaches, while avoiding the time-intensive and potentially
invasive nature of field work required in full case studies.
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2021 02:43:04 GMT'}]",2021-06-08,"[['Licorish', 'Sherlock A.', ''], ['MacDonell', 'Stephen G.', '']]","['Software Teams', 'Psycholinguistics', 'Content Analysis', 'Communication', 'Jazz']"
4461,1406.6844,Normunds Gr\=uz\=itis,"Normunds Gruzitis, Peteris Paikens, Guntis Barzdins",FrameNet Resource Grammar Library for GF,,"Controlled Natural Language, Lecture Notes in Computer Science,
  Vol. 7427, Springer, 2012, pp. 121-137",10.1007/978-3-642-32612-7_9,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present an ongoing research investigating the possibility
and potential of integrating frame semantics, particularly FrameNet, in the
Grammatical Framework (GF) application grammar development. An important
component of GF is its Resource Grammar Library (RGL) that encapsulates the
low-level linguistic knowledge about morphology and syntax of currently more
than 20 languages facilitating rapid development of multilingual applications.
In the ideal case, porting a GF application grammar to a new language would
only require introducing the domain lexicon - translation equivalents that are
interlinked via common abstract terms. While it is possible for a highly
restricted CNL, developing and porting a less restricted CNL requires above
average linguistic knowledge about the particular language, and above average
GF experience. Specifying a lexicon is mostly straightforward in the case of
nouns (incl. multi-word units), however, verbs are the most complex category
(in terms of both inflectional paradigms and argument structure), and adding
them to a GF application grammar is not a straightforward task. In this paper
we are focusing on verbs, investigating the possibility of creating a
multilingual FrameNet-based GF library. We propose an extension to the current
RGL, allowing GF application developers to define clauses on the semantic
level, thus leaving the language-specific syntactic mapping to this extension.
We demonstrate our approach by reengineering the MOLTO Phrasebook application
grammar.
","[{'version': 'v1', 'created': 'Thu, 26 Jun 2014 11:14:44 GMT'}]",2016-07-07,"[['Gruzitis', 'Normunds', ''], ['Paikens', 'Peteris', ''], ['Barzdins', 'Guntis', '']]","['controlled natural language', 'frame semantics', 'FrameNet', 'multilinguality', 'Grammatical Framework']"
4462,1912.00742,Alexey Svyatkovskiy,"Alexey Svyatkovskiy, Ying Zhao, Shengyu Fu, Neel Sundaresan",Pythia: AI-assisted Code Completion System,"Published in Proceedings of the 25th ACM SIGKDD International
  Conference on Knowledge Discovery & Data Mining (KDD '19)",,10.1145/3292500.3330699,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel end-to-end approach for AI-assisted code
completion called Pythia. It generates ranked lists of method and API
recommendations which can be used by software developers at edit time. The
system is currently deployed as part of Intellicode extension in Visual Studio
Code IDE. Pythia exploits state-of-the-art large-scale deep learning models
trained on code contexts extracted from abstract syntax trees. It is designed
to work at a high throughput predicting the best matching code completions on
the order of 100 $ms$.
  We describe the architecture of the system, perform comparisons to
frequency-based approach and invocation-based Markov Chain language model, and
discuss challenges serving Pythia models on lightweight client devices.
  The offline evaluation results obtained on 2700 Python open source software
GitHub repositories show a top-5 accuracy of 92\%, surpassing the baseline
models by 20\% averaged over classes, for both intra and cross-project
settings.
","[{'version': 'v1', 'created': 'Fri, 29 Nov 2019 04:22:48 GMT'}]",2019-12-03,"[['Svyatkovskiy', 'Alexey', ''], ['Zhao', 'Ying', ''], ['Fu', 'Shengyu', ''], ['Sundaresan', 'Neel', '']]","['Code completion', 'neural networks', 'naturalness of software']"
4463,1309.7289,Hamidreza Sotoodeh,"Hamidreza Sotoodeh, Farshad Safaei, Arghavan Sanei and Elahe Daei","A General Stochastic Information Diffusion Model in Social Networks
  based on Epidemic Diseases",,,10.5121/ijcnc.2013.5512,,cs.SI physics.soc-ph,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Social networks are an important infrastructure for information, viruses and
innovations propagation. Since users behavior has influenced by other users
activity, some groups of people would be made regard to similarity of users
interests. On the other hand, dealing with many events in real worlds, can be
justified in social networks; spreading disease is one instance of them. People
manner and infection severity are more important parameters in dissemination of
diseases. Both of these reasons derive, whether the diffusion leads to an
epidemic or not. SIRS is a hybrid model of SIR and SIS disease models to spread
contamination. A person in this model can be returned to susceptible state
after it removed. According to communities which are established on the social
network, we use the compartmental type of SIRS model. During this paper, a
general compartmental information diffusion model would be proposed and
extracted some of the beneficial parameters to analyze our model. To adapt our
model to realistic behaviors, we use Markovian model, which would be helpful to
create a stochastic manner of the proposed model. In the case of random model,
we can calculate probabilities of transaction between states and predicting
value of each state. The comparison between two mode of the model shows that,
the prediction of population would be verified in each state.
","[{'version': 'v1', 'created': 'Fri, 27 Sep 2013 16:32:24 GMT'}]",2013-09-30,"[['Sotoodeh', 'Hamidreza', ''], ['Safaei', 'Farshad', ''], ['Sanei', 'Arghavan', ''], ['Daei', 'Elahe', '']]","['Information diffusion', 'Social Network', 'epidemic disease', 'DTMC Markov model', 'SIRS epidemic model']"
4464,1902.08009,Zekun Li,"Zeyu Cui, Zekun Li, Shu Wu, Xiaoyu Zhang, Liang Wang","Dressing as a Whole: Outfit Compatibility Learning Based on Node-wise
  Graph Neural Networks","11 pages, accepted by the 2019 World Wide Web Conference (WWW-2019)",,10.1145/3308558.3313444,,cs.IR cs.LG,http://creativecommons.org/publicdomain/zero/1.0/,"  With the rapid development of fashion market, the customers' demands of
customers for fashion recommendation are rising. In this paper, we aim to
investigate a practical problem of fashion recommendation by answering the
question ""which item should we select to match with the given fashion items and
form a compatible outfit"". The key to this problem is to estimate the outfit
compatibility. Previous works which focus on the compatibility of two items or
represent an outfit as a sequence fail to make full use of the complex
relations among items in an outfit. To remedy this, we propose to represent an
outfit as a graph. In particular, we construct a Fashion Graph, where each node
represents a category and each edge represents interaction between two
categories. Accordingly, each outfit can be represented as a subgraph by
putting items into their corresponding category nodes. To infer the outfit
compatibility from such a graph, we propose Node-wise Graph Neural Networks
(NGNN) which can better model node interactions and learn better node
representations. In NGNN, the node interaction on each edge is different, which
is determined by parameters correlated to the two connected nodes. An attention
mechanism is utilized to calculate the outfit compatibility score with learned
node representations. NGNN can not only be used to model outfit compatibility
from visual or textual modality but also from multiple modalities. We conduct
experiments on two tasks: (1) Fill-in-the-blank: suggesting an item that
matches with existing components of outfit; (2) Compatibility prediction:
predicting the compatibility scores of given outfits. Experimental results
demonstrate the great superiority of our proposed method over others.
","[{'version': 'v1', 'created': 'Thu, 21 Feb 2019 12:50:01 GMT'}]",2019-02-22,"[['Cui', 'Zeyu', ''], ['Li', 'Zekun', ''], ['Wu', 'Shu', ''], ['Zhang', 'Xiaoyu', ''], ['Wang', 'Liang', '']]","['Compatibility learning', 'graph neural networks', 'multi-modal']"
4465,1902.09993,Mohammad Shehab,"Endrit Dosit, Mohammad Shehab, Hirley Alves, and Matti Latva-aho",Performance of Non-orthogonal Multiple Access under Finite Blocklength,,"Elsevier Ad Hoc Networks, 2018",10.1016/j.adhoc.2018.10.001,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a finite-block-length comparison between the
orthogonal multiple access (OMA) scheme and the non-orthogonal multiple access
(NOMA) for the uplink channel. First, we consider the Gaussian channel, and
derive the closed form expressions for the rate and outage probability. Then,
we extend our results to the quasi-static Rayleigh fading channel. Our analysis
is based on the recent results on the characterization of the maximum coding
rate at finite block-length and finite block-error probability. The overall
system throughput is evaluated as a function of the number of information bits,
channel uses and power. We find what would be the respective values of these
different parameters that would enable throughput maximization. Furthermore, we
analyze the system performance in terms of reliability and throughput when
applying the type-I ARQ protocol with limited number of retransmissions. The
throughput and outage probability are evaluated for different blocklengths and
number of information bits. Our analysis reveals that there is a trade-off
between reliability and throughput in the ARQ. While increasing the number of
retransmissions boosts reliability by minimizing the probability of reception
error, it results in more delay which decreases the throughput. Nevertheless,
the results show that NOMA always outperforms OMA in terms of throughput,
reliability and latency regardless of the users priority or the number of
retransmissions in both Gaussian and fading channels.
","[{'version': 'v1', 'created': 'Tue, 26 Feb 2019 15:16:15 GMT'}]",2019-03-14,"[['Dosit', 'Endrit', ''], ['Shehab', 'Mohammad', ''], ['Alves', 'Hirley', ''], ['Latva-aho', 'Matti', '']]","['non-orthogonal multiple access (NOMA)', 'finite blocklength', 'ultra']"
4466,2102.12111,Ngoc Tran,"Toan Pham Van, Ngoc N. Tran, and Ta Minh Thanh","Deep Learning Approach for Singer Voice Classification of Vietnamese
  Popular Music","Published in SoICT 2019: Proceedings of the Tenth International
  Symposium on Information and Communication Technology","SoICT 2019: Proceedings of the Tenth International Symposium on
  Information and Communication Technology",10.1145/3368926.3369700,,cs.SD cs.LG eess.AS,http://creativecommons.org/licenses/by-sa/4.0/,"  Singer voice classification is a meaningful task in the digital era. With a
huge number of songs today, identifying a singer is very helpful for music
information retrieval, music properties indexing, and so on. In this paper, we
propose a new method to identify the singer's name based on analysis of
Vietnamese popular music. We employ the use of vocal segment detection and
singing voice separation as the pre-processing steps. The purpose of these
steps is to extract the singer's voice from the mixture sound. In order to
build a singer classifier, we propose a neural network architecture working
with Mel Frequency Cepstral Coefficient as extracted input features from said
vocal. To verify the accuracy of our methods, we evaluate on a dataset of 300
Vietnamese songs from 18 famous singers. We achieve an accuracy of 92.84% with
5-fold stratified cross-validation, the best result compared to other methods
on the same data set.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2021 08:03:07 GMT'}]",2021-02-25,"[['Van', 'Toan Pham', ''], ['Tran', 'Ngoc N.', ''], ['Thanh', 'Ta Minh', '']]","['vocal extraction', 'singer classification', 'deep learning', 'music information retrieval']"
4467,2107.11789,Wentao Zhang,"Wentao Zhang, Yuezihan Jiang, Yang Li, Zeang Sheng, Yu Shen, Xupeng
  Miao, Liang Wang, Zhi Yang, Bin Cui",ROD: Reception-aware Online Distillation for Sparse Graphs,,"Proceedings of the 27th ACM SIGKDD Conference on Knowledge
  Discovery and Data Mining (KDD-2021)",10.1145/3447548.3467221,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph neural networks (GNNs) have been widely used in many graph-based tasks
such as node classification, link prediction, and node clustering. However,
GNNs gain their performance benefits mainly from performing the feature
propagation and smoothing across the edges of the graph, thus requiring
sufficient connectivity and label information for effective propagation.
Unfortunately, many real-world networks are sparse in terms of both edges and
labels, leading to sub-optimal performance of GNNs. Recent interest in this
sparse problem has focused on the self-training approach, which expands
supervised signals with pseudo labels. Nevertheless, the self-training approach
inherently cannot realize the full potential of refining the learning
performance on sparse graphs due to the unsatisfactory quality and quantity of
pseudo labels.
  In this paper, we propose ROD, a novel reception-aware online knowledge
distillation approach for sparse graph learning. We design three supervision
signals for ROD: multi-scale reception-aware graph knowledge, task-based
supervision, and rich distilled knowledge, allowing online knowledge transfer
in a peer-teaching manner. To extract knowledge concealed in the multi-scale
reception fields, ROD explicitly requires individual student models to preserve
different levels of locality information. For a given task, each student would
predict based on its reception-scale knowledge, while simultaneously a strong
teacher is established on-the-fly by combining multi-scale knowledge. Our
approach has been extensively evaluated on 9 datasets and a variety of
graph-based tasks, including node classification, link prediction, and node
clustering. The result demonstrates that ROD achieves state-of-art performance
and is more robust for the graph sparsity.
","[{'version': 'v1', 'created': 'Sun, 25 Jul 2021 11:55:47 GMT'}]",2021-07-28,"[['Zhang', 'Wentao', ''], ['Jiang', 'Yuezihan', ''], ['Li', 'Yang', ''], ['Sheng', 'Zeang', ''], ['Shen', 'Yu', ''], ['Miao', 'Xupeng', ''], ['Wang', 'Liang', ''], ['Yang', 'Zhi', ''], ['Cui', 'Bin', '']]","['online distillation', 'reception field', 'graph neural networks']"
4468,1911.09923,Claudia Savina Bianchini,"Claudia S. Bianchini (FORELLIS), Fabrizio Borgia (UPS), Maria de
  Marsico","SWift -- A SignWriting editor to bridge between deaf world and
  e-learning",,"Proceedings of the International Conference on Advanced Learning
  Technologies (ICALT), IEEE - Institute of Electrical and Electronics
  Engineers, pp.526-530, 2012, 978-0-7695-4702-2",10.1109/ICALT.2012.235,pubblicazione #010,cs.HC cs.CL cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  SWift (SignWriting improved fast transcriber) is an advanced editor for
SignWriting (SW). At present, SW is a promising alternative to provide
documents in an easy-to-grasp written form of (any) Sign Language, the gestural
way of communication which is widely adopted by the deaf community. SWift was
developed SW users, either deaf or not, to support collaboration and exchange
of ideas. The application allows composing and saving desired signs using
elementary components, called glyphs. The procedure that was devised guides and
simplifies the editing process. SWift aims at breaking the ""electronic""
barriers that keep the deaf community away from ICT in general, and from
e-learning in particular. The editor can be contained in a pluggable module;
therefore, it can be integrated everywhere the use of SW is an advisable
alternative to written ""verbal"" language, which often hinders information
grasping by deaf users.
","[{'version': 'v1', 'created': 'Fri, 22 Nov 2019 08:44:23 GMT'}]",2019-11-25,"[['Bianchini', 'Claudia S.', '', 'FORELLIS'], ['Borgia', 'Fabrizio', '', 'UPS'], ['de Marsico', 'Maria', '']]","['Sign Languages', 'SignWriting', 'Deafness', 'Accessibility', 'User-Centered Design for Special Needs']"
4469,2201.09486,Wiebke Toussaint Hutiri,Wiebke Toussaint Hutiri and Aaron Ding,Bias in Automated Speaker Recognition,,"2022 ACM Conference on Fairness, Accountability, and Transparency
  (FAccT '22)",10.1145/3531146.3533089,,cs.SD cs.CL cs.CY cs.LG eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Automated speaker recognition uses data processing to identify speakers by
their voice. Today, automated speaker recognition is deployed on billions of
smart devices and in services such as call centres. Despite their wide-scale
deployment and known sources of bias in related domains like face recognition
and natural language processing, bias in automated speaker recognition has not
been studied systematically. We present an in-depth empirical and analytical
study of bias in the machine learning development workflow of speaker
verification, a voice biometric and core task in automated speaker recognition.
Drawing on an established framework for understanding sources of harm in
machine learning, we show that bias exists at every development stage in the
well-known VoxCeleb Speaker Recognition Challenge, including data generation,
model building, and implementation. Most affected are female speakers and
non-US nationalities, who experience significant performance degradation.
Leveraging the insights from our findings, we make practical recommendations
for mitigating bias in automated speaker recognition, and outline future
research directions.
","[{'version': 'v1', 'created': 'Mon, 24 Jan 2022 06:48:57 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Jun 2022 00:34:09 GMT'}]",2022-06-22,"[['Hutiri', 'Wiebke Toussaint', ''], ['Ding', 'Aaron', '']]","['speaker recognition', 'speaker verification', 'bias', 'fairness', 'audit', 'evaluation']"
4470,1812.07416,Anil Koyuncu,"Anil Koyuncu, Tegawend\'e F. Bissyand\'e, Dongsun Kim, Jacques Klein,
  Martin Monperrus, Yves Le Traon",Impact of Tool Support in Patch Construction,,Proceedings of ISSTA 2017,10.1145/3092703.3092713,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we investigate the practice of patch construction in the Linux
kernel development, focusing on the differences between three patching
processes: (1) patches crafted entirely manually to fix bugs, (2) those that
are derived from warnings of bug detection tools, and (3) those that are
automatically generated based on fix patterns. With this study, we provide to
the research community concrete insights on the practice of patching as well as
how the development community is currently embracing research and commercial
patching tools to improve productivity in repair. The result of our study shows
that tool-supported patches are increasingly adopted by the developer community
while manually-written patches are accepted more quickly. Patch application
tools enable developers to remain committed to contributing patches to the code
base. Our findings also include that, in actual development processes, patches
generally implement several change operations spread over the code, even for
patches fixing warnings by bug detection tools. Finally, this study has shown
that there is an opportunity to directly leverage the output of bug detection
tools to readily generate patches that are appropriate for fixing the problem,
and that are consistent with manually-written patches.
","[{'version': 'v1', 'created': 'Tue, 18 Dec 2018 15:02:26 GMT'}]",2018-12-20,"[['Koyuncu', 'Anil', ''], ['Bissyandé', 'Tegawendé F.', ''], ['Kim', 'Dongsun', ''], ['Klein', 'Jacques', ''], ['Monperrus', 'Martin', ''], ['Traon', 'Yves Le', '']]","['Repair', 'Debugging', 'Patch', 'Linux', 'Empirical', 'Tools', 'Automation']"
4471,1802.09348,Dian Pratiwi,"Risky Armansyah, Dian Pratiwi",Game of the Cursed Prince based on Android,"6 pages, 17 figures","International Journal of Computer Applications, Volume 179 -
  Number 19, 2018",10.5120/ijca2018916333,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays Games become an entertainment alternative for various circles,
industry and game development business is also a profitable industry. In
Indonesia the amount of game consumption is very high, especially the console
game type RPG (Role Playing Game). The task of this research is developing game
software using Unity 3D to create an Android-based RPG game app. The story is
packed with RPG genres so the player can feel the main role of the storys
imagination. The game to be built is a game titled The Cursed Prince. Users
will get the sensation of royal adventure. Multiplayer game system, graphics in
3D game, The main character in this game is Prince, enemies in this game are
wizards and monsters, Game is not limited time to complete. And the game can be
saved, so it can be reopened. The game of The Cursed Prince can be part of
Indonesian Industry Gaming development.
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 14:24:52 GMT'}]",2018-02-27,"[['Armansyah', 'Risky', ''], ['Pratiwi', 'Dian', '']]","['Game', 'Role Playing Game', 'Unity 3D']"
4472,0709.1166,Daniel Lemire,"Daniel Lemire, Martin Brooks, Yuhong Yan",An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation,This is the extended version of our ICDM'05 paper (arXiv:cs/0702142),"Daniel Lemire, Martin Brooks and Yuhong Yan, An Optimal Linear
  Time Algorithm for Quasi-Monotonic Segmentation. International Journal of
  Computer Mathematics 86 (7), 2009.",10.1080/00207160701694153,NRC-00156,cs.DB,,"  Monotonicity is a simple yet significant qualitative characteristic. We
consider the problem of segmenting a sequence in up to K segments. We want
segments to be as monotonic as possible and to alternate signs. We propose a
quality metric for this problem using the l_inf norm, and we present an optimal
linear time algorithm based on novel formalism. Moreover, given a
precomputation in time O(n log n) consisting of a labeling of all extrema, we
compute any optimal segmentation in constant time. We compare experimentally
its performance to two piecewise linear segmentation heuristics (top-down and
bottom-up). We show that our algorithm is faster and more accurate.
Applications include pattern recognition and qualitative modeling.
","[{'version': 'v1', 'created': 'Fri, 7 Sep 2007 21:18:57 GMT'}]",2009-09-01,"[['Lemire', 'Daniel', ''], ['Brooks', 'Martin', ''], ['Yan', 'Yuhong', '']]","['Time Series', 'Segmentation', 'Monotonicity', 'Design of Algorithms']"
4473,1006.5234,Leslie Ann Goldberg,Leslie Ann Goldberg and Mark Jerrum,"Approximating the Tutte polynomial of a binary matroid and other related
  combinatorial polynomials",,"JCSS 79(1) (February, 2013) 68-78",10.1016/j.jcss.2012.04.005,,cs.CC math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of approximating certain combinatorial polynomials.
First, we consider the problem of approximating the Tutte polynomial of a
binary matroid with parameters q>= 2 and gamma. (Relative to the classical
(x,y) parameterisation, q=(x-1)(y-1) and gamma=y-1.) A graph is a special case
of a binary matroid, so earlier work by the authors shows inapproximability
(subject to certain complexity assumptions) for q>2, apart from the trivial
case gamma=0. The situation for q=2 is different. Previous results for graphs
imply inapproximability in the region -2<=gamma<0, apart from at two ""special
points"" where the polynomial can be computed exactly in polynomial time. For
binary matroids, we extend this result by showing (i) there is no FPRAS in the
region gamma<-2 unless NP=RP, and (ii) in the region gamma>0, the approximation
problem is hard for the complexity class #RHPi_1 under approximation-preserving
(AP) reducibility. The latter result indicates a gap in approximation
complexity at q=2: whereas an FPRAS is known in the graphical case, there can
be none in the binary matroid case, unless there is an FPRAS for all of
#RHPi_1. The result also implies that it is computationally difficult to
approximate the weight enumerator of a binary linear code, apart from at the
special weights at which the problem is exactly solvable in polynomial time. As
a consequence, we show that approximating the cycle index polynomial of a
permutation group is hard for #RHPi_1 under AP-reducibility, partially
resolving a question that we first posed in 1992.
","[{'version': 'v1', 'created': 'Sun, 27 Jun 2010 20:29:56 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Apr 2012 10:11:16 GMT'}]",2013-08-01,"[['Goldberg', 'Leslie Ann', ''], ['Jerrum', 'Mark', '']]","['Tutte polynomial of a binary matroid', 'weight enumerator of abinary linear code', 'cycle index polynomial']"
4474,1804.06550,Marcos Baez,"Svetlana Nikitina, Sara Callaioli, Marcos Baez",Smart Conversational Agents for Reminiscence,,,10.1145/3195555.3195567,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we describe the requirements and early system design for a
smart conversational agent that can assist older adults in the reminiscence
process. The practice of reminiscence has well documented benefits for the
mental, social and emotional well-being of older adults. However, the
technology support, valuable in many different ways, is still limited in terms
of need of co-located human presence, data collection capabilities, and ability
to support sustained engagement, thus missing key opportunities to improve care
practices, facilitate social interactions, and bring the reminiscence practice
closer to those with less opportunities to engage in co-located sessions with a
(trained) companion. We discuss conversational agents and cognitive services as
the platform for building the next generation of reminiscence applications, and
introduce the concept application of a smart reminiscence agent.
","[{'version': 'v1', 'created': 'Wed, 18 Apr 2018 04:48:01 GMT'}]",2018-04-19,"[['Nikitina', 'Svetlana', ''], ['Callaioli', 'Sara', ''], ['Baez', 'Marcos', '']]","['conversational agents', 'reminiscence', 'system requirements']"
4475,1811.04493,Madeleine Kotzagiannidis,"Madeleine S. Kotzagiannidis, Mike E. Davies","Analysis vs Synthesis with Structure - An Investigation of Union of
  Subspace Models on Graphs",,,10.1016/j.acha.2022.03.002,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of characterizing the `duality gap' between sparse
synthesis- and cosparse analysis-driven signal models through the lens of
spectral graph theory, in an effort to comprehend their precise equivalencies
and discrepancies. By detecting and exploiting the inherent connectivity
structure, and hence, distinct set of properties, of rank-deficient graph
difference matrices such as the graph Laplacian, we are able to substantiate
discrepancies between the cosparse analysis and sparse synthesis models,
according to which the former constitutes a constrained and translated instance
of the latter. In view of a general union of subspaces model, we conduct a
study of the associated subspaces and their composition, which further
facilitates the refinement of specialized uniqueness and recovery guarantees,
and discover an underlying structured sparsity model based on the graph
incidence matrix. Furthermore, for circulant graphs, we provide an exact
characterization of underlying subspaces by deriving closed-form expressions as
well as demonstrating transitional properties between equivalence and
non-equivalence for a parametric generalization of the graph Laplacian.
","[{'version': 'v1', 'created': 'Sun, 11 Nov 2018 22:12:51 GMT'}]",2022-04-06,"[['Kotzagiannidis', 'Madeleine S.', ''], ['Davies', 'Mike E.', '']]","['graph signal processing', 'green’s functions on graphs', 'union ofsubspaces model', 'cosparsity', 'structured sparsity', 'graph theory']"
4476,1412.8591,Sanjiv Sambandan,"Aswathi Nair, Karthik Raghunandan, Vaddi Yaswanth, Sreelal Shridharan,
  Sanjiv Sambandan","Maze Solving Automatons for Self-Healing of Open Interconnects: Modular
  Add-on for Circuit Boards",,"Appl. Phys. Lett. 106, 123103 (2016)",10.1063/1.4916513,,cs.ET cond-mat.soft,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the circuit board integration of a self-healing mechanism to
repair open faults. The electric field driven mechanism physically restores
fractured interconnects in electronic circuits and has the ability to solve
mazes. The repair is performed by conductive particles dispersed in an
insulating fluid. We demonstrate the integration of the healing module onto
printed circuit boards and the ability of maze solving. We model and perform
experiments on the influence of the geometry of the conductive particles as
well as the terminal impedances of the route on the healing efficiency. The
typical heal rate is 10 $\mu$m/s with healed route having resistance of 100
$\Omega$ to 20 k$\Omega$ depending on the materials and concentrations used.
","[{'version': 'v1', 'created': 'Tue, 30 Dec 2014 09:33:46 GMT'}]",2018-08-14,"[['Nair', 'Aswathi', ''], ['Raghunandan', 'Karthik', ''], ['Yaswanth', 'Vaddi', ''], ['Shridharan', 'Sreelal', ''], ['Sambandan', 'Sanjiv', '']]","['Carbon nanotubes', 'organic electronics', 'dispersions', 'self-healing', 'reliabil']"
4477,1808.01023,Fang-Jing Wu,"G\""urkan Solmaz and Fang-Jing Wu",Together or Alone: Detecting Group Mobility with Wireless Fingerprints,"This work has received funding from the European Union's Horizon 2020
  research and innovation programme within the project ""Worldwide
  Interoperability for SEmantics IoT"" under grant agreement Number 723156",,10.1109/ICC.2017.7997426,,cs.NI eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a novel approach for detecting groups of people that walk
""together"" (group mobility) as well as the people who walk ""alone"" (individual
movements) using wireless signals. We exploit multiple wireless sniffers to
pervasively collect human mobility data from people with mobile devices and
identify similarities and the group mobility based on the wireless
fingerprints. We propose a method which initially converts the wireless packets
collected by the sniffers into people's wireless fingerprints. The method then
determines group mobility by finding the statuses of people at certain times
(dynamic/static) and the space correlation of dynamic people. To evaluate the
feasibility of our approach, we conduct real world experiments by collecting
data from 10 participants carrying Bluetooth Low Energy (BLE) beacons in an
office environment for a two-week period. The proposed approach captures space
correlation with 95% and group mobility with 79% accuracies on average. With
the proposed approach we successfully 1) detect the groups and individual
movements and 2) generate social networks based on the group mobility
characteristics.
","[{'version': 'v1', 'created': 'Thu, 2 Aug 2018 20:58:49 GMT'}]",2018-08-06,"[['Solmaz', 'Gürkan', ''], ['Wu', 'Fang-Jing', '']]","['crowd mobility', 'human mobility', 'internet of things', 'social networks']"
4478,2105.10047,Ross Greer,Ross Greer and Shlomo Dubnov,Restoring Eye Contact to the Virtual Classroom with Machine Learning,,"Proceedings of CSME 2021, ISBN: 978-989-758-502-9",10.5220/0010539806980708,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Nonverbal communication, in particular eye contact, is a critical element of
the music classroom, shown to keep students on task, coordinate musical flow,
and communicate improvisational ideas. Unfortunately, this nonverbal aspect to
performance and pedagogy is lost in the virtual classroom. In this paper, we
propose a machine learning system which uses single instance, single camera
image frames as input to estimate the gaze target of a user seated in front of
their computer, augmenting the user's video feed with a display of the
estimated gaze target and thereby restoring nonverbal communication of directed
gaze. The proposed estimation system consists of modular machine learning
blocks, leading to a target-oriented (rather than coordinate-oriented) gaze
prediction. We instantiate one such example of the complete system to run a
pilot study in a virtual music classroom over Zoom software. Inference time and
accuracy meet benchmarks for videoconferencing applications, and quantitative
and qualitative results of pilot experiments include improved success of cue
interpretation and student-reported formation of collaborative, communicative
relationships between conductor and musician.
","[{'version': 'v1', 'created': 'Thu, 20 May 2021 21:51:44 GMT'}]",2021-05-24,"[['Greer', 'Ross', ''], ['Dubnov', 'Shlomo', '']]","['Gaze Estimation', 'Convolutional Neural Networks', 'Human-Computer Interaction', 'Distance Learning', 'MusicEducation', 'Telematic Performance']"
4479,1612.01822,Robin Haunschild,Robin Haunschild and Lutz Bornmann,"How many scientific papers are mentioned in policy-related documents? An
  empirical investigation using Web of Science and Altmetric data","14 pages, 3 tables",,10.1007/s11192-016-2237-2,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this short communication, we provide an overview of a relatively newly
provided source of altmetrics data which could possibly be used for societal
impact measurements in scientometrics. Recently, Altmetric - a start-up
providing publication level metrics - started to make data for publications
available which have been mentioned in policy-related documents. Using data
from Altmetric, we study how many papers indexed in the Web of Science (WoS)
are mentioned in policy-related documents. We find that less than 0.5% of the
papers published in different subject categories are mentioned at least once in
policy-related documents. Based on our results, we recommend that the analysis
of (WoS) publications with at least one policy-related mention is repeated
regularly (annually). Mentions in policy-related documents should not be used
for impact measurement until new policy-related sites are tracked.
","[{'version': 'v1', 'created': 'Tue, 6 Dec 2016 14:28:37 GMT'}]",2017-02-03,"[['Haunschild', 'Robin', ''], ['Bornmann', 'Lutz', '']]","['Bibliometrics; altmetrics', 'policy documents', 'policy-related mentions', 'societal impact']"
4480,1904.01000,Issam Damaj,"Issam Damaj (1), Safaa Kasbah (2) ((1), American University of Kuwait,
  (2) Lebanese American University)","An Analysis Framework for Hardware and Software Implementations with
  Applications from Cryptography","20 Pages, 6 Figures, 5 Tables","Electrical & Computer Engineering, Elsevier. 69 (2018) 572-584",10.1016/j.compeleceng.2017.06.008,,cs.DC cs.CR cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the richness of present-day hardware architectures, tightening the
synergy between hardware and software has attracted a great attention. The
interest in unified approaches paved the way for newborn frameworks that target
hardware and software co-design. This paper confirms that a unified statistical
framework can successfully classify algorithms based on a combination of the
heterogeneous characteristics of their hardware and software implementations.
The proposed framework produces customizable indicators for any hybridization
of processing systems and can be contextualized for any area of application.
The framework is used to develop the Lightness Indicator System (LIS) as a
case-study that targets a set of cryptographic algorithms that are known in the
literature to be tiny and light. The LIS targets state-of-the-art multi-core
processors and high-end Field Programmable Gate Arrays (FPGAs). The presented
work includes a generic benchmark model that aids the clear presentation of the
framework and extensive performance analysis and evaluation.
","[{'version': 'v1', 'created': 'Sat, 30 Mar 2019 18:38:55 GMT'}]",2019-05-24,"[['Damaj', 'Issam', ''], ['Kasbah', 'Safaa', '']]","['Analysis', 'Hardware', 'Software', 'Gate Arrays', 'Algorithms', 'Cryptography']"
4481,1403.4010,Wei Wei,"Wei Wei, Renquan Zhang, Baolong Niu, Binghui Guo, Zhiming Zheng",Organization mechanism and counting algorithm on Vertex-Cover solutions,"17 pages, 6 figures",,10.1088/1742-5468/2015/04/P04002,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Counting the solution number of combinational optimization problems is an
important topic in the study of computational complexity, especially on the
#P-complete complexity class. In this paper, we first investigate some
organizations of Vertex-Cover unfrozen subgraphs by the underlying connectivity
and connected components of unfrozen vertices. Then, a Vertex-Cover Solution
Number Counting Algorithm is proposed and its complexity analysis is provided,
the results of which fit very well with the simulations and have better
performance than those by 1-RSB in a neighborhood of c = e for random graphs.
Base on the algorithm, variation and fluctuation on the solution number
statistics are studied to reveal the evolution mechanism of the solution
numbers. Besides, marginal probability distributions on the solution space are
investigated on both random graph and scale-free graph to illustrate different
evolution characteristics of their solution spaces. Thus, doing solution number
counting based on graph expression of solution space should be an alternative
and meaningful way to study the hardness of NP-complete and #P-complete
problems, and appropriate algorithm design can help to achieve better
approximations of solving combinational optimization problems and the
corresponding counting problems.
","[{'version': 'v1', 'created': 'Mon, 17 Mar 2014 06:44:35 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Jan 2015 18:31:18 GMT'}]",2015-06-19,"[['Wei', 'Wei', ''], ['Zhang', 'Renquan', ''], ['Niu', 'Baolong', ''], ['Guo', 'Binghui', ''], ['Zheng', 'Zhiming', '']]","['disordered systems (theory)', 'classical phase transitions (theory)', 'cavity andreplica method', 'phase diagrams (theory)']"
4482,1507.04309,Dmitry Zakablukov,Dmitry V. Zakablukov,Application of Permutation Group Theory in Reversible Logic Synthesis,"In English, 15 pages, 2 figures, 7 tables. Proceeding of the RC 2016
  conference",,10.1007/978-3-319-40578-0_17,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper discusses various applications of permutation group theory in the
synthesis of reversible logic circuits consisting of Toffoli gates with
negative control lines. An asymptotically optimal synthesis algorithm for
circuits consisting of gates from the NCT library is described. An algorithm
for gate complexity reduction, based on equivalent replacements of gates
compositions, is introduced. A new approach for combining a group-theory-based
synthesis algorithm with a Reed-Muller-spectra-based synthesis algorithm is
described. Experimental results are presented to show that the proposed
synthesis techniques allow a reduction in input lines count, gate complexity or
quantum cost of reversible circuits for various benchmark functions.
","[{'version': 'v1', 'created': 'Wed, 15 Jul 2015 17:42:41 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Oct 2015 07:38:27 GMT'}, {'version': 'v3', 'created': 'Wed, 10 Feb 2016 16:15:43 GMT'}, {'version': 'v4', 'created': 'Tue, 29 Mar 2016 09:32:34 GMT'}, {'version': 'v5', 'created': 'Fri, 8 Jul 2016 08:47:29 GMT'}]",2016-07-11,"[['Zakablukov', 'Dmitry V.', '']]","['reversible logic', 'synthesis', 'permutation group theory']"
4483,1904.02441,Sanjay Sahay,"Hemant Rathore, Swati Agarwal, Sanjay K. Sahay and Mohit Sewak",Malware Detection using Machine Learning and Deep Learning,11 Pages and 3 Figures,"Springer, LNCS, Vol. 11297, pp. 402-411, International Conference
  on Big Data Analytics, 2018",10.1007/978-3-030-04780-1_28,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Research shows that over the last decade, malware has been growing
exponentially, causing substantial financial losses to various organizations.
Different anti-malware companies have been proposing solutions to defend
attacks from these malware. The velocity, volume, and the complexity of malware
are posing new challenges to the anti-malware community. Current
state-of-the-art research shows that recently, researchers and anti-virus
organizations started applying machine learning and deep learning methods for
malware analysis and detection. We have used opcode frequency as a feature
vector and applied unsupervised learning in addition to supervised learning for
malware classification. The focus of this tutorial is to present our work on
detecting malware with 1) various machine learning algorithms and 2) deep
learning models. Our results show that the Random Forest outperforms Deep
Neural Network with opcode frequency as a feature. Also in feature reduction,
Deep Auto-Encoders are overkill for the dataset, and elementary function like
Variance Threshold perform better than others. In addition to the proposed
methodologies, we will also discuss the additional issues and the unique
challenges in the domain, open research problems, limitations, and future
directions.
","[{'version': 'v1', 'created': 'Thu, 4 Apr 2019 10:01:26 GMT'}]",2019-04-05,"[['Rathore', 'Hemant', ''], ['Agarwal', 'Swati', ''], ['Sahay', 'Sanjay K.', ''], ['Sewak', 'Mohit', '']]","['Auto-Encoders', 'Cyber Security', 'Deep Learning', 'Machine Learning', 'Malware Detection']"
4484,1807.00900,Eneldo Loza Menc\'ia,"Patryk Hopner, Eneldo Loza Menc\'ia",Analysis and Optimization of Deep Counterfactual Value Networks,"Long version of publication appearing at KI 2018: The 41st German
  Conference on Artificial Intelligence
  (http://dx.doi.org/10.1007/978-3-030-00111-7_26). Corrected typo in title",,10.1007/978-3-030-00111-7_26,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently a strong poker-playing algorithm called DeepStack was published,
which is able to find an approximate Nash equilibrium during gameplay by using
heuristic values of future states predicted by deep neural networks. This paper
analyzes new ways of encoding the inputs and outputs of DeepStack's deep
counterfactual value networks based on traditional abstraction techniques, as
well as an unabstracted encoding, which was able to increase the network's
accuracy.
","[{'version': 'v1', 'created': 'Mon, 2 Jul 2018 21:36:23 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Oct 2018 16:48:29 GMT'}]",2018-10-15,"[['Hopner', 'Patryk', ''], ['Mencía', 'Eneldo Loza', '']]","['Poker', 'Deep Neural Networks', 'Game Abstractions']"
4485,1907.13600,Marcelo Ponce,"Marcelo Ponce, Ramses van Zon, Scott Northrup, Daniel Gruner, Joseph
  Chen, Fatih Ertinaz, Alexey Fedoseev, Leslie Groer, Fei Mao, Bruno C. Mundim,
  Mike Nolta, Jaime Pinto, Marco Saldarriaga, Vladimir Slavnic, Erik Spence,
  Ching-Hsing Yu, W. Richard Peltier","Deploying a Top-100 Supercomputer for Large Parallel Workloads: the
  Niagara Supercomputer","PEARC'19: ""Practice and Experience in Advanced Research Computing"",
  July 28-August 1, 2019, Chicago, IL, USA",,10.1145/3332186.3332195,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Niagara is currently the fastest supercomputer accessible to academics in
Canada. It was deployed at the beginning of 2018 and has been serving the
research community ever since. This homogeneous 60,000-core cluster, owned by
the University of Toronto and operated by SciNet, was intended to enable large
parallel jobs and has a measured performance of 3.02 petaflops, debuting at #53
in the June 2018 TOP500 list. It was designed to optimize throughput of a range
of scientific codes running at scale, energy efficiency, and network and
storage performance and capacity. It replaced two systems that SciNet operated
for over 8 years, the Tightly Coupled System (TCS) and the General Purpose
Cluster (GPC). In this paper we describe the transition process from these two
systems, the procurement and deployment processes, as well as the unique
features that make Niagara a one-of-a-kind machine in Canada.
","[{'version': 'v1', 'created': 'Wed, 31 Jul 2019 17:06:15 GMT'}]",2019-08-01,"[['Ponce', 'Marcelo', ''], ['van Zon', 'Ramses', ''], ['Northrup', 'Scott', ''], ['Gruner', 'Daniel', ''], ['Chen', 'Joseph', ''], ['Ertinaz', 'Fatih', ''], ['Fedoseev', 'Alexey', ''], ['Groer', 'Leslie', ''], ['Mao', 'Fei', ''], ['Mundim', 'Bruno C.', ''], ['Nolta', 'Mike', ''], ['Pinto', 'Jaime', ''], ['Saldarriaga', 'Marco', ''], ['Slavnic', 'Vladimir', ''], ['Spence', 'Erik', ''], ['Yu', 'Ching-Hsing', ''], ['Peltier', 'W. Richard', '']]","['Supercomputer center', 'deployment', 'design', 'high-performance computing', 'best practices']"
4486,1304.6983,Steffen Lewitzka,Steffen Lewitzka,Algebraic semantics for a modal logic close to S1,"14 pages, thoroughly revised and extended version, title has changed",,10.1093/logcom/exu067,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The modal systems S1--S3 were introduced by C. I. Lewis as logics for strict
implication. While there are Kripke semantics for S2 and S3, there is no known
natural semantics for S1. We extend S1 by a Substitution Principle SP which
generalizes a reference rule of S1. In system S1+SP, the relation of strict
equivalence $\varphi\equiv\psi$ satisfies the identity axioms of R. Suszko's
non-Fregean logic adapted to the language of modal logic (we call these axioms
the axioms of propositional identity). This enables us to develop a framework
of algebraic semantics which captures S1+SP as well as the Lewis systems
S3--S5. So from the viewpoint of algebraic semantics, S1+SP turns out to be an
interesting modal logic. We show that S1+SP is strictly contained between S1
and S3 and differs from S2. It is the weakest modal logic containing S1 such
that strict equivalence is axiomatized by propositional identity.
","[{'version': 'v1', 'created': 'Thu, 25 Apr 2013 19:25:30 GMT'}, {'version': 'v2', 'created': 'Sun, 7 Sep 2014 01:06:38 GMT'}]",2014-12-09,"[['Lewitzka', 'Steffen', '']]","['modal logic', 'strict equivalence', 'propositional identity', 'non-Fregeanlogic', 'algebraic semantics']"
4487,0802.3513,Dariusz Dereniowski,Dariusz Dereniowski,The Complexity of Node Blocking for Dags,"7 pages, 3 figures","Journal of Combinatorial Theory, Series A 118 (2011) 248-256",10.1016/j.jcta.2010.03.011,,cs.GT cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the following modification of annihilation game called node
blocking. Given a directed graph, each vertex can be occupied by at most one
token. There are two types of tokens, each player can move his type of tokens.
The players alternate their moves and the current player $i$ selects one token
of type $i$ and moves the token along a directed edge to an unoccupied vertex.
If a player cannot make a move then he loses. We consider the problem of
determining the complexity of the game: given an arbitrary configuration of
tokens in a directed acyclic graph, does the current player has a winning
strategy? We prove that the problem is PSPACE-complete.
","[{'version': 'v1', 'created': 'Sun, 24 Feb 2008 15:29:57 GMT'}]",2021-03-05,"[['Dereniowski', 'Dariusz', '']]","['annihilation game', 'node blocking', 'PSPACE-completeness']"
4488,1901.05484,Marcelo Ponce,"Marcelo Ponce, Erik Spence, Ramses van Zon, Daniel Gruner","Bridging the Educational Gap between Emerging and Established Scientific
  Computing Disciplines","Presented at the Workshop on Strategies for Enhancing HPC Education
  and Training (SEHET18) @ PEARC18","Journal of Computational Science Education, vol 10 (2019)",10.22369/issn.2153-4136/10/1/1,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we describe our experience in developing curriculum courses
aimed at graduate students in emerging computational fields, including biology
and medical science. We focus primarily on computational data analysis and
statistical analysis, while at the same time teaching students best practices
in coding and software development. Our approach combines a theoretical
background and practical applications of concepts. The outcomes and feedback we
have obtained so far have revealed several issues: students in these particular
areas lack instruction like this although they would tremendously benefit from
it; we have detected several weaknesses in the formation of students, in
particular in the statistical foundations but also in analytical thinking
skills. We present here the tools, techniques and methodology we employ while
teaching and developing this type of courses. We also show several outcomes
from this initiative, including potential pathways for fruitful
multi-disciplinary collaborations.
","[{'version': 'v1', 'created': 'Wed, 16 Jan 2019 19:02:07 GMT'}]",2019-01-18,"[['Ponce', 'Marcelo', ''], ['Spence', 'Erik', ''], ['van Zon', 'Ramses', ''], ['Gruner', 'Daniel', '']]","['Training and Education', 'Computational Statistics', 'graduate courses', 'curricula', 'student assessment']"
4489,1512.08017,Poorna Dasgupta,Poorna Banerjee Dasgupta,"An Analytical Evaluation of Matricizing Least-Square-Errors Curve
  Fitting to Support High Performance Computation on Large Datasets","3 pages, Published with International Journal of Computer Trends and
  Technology (IJCTT), Volume-30 Number-2, December-2015","International Journal of Computer Trends and Technology (IJCTT)
  V30(2):113-115, December 2015",10.14445/22312803/IJCTT-V30P120,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The procedure of Least Square-Errors curve fitting is extensively used in
many computer applications for fitting a polynomial curve of a given degree to
approximate a set of data. Although various methodologies exist to carry out
curve fitting on data, most of them have shortcomings with respect to
efficiency especially where huge datasets are involved. This paper proposes and
analyzes a matricized approach to the Least Square-Errors curve fitting with
the primary objective of parallelizing the whole algorithm so that high
performance efficiency can be achieved when algorithmic execution takes place
on colossal datasets.
","[{'version': 'v1', 'created': 'Fri, 25 Dec 2015 16:53:57 GMT'}]",2015-12-29,"[['Dasgupta', 'Poorna Banerjee', '']]","['Data Approximation', 'Least SquareErrors', 'Parallel Computing', 'High Performance Computing']"
4490,1301.3189,Cl\'ement Aubert,Cl\'ement Aubert and Thomas Seiller,Logarithmic Space and Permutations,,"Information and Computation, Volume 248: 2-21 (2016)",10.1016/j.ic.2014.01.018,,cs.LO cs.CC math.LO,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In a recent work, Girard proposed a new and innovative approach to
computational complexity based on the proofs-as-programs correspondence. In a
previous paper, the authors showed how Girard proposal succeeds in obtaining a
new characterization of co-NL languages as a set of operators acting on a
Hilbert Space. In this paper, we extend this work by showing that it is also
possible to define a set of operators characterizing the class L of logarithmic
space languages.
","[{'version': 'v1', 'created': 'Tue, 15 Jan 2013 00:31:00 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Nov 2013 18:53:39 GMT'}, {'version': 'v3', 'created': 'Mon, 16 Feb 2015 08:31:28 GMT'}, {'version': 'v4', 'created': 'Mon, 3 Jun 2019 14:13:01 GMT'}]",2019-06-04,"[['Aubert', 'Clément', ''], ['Seiller', 'Thomas', '']]","['Linear Logic', 'Complexity', 'Geometry of Interaction', 'PointerMachine', 'Finite Automata', 'Logarithmic Space']"
4491,1803.08607,Tao Sheng,"Tao Sheng, Chen Feng, Shaojie Zhuo, Xiaopeng Zhang, Liang Shen, Mickey
  Aleksic",A Quantization-Friendly Separable Convolution for MobileNets,"Accepted At THE 1ST WORKSHOP ON ENERGY EFFICIENT MACHINE LEARNING AND
  COGNITIVE COMPUTING FOR EMBEDDED APPLICATIONS (EMC^2 2018)","https://ieeexplore.ieee.org/document/8524017, 2018",10.1109/EMC2.2018.00011,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As deep learning (DL) is being rapidly pushed to edge computing, researchers
invented various ways to make inference computation more efficient on
mobile/IoT devices, such as network pruning, parameter compression, and etc.
Quantization, as one of the key approaches, can effectively offload GPU, and
make it possible to deploy DL on fixed-point pipeline. Unfortunately, not all
existing networks design are friendly to quantization. For example, the popular
lightweight MobileNetV1, while it successfully reduces parameter size and
computation latency with separable convolution, our experiment shows its
quantized models have large accuracy gap against its float point models. To
resolve this, we analyzed the root cause of quantization loss and proposed a
quantization-friendly separable convolution architecture. By evaluating the
image classification task on ImageNet2012 dataset, our modified MobileNetV1
model can archive 8-bit inference top-1 accuracy in 68.03%, almost closed the
gap to the float pipeline.
","[{'version': 'v1', 'created': 'Thu, 22 Mar 2018 23:06:38 GMT'}, {'version': 'v2', 'created': 'Sat, 9 Mar 2019 07:32:09 GMT'}, {'version': 'v3', 'created': 'Tue, 12 Mar 2019 17:58:19 GMT'}]",2019-03-13,"[['Sheng', 'Tao', ''], ['Feng', 'Chen', ''], ['Zhuo', 'Shaojie', ''], ['Zhang', 'Xiaopeng', ''], ['Shen', 'Liang', ''], ['Aleksic', 'Mickey', '']]","['Separable Convolution', 'MobileNetV1', 'Quantization', 'Fixed-point Inference']"
4492,1903.08589,Zhanchao Huang,"Zhanchao Huang, Jianlin Wang, Xuesong Fu, Tao Yu, Yongqi Guo, Rutong
  Wang","DC-SPP-YOLO: Dense Connection and Spatial Pyramid Pooling Based YOLO for
  Object Detection","23 pages, 9 figures, 9 tables",,10.1016/j.ins.2020.02.067,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although the YOLOv2 method is extremely fast on object detection, its
detection accuracy is restricted due to the low performance of its backbone
network and the underutilization of multi-scale region features. Therefore, a
dense connection (DC) and spatial pyramid pooling (SPP) based YOLO
(DC-SPP-YOLO) method for ameliorating the object detection accuracy of YOLOv2
is proposed in this paper. Specifically, the dense connection of convolution
layers is employed in the backbone network of YOLOv2 to strengthen the feature
extraction and alleviate the vanishing-gradient problem. Moreover, an improved
spatial pyramid pooling is introduced to pool and concatenate the multi-scale
region features, so that the network can learn the object features more
comprehensively. The DC-SPP-YOLO model is established and trained based on a
new loss function composed of MSE (mean square error) loss and cross-entropy
loss. The experimental results indicated that the mAP (mean Average Precision)
of DC-SPP-YOLO is higher than that of YOLOv2 on the PASCAL VOC datasets and the
UA-DETRAC datasets. The effectiveness of DC-SPP-YOLO method proposed is
demonstrated.
","[{'version': 'v1', 'created': 'Wed, 20 Mar 2019 16:19:20 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Sep 2022 07:11:47 GMT'}]",2022-09-07,"[['Huang', 'Zhanchao', ''], ['Wang', 'Jianlin', ''], ['Fu', 'Xuesong', ''], ['Yu', 'Tao', ''], ['Guo', 'Yongqi', ''], ['Wang', 'Rutong', '']]","['：Object detection', 'Convolutional neural network，YOLOv2，Dense connection', 'Spatial']"
4493,1112.4060,Bartlomiej Placzek,Bart{\l}omiej P{\l}aczek,A real time vehicles detection algorithm for vision based sensors,The final publication is available at http://www.springerlink.com,"P{\l}aczek B., A real time vehicles detection algorithm for vision
  based sensors, Lecture Notes in Computer Science 6375, Springer-Verlag,
  Berlin Heidelberg, 2010, pp. 211-218",10.1007/978-3-642-15907-7_26,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A vehicle detection plays an important role in the traffic control at
signalised intersections. This paper introduces a vision-based algorithm for
vehicles presence recognition in detection zones. The algorithm uses linguistic
variables to evaluate local attributes of an input image. The image attributes
are categorised as vehicle, background or unknown features. Experimental
results on complex traffic scenes show that the proposed algorithm is effective
for a real-time vehicles detection.
","[{'version': 'v1', 'created': 'Sat, 17 Dec 2011 14:50:50 GMT'}]",2011-12-20,"[['Płaczek', 'Bartłomiej', '']]","['vehicles detection', 'vision-based sensors', 'linguistic variables']"
4494,1501.05854,Antonio Rueda-Toicen,Wuilian Torres and Antonio Rueda-Toicen,Unsupervised Segmentation of Multispectral Images with Cellular Automata,"6 pages, 6 figures, conference: CIMENICS XII, 2014",,10.13140/2.1.2250.7849,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Multispectral images acquired by satellites are used to study phenomena on
the Earth's surface. Unsupervised classification techniques analyze
multispectral image content without considering prior knowledge of the observed
terrain; this is done using techniques which group pixels that have similar
statistics of digital level distribution in the various image channels. In this
paper, we propose a methodology for unsupervised classification based on a
deterministic cellular automaton. The automaton is initialized in an
unsupervised manner by setting seed cells, selected according to two criteria:
to be representative of the spatial distribution of the dominant elements in
the image, and to take into account the diversity of spectral signatures in the
image. The automaton's evolution is based on an attack rule that is applied
simultaneously to all its cells. Among the noteworthy advantages of
deterministic cellular automata for multispectral processing of satellite
imagery is the consideration of topological information in the image via seed
positioning, and the ability to modify the scale of the study.
","[{'version': 'v1', 'created': 'Fri, 23 Jan 2015 16:11:23 GMT'}]",2019-11-12,"[['Torres', 'Wuilian', ''], ['Rueda-Toicen', 'Antonio', '']]","['Cellular automata', 'Unsupervised segmentation', 'Object-oriented classification', 'Multispectral image']"
4495,1405.6684,Piotr Plonski,Piotr P{\l}o\'nski and Krzysztof Zaremba,Visualizing Random Forest with Self-Organising Map,,"Lecture Notes in Computer Science Volume 8468, 2014, pp 63-71",10.1007/978-3-319-07176-3_6,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Random Forest (RF) is a powerful ensemble method for classification and
regression tasks. It consists of decision trees set. Although, a single tree is
well interpretable for human, the ensemble of trees is a black-box model. The
popular technique to look inside the RF model is to visualize a RF proximity
matrix obtained on data samples with Multidimensional Scaling (MDS) method.
Herein, we present a novel method based on Self-Organising Maps (SOM) for
revealing intrinsic relationships in data that lay inside the RF used for
classification tasks. We propose an algorithm to learn the SOM with the
proximity matrix obtained from the RF. The visualization of RF proximity matrix
with MDS and SOM is compared. What is more, the SOM learned with the RF
proximity matrix has better classification accuracy in comparison to SOM
learned with Euclidean distance. Presented approach enables better
understanding of the RF and additionally improves accuracy of the SOM.
","[{'version': 'v1', 'created': 'Mon, 26 May 2014 19:00:15 GMT'}]",2014-07-17,"[['Płoński', 'Piotr', ''], ['Zaremba', 'Krzysztof', '']]","['Random Forest', 'Self-Organising Maps', 'visualization', 'classification', 'proximity matrix']"
4496,1807.04577,Ferdi Kara,"Ferdi Kara, Hakan Kaya","Derivation of the closed-form BER expressions for DL-NOMA over
  Nakagami-m fading channels","26.IEEE Signal Processing and Communications Applications
  Conference,Izmir,Turkey",,10.1109/SIU.2018.8404743,,cs.IT eess.SP math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  NOMA is as a strong candidate for the Future Radio Access Network (FRA) due
to its potential to support massive connectivity and high spectral efficiency.
However, the most important drawback of NOMA is the error during Successive
Interference Canceller (SIC) is implemented because of the inter-user
interferences. In this paper, we derive closed-form exact Bit-Error Rate
expressions for Downlink(DL) NOMA over Nakagami-m fading channels in the
presence of SIC errors. The derived expressions are validated by the computer
simulations. It is shown that the m parameter still represents the diversity
order like as OMA systems. Besides, the BER performances of users for NOMA have
substantially depended on the power allocation coefficient.
","[{'version': 'v1', 'created': 'Thu, 12 Jul 2018 12:40:03 GMT'}]",2018-07-13,"[['Kara', 'Ferdi', ''], ['Kaya', 'Hakan', '']]","['NOMA', 'BER', 'SIC errors']"
4497,1006.3375,Secretary Aircc Journal,"Santosh Kumar Singh(1), Krishna Chandra Roy(2) and Vibhakar
  Pathak(1),((1)Suresh Gyan Vihar University, India and (2)SBCET, India)","Channels Reallocation In Cognitive Radio Networks Based On DNA Sequence
  Alignment",12 pages,International Journal of Next-Generation Networks 2.2 (2010) 23-34,10.5121/ijngn.2010.2203,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Nowadays, It has been shown that spectrum scarcity increased due to
tremendous growth of new players in wireless base system by the evolution of
the radio communication. Resent survey found that there are many areas of the
radio spectrum that are occupied by authorized user/primary user (PU), which
are not fully utilized. Cognitive radios (CR) prove to next generation wireless
communication system that proposed as a way to reuse this under-utilised
spectrum in an opportunistic and non-interfering basis. A CR is a self-directed
entity in a wireless communications environment that senses its environment,
tracks changes, and reacts upon its findings and frequently exchanges
information with the networks for secondary user (SU). However, CR facing
collision problem with tracks changes i.e. reallocating of other empty channels
for SU while PU arrives. In this paper, channels reallocation technique based
on DNA sequence alignment algorithm for CR networks has been proposed.
","[{'version': 'v1', 'created': 'Thu, 17 Jun 2010 05:39:17 GMT'}]",2010-07-15,"[['Singh', 'Santosh Kumar', '', 'Suresh Gyan Vihar University, India and'], ['Roy', 'Krishna Chandra', '', 'SBCET, India'], ['Pathak', 'Vibhakar', '', 'Suresh Gyan Vihar University, India and']]","['Cognitive radio', 'Wireless Network', 'channels reallocation', 'DNA sequence alignment', 'Mat lab simulation']"
4498,1806.01579,Adam Gudy\'s,"Marek Sikora, {\L}ukasz Wr\'obel, Adam Gudy\'s","GuideR: a guided separate-and-conquer rule learning in classification,
  regression, and survival settings",,,10.1016/j.knosys.2019.02.019,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents GuideR, a user-guided rule induction algorithm, which
overcomes the largest limitation of the existing methods-the lack of the
possibility to introduce user's preferences or domain knowledge to the rule
learning process. Automatic selection of attributes and attribute ranges often
leads to the situation in which resulting rules do not contain interesting
information. We propose an induction algorithm which takes into account user's
requirements. Our method uses the sequential covering approach and is suitable
for classification, regression, and survival analysis problems. The
effectiveness of the algorithm in all these tasks has been verified
experimentally, confirming guided rule induction to be a powerful data analysis
tool.
","[{'version': 'v1', 'created': 'Tue, 5 Jun 2018 09:34:36 GMT'}]",2019-04-23,"[['Sikora', 'Marek', ''], ['Wróbel', 'Łukasz', ''], ['Gudyś', 'Adam', '']]","['Rule induction', 'User-guided rule induction', 'Semi-automatic rule']"
4499,1811.10052,Alexander Lundervold,Alexander Selvikv{\aa}g Lundervold and Arvid Lundervold,An overview of deep learning in medical imaging focusing on MRI,"Minor updates. Close to the version published in Zeitschrift f\""ur
  Medizinische Physik (Available online 13 December 2018)","Zeitschrift f\""ur Medizinische Physik, Volume 29, Issue 2, May
  2019",10.1016/j.zemedi.2018.11.002,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  What has happened in machine learning lately, and what does it mean for the
future of medical image analysis? Machine learning has witnessed a tremendous
amount of attention over the last few years. The current boom started around
2009 when so-called deep artificial neural networks began outperforming other
established models on a number of important benchmarks. Deep neural networks
are now the state-of-the-art machine learning models across a variety of areas,
from image analysis to natural language processing, and widely deployed in
academia and industry. These developments have a huge potential for medical
imaging technology, medical data analysis, medical diagnostics and healthcare
in general, slowly being realized. We provide a short overview of recent
advances and some associated challenges in machine learning applied to medical
image processing and image analysis. As this has become a very broad and fast
expanding field we will not survey the entire landscape of applications, but
put particular focus on deep learning in MRI.
  Our aim is threefold: (i) give a brief introduction to deep learning with
pointers to core references; (ii) indicate how deep learning has been applied
to the entire MRI processing chain, from acquisition to image retrieval, from
segmentation to disease prediction; (iii) provide a starting point for people
interested in experimenting and perhaps contributing to the field of machine
learning for medical imaging by pointing out good educational resources,
state-of-the-art open-source code, and interesting sources of data and problems
related medical imaging.
","[{'version': 'v1', 'created': 'Sun, 25 Nov 2018 16:40:42 GMT'}, {'version': 'v2', 'created': 'Sun, 16 Dec 2018 09:58:09 GMT'}]",2019-09-24,"[['Lundervold', 'Alexander Selvikvåg', ''], ['Lundervold', 'Arvid', '']]","['Machine learning', 'Deep learning', 'Medical imaging', 'MRI']"
4500,1910.01972,Karel Ad\'amek,"Karel Ad\'amek, Sofia Dimoudi, Mike Giles, Wesley Armour",GPU Fast Convolution via the Overlap-and-Save Method in Shared Memory,accepted to ACM TACO,"ACM Trans. Archit. Code Optim. 17, 3, Article 18 (September 2020)",10.1145/3394116,,cs.MS cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an implementation of the overlap-and-save method, a method for the
convolution of very long signals with short response functions, which is
tailored to GPUs. We have implemented several FFT algorithms (using the CUDA
programming language) which exploit GPU shared memory, allowing for GPU
accelerated convolution. We compare our implementation with an implementation
of the overlap-and-save algorithm utilizing the NVIDIA FFT library (cuFFT). We
demonstrate that by using a shared memory based FFT we can achieved significant
speed-ups for certain problem sizes and lower the memory requirements of the
overlap-and-save method on GPUs.
","[{'version': 'v1', 'created': 'Fri, 4 Oct 2019 14:41:10 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Apr 2020 15:04:13 GMT'}]",2022-11-08,"[['Adámek', 'Karel', ''], ['Dimoudi', 'Sofia', ''], ['Giles', 'Mike', ''], ['Armour', 'Wesley', '']]","['fast convolution', 'CUDA', 'GPU', 'overlap-and-save', 'FFT']"
4501,1405.5341,Alin Bostan,"Alin Bostan (INRIA Saclay - Ile de France), Xavier Caruso (IRMAR),
  \'Eric Schost","A fast algorithm for computing the characteristic polynomial of the
  p-curvature","ISSAC - 39th International Symposium on Symbolic and Algebraic
  Computation (2014)",,10.1145/2608628.2608650,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We discuss theoretical and algorithmic questions related to the $p$-curvature
of differential operators in characteristic $p$. Given such an operator $L$,
and denoting by $\Chi(L)$ the characteristic polynomial of its $p$-curvature,
we first prove a new, alternative, description of $\Chi(L)$. This description
turns out to be particularly well suited to the fast computation of $\Chi(L)$
when $p$ is large: based on it, we design a new algorithm for computing
$\Chi(L)$, whose cost with respect to $p$ is $\softO(p^{0.5})$ operations in
the ground field. This is remarkable since, prior to this work, the fastest
algorithms for this task, and even for the subtask of deciding nilpotency of
the $p$-curvature, had merely slightly subquadratic complexity
$\softO(p^{1.79})$.
","[{'version': 'v1', 'created': 'Wed, 21 May 2014 09:05:33 GMT'}]",2014-05-22,"[['Bostan', 'Alin', '', 'INRIA Saclay - Ile de France'], ['Caruso', 'Xavier', '', 'IRMAR'], ['Schost', 'Éric', '']]","['Algorithms', 'complexity', 'differential equations', 'p-curvature']"
4502,1903.12386,Bartosz Walter,"Zarko Stanisavljevic, Bartosz Walter, Maja Vukasovic, Andrijana
  Todosijevic, Maciej Labedzki, Marcin Wolski",G\'EANT Software Maturity Model,"4 pages, 1 figure. Submitted to TELFOR 2018 conference",,10.1109/TELFOR.2018.8611887,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  G\'EANT project is an example of a large organization with around 30 software
projects and around 20 software development teams. Software development teams
consist of many skilled associates coming from all members National Research
and Education Networks. Three main issues that are common for all these
software development teams and their members are: geographical distribution,
scattered manpower percentage, and parallel involvement in other high priority
projects in their native organizations. This paper presents a novel software
maturity model that is designed specifically for G\'EANT software development
teams and aims to address the described issues.
","[{'version': 'v1', 'created': 'Fri, 29 Mar 2019 08:15:05 GMT'}]",2020-09-04,"[['Stanisavljevic', 'Zarko', ''], ['Walter', 'Bartosz', ''], ['Vukasovic', 'Maja', ''], ['Todosijevic', 'Andrijana', ''], ['Labedzki', 'Maciej', ''], ['Wolski', 'Marcin', '']]","['CMMI', 'GÉANT', 'Software Development']"
4503,1005.0082,Pino Caballero-Gil,"P. Caballero-Gil, C. Hern\'andez-Goya and C. Bruno-Casta\~neda",A Rational Approach to Cryptographic Protocols,,"Mathematical and Computer Modelling. Volume 46, Issues 1-2, July
  2007, Pages 80-87.",10.1016/j.mcm.2006.12.013,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work initiates an analysis of several cryptographic protocols from a
rational point of view using a game-theoretical approach, which allows us to
represent not only the protocols but also possible misbehaviours of parties.
Concretely, several concepts of two-person games and of two-party cryptographic
protocols are here combined in order to model the latters as the formers. One
of the main advantages of analysing a cryptographic protocol in the game-theory
setting is the possibility of describing improved and stronger cryptographic
solutions because possible adversarial behaviours may be taken into account
directly. With those tools, protocols can be studied in a malicious model in
order to find equilibrium conditions that make possible to protect honest
parties against all possible strategies of adversaries.
","[{'version': 'v1', 'created': 'Sat, 1 May 2010 15:17:44 GMT'}]",2015-03-17,"[['Caballero-Gil', 'P.', ''], ['Hernández-Goya', 'C.', ''], ['Bruno-Castañeda', 'C.', '']]","['Cryptography', 'Game theory', 'Protocols verification']"
4504,1803.00064,Janusz Dybizba\'nski,"Janusz Dybizba\'nski, Andrzej Szepietowski",Hamiltonian cycles in hypercubes with faulty edges,,,10.1080/23799927.2018.1538164,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Szepietowski [A. Szepietowski, Hamiltonian cycles in hypercubes with $2n-4$
faulty edges, Information Sciences, 215 (2012) 75--82] observed that the
hypercube $Q_n$ is not Hamiltonian if it contains a trap disconnected halfway.
A proper subgraph $T$ is disconnected halfway if at least half of its nodes
have parity 0 (or 1, resp.) and the edges joining all nodes of parity 0 (or 1,
resp.) in $T$ with nodes outside $T$, are faulty. The simplest examples of such
traps are: (1) a vertex with $n-1$ incident faulty edges, or (2) a cycle
$(u,v,w,x)$, where all edges going out of the cycle from $u$ and $w$ are
faulty. In this paper we describe all traps disconnected halfway $T$ with the
size $|T|\le8$, and discuss the problem whether there exist small sets of
faulty edges which preclude Hamiltonian cycles and are not based on sets
disconnected halfway. We describe heuristic which detects sets of faulty edges
which preclude HC also those sets that are not based on subgraphs disconnected
halfway. We describe all $Q_4$ cubes that are not Hamiltonian, and all $Q_5$
cubes with 8 or 9 faulty edges that are not Hamiltonian.
","[{'version': 'v1', 'created': 'Wed, 28 Feb 2018 20:16:25 GMT'}]",2021-06-28,"[['Dybizbański', 'Janusz', ''], ['Szepietowski', 'Andrzej', '']]","['Hamiltonian cycle', 'hypercube', 'fault tolerance', 'local traps']"
4505,1608.02615,Adnan Mohammed,"Adnan Saher Mohammed, \c{S}ahin Emrah Amrahov, Fatih V. \c{C}elebi","Bidirectional Conditional Insertion Sort algorithm; An efficient
  progress on the classical insertion sort","references not appeared cause arxiv system does not uploaded .bib
  files",,10.1016/j.future.2017.01.034,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we proposed a new efficient sorting algorithm based on
insertion sort concept. The proposed algorithm called Bidirectional Conditional
Insertion Sort (BCIS). It is in-place sorting algorithm and it has remarkably
efficient average case time complexity when compared with classical insertion
sort (IS). By comparing our new proposed algorithm with the Quicksort
algorithm, BCIS indicated faster average case time for relatively small size
arrays up to 1500 elements. Furthermore, BCIS was observed to be faster than
Quicksort within high rate of duplicated elements even for large size array.
","[{'version': 'v1', 'created': 'Mon, 8 Aug 2016 20:36:53 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Aug 2016 22:55:47 GMT'}]",2017-08-08,"[['Mohammed', 'Adnan Saher', ''], ['Amrahov', 'Şahin Emrah', ''], ['Çelebi', 'Fatih V.', '']]","['insertion sort', 'sorting', 'Quicksort', 'bidirectional insertion sort']"
4506,1106.5992,Andr\'e Panisson,"Andr\'e Panisson, Alain Barrat, Ciro Cattuto, Wouter Van den Broeck,
  Giancarlo Ruffo, Rossano Schifanella",On the Dynamics of Human Proximity for Data Diffusion in Ad-Hoc Networks,"A. Panisson et al., On the dynamics of human proximity for data
  diffusion in ad-hoc networks, Ad Hoc Netw. (2011)","Ad Hoc Networks Volume 10, Issue 8, November 2012, Pages
  1532--1543",10.1016/j.adhoc.2011.06.003,,cs.NI cs.HC cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We report on a data-driven investigation aimed at understanding the dynamics
of message spreading in a real-world dynamical network of human proximity. We
use data collected by means of a proximity-sensing network of wearable sensors
that we deployed at three different social gatherings, simultaneously involving
several hundred individuals. We simulate a message spreading process over the
recorded proximity network, focusing on both the topological and the temporal
properties. We show that by using an appropriate technique to deal with the
temporal heterogeneity of proximity events, a universal statistical pattern
emerges for the delivery times of messages, robust across all the data sets.
Our results are useful to set constraints for generic processes of data
dissemination, as well as to validate established models of human mobility and
proximity that are frequently used to simulate realistic behaviors.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2011 16:24:36 GMT'}]",2012-08-09,"[['Panisson', 'André', ''], ['Barrat', 'Alain', ''], ['Cattuto', 'Ciro', ''], ['Broeck', 'Wouter Van den', ''], ['Ruffo', 'Giancarlo', ''], ['Schifanella', 'Rossano', '']]","['Mobile Networks', 'Opportunistic/Delay-Tolerant Protocols', 'DataDiffusion', 'RFID']"
4507,1612.01717,Haiping Huang,Haiping Huang,"Statistical mechanics of unsupervised feature learning in a restricted
  Boltzmann machine with binary synapses","24 pages, 9 figures, results added",J. Stat. Mech. (2017) 053302,10.1088/1742-5468/aa6ddc,,cs.LG cond-mat.dis-nn cond-mat.stat-mech cs.NE q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Revealing hidden features in unlabeled data is called unsupervised feature
learning, which plays an important role in pretraining a deep neural network.
Here we provide a statistical mechanics analysis of the unsupervised learning
in a restricted Boltzmann machine with binary synapses. A message passing
equation to infer the hidden feature is derived, and furthermore, variants of
this equation are analyzed. A statistical analysis by replica theory describes
the thermodynamic properties of the model. Our analysis confirms an entropy
crisis preceding the non-convergence of the message passing equation,
suggesting a discontinuous phase transition as a key characteristic of the
restricted Boltzmann machine. Continuous phase transition is also confirmed
depending on the embedded feature strength in the data. The mean-field result
under the replica symmetric assumption agrees with that obtained by running
message passing algorithms on single instances of finite sizes. Interestingly,
in an approximate Hopfield model, the entropy crisis is absent, and a
continuous phase transition is observed instead. We also develop an iterative
equation to infer the hyper-parameter (temperature) hidden in the data, which
in physics corresponds to iteratively imposing Nishimori condition. Our study
provides insights towards understanding the thermodynamic properties of the
restricted Boltzmann machine learning, and moreover important theoretical basis
to build simplified deep networks.
","[{'version': 'v1', 'created': 'Tue, 6 Dec 2016 09:17:14 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Mar 2017 04:47:07 GMT'}]",2017-05-16,"[['Huang', 'Haiping', '']]","['Neuronal networks', 'Cavity and replica method', 'Learning theory', 'Statistical inference']"
4508,1804.02903,Felix Pauck,"Felix Pauck, Eric Bodden, Heike Wehrheim",Do Android Taint Analysis Tools Keep Their Promises?,,,10.1145/3236024.3236029,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, researchers have developed a number of tools to conduct
taint analysis of Android applications. While all the respective papers aim at
providing a thorough empirical evaluation, comparability is hindered by varying
or unclear evaluation targets. Sometimes, the apps used for evaluation are not
precisely described. In other cases, authors use an established benchmark but
cover it only partially. In yet other cases, the evaluations differ in terms of
the data leaks searched for, or lack a ground truth to compare against. All
those limitations make it impossible to truly compare the tools based on those
published evaluations.
  We thus present ReproDroid, a framework allowing the accurate comparison of
Android taint analysis tools. ReproDroid supports researchers in inferring the
ground truth for data leaks in apps, in automatically applying tools to
benchmarks, and in evaluating the obtained results. We use ReproDroid to
comparatively evaluate on equal grounds the six prominent taint analysis tools
Amandroid, DIALDroid, DidFail, DroidSafe, FlowDroid and IccTA. The results are
largely positive although four tools violate some promises concerning features
and accuracy. Finally, we contribute to the area of unbiased benchmarking with
a new and improved version of the open test suite DroidBench.
","[{'version': 'v1', 'created': 'Mon, 9 Apr 2018 10:44:36 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Jul 2019 06:01:45 GMT'}]",2019-07-31,"[['Pauck', 'Felix', ''], ['Bodden', 'Eric', ''], ['Wehrheim', 'Heike', '']]","['Android Taint Analysis', 'Tools', 'Benchmarks', 'Empirical Studies', 'Reproducibility']"
4509,1404.4088,Sumaira Tasnim,"Akhlaqur Rahman, Sumaira Tasnim",Ensemble Classifiers and Their Applications: A Review,"Published with International Journal of Computer Trends and
  Technology (IJCTT)","International Journal of Computer Trends and Technology (IJCTT)
  10(1):31-35, April 2014",10.14445/22312803/IJCTT-V10P107,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ensemble classifier refers to a group of individual classifiers that are
cooperatively trained on data set in a supervised classification problem. In
this paper we present a review of commonly used ensemble classifiers in the
literature. Some ensemble classifiers are also developed targeting specific
applications. We also present some application driven ensemble classifiers in
this paper.
","[{'version': 'v1', 'created': 'Tue, 15 Apr 2014 21:35:48 GMT'}]",2014-04-17,"[['Rahman', 'Akhlaqur', ''], ['Tasnim', 'Sumaira', '']]","['Ensemble classifier', 'Multiple classifier systems', 'Mixture of experts']"
4510,2101.05684,Gustav Eje Henter,"Simon Alexanderson, \'Eva Sz\'ekely, Gustav Eje Henter, Taras
  Kucherenko, Jonas Beskow",Generating coherent spontaneous speech and gesture from text,"3 pages, 2 figures, published at the ACM International Conference on
  Intelligent Virtual Agents (IVA) 2020","Proceedings of the 20th ACM International Conference on
  Intelligent Virtual Agents (IVA '20), 2020, 3 pages",10.1145/3383652.3423874,,cs.LG cs.GR cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Embodied human communication encompasses both verbal (speech) and non-verbal
information (e.g., gesture and head movements). Recent advances in machine
learning have substantially improved the technologies for generating synthetic
versions of both of these types of data: On the speech side, text-to-speech
systems are now able to generate highly convincing, spontaneous-sounding speech
using unscripted speech audio as the source material. On the motion side,
probabilistic motion-generation methods can now synthesise vivid and lifelike
speech-driven 3D gesticulation. In this paper, we put these two
state-of-the-art technologies together in a coherent fashion for the first
time. Concretely, we demonstrate a proof-of-concept system trained on a
single-speaker audio and motion-capture dataset, that is able to generate both
speech and full-body gestures together from text input. In contrast to previous
approaches for joint speech-and-gesture generation, we generate full-body
gestures from speech synthesis trained on recordings of spontaneous speech from
the same person as the motion-capture data. We illustrate our results by
visualising gesture spaces and text-speech-gesture alignments, and through a
demonstration video at https://simonalexanderson.github.io/IVA2020 .
","[{'version': 'v1', 'created': 'Thu, 14 Jan 2021 16:02:21 GMT'}]",2021-01-15,"[['Alexanderson', 'Simon', ''], ['Székely', 'Éva', ''], ['Henter', 'Gustav Eje', ''], ['Kucherenko', 'Taras', ''], ['Beskow', 'Jonas', '']]","['Gesture synthesis', 'text-to-speech', 'neural networks']"
4511,1810.09025,"Isma\""el Kon\'e","Isma\""el Kon\'e and Lahsen Boulmane","Hierarchical ResNeXt Models for Breast Cancer Histology Image
  Classification",,"Image Analysis and Recognition. ICIAR 2018. LNCS, vol 10882.
  Springer, Cham",10.1007/978-3-319-93000-8_90,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Microscopic histology image analysis is a cornerstone in early detection of
breast cancer. However these images are very large and manual analysis is error
prone and very time consuming. Thus automating this process is in high demand.
We proposed a hierarchical system of convolutional neural networks (CNN) that
classifies automatically patches of these images into four pathologies: normal,
benign, in situ carcinoma and invasive carcinoma. We evaluated our system on
the BACH challenge dataset of image-wise classification and a small dataset
that we used to extend it. Using a train/test split of 75%/25%, we achieved an
accuracy rate of 0.99 on the test split for the BACH dataset and 0.96 on that
of the extension. On the test of the BACH challenge, we've reached an accuracy
of 0.81 which rank us to the 8th out of 51 teams.
","[{'version': 'v1', 'created': 'Sun, 21 Oct 2018 20:55:41 GMT'}]",2018-10-23,"[['Koné', 'Ismaël', ''], ['Boulmane', 'Lahsen', '']]","['CNN', 'ResNeXt', 'learning rate', 'histology images']"
4512,1912.05898,Haitong Zhang,"Haitong Zhang, Yongping Du, Jiaxin Sun, Qingxiao Li","Improving Interpretability of Word Embeddings by Generating Definition
  and Usage",,"Expert Systems with Applications, Volume 160, 1 December 2020,
  113633",10.1016/j.eswa.2020.113633,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Word embeddings are substantially successful in capturing semantic relations
among words. However, these lexical semantics are difficult to be interpreted.
Definition modeling provides a more intuitive way to evaluate embeddings by
utilizing them to generate natural language definitions of corresponding words.
This task is of great significance for practical application and in-depth
understanding of word representations. We propose a novel framework for
definition modeling, which can generate reasonable and understandable
context-dependent definitions. Moreover, we introduce usage modeling and study
whether it is possible to utilize embeddings to generate example sentences of
words. These ways are a more direct and explicit expression of embedding's
semantics for better interpretability. We extend the single task model to
multi-task setting and investigate several joint multi-task models to combine
usage modeling and definition modeling together. Experimental results on
existing Oxford dataset and a new collected Oxford-2019 dataset show that our
single-task model achieves the state-of-the-art result in definition modeling
and the multi-task learning methods are helpful for two tasks to improve the
performance.
","[{'version': 'v1', 'created': 'Thu, 12 Dec 2019 12:45:34 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Jul 2020 15:17:38 GMT'}]",2020-07-21,"[['Zhang', 'Haitong', ''], ['Du', 'Yongping', ''], ['Sun', 'Jiaxin', ''], ['Li', 'Qingxiao', '']]","['Word Embeddings Interpretability', 'Definition Modeling', 'Definition Generation', 'Usage Modeling', 'UsageGeneration']"
4513,1709.04403,Mehmet Emir Koksal,Mehmet Emir Koksal,"Explicit Commutativity Conditions for Second-order Linear Time-Varying
  Systems with Non-Zero Initial Conditions","20 PAGES, 7 F\.IGURES","Archives of Control Sciences, vol. 29, no. 3, pp. 413-432, 2019",10.24425/acs.2019.130204,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although the explicit commutativitiy conditions for second-order linear
time-varying systems have been appeared in some literature, these are all for
initially relaxed systems. This paper presents explicit necessary and
sufficient commutativity conditions for commutativity of second-order linear
time-varying systems with non-zero initial conditions. It has appeared
interesting that the second requirement for the commutativity of non-relaxed
systems plays an important role on the commutativity conditions when non-zero
initial conditions exist. Another highlight is that the commutativity of
switched systems is considered and spoiling of commutativity at the switching
instants is illustrated for the first time. The simulation results support the
theory developed in the paper.
","[{'version': 'v1', 'created': 'Wed, 13 Sep 2017 16:16:00 GMT'}]",2020-08-13,"[['Koksal', 'Mehmet Emir', '']]","['Commutativity', 'linear systems', 'analogue control', 'robust control', 'differential equations', 'non']"
4514,1207.4451,Sebastien Verel,"S\'ebastien Verel (INRIA Lille - Nord Europe), Arnaud Liefooghe (INRIA
  Lille - Nord Europe, LIFL), Clarisse Dhaenens (INRIA Lille - Nord Europe,
  LIFL)",Set-based Multiobjective Fitness Landscapes: A Preliminary Study,,"Genetic And Evolutionary Computation Conference, Dublin : Ireland
  (2011)",10.1145/2001576.2001681,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fitness landscape analysis aims to understand the geometry of a given
optimization problem in order to design more efficient search algorithms.
However, there is a very little knowledge on the landscape of multiobjective
problems. In this work, following a recent proposal by Zitzler et al. (2010),
we consider multiobjective optimization as a set problem. Then, we give a
general definition of set-based multiobjective fitness landscapes. An
experimental set-based fitness landscape analysis is conducted on the
multiobjective NK-landscapes with objective correlation. The aim is to adapt
and to enhance the comprehensive design of set-based multiobjective search
approaches, motivated by an a priori analysis of the corresponding set problem
properties.
","[{'version': 'v1', 'created': 'Wed, 18 Jul 2012 19:10:16 GMT'}]",2012-07-19,"[['Verel', 'Sébastien', '', 'INRIA Lille - Nord Europe'], ['Liefooghe', 'Arnaud', '', 'INRIA\n  Lille - Nord Europe, LIFL'], ['Dhaenens', 'Clarisse', '', 'INRIA Lille - Nord Europe,\n  LIFL']]","['Fitness landscapes', 'Multiobjective optimization', 'Set-basedmultiobjective search']"
4515,0903.5074,Namrata Vaswani,Namrata Vaswani,Analyzing Least Squares and Kalman Filtered Compressed Sensing,"Proc. IEEE Intl. Conf. Acous. Speech Sig. Proc. (ICASSP), 2009","Proc. IEEE Intl. Conf. Acous. Speech Sig. Proc. (ICASSP), 2009",10.1109/ICASSP.2009.4960258,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent work, we studied the problem of causally reconstructing time
sequences of spatially sparse signals, with unknown and slow time-varying
sparsity patterns, from a limited number of linear ""incoherent"" measurements.
We proposed a solution called Kalman Filtered Compressed Sensing (KF-CS). The
key idea is to run a reduced order KF only for the current signal's estimated
nonzero coefficients' set, while performing CS on the Kalman filtering error to
estimate new additions, if any, to the set. KF may be replaced by Least Squares
(LS) estimation and we call the resulting algorithm LS-CS. In this work, (a) we
bound the error in performing CS on the LS error and (b) we obtain the
conditions under which the KF-CS (or LS-CS) estimate converges to that of a
genie-aided KF (or LS), i.e. the KF (or LS) which knows the true nonzero sets.
","[{'version': 'v1', 'created': 'Sun, 29 Mar 2009 17:24:45 GMT'}]",2016-11-17,"[['Vaswani', 'Namrata', '']]","['compressed sensing', 'kalman filter', 'least squares']"
4516,1610.00651,Nicolas Loizou,Nicolas Loizou,Distributionally Robust Games with Risk-averse Players,"11 pages, 3 figures, Proceedings of 5th the International Conference
  on Operations Research and Enterprise Systems ({ICORES} 2016), Rome, Italy,
  February 23-25, 2016",,10.5220/0005753301860196,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new model of incomplete information games without private
information in which the players use a distributionally robust optimization
approach to cope with the payoff uncertainty. With some specific restrictions,
we show that our ""Distributionally Robust Game"" constitutes a true
generalization of three popular finite games. These are the Complete
Information Games, Bayesian Games and Robust Games. Subsequently, we prove that
the set of equilibria of an arbitrary distributionally robust game with
specified ambiguity set can be computed as the component-wise projection of the
solution set of a multi-linear system of equations and inequalities. For
special cases of such games we show equivalence to complete information finite
games (Nash Games) with the same number of players and same action spaces.
Thus, when our game falls within these special cases one can simply solve the
corresponding Nash Game. Finally, we demonstrate the applicability of our new
model of games and highlight its importance.
","[{'version': 'v1', 'created': 'Mon, 3 Oct 2016 17:59:09 GMT'}]",2016-10-04,"[['Loizou', 'Nicolas', '']]","['Game Theory', 'Equilibrium', 'Distributionally Robust Optimization', 'Conditional Value at Risk']"
4517,1608.07807,Chandrajit M,"Chandrajit M, Girisha R, Vasudev T and Ashok C B","Cast and Self Shadow Segmentation in Video Sequences using Interval
  based Eigen Value Representation",6 pages journal article,"International Journal of Computer Applications 142(4):27-32, May
  2016",10.5120/ijca2016909752,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tracking of motion objects in the surveillance videos is useful for the
monitoring and analysis. The performance of the surveillance system will
deteriorate when shadows are detected as moving objects. Therefore, shadow
detection and elimination usually benefits the next stages. To overcome this
issue, a method for detection and elimination of shadows is proposed. This
paper presents a method for segmenting moving objects in video sequences based
on determining the Euclidian distance between two pixels considering
neighborhood values in temporal domain. Further, a method that segments cast
and self shadows in video sequences by computing the Eigen values for the
neighborhood of each pixel is proposed. The dual-map for cast and self shadow
pixels is represented based on the interval of Eigen values. The proposed
methods are tested on the benchmark IEEE CHANGE DETECTION 2014 dataset.
","[{'version': 'v1', 'created': 'Sun, 28 Aug 2016 13:07:16 GMT'}]",2016-08-30,"[['M', 'Chandrajit', ''], ['R', 'Girisha', ''], ['T', 'Vasudev', ''], ['B', 'Ashok C', '']]","['Motion segmentation', 'Eigen values', 'Shadow detection', 'Shadow segmentation', 'Self shadow', 'Cast shadow']"
4518,2001.01999,Ruslan Nikolaev,"Ruslan Nikolaev, Binoy Ravindran",Universal Wait-Free Memory Reclamation,,"25th ACM SIGPLAN Annual Symposium on Principles and Practice of
  Parallel Programming (PPoPP 2020)",10.1145/3332466.3374540,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a universal memory reclamation scheme, Wait-Free
Eras (WFE), for deleted memory blocks in wait-free concurrent data structures.
WFE's key innovation is that it is completely wait-free. Although some prior
techniques provide similar guarantees for certain data structures, they lack
support for arbitrary wait-free data structures. Consequently, developers are
typically forced to marry their wait-free data structures with lock-free Hazard
Pointers or (potentially blocking) epoch-based memory reclamation. Since both
these schemes provide weaker progress guarantees, they essentially forfeit the
strong progress guarantee of wait-free data structures. Though making the
original Hazard Pointers scheme or epoch-based reclamation completely wait-free
seems infeasible, we achieved this goal with a more recent, (lock-free) Hazard
Eras scheme, which we extend to guarantee wait-freedom. As this extension is
non-trivial, we discuss all challenges pertaining to the construction of
universal wait-free memory reclamation.
  WFE is implementable on ubiquitous x86_64 and AArch64 (ARM) architectures.
Its API is mostly compatible with Hazard Pointers, which allows easy
transitioning of existing data structures into WFE. Our experimental
evaluations show that WFE's performance is close to epoch-based reclamation and
almost matches the original Hazard Eras scheme, while providing the stronger
wait-free progress guarantee.
","[{'version': 'v1', 'created': 'Tue, 7 Jan 2020 12:23:23 GMT'}, {'version': 'v2', 'created': 'Sun, 12 Jan 2020 02:54:02 GMT'}]",2020-01-14,"[['Nikolaev', 'Ruslan', ''], ['Ravindran', 'Binoy', '']]","['wait-free', 'non-blocking', 'memory reclamation', 'hazard pointers', 'hazard eras']"
4519,1709.03270,Thomas Guyet,"Ahmed Samet (UR1, LACODAM), Thomas Guyet (LACODAM), Benjamin
  Negrevergne (LAMSADE), Tien-Tuan Dao, Tuan Nha Hoang, Marie-Christine Ho Ba
  Tho",Expert Opinion Extraction from a Biomedical Database,,"Conference on Symbolic and Quantitative Approaches to Reasoning
  with Uncertainty (ECSQARU), Jul 2017, Lugano, Switzerland. Springer, 31 (LNCS
  10369), pp.1 - 12, 2017, Proceedings of 14th European Conference on Symbolic
  and Quantitative Approaches to Reasoning with Uncertainty",10.1016/S0888-613X(02)00066-X,,cs.AI cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we tackle the problem of extracting frequent opinions from
uncertain databases. We introduce the foundation of an opinion mining approach
with the definition of pattern and support measure. The support measure is
derived from the commitment definition. A new algorithm called OpMiner that
extracts the set of frequent opinions modelled as a mass functions is detailed.
Finally, we apply our approach on a real-world biomedical database that stores
opinions of experts to evaluate the reliability level of biomedical data.
Performance analysis showed a better quality patterns for our proposed model in
comparison with literature-based methods.
","[{'version': 'v1', 'created': 'Mon, 11 Sep 2017 07:23:00 GMT'}]",2017-09-12,"[['Samet', 'Ahmed', '', 'UR1, LACODAM'], ['Guyet', 'Thomas', '', 'LACODAM'], ['Negrevergne', 'Benjamin', '', 'LAMSADE'], ['Dao', 'Tien-Tuan', ''], ['Hoang', 'Tuan Nha', ''], ['Tho', 'Marie-Christine Ho Ba', '']]","['Uncertain database', 'Data mining', 'Opinion', 'OpMiner']"
4520,1812.02855,Gang Luo,"Xueqiang Zeng, Gang Luo","Progressive Sampling-Based Bayesian Optimization for Efficient and
  Automatic Machine Learning Model Selection",,"Xueqiang Zeng, Gang Luo. Progressive Sampling-Based Bayesian
  Optimization for Efficient and Automatic Machine Learning Model Selection.
  Health Information Science and Systems, Vol. 5, No. 1, Article 2, Sep. 2017",10.1007/s13755-017-0023-z,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose: Machine learning is broadly used for clinical data analysis. Before
training a model, a machine learning algorithm must be selected. Also, the
values of one or more model parameters termed hyper-parameters must be set.
Selecting algorithms and hyper-parameter values requires advanced machine
learning knowledge and many labor-intensive manual iterations. To lower the bar
to machine learning, miscellaneous automatic selection methods for algorithms
and/or hyper-parameter values have been proposed. Existing automatic selection
methods are inefficient on large data sets. This poses a challenge for using
machine learning in the clinical big data era. Methods: To address the
challenge, this paper presents progressive sampling-based Bayesian
optimization, an efficient and automatic selection method for both algorithms
and hyper-parameter values. Results: We report an implementation of the method.
We show that compared to a state of the art automatic selection method, our
method can significantly reduce search time, classification error rate, and
standard deviation of error rate due to randomization. Conclusions: This is
major progress towards enabling fast turnaround in identifying high-quality
solutions required by many machine learning-based clinical data analysis tasks.
","[{'version': 'v1', 'created': 'Thu, 6 Dec 2018 23:46:15 GMT'}]",2018-12-10,"[['Zeng', 'Xueqiang', ''], ['Luo', 'Gang', '']]","['Automatic machine learning model selection', 'Bayesian optimization', 'progressive sampling', 'clinical big data']"
4521,0707.3575,Philipp Mayr,"Philipp Mayr, Anne-Kathrin Walter",An exploratory study of Google Scholar,"16 pages, 4 figures",,10.1108/14684520710841784,,cs.DL cs.IR,,"  The paper discusses and analyzes the scientific search service Google Scholar
(GS). The focus is on an exploratory study which investigates the coverage of
scientific serials in GS. The study shows deficiencies in the coverage and
up-to-dateness of the GS index. Furthermore, the study points up which Web
servers are the most important data providers for this search service and which
information sources are highly represented. We can show that there is a
relatively large gap in Google Scholars coverage of German literature as well
as weaknesses in the accessibility of Open Access content.
  Keywords: Search engines, Digital libraries, Worldwide Web, Serials,
Electronic journals
","[{'version': 'v1', 'created': 'Tue, 24 Jul 2007 19:19:36 GMT'}]",2019-01-15,"[['Mayr', 'Philipp', ''], ['Walter', 'Anne-Kathrin', '']]","['Search engines', 'Digital libraries', 'Worldwide Web', 'Serials', 'Electronic journals  Paper type – Research paper']"
4522,1903.04092,Osman Tursun,"Osman Tursun, Rui Zeng, Simon Denman, Sabesan Sivapalan, Sridha
  Sridharan, Clinton Fookes",MTRNet: A Generic Scene Text Eraser,Presented at ICDAR2019 Conference,,10.1109/ICDAR.2019.00016,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Text removal algorithms have been proposed for uni-lingual scripts with
regular shapes and layouts. However, to the best of our knowledge, a generic
text removal method which is able to remove all or user-specified text regions
regardless of font, script, language or shape is not available. Developing such
a generic text eraser for real scenes is a challenging task, since it inherits
all the challenges of multi-lingual and curved text detection and inpainting.
To fill this gap, we propose a mask-based text removal network (MTRNet). MTRNet
is a conditional adversarial generative network (cGAN) with an auxiliary mask.
The introduced auxiliary mask not only makes the cGAN a generic text eraser,
but also enables stable training and early convergence on a challenging
large-scale synthetic dataset, initially proposed for text detection in real
scenes. What's more, MTRNet achieves state-of-the-art results on several
real-world datasets including ICDAR 2013, ICDAR 2017 MLT, and CTW1500, without
being explicitly trained on this data, outperforming previous state-of-the-art
methods trained directly on these datasets.
","[{'version': 'v1', 'created': 'Mon, 11 Mar 2019 01:03:43 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Mar 2019 02:02:50 GMT'}, {'version': 'v3', 'created': 'Tue, 22 Oct 2019 06:24:29 GMT'}]",2020-02-11,"[['Tursun', 'Osman', ''], ['Zeng', 'Rui', ''], ['Denman', 'Simon', ''], ['Sivapalan', 'Sabesan', ''], ['Sridharan', 'Sridha', ''], ['Fookes', 'Clinton', '']]","['Text Removal', 'Inpainting', 'Image Translation', 'Mask']"
4523,1610.08262,Matija Pi\v{s}korec,"Matija Pi\v{s}korec, Nino Antulov-Fantulin, Iva Miholi\'c, Tomislav
  \v{S}muc, Mile \v{S}iki\'c",Modeling peer and external influence in online social networks,,,10.1007/978-3-319-72150-7_82,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Opinion polls mediated through a social network can give us, in addition to
usual demographics data like age, gender and geographic location, a friendship
structure between voters and the temporal dynamics of their activity during the
voting process. Using a Facebook application we collected friendship
relationships, demographics and votes of over ten thousand users on the
referendum on the definition of marriage in Croatia held on 1st of December
2013. We also collected data on online news articles mentioning our
application. Publication of these articles align closely with large peaks of
voting activity, indicating that these external events have a crucial influence
in engaging the voters. Also, existence of strongly connected friendship
communities where majority of users vote during short time period, and the fact
that majority of users in general tend to friend users that voted the same
suggest that peer influence also has its role in engaging the voters. As we are
not able to track activity of our users at all times, and we do not know their
motivations for expressing their votes through our application, the question is
whether we can infer peer and external influence using friendship network of
users and the times of their voting. We propose a new method for estimation of
magnitude of peer and external influence in friendship network and demonstrate
its validity on both simulated and actual data.
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2016 10:03:07 GMT'}]",2018-11-28,"[['Piškorec', 'Matija', ''], ['Antulov-Fantulin', 'Nino', ''], ['Miholić', 'Iva', ''], ['Šmuc', 'Tomislav', ''], ['Šikić', 'Mile', '']]","['temporal networks', 'social networks', 'peer and external influence in networks', 'information spreading in networks']"
4524,2106.14657,Andrea Fronzetti Colladon PhD,"A. Fronzetti Colladon, F. Grippa, L. Segneri","A new system for evaluating brand importance: A use case from the
  fashion industry",,"13th ACM Web Science Conference 2021 (WebSci '21 Companion) (pp.
  132-136). ACM, New York, NY, USA (2021)",10.1145/3462741.3466678,,cs.IR cs.CL cs.SI physics.soc-ph,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Today brand managers and marketing specialists can leverage huge amount of
data to reveal patterns and trends in consumer perceptions, monitoring positive
or negative associations of brands with respect to desired topics. In this
study, we apply the Semantic Brand Score (SBS) indicator to assess brand
importance in the fashion industry. To this purpose, we measure and visualize
text data using the SBS Business Intelligence App (SBS BI), which relies on
methods and tools of text mining and social network analysis. We collected and
analyzed about 206,000 tweets that mentioned the fashion brands Fendi, Gucci
and Prada, during the period from March 5 to March 12, 2021. From the analysis
of the three SBS dimensions - prevalence, diversity and connectivity - we found
that Gucci dominated the discourse, with high values of SBS. We use this case
study as an example to present a new system for evaluating brand importance and
image, through the analysis of (big) textual data.
","[{'version': 'v1', 'created': 'Thu, 24 Jun 2021 09:04:26 GMT'}]",2021-06-29,"[['Colladon', 'A. Fronzetti', ''], ['Grippa', 'F.', ''], ['Segneri', 'L.', '']]","['Semantic Indicators', 'NLP', 'Semantic Brand Score', 'Business Intelligence']"
4525,1808.02097,Brian Freno,Brian A. Freno and Kevin T. Carlberg,"Machine-learning error models for approximate solutions to parameterized
  systems of nonlinear equations",,"Computer Methods in Applied Mechanics and Engineering 348 (2019)
  250--296",10.1016/j.cma.2019.01.024,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work proposes a machine-learning framework for constructing statistical
models of errors incurred by approximate solutions to parameterized systems of
nonlinear equations. These approximate solutions may arise from early
termination of an iterative method, a lower-fidelity model, or a
projection-based reduced-order model, for example. The proposed statistical
model comprises the sum of a deterministic regression-function model and a
stochastic noise model. The method constructs the regression-function model by
applying regression techniques from machine learning (e.g., support vector
regression, artificial neural networks) to map features (i.e., error indicators
such as sampled elements of the residual) to a prediction of the
approximate-solution error. The method constructs the noise model as a
mean-zero Gaussian random variable whose variance is computed as the sample
variance of the approximate-solution error on a test set; this variance can be
interpreted as the epistemic uncertainty introduced by the approximate
solution. This work considers a wide range of feature-engineering methods,
data-set-construction techniques, and regression techniques that aim to ensure
that (1) the features are cheaply computable, (2) the noise model exhibits low
variance (i.e., low epistemic uncertainty introduced), and (3) the regression
model generalizes to independent test data. Numerical experiments performed on
several computational-mechanics problems and types of approximate solutions
demonstrate the ability of the method to generate statistical models of the
error that satisfy these criteria and significantly outperform more commonly
adopted approaches for error modeling.
","[{'version': 'v1', 'created': 'Mon, 6 Aug 2018 20:17:20 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Nov 2018 00:39:43 GMT'}, {'version': 'v3', 'created': 'Tue, 5 Feb 2019 19:05:51 GMT'}]",2019-02-18,"[['Freno', 'Brian A.', ''], ['Carlberg', 'Kevin T.', '']]","['error modeling', 'supervised machine learning', 'high-dimensional regression', 'parameterized nonlinearequations', 'model reduction', 'ROMES method']"
4526,1003.3325,Secretary Aircc Journal,"K. Abdelkader (1), J. Broeckhove (1) and K. Vanmechelen (1) ((1)
  University of Antwerp, Belgium)","Resource Pricing In A Dynamic Multi-Commodity Market For Computational
  Resources","14 Pages, IJCNC Journal","International Journal of Computer Networks & Communications 2.2
  (2010) 74-87",10.5121/ijcnc.2010.2205,,cs.GT cs.DC cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The adoption of market-based principles in resource management systems for
computational infrastructures such as grids and clusters allows for matching
demand and supply for resources in a utility maximizing manner. As such, they
offer a promise of producing more efficient resource allocations, compared to
traditional system-centric approaches that do not allow consumers and providers
to express their valuations for computational resources. In this paper, we
investigate the pricing of resources in grids through the use of a
computational commodity market of CPU resources, where resource prices are
determined through the computation of a supply-and-demand equilibrium. In
particular, we introduce several categories of CPUs characterized by their
execution speed. These differ in cost and performance but may be used
interchangeably in executing jobs and thus represent so-called substitutable
resources. We investigate the performance of the algorithms for computing the
supply-and-demand equilibrium in this multi-commodity setting under dynamically
varying consumer and provider populations.
","[{'version': 'v1', 'created': 'Wed, 17 Mar 2010 08:48:43 GMT'}]",2019-08-14,"[['Abdelkader', 'K.', ''], ['Broeckhove', 'J.', ''], ['Vanmechelen', 'K.', '']]","['Commodity Market', 'Spot Market; Dynamic Grids', 'Grid Economics', 'Resource Management', 'Scheduling', 'Substitutable Resources']"
4527,1008.3829,Ilan Nehama,Ilan Nehama,Approximate Judgement Aggregation,,,10.1007/s10472-013-9358-6,,cs.GT cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we analyze judgement aggregation problems in which a group of
agents independently votes on a set of complex propositions that has some
interdependency constraint between them(e.g., transitivity when describing
preferences). We consider the issue of judgement aggregation from the
perspective of approximation. That is, we generalize the previous results by
studying approximate judgement aggregation. We relax the main two constraints
assumed in the current literature, Consistency and Independence and consider
mechanisms that only approximately satisfy these constraints, that is, satisfy
them up to a small portion of the inputs. The main question we raise is whether
the relaxation of these notions significantly alters the class of satisfying
aggregation mechanisms. The recent works for preference aggregation of Kalai,
Mossel, and Keller fit into this framework. The main result of this paper is
that, as in the case of preference aggregation, in the case of a subclass of a
natural class of aggregation problems termed `truth-functional agendas', the
set of satisfying aggregation mechanisms does not extend non-trivially when
relaxing the constraints. Our proof techniques involve Boolean Fourier
transform and analysis of voter influences for voting protocols. The question
we raise for Approximate Aggregation can be stated in terms of Property
Testing. For instance, as a corollary from our result we get a generalization
of the classic result for property testing of linearity of Boolean functions.
  An updated version (RePEc:huj:dispap:dp574R) is available at
http://www.ratio.huji.ac.il/dp_files/dp574R.pdf
","[{'version': 'v1', 'created': 'Mon, 23 Aug 2010 14:26:46 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Apr 2011 12:34:24 GMT'}, {'version': 'v3', 'created': 'Tue, 22 Nov 2011 20:58:26 GMT'}]",2013-06-20,"[['Nehama', 'Ilan', '']]","['approximate aggregation', 'discursive dilemma', 'truth-functional agendas', 'inconsistency index', 'dependency index', 'computational social choice']"
4528,1511.04052,Cornelia Haisjackl,"Jan Claes, Irene Vanderfeesten, Hajo A. Reijers, Jakob Pinggera,
  Matthias Weidlich, Stefan Zugal, Dirk Fahland, Barbara Weber, Jan Mendling,
  Geert Poels","Tying Process Model Quality to the Modeling Process: The Impact of
  Structuring, Movement, and Speed",,,10.1007/978-3-642-32885-5_3,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In an investigation into the process of process modeling, we examined how
modeling behavior relates to the quality of the process model that emerges from
that. Specifically, we considered whether (i) a modeler's structured modeling
style, (ii) the frequency of moving existing objects over the modeling canvas,
and (iii) the overall modeling speed is in any way connected to the ease with
which the resulting process model can be understood. In this paper, we describe
the exploratory study to build these three conjectures, clarify the
experimental set-up and infrastructure that was used to collect data, and
explain the used metrics for the various concepts to test the conjectures
empirically. We discuss various implications for research and practice from the
conjectures, all of which were confirmed by the experiment.
","[{'version': 'v1', 'created': 'Wed, 11 Nov 2015 17:47:52 GMT'}]",2015-11-13,"[['Claes', 'Jan', ''], ['Vanderfeesten', 'Irene', ''], ['Reijers', 'Hajo A.', ''], ['Pinggera', 'Jakob', ''], ['Weidlich', 'Matthias', ''], ['Zugal', 'Stefan', ''], ['Fahland', 'Dirk', ''], ['Weber', 'Barbara', ''], ['Mendling', 'Jan', ''], ['Poels', 'Geert', '']]","['business process modeling', 'process model quality', 'empirical research', 'modeling process']"
4529,1204.1413,Harmunish Taneja,"Pushpa R. Suri, Harmunish Taneja","An integrated ranking algorithm for efficient information computing in
  social networks","14 pages, International Journal on Web Service Computing (IJWSC),
  Vol.3, No.1, March 2012",,10.5121/ijwsc.2012.3103,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social networks have ensured the expanding disproportion between the face of
WWW stored traditionally in search engine repositories and the actual ever
changing face of Web. Exponential growth of web users and the ease with which
they can upload contents on web highlights the need of content controls on
material published on the web. As definition of search is changing,
socially-enhanced interactive search methodologies are the need of the hour.
Ranking is pivotal for efficient web search as the search performance mainly
depends upon the ranking results. In this paper new integrated ranking model
based on fused rank of web object based on popularity factor earned over only
valid interlinks from multiple social forums is proposed. This model identifies
relationships between web objects in separate social networks based on the
object inheritance graph. Experimental study indicates the effectiveness of
proposed Fusion based ranking algorithm in terms of better search results.
","[{'version': 'v1', 'created': 'Fri, 6 Apr 2012 05:57:07 GMT'}]",2012-04-09,"[['Suri', 'Pushpa R.', ''], ['Taneja', 'Harmunish', '']]","['Web objects', 'Ranking', 'Fusion Based Rank (FBR)', 'Linked Object Web Ranking', 'Social Networks', 'Music search']"
4530,1107.2757,Neri Merhav,Neri Merhav,Subset sum phase transitions and data compression,"14 pages, submitted to the Journal of Statistical Mechanics: Theory
  and Experiment",,10.1088/1742-5468/2011/09/P09017,,cs.IT cond-mat.stat-mech math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a rigorous analysis approach for the subset sum problem in the
context of lossless data compression, where the phase transition of the subset
sum problem is directly related to the passage between ambiguous and
non-ambiguous decompression, for a compression scheme that is based on
specifying the sequence composition. The proposed analysis lends itself to
straightforward extensions in several directions of interest, including
non-binary alphabets, incorporation of side information at the decoder
(Slepian-Wolf coding), and coding schemes based on multiple subset sums. It is
also demonstrated that the proposed technique can be used to analyze the
critical behavior in a more involved situation where the sequence composition
is not specified by the encoder.
","[{'version': 'v1', 'created': 'Thu, 14 Jul 2011 09:01:01 GMT'}]",2015-05-28,"[['Merhav', 'Neri', '']]","['Numberpartitioning', 'integerpartitioning', 'subsetsum', 'datacompression', 'source coding', 'entropy', 'phase transitions']"
4531,1309.2371,Arpna Shrivastava,"Arpna Shrivastava, R.C. Jain","Performance analysis of modified algorithm for finding multilevel
  association rules",,"Computer Science & Engineering: An International Journal (CSEIJ),
  Vol. 3, No. 4, August 2013",10.5121/cseij.2013.3401,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multilevel association rules explore the concept hierarchy at multiple levels
which provides more specific information. Apriori algorithm explores the single
level association rules. Many implementations are available of Apriori
algorithm. Fast Apriori implementation is modified to develop new algorithm for
finding multilevel association rules. In this study the performance of this new
algorithm is analyzed in terms of running time in seconds.
","[{'version': 'v1', 'created': 'Tue, 10 Sep 2013 04:52:58 GMT'}]",2013-09-11,"[['Shrivastava', 'Arpna', ''], ['Jain', 'R. C.', '']]","['Time complexity', 'multiple-level association rule', 'fast Apriori implementation', 'minimum support', 'minimumconfidence', 'data coding', 'data cleaning']"
4532,2106.10616,Stephen MacDonell,Sherlock A. Licorish and Stephen G. MacDonell,"The True Role of Active Communicators: An Empirical Study of Jazz Core
  Developers","Conference paper, 14 pages, 2 figures, 7 tables. arXiv admin note:
  text overlap with arXiv:2102.06317","Proceedings of the 17th International Conference on Evaluation and
  Assessment in Software Engineering (EASE2013). Porto de Galinhas, Brazil, ACM
  Press, pp.228-239",10.1145/2460999.2461034,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Interest in software engineering (SE) methodologies and tools has
been complemented in recent years by research efforts oriented towards
understanding the human processes involved in software development. This shift
has been imperative given reports of inadequately performing teams and the
consequent growing emphasis on individuals and team relations in contemporary
SE methods. Objective: While software repositories have frequently been studied
with a view to explaining such human processes, research has tended to use
primarily quantitative analysis approaches. There is concern, however, that
such approaches can provide only a partial picture of the software process.
Given the way human behavior is nuanced within psychological and social
contexts, it has been asserted that a full understanding may only be achieved
through deeper contextual enquiries. Method: We have followed such an approach
and have applied data mining, SNA, psycholinguistic analysis and directed
content analysis (CA) to study the way core developers at IBM Rational Jazz
contribute their social and intellectual capital, and have compared the
attitudes, interactions and activities of these members to those of their less
active counterparts. Results: Among our results, we uncovered that Jazz's core
developers worked across multiple roles, and were crucial to their teams'
organizational, intra-personal and inter-personal processes. Additionally,
although these individuals were highly task- and achievement-focused, they were
also largely responsible for maintaining positive team atmosphere, and for
providing context awareness in support of their colleagues. Conclusion: Our
results suggest that high-performing distributed agile teams rely on both
individual and collective efforts, as well as organizational environments that
promote informal and organic work structures.(Abridged)
","[{'version': 'v1', 'created': 'Sun, 20 Jun 2021 04:27:19 GMT'}]",2021-06-22,"[['Licorish', 'Sherlock A.', ''], ['MacDonell', 'Stephen G.', '']]","['Software Development', 'Core Developers', 'Roles', 'Psycholinguistics', 'Content Analysis', 'Behaviors', 'Jazz']"
4533,1803.02205,Vasiliki Efstathiou,Vasiliki Efstathiou and Diomidis Spinellis,Code Review Comments: Language Matters,,,10.1145/3183399.3183411,,cs.SE cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent research provides evidence that effective communication in
collaborative software development has significant impact on the software
development lifecycle. Although related qualitative and quantitative studies
point out textual characteristics of well-formed messages, the underlying
semantics of the intertwined linguistic structures still remain largely
misinterpreted or ignored. Especially, regarding quality of code reviews the
importance of thorough feedback, and explicit rationale is often mentioned but
rarely linked with related linguistic features. As a first step towards
addressing this shortcoming, we propose grounding these studies on theories of
linguistics. We particularly focus on linguistic structures of coherent speech
and explain how they can be exploited in practice. We reflect on related
approaches and examine through a preliminary study on four open source
projects, possible links between existing findings and the directions we
suggest for detecting textual features of useful code reviews.
","[{'version': 'v1', 'created': 'Tue, 6 Mar 2018 14:21:15 GMT'}]",2018-03-07,"[['Efstathiou', 'Vasiliki', ''], ['Spinellis', 'Diomidis', '']]","['Collaborative Software Development', 'Code Review', 'Natural Language Processing', 'Lexical Semantics']"
4534,1711.01377,Devin Guillory,Kamelia Aryafar and Devin Guillory and Liangjie Hong,"An Ensemble-based Approach to Click-Through Rate Prediction for Promoted
  Listings at Etsy",,,10.1145/3124749.3124758,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Etsy is a global marketplace where people across the world connect to make,
buy and sell unique goods. Sellers at Etsy can promote their product listings
via advertising campaigns similar to traditional sponsored search ads.
Click-Through Rate (CTR) prediction is an integral part of online search
advertising systems where it is utilized as an input to auctions which
determine the final ranking of promoted listings to a particular user for each
query. In this paper, we provide a holistic view of Etsy's promoted listings'
CTR prediction system and propose an ensemble learning approach which is based
on historical or behavioral signals for older listings as well as content-based
features for new listings. We obtain representations from texts and images by
utilizing state-of-the-art deep learning techniques and employ multimodal
learning to combine these different signals. We compare the system to
non-trivial baselines on a large-scale real world dataset from Etsy,
demonstrating the effectiveness of the model and strong correlations between
offline experiments and online performance. The paper is also the first
technical overview to this kind of product in e-commerce context.
","[{'version': 'v1', 'created': 'Sat, 4 Nov 2017 01:21:53 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Nov 2017 19:42:30 GMT'}]",2017-11-23,"[['Aryafar', 'Kamelia', ''], ['Guillory', 'Devin', ''], ['Hong', 'Liangjie', '']]","['Click-Through Rate Prediction', 'Logistic Regression', 'MultimodalLearning', 'Deep Learning']"
4535,1501.02243,Bernhard von Stengel,"Rahul Savani, Bernhard von Stengel",Unit Vector Games,final version as published in IJET,"International Journal of Economic Theory 12 (2016), 7-27",10.1111/ijet.12077,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  McLennan and Tourky (2010) showed that ""imitation games"" provide a new view
of the computation of Nash equilibria of bimatrix games with the Lemke-Howson
algorithm. In an imitation game, the payoff matrix of one of the players is the
identity matrix. We study the more general ""unit vector games"", which are
already known, where the payoff matrix of one player is composed of unit
vectors. Our main application is a simplification of the construction by Savani
and von Stengel (2006) of bimatrix games where two basic equilibrium-finding
algorithms take exponentially many steps: the Lemke-Howson algorithm, and
support enumeration.
","[{'version': 'v1', 'created': 'Fri, 9 Jan 2015 19:43:04 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Jul 2015 11:58:13 GMT'}, {'version': 'v3', 'created': 'Sun, 14 Feb 2016 23:04:37 GMT'}]",2016-02-16,"[['Savani', 'Rahul', ''], ['von Stengel', 'Bernhard', '']]","['bimatrix game', 'Nash equilibrium computation', 'imitation game', 'Lemke–Howson algorithm', 'unit vector game']"
4536,1601.07661,Bolun Cai,"Bolun Cai, Xiangmin Xu, Kui Jia, Chunmei Qing and Dacheng Tao",DehazeNet: An End-to-End System for Single Image Haze Removal,,,10.1109/TIP.2016.2598681,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Single image haze removal is a challenging ill-posed problem. Existing
methods use various constraints/priors to get plausible dehazing solutions. The
key to achieve haze removal is to estimate a medium transmission map for an
input hazy image. In this paper, we propose a trainable end-to-end system
called DehazeNet, for medium transmission estimation. DehazeNet takes a hazy
image as input, and outputs its medium transmission map that is subsequently
used to recover a haze-free image via atmospheric scattering model. DehazeNet
adopts Convolutional Neural Networks (CNN) based deep architecture, whose
layers are specially designed to embody the established assumptions/priors in
image dehazing. Specifically, layers of Maxout units are used for feature
extraction, which can generate almost all haze-relevant features. We also
propose a novel nonlinear activation function in DehazeNet, called Bilateral
Rectified Linear Unit (BReLU), which is able to improve the quality of
recovered haze-free image. We establish connections between components of the
proposed DehazeNet and those used in existing methods. Experiments on benchmark
images show that DehazeNet achieves superior performance over existing methods,
yet keeps efficient and easy to use.
","[{'version': 'v1', 'created': 'Thu, 28 Jan 2016 06:32:22 GMT'}, {'version': 'v2', 'created': 'Tue, 17 May 2016 08:03:18 GMT'}]",2016-11-03,"[['Cai', 'Bolun', ''], ['Xu', 'Xiangmin', ''], ['Jia', 'Kui', ''], ['Qing', 'Chunmei', ''], ['Tao', 'Dacheng', '']]","['Dehaze', 'image restoration', 'deep CNN', 'BReLU']"
4537,1505.02921,Gianluigi Ciocca,"Simone Bianco, Gianluigi Ciocca and Raimondo Schettini",How Far Can You Get By Combining Change Detection Algorithms?,,"Proceedings of the 19th International Conference in Image Analysis
  and Processing - ICIAP 2017, volume 10484 of Lecture Notes in Computer
  Science, pp. 96-107, Springer, 2017",10.1007/978-3-319-68560-1_9,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given the existence of many change detection algorithms, each with its own
peculiarities and strengths, we propose a combination strategy, that we termed
IUTIS (In Unity There Is Strength), based on a genetic Programming framework.
This combination strategy is aimed at leveraging the strengths of the
algorithms and compensate for their weakness. In this paper we show our
findings in applying the proposed strategy in two different scenarios. The
first scenario is purely performance-based. The second scenario performance and
efficiency must be balanced. Results demonstrate that starting from simple
algorithms we can achieve comparable results with respect to more complex
state-of-the-art change detection algorithms, while keeping the computational
complexity affordable for real-time applications.
","[{'version': 'v1', 'created': 'Tue, 12 May 2015 09:17:52 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Nov 2015 15:58:03 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Apr 2018 09:05:26 GMT'}]",2018-04-05,"[['Bianco', 'Simone', ''], ['Ciocca', 'Gianluigi', ''], ['Schettini', 'Raimondo', '']]","['Video surveillance', 'change detection', 'algorithm combiningand selection', 'genetic programming', 'CDNET']"
4538,2104.11365,Meia Chita-Tegmark,"Meia Chita-Tegmark, Theresa Law, Nicholas Rabb and Matthias Scheutz",Can You Trust Your Trust Measure?,9 pages,"In Proceedings of the 2021 ACM/IEEE International Conference on
  Human-Robot Interaction (HRI '21), March 8-11, 2021, Boulder, CO, USA ACM,
  New York, NY, USA",10.1145/3434073.3444677,,cs.HC cs.RO,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Trust in human-robot interactions (HRI) is measured in two main ways: through
subjective questionnaires and through behavioral tasks. To optimize
measurements of trust through questionnaires, the field of HRI faces two
challenges: the development of standardized measures that apply to a variety of
robots with different capabilities, and the exploration of social and
relational dimensions of trust in robots (e.g., benevolence). In this paper we
look at how different trust questionnaires fare given these challenges that
pull in different directions (being general vs. being exploratory) by studying
whether people think the items in these questionnaires are applicable to
different kinds of robots and interactions. In Study 1 we show that after being
presented with a robot (non-humanoid) and an interaction scenario (fire
evacuation), participants rated multiple questionnaire items such as ""This
robot is principled"" as ""Non-applicable to robots in general"" or
""Non-applicable to this robot"". In Study 2 we show that the frequency of these
ratings change (indeed, even for items rated as N/A to robots in general) when
a new scenario is presented (game playing with a humanoid robot). Finally,
while overall trust scores remained robust to N/A ratings, our results revealed
potential fallacies in the way these scores are commonly interpreted. We
conclude with recommendations for the development, use and results-reporting of
trust questionnaires for future studies, as well as theoretical implications
for the field of HRI.
","[{'version': 'v1', 'created': 'Fri, 23 Apr 2021 01:26:48 GMT'}]",2021-04-26,"[['Chita-Tegmark', 'Meia', ''], ['Law', 'Theresa', ''], ['Rabb', 'Nicholas', ''], ['Scheutz', 'Matthias', '']]","['human-robot interaction', 'human-robot trust', 'trust measure', 'subjective trust']"
4539,1701.00123,Ivan Svogor PhD,"Ivan Svogor, Jan Carlson",SCALL: Software Component Allocator for Heterogeneous Embedded Systems,,,10.1145/2797433.2797501,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Allocation of software components on a heterogeneous computing platform
involves hard decisions; handling different types of computing units with
specific processing paradigms and a number of software components which require
specific resources. An allocation method which explores the design space to
provide a system architect with deployment alternatives in an early design
phase can have a significant impact on the utilization of underlying platform.
In this paper we present SCALL, an early prototype tool which uses heuristics
and AHP for weighted multi-objective design space exploration to support
systems architects in complex allocation decisions in early design phases.
","[{'version': 'v1', 'created': 'Sat, 31 Dec 2016 15:30:59 GMT'}]",2017-01-03,"[['Svogor', 'Ivan', ''], ['Carlson', 'Jan', '']]","['Software component allocation', 'heterogeneous', 'Eclipse', 'multi–objective', 'software architecture']"
4540,1304.2031,Taha Yasseri,"Taha Yasseri, Giovanni Quattrone, and Afra Mashhadi","Temporal Analysis of Activity Patterns of Editors in Collaborative
  Mapping Project of OpenStreetMap",Submitted,"Proceedings of the 9th International Symposium on Open
  Collaboration (WikiSym '13). Association for Computing Machinery, New York,
  NY, USA, Article 13, 1-4 (2013)",10.1145/2491055.2491068,,cs.CY cs.HC cs.SI physics.data-an physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the recent years Wikis have become an attractive platform for social
studies of the human behaviour. Containing millions records of edits across the
globe, collaborative systems such as Wikipedia have allowed researchers to gain
a better understanding of editors participation and their activity patterns.
However, contributions made to Geo-wikis_wiki-based collaborative mapping
projects_ differ from systems such as Wikipedia in a fundamental way due to
spatial dimension of the content that limits the contributors to a set of those
who posses local knowledge about a specific area and therefore cross-platform
studies and comparisons are required to build a comprehensive image of online
open collaboration phenomena. In this work, we study the temporal behavioural
pattern of OpenStreetMap editors, a successful example of geo-wiki, for two
European capital cities. We categorise different type of temporal patterns and
report on the historical trend within a period of 7 years of the project age.
We also draw a comparison with the previously observed editing activity
patterns of Wikipedia.
","[{'version': 'v1', 'created': 'Sun, 7 Apr 2013 17:43:26 GMT'}]",2023-01-05,"[['Yasseri', 'Taha', ''], ['Quattrone', 'Giovanni', ''], ['Mashhadi', 'Afra', '']]","['OpenStreetMap', 'Geo-wiki', 'Mass Collaboration', 'Wikipedia', 'Eigenbehaviour', 'Principal Component Analysis', 'CircadianPattern']"
4541,1309.1129,Nisheeth Joshi,"Rashmi Gupta, Nisheeth Joshi, Iti Mathur","Analysing Quality of English-Hindi Machine Translation Engine Outputs
  Using Bayesian Classification",,"International Journal of Artificial Intelligence & Applications
  (IJAIA), Vol. 4, No. 4, July 2013",10.5121/ijaia.2013.4415,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the problem for estimating the quality of machine
translation outputs which are independent of human intervention and are
generally addressed using machine learning techniques.There are various
measures through which a machine learns translations quality. Automatic
Evaluation metrics produce good co-relation at corpus level but cannot produce
the same results at the same segment or sentence level. In this paper 16
features are extracted from the input sentences and their translations and a
quality score is obtained based on Bayesian inference produced from training
data.
","[{'version': 'v1', 'created': 'Wed, 4 Sep 2013 18:23:30 GMT'}]",2013-09-05,"[['Gupta', 'Rashmi', ''], ['Joshi', 'Nisheeth', ''], ['Mathur', 'Iti', '']]","['QUALITY ESTIMATION', 'SUPERVISED LEARNING', 'NAÏVE BAYES']"
4542,1807.04728,Jim Basney,"Alex Withers (NCSA), Brian Bockelman (University of Nebraska-Lincoln),
  Derek Weitzel (University of Nebraska-Lincoln), Duncan Brown (Syracuse
  University), Jeff Gaynor (NCSA), Jim Basney (NCSA), Todd Tannenbaum
  (University of Wisconsin-Madison), Zach Miller (University of
  Wisconsin-Madison)",SciTokens: Capability-Based Secure Access to Remote Scientific Data,"8 pages, 6 figures, PEARC '18: Practice and Experience in Advanced
  Research Computing, July 22--26, 2018, Pittsburgh, PA, USA",,10.1145/3219104.3219135,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The management of security credentials (e.g., passwords, secret keys) for
computational science workflows is a burden for scientists and information
security officers. Problems with credentials (e.g., expiration, privilege
mismatch) cause workflows to fail to fetch needed input data or store valuable
scientific results, distracting scientists from their research by requiring
them to diagnose the problems, re-run their computations, and wait longer for
their results. In this paper, we introduce SciTokens, open source software to
help scientists manage their security credentials more reliably and securely.
We describe the SciTokens system architecture, design, and implementation
addressing use cases from the Laser Interferometer Gravitational-Wave
Observatory (LIGO) Scientific Collaboration and the Large Synoptic Survey
Telescope (LSST) projects. We also present our integration with widely-used
software that supports distributed scientific computing, including HTCondor,
CVMFS, and XrootD. SciTokens uses IETF-standard OAuth tokens for
capability-based secure access to remote scientific data. The access tokens
convey the specific authorizations needed by the workflows, rather than
general-purpose authentication impersonation credentials, to address the risks
of scientific workflows running on distributed infrastructure including NSF
resources (e.g., LIGO Data Grid, Open Science Grid, XSEDE) and public clouds
(e.g., Amazon Web Services, Google Cloud, Microsoft Azure). By improving the
interoperability and security of scientific workflows, SciTokens 1) enables use
of distributed computing for scientific domains that require greater data
protection and 2) enables use of more widely distributed computing resources by
reducing the risk of credential abuse on remote systems.
","[{'version': 'v1', 'created': 'Thu, 12 Jul 2018 17:06:19 GMT'}]",2018-07-13,"[['Withers', 'Alex', '', 'NCSA'], ['Bockelman', 'Brian', '', 'University of Nebraska-Lincoln'], ['Weitzel', 'Derek', '', 'University of Nebraska-Lincoln'], ['Brown', 'Duncan', '', 'Syracuse\n  University'], ['Gaynor', 'Jeff', '', 'NCSA'], ['Basney', 'Jim', '', 'NCSA'], ['Tannenbaum', 'Todd', '', 'University of Wisconsin-Madison'], ['Miller', 'Zach', '', 'University of\n  Wisconsin-Madison']]","['OAuth', 'capabilities', 'distributed computing']"
4543,1701.03942,Tuan Tran,"Khoi Duy Vo, Tuan Tran, Tu Ngoc Nguyen, Xiaofei Zhu, Wolfgang Nejdl",Can We Find Documents in Web Archives without Knowing their Contents?,Published via ACM to Websci 2015,,10.1145/2908131.2908165,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advances of preservation technologies have led to an increasing number
of Web archive systems and collections. These collections are valuable to
explore the past of the Web, but their value can only be uncovered with
effective access and exploration mechanisms. Ideal search and rank- ing methods
must be robust to the high redundancy and the temporal noise of contents, as
well as scalable to the huge amount of data archived. Despite several attempts
in Web archive search, facilitating access to Web archive still remains a
challenging problem.
  In this work, we conduct a first analysis on different ranking strategies
that exploit evidences from metadata instead of the full content of documents.
We perform a first study to compare the usefulness of non-content evidences to
Web archive search, where the evidences are mined from the metadata of file
headers, links and URL strings only. Based on these findings, we propose a
simple yet surprisingly effective learning model that combines multiple
evidences to distinguish ""good"" from ""bad"" search results. We conduct empirical
experiments quantitatively as well as qualitatively to confirm the validity of
our proposed method, as a first step towards better ranking in Web archives
taking meta- data into account.
","[{'version': 'v1', 'created': 'Sat, 14 Jan 2017 16:23:09 GMT'}]",2017-01-17,"[['Vo', 'Khoi Duy', ''], ['Tran', 'Tuan', ''], ['Nguyen', 'Tu Ngoc', ''], ['Zhu', 'Xiaofei', ''], ['Nejdl', 'Wolfgang', '']]","['Web Archive Search', 'Temporal Ranking', 'Feature Analysis']"
4544,1709.04417,Ali Dehghantanha,"Tooska Dargahi, Ali Dehghantanha, Mauro Conti","Investigating Storage as a Service Cloud Platform: pCloud as a Case
  Study","30 pages, 19 figures, 2 tables","(Elsevier) Contemporary Digital Forensic Investigations Of Cloud
  And Mobile Applications, 2017,p.p. 185-204, Chapter 12",10.1016/B978-0-12-805303-4.00012-5,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Due to the flexibility, affordability and portability of cloud storage,
individuals and companies envisage the cloud storage as one of the preferred
storage media nowadays. This attracts the eyes of cyber criminals, since much
valuable informa- tion such as user credentials, and private customer records
are stored in the cloud. There are many ways for criminals to compromise cloud
services; ranging from non-technical attack methods, such as social
engineering, to deploying advanced malwares. Therefore, it is vital for cyber
forensics examiners to be equipped and informed about best methods for
investigation of different cloud platforms. In this chapter, using pCloud (an
extensively used online cloud storage service) as a case study, and we
elaborate on different kinds of artefacts retrievable during a forensics
examination. We carried out our experiments on four different virtual machines
running four popular operating systems: a 64 bit Windows 8, Ubuntu 14.04.1 LTS,
Android 4.4.2, and iOS 8.1. Moreover, we examined cloud remnants of two
different web browsers: Internet Explorer and Google Chrome on Windows. We
believe that our study would promote awareness among digital forensic examiners
on how to conduct cloud storage forensics examination.
","[{'version': 'v1', 'created': 'Wed, 13 Sep 2017 17:01:36 GMT'}]",2017-09-14,"[['Dargahi', 'Tooska', ''], ['Dehghantanha', 'Ali', ''], ['Conti', 'Mauro', '']]","['Cloud Forensics', 'Computer Forensics', 'Mobile Forensics', 'pCloud']"
4545,2010.11411,Wesley Deng,"Hong Shen, Wesley Hanwen Deng, Aditi Chattopadhyay, Zhiwei Steven Wu,
  Xu Wang, Haiyi Zhu","Value Cards: An Educational Toolkit for Teaching Social Impacts of
  Machine Learning through Deliberation",,"ACM Conference on Fairness, Accountability, and Transparency (ACM
  FAccT 2021)",10.1145/3442188.3445971,,cs.CY cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Recently, there have been increasing calls for computer science curricula to
complement existing technical training with topics related to Fairness,
Accountability, Transparency, and Ethics. In this paper, we present Value Card,
an educational toolkit to inform students and practitioners of the social
impacts of different machine learning models via deliberation. This paper
presents an early use of our approach in a college-level computer science
course. Through an in-class activity, we report empirical data for the initial
effectiveness of our approach. Our results suggest that the use of the Value
Cards toolkit can improve students' understanding of both the technical
definitions and trade-offs of performance metrics and apply them in real-world
contexts, help them recognize the significance of considering diverse social
values in the development of deployment of algorithmic systems, and enable them
to communicate, negotiate and synthesize the perspectives of diverse
stakeholders. Our study also demonstrates a number of caveats we need to
consider when using the different variants of the Value Cards toolkit. Finally,
we discuss the challenges as well as future applications of our approach.
","[{'version': 'v1', 'created': 'Thu, 22 Oct 2020 03:27:19 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Nov 2020 08:45:37 GMT'}, {'version': 'v3', 'created': 'Tue, 10 Jan 2023 07:34:32 GMT'}]",2023-01-11,"[['Shen', 'Hong', ''], ['Deng', 'Wesley Hanwen', ''], ['Chattopadhyay', 'Aditi', ''], ['Wu', 'Zhiwei Steven', ''], ['Wang', 'Xu', ''], ['Zhu', 'Haiyi', '']]","['Value Cards', 'Deliberation', 'Fairness', 'Machine Learning', 'CS Education']"
4546,1804.05839,Jason (Jinquan) Dai,"Jason Dai, Yiheng Wang, Xin Qiu, Ding Ding, Yao Zhang, Yanzhang Wang,
  Xianyan Jia, Cherry Zhang, Yan Wan, Zhichao Li, Jiao Wang, Shengsheng Huang,
  Zhongyuan Wu, Yang Wang, Yuhao Yang, Bowen She, Dongjie Shi, Qi Lu, Kai
  Huang, Guoqiong Song",BigDL: A Distributed Deep Learning Framework for Big Data,In ACM Symposium of Cloud Computing conference (SoCC) 2019,,10.1145/3357223.3362707,,cs.DC cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents BigDL (a distributed deep learning framework for Apache
Spark), which has been used by a variety of users in the industry for building
deep learning applications on production big data platforms. It allows deep
learning applications to run on the Apache Hadoop/Spark cluster so as to
directly process the production data, and as a part of the end-to-end data
analysis pipeline for deployment and management. Unlike existing deep learning
frameworks, BigDL implements distributed, data parallel training directly on
top of the functional compute model (with copy-on-write and coarse-grained
operations) of Spark. We also share real-world experience and ""war stories"" of
users that have adopted BigDL to address their challenges(i.e., how to easily
build end-to-end data analysis and deep learning pipelines for their production
data).
","[{'version': 'v1', 'created': 'Mon, 16 Apr 2018 12:04:03 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Apr 2018 03:21:14 GMT'}, {'version': 'v3', 'created': 'Mon, 25 Jun 2018 02:57:37 GMT'}, {'version': 'v4', 'created': 'Tue, 5 Nov 2019 13:12:43 GMT'}]",2021-04-13,"[['Dai', 'Jason', ''], ['Wang', 'Yiheng', ''], ['Qiu', 'Xin', ''], ['Ding', 'Ding', ''], ['Zhang', 'Yao', ''], ['Wang', 'Yanzhang', ''], ['Jia', 'Xianyan', ''], ['Zhang', 'Cherry', ''], ['Wan', 'Yan', ''], ['Li', 'Zhichao', ''], ['Wang', 'Jiao', ''], ['Huang', 'Shengsheng', ''], ['Wu', 'Zhongyuan', ''], ['Wang', 'Yang', ''], ['Yang', 'Yuhao', ''], ['She', 'Bowen', ''], ['Shi', 'Dongjie', ''], ['Lu', 'Qi', ''], ['Huang', 'Kai', ''], ['Song', 'Guoqiong', '']]","['distributed deep learning', 'big data', 'Apache Spark', 'end-to-end datapipeline']"
4547,2109.01269,Lei Jiang,Farzaneh Zokaee and Lei Jiang,"SMART: A Heterogeneous Scratchpad Memory Architecture for Superconductor
  SFQ-based Systolic CNN Accelerators",accepted by MICRO'21,"54th Annual IEEE/ACM International Symposium on Microarchitecture
  2021",10.1145/3466752.3480041,,cs.AR cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ultra-fast \& low-power superconductor single-flux-quantum (SFQ)-based CNN
systolic accelerators are built to enhance the CNN inference throughput.
However, shift-register (SHIFT)-based scratchpad memory (SPM) arrays prevent a
SFQ CNN accelerator from exceeding 40\% of its peak throughput, due to the lack
of random access capability. This paper first documents our study of a variety
of cryogenic memory technologies, including Vortex Transition Memory (VTM),
Josephson-CMOS SRAM, MRAM, and Superconducting Nanowire Memory, during which we
found that none of the aforementioned technologies made a SFQ CNN accelerator
achieve high throughput, small area, and low power simultaneously. Second, we
present a heterogeneous SPM architecture, SMART, composed of SHIFT arrays and a
random access array to improve the inference throughput of a SFQ CNN systolic
accelerator. Third, we propose a fast, low-power and dense pipelined random
access CMOS-SFQ array by building SFQ passive-transmission-line-based H-Trees
that connect CMOS sub-banks. Finally, we create an ILP-based compiler to deploy
CNN models on SMART. Experimental results show that, with the same chip area
overhead, compared to the latest SHIFT-based SFQ CNN accelerator, SMART
improves the inference throughput by $3.9\times$ ($2.2\times$), and reduces the
inference energy by $86\%$ ($71\%$) when inferring a single image (a batch of
images).
","[{'version': 'v1', 'created': 'Fri, 3 Sep 2021 02:02:48 GMT'}]",2021-09-06,"[['Zokaee', 'Farzaneh', ''], ['Jiang', 'Lei', '']]","['scratchpad memory', 'single-flux-quantum', 'CNN accelerator']"
4548,1706.03736,Ignacio Heredia,Ignacio Heredia,Large-Scale Plant Classification with Deep Neural Networks,"5 pages, 3 figures, 1 table. Published at Proocedings of ACM
  Computing Frontiers Conference 2017","ACM CF'17 Proceedings of the Computing Frontiers Conference
  (2017), 259-262",10.1145/3075564.3075590,,cs.LG cs.CV stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses the potential of applying deep learning techniques for
plant classification and its usage for citizen science in large-scale
biodiversity monitoring. We show that plant classification using near
state-of-the-art convolutional network architectures like ResNet50 achieves
significant improvements in accuracy compared to the most widespread plant
classification application in test sets composed of thousands of different
species labels. We find that the predictions can be confidently used as a
baseline classification in citizen science communities like iNaturalist (or its
Spanish fork, Natusfera) which in turn can share their data with biodiversity
portals like GBIF.
","[{'version': 'v1', 'created': 'Mon, 12 Jun 2017 17:16:20 GMT'}]",2017-06-13,"[['Heredia', 'Ignacio', '']]","['deep learning', 'plant classifcation', 'citizen science', 'biodiversity monitoring']"
4549,1912.08255,Julia Belyakova,Julia Belyakova,"Decidable Tag-Based Semantic Subtyping for Nominal Types, Tuples, and
  Unions",Published at FTfJP'19,"Proceedings of the 21st Workshop on Formal Techniques for
  Java-like Programs (FTfJP '19). ACM, New York, NY, USA, 2019, Article 3, 11
  pages",10.1145/3340672.3341115,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semantic subtyping enables simple, set-theoretical reasoning about types by
interpreting a type as the set of its values. Previously, semantic subtyping
has been studied primarily in the context of statically typed languages with
structural typing. In this paper, we explore the applicability of semantic
subtyping in the context of a dynamic language with nominal types. Instead of
static type checking, dynamic languages rely on run-time checking of type tags
associated with values, so we propose using the tags for semantic subtyping. We
base our work on a fragment of the Julia language and present tag-based
semantic subtyping for nominal types, tuples, and unions, where types are
interpreted set-theoretically, as sets of type tags. The proposed subtyping
relation is shown to be decidable, and a corresponding analytic definition is
provided. The implications of using semantic subtyping for multiple dispatch
are also discussed.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2019 19:57:47 GMT'}]",2019-12-19,"[['Belyakova', 'Julia', '']]","['semantic subtyping', 'type tags', 'multiple dispatch', 'nominal typing', 'distributivity', 'decidability']"
4550,1512.00064,Syed (Shawon) Rahman,Kyle Dees and Shawon Rahman,Enhancing Infrastructure Security in Real Estate,,,10.5121/ijnsa.2011.3604,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As a result of the increased dependency on obtaining information and
connecting each computer together for ease of access or communication,
organizations risk being attacked and losing private information through
breaches or insecure business activities. To help protect organizations and
their assets, companies need to develop a strong understanding of the risks
imposed on their company and the security solutions designed to prevent or
minimize vulnerabilities. To reduce the impact threats have on a network,
organizations need to: design a defense layer system that provides multiple
instances of protection to prevent unauthorized access to core information,
implement a strong network hardware/intrusion prevention system, and create
all-inclusive network or security policies that detail user rules and company
rights. In order to enhance the overall security of a basic infrastructure,
this paper will provide a detailed look into gathering the organizational
requirements, designing and implementing a secure physical network layout, and
selecting the standards needed to prevent unauthorized access
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2015 22:01:17 GMT'}]",2015-12-02,"[['Dees', 'Kyle', ''], ['Rahman', 'Shawon', '']]","['Infrastructure Security', 'Real Estate', 'Network Design', 'Network Security', 'Unauthorized Access']"
4551,1702.02628,Amin Ghafouri,"Amin Ghafouri, Aron Laszka, Abhishek Dubey, and Xenofon Koutsoukos",Optimal Detection of Faulty Traffic Sensors Used in Route Planning,"Proceedings of The 2nd Workshop on Science of Smart City Operations
  and Platforms Engineering (SCOPE 2017), Pittsburgh, PA USA, April 2017, 6
  pages",,10.1145/3063386.3063767,,cs.AI cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a smart city, real-time traffic sensors may be deployed for various
applications, such as route planning. Unfortunately, sensors are prone to
failures, which result in erroneous traffic data. Erroneous data can adversely
affect applications such as route planning, and can cause increased travel
time. To minimize the impact of sensor failures, we must detect them promptly
and accurately. However, typical detection algorithms may lead to a large
number of false positives (i.e., false alarms) and false negatives (i.e.,
missed detections), which can result in suboptimal route planning. In this
paper, we devise an effective detector for identifying faulty traffic sensors
using a prediction model based on Gaussian Processes. Further, we present an
approach for computing the optimal parameters of the detector which minimize
losses due to false-positive and false-negative errors. We also characterize
critical sensors, whose failure can have high impact on the route planning
application. Finally, we implement our method and evaluate it numerically using
a real-world dataset and the route planning platform OpenTripPlanner.
","[{'version': 'v1', 'created': 'Wed, 8 Feb 2017 21:49:46 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Mar 2017 16:37:47 GMT'}]",2017-03-17,"[['Ghafouri', 'Amin', ''], ['Laszka', 'Aron', ''], ['Dubey', 'Abhishek', ''], ['Koutsoukos', 'Xenofon', '']]","['fault detection', 'cyber-physical systems', 'smart city', 'route planning']"
4552,2211.08400,Yawen Zhang,"Yawen Zhang, Michael Hannigan, Qin Lv","Air Pollution Hotspot Detection and Source Feature Analysis using
  Cross-domain Urban Data",10 pages,ACM SIGSPATIAL 2021,10.1145/3474717.3484263,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Air pollution is a major global environmental health threat, in particular
for people who live or work near pollution sources. Areas adjacent to pollution
sources often have high ambient pollution concentrations, and those areas are
commonly referred to as air pollution hotspots. Detecting and characterizing
pollution hotspots are of great importance for air quality management, but are
challenging due to the high spatial and temporal variability of air pollutants.
In this work, we explore the use of mobile sensing data (i.e., air quality
sensors installed on vehicles) to detect pollution hotspots. One major
challenge with mobile sensing data is uneven sampling, i.e., data collection
can vary by both space and time. To address this challenge, we propose a
two-step approach to detect hotspots from mobile sensing data, which includes
local spike detection and sample-weighted clustering. Essentially, this
approach tackles the uneven sampling issue by weighting samples based on their
spatial frequency and temporal hit rate, so as to identify robust and
persistent hotspots. To contextualize the hotspots and discover potential
pollution source characteristics, we explore a variety of cross-domain urban
data and extract features from them. As a soft-validation of the extracted
features, we build hotspot inference models for cities with and without mobile
sensing data. Evaluation results using real-world mobile sensing air quality
data as well as cross-domain urban data demonstrate the effectiveness of our
approach in detecting and inferring pollution hotspots. Furthermore, the
empirical analysis of hotspots and source features yields useful insights
regarding neighborhood pollution sources.
","[{'version': 'v1', 'created': 'Tue, 15 Nov 2022 18:44:03 GMT'}]",2022-11-16,"[['Zhang', 'Yawen', ''], ['Hannigan', 'Michael', ''], ['Lv', 'Qin', '']]","['Air pollution hotspot detection', 'pollution source feature analysis', 'cross-domain urban data']"
4553,1512.03580,Taner Cevik Dr.,"Taner Cevik, Fatih Ozyurt","Impacts of structural factors on energy consumption in cluster-based
  wireless sensor networks: a comprehensive analysis",,,10.5121/ijasuc.2015.6101,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Limited energy is the major driving factor for research on wireless sensor
networks. Clustering alleviates this energy shortage problem by reducing data
traffic conveyed over the network and therefore several clustering methods are
proposed in the literature. Researchers put forward their methods by making
serious assumptions such as always locating single sink at one side of the
topology or making clusters near to the sink with smaller sizes. However, to
the best of our knowledge, there is no comprehensive research that investigates
the effects of various structural alternatives on energy consumption of
wireless sensor networks. In this paper, we thoroughly analyse the impact of
various structural approaches such as cluster size, number of tiers in the
topology, node density, position and number of sinks. Extensive simulation
results are provided. The results show that the best performance about
","[{'version': 'v1', 'created': 'Fri, 11 Dec 2015 10:33:48 GMT'}]",2015-12-14,"[['Cevik', 'Taner', ''], ['Ozyurt', 'Fatih', '']]","['Wireless Sensor Networks', 'Clustering', 'Energy Conservation', 'Network Lifetime.  1']"
4554,1509.03712,Ugur Kucuk,"U\u{g}ur K\""u\c{c}\""uk, A. C. Cem Say, Abuzer Yakary{\i}lmaz",Inkdots as advice for finite automata,14 pages,"Discrete Mathematics & Theoretical Computer Science, Vol. 19 no.
  3, Automata, Logic and Semantics (September 26, 2017) dmtcs:3941",10.23638/DMTCS-19-3-1,,cs.FL cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We examine inkdots placed on the input string as a way of providing advice to
finite automata, and establish the relations between this model and the
previously studied models of advised finite automata. The existence of an
infinite hierarchy of classes of languages that can be recognized with the help
of increasing numbers of inkdots as advice is shown. The effects of different
forms of advice on the succinctness of the advised machines are examined. We
also study randomly placed inkdots as advice to probabilistic finite automata,
and demonstrate the superiority of this model over its deterministic version.
Even very slowly growing amounts of space can become a resource of meaningful
use if the underlying advised model is extended with access to secondary
memory, while it is famously known that such small amounts of space are not
useful for unadvised one-way Turing machines.
","[{'version': 'v1', 'created': 'Sat, 12 Sep 2015 06:41:00 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Dec 2016 19:05:47 GMT'}, {'version': 'v3', 'created': 'Sat, 16 Sep 2017 14:12:30 GMT'}]",2019-03-14,"[['Küçük', 'Uğur', ''], ['Say', 'A. C. Cem', ''], ['Yakaryılmaz', 'Abuzer', '']]","['advised computation', 'finite automata', 'small space', 'inkdots']"
4555,1801.02225,Hacer Yalim Keles,Long Ang Lim and Hacer Yalim Keles,"Foreground Segmentation Using a Triplet Convolutional Neural Network for
  Multiscale Feature Encoding",This paper is under consideration at Pattern Recognition Letters,,10.1016/j.patrec.2018.08.002,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A common approach for moving objects segmentation in a scene is to perform a
background subtraction. Several methods have been proposed in this domain.
However, they lack the ability of handling various difficult scenarios such as
illumination changes, background or camera motion, camouflage effect, shadow
etc. To address these issues, we propose a robust and flexible encoder-decoder
type neural network based approach. We adapt a pre-trained convolutional
network, i.e. VGG-16 Net, under a triplet framework in the encoder part to
embed an image in multiple scales into the feature space and use a transposed
convolutional network in the decoder part to learn a mapping from feature space
to image space. We train this network end-to-end by using only a few training
samples. Our network takes an RGB image in three different scales and produces
a foreground segmentation probability mask for the corresponding image. In
order to evaluate our model, we entered the Change Detection 2014 Challenge
(changedetection.net) and our method outperformed all the existing
state-of-the-art methods by an average F-Measure of 0.9770. Our source code
will be made publicly available at https://github.com/lim-anggun/FgSegNet.
","[{'version': 'v1', 'created': 'Sun, 7 Jan 2018 18:33:43 GMT'}]",2018-08-06,"[['Lim', 'Long Ang', ''], ['Keles', 'Hacer Yalim', '']]","['Foregroundsegmentation', 'background subtraction', 'deep learning', 'convolutional neural networks', 'video surveillance', 'pixelclassification']"
4556,1902.00735,Joe Politz,"Joe Politz (University of California San Diego, United States),
  Benjamin Lerner (Northeastern University, United States), Sorawee
  Porncharoenwase (Brown University, United States), Shriram Krishnamurthi
  (Brown University, United States)","Event Loops as First-Class Values: A Case Study in Pedagogic Language
  Design",,"The Art, Science, and Engineering of Programming, 2019, Vol. 3,
  Issue 3, Article 11",10.22152/programming-journal.org/2019/3/11,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The World model is an existing functional input-output mechanism for
event-driven programming. It is used in numerous popular textbooks and
curricular settings. The World model conflates two different tasks -- the
definition of an event processor and its execution -- into one. This conflation
imposes a significant (even unacceptable) burden on student users in several
educational settings where we have tried to use it, e.g., for teaching physics.
While it was tempting to pile on features to address these issues, we instead
used the Scheme language design dictum of removing weaknesses that made them
seem necessary. By separating the two tasks above, we arrived at a slightly
different primitive, the reactor, as our basis. This only defines the event
processor, and a variety of execution operators dictate how it runs. The new
design enables programmatic control over event-driven programs. This simplifies
reflecting on program behavior, and eliminates many unnecessary curricular
dependencies imposed by the old design. This work has been implemented in the
Pyret programming language. The separation of concerns has enabled new
curricula, such as the Bootstrap:Physics curriculum, to take flight. Thousands
of students use this new mechanism every year. We believe that reducing
impedance mismatches improves their educational experience.
","[{'version': 'v1', 'created': 'Sat, 2 Feb 2019 15:28:27 GMT'}]",2019-02-05,"[['Politz', 'Joe', '', 'University of California San Diego, United States'], ['Lerner', 'Benjamin', '', 'Northeastern University, United States'], ['Porncharoenwase', 'Sorawee', '', 'Brown University, United States'], ['Krishnamurthi', 'Shriram', '', 'Brown University, United States']]","['event loops', 'reactive programming', 'functional programming', 'testing', 'design']"
4557,1608.01654,Mounir Assaf,"Mounir Assaf, David A. Naumann, Julien Signoles, \'Eric Totel,
  Fr\'ed\'eric Tronel","Hypercollecting Semantics and its Application to Static Analysis of
  Information Flow",,,10.1145/3009837.3009889,,cs.PL cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show how static analysis for secure information flow can be expressed and
proved correct entirely within the framework of abstract interpretation. The
key idea is to define a Galois connection that directly approximates the
hyperproperty of interest. To enable use of such Galois connections, we
introduce a fixpoint characterisation of hypercollecting semantics, i.e. a ""set
of set"" transformer. This makes it possible to systematically derive static
analyses for hyperproperties entirely within the calculational framework of
abstract interpretation. We evaluate this technique by deriving example static
analyses. For qualitative information flow, we derive a dependence analysis
similar to the logic of Amtoft and Banerjee (SAS'04) and the type system of
Hunt and Sands (POPL'06). For quantitative information flow, we derive a novel
cardinality analysis that bounds the leakage conveyed by a program instead of
simply deciding whether it exists. This encompasses problems that are
hypersafety but not k-safety. We put the framework to use and introduce
variations that achieve precision rivalling the most recent and precise static
analyses for information flow.
","[{'version': 'v1', 'created': 'Thu, 4 Aug 2016 19:40:42 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Nov 2016 12:50:06 GMT'}]",2016-11-08,"[['Assaf', 'Mounir', ''], ['Naumann', 'David A.', ''], ['Signoles', 'Julien', ''], ['Totel', 'Éric', ''], ['Tronel', 'Frédéric', '']]","['static analysis', 'abstract interpretation', 'information flow', 'hyperproperties']"
4558,1504.07795,Derek Groen,"Mohamed A. Itani, Ulf D. Schiller, Sebastian Schmieschek, James
  Hetherington, Miguel O. Bernabeu, Hoskote Chandrashekar, Fergus Robertson,
  Peter V. Coveney and Derek Groen","An automated multiscale ensemble simulation approach for vascular blood
  flow","Journal of Computational Science (in press), 10 pages, 6 figures, 2
  tables",,10.1016/j.jocs.2015.04.008,,cs.DC cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cerebrovascular diseases such as brain aneurysms are a primary cause of adult
disability. The flow dynamics in brain arteries, both during periods of rest
and increased activity, are known to be a major factor in the risk of aneurysm
formation and rupture. The precise relation is however still an open field of
investigation. We present an automated ensemble simulation method for modelling
cerebrovascular blood flow under a range of flow regimes. By automatically
constructing and performing an ensemble of multiscale simulations, where we
unidirectionally couple a 1D solver with a 3D lattice-Boltzmann code, we are
able to model the blood flow in a patient artery over a range of flow regimes.
We apply the method to a model of a middle cerebral artery, and find that this
approach helps us to fine-tune our modelling techniques, and opens up new ways
to investigate cerebrovascular flow properties.
","[{'version': 'v1', 'created': 'Wed, 29 Apr 2015 10:22:56 GMT'}]",2015-04-30,"[['Itani', 'Mohamed A.', ''], ['Schiller', 'Ulf D.', ''], ['Schmieschek', 'Sebastian', ''], ['Hetherington', 'James', ''], ['Bernabeu', 'Miguel O.', ''], ['Chandrashekar', 'Hoskote', ''], ['Robertson', 'Fergus', ''], ['Coveney', 'Peter V.', ''], ['Groen', 'Derek', '']]","['multiscale modelling', 'blood flow', 'ensemble simulation', 'parallel programming', 'high-performancecomputing']"
4559,1007.1048,Dhamodaran Sasikala,D.Sasikala and R.Neelaveni,Registration of Brain Images using Fast Walsh Hadamard Transform,"10 pages, 37 figures, 12 tables","(IJCSIS) International Journal of Computer Science and Information
  Security, Vol. 8, No. 2, May 2010",10.5120/1745-2053,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  A lot of image registration techniques have been developed with great
significance for data analysis in medicine, astrophotography, satellite imaging
and few other areas. This work proposes a method for medical image registration
using Fast Walsh Hadamard transform. This algorithm registers images of the
same or different modalities. Each image bit is lengthened in terms of Fast
Walsh Hadamard basis functions. Each basis function is a notion of determining
various aspects of local structure, e.g., horizontal edge, corner, etc. These
coefficients are normalized and used as numerals in a chosen number system
which allows one to form a unique number for each type of local structure. The
experimental results show that Fast Walsh Hadamard transform accomplished
better results than the conventional Walsh transform in the time domain. Also
Fast Walsh Hadamard transform is more reliable in medical image registration
consuming less time.
","[{'version': 'v1', 'created': 'Wed, 7 Jul 2010 04:49:16 GMT'}]",2015-05-19,"[['Sasikala', 'D.', ''], ['Neelaveni', 'R.', '']]","['Walsh Transform', 'Fast Walsh Hadamard Transform', 'Local Structure', 'Medical Image Registration', 'Normalization']"
4560,1406.6277,Carlos Luis Gonz\'alez-Valiente,C. L. Gonz\'alez-Valiente,"Midiendo la calidad de la informacion gestionada: algunas reflexiones
  conceptuales-metodologicas",in Spanish,"Biblios. 2014; 52, 27-35",10.5195/biblios.2014.101,,cs.OH,http://creativecommons.org/licenses/by/3.0/,"  The study, based on a documental classic analysis, presents conceptual and
methodological guidelines concerning the design of methodologies that help to
measure the quality of information that is managed in organizations. It is
described the process of information management and the importance of
implementing quality principles in it. There are exposed the four dimensions of
information quality as part of an indicators integration which characterize the
informational contents. There are defined each of the phases in the
methodological design to evaluate the information. There also are indicated the
implications of this activity for information professionals.
","[{'version': 'v1', 'created': 'Fri, 20 Jun 2014 20:15:15 GMT'}]",2014-06-25,"[['González-Valiente', 'C. L.', '']]","['Information quality', 'Management of information', 'Information quality dimensions', 'Information quality methodology']"
4561,1306.4925,Francesco Ricca,"Marco Maratea, Luca Pulina, Francesco Ricca",A Multi-Engine Approach to Answer Set Programming,"26 pages, 8 figures",Theory and Practice of Logic Programming 14 (2014) 841-868,10.1017/S1471068413000094,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Answer Set Programming (ASP) is a truly-declarative programming paradigm
proposed in the area of non-monotonic reasoning and logic programming, that has
been recently employed in many applications. The development of efficient ASP
systems is, thus, crucial. Having in mind the task of improving the solving
methods for ASP, there are two usual ways to reach this goal: $(i)$ extending
state-of-the-art techniques and ASP solvers, or $(ii)$ designing a new ASP
solver from scratch. An alternative to these trends is to build on top of
state-of-the-art solvers, and to apply machine learning techniques for choosing
automatically the ""best"" available solver on a per-instance basis.
  In this paper we pursue this latter direction. We first define a set of
cheap-to-compute syntactic features that characterize several aspects of ASP
programs. Then, we apply classification methods that, given the features of the
instances in a {\sl training} set and the solvers' performance on these
instances, inductively learn algorithm selection strategies to be applied to a
{\sl test} set. We report the results of a number of experiments considering
solvers and different training and test sets of instances taken from the ones
submitted to the ""System Track"" of the 3rd ASP Competition. Our analysis shows
that, by applying machine learning techniques to ASP solving, it is possible to
obtain very robust performance: our approach can solve more instances compared
with any solver that entered the 3rd ASP Competition. (To appear in Theory and
Practice of Logic Programming (TPLP).)
","[{'version': 'v1', 'created': 'Thu, 20 Jun 2013 16:03:19 GMT'}]",2020-02-19,"[['Maratea', 'Marco', ''], ['Pulina', 'Luca', ''], ['Ricca', 'Francesco', '']]","['Answer Set Programming', 'Automated Algorithm Selection', 'Multi-Engine solvers']"
4562,1810.10346,Weiwen Wu,"Weiwen Wu, Qian Wang, Fenglin Liu, Yining Zhu, and Hengyong Yu",Block Matching Frame based Material Reconstruction for Spectral CT,"More details can refer to
  https://iopscience.iop.org/article/10.1088/1361-6560/ab51db/pdf","Physics in Medicine & Biology,2019",10.1088/1361-6560/ab51db,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spectral computed tomography (CT) has a great potential in material
identification and decomposition. To achieve high-quality material composition
images and further suppress the x-ray beam hardening artifacts, we first
propose a one-step material reconstruction model based on Taylor first-order
expansion. Then, we develop a basic material reconstruction method named
material simultaneous algebraic reconstruction technique (MSART). Considering
the local similarity of each material image, we incorporate a powerful block
matching frame (BMF) into the material reconstruction (MR) model and generate a
BMF based MR (BMFMR) method. Because the BMFMR model contains the L0-norm
problem, we adopt a split-Bregman method for optimization. The numerical
simulation and physical phantom experiment results validate the correctness of
the material reconstruction algorithms and demonstrate that the BMF
regularization outperforms the total variation and no-local mean
regularizations.
","[{'version': 'v1', 'created': 'Mon, 22 Oct 2018 02:05:09 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Oct 2019 11:01:23 GMT'}]",2020-01-08,"[['Wu', 'Weiwen', ''], ['Wang', 'Qian', ''], ['Liu', 'Fenglin', ''], ['Zhu', 'Yining', ''], ['Yu', 'Hengyong', '']]","['spectral computed tomography', 'material reconstruction', 'block matching frame']"
4563,1409.0421,Shoni Gilboa,"Shoni Gilboa, Shay Gueron and Mridul Nandi",Balanced permutations Even-Mansour ciphers,,"Cryptography, June 2017, volume 1, issue 1, article 2",10.3390/cryptography1010002,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The $r$-rounds Even-Mansour block cipher is a generalization of the well
known Even-Mansour block cipher to $r$ iterations. Attacks on this construction
were described by Nikoli\'c et al. and Dinur et al., for $r = 2, 3$. These
attacks are only marginally better than brute force, but are based on an
interesting observation (due to Nikoli\'c et al.): for a ""typical"" permutation
$P$, the distribution of $P(x) \oplus x$ is not uniform. This naturally raises
the following question. Call permutations for which the distribution of $P(x)
\oplus x$ is uniform ""balanced."" Is there a sufficiently large family of
balanced permutations, and what is the security of the resulting Even-Mansour
block cipher?
  We show how to generate families of balanced permutations from the
Luby-Rackoff construction, and use them to define a $2n$-bit block cipher from
the $2$-rounds Even-Mansour scheme. We prove that this cipher is
indistinguishable from a random permutation of $\{0, 1\}^{2n}$, for any
adversary who has oracle access to the public permutations and to an
encryption/decryption oracle, as long as the number of queries is $o
(2^{n/2})$. As a practical example, we discuss the properties and the
performance of a $256$-bit block cipher that is based on our construction, and
uses AES as the public permutation.
","[{'version': 'v1', 'created': 'Mon, 1 Sep 2014 13:48:56 GMT'}, {'version': 'v2', 'created': 'Sun, 7 Jun 2015 07:08:22 GMT'}, {'version': 'v3', 'created': 'Thu, 20 Aug 2015 17:13:34 GMT'}]",2020-11-10,"[['Gilboa', 'Shoni', ''], ['Gueron', 'Shay', ''], ['Nandi', 'Mridul', '']]","['Even-Mansour', 'block-cipher', 'Luby-Rackoff']"
4564,1505.05312,Kieran Greer Dr,Kieran Greer,A New Oscillating-Error Technique for Classifiers,,"Cogent Engineering, 4:1, 2017",10.1080/23311916.2017.1293480,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a new method for reducing the error in a classifier. It
uses an error correction update that includes the very simple rule of either
adding or subtracting the error adjustment, based on whether the variable value
is currently larger or smaller than the desired value. While a traditional
neuron would sum the inputs together and then apply a function to the total,
this new method can change the function decision for each input value. This
gives added flexibility to the convergence procedure, where through a series of
transpositions, variables that are far away can continue towards the desired
value, whereas variables that are originally much closer can oscillate from one
side to the other. Tests show that the method can successfully classify some
benchmark datasets. It can also work in a batch mode, with reduced training
times and can be used as part of a neural network architecture. Some
comparisons with an earlier wave shape paper are also made.
","[{'version': 'v1', 'created': 'Wed, 20 May 2015 10:43:21 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Jul 2015 18:50:41 GMT'}, {'version': 'v3', 'created': 'Fri, 30 Oct 2015 15:54:16 GMT'}, {'version': 'v4', 'created': 'Thu, 7 Apr 2016 16:51:57 GMT'}, {'version': 'v5', 'created': 'Mon, 31 Oct 2016 14:42:06 GMT'}, {'version': 'v6', 'created': 'Sat, 4 Feb 2017 19:34:18 GMT'}, {'version': 'v7', 'created': 'Tue, 10 Oct 2017 07:47:39 GMT'}, {'version': 'v8', 'created': 'Tue, 21 Nov 2017 09:04:59 GMT'}]",2018-03-02,"[['Greer', 'Kieran', '']]","['classifier', 'oscillating error', 'transposition', 'matrix', 'neural network', 'cellular']"
4565,1904.01654,Ken C. L. Wong,"Ken C. L. Wong, Mehdi Moradi, Joy Wu, Tanveer Syeda-Mahmood",Identifying disease-free chest X-ray images with deep transfer learning,"SPIE Medical Imaging, 2019 (oral presentation)",,10.1117/12.2513164,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Chest X-rays (CXRs) are among the most commonly used medical image
modalities. They are mostly used for screening, and an indication of disease
typically results in subsequent tests. As this is mostly a screening test used
to rule out chest abnormalities, the requesting clinicians are often interested
in whether a CXR is normal or not. A machine learning algorithm that can
accurately screen out even a small proportion of the ""real normal"" exams out of
all requested CXRs would be highly beneficial in reducing the workload for
radiologists. In this work, we report a deep neural network trained for
classifying CXRs with the goal of identifying a large number of normal
(disease-free) images without risking the discharge of sick patients. We use an
ImageNet-pretrained Inception-ResNet-v2 model to provide the image features,
which are further used to train a model on CXRs labelled by expert
radiologists. The probability threshold for classification is optimized for
100% precision for the normal class, ensuring no sick patients are released. At
this threshold we report an average recall of 50%. This means that the proposed
solution has the potential to cut in half the number of disease-free CXRs
examined by radiologists, without risking the discharge of sick patients.
","[{'version': 'v1', 'created': 'Tue, 2 Apr 2019 20:26:53 GMT'}]",2019-04-04,"[['Wong', 'Ken C. L.', ''], ['Moradi', 'Mehdi', ''], ['Wu', 'Joy', ''], ['Syeda-Mahmood', 'Tanveer', '']]","['Chest X-ray', 'workload reduction', 'deep learning', 'transfer learning']"
4566,1108.3620,EPTCS,"Val\'erie Berth\'e (CNRS- Univ. Paris 7), S\'ebastien Labb\'e
  (LACIM-UQAM)","Uniformly balanced words with linear complexity and prescribed letter
  frequencies","In Proceedings WORDS 2011, arXiv:1108.3412","EPTCS 63, 2011, pp. 44-52",10.4204/EPTCS.63.8,,cs.FL cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the following problem. Let us fix a finite alphabet A; for any
given d-uple of letter frequencies, how to construct an infinite word u over
the alphabet A satisfying the following conditions: u has linear complexity
function, u is uniformly balanced, the letter frequencies in u are given by the
given d-uple. This paper investigates a construction method for such words
based on the use of mixed multidimensional continued fraction algorithms.
","[{'version': 'v1', 'created': 'Thu, 18 Aug 2011 03:52:31 GMT'}]",2011-08-19,"[['Berthé', 'Valérie', '', 'CNRS- Univ. Paris 7'], ['Labbé', 'Sébastien', '', 'LACIM-UQAM']]","['balanced words', 'discrepancy', 'letter frequency', 'multidimensional continued fractions', 'discrete geometry']"
4567,1903.08412,Sumanta Das Dr,Sumanta Kumar Das,"Modeling Intelligent Decision Making Command And Control Agents: An
  Application to Air Defense",,"IEEE Intelligent system, sept/oct 2014",10.1109/MIS.2013.71,,cs.AI stat.CO,http://creativecommons.org/licenses/by/4.0/,"  The paper is a half-way between the agent technology and the mathematical
reasoning to model tactical decision making tasks. These models are applied to
air defense (AD) domain for command and control (C2). It also addresses the
issues related to evaluation of agents. The agents are designed and implemented
using the agent-programming paradigm. The agents are deployed in an air combat
simulated environment for performing the tasks of C2 like electronic counter
counter measures, threat assessment, and weapon allocation. The simulated AD
system runs without any human intervention, and represents state-of-the-art
model for C2 autonomy. The use of agents as autonomous decision making entities
is particularly useful in view of futuristic network centric warfare.
","[{'version': 'v1', 'created': 'Wed, 20 Mar 2019 09:52:17 GMT'}]",2019-05-13,"[['Das', 'Sumanta Kumar', '']]","['Autonomous agent', 'BDI architectures', 'weapon']"
4568,1705.10986,N Vinay Kumar,D. S. Guru and N. Vinay Kumar,"Class Specific Feature Selection for Interval Valued Data Through
  Interval K-Means Clustering","12 Pages, 3 figures, 7 tables","RTIP2R 2016, CCIS 709, pp. 228 TO 239, 2017",10.1007/978-981-10-4859-3,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a novel feature selection approach for supervised interval
valued features is proposed. The proposed approach takes care of selecting the
class specific features through interval K-Means clustering. The kernel of
K-Means clustering algorithm is modified to adapt interval valued data. During
training, a set of samples corresponding to a class is fed into the interval
K-Means clustering algorithm, which clusters features into K distinct clusters.
Hence, there are K number of features corresponding to each class.
Subsequently, corresponding to each class, the cluster representatives are
chosen. This procedure is repeated for all the samples of remaining classes.
During testing the feature indices correspond to each class are used for
validating the given dataset through classification using suitable symbolic
classifiers. For experimentation, four standard supervised interval datasets
are used. The results show the superiority of the proposed model when compared
with the other existing state-of-the-art feature selection methods.
","[{'version': 'v1', 'created': 'Wed, 31 May 2017 08:43:58 GMT'}]",2017-06-01,"[['Guru', 'D. S.', ''], ['Kumar', 'N. Vinay', '']]","['Feature selection', 'Interval data', 'Symbolic similarity measure', 'Symbolic classification']"
4569,1610.09766,Ian Cheong,"Muthukaruppan Swaminathan, Pankaj Kumar Yadav, Obdulio Piloto, Tobias
  Sj\""oblom and Ian Cheong","A New Distance Measure for Non-Identical Data with Application to Image
  Classification",,,10.1016/j.patcog.2016.10.018,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distance measures are part and parcel of many computer vision algorithms. The
underlying assumption in all existing distance measures is that feature
elements are independent and identically distributed. However, in real-world
settings, data generally originate from heterogeneous sources even if they do
possess a common data-generating mechanism. Since these sources are not
identically distributed by necessity, the assumption of identical distribution
is inappropriate. Here, we use statistical analysis to show that feature
elements of local image descriptors are indeed non-identically distributed. To
test the effect of omitting the unified distribution assumption, we created a
new distance measure called the Poisson-Binomial Radius (PBR). PBR is a
bin-to-bin distance which accounts for the dispersion of bin-to-bin
information. PBR's performance was evaluated on twelve benchmark data sets
covering six different classification and recognition applications: texture,
material, leaf, scene, ear biometrics and category-level image classification.
Results from these experiments demonstrate that PBR outperforms
state-of-the-art distance measures for most of the data sets and achieves
comparable performance on the rest, suggesting that accounting for different
distributions in distance measures can improve performance in classification
and recognition tasks.
","[{'version': 'v1', 'created': 'Mon, 31 Oct 2016 03:04:48 GMT'}]",2016-11-01,"[['Swaminathan', 'Muthukaruppan', ''], ['Yadav', 'Pankaj Kumar', ''], ['Piloto', 'Obdulio', ''], ['Sjöblom', 'Tobias', ''], ['Cheong', 'Ian', '']]","['Poisson-Binomial distribution', 'semi-metric distance', 'non-identicaldata', 'distance measure', 'image classification', 'image recognition']"
4570,2105.12228,Marco Minghini PhD,"Marco Minghini, Vlado Cetl, Alexander Kotsev, Robert Tomas, Michael
  Lutz",INSPIRE: The Entry Point to Europe's Big Geospatial Data Infrastructure,"21 pages, 6 figures","In: Werner M., Chiang YY. (eds) Handbook of Big Geospatial Data.
  Springer, Cham (2021)",10.1007/978-3-030-55462-0_24,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Initiated in 2007, the INSPIRE Directive has set a legal framework to create
a European-wide Spatial Data Infrastructure (SDI) to support the European Union
(EU) environmental policies. This chapter analyses the INSPIRE infrastructure
from a Big Geospatial Data perspective, describing how data is shared in an
interoperable way by public sector organisations in the EU Member States and
how it is made available in and accessible within the infrastructure. The
INSPIRE Geoportal, which is the entry point to the whole infrastructure, is
presented in detail. To justify its nature of a Big Geospatial Data
infrastructure, the characteristics of INSPIRE data are mapped to those of Big
Data's six 'Vs'. Despite many good results achieved in terms of data sharing,
some challenges still remain related to data consumption from the user side.
The chapter concludes with a dedicated discussion on how INSPIRE, and
traditional SDIs in general, should evolve into modern data ecosystems to
address these challenges while also embracing the modern practices of data
sharing through the web.
","[{'version': 'v1', 'created': 'Tue, 25 May 2021 21:37:58 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Jun 2021 09:38:40 GMT'}]",2021-06-10,"[['Minghini', 'Marco', ''], ['Cetl', 'Vlado', ''], ['Kotsev', 'Alexander', ''], ['Tomas', 'Robert', ''], ['Lutz', 'Michael', '']]","['Big Data', 'Geoportal', 'INSPIRE', 'interoperability', 'Spatial Data Infrastructures   ABSTRACT']"
4571,1912.00812,Goiuri Peralta,"Goiuri Peralta, Pablo Garrido, Josu Bilbao, Ram\'on Ag\""uero and Pedro
  M. Crespo","Fog to cloud and network coded based architecture: Minimizing data
  download time for smart mobility","Funding: the Basque Government through the ADDISEND (KK-2018/00115)
  and DIGITAL (KK-2019/00095) Elkartek programs, the H2020 research framework
  under the ELASTIC project (825473), and the Spanish Ministry of Economy and
  Competitiveness through CARMEN (TEC2016-75067-C4-3-R), ADVICE
  (TEC2015-71329-C2-1-R), FIERCE (RTI2018-093475-A-100) and COMONSENS
  (TEC2015-69648-REDC) projects",,10.1016/j.simpat.2019.102034,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Industry 4.0 applications foster new business opportunities but they also
pose new and challenging requirements, such as low latency communications and
highly reliable systems. They enable to exploit novel wireless technologies
(5G), but it would also be crucial to rely on architectures that appropriately
support them. Thus, the combination of fog and cloud computing is emerging as
one potential solution. It can dynamically allocate the workload depending on
the specific needs of each application. Our main goal is to provide a highly
reliable and dynamic architecture, which minimizes the time that an end node or
user, for instance a car in a smart mobility application, spends in downloading
the required data. In order to achieve this, we have developed an optimal
distribution algorithm that decides, based on multiple parameters of the
proposed system model, the amount of information that should be stored at, or
retrieved from, each node to minimize the data download time. Our scheme
exploits Network Coding (NC) as a tool for data distribution, as a key enabler
of the proposed solution. We compare the performance of our proposed scheme
with other alternative solutions, and the results show that there is a clear
gain in terms of the download time.
","[{'version': 'v1', 'created': 'Mon, 2 Dec 2019 14:20:47 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Jan 2020 13:33:33 GMT'}]",2020-01-23,"[['Peralta', 'Goiuri', ''], ['Garrido', 'Pablo', ''], ['Bilbao', 'Josu', ''], ['Agüero', 'Ramón', ''], ['Crespo', 'Pedro M.', '']]","['distributed storage', 'fog', 'Industry 4.0', 'low latency', 'multi-cloud', 'network coding', 'reliability', 'smart mobility']"
4572,1403.7465,Nisheeth Joshi,"Iti Mathur, Nisheeth Joshi, Hemant Darbari and Ajai Kumar",Shiva: A Framework for Graph Based Ontology Matching,,"International Journal of Computer Applications 89(11):30-34, March
  2014",10.5120/15678-4435,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since long, corporations are looking for knowledge sources which can provide
structured description of data and can focus on meaning and shared
understanding. Structures which can facilitate open world assumptions and can
be flexible enough to incorporate and recognize more than one name for an
entity. A source whose major purpose is to facilitate human communication and
interoperability. Clearly, databases fail to provide these features and
ontologies have emerged as an alternative choice, but corporations working on
same domain tend to make different ontologies. The problem occurs when they
want to share their data/knowledge. Thus we need tools to merge ontologies into
one. This task is termed as ontology matching. This is an emerging area and
still we have to go a long way in having an ideal matcher which can produce
good results. In this paper we have shown a framework to matching ontologies
using graphs.
","[{'version': 'v1', 'created': 'Fri, 28 Mar 2014 18:00:13 GMT'}]",2014-03-31,"[['Mathur', 'Iti', ''], ['Joshi', 'Nisheeth', ''], ['Darbari', 'Hemant', ''], ['Kumar', 'Ajai', '']]","['Ontology Matching', 'Ontology Alignment', 'Graph Matching', 'Kuhn-Munkres Algorithm']"
4573,1603.05099,Jung-Su Ha Dr.,Jung-Su Ha and Soon-Seo Park and Han-Lim Choi,"Topology-Guided Path Integral Approach for Stochastic Optimal Control in
  Cluttered Environment",arXiv admin note: text overlap with arXiv:1510.05344,Robotics and Autonomous Systems 113 (2019) 81-93,10.1016/j.robot.2019.01.001,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses planning and control of robot motion under uncertainty
that is formulated as a continuous-time, continuous-space stochastic optimal
control problem, by developing a topology-guided path integral control method.
The path integral control framework, which forms the backbone of the proposed
method, re-writes the Hamilton-Jacobi-Bellman equation as a statistical
inference problem; the resulting inference problem is solved by a sampling
procedure that computes the distribution of controlled trajectories around the
trajectory by the passive dynamics. For motion control of robots in a highly
cluttered environment, however, this sampling can easily be trapped in a local
minimum unless the sample size is very large, since the global optimality of
local minima depends on the degree of uncertainty. Thus, a homology-embedded
sampling-based planner that identifies many (potentially) local-minimum
trajectories in different homology classes is developed to aid the sampling
process. In combination with a receding-horizon fashion of the optimal control
the proposed method produces a dynamically feasible and collision-free motion
plans without being trapped in a local minimum. Numerical examples on a
synthetic toy problem and on quadrotor control in a complex obstacle field
demonstrate the validity of the proposed method.
","[{'version': 'v1', 'created': 'Wed, 16 Mar 2016 13:49:37 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Aug 2018 10:21:49 GMT'}]",2022-08-01,"[['Ha', 'Jung-Su', ''], ['Park', 'Soon-Seo', ''], ['Choi', 'Han-Lim', '']]","['Stochastic Optimal Control', 'Topological Motion Planning', 'Linearly-Solvable Optimal Control', 'Multi-modality']"
4574,1301.1912,Ralph LaBarge,Ralph LaBarge and Thomas McGuire,Cloud Penetration Testing,"20 pages, 16 figures; International Journal on Cloud Computing:
  Services and Architecture (IJCCSA),Vol.2, No.6, December 2012",,10.5121/ijccsa.2012.2604,,cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the results of a series of penetration tests performed on
the OpenStack Essex Cloud Management Software. Several different types of
penetration tests were performed including network protocol and command line
fuzzing, session hijacking and credential theft. Using these techniques
exploitable vulnerabilities were discovered that could enable an attacker to
gain access to restricted information contained on the OpenStack server, or to
gain full administrative privileges on the server. Key recommendations to
address these vulnerabilities are to use a secure protocol, such as HTTPS, for
communications between a cloud user and the OpenStack Horizon Dashboard, to
encrypt all files that store user or administrative login credentials, and to
correct a software bug found in the OpenStack Cinder typedelete command.
","[{'version': 'v1', 'created': 'Wed, 9 Jan 2013 16:22:40 GMT'}]",2013-01-10,"[['LaBarge', 'Ralph', ''], ['McGuire', 'Thomas', '']]","['Cloud', 'Fuzzing', 'OpenStack', 'Penetration Testing', 'Vulnerability Detection']"
4575,1405.1873,Bojana Koteska,"Bojana Koteska, Anastas Misev",Change Management and Version Control of Scientific Applications,,"International Journal of Computer Science & Information Technology
  (IJCSIT) Vol 6, No 2, April 2014",10.5121/ijcsit.2014.6211,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The development process of scientific applications is largely dependent on
scientific progress and the experimental research results. Thus, dealing with
frequent changes is one of the main problems faced by the developers of
scientific software. Taking into account the results of the survey conducted
among scientists in the HP-SEE project, the implementation of change management
and version control software processes is inevitable. In this paper, we propose
software engineering principles that should be included in the development
process to improve the version control and change management. Moreover, we give
some specific recommendations for their implementation, thereby making a slight
modification of already generally accepted templates and methods. The
development steps practiced by scientists should not be replaced completely,
but they need to be supplemented with appropriate practices, documents and
formal methods. We also emphasize the reasons for the inclusion of these two
processes and the consequences that may arise as a result of their
non-application.
","[{'version': 'v1', 'created': 'Thu, 8 May 2014 10:49:43 GMT'}]",2014-05-09,"[['Koteska', 'Bojana', ''], ['Misev', 'Anastas', '']]","['Change Management', 'Scientific Application', 'Software Engineering', 'Software Version Control', 'Software Quality']"
4576,1503.09006,Michael Lippautz,"Martin Aigner, Christoph M. Kirsch, Michael Lippautz, Ana Sokolova","Fast, Multicore-Scalable, Low-Fragmentation Memory Allocation through
  Large Virtual Memory and Global Data Structures",,,10.1145/2814270.2814294,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We demonstrate that general-purpose memory allocation involving many threads
on many cores can be done with high performance, multicore scalability, and low
memory consumption. For this purpose, we have designed and implemented scalloc,
a concurrent allocator that generally performs and scales in our experiments
better than other allocators while using less memory, and is still competitive
otherwise. The main ideas behind the design of scalloc are: uniform treatment
of small and big objects through so-called virtual spans, efficiently and
effectively reclaiming free memory through fast and scalable global data
structures, and constant-time (modulo synchronization) allocation and
deallocation operations that trade off memory reuse and spatial locality
without being subject to false sharing.
","[{'version': 'v1', 'created': 'Tue, 31 Mar 2015 11:36:46 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Aug 2015 11:05:23 GMT'}]",2015-08-26,"[['Aigner', 'Martin', ''], ['Kirsch', 'Christoph M.', ''], ['Lippautz', 'Michael', ''], ['Sokolova', 'Ana', '']]","['Memory allocator', 'virtual memory', 'concurrentdata structures', 'multicore scalability']"
4577,1811.10337,Nejat Arinik,"Nejat Arinik, Rosa Figueiredo, Vincent Labatut","Multiple Partitioning of Multiplex Signed Networks: Application to
  European Parliament Votes","Social Networks, 2020, 60, 83 - 102",,10.1016/j.socnet.2019.02.001,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For more than a decade, graphs have been used to model the voting behavior
taking place in parliaments. However, the methods described in the literature
suffer from several limitations. The two main ones are that 1) they rely on
some temporal integration of the raw data, which causes some information loss,
and/or 2) they identify groups of antagonistic voters, but not the context
associated to their occurrence. In this article, we propose a novel method
taking advantage of multiplex signed graphs to solve both these issues. It
consists in first partitioning separately each layer, before grouping these
partitions by similarity. We show the interest of our approach by applying it
to a European Parliament dataset.
","[{'version': 'v1', 'created': 'Mon, 26 Nov 2018 12:52:36 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Apr 2019 16:23:14 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Dec 2019 19:53:10 GMT'}, {'version': 'v4', 'created': 'Sun, 5 Jan 2020 16:39:27 GMT'}]",2020-01-07,"[['Arinik', 'Nejat', ''], ['Figueiredo', 'Rosa', ''], ['Labatut', 'Vincent', '']]","['Signed Graph', 'Multiplex Graph', 'European Parliament', 'Graph Partitioning', 'CorrelationClustering', 'Structural Balance']"
4578,1805.09557,Andreu Vall,"Andreu Vall, Matthias Dorfer, Markus Schedl, Gerhard Widmer","A Hybrid Approach to Music Playlist Continuation Based on Playlist-Song
  Membership",,"Proceedings SAC 2018: Symposium on Applied Computing, April
  9-13,2018, Pau, France. ACM, New York, NY, USA",10.1145/3167132.3167280,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated music playlist continuation is a common task of music recommender
systems, that generally consists in providing a fitting extension to a given
playlist. Collaborative filtering models, that extract abstract patterns from
curated music playlists, tend to provide better playlist continuations than
content-based approaches. However, pure collaborative filtering models have at
least one of the following limitations: (1) they can only extend playlists
profiled at training time; (2) they misrepresent songs that occur in very few
playlists. We introduce a novel hybrid playlist continuation model based on
what we name ""playlist-song membership"", that is, whether a given playlist and
a given song fit together. The proposed model regards any playlist-song pair
exclusively in terms of feature vectors. In light of this information, and
after having been trained on a collection of labeled playlist-song pairs, the
proposed model decides whether a playlist-song pair fits together or not.
Experimental results on two datasets of curated music playlists show that the
proposed playlist continuation model compares to a state-of-the-art
collaborative filtering model in the ideal situation of extending playlists
profiled at training time and where songs occurred frequently in training
playlists. In contrast to the collaborative filtering model, and as a result of
its general understanding of the playlist-song pairs in terms of feature
vectors, the proposed model is additionally able to (1) extend non-profiled
playlists and (2) recommend songs that occurred seldom or never in
training~playlists.
","[{'version': 'v1', 'created': 'Thu, 24 May 2018 09:02:21 GMT'}]",2018-05-25,"[['Vall', 'Andreu', ''], ['Dorfer', 'Matthias', ''], ['Schedl', 'Markus', ''], ['Widmer', 'Gerhard', '']]","['automated music playlist continuation', 'hybrid recommender systems', 'music information retrieval', 'neural networks']"
4579,1212.2587,Abdelkrim Bouramoul,"Abdelkrim Bouramoul, Mohamed-Khireddine Kholladi, Bich-Li\^en Doan","An ontology-based approach for semantics ranking of the web search
  engines results","6 pages, 5 figures, appears in: (ICMCS), 2012 International
  Conference on Multimedia Computing and Systems, Print ISBN: 978-1-4673-1518-0","In The 3rd International Conference on Multimedia Computing and
  Systems, IEEE. 797-802, Tanger, Morocco, 2012",10.1109/ICMCS.2012.6320318,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work falls in the areas of information retrieval and semantic web, and
aims to improve the evaluation of web search tools. Indeed, the huge number of
information on the web as well as the growth of new inexperienced users creates
new challenges for information retrieval; certainly the current search engines
(such as Google, Bing and Yahoo) offer an efficient way to browse the web
content. However, this type of tool does not take into account the semantic
driven by the query terms and document words. This paper proposes a new
semantic based approach for the evaluation of information retrieval systems;
the goal is to increase the selectivity of search tools and to improve how
these tools are evaluated. The test of the proposed approach for the evaluation
of search engines has proved its applicability to real search tools. The
results showed that semantic evaluation is a promising way to improve the
performance and behavior of search engines as well as the relevance of the
results that they return.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2012 18:58:13 GMT'}]",2012-12-12,"[['Bouramoul', 'Abdelkrim', ''], ['Kholladi', 'Mohamed-Khireddine', ''], ['Doan', 'Bich-Liên', '']]","['Information Retrieval', 'Semantic Web', 'Ontology', 'Results Ranking', 'Web Search Engines']"
4580,1912.02997,Tomohiko Mizutani,Tomohiko Mizutani,Improved Analysis of Spectral Algorithm for Clustering,20 pages. Revised Theorem 4,"Optimization Letters, volume 15, pages 1303-1325 (2021)",10.1007/s11590-020-01639-3,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spectral algorithms are graph partitioning algorithms that partition a node
set of a graph into groups by using a spectral embedding map. Clustering
techniques based on the algorithms are referred to as spectral clustering and
are widely used in data analysis. To gain a better understanding of why
spectral clustering is successful, Peng et al. (2015) and Kolev and Mehlhorn
(2016) studied the behavior of a certain type of spectral algorithm for a class
of graphs, called well-clustered graphs. Specifically, they put an assumption
on graphs and showed the performance guarantee of the spectral algorithm under
it. The algorithm they studied used the spectral embedding map developed by Shi
and Malic (2000). In this paper, we improve on their results, giving a better
performance guarantee under a weaker assumption. We also evaluate the
performance of the spectral algorithm with the spectral embedding map developed
by Ng et al. (2001).
","[{'version': 'v1', 'created': 'Fri, 6 Dec 2019 06:32:14 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Jun 2020 15:59:34 GMT'}, {'version': 'v3', 'created': 'Mon, 7 Sep 2020 07:29:45 GMT'}]",2021-09-08,"[['Mizutani', 'Tomohiko', '']]","['spectral algorithm', 'clustering', 'graph partitioning', 'performance guarantee']"
4581,1607.00208,Thiagarajan Hema,T. Hema and K.S. Easwarakumar,An Optimal Algorithm for Range Search on Multidimensional Points,,"Asian Journal of Information Technology, 15:11,1723-1730, 2016",10.3923/ajit.2016.1723.1730,,cs.CG cs.DS,http://creativecommons.org/publicdomain/zero/1.0/,"  This paper proposes an efficient and novel method to address range search on
multidimensional points in $\theta(t)$ time, where $t$ is the number of points
reported in $\Re^k$ space. This is accomplished by introducing a new data
structure, called BITS $k$d-tree. This structure also supports fast updation
that takes $\theta(1)$ time for insertion and $O(\log n)$ time for deletion.
The earlier best known algorithm for this problem is $O(\log^k n+t)$ time in
the pointer machine model.
","[{'version': 'v1', 'created': 'Fri, 1 Jul 2016 11:36:17 GMT'}]",2016-07-04,"[['Hema', 'T.', ''], ['Easwarakumar', 'K. S.', '']]","['BITS kd-tree', 'Threaded Trie', 'Range Search']"
4582,1807.11234,Jeffrey Ede BSc MPhys,Jeffrey M. Ede,"Improving Electron Micrograph Signal-to-Noise with an Atrous
  Convolutional Encoder-Decoder","15 pages, 10 figures, 1 table","Ultramicroscopy 202 (2019), pp.18-25",10.1016/j.ultramic.2019.03.017,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  We present an atrous convolutional encoder-decoder trained to denoise
512$\times$512 crops from electron micrographs. It consists of a modified
Xception backbone, atrous convoltional spatial pyramid pooling module and a
multi-stage decoder. Our neural network was trained end-to-end to remove
Poisson noise applied to low-dose ($\ll$ 300 counts ppx) micrographs created
from a new dataset of 17267 2048$\times$2048 high-dose ($>$ 2500 counts ppx)
micrographs and then fine-tuned for ordinary doses (200-2500 counts ppx). Its
performance is benchmarked against bilateral, non-local means, total variation,
wavelet, Wiener and other restoration methods with their default parameters.
Our network outperforms their best mean squared error and structural similarity
index performances by 24.6% and 9.6% for low doses and by 43.7% and 5.5% for
ordinary doses. In both cases, our network's mean squared error has the lowest
variance. Source code and links to our new high-quality dataset and trained
network have been made publicly available at
https://github.com/Jeffrey-Ede/Electron-Micrograph-Denoiser
","[{'version': 'v1', 'created': 'Mon, 30 Jul 2018 08:48:32 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Nov 2018 10:37:59 GMT'}]",2020-05-21,"[['Ede', 'Jeffrey M.', '']]","['deep learning', 'denoising', 'electron microscopy', 'low dose']"
4583,1803.08395,Philipp Jordan,"Philipp Jordan, Omar Mubin, Mohammad Obaid, Paula Alexandra Silva",Exploring the Referral and Usage of Science Fiction in HCI Literature,"v1: 20 pages, 4 figures, 3 tables, HCI International 2018 accepted
  submission v2: 20 pages, 4 figures, 3 tables, added link/doi for Springer
  proceeding",,10.1007/978-3-319-91803-7_2,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Research on science fiction (sci-fi) in scientific publications has indicated
the usage of sci-fi stories, movies or shows to inspire novel Human-Computer
Interaction (HCI) research. Yet no studies have analysed sci-fi in a top-ranked
computer science conference at present. For that reason, we examine the CHI
main track for the presence and nature of sci-fi referrals in relationship to
HCI research. We search for six sci-fi terms in a dataset of 5812 CHI main
proceedings and code the context of 175 sci-fi referrals in 83 papers indexed
in the CHI main track. In our results, we categorize these papers into five
contemporary HCI research themes wherein sci-fi and HCI interconnect: 1)
Theoretical Design Research; 2) New Interactions; 3) Human-Body Modification or
Extension; 4) Human-Robot Interaction and Artificial Intelligence; and 5)
Visions of Computing and HCI. In conclusion, we discuss results and
implications located in the promising arena of sci-fi and HCI research.
","[{'version': 'v1', 'created': 'Thu, 22 Mar 2018 15:08:09 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Jul 2018 08:58:06 GMT'}]",2018-07-26,"[['Jordan', 'Philipp', ''], ['Mubin', 'Omar', ''], ['Obaid', 'Mohammad', ''], ['Silva', 'Paula Alexandra', '']]","['Design fiction', 'Future visions', 'HCI inspiraton', 'Popular culture in science', 'Science fiction']"
4584,1304.5022,Shalvi Dave D,"Shalvi Dave, Bhushan Trivedi, Jimit Mahadevia","Efficacy of Attack detection capability of IDPS based on it's deployment
  in wired and wireless environment","13 pages, 10 figures","International Journal of Network Security & Its Applications
  (IJNSA), Vol.5, No.2, March 2013",10.5121/ijnsa.2013.5208,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intrusion Detection and/or Prevention Systems (IDPS) represent an important
line of defence against a variety of attacks that can compromise the security
and proper functioning of an enterprise information system. Along with the
widespread evolution of new emerging services, the quantity and impact of
attacks have continuously increased, attackers continuously find
vulnerabilities at various levels, from the network itself to operating system
and applications, exploit them to crack system and services. Network defence
and network monitoring has become an essential component of computer security
to predict and prevent attacks. Unlike traditional Intrusion Detection System
(IDS), Intrusion Detection and Prevention System (IDPS) have additional
features to secure computer networks. In this paper, we present a detailed
study of how deployment of an IDPS plays a key role in its performance and the
ability to detect and prevent known as well as unknown attacks. We categorize
IDPS based on deployment as Network-based, host-based, and Perimeter-based and
Hybrid. A detailed comparison is shown in this paper and finally we justify our
proposed solution, which deploys agents at host-level to give better
performance in terms of reduced rate of false positives and accurate detection
and prevention.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2013 05:36:45 GMT'}]",2013-04-19,"[['Dave', 'Shalvi', ''], ['Trivedi', 'Bhushan', ''], ['Mahadevia', 'Jimit', '']]","['Intrusion Prevention', 'TCP re-assembly', 'IDPS sensors/agents', 'Host-based IDPS', 'network-based IDPS', 'Perimeter-based IDPS', 'Hybrid IDPS']"
4585,1908.04353,Dong Cao,"Dong Cao, Lisha Xu, HaiBo Chen","Action Recognition in Untrimmed Videos with Composite Self-Attention
  Two-Stream Framework",Accepted to ACPR 2019,,10.1007/978-3-030-41299-9_3,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rapid development of deep learning algorithms, action recognition in
video has achieved many important research results. One issue in action
recognition, Zero-Shot Action Recognition (ZSAR), has recently attracted
considerable attention, which classify new categories without any positive
examples. Another difficulty in action recognition is that untrimmed data may
seriously affect model performance. We propose a composite two-stream framework
with a pre-trained model. Our proposed framework includes a classifier branch
and a composite feature branch. The graph network model is adopted in each of
the two branches, which effectively improves the feature extraction and
reasoning ability of the framework. In the composite feature branch, a
3-channel self-attention models are constructed to weight each frame in the
video and give more attention to the key frames. Each self-attention models
channel outputs a set of attention weights to focus on a particular aspect of
the video, and a set of attention weights corresponds to a one-dimensional
vector. The 3-channel self-attention models can evaluate key frames from
multiple aspects, and the output sets of attention weight vectors form an
attention matrix, which effectively enhances the attention of key frames with
strong correlation of action. This model can implement action recognition under
zero-shot conditions, and has good recognition performance for untrimmed video
data. Experimental results on relevant data sets confirm the validity of our
model.
","[{'version': 'v1', 'created': 'Sun, 4 Aug 2019 02:44:37 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Sep 2019 05:36:11 GMT'}]",2020-04-24,"[['Cao', 'Dong', ''], ['Xu', 'Lisha', ''], ['Chen', 'HaiBo', '']]","['Action recognition', 'Self-attention', 'Graph Network']"
4586,1403.2431,Gabriele Fici,"Gabriele Fici, Travis Gagie, Juha K\""arkk\""ainen, Dominik Kempa",A Subquadratic Algorithm for Minimum Palindromic Factorization,Accepted for publication in Journal of Discrete Algorithms,,10.1016/j.jda.2014.08.001,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give an $\mathcal{O}(n \log n)$-time, $\mathcal{O}(n)$-space algorithm for
factoring a string into the minimum number of palindromic substrings. That is,
given a string $S [1..n]$, in $\mathcal{O}(n \log n)$ time our algorithm
returns the minimum number of palindromes $S_1,\ldots, S_\ell$ such that $S =
S_1 \cdots S_\ell$. We also show that the time complexity is $\mathcal{O}(n)$
on average and $\Omega(n\log n)$ in the worst case. The last result is based on
a characterization of the palindromic structure of Zimin words.
","[{'version': 'v1', 'created': 'Mon, 10 Mar 2014 22:18:40 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Aug 2014 09:52:23 GMT'}]",2020-12-15,"[['Fici', 'Gabriele', ''], ['Gagie', 'Travis', ''], ['Kärkkäinen', 'Juha', ''], ['Kempa', 'Dominik', '']]","['string algorithms', 'palindromes', 'factorization']"
4587,1809.00212,Mateusz Trokielewicz,Mateusz Trokielewicz and Adam Czajka and Piotr Maciejewicz,"Database of iris images acquired in the presence of ocular pathologies
  and assessment of iris recognition reliability for disease-affected eyes",,"2015 IEEE 2nd International Conference on Cybernetics (CYBCONF),
  Gdynia, 2015, pp. 495-500",10.1109/CYBConf.2015.7175984,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a database of iris images collected from disease affected
eyes and an analysis related to the influence of ocular diseases on iris
recognition reliability. For that purpose we have collected a database of iris
images acquired for 91 different eyes during routine ophthalmology visits. This
collection gathers samples for healthy eyes as well as those with various eye
pathologies, including cataract, acute glaucoma, posterior and anterior
synechiae, retinal detachment, rubeosis iridis, corneal vascularization,
corneal grafting, iris damage and atrophy and corneal ulcers, haze or
opacities. To our best knowledge this is the first database of such kind that
will be made publicly available. In the analysis the data were divided into
five groups of samples presenting similar anticipated impact on iris
recognition: 1) healthy (no impact), 2) unaffected, clear iris (although the
illness was detected), 3) geometrically distorted irides, 4) distorted iris
tissue and 5) obstructed iris tissue. Three different iris recognition methods
(MIRLIN, VeriEye and OSIRIS) were then used to find differences in average
genuine and impostor comparison scores calculated for healthy eyes and those
impacted by a disease. Specifically, we obtained significantly worse genuine
comparison scores for all iris matchers and all disease-affected eyes when
compared to a group of healthy eyes, what have a high potential of impacting
false non-match rate.
","[{'version': 'v1', 'created': 'Sat, 1 Sep 2018 15:47:23 GMT'}]",2018-09-05,"[['Trokielewicz', 'Mateusz', ''], ['Czajka', 'Adam', ''], ['Maciejewicz', 'Piotr', '']]","['iris recognition', 'eye conditions', 'iris image databases', 'performance evaluation']"
4588,1801.05604,Christos Liaskos K.,"A. Tsioliaridou, C. Liaskos, E. Dedu, S. Ioannidis","Packet Routing in 3D Nanonetworks: A Lightweight, Linear-path Scheme",,"Volume 12, June 2017, Pages 63-71",10.1016/j.nancom.2017.01.001,,cs.NI cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Packet routing in nanonetworks requires novel approaches, which can cope with
the extreme limitations posed by the nano-scale. Highly lossy wireless
channels, extremely limited hardware capabilities and non-unique node
identifiers are among the restrictions. The present work offers an addressing
and routing solution for static 3D nanonetworks that find applications in
material monitoring and programmatic property tuning. The addressing process
relies on virtual coordinates from multiple, alternative anchor point sets that
act as \emph{viewports}. Each viewport offers different address granularity
within the network space, and its selection is optimized by a packet sending
node using a novel heuristic. Regarding routing, each node can deduce whether
it is located on the linear segment connecting the sender to the recipient
node. This deduction is made using integer calculations, node-local information
and in a stateless manner, minimizing the computational and storage overhead of
the proposed scheme. Most importantly, the nodes can regulate the width of the
linear path, thus trading energy efficiency (redundant transmissions) for
increased path diversity. This trait can enable future adaptive routing
schemes. Extensive evaluation via simulations highlights the advantages of the
novel scheme over related approaches.
","[{'version': 'v1', 'created': 'Wed, 17 Jan 2018 09:38:37 GMT'}]",2018-01-18,"[['Tsioliaridou', 'A.', ''], ['Liaskos', 'C.', ''], ['Dedu', 'E.', ''], ['Ioannidis', 'S.', '']]","['Electromagnetic nano-networking', 'multi-hop communication', 'packet routing']"
4589,1301.6898,Lydia Ostermeier,"Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler","Square Property, Equitable Partitions, and Product-like Graphs","20 pages, 6 figures",,10.1016/j.disc.2013.12.012,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Equivalence relations on the edge set of a graph $G$ that satisfy restrictive
conditions on chordless squares play a crucial role in the theory of Cartesian
graph products and graph bundles. We show here that such relations in a natural
way induce equitable partitions on the vertex set of $G$, which in turn give
rise to quotient graphs that can have a rich product structure even if $G$
itself is prime.
","[{'version': 'v1', 'created': 'Tue, 29 Jan 2013 11:38:47 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Sep 2013 15:27:20 GMT'}]",2014-07-14,"[['Hellmuth', 'Marc', ''], ['Ostermeier', 'Lydia', ''], ['Stadler', 'Peter F.', '']]","['square property', 'unique square property', 'USP-relation', 'quotient graph', 'equitable partition', 'Cartesian graph product']"
4590,1605.06180,Adnan Anwar,"Adnan Anwar, Abdun Naser Mahmood, Mark Pickering","Modeling and performance evaluation of stealthy false data injection
  attacks on smart grid in the presence of corrupted measurements","Keywords: Smart grid, False data injection, Blind attack, Principal
  component analysis (PCA), Journal of Computer and System Sciences, Elsevier,
  2016",,10.1016/j.jcss.2016.04.005.,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The false data injection (FDI) attack cannot be detected by the traditional
anomaly detection techniques used in the energy system state estimators. In
this paper, we demonstrate how FDI attacks can be constructed blindly, i.e.,
without system knowledge, including topological connectivity and line reactance
information. Our analysis reveals that existing FDI attacks become detectable
(consequently unsuccessful) by the state estimator if the data contains grossly
corrupted measurements such as device malfunction and communication errors. The
proposed sparse optimization based stealthy attacks construction strategy
overcomes this limitation by separating the gross errors from the measurement
matrix. Extensive theoretical modeling and experimental evaluation show that
the proposed technique performs more stealthily (has less relative error) and
efficiently (fast enough to maintain time requirement) compared to other
methods on IEEE benchmark test systems.
","[{'version': 'v1', 'created': 'Fri, 20 May 2016 00:27:50 GMT'}]",2016-05-23,"[['Anwar', 'Adnan', ''], ['Mahmood', 'Abdun Naser', ''], ['Pickering', 'Mark', '']]","['Smart grid', 'false data injection', 'blind attack', 'principal component analysis (PCA)']"
4591,1406.3103,Wei Kang,"Wei Kang, Daming Cao, Nan Liu",Deception with Side Information in Biometric Authentication Systems,Submitted to IEEE Transactions on Information Theory,,10.1109/TIT.2015.2389825,,cs.IT cs.CR math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the probability of successful deception of an
uncompressed biometric authentication system with side information at the
adversary. It represents the scenario where the adversary may have correlated
side information, e.g.,~a partial finger print or a DNA sequence of a relative
of the legitimate user. We find the optimal exponent of the deception
probability by proving both the achievability and the converse. Our proofs are
based on the connection between the problem of deception with side information
and the rate distortion problem with side information at both the encoder and
decoder.
","[{'version': 'v1', 'created': 'Thu, 12 Jun 2014 02:17:55 GMT'}]",2016-11-18,"[['Kang', 'Wei', ''], ['Cao', 'Daming', ''], ['Liu', 'Nan', '']]","['Information theoretical security', 'Biometric authentication', 'Side information', 'Permu']"
4592,2010.01497,Shehroze Farooqi,"Shehroze Farooqi, \'Alvaro Feal, Tobias Lauinger, Damon McCoy, Zubair
  Shafiq, Narseo Vallina-Rodriguez",Understanding Incentivized Mobile App Installs on Google Play Store,,ACM Internet Measurement Conference (2020),10.1145/3419394.3423662,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  ""Incentivized"" advertising platforms allow mobile app developers to acquire
new users by directly paying users to install and engage with mobile apps
(e.g., create an account, make in-app purchases). Incentivized installs are
banned by the Apple App Store and discouraged by the Google Play Store because
they can manipulate app store metrics (e.g., install counts, appearance in top
charts). Yet, many organizations still offer incentivized install services for
Android apps. In this paper, we present the first study to understand the
ecosystem of incentivized mobile app install campaigns in Android and its
broader ramifications through a series of measurements. We identify
incentivized install campaigns that require users to install an app and perform
in-app tasks targeting manipulation of a wide variety of user engagement
metrics (e.g., daily active users, user session lengths) and revenue. Our
results suggest that these artificially inflated metrics can be effective in
improving app store metrics as well as helping mobile app developers to attract
funding from venture capitalists. Our study also indicates lax enforcement of
the Google Play Store's existing policies to prevent these behaviors. It
further motivates the need for stricter policing of incentivized install
campaigns. Our proposed measurements can also be leveraged by the Google Play
Store to identify potential policy violations.
","[{'version': 'v1', 'created': 'Sun, 4 Oct 2020 07:27:28 GMT'}]",2020-10-06,"[['Farooqi', 'Shehroze', ''], ['Feal', 'Álvaro', ''], ['Lauinger', 'Tobias', ''], ['McCoy', 'Damon', ''], ['Shafiq', 'Zubair', ''], ['Vallina-Rodriguez', 'Narseo', '']]","['Mobile apps', 'Incentivized Installs', 'Spam Installs', 'Reputation Manipulation']"
4593,1505.00314,Nirav Bhatt,Shankar Narasimhan and Nirav Bhatt,"Deconstructing Principal Component Analysis Using a Data Reconciliation
  Perspective",,Computers and Chemical Engineering 77 (2015) 74-84,10.1016/j.compchemeng.2015.03.016,,cs.LG cs.SY stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data reconciliation (DR) and Principal Component Analysis (PCA) are two
popular data analysis techniques in process industries. Data reconciliation is
used to obtain accurate and consistent estimates of variables and parameters
from erroneous measurements. PCA is primarily used as a method for reducing the
dimensionality of high dimensional data and as a preprocessing technique for
denoising measurements. These techniques have been developed and deployed
independently of each other. The primary purpose of this article is to
elucidate the close relationship between these two seemingly disparate
techniques. This leads to a unified framework for applying PCA and DR. Further,
we show how the two techniques can be deployed together in a collaborative and
consistent manner to process data. The framework has been extended to deal with
partially measured systems and to incorporate partial knowledge available about
the process model.
","[{'version': 'v1', 'created': 'Sat, 2 May 2015 06:20:08 GMT'}]",2015-05-05,"[['Narasimhan', 'Shankar', ''], ['Bhatt', 'Nirav', '']]","['Data reconciliation', 'Principal component analysis', 'Model identification', 'Estimation', 'Denoising']"
4594,1707.06372,Yi Tay,"Yi Tay, Minh C. Phan, Luu Anh Tuan, Siu Cheung Hui","Learning to Rank Question Answer Pairs with Holographic Dual LSTM
  Architecture",SIGIR 2017 Full Paper,,10.1145/3077136.3080790,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a new deep learning architecture for learning to rank question
answer pairs. Our approach extends the long short-term memory (LSTM) network
with holographic composition to model the relationship between question and
answer representations. As opposed to the neural tensor layer that has been
adopted recently, the holographic composition provides the benefits of scalable
and rich representational learning approach without incurring huge parameter
costs. Overall, we present Holographic Dual LSTM (HD-LSTM), a unified
architecture for both deep sentence modeling and semantic matching.
Essentially, our model is trained end-to-end whereby the parameters of the LSTM
are optimized in a way that best explains the correlation between question and
answer representations. In addition, our proposed deep learning architecture
requires no extensive feature engineering. Via extensive experiments, we show
that HD-LSTM outperforms many other neural architectures on two popular
benchmark QA datasets. Empirical studies confirm the effectiveness of
holographic composition over the neural tensor layer.
","[{'version': 'v1', 'created': 'Thu, 20 Jul 2017 04:47:00 GMT'}]",2017-07-21,"[['Tay', 'Yi', ''], ['Phan', 'Minh C.', ''], ['Tuan', 'Luu Anh', ''], ['Hui', 'Siu Cheung', '']]","['Deep Learning', 'Long Short-Term Memory', 'Learning to Rank', 'Qestion Answering']"
4595,1504.06049,Michael Ruderman,Michael Ruderman,"State-space formulation of scalar Preisach hysteresis model for rapid
  computation in time domain",,,10.1016/j.apm.2015.09.065,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A state-space formulation of classical scalar Preisach model (CSPM) of
hysteresis is proposed. The introduced state dynamics and memory interface
allow to use the state equation, which is rapid in calculation, instead of the
original Preisach equation. The main benefit of the proposed modeling approach
is the reduced computational effort which requires only a single integration
over the instantaneous line segment in the Preisach plane. Numerical
evaluations of the computation time and model accuracy are provided in
comparison to the CSPM which is taken as a reference model.
","[{'version': 'v1', 'created': 'Thu, 23 Apr 2015 06:15:08 GMT'}]",2017-05-02,"[['Ruderman', 'Michael', '']]","['Preisach model', 'scalar hysteresis map', 'nonlinear state dynamics', 'hysteresis behavior']"
4596,1504.07135,Homa Alemzadeh,"Homa Alemzadeh, Daniel Chen, Andrew Lewis, Zbigniew Kalbarczyk,
  Jaishankar Raman, Nancy Leveson, and Ravishankar K. Iyer",Systems-theoretic Safety Assessment of Robotic Telesurgical Systems,"Revise based on reviewers feedback. To appear in the the
  International Conference on Computer Safety, Reliability, and Security
  (SAFECOMP) 2015",,10.1007/978-3-319-24255-2_16,,cs.RO cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robotic telesurgical systems are one of the most complex medical
cyber-physical systems on the market, and have been used in over 1.75 million
procedures during the last decade. Despite significant improvements in design
of robotic surgical systems through the years, there have been ongoing
occurrences of safety incidents during procedures that negatively impact
patients. This paper presents an approach for systems-theoretic safety
assessment of robotic telesurgical systems using software-implemented
fault-injection. We used a systemstheoretic hazard analysis technique (STPA) to
identify the potential safety hazard scenarios and their contributing causes in
RAVEN II robot, an open-source robotic surgical platform. We integrated the
robot control software with a softwareimplemented fault-injection engine which
measures the resilience of the system to the identified safety hazard scenarios
by automatically inserting faults into different parts of the robot control
software. Representative hazard scenarios from real robotic surgery incidents
reported to the U.S. Food and Drug Administration (FDA) MAUDE database were
used to demonstrate the feasibility of the proposed approach for safety-based
design of robotic telesurgical systems.
","[{'version': 'v1', 'created': 'Mon, 27 Apr 2015 15:39:17 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Jul 2015 23:09:20 GMT'}]",2021-06-22,"[['Alemzadeh', 'Homa', ''], ['Chen', 'Daniel', ''], ['Lewis', 'Andrew', ''], ['Kalbarczyk', 'Zbigniew', ''], ['Raman', 'Jaishankar', ''], ['Leveson', 'Nancy', ''], ['Iyer', 'Ravishankar K.', '']]","['Hazard Analysis', 'System Safety', 'STAMP', 'STPA', 'Fault Injection', 'Robotic Surgery', 'Telerobotics', 'FDA MAUDE Database']"
4597,1407.1539,Philipp Mayr,"Thomas L\""uke, Philipp Schaer, Philipp Mayr",A Framework for Specific Term Recommendation Systems,"2 pages, 1 figure, SIGIR 13, July 28-August 1, 2013, Dublin, Ireland",,10.1145/2484028.2484207,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present the IRSA framework that enables the automatic
creation of search term suggestion or recommendation systems (TS). Such TS are
used to operationalize interactive query expansion and help users in refining
their information need in the query formulation phase. Our recent research has
shown TS to be more effective when specific to a certain domain. The presented
technical framework allows owners of Digital Libraries to create their own
specific TS constructed via OAI-harvested metadata with very little effort.
","[{'version': 'v1', 'created': 'Sun, 6 Jul 2014 20:14:08 GMT'}]",2017-05-03,"[['Lüke', 'Thomas', ''], ['Schaer', 'Philipp', ''], ['Mayr', 'Philipp', '']]","['Co-occurrence analysis', 'Digital libraries', 'Open data', 'Search term suggestion', 'Thesauri', 'Web service']"
4598,1502.02481,Shahbaz Khan,"Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary and Shahbaz
  Khan",Dynamic DFS Tree in Undirected Graphs: breaking the $O(m)$ barrier,"27 pages, SODA 2016",,10.1137/1.9781611974331.ch52,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Depth first search (DFS) tree is a fundamental data structure for solving
various problems in graphs. It is well known that it takes $O(m+n)$ time to
build a DFS tree for a given undirected graph $G=(V,E)$ on $n$ vertices and $m$
edges. We address the problem of maintaining a DFS tree when the graph is
undergoing {\em updates} (insertion and deletion of vertices or edges). We
present the following results for this problem.
  (a) Fault tolerant DFS tree: There exists a data structure of size ${O}(m
~polylog~ n)$ such that given any set ${\cal F}$ of failed vertices or edges, a
DFS tree of the graph $G\setminus {\cal F}$ can be reported in ${O}(n|{\cal F}|
~polylog~ n)$ time.
  (b) Fully dynamic DFS tree: There exists a fully dynamic algorithm for
maintaining a DFS tree that takes worst case ${O}(\sqrt{mn} ~polylog~ n)$ time
per update for any arbitrary online sequence of updates.
  (c) Incremental DFS tree: Given any arbitrary online sequence of edge
insertions, we can maintain a DFS tree in ${O}(n ~polylog~ n)$ worst case time
per edge insertion.
  These are the first $o(m)$ worst case time results for maintaining a DFS tree
in a dynamic environment. Moreover, our fully dynamic algorithm provides, in a
seamless manner, the first deterministic algorithm with $O(1)$ query time and
$o(m)$ worst case update time for the dynamic subgraph connectivity,
biconnectivity, and 2-edge connectivity.
","[{'version': 'v1', 'created': 'Mon, 9 Feb 2015 13:36:20 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Apr 2015 10:11:02 GMT'}, {'version': 'v3', 'created': 'Mon, 28 Dec 2015 17:34:08 GMT'}, {'version': 'v4', 'created': 'Wed, 7 Feb 2018 15:42:54 GMT'}]",2018-02-08,"[['Baswana', 'Surender', ''], ['Chaudhury', 'Shreejit Ray', ''], ['Choudhary', 'Keerti', ''], ['Khan', 'Shahbaz', '']]","['Depth First Search', 'DFS', 'Dynamic Graph Algorithm']"
4599,1611.06937,Jonathan Suen,Jonathan Y. Suen and Saket Navlakha,"Using inspiration from synaptic plasticity rules to optimize traffic
  flow in distributed engineered networks","43 pages, 5 Figures. Submitted to Neural Computation",Neural Comput. 29(5) (2017) 1204-1228,10.1162/NECO_a_00945,,cs.NE q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Controlling the flow and routing of data is a fundamental problem in many
distributed networks, including transportation systems, integrated circuits,
and the Internet. In the brain, synaptic plasticity rules have been discovered
that regulate network activity in response to environmental inputs, which
enable circuits to be stable yet flexible. Here, we develop a new
neuro-inspired model for network flow control that only depends on modifying
edge weights in an activity-dependent manner. We show how two fundamental
plasticity rules (long-term potentiation and long-term depression) can be cast
as a distributed gradient descent algorithm for regulating traffic flow in
engineered networks. We then characterize, both via simulation and
analytically, how different forms of edge-weight update rules affect network
routing efficiency and robustness. We find a close correspondence between
certain classes of synaptic weight update rules derived experimentally in the
brain and rules commonly used in engineering, suggesting common principles to
both.
","[{'version': 'v1', 'created': 'Mon, 21 Nov 2016 18:38:17 GMT'}]",2017-04-18,"[['Suen', 'Jonathan Y.', ''], ['Navlakha', 'Saket', '']]","['synaptic plasticity', 'distributed networks', 'flow control']"
4600,1803.01632,Andrew Adamatzky,"Andrew Adamatzky, Neil Phillips, Roshan Weerasekera,
  Michail-Antisthenis Tsompanas, Georgios Ch. Sirakoulis",Excitable London: Street map analysis with Oregonator model,,"Phys. Rev. E 98, 012306 (2018)",10.1103/PhysRevE.98.012306,,cs.ET nlin.PS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore geometry of London's streets using computational mode of an
excitable chemical system, Belousov-Zhabotinsky (BZ) medium. We virtually fill
in the streets with a BZ medium and study propagation of excitation waves for a
range of excitability parameters, gradual transition from excitable to
sub-excitable to non-excitable. We demonstrate a pruning strategy adopted by
the medium with decreasing excitability when wider and ballistically
appropriate streets are selected. We explain mechanics of streets selection and
pruning. The results of the paper will be used in future studies of studying
dynamics of cities with living excitable substrates.
","[{'version': 'v1', 'created': 'Mon, 5 Mar 2018 12:35:57 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Mar 2018 11:09:22 GMT'}]",2018-07-18,"[['Adamatzky', 'Andrew', ''], ['Phillips', 'Neil', ''], ['Weerasekera', 'Roshan', ''], ['Tsompanas', 'Michail-Antisthenis', ''], ['Sirakoulis', 'Georgios Ch.', '']]","['Living city', 'excitable medium', 'Oregonator', 'Belousov-Zhabotinskymedium', 'street map']"
4601,1711.07863,Luiz Capretz Dr.,"Abdul Rehman Gilal, Jafreezal Jaafar, Luiz Fernando Capretz, Mazni
  Omar, Izzatdin Abdul Aziz","Finding an Effective Classification Technique to Develop a Software Team
  Composition Model",12 pages,"Journal of Software: Evolution and Process, 29(10), October 2017",10.1002/smr.1920,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ineffective software team composition has become recognized as a prominent
aspect of software project failures. Reports from results extracted from
different theoretical personality models have produced contradicting fits,
validity challenges, and missing guidance during software development personnel
selection. It is also believed that the technique/s used while developing a
model can impact the overall results. Thus, this study aims to: 1) discover an
effective classification technique to solve the problem, and 2) develop a model
for composition of the software development team. The model developed was
composed of three predictors: team role, personality types, and gender
variables; it also contained one outcome: team performance variable. The
techniques used for model development were logistic regression, decision tree,
and Rough Sets Theory (RST). Higher prediction accuracy and reduced pattern
complexity were the two parameters for selecting the effective technique. Based
on the results, the Johnson Algorithm (JA) of RST appeared to be an effective
technique for a team composition model. The study has proposed a set of 24
decision rules for finding effective team members. These rules involve gender
classification to highlight the appropriate personality profile for software
developers. In the end, this study concludes that selecting an appropriate
classification technique is one of the most important factors in developing
effective models.
","[{'version': 'v1', 'created': 'Tue, 21 Nov 2017 16:06:02 GMT'}]",2017-11-22,"[['Gilal', 'Abdul Rehman', ''], ['Jaafar', 'Jafreezal', ''], ['Capretz', 'Luiz Fernando', ''], ['Omar', 'Mazni', ''], ['Aziz', 'Izzatdin Abdul', '']]","['software development', 'team composition', 'classification technique', 'personality', 'Rough set']"
4602,1901.06032,Asifullah Khan,"Asifullah Khan, Anabia Sohail, Umme Zahoora, and Aqsa Saeed Qureshi","A Survey of the Recent Architectures of Deep Convolutional Neural
  Networks","Number of Pages: 70, Number of Figures: 11, Number of Tables: 11.
  Artif Intell Rev (2020)",,10.1007/s10462-020-09825-6,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep Convolutional Neural Network (CNN) is a special type of Neural Networks,
which has shown exemplary performance on several competitions related to
Computer Vision and Image Processing. Some of the exciting application areas of
CNN include Image Classification and Segmentation, Object Detection, Video
Processing, Natural Language Processing, and Speech Recognition. The powerful
learning ability of deep CNN is primarily due to the use of multiple feature
extraction stages that can automatically learn representations from the data.
The availability of a large amount of data and improvement in the hardware
technology has accelerated the research in CNNs, and recently interesting deep
CNN architectures have been reported. Several inspiring ideas to bring
advancements in CNNs have been explored, such as the use of different
activation and loss functions, parameter optimization, regularization, and
architectural innovations. However, the significant improvement in the
representational capacity of the deep CNN is achieved through architectural
innovations. Notably, the ideas of exploiting spatial and channel information,
depth and width of architecture, and multi-path information processing have
gained substantial attention. Similarly, the idea of using a block of layers as
a structural unit is also gaining popularity. This survey thus focuses on the
intrinsic taxonomy present in the recently reported deep CNN architectures and,
consequently, classifies the recent innovations in CNN architectures into seven
different categories. These seven categories are based on spatial exploitation,
depth, multi-path, width, feature-map exploitation, channel boosting, and
attention. Additionally, the elementary understanding of CNN components,
current challenges, and applications of CNN are also provided.
","[{'version': 'v1', 'created': 'Thu, 17 Jan 2019 23:20:23 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Apr 2019 03:10:29 GMT'}, {'version': 'v3', 'created': 'Thu, 3 Oct 2019 04:49:30 GMT'}, {'version': 'v4', 'created': 'Thu, 2 Jan 2020 07:52:04 GMT'}, {'version': 'v5', 'created': 'Wed, 12 Feb 2020 05:27:04 GMT'}, {'version': 'v6', 'created': 'Fri, 20 Mar 2020 14:47:20 GMT'}, {'version': 'v7', 'created': 'Sun, 10 May 2020 12:43:40 GMT'}]",2020-05-12,"[['Khan', 'Asifullah', ''], ['Sohail', 'Anabia', ''], ['Zahoora', 'Umme', ''], ['Qureshi', 'Aqsa Saeed', '']]","['Deep Learning', 'Convolutional Neural Networks', 'Taxonomy', 'Representational']"
4603,1304.0567,Antonis Loizou Ph.D.,Antonis Loizou and Paul Groth,On the Formulation of Performant SPARQL Queries,,,10.1016/j.websem.2014.11.003,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The combination of the flexibility of RDF and the expressiveness of SPARQL
provides a powerful mechanism to model, integrate and query data. However,
these properties also mean that it is nontrivial to write performant SPARQL
queries. Indeed, it is quite easy to create queries that tax even the most
optimised triple stores. Currently, application developers have little concrete
guidance on how to write ""good"" queries. The goal of this paper is to begin to
bridge this gap. It describes 5 heuristics that can be applied to create
optimised queries. The heuristics are informed by formal results in the
literature on the semantics and complexity of evaluating SPARQL queries, which
ensures that queries following these rules can be optimised effectively by an
underlying RDF store. Moreover, we empirically verify the efficacy of the
heuristics using a set of openly available datasets and corresponding SPARQL
queries developed by a large pharmacology data integration project. The
experimental results show improvements in performance across 6 state-of-the-art
RDF stores.
","[{'version': 'v1', 'created': 'Tue, 2 Apr 2013 09:02:48 GMT'}]",2017-08-29,"[['Loizou', 'Antonis', ''], ['Groth', 'Paul', '']]","['sparql', 'heuristics', 'optimization', 'triple store', 'data integration', 'biomedical data']"
4604,1405.6171,Atul  Singh Kushwah Mr.,"Atul Singh Kushwah, Sachin Manglasheril",Performance Estimation of 2*3 MIMO-MC-CDMA using Convolution Code,"5 pages, 5 figures and 2 tables","International Journal of Computer Trends and Technology (IJCTT)
  V9(1):21-25, March 2014",10.14445/22312803/IJCTT-V9P105,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we estimate the performance of 2by3 MIMOMCCDMA system using
convolution code in MATLAB which highly reduces BER by increasing the
efficiency of system. MIMO and MCCDMA system combination is used to reduce bit
error rate and also for forming a new system called MCCDMA which is multi user
and multiple access schemes used to increase the performance of the system.
MCCDMA system is a narrowband flat fading in nature which converts frequency
selective to numerous narrowband flat fading multiple parallel sub-carriers to
increase the efficiency of the system. Now this MCCDMA system can also be
enhanced by grouping with 2by3 MIMO system which utilizes ZF decoder at the
receiver to decrease BER in which half rate convolutionally encoded Alamouti
STBC block code is used for channel encoding scheme as transmit diversity of
MIMO with multiple transmit antenna. And convolution encoder is also used as
source encoder or FEC encoder in MIMOMCCDMA. Advantage of using MIMO-MC-CDMA
using convolution code is due to reduce complexity of system and also for
reducing BER and finally to increase gain of system. Now after this we examine
system in various modulation techniques like, 8PSK, 16QAM, QPSK, 32QAM, 8QAM
and 64QAM using MATLAB in Rayleigh fading channel.
","[{'version': 'v1', 'created': 'Wed, 12 Mar 2014 14:18:03 GMT'}]",2014-05-26,"[['Kushwah', 'Atul Singh', ''], ['Manglasheril', 'Sachin', '']]","['OFDM', 'Convolution Code', 'CDMA', 'MIMO and MIMOMC-CDMA']"
4605,1903.08858,Fuad Noman,"Chun-Ren Phang, Chee-Ming Ting, Fuad Noman, Hernando Ombao","Classification of EEG-Based Brain Connectivity Networks in Schizophrenia
  Using a Multi-Domain Connectome Convolutional Neural Network","15 pages, 9 figures",,10.1109/JBHI.2019.2941222,,cs.LG cs.CV q-bio.NC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We exploit altered patterns in brain functional connectivity as features for
automatic discriminative analysis of neuropsychiatric patients. Deep learning
methods have been introduced to functional network classification only very
recently for fMRI, and the proposed architectures essentially focused on a
single type of connectivity measure. We propose a deep convolutional neural
network (CNN) framework for classification of electroencephalogram
(EEG)-derived brain connectome in schizophrenia (SZ). To capture complementary
aspects of disrupted connectivity in SZ, we explore combination of various
connectivity features consisting of time and frequency-domain metrics of
effective connectivity based on vector autoregressive model and partial
directed coherence, and complex network measures of network topology. We design
a novel multi-domain connectome CNN (MDC-CNN) based on a parallel ensemble of
1D and 2D CNNs to integrate the features from various domains and dimensions
using different fusion strategies. Hierarchical latent representations learned
by the multiple convolutional layers from EEG connectivity reveal apparent
group differences between SZ and healthy controls (HC). Results on a large
resting-state EEG dataset show that the proposed CNNs significantly outperform
traditional support vector machine classifiers. The MDC-CNN with combined
connectivity features further improves performance over single-domain CNNs
using individual features, achieving remarkable accuracy of $93.06\%$ with a
decision-level fusion. The proposed MDC-CNN by integrating information from
diverse brain connectivity descriptors is able to accurately discriminate SZ
from HC. The new framework is potentially useful for developing diagnostic
tools for SZ and other disorders.
","[{'version': 'v1', 'created': 'Thu, 21 Mar 2019 07:35:54 GMT'}]",2020-04-27,"[['Phang', 'Chun-Ren', ''], ['Ting', 'Chee-Ming', ''], ['Noman', 'Fuad', ''], ['Ombao', 'Hernando', '']]","['EEG', 'brain connectivity networks', 'deep learning', 'convolution neural networks', 'ensembleclassifiers']"
4606,2208.03837,Giacomo Benedetti,"Giacomo Benedetti, Luca Verderame, Alessio Merlo",Automatic Security Assessment of GitHub Actions Workflows,,"Proceedings of the 2022 ACM Workshop on Software Supply Chain
  Offensive Research and Ecosystem Defenses",10.1145/3560835.3564554,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The demand for quick and reliable DevOps operations pushed distributors of
repository platforms to implement workflows. Workflows allow automating code
management operations directly on the repository hosting the software. However,
this feature also introduces security issues that directly affect the
repository, its content, and all the software supply chains in which the hosted
code is involved in. Hence, an attack exploiting vulnerable workflows can
affect disruptively large software ecosystems. To empirically assess the
importance of this problem, in this paper, we focus on the de-facto main
distributor (i.e., GitHub), and we developed a security assessment methodology
for GitHub Actions workflows, which are widely adopted in software supply
chains. We implemented the methodology in a tool (GHAST) and applied it on 50
open-source projects. The experimental results are worrisome as they allowed
identifying a total of 24,905 security issues (all reported to the
corresponding stakeholders), thereby indicating that the problem is open and
demands further research and investigation.
","[{'version': 'v1', 'created': 'Sun, 7 Aug 2022 23:03:47 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Nov 2022 09:42:46 GMT'}]",2022-11-11,"[['Benedetti', 'Giacomo', ''], ['Verderame', 'Luca', ''], ['Merlo', 'Alessio', '']]","['Software Supply Chain', 'Software Supply Chain Security', 'GitHubActions', 'Workflow security']"
4607,2208.14717,Filippo Carnovalini,Filippo Carnovalini and Antonio Rod\`a,A Real-Time Tempo and Meter Tracking System for Rhythmic Improvis,,"In Audio Mostly (AM'19), September 18-20, 2019, Nottingham, UK.
  ACM, New York, NY, USA, 8 pages",10.1145/3356590.3356596,,cs.SD cs.MM eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Music is a form of expression that often requires interaction between
players. If one wishes to interact in such a musical way with a computer, it is
necessary for the machine to be able to interpret the input given by the human
to find its musical meaning. In this work, we propose a system capable of
detecting basic rhythmic features that can allow an application to synchronize
its output with the rhythm given by the user, without having any prior
agreement or requirement on the possible input. The system is described in
detail and an evaluation is given through simulation using quantitative
metrics. The evaluation shows that the system can detect tempo and meter
consistently under certain settings, and could be a solid base for further
developments leading to a system robust to rhythmically changing inputs.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2022 09:25:39 GMT'}]",2022-09-01,"[['Carnovalini', 'Filippo', ''], ['Rodà', 'Antonio', '']]","['rhythm', 'improvisation', 'musical interaction', 'music information retrieval']"
4608,1603.09642,Andrey Demichev,"Stanislav P. Polyakov, Andrey P. Demichev and Alexander P. Kryukov","Web Toolkit for Scientific Research: State of the Art and the Prospect
  for Development","10 pages; 4th International Young Scientists Conference on
  Computational Science (YSC 2015)","Procedia computer science, Volume 66, 2015, Pages 429 - 438",10.1016/j.procs.2015.11.049,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper examines the current trends in designing of systems for convenient
and secure remote job submission to various computer resources, including
supercomputers, computer clusters, cloud resources, data storages and
databases, and grid infrastructures by authorized users, as well as remote job
monitoring and obtaining the results. Currently, high-perfomance computing and
storage resources are capable of solving independently the majority of
practical problems in the field of science and technology. Therefore, the focus
in the development of a new generation of middleware shifts from the global
grid systems to building convenient and efficient web platforms for remote
access to individual computing resources. The paper examines the general
principles of the construction and briefly describes some of the specific
implementations of the web platforms.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2016 15:36:25 GMT'}]",2016-04-01,"[['Polyakov', 'Stanislav P.', ''], ['Demichev', 'Andrey P.', ''], ['Kryukov', 'Alexander P.', '']]","['web platforms', 'remote job submission', 'SaaS and PaaS models', 'remote software deployment', 'market of scientific application software']"
4609,1204.0684,Matthias Scholz,Matthias Scholz,Validation of nonlinear PCA,"12 pages, 5 figures","Neural Processing Letters, 2012",10.1007/s11063-012-9220-6,,cs.LG cs.AI cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linear principal component analysis (PCA) can be extended to a nonlinear PCA
by using artificial neural networks. But the benefit of curved components
requires a careful control of the model complexity. Moreover, standard
techniques for model selection, including cross-validation and more generally
the use of an independent test set, fail when applied to nonlinear PCA because
of its inherent unsupervised characteristics. This paper presents a new
approach for validating the complexity of nonlinear PCA models by using the
error in missing data estimation as a criterion for model selection. It is
motivated by the idea that only the model of optimal complexity is able to
predict missing values with the highest accuracy. While standard test set
validation usually favours over-fitted nonlinear PCA models, the proposed model
validation approach correctly selects the optimal model complexity.
","[{'version': 'v1', 'created': 'Tue, 3 Apr 2012 13:22:07 GMT'}]",2012-04-04,"[['Scholz', 'Matthias', '']]","['nonlinear PCA', 'neural networks', 'model selection', 'validation']"
4610,0812.0067,Bernard Mourrain,"Bernard Mourrain (INRIA Sophia Antipolis), Philippe Tr\'ebuchet (LIP6)",Stable normal forms for polynomial system solving,,"Theoretical Computer Science 409, 2 (2008) 229-240",10.1016/j.tcs.2008.09.004,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes and analyzes a method for computing border bases of a
zero-dimensional ideal $I$. The criterion used in the computation involves
specific commutation polynomials and leads to an algorithm and an
implementation extending the one provided in [MT'05]. This general border basis
algorithm weakens the monomial ordering requirement for \grob bases
computations. It is up to date the most general setting for representing
quotient algebras, embedding into a single formalism Gr\""obner bases, Macaulay
bases and new representation that do not fit into the previous categories. With
this formalism we show how the syzygies of the border basis are generated by
commutation relations. We also show that our construction of normal form is
stable under small perturbations of the ideal, if the number of solutions
remains constant. This new feature for a symbolic algorithm has a huge impact
on the practical efficiency as it is illustrated by the experiments on
classical benchmark polynomial systems, at the end of the paper.
","[{'version': 'v1', 'created': 'Sat, 29 Nov 2008 11:26:50 GMT'}]",2008-12-02,"[['Mourrain', 'Bernard', '', 'INRIA Sophia Antipolis'], ['Trébuchet', 'Philippe', '', 'LIP6']]","['Multivariate polynomial', 'quotient algebra', 'normal form', 'border basis', 'root-finding', 'symbolic-numeric computation']"
4611,1711.04559,Daniel Patterson,Daniel Patterson and Amal Ahmed,Linking Types for Multi-Language Software: Have Your Cake and Eat It Too,"14 pages; published in SNAPL '17, 2nd Summit on Advances in
  Programming Languages, May 7-10, 2017, Pacific Grove, California",,10.4230/LIPIcs.SNAPL.2017.12,,cs.PL,http://creativecommons.org/licenses/by/4.0/,"  Software developers compose systems from components written in many different
languages. A business-logic component may be written in Java or OCaml, a
resource-intensive component in C or Rust, and a high-assurance component in
Coq. In this multi-language world, program execution sends values from one
linguistic context to another. This boundary-crossing exposes values to
contexts with unforeseen behavior---that is, behavior that could not arise in
the source language of the value. For example, a Rust function may end up being
applied in an ML context that violates the memory usage policy enforced by
Rust's type system. This leads to the question of how developers ought to
reason about code in such a multi-language world where behavior inexpressible
in one language is easily realized in another.
  This paper proposes the novel idea of linking types to address the problem of
reasoning about single-language components in a multi-lingual setting.
Specifically, linking types allow programmers to annotate where in a program
they can link with components inexpressible in their unadulterated language.
This enables developers to reason about (behavioral) equality using only their
own language and the annotations, even though their code may be linked with
code written in a language with more expressive power.
","[{'version': 'v1', 'created': 'Mon, 13 Nov 2017 13:02:25 GMT'}]",2017-11-15,"[['Patterson', 'Daniel', ''], ['Ahmed', 'Amal', '']]","['Linking', 'program reasoning', 'equivalence', 'expressive power of languages', 'fully abstract compilation']"
4612,1807.01597,Joos Behncke,"Joos Behncke, Robin Tibor Schirrmeister, Wolfram Burgard, Tonio Ball","The role of robot design in decoding error-related information from EEG
  signals of a human observer",,,10.5220/0006934900610066,,cs.HC q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For utilization of robotic assistive devices in everyday life, means for
detection and processing of erroneous robot actions are a focal aspect in the
development of collaborative systems, especially when controlled via brain
signals. Though, the variety of possible scenarios and the diversity of used
robotic systems pose a challenge for error decoding from recordings of brain
signals such as via EEG. For example, it is unclear whether humanoid
appearances of robotic assistants have an influence on the performance. In this
paper, we designed a study in which two different robots executed the same task
both in an erroneous and a correct manner. We find error-related EEG signals of
human observers indicating that the performance of the error decoding was
independent of robot design. However, we can show that it was possible to
identify which robot performed the instructed task by means of the EEG signals.
In this case, deep convolutional neural networks (deep ConvNets) could reach
significantly higher accuracies than both regularized Linear Discriminanat
Analysis (rLDA) and filter bank common spatial patterns (FB-CSP) combined with
rLDA. Our findings indicate that decoding information about robot action
success from the EEG, particularly when using deep neural networks, may be an
applicable approach for a broad range of robot designs.
","[{'version': 'v1', 'created': 'Wed, 4 Jul 2018 14:06:31 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Jul 2018 09:53:33 GMT'}]",2018-10-05,"[['Behncke', 'Joos', ''], ['Schirrmeister', 'Robin Tibor', ''], ['Burgard', 'Wolfram', ''], ['Ball', 'Tonio', '']]","['EEG', 'Error processing', 'Deep Learning', 'Convolutional Neural Networks', 'Robot Design', 'Mirror NeuronSystem', 'BCI']"
4613,1404.3329,Mahdi Moeini,"Hoai An Le Thi, Mahdi Moeini","Portfolio Selection Under Buy-In Threshold Constraints Using DC
  Programming and DCA","Proceedings of third International Conference on Service Systems and
  Service Management (SSSM'06/IEEE), Troyes, Oct. 2006, pp. 296-300 (2006).
  arXiv admin note: text overlap with arXiv:cs/0501005 by other authors",,10.1109/ICSSSM.2006.320630,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In matter of Portfolio selection, we consider a generalization of the
Markowitz Mean-Variance model which includes buy-in threshold constraints.
These constraints limit the amount of capital to be invested in each asset and
prevent very small investments in any asset. The new model can be converted
into a NP-hard mixed integer quadratic programming problem. The purpose of this
paper is to investigate a continuous approach based on DC programming and DCA
for solving this new model. DCA is a local continuous approach to solve a wide
variety of nonconvex programs for which it provided quite often a global
solution and proved to be more robust and efficient than standard methods.
Preliminary comparative results of DCA and a classical Branch-and-Bound
algorithm will be presented. These results show that DCA is an efficient and
promising approach for the considered portfolio selection problem.
","[{'version': 'v1', 'created': 'Sat, 12 Apr 2014 23:50:21 GMT'}]",2016-11-18,"[['Thi', 'Hoai An Le', ''], ['Moeini', 'Mahdi', '']]","['Portfolio selection', 'DC programming', 'DCA', 'Branch-and-Bound']"
4614,1907.09003,Bruno G\'ois Mateus,Bruno G\'ois Mateus and Matias Martinez,"On the adoption, usage and evolution of Kotlin Features on Android
  development",,"ESEM '20: ACM / IEEE International Symposium on Empirical Software
  Engineering and Measurement (ESEM) (ESEM '20), October 8--9, 2020, Bari,
  Italy",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Google announced Kotlin as an Android official programming
language in 2017, giving developers an option of writing applications using a
language that combines object-oriented and functional features. Aims: The goal
of this work is to understand the usage of Kotlin features considering four
aspects: i) which features are adopted, ii) what is the degree of adoption,
iii)when are these features added into Android applications for the first time,
and iv) how the usage of features evolves along with applications' evolution.
Method: Exploring the source code of 387 Android applications, we identify the
usage of Kotlin features on each version application's version and compute the
moment that each feature is used for the first time. Finally, we identify the
evolution trend that better describes the usage of these features. Results: 15
out of 26 features are used on at least 50% of applications. Moreover, we found
that type inference, lambda and safe call are the most used features. Also, we
observed that the most used Kotlin features are those first included on Android
applications. Finally, we report that the majority of applications tend to add
more instances of 24 out of 26 features along with their evolution. {\bf
Conclusions:} Our study generates 7 main findings. We present their
implications, which are addressed to developers, researchers and tool builders
in order to foster the use of Kotlin features to develop Android applications.
","[{'version': 'v1', 'created': 'Sun, 21 Jul 2019 16:52:04 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Jan 2020 14:57:18 GMT'}, {'version': 'v3', 'created': 'Mon, 27 Jul 2020 20:23:43 GMT'}]",2020-07-29,"[['Mateus', 'Bruno Góis', ''], ['Martinez', 'Matias', '']]","['Android', 'Kotlin', 'Features adoption', 'Evolution trends']"
4615,1203.6713,Gopalakrishnan Tr Nair,"T. R. Gopalakrishnan Nair, Kavitha Sooda","Application of Genetic Algorithm on Quality Graded Networks for
  Intelligent Routing","6 Pages, 6 Figures, 3 Tables, 2011 World Congress on Information and
  Communication Technologies","Information and Communication Technologies (WICT), 2011 World
  Congress on Information and Communication Technologies",10.1109/WICT.2011.6141306,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the past decade, significant research has been carried out for realizing
intelligent network routing using advertisement, position and near-optimum node
selection schemes. In this paper, a grade-based two-level node selection method
along with genetic algorithm (GA) is proposed for realizing an efficient
routing scheme. This method assumes that the nodes are intelligent and that
there exists a knowledge base about the environment in their local memory.
There are two levels for approaching the effective route selection process
through grading. At the first level, grade-based selection is applied and at
the second level, the optimum path is explored using GA. The simulation has
been carried out on different topological structures, and a significant
reduction in time is achieved for determining the optimal path through this
method compared to the non-graded networks.
","[{'version': 'v1', 'created': 'Fri, 30 Mar 2012 05:03:15 GMT'}]",2012-04-02,"[['Nair', 'T. R. Gopalakrishnan', ''], ['Sooda', 'Kavitha', '']]","['Intelligent routing', 'Genetic algorithm', 'Graded network', 'Level-1', 'Level-2 operation', 'Knowledge base']"
4616,1809.00039,Zhe Yu,Zhe Yu and Tim Menzies,"Total Recall, Language Processing, and Software Engineering","4 pages, 2 figures. Submitted to NL4SE@ESEC/FSE 2018",,10.1145/3283812.3283818,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A broad class of software engineering problems can be generalized as the
""total recall problem"". This short paper claims that identifying and exploring
total recall language processing problems in software engineering is an
important task with wide applicability.
  To make that case, we show that by applying and adapting the state of the art
active learning and text mining, solutions of the total recall problem, can
help solve two important software engineering tasks: (a) supporting large
literature reviews and (b) identifying software security vulnerabilities.
Furthermore, we conjecture that (c) test case prioritization and (d) static
warning identification can also be categorized as the total recall problem.
  The widespread applicability of ""total recall"" to software engineering
suggests that there exists some underlying framework that encompasses not just
natural language processing, but a wide range of important software engineering
tasks.
","[{'version': 'v1', 'created': 'Fri, 31 Aug 2018 19:37:20 GMT'}]",2018-11-13,"[['Yu', 'Zhe', ''], ['Menzies', 'Tim', '']]","['Software engineering', 'active learning', 'natural language processing', 'information retrieval']"
4617,2102.10245,Ahmed E. Helal,"Ahmed E. Helal, Jan Laukemann, Fabio Checconi, Jesmin Jahan Tithi,
  Teresa Ranadive, Fabrizio Petrini, Jeewhan Choi",ALTO: Adaptive Linearized Storage of Sparse Tensors,Accepted to ICS 2021,,10.1145/3447818.3461703,,cs.DC cs.DS cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The analysis of high-dimensional sparse data is becoming increasingly popular
in many important domains. However, real-world sparse tensors are challenging
to process due to their irregular shapes and data distributions. We propose the
Adaptive Linearized Tensor Order (ALTO) format, a novel mode-agnostic (general)
representation that keeps neighboring nonzero elements in the multi-dimensional
space close to each other in memory. To generate the indexing metadata, ALTO
uses an adaptive bit encoding scheme that trades off index computations for
lower memory usage and more effective use of memory bandwidth. Moreover, by
decoupling its sparse representation from the irregular spatial distribution of
nonzero elements, ALTO eliminates the workload imbalance and greatly reduces
the synchronization overhead of tensor computations. As a result, the parallel
performance of ALTO-based tensor operations becomes a function of their
inherent data reuse. On a gamut of tensor datasets, ALTO outperforms an oracle
that selects the best state-of-the-art format for each dataset, when used in
key tensor decomposition operations. Specifically, ALTO achieves a geometric
mean speedup of 8X over the best mode-agnostic (coordinate and hierarchical
coordinate) formats, while delivering a geometric mean compression ratio of
4.3X relative to the best mode-specific (compressed sparse fiber) formats.
","[{'version': 'v1', 'created': 'Sat, 20 Feb 2021 03:32:08 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Apr 2021 07:36:07 GMT'}]",2021-04-28,"[['Helal', 'Ahmed E.', ''], ['Laukemann', 'Jan', ''], ['Checconi', 'Fabio', ''], ['Tithi', 'Jesmin Jahan', ''], ['Ranadive', 'Teresa', ''], ['Petrini', 'Fabrizio', ''], ['Choi', 'Jeewhan', '']]","['Sparse tensors', 'tensor decomposition', 'MTTKRP', 'multi-core CPU']"
4618,1505.06784,Xinhua Wang,"Xinhua Wang, Lilong Cai",Mathematical modeling and control of a tilt-rotor aircraft,,"Aerospace Science and Technology, vol. 47, no. 12, 2015, 473-492",10.1016/j.ast.2015.10.012,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel model of large-size tilt-rotor aircraft, which
can operate as a helicopter as well as being capable of transition to
fixed-wing flight. Aerodynamics of the dynamic large-size tilt-rotors based on
blade element method is analyzed during mode transition. For the large-size
aircraft with turboshaft engines, the blade pitch angles of the rotors are
regulated to vary according to the desired level of thrust, and the following
expressions are formulated explicitly: rotor thrust and blade pitch angle, drag
torque and blade pitch angle. A finite-time convergent observer based on
Lyapunov function is developed to reconstruct the unknown variables and
uncertainties during mode transitions. The merits of this design include the
modeling of dynamic large-size tilt-rotor, ease of the uncertainties estimation
during the tilting and the widely applications. Moreover, a switched logic
controller based on the finite-time convergent observer is proposed to drive
the aircraft to implement the mode transition with invariant flying height.
","[{'version': 'v1', 'created': 'Tue, 26 May 2015 00:49:14 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Jun 2015 05:29:39 GMT'}]",2015-11-30,"[['Wang', 'Xinhua', ''], ['Cai', 'Lilong', '']]","['Tilt-rotor aircraft', 'rotor thrust', 'blade pitch angle', 'uncertainties estimation', 'mode transition']"
4619,1511.04197,Ioannis Pachoulakis,"Kostas Kapetanakis, Haroula Andrioti, Helen Vonorta, Marios Zotos,
  Nikolaos Tsigkos and Ioannis Pachoulakis",Collaboration Framework in the EViE-m Platform,"6 pages, 10 figures","Proceedings of the 24th EAEEIE Annual Conference (EAEEIE'13),
  Chania, Greece, 30 - 31 of May, 2013 pgs 178-183",10.1109/EAEEIE.2013.6576525,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Within the context of a 3D interactive strategy game, the EViE platform
allows participants to unlock game features using their knowledge and skills in
various thematic areas such as physics, mathematics, etc. By answering
questions organized by Educational Objective in stratified levels of
difficulty, users gather points which grant them access to desired world
elements. Richer world components become increasingly more difficult to access,
so that a players' individual (or cumulative if in a group) knowledge, ability
and / or dexterity is directly reflected by the level of complication of their
virtual world. In the present article we report on the communication
architecture of the platform and focus on framework components that allow group
activities such as cooperation (within the group to facilitate e.g.,
collaboration on more difficult problems), (inter-group) competition as well as
practice and skill honing activities (in single or in multi-player mode).
","[{'version': 'v1', 'created': 'Fri, 13 Nov 2015 08:15:17 GMT'}]",2015-11-16,"[['Kapetanakis', 'Kostas', ''], ['Andrioti', 'Haroula', ''], ['Vonorta', 'Helen', ''], ['Zotos', 'Marios', ''], ['Tsigkos', 'Nikolaos', ''], ['Pachoulakis', 'Ioannis', '']]","['Virtual Worlds', 'EViE-m', 'Xj3D libraries']"
4620,1512.08325,Shimin Cai Dr,"Yao-Dong Zhao, Shi-Min Cai, Ming Tang, Ming-Sheng Shang","A Fast Recommendation Algorithm for Social Tagging Systems : A Delicious
  Case","20 pages, 7 figures","Physica A 483, 209 (2017)",10.1016/j.physa.2017.04.131,,cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The tripartite graph is one of the commonest topological structures in social
tagging systems such as Delicious, which has three types of nodes (i.e., users,
URLs and tags). Traditional recommender systems developed based on
collaborative filtering for the social tagging systems bring very high demands
on CPU time cost. In this paper, to overcome this drawback, we propose a novel
approach that extracts non-overlapping user clusters and corresponding
overlapping item clusters simultaneously through coarse clustering to
accelerate the user-based collaborative filtering and develop a fast
recommendation algorithm for the social tagging systems. The experimental
results show that the proposed approach is able to dramatically reduce the
processing time cost greater than $90\%$ and relatively enhance the accuracy in
comparison with the ordinary user-based collaborative filtering algorithm.
","[{'version': 'v1', 'created': 'Mon, 28 Dec 2015 06:23:37 GMT'}]",2019-08-17,"[['Zhao', 'Yao-Dong', ''], ['Cai', 'Shi-Min', ''], ['Tang', 'Ming', ''], ['Shang', 'Ming-Sheng', '']]","['Recommender System', 'Social Tagging System', 'TripartiteGraph', 'Time Performance', 'Collaborative Filtering']"
4621,1604.07045,Mario Valerio Giuffrida,Mario Valerio Giuffrida and Sotirios A. Tsaftaris,"Rotation-Invariant Restricted Boltzmann Machine Using Shared Gradient
  Filters","8 pages, 3 figures, 1 table",,10.1007/978-3-319-44781-0_57,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finding suitable features has been an essential problem in computer vision.
We focus on Restricted Boltzmann Machines (RBMs), which, despite their
versatility, cannot accommodate transformations that may occur in the scene. As
a result, several approaches have been proposed that consider a set of
transformations, which are used to either augment the training set or transform
the actual learned filters. In this paper, we propose the Explicit
Rotation-Invariant Restricted Boltzmann Machine, which exploits prior
information coming from the dominant orientation of images. Our model extends
the standard RBM, by adding a suitable number of weight matrices, associated
with each dominant gradient. We show that our approach is able to learn
rotation-invariant features, comparing it with the classic formulation of RBM
on the MNIST benchmark dataset. Overall, requiring less hidden units, our
method learns compact features, which are robust to rotations.
","[{'version': 'v1', 'created': 'Sun, 24 Apr 2016 15:56:18 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Jun 2016 09:59:47 GMT'}]",2016-11-15,"[['Giuffrida', 'Mario Valerio', ''], ['Tsaftaris', 'Sotirios A.', '']]","['Rotation invariance', 'Restricted Boltzmann Machine', 'explicit invariance', 'shared filters']"
4622,1804.04773,Warut Suksompong,"Warut Suksompong, Charles E. Leiserson, Tao B. Schardl",On the Efficiency of Localized Work Stealing,"13 pages, 1 figure","Information Processing Letters, 116(2):100-106 (2016)",10.1016/j.ipl.2015.10.002,,cs.DC cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates a variant of the work-stealing algorithm that we call
the localized work-stealing algorithm. The intuition behind this variant is
that because of locality, processors can benefit from working on their own
work. Consequently, when a processor is free, it makes a steal attempt to get
back its own work. We call this type of steal a steal-back. We show that the
expected running time of the algorithm is $T_1/P+O(T_\infty P)$, and that under
the ""even distribution of free agents assumption"", the expected running time of
the algorithm is $T_1/P+O(T_\infty\lg P)$. In addition, we obtain another
running-time bound based on ratios between the sizes of serial tasks in the
computation. If $M$ denotes the maximum ratio between the largest and the
smallest serial tasks of a processor after removing a total of $O(P)$ serial
tasks across all processors from consideration, then the expected running time
of the algorithm is $T_1/P+O(T_\infty M)$.
","[{'version': 'v1', 'created': 'Fri, 13 Apr 2018 02:17:57 GMT'}]",2018-04-16,"[['Suksompong', 'Warut', ''], ['Leiserson', 'Charles E.', ''], ['Schardl', 'Tao B.', '']]","['parallel algorithm', 'multithreaded computation', 'work stealing', 'localization']"
4623,1809.02823,Yingjie Hu,"Yingjie Hu, Xinyue Ye, Shih-Lung Shaw","Extracting and Analyzing Semantic Relatedness between Cities Using News
  Articles","International Journal of Geographical Information Science, 2017",,10.1080/13658816.2017.1367797,,cs.SI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  News articles capture a variety of topics about our society. They reflect not
only the socioeconomic activities that happened in our physical world, but also
some of the cultures, human interests, and public concerns that exist only in
the perceptions of people. Cities are frequently mentioned in news articles,
and two or more cities may co-occur in the same article. Such co-occurrence
often suggests certain relatedness between the mentioned cities, and the
relatedness may be under different topics depending on the contents of the news
articles. We consider the relatedness under different topics as semantic
relatedness. By reading news articles, one can grasp the general semantic
relatedness between cities, yet, given hundreds of thousands of news articles,
it is very difficult, if not impossible, for anyone to manually read them. This
paper proposes a computational framework which can ""read"" a large number of
news articles and extract the semantic relatedness between cities. This
framework is based on a natural language processing model and employs a machine
learning process to identify the main topics of news articles. We describe the
overall structure of this framework and its individual modules, and then apply
it to an experimental dataset with more than 500,000 news articles covering the
top 100 U.S. cities spanning a 10-year period. We perform exploratory
visualization of the extracted semantic relatedness under different topics and
over multiple years. We also analyze the impact of geographic distance on
semantic relatedness and find varied distance decay effects. The proposed
framework can be used to support large-scale content analysis in city network
research.
","[{'version': 'v1', 'created': 'Sat, 8 Sep 2018 15:29:47 GMT'}]",2018-09-11,"[['Hu', 'Yingjie', ''], ['Ye', 'Xinyue', ''], ['Shaw', 'Shih-Lung', '']]","['place relatedness', 'city network', 'semantic analysis', 'geospatial semantics', 'spatial data mining', 'geographic knowledge discovery']"
4624,0710.5830,Thomas Voice,"Thomas Voice, Gaurav Raina","Stability analysis of a max-min fair Rate Control Protocol (RCP) in a
  small buffer regime","13 pages, no figures. Submitted to IEEE Transactions on Automatic
  Control",,10.1109/TAC.2009.2022115,,cs.NI,,"  In this note we analyse various stability properties of the max-min fair Rate
Control Protocol (RCP) operating with small buffers. We first tackle the issue
of stability for networks with arbitrary topologies. We prove that the max-min
fair RCP fluid model is globally stable in the absence of propagation delays,
and also derive a set of conditions for local stability when arbitrary
heterogeneous propagation delays are present. The network delay stability
result assumes that, at equilibrium, there is only one bottleneck link along
each route. Lastly, in the simpler setting of a single link, single delay
model, we investigate the impact of the loss of local stability via a Hopf
bifurcation.
","[{'version': 'v1', 'created': 'Wed, 31 Oct 2007 10:44:21 GMT'}]",2016-11-18,"[['Voice', 'Thomas', ''], ['Raina', 'Gaurav', '']]","['rcp', 'max-min fairness', 'small buffers', 'stability', 'bifurcation']"
4625,2102.08175,Ashesh Ashesh,"Ashesh, Buo-Fu Chen, Treng-Shi Huang, Boyo Chen, Chia-Tung Chang,
  Hsuan-Tien Lin","Accurate and Clear Precipitation Nowcasting with Consecutive Attention
  and Rain-map Discrimination",,,10.1175/AIES-D-21-0005.1,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Precipitation nowcasting is an important task for weather forecasting. Many
recent works aim to predict the high rainfall events more accurately with the
help of deep learning techniques, but such events are relatively rare. The
rarity is often addressed by formulations that re-weight the rare events.
Somehow such a formulation carries a side effect of making ""blurry"" predictions
in low rainfall regions and cannot convince meteorologists to trust its
practical usability. We fix the trust issue by introducing a discriminator that
encourages the prediction model to generate realistic rain-maps without
sacrificing predictive accuracy. Furthermore, we extend the nowcasting time
frame from one hour to three hours to further address the needs from
meteorologists. The extension is based on consecutive attentions across
different hours. We propose a new deep learning model for precipitation
nowcasting that includes both the discrimination and attention techniques. The
model is examined on a newly-built benchmark dataset that contains both radar
data and actual rain data. The benchmark, which will be publicly released, not
only establishes the superiority of the proposed model, but also is expected to
encourage future research on precipitation nowcasting.
","[{'version': 'v1', 'created': 'Tue, 16 Feb 2021 14:22:54 GMT'}]",2022-10-17,"[['Ashesh', '', ''], ['Chen', 'Buo-Fu', ''], ['Huang', 'Treng-Shi', ''], ['Chen', 'Boyo', ''], ['Chang', 'Chia-Tung', ''], ['Lin', 'Hsuan-Tien', '']]","['convolution neural networks', 'rainfall prediction', 'precipitation nowcasting', 'attention', 'discriminator', 'sequence models']"
4626,1907.11961,John Coulter,Jason Wells and J. Eric Coulter,Research Computing at a Business University,"5 pages, 5 figures, presented at PEARC19 in Chicago, IL",,10.1145/3332186.3333161,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Research Computing demands are exploding beyond traditional disciplines due
to the proliferation of data in all walks of life. At Bentley University
(""Bentley""), a business university in the Boston area, this expansion has been
most readily seen in our Accounting, Economics, Mathematics, and Natural
Sciences departments. The result has been a small effort to build a research
computing capability at this small New England university. This poster will
serve as an overview of the steps taken to build such an effort at a business
university, the revelations we have had along the way, and our plans for the
future.
","[{'version': 'v1', 'created': 'Sat, 27 Jul 2019 18:31:04 GMT'}]",2019-07-30,"[['Wells', 'Jason', ''], ['Coulter', 'J. Eric', '']]","['HPC', 'Long Tail of Science', 'Non-traditional disciplines', 'Single Threaded', 'Windows']"
4627,1308.3849,Kyeong Soo (Joseph) Kim,Kyeong Soo Kim,"The Effect of ISP Traffic Shaping on User-Perceived Performances in
  Broadband Shared Access Networks","39 pages, 12 figures, accepted for publication in the Computer
  Networks, Jun. 1, 2014","Computer Networks, vol. 70, pp. 192-209, Sep. 2014",10.1016/j.comnet.2014.06.001,,cs.NI stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent studies on the practice of shaping subscribers' traffic by ISPs give a
new insight into the actual performance of broadband access networks at a
packet level. Unlike metro and backbone networks, however, access networks
directly interface with end-users, so it is important to base the study and
design of access networks on the behaviors of and the actual performance
perceived by end-users. In this paper we study the effect of ISP traffic
shaping using traffic models based on user behaviors and
application/session-layer metrics providing quantifiable measures of
user-perceived performance for HTTP, FTP, and streaming video traffic. To
compare the user-perceived performance of shaped traffic flows with those of
unshaped ones in an integrated way, we use a multivariate non-inferiority
testing procedure. We first investigate the effect of the token generation rate
and the token bucket size of a token bucket filter on user-perceived
performance at a subscriber level with a single subscriber. Then we investigate
their effect at an access level where shaped traffic flows from multiple
subscribers interact with one another in a common shared access network. The
simulation results show that for a given token generation rate, a larger token
bucket provides better user-perceived performance at both subscriber and access
levels. It is also shown that the loose burst control resulting from the large
token bucket --- up to 100 MB for access line rate of 100 Mbit/s --- does not
negatively affect user-perceived performance with multiple subscribers even in
the presence of non-conformant subscribers; with a much larger token bucket,
however, the negative effect of non-conformant subscribers on the
user-perceived performance of conformant subscribers becomes clearly visible
because the impact of token bucket size and that of token generation rate are
virtually indistinguishable in this case.
","[{'version': 'v1', 'created': 'Sun, 18 Aug 2013 10:17:17 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Jun 2014 15:26:27 GMT'}]",2015-06-02,"[['Kim', 'Kyeong Soo', '']]","['Traffic shaping', 'access', 'Internet service provider (ISP)', 'userbehavior', 'user-perceived performance', 'quality of experience (QoE)']"
4628,1608.07951,Seoung Wug Oh,Seoung Wug Oh and Seon Joo Kim,"Approaching the Computational Color Constancy as a Classification
  Problem through Deep Learning","This is a preprint of an article accepted for publication in Pattern
  Recognition, ELSEVIER","Pattern Recognition, Volume 61, January 2017, Pages 405 to 416",10.1016/j.patcog.2016.08.013,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computational color constancy refers to the problem of computing the
illuminant color so that the images of a scene under varying illumination can
be normalized to an image under the canonical illumination. In this paper, we
adopt a deep learning framework for the illumination estimation problem. The
proposed method works under the assumption of uniform illumination over the
scene and aims for the accurate illuminant color computation. Specifically, we
trained the convolutional neural network to solve the problem by casting the
color constancy problem as an illumination classification problem. We designed
the deep learning architecture so that the output of the network can be
directly used for computing the color of the illumination. Experimental results
show that our deep network is able to extract useful features for the
illumination estimation and our method outperforms all previous color constancy
methods on multiple test datasets.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2016 08:41:55 GMT'}]",2016-08-30,"[['Oh', 'Seoung Wug', ''], ['Kim', 'Seon Joo', '']]","['Computational color constancy', 'white balancing', 'illumination estimation', 'machine learning', 'convolutional neuralnetwork']"
4629,1507.04642,Jose M. Such,"Jose M. Such, Natalia Criado",Resolving Multi-party Privacy Conflicts in Social Media,"Authors' version of the paper accepted for publication at IEEE
  Transactions on Knowledge and Data Engineering, IEEE Transactions on
  Knowledge and Data Engineering, 2016","IEEE Transactions on Knowledge and Data Engineering,
  28(7):1851-1863, 2016",10.1109/TKDE.2016.2539165,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Items shared through Social Media may affect more than one user's privacy ---
e.g., photos that depict multiple users, comments that mention multiple users,
events in which multiple users are invited, etc. The lack of multi-party
privacy management support in current mainstream Social Media infrastructures
makes users unable to appropriately control to whom these items are actually
shared or not. Computational mechanisms that are able to merge the privacy
preferences of multiple users into a single policy for an item can help solve
this problem. However, merging multiple users' privacy preferences is not an
easy task, because privacy preferences may conflict, so methods to resolve
conflicts are needed. Moreover, these methods need to consider how users' would
actually reach an agreement about a solution to the conflict in order to
propose solutions that can be acceptable by all of the users affected by the
item to be shared. Current approaches are either too demanding or only consider
fixed ways of aggregating privacy preferences. In this paper, we propose the
first computational mechanism to resolve conflicts for multi-party privacy
management in Social Media that is able to adapt to different situations by
modelling the concessions that users make to reach a solution to the conflicts.
We also present results of a user study in which our proposed mechanism
outperformed other existing approaches in terms of how many times each approach
matched users' behaviour.
","[{'version': 'v1', 'created': 'Thu, 16 Jul 2015 16:33:17 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Feb 2016 17:09:42 GMT'}]",2016-06-14,"[['Such', 'Jose M.', ''], ['Criado', 'Natalia', '']]","['Social Media', 'Privacy', 'Conflicts', 'Multi-party Privacy', 'Social Networking Services', 'Online Social Networks']"
4630,1003.3312,Secretary Aircc Journal,"G. G. Md. Nawaz Ali (1), (2), Rajib Chakraborty (2), Md. Shihabul Alam
  (2) and Edward Chan (1), ((1) City University of Hong Kong, China and (2)
  Khulna University of Engineering & Technology, Bangladesh)","An Efficient Approach for Generalized Load Balancing in Multipath Packet
  Switched Networks","12 Pages, IJCNC Journal 2010","International Journal of Computer Networks & Communications 2.2
  (2010) 142-153",10.5121/ijcnc.2010.2211,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper is a quantitative analysis on packet switched network with a view
to generalize load balancing and determination of appropriate routing algorithm
in multipath environment. Several routing algorithms have been introduced for
routing of packets from source to destination. Some of them route packets
accurately with increased workload and some of them drastically cut down the
workload. A few of them can find out a minimum workload deviation for both UDP
and TCP packets. We simulated these approaches in a well defined simulator,
analyzed and evaluated their performance. After expanding our analysis with
varying weights and number of paths we found that the recently proposed routing
algorithm Mixed Weighted Fair Routing (MWFR) outperforms the existing routing
algorithms by reducing the routing and network overhead and saving the scarce
bandwidth as well as CPU consumption for packet switching networks.
","[{'version': 'v1', 'created': 'Wed, 17 Mar 2010 07:15:27 GMT'}]",2010-07-15,"[['Ali', 'G. G. Md. Nawaz', ''], ['Chakraborty', 'Rajib', ''], ['Alam', 'Md. Shihabul', ''], ['Chan', 'Edward', '']]","['Generalized Load sharing (GLS)', 'Weighted Fair Routing (WFR)', 'Quality of Service (QOS)', 'unipath routing', 'multipath routing etc']"
4631,1608.02833,Mundher Al-Shabi,"Mundher Al-Shabi, Wooi Ping Cheah, Tee Connie",Facial Expression Recognition Using a Hybrid CNN-SIFT Aggregator,To be appear in LNAI,,10.1007/978-3-319-69456-6_12,,cs.CV cs.AI cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deriving an effective facial expression recognition component is important
for a successful human-computer interaction system. Nonetheless, recognizing
facial expression remains a challenging task. This paper describes a novel
approach towards facial expression recognition task. The proposed method is
motivated by the success of Convolutional Neural Networks (CNN) on the face
recognition problem. Unlike other works, we focus on achieving good accuracy
while requiring only a small sample data for training. Scale Invariant Feature
Transform (SIFT) features are used to increase the performance on small data as
SIFT does not require extensive training data to generate useful features. In
this paper, both Dense SIFT and regular SIFT are studied and compared when
merged with CNN features. Moreover, an aggregator of the models is developed.
The proposed approach is tested on the FER-2013 and CK+ datasets. Results
demonstrate the superiority of CNN with Dense SIFT over conventional CNN and
CNN with SIFT. The accuracy even increased when all the models are aggregated
which generates state-of-art results on FER-2013 and CK+ datasets, where it
achieved 73.4% on FER-2013 and 99.1% on CK+.
","[{'version': 'v1', 'created': 'Tue, 9 Aug 2016 15:21:33 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Aug 2016 07:44:59 GMT'}, {'version': 'v3', 'created': 'Sat, 3 Dec 2016 11:21:39 GMT'}, {'version': 'v4', 'created': 'Thu, 22 Dec 2016 09:07:30 GMT'}, {'version': 'v5', 'created': 'Sat, 12 Aug 2017 02:58:13 GMT'}]",2019-04-15,"[['Al-Shabi', 'Mundher', ''], ['Cheah', 'Wooi Ping', ''], ['Connie', 'Tee', '']]","['Facial Expression Recognition', 'Dense SIFT', 'CNN', 'SIFT']"
4632,1603.09137,Ross Drummond,"Ross Drummond, Shi Zhao, David A. Howey, Stephen R. Duncan",Circuit Synthesis of Electrochemical Supercapacitor Models,,,10.1016/j.est.2016.11.003,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is concerned with the synthesis of RC electrical circuits from
physics-based supercapacitor models describing conservation and diffusion
relationships. The proposed synthesis procedure uses model discretisation,
linearisation, balanced model order reduction and passive network synthesis to
form the circuits. Circuits with different topologies are synthesized from
several physical models. This work will give greater understanding to the
physical interpretation of electrical circuits and will enable the development
of more generalised circuits, since the synthesized impedance functions are
generated by considering the physics, not from experimental fitting which may
ignore certain dynamics.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2016 11:44:45 GMT'}]",2017-03-16,"[['Drummond', 'Ross', ''], ['Zhao', 'Shi', ''], ['Howey', 'David A.', ''], ['Duncan', 'Stephen R.', '']]","['Supercapacitors', 'Modelling', 'Passive Network Synthesis']"
4633,1711.02597,Felix Engelmann,"Felix Engelmann, Florian Glaser, Henning Kopp, Frank Kargl, Christof
  Weinhardt",Towards an Economic Analysis of Routing in Payment Channel Networks,"6 pages, 3 figures, SERIAL '17 Workshop",,10.1145/3152824.3152826,,cs.CE cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Payment channel networks are supposed to overcome technical scalability
limitations of blockchain infrastructure by employing a special overlay network
with fast payment confirmation and only sporadic settlement of netted
transactions on the blockchain. However, they introduce economic routing
constraints that limit decentralized scalability and are currently not well
understood. In this paper, we model the economic incentives for participants in
payment channel networks. We provide the first formal model of payment channel
economics and analyze how the cheapest path can be found. Additionally, our
simulation assesses the long-term evolution of a payment channel network. We
find that even for small routing fees, sometimes it is cheaper to settle the
transaction directly on the blockchain.
","[{'version': 'v1', 'created': 'Tue, 7 Nov 2017 16:37:22 GMT'}]",2017-11-08,"[['Engelmann', 'Felix', ''], ['Glaser', 'Florian', ''], ['Kopp', 'Henning', ''], ['Kargl', 'Frank', ''], ['Weinhardt', 'Christof', '']]","['Blockchain', 'Bitcoin', 'Ethereum', 'Payment Channel', 'Simulation']"
4634,1101.4285,Lianming Zhang,"Lianming Zhang, Xiaoheng Deng, Jianping Yu and Xiangsheng Wu",Degree and connectivity of the Internet's scale-free topology,"22 pages, 8 figures","Chinese Physics B, Volume 20, Issue 4, pp. 048902 (2011)",10.1088/1674-1056/20/4/048902,,cs.NI cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we theoretically and empirically study the degree and
connectivity of the Internet's scale-free topology at the autonomous system
(AS) level. The basic features of the scale-free network have influence on the
normalization constant of the degree distribution p(k). We develop a
mathematics model of the Internet's scale-free topology. On this model we
theoretically get the formulas of the average degree, the ratios of the
kmin-degree (minimum degree) nodes and the kmax-degree (maximum degree) nodes,
the fraction of the degrees (or links) in the hands of the richer (top
best-connected) nodes. We find the average degree is larger for smaller
power-law exponent {\lambda} and larger minimum or maximum degree. The ratio of
the kmin-degree nodes is larger for larger {\lambda} and smaller kmin or kmax.
The ratio of the kmax-degree ones is larger for smaller {\lambda} and kmax or
larger kmin. The richer nodes hold most of the total degrees of the AS-level
Internet topology. In addition, we reveal the ratio of the kmin-degree nodes or
the rate of the increase of the average degree has power-law decay with the
increase of the kmin. The ratio of the kmax-degree nodes has power-law decay
with the increase of the kmax, and the fraction of the degrees in the hands of
the richer 27% nodes is about 73% (the '73/27 rule'). At last, we empirically
calculate, based on empirical data extracted from BGP, the average degree and
the ratio and fraction using our method and other methods, and find that our
method is rigorous and effective for the AS-level Internet topology.
","[{'version': 'v1', 'created': 'Sat, 22 Jan 2011 13:02:24 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Feb 2011 02:21:19 GMT'}, {'version': 'v3', 'created': 'Thu, 2 Jun 2011 13:02:19 GMT'}]",2011-06-03,"[['Zhang', 'Lianming', ''], ['Deng', 'Xiaoheng', ''], ['Yu', 'Jianping', ''], ['Wu', 'Xiangsheng', '']]","['scale-free networks', 'power-law distribution', 'Internet topology', 'average degree']"
4635,1902.02139,Anton Pirogov,"Christof L\""oding, Anton Pirogov","Determinization of B\""uchi Automata: Unifying the Approaches of Safra
  and Muller-Schupp",Full version of ICALP 2019 paper,,10.4230/LIPIcs.ICALP.2019.120,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Determinization of B\""uchi automata is a long-known difficult problem and
after the seminal result of Safra, who developed the first asymptotically
optimal construction from B\""uchi into Rabin automata, much work went into
improving, simplifying or avoiding Safra's construction. A different, less
known determinization construction was derived by Muller and Schupp and appears
to be unrelated to Safra's construction on the first sight. In this paper we
propose a new meta-construction from nondeterministic B\""uchi to deterministic
parity automata which strictly subsumes both the construction of Safra and the
construction of Muller and Schupp. It is based on a correspondence between
structures that are encoded in the macrostates of the determinization
procedures - Safra trees on one hand, and levels of the split-tree, which
underlies the Muller and Schupp construction, on the other. Our construction
allows for combining the mentioned constructions and opens up new directions
for the development of heuristics.
","[{'version': 'v1', 'created': 'Wed, 6 Feb 2019 12:31:09 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Apr 2019 07:47:34 GMT'}]",2020-04-30,"[['Löding', 'Christof', ''], ['Pirogov', 'Anton', '']]","['Büchi automata', 'determinization', 'parity automata']"
4636,2203.00791,May Alhajri,"May Alhajri, Ahmad Salehi Shahraki and Carsten Rudolph",Privacy of Fitness Applications and Consent Management in Blockchain,"This article has been accepted for publication in a future issue of
  Australasian Computer Science Week 2022 (ACSW 2022), but has not been fully
  edited Content may change prior to final publication. Citation information:
  DOI https://doi.org/10.1145/3511616.3513100, ACSW 2022","In ACSW 2022, February 14 to 18, 2022, Brisbane, Australia. ACM,
  New York, NY, USA 9 Pages",10.1145/3511616.3513100,,cs.CR cs.CY,http://creativecommons.org/licenses/by/4.0/,"  The rapid advances in fitness wearable devices are redefining privacy around
interactions. Fitness wearables devices record a considerable amount of
sensitive and private details about exercise, blood oxygen level, and heart
rate. Privacy concerns have emerged about the interactions between an
individual's raw fitness data and data analysis by the providers of fitness
apps and wearable devices. This paper describes the importance of adopting and
applying legal frameworks within the fitness tracker ecosystem. In this review,
we describe the studies on the current privacy policies of fitness app
providers, heuristically evaluate the methods for consent management by fitness
providers, summarize the gaps identified in our review of these studies, and
discuss potential solutions for filling the gaps identified. We have identified
four main problems related to preserving the privacy of users of fitness apps:
lack of system transparency, lack of privacy policy legibility, concerns
regarding one-time consent, and issues of noncompliance regarding consent
management. After discussing feasible solutions, we conclude by describing how
blockchain is suitable for solving these privacy issues.
","[{'version': 'v1', 'created': 'Tue, 1 Mar 2022 23:31:47 GMT'}]",2022-03-03,"[['Alhajri', 'May', ''], ['Shahraki', 'Ahmad Salehi', ''], ['Rudolph', 'Carsten', '']]","['Privacy', 'Data Protection', 'Legal Framework', 'Consent Management', 'Consent Criteria', 'Fitness Data', 'Fitness Provider', 'Wearable Devices']"
4637,0908.0853,Andrew Adamatzky,"Andrew Adamatzky, Genaro Martinez, Liang Zhang, Andrew Wuensche","Operating binary strings using gliders and eaters in reaction-diffusion
  cellular automaton",,"Mathematical and Computer Modelling, Volume 52, Issues 1-2, July
  2010, Pages 177-190",10.1016/j.mcm.2010.02.006,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study transformations of 2-, 4- and 6-bit numbers in interactions between
traveling and stationary localizations in the Spiral Rule reaction-diffusion
cellular automaton. The Spiral Rule automaton is a hexagonal ternary-state
two-dimensional cellular automaton -- a finite-state machine imitation of an
activator-inhibitor reaction-diffusion system. The activator is self-inhibited
in certain concentrations. The inhibitor dissociates in the absence of the
activator. The Spiral Rule cellular automaton has rich spatio-temporal dynamics
of traveling (glider) and stationary (eater) patterns. When a glider brushes an
eater the eater may slightly change its configuration, which is updated once
more every next hit. We encode binary strings in the states of eaters and
sequences of gliders. We study what types of binary compositions of binary
strings are implementable by sequences of gliders brushing an eater. The models
developed will be used in future laboratory designs of reaction-diffusion
chemical computers.
","[{'version': 'v1', 'created': 'Thu, 6 Aug 2009 12:42:05 GMT'}]",2010-11-23,"[['Adamatzky', 'Andrew', ''], ['Martinez', 'Genaro', ''], ['Zhang', 'Liang', ''], ['Wuensche', 'Andrew', '']]","['cellular automata', 'reaction-diffusion computing', 'gliders', 'collisionbased computing']"
4638,1812.07842,Giovanni Abramo,"Giovanni Abramo, Ciriaco Andrea D'Angelo, Alessandro Caprasecca",Allocative efficiency in public research funding:can bibliometrics help?,,"Abramo, G., D'Angelo, C.A., Caprasecca, A. (2009). Allocative
  efficiency in public research funding: can bibliometrics help? Research
  Policy, 38(1), 206-215",10.1016/j.respol.2008.11.001,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of outcome control modes of research evaluation exercises is ever
more frequent. They are conceived as tools to stimulate increased levels of
research productivity, and to guide choices in allocating components of
government research budgets for publicly funded institutions. There are several
contributions in the literature that compare the different methodological
approaches that policy makers could adopt for these exercises, however the
comparisons are limited to only a few disciplines. This work, examining the
case of the whole of the ""hard sciences"" of the Italian academic system, makes
a comparison between results obtained from peer review type of evaluations (as
adopted by the Ministry of Universities and Research) and those possible from a
bibliometric approach (as developed by the authors). The aim is to understand
to what extent bibliometric methodology, which is noted as relatively
inexpensive, time-saving and exhaustive, can complement and integrate peer
review methodology in research evaluation.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2018 09:45:46 GMT'}]",2018-12-20,"[['Abramo', 'Giovanni', ''], [""D'Angelo"", 'Ciriaco Andrea', ''], ['Caprasecca', 'Alessandro', '']]","['Research assessment', 'universities', 'peer review', 'bibliometrics']"
4639,1407.1737,Touseef Darzi Yousuf,"Touseef Yousuf Darzi, Aminuddin Zabi, Pallavi M","An Approach for Controlling Faults in Wireless Sensor Networks Using
  Clustering","7 pages, 11 figures, Published with International Journal of
  Engineering Trends and Technology (IJETT). arXiv admin note: text overlap
  with arXiv:1209.4751 by other authors without attribution","IJETT, Vol.12, No.6, pp.286-292, Jun 2014. ISSN:2231-5381",10.14445/22315381/IJETT-V12P256,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  Fault control and tolerance in wireless sensor network is a challenging
problem because of limited energy, bandwidth, and computational complexity.
While facing numerous threats these severely resource constrained nodes are
responsible for data collection, data processing, localization, time
synchronization aggregation and data forwarding. One of the effective
approaches to control and tolerate these threats is through clustering. In this
paper we present a new method called Efficient Fault Control Mechanism for
fault controlling in wireless sensor networks based on clustering and
cluster-head selection. Simulation results show Efficient Fault Control
Mechanism has better performance over state of art methods.
","[{'version': 'v1', 'created': 'Mon, 7 Jul 2014 15:12:52 GMT'}]",2014-07-08,"[['Darzi', 'Touseef Yousuf', ''], ['Zabi', 'Aminuddin', ''], ['M', 'Pallavi', '']]","['WSN', 'X-means', 'Round-robin', 'Clustering', 'Fault Tolerance', 'EFCM', 'Cluster Construction', 'Cluster-head']"
4640,1208.0403,Dr Brij Gupta,"Esraa Alomari, Selvakumar Manickam, B. B. Gupta, Shankar Karuppayah,
  Rafeef Alfaris","Botnet-based Distributed Denial of Service (DDoS) Attacks on Web
  Servers: Classification and Art",,,10.5120/7640-0724,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Botnets are prevailing mechanisms for the facilitation of the distributed
denial of service (DDoS) attacks on computer networks or applications.
Currently, Botnet-based DDoS attacks on the application layer are latest and
most problematic trends in network security threats. Botnet-based DDoS attacks
on the application layer limits resources, curtails revenue, and yields
customer dissatisfaction, among others. DDoS attacks are among the most
difficult problems to resolve online, especially, when the target is the Web
server. In this paper, we present a comprehensive study to show the danger of
Botnet-based DDoS attacks on application layer, especially on the Web server
and the increased incidents of such attacks that has evidently increased
recently. Botnet-based DDoS attacks incidents and revenue losses of famous
companies and government websites are also described. This provides better
understanding of the problem, current solution space, and future research scope
to defend against such attacks efficiently.
","[{'version': 'v1', 'created': 'Thu, 2 Aug 2012 05:35:05 GMT'}]",2012-08-03,"[['Alomari', 'Esraa', ''], ['Manickam', 'Selvakumar', ''], ['Gupta', 'B. B.', ''], ['Karuppayah', 'Shankar', ''], ['Alfaris', 'Rafeef', '']]","['Information security', 'Botnet', 'DDoS attacks', 'IRC', 'Web server']"
4641,1610.02488,Jean-Marc Valin,"Yushin Cho, Thomas J. Daede, Nathan E. Egge, Guillaume Martres,
  Tristan Matthews, Christopher Montgomery, Timothy B. Terriberry, Jean-Marc
  Valin",Perceptually-Driven Video Coding with the Daala Video Codec,"19 pages, Proceedings of SPIE Workshop on Applications of Digital
  Image Processing (ADIP), 2016",,10.1117/12.2238417,,cs.MM,http://creativecommons.org/licenses/by/4.0/,"  The Daala project is a royalty-free video codec that attempts to compete with
the best patent-encumbered codecs. Part of our strategy is to replace core
tools of traditional video codecs with alternative approaches, many of them
designed to take perceptual aspects into account, rather than optimizing for
simple metrics like PSNR. This paper documents some of our experiences with
these tools, which ones worked and which did not. We evaluate which tools are
easy to integrate into a more traditional codec design, and show results in the
context of the codec being developed by the Alliance for Open Media.
","[{'version': 'v1', 'created': 'Sat, 8 Oct 2016 05:34:56 GMT'}]",2016-10-11,"[['Cho', 'Yushin', ''], ['Daede', 'Thomas J.', ''], ['Egge', 'Nathan E.', ''], ['Martres', 'Guillaume', ''], ['Matthews', 'Tristan', ''], ['Montgomery', 'Christopher', ''], ['Terriberry', 'Timothy B.', ''], ['Valin', 'Jean-Marc', '']]","['AOM', 'AV1', 'Daala', 'compression', 'codec', 'video', 'perceptual']"
4642,1505.04033,M\'arta Czenky,M\'arta Czenky,An Examination of the Effectiveness of Teaching Data Modelling Concepts,,"International Journal of Database Management Systems ( IJDMS )
  Vol.7, No.2, April 2015",10.5121/ijdms.2015.7202,,cs.CY cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The effective teaching of data modelling concepts is very important; it
constitutes the fundament of database planning methods and the handling of
databases with the help of database management lan-guages, typically SQL. We
examined three courses. The students of two courses prepared for the exam by
solving tests, while the students of the third course prepared by solving tasks
from a printed exercise book. The number of task for the second course was 2.5
times more than the number of task for the first course. The main purpose of
our examination was to determine the effectiveness of the teaching of data
modelling concepts, and to decide if there is a significant difference between
the results of the three courses. According to our examination, with increasing
the number of test tasks and with the use of exercise book, the results became
significantly better.
","[{'version': 'v1', 'created': 'Fri, 15 May 2015 11:20:45 GMT'}]",2015-05-18,"[['Czenky', 'Márta', '']]","['Data modelling', 'Teaching of Data Modelling Concepts', 'Survey', 'Statistical Analysis', 'Data Mining Analysis']"
4643,1710.03439,Yuqing Zhu,"Yuqing Zhu, Jianxun Liu, Mengying Guo, Yungang Bao, Wenlong Ma,
  Zhuoyue Liu, Kunpeng Song, Yingchun Yang","BestConfig: Tapping the Performance Potential of Systems via Automatic
  Configuration Tuning",,ACM SoCC 2017,10.1145/3127479.3128605,,cs.PF cs.DB cs.DC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An ever increasing number of configuration parameters are provided to system
users. But many users have used one configuration setting across different
workloads, leaving untapped the performance potential of systems. A good
configuration setting can greatly improve the performance of a deployed system
under certain workloads. But with tens or hundreds of parameters, it becomes a
highly costly task to decide which configuration setting leads to the best
performance. While such task requires the strong expertise in both the system
and the application, users commonly lack such expertise.
  To help users tap the performance potential of systems, we present
BestConfig, a system for automatically finding a best configuration setting
within a resource limit for a deployed system under a given application
workload. BestConfig is designed with an extensible architecture to automate
the configuration tuning for general systems. To tune system configurations
within a resource limit, we propose the divide-and-diverge sampling method and
the recursive bound-and-search algorithm. BestConfig can improve the throughput
of Tomcat by 75%, that of Cassandra by 63%, that of MySQL by 430%, and reduce
the running time of Hive join job by about 50% and that of Spark join job by
about 80%, solely by configuration adjustment.
","[{'version': 'v1', 'created': 'Tue, 10 Oct 2017 08:10:06 GMT'}]",2017-10-11,"[['Zhu', 'Yuqing', ''], ['Liu', 'Jianxun', ''], ['Guo', 'Mengying', ''], ['Bao', 'Yungang', ''], ['Ma', 'Wenlong', ''], ['Liu', 'Zhuoyue', ''], ['Song', 'Kunpeng', ''], ['Yang', 'Yingchun', '']]","['automatic configuration tuning', 'ACT', 'performance optimization']"
4644,1006.0869,Secretary Aircc Journal,"Hao Shi (Victoria University, Australia)",An Interactive Zoo Guide: A Case Study of Collaborative Learning,11 Pages,"International journal of Multimedia & Its Applications 2.2 (2010)
  57-67",10.5121/ijma.2010.2205,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Real Industry Projects and team work can have a great impact on student
learning but providing these activities requires significant commitment from
academics. It requires several years planning implementing to create a
collaborative learning environment that mimics the real world ICT (Information
and Communication Technology) industry workplace. In this project, staff from
all the three faculties, namely the Faculty of Health, Engineering and Science,
Faculty of Arts, Education and Human Development, and Faculty of Business and
Law in higher education work together to establish a detailed project
management plan and to develop the unit guidelines for participating students.
The proposed project brings together students from business, multimedia and
computer science degrees studying their three project-based units within each
faculty to work on a relatively large IT project with our industry partner,
Melbourne Zoo. This paper presents one multimedia software project accomplished
by one of the multi-discipline student project teams. The project was called
'Interactive ZooOz Guide' and developed on a GPS-enabled PDA device in 2007.
The developed program allows its users to navigate through the Zoo via an
interactive map and provides multimedia information of animals on hotspots at
the 'Big Cats' section of the Zoo so that it enriches user experience at the
Zoo. A recent development in zoo applications is also reviewed. This paper is
also intended to encourage academia to break boundaries to enhance students'
learning beyond classroom.
","[{'version': 'v1', 'created': 'Fri, 4 Jun 2010 11:32:47 GMT'}]",2010-07-15,"[['Shi', 'Hao', '', 'Victoria University, Australia']]","['Industry Projects', 'Multimedia Applications', 'Mobile Computing', 'Global Positioning System (GPS)', 'Collaborative Learning', 'Software Project Management']"
4645,1712.10068,Joss Wright,Martin Dittus and Joss Wright and Mark Graham,"Platform Criminalism: The 'Last-Mile' Geography of the Darknet Market
  Supply Chain",,,10.1145/3178876.3186094,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Does recent growth of darknet markets signify a slow reorganisation of the
illicit drug trade? Where are darknet markets situated in the global drug
supply chain? In principle, these platforms allow producers to sell directly to
end users, bypassing traditional trafficking routes. And yet, there is evidence
that many offerings originate from a small number of highly active consumer
countries, rather than from countries that are primarily known for drug
production. In a large-scale empirical study, we determine the darknet trading
geography of three plant-based drugs across four of the largest darknet
markets, and compare it to the global footprint of production and consumption
for these drugs. We present strong evidence that cannabis and cocaine vendors
are primarily located in a small number of consumer countries, rather than
producer countries, suggesting that darknet trading happens at the 'last mile',
possibly leaving old trafficking routes intact. A model to explain trading
volumes of opiates is inconclusive. We cannot find evidence for significant
production-side offerings across any of the drug types or marketplaces. Our
evidence further suggests that the geography of darknet market trades is
primarily driven by existing consumer demand, rather than new demand fostered
by individual markets.
","[{'version': 'v1', 'created': 'Thu, 28 Dec 2017 22:00:40 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Jan 2018 21:32:24 GMT'}, {'version': 'v3', 'created': 'Sun, 11 Mar 2018 22:49:13 GMT'}]",2018-05-01,"[['Dittus', 'Martin', ''], ['Wright', 'Joss', ''], ['Graham', 'Mark', '']]","['Darknet markets', 'cryptomarkets', 'platforms', 'online crime', 'economicgeography', 'information geography']"
4646,1902.11167,Sherief Hussien Murad,"Sherief H. Murad, Amr M. Gody and Tamer M. Barakat","Enhanced Security of Symmetric Encryption Using Combination of
  Steganography with Visual Cryptography","6 pages, 10 figures, 1 table","International Journal of Engineering Trends and Technology
  (IJETT)2018",10.14445/22315381/IJETT-V65P227,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data security is required when communications over untrusted networks takes
place. Security tools such as cryptography and steganography are applied to
achieve such objectives, but both have limitations and susceptible to attacks
if they were used individually. To overcome these limitations, we proposed a
powerful and secured system based on the integration of cryptography and
steganography. The secret message is encrypted with blowfish cipher and visual
cryptography. Finally, the encrypted data is embedded into two innocent cover
images for future transmission. An extended analysis was made to prove the
efficiency of the proposed model by measuring Mean-Square-Error (MSE),
Peak-Signal-to-noise-Ratio (PSNR), and image histogram. The robustness was
examined by launching statistical and 8-bit plane visual attacks. The proposed
model provides a secure mean to transmit or store highly classified data that
could be applied to the public security sector.
","[{'version': 'v1', 'created': 'Thu, 28 Feb 2019 15:48:07 GMT'}]",2019-03-01,"[['Murad', 'Sherief H.', ''], ['Gody', 'Amr M.', ''], ['Barakat', 'Tamer M.', '']]","['Blowfish', 'Visual Cryptography', 'LSB']"
4647,1811.12598,Kyle Vedder,Kyle Vedder and Joydeep Biswas,"X*: Anytime Multi-Agent Path Finding for Sparse Domains using
  Window-Based Iterative Repairs",,"Artificial Intelligence, Volume 291, 2021",10.1016/j.artint.2020.103417,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real-world multi-agent systems such as warehouse robots operate under
significant time constraints -- in such settings, rather than spending
significant amounts of time solving for optimal paths, it is instead preferable
to find valid collision-free paths quickly, even if suboptimal, and given
additional time, to iteratively refine such paths to improve their cost. In
such domains, we observe that agent-agent collisions are sparse -- they involve
small local subsets of agents, and are geographically contained within a small
region of the overall space.
  Leveraging this insight, we can first plan paths for each agent individually,
and in the cases of collisions between agents, perform small local repairs
limited to local subspace windows. As time permits, these windows can be
successively grown and the repairs within them refined, thereby improving the
path quality, and eventually converging to the global joint optimal solution.
Using these insights, we present two algorithmic contributions: 1) the Windowed
Anytime Multiagent Planning Framework (WAMPF) for a class of anytime planners
that quickly generate valid paths with suboptimality estimates and generate
optimal paths given sufficient time, and 2) X*, an efficient WAMPF-based
planner. X* is able to efficiently find successive valid solutions by employing
re-use techniques during the repair growth step of WAMPF.
  Experimentally, we demonstrate that in sparse domains: 1) X* outperforms
state-of-the-art anytime or optimal MAPF solvers in time to valid path, 2) X*
is competitive with state-of-the-art anytime or optimal MAPF solvers in time to
optimal path, 3) X* quickly converges to very tight suboptimality bounds, and
4) X* is competitive with state-of-the-art suboptimal MAPF solvers in time to
valid path for small numbers of agents while providing much higher quality
paths.
","[{'version': 'v1', 'created': 'Fri, 30 Nov 2018 03:21:40 GMT'}, {'version': 'v2', 'created': 'Mon, 9 Sep 2019 17:40:50 GMT'}, {'version': 'v3', 'created': 'Sat, 2 May 2020 23:08:45 GMT'}, {'version': 'v4', 'created': 'Mon, 10 Aug 2020 22:42:07 GMT'}, {'version': 'v5', 'created': 'Wed, 28 Oct 2020 02:57:35 GMT'}]",2021-11-01,"[['Vedder', 'Kyle', ''], ['Biswas', 'Joydeep', '']]","['Multiagent Systems', 'Motion and Path Planning', 'Multi-AgentPath Finding', 'Anytime Path Finding']"
4648,1303.3764,Michael (Micky) Fire,"Michael Fire, Roy Goldschmidt, and Yuval Elovici",Online Social Networks: Threats and Solutions,Draft Version,,10.1109/COMST.2014.2321628,,cs.SI cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many online social network (OSN) users are unaware of the numerous security
risks that exist in these networks, including privacy violations, identity
theft, and sexual harassment, just to name a few. According to recent studies,
OSN users readily expose personal and private details about themselves, such as
relationship status, date of birth, school name, email address, phone number,
and even home address. This information, if put into the wrong hands, can be
used to harm users both in the virtual world and in the real world. These risks
become even more severe when the users are children. In this paper we present a
thorough review of the different security and privacy risks which threaten the
well-being of OSN users in general, and children in particular. In addition, we
present an overview of existing solutions that can provide better protection,
security, and privacy for OSN users. We also offer simple-to-implement
recommendations for OSN users which can improve their security and privacy when
using these platforms. Furthermore, we suggest future research directions.
","[{'version': 'v1', 'created': 'Fri, 15 Mar 2013 13:17:07 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Sep 2013 13:53:01 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Jul 2014 21:29:50 GMT'}]",2014-07-25,"[['Fire', 'Michael', ''], ['Goldschmidt', 'Roy', ''], ['Elovici', 'Yuval', '']]","['Online Social Networks', 'Security and Privacy', 'OnlineSocial Network Security Threats', 'Online Social Network Security Solutions']"
4649,1811.02034,Matteo Marra,"Matteo Marra (Vrije Universiteit Brussel, Belgium), Guillermo Polito
  (INRIA, France), Elisa Gonzalez Boix (Vrije Universiteit Brussel, Belgium)","Out-Of-Place debugging: a debugging architecture to reduce debugging
  interference",,"The Art, Science, and Engineering of Programming, 2019, Vol. 3,
  Issue 2, Article 3",10.22152/programming-journal.org/2019/3/3,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context. Recent studies show that developers spend most of their programming
time testing, verifying and debugging software. As applications become more and
more complex, developers demand more advanced debugging support to ease the
software development process.
  Inquiry. Since the 70's many debugging solutions were introduced. Amongst
them, online debuggers provide a good insight on the conditions that led to a
bug, allowing inspection and interaction with the variables of the program.
However, most of the online debugging solutions introduce \textit{debugging
interference} to the execution of the program, i.e. pauses, latency, and
evaluation of code containing side-effects.
  Approach. This paper investigates a novel debugging technique called
\outofplace debugging. The goal is to minimize the debugging interference
characteristic of online debugging while allowing online remote capabilities.
An \outofplace debugger transfers the program execution and application state
from the debugged application to the debugger application, both running in
different processes.
  Knowledge. On the one hand, \outofplace debugging allows developers to debug
applications remotely, overcoming the need of physical access to the machine
where the debugged application is running. On the other hand, debugging happens
locally on the remote machine avoiding latency. That makes it suitable to be
deployed on a distributed system and handle the debugging of several processes
running in parallel.
  Grounding. We implemented a concrete out-of-place debugger for the Pharo
Smalltalk programming language. We show that our approach is practical by
performing several benchmarks, comparing our approach with a classic remote
online debugger. We show that our prototype debugger outperforms by a 1000
times a traditional remote debugger in several scenarios. Moreover, we show
that the presence of our debugger does not impact the overall performance of an
application.
  Importance. This work combines remote debugging with the debugging experience
of a local online debugger. Out-of-place debugging is the first online
debugging technique that can minimize debugging interference while debugging a
remote application. Yet, it still keeps the benefits of online debugging ( e.g.
step-by-step execution). This makes the technique suitable for modern
applications which are increasingly parallel, distributed and reactive to
streams of data from various sources like sensors, UI, network, etc.
","[{'version': 'v1', 'created': 'Mon, 5 Nov 2018 21:07:48 GMT'}]",2018-11-07,"[['Marra', 'Matteo', '', 'Vrije Universiteit Brussel, Belgium'], ['Polito', 'Guillermo', '', 'INRIA, France'], ['Boix', 'Elisa Gonzalez', '', 'Vrije Universiteit Brussel, Belgium']]","['debugging tools', 'online debugging', 'remote debugging', 'distributed systems']"
4650,1607.08119,"Hans-Peter Schr\""ocker","Tudor-Dan Rad, Daniel F. Scharler, Hans-Peter Schr\""ocker","The Kinematic Image of RR, PR, and RP Dyads",,,10.1017/S0263574718000504,,cs.RO math.MG math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide necessary and sufficient conditions for admissible transformations
in the projectivised dual quaternion model of rigid body displacements and we
characterise constraint varieties of dyads with revolute and prismatic joints
in this model. Projective transformations induced by coordinate changes in
moving and/or fixed frame fix the quadrics of a pencil and preserve the two
families of rulings of an exceptional three-dimensional quadric. The constraint
variety of a dyad with two revolute joints is a regular ruled quadric in a
three-space that contains a ""null quadrilateral"". If a revolute joint is
replaced by a prismatic joint, this quadrilateral collapses into a pair of
conjugate complex null lines and a real line but these properties are not
sufficient to characterise such dyads. We provide a complete characterisation
by introducing a new invariant, the ""fiber projectivity"", and we present
examples that demonstrate its potential to explain hitherto not sufficiently
well understood phenomena.
","[{'version': 'v1', 'created': 'Wed, 27 Jul 2016 14:29:29 GMT'}]",2018-07-31,"[['Rad', 'Tudor-Dan', ''], ['Scharler', 'Daniel F.', ''], ['Schröcker', 'Hans-Peter', '']]","['Kinematic map', 'dual quaternion', 'Study quadric', 'null cone', 'revolute joint', 'prismatic joint', 'fiber projectivity', 'verticalDarboux motion']"
4651,1107.0439,H. Reiju Mihara,"Masahiro Kumabe, H. Reiju Mihara",The Nakamura numbers for computable simple games,24+1 pages,Social Choice and Welfare (2008) 31:621-640,10.1007/s00355-008-0300-5,,cs.GT cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Nakamura number of a simple game plays a critical role in preference
aggregation (or multi-criterion ranking): the number of alternatives that the
players can always deal with rationally is less than this number. We
comprehensively study the restrictions that various properties for a simple
game impose on its Nakamura number. We find that a computable game has a finite
Nakamura number greater than three only if it is proper, nonstrong, and
nonweak, regardless of whether it is monotonic or whether it has a finite
carrier. The lack of strongness often results in alternatives that cannot be
strictly ranked.
","[{'version': 'v1', 'created': 'Sun, 3 Jul 2011 09:03:44 GMT'}]",2011-07-05,"[['Kumabe', 'Masahiro', ''], ['Mihara', 'H. Reiju', '']]","['Nakamura number', 'voting games', 'core', 'Turing computability', 'axiomatic method', 'multi-criterion decision-making']"
4652,1502.01782,Conrad Sanderson,"Johanna Carvajal, Conrad Sanderson, Chris McCool, Brian C. Lovell","Multi-Action Recognition via Stochastic Modelling of Optical Flow and
  Gradients",,"Workshop on Machine Learning for Sensory Data Analysis (MLSDA),
  pp. 19-24, 2014",10.1145/2689746.2689748,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a novel approach to multi-action recognition that
performs joint segmentation and classification. This approach models each
action using a Gaussian mixture using robust low-dimensional action features.
Segmentation is achieved by performing classification on overlapping temporal
windows, which are then merged to produce the final result. This approach is
considerably less complicated than previous methods which use dynamic
programming or computationally expensive hidden Markov models (HMMs). Initial
experiments on a stitched version of the KTH dataset show that the proposed
approach achieves an accuracy of 78.3%, outperforming a recent HMM-based
approach which obtained 71.2%.
","[{'version': 'v1', 'created': 'Fri, 6 Feb 2015 03:30:10 GMT'}]",2015-02-09,"[['Carvajal', 'Johanna', ''], ['Sanderson', 'Conrad', ''], ['McCool', 'Chris', ''], ['Lovell', 'Brian C.', '']]","['human action recognition', 'multi-action recognition', 'segmentation', 'stochastic modelling', 'Gaussian mixture models']"
4653,2003.12730,Matias Martinez,"Matias Martinez, Bruno Gois Mateus",Why did developers migrate Android applications from Java to Kotlin?,Published in IEEE Transactions on Software Engineering,,10.1109/TSE.2021.3120367,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Currently, the majority of apps running on mobile devices are Android apps
developed in Java. However, developers can now write Android applications using
a new programming language: Kotlin, which Google adopted in 2017 as an official
programming language for developing Android apps. Since then, Android
developers have been able to: a) start writing Android applications from
scratch using Kotlin, b) evolve their existing Android applications written in
Java by adding Kotlin code (possible thanks to the interoperability between the
two languages), or c) migrate their Android apps from Java to Kotlin. This
paper aims to study this last case. We conducted a qualitative study to find
out why Android developers have migrated Java code to Kotlin and to bring
together their experiences about the process, in order to identify the main
difficulties they have faced. To execute the study, we first identified commits
from open-source Android projects that have migrated Java code to Kotlin. Then,
we emailed the developers that wrote those migrations. We thus obtained
information from 98 developers who had migrated code from Java to Kotlin. This
paper presents the main reasons identified by the study for performing the
migration. We found that developers migrated Java code to Kotlin in order to
access programming language features (e.g., extension functions, lambdas, smart
casts) that are not available with Java for Android development, and to obtain
safer code (i.e., avoid null-pointer exceptions). We also identified research
directions that the research community could focus on in order to help
developers to improve the experience of migrating their Java applications to
Kotlin.
","[{'version': 'v1', 'created': 'Sat, 28 Mar 2020 06:46:01 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Sep 2021 09:57:06 GMT'}, {'version': 'v3', 'created': 'Mon, 22 Nov 2021 14:14:18 GMT'}]",2021-11-23,"[['Martinez', 'Matias', ''], ['Mateus', 'Bruno Gois', '']]","['Migration', 'Mining repositories', 'Kotlin', 'Java', 'Android', 'Mobiledevelopment', 'Software evolution', 'Qualitative study']"
4654,2105.09578,Hongshi Tan,"Hongshi Tan, Xinyu Chen, Yao Chen, Bingsheng He, Weng-Fai Wong","ThundeRiNG: Generating Multiple Independent Random Number Sequences on
  FPGAs",Accepted to ICS 2021,,10.1145/3447818.3461664,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose ThundeRiNG, a resource-efficient and
high-throughput system for generating multiple independent sequences of random
numbers (MISRN) on FPGAs. Generating MISRN can be a time-consuming step in many
applications such as numeric computation and approximate computing. Despite
that decades of studies on generating a single sequence of random numbers on
FPGAs have achieved very high throughput and high quality of randomness,
existing MISRN approaches either suffer from heavy resource consumption or fail
to achieve statistical independence among sequences. In contrast, ThundeRiNG
resolves the dependence by using a resource-efficient decorrelator among
multiple sequences, guaranteeing a high statistical quality of randomness.
Moreover, ThundeRiNG develops a novel state sharing among a massive number of
pseudo-random number generator instances on FPGAs. The experimental results
show that ThundeRiNG successfully passes the widely used statistical test,
TestU01, only consumes a constant number of DSPs (less than 1\% of the FPGA
resource capacity) for generating any number of sequences, and achieves a
throughput of 655 billion random numbers per second. Compared to the
state-of-the-art GPU library, ThundeRiNG demonstrates a $10.62\times$ speedup
on MISRN and delivers up to $9.15\times$ performance and $26.63\times$ power
efficiency improvement on two applications ($\pi$ estimation and Monte Carlo
option pricing). This work is open-sourced on Github at
https://github.com/Xtra-Computing/ThundeRiNG
","[{'version': 'v1', 'created': 'Thu, 20 May 2021 08:09:57 GMT'}]",2021-05-21,"[['Tan', 'Hongshi', ''], ['Chen', 'Xinyu', ''], ['Chen', 'Yao', ''], ['He', 'Bingsheng', ''], ['Wong', 'Weng-Fai', '']]","['FPGA', 'pseudorandom number generation', 'statistical testing']"
4655,2106.07851,Christopher M. Poskitt,"Yuqi Chen, Christopher M. Poskitt, Jun Sun","Code Integrity Attestation for PLCs using Black Box Neural Network
  Predictions","Accepted by the 29th ACM Joint European Software Engineering
  Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE
  2021)","Proc. ESEC/FSE 2021, pages 32-44. ACM, 2021",10.1145/3468264.3468617,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cyber-physical systems (CPSs) are widespread in critical domains, and
significant damage can be caused if an attacker is able to modify the code of
their programmable logic controllers (PLCs). Unfortunately, traditional
techniques for attesting code integrity (i.e. verifying that it has not been
modified) rely on firmware access or roots-of-trust, neither of which
proprietary or legacy PLCs are likely to provide. In this paper, we propose a
practical code integrity checking solution based on privacy-preserving black
box models that instead attest the input/output behaviour of PLC programs.
Using faithful offline copies of the PLC programs, we identify their most
important inputs through an information flow analysis, execute them on multiple
combinations to collect data, then train neural networks able to predict PLC
outputs (i.e. actuator commands) from their inputs. By exploiting the black box
nature of the model, our solution maintains the privacy of the original PLC
code and does not assume that attackers are unaware of its presence. The trust
instead comes from the fact that it is extremely hard to attack the PLC code
and neural networks at the same time and with consistent outcomes. We evaluated
our approach on a modern six-stage water treatment plant testbed, finding that
it could predict actuator states from PLC inputs with near-100% accuracy, and
thus could detect all 120 effective code mutations that we subjected the PLCs
to. Finally, we found that it is not practically possible to simultaneously
modify the PLC code and apply discreet adversarial noise to our attesters in a
way that leads to consistent (mis-)predictions.
","[{'version': 'v1', 'created': 'Tue, 15 Jun 2021 03:09:29 GMT'}, {'version': 'v2', 'created': 'Sat, 17 Jul 2021 07:05:39 GMT'}]",2021-08-24,"[['Chen', 'Yuqi', ''], ['Poskitt', 'Christopher M.', ''], ['Sun', 'Jun', '']]","['Cyber-physical systems', 'programmable logic controllers', 'attestation', 'code integrity checking', 'neural networks', 'adversarial attacks']"
4656,1212.3496,Ilja Honkonen,"I. Honkonen (1,2), S. von Alfthan (1), A. Sandroos (1), P. Janhunen
  (1), M. Palmroth (1) ((1) Finnish Meteorological Institute, Helsinki,
  Finland, (2) Department of Physics, University of Helsinki, Helsinki,
  Finland)",Parallel grid library for rapid and flexible simulation development,"Accepted to Computer Physics Communications, 36 pages, 13 figures","Computer Physics Communications, Volume 184, Issue 4, April 2013,
  Pages 1297-1309",10.1016/j.cpc.2012.12.017,,cs.DC physics.comp-ph physics.space-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an easy to use and flexible grid library for developing highly
scalable parallel simulations. The distributed cartesian cell-refinable grid
(dccrg) supports adaptive mesh refinement and allows an arbitrary C++ class to
be used as cell data. The amount of data in grid cells can vary both in space
and time allowing dccrg to be used in very different types of simulations, for
example in fluid and particle codes. Dccrg transfers the data between
neighboring cells on different processes transparently and asynchronously
allowing one to overlap computation and communication. This enables excellent
scalability at least up to 32 k cores in magnetohydrodynamic tests depending on
the problem and hardware. In the version of dccrg presented here part of the
mesh metadata is replicated between MPI processes reducing the scalability of
adaptive mesh refinement (AMR) to between 200 and 600 processes. Dccrg is free
software that anyone can use, study and modify and is available at
[https://gitorious.org/dccrg]. Users are also kindly requested to cite this
work when publishing results obtained with dccrg.
","[{'version': 'v1', 'created': 'Fri, 14 Dec 2012 15:03:16 GMT'}]",2013-01-30,"[['Honkonen', 'I.', ''], ['von Alfthan', 'S.', ''], ['Sandroos', 'A.', ''], ['Janhunen', 'P.', ''], ['Palmroth', 'M.', '']]","['Parallel grid', 'adaptive mesh refinement', 'free open source software']"
4657,1203.3431,K.S.Kuppusamy,"K.S. Kuppusamy, Senthilraja.R, G. Aghila","A Model for Remote Access and Protection of Smartphones using Short
  Message Service","10 Pages, 11 Figures","International Journal of Computer Science, Engineering and
  Information Technology (IJCSEIT), Vol.2, No.1, February 2012",10.5121/ijcseit.2012.2109,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The smartphone usage among people is increasing rapidly. With the phenomenal
growth of smartphone use, smartphone theft is also increasing. This paper
proposes a model to secure smartphones from theft as well as provides options
to access a smartphone through other smartphone or a normal mobile via Short
Message Service. This model provides option to track and secure the mobile by
locking it. It also provides facilities to receive the incoming call and sms
information to the remotely connected device and enables the remote user to
control the mobile through SMS. The proposed model is validated by the
prototype implementation in Android platform. Various tests are conducted in
the implementation and the results are discussed.
","[{'version': 'v1', 'created': 'Mon, 5 Mar 2012 04:03:22 GMT'}]",2012-03-16,"[['Kuppusamy', 'K. S.', ''], ['R', 'Senthilraja.', ''], ['Aghila', 'G.', '']]","['Smartphone security', 'remote access', 'mobile security', 'theft protection']"
4658,1807.00537,Hao Luo,"Xing Fan, Wei Jiang, Hao Luo, Mengjuan Fei,","SphereReID: Deep Hypersphere Manifold Embedding for Person
  Re-Identification","Contribute to Journal of Visual Communication and Image
  Representation",,10.1016/j.jvcir.2019.01.010,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many current successful Person Re-Identification(ReID) methods train a model
with the softmax loss function to classify images of different persons and
obtain the feature vectors at the same time. However, the underlying feature
embedding space is ignored. In this paper, we use a modified softmax function,
termed Sphere Softmax, to solve the classification problem and learn a
hypersphere manifold embedding simultaneously. A balanced sampling strategy is
also introduced. Finally, we propose a convolutional neural network called
SphereReID adopting Sphere Softmax and training a single model end-to-end with
a new warming-up learning rate schedule on four challenging datasets including
Market-1501, DukeMTMC-reID, CHHK-03, and CUHK-SYSU. Experimental results
demonstrate that this single model outperforms the state-of-the-art methods on
all four datasets without fine-tuning or re-ranking. For example, it achieves
94.4% rank-1 accuracy on Market-1501 and 83.9% rank-1 accuracy on
DukeMTMC-reID. The code and trained weights of our model will be released.
","[{'version': 'v1', 'created': 'Mon, 2 Jul 2018 08:53:01 GMT'}]",2019-04-22,"[['Fan', 'Xing', ''], ['Jiang', 'Wei', ''], ['Luo', 'Hao', ''], ['Fei', 'Mengjuan', '']]","['Person Re-Identification', 'Classification', 'Feature Embedding', 'CNN', 'Hypersphere']"
4659,1507.02988,Ravi Chugh,"Ravi Chugh, Brian Hempel, Mitchell Spradlin, Jacob Albers","Programmatic and Direct Manipulation, Together at Last",PLDI 2016 Paper + Supplementary Appendices,,10.1145/2908080.2908103,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Direct manipulation interfaces and programmatic systems have distinct and
complementary strengths. The former provide intuitive, immediate visual
feedback and enable rapid prototyping, whereas the latter enable complex,
reusable abstractions. Unfortunately, existing systems typically force users
into just one of these two interaction modes.
  We present a system called Sketch-n-Sketch that integrates programmatic and
direct manipulation for the particular domain of Scalable Vector Graphics
(SVG). In Sketch-n-Sketch, the user writes a program to generate an output SVG
canvas. Then the user may directly manipulate the canvas while the system
immediately infers a program update in order to match the changes to the
output, a workflow we call live synchronization. To achieve this, we propose
(i) a technique called trace-based program synthesis that takes program
execution history into account in order to constrain the search space and (ii)
heuristics for dealing with ambiguities. Based on our experience with examples
spanning 2,000 lines of code and from the results of a preliminary user study,
we believe that Sketch-n-Sketch provides a novel workflow that can augment
traditional programming systems. Our approach may serve as the basis for live
synchronization in other application domains, as well as a starting point for
yet more ambitious ways of combining programmatic and direct manipulation.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2015 18:55:56 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Nov 2015 22:51:03 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Apr 2016 18:56:50 GMT'}]",2016-04-19,"[['Chugh', 'Ravi', ''], ['Hempel', 'Brian', ''], ['Spradlin', 'Mitchell', ''], ['Albers', 'Jacob', '']]","['Sketch-n-Sketch', 'Prodirect Manipulation', 'SVG']"
4660,1406.6705,Abdelmalek Amine,"Mohamed Adnane Mellah, Abdelmalek Amine, Reda Mohamed Hamou, A.V.
  Senthil Kumar",Link Analysis for Communities Detection on Facebook,"15 pages, 7 figures, International Journal of Data Mining And
  Emerging Technologies, 2014, Volume 4, Issue 1",,10.5958/2249-3220.2014.00017.2,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social networks have become a part in the daily life of millions of users,
which offer wide range of interests and practices. The main characteristic of
social networks is its ability to gather different individuals around a common
point of view or collective beliefs. Among the current social networking sites,
Facebook is the most popular, which has the highest number of users. However,
in Facebook, the existence of communities (groups)is a critical question; thus,
many researchers focus on potential communities by using techniques like data
mining and web mining. In this work, we present four approaches based on link
analysis techniques to detect prospective groups and their members
","[{'version': 'v1', 'created': 'Wed, 25 Jun 2014 20:16:23 GMT'}]",2014-06-27,"[['Mellah', 'Mohamed Adnane', ''], ['Amine', 'Abdelmalek', ''], ['Hamou', 'Reda Mohamed', ''], ['Kumar', 'A. V. Senthil', '']]","['Social Network Analysis', 'Link analysis', 'Facebook', 'Data mining', 'Groups']"
4661,1904.01689,Brent Hecht,B. Hecht and D. Gergle,"The Tower of Babel Meets Web 2.0: User-Generated Content and its
  Applications in a Multilingual Context","CHI 2010 Proceedings of the SIGCHI Conference on Human Factors in
  Computing Systems",,10.1145/1753326.1753370,,cs.CL cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study explores language's fragmenting effect on user-generated content
by examining the diversity of knowledge representations across 25 different
Wikipedia language editions. This diversity is measured at two levels: the
concepts that are included in each edition and the ways in which these concepts
are described. We demonstrate that the diversity present is greater than has
been presumed in the literature and has a significant influence on applications
that use Wikipedia as a source of world knowledge. We close by explicating how
knowledge diversity can be beneficially leveraged to create ""culturally-aware
applications"" and ""hyperlingual applications"".
","[{'version': 'v1', 'created': 'Tue, 2 Apr 2019 22:23:05 GMT'}]",2019-04-04,"[['Hecht', 'B.', ''], ['Gergle', 'D.', '']]","['Wikipedia', 'knowledge diversity', 'multilingual', 'hyperlingual', 'Explicit Semantic Analysis', 'semantic relatedness']"
4662,1509.08778,Gabriel Martins Dias,"Gabriel Martins Dias, Boris Bellalta, Simon Oechsner","The Impact of Dual Prediction Schemes on the Reduction of the Number of
  Transmissions in Sensor Networks","30 pages, 8 figures",Computer Communications 112C (2017) pp. 58-72,10.1016/j.comcom.2017.08.002,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Future Internet of Things (IoT) applications will require that billions of
wireless devices transmit data to the cloud frequently. However, the wireless
medium access is pointed as a problem for the next generations of wireless
networks; hence, the number of data transmissions in Wireless Sensor Networks
(WSNs) can quickly become a bottleneck, disrupting the exponential growth in
the number of interconnected devices, sensors, and amount of produced data.
Therefore, keeping a low number of data transmissions is critical to
incorporate new sensor nodes and measure a great variety of parameters in
future generations of WSNs. Thanks to the high accuracy and low complexity of
state-of-the-art forecasting algorithms, Dual Prediction Schemes (DPSs) are
potential candidates to optimize the data transmissions in WSNs at the finest
level because they facilitate for sensor nodes to avoid unnecessary
transmissions without affecting the quality of their measurements. In this
work, we present a sensor network model that uses statistical theorems to
describe the expected impact of DPSs and data aggregation in WSNs. We aim to
provide a foundation for future works by characterizing the theoretical gains
of processing data in sensors and conditioning its transmission to the
predictions' accuracy. Our simulation results show that the number of
transmissions can be reduced by almost 98% in the sensor nodes with the highest
workload. We also detail the impact of predicting and aggregating transmissions
according to the parameters that can be observed in common scenarios, such as
sensor nodes' transmission ranges, the correlation between measurements of
different sensors, and the period between two consecutive measurements in a
sensor.
","[{'version': 'v1', 'created': 'Tue, 29 Sep 2015 14:36:11 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Jul 2016 19:13:48 GMT'}, {'version': 'v3', 'created': 'Thu, 31 Aug 2017 02:38:33 GMT'}]",2017-09-01,"[['Dias', 'Gabriel Martins', ''], ['Bellalta', 'Boris', ''], ['Oechsner', 'Simon', '']]","['sensor networks', 'data science', 'predictions', 'data reduction', 'model']"
4663,1810.07085,Stef Maree,"S.C. Maree, T. Alderliesten, D. Thierens, P.A.N. Bosman","Real-Valued Evolutionary Multi-Modal Optimization driven by Hill-Valley
  Clustering",,"In Proceedings of the Genetic and Evolutionary Computation
  Conference 2018, GECCO-2018, July 15-19, 2018, Kyoto, Japan. ACM, New York,
  NY, USA",10.1145/3205455.3205477,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Model-based evolutionary algorithms (EAs) adapt an underlying search model to
features of the problem at hand, such as the linkage between problem variables.
The performance of EAs often deteriorates as multiple modes in the fitness
landscape are modelled with a unimodal search model. The number of modes is
however often unknown a priori, especially in a black-box setting, which
complicates adaptation of the search model. In this work, we focus on models
that can adapt to the multi-modality of the fitness landscape. Specifically, we
introduce Hill-Valley Clustering, a remarkably simple approach to adaptively
cluster the search space in niches, such that a single mode resides in each
niche. In each of the located niches, a core search algorithm is initialized to
optimize that niche. Combined with an EA and a restart scheme, the resulting
Hill-Valley EA (HillVallEA) is compared to current state-of-the-art niching
methods on a standard benchmark suite for multi-modal optimization. Numerical
results in terms of the detected number of global optima show that, in spite of
its simplicity, HillVallEA is competitive within the limited budget of the
benchmark suite, and shows superior performance in the long run.
","[{'version': 'v1', 'created': 'Tue, 16 Oct 2018 15:38:22 GMT'}]",2018-10-17,"[['Maree', 'S. C.', ''], ['Alderliesten', 'T.', ''], ['Thierens', 'D.', ''], ['Bosman', 'P. A. N.', '']]","['continuous optimization', 'black box', 'niching', 'clustering', 'multi-modaloptimization', 'evolutionary algorithm', 'model based']"
4664,0911.2551,Jayakrishnan Unnikrishnan,"Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli, Sean Meyn",Minimax Robust Quickest Change Detection,"Submitted to IEEE Transactions on Information Theory, Nov. 2009.
  Revised May 2010",,10.1109/TIT.2011.2104993,,cs.IT math.IT math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The popular criteria of optimality for quickest change detection procedures
are the Lorden criterion, the Shiryaev-Roberts-Pollak criterion, and the
Bayesian criterion. In this paper a robust version of these quickest change
detection problems is considered when the pre-change and post-change
distributions are not known exactly but belong to known uncertainty classes of
distributions. For uncertainty classes that satisfy a specific condition, it is
shown that one can identify least favorable distributions (LFDs) from the
uncertainty classes, such that the detection rule designed for the LFDs is
optimal for the robust problem in a minimax sense. The condition is similar to
that required for the identification of LFDs for the robust hypothesis testing
problem originally studied by Huber. An upper bound on the delay incurred by
the robust test is also obtained in the asymptotic setting under the Lorden
criterion of optimality. This bound quantifies the delay penalty incurred to
guarantee robustness. When the LFDs can be identified, the proposed test is
easier to implement than the CUSUM test based on the Generalized Likelihood
Ratio (GLR) statistic which is a popular approach for such robust change
detection problems. The proposed test is also shown to give better performance
than the GLR test in simulations for some parameter values.
","[{'version': 'v1', 'created': 'Fri, 13 Nov 2009 07:07:50 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Jun 2010 03:57:48 GMT'}]",2016-11-15,"[['Unnikrishnan', 'Jayakrishnan', ''], ['Veeravalli', 'Venugopal V.', ''], ['Meyn', 'Sean', '']]","['Quickest change detection', 'Minimax robustness', 'Least favorable distributions', 'CUSUM test', 'Shiryaev']"
4665,1706.02051,Veronika Cheplygina,"Isabel Pino Pe\~na, Veronika Cheplygina, Sofia Paschaloudi, Morten
  Vuust, Jesper Carl, Ulla M{\o}ller Weinreich, Lasse Riis {\O}stergaard and
  Marleen de Bruijne",Automatic Emphysema Detection using Weakly Labeled HRCT Lung Images,Accepted at PLoS ONE,,10.1371/journal.pone.0205397,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A method for automatically quantifying emphysema regions using
High-Resolution Computed Tomography (HRCT) scans of patients with chronic
obstructive pulmonary disease (COPD) that does not require manually annotated
scans for training is presented. HRCT scans of controls and of COPD patients
with diverse disease severity are acquired at two different centers. Textural
features from co-occurrence matrices and Gaussian filter banks are used to
characterize the lung parenchyma in the scans. Two robust versions of multiple
instance learning (MIL) classifiers, miSVM and MILES, are investigated. The
classifiers are trained with the weak labels extracted from the forced
expiratory volume in one minute (FEV$_1$) and diffusing capacity of the lungs
for carbon monoxide (DLCO). At test time, the classifiers output a patient
label indicating overall COPD diagnosis and local labels indicating the
presence of emphysema. The classifier performance is compared with manual
annotations by two radiologists, a classical density based method, and
pulmonary function tests (PFTs). The miSVM classifier performed better than
MILES on both patient and emphysema classification. The classifier has a
stronger correlation with PFT than the density based method, the percentage of
emphysema in the intersection of annotations from both radiologists, and the
percentage of emphysema annotated by one of the radiologists. The correlation
between the classifier and the PFT is only outperformed by the second
radiologist. The method is therefore promising for facilitating assessment of
emphysema and reducing inter-observer variability.
","[{'version': 'v1', 'created': 'Wed, 7 Jun 2017 05:38:49 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Oct 2018 12:48:31 GMT'}]",2018-11-21,"[['Peña', 'Isabel Pino', ''], ['Cheplygina', 'Veronika', ''], ['Paschaloudi', 'Sofia', ''], ['Vuust', 'Morten', ''], ['Carl', 'Jesper', ''], ['Weinreich', 'Ulla Møller', ''], ['Østergaard', 'Lasse Riis', ''], ['de Bruijne', 'Marleen', '']]","['COPD', 'multiple instance learning', 'weakly-supervised learning', 'texture analysis', 'chest HRCT']"
4666,1603.01096,Yubao Sun,"Qingshan Liu, Yubao Sun, Cantian Wang, Tongliang Liu and Dacheng Tao","Elastic Net Hypergraph Learning for Image Clustering and Semi-supervised
  Classification","13 pages, 12 figures",,10.1109/TIP.2016.2621671,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph model is emerging as a very effective tool for learning the complex
structures and relationships hidden in data. Generally, the critical purpose of
graph-oriented learning algorithms is to construct an informative graph for
image clustering and classification tasks. In addition to the classical
$K$-nearest-neighbor and $r$-neighborhood methods for graph construction,
$l_1$-graph and its variants are emerging methods for finding the neighboring
samples of a center datum, where the corresponding ingoing edge weights are
simultaneously derived by the sparse reconstruction coefficients of the
remaining samples. However, the pair-wise links of $l_1$-graph are not capable
of capturing the high order relationships between the center datum and its
prominent data in sparse reconstruction. Meanwhile, from the perspective of
variable selection, the $l_1$ norm sparse constraint, regarded as a LASSO
model, tends to select only one datum from a group of data that are highly
correlated and ignore the others. To simultaneously cope with these drawbacks,
we propose a new elastic net hypergraph learning model, which consists of two
steps. In the first step, the Robust Matrix Elastic Net model is constructed to
find the canonically related samples in a somewhat greedy way, achieving the
grouping effect by adding the $l_2$ penalty to the $l_1$ constraint. In the
second step, hypergraph is used to represent the high order relationships
between each datum and its prominent samples by regarding them as a hyperedge.
Subsequently, hypergraph Laplacian matrix is constructed for further analysis.
New hypergraph learning algorithms, including unsupervised clustering and
multi-class semi-supervised classification, are then derived. Extensive
experiments on face and handwriting databases demonstrate the effectiveness of
the proposed method.
","[{'version': 'v1', 'created': 'Thu, 3 Mar 2016 13:37:23 GMT'}]",2016-12-21,"[['Liu', 'Qingshan', ''], ['Sun', 'Yubao', ''], ['Wang', 'Cantian', ''], ['Liu', 'Tongliang', ''], ['Tao', 'Dacheng', '']]","['Hypergraph', 'matrix elastic net', 'group selection', 'dataclustering', 'semi-supervised learning']"
4667,1907.12852,Waleed Yousef,Waleed A. Yousef,"Prudence When Assuming Normality: an advice for machine learning
  practitioners",,,10.1016/j.patrec.2020.06.026,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a binary classification problem the feature vector (predictor) is the
input to a scoring function that produces a decision value (score), which is
compared to a particular chosen threshold to provide a final class prediction
(output). Although the normal assumption of the scoring function is important
in many applications, sometimes it is severely violated even under the simple
multinormal assumption of the feature vector. This article proves this result
mathematically with a counter example to provide an advice for practitioners to
avoid blind assumptions of normality. On the other hand, the article provides a
set of experiments that illustrate some of the expected and well-behaved
results of the Area Under the ROC curve (AUC) under the multinormal assumption
of the feature vector. Therefore, the message of the article is not to avoid
the normal assumption of either the input feature vector or the output scoring
function; however, a prudence is needed when adopting either of both.
","[{'version': 'v1', 'created': 'Tue, 30 Jul 2019 12:04:01 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Aug 2019 12:26:05 GMT'}]",2021-11-11,"[['Yousef', 'Waleed A.', '']]","['Bayes Classifier', 'Multinormal Distribution', 'Central Limit Theorem', 'Classification', 'binormal model']"
4668,1604.06159,Andrew Connor,"Jenna Gavin, Ben Kenobi and Andy M. Connor",Social Play Spaces for Active Community Engagement,arXiv admin note: substantial text overlap with arXiv:1604.05793,,10.1145/2677758.2677789,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper puts forward the perspective that social play spaces are
opportunities to utilise both technology and body for the benefit of community
culture and engagement. Co-located social gaming coupled with tangible
interfaces offer active participant engagement and the development of the local
video game scene. This paper includes a descriptive account of Rabble Room
Arcade, an experimental social event combining custom-built physical interface
devices and multiplayer video games.
","[{'version': 'v1', 'created': 'Thu, 21 Apr 2016 02:07:27 GMT'}]",2016-04-22,"[['Gavin', 'Jenna', ''], ['Kenobi', 'Ben', ''], ['Connor', 'Andy M.', '']]","['Tangible interfaces', 'gaming', 'social play', 'game controllers']"
4669,1510.06788,Ravi Chugh,Ravi Chugh,Prodirect Manipulation: Bidirectional Programming for the Masses,"ICSE 2016 Companion Proceedings (Visions of 2025 Track), May 14-22,
  2016, Austin, TX, USA",,10.1145/2889160.2889210,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software interfaces today generally fall at either end of a spectrum. On one
end are programmable systems, which allow expert users (i.e. programmers) to
write software artifacts that describe complex abstractions, but programs are
disconnected from their eventual output. On the other end are domain-specific
graphical user interfaces (GUIs), which allow end users (i.e. non-programmers)
to easily create varied content but present insurmountable walls when a desired
feature is not built-in. Both programmatic and direct manipulation have
distinct strengths, but users must typically choose one over the other or use
some ad-hoc combination of systems. Our goal, put simply, is to bridge this
divide.
  We envision novel software systems that tightly couple programmatic and
direct manipulation --- a combination we dub prodirect manipulation --- for a
variety of use cases. This will require advances in a broad range of software
engineering disciplines, from program analysis and program synthesis technology
to user interface design and evaluation. In this extended abstract, we propose
two general strategies --- real-time program synthesis and domain-specific
synthesis of general-purpose programs --- that may prove fruitful for
overcoming the technical challenges. We also discuss metrics that will be
important in evaluating the usability and utility of prodirect manipulation
systems.
","[{'version': 'v1', 'created': 'Thu, 22 Oct 2015 23:44:36 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Feb 2016 15:28:44 GMT'}]",2016-02-25,"[['Chugh', 'Ravi', '']]","['Prodirect Manipulation', 'Program Synthesis', 'End User Programming', 'Human-Computer Interaction', 'Bidirectional Programming']"
4670,1709.05840,Iraklis Klampanos,"I. A. Klampanos, A. Davvetas, S. Andronopoulos, C. Pappas, A.
  Ikonomopoulos and V. Karkaletsis","Autoencoder-Driven Weather Clustering for Source Estimation during
  Nuclear Events",,,10.1016/j.envsoft.2018.01.014,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Emergency response applications for nuclear or radiological events can be
significantly improved via deep feature learning due to the hidden complexity
of the data and models involved. In this paper we present a novel methodology
for rapid source estimation during radiological releases based on deep feature
extraction and weather clustering. Atmospheric dispersions are then calculated
based on identified predominant weather patterns and are matched against
simulated incidents indicated by radiation readings on the ground. We evaluate
the accuracy of our methods over multiple years of weather reanalysis data in
the European region. We juxtapose these results with deep classification
convolution networks and discuss advantages and disadvantages.
","[{'version': 'v1', 'created': 'Mon, 18 Sep 2017 09:55:31 GMT'}, {'version': 'v2', 'created': 'Sat, 13 Jan 2018 12:22:56 GMT'}]",2018-04-02,"[['Klampanos', 'I. A.', ''], ['Davvetas', 'A.', ''], ['Andronopoulos', 'S.', ''], ['Pappas', 'C.', ''], ['Ikonomopoulos', 'A.', ''], ['Karkaletsis', 'V.', '']]","['deep learning', 'autoencoders', 'clustering', 'weather patterns', 'sourceinversion', 'nuclear events', 'atmospheric dispersion']"
4671,1803.08476,Diego Amancio Dr.,Edilson A. Corr\^ea Jr. and Diego R. Amancio,"Word sense induction using word embeddings and community detection in
  complex networks",,"Physica A, v. 523, p. 180-190, 2019",10.1016/j.physa.2019.02.032,,cs.CL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Word Sense Induction (WSI) is the ability to automatically induce word senses
from corpora. The WSI task was first proposed to overcome the limitations of
manually annotated corpus that are required in word sense disambiguation
systems. Even though several works have been proposed to induce word senses,
existing systems are still very limited in the sense that they make use of
structured, domain-specific knowledge sources. In this paper, we devise a
method that leverages recent findings in word embeddings research to generate
context embeddings, which are embeddings containing information about the
semantical context of a word. In order to induce senses, we modeled the set of
ambiguous words as a complex network. In the generated network, two instances
(nodes) are connected if the respective context embeddings are similar. Upon
using well-established community detection methods to cluster the obtained
context embeddings, we found that the proposed method yields excellent
performance for the WSI task. Our method outperformed competing algorithms and
baselines, in a completely unsupervised manner and without the need of any
additional structured knowledge source.
","[{'version': 'v1', 'created': 'Thu, 22 Mar 2018 17:22:42 GMT'}]",2019-03-06,"[['Corrêa', 'Edilson A.', 'Jr.'], ['Amancio', 'Diego R.', '']]","['word sense induction', 'language networks', 'complex networks', 'word']"
4672,1907.10333,Gonzague Yernaux,Gonzague Yernaux and Wim Vanhoof,Anti-unification in Constraint Logic Programming,"Paper presented at the 35th International Conference on Logic
  Programming (ICLP 2019), Las Cruces, New Mexico, USA, 20-25 September 2019,
  16 pages",Theory and Practice of Logic Programming 19 (2019) 773-789,10.1017/S1471068419000188,,cs.LO cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Anti-unification refers to the process of generalizing two (or more) goals
into a single, more general, goal that captures some of the structure that is
common to all initial goals. In general one is typically interested in
computing what is often called a most specific generalization, that is a
generalization that captures a maximal amount of shared structure. In this work
we address the problem of anti-unification in CLP, where goals can be seen as
unordered sets of atoms and/or constraints. We show that while the concept of a
most specific generalization can easily be defined in this context, computing
it becomes an NP-complete problem. We subsequently introduce a generalization
algorithm that computes a well-defined abstraction whose computation can be
bound to a polynomial execution time. Initial experiments show that even a
naive implementation of our algorithm produces acceptable generalizations in an
efficient way. Under consideration for acceptance in TPLP.
","[{'version': 'v1', 'created': 'Wed, 24 Jul 2019 09:55:27 GMT'}]",2020-02-19,"[['Yernaux', 'Gonzague', ''], ['Vanhoof', 'Wim', '']]","['Anti-unification', '(most specific) generalization', 'CLP', 'program analysis']"
4673,1512.07038,Pavel Hrab\'ak,"Pavel Hrab\'ak, Marek Buk\'a\v{c}ek","Conflict Solution According to ""Aggressiveness"" of Agents in
  Floor-Field-Based Model","Submitted to LNCS (Springer), In proceedings of 11th international
  conference on Parallel Processing and Applied Mathematics","Volume 9574 of the series Lecture Notes in Computer Science pp
  507-516, Springer International Publishing, 2016",10.1007/978-3-319-32152-3_47,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This contribution introduces an element of ""aggressiveness"" into the
Floor-Field based model with adaptive time-span. The aggressiveness is
understood as an ability to win conflicts and push through the crowd. From
experiments it is observed that this ability is not directly correlated with
the desired velocity in the free flow regime. The influence of the
aggressiveness is studied by means of the dependence of the travel time on the
occupancy of a room. A simulation study shows that the conflict solution based
on the aggressiveness parameter can mimic the observations from the experiment.
","[{'version': 'v1', 'created': 'Tue, 22 Dec 2015 11:46:44 GMT'}]",2016-04-11,"[['Hrabák', 'Pavel', ''], ['Bukáček', 'Marek', '']]","['Floor-Field model', 'conflict solution', 'aggressiveness']"
4674,1307.3086,Afifa Ghenai,"Afifa Ghenai, Mohamed Youcef Badaoui and Mohamed Benmohammed",Towards a Good ABS Design for more Reliable Vehicles on the Roads,14 pages,"International Journal of Computer Science & Information Technology
  (IJCSIT) Vol 5, No 3, June 2013",10.5121/ijcsit.2013.5310,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, better driving also means better braking. To this end, vehicle
designers must find all failures during the design phase of antilock braking
systems which play an important role in automobiles safety. However,
mechatronic systems are so complex and failures can be badly identified. So it
is necessary to propose a design approach of an antilock braking system which
will be able to avoid wheels locking during braking and maintain vehicle
stability. This paper describes this approach, in which we model the functional
and the dysfunctional behavior of an antilock braking system using stopwatch
Petri nets.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2013 12:26:50 GMT'}]",2013-07-12,"[['Ghenai', 'Afifa', ''], ['Badaoui', 'Mohamed Youcef', ''], ['Benmohammed', 'Mohamed', '']]","['Mechatronic Systems', 'ABS', 'Reliability', 'Time Constraints', 'Feared Scenarios', 'Stopwatch Petri Nets']"
4675,1111.4555,Dragana Bajovic,"Dragana Bajovic, Dusan Jakovetic, Jose M. F. Moura, Joao Xavier, and
  Bruno Sinopoli","Large Deviations Performance of Consensus+Innovations Distributed
  Detection with Non-Gaussian Observations","30 pages, journal, submitted Nov 17, 2011; revised Apr 3, 2012",,10.1109/TSP.2012.2210885,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We establish the large deviations asymptotic performance (error exponent) of
consensus+innovations distributed detection over random networks with generic
(non-Gaussian) sensor observations. At each time instant, sensors 1) combine
theirs with the decision variables of their neighbors (consensus) and 2)
assimilate their new observations (innovations). This paper shows for general
non-Gaussian distributions that consensus+innovations distributed detection
exhibits a phase transition behavior with respect to the network degree of
connectivity. Above a threshold, distributed is as good as centralized, with
the same optimal asymptotic detection performance, but, below the threshold,
distributed detection is suboptimal with respect to centralized detection. We
determine this threshold and quantify the performance loss below threshold.
Finally, we show the dependence of the threshold and performance on the
distribution of the observations: distributed detectors over the same random
network, but with different observations' distributions, for example, Gaussian,
Laplace, or quantized, may have different asymptotic performance, even when the
corresponding centralized detectors have the same asymptotic performance.
","[{'version': 'v1', 'created': 'Sat, 19 Nov 2011 13:29:54 GMT'}, {'version': 'v2', 'created': 'Sun, 15 Apr 2012 11:50:32 GMT'}]",2015-06-03,"[['Bajovic', 'Dragana', ''], ['Jakovetic', 'Dusan', ''], ['Moura', 'Jose M. F.', ''], ['Xavier', 'Joao', ''], ['Sinopoli', 'Bruno', '']]","['Consensus+innovations', 'performance analysis', 'Chernoff information', 'non-Gaussian distributions', 'distributed']"
4676,1209.2516,Elham Khatibi,"Elham Khatibi, Roliana Ibrahim","Efficient Indicators to Evaluate the Status of Software Development
  Effort Estimation inside the Organizations",10 pages,"International Journal of Managing Information
  Technology,(4):3,2012, 23-32",10.5121/ijmit.2012.4303,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Development effort is an undeniable part of the project management which
considerably influences the success of project. Inaccurate and unreliable
estimation of effort can easily lead to the failure of project. Due to the
special specifications, accurate estimation of effort in the software projects
is a vital management activity that must be carefully done to avoid from the
unforeseen results. However numerous effort estimation methods have been
proposed in this field, the accuracy of estimates is not satisfying and the
attempts continue to improve the performance of estimation methods. Prior
researches conducted in this area have focused on numerical and quantitative
approaches and there are a few research works that investigate the root
problems and issues behind the inaccurate effort estimation of software
development effort. In this paper, a framework is proposed to evaluate and
investigate the situation of an organization in terms of effort estimation. The
proposed framework includes various indicators which cover the critical issues
in field of software development effort estimation. Since the capabilities and
shortages of organizations for effort estimation are not the same, the proposed
indicators can lead to have a systematic approach in which the strengths and
weaknesses of organizations in field of effort estimation are discovered.
","[{'version': 'v1', 'created': 'Wed, 12 Sep 2012 08:09:51 GMT'}]",2012-09-13,"[['Khatibi', 'Elham', ''], ['Ibrahim', 'Roliana', '']]","['Software projects', 'Effort estimation', 'Framework', 'Indicator']"
4677,1408.6926,Nikolaos Polatidis Mr,"Nikolaos Polatidis, Christos K. Georgiadis","Factors Influencing the Quality of the User Experience in Ubiquitous
  Recommender Systems","The final publication is available at www.springerlink.com
  Distributed, Ambient, and Pervasive Interactions Lecture Notes in Computer
  Science Volume 8530, 2014, pp 369-379","Polatidis, N., & Georgiadis, C. K. (2014). Factors Influencing the
  Quality of the User Experience in Ubiquitous Recommender Systems. In
  Distributed, Ambient, and Pervasive Interactions (pp. 369-379). Springer
  International Publishing",10.1007/978-3-319-07788-8_35,,cs.HC cs.CR cs.IR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The use of mobile devices and the rapid growth of the internet and networking
infrastructure has brought the necessity of using Ubiquitous recommender
systems. However in mobile devices there are different factors that need to be
considered in order to get more useful recommendations and increase the quality
of the user experience. This paper gives an overview of the factors related to
the quality and proposes a new hybrid recommendation model.
","[{'version': 'v1', 'created': 'Fri, 29 Aug 2014 05:51:49 GMT'}]",2014-09-09,"[['Polatidis', 'Nikolaos', ''], ['Georgiadis', 'Christos K.', '']]","['Ubiquitous Computing', 'Recommender Systems', 'Quality Factors', 'User Experience']"
4678,1005.1736,Secretary Aircc Journal,"M.Rajesh Babu (1) and S.Selvan (2), ((1) PSG College of Technology,
  India, (2)Francis Xavier Engineering College, India)","A Lightweight and Attack Resistant Authenticated Routing Protocol for
  Mobile Adhoc Networks","14 Pages, IJWMN","International Journal of Wireless & Mobile Networks 2.2 (2010)
  16-29",10.5121/ijwmn.2010.2202,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In mobile ad hoc networks, by attacking the corresponding routing protocol,
an attacker can easily disturb the operations of the network. For ad hoc
networks, till now many secured routing protocols have been proposed which
contains some disadvantages. Therefore security in ad hoc networks is a
controversial area till now. In this paper, we proposed a Lightweight and
Attack Resistant Authenticated Routing Protocol (LARARP) for mobile ad hoc
networks. For the route discovery attacks in MANET routing protocols, our
protocol gives an effective security. It supports the node to drop the invalid
packets earlier by detecting the malicious nodes quickly by verifying the
digital signatures of all the intermediate nodes. It punishes the misbehaving
nodes by decrementing a credit counter and rewards the well behaving nodes by
incrementing the credit counter. Thus it prevents uncompromised nodes from
attacking the routes with malicious or compromised nodes. It is also used to
prevent the denial-of-service (DoS) attacks. The efficiency and effectiveness
of LARARP are verified through the detailed simulation studies.
","[{'version': 'v1', 'created': 'Tue, 11 May 2010 07:43:13 GMT'}]",2010-07-15,"[['Babu', 'M. Rajesh', ''], ['Selvan', 'S.', '']]","['LARARP', 'Mobile Ad Hoc Networks', 'Routing protocols', 'SAODV', 'Security']"
4679,1107.1204,EPTCS,"Joseph Assouramou (Universit\'e Laval), Jos\'ee Desharnais
  (Universit\'e Laval)",Analysis of Non-Linear Probabilistic Hybrid Systems,"In Proceedings QAPL 2011, arXiv:1107.0746","EPTCS 57, 2011, pp. 104-119",10.4204/EPTCS.57.8,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper shows how to compute, for probabilistic hybrid systems, the clock
approximation and linear phase-portrait approximation that have been proposed
for non probabilistic processes by Henzinger et al. The techniques permit to
define a rectangular probabilistic process from a non rectangular one, hence
allowing the model-checking of any class of systems. Clock approximation, which
applies under some restrictions, aims at replacing a non rectangular variable
by a clock variable. Linear phase-approximation applies without restriction and
yields an approximation that simulates the original process. The conditions
that we need for probabilistic processes are the same as those for the classic
case.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2011 17:55:11 GMT'}]",2011-07-07,"[['Assouramou', 'Joseph', '', 'Université Laval'], ['Desharnais', 'Josée', '', 'Université Laval']]","['probabilistic hybrid systems', 'model-checking', 'linear and rectangular processes', 'approximation', 'linearization']"
4680,1705.00318,David Chalupa,David Chalupa,"An Order-based Algorithm for Minimum Dominating Set with Application in
  Graph Mining",,"Information Sciences, Volume 426, 2018, Pages 101-116, ISSN
  0020-0255",10.1016/j.ins.2017.10.033,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dominating set is a set of vertices of a graph such that all other vertices
have a neighbour in the dominating set. We propose a new order-based randomised
local search (RLS$_o$) algorithm to solve minimum dominating set problem in
large graphs. Experimental evaluation is presented for multiple types of
problem instances. These instances include unit disk graphs, which represent a
model of wireless networks, random scale-free networks, as well as samples from
two social networks and real-world graphs studied in network science. Our
experiments indicate that RLS$_o$ performs better than both a classical greedy
approximation algorithm and two metaheuristic algorithms based on ant colony
optimisation and local search. The order-based algorithm is able to find small
dominating sets for graphs with tens of thousands of vertices. In addition, we
propose a multi-start variant of RLS$_o$ that is suitable for solving the
minimum weight dominating set problem. The application of RLS$_o$ in graph
mining is also briefly demonstrated.
","[{'version': 'v1', 'created': 'Sun, 30 Apr 2017 14:11:10 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Nov 2017 10:08:35 GMT'}]",2017-11-06,"[['Chalupa', 'David', '']]","['randomised local search', 'order-based representation', 'minimumdominating set', 'complex networks', 'heuristics']"
4681,1504.04565,Luis Pe\~naranda,"Luis Pe\~naranda, Luiz Velho and Leonardo Sacht","Real-time correction of panoramic images using hyperbolic M\""obius
  transformations","25 pages, 13 figures, 1 table, 1 algorithm. In ""Real-time Image
  Processing""",,10.1007/s11554-015-0502-x,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wide-angle images gained a huge popularity in the last years due to the
development of computational photography and imaging technological advances.
They present the information of a scene in a way which is more natural for the
human eye but, on the other hand, they introduce artifacts such as bent lines.
These artifacts become more and more unnatural as the field of view increases.
  In this work, we present a technique aimed to improve the perceptual quality
of panorama visualization. The main ingredients of our approach are, on one
hand, considering the viewing sphere as a Riemann sphere, what makes natural
the application of M\""obius (complex) transformations to the input image, and,
on the other hand, a projection scheme which changes in function of the field
of view used.
  We also introduce an implementation of our method, compare it against images
produced with other methods and show that the transformations can be done in
real-time, which makes our technique very appealing for new settings, as well
as for existing interactive panorama applications.
","[{'version': 'v1', 'created': 'Fri, 17 Apr 2015 16:45:35 GMT'}]",2015-04-20,"[['Peñaranda', 'Luis', ''], ['Velho', 'Luiz', ''], ['Sacht', 'Leonardo', '']]","['panorama', 'perspective projection', 'M¨obius transformation', 'real-time', 'implementation']"
4682,1405.3953,Jan Wielemaker,"Torbj\""orn Lager, Jan Wielemaker",Pengines: Web Logic Programming Made Easy,To appear in Theory and Practice of Logic Programming,Theory and Practice of Logic Programming 14 (2014) 539-552,10.1017/S1471068414000192,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When developing a (web) interface for a deductive database, functionality
required by the client is provided by means of HTTP handlers that wrap the
logical data access predicates. These handlers are responsible for converting
between client and server data representations and typically include options
for paginating results. Designing the web accessible API is difficult because
it is hard to predict the exact requirements of clients. Pengines changes this
picture. The client provides a Prolog program that selects the required data by
accessing the logical API of the server. The pengine infrastructure provides
general mechanisms for converting Prolog data and handling Prolog
non-determinism. The Pengines library is small (2000 lines Prolog, 150 lines
JavaScript). It greatly simplifies defining an AJAX based client for a Prolog
program and provides non-deterministic RPC between Prolog processes as well as
interaction with Prolog engines similar to Paul Tarau's engines. Pengines are
available as a standard package for SWI-Prolog 7.
","[{'version': 'v1', 'created': 'Wed, 14 May 2014 15:22:30 GMT'}]",2020-02-19,"[['Lager', 'Torbjörn', ''], ['Wielemaker', 'Jan', '']]","['web programming', 'query languages', 'agent programming', 'distributed programming']"
4683,1801.04293,Luiz Capretz Dr.,"Saiqa Aleem, Luiz Fernando Capretz, Faheem Ahmed","Critical Success Factors to Improve the Game Development Process from a
  Developers Perspective",,"Journal of Computer Science and Technology, 31(5):925-950, 2016",10.1007/s11390- 016-1673-z,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The growth of the software game development industry is enormous and is
gaining importance day by day. This growth imposes severe pressure and a number
of issues and challenges on the game development community. Game development is
a complex process, and one important game development choice is to consider the
developer perspective to produce good quality software games by improving the
game development process. The objective of this study is to provide a better
understanding of the developers dimension as a factor in software game success.
It focuses mainly on an empirical investigation of the effect of key developer
factors on the software game development process and eventually on the quality
of the resulting game. A quantitative survey was developed and conducted to
identify key developer factors for an enhanced game development process. For
this study, the developed survey was used to test the research model and
hypotheses. The results provide evidence that game development organizations
must deal with multiple key factors to remain competitive and to handle high
pressure in the software game industry. The main contribution of this paper is
to investigate empirically the influence of key developer factors on the game
development process.
","[{'version': 'v1', 'created': 'Fri, 12 Jan 2018 19:18:21 GMT'}]",2018-01-16,"[['Aleem', 'Saiqa', ''], ['Capretz', 'Luiz Fernando', ''], ['Ahmed', 'Faheem', '']]","['Developer’s perspective', 'Software games', 'Empirical investigation', 'Good-quality games', 'Game']"
4684,1708.07653,Matias Korman,"Sang Won Bae, Jean-Francois Baffier, Jinhee Chun, Peter Eades, Kord
  Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani,
  Ignaz Rutter, Csaba D. T\'oth",Gap-planar Graphs,"A preliminary version of this paper appeared in the Proceedings of
  the 25th International Symposium on Graph Drawing and Network Visualization
  (GD 2017)","Theoretical Computer Science 745 (2018), 36-52",10.1016/j.tcs.2018.05.031,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the family of $k$-gap-planar graphs for $k \geq 0$, i.e., graphs
that have a drawing in which each crossing is assigned to one of the two
involved edges and each edge is assigned at most $k$ of its crossings. This
definition is motivated by applications in edge casing, as a $k$-gap-planar
graph can be drawn crossing-free after introducing at most $k$ local gaps per
edge. We present results on the maximum density of $k$-gap-planar graphs, their
relationship to other classes of beyond-planar graphs, characterization of
$k$-gap-planar complete graphs, and the computational complexity of recognizing
$k$-gap-planar graphs.
","[{'version': 'v1', 'created': 'Fri, 25 Aug 2017 08:55:57 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Dec 2017 07:56:11 GMT'}, {'version': 'v3', 'created': 'Fri, 25 May 2018 11:21:13 GMT'}, {'version': 'v4', 'created': 'Thu, 28 Feb 2019 04:27:34 GMT'}]",2019-03-01,"[['Bae', 'Sang Won', ''], ['Baffier', 'Jean-Francois', ''], ['Chun', 'Jinhee', ''], ['Eades', 'Peter', ''], ['Eickmeyer', 'Kord', ''], ['Grilli', 'Luca', ''], ['Hong', 'Seok-Hee', ''], ['Korman', 'Matias', ''], ['Montecchiani', 'Fabrizio', ''], ['Rutter', 'Ignaz', ''], ['Tóth', 'Csaba D.', '']]","['Beyond planarity k-gap-planar graphs', 'Density results', 'Complete graphs', 'Recognition problem', 'kplanar graphs', 'k-quasiplanar graphs']"
4685,1805.10476,Li Yunkun,YunKun Li and XiaoJun Wu and Josef Kittler,L1-(2D)2PCANet: A Deep Learning Network for Face Recognition,8 pages and 5 figures,,10.1117/1.JEI.28.2.023016,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel deep learning network L1-(2D)2PCANet for
face recognition, which is based on L1-norm-based two-directional
two-dimensional principal component analysis (L1-(2D)2PCA). In our network, the
role of L1-(2D)2PCA is to learn the filters of multiple convolution layers.
After the convolution layers, we deploy binary hashing and block-wise histogram
for pooling. We test our network on some benchmark facial datasets YALE, AR,
Extended Yale B, LFW-a and FERET with CNN, PCANet, 2DPCANet and L1-PCANet as
comparison. The results show that the recognition performance of L1-(2D)2PCANet
in all tests is better than baseline networks, especially when there are
outliers in the test data. Owing to the L1-norm, L1-2D2PCANet is robust to
outliers and changes of the training images.
","[{'version': 'v1', 'created': 'Sat, 26 May 2018 12:56:21 GMT'}]",2019-07-24,"[['Li', 'YunKun', ''], ['Wu', 'XiaoJun', ''], ['Kittler', 'Josef', '']]","['face recognition', 'deep learning', 'L1-2D2PCA', 'outlier']"
4686,2003.13894,Juan Banda,Ramya Tekumalla and Juan M. Banda,Social Media Mining Toolkit (SMMT),"3 figures, 8 pages double spaced, Under review in Genomics &
  Informatics journal",Genomics & Informatics 2020; 18(2): e16,10.5808/GI.2020.18.2.e16,,cs.IR cs.SI,http://creativecommons.org/licenses/by/4.0/,"  There has been a dramatic increase in the popularity of utilizing social
media data for research purposes within the biomedical community. In PubMed
alone, there have been nearly 2,500 publication entries since 2014 that deal
with analyzing social media data from Twitter and Reddit. However, the vast
majority of those works do not share their code or data for replicating their
studies. With minimal exceptions, the few that do, place the burden on the
researcher to figure out how to fetch the data, how to best format their data,
and how to create automatic and manual annotations on the acquired data. In
order to address this pressing issue, we introduce the Social Media Mining
Toolkit (SMMT), a suite of tools aimed to encapsulate the cumbersome details of
acquiring, preprocessing, annotating and standardizing social media data. The
purpose of our toolkit is for researchers to focus on answering research
questions, and not the technical aspects of using social media data. By using a
standard toolkit, researchers will be able to acquire, use, and release data in
a consistent way that is transparent for everybody using the toolkit, hence,
simplifying research reproducibility and accessibility in the social media
domain.
","[{'version': 'v1', 'created': 'Tue, 31 Mar 2020 01:16:14 GMT'}]",2020-07-16,"[['Tekumalla', 'Ramya', ''], ['Banda', 'Juan M.', '']]","['Data Mining', 'Machine Learning', 'Social Media', 'Information Storage', 'Retrieval']"
4687,1903.09190,Adam Kubany,"Adam Kubany, Shimon Ben Ishay, Ruben-sacha Ohayon, Armin Shmilovici,
  Lior Rokach, Tomer Doitshman","Comparison of State-of-the-Art Deep Learning APIs for Image Multi-Label
  Classification using Semantic Metrics",,,10.1016/j.eswa.2020.113656,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image understanding heavily relies on accurate multi-label classification. In
recent years, deep learning algorithms have become very successful for such
tasks, and various commercial and open-source APIs have been released for
public use. However, these APIs are often trained on different datasets, which,
besides affecting their performance, might pose a challenge to their
performance evaluation. This challenge concerns the different object-class
dictionaries of the APIs' training dataset and the benchmark dataset, in which
the predicted labels are semantically similar to the benchmark labels but
considered different simply because they have different wording in the
dictionaries. To face this challenge, we propose semantic similarity metrics to
obtain richer understating of the APIs predicted labels and thus their
performance. In this study, we evaluate and compare the performance of 13 of
the most prominent commercial and open-source APIs in a best-of-breed challenge
on the Visual Genome and Open Images benchmark datasets. Our findings
demonstrate that, while using traditional metrics, the Microsoft Computer
Vision, Imagga, and IBM APIs performed better than others. However, applying
semantic metrics also unveil the InceptionResNet-v2, Inception-v3, and ResNet50
APIs, which are trained only with the simple ImageNet dataset, as challengers
for top semantic performers.
","[{'version': 'v1', 'created': 'Thu, 21 Mar 2019 18:43:39 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Apr 2019 09:04:51 GMT'}, {'version': 'v3', 'created': 'Wed, 10 Jul 2019 08:17:27 GMT'}, {'version': 'v4', 'created': 'Thu, 11 Jun 2020 08:26:39 GMT'}]",2020-07-06,"[['Kubany', 'Adam', ''], ['Ishay', 'Shimon Ben', ''], ['Ohayon', 'Ruben-sacha', ''], ['Shmilovici', 'Armin', ''], ['Rokach', 'Lior', ''], ['Doitshman', 'Tomer', '']]","['image multi-label classification comparison', 'semantic evaluation', 'deep learning', 'image understanding']"
4688,1907.09468,Robert Manger,"Marko \v{S}poljarec, Robert Manger","Heuristic solutions to robust variants of the minimum-cost integer flow
  problem",,"Journal of Heuristics, 2020",10.1007/s10732-020-09441-1,,cs.AI cs.NE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with robust optimization applied to network flows. Two
robust variants of the minimum-cost integer flow problem are considered.
Thereby, uncertainty in problem formulation is limited to arc unit costs and
expressed by a finite set of explicitly given scenarios. It is shown that both
problem variants are NP-hard. To solve the considered variants, several
heuristics based on local search or evolutionary computing are proposed. The
heuristics are experimentally evaluated on appropriate problem instances.
","[{'version': 'v1', 'created': 'Sun, 21 Jul 2019 10:11:09 GMT'}]",2020-02-27,"[['Špoljarec', 'Marko', ''], ['Manger', 'Robert', '']]","['robust optimization', 'network flow', 'minimum-cost flow', 'heuristic', 'local search', 'evolutionary computing']"
4689,2005.09800,Boyang Wang,"Chenggang Wang, Sean Kennedy, Haipeng Li, King Hudson, Gowtham Atluri,
  Xuetao Wei, Wenhai Sun, Boyang Wang","Fingerprinting Encrypted Voice Traffic on Smart Speakers with Deep
  Learning",,"13th ACM Conference on Security and Privacy in Wireless and Mobile
  Networks (WiSec '20), July 8--10, 2020, Linz (Virtual Event), Austria",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates the privacy leakage of smart speakers under an
encrypted traffic analysis attack, referred to as voice command fingerprinting.
In this attack, an adversary can eavesdrop both outgoing and incoming encrypted
voice traffic of a smart speaker, and infers which voice command a user says
over encrypted traffic. We first built an automatic voice traffic collection
tool and collected two large-scale datasets on two smart speakers, Amazon Echo
and Google Home. Then, we implemented proof-of-concept attacks by leveraging
deep learning. Our experimental results over the two datasets indicate
disturbing privacy concerns. Specifically, compared to 1% accuracy with random
guess, our attacks can correctly infer voice commands over encrypted traffic
with 92.89\% accuracy on Amazon Echo. Despite variances that human voices may
cause on outgoing traffic, our proof-of-concept attacks remain effective even
only leveraging incoming traffic (i.e., the traffic from the server). This is
because the AI-based voice services running on the server side response
commands in the same voice and with a deterministic or predictable manner in
text, which leaves distinguishable pattern over encrypted traffic. We also
built a proof-of-concept defense to obfuscate encrypted traffic. Our results
show that the defense can effectively mitigate attack accuracy on Amazon Echo
to 32.18%.
","[{'version': 'v1', 'created': 'Wed, 20 May 2020 00:38:57 GMT'}]",2020-05-21,"[['Wang', 'Chenggang', ''], ['Kennedy', 'Sean', ''], ['Li', 'Haipeng', ''], ['Hudson', 'King', ''], ['Atluri', 'Gowtham', ''], ['Wei', 'Xuetao', ''], ['Sun', 'Wenhai', ''], ['Wang', 'Boyang', '']]","['machine learning', 'encrypted traffic analysis', 'smart speaker']"
4690,1609.01374,Mohamed Alrshah,"Mohamed A. Alrshah, Mohamed Othman","Test-Bed based Comparison of Single and Parallel TCP and the Impact Of
  Parallelism on Throughput and Fairness in Heterogenous Networks",4 pages,IEEE ICCTD 2009. (pp.332-335),10.1109/ICCTD.2009.144,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parallel Transport Control Protocol (TCP) has been used to effectively
utilize bandwidth for data intensive applications over high Bandwidth-Delay
Product (BDP) networks. On the other hand, it has been argued that, a
single-based TCP connection with proper modification such as HSTCP can emulate
and capture the robustness of parallel TCP and can well replace it. In this
work a Comparison between Single-Based and the proposed parallel TCP has been
conducted to show the differences in their performance measurements such as
throughput performance and throughput ratio, as well as the link sharing
Fairness also has been observed to show the impact of using the proposed
Parallel TCP on the existing Single-Based TCP connections. The experiment
results show that, single-based TCP cannot overcome Parallel TCP especially in
heterogeneous networks where the packet losses are common. Furthermore, the
proposed parallel TCP does not affect TCP fairness which makes parallel TCP
highly recommended to effectively utilize bandwidth for data intensive
applications.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2016 02:39:03 GMT'}]",2016-09-07,"[['Alrshah', 'Mohamed A.', ''], ['Othman', 'Mohamed', '']]","['Single TCP', 'Parallel TCP', 'TCP Fairness', 'Heterogeneous']"
4691,1504.01920,Zuxuan Wu,"Hao Ye, Zuxuan Wu, Rui-Wei Zhao, Xi Wang, Yu-Gang Jiang, Xiangyang Xue",Evaluating Two-Stream CNN for Video Classification,ACM ICMR'15,,10.1145/2671188.2749406,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Videos contain very rich semantic information. Traditional hand-crafted
features are known to be inadequate in analyzing complex video semantics.
Inspired by the huge success of the deep learning methods in analyzing image,
audio and text data, significant efforts are recently being devoted to the
design of deep nets for video analytics. Among the many practical needs,
classifying videos (or video clips) based on their major semantic categories
(e.g., ""skiing"") is useful in many applications. In this paper, we conduct an
in-depth study to investigate important implementation options that may affect
the performance of deep nets on video classification. Our evaluations are
conducted on top of a recent two-stream convolutional neural network (CNN)
pipeline, which uses both static frames and motion optical flows, and has
demonstrated competitive performance against the state-of-the-art methods. In
order to gain insights and to arrive at a practical guideline, many important
options are studied, including network architectures, model fusion, learning
parameters and the final prediction methods. Based on the evaluations, very
competitive results are attained on two popular video classification
benchmarks. We hope that the discussions and conclusions from this work can
help researchers in related fields to quickly set up a good basis for further
investigations along this very promising direction.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2015 11:29:21 GMT'}]",2015-04-09,"[['Ye', 'Hao', ''], ['Wu', 'Zuxuan', ''], ['Zhao', 'Rui-Wei', ''], ['Wang', 'Xi', ''], ['Jiang', 'Yu-Gang', ''], ['Xue', 'Xiangyang', '']]","['Video Classification', 'Deep Learning', 'CNN', 'Evaluation']"
4692,1503.04915,EPTCS,Jean-Michel Hufflen (FEMTO-ST & University of Franche-Comt\'e),"Using Model-Checking Techniques for Component-Based Systems with
  Reconfigurations","In Proceedings FESCA 2015, arXiv:1503.04378","EPTCS 178, 2015, pp. 33-46",10.4204/EPTCS.178.4,,cs.SE cs.DS cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Within a component-based approach allowing dynamic reconfigurations,
sequences of successive reconfiguration operations are expressed by means of
reconfiguration paths, possibly infinite. We show that a subclass of such paths
can be modelled by finite state automata. This feature allows us to use
techniques related to model-checking to prove some architectural, event, and
temporal properties related to dynamic reconfiguration. Our method is proved
correct w.r.t. these properties' definition.
","[{'version': 'v1', 'created': 'Tue, 17 Mar 2015 04:00:09 GMT'}]",2015-03-18,"[['Hufflen', 'Jean-Michel', '', 'FEMTO-ST & University of Franche-Comté']]","['Model checking', 'finite state automata', 'component-based approach', 'checking invarianceproperties', 'dynamic reconfiguration paths']"
4693,0801.1927,Paul M. Aoki,"Rowena Luk, Melissa Ho, Paul M. Aoki",Asynchronous Remote Medical Consultation for Ghana,10 pages,,10.1145/1357054.1357173,,cs.HC,,"  Computer-mediated communication systems can be used to bridge the gap between
doctors in underserved regions with local shortages of medical expertise and
medical specialists worldwide. To this end, we describe the design of a
prototype remote consultation system intended to provide the social,
institutional and infrastructural context for sustained, self-organizing growth
of a globally-distributed Ghanaian medical community. The design is grounded in
an iterative design process that included two rounds of extended design
fieldwork throughout Ghana and draws on three key design principles (social
networks as a framework on which to build incentives within a self-organizing
network; optional and incremental integration with existing referral
mechanisms; and a weakly-connected, distributed architecture that allows for a
highly interactive, responsive system despite failures in connectivity). We
discuss initial experiences from an ongoing trial deployment in southern Ghana.
","[{'version': 'v1', 'created': 'Sat, 12 Jan 2008 23:43:18 GMT'}]",2016-09-05,"[['Luk', 'Rowena', ''], ['Ho', 'Melissa', ''], ['Aoki', 'Paul M.', '']]","['Telemedicine', 'social networking', 'organizational interfaces', 'developing regions', 'Ghana']"
4694,1512.07199,Chii Chang,Chii Chang and Satish Narayana Srirama and Rajkumar Buyya,"Mobile Cloud Business Process Management System for the Internet of
  Things: A Survey","56 pages, 10 figures, 5 tables","Chii Chang, Satish Narayana Srirama, and Rajkumar Buyya. 2016.
  Mobile Cloud Business Process Management System for the Internet of Things: A
  Survey. ACM Comput. Surv. 49, 4, Article 70 (December 2016), 42 pages",10.1145/3012000,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The Internet of Things (IoT) represents a comprehensive environment that
consists of a large number of smart devices interconnecting heterogeneous
physical objects to the Internet. Many domains such as logistics,
manufacturing, agriculture, urban computing, home automation, ambient assisted
living and various ubiquitous computing applications have utilised IoT
technologies. Meanwhile, Business Process Management Systems (BPMS) have become
a successful and efficient solution for coordinated management and optimised
utilisation of resources/entities. However, past BPMS have not considered many
issues they will face in managing large scale connected heterogeneous IoT
entities. Without fully understanding the behaviour, capability and state of
the IoT entities, the BPMS can fail to manage the IoT integrated information
systems. In this paper, we analyse existing BPMS for IoT and identify the
limitations and their drawbacks based on Mobile Cloud Computing perspective.
Later, we discuss a number of open challenges in BPMS for IoT.
","[{'version': 'v1', 'created': 'Mon, 21 Dec 2015 20:19:47 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Nov 2018 18:32:48 GMT'}]",2018-11-16,"[['Chang', 'Chii', ''], ['Srirama', 'Satish Narayana', ''], ['Buyya', 'Rajkumar', '']]","['Internet of Things', 'Mobile Cloud Computing', 'Business ProcessManagement System', 'Service-Oriented', 'review', 'state of the art', 'challenge']"
4695,1309.3945,Anuj Sharma Dr,"Anuj Sharma, Dr. Prabin Kumar Panigrahi","A Neural Network based Approach for Predicting Customer Churn in
  Cellular Network Services",6 Pages. International Journal of Computer Applications August 2011,,"10.5120/3344-4605 10.5120/3344-4605 10.5120/3344-4605 10.5120/3344-4605
  10.5120/3344-4605",,cs.NE cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Marketing literature states that it is more costly to engage a new customer
than to retain an existing loyal customer. Churn prediction models are
developed by academics and practitioners to effectively manage and control
customer churn in order to retain existing customers. As churn management is an
important activity for companies to retain loyal customers, the ability to
correctly predict customer churn is necessary. As the cellular network services
market becoming more competitive, customer churn management has become a
crucial task for mobile communication operators. This paper proposes a neural
network based approach to predict customer churn in subscription of cellular
wireless services. The results of experiments indicate that neural network
based approach can predict customer churn.
","[{'version': 'v1', 'created': 'Mon, 16 Sep 2013 13:20:30 GMT'}]",2013-09-17,"[['Sharma', 'Anuj', ''], ['Panigrahi', 'Dr. Prabin Kumar', '']]","['Neural Network', 'Churn prediction', 'Wireless Network Services']"
4696,1807.01295,Ralf-Peter Mundani,"John N. Jomo (1), Nils Zander (1), Mohamed Elhaddad (1), Ali \""Ozcan
  (1), Stefan Kollmannsberger (1), Ralf-Peter Mundani (1), Ernst Rank (1 and 2)
  ((1) Technische Universit\""at M\""unchen, Munich, Germany, (2) Institute for
  Advanced Study, Technische Universit\""at M\""unchen, Garching, Germany)",Parallelization of the multi-level hp-adaptive finite cell method,"24 pages, 16 figures",Computers & Mathematics with Applications 74 (2017) 126-142,10.1016/j.camwa.2017.01.004,,cs.DC math.NA physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The multi-level hp-refinement scheme is a powerful extension of the finite
element method that allows local mesh adaptation without the trouble of
constraining hanging nodes. This is achieved through hierarchical high-order
overlay meshes, a hp-scheme based on spatial refinement by superposition. An
efficient parallelization of this method using standard domain decomposition
approaches in combination with ghost elements faces the challenge of a large
basis function support resulting from the overlay structure and is in many
cases not feasible. In this contribution, a parallelization strategy for the
multi-level hp-scheme is presented that is adapted to the scheme's simple
hierarchical structure. By distributing the computational domain among
processes on the granularity of the active leaf elements and utilizing shared
mesh data structures, good parallel performance is achieved, as redundant
computations on ghost elements are avoided. We show the scheme's parallel
scalability for problems with a few hundred elements per process. Furthermore,
the scheme is used in conjunction with the finite cell method to perform
numerical simulations on domains of complex shape.
","[{'version': 'v1', 'created': 'Tue, 3 Jul 2018 17:27:50 GMT'}]",2018-07-04,"[['Jomo', 'John N.', '', '1 and 2'], ['Zander', 'Nils', '', '1 and 2'], ['Elhaddad', 'Mohamed', '', '1 and 2'], ['Özcan', 'Ali', '', '1 and 2'], ['Kollmannsberger', 'Stefan', '', '1 and 2'], ['Mundani', 'Ralf-Peter', '', '1 and 2'], ['Rank', 'Ernst', '', '1 and 2']]","['high-order FEM', 'automatic hp-adaptivity', 'arbitrary hanging nodes', 'finite cell method', 'parallel computation', 'high performance computing']"
4697,1610.06366,Flavio D'Alessandro,"Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan",On Finite-Index Indexed Grammars and Their Restrictions,"16 pages, latest version","Information and Computation, Vol. 279, 2021, p. 1-13",10.1016/j.ic.2020.104613,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The family, L(INDLIN), of languages generated by linear indexed grammars has
been studied in the literature. It is known that the Parikh image of every
language in L(INDLIN) is semi-linear. However, there are bounded semi linear
languages that are not in L(INDLIN). Here, we look at larger families of
(restricted) indexed languages and study their properties, their relationships,
and their decidability properties.
","[{'version': 'v1', 'created': 'Thu, 20 Oct 2016 11:30:10 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Oct 2016 06:31:18 GMT'}, {'version': 'v3', 'created': 'Fri, 28 Oct 2016 16:35:53 GMT'}, {'version': 'v4', 'created': 'Wed, 7 Dec 2022 16:47:42 GMT'}]",2022-12-08,"[[""D'Alessandro"", 'Flavio', ''], ['Ibarra', 'Oscar H.', ''], ['McQuillan', 'Ian', '']]","['Indexed Languages', 'Finite-Index', 'Full Trios', 'Semi-linearity', 'Bounded Languages', 'ET0LLanguages']"
4698,2105.06262,Julian Posada,Julian Posada,The Coloniality of Data Work in Latin America,,"Proceedings of the 2021 AAAI/ACM Conference on AI, Ethics, and
  Society",10.1145/3461702.3462471,,cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This presentation for the AIES 21 doctoral consortium examines the Latin
American crowdsourcing market through a decolonial lens. This research is based
on the analysis of the web traffic of ninety-three platforms, interviews with
Venezuelan data workers of four platforms, and the analysis of the
documentation issued by these organizations. The findings show that (1)
centuries-old global divisions of labor persist, in this case, with requesters
located in advanced economies and workers in the Global South. (2) That the
platforms' configuration of the labor process constrains the agency of these
workers when producing annotations. And, (3) that ideologies originating from
the Global North serve to legitimize and reinforce this global labor market
configuration.
","[{'version': 'v1', 'created': 'Mon, 26 Apr 2021 00:46:42 GMT'}]",2021-05-14,"[['Posada', 'Julian', '']]","['Coloniality', 'crowdsourcing', 'labor', 'platform']"
4699,1111.6561,Hyung-Chan An,Hyung-Chan An and Robert Kleinberg,A Diameter-Revealing Proof of the Bondy-Lov\'asz Lemma,"8 pages, 1 figures",,10.1016/j.ipl.2021.106194,,cs.DM,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We present a strengthened version of a lemma due to Bondy and Lov\'asz. This
lemma establishes the connectivity of a certain graph whose nodes correspond to
the spanning trees of a 2-vertex-connected graph, and implies the k=2 case of
the Gy\H{o}ri-Lov\'asz Theorem on partitioning of k-vertex-connected graphs.
Our strengthened version constructively proves an asymptotically tight O(|V|^2)
bound on the worst-case diameter of this graph of spanning trees.
","[{'version': 'v1', 'created': 'Mon, 28 Nov 2011 19:40:13 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Aug 2021 17:24:40 GMT'}]",2021-08-24,"[['An', 'Hyung-Chan', ''], ['Kleinberg', 'Robert', '']]","['Bondy-Lov´asz Lemma', 'Gy˝ori-Lov´asz Theorem', 'graph diameter', 'graphpartitioning', 'st-numbering']"
4700,2102.10820,Dennis Stumpf,"Dennis Stumpf, Stephan Krau\ss, Gerd Reis, Oliver Wasenm\""uller,
  Didier Stricker",SALT: A Semi-automatic Labeling Tool for RGB-D Video Sequences,"VISAPP 2021 full paper (9 pages, 6 figures), published by SciTePress:
  https://www.scitepress.org/PublicationsDetail.aspx?ID=ywQZ3GZrka8=&t=1","Proceedings of the 16th International Joint Conference on Computer
  Vision, Imaging and Computer Graphics Theory and Applications - Volume 4
  VISAPP: VISAPP (2021) 595-603",10.5220/0010303005950603,,cs.CV cs.LG cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Large labeled data sets are one of the essential basics of modern deep
learning techniques. Therefore, there is an increasing need for tools that
allow to label large amounts of data as intuitively as possible. In this paper,
we introduce SALT, a tool to semi-automatically annotate RGB-D video sequences
to generate 3D bounding boxes for full six Degrees of Freedom (DoF) object
poses, as well as pixel-level instance segmentation masks for both RGB and
depth. Besides bounding box propagation through various interpolation
techniques, as well as algorithmically guided instance segmentation, our
pipeline also provides built-in pre-processing functionalities to facilitate
the data set creation process. By making full use of SALT, annotation time can
be reduced by a factor of up to 33.95 for bounding box creation and 8.55 for
RGB segmentation without compromising the quality of the automatically
generated ground truth.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2021 08:11:39 GMT'}]",2021-02-23,"[['Stumpf', 'Dennis', ''], ['Krauß', 'Stephan', ''], ['Reis', 'Gerd', ''], ['Wasenmüller', 'Oliver', ''], ['Stricker', 'Didier', '']]","['RGB-D', 'Dataset', 'Tool', 'Annotation', 'Label', 'Detection', 'Segmentation']"
4701,1306.1462,Kanika Bansal,"Kanika Bansal, Rajiv Kumar","K-Algorithm A Modified Technique for Noise Removal in Handwritten
  Documents",,"International Journal of Information Sciences and Techniques, May
  2013, Volume 3, Number 3",10.5121/ijist.2013.3301,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  OCR has been an active research area since last few decades. OCR performs the
recognition of the text in the scanned document image and converts it into
editable form. The OCR process can have several stages like pre-processing,
segmentation, recognition and post processing. The pre-processing stage is a
crucial stage for the success of OCR, which mainly deals with noise removal. In
the present paper, a modified technique for noise removal named as K-Algorithm
has been proposed, which has two stages as filtering and binarization. The
proposed technique shows improvised results in comparison to median filtering
technique.
","[{'version': 'v1', 'created': 'Thu, 6 Jun 2013 16:30:57 GMT'}]",2013-06-07,"[['Bansal', 'Kanika', ''], ['Kumar', 'Rajiv', '']]","['OCR', 'Handwritten', 'Filtering', 'Binarization', 'Preprocessing', 'Offline']"
4702,1608.08176,Amritanshu Agrawal,"Amritanshu Agrawal, Wei Fu, Tim Menzies","What is Wrong with Topic Modeling? (and How to Fix it Using Search-based
  Software Engineering)",15 pages + 2 page references. Accepted to IST,"Information and Software Technology Journal, 2018",10.1016/j.infsof.2018.02.005,,cs.SE cs.AI cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Topic modeling finds human-readable structures in unstructured
textual data. A widely used topic modeler is Latent Dirichlet allocation. When
run on different datasets, LDA suffers from ""order effects"" i.e. different
topics are generated if the order of training data is shuffled. Such order
effects introduce a systematic error for any study. This error can relate to
misleading results;specifically, inaccurate topic descriptions and a reduction
in the efficacy of text mining classification results. Objective: To provide a
method in which distributions generated by LDA are more stable and can be used
for further analysis. Method: We use LDADE, a search-based software engineering
tool that tunes LDA's parameters using DE (Differential Evolution). LDADE is
evaluated on data from a programmer information exchange site (Stackoverflow),
title and abstract text of thousands ofSoftware Engineering (SE) papers, and
software defect reports from NASA. Results were collected across different
implementations of LDA (Python+Scikit-Learn, Scala+Spark); across different
platforms (Linux, Macintosh) and for different kinds of LDAs (VEM,or using
Gibbs sampling). Results were scored via topic stability and text mining
classification accuracy. Results: In all treatments: (i) standard LDA exhibits
very large topic instability; (ii) LDADE's tunings dramatically reduce cluster
instability; (iii) LDADE also leads to improved performances for supervised as
well as unsupervised learning. Conclusion: Due to topic instability, using
standard LDA with its ""off-the-shelf"" settings should now be depreciated. Also,
in future, we should require SE papers that use LDA to test and (if needed)
mitigate LDA topic instability. Finally, LDADE is a candidate technology for
effectively and efficiently reducing that instability.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2016 18:45:00 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Feb 2017 01:19:06 GMT'}, {'version': 'v3', 'created': 'Wed, 8 Nov 2017 04:49:42 GMT'}, {'version': 'v4', 'created': 'Tue, 20 Feb 2018 17:26:51 GMT'}]",2018-03-16,"[['Agrawal', 'Amritanshu', ''], ['Fu', 'Wei', ''], ['Menzies', 'Tim', '']]","['Topic modeling', 'Stability', 'LDA', 'tuning', 'differential evolution']"
4703,1707.04653,Sanjaya Wijeratne,"Sanjaya Wijeratne, Lakshika Balasuriya, Amit Sheth, Derek Doran",A Semantics-Based Measure of Emoji Similarity,"This paper is accepted at Web Intelligence 2017 as a full paper, In
  2017 IEEE/WIC/ACM International Conference on Web Intelligence (WI). Leipzig,
  Germany: ACM, 2017",,10.1145/3106426.3106490,,cs.CL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Emoji have grown to become one of the most important forms of communication
on the web. With its widespread use, measuring the similarity of emoji has
become an important problem for contemporary text processing since it lies at
the heart of sentiment analysis, search, and interface design tasks. This paper
presents a comprehensive analysis of the semantic similarity of emoji through
embedding models that are learned over machine-readable emoji meanings in the
EmojiNet knowledge base. Using emoji descriptions, emoji sense labels and emoji
sense definitions, and with different training corpora obtained from Twitter
and Google News, we develop and test multiple embedding models to measure emoji
similarity. To evaluate our work, we create a new dataset called EmoSim508,
which assigns human-annotated semantic similarity scores to a set of 508
carefully selected emoji pairs. After validation with EmoSim508, we present a
real-world use-case of our emoji embedding models using a sentiment analysis
task and show that our models outperform the previous best-performing emoji
embedding model on this task. The EmoSim508 dataset and our emoji embedding
models are publicly released with this paper and can be downloaded from
http://emojinet.knoesis.org/.
","[{'version': 'v1', 'created': 'Fri, 14 Jul 2017 22:08:15 GMT'}]",2017-07-18,"[['Wijeratne', 'Sanjaya', ''], ['Balasuriya', 'Lakshika', ''], ['Sheth', 'Amit', ''], ['Doran', 'Derek', '']]","['Emoji Similarity', 'Emoji Analysis and Search', 'Semantic Similarity']"
4704,1406.0909,Sedigheh Ildarabadi,"S. Ildarabadi, M. Ebrahimi, H. R. Pourreza","Improvement Tracking Dynamic Programming using Replication Function for
  Continuous Sign Language Recognition","5 pages, 13 figures, Published with ""International Journal of
  Engineering Trends and Technology (IJETT)""",,10.14445/22315381/IJETT-V7P254,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we used a Replication Function (R. F.)for improvement tracking
with dynamic programming. The R. F. transforms values of gray level [0 255] to
[0 1]. The resulting images of R. F. are more striking and visible in skin
regions. The R. F. improves Dynamic Programming (D. P.) in overlapping hand and
face. Results show that Tracking Error Rate 11% and Average Tracked Distance 7%
reduced
","[{'version': 'v1', 'created': 'Wed, 4 Jun 2014 00:03:51 GMT'}]",2014-06-05,"[['Ildarabadi', 'S.', ''], ['Ebrahimi', 'M.', ''], ['Pourreza', 'H. R.', '']]","['dynamic programming', 'machine vision', 'replication function', 'sign language', 'tracking']"
4705,1901.09691,Alexandru Cristian Mara,"Alexandru Mara, Jefrey Lijffijt and Tijl De Bie",EvalNE: A Framework for Evaluating Network Embeddings on Link Prediction,,,10.1016/j.softx.2022.100997,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present EvalNE, a Python toolbox for evaluating network
embedding methods on link prediction tasks. Link prediction is one of the most
popular choices for evaluating the quality of network embeddings. However, the
complexity of this task requires a carefully designed evaluation pipeline in
order to provide consistent, reproducible and comparable results. EvalNE
simplifies this process by providing automation and abstraction of tasks such
as hyper-parameter tuning and model validation, edge sampling and negative edge
sampling, computation of edge embeddings from node embeddings, and evaluation
metrics. The toolbox allows for the evaluation of any off-the-shelf embedding
method without the need to write extra code. Moreover, it can also be used for
evaluating any other link prediction method, and integrates several link
prediction heuristics as baselines.
","[{'version': 'v1', 'created': 'Tue, 22 Jan 2019 13:37:58 GMT'}]",2022-02-02,"[['Mara', 'Alexandru', ''], ['Lijffijt', 'Jefrey', ''], ['De Bie', 'Tijl', '']]","['Network Embedding', 'Link Prediction', 'Evaluation', 'Edge Sampling', 'Graphs']"
4706,1711.04150,Supriya Pandhre,"Supriya Pandhre, Himangi Mittal, Manish Gupta, Vineeth N
  Balasubramanian",STWalk: Learning Trajectory Representations in Temporal Graphs,"10 pages, 5 figures, 2 tables",,10.1145/3152494.3152512,,cs.SI cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Analyzing the temporal behavior of nodes in time-varying graphs is useful for
many applications such as targeted advertising, community evolution and outlier
detection. In this paper, we present a novel approach, STWalk, for learning
trajectory representations of nodes in temporal graphs. The proposed framework
makes use of structural properties of graphs at current and previous time-steps
to learn effective node trajectory representations. STWalk performs random
walks on a graph at a given time step (called space-walk) as well as on graphs
from past time-steps (called time-walk) to capture the spatio-temporal behavior
of nodes. We propose two variants of STWalk to learn trajectory
representations. In one algorithm, we perform space-walk and time-walk as part
of a single step. In the other variant, we perform space-walk and time-walk
separately and combine the learned representations to get the final trajectory
embedding. Extensive experiments on three real-world temporal graph datasets
validate the effectiveness of the learned representations when compared to
three baseline methods. We also show the goodness of the learned trajectory
embeddings for change point detection, as well as demonstrate that arithmetic
operations on these trajectory representations yield interesting and
interpretable results.
","[{'version': 'v1', 'created': 'Sat, 11 Nov 2017 15:19:27 GMT'}]",2017-11-15,"[['Pandhre', 'Supriya', ''], ['Mittal', 'Himangi', ''], ['Gupta', 'Manish', ''], ['Balasubramanian', 'Vineeth N', '']]","['Representation Learning', 'Deep Learning', 'Temporal Graph Analysis']"
4707,1711.03871,Daniel Patterson,"Daniel Patterson, Jamie Perconti, Christos Dimoulas, Amal Ahmed",FunTAL: Reasonably Mixing a Functional Language with Assembly,"15 pages; implementation at https://dbp.io/artifacts/funtal/;
  published in PLDI '17, Proceedings of the 38th ACM SIGPLAN Conference on
  Programming Language Design and Implementation, June 18 - 23, 2017,
  Barcelona, Spain",,10.1145/3140587.3062347,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present FunTAL, the first multi-language system to formalize safe
interoperability between a high-level functional language and low-level
assembly code while supporting compositional reasoning about the mix. A central
challenge in developing such a multi-language is bridging the gap between
assembly, which is staged into jumps to continuations, and high-level code,
where subterms return a result. We present a compositional stack-based typed
assembly language that supports components, comprised of one or more basic
blocks, that may be embedded in high-level contexts. We also present a logical
relation for FunTAL that supports reasoning about equivalence of high-level
components and their assembly replacements, mixed-language programs with
callbacks between languages, and assembly components comprised of different
numbers of basic blocks.
","[{'version': 'v1', 'created': 'Fri, 10 Nov 2017 15:25:50 GMT'}]",2017-11-13,"[['Patterson', 'Daniel', ''], ['Perconti', 'Jamie', ''], ['Dimoulas', 'Christos', ''], ['Ahmed', 'Amal', '']]","['multi-language semantics', 'typed assembly language', 'inline assembly', 'contextual equivalence', 'logical relations']"
4708,2112.13647,Borun Xu,"Borun Xu, Biao Wang, Jiale Tao, Tiezheng Ge, Yuning Jiang, Wen Li,
  Lixin Duan",Move As You Like: Image Animation in E-Commerce Scenario,"3 pages, 3 figures, ACM MM 2021 demo session","Proceedings of the 29th ACM International Conference on
  Multimedia. 2021: 2759-2761",10.1145/3474085.3478550,,cs.GR cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Creative image animations are attractive in e-commerce applications, where
motion transfer is one of the import ways to generate animations from static
images. However, existing methods rarely transfer motion to objects other than
human body or human face, and even fewer apply motion transfer in practical
scenarios. In this work, we apply motion transfer on the Taobao product images
in real e-commerce scenario to generate creative animations, which are more
attractive than static images and they will bring more benefits. We animate the
Taobao products of dolls, copper running horses and toy dinosaurs based on
motion transfer method for demonstration.
","[{'version': 'v1', 'created': 'Sun, 19 Dec 2021 06:41:10 GMT'}]",2021-12-28,"[['Xu', 'Borun', ''], ['Wang', 'Biao', ''], ['Tao', 'Jiale', ''], ['Ge', 'Tiezheng', ''], ['Jiang', 'Yuning', ''], ['Li', 'Wen', ''], ['Duan', 'Lixin', '']]","['deep learning', 'image animation', 'motion transfer', 'e-commerce application']"
4709,1311.0758,Gildas Morvan,"Gildas Morvan, Alexandre Veremme, Daniel Dupont",Observation of large-scale multi-agent based simulations,,"Multi-Agent-Based Simulation XII, LNCS 7124, 2012, pp 103-112",10.1007/978-3-642-28400-7_8,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The computational cost of large-scale multi-agent based simulations (MABS)
can be extremely important, especially if simulations have to be monitored for
validation purposes. In this paper, two methods, based on self-observation and
statistical survey theory, are introduced in order to optimize the computation
of observations in MABS. An empirical comparison of the computational cost of
these methods is performed on a toy problem.
","[{'version': 'v1', 'created': 'Mon, 4 Nov 2013 16:28:31 GMT'}]",2013-11-05,"[['Morvan', 'Gildas', ''], ['Veremme', 'Alexandre', ''], ['Dupont', 'Daniel', '']]","['large-scale multi-agent based simulations', 'observation methods', 'scalability']"
4710,2210.05217,Guillaume Bau,"Guillaume Bau, Antoine Min\'e, Vincent Botbol, Mehdi Bouaziz",Abstract interpretation of Michelson smart-contracts,,"SOAP '22: 11th ACM SIGPLAN International Workshop on the State Of
  the Art in Program Analysis, Jun 2022, San Diego, CA, United States. pp.36-43",10.1145/3520313.3534660,,cs.CR cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Static analysis of smart-contracts is becoming more widespread on blockchain
platforms. Analyzers rely on techniques like symbolic execution or model
checking, but few of them can provide strong soundness properties and guarantee
the analysis termination at the same time. As smart-contracts often manipulate
economic assets, proving numerical properties beyond the absence of runtime
errors is also desirable. Smart-contract execution models differ considerably
from mainstream programming languages and vary from one blockchain to another,
making state-of-the-art analyses hard to adapt. For instance, smart-contract
calls may modify a persistent storage impacting subsequent calls. This makes it
difficult for tools to infer invariants required to formally ensure the absence
of exploitable vulnerabilities. The Michelson smart-contract language, used in
the Tezos blockchain, is strongly typed, stack-based, and has a strict
execution model leaving few opportunities for implicit runtime errors. We
present a work in progress static analyzer for Michelson based on Abstract
Interpretation and implemented within MOPSA, a modular static analyzer. Our
tool supports the Michelson semantic features, including inner calls to
external contracts. It can prove the absence of runtime errors and infer
invariants on the persistent storage over an unbounded number of calls. It is
also being extended to prove high-level numerical and security properties. CCS
Concepts: $\bullet$ Security and privacy $\rightarrow$ Logic and verification;
$\bullet$ Software and its engineering $\rightarrow$ Automated static analysis.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2022 07:32:56 GMT'}]",2022-10-12,"[['Bau', 'Guillaume', ''], ['Miné', 'Antoine', ''], ['Botbol', 'Vincent', ''], ['Bouaziz', 'Mehdi', '']]","['static analysis', 'abstract interpretation', 'smart-contract', 'blockchain', 'Michelson', 'Tezos']"
4711,1108.2656,Hichem  Sedjelmaci,Hichem Sedjelmaci and Mohamed Feham,"Novel hybrid intrusion detection system for clustered wireless sensor
  network",14 pages,,10.5121/ijnsa.2011.3401,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless sensor network (WSN) is regularly deployed in unattended and hostile
environments. The WSN is vulnerable to security threats and susceptible to
physical capture. Thus, it is necessary to use effective mechanisms to protect
the network. It is widely known, that the intrusion detection is one of the
most efficient security mechanisms to protect the network against malicious
attacks or unauthorized access. In this paper, we propose a hybrid intrusion
detection system for clustered WSN. Our intrusion framework uses a combination
between the Anomaly Detection based on support vector machine (SVM) and the
Misuse Detection. Experiments results show that most of routing attacks can be
detected with low false alarm.
","[{'version': 'v1', 'created': 'Fri, 12 Aug 2011 16:41:46 GMT'}]",2011-08-15,"[['Sedjelmaci', 'Hichem', ''], ['Feham', 'Mohamed', '']]","['Wireless  Sensor Network', 'Hybrid Intrusion Detection System', 'Support Vector Machine (SVM)', 'Classification Accuracy', 'False alarm']"
4712,1811.03407,Marco Cox,"Marco Cox, Thijs van de Laar, Bert de Vries","A Factor Graph Approach to Automated Design of Bayesian Signal
  Processing Algorithms","Accepted for publication in the International Journal of Approximate
  Reasoning",,10.1016/j.ijar.2018.11.002,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The benefits of automating design cycles for Bayesian inference-based
algorithms are becoming increasingly recognized by the machine learning
community. As a result, interest in probabilistic programming frameworks has
much increased over the past few years. This paper explores a specific
probabilistic programming paradigm, namely message passing in Forney-style
factor graphs (FFGs), in the context of automated design of efficient Bayesian
signal processing algorithms. To this end, we developed ""ForneyLab""
(https://github.com/biaslab/ForneyLab.jl) as a Julia toolbox for message
passing-based inference in FFGs. We show by example how ForneyLab enables
automatic derivation of Bayesian signal processing algorithms, including
algorithms for parameter estimation and model comparison. Crucially, due to the
modular makeup of the FFG framework, both the model specification and inference
methods are readily extensible in ForneyLab. In order to test this framework,
we compared variational message passing as implemented by ForneyLab with
automatic differentiation variational inference (ADVI) and Monte Carlo methods
as implemented by state-of-the-art tools ""Edward"" and ""Stan"". In terms of
performance, extensibility and stability issues, ForneyLab appears to enjoy an
edge relative to its competitors for automated inference in state-space models.
","[{'version': 'v1', 'created': 'Thu, 8 Nov 2018 13:53:46 GMT'}]",2018-11-12,"[['Cox', 'Marco', ''], ['van de Laar', 'Thijs', ''], ['de Vries', 'Bert', '']]","['Probabilistic Programming', 'Bayesian Inference', 'Julia', 'Factor Graphs', 'Message Passing']"
4713,1412.8107,Mary  Cherian,Mary Cherian and T.R.Gopalakrishnan Nair,Priority based bandwidth allocation in wireless sensor networks,"10 pages, International Journal of Computer Networks & Communications
  (IJCNC) Vol.6, No.6, November 2014",,10.5121/ijcnc.2014.6609,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most of the sensor network applications need real time communication and the
need for deadline aware real time communication is becoming eminent in these
applications. These applications have different dead line requirements also.
The real time applications of wireless sensor networks are bandwidth sensitive
and need higher share of bandwidth for higher priority data to meet the dead
line requirements. In this paper we focus on the MAC layer modifications to
meet the real time requirements of different priority data. Bandwidth
partitioning among different priority transmissions is implemented through MAC
layer modifications. The MAC layer implements a queuing model that supports
lower transfer rate for lower priority packets and higher transfer rate for
real time packets with higher priority, minimizing the end to end delay. The
performance of the algorithm is evaluated with varying node distribution.
","[{'version': 'v1', 'created': 'Tue, 9 Dec 2014 13:40:57 GMT'}]",2014-12-30,"[['Cherian', 'Mary', ''], ['Nair', 'T. R. Gopalakrishnan', '']]","['Wireless sensor networks', 'real time', 'priority of traffic flow', 'MAC layer', 'bandwidth allocation']"
4714,2105.04184,Hojjat Navidan,"Hojjat Navidan, Parisa Fard Moshiri, Mohammad Nabati, Reza Shahbazian,
  Seyed Ali Ghorashi, Vahid Shah-Mansouri and David Windridge","Generative Adversarial Networks (GANs) in Networking: A Comprehensive
  Survey & Evaluation",Accepted for publication at Journal of Computer Networks,,10.1016/j.comnet.2021.108149,,cs.NI cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Despite the recency of their conception, Generative Adversarial Networks
(GANs) constitute an extensively researched machine learning sub-field for the
creation of synthetic data through deep generative modeling. GANs have
consequently been applied in a number of domains, most notably computer vision,
in which they are typically used to generate or transform synthetic images.
Given their relative ease of use, it is therefore natural that researchers in
the field of networking (which has seen extensive application of deep learning
methods) should take an interest in GAN-based approaches. The need for a
comprehensive survey of such activity is therefore urgent. In this paper, we
demonstrate how this branch of machine learning can benefit multiple aspects of
computer and communication networks, including mobile networks, network
analysis, internet of things, physical layer, and cybersecurity. In doing so,
we shall provide a novel evaluation framework for comparing the performance of
different models in non-image applications, applying this to a number of
reference network datasets.
","[{'version': 'v1', 'created': 'Mon, 10 May 2021 08:28:36 GMT'}]",2021-05-11,"[['Navidan', 'Hojjat', ''], ['Moshiri', 'Parisa Fard', ''], ['Nabati', 'Mohammad', ''], ['Shahbazian', 'Reza', ''], ['Ghorashi', 'Seyed Ali', ''], ['Shah-Mansouri', 'Vahid', ''], ['Windridge', 'David', '']]","['Generative Adversarial Networks', 'Deep Learning', 'Semi-supervised Learning', 'Computer Networks', 'Communication Networks']"
4715,2105.11734,Robin Brochier,"Robin Brochier, Fr\'ed\'eric B\'echet",Predicting Links on Wikipedia with Anchor Text Information,"ACM SIGIR Conference on Research and Development in Information
  Retrieval, Jul 2021, New York, France",,10.1145/3404835.3462994,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wikipedia, the largest open-collaborative online encyclopedia, is a corpus of
documents bound together by internal hyperlinks. These links form the building
blocks of a large network whose structure contains important information on the
concepts covered in this encyclopedia. The presence of a link between two
articles, materialised by an anchor text in the source page pointing to the
target page, can increase readers' understanding of a topic. However, the
process of linking follows specific editorial rules to avoid both under-linking
and over-linking. In this paper, we study the transductive and the inductive
tasks of link prediction on several subsets of the English Wikipedia and
identify some key challenges behind automatic linking based on anchor text
information. We propose an appropriate evaluation sampling methodology and
compare several algorithms. Moreover, we propose baseline models that provide a
good estimation of the overall difficulty of the tasks.
","[{'version': 'v1', 'created': 'Tue, 25 May 2021 07:57:57 GMT'}]",2021-05-26,"[['Brochier', 'Robin', ''], ['Béchet', 'Frédéric', '']]","['Wikipedia', 'link prediction', 'evaluation', 'hyperlinks']"
4716,1804.09007,Emanuele De Angelis,"Emanuele De Angelis (1), Fabio Fioravanti (1), Alberto Pettorossi (2),
  Maurizio Proietti (3) ((1) DEC, University G. D'Annunzio of Chieti-Pescara,
  Pescara, Italy, (2) DICII, University of Rome Tor Vergata, Roma, Italy, (3)
  CNR-IASI, Roma, Italy)",Solving Horn Clauses on Inductive Data Types Without Induction,"Paper presented at the 34nd International Conference on Logic
  Programming (ICLP 2018), Oxford, UK, July 14 to July 17, 2018. 22 pages,
  LaTeX","Theory and Practice of Logic Programming, 18(3-4), 2018, 452-469",10.1017/S1471068418000157,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the problem of verifying the satisfiability of Constrained Horn
Clauses (CHCs) based on theories of inductively defined data structures, such
as lists and trees. We propose a transformation technique whose objective is
the removal of these data structures from CHCs, hence reducing their
satisfiability to a satisfiability problem for CHCs on integers and booleans.
We propose a transformation algorithm and identify a class of clauses where it
always succeeds. We also consider an extension of that algorithm, which
combines clause transformation with reasoning on integer constraints. Via an
experimental evaluation we show that our technique greatly improves the
effectiveness of applying the Z3 solver to CHCs. We also show that our
verification technique based on CHC transformation followed by CHC solving, is
competitive with respect to CHC solvers extended with induction. This paper is
under consideration for acceptance in TPLP.
","[{'version': 'v1', 'created': 'Tue, 24 Apr 2018 13:20:25 GMT'}]",2018-10-23,"[['De Angelis', 'Emanuele', ''], ['Fioravanti', 'Fabio', ''], ['Pettorossi', 'Alberto', ''], ['Proietti', 'Maurizio', '']]","['Program verification', 'constrained Horn clauses', 'constraint logic programming', 'inductively defined data types', 'program transformation']"
4717,1809.03577,Putra Manggala,Chen Karako and Putra Manggala,"Using Image Fairness Representations in Diversity-Based Re-ranking for
  Recommendations",,"Adjunct Publication of the 26th Conference on User Modeling,
  Adaptation and Personalization, UMAP 2018, Singapore, July 08-11, 2018. ACM
  2018",,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The trade-off between relevance and fairness in personalized recommendations
has been explored in recent works, with the goal of minimizing learned
discrimination towards certain demographics while still producing relevant
results.
  We present a fairness-aware variation of the Maximal Marginal Relevance (MMR)
re-ranking method which uses representations of demographic groups computed
using a labeled dataset. This method is intended to incorporate fairness with
respect to these demographic groups.
  We perform an experiment on a stock photo dataset and examine the trade-off
between relevance and fairness against a well known baseline, MMR, by using
human judgment to examine the results of the re-ranking when using different
fractions of a labeled dataset, and by performing a quantitative analysis on
the ranked results of a set of query images. We show that our proposed method
can incorporate fairness in the ranked results while obtaining higher precision
than the baseline, while our case study shows that even a limited amount of
labeled data can be used to compute the representations to obtain fairness.
This method can be used as a post-processing step for recommender systems and
search.
","[{'version': 'v1', 'created': 'Mon, 10 Sep 2018 20:18:47 GMT'}]",2018-09-12,"[['Karako', 'Chen', ''], ['Manggala', 'Putra', '']]","['Recommender Systems', 'Information Retrieval', 'Diversity', 'Fairness']"
4718,1008.4348,Jasmine Meng,"Jia Meng, Wotao Yin, Husheng Li, Ekram Hossain, and Zhu Han","Collaborative Spectrum Sensing from Sparse Observations in Cognitive
  Radio Networks","12 pages, 11 figures","IEEE Journal on Selected Areas in Communications 29(2), 327-337,
  2011",10.1109/JSAC.2011.110206,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spectrum sensing, which aims at detecting spectrum holes, is the precondition
for the implementation of cognitive radio (CR). Collaborative spectrum sensing
among the cognitive radio nodes is expected to improve the ability of checking
complete spectrum usage. Due to hardware limitations, each cognitive radio node
can only sense a relatively narrow band of radio spectrum. Consequently, the
available channel sensing information is far from being sufficient for
precisely recognizing the wide range of unoccupied channels. Aiming at breaking
this bottleneck, we propose to apply matrix completion and joint sparsity
recovery to reduce sensing and transmitting requirements and improve sensing
results. Specifically, equipped with a frequency selective filter, each
cognitive radio node senses linear combinations of multiple channel information
and reports them to the fusion center, where occupied channels are then decoded
from the reports by using novel matrix completion and joint sparsity recovery
algorithms. As a result, the number of reports sent from the CRs to the fusion
center is significantly reduced. We propose two decoding approaches, one based
on matrix completion and the other based on joint sparsity recovery, both of
which allow exact recovery from incomplete reports. The numerical results
validate the effectiveness and robustness of our approaches. In particular, in
small-scale networks, the matrix completion approach achieves exact channel
detection with a number of samples no more than 50% of the number of channels
in the network, while joint sparsity recovery achieves similar performance in
large-scale networks.
","[{'version': 'v1', 'created': 'Wed, 25 Aug 2010 19:51:03 GMT'}]",2015-11-23,"[['Meng', 'Jia', ''], ['Yin', 'Wotao', ''], ['Li', 'Husheng', ''], ['Hossain', 'Ekram', ''], ['Han', 'Zhu', '']]","['Collaborative spectrum sensing', 'matrix completion', 'compressive sensing', 'joint sparsity recovery']"
4719,1612.06038,Diederik Aerts,"Diederik Aerts, Jonito Aerts Argu\""elles, Lester Beltran, Lyneth
  Beltran, Massimiliano Sassoli de Bianchi, Sandro Sozzo and Tomas Veloz",Context and Interference Effects in the Combinations of Natural Concepts,"12 pages, no figures","In: Br\'ezillon P., Turner R., Penco C. (eds) Modeling and Using
  Context. CONTEXT 2017. Lecture Notes in Computer Science, vol 10257.
  Springer, Cham (2017)",10.1007/978-3-319-57837-8_54,,cs.AI quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The mathematical formalism of quantum theory exhibits significant
effectiveness when applied to cognitive phenomena that have resisted
traditional (set theoretical) modeling. Relying on a decade of research on the
operational foundations of micro-physical and conceptual entities, we present a
theoretical framework for the representation of concepts and their conjunctions
and disjunctions that uses the quantum formalism. This framework provides a
unified solution to the 'conceptual combinations problem' of cognitive
psychology, explaining the observed deviations from classical (Boolean, fuzzy
set and Kolmogorovian) structures in terms of genuine quantum effects. In
particular, natural concepts 'interfere' when they combine to form more complex
conceptual entities, and they also exhibit a 'quantum-type context-dependence',
which are responsible of the 'over- and under-extension' that are
systematically observed in experiments on membership judgments.
","[{'version': 'v1', 'created': 'Mon, 19 Dec 2016 04:01:55 GMT'}]",2018-04-24,"[['Aerts', 'Diederik', ''], ['Arguëlles', 'Jonito Aerts', ''], ['Beltran', 'Lester', ''], ['Beltran', 'Lyneth', ''], ['de Bianchi', 'Massimiliano Sassoli', ''], ['Sozzo', 'Sandro', ''], ['Veloz', 'Tomas', '']]","['Cognitive psychology', 'concept combination', 'context effects', 'interference effects', 'quantummodeling', 'quantum structures']"
4720,1811.11911,Yao Li,"Nicolas Koh, Yao Li, Yishuai Li, Li-yao Xia, Lennart Beringer, Wolf
  Honor\'e, William Mansky, Benjamin C. Pierce, Steve Zdancewic","From C to Interaction Trees: Specifying, Verifying, and Testing a
  Networked Server",13 pages + references,"Proceedings of the 8th ACM SIGPLAN International Conference on
  Certified Programs and Proofs (CPP '19), January 14--15, 2019, Cascais,
  Portugal",10.1145/3293880.3294106,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the first formal verification of a networked server implemented in
C. Interaction trees, a general structure for representing reactive
computations, are used to tie together disparate verification and testing tools
(Coq, VST, and QuickChick) and to axiomatize the behavior of the operating
system on which the server runs (CertiKOS). The main theorem connects a
specification of acceptable server behaviors, written in a straightforward ""one
client at a time"" style, with the CompCert semantics of the C program. The
variability introduced by low-level buffering of messages and interleaving of
multiple TCP connections is captured using network refinement, a variant of
observational refinement.
","[{'version': 'v1', 'created': 'Thu, 29 Nov 2018 01:27:45 GMT'}]",2021-02-02,"[['Koh', 'Nicolas', ''], ['Li', 'Yao', ''], ['Li', 'Yishuai', ''], ['Xia', 'Li-yao', ''], ['Beringer', 'Lennart', ''], ['Honoré', 'Wolf', ''], ['Mansky', 'William', ''], ['Pierce', 'Benjamin C.', ''], ['Zdancewic', 'Steve', '']]","['formal verification', 'testing', 'TCP', 'interaction trees', 'network refinement', 'VST', 'QuickChick']"
4721,1204.3431,Sumit Katiyar,"Sumit Katiyar, R. K. Jain, N. K. Agrawal",Green Cellular Network Deployment To Reduce RF Pollution,"6 pages, 6 figures. arXiv admin note: substantial text overlap with
  arXiv:1204.2101, arXiv:1110.2627, and with arXiv:0803.0952 and
  arXiv:0803.0952 by other authors",,10.5120/8414-9361,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As the mobile telecommunication systems are growing tremendously all over the
world, the numbers of handheld and base stations are also rapidly growing and
it became very popular to see these base stations distributed everywhere in the
neighborhood and on roof tops which has caused a considerable amount of panic
to the public in Palestine concerning wither the radiated electromagnetic
fields from these base stations may cause any health effect or hazard. Recently
UP High Court in India ordered for removal of BTS towers from residential area,
it has created panic among cellular communication network designers too. Green
cellular networks could be a solution for the above problem. This paper deals
with green cellular networks with the help of multi-layer overlaid hierarchical
structure (macro / micro / pico / femto cells). Macrocell for area coverage,
micro for pedestrian and a slow moving traffic while pico for indoor use and
femto for individual high capacity users. This could be the answer of the
problem of energy conservation and enhancement of spectral density also.
","[{'version': 'v1', 'created': 'Mon, 16 Apr 2012 10:10:59 GMT'}]",2015-06-04,"[['Katiyar', 'Sumit', ''], ['Jain', 'R. K.', ''], ['Agrawal', 'N. K.', '']]","['Smart / Adaptive Antenna', 'Picocell', 'Femtocell', 'Remote RF', 'Hierarchical Structure']"
4722,1301.6021,Luca De Feo,"Luca De Feo, Javad Doliskani, \'Eric Schost",Fast algorithms for ell-adic towers over finite fields,,,10.1145/2465506.2465956,,cs.SC math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Inspired by previous work of Shoup, Lenstra-De Smit and Couveignes-Lercier,
we give fast algorithms to compute in (the first levels of) the ell-adic
closure of a finite field. In many cases, our algorithms have quasi-linear
complexity.
","[{'version': 'v1', 'created': 'Fri, 25 Jan 2013 11:54:48 GMT'}]",2020-01-07,"[['De Feo', 'Luca', ''], ['Doliskani', 'Javad', ''], ['Schost', 'Éric', '']]","['Finite fields', 'irreducible polynomials', 'extension towers', 'algebraic tori', 'Pell’s equation', 'elliptic curves']"
4723,2109.01109,Anna-Katharina Wickert,"Anna-Katharina Wickert, Lars Baumg\""artner, Florian Breitfelder, Mira
  Mezini",Python Crypto Misuses in the Wild,"6 pages, to be published in the proceedings of the 15th ACM/IEEE
  International Symposium on Empirical Software Engineering and Measurement
  (ESEM) (ESEM 21), October 11-15, 2021, Bari Italy","ACM / IEEE International Symposium on Empirical Software
  Engineering and Measurement (ESEM 2021)",10.1145/3475716.3484195,,cs.SE cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Background: Previous studies have shown that up to 99.59 % of the Java apps
using crypto APIs misuse the API at least once. However, these studies have
been conducted on Java and C, while empirical studies for other languages are
missing. For example, a controlled user study with crypto tasks in Python has
shown that 68.5 % of the professional developers write a secure solution for a
crypto task. Aims: To understand if this observation holds for real-world code,
we conducted a study of crypto misuses in Python. Method: We developed a static
analysis tool that covers common misuses of 5 different Python crypto APIs.
With this analysis, we analyzed 895 popular Python projects from GitHub and 51
MicroPython projects for embedded devices. Further, we compared our results
with the findings of previous studies. Results: Our analysis reveals that 52.26
% of the Python projects have at least one misuse. Further, some Python crypto
libraries API design helps developers from misusing crypto functions, which
were much more common in studies conducted with Java and C code. Conclusion: We
conclude that we can see a positive impact of the good API design on crypto
misuses for Python applications. Further, our analysis of MicroPython projects
reveals the importance of hybrid analyses.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2021 17:32:41 GMT'}]",2021-09-03,"[['Wickert', 'Anna-Katharina', ''], ['Baumgärtner', 'Lars', ''], ['Breitfelder', 'Florian', ''], ['Mezini', 'Mira', '']]","['Crypto API', 'Security', 'Static Analysis']"
4724,1608.03402,Lovro \v{S}ubelj,"Tilen Marc, Lovro \v{S}ubelj",Convexity in complex networks,"27 pages, 11 figures, 3 tables","Netw. Sci. 6(2), 176-203 (2018)",10.1017/nws.2017.37,,cs.SI math.MG physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Metric graph properties lie in the heart of the analysis of complex networks,
while in this paper we study their convexity through mathematical definition of
a convex subgraph. A subgraph is convex if every geodesic path between the
nodes of the subgraph lies entirely within the subgraph. According to our
perception of convexity, convex network is such in which every connected subset
of nodes induces a convex subgraph. We show that convexity is an inherent
property of many networks that is not present in a random graph. Most convex
are spatial infrastructure networks and social collaboration graphs due to
their tree-like or clique-like structure, whereas the food web is the only
network studied that is truly non-convex. Core-periphery networks are
regionally convex as they can be divided into a non-convex core surrounded by a
convex periphery. Random graphs, however, are only locally convex meaning that
any connected subgraph of size smaller than the average geodesic distance
between the nodes is almost certainly convex. We present different measures of
network convexity and discuss its applications in the study of networks.
","[{'version': 'v1', 'created': 'Thu, 11 Aug 2016 09:06:47 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Mar 2017 12:19:14 GMT'}, {'version': 'v3', 'created': 'Thu, 11 May 2017 16:17:28 GMT'}]",2018-05-31,"[['Marc', 'Tilen', ''], ['Šubelj', 'Lovro', '']]","['network convexity', 'convex subsets', 'convex subgraphs', 'core-periphery structure']"
4725,1705.09462,Jing Liu,"Fanqi Zeng, Li Gong, Jing Liu, Jiang Zhang, Qinghua Chen, Ruyue Xin",Interactive Levy Flight in Interest Space,,,10.1088/2632-072X/ab7f4f,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Compared to the well-studied topic of human mobility in real geographic
space, very few studies focus on human mobility in virtual space, such as
interests, knowledge, ideas, and so forth. However, it relates to the issues of
management of public opinions, knowledge diffusion, and innovation. In this
paper, we assume that the interests of a group of online users can span a
Euclidean space which is called interest space, and the transfers of user
interests can be modeled as the Levy Flight on the interest space. To consider
the interaction between users, we assume that the random walkers are not
independent but interact each other indirectly via the digital resources in the
interest space. The model can successfully reproduce a set of scaling laws for
describing the growth of the attention flow networks of real online
communities, and the ranges of the exponents of the scaling are similar with
the empirical data. Further, we can infer parameters for describing the
individual behaviors of the users according to the scaling laws of the
empirical attention flow network. Our model can not only provide theoretical
understanding on human online behaviors, but also has wide potential
applications, such as dissemination and management of public opinions, online
recommendation, etc.
","[{'version': 'v1', 'created': 'Fri, 26 May 2017 07:33:29 GMT'}]",2021-04-27,"[['Zeng', 'Fanqi', ''], ['Gong', 'Li', ''], ['Liu', 'Jing', ''], ['Zhang', 'Jiang', ''], ['Chen', 'Qinghua', ''], ['Xin', 'Ruyue', '']]","['human mobility', 'L´evy Flight', 'collective attention', 'interest space', 'attentionflow networks']"
4726,2102.04227,Victor Von Wachter,"Victor von Wachter, Johannes Rude Jensen, Omri Ross",Measuring Asset Composability as a Proxy for DeFi Integration,"Blockchain, DeFi, Asset Composability, Ethereum","International Conference on Financial Cryptography and Data
  Security (2021)",10.1007/978-3-662-63958-0,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Decentralized financial (DeFi) applications on the Ethereum blockchain are
highly interoperable because they share a single state in a deterministic
computational environment. Stakeholders can deposit claims on assets, referred
to as 'liquidity shares', across applications producing effects equivalent to
rehypothecation in traditional financial systems. We seek to understand the
degree to which this practice may contribute to financial integration on
Ethereum by examining transactions in 'composed' derivatives for the assets
DAI, USDC, USDT, ETH and tokenized BTC for the full set of 344.8 million
Ethereum transactions computed in 2020. We identify a salient trend for
'composing' assets in multiple sequential generations of derivatives and
comment on potential systemic implications for the Ethereum network.
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2021 09:57:33 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Mar 2021 16:47:15 GMT'}]",2021-11-30,"[['von Wachter', 'Victor', ''], ['Jensen', 'Johannes Rude', ''], ['Ross', 'Omri', '']]","['Blockchain', 'DeFi', 'Asset Composability', 'Ethereum']"
4727,1504.02504,Natarajan Meghanathan,Natarajan Meghanathan,"Using Spectral Radius Ratio for Node Degree to Analyze the Evolution of
  Scale Free Networks and Small World Networks","8 pages, 8 figures, Second International Conference on Computer
  Science and Information Technology, (COSIT-2015), Geneva, Switzerland, March
  21-22, 2015",,10.5121/csit.2015.50603,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we show the evaluation of the spectral radius for node degree
as the basis to analyze the variation in the node degrees during the evolution
of scale-free networks and small-world networks. Spectral radius is the
principal eigenvalue of the adjacency matrix of a network graph and spectral
radius ratio for node degree is the ratio of the spectral radius and the
average node degree. We observe a very high positive correlation between the
spectral radius ratio for node degree and the coefficient of variation of node
degree (ratio of the standard deviation of node degree and average node
degree). We show how the spectral radius ratio for node degree can be used as
the basis to tune the operating parameters of the evolution models for
scale-free networks and small-world networks as well as evaluate the impact of
the number of links added per node introduced during the evolution of a
scale-free network and evaluate the impact of the probability of rewiring
during the evolution of a small-world network from a regular network.
","[{'version': 'v1', 'created': 'Thu, 9 Apr 2015 21:30:41 GMT'}]",2015-04-13,"[['Meghanathan', 'Natarajan', '']]","['Eigenvalue', 'Spectral radius', 'Scale-free network', 'Small-world network', 'Node degree']"
4728,1904.02285,Theodoros Rekatsinas,"Alireza Heidari, Joshua McGrath, Ihab F. Ilyas, Theodoros Rekatsinas",HoloDetect: Few-Shot Learning for Error Detection,"18 pages,",ACM SIGMOD 2019,10.1145/3299869.3319888,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a few-shot learning framework for error detection. We show that
data augmentation (a form of weak supervision) is key to training high-quality,
ML-based error detection models that require minimal human involvement. Our
framework consists of two parts: (1) an expressive model to learn rich
representations that capture the inherent syntactic and semantic heterogeneity
of errors; and (2) a data augmentation model that, given a small seed of clean
records, uses dataset-specific transformations to automatically generate
additional training data. Our key insight is to learn data augmentation
policies from the noisy input dataset in a weakly supervised manner. We show
that our framework detects errors with an average precision of ~94% and an
average recall of ~93% across a diverse array of datasets that exhibit
different types and amounts of errors. We compare our approach to a
comprehensive collection of error detection methods, ranging from traditional
rule-based methods to ensemble-based and active learning approaches. We show
that data augmentation yields an average improvement of 20 F1 points while it
requires access to 3x fewer labeled examples compared to other ML approaches.
","[{'version': 'v1', 'created': 'Thu, 4 Apr 2019 00:38:59 GMT'}]",2019-04-05,"[['Heidari', 'Alireza', ''], ['McGrath', 'Joshua', ''], ['Ilyas', 'Ihab F.', ''], ['Rekatsinas', 'Theodoros', '']]","['Error Detection', 'Machine Learning', 'Few-shot Learning', 'DataAugmentation', 'Weak Supervision']"
4729,1608.08072,Leslie Sikos Ph.D.,Leslie F. Sikos,"A Novel Approach to Multimedia Ontology Engineering for Automated
  Reasoning over Audiovisual LOD Datasets",,,10.1007/978-3-662-49381-6_1,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multimedia reasoning, which is suitable for, among others, multimedia content
analysis and high-level video scene interpretation, relies on the formal and
comprehensive conceptualization of the represented knowledge domain. However,
most multimedia ontologies are not exhaustive in terms of role definitions, and
do not incorporate complex role inclusions and role interdependencies. In fact,
most multimedia ontologies do not have a role box at all, and implement only a
basic subset of the available logical constructors. Consequently, their
application in multimedia reasoning is limited. To address the above issues,
VidOnt, the very first multimedia ontology with SROIQ(D) expressivity and a
DL-safe ruleset has been introduced for next-generation multimedia reasoning.
In contrast to the common practice, the formal grounding has been set in one of
the most expressive description logics, and the ontology validated with
industry-leading reasoners, namely HermiT and FaCT++. This paper also presents
best practices for developing multimedia ontologies, based on my ontology
engineering approach.
","[{'version': 'v1', 'created': 'Fri, 26 Aug 2016 05:53:07 GMT'}]",2016-08-30,"[['Sikos', 'Leslie F.', '']]","['ontology', 'OWL', 'MPEG-7', 'video metadata', 'video retrieval', 'Linked Open Data', 'Knowledge Representation']"
4730,1507.02154,Iago Landesa-V\'azquez,"Iago Landesa-V\'azquez, Jos\'e Luis Alba-Castro",Double-Base Asymmetric AdaBoost,,Neurocomputing 118 (2013) 101-114,10.1016/j.neucom.2013.02.019,,cs.CV cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Based on the use of different exponential bases to define class-dependent
error bounds, a new and highly efficient asymmetric boosting scheme, coined as
AdaBoostDB (Double-Base), is proposed. Supported by a fully theoretical
derivation procedure, unlike most of the other approaches in the literature,
our algorithm preserves all the formal guarantees and properties of original
(cost-insensitive) AdaBoost, similarly to the state-of-the-art Cost-Sensitive
AdaBoost algorithm. However, the key advantage of AdaBoostDB is that our novel
derivation scheme enables an extremely efficient conditional search procedure,
dramatically improving and simplifying the training phase of the algorithm.
Experiments, both over synthetic and real datasets, reveal that AdaBoostDB is
able to save over 99% training time with regard to Cost-Sensitive AdaBoost,
providing the same cost-sensitive results. This computational advantage of
AdaBoostDB can make a difference in problems managing huge pools of weak
classifiers in which boosting techniques are commonly used.
","[{'version': 'v1', 'created': 'Wed, 8 Jul 2015 13:44:34 GMT'}]",2015-07-09,"[['Landesa-Vázquez', 'Iago', ''], ['Alba-Castro', 'José Luis', '']]","['AdaBoost', 'Cost', 'Classification', 'Boosting', 'Asymmetry']"
4731,1607.08853,Christoph Meier,"Christoph Meier, Wolfgang A. Wall, Alexander Popp",A Unified Approach for Beam-to-Beam Contact,,,10.1016/j.cma.2016.11.028,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing beam contact formulations can be categorized in point contact models
that consider a discrete contact force at the closest point of the beams, and
line contact models that assume distributed contact forces. In this work, it
will be shown that line contact formulations provide accurate and robust
mechanical models in the range of small contact angles, whereas the
computational efficiency considerably decreases with increasing contact angles.
On the other hand, point contact formulations serve as sufficiently accurate
and very efficient models in the regime of large contact angles, while they are
not applicable for small contact angles as a consequence of non-unique closest
point projections. In order to combine the advantages of these basic
formulations, a novel all-angle beam contact (ABC) formulation is developed
that applies a point contact formulation for large contact angles and a
recently developed line contact formulation for small contact angles, the two
being smoothly connected by means of a variationally consistent model
transition. Based on a stringent analysis, two different transition laws are
investigated, optimal algorithmic parameters are suggested and conservation of
energy and momentum is shown. All configuration-dependent quantities are
consistently linearized, thus allowing for their application within implicit
time integration schemes. Furthermore, a step size control of the nonlinear
solution scheme that allows for large displacement increments per time step and
an efficient two-stage contact search based on dynamically adapted search
segments are proposed. A series of numerical test cases is analyzed in order to
verify the accuracy and consistency of the proposed contact model transition
regarding contact force distributions and conservation properties, but also for
quantifying the efficiency gains as compared to standard beam contact
formulations.
","[{'version': 'v1', 'created': 'Fri, 29 Jul 2016 15:45:42 GMT'}]",2017-03-08,"[['Meier', 'Christoph', ''], ['Wall', 'Wolfgang A.', ''], ['Popp', 'Alexander', '']]","['Beam contact', 'Smooth model transition', 'Thin fibers', 'Finite elements', 'C1-continuous Kirchhoff beams']"
4732,1909.07596,Abhijit Suprem,"Abhijit Suprem, Calton Pu","ASSED -- A Framework for Identifying Physical Events through Adaptive
  Social Sensor Data Filtering",,ACM DEBS 2019,10.1145/3328905.3329510,,cs.SI cs.LG eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Physical event detection has long been the domain of static event processors
operating on numeric sensor data. This works well for large scale strong-signal
events such as hurricanes, and important classes of events such as earthquakes.
However, for a variety of domains there is insufficient sensor coverage, e.g.,
landslides, wildfires, and flooding. Social networks have provided massive
volume of data from billions of users, but data from these generic social
sensors contain much more noise than physical sensors. One of the most
difficult challenges presented by social sensors is \textit{concept drift},
where the terms associated with a phenomenon evolve and change over time,
rendering static machine learning (ML) classifiers less effective. To address
this problem, we develop the ASSED (Adaptive Social Sensor Event Detection)
framework with an ML-based event processing engine and show how it can perform
simple and complex physical event detection on strong- \textit{and} weak-signal
with low-latency, high scalability, and accurate coverage. Specifically, ASSED
is a framework to support continuous filter generation and updates with machine
learning using streaming data from high-confidence sources (physical and
annotated sensors) and social networks. We build ASSED to support procedures
for integrating high-confidence sources into social sensor event detection to
generate high-quality filters and to perform dynamic filter selection by
tracking its own performance. We demonstrate ASSED capabilities through a
landslide detection application that detects almost 350\% more landslides
compared to static approaches. More importantly, ASSED automates the handling
of concept drift: four years after initial data collection and classifier
training, ASSED achieves event detection accuracy of 0.988 (without expert
manual intervention), compared to 0.762 for static approaches.
","[{'version': 'v1', 'created': 'Tue, 17 Sep 2019 05:12:25 GMT'}]",2019-09-18,"[['Suprem', 'Abhijit', ''], ['Pu', 'Calton', '']]","['AI/ML for event processing', 'social sensors', 'event processing in bigand fast data', 'resilience']"
4733,1907.09449,Gwenole Quellec,"Gwenol\'e Quellec, Mathieu Lamard, Pierre-Henri Conze, Pascale Massin,
  B\'eatrice Cochener","Automatic detection of rare pathologies in fundus photographs using
  few-shot learning",,"Medical Image Analysis, Volume 61, April 2020, 101660",10.1016/j.media.2020.101660,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last decades, large datasets of fundus photographs have been collected
in diabetic retinopathy (DR) screening networks. Through deep learning, these
datasets were used to train automatic detectors for DR and a few other frequent
pathologies, with the goal to automate screening. One challenge limits the
adoption of such systems so far: automatic detectors ignore rare conditions
that ophthalmologists currently detect, such as papilledema or anterior
ischemic optic neuropathy. The reason is that standard deep learning requires
too many examples of these conditions. However, this limitation can be
addressed with few-shot learning, a machine learning paradigm where a
classifier has to generalize to a new category not seen in training, given only
a few examples of this category. This paper presents a new few-shot learning
framework that extends convolutional neural networks (CNNs), trained for
frequent conditions, with an unsupervised probabilistic model for rare
condition detection. It is based on the observation that CNNs often perceive
photographs containing the same anomalies as similar, even though these CNNs
were trained to detect unrelated conditions. This observation was based on the
t-SNE visualization tool, which we decided to incorporate in our probabilistic
model. Experiments on a dataset of 164,660 screening examinations from the
OPHDIAT screening network show that 37 conditions, out of 41, can be detected
with an area under the ROC curve (AUC) greater than 0.8 (average AUC: 0.938).
In particular, this framework significantly outperforms other frameworks for
detecting rare conditions, including multitask learning, transfer learning and
Siamese networks, another few-shot learning solution. We expect these richer
predictions to trigger the adoption of automated eye pathology screening, which
will revolutionize clinical practice in ophthalmology.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2019 17:48:27 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Jul 2019 13:00:24 GMT'}, {'version': 'v3', 'created': 'Mon, 10 Feb 2020 17:41:05 GMT'}]",2020-02-11,"[['Quellec', 'Gwenolé', ''], ['Lamard', 'Mathieu', ''], ['Conze', 'Pierre-Henri', ''], ['Massin', 'Pascale', ''], ['Cochener', 'Béatrice', '']]","['diabetic retinopathy screening', 'rare conditions', 'deep learning', 'few-shot learning']"
4734,1705.01879,Simone Silvetti,"Simone Silvetti, Alberto Policriti, Luca Bortolussi","An Active Learning Approach to the Falsification of Black Box
  Cyber-Physical Systems","15 pages, 2 figures",,10.1007/978-3-319-66845-1_1,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Search-based testing is widely used to find bugs in models of complex
Cyber-Physical Systems. Latest research efforts have improved this approach by
casting it as a falsification procedure of formally specified temporal
properties, exploiting the robustness semantics of Signal Temporal Logic. The
scaling of this approach to highly complex engineering systems requires
efficient falsification procedures, which should be applicable also to black
box models. Falsification is also exacerbated by the fact that inputs are often
time-dependent functions. We tackle the falsification of formal properties of
complex black box models of Cyber-Physical Systems, leveraging machine learning
techniques from the area of Active Learning. Tailoring these techniques to the
falsification problem with time-dependent, functional inputs, we show a
considerable gain in computational effort, by reducing the number of model
simulations needed. The goodness of the proposed approach is discussed on a
challenging industrial-level benchmark from automotive.
","[{'version': 'v1', 'created': 'Thu, 4 May 2017 15:18:42 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Aug 2017 09:10:18 GMT'}]",2017-10-03,"[['Silvetti', 'Simone', ''], ['Policriti', 'Alberto', ''], ['Bortolussi', 'Luca', '']]","['Model-based Testing', 'Robustness', 'Gaussian Processes', 'CyberPhysical Systems', 'Falsification']"
4735,1808.02776,Antonela Tommasel,J. Andr\'es D\'iaz-Pace and Antonela Tommasel and Daniela Godoy,"Can Network Analysis Techniques help to Predict Design Dependencies? An
  Initial Study",Accepted at ICSA 2018,,10.1109/ICSA-C.2018.00025,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The degree of dependencies among the modules of a software system is a key
attribute to characterize its design structure and its ability to evolve over
time. Several design problems are often correlated with undesired dependencies
among modules. Being able to anticipate those problems is important for
developers, so they can plan early for maintenance and refactoring efforts.
However, existing tools are limited to detecting undesired dependencies once
they appeared in the system. In this work, we investigate whether module
dependencies can be predicted (before they actually appear). Since the module
structure can be regarded as a network, i.e, a dependency graph, we leverage on
network features to analyze the dynamics of such a structure. In particular, we
apply link prediction techniques for this task. We conducted an evaluation on
two Java projects across several versions, using link prediction and machine
learning techniques, and assessed their performance for identifying new
dependencies from a project version to the next one. The results, although
preliminary, show that the link prediction approach is feasible for package
dependencies. Also, this work opens opportunities for further development of
software-specific strategies for dependency prediction.
","[{'version': 'v1', 'created': 'Wed, 8 Aug 2018 13:35:44 GMT'}]",2018-10-29,"[['Díaz-Pace', 'J. Andrés', ''], ['Tommasel', 'Antonela', ''], ['Godoy', 'Daniela', '']]","['Dependencies', 'Design Problems', 'Link Prediction']"
4736,1812.07793,Matthew Stephenson,"Matthew Stephenson, Jochen Renz, Xiaoyu Ge",The Computational Complexity of Angry Birds,"55 Pages, 39 Figures","Artificial Intelligence (AIJ), Volume 280, March 2020, 103232",10.1016/j.artint.2019.103232,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The physics-based simulation game Angry Birds has been heavily researched by
the AI community over the past five years, and has been the subject of a
popular AI competition that is currently held annually as part of a leading AI
conference. Developing intelligent agents that can play this game effectively
has been an incredibly complex and challenging problem for traditional AI
techniques to solve, even though the game is simple enough that any human
player could learn and master it within a short time. In this paper we analyse
how hard the problem really is, presenting several proofs for the computational
complexity of Angry Birds. By using a combination of several gadgets within
this game's environment, we are able to demonstrate that the decision problem
of solving general levels for different versions of Angry Birds is either
NP-hard, PSPACE-hard, PSPACE-complete or EXPTIME-hard. Proof of NP-hardness is
by reduction from 3-SAT, whilst proof of PSPACE-hardness is by reduction from
True Quantified Boolean Formula (TQBF). Proof of EXPTIME-hardness is by
reduction from G2, a known EXPTIME-complete problem similar to that used for
many previous games such as Chess, Go and Checkers. To the best of our
knowledge, this is the first time that a single-player game has been proven
EXPTIME-hard. This is achieved by using stochastic game engine dynamics to
effectively model the real world, or in our case the physics simulator, as the
opponent against which we are playing. These proofs can also be extended to
other physics-based games with similar mechanics.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2018 07:39:26 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Dec 2019 21:08:47 GMT'}, {'version': 'v3', 'created': 'Wed, 15 Jan 2020 20:21:31 GMT'}]",2020-01-17,"[['Stephenson', 'Matthew', ''], ['Renz', 'Jochen', ''], ['Ge', 'Xiaoyu', '']]","['Computational complexity', 'AI and games', 'Physics simulation games', 'Game playing', 'Angry']"
4737,2102.02654,Maximilian Felde,Maximilian Felde and Gerd Stumme,Triadic Exploration and Exploration with Multiple Experts,"16 pages, 5 figures",,10.1007/978-3-030-77867-5_11,,cs.AI cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Formal Concept Analysis (FCA) provides a method called attribute exploration
which helps a domain expert discover structural dependencies in knowledge
domains that can be represented by a formal context (a cross table of objects
and attributes). Triadic Concept Analysis is an extension of FCA that
incorporates the notion of conditions. Many extensions and variants of
attribute exploration have been studied but only few attempts at incorporating
multiple experts have been made. In this paper we present triadic exploration
based on Triadic Concept Analysis to explore conditional attribute implications
in a triadic domain. We then adapt this approach to formulate attribute
exploration with multiple experts that have different views on a domain.
","[{'version': 'v1', 'created': 'Thu, 4 Feb 2021 14:49:53 GMT'}]",2022-06-02,"[['Felde', 'Maximilian', ''], ['Stumme', 'Gerd', '']]","['Formal Concept Analysis', 'Triadic Concept Analysis', 'Attribute Exploration']"
4738,1409.0669,Karl Rupp,"Karl Rupp and Philippe Tillet and Florian Rudolf and Josef Weinbub and
  Tibor Grasser and Ansgar J\""ungel",Performance Portability Study of Linear Algebra Kernels in OpenCL,"11 pages, 8 figures, 2 tables, International Workshop on OpenCL 2014","Proceedings of the International Workshop on OpenCL 2013 & 2014
  (IWOCL)",10.1145/2664666.2664674,,cs.MS cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The performance portability of OpenCL kernel implementations for common
memory bandwidth limited linear algebra operations across different hardware
generations of the same vendor as well as across vendors is studied. Certain
combinations of kernel implementations and work sizes are found to exhibit good
performance across compute kernels, hardware generations, and, to a lesser
degree, vendors. As a consequence, it is demonstrated that the optimization of
a single kernel is often sufficient to obtain good performance for a large
class of more complicated operations.
","[{'version': 'v1', 'created': 'Tue, 2 Sep 2014 11:21:13 GMT'}]",2022-11-03,"[['Rupp', 'Karl', ''], ['Tillet', 'Philippe', ''], ['Rudolf', 'Florian', ''], ['Weinbub', 'Josef', ''], ['Grasser', 'Tibor', ''], ['Jüngel', 'Ansgar', '']]","['OpenCL', 'Performance', 'Portability', 'Linear Algebra']"
4739,1610.08279,Lucca Hirschi,"St\'ephanie Delaune, Lucca Hirschi","A survey of symbolic methods for establishing equivalence-based
  properties in cryptographic protocols","Accepted for publication in Journal of Logical and Algebraic Methods
  in Programming",,10.1016/j.jlamp.2016.10.005,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cryptographic protocols aim at securing communications over insecure networks
such as the Internet, where dishonest users may listen to communications and
interfere with them. A secure communication has a different meaning depending
on the underlying application. It ranges from the confidentiality of a data to
e.g. verifiability in electronic voting systems. Another example of a security
notion is privacy.
  Formal symbolic models have proved their usefulness for analysing the
security of protocols. Until quite recently, most results focused on trace
properties like confidentiality or authentication. There are however several
security properties, which cannot be defined (or cannot be naturally defined)
as trace properties and require a notion of behavioural equivalence. Typical
examples are anonymity, and privacy related properties. During the last decade,
several results and verification tools have been developed to analyse
equivalence-based security properties.
  We propose here a synthesis of decidability and undecidability results for
equivalence-based security properties. Moreover, we give an overview of
existing verification tools that may be used to verify equivalence-based
security properties.
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2016 10:54:46 GMT'}]",2016-11-10,"[['Delaune', 'Stéphanie', ''], ['Hirschi', 'Lucca', '']]","['cryptographic protocols', 'symbolic models', 'privacy-relatedproperties', 'behavioural equivalence']"
4740,1002.1292,Igor Nor,"Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Engelstadter, Max
  Reuter, Olivier Duron, Marie-France Sagot",Mod/Resc Parsimony Inference,"11 pages, 3 figures",,10.1007/978-3-642-13509-5_19,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address in this paper a new computational biology problem that aims at
understanding a mechanism that could potentially be used to genetically
manipulate natural insect populations infected by inherited, intra-cellular
parasitic bacteria. In this problem, that we denote by \textsc{Mod/Resc
Parsimony Inference}, we are given a boolean matrix and the goal is to find two
other boolean matrices with a minimum number of columns such that an
appropriately defined operation on these matrices gives back the input. We show
that this is formally equivalent to the \textsc{Bipartite Biclique Edge Cover}
problem and derive some complexity results for our problem using this
equivalence. We provide a new, fixed-parameter tractability approach for
solving both that slightly improves upon a previously published algorithm for
the \textsc{Bipartite Biclique Edge Cover}. Finally, we present experimental
results where we applied some of our techniques to a real-life data set.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 18:15:15 GMT'}, {'version': 'v2', 'created': 'Sat, 6 Feb 2010 01:26:05 GMT'}]",2015-05-18,"[['Nor', 'Igor', ''], ['Hermelin', 'Danny', ''], ['Charlat', 'Sylvain', ''], ['Engelstadter', 'Jan', ''], ['Reuter', 'Max', ''], ['Duron', 'Olivier', ''], ['Sagot', 'Marie-France', '']]","['Computational biology', 'biclique edge covering', 'bipartite graph', 'boolean matrix', 'NPcompleteness', 'graph theory', 'fixed-parameter tractability', 'kernelization']"
4741,1312.2506,Daniela Inclezan,Daniela Inclezan,"An Application of Answer Set Programming to the Field of Second Language
  Acquisition","17 pages, 3 tables, to appear in Theory and Practice of Logic
  Programming (TPLP)",Theory and Practice of Logic Programming 15 (2015) 1-17,10.1017/S1471068413000653,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper explores the contributions of Answer Set Programming (ASP) to the
study of an established theory from the field of Second Language Acquisition:
Input Processing. The theory describes default strategies that learners of a
second language use in extracting meaning out of a text, based on their
knowledge of the second language and their background knowledge about the
world. We formalized this theory in ASP, and as a result we were able to
determine opportunities for refining its natural language description, as well
as directions for future theory development. We applied our model to automating
the prediction of how learners of English would interpret sentences containing
the passive voice. We present a system, PIas, that uses these predictions to
assist language instructors in designing teaching materials. To appear in
Theory and Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Mon, 9 Dec 2013 16:37:22 GMT'}]",2020-02-19,"[['Inclezan', 'Daniela', '']]","['answer set programming', 'second language acquisition', 'qualitative scientifictheories', 'natural language']"
4742,1605.05269,Weiguo Zhang,"WeiGuo Zhang, ChunLei Xie, Enes Pasalic","Large Sets of Orthogonal Sequences Suitable for Applications in CDMA
  Systems","24 pages, 4 figures, 5 tables. IEEE Transactions on Information
  Theory,vol.62, no.6, 2016",,10.1109/TIT.2016.2550478,,cs.IT cs.CR math.IT,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this paper, we employ the so-called semi-bent functions to achieve
significant improvements over currently known methods regarding the number of
orthogonal sequences per cell that can be assigned to a regular tessellation of
hexagonal cells, typical for certain code-division multiple-access (CDMA)
systems. Our initial design method generates a large family of orthogonal sets
of sequences derived from vectorial semi-bent functions. A modification of the
original approach is proposed to avoid a hard combinatorial problem of
allocating several such orthogonal sets to a single cell of a regular hexagonal
network, while preserving the orthogonality to adjacent cells. This
modification increases the number of users per cell by starting from shorter
codewords and then extending the length of these codewords to the desired
length. The specification and assignment of these orthogonal sets to a regular
tessellation of hexagonal cells have been solved regardless of the parity and
size of $m$ (where $2^m$ is the length of the codewords). In particular, when
the re-use distance is $D=4$ the number of users per cell is $2^{m-2}$ for
almost all $m$, which is twice as many as can be obtained by the best known
methods.
","[{'version': 'v1', 'created': 'Tue, 17 May 2016 18:09:36 GMT'}]",2016-05-18,"[['Zhang', 'WeiGuo', ''], ['Xie', 'ChunLei', ''], ['Pasalic', 'Enes', '']]","['Boolean functions', 'CDMA systems', 'Hadamard matrix', 'orthogonal sequences', 'semi-bent functions']"
4743,1907.08412,Thomas Olsson,Thomas Olsson and Ulrik Franke,"Risks and Assets: A Qualitative Study of a Software Ecosystem in the
  Mining Industry",,,10.1145/3338906.3340443,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Digitalization and servitization are impacting many domains, including the
mining industry. As the equipment becomes connected and technical
infrastructure evolves, business models and risk management need to adapt. In
this paper, we present a study on how changes in asset and risk distribution
are evolving for the actors in a software ecosystem (SECO) and
system-of-systems (SoS) around a mining operation. We have performed a survey
to understand how Service Level Agreements (SLAs) -- a common mechanism for
managing risk -- are used in other domains. Furthermore, we have performed a
focus group study with companies. There is an overall trend in the mining
industry to move the investment cost (CAPEX) from the mining operator to the
vendors. Hence, the mining operator instead leases the equipment (as
operational expense, OPEX) or even acquires a service. This change in business
model impacts operation, as knowledge is moved from the mining operator to the
suppliers. Furthermore, as the infrastructure becomes more complex, this
implies that the mining operator is more and more reliant on the suppliers for
the operation and maintenance. As this change is still in an early stage, there
is no formalized risk management, e.g. through SLAs, in place. Rather, at
present, the companies in the ecosystem rely more on trust and the incentives
created by the promise of mutual future benefits of innovation activities. We
believe there is a need to better understand how to manage risk in SECO as it
is established and evolves. At the same time, in a SECO, the focus is on
cooperation and innovation, the companies do not have incentives to address
this unless there is an incident. Therefore, industry need, we believe, help in
systematically understanding risk and defining quality aspects such as
reliability and performance in the new business environment.
","[{'version': 'v1', 'created': 'Fri, 19 Jul 2019 08:54:19 GMT'}]",2019-07-22,"[['Olsson', 'Thomas', ''], ['Franke', 'Ulrik', '']]","['Risk Management', 'Service Level Agreement', 'Software ecosystem', 'Survey', 'Case study']"
4744,1802.08441,Sebastian Baltes,"Sebastian Baltes, Jascha Knack, Daniel Anastasiou, Ralf Tymann, and
  Stephan Diehl","(No) Influence of Continuous Integration on the Commit Activity in
  GitHub Projects","7 pages, 3 figures, Proceedings of the 4th ACM SIGSOFT International
  Workshop on Software Analytics (SWAN 2018)",,10.1145/3278142.3278143,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A core goal of Continuous Integration (CI) is to make small incremental
changes to software projects, which are integrated frequently into a mainline
repository or branch. This paper presents an empirical study that investigates
if developers adjust their commit activity towards the above-mentioned goal
after projects start using CI. We analyzed the commit and merge activity in 93
GitHub projects that introduced the hosted CI system Travis CI, but have
previously been developed for at least one year before introducing CI. In our
analysis, we only found one non-negligible effect, an increased merge ratio,
meaning that there were more merging commits in relation to all commits after
the projects started using Travis CI. This effect has also been reported in
related work. However, we observed the same effect in a random sample of 60
GitHub projects not using CI. Thus, it is unlikely that the effect is caused by
the introduction of CI alone. We conclude that: (1) in our sample of projects,
the introduction of CI did not lead to major changes in developers' commit
activity, and (2) it is important to compare the commit activity to a baseline
before attributing an effect to a treatment that may not be the cause for the
observed effect.
","[{'version': 'v1', 'created': 'Fri, 23 Feb 2018 08:39:26 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Jun 2018 10:30:42 GMT'}, {'version': 'v3', 'created': 'Thu, 2 Aug 2018 07:15:11 GMT'}, {'version': 'v4', 'created': 'Fri, 31 Aug 2018 08:38:02 GMT'}, {'version': 'v5', 'created': 'Fri, 14 Sep 2018 07:00:35 GMT'}]",2018-09-17,"[['Baltes', 'Sebastian', ''], ['Knack', 'Jascha', ''], ['Anastasiou', 'Daniel', ''], ['Tymann', 'Ralf', ''], ['Diehl', 'Stephan', '']]","['continuous integration', 'open source software', 'commit activity', 'mining software repositories']"
4745,1705.02928,Yuantao Gu,Xiudong Wang and Yuantao Gu,"Cross-label Suppression: A Discriminative and Fast Dictionary Learning
  with Group Regularization","36 pages, 12 figures, 11 tables",,10.1109/TIP.2017.2703101,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses image classification through learning a compact and
discriminative dictionary efficiently. Given a structured dictionary with each
atom (columns in the dictionary matrix) related to some label, we propose
cross-label suppression constraint to enlarge the difference among
representations for different classes. Meanwhile, we introduce group
regularization to enforce representations to preserve label properties of
original samples, meaning the representations for the same class are encouraged
to be similar. Upon the cross-label suppression, we don't resort to
frequently-used $\ell_0$-norm or $\ell_1$-norm for coding, and obtain
computational efficiency without losing the discriminative power for
categorization. Moreover, two simple classification schemes are also developed
to take full advantage of the learnt dictionary. Extensive experiments on six
data sets including face recognition, object categorization, scene
classification, texture recognition and sport action categorization are
conducted, and the results show that the proposed approach can outperform lots
of recently presented dictionary algorithms on both recognition accuracy and
computational efficiency.
","[{'version': 'v1', 'created': 'Mon, 8 May 2017 15:49:43 GMT'}]",2017-08-02,"[['Wang', 'Xiudong', ''], ['Gu', 'Yuantao', '']]","['Discriminative dictionary learning', 'cross-label suppression', 'group reg']"
4746,1505.01519,Petr Vabishchevich N.,Alexander G. Churbanov and Petr N. Vabishchevich,"Numerical investigation of a space-fractional model of turbulent fluid
  flow in rectangular ducts","19 pages, 17 figures",,10.1016/j.jcp.2016.06.009,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The models that are based of fractional derivatives should be highlighted
among promising new models to describe turbulent fluid flows. In the present
work, a steady-state flow in a duct is considered under the condition that the
turbulent diffusion is governed by a fractional power of the Laplace operator.
To study numerically flows in rectangular channels, finite-difference
approximations are employed. For approximate solving the corresponding boundary
value problem, the iterative method of conjugate gradients is used. At each
iteration, the problem with a fractional power of the grid Laplace operator is
solved. Predictions of turbulent flows in ducts at different Reynolds numbers
are presented via mean velocity fields.
","[{'version': 'v1', 'created': 'Wed, 6 May 2015 21:07:28 GMT'}]",2016-07-20,"[['Churbanov', 'Alexander G.', ''], ['Vabishchevich', 'Petr N.', '']]","['Turbulent flow', 'fluid flow in ducts', 'fractional power of the Laplaceoperator', 'finite-difference problem', 'iterative method of conjugate gradients']"
4747,1309.3944,Anuj Sharma Dr,"Anuj Sharma, Prabin Kumar Panigrahi","A Review of Financial Accounting Fraud Detection based on Data Mining
  Techniques","11 Pages. International Journal of Computer Applications February
  2012",,10.5120/4787-7016,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With an upsurge in financial accounting fraud in the current economic
scenario experienced, financial accounting fraud detection (FAFD) has become an
emerging topic of great importance for academic, research and industries. The
failure of internal auditing system of the organization in identifying the
accounting frauds has lead to use of specialized procedures to detect financial
accounting fraud, collective known as forensic accounting. Data mining
techniques are providing great aid in financial accounting fraud detection,
since dealing with the large data volumes and complexities of financial data
are big challenges for forensic accounting. This paper presents a comprehensive
review of the literature on the application of data mining techniques for the
detection of financial accounting fraud and proposes a framework for data
mining techniques based accounting fraud detection. The systematic and
comprehensive literature review of the data mining techniques applicable to
financial accounting fraud detection may provide a foundation to future
research in this field. The findings of this review show that data mining
techniques like logistic models, neural networks, Bayesian belief network, and
decision trees have been applied most extensively to provide primary solutions
to the problems inherent in the detection and classification of fraudulent
data.
","[{'version': 'v1', 'created': 'Mon, 16 Sep 2013 13:20:10 GMT'}]",2013-09-17,"[['Sharma', 'Anuj', ''], ['Panigrahi', 'Prabin Kumar', '']]","['Financial Accounting Fraud', 'Fraud Detection', 'Data Mining']"
4748,1804.03906,Vassilis Vassiliades,Vassilis Vassiliades and Jean-Baptiste Mouret,Discovering the Elite Hypervolume by Leveraging Interspecies Correlation,In GECCO 2018,,10.1145/3205455.3205602,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evolution has produced an astonishing diversity of species, each filling a
different niche. Algorithms like MAP-Elites mimic this divergent evolutionary
process to find a set of behaviorally diverse but high-performing solutions,
called the elites. Our key insight is that species in nature often share a
surprisingly large part of their genome, in spite of occupying very different
niches; similarly, the elites are likely to be concentrated in a specific
""elite hypervolume"" whose shape is defined by their common features. In this
paper, we first introduce the elite hypervolume concept and propose two metrics
to characterize it: the genotypic spread and the genotypic similarity. We then
introduce a new variation operator, called ""directional variation"", that
exploits interspecies (or inter-elites) correlations to accelerate the
MAP-Elites algorithm. We demonstrate the effectiveness of this operator in
three problems (a toy function, a redundant robotic arm, and a hexapod robot).
","[{'version': 'v1', 'created': 'Wed, 11 Apr 2018 09:53:05 GMT'}]",2018-04-12,"[['Vassiliades', 'Vassilis', ''], ['Mouret', 'Jean-Baptiste', '']]","['illumination algorithms', 'MAP-Elites', 'quality diversity']"
4749,1510.08334,Robert Speck,"Robert Speck, Daniel Ruprecht",Toward fault-tolerant parallel-in-time integration with PFASST,,"Parallel Computing 62, pp. 20 - 37, 2017",10.1016/j.parco.2016.12.001,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce and analyze different strategies for the parallel-in-time
integration method PFASST to recover from hard faults and subsequent data loss.
Since PFASST stores solutions at multiple time steps on different processors,
information from adjacent steps can be used to recover after a processor has
failed. PFASST's multi-level hierarchy allows to use the coarse level for
correcting the reconstructed solution, which can help to minimize overhead. A
theoretical model is devised linking overhead to the number of additional
PFASST iterations required for convergence after a fault. The potential
efficiency of different strategies is assessed in terms of required additional
iterations for examples of diffusive and advective type.
","[{'version': 'v1', 'created': 'Wed, 28 Oct 2015 15:00:42 GMT'}, {'version': 'v2', 'created': 'Tue, 31 May 2016 07:42:12 GMT'}]",2017-03-21,"[['Speck', 'Robert', ''], ['Ruprecht', 'Daniel', '']]","['algorithm-based fault tolerance', 'resilience', 'parallel-in-time integration', 'Gray-Scott model', 'Boussinesqequations']"
4750,1603.09728,Shafi'i Muhammad Abdulhamid Mr,"Shafii Muhammad Abdulhamid, Muhammad Shafie Abd Latiff, Syed Hamid
  Hussain Madni, Osho Oluwafemi",A Survey of League Championship Algorithm: Prospects and Challenges,"10 pages, 2 figures, 2 tables, Indian Journal of Science and
  Technology, 2015",,10.17485/ijst/2015/v8iS3/60476,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The League Championship Algorithm (LCA) is sport-inspired optimization
algorithm that was introduced by Ali Husseinzadeh Kashan in the year 2009. It
has since drawn enormous interest among the researchers because of its
potential efficiency in solving many optimization problems and real-world
applications. The LCA has also shown great potentials in solving
non-deterministic polynomial time (NP-complete) problems. This survey presents
a brief synopsis of the LCA literatures in peer-reviewed journals, conferences
and book chapters. These research articles are then categorized according to
indexing in the major academic databases (Web of Science, Scopus, IEEE Xplore
and the Google Scholar). The analysis was also done to explore the prospects
and the challenges of the algorithm and its acceptability among researchers.
This systematic categorization can be used as a basis for future studies.
","[{'version': 'v1', 'created': 'Sat, 18 Jul 2015 10:09:11 GMT'}]",2016-04-01,"[['Abdulhamid', 'Shafii Muhammad', ''], ['Latiff', 'Muhammad Shafie Abd', ''], ['Madni', 'Syed Hamid Hussain', ''], ['Oluwafemi', 'Osho', '']]","['\xadGlobal\xadOptimization', '\xadLeague\xadChampionship\xadAlgorithm', '\xadNP-Complete\xadProblems', '\xadSport-\xadInspired\xadAlgorithm', '\xadSwarm\xadAlgorithms', '\xadOptimization\xadAlgorithm']"
4751,1111.5593,Willy Picard,Willy Picard,"Agile Professional Virtual Community Inheritance via Adaptation of
  Social Protocols","15 pages, 3 figures","International Journal of Services and Operations Management 2010 -
  Vol. 6, No.3 pp. 362 - 376",10.1504/IJSOM.2010.031959,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Support for human-to-human interactions over a network is still insufficient,
particularly for professional virtual communities (PVC). Among other
limitations, adaptation and learning-by-experience capabilities of humans are
not taken into account in existing models for collaboration processes in PVC.
This paper presents a model for adaptive human collaboration. A key element of
this model is the use of negotiation for adaptation of social protocols
modelling processes. A second contribution is the proposition of various
adaptation propagation strategies as means for continuous management of the PVC
inheritance.
","[{'version': 'v1', 'created': 'Wed, 23 Nov 2011 19:38:55 GMT'}]",2011-11-24,"[['Picard', 'Willy', '']]","['Adaptation', 'social protocols', 'professional virtual community inheritance']"
4752,1810.11406,Saif Jabari,Li Li and Saif Eddin Jabari,Position weighted backpressure intersection control for urban networks,,"Transportation Research Part B: Methodological Volume 128, October
  2019, Pages 435-461",10.1016/j.trb.2019.08.005,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Decentralized intersection control techniques have received attention in the
literature as tools that address scalability issues of network intersection
control. Chief among these techniques are backpressure (BP) control algorithms,
which were originally developed of for large wireless networks. In addition to
being light-weight computationally, they come with guarantees of performance at
the network level, specifically network-wide stability. The dynamics in
backpressure control are represented using networks of point queues and this
also applies to all of the applications to traffic control. As such, BP in
traffic fail to capture the spatial distribution of vehicles along the
intersection links and, consequently, spill-back dynamics. This paper derives a
position weighted backpressure (PWBP) control policy for network traffic
applying continuum modeling principles of traffic dynamics and thus capture the
spatial distribution of vehicles along network roads and spill-back dynamics.
PWBP inherits the computational advantages of traditional BP. To prove
stability of PWBP, (i) a Lyapunov functional that captures the spatial
distribution of vehicles is developed; (ii) the capacity region of the network
is formally defined in the context of macroscopic network traffic; and (iii) it
is proved, when exogenous arrival rates are within the capacity region, that
PWBP control is network stabilizing. We conduct comparisons against a
real-world adaptive control implementation for an isolated intersection.
Comparisons are also performed against other BP approaches in addition to
optimized fixed timing control at the network level. These experiments
demonstrate the superiority of PWBP over the other control policies in terms of
capacity region, network-wide delay, congestion propagation speed,
recoverability from heavy congestion (outside of the capacity region), and
response to incidents.
","[{'version': 'v1', 'created': 'Fri, 26 Oct 2018 16:06:44 GMT'}, {'version': 'v2', 'created': 'Sun, 3 Feb 2019 06:45:02 GMT'}, {'version': 'v3', 'created': 'Tue, 5 Feb 2019 13:50:32 GMT'}, {'version': 'v4', 'created': 'Sat, 22 Jun 2019 14:46:01 GMT'}]",2019-09-02,"[['Li', 'Li', ''], ['Jabari', 'Saif Eddin', '']]","['Decentralized control', 'backpressure', 'max weight', 'stochastic trafficflow', 'urban networks', 'intersection control']"
4753,1405.3235,Chakir Tajani CT,"Chakir Tajani, Jaafar Abouchabaka","An Alternating KMF Algorithm to Solve the Cauchy Problem for Laplaces
  Equation","International Journal of Computer Applications Volume 38 8 January
  2012",,10.5120/4709-6876,,cs.NA math.NA,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This work concerns the use of the iterative algorithm (KMF algorithm)
proposed by Kozlov, Mazya and Fomin to solve the Cauchy problem for Laplaces
equation. This problem consists to recovering the lacking data on some part of
the boundary using the over specified conditions on the other part of the
boundary. We describe an alternating formulation of the KMF algorithm and its
relationship with a classical formulation. The implementation of this algorithm
for a regular domain is performed by the finite element method using the
software Freefem. The numerical tests developed show the effectiveness of the
proposed algorithm since it allows to have more accurate results as well as
reducing the number of iterations needed for convergence.
","[{'version': 'v1', 'created': 'Tue, 13 May 2014 17:19:13 GMT'}]",2014-05-14,"[['Tajani', 'Chakir', ''], ['Abouchabaka', 'Jaafar', '']]","['Cauchy problem', 'inverse problem', 'Laplace equation', 'iterative method', 'FreeFem']"
4754,1003.3310,Secretary Aircc Journal,"Urmila Bhanja (1), Sudipta Mahapatra (1) and Rajarshi Roy (1), ((1)
  Indian Institute of Technology, Kharagpur, India)","A Novel Solution to the Dynamic Routing and Wavelength Assignment
  Problem in Transparent Optical Networks","12 Pages, IJCNC Journal 2010","International Journal of Computer Networks & Communications 2.2
  (2010) 119-130",10.5121/ijcnc.2010.2209,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We present an evolutionary programming algorithm for solving the dynamic
routing and wavelength assignment (DRWA) problem in optical wavelength-division
multiplexing (WDM) networks under wavelength continuity constraint. We assume
an ideal physical channel and therefore neglect the blocking of connection
requests due to the physical impairments. The problem formulation includes
suitable constraints that enable the algorithm to balance the load among the
individuals and thus results in a lower blocking probability and lower mean
execution time than the existing bio-inspired algorithms available in the
literature for the DRWA problems. Three types of wavelength assignment
techniques, such as First fit, Random, and Round Robin wavelength assignment
techniques have been investigated here. The ability to guarantee both low
blocking probability without any wavelength converters and small delay makes
the improved algorithm very attractive for current optical switching networks.
","[{'version': 'v1', 'created': 'Wed, 17 Mar 2010 07:01:20 GMT'}]",2010-07-15,"[['Bhanja', 'Urmila', ''], ['Mahapatra', 'Sudipta', ''], ['Roy', 'Rajarshi', '']]","['Dynamic Routing', 'Evolutionary Programming Algorithm', 'Wavelength Assignment', 'Set Up Time', 'Fitness Function']"
4755,1005.5577,Chengwen  Xing,"Chengwen Xing, Shaodan Ma, Yik-Chung Wu and Tung-Sang Ng","Transceiver Design for Dual-Hop Non-regenerative MIMO-OFDM Relay Systems
  Under Channel Uncertainties","30 pages, 6 figures, IEEE Transactions on Signal Processing, The
  Final Version",,10.1109/TSP.2010.2070797,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, linear transceiver design for dual-hop non-regenerative
(amplify-and-forward (AF)) MIMO-OFDM systems under channel estimation errors is
investigated. Second order moments of channel estimation errors in the two hops
are first deduced. Then based on the Bayesian framework, joint design of linear
forwarding matrix at the relay and equalizer at the destination under channel
estimation errors is proposed to minimize the total mean-square-error (MSE) of
the output signal at the destination. The optimal designs for both correlated
and uncorrelated channel estimation errors are considered. The relationship
with existing algorithms is also disclosed. Moreover, this design is extended
to the joint design involving source precoder design. Simulation results show
that the proposed design outperforms the design based on estimated channel
state information only.
","[{'version': 'v1', 'created': 'Mon, 31 May 2010 03:45:46 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Sep 2012 03:43:54 GMT'}]",2015-05-19,"[['Xing', 'Chengwen', ''], ['Ma', 'Shaodan', ''], ['Wu', 'Yik-Chung', ''], ['Ng', 'Tung-Sang', '']]","['Minimum mean-square-error (MMSE)', 'Amplifyand-forward (AF)', 'forwarding matrix', 'equalizer']"
4756,2105.12504,Revathi Vijayaraghavan,"Ritu Gala, Eshita Shukla, Nidhee Kamble, Revathi Vijayaraghavan,
  Dhiren Patel",Blockchain-Based Approach to Foster Student Engagement on Campus,"13 pages, 6 figures","International Conference of Education (CONEDU 2021) May 22~23,
  2021, Zurich, Switzerland. Volume 11, Number 06, pp 53-65",10.5121/csit.2021.110605,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  On-campus activities like positions of responsibility in campus amenities and
participation in research, benefit the students as well as the university,
while also making students financially self-sufficient to a certain extent.
However, this student participation is stymied by lack of awareness and
motivation. Significant impetus to innovation and student participation can be
provided by incentivization of these activities. In this paper, we propose a
system to create a blockchain-based economy, to incentivize students with
empirical benefits or monetary awards calculated using objective algorithms.
The incentivization algorithms have been designed for three promising use
cases: research work, positions of responsibility in universities, and
crowdfunding. The demonstrated implementation of this system utilises VJTI
Chain, an already established Proof of Authority blockchain in VJTI Mumbai,
India. This creates a circular economy within the university which encourages
students to earn more rewards by reinforcing positive feedback.
","[{'version': 'v1', 'created': 'Wed, 26 May 2021 12:06:07 GMT'}]",2021-05-27,"[['Gala', 'Ritu', ''], ['Shukla', 'Eshita', ''], ['Kamble', 'Nidhee', ''], ['Vijayaraghavan', 'Revathi', ''], ['Patel', 'Dhiren', '']]","['Blockchain', 'Cryptocurrency', 'Incentivization Algorithms', 'Student Engagement']"
4757,1307.3310,Juhi Ameta,"Juhi Ameta, Nisheeth Joshi and Iti Mathur","Improving the quality of Gujarati-Hindi Machine Translation through
  part-of-speech tagging and stemmer-assisted transliteration","6 pages; June 2013,
  url-http://airccse.org/journal/ijnlc/papers/2313ijnlc05.pdf",,10.5121/ijnlc.2013.2305,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine Translation for Indian languages is an emerging research area.
Transliteration is one such module that we design while designing a translation
system. Transliteration means mapping of source language text into the target
language. Simple mapping decreases the efficiency of overall translation
system. We propose the use of stemming and part-of-speech tagging for
transliteration. The effectiveness of translation can be improved if we use
part-of-speech tagging and stemming assisted transliteration.We have shown that
much of the content in Gujarati gets transliterated while being processed for
translation to Hindi language.
","[{'version': 'v1', 'created': 'Fri, 12 Jul 2013 03:05:29 GMT'}]",2013-07-15,"[['Ameta', 'Juhi', ''], ['Joshi', 'Nisheeth', ''], ['Mathur', 'Iti', '']]","['Stemming', 'transliteration', 'part-of-speech tagging']"
4758,1508.00040,Heba Aly,"Heba Aly, Moustafa Youssef",An Analysis of Device-Free and Device-Based WiFi-Localization Systems,"Published in International Journal of Ambient Computing and
  Intelligence (IJACI) - Volume 6 Issue 1, January 2014",,10.4018/ijaci.2014010101,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  WiFi-based localization became one of the main indoor localization techniques
due to the ubiquity of WiFi connectivity. However, indoor environments exhibit
complex wireless propagation characteristics. Typically, these characteristics
are captured by constructing a fingerprint map for the different locations in
the area of interest. This fingerprint requires significant overhead in manual
construction, and thus has been one of the major drawbacks of WiFi-based
localization. In this paper, we present an automated tool for fingerprint
constructions and leverage it to study novel scenarios for device-based and
device-free WiFi-based localization that are difficult to evaluate in a real
environment. In a particular, we examine the effect of changing the access
points (AP) mounting location, AP technology upgrade, crowd effect on
calibration and operation, among others; on the accuracy of the localization
system. We present the analysis for the two classes of WiFi-based localization:
device-based and device-free. Our analysis highlights factors affecting the
localization system accuracy, how to tune it for better localization, and
provides insights for both researchers and practitioners.
","[{'version': 'v1', 'created': 'Fri, 31 Jul 2015 21:42:02 GMT'}]",2015-08-04,"[['Aly', 'Heba', ''], ['Youssef', 'Moustafa', '']]","['Automatic Radio Map Generation', 'Device-based localization', 'Device-free localization', 'RSS analysis', 'Wifi-based Localization']"
4759,1102.0913,Gabriele Fici,Jean-Marc F\'edou and Gabriele Fici,Automata and Differentiable Words,Accepted for publication,Theoretical Computer Science 443:46-62 (2012),10.1016/j.tcs.2012.03.033,,cs.DM cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We exhibit the construction of a deterministic automaton that, given k > 0,
recognizes the (regular) language of k-differentiable words. Our approach
follows a scheme of Crochemore et al. based on minimal forbidden words. We
extend this construction to the case of C\infinity-words, i.e., words
differentiable arbitrary many times. We thus obtain an infinite automaton for
representing the set of C\infinity-words. We derive a classification of
C\infinity-words induced by the structure of the automaton. Then, we introduce
a new framework for dealing with \infinity-words, based on a three letter
alphabet. This allows us to define a compacted version of the automaton, that
we use to prove that every C\infinity-word admits a repetition in C\infinity
whose length is polynomially bounded.
","[{'version': 'v1', 'created': 'Fri, 4 Feb 2011 13:40:35 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Feb 2012 13:41:40 GMT'}, {'version': 'v3', 'created': 'Thu, 5 Apr 2012 09:22:02 GMT'}]",2015-03-18,"[['Fédou', 'Jean-Marc', ''], ['Fici', 'Gabriele', '']]","['Kolakoski word', 'C∞-words', 'forbidden words', 'automata']"
4760,1412.6945,Christoph Martin,Christoph Martin and Peter Niemeyer,"Comparing the sensitivity of social networks, web graphs, and random
  graphs with respect to vertex removal","11 pages, 4 figures","2015 11th international conference on signal-image technology
  internet-based systems (SITIS), 2015, pp. 460-467",10.1109/SITIS.2015.22,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The sensitivity of networks regarding the removal of vertices has been
studied extensively within the last 15 years. A common approach to measure this
sensitivity is (i) removing successively vertices by following a specific
removal strategy and (ii) comparing the original and the modified network using
a specific comparison method. In this paper we apply a wide range of removal
strategies and comparison methods in order to study the sensitivity of
medium-sized networks from real world and randomly generated networks. In the
first part of our study we observe that social networks and web graphs differ
in sensitivity. When removing vertices, social networks are robust, web graphs
are not. This effect is conclusive with the work of Boldi et al. who analyzed
very large networks. For similarly generated random graphs we find that the
sensitivity highly depends on the comparison method. The choice of the removal
strategy has surprisingly marginal impact on the sensitivity as long as we
consider removal strategies implied by common centrality measures. However, it
has a strong effect when removing the vertices in random order.
","[{'version': 'v1', 'created': 'Mon, 22 Dec 2014 12:10:20 GMT'}]",2020-01-09,"[['Martin', 'Christoph', ''], ['Niemeyer', 'Peter', '']]","['robustness analysis', 'network vulnerability', 'centrality measures', 'random graphs', 'stochastic quantifiers']"
4761,1207.6179,Muhammad Anshari Mr,Muhammad Anshari and Mohammad Nabil Almunawar,"Framework of Social Customer Relationship Management in E-Health
  Services","15 pages. arXiv admin note: substantial text overlap with
  arXiv:1204.3689, arXiv:1203.3919, arXiv:1204.3685, arXiv:1203.4309,
  arXiv:1204.3691, arXiv:1203.3923",Journal of e-Health Management Vol. 2012 (2012)Article ID 766268,10.5171/2012.766268,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Healthcare organization is implementing Customer Relationship Management
(CRM) as a strategy for managing interactions with patients involving
technology to organize, automate, and coordinate business processes. Web-based
CRM provides healthcare organization with the ability to broaden service beyond
its usual practices in achieving a complex patient care goal, and this paper
discusses and demonstrates how a new approach in CRM based on Web 2.0 or Social
CRM helps healthcare organizations to improve their customer support, and at
the same time avoiding possible conflicts, and promoting better healthcare to
patients. A conceptual framework of the new approach will be proposed and
highlighted. The framework includes some important features of Social CRM such
as customer's empowerment, social interactivity between healthcare
organization-patients, and patients-patients. The framework offers new
perspective in building relationships between healthcare organizations and
customers and among customers in e-health scenario. It is developed based on
the latest development of CRM literatures and case studies analysis. In
addition, customer service paradigm in social network's era, the important of
online health education, and empowerment in healthcare organization will be
taken into consideration.
","[{'version': 'v1', 'created': 'Thu, 26 Jul 2012 06:43:01 GMT'}]",2012-07-27,"[['Anshari', 'Muhammad', ''], ['Almunawar', 'Mohammad Nabil', '']]","['Social Networks', 'Empowerment', 'Online Health Education', 'Social CRM', 'CRM 2.0']"
4762,1702.01836,Kai Jin,"Kai Jin, Jian Li, Haitao Wang, Bowei Zhang, Ningye Zhang",Linear Time Approximation Schemes for Geometric Maximum Coverage,"28pages; The conference version arXiv:1505.02591 of this paper was
  published in COCOON 2015",,10.1016/j.tcs.2017.11.026,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study approximation algorithms for the following geometric version of the
maximum coverage problem: Let $\mathcal{P}$ be a set of $n$ weighted points in
the plane. Let $D$ represent a planar object, such as a rectangle, or a disk.
We want to place $m$ copies of $D$ such that the sum of the weights of the
points in $\mathcal{P}$ covered by these copies is maximized. For any fixed
$\varepsilon>0$, we present efficient approximation schemes that can find a
$(1-\varepsilon)$-approximation to the optimal solution. In particular, for
$m=1$ and for the special case where $D$ is a rectangle, our algorithm runs in
time $O(n\log (\frac{1}{\varepsilon}))$, improving on the previous result. For
$m>1$ and the rectangular case, our algorithm runs in
$O(\frac{n}{\varepsilon}\log (\frac{1}{\varepsilon})+\frac{m}{\varepsilon}\log
m +m(\frac{1}{\varepsilon})^{O(\min(\sqrt{m},\frac{1}{\varepsilon}))})$ time.
For a more general class of shapes (including disks, polygons with $O(1)$
edges), our algorithm runs in
$O(n(\frac{1}{\varepsilon})^{O(1)}+\frac{m}{\epsilon}\log m +
m(\frac{1}{\varepsilon})^{O(\min(m,\frac{1}{\varepsilon^2}))})$ time.
","[{'version': 'v1', 'created': 'Tue, 7 Feb 2017 01:11:38 GMT'}]",2017-12-08,"[['Jin', 'Kai', ''], ['Li', 'Jian', ''], ['Wang', 'Haitao', ''], ['Zhang', 'Bowei', ''], ['Zhang', 'Ningye', '']]","['Maximum Coverage', 'Geometric Set Cover', 'Polynomial-Time']"
4763,1001.3439,John Whitbeck,"John Whitbeck, Vania Conan, Marcelo Dias de Amorim",Tuning Message Size in Opportunistic Mobile Networks,"2 pages, 2 figures (Short paper accompanying a poster)","In Proceedings: ACM SIGCOMM Workshop on Networking, Systems,
  Applications on Mobile Handhelds (Mobiheld 2009) - Barcelona, Spain - August
  2009",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a new model for studying intermittently connected mobile
networks, based on Markovian random temporal graphs, that captures the
influence of message size, maximum tolerated delay and link stability on the
delivery ratio.
","[{'version': 'v1', 'created': 'Wed, 20 Jan 2010 01:19:56 GMT'}]",2010-01-21,"[['Whitbeck', 'John', ''], ['Conan', 'Vania', ''], ['de Amorim', 'Marcelo Dias', '']]","['Delay Tolerant Networks', 'Random Temporal Graphs', 'Message Size', 'Delivery Ratio']"
4764,1004.4718,Woong-Kee Loh,"Woong-Kee Loh, Yang-Sae Moon, and Jun-Gyu Kang",A Data Cleansing Method for Clustering Large-scale Transaction Databases,"6 pages, 5 figures",,10.1587/transinf.E93.D.3120,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we emphasize the need for data cleansing when clustering
large-scale transaction databases and propose a new data cleansing method that
improves clustering quality and performance. We evaluate our data cleansing
method through a series of experiments. As a result, the clustering quality and
performance were significantly improved by up to 165% and 330%, respectively.
","[{'version': 'v1', 'created': 'Tue, 27 Apr 2010 05:56:24 GMT'}]",2015-05-18,"[['Loh', 'Woong-Kee', ''], ['Moon', 'Yang-Sae', ''], ['Kang', 'Jun-Gyu', '']]","['clustering', 'data cleansing', 'large-scale transaction databases']"
4765,1403.2950,Saleema J S,"J S Saleema, N Bhagawathi, S Monica, P Deepa Shenoy, K R Venugopal and
  L M Patnaik",Cancer Prognosis Prediction Using Balanced Stratified Sampling,,"International Journal on Soft Computing, Artificial Intelligence
  and Applications (IJSCAI), Vol.3, No. 1, February 2014, pp 9-18",10.5121/ijscai.2014.3102,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  High accuracy in cancer prediction is important to improve the quality of the
treatment and to improve the rate of survivability of patients. As the data
volume is increasing rapidly in the healthcare research, the analytical
challenge exists in double. The use of effective sampling technique in
classification algorithms always yields good prediction accuracy. The SEER
public use cancer database provides various prominent class labels for
prognosis prediction. The main objective of this paper is to find the effect of
sampling techniques in classifying the prognosis variable and propose an ideal
sampling method based on the outcome of the experimentation. In the first phase
of this work the traditional random sampling and stratified sampling techniques
have been used. At the next level the balanced stratified sampling with
variations as per the choice of the prognosis class labels have been tested.
Much of the initial time has been focused on performing the pre_processing of
the SEER data set. The classification model for experimentation has been built
using the breast cancer, respiratory cancer and mixed cancer data sets with
three traditional classifiers namely Decision Tree, Naive Bayes and K-Nearest
Neighbor. The three prognosis factors survival, stage and metastasis have been
used as class labels for experimental comparisons. The results shows a steady
increase in the prediction accuracy of balanced stratified model as the sample
size increases, but the traditional approach fluctuates before the optimum
results.
","[{'version': 'v1', 'created': 'Wed, 12 Mar 2014 14:33:43 GMT'}]",2014-03-13,"[['Saleema', 'J S', ''], ['Bhagawathi', 'N', ''], ['Monica', 'S', ''], ['Shenoy', 'P Deepa', ''], ['Venugopal', 'K R', ''], ['Patnaik', 'L M', '']]","['Cancer', 'Classification', 'Pre-processing', 'Sampling']"
4766,1912.02258,Raj Dasgupta,Prithviraj Dasgupta and Joseph B. Collins,"A Survey of Game Theoretic Approaches for Adversarial Machine Learning
  in Cybersecurity Tasks","13 pages, 2 figures, 1 table","AI Magazine, 40(2), 31-43 (2019)",10.1609/aimag.v40i2.2847,,cs.CR cs.AI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning techniques are currently used extensively for automating
various cybersecurity tasks. Most of these techniques utilize supervised
learning algorithms that rely on training the algorithm to classify incoming
data into different categories, using data encountered in the relevant domain.
A critical vulnerability of these algorithms is that they are susceptible to
adversarial attacks where a malicious entity called an adversary deliberately
alters the training data to misguide the learning algorithm into making
classification errors. Adversarial attacks could render the learning algorithm
unsuitable to use and leave critical systems vulnerable to cybersecurity
attacks. Our paper provides a detailed survey of the state-of-the-art
techniques that are used to make a machine learning algorithm robust against
adversarial attacks using the computational framework of game theory. We also
discuss open problems and challenges and possible directions for further
research that would make deep machine learning-based systems more robust and
reliable for cybersecurity tasks.
","[{'version': 'v1', 'created': 'Wed, 4 Dec 2019 21:42:15 GMT'}]",2019-12-06,"[['Dasgupta', 'Prithviraj', ''], ['Collins', 'Joseph B.', '']]","['Machine learning', 'adversarial learning', 'game theory']"
4767,1705.02863,Maximilian Jaroschek,"Andreas Humenberger, Maximilian Jaroschek, Laura Kov\'acs","Automated Generation of Non-Linear Loop Invariants Utilizing
  Hypergeometric Sequences","A revised version of this paper is published in the proceedings of
  ISSAC 2017",,10.1145/3087604.3087623,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Analyzing and reasoning about safety properties of software systems becomes
an especially challenging task for programs with complex flow and, in
particular, with loops or recursion. For such programs one needs additional
information, for example in the form of loop invariants, expressing properties
to hold at intermediate program points. In this paper we study program loops
with non-trivial arithmetic, implementing addition and multiplication among
numeric program variables. We present a new approach for automatically
generating all polynomial invariants of a class of such programs. Our approach
turns programs into linear ordinary recurrence equations and computes closed
form solutions of these equations. These closed forms express the most precise
inductive property, and hence invariant. We apply Gr\""obner basis computation
to obtain a basis of the polynomial invariant ideal, yielding thus a finite
representation of all polynomial invariants. Our work significantly extends the
class of so-called P-solvable loops by handling multiplication with the loop
counter variable. We implemented our method in the Mathematica package Aligator
and showcase the practical use of our approach.
","[{'version': 'v1', 'created': 'Mon, 8 May 2017 13:34:18 GMT'}, {'version': 'v2', 'created': 'Thu, 11 May 2017 09:39:57 GMT'}]",2017-05-12,"[['Humenberger', 'Andreas', ''], ['Jaroschek', 'Maximilian', ''], ['Kovács', 'Laura', '']]","['program analysis', 'loop invariants', 'recurrence relations', 'hypergeometric sequences']"
4768,1402.0729,Nikolaos Pappas,"Nikolaos Pappas, Anthony Ephremides, Apostolos Traganitis","Stability and Performance Issues of a Relay Assisted Multiple Access
  Scheme with MPR Capabilities","Accepted for publication in Elsevier Computer Communications. arXiv
  admin note: substantial text overlap with arXiv:1105.0452",,10.1016/j.comcom.2014.01.004,,cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we study the impact of a relay node to a network with a finite
number of users-sources and a destination node. We assume that the users have
saturated queues and the relay node does not have packets of its own; we have
random access of the medium and the time is slotted. The relay node stores a
source packet that it receives successfully in its queue when the transmission
to the destination node has failed. The relay and the destination nodes have
multi-packet reception capabilities. We obtain analytical equations for the
characteristics of the relay's queue such as average queue length, stability
conditions etc. We also study the throughput per user and the aggregate
throughput for the network.
","[{'version': 'v1', 'created': 'Tue, 4 Feb 2014 13:31:44 GMT'}]",2014-02-05,"[['Pappas', 'Nikolaos', ''], ['Ephremides', 'Anthony', ''], ['Traganitis', 'Apostolos', '']]","['Relay', 'MPR', 'Multiple Access', 'Stability']"
4769,1509.05117,Jing Yuan,"Jing Yuan, Lixiang Li, Haipeng Peng, J\""urgen Kurths, Xiaojing Hua and
  Yixian Yang","The effect of randomness for dependency map on the robustness of
  interdependent lattices",,,10.1063/1.4939984,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For interdependent networks with identity dependency map, percolation is
exactly the same with that on a single network and follows a second-order phase
transition, while for random dependency, percolation follows a first-order
phase transition. In real networks, the dependency relations between networks
are neither identical nor completely random. Thus in this paper, we study the
influence of randomness for dependency maps on the robustness of interdependent
lattice networks. We introduce approximate entropy($ApEn$) as the measure of
randomness of the dependency maps. We find that there is critical $ApEn_c$
below which the percolation is continuous, but for larger $ApEn$, it is a
first-order transition. With the increment of $ApEn$, the $p_c$ increases until
$ApEn$ reaching ${ApEn}_c'$ and then remains almost constant. The time scale of
the system shows rich properties as $ApEn$ increases. Our results uncover that
randomness is one of the important factors that lead to cascading failures of
spatially interdependent networks.
","[{'version': 'v1', 'created': 'Thu, 17 Sep 2015 03:57:45 GMT'}]",2016-02-17,"[['Yuan', 'Jing', ''], ['Li', 'Lixiang', ''], ['Peng', 'Haipeng', ''], ['Kurths', 'Jürgen', ''], ['Hua', 'Xiaojing', ''], ['Yang', 'Yixian', '']]","['interdependent lattices', 'randomness', 'dependency map']"
4770,1406.6597,Vincent Labatut,"G\""unce Keziban Orman, Vincent Labatut, Marc Plantevit (LIRIS),
  Jean-Fran\c{c}ois Boulicaut (LIRIS)","A Method for Characterizing Communities in Dynamic Attributed Complex
  Networks","IEEE/ACM International Conference on Advances in Social Network
  Analysis and Mining (ASONAM), P\'ekin : China (2014)",,10.1109/ASONAM.2014.6921629,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many methods have been proposed to detect communities, not only in plain, but
also in attributed, directed or even dynamic complex networks. In its simplest
form, a community structure takes the form of a partition of the node set. From
the modeling point of view, to be of some utility, this partition must then be
characterized relatively to the properties of the studied system. However, if
most of the existing works focus on defining methods for the detection of
communities, only very few try to tackle this interpretation problem. Moreover,
the existing approaches are limited either in the type of data they handle, or
by the nature of the results they output. In this work, we propose a method to
efficiently support such a characterization task. We first define a
sequence-based representation of networks, combining temporal information,
topological measures, and nodal attributes. We then describe how to identify
the most emerging sequential patterns of this dataset, and use them to
characterize the communities. We also show how to detect unusual behavior in a
community, and highlight outliers. Finally, as an illustration, we apply our
method to a network of scientific collaborations.
","[{'version': 'v1', 'created': 'Wed, 25 Jun 2014 14:54:52 GMT'}]",2014-10-22,"[['Orman', 'Günce Keziban', '', 'LIRIS'], ['Labatut', 'Vincent', '', 'LIRIS'], ['Plantevit', 'Marc', '', 'LIRIS'], ['Boulicaut', 'Jean-François', '', 'LIRIS']]","['Dynamic Networks', 'Nodal Attributes', 'Community Detection', 'Community Interpretation', 'Topological Measures', 'Emerging Sequence Mining']"
4771,1606.04033,Elaine Sedenberg,"Elaine Sedenberg, John Chuang, Deirdre Mulligan","Designing Commercial Therapeutic Robots for Privacy Preserving Systems
  and Ethical Research Practices within the Home","International Journal of Social Robotics, (2016), 1-13",,10.1007/s12369-016-0362-y,,cs.HC cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The migration of robots from the laboratory into sensitive home settings as
commercially available therapeutic agents represents a significant transition
for information privacy and ethical imperatives. We present new privacy
paradigms and apply the Fair Information Practices (FIPs) to investigate
concerns unique to the placement of therapeutic robots in private home
contexts. We then explore the importance and utility of research ethics as
operationalized by existing human subjects research frameworks to guide the
consideration of therapeutic robotic users -- a step vital to the continued
research and development of these platforms. Together, privacy and research
ethics frameworks provide two complementary approaches to protect users and
ensure responsible yet robust information sharing for technology development.
We make recommendations for the implementation of these principles -- paying
particular attention to specific principles that apply to vulnerable
individuals (i.e., children, disabled, or elderly persons)--to promote the
adoption and continued improvement of long-term, responsible, and
research-enabled robotics in private settings.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2016 16:56:21 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jun 2016 06:03:46 GMT'}]",2016-06-30,"[['Sedenberg', 'Elaine', ''], ['Chuang', 'John', ''], ['Mulligan', 'Deirdre', '']]","['Therapeutic robots', 'HRI', 'embedded sensors', 'privacy by design', 'research ethics', 'responsible information sharing']"
4772,1202.5677,Saptarshi Das,"Saptarshi Das, Suman Saha, Shantanu Das, Amitava Gupta","On the Selection of Tuning Methodology of FOPID Controllers for the
  Control of Higher Order Processes","27 pages, 10 figures","ISA Transactions, vol. 5, no. 3, pp. 376-388, July 2011",10.1016/j.isatra.2011.02.003,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a comparative study is done on the time and frequency domain
tuning strategies for fractional order (FO) PID controllers to handle higher
order processes. A new fractional order template for reduced parameter modeling
of stable minimum/non-minimum phase higher order processes is introduced and
its advantage in frequency domain tuning of FOPID controllers is also
presented. The time domain optimal tuning of FOPID controllers have also been
carried out to handle these higher order processes by performing optimization
with various integral performance indices. The paper highlights on the
practical control system implementation issues like flexibility of online
autotuning, reduced control signal and actuator size, capability of measurement
noise filtration, load disturbance suppression, robustness against parameter
uncertainties etc. in light of the above tuning methodologies.
","[{'version': 'v1', 'created': 'Sat, 25 Feb 2012 17:52:50 GMT'}]",2012-02-28,"[['Das', 'Saptarshi', ''], ['Saha', 'Suman', ''], ['Das', 'Shantanu', ''], ['Gupta', 'Amitava', '']]","['Fractional order controller', 'FOPID tuning', 'integral performance indices', 'NIOPTD', 'optimal time domain tuning', 'robust frequency domain tuning.  1']"
4773,1005.5028,Secretary Aircc Journal,"Rajesh P Singh, Anupam Saikia, B. K. Sarma (Indian Institute of
  Technology, Guwahati, India)",Little Dragon Two: An efficient Multivariate Public Key Cryptosystem,"10 Pages, IJNSA","International Journal of Network Security & Its Applications 2.2
  (2010) 1-10",10.5121/ijnsa.2010.2201,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In 1998 [8], Patarin proposed an efficient cryptosystem called Little Dragon
which was a variant a variant of Matsumoto Imai cryptosystem C*. However
Patarin latter found that Little Dragon cryptosystem is not secure [8], [3]. In
this paper we propose a cryptosystem Little Dragon Two which is as efficient as
Little Dragon cryptosystem but secure against all the known attacks. Like
Little Dragon cryptosystem the public key of Little Dragon Two is mixed type
that is quadratic in plaintext and cipher text variables. So the public key
size of Little Dragon Two is equal to Little Dragon Cryptosystem. Our public
key algorithm is bijective and can be used for both encryption and signatures.
","[{'version': 'v1', 'created': 'Thu, 27 May 2010 10:58:49 GMT'}]",2010-07-15,"[['Singh', 'Rajesh P', '', 'Indian Institute of\n  Technology, Guwahati, India'], ['Saikia', 'Anupam', '', 'Indian Institute of\n  Technology, Guwahati, India'], ['Sarma', 'B. K.', '', 'Indian Institute of\n  Technology, Guwahati, India']]","['Public key Cryptography', 'Multivariate Cryptography', 'Little Dragon Cryptosystem', 'Big-Dragon Cryptosystem']"
4774,1412.3625,Mostafa Zaman Chowdhury,Mostafa Zaman Chowdhury and Yeong Min Jang,"Class-Based Service Connectivity using Multi-Level Bandwidth Adaptation
  in Multimedia Wireless Networks",Journal paper,"Wireless Personal Communications, vol. 77, no 4, pp. 2735-2745,
  August 2014",10.1007/s11277-014-1665-7,,cs.NI cs.MM cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the fact that quality of service requirements are not very strict for
all traffic types, more calls of higher priority can be accommodated by
reducing some bandwidth allocation for the bandwidth adaptive calls. The
bandwidth adaptation to accept a higher priority call is more than that of a
lower priority call. Therefore, the multi-level bandwidth adaptation technique
improves the overall forced call termination probability as well as provides
priority of the traffic classes in terms of call blocking probability without
reducing the bandwidth utilization. We propose a novel bandwidth adaptation
model that releases multi-level of bandwidth from the existing multimedia
traffic calls. The amount of released bandwidth is decided based on the
priority of the requesting traffic calls and the number of existing bandwidth
adaptive calls. This prioritization of traffic classes does not reduce the
bandwidth utilization. Moreover, our scheme reduces the overall forced call
termination probability significantly. The proposed scheme is modeled using the
Markov Chain. The numerical results show that the proposed scheme is able to
provide negligible handover call dropping probability as well as significantly
reduced new call blocking probability of higher priority calls without
increasing the overall forced call termination probability.
","[{'version': 'v1', 'created': 'Thu, 11 Dec 2014 12:15:51 GMT'}]",2014-12-12,"[['Chowdhury', 'Mostafa Zaman', ''], ['Jang', 'Yeong Min', '']]","['Multi-level bandwidth adaptation', 'priority', 'traffic class', 'QoS', 'call blocking probability']"
4775,1407.8251,Hani Abdeen Dr.,Hani Abdeen and Osama Shata,Type Variability and Completeness of Interfaces in Java Applications,,"International Journal of Software Engineering & Applications
  (IJSEA), Vol.5, No.3, May 2014",10.5121/ijsea.2014.5301,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Interfaces are widely used as central design elements of Java applications.
Although interfaces are abstract types similar to abstract classes, the usage
of interfaces in Java applications may considerably differ from the usage of
abstract classes. Unlike abstract classes, interfaces are meant to enable
multiple inheritance in Java programs. Hence, interfaces are meant to encode
shared similarities between classes belonging to different class-type
hierarchies. Therefore, it is frequent to use interfaces as partial types,
where an interface specifies one specific aspect or usage of its implementing
classes. In this paper, we investigate interfaces' usage in Java applications
from two perspectives. First, we investigate the usage of interfaces as types
of classes belonging to different class-type hierarchies (i.e., interface's
type variability). Second, we investigate the usage of interfaces as partial
types of implementing classes (i.e., interface's type completeness).
","[{'version': 'v1', 'created': 'Thu, 31 Jul 2014 01:08:44 GMT'}]",2014-08-01,"[['Abdeen', 'Hani', ''], ['Shata', 'Osama', '']]","['Interfaces Design', 'Java Applications', 'Metrics']"
4776,1405.4041,Ethan Jackson,Ethan K. Jackson,A Module System for Domain-Specific Languages,"Appearing in International Conference on Logic Programming (ICLP)
  2014",Theory and Practice of Logic Programming 14 (2014) 771-785,10.1017/S1471068414000337,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Domain-specific languages (DSLs) are routinely created to simplify difficult
or specialized programming tasks. They expose useful abstractions and design
patterns in the form of language constructs, provide static semantics to
eagerly detect misuse of these constructs, and dynamic semantics to completely
define how language constructs interact. However, implementing and composing
DSLs is a non-trivial task, and there is a lack of tools and techniques.
  We address this problem by presenting a complete module system over LP for
DSL construction, reuse, and composition. LP is already useful for DSL design,
because it supports executable language specifications using notations familiar
to language designers. We extend LP with a module system that is simple (with a
few concepts), succinct (for key DSL specification scenarios), and composable
(on the level of languages, compilers, and programs). These design choices
reflect our use of LP for industrial DSL design. Our module system has been
implemented in the FORMULA language, and was used to build key Windows 8 device
drivers via DSLs. Though we present our module system as it actually appears in
our FORMULA language, our emphasis is on concepts adaptable to other LP
languages.
","[{'version': 'v1', 'created': 'Fri, 16 May 2014 00:47:10 GMT'}]",2020-02-19,"[['Jackson', 'Ethan K.', '']]","['module systems', 'domain-specific languages', 'logic programming']"
4777,cs/0703121,Bruno Salvy,"Alin Bostan (INRIA Rocquencourt), Fr\'ed\'eric Chyzak (INRIA
  Rocquencourt), Bruno Salvy (INRIA Rocquencourt), Gr\'egoire Lecerf
  (LM-Versailles), \'Eric Schost",Differential Equations for Algebraic Functions,,"ISSAC'07, pages 25--32, ACM Press, 2007.",10.1145/1277548.1277553,,cs.SC math.CA,,"  It is classical that univariate algebraic functions satisfy linear
differential equations with polynomial coefficients. Linear recurrences follow
for the coefficients of their power series expansions. We show that the linear
differential equation of minimal order has coefficients whose degree is cubic
in the degree of the function. We also show that there exists a linear
differential equation of order linear in the degree whose coefficients are only
of quadratic degree. Furthermore, we prove the existence of recurrences of
order and degree close to optimal. We study the complexity of computing these
differential equations and recurrences. We deduce a fast algorithm for the
expansion of algebraic series.
","[{'version': 'v1', 'created': 'Fri, 23 Mar 2007 19:20:35 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Sep 2007 13:44:07 GMT'}]",2008-04-03,"[['Bostan', 'Alin', '', 'INRIA Rocquencourt'], ['Chyzak', 'Frédéric', '', 'INRIA\n  Rocquencourt'], ['Salvy', 'Bruno', '', 'INRIA Rocquencourt'], ['Lecerf', 'Grégoire', '', 'LM-Versailles'], ['Schost', 'Éric', '']]","['Computer algebra', 'algebraic series', 'differentialresolvents', 'creative telescoping', 'complexity']"
4778,1706.03441,Vinodkumar Prabhakaran,"Vinodkumar Prabhakaran, Owen Rambow","Dialog Structure Through the Lens of Gender, Gender Environment, and
  Power",,Journal for Dialogue & Discourse 8(2) (2017) 21-55,10.5087/dad.2017.202,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Understanding how the social context of an interaction affects our dialog
behavior is of great interest to social scientists who study human behavior, as
well as to computer scientists who build automatic methods to infer those
social contexts. In this paper, we study the interaction of power, gender, and
dialog behavior in organizational interactions. In order to perform this study,
we first construct the Gender Identified Enron Corpus of emails, in which we
semi-automatically assign the gender of around 23,000 individuals who authored
around 97,000 email messages in the Enron corpus. This corpus, which is made
freely available, is orders of magnitude larger than previously existing gender
identified corpora in the email domain. Next, we use this corpus to perform a
large-scale data-oriented study of the interplay of gender and manifestations
of power. We argue that, in addition to one's own gender, the ""gender
environment"" of an interaction, i.e., the gender makeup of one's interlocutors,
also affects the way power is manifested in dialog. We focus especially on
manifestations of power in the dialog structure --- both, in a shallow sense
that disregards the textual content of messages (e.g., how often do the
participants contribute, how often do they get replies etc.), as well as the
structure that is expressed within the textual content (e.g., who issues
requests and how are they made, whose requests get responses etc.). We find
that both gender and gender environment affect the ways power is manifested in
dialog, resulting in patterns that reveal the underlying factors. Finally, we
show the utility of gender information in the problem of automatically
predicting the direction of power between pairs of participants in email
interactions.
","[{'version': 'v1', 'created': 'Mon, 12 Jun 2017 02:24:33 GMT'}]",2017-06-13,"[['Prabhakaran', 'Vinodkumar', ''], ['Rambow', 'Owen', '']]","['computational sociolinguistics', 'gender', 'power', 'dialog']"
4779,1405.6230,Ingo Wolf,"Ingo Wolf, Tobias Schroeder, Jochen Neumann, Gerhard de Haan","Changing minds about electric cars: An empirically grounded agent-based
  modeling approach",,,10.1016/j.techfore.2014.10.010,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The diffusion of electric vehicles (EVs) is considered an effective policy
strategy to meet greenhouse gas reduction targets. For large-scale adoption,
however, demand-side oriented policy measures are required, based on consumers
transport needs, values and social norms. We introduce an empirically grounded,
spatially explicit, agent-based model, InnoMind Innovation diffusion driven by
changing Minds), to simulate the effects of policy interventions and social
influence on consumers transport mode preferences. The agents in this model
represent individual consumers. They are calibrated based on empirically
derived attributes and characteristics of survey respondents. We model agent
decision-making with artificial neural networks that account for the role of
emotions in information processing. We present simulations of 4 scenarios for
the diffusion of EVs in the city of Berlin, Germany (3 policy scenarios and 1
base case). The results illustrate the varying effectiveness of measures in
different market segments and the need for appropriate policies tailored to the
heterogeneous needs of different travelers. Moreover, the simulations suggest
that introducing an exclusive zone for EVs in the city would accelerate the
early-phase diffusion of EVs more effectively than financial incentives only.
","[{'version': 'v1', 'created': 'Fri, 23 May 2014 21:00:47 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Aug 2014 10:56:33 GMT'}]",2015-01-15,"[['Wolf', 'Ingo', ''], ['Schroeder', 'Tobias', ''], ['Neumann', 'Jochen', ''], ['de Haan', 'Gerhard', '']]","['electric vehicles', 'innovation diffusion', 'emotion', 'agent-based model', 'parallel']"
4780,2204.00792,Zhenhuan Liu,"Zhenhuan Liu, Jincan Deng, Liang Li, Shaofei Cai, Qianqian Xu, Shuhui
  Wang, Qingming Huang","IR-GAN: Image Manipulation with Linguistic Instruction by Increment
  Reasoning",,"Proceedings of the 28th ACM International Conference on
  Multimedia,2020",10.1145/3394171.3413777,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Conditional image generation is an active research topic including text2image
and image translation.
  Recently image manipulation with linguistic instruction brings new challenges
of multimodal conditional generation.
  However, traditional conditional image generation models mainly focus on
generating high-quality and visually realistic images, and lack resolving the
partial consistency between image and instruction.
  To address this issue, we propose an Increment Reasoning Generative
Adversarial Network (IR-GAN), which aims to reason the consistency between
visual increment in images and semantic increment in instructions.
  First, we introduce the word-level and instruction-level instruction encoders
to learn user's intention from history-correlated instructions as semantic
increment.
  Second, we embed the representation of semantic increment into that of source
image for generating target image, where source image plays the role of
referring auxiliary.
  Finally, we propose a reasoning discriminator to measure the consistency
between visual increment and semantic increment, which purifies user's
intention and guarantees the good logic of generated target image.
  Extensive experiments and visualization conducted on two datasets show the
effectiveness of IR-GAN.
","[{'version': 'v1', 'created': 'Sat, 2 Apr 2022 07:48:39 GMT'}]",2022-04-05,"[['Liu', 'Zhenhuan', ''], ['Deng', 'Jincan', ''], ['Li', 'Liang', ''], ['Cai', 'Shaofei', ''], ['Xu', 'Qianqian', ''], ['Wang', 'Shuhui', ''], ['Huang', 'Qingming', '']]","['Image Manipulation with Linguistic Instruction', 'adversarial networks', 'increment reasoning']"
4781,1603.05154,Faisal Mahmood,"Faisal Mahmood, M\""art Toots, Lars-G\""oran \""Ofverstedt and Ulf
  Skoglund","2D Discrete Fourier Transform with Simultaneous Edge Artifact Removal
  for Real-Time Applications","IEEE 2015 International Conference on Field Programmable Technology
  (FPT), Queenstown, New Zealand",,10.1109/FPT.2015.7393157,,cs.CV cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two-Dimensional (2D) Discrete Fourier Transform (DFT) is a basic and
computationally intensive algorithm, with a vast variety of applications. 2D
images are, in general, non-periodic, but are assumed to be periodic while
calculating their DFTs. This leads to cross-shaped artifacts in the frequency
domain due to spectral leakage. These artifacts can have critical consequences
if the DFTs are being used for further processing. In this paper we present a
novel FPGA-based design to calculate high-throughput 2D DFTs with simultaneous
edge artifact removal. Standard approaches for removing these artifacts using
apodization functions or mirroring, either involve removing critical
frequencies or a surge in computation by increasing image size. We use a
periodic-plus-smooth decomposition based artifact removal algorithm optimized
for FPGA implementation, while still achieving real-time ($\ge$23 frames per
second) performance for a 512$\times$512 size image stream. Our optimization
approach leads to a significant decrease in external memory utilization thereby
avoiding memory conflicts and simplifies the design. We have tested our design
on a PXIe based Xilinx Kintex 7 FPGA system communicating with a host PC which
gives us the advantage to further expand the design for industrial
applications.
","[{'version': 'v1', 'created': 'Wed, 16 Mar 2016 15:52:13 GMT'}]",2016-03-17,"[['Mahmood', 'Faisal', ''], ['Toots', 'Märt', ''], ['Öfverstedt', 'Lars-Göran', ''], ['Skoglund', 'Ulf', '']]","['2D FFT', 'Discrete Fourier Transform', 'Fast FourierTransform', 'Edge Artifact Removal', 'FPGA', 'High-level synthesis', 'Boundary Effect']"
4782,1309.1921,GopalaKrishna Palem,Gopalakrishna Palem,Condition-Based Maintenance using Sensor Arrays and Telematics,,"International Journal of Mobile Network Communications &
  Telematics. 06 (2013) 3(3):19-28",10.5121/ijmnct.2013.3303,,cs.OH physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Emergence of uniquely addressable embeddable devices has raised the bar on
Telematics capabilities. Though the technology itself is not new, its
application has been quite limited until now. Sensor based telematics
technologies generate volumes of data that are orders of magnitude larger than
what operators have dealt with previously. Real-time big data computation
capabilities have opened the flood gates for creating new predictive analytics
capabilities into an otherwise simple data log systems, enabling real-time
control and monitoring to take preventive action in case of any anomalies.
Condition-based-maintenance, usage-based-insurance, smart metering and
demand-based load generation etc. are some of the predictive analytics use
cases for Telematics. This paper presents the approach of condition-based
maintenance using real-time sensor monitoring, Telematics and predictive data
analytics.
","[{'version': 'v1', 'created': 'Sun, 8 Sep 2013 02:10:33 GMT'}]",2013-09-10,"[['Palem', 'Gopalakrishna', '']]","['Telematics', 'Preventive Maintenance', 'Predictive Maintenance', 'Sensor arrays']"
4783,1903.07703,Mark Scanlon,"Asanka Sayakkara, Nhien-An Le-Khac and Mark Scanlon","A Survey of Electromagnetic Side-Channel Attacks and Discussion on their
  Case-Progressing Potential for Digital Forensics",Digital Investigation (2019),,10.1016/j.diin.2019.03.002,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing prevalence of Internet of Things (IoT) devices has made it
inevitable that their pertinence to digital forensic investigations will
increase into the foreseeable future. These devices produced by various vendors
often posses limited standard interfaces for communication, such as USB ports
or WiFi/Bluetooth wireless interfaces. Meanwhile, with an increasing mainstream
focus on the security and privacy of user data, built-in encryption is becoming
commonplace in consumer-level computing devices, and IoT devices are no
exception. Under these circumstances, a significant challenge is presented to
digital forensic investigations where data from IoT devices needs to be
analysed. This work explores the electromagnetic (EM) side-channel analysis
literature for the purpose of assisting digital forensic investigations on IoT
devices. EM side-channel analysis is a technique where unintentional
electromagnetic emissions are used for eavesdropping on the operations and data
handling of computing devices. The non-intrusive nature of EM side-channel
approaches makes it a viable option to assist digital forensic investigations
as these attacks require, and must result in, no modification to the target
device. The literature on various EM side-channel analysis attack techniques
are discussed - selected on the basis of their applicability in IoT device
investigation scenarios. The insight gained from the background study is used
to identify promising future applications of the technique for digital forensic
analysis on IoT devices - potentially progressing a wide variety of currently
hindered digital investigations.
","[{'version': 'v1', 'created': 'Mon, 18 Mar 2019 20:27:14 GMT'}]",2021-08-23,"[['Sayakkara', 'Asanka', ''], ['Le-Khac', 'Nhien-An', ''], ['Scanlon', 'Mark', '']]","['Electromagnetic Side-Channel Attacks', 'Internet-of-Things (IoT)', 'Digital Forensics', 'Data Encryption']"
4784,1907.09745,Junjie Huang,"Junjie Huang, Tiejian Luo",Computing Lens for Exploring the Historical People's Social Network,accepted at SoNet 2018,"International Conference on Future Internet of Things and Cloud
  Workshops (FiCloudW) 2018",10.1109/w-ficloud.2018.00021,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A typical social research topic is to figure out the influential people's
relationship and its weights. It is very tedious for social scientists to solve
those problems by studying massive literature. Digital humanities bring a new
way to a social subject. In this paper, we propose a framework for social
scientists to find out ancient figures' power and their camp. The core of our
framework consists of signed graph model and novel group partition algorithm.
We validate and verify our solution by China Biographical Database Project
(CBDB) dataset. The analytic results on a case study demonstrate the
effectiveness of our framework, which gets information that consists with the
literature's facts and social scientists' viewpoints.
","[{'version': 'v1', 'created': 'Tue, 23 Jul 2019 08:18:41 GMT'}]",2019-07-24,"[['Huang', 'Junjie', ''], ['Luo', 'Tiejian', '']]","['Digital Humanities', 'Information System', 'China Biographical Database Project (CBDB)', 'CLHPSoNet', 'Social Network Analysis', 'Group Partition']"
4785,1703.00796,Daniel Lerch Hostalot,Daniel Lerch-Hostalot and David Meg\'ias,Unsupervised Steganalysis Based on Artificial Training Sets,,,10.1016/j.engappai.2015.12.013,,cs.MM cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, an unsupervised steganalysis method that combines artificial
training setsand supervised classification is proposed. We provide a formal
framework for unsupervisedclassification of stego and cover images in the
typical situation of targeted steganalysis (i.e.,for a known algorithm and
approximate embedding bit rate). We also present a completeset of experiments
using 1) eight different image databases, 2) image features based on
RichModels, and 3) three different embedding algorithms: Least Significant Bit
(LSB) matching,Highly undetectable steganography (HUGO) and Wavelet Obtained
Weights (WOW). Weshow that the experimental results outperform previous methods
based on Rich Models inthe majority of the tested cases. At the same time, the
proposed approach bypasses theproblem of Cover Source Mismatch -when the
embedding algorithm and bit rate are known-, since it removes the need of a
training database when we have a large enough testing set.Furthermore, we
provide a generic proof of the proposed framework in the machine
learningcontext. Hence, the results of this paper could be extended to other
classification problemssimilar to steganalysis.
","[{'version': 'v1', 'created': 'Thu, 2 Mar 2017 14:25:13 GMT'}]",2017-03-03,"[['Lerch-Hostalot', 'Daniel', ''], ['Megías', 'David', '']]","['Unsupervised steganalysis', 'Cover source mismatch', 'Machine learning']"
4786,1306.0947,Ismael Rafols,"Ismael Rafols, Michael M. Hopkins, Jarno Hoekman, Josh Siepel, Alice
  O'Hare, Antonio Perianes-Rodriguez and Paul Nightingale","Big Pharma, little science? A bibliometric perspective on big pharma's
  R&D decline",,,10.1016/j.techfore.2012.06.007,,cs.DL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a widespread perception that pharmaceutical R&D is facing a
productivity crisis characterised by stagnation in the numbers of new drug
approvals in the face of increasing R&D costs. This study explores
pharmaceutical R&D dynamics by examining the publication activities of all R&D
laboratories of the major European and US pharmaceutical firms during the
period 1995-2009. The empirical findings present an industry in
transformation.In the first place, we observe a decline of the total number of
publications by large firms. Second, we show a relative increase of their
external collaborations suggesting a tendency to outsource, and a
diversification of the disciplinary base, in particular towards computation,
health services and more clinical approaches. Also evident is a more pronounced
decline in publications by both R&D laboratories located in Europe and by firms
with European headquarters. Finally, while publications by Big Pharma in
emerging economies sharply increase, they remain extremely low compared with
those in developed countries. In summary, the trend in this transformation is
one of a gradual decrease in internal research efforts and increasing reliance
on external research. These empirical insights support the view that large
pharmaceutical firms are increasingly becoming networks integrators rather than
the prime locus of drug discovery.
","[{'version': 'v1', 'created': 'Wed, 5 Jun 2013 00:02:40 GMT'}]",2013-06-06,"[['Rafols', 'Ismael', ''], ['Hopkins', 'Michael M.', ''], ['Hoekman', 'Jarno', ''], ['Siepel', 'Josh', ''], [""O'Hare"", 'Alice', ''], ['Perianes-Rodriguez', 'Antonio', ''], ['Nightingale', 'Paul', '']]","['Pharmaceuticals', 'bibliometrics', 'outsourcing', 'Europe', 'globalisation', 'research network', 'innovation', 'collaboration  Highlights']"
4787,1901.04301,Shreesha Rao D. S.,"Govardan C., Sri Krishna Chaitanya K., Krishna Kumar Naik B., Shreesha
  Rao D. S., Jagadeesh C., Gowrishankar R., Siva Sankara Sai S., Prabhat
  Behere, Bhyri Sai Kishore",A Heuristic Algorithm for Network Optimization of OTN over DWDM Network,"Pages: 1-6, Published in: 2015 IEEE International Conference on
  Advanced Networks and Telecommuncations Systems (ANTS), Date of Conference:
  15-18 Dec. 2015, Publisher: IEEE, Electronic ISBN: 978-1-5090-0293-1, USB
  ISBN:978-1-5090-0292-4",,10.1109/ANTS.2015.7413606,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While the network traffic has seen exponential increase, the revenues have
not maintained the same pace. New methods have to be explored to reduce this
gap between traffic and revenue. One such method is convergence in networking
layers. In this work, we study the convergence of OTN and DWDM layer from a
network planning perspective. We compare the costs of planning networks without
and with convergence and show that the multilayer planning offers least cost
for higher traffic volumes.
","[{'version': 'v1', 'created': 'Mon, 31 Dec 2018 10:31:29 GMT'}]",2019-01-15,"[['C.', 'Govardan', ''], ['K.', 'Sri Krishna Chaitanya', ''], ['B.', 'Krishna Kumar Naik', ''], ['S.', 'Shreesha Rao D.', ''], ['C.', 'Jagadeesh', ''], ['R.', 'Gowrishankar', ''], ['S.', 'Siva Sankara Sai', ''], ['Behere', 'Prabhat', ''], ['Kishore', 'Bhyri Sai', '']]","['OTN', 'DWDM', 'Network planning', 'Convergence']"
4788,1804.09089,Oscar Adamuz-Hinojosa,"Oscar Adamuz-Hinojosa, Jose Ordonez-Lucena, Pablo Ameigeiras, Juan J.
  Ramos-Munoz, Diego Lopez, Jesus Folgueira","Automated Network Service Scaling in NFV: Concepts, Mechanisms and
  Scaling Workflow","This work has been accepted for publication in the IEEE
  Communications Magazine",,10.1109/MCOM.2018.1701336,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Next-generation systems are anticipated to be digital platforms supporting
innovative services with rapidly changing traffic patterns. To cope with this
dynamicity in a cost-efficient manner, operators need advanced service
management capabilities such as those provided by NFV. NFV enables operators to
scale network services with higher granularity and agility than today. For this
end, automation is key. In search of this automation, the European
Telecommunications Standards Institute (ETSI) has defined a reference NFV
framework that make use of model-driven templates called Network Service
Descriptors (NSDs) to operate network services through their lifecycle. For the
scaling operation, an NSD defines a discrete set of instantiation levels among
which a network service instance can be resized throughout its lifecycle. Thus,
the design of these levels is key for ensuring an effective scaling. In this
article, we provide an overview of the automation of the network service
scaling operation in NFV, addressing the options and boundaries introduced by
ETSI normative specifications. We start by providing a description of the NSD
structure, focusing on how instantiation levels are constructed. For
illustrative purposes, we propose an NSD for a representative NS. This NSD
includes different instantiation levels that enable different ways to
automatically scale this NS. Then, we show the different scaling procedures the
NFV framework has available, and how it may automate their triggering. Finally,
we propose an ETSI-compliant workflow to describe in detail a representative
scaling procedure. This workflow clarifies the interactions and information
exchanges between the functional blocks in the NFV framework when performing
the scaling operation.
","[{'version': 'v1', 'created': 'Tue, 24 Apr 2018 15:15:43 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Jun 2018 14:35:23 GMT'}]",2018-06-18,"[['Adamuz-Hinojosa', 'Oscar', ''], ['Ordonez-Lucena', 'Jose', ''], ['Ameigeiras', 'Pablo', ''], ['Ramos-Munoz', 'Juan J.', ''], ['Lopez', 'Diego', ''], ['Folgueira', 'Jesus', '']]","['NFV', 'ETSI', 'network service', 'scaling', 'automation.   1']"
4789,1810.09425,Jakub Mare\v{c}ek,"Philipp Haehnel, Jakub Marecek, Julien Monteil, and Fearghal O'Donncha","Using Deep Learning to Extend the Range of Air-Pollution Monitoring and
  Forecasting","14 pages, 10 figures","Journal of Computational Physics, 2020",10.1016/j.jcp.2020.109278,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Across numerous applications, forecasting relies on numerical solvers for
partial differential equations (PDEs). Although the use of deep-learning
techniques has been proposed, actual applications have been restricted by the
fact the training data are obtained using traditional PDE solvers. Thereby, the
uses of deep-learning techniques were limited to domains, where the PDE solver
was applicable.
  We demonstrate a deep-learning framework for air-pollution monitoring and
forecasting that provides the ability to train across different model domains,
as well as a reduction in the run-time by two orders of magnitude. It presents
a first-of-a-kind implementation that combines deep-learning and
domain-decomposition techniques to allow model deployments extend beyond the
domain(s) on which the it has been trained.
","[{'version': 'v1', 'created': 'Mon, 22 Oct 2018 17:46:23 GMT'}, {'version': 'v2', 'created': 'Sun, 29 Sep 2019 12:47:19 GMT'}, {'version': 'v3', 'created': 'Sun, 26 Jan 2020 23:55:43 GMT'}]",2020-01-28,"[['Haehnel', 'Philipp', ''], ['Marecek', 'Jakub', ''], ['Monteil', 'Julien', ''], [""O'Donncha"", 'Fearghal', '']]","['deep learning', 'partial differential equations', 'air pollution']"
4790,1807.00149,Ralf-Peter Mundani,"Nevena Perovi\'c (1), J\'er\^ome Frisch (1), Ralf-Peter Mundani (1),
  Ernst Rank (1) ((1) Technische Universit\""at M\""unchen, Munich, Germany)","Interactive data exploration for high-performance fluid flow
  computations through porous media","8 pages,8 figures","Proceedings of the 16th International Symposium on Symbolic and
  Numeric Algorithms for Scientific Computing (2014) 463-470",10.1109/SYNASC.2014.68,,cs.CE physics.comp-ph physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Huge data advent in high-performance computing (HPC) applications such as
fluid flow simulations usually hinders the interactive processing and
exploration of simulation results. Such an interactive data exploration not
only allows scientiest to 'play' with their data but also to visualise huge
(distributed) data sets in both an efficient and easy way. Therefore, we
propose an HPC data exploration service based on a sliding window concept, that
enables researches to access remote data (available on a supercomputer or
cluster) during simulation runtime without exceeding any bandwidth limitations
between the HPC back-end and the user front-end.
","[{'version': 'v1', 'created': 'Sat, 30 Jun 2018 09:47:54 GMT'}]",2018-07-03,"[['Perović', 'Nevena', '', 'Technische Universität München, Munich, Germany'], ['Frisch', 'Jérôme', '', 'Technische Universität München, Munich, Germany'], ['Mundani', 'Ralf-Peter', '', 'Technische Universität München, Munich, Germany'], ['Rank', 'Ernst', '', 'Technische Universität München, Munich, Germany']]","['high-performance computing', 'interactive data exploration', 'adaptive data structure', 'multi-grid-like solver concept', 'flow through porous media']"
4791,1804.06313,Abdul Basit,"N Chaitanya Kumar, Abdul Basit, Priyadarshi Singh, and V. Ch. Venkaiah",Lightweight Cryptography for Distributed PKI Based MANETS,,"International Journal of Computer Networks & Communications
  (IJCNC) Vol.10, No.2, March 2018",10.5121/ijcnc.2018.10207,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Because of lack of infrastructure and Central Authority(CA), secure
communication is a challenging job in MANETs. A lightweight security solution
is needed in MANET to balance its nodes resource tightness and mobility
feature. The role of CA should be decentralized in MANET because the network is
managed by the nodes themselves without any fixed infrastructure and
centralized authority. In this paper, we created a distributed Public Key
Infrastructure (PKI) using Shamir secret sharing mechanism which allows the
nodes of the MANET to have a share of its private key. The traditional PKI
protocols require centralized authority and heavy computing power to manage
public and private keys, thus making them not suitable for MANETs. To establish
a secure communication for the MANET nodes, we proposed a lightweight crypto
protocol which requires limited resources, making it suitable for MANETs.
","[{'version': 'v1', 'created': 'Mon, 9 Apr 2018 12:36:07 GMT'}]",2018-04-18,"[['Kumar', 'N Chaitanya', ''], ['Basit', 'Abdul', ''], ['Singh', 'Priyadarshi', ''], ['Venkaiah', 'V. Ch.', '']]","['Secret sharing', 'Lightweight Cryptography', 'Public key cryptography', 'MANETS']"
4792,1305.2004,Keehang Kwon,Keehang Kwon,Expressing Algorithms As Concise As Possible via Computability Logic,5 pages,"IEICE transactions on fundamental of CS vol E97-A, No.6. June
  2014, 1385-1387",10.1587/transfun.E97.A.1385,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a new approach to defining and expressing algorithms: the
notion of {\it task logical} algorithms. This notion allows the user to define
an algorithm for a task $T$ as a set of agents who can collectively perform
$T$. This notion considerably simplifies the algorithm development process and
can be seen as an integration of the sequential pseudocode and logical
algorithms. This observation requires some changes to algorithm development
process. We propose a two-step approach: the first step is to define an
algorithm for a task $T$ via a set of agents that can collectively perform $T$.
The second step is to translate these agents into (higher-order) computability
logic.
","[{'version': 'v1', 'created': 'Thu, 9 May 2013 03:52:52 GMT'}]",2015-06-15,"[['Kwon', 'Keehang', '']]","['tasks', 'algorithm', 'agents', 'computability logic']"
4793,1505.07203,Jean Cousty,"Jean Cousty (LIGM), Laurent Najman (LIGM), Yukiko Kenmochi (LIGM),
  Silvio Guimar\~A{\pounds}es (VIPLAB, LIGM)","New characterizations of minimum spanning trees and of saliency maps
  based on quasi-flat zones",,"12th International Symposium on Mathematical Morphology (ISMM),
  May 2015, Reykjavik, Iceland. Lecture Notes in Computer Science (LNCS), 9082,
  pp.205-216, Mathematical Morphology and Its Applications to Signal and Image
  Processing",10.1007/978-3-319-18720-4_18,,cs.CV cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study three representations of hierarchies of partitions: dendrograms
(direct representations), saliency maps, and minimum spanning trees. We provide
a new bijection between saliency maps and hierarchies based on quasi-flat zones
as used in image processing and characterize saliency maps and minimum spanning
trees as solutions to constrained minimization problems where the constraint is
quasi-flat zones preservation. In practice, these results form a toolkit for
new hierarchical methods where one can choose the most convenient
representation. They also invite us to process non-image data with
morphological hierarchies.
","[{'version': 'v1', 'created': 'Wed, 27 May 2015 06:36:10 GMT'}]",2015-05-28,"[['Cousty', 'Jean', '', 'LIGM'], ['Najman', 'Laurent', '', 'LIGM'], ['Kenmochi', 'Yukiko', '', 'LIGM'], ['Guimarães', 'Silvio', '', 'VIPLAB, LIGM']]","['Hierarchy', 'saliency map', 'minimum spanning tree']"
4794,2012.06466,Amee Trivedi,"Amee Trivedi, Deepak Vasisht","Digital Contact Tracing: Technologies, Shortcomings, and the Path
  Forward",7 pages,ACM SIGCOMM CCR (2020),10.1145/3431832.3431841,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Since the start of the COVID-19 pandemic, technology enthusiasts have pushed
for digital contact tracing as a critical tool for breaking the COVID-19
transmission chains. Motivated by this push, many countries and companies have
created apps that enable digital contact tracing with the goal to identify the
chain of transmission from an infected individual to others and enable early
quarantine. Digital contact tracing applications like AarogyaSetu in India,
TraceTogether in Singapore, SwissCovid in Switzerland, and others have been
downloaded hundreds of millions of times. Yet, this technology hasn't seen the
impact that we envisioned at the start of the pandemic. Some countries have
rolled back their apps, while others have seen low adoption.
  Therefore, it is prudent to ask what the technology landscape of
contact-tracing looks like and what are the missing pieces. We attempt to
undertake this task in this paper. We present a high-level review of
technologies underlying digital contact tracing, a set of metrics that are
important while evaluating different contact tracing technologies, and evaluate
where the different technologies stand today on this set of metrics. Our hope
is two-fold: (a) Future designers of contact tracing applications can use this
review paper to understand the technology landscape, and (b) Researchers can
identify and solve the missing pieces of this puzzle so that we are ready to
face the rest of the COVID-19 pandemic and any future pandemics. A majority of
this discussion is focused on the ability to identify contact between
individuals. The questions of ethics, privacy, and security of such contact
tracing are briefly mentioned but not discussed in detail.
","[{'version': 'v1', 'created': 'Fri, 11 Dec 2020 16:36:34 GMT'}]",2020-12-14,"[['Trivedi', 'Amee', ''], ['Vasisht', 'Deepak', '']]","['Digital Contact Tracing', 'Technology', 'System and Challenges']"
4795,2206.07808,Jack FitzGerald,"Jack FitzGerald, Shankar Ananthakrishnan, Konstantine Arkoudas, Davide
  Bernardi, Abhishek Bhagia, Claudio Delli Bovi, Jin Cao, Rakesh Chada, Amit
  Chauhan, Luoxin Chen, Anurag Dwarakanath, Satyam Dwivedi, Turan Gojayev,
  Karthik Gopalakrishnan, Thomas Gueudre, Dilek Hakkani-Tur, Wael Hamza,
  Jonathan Hueser, Kevin Martin Jose, Haidar Khan, Beiye Liu, Jianhua Lu,
  Alessandro Manzotti, Pradeep Natarajan, Karolina Owczarzak, Gokmen Oz, Enrico
  Palumbo, Charith Peris, Chandana Satya Prakash, Stephen Rawls, Andy
  Rosenbaum, Anjali Shenoy, Saleh Soltan, Mukund Harakere Sridhar, Liz Tan,
  Fabian Triefenbach, Pan Wei, Haiyang Yu, Shuai Zheng, Gokhan Tur, Prem
  Natarajan","Alexa Teacher Model: Pretraining and Distilling Multi-Billion-Parameter
  Encoders for Natural Language Understanding Systems",KDD 2022,"Proceedings of the 28th ACM SIGKDD Conference on Knowledge
  Discovery and Data Mining (KDD '22), August 14-18, 2022, Washington, DC, USA",10.1145/3534678.3539173,,cs.CL cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We present results from a large-scale experiment on pretraining encoders with
non-embedding parameter counts ranging from 700M to 9.3B, their subsequent
distillation into smaller models ranging from 17M-170M parameters, and their
application to the Natural Language Understanding (NLU) component of a virtual
assistant system. Though we train using 70% spoken-form data, our teacher
models perform comparably to XLM-R and mT5 when evaluated on the written-form
Cross-lingual Natural Language Inference (XNLI) corpus. We perform a second
stage of pretraining on our teacher models using in-domain data from our
system, improving error rates by 3.86% relative for intent classification and
7.01% relative for slot filling. We find that even a 170M-parameter model
distilled from our Stage 2 teacher model has 2.88% better intent classification
and 7.69% better slot filling error rates when compared to the 2.3B-parameter
teacher trained only on public data (Stage 1), emphasizing the importance of
in-domain data for pretraining. When evaluated offline using labeled NLU data,
our 17M-parameter Stage 2 distilled model outperforms both XLM-R Base (85M
params) and DistillBERT (42M params) by 4.23% to 6.14%, respectively. Finally,
we present results from a full virtual assistant experimentation platform,
where we find that models trained using our pretraining and distillation
pipeline outperform models distilled from 85M-parameter teachers by 3.74%-4.91%
on an automatic measurement of full-system user dissatisfaction.
","[{'version': 'v1', 'created': 'Wed, 15 Jun 2022 20:44:23 GMT'}]",2022-06-17,"[['FitzGerald', 'Jack', ''], ['Ananthakrishnan', 'Shankar', ''], ['Arkoudas', 'Konstantine', ''], ['Bernardi', 'Davide', ''], ['Bhagia', 'Abhishek', ''], ['Bovi', 'Claudio Delli', ''], ['Cao', 'Jin', ''], ['Chada', 'Rakesh', ''], ['Chauhan', 'Amit', ''], ['Chen', 'Luoxin', ''], ['Dwarakanath', 'Anurag', ''], ['Dwivedi', 'Satyam', ''], ['Gojayev', 'Turan', ''], ['Gopalakrishnan', 'Karthik', ''], ['Gueudre', 'Thomas', ''], ['Hakkani-Tur', 'Dilek', ''], ['Hamza', 'Wael', ''], ['Hueser', 'Jonathan', ''], ['Jose', 'Kevin Martin', ''], ['Khan', 'Haidar', ''], ['Liu', 'Beiye', ''], ['Lu', 'Jianhua', ''], ['Manzotti', 'Alessandro', ''], ['Natarajan', 'Pradeep', ''], ['Owczarzak', 'Karolina', ''], ['Oz', 'Gokmen', ''], ['Palumbo', 'Enrico', ''], ['Peris', 'Charith', ''], ['Prakash', 'Chandana Satya', ''], ['Rawls', 'Stephen', ''], ['Rosenbaum', 'Andy', ''], ['Shenoy', 'Anjali', ''], ['Soltan', 'Saleh', ''], ['Sridhar', 'Mukund Harakere', ''], ['Tan', 'Liz', ''], ['Triefenbach', 'Fabian', ''], ['Wei', 'Pan', ''], ['Yu', 'Haiyang', ''], ['Zheng', 'Shuai', ''], ['Tur', 'Gokhan', ''], ['Natarajan', 'Prem', '']]","['natural language understanding', 'model pretraining', 'knowledgedistillation', 'transformers', 'self-attention', 'distributed training', 'virtualassistant', 'voice a.i']"
4796,1807.04644,Michael Veale,"Michael Veale, Reuben Binns and Lilian Edwards","Algorithms that Remember: Model Inversion Attacks and Data Protection
  Law","15 pages, 1 figure",Philosophical Transactions of the Royal Society A 376 (2018),10.1098/rsta.2018.0083,,cs.LG cs.CR cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Many individuals are concerned about the governance of machine learning
systems and the prevention of algorithmic harms. The EU's recent General Data
Protection Regulation (GDPR) has been seen as a core tool for achieving better
governance of this area. While the GDPR does apply to the use of models in some
limited situations, most of its provisions relate to the governance of personal
data, while models have traditionally been seen as intellectual property. We
present recent work from the information security literature around `model
inversion' and `membership inference' attacks, which indicate that the process
of turning training data into machine learned systems is not one-way, and
demonstrate how this could lead some models to be legally classified as
personal data. Taking this as a probing experiment, we explore the different
rights and obligations this would trigger and their utility, and posit future
directions for algorithmic governance and regulation.
","[{'version': 'v1', 'created': 'Thu, 12 Jul 2018 14:38:48 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Oct 2018 19:07:51 GMT'}]",2018-10-17,"[['Veale', 'Michael', ''], ['Binns', 'Reuben', ''], ['Edwards', 'Lilian', '']]","['model inversion', 'personal data', 'modeltrading', 'machine learning']"
4797,1803.08691,Holger Roth,"Holger R. Roth, Chen Shen, Hirohisa Oda, Masahiro Oda, Yuichiro
  Hayashi, Kazunari Misawa, Kensaku Mori",Deep learning and its application to medical image segmentation,"Accepted for publication in the journal of the Japanese Society of
  Medical Imaging Technology (JAMIT)","Medical Imaging Technology, Volume 36 (2018), Issue 2, p. 63-71",10.11409/mit.36.63,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the most common tasks in medical imaging is semantic segmentation.
Achieving this segmentation automatically has been an active area of research,
but the task has been proven very challenging due to the large variation of
anatomy across different patients. However, recent advances in deep learning
have made it possible to significantly improve the performance of image
recognition and semantic segmentation methods in the field of computer vision.
Due to the data driven approaches of hierarchical feature learning in deep
learning frameworks, these advances can be translated to medical images without
much difficulty. Several variations of deep convolutional neural networks have
been successfully applied to medical images. Especially fully convolutional
architectures have been proven efficient for segmentation of 3D medical images.
In this article, we describe how to build a 3D fully convolutional network
(FCN) that can process 3D images in order to produce automatic semantic
segmentations. The model is trained and evaluated on a clinical computed
tomography (CT) dataset and shows state-of-the-art performance in multi-organ
segmentation.
","[{'version': 'v1', 'created': 'Fri, 23 Mar 2018 08:55:10 GMT'}]",2018-04-10,"[['Roth', 'Holger R.', ''], ['Shen', 'Chen', ''], ['Oda', 'Hirohisa', ''], ['Oda', 'Masahiro', ''], ['Hayashi', 'Yuichiro', ''], ['Misawa', 'Kazunari', ''], ['Mori', 'Kensaku', '']]","['fully convolutional networks', 'deep learning', 'segmentation', 'computed tomography']"
4798,1204.1079,Johan Thapper,Johan Thapper and Stanislav Zivny,The Power of Linear Programming for Valued CSPs,Corrected a few typos,Proc. of FOCS'12 669-678 (2012),10.1109/FOCS.2012.25,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A class of valued constraint satisfaction problems (VCSPs) is characterised
by a valued constraint language, a fixed set of cost functions on a finite
domain. An instance of the problem is specified by a sum of cost functions from
the language with the goal to minimise the sum. This framework includes and
generalises well-studied constraint satisfaction problems (CSPs) and maximum
constraint satisfaction problems (Max-CSPs).
  Our main result is a precise algebraic characterisation of valued constraint
languages whose instances can be solved exactly by the basic linear programming
relaxation. Using this result, we obtain tractability of several novel and
previously widely-open classes of VCSPs, including problems over valued
constraint languages that are: (1) submodular on arbitrary lattices; (2)
bisubmodular (also known as k-submodular) on arbitrary finite domains; (3)
weakly (and hence strongly) tree-submodular on arbitrary trees.
","[{'version': 'v1', 'created': 'Wed, 4 Apr 2012 21:12:26 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Apr 2012 14:39:54 GMT'}]",2015-11-24,"[['Thapper', 'Johan', ''], ['Zivny', 'Stanislav', '']]","['valued constraint satisfaction', 'fractional polymorphisms', 'fractional homomorphisms', 'submodularity', 'bisubmodularity', 'linear programming']"
4799,1303.0095,Tomasz Kajdanowicz,"Tomasz Kajdanowicz, Przemyslaw Kazienko, Piotr Doskocz","Label-dependent Feature Extraction in Social Networks for Node
  Classification","feature extraction, label-dependent features, classification, social
  network analysis, AMD social network","Kajdanowicz T., Kazienko P., Doskocz P.: Label-dependent Feature
  Extraction in Social Networks for Node Classification. Lecture Notes in
  Artificial Intelligence LNAI 6430, Springer, 2010, pp. 89-102",10.1007/978-3-642-16567-2_7,,cs.SI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new method of feature extraction in the social network for within-network
classification is proposed in the paper. The method provides new features
calculated by combination of both: network structure information and class
labels assigned to nodes. The influence of various features on classification
performance has also been studied. The experiments on real-world data have
shown that features created owing to the proposed method can lead to
significant improvement of classification accuracy.
","[{'version': 'v1', 'created': 'Fri, 1 Mar 2013 06:31:02 GMT'}]",2013-03-04,"[['Kajdanowicz', 'Tomasz', ''], ['Kazienko', 'Przemyslaw', ''], ['Doskocz', 'Piotr', '']]","['feature extraction', 'label-dependent features', 'classification', 'social network analysis', 'AMD social network']"
4800,2112.06984,Benedikt Ahrens,"Benedikt Ahrens, Ralph Matthes, Anders M\""ortberg",Implementing a Category-Theoretic Framework for Typed Abstract Syntax,,"In Proceedings of the 11th ACM SIGPLAN International Conference on
  Certified Programs and Proofs (CPP '22), 2022, ACM, New York, NY, USA",10.1145/3497775.3503678,,cs.PL math.CT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In previous work (""From signatures to monads in UniMath""), we described a
category-theoretic construction of abstract syntax from a signature, mechanized
in the UniMath library based on the Coq proof assistant.
  In the present work, we describe what was necessary to generalize that work
to account for simply-typed languages. First, some definitions had to be
generalized to account for the natural appearance of non-endofunctors in the
simply-typed case. As it turns out, in many cases our mechanized results
carried over to the generalized definitions without any code change. Second, an
existing mechanized library on $\omega$-cocontinuous functors had to be
extended by constructions and theorems necessary for constructing multi-sorted
syntax. Third, the theoretical framework for the semantical signatures had to
be generalized from a monoidal to a bicategorical setting, again to account for
non-endofunctors arising in the typed case. This uses actions of endofunctors
on functors with given source, and the corresponding notion of strong functors
between actions, all formalized in UniMath using a recently developed library
of bicategory theory. We explain what needed to be done to plug all of these
ingredients together, modularly.
  The main result of our work is a general construction that, when fed with a
signature for a simply-typed language, returns an implementation of that
language together with suitable boilerplate code, in particular, a certified
monadic substitution operation.
","[{'version': 'v1', 'created': 'Mon, 13 Dec 2021 19:35:00 GMT'}]",2021-12-15,"[['Ahrens', 'Benedikt', ''], ['Matthes', 'Ralph', ''], ['Mörtberg', 'Anders', '']]","['typed abstract syntax', 'monad', 'signature', 'formalization', 'computer-checked proof']"
4801,1802.04291,Emilio Ferrara,"Adam Badawy, Emilio Ferrara, Kristina Lerman","Analyzing the Digital Traces of Political Manipulation: The 2016 Russian
  Interference Twitter Campaign",,"2018 IEEE/ACM International Conference on Advances in Social
  Networks Analysis and Mining (ASONAM), Barcelona, Spain, 2018, pp. 258-265",10.1109/ASONAM.2018.8508646,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Until recently, social media was seen to promote democratic discourse on
social and political issues. However, this powerful communication platform has
come under scrutiny for allowing hostile actors to exploit online discussions
in an attempt to manipulate public opinion. A case in point is the ongoing U.S.
Congress' investigation of Russian interference in the 2016 U.S. election
campaign, with Russia accused of using trolls (malicious accounts created to
manipulate) and bots to spread misinformation and politically biased
information. In this study, we explore the effects of this manipulation
campaign, taking a closer look at users who re-shared the posts produced on
Twitter by the Russian troll accounts publicly disclosed by U.S. Congress
investigation. We collected a dataset with over 43 million election-related
posts shared on Twitter between September 16 and October 21, 2016, by about 5.7
million distinct users. This dataset included accounts associated with the
identified Russian trolls. We use label propagation to infer the ideology of
all users based on the news sources they shared. This method enables us to
classify a large number of users as liberal or conservative with precision and
recall above 90%. Conservatives retweeted Russian trolls about 31 times more
often than liberals and produced 36x more tweets. Additionally, most retweets
of troll content originated from two Southern states: Tennessee and Texas.
Using state-of-the-art bot detection techniques, we estimated that about 4.9%
and 6.2% of liberal and conservative users respectively were bots. Text
analysis on the content shared by trolls reveals that they had a mostly
conservative, pro-Trump agenda. Although an ideologically broad swath of
Twitter users was exposed to Russian Trolls in the period leading up to the
2016 U.S. Presidential election, it was mainly conservatives who helped amplify
their message.
","[{'version': 'v1', 'created': 'Mon, 12 Feb 2018 19:00:18 GMT'}]",2018-11-01,"[['Badawy', 'Adam', ''], ['Ferrara', 'Emilio', ''], ['Lerman', 'Kristina', '']]","['Social media manipulation', 'Russian trolls', 'Bots', 'Misinformation']"
4802,0803.1728,Uwe Aickelin,"Salwani Abdullah, Uwe Aickelin, Edmund Burke, Aniza Din and Rong Qu",Investigating a Hybrid Metaheuristic For Job Shop Rescheduling,,"Proceedings of the 3rd Australian Conference on Artificial Life
  (ACAL07), Lecture Notes in Computer Science 4828, pp 357-368, Gold Coast,
  Australia 2007",10.1007/978-3-540-76931-6_31,,cs.NE cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Previous research has shown that artificial immune systems can be used to
produce robust schedules in a manufacturing environment. The main goal is to
develop building blocks (antibodies) of partial schedules that can be used to
construct backup solutions (antigens) when disturbances occur during
production. The building blocks are created based upon underpinning ideas from
artificial immune systems and evolved using a genetic algorithm (Phase I). Each
partial schedule (antibody) is assigned a fitness value and the best partial
schedules are selected to be converted into complete schedules (antigens). We
further investigate whether simulated annealing and the great deluge algorithm
can improve the results when hybridised with our artificial immune system
(Phase II). We use ten fixed solutions as our target and measure how well we
cover these specific scenarios.
","[{'version': 'v1', 'created': 'Wed, 12 Mar 2008 09:26:47 GMT'}]",2010-07-05,"[['Abdullah', 'Salwani', ''], ['Aickelin', 'Uwe', ''], ['Burke', 'Edmund', ''], ['Din', 'Aniza', ''], ['Qu', 'Rong', '']]","['Artificial immune systems', 'simulated annealing', 'great deluge algorithm', 'job shop scheduling']"
4803,1910.00350,Christof Paar,"Sebastian Wallat and Nils Albartus and Steffen Becker and Max Hoffmann
  and Maik Ender and Marc Fyrbiak and Adrian Drees and Sebastian Maa{\ss}en and
  Christof Paar","Highway to HAL: Open-Sourcing the First Extendable Gate-Level Netlist
  Reverse Engineering Framework",,"Proceedings of Malicious Software and Hardware in Internet of
  Things (MAL-IOT 2019). ACM, NewYork, NY, USA, Article 4, 6 pages",10.1145/3310273.3323419,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since hardware oftentimes serves as the root of trust in our modern
interconnected world, malicious hardware manipulations constitute a ubiquitous
threat in the context of the Internet of Things (IoT). Hardware reverse
engineering is a prevalent technique to detect such manipulations.
  Over the last years, an active research community has significantly advanced
the field of hardware reverse engineering. Notably, many open research
questions regarding the extraction of functionally correct netlists from Field
Programmable Gate Arrays (FPGAs) or Application Specific Integrated Circuits
(ASICs) have been tackled. In order to facilitate further analysis of recovered
netlists, a software framework is required, serving as the foundation for
specialized algorithms. Currently, no such framework is publicly available.
  Therefore, we provide the first open-source gate-library agnostic framework
for gate-level netlist analysis. In this positional paper, we demonstrate the
workflow of our modular framework HAL on the basis of two case studies and
provide profound insights on its technical foundations.
","[{'version': 'v1', 'created': 'Tue, 1 Oct 2019 12:50:25 GMT'}]",2019-10-02,"[['Wallat', 'Sebastian', ''], ['Albartus', 'Nils', ''], ['Becker', 'Steffen', ''], ['Hoffmann', 'Max', ''], ['Ender', 'Maik', ''], ['Fyrbiak', 'Marc', ''], ['Drees', 'Adrian', ''], ['Maaßen', 'Sebastian', ''], ['Paar', 'Christof', '']]","['hardware reverse engineering', 'gate-level netlist', 'open-sourceframework']"
4804,2204.12294,Ivan Srba,"Ivan Srba, Branislav Pecher, Matus Tomlein, Robert Moro, Elena
  Stefancova, Jakub Simko, Maria Bielikova","Monant Medical Misinformation Dataset: Mapping Articles to Fact-Checked
  Claims","11 pages, 4 figures, SIGIR 2022 Resource paper track","ACM SIGIR Conference on Research and Development in Information
  Retrieval (SIGIR 2022)",10.1145/3477495.3531726,,cs.CL cs.CY cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  False information has a significant negative influence on individuals as well
as on the whole society. Especially in the current COVID-19 era, we witness an
unprecedented growth of medical misinformation. To help tackle this problem
with machine learning approaches, we are publishing a feature-rich dataset of
approx. 317k medical news articles/blogs and 3.5k fact-checked claims. It also
contains 573 manually and more than 51k automatically labelled mappings between
claims and articles. Mappings consist of claim presence, i.e., whether a claim
is contained in a given article, and article stance towards the claim. We
provide several baselines for these two tasks and evaluate them on the manually
labelled part of the dataset. The dataset enables a number of additional tasks
related to medical misinformation, such as misinformation characterisation
studies or studies of misinformation diffusion between sources.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2022 13:18:27 GMT'}]",2022-04-27,"[['Srba', 'Ivan', ''], ['Pecher', 'Branislav', ''], ['Tomlein', 'Matus', ''], ['Moro', 'Robert', ''], ['Stefancova', 'Elena', ''], ['Simko', 'Jakub', ''], ['Bielikova', 'Maria', '']]","['medical misinformation', 'dataset', 'fact-checking', 'Monant platform']"
4805,1703.07167,Cosmin Anitescu,"Chiu Ling Chan, Cosmin Anitescu, Timon Rabczuk","Volumetric parametrization from a level set boundary representation with
  PHT Splines",,"Computer-Aided Design, Volume 82, January 2017, Pages 29-41",10.1016/j.cad.2016.08.008,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A challenge in isogeometric analysis is constructing analysis-suitable
volumetric meshes which can accurately represent the geometry of a given
physical domain. In this paper, we propose a method to derive a spline-based
representation of a domain of interest from voxel-based data. We show an
efficient way to obtain a boundary representation of the domain by a level-set
function. Then, we use the geometric information from the boundary (the normal
vectors and curvature) to construct a matching C1 representation with
hierarchical cubic splines. The approximation is done by a single template and
linear transformations (scaling, translations and rotations) without the need
for solving an optimization problem. We illustrate our method with several
examples in two and three dimensions, and show good performance on some
standard benchmark test problems.
","[{'version': 'v1', 'created': 'Fri, 17 Mar 2017 10:28:00 GMT'}]",2017-03-22,"[['Chan', 'Chiu Ling', ''], ['Anitescu', 'Cosmin', ''], ['Rabczuk', 'Timon', '']]","['Volumetric parametrization', 'boundary representation', 'PHT-splines', 'level set method']"
4806,2102.11623,Ilja Behnke,"Franz Bender, Jan Jonas Brune, Nick Lauritz Keutel, Ilja Behnke, and
  Lauritz Thamsen","PIERES: A Playground for Network Interrupt Experiments on Real-Time
  Embedded Systems in the IoT","The Ninth International Workshop on Load Testing and Benchmarking of
  Software Systems (LTB 2021)","2021 Companion of the ACM/SPEC International Conference on
  Performance Engineering (ICPE '21), 81-84",10.1145/3447545.3451189,,cs.NI cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  IoT devices have become an integral part of our lives and the industry. Many
of these devices run real-time systems or are used as part of them. As these
devices receive network packets over IP networks, the network interface informs
the CPU about their arrival using interrupts that might preempt critical
processes. Therefore, the question arises whether network interrupts pose a
threat to the real-timeness of these devices. However, there are few tools to
investigate this issue. We present a playground which enables researchers to
conduct experiments in the context of network interrupt simulation. The
playground comprises different network interface controller implementations,
load generators and timing utilities. It forms a flexible and easy to use
foundation for future network interrupt research. We conduct two verification
experiments and two real world examples. The latter give insight into the
impact of the interrupt handling strategy parameters and the influence of
different load types on the execution time with respect to these parameters.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2021 10:59:47 GMT'}]",2021-04-14,"[['Bender', 'Franz', ''], ['Brune', 'Jan Jonas', ''], ['Keutel', 'Nick Lauritz', ''], ['Behnke', 'Ilja', ''], ['Thamsen', 'Lauritz', '']]","['internet of things', 'real time', 'interrupts', 'load simulation', 'cyber physical systems', 'benchmarking']"
4807,1805.12323,Jimmy Wu,"Jimmy Wu, Bolei Zhou, Diondra Peck, Scott Hsieh, Vandana Dialani,
  Lester Mackey, Genevieve Patterson","DeepMiner: Discovering Interpretable Representations for Mammogram
  Classification and Explanation","Harvard Data Science Review (HDSR), 2021. Code available at
  https://github.com/jimmyyhwu/ddsm-visual-primitives",,10.1162/99608f92.8b81b005,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose DeepMiner, a framework to discover interpretable representations
in deep neural networks and to build explanations for medical predictions. By
probing convolutional neural networks (CNNs) trained to classify cancer in
mammograms, we show that many individual units in the final convolutional layer
of a CNN respond strongly to diseased tissue concepts specified by the BI-RADS
lexicon. After expert annotation of the interpretable units, our proposed
method is able to generate explanations for CNN mammogram classification that
are consistent with ground truth radiology reports on the Digital Database for
Screening Mammography. We show that DeepMiner not only enables better
understanding of the nuances of CNN classification decisions but also possibly
discovers new visual knowledge relevant to medical diagnosis.
","[{'version': 'v1', 'created': 'Thu, 31 May 2018 05:42:45 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Aug 2021 03:17:53 GMT'}]",2021-11-02,"[['Wu', 'Jimmy', ''], ['Zhou', 'Bolei', ''], ['Peck', 'Diondra', ''], ['Hsieh', 'Scott', ''], ['Dialani', 'Vandana', ''], ['Mackey', 'Lester', ''], ['Patterson', 'Genevieve', '']]","['deep learning', 'interpretability', 'human-in-the-loop machine learning', 'mammography']"
4808,1812.05161,Aman Agarwal,"Aman Agarwal, Ivan Zaitsev, Xuanhui Wang, Cheng Li, Marc Najork and
  Thorsten Joachims",Estimating Position Bias without Intrusive Interventions,,,10.1145/3289600.3291017,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Presentation bias is one of the key challenges when learning from implicit
feedback in search engines, as it confounds the relevance signal. While it was
recently shown how counterfactual learning-to-rank (LTR) approaches
\cite{Joachims/etal/17a} can provably overcome presentation bias when
observation propensities are known, it remains to show how to effectively
estimate these propensities. In this paper, we propose the first method for
producing consistent propensity estimates without manual relevance judgments,
disruptive interventions, or restrictive relevance modeling assumptions. First,
we show how to harvest a specific type of intervention data from historic
feedback logs of multiple different ranking functions, and show that this data
is sufficient for consistent propensity estimation in the position-based model.
Second, we propose a new extremum estimator that makes effective use of this
data. In an empirical evaluation, we find that the new estimator provides
superior propensity estimates in two real-world systems -- Arxiv Full-text
Search and Google Drive Search. Beyond these two points, we find that the
method is robust to a wide range of settings in simulation studies.
","[{'version': 'v1', 'created': 'Wed, 12 Dec 2018 21:26:43 GMT'}]",2018-12-14,"[['Agarwal', 'Aman', ''], ['Zaitsev', 'Ivan', ''], ['Wang', 'Xuanhui', ''], ['Li', 'Cheng', ''], ['Najork', 'Marc', ''], ['Joachims', 'Thorsten', '']]","['Unbiased learning-to-rank', 'counterfactual inference', 'propensity estimation']"
4809,2005.11151,Felix Hamza-Lup,"Felix G. Hamza-Lup, Adytia Suri, Ionut E. Iacob, Ioana R. Goldbach,
  Lateef Rasheed and Paul N. Borza",Attention Patterns Detection using Brain Computer Interfaces,,ACM SE 2020,,,cs.HC cs.AI eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The human brain provides a range of functions such as expressing emotions,
controlling the rate of breathing, etc., and its study has attracted the
interest of scientists for many years. As machine learning models become more
sophisticated, and bio-metric data becomes more readily available through new
non-invasive technologies, it becomes increasingly possible to gain access to
interesting biometric data that could revolutionize Human-Computer Interaction.
In this research, we propose a method to assess and quantify human attention
levels and their effects on learning. In our study, we employ a brain computer
interface (BCI) capable of detecting brain wave activity and displaying the
corresponding electroencephalograms (EEG). We train recurrent neural networks
(RNNS) to identify the type of activity an individual is performing.
","[{'version': 'v1', 'created': 'Wed, 20 May 2020 11:55:37 GMT'}]",2020-05-25,"[['Hamza-Lup', 'Felix G.', ''], ['Suri', 'Adytia', ''], ['Iacob', 'Ionut E.', ''], ['Goldbach', 'Ioana R.', ''], ['Rasheed', 'Lateef', ''], ['Borza', 'Paul N.', '']]","['Emotion Identification', 'Brain Computer Interface', 'Recurrent Neural Networks', 'Human-Computer Interaction']"
4810,2201.11727,Zhiyuan Yao,"Zhiyuan Yao, Zihan Ding, Thomas Clausen","Multi-Agent Reinforcement Learning for Network Load Balancing in Data
  Center",,"31st ACM International Conference on Information and Knowledge
  Management (CIKM 2022)",10.1145/3511808.3557133,,cs.DC cs.LG cs.NI,http://creativecommons.org/publicdomain/zero/1.0/,"  This paper presents the network load balancing problem, a challenging
real-world task for multi-agent reinforcement learning (MARL) methods.
Traditional heuristic solutions like Weighted-Cost Multi-Path (WCMP) and Local
Shortest Queue (LSQ) are less flexible to the changing workload distributions
and arrival rates, with a poor balance among multiple load balancers. The
cooperative network load balancing task is formulated as a Dec-POMDP problem,
which naturally induces the MARL methods. To bridge the reality gap for
applying learning-based methods, all methods are directly trained and evaluated
on an emulation system from moderate-to large-scale. Experiments on realistic
testbeds show that the independent and ""selfish"" load balancing strategies are
not necessarily the globally optimal ones, while the proposed MARL solution has
a superior performance over different realistic settings. Additionally, the
potential difficulties of MARL methods for network load balancing are analysed,
which helps to draw the attention of the learning and network communities to
such challenges.
","[{'version': 'v1', 'created': 'Thu, 27 Jan 2022 18:47:59 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Jan 2022 19:50:54 GMT'}, {'version': 'v3', 'created': 'Wed, 27 Apr 2022 22:28:03 GMT'}, {'version': 'v4', 'created': 'Fri, 19 Aug 2022 19:31:01 GMT'}]",2022-08-23,"[['Yao', 'Zhiyuan', ''], ['Ding', 'Zihan', ''], ['Clausen', 'Thomas', '']]","['MARL', 'load balancing', 'distributed systems']"
4811,1207.3603,Hocine Cherifi,"G\""unce Orman (Le2i), Vincent Labatut (BIT Lab), Hocine Cherifi (Le2i)",Qualitative Comparison of Community Detection Algorithms,"DICTAP 2011, The International Conference on Digital Information and
  Communication Technology and its Applications, Dijon : France (2011)","Communications in Computer and Information Science, 167:265-279,
  2011",10.1007/978-3-642-22027-2_23,,cs.SI cs.CV physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Community detection is a very active field in complex networks analysis,
consisting in identifying groups of nodes more densely interconnected
relatively to the rest of the network. The existing algorithms are usually
tested and compared on real-world and artificial networks, their performance
being assessed through some partition similarity measure. However, artificial
networks realism can be questioned, and the appropriateness of those measures
is not obvious. In this study, we take advantage of recent advances concerning
the characterization of community structures to tackle these questions. We
first generate networks thanks to the most realistic model available to date.
Their analysis reveals they display only some of the properties observed in
real-world community structures. We then apply five community detection
algorithms on these networks and find out the performance assessed
quantitatively does not necessarily agree with a qualitative analysis of the
identified communities. It therefore seems both approaches should be applied to
perform a relevant comparison of the algorithms.
","[{'version': 'v1', 'created': 'Mon, 16 Jul 2012 08:49:05 GMT'}]",2012-08-16,"[['Orman', 'Günce', '', 'Le2i'], ['Labatut', 'Vincent', '', 'BIT Lab'], ['Cherifi', 'Hocine', '', 'Le2i']]","['Complex Networks', 'Community Detection', 'Community Properties', 'Algorithms Comparison']"
4812,1902.06196,Thijs Laarhoven,Thijs Laarhoven,Nearest neighbor decoding for Tardos fingerprinting codes,"6 pages, 1 figure, 2 tables","ACM Workshop on Information Hiding and Multimedia Security
  (IH&MMSec), pp. 182-187, 2019",10.1145/3335203.3335732,,cs.CR cs.CC cs.CG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the past decade, various improvements have been made to Tardos'
collusion-resistant fingerprinting scheme [Tardos, STOC 2003], ultimately
resulting in a good understanding of what is the minimum code length required
to achieve collusion-resistance. In contrast, decreasing the cost of the actual
decoding algorithm for identifying the potential colluders has received less
attention, even though previous results have shown that using joint decoding
strategies, deemed too expensive for decoding, may lead to better code lengths.
Moreover, in dynamic settings a fast decoder may be required to provide answers
in real-time, further raising the question whether the decoding costs of
score-based fingerprinting schemes can be decreased with a smarter decoding
algorithm. In this paper we show how to model the decoding step of score-based
fingerprinting as a nearest neighbor search problem, and how this relation
allows us to apply techniques from the field of (approximate) nearest neighbor
searching to obtain decoding times which are sublinear in the total number of
users. As this does not affect the encoding and embedding steps, this decoding
mechanism can easily be deployed within existing fingerprinting schemes, and
this may bring a truly efficient joint decoder closer to reality. Besides the
application to fingerprinting, similar techniques can be used to decrease the
decoding costs of group testing methods, which may be of independent interest.
","[{'version': 'v1', 'created': 'Sun, 17 Feb 2019 03:35:23 GMT'}]",2019-10-04,"[['Laarhoven', 'Thijs', '']]","['collusion-resistance', 'fingerprinting codes', 'watermarking', 'nearestneighbor searching', 'group testing']"
4813,1705.03102,Albert Reuther PhD,"Albert Reuther, Chansup Byun, William Arcand, David Bestor, Bill
  Bergeron, Matthew Hubbell, Michael Jones, Peter Michaleas, Andrew Prout,
  Antonio Rosa, Jeremy Kepner",Scalable System Scheduling for HPC and Big Data,"34 pages, 7 figures",,10.1016/j.jpdc.2017.06.009,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the rapidly expanding field of parallel processing, job schedulers are the
""operating systems"" of modern big data architectures and supercomputing
systems. Job schedulers allocate computing resources and control the execution
of processes on those resources. Historically, job schedulers were the domain
of supercomputers, and job schedulers were designed to run massive,
long-running computations over days and weeks. More recently, big data
workloads have created a need for a new class of computations consisting of
many short computations taking seconds or minutes that process enormous
quantities of data. For both supercomputers and big data systems, the
efficiency of the job scheduler represents a fundamental limit on the
efficiency of the system. Detailed measurement and modeling of the performance
of schedulers are critical for maximizing the performance of a large-scale
computing system. This paper presents a detailed feature analysis of 15
supercomputing and big data schedulers. For big data workloads, the scheduler
latency is the most important performance characteristic of the scheduler. A
theoretical model of the latency of these schedulers is developed and used to
design experiments targeted at measuring scheduler latency. Detailed
benchmarking of four of the most popular schedulers (Slurm, Son of Grid Engine,
Mesos, and Hadoop YARN) are conducted. The theoretical model is compared with
data and demonstrates that scheduler performance can be characterized by two
key parameters: the marginal latency of the scheduler $t_s$ and a nonlinear
exponent $\alpha_s$. For all four schedulers, the utilization of the computing
system decreases to < 10\% for computations lasting only a few seconds.
Multilevel schedulers that transparently aggregate short computations can
improve utilization for these short computations to > 90\% for all four of the
schedulers that were tested.
","[{'version': 'v1', 'created': 'Mon, 8 May 2017 21:58:12 GMT'}]",2018-03-06,"[['Reuther', 'Albert', ''], ['Byun', 'Chansup', ''], ['Arcand', 'William', ''], ['Bestor', 'David', ''], ['Bergeron', 'Bill', ''], ['Hubbell', 'Matthew', ''], ['Jones', 'Michael', ''], ['Michaleas', 'Peter', ''], ['Prout', 'Andrew', ''], ['Rosa', 'Antonio', ''], ['Kepner', 'Jeremy', '']]","['Scheduler', 'resource manager', 'job scheduler', 'high performance computing', 'data analytics']"
4814,1902.06997,Dennis Sprute,"Dennis Sprute and Klaus T\""onnies and Matthias K\""onig","Interactive Restriction of a Mobile Robot's Workspace in a Smart Home
  Environment",Accepted in Journal of Ambient Intelligence and Smart Environments,,10.3233/AIS-190539,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Virtual borders are employed to allow humans the interactive and flexible
restriction of their mobile robots' workspaces in human-centered environments,
e.g. to exclude privacy zones from the workspace or to indicate certain areas
for working. They have been successfully specified in interaction processes
using methods from human-robot interaction. However, these methods often lack
an expressive feedback system, are restricted to robot's on-board interaction
capabilities and require a direct line of sight between human and robot. This
negatively affects the user experience and interaction time. Therefore, we
investigate the effect of a smart environment on the teaching of virtual
borders with the objective to enhance the perceptual and interaction
capabilities of a robot. For this purpose, we propose a novel interaction
method based on a laser pointer, that leverages a smart home environment in the
interaction process. This interaction method comprises an architecture for a
smart home environment designed to support the interaction process, the
cooperation of human, robot and smart environment in the interaction process, a
cooperative perception including stationary and mobile cameras to perceive
laser spots and an algorithm to extract virtual borders from multiple camera
observations. The results of an experimental evaluation support our hypotheses
that our novel interaction method features a significantly shorter interaction
time and a better user experience compared to an approach without support of a
smart environment. Moreover, the interaction method does not negatively affect
other user requirements concerning completeness and accuracy.
","[{'version': 'v1', 'created': 'Tue, 19 Feb 2019 11:15:10 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Oct 2019 09:50:09 GMT'}]",2019-10-29,"[['Sprute', 'Dennis', ''], ['Tönnies', 'Klaus', ''], ['König', 'Matthias', '']]","['Robot Workspace Restriction', 'Virtual Borders', 'Smart Home Environment', 'Network Robot System']"
4815,1902.06432,Ziqiang Cheng,"Ziqiang Cheng, Yang Yang, Chenhao Tan, Denny Cheng, Yueting Zhuang,
  Alex Cheng","What Makes a Good Team? A Large-scale Study on the Effect of Team
  Composition in Honor of Kings","11 pages, 10 figures, WWW'19 short paper",,10.1145/3308558.3313530,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Team composition is a central factor in determining the effectiveness of a
team. In this paper, we present a large-scale study on the effect of team
composition on multiple measures of team effectiveness. We use a dataset from
the largest multiplayer online battle arena (MOBA) game, Honor of Kings, with
96 million matches involving 100 million players. We measure team effectiveness
based on team performance (whether a team is going to win), team tenacity
(whether a team is going to surrender), and team rapport (whether a team uses
abusive language). Our results confirm the importance of team diversity and
show that diversity has varying effects on team effectiveness: although diverse
teams perform well and show tenacity in adversity, they are more likely to
abuse when losing than less diverse teams. Our study also contributes to the
situation vs. personality debate and show that abusive players tend to choose
the leading role and players do not become more abusive when taking such roles.
We further demonstrate the predictive power of features based on team
composition in prediction experiments.
","[{'version': 'v1', 'created': 'Mon, 18 Feb 2019 07:41:39 GMT'}]",2019-02-25,"[['Cheng', 'Ziqiang', ''], ['Yang', 'Yang', ''], ['Tan', 'Chenhao', ''], ['Cheng', 'Denny', ''], ['Zhuang', 'Yueting', ''], ['Cheng', 'Alex', '']]","['team composition', 'team performance', 'tenacity', 'toxic behavior', 'MOBA']"
4816,1410.6685,Christopher M. Poskitt,"Alexey Kolesnichenko, Christopher M. Poskitt, Sebastian Nanz, Bertrand
  Meyer",Contract-Based General-Purpose GPU Programming,,"Proc. International Conference on Generative Programming: Concepts
  and Experiences (GPCE 2015), pages 75-84. ACM, 2015",10.1145/2814204.2814216,,cs.DC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using GPUs as general-purpose processors has revolutionized parallel
computing by offering, for a large and growing set of algorithms, massive
data-parallelization on desktop machines. An obstacle to widespread adoption,
however, is the difficulty of programming them and the low-level control of the
hardware required to achieve good performance. This paper suggests a
programming library, SafeGPU, that aims at striking a balance between
programmer productivity and performance, by making GPU data-parallel operations
accessible from within a classical object-oriented programming language. The
solution is integrated with the design-by-contract approach, which increases
confidence in functional program correctness by embedding executable program
specifications into the program text. We show that our library leads to modular
and maintainable code that is accessible to GPGPU non-experts, while providing
performance that is comparable with hand-written CUDA code. Furthermore,
runtime contract checking turns out to be feasible, as the contracts can be
executed on the GPU.
","[{'version': 'v1', 'created': 'Fri, 24 Oct 2014 14:03:04 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Mar 2015 12:36:46 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Jun 2015 17:42:43 GMT'}, {'version': 'v4', 'created': 'Fri, 21 Aug 2015 16:15:39 GMT'}]",2015-10-14,"[['Kolesnichenko', 'Alexey', ''], ['Poskitt', 'Christopher M.', ''], ['Nanz', 'Sebastian', ''], ['Meyer', 'Bertrand', '']]","['GPGPU', 'parallel computing', 'runtime code generation', 'programming', 'object-orientation', 'design-by-contract', 'program correctness']"
4817,1406.0256,Wiseborn  Manfe Danquah,Wiseborn Manfe Danquah and Turgay D Altilar,"HYBRIST Mobility Model- A Novel Hybrid Mobility Model for VANET
  Simulations","International Journal of Computers Applications. 7 pages paper with
  10 figures presents a novel mobility model for VANET simulations which best
  suits the fast developing BRT system type of mobility in Vehicular
  communications systems","IJCA 86(14):15-21, January 2014",10.5120/15053-3408,"IJCA Journal, Volume 86, Number 14 Year of Publication: 2014",cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Simulations play a vital role in implementing, testing and validating
proposed algorithms and protocols in VANET. Mobility model, defined as the
movement pattern of vehicles, is one of the main factors that contribute
towards the efficient implementation of VANET algorithms and protocols. Using
near reality mobility models ensure that accurate results are obtained from
simulations. Mobility models that have been proposed and used to implement and
test VANET protocols and algorithms are either the urban mobility model or
highway mobility model. Algorithms and protocols implemented using urban or
highway mobility models may not produce accurate results in hybrid mobility
models without enhancement due to the vast differences in mobility patterns. It
is on this score the Hybrist, a novel hybrid mobility model is proposed. The
realistic mobility pattern trace file of the proposed Hybrist hybrid mobility
model can be imported to VANET simulators such as Veins and network simulators
such as ns2 and Qualnet to simulate VANET algorithms and protocols.
","[{'version': 'v1', 'created': 'Mon, 2 Jun 2014 06:24:15 GMT'}]",2014-06-03,"[['Danquah', 'Wiseborn Manfe', ''], ['Altilar', 'Turgay D', '']]","['VANET', 'mobility models', 'Urban Mobility Model', 'Highway Mobility Model', 'Hybrid Mobility Model', 'Istanbul BRT']"
4818,1209.2548,Sudarshan Nandy,"Sudarshan Nandy, Partha Pratim Sarkar and Achintya Das","Training a Feed-forward Neural Network with Artificial Bee Colony Based
  Backpropagation Method","14 Pages, 11 figures","International Journal of Computer Science & Information Technology
  (IJCSIT) Vol 4, No 4, 2012, 33-46",10.5121/ijcsit.2012.4404,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Back-propagation algorithm is one of the most widely used and popular
techniques to optimize the feed forward neural network training. Nature
inspired meta-heuristic algorithms also provide derivative-free solution to
optimize complex problem. Artificial bee colony algorithm is a nature inspired
meta-heuristic algorithm, mimicking the foraging or food source searching
behaviour of bees in a bee colony and this algorithm is implemented in several
applications for an improved optimized outcome. The proposed method in this
paper includes an improved artificial bee colony algorithm based
back-propagation neural network training method for fast and improved
convergence rate of the hybrid neural network learning method. The result is
analysed with the genetic algorithm based back-propagation method, and it is
another hybridized procedure of its kind. Analysis is performed over standard
data sets, reflecting the light of efficiency of proposed method in terms of
convergence speed and rate.
","[{'version': 'v1', 'created': 'Wed, 12 Sep 2012 10:25:51 GMT'}]",2012-09-13,"[['Nandy', 'Sudarshan', ''], ['Sarkar', 'Partha Pratim', ''], ['Das', 'Achintya', '']]","['Neural Network', 'Back-propagation Algorithm', 'Meta-heuristic algorithm']"
4819,1810.12123,Pengfei Xu,"Pengfei Xu, Jiaheng Lu",Efficient Taxonomic Similarity Joins with Adaptive Overlap Constraint,,,10.1145/3269206.3269236,,cs.IR cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A similarity join aims to find all similar pairs between two collections of
records. Established approaches usually deal with synthetic differences like
typos and abbreviations, but neglect the semantic relations between words. Such
relations, however, are helpful for obtaining high-quality joining results. In
this paper, we leverage the taxonomy knowledge (i.e., a set of IS-A
hierarchical relations) to define a similarity measure which finds
semantic-similar records from two datasets. Based on this measure, we develop a
similarity join algorithm with prefix filtering framework to prune away
irrelevant pairs effectively. Our technical contribution here is an algorithm
that judiciously selects critical parameters in a prefix filter to maximise its
filtering power, supported by an estimation technique and Monte Carlo
simulation process. Empirical experiments show that our proposed methods
exhibit high efficiency and scalability, outperforming the state-of-art by a
large margin.
","[{'version': 'v1', 'created': 'Mon, 29 Oct 2018 13:42:10 GMT'}]",2018-10-30,"[['Xu', 'Pengfei', ''], ['Lu', 'Jiaheng', '']]","['Similarity join', 'taxonomic similarity', 'prefix filtering', 'estimation']"
4820,1803.07696,Wanxin Jin,"Wanxin Jin, Dana Kuli\'c, Shaoshuai Mou, Sandra Hirche",Inverse Optimal Control from Incomplete Trajectory Observations,"Codes:
  https://github.com/wanxinjin/IOC-from-Incomplete-Trajectory-Observations","The International Journal of Robotics Research.
  2021;40(6-7):848-865",10.1177/0278364921996384,,cs.RO cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article develops a methodology that enables learning an objective
function of an optimal control system from incomplete trajectory observations.
The objective function is assumed to be a weighted sum of features (or basis
functions) with unknown weights, and the observed data is a segment of a
trajectory of system states and inputs. The proposed technique introduces the
concept of the recovery matrix to establish the relationship between any
available segment of the trajectory and the weights of given candidate
features. The rank of the recovery matrix indicates whether a subset of
relevant features can be found among the candidate features and the
corresponding weights can be learned from the segment data. The recovery matrix
can be obtained iteratively and its rank non-decreasing property shows that
additional observations may contribute to the objective learning. Based on the
recovery matrix, a method for using incomplete trajectory observations to learn
the weights of selected features is established, and an incremental inverse
optimal control algorithm is developed by automatically finding the minimal
required observation. The effectiveness of the proposed method is demonstrated
on a linear quadratic regulator system and a simulated robot manipulator.
","[{'version': 'v1', 'created': 'Wed, 21 Mar 2018 00:04:19 GMT'}, {'version': 'v2', 'created': 'Thu, 23 May 2019 18:24:35 GMT'}, {'version': 'v3', 'created': 'Mon, 31 Aug 2020 12:58:23 GMT'}, {'version': 'v4', 'created': 'Fri, 22 Jan 2021 04:10:18 GMT'}]",2021-05-07,"[['Jin', 'Wanxin', ''], ['Kulić', 'Dana', ''], ['Mou', 'Shaoshuai', ''], ['Hirche', 'Sandra', '']]","['Inverse optimal control', 'inverse reinforcement learning', 'incomplete trajectory observations', 'objective learning']"
4821,1911.12079,Jeremy Van Den Eynde,"Jeremy Van den Eynde, Chris Blondia",Token Bucket-based Throughput Constraining in Cross-layer Schedulers,"11 pages, 10 figures. Presented at 6th International Conference on
  Computer Science, Engineering and Information. Published in AIRCC
  http://airccse.org/csit/V9N13.html","AIRCC Publishing Corporation, Computer Science, Engineering and
  Information Technology (CSEIT-2019), Volume 9, Number 13, Year 2019, pp.
  209-219. ISBN: 978-1-925953-09-1",10.5121/csit.2019.91318,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  In this paper we consider upper and lower constraining users' service rates
in a slotted, cross-layer scheduler context. Such schedulers often cannot
guarantee these bounds, despite the usefulness in adhering to Quality of
Service (QoS) requirements, aiding the admission control system or providing
different levels of service to users. We approach this problem with a
low-complexity algorithm that is easily integrated in any utility
function-based cross-layer scheduler. The algorithm modifies the weights of the
associated Network Utility Maximization problem, rather than for example
applying a token bucket to the scheduler's output or adding constraints in the
physical layer. We study the efficacy of the algorithm through simulations with
various schedulers from literature and mixes of traffic. The metrics we
consider show that we can bound the average service rate within about five
slots, for most schedulers. Schedulers whose weight is very volatile are more
difficult to constrain.
","[{'version': 'v1', 'created': 'Wed, 27 Nov 2019 11:15:47 GMT'}]",2019-11-28,"[['Eynde', 'Jeremy Van den', ''], ['Blondia', 'Chris', '']]","['Cross-layer Scheduling', 'Quality of Service', 'Token Buckets', 'Resource allocation']"
4822,1803.03479,Maarten Bieshaar,"Maarten Bieshaar and G\""unther Reitberger and Viktor Kre{\ss} and
  Stefan Zernetsch and Konrad Doll and Erich Fuchs and Bernhard Sick","Highly Automated Learning for Improved Active Safety of Vulnerable Road
  Users","4 pages, 1 figure","published in ACM Chapters Computer Science in Cars Symposium
  (CSCS-17). Munich, Germany. 2017",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Highly automated driving requires precise models of traffic participants.
Many state of the art models are currently based on machine learning
techniques. Among others, the required amount of labeled data is one major
challenge. An autonomous learning process addressing this problem is proposed.
The initial models are iteratively refined in three steps: (1) detection and
context identification, (2) novelty detection and active learning and (3)
online model adaption.
","[{'version': 'v1', 'created': 'Fri, 9 Mar 2018 11:57:36 GMT'}]",2018-03-12,"[['Bieshaar', 'Maarten', ''], ['Reitberger', 'Günther', ''], ['Kreß', 'Viktor', ''], ['Zernetsch', 'Stefan', ''], ['Doll', 'Konrad', ''], ['Fuchs', 'Erich', ''], ['Sick', 'Bernhard', '']]","['Highly automated driving', 'vulnerable road users', 'high-accuracy maps', 'machine learning', 'VRU safety', 'VRU detection', 'prediction methods']"
4823,0803.2975,Uwe Aickelin,Uwe Aickelin and Jingpeng Li,An Estimation of Distribution Algorithm for Nurse Scheduling,,"Annals of Operations Research, 155 (1), pp 289-309, 2007",10.1007/s10479-007-0214-0,,cs.NE cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Schedules can be built in a similar way to a human scheduler by using a set
of rules that involve domain knowledge. This paper presents an Estimation of
Distribution Algorithm (eda) for the nurse scheduling problem, which involves
choosing a suitable scheduling rule from a set for the assignment of each
nurse. Unlike previous work that used Genetic Algorithms (ga) to implement
implicit learning, the learning in the proposed algorithm is explicit, i.e. we
identify and mix building blocks directly. The eda is applied to implement such
explicit learning by building a Bayesian network of the joint distribution of
solutions. The conditional probability of each variable in the network is
computed according to an initial set of promising solutions. Subsequently, each
new instance for each variable is generated by using the corresponding
conditional probabilities, until all variables have been generated, i.e. in our
case, a new rule string has been obtained. Another set of rule strings will be
generated in this way, some of which will replace previous strings based on
fitness selection. If stopping conditions are not met, the conditional
probabilities for all nodes in the Bayesian network are updated again using the
current set of promising rule strings. Computational results from 52 real data
instances demonstrate the success of this approach. It is also suggested that
the learning mechanism in the proposed approach might be suitable for other
scheduling problems.
","[{'version': 'v1', 'created': 'Thu, 20 Mar 2008 12:07:26 GMT'}, {'version': 'v2', 'created': 'Fri, 16 May 2008 10:46:10 GMT'}]",2010-07-05,"[['Aickelin', 'Uwe', ''], ['Li', 'Jingpeng', '']]","['estimation of distribution algorithms', 'Bayesian network', 'nurse scheduling']"
4824,1709.07794,Ribana Roscher,"Ron Hagensieker, Ribana Roscher, Johannes Rosentreter, Benjamin
  Jakimow, Bj\""orn Waske","Tropical Land Use Land Cover Mapping in Par\'{a} (Brazil) using
  Discriminative Markov Random Fields and Multi-temporal TerraSAR-X Data",,"International Journal of Applied Earth Observation and
  Geoinformation, Volume 63, December 2017, Pages 244-256",10.1016/j.jag.2017.07.019,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Remote sensing satellite data offer the unique possibility to map land use
land cover transformations by providing spatially explicit information.
However, detection of short-term processes and land use patterns of high
spatial-temporal variability is a challenging task. We present a novel
framework using multi-temporal TerraSAR-X data and machine learning techniques,
namely Discriminative Markov Random Fields with spatio-temporal priors, and
Import Vector Machines, in order to advance the mapping of land cover
characterized by short-term changes. Our study region covers a current
deforestation frontier in the Brazilian state Par\'{a} with land cover
dominated by primary forests, different types of pasture land and secondary
vegetation, and land use dominated by short-term processes such as
slash-and-burn activities. The data set comprises multi-temporal TerraSAR-X
imagery acquired over the course of the 2014 dry season, as well as optical
data (RapidEye, Landsat) for reference. Results show that land use land cover
is reliably mapped, resulting in spatially adjusted overall accuracies of up to
$79\%$ in a five class setting, yet limitations for the differentiation of
different pasture types remain. The proposed method is applicable on
multi-temporal data sets, and constitutes a feasible approach to map land use
land cover in regions that are affected by high-frequent temporal changes.
","[{'version': 'v1', 'created': 'Fri, 22 Sep 2017 14:53:56 GMT'}]",2017-09-25,"[['Hagensieker', 'Ron', ''], ['Roscher', 'Ribana', ''], ['Rosentreter', 'Johannes', ''], ['Jakimow', 'Benjamin', ''], ['Waske', 'Björn', '']]","['Markov Random Fields (MRF)', 'Import Vector Machines (IVM)', 'Multi-temporal LULC']"
4825,0803.2969,Uwe Aickelin,Uwe Aickelin and Kathryn Dowsland,An Indirect Genetic Algorithm for a Nurse Scheduling Problem,,"Computers & Operations Research, 31(5), pp 761-778, 2004",10.1016/S0305-0548(03)00034-0,,cs.NE cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a Genetic Algorithms approach to a manpower-scheduling
problem arising at a major UK hospital. Although Genetic Algorithms have been
successfully used for similar problems in the past, they always had to overcome
the limitations of the classical Genetic Algorithms paradigm in handling the
conflict between objectives and constraints. The approach taken here is to use
an indirect coding based on permutations of the nurses, and a heuristic decoder
that builds schedules from these permutations. Computational experiments based
on 52 weeks of live data are used to evaluate three different decoders with
varying levels of intelligence, and four well-known crossover operators.
Results are further enhanced by introducing a hybrid crossover operator and by
making use of simple bounds to reduce the size of the solution space. The
results reveal that the proposed algorithm is able to find high quality
solutions and is both faster and more flexible than a recently published Tabu
Search approach.
","[{'version': 'v1', 'created': 'Thu, 20 Mar 2008 11:21:19 GMT'}]",2010-07-05,"[['Aickelin', 'Uwe', ''], ['Dowsland', 'Kathryn', '']]","['Genetic Algorithms', 'Heuristics', 'Manpower Scheduling']"
4826,1911.13181,Cheonbok  Park,"Cheonbok Park, Chunggi Lee, Hyojin Bahng, Yunwon Tae, Kihwan Kim,
  Seungmin Jin, Sungahn Ko and Jaegul Choo","ST-GRAT: A Novel Spatio-temporal Graph Attention Network for Accurately
  Forecasting Dynamically Changing Road Speed",to be published in CIKM-2020,,10.1145/3340531.3411940,,cs.LG eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predicting road traffic speed is a challenging task due to different types of
roads, abrupt speed change and spatial dependencies between roads; it requires
the modeling of dynamically changing spatial dependencies among roads and
temporal patterns over long input sequences. This paper proposes a novel
spatio-temporal graph attention (ST-GRAT) that effectively captures the
spatio-temporal dynamics in road networks. The novel aspects of our approach
mainly include spatial attention, temporal attention, and spatial sentinel
vectors. The spatial attention takes the graph structure information (e.g.,
distance between roads) and dynamically adjusts spatial correlation based on
road states. The temporal attention is responsible for capturing traffic speed
changes, and the sentinel vectors allow the model to retrieve new features from
spatially correlated nodes or preserve existing features. The experimental
results show that ST-GRAT outperforms existing models, especially in difficult
conditions where traffic speeds rapidly change (e.g., rush hours). We
additionally provide a qualitative study to analyze when and where ST-GRAT
tended to make accurate predictions during rush-hour times.
","[{'version': 'v1', 'created': 'Fri, 29 Nov 2019 16:32:51 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Oct 2020 16:03:52 GMT'}]",2020-10-21,"[['Park', 'Cheonbok', ''], ['Lee', 'Chunggi', ''], ['Bahng', 'Hyojin', ''], ['Tae', 'Yunwon', ''], ['Kim', 'Kihwan', ''], ['Jin', 'Seungmin', ''], ['Ko', 'Sungahn', ''], ['Choo', 'Jaegul', '']]","['traffic prediction', 'graph neural networks', 'spatial-temporal modeling', 'attention networks', 'time-series prediction']"
4827,1610.03052,Lihao Liang,"Lihao Liang, Paul E. McKenney, Daniel Kroening, Tom Melham","Verification of the Tree-Based Hierarchical Read-Copy Update in the
  Linux Kernel","This is a long version of a conference paper published in the 2018
  Design, Automation and Test in Europe Conference (DATE)","Design, Automation and Test in Europe Conference (2018): 61-66",10.23919/DATE.2018.8341980,,cs.LO cs.DC cs.OS cs.SE,http://creativecommons.org/licenses/by-sa/4.0/,"  Read-Copy Update (RCU) is a scalable, high-performance Linux-kernel
synchronization mechanism that runs low-overhead readers concurrently with
updaters. Production-quality RCU implementations for multi-core systems are
decidedly non-trivial. Giving the ubiquity of Linux, a rare ""million-year"" bug
can occur several times per day across the installed base. Stringent validation
of RCU's complex behaviors is thus critically important. Exhaustive testing is
infeasible due to the exponential number of possible executions, which suggests
use of formal verification.
  Previous verification efforts on RCU either focus on simple implementations
or use modeling languages, the latter requiring error-prone manual translation
that must be repeated frequently due to regular changes in the Linux kernel's
RCU implementation. In this paper, we first describe the implementation of Tree
RCU in the Linux kernel. We then discuss how to construct a model directly from
Tree RCU's source code in C, and use the CBMC model checker to verify its
safety and liveness properties. To our best knowledge, this is the first
verification of a significant part of RCU's source code, and is an important
step towards integration of formal verification into the Linux kernel's
regression test suite.
","[{'version': 'v1', 'created': 'Mon, 10 Oct 2016 19:59:32 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Jan 2018 17:15:33 GMT'}, {'version': 'v3', 'created': 'Thu, 22 Nov 2018 17:40:49 GMT'}]",2018-11-27,"[['Liang', 'Lihao', ''], ['McKenney', 'Paul E.', ''], ['Kroening', 'Daniel', ''], ['Melham', 'Tom', '']]","['Software Verification', 'Parallel Computing', 'ReadCopy Update', 'Linux Kernel']"
4828,1801.04433,Heri Ramampiaro,Georgios K. Pitsilis and Heri Ramampiaro and Helge Langseth,Detecting Offensive Language in Tweets Using Deep Learning,,"Applied Intelligence, 48(12), 4730-4742 (2018)",10.1007/s10489-018-1242-y,,cs.CL cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the important problem of discerning hateful content in
social media. We propose a detection scheme that is an ensemble of Recurrent
Neural Network (RNN) classifiers, and it incorporates various features
associated with user-related information, such as the users' tendency towards
racism or sexism. These data are fed as input to the above classifiers along
with the word frequency vectors derived from the textual content. Our approach
has been evaluated on a publicly available corpus of 16k tweets, and the
results demonstrate its effectiveness in comparison to existing state of the
art solutions. More specifically, our scheme can successfully distinguish
racism and sexism messages from normal text, and achieve higher classification
quality than current state-of-the-art algorithms.
","[{'version': 'v1', 'created': 'Sat, 13 Jan 2018 12:58:43 GMT'}]",2019-07-05,"[['Pitsilis', 'Georgios K.', ''], ['Ramampiaro', 'Heri', ''], ['Langseth', 'Helge', '']]","['Text classification', 'micro-blogging', 'hate-speech', 'deep learning', 'recurrentneural networks', 'Twitter']"
4829,2003.12961,Dilip Singh Sisodia,Abinash Pujahari and Dilip Singh Sisodia,Clickbait Detection using Multiple Categorization Techniques,"11 pages, 7 figures, 4 tables to be published in Journal of
  Information Science",2019,10.1177/0165551519871822,,cs.SI cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clickbaits are online articles with deliberately designed misleading titles
for luring more and more readers to open the intended web page. Clickbaits are
used to tempted visitors to click on a particular link either to monetize the
landing page or to spread the false news for sensationalization. The presence
of clickbaits on any news aggregator portal may lead to unpleasant experience
to readers. Automatic detection of clickbait headlines from news headlines has
been a challenging issue for the machine learning community. A lot of methods
have been proposed for preventing clickbait articles in recent past. However,
the recent techniques available in detecting clickbaits are not much robust.
This paper proposes a hybrid categorization technique for separating clickbait
and non-clickbait articles by integrating different features, sentence
structure, and clustering. During preliminary categorization, the headlines are
separated using eleven features. After that, the headlines are recategorized
using sentence formality, syntactic similarity measures. In the last phase, the
headlines are again recategorized by applying clustering using word vector
similarity based on t-Stochastic Neighbourhood Embedding (t-SNE) approach.
After categorization of these headlines, machine learning models are applied to
the data set to evaluate machine learning algorithms. The obtained experimental
results indicate the proposed hybrid model is more robust, reliable and
efficient than any individual categorization techniques for the real-world
dataset we used.
","[{'version': 'v1', 'created': 'Sun, 29 Mar 2020 07:16:41 GMT'}]",2020-03-31,"[['Pujahari', 'Abinash', ''], ['Sisodia', 'Dilip Singh', '']]","['Clickbait', 'Word Vector', 'Classification', 'Sentence Structure', 'Clustering']"
4830,cs/0405006,Docteur Gregory Mounie,"Pierre-Francois Dutot (ID - IMAG), Lionel Eyraud (ID - IMAG),
  Gr\'egory Mouni\'e (ID - IMAG), Denis Trystram (ID - IMAG)",Bi-criteria Algorithm for Scheduling Jobs on Cluster Platforms,,"ACM Symposium on Parallel Algorithms and Architectures (2004)
  125-132",,,cs.DC cs.DS,,"  We describe in this paper a new method for building an efficient algorithm
for scheduling jobs in a cluster. Jobs are considered as parallel tasks (PT)
which can be scheduled on any number of processors. The main feature is to
consider two criteria that are optimized together. These criteria are the
makespan and the weighted minimal average completion time (minsum). They are
chosen for their complementarity, to be able to represent both user-oriented
objectives and system administrator objectives. We propose an algorithm based
on a batch policy with increasing batch sizes, with a smart selection of jobs
in each batch. This algorithm is assessed by intensive simulation results,
compared to a new lower bound (obtained by a relaxation of ILP) of the optimal
schedules for both criteria separately. It is currently implemented in an
actual real-size cluster platform.
","[{'version': 'v1', 'created': 'Tue, 4 May 2004 14:51:55 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Oct 2004 13:06:35 GMT'}, {'version': 'v3', 'created': 'Thu, 20 Jan 2005 15:52:59 GMT'}]",2016-08-16,"[['Dutot', 'Pierre-Francois', '', 'ID - IMAG'], ['Eyraud', 'Lionel', '', 'ID - IMAG'], ['Mounié', 'Grégory', '', 'ID - IMAG'], ['Trystram', 'Denis', '', 'ID - IMAG']]","['Parallel Computing', 'Algorithms', 'Scheduling', 'Parallel Tasks', 'Moldable Tasks', 'Bi-criteria']"
4831,1703.04518,The-Hien Dang-Ha,"Steinar Kristoffersen, The-Hien Dang-Ha, Thien-Phuc Nguyen","Paperstack - A Novel Lean-Interactive System for Documentation Sharing
  in Maritime Industries","7 pages, 5 figures, International Conference on Collaboration
  Technologies and Systems (CTS), IEEE, 2013",,10.1109/CTS.2013.6567285,,cs.CY cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper defines a new domain for collaborative systems and technologies
research: inter-organizational lean-interactive systems engineering. It departs
from the problems pertaining to large-scale, technically demanding one-off
construction projects, such as in our case studies, the building of specialized
offshore service vessels. The requirements are unique, as are the explicit
ambitions to be ""lean"", in other words, avoid waste and re-engineering by
making sure that the process is customer-driven and rational. Emphasis is on
efficiency rather than effectiveness. This set-up poses new demands to the
collaborative systems and technologies, which we in this paper have addressed
with the design of a new type of Documentation-emtric ERP, which we have called
""Paperstack"". The ambition is to support inter-organizational lean-interactive
systems engineering in an integrated platform, and the next step for our
research, naturally, is to put the systems into factual use. This paper
summarizes the design ideas.
","[{'version': 'v1', 'created': 'Tue, 7 Mar 2017 17:29:38 GMT'}]",2017-03-14,"[['Kristoffersen', 'Steinar', ''], ['Dang-Ha', 'The-Hien', ''], ['Nguyen', 'Thien-Phuc', '']]","['Collaborative construction and engineering', 'documentation sharing', 'lean-interactive system', 'maritime industry']"
4832,1902.00127,Shehroz Khan,"Amir Ahmad, Shehroz S. Khan","initKmix -- A Novel Initial Partition Generation Algorithm for
  Clustering Mixed Data using k-means-based Clustering","41 page, 3 Figures, 19 Tables, 5 Algorithms",,10.13140/RG.2.2.21979.62244,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mixed datasets consist of both numeric and categorical attributes. Various
k-means-based clustering algorithms have been developed for these datasets.
Generally, these algorithms use random partition as a starting point, which
tends to produce different clustering results for different runs. In this
paper, we propose, initKmix, a novel algorithm for finding an initial partition
for k-means-based clustering algorithms for mixed datasets. In the initKmix
algorithm, a k-means-based clustering algorithm is run many times, and in each
run, one of the attributes is used to create initial clusters for that run. The
clustering results of various runs are combined to produce the initial
partition. This initial partition is then used as a seed to a k-means-based
clustering algorithm to cluster mixed data. Experiments with various
categorical and mixed datasets showed that initKmix produced accurate and
consistent results, and outperformed the random initial partition method and
other state-of-the-art initialization methods. Experiments also showed that
k-means-based clustering for mixed datasets with initKmix performed similar to
or better than many state-of-the-art clustering algorithms for categorical and
mixed datasets.
","[{'version': 'v1', 'created': 'Thu, 31 Jan 2019 23:32:31 GMT'}, {'version': 'v2', 'created': 'Sun, 14 Apr 2019 09:34:25 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Jul 2020 21:13:30 GMT'}]",2020-07-24,"[['Ahmad', 'Amir', ''], ['Khan', 'Shehroz S.', '']]","['Mixed data', 'Clustering', 'K-means', 'Initialization', 'Random']"
4833,1807.06051,Fran\c{c}ois Bry,Fran\c{c}ois Bry,"In Praise of Impredicativity: A Contribution to the Formalisation of
  Meta-Programming","Under consideration for publication in Theory and Practice of Logic
  Programming","Theory and Practice of Logic Programming, pages 1-48, 25 February
  2019",10.1017/S1471068419000024,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Processing programs as data is one of the successes of functional and logic
programming. Higher-order functions, as program-processing programs are called
in functional programming, and meta-programs, as they are called in logic
programming, are widespread declarative programming techniques. In logic
programming, there is a gap between the meta-programming practice and its
theory: The formalisations of meta-programming do not explicitly address its
impredicativity and are not fully adequate. This article aims at overcoming
this unsatisfactory situation by discussing the relevance of impredicativity to
meta-programming, by revisiting former formalisations of meta-programming and
by defining Reflective Predicate Logic, a conservative extension of first-order
logic, which provides a simple formalisation of meta-programming.
","[{'version': 'v1', 'created': 'Mon, 16 Jul 2018 18:36:46 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Nov 2018 13:40:56 GMT'}, {'version': 'v3', 'created': 'Fri, 11 Jan 2019 16:49:05 GMT'}, {'version': 'v4', 'created': 'Sat, 18 Apr 2020 07:54:33 GMT'}]",2020-04-21,"[['Bry', 'François', '']]","['Logic Programming', 'Meta-Programming', 'Model Theory', 'Barber Paradox', 'Russell’s Paradox', 'Reflection']"
4834,1706.07181,Mattia Mazzoli,Mattia Mazzoli and Angel Sanchez,"Equilibria, information and frustration in heterogeneous network games
  with conflicting preferences","23 pages, 14 figures",,10.1088/1742-5468/aa9347,,cs.GT cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interactions between people are the basis on which the structure of our
society arises as a complex system and, at the same time, are the starting
point of any physical description of it. In the last few years, much
theoretical research has addressed this issue by combining the physics of
complex networks with a description of interactions in terms of evolutionary
game theory. We here take this research a step further by introducing a most
salient societal factor such as the individuals' preferences, a characteristic
that is key to understand much of the social phenomenology these days. We
consider a heterogeneous, agent-based model in which agents interact
strategically with their neighbors but their preferences and payoffs for the
possible actions differ. We study how such a heterogeneous network behaves
under evolutionary dynamics and different strategic interactions, namely
coordination games and best shot games. With this model we study the emergence
of the equilibria predicted analytically in random graphs under best response
dynamics, and we extend this test to unexplored contexts like proportional
imitation and scale free networks. We show that some theoretically predicted
equilibria do not arise in simulations with incomplete Information, and we
demonstrate the importance of the graph topology and the payoff function
parameters for some games. Finally, we discuss our results with available
experimental evidence on coordination games, showing that our model agrees
better with the experiment that standard economic theories, and draw hints as
to how to maximize social efficiency in situations of conflicting preferences.
","[{'version': 'v1', 'created': 'Thu, 22 Jun 2017 07:05:37 GMT'}]",2017-12-06,"[['Mazzoli', 'Mattia', ''], ['Sanchez', 'Angel', '']]","['agents', 'agent', 'coordination', 'proportional imitation', 'best response', 'network', 'scalefree']"
4835,1601.08158,Miguel Cazorla Dr.,"Jes\'us Mart\'inez-G\'omez, Vicente Morell, Miguel Cazorla, Ismael
  Garc\'ia-Varea",Semantic Localization in the PCL library,"19 pages, 6 figures, ISSN 0921-8890","Robotics and Autonomous Systems, Volume 75, Part B, January 2016,
  Pages 641-648",10.1016/j.robot.2015.09.006,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The semantic localization problem in robotics consists in determining the
place where a robot is located by means of semantic categories. The problem is
usually addressed as a supervised classification process, where input data
correspond to robot perceptions while classes to semantic categories, like
kitchen or corridor.
  In this paper we propose a framework, implemented in the PCL library, which
provides a set of valuable tools to easily develop and evaluate semantic
localization systems. The implementation includes the generation of 3D global
descriptors following a Bag-of-Words approach. This allows the generation of
dimensionality-fixed descriptors from any type of keypoint detector and feature
extractor combinations. The framework has been designed, structured and
implemented in order to be easily extended with different keypoint detectors,
feature extractors as well as classification models.
  The proposed framework has also been used to evaluate the performance of a
set of already implemented descriptors, when used as input for a specific
semantic localization system. The results obtained are discussed paying special
attention to the internal parameters of the BoW descriptor generation process.
Moreover, we also review the combination of some keypoint detectors with
different 3D descriptor generation techniques.
","[{'version': 'v1', 'created': 'Fri, 29 Jan 2016 15:38:12 GMT'}]",2016-02-01,"[['Martínez-Gómez', 'Jesús', ''], ['Morell', 'Vicente', ''], ['Cazorla', 'Miguel', ''], ['García-Varea', 'Ismael', '']]","['Semantic Localization', 'PCL', '3D features', 'classification']"
4836,1609.00511,Mostafa Dehghani,"Mostafa Dehghani, Hosein Azarbonyad, Jaap Kamps, Maarten Marx",Generalized Group Profiling for Content Customization,"Short paper (4 pages) published in proceedings of ACM SIGIR
  Conference on Human Information Interaction and Retrieval (CHIIR'16)",,10.1145/2854946.2855003,,cs.IR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is an ongoing debate on personalization, adapting results to the unique
user exploiting a user's personal history, versus customization, adapting
results to a group profile sharing one or more characteristics with the user at
hand. Personal profiles are often sparse, due to cold start problems and the
fact that users typically search for new items or information, necessitating to
back-off to customization, but group profiles often suffer from accidental
features brought in by the unique individual contributing to the group. In this
paper we propose a generalized group profiling approach that teases apart the
exact contribution of the individual user level and the ""abstract"" group level
by extracting a latent model that captures all, and only, the essential
features of the whole group. Our main findings are the followings. First, we
propose an efficient way of group profiling which implicitly eliminates the
general and specific features from users' models in a group and takes out the
abstract model representing the whole group. Second, we employ the resulting
models in the task of contextual suggestion. We analyse different grouping
criteria and we find that group-based suggestions improve the customization.
Third, we see that the granularity of groups affects the quality of group
profiling. We observe that grouping approach should compromise between the
level of customization and groups' size.
","[{'version': 'v1', 'created': 'Fri, 2 Sep 2016 09:14:07 GMT'}]",2016-09-05,"[['Dehghani', 'Mostafa', ''], ['Azarbonyad', 'Hosein', ''], ['Kamps', 'Jaap', ''], ['Marx', 'Maarten', '']]","['Group Profiling', 'Contextual Suggestion', 'ContentCustomization']"
4837,1304.2263,Alexander Barg,"Alexander Barg, Luciano V. Felix, Marcelo Firer, and Marcos V.P.
  Spreafico",Linear codes on posets with extension property,Final version; 18pp,"Discrete Mathematics, vol. 317, 2014, pp. 1-13",10.1016/j.disc.2013.11.001,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate linear and additive codes in partially ordered Hamming-like
spaces that satisfy the extension property, meaning that automorphisms of
ideals extend to automorphisms of the poset. The codes are naturally described
in terms of translation association schemes that originate from the groups of
linear isometries of the space. We address questions of duality and invariants
of codes, establishing a connection between the dual association scheme and the
scheme defined on the dual poset (they are isomorphic if and only if the poset
is self-dual). We further discuss invariants that play the role of weight
enumerators of codes in the poset case. In the case of regular rooted trees
such invariants are linked to the classical problem of tree isomorphism. We
also study the question of whether these invariants are preserved under
standard operations on posets such as the ordinal sum and the like.
","[{'version': 'v1', 'created': 'Mon, 8 Apr 2013 16:40:47 GMT'}, {'version': 'v2', 'created': 'Wed, 29 May 2013 21:34:36 GMT'}, {'version': 'v3', 'created': 'Tue, 17 Dec 2013 04:56:35 GMT'}]",2013-12-18,"[['Barg', 'Alexander', ''], ['Felix', 'Luciano V.', ''], ['Firer', 'Marcelo', ''], ['Spreafico', 'Marcos V. P.', '']]","['Poset codes', 'Association schemes', 'MacWilliams relations']"
4838,1509.08563,EPTCS,"Diego Latella (CNR/ISTI, Pisa), Mieke Massink (CNR/ISTI, Pisa), Erik
  de Vink (TU/e, Eindhoven)",A Definition Scheme for Quantitative Bisimulation,"In Proceedings QAPL 2015, arXiv:1509.08169","EPTCS 194, 2015, pp. 63-78",10.4204/EPTCS.194.5,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  FuTS, state-to-function transition systems are generalizations of labeled
transition systems and of familiar notions of quantitative semantical models as
continuous-time Markov chains, interactive Markov chains, and Markov automata.
A general scheme for the definition of a notion of strong bisimulation
associated with a FuTS is proposed. It is shown that this notion of
bisimulation for a FuTS coincides with the coalgebraic notion of behavioral
equivalence associated to the functor on Set given by the type of the FuTS. For
a series of concrete quantitative semantical models the notion of bisimulation
as reported in the literature is proven to coincide with the notion of
quantitative bisimulation obtained from the scheme. The comparison includes
models with orthogonal behaviour, like interactive Markov chains, and with
multiple levels of behavior, like Markov automata. As a consequence of the
general result relating FuTS bisimulation and behavioral equivalence we obtain,
in a systematic way, a coalgebraic underpinning of all quantitative
bisimulations discussed.
","[{'version': 'v1', 'created': 'Tue, 29 Sep 2015 02:10:46 GMT'}]",2015-09-30,"[['Latella', 'Diego', '', 'CNR/ISTI, Pisa'], ['Massink', 'Mieke', '', 'CNR/ISTI, Pisa'], ['de Vink', 'Erik', '', 'TU/e, Eindhoven']]","['quantitative automata', 'state-to-function transition system', 'bisimulation']"
4839,1804.08986,Fabian Mager,"Fabian Mager, Dominik Baumann, Romain Jacob, Lothar Thiele, Sebastian
  Trimpe, Marco Zimmerling","Feedback Control Goes Wireless: Guaranteed Stability over Low-power
  Multi-hop Networks","Accepted final version to appear in: 10th ACM/IEEE International
  Conference on Cyber-Physical Systems (with CPS-IoT Week 2019) (ICCPS '19),
  April 16--18, 2019, Montreal, QC, Canada",,10.1145/3302509.3311046,,cs.NI cs.MA cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Closing feedback loops fast and over long distances is key to emerging
applications; for example, robot motion control and swarm coordination require
update intervals of tens of milliseconds. Low-power wireless technology is
preferred for its low cost, small form factor, and flexibility, especially if
the devices support multi-hop communication. So far, however, feedback control
over wireless multi-hop networks has only been shown for update intervals on
the order of seconds. This paper presents a wireless embedded system that tames
imperfections impairing control performance (e.g., jitter and message loss),
and a control design that exploits the essential properties of this system to
provably guarantee closed-loop stability for physical processes with linear
time-invariant dynamics. Using experiments on a cyber-physical testbed with 20
wireless nodes and multiple cart-pole systems, we are the first to demonstrate
and evaluate feedback control and coordination over wireless multi-hop networks
for update intervals of 20 to 50 milliseconds.
","[{'version': 'v1', 'created': 'Tue, 24 Apr 2018 12:27:20 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Nov 2018 10:21:55 GMT'}, {'version': 'v3', 'created': 'Sun, 17 Feb 2019 19:21:28 GMT'}, {'version': 'v4', 'created': 'Tue, 19 Feb 2019 07:40:44 GMT'}]",2019-02-20,"[['Mager', 'Fabian', ''], ['Baumann', 'Dominik', ''], ['Jacob', 'Romain', ''], ['Thiele', 'Lothar', ''], ['Trimpe', 'Sebastian', ''], ['Zimmerling', 'Marco', '']]","['Wireless control', 'Closed-loop stability', 'Multi-agent systems', 'Multihop networks', 'Synchronous transmissions', 'Cyber-physical systems']"
4840,1803.05233,Anas Shatnawi,"Anas Shatnawi, Matteo Orr\`u, Marco Mobilio, Oliviero Riganelli,
  Leonardo Mariani","CloudHealth: A Model-Driven Approach to Watch the Health of Cloud
  Services","8 pages, 2 figures, 1 table",,10.1145/3194124.3194130,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud systems are complex and large systems where services provided by
different operators must coexist and eventually cooperate. In such a complex
environment, controlling the health of both the whole environment and the
individual services is extremely important to timely and effectively react to
misbehaviours, unexpected events, and failures. Although there are solutions to
monitor cloud systems at different granularity levels, how to relate the many
KPIs that can be collected about the health of the system and how health
information can be properly reported to operators are open questions. This
paper reports the early results we achieved in the challenge of monitoring the
health of cloud systems. In particular we present CloudHealth, a model-based
health monitoring approach that can be used by operators to watch specific
quality attributes. The CloudHealth Monitoring Model describes how to
operationalize high level monitoring goals by dividing them into subgoals,
deriving metrics for the subgoals, and using probes to collect the metrics. We
use the CloudHealth Monitoring Model to control the probes that must be
deployed on the target system, the KPIs that are dynamically collected, and the
visualization of the data in dashboards.
","[{'version': 'v1', 'created': 'Wed, 14 Mar 2018 12:21:49 GMT'}]",2018-03-15,"[['Shatnawi', 'Anas', ''], ['Orrù', 'Matteo', ''], ['Mobilio', 'Marco', ''], ['Riganelli', 'Oliviero', ''], ['Mariani', 'Leonardo', '']]","['Monitoring', 'cloud service', 'monitoring model', 'quality model', 'software health', 'metrics', 'KPI']"
4841,1902.02078,Satya Almasian,"Satya Almasian, Andreas Spitz, and Michael Gertz",Word Embeddings for Entity-annotated Texts,"This paper is accepted in 41st European Conference on Information
  Retrieval",,10.1007/978-3-030-15712-8_20,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learned vector representations of words are useful tools for many information
retrieval and natural language processing tasks due to their ability to capture
lexical semantics. However, while many such tasks involve or even rely on named
entities as central components, popular word embedding models have so far
failed to include entities as first-class citizens. While it seems intuitive
that annotating named entities in the training corpus should result in more
intelligent word features for downstream tasks, performance issues arise when
popular embedding approaches are naively applied to entity annotated corpora.
Not only are the resulting entity embeddings less useful than expected, but one
also finds that the performance of the non-entity word embeddings degrades in
comparison to those trained on the raw, unannotated corpus. In this paper, we
investigate approaches to jointly train word and entity embeddings on a large
corpus with automatically annotated and linked entities. We discuss two
distinct approaches to the generation of such embeddings, namely the training
of state-of-the-art embeddings on raw-text and annotated versions of the
corpus, as well as node embeddings of a co-occurrence graph representation of
the annotated corpus. We compare the performance of annotated embeddings and
classical word embeddings on a variety of word similarity, analogy, and
clustering evaluation tasks, and investigate their performance in
entity-specific tasks. Our findings show that it takes more than training
popular word embedding models on an annotated corpus to create entity
embeddings with acceptable performance on common test cases. Based on these
results, we discuss how and when node embeddings of the co-occurrence graph
representation of the text can restore the performance.
","[{'version': 'v1', 'created': 'Wed, 6 Feb 2019 09:21:55 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Mar 2019 14:29:14 GMT'}, {'version': 'v3', 'created': 'Wed, 12 Feb 2020 10:22:08 GMT'}]",2020-02-13,"[['Almasian', 'Satya', ''], ['Spitz', 'Andreas', ''], ['Gertz', 'Michael', '']]","['word embeddings', 'entity embeddings', 'entity graph']"
4842,1610.07086,Gwenole Quellec,"Gwenol\'e Quellec, Katia Charri\`ere, Yassine Boudi, B\'eatrice
  Cochener, Mathieu Lamard",Deep image mining for diabetic retinopathy screening,Accepted for publication in Medical Image Analysis,"Med Image Anal., 39: 178-193 (2017)",10.1016/j.media.2017.04.012,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning is quickly becoming the leading methodology for medical image
analysis. Given a large medical archive, where each image is associated with a
diagnosis, efficient pathology detectors or classifiers can be trained with
virtually no expert knowledge about the target pathologies. However, deep
learning algorithms, including the popular ConvNets, are black boxes: little is
known about the local patterns analyzed by ConvNets to make a decision at the
image level. A solution is proposed in this paper to create heatmaps showing
which pixels in images play a role in the image-level predictions. In other
words, a ConvNet trained for image-level classification can be used to detect
lesions as well. A generalization of the backpropagation method is proposed in
order to train ConvNets that produce high-quality heatmaps. The proposed
solution is applied to diabetic retinopathy (DR) screening in a dataset of
almost 90,000 fundus photographs from the 2015 Kaggle Diabetic Retinopathy
competition and a private dataset of almost 110,000 photographs (e-ophtha). For
the task of detecting referable DR, very good detection performance was
achieved: $A_z = 0.954$ in Kaggle's dataset and $A_z = 0.949$ in e-ophtha.
Performance was also evaluated at the image level and at the lesion level in
the DiaretDB1 dataset, where four types of lesions are manually segmented:
microaneurysms, hemorrhages, exudates and cotton-wool spots. The proposed
detector outperforms recent algorithms trained to detect those lesions
specifically, as well as competing heatmap generation algorithms for ConvNets.
This detector is part of the Messidor system for mobile eye pathology
screening. Because it does not rely on expert knowledge or manual segmentation
for detecting relevant patterns, the proposed solution is a promising image
mining tool, which has the potential to discover new biomarkers in images.
","[{'version': 'v1', 'created': 'Sat, 22 Oct 2016 18:41:06 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Feb 2017 10:02:47 GMT'}, {'version': 'v3', 'created': 'Fri, 28 Apr 2017 07:57:06 GMT'}]",2017-06-28,"[['Quellec', 'Gwenolé', ''], ['Charrière', 'Katia', ''], ['Boudi', 'Yassine', ''], ['Cochener', 'Béatrice', ''], ['Lamard', 'Mathieu', '']]","['deep learning', 'image mining', 'diabetic retinopathy screening', 'lesion detection']"
4843,1809.03125,Michael Ekstrand,Michael D. Ekstrand,"LensKit for Python: Next-Generation Software for Recommender System
  Experiments",8 pages; accepted for publication in CIKM 2020,,10.1145/3340531.3412778,,cs.IR cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  LensKit is an open-source toolkit for building, researching, and learning
about recommender systems. First released in 2010 as a Java framework, it has
supported diverse published research, small-scale production deployments, and
education in both MOOC and traditional classroom settings. In this paper, I
present the next generation of the LensKit project, re-envisioning the original
tool's objectives as flexible Python package for supporting recommender systems
research and development. LensKit for Python (LKPY) enables researchers and
students to build robust, flexible, and reproducible experiments that make use
of the large and growing PyData and Scientific Python ecosystem, including
scikit-learn, TensorFlow, and PyTorch. To that end, it provides classical
collaborative filtering implementations, recommender system evaluation metrics,
data preparation routines, and tools for efficiently batch running
recommendation algorithms, all usable in any combination with each other or
with other Python software.
  This paper describes the design goals, use cases, and capabilities of LKPY,
contextualized in a reflection on the successes and failures of the original
LensKit for Java software.
","[{'version': 'v1', 'created': 'Mon, 10 Sep 2018 04:15:05 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Jun 2019 00:35:21 GMT'}, {'version': 'v3', 'created': 'Fri, 10 Jul 2020 21:04:58 GMT'}, {'version': 'v4', 'created': 'Thu, 3 Sep 2020 16:45:09 GMT'}]",2020-09-04,"[['Ekstrand', 'Michael D.', '']]","['recommender systems', 'evaluation', 'experiments', 'support software']"
4844,2210.04981,Yu Wei Tan,"Yu Wei Tan, Nicholas Chua, Nathan Biette and Anand Bhojan","Hybrid DoF: Ray-Traced and Post-Processed Hybrid Depth of Field Effect
  for Real-Time Rendering",,ACM SIGGRAPH 2020 Posters,10.1145/3388770.3407426,,cs.GR,http://creativecommons.org/licenses/by/4.0/,"  Depth of Field (DoF) in games is usually achieved as a post-process effect by
blurring pixels in the sharp rasterized image based on the defined focus plane.
This paper describes a novel real-time DoF technique that uses ray tracing with
image filtering to achieve more accurate partial occlusion semi-transparencies
on edges of blurry foreground geometry. This hybrid rendering technique
leverages ray tracing hardware acceleration as well as spatio-temporal
reconstruction techniques to achieve interactive frame rates.
","[{'version': 'v1', 'created': 'Mon, 10 Oct 2022 19:30:00 GMT'}]",2022-10-12,"[['Tan', 'Yu Wei', ''], ['Chua', 'Nicholas', ''], ['Biette', 'Nathan', ''], ['Bhojan', 'Anand', '']]","['real-time', 'depth of field', 'ray tracing', 'post-processing', 'hybrid rendering', 'games']"
4845,0806.1381,Feng Xia,"Feng Xia, Guosong Tian, Youxian Sun",Feedback Scheduling: An Event-Driven Paradigm,"8 pages, 10 figures","ACM SIGPLAN Notices, vol.42, no.12, pp. 7-14, Dec. 2007",,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Embedded computing systems today increasingly feature resource constraints
and workload variability, which lead to uncertainty in resource availability.
This raises great challenges to software design and programming in multitasking
environments. In this paper, the emerging methodology of feedback scheduling is
introduced to address these challenges. As a closed-loop approach to resource
management, feedback scheduling promises to enhance the flexibility and
resource efficiency of various software programs through dynamically
distributing available resources among concurrent tasks based on feedback
information about the actual usage of the resources. With emphasis on the
behavioral design of feedback schedulers, we describe a general framework of
feedback scheduling in the context of real-time control applications. A simple
yet illustrative feedback scheduling algorithm is given. From a programming
perspective, we describe how to modify the implementation of control tasks to
facilitate the application of feedback scheduling. An event-driven paradigm
that combines time-triggered and event-triggered approaches is proposed for
programming of the feedback scheduler. Simulation results argue that the
proposed event-driven paradigm yields better performance than time-triggered
paradigm in dynamic environments where the workload varies irregularly and
unpredictably.
","[{'version': 'v1', 'created': 'Mon, 9 Jun 2008 07:23:28 GMT'}]",2008-12-18,"[['Xia', 'Feng', ''], ['Tian', 'Guosong', ''], ['Sun', 'Youxian', '']]","['Feedback scheduling', 'programming', 'overhead', 'eventdriven', 'resource efficiency', 'flexibility']"
4846,1906.03113,Paul Burkhardt,Paul Burkhardt,Optimal algebraic Breadth-First Search for sparse graphs,"Will appear in ACM Transactions on Knowledge Discovery from Data,
  Vol. 15, No. 5, 2021","ACM Transactions on Knowledge Discovery from Data, 15(5):1-19,
  2021",10.1145/3446216,,cs.DS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There has been a rise in the popularity of algebraic methods for graph
algorithms given the development of the GraphBLAS library and other sparse
matrix methods. An exemplar for these approaches is Breadth-First Search (BFS).
The algebraic BFS algorithm is simply a recurrence of matrix-vector
multiplications with the $n \times n$ adjacency matrix, but the many redundant
operations over nonzeros ultimately lead to suboptimal performance. Therefore
an optimal algebraic BFS should be of keen interest especially if it is easily
integrated with existing matrix methods.
  Current methods, notably in the GraphBLAS, use a Sparse Matrix masked-Sparse
Vector (SpMmSpV) multiplication in which the input vector is kept in a sparse
representation in each step of the BFS, and nonzeros in the vector are masked
in subsequent steps. This has been an area of recent research in GraphBLAS and
other libraries. While in theory these masking methods are asymptotically
optimal on sparse graphs, many add work that leads to suboptimal runtime. We
give a new optimal, algebraic BFS for sparse graphs, thus closing a gap in the
literature.
  Our method multiplies progressively smaller submatrices of the adjacency
matrix at each step. Let $n$ and $m$ refer to the number of vertices and edges,
respectively. On a sparse graph, our method takes $O(n)$ algebraic operations
as opposed to $O(m)$ operations needed by theoretically optimal sparse matrix
approaches. Thus for sparse graphs it matches the bounds of the best-known
sequential algorithm and on a Parallel Random Access Machine (PRAM) it is
work-optimal. Our result holds for both directed and undirected graphs.
Compared to a leading GraphBLAS library our method achieves up to 24x faster
sequential time and for parallel computation it can be 17x faster on large
graphs and 12x faster on large-diameter graphs.
","[{'version': 'v1', 'created': 'Fri, 7 Jun 2019 14:06:23 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Oct 2019 14:43:59 GMT'}, {'version': 'v3', 'created': 'Wed, 12 Aug 2020 19:33:26 GMT'}, {'version': 'v4', 'created': 'Fri, 30 Apr 2021 21:52:38 GMT'}]",2021-05-14,"[['Burkhardt', 'Paul', '']]","['breadth-first search', 'graph algorithm', 'sparse matrix', 'linear algebra']"
4847,0908.1797,Ted Herman,"Kajari Ghosh Dastidar, Ted Herman",Separation of Circulating Tokens,"22 pages, 7 figures, epsf and pstricks in LaTeX",,10.1007/978-3-642-05118-0_25,TR09-02,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-stabilizing distributed control is often modeled by token abstractions.
A system with a single token may implement mutual exclusion; a system with
multiple tokens may ensure that immediate neighbors do not simultaneously enjoy
a privilege. For a cyber-physical system, tokens may represent physical objects
whose movement is controlled. The problem studied in this paper is to ensure
that a synchronous system with m circulating tokens has at least d distance
between tokens. This problem is first considered in a ring where d is given
whilst m and the ring size n are unknown. The protocol solving this problem can
be uniform, with all processes running the same program, or it can be
non-uniform, with some processes acting only as token relays. The protocol for
this first problem is simple, and can be expressed with Petri net formalism. A
second problem is to maximize d when m is given, and n is unknown. For the
second problem, the paper presents a non-uniform protocol with a single
corrective process.
","[{'version': 'v1', 'created': 'Wed, 12 Aug 2009 20:52:52 GMT'}, {'version': 'v2', 'created': 'Sat, 10 Oct 2009 22:55:11 GMT'}]",2015-05-13,"[['Dastidar', 'Kajari Ghosh', ''], ['Herman', 'Ted', '']]","['Self-stabilization', 'Petri Nets', 'Token Rings', 'Sensor Networks']"
4848,2105.06725,Zhihao Wen,"Zhihao Wen, Yuan Fang, Zemin Liu",Meta-Inductive Node Classification across Graphs,In proceedings of SIGIR 2021,,10.1145/3404835.3462915,,cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semi-supervised node classification on graphs is an important research
problem, with many real-world applications in information retrieval such as
content classification on a social network and query intent classification on
an e-commerce query graph. While traditional approaches are largely
transductive, recent graph neural networks (GNNs) integrate node features with
network structures, thus enabling inductive node classification models that can
be applied to new nodes or even new graphs in the same feature space. However,
inter-graph differences still exist across graphs within the same domain. Thus,
training just one global model (e.g., a state-of-the-art GNN) to handle all new
graphs, whilst ignoring the inter-graph differences, can lead to suboptimal
performance.
  In this paper, we study the problem of inductive node classification across
graphs. Unlike existing one-model-fits-all approaches, we propose a novel
meta-inductive framework called MI-GNN to customize the inductive model to each
graph under a meta-learning paradigm. That is, MI-GNN does not directly learn
an inductive model; it learns the general knowledge of how to train a model for
semi-supervised node classification on new graphs. To cope with the differences
across graphs, MI-GNN employs a dual adaptation mechanism at both the graph and
task levels. More specifically, we learn a graph prior to adapt for the
graph-level differences, and a task prior to adapt for the task-level
differences conditioned on a graph. Extensive experiments on five real-world
graph collections demonstrate the effectiveness of our proposed model.
","[{'version': 'v1', 'created': 'Fri, 14 May 2021 09:16:28 GMT'}, {'version': 'v2', 'created': 'Sun, 27 Mar 2022 14:00:51 GMT'}]",2022-03-29,"[['Wen', 'Zhihao', ''], ['Fang', 'Yuan', ''], ['Liu', 'Zemin', '']]","['Graph neural networks', 'semi-supervised node classification', 'inductive graph model', 'meta-learning']"
4849,1902.07314,Mihai Caragiu,"Mihai Caragiu, Shannon Tefft, Aaron Kemats and Travis Maenle","A linear complexity analysis of quadratic residues and primitive roots
  spacings",12 pages,,10.17654/ME019010027,,cs.IT math.IT,http://creativecommons.org/licenses/by-sa/4.0/,"  We investigate the linear complexities of the periodic 0-1 infinite sequences
in which the periods are the sequence of the parities of the spacings between
quadratic residues modulo a prime p, and the sequence of the parities of the
spacings between primitive roots modulo p, respectively. In either case, the
Berlekamp-Massey algorithm running on MAPLE computer algebra software shows
very good to perfect linear complexities.
","[{'version': 'v1', 'created': 'Sat, 16 Feb 2019 03:43:55 GMT'}]",2019-05-07,"[['Caragiu', 'Mihai', ''], ['Tefft', 'Shannon', ''], ['Kemats', 'Aaron', ''], ['Maenle', 'Travis', '']]","['linear complexity', 'quadratic residues', 'primitive roots', 'spacings', 'computational number theory']"
4850,1703.09023,Huan Li,"Liren Shan, Huan Li, Zhongzhi Zhang","Domination number and minimum dominating sets in pseudofractal
  scale-free web and Sierpi\'nski graph",,,10.1016/j.tcs.2017.03.009,,cs.SI cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The minimum dominating set (MDS) problem is a fundamental subject of
theoretical computer science, and has found vast applications in different
areas, including sensor networks, protein interaction networks, and structural
controllability. However, the determination of the size of a MDS and the number
of all MDSs in a general network is NP-hard, and it thus makes sense to seek
particular graphs for which the MDS problem can be solved analytically. In this
paper, we study the MDS problem in the pseudofractal scale-free web and the
Sierpi\'nski graph, which have the same number of vertices and edges. For both
networks, we determine explicitly the domination number, as well as the number
of distinct MDSs. We show that the pseudofractal scale-free web has a unique
MDS, and its domination number is only half of that for the Sierpi\'nski graph,
which has many MDSs. We argue that the scale-free topology is responsible for
the difference of the size and number of MDSs between the two studied graphs,
which in turn indicates that power-law degree distribution plays an important
role in the MDS problem and its applications in scale-free networks.
","[{'version': 'v1', 'created': 'Mon, 27 Mar 2017 12:09:50 GMT'}]",2017-03-28,"[['Shan', 'Liren', ''], ['Li', 'Huan', ''], ['Zhang', 'Zhongzhi', '']]","['Minimum dominating set', 'Domination number', 'Scale-freenetwork', 'Sierpi´nski graph', 'Complex network']"
4851,1102.0720,Gabriele D'Angelo,"Gabriele D'Angelo, Stefano Ferretti, Moreno Marzolla",Adaptive Event Dissemination for Peer-to-Peer Multiplayer Online Games,"ICST/CREATE-NET DISIO 2011: 2nd Workshop on DIstributed SImulation
  and Online gaming. March 21, 2011, Barcelona, Spain",,10.4108/icst.simutools.2011.245539,,cs.NI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we show that gossip algorithms may be effectively used to
disseminate game events in Peer-to-Peer (P2P) Multiplayer Online Games (MOGs).
Game events are disseminated through an overlay network. The proposed scheme
exploits the typical behavior of players to tune the data dissemination. In
fact, it is well known that users playing a MOG typically generate game events
at a rate that can be approximated using some (game dependent) probability
distribution. Hence, as soon as a given node experiences a reception rate, for
messages coming from a given peer, which is lower than expected, it can send a
stimulus to the neighbor that usually forwards these messages, asking it to
increase its dissemination probability. Three variants of this approach will be
studied. According to the first one, upon reception of a stimulus from a
neighbor, a peer increases its dissemination probability towards that node
irrespectively from the sender. In the second protocol a peer increases only
the dissemination probability for a given sender towards all its neighbors.
Finally, the third protocol takes into consideration both the sender and the
neighbor in order to decide how to increase the dissemination probability. We
performed extensive simulations to assess the efficacy of the proposed scheme,
and based on the simulation results we compare the different dissemination
protocols. The results confirm that adaptive gossip schemes are indeed
effective and deserve further investigation.
","[{'version': 'v1', 'created': 'Thu, 3 Feb 2011 16:17:00 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Dec 2012 08:49:49 GMT'}, {'version': 'v3', 'created': 'Mon, 28 Jul 2014 09:53:28 GMT'}]",2015-03-18,"[[""D'Angelo"", 'Gabriele', ''], ['Ferretti', 'Stefano', ''], ['Marzolla', 'Moreno', '']]","['Gossip Algorithms', 'Peer-to-Peer', 'Multiplayer Online Games']"
4852,1505.01820,Bikramjit Singh,"Bikramjit Singh, Konstantinos Koufos, Olav Tirkkonen, Randall Berry","Co-primary inter-operator spectrum sharing over a limited spectrum pool
  using repeated games","To be published in proceedings of IEEE International Conference on
  Communications (ICC) at London, Jun. 2015",,10.1109/ICC.2015.7248535,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider two small cell operators deployed in the same geographical area,
sharing spectrum resources from a common pool. A method is investigated to
coordinate the utilization of the spectrum pool without monetary transactions
and without revealing operator-specific information to other parties. For this,
we construct a protocol based on asking and receiving spectrum usage favors by
the operators, and keeping a book of the favors. A spectrum usage favor is
exchanged between the operators if one is asking for a permission to use some
of the resources from the pool on an exclusive basis, and the other is willing
to accept that. As a result, the proposed method does not force an operator to
take action. An operator with a high load may take spectrum usage favors from
an operator that has few users to serve, and it is likely to return these
favors in the future to show a cooperative spirit and maintain reciprocity. We
formulate the interactions between the operators as a repeated game and
determine rules to decide whether to ask or grant a favor at each stage game.
We illustrate that under frequent network load variations, which are expected
to be prominent in small cell deployments, both operators can attain higher
user rates as compared to the case of no coordination of the resource
utilization.
","[{'version': 'v1', 'created': 'Thu, 7 May 2015 19:21:59 GMT'}]",2016-11-15,"[['Singh', 'Bikramjit', ''], ['Koufos', 'Konstantinos', ''], ['Tirkkonen', 'Olav', ''], ['Berry', 'Randall', '']]","['Co-primary spectrum sharing', 'repeated games', 'spectrum pooling']"
4853,1901.07423,Miroslav Kulich,"Miroslav Kulich, Viktor Koz\'ak, Libor P\v{r}eu\v{c}il",An Integrated Approach to Autonomous Environment Modeling,,Modelling and Simulation for Autonomous Systems. MESAS 2017,10.1007/978-3-319-76072-8_1,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present an integrated solution to memory-efficient
environment modeling by an autonomous mobile robot equipped with a laser
range-finder.
  Majority of nowadays approaches to autonomous environment modeling, called
exploration, employs occupancy grids as environment representation where the
working space is divided into small cells each storing information about the
corresponding piece of the environment in the form of a probabilistic estimate
of its state. In contrast, the presented approach uses a polygonal
representation of the explored environment which consumes much less memory,
enables fast planning and decision-making algorithms and it is thus reliable
for large-scale environments.
  Simultaneous localization and mapping (SLAM) has been integrated into the
presented framework to correct odometry errors and to provide accurate position
estimates. This involves also a refinement of the already generated environment
model in case of loop closure, i.e. when the robot detects that it revisited an
already explored place.
  The framework has been implemented in Robot Operating System (ROS) and tested
with a real robot in various environments. The experiments show that the
polygonal representation with SLAM integrated can be used in the real world as
it is fast, memory efficient and accurate. Moreover, the refinement can be
executed in real-time during the exploration process.
","[{'version': 'v1', 'created': 'Tue, 22 Jan 2019 15:38:38 GMT'}]",2019-01-23,"[['Kulich', 'Miroslav', ''], ['Kozák', 'Viktor', ''], ['Přeučil', 'Libor', '']]","['autonomous systems', 'exploration', 'SLAM', 'loop closing']"
4854,1403.3818,Maissa Boujelben,"Maissa Boujelben, Sonia Benrejeb, Sami Tabbane","Interference Coordination Schemes for Wireless Mobile Advanced Systems:
  A Survey","11 pages, 14 figures. e-ISSN: 2278-2834,p- ISSN: 2278-8735.Volume 9,
  Issue 1, Ver. I (Feb. 2014), PP 00-00",,10.9790/2834-09168090,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile communication networks have witnessed a perpetual evolution since
their launching as voice only networks. In the few past years, the focus was
addressed to high data rate networks that offer high quality of service. The
lately released LTE-Advanced network was the first to completely fulfill 4G
requirements. However, performance gains remain limited due to severe
interference levels. This paper is a survey upon the evolution of interference
mitigation solutions from Release 8 to Release 11. This problem was addressed
since earlier releases by coordinating transmission/reception among different
cells. Many enhancements were then carried out by each subsequent
specification. The originality of this work resides on the comparison between
the different schemes and the perspective of developing a new interference
coordination method available for 4G and beyond systems with small cells
deployment. Several similarities are noted and differences on performance
impact are highlighted.
","[{'version': 'v1', 'created': 'Sat, 15 Mar 2014 15:37:24 GMT'}]",2014-03-18,"[['Boujelben', 'Maissa', ''], ['Benrejeb', 'Sonia', ''], ['Tabbane', 'Sami', '']]","['COMP', 'e-ICIC', 'ICIC', 'LTE', 'LTE-Advanced']"
4855,1601.00781,Grzegorz Kurzejamski,"Grzegorz Kurzejamski, Jacek Zawistowski and Grzegorz Sarwas","Robust Method of Vote Aggregation and Proposition Verification for
  Invariant Local Features","8 pages Short Paper, presented at VISAPP 2015 Conference in Berlin,
  March. Proceedings of the 10th International Conference on Computer Vision
  Theory and Applications, 252-259, 2015, Berlin, Germany, ISBN
  978-989-758-090-1",,10.5220/0005267002520259,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a method for analysis of the vote space created from the
local features extraction process in a multi-detection system. The method is
opposed to the classic clustering approach and gives a high level of control
over the clusters composition for further verification steps. Proposed method
comprises of the graphical vote space presentation, the proposition generation,
the two-pass iterative vote aggregation and the cascade filters for
verification of the propositions. Cascade filters contain all of the minor
algorithms needed for effective object detection verification. The new approach
does not have the drawbacks of the classic clustering approaches and gives a
substantial control over process of detection. Method exhibits an exceptionally
high detection rate in conjunction with a low false detection chance in
comparison to alternative methods.
","[{'version': 'v1', 'created': 'Tue, 5 Jan 2016 10:18:13 GMT'}]",2016-01-06,"[['Kurzejamski', 'Grzegorz', ''], ['Zawistowski', 'Jacek', ''], ['Sarwas', 'Grzegorz', '']]","['Computer Vision', 'Image Analysis', 'Multiple Object Detection', 'Object Localization', 'Pattern Matching']"
4856,1810.07798,Yunxiao Zhang,Yunxiao Zhang,Optimal Energy Distribution with Energy Packet Networks,"17 pages, pre-print manuscript",Prob. Eng. Inf. Sci. 35 (2021) 75-91,10.1017/S0269964818000566,,cs.NI cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We use Energy Packet Network paradigms to investigate energy distribution
problems in a computer system with energy harvesting and storages units. Our
goal is to minimize both the overall average response time of jobs at
workstations and the total rate of energy lost in the network. Energy is lost
when it arrives at idle workstations which are empty. Energy is also lost in
storage leakages. We assume that the total rate of energy harvesting and the
rate of jobs arriving at workstations are known. We also consider a special
case in which the total rate of energy harvesting is sufficiently large so that
workstations are less busy. In this case, energy is more likely to be sent to
an idle workstation. Optimal solutions are obtained which minimize both the
overall response time and energy loss under the constraint of a fixed energy
harvesting rate.
","[{'version': 'v1', 'created': 'Wed, 26 Sep 2018 11:20:55 GMT'}]",2021-01-20,"[['Zhang', 'Yunxiao', '']]","['Energy distributions', 'Energy harvesting', 'Energy Packet Networks', 'G-networks', 'Optimization', 'Product-form solution', 'Renewable energy']"
4857,1801.04720,Ren\'e Schuster,"Ren\'e Schuster, Christian Bailer, Oliver Wasenm\""uller, Didier
  Stricker",Combining Stereo Disparity and Optical Flow for Basic Scene Flow,"Commercial Vehicle Technology Symposium (CVTS), 2018",,10.1007/978-3-658-21300-8_8,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scene flow is a description of real world motion in 3D that contains more
information than optical flow. Because of its complexity there exists no
applicable variant for real-time scene flow estimation in an automotive or
commercial vehicle context that is sufficiently robust and accurate. Therefore,
many applications estimate the 2D optical flow instead. In this paper, we
examine the combination of top-performing state-of-the-art optical flow and
stereo disparity algorithms in order to achieve a basic scene flow. On the
public KITTI Scene Flow Benchmark we demonstrate the reasonable accuracy of the
combination approach and show its speed in computation.
","[{'version': 'v1', 'created': 'Mon, 15 Jan 2018 10:21:08 GMT'}]",2018-06-22,"[['Schuster', 'René', ''], ['Bailer', 'Christian', ''], ['Wasenmüller', 'Oliver', ''], ['Stricker', 'Didier', '']]","['Automotive', 'Commercial Vehicle', 'Flow Fields', 'Optical Flow', 'Scene Flow', 'Semi-global Matching', 'Stereo']"
4858,1701.07961,Zhangjie Liu,"Zhangjie Liu, Mei Su, Yao Sun, Hua Han, Xiaochao Hou, and Josep M.
  Guerrero","Stability Analysis of DC Microgrids with Constant Power Load under
  Distributed Control Method","10 pages, 4 figures",,10.1016/j.automatica.2017.12.051,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  DC microgrids are becoming popular as effective means to integrate various
renewable energy resources. Constant power loads (CPLs) may yield instability
due to the negative impedance characteristic. This paper analyzes the stability
of the DC microgrid in presence of CPL. Distributed generations (DGs) are
controlled by using a distributed controller which aims at current sharing and
voltage recovery. For simplicity, a reduced order model is derived on the
fundamental of neglecting the transient state of the DC/DC converter. The
purpose of this paper is to analyze stability conditions and give the
suggestions to design control parameters. The stability conditions are obtained
by using inertia theorem. Moreover, this paper makes a further detailed
research based on the existed theorems. Simulation results are provided to
verify the effectiveness and validity of the proposed theorem.
","[{'version': 'v1', 'created': 'Fri, 27 Jan 2017 07:32:18 GMT'}, {'version': 'v2', 'created': 'Sun, 19 Nov 2017 09:22:14 GMT'}]",2018-04-24,"[['Liu', 'Zhangjie', ''], ['Su', 'Mei', ''], ['Sun', 'Yao', ''], ['Han', 'Hua', ''], ['Hou', 'Xiaochao', ''], ['Guerrero', 'Josep M.', '']]","['Constant power load (CPL)', 'DC microgrid', 'distributed control', 'inertia theorem', 'current sharing', 'stability']"
4859,1303.3152,Odemir Bruno PhD,"Bruno Brandoli Machado, Wesley Nunes Gon\c{c}alves, Odemir Martinez
  Bruno","Material quality assessment of silk nanofibers based on swarm
  intelligence",11 pages 6 figures,J. Phys.: Conf. Ser. 410 012163 2013,10.1088/1742-6596/410/1/012163,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel approach for texture analysis based on
artificial crawler model. Our method assumes that each agent can interact with
the environment and each other. The evolution process converges to an
equilibrium state according to the set of rules. For each textured image, the
feature vector is composed by signatures of the live agents curve at each time.
Experimental results revealed that combining the minimum and maximum signatures
into one increase the classification rate. In addition, we pioneer the use of
autonomous agents for characterizing silk fibroin scaffolds. The results
strongly suggest that our approach can be successfully employed for texture
analysis.
","[{'version': 'v1', 'created': 'Wed, 13 Mar 2013 13:23:21 GMT'}]",2013-03-14,"[['Machado', 'Bruno Brandoli', ''], ['Gonçalves', 'Wesley Nunes', ''], ['Bruno', 'Odemir Martinez', '']]","['agent-based model', 'texture analysis', 'silk fibroin scaffolds']"
4860,1406.2812,Pece Mitrevski,Basri Ahmedi and Pece Mitrevski,"On the Development of Methodology for Planning and Cost-Modeling of a
  Wide Area Network","20 pages, 5 figures","International Journal of Computer Networks & Communications
  (IJCNC) Vol.6, No.3, May 2014",10.5121/ijcnc.2014.6307,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The most important stages in designing a computer network in a wider
geographical area include: definition of requirements, topological description,
identification and calculation of relevant parameters (i.e. traffic matrix),
determining the shortest path between nodes, quantification of the effect of
various levels of technical and technological development of urban areas
involved, the cost of technology, and the cost of services. These parameters
differ for WAN networks in different regions - their calculation depends
directly on the data ""in the field"": number of inhabitants, distance between
populated areas, network traffic density, as well as available bandwidth. The
main reason for identification and evaluation of these parameters is to develop
a model that could meet the constraints imposed by potential beneficiaries. In
this paper, we develop a methodology for planning and cost-modeling of a wide
area network and validate it in a case study, under the supposition that
behavioral interactions of individuals and groups play a significant role and
have to be taken into consideration by employing either simple or composite
indicators of socioeconomic status.
","[{'version': 'v1', 'created': 'Wed, 11 Jun 2014 08:01:29 GMT'}]",2014-06-12,"[['Ahmedi', 'Basri', ''], ['Mitrevski', 'Pece', '']]","['Wide Area Network', 'Traffic Matrix', 'Shortest Path Algorithm', 'Traffic Density', 'Network Bandwidth', 'Socioeconomic Indicators']"
4861,1407.2845,Emilio Ferrara,"Santa Agreste, Pasquale De Meo, Emilio Ferrara, Domenico Ursino",XML Matchers: approaches and challenges,"34 pages, 8 tables, 7 figures","Knowledge-based systems 66: 190-209, 2014",10.1016/j.knosys.2014.04.044,,cs.DB cs.AI cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Schema Matching, i.e. the process of discovering semantic correspondences
between concepts adopted in different data source schemas, has been a key topic
in Database and Artificial Intelligence research areas for many years. In the
past, it was largely investigated especially for classical database models
(e.g., E/R schemas, relational databases, etc.). However, in the latest years,
the widespread adoption of XML in the most disparate application fields pushed
a growing number of researchers to design XML-specific Schema Matching
approaches, called XML Matchers, aiming at finding semantic matchings between
concepts defined in DTDs and XSDs. XML Matchers do not just take well-known
techniques originally designed for other data models and apply them on
DTDs/XSDs, but they exploit specific XML features (e.g., the hierarchical
structure of a DTD/XSD) to improve the performance of the Schema Matching
process. The design of XML Matchers is currently a well-established research
area. The main goal of this paper is to provide a detailed description and
classification of XML Matchers. We first describe to what extent the
specificities of DTDs/XSDs impact on the Schema Matching task. Then we
introduce a template, called XML Matcher Template, that describes the main
components of an XML Matcher, their role and behavior. We illustrate how each
of these components has been implemented in some popular XML Matchers. We
consider our XML Matcher Template as the baseline for objectively comparing
approaches that, at first glance, might appear as unrelated. The introduction
of this template can be useful in the design of future XML Matchers. Finally,
we analyze commercial tools implementing XML Matchers and introduce two
challenging issues strictly related to this topic, namely XML source clustering
and uncertainty management in XML Matchers.
","[{'version': 'v1', 'created': 'Thu, 10 Jul 2014 16:14:11 GMT'}]",2014-07-11,"[['Agreste', 'Santa', ''], ['De Meo', 'Pasquale', ''], ['Ferrara', 'Emilio', ''], ['Ursino', 'Domenico', '']]","['Schema Matching', 'DTD', 'XML Schema', 'XSD', 'XML source clustering', 'Uncertainty management inXML Matchers']"
4862,1111.4533,Lluis Pamies-Juarez,Lluis Pamies-Juarez and Anwitaman Datta and Fr\'ed\'erique Oggier,In-Network Redundancy Generation for Opportunistic Speedup of Backup,,"Future Generation Computer Systems (Volume 29, Issue 6, August
  2013, Pages 1353-1362)",10.1016/j.future.2013.02.009,,cs.DC cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Erasure coding is a storage-efficient alternative to replication for
achieving reliable data backup in distributed storage systems. During the
storage process, traditional erasure codes require a unique source node to
create and upload all the redundant data to the different storage nodes.
However, such a source node may have limited communication and computation
capabilities, which constrain the storage process throughput. Moreover, the
source node and the different storage nodes might not be able to send and
receive data simultaneously -- e.g., nodes might be busy in a datacenter
setting, or simply be offline in a peer-to-peer setting -- which can further
threaten the efficacy of the overall storage process. In this paper we propose
an ""in-network"" redundancy generation process which distributes the data
insertion load among the source and storage nodes by allowing the storage nodes
to generate new redundant data by exchanging partial information among
themselves, improving the throughput of the storage process. The process is
carried out asynchronously, utilizing spare bandwidth and computing resources
from the storage nodes. The proposed approach leverages on the local
repairability property of newly proposed erasure codes tailor made for the
needs of distributed storage systems. We analytically show that the performance
of this technique relies on an efficient usage of the spare node resources, and
we derive a set of scheduling algorithms to maximize the same. We
experimentally show, using availability traces from real peer-to-peer
applications as well as Google data center availability and workload traces,
that our algorithms can, depending on the environment characteristics, increase
the throughput of the storage process significantly (up to 90% in data centers,
and 60% in peer-to-peer settings) with respect to the classical naive data
insertion approach.
","[{'version': 'v1', 'created': 'Sat, 19 Nov 2011 04:50:34 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Feb 2013 11:00:58 GMT'}]",2015-03-19,"[['Pamies-Juarez', 'Lluis', ''], ['Datta', 'Anwitaman', ''], ['Oggier', 'Frédérique', '']]","['distributed storage systems', 'data insertion', 'locally repairable codes', 'self-repairing']"
4863,1708.01060,Etienne Papegnies,"Etienne Papegnies (LIA), Vincent Labatut (LIA), Richard Dufour (LIA),
  Georges Linares (LIA)",Graph-based Features for Automatic Online Abuse Detection,,"5th International Conference on Statistical Language and Speech
  Processing (SLSP), 2017, Le Mans (FR), Lecture Notes in Artificial
  Intelligence vol.10583, p.70-81",10.1007/978-3-319-68456-7_6,,cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While online communities have become increasingly important over the years,
the moderation of user-generated content is still performed mostly manually.
Automating this task is an important step in reducing the financial cost
associated with moderation, but the majority of automated approaches strictly
based on message content are highly vulnerable to intentional obfuscation. In
this paper, we discuss methods for extracting conversational networks based on
raw multi-participant chat logs, and we study the contribution of graph
features to a classification system that aims to determine if a given message
is abusive. The conversational graph-based system yields unexpectedly high
performance , with results comparable to those previously obtained with a
content-based approach.
","[{'version': 'v1', 'created': 'Thu, 3 Aug 2017 09:06:25 GMT'}]",2017-10-17,"[['Papegnies', 'Etienne', '', 'LIA'], ['Labatut', 'Vincent', '', 'LIA'], ['Dufour', 'Richard', '', 'LIA'], ['Linares', 'Georges', '', 'LIA']]","['Text categorization', 'Abuse detection', 'Online communities', 'moderation']"
4864,2105.12818,Jacinto Carrasco,"Jacinto Carrasco, Irina Markova, David L\'opez, Ignacio Aguilera,
  Diego Garc\'ia, Marta Garc\'ia-Barzana, Manuel Arias-Rodil, Juli\'an Luengo,
  Francisco Herrera","Anomaly Detection in Predictive Maintenance: A New Evaluation Framework
  for Temporal Unsupervised Anomaly Detection Algorithms","25 pages, 9 figures, 5 tables",,10.1016/j.neucom.2021.07.095,,cs.LG,http://creativecommons.org/publicdomain/zero/1.0/,"  The research in anomaly detection lacks a unified definition of what
represents an anomalous instance. Discrepancies in the nature itself of an
anomaly lead to multiple paradigms of algorithms design and experimentation.
Predictive maintenance is a special case, where the anomaly represents a
failure that must be prevented. Related time-series research as outlier and
novelty detection or time-series classification does not apply to the concept
of an anomaly in this field, because they are not single points which have not
been seen previously and may not be precisely annotated. Moreover, due to the
lack of annotated anomalous data, many benchmarks are adapted from supervised
scenarios.
  To address these issues, we generalise the concept of positive and negative
instances to intervals to be able to evaluate unsupervised anomaly detection
algorithms. We also preserve the imbalance scheme for evaluation through the
proposal of the Preceding Window ROC, a generalisation for the calculation of
ROC curves for time-series scenarios. We also adapt the mechanism from a
established time-series anomaly detection benchmark to the proposed
generalisations to reward early detection. Therefore, the proposal represents a
flexible evaluation framework for the different scenarios. To show the
usefulness of this definition, we include a case study of Big Data algorithms
with a real-world time-series problem provided by the company ArcelorMittal,
and compare the proposal with an evaluation method.
","[{'version': 'v1', 'created': 'Wed, 26 May 2021 20:15:40 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Sep 2021 16:53:01 GMT'}]",2021-09-03,"[['Carrasco', 'Jacinto', ''], ['Markova', 'Irina', ''], ['López', 'David', ''], ['Aguilera', 'Ignacio', ''], ['García', 'Diego', ''], ['García-Barzana', 'Marta', ''], ['Arias-Rodil', 'Manuel', ''], ['Luengo', 'Julián', ''], ['Herrera', 'Francisco', '']]","['anomaly', 'outlier', 'score system', 'evaluation', 'benchmark']"
4865,2205.12781,Francesco Daghero,"Francesco Daghero, Chen Xie, Daniele Jahier Pagliari, Alessio
  Burrello, Marco Castellano, Luca Gandolfi, Andrea Calimera, Enrico Macii,
  Massimo Poncino","Ultra-compact Binary Neural Networks for Human Activity Recognition on
  RISC-V Processors","Published in: 2021 18th ACM International Conference on Computing
  Frontiers (CF)","18th ACM International Conference on Computing Frontiers (CF),
  2021, pp. 3-11",10.1145/3457388.3458656,,cs.LG eess.SP,http://creativecommons.org/licenses/by/4.0/,"  Human Activity Recognition (HAR) is a relevant inference task in many mobile
applications. State-of-the-art HAR at the edge is typically achieved with
lightweight machine learning models such as decision trees and Random Forests
(RFs), whereas deep learning is less common due to its high computational
complexity. In this work, we propose a novel implementation of HAR based on
deep neural networks, and precisely on Binary Neural Networks (BNNs), targeting
low-power general purpose processors with a RISC-V instruction set. BNNs yield
very small memory footprints and low inference complexity, thanks to the
replacement of arithmetic operations with bit-wise ones. However, existing BNN
implementations on general purpose processors impose constraints tailored to
complex computer vision tasks, which result in over-parametrized models for
simpler problems like HAR. Therefore, we also introduce a new BNN inference
library, which targets ultra-compact models explicitly. With experiments on a
single-core RISC-V processor, we show that BNNs trained on two HAR datasets
obtain higher classification accuracy compared to a state-of-the-art baseline
based on RFs. Furthermore, our BNN reaches the same accuracy of a RF with
either less memory (up to 91%) or more energy-efficiency (up to 70%), depending
on the complexity of the features extracted by the RF.
","[{'version': 'v1', 'created': 'Wed, 25 May 2022 13:52:35 GMT'}]",2022-05-26,"[['Daghero', 'Francesco', ''], ['Xie', 'Chen', ''], ['Pagliari', 'Daniele Jahier', ''], ['Burrello', 'Alessio', ''], ['Castellano', 'Marco', ''], ['Gandolfi', 'Luca', ''], ['Calimera', 'Andrea', ''], ['Macii', 'Enrico', ''], ['Poncino', 'Massimo', '']]","['Binary Neural Networks', 'Human Activity Recognition', 'EnergyEfficiency', 'Edge Computing']"
4866,1311.4219,Stanislav Zivny,"Vladimir Kolmogorov, Johan Thapper, Stanislav Zivny",The power of linear programming for general-valued CSPs,"A full version of a FOCS'12 paper by the last two authors
  (arXiv:1204.1079) and an ICALP'13 paper by the first author (arXiv:1207.7213)
  to appear in SIAM Journal on Computing (SICOMP)",SIAM Journal on Computing 44(1) (2015) 1-36,10.1137/130945648,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $D$, called the domain, be a fixed finite set and let $\Gamma$, called
the valued constraint language, be a fixed set of functions of the form
$f:D^m\to\mathbb{Q}\cup\{\infty\}$, where different functions might have
different arity $m$. We study the valued constraint satisfaction problem
parametrised by $\Gamma$, denoted by VCSP$(\Gamma)$. These are minimisation
problems given by $n$ variables and the objective function given by a sum of
functions from $\Gamma$, each depending on a subset of the $n$ variables.
Finite-valued constraint languages contain functions that take on only rational
values and not infinite values.
  Our main result is a precise algebraic characterisation of valued constraint
languages whose instances can be solved exactly by the basic linear programming
relaxation (BLP). For a valued constraint language $\Gamma$, BLP is a decision
procedure for $\Gamma$ if and only if $\Gamma$ admits a symmetric fractional
polymorphism of every arity. For a finite-valued constraint language $\Gamma$,
BLP is a decision procedure if and only if $\Gamma$ admits a symmetric
fractional polymorphism of some arity, or equivalently, if $\Gamma$ admits a
symmetric fractional polymorphism of arity 2.
  Using these results, we obtain tractability of several novel classes of
problems, including problems over valued constraint languages that are: (1)
submodular on arbitrary lattices; (2) $k$-submodular on arbitrary finite
domains; (3) weakly (and hence strongly) tree-submodular on arbitrary trees.
","[{'version': 'v1', 'created': 'Sun, 17 Nov 2013 21:37:51 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Jul 2014 21:06:36 GMT'}, {'version': 'v3', 'created': 'Tue, 25 Nov 2014 15:33:12 GMT'}]",2015-11-24,"[['Kolmogorov', 'Vladimir', ''], ['Thapper', 'Johan', ''], ['Zivny', 'Stanislav', '']]","['valued constraint satisfaction', 'fractional polymorphisms', 'submodularity', 'bisubmodularity', 'linear programming']"
4867,1504.06793,Andrey Shchurov,"Andrey A. Shchurov, Radek Marik, Vladimir A. Khlevnoy",A Formal Approach to Network/Distributed Systems Complex Testing,"5 pages, 1 figure","International Journal of Computer Trends and Technology (IJCTT)
  V22(2):76-80, April 2015. ISSN:2231-2803",10.14445/22312803/IJCTT-V22P115,,cs.DC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deployment of network/distributed systems sets high requirements for
procedures, tools and approaches for the complex testing of these systems. This
work provides a survey of testing activities with regard to these systems based
on standards and actual practices for both software-based and distribution
(network) aspects. On the basis of this survey, we determine formal testing
procedures/processes which cover these aspects, but which are not contrary to
both aspects. The next step, based on the analysis of the implementation phase
of System Development Life Cycle, determines a formal model for these processes
","[{'version': 'v1', 'created': 'Sun, 26 Apr 2015 07:34:42 GMT'}]",2015-04-28,"[['Shchurov', 'Andrey A.', ''], ['Marik', 'Radek', ''], ['Khlevnoy', 'Vladimir A.', '']]","['distributed systems', 'network testing', 'software testing']"
4868,1504.05603,Caspar Oesterheld,Caspar Oesterheld,Formalizing Preference Utilitarianism in Physical World Models,"14 pages, 3 figures",,10.1007/s11229-015-0883-1,,cs.CY cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most ethical work is done at a low level of formality. This makes practical
moral questions inaccessible to formal and natural sciences and can lead to
misunderstandings in ethical discussion. In this paper, we use Bayesian
inference to introduce a formalization of preference utilitarianism in physical
world models, specifically cellular automata. Even though our formalization is
not immediately applicable, it is a first step in providing ethics and
ultimately the question of how to ""make the world better"" with a formal basis.
","[{'version': 'v1', 'created': 'Tue, 21 Apr 2015 20:35:54 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Sep 2015 10:37:33 GMT'}, {'version': 'v3', 'created': 'Mon, 30 Nov 2015 15:46:32 GMT'}]",2015-12-01,"[['Oesterheld', 'Caspar', '']]","['preference utilitarianism', 'formalization', 'artificial life', '(machine)ethics']"
4869,1806.10540,Jinseok Kim,Jinseok Kim,"Evaluating author name disambiguation for digital libraries: A case of
  DBLP",Scientometrics (2018),,10.1007/s11192-018-2824-5,,cs.DL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Author name ambiguity in a digital library may affect the findings of
research that mines authorship data of the library. This study evaluates author
name disambiguation in DBLP, a widely used but insufficiently evaluated digital
library for its disambiguation performance. In doing so, this study takes a
triangulation approach that author name disambiguation for a digital library
can be better evaluated when its performance is assessed on multiple labeled
datasets with comparison to baselines. Tested on three types of labeled data
containing 5,000 ~ 700K disambiguated names and 6M pairs of disambiguated
names, DBLP is shown to assign author names quite accurately to distinct
authors, resulting in pairwise precision, recall, and F1 measures around 0.90
or above overall. DBLP's author name disambiguation performs well even on large
ambiguous name blocks but deficiently on distinguishing authors with the same
names. When compared to other disambiguation algorithms, DBLP's disambiguation
performance is quite competitive, possibly due to its hybrid disambiguation
approach combining algorithmic disambiguation and manual error correction. A
discussion follows on strengths and weaknesses of labeled datasets used in this
study for future efforts to evaluate author name disambiguation on a digital
library scale.
","[{'version': 'v1', 'created': 'Wed, 27 Jun 2018 15:49:27 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Jul 2018 13:45:32 GMT'}]",2018-07-31,"[['Kim', 'Jinseok', '']]","['author name disambiguation', 'digital library', 'triangulation', 'disambiguation evaluation', 'DBLP']"
4870,1808.07209,Yadan Luo,"Yadan Luo, Ziwei Wang, Zi Huang, Yang Yang, Cong Zhao",Coarse-to-Fine Annotation Enrichment for Semantic Segmentation Learning,"CIKM 2018 International Conference on Information and Knowledge
  Management",,10.1145/3269206.3271672,,cs.CV cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Rich high-quality annotated data is critical for semantic segmentation
learning, yet acquiring dense and pixel-wise ground-truth is both labor- and
time-consuming. Coarse annotations (e.g., scribbles, coarse polygons) offer an
economical alternative, with which training phase could hardly generate
satisfactory performance unfortunately. In order to generate high-quality
annotated data with a low time cost for accurate segmentation, in this paper,
we propose a novel annotation enrichment strategy, which expands existing
coarse annotations of training data to a finer scale. Extensive experiments on
the Cityscapes and PASCAL VOC 2012 benchmarks have shown that the neural
networks trained with the enriched annotations from our framework yield a
significant improvement over that trained with the original coarse labels. It
is highly competitive to the performance obtained by using human annotated
dense annotations. The proposed method also outperforms among other
state-of-the-art weakly-supervised segmentation methods.
","[{'version': 'v1', 'created': 'Wed, 22 Aug 2018 03:55:33 GMT'}]",2018-08-29,"[['Luo', 'Yadan', ''], ['Wang', 'Ziwei', ''], ['Huang', 'Zi', ''], ['Yang', 'Yang', ''], ['Zhao', 'Cong', '']]","['Semantic Segmentation', 'Annotation Enrichment', 'Coarse-to-Fine']"
4871,1407.3845,Jiahao Chen,"Jeff Bezanson, Jiahao Chen, Stefan Karpinski, Viral Shah, Alan Edelman","Array operators using multiple dispatch: a design methodology for array
  implementations in dynamic languages","6 pages, 2 figures, workshop paper for the ARRAY '14 workshop, June
  11, 2014, Edinburgh, United Kingdom",,10.1145/2627373.2627383,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Arrays are such a rich and fundamental data type that they tend to be built
into a language, either in the compiler or in a large low-level library.
Defining this functionality at the user level instead provides greater
flexibility for application domains not envisioned by the language designer.
Only a few languages, such as C++ and Haskell, provide the necessary power to
define $n$-dimensional arrays, but these systems rely on compile-time
abstraction, sacrificing some flexibility. In contrast, dynamic languages make
it straightforward for the user to define any behavior they might want, but at
the possible expense of performance.
  As part of the Julia language project, we have developed an approach that
yields a novel trade-off between flexibility and compile-time analysis. The
core abstraction we use is multiple dispatch. We have come to believe that
while multiple dispatch has not been especially popular in most kinds of
programming, technical computing is its killer application. By expressing key
functions such as array indexing using multi-method signatures, a surprising
range of behaviors can be obtained, in a way that is both relatively easy to
write and amenable to compiler analysis. The compact factoring of concerns
provided by these methods makes it easier for user-defined types to behave
consistently with types in the standard library.
","[{'version': 'v1', 'created': 'Mon, 14 Jul 2014 23:13:17 GMT'}]",2014-07-16,"[['Bezanson', 'Jeff', ''], ['Chen', 'Jiahao', ''], ['Karpinski', 'Stefan', ''], ['Shah', 'Viral', ''], ['Edelman', 'Alan', '']]","['Julia', 'multiple dispatch', 'type inference', 'array indexing', 'static analysis', 'dynamic dispatch']"
4872,1806.03283,Yannic Noller,"Yannic Noller, Rody Kersten, Corina S. P\u{a}s\u{a}reanu",Badger: Complexity Analysis with Fuzzing and Symbolic Execution,,"In Proceedings of 27th ACM SIGSOFT International Symposium on
  Software Testing and Analysis (ISSTA'18). ACM, New York, NY, USA, 11 pages,
  2018",10.1145/3213846.3213868,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hybrid testing approaches that involve fuzz testing and symbolic execution
have shown promising results in achieving high code coverage, uncovering subtle
errors and vulnerabilities in a variety of software applications. In this paper
we describe Badger - a new hybrid approach for complexity analysis, with the
goal of discovering vulnerabilities which occur when the worst-case time or
space complexity of an application is significantly higher than the average
case. Badger uses fuzz testing to generate a diverse set of inputs that aim to
increase not only coverage but also a resource-related cost associated with
each path. Since fuzzing may fail to execute deep program paths due to its
limited knowledge about the conditions that influence these paths, we
complement the analysis with a symbolic execution, which is also customized to
search for paths that increase the resource-related cost. Symbolic execution is
particularly good at generating inputs that satisfy various program conditions
but by itself suffers from path explosion. Therefore, Badger uses fuzzing and
symbolic execution in tandem, to leverage their benefits and overcome their
weaknesses. We implemented our approach for the analysis of Java programs,
based on Kelinci and Symbolic PathFinder. We evaluated Badger on Java
applications, showing that our approach is significantly faster in generating
worst-case executions compared to fuzzing or symbolic execution on their own.
","[{'version': 'v1', 'created': 'Fri, 8 Jun 2018 17:26:11 GMT'}]",2018-06-11,"[['Noller', 'Yannic', ''], ['Kersten', 'Rody', ''], ['Păsăreanu', 'Corina S.', '']]","['Fuzzing', 'Symbolic Execution', 'Complexity Analysis', 'Denial-of-Service']"
4873,1503.06822,Ioannis Papoutsakis,Ioannis Papoutsakis,Tree spanners of bounded degree graphs,,"Discrete Applied Mathematics, Volume 236, 2018, Pages 395-407",10.1016/j.dam.2017.10.025,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A tree $t$-spanner of a graph $G$ is a spanning tree of $G$ such that the
distance between pairs of vertices in the tree is at most $t$ times their
distance in $G$. Deciding tree $t$-spanner admissible graphs has been proved to
be tractable for $t<3$ and NP-complete for $t>3$, while the complexity status
of this problem is unresolved when $t=3$. For every $t>2$ and $b>0$, an
efficient dynamic programming algorithm to decide tree $t$-spanner
admissibility of graphs with vertex degrees less than $b$ is presented. Only
for $t=3$, the algorithm remains efficient, when graphs $G$ with degrees less
than $b\log |V(G)|$ are examined.
","[{'version': 'v1', 'created': 'Mon, 23 Mar 2015 20:30:00 GMT'}, {'version': 'v2', 'created': 'Mon, 5 Oct 2015 18:01:09 GMT'}, {'version': 'v3', 'created': 'Mon, 12 Oct 2015 17:42:08 GMT'}, {'version': 'v4', 'created': 'Sun, 17 Apr 2016 08:58:27 GMT'}, {'version': 'v5', 'created': 'Mon, 9 May 2016 16:33:16 GMT'}]",2018-01-01,"[['Papoutsakis', 'Ioannis', '']]","['Tree spanner', 'Distance', 'Spanning tree', 'Efficient graph algorithm', 'Bounded degree graph']"
4874,1901.00001,Yuri G. Gordienko,"Vlad Taran, Yuri Gordienko, Alexandr Rokovyi, Oleg Alienin, Sergii
  Stirenko","Impact of Ground Truth Annotation Quality on Performance of Semantic
  Image Segmentation of Traffic Conditions","10 pages, 6 figures, 2 tables, The Second International Conference on
  Computer Science, Engineering and Education Applications (ICCSEEA2019) 26-27
  January 2019, Kiev, Ukraine","Hu Z., Petoukhov S., Dychka I., He M. (eds) Advances in Computer
  Science for Engineering and Education II. ICCSEEA 2019. Advances in
  Intelligent Systems and Computing, vol 938 (pp.183-193). Springer, Cham",10.1007/978-3-030-16621-2_17,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Preparation of high-quality datasets for the urban scene understanding is a
labor-intensive task, especially, for datasets designed for the autonomous
driving applications. The application of the coarse ground truth (GT)
annotations of these datasets without detriment to the accuracy of semantic
image segmentation (by the mean intersection over union - mIoU) could simplify
and speedup the dataset preparation and model fine tuning before its practical
application. Here the results of the comparative analysis for semantic
segmentation accuracy obtained by PSPNet deep learning architecture are
presented for fine and coarse annotated images from Cityscapes dataset. Two
scenarios were investigated: scenario 1 - the fine GT images for training and
prediction, and scenario 2 - the fine GT images for training and the coarse GT
images for prediction. The obtained results demonstrated that for the most
important classes the mean accuracy values of semantic image segmentation for
coarse GT annotations are higher than for the fine GT ones, and the standard
deviation values are vice versa. It means that for some applications some
unimportant classes can be excluded and the model can be tuned further for some
classes and specific regions on the coarse GT dataset without loss of the
accuracy even. Moreover, this opens the perspectives to use deep neural
networks for the preparation of such coarse GT datasets.
","[{'version': 'v1', 'created': 'Sun, 30 Dec 2018 09:19:55 GMT'}]",2019-04-04,"[['Taran', 'Vlad', ''], ['Gordienko', 'Yuri', ''], ['Rokovyi', 'Alexandr', ''], ['Alienin', 'Oleg', ''], ['Stirenko', 'Sergii', '']]","['Deep Learning', 'Semantic Segmentation', 'Accuracy', 'Cityscapes']"
4875,1808.05409,Miikka Kuutila M.Sc.,"Miikka Kuutila, Mika M\""antyl\""a, Ma\""elick Claes, Marko Elovainio,
  Bram Adams","Using Experience Sampling to link Software Repositories with Emotions
  and Work Well-Being","International Symposium on Empirical Software Engineering and
  Measurement (ESEM), 10 pages",,10.1145/3239235.3239245,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: The experience sampling method studies everyday experiences of
humans in natural environments. In psychology it has been used to study the
relationships between work well-being and productivity. To our best knowledge,
daily experience sampling has not been previously used in software engineering.
Aims: Our aim is to identify links between software developers self-reported
affective states and work well-being and measures obtained from software
repositories. Method: We perform an experience sampling study in a software
company for a period of eight months, we use logistic regression to link the
well-being measures with development activities, i.e. number of commits and
chat messages. Results: We find several significant relationships between
questionnaire variables and software repository variables. To our surprise
relationship between hurry and number of commits is negative, meaning more
perceived hurry is linked with a smaller number of commits. We also find a
negative relationship between social interaction and hindered work well-being.
Conclusions: The negative link between commits and hurry is counter-intuitive
and goes against previous lab-experiments in software engineering that show
increased efficiency under time pressure. Overall, our work is an initial step
in using experience sampling in software engineering and validating theories on
work well-being from other fields in the domain of software engineering.
","[{'version': 'v1', 'created': 'Thu, 16 Aug 2018 10:50:43 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Sep 2018 14:34:42 GMT'}]",2018-09-05,"[['Kuutila', 'Miikka', ''], ['Mäntylä', 'Mika', ''], ['Claes', 'Maëlick', ''], ['Elovainio', 'Marko', ''], ['Adams', 'Bram', '']]","['Experience Sampling', 'Repository mining', 'binary regression', 'affective states', 'empirical study', 'work well-being', 'stress', 'time pressure']"
4876,1804.07151,Deepika Singh,"Deepika Singh, Johannes Kropf, Sten Hanke and Andreas Holzinger","Ambient Assisted Living technologies from the perspectives of older
  people and professionals",,"International Cross-Domain Conference for Machine Learning and
  Knowledge Extraction: CD-MAKE 2017",10.1007/978-3-319-66808-6_17,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ambient Assisted Living (AAL) and Ambient Intelligence technologies are
providing support to older people in living an independent and confident life
by developing innovative ICT-based products, services, and systems. Despite
significant advancement in AAL technologies and smart systems, they have still
not found the way into the nursing home of the older people. The reasons are
manifold. On one hand, the development of such systems lack in addressing the
requirements of the older people and caregivers of the organization and the
other is the unwillingness of the older people to make use of assistive
systems. A qualitative study was performed at a nursing home to understand the
needs and requirements of the residents and caregivers and their perspectives
about the existing AAL technologies.
","[{'version': 'v1', 'created': 'Thu, 19 Apr 2018 13:26:26 GMT'}]",2018-04-20,"[['Singh', 'Deepika', ''], ['Kropf', 'Johannes', ''], ['Hanke', 'Sten', ''], ['Holzinger', 'Andreas', '']]","['Smart homes', 'ambient assisted living', 'independent living', 'ageing', 'quality of life']"
4877,1805.12502,Zhaoqiang Chen,"Zhaoqiang Chen, Qun Chen, Boyi Hou, Murtadha Ahmed, Zhanhuai Li","Improving Machine-based Entity Resolution with Limited Human Effort: A
  Risk Perspective","5 pages, 3 figures",,10.1145/3242153.3242156,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pure machine-based solutions usually struggle in the challenging
classification tasks such as entity resolution (ER). To alleviate this problem,
a recent trend is to involve the human in the resolution process, most notably
the crowdsourcing approach. However, it remains very challenging to effectively
improve machine-based entity resolution with limited human effort. In this
paper, we investigate the problem of human and machine cooperation for ER from
a risk perspective. We propose to select the machine-labeled instances at high
risk of being mislabeled for manual verification. For this task, we present a
risk model that takes into consideration the human-labeled instances as well as
the output of machine resolution. Finally, we evaluate the performance of the
proposed risk model on real data. Our experiments demonstrate that it can pick
up the mislabeled instances with considerably higher accuracy than the existing
alternatives. Provided with the same amount of human cost budget, it can also
achieve better resolution quality than the state-of-the-art approach based on
active learning.
","[{'version': 'v1', 'created': 'Thu, 31 May 2018 14:54:55 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Aug 2018 09:12:46 GMT'}]",2018-08-15,"[['Chen', 'Zhaoqiang', ''], ['Chen', 'Qun', ''], ['Hou', 'Boyi', ''], ['Ahmed', 'Murtadha', ''], ['Li', 'Zhanhuai', '']]","['Entity resolution', 'human-machine cooperation', 'risk analysis']"
4878,2102.08655,Nora Hollenstein,"Nora Hollenstein, Cedric Renggli, Benjamin Glaus, Maria Barrett,
  Marius Troendle, Nicolas Langer, Ce Zhang",Decoding EEG Brain Activity for Multi-Modal Natural Language Processing,,Frontiers of Human Neuroscience 2021,10.3389/fnhum.2021.659410,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Until recently, human behavioral data from reading has mainly been of
interest to researchers to understand human cognition. However, these human
language processing signals can also be beneficial in machine learning-based
natural language processing tasks. Using EEG brain activity to this purpose is
largely unexplored as of yet. In this paper, we present the first large-scale
study of systematically analyzing the potential of EEG brain activity data for
improving natural language processing tasks, with a special focus on which
features of the signal are most beneficial. We present a multi-modal machine
learning architecture that learns jointly from textual input as well as from
EEG features. We find that filtering the EEG signals into frequency bands is
more beneficial than using the broadband signal. Moreover, for a range of word
embedding types, EEG data improves binary and ternary sentiment classification
and outperforms multiple baselines. For more complex tasks such as relation
detection, further research is needed. Finally, EEG data shows to be
particularly promising when limited training data is available.
","[{'version': 'v1', 'created': 'Wed, 17 Feb 2021 09:44:21 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Jul 2021 07:34:28 GMT'}]",2021-08-11,"[['Hollenstein', 'Nora', ''], ['Renggli', 'Cedric', ''], ['Glaus', 'Benjamin', ''], ['Barrett', 'Maria', ''], ['Troendle', 'Marius', ''], ['Langer', 'Nicolas', ''], ['Zhang', 'Ce', '']]","['EEG', 'frequency bands', 'brain activity', 'physiological data', 'natural language processing', 'machine']"
4879,2106.06278,Yann Hamdaoui,"Teodoro Freund, Yann Hamdaoui and Arnaud Spiwack","Union and intersection contracts are hard, actually",,"DLS 2021: Proceedings of the 17th ACM SIGPLAN International
  Symposium on Dynamic Languages",10.1145/3486602.3486767,,cs.PL,http://creativecommons.org/licenses/by/4.0/,"  Union and intersection types are a staple of gradually typed language such as
TypeScript. While it's long been recognized that union and intersection types
are difficult to verify statically, it may appear at first that the dynamic
part of gradual typing is actually pretty simple.
  It turns out however, that in presence of higher-order contracts union and
intersection are deceptively difficult. The literature on higher-order
contracts with union and intersection, while keenly aware of the fact, doesn't
really explain why. We point and illustrate the problems and trade-offs
inherent to union and intersection contracts, via example and a survey of the
literature.
","[{'version': 'v1', 'created': 'Fri, 11 Jun 2021 09:48:19 GMT'}, {'version': 'v2', 'created': 'Thu, 31 Mar 2022 15:55:18 GMT'}]",2022-04-01,"[['Freund', 'Teodoro', ''], ['Hamdaoui', 'Yann', ''], ['Spiwack', 'Arnaud', '']]","['contracts', 'higher-order contracts', 'union', 'intersection']"
4880,1504.08175,Jo\~ao Vinagre,"Jo\~ao Vinagre, Al\'ipio M\'ario Jorge, Jo\~ao Gama",Evaluation of recommender systems in streaming environments,"Workshop on 'Recommender Systems Evaluation: Dimensions and Design'
  (REDD 2014), held in conjunction with RecSys 2014. October 10, 2014, Silicon
  Valley, United States",,10.13140/2.1.4381.5367,,cs.IR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Evaluation of recommender systems is typically done with finite datasets.
This means that conventional evaluation methodologies are only applicable in
offline experiments, where data and models are stationary. However, in real
world systems, user feedback is continuously generated, at unpredictable rates.
Given this setting, one important issue is how to evaluate algorithms in such a
streaming data environment. In this paper we propose a prequential evaluation
protocol for recommender systems, suitable for streaming data environments, but
also applicable in stationary settings. Using this protocol we are able to
monitor the evolution of algorithms' accuracy over time. Furthermore, we are
able to perform reliable comparative assessments of algorithms by computing
significance tests over a sliding window. We argue that besides being suitable
for streaming data, prequential evaluation allows the detection of phenomena
that would otherwise remain unnoticed in the evaluation of both offline and
online recommender systems.
","[{'version': 'v1', 'created': 'Thu, 30 Apr 2015 11:41:49 GMT'}]",2015-05-04,"[['Vinagre', 'João', ''], ['Jorge', 'Alípio Mário', ''], ['Gama', 'João', '']]","['recommendation', 'prequential', 'evaluation', 'data streams']"
4881,1910.07897,Jishnu Ray Chowdhury,"Jishnu Ray Chowdhury, Cornelia Caragea, Doina Caragea",Keyphrase Extraction from Disaster-related Tweets,"12 pages, 7 figures","In The World Wide Web Conference (WWW '19), Ling Liu and Ryen
  White (Eds.). ACM, New York, NY, USA, 1555-1566 (2019)",10.1145/3308558.3313696,,cs.IR cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While keyphrase extraction has received considerable attention in recent
years, relatively few studies exist on extracting keyphrases from social media
platforms such as Twitter, and even fewer for extracting disaster-related
keyphrases from such sources. During a disaster, keyphrases can be extremely
useful for filtering relevant tweets that can enhance situational awareness.
Previously, joint training of two different layers of a stacked Recurrent
Neural Network for keyword discovery and keyphrase extraction had been shown to
be effective in extracting keyphrases from general Twitter data. We improve the
model's performance on both general Twitter data and disaster-related Twitter
data by incorporating contextual word embeddings, POS-tags, phonetics, and
phonological features. Moreover, we discuss the shortcomings of the often used
F1-measure for evaluating the quality of predicted keyphrases with respect to
the ground truth annotations. Instead of the F1-measure, we propose the use of
embedding-based metrics to better capture the correctness of the predicted
keyphrases. In addition, we also present a novel extension of an
embedding-based metric. The extension allows one to better control the penalty
for the difference in the number of ground-truth and predicted keyphrases
","[{'version': 'v1', 'created': 'Thu, 17 Oct 2019 13:31:45 GMT'}]",2019-10-18,"[['Chowdhury', 'Jishnu Ray', ''], ['Caragea', 'Cornelia', ''], ['Caragea', 'Doina', '']]","['Keyphrase Extraction', 'Social Media Analytics', 'Disaster', 'Twitter']"
4882,1706.04427,Kristof Friess,Kristof Friess and H.C. Volker Herwig,"Classification of Smart Environment Scenarios in combination with a
  Human-Wearable-Environment-Communication using wireless connectivity","14pages, Keywords: Wireless Network, Smart Environment,
  Wearable-Computing, UbiComp, Interaction-Scenarios",,10.5121/csit.2017.70704,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The development of computer technology has been rapid. Not so long ago, the
first computer was developed which was large and bulky. Now, the latest
generation of smartphones has a calculation power, which would have been
considered those of supercomputers in 1990. For a smart environment, the person
recognition and re-recognition is an important topic. The distribution of new
technologies like wearable computing is a new approach to the field of person
recognition and re-recognition. This article lays out the idea of identifying
and re-identifying wearable computing devices by listening to their wireless
communication connectivity like Wi-Fi and Bluetooth and building a
classification of interaction scenarios for the combination of
human-wearable-environment.
","[{'version': 'v1', 'created': 'Wed, 14 Jun 2017 12:16:57 GMT'}]",2017-06-15,"[['Friess', 'Kristof', ''], ['Herwig', 'H. C. Volker', '']]","['Wireless Network', 'Smart Environment', 'Wearable-Computing', 'UbiComp', 'Interaction-Scenarios']"
4883,1009.1122,Kamaljit  I Lakhtaria,"Kamaljit I. Lakhtaria, Dhinaharan Nagamalai","Design & Deploy Web 2.0 enable services over Next Generation Network
  Platform",,"International Journal of Database Management Systems (IJDMS)
  Vol.2, No.3, August 2010",10.5121/ijdms.2010.2305,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Next Generation Networks (NGN) aims to integrate for IP-based telecom
infrastructures and provide most advance & high speed emerging value added
services. NGN capable to provide higher innovative services, these services
will able to integrate communication and Web service into a single platform. IP
Multimedia Subsystem, a NGN leading technology, enables a variety of
NGN-compliant communications services to interoperate while being accessed
through different kinds of access networks, preferably broadband. IMS-NGN
services essential by both consumer and corporate users are by now used to
access services, even communications services through the web and web-based
communities and social networks, It is key for success of IMS-based services to
be provided with efficient web access, so users can benefit from those new
services by using web-based applications and user interfaces, not only NGN-IMS
User Equipments and SIP protocol. Many Service are under planning which
provided only under convergence of IMS & Web 2.0. Convergence between Web 2.0
and NGN-IMS creates and serves new invented innovative, entertainment and
information appealing as well as user centric services and applications. These
services merge features from WWW and Communication worlds. On the one hand,
interactivity, ubiquity, social orientation, user participation and content
generation, etc. are relevant characteristics coming from Web 2.0 services.
Parallel IMS enables services including multimedia telephony, media sharing
(video-audio), instant messaging with presence and context, online directory,
etc. all of them applicable to mobile, fixed or convergent telecom networks.
With this paper, this paper brings out the benefits of adopting web 2.0
technologies for telecom services. As the services are today mainly driven by
the user's needs, and proposed the concept of unique customizable service
interface.
","[{'version': 'v1', 'created': 'Mon, 6 Sep 2010 18:44:23 GMT'}]",2011-11-10,"[['Lakhtaria', 'Kamaljit I.', ''], ['Nagamalai', 'Dhinaharan', '']]","['Next Generation Networks (NGN)', 'IP Multimedia Subsystem (IMS)', 'WWW', 'Web 2']"
4884,1903.09344,Weihuang Xu,"Weihuang Xu, Guohao Yu, Alina Zare, Brendan Zurweller, Diane Rowland,
  Joel Reyes-Cabrera, Felix B Fritschi, Roser Matamala, Thomas E. Juenger",Overcoming Small Minirhizotron Datasets Using Transfer Learning,,"Computers and Electronics in Agriculture, 175 (2020)",10.1016/j.compag.2020.105466,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Minirhizotron technology is widely used for studying the development of
roots. Such systems collect visible-wavelength color imagery of plant roots
in-situ by scanning an imaging system within a clear tube driven into the soil.
Automated analysis of root systems could facilitate new scientific discoveries
that would be critical to address the world's pressing food, resource, and
climate issues. A key component of automated analysis of plant roots from
imagery is the automated pixel-level segmentation of roots from their
surrounding soil. Supervised learning techniques appear to be an appropriate
tool for the challenge due to varying local soil and root conditions, however,
lack of enough annotated training data is a major limitation due to the
error-prone and time-consuming manually labeling process. In this paper, we
investigate the use of deep neural networks based on the U-net architecture for
automated, precise pixel-wise root segmentation in minirhizotron imagery. We
compiled two minirhizotron image datasets to accomplish this study: one with
17,550 peanut root images and another with 28 switchgrass root images. Both
datasets were paired with manually labeled ground truth masks. We trained three
neural networks with different architectures on the larger peanut root dataset
to explore the effect of the neural network depth on segmentation performance.
To tackle the more limited switchgrass root dataset, we showed that models
initialized with features pre-trained on the peanut dataset and then fine-tuned
on the switchgrass dataset can improve segmentation performance significantly.
We obtained 99\% segmentation accuracy in switchgrass imagery using only 21
training images. We also observed that features pre-trained on a closely
related but relatively moderate size dataset like our peanut dataset are more
effective than features pre-trained on the large but unrelated ImageNet
dataset.
","[{'version': 'v1', 'created': 'Fri, 22 Mar 2019 03:40:25 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Aug 2019 17:53:20 GMT'}, {'version': 'v3', 'created': 'Fri, 24 Apr 2020 15:13:48 GMT'}]",2020-07-02,"[['Xu', 'Weihuang', ''], ['Yu', 'Guohao', ''], ['Zare', 'Alina', ''], ['Zurweller', 'Brendan', ''], ['Rowland', 'Diane', ''], ['Reyes-Cabrera', 'Joel', ''], ['Fritschi', 'Felix B', ''], ['Matamala', 'Roser', ''], ['Juenger', 'Thomas E.', '']]","['Deep learning', 'Transfer learning', 'Root and soil segmentation', 'Plant root phenotyping', 'Minirhizotron']"
4885,0710.3642,Florent Bouchez,"Florent Bouchez (LIP), Alain Darte (LIP), Fabrice Rastello (LIP)",On the Complexity of Spill Everywhere under SSA Form,10 pages,"ACM SIGPLAN Notices Issue 7, Volume 42 (2007) 103 - 112",10.1145/1254766.1254782,,cs.DS cs.CC,,"  Compilation for embedded processors can be either aggressive (time consuming
cross-compilation) or just in time (embedded and usually dynamic). The
heuristics used in dynamic compilation are highly constrained by limited
resources, time and memory in particular. Recent results on the SSA form open
promising directions for the design of new register allocation heuristics for
embedded systems and especially for embedded compilation. In particular,
heuristics based on tree scan with two separated phases -- one for spilling,
then one for coloring/coalescing -- seem good candidates for designing
memory-friendly, fast, and competitive register allocators. Still, also because
of the side effect on power consumption, the minimization of loads and stores
overhead (spilling problem) is an important issue. This paper provides an
exhaustive study of the complexity of the ``spill everywhere'' problem in the
context of the SSA form. Unfortunately, conversely to our initial hopes, many
of the questions we raised lead to NP-completeness results. We identify some
polynomial cases but that are impractical in JIT context. Nevertheless, they
can give hints to simplify formulations for the design of aggressive
allocators.
","[{'version': 'v1', 'created': 'Fri, 19 Oct 2007 07:24:58 GMT'}]",2009-09-18,"[['Bouchez', 'Florent', '', 'LIP'], ['Darte', 'Alain', '', 'LIP'], ['Rastello', 'Fabrice', '', 'LIP']]","['Register allocation', 'SSA form', 'Spill', 'Complexity']"
4886,1706.09700,Sebastian Baltes,"Sebastian Baltes, Peter Schmitz, and Stephan Diehl",Linking Sketches and Diagrams to Source Code Artifacts,"4 pages, 4 figures, Proceedings of the 22nd ACM SIGSOFT International
  Symposium on Foundations of Software Engineering (FSE 2014), ACM, 2014, pp.
  743-746",,10.1145/2635868.2661672,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent studies have shown that sketches and diagrams play an important role
in the daily work of software developers. If these visual artifacts are
archived, they are often detached from the source code they document, because
there is no adequate tool support to assist developers in capturing, archiving,
and retrieving sketches related to certain source code artifacts. This paper
presents SketchLink, a tool that aims at increasing the value of sketches and
diagrams created during software development by supporting developers in these
tasks. Our prototype implementation provides a web application that employs the
camera of smartphones and tablets to capture analog sketches, but can also be
used on desktop computers to upload, for instance, computer-generated diagrams.
We also implemented a plugin for a Java IDE that embeds the links in Javadoc
comments and visualizes them in situ in the source code editor as graphical
icons.
","[{'version': 'v1', 'created': 'Thu, 29 Jun 2017 12:05:41 GMT'}]",2017-06-30,"[['Baltes', 'Sebastian', ''], ['Schmitz', 'Peter', ''], ['Diehl', 'Stephan', '']]","['Sketches', 'Diagrams', 'Source Code Artifacts', 'Documentation']"
4887,1512.04021,Guido Governatori,"Guido Governatori, Francesco Olivieri, Simone Scannapieco, Antonino
  Rotolo and Matteo Cristani",The Rationale behind the Concept of Goal,,Theory and Practice of Logic Programming 16 (2016) 296-324,10.1017/S1471068416000053,,cs.LO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper proposes a fresh look at the concept of goal and advances that
motivational attitudes like desire, goal and intention are just facets of the
broader notion of (acceptable) outcome. We propose to encode the preferences of
an agent as sequences of ""alternative acceptable outcomes"". We then study how
the agent's beliefs and norms can be used to filter the mental attitudes out of
the sequences of alternative acceptable outcomes. Finally, we formalise such
intuitions in a novel Modal Defeasible Logic and we prove that the resulting
formalisation is computationally feasible.
","[{'version': 'v1', 'created': 'Sun, 13 Dec 2015 09:19:27 GMT'}]",2022-09-13,"[['Governatori', 'Guido', ''], ['Olivieri', 'Francesco', ''], ['Scannapieco', 'Simone', ''], ['Rotolo', 'Antonino', ''], ['Cristani', 'Matteo', '']]","['agents', 'defeasible logic', 'desires', 'intentions', 'goals', 'obligations']"
4888,1304.1986,Andrew Adamatzky,Andrew Adamatzky,On growing connected beta-skeletons,,"Computational Geometry, 46 (2013) 6, 805--816",10.1016/j.comgeo.2012.11.009,,cs.CG nlin.PS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A $\beta$-skeleton, $\beta \geq 1$, is a planar proximity undirected graph of
an Euclidean points set, where nodes are connected by an edge if their
lune-based neighbourhood contains no other points of the given set. Parameter
$\beta$ determines the size and shape of the lune-based neighbourhood. A
$\beta$-skeleton of a random planar set is usually a disconnected graph for
$\beta>2$. With the increase of $\beta$, the number of edges in the
$\beta$-skeleton of a random graph decreases. We show how to grow stable
$\beta$-skeletons, which are connected for any given value of $\beta$ and
characterise morphological transformations of the skeletons governed by $\beta$
and a degree of approximation. We speculate how the results obtained can be
applied in biology and chemistry.
","[{'version': 'v1', 'created': 'Sun, 7 Apr 2013 11:58:28 GMT'}]",2013-04-09,"[['Adamatzky', 'Andrew', '']]","['proximity graphs', 'β-skeletons', 'pattern formation', 'morphogenesis']"
4889,1410.1934,Azam S. Zavar Mooavi,"Azam S. Zavar Moosavi, Adrian Sandu",Approximate Exponential Algorithms to Solve the Chemical Master Equation,14 pages- 4 figures,"Mathematical Modelling And Analysis Vol. 20 , Iss. 3,2015",10.3846/13926292.2015.1048760,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses new simulation algorithms for stochastic chemical
kinetics that exploit the linearity of the chemical master equation and its
matrix exponential exact solution. These algorithms make use of various
approximations of the matrix exponential to evolve probability densities in
time. A sampling of the approximate solutions of the chemical master equation
is used to derive accelerated stochastic simulation algorithms. Numerical
experiments compare the new methods with the established stochastic simulation
algorithm and the tau-leaping method.
","[{'version': 'v1', 'created': 'Tue, 7 Oct 2014 22:11:53 GMT'}]",2016-09-08,"[['Moosavi', 'Azam S. Zavar', ''], ['Sandu', 'Adrian', '']]","['Stochastic chemical kinetics', 'chemical master equation', 'exact solution', 'stochastic simulation algorithm', 'tau-leap']"
4890,1609.00119,Christoph Meier,Christoph Meier and Wolfgang A. Wall and Alexander Popp,"Geometrically Exact Finite Element Formulations for Curved Slender
  Beams: Kirchhoff-Love Theory vs. Simo-Reissner Theory",,,10.1007/s11831-017-9232-5,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The present work focuses on geometrically exact finite elements for highly
slender beams. It aims at the proposal of novel formulations of Kirchhoff-Love
type, a detailed review of existing formulations of Kirchhoff-Love and
Simo-Reissner type as well as a careful evaluation and comparison of the
proposed and existing formulations. Two different rotation interpolation
schemes with strong or weak Kirchhoff constraint enforcement, respectively, as
well as two different choices of nodal triad parametrizations in terms of
rotation or tangent vectors are proposed. The combination of these schemes
leads to four novel finite element variants, all of them based on a
C1-continuous Hermite interpolation of the beam centerline. Essential
requirements such as representability of general 3D, large-deformation, dynamic
problems involving slender beams with arbitrary initial curvatures and
anisotropic cross-section shapes or preservation of objectivity and
path-independence will be investigated analytically and verified numerically
for the different formulations. It will be shown that the geometrically exact
Kirchhoff-Love beam elements proposed in this work are the first ones of this
type that fulfill all the considered requirements. On the contrary,
Simo-Reissner type formulations fulfilling these requirements can be found in
the literature very well. However, it will be argued that the shear-free
Kirchhoff-Love formulations can provide considerable numerical advantages when
applied to highly slender beams. Concretely, several representative numerical
test cases confirm that the proposed Kirchhoff-Love formulations exhibit a
lower discretization error level as well as a considerably improved nonlinear
solver performance in the range of high beam slenderness ratios as compared to
two representative Simo-Reissner element formulations from the literature.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2016 06:11:46 GMT'}]",2019-05-08,"[['Meier', 'Christoph', ''], ['Wall', 'Wolfgang A.', ''], ['Popp', 'Alexander', '']]","['Geometrically exact beams', 'Simo-Reissner', 'Kirchhoff-Love', 'Finite elements', 'Objectivity', 'C1-continuity']"
4891,1505.03049,Jaroslaw Jankowski,"Jaros{\l}aw Jankowski, Rados{\l}aw Michalski, Piotr Br\'odka,
  Przemys{\l}aw Kazienko, Sonja Utz","Knowledge Acquisition from Social Platforms Based on Network
  Distributions Fitting",,"Computers in Human Behavior, 2014, 12",10.1016/j.chb.2014.12.015,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The uniqueness of online social networks makes it possible to implement new
methods that increase the quality and effectiveness of research processes.
While surveys are one of the most important tools for research, the
representativeness of selected online samples is often a challenge and the
results are hardly generalizable. An approach based on surveys with
representativeness targeted at network measure distributions is proposed and
analysed in this paper. Its main goal is to focus not only on sample
representativeness in terms of demographic attributes, but also to follow the
measures distributions within main network. The approach presented has many
application areas related to online research, sampling a network for the
evaluation of collaborative learning processes, and candidate selection for
training purposes with the ability to distribute information within a social
network.
","[{'version': 'v1', 'created': 'Tue, 12 May 2015 15:09:22 GMT'}]",2015-05-13,"[['Jankowski', 'Jarosław', ''], ['Michalski', 'Radosław', ''], ['Bródka', 'Piotr', ''], ['Kazienko', 'Przemysław', ''], ['Utz', 'Sonja', '']]","['social network analysis', 'network sampling', 'collaborative learning', 'adaptive surveys']"
4892,1101.2711,Mauricio Romero,"Mauricio Romero-Torres, Maria Alejandra Tejada, Alberto Acosta","A Proposal to Classify Latinamerican Scientific Journals using Citation
  Indicators: Case Study in Colombia","27 pages, 8 tables",,10.3989/redc.2013.1.876,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Colombian scientific journals are poorly represented in international digital
libraries; however, through Google Scholar (GS) it is possible to determine
their use by the community. Between the years of 2003 and 2007 a classification
of 185 Colombian journals indexed in the Colombian National Bibliographical
Index (IBNP) was performed using the information provided by GS, basing
categorization on size indicators, indexation and citation. The indicators were
analyzed by grouping the journals in two general areas: sciences and social
sciences. In each area, the indicators provided by the digital libraries
Scopus, Redalyc and Scielo were compared. Additionally, the indicators provided
by IBNP journals categories (A1, A2, B and C) were also compared. The sciences
and social sciences had a similar pattern in their indicators. The existence of
positive correlations was established between some indicators and they
predicted that the number of citations per journal in GS and the h index
depends on its visibility in GS and Scopus. We put forward that the current
IBNP categories (A1, A2, B or C) faintly reflect the use of journals by the
community and we propose a classification based on the h index as an infometric
indicator, which reflects not only its visibility in Google Scholar, but also
its inclusion in certain international digital libraries, particularly Scopus.
Our results may be applied to the creation of public policies regarding science
and technology in Colombia and in developing countries.
","[{'version': 'v1', 'created': 'Fri, 14 Jan 2011 03:16:58 GMT'}]",2016-07-29,"[['Romero-Torres', 'Mauricio', ''], ['Tejada', 'Maria Alejandra', ''], ['Acosta', 'Alberto', '']]","['Google Scholar', 'h index', 'Publindex', 'Colombia', 'policies', 'infometrics']"
4893,1203.2301,Valerio Capraro,Valerio Capraro and Marco Scarsini,Existence of equilibria in countable games: an algebraic approach,,Games and Economic Behavior 79 (2013) 163-180,10.1016/j.geb.2013.01.010,,cs.GT math.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although mixed extensions of finite games always admit equilibria, this is
not the case for countable games, the best-known example being Wald's
pick-the-larger-integer game. Several authors have provided conditions for the
existence of equilibria in infinite games. These conditions are typically of
topological nature and are rarely applicable to countable games. Here we
establish an existence result for the equilibrium of countable games when the
strategy sets are a countable group and the payoffs are functions of the group
operation. In order to obtain the existence of equilibria, finitely additive
mixed strategies have to be allowed. This creates a problem of selection of a
product measure of mixed strategies. We propose a family of such selections and
prove existence of an equilibrium that does not depend on the selection. As a
byproduct we show that if finitely additive mixed strategies are allowed, then
Wald's game admits an equilibrium. We also prove existence of equilibria for
nontrivial extensions of matching-pennies and rock-scissors-paper. Finally we
extend the main results to uncountable games.
","[{'version': 'v1', 'created': 'Sun, 11 Mar 2012 01:45:08 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Sep 2012 04:06:10 GMT'}, {'version': 'v3', 'created': 'Tue, 17 Sep 2013 05:42:11 GMT'}]",2017-04-04,"[['Capraro', 'Valerio', ''], ['Scarsini', 'Marco', '']]","['Amenable groups', 'infinite games', 'existence of equilibria', 'invariant means', 'Wald’s game']"
4894,1807.11545,Hazrat Ali,"Kashif Sultan, Hazrat Ali and Zhongshan Zhang","Call Detail Records Driven Anomaly Detection and Traffic Prediction in
  Mobile Cellular Networks",IEEE Access Journal paper,10.1109/ACCESS.2018.2859756,10.1109/ACCESS.2018.2859756,,cs.LG cs.AI stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Mobile networks possess information about the users as well as the network.
Such information is useful for making the network end-to-end visible and
intelligent. Big data analytics can efficiently analyze user and network
information, unearth meaningful insights with the help of machine learning
tools. Utilizing big data analytics and machine learning, this work contributes
in three ways. First, we utilize the call detail records (CDR) data to detect
anomalies in the network. For authentication and verification of anomalies, we
use k-means clustering, an unsupervised machine learning algorithm. Through
effective detection of anomalies, we can proceed to suitable design for
resource distribution as well as fault detection and avoidance. Second, we
prepare anomaly-free data by removing anomalous activities and train a neural
network model. By passing anomaly and anomaly-free data through this model, we
observe the effect of anomalous activities in training of the model and also
observe mean square error of anomaly and anomaly free data. Lastly, we use an
autoregressive integrated moving average (ARIMA) model to predict future
traffic for a user. Through simple visualization, we show that anomaly free
data better generalizes the learning models and performs better on prediction
task.
","[{'version': 'v1', 'created': 'Mon, 30 Jul 2018 19:37:56 GMT'}]",2018-08-01,"[['Sultan', 'Kashif', ''], ['Ali', 'Hazrat', ''], ['Zhang', 'Zhongshan', '']]","['Anomaly', 'Call Data Records', 'Data Analytics']"
4895,1809.07392,Aria Rezaei,"Aria Rezaei, Jie Gao, Jeff M. Phillips, Csaba D. T\'oth","Improved Bounds on Information Dissemination by Manhattan Random
  Waypoint Model","10 pages, ACM SIGSPATIAL 2018, Seattle, US","26th ACM SIGSPATIAL International Conference on Advances in
  Geographic Information Systems (SIGSPATIAL 18), 2018, Seattle, WA, USA",10.1145/3274895.3274917,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the popularity of portable wireless devices it is important to model and
predict how information or contagions spread by natural human mobility -- for
understanding the spreading of deadly infectious diseases and for improving
delay tolerant communication schemes. Formally, we model this problem by
considering $M$ moving agents, where each agent initially carries a
\emph{distinct} bit of information. When two agents are at the same location or
in close proximity to one another, they share all their information with each
other. We would like to know the time it takes until all bits of information
reach all agents, called the \textit{flood time}, and how it depends on the way
agents move, the size and shape of the network and the number of agents moving
in the network.
  We provide rigorous analysis for the \MRWP model (which takes paths with
minimum number of turns), a convenient model used previously to analyze mobile
agents, and find that with high probability the flood time is bounded by
$O\big(N\log M\lceil(N/M) \log(NM)\rceil\big)$, where $M$ agents move on an
$N\times N$ grid. In addition to extensive simulations, we use a data set of
taxi trajectories to show that our method can successfully predict flood times
in both experimental settings and the real world.
","[{'version': 'v1', 'created': 'Wed, 19 Sep 2018 20:05:55 GMT'}]",2018-09-21,"[['Rezaei', 'Aria', ''], ['Gao', 'Jie', ''], ['Phillips', 'Jeff M.', ''], ['Tóth', 'Csaba D.', '']]","['Mobile Information Systems', 'Mobile Agents', 'Information Dissemination']"
4896,1209.0308,Muneendra Ojha,Muneendra Ojha,"Optimizing Supply Chain Management using Gravitational Search Algorithm
  and Multi Agent System","11 pages, 3 figures, ""Published in Conference of Soft Computing and
  Problem Solving 2011, Springer""","Proceedings of the International Conference on SocProS 2011, AISC
  130, pp. 481",10.1007/978-81-322-0487-9_47,,cs.MA cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Supply chain management is a very dynamic operation research problem where
one has to quickly adapt according to the changes perceived in environment in
order to maximize the benefit or minimize the loss. Therefore we require a
system which changes as per the changing requirements. Multi agent system
technology in recent times has emerged as a possible way of efficient solution
implementation for many such complex problems. Our research here focuses on
building a Multi Agent System (MAS), which implements a modified version of
Gravitational Search swarm intelligence Algorithm (GSA) to find out an optimal
strategy in managing the demand supply chain. We target the grains distribution
system among various centers of Food Corporation of India (FCI) as application
domain. We assume centers with larger stocks as objects of greater mass and
vice versa. Applying Newtonian law of gravity as suggested in GSA, larger
objects attract objects of smaller mass towards itself, creating a virtual
grain supply source. As heavier object sheds its mass by supplying some to the
one in demand, it loses its gravitational pull and thus keeps the whole system
of supply chain per-fectly in balance. The multi agent system helps in
continuous updation of the whole system with the help of autonomous agents
which react to the change in environment and act accordingly. This model also
reduces the communication bottleneck to greater extents.
","[{'version': 'v1', 'created': 'Mon, 3 Sep 2012 11:20:57 GMT'}]",2012-09-04,"[['Ojha', 'Muneendra', '']]","['Multi Agent Systems', 'Supply Chain management', 'Particle Swarm Optimization', 'Gravitational Search Algorithm', 'Food Corporation of India']"
4897,1311.7388,Ahmad Siddiqui Dr,"Ahmad Tasnim Siddiqui, Sultan Aljahdali",Web Mining Techniques in E-Commerce Applications,arXiv admin note: text overlap with arXiv:1208.1926 by other authors,"International Journal of Computer Applications, Volume 69 No.8,
  May 2013",10.5120/11864-7648,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today web is the best medium of communication in modern business. Many
companies are redefining their business strategies to improve the business
output. Business over internet provides the opportunity to customers and
partners where their products and specific business can be found. Nowadays
online business breaks the barrier of time and space as compared to the
physical office. Big companies around the world are realizing that e-commerce
is not just buying and selling over Internet, rather it improves the efficiency
to compete with other giants in the market. For this purpose data mining
sometimes called as knowledge discovery is used. Web mining is data mining
technique that is applied to the WWW. There are vast quantities of information
available over the Internet.
","[{'version': 'v1', 'created': 'Thu, 28 Nov 2013 17:57:20 GMT'}]",2013-12-02,"[['Siddiqui', 'Ahmad Tasnim', ''], ['Aljahdali', 'Sultan', '']]","['Electronic commerce', 'data mining', 'web mining']"
4898,0810.0883,K. Raj Kumar,"K. Raj Kumar, G. Caire and A. L. Moustakas",Asymptotic Performance of Linear Receivers in MIMO Fading Channels,"48 pages, Submitted to IEEE Transactions on Information Theory",,10.1109/TIT.2009.2027493,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linear receivers are an attractive low-complexity alternative to optimal
processing for multi-antenna MIMO communications. In this paper we characterize
the information-theoretic performance of MIMO linear receivers in two different
asymptotic regimes. For fixed number of antennas, we investigate the limit of
error probability in the high-SNR regime in terms of the Diversity-Multiplexing
Tradeoff (DMT). Following this, we characterize the error probability for fixed
SNR in the regime of large (but finite) number of antennas.
  As far as the DMT is concerned, we report a negative result: we show that
both linear Zero-Forcing (ZF) and linear Minimum Mean-Square Error (MMSE)
receivers achieve the same DMT, which is largely suboptimal even in the case
where outer coding and decoding is performed across the antennas. We also
provide an approximate quantitative analysis of the markedly different behavior
of the MMSE and ZF receivers at finite rate and non-asymptotic SNR, and show
that while the ZF receiver achieves poor diversity at any finite rate, the MMSE
receiver error curve slope flattens out progressively, as the coding rate
increases.
  When SNR is fixed and the number of antennas becomes large, we show that the
mutual information at the output of a MMSE or ZF linear receiver has
fluctuations that converge in distribution to a Gaussian random variable, whose
mean and variance can be characterized in closed form. This analysis extends to
the linear receiver case a well-known result previously obtained for the
optimal receiver. Simulations reveal that the asymptotic analysis captures
accurately the outage behavior of systems even with a moderate number of
antennas.
","[{'version': 'v1', 'created': 'Mon, 6 Oct 2008 05:32:20 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Feb 2009 04:34:27 GMT'}]",2016-11-18,"[['Kumar', 'K. Raj', ''], ['Caire', 'G.', ''], ['Moustakas', 'A. L.', '']]","['Diversity Multiplexing Tradeoff', 'Large-System Limit', 'Linear Receivers', 'MIMO Channels', 'Spatial Multiplexing']"
4899,1608.05327,Igor Konnov,"Igor Konnov, Marijana Lazic, Helmut Veith and Josef Widder","A Short Counterexample Property for Safety and Liveness Verification of
  Fault-tolerant Distributed Algorithms","16 pages, 11 pages appendix",,10.1145/3009837.3009860,,cs.LO cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Distributed algorithms have many mission-critical applications ranging from
embedded systems and replicated databases to cloud computing. Due to
asynchronous communication, process faults, or network failures, these
algorithms are difficult to design and verify. Many algorithms achieve fault
tolerance by using threshold guards that, for instance, ensure that a process
waits until it has received an acknowledgment from a majority of its peers.
Consequently, domain-specific languages for fault-tolerant distributed systems
offer language support for threshold guards.
  We introduce an automated method for model checking of safety and liveness of
threshold-guarded distributed algorithms in systems where the number of
processes and the fraction of faulty processes are parameters. Our method is
based on a short counterexample property: if a distributed algorithm violates a
temporal specification (in a fragment of LTL), then there is a counterexample
whose length is bounded and independent of the parameters. We prove this
property by (i) characterizing executions depending on the structure of the
temporal formula, and (ii) using commutativity of transitions to accelerate and
shorten executions. We extended the ByMC toolset (Byzantine Model Checker) with
our technique, and verified liveness and safety of 10 prominent fault-tolerant
distributed algorithms, most of which were out of reach for existing
techniques.
","[{'version': 'v1', 'created': 'Thu, 18 Aug 2016 16:43:03 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Nov 2016 10:37:16 GMT'}]",2016-11-10,"[['Konnov', 'Igor', ''], ['Lazic', 'Marijana', ''], ['Veith', 'Helmut', ''], ['Widder', 'Josef', '']]","['Parameterized model checking', 'Byzantine faults', 'faulttolerant distributed algorithms', 'reliable broadcast']"
4900,1307.3321,K.S.Kuppusamy,"K.S.Kuppusamy, Leena Mary Francis, G.Aghila",Report: A Model for Remote Parental Control System Using Smartphones,"12 Pages, 4 Figures","International Journal on Cybernetics & Informatics ( IJCI) Vol.2,
  No.3, June 2013",10.5121/ijci.2013.2303,ISSN : 2277 - 548X,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The mammoth growth in the information technology sector in terms of both
quantity and pervasiveness has opened up a Pandora's Box of issues which are
relevant in technical and social aspects. This paper attempts to address one of
the critical issues among them which is concerned with the proper utilization
of computer systems and mobile devices by children and teens. This paper
proposes a model termed ""RePort (Remote Parental Control System using
Smartphones)"" which is aimed towards monitoring the access behaviour of
computers and smartphones in general and internet to be specific, by teens and
children in a private environment. The model is built such that the access
behaviour shall be monitored from a remote location with the help of smartphone
devices. The access- characteristics are modelled using various parameters in
four different layers of the model.The proposed model is validated with a
prototype implementation in the Android platform for smartphones and as a
background service for computer systems. Various experiments were conducted on
the prototype implementation and results of the experiments validate the
efficiency of the proposed model with respect to user's relevancy metric which
is computed as 93.46%.
","[{'version': 'v1', 'created': 'Fri, 12 Jul 2013 04:43:35 GMT'}]",2013-07-15,"[['Kuppusamy', 'K. S.', ''], ['Francis', 'Leena Mary', ''], ['Aghila', 'G.', '']]","['Parental Control', 'Mobile Computing', 'Smartphones']"
4901,1306.0165,Daqiang Zhang,"Daqiang Zhang, Qin Zou, Haoyi Xiong","CRUC: Cold-start Recommendations Using Collaborative Filtering in
  Internet of Things","Elsevier ESEP 2011: 9-10 December 2011, Singapore, Elsevier Energy
  Procedia, http://www.elsevier.com/locate/procedia/, 2011",,10.1016/j.egypro.2011.11.497,,cs.IR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Internet of Things (IoT) aims at interconnecting everyday objects
(including both things and users) and then using this connection information to
provide customized user services. However, IoT does not work in its initial
stages without adequate acquisition of user preferences. This is caused by
cold-start problem that is a situation where only few users are interconnected.
To this end, we propose CRUC scheme - Cold-start Recommendations Using
Collaborative Filtering in IoT, involving formulation, filtering and prediction
steps. Extensive experiments over real cases and simulation have been performed
to evaluate the performance of CRUC scheme. Experimental results show that CRUC
efficiently solves the cold-start problem in IoT.
","[{'version': 'v1', 'created': 'Sun, 2 Jun 2013 02:23:44 GMT'}]",2013-06-04,"[['Zhang', 'Daqiang', ''], ['Zou', 'Qin', ''], ['Xiong', 'Haoyi', '']]","['Cold-start Problem', 'Internet of Things', 'Collaborative Filtering']"
4902,1305.6537,Arthur Carvalho,Arthur Carvalho,"A Cooperative Coevolutionary Genetic Algorithm for Learning Bayesian
  Network Structures",,,10.1145/2001576.2001729,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a cooperative coevolutionary genetic algorithm for learning
Bayesian network structures from fully observable data sets. Since this problem
can be decomposed into two dependent subproblems, that is to find an ordering
of the nodes and an optimal connectivity matrix, our algorithm uses two
subpopulations, each one representing a subtask. We describe the empirical
results obtained with simulations of the Alarm and Insurance networks. We show
that our algorithm outperforms the deterministic algorithm K2.
","[{'version': 'v1', 'created': 'Tue, 28 May 2013 15:42:51 GMT'}]",2013-05-29,"[['Carvalho', 'Arthur', '']]","['Cooperative Coevolutionary Genetic Algorithms', 'BayesianNetworks', 'Structure Learning']"
4903,1612.02802,Homayun Afrabandpey,"Homayun Afrabandpey, Tomi Peltola, Samuel Kaski","Interactive Prior Elicitation of Feature Similarities for Small Sample
  Size Prediction",,,10.1145/3079628.3079698,,cs.LG cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Regression under the ""small $n$, large $p$"" conditions, of small sample size
$n$ and large number of features $p$ in the learning data set, is a recurring
setting in which learning from data is difficult. With prior knowledge about
relationships of the features, $p$ can effectively be reduced, but explicating
such prior knowledge is difficult for experts. In this paper we introduce a new
method for eliciting expert prior knowledge about the similarity of the roles
of features in the prediction task. The key idea is to use an interactive
multidimensional-scaling (MDS) type scatterplot display of the features to
elicit the similarity relationships, and then use the elicited relationships in
the prior distribution of prediction parameters. Specifically, for learning to
predict a target variable with Bayesian linear regression, the feature
relationships are used to construct a Gaussian prior with a full covariance
matrix for the regression coefficients. Evaluation of our method in experiments
with simulated and real users on text data confirm that prior elicitation of
feature similarities improves prediction accuracy. Furthermore, elicitation
with an interactive scatterplot display outperforms straightforward elicitation
where the users choose feature pairs from a feature list.
","[{'version': 'v1', 'created': 'Thu, 8 Dec 2016 20:35:46 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Feb 2017 15:00:29 GMT'}]",2017-07-27,"[['Afrabandpey', 'Homayun', ''], ['Peltola', 'Tomi', ''], ['Kaski', 'Samuel', '']]","['Interaction', 'prior elicitation', 'regression', 'small n large p', 'visualization']"
4904,1502.06752,Reuillon Romain,"Clara Schmitt (GC), S\'ebastien Rey-Coyrehourcq (GC), Romain Reuillon
  (GC, ISC-PIF), Denise Pumain (GC)","Half a billion simulations: evolutionary algorithms and distributed
  computing for calibrating the SimpopLocal geographical model",,,10.1068/b130064p,,cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-agent geographical models integrate very large numbers of spatial
interactions. In order to validate those models large amount of computing is
necessary for their simulation and calibration. Here a new data processing
chain including an automated calibration procedure is experimented on a
computational grid using evolutionary algorithms. This is applied for the first
time to a geographical model designed to simulate the evolution of an early
urban settlement system. The method enables us to reduce the computing time and
provides robust results. Using this method, we identify several parameter
settings that minimise three objective functions that quantify how closely the
model results match a reference pattern. As the values of each parameter in
different settings are very close, this estimation considerably reduces the
initial possible domain of variation of the parameters. The model is thus a
useful tool for further multiple applications on empirical historical
situations.
","[{'version': 'v1', 'created': 'Tue, 24 Feb 2015 10:34:36 GMT'}]",2015-02-25,"[['Schmitt', 'Clara', '', 'GC'], ['Rey-Coyrehourcq', 'Sébastien', '', 'GC'], ['Reuillon', 'Romain', '', 'GC, ISC-PIF'], ['Pumain', 'Denise', '', 'GC']]","['Simulation model', 'multi-agent system', 'calibration', 'evolutionary algorithm', 'geographical modelling', 'high performance computing', 'model validation']"
4905,1709.08920,Fabrizio Carcillo,"Fabrizio Carcillo, Andrea Dal Pozzolo, Yann-A\""el Le Borgne, Olivier
  Caelen, Yannis Mazzer, Gianluca Bontempi","SCARFF: a Scalable Framework for Streaming Credit Card Fraud Detection
  with Spark",,Information Fusion 41C (2018) pp. 182-194,10.1016/j.inffus.2017.09.005,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The expansion of the electronic commerce, together with an increasing
confidence of customers in electronic payments, makes of fraud detection a
critical factor. Detecting frauds in (nearly) real time setting demands the
design and the implementation of scalable learning techniques able to ingest
and analyse massive amounts of streaming data. Recent advances in analytics and
the availability of open source solutions for Big Data storage and processing
open new perspectives to the fraud detection field. In this paper we present a
SCAlable Real-time Fraud Finder (SCARFF) which integrates Big Data tools
(Kafka, Spark and Cassandra) with a machine learning approach which deals with
imbalance, nonstationarity and feedback latency. Experimental results on a
massive dataset of real credit card transactions show that this framework is
scalable, efficient and accurate over a big stream of transactions.
","[{'version': 'v1', 'created': 'Tue, 26 Sep 2017 10:07:22 GMT'}]",2017-09-27,"[['Carcillo', 'Fabrizio', ''], ['Pozzolo', 'Andrea Dal', ''], ['Borgne', 'Yann-Aël Le', ''], ['Caelen', 'Olivier', ''], ['Mazzer', 'Yannis', ''], ['Bontempi', 'Gianluca', '']]","['Big Data', 'Fraud Detection', 'Streaming Analytics', 'MachineLearning', 'Scalable Software', 'Kafka', 'Spark', 'Cassandra']"
4906,1310.4904,Akira Otsuki,Akira Otsuki,"Dynamic Extraction of Key Paper from the Cluster Using Variance Values
  of Cited Literature","12 pages, 8 figures, 3 tables","International Journal of Data Mining & Knowledge Management
  Process (IJDKP) Vol.3, No.5, September 2013",10.5121/ijdkp.2013.3506,,cs.DL,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  When looking into recent research trends in the field of academic landscape,
citation network analysis is common and automated clustering of many academic
papers has been achieved by making good use of various techniques. However,
specifying the features of each area identified by automated clustering or
dynamically extracted key papers in each research area has not yet been
achieved. In this study, therefore, we propose a method for dynamically
specifying the key papers in each area identified by clustering. We will
investigate variance values of the publication year of the cited literature and
calculate each cited paper's importance by applying the variance values to the
PageRank algorithm.
","[{'version': 'v1', 'created': 'Fri, 18 Oct 2013 03:43:40 GMT'}]",2013-10-21,"[['Otsuki', 'Akira', '']]","['Bibliometrics', 'Clustering', 'Academic landscape', 'Database', 'Network analysis']"
4907,1905.02245,Mohammad Jafar Mashhadi Ebrahim,"Mohammad Jafar Mashhadi, Taha R. Siddiqui, Hadi Hemmati, Howard Loewen","Interactive Semi-automated Specification Mining for Debugging: An
  Experience Report",Accepted at IST journal,,10.1016/j.infsof.2019.05.002,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Context: Specification mining techniques are typically used to extract the
specification of a software in the absence of (up-to-date) specification
documents. This is useful for program comprehension, testing, and anomaly
detection. However, specification mining can also potentially be used for
debugging, where a faulty behavior is abstracted to give developers a context
about the bug and help them locating it. Objective: In this project, we
investigate this idea in an industrial setting. We propose a very basic
semi-automated specification mining approach for debugging and apply that on
real reported issues from an AutoPilot software system from our industry
partner, MicroPilot Inc. The objective is to assess the feasibility and
usefulness of the approach in a real-world setting. Method: The approach is
developed as a prototype tool, working on C code, which accept a set of
relevant state fields and functions, per issue, and generates an extended
finite state machine that represents the faulty behavior, abstracted with
respect to the relevant context (the selected fields and functions). Results:
We qualitatively evaluate the approach by a set of interviews (including
observational studies) with the company's developers on their real-world
reported bugs. The results show that a) our approach is feasible, b) it can be
automated to some extent, and c) brings advantages over only using their
code-level debugging tools. We also compared this approach with traditional
fully automated state-merging algorithms and reported several issues when
applying those techniques on a real-world debugging context. Conclusion: The
main conclusion of this study is that the idea of an ""interactive""
specification mining rather than a fully automated mining tool is NOT
impractical and indeed is useful for the debugging use case.
","[{'version': 'v1', 'created': 'Mon, 6 May 2019 19:39:26 GMT'}]",2019-05-09,"[['Mashhadi', 'Mohammad Jafar', ''], ['Siddiqui', 'Taha R.', ''], ['Hemmati', 'Hadi', ''], ['Loewen', 'Howard', '']]","['Specification mining', 'Debugging', 'Interview', 'Semi-automated', 'Case study']"
4908,1707.06833,Ayan Kumar Bhunia,"Partha Pratim Roy, Ayan Kumar Bhunia, Umapada Pal","Date-Field Retrieval in Scene Image and Video Frames using Text
  Enhancement and Shape Coding",,,10.1016/j.neucom.2016.08.141,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Text recognition in scene image and video frames is difficult because of low
resolution, blur, background noise, etc. Since traditional OCRs do not perform
well in such images, information retrieval using keywords could be an
alternative way to index/retrieve such text information. Date is a useful piece
of information which has various applications including date-wise videos/scene
searching, indexing or retrieval. This paper presents a date spotting based
information retrieval system for natural scene image and video frames where
text appears with complex backgrounds. We propose a line based date spotting
approach using Hidden Markov Model (HMM) which is used to detect the date
information in a given text. Different date models are searched from a line
without segmenting characters or words. Given a text line image in RGB, we
apply an efficient gray image conversion to enhance the text information.
Wavelet decomposition and gradient sub-bands are used to enhance text
information in gray scale. Next, Pyramid Histogram of Oriented Gradient (PHOG)
feature has been extracted from gray image and binary images for date-spotting
framework. Binary and gray image features are combined by MLP based Tandem
approach. Finally, to boost the performance further, a shape coding based
scheme is used to combine the similar shape characters in same class during
word spotting. For our experiment, three different date models have been
constructed to search similar date information having numeric dates that
contains numeral values and punctuations and semi-numeric that contains dates
with numerals along with months in scene/video text. We have tested our system
on 1648 text lines and the results show the effectiveness of our proposed date
spotting approach.
","[{'version': 'v1', 'created': 'Fri, 21 Jul 2017 10:45:00 GMT'}]",2017-07-24,"[['Roy', 'Partha Pratim', ''], ['Bhunia', 'Ayan Kumar', ''], ['Pal', 'Umapada', '']]","['Date-based indexing', 'Scene text and Video text retrieval', 'Date extraction', 'Date']"
4909,1703.06452,Ronald Kemker,Ronald Kemker and Carl Salvaggio and Christopher Kanan,"Algorithms for Semantic Segmentation of Multispectral Remote Sensing
  Imagery using Deep Learning",45 pages,"Published in ISPRS Journal of Photogrammetry and Remote Sensing
  2018",10.1016/j.isprsjprs.2018.04.014,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep convolutional neural networks (DCNNs) have been used to achieve
state-of-the-art performance on many computer vision tasks (e.g., object
recognition, object detection, semantic segmentation) thanks to a large
repository of annotated image data. Large labeled datasets for other sensor
modalities, e.g., multispectral imagery (MSI), are not available due to the
large cost and manpower required. In this paper, we adapt state-of-the-art DCNN
frameworks in computer vision for semantic segmentation for MSI imagery. To
overcome label scarcity for MSI data, we substitute real MSI for generated
synthetic MSI in order to initialize a DCNN framework. We evaluate our network
initialization scheme on the new RIT-18 dataset that we present in this paper.
This dataset contains very-high resolution MSI collected by an unmanned
aircraft system. The models initialized with synthetic imagery were less prone
to over-fitting and provide a state-of-the-art baseline for future work.
","[{'version': 'v1', 'created': 'Sun, 19 Mar 2017 15:21:32 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Sep 2017 13:45:12 GMT'}, {'version': 'v3', 'created': 'Tue, 1 May 2018 20:59:31 GMT'}]",2018-05-03,"[['Kemker', 'Ronald', ''], ['Salvaggio', 'Carl', ''], ['Kanan', 'Christopher', '']]","['Deep learning', 'convolutional neural network', 'semanticsegmentation', 'multispectral', 'unmanned aerial system', 'synthetic imagery']"
4910,1807.04867,Suhad Faisal Behadili,Suhad Faisal Behadili,Robot human interface for housekepeer with wireless capabilities,article in journal,"International Journal of Computer Networks & Communications
  (IJCNC) Vol.10, No.3, May 2018",10.5121/ijcnc.2018.10308,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the design and implementation of a Human Interface for a
housekeeper robot. It bases on the idea of making the robot understand the
human needs without making the human go through the details of robots work, for
example, the way that the robot implements the work or the method that the
robot uses to plan the path in order to reach the work area. The interface
commands based on idioms of the natural human language and designed in a manner
that the user gives the robot several commands with their execution date/time.
","[{'version': 'v1', 'created': 'Thu, 12 Jul 2018 23:50:31 GMT'}]",2018-07-16,"[['Behadili', 'Suhad Faisal', '']]","['Housekeeper', 'robot', 'wireless', 'human', 'mobile', 'tasks']"
4911,1004.0256,Lennart Nacke Ph.D.,Lennart E. Nacke,From Playability to a Hierarchical Game Usability Model,"2 pages, 1 figure",,10.1145/1639601.1639609,,cs.HC cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a brief review of current game usability models. This
leads to the conception of a high-level game development-centered usability
model that integrates current usability approaches in game industry and game
research.
","[{'version': 'v1', 'created': 'Thu, 1 Apr 2010 23:42:11 GMT'}]",2010-04-05,"[['Nacke', 'Lennart E.', '']]","['game', 'usability', 'player experience', 'playability', 'model', 'theory']"
4912,1705.07047,Aida Slavic,Aida Slavic,Faceted classification: management and use,,"Axiomathes, 18 (2), pp. 257-71 (2008)",10.1007/s10516-007-9030-z,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper discusses issues related to the use of faceted classifications in
an online environment. The author argues that knowledge organization systems
can be fully utilized in information retrieval only if they are exposed and
made available for machine processing. The experience with classification
automation to date may be used to speed up and ease the conversion of existing
faceted schemes or the creation of management tools for new systems. The author
suggests that it is possible to agree on a set of functional requirements for
supporting faceted classifications online that are equally relevant for the
maintenance of classifications, the creation of classification indexing tools,
or the management of classifications in an authority file. It is suggested that
a set of requirements for analytico-synthetic classifications may be put
forward to improve standards for the use and exchange of knowledge organization
systems.
","[{'version': 'v1', 'created': 'Fri, 19 May 2017 15:22:19 GMT'}]",2017-05-22,"[['Slavic', 'Aida', '']]","['faceted classifications', 'analytico-synthetic classifications', 'management', 'automation', 'machine readable formats', 'vocabulary standards   1']"
4913,1808.07560,Konstantinos Gavriil,"Konstantinos Gavriil, Alexander Schiftner, Helmut Pottmann","Optimizing B-spline surfaces for developability and paneling
  architectural freeform surfaces",,Computer-Aided Design 111 (2019) 29-43,10.1016/j.cad.2019.01.006,,cs.GR math.DG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by applications in architecture and design, we present a novel
method for increasing the developability of a B-spline surface. We use the
property that the Gauss image of a developable surface is 1-dimensional and can
be locally well approximated by circles. This is cast into an algorithm for
thinning the Gauss image by increasing the planarity of the Gauss images of
appropriate neighborhoods. A variation of the main method allows us to tackle
the problem of paneling a freeform architectural surface with developable
panels, in particular enforcing rotational cylindrical, rotational conical and
planar panels, which are the main preferred types of developable panels in
architecture due to the reduced cost of manufacturing.
","[{'version': 'v1', 'created': 'Wed, 22 Aug 2018 20:53:08 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Jan 2019 12:13:13 GMT'}, {'version': 'v3', 'created': 'Tue, 26 Feb 2019 09:04:34 GMT'}]",2019-02-27,"[['Gavriil', 'Konstantinos', ''], ['Schiftner', 'Alexander', ''], ['Pottmann', 'Helmut', '']]","['developable surface', 'spline surface', 'architectural geometry', 'computational differentialgeometry', 'constrained optimization']"
4914,1003.5442,Secretary Aircc Journal,"Vasundara Patel (1), K. S. Gurumurthy (2) ((1) Vishweshwaraiah
  Technological University, India, (2) UVCE, Bangalore, India)",Arithmetic Operations in Multi-Valued Logic,"12 Pages, VLSICS Journal 2010","International Journal Of VLSI Design & Communication Systems 1.1
  (2010) 21-32",10.5121/vlsic.2010.1103,,cs.OH,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper presents arithmetic operations like addition, subtraction and
multiplications in Modulo-4 arithmetic, and also addition, multiplication in
Galois field, using multi-valued logic (MVL). Quaternary to binary and binary
to quaternary converters are designed using down literal circuits. Negation in
modular arithmetic is designed with only one gate. Logic design of each
operation is achieved by reducing the terms using Karnaugh diagrams, keeping
minimum number of gates and depth of net in to consideration. Quaternary
multiplier circuit is proposed to achieve required optimization. Simulation
result of each operation is shown separately using Hspice.
","[{'version': 'v1', 'created': 'Mon, 29 Mar 2010 07:10:58 GMT'}]",2010-07-15,"[['Patel', 'Vasundara', ''], ['Gurumurthy', 'K. S.', '']]","['Multiple-valued logic', 'Quaternary logic', 'Modulo-n addition and multiplication', 'Galois addition', 'multiplication']"
4915,1811.11686,Prabhat Kumar,"Prabhat Kumar, Paola Fanzio, Luigi Sasso, Matthijs Langelaar",Compliant Fluidic Control Structures: Concept and Synthesis Approach,12 Figures,"Computers & Structures, 2019",10.1016/j.compstruc.2019.02.004,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The concept and synthesis approach for planar Compliant Fluidic Control
Structures (CFCSs), monolithic flexible continua with embedded functional
pores, is presented in this manuscript. Such structures are envisioned to find
application in biomedicine as tunable microuidic devices for drug/nutrient
delivery. The functional pores enlarge and/or contract upondeformation of the
compliant structure in response to external stimuli, facilitating the regulated
control of fluid/nutrient/drug transport. A thickness design variable based
topology optimization problem is formulated to generate effective designs of
these structures. An objective based on hydraulic diameter(s) is
conceptualized, and it is extremized using a gradient based optimizer. Both
geometrical and material nonlinearities are considered. The nonlinear behaviour
of employed hyperelastic material is modeled via the Arruda-Boyce constitutive
material model. Large-displacement finite element analysis is performed using
the updated Lagrangian formulation in plane-stress setting. The proposed
synthesis approach is applied to various CFCSs for a variety of fluidic control
functionalities. The optimized designs of various CFCSs with single and/or
multiple functional pores are fabricated via a Polydimethylsiloxane (PDMS) soft
lithography process, using a high precision 3D printed mold and their
performances are compared. with the numerical predictions.
","[{'version': 'v1', 'created': 'Wed, 28 Nov 2018 17:08:54 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Nov 2018 08:56:02 GMT'}, {'version': 'v3', 'created': 'Fri, 19 Apr 2019 14:34:14 GMT'}]",2019-04-22,"[['Kumar', 'Prabhat', ''], ['Fanzio', 'Paola', ''], ['Sasso', 'Luigi', ''], ['Langelaar', 'Matthijs', '']]","['Compliant structures', 'Microfluidic devices', 'Topology optimization', 'PDMS', 'Nonlinear finite element analysis']"
4916,1703.07244,Sergey Polyakovskiy,S. Polyakovskiy and R. M'Hallah,"A Hybrid Feasibility Constraints-Guided Search to the Two-Dimensional
  Bin Packing Problem with Due Dates",,,10.1016/j.ejor.2017.10.046,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The two-dimensional non-oriented bin packing problem with due dates packs a
set of rectangular items, which may be rotated by 90 degrees, into identical
rectangular bins. The bins have equal processing times. An item's lateness is
the difference between its due date and the completion time of its bin. The
problem packs all items without overlap as to minimize maximum lateness Lmax.
  The paper proposes a tight lower bound that enhances an existing bound on
Lmax for 24.07% of the benchmark instances and matches it in 30.87% cases. In
addition, it models the problem using mixed integer programming (MIP), and
solves small-sized instances exactly using CPLEX. It approximately solves
larger-sized instances using a two-stage heuristic. The first stage constructs
an initial solution via a first-fit heuristic that applies an iterative
constraint programming (CP)-based neighborhood search. The second stage, which
is iterative too, approximately solves a series of assignment low-level MIPs
that are guided by feasibility constraints. It then enhances the solution via a
high-level random local search. The approximate approach improves existing
upper bounds by 27.45% on average, and obtains the optimum for 33.93% of the
instances. Overall, the exact and approximate approaches identify the optimum
for 39.07% cases.
  The proposed approach is applicable to complex problems. It applies CP and
MIP sequentially, while exploring their advantages, and hybridizes heuristic
search with MIP. It embeds a new lookahead strategy that guards against
infeasible search directions and constrains the search to improving directions
only; thus, differs from traditional lookahead beam searches.
","[{'version': 'v1', 'created': 'Tue, 21 Mar 2017 14:39:35 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Nov 2017 02:12:09 GMT'}]",2017-11-09,"[['Polyakovskiy', 'S.', ''], [""M'Hallah"", 'R.', '']]","['cutting', 'two-dimensional bin packing', 'batch scheduling', 'packingheuristic', 'lookahead search']"
4917,1501.01193,Kais Mekki,"Ahmed Zouinkhi, Kais Mekki, Mohamed Naceur Abdelkrim","Application and network layers design for wireless sensor network to
  supervise chemical active product warehouse","20 pages in International Journal of Computer Science, Engineering
  and Applications (IJCSEA), Vol.4, No.6, December 2014, pp. 53-72",,10.5121/ijcsea.2014.4605,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless sensor networks have profound effects on many application fields
like security management which need an immediate and fast system reaction.
Indeed, the monitoring of a dangerous product warehouse is a major issue in
chemical industry field. This paper describes the design of chemical warehouse
security system using the concept of active products and wireless sensor
networks. A security application layer is developed to supervise and exchange
messages between nodes and the control center to prevent industrial accident.
Different security rules are proposed on this layer to monitor the internal
state and incompatible products distance. If a critical event is detected, the
application generates alert message which need a short end to end delay and low
packet loss rate constraints by network layer. Thus, a QoS routing protocol is
also developed in the network layer. The proposed solution is implemented in
Castalia/OMNeT++ simulator. Simulation results show that the system reacts
perfectly for critical event and can meet the QoS constraints of alert message.
","[{'version': 'v1', 'created': 'Tue, 6 Jan 2015 15:08:13 GMT'}]",2015-01-07,"[['Zouinkhi', 'Ahmed', ''], ['Mekki', 'Kais', ''], ['Abdelkrim', 'Mohamed Naceur', '']]","['Security System', 'Active Product', 'Wireless Sensor Networks', 'Routing protocol', 'Quality of Service', 'CastaliaSimulation']"
4918,1805.04781,Andrea Zonca,"Andrea Zonca, Robert S. Sinkovits","Deploying Jupyter Notebooks at scale on XSEDE resources for Science
  Gateways and workshops","7 pages, 3 figures, PEARC '18: Practice and Experience in Advanced
  Research Computing, July 22--26, 2018, Pittsburgh, PA, USA",,10.1145/3219104.3219122,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Jupyter Notebooks have become a mainstream tool for interactive computing in
every field of science. Jupyter Notebooks are suitable as companion
applications for Science Gateways, providing more flexibility and
post-processing capability to the users. Moreover they are often used in
training events and workshops to provide immediate access to a pre-configured
interactive computing environment. The Jupyter team released the JupyterHub web
application to provide a platform where multiple users can login and access a
Jupyter Notebook environment. When the number of users and memory requirements
are low, it is easy to setup JupyterHub on a single server. However, setup
becomes more complicated when we need to serve Jupyter Notebooks at scale to
tens or hundreds of users. In this paper we will present three strategies for
deploying JupyterHub at scale on XSEDE resources. All options share the
deployment of JupyterHub on a Virtual Machine on XSEDE Jetstream. In the first
scenario, JupyterHub connects to a supercomputer and launches a single node job
on behalf of each user and proxies back the Notebook from the computing node
back to the user's browser. In the second scenario, implemented in the context
of a XSEDE consultation for the IRIS consortium for Seismology, we deploy
Docker in Swarm mode to coordinate many XSEDE Jetstream virtual machines to
provide Notebooks with persistent storage and quota. In the last scenario we
install the Kubernetes containers orchestration framework on Jetstream to
provide a fault-tolerant JupyterHub deployment with a distributed filesystem
and capability to scale to thousands of users. In the conclusion section we
provide a link to step-by-step tutorials complete with all the necessary
commands and configuration files to replicate these deployments.
","[{'version': 'v1', 'created': 'Sat, 12 May 2018 21:03:37 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Jul 2018 13:29:51 GMT'}, {'version': 'v3', 'created': 'Wed, 25 Jul 2018 10:51:43 GMT'}]",2018-07-26,"[['Zonca', 'Andrea', ''], ['Sinkovits', 'Robert S.', '']]","['PEARC Proceedings', 'Jupyter Notebook', 'Docker', 'Kubernetes']"
4919,1304.1978,Carola Doerr,"Carola Doerr, Francois-Michel De Rainville",Constructing Low Star Discrepancy Point Sets with Genetic Algorithms,"Extended abstract appeared at GECCO 2013. v2: corrected 3 numbers in
  table 4",,10.1145/2463372.2463469,,cs.NE cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Geometric discrepancies are standard measures to quantify the irregularity of
distributions. They are an important notion in numerical integration. One of
the most important discrepancy notions is the so-called \emph{star
discrepancy}. Roughly speaking, a point set of low star discrepancy value
allows for a small approximation error in quasi-Monte Carlo integration. It is
thus the most studied discrepancy notion.
  In this work we present a new algorithm to compute point sets of low star
discrepancy. The two components of the algorithm (for the optimization and the
evaluation, respectively) are based on evolutionary principles. Our algorithm
clearly outperforms existing approaches. To the best of our knowledge, it is
also the first algorithm which can be adapted easily to optimize inverse star
discrepancies.
","[{'version': 'v1', 'created': 'Sun, 7 Apr 2013 10:29:41 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Oct 2013 13:57:57 GMT'}]",2013-10-08,"[['Doerr', 'Carola', ''], ['De Rainville', 'Francois-Michel', '']]","['Geometric discrepancy', 'Monte-Carlo methods', 'information-based complexity', 'search heuristics', 'genetic algorithms', 'algorithm engineering']"
4920,1112.2495,Simon Perdrix,"Sylvain Gravier, J\'er\^ome Javelle, Mehdi Mhalla, Simon Perdrix",On Weak Odd Domination and Graph-based Quantum Secret Sharing,"Subsumes arXiv:1109.6181: Optimal accessing and non-accessing
  structures for graph protocols","TCS Theoretical Computer Science 598, 129-137. 2015",10.1016/j.tcs.2015.05.038,,cs.CC quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A weak odd dominated (WOD) set in a graph is a subset B of vertices for which
there exists a distinct set of vertices C such that every vertex in B has an
odd number of neighbors in C. We point out the connections of weak odd
domination with odd domination, [sigma,rho]-domination, and perfect codes. We
introduce bounds on \kappa(G), the maximum size of WOD sets of a graph G, and
on \kappa'(G), the minimum size of non WOD sets of G. Moreover, we prove that
the corresponding decision problems are NP-complete. The study of weak odd
domination is mainly motivated by the design of graph-based quantum secret
sharing protocols: a graph G of order n corresponds to a secret sharing
protocol which threshold is \kappa_Q(G) = max(\kappa(G), n-\kappa'(G)). These
graph-based protocols are very promising in terms of physical implementation,
however all such graph-based protocols studied in the literature have
quasi-unanimity thresholds (i.e. \kappa_Q(G)=n-o(n) where n is the order of the
graph G underlying the protocol). In this paper, we show using probabilistic
methods, the existence of graphs with smaller \kappa_Q (i.e. \kappa_Q(G)<
0.811n where n is the order of G). We also prove that deciding for a given
graph G whether \kappa_Q(G)< k is NP-complete, which means that one cannot
efficiently double check that a graph randomly generated has actually a
\kappa_Q smaller than 0.811n.
","[{'version': 'v1', 'created': 'Mon, 12 Dec 2011 10:16:19 GMT'}, {'version': 'v2', 'created': 'Mon, 21 May 2012 14:54:10 GMT'}]",2016-10-11,"[['Gravier', 'Sylvain', ''], ['Javelle', 'Jérôme', ''], ['Mhalla', 'Mehdi', ''], ['Perdrix', 'Simon', '']]","['Complexity', 'Graph Theory', 'NP-Completeness', 'Quantum Information']"
4921,1811.03479,Conrad Watt,"Conrad Watt, Petar Maksimovi\'c, Neelakantan R. Krishnaswami, Philippa
  Gardner",A Program Logic for First-Order Encapsulated WebAssembly,"50 pages, 17 figures",,10.4230/LIPIcs.ECOOP.2019.9,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce Wasm Logic, a sound program logic for first-order, encapsulated
WebAssembly. We design a novel assertion syntax, tailored to WebAssembly's
stack-based semantics and the strong guarantees given by WebAssembly's type
system, and show how to adapt the standard separation logic triple and proof
rules in a principled way to capture WebAssembly's uncommon structured control
flow. Using Wasm Logic, we specify and verify a simple WebAssembly B-tree
library, giving abstract specifications independent of the underlying
implementation. We mechanise Wasm Logic and its soundness proof in full in
Isabelle/HOL. As part of the soundness proof, we formalise and fully mechanise
a novel, big-step semantics of WebAssembly, which we prove equivalent, up to
transitive closure, to the original WebAssembly small-step semantics. Wasm
Logic is the first program logic for WebAssembly, and represents a first step
towards the creation of static analysis tools for WebAssembly.
","[{'version': 'v1', 'created': 'Thu, 8 Nov 2018 15:04:20 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Jun 2019 05:53:29 GMT'}, {'version': 'v3', 'created': 'Sat, 13 Jul 2019 20:54:07 GMT'}]",2020-05-22,"[['Watt', 'Conrad', ''], ['Maksimović', 'Petar', ''], ['Krishnaswami', 'Neelakantan R.', ''], ['Gardner', 'Philippa', '']]","['WebAssembly', 'program logic', 'separation logic', 'soundness', 'mechanisation']"
4922,1812.04717,Francesco Fraternali,"Francesco Fraternali, Bharathan Balaji, Yuvraj Agarwal, Luca Benini,
  Rajesh Gupta",Pible: Battery-Free Mote for Perpetual Indoor BLE Applications,"4 pages, 4 figures, BuildSys '18: Conference on Systems for Built
  Environments, November 7--8, 2018, Shenzen, China",,10.1145/3276774.3276785,,cs.NI cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smart building applications require a large-scale deployment of sensors
distributed across the environment. Recent innovations in smart environments
are driven by wireless networked sensors as they are easy to deploy. However,
replacing these batteries at scale is a non-trivial, labor-intensive task.
Energy harvesting has emerged as a potential solution to avoid battery
replacement but requires compromises such as application specific design,
simplified communication protocol or reduced quality of service. We explore the
design space of battery-free sensor nodes using commercial off the shelf
components, and present Pible: a Perpetual Indoor BLE sensor node that
leverages ambient light and can support numerous smart building applications.
We analyze node-lifetime, quality of service and light availability trade-offs
and present a predictive algorithm that adapts to changing lighting conditions
to maximize node lifetime and application quality of service. Using a 20 node,
15-day deployment in a real building under varying lighting conditions, we show
feasible applications that can be implemented using Pible and the boundary
conditions under which they can fail.
","[{'version': 'v1', 'created': 'Tue, 27 Nov 2018 20:56:14 GMT'}]",2018-12-13,"[['Fraternali', 'Francesco', ''], ['Balaji', 'Bharathan', ''], ['Agarwal', 'Yuvraj', ''], ['Benini', 'Luca', ''], ['Gupta', 'Rajesh', '']]","['Battery-Less', 'Wireless Sensor Network', 'Perpetual Operations']"
4923,1410.1155,Amjed Tahir,"Amjed Tahir, Stephen G. MacDonell, Jim Buchan",Understanding Class-level Testability Through Dynamic Analysis,"10 pages, conference paper, 9th International Conference on
  Evaluation of Novel Approaches to Software Engineering (ENASE), 2014",,10.5220/0004883400380047,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is generally acknowledged that software testing is both challenging and
time-consuming. Understanding the factors that may positively or negatively
affect testing effort will point to possibilities for reducing this effort.
Consequently there is a significant body of research that has investigated
relationships between static code properties and testability. The work reported
in this paper complements this body of research by providing an empirical
evaluation of the degree of association between runtime properties and
class-level testability in object-oriented (OO) systems. The motivation for the
use of dynamic code properties comes from the success of such metrics in
providing a more complete insight into the multiple dimensions of software
quality. In particular, we investigate the potential relationships between the
runtime characteristics of production code, represented by Dynamic Coupling and
Key Classes, and internal class-level testability. Testability of a class is
considered here at the level of unit tests and two different measures are used
to characterise those unit tests. The selected measures relate to test scope
and structure: one is intended to measure the unit test size, represented by
test lines of code, and the other is designed to reflect the intended design,
represented by the number of test cases. In this research we found that Dynamic
Coupling and Key Classes have significant correlations with class-level
testability measures. We therefore suggest that these properties could be used
as indicators of class-level testability. These results enhance our current
knowledge and should help researchers in the area to build on previous results
regarding factors believed to be related to testability and testing. Our
results should also benefit practitioners in future class testability planning
and maintenance activities.
","[{'version': 'v1', 'created': 'Sun, 5 Oct 2014 13:04:32 GMT'}]",2014-10-07,"[['Tahir', 'Amjed', ''], ['MacDonell', 'Stephen G.', ''], ['Buchan', 'Jim', '']]","['Software Testability', 'Dynamic Metrics', 'Dynamic Analysis', 'Unit Testing', 'Software Understanding']"
4924,1607.04180,Cyrus Omar,"Cyrus Omar, Ian Voysey, Michael Hilton, Jonathan Aldrich, Matthew A.
  Hammer",Hazelnut: A Bidirectionally Typed Structure Editor Calculus,,"Proceedings of the 44th ACM SIGPLAN Symposium on Principles of
  Programming Languages (POPL 2017)",10.1145/3093333.3009900,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Structure editors allow programmers to edit the tree structure of a program
directly. This can have cognitive benefits, particularly for novice and
end-user programmers. It also simplifies matters for tool designers, because
they do not need to contend with malformed program text. This paper defines
Hazelnut, a structure editor based on a small bidirectionally typed lambda
calculus extended with holes and a cursor. Hazelnut goes one step beyond
syntactic well-formedness: its edit actions operate over statically meaningful
incomplete terms. Naively, this would force the programmer to construct terms
in a rigid ""outside-in"" manner. To avoid this problem, the action semantics
automatically places terms assigned a type that is inconsistent with the
expected type inside a hole. This safely defers the type consistency check
until the term inside the hole is finished. Hazelnut is a foundational
type-theoretic account of typed structure editing, rather than an end-user tool
itself. To that end, we describe how Hazelnut's rich metatheory, which we have
mechanized in Agda, guides the definition of an extension to the calculus. We
also discuss various plausible evaluation strategies for terms with holes, and
in so doing reveal connections with gradual typing and contextual modal type
theory, the Curry-Howard interpretation of contextual modal logic. Finally, we
discuss how Hazelnut's semantics lends itself to implementation as a functional
reactive program. Our reference implementation is written using js_of_ocaml.
","[{'version': 'v1', 'created': 'Thu, 14 Jul 2016 16:07:29 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Aug 2016 09:39:21 GMT'}, {'version': 'v3', 'created': 'Thu, 13 Oct 2016 12:00:55 GMT'}, {'version': 'v4', 'created': 'Wed, 7 Dec 2016 20:45:12 GMT'}, {'version': 'v5', 'created': 'Mon, 4 Feb 2019 02:12:51 GMT'}]",2019-02-05,"[['Omar', 'Cyrus', ''], ['Voysey', 'Ian', ''], ['Hilton', 'Michael', ''], ['Aldrich', 'Jonathan', ''], ['Hammer', 'Matthew A.', '']]","['structure editors', 'bidirectional type systems', 'gradual typing', 'mechanized metatheory']"
4925,1901.09451,Maria De-Arteaga,"Maria De-Arteaga, Alexey Romanov, Hanna Wallach, Jennifer Chayes,
  Christian Borgs, Alexandra Chouldechova, Sahin Geyik, Krishnaram Kenthapadi,
  Adam Tauman Kalai","Bias in Bios: A Case Study of Semantic Representation Bias in a
  High-Stakes Setting","Accepted at ACM Conference on Fairness, Accountability, and
  Transparency (ACM FAT*), 2019",,10.1145/3287560.3287572,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a large-scale study of gender bias in occupation classification, a
task where the use of machine learning may lead to negative outcomes on
peoples' lives. We analyze the potential allocation harms that can result from
semantic representation bias. To do so, we study the impact on occupation
classification of including explicit gender indicators---such as first names
and pronouns---in different semantic representations of online biographies.
Additionally, we quantify the bias that remains when these indicators are
""scrubbed,"" and describe proxy behavior that occurs in the absence of explicit
gender indicators. As we demonstrate, differences in true positive rates
between genders are correlated with existing gender imbalances in occupations,
which may compound these imbalances.
","[{'version': 'v1', 'created': 'Sun, 27 Jan 2019 22:36:16 GMT'}]",2019-01-29,"[['De-Arteaga', 'Maria', ''], ['Romanov', 'Alexey', ''], ['Wallach', 'Hanna', ''], ['Chayes', 'Jennifer', ''], ['Borgs', 'Christian', ''], ['Chouldechova', 'Alexandra', ''], ['Geyik', 'Sahin', ''], ['Kenthapadi', 'Krishnaram', ''], ['Kalai', 'Adam Tauman', '']]","['Supervised learning', 'algorithmic fairness', 'gender bias', 'online recruiting', 'automated hiring', 'compounding injustices']"
4926,1807.11798,Tim Alderson,Tim L. Alderson,A note on full weight spectrum codes,,"Trans. Comb. 8 (2019), no. 3, 15-22",10.22108/toc.2019.112621.1584,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A linear $ [n,k]_q $ code $ C $ is said to be a full weight spectrum (FWS)
code if there exist codewords of each nonzero weight less than or equal to $ n
$. In this brief communication we determine necessary and sufficient conditions
for the existence of linear $ [n,k]_q $ full weight spectrum (FWS) codes.
Central to our approach is the geometric view of linear codes, whereby columns
of a generator matrix correspond to points in $ PG(k-1,q) $.
","[{'version': 'v1', 'created': 'Tue, 31 Jul 2018 13:05:20 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Aug 2018 18:01:52 GMT'}, {'version': 'v3', 'created': 'Thu, 8 Nov 2018 19:17:44 GMT'}, {'version': 'v4', 'created': 'Wed, 3 Apr 2019 16:12:24 GMT'}]",2022-07-18,"[['Alderson', 'Tim L.', '']]","['weight spectrum', 'linear code', 'Hamming weight', 'FWS', 'MWS']"
4927,2102.03272,Jinseok Kim,"Jinseok Kim, Jinmo Kim, and Jason Owen-Smith","Generating automatically labeled data for author name disambiguation: An
  iterative clustering method",25 pages,"Scientometrics, 118(1), 253-280 (2019)",10.1007/s11192-018-2968-3,,cs.DL cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  To train algorithms for supervised author name disambiguation, many studies
have relied on hand-labeled truth data that are very laborious to generate.
This paper shows that labeled training data can be automatically generated
using information features such as email address, coauthor names, and cited
references that are available from publication records. For this purpose,
high-precision rules for matching name instances on each feature are decided
using an external-authority database. Then, selected name instances in target
ambiguous data go through the process of pairwise matching based on the rules.
Next, they are merged into clusters by a generic entity resolution algorithm.
The clustering procedure is repeated over other features until further merging
is impossible. Tested on 26,566 instances out of the population of 228K author
name instances, this iterative clustering produced accurately labeled data with
pairwise F1 = 0.99. The labeled data represented the population data in terms
of name ethnicity and co-disambiguating name group size distributions. In
addition, trained on the labeled data, machine learning algorithms
disambiguated 24K names in test data with performance of pairwise F1 = 0.90 ~
0.92. Several challenges are discussed for applying this method to resolving
author name ambiguity in large-scale scholarly data.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2021 16:24:25 GMT'}]",2021-02-08,"[['Kim', 'Jinseok', ''], ['Kim', 'Jinmo', ''], ['Owen-Smith', 'Jason', '']]","['author name disambiguation', 'entity resolution', 'labeled data', 'gold standard', 'supervised machine learning']"
4928,cs/0207095,Wim H. Hesselink,Wim H. Hesselink,Eternity variables to prove simulation of specifications,"28 pages, to appear in ACM-TOCL",ACM Trans. on Computational Logic 6 (2005) 175-201.,,,cs.DC cs.LO,,"  Simulations of specifications are introduced as a unification and
generalization of refinement mappings, history variables, forward simulations,
prophecy variables, and backward simulations. A specification implements
another specification if and only if there is a simulation from the first one
to the second one that satisfies a certain condition. By adding stutterings,
the formalism allows that the concrete behaviours take more (or possibly less)
steps than the abstract ones.
  Eternity variables are introduced as a more powerful alternative for prophecy
variables and backward simulations. This formalism is semantically complete:
every simulation that preserves quiescence is a composition of a forward
simulation, an extension with eternity variables, and a refinement mapping.
This result does not need finite invisible nondeterminism and machine closure
as in the Abadi-Lamport Theorem. Internal continuity is weakened to
preservation of quiescence.
","[{'version': 'v1', 'created': 'Mon, 29 Jul 2002 09:12:22 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Aug 2002 07:46:41 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Aug 2003 12:27:13 GMT'}, {'version': 'v4', 'created': 'Wed, 27 Aug 2003 17:17:22 GMT'}]",2007-05-23,"[['Hesselink', 'Wim H.', '']]","['Implementations', 'simulations', 'history variables', 'prophecy variables', 'preservation of quiescence', 'refinement mapping', 'verification', 'invariants']"
4929,1812.04413,Piotr Witkowski,"Bartosz Bednarczyk, Emanuel Kiero\'nski, Piotr Witkowski",Completing the Picture: Complexity of Graded Modal Logics with Converse,"This is an extended version of our JELIA 2019 paper, under
  consideration in Theory and Practice of Logic Programming (TPLP)",,10.1017/S1471068421000065,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A complete classification of the complexity of the local and global
satisfiability problems for graded modal language over traditional classes of
frames have already been established. By ""traditional"" classes of frames, we
mean those characterized by any positive combination of reflexivity, seriality,
symmetry, transitivity, and the Euclidean property. In this paper, we fill the
gaps remaining in an analogous classification of the graded modal language with
graded converse modalities. In particular, we show its NExpTime-completeness
over the class of Euclidean frames, demonstrating this way that over this class
the considered language is harder than the language without graded modalities
or without converse modalities. We also consider its variation disallowing
graded converse modalities, but still admitting basic converse modalities. Our
most important result for this variation is confirming an earlier conjecture
that it is decidable over transitive frames. This contrasts with the
undecidability of the language with graded converse modalities.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2018 14:09:35 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Dec 2019 20:26:06 GMT'}, {'version': 'v3', 'created': 'Sun, 20 Sep 2020 10:06:39 GMT'}, {'version': 'v4', 'created': 'Sun, 15 Nov 2020 12:11:00 GMT'}, {'version': 'v5', 'created': 'Thu, 4 Mar 2021 11:55:02 GMT'}]",2021-07-01,"[['Bednarczyk', 'Bartosz', ''], ['Kieroński', 'Emanuel', ''], ['Witkowski', 'Piotr', '']]","['modal logic', 'complexity', 'graded modalities', 'satisfiability']"
4930,1506.03556,EPTCS,"Eike M\""ohlmann (Carl von Ossietzky University of Oldenburg), Oliver
  Theel (Carl von Ossietzky University of Oldenburg)","Breaking Dense Structures: Proving Stability of Densely Structured
  Hybrid Systems","In Proceedings ESSS 2015, arXiv:1506.03250","EPTCS 184, 2015, pp. 49-63",10.4204/EPTCS.184.4,,cs.SE cs.LO cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Abstraction and refinement is widely used in software development. Such
techniques are valuable since they allow to handle even more complex systems.
One key point is the ability to decompose a large system into subsystems,
analyze those subsystems and deduce properties of the larger system. As
cyber-physical systems tend to become more and more complex, such techniques
become more appealing.
  In 2009, Oehlerking and Theel presented a (de-)composition technique for
hybrid systems. This technique is graph-based and constructs a Lyapunov
function for hybrid systems having a complex discrete state space. The
technique consists of (1) decomposing the underlying graph of the hybrid system
into subgraphs, (2) computing multiple local Lyapunov functions for the
subgraphs, and finally (3) composing the local Lyapunov functions into a
piecewise Lyapunov function. A Lyapunov function can serve multiple purposes,
e.g., it certifies stability or termination of a system or allows to construct
invariant sets, which in turn may be used to certify safety and security.
  In this paper, we propose an improvement to the decomposing technique, which
relaxes the graph structure before applying the decomposition technique. Our
relaxation significantly reduces the connectivity of the graph by exploiting
super-dense switching. The relaxation makes the decomposition technique more
efficient on one hand and on the other allows to decompose a wider range of
graph structures.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2015 06:11:10 GMT'}]",2015-06-12,"[['Möhlmann', 'Eike', '', 'Carl von Ossietzky University of Oldenburg'], ['Theel', 'Oliver', '', 'Carl von Ossietzky University of Oldenburg']]","['Hybrid Systems', 'Automatic Verification', 'Stability', 'Lyapunov Theory', 'Graphs', 'Relaxation']"
4931,1405.6661,Divyajyothi M G Ms,"Divyajyothi M G, Rachappa and D H Rao","A scenario based approach for dealing with challenges in a pervasive
  computing environment","8 pages, IJCSA, Vol 4, No.2,April 2014",,10.5121/ijcsa.2014.4204,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the surge in modern research focus towards Pervasive Computing, lot of
techniques and challenges needs to be addressed so as to effectively create
smart spaces and achieve miniaturization. In the process of scaling down to
compact devices, the real things to ponder upon are the Information Retrieval
challenges. In this work, we discuss the aspects of multimedia which makes
information access challenging. An Example Pattern Recognition scenario is
presented and the mathematical techniques that can be used to model uncertainty
are also presented for developing a system that can sense, compute and
communicate in a way that can make human life easy with smart objects assisting
from around his surroundings.
","[{'version': 'v1', 'created': 'Thu, 8 May 2014 07:16:46 GMT'}]",2014-05-27,"[['G', 'Divyajyothi M', ''], ['Rachappa', '', ''], ['Rao', 'D H', '']]","['Pervasive computing', 'Multimedia retrieval', 'Modelling uncertainty', 'Fuzzy theory']"
4932,1802.10079,George Leu,George Leu and Jiangjun Tang and Hussein Abbass,"On the role of working memory in trading-off skills and situation
  awareness in Sudoku",,"Lecture Notes in Computer Science, vol 8836, Springer, 2014",10.1007/978-3-319-12643-2_69,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Working memory accounts for the ability of humans to perform cognitive
processing, by handling both the representation of information (the mental
picture forming the situation awareness) and the space required for processing
these information (skill processing). The more complex the skills are, the more
processing space they require, the less space becomes available for storage of
information. This interplay between situation awareness and skills is critical
in many applications. Theoretically, it is less understood in cognition and
neuroscience. In the meantime, and practically, it is vital when analysing the
mental processes involved in safety-critical domains.
  In this paper, we use the Sudoku game as a vehicle to study this trade-off.
This game combines two features that are present during a user interaction with
a software in many safety critical domains: scanning for information and
processing of information. We use a society of agents for investigating how
this trade-off influences player's proficiency.
","[{'version': 'v1', 'created': 'Tue, 27 Feb 2018 00:16:45 GMT'}]",2018-03-01,"[['Leu', 'George', ''], ['Tang', 'Jiangjun', ''], ['Abbass', 'Hussein', '']]","['cognitive challenge', 'scanning skills', 'working memory']"
4933,1911.10173,Konrad Kulakowski,"Jiri Mazurek, Konrad Ku{\l}akowski",Satisfaction of the Condition of Order Preservation: A Simulation Study,"15 pages, 14 figures",,10.37190/ord200205,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We examine satisfaction of the condition of order preservation (COP) with
respect to different levels of inconsistency for randomly generated
multiplicative pairwise comparison matrices (MPCMs) of the order n =
{3,4,...,9}, where a priority vector is derived both by the eigenvalue method
(EV) and the geometric mean (GM) method. Our results suggest the GM method and
the EV method preserve the COP condition almost identically, both for the less
inconsistent matrices (with Saaty's consistency index CI <0.10), and the more
inconsistent matrices (with CI >= 0.10). Further, we find that the frequency of
the COP violations grows (almost linearly) with increasing inconsistency of
MPCMs measured by Koczkodaj's inconsistency index and Saaty's consistency index
respectively, and we provide graphs to illustrate these relationships for MPCMs
of the order n ={4, 7, 9}.
","[{'version': 'v1', 'created': 'Fri, 22 Nov 2019 18:14:06 GMT'}]",2021-12-21,"[['Mazurek', 'Jiri', ''], ['Kułakowski', 'Konrad', '']]","['pairwise comparisons', 'eigenvalue method', 'geometric meanmethod', 'condition of order preservation', 'numerical simulation']"
4934,1901.09658,Wen Jiang,Tao Wen and Wen Jiang,"Identifying influential nodes based on fuzzy local dimension in complex
  networks","38 pages, 6 figures",,10.1016/j.chaos.2019.01.011,,cs.SI nlin.CD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  How to identify influential nodes in complex networks is an important aspect
in the study of complex network. In this paper, a novel fuzzy local dimension
(FLD) is proposed to rank the influential nodes in complex networks, where a
node with high fuzzy local dimension has high influential ability. This
proposed method focuses on the influence of the distance from the center node
on the local dimension of center node by fuzzy set, resulting in a change in
influential ability. In order to show this proposed method's effectiveness and
accuracy, four real-world networks are applied in this paper. Meanwhile,
Susceptible-Infected (SI) is used to simulate the spreading process by FLD and
other centrality measures, and Kendall's tau coefficient is used to describe
the correlation between the influential nodes obtained by centrality and the
results measured by SI model. Observing from the ranking lists and simulated
results, this method is effective and accurate to rank the influential nodes.
","[{'version': 'v1', 'created': 'Fri, 21 Dec 2018 05:06:04 GMT'}]",2019-02-20,"[['Wen', 'Tao', ''], ['Jiang', 'Wen', '']]","['Complex networks', 'Influential nodes', 'Local dimension', 'Fuzzy']"
4935,1310.5999,Nidhal El-Abbadi,"Nidhal Khdhair El Abbadi, Enas Hamood Al Saadi","Improvement of Automatic Hemorrhages Detection Methods Using Shapes
  Recognition","6-pages,3 figures","Journal of Computer Science 9 (9): 1205-1210, 2013",10.3844/jcssp.2013.1205.1210,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Diabetic Retinopathy is a medical condition where the retina is damaged
because fluid leaks from blood vessels into the retina. The presence of
hemorrhages in the retina is the earliest symptom of diabetic retinopathy. The
number and shape of hemorrhages is used to indicate the severity of the
disease. Early automated hemorrhage detection can help reduce the incidence of
blindness. This paper introduced new method depending on the hemorrhage shape
to detect the dot hemorrhage (DH), its number, and size at early stage, this
can be achieved by reducing the retinal image details. Detection and recognize
the DH by following three sequential steps, removing the fovea, removing the
vasculature and recognize DH by determining the circularity for all the objects
in the image, finally determine the shape factor which is related to DH
recognition, this stage strengthens the recognition process. The proposed
method recognizes and separates all the DH.
","[{'version': 'v1', 'created': 'Tue, 22 Oct 2013 17:58:52 GMT'}]",2013-10-23,"[['Abbadi', 'Nidhal Khdhair El', ''], ['Saadi', 'Enas Hamood Al', '']]","['dot hemorrhage', 'diabetic', 'retina', 'image processing', 'vasculature']"
4936,2105.04971,Mikhail Fain,"Mikhail Fain, Niall Twomey and Danushka Bollegala","Backretrieval: An Image-Pivoted Evaluation Metric for Cross-Lingual Text
  Representations Without Parallel Corpora",SIGIR 2021,,10.1145/3404835.3463027,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cross-lingual text representations have gained popularity lately and act as
the backbone of many tasks such as unsupervised machine translation and
cross-lingual information retrieval, to name a few. However, evaluation of such
representations is difficult in the domains beyond standard benchmarks due to
the necessity of obtaining domain-specific parallel language data across
different pairs of languages. In this paper, we propose an automatic metric for
evaluating the quality of cross-lingual textual representations using images as
a proxy in a paired image-text evaluation dataset. Experimentally,
Backretrieval is shown to highly correlate with ground truth metrics on
annotated datasets, and our analysis shows statistically significant
improvements over baselines. Our experiments conclude with a case study on a
recipe dataset without parallel cross-lingual data. We illustrate how to judge
cross-lingual embedding quality with Backretrieval, and validate the outcome
with a small human study.
","[{'version': 'v1', 'created': 'Tue, 11 May 2021 12:14:24 GMT'}]",2021-05-12,"[['Fain', 'Mikhail', ''], ['Twomey', 'Niall', ''], ['Bollegala', 'Danushka', '']]","['evaluation', 'cross-lingual document representation', 'retrieval']"
4937,1509.03604,Kathryn Huff,"Kathryn D. Huff, Matthew J. Gidden, Robert W. Carlsen, Robert R.
  Flanagan, Meghan B. McGarry, Arrielle C. Opotowsky, Erich A. Schneider,
  Anthony M. Scopatz, Paul P.H. Wilson","Fundamental concepts in the Cyclus nuclear fuel cycle simulation
  framework",,"Advances in Engineering Software, Volume 94, April 2016, Pages
  46-59",10.1016/j.advengsoft.2016.01.014,,cs.SE cs.CE cs.MA cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As nuclear power expands, technical, economic, political, and environmental
analyses of nuclear fuel cycles by simulators increase in importance. To date,
however, current tools are often fleet-based rather than discrete and
restrictively licensed rather than open source. Each of these choices presents
a challenge to modeling fidelity, generality, efficiency, robustness, and
scientific transparency. The Cyclus nuclear fuel cycle simulator framework and
its modeling ecosystem incorporate modern insights from simulation science and
software architecture to solve these problems so that challenges in nuclear
fuel cycle analysis can be better addressed. A summary of the Cyclus fuel cycle
simulator framework and its modeling ecosystem are presented. Additionally, the
implementation of each is discussed in the context of motivating challenges in
nuclear fuel cycle simulation. Finally, the current capabilities of Cyclus are
demonstrated for both open and closed fuel cycles.
","[{'version': 'v1', 'created': 'Fri, 11 Sep 2015 18:39:59 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Mar 2016 16:05:10 GMT'}]",2016-03-14,"[['Huff', 'Kathryn D.', ''], ['Gidden', 'Matthew J.', ''], ['Carlsen', 'Robert W.', ''], ['Flanagan', 'Robert R.', ''], ['McGarry', 'Meghan B.', ''], ['Opotowsky', 'Arrielle C.', ''], ['Schneider', 'Erich A.', ''], ['Scopatz', 'Anthony M.', ''], ['Wilson', 'Paul P. H.', '']]","['nuclear fuel cycle', 'simulation', 'agent based modeling', 'nuclear engineering', 'object orientation', 'systems analysis']"
4938,1306.2502,Sukhpal  Singh,"Sukhpal Singh, Harinder Singh",Case Study Based Software Engineering Project Development: State of Art,"15 Pages including 17 figures, 12 tables, Published by IJSRCSAMS","International Journal of Scientific Research in Computer Science
  Applications and Management Studies, Volume 2, Issue 3, May 2013",10.5120/7834-1132,ijsrcsamsv2i3p31,cs.SE,http://creativecommons.org/licenses/publicdomain/,"  This research paper designates the importance and usage of the case study
approach effectively to educating and training software designers and software
engineers both in academic and industry. Subsequently an account of the use of
case studies based on software engineering in the education of professionals,
there is a conversation of issues in training software designers and how a case
teaching method can be used to state these issues. The paper describes a
software project titled Online Tower Plotting System (OTPS) to develop a
complete and comprehensive case study, along with supporting educational
material. The case study is aimed to demonstrate a variety of software areas,
modules and courses: from bachelor through masters, doctorates and even for
ongoing professional development.
","[{'version': 'v1', 'created': 'Tue, 11 Jun 2013 12:28:33 GMT'}]",2013-06-12,"[['Singh', 'Sukhpal', ''], ['Singh', 'Harinder', '']]","['Software Engineering', 'Case Study', 'Software Project Management', 'Software Designer', 'Software Engineer']"
4939,1806.00699,Andres Karjus,"Andres Karjus, Richard A. Blythe, Simon Kirby, Kenny Smith",Quantifying the dynamics of topical fluctuations in language,"Code to run the analyses described in this paper is now available at
  https://github.com/andreskarjus/topical_cultural_advection_model . A previous
  shorter version of this paper outlining the basic model appeared as an
  extended abstract in the proceedings of the Society for Computation in
  Linguistics (Karjus et al. 2018, Topical advection as a baseline model for
  corpus-based lexical dynamics)","Language Dynamics and Change, 10(1) 2020, 86-125",10.1163/22105832-01001200,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The availability of large diachronic corpora has provided the impetus for a
growing body of quantitative research on language evolution and meaning change.
The central quantities in this research are token frequencies of linguistic
elements in texts, with changes in frequency taken to reflect the popularity or
selective fitness of an element. However, corpus frequencies may change for a
wide variety of reasons, including purely random sampling effects, or because
corpora are composed of contemporary media and fiction texts within which the
underlying topics ebb and flow with cultural and socio-political trends. In
this work, we introduce a simple model for controlling for topical fluctuations
in corpora - the topical-cultural advection model - and demonstrate how it
provides a robust baseline of variability in word frequency changes over time.
We validate the model on a diachronic corpus spanning two centuries, and a
carefully-controlled artificial language change scenario, and then use it to
correct for topical fluctuations in historical time series. Finally, we use the
model to show that the emergence of new words typically corresponds with the
rise of a trending topic. This suggests that some lexical innovations occur due
to growing communicative need in a subspace of the lexicon, and that the
topical-cultural advection model can be used to quantify this.
","[{'version': 'v1', 'created': 'Sat, 2 Jun 2018 20:14:17 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Jun 2018 16:26:54 GMT'}, {'version': 'v3', 'created': 'Fri, 21 Jun 2019 17:18:57 GMT'}]",2020-06-17,"[['Karjus', 'Andres', ''], ['Blythe', 'Richard A.', ''], ['Kirby', 'Simon', ''], ['Smith', 'Kenny', '']]","['advection', 'lexical dynamics', 'language change', 'language evolution', 'frequency', 'topic modeling', 'corpus-based']"
4940,1409.0129,Philippe Mongeon,"Philippe Mongeon, Vincent Lariviere","Costly Collaborations: The Impact of Scientific Fraud on Co-authors'
  Careers","Accepted for publication in the Journal of the Association for
  Information Science and Technology","Journal of the Association for Information Science and Technology,
  67: 535-542 (2016)",10.1002/asi.23421,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the last few years, several major scientific fraud cases have shocked
the scientific community. The number of retractions each year has also
increased tremendously, especially in the biomedical field, and scientific
misconduct accounts for approximately more than half of those retractions. It
is assumed that co-authors of retracted papers are affected by their
colleagues' misconduct, and the aim of this study is to provide empirical
evidence of the effect of retractions in biomedical research on co-authors'
research careers. Using data from the Web of Science (WOS), we measured the
productivity, impact and collaboration of 1,123 co-authors of 293 retracted
articles for a period of five years before and after the retraction. We found
clear evidence that collaborators do suffer consequences of their colleagues'
misconduct, and that a retraction for fraud has higher consequences than a
retraction for error. Our results also suggest that the extent of these
consequences is closely linked with the ranking of co-authors on the retracted
paper, being felt most strongly by first authors, followed by the last authors,
while the impact is less important for middle authors.
","[{'version': 'v1', 'created': 'Sat, 30 Aug 2014 16:23:07 GMT'}]",2016-02-25,"[['Mongeon', 'Philippe', ''], ['Lariviere', 'Vincent', '']]","['Scientific misconduct', 'retractions', 'collaboration', 'bibliometrics']"
4941,1112.1615,Boubkeur Boudaoud,"Dominique Barth, Boubkeur Boudaoud and Thierry Mautor","SLA Establishment with Guaranteed QoS in the Interdomain Network: A
  Stock Model","19 pages, 19 figures, IJCNC,
  http://airccse.org/journal/cnc/0711cnc13.pdf","International Journal of Computer Networks & Communications 3.4
  (July 2011) 188-206",10.5121/ijcnc.2011.3413,,cs.NI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The new model that we present in this paper is introduced in the context of
guaranteed QoS and resources management in the inter-domain routing framework.
This model, called the stock model, is based on a reverse cascade approach and
is applied in a distributed context. So transit providers have to learn the
right capacities to buy and to stock and, therefore learning theory is applied
through an iterative process. We show that transit providers manage to learn
how to strategically choose their capacities on each route in order to maximize
their benefits, despite the very incomplete information. Finally, we provide
and analyse some simulation results given by the application of the model in a
simple case where the model quickly converges to a stable state.
","[{'version': 'v1', 'created': 'Wed, 7 Dec 2011 16:34:20 GMT'}]",2011-12-08,"[['Barth', 'Dominique', ''], ['Boudaoud', 'Boubkeur', ''], ['Mautor', 'Thierry', '']]","['Learning theory', 'distributed algorithmic', 'QoS and Resource Management', 'inter-domain routing']"
4942,1804.07088,George Baryannis,"George Baryannis, Ilias Tachmazidis, Sotiris Batsakis, Grigoris
  Antoniou, Mario Alviano, Timos Sellis, Pei-Wei Tsai","A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set
  Programming","Paper presented at the 34th International Conference on Logic
  Programming (ICLP 2018), Oxford, UK, July 14 to July 17, 2018, 20 pages,
  LaTeX, 16 figures",Theory and Practice of Logic Programming 18 (2018) 355-371,10.1017/S147106841800011X,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spatial information is often expressed using qualitative terms such as
natural language expressions instead of coordinates; reasoning over such terms
has several practical applications, such as bus routes planning. Representing
and reasoning on trajectories is a specific case of qualitative spatial
reasoning that focuses on moving objects and their paths. In this work, we
propose two versions of a trajectory calculus based on the allowed properties
over trajectories, where trajectories are defined as a sequence of
non-overlapping regions of a partitioned map. More specifically, if a given
trajectory is allowed to start and finish at the same region, 6 base relations
are defined (TC-6). If a given trajectory should have different start and
finish regions but cycles are allowed within, 10 base relations are defined
(TC-10). Both versions of the calculus are implemented as ASP programs; we
propose several different encodings, including a generalised program capable of
encoding any qualitative calculus in ASP. All proposed encodings are
experimentally evaluated using a real-world dataset. Experiment results show
that the best performing implementation can scale up to an input of 250
trajectories for TC-6 and 150 trajectories for TC-10 for the problem of
discovering a consistent configuration, a significant improvement compared to
previous ASP implementations for similar qualitative spatial and temporal
calculi. This manuscript is under consideration for acceptance in TPLP.
","[{'version': 'v1', 'created': 'Thu, 19 Apr 2018 11:16:22 GMT'}]",2020-08-05,"[['Baryannis', 'George', ''], ['Tachmazidis', 'Ilias', ''], ['Batsakis', 'Sotiris', ''], ['Antoniou', 'Grigoris', ''], ['Alviano', 'Mario', ''], ['Sellis', 'Timos', ''], ['Tsai', 'Pei-Wei', '']]","['Answer Set Programming', 'Spatial Reasoning', 'Qualitative Reasoning', 'Trajectory']"
4943,1702.01163,Helge Holzmann,"Helge Holzmann, Wolfram Sperber, Mila Runnwerth",Archiving Software Surrogates on the Web for Future Reference,"TPDL 2016, Hannover, Germany",,10.1007/978-3-319-43997-6_17,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software has long been established as an essential aspect of the scientific
process in mathematics and other disciplines. However, reliably referencing
software in scientific publications is still challenging for various reasons. A
crucial factor is that software dynamics with temporal versions or states are
difficult to capture over time. We propose to archive and reference surrogates
instead, which can be found on the Web and reflect the actual software to a
remarkable extent. Our study shows that about a half of the webpages of
software are already archived with almost all of them including some kind of
documentation.
","[{'version': 'v1', 'created': 'Fri, 3 Feb 2017 21:17:25 GMT'}]",2017-02-07,"[['Holzmann', 'Helge', ''], ['Sperber', 'Wolfram', ''], ['Runnwerth', 'Mila', '']]","['Scientific Software Management', 'Web Archives', 'Analysis']"
4944,1005.4363,Hicham Baront,"Larbi Kzaz, Hicham Elasri and Abderrahim Sekkaki",A model for semantic integration of business components,,"Academy & Industry Research Collaboration Center (AIRCC) -
  International journal of computer science & information Technology (IJCSIT),
  07-03-2010",10.1016/S0550-3213(01)00405-9,ISSN:0975-3826 (Online); 0975-4660 (Print),cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today, reusable components are available in several repositories. These last
are certainly conceived for the reusing However, this re-use is not immediate;
it requires, in the fact, to pass through some essential conceptual operations,
among them in particular, research, integration, adaptation, and composition.
We are interested in the present work to the problem of semantic integration of
heterogeneous Business Components. This problem is often put in syntactical
terms, while the real stake is of semantic order. Our contribution concerns a
model proposal for Business components integration as well as resolution method
of semantic naming conflicts, met during the integration of Business
Components.
","[{'version': 'v1', 'created': 'Mon, 24 May 2010 15:45:10 GMT'}]",2010-05-25,"[['Kzaz', 'Larbi', ''], ['Elasri', 'Hicham', ''], ['Sekkaki', 'Abderrahim', '']]","['Business Component', 'Semantic Integration', 'Ontology', 'Semantic Web']"
4945,1603.01055,Weinan Zhang,"Weinan Zhang, Yifei Rong, Jun Wang, Tianchi Zhu, Xiaofan Wang",Feedback Control of Real-Time Display Advertising,WSDM 2016,,10.1145/2835776.2835843,,cs.GT cs.SY,http://creativecommons.org/licenses/by/4.0/,"  Real-Time Bidding (RTB) is revolutionising display advertising by
facilitating per-impression auctions to buy ad impressions as they are being
generated. Being able to use impression-level data, such as user cookies,
encourages user behaviour targeting, and hence has significantly improved the
effectiveness of ad campaigns. However, a fundamental drawback of RTB is its
instability because the bid decision is made per impression and there are
enormous fluctuations in campaigns' key performance indicators (KPIs). As such,
advertisers face great difficulty in controlling their campaign performance
against the associated costs. In this paper, we propose a feedback control
mechanism for RTB which helps advertisers dynamically adjust the bids to
effectively control the KPIs, e.g., the auction winning ratio and the effective
cost per click. We further formulate an optimisation framework to show that the
proposed feedback control mechanism also has the ability of optimising campaign
performance. By settling the effective cost per click at an optimal reference
value, the number of campaign's ad clicks can be maximised with the budget
constraint. Our empirical study based on real-world data verifies the
effectiveness and robustness of our RTB control system in various situations.
The proposed feedback control mechanism has also been deployed on a commercial
RTB platform and the online test has shown its success in generating
controllable advertising performance.
","[{'version': 'v1', 'created': 'Thu, 3 Mar 2016 11:06:21 GMT'}]",2016-03-04,"[['Zhang', 'Weinan', ''], ['Rong', 'Yifei', ''], ['Wang', 'Jun', ''], ['Zhu', 'Tianchi', ''], ['Wang', 'Xiaofan', '']]","['Feedback Control', 'Demand-Side Platform', 'Real-Time Bidding', 'Display Advertising']"
4946,1309.3841,Srinjoy Ganguly Mr.,"Arpita Chakraborty, Srinjoy Ganguly, Mrinal Kanti Naskar and Anupam
  Karmakar","A Trust Based Fuzzy Algorithm for Congestion Control in Wireless
  Multimedia Sensor Networks (TFCC)","6 pages, 5 figures, conference paper","Procs. of the IEEE 2013 International Conference on Informatics,
  Electronics and Vision (ICIEV 2013), pp.XX-XX, Dhaka, Bangladesh, May 17-18,
  (2013)",10.1109/ICIEV.2013.6572553,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network congestion has become a critical issue for resource constrained
Wireless Sensor Networks (WSNs), especially for Wireless Multimedia Sensor
Networks (WMSNs)where large volume of multimedia data is transmitted through
the network. If the traffic load is greater than the available capacity of the
sensor network, congestion occurs and it causes buffer overflow, packet drop,
deterioration of network throughput and quality of service (QoS). Again, the
faulty nodes of the network also aggravate congestion by diffusing useless
packets or retransmitting the same packet several times. This results in the
wastage of energy and decrease in network lifetime. To address this challenge,
a new congestion control algorithm is proposed in which the faulty nodes are
identified and blocked from data communication by using the concept of trust.
The trust metric of all the nodes in the WMSN is derived by using a two-stage
Fuzzy inferencing scheme. The traffic flow from source to sink is optimized by
implementing the Link State Routing Protocol. The congestion of the sensor
nodes is controlled by regulating the rate of traffic flow on the basis of the
priority of the traffic. Finally we compare our protocol with other existing
congestion control protocols to show the merit of the work.
","[{'version': 'v1', 'created': 'Mon, 16 Sep 2013 07:42:02 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Nov 2013 23:12:25 GMT'}]",2016-11-18,"[['Chakraborty', 'Arpita', ''], ['Ganguly', 'Srinjoy', ''], ['Naskar', 'Mrinal Kanti', ''], ['Karmakar', 'Anupam', '']]","['Multimedia Data', 'Congestion', 'Malicious Nodes', 'Trust', 'Fuzzy Logic Controller', 'Link State Routing Protocol']"
4947,1006.3366,Secretary Aircc Journal,"Busola S. Olagbegi and Natarajan Meghanathan (Jackson State
  University, USA)","A Review of the Energy Efficient and Secure Multicast Routing Protocols
  for Mobile Ad hoc Networks",15 pages,"International journal on applications of graph theory in wireless
  ad hoc networks and sensor networks 2.2 (2010) 1-15",10.5121/jgraphoc.2010.2201,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper presents a thorough survey of recent work addressing energy
efficient multicast routing protocols and secure multicast routing protocols in
Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which
witness the need of energy management and security in ad hoc wireless networks.
The objective of a multicast routing protocol for MANETs is to support the
propagation of data from a sender to all the receivers of a multicast group
while trying to use the available bandwidth efficiently in the presence of
frequent topology changes. Multicasting can improve the efficiency of the
wireless link when sending multiple copies of messages by exploiting the
inherent broadcast property of wireless transmission. Secure multicast routing
plays a significant role in MANETs. However, offering energy efficient and
secure multicast routing is a difficult and challenging task. In recent years,
various multicast routing protocols have been proposed for MANETs. These
protocols have distinguishing features and use different mechanisms
","[{'version': 'v1', 'created': 'Thu, 17 Jun 2010 04:31:38 GMT'}]",2010-07-15,"[['Olagbegi', 'Busola S.', '', 'Jackson State\n  University, USA'], ['Meghanathan', 'Natarajan', '', 'Jackson State\n  University, USA']]","['Mobile Ad hoc Networks', 'Multicast Routing Protocols', 'Energy Efficiency', 'Security', 'Review Survey']"
4948,1106.1590,Valmir Barbosa,"Fabio R. J. Vieira, Jos\'e F. de Rezende, Valmir C. Barbosa, Serge
  Fdida","Scheduling links for heavy traffic on interfering routes in wireless
  mesh networks",,"Computer Networks 56 (2012), 1584-1598",10.1016/j.comnet.2012.01.011,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider wireless mesh networks and the problem of scheduling the links of
a given set of routes under the assumption of a heavy-traffic pattern. We
assume some TDMA protocol provides a background of synchronized time slots and
seek to schedule the routes' links to maximize the number of packets that get
delivered to their destinations per time slot. Our approach is to construct an
undirected graph G and to heuristically obtain node multicolorings for G that
can be turned into efficient link schedules. In G each node represents a link
to be scheduled and the edges are set up to represent every possible
interference for any given set of interference assumptions. We present two
multicoloring-based heuristics and study their performance through extensive
simulations. One of the two heuristics is based on relaxing the notion of a
node multicoloring by dynamically exploiting the availability of communication
opportunities that would otherwise be wasted. We have found that, as a
consequence, its performance is significantly superior to the other's.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2011 16:17:14 GMT'}]",2012-03-12,"[['Vieira', 'Fabio R. J.', ''], ['de Rezende', 'José F.', ''], ['Barbosa', 'Valmir C.', ''], ['Fdida', 'Serge', '']]","['Wireless mesh networks', 'Link scheduling', 'Node multicolorings', 'Scheduling by edge reversal']"
4949,1802.05501,Dariusz Dereniowski,Dariusz Dereniowski and Dorota Osula and Pawe{\l} Rz\k{a}\.zewski,Finding small-width connected path decompositions in polynomial time,,Theoretical Computer Science 794: 85-100 (2019),10.1016/j.tcs.2019.03.039,,cs.DS cs.CC cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A connected path decomposition of a simple graph $G$ is a path decomposition
$(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup
X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$
is then the minimum width over all connected path decompositions of $G$. We
prove that for each fixed $k$, the connected pathwidth of any input graph can
be computed in polynomial-time. This answers an open question raised by Fedor
V. Fomin during the GRASTA 2017 workshop, since connected pathwidth is
equivalent to the connected (monotone) node search game.
","[{'version': 'v1', 'created': 'Thu, 15 Feb 2018 12:09:39 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Jul 2018 12:43:54 GMT'}]",2021-01-19,"[['Dereniowski', 'Dariusz', ''], ['Osula', 'Dorota', ''], ['Rzążewski', 'Paweł', '']]","['connected graph searching', 'connected pathwidth', 'graph searching', 'pathwidth']"
4950,0710.4187,Akisato Kimura,"Akisato Kimura, Tomohiko Uyematsu, Shigeaki Kuzuoka",Universal coding for correlated sources with complementary delivery,"18 pages, some of the material in this manuscript has been already
  published in IEICE Transactions on Fundamentals, September 2007. Several
  additional results are also included","IEICE Transactions on Fundamentals, Vol.E90-A, No.9, pp.1840-1847,
  September 2007",10.1093/ietfec/e90-a.9.1840,,cs.IT math.IT,,"  This paper deals with a universal coding problem for a certain kind of
multiterminal source coding system that we call the complementary delivery
coding system. In this system, messages from two correlated sources are jointly
encoded, and each decoder has access to one of the two messages to enable it to
reproduce the other message. Both fixed-to-fixed length and fixed-to-variable
length lossless coding schemes are considered. Explicit constructions of
universal codes and bounds of the error probabilities are clarified via
type-theoretical and graph-theoretical analyses. [[Keywords]] multiterminal
source coding, complementary delivery, universal coding, types of sequences,
bipartite graphs
","[{'version': 'v1', 'created': 'Tue, 23 Oct 2007 04:35:07 GMT'}]",2007-10-24,"[['Kimura', 'Akisato', ''], ['Uyematsu', 'Tomohiko', ''], ['Kuzuoka', 'Shigeaki', '']]","['multiterminal source coding', 'complementary delivery', 'universal coding', 'types of sequences', 'bipartite graphs']"
4951,1408.6746,Slobodan Beliga,"Slobodan Beliga, Sanda Martin\v{c}i\'c-Ip\v{s}i\'c",Non-Standard Words as Features for Text Categorization,"IEEE 37th International Convention on Information and Communication
  Technology, Electronics and Microelectronics (MIPRO 2014), pp. 1415-1419,
  2014","IEEE 37th International Convention on Information and
  Communication Technology, Electronics and Microelectronics (MIPRO 2014), pp.
  1415-1419, 2014",10.1109/MIPRO.2014.6859744,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents categorization of Croatian texts using Non-Standard Words
(NSW) as features. Non-Standard Words are: numbers, dates, acronyms,
abbreviations, currency, etc. NSWs in Croatian language are determined
according to Croatian NSW taxonomy. For the purpose of this research, 390 text
documents were collected and formed the SKIPEZ collection with 6 classes:
official, literary, informative, popular, educational and scientific. Text
categorization experiment was conducted on three different representations of
the SKIPEZ collection: in the first representation, the frequencies of NSWs are
used as features; in the second representation, the statistic measures of NSWs
(variance, coefficient of variation, standard deviation, etc.) are used as
features; while the third representation combines the first two feature sets.
Naive Bayes, CN2, C4.5, kNN, Classification Trees and Random Forest algorithms
were used in text categorization experiments. The best categorization results
are achieved using the first feature set (NSW frequencies) with the
categorization accuracy of 87%. This suggests that the NSWs should be
considered as features in highly inflectional languages, such as Croatian. NSW
based features reduce the dimensionality of the feature space without standard
lemmatization procedures, and therefore the bag-of-NSWs should be considered
for further Croatian texts categorization experiments.
","[{'version': 'v1', 'created': 'Thu, 28 Aug 2014 15:06:50 GMT'}, {'version': 'v2', 'created': 'Sun, 16 Nov 2014 21:33:22 GMT'}]",2014-11-18,"[['Beliga', 'Slobodan', ''], ['Martinčić-Ipšić', 'Sanda', '']]","['text categorization', 'non-standard words', 'collection representation', 'features', 'accuracy']"
4952,1903.01896,Rodrigo Soto Garrido,"Guillermo Fuertes, Manuel Vargas, Miguel Alfaro, Rodrigo Soto-Garrido,
  Jorge Sabattin and Maria Alejandra Peralta","Chaotic Genetic Algorithm and The Effects of Entropy in Performance
  Optimization","8 pages, 4 figures, 31 references. Accepted for publication in Chaos:
  An Interdisciplinary Journal of Nonlinear Science",,10.1063/1.5048299,,cs.NE nlin.CD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work proposes a new edge about the Chaotic Genetic Algorithm (CGA) and
the importance of the entropy in the initial population. Inspired by chaos
theory the CGA uses chaotic maps to modify the stochastic parameters of Genetic
Algorithm (GA). The algorithm modifies the parameters of the initial population
using chaotic series and then analyzes the entropy of such population. This
strategy exhibits the relationship between entropy and performance optimization
in complex search spaces. Our study includes the optimization of nine benchmark
functions using eight different chaotic maps for each of the benchmark
functions. The numerical experiment demonstrates a direct relation between
entropy and performance of the algorithm.
","[{'version': 'v1', 'created': 'Wed, 16 Jan 2019 15:54:22 GMT'}]",2019-03-13,"[['Fuertes', 'Guillermo', ''], ['Vargas', 'Manuel', ''], ['Alfaro', 'Miguel', ''], ['Soto-Garrido', 'Rodrigo', ''], ['Sabattin', 'Jorge', ''], ['Peralta', 'Maria Alejandra', '']]","['chaotic genetic algorithm', 'chaotic map', 'Shannon entropy']"
4953,1403.3610,Naresh Manwani,"Aritra Ghosh, Naresh Manwani and P. S. Sastry",Making Risk Minimization Tolerant to Label Noise,,,10.1016/j.neucom.2014.09.081,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many applications, the training data, from which one needs to learn a
classifier, is corrupted with label noise. Many standard algorithms such as SVM
perform poorly in presence of label noise. In this paper we investigate the
robustness of risk minimization to label noise. We prove a sufficient condition
on a loss function for the risk minimization under that loss to be tolerant to
uniform label noise. We show that the $0-1$ loss, sigmoid loss, ramp loss and
probit loss satisfy this condition though none of the standard convex loss
functions satisfy it. We also prove that, by choosing a sufficiently large
value of a parameter in the loss function, the sigmoid loss, ramp loss and
probit loss can be made tolerant to non-uniform label noise also if we can
assume the classes to be separable under noise-free data distribution. Through
extensive empirical studies, we show that risk minimization under the $0-1$
loss, the sigmoid loss and the ramp loss has much better robustness to label
noise when compared to the SVM algorithm.
","[{'version': 'v1', 'created': 'Fri, 14 Mar 2014 15:30:23 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Sep 2015 06:33:57 GMT'}]",2015-09-11,"[['Ghosh', 'Aritra', ''], ['Manwani', 'Naresh', ''], ['Sastry', 'P. S.', '']]","['Classification', 'Label Noise', 'Loss Function', 'Risk Minimization', 'Noise Tolerance']"
4954,1211.3497,Prabath Abeysiriwardana,"Prabath Chaminda Abeysiriwardana, Saluka R Kodituwakku",Ontology Based Information Extraction for Disease Intelligence,"Disease Intelligence, Disease Ontology, Information Extraction,
  Semantic Web","International Journal of Research in Computer Science, 2 (6): pp.
  7-19, November 2012. doi:10.7815/ijorcs.26.2012.051",10.7815/ijorcs.26.2012.051,,cs.AI cs.DL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Disease Intelligence (DI) is based on the acquisition and aggregation of
fragmented knowledge of diseases at multiple sources all over the world to
provide valuable information to doctors, researchers and information seeking
community. Some diseases have their own characteristics changed rapidly at
different places of the world and are reported on documents as unrelated and
heterogeneous information which may be going unnoticed and may not be quickly
available. This research presents an Ontology based theoretical framework in
the context of medical intelligence and country/region. Ontology is designed
for storing information about rapidly spreading and changing diseases with
incorporating existing disease taxonomies to genetic information of both humans
and infectious organisms. It further maps disease symptoms to diseases and drug
effects to disease symptoms. The machine understandable disease ontology
represented as a website thus allows the drug effects to be evaluated on
disease symptoms and exposes genetic involvements in the human diseases.
Infectious agents which have no known place in an existing classification but
have data on genetics would still be identified as organisms through the
intelligence of this system. It will further facilitate researchers on the
subject to try out different solutions for curing diseases.
","[{'version': 'v1', 'created': 'Thu, 15 Nov 2012 05:33:28 GMT'}]",2012-11-16,"[['Abeysiriwardana', 'Prabath Chaminda', ''], ['Kodituwakku', 'Saluka R', '']]","['Disease Intelligence', 'Disease Ontology', 'Information Extraction', 'Semantic Web']"
4955,1911.10882,Claudia Savina Bianchini,"Claudia S. Bianchini (Poitiers UFR LL), Fabrizio Borgia (UPS), Paolo
  Bottoni, Maria de Marsico",SWift -- A SignWriting improved fast transcriber,,"Proceedings of the International Working Conference on Advanced
  Visual Interfaces, ACM - Association for Computer Machinery, pp.390 - 393,
  2012, ACM AVI2012, 978-1-4503-1287-5",10.1145/2254556.2254631,pubblicazione #008,cs.CL cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present SWift (SignWriting improved fast transcriber), an advanced editor
for computer-aided writing and transcribing using SignWriting (SW). SW is
devised to allow deaf people and linguists alike to exploit an easy-to-grasp
written form of (any) sign language. Similarly, SWift has been developed for
everyone who masters SW, and is not exclusively deaf-oriented. Using SWift, it
is possible to compose and save any sign, using elementary components called
glyphs. A guided procedure facilitates the composition process. SWift is aimed
at helping to break down the ""electronic"" barriers that keep the deaf community
away from Information and Communication Technology (ICT). The editor has been
developed modularly and can be integrated everywhere the use of SW, as an
alternative to written vocal language, may be advisable.
","[{'version': 'v1', 'created': 'Mon, 25 Nov 2019 12:54:58 GMT'}]",2019-12-02,"[['Bianchini', 'Claudia S.', '', 'Poitiers UFR LL'], ['Borgia', 'Fabrizio', '', 'UPS'], ['Bottoni', 'Paolo', ''], ['de Marsico', 'Maria', '']]","['Sign Languages', 'SignWriting', 'Deafness', 'Accessibility   1. INTRODUCTION  Deaf people are 0']"
4956,1512.07493,Hui Li,"Hui Li (INL), S\'ebastien Le Beux (INL), Gabriela Nicolescu, Ian O
  'Connor (INL)","Energy-efficient optical crossbars on chip with multi-layer deposited
  silicon","20th Asia and South Pacific Design Automation Conference (ASP-DAC
  2015), Jan 2015, Chiba/Tokyo, Japan",,10.1109/ASPDAC.2015.7058996,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The many cores design research community have shown high interest in optical
crossbars on chip for more than a decade. Key properties of optical crossbars,
namely a) contention-free data routing b) low-latency communication and c)
potential for high bandwidth through the use of WDM, motivate several
implementations. These implementations demonstrate very different scalability
and power efficiency ability depending on three key design factors: a) the
network topology, b) the considered layout and c) the insertion losses induced
by the fabrication process. The emerging design technique relying on
multi-layer deposited silicon allows reducing optical losses, which may lead to
significant reduction of the power consumption. In this paper, multi-layer
deposited silicon based crossbars are proposed and compared. The results
indicate that the proposed ring-based network exhibits, on average, 22% and
51.4% improvement for worst-case and average losses respectively compared to
the most power-efficient related crossbars.
","[{'version': 'v1', 'created': 'Wed, 23 Dec 2015 14:32:36 GMT'}]",2015-12-24,"[['Li', 'Hui', '', 'INL'], ['Beux', 'Sébastien Le', '', 'INL'], ['Nicolescu', 'Gabriela', '', 'INL'], [""'Connor"", 'Ian O', '', 'INL']]","['Optical Network on Chip', 'crossbar', 'optical loss']"
4957,1803.06320,Florian Bernard,"Florian Bernard, Johan Thunberg, Jorge Goncalves, Christian Theobalt","Synchronisation of Partial Multi-Matchings via Non-negative
  Factorisations",,,10.1016/j.patcog.2019.03.021,,cs.CV math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we study permutation synchronisation for the challenging case of
partial permutations, which plays an important role for the problem of matching
multiple objects (e.g. images or shapes). The term synchronisation refers to
the property that the set of pairwise matchings is cycle-consistent, i.e. in
the full matching case all compositions of pairwise matchings over cycles must
be equal to the identity. Motivated by clustering and matrix factorisation
perspectives of cycle-consistency, we derive an algorithm to tackle the
permutation synchronisation problem based on non-negative factorisations. In
order to deal with the inherent non-convexity of the permutation
synchronisation problem, we use an initialisation procedure based on a novel
rotation scheme applied to the solution of the spectral relaxation. Moreover,
this rotation scheme facilitates a convenient Euclidean projection to obtain a
binary solution after solving our relaxed problem. In contrast to
state-of-the-art methods, our approach is guaranteed to produce
cycle-consistent results. We experimentally demonstrate the efficacy of our
method and show that it achieves better results compared to existing methods.
","[{'version': 'v1', 'created': 'Fri, 16 Mar 2018 17:17:05 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Jul 2018 07:01:49 GMT'}, {'version': 'v3', 'created': 'Mon, 25 Mar 2019 13:33:00 GMT'}]",2019-03-26,"[['Bernard', 'Florian', ''], ['Thunberg', 'Johan', ''], ['Goncalves', 'Jorge', ''], ['Theobalt', 'Christian', '']]","['partial permutation synchronisation', 'multi-matching', 'spectral decomposition', 'non-negative matrixfactorisation']"
4958,1903.03504,Ian McQuillan,"Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar",On counting functions and slenderness of languages,,,10.1016/j.tcs.2018.11.021,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study counting-regular languages -- these are languages $L$ for which
there is a regular language $L'$ such that the number of strings of length $n$
in $L$ and $L'$ are the same for all $n$. We show that the languages accepted
by unambiguous nondeterministic Turing machines with a one-way read-only input
tape and a reversal-bounded worktape are counting-regular. Many one-way
acceptors are a special case of this model, such as reversal-bounded
deterministic pushdown automata, reversal-bounded deterministic queue automata,
and many others, and therefore all languages accepted by these models are
counting-regular. This result is the best possible in the sense that the claim
does not hold for either $2$-ambiguous PDA's, unambiguous PDA's with no
reversal-bound, and other models.
  We also study closure properties of counting-regular languages, and we study
decidability problems in regards to counting-regularity. For example, it is
shown that the counting-regularity of even some restricted subclasses of PDA's
is undecidable. Lastly, $k$-slender languages -- where there are at most $k$
words of any length -- are also studied. Amongst other results, it is shown
that it is decidable whether a language in any semilinear full trio is
$k$-slender.
","[{'version': 'v1', 'created': 'Fri, 8 Mar 2019 15:31:31 GMT'}]",2019-03-11,"[['Ibarra', 'Oscar H.', ''], ['McQuillan', 'Ian', ''], ['Ravikumar', 'Bala', '']]","['counting functions', 'finite automata', 'full trios', 'context-free languages']"
4959,1702.02700,George Berry,"George Berry, Christopher J. Cameron, Patrick Park, Michael W. Macy",The Opacity Problem in Social Contagion,"31 pages, 7 figures, 2 tables","Social Networks Volume 56, January 2019, Pages 93-101",10.1016/j.socnet.2018.09.001,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fads, product adoption, mobs, rumors, memes, and emergent norms are diverse
social contagions that have been modeled as network cascades. Empirical study
of these cascades is vulnerable to what we describe as the ""opacity problem"":
the inability to observe the critical level of peer influence required to
trigger an individual's behavioral change. Even with maximal information,
network cascades reveal intervals that bound critical levels of peer exposure,
rather than critical values themselves. Existing practice uses interval maxima,
which systematically over-estimates the social influence required for
behavioral change. Simulations reveal that the over-estimation is likely common
and large in magnitude. This is confirmed by an empirical study of hashtag
cascades among 3.2 million Twitter users: one in five hashtag adoptions suffers
critical value uncertainty due to the opacity problem. Different assumptions
about these intervals lead to qualitatively different conclusions about the
role of peer reinforcement in diffusion. We introduce a solution that combines
identifying tightly bounded intervals with predicting uncertain critical values
using node-level information.
","[{'version': 'v1', 'created': 'Thu, 9 Feb 2017 04:30:31 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Sep 2017 16:53:32 GMT'}, {'version': 'v3', 'created': 'Mon, 19 Nov 2018 23:35:28 GMT'}]",2018-11-21,"[['Berry', 'George', ''], ['Cameron', 'Christopher J.', ''], ['Park', 'Patrick', ''], ['Macy', 'Michael W.', '']]","['social contagion', 'social influence', 'peer effects', 'measurement']"
4960,1912.02734,Martin Diller,"Gerhard Brewka, Martin Diller, Georg Heissenberger, Thomas
  Linsbichler, Stefan Woltran",Solving Advanced Argumentation Problems with Answer Set Programming,"Under consideration in Theory and Practice of Logic Programming
  (TPLP)",Theory and Practice of Logic Programming 20 (2020) 391-431,10.1017/S1471068419000474,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Powerful formalisms for abstract argumentation have been proposed, among them
abstract dialectical frameworks (ADFs) that allow for a succinct and flexible
specification of the relationship between arguments, and the GRAPPA framework
which allows argumentation scenarios to be represented as arbitrary
edge-labelled graphs. The complexity of ADFs and GRAPPA is located beyond NP
and ranges up to the third level of the polynomial hierarchy. The combined
complexity of Answer Set Programming (ASP) exactly matches this complexity when
programs are restricted to predicates of bounded arity. In this paper, we
exploit this coincidence and present novel efficient translations from ADFs and
GRAPPA to ASP. More specifically, we provide reductions for the five main ADF
semantics of admissible, complete, preferred, grounded, and stable
interpretations, and exemplify how these reductions need to be adapted for
GRAPPA for the admissible, complete and preferred semantics. Under
consideration in Theory and Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Thu, 5 Dec 2019 17:20:34 GMT'}]",2020-04-22,"[['Brewka', 'Gerhard', ''], ['Diller', 'Martin', ''], ['Heissenberger', 'Georg', ''], ['Linsbichler', 'Thomas', ''], ['Woltran', 'Stefan', '']]","['ADFs', 'GRAPPA', 'encodings', 'ASP']"
4961,1304.5181,Vaishali Khairnar mrs,"Vaishali D. Khairnar, S. N. Pradhan",Comparative Study of Simulation for Vehicular Ad-hoc Network,"4 pages, International Journal of Computer Applications",,10.5120/7196-9967,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we have discussed about the number of automobiles that has been
increased on the road in the past few years. Due to high density of vehicles,
the potential threats and road accident is increasing. Wireless technology is
aiming to equip technology in vehicles to reduce these factors by sending
messages to each other. The vehicular safety application should be thoroughly
tested before it is deployed in a real world to use. Simulator tool has been
preferred over out door experiment because it simple, easy and cheap. VANET
requires that a traffic and network simulator should be used together to
perform this test. Many tools exist for this purpose but most of them have the
problem with the proper interaction. Simulating vehicular networks with
external stimulus to analyze its effect on wireless communication but to do
this job a good simulator is also needed.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2013 16:46:54 GMT'}]",2013-04-19,"[['Khairnar', 'Vaishali D.', ''], ['Pradhan', 'S. N.', '']]","['VANET', 'GUI', 'NHTSA', 'FND', 'IMTS', 'CVIS etc']"
4962,1805.11308,Robert Beverly,"Robert Beverly, Ramakrishnan Durairajan, David Plonka, and Justin P.
  Rohrer",In the IP of the Beholder: Strategies for Active IPv6 Topology Discovery,,,10.1145/3278532.3278559,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing methods for active topology discovery within the IPv6 Internet
largely mirror those of IPv4. In light of the large and sparsely populated
address space, in conjunction with aggressive ICMPv6 rate limiting by routers,
this work develops a different approach to Internet-wide IPv6 topology mapping.
We adopt randomized probing techniques in order to distribute probing load,
minimize the effects of rate limiting, and probe at higher rates. Second, we
extensively analyze the efficiency and efficacy of various IPv6 hitlists and
target generation methods when used for topology discovery, and synthesize new
target lists based on our empirical results to provide both breadth (coverage
across networks) and depth (to find potential subnetting). Employing our
probing strategy, we discover more than 1.3M IPv6 router interface addresses
from a single vantage point. Finally, we share our prober implementation,
synthesized target lists, and discovered IPv6 topology results.
","[{'version': 'v1', 'created': 'Tue, 29 May 2018 08:46:47 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Oct 2018 18:20:53 GMT'}]",2018-10-11,"[['Beverly', 'Robert', ''], ['Durairajan', 'Ramakrishnan', ''], ['Plonka', 'David', ''], ['Rohrer', 'Justin P.', '']]","['IPv6', 'Topology', 'Hitlists']"
4963,1404.3012,Shun Kataoka,"Kazuyuki Tanaka, Shun Kataoka, Muneki Yasuda, Yuji Waizumi and
  Chiou-Ting Hsu",Bayesian image segmentations by Potts prior and loopy belief propagation,"24 pages, 9 figures",Journal of the Physical Society of Japan 83 (2014) 124002,10.7566/JPSJ.83.124002,,cs.CV cond-mat.dis-nn cond-mat.stat-mech cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a Bayesian image segmentation model based on Potts prior
and loopy belief propagation. The proposed Bayesian model involves several
terms, including the pairwise interactions of Potts models, and the average
vectors and covariant matrices of Gauss distributions in color image modeling.
These terms are often referred to as hyperparameters in statistical machine
learning theory. In order to determine these hyperparameters, we propose a new
scheme for hyperparameter estimation based on conditional maximization of
entropy in the Potts prior. The algorithm is given based on loopy belief
propagation. In addition, we compare our conditional maximum entropy framework
with the conventional maximum likelihood framework, and also clarify how the
first order phase transitions in LBP's for Potts models influence our
hyperparameter estimation procedures.
","[{'version': 'v1', 'created': 'Fri, 11 Apr 2014 06:31:03 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Apr 2014 10:26:46 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Jun 2014 11:18:44 GMT'}, {'version': 'v4', 'created': 'Fri, 15 Aug 2014 00:58:40 GMT'}, {'version': 'v5', 'created': 'Mon, 18 Aug 2014 04:45:26 GMT'}]",2014-11-19,"[['Tanaka', 'Kazuyuki', ''], ['Kataoka', 'Shun', ''], ['Yasuda', 'Muneki', ''], ['Waizumi', 'Yuji', ''], ['Hsu', 'Chiou-Ting', '']]","['Bayesian statistics', 'statistical-mechanical informatics', 'maximum likelihood estimation', 'prob']"
4964,0903.1150,Toby Walsh,S. Armagan Tarim and Suresh Manandhar and Toby Walsh,Stochastic Constraint Programming: A Scenario-Based Approach,,Constraints 11(1): 53-80 (2006),10.1007/s10601-006-6849-7,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To model combinatorial decision problems involving uncertainty and
probability, we introduce scenario based stochastic constraint programming.
Stochastic constraint programs contain both decision variables, which we can
set, and stochastic variables, which follow a discrete probability
distribution. We provide a semantics for stochastic constraint programs based
on scenario trees. Using this semantics, we can compile stochastic constraint
programs down into conventional (non-stochastic) constraint programs. This
allows us to exploit the full power of existing constraint solvers. We have
implemented this framework for decision making under uncertainty in stochastic
OPL, a language which is based on the OPL constraint modelling language
[Hentenryck et al., 1999]. To illustrate the potential of this framework, we
model a wide range of problems in areas as diverse as portfolio
diversification, agricultural planning and production/inventory management.
","[{'version': 'v1', 'created': 'Fri, 6 Mar 2009 04:12:20 GMT'}]",2009-03-09,"[['Tarim', 'S. Armagan', ''], ['Manandhar', 'Suresh', ''], ['Walsh', 'Toby', '']]","['constraint programming', 'constraint satisfaction', 'reasoning under uncertainty']"
4965,1907.09579,Martin Schanzenbach,"Martin Schanzenbach, Thomas Kilian, Julian Sch\""utte, Christian Banse","ZKlaims: Privacy-preserving Attribute-based Credentials using
  Non-interactive Zero-knowledge Techniques","8 pages, published at SECRYPT 2019","Proceedings of the 16th International Joint Conference on
  e-Business and Telecommunications - Volume 2: SECRYPT, 325-332, 2019, Prague,
  Czech Republic",10.5220/0007772903250332,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present ZKlaims: a system that allows users to present
attribute-based credentials in a privacy-preserving way. We achieve a
zero-knowledge property on the basis of Succinct Non-interactive Arguments of
Knowledge (SNARKs). ZKlaims allow users to prove statements on credentials
issued by trusted third parties. The credential contents are never revealed to
the verifier as part of the proving process. Further, ZKlaims can be presented
non-interactively, mitigating the need for interactive proofs between the user
and the verifier. This allows ZKlaims to be exchanged via fully decentralized
services and storages such as traditional peer-to-peer networks based on
distributed hash tables (DHTs) or even blockchains. To show this, we include a
performance evaluation of ZKlaims and show how it can be integrated in
decentralized identity provider services.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2019 21:14:08 GMT'}]",2019-08-21,"[['Schanzenbach', 'Martin', ''], ['Kilian', 'Thomas', ''], ['Schütte', 'Julian', ''], ['Banse', 'Christian', '']]","['Zero-Knowledge', 'Attribute-Based Credentials', 'Privacy', 'Identity and Access Management']"
4966,2102.08545,Mohamed Alrshah,Entisar Alhadi Al Ghawail and Sadok Ben Yahia and Mohamed A. Alrshah,Challenges of Applying E-Learning in the Libyan Higher Education System,6 pages,,10.30534/ijatcse/2019/0681.42019,,cs.CY cs.NI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The adoption of ICT in classrooms is very important in order to improve
education quality, promote effective management of knowledge, and improve
delivery of knowledge in higher education. Some of the Libyan universities have
already started using E-learning in classrooms, but many challenges are still
hindering that adoption. This paper endeavors to find the obstacles that may
face the adoption of E-learning in Libya and sketches out the possible
solutions. Further, it highlights the potentials for the adoption of E-learning
in the higher education system in Libya using both qualitative and quantitative
approaches. Both questioner and interview have been used on a focused group to
collect the data. Teachers and students at Al Asmarya Islamic University have
been selected as a sample for this study. This paper reveals that the
challenges hindering teachers and students from using ICT and E-learning are:
the lack of knowledge about ICT and E-learning, the lack of ICT infrastructure,
and the lack of financial support. However, the participants show a high level
of interest in applying the ICT and E-learning in the university despite the
unsuitability of the environment.
","[{'version': 'v1', 'created': 'Wed, 17 Feb 2021 03:20:46 GMT'}]",2021-02-18,"[['Ghawail', 'Entisar Alhadi Al', ''], ['Yahia', 'Sadok Ben', ''], ['Alrshah', 'Mohamed A.', '']]","['smart learning', 'Libyan higher education', 'E-learning', 'education quality']"
4967,1602.08778,W{\l}odzimierz Drabent,W{\l}odzimierz Drabent,Proving completeness of logic programs with the cut,17 pages,"final version: Formal Aspects of Computing, 2017, 29(1),155-172",10.1007/s00165-016-0392-0,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Completeness of a logic program means that the program produces all the
answers required by its specification. The cut is an important construct of
programming language Prolog. It prunes part of the search space, this may
result in a loss of completeness. This paper proposes a way of proving
completeness of programs with the cut. The semantics of the cut is formalized
by describing how SLD-trees are pruned. A sufficient condition for completeness
is presented, proved sound, and illustrated by examples.
","[{'version': 'v1', 'created': 'Sun, 28 Feb 2016 22:27:25 GMT'}]",2020-01-03,"[['Drabent', 'Włodzimierz', '']]","['logic programming', 'operational semantics', 'program correctness', 'program completeness', 'the cut']"
4968,1903.08409,Kui Liu,"Kui Liu, Anil Koyuncu, Dongsun Kim, Tegawend\'e F. Bissyand\'e",TBar: Revisiting Template-based Automated Program Repair,Accepted by ISSTA 2019,,10.1145/3293882.3330577,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We revisit the performance of template-based APR to build comprehensive
knowledge about the effectiveness of fix patterns, and to highlight the
importance of complementary steps such as fault localization or donor code
retrieval. To that end, we first investigate the literature to collect,
summarize and label recurrently-used fix patterns. Based on the investigation,
we build TBar, a straightforward APR tool that systematically attempts to apply
these fix patterns to program bugs. We thoroughly evaluate TBar on the
Defects4J benchmark. In particular, we assess the actual qualitative and
quantitative diversity of fix patterns, as well as their effectiveness in
yielding plausible or correct patches. Eventually, we find that, assuming a
perfect fault localization, TBar correctly/plausibly fixes 74/101 bugs.
Replicating a standard and practical pipeline of APR assessment, we demonstrate
that TBar correctly fixes 43 bugs from Defects4J, an unprecedented performance
in the literature (including all approaches, i.e., template-based, stochastic
mutation-based or synthesis-based APR).
","[{'version': 'v1', 'created': 'Wed, 20 Mar 2019 09:48:02 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Jun 2019 09:09:15 GMT'}]",2019-06-07,"[['Liu', 'Kui', ''], ['Koyuncu', 'Anil', ''], ['Kim', 'Dongsun', ''], ['Bissyandé', 'Tegawendé F.', '']]","['Automated program repair', 'fix pattern', 'empirical assessment']"
4969,1804.04691,Hssini Mohamed Mr.,"Mohamed Hssini, Azzeddine Lazrek",Problem of Multiple Diacritics Design for Arabic Script,"6 pages, 10 figures","IOSR Journal of Engineering e-ISSN: 2250-3021, p-ISSN: 2278-8719,
  Vol. 2, Issue 12 (Dec. 2012), V3 PP 48-53",10.9790/3021-021234853,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study focuses on the design of multiple Arabic diacritical marks and to
developing a model that generates the stacking of multiples Arabic diacritics
in order to integrate it into a system of Arabic composition. The problem
concerns the presence of multiple diacritics on a single basic letter. This
model is based on the layering composition. The combination of diacritics with
letters requires a basic layering to combine any diacritics in the word with
their base letter, without having to deal individually and separately each pair
of base letter and diacritics.
","[{'version': 'v1', 'created': 'Wed, 11 Apr 2018 10:23:20 GMT'}]",2018-04-16,"[['Hssini', 'Mohamed', ''], ['Lazrek', 'Azzeddine', '']]","['Knowledge management', 'Compositions by layers', 'Multiple Arabic Diacritics', 'TEX', 'Arabi system']"
4970,1502.02511,Behzad Ghanbarian,"Behzad Ghanbarian, Vahid Taslimitehrani, Guozhu Dong, Yakov A.
  Pachepsky","Measurement Scale Effect on Prediction of Soil Water Retention Curve and
  Saturated Hydraulic Conductivity",,Journal of Hydrology (2015) Vol. 528 pp. 127-137,10.1016/j.jhydrol.2015.06.024,,cs.CE cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Soil water retention curve (SWRC) and saturated hydraulic conductivity (SHC)
are key hydraulic properties for unsaturated zone hydrology and groundwater. In
particular, SWRC provides useful information on entry pore-size distribution,
and SHC is required for flow and transport modeling in the hydrologic cycle.
Not only the SWRC and SHC measurements are time-consuming, but also scale
dependent. This means as soil column volume increases, variability of the SWRC
and SHC decreases. Although prediction of the SWRC and SHC from available
parameters, such as textural data, organic matter, and bulk density have been
under investigation for decades, up to now no research has focused on the
effect of measurement scale on the soil hydraulic properties pedotransfer
functions development. In the literature, several data mining approaches have
been applied, such as multiple linear regression, artificial neural networks,
group method of data handling. However, in this study we develop pedotransfer
functions using a novel approach called contrast pattern aided regression
(CPXR) and compare it with the multiple linear regression method. For this
purpose, two databases including 210 and 213 soil samples are collected to
develop and evaluate pedotransfer functions for the SWRC and SHC, respectively,
from the UNSODA database. The 10-fold cross-validation method is applied to
evaluate the accuracy and reliability of the proposed regression-based models.
Our results show that including measurement scale parameters, such as sample
internal diameter and length could substantially improve the accuracy of the
SWRC and SHC pedotransfer functions developed using the CPXR method, while this
is not the case when MLR is used. Moreover, the CPXR method yields remarkably
more accurate soil water retention curve and saturated hydraulic conductivity
predictions than the MLR approach.
","[{'version': 'v1', 'created': 'Mon, 9 Feb 2015 14:54:48 GMT'}]",2018-08-29,"[['Ghanbarian', 'Behzad', ''], ['Taslimitehrani', 'Vahid', ''], ['Dong', 'Guozhu', ''], ['Pachepsky', 'Yakov A.', '']]","['Soil water retention curve', 'Contrast pattern aided regression', 'Pedotransfer']"
4971,1810.07488,Rob van Glabbeek,Nick Fischer and Rob van Glabbeek,"Axiomatising Infinitary Probabilistic Weak Bisimilarity of Finite-State
  Behaviours",,,10.1016/j.jlamp.2018.09.006,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In concurrency theory, weak bisimilarity is often used to relate processes
exhibiting the same observable behaviour. The probabilistic environment gives
rise to several generalisations; we study the infinitary semantics, which
abstracts from a potentially unbounded number of internal actions being
performed when something observable happens. Arguing that this notion yields
the most desirable properties, we provide a sound and complete axiomatisation
capturing its essence. Previous research has failed to achieve completeness in
the presence of unguarded recursion, as only the finitary variant has been
axiomatised, yet.
","[{'version': 'v1', 'created': 'Wed, 17 Oct 2018 11:50:51 GMT'}]",2018-10-18,"[['Fischer', 'Nick', ''], ['van Glabbeek', 'Rob', '']]","['Axiomatisation', 'Process algebra', 'Probability', 'Recursion']"
4972,1308.4820,Shariq Hussain Mr.,"Shariq Hussain, Zhaoshun Wang and Sabit Rahim",E-learning Services for Rural Communities,"6 pages, 6 figures, 3 tables","International Journal of Computer Applications, vol.68, no.5,
  2013, pp.15-20",10.5120/11574-6888,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information and communication technologies brought-in tools and techniques in
the field of education that introduced new concepts of teaching and learning.
Learning management system is one of the key tools used in educational
institutes to facilitate e-learning. There is remarkable digital divide among
urban and rural areas. In this paper, we present a model for providing
e-learning services to remote/rural areas in order to promote and facilitate
modern education. A dedicated resource center, hosting the learning management
system, facilitates e-learning centers through Internet. The overall goal of
this model is to have a cost-effective learning environment equipped with
latest technologies to provide learners an opportunity to get insight into new
information and communication technologies and e-learning environment. The
model offers new teaching methodology with enhance utilization of learning
management system in teaching and learning. Basic characteristics and technical
aspects will be considered as well. The study will also promote development and
usage of open-source technologies.
","[{'version': 'v1', 'created': 'Thu, 22 Aug 2013 10:57:55 GMT'}, {'version': 'v2', 'created': 'Sat, 31 Aug 2013 05:41:04 GMT'}]",2013-09-03,"[['Hussain', 'Shariq', ''], ['Wang', 'Zhaoshun', ''], ['Rahim', 'Sabit', '']]","['E-learning', 'ICTs', 'Educational Technology', 'Learning Management System', 'Open-source Software']"
4973,1502.04221,Renato J Cintra,"A. Madanayake, R. J. Cintra, D. Onen, V. S. Dimitrov, N. T.
  Rajapaksha, L. T. Bruton, A. Edirisuriya","A Row-parallel 8$\times$8 2-D DCT Architecture Using Algebraic Integer
  Based Exact Computation","28 pages, 9 figures, 7 tables, corrected typos","IEEE Transactions on Circuits and Systems for Video Technology,
  vol. 22, no. 6, pp. 915--929, 2012",10.1109/TCSVT.2011.2181232,,cs.AR cs.DM math.NT stat.CO stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An algebraic integer (AI) based time-multiplexed row-parallel architecture
and two final-reconstruction step (FRS) algorithms are proposed for the
implementation of bivariate AI-encoded 2-D discrete cosine transform (DCT). The
architecture directly realizes an error-free 2-D DCT without using FRSs between
row-column transforms, leading to an 8$\times$8 2-D DCT which is entirely free
of quantization errors in AI basis. As a result, the user-selectable accuracy
for each of the coefficients in the FRS facilitates each of the 64 coefficients
to have its precision set independently of others, avoiding the leakage of
quantization noise between channels as is the case for published DCT designs.
The proposed FRS uses two approaches based on (i) optimized Dempster-Macleod
multipliers and (ii) expansion factor scaling. This architecture enables
low-noise high-dynamic range applications in digital video processing that
requires full control of the finite-precision computation of the 2-D DCT. The
proposed architectures and FRS techniques are experimentally verified and
validated using hardware implementations that are physically realized and
verified on FPGA chip. Six designs, for 4- and 8-bit input word sizes, using
the two proposed FRS schemes, have been designed, simulated, physically
implemented and measured. The maximum clock rate and block-rate achieved among
8-bit input designs are 307.787 MHz and 38.47 MHz, respectively, implying a
pixel rate of 8$\times$307.787$\approx$2.462 GHz if eventually embedded in a
real-time video-processing system. The equivalent frame rate is about 1187.35
Hz for the image size of 1920$\times$1080. All implementations are functional
on a Xilinx Virtex-6 XC6VLX240T FPGA device.
","[{'version': 'v1', 'created': 'Sat, 14 Feb 2015 16:14:05 GMT'}]",2015-02-17,"[['Madanayake', 'A.', ''], ['Cintra', 'R. J.', ''], ['Onen', 'D.', ''], ['Dimitrov', 'V. S.', ''], ['Rajapaksha', 'N. T.', ''], ['Bruton', 'L. T.', ''], ['Edirisuriya', 'A.', '']]","['DCT', 'Algebraic Integer Quantization', 'FPGA design']"
4974,1807.02386,"Holger Schn\""adelbach Dr","Holger Schn\""adelbach, Tom Lodge, Tim Coughlan, Alex Taylor",Photo Screen: Shaping Perceptions of Residential Communities,"4 pages, plus references",,10.13140/RG.2.2.10502.88642,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Engaging residential communities with each other and with management remains
a challenge. Housing providers deploy a variety of engagement strategies, some
of which are supported by digital technologies. Their individual success is
varied and integrated, multipronged approaches are seen to be more successful.
As part of those, it is important to address people's perceptions of community
and places, as well as any practical issues that they face. We present the
design and evaluation of Photo Screen, a situated, public photo taking and
viewing screen which was deployed in the context of a new flagship housing
estate as part of a range of community engagement measures. In a new context,
we confirm the high levels of engagement that can be achieved with this simple
mechanism. We propose that photo 'tagging' might offer a second-stage
engagement mechanism and enable meaningful dialogue between residents and
management. Finally, we discuss how this playful activity allowed residents to
positively shape the perception of their community.
","[{'version': 'v1', 'created': 'Fri, 6 Jul 2018 12:47:20 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Jul 2018 10:22:59 GMT'}]",2018-07-11,"[['Schnädelbach', 'Holger', ''], ['Lodge', 'Tom', ''], ['Coughlan', 'Tim', ''], ['Taylor', 'Alex', '']]","['Community', 'Residential', 'Photo', 'Interactive Screen']"
4975,2102.00322,Vaneet Aggarwal,Mayank Gupta and Lingjun Chen and Denny Yu and Vaneet Aggarwal,"A Supervised Learning Approach for Robust Health Monitoring using Face
  Videos","The main part of the paper appeared in DFHS'20: Proceedings of the
  2nd ACM Workshop on Device-Free Human Sensing; while the Supplementary did
  not appear in the proceedings","Proceedings of the 2nd ACM Workshop on Device-Free Human Sensing
  (DFHS 2020) Nov. 2020 pp. 6-10",10.1145/3427772.3429392,,cs.CV cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Monitoring of cardiovascular activity is highly desired and can enable novel
applications in diagnosing potential cardiovascular diseases and maintaining an
individual's well-being. Currently, such vital signs are measured using
intrusive contact devices such as an electrocardiogram (ECG), chest straps, and
pulse oximeters that require the patient or the health provider to manually
implement. Non-contact, device-free human sensing methods can eliminate the
need for specialized heart and blood pressure monitoring equipment. Non-contact
methods can have additional advantages since they are scalable with any
environment where video can be captured, can be used for continuous
measurements, and can be used on patients with varying levels of dexterity and
independence, from people with physical impairments to infants (e.g., baby
camera). In this paper, we used a non-contact method that only requires face
videos recorded using commercially-available webcams. These videos were
exploited to predict the health attributes like pulse rate and variance in
pulse rate. The proposed approach used facial recognition to detect the face in
each frame of the video using facial landmarks, followed by supervised learning
using deep neural networks to train the machine learning model. The videos
captured subjects performing different physical activities that result in
varying cardiovascular responses. The proposed method did not require training
data from every individual and thus the prediction can be obtained for the new
individuals for which there is no prior data; critical in approach
generalization. The approach was also evaluated on a dataset of people with
different ethnicity. The proposed approach had less than a 4.6\% error in
predicting the pulse rate.
","[{'version': 'v1', 'created': 'Sat, 30 Jan 2021 22:03:16 GMT'}]",2021-02-02,"[['Gupta', 'Mayank', ''], ['Chen', 'Lingjun', ''], ['Yu', 'Denny', ''], ['Aggarwal', 'Vaneet', '']]","['Pulse rate', 'Pulse rate variability', 'Facial Recognition', 'SupervisedLearning', 'Neural network', 'Photoplethysmogram']"
4976,1704.07664,Ashish Mani Dr.,"Arit Kumar Bishwas, Ashish Mani, Vasile Palade",An All-Pair Quantum SVM Approach for Big Data Multiclass Classification,,"Quantum Information Processing October 2018, 17:282 Springer US",10.1007/s11128-018-2046-z,,cs.LG quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we have discussed a quantum approach for the all-pair
multiclass classification problem. We have shown that the multiclass support
vector machine for big data classification with a quantum all-pair approach can
be implemented in logarithm runtime complexity on a quantum computer. In an
all-pair approach, there is one binary classification problem for each pair of
classes, and so there are k (k-1)/2 classifiers for a k-class problem. As
compared to the classical multiclass support vector machine that can be
implemented with polynomial run time complexity, our approach exhibits
exponential speed up in the quantum version. The quantum all-pair algorithm can
be used with other classification algorithms, and a speed up gain can be
achieved as compared to their classical counterparts.
","[{'version': 'v1', 'created': 'Tue, 25 Apr 2017 12:33:57 GMT'}, {'version': 'v2', 'created': 'Tue, 15 May 2018 04:51:40 GMT'}]",2018-11-13,"[['Bishwas', 'Arit Kumar', ''], ['Mani', 'Ashish', ''], ['Palade', 'Vasile', '']]","['Multiclass Classification', 'SVM', 'Quantum Algorithm']"
4977,1409.1284,Sawood Alam,Sawood Alam and Fateh ud din B Mehmood and Michael L. Nelson,"Improving Accessibility of Archived Raster Dictionaries of Complex
  Script Languages","11 pages, 5 images, 2 codes, 1 table",,10.1145/2756406.2756926,,cs.DL cs.IR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We propose an approach to index raster images of dictionary pages which in
turn would require very little manual effort to enable direct access to the
appropriate pages of the dictionary for lookup. Accessibility is further
improved by feedback and crowdsourcing that enables highlighting of the
specific location on the page where the lookup word is found, annotation,
digitization, and fielded searching. This approach is equally applicable on
simple scripts as well as complex writing systems. Using our proposed approach,
we have built a Web application called ""Dictionary Explorer"" which supports
word indexes in various languages and every language can have multiple
dictionaries associated with it. Word lookup gives direct access to appropriate
pages of all the dictionaries of that language simultaneously. The application
has exploration features like searching, pagination, and navigating the word
index through a tree-like interface. The application also supports feedback,
annotation, and digitization features. Apart from the scanned images,
""Dictionary Explorer"" aggregates results from various sources and user
contributions in Unicode. We have evaluated the time required for indexing
dictionaries of different sizes and complexities in the Urdu language and
examined various trade-offs in our implementation. Using our approach, a single
person can make a dictionary of 1,000 pages searchable in less than an hour.
","[{'version': 'v1', 'created': 'Wed, 3 Sep 2014 23:27:18 GMT'}]",2019-05-20,"[['Alam', 'Sawood', ''], ['Mehmood', 'Fateh ud din B', ''], ['Nelson', 'Michael L.', '']]","['Dictionary', 'OCR', 'Indexing', 'Digitization', 'Retrieval']"
4978,1509.01094,Miguel Rodr\'iguez P\'erez,"Miguel Rodr\'iguez P\'erez, Sergio Herrer\'ia Alonso, Manuel
  Fern\'andez Veiga, C\'andido L\'opez Garc\'ia","An Ant Colonization Routing Algorithm to Minimize Network Power
  Consumption",Accepted version of the manuscript. 12 pages,"Journal of Network and Computer Applications Volume 58, December
  2015, Pages 217--226",10.1016/j.jnca.2015.08.011,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rising energy consumption of IT infrastructure concerns have spurred the
development of more power efficient networking equipment and algorithms. When
\emph{old} equipment just drew an almost constant amount of power regardless of
the traffic load, there were some efforts to minimize the total energy usage by
modifying routing decisions to aggregate traffic in a minimal set of links,
creating the opportunity to power off some unused equipment during low traffic
periods. New equipment, with power profile functions depending on the offered
load, presents new challenges for optimal routing. The goal now is not just to
power some links down, but to aggregate and/or spread the traffic so that
devices operate in their sweet spot in regards to network usage. In this paper
we present an algorithm that, making use of the ant colonization algorithm,
computes, in a decentralized manner, the routing tables so as to minimize
global energy consumption. Moreover, the resulting algorithm is also able to
track changes in the offered load and react to them in real time.
","[{'version': 'v1', 'created': 'Thu, 3 Sep 2015 14:07:53 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Sep 2015 09:22:24 GMT'}]",2015-12-09,"[['Pérez', 'Miguel Rodríguez', ''], ['Alonso', 'Sergio Herrería', ''], ['Veiga', 'Manuel Fernández', ''], ['García', 'Cándido López', '']]","['Ant colony optimization', 'Power saving routing', 'Energy efficiency', 'Performance evaluation']"
4979,1307.3336,Arti Buche Ms,"Arti Buche, Dr. M. B. Chandak and Akshay Zadgaonkar",Opinion Mining and Analysis: A survey,10 pages,"IJNLC Vol. 2, No.3, June 2013",10.5121/ijnlc.2013.2304,,cs.CL cs.IR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The current research is focusing on the area of Opinion Mining also called as
sentiment analysis due to sheer volume of opinion rich web resources such as
discussion forums, review sites and blogs are available in digital form. One
important problem in sentiment analysis of product reviews is to produce
summary of opinions based on product features. We have surveyed and analyzed in
this paper, various techniques that have been developed for the key tasks of
opinion mining. We have provided an overall picture of what is involved in
developing a software system for opinion mining on the basis of our survey and
analysis.
","[{'version': 'v1', 'created': 'Fri, 12 Jul 2013 06:20:36 GMT'}]",2013-07-15,"[['Buche', 'Arti', ''], ['Chandak', 'Dr. M. B.', ''], ['Zadgaonkar', 'Akshay', '']]","['Opinion Mining', 'Sentiment Analysis', 'product reviews', 'machine learning']"
4980,1309.1628,Pawel Dlotko PhD,"Pawe{\l} D{\l}otko, Ruben Specogna",Topology preserving thinning for cell complexes,,,10.1109/TIP.2014.2348799,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A topology preserving skeleton is a synthetic representation of an object
that retains its topology and many of its significant morphological properties.
The process of obtaining the skeleton, referred to as skeletonization or
thinning, is a very active research area. It plays a central role in reducing
the amount of information to be processed during image analysis and
visualization, computer-aided diagnosis or by pattern recognition algorithms.
  This paper introduces a novel topology preserving thinning algorithm which
removes \textit{simple cells}---a generalization of simple points---of a given
cell complex. The test for simple cells is based on \textit{acyclicity tables}
automatically produced in advance with homology computations. Using acyclicity
tables render the implementation of thinning algorithms straightforward.
Moreover, the fact that tables are automatically filled for all possible
configurations allows to rigorously prove the generality of the algorithm and
to obtain fool-proof implementations. The novel approach enables, for the first
time, according to our knowledge, to thin a general unstructured simplicial
complex. Acyclicity tables for cubical and simplicial complexes and an open
source implementation of the thinning algorithm are provided as additional
material to allow their immediate use in the vast number of practical
applications arising in medical imaging and beyond.
","[{'version': 'v1', 'created': 'Fri, 6 Sep 2013 13:11:48 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Feb 2014 13:39:05 GMT'}]",2015-06-17,"[['Dłotko', 'Paweł', ''], ['Specogna', 'Ruben', '']]","['skeleton', 'skeletonization', 'iterative thinning', 'topology preservation', 'algebraic topology', 'homology', 'topological image analysis']"
4981,0707.2126,Vahan Mkrtchyan,"R.R. Kamalian, V. V. Mkrtchyan",On complexity of special maximum matchings constructing,"12 pages, 8 figures. Discrete Mathematics, to appear","Discrete Mathematics, 2008, Vol 308/10 pp 1792-1800",10.1016/j.disc.2007.04.029,,cs.DM,,"  For bipartite graphs the NP-completeness is proved for the problem of
existence of maximum matching which removal leads to a graph with given
lower(upper)bound for the cardinality of its maximum matching.
","[{'version': 'v1', 'created': 'Sat, 14 Jul 2007 05:05:34 GMT'}]",2008-03-08,"[['Kamalian', 'R. R.', ''], ['Mkrtchyan', 'V. V.', '']]","['Maximum matching', 'Bipartite graph', 'NP-completeness']"
4982,1305.1842,Ward Jaradat,"Ward Jaradat, Alan Dearle and Adam Barker",An Architecture for Decentralised Orchestration of Web Service Workflows,"To appear in Proceedings of the IEEE 20th International Conference on
  Web Services (ICWS 2013)",,10.1109/ICWS.2013.84,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Service-oriented workflows are typically executed using a centralised
orchestration approach that presents significant scalability challenges. These
challenges include the consumption of network bandwidth, degradation of
performance, and single-points of failure. We provide a decentralised
orchestration architecture that attempts to address these challenges. Our
architecture adopts a design model that permits the computation to be moved
""closer"" to services in a workflow. This is achieved by partitioning workflows
specified using our simple dataflow language into smaller fragments, which may
be sent to remote locations for execution.
","[{'version': 'v1', 'created': 'Wed, 8 May 2013 15:07:08 GMT'}]",2013-11-11,"[['Jaradat', 'Ward', ''], ['Dearle', 'Alan', ''], ['Barker', 'Adam', '']]","['Web Service Workflows', 'Decentralised Orchestration Architecture', 'Dataflow Specification Language']"
4983,2012.09402,Sai Praneeth Sunkesula,"Sai Praneeth Reddy Sunkesula, Rishabh Dabral, Ganesh Ramakrishnan","LIGHTEN: Learning Interactions with Graph and Hierarchical TEmporal
  Networks for HOI in videos","9 pages, 6 figures, ACM Multimedia Conference 2020","MM20 Proceedings of the 28th ACM International Conference on
  Multimedia, October 2020, Pages 691 to 699",10.1145/3394171.3413778,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Analyzing the interactions between humans and objects from a video includes
identification of the relationships between humans and the objects present in
the video. It can be thought of as a specialized version of Visual Relationship
Detection, wherein one of the objects must be a human. While traditional
methods formulate the problem as inference on a sequence of video segments, we
present a hierarchical approach, LIGHTEN, to learn visual features to
effectively capture spatio-temporal cues at multiple granularities in a video.
Unlike current approaches, LIGHTEN avoids using ground truth data like depth
maps or 3D human pose, thus increasing generalization across non-RGBD datasets
as well. Furthermore, we achieve the same using only the visual features,
instead of the commonly used hand-crafted spatial features. We achieve
state-of-the-art results in human-object interaction detection (88.9% and
92.6%) and anticipation tasks of CAD-120 and competitive results on image based
HOI detection in V-COCO dataset, setting a new benchmark for visual features
based approaches. Code for LIGHTEN is available at
https://github.com/praneeth11009/LIGHTEN-Learning-Interactions-with-Graphs-and-Hierarchical-TEmporal-Networks-for-HOI
","[{'version': 'v1', 'created': 'Thu, 17 Dec 2020 05:44:07 GMT'}]",2020-12-18,"[['Sunkesula', 'Sai Praneeth Reddy', ''], ['Dabral', 'Rishabh', ''], ['Ramakrishnan', 'Ganesh', '']]","['Human-Object Interaction', 'Visual Relationships', 'Hierarchical RNN', 'Spatio-Temporal Graph Modelling']"
4984,1706.06195,Ivo Gon\c{c}alves,"Ivo Gon\c{c}alves, Sara Silva, Carlos M. Fonseca, Mauro Castelli",Unsure When to Stop? Ask Your Semantic Neighbors,,,10.1145/3071178.3071328,,cs.NE cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In iterative supervised learning algorithms it is common to reach a point in
the search where no further induction seems to be possible with the available
data. If the search is continued beyond this point, the risk of overfitting
increases significantly. Following the recent developments in inductive
semantic stochastic methods, this paper studies the feasibility of using
information gathered from the semantic neighborhood to decide when to stop the
search. Two semantic stopping criteria are proposed and experimentally assessed
in Geometric Semantic Genetic Programming (GSGP) and in the Semantic Learning
Machine (SLM) algorithm (the equivalent algorithm for neural networks). The
experiments are performed on real-world high-dimensional regression datasets.
The results show that the proposed semantic stopping criteria are able to
detect stopping points that result in a competitive generalization for both
GSGP and SLM. This approach also yields computationally efficient algorithms as
it allows the evolution of neural networks in less than 3 seconds on average,
and of GP trees in at most 10 seconds. The usage of the proposed semantic
stopping criteria in conjunction with the computation of optimal
mutation/learning steps also results in small trees and neural networks.
","[{'version': 'v1', 'created': 'Mon, 19 Jun 2017 22:29:08 GMT'}]",2017-06-21,"[['Gonçalves', 'Ivo', ''], ['Silva', 'Sara', ''], ['Fonseca', 'Carlos M.', ''], ['Castelli', 'Mauro', '']]","['Geometric Semantic Genetic Programming', 'Semantic Learning Machine', 'Generalization', 'Overfting', 'Stopping Criteria']"
4985,1801.05694,Awais Ashfaq,"Awais Ashfaq, Jonas Adler","A modified fuzzy C means algorithm for shading correction in
  craniofacial CBCT images","15 pages, published in CMBEBIH 2017","Proceedings of the International Conference on Medical and
  Biological Engineering 2017",10.1007/978-981-10-4166-2_81,,cs.CV eess.IV physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CBCT images suffer from acute shading artifacts primarily due to scatter.
Numerous image-domain correction algorithms have been proposed in the
literature that use patient-specific planning CT images to estimate shading
contributions in CBCT images. However, in the context of radiosurgery
applications such as gamma knife, planning images are often acquired through
MRI which impedes the use of polynomial fitting approaches for shading
correction. We present a new shading correction approach that is independent of
planning CT images. Our algorithm is based on the assumption that true CBCT
images follow a uniform volumetric intensity distribution per material, and
scatter perturbs this uniform texture by contributing cupping and shading
artifacts in the image domain. The framework is a combination of fuzzy C-means
coupled with a neighborhood regularization term and Otsu's method. Experimental
results on artificially simulated craniofacial CBCT images are provided to
demonstrate the effectiveness of our algorithm. Spatial non-uniformity is
reduced from 16% to 7% in soft tissue and from 44% to 8% in bone regions. With
shading-correction, thresholding based segmentation accuracy for bone pixels is
improved from 85% to 91% when compared to thresholding without
shading-correction. The proposed algorithm is thus practical and qualifies as a
plug and play extension into any CBCT reconstruction software for shading
correction.
","[{'version': 'v1', 'created': 'Wed, 17 Jan 2018 14:54:39 GMT'}]",2018-01-18,"[['Ashfaq', 'Awais', ''], ['Adler', 'Jonas', '']]","['Cone beam CT', 'Shading correction', 'Fuzzy C means']"
4986,2105.05338,AKM Bahalul Haque,"AKM Bahalul Haque, Md. Rifat Hasan, Md. Oahiduzzaman Mondol Zihad","SmartOil: Blockchain and smart contract-based oil supply chain
  management",Accepted as Open access article in IET Blockchain,"IET Blockchain, 2021",10.1049/blc2.12005,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  The traditional oil supply chain suffers from various shortcomings regarding
crude oil extraction, processing, distribution, environmental pollution, and
traceability. It offers an only a forward flow of products with almost no
security and tracking process. In time, the system will lag behind due to the
limitations in quality inspection, fraudulent information, and monopolistic
behavior of supply chain entities. Inclusion of counterfeiting products and
opaqueness of the system urge renovation in this sector. The recent evolution
of Industry 4.0 leads to the alternation in the supply chain introducing the
smart supply chain. Technological advancement can now reshape the
infrastructure of the supply chain for the future. In this paper, we suggest a
conceptual framework utilizing Blockchain and Smart Contract to monitor the
overall oil supply chain. Blockchain is a groundbreaking technology to monitor
and support the security building of a decentralized type supply chain over a
peer-to-peer network. The use of the Internet of Things (IoT), especially
sensors, opens broader window to track the global supply chain in real-time. We
construct a methodology to support reverse traceability for each participant of
the supply chain. The functions and characteristics of Blockchain and Smart
Contract are defined. Implementation of Smart Contracts has also been shown
with detailed analysis. We further describe the challenges of implementing such
a system and validate our framework's adaptability in the real world. The paper
concludes with future research scope to mitigate the restrictions of data
management and maintenance with advanced working prototypes and agile systems
achieving greater traceability and transparency.
","[{'version': 'v1', 'created': 'Tue, 11 May 2021 20:45:13 GMT'}]",2021-05-13,"[['Haque', 'AKM Bahalul', ''], ['Hasan', 'Md. Rifat', ''], ['Zihad', 'Md. Oahiduzzaman Mondol', '']]","['Smart Supply Chain Management', 'Blockchain', 'Smart Contract', 'IoT devices', 'Oil']"
4987,1901.01497,Usman A. Fiaz,Usman A. Fiaz and Jeff S. Shamma,usBot: A Modular Robotic Testbed for Programmable Self-Assembly,"Accepted as a conference paper at 2019 IFAC Joint MECHATRONICS and
  NOLCOS",,10.1016/j.ifacol.2019.11.661,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the design, characterization, and experimental results for a new
modular robotic system for programmable self-assembly. The proposed system uses
the Hybrid Cube Model (HCM), which integrates classical features from both
deterministic and stochastic self-organization models. Thus, for instance, the
modules are passive as far as their locomotion is concerned (stochastic), and
yet they possess an active undocking routine (deterministic). The robots are
constructed entirely from readily accessible components and unlike many
existing robots, their excitation is not fluid mediated. Instead, the actuation
setup is a solid state, independently programmable and highly portable
platform. The system is capable of demonstrating fully autonomous and
distributed stochastic self-assembly in two dimensions. It is shown to emulate
the performance of several existing modular systems and promises to be a
substantial effort towards developing a universal testbed for programmable
self-assembly.
","[{'version': 'v1', 'created': 'Sun, 6 Jan 2019 03:55:32 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Feb 2019 08:18:54 GMT'}, {'version': 'v3', 'created': 'Mon, 10 Jun 2019 06:39:54 GMT'}, {'version': 'v4', 'created': 'Sun, 16 Jun 2019 02:37:15 GMT'}, {'version': 'v5', 'created': 'Sun, 30 Jun 2019 00:37:23 GMT'}]",2019-12-24,"[['Fiaz', 'Usman A.', ''], ['Shamma', 'Jeff S.', '']]","['Robotics', 'modular robotics', 'mechanisms', 'mechatronic systems', 'multi-agent systems']"
4988,0705.3227,H. Reiju Mihara,"Masahiro Kumabe, H. Reiju Mihara","Computability of simple games: A characterization and application to the
  core","35 pages; To appear in Journal of Mathematical Economics; Appendix
  added, Propositions, Remarks, etc. are renumbered","Journal of Mathematical Economics, Volume 44, Issues 3-4, February
  2008, Pages 348-366",10.1016/j.jmateco.2007.05.012,,cs.GT cs.CC cs.LO math.LO,,"  The class of algorithmically computable simple games (i) includes the class
of games that have finite carriers and (ii) is included in the class of games
that have finite winning coalitions. This paper characterizes computable games,
strengthens the earlier result that computable games violate anonymity, and
gives examples showing that the above inclusions are strict. It also extends
Nakamura's theorem about the nonemptyness of the core and shows that computable
games have a finite Nakamura number, implying that the number of alternatives
that the players can deal with rationally is restricted.
","[{'version': 'v1', 'created': 'Tue, 22 May 2007 17:49:15 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Aug 2007 13:57:59 GMT'}]",2011-11-09,"[['Kumabe', 'Masahiro', ''], ['Mihara', 'H. Reiju', '']]","['Voting games', 'infinitely many players', 'recursion theory', 'Turing computability', 'computable manuals', 'contracts']"
4989,1811.10401,Tobias Kapp\'e,"Tobias Kapp\'e and Paul Brunet and Jurriaan Rot and Alexandra Silva
  and Jana Wagemaker and Fabio Zanasi",Kleene Algebra with Observations,,,10.4230/LIPIcs.CONCUR.2019.41,,cs.LO cs.FL,http://creativecommons.org/licenses/by/4.0/,"  Kleene algebra with tests (KAT) is an algebraic framework for reasoning about
the control flow of sequential programs. Generalising KAT to reason about
concurrent programs is not straightforward, because axioms native to KAT in
conjunction with expected axioms for concurrency lead to an anomalous equation.
In this paper, we propose Kleene algebra with observations (KAO), a variant of
KAT, as an alternative foundation for extending KAT to a concurrent setting. We
characterise the free model of KAO, and establish a decision procedure w.r.t.
its equational theory.
","[{'version': 'v1', 'created': 'Fri, 16 Nov 2018 16:56:43 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Apr 2019 08:05:27 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Jul 2019 09:50:06 GMT'}, {'version': 'v4', 'created': 'Wed, 21 Aug 2019 09:45:00 GMT'}]",2019-08-22,"[['Kappé', 'Tobias', ''], ['Brunet', 'Paul', ''], ['Rot', 'Jurriaan', ''], ['Silva', 'Alexandra', ''], ['Wagemaker', 'Jana', ''], ['Zanasi', 'Fabio', '']]","['Concurrent Kleene algebra', 'Kleene algebra with tests', 'free model', 'axiomatisation', 'decision procedure']"
4990,1403.3522,Dirk Lorenz,"Dirk A. Lorenz, Thomas Pock",An inertial forward-backward algorithm for monotone inclusions,The final publication is available at http://link.springer.com,,10.1007/s10851-014-0523-2,,cs.CV cs.NA math.NA math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose an inertial forward backward splitting algorithm to
compute a zero of the sum of two monotone operators, with one of the two
operators being co-coercive. The algorithm is inspired by the accelerated
gradient method of Nesterov, but can be applied to a much larger class of
problems including convex-concave saddle point problems and general monotone
inclusions. We prove convergence of the algorithm in a Hilbert space setting
and show that several recently proposed first-order methods can be obtained as
special cases of the general algorithm. Numerical results show that the
proposed algorithm converges faster than existing methods, while keeping the
computational cost of each iteration basically unchanged.
","[{'version': 'v1', 'created': 'Fri, 14 Mar 2014 10:30:47 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Sep 2014 10:54:45 GMT'}]",2014-09-15,"[['Lorenz', 'Dirk A.', ''], ['Pock', 'Thomas', '']]","['convex optimization', 'forward-backwardsplitting', 'monotone inclusions', 'primal-dual algorithms', 'saddle-point problems', 'image restoration']"
4991,1809.01320,Kwangsu Lee,"Jieun Eom, Dong Hoon Lee, Kwangsu Lee",Multi-Client Order-Revealing Encryption,,"IEEE Access, 2018",10.1109/ACCESS.2018.2864991,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Order-revealing encryption is a useful cryptographic primitive that provides
range queries on encrypted data since anyone can compare the order of
plaintexts by running a public comparison algorithm. Most studies on
order-revealing encryption focus only on comparing ciphertexts generated by a
single client, and there is no study on comparing ciphertexts generated by
multiple clients. In this paper, we propose the concept of multi-client
order-revealing encryption that supports comparisons not only on ciphertexts
generated by one client but also on ciphertexts generated by multiple clients.
We also define a simulation-based security model for multi-client
order-revealing encryption. The security model is defined with respect to the
leakage function which quantifies how much information is leaked from the
scheme. Next, we present two specific multi-client order-revealing encryption
schemes with different leakage functions in bilinear maps and prove their
security in the random oracle model. Finally, we give the implementation of the
proposed schemes and suggest methods to improve the performance of ciphertext
comparisons.
","[{'version': 'v1', 'created': 'Wed, 5 Sep 2018 04:51:10 GMT'}]",2018-09-06,"[['Eom', 'Jieun', ''], ['Lee', 'Dong Hoon', ''], ['Lee', 'Kwangsu', '']]","['Symmetric-key encryption', 'Order-revealing encryption', 'Multi-client order-revealing encryption', 'Bilinear maps']"
4992,1504.07834,Thomas Bosman,Thomas Bosman,"A Solution Merging Heuristic for the Steiner Problem in Graphs Using
  Tree Decompositions",,"SEA 2015, LNCS 9125, pp. 391-402, 2015",10.1007/978-3-319-20086-6_30,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fixed parameter tractable algorithms for bounded treewidth are known to exist
for a wide class of graph optimization problems. While most research in this
area has been focused on exact algorithms, it is hard to find decompositions of
treewidth sufficiently small to make these al- gorithms fast enough for
practical use. Consequently, tree decomposition based algorithms have limited
applicability to large scale optimization. However, by first reducing the input
graph so that a small width tree decomposition can be found, we can harness the
power of tree decomposi- tion based techniques in a heuristic algorithm, usable
on graphs of much larger treewidth than would be tractable to solve exactly. We
propose a solution merging heuristic to the Steiner Tree Problem that applies
this idea. Standard local search heuristics provide a natural way to generate
subgraphs with lower treewidth than the original instance, and subse- quently
we extract an improved solution by solving the instance induced by this
subgraph. As such the fixed parameter tractable algorithm be- comes an
efficient tool for our solution merging heuristic. For a large class of sparse
benchmark instances the algorithm is able to find small width tree
decompositions on the union of generated solutions. Subsequently it can often
improve on the generated solutions fast.
","[{'version': 'v1', 'created': 'Wed, 29 Apr 2015 12:41:53 GMT'}]",2016-10-05,"[['Bosman', 'Thomas', '']]","['Combinatorial Optimization', 'Steiner Tree Problem', 'TreeDecomposition']"
4993,1707.04860,Amir Bakarov,"Amir Bakarov, Olga Gureenkova","Automated Detection of Non-Relevant Posts on the Russian Imageboard
  ""2ch"": Importance of the Choice of Word Representations","6 pages, 1 figure, 1 table, main proceedings of AIST-2017 (Analysis
  of Images, Social Networks, and Texts)",,10.1007/978-3-319-73013-4_2,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study considers the problem of automated detection of non-relevant posts
on Web forums and discusses the approach of resolving this problem by
approximation it with the task of detection of semantic relatedness between the
given post and the opening post of the forum discussion thread. The
approximated task could be resolved through learning the supervised classifier
with a composed word embeddings of two posts. Considering that the success in
this task could be quite sensitive to the choice of word representations, we
propose a comparison of the performance of different word embedding models. We
train 7 models (Word2Vec, Glove, Word2Vec-f, Wang2Vec, AdaGram, FastText,
Swivel), evaluate embeddings produced by them on dataset of human judgements
and compare their performance on the task of non-relevant posts detection. To
make the comparison, we propose a dataset of semantic relatedness with posts
from one of the most popular Russian Web forums, imageboard ""2ch"", which has
challenging lexical and grammatical features.
","[{'version': 'v1', 'created': 'Sun, 16 Jul 2017 11:08:08 GMT'}]",2018-01-23,"[['Bakarov', 'Amir', ''], ['Gureenkova', 'Olga', '']]","['distributional semantics', 'compositional semantics', '2ch', 'imageboard', 'semantic relatedness', 'word similarity', 'word embeddings']"
4994,1311.3837,Dalila Hamami,Dalila Hamami and Baghdad Atmani,SBML for optimizing decision support's tools,,Aircc.Proc. 3.8 (2013) 109-119,10.5121/csit.2013.3810,,cs.CE,http://creativecommons.org/licenses/by/3.0/,"  Many theoretical works and tools on epidemiological field reflect the
emphasis on decision-making Tools by both public health and the scientific
community, which continues to increase. Indeed, in the epidemiological field,
modeling tools are proving a very important way in helping to make decision.
However, the variety, the large volume of data and the nature of epidemics lead
us to seek solutions to alleviate the heavy burden imposed on both experts and
developers. In this paper, we present a new approach: the passage of an
epidemic model realized in Bio-PEPA to a narrative language using the basics of
SBML language. Our goal is to allow on one hand, epidemiologists to verify and
validate the model, and the other hand, developers to optimize the model in
order to achieve a better model of decision making. We also present some
preliminary results and some suggestions to improve the simulated model.
","[{'version': 'v1', 'created': 'Fri, 15 Nov 2013 12:58:28 GMT'}]",2013-11-18,"[['Hamami', 'Dalila', ''], ['Atmani', 'Baghdad', '']]","['Epidemiology', 'simulation', 'modelling', 'Bio-PEPA', 'narrative language', 'SBML']"
4995,1608.06440,Ahmad Masoud Dr,"Rachana Ashok Gupta, Ahmad A. Masoud, Mo-Yuen Chow","A Delay-Tolerant Potential-Field-Based Network Implementation of an
  Integrated Navigation System",,"The IEEE Transactions On Industrial Electronics, Vol. 57, No.2,
  February 2010, PP. 769-783",10.1109/TIE.2009.2026764,,cs.RO cs.CV cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network controllers (NCs) are devices that are capable of converting dynamic,
spatially extended, and functionally specialized modules into a taskable
goal-oriented group called networked control system. This paper examines the
practical aspects of designing and building an NC that uses the Internet as a
communication medium. It focuses on finding compatible controller components
that can be integrated via a host structure in a manner that makes it possible
to network, in real-time, a webcam, an unmanned ground vehicle (UGV), and a
remote computer server along with the necessary operator software interface.
The aim is to deskill the UGV navigation process and yet maintain a robust
performance. The structure of the suggested controller, its components, and the
manner in which they are interfaced are described. Thorough experimental
results along with performance assessment and comparisons to a previously
implemented NC are provided.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2016 09:49:10 GMT'}]",2016-08-24,"[['Gupta', 'Rachana Ashok', ''], ['Masoud', 'Ahmad A.', ''], ['Chow', 'Mo-Yuen', '']]","['Network based integrated navigation system', 'Harmonic potentialfield (HPF)', 'Intelligent Space']"
4996,1207.3370,Alejandro Frery,"Talita Perciano, Matthew Urban, Nelson D. A. Mascarenhas, Mostafa
  Fatemi, Alejandro C. Frery, Glauber T. Silva","Deconvolution of vibroacoustic images using a simulation model based on
  a three dimensional point spread function",Accepted for publication in Ultrasonics,,10.1016/j.ultras.2012.03.011,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vibro-acoustography (VA) is a medical imaging method based on the
difference-frequency generation produced by the mixture of two focused
ultrasound beams. VA has been applied to different problems in medical imaging
such as imaging bones, microcalcifications in the breast, mass lesions, and
calcified arteries. The obtained images may have a resolution of 0.7--0.8 mm.
Current VA systems based on confocal or linear array transducers generate
C-scan images at the beam focal plane. Images on the axial plane are also
possible, however the system resolution along depth worsens when compared to
the lateral one. Typical axial resolution is about 1.0 cm. Furthermore, the
elevation resolution of linear array systems is larger than that in lateral
direction. This asymmetry degrades C-scan images obtained using linear arrays.
The purpose of this article is to study VA image restoration based on a 3D
point spread function (PSF) using classical deconvolution algorithms: Wiener,
constrained least-squares (CLSs), and geometric mean filters. To assess the
filters' performance, we use an image quality index that accounts for
correlation loss, luminance and contrast distortion. Results for simulated VA
images show that the quality index achieved with the Wiener filter is 0.9 (1
indicates perfect restoration). This filter yielded the best result in
comparison with the other ones. Moreover, the deconvolution algorithms were
applied to an experimental VA image of a phantom composed of three stretched
0.5 mm wires. Experiments were performed using transducer driven at two
frequencies, 3075 kHz and 3125 kHz, which resulted in the difference-frequency
of 50 kHz. Restorations with the theoretical line spread function (LSF) did not
recover sufficient information to identify the wires in the images. However,
using an estimated LSF the obtained results displayed enough information to
spot the wires in the images.
","[{'version': 'v1', 'created': 'Fri, 13 Jul 2012 21:37:04 GMT'}]",2012-07-17,"[['Perciano', 'Talita', ''], ['Urban', 'Matthew', ''], ['Mascarenhas', 'Nelson D. A.', ''], ['Fatemi', 'Mostafa', ''], ['Frery', 'Alejandro C.', ''], ['Silva', 'Glauber T.', '']]","['Vibro-Acoustography', 'Image Restoration', 'Complex Images']"
4997,1411.1945,Suzana Sampaio PhD Candidate,"S.C.B. Sampaio, M. L. M. Marinho, and H. P. Moura",Systematic Review on Project Actuality,"13 pages in International Journal of Computer Science & Information
  Technology Vol 6 No 5 October 2014",,10.5121/ijcsit.2014.6504,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays much is written about how to manage projects, but too little on what
really happens in project actuality. Project Actuality came out in the
Rethinking Project Management (RPM) agenda in 2006 and it aims at understanding
what really happens at project context. To be able to understand project
actuality phenomenon, we first need to get a better comprehension on its
definition and discover how to observe it and analyse it. This paper presents
the results of the systematic review conducted to collect evidence on Project
Actuality. The research focused on four search engines, in publications from
1994 to 2013. Among others, the study concludes that project actuality has been
analysed by several methods and techniques, mostly on large organization and
public sectors, in Northern Europe. The most common definitions, techniques,
and tips were identified as well as the intent of transforming the results in
knowledge.
","[{'version': 'v1', 'created': 'Fri, 7 Nov 2014 15:18:16 GMT'}]",2014-11-10,"[['Sampaio', 'S. C. B.', ''], ['Marinho', 'M. L. M.', ''], ['Moura', 'H. P.', '']]","['Project Actuality', 'Actuality of projects', 'Project Management', 'Systematic Review.   1']"
4998,1802.08547,Chengyu Zhang,"Chengyu Zhang, Yichen Yan, Hanru Zhou, Yinbo Yao, Ke Wu, Ting Su,
  Weikai Miao, Geguang Pu","SmartUnit: Empirical Evaluations for Automated Unit Testing of Embedded
  Software in Industry","In Proceedings of 40th International Conference on Software
  Engineering: Software Engineering in Practice Track, Gothenburg, Sweden, May
  27-June 3, 2018 (ICSE-SEIP '18), 10 pages",,10.1145/3183519.3183554,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we aim at the automated unit coverage-based testing for
embedded software. To achieve the goal, by analyzing the industrial
requirements and our previous work on automated unit testing tool CAUT, we
rebuild a new tool, SmartUnit, to solve the engineering requirements that take
place in our partner companies. SmartUnit is a dynamic symbolic execution
implementation, which supports statement, branch, boundary value and MC/DC
coverage. SmartUnit has been used to test more than one million lines of code
in real projects. For confidentiality motives, we select three in-house real
projects for the empirical evaluations. We also carry out our evaluations on
two open source database projects, SQLite and PostgreSQL, to test the
scalability of our tool since the scale of the embedded software project is
mostly not large, 5K-50K lines of code on average. From our experimental
results, in general, more than 90% of functions in commercial embedded software
achieve 100% statement, branch, MC/DC coverage, more than 80% of functions in
SQLite achieve 100% MC/DC coverage, and more than 60% of functions in
PostgreSQL achieve 100% MC/DC coverage. Moreover, SmartUnit is able to find the
runtime exceptions at the unit testing level. We also have reported exceptions
like array index out of bounds and divided-by-zero in SQLite. Furthermore, we
analyze the reasons of low coverage in automated unit testing in our setting
and give a survey on the situation of manual unit testing with respect to
automated unit testing in industry.
","[{'version': 'v1', 'created': 'Fri, 23 Feb 2018 14:33:04 GMT'}, {'version': 'v2', 'created': 'Sun, 17 Jun 2018 06:02:29 GMT'}]",2018-06-19,"[['Zhang', 'Chengyu', ''], ['Yan', 'Yichen', ''], ['Zhou', 'Hanru', ''], ['Yao', 'Yinbo', ''], ['Wu', 'Ke', ''], ['Su', 'Ting', ''], ['Miao', 'Weikai', ''], ['Pu', 'Geguang', '']]","['Dynamic Symbolic Execution', 'Automated Unit Testing', 'EmbeddedSystem']"
4999,1908.04070,Marko Robnik-\v{S}ikonja,"Damjan Vavpoti\v{c}, Marko Robnik-\v{S}ikonja, Toma\v{z} Hovelja","Exploring the relations between net benefits of IT projects and CIOs'
  perception of quality of software development disciplines",,"Business & Information Systems Engineering, 2019",10.1007/s12599-019-00612-4,,cs.SE cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software development enterprises are under consistent pressure to improve
their management techniques and development processes. These are comprised of
several disciplines like requirements acquisition, design, coding, testing,
etc. that must be continuously improved and individually tailored to suit
specific software development project. This paper presents an evaluation
approach that enables the enterprises to increase development process net
benefits by improving disciplines' quality and increasing developers'
satisfaction. Our approach builds on Kano's model of quality. Based on an
empirical study of top 1000 enterprises from Slovenia we find that application
of software development methodologies in individual development disciplines
significantly relates to net benefits of IT projects. The results show that
different types of Kano quality are present in individual disciplines.
Enterprises should be cautious when altering must-be quality disciplines like
testing or deployment as they can significantly disrupt the established
routines, cause great dissatisfaction between developers and significantly
reduce benefits. On the other hand, changing the attractive quality disciplines
like requirements acquisition can notably increase developers' satisfaction and
benefits but is less likely to disrupt the established routines.
","[{'version': 'v1', 'created': 'Mon, 12 Aug 2019 09:52:40 GMT'}]",2019-08-13,"[['Vavpotič', 'Damjan', ''], ['Robnik-Šikonja', 'Marko', ''], ['Hovelja', 'Tomaž', '']]","['IT project management', 'software development process', 'Kano model', 'net benefits', 'attribute evaluation', 'OrdEval algorithm']"
5000,1811.11425,Leon Abdillah,Leon Andretti Abdillah,Green Computer Science Millennial Students Examination,"The Third International Conference on Islamic Education, Information
  Technology and Media (ICIED2018), Universitas Islam Negeri (UIN) Maulana
  Malik Ibrahim, Malang",,10.4108/eai.2-10-2018.2295467,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smartphones as one of information technology products have been affected
higher education in various aspects. This article explains the useness of
smartphones in facilitating online examination in information systems and
computer science students. The research objective to be achieved by the
researchers through the research, are as follows: 1) Utilizing smartphone as a
media test online exam for green computing environment, 2) How to use social
information technologies in online test, and 3) Explore the facilities or
features that could be used for the online exam implementation. The observation
was conducted with 100 students as respondents. Researcher used google forms to
disseminate questions for online examination. The findings of the research
showed that most the college students used Android OS for their online
examination. Social technology like google forms has rich features in
supporting online examination for computer science students. The use of
smartphones, google forms, and facebook can create an atmosphere of modern,
green computer science exams, efficient, and environmentally friendly.
","[{'version': 'v1', 'created': 'Wed, 28 Nov 2018 07:50:58 GMT'}]",2020-12-16,"[['Abdillah', 'Leon Andretti', '']]","['IT-based education', 'millennial students', 'mobile']"
5001,0707.0463,Yuanning Yu,"Yuanning Yu, Athina P. Petropulu, H. Vincent Poor and Visa Koivunen",Blind Estimation of Multiple Carrier Frequency Offsets,"To appear in the Proceedings of the 18th Annual IEEE International
  Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC),
  Athens, Greece, September 3-7, 2007",,10.1109/PIMRC.2007.4394103,,cs.IT math.IT,,"  Multiple carrier-frequency offsets (CFO) arise in a distributed antenna
system, where data are transmitted simultaneously from multiple antennas. In
such systems the received signal contains multiple CFOs due to mismatch between
the local oscillators of transmitters and receiver. This results in a
time-varying rotation of the data constellation, which needs to be compensated
for at the receiver before symbol recovery. This paper proposes a new approach
for blind CFO estimation and symbol recovery. The received base-band signal is
over-sampled, and its polyphase components are used to formulate a virtual
Multiple-Input Multiple-Output (MIMO) problem. By applying blind MIMO system
estimation techniques, the system response is estimated and used to
subsequently transform the multiple CFOs estimation problem into many
independent single CFO estimation problems. Furthermore, an initial estimate of
the CFO is obtained from the phase of the MIMO system response. The Cramer-Rao
Lower bound is also derived, and the large sample performance of the proposed
estimator is compared to the bound.
","[{'version': 'v1', 'created': 'Tue, 3 Jul 2007 16:58:43 GMT'}]",2016-11-18,"[['Yu', 'Yuanning', ''], ['Petropulu', 'Athina P.', ''], ['Poor', 'H. Vincent', ''], ['Koivunen', 'Visa', '']]","['Multi-user Systems', 'Distributed Antenna Systems', 'Carrier Frequency Offset', 'Blind MIMO System Identification']"
5002,1907.12377,Jun Zhao,"Jun Zhao, Zhou Zhou, Ziyu Guan, Wei Zhao, Wei Ning, Guang Qiu, Xiaofei
  He","IntentGC: a Scalable Graph Convolution Framework Fusing Heterogeneous
  Information for Recommendation",KDD2019,,10.1145/3292500.3330686,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The remarkable progress of network embedding has led to state-of-the-art
algorithms in recommendation. However, the sparsity of user-item interactions
(i.e., explicit preferences) on websites remains a big challenge for predicting
users' behaviors. Although research efforts have been made in utilizing some
auxiliary information (e.g., social relations between users) to solve the
problem, the existing rich heterogeneous auxiliary relationships are still not
fully exploited. Moreover, previous works relied on linearly combined
regularizers and suffered parameter tuning.
  In this work, we collect abundant relationships from common user behaviors
and item information, and propose a novel framework named IntentGC to leverage
both explicit preferences and heterogeneous relationships by graph
convolutional networks. In addition to the capability of modeling
heterogeneity, IntentGC can learn the importance of different relationships
automatically by the neural model in a nonlinear sense. To apply IntentGC to
web-scale applications, we design a faster graph convolutional model named
IntentNet by avoiding unnecessary feature interactions. Empirical experiments
on two large-scale real-world datasets and online A/B tests in Alibaba
demonstrate the superiority of our method over state-of-the-art algorithms.
","[{'version': 'v1', 'created': 'Wed, 24 Jul 2019 09:09:45 GMT'}]",2019-07-30,"[['Zhao', 'Jun', ''], ['Zhou', 'Zhou', ''], ['Guan', 'Ziyu', ''], ['Zhao', 'Wei', ''], ['Ning', 'Wei', ''], ['Qiu', 'Guang', ''], ['He', 'Xiaofei', '']]","['Graph Convolutional Networks', 'Recommendation', 'HeterogeneousInformation Network']"
5003,1711.01327,Sarah Cannon,"Sarah Cannon, Joshua J. Daymude, William Savoie, Ross Warkentin,
  Shengkai Li, Daniel I. Goldman, Dana Randall, Andrea W. Richa",Phototactic Supersmarticles,,Artificial Life and Robotics 23:4 (2018) 459-468,10.1007/s10015-018-0473-7,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smarticles, or smart active particles, are small robots equipped with only
basic movement and sensing abilities that are incapable of rotating or
displacing individually. We study the ensemble behavior of smarticles, i.e.,
the behavior a collective of these very simple computational elements can
achieve, and how such behavior can be implemented using minimal programming. We
show that an ensemble of smarticles constrained to remain close to one another
(which we call a supersmarticle), achieves directed locomotion toward or away
from a light source, a phenomenon known as phototaxing. We present experimental
and theoretical models of phototactic supersmarticles that collectively move
with a directed displacement in response to light. The motion of the
supersmarticle is approximately Brownian, and is a result of chaotic
interactions among smarticles. The system can be directed by introducing
asymmetries among the individual smarticle's behavior, in our case by varying
activity levels in response to light, resulting in supersmarticle biased
motion.
","[{'version': 'v1', 'created': 'Fri, 3 Nov 2017 20:48:22 GMT'}]",2018-12-04,"[['Cannon', 'Sarah', ''], ['Daymude', 'Joshua J.', ''], ['Savoie', 'William', ''], ['Warkentin', 'Ross', ''], ['Li', 'Shengkai', ''], ['Goldman', 'Daniel I.', ''], ['Randall', 'Dana', ''], ['Richa', 'Andrea W.', '']]","['Swarm robotics', 'locomotion', 'phototaxing', 'active matter', 'programmable matter']"
5004,1812.04314,Daniele Grattarola,"Daniele Grattarola, Lorenzo Livi, Cesare Alippi",Adversarial Autoencoders with Constant-Curvature Latent Manifolds,Submitted to Applied Soft Computing,,10.1016/j.asoc.2019.105511,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Constant-curvature Riemannian manifolds (CCMs) have been shown to be ideal
embedding spaces in many application domains, as their non-Euclidean geometry
can naturally account for some relevant properties of data, like hierarchy and
circularity. In this work, we introduce the CCM adversarial autoencoder
(CCM-AAE), a probabilistic generative model trained to represent a data
distribution on a CCM. Our method works by matching the aggregated posterior of
the CCM-AAE with a probability distribution defined on a CCM, so that the
encoder implicitly learns to represent data on the CCM to fool the
discriminator network. The geometric constraint is also explicitly imposed by
jointly training the CCM-AAE to maximise the membership degree of the
embeddings to the CCM. While a few works in recent literature make use of
either hyperspherical or hyperbolic manifolds for different learning tasks,
ours is the first unified framework to seamlessly deal with CCMs of different
curvatures. We show the effectiveness of our model on three different datasets
characterised by non-trivial geometry: semi-supervised classification on MNIST,
link prediction on two popular citation datasets, and graph-based molecule
generation using the QM9 chemical database. Results show that our method
improves upon other autoencoders based on Euclidean and non-Euclidean
geometries on all tasks taken into account.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2018 10:12:24 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Apr 2019 17:22:27 GMT'}]",2019-05-27,"[['Grattarola', 'Daniele', ''], ['Livi', 'Lorenzo', ''], ['Alippi', 'Cesare', '']]","['adversarial learning', 'constant-curvature manifolds', 'imageclassification', 'link prediction', 'molecule generation']"
5005,1810.12145,Jinlu Liu,Gang Yang and Jinlu Liu and Xirong Li,Imagination Based Sample Construction for Zero-Shot Learning,Accepted as a short paper in ACM SIGIR 2018,,10.1145/3209978.3210096,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Zero-shot learning (ZSL) which aims to recognize unseen classes with no
labeled training sample, efficiently tackles the problem of missing labeled
data in image retrieval. Nowadays there are mainly two types of popular methods
for ZSL to recognize images of unseen classes: probabilistic reasoning and
feature projection. Different from these existing types of methods, we propose
a new method: sample construction to deal with the problem of ZSL. Our proposed
method, called Imagination Based Sample Construction (IBSC), innovatively
constructs image samples of target classes in feature space by mimicking human
associative cognition process. Based on an association between attribute and
feature, target samples are constructed from different parts of various
samples. Furthermore, dissimilarity representation is employed to select
high-quality constructed samples which are used as labeled data to train a
specific classifier for those unseen classes. In this way, zero-shot learning
is turned into a supervised learning problem. As far as we know, it is the
first work to construct samples for ZSL thus, our work is viewed as a baseline
for future sample construction methods. Experiments on four benchmark datasets
show the superiority of our proposed method.
","[{'version': 'v1', 'created': 'Mon, 29 Oct 2018 14:26:28 GMT'}]",2018-10-30,"[['Yang', 'Gang', ''], ['Liu', 'Jinlu', ''], ['Li', 'Xirong', '']]","['Imagination', 'Sample Construction', 'Zero-Shot Learning']"
5006,1806.09731,Jo\~ao Correia,"Tiago Martins, Jo\~ao Correia, Ernesto Costa, Penousal Machado",Evotype: Towards the Evolution of Type Stencils,EvoMUSART 2018 Best paper,,10.1007/978-3-319-77583-8_20,,cs.NE cs.AI cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Typefaces are an essential resource employed by graphic designers. The
increasing demand for innovative type design work increases the need for good
technological means to assist the designer in the creation of a typeface. We
present an evolutionary computation approach for the generation of type
stencils to draw coherent glyphs for different characters. The proposed system
employs a Genetic Algorithm to evolve populations of type stencils. The
evaluation of each candidate stencil uses a hill climbing algorithm to search
the best configurations to draw the target glyphs. We study the interplay
between legibility, coherence and expressiveness, and show how our framework
can be used in practice.
","[{'version': 'v1', 'created': 'Tue, 26 Jun 2018 00:03:23 GMT'}]",2018-06-27,"[['Martins', 'Tiago', ''], ['Correia', 'João', ''], ['Costa', 'Ernesto', ''], ['Machado', 'Penousal', '']]","['evolutionary computation', 'evolutionary design', 'automatic fitnessassignment', 'type design', 'stencil']"
5007,1304.4915,Aditya Mahajan Aditya,"Aditya Mahajan, M. S. Dahiya and H. P. Sanghvi",Forensic Analysis of Instant Messenger Applications on Android Devices,,,10.5120/11602-6965,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper focuses on conducting forensic data analysis of 2 widely used IMs
applications on Android phones WhatsApp and Viber. The tests and analysis were
performed with the aim of determining what data and information can be found on
the devices internal memory for instant messengers eg chat messaging logs and
history send & received image or video files etc. The experiments and results
show that heavy amount of potential evidences and valuable data can be found on
Android phones by forensic investigators.
","[{'version': 'v1', 'created': 'Wed, 17 Apr 2013 18:49:46 GMT'}]",2013-04-18,"[['Mahajan', 'Aditya', ''], ['Dahiya', 'M. S.', ''], ['Sanghvi', 'H. P.', '']]","['SmartPhone Forensics', 'Android Forensics', 'WhatsApp']"
5008,2106.11032,Seth Poulsen,"Seth Poulsen, Mahesh Viswanathan, Geoffrey L. Herman, Matthew West","Proof Blocks: Autogradable Scaffolding Activities for Learning to Write
  Proofs",,"Proceedings of the 27th ACM Conference on Innovation and
  Technology in Computer Science Education Vol 1 (ITiCSE 2022)",10.1145/3502718.3524774,,cs.CY cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Proof Blocks is a software tool which enables students to write proofs by
dragging and dropping prewritten proof lines into the correct order. These
proofs can be graded completely automatically, enabling students to receive
rapid feedback on how they are doing with their proofs. When constructing a
problem, the instructor specifies the dependency graph of the lines of the
proof, so that any correct arrangement of the lines can receive full credit.
This innovation can improve assessment tools by increasing the types of
questions we can ask students about proofs, and can give greater access to
proof knowledge by increasing the amount that students can learn on their own
with the help of a computer.
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2021 17:03:58 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Aug 2021 17:38:12 GMT'}, {'version': 'v3', 'created': 'Wed, 4 May 2022 19:36:46 GMT'}]",2022-05-06,"[['Poulsen', 'Seth', ''], ['Viswanathan', 'Mahesh', ''], ['Herman', 'Geoffrey L.', ''], ['West', 'Matthew', '']]","['discrete mathematics', 'CS education', 'automatic grading', 'proofs']"
5009,2205.03067,Ehsan Hamzei,"Ehsan Hamzei, Martin Tomko, Stephan Winter",Translating Place-Related Questions to GeoSPARQL Queries,,In Proceedings of the ACM Web Conference 2022 (WWW '22),10.1145/3485447.3511933,902--911,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Many place-related questions can only be answered by complex spatial
reasoning, a task poorly supported by factoid question retrieval. Such
reasoning using combinations of spatial and non-spatial criteria pertinent to
place-related questions is increasingly possible on linked data knowledge
bases. Yet, to enable question answering based on linked knowledge bases,
natural language questions must first be re-formulated as formal queries. Here,
we first present an enhanced version of YAGO2geo, the geospatially-enabled
variant of the YAGO2 knowledge base, by linking and adding more than one
million places from OpenStreetMap data to YAGO2. We then propose a novel
approach to translate the place-related questions into logical representations,
theoretically grounded in the core concepts of spatial information. Next, we
use a dynamic template-based approach to generate fully executable GeoSPARQL
queries from the logical representations. We test our approach using the
Geospatial Gold Standard dataset and report substantial improvements over
existing methods.
","[{'version': 'v1', 'created': 'Fri, 6 May 2022 08:21:04 GMT'}]",2022-05-09,"[['Hamzei', 'Ehsan', ''], ['Tomko', 'Martin', ''], ['Winter', 'Stephan', '']]","['geographic question answering', 'place-based search', 'query generation', 'geospatial knowledge bases']"
5010,1603.01786,Sid Chi-Kin Chau,"Majid Khonji, Areg Karapetyan, Khaled Elbassioni and Sid Chi-Kin Chau",Complex-demand Scheduling Problem with Application in Smart Grid,"This paper appears in Theoretical Computer Science. A preliminary
  version appeared in the 22nd International Conference on Computing and
  Combinatorics, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016","Theoretical Computer Science, Volume 761, 21 February 2019, Pages
  34-50",10.1016/j.tcs.2018.08.023,,cs.DS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of scheduling complex-valued demands over a
discretized time horizon. Given a set of users, each user is associated with a
set of demands representing different power consumption preferences. A demand
is represented by a complex number, a time interval, and a utility value
obtained if it is satisfied. At each time slot, the magnitude of the total
selected demands should not exceed a given generation capacity. This naturally
captures the supply constraints in alternating current (AC) electric systems.
In this paper, we consider maximizing the aggregate user utility subject to
power supply limits over a time horizon. We present approximation algorithms
characterized by the maximum angle $\phi$ between any two complex-valued
demands. More precisely, a PTAS is presented for the case $\phi \in
[0,\tfrac{\pi}{2}]$, a bi-criteria FPTAS for $\phi \in [0,{\pi} \mbox{-}
\varepsilon]$ for any polynomially small $\varepsilon$, assuming the number of
time slots in the discretized time horizon is a constant. Furthermore, if the
number of time slots is part of the input, we present a reduction to the
real-valued unsplittable flow problem on a path with only a constant
approximation ratio. Finally, we present a practical greedy algorithm for the
single time slot case with an approximation ratio of $\tfrac{1}{2}\cos
\frac{\phi}{2}$ and a running time complexity of only ${O}(N\log N)$, $N$
standing for the aggregate number of user demands, which can be implemented
efficiently in practice.
","[{'version': 'v1', 'created': 'Sun, 6 Mar 2016 03:56:22 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Nov 2016 13:21:58 GMT'}, {'version': 'v3', 'created': 'Wed, 10 Oct 2018 02:46:27 GMT'}]",2019-03-06,"[['Khonji', 'Majid', ''], ['Karapetyan', 'Areg', ''], ['Elbassioni', 'Khaled', ''], ['Chau', 'Sid Chi-Kin', '']]","['Algorithms', 'Scheduling', 'Smart Grid', 'Unsplittable Flow', 'Knapsack']"
5011,1309.1542,Oluwagbenga Ogunduyile O,"O. O. Ogunduyile, K. Zuva, O. A. Randle, T. Zuva","Ubiquitous healthcare monitoring system using integrated triaxial
  accelerometer,spo2 and location sensors","13 pages, 6 figures, International Journal of UbiComp (IJU), Vol.4,
  No.2","International Journal of UbiComp (IJU), Vol.4, No.2,April 2013",10.5121/iju.2013.4201,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ubiquitous healthcare has become one of the prominent areas of research
inorder to address the challenges encountered in healthcare environment. In
contribution to this area, this study developed a system prototype that
recommends diagonostic services based on physiological data collected in real
time from a distant patient. The prototype uses WBAN body sensors to be worn by
the individual and an android smart phone as a personal server. Physiological
data is collected and uploaded to a Medical Health Server (MHS) via
GPRS/internet to be analysed. Our implemented prototype monitors the activity,
location and physiological data such as SpO2 and Heart Rate (HR) of the elderly
and patients in rehabilitation. The uploaded information can be accessed in
real time by medical practitioners through a web application.
","[{'version': 'v1', 'created': 'Fri, 6 Sep 2013 06:03:12 GMT'}]",2014-04-02,"[['Ogunduyile', 'O. O.', ''], ['Zuva', 'K.', ''], ['Randle', 'O. A.', ''], ['Zuva', 'T.', '']]","['Android smart phone', 'Ubiquitous Healthcare', 'Web application server', 'Wireless Body Area Networks']"
5012,1309.5944,John Tengviel,"John Tengviel, Koffi A. Dotche, K. Diawuo","The impact of mobile nodes arrival patterns in mobile ad hoc networks
  using poisson models","17 pages, 9 pages. arXiv admin note: substantial text overlap with
  arXiv:1309.5725","International Journal of Managing Information Technology (IJMIT)
  Vol.4, No.3, August 2012",10.5121/ijmit.2012.4305,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile Ad hoc Networks (MANETs) are dynamic networks populated by mobile
stations, or mobile nodes (MNs). Specifically, MANETs consist of a collection
of nodes randomly placed in a line (not necessarily straight). Mobile Ad hoc
Networks do appear in many real-world network applications such as a vehicular
Mobile Ad hoc Networks built along a highway in a city environment or people in
a particular location. Mobile Nodes in Mobile Ad hoc Networks are usually
laptops, Personal Digital Assistants or mobile phones. These devices may use
Blue-tooth and/or IEEE 802.11 network interfaces and communicate in a
decentralized manner. Mobility is a key feature of Mobile Ad hoc Networks. Each
node may work as a router and the network can dynamically change with time;
when new nodes can join, and other nodes can leave the network. This paper
presents comparative results that have been carried out via Matrix lab software
simulation. The study investigates the impact of mobile nodes parameters such
as the speed, the arrival rate and the size of mobile nodes in a given area
using Poisson distribution. The results have indicated that mobile nodes
arrival rates may have influence on Mobile Nodes population (as a larger
number) in a location.
","[{'version': 'v1', 'created': 'Mon, 23 Sep 2013 08:38:48 GMT'}]",2013-09-25,"[['Tengviel', 'John', ''], ['Dotche', 'Koffi A.', ''], ['Diawuo', 'K.', '']]","['MANETs', 'Mobility models', 'Mobile nodes distribution', 'Arrival Patterns', 'Poisson distribution']"
5013,1707.03199,Seema Hegde B,"Seema B Hegde, B.Sathish babu, Pallapa Venkatram","A Cognitive Theory-based Opportunistic Resource-Pooling Scheme for Ad
  hoc Networks","22 pages, 16 figures,",Journal of Intelligent Systems 2017 Volume 26 issuse 1 pp 47-68,10.1515/jisys-2015-0050,,cs.NI cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Resource pooling in ad hoc networks deals with accumulating computing and
network resources to implement network control schemes such as routing,
congestion, traffic management, and so on. Pooling of resources can be
accomplished using the distributed and dynamic nature of ad hoc networks to
achieve collaboration between the devices. Ad hoc networks need a
resource-pooling technique that offers quick response, adaptability, and
reliability. In this context, we are proposing an opportunistic resource
pooling scheme that uses a cognitive computing model to accumulate the
resources with faster resource convergence rate, reliability, and lower
latency. The proposed scheme is implemented using the behaviors observations
beliefs cognitive model, in which the resource pooling decisions are made based
on accumulated knowledge over various behaviors exhibited by nodes in ad hoc
networks.
","[{'version': 'v1', 'created': 'Tue, 11 Jul 2017 09:47:26 GMT'}]",2017-07-12,"[['Hegde', 'Seema B', ''], ['babu', 'B. Sathish', ''], ['Venkatram', 'Pallapa', '']]","['Mobile ad hoc networks (MANETs)', 'resource pooling', 'opportunistic computing', 'cognitive agents', 'belief']"
5014,1610.08206,Binbin Pang,"Shixin Zhu, Binbin Pang, Zhonghua Sun",The reversible negacyclic codes over finite fields,,"J Syst Sci Complex 31, 1065-1077 (2018)",10.1007/s11424-017-6301-7,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, by investigating the factor of the $x^n+1$, we deduce that the
structure of the reversible negacyclic code over the finite field
$\mathbb{F}_{q}$, where $q$ is an odd prime power. Though studying
$q-$cyclotomic cosets modulo $2n$, we obtain the parameters of negacyclic BCH
code of length $n=\frac{q^\ell+1}{2}$ , $n=\frac{q^m-1}{2(q-1)}$ and
$n=\frac{q^{t\cdot2^\tau}-1}{2(q^t+1)}$. Some optimal linear codes from
negacyclic codes are given. Finally, we discuss a class of MDS LCD negacyclic
codes.
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2016 07:04:52 GMT'}]",2021-01-21,"[['Zhu', 'Shixin', ''], ['Pang', 'Binbin', ''], ['Sun', 'Zhonghua', '']]","['Negacyclic codes', 'Reversible code', 'Negacyclic BCH codes', 'MDS code']"
5015,1811.01807,Ciriaco Andrea D'Angelo,"Giovanni Abramo, Ciriaco Andrea D'Angelo, Marco Solazzi","National research assessment exercises: a measure of the distortion of
  performance rankings when labor input is treated as uniform",,"Scientometrics, 84(3), 605-619 (2010)",10.1007/s11192-010-0164-1,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Measuring the efficiency of scientific research activity presents critical
methodological aspects, many of which have not been sufficiently studied.
Although many studies have assessed the relation between quality and research
productivity and academic rank, not much is known about the extent of
distortion in national university performance rankings when academic rank and
the other labor factors are not considered as a factor of normalization. This
work presents a comparative analysis that aims to quantify the sensitivity of
bibliometric rankings to the choice of input, with input considered as only the
number of researchers on staff, or alternatively where their cost is also
considered. The field of observation consists of all 69 Italian universities
active in the hard sciences. Performance measures are based on the 81,000
publications produced during the 2004-2006 triennium by all 34,000 research
staff, with analysis carried out at the level of individual disciplines, 187 in
total. The effect of the switch from labor to cost seems to be minimal except
for a few outliers.
","[{'version': 'v1', 'created': 'Mon, 5 Nov 2018 15:47:48 GMT'}]",2018-11-06,"[['Abramo', 'Giovanni', ''], [""D'Angelo"", 'Ciriaco Andrea', ''], ['Solazzi', 'Marco', '']]","['Research productivity', 'university ranking', 'bibliometrics', 'cost efficiency']"
5016,1501.05970,Ju Shen Dr.,"Jianjun Yang, Yin Wang, Honggang Wang, Kun Hua, Wei Wang, Ju Shen",Automatic Objects Removal for Scene Completion,"6 pages, IEEE International Conference on Computer Communications
  (INFOCOM 14), Workshop on Security and Privacy in Big Data, Toronto, Canada,
  2014",,10.1109/INFCOMW.2014.6849291,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the explosive growth of web-based cameras and mobile devices, billions
of photographs are uploaded to the internet. We can trivially collect a huge
number of photo streams for various goals, such as 3D scene reconstruction and
other big data applications. However, this is not an easy task due to the fact
the retrieved photos are neither aligned nor calibrated. Furthermore, with the
occlusion of unexpected foreground objects like people, vehicles, it is even
more challenging to find feature correspondences and reconstruct realistic
scenes. In this paper, we propose a structure based image completion algorithm
for object removal that produces visually plausible content with consistent
structure and scene texture. We use an edge matching technique to infer the
potential structure of the unknown region. Driven by the estimated structure,
texture synthesis is performed automatically along the estimated curves. We
evaluate the proposed method on different types of images: from highly
structured indoor environment to the natural scenes. Our experimental results
demonstrate satisfactory performance that can be potentially used for
subsequent big data processing: 3D scene reconstruction and location
recognition.
","[{'version': 'v1', 'created': 'Fri, 23 Jan 2015 21:46:41 GMT'}]",2016-11-18,"[['Yang', 'Jianjun', ''], ['Wang', 'Yin', ''], ['Wang', 'Honggang', ''], ['Hua', 'Kun', ''], ['Wang', 'Wei', ''], ['Shen', 'Ju', '']]","['Image Completion', 'Texture Synthesis', 'Online Photos', 'Scene Reconstruction', 'Object Removal']"
5017,1201.2399,Vinaye Armoogum VA,"Sheeba Armoogum, Vinaye Armoogum and Jayprakash Gopaul","The Development of a LAN for DVB-T Transmission and DVB-S Reception with
  Designed QAM Modulators and COFDM in the Island Mauritius","20 pages, IJWMN journal paper; ISSN:0975-3834 (Online); 0975-4679
  (Print)","International Journal of Wireless & Mobile Networks (IJWMN) Vol.
  3, No. 6, December 2011, 71-90",10.5121/ijwmn.2011.3606,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is a thorough study of a digital broadcasting system adapted to
the small mountainous island of Mauritius. A digital LAN was designed with
MPEG-2 signals. The compressed signals were transmitted using DVB-T and QAM
modulators. QAM-16 and QAM-64 modulators were designed and tested with a
simulator under critical conditions of AWGN and phase noises. Results obtained
from simulation have shown that Digital video broadcast with a single frequency
network (SFN) is possible in Mauritius with QAM-64 and QAM-16 modulators
applying COFDM mode of transmission. However, this study has also shown that
QAM-16 modulator had a better performance at low AWGN values (less than 12 dB)
and can be adopted for Mauritius Island, provided that the number of
transmitted channels is not high enough.
","[{'version': 'v1', 'created': 'Wed, 11 Jan 2012 20:38:47 GMT'}]",2012-01-12,"[['Armoogum', 'Sheeba', ''], ['Armoogum', 'Vinaye', ''], ['Gopaul', 'Jayprakash', '']]","['COFDM', 'Digital Television Broadcasting System', 'DVB-S', 'DVB-T', 'QAM']"
5018,1711.03589,Dmitry Kulyabov PhD,"M. N. Gevorkyan, A. V. Demidova, Robert A. Sobolewski, I. S. Zaryadov,
  A. V. Korolkova, D. S. Kulyabov and L. A. Sevastianov",Approaches to Stochastic Modeling of Wind Turbines,in English; in Russian,,10.7148/2017-0622,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background. This paper study statistical data gathered from wind turbines
located on the territory of the Republic of Poland. The research is aimed to
construct the stochastic model that predicts the change of wind speed with
time. Purpose. The purpose of this work is to find the optimal distribution for
the approximation of available statistical data on wind speed. Methods. We
consider four distributions of a random variable: Log-Normal, Weibull, Gamma
and Beta. In order to evaluate the parameters of distributions we use method of
maximum likelihood. To assess the the results of approximation we use a
quantile-quantile plot. Results. All the considered distributions properly
approximate the available data. The Weibull distribution shows the best results
for the extreme values of the wind speed. Conclusions. The results of the
analysis are consistent with the common practice of using the Weibull
distribution for wind speed modeling. In the future we plan to compare the
results obtained with a much larger data set as well as to build a stochastic
model of the evolution of the wind speed depending on time.
","[{'version': 'v1', 'created': 'Wed, 8 Nov 2017 06:38:50 GMT'}]",2017-11-15,"[['Gevorkyan', 'M. N.', ''], ['Demidova', 'A. V.', ''], ['Sobolewski', 'Robert A.', ''], ['Zaryadov', 'I. S.', ''], ['Korolkova', 'A. V.', ''], ['Kulyabov', 'D. S.', ''], ['Sevastianov', 'L. A.', '']]","['approximation', 'Weibull distribution', 'lognormal distribution', 'gamma distribution', 'beta distribution', 'wind speed', 'statistics']"
5019,1902.08810,Hadi Zare,"Soheila Molaei, Hadi Zare, Hadi Veisi","Deep Learning Approach on Information Diffusion in Heterogeneous
  Networks",,,10.1016/j.knosys.2019.105153,,cs.SI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are many real-world knowledge based networked systems with multi-type
interacting entities that can be regarded as heterogeneous networks including
human connections and biological evolutions. One of the main issues in such
networks is to predict information diffusion such as shape, growth and size of
social events and evolutions in the future. While there exist a variety of
works on this topic mainly using a threshold-based approach, they suffer from
the local viewpoint on the network and sensitivity to the threshold parameters.
In this paper, information diffusion is considered through a latent
representation learning of the heterogeneous networks to encode in a deep
learning model. To this end, we propose a novel meta-path representation
learning approach, Heterogeneous Deep Diffusion(HDD), to exploit meta-paths as
main entities in networks. At first, the functional heterogeneous structures of
the network are learned by a continuous latent representation through
traversing meta-paths with the aim of global end-to-end viewpoint. Then, the
well-known deep learning architectures are employed on our generated features
to predict diffusion processes in the network. The proposed approach enables us
to apply it on different information diffusion tasks such as topic diffusion
and cascade prediction. We demonstrate the proposed approach on benchmark
network datasets through the well-known evaluation measures. The experimental
results show that our approach outperforms the earlier state-of-the-art
methods.
","[{'version': 'v1', 'created': 'Sat, 23 Feb 2019 16:31:04 GMT'}, {'version': 'v2', 'created': 'Sat, 2 Nov 2019 13:28:20 GMT'}]",2019-11-05,"[['Molaei', 'Soheila', ''], ['Zare', 'Hadi', ''], ['Veisi', 'Hadi', '']]","['Heterogeneous Networks', 'Information Diffusion', 'TopicDiffusion', 'Cascade Prediction', 'Network Representation Learning', 'DeepLearning']"
5020,2102.02915,Julian Ibarz,"Julian Ibarz and Jie Tan and Chelsea Finn and Mrinal Kalakrishnan and
  Peter Pastor and Sergey Levine","How to Train Your Robot with Deep Reinforcement Learning; Lessons We've
  Learned",,"Journal of Robotics Research (IJRR), February 2021",10.1177/0278364920987859,,cs.RO cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep reinforcement learning (RL) has emerged as a promising approach for
autonomously acquiring complex behaviors from low level sensor observations.
Although a large portion of deep RL research has focused on applications in
video games and simulated control, which does not connect with the constraints
of learning in real environments, deep RL has also demonstrated promise in
enabling physical robots to learn complex skills in the real world. At the same
time,real world robotics provides an appealing domain for evaluating such
algorithms, as it connects directly to how humans learn; as an embodied agent
in the real world. Learning to perceive and move in the real world presents
numerous challenges, some of which are easier to address than others, and some
of which are often not considered in RL research that focuses only on simulated
domains. In this review article, we present a number of case studies involving
robotic deep RL. Building off of these case studies, we discuss commonly
perceived challenges in deep RL and how they have been addressed in these
works. We also provide an overview of other outstanding challenges, many of
which are unique to the real-world robotics setting and are not often the focus
of mainstream RL research. Our goal is to provide a resource both for
roboticists and machine learning researchers who are interested in furthering
the progress of deep RL in the real world.
","[{'version': 'v1', 'created': 'Thu, 4 Feb 2021 22:09:28 GMT'}]",2021-02-08,"[['Ibarz', 'Julian', ''], ['Tan', 'Jie', ''], ['Finn', 'Chelsea', ''], ['Kalakrishnan', 'Mrinal', ''], ['Pastor', 'Peter', ''], ['Levine', 'Sergey', '']]","['Robotics', 'reinforcement learning', 'deep learning']"
5021,0910.1974,Rajkumar Buyya,"Rajkumar Buyya, Suraj Pandey, and Christian Vecchiola",Cloudbus Toolkit for Market-Oriented Cloud Computing,"21 pages, 6 figures, 2 tables, Conference paper","Proceeding of the 1st International Conference on Cloud Computing
  (CloudCom 2009, Springer, Germany), Beijing, China, December 1-4, 2009",10.1007/978-3-642-10665-1_4,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This keynote paper: (1) presents the 21st century vision of computing and
identifies various IT paradigms promising to deliver computing as a utility;
(2) defines the architecture for creating market-oriented Clouds and computing
atmosphere by leveraging technologies such as virtual machines; (3) provides
thoughts on market-based resource management strategies that encompass both
customer-driven service management and computational risk management to sustain
SLA-oriented resource allocation; (4) presents the work carried out as part of
our new Cloud Computing initiative, called Cloudbus: (i) Aneka, a Platform as a
Service software system containing SDK (Software Development Kit) for
construction of Cloud applications and deployment on private or public Clouds,
in addition to supporting market-oriented resource management; (ii)
internetworking of Clouds for dynamic creation of federated computing
environments for scaling of elastic applications; (iii) creation of 3rd party
Cloud brokering services for building content delivery networks and e-Science
applications and their deployment on capabilities of IaaS providers such as
Amazon along with Grid mashups; (iv) CloudSim supporting modelling and
simulation of Clouds for performance studies; (v) Energy Efficient Resource
Allocation Mechanisms and Techniques for creation and management of Green
Clouds; and (vi) pathways for future research.
","[{'version': 'v1', 'created': 'Sun, 11 Oct 2009 06:26:29 GMT'}]",2015-05-14,"[['Buyya', 'Rajkumar', ''], ['Pandey', 'Suraj', ''], ['Vecchiola', 'Christian', '']]","['Cloud Computing', 'Cloudbus', 'Virtualization', 'Utility Computing']"
5022,1810.09801,Fernando Alonso-Fernandez,"Ram P. Krish, Julian Fierrez, Daniel Ramos, Fernando Alonso-Fernandez,
  Josef Bigun","Improving Automated Latent Fingerprint Identification using Extended
  Minutia Types",To appear in Information Fusion journal (Elsevier),"Information Fusion, Volume 50, p. 9-19, 2019. ISSN 1566-2535",10.1016/j.inffus.2018.10.001,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Latent fingerprints are usually processed with Automated Fingerprint
Identification Systems (AFIS) by law enforcement agencies to narrow down
possible suspects from a criminal database. AFIS do not commonly use all
discriminatory features available in fingerprints but typically use only some
types of features automatically extracted by a feature extraction algorithm. In
this work, we explore ways to improve rank identification accuracies of AFIS
when only a partial latent fingerprint is available. Towards solving this
challenge, we propose a method that exploits extended fingerprint features
(unusual/rare minutiae) not commonly considered in AFIS. This new method can be
combined with any existing minutiae-based matcher. We first compute a
similarity score based on least squares between latent and tenprint minutiae
points, with rare minutiae features as reference points. Then the similarity
score of the reference minutiae-based matcher at hand is modified based on a
fitting error from the least square similarity stage. We use a realistic
forensic fingerprint casework database in our experiments which contains rare
minutiae features obtained from Guardia Civil, the Spanish law enforcement
agency. Experiments are conducted using three minutiae-based matchers as a
reference, namely: NIST-Bozorth3, VeriFinger-SDK and MCC-SDK. We report
significant improvements in the rank identification accuracies when these
minutiae matchers are augmented with our proposed algorithm based on rare
minutiae features.
","[{'version': 'v1', 'created': 'Tue, 23 Oct 2018 12:02:22 GMT'}]",2020-10-19,"[['Krish', 'Ram P.', ''], ['Fierrez', 'Julian', ''], ['Ramos', 'Daniel', ''], ['Alonso-Fernandez', 'Fernando', ''], ['Bigun', 'Josef', '']]","['Latent Fingerprints', 'Forensics', 'Extended Feature Sets', 'Rare minutiae features']"
5023,1706.03205,Xiang Wang,"Xiang Wang, Xiangnan He, Liqiang Nie, Tat-Seng Chua","Item Silk Road: Recommending Items from Information Domains to Social
  Users","10 pages, 7 figures, SIGIR 2017",,10.1145/3077136.3080771,,cs.IR cs.AI cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online platforms can be divided into information-oriented and social-oriented
domains. The former refers to forums or E-commerce sites that emphasize
user-item interactions, like Trip.com and Amazon; whereas the latter refers to
social networking services (SNSs) that have rich user-user connections, such as
Facebook and Twitter. Despite their heterogeneity, these two domains can be
bridged by a few overlapping users, dubbed as bridge users. In this work, we
address the problem of cross-domain social recommendation, i.e., recommending
relevant items of information domains to potential users of social networks. To
our knowledge, this is a new problem that has rarely been studied before.
  Existing cross-domain recommender systems are unsuitable for this task since
they have either focused on homogeneous information domains or assumed that
users are fully overlapped. Towards this end, we present a novel Neural Social
Collaborative Ranking (NSCR) approach, which seamlessly sews up the user-item
interactions in information domains and user-user connections in SNSs. In the
information domain part, the attributes of users and items are leveraged to
strengthen the embedding learning of users and items. In the SNS part, the
embeddings of bridge users are propagated to learn the embeddings of other
non-bridge users. Extensive experiments on two real-world datasets demonstrate
the effectiveness and rationality of our NSCR method.
","[{'version': 'v1', 'created': 'Sat, 10 Jun 2017 08:58:02 GMT'}]",2017-06-13,"[['Wang', 'Xiang', ''], ['He', 'Xiangnan', ''], ['Nie', 'Liqiang', ''], ['Chua', 'Tat-Seng', '']]","['Cross-domain Recommendation', 'Deep Collaborative Filtering', 'Neural Network', 'Deep Learning']"
5024,1509.01746,Alejandro Erickson,"Alejandro Erickson and Abbas Eslami Kiasari and Javier Navaridas and
  Iain A. Stewart","An Optimal Single-Path Routing Algorithm in the Datacenter Network
  DPillar","Accepted in IEEE Transactions on Parallel & Distributed Systems, July
  2016",,10.1109/TPDS.2016.2591011,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  DPillar has recently been proposed as a server-centric datacenter network and
is combinatorially related to (but distinct from) the well-known wrapped
butterfly network. We explain the relationship between DPillar and the wrapped
butterfly network before proving that the underlying graph of DPillar is a
Cayley graph; hence, the datacenter network DPillar is node-symmetric. We use
this symmetry property to establish a single-path routing algorithm for DPillar
that computes a shortest path and has time complexity $O(k)$, where $k$
parameterizes the dimension of DPillar (we refer to the number of ports in its
switches as $n$). Our analysis also enables us to calculate the diameter of
DPillar exactly. Moreover, our algorithm is trivial to implement, being
essentially a conditional clause of numeric tests, and improves significantly
upon a routing algorithm earlier employed for DPillar. Furthermore, we provide
empirical data in order to demonstrate this improvement. In particular, we
empirically show that our routing algorithm improves the average length of
paths found, the aggregate bottleneck throughput, and the communication
latency. A secondary, yet important, effect of our work is that it emphasises
that datacenter networks are amenable to a closer combinatorial scrutiny that
can significantly improve their computational efficiency and performance.
","[{'version': 'v1', 'created': 'Sat, 5 Sep 2015 22:35:46 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Feb 2016 14:37:52 GMT'}, {'version': 'v3', 'created': 'Sat, 16 Jul 2016 13:58:39 GMT'}]",2016-07-19,"[['Erickson', 'Alejandro', ''], ['Kiasari', 'Abbas Eslami', ''], ['Navaridas', 'Javier', ''], ['Stewart', 'Iain A.', '']]","['datacenter networks', 'routing algorithms', 'shortest paths', 'symmetry']"
5025,2105.11903,Yanran Li,"Yanran Li and Ke Li and Hongke Ning and xiaoqiang Xia and Yalong Guo
  and Chen Wei and Jianwei Cui and Bin Wang",Towards an Online Empathetic Chatbot with Emotion Causes,SIGIR 2021,,10.1145/3404835.3463042,,cs.CL cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Existing emotion-aware conversational models usually focus on controlling the
response contents to align with a specific emotion class, whereas empathy is
the ability to understand and concern the feelings and experience of others.
Hence, it is critical to learn the causes that evoke the users' emotion for
empathetic responding, a.k.a. emotion causes. To gather emotion causes in
online environments, we leverage counseling strategies and develop an
empathetic chatbot to utilize the causal emotion information. On a real-world
online dataset, we verify the effectiveness of the proposed approach by
comparing our chatbot with several SOTA methods using automatic metrics,
expert-based human judgements as well as user-based online evaluation.
","[{'version': 'v1', 'created': 'Tue, 11 May 2021 02:52:46 GMT'}]",2021-05-26,"[['Li', 'Yanran', ''], ['Li', 'Ke', ''], ['Ning', 'Hongke', ''], ['Xia', 'xiaoqiang', ''], ['Guo', 'Yalong', ''], ['Wei', 'Chen', ''], ['Cui', 'Jianwei', ''], ['Wang', 'Bin', '']]","['Empathetic Chatbots', 'Response Generation', 'Dialogue Systems']"
5026,1810.11921,Weiping Song,"Weiping Song, Chence Shi, Zhiping Xiao, Zhijian Duan, Yewen Xu, Ming
  Zhang, Jian Tang","AutoInt: Automatic Feature Interaction Learning via Self-Attentive
  Neural Networks",Accepted at CIKM2019,,10.1145/3357384.3357925,,cs.IR cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Click-through rate (CTR) prediction, which aims to predict the probability of
a user clicking on an ad or an item, is critical to many online applications
such as online advertising and recommender systems. The problem is very
challenging since (1) the input features (e.g., the user id, user age, item id,
item category) are usually sparse and high-dimensional, and (2) an effective
prediction relies on high-order combinatorial features (\textit{a.k.a.} cross
features), which are very time-consuming to hand-craft by domain experts and
are impossible to be enumerated. Therefore, there have been efforts in finding
low-dimensional representations of the sparse and high-dimensional raw features
and their meaningful combinations. In this paper, we propose an effective and
efficient method called the \emph{AutoInt} to automatically learn the
high-order feature interactions of input features. Our proposed algorithm is
very general, which can be applied to both numerical and categorical input
features. Specifically, we map both the numerical and categorical features into
the same low-dimensional space. Afterwards, a multi-head self-attentive neural
network with residual connections is proposed to explicitly model the feature
interactions in the low-dimensional space. With different layers of the
multi-head self-attentive neural networks, different orders of feature
combinations of input features can be modeled. The whole model can be
efficiently fit on large-scale raw data in an end-to-end fashion. Experimental
results on four real-world datasets show that our proposed approach not only
outperforms existing state-of-the-art approaches for prediction but also offers
good explainability. Code is available at:
\url{https://github.com/DeepGraphLearning/RecommenderSystems}.
","[{'version': 'v1', 'created': 'Mon, 29 Oct 2018 01:56:25 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Aug 2019 19:51:41 GMT'}]",2019-08-27,"[['Song', 'Weiping', ''], ['Shi', 'Chence', ''], ['Xiao', 'Zhiping', ''], ['Duan', 'Zhijian', ''], ['Xu', 'Yewen', ''], ['Zhang', 'Ming', ''], ['Tang', 'Jian', '']]","['High-order feature interactions', 'Self attention', 'CTR prediction', 'Explainable recommendation']"
5027,0810.1756,Milan Bradonjic,"Milan Bradonjic, Eddie Kohler, Rafail Ostrovsky",Near-Optimal Radio Use For Wireless Network Synchronization,23 pages,,10.1016/j.tcs.2011.09.026,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the model of communication where wireless devices can either
switch their radios off to save energy, or switch their radios on and engage in
communication. We distill a clean theoretical formulation of this problem of
minimizing radio use and present near-optimal solutions. Our base model ignores
issues of communication interference, although we also extend the model to
handle this requirement. We assume that nodes intend to communicate
periodically, or according to some time-based schedule. Clearly, perfectly
synchronized devices could switch their radios on for exactly the minimum
periods required by their joint schedules. The main challenge in the deployment
of wireless networks is to synchronize the devices' schedules, given that their
initial schedules may be offset relative to one another (even if their clocks
run at the same speed). We significantly improve previous results, and show
optimal use of the radio for two processors and near-optimal use of the radio
for synchronization of an arbitrary number of processors. In particular, for
two processors we prove deterministically matching $\Theta(\sqrt{n})$ upper and
lower bounds on the number of times the radio has to be on, where $n$ is the
discretized uncertainty period of the clock shift between the two processors.
(In contrast, all previous results for two processors are randomized.) For
$m=n^\beta$ processors (for any $\beta < 1$) we prove $\Omega(n^{(1-\beta)/2})$
is the lower bound on the number of times the radio has to be switched on (per
processor), and show a nearly matching (in terms of the radio use)
$\~{O}(n^{(1-\beta)/2})$ randomized upper bound per processor, with failure
probability exponentially close to 0. For $\beta \geq 1$ our algorithm runs
with at most $poly-log(n)$ radio invocations per processor. Our bounds also
hold in a radio-broadcast model where interference must be taken into account.
","[{'version': 'v1', 'created': 'Thu, 9 Oct 2008 20:41:23 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Feb 2012 22:44:09 GMT'}]",2012-02-15,"[['Bradonjic', 'Milan', ''], ['Kohler', 'Eddie', ''], ['Ostrovsky', 'Rafail', '']]","['Wireless sensor network', 'clock synchronization', 'energy efficiency', 'algorithms', 'birthday paradox', 'probabilistic protocols']"
5028,1610.02361,Jan Hackfeld,"Andreas B\""artschi and J\'er\'emie Chalopin and Shantanu Das and Yann
  Disser and Daniel Graf and Jan Hackfeld and Paolo Penna",Energy-efficient Delivery by Heterogeneous Mobile Agents,,"34th International Symposium on Theoretical Aspects of Computer
  Science, STACS'17, 10:1-14, 2017",10.4230/LIPIcs.STACS.2017.10,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of delivering $m$ messages between specified
source-target pairs in a weighted undirected graph, by $k$ mobile agents
initially located at distinct nodes of the graph. Each agent consumes energy
proportional to the distance it travels in the graph and we are interested in
optimizing the total energy consumption for the team of agents. Unlike previous
related work, we consider heterogeneous agents with different rates of energy
consumption (weights~$w_i$). To solve the delivery problem, agents face three
major challenges: \emph{Collaboration} (how to work together on each message),
\emph{Planning} (which route to take) and \emph{Coordination} (how to assign
agents to messages).
  We first show that the delivery problem can be 2-approximated \emph{without}
collaborating and that this is best possible, i.e., we show that the
\emph{benefit of collaboration} is 2 in general. We also show that the benefit
of collaboration for a single message is~$1/\ln 2 \approx 1.44$. Planning turns
out to be \NP-hard to approximate even for a single agent, but can be
2-approximated in polynomial time if agents have unit capacities and do not
collaborate. We further show that coordination is \NP-hard even for agents with
unit capacity, but can be efficiently solved exactly if they have uniform
weights. Finally, we give a polynomial-time
$(4\max\tfrac{w_i}{w_j})$-approximation for message delivery with unit
capacities.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2016 18:05:36 GMT'}]",2020-08-27,"[['Bärtschi', 'Andreas', ''], ['Chalopin', 'Jérémie', ''], ['Das', 'Shantanu', ''], ['Disser', 'Yann', ''], ['Graf', 'Daniel', ''], ['Hackfeld', 'Jan', ''], ['Penna', 'Paolo', '']]","['message delivery', 'mobile agents', 'energy optimization', 'approximationalgorithms']"
5029,1705.05615,Sami Abu-El-Haija,"Sami Abu-El-Haija, Bryan Perozzi, Rami Al-Rfou",Learning Edge Representations via Low-Rank Asymmetric Projections,,"ACM International Conference on Information and Knowledge
  Management, 2017",10.1145/3132847.3132959,,cs.LG cs.SI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new method for embedding graphs while preserving directed edge
information. Learning such continuous-space vector representations (or
embeddings) of nodes in a graph is an important first step for using network
information (from social networks, user-item graphs, knowledge bases, etc.) in
many machine learning tasks.
  Unlike previous work, we (1) explicitly model an edge as a function of node
embeddings, and we (2) propose a novel objective, the ""graph likelihood"", which
contrasts information from sampled random walks with non-existent edges.
Individually, both of these contributions improve the learned representations,
especially when there are memory constraints on the total size of the
embeddings. When combined, our contributions enable us to significantly improve
the state-of-the-art by learning more concise representations that better
preserve the graph structure.
  We evaluate our method on a variety of link-prediction task including social
networks, collaboration networks, and protein interactions, showing that our
proposed method learn representations with error reductions of up to 76% and
55%, on directed and undirected graphs. In addition, we show that the
representations learned by our method are quite space efficient, producing
embeddings which have higher structure-preserving accuracy but are 10 times
smaller.
","[{'version': 'v1', 'created': 'Tue, 16 May 2017 09:44:28 GMT'}, {'version': 'v2', 'created': 'Wed, 17 May 2017 23:15:39 GMT'}, {'version': 'v3', 'created': 'Mon, 29 May 2017 12:00:41 GMT'}, {'version': 'v4', 'created': 'Wed, 13 Sep 2017 18:21:14 GMT'}]",2017-09-15,"[['Abu-El-Haija', 'Sami', ''], ['Perozzi', 'Bryan', ''], ['Al-Rfou', 'Rami', '']]","['Graph', 'Edge Learning', 'Embedding', 'Random Walk', 'Link Prediction', 'Representation Learning']"
5030,1503.01180,Chenhao Tan,Chenhao Tan and Lillian Lee,"All Who Wander: On the Prevalence and Characteristics of Multi-community
  Engagement","11 pages, data available at
  https://chenhaot.com/pages/multi-community.html, Proceedings of WWW 2015
  (updated references)",,10.1145/2736277.2741661,,cs.SI cs.CL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although analyzing user behavior within individual communities is an active
and rich research domain, people usually interact with multiple communities
both on- and off-line. How do users act in such multi-community environments?
Although there are a host of intriguing aspects to this question, it has
received much less attention in the research community in comparison to the
intra-community case. In this paper, we examine three aspects of
multi-community engagement: the sequence of communities that users post to, the
language that users employ in those communities, and the feedback that users
receive, using longitudinal posting behavior on Reddit as our main data source,
and DBLP for auxiliary experiments. We also demonstrate the effectiveness of
features drawn from these aspects in predicting users' future level of
activity.
  One might expect that a user's trajectory mimics the ""settling-down"" process
in real life: an initial exploration of sub-communities before settling down
into a few niches. However, we find that the users in our data continually post
in new communities; moreover, as time goes on, they post increasingly evenly
among a more diverse set of smaller communities. Interestingly, it seems that
users that eventually leave the community are ""destined"" to do so from the very
beginning, in the sense of showing significantly different ""wandering"" patterns
very early on in their trajectories; this finding has potentially important
design implications for community maintainers. Our multi-community perspective
also allows us to investigate the ""situation vs. personality"" debate from
language usage across different communities.
","[{'version': 'v1', 'created': 'Wed, 4 Mar 2015 01:05:41 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Mar 2015 20:00:27 GMT'}]",2015-03-18,"[['Tan', 'Chenhao', ''], ['Lee', 'Lillian', '']]","['multiple communities', 'lifecycle', 'language', 'Reddit', 'DBLP']"
5031,1803.04932,Ali Shirzadi Babakan,"A. S. Babakan, M. Taleai","Impacts of transport development on residence choice of renter
  households: An agent-based evaluation",,Habitat International 49 (2015) 275-285,10.1016/j.habitatint.2015.05.033,,cs.MA cs.AI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Because of improving accessibility, transport developments play an important
role in residence choice of renter households. In this paper, an agent-based
model is developed to investigate impacts of different transport developments
on residence choice of renter households in Tehran, the capital of Iran. In the
proposed model, renter households are considered as agents who make a
multi-objective decision and compete with each other to rent a preferred
residential zone. Then, three transport development scenarios including
construction a new highway, subway and bus rapid transit (BRT) line are
simulated and resulting changes in residence choice of agents are evaluated.
Results show that transport development scenarios significantly affect
residence choice behavior of different socio-economic categories of renter
households and lead to considerable changes in the residential demand,
composition of residents, mean income level and mean car ownership in their
vicinities.
","[{'version': 'v1', 'created': 'Tue, 13 Mar 2018 16:45:33 GMT'}]",2018-03-14,"[['Babakan', 'A. S.', ''], ['Taleai', 'M.', '']]","['Transport development', 'Residence choice', 'Agent-based modeling', 'NSGA-II algorithm', 'Renter household']"
5032,1803.00116,Benito van der Zander,"Benito van der Zander (1), Maciej Li\'skiewicz (1), Johannes Textor
  (2) ((1) Institute for Theoretical Computer Science, Universit\""at zu
  L\""ubeck, Germany, (2) Institute for Computing and Information Sciences,
  Radboud University Nijmegen, Nijmegen, The Netherlands)","Separators and Adjustment Sets in Causal Graphs: Complete Criteria and
  an Algorithmic Framework","52 pages, 20 figures, 12 tables",Artificial Intelligence 270 (2019) 1-40,10.1016/j.artint.2018.12.006,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Principled reasoning about the identifiability of causal effects from
non-experimental data is an important application of graphical causal models.
This paper focuses on effects that are identifiable by covariate adjustment, a
commonly used estimation approach. We present an algorithmic framework for
efficiently testing, constructing, and enumerating $m$-separators in ancestral
graphs (AGs), a class of graphical causal models that can represent uncertainty
about the presence of latent confounders. Furthermore, we prove a reduction
from causal effect identification by covariate adjustment to $m$-separation in
a subgraph for directed acyclic graphs (DAGs) and maximal ancestral graphs
(MAGs). Jointly, these results yield constructive criteria that characterize
all adjustment sets as well as all minimal and minimum adjustment sets for
identification of a desired causal effect with multivariate exposures and
outcomes in the presence of latent confounding. Our results extend several
existing solutions for special cases of these problems. Our efficient
algorithms allowed us to empirically quantify the identifiability gap between
covariate adjustment and the do-calculus in random DAGs and MAGs, covering a
wide range of scenarios. Implementations of our algorithms are provided in the
R package dagitty.
","[{'version': 'v1', 'created': 'Wed, 28 Feb 2018 22:28:08 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Mar 2018 15:42:44 GMT'}, {'version': 'v3', 'created': 'Thu, 24 Jan 2019 16:33:53 GMT'}]",2019-01-25,"[['van der Zander', 'Benito', ''], ['Liśkiewicz', 'Maciej', ''], ['Textor', 'Johannes', '']]","['Causal inference', 'Covariate adjustment', 'Ancestral graphs', 'd-separation', 'm-separation', 'Complexity', 'Bayesian network', 'Knowledge representation']"
5033,0712.0171,Elchanan Mossel,Amin Coja-Oghlan and Elchanan Mossel and Dan Vilenchik,A Spectral Approach to Analyzing Belief Propagation for 3-Coloring,,"Combinatorics, Probability and Computing 18 (2009) 881 - 912",10.1017/S096354830900981X,,cs.CC cs.AI cs.DM,,"  Contributing to the rigorous understanding of BP, in this paper we relate the
convergence of BP to spectral properties of the graph. This encompasses a
result for random graphs with a ``planted'' solution; thus, we obtain the first
rigorous result on BP for graph coloring in the case of a complex graphical
structure (as opposed to trees). In particular, the analysis shows how Belief
Propagation breaks the symmetry between the $3!$ possible permutations of the
color classes.
","[{'version': 'v1', 'created': 'Sun, 2 Dec 2007 19:34:59 GMT'}]",2017-11-17,"[['Coja-Oghlan', 'Amin', ''], ['Mossel', 'Elchanan', ''], ['Vilenchik', 'Dan', '']]","['Belief Propagation', 'Survey Propagation', 'graph coloring', 'spectral algorithms']"
5034,1707.05691,Xintong Han,"Xintong Han, Zuxuan Wu, Yu-Gang Jiang, Larry S. Davis",Learning Fashion Compatibility with Bidirectional LSTMs,ACM MM 17,,10.1145/3123266.3123394,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ubiquity of online fashion shopping demands effective recommendation
services for customers. In this paper, we study two types of fashion
recommendation: (i) suggesting an item that matches existing components in a
set to form a stylish outfit (a collection of fashion items), and (ii)
generating an outfit with multimodal (images/text) specifications from a user.
To this end, we propose to jointly learn a visual-semantic embedding and the
compatibility relationships among fashion items in an end-to-end fashion. More
specifically, we consider a fashion outfit to be a sequence (usually from top
to bottom and then accessories) and each item in the outfit as a time step.
Given the fashion items in an outfit, we train a bidirectional LSTM (Bi-LSTM)
model to sequentially predict the next item conditioned on previous ones to
learn their compatibility relationships. Further, we learn a visual-semantic
space by regressing image features to their semantic representations aiming to
inject attribute and category information as a regularization for training the
LSTM. The trained network can not only perform the aforementioned
recommendations effectively but also predict the compatibility of a given
outfit. We conduct extensive experiments on our newly collected Polyvore
dataset, and the results provide strong qualitative and quantitative evidence
that our framework outperforms alternative methods.
","[{'version': 'v1', 'created': 'Tue, 18 Jul 2017 15:36:53 GMT'}]",2017-07-19,"[['Han', 'Xintong', ''], ['Wu', 'Zuxuan', ''], ['Jiang', 'Yu-Gang', ''], ['Davis', 'Larry S.', '']]","['Fashion recommendation', 'deep learning', 'bidirectional LSTM', 'visualcompatibility learning']"
5035,1608.05661,Hamza Harkous,"Hamza Harkous, Rameez Rahman, Bojan Karlas, Karl Aberer","The Curious Case of the PDF Converter that Likes Mozart: Dissecting and
  Mitigating the Privacy Risk of Personal Cloud Apps",,"Proceedings on Privacy Enhancing Technologies. Volume 2016, Issue
  4, Pages 123-143, ISSN (Online) 2299-0984",10.1515/popets-2016-0032,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Third party apps that work on top of personal cloud services such as Google
Drive and Dropbox, require access to the user's data in order to provide some
functionality. Through detailed analysis of a hundred popular Google Drive apps
from Google's Chrome store, we discover that the existing permission model is
quite often misused: around two thirds of analyzed apps are over-privileged,
i.e., they access more data than is needed for them to function. In this work,
we analyze three different permission models that aim to discourage users from
installing over-privileged apps. In experiments with 210 real users, we
discover that the most successful permission model is our novel ensemble method
that we call Far-reaching Insights. Far-reaching Insights inform the users
about the data-driven insights that apps can make about them (e.g., their
topics of interest, collaboration and activity patterns etc.) Thus, they seek
to bridge the gap between what third parties can actually know about users and
users perception of their privacy leakage. The efficacy of Far-reaching
Insights in bridging this gap is demonstrated by our results, as Far-reaching
Insights prove to be, on average, twice as effective as the current model in
discouraging users from installing over-privileged apps. In an effort for
promoting general privacy awareness, we deploy a publicly available privacy
oriented app store that uses Far-reaching Insights. Based on the knowledge
extracted from data of the store's users (over 115 gigabytes of Google Drive
data from 1440 users with 662 installed apps), we also delineate the ecosystem
for third-party cloud apps from the standpoint of developers and cloud
providers. Finally, we present several general recommendations that can guide
other future works in the area of privacy for the cloud.
","[{'version': 'v1', 'created': 'Thu, 18 Aug 2016 07:36:11 GMT'}]",2016-08-22,"[['Harkous', 'Hamza', ''], ['Rahman', 'Rameez', ''], ['Karlas', 'Bojan', ''], ['Aberer', 'Karl', '']]","['cloud computing', 'usable privacy', 'apps']"
5036,1507.08826,Matteo Brunelli,Matteo Brunelli,"Studying a set of properties of inconsistency indices for pairwise
  comparisons",,,10.1007/s10479-016-2166-8,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pairwise comparisons between alternatives are a well-established tool to
decompose decision problems into smaller and more easily tractable
sub-problems. However, due to our limited rationality, the subjective
preferences expressed by decision makers over pairs of alternatives can hardly
ever be consistent. Therefore, several inconsistency indices have been proposed
in the literature to quantify the extent of the deviation from complete
consistency. Only recently, a set of properties has been proposed to define a
family of functions representing inconsistency indices. The scope of this paper
is twofold. Firstly, it expands the set of properties by adding and justifying
a new one. Secondly, it continues the study of inconsistency indices to check
whether or not they satisfy the above mentioned properties. Out of the four
indices considered in this paper, in its present form, two fail to satisfy some
properties. An adjusted version of one index is proposed so that it fulfills
them.
","[{'version': 'v1', 'created': 'Fri, 31 Jul 2015 10:56:40 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Mar 2016 08:36:12 GMT'}]",2016-03-15,"[['Brunelli', 'Matteo', '']]","['pairwise comparisons', 'consistency', 'inconsistency indices', 'analytic hierarchy process']"
5037,1102.0763,Mohammad Hassan habibi,"Mohammad Hassan Habibi, Mahmud Gardeshi, Mahdi R. Alaghband","Practical Attacks on a RFID Authentication Protocol Conforming to EPC
  C-1 G-2 Standard","13 page, International Journal of Ubicomp","International Journal of Ubicomp, Volume 2, Number 1,pp. 1-13,
  2011",10.5121/iju.2011.2101,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Yeh et al. recently have proposed a mutual authentication protocol based on
EPC Class-1 Gen.-2 standard [1]. They have claimed that their protocol is
secure against adversarial attacks and also provides forward secrecy. In this
paper we will show that the proposed protocol does not have proper security
features. A powerful and practical attack is presented on this protocol whereby
the whole security of the protocol is broken. Furthermore, Yeh et al. protocol
does not assure the untraceabilitiy and backward untraceabilitiy aspects.
Namely, all past and next transactions of a compromised tag will be traceable
by an adversary.
","[{'version': 'v1', 'created': 'Thu, 3 Feb 2011 20:00:24 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Feb 2011 09:29:19 GMT'}]",2011-02-07,"[['Habibi', 'Mohammad Hassan', ''], ['Gardeshi', 'Mahmud', ''], ['Alaghband', 'Mahdi R.', '']]","['RFID', 'EPC C-1 G-2 standard', 'Security', 'Attacks', 'Untraceability']"
5038,1502.02768,Ashraf Shahin,Ashraf A. Shahin,"Virtual Network Embedding Algorithms Based on Best-Fit Subgraph
  Detection",arXiv admin note: substantial text overlap with arXiv:1502.02358,"Computer and Information Science; Vol. 8, No. 1; 2015",10.5539/cis.v8n1p62,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the main objectives of cloud computing providers is increasing the
revenue of their cloud datacenters by accommodating virtual network requests as
many as possible. However, arrival and departure of virtual network requests
fragment physical network's resources and reduce the possibility of accepting
more virtual network requests. To increase the number of virtual network
requests accommodated by fragmented physical networks, we propose two virtual
network embedding algorithms, which coarsen virtual networks using Heavy Edge
Matching (HEM) technique and embed coarsened virtual networks on best-fit
sub-substrate networks. The performance of the proposed algorithms are
evaluated and compared with existing algorithms using extensive simulations,
which show that the proposed algorithms increase the acceptance ratio and the
revenue.
","[{'version': 'v1', 'created': 'Tue, 10 Feb 2015 03:43:40 GMT'}]",2015-02-11,"[['Shahin', 'Ashraf A.', '']]","['network virtualization', 'virtual network embedding', 'cloud computing', 'resource allocation', 'substrate network fragmentation', 'virtual network coarsening']"
5039,1308.2234,Mark Keane,Petra Ahrweiler and Mark T. Keane,Innovation networks,,"Mind & Society, 12, 73-90, 2013",10.1007/s11299-013-0123-7,,cs.AI cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper advances a framework for modeling the component interactions
between cognitive and social aspects of scientific creativity and technological
innovation. Specifically, it aims to characterize Innovation Networks; those
networks that involve the interplay of people, ideas and organizations to
create new, technologically feasible, commercially-realizable products,
processes and organizational structures. The tri-partite framework captures
networks of ideas (Concept Level), people (Individual Level) and social
structures (Social-Organizational Level) and the interactions between these
levels. At the concept level, new ideas are the nodes that are created and
linked, kept open for further investigation or closed if solved by actors at
the individual or organizational levels. At the individual level, the nodes are
actors linked by shared worldviews (based on shared professional, educational,
experiential backgrounds) who are the builders of the concept level. At the
social-organizational level, the nodes are organizations linked by common
efforts on a given project (e.g., a company-university collaboration) that by
virtue of their intellectual property or rules of governance constrain the
actions of individuals (at the Individual Level) or ideas (at the Concept
Level). After describing this framework and its implications we paint a number
of scenarios to flesh out how it can be applied.
","[{'version': 'v1', 'created': 'Fri, 9 Aug 2013 20:13:34 GMT'}]",2013-08-13,"[['Ahrweiler', 'Petra', ''], ['Keane', 'Mark T.', '']]","['Innovation', 'creativity', 'networks', 'knowledge\t c \xa0production', 'society']"
5040,1407.2729,Rohit  Tanwar,"Manisha Rana, Rohit Tanwar",Genetic Algorithm in Audio Steganography,"6 pages,2 figures Published with International Journal of Engineering
  Trends and Technology (IJETT). arXiv admin note: text overlap with
  arXiv:1003.4084, arXiv:1205.2800 by other authors without attribution","IJETT, V13(1),29-34 July 2014",10.14445/22315381/IJETT-V13P206,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the advancement of communication technology,data is exchanged digitally
over the network. At the other side the technology is also proven as a tool for
unauthorized access to attackers. Thus the security of data to be transmitted
digitally should get prime focus. Data hiding is the common approach to secure
data. In steganography technique, the existence of data is concealed. GA is an
emerging component of AI to provide suboptimal solutions. In this paper the use
of GA in Steganography is explored to find future scope of research.
","[{'version': 'v1', 'created': 'Thu, 10 Jul 2014 09:07:03 GMT'}]",2014-07-11,"[['Rana', 'Manisha', ''], ['Tanwar', 'Rohit', '']]","['HAS', 'SecretData', 'Genetic Algorithm', 'Mutation', 'Chromosome']"
5041,1706.04405,Torsten Teubler,"Torsten Teubler, Dennis Pfisterer, Horst Hellbr\""uck","Memory Efficient Forwarding Information Base for Content-Centric
  Networking","19 Pages, 13 Figures",,10.5121/ijcnc.2017.9305,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Content-Centric Networking (CCN) is a new paradigm for the future Internet
where content is addressed by hierarchically organized names with the goal to
replace TCP/IP networks. Unlike IP addresses, names have arbitrary length and
are larger than the four bytes of IPv4 addresses. One important data structure
in CCN is the Forwarding Information Base (FIB) where prefixes of names are
stored together with the forwarding face. Long prefixes create problems for
memory constrained Internet of Things (IoT) devices. In this work, we derive
requirements for a FIB in the IoT and survey possible solutions. We
investigate, design and compare memory-efficient solutions for the FIB based on
hashes and Bloom-Filters. For large number of prefixes and an equal
distribution of prefixes to faces we recommend a FIB implementation based on
Bloom-Filters. In all other cases, we recommend an implementation of the FIB
with hashes.
","[{'version': 'v1', 'created': 'Wed, 14 Jun 2017 11:06:36 GMT'}]",2017-06-15,"[['Teubler', 'Torsten', ''], ['Pfisterer', 'Dennis', ''], ['Hellbrück', 'Horst', '']]","['Protocols', 'Content-centric networking', 'Internet of things']"
5042,1705.05592,Varun Ojha,"Varun Kumar Ojha, Ajith Abraham, V\'aclav Sn\'a\v{s}el","Ensemble of heterogeneous flexible neural trees using multiobjective
  genetic programming",,"Applied Soft Computing, 2017, Volume 52 Pages 909 to 924",10.1016/j.asoc.2016.09.035,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning algorithms are inherently multiobjective in nature, where
approximation error minimization and model's complexity simplification are two
conflicting objectives. We proposed a multiobjective genetic programming (MOGP)
for creating a heterogeneous flexible neural tree (HFNT), tree-like flexible
feedforward neural network model. The functional heterogeneity in neural tree
nodes was introduced to capture a better insight of data during learning
because each input in a dataset possess different features. MOGP guided an
initial HFNT population towards Pareto-optimal solutions, where the final
population was used for making an ensemble system. A diversity index measure
along with approximation error and complexity was introduced to maintain
diversity among the candidates in the population. Hence, the ensemble was
created by using accurate, structurally simple, and diverse candidates from
MOGP final population. Differential evolution algorithm was applied to
fine-tune the underlying parameters of the selected candidates. A comprehensive
test over classification, regression, and time-series datasets proved the
efficiency of the proposed algorithm over other available prediction methods.
Moreover, the heterogeneous creation of HFNT proved to be efficient in making
ensemble system from the final population.
","[{'version': 'v1', 'created': 'Tue, 16 May 2017 08:40:42 GMT'}]",2017-05-17,"[['Ojha', 'Varun Kumar', ''], ['Abraham', 'Ajith', ''], ['Snášel', 'Václav', '']]","['Pareto-based multiobjectives', 'flexible neural tree', 'ensemble', 'approximation', 'feature']"
5043,1511.07033,Andrew Kent,"Andrew M. Kent, David Kempe, Sam Tobin-Hochstadt",Occurrence Typing Modulo Theories,,"SIGPLAN Not. 51, 6 (June 2016), 296-309",10.1145/2980983.2908091,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new type system combining occurrence typing, previously used to
type check programs in dynamically-typed languages such as Racket, JavaScript,
and Ruby, with dependent refinement types. We demonstrate that the addition of
refinement types allows the integration of arbitrary solver-backed reasoning
about logical propositions from external theories. By building on occurrence
typing, we can add our enriched type system as an extension of Typed
Racket---adding dependency and refinement reuses the existing formalism while
increasing its expressiveness.
  Dependent refinement types allow Typed Racket programmers to express rich
type relationships, ranging from data structure invariants such as red-black
tree balance to preconditions such as vector bounds. Refinements allow
programmers to embed the propositions that occurrence typing in Typed Racket
already reasons about into their types. Further, extending occurrence typing to
refinements allows us to make the underlying formalism simpler and more
powerful.
  In addition to presenting the design of our system, we present a formal model
of the system, show how to integrate it with theories over both linear
arithmetic and bitvectors, and evaluate the system in the context of the full
Typed Racket implementation. Specifically, we take safe vector access as a case
study, and examine all vector accesses in a 56,000 line corpus of Typed Racket
programs. Our system is able to prove that 50% of these are safe with no new
annotation, and with a few annotations and modifications, we can capture close
to 80%.
","[{'version': 'v1', 'created': 'Sun, 22 Nov 2015 16:54:32 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Oct 2016 17:57:24 GMT'}]",2016-10-05,"[['Kent', 'Andrew M.', ''], ['Kempe', 'David', ''], ['Tobin-Hochstadt', 'Sam', '']]","['Refinement types', 'occurrence typing', 'Racket']"
5044,2301.03773,Sijie Ji,"Sijie Ji, Yaxiong Xie, Mo Li",SiFall: Practical Online Fall Detection with RF Sensing,"This paper is accepted by SenSys 2022. Copyright may be transferred
  without notice","The 20th ACM Conference on Embedded Networked Sensor Systems, 2022",10.1145/3560905.3568517,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Falls are one of the leading causes of death in the elderly people aged 65
and above. In order to prevent death by sending prompt fall detection alarms,
non-invasive radio-frequency (RF) based fall detection has attracted
significant attention, due to its wide coverage and privacy preserving nature.
Existing RF-based fall detection systems process fall as an activity
classification problem and assume that human falls introduce reproducible
patterns to the RF signals. We, however, argue that the fall is essentially an
accident, hence, its impact is uncontrollable and unforeseeable. We propose to
solve the fall detection problem in a fundamentally different manner. Instead
of directly identifying the human falls which are difficult to quantify, we
recognize the normal repeatable human activities and then identify the fall as
abnormal activities out of the normal activity distribution. We implement our
idea and build a prototype based on commercial Wi-Fi. We conduct extensive
experiments with 16 human subjects. The experiment results show that our system
can achieve high fall detection accuracy and adapt to different environments
for real-time fall detection.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2023 03:52:54 GMT'}]",2023-01-11,"[['Ji', 'Sijie', ''], ['Xie', 'Yaxiong', ''], ['Li', 'Mo', '']]","['Self-supervised Learning', 'Wireless Sensing', 'Real-time System', 'Adaptive Segmentation', 'Fall Detection', 'Device-free']"
5045,2301.10105,Sebastian Schulthei{\ss},"Sebastian Schulthei{\ss}, Helena H\""au{\ss}ler, Dirk Lewandowski","Does Search Engine Optimization come along with high-quality content? A
  comparison between optimized and non-optimized health-related web pages",,"CHIIR '22: ACM SIGIR Conference on Human Information Interaction
  and Retrieval, Regensburg, Germany, March 14 - 18, 2022",10.1145/3498366.3505811,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Searching for medical information is both a common and important activity
since it influences decisions people make about their healthcare. Using search
engine optimization (SEO), content producers seek to increase the visibility of
their content. SEO is more likely to be practiced by commercially motivated
content producers such as pharmaceutical companies than by non-commercial
providers such as governmental bodies. In this study, we ask whether content
quality correlates with the presence or absence of SEO measures on a web page.
We conducted a user study in which N = 61 participants comprising laypeople as
well as experts in health information assessment evaluated health-related web
pages classified as either optimized or non-optimized. The subjects rated the
expertise of non-optimized web pages as higher than the expertise of optimized
pages, justifying their appraisal by the more competent and reputable
appearance of non-optimized pages. In addition, comments about the website
operators of the non-optimized pages were exclusively positive, while optimized
pages tended to receive positive as well as negative assessments. We found no
differences between the ratings of laypeople and experts. Since non-optimized,
but high-quality content may be outranked by optimized content of lower
quality, trusted sources should be prioritized in rankings.
","[{'version': 'v1', 'created': 'Tue, 24 Jan 2023 16:16:51 GMT'}]",2023-01-25,"[['Schultheiß', 'Sebastian', ''], ['Häußler', 'Helena', ''], ['Lewandowski', 'Dirk', '']]","['Search engines', 'search engine optimization (SEO)', 'health information', 'online health information-seeking behaviour']"
5046,1004.1887,Dakshina Ranjan Kisku,"Phalguni Gupta, Dakshina Ranjan Kisku, Jamuna Kanta Sing, Massimo
  Tistarelli","Maximized Posteriori Attributes Selection from Facial Salient Landmarks
  for Face Recognition","8 pages, 2 figures",ISA 2010,10.1007/978-3-642-13365-7_1,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper presents a robust and dynamic face recognition technique based on
the extraction and matching of devised probabilistic graphs drawn on SIFT
features related to independent face areas. The face matching strategy is based
on matching individual salient facial graph characterized by SIFT features as
connected to facial landmarks such as the eyes and the mouth. In order to
reduce the face matching errors, the Dempster-Shafer decision theory is applied
to fuse the individual matching scores obtained from each pair of salient
facial features. The proposed algorithm is evaluated with the ORL and the IITK
face databases. The experimental results demonstrate the effectiveness and
potential of the proposed face recognition technique also in case of partially
occluded faces.
","[{'version': 'v1', 'created': 'Mon, 12 Apr 2010 07:42:09 GMT'}]",2015-05-18,"[['Gupta', 'Phalguni', ''], ['Kisku', 'Dakshina Ranjan', ''], ['Sing', 'Jamuna Kanta', ''], ['Tistarelli', 'Massimo', '']]","['Face biometrics', 'Graph matching', 'SIFT features', 'Dempster-Shafer decision theory', 'Intra-modal fusion']"
5047,1108.1861,EPTCS,"Suzana Andova (Eindhoven University of Technology), Luuk Groenewegen
  (Leiden University), Erik de Vink (Eindhoven University of Technology)",Towards reduction of Paradigm coordination models,"In Proceedings PACO 2011, arXiv:1108.1452","EPTCS 60, 2011, pp. 1-18",10.4204/EPTCS.60.1,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The coordination modelling language Paradigm addresses collaboration between
components in terms of dynamic constraints. Within a Paradigm model, component
dynamics are consistently specified at a detailed and a global level of
abstraction. To enable automated verification of Paradigm models, a translation
of Paradigm into process algebra has been defined in previous work. In this
paper we investigate, guided by a client-server example, reduction of Paradigm
models based on a notion of global inertness. Representation of Paradigm models
as process algebraic specifications helps to establish a property-preserving
equivalence relation between the original and the reduced Paradigm model.
Experiments indicate that in this way larger Paradigm models can be analyzed.
","[{'version': 'v1', 'created': 'Tue, 9 Aug 2011 06:38:19 GMT'}]",2011-08-10,"[['Andova', 'Suzana', '', 'Eindhoven University of Technology'], ['Groenewegen', 'Luuk', '', 'Leiden University'], ['de Vink', 'Erik', '', 'Eindhoven University of Technology']]","['coordination', 'process algebra', 'Paradigm', 'vertical dynamic consistency', 'levels of abstraction', 'branching bisimulation', 'globally inert', 'model reduction']"
5048,0907.0520,James Whitacre,"Hussein Abbass, Axel Bender, Helen Dam, Stephen Baker, James M
  Whitacre, Ruhul Sarker",Computational Scenario-based Capability Planning,"GECCO-2008, Atlanta, GA, USA",,10.1145/1389095.1389378,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scenarios are pen-pictures of plausible futures, used for strategic planning.
The aim of this investigation is to expand the horizon of scenario-based
planning through computational models that are able to aid the analyst in the
planning process. The investigation builds upon the advances of Information and
Communication Technology (ICT) to create a novel, flexible and customizable
computational capability-based planning methodology that is practical and
theoretically sound. We will show how evolutionary computation, in particular
evolutionary multi-objective optimization, can play a central role - both as an
optimizer and as a source for innovation.
","[{'version': 'v1', 'created': 'Fri, 3 Jul 2009 02:32:34 GMT'}]",2009-07-06,"[['Abbass', 'Hussein', ''], ['Bender', 'Axel', ''], ['Dam', 'Helen', ''], ['Baker', 'Stephen', ''], ['Whitacre', 'James M', ''], ['Sarker', 'Ruhul', '']]","['Genetic algorithms', 'capability planning', 'long term planning', 'uncertainty']"
5049,2105.12301,Keichi Takahashi,"Keichi Takahashi (1), Wassapon Watanakeesuntorn (1), Kohei Ichikawa
  (1), Joseph Park (2), Ryousei Takano (3), Jason Haga (3), George Sugihara
  (4), Gerald M. Pao (5) ((1) Nara Institute of Science and Technology, (2)
  U.S. Department of the Interior, (3) National Institute of Advanced
  Industrial Science and Technology, (4) University of California San Diego,
  (5) Salk Institute for Biological Studies)","kEDM: A Performance-portable Implementation of Empirical Dynamic
  Modeling using Kokkos","8 pages, 9 figures, accepted at Practice & Experience in Advanced
  Research Computing (PEARC'21), corresponding authors: Keichi Takahashi,
  Gerald M. Pao",,10.1145/3437359.3465571,,cs.DC cs.MS cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Empirical Dynamic Modeling (EDM) is a state-of-the-art non-linear time-series
analysis framework. Despite its wide applicability, EDM was not scalable to
large datasets due to its expensive computational cost. To overcome this
obstacle, researchers have attempted and succeeded in accelerating EDM from
both algorithmic and implementational aspects. In previous work, we developed a
massively parallel implementation of EDM targeting HPC systems (mpEDM).
However, mpEDM maintains different backends for different architectures. This
design becomes a burden in the increasingly diversifying HPC systems, when
porting to new hardware. In this paper, we design and develop a
performance-portable implementation of EDM based on the Kokkos performance
portability framework (kEDM), which runs on both CPUs and GPUs while based on a
single codebase. Furthermore, we optimize individual kernels specifically for
EDM computation, and use real-world datasets to demonstrate up to $5.5\times$
speedup compared to mpEDM in convergent cross mapping computation.
","[{'version': 'v1', 'created': 'Wed, 26 May 2021 02:21:55 GMT'}]",2021-05-27,"[['Takahashi', 'Keichi', ''], ['Watanakeesuntorn', 'Wassapon', ''], ['Ichikawa', 'Kohei', ''], ['Park', 'Joseph', ''], ['Takano', 'Ryousei', ''], ['Haga', 'Jason', ''], ['Sugihara', 'George', ''], ['Pao', 'Gerald M.', '']]","['Empirical Dynamic Modeling', 'Performance Portability', 'Kokkos', 'GPU', 'High Performance Computing']"
5050,1610.05094,Jimmy Nielsen,"Mathias R{\o}nholt Kielgast, Anders Charly Rasmussen, Mathias Hjorth
  Laursen, Jimmy Jessen Nielsen, Petar Popovski, Rasmus Krigslund","Estimation of Received Signal Strength Distribution for Smart Meters
  with Biased Measurement Data Set",Accepted for publication in IEEE Wireless Communications Letters,,10.1109/LWC.2016.2619346,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This letter presents an experimental study and a novel modelling approach of
the wireless channel of smart utility meters placed in basements or sculleries.
The experimental data consist of signal strength measurements of consumption
report packets. Since such packets are only registered if they can be decoded
by the receiver, the part of the signal strength distribution that falls below
the receiver sensitivity threshold is not observable. We combine a Rician
fading model with a bias function that captures the cut-off in the observed
signal strength measurements. Two sets of experimental data are analysed. It is
shown that the proposed method offers an approximation of the distribution of
the signal strength measurements that is better than a na\""ive Rician fitting.
","[{'version': 'v1', 'created': 'Mon, 17 Oct 2016 13:16:31 GMT'}]",2016-11-17,"[['Kielgast', 'Mathias Rønholt', ''], ['Rasmussen', 'Anders Charly', ''], ['Laursen', 'Mathias Hjorth', ''], ['Nielsen', 'Jimmy Jessen', ''], ['Popovski', 'Petar', ''], ['Krigslund', 'Rasmus', '']]","['Channel characterization and modeling', 'Receivedsignal strength measurements', 'Communication system planning']"
5051,1806.10360,Lucca Hirschi,"David Basin, Jannik Dreier, Lucca Hirschi, Sa\v{s}a Radomirovi\'c,
  Ralf Sasse, Vincent Stettler",A Formal Analysis of 5G Authentication,"Categories (ACM class 2012): Security and privacy - Formal methods
  and theory of security -- Security requirements -- Formal security models --
  Logic and verification; Network protocols - Protocol correctness -- Formal
  specifications; Security and privacy - Network security -- Mobile and
  wireless security - Security services -- Privacy-preserving protocols",,10.1145/3243734.3243846,Accepted at CCS'18,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile communication networks connect much of the world's population. The
security of users' calls, SMSs, and mobile data depends on the guarantees
provided by the Authenticated Key Exchange protocols used. For the
next-generation network (5G), the 3GPP group has standardized the 5G AKA
protocol for this purpose. We provide the first comprehensive formal model of a
protocol from the AKA family: 5G AKA. We also extract precise requirements from
the 3GPP standards defining 5G and we identify missing security goals. Using
the security protocol verification tool Tamarin, we conduct a full, systematic,
security evaluation of the model with respect to the 5G security goals. Our
automated analysis identifies the minimal security assumptions required for
each security goal and we find that some critical security goals are not met,
except under additional assumptions missing from the standard. Finally, we make
explicit recommendations with provably secure fixes for the attacks and
weaknesses we found.
","[{'version': 'v1', 'created': 'Wed, 27 Jun 2018 09:13:13 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Aug 2018 14:12:18 GMT'}, {'version': 'v3', 'created': 'Thu, 18 Oct 2018 18:10:04 GMT'}, {'version': 'v4', 'created': 'Fri, 10 Jan 2020 09:14:59 GMT'}]",2020-01-13,"[['Basin', 'David', ''], ['Dreier', 'Jannik', ''], ['Hirschi', 'Lucca', ''], ['Radomirović', 'Saša', ''], ['Sasse', 'Ralf', ''], ['Stettler', 'Vincent', '']]","['5G standard', 'authentication protocols', 'AKA protocol', 'symbolicverification', 'formal analysis']"
5052,2204.02643,Valentin Blot,"Valentin Blot, Denis Cousineau, Enzo Crance, Louise Dubois de Prisque,
  Chantal Keller, Assia Mahboubi, Pierre Vial","Compositional pre-processing for automated reasoning in dependent type
  theory",,"Proceedings of the 12th ACM SIGPLAN International Conference on
  Certified Programs and Proofs (CPP '23), January 16-17, 2023, Boston, MA, USA",10.1145/3573105.3575676,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  In the context of interactive theorem provers based on a dependent type
theory, automation tactics (dedicated decision procedures, call of automated
solvers, ...) are often limited to goals which are exactly in some expected
logical fragment. This very often prevents users from applying these tactics in
other contexts, even similar ones.
  This paper discusses the design and the implementation of pre-processing
operations for automating formal proofs in the Coq proof assistant. It presents
the implementation of a wide variety of predictible, atomic goal
transformations, which can be composed in various ways to target different
backends. A gallery of examples illustrates how it helps to expand
significantly the power of automation engines.
","[{'version': 'v1', 'created': 'Wed, 6 Apr 2022 07:56:40 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Oct 2022 15:11:54 GMT'}, {'version': 'v3', 'created': 'Mon, 12 Dec 2022 14:23:03 GMT'}]",2022-12-13,"[['Blot', 'Valentin', ''], ['Cousineau', 'Denis', ''], ['Crance', 'Enzo', ''], ['de Prisque', 'Louise Dubois', ''], ['Keller', 'Chantal', ''], ['Mahboubi', 'Assia', ''], ['Vial', 'Pierre', '']]","['interactive theorem proving', 'Calculus of Inductive Constructions', 'Coq', 'automated reasoning', 'arithmetic', 'pre-processing']"
5053,1808.01459,Alejandro Rodr\'iguez Gonz\'alez,"Eduardo P. Garcia del Valle, Gerardo Lagunes Garcia, Lucia Prieto
  Santamaria, Massimiliano Zanin, Alejandro Rodriguez-Gonzalez, Ernestina
  Menasalvas Ruiz","Evaluating Wikipedia as a source of information for disease
  understanding","6 pages, 5 figures, 5 tables, published at IEEE CBMS 2018, 2018 IEEE
  31st International Symposium on Computer-Based Medical Systems (CBMS)",,10.1109/CBMS.2018.00076,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing availability of biological data is improving our understanding
of diseases and providing new insight into their underlying relationships.
Thanks to the improvements on both text mining techniques and computational
capacity, the combination of biological data with semantic information obtained
from medical publications has proven to be a very promising path. However, the
limitations in the access to these data and their lack of structure pose
challenges to this approach. In this document we propose the use of Wikipedia -
the free online encyclopedia - as a source of accessible textual information
for disease understanding research. To check its validity, we compare its
performance in the determination of relationships between diseases with that of
PubMed, one of the most consulted data sources of medical texts. The obtained
results suggest that the information extracted from Wikipedia is as relevant as
that obtained from PubMed abstracts (i.e. the free access portion of its
articles), although further research is proposed to verify its reliability for
medical studies.
","[{'version': 'v1', 'created': 'Sat, 4 Aug 2018 09:38:31 GMT'}]",2018-08-07,"[['del Valle', 'Eduardo P. Garcia', ''], ['Garcia', 'Gerardo Lagunes', ''], ['Santamaria', 'Lucia Prieto', ''], ['Zanin', 'Massimiliano', ''], ['Rodriguez-Gonzalez', 'Alejandro', ''], ['Ruiz', 'Ernestina Menasalvas', '']]","['Wikipedia', 'disease understanding', 'disease']"
5054,1304.3169,Markus Brill,Haris Aziz and Felix Brandt and Markus Brill,The Computational Complexity of Random Serial Dictatorship,11 pages,"Economics Letters 121(3), 2013",10.1016/j.econlet.2013.09.006,,cs.GT cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In social choice settings with linear preferences, random dictatorship is
known to be the only social decision scheme satisfying strategyproofness and ex
post efficiency. When also allowing indifferences, random serial dictatorship
(RSD) is a well-known generalization of random dictatorship that retains both
properties. RSD has been particularly successful in the special domain of
random assignment where indifferences are unavoidable. While executing RSD is
obviously feasible, we show that computing the resulting probabilities is
#P-complete and thus intractable, both in the context of voting and assignment.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2013 00:17:22 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Apr 2013 13:34:38 GMT'}]",2015-02-06,"[['Aziz', 'Haris', ''], ['Brandt', 'Felix', ''], ['Brill', 'Markus', '']]","['Social choice theory', 'random serial dictatorship', 'computationalcomplexity', 'assignment problem']"
5055,1608.00936,Saad Nadeem,Saad Nadeem and Arie Kaufman,Multimodal Brain Visualization,"SPIE Medical Imaging 2016, Proc. SPIE Medical Imaging: Biomedical
  Applications in Molecular, Structural, and Functional Imaging, 2016","SPIE Medical Imaging, pp. 97881Y-97881Y. 2016",10.1117/12.2217003,,cs.GR q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current connectivity diagrams of human brain image data are either overly
complex or overly simplistic. In this work we introduce simple yet accurate
interactive visual representations of multiple brain image structures and the
connectivity among them. We map cortical surfaces extracted from human brain
magnetic resonance imaging (MRI) data onto 2D surfaces that preserve shape
(angle), extent (area), and spatial (neighborhood) information for 2D (circular
disk) and 3D (spherical) mapping, split these surfaces into separate patches,
and cluster functional and diffusion tractography MRI connections between pairs
of these patches. The resulting visualizations are easier to compute on and
more visually intuitive to interact with than the original data, and facilitate
simultaneous exploration of multiple data sets, modalities, and statistical
maps.
","[{'version': 'v1', 'created': 'Tue, 2 Aug 2016 19:02:40 GMT'}, {'version': 'v2', 'created': 'Sat, 6 Aug 2016 17:01:31 GMT'}, {'version': 'v3', 'created': 'Tue, 9 Aug 2016 19:55:31 GMT'}, {'version': 'v4', 'created': 'Thu, 1 Sep 2016 14:51:28 GMT'}]",2016-09-02,"[['Nadeem', 'Saad', ''], ['Kaufman', 'Arie', '']]","['Brain', 'multimodal', 'visualization', 'tractography', 'statistical maps', 'MRI']"
5056,1512.00082,Syed (Shawon) Rahman,Marc Rader and Shawon Rahman,"Exploring Historical and Emerging Phishing Techniques and Mitigating the
  Associated Security Risks",,,10.5121/ijnsa.2013.5402,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Organizations invest heavily in technical controls for their Information
Assurance (IA) infrastructure. These technical controls mitigate and reduce the
risk of damage caused by outsider attacks. Most organizations rely on training
to mitigate and reduce risk of non-technical attacks such as social
engineering. Organizations lump IA training into small modules that personnel
typically rush through because the training programs lack enough depth and
creativity to keep a trainee engaged. The key to retaining knowledge is making
the information memorable. This paper describes common and emerging attack
vectors and how to lower and mitigate the associated risks.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2015 23:05:03 GMT'}]",2015-12-02,"[['Rader', 'Marc', ''], ['Rahman', 'Shawon', '']]","['Security Risks', 'Phishing', 'Social Engineering', 'Cross Site Scripting', 'Emerging Attack Vectors', 'DNS poising']"
5057,1204.2447,Tam\'as K\'oi,"L\'or\'ant Farkas, Tam\'as K\'oi",On Capacity Regions of Discrete Asynchronous Multiple Access Channels,"It has been presented in part at ISIT 2011, Saint Petersburg. This
  extended version is accepted for publication in Kybernetika",,10.14736/kyb-2014-6-1003,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A general formalization is given for asynchronous multiple access channels
which admits different assumptions on delays. This general framework allows the
analysis of so far unexplored models leading to new interesting capacity
regions. In particular, a single letter characterization is given for the
capacity region in case of 3 senders, 2 synchronous with each other and the
third not synchronous with them.
","[{'version': 'v1', 'created': 'Wed, 11 Apr 2012 13:48:38 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Oct 2013 08:07:36 GMT'}, {'version': 'v3', 'created': 'Sat, 12 Jul 2014 07:25:59 GMT'}]",2015-01-06,"[['Farkas', 'Lóránt', ''], ['Kói', 'Tamás', '']]","['asynchronous', 'partly asynchronous', 'delay', 'multiple-access', 'coding theorem']"
5058,1211.3218,Cm Pintea,"Camelia-M. Pintea, Petrica C. Pop, Mara Hajdu-Macelaru","Classical hybrid approaches on a transportation problem with gas
  emissions constraints","4 pages, 1 figure","Advances in Intelligent Systems and Computing, 188:449-458, 2013",10.1007/978-3-642-32922-7_46,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to keep a green planet, in particular its important to limiting the
pollution with gas emissions. In a specific capacitated fixed-charge
transportation problem with fixed capacities for distribution centers and
customers with particular demands, the objective is to keep the pollution
factor in a given range while the total cost of the transportation is as low as
possible. In order to solve this problem, we developed several hybrid variants
of the nearest neighbor classical approach. The proposed models are analyzed on
a set of instances used in the literature. The preliminary results shows that
the newly approaches are attractive and appropriate for solving the described
transportation problem.
","[{'version': 'v1', 'created': 'Wed, 14 Nov 2012 07:16:29 GMT'}]",2012-11-15,"[['Pintea', 'Camelia-M.', ''], ['Pop', 'Petrica C.', ''], ['Hajdu-Macelaru', 'Mara', '']]","['Hybrid heuristics', 'Transportation Problem', 'Optimization']"
5059,1404.2364,Rashmi Jain,Dr Manju Kaushik and Rashmi Jain,Gesture Based Interaction NUI: An Overview,"4 pages.""Published with International Journal of Engineering Trends
  and Technology (IJETT)""","International Journal of Engineering Trends and Technology (IJETT)
  9(12), March 2014. Published by Seventh Sense Research Group",10.14445/22315381/IJETT-V9P319,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Touch,face,voice recognition and movement sensors all are part of an emerging
field of computing often called natural user interface, or NUI. Interacting
with technology in these humanistic ways is no longer limited to high tech
secret agents. Gesture Touch, face, voice recognition and movement sensors all
are part of an emerging field of computing often called natural user interface,
or NUI. Interacting with technology in these humanistic ways is no longer
limited to high tech secret agents. Gesture recognition is the process by which
gestures formed by a user are made known to the system. In completely immersive
VR environments, the keyboard is generally not included, Technology
incorporates face, voice, gesture, and object recognition to give users a
variety of ways to interact with the console, all without needing a controller.
This paper focuses on the emerging way of human computer interaction, Gesture
recognition concept and gesture types.
","[{'version': 'v1', 'created': 'Wed, 9 Apr 2014 04:43:27 GMT'}]",2014-04-10,"[['Kaushik', 'Dr Manju', ''], ['Jain', 'Rashmi', '']]","['Natural User Interface', 'Gestures Recognition', 'Human Computer Interaction']"
5060,1210.2911,Mahdieh Ghazvini,"Mahdieh Ghazvini, Naser Movahedinia, Kamal Jamshidi",Carrier Sense Multiple Access Tuning Parameters using Game Theory,9 pages,,10.5121/ijwmn.2012.4419,,cs.GT cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ad Hoc and Mesh networks are good samples of multi agent systems, where their
nodes access the channel through carrier sense multiple access method, while a
node channel access influence the access of neighbor nodes to the channel.
Hence, game theory is a strong tool for studying this kind of networks. Carrier
sense multiple access parameters such as minimum and maximum size of contention
window and persistence factor can be modified based on game theoretic methods.
In this study different games for tuning the parameters is investigated and
different challenges are examined.
","[{'version': 'v1', 'created': 'Wed, 10 Oct 2012 13:36:37 GMT'}]",2012-10-11,"[['Ghazvini', 'Mahdieh', ''], ['Movahedinia', 'Naser', ''], ['Jamshidi', 'Kamal', '']]","['Carrier Sense Multiple access', 'Wireless Networks', 'Game Theory']"
5061,1810.11968,Aaron Berk,"Aaron Berk, Yaniv Plan and \""Ozg\""ur Yilmaz",Sensitivity of $\ell_{1}$ minimization to parameter choice,,,10.1093/imaiai/iaaa014,,cs.IT eess.SP math.IT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of generalized LASSO is a common technique for recovery of structured
high-dimensional signals. Each generalized LASSO program has a governing
parameter whose optimal value depends on properties of the data. At this
optimal value, compressed sensing theory explains why LASSO programs recover
structured high-dimensional signals with minimax order-optimal error.
Unfortunately in practice, the optimal choice is generally unknown and must be
estimated. Thus, we investigate stability of each LASSO program with respect to
its governing parameter. Our goal is to aid the practitioner in answering the
following question: given real data, which LASSO program should be used? We
take a step towards answering this by analyzing the case where the measurement
matrix is identity (the so-called proximal denoising setup) and we use
$\ell_{1}$ regularization. For each LASSO program, we specify settings in which
that program is provably unstable with respect to its governing parameter. We
support our analysis with detailed numerical simulations. For example, there
are settings where a 0.1% underestimate of a LASSO parameter can increase the
error significantly; and a 50% underestimate can cause the error to increase by
a factor of $10^{9}$.
","[{'version': 'v1', 'created': 'Mon, 29 Oct 2018 06:03:26 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Apr 2019 05:20:44 GMT'}, {'version': 'v3', 'created': 'Tue, 2 Apr 2019 01:30:57 GMT'}]",2022-08-25,"[['Berk', 'Aaron', ''], ['Plan', 'Yaniv', ''], ['Yilmaz', 'Özgür', '']]","['Parameter instability', 'Sparse proximal denoising', 'LASSO', 'Compressed sensing', 'Convex optimization']"
5062,1911.11468,Ishfaq Hussain,Ishfaq Hussain and Janibul Bashir,"Dynamic MTU : Technique to reduce packet drops in IPv6 network resulted
  due to smaller path mtu size","28 pages, 11 figures. Journal of King Saud University Computer and
  Information Sciences (2021)",,10.1016/j.jksuci.2021.06.011,,cs.NI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  With an increase in the number of internet users and the need to secure
internet traffic, the unreliable IPv4 protocol has been replaced by a more
secure protocol, called IPv6 for Internet system. The IPv6 protocol does not
allow intermediate routers to fragment the on-going IPv6 packet. Moreover, due
to IP tunneling, some extra headers are added to the IPv6 packet, exceeding the
packet size higher than the maximum transmission unit (MTU), resulting in
increase in packet drops. One probable solution is to find the MTU of every
link in advance using the Internet Control Message Protocol (ICMP) packets and
accordingly fragment the packets at the source itself. However, most of the
intermediate routers and the network firewalls do not allow ICMP packets to
traverse through their network, resulting in network black holes, where we
cannot know the MTU of some links in advance. This method tries to handle the
packet drops in IPv6 network by proposing a DMTU scheme where we dynamically
adjust the MTU of each link depending upon the original size of the IPv6
packet, thereby reducing the number of packet drops by a significant amount.
Using mathematical and graphical analysis, our scheme proves to be much more
efficient than the state-of-the-art PMTUD scheme. In this paper the method,
mathematical and graphical representations are focusing solely in IPv6 Internet
communication.
","[{'version': 'v1', 'created': 'Tue, 26 Nov 2019 11:42:33 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Feb 2020 02:54:06 GMT'}, {'version': 'v3', 'created': 'Tue, 1 Sep 2020 16:14:46 GMT'}, {'version': 'v4', 'created': 'Mon, 16 Nov 2020 03:17:06 GMT'}]",2021-07-07,"[['Hussain', 'Ishfaq', ''], ['Bashir', 'Janibul', '']]","['Packet Drop', 'MTU', 'IPv6 Protocol', 'Dynamic MTU', 'PMTUD algorithm', 'path MTU']"
5063,2105.05076,Hasan Abu Rasheed,"H. Abu-Rasheed, C. Weber, J. Zenkert, P. Czerner, R. Krumm, M. Fathi","A Text Extraction-Based Smart Knowledge Graph Composition for
  Integrating Lessons Learned during the Microchip Design",,"In: Arai K., Kapoor S., Bhatia R. (eds) Intelligent Systems and
  Applications. IntelliSys 2020. Advances in Intelligent Systems and Computing,
  vol 1251. Springer, Cham",10.1007/978-3-030-55187-2_43,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  The production of microchips is a complex and thus well documented process.
Therefore, available textual data about the production can be overwhelming in
terms of quantity. This affects the visibility and retrieval of a certain piece
of information when it is most needed. In this paper, we propose a dynamic
approach to interlink the information extracted from multisource
production-relevant documents through the creation of a knowledge graph. This
graph is constructed in order to support searchability and enhance user's
access to large-scale production information. Text mining methods are firstly
utilized to extract data from multiple documentation sources. Document
relations are then mined and extracted for the composition of the knowledge
graph. Graph search functionality is then supported with a recommendation
use-case to enhance users' access to information that is related to the initial
documents. The proposed approach is tailored to and tested on microchip
design-relevant documents. It enhances the visibility and findability of
previous design-failure-cases during the process of a new chip design.
","[{'version': 'v1', 'created': 'Tue, 11 May 2021 14:26:45 GMT'}]",2021-05-12,"[['Abu-Rasheed', 'H.', ''], ['Weber', 'C.', ''], ['Zenkert', 'J.', ''], ['Czerner', 'P.', ''], ['Krumm', 'R.', ''], ['Fathi', 'M.', '']]","['Knowledge Graphs', 'Text Mining', 'Graph-Based Search', 'Lessons Learned', 'Microchip Design']"
5064,1402.0693,Kinjal Shah,"Kinjal N. Shah, Kirit R. Rathod, Shardul J. Agravat",A survey on Human Computer Interaction Mechanism Using Finger Tracking,"4 pages, 8 figures, International Journal of Computer Trends and
  Technology (IJCTT)","IJCTT 7(3):174-177, January 2014",10.14445/22312803/IJCTT-V7P148,,cs.HC,http://creativecommons.org/licenses/by/3.0/,"  Human Computer Interaction (HCI) is a field in which developer makes a user
friendly system. User can interact with a computer system without using any
conventional peripheral devices. Marker is used to recognize hand movement
accurately & successfully. Researchers establish the mechanism to interact with
computer system using computer vision. The interaction is better than normal
static keyboard and mouse. This paper represents most of innovative mechanisms
of the finger tracking used to interact with a computer system using computer
vision.
","[{'version': 'v1', 'created': 'Tue, 4 Feb 2014 11:13:56 GMT'}]",2014-02-05,"[['Shah', 'Kinjal N.', ''], ['Rathod', 'Kirit R.', ''], ['Agravat', 'Shardul J.', '']]","['Finger tracking', 'Human computer Interaction', 'Non conventional Interaction', 'Vision based human computer Interaction']"
5065,2102.07001,Friedhelm Victor,"Friedhelm Victor, Andrea Marie Weintraud","Detecting and Quantifying Wash Trading on Decentralized Cryptocurrency
  Exchanges","Accepted at the Web Conference 2021 (WWW '21) 10 pages, 10 figures",,10.1145/3442381.3449824,,cs.CR econ.GN q-fin.EC,http://creativecommons.org/licenses/by/4.0/,"  Cryptoassets such as cryptocurrencies and tokens are increasingly traded on
decentralized exchanges. The advantage for users is that the funds are not in
custody of a centralized external entity. However, these exchanges are prone to
manipulative behavior. In this paper, we illustrate how wash trading activity
can be identified on two of the first popular limit order book-based
decentralized exchanges on the Ethereum blockchain, IDEX and EtherDelta. We
identify a lower bound of accounts and trading structures that meet the legal
definitions of wash trading, discovering that they are responsible for a wash
trading volume in equivalent of 159 million U.S. Dollars. While self-trades and
two-account structures are predominant, complex forms also occur. We quantify
these activities, finding that on both exchanges, more than 30\% of all traded
tokens have been subject to wash trading activity. On EtherDelta, 10% of the
tokens have almost exclusively been wash traded. All data is made available for
future research. Our findings underpin the need for countermeasures that are
applicable in decentralized systems.
","[{'version': 'v1', 'created': 'Sat, 13 Feb 2021 20:58:48 GMT'}]",2021-02-16,"[['Victor', 'Friedhelm', ''], ['Weintraud', 'Andrea Marie', '']]","['wash trading', 'self-trades', 'measurement', 'crime', 'blockchain']"
5066,1811.11947,Felix Hamza-Lup,"Felix G. Hamza-Lup, Ivan Sopin, Omar Zeidan",Online External Beam Radiation Treatment Simulator,,"International Journal of Computer Assisted Radiology and Surgery
  (2008), Vol. 3(4), pp. 275-281",10.1007/s11548-008-0232-7,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Radiation therapy is an effective and widely accepted form of treatment for
many types of cancer that requires extensive computerized planning.
Unfortunately, current treatment planning systems have limited or no visual aid
that combines patient volumetric models extracted from patient-specific CT data
with the treatment device geometry in a 3D interactive simulation. We
illustrate the potential of 3D simulation in radiation therapy with a web-based
interactive system that combines novel standards and technologies. We discuss
related research efforts in this area and present in detail several components
of the simulator. An objective assessment of the accuracy of the simulator and
a usability study prove the potential of such a system for simulation and
training.
","[{'version': 'v1', 'created': 'Thu, 29 Nov 2018 03:54:30 GMT'}]",2018-11-30,"[['Hamza-Lup', 'Felix G.', ''], ['Sopin', 'Ivan', ''], ['Zeidan', 'Omar', '']]","['external beam radiation therapy', 'distributed training', 'three-dimensional simulation']"
5067,1804.02438,Jin L.C. Guo,"Jin Guo, Jinghui Cheng and Jane Cleland-Huang","Semantically Enhanced Software Traceability Using Deep Learning
  Techniques","2017 IEEE/ACM 39th International Conference on Software Engineering
  (ICSE)",,10.1109/ICSE.2017.9,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In most safety-critical domains the need for traceability is prescribed by
certifying bodies. Trace links are generally created among requirements,
design, source code, test cases and other artifacts, however, creating such
links manually is time consuming and error prone. Automated solutions use
information retrieval and machine learning techniques to generate trace links,
however, current techniques fail to understand semantics of the software
artifacts or to integrate domain knowledge into the tracing process and
therefore tend to deliver imprecise and inaccurate results. In this paper, we
present a solution that uses deep learning to incorporate requirements artifact
semantics and domain knowledge into the tracing solution. We propose a tracing
network architecture that utilizes Word Embedding and Recurrent Neural Network
(RNN) models to generate trace links. Word embedding learns word vectors that
represent knowledge of the domain corpus and RNN uses these word vectors to
learn the sentence semantics of requirements artifacts. We trained 360
different configurations of the tracing network using existing trace links in
the Positive Train Control domain and identified the Bidirectional Gated
Recurrent Unit (BI-GRU) as the best model for the tracing task. BI-GRU
significantly out-performed state-of-the-art tracing methods including the
Vector Space Model and Latent Semantic Indexing.
","[{'version': 'v1', 'created': 'Fri, 6 Apr 2018 19:47:25 GMT'}]",2018-04-10,"[['Guo', 'Jin', ''], ['Cheng', 'Jinghui', ''], ['Cleland-Huang', 'Jane', '']]","['Traceability', 'Deep Learning', 'Recurrent Neural Network', 'Semantic Representation']"
5068,1901.07272,Kai Olav Ellefsen,"Kai Olav Ellefsen, Herman A. Lepikson and Jan C. Albiez","Multiobjective Coverage Path Planning: Enabling Automated Inspection of
  Complex, Real-World Structures",Video Summary available at: https://youtu.be/ESzqJsDusd8,Applied Soft Computing 61 (2017): 264-282,10.1016/j.asoc.2017.07.051,,cs.AI cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An important open problem in robotic planning is the autonomous generation of
3D inspection paths -- that is, planning the best path to move a robot along in
order to inspect a target structure. We recently suggested a new method for
planning paths allowing the inspection of complex 3D structures, given a
triangular mesh model of the structure. The method differs from previous
approaches in its emphasis on generating and considering also plans that result
in imperfect coverage of the inspection target. In many practical tasks, one
would accept imperfections in coverage if this results in a substantially more
energy efficient inspection path. The key idea is using a multiobjective
evolutionary algorithm to optimize the energy usage and coverage of inspection
plans simultaneously - and the result is a set of plans exploring the different
ways to balance the two objectives. We here test our method on a set of
inspection targets with large variation in size and complexity, and compare its
performance with two state-of-the-art methods for complete coverage path
planning. The results strengthen our confidence in the ability of our method to
generate good inspection plans for different types of targets. The method's
advantage is most clearly seen for real-world inspection targets, since
traditional complete coverage methods have no good way of generating plans for
structures with hidden parts. Multiobjective evolution, by optimizing energy
usage and coverage together ensures a good balance between the two - both when
100% coverage is feasible, and when large parts of the object are hidden.
","[{'version': 'v1', 'created': 'Tue, 22 Jan 2019 11:42:41 GMT'}]",2019-01-23,"[['Ellefsen', 'Kai Olav', ''], ['Lepikson', 'Herman A.', ''], ['Albiez', 'Jan C.', '']]","['Coverage Path Planning', 'Multiobjective Evolutionary Algorithm', 'Robotic Inspection']"
5069,1403.1757,{\L}ukasz D\k{e}bowski,{\L}ukasz D\c{e}bowski,Hilberg Exponents: New Measures of Long Memory in the Process,22 pages,"IEEE Transactions on Information Theory 61(10):5716-5726, 2015",10.1109/TIT.2015.2470675,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper concerns the rates of power-law growth of mutual information
computed for a stationary measure or for a universal code. The rates are called
Hilberg exponents and four such quantities are defined for each measure and
each code: two random exponents and two expected exponents. A particularly
interesting case arises for conditional algorithmic mutual information. In this
case, the random Hilberg exponents are almost surely constant on ergodic
sources and are bounded by the expected Hilberg exponents. This property is a
""second-order"" analogue of the Shannon-McMillan-Breiman theorem, proved without
invoking the ergodic theorem. It carries over to Hilberg exponents for the
underlying probability measure via Shannon-Fano coding and Barron inequality.
Moreover, the expected Hilberg exponents can be linked for different universal
codes. Namely, if one code dominates another, the expected Hilberg exponents
are greater for the former than for the latter. The paper is concluded by an
evaluation of Hilberg exponents for certain sources such as the mixture
Bernoulli process and the Santa Fe processes.
","[{'version': 'v1', 'created': 'Fri, 7 Mar 2014 14:08:50 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Mar 2014 11:36:36 GMT'}, {'version': 'v3', 'created': 'Tue, 21 Jul 2015 10:18:54 GMT'}]",2020-03-11,"[['Dȩbowski', 'Łukasz', '']]","['mutual information', 'universal coding', 'Kolmogorov complexity', 'ergodic processes']"
5070,2107.11508,William Sleeman Iv,William C. Sleeman IV and Bartosz Krawczyk,"Imbalanced Big Data Oversampling: Taxonomy, Algorithms, Software,
  Guidelines and Future Directions","52 pages, 9 tables, 13 figures, 15 algorithms",ACM Comput. Surv. (June 2022),10.1145/3543848,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Learning from imbalanced data is among the most challenging areas in
contemporary machine learning. This becomes even more difficult when considered
the context of big data that calls for dedicated architectures capable of
high-performance processing. Apache Spark is a highly efficient and popular
architecture, but it poses specific challenges for algorithms to be implemented
for it. While oversampling algorithms are an effective way for handling class
imbalance, they have not been designed for distributed environments. In this
paper, we propose a holistic look on oversampling algorithms for imbalanced big
data. We discuss the taxonomy of oversampling algorithms and their mechanisms
used to handle skewed class distributions. We introduce a Spark library with 14
state-of-the-art oversampling algorithms implemented and evaluate their
efficacy via extensive experimental study. Using binary and multi-class massive
data sets, we analyze the effectiveness of oversampling algorithms and their
relationships with different types of classifiers. We evaluate the trade-off
between accuracy and time complexity of oversampling algorithms, as well as
their scalability when increasing the size of data. This allows us to gain
insight into the usefulness of specific components of oversampling algorithms
for big data, as well as formulate guidelines and recommendations for designing
future resampling approaches for massive imbalanced data. Our library can be
downloaded from https://github.com/fsleeman/spark-class-balancing.git.
","[{'version': 'v1', 'created': 'Sat, 24 Jul 2021 01:49:46 GMT'}]",2022-11-16,"[['Sleeman', 'William C.', 'IV'], ['Krawczyk', 'Bartosz', '']]","['Machine learning', 'Big data', 'Imbalanced data classification', 'Oversampling', 'Spark', 'MapReduce']"
5071,2211.10030,Qinggang Zhang,"Qinggang Zhang, Junnan Dong, Keyu Duan, Xiao Huang, Yezi Liu, Linchuan
  Xu",Contrastive Knowledge Graph Error Detection,,"CIKM 2022: Proceedings of the 31st ACM International Conference on
  Information & Knowledge Management",10.1145/3511808.3557264,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge Graph (KG) errors introduce non-negligible noise, severely
affecting KG-related downstream tasks. Detecting errors in KGs is challenging
since the patterns of errors are unknown and diverse, while ground-truth labels
are rare or even unavailable. A traditional solution is to construct logical
rules to verify triples, but it is not generalizable since different KGs have
distinct rules with domain knowledge involved. Recent studies focus on
designing tailored detectors or ranking triples based on KG embedding loss.
However, they all rely on negative samples for training, which are generated by
randomly replacing the head or tail entity of existing triples. Such a negative
sampling strategy is not enough for prototyping practical KG errors, e.g.,
(Bruce_Lee, place_of_birth, China), in which the three elements are often
relevant, although mismatched. We desire a more effective unsupervised learning
mechanism tailored for KG error detection. To this end, we propose a novel
framework - ContrAstive knowledge Graph Error Detection (CAGED). It introduces
contrastive learning into KG learning and provides a novel way of modeling KG.
Instead of following the traditional setting, i.e., considering entities as
nodes and relations as semantic edges, CAGED augments a KG into different
hyper-views, by regarding each relational triple as a node. After joint
training with KG embedding and contrastive learning loss, CAGED assesses the
trustworthiness of each triple based on two learning signals, i.e., the
consistency of triple representations across multi-views and the
self-consistency within the triple. Extensive experiments on three real-world
KGs show that CAGED outperforms state-of-the-art methods in KG error detection.
Our codes and datasets are available at https://github.com/Qing145/CAGED.git.
","[{'version': 'v1', 'created': 'Fri, 18 Nov 2022 05:01:19 GMT'}]",2022-11-21,"[['Zhang', 'Qinggang', ''], ['Dong', 'Junnan', ''], ['Duan', 'Keyu', ''], ['Huang', 'Xiao', ''], ['Liu', 'Yezi', ''], ['Xu', 'Linchuan', '']]","['Knowledge graph', 'anomaly detection', 'contrastive learning']"
5072,2108.11826,Yixiao Guo,"Yixiao Guo, Jiawei Liu, Guo Li, Luo Mai, Hao Dong",Fast and Flexible Human Pose Estimation with HyperPose,"4 pages, 1 figure. Published in ACM Multimedia","Proceedings of the 29th ACM International Conference on
  Multimedia, 2021, 3763-3766",10.1145/3474085.3478325,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Estimating human pose is an important yet challenging task in multimedia
applications. Existing pose estimation libraries target reproducing standard
pose estimation algorithms. When it comes to customising these algorithms for
real-world applications, none of the existing libraries can offer both the
flexibility of developing custom pose estimation algorithms and the
high-performance of executing these algorithms on commodity devices. In this
paper, we introduce Hyperpose, a novel flexible and high-performance pose
estimation library. Hyperpose provides expressive Python APIs that enable
developers to easily customise pose estimation algorithms for their
applications. It further provides a model inference engine highly optimised for
real-time pose estimation. This engine can dynamically dispatch carefully
designed pose estimation tasks to CPUs and GPUs, thus automatically achieving
high utilisation of hardware resources irrespective of deployment environments.
Extensive evaluation results show that Hyperpose can achieve up to 3.1x~7.3x
higher pose estimation throughput compared to state-of-the-art pose estimation
libraries without compromising estimation accuracy. By 2021, Hyperpose has
received over 1000 stars on GitHub and attracted users from both industry and
academy.
","[{'version': 'v1', 'created': 'Thu, 26 Aug 2021 14:51:24 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Oct 2022 08:05:49 GMT'}]",2022-10-27,"[['Guo', 'Yixiao', ''], ['Liu', 'Jiawei', ''], ['Li', 'Guo', ''], ['Mai', 'Luo', ''], ['Dong', 'Hao', '']]","['Pose Estimation', 'Computer Vision', 'High-performance Computing']"
5073,1605.06013,Inga Ivanova,"Inga Ivanova, Oivind Strand, Loet Leydesdorff","What is the effect of synergy in international collaboration on regional
  economies?",,Journal of the Knowledge Economy 10(1) (2019) 18-34,10.1007/s13132-017-0480-2,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze the effects of relative increments of mutual information among the
geographical, technological, and organizational distributions of firms on the
relative augmentation of regional summary turnover in terms of synergies. How
do increases in synergy in international cooperation affect regional turnover?
The methodological contribution of this study is that we translate the synergy
(abstractly measured in bits of information) into more familiar economic terms,
such as turnover for the special case of domestic-foreign collaborations. The
analysis is based on Norwegian data, as Norway is a small country with an open
and export-oriented economy. Data for Norway is publicly available in great
detail.
","[{'version': 'v1', 'created': 'Thu, 19 May 2016 15:40:35 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Oct 2016 10:47:51 GMT'}]",2019-12-18,"[['Ivanova', 'Inga', ''], ['Strand', 'Oivind', ''], ['Leydesdorff', 'Loet', '']]","['Triple Helix', 'synergy', 'international cooperation', 'regional economy', 'measurement']"
5074,1407.6836,Guido F.  Montufar,"Guido Montufar, Keyan Ghazi-Zahedi, Nihat Ay",A Theory of Cheap Control in Embodied Systems,"27 pages, 10 figures",,10.1371/journal.pcbi.1004427,,cs.SY cs.RO math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a framework for designing cheap control architectures for embodied
agents. Our derivation is guided by the classical problem of universal
approximation, whereby we explore the possibility of exploiting the agent's
embodiment for a new and more efficient universal approximation of behaviors
generated by sensorimotor control. This embodied universal approximation is
compared with the classical non-embodied universal approximation. To exemplify
our approach, we present a detailed quantitative case study for policy models
defined in terms of conditional restricted Boltzmann machines. In contrast to
non-embodied universal approximation, which requires an exponential number of
parameters, in the embodied setting we are able to generate all possible
behaviors with a drastically smaller model, thus obtaining cheap universal
approximation. We test and corroborate the theory experimentally with a
six-legged walking machine. The experiments show that the sufficient controller
complexity predicted by our theory is tight, which means that the theory has
direct practical implications. Keywords: cheap design, embodiment, sensorimotor
loop, universal approximation, conditional restricted Boltzmann machine
","[{'version': 'v1', 'created': 'Fri, 25 Jul 2014 09:56:09 GMT'}, {'version': 'v2', 'created': 'Sat, 15 Nov 2014 05:33:24 GMT'}]",2016-02-17,"[['Montufar', 'Guido', ''], ['Ghazi-Zahedi', 'Keyan', ''], ['Ay', 'Nihat', '']]","['cheap design', 'embodiment', 'sensorimotor loop', 'universal approximation', 'conditionalrestricted Boltzmann machine']"
5075,1403.3131,Harika As{\i}l{\i} HA,Harika Asili and Omer Ozgur Tanriover,"Comparison Of Document Management Systems By Meta Modelling And
  Workforce Centric Tuning Measures","11 pages , 2 figures and 2 tables , journal paper","International Journal of Computer Science, Engineering and
  Information Technology (IJCSEIT), Vol. 4,No. 1, February 2014",10.5121/ijcseit.2014.4106,,cs.SE cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Document management software are used widely for office paper management and
related workflows. However, they have some differences from a flexibility
perspective for the needs of workers. Moreover, they also differentiate in
their underlying conceptual design. In this paper, a set (eight) of widely used
document management systems are chosen from internet reviews [5] [6] and their
conceptual models are analysed with meta modeling and flexibility tuning
measures. The main objective is to compare these systems by analyzing their
human-orientation and flexibility. This analysis provides useful information
for organizations especially looking for document management systems which are
more workforce centric.
","[{'version': 'v1', 'created': 'Wed, 12 Mar 2014 23:09:54 GMT'}]",2014-03-14,"[['Asili', 'Harika', ''], ['Tanriover', 'Omer Ozgur', '']]","['document management systems', 'flexibility in business processes', 'meta models comparison', 'workforce tuning measures']"
5076,1711.01519,Zahra Khatami,"Zahra Khatami and Lukas Troska and Hartmut Kaiser and J. Ramanujam and
  Adrian Serio",HPX Smart Executors,"In Proceedings of ESPM2'17: Third International Workshop on Extreme
  Scale Programming Models and Middleware, Denver, CO, USA, November
  12-17,,2017 (ESPM2'17), 8 pages",,10.1145/3152041.3152084,,cs.DC cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The performance of many parallel applications depends on loop-level
parallelism. However, manually parallelizing all loops may result in degrading
parallel performance, as some of them cannot scale desirably to a large number
of threads. In addition, the overheads of manually tuning loop parameters might
prevent an application from reaching its maximum parallel performance. We
illustrate how machine learning techniques can be applied to address these
challenges. In this research, we develop a framework that is able to
automatically capture the static and dynamic information of a loop. Moreover,
we advocate a novel method by introducing HPX smart executors for determining
the execution policy, chunk size, and prefetching distance of an HPX loop to
achieve higher possible performance by feeding static information captured
during compilation and runtime-based dynamic information to our learning model.
Our evaluated execution results show that using these smart executors can speed
up the HPX execution process by around 12%-35% for the Matrix Multiplication,
Stream and $2D$ Stencil benchmarks compared to setting their HPX loop's
execution policy/parameters manually or using HPX auto-parallelization
techniques.
","[{'version': 'v1', 'created': 'Sun, 5 Nov 2017 02:11:07 GMT'}]",2017-11-07,"[['Khatami', 'Zahra', ''], ['Troska', 'Lukas', ''], ['Kaiser', 'Hartmut', ''], ['Ramanujam', 'J.', ''], ['Serio', 'Adrian', '']]","['HPX', 'Logistic Regression Model', 'ClangTool']"
5077,1202.5094,Soumen  Kanrar,Soumen Kanrar,Analysis and implementation of the Large Scale Video-on-Demand System,"9 pages, 8 figures","International Journal of Applied Information Systems (IJAIS) -
  ISSN :2249-0868 Volume 1- No.4, 2012",10.5120/ijais12-450168,,cs.NI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Next Generation Network (NGN) provides multimedia services over broadband
based networks, which supports high definition TV (HDTV), and DVD quality
video-on-demand content. The video services are thus seen as merging mainly
three areas such as computing, communication, and broadcasting. It has numerous
advantages and more exploration for the large-scale deployment of
video-on-demand system is still needed. This is due to its economic and design
constraints. It's need significant initial investments for full service
provision. This paper presents different estimation for the different
topologies and it require efficient planning for a VOD system network. The
methodology investigates the network bandwidth requirements of a VOD system
based on centralized servers, and distributed local proxies. Network traffic
models are developed to evaluate the VOD system's operational bandwidth
requirements for these two network architectures. This paper present an
efficient estimation of the of the bandwidth requirement for the different
architectures.
","[{'version': 'v1', 'created': 'Thu, 23 Feb 2012 06:25:16 GMT'}]",2012-02-24,"[['Kanrar', 'Soumen', '']]","['Video on demand System', 'Traffic', 'Computation', 'broadcast']"
5078,0904.2921,Sidharth Jaggi,"Amir-Hamed Mohsenian-Rad, Jianwei Huang, Vincent W.S. Wong, Sidharth
  Jaggi, and Robert Schober","Inter-Session Network Coding with Strategic Users: A Game-Theoretic
  Analysis of Network Coding","50 pages. To be presented at ICC 2009. Submitted to IEEE Transactions
  on IT",,10.1109/TCOMM.2013.021413.110555,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A common assumption in the existing network coding literature is that the
users are cooperative and non-selfish. However, this assumption can be violated
in practice. In this paper, we analyze inter-session network coding in a wired
network using game theory. We assume selfish users acting strategically to
maximize their own utility, leading to a resource allocation game among users.
In particular, we study the well-known butterfly network topology where a
bottleneck link is shared by several network coding and routing flows. We prove
the existence of a Nash equilibrium for a wide range of utility functions. We
show that the number of Nash equilibria can be large (even infinite) for
certain choices of system parameters. This is in sharp contrast to a similar
game setting with traditional packet forwarding where the Nash equilibrium is
always unique. We then characterize the worst-case efficiency bounds, i.e., the
Price-of-Anarchy (PoA), compared to an optimal and cooperative network design.
We show that by using a novel discriminatory pricing scheme which charges
encoded and forwarded packets differently, we can improve the PoA. However,
regardless of the discriminatory pricing scheme being used, the PoA is still
worse than for the case when network coding is not applied. This implies that,
although inter-session network coding can improve performance compared to
ordinary routing, it is significantly more sensitive to users' strategic
behaviour. For example, in a butterfly network where the side links have zero
cost, the efficiency can be as low as 25%. If the side links have non-zero
cost, then the efficiency can further reduce to only 20%. These results
generalize the well-known result of guaranteed 67% worst-case efficiency for
traditional packet forwarding networks.
","[{'version': 'v1', 'created': 'Sun, 19 Apr 2009 14:47:09 GMT'}]",2016-11-17,"[['Mohsenian-Rad', 'Amir-Hamed', ''], ['Huang', 'Jianwei', ''], ['Wong', 'Vincent W. S.', ''], ['Jaggi', 'Sidharth', ''], ['Schober', 'Robert', '']]","['Inter-session network coding', 'butterfly network', 'resource management', 'game theory', 'Nash']"
5079,1811.00217,Rafael Menelau Oliveira E Cruz,"Rafael M. O Cruz, Robert Sabourin and George D. C. Cavalcanti","META-DES.Oracle: Meta-learning and feature selection for ensemble
  selection",Paper published on Information Fusion,"Volume 38, November 2017, Pages 84-103",10.1016/j.inffus.2017.02.010,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The key issue in Dynamic Ensemble Selection (DES) is defining a suitable
criterion for calculating the classifiers' competence. There are several
criteria available to measure the level of competence of base classifiers, such
as local accuracy estimates and ranking. However, using only one criterion may
lead to a poor estimation of the classifier's competence. In order to deal with
this issue, we have proposed a novel dynamic ensemble selection framework using
meta-learning, called META-DES. An important aspect of the META-DES framework
is that multiple criteria can be embedded in the system encoded as different
sets of meta-features. However, some DES criteria are not suitable for every
classification problem. For instance, local accuracy estimates may produce poor
results when there is a high degree of overlap between the classes. Moreover, a
higher classification accuracy can be obtained if the performance of the
meta-classifier is optimized for the corresponding data. In this paper, we
propose a novel version of the META-DES framework based on the formal
definition of the Oracle, called META-DES.Oracle. The Oracle is an abstract
method that represents an ideal classifier selection scheme. A meta-feature
selection scheme using an overfitting cautious Binary Particle Swarm
Optimization (BPSO) is proposed for improving the performance of the
meta-classifier. The difference between the outputs obtained by the
meta-classifier and those presented by the Oracle is minimized. Thus, the
meta-classifier is expected to obtain results that are similar to the Oracle.
Experiments carried out using 30 classification problems demonstrate that the
optimization procedure based on the Oracle definition leads to a significant
improvement in classification accuracy when compared to previous versions of
the META-DES framework and other state-of-the-art DES techniques.
","[{'version': 'v1', 'created': 'Thu, 1 Nov 2018 04:20:28 GMT'}]",2018-11-02,"[['Cruz', 'Rafael M. O', ''], ['Sabourin', 'Robert', ''], ['Cavalcanti', 'George D. C.', '']]","['Ensemble of Classifiers', 'Dynamic Ensemble Selection', 'Meta-Learning', 'Particle Swarm']"
5080,1902.10799,Hung Nguyen,"Hung Nguyen, Di Zhuang, Pei-Yuan Wu, Morris Chang",AutoGAN-based Dimension Reduction for Privacy Preservation,,Published in Neurocomputing 2020,10.1016/j.neucom.2019.12.002,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Protecting sensitive information against data exploiting attacks is an
emerging research area in data mining. Over the past, several different methods
have been introduced to protect individual privacy from such attacks while
maximizing data-utility of the application. However, these existing techniques
are not sufficient to effectively protect data owner privacy, especially in the
scenarios that utilize visualizable data (e.g. images, videos) or the
applications that require heavy computations for implementation. To address
these problems, we propose a new dimension reduction-based method for privacy
preservation. Our method generates dimension-reduced data for performing
machine learning tasks and prevents a strong adversary from reconstructing the
original data. We first introduce a theoretical approach to evaluate dimension
reduction-based privacy preserving mechanisms, then propose a non-linear
dimension reduction framework motivated by state-of-the-art neural network
structures for privacy preservation. We conducted experiments over three
different face image datasets (AT&T, YaleB, and CelebA), and the results show
that when the number of dimensions is reduced to seven, we can achieve the
accuracies of 79%, 80%, and 73% respectively and the reconstructed images are
not recognizable to naked human eyes.
","[{'version': 'v1', 'created': 'Wed, 27 Feb 2019 21:52:20 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Jul 2021 23:27:11 GMT'}]",2021-07-29,"[['Nguyen', 'Hung', ''], ['Zhuang', 'Di', ''], ['Wu', 'Pei-Yuan', ''], ['Chang', 'Morris', '']]","['Generative Adversarial Nets', 'Auto-encoder', 'neural-network', 'privacy preservation', 'dimension reduction', 'access control']"
5081,1805.11371,Jos\'e Halloy,"Leo Cazenille, Yohann Chemtob, Frank Bonnet, Alexey Gribovskiy,
  Francesco Mondada, Nicolas Bredeche, Jose Halloy","How to Blend a Robot within a Group of Zebrafish: Achieving Social
  Acceptance through Real-time Calibration of a Multi-level Behavioural Model","9 pages, 3 figures",,10.1007/978-3-319-95972-6_9,,cs.NE cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We have previously shown how to socially integrate a fish robot into a group
of zebrafish thanks to biomimetic behavioural models. The models have to be
calibrated on experimental data to present correct behavioural features. This
calibration is essential to enhance the social integration of the robot into
the group. When calibrated, the behavioural model of fish behaviour is
implemented to drive a robot with closed-loop control of social interactions
into a group of zebrafish. This approach can be useful to form mixed-groups,
and study animal individual and collective behaviour by using biomimetic
autonomous robots capable of responding to the animals in long-standing
experiments. Here, we show a methodology for continuous real-time calibration
and refinement of multi-level behavioural model. The real-time calibration, by
an evolutionary algorithm, is based on simulation of the model to correspond to
the observed fish behaviour in real-time. The calibrated model is updated on
the robot and tested during the experiments. This method allows to cope with
changes of dynamics in fish behaviour. Moreover, each fish presents individual
behavioural differences. Thus, each trial is done with naive fish groups that
display behavioural variability. This real-time calibration methodology can
optimise the robot behaviours during the experiments. Our implementation of
this methodology runs on three different computers that perform individual
tracking, data-analysis, multi-objective evolutionary algorithms, simulation of
the fish robot and adaptation of the robot behavioural models, all in
real-time.
","[{'version': 'v1', 'created': 'Tue, 29 May 2018 11:59:04 GMT'}]",2019-02-12,"[['Cazenille', 'Leo', ''], ['Chemtob', 'Yohann', ''], ['Bonnet', 'Frank', ''], ['Gribovskiy', 'Alexey', ''], ['Mondada', 'Francesco', ''], ['Bredeche', 'Nicolas', ''], ['Halloy', 'Jose', '']]","['collective behaviour', 'real-time model fitting', 'evolutionary algorithms', 'decision-making', 'multilevel model', 'zebrafish', 'robot', 'biohybrid system']"
5082,1212.3441,Andrew Adamatzky,"Gerard Howard, Ella Gale, Larry Bull, Ben de Lacy Costello, Andy
  Adamatzky","Evolution of Plastic Learning in Spiking Networks via Memristive
  Connections",,IEEE Trans Evolutionary Computation 16 (2012) 711--729,10.1109/TEVC.2011.2170199,,cs.ET cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents a spiking neuroevolutionary system which implements
memristors as plastic connections, i.e. whose weights can vary during a trial.
The evolutionary design process exploits parameter self-adaptation and variable
topologies, allowing the number of neurons, connection weights, and
inter-neural connectivity pattern to emerge. By comparing two phenomenological
real-world memristor implementations with networks comprised of (i) linear
resistors (ii) constant-valued connections, we demonstrate that this approach
allows the evolution of networks of appropriate complexity to emerge whilst
exploiting the memristive properties of the connections to reduce learning
time. We extend this approach to allow for heterogeneous mixtures of memristors
within the networks; our approach provides an in-depth analysis of network
structure. Our networks are evaluated on simulated robotic navigation tasks;
results demonstrate that memristive plasticity enables higher performance than
constant-weighted connections in both static and dynamic reward scenarios, and
that mixtures of memristive elements provide performance advantages when
compared to homogeneous memristive networks.
","[{'version': 'v1', 'created': 'Fri, 14 Dec 2012 11:00:55 GMT'}]",2012-12-17,"[['Howard', 'Gerard', ''], ['Gale', 'Ella', ''], ['Bull', 'Larry', ''], ['Costello', 'Ben de Lacy', ''], ['Adamatzky', 'Andy', '']]","['Memristors', 'Genetic Algorithms', 'Neurocontrollers', 'Hebbian Theory']"
5083,1803.05847,Lingxiao Wei,"Lingxiao Wei, Bo Luo, Yu Li, Yannan Liu and Qiang Xu","I Know What You See: Power Side-Channel Attack on Convolutional Neural
  Network Accelerators",,,10.1145/3274694.3274696,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning has become the de-facto computational paradigm for various
kinds of perception problems, including many privacy-sensitive applications
such as online medical image analysis. No doubt to say, the data privacy of
these deep learning systems is a serious concern. Different from previous
research focusing on exploiting privacy leakage from deep learning models, in
this paper, we present the first attack on the implementation of deep learning
models. To be specific, we perform the attack on an FPGA-based convolutional
neural network accelerator and we manage to recover the input image from the
collected power traces without knowing the detailed parameters in the neural
network. For the MNIST dataset, our power side-channel attack is able to
achieve up to 89% recognition accuracy.
","[{'version': 'v1', 'created': 'Mon, 5 Mar 2018 11:35:14 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Nov 2019 15:11:58 GMT'}]",2019-12-02,"[['Wei', 'Lingxiao', ''], ['Luo', 'Bo', ''], ['Li', 'Yu', ''], ['Liu', 'Yannan', ''], ['Xu', 'Qiang', '']]","['Power side-channel attack', 'convolutional neural accelerators', 'privacy leakage']"
5084,1311.0842,Mayukh Mukhopadhyay,Mayukh Mukhopadhyay and Om Ranjan,An Intuitive Design Approach For Implementing Real Time Audio Effects,"12 pages,11 figures,4 tables,24 equations,9 references","International Journal of Advances in Engineering & Technology
  (IJAET), Volume 6 Issue 5(29), pp. 2216-2227, Nov. 2013",10.7323/ijaet/v6_iss5,,cs.SD,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Audio effect implementation on random musical signal is a basic application
of digital signal processors. In this paper, the compatibility features of
MATLAB R2008a with Code Composer Studio 3.3 has been exploited to develop
Simulink models which when emulated on TMS320C6713 DSK generate real time audio
effects. Each design has been done by two different asynchronous scheduling
techniques: (i) Idle task Scheduling and (ii) DSP/BIOS task Scheduling. A basic
COCOMO analysis has been done for the generated code to justify the industrial
viability of this design approach.
  KEYWORDS: Musical signal processing, Real time Audio effects, Echo, Stress
Generation, Reverberation, Reverberated Chorus, Real Time Scheduling.
","[{'version': 'v1', 'created': 'Mon, 4 Nov 2013 20:43:47 GMT'}]",2013-11-05,"[['Mukhopadhyay', 'Mayukh', ''], ['Ranjan', 'Om', '']]","['Musical signal processing', 'Real time Audio effects', 'Echo', 'Stress Generation', 'Reverberation', 'Reverberated Chorus', 'Real Time Scheduling']"
5085,1812.04199,Haruna Isah,"Dev Shah, Haruna Isah, Farhana Zulkernine",Predicting the Effects of News Sentiments on the Stock Market,4 pages,,10.1109/BigData.2018.8621884,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stock market forecasting is very important in the planning of business
activities. Stock price prediction has attracted many researchers in multiple
disciplines including computer science, statistics, economics, finance, and
operations research. Recent studies have shown that the vast amount of online
information in the public domain such as Wikipedia usage pattern, news stories
from the mainstream media, and social media discussions can have an observable
effect on investors opinions towards financial markets. The reliability of the
computational models on stock market prediction is important as it is very
sensitive to the economy and can directly lead to financial loss. In this
paper, we retrieved, extracted, and analyzed the effects of news sentiments on
the stock market. Our main contributions include the development of a sentiment
analysis dictionary for the financial sector, the development of a
dictionary-based sentiment analysis model, and the evaluation of the model for
gauging the effects of news sentiments on stocks for the pharmaceutical market.
Using only news sentiments, we achieved a directional accuracy of 70.59% in
predicting the trends in short-term stock price movement.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2018 03:06:02 GMT'}]",2019-07-23,"[['Shah', 'Dev', ''], ['Isah', 'Haruna', ''], ['Zulkernine', 'Farhana', '']]","['dictionary comparison', 'financial market', 'news articles', 'sentiment analysis', 'stock price prediction']"
5086,1511.08552,Mark Bun,Mark Bun and Kobbi Nissim and Uri Stemmer,Simultaneous Private Learning of Multiple Concepts,29 pages. To appear in ITCS '16,,10.1145/2840728.2840747,,cs.DS cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the direct-sum problem in the context of differentially
private PAC learning: What is the sample complexity of solving $k$ learning
tasks simultaneously under differential privacy, and how does this cost compare
to that of solving $k$ learning tasks without privacy? In our setting, an
individual example consists of a domain element $x$ labeled by $k$ unknown
concepts $(c_1,\ldots,c_k)$. The goal of a multi-learner is to output $k$
hypotheses $(h_1,\ldots,h_k)$ that generalize the input examples.
  Without concern for privacy, the sample complexity needed to simultaneously
learn $k$ concepts is essentially the same as needed for learning a single
concept. Under differential privacy, the basic strategy of learning each
hypothesis independently yields sample complexity that grows polynomially with
$k$. For some concept classes, we give multi-learners that require fewer
samples than the basic strategy. Unfortunately, however, we also give lower
bounds showing that even for very simple concept classes, the sample cost of
private multi-learning must grow polynomially in $k$.
","[{'version': 'v1', 'created': 'Fri, 27 Nov 2015 03:57:22 GMT'}]",2015-11-30,"[['Bun', 'Mark', ''], ['Nissim', 'Kobbi', ''], ['Stemmer', 'Uri', '']]","['differential privacy', 'PAC learning', 'agnostic learning', 'direct-sum']"
5087,1608.05543,KitIan Kou,"Kit Ian Kou, Yan Yang, Cuiming Zou","Uncertainty Principle for Measurable Sets and Signal Recovery in
  Quaternion Domains","10 pages, 3 figures",,10.1002/mma.4271,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The classical uncertainty principle of harmonic analysis states that a
nontrivial function and its Fourier transform cannot both be sharply localized.
It plays an important role in signal processing and physics. This paper
generalizes the uncertainty principle for measurable sets from complex domain
to hypercomplex domain using quaternion algebras, associated with the
Quaternion Fourier transform. The performance is then evaluated in signal
recovery problems where there is an interplay of missing and time-limiting
data.
","[{'version': 'v1', 'created': 'Fri, 19 Aug 2016 09:23:24 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Dec 2016 08:00:13 GMT'}]",2017-08-02,"[['Kou', 'Kit Ian', ''], ['Yang', 'Yan', ''], ['Zou', 'Cuiming', '']]","['signal recovery', 'uncertainty principle', 'Quaternion Fourier transform']"
5088,1309.1272,EPTCS,"Simon Martiel (Universit\'e Nice Sophia Antipolis), Bruno Martin
  (Universit\'e Nice Sophia Antipolis)",Intrinsic Universality of Causal Graph Dynamics,"In Proceedings MCU 2013, arXiv:1309.1043","EPTCS 128, 2013, pp. 137-149",10.4204/EPTCS.128.19,,cs.DM cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Causal graph dynamics are transformations over graphs that capture two
important symmetries of physics, namely causality and homogeneity. They can be
equivalently defined as continuous and translation invariant transformations or
functions induced by a local rule applied simultaneously on every vertex of the
graph. Intrinsic universality is the ability of an instance of a model to
simulate every other instance of the model while preserving the structure of
the computation at every step of the simulation. In this work we present the
construction of a family of intrinsically universal instances of causal graphs
dynamics, each instance being able to simulate a subset of instances.
","[{'version': 'v1', 'created': 'Thu, 5 Sep 2013 08:08:04 GMT'}]",2013-09-06,"[['Martiel', 'Simon', '', 'Université Nice Sophia Antipolis'], ['Martin', 'Bruno', '', 'Université Nice Sophia Antipolis']]","['Parallel graph transformations', 'Causal Graph Dynamics', 'Generalized Cayley Graphs', 'Intrinsic Universality', 'Intrinsic Simulation', 'Universality']"
5089,1705.00442,Elvin Isufi,"Elvin Isufi, Andreas Loukas, Andrea Simonetto, Geert Leus",Filtering Random Graph Processes Over Random Time-Varying Graphs,,"IEEE Transactions on Signal Processing, vol. 65 (16), pages 4406 -
  4421, 2017",10.1109/TSP.2017.2706186,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph filters play a key role in processing the graph spectra of signals
supported on the vertices of a graph. However, despite their widespread use,
graph filters have been analyzed only in the deterministic setting, ignoring
the impact of stochastic- ity in both the graph topology as well as the signal
itself. To bridge this gap, we examine the statistical behavior of the two key
filter types, finite impulse response (FIR) and autoregressive moving average
(ARMA) graph filters, when operating on random time- varying graph signals (or
random graph processes) over random time-varying graphs. Our analysis shows
that (i) in expectation, the filters behave as the same deterministic filters
operating on a deterministic graph, being the expected graph, having as input
signal a deterministic signal, being the expected signal, and (ii) there are
meaningful upper bounds for the variance of the filter output. We conclude the
paper by proposing two novel ways of exploiting randomness to improve (joint
graph-time) noise cancellation, as well as to reduce the computational
complexity of graph filtering. As demonstrated by numerical results, these
methods outperform the disjoint average and denoise algorithm, and yield a (up
to) four times complexity redution, with very little difference from the
optimal solution.
","[{'version': 'v1', 'created': 'Mon, 1 May 2017 08:28:34 GMT'}]",2017-09-18,"[['Isufi', 'Elvin', ''], ['Loukas', 'Andreas', ''], ['Simonetto', 'Andrea', ''], ['Leus', 'Geert', '']]","['signal processing on graphs', 'graph filters', 'random graphs', 'random graph signals', 'graph signal denoising', 'graph sparsification']"
5090,1106.2077,Sylvain Lavernhe,"Yann Quinsat (LURPA), Sylvain Lavernhe (LURPA), Claire Lartigue
  (LURPA)",Characterization of 3D surface topography in 5-axis milling,,"Wear 271, 3-4 (2010) 590-595",10.1016/j.wear.2010.05.014,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Within the context of 5-axis free-form machining, CAM software offers various
ways of tool-path generation, depending on the geometry of the surface to be
machined. Therefore, as the manufactured surface quality results from the
choice of the machining strategy and machining parameters, the prediction of
surface roughness in function of the machining conditions is an important issue
in 5-axis machining. The objective of this paper is to propose a simulation
model of material removal in 5-axis based on the N-buffer method and
integrating the Inverse Kinematics Transformation. The tooth track is linked
with the velocity giving the surface topography resulting from actual machining
conditions. The model is assessed thanks to a series of sweeping over planes
according to various tool axis orientations and cutting conditions. 3D surface
topography analyses are performed through the new areal surface roughness
parameters proposed by recent standards.
","[{'version': 'v1', 'created': 'Fri, 10 Jun 2011 14:35:46 GMT'}]",2011-06-13,"[['Quinsat', 'Yann', '', 'LURPA'], ['Lavernhe', 'Sylvain', '', 'LURPA'], ['Lartigue', 'Claire', '', 'LURPA']]","['Surface topography', 'Surface Roughness parameters', 'Surface analysis', '5 axis milling']"
5091,1907.10758,Alexander Krotov,"Evgeny Khorov, Alexander Krotov, Andrey Lyakhov",Modelling machine type communication in IEEE 802.11ah networks,,"2015 IEEE International Conference on Communication Workshop
  (ICCW)",10.1109/ICCW.2015.7247332,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wi-Fi was originally designed to provide broadband wireless Internet access
for devices which generate rather heavy streams. And Wi-Fi succeeded. The
coming revolution of the Internet of Things with myriads of autonomous devices
and machine type communications (MTC) traffic raises a question: can the Wi-Fi
success story be repeated in the area of MTC? Started in 2010, IEEE 802.11 Task
Group ah (TGah) has developed a draft amendment to the IEEE 802.11 standard,
adapting Wi-Fi for MTC requirements. The performance of novel channel access
enhancements in MTC scenarios can hardly be studied with models from Bianchi's
clan, which typically assume that traffic load does not change with time. This
paper contributes with a pioneer analytical approach to study Wi-Fi-based MTC,
which can be used to investigate and customize many mechanisms developed by
TGah.
","[{'version': 'v1', 'created': 'Wed, 24 Jul 2019 22:22:32 GMT'}, {'version': 'v2', 'created': 'Sat, 10 Aug 2019 21:03:57 GMT'}]",2019-08-13,"[['Khorov', 'Evgeny', ''], ['Krotov', 'Alexander', ''], ['Lyakhov', 'Andrey', '']]","['Hierarchic channel access', 'RAW', 'Packet transmission time', 'MTC']"
5092,1806.02577,Roberta Calegari,"Roberta Calegari, Enrico Denti, Stefano Mariani, Andrea Omicini",Logic Programming as a Service,,"CALEGARI, R., DENTI, E., MARIANI, S., & OMICINI, A. (2018). Logic
  programming as a service. Theory and Practice of Logic Programming, 18(5-6),
  846-873",10.1017/S1471068418000364,,cs.AI cs.PL cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  New generations of distributed systems are opening novel perspectives for
logic programming (LP): on the one hand, service-oriented architectures
represent nowadays the standard approach for distributed systems engineering;
on the other hand, pervasive systems mandate for situated intelligence. In this
paper we introduce the notion of Logic Programming as a Service (LPaaS) as a
means to address the needs of pervasive intelligent systems through logic
engines exploited as a distributed service. First we define the abstract
architectural model by re-interpreting classical LP notions in the new context;
then we elaborate on the nature of LP interpreted as a service by describing
the basic LPaaS interface. Finally, we show how LPaaS works in practice by
discussing its implementation in terms of distributed tuProlog engines,
accounting for basic issues such as interoperability and configurability.
","[{'version': 'v1', 'created': 'Thu, 7 Jun 2018 09:24:01 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Sep 2018 12:27:36 GMT'}]",2018-10-01,"[['Calegari', 'Roberta', ''], ['Denti', 'Enrico', ''], ['Mariani', 'Stefano', ''], ['Omicini', 'Andrea', '']]","['logic programming', 'distributed systems', 'service-oriented architecture', 'pervasivesystems', 'intelligent systems', 'LPaaS', 'situatedness']"
5093,1907.09575,Ancy Tom,Ancy Sarah Tom and George Karypis,"A 2D Parallel Triangle Counting Algorithm for Distributed-Memory
  Architectures","10 pages, 3 figures, 48th International Conference on Parallel
  Processing",,10.1145/3337821.3337853,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Triangle counting is a fundamental graph analytic operation that is used
extensively in network science and graph mining. As the size of the graphs that
needs to be analyzed continues to grow, there is a requirement in developing
scalable algorithms for distributed-memory parallel systems. To this end, we
present a distributed-memory triangle counting algorithm, which uses a 2D
cyclic decomposition to balance the computations and reduce the communication
overheads. The algorithm structures its communication and computational steps
such that it reduces its memory overhead and includes key optimizations that
leverage the sparsity of the graph and the way the computations are structured.
Experiments on synthetic and real-world graphs show that our algorithm obtains
an average relative speedup that range between 3.24 and 7.22 out of 10.56
across the datasets using 169 MPI ranks over the performance achieved by 16 MPI
ranks. Moreover, we obtain an average speedup of 10.2 times on comparison with
previously developed distributed-memory parallel algorithms.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2019 21:08:39 GMT'}]",2019-07-24,"[['Tom', 'Ancy Sarah', ''], ['Karypis', 'George', '']]","['triangle counting', 'graph analytics', 'distributed-memory']"
5094,1808.00811,"Jan R\""uth","Jan R\""uth and Torsten Zimmermann and Konrad Wolsing and Oliver
  Hohlfeld",Digging into Browser-based Crypto Mining,IMC '18: Internet Measurement Conference,"Jan R\""uth, Torsten Zimmermann, Konrad Wolsing, and Oliver
  Hohlfeld. 2018. Digging into Browser-based Crypto Mining. In IMC '18:
  Internet Measurement Conference, October 31-November 2, 2018, Boston, MA,
  USA. ACM, New York, NY, USA, 7 pages",10.1145/3278532.3278539,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mining is the foundation of blockchain-based cryptocurrencies such as Bitcoin
rewarding the miner for finding blocks for new transactions. The Monero
currency enables mining with standard hardware in contrast to special hardware
(ASICs) as often used in Bitcoin, paving the way for in-browser mining as a new
revenue model for website operators. In this work, we study the prevalence of
this new phenomenon. We identify and classify mining websites in 138M domains
and present a new fingerprinting method which finds up to a factor of 5.7 more
miners than publicly available block lists. Our work identifies and dissects
Coinhive as the major browser-mining stakeholder. Further, we present a new
method to associate mined blocks in the Monero blockchain to mining pools and
uncover that Coinhive currently contributes 1.18% of mined blocks having turned
over 1293 Moneros in June 2018.
","[{'version': 'v1', 'created': 'Thu, 2 Aug 2018 13:43:58 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Sep 2018 15:15:27 GMT'}]",2018-09-24,"[['Rüth', 'Jan', ''], ['Zimmermann', 'Torsten', ''], ['Wolsing', 'Konrad', ''], ['Hohlfeld', 'Oliver', '']]","['Mining', 'Cryptocurrency', 'Monero', 'Blockchain', 'Webassembly', 'Wasm', 'Malware', 'Cryptojacking']"
5095,2102.08613,Johannes Kremheller,"Johannes Kremheller and Sebastian Brandstaeter and Bernhard A.
  Schrefler and Wolfgang A. Wall","Validation and parameter optimization of a hybrid embedded/homogenized
  solid tumor perfusion model",,,10.1002/cnm.3508,,cs.CE physics.bio-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The goal of this paper is to investigate the validity of a hybrid
embedded/homogenized in-silico approach for modeling perfusion through solid
tumors. The rationale behind this novel idea is that only the larger blood
vessels have to be explicitly resolved while the smaller scales of the
vasculature are homogenized. As opposed to typical discrete or fully-resolved
1D-3D models, the required data can be obtained with in-vivo imaging techniques
since the morphology of the smaller vessels is not necessary. By contrast, the
larger vessels, whose topology and structure is attainable non-invasively, are
resolved and embedded as one-dimensional inclusions into the three-dimensional
tissue domain which is modeled as a porous medium. A sound mortar-type
formulation is employed to couple the two representations of the vasculature.
We validate the hybrid model and optimize its parameters by comparing its
results to a corresponding fully-resolved model based on several well-defined
metrics. These tests are performed on a complex data set of three different
tumor types with heterogeneous vascular architectures. The correspondence of
the hybrid model in terms of mean representative elementary volume blood and
interstitial fluid pressures is excellent with relative errors of less than 4%.
Larger, but less important and explicable errors are present in terms of blood
flow in the smaller, homogenized vessels. We finally discuss and demonstrate
how the hybrid model can be further improved to apply it for studies on tumor
perfusion and the efficacy of drug delivery.
","[{'version': 'v1', 'created': 'Wed, 17 Feb 2021 07:29:09 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Jul 2021 11:54:56 GMT'}]",2021-07-15,"[['Kremheller', 'Johannes', ''], ['Brandstaeter', 'Sebastian', ''], ['Schrefler', 'Bernhard A.', ''], ['Wall', 'Wolfgang A.', '']]","['microcirculation', 'tissue perfusion', 'homogenization', 'hybrid models', '1D-3D coupling']"
5096,1802.10215,Sanjit Bhat,Sanjit Bhat and David Lu and Albert Kwon and Srinivas Devadas,"Var-CNN: A Data-Efficient Website Fingerprinting Attack Based on Deep
  Learning","Original paper split into ""Var-CNN: A Data-Efficient Website
  Fingerprinting Attack Based on Deep Learning"" (PETS 2019) and ""DynaFlow: An
  Efficient Website Fingerprinting Defense Based on Dynamically-Adjusting
  Flows"" (WPES 2018)",Proceedings on Privacy Enhancing Technologies. 2019 (4):292-310,10.2478/popets-2019-0070,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, there have been several works that use website
fingerprinting techniques to enable a local adversary to determine which
website a Tor user visits. While the current state-of-the-art attack, which
uses deep learning, outperforms prior art with medium to large amounts of data,
it attains marginal to no accuracy improvements when both use small amounts of
training data. In this work, we propose Var-CNN, a website fingerprinting
attack that leverages deep learning techniques along with novel insights
specific to packet sequence classification. In open-world settings with large
amounts of data, Var-CNN attains over $1\%$ higher true positive rate (TPR)
than state-of-the-art attacks while achieving $4\times$ lower false positive
rate (FPR). Var-CNN's improvements are especially notable in low-data
scenarios, where it reduces the FPR of prior art by $3.12\%$ while increasing
the TPR by $13\%$. Overall, insights used to develop Var-CNN can be applied to
future deep learning based attacks, and substantially reduce the amount of
training data needed to perform a successful website fingerprinting attack.
This shortens the time needed for data collection and lowers the likelihood of
having data staleness issues.
","[{'version': 'v1', 'created': 'Wed, 28 Feb 2018 00:21:09 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Jul 2019 23:37:57 GMT'}]",2019-07-25,"[['Bhat', 'Sanjit', ''], ['Lu', 'David', ''], ['Kwon', 'Albert', ''], ['Devadas', 'Srinivas', '']]","['websitefingerprinting', 'deeplearning', 'anonymity']"
5097,1407.1201,Piotr Plonski,"Piotr P{\l}o\'nski, Krzysztof Zaremba","Improving Performance of Self-Organising Maps with Distance Metric
  Learning Method","9 pages, 2 figures","Artificial Intelligence and Soft Computing, Lecture Notes in
  Computer Science Volume 7267, 2012, pp 169-177",10.1007/978-3-642-29347-4_20,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-Organising Maps (SOM) are Artificial Neural Networks used in Pattern
Recognition tasks. Their major advantage over other architectures is human
readability of a model. However, they often gain poorer accuracy. Mostly used
metric in SOM is the Euclidean distance, which is not the best approach to some
problems. In this paper, we study an impact of the metric change on the SOM's
performance in classification problems. In order to change the metric of the
SOM we applied a distance metric learning method, so-called 'Large Margin
Nearest Neighbour'. It computes the Mahalanobis matrix, which assures small
distance between nearest neighbour points from the same class and separation of
points belonging to different classes by large margin. Results are presented on
several real data sets, containing for example recognition of written digits,
spoken letters or faces.
","[{'version': 'v1', 'created': 'Fri, 4 Jul 2014 12:14:48 GMT'}]",2014-07-07,"[['Płoński', 'Piotr', ''], ['Zaremba', 'Krzysztof', '']]","['Self-Organising Maps', 'Distance Metric Learning', 'LMNN', 'Mahalanobis distance', 'Classification']"
5098,1907.10794,Byunghyun Ban,"Byunghyun Ban, Donghun Ryu, Minwoo Lee","Machine learning approach to remove ion interference effect in
  agricultural nutrient solutions","6 pages, 5 figures, 5 tables. Accepted to 2019 International
  Conference on Information and Communication Technology Convergence (ICTC) -
  ICTC2019","2019 International Conference on Information and Communication
  Technology Convergence (ICTC)",10.1109/ICTC46691.2019.8939812,,cs.LG eess.SP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  High concentration agricultural facilities such as vertical farms or plant
factories consider hydroponic techniques as optimal solutions. Although
closed-system dramatically reduces water consumption and pollution issues, it
has ion-ratio related problem. As the root absorbs individual ions with
different rate, ion rate in a nutrient solution should be adjusted
periodically. But traditional method only considers pH and electrical
conductivity to adjust the nutrient solution, leading to ion imbalance and
accumulation of excessive salts. To avoid those problems, some researchers have
proposed ion-balancing methods which measure and control each ion
concentration. However, those approaches do not overcome the innate limitations
of ISEs, especially ion interference effect. An anion sensor is affected by
other anions, and the error grows larger in higher concentration solution. A
machine learning approach to modify ISE data distorted by ion interference
effect is proposed in this paper. As measurement of TDS value is relatively
robust than any other signals, we applied TDS as key parameter to build a
readjustment function to remove the artifact. Once a readjustment model is
established, application on ISE data can be done in real time. Readjusted data
with proposed model showed about 91.6 ~ 98.3% accuracies. This method will
enable the fields to apply recent methods in feasible status.
","[{'version': 'v1', 'created': 'Thu, 25 Jul 2019 01:50:29 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Jul 2019 02:57:41 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Aug 2019 05:51:17 GMT'}, {'version': 'v4', 'created': 'Tue, 3 Sep 2019 00:36:21 GMT'}]",2021-01-07,"[['Ban', 'Byunghyun', ''], ['Ryu', 'Donghun', ''], ['Lee', 'Minwoo', '']]","['Machine learning', 'ISE', 'Nutrient solution', 'Aqua']"
5099,1711.03214,Filippo Santarelli,"Pierluigi Maponi, Riccardo Piergallini and Filippo Santarelli",Fingerprint Orientation Refinement through Iterative Smoothing,,"Signal & Image Processing: An International Journal, 8(5), 29-43,
  2017",10.5121/sipij.2017.8503,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new gradient-based method for the extraction of the orientation
field associated to a fingerprint, and a regularisation procedure to improve
the orientation field computed from noisy fingerprint images. The
regularisation algorithm is based on three new integral operators, introduced
and discussed in this paper. A pre-processing technique is also proposed to
achieve better performances of the algorithm. The results of a numerical
experiment are reported to give an evidence of the efficiency of the proposed
algorithm.
","[{'version': 'v1', 'created': 'Thu, 9 Nov 2017 00:06:27 GMT'}]",2017-11-10,"[['Maponi', 'Pierluigi', ''], ['Piergallini', 'Riccardo', ''], ['Santarelli', 'Filippo', '']]","['Fingerprint analysis', 'Equalisation', 'Segmentation', 'Orientation Extraction', 'Orientation Refinement   1']"
5100,1811.03030,Jinseok Kim,Jinseok Kim,"Scale-free collaboration networks: An author name disambiguation
  perspective","22 pages, 12 figures, 5 tables",,10.1002/asi.24158,,cs.DL cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several studies have found that collaboration networks are scale-free,
proposing that such networks can be modeled by specific network evolution
mechanisms like preferential attachment. This study argues that collaboration
networks can look more or less scale-free depending on the methods for
resolving author name ambiguity in bibliographic data. Analyzing networks
constructed from multiple datasets containing 3.4M ~ 9.6M publication records,
this study shows that collaboration networks in which author names are
disambiguated by the commonly used heuristic, i.e., forename-initial-based name
matching, tend to produce degree distributions better fitted to power-law
slopes with the typical scaling parameter (2 < {\alpha} < 3) than networks
disambiguated by more accurate algorithm-based methods. Such tendency is
observed across collaboration networks generated under various conditions such
as cumulative years, 5- & 1-year sliding windows, and random sampling, and
through simulation, found to arise due mainly to artefactual entities created
by inaccurate disambiguation. This cautionary study calls for special attention
from scholars analyzing network data in which entities such as people,
organization, and gene can be merged or split by improper disambiguation.
","[{'version': 'v1', 'created': 'Wed, 7 Nov 2018 17:30:00 GMT'}]",2018-11-08,"[['Kim', 'Jinseok', '']]","['author name disambiguation', 'scale-free network', 'power-law distribution', 'collaboration network', 'information retrieval']"
5101,1604.07850,Nguyen Phong Hoang,"Nguyen Phong Hoang, Yasuhito Asano, Masatoshi Yoshikawa","Your Neighbors Are My Spies: Location and other Privacy Concerns in
  Dating Apps","The 18th IEEE International Conference on Advanced Communication
  Technology (ICACT 2016)",,10.1109/ICACT.2016.7423532,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Trilateration has recently become one of the well-known threat models to the
user's location privacy in location-based applications (aka: location-based
services or LBS), especially those containing highly sensitive information such
as dating applications. The threat model mainly depends on the distance shown
from the targeted victim to the adversary to pinpoint the victim's position. As
a countermeasure, most of location-based applications have already implemented
the ""hide distance"" function to protect their user's location privacy. The
effectiveness of such approaches however is still questionable. Therefore, in
this paper, we first investigate how popular location-based dating applications
are currently protecting their user's privacy by testing the two most popular
GLBT-focused applications: Jack'd and Grindr.
","[{'version': 'v1', 'created': 'Wed, 20 Apr 2016 05:00:49 GMT'}]",2016-04-28,"[['Hoang', 'Nguyen Phong', ''], ['Asano', 'Yasuhito', ''], ['Yoshikawa', 'Masatoshi', '']]","['Location-based Application', 'Location Privacy', 'User Privacy', 'Trilateration', 'GLBT-focused Applications', 'Grindr', ""Jack'd""]"
5102,1112.3415,Osman Yagan,Osman Yagan,"Performance of the Eschenauer-Gligor key distribution scheme under an
  ON/OFF channel","Submitted to IEEE Transactions on Information Theory in November,
  2011","IEEE Transactions on Information Theory, Volume: 58, Issue: 6
  Pages: 3821-3835, June 2012",10.1109/TIT.2012.2189353,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the secure connectivity of wireless sensor networks under the
random key distribution scheme of Eschenauer and Gligor. Unlike recent work
which was carried out under the assumption of full visibility, here we assume a
(simplified) communication model where unreliable wireless links are
represented as on/off channels. We present conditions on how to scale the model
parameters so that the network i) has no secure node which is isolated and ii)
is securely connected, both with high probability when the number of sensor
nodes becomes large. The results are given in the form of full zero-one laws,
and constitute the first complete analysis of the EG scheme under non-full
visibility. Through simulations these zero-one laws are shown to be valid also
under a more realistic communication model, i.e., the disk model. The relations
to the Gupta and Kumar's conjecture on the connectivity of geometric random
graphs with randomly deleted edges are also discussed.
","[{'version': 'v1', 'created': 'Thu, 15 Dec 2011 03:19:59 GMT'}]",2012-06-04,"[['Yagan', 'Osman', '']]","['Wireless sensor networks', 'Security', 'Key predistribution', 'Random graphs', 'Connectivity']"
5103,1501.07008,Arnaud Martin,"Amira Essaid (IRISA), Arnaud Martin (IRISA), Gr\'egory Smits,
  Boutheina Ben Yaghlane",A Distance-Based Decision in the Credal Level,,"International Conference on Artificial Intelligence and Symbolic
  Computation (AISC 2014), Dec 2014, Sevilla, Spain. pp.147 - 156",10.1007/978-3-319-13770-4_13,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Belief function theory provides a flexible way to combine information
provided by different sources. This combination is usually followed by a
decision making which can be handled by a range of decision rules. Some rules
help to choose the most likely hypothesis. Others allow that a decision is made
on a set of hypotheses. In [6], we proposed a decision rule based on a distance
measure. First, in this paper, we aim to demonstrate that our proposed decision
rule is a particular case of the rule proposed in [4]. Second, we give
experiments showing that our rule is able to decide on a set of hypotheses.
Some experiments are handled on a set of mass functions generated randomly,
others on real databases.
","[{'version': 'v1', 'created': 'Wed, 28 Jan 2015 07:24:12 GMT'}]",2015-01-29,"[['Essaid', 'Amira', '', 'IRISA'], ['Martin', 'Arnaud', '', 'IRISA'], ['Smits', 'Grégory', ''], ['Yaghlane', 'Boutheina Ben', '']]","['belief function theory', 'imprecise decision', 'distance']"
5104,1902.08425,Volodymyr Sokolov,"Volodymyr Buriachok, Volodymyr Sokolov",Using 2.4 GHz Wireless Botnets to Implement Denial-of-Service Attacks,,"Web of Scholar (ISSN: 2518-167X), no. 6 (24), vol. 1, Warsaw, RS
  Global Sp. z O. O., 2018",10.31435/rsglobal_wos/12062018/5734,,cs.CR cs.NI,http://creativecommons.org/licenses/by/4.0/,"  This article attempts to create a software and hardware complex that can work
autonomously and demonstrates the ease of implementation of attacks on denial
of service on wireless networks, which in turn emphasizes the need to provide
comprehensive protection of wireless networks.
","[{'version': 'v1', 'created': 'Fri, 22 Feb 2019 10:22:05 GMT'}]",2019-02-25,"[['Buriachok', 'Volodymyr', ''], ['Sokolov', 'Volodymyr', '']]","['bot', 'botnet', 'wireless network', 'denial of service attack']"
5105,1610.09906,Johannes Rutzmoser,J. B. Rutzmoser and D. J. Rixen and P. Tiso and S. Jain,"Generalization of Quadratic Manifolds for Reduced Order Modeling of
  Nonlinear Structural Dynamics",,,10.1016/j.compstruc.2017.06.003,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a generalization of a quadratic manifold approach for the
reduction of geometrically nonlinear structural dynamics problems is presented.
This generalization is constructed by a linearization of the static force with
respect to the generalized coordinates, resulting in a shift of the quadratic
behavior from the force to the manifold. In this framework, static derivatives
emerge as natural extensions to modal derivatives for displacement fields other
than the vibration modes, such as the Krylov subspace vectors. Here the dynamic
problem is projected onto the tangent space of the quadratic manifold, allowing
for a much less number of generalized coordinates compared to linear basis
methods. The potential of the quadratic manifold approach is investigated in a
numerical study, where several variations of the approach are compared on
different examples, indicating a clear pattern where the proposed approach is
applicable.
","[{'version': 'v1', 'created': 'Mon, 31 Oct 2016 13:13:52 GMT'}]",2017-12-06,"[['Rutzmoser', 'J. B.', ''], ['Rixen', 'D. J.', ''], ['Tiso', 'P.', ''], ['Jain', 'S.', '']]","['Model Order Reduction', 'Structural Dynamics', 'Geometric Nonlinearity', 'Quadratic Manifold', 'Modal Derivatives']"
5106,1705.04744,Samson Abramsky,Samson Abramsky,"Intensionality, Definability and Computation",23 pages,"In Johan van Benthem on Logic and Information Dynamics, A. Baltag
  and S. Smets, eds. Springer International Publishing, 2014. 121-142",10.1007/978-3-319-06025-5_5,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We look at intensionality from the perspective of computation. In particular,
we review how game semantics has been used to characterize the sequential
functional processes, leading to powerful and flexible methods for constructing
fully abstract models of programming languages, with applications in program
analysis and verification. In a broader context, we can regard game semantics
as a first step towards developing a positive theory of intensional structures
with a robust mathematical structure, and finding the right notions of
invariance for these structures.
","[{'version': 'v1', 'created': 'Fri, 12 May 2017 20:16:38 GMT'}]",2017-05-16,"[['Abramsky', 'Samson', '']]","['Computation', 'intentionality', 'extensionality', 'definability', 'game semantics']"
5107,1602.01130,Christopher Harshaw,"Christopher R. Harshaw, Robert A. Bridges, Michael D. Iannacone, Joel
  W. Reed, John R. Goodall","GraphPrints: Towards a Graph Analytic Method for Network Anomaly
  Detection","4 pages submitted to Cyber & Information Security Research Conference
  2016, ACM",,10.1145/1235,,cs.CR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a novel graph-analytic approach for detecting anomalies
in network flow data called GraphPrints. Building on foundational
network-mining techniques, our method represents time slices of traffic as a
graph, then counts graphlets -- small induced subgraphs that describe local
topology. By performing outlier detection on the sequence of graphlet counts,
anomalous intervals of traffic are identified, and furthermore, individual IPs
experiencing abnormal behavior are singled-out. Initial testing of GraphPrints
is performed on real network data with an implanted anomaly. Evaluation shows
false positive rates bounded by 2.84% at the time-interval level, and 0.05% at
the IP-level with 100% true positive rates at both.
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2016 22:04:22 GMT'}]",2016-02-04,"[['Harshaw', 'Christopher R.', ''], ['Bridges', 'Robert A.', ''], ['Iannacone', 'Michael D.', ''], ['Reed', 'Joel W.', ''], ['Goodall', 'John R.', '']]","['anomaly detection', 'graphlet', 'motif', 'intrusion detection']"
5108,1912.01289,Francesco Tiezzi,"Rocco De Nicola, Gianluigi Ferrari, Rosario Pugliese, Francesco Tiezzi","A Formal Approach to the Engineering of Domain-Specific Distributed
  Systems",In Press,"Journal of Logical and Algebraic Methods in Programming, Elsevier,
  2019",10.1016/j.jlamp.2019.100511,,cs.PL cs.FL cs.LO cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We review some results regarding specification, programming and verification
of different classes of distributed systems which stemmed from the research of
the Concurrency and Mobility Group at University of Firenze. More specifically,
we examine the distinguishing features of network-aware programming,
service-oriented computing, autonomic computing, and collective adaptive
systems programming. We then present an overview of four different languages,
namely Klaim, Cows, Scel and AbC. For each language, we discuss design choices,
present syntax and semantics, show how the different formalisms can be used to
model and program a travel booking scenario, and describe programming
environments and verification techniques.
","[{'version': 'v1', 'created': 'Tue, 3 Dec 2019 10:45:53 GMT'}]",2019-12-04,"[['De Nicola', 'Rocco', ''], ['Ferrari', 'Gianluigi', ''], ['Pugliese', 'Rosario', ''], ['Tiezzi', 'Francesco', '']]","['Coordination', 'Distributed Systems', 'Domain-Specific Languages']"
5109,1203.2822,Marek Szyku{\l}a,"Andrzej Kisielewicz, Jakub Kowalski, Marek Szyku{\l}a",A Fast Algorithm Finding the Shortest Reset Words,"COCOON 2013. The final publication is available at
  http://link.springer.com/chapter/10.1007%2F978-3-642-38768-5_18","In Computing and Combinatorics, volume 7936 of LNCS, pages
  182-196, 2013",10.1007/978-3-642-38768-5_18,,cs.FL cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a new fast algorithm finding minimal reset words for
finite synchronizing automata. The problem is know to be computationally hard,
and our algorithm is exponential. Yet, it is faster than the algorithms used so
far and it works well in practice. The main idea is to use a bidirectional BFS
and radix (Patricia) tries to store and compare resulted subsets. We give both
theoretical and practical arguments showing that the branching factor is
reduced efficiently. As a practical test we perform an experimental study of
the length of the shortest reset word for random automata with $n$ states and 2
input letters. We follow Skvorsov and Tipikin, who have performed such a study
using a SAT solver and considering automata up to $n=100$ states. With our
algorithm we are able to consider much larger sample of automata with up to
$n=300$ states. In particular, we obtain a new more precise estimation of the
expected length of the shortest reset word $\approx 2.5\sqrt{n-5}$.
","[{'version': 'v1', 'created': 'Tue, 13 Mar 2012 14:29:24 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Dec 2014 18:43:33 GMT'}]",2014-12-15,"[['Kisielewicz', 'Andrzej', ''], ['Kowalski', 'Jakub', ''], ['Szykuła', 'Marek', '']]","['Synchronizing automaton', 'synchronizing word', 'Černý conjecture']"
5110,1812.05450,Petar Bojovi\'c D.,"P.D. Bojovic, I. Basicevic, S. Ocovaj, M. Popovic","A practical approach to detection of distributed denial-of-service
  attacks using a hybrid detection method","20 pages, 14 figures, 6 tables",,10.1016/j.compeleceng.2018.11.004,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper presents a hybrid method for the detection of distributed
denial-of-service (DDoS) attacks that combines feature-based and volume-based
detection. Our approach is based on an exponential moving average algorithm for
decision-making, applied to both entropy and packet number time series. The
approach has been tested by performing a controlled DDoS experiment in a real
academic network. The network setup and test scenarios including both high-rate
and low-rate attacks are described in the paper. The performance of the
proposed method is compared to the performance of two methods that are already
known in the literature. One is based on the counting of SYN packets and is
used for detection of SYN flood attacks, while the other is based on a CUSUM
algorithm applied to the entropy time series. The results show the advantage of
our approach compared to methods that are based on either entropy or number of
packets only.
","[{'version': 'v1', 'created': 'Thu, 8 Nov 2018 11:07:52 GMT'}]",2018-12-14,"[['Bojovic', 'P. D.', ''], ['Basicevic', 'I.', ''], ['Ocovaj', 'S.', ''], ['Popovic', 'M.', '']]","['network security', 'denial of service attack', 'exponential weighted moving average', 'CUSUM', 'packet entropy']"
5111,1912.05147,Chengkun Lang,"Huiwei Zhou, Xuefei Li, Weihong Yao, Zhuang Liu, Shixian Ning,
  Chengkun Lang, and Lei Du","Improving Neural Protein-Protein Interaction Extraction with Knowledge
  Selection","Published in Computational Biology and Chemistry; 14 pages, 2 figures","Computational Biology and Chemistry, 2019, 83: 107146",10.1016/j.compbiolchem.2019.107146,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Protein-protein interaction (PPI) extraction from published scientific
literature provides additional support for precision medicine efforts.
Meanwhile, knowledge bases (KBs) contain huge amounts of structured information
of protein entities and their relations, which can be encoded in entity and
relation embeddings to help PPI extraction. However, the prior knowledge of
protein-protein pairs must be selectively used so that it is suitable for
different contexts. This paper proposes a Knowledge Selection Model (KSM) to
fuse the selected prior knowledge and context information for PPI extraction.
Firstly, two Transformers encode the context sequence of a protein pair
according to each protein embedding, respectively. Then, the two outputs are
fed to a mutual attention to capture the important context features towards the
protein pair. Next, the context features are used to distill the relation
embedding by a knowledge selector. Finally, the selected relation embedding and
the context features are concatenated for PPI extraction. Experiments on the
BioCreative VI PPI dataset show that KSM achieves a new state-of-the-art
performance (38.08% F1-score) by adding knowledge selection.
","[{'version': 'v1', 'created': 'Wed, 11 Dec 2019 07:29:59 GMT'}]",2019-12-12,"[['Zhou', 'Huiwei', ''], ['Li', 'Xuefei', ''], ['Yao', 'Weihong', ''], ['Liu', 'Zhuang', ''], ['Ning', 'Shixian', ''], ['Lang', 'Chengkun', ''], ['Du', 'Lei', '']]","['PPI extraction', 'Knowledge selection', 'Mutual attention', 'Prior knowledge']"
5112,1903.02446,Sebastian Stefan Feger,"Sebastian S. Feger, S\""unje Dallmeier-Tiessen, Pawe{\l} W. Wo\'zniak,
  Albrecht Schmidt","Gamification in Science: A Study of Requirements in the Context of
  Reproducible Research","Accepted for publication at the 2019 Conference on Human Factors in
  Computing Systems (CHI 2019)",,10.1145/3290605.3300690,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  The need for data preservation and reproducible research is widely recognized
in the scientific community. Yet, researchers often struggle to find the
motivation to contribute to data repositories and to use tools that foster
reproducibility. In this paper, we explore possible uses of gamification to
support reproducible practices in High Energy Physics. To understand how
gamification can be effective in research tools, we participated in a workshop
and performed interviews with data analysts. We then designed two interactive
prototypes of a research preservation service that use contrasting gamification
strategies. The evaluation of the prototypes showed that gamification needs to
address core scientific challenges, in particular the fair reflection of
quality and individual contribution. Through thematic analysis, we identified
four themes which describe perceptions and requirements of gamification in
research: Contribution, Metrics, Applications and Scientific practice. Based on
these, we discuss design implications for gamification in science.
","[{'version': 'v1', 'created': 'Wed, 6 Mar 2019 15:20:16 GMT'}]",2019-03-07,"[['Feger', 'Sebastian S.', ''], ['Dallmeier-Tiessen', 'Sünje', ''], ['Woźniak', 'Paweł W.', ''], ['Schmidt', 'Albrecht', '']]","['Gamification', 'Science', 'Research Reproducibility', 'Game design elements']"
5113,1902.09856,Changhee Han,"Changhee Han, Kohei Murao, Tomoyuki Noguchi, Yusuke Kawata, Fumiya
  Uchiyama, Leonardo Rundo, Hideki Nakayama, Shin'ichi Satoh","Learning More with Less: Conditional PGGAN-based Data Augmentation for
  Brain Metastases Detection Using Highly-Rough Annotation on MR Images","9 pages, 7 figures, accepted to CIKM 2019 (acceptance rate: 19%)",,10.1145/3357384.3357890,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate Computer-Assisted Diagnosis, associated with proper data wrangling,
can alleviate the risk of overlooking the diagnosis in a clinical environment.
Towards this, as a Data Augmentation (DA) technique, Generative Adversarial
Networks (GANs) can synthesize additional training data to handle the
small/fragmented medical imaging datasets collected from various scanners;
those images are realistic but completely different from the original ones,
filling the data lack in the real image distribution. However, we cannot easily
use them to locate disease areas, considering expert physicians' expensive
annotation cost. Therefore, this paper proposes Conditional Progressive Growing
of GANs (CPGGANs), incorporating highly-rough bounding box conditions
incrementally into PGGANs to place brain metastases at desired positions/sizes
on 256 X 256 Magnetic Resonance (MR) images, for Convolutional Neural
Network-based tumor detection; this first GAN-based medical DA using automatic
bounding box annotation improves the training robustness. The results show that
CPGGAN-based DA can boost 10% sensitivity in diagnosis with clinically
acceptable additional False Positives. Surprisingly, further tumor realism,
achieved with additional normal brain MR images for CPGGAN training, does not
contribute to detection performance, while even three physicians cannot
accurately distinguish them from the real ones in Visual Turing Test.
","[{'version': 'v1', 'created': 'Tue, 26 Feb 2019 10:46:53 GMT'}, {'version': 'v2', 'created': 'Sun, 3 Mar 2019 15:33:12 GMT'}, {'version': 'v3', 'created': 'Mon, 27 May 2019 15:05:36 GMT'}, {'version': 'v4', 'created': 'Wed, 29 May 2019 12:44:45 GMT'}, {'version': 'v5', 'created': 'Thu, 22 Aug 2019 11:01:29 GMT'}]",2019-08-23,"[['Han', 'Changhee', ''], ['Murao', 'Kohei', ''], ['Noguchi', 'Tomoyuki', ''], ['Kawata', 'Yusuke', ''], ['Uchiyama', 'Fumiya', ''], ['Rundo', 'Leonardo', ''], ['Nakayama', 'Hideki', ''], ['Satoh', ""Shin'ichi"", '']]","['Generative Adversarial Networks', 'Medical Image Augmentation', 'Conditional PGGANs', 'Brain Tumor Detection', 'MRI']"
5114,1301.1085,Charith Perera,"Charith Perera, Arkady Zaslavsky, Peter Christen, Ali Salehi,
  Dimitrios Georgakopoulos","Connecting Mobile Things to Global Sensor Network Middleware using
  System-generated Wrappers",,"Proceedings of the 11th ACM International Workshop on Data
  Engineering for Wireless and Mobile Access (ACM SIGMOD/PODS-Workshop-MobiDE),
  Scottsdale, Arizona, USA, May, 2012",,,cs.SE cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet of Things (IoT) will create a cyberphysical world where all the
things around us are connected to the Inter net, sense and produce ""big data""
that has to be stored, processed and communicated with minimum human
intervention. With the ever increasing emergence of new sensors, interfaces and
mobile devices, the grand challenge is to keep up with this race in developing
software drivers and wrappers for IoT things. In this paper, we examine the
approaches that automate the process of developing middleware drivers/wrappers
for the IoT things. We propose ASCM4GSN architecture to address this challenge
efficiently and effectively. We demonstrate the proposed approach using Global
Sensor Network (GSN) middleware which exemplifies a cluster of data streaming
engines. The ASCM4GSN architecture significantly speeds up the wrapper
development and sensor configuration process as demonstrated for Android mobile
phone based sensors as well as for Sun SPOT sensors.
","[{'version': 'v1', 'created': 'Mon, 7 Jan 2013 00:51:12 GMT'}]",2013-01-08,"[['Perera', 'Charith', ''], ['Zaslavsky', 'Arkady', ''], ['Christen', 'Peter', ''], ['Salehi', 'Ali', ''], ['Georgakopoulos', 'Dimitrios', '']]","['Internet of Things', 'Sensor Networks', 'Global Sensor NetworkMiddleware', 'Mobile Sensors']"
5115,1908.00966,Chun-An Chou,Chun-An Chou and Qingtao Cao and Shao-Jen Weng and Che-Hung Tsai,"Mixed-Integer Optimization Approach to Learning Association Rules for
  Unplanned ICU Transfer",,"Artificial Intelligence in Medicine, 2020",10.1016/j.artmed.2020.101806,,cs.LG math.CO stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  After admission to emergency department (ED), patients with critical
illnesses are transferred to intensive care unit (ICU) due to unexpected
clinical deterioration occurrence. Identifying such unplanned ICU transfers is
urgently needed for medical physicians to achieve two-fold goals: improving
critical care quality and preventing mortality. A priority task is to
understand the crucial rationale behind diagnosis results of individual
patients during stay in ED, which helps prepare for an early transfer to ICU.
Most existing prediction studies were based on univariate analysis or multiple
logistic regression to provide one-size-fit-all results. However, patient
condition varying from case to case may not be accurately examined by the only
judgment. In this study, we present a new decision tool using a mathematical
optimization approach aiming to automatically discover rules associating
diagnostic features with high-risk outcome (i.e., unplanned transfers) in
different deterioration scenarios. We consider four mutually exclusive patient
subgroups based on the principal reasons of ED visits: infections,
cardiovascular/respiratory diseases, gastrointestinal diseases, and
neurological/other diseases at a suburban teaching hospital. The analysis
results demonstrate significant rules associated with unplanned transfer
outcome for each subgroups and also show comparable prediction accuracy,
compared to state-of-the-art machine learning methods while providing
easy-to-interpret symptom-outcome information.
","[{'version': 'v1', 'created': 'Fri, 2 Aug 2019 17:45:50 GMT'}]",2021-02-10,"[['Chou', 'Chun-An', ''], ['Cao', 'Qingtao', ''], ['Weng', 'Shao-Jen', ''], ['Tsai', 'Che-Hung', '']]","['Emergency department', 'critical care', 'unplanned ICU transfer', 'associationrule', 'mixed-integer optimization']"
5116,1812.07933,Mikhail Povolotskiy,M.A. Povolotskiy and D.V. Tropin,Dynamic Programming Approach to Template-based OCR,"8 pages, 5 figures, 1 table",,10.1117/12.2522974,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a dynamic programming solution to the template-based
recognition task in OCR case. We formulate a problem of optimal position search
for complex objects consisting of parts forming a sequence. We limit the
distance between every two adjacent elements with predefined upper and lower
thresholds. We choose the sum of penalties for each part in given position as a
function to be minimized. We show that such a choice of restrictions allows a
faster algorithm to be used than the one for the general form of deformation
penalties. We named this algorithm Dynamic Squeezeboxes Packing (DSP) and
applied it to solve the two OCR problems: text fields extraction from an image
of document Visual Inspection Zone (VIZ) and license plate segmentation. The
quality and the performance of resulting solutions were experimentally proved
to meet the requirements of the state-of-the-art industrial recognition
systems.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2018 13:22:00 GMT'}]",2020-08-03,"[['Povolotskiy', 'M. A.', ''], ['Tropin', 'D. V.', '']]","['deformable templates', 'dynamic programming', 'image analysis', 'OCR', 'pictorial structures']"
5117,1611.01287,Stefan Wagner,Stefan Wagner and Florian Deissenboeck and Sebastian Winter,Managing Quality Requirements Using Activity-Based Quality Models,"6 pages in Proceedings of the 6th international workshop on Software
  quality (WoSQ '08). ACM, 2008",,10.1145/1370099.1370107,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Managing requirements on quality aspects is an important issue in the
development of software systems. Difficulties arise from expressing them
appropriately what in turn results from the difficulty of the concept of
quality itself. Building and using quality models is an approach to handle the
complexity of software quality. A novel kind of quality models uses the
activities performed on and with the software as an explicit dimension. These
quality models are a well-suited basis for managing quality requirements from
elicitation over refinement to assurance. The paper proposes such an approach
and shows its applicability in an automotive case study.
","[{'version': 'v1', 'created': 'Fri, 4 Nov 2016 08:39:12 GMT'}]",2016-11-07,"[['Wagner', 'Stefan', ''], ['Deissenboeck', 'Florian', ''], ['Winter', 'Sebastian', '']]","['Quality requirements', 'quality models', 'activities', 'stakeholders']"
5118,1807.01838,Vyacheslav Zolotarev,"Maksim Shudrak, Vyacheslav Zolotarev",Improving Fuzzing Using Software Complexity Metrics,,"ICISC 2015: Information Security and Cryptology - ICISC 2015 pp
  246-261",10.1007/978-3-319-30840-1_16,,cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vulnerable software represents a tremendous threat to modern information
systems. Vulnerabilities in widespread applications may be used to spread
malware, steal money and conduct target attacks. To address this problem,
developers and researchers use different approaches of dynamic and static
software analysis; one of these approaches is called fuzzing. Fuzzing is
performed by generating and sending potentially malformed data to an
application under test. Since first appearance in 1988, fuzzing has evolved a
lot, but issues which addressed to effectiveness evaluation have not fully
investigated until now. In our research, we propose a novel approach of fuzzing
effectiveness evaluation, taking into account semantics of executed code along
with a quantitative assessment. For this purpose, we use specific metrics of
source code complexity assessment adapted to perform analysis of machine code.
We conducted effectiveness evaluation of these metrics on 104 widespread
applications with known vulnerabilities. As a result of these experiments, we
were able to identify a set of metrics that are more suitable to find bugs. In
addition, we conducted separate experiments on 7 applications without known
vulnerabilities by using the set of metrics. The experimental results confirmed
that proposed approach can be applied to increase performance of the fuzzing.
Moreover, the tools helped detect two critical zero day (previously unknown)
vulnerabilities in the wide-spread applications.
","[{'version': 'v1', 'created': 'Thu, 5 Jul 2018 04:12:41 GMT'}]",2018-07-06,"[['Shudrak', 'Maksim', ''], ['Zolotarev', 'Vyacheslav', '']]","['fuzzing', 'metrics', 'complexity', 'code coverage', 'machine code']"
5119,1606.05794,Jeremy Kepner,"Mike Jones, Bill Arcand, Bill Bergeron, David Bestor, Chansup Byun,
  Lauren Milechin, Vijay Gadepally, Matt Hubbell, Jeremy Kepner, Pete
  Michaleas, Julie Mullen, Andy Prout, Tony Rosa, Siddharth Samsi, Charles Yee,
  Albert Reuther",Scalability of VM Provisioning Systems,"5 pages; 6 figures; accepted to the IEEE High Performance Extreme
  Computing (HPEC) conference 2016",,10.1109/HPEC.2016.7761629,,cs.DC cs.CY cs.OS cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Virtual machines and virtualized hardware have been around for over half a
century. The commoditization of the x86 platform and its rapidly growing
hardware capabilities have led to recent exponential growth in the use of
virtualization both in the enterprise and high performance computing (HPC). The
startup time of a virtualized environment is a key performance metric for high
performance computing in which the runtime of any individual task is typically
much shorter than the lifetime of a virtualized service in an enterprise
context. In this paper, a methodology for accurately measuring the startup
performance on an HPC system is described. The startup performance overhead of
three of the most mature, widely deployed cloud management frameworks
(OpenStack, OpenNebula, and Eucalyptus) is measured to determine their
suitability for workloads typically seen in an HPC environment. A 10x
performance difference is observed between the fastest (Eucalyptus) and the
slowest (OpenNebula) framework. This time difference is primarily due to delays
in waiting on networking in the cloud-init portion of the startup. The
methodology and measurements presented should facilitate the optimization of
startup across a variety of virtualization environments.
","[{'version': 'v1', 'created': 'Sat, 18 Jun 2016 18:55:42 GMT'}]",2016-12-13,"[['Jones', 'Mike', ''], ['Arcand', 'Bill', ''], ['Bergeron', 'Bill', ''], ['Bestor', 'David', ''], ['Byun', 'Chansup', ''], ['Milechin', 'Lauren', ''], ['Gadepally', 'Vijay', ''], ['Hubbell', 'Matt', ''], ['Kepner', 'Jeremy', ''], ['Michaleas', 'Pete', ''], ['Mullen', 'Julie', ''], ['Prout', 'Andy', ''], ['Rosa', 'Tony', ''], ['Samsi', 'Siddharth', ''], ['Yee', 'Charles', ''], ['Reuther', 'Albert', '']]","['virtual machines', 'high performance computing', 'scalability', 'cloud computing']"
5120,1711.01630,Mahdi Cheraghchi,Mahdi Cheraghchi,Capacity Upper Bounds for Deletion-Type Channels,"Minor edits, In Proceedings of 50th Annual ACM SIGACT Symposium on
  the Theory of Computing (STOC), 2018",,10.1145/3188745.3188768,,cs.IT math.IT math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop a systematic approach, based on convex programming and real
analysis, for obtaining upper bounds on the capacity of the binary deletion
channel and, more generally, channels with i.i.d. insertions and deletions.
Other than the classical deletion channel, we give a special attention to the
Poisson-repeat channel introduced by Mitzenmacher and Drinea (IEEE Transactions
on Information Theory, 2006). Our framework can be applied to obtain capacity
upper bounds for any repetition distribution (the deletion and Poisson-repeat
channels corresponding to the special cases of Bernoulli and Poisson
distributions). Our techniques essentially reduce the task of proving capacity
upper bounds to maximizing a univariate, real-valued, and often concave
function over a bounded interval. We show the following:
  1. The capacity of the binary deletion channel with deletion probability $d$
is at most $(1-d)\log\varphi$ for $d\geq 1/2$, and, assuming the capacity
function is convex, is at most $1-d\log(4/\varphi)$ for $d<1/2$, where
$\varphi=(1+\sqrt{5})/2$ is the golden ratio. This is the first nontrivial
capacity upper bound for any value of $d$ outside the limiting case $d\to 0$
that is fully explicit and proved without computer assistance.
  2. We derive the first set of capacity upper bounds for the Poisson-repeat
channel.
  3. We derive several novel upper bounds on the capacity of the deletion
channel. All upper bounds are maximums of efficiently computable, and concave,
univariate real functions over a bounded domain. In turn, we upper bound these
functions in terms of explicit elementary and standard special functions, whose
maximums can be found even more efficiently (and sometimes, analytically, for
example for $d=1/2$).
  Along the way, we develop several new techniques of potentially independent
interest in information theory, probability, and mathematical analysis.
","[{'version': 'v1', 'created': 'Sun, 5 Nov 2017 18:17:31 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Mar 2018 13:01:24 GMT'}, {'version': 'v3', 'created': 'Fri, 6 Apr 2018 17:51:01 GMT'}, {'version': 'v4', 'created': 'Mon, 11 Jun 2018 11:14:31 GMT'}]",2018-06-12,"[['Cheraghchi', 'Mahdi', '']]","['Coding theory', 'Synchronization error-correcting codes', 'Channel coding']"
5121,1407.8093,John Jakeman,"John D. Jakeman, Michael S. Eldred, Khachik Sargsyan","Enhancing $\ell_1$-minimization estimates of polynomial chaos expansions
  using basis selection",,,10.1016/j.jcp.2015.02.025,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a basis selection method that can be used with
$\ell_1$-minimization to adaptively determine the large coefficients of
polynomial chaos expansions (PCE). The adaptive construction produces
anisotropic basis sets that have more terms in important dimensions and limits
the number of unimportant terms that increase mutual coherence and thus degrade
the performance of $\ell_1$-minimization. The important features and the
accuracy of basis selection are demonstrated with a number of numerical
examples. Specifically, we show that for a given computational budget, basis
selection produces a more accurate PCE than would be obtained if the basis is
fixed a priori. We also demonstrate that basis selection can be applied with
non-uniform random variables and can leverage gradient information.
","[{'version': 'v1', 'created': 'Wed, 30 Jul 2014 15:32:28 GMT'}]",2015-06-22,"[['Jakeman', 'John D.', ''], ['Eldred', 'Michael S.', ''], ['Sargsyan', 'Khachik', '']]","['uncertainty quantification', 'stochastic collocation', 'polynomial chaos', 'ℓ1-minimization', 'sparsity', 'adaptivity', 'basis selection']"
5122,2206.04621,Josep Domingo-Ferrer,"Alberto Blanco-Justicia, David Sanchez, Josep Domingo-Ferrer,
  Krishnamurty Muralidhar","A Critical Review on the Use (and Misuse) of Differential Privacy in
  Machine Learning",ACM Computing Surveys (to appear),"ACM Computing Surveys, vol. 55, no. 8, pp. 1-26, 2023",10.1145/3547139,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We review the use of differential privacy (DP) for privacy protection in
machine learning (ML). We show that, driven by the aim of preserving the
accuracy of the learned models, DP-based ML implementations are so loose that
they do not offer the ex ante privacy guarantees of DP. Instead, what they
deliver is basically noise addition similar to the traditional (and often
criticized) statistical disclosure control approach. Due to the lack of formal
privacy guarantees, the actual level of privacy offered must be experimentally
assessed ex post, which is done very seldom. In this respect, we present
empirical results showing that standard anti-overfitting techniques in ML can
achieve a better utility/privacy/efficiency trade-off than DP.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2022 17:13:10 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Jul 2022 12:37:50 GMT'}]",2023-01-09,"[['Blanco-Justicia', 'Alberto', ''], ['Sanchez', 'David', ''], ['Domingo-Ferrer', 'Josep', ''], ['Muralidhar', 'Krishnamurty', '']]","['differential privacy', 'machine learning', 'federated learning', 'data utility']"
5123,1902.00650,Maodong Pan,"Maodong Pan, Falai Chen, Weihua Tong",Volumetric Spline Parameterization for Isogeometric Analysis,,,10.1016/j.cma.2019.112769,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given the spline representation of the boundary of a three dimensional
domain, constructing a volumetric spline parameterization of the domain (i.e.,
a map from a unit cube to the domain) with the given boundary is a fundamental
problem in isogeometric analysis. A good domain parameterization should satisfy
the following criteria: (1) the parameterization is a bijective map; and (2)
the map has lowest possible distortion. However, none of the state-of-the-art
volumetric parameterization methods has fully addressed the above issues. In
this paper, we propose a three-stage approach for constructing volumetric
parameterization satisfying the above criteria. Firstly, a harmonic map is
computed between a unit cube and the computational domain. Then a bijective map
modeled by a max-min optimization problem is computed in a coarse-to-fine way,
and an algorithm based on divide and conquer strategy is proposed to solve the
optimization problem efficiently. Finally, to ensure high quality of the
parameterization, the MIPS (Most Isometric Parameterizations) method is adopted
to reduce the conformal distortion of the bijective map. We provide several
examples to demonstrate the feasibility of our approach and to compare our
approach with some state-of-the-art methods. The results show that our
algorithm produces bijective parameterization with high quality even for
complex domains.
","[{'version': 'v1', 'created': 'Sat, 2 Feb 2019 06:26:22 GMT'}]",2020-01-08,"[['Pan', 'Maodong', ''], ['Chen', 'Falai', ''], ['Tong', 'Weihua', '']]","['Volumetric parameterization', 'isogeometric analysis', 'max-min optimization', 'MIPS']"
5124,1912.06322,Yoshiaki Inoue,Yoshiaki Inoue,"Queueing Analysis of GPU-Based Inference Servers with Dynamic Batching:
  A Closed-Form Characterization",,,10.1016/j.peva.2020.102183,,cs.PF cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  GPU-accelerated computing is a key technology to realize high-speed inference
servers using deep neural networks (DNNs). An important characteristic of
GPU-based inference is that the computational efficiency, in terms of the
processing speed and energy consumption, drastically increases by processing
multiple jobs together in a batch. In this paper, we formulate GPU-based
inference servers as a batch service queueing model with batch-size dependent
processing times. We first show that the energy efficiency of the server
monotonically increases with the arrival rate of inference jobs, which suggests
that it is energy-efficient to operate the inference server under a utilization
level as high as possible within a latency requirement of inference jobs. We
then derive a closed-form upper bound for the mean latency, which provides a
simple characterization of the latency performance. Through simulation and
numerical experiments, we show that the exact value of the mean latency is well
approximated by this upper bound. We further compare this upper bound with the
latency curve measured in real implementation of GPU-based inference servers
and we show that the real performance curve is well explained by the derived
simple formula.
","[{'version': 'v1', 'created': 'Fri, 13 Dec 2019 04:39:16 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Dec 2020 03:30:02 GMT'}, {'version': 'v3', 'created': 'Tue, 12 Jan 2021 02:03:16 GMT'}]",2021-01-13,"[['Inoue', 'Yoshiaki', '']]","['Machine learning inference', 'GPU servers', 'Dynamic batching', 'Batch-service queue', 'Stochastic orders']"
5125,1805.09979,Armin Haller,"Krzysztof Janowicz, Armin Haller, Simon J D Cox, Danh Le Phuoc, Maxime
  Lefrancois","SOSA: A Lightweight Ontology for Sensors, Observations, Samples, and
  Actuators",,"Journal of Web Semantics, 2018",10.1016/j.websem.2018.06.003,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Sensor, Observation, Sample, and Actuator (SOSA) ontology provides a
formal but lightweight general-purpose specification for modeling the
interaction between the entities involved in the acts of observation,
actuation, and sampling. SOSA is the result of rethinking the W3C-XG Semantic
Sensor Network (SSN) ontology based on changes in scope and target audience,
technical developments, and lessons learned over the past years. SOSA also acts
as a replacement of SSN's Stimulus Sensor Observation (SSO) core. It has been
developed by the first joint working group of the Open Geospatial Consortium
(OGC) and the World Wide Web Consortium (W3C) on \emph{Spatial Data on the
Web}. In this work, we motivate the need for SOSA, provide an overview of the
main classes and properties, and briefly discuss its integration with the new
release of the SSN ontology as well as various other alignments to
specifications such as OGC's Observations and Measurements (O\&M),
Dolce-Ultralite (DUL), and other prominent ontologies. We will also touch upon
common modeling problems and application areas related to publishing and
searching observation, sampling, and actuation data on the Web. The SOSA
ontology and standard can be accessed at
\url{https://www.w3.org/TR/vocab-ssn/}.
","[{'version': 'v1', 'created': 'Fri, 25 May 2018 04:41:54 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Dec 2018 10:13:53 GMT'}]",2018-12-27,"[['Janowicz', 'Krzysztof', ''], ['Haller', 'Armin', ''], ['Cox', 'Simon J D', ''], ['Phuoc', 'Danh Le', ''], ['Lefrancois', 'Maxime', '']]","['Ontology', 'Sensor', 'Observation', 'Actuator', 'Linked Data', 'Web of Things', 'Internet of Things', 'Schema']"
5126,1604.00597,Srinivasan Seshadhri,"S. Balasubramaniyan, B. Subathra, R. C. Hemesh, S. Gurusamy and S.
  Srinivasan","On simulating processor schedules and network protocols within CPS using
  TrueTime",6 pages,"2015 IEEE International Conference on Computational Intelligence
  and Computing Research (ICCIC)",10.1109/ICCIC.2015.7435812,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Studying cyber-physical system (CPS) for a given network protocol and
processor schedules is a challenging task. This investigation illustrates the
role of TrueTime a MATLAB package for simulating CPS encapsulating information
on processor schedules, and network protocols. Properties of CPS such as
temporal behaviors, performance and stability can be studied using the TrueTime
tool. Furthermore, these simulations can be used to benchmark design and
propose design alternatives. The procedure to use the toolbox for simulations
and instantiate various blocks to study CPS is illustrated in the paper.
Finally, an illustrative example has been presented of CPS simulation with
wireless network. Our example demonstrates that TrueTime is a useful tool for
studying CPS performance, timing behavior, schedulability analysis, and
studying suitable network protocols.
","[{'version': 'v1', 'created': 'Sun, 3 Apr 2016 05:53:08 GMT'}]",2016-11-15,"[['Balasubramaniyan', 'S.', ''], ['Subathra', 'B.', ''], ['Hemesh', 'R. C.', ''], ['Gurusamy', 'S.', ''], ['Srinivasan', 'S.', '']]","['Cyber-Physical System (CPS)', 'network protocol', 'Processor Scheduling', 'TrueTime', 'simulations', 'Timing behavior', 'CPS performance']"
5127,1511.04861,Hyoung-Joo Kim,"Woo-Hyun Lee, Hee-Gook Jun, Hyoung-Joo Kim",Hadoop Mapreduce Performance Enhancement Using In-node Combiners,"International Journal of Computer Science & Information Technology,
  2015",,10.5121/ijcsit.2015.7501,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While advanced analysis of large dataset is in high demand, data sizes have
surpassed capabilities of conventional software and hardware. Hadoop framework
distributes large datasets over multiple commodity servers and performs
parallel computations. We discuss the I/O bottlenecks of Hadoop framework and
propose methods for enhancing I/O performance. A proven approach is to cache
data to maximize memory-locality of all map tasks. We introduce an approach to
optimize I/O, the in-node combining design which extends the traditional
combiner to a node level. The in-node combiner reduces the total number of
intermediate results and curtail network traffic between mappers and reducers.
","[{'version': 'v1', 'created': 'Mon, 16 Nov 2015 08:27:58 GMT'}]",2015-11-17,"[['Lee', 'Woo-Hyun', ''], ['Jun', 'Hee-Gook', ''], ['Kim', 'Hyoung-Joo', '']]","['Big Data', 'Hadoop', 'MapReduce', 'NoSQL', 'Data Management.  1']"
5128,cs/0511035,M. Angeles Serrano,"M. Angeles Serrano, Ana Maguitman, Marian Boguna, Santo Fortunato,
  Alessandro Vespignani",Decoding the structure of the WWW: facts versus sampling biases,"10 pages 19 figures. Values in Table 2 and Figure 1 corrected. Figure
  7 updated. Minor changes in the text","ACM Transactions on the Web (TWEB) 1, 10 (2007)",,,cs.NI cond-mat.dis-nn physics.soc-ph,,"  The understanding of the immense and intricate topological structure of the
World Wide Web (WWW) is a major scientific and technological challenge. This
has been tackled recently by characterizing the properties of its
representative graphs in which vertices and directed edges are identified with
web-pages and hyperlinks, respectively. Data gathered in large scale crawls
have been analyzed by several groups resulting in a general picture of the WWW
that encompasses many of the complex properties typical of rapidly evolving
networks. In this paper, we report a detailed statistical analysis of the
topological properties of four different WWW graphs obtained with different
crawlers. We find that, despite the very large size of the samples, the
statistical measures characterizing these graphs differ quantitatively, and in
some cases qualitatively, depending on the domain analyzed and the crawl used
for gathering the data. This spurs the issue of the presence of sampling biases
and structural differences of Web crawls that might induce properties not
representative of the actual global underlying graph. In order to provide a
more accurate characterization of the Web graph and identify observables which
are clearly discriminating with respect to the sampling process, we study the
behavior of degree-degree correlation functions and the statistics of
reciprocal connections. The latter appears to enclose the relevant correlations
of the WWW graph and carry most of the topological information of theWeb. The
analysis of this quantity is also of major interest in relation to the
navigability and searchability of the Web.
","[{'version': 'v1', 'created': 'Tue, 8 Nov 2005 20:18:55 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Feb 2006 16:48:42 GMT'}]",2008-01-23,"[['Serrano', 'M. Angeles', ''], ['Maguitman', 'Ana', ''], ['Boguna', 'Marian', ''], ['Fortunato', 'Santo', ''], ['Vespignani', 'Alessandro', '']]","['Web graph structure', 'Web measurement', 'crawler biases', 'statisticalanalysis']"
5129,1209.1048,Varun Ojha,"Varun Kumar Ojha, Paramartha Dutta, Hiranmay Saha","Performance Analysis Of Neuro Genetic Algorithm Applied On Detecting
  Proportion Of Components In Manhole Gas Mixture","16 pages,11 figures",,10.5121/ijaia.2012.3406,,cs.NE cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The article presents performance analysis of a real valued neuro genetic
algorithm applied for the detection of proportion of the gases found in manhole
gas mixture. The neural network (NN) trained using genetic algorithm (GA) leads
to concept of neuro genetic algorithm, which is used for implementing an
intelligent sensory system for the detection of component gases present in
manhole gas mixture Usually a manhole gas mixture contains several toxic gases
like Hydrogen Sulfide, Ammonia, Methane, Carbon Dioxide, Nitrogen Oxide, and
Carbon Monoxide. A semiconductor based gas sensor array used for sensing
manhole gas components is an integral part of the proposed intelligent system.
It consists of many sensor elements, where each sensor element is responsible
for sensing particular gas component. Multiple sensors of different gases used
for detecting gas mixture of multiple gases, results in cross-sensitivity. The
cross-sensitivity is a major issue and the problem is viewed as pattern
recognition problem. The objective of this article is to present performance
analysis of the real valued neuro genetic algorithm which is applied for
multiple gas detection.
","[{'version': 'v1', 'created': 'Wed, 15 Aug 2012 04:29:47 GMT'}]",2012-09-06,"[['Ojha', 'Varun Kumar', ''], ['Dutta', 'Paramartha', ''], ['Saha', 'Hiranmay', '']]","['Gas mixture', 'Gas sensor array', 'Cross-sensitivity', 'Floating point', 'Genetic algorithm', 'Neural network', 'Optimization', 'Computational complexity']"
5130,1812.01555,Rizwan Ahmed Khan,"Rizwan Ahmed Khan, Crenn Arthur, Alexandre Meyer, Saida Bouakaz","A novel database of Children's Spontaneous Facial Expressions
  (LIRIS-CSE)",,"Image and Vision Computing, 2019",10.1016/j.imavis.2019.02.004,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computing environment is moving towards human-centered designs instead of
computer centered designs and human's tend to communicate wealth of information
through affective states or expressions. Traditional Human Computer Interaction
(HCI) based systems ignores bulk of information communicated through those
affective states and just caters for user's intentional input. Generally, for
evaluating and benchmarking different facial expression analysis algorithms,
standardized databases are needed to enable a meaningful comparison. In the
absence of comparative tests on such standardized databases it is difficult to
find relative strengths and weaknesses of different facial expression
recognition algorithms. In this article we present a novel video database for
Children's Spontaneous facial Expressions (LIRIS-CSE). Proposed video database
contains six basic spontaneous facial expressions shown by 12 ethnically
diverse children between the ages of 6 and 12 years with mean age of 7.3 years.
To the best of our knowledge, this database is first of its kind as it records
and shows spontaneous facial expressions of children. Previously there were few
database of children expressions and all of them show posed or exaggerated
expressions which are different from spontaneous or natural expressions. Thus,
this database will be a milestone for human behavior researchers. This database
will be a excellent resource for vision community for benchmarking and
comparing results. In this article, we have also proposed framework for
automatic expression recognition based on convolutional neural network (CNN)
architecture with transfer learning approach. Proposed architecture achieved
average classification accuracy of 75% on our proposed database i.e. LIRIS-CSE.
","[{'version': 'v1', 'created': 'Tue, 4 Dec 2018 17:49:25 GMT'}, {'version': 'v2', 'created': 'Sun, 20 Jan 2019 16:39:21 GMT'}]",2019-03-28,"[['Khan', 'Rizwan Ahmed', ''], ['Arthur', 'Crenn', ''], ['Meyer', 'Alexandre', ''], ['Bouakaz', 'Saida', '']]","['Facial expressions database', 'spontaneous expressions', 'convolutional neural network', 'expression recognition', 'transferlearning']"
5131,1208.2362,Diederik Aerts,"Diederik Aerts, Jan Broekaert, Liane Gabora and Tomas Veloz",The Guppy Effect as Interference,10 pages,"Quantum Interaction. Lecture Notes in Computer Science, 7620, pp
  36-47, 2012",10.1007/978-3-642-35659-9_4,,cs.AI quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  People use conjunctions and disjunctions of concepts in ways that violate the
rules of classical logic, such as the law of compositionality. Specifically,
they overextend conjunctions of concepts, a phenomenon referred to as the Guppy
Effect. We build on previous efforts to develop a quantum model that explains
the Guppy Effect in terms of interference. Using a well-studied data set with
16 exemplars that exhibit the Guppy Effect, we developed a 17-dimensional
complex Hilbert space H that models the data and demonstrates the relationship
between overextension and interference. We view the interference effect as, not
a logical fallacy on the conjunction, but a signal that out of the two
constituent concepts, a new concept has emerged.
","[{'version': 'v1', 'created': 'Sat, 11 Aug 2012 15:39:18 GMT'}]",2013-01-08,"[['Aerts', 'Diederik', ''], ['Broekaert', 'Jan', ''], ['Gabora', 'Liane', ''], ['Veloz', 'Tomas', '']]","['theory of concepts', 'quantum cognition', 'Guppy effect', 'concept combination', 'interference']"
5132,1111.3548,Francisco Soulignac,Francisco J. Soulignac,Fully dynamic recognition of proper circular-arc graphs,"60 pages, 15 figures",,10.1007/s00453-013-9835-7,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a fully dynamic algorithm for the recognition of proper
circular-arc (PCA) graphs. The allowed operations on the graph involve the
insertion and removal of vertices (together with its incident edges) or edges.
Edge operations cost O(log n) time, where n is the number of vertices of the
graph, while vertex operations cost O(log n + d) time, where d is the degree of
the modified vertex. We also show incremental and decremental algorithms that
work in O(1) time per inserted or removed edge. As part of our algorithm, fully
dynamic connectivity and co-connectivity algorithms that work in O(log n) time
per operation are obtained. Also, an O(\Delta) time algorithm for determining
if a PCA representation corresponds to a co-bipartite graph is provided, where
\Delta\ is the maximum among the degrees of the vertices. When the graph is
co-bipartite, a co-bipartition of each of its co-components is obtained within
the same amount of time.
","[{'version': 'v1', 'created': 'Tue, 15 Nov 2011 15:06:54 GMT'}]",2014-08-18,"[['Soulignac', 'Francisco J.', '']]","['dynamic recognition', 'proper circular-arc graphs', 'round graphs', 'co-connectivity']"
5133,1610.00976,Adam Chehouri,"Adam Chehouri, Rafic Younes, Jean Perron, Adrian Ilinca (UQAR)","A Constraint-Handling Technique for Genetic Algorithms using a Violation
  Factor",,"Journal of Computer Science, Science Publications, 2016, 12 (7),
  pp.350-362",10.3844/jcssp.2016.350.362,,cs.AI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the years, several meta-heuristic algorithms were proposed and are now
emerging as common methods for constrained optimization problems. Among them,
genetic algorithms (GA's) shine as popular evolutionary algorithms (EA's) in
engineering optimization. Most engineering design problems are difficult to
resolve with conventional optimization algorithms because they are highly
nonlinear and contain constraints. In order to handle these constraints, the
most common technique is to apply penalty functions. The major drawback is that
they require tuning of parameters, which can be very challenging. In this
paper, we present a constraint-handling technique for GA's solely using the
violation factor, called VCH (Violation Constraint-Handling) method. Several
benchmark problems from the literature are examined. The VCH technique was able
to provide a consistent performance and match results from other GA-based
techniques.
","[{'version': 'v1', 'created': 'Tue, 4 Oct 2016 13:21:21 GMT'}]",2016-10-05,"[['Chehouri', 'Adam', '', 'UQAR'], ['Younes', 'Rafic', '', 'UQAR'], ['Perron', 'Jean', '', 'UQAR'], ['Ilinca', 'Adrian', '', 'UQAR']]","['Constraint-Handling', 'Genetic Algorithm', 'Constrained Optimization', 'Engineering Optimization', 'Evolutionary Algorithms']"
5134,1304.7638,Adriano J. Holanda PhD,"Monica G. Campiteli and Adriano J. Holanda and Leonardo D.H. Soares
  and Paulo R.C. Soles and Osame Kinouchi",Lobby index as a network centrality measure,"11 pages, 4 figures. arXiv admin note: substantial text overlap with
  arXiv:1005.4803",,10.1016/j.physa.2013.06.065,,cs.SI cs.DL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the lobby index (l-index for short) as a local node centrality
measure for complex networks. The l-inde is compared with degree (a local
measure), betweenness and Eigenvector centralities (two global measures) in the
case of biological network (Yeast interaction protein-protein network) and a
linguistic network (Moby Thesaurus II). In both networks, the l-index has poor
correlation with betweenness but correlates with degree and Eigenvector. Being
a local measure, one can take advantage by using the l-index because it carries
more information about its neighbors when compared with degree centrality,
indeed it requires less time to compute when compared with Eigenvector
centrality. Results suggests that l-index produces better results than degree
and Eigenvector measures for ranking purposes, becoming suitable as a tool to
perform this task.
","[{'version': 'v1', 'created': 'Mon, 29 Apr 2013 12:24:39 GMT'}, {'version': 'v2', 'created': 'Wed, 1 May 2013 05:01:18 GMT'}, {'version': 'v3', 'created': 'Fri, 21 Jun 2013 21:19:58 GMT'}, {'version': 'v4', 'created': 'Wed, 26 Jun 2013 20:47:28 GMT'}]",2015-06-15,"[['Campiteli', 'Monica G.', ''], ['Holanda', 'Adriano J.', ''], ['Soares', 'Leonardo D. H.', ''], ['Soles', 'Paulo R. C.', ''], ['Kinouchi', 'Osame', '']]","['lobby index', 'centrality', 'degree', 'betweenness', 'Eigenvector', 'Hirsch index']"
5135,2102.10837,Subho Sankar Banerjee,"Subho S. Banerjee, Saurabh Jha, Zbigniew T. Kalbarczyk, Ravishankar K.
  Iyer","BayesPerf: Minimizing Performance Monitoring Errors Using Bayesian
  Statistics",,"Proceedings of the Twenty-Sixth International Conference on
  Architectural Support for Programming Languages and Operating Systems (ASPLOS
  21), 2021",10.1145/3445814.3446739,,cs.DC cs.AI cs.AR cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hardware performance counters (HPCs) that measure low-level architectural and
microarchitectural events provide dynamic contextual information about the
state of the system. However, HPC measurements are error-prone due to non
determinism (e.g., undercounting due to event multiplexing, or OS
interrupt-handling behaviors). In this paper, we present BayesPerf, a system
for quantifying uncertainty in HPC measurements by using a domain-driven
Bayesian model that captures microarchitectural relationships between HPCs to
jointly infer their values as probability distributions. We provide the design
and implementation of an accelerator that allows for low-latency and low-power
inference of the BayesPerf model for x86 and ppc64 CPUs. BayesPerf reduces the
average error in HPC measurements from 40.1% to 7.6% when events are being
multiplexed. The value of BayesPerf in real-time decision-making is illustrated
with a simple example of scheduling of PCIe transfers.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2021 09:00:14 GMT'}]",2021-02-23,"[['Banerjee', 'Subho S.', ''], ['Jha', 'Saurabh', ''], ['Kalbarczyk', 'Zbigniew T.', ''], ['Iyer', 'Ravishankar K.', '']]","['Performance Counter', 'Sampling Errors', 'Error Detection', 'Error Correction', 'Probabilistic Graphical Model', 'Accelerator']"
5136,1512.03319,Monica Dragoicea,Monica Dragoicea,Diversity and Intelligence in Multi-robot Teams,,"Proceedings of the 15th Int. Conference on Control Systems and
  Computer Science - CSCS15, 25-27 Mai, Bucuresti, Romania, pag. 452-457, 2005",10.13140/RG.2.1.4177.8000,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This research proposes new tools for investigation of behavioral diversity in
multi-robot systems and a significant body of results using these tools in
simulated and real mobile robot experiments. The experiments specifically
describe a framework of defining behavior-based strategies for multi-robot
tasks as robot foraging, robot soccer and robot formation. The research focuses
specifically on motor schema-based multi-robot systems, which are an important
example of behavior-based control.
","[{'version': 'v1', 'created': 'Thu, 10 Dec 2015 16:49:30 GMT'}]",2015-12-11,"[['Dragoicea', 'Monica', '']]","['mobile robots', 'multi-agent teams', 'finite state machines', 'cooperation in multiagent teams']"
5137,2109.02484,Joshua Landgraf,"Joshua Landgraf, Tiffany Yang, Will Lin, Christopher J. Rossbach, Eric
  Schkufza",Compiler-Driven FPGA Virtualization with SYNERGY,,"26th ACM International Conference on Architectural Support for
  Programming Languages and Operating Systems (ASPLOS 2021), 2021, pp. 818-831",10.1145/3445814.3446755,,cs.DC cs.AR cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  FPGAs are increasingly common in modern applications, and cloud providers now
support on-demand FPGA acceleration in data centers. Applications in data
centers run on virtual infrastructure, where consolidation, multi-tenancy, and
workload migration enable economies of scale that are fundamental to the
provider's business. However, a general strategy for virtualizing FPGAs has yet
to emerge. While manufacturers struggle with hardware-based approaches, we
propose a compiler/runtime-based solution called Synergy. We show a compiler
transformation for Verilog programs that produces code able to yield control to
software at sub-clock-tick granularity according to the semantics of the
original program. Synergy uses this property to efficiently support core
virtualization primitives: suspend and resume, program migration, and
spatial/temporal multiplexing, on hardware which is available today. We use
Synergy to virtualize FPGA workloads across a cluster of Altera SoCs and Xilinx
FPGAs on Amazon F1. The workloads require no modification, run within 3-4x of
unvirtualized performance, and incur a modest increase in FPGA fabric
utilization.
","[{'version': 'v1', 'created': 'Sat, 28 Aug 2021 03:09:20 GMT'}]",2021-09-07,"[['Landgraf', 'Joshua', ''], ['Yang', 'Tiffany', ''], ['Lin', 'Will', ''], ['Rossbach', 'Christopher J.', ''], ['Schkufza', 'Eric', '']]","['Compilers', 'FPGAs', 'Virtualization', 'Operating Systems']"
5138,1806.03251,Shiva H C Prasad Prof,"Shiva Prasad H C, Giridhar Kamath, Gopalkrishna Barkur, Rakesh Naik",Does supplier evaluation impact process improvement?,"24 pages, 09 figures, 13 tables","Journal of Industrial Engineering and Management, Vol 9, No 3
  (2016),708-731",10.3926/jiem.1777,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  The research explores and examines factors for supplier evaluation and its
impact on process improvement particularly aiming on a steel pipe manufacturing
firm in Gujarat, India. Data was collected using in-depth interview. The
questionnaire primarily involves the perception of evaluation of supplier.
Factors influencing supplier evaluation and its influence on process
improvement is also examined in this study. The model testing and validation
were done using partial least square method. Outcomes signified that the
factors that influence the evaluation of the supplier are quality, cost,
delivery and supplier relationship management. The study depicted that quality
and cost factors for supplier evaluation are insignificant. The delivery and
supplier relationship management have the significant influence on the
evaluation of the supplier. The research also depicted that supplier evaluation
has a significant influence on process improvement. Many researchers have
considered quality, cost and delivery as the factors for evaluating the
suppliers. But for a company, it is quintessential to have a good relationship
with the supplier. Hence, the factor, supplier relationship management is
considered for the study. Also, the case study company focused more on quality
and cost factors for the supplier evaluation of the firm. However, delivery and
supplier relationship management are also equally important for a firm in
evaluating the supplier.
","[{'version': 'v1', 'created': 'Thu, 31 May 2018 14:03:23 GMT'}]",2018-06-11,"[['C', 'Shiva Prasad H', ''], ['Kamath', 'Giridhar', ''], ['Barkur', 'Gopalkrishna', ''], ['Naik', 'Rakesh', '']]","['cost', 'delivery', 'partial least square', 'process improvement', 'quality', 'supplier evaluation', 'supplier']"
5139,1208.0950,Nilanjan  Dey,"Tanmay Bhattacharya, Nilanjan Dey, S. R. Bhadra Chaudhuri",A Session based Multiple Image Hiding Technique using DWT and DCT,"4 pages,16 figures, ""Published with International Journal of Computer
  Applications (IJCA)""","Tanmay Bhattacharya,Nilanjan Dey,Bhadra S R Chaudhuri. Article:A
  Session Based Multiple Image Hiding Technique using DWT&DCT.International
  Journal of Computer Applications 38(5):18-21,January 2012.Published by
  Foundation of Computer Science",10.5120/4684-6808 10.5120/4684-6808 10.5120/4684-6808,,cs.CR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work proposes Steganographic technique for hiding multiple images in a
color image based on DWT and DCT. The cover image is decomposed into three
separate color planes namely R, G and B. Individual planes are decomposed into
subbands using DWT. DCT is applied in HH component of each plane. Secret images
are dispersed among the selected DCT coefficients using a pseudo random
sequence and a Session key. Secret images are extracted using the session key
and the size of the images from the planer decomposed stego image. In this
approach the stego image generated is of acceptable level of imperceptibility
and distortion compared to the cover image and the overall security is high.
","[{'version': 'v1', 'created': 'Sat, 4 Aug 2012 18:10:35 GMT'}]",2012-08-16,"[['Bhattacharya', 'Tanmay', ''], ['Dey', 'Nilanjan', ''], ['Chaudhuri', 'S. R. Bhadra', '']]","['DCT', 'Session Based Key', 'Pseudo Random Sequence', 'RGB Color planes']"
5140,0806.0837,Leonid Reyzin,"Nenad Dedi\'c, Gene Itkis, Leonid Reyzin, Scott Russell",Upper and Lower Bounds on Black-Box Steganography,27 pages; to be published in Journal of Cryptology,,10.1007/s00145-008-9020-3,,cs.CR cs.CC cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the limitations of steganography when the sender is not using any
properties of the underlying channel beyond its entropy and the ability to
sample from it. On the negative side, we show that the number of samples the
sender must obtain from the channel is exponential in the rate of the
stegosystem. On the positive side, we present the first secret-key stegosystem
that essentially matches this lower bound regardless of the entropy of the
underlying channel. Furthermore, for high-entropy channels, we present the
first secret-key stegosystem that matches this lower bound statelessly (i.e.,
without requiring synchronized state between sender and receiver).
","[{'version': 'v1', 'created': 'Wed, 4 Jun 2008 19:07:48 GMT'}]",2008-06-05,"[['Dedić', 'Nenad', ''], ['Itkis', 'Gene', ''], ['Reyzin', 'Leonid', ''], ['Russell', 'Scott', '']]","['steganography', 'covert communication', 'rejection sampling', 'lower bound', 'pseudorandomnness', 'information hiding', 'huge random objects']"
5141,1612.06962,Zijun Wu,"Zijun Wu, Rolf Moehring, Jianhui Lai","Stochastic Runtime Analysis of a Cross Entropy Algorithm for Traveling
  Salesman Problems","40 pages, 7 figures","Theoretical Computer Science, 2017",10.1016/j.tcs.2017.10.012,,cs.DS cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article analyzes the stochastic runtime of a Cross-Entropy Algorithm on
two classes of traveling salesman problems. The algorithm shares main features
of the famous Max-Min Ant System with iteration-best reinforcement.
  For simple instances that have a $\{1,n\}$-valued distance function and a
unique optimal solution, we prove a stochastic runtime of $O(n^{6+\epsilon})$
with the vertex-based random solution generation, and a stochastic runtime of
$O(n^{3+\epsilon}\ln n)$ with the edge-based random solution generation for an
arbitrary $\epsilon\in (0,1)$. These runtimes are very close to the known
expected runtime for variants of Max-Min Ant System with best-so-far
reinforcement. They are obtained for the stronger notion of stochastic runtime,
which means that an optimal solution is obtained in that time with an
overwhelming probability, i.e., a probability tending exponentially fast to one
with growing problem size.
  We also inspect more complex instances with $n$ vertices positioned on an
$m\times m$ grid. When the $n$ vertices span a convex polygon, we obtain a
stochastic runtime of $O(n^{3}m^{5+\epsilon})$ with the vertex-based random
solution generation, and a stochastic runtime of $O(n^{2}m^{5+\epsilon})$ for
the edge-based random solution generation. When there are $k = O(1)$ many
vertices inside a convex polygon spanned by the other $n-k$ vertices, we obtain
a stochastic runtime of $O(n^{4}m^{5+\epsilon}+n^{6k-1}m^{\epsilon})$ with the
vertex-based random solution generation, and a stochastic runtime of
$O(n^{3}m^{5+\epsilon}+n^{3k}m^{\epsilon})$ with the edge-based random solution
generation. These runtimes are better than the expected runtime for the
so-called $(\mu\!+\!\lambda)$ EA reported in a recent article, and again
obtained for the stronger notion of stochastic runtime.
","[{'version': 'v1', 'created': 'Wed, 21 Dec 2016 03:24:26 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Oct 2017 03:24:57 GMT'}]",2017-12-21,"[['Wu', 'Zijun', ''], ['Moehring', 'Rolf', ''], ['Lai', 'Jianhui', '']]","['probabilistic analysis of algorithms', 'stochastic runtime analysisof evolutionary algorithms', 'Cross Entropy algorithm', 'Max-Min AntSystem', '(µ+λ) EA']"
5142,2105.10648,Wenjie Wang,"Wenjie Wang, Fuli Feng, Xiangnan He, Xiang Wang, and Tat-Seng Chua",Deconfounded Recommendation for Alleviating Bias Amplification,,"Proceedings of the 27th ACM SIGKDD Conference on Knowledge
  Discoveryand Data Mining (KDD 2021)",10.1145/3447548.3467249,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender systems usually amplify the biases in the data. The model learned
from historical interactions with imbalanced item distribution will amplify the
imbalance by over-recommending items from the major groups. Addressing this
issue is essential for a healthy ecosystem of recommendation in the long run.
Existing works apply bias control to the ranking targets (e.g., calibration,
fairness, and diversity), but ignore the true reason for bias amplification and
trade-off the recommendation accuracy.
  In this work, we scrutinize the cause-effect factors for bias amplification,
identifying the main reason lies in the confounder effect of imbalanced item
distribution on user representation and prediction score. The existence of such
confounder pushes us to go beyond merely modeling the conditional probability
and embrace the causal modeling for recommendation. Towards this end, we
propose a Deconfounded Recommender System (DecRS), which models the causal
effect of user representation on the prediction score. The key to eliminating
the impact of the confounder lies in backdoor adjustment, which is however
difficult to do due to the infinite sample space of the confounder. For this
challenge, we contribute an approximation operator for backdoor adjustment
which can be easily plugged into most recommender models. Lastly, we devise an
inference strategy to dynamically regulate backdoor adjustment according to
user status. We instantiate DecRS on two representative models FM and NFM, and
conduct extensive experiments over two benchmarks to validate the superiority
of our proposed DecRS.
","[{'version': 'v1', 'created': 'Sat, 22 May 2021 06:20:39 GMT'}]",2021-05-25,"[['Wang', 'Wenjie', ''], ['Feng', 'Fuli', ''], ['He', 'Xiangnan', ''], ['Wang', 'Xiang', ''], ['Chua', 'Tat-Seng', '']]","['Deconfounded Recommendation', 'User Interest Imbalance', 'BiasAmplification']"
5143,1903.07477,Tomoyuki Yamakami,Tomoyuki Yamakami,"One-Way Topological Automata and the Tantalizing Effects of Their
  Topological Features","(10pt, A4, pp21) This is a complete and corrected version of an
  extended abstract that appeared in the Proceedings of the 10th International
  Workshop on Non-Classical Models of Automata and Applications (NCMA 2018),
  August 21-22, 2018, Kosice, Slovakia, Osterreichische Computer Gesellschaft
  (the Austrian Computer Society), pp. 197--214, 2018","(journal version) Journal of Automata, Languages and Combinatorics
  25(2-3): 235-273 (2020)",10.25596/jalc-2020-235,,cs.FL cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We cast new light on the existing models of one-way deterministic topological
automata by introducing a fresh but general, convenient model, in which, as
each input symbol is read, an interior system of an automaton, known as a
configuration, continues to evolve in a topological space by applying
continuous transition operators one by one. The acceptance and rejection of a
given input are determined by observing the interior system after the input is
completely processed. Such automata naturally generalize one-way finite
automata of various types, including deterministic, probabilistic, quantum, and
pushdown automata. We examine the strengths and weaknesses of the power of this
new automata model when recognizing formal languages. We investigate
tantalizing effects of various topological features of our topological automata
by analyzing their behaviors when different kinds of topological spaces and
continuous maps, which are used respectively as configuration spaces and
transition operators, are provided to the automata. Finally, we present goals
and directions of future studies on the topological features of topological
automata.
","[{'version': 'v1', 'created': 'Mon, 18 Mar 2019 14:35:24 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Nov 2019 12:05:09 GMT'}, {'version': 'v3', 'created': 'Mon, 17 Aug 2020 15:12:47 GMT'}]",2021-04-19,"[['Yamakami', 'Tomoyuki', '']]","['topological automata', 'topological space', 'continuous map', 'compact', 'discrete topology', 'Kolmogorov separation axiom', 'quantum finite automata']"
5144,1004.3314,Christoph Koutschan,Christoph Koutschan,A Fast Approach to Creative Telescoping,"9 pages, 1 table, final version as it appeared in the journal","Mathematics in Computer Science 4(2-3), pp. 259-266, 2010",10.1007/s11786-010-0055-0,,cs.SC math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this note we reinvestigate the task of computing creative telescoping
relations in differential-difference operator algebras. Our approach is based
on an ansatz that explicitly includes the denominators of the delta parts. We
contribute several ideas of how to make an implementation of this approach
reasonably fast and provide such an implementation. A selection of examples
shows that it can be superior to existing methods by a large factor.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2010 22:03:57 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Jun 2011 00:00:05 GMT'}]",2011-06-28,"[['Koutschan', 'Christoph', '']]","['holonomic functions', 'special functions', 'symbolic integration', 'symbolic summation', 'creative telescoping', 'Ore algebra', 'WZ theory']"
5145,1903.12489,Elnaz Soleimani,"Elnaz Soleimani, Ehsan Nazerfard","Cross-Subject Transfer Learning in Human Activity Recognition Systems
  using Generative Adversarial Networks","9 pages, 4 figures",,10.1016/j.neucom.2020.10.056,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Application of intelligent systems especially in smart homes and
health-related topics has been drawing more attention in the last decades.
Training Human Activity Recognition (HAR) models -- as a major module --
requires a fair amount of labeled data. Despite training with large datasets,
most of the existing models will face a dramatic performance drop when they are
tested against unseen data from new users. Moreover, recording enough data for
each new user is unviable due to the limitations and challenges of working with
human users. Transfer learning techniques aim to transfer the knowledge which
has been learned from the source domain (subject) to the target domain in order
to decrease the models' performance loss in the target domain. This paper
presents a novel method of adversarial knowledge transfer named SA-GAN stands
for Subject Adaptor GAN which utilizes Generative Adversarial Network framework
to perform cross-subject transfer learning in the domain of wearable
sensor-based Human Activity Recognition. SA-GAN outperformed other
state-of-the-art methods in more than 66% of experiments and showed the second
best performance in the remaining 25% of experiments. In some cases, it reached
up to 90% of the accuracy which can be obtained by supervised training over the
same domain data.
","[{'version': 'v1', 'created': 'Fri, 29 Mar 2019 12:50:04 GMT'}]",2020-11-12,"[['Soleimani', 'Elnaz', ''], ['Nazerfard', 'Ehsan', '']]","['Transfer Learning', 'Generative Adversarial Network', 'Labeled Data', 'Human Activity Recognition', 'Cross-Subject Transfer Learning']"
5146,1705.08283,Andreu Vall,"Andreu Vall, Hamid Eghbal-zadeh, Matthias Dorfer, Markus Schedl,
  Gerhard Widmer","Music Playlist Continuation by Learning from Hand-Curated Examples and
  Song Features: Alleviating the Cold-Start Problem for Rare and Out-of-Set
  Songs",,,10.1145/3125486.3125494,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated music playlist generation is a specific form of music
recommendation. Generally stated, the user receives a set of song suggestions
defining a coherent listening session. We hypothesize that the best way to
convey such playlist coherence to new recommendations is by learning it from
actual curated examples, in contrast to imposing ad hoc constraints.
Collaborative filtering methods can be used to capture underlying patterns in
hand-curated playlists. However, the scarcity of thoroughly curated playlists
and the bias towards popular songs result in the vast majority of songs
occurring in very few playlists and thus being poorly recommended. To overcome
this issue, we propose an alternative model based on a song-to-playlist
classifier, which learns the underlying structure from actual playlists while
leveraging song features derived from audio, social tags and independent
listening logs. Experiments on two datasets of hand-curated playlists show
competitive performance compared to collaborative filtering when sufficient
training data is available and more robust performance when recommending rare
and out-of-set songs. For example, both approaches achieve a recall@100 of
roughly 35% for songs occurring in 5 or more training playists, whereas the
proposed model achieves a recall@100 of roughly 15% for songs occurring in 4 or
less training playlists, compared to the 3% achieved by collaborative
filtering.
","[{'version': 'v1', 'created': 'Tue, 23 May 2017 14:05:11 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Jun 2017 09:52:36 GMT'}, {'version': 'v3', 'created': 'Thu, 7 Sep 2017 09:45:31 GMT'}]",2017-09-08,"[['Vall', 'Andreu', ''], ['Eghbal-zadeh', 'Hamid', ''], ['Dorfer', 'Matthias', ''], ['Schedl', 'Markus', ''], ['Widmer', 'Gerhard', '']]","['automated playlist generation', 'cold-start problem', 'hybrid recommender systems', 'music information retrieval', 'neural networks']"
5147,1811.02068,Yuqi Zhou,"Yuqi Zhou, Jorge Cisneros-Saldana, Le Xie","False Analog Data Injection Attack Towards Topology Errors: Formulation
  and Feasibility Analysis","5 pages, 7 figures, Proc. of 2018 IEEE Power and Energy Society
  General Meeting",,10.1109/PESGM.2018.8586585,,cs.SY math.NA math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a class of false analog data injection attack that
can misguide the system as if topology errors had occurred. By utilizing the
measurement redundancy with respect to the state variables, the adversary who
knows the system configuration is shown to be capable of computing the
corresponding measurement value with the intentionally misguided topology. The
attack is designed such that the state as well as residue distribution after
state estimation will converge to those in the system with a topology error. It
is shown that the attack can be launched even if the attacker is constrained to
some specific meters. The attack is detrimental to the system since
manipulation of analog data will lead to a forged digital topology status, and
the state after the error is identified and modified will be significantly
biased with the intended wrong topology. The feasibility of the proposed attack
is demonstrated with an IEEE 14-bus system.
","[{'version': 'v1', 'created': 'Mon, 5 Nov 2018 22:33:46 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Nov 2018 00:05:45 GMT'}]",2019-07-11,"[['Zhou', 'Yuqi', ''], ['Cisneros-Saldana', 'Jorge', ''], ['Xie', 'Le', '']]","['False data injection attacks', 'state estimation', 'topology errors', 'power system monitoring']"
5148,1901.09657,Zhixuan Zhou,"Zhixuan Zhou, Huankang Guan, Meghana Moorthy Bhat and Justin Hsu",Fake News Detection via NLP is Vulnerable to Adversarial Attacks,"11th International Conference on Agents and Artificial Intelligence
  (ICAART 2019)",,10.5220/0007566307940800,,cs.SI cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  News plays a significant role in shaping people's beliefs and opinions. Fake
news has always been a problem, which wasn't exposed to the mass public until
the past election cycle for the 45th President of the United States. While
quite a few detection methods have been proposed to combat fake news since
2015, they focus mainly on linguistic aspects of an article without any fact
checking. In this paper, we argue that these models have the potential to
misclassify fact-tampering fake news as well as under-written real news.
Through experiments on Fakebox, a state-of-the-art fake news detector, we show
that fact tampering attacks can be effective. To address these weaknesses, we
argue that fact checking should be adopted in conjunction with linguistic
characteristics analysis, so as to truly separate fake news from real news. A
crowdsourced knowledge graph is proposed as a straw man solution to collecting
timely facts about news events.
","[{'version': 'v1', 'created': 'Sat, 5 Jan 2019 11:56:13 GMT'}]",2019-03-18,"[['Zhou', 'Zhixuan', ''], ['Guan', 'Huankang', ''], ['Bhat', 'Meghana Moorthy', ''], ['Hsu', 'Justin', '']]","['Fake News Detection', 'NLP', 'Attack', 'Fact Checking', 'Outsourced Knowledge Graph']"
5149,1412.6761,Masaki Nakanishi,"Masaki Nakanishi, Abuzer Yakary{\i}lmaz and Aida Gainutdinova",New results on classical and quantum counter automata,21 pages,"Discrete Mathematics & Theoretical Computer Science, vol. 21 no.
  4, Automata, Logic and Semantics (September 27, 2019) dmtcs:5788",10.23638/DMTCS-21-4-12,,cs.FL cs.CC quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that one-way quantum one-counter automaton with zero-error is more
powerful than its probabilistic counterpart on promise problems. Then, we
obtain a similar separation result between Las Vegas one-way probabilistic
one-counter automaton and one-way deterministic one-counter automaton.
  We also obtain new results on classical counter automata regarding language
recognition. It was conjectured that one-way probabilistic one blind-counter
automata cannot recognize Kleene closure of equality language [A. Yakaryilmaz:
Superiority of one-way and realtime quantum machines. RAIRO - Theor. Inf. and
Applic. 46(4): 615-641 (2012)]. We show that this conjecture is false, and also
show several separation results for blind/non-blind counter automata.
","[{'version': 'v1', 'created': 'Sun, 21 Dec 2014 10:41:03 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Jul 2016 10:13:01 GMT'}, {'version': 'v3', 'created': 'Wed, 28 Mar 2018 02:06:47 GMT'}, {'version': 'v4', 'created': 'Wed, 25 Sep 2019 01:44:36 GMT'}]",2020-02-19,"[['Nakanishi', 'Masaki', ''], ['Yakaryılmaz', 'Abuzer', ''], ['Gainutdinova', 'Aida', '']]","['quantum automata', 'counter automata', 'promise problems', 'blind counter', 'zero-error', 'Las-Vegas algorithms']"
5150,1907.06154,Mohamed Wahib,"Peng Chen, Mohamed Wahib, Shinichiro Takizawa, Ryousei Takano, Satoshi
  Matsuoka","A Versatile Software Systolic Execution Model for GPU Memory-Bound
  Kernels","ACM/IEEE Proceedings of the International Conference for High
  Performance Computing, Networking, Storage and Analysis (SC'19)",,10.1145/3295500.3356162,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a versatile high-performance execution model, inspired by
systolic arrays, for memory-bound regular kernels running on CUDA-enabled GPUs.
We formulate a systolic model that shifts partial sums by CUDA warp primitives
for the computation. We also employ register files as a cache resource in order
to operate the entire model efficiently. We demonstrate the effectiveness and
versatility of the proposed model for a wide variety of stencil kernels that
appear commonly in HPC, and also convolution kernels (increasingly important in
deep learning workloads). Our algorithm outperforms the top reported
state-of-the-art stencil implementations, including implementations with
sophisticated temporal and spatial blocking techniques, on the two latest
Nvidia architectures: Tesla V100 and P100. For 2D convolution of general filter
sizes and shapes, our algorithm is on average 2.5x faster than Nvidia's NPP on
V100 and P100 GPUs.
","[{'version': 'v1', 'created': 'Sun, 14 Jul 2019 01:48:53 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Sep 2019 05:37:51 GMT'}]",2019-09-09,"[['Chen', 'Peng', ''], ['Wahib', 'Mohamed', ''], ['Takizawa', 'Shinichiro', ''], ['Takano', 'Ryousei', ''], ['Matsuoka', 'Satoshi', '']]","['Systolic Array', 'GPU', 'CUDA', 'Convolution', 'Stencil']"
5151,1405.6263,Hemalata  Gosavi A,Hemalata A. Gosavi and Manish R. Umale,"Public Auditing and Data Dynamics for Storage Security in Cloud
  Computing","04 pages, 8 figures, ""Published with International Journal of
  Engineering Trends and Technology (IJETT)"". arXiv admin note: text overlap
  with arXiv:1211.1457 by other authors","IJETT, V11(4), 174-177 May 2014. ISSN:2231-5381",10.14445/22315381/IJETT-V11P235,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing has been envisioned as the next generation architecture of IT
Enterprise. Using Cloud Storage,users can remotely store their data and enjoy
the on demand high quality applications and services from a shared pool of
configurable computing resources, without the burden local copy data storage
and maintenance. It moves the application of software data stored to the
centralized large data centers, where the management of the data stored
services may not be completely trusted. There are many new security challenges
and the problems taken into account for ensuring the integrity of data storage
in Cloud Computing. In particular, we consider the task of allowing a third
party auditor (TPA) to perform verifies the integrity of the dynamic data
stored in the cloud.
","[{'version': 'v1', 'created': 'Sat, 24 May 2014 03:46:01 GMT'}]",2014-05-27,"[['Gosavi', 'Hemalata A.', ''], ['Umale', 'Manish R.', '']]","['Batch auditing', 'privacy preserving', 'data dynamics']"
5152,1405.3302,Laura De Lorenzis,"Claudio Maruccio, Laura De Lorenzis, Luana Persano, Dario Pisignano",Computational homogenization of fibrous piezoelectric materials,"22 pages, 13 figures","Computational Mechanics, Volume 55, Issue 5, pp. 983-998, 2015",10.1007/s00466-015-1147-0,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Flexible piezoelectric devices made of polymeric materials are widely used
for micro- and nano-electro-mechanical systems. In particular, numerous recent
applications concern energy harvesting. Due to the importance of computational
modeling to understand the influence that microscale geometry and constitutive
variables exert on the macroscopic behavior, a numerical approach is developed
here for multiscale and multiphysics modeling of thin piezoelectric sheets made
of aligned arrays of polymeric nanofibers, manufactured by electrospinning. At
the microscale, the representative volume element consists in piezoelectric
polymeric nanofibers, assumed to feature a piezoelastic behavior and subjected
to electromechanical contact constraints. The latter are incorporated into the
virtual work equations by formulating suitable electric, mechanical and
coupling potentials and the constraints are enforced by using the penalty
method. From the solution of the micro-scale boundary value problem, a suitable
scale transition procedure leads to identifying the performance of a
macroscopic thin piezoelectric shell element.
","[{'version': 'v1', 'created': 'Tue, 13 May 2014 20:44:40 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Mar 2015 09:13:01 GMT'}, {'version': 'v3', 'created': 'Mon, 27 Jul 2015 16:48:19 GMT'}]",2015-07-28,"[['Maruccio', 'Claudio', ''], ['De Lorenzis', 'Laura', ''], ['Persano', 'Luana', ''], ['Pisignano', 'Dario', '']]","['Computational homogenization', 'electromechanical contact', 'multiphysics modeling', 'multiscale mod']"
5153,1702.01017,Anindya Sundar Chakrabarti,"Diptesh Ghosh, Anindya S. Chakrabarti","Emergence of Distributed Coordination in the Kolkata Paise Restaurant
  Problem with Finite Information","12 pages, 4 figures",,10.1016/j.physa.2017.04.171,,cs.GT q-fin.EC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study a large-scale distributed coordination problem and
propose efficient adaptive strategies to solve the problem. The basic problem
is to allocate finite number of resources to individual agents such that there
is as little congestion as possible and the fraction of unutilized resources is
reduced as far as possible. In the absence of a central planner and global
information, agents can employ adaptive strategies that uses only finite
knowledge about the competitors. In this paper, we show that a combination of
finite information sets and reinforcement learning can increase the utilization
rate of resources substantially.
","[{'version': 'v1', 'created': 'Thu, 2 Feb 2017 17:37:44 GMT'}]",2017-05-24,"[['Ghosh', 'Diptesh', ''], ['Chakrabarti', 'Anindya S.', '']]","['Minority games', 'adaptive strategies', 'information sets', 'resource allocation']"
5154,2106.06340,Xuanhong Chen,"Renwang Chen, Xuanhong Chen, Bingbing Ni, Yanhao Ge",SimSwap: An Efficient Framework For High Fidelity Face Swapping,Accepted by ACMMM 2020,"Proceedings of the 28th ACM International Conference on
  Multimedia. 2020",10.1145/3394171.3413630,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We propose an efficient framework, called Simple Swap (SimSwap), aiming for
generalized and high fidelity face swapping. In contrast to previous approaches
that either lack the ability to generalize to arbitrary identity or fail to
preserve attributes like facial expression and gaze direction, our framework is
capable of transferring the identity of an arbitrary source face into an
arbitrary target face while preserving the attributes of the target face. We
overcome the above defects in the following two ways. First, we present the ID
Injection Module (IIM) which transfers the identity information of the source
face into the target face at feature level. By using this module, we extend the
architecture of an identity-specific face swapping algorithm to a framework for
arbitrary face swapping. Second, we propose the Weak Feature Matching Loss
which efficiently helps our framework to preserve the facial attributes in an
implicit way. Extensive experiments on wild faces demonstrate that our SimSwap
is able to achieve competitive identity performance while preserving attributes
better than previous state-of-the-art methods. The code is already available on
github: https://github.com/neuralchen/SimSwap.
","[{'version': 'v1', 'created': 'Fri, 11 Jun 2021 12:23:10 GMT'}]",2021-06-14,"[['Chen', 'Renwang', ''], ['Chen', 'Xuanhong', ''], ['Ni', 'Bingbing', ''], ['Ge', 'Yanhao', '']]","['generative adversarial network', 'face swapping', 'image translation']"
5155,2009.10633,Armin Moin,"Armin Moin, Stephan R\""ossler, Stephan G\""unnemann","ThingML+ Augmenting Model-Driven Software Engineering for the Internet
  of Things with Machine Learning","Published in Proc. of the International Conference on Model Driven
  Engineering Languages and Systems (MODELS) 2018 Workshops (MDE4IoT)","Proceedings of MODELS 2018 Workshops (MDE4IoT), co-located with
  the ACM/IEEE 21st International Conference on Model Driven Engineering
  Languages and Systems (MODELS), Copenhagen, Denmark, 2018",,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present the current position of the research project
ML-Quadrat, which aims to extend the methodology, modeling language and tool
support of ThingML - an open source modeling tool for IoT/CPS - to address
Machine Learning needs for the IoT applications. Currently, ThingML offers a
modeling language and tool support for modeling the components of the system,
their communication interfaces as well as their behaviors. The latter is done
through state machines. However, we argue that in many cases IoT/CPS services
involve system components and physical processes, whose behaviors are not well
understood in order to be modeled using state machines. Hence, quite often a
data-driven approach that enables inference based on the observed data, e.g.,
using Machine Learning is preferred. To this aim, ML-Quadrat integrates the
necessary Machine Learning concepts into ThingML both on the modeling level
(syntax and semantics of the modeling language) and on the code generators
level. We plan to support two target platforms for code generation regarding
Stream Processing and Complex Event Processing, namely Apache SAMOA and Apama.
","[{'version': 'v1', 'created': 'Tue, 22 Sep 2020 15:45:45 GMT'}]",2021-06-29,"[['Moin', 'Armin', ''], ['Rössler', 'Stephan', ''], ['Günnemann', 'Stephan', '']]","['internet of things', 'thingml', 'model driven', 'big data', 'machine learning', 'artifcial intelligence']"
5156,1309.1830,Surya Prasath,"V. B. S. Prasath, O. Haddad",Radar shadow detection in SAR images using DEM and projections,"10 pages, 6 figures","J. Appl. Remote Sens. 8(1), 083628 (May 19, 2014)",10.1117/1.JRS.8.083628,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Synthetic aperture radar (SAR) images are widely used in target recognition
tasks nowadays. In this letter, we propose an automatic approach for radar
shadow detection and extraction from SAR images utilizing geometric projections
along with the digital elevation model (DEM) which corresponds to the given
geo-referenced SAR image. First, the DEM is rotated into the radar geometry so
that each row would match that of a radar line of sight. Next, we extract the
shadow regions by processing row by row until the image is covered fully. We
test the proposed shadow detection approach on different DEMs and a simulated
1D signals and 2D hills and volleys modeled by various variance based Gaussian
functions. Experimental results indicate the proposed algorithm produces good
results in detecting shadows in SAR images with high resolution.
","[{'version': 'v1', 'created': 'Sat, 7 Sep 2013 07:14:42 GMT'}]",2014-12-16,"[['Prasath', 'V. B. S.', ''], ['Haddad', 'O.', '']]","['Geometric projection', 'shadow extraction', 'SAR images', 'DEM']"
5157,1405.3603,Kyle Marple,Kyle Marple and Gopal Gupta,Dynamic Consistency Checking in Goal-Directed Answer Set Programming,"12 pages. Accepted to ICLP 2014. To appear in Theory and Practice of
  Logic Programming (TPLP)",Theory and Practice of Logic Programming 14 (2014) 415-427,10.1017/S1471068414000118,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In answer set programming, inconsistencies arise when the constraints placed
on a program become unsatisfiable. In this paper, we introduce a technique for
dynamic consistency checking for our goal-directed method for computing answer
sets, under which only those constraints deemed relevant to the partial answer
set are tested, allowing inconsistent knowledgebases to be successfully
queried. However, the algorithm guarantees that, if a program has at least one
consistent answer set, any partial answer set returned will be a subset of some
consistent answer set. To appear in Theory and Practice of Logic Programming
(TPLP).
","[{'version': 'v1', 'created': 'Wed, 14 May 2014 18:09:59 GMT'}]",2020-02-19,"[['Marple', 'Kyle', ''], ['Gupta', 'Gopal', '']]","['dynamic consistency checking', 'answer set programming', 'goal-directed', 'consistentquery answering']"
5158,1812.11652,Salman Memon,Salman Memon and Muthucumaru Maheswaran,"Using Machine Learning for Handover Optimization in Vehicular Fog
  Computing",,,10.1145/3297280.3297300,,cs.NI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smart mobility management would be an important prerequisite for future fog
computing systems. In this research, we propose a learning-based handover
optimization for the Internet of Vehicles that would assist the smooth
transition of device connections and offloaded tasks between fog nodes. To
accomplish this, we make use of machine learning algorithms to learn from
vehicle interactions with fog nodes. Our approach uses a three-layer
feed-forward neural network to predict the correct fog node at a given location
and time with 99.2 % accuracy on a test set. We also implement a dual stacked
recurrent neural network (RNN) with long short-term memory (LSTM) cells capable
of learning the latency, or cost, associated with these service requests. We
create a simulation in JAMScript using a dataset of real-world vehicle
movements to create a dataset to train these networks. We further propose the
use of this predictive system in a smarter request routing mechanism to
minimize the service interruption during handovers between fog nodes and to
anticipate areas of low coverage through a series of experiments and test the
models' performance on a test set.
","[{'version': 'v1', 'created': 'Tue, 18 Dec 2018 06:02:15 GMT'}]",2019-01-01,"[['Memon', 'Salman', ''], ['Maheswaran', 'Muthucumaru', '']]","['Vehicular networks', 'handover optimization', 'fog computing', 'fogrequest distribution', 'neural networks']"
5159,2001.05240,Yibin Xu,Yibin Xu and Yangyu Huang,An n/2 Byzantine node tolerate Blockchain Sharding approach,,"In The 35th ACM/SIGAPP Symposium on Applied Computing (SAC '20),
  March 30-April 3, 2020, Brno, Czech Republic. ACM, NewYork, NY, USA,",10.1145/3341105.3374069,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional Blockchain Sharding approaches can only tolerate up to n/3 of
nodes being adversary because they rely on the hypergeometric distribution to
make a failure (an adversary does not have n/3 of nodes globally but can
manipulate the consensus of a Shard) hard to happen. The system must maintain a
large Shard size (the number of nodes inside a Shard) to sustain the low
failure probability so that only a small number of Shards may exist. In this
paper, we present a new approach of Blockchain Sharding that can withstand up
to n/2 of nodes being bad. We categorise the nodes into different classes, and
every Shard has a fixed number of nodes from different classes. We prove that
this design is much more secure than the traditional models (only have one
class) and the Shard size can be reduced significantly. In this way, many more
Shards can exist, and the transaction throughput can be largely increased. The
improved Blockchain Sharding approach is promising to serve as the foundation
for decentralised autonomous organisations and decentralised database.
","[{'version': 'v1', 'created': 'Wed, 15 Jan 2020 11:14:14 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Jan 2020 07:14:57 GMT'}, {'version': 'v3', 'created': 'Wed, 25 Mar 2020 14:39:45 GMT'}]",2020-03-26,"[['Xu', 'Yibin', ''], ['Huang', 'Yangyu', '']]","['Decentralised ledger', 'Blockchain', 'Blockchain Sharding', 'PBFT']"
5160,1005.5438,Secretary Aircc Journal,"Raddad Al King, Abdelkader Hameurlain, Franck Morvan",Query Routing and Processing in Peer-To-Peer Data Sharing Systems,"24 Pages, IJDMS","International Journal of Database Management Systems 2.2 (2010)
  116-139",10.5121/ijdms.2010.2208,,cs.DB,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Sharing musical files via the Internet was the essential motivation of early
P2P systems. Despite of the great success of the P2P file sharing systems,
these systems support only ""simple"" queries. The focus in such systems is how
to carry out an efficient query routing in order to find the nodes storing a
desired file. Recently, several research works have been made to extend P2P
systems to be able to share data having a fine granularity (i.e. atomic
attribute) and to process queries written with a highly expressive language
(i.e. SQL). These works have led to the emergence of P2P data sharing systems
that represent a new generation of P2P systems and, on the other hand, a next
stage in a long period of the database research area. ? The characteristics of
P2P systems (e.g. large-scale, node autonomy and instability) make impractical
to have a global catalog that represents often an essential component in
traditional database systems. Usually, such a catalog stores information about
data, schemas and data sources. Query routing and processing are two problems
affected by the absence of a global catalog. Locating relevant data sources and
generating a close to optimal execution plan become more difficult. In this
paper, we concentrate our study on proposed solutions for the both problems.
Furthermore, selected case studies of main P2P data sharing systems are
analyzed and compared.
","[{'version': 'v1', 'created': 'Sat, 29 May 2010 08:16:38 GMT'}]",2010-07-15,"[['King', 'Raddad Al', ''], ['Hameurlain', 'Abdelkader', ''], ['Morvan', 'Franck', '']]","['P2P Databases', 'Query Routing', 'Schema Matching', 'Query Processing', 'Optimization']"
5161,1903.01814,Tim Lukas Holch,"Constantin Steppa, Tim Lukas Holch",HexagDLy - Processing hexagonally sampled data with CNNs in PyTorch,,"SoftwareX, 9, 193-198, 2019",10.1016/j.softx.2019.02.010,,cs.CV astro-ph.IM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  HexagDLy is a Python-library extending the PyTorch deep learning framework
with convolution and pooling operations on hexagonal grids. It aims to ease the
access to convolutional neural networks for applications that rely on
hexagonally sampled data as, for example, commonly found in ground-based
astroparticle physics experiments.
","[{'version': 'v1', 'created': 'Tue, 5 Mar 2019 13:32:03 GMT'}]",2019-04-03,"[['Steppa', 'Constantin', ''], ['Holch', 'Tim Lukas', '']]","['convolutional neural networks', 'hexagonal grid', 'PyTorch', 'astroparticlephysics']"
5162,1702.00817,Renato J Cintra,"F. M. Bayer, R. J. Cintra",DCT-like Transform for Image Compression Requires 14 Additions Only,"6 pages, 3 figures, 1 table","Electronics Letters, Volume 48, Issue 15, pp. 919-921 (2012)",10.1049/el.2012.1148,,cs.MM cs.DS stat.AP stat.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A low-complexity 8-point orthogonal approximate DCT is introduced. The
proposed transform requires no multiplications or bit-shift operations. The
derived fast algorithm requires only 14 additions, less than any existing DCT
approximation. Moreover, in several image compression scenarios, the proposed
transform could outperform the well-known signed DCT, as well as
state-of-the-art algorithms.
","[{'version': 'v1', 'created': 'Thu, 2 Feb 2017 20:08:42 GMT'}]",2017-02-06,"[['Bayer', 'F. M.', ''], ['Cintra', 'R. J.', '']]","['DCT Approximation', 'Fast algorithms', 'Image compression']"
5163,1706.06613,Chenyan Xiong,"Chenyan Xiong, Zhuyun Dai, Jamie Callan, Zhiyuan Liu, and Russell
  Power",End-to-End Neural Ad-hoc Ranking with Kernel Pooling,,,10.1145/3077136.3080809,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes K-NRM, a kernel based neural model for document ranking.
Given a query and a set of documents, K-NRM uses a translation matrix that
models word-level similarities via word embeddings, a new kernel-pooling
technique that uses kernels to extract multi-level soft match features, and a
learning-to-rank layer that combines those features into the final ranking
score. The whole model is trained end-to-end. The ranking layer learns desired
feature patterns from the pairwise ranking loss. The kernels transfer the
feature patterns into soft-match targets at each similarity level and enforce
them on the translation matrix. The word embeddings are tuned accordingly so
that they can produce the desired soft matches. Experiments on a commercial
search engine's query log demonstrate the improvements of K-NRM over prior
feature-based and neural-based states-of-the-art, and explain the source of
K-NRM's advantage: Its kernel-guided embedding encodes a similarity metric
tailored for matching query words to document words, and provides effective
multi-level soft matches.
","[{'version': 'v1', 'created': 'Tue, 20 Jun 2017 18:19:54 GMT'}]",2017-06-22,"[['Xiong', 'Chenyan', ''], ['Dai', 'Zhuyun', ''], ['Callan', 'Jamie', ''], ['Liu', 'Zhiyuan', ''], ['Power', 'Russell', '']]","['Ranking', 'Neural IR', 'Kernel Pooling', 'Relevance Model', 'Embedding']"
5164,2109.03285,Michaela Hardt,"Michaela Hardt, Xiaoguang Chen, Xiaoyi Cheng, Michele Donini, Jason
  Gelman, Satish Gollaprolu, John He, Pedro Larroy, Xinyu Liu, Nick McCarthy,
  Ashish Rathi, Scott Rees, Ankit Siva, ErhYuan Tsai, Keerthan Vasist, Pinar
  Yilmaz, Muhammad Bilal Zafar, Sanjiv Das, Kevin Haas, Tyler Hill, Krishnaram
  Kenthapadi","Amazon SageMaker Clarify: Machine Learning Bias Detection and
  Explainability in the Cloud",,"In Proc. ACM SIGKDD Conference on Knowledge Discovery and Data
  Mining (KDD), 2974-2983 (2021)",10.1145/3447548.3467177,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding the predictions made by machine learning (ML) models and their
potential biases remains a challenging and labor-intensive task that depends on
the application, the dataset, and the specific model. We present Amazon
SageMaker Clarify, an explainability feature for Amazon SageMaker that launched
in December 2020, providing insights into data and ML models by identifying
biases and explaining predictions. It is deeply integrated into Amazon
SageMaker, a fully managed service that enables data scientists and developers
to build, train, and deploy ML models at any scale. Clarify supports bias
detection and feature importance computation across the ML lifecycle, during
data preparation, model evaluation, and post-deployment monitoring. We outline
the desiderata derived from customer input, the modular architecture, and the
methodology for bias and explanation computations. Further, we describe the
technical challenges encountered and the tradeoffs we had to make. For
illustration, we discuss two customer use cases. We present our deployment
results including qualitative customer feedback and a quantitative evaluation.
Finally, we summarize lessons learned, and discuss best practices for the
successful adoption of fairness and explanation tools in practice.
","[{'version': 'v1', 'created': 'Tue, 7 Sep 2021 18:49:04 GMT'}]",2021-09-09,"[['Hardt', 'Michaela', ''], ['Chen', 'Xiaoguang', ''], ['Cheng', 'Xiaoyi', ''], ['Donini', 'Michele', ''], ['Gelman', 'Jason', ''], ['Gollaprolu', 'Satish', ''], ['He', 'John', ''], ['Larroy', 'Pedro', ''], ['Liu', 'Xinyu', ''], ['McCarthy', 'Nick', ''], ['Rathi', 'Ashish', ''], ['Rees', 'Scott', ''], ['Siva', 'Ankit', ''], ['Tsai', 'ErhYuan', ''], ['Vasist', 'Keerthan', ''], ['Yilmaz', 'Pinar', ''], ['Zafar', 'Muhammad Bilal', ''], ['Das', 'Sanjiv', ''], ['Haas', 'Kevin', ''], ['Hill', 'Tyler', ''], ['Kenthapadi', 'Krishnaram', '']]","['Machine learning', 'Fairness', 'Explainability']"
5165,1709.06927,Manas Yogi Mr,"Manas Kumar Yogi, K. Chandrasekhar, G. Vijay Kumar","Mist Computing: Principles, Trends and Future Direction",,,10.14445/23488387/IJCSE-V4I7P104,,cs.NI cs.DC,http://creativecommons.org/publicdomain/zero/1.0/,"  In this paper we present the novel idea of computing near the edge of IOT
architecture which enhances the inherent efficiency while computing complex
applications. This concept is termed as mist computing. We believe this
computing will bring about an massive revolution in future computing
technologies. instead of thrusting the control responsibility to gateways while
data transmission the control is decentralised to end nodes which decrease the
communicational delay of the network thereby increasing the throughput.
","[{'version': 'v1', 'created': 'Sun, 6 Aug 2017 15:02:15 GMT'}]",2017-09-21,"[['Yogi', 'Manas Kumar', ''], ['Chandrasekhar', 'K.', ''], ['Kumar', 'G. Vijay', '']]","['Mist', 'IOT', 'Gateway', 'Thinnect', 'Situation Aware', 'Edge Computing']"
5166,2003.12468,Vincent Neiger,Vincent Neiger and Johan Rosenkilde and Grigory Solomatov,"Generic bivariate multi-point evaluation, interpolation and modular
  composition with precomputation","ISSAC 2020. 8 pages, 7 algorithms",,10.1145/3373207.3404032,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Suppose $\mathbb{K}$ is a large enough field and $\mathcal{P} \subset
\mathbb{K}^2$ is a fixed, generic set of points which is available for
precomputation. We introduce a technique called \emph{reshaping} which allows
us to design quasi-linear algorithms for both: computing the evaluations of an
input polynomial $f \in \mathbb{K}[x,y]$ at all points of $\mathcal{P}$; and
computing an interpolant $f \in \mathbb{K}[x,y]$ which takes prescribed values
on $\mathcal{P}$ and satisfies an input $y$-degree bound. Our genericity
assumption is explicit and we prove that it holds for most point sets over a
large enough field. If $\mathcal{P}$ violates the assumption, our algorithms
still work and the performance degrades smoothly according to a distance from
being generic. To show that the reshaping technique may have an impact on other
related problems, we apply it to modular composition: suppose generic
polynomials $M \in \mathbb{K}[x]$ and $A \in \mathbb{K}[x]$ are available for
precomputation, then given an input $f \in \mathbb{K}[x,y]$ we show how to
compute $f(x, A(x)) \operatorname{rem} M(x)$ in quasi-linear time.
","[{'version': 'v1', 'created': 'Fri, 27 Mar 2020 15:26:25 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Jun 2020 10:09:24 GMT'}]",2020-06-05,"[['Neiger', 'Vincent', ''], ['Rosenkilde', 'Johan', ''], ['Solomatov', 'Grigory', '']]","['Multi-point evaluation', 'interpolation', 'modular composition', 'bivariate polynomials', 'precomputation']"
5167,2102.12782,Cl\'ement Courbet,Clement Courbet,NSan: A Floating-Point Numerical Sanitizer,,,10.1145/3446804.3446848,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Sanitizers are a relatively recent trend in software engineering. They aim at
automatically finding bugs in programs, and they are now commonly available to
programmers as part of compiler toolchains. For example, the LLVM project
includes out-of-the-box sanitizers to detect thread safety (tsan), memory
(asan,msan,lsan), or undefined behaviour (ubsan) bugs.
  In this article, we present nsan, a new sanitizer for locating and debugging
floating-point numerical issues, implemented inside the LLVM sanitizer
framework. nsan puts emphasis on practicality. It aims at providing precise,
and actionable feedback, in a timely manner.
  nsan uses compile-time instrumentation to augment each floating-point
computation in the program with a higher-precision shadow which is checked for
consistency during program execution. This makes nsan between 1 and 4 orders of
magnitude faster than existing approaches, which allows running it routinely as
part of unit tests, or detecting issues in large production applications.
","[{'version': 'v1', 'created': 'Thu, 25 Feb 2021 11:08:34 GMT'}]",2021-02-26,"[['Courbet', 'Clement', '']]","['Floating Point Arithmetic', 'Numerical Stability', 'LLVM', 'nsan']"
5168,1808.08070,Uwe Krien,"Simon Hilpert, Cord Kaldemeyer, Uwe Krien, Stefan G\""unther, Clemens
  Wingenbach, Guido Plessmann","The Open Energy Modelling Framework (oemof) - A new approach to
  facilitate open science in energy system modelling",,"Energy Strategy Reviews, Volume 22, 2018, Pages 16-25",10.1016/j.esr.2018.07.001,,cs.CE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Energy system models have become indispensable tools for planning future
energy systems by providing insights into different development trajectories.
However, sustainable systems with high shares of renewable energy are
characterized by growing cross-sectoral interdependencies and decentralized
structures. To capture important properties of increasingly complex energy
systems, sophisticated and flexible modelling tools are needed. At the same
time, open science is becoming increasingly important in energy system
modelling. This paper presents the Open Energy Modelling Framework (oemof) as a
novel approach to energy system modelling, representation and analysis. The
framework provides a toolbox to construct comprehensive energy system models
and has been published open source under a free licence. Through collaborative
development based on open processes, the framework supports a maximum level of
participation, transparency and open science principles in energy system
modelling. Based on a generic graph-based description of energy systems, it is
well-suited to flexibly model complex cross-sectoral systems and incorporate
various modelling approaches. This makes the framework a multi-purpose
modelling environment for modelling and analyzing different systems at scales
ranging from urban to transnational.
","[{'version': 'v1', 'created': 'Fri, 24 Aug 2018 10:06:44 GMT'}]",2018-08-27,"[['Hilpert', 'Simon', ''], ['Kaldemeyer', 'Cord', ''], ['Krien', 'Uwe', ''], ['Günther', 'Stefan', ''], ['Wingenbach', 'Clemens', ''], ['Plessmann', 'Guido', '']]","['decision support', 'energy system modelling', 'optimization', 'collaborative development', 'open science']"
5169,0801.3113,Martin Pelikan,"Martin Pelikan, Kumara Sastry, and David E. Goldberg",iBOA: The Incremental Bayesian Optimization Algorithm,"Also available at the MEDAL web site, http://medal.cs.umsl.edu/","Proceedings of the Genetic and Evolutionary Computation Conference
  (GECCO-2008), ACM Press, 455-462",,MEDAL Report No. 2008002,cs.NE cs.AI,,"  This paper proposes the incremental Bayesian optimization algorithm (iBOA),
which modifies standard BOA by removing the population of solutions and using
incremental updates of the Bayesian network. iBOA is shown to be able to learn
and exploit unrestricted Bayesian networks using incremental techniques for
updating both the structure as well as the parameters of the probabilistic
model. This represents an important step toward the design of competent
incremental estimation of distribution algorithms that can solve difficult
nearly decomposable problems scalably and reliably.
","[{'version': 'v1', 'created': 'Mon, 21 Jan 2008 00:34:55 GMT'}]",2008-07-30,"[['Pelikan', 'Martin', ''], ['Sastry', 'Kumara', ''], ['Goldberg', 'David E.', '']]","['Bayesian optimization algorithm', 'incremental BOA', 'incremental model update', 'estimation of distribution algorithms', 'evolutionary computation']"
5170,1502.03190,Xiahong Lin,"Xiahong Lin, Zhi Wang, Lifeng Sun",MAP: Microblogging Assisted Profiling of TV Shows,,,10.1007/978-3-319-14445-0_38,,cs.IR cs.MM cs.SI,http://creativecommons.org/licenses/by/3.0/,"  Online microblogging services that have been increasingly used by people to
share and exchange information, have emerged as a promising way to profiling
multimedia contents, in a sense to provide users a socialized abstraction and
understanding of these contents. In this paper, we propose a microblogging
profiling framework, to provide a social demonstration of TV shows. Challenges
for this study lie in two folds: First, TV shows are generally offline, i.e.,
most of them are not originally from the Internet, and we need to create a
connection between these TV shows with online microblogging services; Second,
contents in a microblogging service are extremely noisy for video profiling,
and we need to strategically retrieve the most related information for the TV
show profiling.To address these challenges, we propose a MAP, a
microblogging-assisted profiling framework, with contributions as follows: i)
We propose a joint user and content retrieval scheme, which uses information
about both actors and topics of a TV show to retrieve related microblogs; ii)
We propose a social-aware profiling strategy, which profiles a video according
to not only its content, but also the social relationship of its microblogging
users and its propagation in the social network; iii) We present some
interesting analysis, based on our framework to profile real-world TV shows.
","[{'version': 'v1', 'created': 'Wed, 11 Feb 2015 04:13:30 GMT'}]",2015-02-12,"[['Lin', 'Xiahong', ''], ['Wang', 'Zhi', ''], ['Sun', 'Lifeng', '']]","['Online Microblogging', 'TV Show Profiling', 'Social Network', 'DataVisualization']"
5171,2102.09920,Louis Cheung,"Louis Cheung, Liam O'Connor, Christine Rizkallah","Overcoming Restraint: Composing Verification of Foreign Functions with
  Cogent",,,10.1145/3497775.3503686,,cs.PL,http://creativecommons.org/licenses/by/4.0/,"  Cogent is a restricted functional language designed to reduce the cost of
developing verified systems code. Because of its sometimes-onerous
restrictions, such as the lack of support for recursion and its strict
uniqueness type system, Cogent provides an escape hatch in the form of a
foreign function interface (FFI) to C code. This poses a problem when verifying
Cogent programs, as imported C components do not enjoy the same level of static
guarantees that Cogent does. Previous verification of file systems implemented
in Cogent merely assumed that their C components were correct and that they
preserved the invariants of Cogent's type system. In this paper, we instead
prove such obligations. We demonstrate how they smoothly compose with existing
Cogent theorems, and result in a correctness theorem of the overall Cogent-C
system. The Cogent FFI constraints ensure that key invariants of Cogent's type
system are maintained even when calling C code. We verify reusable higher-order
and polymorphic functions including a generic loop combinator and array
iterators and demonstrate their application to several examples including
binary search and the BilbyFs file system. We demonstrate the feasibility of
verification of mixed Cogent-C systems, and provide some insight into
verification of software comprised of code in multiple languages with differing
levels of static guarantees.
","[{'version': 'v1', 'created': 'Fri, 19 Feb 2021 13:28:31 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Mar 2021 05:31:06 GMT'}, {'version': 'v3', 'created': 'Fri, 17 Dec 2021 21:52:13 GMT'}, {'version': 'v4', 'created': 'Tue, 21 Dec 2021 05:29:44 GMT'}]",2021-12-24,"[['Cheung', 'Louis', ''], [""O'Connor"", 'Liam', ''], ['Rizkallah', 'Christine', '']]","['compilers', 'verification', 'type-systems', 'languageinteroperability', 'data-structures']"
5172,0907.0595,James Whitacre,"James M. Whitacre, Tuan Q. Pham, Ruhul A. Sarker","Use of statistical outlier detection method in adaptive evolutionary
  algorithms",,"Genetic And Evolutionary Computation Conference, 2006",10.1145/1143997.1144205,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the issue of adapting probabilities for Evolutionary Algorithm
(EA) search operators is revisited. A framework is devised for distinguishing
between measurements of performance and the interpretation of those
measurements for purposes of adaptation. Several examples of measurements and
statistical interpretations are provided. Probability value adaptation is
tested using an EA with 10 search operators against 10 test problems with
results indicating that both the type of measurement and its statistical
interpretation play significant roles in EA performance. We also find that
selecting operators based on the prevalence of outliers rather than on average
performance is able to provide considerable improvements to adaptive methods
and soundly outperforms the non-adaptive case.
","[{'version': 'v1', 'created': 'Fri, 3 Jul 2009 11:07:43 GMT'}]",2009-07-06,"[['Whitacre', 'James M.', ''], ['Pham', 'Tuan Q.', ''], ['Sarker', 'Ruhul A.', '']]","['Evolutionary Algorithm', 'Genetic Algorithm', 'Feedback Adaptation']"
5173,1309.5503,Scott Ainsworth,Scott G. Ainsworth and Michael L. Nelson,"Evaluating Sliding and Sticky Target Policies by Measuring Temporal
  Drift in Acyclic Walks Through a Web Archive","10 pages, JCDL 2013",,10.1145/2467696.2467718,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When a user views an archived page using the archive's user interface (UI),
the user selects a datetime to view from a list. The archived web page, if
available, is then displayed. From this display, the web archive UI attempts to
simulate the web browsing experience by smoothly transitioning between archived
pages. During this process, the target datetime changes with each link
followed; drifting away from the datetime originally selected. When browsing
sparsely-archived pages, this nearly-silent drift can be many years in just a
few clicks. We conducted 200,000 acyclic walks of archived pages, following up
to 50 links per walk, comparing the results of two target datetime policies.
The Sliding Target policy allows the target datetime to change as it does in
archive UIs such as the Internet Archive's Wayback Machine. The Sticky Target
policy, represented by the Memento API, keeps the target datetime the same
throughout the walk. We found that the Sliding Target policy drift increases
with the number of walk steps, number of domains visited, and choice (number of
links available). However, the Sticky Target policy controls temporal drift,
holding it to less than 30 days on average regardless of walk length or number
of domains visited. The Sticky Target policy shows some increase as choice
increases, but this may be caused by other factors. We conclude that based on
walk length, the Sticky Target policy generally produces at least 30 days less
drift than the Sliding Target policy.
","[{'version': 'v1', 'created': 'Sat, 21 Sep 2013 17:27:04 GMT'}]",2013-09-24,"[['Ainsworth', 'Scott G.', ''], ['Nelson', 'Michael L.', '']]","['Digital Preservation', 'HTTP', 'Resource Versioning', 'TemporalApplications', 'Web Architecture', 'Web Archiving']"
5174,1510.07949,Francesc Comellas,"Zhongzhi Zhang, Shunqi Wu, Mingyun Li, Francesc Comellas","The number and degree distribution of spanning trees in the Tower of
  Hanoi graph","25 pages, 8 figures","Theoretical Computer Science, 2016, 609: 443-455",10.1016/j.tcs.2015.10.032,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The number of spanning trees of a graph is an important invariant related to
topological and dynamic properties of the graph, such as its reliability,
communication aspects, synchronization, and so on. However, the practical
enumeration of spanning trees and the study of their properties remain a
challenge, particularly for large networks. In this paper, we study the num-
ber and degree distribution of the spanning trees in the Hanoi graph. We first
establish recursion relations between the number of spanning trees and other
spanning subgraphs of the Hanoi graph, from which we find an exact analytical
expression for the number of spanning trees of the n-disc Hanoi graph. This
result allows the calculation of the spanning tree entropy which is then
compared with those for other graphs with the same average degree. Then, we
introduce a vertex labeling which allows to find, for each vertex of the graph,
its degree distribution among all possible spanning trees.
","[{'version': 'v1', 'created': 'Tue, 27 Oct 2015 15:58:41 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Oct 2015 09:53:12 GMT'}]",2016-04-05,"[['Zhang', 'Zhongzhi', ''], ['Wu', 'Shunqi', ''], ['Li', 'Mingyun', ''], ['Comellas', 'Francesc', '']]","['Spanning trees', 'Tower of Hanoi graph', 'Degree distribution', 'Fractal geometry']"
5175,1301.3281,Marcos Sanchez-Elez,Marcos Sanchez-Elez and Sara Roman,"Reconfiguration Strategies for Online Hardware Multitasking in Embedded
  Systems","Computer Science & Engineering: An International Journal (CSEIJ),
  Vol.2, No.6, December 2012",,10.5121/cseij.2012.2601,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An intensive use of reconfigurable hardware is expected in future embedded
systems. This means that the system has to decide which tasks are more suitable
for hardware execution. In order to make an efficient use of the FPGA it is
convenient to choose one that allows hardware multitasking, which is
implemented by using partial dynamic reconfiguration. One of the challenges for
hardware multitasking in embedded systems is the online management of the only
reconfiguration port of present FPGA devices. This paper presents different
online reconfiguration scheduling strategies which assign the reconfiguration
interface resource using different criteria: workload distribution or task
deadline. The online scheduling strategies presented take efficient and fast
decisions based on the information available at each moment. Experiments have
been made in order to analyze the performance and convenience of these
reconfiguration strategies.
","[{'version': 'v1', 'created': 'Tue, 15 Jan 2013 09:51:33 GMT'}]",2013-01-16,"[['Sanchez-Elez', 'Marcos', ''], ['Roman', 'Sara', '']]","['Embedded systems', 'multitasking scheduling', 'reconfigurable architectures']"
5176,1810.07251,Nelly Elsayed,"Nelly Elsayed, Anthony S. Maida, Magdy Bayoumi","Reduced-Gate Convolutional LSTM Using Predictive Coding for
  Spatiotemporal Prediction","A novel rgcLSTM model for spatiotemporal prediction. This version
  contains the full description and detailed empirical study of the rgcLSTM
  architecture. 28 pages, 12 figures, 20 tables",,10.1111/coin.12277,COIN12277,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spatiotemporal sequence prediction is an important problem in deep learning.
We study next-frame(s) video prediction using a deep-learning-based predictive
coding framework that uses convolutional, long short-term memory (convLSTM)
modules. We introduce a novel reduced-gate convolutional LSTM(rgcLSTM)
architecture that requires a significantly lower parameter budget than a
comparable convLSTM. By using a single multi-function gate, our reduced-gate
model achieves equal or better next-frame(s) prediction accuracy than the
original convolutional LSTM while using a smaller parameter budget, thereby
reducing training time and memory requirements. We tested our reduced gate
modules within a predictive coding architecture on the moving MNIST and KITTI
datasets. We found that our reduced-gate model has a significant reduction of
approximately 40 percent of the total number of training parameters and a 25
percent reduction in elapsed training time in comparison with the standard
convolutional LSTM model. The performance accuracy of the new model was also
improved. This makes our model more attractive for hardware implementation,
especially on small devices. We also explored a space of twenty different gated
architectures to get insight into how our rgcLSTM fit into that space.
","[{'version': 'v1', 'created': 'Tue, 16 Oct 2018 19:55:51 GMT'}, {'version': 'v10', 'created': 'Wed, 23 Oct 2019 03:30:11 GMT'}, {'version': 'v11', 'created': 'Sun, 22 Dec 2019 21:44:41 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Oct 2018 20:36:59 GMT'}, {'version': 'v3', 'created': 'Sun, 18 Nov 2018 06:08:08 GMT'}, {'version': 'v4', 'created': 'Wed, 5 Dec 2018 01:52:15 GMT'}, {'version': 'v5', 'created': 'Sun, 9 Dec 2018 03:11:44 GMT'}, {'version': 'v6', 'created': 'Tue, 11 Dec 2018 01:57:45 GMT'}, {'version': 'v7', 'created': 'Fri, 28 Dec 2018 01:26:57 GMT'}, {'version': 'v8', 'created': 'Thu, 10 Jan 2019 19:05:49 GMT'}, {'version': 'v9', 'created': 'Fri, 15 Mar 2019 19:21:00 GMT'}]",2020-01-24,"[['Elsayed', 'Nelly', ''], ['Maida', 'Anthony S.', ''], ['Bayoumi', 'Magdy', '']]","['rgcLSTM', 'convolutional LSTM', 'convLSTM', 'predictive coding', 'spatiotemporal prediction', 'video predic']"
5177,1305.6113,EPTCS,"Frank Zeyda (University of York), Ana Cavalcanti (University of York)",Refining SCJ Mission Specifications into Parallel Handler Designs,"In Proceedings Refine 2013, arXiv:1305.5634","EPTCS 115, 2013, pp. 52-67",10.4204/EPTCS.115.4,,cs.LO cs.DC cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Safety-Critical Java (SCJ) is a recent technology that restricts the
execution and memory model of Java in such a way that applications can be
statically analysed and certified for their real-time properties and safe use
of memory. Our interest is in the development of comprehensive and sound
techniques for the formal specification, refinement, design, and implementation
of SCJ programs, using a correct-by-construction approach. As part of this
work, we present here an account of laws and patterns that are of general use
for the refinement of SCJ mission specifications into designs of parallel
handlers used in the SCJ programming paradigm. Our notation is a combination of
languages from the Circus family, supporting state-rich reactive models with
the addition of class objects and real-time properties. Our work is a first
step to elicit laws of programming for SCJ and fits into a refinement strategy
that we have developed previously to derive SCJ programs.
","[{'version': 'v1', 'created': 'Mon, 27 May 2013 05:40:09 GMT'}]",2013-05-28,"[['Zeyda', 'Frank', '', 'University of York'], ['Cavalcanti', 'Ana', '', 'University of York']]","['SCJ', 'models', 'refinement', 'laws', 'patterns', 'tactics', 'Circus']"
5178,1805.11564,Uwe Reichel,"Uwe D. Reichel, \v{S}tefan Be\v{n}u\v{s}, Katalin M\'ady","Entrainment profiles: Comparison by gender, role, and feature set","Accepted Manuscript for Speech Communication (Elsevier), 25 April
  2018","U.D. Reichel, \v{S}. Be\v{n}u\v{s}, K. M\'ady. Entrainment
  profiles: Comparison by gender, role, and feature set. Speech Communication,
  100:46-57, 2018",10.1016/j.specom.2018.04.009,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We examine prosodic entrainment in cooperative game dialogs for new feature
sets describing register, pitch accent shape, and rhythmic aspects of
utterances. For these as well as for established features we present
entrainment profiles to detect within- and across-dialog entrainment by the
speakers' gender and role in the game. It turned out, that feature sets undergo
entrainment in different quantitative and qualitative ways, which can partly be
attributed to their different functions. Furthermore, interactions between
speaker gender and role (describer vs. follower) suggest gender-dependent
strategies in cooperative solution-oriented interactions: female describers
entrain most, male describers least. Our data suggests a slight advantage of
the latter strategy on task success.
","[{'version': 'v1', 'created': 'Tue, 29 May 2018 16:22:42 GMT'}]",2018-05-30,"[['Reichel', 'Uwe D.', ''], ['Beňuš', 'Štefan', ''], ['Mády', 'Katalin', '']]","['entrainment', 'prosody', 'profile', 'gender', 'social role', 'dialog']"
5179,1903.10892,Pekka Abrahamsson,Pekka Abrahamsson,"Commitment to Software Process improvement Development of Diagnostic
  Tool to Facilitate Improvement1","This is the author's version of the work. The definite version was
  published in: Abrahamsson, P. Software Quality Journal (1999) 8: 63.
  https://doi.org/10.1023/A:1008978919720",,10.1023/A:1008978919720,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper suggests that by operationalizing the concept of commitment in the
shape of a model, a new insight is provided in improving software processes - a
more human centered approach as opposed to various technical approaches
available. In doing so the SPI managers/change agents are able to plan better
the software process improvement initiative and benchmark successful projects
(as well as failed ones). Results from five interviews with SPI professionals
on the proposed Behavior-based Commitment Model are reported, together with
early results from the empirical test in 14 software process improvement
projects. Early results suggest that the behaviors introduced in the model are
relevant in SPI initiatives, the use of model raises the awareness about the
people issues in improving processes, and the model could be used aside with
CMM, SPICE or other process improvement models. Keywords: software process
improvement, commitment, diagnostic tool, self-perception theory.
","[{'version': 'v1', 'created': 'Tue, 26 Mar 2019 13:44:07 GMT'}]",2019-03-27,"[['Abrahamsson', 'Pekka', '']]","['software  process  improvement', 'commitment', 'diagnostic  tool', 'self-perception']"
5180,1311.0090,Mahendra Piraveenan,"Shahadat Uddin, Mahendra Piraveenan, Arif Khan, Babak Amiri","Conceptual quantification of the dynamicity of longitudinal social
  networks",SocialCom 2013 conference,,10.1109/SocialCom.2013.131,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A longitudinal social network evolves over time through the creation and/ or
deletion of links among a set of actors (e.g. individuals or organizations).
Longitudinal social networks are studied by network science and social science
researchers to understand networke volution, trend propagation, friendship and
belief formation, diffusion of innovation, the spread of deviant behavior and
more. In the current literature, there are different approaches and methods
(e.g. Sampsons approach and the markov model) to study the dynamics of
longitudinal social networks. These approaches and methods have mainly been
utilised to explore evolutionary changes of longitudinal social networks from
one state to another and to explain the underlying reasons for these changes.
However, they cannot quantify the level of dynamicity of the over time network
changes and the contribution of individual network members (i.e. actors) to
these changes. In this study, we first develop a set of measures to quantify
different aspects of the dynamicity of a longitudinal social network. We then
apply these measures, in order to conduct empirical investigations, to two
different longitudinal social networks. Finally, we discuss the implications of
the application of these measures and possible future research directions of
this study.
","[{'version': 'v1', 'created': 'Fri, 1 Nov 2013 05:20:49 GMT'}]",2013-11-04,"[['Uddin', 'Shahadat', ''], ['Piraveenan', 'Mahendra', ''], ['Khan', 'Arif', ''], ['Amiri', 'Babak', '']]","['Dynamicity', 'longitudinal social network', 'network dynamics']"
5181,1805.12564,Xiang Li,"Yu Zhao, Xiang Li, Wei Zhang, Shijie Zhao, Milad Makkie, Mo Zhang,
  Quanzheng Li, Tianming Liu","Modeling 4D fMRI Data via Spatio-Temporal Convolutional Neural Networks
  (ST-CNN)",Yu Zhao and Xiang Li contribute equally to this work,,10.1109/TCDS.2019.2916916,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Simultaneous modeling of the spatio-temporal variation patterns of brain
functional network from 4D fMRI data has been an important yet challenging
problem for the field of cognitive neuroscience and medical image analysis.
Inspired by the recent success in applying deep learning for functional brain
decoding and encoding, in this work we propose a spatio-temporal convolutional
neural network (ST-CNN)to jointly learn the spatial and temporal patterns of
targeted network from the training data and perform automatic, pin-pointing
functional network identification. The proposed ST-CNN is evaluated by the task
of identifying the Default Mode Network (DMN) from fMRI data. Results show that
while the framework is only trained on one fMRI dataset,it has the sufficient
generalizability to identify the DMN from different populations of data as well
as different cognitive tasks. Further investigation into the results show that
the superior performance of ST-CNN is driven by the jointly-learning scheme,
which capture the intrinsic relationship between the spatial and temporal
characteristic of DMN and ensures the accurate identification.
","[{'version': 'v1', 'created': 'Thu, 31 May 2018 17:08:10 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jun 2018 20:58:59 GMT'}, {'version': 'v3', 'created': 'Mon, 6 Aug 2018 18:29:39 GMT'}]",2021-03-24,"[['Zhao', 'Yu', ''], ['Li', 'Xiang', ''], ['Zhang', 'Wei', ''], ['Zhao', 'Shijie', ''], ['Makkie', 'Milad', ''], ['Zhang', 'Mo', ''], ['Li', 'Quanzheng', ''], ['Liu', 'Tianming', '']]","['fMRI', 'functional brain networks', 'deep learning']"
5182,1306.4223,I\~naki Ucar,"I\~naki Ucar, Felipe L\'opez-Fernandino, Pablo Rodriguez-Ulibarri,
  Laura Sesma-Sanchez, Veronica Urrea-Mic\'o and Joaqu\'in Sevilla","Growth in the number of references in engineering journal papers during
  the 1972-2013 period","11 pages, 4 figures. Published online on August 31, 2013","Scientometrics, Volume 98, Issue 3, March 2014, pp.1855-1864",10.1007/s11192-013-1113-6,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The number of references per paper, perhaps the best single index of a
journal's scholarliness, has been studied in different disciplines and periods.
In this paper we present a four decade study of eight engineering journals. A
data set of over 70000 references was generated after automatic data gathering
and manual inspection for errors. Results show a significant increase in the
number of references per paper, the average rises from 8 in 1972 to 25 in 2013.
This growth presents an acceleration around the year 2000, consistent with a
much easier access to search engines and documents produced by the
generalization of the Internet.
","[{'version': 'v1', 'created': 'Tue, 18 Jun 2013 14:53:59 GMT'}, {'version': 'v2', 'created': 'Sun, 1 Sep 2013 12:19:44 GMT'}]",2017-10-26,"[['Ucar', 'Iñaki', ''], ['López-Fernandino', 'Felipe', ''], ['Rodriguez-Ulibarri', 'Pablo', ''], ['Sesma-Sanchez', 'Laura', ''], ['Urrea-Micó', 'Veronica', ''], ['Sevilla', 'Joaquín', '']]","['Number of references', 'Citation density', 'Engineering', 'Citing behaviour', 'Reference analysis']"
5183,1809.10430,"J\""org Sander","J\""org Sander, Bob D. de Vos, Jelmer M. Wolterink and Ivana I\v{s}gum","Towards increased trustworthiness of deep learning segmentation methods
  on cardiac MRI",This work has been submitted to SPIE 2019 conference,,10.1117/12.2511699,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current state-of-the-art deep learning segmentation methods have not yet made
a broad entrance into the clinical setting in spite of high demand for such
automatic methods. One important reason is the lack of reliability caused by
models that fail unnoticed and often locally produce anatomically implausible
results that medical experts would not make. This paper presents an automatic
image segmentation method based on (Bayesian) dilated convolutional networks
(DCNN) that generate segmentation masks and spatial uncertainty maps for the
input image at hand. The method was trained and evaluated using segmentation of
the left ventricle (LV) cavity, right ventricle (RV) endocardium and myocardium
(Myo) at end-diastole (ED) and end-systole (ES) in 100 cardiac 2D MR scans from
the MICCAI 2017 Challenge (ACDC). Combining segmentations and uncertainty maps
and employing a human-in-the-loop setting, we provide evidence that image areas
indicated as highly uncertain regarding the obtained segmentation almost
entirely cover regions of incorrect segmentations. The fused information can be
harnessed to increase segmentation performance. Our results reveal that we can
obtain valuable spatial uncertainty maps with low computational effort using
DCNNs.
","[{'version': 'v1', 'created': 'Thu, 27 Sep 2018 09:49:46 GMT'}, {'version': 'v2', 'created': 'Sat, 29 Sep 2018 07:31:22 GMT'}, {'version': 'v3', 'created': 'Mon, 28 Jan 2019 09:30:59 GMT'}]",2019-06-18,"[['Sander', 'Jörg', ''], ['de Vos', 'Bob D.', ''], ['Wolterink', 'Jelmer M.', ''], ['Išgum', 'Ivana', '']]","['cardiac MRI segmentation', 'uncertainty estimation', 'loss functions', 'deep learning', 'Bayesian neuralnetworks']"
5184,1901.01215,Fernando Morales,Fernando A Morales and Jairo A Mart\'inez,"Analysis of Divide & Conquer strategies for the 0-1 Minimization
  Knapsack Problem","33 pages, 21 figures","Journal of Combinatorial Optimization, 2020",10.1007/s10878-020-00584-2,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce and asses several Divide \& Conquer heuristic strategies aimed
to solve large instances of the 0-1 Minimization Knapsack Problem. The method
subdivides a large problem in two smaller ones (or recursive iterations of the
same principle), to lower down the global computational complexity of the
original problem, at the expense of a moderate loss of quality in the solution.
Theoretical mathematical results are presented in order to guarantee an
algorithmically successful application of the method and to suggest the
potential strategies for its implementation. In contrast, due to the lack of
theoretical results, the solution's quality deterioration is measured
empirically by means of Monte Carlo simulations for several types and values of
the chosen strategies. Finally, introducing parameters of efficiency we suggest
the best strategies depending on the data input.
","[{'version': 'v1', 'created': 'Fri, 4 Jan 2019 17:16:10 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Apr 2020 21:15:44 GMT'}]",2020-08-21,"[['Morales', 'Fernando A', ''], ['Martínez', 'Jairo A', '']]","['Divide and Conquer', 'Minimization Knapsack Problem', 'Monte Carlo simulations', 'method’sefficiency']"
5185,1811.03046,Mohammad Rafayet Ali,"Mohammad Rafayet Ali, Zahra Razavi, Abdullah Al Mamun, Raina Langevin,
  Benjamin Kane, Reza Rawassizadeh, Lenhart Schubert, M Ehsan Hoque","A Virtual Conversational Agent for Teens with Autism: Experimental
  Results and Design Lessons",,,10.1145/3383652.3423900,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the design of an online social skills development interface for
teenagers with autism spectrum disorder (ASD). The interface is intended to
enable private conversation practice anywhere, anytime using a web-browser.
Users converse informally with a virtual agent, receiving feedback on nonverbal
cues in real-time, and summary feedback. The prototype was developed in
consultation with an expert UX designer, two psychologists, and a pediatrician.
Using the data from 47 individuals, feedback and dialogue generation were
automated using a hidden Markov model and a schema-driven dialogue manager
capable of handling multi-topic conversations. We conducted a study with nine
high-functioning ASD teenagers. Through a thematic analysis of post-experiment
interviews, identified several key design considerations, notably: 1) Users
should be fully briefed at the outset about the purpose and limitations of the
system, to avoid unrealistic expectations. 2) An interface should incorporate
positive acknowledgment of behavior change. 3) Realistic appearance of a
virtual agent and responsiveness are important in engaging users. 4)
Conversation personalization, for instance in prompting laconic users for more
input and reciprocal questions, would help the teenagers engage for longer
terms and increase the system's utility.
","[{'version': 'v1', 'created': 'Wed, 7 Nov 2018 18:02:53 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Jan 2019 12:58:31 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Oct 2020 04:09:05 GMT'}]",2020-10-29,"[['Ali', 'Mohammad Rafayet', ''], ['Razavi', 'Zahra', ''], ['Mamun', 'Abdullah Al', ''], ['Langevin', 'Raina', ''], ['Kane', 'Benjamin', ''], ['Rawassizadeh', 'Reza', ''], ['Schubert', 'Lenhart', ''], ['Hoque', 'M Ehsan', '']]","['Animated conversational agent design', 'social skills training', 'realtime feedback', 'autism intervention', 'nonverbal behavior', 'schemabased dialogue management']"
5186,1807.03646,Dejan Lavbi\v{c},"Dejan Lavbi\v{c}, Olegas Vasilecas and Rok Rupnik","Ontology-based multi-agent system to support business users and
  management","17 pages, 6 figures","Technological and Economic Development of Economy 16 (2010)
  327-347",10.3846/tede.2010.21,,cs.MA cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For some decision processes a significant added value is achieved when
enterprises' internal Data Warehouse (DW) can be integrated and combined with
external data gained from web sites of competitors and other relevant Web
sources. In this paper we discuss the agent-based integration approach using
ontologies (DSS-MAS). In this approach data from internal DW and external
sources are scanned by coordinated group of agents, while semantically
integrated and relevant data is reported to business users according to
business rules. After data from internal DW, Web sources and business rules are
acquired, agents using these data and rules can infer new knowledge and
therefore facilitate decision making process. Knowledge represented in
enterprises' ontologies is acquired from business users without extensive
technical knowledge using user friendly user interface based on constraints and
predefined templates. The approach presented in the paper was verified using
the case study from the domain of mobile communications with the emphasis on
supply and demand of mobile phones.
","[{'version': 'v1', 'created': 'Tue, 10 Jul 2018 13:48:29 GMT'}]",2018-07-11,"[['Lavbič', 'Dejan', ''], ['Vasilecas', 'Olegas', ''], ['Rupnik', 'Rok', '']]","['Decision support', 'agent', 'multi-agent system', 'ontology', 'data warehouse', 'information retrieval', 'business rules', 'business process management']"
5187,1501.02034,EPTCS,"Pascual Juli\'an-Iranzo (Universidad de Castilla-La Mancha), Gin\'es
  Moreno (Universidad de Castilla-La Mancha), Jaime Penabad (Universidad de
  Castilla-La Mancha), Carlos V\'azquez (Universidad de Castilla-La Mancha)","A Fuzzy Logic Programming Environment for Managing Similarity and Truth
  Degrees","In Proceedings PROLE 2014, arXiv:1501.01693","EPTCS 173, 2015, pp. 71-86",10.4204/EPTCS.173.6,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  FASILL (acronym of ""Fuzzy Aggregators and Similarity Into a Logic Language"")
is a fuzzy logic programming language with implicit/explicit truth degree
annotations, a great variety of connectives and unification by similarity.
FASILL integrates and extends features coming from MALP (Multi-Adjoint Logic
Programming, a fuzzy logic language with explicitly annotated rules) and
Bousi~Prolog (which uses a weak unification algorithm and is well suited for
flexible query answering). Hence, it properly manages similarity and truth
degrees in a single framework combining the expressive benefits of both
languages. This paper presents the main features and implementations details of
FASILL. Along the paper we describe its syntax and operational semantics and we
give clues of the implementation of the lattice module and the similarity
module, two of the main building blocks of the new programming environment
which enriches the FLOPER system developed in our research group.
","[{'version': 'v1', 'created': 'Fri, 9 Jan 2015 04:00:25 GMT'}]",2015-01-12,"[['Julián-Iranzo', 'Pascual', '', 'Universidad de Castilla-La Mancha'], ['Moreno', 'Ginés', '', 'Universidad de Castilla-La Mancha'], ['Penabad', 'Jaime', '', 'Universidad de\n  Castilla-La Mancha'], ['Vázquez', 'Carlos', '', 'Universidad de Castilla-La Mancha']]","['Fuzzy Logic Programming', 'Similarity Relations', 'Software Tools']"
5188,1809.00564,Stefano Cerri,"Philippe Lemoisson (UMR TETIS), Stefano A. Cerri (SMILE)",ViewpointS: towards a Collective Brain,,"Ngoc Thanh Nguyen; Elias Pimenidis; Zaheer Khan; Bogdan
  Trawi{\'n}ski. ICCCI: International Conference on Computational Collective
  Intelligence, Sep 2018, Bristol, United Kingdom. Springer Verlag, 10th
  International Conference on Computational Collective Intelligence, LNCS
  (11055), pp.3-12, 2018, http://www.iccci2018.org",10.1007/978-3-319-98443-8_1,,cs.MA cs.AI cs.SI q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tracing knowledge acquisition and linking learning events to interaction
between peers is a major challenge of our times. We have conceived, designed
and evaluated a new paradigm for constructing and using collective knowledge by
Web interactions that we called ViewpointS. By exploiting the similarity with
Edelman's Theory of Neuronal Group Selection (TNGS), we conjecture that it may
be metaphorically considered a Collective Brain, especially effective in the
case of trans-disciplinary representations. Far from being without doubts, in
the paper we present the reasons (and the limits) of our proposal that aims to
become a useful integrating tool for future quantitative explorations of
individual as well as collective learning at different degrees of granu-larity.
We are therefore challenging each of the current approaches: the logical one in
the semantic Web, the statistical one in mining and deep learning, the social
one in recommender systems based on authority and trust; not in each of their
own preferred field of operation, rather in their integration weaknesses far
from the holistic and dynamic behavior of the human brain.
","[{'version': 'v1', 'created': 'Mon, 3 Sep 2018 11:51:13 GMT'}]",2018-09-05,"[['Lemoisson', 'Philippe', '', 'UMR TETIS'], ['Cerri', 'Stefano A.', '', 'SMILE']]","['collective brain', 'collective intelligence', 'knowledge graph', 'human learning', 'knowledge acquisition', 'semantic web', 'social web']"
5189,1509.02627,Carlos Alegr\'ia-Galicia,"Carlos Alegr\'ia-Galicia, Tzolkin Gardu\~no, Carlos Seara, Areli
  Rosas-Navarrete, Jorge Urrutia",Rectilinear Convex Hull with minimum area,,Lecture Notes in Computer Science 7579 (2012) 226-235,10.1007/978-3-642-34191-5_22,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $P$ be a planar set of $n$ points in general position. We consider the
problem of computing an orientation of the plane for which the Rectilinear
Convex Hull of $P$ has minimum area. Bae et al. (Computational Geometry: Theory
and Applications, Vol. 42, 2009) solved the problem in quadratic time and
linear space. We describe an algorithm that reduces this time complexity to
$\Theta(n \log n)$.
","[{'version': 'v1', 'created': 'Wed, 9 Sep 2015 03:53:34 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Dec 2017 21:57:47 GMT'}]",2017-12-29,"[['Alegría-Galicia', 'Carlos', ''], ['Garduño', 'Tzolkin', ''], ['Seara', 'Carlos', ''], ['Rosas-Navarrete', 'Areli', ''], ['Urrutia', 'Jorge', '']]","['rectilinear convex hull', 'orthoconvexity', 'optimization']"
5190,1911.10400,Oliver Karras,"Oliver Karras, Kurt Schneider, Samuel A. Fricker","Representing Software Project Vision by Means of Video: A Quality Model
  for Vision Videos",Preprint accepted for publication in Journal of Systems and Software;,,10.1016/j.jss.2019.110479,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Establishing a shared software project vision is a key challenge in
Requirements Engineering (RE). Several approaches use videos to represent
visions. However, these approaches omit how to produce a good video. This
missing guidance is one crucial reason why videos are not established in RE. We
propose a quality model for videos representing a vision, so-called vision
videos. Based on two literature reviews, we elaborate ten quality
characteristics of videos and five quality characteristics of visions which
together form a quality model for vision videos that includes all 15 quality
characteristics. We provide two representations of the quality model: (a) A
hierarchical decomposition of vision video quality into the quality
characteristics and (b) A mapping of these characteristics to the video
production and use process. While the hierarchical decomposition supports the
evaluation of vision videos, the mapping provides guidance for video
production. In an evaluation with 139 students, we investigated whether the 15
characteristics are related to the overall quality of vision videos perceived
by the subjects from a developer's the point of view. Six characteristics
(video length, focus, prior knowledge, clarity, pleasure, and stability)
correlated significantly with the likelihood that the subjects perceived a
vision video as good. These relationships substantiate a fundamental relevance
of the proposed quality model. Therefore, we conclude that the quality model is
a sound basis for future refinements and extensions.
","[{'version': 'v1', 'created': 'Sat, 23 Nov 2019 18:29:40 GMT'}]",2019-11-26,"[['Karras', 'Oliver', ''], ['Schneider', 'Kurt', ''], ['Fricker', 'Samuel A.', '']]","['Vision', 'video', 'vision video', 'production', 'characteristic', 'quality model']"
5191,1111.5741,Willy Picard,Zbigniew Paszkiewicz and Willy Picard,"Reference Model for Performance Management in Service-Oriented Virtual
  Organization Breeding Environments",10 pages,,10.1007/978-3-642-04568-4_52,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Performance management (PM) is a key function of virtual organization (VO)
management. A large set of PM indicators has been proposed and evaluated within
the context of virtual breeding environments (VBEs). However, it is currently
difficult to describe and select suitable PM indicators because of the lack of
a common vocabulary and taxonomies of PM indicators. Therefore, there is a need
for a framework unifying concepts in the domain of VO PM. In this paper, a
reference model for VO PM is presented in the context of service-oriented VBEs.
In the proposed reference model, both a set of terms that could be used to
describe key performance indicators, and a set of taxonomies reflecting various
aspects of PM are proposed. The proposed reference model is a first attempt and
a work in progress that should not be supposed exhaustive.
","[{'version': 'v1', 'created': 'Thu, 24 Nov 2011 12:26:57 GMT'}]",2011-11-28,"[['Paszkiewicz', 'Zbigniew', ''], ['Picard', 'Willy', '']]","['virtual organization', 'performance measurement', 'key performance indicators']"
5192,1007.3183,Laurent Hubert,Laurent Hubert (INRIA - IRISA),A Non-Null Annotation Inferencer for Java Bytecode,,"PASTE: Program analysis for software tools and engineering,
  Atlanta, Georgia : United States (2008)",10.1145/1512475.1512484,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a non-null annotations inferencer for the Java bytecode language.
We previously proposed an analysis to infer non-null annotations and proved it
soundness and completeness with respect to a state of the art type system. This
paper proposes extensions to our former analysis in order to deal with the Java
bytecode language. We have implemented both analyses and compared their
behaviour on several benchmarks. The results show a substantial improvement in
the precision and, despite being a whole-program analysis, production
applications can be analyzed within minutes.
","[{'version': 'v1', 'created': 'Mon, 19 Jul 2010 15:28:00 GMT'}]",2010-07-26,"[['Hubert', 'Laurent', '', 'INRIA - IRISA']]","['Static analysis', 'NonNull', 'annotation', 'inference', 'Java']"
5193,1811.00233,Toru Tamaki,"Tsubasa Hirakawa, Takayoshi Yamashita, Toru Tamaki and Hironobu
  Fujiyoshi",Survey on Vision-based Path Prediction,DAPI 2018,,10.1007/978-3-319-91131-1_4,,cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Path prediction is a fundamental task for estimating how pedestrians or
vehicles are going to move in a scene. Because path prediction as a task of
computer vision uses video as input, various information used for prediction,
such as the environment surrounding the target and the internal state of the
target, need to be estimated from the video in addition to predicting paths.
Many prediction approaches that include understanding the environment and the
internal state have been proposed. In this survey, we systematically summarize
methods of path prediction that take video as input and and extract features
from the video. Moreover, we introduce datasets used to evaluate path
prediction methods quantitatively.
","[{'version': 'v1', 'created': 'Thu, 1 Nov 2018 05:12:01 GMT'}]",2018-11-02,"[['Hirakawa', 'Tsubasa', ''], ['Yamashita', 'Takayoshi', ''], ['Tamaki', 'Toru', ''], ['Fujiyoshi', 'Hironobu', '']]","['Path prediction', 'Trajectory', 'Pedestrian', 'Survey', 'Datasets']"
5194,2102.04565,Jakob Schoeffer,"Jakob Schoeffer, Niklas Kuehl, Isabel Valera",A Ranking Approach to Fair Classification,"ACM SIGCAS Conference on Computing and Sustainable Societies
  (COMPASS), June 28--July 2, 2021, Virtual Event, Australia",,10.1145/3460112.3471950,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Algorithmic decision systems are increasingly used in areas such as hiring,
school admission, or loan approval. Typically, these systems rely on labeled
data for training a classification model. However, in many scenarios,
ground-truth labels are unavailable, and instead we have only access to
imperfect labels as the result of (potentially biased) human-made decisions.
Despite being imperfect, historical decisions often contain some useful
information on the unobserved true labels. In this paper, we focus on scenarios
where only imperfect labels are available and propose a new fair ranking-based
decision system based on monotonic relationships between legitimate features
and the outcome. Our approach is both intuitive and easy to implement, and thus
particularly suitable for adoption in real-world settings. More in detail, we
introduce a distance-based decision criterion, which incorporates useful
information from historical decisions and accounts for unwanted correlation
between protected and legitimate features. Through extensive experiments on
synthetic and real-world data, we show that our method is fair in the sense
that a) it assigns the desirable outcome to the most qualified individuals, and
b) it removes the effect of stereotypes in decision-making, thereby
outperforming traditional classification algorithms. Additionally, we are able
to show theoretically that our method is consistent with a prominent concept of
individual fairness which states that ""similar individuals should be treated
similarly.""
","[{'version': 'v1', 'created': 'Mon, 8 Feb 2021 22:51:12 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Jul 2021 05:19:56 GMT'}]",2021-07-19,"[['Schoeffer', 'Jakob', ''], ['Kuehl', 'Niklas', ''], ['Valera', 'Isabel', '']]","['Fairness', 'bias', 'classification', 'ranking', 'algorithmic decision-making']"
5195,1709.04321,Xu Gong,"Xu Gong, David Plets, Emmeric Tanghe, Toon De Pessemier, Luc Martens,
  Wout Joseph","An efficient genetic algorithm for large-scale planning of robust
  industrial wireless networks",,Expert Systems with Applications 2017,10.1016/j.eswa.2017.12.011,,cs.NE cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An industrial indoor environment is harsh for wireless communications
compared to an office environment, because the prevalent metal easily causes
shadowing effects and affects the availability of an industrial wireless local
area network (IWLAN). On the one hand, it is costly, time-consuming, and
ineffective to perform trial-and-error manual deployment of wireless nodes. On
the other hand, the existing wireless planning tools only focus on office
environments such that it is hard to plan IWLANs due to the larger problem size
and the deployed IWLANs are vulnerable to prevalent shadowing effects in harsh
industrial indoor environments. To fill this gap, this paper proposes an
overdimensioning model and a genetic algorithm based over-dimensioning (GAOD)
algorithm for deploying large-scale robust IWLANs. As a progress beyond the
state-of-the-art wireless planning, two full coverage layers are created. The
second coverage layer serves as redundancy in case of shadowing. Meanwhile, the
deployment cost is reduced by minimizing the number of access points (APs); the
hard constraint of minimal inter-AP spatial paration avoids multiple APs
covering the same area to be simultaneously shadowed by the same obstacle. The
computation time and occupied memory are dedicatedly considered in the design
of GAOD for large-scale optimization. A greedy heuristic based
over-dimensioning (GHOD) algorithm and a random OD algorithm are taken as
benchmarks. In two vehicle manufacturers with a small and large indoor
environment, GAOD outperformed GHOD with up to 20% less APs, while GHOD
outputted up to 25% less APs than a random OD algorithm. Furthermore, the
effectiveness of this model and GAOD was experimentally validated with a real
deployment system.
","[{'version': 'v1', 'created': 'Sat, 12 Aug 2017 18:20:25 GMT'}]",2017-12-18,"[['Gong', 'Xu', ''], ['Plets', 'David', ''], ['Tanghe', 'Emmeric', ''], ['De Pessemier', 'Toon', ''], ['Martens', 'Luc', ''], ['Joseph', 'Wout', '']]","['Genetic algorithms', 'high performance computing', 'scalability', 'wireless networks', 'network planning', 'harsh']"
5196,1311.4904,Gabriele Fici,Gabriele Fici,On the Structure of Bispecial Sturmian Words,arXiv admin note: substantial text overlap with arXiv:1204.1672,"Journal of Computer and System Sciences, 80(4): 711-719 (2014)",10.1016/j.jcss.2013.11.001,,cs.FL cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A balanced word is one in which any two factors of the same length contain
the same number of each letter of the alphabet up to one. Finite binary
balanced words are called Sturmian words. A Sturmian word is bispecial if it
can be extended to the left and to the right with both letters remaining a
Sturmian word. There is a deep relation between bispecial Sturmian words and
Christoffel words, that are the digital approximations of Euclidean segments in
the plane. In 1997, J. Berstel and A. de Luca proved that \emph{palindromic}
bispecial Sturmian words are precisely the maximal internal factors of
\emph{primitive} Christoffel words. We extend this result by showing that
bispecial Sturmian words are precisely the maximal internal factors of
\emph{all} Christoffel words. Our characterization allows us to give an
enumerative formula for bispecial Sturmian words. We also investigate the
minimal forbidden words for the language of Sturmian words.
","[{'version': 'v1', 'created': 'Tue, 19 Nov 2013 22:01:28 GMT'}]",2014-07-15,"[['Fici', 'Gabriele', '']]","['Sturmian words', 'Christoffel words', 'special factors', 'minimal forbidden words', 'enumerative formula']"
5197,2102.10182,Corto Mascle,"Yoan G\'eran, Bastien Laboureix, Corto Mascle, Valentin D. Richard",Keyboards as a new model of computation,"Two versions, in French and in English",,10.4230/LIPIcs.MFCS.2021.49,,cs.FL cs.CL,http://creativecommons.org/licenses/by/4.0/,"  We introduce a new formalisation of languages, called keyboards. We consider
a set of elementary operations (writing/erasing a letter, going to the right or
to the left,...) and we define a keyboard as a set of finite sequences of such
operations, called keys. The corresponding language is the set of words
obtained by applying some sequence of those keys. Unlike classical models of
computation, every key can be applied anytime. We define various classes of
languages based on different sets of elementary operations, and compare their
expressive powers. We also compare them to well-known classes of languages
(Chomsky hierarchy). We obtain a strict hierarchy of languages, whose
expressivity is orthogonal to the one of the aforementionned classical models.
  --
  Nous introduisons une nouvelle repr\'esentation de langages, les claviers. On
se munit d'un ensemble d'op\'erations \'el\'ementaires (ajout, effacement d'une
lettre, d\'eplacement \`a droite, \`a gauche, ...), et on d\'efinit un clavier
comme un ensemble de suites finies d'op\'erations \'el\'ementaires, appel\'ees
touches. Son langage sera l'ensemble des mots obtenus en appliquant une suite
quelconque de touches. Contrairement \`a des mod\`eles de calcul classiques,
toutes les touches peuvent \^etre appliqu\'ees \`a tout moment. En premier lieu
nous d\'efinissons diff\'erentes classes de claviers en faisant varier
l'ensemble des op\'erations \'el\'ementaires autoris\'ees, et nous comparons
l'expressivit\'e des classes de langages obtenues. Nous comparons \'egalement
ces classes \`a la hi\'erarchie de Chomsky. Nous obtenons que toutes les
classes \'etudi\'ees sont diff\'erentes, et nous caract\'erisons les classes
inclues dans les rationnels et les alg\'ebriques. L'expressivit\'e des claviers
semble orthogonale \`a celle des mod\`eles \'evoqu\'es pr\'ec\'edemment.
","[{'version': 'v1', 'created': 'Fri, 19 Feb 2021 22:17:18 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Mar 2021 10:37:22 GMT'}, {'version': 'v3', 'created': 'Thu, 1 Jul 2021 14:51:57 GMT'}]",2021-09-07,"[['Géran', 'Yoan', ''], ['Laboureix', 'Bastien', ''], ['Mascle', 'Corto', ''], ['Richard', 'Valentin D.', '']]","['formal languages', 'models of computation', 'automata theory']"
5198,1302.1393,Hicham Elasri,Hicham Elasri and Abderrahim Sekkaki,"Semantic integration process of business components to support
  information system designers","International Journal of Web & Semantic Technology (IJWesT). arXiv
  admin note: substantial text overlap with arXiv:1110.4501","International Journal of Web & Semantic Technology (IJWesT) Vol.4,
  No.1, January 2013",10.5121/ijwest.2013.4104,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The present work is inscribed within the intersection of two scientific
thematic: the engineering by reuse of components and ontologies alignment. The
integration of Business Components (BC) is a research problem that has been
identified in the field of engineering by reuse. Our proposal aims to provide
assistance to designers of information systems in the integration phase. It is
a process guided by domain ontology to provide semantic integration of BC. This
process allows the detection and resolution of semantic conflicts naming type
encountered in the process of integration of BC.
","[{'version': 'v1', 'created': 'Wed, 6 Feb 2013 15:01:33 GMT'}]",2013-02-07,"[['Elasri', 'Hicham', ''], ['Sekkaki', 'Abderrahim', '']]","['Component', 'Business Components', 'Semantic Integration', 'Ontology alignment', 'Enriching Ontologies']"
5199,1902.00544,Andi Bejleri,"Andi Bejleri (TU Darmstadt, Germany), Elton Domnori (Epoka University,
  Albania), Malte Viering (TU Darmstadt, Germany), Patrick Eugster (Universita
  della Svizzera Italiana, Switzerland), Mira Mezini (TU Darmstadt, Germany)",Comprehensive Multiparty Session Types,,"The Art, Science, and Engineering of Programming, 2019, Vol. 3,
  Issue 3, Article 6",10.22152/programming-journal.org/2019/3/6,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multiparty session types (MST) are a well-established type theory that
describes the interactive structure of a fixed number of components from a
global point of view and type-checks the components through projection of the
global type onto the participants of the session. They guarantee
communicationsafety for a language of multiparty sessions (LMS), i.e.,
distributed, parallel components can exchange values without deadlocking and
unexpected message types. Several variants of MST and LMS have been proposed to
study key features of distributed and parallel programming. We observe that the
population of the considered variants follows from only one ancestor, i.e., the
original LMS/MST, and there are overlapping traits between features of the
considered variants and the original. These hamper evolution of session types
and languages and their adoption in practice. This paper addresses the
following question: What are the essential features for MST and LMS, and how
can these be modelled with simple constructs? To the best of our knowledge,
this is the first time this question has been addressed. We performed a
systematic analysis of the features and the constructs in MST, LMS, and the
considered variants to identify the essential features. The variants are among
the most influential (according to Google Scholar) and well-established systems
that cover a wide set of areas in distributed, parallel programming. We used
classical techniques of formal models such as BNF, structural congruence, small
step operational semantics and typing judgments to build our language and type
system. Lastly, the coherence of operational semantics and type system is
proven by induction. This paper proposes a set of essential features, a
language of structured interactions and a type theory of comprehensive
multiparty session types, including global types and type system. The analysis
removes overlapping features and captures the shared traits, thereby
introducing the essential features. The constructs of the language are simple
and fundamental, based on the $\lambda$ and $\pi$ calculi. Analogously, our
global types reflect what is omitted and introduced in the language. Our system
covers all the features of the original and variants, with a better ratio of
the number of language and type constructs over the number of covered features.
The features of the original, variants, and our system along with the number of
constructs in the respective language and global types to model them are
presented through a table. The syntax, operational semantics, meta-theory and
type system of our system are given. We modelled all the motivating examples of
the variants in our model, describing the reduction and typing steps. The work
discusses how new features, in particular the non-essential ones (formerly
excluded) and advanced ones can be either modelled atop the essential ones or
added with minimal efforts, i.e. without modifying the existing ones. The
fundamental properties of typed processes such as subject reduction,
communication safety, and progress are established.
","[{'version': 'v1', 'created': 'Fri, 1 Feb 2019 20:15:01 GMT'}]",2019-02-05,"[['Bejleri', 'Andi', '', 'TU Darmstadt, Germany'], ['Domnori', 'Elton', '', 'Epoka University,\n  Albania'], ['Viering', 'Malte', '', 'TU Darmstadt, Germany'], ['Eugster', 'Patrick', '', 'Universita\n  della Svizzera Italiana, Switzerland'], ['Mezini', 'Mira', '', 'TU Darmstadt, Germany']]","['Structured programming', 'session types', 'mobile processes', 'distributed programming']"
5200,1605.07046,Qiyu Sun,"Lan Li, Cheng Cheng, Deguang Han, Qiyu Sun and Guangming Shi",Phase retrieval from multiple-window short-time Fourier measurements,,,10.1109/LSP.2017.2663668,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce two symmetric directed graphs depending on
supports of signals and windows, and we show that the connectivity of those
graphs provides either necessary and sufficient conditions to phase retrieval
of a signal from magnitude measurements of its multiple-window short-time
Fourier transform. Also we propose an algebraic reconstruction algorithm, and
provide an error estimate to our algorithm when magnitude measurements are
corrupted by deterministic/random noises.
","[{'version': 'v1', 'created': 'Mon, 23 May 2016 14:59:57 GMT'}]",2017-02-22,"[['Li', 'Lan', ''], ['Cheng', 'Cheng', ''], ['Han', 'Deguang', ''], ['Sun', 'Qiyu', ''], ['Shi', 'Guangming', '']]","['Short-Time Fourier Transform', 'Phase Retrieval', 'Graph']"
5201,1806.10359,Aymen Azaza,Aymen Azaza and Joost van de Weijer and Ali Douik and Marc Masana,Context Proposals for Saliency Detection,Accepted at Computer Vision and Image Understanding (CVIU),,10.1016/j.cviu.2018.06.002,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the fundamental properties of a salient object region is its contrast
with the immediate context. The problem is that numerous object regions exist
which potentially can all be salient. One way to prevent an exhaustive search
over all object regions is by using object proposal algorithms. These return a
limited set of regions which are most likely to contain an object. Several
saliency estimation methods have used object proposals. However, they focus on
the saliency of the proposal only, and the importance of its immediate context
has not been evaluated.
  In this paper, we aim to improve salient object detection. Therefore, we
extend object proposal methods with context proposals, which allow to
incorporate the immediate context in the saliency computation. We propose
several saliency features which are computed from the context proposals. In the
experiments, we evaluate five object proposal methods for the task of saliency
segmentation, and find that Multiscale Combinatorial Grouping outperforms the
others. Furthermore, experiments show that the proposed context features
improve performance, and that our method matches results on the FT datasets and
obtains competitive results on three other datasets (PASCAL-S, MSRA-B and
ECSSD).
","[{'version': 'v1', 'created': 'Wed, 27 Jun 2018 09:11:50 GMT'}]",2018-07-03,"[['Azaza', 'Aymen', ''], ['van de Weijer', 'Joost', ''], ['Douik', 'Ali', ''], ['Masana', 'Marc', '']]","['Computational Saliency', 'Object Segmentation', 'ObjectProposals']"
5202,2105.09772,Marco Attene PhD,Marco Attene,Indirect predicates for geometric constructions,"In Computer-Aided Design, 2020",,10.1016/j.cad.2020.102856,,cs.CG,http://creativecommons.org/licenses/by/4.0/,"  Geometric predicates are a basic ingredient to implement a vast range of
algorithms in computational geometry. Modern implementations employ floating
point filtering techniques to combine efficiency and robustness, and
state-of-the-art predicates are guaranteed to be always exact while being only
slightly slower than corresponding (inexact) floating point implementations.
Unfortunately, if the input to these predicates is an intermediate construction
of an algorithm, its floating point representation may be affected by an
approximation error, and correctness is no longer guaranteed. This paper
introduces the concept of indirect geometric predicate: instead of taking the
intermediate construction as an explicit input, an indirect predicate considers
the primitive geometric elements which are combined to produce such a
construction. This makes it possible to keep track of the floating point
approximation, and thus to exploit efficient filters and expansion arithmetic
to exactly resolve the predicate with minimal overhead with respect to a naive
floating point implementation. As a representative example, we show how to
extend standard predicates to the case of points of intersection of linear
elements (i.e. lines and planes) and show that, on classical problems, this
approach outperforms state-of-the-art solutions based on lazy exact
intermediate representations.
","[{'version': 'v1', 'created': 'Thu, 20 May 2021 14:20:48 GMT'}]",2021-05-21,"[['Attene', 'Marco', '']]","['Geometric predicates', 'Exact arithmetic', 'Filtering']"
5203,1512.08049,Omar Al-Kadi,Omar S. Al-Kadi,"Texture measures combination for improved meningioma classification of
  histopathological images",,"Pattern Recognition, vol.43, pp.2043-2053, 2010",10.1016/j.patcog.2010.01.005,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Providing an improved technique which can assist pathologists in correctly
classifying meningioma tumours with a significant accuracy is our main
objective. The proposed technique, which is based on optimum texture measure
combination, inspects the separability of the RGB colour channels and selects
the channel which best segments the cell nuclei of the histopathological
images. The morphological gradient was applied to extract the region of
interest for each subtype and for elimination of possible noise (e.g. cracks)
which might occur during biopsy preparation. Meningioma texture features are
extracted by four different texture measures (two model-based and two
statistical-based) and then corresponding features are fused together in
different combinations after excluding highly correlated features, and a
Bayesian classifier was used for meningioma subtype discrimination. The
combined Gaussian Markov random field and run-length matrix texture measures
outperformed all other combinations in terms of quantitatively characterising
the meningioma tissue, achieving an overall classification accuracy of 92.50%,
improving from 83.75% which is the best accuracy achieved if the texture
measures are used individually.
","[{'version': 'v1', 'created': 'Fri, 25 Dec 2015 23:06:45 GMT'}]",2015-12-29,"[['Al-Kadi', 'Omar S.', '']]","['─ coloured texture analysis', 'feature extraction', 'histopathological images', 'meningioma', 'naïve Bayesian classifier', 'Bhattacharyya distance']"
5204,1005.2280,Amparo F\'uster-Sabater,Amparo F\'uster-Sabater and Dolores de la Gu\'ia-Mart\'inez,"Modelling Nonlinear Sequence Generators in terms of Linear Cellular
  Automata","15 pages, 0 figures","Applied Mathematical Modelling. Volume 31, Issue 2, pp. 226-235.
  February 2007.",10.1016/j.apm.2005.08.013,,cs.CR cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, a wide family of LFSR-based sequence generators, the so-called
Clock-Controlled Shrinking Generators (CCSGs), has been analyzed and identified
with a subset of linear Cellular Automata (CA). In fact, a pair of linear
models describing the behavior of the CCSGs can be derived. The algorithm that
converts a given CCSG into a CA-based linear model is very simple and can be
applied to CCSGs in a range of practical interest. The linearity of these
cellular models can be advantageously used in two different ways: (a) for the
analysis and/or cryptanalysis of the CCSGs and (b) for the reconstruction of
the output sequence obtained from this kind of generators.
","[{'version': 'v1', 'created': 'Thu, 13 May 2010 09:03:44 GMT'}]",2010-05-14,"[['Fúster-Sabater', 'Amparo', ''], ['de la Guía-Martínez', 'Dolores', '']]","['Cellular automata', 'Clock-controlled generators', 'Pseudorandom sequence', 'Linear modelling']"
5205,2105.04150,Benjamin Boys,"B. Boys, T. J. Dodwell, M. Hobbs, M. Girolami",PeriPy -- A High Performance OpenCL Peridynamics Package,peripy.readthedocs.org,,10.1016/j.cma.2021.114085,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  This paper presents a lightweight, open-source and high-performance python
package for solving peridynamics problems in solid mechanics. The development
of this solver is motivated by the need for fast analysis tools to achieve the
large number of simulations required for `outer-loop' applications, including
sensitivity analysis, uncertainty quantification and optimisation. Our python
software toolbox utilises the heterogeneous nature of OpenCL so that it can be
executed on any platform with CPU or GPU cores. We illustrate the package use
through a range of industrially motivated examples, which should enable other
researchers to build on and extend the solver for use in their own
applications. Step improvements in execution speed and functionality over
existing techniques are presented. A comparison between this solver and an
existing OpenCL implementation in the literature is presented, tested on
benchmarks with hundreds of thousands to tens of millions of nodes. We
demonstrate the scalability of the solver on the GeForce RTX 2080 TiGPU from
NVIDIA, and the memory-bound limitations are analysed. In all test cases, the
implementation is between 1.4 and 10.0 times faster than a similar existing GPU
implementation in the literature. In particular, this improvement has been
achieved by utilising local memory on the GPU.
","[{'version': 'v1', 'created': 'Mon, 10 May 2021 07:09:24 GMT'}, {'version': 'v2', 'created': 'Sun, 25 Jul 2021 19:17:01 GMT'}, {'version': 'v3', 'created': 'Mon, 23 Aug 2021 10:26:34 GMT'}]",2021-09-15,"[['Boys', 'B.', ''], ['Dodwell', 'T. J.', ''], ['Hobbs', 'M.', ''], ['Girolami', 'M.', '']]","['peridynamics', 'non-local continuum', 'fracture', 'Graphics Processing Unit', 'OpenCL']"
5206,1904.04026,Moonmoon Chakraborty,Moonmoon Chakraborty,Fog Computing Vs. Cloud Computing,"10 pages, 1 figure, 1 table",,10.6084/m9.figshare.7886126,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article gives an overview of what Fog computing is, its uses and the
comparison between Fog computing and Cloud computing. Cloud is performing well
in todays World and boosting the ability to use the internet more than ever.
Cloud computing gradually developed a method to use the benefits of it in most
of the organizations. Fog computing can be apparent both in big data structures
and large cloud systems, making reference to the growing complications in
retrieving the data accurately. Fog computing is outspreading cloud computing
by transporting computation on the advantage of network systems such as cell
phone devices or fixed nodes with in-built data storage. Fog provides important
points of improved abilities, strong security controls, and processes,
establish data transmission capabilities carefully and in a flexible manner.
This paper gives an overview of the connections and attributes for both Fog
computing and cloud varies by outline, preparation, directions, and strategies
for associations and clients. This also explains how Fog computing is flexible
and provide better service for data processing by overwhelming low network
bandwidth instead of moving whole data to the cloud platform.
","[{'version': 'v1', 'created': 'Sun, 24 Mar 2019 18:16:42 GMT'}]",2019-04-09,"[['Chakraborty', 'Moonmoon', '']]","['Data', 'Cloud', 'Fog', 'Computing', 'Flexible', 'Security']"
5207,1409.8098,Ward Jaradat,"Ward Jaradat, Alan Dearle, Adam Barker",Workflow Partitioning and Deployment on the Cloud using Orchestra,"To appear in Proceedings of the IEEE/ACM 7th International Conference
  on Utility and Cloud Computing (UCC 2014)",,10.1109/UCC.2014.34,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Orchestrating service-oriented workflows is typically based on a design model
that routes both data and control through a single point - the centralised
workflow engine. This causes scalability problems that include the unnecessary
consumption of the network bandwidth, high latency in transmitting data between
the services, and performance bottlenecks. These problems are highly prominent
when orchestrating workflows that are composed from services dispersed across
distant geographical locations. This paper presents a novel workflow
partitioning approach, which attempts to improve the scalability of
orchestrating large-scale workflows. It permits the workflow computation to be
moved towards the services providing the data in order to garner optimal
performance results. This is achieved by decomposing the workflow into smaller
sub workflows for parallel execution, and determining the most appropriate
network locations to which these sub workflows are transmitted and subsequently
executed. This paper demonstrates the efficiency of our approach using a set of
experimental workflows that are orchestrated over Amazon EC2 and across several
geographic network regions.
","[{'version': 'v1', 'created': 'Mon, 29 Sep 2014 12:39:13 GMT'}]",2016-11-15,"[['Jaradat', 'Ward', ''], ['Dearle', 'Alan', ''], ['Barker', 'Adam', '']]","['Service-oriented workflows', 'orchestration', 'partitioning', 'computation placement analysis', 'deployment']"
5208,1908.11740,Panagiotis Bouros,"Dimitrios Tsitsigkos and Panagiotis Bouros and Nikos Mamoulis and
  Manolis Terrovitis",Parallel In-Memory Evaluation of Spatial Joins,Extended version of the SIGSPATIAL'19 paper under the same title,"27th ACM SIGSPATIAL International Conference on Advances in
  Geographic Information Systems (ACM SIGSPATIAL GIS 2019), Chicago, Illinois,
  USA, November 5-8, 2019",10.1145/3347146.3359343,,cs.DB cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The spatial join is a popular operation in spatial database systems and its
evaluation is a well-studied problem. As main memories become bigger and faster
and commodity hardware supports parallel processing, there is a need to revamp
classic join algorithms which have been designed for I/O-bound processing. In
view of this, we study the in-memory and parallel evaluation of spatial joins,
by re-designing a classic partitioning-based algorithm to consider alternative
approaches for space partitioning. Our study shows that, compared to a
straightforward implementation of the algorithm, our tuning can improve
performance significantly. We also show how to select appropriate partitioning
parameters based on data statistics, in order to tune the algorithm for the
given join inputs. Our parallel implementation scales gracefully with the
number of threads reducing the cost of the join to at most one second even for
join inputs with tens of millions of rectangles.
","[{'version': 'v1', 'created': 'Fri, 30 Aug 2019 13:48:31 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Oct 2019 08:54:01 GMT'}]",2020-05-25,"[['Tsitsigkos', 'Dimitrios', ''], ['Bouros', 'Panagiotis', ''], ['Mamoulis', 'Nikos', ''], ['Terrovitis', 'Manolis', '']]","['Spatial join', 'in-memory data management', 'parallel processing', 'multi-core']"
5209,1804.07234,Anil Yaman,"Anil Yaman, Decebal Constantin Mocanu, Giovanni Iacca, George
  Fletcher, Mykola Pechenizkiy","Limited Evaluation Cooperative Co-evolutionary Differential Evolution
  for Large-scale Neuroevolution",,,10.1145/3205455.3205555,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many real-world control and classification tasks involve a large number of
features. When artificial neural networks (ANNs) are used for modeling these
tasks, the network architectures tend to be large. Neuroevolution is an
effective approach for optimizing ANNs; however, there are two bottlenecks that
make their application challenging in case of high-dimensional networks using
direct encoding. First, classic evolutionary algorithms tend not to scale well
for searching large parameter spaces; second, the network evaluation over a
large number of training instances is in general time-consuming. In this work,
we propose an approach called the Limited Evaluation Cooperative
Co-evolutionary Differential Evolution algorithm (LECCDE) to optimize
high-dimensional ANNs.
  The proposed method aims to optimize the pre-synaptic weights of each
post-synaptic neuron in different subpopulations using a Cooperative
Co-evolutionary Differential Evolution algorithm, and employs a limited
evaluation scheme where fitness evaluation is performed on a relatively small
number of training instances based on fitness inheritance. We test LECCDE on
three datasets with various sizes, and our results show that cooperative
co-evolution significantly improves the test error comparing to standard
Differential Evolution, while the limited evaluation scheme facilitates a
significant reduction in computing time.
","[{'version': 'v1', 'created': 'Thu, 19 Apr 2018 15:34:39 GMT'}, {'version': 'v2', 'created': 'Sun, 6 May 2018 20:07:24 GMT'}]",2018-05-08,"[['Yaman', 'Anil', ''], ['Mocanu', 'Decebal Constantin', ''], ['Iacca', 'Giovanni', ''], ['Fletcher', 'George', ''], ['Pechenizkiy', 'Mykola', '']]","['Neuroevolution', 'Direct encoding', 'Cooperative Co-evolution', 'Differential Evolution']"
5210,1511.02433,Andr\'e Rodrigues Valente,"Andr\'e Valente Rodrigues, Al\'ipio Jorge, In\^es Dutra",Accelerating Recommender Systems using GPUs,,"SAC '15 Proceedings of the 30th Annual ACM Symposium on Applied
  Computing Pages 879-884 ACM New York, NY, USA",10.1145/2695664.2695850,,cs.IR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe GPU implementations of the matrix recommender algorithms CCD++
and ALS. We compare the processing time and predictive ability of the GPU
implementations with existing multi-core versions of the same algorithms.
Results on the GPU are better than the results of the multi-core versions
(maximum speedup of 14.8).
","[{'version': 'v1', 'created': 'Sun, 8 Nov 2015 03:25:28 GMT'}]",2015-11-10,"[['Rodrigues', 'André Valente', ''], ['Jorge', 'Alípio', ''], ['Dutra', 'Inês', '']]","['Recommender Systems', 'Parallel Systems', 'NVIDIA CUDA']"
5211,2109.09349,Suhas Ranganath,"Suhas Ranganath, Shibsankar Das, Sanjay Thilaivasan, Shipra Agarwal,
  Varun Shrivastava",Grouping Search Results with Product Graphs in E-commerce Platforms,,"ACM Web Conference 2021,Knowledge Management in e-Commerce
  Workshop",,,cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Showing relevant search results to the user is the primary challenge for any
search system. Walmart e-commerce provides an omnichannel search platform to
its customers to search from millions of products. This search platform takes a
textual query as input and shows relevant items from the catalog. One of the
primary challenges is that this queries are complex to understand as it
contains multiple intent in many cases. This paper proposes a framework to
group search results into multiple ranked lists intending to provide better
user intent. The framework is to create a product graph having relations
between product entities and utilize it to group search results into a series
of stacks where each stack provides a group of items based on a precise intent.
As an example, for a query ""milk,"" the results can be grouped into multiple
stacks of ""white milk"", ""low-fat milk"", ""almond milk"", ""flavored milk"". We
measure the impact of our algorithm by evaluating how it improves the user
experience both in terms of search quality relevance and user behavioral
signals like Add-To-Cart.
","[{'version': 'v1', 'created': 'Mon, 20 Sep 2021 08:01:29 GMT'}]",2021-09-21,"[['Ranganath', 'Suhas', ''], ['Das', 'Shibsankar', ''], ['Thilaivasan', 'Sanjay', ''], ['Agarwal', 'Shipra', ''], ['Shrivastava', 'Varun', '']]","['E-commerce Search Engine', 'Product Graph', 'Grouping search results']"
5212,1805.08716,Meike Zehlike,Meike Zehlike and Carlos Castillo,Reducing Disparate Exposure in Ranking: A Learning To Rank Approach,7 pages,,10.1145/3366424.3383534,,cs.IR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ranked search results have become the main mechanism by which we find
content, products, places, and people online. Thus their ordering contributes
not only to the satisfaction of the searcher, but also to career and business
opportunities, educational placement, and even social success of those being
ranked. Researchers have become increasingly concerned with systematic biases
in data-driven ranking models, and various post-processing methods have been
proposed to mitigate discrimination and inequality of opportunity. This
approach, however, has the disadvantage that it still allows an unfair ranking
model to be trained. In this paper we explore a new in-processing approach:
DELTR, a learning-to-rank framework that addresses potential issues of
discrimination and unequal opportunity in rankings at training time. We measure
these problems in terms of discrepancies in the average group exposure and
design a ranker that optimizes search results in terms of relevance and in
terms of reducing such discrepancies. We perform an extensive experimental
study showing that being ""colorblind"" can be among the best or the worst
choices from the perspective of relevance and exposure, depending on how much
and which kind of bias is present in the training set. We show that our
in-processing method performs better in terms of relevance and exposure than a
pre-processing and a post-processing method across all tested scenarios.
","[{'version': 'v1', 'created': 'Tue, 22 May 2018 16:23:49 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Aug 2018 15:19:03 GMT'}, {'version': 'v3', 'created': 'Mon, 27 May 2019 16:03:00 GMT'}, {'version': 'v4', 'created': 'Tue, 28 May 2019 08:31:23 GMT'}, {'version': 'v5', 'created': 'Wed, 27 May 2020 17:49:06 GMT'}]",2020-05-28,"[['Zehlike', 'Meike', ''], ['Castillo', 'Carlos', '']]","['Ranking', 'Algorithmic Fairness', 'Disparate Impact']"
5213,1007.5136,Secretary  Ijaia,"Ming-Shing Hsieh (Aletheia University, Taiwan)","Perceptual Copyright Protection Using Multiresolution Wavelet-Based
  Watermarking And Fuzzy Logic","13 pages, 7 figures","International Journal of Artificial Intelligence & Applications
  1.3 (2010) 45-57",10.5121/ijaia.2010.1304,,cs.MM,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper, an efficiently DWT-based watermarking technique is proposed to
embed signatures in images to attest the owner identification and discourage
the unauthorized copying. This paper deals with a fuzzy inference filter to
choose the larger entropy of coefficients to embed watermarks. Unlike most
previous watermarking frameworks which embedded watermarks in the larger
coefficients of inner coarser subbands, the proposed technique is based on
utilizing a context model and fuzzy inference filter by embedding watermarks in
the larger-entropy coefficients of coarser DWT subbands. The proposed
approaches allow us to embed adaptive casting degree of watermarks for
transparency and robustness to the general image-processing attacks such as
smoothing, sharpening, and JPEG compression. The approach has no need the
original host image to extract watermarks. Our schemes have been shown to
provide very good results in both image transparency and robustness.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2010 07:41:51 GMT'}]",2010-07-30,"[['Hsieh', 'Ming-Shing', '', 'Aletheia University, Taiwan']]","['digital watermarking', 'discrete wavelet transform', 'fuzzy inference filter', 'adaptive quantization', 'entropy']"
5214,1502.03601,Kalyan Nagaraj,"Kalyan Nagaraj, Amulyashree Sridhar","A Predictive System for detection of Bankruptcy using Machine Learning
  techniques","11 pages, 7 figures","Kalyan Nagaraj, Amulyashree Sridhar (2015). A Predictive System
  for detection of Bankruptcy using Machine learning techniques. IJDKP. 5(1):
  29-40",10.5121/ijdkp.2015.5103,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bankruptcy is a legal procedure that claims a person or organization as a
debtor. It is essential to ascertain the risk of bankruptcy at initial stages
to prevent financial losses. In this perspective, different soft computing
techniques can be employed to ascertain bankruptcy. This study proposes a
bankruptcy prediction system to categorize the companies based on extent of
risk. The prediction system acts as a decision support tool for detection of
bankruptcy
  Keywords: Bankruptcy, soft computing, decision support tool
","[{'version': 'v1', 'created': 'Thu, 12 Feb 2015 11:07:51 GMT'}]",2015-02-13,"[['Nagaraj', 'Kalyan', ''], ['Sridhar', 'Amulyashree', '']]","['Bankruptcy', 'soft computing', 'decision support tool']"
5215,1901.07858,Bo Liu,"Bo Liu, Wenhao Chi, Xinran Li, Peng Li, Wenhua Liang, Haiping Liu, Wei
  Wang, Jianxing He","Evolving the pulmonary nodules diagnosis from classical approaches to
  deep learning aided decision support: three decades development course and
  future prospect","We have substantially revised the article. The previous version had
  74 pages and 2 figures, and the lateset version had 66 pages and 6 figures","Journal of Cancer Research and Clinical Oncology 146.1 (2020):
  153-185",10.1007/s00432-019-03098-5,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lung cancer is the commonest cause of cancer deaths worldwide, and its
mortality can be reduced significantly by performing early diagnosis and
screening. Since the 1960s, driven by the pressing needs to accurately and
effectively interpret the massive volume of chest images generated daily,
computer-assisted diagnosis of pulmonary nodule has opened up new opportunities
to relax the limitation from physicians' subjectivity, experiences and fatigue.
And the fair access to the reliable and affordable computer-assisted diagnosis
will fight the inequalities in incidence and mortality between populations. It
has been witnessed that significant and remarkable advances have been achieved
since the 1980s, and consistent endeavors have been exerted to deal with the
grand challenges on how to accurately detect the pulmonary nodules with high
sensitivity at low false-positives rate as well as on how to precisely
differentiate between benign and malignant nodules. There is a lack of
comprehensive examination of the techniques' development which is evolving the
pulmonary nodules diagnosis from classical approaches to machine
learning-assisted decision support. The main goal of this investigation is to
provide a comprehensive state-of-the-art review of the computer-assisted
nodules detection and benign-malignant classification techniques developed over
3 decades, which have evolved from the complicated ad hoc analysis pipeline of
conventional approaches to the simplified seamlessly integrated deep learning
techniques. This review also identifies challenges and highlights opportunities
for future work in learning models, learning algorithms and enhancement schemes
for bridging current state to future prospect and satisfying future demand.
","[{'version': 'v1', 'created': 'Wed, 23 Jan 2019 13:04:59 GMT'}, {'version': 'v2', 'created': 'Sat, 9 Feb 2019 05:54:34 GMT'}, {'version': 'v3', 'created': 'Fri, 24 Apr 2020 17:31:24 GMT'}]",2020-04-27,"[['Liu', 'Bo', ''], ['Chi', 'Wenhao', ''], ['Li', 'Xinran', ''], ['Li', 'Peng', ''], ['Liang', 'Wenhua', ''], ['Liu', 'Haiping', ''], ['Wang', 'Wei', ''], ['He', 'Jianxing', '']]","['Computer-aided diagnosis', 'Pulmonary nodules', 'Lung cancer', 'Deep learning', 'Artificial intelligence', 'Review']"
5216,1404.0807,Marco Guazzone,"Cosimo Anglano, Marco Guazzone, Matteo Sereno",Maximizing Profit in Green Cellular Networks through Collaborative Games,Added publisher info and citation notice,"Computer Networks Volume 75, Part A, 2014, Pages 260-275",10.1016/j.comnet.2014.10.003,,cs.GT cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we deal with the problem of maximizing the profit of Network
Operators (NOs) of green cellular networks in situations where
Quality-of-Service (QoS) guarantees must be ensured to users, and Base Stations
(BSs) can be shared among different operators. We show that if NOs cooperate
among them, by mutually sharing their users and BSs, then each one of them can
improve its net profit. By using a game-theoretic framework, we study the
problem of forming stable coalitions among NOs. Furthermore, we propose a
mathematical optimization model to allocate users to a set of BSs, in order to
reduce costs and, at the same time, to meet user QoS for NOs inside the same
coalition. Based on this, we propose an algorithm, based on cooperative game
theory, that enables each operator to decide with whom to cooperate in order to
maximize its profit. This algorithms adopts a distributed approach in which
each NO autonomously makes its own decisions, and where the best solution
arises without the need to synchronize them or to resort to a trusted third
party. The effectiveness of the proposed algorithm is demonstrated through a
thorough experimental evaluation considering real-world traffic traces, and a
set of realistic scenarios. The results we obtain indicate that our algorithm
allows a population of NOs to significantly improve their profits thanks to the
combination of energy reduction and satisfaction of QoS requirements.
","[{'version': 'v1', 'created': 'Thu, 3 Apr 2014 08:54:01 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Feb 2016 15:43:56 GMT'}]",2016-02-23,"[['Anglano', 'Cosimo', ''], ['Guazzone', 'Marco', ''], ['Sereno', 'Matteo', '']]","['Wireless Networks', 'Profit Maximization', 'Green Networking', 'CooperativeGame Theory', 'Coalition Formation']"
5217,1306.2843,Plamen Simeonov L.,Plamen L. Simeonov,On Some Recent Insights in Integral Biomathics,"24 pages, 0 figures. In Journal Progress in Biophysics and Molecular
  Biology, 2013","Progress in Biophysics and Molecular Biology, Vol. 113, Issues 1,
  2013, pp. 216-228",10.1016/j.pbiomolbio.2013.06.001,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper summarizes the results in Integral Biomathics obtained to this
moment and provides an outlook for future research in the field.
","[{'version': 'v1', 'created': 'Tue, 11 Jun 2013 05:45:57 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Jun 2013 12:54:48 GMT'}, {'version': 'v3', 'created': 'Sun, 23 Jun 2013 16:40:20 GMT'}]",2015-09-02,"[['Simeonov', 'Plamen L.', '']]","['Biomathematics; Challenges', 'Potentials', 'Category Theory', 'Memory Evolutive Systems', 'Relational Biology', 'Wandering Logic Intelligence']"
5218,2102.12124,Lei Zheng,"Lei Zheng, Rui Yang, Zhixuan Wu, Jiesen Pan, and Hui Cheng","Safe Learning-based Gradient-free Model Predictive Control Based on
  Cross-entropy Method","21 pages, 11 figures, Accepted for publication in Engineering
  Applications of Artificial Intelligence",,10.1016/j.engappai.2022.104731,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a safe and learning-based control framework for model
predictive control (MPC) is proposed to optimize nonlinear systems with a
non-differentiable objective function under uncertain environmental
disturbances. The control framework integrates a learning-based MPC with an
auxiliary controller in a way of minimal intervention. The learning-based MPC
augments the prior nominal model with incremental Gaussian Processes to learn
the uncertain disturbances. The cross-entropy method (CEM) is utilized as the
sampling-based optimizer for the MPC with a non-differentiable objective
function. A minimal intervention controller is devised with a control Lyapunov
function and a control barrier function to guide the sampling process and endow
the system with high probabilistic safety. The proposed algorithm shows a safe
and adaptive control performance on a simulated quadrotor in the tasks of
trajectory tracking and obstacle avoidance under uncertain wind disturbances.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2021 08:39:01 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Feb 2021 11:26:45 GMT'}, {'version': 'v3', 'created': 'Mon, 21 Feb 2022 00:12:25 GMT'}]",2022-02-22,"[['Zheng', 'Lei', ''], ['Yang', 'Rui', ''], ['Wu', 'Zhixuan', ''], ['Pan', 'Jiesen', ''], ['Cheng', 'Hui', '']]","['Model predictive control', 'learning-based control', 'cross-entropy method', 'minimal intervention controller']"
5219,1403.1618,Mohammad Mahmoodi Varnamkhasti,"Maryam Mahmoodi, Mohammad Mahmoodi Varnamkhasti",Design a Persian Automated Plagiarism Detector (AMZPPD),"3 pages, Published with International Journal of Engineering Trends
  and Technology (IJETT)Published with International Journal of Engineering
  Trends and Technology (IJETT)","International Journal of Engineering Trends and Technology(IJETT),
  V8(8),465-467 February 2014",10.14445/22315381/IJETT-V8P280,,cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Currently there are lots of plagiarism detection approaches. But few of them
implemented and adapted for Persian languages. In this paper, our work on
designing and implementation of a plagiarism detection system based on
pre-processing and NLP technics will be described. And the results of testing
on a corpus will be presented.
","[{'version': 'v1', 'created': 'Thu, 6 Mar 2014 22:57:29 GMT'}]",2014-03-10,"[['Mahmoodi', 'Maryam', ''], ['Varnamkhasti', 'Mohammad Mahmoodi', '']]","['External Plagiarism', 'Plagiarism', 'Copy detection', 'natural language processing', 'Artificial intelligence', 'Persian language']"
5220,1609.06638,Andrew Thompson,Andrew Thompson and Robert Calderbank,Compressive imaging using fast transform coding,,,10.1117/12.2239999,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose deterministic sampling strategies for compressive imaging based on
Delsarte-Goethals frames. We show that these sampling strategies result in
multi-scale measurements which can be related to the 2D Haar wavelet transform.
We demonstrate the effectiveness of our proposed strategies through numerical
experiments.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2016 17:05:24 GMT'}]",2017-02-01,"[['Thompson', 'Andrew', ''], ['Calderbank', 'Robert', '']]","['Compressive imaging', 'multi-scale representations', 'deterministic sampling', 'Delsarte-Goethals frames']"
5221,1901.04243,Lynsay Shepherd,"Calum C. Hall, Lynsay A. Shepherd, Natalie Coull",BlackWatch: Increasing Attack Awareness Within Web Applications,"19 pages, 8 figures",,10.3390/fi11020044,,cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web applications are relied upon by many for the services they provide. It is
essential that applications implement appropriate security measures to prevent
security incidents. Currently, web applications focus resources towards the
preventative side of security. Whilst prevention is an essential part of the
security process, developers must also implement a level of attack awareness
into their web applications. Being able to detect when an attack is occurring
provides applications with the ability to execute responses against malicious
users in an attempt to slow down or deter their attacks. This research seeks to
improve web application security by identifying malicious behaviour from within
the context of web applications using our tool BlackWatch. The tool is a
Python-based application which analyses suspicious events occurring within
client web applications, with the objective of identifying malicious patterns
of behaviour. Based on the results from a preliminary study, BlackWatch was
effective at detecting attacks from both authenticated, and unauthenticated
users. Furthermore, user tests with developers indicated BlackWatch was user
friendly, and was easy to integrate into existing applications. Future work
seeks to develop the BlackWatch solution further for public release.
","[{'version': 'v1', 'created': 'Mon, 14 Jan 2019 11:33:53 GMT'}]",2019-02-18,"[['Hall', 'Calum C.', ''], ['Shepherd', 'Lynsay A.', ''], ['Coull', 'Natalie', '']]","['web application firewall', 'intrusion prevention', 'software security', 'web application security', 'attack awareness', 'cyber security']"
5222,2102.05378,Fan Feng,"Qianying Chen, Fan Feng, Pengyu Lv, and Huiling Duan",Origami spring-inspired shape morphing for flexible robotics,,,10.1089/soro.2021.0030,,cs.RO cond-mat.soft,http://creativecommons.org/licenses/by/4.0/,"  Flexible robotics are capable of achieving various functionalities by shape
morphing, benefiting from their compliant bodies and reconfigurable structures.
Here we construct and study a class of origami springs generalized from the
known interleaved origami spring, as promising candidates for shape morphing in
flexible robotics. These springs are found to exhibit nonlinear stretch-twist
coupling and linear/nonlinear mechanical response in the compression/tension
region, analyzed by the demonstrated continuum mechanics models, experiments,
and finite element simulations. To improve the mechanical performance such as
the damage resistance, we establish an origami rigidization method by adding
additional creases to the spring system. Guided by the theoretical framework,
we experimentally realize three types of flexible robotics -- origami spring
ejectors, crawlers, and transformers. These robots show the desired
functionality and outstanding mechanical performance. The proposed concept of
origami-aided design is expected to pave the way to facilitate the diverse
shape morphing of flexible robotics.
","[{'version': 'v1', 'created': 'Wed, 10 Feb 2021 11:04:09 GMT'}, {'version': 'v2', 'created': 'Sun, 30 May 2021 13:46:14 GMT'}, {'version': 'v3', 'created': 'Thu, 3 Jun 2021 10:38:55 GMT'}]",2022-01-19,"[['Chen', 'Qianying', ''], ['Feng', 'Fan', ''], ['Lv', 'Pengyu', ''], ['Duan', 'Huiling', '']]","['shape morphing', 'origami springs', 'structural design', 'flexible robotics']"
5223,1907.10201,Jim Buchan,"Mali Senapathi, Jim Buchan and Hady Osman","DevOps Capabilities, Practices, and Challenges: Insights from a Case
  Study",,"Proceedings of the 22nd International Conference on Evaluation and
  Assessment in Software Engineering 2018 Vol. Part F137700 (pp. 57-67).
  Christchurch",10.1145/3210459.3210465,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  DevOps is a set of principles and practices to improve collaboration between
development and IT Operations. Against the backdrop of the growing adoption of
DevOps in a variety of software development domains, this paper describes
empirical research into factors influencing its implementation. It presents
findings of an in-depth exploratory case study that explored DevOps
implementation in a New Zealand product development organisation. The study
involved interviewing six experienced software engineers who continuously
monitored and reflected on the gradual implementation of DevOps principles and
practices. For this case study the use of DevOps practices led to significant
benefits, including increase in deployment frequency from about 30 releases a
month to an average of 120 releases per month, as well as improved natural
communication and collaboration between IT development and operations
personnel. We found that the support of a number of technological enablers,
such as implementing an automation pipeline and cross functional organisational
structures, were critical to delivering the expected benefits of DevOps.
","[{'version': 'v1', 'created': 'Wed, 24 Jul 2019 01:51:55 GMT'}]",2019-07-25,"[['Senapathi', 'Mali', ''], ['Buchan', 'Jim', ''], ['Osman', 'Hady', '']]","['DevOps enablers', 'practices, DevOps benefits', 'challenges']"
5224,1804.11091,Tom\'a\v{s} Masa\v{r}\'ik,"Tereza Klimo\v{s}ov\'a, Josef Mal\'ik, Tom\'a\v{s} Masa\v{r}\'ik, Jana
  Novotn\'a, Dani\""el Paulusma, Veronika Sl\'ivov\'a",Colouring $(P_r+P_s)$-Free Graphs,"20 pages, 6 figures. An extended abstract of this paper appeared in
  the proceedings of ISAAC 2018","Algorithmica 82(7), 1833-1858 (2020)",10.1007/s00453-020-00675-w,,cs.DS cs.CC,http://creativecommons.org/licenses/by-sa/4.0/,"  The $k$-Colouring problem is to decide if the vertices of a graph can be
coloured with at most $k$ colours for a fixed integer $k$ such that no two
adjacent vertices are coloured alike. If each vertex u must be assigned a
colour from a prescribed list $L(u) \subseteq \{1,\cdots, k\}$, then we obtain
the List $k$-Colouring problem. A graph $G$ is $H$-free if $G$ does not contain
$H$ as an induced subgraph. We continue an extensive study into the complexity
of these two problems for $H$-free graphs. The graph $P_r+P_s$ is the disjoint
union of the $r$-vertex path $P_r$ and the $s$-vertex path $P_s$. We prove that
List $3$-Colouring is polynomial-time solvable for $(P_2+P_5)$-free graphs and
for $(P_3+P_4)$-free graphs. Combining our results with known results yields
complete complexity classifications of $3$-Colouring and List $3$-Colouring on
$H$-free graphs for all graphs $H$ up to seven vertices.
","[{'version': 'v1', 'created': 'Mon, 30 Apr 2018 09:14:49 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Jun 2018 15:20:16 GMT'}, {'version': 'v3', 'created': 'Wed, 17 Mar 2021 01:26:35 GMT'}]",2021-03-18,"[['Klimošová', 'Tereza', ''], ['Malík', 'Josef', ''], ['Masařík', 'Tomáš', ''], ['Novotná', 'Jana', ''], ['Paulusma', 'Daniël', ''], ['Slívová', 'Veronika', '']]","['vertex colouring', 'H-free graph', 'linear forest']"
5225,1409.6679,AashihaPriyadarshni LakshmiKumar,Aashiha Priyadarshni.L,"Heterogeneous Multi core processors for improving the efficiency of
  Market basket analysis algorithm in data mining","4 pages, 2 figures, Published with International Journal of Computer
  Trends and Technology (IJCTT)","International Journal of Computer Trends and Technology (IJCTT)
  V15(1):16-19, Sep 2014. ISSN:2231-2803. www.ijcttjournal.org. Published by
  Seventh Sense Research Group",10.14445/22312803/IJCTT-V15P103,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Heterogeneous multi core processors can offer diverse computing capabilities.
The efficiency of Market Basket Analysis Algorithm can be improved with
heterogeneous multi core processors. Market basket analysis algorithm utilises
apriori algorithm and is one of the popular data mining algorithms which can
utilise Map/Reduce framework to perform analysis. The algorithm generates
association rules based on transactional data and Map/Reduce motivates to
redesign and convert the existing sequential algorithms for efficiency. Hadoop
is the parallel programming platform built on Hadoop Distributed File
Systems(HDFS) for Map/Reduce computation that process data as (key, value)
pairs. In Hadoop map/reduce, the sequential jobs are parallelised and the Job
Tracker assigns parallel tasks to the Task Tracker. Based on single threaded or
multithreaded parallel tasks in the task tracker, execution is carried out in
the appropriate cores. For this, a new scheduler called MB Scheduler can be
developed. Switching between the cores can be made static or dynamic. The use
of heterogeneous multi core processors optimizes processing capabilities and
power requirements for a processor and improves the performance of the system.
","[{'version': 'v1', 'created': 'Tue, 23 Sep 2014 17:44:59 GMT'}]",2014-09-24,"[['L', 'Aashiha Priyadarshni.', '']]","['Heterogeneous Multi core', 'Market Basket analysis', 'Map Reduce', 'Hadoop', 'HDFS', 'Schedule', 'MB Scheduler']"
5226,1904.00750,Qi Lin,"Qi Lin (1 and 2), Weitao Xu (1), Jun Liu (1), Abdelwahed Khamis (1 and
  2), Wen Hu (1 and 2), Mahbub Hassan (1 and 2), Aruna Seneviratne (1 and 2)
  ((1) UNSW Australia (2) Data61, CSIRO, Australia)",H2B: Heartbeat-based Secret Key Generation Using Piezo Vibration Sensors,,,10.1145/3302506.3310406,,cs.CR eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present Heartbeats-2-Bits (H2B), which is a system for securely pairing
wearable devices by generating a shared secret key from the skin vibrations
caused by heartbeat. This work is motivated by potential power saving
opportunity arising from the fact that heartbeat intervals can be detected
energy-efficiently using inexpensive and power-efficient piezo sensors, which
obviates the need to employ complex heartbeat monitors such as
Electrocardiogram or Photoplethysmogram. Indeed, our experiments show that
piezo sensors can measure heartbeat intervals on many different body locations
including chest, wrist, waist, neck and ankle. Unfortunately, we also discover
that the heartbeat interval signal captured by piezo vibration sensors has low
Signal-to-Noise Ratio (SNR) because they are not designed as precision
heartbeat monitors, which becomes the key challenge for H2B. To overcome this
problem, we first apply a quantile function-based quantization method to fully
extract the useful entropy from the noisy piezo measurements. We then propose a
novel Compressive Sensing-based reconciliation method to correct the high bit
mismatch rates between the two independently generated keys caused by low SNR.
We prototype H2B using off-the-shelf piezo sensors and evaluate its performance
on a dataset collected from different body positions of 23 participants. Our
results show that H2B has an overwhelming pairing success rate of 95.6%. We
also analyze and demonstrate H2B's robustness against three types of attacks.
Finally, our power measurements show that H2B is very power-efficient.
","[{'version': 'v1', 'created': 'Wed, 20 Feb 2019 02:59:47 GMT'}]",2019-04-02,"[['Lin', 'Qi', '', '1 and 2'], ['Xu', 'Weitao', '', 'UNSW Australia'], ['Liu', 'Jun', '', 'UNSW Australia'], ['Khamis', 'Abdelwahed', '', '1 and\n  2'], ['Hu', 'Wen', '', '1 and 2'], ['Hassan', 'Mahbub', '', '1 and 2'], ['Seneviratne', 'Aruna', '', '1 and 2']]","['Symmetric key generation', 'piezo vibration sensor', 'compressivesensing', 'heartbeat signal', 'interpulse interval']"
5227,0810.3484,Sebastien Verel,"Gabriela Ochoa, Marco Tomassini (ISI), S\'ebastien Verel (I3S),
  Christian Darabos (ISI)",A Study of NK Landscapes' Basins and Local Optima Networks,best paper nomination,"Genetic And Evolutionary Computation Conference, Atlanta :
  \'Etats-Unis d'Am\'erique (2008)",10.1145/1389095.1389204,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a network characterization of combinatorial fitness landscapes by
adapting the notion of inherent networks proposed for energy surfaces (Doye,
2002). We use the well-known family of $NK$ landscapes as an example. In our
case the inherent network is the graph where the vertices are all the local
maxima and edges mean basin adjacency between two maxima. We exhaustively
extract such networks on representative small NK landscape instances, and show
that they are 'small-worlds'. However, the maxima graphs are not random, since
their clustering coefficients are much larger than those of corresponding
random graphs. Furthermore, the degree distributions are close to exponential
instead of Poissonian. We also describe the nature of the basins of attraction
and their relationship with the local maxima network.
","[{'version': 'v1', 'created': 'Mon, 20 Oct 2008 08:06:40 GMT'}]",2008-10-21,"[['Ochoa', 'Gabriela', '', 'ISI'], ['Tomassini', 'Marco', '', 'ISI'], ['Verel', 'Sébastien', '', 'I3S'], ['Darabos', 'Christian', '', 'ISI']]","['Landscape Analysis', 'Network Analysis', 'Complex Networks', 'LocalOptima', 'NK Landscapes']"
5228,1804.02074,Mat\'u\v{s} Sul\'ir,"Mat\'u\v{s} Sul\'ir and Michaela Ba\v{c}\'ikov\'a and Sergej Chodarev
  and Jaroslav Porub\""an",Visual augmentation of source code editors: A systematic mapping study,,,10.1016/j.jvlc.2018.10.001,"Journal of Visual Languages and Computing (JVLC), Vol. 49, 2018, pp.
  46-59, Elsevier",cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Source code written in textual programming languages is typically edited in
integrated development environments or specialized code editors. These tools
often display various visual items, such as icons, color highlights or more
advanced graphical overlays directly in the main editable source code view. We
call such visualizations source code editor augmentation.
  In this paper, we present a first systematic mapping study of source code
editor augmentation tools and approaches. We manually reviewed the metadata of
5,553 articles published during the last twenty years in two phases -- keyword
search and references search. The result is a list of 103 relevant articles and
a taxonomy of source code editor augmentation tools with seven dimensions,
which we used to categorize the resulting list of the surveyed articles.
  We also provide the definition of the term source code editor augmentation,
along with a brief overview of historical development and augmentations
available in current industrial IDEs.
","[{'version': 'v1', 'created': 'Thu, 5 Apr 2018 22:34:32 GMT'}, {'version': 'v2', 'created': 'Sat, 10 Nov 2018 21:25:54 GMT'}]",2018-11-13,"[['Sulír', 'Matúš', ''], ['Bačíková', 'Michaela', ''], ['Chodarev', 'Sergej', ''], ['Porubän', 'Jaroslav', '']]","['source code editor augmentation', 'integrated development environment (IDE)', 'in situvisualization', 'systematic review', 'survey']"
5229,1703.01760,Yiteng Pan,"Yiteng Pan, Fazhi He, Haiping Yu","A Correlative Denoising Autoencoder to Model Social Influence for Top-N
  Recommender System",Accepted by Frontiers of Computer Science,,10.1007/s11704-019-8123-3,,cs.IR cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, there are numerous works been proposed to leverage the
techniques of deep learning to improve social-aware recommendation performance.
In most cases, it requires a larger number of data to train a robust deep
learning model, which contains a lot of parameters to fit training data.
However, both data of user ratings and social networks are facing critical
sparse problem, which makes it not easy to train a robust deep neural network
model. Towards this problem, we propose a novel Correlative Denoising
Autoencoder (CoDAE) method by taking correlations between users with multiple
roles into account to learn robust representations from sparse inputs of
ratings and social networks for recommendation. We develop the CoDAE model by
utilizing three separated autoencoders to learn user features with roles of
rater, truster and trustee, respectively. Especially, on account of that each
input unit of user vectors with roles of truster and trustee is corresponding
to a particular user, we propose to utilize shared parameters to learn common
information of the units that corresponding to same users. Moreover, we propose
a related regularization term to learn correlations between user features that
learnt by the three subnetworks of CoDAE model. We further conduct a series of
experiments to evaluate the proposed method on two public datasets for Top-N
recommendation task. The experimental results demonstrate that the proposed
model outperforms state-of-the-art algorithms on rank-sensitive metrics of MAP
and NDCG.
","[{'version': 'v1', 'created': 'Mon, 6 Mar 2017 08:35:58 GMT'}, {'version': 'v2', 'created': 'Mon, 8 May 2017 02:10:39 GMT'}, {'version': 'v3', 'created': 'Thu, 5 Dec 2019 06:26:13 GMT'}]",2019-12-06,"[['Pan', 'Yiteng', ''], ['He', 'Fazhi', ''], ['Yu', 'Haiping', '']]","['Social Network', 'Recommender System', 'De']"
5230,1707.08149,Marc Aubreville,"Marc Aubreville, Miguel Goncalves, Christian Knipfer, Nicolai Oetter,
  Tobias Wuerfl, Helmut Neumann, Florian Stelzle, Christopher Bohr and Andreas
  Maier","Patch-based Carcinoma Detection on Confocal Laser Endomicroscopy Images
  -- A Cross-Site Robustness Assessment","Erratum: In the previous version, the number of CLE sequences in the
  vocal folds data set was inadequately reported","Proceedings of BIOIMAGING 2018, ISBN: 978-989-758-278-3",10.5220/0006534700270034,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning technologies such as convolutional neural networks (CNN)
provide powerful methods for image recognition and have recently been employed
in the field of automated carcinoma detection in confocal laser endomicroscopy
(CLE) images. CLE is a (sub-)surface microscopic imaging technique that reaches
magnifications of up to 1000x and is thus suitable for in vivo structural
tissue analysis. In this work, we aim to evaluate the prospects of a priorly
developed deep learning-based algorithm targeted at the identification of oral
squamous cell carcinoma with regard to its generalization to further anatomic
locations of squamous cell carcinomas in the area of head and neck. We applied
the algorithm on images acquired from the vocal fold area of five patients with
histologically verified squamous cell carcinoma and presumably healthy control
images of the clinically normal contra-lateral vocal cord. We find that the
network trained on the oral cavity data reaches an accuracy of 89.45% and an
area-under-the-curve (AUC) value of 0.955, when applied on the vocal cords
data. Compared to the state of the art, we achieve very similar results, yet
with an algorithm that was trained on a completely disjunct data set.
Concatenating both data sets yielded further improvements in cross-validation
with an accuracy of 90.81% and AUC of 0.970. In this study, for the first time
to our knowledge, a deep learning mechanism for the identification of oral
carcinomas using CLE Images could be applied to other disciplines in the area
of head and neck. This study shows the prospect of the algorithmic approach to
generalize well on other malignant entities of the head and neck, regardless of
the anatomical location and furthermore in an examiner-independent manner.
","[{'version': 'v1', 'created': 'Tue, 25 Jul 2017 18:43:03 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Jan 2020 13:49:53 GMT'}]",2020-01-06,"[['Aubreville', 'Marc', ''], ['Goncalves', 'Miguel', ''], ['Knipfer', 'Christian', ''], ['Oetter', 'Nicolai', ''], ['Wuerfl', 'Tobias', ''], ['Neumann', 'Helmut', ''], ['Stelzle', 'Florian', ''], ['Bohr', 'Christopher', ''], ['Maier', 'Andreas', '']]","['automatic carcinoma detection', 'confocal laser endomicroscopy', 'deep convolutional networks', 'squamous cellcarcinoma']"
5231,1510.04472,Laura Natali,Laura Natali and Maria Luisa Merani,"Adaptive Streaming in P2P Live Video Systems: A Distributed Rate Control
  Approach","12 pages, 17 figures, this work has been submitted to the IEEE
  journal on selected Area in Communications",,10.1145/2912123,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dynamic Adaptive Streaming over HTTP (DASH) is a recently proposed standard
that offers different versions of the same media content to adapt the delivery
process over the Internet to dynamic bandwidth fluctuations and different user
device capabilities. The peer-to-peer (P2P) paradigm for video streaming allows
to leverage the cooperation among peers, guaranteeing to serve every video
request with increased scalability and reduced cost. We propose to combine
these two approaches in a P2P-DASH architecture, exploiting the potentiality of
both. The new platform is made of several swarms, and a different DASH
representation is streamed within each of them; unlike client-server DASH
architectures, where each client autonomously selects which version to download
according to current network conditions and to its device resources, we put
forth a new rate control strategy implemented at peer site to maintain a good
viewing quality to the local user and to simultaneously guarantee the
successful operation of the P2P swarms. The effectiveness of the solution is
demonstrated through simulation and it indicates that the P2P-DASH platform is
able to warrant its users a very good performance, much more satisfying than in
a conventional P2P environment where DASH is not employed. Through a comparison
with a reference DASH system modeled via the Integer Linear Programming (ILP)
approach, the new system is shown to outperform such reference architecture. To
further validate the proposal, both in terms of robustness and scalability,
system behavior is investigated in the critical condition of a flash crowd,
showing that the strong upsurge of new users can be successfully revealed and
gradually accommodated.
","[{'version': 'v1', 'created': 'Thu, 15 Oct 2015 11:13:24 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Oct 2015 08:52:37 GMT'}]",2016-11-17,"[['Natali', 'Laura', ''], ['Merani', 'Maria Luisa', '']]","['Adaptive streaming', 'DASH', 'peer-to-peer', 'flashcrowd', 'integer linear programming']"
5232,1907.08048,Andrea Cristofari,"Andrea Cristofari, Francesco Rinaldi, Francesco Tudisco","Total variation based community detection using a nonlinear optimization
  approach",,"SIAM Journal on Applied Mathematics, 80(3), 1392-1419 (2020)",10.1137/19M1270446,,cs.SI math.OC physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Maximizing the modularity of a network is a successful tool to identify an
important community of nodes. However, this combinatorial optimization problem
is known to be NP-complete. Inspired by recent nonlinear modularity eigenvector
approaches, we introduce the modularity total variation $TV_Q$ and show that
its box-constrained global maximum coincides with the maximum of the original
discrete modularity function. Thus we describe a new nonlinear optimization
approach to solve the equivalent problem leading to a community detection
strategy based on $TV_Q$. The proposed approach relies on the use of a fast
first-order method that embeds a tailored active-set strategy. We report
extensive numerical comparisons with standard matrix-based approaches and the
Generalized RatioDCA approach for nonlinear modularity eigenvectors, showing
that our new method compares favourably with state-of-the-art alternatives.
","[{'version': 'v1', 'created': 'Thu, 18 Jul 2019 13:48:07 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Aug 2019 08:20:28 GMT'}, {'version': 'v3', 'created': 'Fri, 5 Jun 2020 15:19:34 GMT'}]",2020-06-08,"[['Cristofari', 'Andrea', ''], ['Rinaldi', 'Francesco', ''], ['Tudisco', 'Francesco', '']]","['Community detection', 'Graph modularity', 'Total variation', 'Nonlinear optimization', 'Active-set method']"
5233,0910.5146,Maxim Raginsky,"Maxim Raginsky, Rebecca M. Willett, Zachary T. Harmany, Roummel F.
  Marcia",Compressed sensing performance bounds under Poisson noise,"12 pages, 3 pdf figures; accepted for publication in IEEE
  Transactions on Signal Processing",,10.1109/TSP.2010.2049997,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes performance bounds for compressed sensing (CS) where the
underlying sparse or compressible (sparsely approximable) signal is a vector of
nonnegative intensities whose measurements are corrupted by Poisson noise. In
this setting, standard CS techniques cannot be applied directly for several
reasons. First, the usual signal-independent and/or bounded noise models do not
apply to Poisson noise, which is non-additive and signal-dependent. Second, the
CS matrices typically considered are not feasible in real optical systems
because they do not adhere to important constraints, such as nonnegativity and
photon flux preservation. Third, the typical $\ell_2$--$\ell_1$ minimization
leads to overfitting in the high-intensity regions and oversmoothing in the
low-intensity areas. In this paper, we describe how a feasible positivity- and
flux-preserving sensing matrix can be constructed, and then analyze the
performance of a CS reconstruction approach for Poisson data that minimizes an
objective function consisting of a negative Poisson log likelihood term and a
penalty term which measures signal sparsity. We show that, as the overall
intensity of the underlying signal increases, an upper bound on the
reconstruction error decays at an appropriate rate (depending on the
compressibility of the signal), but that for a fixed signal intensity, the
signal-dependent part of the error bound actually grows with the number of
measurements or sensors. This surprising fact is both proved theoretically and
justified based on physical intuition.
","[{'version': 'v1', 'created': 'Tue, 27 Oct 2009 15:34:31 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Mar 2010 14:50:09 GMT'}, {'version': 'v3', 'created': 'Sat, 1 May 2010 22:44:36 GMT'}]",2015-05-14,"[['Raginsky', 'Maxim', ''], ['Willett', 'Rebecca M.', ''], ['Harmany', 'Zachary T.', ''], ['Marcia', 'Roummel F.', '']]","['complexity regularization', 'nonparametric estimation', 'sparsity', 'photon-limited imaging', 'compressive sampling']"
5234,1405.0109,Vaibhav Jha,"Vaibhav Jha, Mohit Jha, GK Sharma","Estimation of Optimized Energy and Latency Constraints for Task
  Allocation in 3d Network on Chip","20 Pages,17 Figure, International Journal of Computer Science &
  Information Technology. arXiv admin note: substantial text overlap with
  arXiv:1404.2512","International Journal of Computer Science & Information Technology
  Vol 6,No 2,pp 67-86 April 2014",10.5121/ijcsit.2014.6205,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Network on Chip (NoC) rooted system, energy consumption is affected by
task scheduling and allocation schemes which affect the performance of the
system. In this paper we test the pre-existing proposed algorithms and
introduced a new energy skilled algorithm for 3D NoC architecture. An efficient
dynamic and cluster approaches are proposed along with the optimization using
bio-inspired algorithm. The proposed algorithm has been implemented and
evaluated on randomly generated benchmark and real life application such as
MMS, Telecom and VOPD. The algorithm has also been tested with the E3S
benchmark and has been compared with the existing mapping algorithm spiral and
crinkle and has shown better reduction in the communication energy consumption
and shows improvement in the performance of the system. On performing
experimental analysis of proposed algorithm results shows that average
reduction in energy consumption is 49%, reduction in communication cost is 48%
and average latency is 34%. Cluster based approach is mapped onto NoC using
Dynamic Diagonal Mapping (DDMap), Crinkle and Spiral algorithms and found DDmap
provides improved result. On analysis and comparison of mapping of cluster
using DDmap approach the average energy reduction is 14% and 9% with crinkle
and spiral.
","[{'version': 'v1', 'created': 'Thu, 1 May 2014 07:38:46 GMT'}]",2014-05-02,"[['Jha', 'Vaibhav', ''], ['Jha', 'Mohit', ''], ['Sharma', 'GK', '']]","['Network on Chip', 'Mapping', '3D Architecture', 'System on Chip', 'Optimization']"
5235,2102.07810,Baoyu Jing,"Baoyu Jing, Chanyoung Park, Hanghang Tong",HDMI: High-order Deep Multiplex Infomax,Accepted by WWW'2021 Updated section 3.1.1,,10.1145/3442381.3449971,,cs.LG cs.IT cs.SI math.IT,http://creativecommons.org/licenses/by/4.0/,"  Networks have been widely used to represent the relations between objects
such as academic networks and social networks, and learning embedding for
networks has thus garnered plenty of research attention. Self-supervised
network representation learning aims at extracting node embedding without
external supervision. Recently, maximizing the mutual information between the
local node embedding and the global summary (e.g. Deep Graph Infomax, or DGI
for short) has shown promising results on many downstream tasks such as node
classification. However, there are two major limitations of DGI. Firstly, DGI
merely considers the extrinsic supervision signal (i.e., the mutual information
between node embedding and global summary) while ignores the intrinsic signal
(i.e., the mutual dependence between node embedding and node attributes).
Secondly, nodes in a real-world network are usually connected by multiple edges
with different relations, while DGI does not fully explore the various
relations among nodes. To address the above-mentioned problems, we propose a
novel framework, called High-order Deep Multiplex Infomax (HDMI), for learning
node embedding on multiplex networks in a self-supervised way. To be more
specific, we first design a joint supervision signal containing both extrinsic
and intrinsic mutual information by high-order mutual information, and we
propose a High-order Deep Infomax (HDI) to optimize the proposed supervision
signal. Then we propose an attention based fusion module to combine node
embedding from different layers of the multiplex network. Finally, we evaluate
the proposed HDMI on various downstream tasks such as unsupervised clustering
and supervised classification. The experimental results show that HDMI achieves
state-of-the-art performance on these tasks.
","[{'version': 'v1', 'created': 'Mon, 15 Feb 2021 19:30:04 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Feb 2021 16:19:42 GMT'}, {'version': 'v3', 'created': 'Thu, 25 Mar 2021 15:40:18 GMT'}, {'version': 'v4', 'created': 'Tue, 22 Jun 2021 15:41:03 GMT'}, {'version': 'v5', 'created': 'Tue, 29 Jun 2021 17:58:03 GMT'}]",2021-06-30,"[['Jing', 'Baoyu', ''], ['Park', 'Chanyoung', ''], ['Tong', 'Hanghang', '']]","['Network Representation Learning', 'Multiplex Networks', 'High-orderMutual Information']"
5236,1003.3311,Secretary Aircc Journal,"Ahmad Saad Al-Mogren (King Saud University, Saudi Arabia)","A Powerful Optimization Approach for the Multi Channel Dissemination
  Networks","9 Pages, IJCNC Journal 2010","International Journal of Computer Networks & Communications 2.2
  (2010) 132-140",10.5121/ijcnc.2010.2210,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In the wireless environment, dissemination techniques may improve data access
for the users. In this paper, we show a description of dissemination
architecture that fits the overall telecommunication network. This architecture
is designed to provide efficient data access and power saving for the mobile
units. A concurrency control approach, MCD, is suggested for data consistency
and conflict checking. A performance study shows that the power consumption,
space overhead, and response time associated with MCD is far less than other
previous techniques.
","[{'version': 'v1', 'created': 'Wed, 17 Mar 2010 07:04:59 GMT'}]",2010-07-15,"[['Al-Mogren', 'Ahmad Saad', '', 'King Saud University, Saudi Arabia']]","['Data Retrieval', 'Wireless Network', 'Concurrency Control', 'Mobility & Dissemination Systems']"
5237,1706.05402,Ikuesan R. Adeyemi Mr.,"Ikuesan Richard Adeyemi, Shukor Abd Razak, Mazleena Salleh",A Conceptual Model for Holistic Classification of Insider,,"Asian J. Applied Sci., 7: 343-359 (2014)",10.3923/ajaps.2014.343.359,,cs.CY stat.AP,http://creativecommons.org/publicdomain/zero/1.0/,"  The process through which an insider to an organization can be described or
classified is lined within the orthodox paradigm of classification in which an
organization considers only subject with requisite employee criterion as an
insider to that organization. This is further clouded with the relative
rigidity in operational security policies being implemented in organizations.
Establishing investigation process in instances of misuse occurrence and or
ascertaining the efficiency of staff member using such archaic paradigm is
maligned with endless possibilities of uncertainties. This study, therefore,
proposes a holistic model for which insider classification can be crystallized
using the combination of qualitative research process and analysis of moment
structure evaluation process. A full comprehension of this proposition could
serve as a hinge through which insider misuse investigation can be thoroughly
carried out. In addition, integrating this paradigm into existing operational
security policies could serve as a metric upon which an organization can
understand insider dynamics, in order to prevent misuses, and enhance staff
management.
","[{'version': 'v1', 'created': 'Fri, 16 Jun 2017 18:38:37 GMT'}]",2017-06-20,"[['Adeyemi', 'Ikuesan Richard', ''], ['Razak', 'Shukor Abd', ''], ['Salleh', 'Mazleena', '']]","['Insider distinction', 'insider investigation', 'subject-object relationship', 'dynamicinsider', 'organization-employee']"
5238,1402.2144,Mohammed Abufouda,Mohammed Abufouda,"A Framework for Enhancing Performance and Handling Run-Time Uncertainty
  in Self-Adaptive Systems",,"International Journal of Software Engineering & Applications
  (IJSEA), Vol.5, No.1, January 2014",10.5121/ijsea.2014.5106,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-adaptivity allows software systems to autonomously adjust their behavior
during run-time to reduce the cost complexities caused by manual maintenance.
In this paper, a framework for building an external adaptation engine for
self-adaptive software systems is proposed. In order to improve the quality of
self-adaptive software systems, this research addresses two challenges in
self-adaptive software systems. The first challenge is to provide better
performance of the adaptation engine by managing the complexity of the
adaptation space efficiently and the second challenge is handling run-time
uncertainty that hinders the adaptation process. This research utilizes
Case-based Reasoning as an adaptation engine along with utility functions for
realizing the managed system's requirements.
","[{'version': 'v1', 'created': 'Mon, 10 Feb 2014 13:49:53 GMT'}]",2014-02-11,"[['Abufouda', 'Mohammed', '']]","['Software Quality', 'Model-Driven Software', 'Self-adaptive Software Systems', 'Case-based Reasoning', 'Run-time Uncertainty']"
5239,1901.07408,Miroslav Kulich,"Estefan\'ia Pereyra, Gast\'on Aragu\'as, Miroslav Kulich",Path Planning for a Formation of Mobile Robots with Split and Merge,,Modelling and Simulation for Autonomous Systems. MESAS 2017,10.1007/978-3-319-76072-8_4,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel multi-robot path planning approach is presented in this paper. Based
on the standard Dijkstra, the algorithm looks for the optimal paths for a
formation of robots, taking into account the possibility of split and merge.
The algorithm explores a graph representation of the environment, computing for
each node the cost of moving a number of robots and their corresponding paths.
In every node where the formation can split, all the new possible formation
subdivisions are taken into account accordingly to their individual costs. In
the same way, in every node where the formation can merge, the algorithm
verifies whether the combination is possible and, if possible, computes the new
cost. In order to manage split and merge situations, a set of constraints is
applied. The proposed algorithm is thus deterministic, complete and finds an
optimal solution from a source node to all other nodes in the graph. The
presented solution is general enough to be incorporated into high-level tasks
as well as it can benefit from state-of-the-art formation motion planning
approaches, which can be used for evaluation of edges of an input graph. The
presented experimental results demonstrate the ability of the method to find
the optimal solution for a formation of robots in environments with varying
complexity.
","[{'version': 'v1', 'created': 'Tue, 22 Jan 2019 15:22:12 GMT'}]",2019-01-23,"[['Pereyra', 'Estefanía', ''], ['Araguás', 'Gastón', ''], ['Kulich', 'Miroslav', '']]","['MPP', 'multi-robot', 'planning', 'dijkstra', 'voronoi', 'graph']"
5240,1006.1183,Koushik Majumder,"Koushik Majumder (1) and Subir Kumar Sarkar (2), ((1) West Bengal
  University of Technology, India, (2) Jadavpur University, India)",Hybrid Scenario Based Performance Analysis of DSDV and DSR,15 Pages,"International Journal of Computer Science and Information
  Technology 2.3 (2010) 56-70",10.5121/ijcsit.2010.2305,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The area of mobile ad hoc networking has received considerable attention of
the research community in recent years. These networks have gained immense
popularity primarily due to their infrastructure-less mode of operation which
makes them a suitable candidate for deployment in emergency scenarios like
relief operation, battlefield etc., where either the pre-existing
infrastructure is totally damaged or it is not possible to establish a new
infrastructure quickly. However, MANETs are constrained due to the limited
transmission range of the mobile nodes which reduces the total coverage area.
Sometimes the infrastructure-less ad hoc network may be combined with a fixed
network to form a hybrid network which can cover a wider area with the
advantage of having less fixed infrastructure. In such a combined network, for
transferring data, we need base stations which act as gateways between the
wired and wireless domains. Due to the hybrid nature of these networks, routing
is considered a challenging task. Several routing protocols have been proposed
and tested under various traffic conditions. However, the simulations of such
routing protocols usually do not consider the hybrid network scenario. In this
work we have carried out a systematic performance study of the two prominent
routing protocols: Destination Sequenced Distance Vector Routing (DSDV) and
Dynamic Source Routing (DSR) protocols in the hybrid networking environment. We
have analyzed the performance differentials on the basis of three metrics -
packet delivery fraction, average end-to-end delay and normalized routing load
under varying pause time with different number of sources using NS2 based
simulation.
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2010 06:42:06 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Jun 2010 08:29:29 GMT'}]",2010-08-10,"[['Majumder', 'Koushik', ''], ['Sarkar', 'Subir Kumar', '']]","['Mobile Ad Hoc Network', 'Routing Protocols', 'Hybrid Network', 'Performance Study', 'Packet Delivery Fraction', 'Average End-to-End delay', 'Normalized Routing Load']"
5241,1802.09026,Xiaoxiang Zhu,"Jian Kang, Marco K\""orner, Yuanyuan Wang, Hannes Taubenb\""ock, Xiao
  Xiang Zhu",Building Instance Classification Using Street View Images,,,10.1016/j.isprsjprs.2018.02.006,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Land-use classification based on spaceborne or aerial remote sensing images
has been extensively studied over the past decades. Such classification is
usually a patch-wise or pixel-wise labeling over the whole image. But for many
applications, such as urban population density mapping or urban utility
planning, a classification map based on individual buildings is much more
informative. However, such semantic classification still poses some fundamental
challenges, for example, how to retrieve fine boundaries of individual
buildings. In this paper, we proposed a general framework for classifying the
functionality of individual buildings. The proposed method is based on
Convolutional Neural Networks (CNNs) which classify facade structures from
street view images, such as Google StreetView, in addition to remote sensing
images which usually only show roof structures. Geographic information was
utilized to mask out individual buildings, and to associate the corresponding
street view images. We created a benchmark dataset which was used for training
and evaluating CNNs. In addition, the method was applied to generate building
classification maps on both region and city scales of several cities in Canada
and the US. Keywords: CNN, Building instance classification, Street view
images, OpenStreetMap
","[{'version': 'v1', 'created': 'Sun, 25 Feb 2018 16:04:34 GMT'}]",2018-02-27,"[['Kang', 'Jian', ''], ['Körner', 'Marco', ''], ['Wang', 'Yuanyuan', ''], ['Taubenböck', 'Hannes', ''], ['Zhu', 'Xiao Xiang', '']]","['CNN', 'Building instance classification', 'Street view images', 'OpenStreetMap']"
5242,1908.00205,Emma Xue,"Shan Xue, Jie Lu, Guangquan Zhang",Cross-domain Network Representations,,Pattern Recognition 94 (2019): 135-148,10.1016/j.patcog.2019.05.009,,cs.SI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of network representation is to learn a set of latent features by
obtaining community information from network structures to provide knowledge
for machine learning tasks. Recent research has driven significant progress in
network representation by employing random walks as the network sampling
strategy. Nevertheless, existing approaches rely on domain-specifically rich
community structures and fail in the network that lack topological information
in its own domain. In this paper, we propose a novel algorithm for cross-domain
network representation, named as CDNR. By generating the random walks from a
structural rich domain and transferring the knowledge on the random walks
across domains, it enables a network representation for the structural scarce
domain as well. To be specific, CDNR is realized by a cross-domain two-layer
node-scale balance algorithm and a cross-domain two-layer knowledge transfer
algorithm in the framework of cross-domain two-layer random walk learning.
Experiments on various real-world datasets demonstrate the effectiveness of
CDNR for universal networks in an unsupervised way.
","[{'version': 'v1', 'created': 'Thu, 1 Aug 2019 04:32:15 GMT'}]",2019-08-02,"[['Xue', 'Shan', ''], ['Lu', 'Jie', ''], ['Zhang', 'Guangquan', '']]","['network representation', 'transfer learning', 'random walk', 'information network', 'unsupervised learning', 'feature learning']"
5243,1008.3798,Tom Kelsey,"Thomas W Kelsey, Benedicta Caserta, Luis Castillo, W Hamish B Wallace
  and Francisco C\'oppola Gonz\'alvez","Proliferating cell nuclear antigen (PCNA) allows the automatic
  identification of follicles in microscopic images of human ovarian tissue",,Pathology and Laboratory Medicine International 2010:2; 99-105,10.2147/PLMI.S11116,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human ovarian reserve is defined by the population of nongrowing follicles
(NGFs) in the ovary. Direct estimation of ovarian reserve involves the
identification of NGFs in prepared ovarian tissue. Previous studies involving
human tissue have used hematoxylin and eosin (HE) stain, with NGF populations
estimated by human examination either of tissue under a microscope, or of
images taken of this tissue. In this study we replaced HE with proliferating
cell nuclear antigen (PCNA), and automated the identification and enumeration
of NGFs that appear in the resulting microscopic images. We compared the
automated estimates to those obtained by human experts, with the ""gold
standard"" taken to be the average of the conservative and liberal estimates by
three human experts. The automated estimates were within 10% of the ""gold
standard"", for images at both 100x and 200x magnifications. Automated analysis
took longer than human analysis for several hundred images, not allowing for
breaks from analysis needed by humans. Our results both replicate and improve
on those of previous studies involving rodent ovaries, and demonstrate the
viability of large-scale studies of human ovarian reserve using a combination
of immunohistochemistry and computational image analysis techniques.
","[{'version': 'v1', 'created': 'Mon, 23 Aug 2010 11:37:43 GMT'}]",2010-08-24,"[['Kelsey', 'Thomas W', ''], ['Caserta', 'Benedicta', ''], ['Castillo', 'Luis', ''], ['Wallace', 'W Hamish B', ''], ['Gonzálvez', 'Francisco Cóppola', '']]","['histology', 'feature detection', 'ovarian reserve', 'immunohistochemistry', 'biological clock']"
5244,1809.02435,Ali Parsai,Ali Parsai and Serge Demeyer,Dynamic Mutant Subsumption Analysis using LittleDarwin,,"Proceedings of the 8th ACM SIGSOFT International Workshop on
  Automated Software Testing. ACM, 2017",10.1145/3121245.3121249,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many academic studies in the field of software testing rely on mutation
testing to use as their comparison criteria. However, recent studies have shown
that redundant mutants have a significant effect on the accuracy of their
results. One solution to this problem is to use mutant subsumption to detect
redundant mutants. Therefore, in order to facilitate research in this field, a
mutation testing tool that is capable of detecting redundant mutants is needed.
In this paper, we describe how we improved our tool, LittleDarwin, to fulfill
this requirement.
","[{'version': 'v1', 'created': 'Fri, 7 Sep 2018 12:22:51 GMT'}]",2018-09-10,"[['Parsai', 'Ali', ''], ['Demeyer', 'Serge', '']]","['Software Testing', 'Mutation Testing', 'Mutant Subsumption', 'DynamicMutant Subsumption']"
5245,1509.04098,Stefano Cresci,"Stefano Cresci, Roberto Di Pietro, Marinella Petrocchi, Angelo
  Spognardi, Maurizio Tesconi",Fame for sale: efficient detection of fake Twitter followers,,"Decision Support Systems, 80, 56-71, 2015",10.1016/j.dss.2015.09.003,,cs.SI cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  $\textit{Fake followers}$ are those Twitter accounts specifically created to
inflate the number of followers of a target account. Fake followers are
dangerous for the social platform and beyond, since they may alter concepts
like popularity and influence in the Twittersphere - hence impacting on
economy, politics, and society. In this paper, we contribute along different
dimensions. First, we review some of the most relevant existing features and
rules (proposed by Academia and Media) for anomalous Twitter accounts
detection. Second, we create a baseline dataset of verified human and fake
follower accounts. Such baseline dataset is publicly available to the
scientific community. Then, we exploit the baseline dataset to train a set of
machine-learning classifiers built over the reviewed rules and features. Our
results show that most of the rules proposed by Media provide unsatisfactory
performance in revealing fake followers, while features proposed in the past by
Academia for spam detection provide good results. Building on the most
promising features, we revise the classifiers both in terms of reduction of
overfitting and cost for gathering the data needed to compute the features. The
final result is a novel $\textit{Class A}$ classifier, general enough to thwart
overfitting, lightweight thanks to the usage of the less costly features, and
still able to correctly classify more than 95% of the accounts of the original
training set. We ultimately perform an information fusion-based sensitivity
analysis, to assess the global sensitivity of each of the features employed by
the classifier. The findings reported in this paper, other than being supported
by a thorough experimental methodology and interesting on their own, also pave
the way for further investigation on the novel issue of fake Twitter followers.
","[{'version': 'v1', 'created': 'Mon, 14 Sep 2015 13:59:11 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Nov 2015 17:31:40 GMT'}]",2020-06-29,"[['Cresci', 'Stefano', ''], ['Di Pietro', 'Roberto', ''], ['Petrocchi', 'Marinella', ''], ['Spognardi', 'Angelo', ''], ['Tesconi', 'Maurizio', '']]","['Twitter', 'fake followers', 'anomalous account detection', 'baseline dataset', 'machine learning']"
5246,1812.10961,Sergey Belim,"S.V. Belim, N.F. Bogachenko, A.N. Kabanov",A Precedent Approach to Assigning Access Rights,,,10.1088/1742-6596/1210/1/012010,,cs.CR cs.AI cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To design a discretionary access control policy, a technique is proposed that
uses the principle of analogies and is based on both the properties of objects
and the properties of subjects. As attributes characterizing these properties,
the values of the security attributes of subjects and objects are chosen. The
concept of precedent is defined as an access rule explicitly specified by the
security administrator. The problem of interpolation of the access matrix is
formulated: the security administrator defines a sequence of precedents, it is
required to automate the process of filling the remaining cells of the access
matrix. On the family of sets of security attributes, a linear order is
introduced. The principles of filling the access matrix on the basis of analogy
with the dominant precedent in accordance with a given order relation are
developed. The analysis of the proposed methodology is performed and its main
advantages are revealed.
","[{'version': 'v1', 'created': 'Fri, 28 Dec 2018 11:51:14 GMT'}]",2019-05-22,"[['Belim', 'S. V.', ''], ['Bogachenko', 'N. F.', ''], ['Kabanov', 'A. N.', '']]","['security model', 'discretionary access control', 'case based access control', 'discre']"
5247,1805.11877,Carl Witt,"Carl Witt, Marc Bux, Wladislaw Gusew, Ulf Leser","Predictive Performance Modeling for Distributed Computing using
  Black-Box Monitoring and Machine Learning","19 pages, 3 figures, 5 tables",Information Systems 2019,10.1016/j.is.2019.01.006,,cs.DC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many domains, the previous decade was characterized by increasing data
volumes and growing complexity of computational workloads, creating new demands
for highly data-parallel computing in distributed systems. Effective operation
of these systems is challenging when facing uncertainties about the performance
of jobs and tasks under varying resource configurations, e.g., for scheduling
and resource allocation. We survey predictive performance modeling (PPM)
approaches to estimate performance metrics such as execution duration, required
memory or wait times of future jobs and tasks based on past performance
observations. We focus on non-intrusive methods, i.e., methods that can be
applied to any workload without modification, since the workload is usually a
black-box from the perspective of the systems managing the computational
infrastructure. We classify and compare sources of performance variation,
predicted performance metrics, required training data, use cases, and the
underlying prediction techniques. We conclude by identifying several open
problems and pressing research needs in the field.
","[{'version': 'v1', 'created': 'Wed, 30 May 2018 09:24:08 GMT'}]",2019-01-25,"[['Witt', 'Carl', ''], ['Bux', 'Marc', ''], ['Gusew', 'Wladislaw', ''], ['Leser', 'Ulf', '']]","['Distributed Computing', 'Resource Management', 'Machine Learning', 'Black-Box Monitoring']"
5248,1907.08176,Tiantian Gao,"Tiantian Gao, Paul Fodor, Michael Kifer",Querying Knowledge via Multi-Hop English Questions,"Paper presented at the 35th International Conference on Logic
  Programming (ICLP 2019), Las Cruces, New Mexico, USA, 20-25 September 2019,
  16 pages",Theory and Practice of Logic Programming 19 (2019) 636-653,10.1017/S1471068419000103,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The inherent difficulty of knowledge specification and the lack of trained
specialists are some of the key obstacles on the way to making intelligent
systems based on the knowledge representation and reasoning (KRR) paradigm
commonplace. Knowledge and query authoring using natural language, especially
controlled natural language (CNL), is one of the promising approaches that
could enable domain experts, who are not trained logicians, to both create
formal knowledge and query it. In previous work, we introduced the KALM system
(Knowledge Authoring Logic Machine) that supports knowledge authoring (and
simple querying) with very high accuracy that at present is unachievable via
machine learning approaches. The present paper expands on the question
answering aspect of KALM and introduces KALM-QA (KALM for Question Answering)
that is capable of answering much more complex English questions. We show that
KALM-QA achieves 100% accuracy on an extensive suite of movie-related
questions, called MetaQA, which contains almost 29,000 test questions and over
260,000 training questions. We contrast this with a published machine learning
approach, which falls far short of this high mark.
","[{'version': 'v1', 'created': 'Thu, 18 Jul 2019 17:37:13 GMT'}]",2020-02-19,"[['Gao', 'Tiantian', ''], ['Fodor', 'Paul', ''], ['Kifer', 'Michael', '']]","['Controlled Natural Language', 'Knowledge Representation', 'Reasoning', 'Question Answering']"
5249,1804.03518,Jocelyn Simmonds,"Jocelyn Simmonds, Ma\'ira Marques Samary, Milenko Tomic, Francisco
  Madrid, Constanza Escobar","Software Engineering for Millennials, by Millennials","8 pages, 9 tables, 4 figures, Second International Workshop on
  Software Engineering Education for Millennials",,10.1145/3194779.3194787,,cs.CY cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software engineers need to manage both technical and professional skills in
order to be successful. Our university offers a 5.5 year program that mixes
computer science, software and computer engineering, where the first two years
are mostly math and physics courses. As such, our students' first real teamwork
experience is during the introductory SE course, where they modify open source
projects in groups of 6-8. However, students have problems working in such
large teams, and feel that the course material and project are ""disconnected"".
We decided to redesign this course in 2017, trying to achieve a balance between
theory and practice, and technical and professional skills, with a maximum
course workload of 150 hrs per semester. We share our experience in this paper,
discussing the strategies we used to improve teamwork and help students learn
new technologies in a more autonomous manner. We also discuss what we learned
from the two times we taught the new course.
","[{'version': 'v1', 'created': 'Thu, 5 Apr 2018 17:16:59 GMT'}]",2018-04-11,"[['Simmonds', 'Jocelyn', ''], ['Samary', 'Maíra Marques', ''], ['Tomic', 'Milenko', ''], ['Madrid', 'Francisco', ''], ['Escobar', 'Constanza', '']]","['Project and problem-based learning', 'peer evaluation', 'gender']"
5250,1409.8174,Mark Scanlon,"Jason Farina, Mark Scanlon, M-Tahar Kechadi",BitTorrent Sync: First Impressions and Digital Forensic Implications,Proc. of Digtial Forensics Research Workshop (DFRWS EU 2014),"Digital Investigation, Volume 11, Supplement 1, Pages S77-S86,
  (2014)",10.1016/j.diin.2014.03.010,,cs.CR cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  With professional and home Internet users becoming increasingly concerned
with data protection and privacy, the privacy afforded by popular cloud file
synchronisation services, such as Dropbox, OneDrive and Google Drive, is coming
under scrutiny in the press. A number of these services have recently been
reported as sharing information with governmental security agencies without
warrants. BitTorrent Sync is seen as an alternative by many and has gathered
over two million users by December 2013 (doubling since the previous month).
The service is completely decentralised, offers much of the same
synchronisation functionality of cloud powered services and utilises encryption
for data transmission (and optionally for remote storage). The importance of
understanding BitTorrent Sync and its resulting digital investigative
implications for law enforcement and forensic investigators will be paramount
to future investigations. This paper outlines the client application, its
detected network traffic and identifies artefacts that may be of value as
evidence for future digital investigations.
","[{'version': 'v1', 'created': 'Mon, 29 Sep 2014 16:20:57 GMT'}]",2014-09-30,"[['Farina', 'Jason', ''], ['Scanlon', 'Mark', ''], ['Kechadi', 'M-Tahar', '']]","['BitTorrent', 'Sync', 'Peer-to-Peer', 'Synchronisation', 'Privacy', 'Digital Forensics']"
5251,1505.05425,Christian Jacobs,"Christian T. Jacobs, Gerard J. Gorman, Huw E. Rees, Lorraine Craig","Experiences with efficient methodologies for teaching computer
  programming to geoscientists","Second revised version. This version was accepted for publication in
  the Journal of Geoscience Education on 9 June 2016. Contains 5 figures. The
  main change is the inclusion of a new section on outlook and future work","Journal of Geoscience Education 64(3):183-198, 2016",10.5408/15-101.1,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer programming was once thought of as a skill required only by
professional software developers. But today, given the ubiquitous nature of
computation and data science it is quickly becoming necessary for all
scientists and engineers to have at least a basic knowledge of how to program.
Teaching how to program, particularly to those students with little or no
computing background, is well-known to be a difficult task. However, there is
also a wealth of evidence-based teaching practices for teaching programming
skills which can be applied to greatly improve learning outcomes and the
student experience. Adopting these practices naturally gives rise to greater
learning efficiency - this is critical if programming is to be integrated into
an already busy geoscience curriculum. This paper considers an undergraduate
computer programming course, run during the last 5 years in the Department of
Earth Science and Engineering at Imperial College London. The teaching
methodologies that were used each year are discussed alongside the challenges
that were encountered, and how the methodologies affected student performance.
Anonymised student marks and feedback are used to highlight this, and also how
the adjustments made to the course eventually resulted in a highly effective
learning environment.
","[{'version': 'v1', 'created': 'Wed, 20 May 2015 15:40:02 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Jan 2016 02:35:53 GMT'}, {'version': 'v3', 'created': 'Thu, 9 Jun 2016 20:11:14 GMT'}]",2016-08-23,"[['Jacobs', 'Christian T.', ''], ['Gorman', 'Gerard J.', ''], ['Rees', 'Huw E.', ''], ['Craig', 'Lorraine', '']]","['computer programming', 'undergraduate', 'teaching methodology', 'feedback']"
5252,1903.09905,Tim Smith,Tim Smith,A Characterization of Morphic Words with Polynomial Growth,,"Discrete Mathematics & Theoretical Computer Science, vol. 22 no.
  1, Automata, Logic and Semantics (February 6, 2020) dmtcs:6073",10.23638/DMTCS-22-1-3,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A morphic word is obtained by iterating a morphism to generate an infinite
word, and then applying a coding. We characterize morphic words with polynomial
growth in terms of a new type of infinite word called a $\textit{zigzag word}$.
A zigzag word is represented by an initial string, followed by a finite list of
terms, each of which repeats for each $n \geq 1$ in one of three ways: it grows
forward [$t(1)\ t(2)\ \dotsm\ t(n)]$, backward [$t(n)\ \dotsm\ t(2)\ t(1)$], or
just occurs once [$t$]. Each term can recursively contain subterms with their
own forward and backward repetitions. We show that an infinite word is morphic
with growth $\Theta(n^k)$ iff it is a zigzag word of depth $k$. As corollaries,
we obtain that the morphic words with growth $O(n)$ are exactly the ultimately
periodic words, and the morphic words with growth $O(n^2)$ are exactly the
multilinear words.
","[{'version': 'v1', 'created': 'Sun, 24 Mar 2019 00:24:05 GMT'}, {'version': 'v2', 'created': 'Thu, 31 Oct 2019 15:36:58 GMT'}, {'version': 'v3', 'created': 'Sat, 1 Feb 2020 19:31:13 GMT'}, {'version': 'v4', 'created': 'Tue, 4 Feb 2020 18:00:42 GMT'}]",2020-08-25,"[['Smith', 'Tim', '']]","['morphic word', 'polynomial growth', 'zigzag word', 'multilinear word']"
5253,1709.01384,Krzysztof Rzadca,Pawel Janus and Krzysztof Rzadca,"SLO-aware Colocation of Data Center Tasks Based on Instantaneous
  Processor Requirements",Author's version of a paper published in ACM SoCC'17,"ACM SoCC'17, September 24-27, 2017, Santa Clara, CA, USA",10.1145/3127479.3132244,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a cloud data center, a single physical machine simultaneously executes
dozens of highly heterogeneous tasks. Such colocation results in more efficient
utilization of machines, but, when tasks' requirements exceed available
resources, some of the tasks might be throttled down or preempted. We analyze
version 2.1 of the Google cluster trace that shows short-term (1 second) task
CPU usage. Contrary to the assumptions taken by many theoretical studies, we
demonstrate that the empirical distributions do not follow any single
distribution. However, high percentiles of the total processor usage (summed
over at least 10 tasks) can be reasonably estimated by the Gaussian
distribution. We use this result for a probabilistic fit test, called the
Gaussian Percentile Approximation (GPA), for standard bin-packing algorithms.
To check whether a new task will fit into a machine, GPA checks whether the
resulting distribution's percentile corresponding to the requested service
level objective, SLO is still below the machine's capacity. In our simulation
experiments, GPA resulted in colocations exceeding the machines' capacity with
a frequency similar to the requested SLO.
","[{'version': 'v1', 'created': 'Tue, 5 Sep 2017 13:53:32 GMT'}]",2017-09-06,"[['Janus', 'Pawel', ''], ['Rzadca', 'Krzysztof', '']]","['scheduling', 'resource management', 'stochastic bin packing']"
5254,2202.02398,Paulo Pirozelli,"Andr\'e F. A. Paschoal, Paulo Pirozelli, Valdinei Freire, Karina V.
  Delgado, Sarajane M. Peres, Marcos M. Jos\'e, Fl\'avio Nakasato, Andr\'e S.
  Oliveira, Anarosa A. F. Brand\~ao, Anna H. R. Costa, Fabio G. Cozman","Pir\'a: A Bilingual Portuguese-English Dataset for Question-Answering
  about the Ocean",https://github.com/C4AI/Pira,"CIKM '21: Proceedings of the 30th ACM International Conference on
  Information & Knowledge Management, 2021",10.1145/3459637.3482012,,cs.CL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Current research in natural language processing is highly dependent on
carefully produced corpora. Most existing resources focus on English; some
resources focus on languages such as Chinese and French; few resources deal
with more than one language. This paper presents the Pir\'a dataset, a large
set of questions and answers about the ocean and the Brazilian coast both in
Portuguese and English. Pir\'a is, to the best of our knowledge, the first QA
dataset with supporting texts in Portuguese, and, perhaps more importantly, the
first bilingual QA dataset that includes this language. The Pir\'a dataset
consists of 2261 properly curated question/answer (QA) sets in both languages.
The QA sets were manually created based on two corpora: abstracts related to
the Brazilian coast and excerpts of United Nation reports about the ocean. The
QA sets were validated in a peer-review process with the dataset contributors.
We discuss some of the advantages as well as limitations of Pir\'a, as this new
resource can support a set of tasks in NLP such as question-answering,
information retrieval, and machine translation.
","[{'version': 'v1', 'created': 'Fri, 4 Feb 2022 21:29:45 GMT'}]",2022-02-08,"[['Paschoal', 'André F. A.', ''], ['Pirozelli', 'Paulo', ''], ['Freire', 'Valdinei', ''], ['Delgado', 'Karina V.', ''], ['Peres', 'Sarajane M.', ''], ['José', 'Marcos M.', ''], ['Nakasato', 'Flávio', ''], ['Oliveira', 'André S.', ''], ['Brandão', 'Anarosa A. F.', ''], ['Costa', 'Anna H. R.', ''], ['Cozman', 'Fabio G.', '']]","['Question-answering dataset', 'Bilingual dataset', 'Portuguese-Englishdataset', 'Ocean dataset']"
5255,1702.08208,Jakub Breier,Jakub Breier and Wei He,"Multiple Fault Attack on PRESENT with a Hardware Trojan Implementation
  in FPGA","12 pages, 4 figures","Proceedings of the 2015 International Workshop on Secure Internet
  of Things (SIoT), pp. 58-64",10.1109/SIOT.2015.15,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet of Things connects lots of small constrained devices to the
Internet. As in any other environment, communication security is important and
cryptographic algorithms are one of many elements that we use in order to keep
messages secure. Because of the constrained nature of these environments, it is
necessary to use algorithms that do not require high computational power.
Lightweight ciphers are therefore ideal candidates for this purpose.
  In this paper, we explore a possibility of attacking an ultra-lightweight
cipher PRESENT by using a multiple fault attack. Utilizing the Differential
Fault Analysis technique, we were able to recover the secret key with two
faulty encryptions and an exhaustive search of 2^16 remaining key bits. Our
attack aims at four nibbles in the penultimate round of the cipher, causing
faulty output in all nibbles of the output. We also provide a practical attack
scenario by exploiting Hardware Trojan (HT) technique for the proposed fault
injection in a Xilinx Spartan-6 FPGA.
","[{'version': 'v1', 'created': 'Mon, 27 Feb 2017 09:52:23 GMT'}]",2017-02-28,"[['Breier', 'Jakub', ''], ['He', 'Wei', '']]","['Fault Attack', 'PRESENT', 'FPGA', 'Hardware Trojan']"
5256,1902.07656,{\L}ukasz Maziarka,"Bartosz W\'ojcik, {\L}ukasz Maziarka, Jacek Tabor",LOSSGRAD: automatic learning rate in gradient descent,TFML 2019,"Schedae Informaticae, 2018, Volume 27",10.4467/20838476SI.18.004.10409,,cs.LG cs.AI math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a simple, fast and easy to implement algorithm
LOSSGRAD (locally optimal step-size in gradient descent), which automatically
modifies the step-size in gradient descent during neural networks training.
Given a function $f$, a point $x$, and the gradient $\nabla_x f$ of $f$, we aim
to find the step-size $h$ which is (locally) optimal, i.e. satisfies: $$
h=arg\,min_{t \geq 0} f(x-t \nabla_x f). $$ Making use of quadratic
approximation, we show that the algorithm satisfies the above assumption. We
experimentally show that our method is insensitive to the choice of initial
learning rate while achieving results comparable to other methods.
","[{'version': 'v1', 'created': 'Wed, 20 Feb 2019 17:11:17 GMT'}]",2019-11-26,"[['Wójcik', 'Bartosz', ''], ['Maziarka', 'Łukasz', ''], ['Tabor', 'Jacek', '']]","['gradient descent', 'optimization methods', 'adaptive step size', 'dynamic learning rate', 'neural networks']"
5257,1603.05064,Yasir Ali,"Yasir Ali, Asma Javaid","Pairwise Stability in Two Sided Market with Strictly Increasing
  Valuation Functions","10 pages, no figures","Discrete Mathematics & Theoretical Computer Science, Vol. 19 no.
  1, Discrete Algorithms (April 12, 2017) dmtcs:3259",10.23638/DMTCS-19-1-10,,cs.GT math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with two-sided matching market with two disjoint sets, i.e.
the set of buyers and the set of sellers. Each seller can trade with at most
with one buyer and vice versa. Money is transferred from sellers to buyers for
an indivisible goods that buyers own. Valuation functions, for participants of
both sides, are represented by strictly increasing functions with money
considered as discrete variable. An algorithm is devised to prove the existence
of stability for this model.
","[{'version': 'v1', 'created': 'Mon, 14 Mar 2016 07:21:43 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Mar 2017 18:36:58 GMT'}, {'version': 'v3', 'created': 'Tue, 4 Apr 2017 19:29:05 GMT'}]",2019-03-14,"[['Ali', 'Yasir', ''], ['Javaid', 'Asma', '']]","['Stable matching', 'marriage model', 'indivisible goods', 'increasing valuations']"
5258,1705.06559,Zhaoming Yin,"Zhaoming Yin, Jijun Tang, Stephen W. Schaeffer, David A. Bader","Exemplar or Matching: Modeling DCJ Problems with Unequal Content Genome
  Data",17 pages,"Journal of Combinatorial Optimization, 2016",10.1007/s10878-015-9940-4,,cs.DS cs.CE q-bio.GN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The edit distance under the DCJ model can be computed in linear time for
genomes with equal content or with Indels. But it becomes NP-Hard in the
presence of duplications, a problem largely unsolved especially when Indels are
considered. In this paper, we compare two mainstream methods to deal with
duplications and associate them with Indels: one by deletion, namely
DCJ-Indel-Exemplar distance; versus the other by gene matching, namely
DCJ-Indel-Matching distance. We design branch-and-bound algorithms with set of
optimization methods to compute exact distances for both. Furthermore, median
problems are discussed in alignment with both of these distance methods, which
are to find a median genome that minimizes distances between itself and three
given genomes. Lin-Kernighan (LK) heuristic is leveraged and powered up by
sub-graph decomposition and search space reduction technologies to handle
median computation. A wide range of experiments are conducted on synthetic data
sets and real data sets to show pros and cons of these two distance metrics per
se, as well as putting them in the median computation scenario.
","[{'version': 'v1', 'created': 'Thu, 18 May 2017 12:53:56 GMT'}]",2017-05-29,"[['Yin', 'Zhaoming', ''], ['Tang', 'Jijun', ''], ['Schaeffer', 'Stephen W.', ''], ['Bader', 'David A.', '']]","['Genome Rearrangement', 'Double-cut and Join (DCJ)', 'LinKernighan Heuristic']"
5259,1904.02460,Lucas Gren,Konstantinos Chronis and Lucas Gren,"Agility Measurements Mismatch: A Validation Study on Three Agile Team
  Assessments in Software Engineering",,"XP 2016, LNBIP 251, pp. 16-27, 2016",10.1007/978-3-319-33515-5_2,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Many tools have been created for measuring the agility of software teams,
thus creating a saturation in the field. Three agile measurement tools were
selected in order to validate whether they yield sim-ilar results. The surveys
of the tools were given to teams in Company A (N = 30). The questions were
grouped into agile practices which were checked for correlation in order to
establish convergent validity. In addition, we checked whether the questions
identified to be the same among the tools would be given the same replies by
the respondents. We could not establish convergent validity since the
correlations of the data gathered were very few and low. In addition, the
questions which were identified to have the same meaning among the tools did
not have the same answers from the respondents. We conclude that the area of
measuring agility is still immature and more work needs to be done. Not all
tools are applicable to every team but they should be selected on the basis of
how a team has transitioned to agile.
","[{'version': 'v1', 'created': 'Thu, 4 Apr 2019 10:27:12 GMT'}]",2019-04-05,"[['Chronis', 'Konstantinos', ''], ['Gren', 'Lucas', '']]","['Validation', 'Agile Measurement', 'Empirical Study']"
5260,2011.01630,Nicolas Mellado,"Chems-Eddine Himeur, Thibault Lejemble, Thomas Pellegrini, Mathias
  Paulin, Loic Barthe, Nicolas Mellado","PCEDNet : A Lightweight Neural Network for Fast and Interactive Edge
  Detection in 3D Point Clouds",,"ACM Transactions on Graphics, Volume 41, Issue 1, 2022",10.1145/3481804,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, Convolutional Neural Networks (CNN) have proven to be
efficient analysis tools for processing point clouds, e.g., for reconstruction,
segmentation and classification. In this paper, we focus on the classification
of edges in point clouds, where both edges and their surrounding are described.
We propose a new parameterization adding to each point a set of differential
information on its surrounding shape reconstructed at different scales. These
parameters, stored in a Scale-Space Matrix (SSM), provide a well suited
information from which an adequate neural network can learn the description of
edges and use it to efficiently detect them in acquired point clouds. After
successfully applying a multi-scale CNN on SSMs for the efficient
classification of edges and their neighborhood, we propose a new lightweight
neural network architecture outperforming the CNN in learning time, processing
time and classification capabilities. Our architecture is compact, requires
small learning sets, is very fast to train and classifies millions of points in
seconds.
","[{'version': 'v1', 'created': 'Tue, 3 Nov 2020 11:16:13 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Jun 2021 12:05:29 GMT'}, {'version': 'v3', 'created': 'Mon, 20 Sep 2021 14:57:48 GMT'}, {'version': 'v4', 'created': 'Tue, 28 Sep 2021 07:20:14 GMT'}]",2021-11-29,"[['Himeur', 'Chems-Eddine', ''], ['Lejemble', 'Thibault', ''], ['Pellegrini', 'Thomas', ''], ['Paulin', 'Mathias', ''], ['Barthe', 'Loic', ''], ['Mellado', 'Nicolas', '']]","['Point clouds processing', 'neural networks', 'edge detection', 'datasets', 'energy efficiency', 'low resource computing']"
5261,1807.02748,Kamal Al-Sabahi Ph.D.,"Kamal Al-Sabahi, Zhang Zuping, Yang Kang","Latent Semantic Analysis Approach for Document Summarization Based on
  Word Embeddings","20 pages, One-column, 4 figures","KSII Transactions on Internet and Information Systems, 2019, Vol.
  13, No.1",10.3837/tiis.2019.01.015,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since the amount of information on the internet is growing rapidly, it is not
easy for a user to find relevant information for his/her query. To tackle this
issue, much attention has been paid to Automatic Document Summarization. The
key point in any successful document summarizer is a good document
representation. The traditional approaches based on word overlapping mostly
fail to produce that kind of representation. Word embedding, distributed
representation of words, has shown an excellent performance that allows words
to match on semantic level. Naively concatenating word embeddings makes the
common word dominant which in turn diminish the representation quality. In this
paper, we employ word embeddings to improve the weighting schemes for
calculating the input matrix of Latent Semantic Analysis method. Two
embedding-based weighting schemes are proposed and then combined to calculate
the values of this matrix. The new weighting schemes are modified versions of
the augment weight and the entropy frequency. The new schemes combine the
strength of the traditional weighting schemes and word embedding. The proposed
approach is experimentally evaluated on three well-known English datasets, DUC
2002, DUC 2004 and Multilingual 2015 Single-document Summarization for English.
The proposed model performs comprehensively better compared to the
state-of-the-art methods, by at least 1% ROUGE points, leading to a conclusion
that it provides a better document representation and a better document summary
as a result.
","[{'version': 'v1', 'created': 'Sun, 8 Jul 2018 03:39:37 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Oct 2018 02:11:53 GMT'}]",2019-02-05,"[['Al-Sabahi', 'Kamal', ''], ['Zuping', 'Zhang', ''], ['Kang', 'Yang', '']]","['Word Embedding', 'Augment Weight', 'Entropy Frequency', 'Word2Vec', 'Document Summarization', 'Latent Semantic analysis']"
5262,1707.03634,Yi Luo,"Yi Luo, Zhuo Chen, Nima Mesgarani",Speaker-independent Speech Separation with Deep Attractor Network,"IEEE/ACM Transactions on Audio, Speech and Language Processing
  (TASLP), Volume 26 Issue 4, April 2018, Page 787-796","IEEE/ACM Transactions on Audio, Speech and Language Processing
  (TASLP), Volume 26 Issue 4, April 2018, Page 787-796",10.1109/TASLP.2018.2795749,,cs.SD cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Despite the recent success of deep learning for many speech processing tasks,
single-microphone, speaker-independent speech separation remains challenging
for two main reasons. The first reason is the arbitrary order of the target and
masker speakers in the mixture permutation problem, and the second is the
unknown number of speakers in the mixture output dimension problem. We propose
a novel deep learning framework for speech separation that addresses both of
these issues. We use a neural network to project the time-frequency
representation of the mixture signal into a high-dimensional embedding space. A
reference point attractor is created in the embedding space to represent each
speaker which is defined as the centroid of the speaker in the embedding space.
The time-frequency embeddings of each speaker are then forced to cluster around
the corresponding attractor point which is used to determine the time-frequency
assignment of the speaker. We propose three methods for finding the attractors
for each source in the embedding space and compare their advantages and
limitations. The objective function for the network is standard signal
reconstruction error which enables end-to-end operation during both training
and test phases. We evaluated our system using the Wall Street Journal dataset
WSJ0 on two and three speaker mixtures and report comparable or better
performance than other state-of-the-art deep learning methods for speech
separation.
","[{'version': 'v1', 'created': 'Wed, 12 Jul 2017 10:32:32 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Nov 2017 00:00:32 GMT'}, {'version': 'v3', 'created': 'Wed, 18 Apr 2018 02:31:09 GMT'}]",2018-04-19,"[['Luo', 'Yi', ''], ['Chen', 'Zhuo', ''], ['Mesgarani', 'Nima', '']]","['Source separation', 'multi-talker', 'deep clustering', 'attractor network']"
5263,1211.4520,Chuan Zhang,"Chuan Zhang, Gerhard Dangelmayr, Iuliana Oprea","Storing cycles in Hopfield-type networks with pseudoinverse learning
  rule: admissibility and network topology","48 pages, 3 figures","Neural Networks, Volume 46, October 2013, Pages 283-298",10.1016/j.neunet.2013.06.008,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cyclic patterns of neuronal activity are ubiquitous in animal nervous
systems, and partially responsible for generating and controlling rhythmic
movements such as locomotion, respiration, swallowing and so on. Clarifying the
role of the network connectivities for generating cyclic patterns is
fundamental for understanding the generation of rhythmic movements. In this
paper, the storage of binary cycles in neural networks is investigated. We call
a cycle $\Sigma$ admissible if a connectivity matrix satisfying the cycle's
transition conditions exists, and construct it using the pseudoinverse learning
rule. Our main focus is on the structural features of admissible cycles and
corresponding network topology. We show that $\Sigma$ is admissible if and only
if its discrete Fourier transform contains exactly $r={rank}(\Sigma)$ nonzero
columns. Based on the decomposition of the rows of $\Sigma$ into loops, where a
loop is the set of all cyclic permutations of a row, cycles are classified as
simple cycles, separable or inseparable composite cycles. Simple cycles contain
rows from one loop only, and the network topology is a feedforward chain with
feedback to one neuron if the loop-vectors in $\Sigma$ are cyclic permutations
of each other. Composite cycles contain rows from at least two disjoint loops,
and the neurons corresponding to the rows in $\Sigma$ from the same loop are
identified with a cluster. Networks constructed from separable composite cycles
decompose into completely isolated clusters. For inseparable composite cycles
at least two clusters are connected, and the cluster-connectivity is related to
the intersections of the spaces spanned by the loop-vectors of the clusters.
Simulations showing successfully retrieved cycles in continuous-time
Hopfield-type networks and in networks of spiking neurons are presented.
","[{'version': 'v1', 'created': 'Mon, 19 Nov 2012 17:45:25 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Apr 2013 04:33:58 GMT'}]",2013-08-26,"[['Zhang', 'Chuan', ''], ['Dangelmayr', 'Gerhard', ''], ['Oprea', 'Iuliana', '']]","['Cyclic Patterns', 'Hopfield-type Networks', 'PseudoinverseLearning Rule', 'Admissibility', 'Network Topology']"
5264,2212.14336,Wenge Xu,"Xinyi Liu, Xuanru Meng, Becky Spittle, Wenge Xu, BoYu Gao, Hai-Ning
  Liang",Exploring Text Selection in Augmented Reality Systems,8 pages,ACM VRCAI 2022,,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Text selection is a common and essential activity during text interaction in
all interactive systems. As Augmented Reality (AR) head-mounted displays (HMDs)
become more widespread, they will need to provide effective interaction
techniques for text selection that ensure users can complete a range of text
manipulation tasks (e.g., to highlight, copy, and paste text, send instant
messages, and browse the web). As a relatively new platform, text selection in
AR is largely unexplored and the suitability of interaction techniques
supported by current AR HMDs for text selection tasks is unclear. This research
aims to fill this gap and reports on an experiment with 12 participants, which
compares the performance and usability (user experience and workload) of four
possible techniques (Hand+Pinch, Hand+Dwell, Head+Pinch, and Head+Dwell). Our
results suggest that Head+Dwell should be the default selection technique, as
it is relatively fast, has the lowest error rate and workload, and has the
highest-rated user experience and social acceptance.
","[{'version': 'v1', 'created': 'Thu, 29 Dec 2022 15:09:57 GMT'}]",2023-01-02,"[['Liu', 'Xinyi', ''], ['Meng', 'Xuanru', ''], ['Spittle', 'Becky', ''], ['Xu', 'Wenge', ''], ['Gao', 'BoYu', ''], ['Liang', 'Hai-Ning', '']]","['Text Selection', 'Augmented Reality', 'Pointing Methods', 'SelectionMechanisms', 'User Study']"
5265,1905.13322,Vinay Rao,Ben Goodrich and Vinay Rao and Mohammad Saleh and Peter J Liu,Assessing The Factual Accuracy of Generated Text,,"The 25th ACM SIGKDD Conference on Knowledge Discovery and Data
  Mining (KDD '19), August 4--8, 2019, Anchorage, AK, USA",10.1145/3292500.3330955,,cs.CL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We propose a model-based metric to estimate the factual accuracy of generated
text that is complementary to typical scoring schemes like ROUGE
(Recall-Oriented Understudy for Gisting Evaluation) and BLEU (Bilingual
Evaluation Understudy). We introduce and release a new large-scale dataset
based on Wikipedia and Wikidata to train relation classifiers and end-to-end
fact extraction models. The end-to-end models are shown to be able to extract
complete sets of facts from datasets with full pages of text. We then analyse
multiple models that estimate factual accuracy on a Wikipedia text
summarization task, and show their efficacy compared to ROUGE and other
model-free variants by conducting a human evaluation study.
","[{'version': 'v1', 'created': 'Thu, 30 May 2019 21:37:45 GMT'}, {'version': 'v2', 'created': 'Tue, 25 May 2021 19:33:29 GMT'}]",2021-05-27,"[['Goodrich', 'Ben', ''], ['Rao', 'Vinay', ''], ['Saleh', 'Mohammad', ''], ['Liu', 'Peter J', '']]","['datasets', 'neural networks', 'fact extraction', 'deep learning', 'metric', 'end-to-end']"
5266,1111.4800,Soumen  Kanrar,"Aroop Mukherjee, Soumen Kanrar (Vehere Interactive, Calcutta - India)",Enhancement of Image Resolution by Binarization,"5 pages, 8 figures","International Journal of Computer Applications 10(10):15-19, 2010",10.5120/1519-1942,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image segmentation is one of the principal approaches of image processing.
The choice of the most appropriate Binarization algorithm for each case proved
to be a very interesting procedure itself. In this paper, we have done the
comparison study between the various algorithms based on Binarization
algorithms and propose a methodologies for the validation of Binarization
algorithms. In this work we have developed two novel algorithms to determine
threshold values for the pixels value of the gray scale image. The performance
estimation of the algorithm utilizes test images with, the evaluation metrics
for Binarization of textual and synthetic images. We have achieved better
resolution of the image by using the Binarization method of optimum
thresholding techniques.
","[{'version': 'v1', 'created': 'Mon, 21 Nov 2011 09:47:17 GMT'}]",2011-11-22,"[['Mukherjee', 'Aroop', '', 'Vehere Interactive, Calcutta - India'], ['Kanrar', 'Soumen', '', 'Vehere Interactive, Calcutta - India']]","['Thresholding', 'Binarization', 'Optimum']"
5267,1507.03219,Renato Neves,"Renato Neves, Luis S. Barbosa, Dirk Hofmann, Manuel A. Martins",Continuity as a computational effect,"Journal of Logical and Algebraic Methods in Programming, 2016",,10.1016/j.jlamp.2016.05.005,,cs.LO cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The original purpose of component-based development was to provide techniques
to master complex software, through composition, reuse and parametrisation.
However, such systems are rapidly moving towards a level in which software
becomes prevalently intertwined with (continuous) physical processes. A
possible way to accommodate the latter in component calculi relies on a
suitable encoding of continuous behaviour as (yet another) computational
effect. This paper introduces such an encoding through a monad which, in the
compositional development of hybrid systems, may play a role similar to the one
played by the 1+, powerset, and distribution monads in the characterisation of
partial, non deterministic and probabilistic components, respectively. This
monad and its Kleisli category provide a setting in which the effects of
continuity over (different forms of) composition can be suitably studied.
","[{'version': 'v1', 'created': 'Sun, 12 Jul 2015 11:38:40 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Aug 2016 12:18:32 GMT'}]",2016-08-02,"[['Neves', 'Renato', ''], ['Barbosa', 'Luis S.', ''], ['Hofmann', 'Dirk', ''], ['Martins', 'Manuel A.', '']]","['Monads', 'components', 'hybrid systems', 'control theory']"
5268,1507.01826,Natalie Stanley,"Natalie Stanley, Saray Shai, Dane Taylor, Peter J. Mucha","Clustering Network Layers With the Strata Multilayer Stochastic Block
  Model",,,10.1109/TNSE.2016.2537545,,cs.SI physics.soc-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multilayer networks are a useful data structure for simultaneously capturing
multiple types of relationships between a set of nodes. In such networks, each
relational definition gives rise to a layer. While each layer provides its own
set of information, community structure across layers can be collectively
utilized to discover and quantify underlying relational patterns between nodes.
To concisely extract information from a multilayer network, we propose to
identify and combine sets of layers with meaningful similarities in community
structure. In this paper, we describe the ""strata multilayer stochastic block
model'' (sMLSBM), a probabilistic model for multilayer community structure. The
central extension of the model is that there exist groups of layers, called
""strata'', which are defined such that all layers in a given stratum have
community structure described by a common stochastic block model (SBM). That
is, layers in a stratum exhibit similar node-to-community assignments and SBM
probability parameters. Fitting the sMLSBM to a multilayer network provides a
joint clustering that yields node-to-community and layer-to-stratum
assignments, which cooperatively aid one another during inference. We describe
an algorithm for separating layers into their appropriate strata and an
inference technique for estimating the SBM parameters for each stratum. We
demonstrate our method using synthetic networks and a multilayer network
inferred from data collected in the Human Microbiome Project.
","[{'version': 'v1', 'created': 'Tue, 7 Jul 2015 14:36:04 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Oct 2015 14:28:58 GMT'}]",2016-10-21,"[['Stanley', 'Natalie', ''], ['Shai', 'Saray', ''], ['Taylor', 'Dane', ''], ['Mucha', 'Peter J.', '']]","['Stochastic Block Models', 'Clustering', 'MultilayerNetworks', 'Strata', 'Probabilistic Models']"
5269,1607.06864,Sang-il Oum,"Robert Brignall, Hojin Choi, Jisu Jeong, Sang-il Oum","Deciding whether there are infinitely many prime graphs with forbidden
  induced subgraphs","13 pages, 5 figures. Accepted to Discrete Appl. Math",,10.1016/j.dam.2018.10.030,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A homogeneous set of a graph $G$ is a set $X$ of vertices such that $2\le
\lvert X\rvert <\lvert V(G)\rvert$ and no vertex in $V(G)-X$ has both a
neighbor and a non-neighbor in $X$. A graph is prime if it has no homogeneous
set.
  We present an algorithm to decide whether a class of graphs given by a finite
set of forbidden induced subgraphs contains infinitely many non-isomorphic
prime graphs.
","[{'version': 'v1', 'created': 'Sat, 23 Jul 2016 00:08:22 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Jan 2019 08:36:02 GMT'}]",2019-01-16,"[['Brignall', 'Robert', ''], ['Choi', 'Hojin', ''], ['Jeong', 'Jisu', ''], ['Oum', 'Sang-il', '']]","['modular decomposition', 'induced subgraph', 'prime graph', 'homogeneous set']"
5270,2102.04656,Kang Zhao,"Kang Zhao, Pan Pan, Yun Zheng, Yanhao Zhang, Changxu Wang, Yingya
  Zhang, Yinghui Xu, Rong Jin",Large-Scale Visual Search with Binary Distributed Graph at Alibaba,"This paper has been accepted by CIKM2019. Proceedings of the 28th ACM
  International Conference on Information and Knowledge Management. 2019",,10.1145/3357384.3357834,,cs.IR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph-based approximate nearest neighbor search has attracted more and more
attentions due to its online search advantages. Numbers of methods studying the
enhancement of speed and recall have been put forward. However, few of them
focus on the efficiency and scale of offline graph-construction. For a deployed
visual search system with several billions of online images in total, building
a billion-scale offline graph in hours is essential, which is almost
unachievable by most existing methods. In this paper, we propose a novel
algorithm called Binary Distributed Graph to solve this problem. Specifically,
we combine binary codes with graph structure to speedup online and offline
procedures, and achieve comparable performance with the ones in real-value
based scenarios by recalling more binary candidates. Furthermore, the
graph-construction is optimized to completely distributed implementation, which
significantly accelerates the offline process and gets rid of the limitation of
memory and disk within a single machine. Experimental comparisons on Alibaba
Commodity Data Set (more than three billion images) show that the proposed
method outperforms the state-of-the-art with respect to the online/offline
trade-off.
","[{'version': 'v1', 'created': 'Tue, 9 Feb 2021 05:51:34 GMT'}]",2021-02-10,"[['Zhao', 'Kang', ''], ['Pan', 'Pan', ''], ['Zheng', 'Yun', ''], ['Zhang', 'Yanhao', ''], ['Wang', 'Changxu', ''], ['Zhang', 'Yingya', ''], ['Xu', 'Yinghui', ''], ['Jin', 'Rong', '']]","['Visual Search', 'Binary Codes', 'Distributed Algorithm', 'Graph Construction']"
5271,1611.08461,Alan Lukezic,"Alan Luke\v{z}i\v{c}, Tom\'a\v{s} Voj\'i\v{r}, Luka \v{C}ehovin,
  Ji\v{r}\'i Matas and Matej Kristan",Discriminative Correlation Filter with Channel and Spatial Reliability,"Accepted to: International Journal of Computer Vision:
  https://link.springer.com/article/10.1007/s11263-017-1061-3",,10.1007/s11263-017-1061-3,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Short-term tracking is an open and challenging problem for which
discriminative correlation filters (DCF) have shown excellent performance. We
introduce the channel and spatial reliability concepts to DCF tracking and
provide a novel learning algorithm for its efficient and seamless integration
in the filter update and the tracking process. The spatial reliability map
adjusts the filter support to the part of the object suitable for tracking.
This both allows to enlarge the search region and improves tracking of
non-rectangular objects. Reliability scores reflect channel-wise quality of the
learned filters and are used as feature weighting coefficients in localization.
Experimentally, with only two simple standard features, HoGs and Colornames,
the novel CSR-DCF method -- DCF with Channel and Spatial Reliability --
achieves state-of-the-art results on VOT 2016, VOT 2015 and OTB100. The CSR-DCF
runs in real-time on a CPU.
","[{'version': 'v1', 'created': 'Fri, 25 Nov 2016 14:18:52 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Jan 2018 11:31:48 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Jan 2019 08:05:50 GMT'}]",2019-01-15,"[['Lukežič', 'Alan', ''], ['Vojíř', 'Tomáš', ''], ['Čehovin', 'Luka', ''], ['Matas', 'Jiří', ''], ['Kristan', 'Matej', '']]","['Visual tracking', 'Correlation filters', 'Channelreliability', 'Constrained optimization']"
5272,1711.03280,Yuan Gong,"Yuan Gong, Christian Poellabauer",Crafting Adversarial Examples For Speech Paralinguistics Applications,"Published in DYnamic and Novel Advances in Machine Learning and
  Intelligent Cyber Security (DYNAMICS) Workshop in conjunction with ACSAC'18,
  San Juan, Puerto Rico, December 2018",,10.1145/3306195.3306196,,cs.LG cs.CR cs.SD eess.AS stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computational paralinguistic analysis is increasingly being used in a wide
range of cyber applications, including security-sensitive applications such as
speaker verification, deceptive speech detection, and medical diagnostics.
While state-of-the-art machine learning techniques, such as deep neural
networks, can provide robust and accurate speech analysis, they are susceptible
to adversarial attacks. In this work, we propose an end-to-end scheme to
generate adversarial examples for computational paralinguistic applications by
perturbing directly the raw waveform of an audio recording rather than specific
acoustic features. Our experiments show that the proposed adversarial
perturbation can lead to a significant performance drop of state-of-the-art
deep neural networks, while only minimally impairing the audio quality.
","[{'version': 'v1', 'created': 'Thu, 9 Nov 2017 07:41:53 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Jan 2019 06:57:33 GMT'}]",2019-01-14,"[['Gong', 'Yuan', ''], ['Poellabauer', 'Christian', '']]","['Paralinguistics', 'adversarial examples', 'speechprocessing', 'computersecurity']"
5273,1406.5493,Trista S. Lin,"Trista Lin (CITI Insa Lyon / Inria Grenoble Rh\^one-Alpes), Herv\'e
  Rivano (CITI Insa Lyon / Inria Grenoble Rh\^one-Alpes), Fr\'ed\'eric Le
  Mou\""el (CSE, CITI)","Performance Comparison of Contention- and Schedule-based MAC Protocols
  in Urban Parking Sensor Networks","ACM International Workshop on Wireless and Mobile Technologies for
  Smart Cities (WiMobCity) (2014)",,10.1145/2633661.2633663,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network traffic model is a critical problem for urban applications, mainly
because of its diversity and node density. As wireless sensor network is highly
concerned with the development of smart cities, careful consideration to
traffic model helps choose appropriate protocols and adapt network parameters
to reach best performances on energy-latency tradeoffs. In this paper, we
compare the performance of two off-the-shelf medium access control protocols on
two different kinds of traffic models, and then evaluate their application-end
information delay and energy consumption while varying traffic parameters and
network density. From the simulation results, we highlight some limits induced
by network density and occurrence frequency of event-driven applications. When
it comes to realtime urban services, a protocol selection shall be taken into
account - even dynamically - with a special attention to energy-delay tradeoff.
To this end, we provide several insights on parking sensor networks.
","[{'version': 'v1', 'created': 'Fri, 20 Jun 2014 19:22:28 GMT'}]",2014-06-23,"[['Lin', 'Trista', '', 'CITI Insa Lyon / Inria Grenoble Rhône-Alpes'], ['Rivano', 'Hervé', '', 'CITI Insa Lyon / Inria Grenoble Rhône-Alpes'], ['Mouël', 'Frédéric Le', '', 'CSE, CITI']]","['urban sensor network', 'network traffic modeling', 'informationdelay', 'TDMA', 'CSMA']"
5274,1505.00335,Chengqing Li,Chengqing Li,"Cracking a hierarchical chaotic image encryption algorithm based on
  permutation",8 pages,"Signal Processing, 2016, 118: 203-210",10.1016/j.sigpro.2015.07.008,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In year 2000, an efficient hierarchical chaotic image encryption (HCIE)
algorithm was proposed, which divides a plain-image of size $M\times N$ with
$T$ possible value levels into $K$ blocks of the same size and then operates
position permutation on two levels: intra-block and inter-block. As a typical
position permutation-only encryption algorithm, it has received intensive
attention. The present paper analyzes specific security performance of HCIE
against ciphertext-only attack and known/chosen-plaintext attack. It is found
that only $O(\lceil\log_T(M\cdot N/K) \rceil)$ known/chosen plain-images are
sufficient to achieve a good performance, and the computational complexity is
$O(M\cdot N\cdot \lceil\log_T(M\cdot N/K) \rceil)$, which effectively
demonstrates that hierarchical permutation-only image encryption algorithms are
less secure than normal (i.e., non-hierarchical) ones. Detailed experiment
results are given to verify the feasibility of the known-plaintext attack. In
addition, it is pointed out that the security of HCIE against ciphertext-only
attack was much overestimated.
","[{'version': 'v1', 'created': 'Sat, 2 May 2015 12:01:26 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Sep 2016 05:19:43 GMT'}]",2016-09-27,"[['Li', 'Chengqing', '']]","['Chosen-plaintext attack', 'chaotic cryptanalysis', 'known-plaintext attack', 'permutation']"
5275,1302.1772,Vahid Majidnezhad,Vahid Majidnezhad and Igor Kheidorov,An ANN-based Method for Detecting Vocal Fold Pathology,"4 pages, 3 figures, Published with International Journal of Computer
  Applications (IJCA)","International Journal of Computer Applications 62(7):1-4, January
  2013",10.5120/10089-4722,,cs.LG cs.CV cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are different algorithms for vocal fold pathology diagnosis. These
algorithms usually have three stages which are Feature Extraction, Feature
Reduction and Classification. While the third stage implies a choice of a
variety of machine learning methods, the first and second stages play a
critical role in performance and accuracy of the classification system. In this
paper we present initial study of feature extraction and feature reduction in
the task of vocal fold pathology diagnosis. A new type of feature vector, based
on wavelet packet decomposition and Mel-Frequency-Cepstral-Coefficients
(MFCCs), is proposed. Also Principal Component Analysis (PCA) is used for
feature reduction. An Artificial Neural Network is used as a classifier for
evaluating the performance of our proposed method.
","[{'version': 'v1', 'created': 'Thu, 7 Feb 2013 15:03:24 GMT'}]",2013-02-08,"[['Majidnezhad', 'Vahid', ''], ['Kheidorov', 'Igor', '']]","['Wavelet Packet Decomposition', 'Mel-Frequency-CepstralCoefficient (MFCC)', 'Principal Component Analysis (PCA)', 'Artificial Neural Network (ANN)']"
5276,1605.07322,Asahi Takaoka,Asahi Takaoka,Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover,"13 pages, 14 figures, the Author's accepted version of a paper in
  WALCOM 2017, Keywords: Chain cover, Graph sandwich problem, PI graphs,
  Simple-triangle graphs, Threshold dimension 2 graphs","WALCOM: Algorithms and Computation. Volume 10167 of Lecture Notes
  in Computer Science (2017) 177-189",10.1007/978-3-319-53925-6_14,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A simple-triangle graph (also known as a PI graph) is the intersection graph
of a family of triangles defined by a point on a horizontal line and an
interval on another horizontal line. The recognition problem for
simple-triangle graphs was a longstanding open problem, and recently a
polynomial-time algorithm has been given [G. B. Mertzios, The Recognition of
Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial, SIAM J.
Discrete Math., 29(3):1150--1185, 2015]. Along with the approach of this paper,
we show a simpler recognition algorithm for simple-triangle graphs. To do this,
we provide a polynomial-time algorithm to solve the following problem: Given a
bipartite graph $G$ and a set $F$ of edges of $G$, find a 2-chain subgraph
cover of $G$ such that one of two chain subgraphs has no edges in $F$.
","[{'version': 'v1', 'created': 'Tue, 24 May 2016 07:26:39 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Apr 2017 05:31:52 GMT'}]",2017-04-04,"[['Takaoka', 'Asahi', '']]","['Chain cover', 'Graph sandwich problem', 'PI graphs', 'Simple-trianglegraphs', 'Threshold dimension 2 graphs']"
5277,1808.02859,Xianghui Zhong,Stefan Hougardy and Xianghui Zhong,Hard to Solve Instances of the Euclidean Traveling Salesman Problem,,,10.1007/s12532-020-00184-5,,cs.DM cs.CC cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The well known $4/3$ conjecture states that the integrality ratio of the
subtour LP is at most $4/3$ for metric Traveling Salesman instances. We present
a family of Euclidean Traveling Salesman instances for which we prove that the
integrality ratio of the subtour LP converges to $4/3$. These instances (using
the rounded Euclidean norm) turn out to be hard to solve exactly with Concorde,
the fastest existing exact TSP solver. For a 200 vertex instance from our
family of Euclidean Traveling Salesman instances Concorde needs several days of
CPU time. This is more than 1,000,000 times the runtime for a TSPLIB instance
of similar size. Thus our new family of Euclidean Traveling Salesman instances
may serve as new benchmark instances for TSP algorithms.
","[{'version': 'v1', 'created': 'Wed, 8 Aug 2018 16:58:56 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Oct 2018 16:15:05 GMT'}, {'version': 'v3', 'created': 'Tue, 17 Mar 2020 17:35:23 GMT'}]",2020-03-18,"[['Hougardy', 'Stefan', ''], ['Zhong', 'Xianghui', '']]","['traveling salesman problem; Euclidean TSP', 'integrality ratio', 'subtour LP', 'exactTSP solver']"
5278,1507.08087,Marko Van Dooren,"Benoit Desouter, Tom Schrijvers, Marko van Dooren",Tabling as a Library with Delimited Control,"15 pages. To appear in Theory and Practice of Logic Programming
  (TPLP), Proceedings of ICLP 2015",Theory and Practice of Logic Programming 15 (2015) 419-433,10.1017/S1471068415000137,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tabling is probably the most widely studied extension of Prolog. But despite
its importance and practicality, tabling is not implemented by most Prolog
systems. Existing approaches require substantial changes to the Prolog engine,
which is an investment out of reach of most systems. To enable more widespread
adoption, we present a new implementation of tabling in under 600 lines of
Prolog code. Our lightweight approach relies on delimited control and provides
reasonable performance.
","[{'version': 'v1', 'created': 'Wed, 29 Jul 2015 10:01:22 GMT'}]",2020-02-19,"[['Desouter', 'Benoit', ''], ['Schrijvers', 'Tom', ''], ['van Dooren', 'Marko', '']]","['tabling', 'tabulation', 'delimited continuations', 'Prolog', 'logic programming']"
5279,1607.08220,Mostofa Patwary,"Md. Mostofa Ali Patwary, Nadathur Rajagopalan Satish, Narayanan
  Sundaram, Jialin Liu, Peter Sadowski, Evan Racah, Suren Byna, Craig Tull,
  Wahid Bhimji, Prabhat, Pradeep Dubey","PANDA: Extreme Scale Parallel K-Nearest Neighbor on Distributed
  Architectures","11 pages in PANDA: Extreme Scale Parallel K-Nearest Neighbor on
  Distributed Architectures, Md. Mostofa Ali Patwary et.al., IEEE International
  Parallel and Distributed Processing Symposium (IPDPS), 2016",,10.1109/IPDPS.2016.57,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computing $k$-Nearest Neighbors (KNN) is one of the core kernels used in many
machine learning, data mining and scientific computing applications. Although
kd-tree based $O(\log n)$ algorithms have been proposed for computing KNN, due
to its inherent sequentiality, linear algorithms are being used in practice.
This limits the applicability of such methods to millions of data points, with
limited scalability for Big Data analytics challenges in the scientific domain.
In this paper, we present parallel and highly optimized kd-tree based KNN
algorithms (both construction and querying) suitable for distributed
architectures. Our algorithm includes novel approaches for pruning search space
and improving load balancing and partitioning among nodes and threads. Using
TB-sized datasets from three science applications: astrophysics, plasma
physics, and particle physics, we show that our implementation can construct
kd-tree of 189 billion particles in 48 seconds on utilizing $\sim$50,000 cores.
We also demonstrate computation of KNN of 19 billion queries in 12 seconds. We
demonstrate almost linear speedup both for shared and distributed memory
computers. Our algorithms outperforms earlier implementations by more than
order of magnitude; thereby radically improving the applicability of our
implementation to state-of-the-art Big Data analytics problems. In addition, we
showcase performance and scalability on the recently released Intel Xeon Phi
processor showing that our algorithm scales well even on massively parallel
architectures.
","[{'version': 'v1', 'created': 'Wed, 27 Jul 2016 19:13:07 GMT'}]",2016-11-17,"[['Patwary', 'Md. Mostofa Ali', ''], ['Satish', 'Nadathur Rajagopalan', ''], ['Sundaram', 'Narayanan', ''], ['Liu', 'Jialin', ''], ['Sadowski', 'Peter', ''], ['Racah', 'Evan', ''], ['Byna', 'Suren', ''], ['Tull', 'Craig', ''], ['Bhimji', 'Wahid', ''], ['Prabhat', '', ''], ['Dubey', 'Pradeep', '']]","['Big Data Analytics', 'KNN', 'kd-tree', 'Classification', 'Parallel Algorithms', 'Load Balancing']"
5280,1006.1190,Harco Leslie Hendric Spits Warnars,Spits Warnars H.L.H,Game Information System,14 pages,"International Journal of Computer Science and Information
  Technology 2.3 (2010) 135-148",10.5121/ijcsit.2010.2310,,cs.AI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this Information system age many organizations consider information system
as their weapon to compete or gain competitive advantage or give the best
services for non profit organizations. Game Information System as combining
Information System and game is breakthrough to achieve organizations'
performance. The Game Information System will run the Information System with
game and how game can be implemented to run the Information System. Game is not
only for fun and entertainment, but will be a challenge to combine fun and
entertainment with Information System. The Challenge to run the information
system with entertainment, deliver the entertainment with information system
all at once. Game information system can be implemented in many sectors as like
the information system itself but in difference's view. A view of game which
people can joy and happy and do their transaction as a fun things.
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2010 07:22:30 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Jun 2010 02:44:03 GMT'}]",2010-07-15,"[['H', 'Spits Warnars H. L.', '']]","['Information System', 'Game', 'Serious Game', 'Virtual Information System']"
5281,1511.06117,Weijie Yuan,"Nan Wu, Weijie Yuan, Hua Wang, Jingming Kuang","TOA-based passive localization of multiple targets with inaccurate
  receivers based on belief propagation on factor graph","37 pages, 11 figures, accepted by Digital Signal Processing",,10.1016/j.dsp.2015.10.013,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Location awareness is now becoming a vital requirement for many practical
applications. In this paper, we consider passive localization of multiple
targets with one transmitter and several receivers based on time of arrival
(TOA) measurements. Existing studies assume that positions of receivers are
perfectly known. However, in practice, receivers' positions might be
inaccurate, which leads to localization error of targets. We propose factor
graph (FG)-based belief propagation (BP) algorithms to locate the passive
targets and improve the position accuracy of receivers simultaneously. Due to
the nonlinearity of the likelihood function, messages on the FG cannot be
derived in closed form. We propose both sample-based and parametric methods to
solve this problem. In the sample-based BP algorithm, particle swarm
optimization is employed to reduce the number of particles required to
represent messages. In parametric BP algorithm, the nonlinear terms in messages
are linearized, which results in closed-form Gaussian message passing on FG.
The Bayesian Cramer-Rao bound (BCRB) for passive targets localization with
uncertain receivers is derived to evaluate the performance of the proposed
algorithms. Simulation results show that both the sample-based and parametric
BP algorithms outperform the conventional method and attain the proposed BCRB.
Receivers' positions can also be improved via the proposed BP algorithms.
Although the parametric BP algorithm performs slightly worse than the
sample-based BP method, it could be more attractive in practical applications
due to the significantly lower computational complexity.
","[{'version': 'v1', 'created': 'Thu, 19 Nov 2015 10:35:39 GMT'}]",2015-11-24,"[['Wu', 'Nan', ''], ['Yuan', 'Weijie', ''], ['Wang', 'Hua', ''], ['Kuang', 'Jingming', '']]","['Passive Localization', 'Time of Arrival', 'Localization of Multiple']"
5282,1802.08781,Ligang Zhang,"Ligang Zhang, Brijesh Verma","Superpixel based Class-Semantic Texton Occurrences for Natural Roadside
  Vegetation Segmentation","This is a pre-print of an article published in Machine Vision and
  Applications. The final authenticated version is available online at:
  https://doi.org/10.1007/s00138-017-0833-7",Machine Vision and Applications (2017) 28: 293,10.1007/s00138-017-0833-7,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vegetation segmentation from roadside data is a field that has received
relatively little attention in present studies, but can be of great potentials
in a wide range of real-world applications, such as road safety assessment and
vegetation condition monitoring. In this paper, we present a novel approach
that generates class-semantic color-texture textons and aggregates superpixel
based texton occurrences for vegetation segmentation in natural roadside
images. Pixel-level class-semantic textons are first learnt by generating two
individual sets of bag-of-word visual dictionaries from color and filter-bank
texture features separately for each object class using manually cropped
training data. For a testing image, it is first oversegmented into a set of
homogeneous superpixels. The color and texture features of all pixels in each
superpixel are extracted and further mapped to one of the learnt textons using
the nearest distance metric, resulting in a color and a texture texton
occurrence matrix. The color and texture texton occurrences are aggregated
using a linear mixing method over each superpixel and the segmentation is
finally achieved using a simple yet effective majority voting strategy.
Evaluations on two public image datasets from videos collected by the
Department of Transport and Main Roads (DTMR), Queensland, Australia, and a
public roadside grass dataset show high accuracy of the proposed approach. We
also demonstrate the effectiveness of the approach for vegetation segmentation
in real-world scenarios.
","[{'version': 'v1', 'created': 'Sat, 24 Feb 2018 01:51:41 GMT'}]",2018-02-27,"[['Zhang', 'Ligang', ''], ['Verma', 'Brijesh', '']]","['Vegetation segmentation', 'texton', 'superpixel', 'classification algorithm', 'object recognition']"
5283,0902.1037,Anna Kucerova,"A. Ibrahimbegovic, C. Knopf-Lenoir, A. Kucerova and P. Villon","Optimal design and optimal control of structures undergoing finite
  rotations and elastic deformations","35 pages, 11 figures","International Journal for Numerical Methods in Engineering, 61
  (14), 2428-2460, 2004)",10.1002/nme.1150,,cs.NE cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we deal with the optimal design and optimal control of
structures undergoing large rotations. In other words, we show how to find the
corresponding initial configuration and the corresponding set of multiple load
parameters in order to recover a desired deformed configuration or some
desirable features of the deformed configuration as specified more precisely by
the objective or cost function. The model problem chosen to illustrate the
proposed optimal design and optimal control methodologies is the one of
geometrically exact beam. First, we present a non-standard formulation of the
optimal design and optimal control problems, relying on the method of Lagrange
multipliers in order to make the mechanics state variables independent from
either design or control variables and thus provide the most general basis for
developing the best possible solution procedure. Two different solution
procedures are then explored, one based on the diffuse approximation of
response function and gradient method and the other one based on genetic
algorithm. A number of numerical examples are given in order to illustrate both
the advantages and potential drawbacks of each of the presented procedures.
","[{'version': 'v1', 'created': 'Fri, 6 Feb 2009 09:43:09 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Feb 2009 10:12:33 GMT'}]",2009-02-10,"[['Ibrahimbegovic', 'A.', ''], ['Knopf-Lenoir', 'C.', ''], ['Kucerova', 'A.', ''], ['Villon', 'P.', '']]","['structures', 'finite rotation', 'optimization', 'control']"
5284,1707.08279,Shengyao Chen,"Shengyao Chen, Feng Xi, Zhong Liu",A General and Yet Efficient Scheme for Sub-Nyquist Radar Processing,"13 pages, 3 figures",,10.1016/j.sigpro.2017.07.018,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the target parameter estimation for sub-Nyquist pulse-Doppler radar.
Several past works have addressed this problem but either have low estimation
accuracy for off-grid targets, take large computation load, or lack versatility
for analog-to-information conversion (AIC) systems. To overcome these
difficulties, we present a general and efficient estimation scheme. The scheme
first formulates a general model in the sense that it is applicable to all AICs
regardless of whether the targets are on or off the grids. The estimation of
Doppler shifts and delays is performed sequentially, in which the Doppler
estimation is formulated into a spatial spectrum estimation problem and the
delay estimation is decomposed into a series of compressive parameter
estimation problems with each corresponding to an estimated Doppler shift. By
the sequential and decomposed processing, the computational complexity is
substantially reduced, and by the parametric estimation techniques, the high
accurate estimation is obtained. Theoretical analyses and numerical experiments
show the effectiveness and the correctness of the proposed scheme.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 02:34:49 GMT'}]",2017-07-27,"[['Chen', 'Shengyao', ''], ['Xi', 'Feng', ''], ['Liu', 'Zhong', '']]","['Compressive sampling', 'Pulse-Doppler radar', 'Delay-Doppler estimation', 'Off-grid target']"
5285,1212.5284,Diego Perea Mr.,Diego Perea-Vega and Jean-Francois Frigon and Andre Girard,"Dual-Based Bounds for Resource Allocation in Zero-forcing Beamforming
  OFDMA-SDMA Systems","Accepted for publication in EURASIP Journal on Wireless
  Communications and Networking. arXiv admin note: substantial text overlap
  with arXiv:1110.1347","EURASIP Journal on Wireless Communications and Networking 2013,
  2013:51",10.1186/1687-1499-2013-51,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider multi-antenna base stations using orthogonal frequency division
multiple access and space division multiple access techniques to serve
single-antenna users. Some users, called real-time users, have minimum rate
requirements and must be served in the current time slot while others, called
non real-time users, do not have strict timing constraints and are served on a
best-effort basis. The resource allocation problem is to find the assignment of
users to subcarriers and the transmit beamforming vectors that maximize the
total user rates subject to power and minimum rate constraints. In general,
this is a nonlinear and non-convex program and the zero-forcing technique used
here makes it integer as well, exact optimal solutions cannot be computed in
reasonable time for realistic cases. For this reason, we present a technique to
compute both upper and lower bounds and show that these are quite close for
some realistic cases.
  First, we formulate the dual problem whose optimum provides an upper bound to
all feasible solutions. We then use a simple method to get a primal-feasible
point starting from the dual optimal solution, which is a lower bound on the
primal optimal solution. Numerical results for several cases show that the two
bounds are close so that the dual method can be used to benchmark any heuristic
used to solve this problem. As an example, we provide numerical results showing
the performance gap of the well-known weight adjustment method and show that
there is considerable room for improvement.
","[{'version': 'v1', 'created': 'Thu, 20 Dec 2012 22:12:15 GMT'}]",2013-11-27,"[['Perea-Vega', 'Diego', ''], ['Frigon', 'Jean-Francois', ''], ['Girard', 'Andre', '']]","['Resource Allocation', 'OFDMA/SDMA', 'QoS', 'Minimum rateconstraints', 'Zero-force beamforming']"
5286,1403.5398,Xavier Devroey,"Xavier Devroey, Gilles Perrouin, Maxime Cordy, Axel Legay, Pierre-Yves
  Schobbens, Patrick Heymans",State Machine Flattening: Mapping Study and Assessment,,,10.1109/ICSTW.2015.7107408,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  State machine formalisms equipped with hierarchy and parallelism allow to
compactly model complex system behaviours. Such models can then be transformed
into executable code or inputs for model-based testing and verification
techniques. Generated artifacts are mostly flat descriptions of system
behaviour. \emph{Flattening} is thus an essential step of these
transformations. To assess the importance of flattening, we have defined and
applied a systematic mapping process and 30 publications were finally selected.
However, it appeared that flattening is rarely the sole focus of the
publications and that care devoted to the description and validation of
flattening techniques varies greatly. Preliminary assessment of associated tool
support indicated limited tool availability and scalability on challenging
models. We see this initial investigation as a first step towards generic
flattening techniques and scalable tool support, cornerstones of reliable
model-based behavioural development.
","[{'version': 'v1', 'created': 'Fri, 21 Mar 2014 09:02:31 GMT'}]",2017-10-24,"[['Devroey', 'Xavier', ''], ['Perrouin', 'Gilles', ''], ['Cordy', 'Maxime', ''], ['Legay', 'Axel', ''], ['Schobbens', 'Pierre-Yves', ''], ['Heymans', 'Patrick', '']]","['State machine', 'Flattening', 'Systematic mapping study', 'Tools experimentation']"
5287,1506.03229,Bruno Golosio,"Bruno Golosio, Angelo Cangelosi, Olesya Gamotina, Giovanni Luca Masala","A cognitive neural architecture able to learn and communicate through
  natural language","The source code of the software, the User Guide and the datasets used
  for its validation are available in the ANNABELL web site at
  https://github.com/golosio/annabell/wiki",PLoS ONE 10 (2015) e0140866,10.1371/journal.pone.0140866,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Communicative interactions involve a kind of procedural knowledge that is
used by the human brain for processing verbal and nonverbal inputs and for
language production. Although considerable work has been done on modeling human
language abilities, it has been difficult to bring them together to a
comprehensive tabula rasa system compatible with current knowledge of how
verbal information is processed in the brain. This work presents a cognitive
system, entirely based on a large-scale neural architecture, which was
developed to shed light on the procedural knowledge involved in language
elaboration. The main component of this system is the central executive, which
is a supervising system that coordinates the other components of the working
memory. In our model, the central executive is a neural network that takes as
input the neural activation states of the short-term memory and yields as
output mental actions, which control the flow of information among the working
memory components through neural gating mechanisms. The proposed system is
capable of learning to communicate through natural language starting from
tabula rasa, without any a priori knowledge of the structure of phrases,
meaning of words, role of the different classes of words, only by interacting
with a human through a text-based interface, using an open-ended incremental
learning process. It is able to learn nouns, verbs, adjectives, pronouns and
other word classes, and to use them in expressive language. The model was
validated on a corpus of 1587 input sentences, based on literature on early
language assessment, at the level of about 4-years old child, and produced 521
output sentences, expressing a broad range of language processing
functionalities.
","[{'version': 'v1', 'created': 'Wed, 10 Jun 2015 09:25:59 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Jun 2015 16:58:57 GMT'}, {'version': 'v3', 'created': 'Mon, 22 Jun 2015 16:43:59 GMT'}]",2015-11-17,"[['Golosio', 'Bruno', ''], ['Cangelosi', 'Angelo', ''], ['Gamotina', 'Olesya', ''], ['Masala', 'Giovanni Luca', '']]","['large-scale artificial neural networks', 'human language understanding', 'verbal working memory', 'cognitive architectures', 'Hebbian learning rule']"
5288,1907.08164,Riccardo Coppola,"Riccardo Coppola, Luca Ardito, Marco Torchiano","Fragility of Layout-Based and Visual GUI Test Scripts: An Assessment
  Study on a Hybrid Mobile Application",,"Proceedings of the 10th ACM SIGSOFT International Workshop on
  Automating TEST Case Design, Selection, and Evaluation, Tallinn, Estonia,
  August 26-27, 2019 (A-TEST '19)",10.1145/3340433.3342824,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Albeit different approaches exist for automated GUI testing of
hybrid mobile applications, the practice appears to be not so commonly adopted
by developers. A possible reason for such a low diffusion can be the fragility
of the techniques, i.e. the frequent need for maintaining test cases when the
GUI of the app is changed.
  Goal: In this paper, we perform an assessment of the maintenance needed by
test cases for a hybrid mobile app, and the related fragility causes.
  Methods: We evaluated a small test suite with a Layout-based testing tool
(Appium) and a Visual one (EyeAutomate) and observed the changes needed by
tests during the co-evolution with the GUI of the app.
  Results: We found that 20% Layout-based test methods and 30% Visual test
methods had to be modified at least once, and that each release induced
fragilities in 3-4% of the test methods.
  Conclusion: Fragility of GUI tests can induce relevant maintenance efforts in
test suites of large applications. Several principal causes for fragilities
have been identified for the tested hybrid application, and guidelines for
developers are deduced from them.
","[{'version': 'v1', 'created': 'Thu, 18 Jul 2019 17:10:40 GMT'}, {'version': 'v2', 'created': 'Sat, 27 Jul 2019 12:23:34 GMT'}]",2019-07-30,"[['Coppola', 'Riccardo', ''], ['Ardito', 'Luca', ''], ['Torchiano', 'Marco', '']]","['Mobile Development', 'Automated software testing', 'GUI testing', 'Image Recognition Testing', 'Software maintenance', 'Empirical SoftwareEngineering']"
5289,1610.00004,Zahur Ullah,"Lukasz Kaczmarczyk, Zahur Ullah, Chris J. Pearce","Energy consistent framework for continuously evolving 3D crack
  propagation","35 pages, 17 figures",,10.1016/j.cma.2017.06.001,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a formulation for brittle fracture in 3D elastic solids
within the context of configurational mechanics. The local form of the first
law of thermodynamics provides a condition for equilibrium of the crack front.
The direction of the crack propagation is shown to be given by the direction of
the configurational forces on the crack front that maximise the local
dissipation. The evolving crack front is continuously resolved by the finite
element mesh, without the need for face splitting or the use of enrichment
techniques. A monolithic solution strategy is adopted, solving simultaneously
for both the material displacements (i.e. crack extension) and the spatial
displacements, is adopted. In order to trace the dissipative loading path, an
arc-length procedure is developed that controls the incremental crack area
growth. In order to maintain mesh quality, smoothing of the mesh is undertaken
as a continuous process, together with face flipping, node merging and edge
splitting where necessary. Hierarchical basis functions of arbitrary polynomial
order are adopted to increase the order of approximation without the need to
change the finite element mesh. Performance of the formulation is demonstrated
by means of three representative numerical simulations, demonstrating both
accuracy and robustness.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2016 11:16:35 GMT'}]",2017-08-02,"[['Kaczmarczyk', 'Lukasz', ''], ['Ullah', 'Zahur', ''], ['Pearce', 'Chris J.', '']]","['fracture', 'configurational brittle material crack path', 'hierarchical']"
5290,1503.04522,Justin Hsu,"Arthur Azevedo de Amorim, Emilio Jes\'us Gallego Arias, Marco
  Gaboardi, Justin Hsu",Really Natural Linear Indexed Type Checking,,,10.1145/2746325.2746335,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent works have shown the power of linear indexed type systems for
enforcing complex program properties. These systems combine linear types with a
language of type-level indices, allowing more fine-grained analyses. Such
systems have been fruitfully applied in diverse domains, including implicit
complexity and differential privacy. A natural way to enhance the
expressiveness of this approach is by allowing the indices to depend on runtime
information, in the spirit of dependent types. This approach is used in DFuzz,
a language for differential privacy. The DFuzz type system relies on an index
language supporting real and natural number arithmetic over constants and
variables. Moreover, DFuzz uses a subtyping mechanism to make types more
flexible. By themselves, linearity, dependency, and subtyping each require
delicate handling when performing type checking or type inference; their
combination increases this challenge substantially, as the features can
interact in non-trivial ways. In this paper, we study the type-checking problem
for DFuzz. We show how we can reduce type checking for (a simple extension of)
DFuzz to constraint solving over a first-order theory of naturals and real
numbers which, although undecidable, can often be handled in practice by
standard numeric solvers.
","[{'version': 'v1', 'created': 'Mon, 16 Mar 2015 04:45:58 GMT'}]",2018-03-16,"[['de Amorim', 'Arthur Azevedo', ''], ['Arias', 'Emilio Jesús Gallego', ''], ['Gaboardi', 'Marco', ''], ['Hsu', 'Justin', '']]","['type checking', 'type inference', 'linear types', 'subtyping', 'sensitivity analysis']"
5291,2105.03748,Shuo Zhang,"Weiwei Sun, Shuo Zhang, Krisztian Balog, Zhaochun Ren, Pengjie Ren,
  Zhumin Chen and Maarten de Rijke","Simulating User Satisfaction for the Evaluation of Task-oriented
  Dialogue Systems","Proceedings of the 44th International ACM SIGIR Conference on
  Research and Development in Information Retrieval (SIGIR '21), 2021",,10.1145/3404835.3463241,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evaluation is crucial in the development process of task-oriented dialogue
systems. As an evaluation method, user simulation allows us to tackle issues
such as scalability and cost-efficiency, making it a viable choice for
large-scale automatic evaluation. To help build a human-like user simulator
that can measure the quality of a dialogue, we propose the following task:
simulating user satisfaction for the evaluation of task-oriented dialogue
systems. The purpose of the task is to increase the evaluation power of user
simulations and to make the simulation more human-like. To overcome a lack of
annotated data, we propose a user satisfaction annotation dataset, USS, that
includes 6,800 dialogues sampled from multiple domains, spanning real-world
e-commerce dialogues, task-oriented dialogues constructed through Wizard-of-Oz
experiments, and movie recommendation dialogues. All user utterances in those
dialogues, as well as the dialogues themselves, have been labeled based on a
5-level satisfaction scale. We also share three baseline methods for user
satisfaction prediction and action prediction tasks. Experiments conducted on
the USS dataset suggest that distributed representations outperform
feature-based methods. A model based on hierarchical GRUs achieves the best
performance in in-domain user satisfaction prediction, while a BERT-based model
has better cross-domain generalization ability.
","[{'version': 'v1', 'created': 'Sat, 8 May 2021 17:34:40 GMT'}]",2021-05-11,"[['Sun', 'Weiwei', ''], ['Zhang', 'Shuo', ''], ['Balog', 'Krisztian', ''], ['Ren', 'Zhaochun', ''], ['Ren', 'Pengjie', ''], ['Chen', 'Zhumin', ''], ['de Rijke', 'Maarten', '']]","['User simulation', 'task-oriented dialogue', 'conversational recommendation', 'conversational information access']"
5292,1706.08493,Filipe Assun\c{c}\~ao,"Filipe Assun\c{c}\~ao, Nuno Louren\c{c}o, Penousal Machado, Bernardete
  Ribeiro","Towards the Evolution of Multi-Layered Neural Networks: A Dynamic
  Structured Grammatical Evolution Approach",,,10.1145/3071178.3071286,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current grammar-based NeuroEvolution approaches have several shortcomings. On
the one hand, they do not allow the generation of Artificial Neural Networks
(ANNs composed of more than one hidden-layer. On the other, there is no way to
evolve networks with more than one output neuron. To properly evolve ANNs with
more than one hidden-layer and multiple output nodes there is the need to know
the number of neurons available in previous layers. In this paper we introduce
Dynamic Structured Grammatical Evolution (DSGE): a new genotypic representation
that overcomes the aforementioned limitations. By enabling the creation of
dynamic rules that specify the connection possibilities of each neuron, the
methodology enables the evolution of multi-layered ANNs with more than one
output neuron. Results in different classification problems show that DSGE
evolves effective single and multi-layered ANNs, with a varying number of
output neurons.
","[{'version': 'v1', 'created': 'Mon, 26 Jun 2017 17:34:14 GMT'}]",2018-01-08,"[['Assunção', 'Filipe', ''], ['Lourenço', 'Nuno', ''], ['Machado', 'Penousal', ''], ['Ribeiro', 'Bernardete', '']]","['NeuroEvolution', 'Artifcial Neural Networks', 'Classifcation', 'Grammarbased Genetic Programming']"
5293,1706.00840,Thomas-Peter Fries,"T.P. Fries, D. Sch\""ollhammer","Higher-order meshing of implicit geometries - part II: Approximations on
  manifolds",,,10.1016/j.cma.2017.07.037,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new concept for the higher-order accurate approximation of partial
differential equations on manifolds is proposed where a surface mesh composed
by higher-order elements is automatically generated based on level-set data.
Thereby, it enables a completely automatic workflow from the geometric
description to the numerical analysis without any user-intervention. A master
level-set function defines the shape of the manifold through its
zero-isosurface which is then restricted to a finite domain by additional
level-set functions. It is ensured that the surface elements are sufficiently
continuous and shape regular which is achieved by manipulating the background
mesh. The numerical results show that optimal convergence rates are obtained
with a moderate increase in the condition number compared to handcrafted
surface meshes.
","[{'version': 'v1', 'created': 'Fri, 2 Jun 2017 20:20:59 GMT'}]",2017-10-11,"[['Fries', 'T. P.', ''], ['Schöllhammer', 'D.', '']]","['higher-order FEM', 'manifold', 'surface PDEs', 'level-set method']"
5294,1912.01527,Qing Ke,Qing Ke,The citation disadvantage of clinical research,,"Journal of Informetrics 14, 100998 (2020)",10.1016/j.joi.2019.100998,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Biomedical research encompasses diverse types of activities, from basic
science (""bench"") to clinical medicine (""bedside"") to bench-to-bedside
translational research. It, however, remains unclear whether different types of
research receive citations at varying rates. Here we aim to answer this
question by using a newly proposed paper-level indicator that quantifies the
extent to which a paper is basic science or clinical medicine. Applying this
measure to 5 million biomedical papers, we find a systematic citation
disadvantage of clinical oriented papers; they tend to garner far fewer
citations and are less likely to be hit works than papers oriented towards
basic science. At the same time, clinical research has a higher variance in its
citation. We also find that the citation difference between basic and clinical
research decreases, yet still persists, if longer citation-window is used.
Given the increasing adoption of short-term, citation-based bibliometric
indicators in funding decisions, the under-cited effect of clinical research
may provide disincentives for bio-researchers to venture into the translation
of basic scientific discoveries into clinical applications, thus providing
explanations of reasons behind the existence of the gap between basic and
clinical research that is commented as ""valley of death"" and the commentary of
""extinction"" risk of translational researchers. Our work may provide insights
to policy-makers on how to evaluate different types of biomedical research.
","[{'version': 'v1', 'created': 'Tue, 3 Dec 2019 17:03:05 GMT'}]",2019-12-17,"[['Ke', 'Qing', '']]","['biomedicine', 'basic research', 'clinical medicine', 'citation analysis', 'bias']"
5295,1806.01896,Yuri G. Gordienko,"Vlad Taran, Nikita Gordienko, Yuriy Kochura, Yuri Gordienko, Alexandr
  Rokovyi, Oleg Alienin, Sergii Stirenko","Performance Evaluation of Deep Learning Networks for Semantic
  Segmentation of Traffic Stereo-Pair Images","8 pages, 10 figures; accepted for presentation at 19-th International
  Conference on Computer Systems and Technologies (CompSysTech'18) 13-14
  September 2018, University of Ruse, Bulgaria","Proceedings of the 19th International Conference on Computer
  Systems and Technologies (CompSysTech'18), Boris Rachev and Angel Smrikarov
  (Eds.). ACM, New York, NY, USA, 73-80 (2018)",10.1145/3274005.3274032,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semantic image segmentation is one the most demanding task, especially for
analysis of traffic conditions for self-driving cars. Here the results of
application of several deep learning architectures (PSPNet and ICNet) for
semantic image segmentation of traffic stereo-pair images are presented. The
images from Cityscapes dataset and custom urban images were analyzed as to the
segmentation accuracy and image inference time. For the models pre-trained on
Cityscapes dataset, the inference time was equal in the limits of standard
deviation, but the segmentation accuracy was different for various cities and
stereo channels even. The distributions of accuracy (mean intersection over
union - mIoU) values for each city and channel are asymmetric, long-tailed, and
have many extreme outliers, especially for PSPNet network in comparison to
ICNet network. Some statistical properties of these distributions (skewness,
kurtosis) allow us to distinguish these two networks and open the question
about relations between architecture of deep learning networks and statistical
distribution of the predicted results (mIoU here). The results obtained
demonstrated the different sensitivity of these networks to: (1) the local
street view peculiarities in different cities that should be taken into account
during the targeted fine tuning the models before their practical applications,
(2) the right and left data channels in stereo-pairs. For both networks, the
difference in the predicted results (mIoU here) for the right and left data
channels in stereo-pairs is out of the limits of statistical error in relation
to mIoU values. It means that the traffic stereo pairs can be effectively used
not only for depth calculations (as it is usually used), but also as an
additional data channel that can provide much more information about scene
objects than simple duplication of the same street view images.
","[{'version': 'v1', 'created': 'Tue, 5 Jun 2018 19:00:35 GMT'}]",2019-02-08,"[['Taran', 'Vlad', ''], ['Gordienko', 'Nikita', ''], ['Kochura', 'Yuriy', ''], ['Gordienko', 'Yuri', ''], ['Rokovyi', 'Alexandr', ''], ['Alienin', 'Oleg', ''], ['Stirenko', 'Sergii', '']]","['machine learning', 'deep learning', 'semantic segmentation', 'stereo-pair', 'accuracy', 'inference time', 'Cityscapes']"
5296,1804.05464,Eric Mazumdar,Eric Mazumdar and Lillian J. Ratliff and S. Shankar Sastry,On Gradient-Based Learning in Continuous Games,,"SIAM Journal on Mathematics of Data Science 2020 2:1, 103-131",10.1137/18M1231298,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We formulate a general framework for competitive gradient-based learning that
encompasses a wide breadth of multi-agent learning algorithms, and analyze the
limiting behavior of competitive gradient-based learning algorithms using
dynamical systems theory. For both general-sum and potential games, we
characterize a non-negligible subset of the local Nash equilibria that will be
avoided if each agent employs a gradient-based learning algorithm. We also shed
light on the issue of convergence to non-Nash strategies in general- and
zero-sum games, which may have no relevance to the underlying game, and arise
solely due to the choice of algorithm. The existence and frequency of such
strategies may explain some of the difficulties encountered when using gradient
descent in zero-sum games as, e.g., in the training of generative adversarial
networks. To reinforce the theoretical contributions, we provide empirical
results that highlight the frequency of linear quadratic dynamic games (a
benchmark for multi-agent reinforcement learning) that admit global Nash
equilibria that are almost surely avoided by policy gradient.
","[{'version': 'v1', 'created': 'Mon, 16 Apr 2018 01:14:17 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Sep 2018 03:54:44 GMT'}, {'version': 'v3', 'created': 'Thu, 20 Feb 2020 18:26:35 GMT'}]",2020-02-21,"[['Mazumdar', 'Eric', ''], ['Ratliff', 'Lillian J.', ''], ['Sastry', 'S. Shankar', '']]","['continuous games', 'gradient-based algorithms', 'multi-agent learning']"
5297,2011.08525,Naoki Sugimoto,"Naoki Sugimoto, Yoshihito Ebine, Kiyoharu Aizawa","Building Movie Map -- A Tool for Exploring Areas in a City -- and its
  Evaluation",,ACM Multimedia 2020,10.1145/3394171.3413881,,cs.MM cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new Movie Map system, with an interface for exploring cities.
The system consists of four stages; acquisition, analysis, management, and
interaction. In the acquisition stage, omnidirectional videos are taken along
streets in target areas. Frames of the video are localized on the map,
intersections are detected, and videos are segmented. Turning views at
intersections are subsequently generated. By connecting the video segments
following the specified movement in an area, we can view the streets better.
The interface allows for easy exploration of a target area, and it can show
virtual billboards of stores in the view. We conducted user studies to compare
our system to the GSV in a scenario where users could freely move and explore
to find a landmark. The experiment showed that our system had a better user
experience than GSV.
","[{'version': 'v1', 'created': 'Tue, 17 Nov 2020 09:24:05 GMT'}]",2021-03-12,"[['Sugimoto', 'Naoki', ''], ['Ebine', 'Yoshihito', ''], ['Aizawa', 'Kiyoharu', '']]","['interface', 'omni-directional video', 'free route movie', 'movie map', 'slam']"
5298,1707.06381,Suhwan Lim,"Suhwan Lim, Jong-Ho Bae, Jai-Ho Eum, Sungtae Lee, Chul-Heung Kim,
  Dongseok Kwon, Byung-Gook Park, Jong-Ho Lee","Adaptive Learning Rule for Hardware-based Deep Neural Networks Using
  Electronic Synapse Devices",,Neural Comput. Appl. (2018),10.1007/s00521-018-3659-y,,cs.NE cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a learning rule based on a back-propagation (BP)
algorithm that can be applied to a hardware-based deep neural network (HW-DNN)
using electronic devices that exhibit discrete and limited conductance
characteristics. This adaptive learning rule, which enables forward, backward
propagation, as well as weight updates in hardware, is helpful during the
implementation of power-efficient and high-speed deep neural networks. In
simulations using a three-layer perceptron network, we evaluate the learning
performance according to various conductance responses of electronic synapse
devices and weight-updating methods. It is shown that the learning accuracy is
comparable to that obtained when using a software-based BP algorithm when the
electronic synapse device has a linear conductance response with a high dynamic
range. Furthermore, the proposed unidirectional weight-updating method is
suitable for electronic synapse devices which have nonlinear and finite
conductance responses. Because this weight-updating method can compensate the
demerit of asymmetric weight updates, we can obtain better accuracy compared to
other methods. This adaptive learning rule, which can be applied to full
hardware implementation, can also compensate the degradation of learning
accuracy due to the probable device-to-device variation in an actual electronic
synapse device.
","[{'version': 'v1', 'created': 'Thu, 20 Jul 2017 06:10:36 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Aug 2017 11:42:23 GMT'}]",2018-08-02,"[['Lim', 'Suhwan', ''], ['Bae', 'Jong-Ho', ''], ['Eum', 'Jai-Ho', ''], ['Lee', 'Sungtae', ''], ['Kim', 'Chul-Heung', ''], ['Kwon', 'Dongseok', ''], ['Park', 'Byung-Gook', ''], ['Lee', 'Jong-Ho', '']]","['Deep neural networks (DNNs)', 'back-propagation', 'neuromorphic', 'synapse device', 'classification accuracy', 'hardware-based deep neural networks (HW-DNNs)']"
5299,1201.2034,Ram mohan Reddy Ch Mr,"Ch Ram Mohan Reddy, D. Evangelin Geetha, K. G. Srinivasa, T. V. Suresh
  Kumar, K. Rajani Kanth",Early Performance Prediction of Web Services,"11 pages, 10 figures",,10.5121/ijwsc.2011.2303,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web Service is an interface which implements business logic. Performance is
an important quality aspect of Web services because of their distributed
nature. Predicting the performance of web services during early stages of
software development is significant. In this paper we model web service using
Unified Modeling Language, Use Case Diagram, Sequence Diagram, Deployment
Diagram. We obtain the Performance metrics by simulating the web services model
using a simulation tool Simulation of Multi-Tier Queuing Architecture. We have
identified the bottle neck resources.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2012 11:59:37 GMT'}]",2012-01-11,"[['Reddy', 'Ch Ram Mohan', ''], ['Geetha', 'D. Evangelin', ''], ['Srinivasa', 'K. G.', ''], ['Kumar', 'T. V. Suresh', ''], ['Kanth', 'K. Rajani', '']]","['Software Performance Engineering', 'Web Services', 'Unified Modeling Language', 'Simulation']"
5300,1108.6294,Sudha Livingston,"L.R Sudha, Dr.R Bhavani",Biometric Authorization System using Gait Biometry,"12 pages, 4 figures, 6 tables; International Journal of Computer
  Science, Engineering and Applications (IJCSEA) Vol.1, No.4, August 2011",,10.5121/ijcsea.2011.1401,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Human gait, which is a new biometric aimed to recognize individuals by the
way they walk have come to play an increasingly important role in visual
surveillance applications. In this paper a novel hybrid holistic approach is
proposed to show how behavioural walking characteristics can be used to
recognize unauthorized and suspicious persons when they enter a surveillance
area. Initially background is modelled from the input video captured from
cameras deployed for security and the foreground moving object in the
individual frames are segmented using the background subtraction algorithm.
Then gait representing spatial, temporal and wavelet components are extracted
and fused for training and testing multi class support vector machine models
(SVM). The proposed system is evaluated using side view videos of NLPR
database. The experimental results demonstrate that the proposed system
achieves a pleasing recognition rate and also the results indicate that the
classification ability of SVM with Radial Basis Function (RBF) is better than
with other kernel functions.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2011 17:22:51 GMT'}]",2011-09-01,"[['Sudha', 'L. R', ''], ['Bhavani', 'Dr. R', '']]","['Biometrics', 'Gait recognition', 'Silhouette images', 'Spatial', 'Temporal', 'Video Surveillance']"
5301,1406.4047,Michele Focchi,"Michele Focchi, Gustavo A. Medrano-Cerda, Thiago Boaventura, Marco
  Frigerio, Jonas Buchli, Darwin G. Caldwell, Claudio Semini","Robot Impedance Control and Passivity Analysis with Inner Torque and
  Velocity Feedback Loops",14 pages in Control Theory and Technology (2016),,10.1007/s11768-016-5015-z,,cs.SY cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Impedance control is a well-established technique to control interaction
forces in robotics. However, real implementations of impedance control with an
inner loop may suffer from several limitations. Although common practice in
designing nested control systems is to maximize the bandwidth of the inner loop
to improve tracking performance, it may not be the most suitable approach when
a certain range of impedance parameters has to be rendered. In particular, it
turns out that the viable range of stable stiffness and damping values can be
strongly affected by the bandwidth of the inner control loops (e.g. a torque
loop) as well as by the filtering and sampling frequency. This paper provides
an extensive analysis on how these aspects influence the stability region of
impedance parameters as well as the passivity of the system. This will be
supported by both simulations and experimental data. Moreover, a methodology
for designing joint impedance controllers based on an inner torque loop and a
positive velocity feedback loop will be presented. The goal of the velocity
feedback is to increase (given the constraints to preserve stability) the
bandwidth of the torque loop without the need of a complex controller.
","[{'version': 'v1', 'created': 'Mon, 16 Jun 2014 15:32:55 GMT'}, {'version': 'v2', 'created': 'Mon, 23 May 2016 08:05:12 GMT'}]",2016-05-24,"[['Focchi', 'Michele', ''], ['Medrano-Cerda', 'Gustavo A.', ''], ['Boaventura', 'Thiago', ''], ['Frigerio', 'Marco', ''], ['Buchli', 'Jonas', ''], ['Caldwell', 'Darwin G.', ''], ['Semini', 'Claudio', '']]","['Impedance control', 'torque control', 'passivity', 'stability analysis']"
5302,1510.07424,Florian Brandl,"Florian Brandl, Felix Brandt, Warut Suksompong",The Impossibility of Extending Random Dictatorship to Weak Preferences,,Economics Letters (2016) 141:44-47,10.1016/j.econlet.2016.01.028,,cs.MA cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Random dictatorship has been characterized as the only social decision scheme
that satisfies efficiency and strategyproofness when individual preferences are
strict. We show that no extension of random dictatorship to weak preferences
satisfies these properties, even when significantly weakening the required
degree of strategyproofness.
","[{'version': 'v1', 'created': 'Mon, 26 Oct 2015 09:41:00 GMT'}]",2018-04-19,"[['Brandl', 'Florian', ''], ['Brandt', 'Felix', ''], ['Suksompong', 'Warut', '']]","['Random dictatorship', 'stochastic dominance', 'Pareto-efficiency', 'strategyproofnessJEL Classifications Codes C6', 'D7', 'D8']"
5303,1408.1457,EPTCS,"Daniel Gebler (VU University Amsterdam), Simone Tini (University of
  Insubria)","Fixed-point Characterization of Compositionality Properties of
  Probabilistic Processes Combinators","In Proceedings EXPRESS/SOS 2014, arXiv:1408.1271","EPTCS 160, 2014, pp. 63-78",10.4204/EPTCS.160.7,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bisimulation metric is a robust behavioural semantics for probabilistic
processes. Given any SOS specification of probabilistic processes, we provide a
method to compute for each operator of the language its respective metric
compositionality property. The compositionality property of an operator is
defined as its modulus of continuity which gives the relative increase of the
distance between processes when they are combined by that operator. The
compositionality property of an operator is computed by recursively counting
how many times the combined processes are copied along their evolution. The
compositionality properties allow to derive an upper bound on the distance
between processes by purely inspecting the operators used to specify those
processes.
","[{'version': 'v1', 'created': 'Thu, 7 Aug 2014 01:57:06 GMT'}]",2014-08-08,"[['Gebler', 'Daniel', '', 'VU University Amsterdam'], ['Tini', 'Simone', '', 'University of\n  Insubria']]","['SOS', 'probabilistic transition systems', 'bisimulation metric', 'compositionality', 'continuity']"
5304,1908.03451,Wenmian Yang,"Wenmian Yang, Weijia Jia, Wenyuan Gao, Xiaojie Zhou, Yutao Luo","Interactive Variance Attention based Online Spoiler Detection for
  Time-Sync Comments",Accepted by CIKM 2019,,10.1145/3357384.3357872,,cs.IR cs.CL cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, time-sync comment (TSC), a new form of interactive comments, has
become increasingly popular in Chinese video websites. By posting TSCs, people
can easily express their feelings and exchange their opinions with others when
watching online videos. However, some spoilers appear among the TSCs. These
spoilers reveal crucial plots in videos that ruin people's surprise when they
first watch the video. In this paper, we proposed a novel Similarity-Based
Network with Interactive Variance Attention (SBN-IVA) to classify comments as
spoilers or not. In this framework, we firstly extract textual features of TSCs
through the word-level attentive encoder. We design Similarity-Based Network
(SBN) to acquire neighbor and keyframe similarity according to semantic
similarity and timestamps of TSCs. Then, we implement Interactive Variance
Attention (IVA) to eliminate the impact of noise comments. Finally, we obtain
the likelihood of spoiler based on the difference between the neighbor and
keyframe similarity. Experiments show SBN-IVA is on average 11.2\% higher than
the state-of-the-art method on F1-score in baselines.
","[{'version': 'v1', 'created': 'Fri, 9 Aug 2019 13:24:21 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Aug 2019 06:22:08 GMT'}]",2019-08-22,"[['Yang', 'Wenmian', ''], ['Jia', 'Weijia', ''], ['Gao', 'Wenyuan', ''], ['Zhou', 'Xiaojie', ''], ['Luo', 'Yutao', '']]","['Opinion Mining', 'Time-Sync Comments', 'Attention Mechanism', 'Spoiler Detection']"
5305,1811.01812,Ciriaco Andrea D'Angelo,"Giovanni Abramo, Ciriaco Andrea D'Angelo, Fulvio Viel",A robust benchmark for the h- and g-indexes,,"Journal of the American Society for Information Science and
  Technology, 61(6), 1275-1280 (2010)",10.1002/asi.21330,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use Hirsch's h-index as a joint proxy of the impact and productivity of a
scientist's research work continues to gain ground, accompanied by the efforts
of bibliometrists to resolve some of its critical issues, through the
application of a number of more or less sophisticated variants. However, the
literature does not reveal any appreciable attempt to overcome the objective
problems of measuring h-indexes on a large scale, for purposes of comparative
evaluation. Scientists may succeed in calculating their own h-indexes but,
being unable to compare them to those of their peers, they are unable to obtain
truly useful indications of their individual research performance. This study
proposes to overcome this gap, measuring the h- and Egghe's g-indexes of all
Italian university researchers in the hard sciences, over a 5-year window.
Descriptive statistics are provided concerning all of the 165 subject fields
examined, offering robust benchmarks for those who wish to compare their
individual performance to those of their colleagues in the same subject field.
","[{'version': 'v1', 'created': 'Mon, 5 Nov 2018 15:50:35 GMT'}]",2018-11-06,"[['Abramo', 'Giovanni', ''], [""D'Angelo"", 'Ciriaco Andrea', ''], ['Viel', 'Fulvio', '']]","['Research evaluation', 'h-index', 'g-index', 'universities', 'Italy']"
5306,1407.1061,John Jakeman,John D. Jakeman and Timothy Wildey,"Enhancing adaptive sparse grid approximations and improving refinement
  strategies using adjoint-based a posteriori error estimates",,,10.1016/j.jcp.2014.09.014,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present an algorithm for adaptive sparse grid approximations
of quantities of interest computed from discretized partial differential
equations. We use adjoint-based a posteriori error estimates of the physical
discretization error and the interpolation error in the sparse grid to enhance
the sparse grid approximation and to drive adaptivity of the sparse grid.
Utilizing these error estimates provides significantly more accurate functional
values for random samples of the sparse grid approximation. We also demonstrate
that alternative refinement strategies based upon a posteriori error estimates
can lead to further increases in accuracy in the approximation over traditional
hierarchical surplus based strategies. Throughout this paper we also provide
and test a framework for balancing the physical discretization error with the
stochastic interpolation error of the enhanced sparse grid approximation.
","[{'version': 'v1', 'created': 'Thu, 3 Jul 2014 21:07:54 GMT'}]",2015-06-22,"[['Jakeman', 'John D.', ''], ['Wildey', 'Timothy', '']]","['Uncertainty quantification', 'a posteriori error estimation', 'sparse grids', 'stochastic collocation', 'adaptivity']"
5307,1609.01743,Adrian Bulat,Adrian Bulat and Georgios Tzimiropoulos,Human pose estimation via Convolutional Part Heatmap Regression,accepted to ECCV 2016,,10.1007/978-3-319-46478-7_44,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is on human pose estimation using Convolutional Neural Networks.
Our main contribution is a CNN cascaded architecture specifically designed for
learning part relationships and spatial context, and robustly inferring pose
even for the case of severe part occlusions. To this end, we propose a
detection-followed-by-regression CNN cascade. The first part of our cascade
outputs part detection heatmaps and the second part performs regression on
these heatmaps. The benefits of the proposed architecture are multi-fold: It
guides the network where to focus in the image and effectively encodes part
constraints and context. More importantly, it can effectively cope with
occlusions because part detection heatmaps for occluded parts provide low
confidence scores which subsequently guide the regression part of our network
to rely on contextual information in order to predict the location of these
parts. Additionally, we show that the proposed cascade is flexible enough to
readily allow the integration of various CNN architectures for both detection
and regression, including recent ones based on residual learning. Finally, we
illustrate that our cascade achieves top performance on the MPII and LSP data
sets. Code can be downloaded from http://www.cs.nott.ac.uk/~psxab5/
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2016 20:25:30 GMT'}]",2018-08-28,"[['Bulat', 'Adrian', ''], ['Tzimiropoulos', 'Georgios', '']]","['Human pose estimation', 'part heatmap regression', 'Convolutional Neural Networks']"
5308,1805.06183,Tristan Vaccon,"Tristan Vaccon (XLIM-MATHIS), Thibaut Verron, Kazuhiro Yokoyama",On Affine Tropical F5 Algorithms,,"ISSAC '18: 2018 ACM International Symposium on Symbolic and
  Algebraic Computation, 2018",10.1145/3208976.3209012,,cs.SC math.AC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $K$ be a field equipped with a valuation. Tropical varieties over $K$ can
be defined with a theory of Gr{\""o}bner bases taking into account the valuation
of $K$.Because of the use of the valuation, the theory of tropical Gr{\""o}bner
bases has proved to provide settings for computations over polynomial rings
over a $p$-adic field that are more stable than that of classical Gr{\""o}bner
bases.Beforehand, these strategies were only available for homogeneous
polynomials. In this article, we extend the F5 strategy to a new definition of
tropical Gr{\""o}bner bases in an affine setting.We provide numerical examples
to illustrate time-complexity and $p$-adic stability of this tropical F5
algorithm.We also illustrate its merits as a first step before an FGLM
algorithm to compute (classical) lex bases over $p$-adics.
","[{'version': 'v1', 'created': 'Wed, 16 May 2018 08:13:25 GMT'}]",2018-06-22,"[['Vaccon', 'Tristan', '', 'XLIM-MATHIS'], ['Verron', 'Thibaut', ''], ['Yokoyama', 'Kazuhiro', '']]","['Algorithms', 'Tropical geometry', 'Gröbner bases', 'F5 algorithm', 'p-adicprecision']"
5309,1310.3312,Irfan Syamsuddin,Irfan Syamsuddin,"Multicriteria Evaluation and Sensitivity Analysis on Information
  Security",,"International Journal of Computer Applications 69(24):22-25, May
  2013",10.5120/12120-8242,,cs.CY cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Information security plays a significant role in recent information society.
Increasing number and impact of cyber attacks on information assets have
resulted the increasing awareness among managers that attack on information is
actually attack on organization itself. Unfortunately, particular model for
information security evaluation for management levels is still not well
defined. In this study, decision analysis based on Ternary Analytic Hierarchy
Process (T-AHP) is proposed as a novel model to aid managers who responsible in
making strategic evaluation related to information security issues. In
addition, sensitivity analysis is applied to extend our analysis by using
several ""what-if"" scenarios in order to measure the consistency of the final
evaluation. Finally, we conclude that the final evaluation made by managers has
a significant consistency shown by sensitivity analysis results.
","[{'version': 'v1', 'created': 'Fri, 11 Oct 2013 23:54:52 GMT'}]",2015-06-17,"[['Syamsuddin', 'Irfan', '']]","['information security', 'security evaluation', 'Analytic Hierarchy Process', 'Ternary AHP', 'sensitivity analysis']"
5310,1303.2147,Mohammad T. Irfan,Mohammad T. Irfan and Luis E. Ortiz,"On Influence, Stable Behavior, and the Most Influential Individuals in
  Networks: A Game-Theoretic Approach","Accepted to AI Journal, subject to addressing the reviewers' points
  (which are addressed in this version). An earlier version of the article
  appeared in AAAI-11","Artificial Intelligence, Volume 215, October 2014, Pages 79-119,
  ISSN 0004-3702, http://dx.doi.org/10.1016/j.artint.2014.06.004.
  (http://www.sciencedirect.com/science/article/pii/S0004370214000812)",10.1016/j.artint.2014.06.004,,cs.GT cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a new approach to the study of influence in strategic settings
where the action of an individual depends on that of others in a
network-structured way. We propose \emph{influence games} as a
\emph{game-theoretic} model of the behavior of a large but finite networked
population. Influence games allow \emph{both} positive and negative
\emph{influence factors}, permitting reversals in behavioral choices. We
embrace \emph{pure-strategy Nash equilibrium (PSNE)}, an important solution
concept in non-cooperative game theory, to formally define the \emph{stable
outcomes} of an influence game and to predict potential outcomes without
explicitly considering intricate dynamics. We address an important problem in
network influence, the identification of the \emph{most influential
individuals}, and approach it algorithmically using PSNE computation.
\emph{Computationally}, we provide (a) complexity characterizations of various
problems on influence games; (b) efficient algorithms for several special cases
and heuristics for hard cases; and (c) approximation algorithms, with provable
guarantees, for the problem of identifying the most influential individuals.
\emph{Experimentally}, we evaluate our approach using both synthetic influence
games as well as several real-world settings of general interest, each
corresponding to a separate branch of the U.S. Government.
\emph{Mathematically,} we connect influence games to important game-theoretic
models: \emph{potential and polymatrix games}.
","[{'version': 'v1', 'created': 'Fri, 8 Mar 2013 23:43:26 GMT'}, {'version': 'v2', 'created': 'Sat, 26 Oct 2013 01:40:00 GMT'}]",2016-04-12,"[['Irfan', 'Mohammad T.', ''], ['Ortiz', 'Luis E.', '']]","['Computational Game Theory', 'Social Network Analysis', 'Influence in SocialNetworks', 'Nash Equilibrium', 'Computational Complexity']"
5311,1007.5123,Secretary Ijsea,"P.Shireesha (1) and S.S.V.N.Sharma (2) ((1) KITS-Warangal, India and
  (2) Kakatiya University, India)","Building Reusable Software Component For Optimization Check in ABAP
  Coding","9 pages, 6 figures","International Journal of Software Engineering & Applications 1.3
  (2010) 38-46",10.5121/ijsea.2010.1303,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Software component reuse is the software engineering practice of developing
new software products from existing components. A reuse library or component
reuse repository organizes stores and manages reusable components. This paper
describes how a reusable component is created, how it reuses the function and
checking if optimized code is being used in building programs and applications.
Finally providing coding guidelines, standards and best practices used for
creating reusable components and guidelines and best practices for making
configurable and easy to use.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2010 06:53:20 GMT'}]",2010-07-30,"[['Shireesha', 'P.', ''], ['Sharma', 'S. S. V. N.', '']]","['Software Reuse', 'Reusable Component', 'Function Module', 'Tips and Tricks']"
5312,1812.06474,Victor Sanchez-Anguix Dr.,"Victor Sanchez-Anguix, Rithin Chalumuri, Reyhan Aydogan, Vicente
  Julian","A near Pareto optimal approach to student-supervisor allocation with two
  sided preferences and workload balance",,"Applied Soft Computing, 2018",10.1016/j.asoc.2018.11.049,,cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of allocating students to supervisors for the development of a
personal project or a dissertation is a crucial activity in the higher
education environment, as it enables students to get feedback on their work
from an expert and improve their personal, academic, and professional
abilities. In this article, we propose a multi-objective and near Pareto
optimal genetic algorithm for the allocation of students to supervisors. The
allocation takes into consideration the students and supervisors' preferences
on research/project topics, the lower and upper supervision quotas of
supervisors, as well as the workload balance amongst supervisors. We introduce
novel mutation and crossover operators for the student-supervisor allocation
problem. The experiments carried out show that the components of the genetic
algorithm are more apt for the problem than classic components, and that the
genetic algorithm is capable of producing allocations that are near Pareto
optimal in a reasonable time.
","[{'version': 'v1', 'created': 'Sun, 16 Dec 2018 15:01:55 GMT'}]",2018-12-18,"[['Sanchez-Anguix', 'Victor', ''], ['Chalumuri', 'Rithin', ''], ['Aydogan', 'Reyhan', ''], ['Julian', 'Vicente', '']]","['genetic algorithms', 'student-project allocation', 'matching', 'Paretooptimal', 'artificial intelligence']"
5313,1501.02344,Marwane  Ben Hcine,"Marwane Ben Hcine, Ridha Bouallegue","Fitting the Log Skew Normal to the Sum of Independent Lognormals
  Distribution","15 pages, 7 figures, NeTCoM, CSIT, GRAPH-HOC, SPTM - 2014",,10.5121/csit.2014.41305,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sums of lognormal random variables (RVs) occur in many important problems in
wireless communications especially in interferences calculation. Several
methods have been proposed to approximate the lognormal sum distribution. Most
of them requires lengthy Monte Carlo simulations, or advanced slowly converging
numerical integrations for curve fitting and parameters estimation. Recently,
it has been shown that the log skew normal distribution can offer a tight
approximation to the lognormal sum distributed RVs. We propose a simple and
accurate method for fitting the log skew normal distribution to lognormal sum
distribution. We use moments and tails slope matching technique to find optimal
log skew normal distribution parameters. We compare our method with those in
literature in terms of complexity and accuracy. We conclude that our method has
same accuracy than other methods but more simple. To further validate our
approach, we provide an example for outage probability calculation in lognormal
shadowing environment based on log skew normal approximation.
","[{'version': 'v1', 'created': 'Sat, 10 Jan 2015 12:34:27 GMT'}]",2015-01-13,"[['Hcine', 'Marwane Ben', ''], ['Bouallegue', 'Ridha', '']]","['Lognormal sum', 'log skew normal', 'moment matching', 'asymptotic approximation', 'outage probability', 'shadowing environment']"
5314,1705.05458,Ivan P Yamshchikov,Ivan P. Yamshchikov and Alexey Tikhonov,"Music generation with variational recurrent autoencoder supported by
  history",,,10.1007/s42452-020-03715-w,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new architecture of an artificial neural network that helps to generate
longer melodic patterns is introduced alongside with methods for
post-generation filtering. The proposed approach called variational autoencoder
supported by history is based on a recurrent highway gated network combined
with a variational autoencoder. Combination of this architecture with filtering
heuristics allows generating pseudo-live acoustically pleasing and melodically
diverse music.
","[{'version': 'v1', 'created': 'Mon, 15 May 2017 21:21:06 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Jul 2017 16:49:13 GMT'}, {'version': 'v3', 'created': 'Fri, 14 Jul 2017 21:23:24 GMT'}, {'version': 'v4', 'created': 'Mon, 12 Nov 2018 22:27:43 GMT'}]",2021-05-21,"[['Yamshchikov', 'Ivan P.', ''], ['Tikhonov', 'Alexey', '']]","['Music generation', 'Recurrent neural networks', 'Discrete sequences generation', 'Artificial Intelligence', 'Variational Recurrent Autoencoder']"
5315,1809.07950,Wonjin Yoon,"Wonjin Yoon, Chan Ho So, Jinhyuk Lee, Jaewoo Kang","CollaboNet: collaboration of deep neural networks for biomedical named
  entity recognition","From DTMBio workshop at CIKM 2018, Turin, Italy. 22-26 October 2018","BMC Bioinformatics 2019, 20(Suppl 10):249",10.1186/s12859-019-2813-6,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Finding biomedical named entities is one of the most essential
tasks in biomedical text mining. Recently, deep learning-based approaches have
been applied to biomedical named entity recognition (BioNER) and showed
promising results. However, as deep learning approaches need an abundant amount
of training data, a lack of data can hinder performance. BioNER datasets are
scarce resources and each dataset covers only a small subset of entity types.
Furthermore, many bio entities are polysemous, which is one of the major
obstacles in named entity recognition. Results: To address the lack of data and
the entity type misclassification problem, we propose CollaboNet which utilizes
a combination of multiple NER models. In CollaboNet, models trained on a
different dataset are connected to each other so that a target model obtains
information from other collaborator models to reduce false positives. Every
model is an expert on their target entity type and takes turns serving as a
target and a collaborator model during training time. The experimental results
show that CollaboNet can be used to greatly reduce the number of false
positives and misclassified entities including polysemous words. CollaboNet
achieved state-of-the-art performance in terms of precision, recall and F1
score. Conclusions: We demonstrated the benefits of combining multiple models
for BioNER. Our model has successfully reduced the number of misclassified
entities and improved the performance by leveraging multiple datasets annotated
for different entity types. Given the state-of-the-art performance of our
model, we believe that CollaboNet can improve the accuracy of downstream
biomedical text mining applications such as bio-entity relation extraction.
","[{'version': 'v1', 'created': 'Fri, 21 Sep 2018 05:48:54 GMT'}, {'version': 'v2', 'created': 'Wed, 29 May 2019 16:34:50 GMT'}]",2019-05-30,"[['Yoon', 'Wonjin', ''], ['So', 'Chan Ho', ''], ['Lee', 'Jinhyuk', ''], ['Kang', 'Jaewoo', '']]","['NER', 'Deep learning', 'Named entity recognition', 'Text mining']"
5316,1404.1295,Emilio Ferrara,"Emilio Ferrara and Pasquale De Meo and Salvatore Catanese and Giacomo
  Fiumara",Detecting criminal organizations in mobile phone networks,"http://www.sciencedirect.com/science/article/pii/S0957417414001614.
  Expert Systems with Applications, 2014","Expert Systems with Applications, 41(13), 5733-5750. 2014",10.1016/j.eswa.2014.03.024,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The study of criminal networks using traces from heterogeneous communication
media is acquiring increasing importance in nowadays society. The usage of
communication media such as phone calls and online social networks leaves
digital traces in the form of metadata that can be used for this type of
analysis. The goal of this work is twofold: first we provide a theoretical
framework for the problem of detecting and characterizing criminal
organizations in networks reconstructed from phone call records. Then, we
introduce an expert system to support law enforcement agencies in the task of
unveiling the underlying structure of criminal networks hidden in communication
data. This platform allows for statistical network analysis, community
detection and visual exploration of mobile phone network data. It allows
forensic investigators to deeply understand hierarchies within criminal
organizations, discovering members who play central role and provide connection
among sub-groups. Our work concludes illustrating the adoption of our
computational framework for a real-word criminal investigation.
","[{'version': 'v1', 'created': 'Thu, 3 Apr 2014 14:44:29 GMT'}]",2017-03-07,"[['Ferrara', 'Emilio', ''], ['De Meo', 'Pasquale', ''], ['Catanese', 'Salvatore', ''], ['Fiumara', 'Giacomo', '']]","['criminal networks', 'community detection', 'criminal communities']"
5317,2209.00320,Md Naimul Hoque,"Md Naimul Hoque, Bhavya Ghai, Niklas Elmqvist","DramatVis Personae: Visual Text Analytics for Identifying Social Biases
  in Creative Writing",,"ACM Conference on Designing Interactive Systems (DIS), 2022",10.1145/3532106.3533526,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Implicit biases and stereotypes are often pervasive in different forms of
creative writing such as novels, screenplays, and children's books. To
understand the kind of biases writers are concerned about and how they mitigate
those in their writing, we conducted formative interviews with nine writers.
The interviews suggested that despite a writer's best interest, tracking and
managing implicit biases such as a lack of agency, supporting or submissive
roles, or harmful language for characters representing marginalized groups is
challenging as the story becomes longer and complicated. Based on the
interviews, we developed DramatVis Personae (DVP), a visual analytics tool that
allows writers to assign social identities to characters, and evaluate how
characters and different intersectional social identities are represented in
the story. To evaluate DVP, we first conducted think-aloud sessions with three
writers and found that DVP is easy-to-use, naturally integrates into the
writing process, and could potentially help writers in several critical bias
identification tasks. We then conducted a follow-up user study with 11 writers
and found that participants could answer questions related to bias detection
more efficiently using DVP in comparison to a simple text editor.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2022 09:42:41 GMT'}]",2022-09-02,"[['Hoque', 'Md Naimul', ''], ['Ghai', 'Bhavya', ''], ['Elmqvist', 'Niklas', '']]","['Creative writing', 'bias', 'visualization', 'NLP']"
5318,0903.2914,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",A process calculus with finitary comprehended terms,"25 pages, combined with arXiv:0901.3012 [math.RA]; presentation
  improved, mistakes in Table 5 corrected","Theory of Computing Systems, 53(4):645--668, 2013",10.1007/s00224-013-9468-x,,cs.LO math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the notion of an ACP process algebra and the notion of a meadow
enriched ACP process algebra. The former notion originates from the models of
the axiom system ACP. The latter notion is a simple generalization of the
former notion to processes in which data are involved, the mathematical
structure of data being a meadow. Moreover, for all associative operators from
the signature of meadow enriched ACP process algebras that are not of an
auxiliary nature, we introduce variable-binding operators as generalizations.
These variable-binding operators, which give rise to comprehended terms, have
the property that they can always be eliminated. Thus, we obtain a process
calculus whose terms can be interpreted in all meadow enriched ACP process
algebras. Use of the variable-binding operators can have a major impact on the
size of terms.
","[{'version': 'v1', 'created': 'Tue, 17 Mar 2009 07:19:00 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Mar 2011 10:46:34 GMT'}, {'version': 'v3', 'created': 'Thu, 28 Mar 2013 11:55:20 GMT'}]",2013-08-07,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['ACP process algebra', 'meadow enriched ACP process algebra', 'variable-binding operator', 'comprehended term', 'process calculus']"
5319,1612.09436,Abhiruk Lahiri,"Arpitha P. Bharathi, Minati De and Abhiruk Lahiri",Circular Separation Dimension of a Subclass of Planar Graphs,"13 pages, 8 figures","Discrete Mathematics & Theoretical Computer Science, Vol. 19 no.
  3, Graph Theory (November 3, 2017) dmtcs:4031",10.23638/DMTCS-19-3-8,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A pair of non-adjacent edges is said to be separated in a circular ordering
of vertices, if the endpoints of the two edges do not alternate in the
ordering. The circular separation dimension of a graph $G$, denoted by
$\pi^\circ(G)$, is the minimum number of circular orderings of the vertices of
$G$ such that every pair of non-adjacent edges is separated in at least one of
the circular orderings. This notion is introduced by Loeb and West in their
recent paper. In this article, we consider two subclasses of planar graphs,
namely $2$-outerplanar graphs and series-parallel graphs. A $2$-outerplanar
graph has a planar embedding such that the subgraph obtained by removal of the
vertices of the exterior face is outerplanar. We prove that if $G$ is
$2$-outerplanar then $\pi^\circ(G) = 2$. We also prove that if $G$ is a
series-parallel graph then $\pi^\circ(G) \leq 2$.
","[{'version': 'v1', 'created': 'Fri, 30 Dec 2016 09:48:48 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Oct 2017 10:48:02 GMT'}]",2019-03-14,"[['Bharathi', 'Arpitha P.', ''], ['De', 'Minati', ''], ['Lahiri', 'Abhiruk', '']]","['Circular separation dimension', 'planar graph', '2-outerplanar graph', 'series-parallel graph']"
5320,1312.0821,Renyuan Zhang,"Renyuan Zhang, Kai Cai, Yongmei Gan, W.M. Wonham","Delay-Robustness in Distributed Control of Timed Discrete-Event Systems
  Based on Supervisor Localization",,"International Journal of Control, vol. 89, no. 10, pp. 2055-2072,
  Oct. 2016",10.1080/00207179.2016.1147606,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently we studied communication delay in distributed control of untimed
discrete-event systems based on supervisor localization. We proposed a property
called delay-robustness: the overall system behavior controlled by distributed
controllers with communication delay is logically equivalent to its delay-free
counterpart. In this paper we extend our previous work to timed discrete-event
systems, in which communication delays are counted by a special clock event
{\it tick}. First, we propose a timed channel model and define timed
delay-robustness; for the latter, a polynomial verification procedure is
presented. Next, if the delay-robust property does not hold, we introduce
bounded delay-robustness, and present an algorithm to compute the maximal delay
bound (measured by number of ticks) for transmitting a channeled event.
Finally, we demonstrate delay-robustness on the example of an under-load
tap-changing transformer.
","[{'version': 'v1', 'created': 'Tue, 3 Dec 2013 13:47:56 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Dec 2013 08:26:33 GMT'}, {'version': 'v3', 'created': 'Fri, 5 Sep 2014 15:36:29 GMT'}]",2017-05-02,"[['Zhang', 'Renyuan', ''], ['Cai', 'Kai', ''], ['Gan', 'Yongmei', ''], ['Wonham', 'W. M.', '']]","['Timed Discrete-Event Systems', 'Distributed Supervisory Control', 'Supervisor Localization', 'Delay']"
5321,1903.00663,Eric Monteiro,Eric Monteiro and Elena Parmiggiani,Synthetic Knowing: The Politics of the Internet of Things,,"MIS Quarterly, 2019, vol. 43, no. 1, pp. 167 - 184",10.25300/MISQ/2019/13799,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  All knowing is material. The challenge for Information Systems (IS) research
is to specify how knowing is material by drawing on theoretical
characterizations of the digital. Synthetic knowing is knowing informed by
theorizing digital materiality. We focus on two defining qualities:
liquefaction (unhinging digital representations from physical objects,
qualities, or processes) and open-endedness (extendable and generative). The
Internet of Things (IoT) is crucial because sensors are vehicles of
liquefaction. Their expanding scope for real-time seeing, hearing, tasting,
smelling, and touching increasingly mimics phenomenologically perceived
reality. Empirically, we present a longitudinal case study of IoT-rendered
marine environmental monitoring by an oil and gas company operating in the
politically contested Arctic. We characterize synthetic knowing into four
concepts, the former three tied to liquefaction and the latter to
open-endedness: (i) the objects of knowing are algorithmic phenomena; (ii) the
sensors increasingly conjure up phenomenological reality; (iii) knowing is
scoped (configurable); and (iv) open knowing/data is politically charged.
","[{'version': 'v1', 'created': 'Sat, 2 Mar 2019 09:30:23 GMT'}]",2019-03-05,"[['Monteiro', 'Eric', ''], ['Parmiggiani', 'Elena', '']]","['Knowing', 'synthetic situation', 'Internet of Things (IoT)', 'digitalization', 'politics']"
5322,1811.02944,Antoine Amarilli,"Antoine Amarilli, Florent Capelli, Mika\""el Monet, Pierre Senellart",Connecting Knowledge Compilation Classes and Width Parameters,"46 pages. Extended version of arXiv:1709.06188. Up to the stylesheet,
  page/environment numbering, minor formatting, and publisher-induced changes,
  this is the exact content of the paper in Theory of Computing Systems
  <https://link.springer.com/article/10.1007%2Fs00224-019-09930-2>. The
  difference in the titles (missing ""and"") is an error introduced by the
  publisher",,10.1007/s00224-019-09930-2,,cs.DB cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The field of knowledge compilation establishes the tractability of many tasks
by studying how to compile them to Boolean circuit classes obeying some
requirements such as structuredness, decomposability, and determinism. However,
in other settings such as intensional query evaluation on databases, we obtain
Boolean circuits that satisfy some width bounds, e.g., they have bounded
treewidth or pathwidth. In this work, we give a systematic picture of many
circuit classes considered in knowledge compilation and show how they can be
systematically connected to width measures, through upper and lower bounds. Our
upper bounds show that bounded-treewidth circuits can be constructively
converted to d-SDNNFs, in time linear in the circuit size and singly
exponential in the treewidth; and that bounded-pathwidth circuits can similarly
be converted to uOBDDs. We show matching lower bounds on the compilation of
monotone DNF or CNF formulas to structured targets, assuming a constant bound
on the arity (size of clauses) and degree (number of occurrences of each
variable): any d-SDNNF (resp., SDNNF) for such a DNF (resp., CNF) must be of
exponential size in its treewidth, and the same holds for uOBDDs (resp.,
n-OBDDs) when considering pathwidth. Unlike most previous work, our bounds
apply to any formula of this class, not just a well-chosen family. Hence, we
show that pathwidth and treewidth respectively characterize the efficiency of
compiling monotone DNFs to uOBDDs and d-SDNNFs with compilation being singly
exponential in the corresponding width parameter. We also show that our lower
bounds on CNFs extend to unstructured compilation targets, with an exponential
lower bound in the treewidth (resp., pathwidth) when compiling monotone CNFs of
constant arity and degree to DNNFs (resp., nFBDDs).
","[{'version': 'v1', 'created': 'Wed, 7 Nov 2018 15:45:43 GMT'}, {'version': 'v2', 'created': 'Sat, 20 Jul 2019 09:13:04 GMT'}]",2022-01-20,"[['Amarilli', 'Antoine', ''], ['Capelli', 'Florent', ''], ['Monet', 'Mikaël', ''], ['Senellart', 'Pierre', '']]","['Knowledge compilation', 'Boolean circuits', 'd-DNNFs', 'OBDDs', 'treewidth', 'pathwidth']"
5323,1903.03425,Thilo Hagendorff,Thilo Hagendorff,The Ethics of AI Ethics -- An Evaluation of Guidelines,"16 pages, 1 table","Minds & Machines, 2020",10.1007/s11023-020-09517-8,,cs.AI cs.CY cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current advances in research, development and application of artificial
intelligence (AI) systems have yielded a far-reaching discourse on AI ethics.
In consequence, a number of ethics guidelines have been released in recent
years. These guidelines comprise normative principles and recommendations aimed
to harness the ""disruptive"" potentials of new AI technologies. Designed as a
comprehensive evaluation, this paper analyzes and compares these guidelines
highlighting overlaps but also omissions. As a result, I give a detailed
overview of the field of AI ethics. Finally, I also examine to what extent the
respective ethical principles and values are implemented in the practice of
research, development and application of AI systems - and how the effectiveness
in the demands of AI ethics can be improved.
","[{'version': 'v1', 'created': 'Thu, 28 Feb 2019 15:50:35 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Oct 2019 08:44:31 GMT'}]",2020-02-25,"[['Hagendorff', 'Thilo', '']]","['artificial intelligence', 'machine learning', 'ethics', 'guidelines', 'implementation']"
5324,1802.05951,Henry Edison,"Henry Edison and Xiaofeng Wang and Ronald Jabangwe and Pekka
  Abrahamsson","Innovation Initiatives in Large Software Companies: A Systematic Mapping
  Study",,"Henry Edison, Xiaofeng Wang, Ronald Jabangwe, Pekka Abrahamsson
  (2018). Innovation Initiatives in Large Software Companies: A Systematic
  Mapping Study. Information and Software Technology, 95:1--14",10.1016/j.infsof.2017.12.007,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  To keep the competitive advantage and adapt to changes in the market and
technology, companies need to innovate in an organised, purposeful and
systematic manner. However, due to their size and complexity, large companies
tend to focus on maintaining their business, which can potentially lower their
agility to innovate. This study aims to provide an overview of the current
research on innovation initiatives and to identify the challenges of
implementing the initiatives in the context of large software companies. The
investigation was performed using a systematic mapping approach of published
literature on corporate innovation and entrepreneurship. Then it was
complemented with interviews with four experts with rich industry experience.
Our study results suggest that, there is a lack of high quality empirical
studies on innovation initiative in the context of large software companies. A
total of 7 studies are conducted in such context, which reported 5 types of
initiatives: intrapreneurship, bootlegging, internal venture, spin-off and
crowdsourcing. Our study offers three contributions. First, this paper
represents the map of existing literature on innovation initiatives inside
large companies. The second contribution is to provide an innovation initiative
tree. The third contribution is to identify key challenges faced by each
initiative in large software companies. At the strategic and tactical levels,
there is no difference between large software companies and other companies. At
the operational level, large software companies are highly influenced by the
advancement of Internet technology. Large software companies use open
innovation paradigm as part of their innovation initiatives. We envision a
future work is to further empirically evaluate the innovation initiative tree
in large software companies, which involves more practitioners from different
companies.
","[{'version': 'v1', 'created': 'Fri, 16 Feb 2018 14:37:04 GMT'}]",2018-02-19,"[['Edison', 'Henry', ''], ['Wang', 'Xiaofeng', ''], ['Jabangwe', 'Ronald', ''], ['Abrahamsson', 'Pekka', '']]","['innovation', 'innovation initiative', 'corporate innovation', 'corporate entrepreneurship', 'large software companies', 'systematic mappingstudy']"
5325,1312.2884,Muhammad Usman  Sheikh,"Muhammad Usman Sheikh, Jukka Lempiainen","Advanced Antenna Techniques and High Order Sectorization with Novel
  Network Tessellation for Enhancing Macro Cell Capacity in DC-HSDPA Network","20 pages, 18 Figures, and 5 Tables","International Journal of Wireless and Mobile Networks (IJWMN).
  Vol.5, No.5, October 2013",10.5121/ijwmn.2013.5505,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile operators commonly use macro cells with traditional wide beam antennas
for wider coverage in the cell, but future capacity demands cannot be achieved
by using them only. It is required to achieve maximum practical capacity from
macro cells by employing higher order sectorization and by utilizing all
possible antenna solutions including smart antennas. This paper presents
enhanced tessellation for 6-sector sites and proposes novel layout for
12-sector sites. The main target of this paper is to compare the performance of
conventional wide beam antenna, switched beam smart antenna, adaptive beam
antenna and different network layouts in terms of offering better received
signal quality and user throughput. Splitting macro cell into smaller micro or
pico cells can improve the capacity of network, but this paper highlights the
importance of higher order sectorization and advance antenna techniques to
attain high Signal to Interference plus Noise Ratio (SINR), along with improved
network capacity. Monte Carlo simulations at system level were done for Dual
Cell High Speed Downlink Packet Access (DC-HSDPA) technology with multiple
(five) users per Transmission Time Interval (TTI) at different Intersite
Distance (ISD). The obtained results validate and estimate the gain of using
smart antennas and higher order sectorization with proposed network layout.
","[{'version': 'v1', 'created': 'Tue, 10 Dec 2013 17:19:28 GMT'}]",2013-12-11,"[['Sheikh', 'Muhammad Usman', ''], ['Lempiainen', 'Jukka', '']]","['System capacity', 'Sectorization', 'Advanced antenna techniques', 'Switched beam antenna', 'Adaptive antenna', 'Dual Cell High Speed Downlink Packet Access']"
5326,1201.1972,Abdelhakim Khlifi,Abdelhakim Khlifi and Ridha Bouallegue,Hybrid LS-LMMSE Channel Estimation Technique for LTE Downlink Systems,"13 pages, 11 figures","International Journal of Next Generation Networks (IJNGN) Vol.3,
  No.4, December 2011, 1-13",10.5121/ijngn.2011.3401,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose to improve the performance of the channel
estimation for LTE Downlink systems under the effect of the channel length. As
LTE Downlink system is a MIMO-OFDMA based system, a cyclic prefix (CP) is
inserted at the beginning of each transmitted OFDM symbol in order to mitigate
both inter-carrier interference (ICI) and inter-symbol interference (ISI). The
inserted CP is usually equal to or longer than the channel length. However, the
cyclic prefix can be shorter because of some unforeseen channel behaviour.
Previous works have shown that in the case where the cyclic prefix is equal to
or longer than the channel length, LMMSE performs better than LSE but at the
cost of computational complexity .In the other case, LMMSE performs also better
than LS only for low SNR values. However, LS shows better performance for LTE
Downlink systems for high SNR values. Therefore, we propose a hybrid LS-LMMSE
channel estimation technique robust to the channel length effect. MATLAB
Monte-Carlo simulations are used to evaluate the performance of the proposed
estimator in terms of Mean Square Error (MSE) and Bit Error Rate (BER) for 2x2
LTE Downlink systems.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2012 06:14:26 GMT'}]",2012-01-11,"[['Khlifi', 'Abdelhakim', ''], ['Bouallegue', 'Ridha', '']]","['LTE', 'MIMO', 'OFDM', 'cyclic prefix', 'channel length', 'LS', 'LMMSE']"
5327,1606.07414,Renato J Cintra,"T. L. T. Silveira, R. S. Oliveira, F. M. Bayer, R. J. Cintra, A.
  Madanayake","Multiplierless 16-point DCT Approximation for Low-complexity Image and
  Video Coding","12 pages, 5 figures, 3 tables",,10.1007/s11760-016-0923-4,,cs.CV cs.MM cs.NA stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An orthogonal 16-point approximate discrete cosine transform (DCT) is
introduced. The proposed transform requires neither multiplications nor
bit-shifting operations. A fast algorithm based on matrix factorization is
introduced, requiring only 44 additions---the lowest arithmetic cost in
literature. To assess the introduced transform, computational complexity,
similarity with the exact DCT, and coding performance measures are computed.
Classical and state-of-the-art 16-point low-complexity transforms were used in
a comparative analysis. In the context of image compression, the proposed
approximation was evaluated via PSNR and SSIM measurements, attaining the best
cost-benefit ratio among the competitors. For video encoding, the proposed
approximation was embedded into a HEVC reference software for direct comparison
with the original HEVC standard. Physically realized and tested using FPGA
hardware, the proposed transform showed 35% and 37% improvements of area-time
and area-time-squared VLSI metrics when compared to the best competing
transform in the literature.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2016 19:26:01 GMT'}]",2016-06-24,"[['Silveira', 'T. L. T.', ''], ['Oliveira', 'R. S.', ''], ['Bayer', 'F. M.', ''], ['Cintra', 'R. J.', ''], ['Madanayake', 'A.', '']]","['DCT approximation', 'Fast algorithm', 'Low cost algorithms', 'Image compression', 'Video coding']"
5328,1912.04832,Lukas Pfannschmidt,"Lukas Pfannschmidt, Jonathan Jakob, Fabian Hinder, Michael Biehl,
  Peter Tino, Barbara Hammer","Feature Relevance Determination for Ordinal Regression in the Context of
  Feature Redundancies and Privileged Information",Preprint accepted at Neurocomputing,,10.1016/j.neucom.2019.12.133,,cs.LG cs.IR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advances in machine learning technologies have led to increasingly powerful
models in particular in the context of big data. Yet, many application
scenarios demand for robustly interpretable models rather than optimum model
accuracy; as an example, this is the case if potential biomarkers or causal
factors should be discovered based on a set of given measurements. In this
contribution, we focus on feature selection paradigms, which enable us to
uncover relevant factors of a given regularity based on a sparse model. We
focus on the important specific setting of linear ordinal regression, i.e.\
data have to be ranked into one of a finite number of ordered categories by a
linear projection. Unlike previous work, we consider the case that features are
potentially redundant, such that no unique minimum set of relevant features
exists. We aim for an identification of all strongly and all weakly relevant
features as well as their type of relevance (strong or weak); we achieve this
goal by determining feature relevance bounds, which correspond to the minimum
and maximum feature relevance, respectively, if searched over all equivalent
models. In addition, we discuss how this setting enables us to substitute some
of the features, e.g.\ due to their semantics, and how to extend the framework
of feature relevance intervals to the setting of privileged information, i.e.\
potentially relevant information is available for training purposes only, but
cannot be used for the prediction itself.
","[{'version': 'v1', 'created': 'Tue, 10 Dec 2019 17:20:18 GMT'}]",2020-05-07,"[['Pfannschmidt', 'Lukas', ''], ['Jakob', 'Jonathan', ''], ['Hinder', 'Fabian', ''], ['Biehl', 'Michael', ''], ['Tino', 'Peter', ''], ['Hammer', 'Barbara', '']]","['Global Feature Relevance', 'Feature Selection', 'Interpretability', 'Ordinal Regression', 'Privileged Information']"
5329,1109.0359,Srinath T R,"T. R. Srinath, Mahendra Pratap Singh and Alwyn Roshan Pais",Anonymity and verifiability in multi-attribute reverse auction,"9 pages, 1 figure and 2 tables","International Journal of Information Technology Convergence and
  Services (IJITCS) Vol.1, No.4, August 2011",10.5121/ijitcs.2011.1401,,cs.CR,http://creativecommons.org/licenses/by/3.0/,"  The use of e-Auction services has been increasing in recent years. Security
requirements in conducting e-Auctions are mainly bid privacy, anonymity and
public verifiability. Most of the secure protocols concentrate on privacy and
anonymity, which are achieved through bidder-resolved multi-party computation,
assuming two or more trusted third parties, either through numerous auctioneers
or with asymmetric models in which the commercial entity of an auction issuer
or registration manager is assumed in addition to the auctioneer.
Multi-attribute reverse auctions promise higher market efficiency and effective
information exchange. This work extends and uses the existing schemes. This
scheme uses scoring function, winner determination in multi-attribute auctions
to implement public verifiability. Anonymity is achieved through bidder side
pseudonym generation. By results and analysis we say this is very simple and
effective scheme. This scheme ensures public verifiability and anonymity in
multi-attribute auctions without revelation of the bids received, third parties
and complex communications.
","[{'version': 'v1', 'created': 'Fri, 2 Sep 2011 05:20:05 GMT'}]",2011-09-05,"[['Srinath', 'T. R.', ''], ['Singh', 'Mahendra Pratap', ''], ['Pais', 'Alwyn Roshan', '']]","['Anonymity', 'E-Commerce', 'E-Auction', 'multi-attribute auction', 'Procurement', 'Public verifiability', 'Security']"
5330,1602.00020,Holger Roth,"Holger R. Roth, Yinong Wang, Jianhua Yao, Le Lu, Joseph E. Burns,
  Ronald M. Summers","Deep convolutional networks for automated detection of posterior-element
  fractures on spine CT","To be presented at SPIE Medical Imaging, 2016, San Diego",,10.1117/12.2217146,,cs.CV,http://creativecommons.org/publicdomain/zero/1.0/,"  Injuries of the spine, and its posterior elements in particular, are a common
occurrence in trauma patients, with potentially devastating consequences.
Computer-aided detection (CADe) could assist in the detection and
classification of spine fractures. Furthermore, CAD could help assess the
stability and chronicity of fractures, as well as facilitate research into
optimization of treatment paradigms.
  In this work, we apply deep convolutional networks (ConvNets) for the
automated detection of posterior element fractures of the spine. First, the
vertebra bodies of the spine with its posterior elements are segmented in spine
CT using multi-atlas label fusion. Then, edge maps of the posterior elements
are computed. These edge maps serve as candidate regions for predicting a set
of probabilities for fractures along the image edges using ConvNets in a 2.5D
fashion (three orthogonal patches in axial, coronal and sagittal planes). We
explore three different methods for training the ConvNet using 2.5D patches
along the edge maps of 'positive', i.e. fractured posterior-elements and
'negative', i.e. non-fractured elements.
  An experienced radiologist retrospectively marked the location of 55
displaced posterior-element fractures in 18 trauma patients. We randomly split
the data into training and testing cases. In testing, we achieve an
area-under-the-curve of 0.857. This corresponds to 71% or 81% sensitivities at
5 or 10 false-positives per patient, respectively. Analysis of our set of
trauma patients demonstrates the feasibility of detecting posterior-element
fractures in spine CT images using computer vision techniques such as deep
convolutional networks.
","[{'version': 'v1', 'created': 'Fri, 29 Jan 2016 21:48:13 GMT'}]",2016-09-21,"[['Roth', 'Holger R.', ''], ['Wang', 'Yinong', ''], ['Yao', 'Jianhua', ''], ['Lu', 'Le', ''], ['Burns', 'Joseph E.', ''], ['Summers', 'Ronald M.', '']]","['spine CT', 'computer-aided detection', 'posterior-element fractures', 'deep learning']"
5331,1904.03336,Wensheng Gan,"Wensheng Gan, Jerry Chun-Wei Lin, Han-Chieh Chao, Hamido Fujita and
  Philip S. Yu",Correlated Utility-based Pattern Mining,"Elsevier Information Science, 15 pages","Information Sciences, 2019",10.1016/j.ins.2019.07.005,504: 470-486,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the field of data mining and analytics, the utility theory from Economic
can bring benefits in many real-life applications. In recent decade, a new
research field called utility-oriented mining has already attracted great
attention. Previous studies have, however, the limitation that they rarely
consider the inherent correlation of items among patterns. Consider the
purchase behaviors of consumer, a high-utility group of products (w.r.t.
multi-products) may contain several very high-utility products with some
low-utility products. However, it is considered as a valuable pattern even if
this behavior/pattern may be not highly correlated, or even happen by chance.
In this paper, in light of these challenges, we propose an efficient utility
mining approach namely non-redundant Correlated high-Utility Pattern Miner
(CoUPM) by taking positive correlation and profitable value into account. The
derived patterns with high utility and strong positive correlation can lead to
more insightful availability than those patterns only have high profitable
values. The utility-list structure is revised and applied to store necessary
information of both correlation and utility. Several pruning strategies are
further developed to improve the efficiency for discovering the desired
patterns. Experimental results show that the non-redundant correlated
high-utility patterns have more effectiveness than some other kinds of
interesting patterns. Moreover, efficiency of the proposed CoUPM algorithm
significantly outperforms the state-of-the-art algorithm.
","[{'version': 'v1', 'created': 'Sat, 6 Apr 2019 01:54:57 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Apr 2019 03:23:29 GMT'}]",2019-09-13,"[['Gan', 'Wensheng', ''], ['Lin', 'Jerry Chun-Wei', ''], ['Chao', 'Han-Chieh', ''], ['Fujita', 'Hamido', ''], ['Yu', 'Philip S.', '']]","['Economic', 'utility mining', 'positive correlation', 'pruning strategy']"
5332,2009.09945,Wenjie Wang,"Wenjie Wang, Fuli Feng, Xiangnan He, Hanwang Zhang, Tat-Seng Chua","Clicks can be Cheating: Counterfactual Recommendation for Mitigating
  Clickbait Issue",Accepted by SIGIR 2021,"Proceedings of the 44th International ACM SIGIR Conference on
  Research and Development in Information Retrieval (SIGIR 2021)",10.1145/3404835.3462962,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommendation is a prevalent and critical service in information systems. To
provide personalized suggestions to users, industry players embrace machine
learning, more specifically, building predictive models based on the click
behavior data. This is known as the Click-Through Rate (CTR) prediction, which
has become the gold standard for building personalized recommendation service.
However, we argue that there is a significant gap between clicks and user
satisfaction -- it is common that a user is ""cheated"" to click an item by the
attractive title/cover of the item. This will severely hurt user's trust on the
system if the user finds the actual content of the clicked item disappointing.
What's even worse, optimizing CTR models on such flawed data will result in the
Matthew Effect, making the seemingly attractive but actually low-quality items
be more frequently recommended.
  In this paper, we formulate the recommendation models as a causal graph that
reflects the cause-effect factors in recommendation, and address the clickbait
issue by performing counterfactual inference on the causal graph. We imagine a
counterfactual world where each item has only exposure features (i.e., the
features that the user can see before making a click decision). By estimating
the click likelihood of a user in the counterfactual world, we are able to
reduce the direct effect of exposure features and eliminate the clickbait
issue. Experiments on real-world datasets demonstrate that our method
significantly improves the post-click satisfaction of CTR models.
","[{'version': 'v1', 'created': 'Mon, 21 Sep 2020 15:08:10 GMT'}, {'version': 'v2', 'created': 'Sun, 27 Sep 2020 02:33:42 GMT'}, {'version': 'v3', 'created': 'Thu, 22 Apr 2021 04:23:51 GMT'}, {'version': 'v4', 'created': 'Sat, 22 May 2021 06:08:04 GMT'}]",2021-05-25,"[['Wang', 'Wenjie', ''], ['Feng', 'Fuli', ''], ['He', 'Xiangnan', ''], ['Zhang', 'Hanwang', ''], ['Chua', 'Tat-Seng', '']]","['Counterfactual', 'Clickbait Issue', 'Counterfactual Recommendation']"
5333,1209.0735,Darko Veberic,Darko Veberic,Lambert W Function for Applications in Physics,"9 pages, 12 figures. Extended version of arXiv:1003.1628, updated
  link to sources",Computer Physics Communications 183 (2012) 2622-2628,10.1016/j.cpc.2012.07.008,,cs.MS cs.NA physics.comp-ph,http://creativecommons.org/licenses/by/4.0/,"  The Lambert W(x) function and its possible applications in physics are
presented. The actual numerical implementation in C++ consists of Halley's and
Fritsch's iterations with initial approximations based on branch-point
expansion, asymptotic series, rational fits, and continued-logarithm recursion.
","[{'version': 'v1', 'created': 'Fri, 31 Aug 2012 21:07:48 GMT'}, {'version': 'v2', 'created': 'Sun, 7 Jan 2018 14:33:32 GMT'}]",2018-01-09,"[['Veberic', 'Darko', '']]","['Lambert W function', 'computational physics', 'numerical methods and algorithms', 'C++']"
5334,1611.00538,L\'aszl\'o Csat\'o,"S\'andor Boz\'oki, L\'aszl\'o Csat\'o, J\'ozsef Temesi","An application of incomplete pairwise comparison matrices for ranking
  top tennis players","14 pages, 2 figures","European Journal of Operational Research, 248(1): 211-218, 2016",10.1016/j.ejor.2015.06.069,,cs.AI cs.GT stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pairwise comparison is an important tool in multi-attribute decision making.
Pairwise comparison matrices (PCM) have been applied for ranking criteria and
for scoring alternatives according to a given criterion. Our paper presents a
special application of incomplete PCMs: ranking of professional tennis players
based on their results against each other. The selected 25 players have been on
the top of the ATP rankings for a shorter or longer period in the last 40
years. Some of them have never met on the court. One of the aims of the paper
is to provide ranking of the selected players, however, the analysis of
incomplete pairwise comparison matrices is also in the focus. The eigenvector
method and the logarithmic least squares method were used to calculate weights
from incomplete PCMs. In our results the top three players of four decades were
Nadal, Federer and Sampras. Some questions have been raised on the properties
of incomplete PCMs and remains open for further investigation.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2016 10:36:11 GMT'}]",2019-06-20,"[['Bozóki', 'Sándor', ''], ['Csató', 'László', ''], ['Temesi', 'József', '']]","['decision support', 'incomplete pairwise comparison matrix', 'ranking']"
5335,1807.02911,Abdulaziz Alayba,"Abdulaziz M. Alayba, Vasile Palade, Matthew England, and Rahat Iqbal",A Combined CNN and LSTM Model for Arabic Sentiment Analysis,Authors accepted version of submission for CD-MAKE 2018,"Proc. International Cross-Domain Conference for Machine Learning
  and Knowledge Extraction. CD-MAKE 2018. Lecture Notes in Computer Science,
  vol 11015, pp. 179-191. Springer, Cham",10.1007/978-3-319-99740-7_12,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks have shown good data modelling capabilities when dealing
with challenging and large datasets from a wide range of application areas.
Convolutional Neural Networks (CNNs) offer advantages in selecting good
features and Long Short-Term Memory (LSTM) networks have proven good abilities
of learning sequential data. Both approaches have been reported to provide
improved results in areas such image processing, voice recognition, language
translation and other Natural Language Processing (NLP) tasks. Sentiment
classification for short text messages from Twitter is a challenging task, and
the complexity increases for Arabic language sentiment classification tasks
because Arabic is a rich language in morphology. In addition, the availability
of accurate pre-processing tools for Arabic is another current limitation,
along with limited research available in this area. In this paper, we
investigate the benefits of integrating CNNs and LSTMs and report obtained
improved accuracy for Arabic sentiment analysis on different datasets.
Additionally, we seek to consider the morphological diversity of particular
Arabic words by using different sentiment classification levels.
","[{'version': 'v1', 'created': 'Mon, 9 Jul 2018 01:41:20 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Jul 2018 22:08:59 GMT'}, {'version': 'v3', 'created': 'Sun, 22 Jul 2018 02:02:30 GMT'}]",2018-11-02,"[['Alayba', 'Abdulaziz M.', ''], ['Palade', 'Vasile', ''], ['England', 'Matthew', ''], ['Iqbal', 'Rahat', '']]","['Arabic Sentiment Classification', 'CNN', 'LSTM', 'Natural Language Processing(NLP)']"
5336,1805.06782,Vincent Labatut,"Xavier Bost (LIA), Vincent Labatut (LIA), Serigne Gueye (LIA), Georges
  Linar\`es (LIA)","Extraction and Analysis of Dynamic Conversational Networks from TV
  Series",arXiv admin note: substantial text overlap with arXiv:1602.07811,"In: Social Network Based Big Data Analysis and Applications,
  p.55-84, Springer, 2018",10.1007/978-3-319-78196-9_3,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identifying and characterizing the dynamics of modern tv series subplots is
an open problem. One way is to study the underlying social network of
interactions between the characters. Standard dynamic network extraction
methods rely on temporal integration, either over the whole considered period,
or as a sequence of several time-slices. However, they turn out to be
inappropriate in the case of tv series, because the scenes shown onscreen
alternatively focus on parallel storylines, and do not necessarily respect a
traditional chronology. In this article, we introduce Narrative Smoothing, a
novel network extraction method taking advantage of the plot properties to
solve some of their limitations. We apply our method to a corpus of 3 popular
series, and compare it to both standard approaches. Narrative smoothing leads
to more relevant observations when it comes to the characterization of the
protagonists and their relationships, confirming its appropriateness to model
the intertwined storylines constituting the plots.
","[{'version': 'v1', 'created': 'Wed, 16 May 2018 08:18:53 GMT'}]",2018-05-23,"[['Bost', 'Xavier', '', 'LIA'], ['Labatut', 'Vincent', '', 'LIA'], ['Gueye', 'Serigne', '', 'LIA'], ['Linarès', 'Georges', '', 'LIA']]","['tv Series', 'Plot Analysis', 'Dynamic Social Network']"
5337,1309.6471,Mordechai Shalom,Arman Boyac{\i} and T{\i}naz Ekim and Mordechai Shalom and Shmuel Zaks,"Graphs of Edge-Intersecting Non-Splitting Paths in a Tree:
  Representations of Holes-Part II",,"Discrete Mathematics & Theoretical Computer Science, Vol. 20 no.
  1, Graph Theory (January 11, 2018) dmtcs:4197",10.23638/DMTCS-20-1-2,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a tree and a set P of non-trivial simple paths on it, VPT(P) is the VPT
graph (i.e. the vertex intersection graph) of the paths P, and EPT(P) is the
EPT graph (i.e. the edge intersection graph) of P. These graphs have been
extensively studied in the literature. Given two (edge) intersecting paths in a
graph, their split vertices is the set of vertices having degree at least 3 in
their union. A pair of (edge) intersecting paths is termed non-splitting if
they do not have split vertices (namely if their union is a path). We define
the graph ENPT(P) of edge intersecting non-splitting paths of a tree, termed
the ENPT graph, as the graph having a vertex for each path in P, and an edge
between every pair of vertices representing two paths that are both
edge-intersecting and non-splitting. A graph G is an ENPT graph if there is a
tree T and a set of paths P of T such that G=ENPT(P), and we say that <T,P> is
a representation of G.
  Our goal is to characterize the representation of chordless ENPT cycles
(holes). To achieve this goal, we first assume that the EPT graph induced by
the vertices of an ENPT hole is given. In [2] we introduce three assumptions
(P1), (P2), (P3) defined on EPT, ENPT pairs of graphs. In the same study, we
define two problems HamiltonianPairRec, P3-HamiltonianPairRec and characterize
the representations of ENPT holes that satisfy (P1), (P2), (P3).
  In this work, we continue our work by relaxing these three assumptions one by
one. We characterize the representations of ENPT holes satisfying (P3) by
providing a polynomial-time algorithm to solve P3-HamiltonianPairRec. We also
show that there does not exist a polynomial-time algorithm to solve
HamiltonianPairRec, unless P=NP.
","[{'version': 'v1', 'created': 'Wed, 25 Sep 2013 11:45:21 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Aug 2016 17:03:25 GMT'}, {'version': 'v3', 'created': 'Sun, 1 Oct 2017 19:25:03 GMT'}, {'version': 'v4', 'created': 'Tue, 9 Jan 2018 05:24:48 GMT'}]",2019-03-14,"[['Boyacı', 'Arman', ''], ['Ekim', 'Tınaz', ''], ['Shalom', 'Mordechai', ''], ['Zaks', 'Shmuel', '']]","['Intersection Graphs', 'Path Graphs', 'EPT Graphs']"
5338,cs/0404006,Chung-Chieh Shan,Chung-chieh Shan,"Delimited continuations in natural language: quantification and polarity
  sensitivity",10 pages,"In CW'04: Proceedings of the 4th ACM SIGPLAN workshop on
  continuations, ed. Hayo Thielecke, 55-64. Technical report CSR-04-1, School
  of Computer Science, University of Birmingham (2004)",,,cs.CL cs.PL,,"  Making a linguistic theory is like making a programming language: one
typically devises a type system to delineate the acceptable utterances and a
denotational semantics to explain observations on their behavior. Via this
connection, the programming language concept of delimited continuations can
help analyze natural language phenomena such as quantification and polarity
sensitivity. Using a logical metalanguage whose syntax includes control
operators and whose semantics involves evaluation order, these analyses can be
expressed in direct style rather than continuation-passing style, and these
phenomena can be thought of as computational side effects.
","[{'version': 'v1', 'created': 'Mon, 5 Apr 2004 01:53:46 GMT'}]",2007-05-23,"[['Shan', 'Chung-chieh', '']]","['Delimited continuations', 'control effects', 'natural languagesemantics', 'quantification', 'polarity sensitivity']"
5339,1404.0075,EPTCS,Ed Blakey (University of Bristol),Ray tracing -- computing the incomputable?,"In Proceedings DCM 2012, arXiv:1403.7579","EPTCS 143, 2014, pp. 32-40",10.4204/EPTCS.143.3,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We recall from previous work a model-independent framework of computational
complexity theory. Notably for the present paper, the framework allows
formalization of the issues of precision that present themselves when one
considers physical, error-prone (especially analogue rather than digital)
computational systems. We take as a case study the ray-tracing problem, a
Turing-machine-incomputable problem that can, in apparent violation of the
Church-Turing thesis, nonetheless be said to be solved by certain optical
computers; however, we apply the framework of complexity theory so as to
formalize the intuition that the purported super-Turing power of these
computers in fact vanishes once precision is properly considered.
","[{'version': 'v1', 'created': 'Tue, 1 Apr 2014 00:37:14 GMT'}]",2014-04-02,"[['Blakey', 'Ed', '', 'University of Bristol']]","['Church-Turing thesis', 'complexity', 'computability', 'optical computation', 'precision', 'ray tracing', 'unconventional computation']"
5340,2102.06377,Wenyu Wang,Wenyu Wang and Wei Yang and Tianyin Xu and Tao Xie,VET: Identifying and Avoiding UI Exploration Tarpits,,,10.1145/3468264.3468554,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Despite over a decade of research, it is still challenging for mobile UI
testing tools to achieve satisfactory effectiveness, especially on industrial
apps with rich features and large code bases. Our experiences suggest that
existing mobile UI testing tools are prone to exploration tarpits, where the
tools get stuck with a small fraction of app functionalities for an extensive
amount of time. For example, a tool logs out an app at early stages without
being able to log back in, and since then the tool gets stuck with exploring
the app's pre-login functionalities (i.e., exploration tarpits) instead of its
main functionalities. While tool vendors/users can manually hardcode rules for
the tools to avoid specific exploration tarpits, these rules can hardly
generalize, being fragile in face of diverted testing environments and fast app
iterations. To identify and resolve exploration tarpits, we propose VET, a
general approach including a supporting system for the given specific Android
UI testing tool on the given specific app under test (AUT). VET runs the tool
on the AUT for some time and records UI traces, based on which VET identifies
exploration tarpits by recognizing their patterns in the UI traces. VET then
pinpoints the actions (e.g., clicking logout) or the screens that lead to or
exhibit exploration tarpits. In subsequent test runs, VET guides the testing
tool to prevent or recover from exploration tarpits. From our evaluation with
state-of-the-art Android UI testing tools on popular industrial apps, VET
identifies exploration tarpits that cost up to 98.6% testing time budget. These
exploration tarpits reveal not only limitations in UI exploration strategies
but also defects in tool implementations. VET automatically addresses the
identified exploration tarpits, enabling each evaluated tool to achieve higher
code coverage and improve crash-triggering capabilities.
","[{'version': 'v1', 'created': 'Fri, 12 Feb 2021 07:48:25 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Jul 2021 18:40:27 GMT'}]",2021-07-15,"[['Wang', 'Wenyu', ''], ['Yang', 'Wei', ''], ['Xu', 'Tianyin', ''], ['Xie', 'Tao', '']]","['UI testing', 'trace analysis', 'mobile testing', 'mobile app', 'Android']"
5341,1406.4842,Adeel Akbar Memon,"A. A. Memon, C. Wang, M. R. Naeem, M. Tahir, M. Aamir","A New Web Based Student Annual Review Information System (SARIS) With
  Student Success Prediction","4 pages, 7 figures and 2 Tables","International Journal of Computer Trends and Technology (IJCTT)
  V10(5):275-278 Apr 2014",10.14445/22312803/IJCTT-V10P149,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we are proposing new web based Student Annual Review
Information System (SARIS) and prediction method for the success of scholar
students to China Scholarship Council(CSC). The main objective of developing
this system is to save the cost of paper, to reduce the risk of data loss, to
decrease the processing time, to reduce the delay in finding for the successful
students. The proposed system and prediction method is intended to be used by
China Scholarship Council; however SARIS and prediction method are quite
generic and can be used by other scholarship agencies.
","[{'version': 'v1', 'created': 'Fri, 16 May 2014 14:50:53 GMT'}]",2014-06-19,"[['Memon', 'A. A.', ''], ['Wang', 'C.', ''], ['Naeem', 'M. R.', ''], ['Tahir', 'M.', ''], ['Aamir', 'M.', '']]","['China Scholarship Council', 'database system', 'data mining', 'information system', 'student success']"
5342,2205.11648,Sikun Lin,"Sikun Lin, Shuyun Tang, Scott Grafton, Ambuj Singh",Deep Representations for Time-varying Brain Datasets,,"ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2022",10.1145/3534678.3539301,,cs.LG q-bio.NC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Finding an appropriate representation of dynamic activities in the brain is
crucial for many downstream applications. Due to its highly dynamic nature,
temporally averaged fMRI (functional magnetic resonance imaging) can only
provide a narrow view of underlying brain activities. Previous works lack the
ability to learn and interpret the latent dynamics in brain architectures. This
paper builds an efficient graph neural network model that incorporates both
region-mapped fMRI sequences and structural connectivities obtained from DWI
(diffusion-weighted imaging) as inputs. We find good representations of the
latent brain dynamics through learning sample-level adaptive adjacency matrices
and performing a novel multi-resolution inner cluster smoothing. We also
attribute inputs with integrated gradients, which enables us to infer (1)
highly involved brain connections and subnetworks for each task, (2) temporal
keyframes of imaging sequences that characterize tasks, and (3) subnetworks
that discriminate between individual subjects. This ability to identify
critical subnetworks that characterize signal states across heterogeneous tasks
and individuals is of great importance to neuroscience and other scientific
domains. Extensive experiments and ablation studies demonstrate our proposed
method's superiority and efficiency in spatial-temporal graph signal modeling
with insightful interpretations of brain dynamics.
","[{'version': 'v1', 'created': 'Mon, 23 May 2022 21:57:31 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Jun 2022 07:56:48 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Aug 2022 19:17:50 GMT'}]",2022-08-18,"[['Lin', 'Sikun', ''], ['Tang', 'Shuyun', ''], ['Grafton', 'Scott', ''], ['Singh', 'Ambuj', '']]","['fMRI time series', 'graph neural networks', 'feature attribution']"
5343,1802.08604,Jos\'e Vuelvas,"Jos\'e Vuelvas, Fredy Ruiz, Giambattista Gruosso","Limiting gaming opportunities on incentive-based demand response
  programs",,,10.1016/j.apenergy.2018.05.050,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Demand Response (DR) is a program designed to match supply and demand by
modifying consumption profile. Some of these programs are based on economic
incentives, in which, a user is paid to reduce his energy requirements
according to an estimated baseline. Literature review and practice have shown
that the counter-factual models of employing baselines are vulnerable for
gaming. Classical solutions of mechanism design require that agents communicate
their full types which result in greater difficulties for its practical
implementation. In this paper, a novel contract is developed to induce
individual rationality (voluntary participation) and asymptotic
incentive-compatibility (truthfulness) through probability of call, where an
agent does not require to report the marginal utility. In this approach, a
consumer only announces the baseline and reduction capacity, given a payment
scheme that includes cost of electricity, incentive price, and penalty caused
by any deviation between self-reported and actual energy consumption. The
aggregator decides randomly what users are called to perform the energy
reduction. As result, asymptotic truth-telling behavior in incentive-based DR
is managed by the aggregator through the probability of call for each agent.
Mathematical proofs and numerical studies are provided to demonstrate the
properties and advantages of this contract in limiting gaming opportunities and
in terms of its implementation.
","[{'version': 'v1', 'created': 'Fri, 23 Feb 2018 15:37:48 GMT'}]",2018-05-31,"[['Vuelvas', 'José', ''], ['Ruiz', 'Fredy', ''], ['Gruosso', 'Giambattista', '']]","['Incentive-based demand response', 'Contract theory', 'Mechanismdesign', 'Probability of call', 'Baseline']"
5344,1705.06526,Romain Guicherd Mr,"Romain Guicherd, Paul A. Trodden, Andrew R. Mills and Visakan
  Kadirkamanathan","Weak Interactions Based System Partitioning Using Integer Linear
  Programming","Accepted for IFAC World Congress 2017 (Toulouse, France)",,10.1016/j.ifacol.2017.08.709,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The partitioning of a system model will condition the structure of the
controller as well as its design. In order to partition a system model, one has
to know what states and inputs to group together to define subsystem models.
For a given partitioning, the total magnitude of the interactions between
subsystem models is evaluated. Therefore, the partitioning problem seeking for
weak interactions can be posed as a minimization problem. Initially, the
problem is formulated as a non-linear integer minimization that is then relaxed
into a linear integer programming problem. It is shown within this paper that
cuts can be applied to the initial search space in order to find the least
interacting partitioning; only composed of controllable subsystems. Two
examples are given to demonstrate the methodology.
","[{'version': 'v1', 'created': 'Thu, 18 May 2017 11:16:35 GMT'}]",2017-11-22,"[['Guicherd', 'Romain', ''], ['Trodden', 'Paul A.', ''], ['Mills', 'Andrew R.', ''], ['Kadirkamanathan', 'Visakan', '']]","['Decoupling problems', 'linear multivariable systems', 'decentralized control', 'integerprogramming']"
5345,1201.2969,Ghazi Al-Naymat,"Ghazi Al-Naymat, Sanjay Chawla and Javid Taheri",SparseDTW: A Novel Approach to Speed up Dynamic Time Warping,17 pages,"Al-Naymat, G., S. Chawla, and J. Taheri, ""SparseDTW: A Novel
  Approach to Speed up Dynamic Time Warping"", The 2009 Australasian Data
  Mining, vol. 101, Melbourne, Australia, ACM Digital Library, pp. 117-127,
  12/2009",,,cs.DB cs.DS,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We present a new space-efficient approach, (SparseDTW), to compute the
Dynamic Time Warping (DTW) distance between two time series that always yields
the optimal result. This is in contrast to other known approaches which
typically sacrifice optimality to attain space efficiency. The main idea behind
our approach is to dynamically exploit the existence of similarity and/or
correlation between the time series. The more the similarity between the time
series the less space required to compute the DTW between them. To the best of
our knowledge, all other techniques to speedup DTW, impose apriori constraints
and do not exploit similarity characteristics that may be present in the data.
We conduct experiments and demonstrate that SparseDTW outperforms previous
approaches.
","[{'version': 'v1', 'created': 'Fri, 13 Jan 2012 23:26:27 GMT'}]",2012-01-17,"[['Al-Naymat', 'Ghazi', ''], ['Chawla', 'Sanjay', ''], ['Taheri', 'Javid', '']]","['Time series', 'Similarity measures', 'Dynamic time warping', 'Data mining']"
5346,1807.06534,Ralf-Peter Mundani,"Christoph Ertl (1), J\'er\^ome Frisch (2), Ralf-Peter Mundani (1) ((1)
  Technische Universit\""at M\""unchen, Munich, Germany, (2) RWTH Aachen
  University, Aachen, Germany)","Design and optimisation of an efficient HDF5 I/O kernel for massive
  parallel fluid flow simulations","24 pages, 8 figures",Concurrency and Computation: Practice and Experience 29 (2017),10.1002/cpe.4165,,cs.PF cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  More and more massive parallel codes running on several hundreds of thousands
of cores enter the computational science and engineering domain, allowing
high-fidelity computations on up to trillions of unknowns for very detailed
analyses of the underlying problems. During such runs, typically gigabytes of
data are being produced, hindering both efficient storage and (interactive)
data exploration. Here, advanced approaches based on inherently distributed
data formats such as HDF5 become necessary in order to avoid long latencies
when storing the data and to support fast (random) access when retrieving the
data for visual processing. Avoiding file locking and using collective
buffering, write bandwidths to a single file close to the theoretical peak on a
modern supercomputing cluster were achieved. The structure of the output file
supports a very fast interactive visualisation and introduces additional
steering functionality.
","[{'version': 'v1', 'created': 'Tue, 3 Jul 2018 17:40:39 GMT'}]",2018-07-18,"[['Ertl', 'Christoph', ''], ['Frisch', 'Jérôme', ''], ['Mundani', 'Ralf-Peter', '']]","['High-Performance Computing', 'I/O', 'HDF5', 'Computational Steering', 'Computational Fluid Dynamics']"
5347,1806.01963,Simon Graham Mr,"Simon Graham, Hao Chen, Jevgenij Gamper, Qi Dou, Pheng-Ann Heng, David
  Snead, Yee Wah Tsang, Nasir Rajpoot","MILD-Net: Minimal Information Loss Dilated Network for Gland Instance
  Segmentation in Colon Histology Images","Initial version published at Medical Imaging with Deep Learning
  (MIDL) 2018","Medical Image Analysis vol. 52, pp. 199-211, Feb. 2019",10.1016/j.media.2018.12.001,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The analysis of glandular morphology within colon histopathology images is an
important step in determining the grade of colon cancer. Despite the importance
of this task, manual segmentation is laborious, time-consuming and can suffer
from subjectivity among pathologists. The rise of computational pathology has
led to the development of automated methods for gland segmentation that aim to
overcome the challenges of manual segmentation. However, this task is
non-trivial due to the large variability in glandular appearance and the
difficulty in differentiating between certain glandular and non-glandular
histological structures. Furthermore, a measure of uncertainty is essential for
diagnostic decision making. To address these challenges, we propose a fully
convolutional neural network that counters the loss of information caused by
max-pooling by re-introducing the original image at multiple points within the
network. We also use atrous spatial pyramid pooling with varying dilation rates
for preserving the resolution and multi-level aggregation. To incorporate
uncertainty, we introduce random transformations during test time for an
enhanced segmentation result that simultaneously generates an uncertainty map,
highlighting areas of ambiguity. We show that this map can be used to define a
metric for disregarding predictions with high uncertainty. The proposed network
achieves state-of-the-art performance on the GlaS challenge dataset and on a
second independent colorectal adenocarcinoma dataset. In addition, we perform
gland instance segmentation on whole-slide images from two further datasets to
highlight the generalisability of our method. As an extension, we introduce
MILD-Net+ for simultaneous gland and lumen segmentation, to increase the
diagnostic power of the network.
","[{'version': 'v1', 'created': 'Tue, 5 Jun 2018 23:38:01 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jun 2018 17:11:26 GMT'}, {'version': 'v3', 'created': 'Tue, 15 Jan 2019 13:06:07 GMT'}, {'version': 'v4', 'created': 'Mon, 18 Feb 2019 11:30:49 GMT'}]",2019-02-19,"[['Graham', 'Simon', ''], ['Chen', 'Hao', ''], ['Gamper', 'Jevgenij', ''], ['Dou', 'Qi', ''], ['Heng', 'Pheng-Ann', ''], ['Snead', 'David', ''], ['Tsang', 'Yee Wah', ''], ['Rajpoot', 'Nasir', '']]","['Gland instance segmentation', 'computational pathology', 'colorectal adenocarcinoma', 'deeplearning']"
5348,1811.01719,Dmitry Kulyabov,"Migran N. Gevorkyan and Anastasia V. Demidova and Anna V. Korolkova
  and Dmitry S. Kulyabov","Issues in the software implementation of stochastic numerical
  Runge-Kutta","in English, in Russian",,10.1007/978-3-319-99447-5_46,,cs.NA cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses stochastic numerical methods of Runge-Kutta type with
weak and strong convergences for systems of stochastic differential equations
in It\^o form. At the beginning we give a brief overview of the stochastic
numerical methods and information from the theory of stochastic differential
equations. Then we motivate the approach to the implementation of these methods
using source code generation. We discuss the implementation details and the
used programming languages and libraries
","[{'version': 'v1', 'created': 'Thu, 1 Nov 2018 08:20:49 GMT'}]",2018-11-06,"[['Gevorkyan', 'Migran N.', ''], ['Demidova', 'Anastasia V.', ''], ['Korolkova', 'Anna V.', ''], ['Kulyabov', 'Dmitry S.', '']]","['stochastic differential equations', 'stochastic numerical methods', 'automatic code generation', 'Pythonlanguage', 'Julia language', 'template engine']"
5349,1606.08962,Jagannath Roy,"Jagannath Roy, Kajal Chatterjee, Abhirup Bandhopadhyay, Samarjit Kar","Evaluation and selection of Medical Tourism sites: A rough AHP based
  MABAC approach",25 pages,,10.1111/exsy.12232,14450977,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a novel multiple criteria decision making (MCDM) methodology
is presented for assessing and prioritizing medical tourism destinations in
uncertain environment. A systematic evaluation and assessment method is
proposed by integrating rough number based AHP (Analytic Hierarchy Process) and
rough number based MABAC (Multi-Attributive Border Approximation area
Comparison). Rough number is used to aggregate individual judgments and
preferences to deal with vagueness in decision making due to limited data.
Rough AHP analyzes the relative importance of criteria based on their
preferences given by experts. Rough MABAC evaluates the alternative sites based
on the criteria weights. The proposed methodology is explained through a case
study considering different cities for healthcare service in India. The
validity of the obtained ranking for the given decision making problem is
established by testing criteria proposed by Wang and Triantaphyllou (2008)
along with further analysis and discussion.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2016 06:00:32 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Aug 2016 07:07:30 GMT'}]",2017-07-28,"[['Roy', 'Jagannath', ''], ['Chatterjee', 'Kajal', ''], ['Bandhopadhyay', 'Abhirup', ''], ['Kar', 'Samarjit', '']]","['Multiple criteria decision making', 'rough number', 'AHP', 'MABAC', 'Medical tourism']"
5350,2210.14984,Claudia Flores-Saviaga,"Saiph Savage, Claudia Flores-Saviaga, Rachel Rodney, Liliana Savage,
  Jon Schull, Jennifer Mankoff",The Global Care Ecosystems of 3D Printed Assistive Devices,,"ACM Transactions on Accessible Computing, Vol. 15, No. 4, Article
  31. October 2022",10.1145/3537676,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  The popularity of 3D printed assistive technology has led to the emergence of
new ecosystems of care, where multiple stakeholders (makers, clinicians, and
recipients with disabilities) work toward creating new upper limb prosthetic
devices. However, despite the increasing growth, we currently know little about
the differences between these care ecosystems. Medical regulations and the
prevailing culture have greatly impacted how ecosystems are structured and
stakeholders work together, including whether clinicians and makers
collaborate. To better understand these care ecosystems, we interviewed a range
of stakeholders from multiple countries, including Brazil, Chile, Costa Rica,
France, India, Mexico, and the U.S. Our broad analysis allowed us to uncover
different working examples of how multiple stakeholders collaborate within
these care ecosystems and the main challenges they face. Through our study, we
were able to uncover that the ecosystems with multi-stakeholder collaborations
exist (something prior work had not seen), and these ecosystems showed
increased success and impact. We also identified some of the key follow-up
practices to reduce device abandonment. Of particular importance are to have
ecosystems put in place follow up practices that integrate formal agreements
and compensations for participation (which do not need to be just monetary). We
identified that these features helped to ensure multi-stakeholder involvement
and ecosystem sustainability. We finished the paper with socio-technical
recommendations to create vibrant care ecosystems that include multiple
stakeholders in the production of 3D printed assistive devices.
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2022 19:02:29 GMT'}]",2022-10-28,"[['Savage', 'Saiph', ''], ['Flores-Saviaga', 'Claudia', ''], ['Rodney', 'Rachel', ''], ['Savage', 'Liliana', ''], ['Schull', 'Jon', ''], ['Mankoff', 'Jennifer', '']]","['3D Printing', '3D Printed Assistive Technology', 'Fabrication', 'Making']"
5351,1807.01053,Sergey Goncharov,"Sergey Goncharov, Julian Jakob, Renato Neves",A Semantics for Hybrid Iteration,Corrected version of a CONCUR'18 paper; more proof details,,10.4230/LIPIcs.CONCUR.2018.22,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The recently introduced notions of guarded traced (monoidal) category and
guarded (pre-)iterative monad aim at unifying different instances of partial
iteration whilst keeping in touch with the established theory of total
iteration and preserving its merits. In this paper we use these notions and the
corresponding stock of results to examine different types of iteration for
hybrid computations. As a starting point we use an available notion of hybrid
monad restricted to the category of sets, and modify it in order to obtain a
suitable notion of guarded iteration with guardedness interpreted as
progressiveness in time - we motivate this modification by our intention to
capture Zeno behaviour in an arguably general and feasible way. We illustrate
our results with a simple programming language for hybrid computations and
interpret it over the developed semantic foundations.
","[{'version': 'v1', 'created': 'Tue, 3 Jul 2018 09:47:52 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Feb 2019 15:59:02 GMT'}]",2019-02-07,"[['Goncharov', 'Sergey', ''], ['Jakob', 'Julian', ''], ['Neves', 'Renato', '']]","['Elgot iteration', 'guarded iteration', 'hybrid monad', 'Zeno behaviour']"
5352,1603.08984,Aron Monszpart,"Aron Monszpart, Nils Thuerey, Niloy J. Mitra",SMASH: Physics-guided Reconstruction of Collisions from Videos,SIGGRAPH Asia 2016,"ACM Trans. Graph. 35, 6, Article 199 (November 2016), 14 pages
  (2016)",10.1145/2980179.2982421,,cs.GR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Collision sequences are commonly used in games and entertainment to add drama
and excitement. Authoring even two body collisions in the real world can be
difficult, as one has to get timing and the object trajectories to be correctly
synchronized. After tedious trial-and-error iterations, when objects can
actually be made to collide, then they are difficult to capture in 3D. In
contrast, synthetically generating plausible collisions is difficult as it
requires adjusting different collision parameters (e.g., object mass ratio,
coefficient of restitution, etc.) and appropriate initial parameters. We
present SMASH to directly read off appropriate collision parameters directly
from raw input video recordings. Technically we enable this by utilizing laws
of rigid body collision to regularize the problem of lifting 2D trajectories to
a physically valid 3D reconstruction of the collision. The reconstructed
sequences can then be modified and combined to easily author novel and
plausible collisions. We evaluate our system on a range of synthetic scenes and
demonstrate the effectiveness of our method by accurately reconstructing
several complex real world collision events.
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2016 22:18:29 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Apr 2017 11:09:34 GMT'}]",2017-04-11,"[['Monszpart', 'Aron', ''], ['Thuerey', 'Nils', ''], ['Mitra', 'Niloy J.', '']]","['3D reconstruction', 'rigid body collision', 'optimization']"
5353,1904.02524,Pavel Rojtberg,"Pavel Rojtberg, Benjamin Audenrith",x3ogre: Connecting X3D to a state of the art rendering engine,,,10.1145/3055624.3075949,,cs.GR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We connect X3D to the state of the art OGRE renderer using our prototypical
x3ogre implementation. At this we perform a comparison of both on a conceptual
level, highlighting similarities and differences. Our implementation allows
swapping X3D concepts for OGRE concepts and vice versa. We take advantage of
this to analyse current shortcomings in X3D and propose X3D extensions to
overcome those.
","[{'version': 'v1', 'created': 'Wed, 3 Apr 2019 12:48:40 GMT'}]",2019-04-05,"[['Rojtberg', 'Pavel', ''], ['Audenrith', 'Benjamin', '']]","['X3D', 'webgl', 'materials', 'geometry']"
5354,1405.3546,Mario Alviano,"Mario Alviano, Carmine Dodaro and Francesco Ricca",Anytime Computation of Cautious Consequences in Answer Set Programming,To appear in Theory and Practice of Logic Programming,Theory and Practice of Logic Programming 14 (2014) 755-770,10.1017/S1471068414000325,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Query answering in Answer Set Programming (ASP) is usually solved by
computing (a subset of) the cautious consequences of a logic program. This task
is computationally very hard, and there are programs for which computing
cautious consequences is not viable in reasonable time. However, current ASP
solvers produce the (whole) set of cautious consequences only at the end of
their computation. This paper reports on strategies for computing cautious
consequences, also introducing anytime algorithms able to produce sound answers
during the computation.
","[{'version': 'v1', 'created': 'Wed, 14 May 2014 15:46:33 GMT'}, {'version': 'v2', 'created': 'Thu, 15 May 2014 09:27:38 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Sep 2014 12:29:17 GMT'}]",2020-02-19,"[['Alviano', 'Mario', ''], ['Dodaro', 'Carmine', ''], ['Ricca', 'Francesco', '']]","['answer set programming', 'query answering', 'cautious reasoning', 'anytime algorithms']"
5355,1003.3566,Secretary Aircc Journal,"M. Ibrahim Moussa (Benha University, Benha, Egypt)",An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles,"9 Pages, JGraph-Hoc Journal","International journal on applications of graph theory in wireless
  ad hoc networks and sensor networks 2.1 (2010) 112-119",10.5121/jgraphhoc.2010.2108,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In 1991, Gnanajothi [4] proved that the path graph P_n with n vertex and n-1
edge is odd graceful, and the cycle graph C_m with m vertex and m edges is odd
graceful if and only if m even, she proved the cycle graph is not graceful if m
odd. In this paper, firstly, we studied the graph C_m $\cup$ P_m when m = 4,
6,8,10 and then we proved that the graph C_ $\cup$ P_n is odd graceful if m is
even. Finally, we described an algorithm to label the vertices and the edges of
the vertex set V(C_m $\cup$ P_n) and the edge set E(C_m $\cup$ P_n).
","[{'version': 'v1', 'created': 'Thu, 18 Mar 2010 12:04:56 GMT'}]",2010-07-15,"[['Moussa', 'M. Ibrahim', '', 'Benha University, Benha, Egypt']]","['Vertex labeling', 'edge labeling', 'odd graceful', 'Algorithms']"
5356,1007.4438,In\^es Dutra,"V\'itor Santos Costa, In\^es Dutra and Ricardo Rocha",Threads and Or-Parallelism Unified,"17 pages, 21 figures, International Conference on Logic Programming
  (ICLP 2010)","Theory and Practice of Logic Programming, Volume 10, Issue 4-6,
  July 2010, pp 417-432 Published online by Cambridge University Press 09 Jul
  2010",10.1017/S1471068410000190,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the main advantages of Logic Programming (LP) is that it provides an
excellent framework for the parallel execution of programs. In this work we
investigate novel techniques to efficiently exploit parallelism from real-world
applications in low cost multi-core architectures. To achieve these goals, we
revive and redesign the YapOr system to exploit or-parallelism based on a
multi-threaded implementation. Our new approach takes full advantage of the
state-of-the-art fast and optimized YAP Prolog engine and shares the underlying
execution environment, scheduler and most of the data structures used to
support YapOr's model. Initial experiments with our new approach consistently
achieve almost linear speedups for most of the applications, proving itself as
a good alternative for exploiting implicit parallelism in the currently
available low cost multi-core architectures.
","[{'version': 'v1', 'created': 'Mon, 26 Jul 2010 12:36:31 GMT'}]",2010-07-27,"[['Costa', 'Vítor Santos', ''], ['Dutra', 'Inês', ''], ['Rocha', 'Ricardo', '']]","['Multi-Threading', 'Or-Parallelism', 'Implementation']"
5357,1303.7264,Yaojia Zhu,"Yaojia Zhu, Xiaoran Yan, Lise Getoor and Cristopher Moore",Scalable Text and Link Analysis with Mixed-Topic Link Models,"11 pages, 4 figures","Proc. 19th SIGKDD Conference on Knowledge Discovery and Data
  Mining (KDD) 2013, 473-481",10.1145/2487575.2487693,,cs.LG cs.IR cs.SI physics.data-an stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many data sets contain rich information about objects, as well as pairwise
relations between them. For instance, in networks of websites, scientific
papers, and other documents, each node has content consisting of a collection
of words, as well as hyperlinks or citations to other nodes. In order to
perform inference on such data sets, and make predictions and recommendations,
it is useful to have models that are able to capture the processes which
generate the text at each node and the links between them. In this paper, we
combine classic ideas in topic modeling with a variant of the mixed-membership
block model recently developed in the statistical physics community. The
resulting model has the advantage that its parameters, including the mixture of
topics of each document and the resulting overlapping communities, can be
inferred with a simple and scalable expectation-maximization algorithm. We test
our model on three data sets, performing unsupervised topic classification and
link prediction. For both tasks, our model outperforms several existing
state-of-the-art methods, achieving higher accuracy with significantly less
computation, analyzing a data set with 1.3 million words and 44 thousand links
in a few minutes.
","[{'version': 'v1', 'created': 'Thu, 28 Mar 2013 22:34:51 GMT'}]",2014-10-30,"[['Zhu', 'Yaojia', ''], ['Yan', 'Xiaoran', ''], ['Getoor', 'Lise', ''], ['Moore', 'Cristopher', '']]","['Document classification', 'Community detection', 'Topic modeling', 'Link prediction', 'Stochastic block model']"
5358,2001.01952,Luca Demetrio,"Luca Demetrio and Andrea Valenza and Gabriele Costa and Giovanni
  Lagorio","WAF-A-MoLE: Evading Web Application Firewalls through Adversarial
  Machine Learning",,"Proceedings of the 35th Annual ACM Symposium on Applied Computing
  2020",10.1145/3341105.3373962,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web Application Firewalls are widely used in production environments to
mitigate security threats like SQL injections. Many industrial products rely on
signature-based techniques, but machine learning approaches are becoming more
and more popular. The main goal of an adversary is to craft semantically
malicious payloads to bypass the syntactic analysis performed by a WAF. In this
paper, we present WAF-A-MoLE, a tool that models the presence of an adversary.
This tool leverages on a set of mutation operators that alter the syntax of a
payload without affecting the original semantics. We evaluate the performance
of the tool against existing WAFs, that we trained using our publicly available
SQL query dataset. We show that WAF-A-MoLE bypasses all the considered machine
learning based WAFs.
","[{'version': 'v1', 'created': 'Tue, 7 Jan 2020 10:14:04 GMT'}]",2020-04-02,"[['Demetrio', 'Luca', ''], ['Valenza', 'Andrea', ''], ['Costa', 'Gabriele', ''], ['Lagorio', 'Giovanni', '']]","['web application firewall', 'adversarial machine learning', 'sql injection', 'mutational fuzzing']"
5359,1306.0162,Mouhamed Abdulla,Mouhamed Abdulla and Yousef R. Shayan,Cellular-Based Statistical Model for Mobile Dispersion,"Proc. of the 14th IEEE International Workshop on Computer-Aided
  Modeling, Analysis and Design of Communication Links and Networks (CAMAD'09)",,10.1109/CAMAD.2009.5161465,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While analyzing mobile systems we often approximate the actual coverage
surface and assume an ideal cell shape. In a multi-cellular network, because of
its tessellating nature, a hexagon is more preferred than a circular geometry.
Despite this reality, perhaps due to the inherent simplicity, only a model for
circular based random spreading is available. However, if used, this results an
unfair terminal distribution for non-circular contours. Therefore, in this
paper we specifically derived an unbiased node density model for a hexagon. We
then extended the principle and established stochastic ways to handle sectored
cells. Next, based on these mathematical findings, we created a generic
modeling tool that can support a complex network with varying position,
capacity, size, user density, and sectoring capability. Last, simulation was
used to verify the theoretical analysis.
","[{'version': 'v1', 'created': 'Sun, 2 Jun 2013 02:05:50 GMT'}]",2013-06-04,"[['Abdulla', 'Mouhamed', ''], ['Shayan', 'Yousef R.', '']]","['Mobile Network', 'Hexagon Cell', 'Spatial Distribution', 'Stochastic Model', 'Simulation']"
5360,1312.2658,Akira Otsuki,Akira Otsuki and Masayoshi Kawamura,"The Study about the Analysis of Responsiveness Pair Clustering to Social
  Network Bipartite Graph","14 pages, 8 figures, 3 tables","Advanced Computing: An International Journal (ACIJ), Vol.4, No.6,
  November 2013",10.5121/acij.2013.4601,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this study, regional (cities, towns and villages) data and tweet data are
obtained from Twitter, and extract information of purchase information (Where
and what bought) from the tweet data by morphological analysis and rule-based
dependency analysis. Then, the ""The regional information"" and ""The information
of purchase history (Where and what bought information)"" are captured as
bipartite graph, and Responsiveness Pair Clustering analysis (a clustering
using correspondence analysis as similarity measure) is conducted. In this
study, since it was found to be difficult to analyze a network such as
bipartite graph having limitations in links by using modularity Q,
responsiveness is used instead of modularity Q as similarity measure. As a
result of this analysis, ""regional information cluster"" which refers to similar
""The information of purchase history"" nodes group is generated. Finally,
similar regions are visualized by mapping the regional information cluster on
the map. This visualization system is expected to contribute as an analytical
tool for customers purchasing behavior and so on.
","[{'version': 'v1', 'created': 'Tue, 10 Dec 2013 03:57:10 GMT'}]",2013-12-11,"[['Otsuki', 'Akira', ''], ['Kawamura', 'Masayoshi', '']]","['Big Data analysis', 'customers’ purchasing behaviour analysis', 'Data Mining', 'Database']"
5361,1006.1182,Secretary Aircc Journal,K. M. Azharul Hasan and Mohammad Sabbir Hasan,"A Parsing Scheme for Finding the Design Pattern and Reducing the
  Development Cost of Reusable Object Oriented Software",15 pages,"International Journal of Computer Science and Information
  Technology 2.3 (2010) 40-54",10.5121/ijcsit.2010.2304,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Because of the importance of object oriented methodologies, the research in
developing new measure for object oriented system development is getting
increased focus. The most of the metrics need to find the interactions between
the objects and modules for developing necessary metric and an influential
software measure that is attracting the software developers, designers and
researchers. In this paper a new interactions are defined for object oriented
system. Using these interactions, a parser is developed to analyze the existing
architecture of the software. Within the design model, it is necessary for
design classes to collaborate with one another. However, collaboration should
be kept to an acceptable minimum i.e. better designing practice will introduce
low coupling. If a design model is highly coupled, the system is difficult to
implement, to test and to maintain overtime. In case of enhancing software, we
need to introduce or remove module and in that case coupling is the most
important factor to be considered because unnecessary coupling may make the
system unstable and may cause reduction in the system's performance. So
coupling is thought to be a desirable goal in software construction, leading to
better values for external software qualities such as maintainability,
reusability and so on. To test this hypothesis, a good measure of class
coupling is needed. In this paper, based on the developed tool called Design
Analyzer we propose a methodology to reuse an existing system with the
objective of enhancing an existing Object oriented system keeping the coupling
as low as possible.
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2010 06:36:53 GMT'}]",2010-07-15,"[['Hasan', 'K. M. Azharul', ''], ['Hasan', 'Mohammad Sabbir', '']]","['Coupling', 'Cohesion', 'Design Pattern', 'Object Oriented Paradigm', 'Principal Component Analysis', 'Reusable Software']"
5362,1607.05946,Eduardo Duarte,"Eduardo Duarte, Pedro Bordonhos, Paulo Dias, Beatriz Sousa Santos","Living Globe: Tridimensional interactive visualization of world
  demographic data","11 pages, 6 figures, submitted to HCII 2016 Conference (Toronto,
  Canada), published on Human Interface and the Management of Information:
  Information, Design and Interaction Volume 9734 of the series Lecture Notes
  in Computer Science, pages 14-24",,10.1007/978-3-319-40349-6_2,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents Living Globe, an application for visualization of demo-
graphic data supporting the temporal comparison of data from several countries
represented on a 3D globe. Living Globe allows the visual exploration of the
following demographic data: total population, population density and growth,
crude birth and death rates, life expectancy, net migration and population per-
centage of different age groups. While offering unexperienced users a default
mapping of these data variables into visual variables, Living Globe allows more
advanced users to select the mapping, increasing its flexibility. The main
aspects of the Living Globe model and prototype are described as well as the
evaluation results obtained using heuristic evaluation and usability testing.
Some conclusions and ideas for future work are also presented.
","[{'version': 'v1', 'created': 'Wed, 20 Jul 2016 13:28:41 GMT'}]",2016-07-21,"[['Duarte', 'Eduardo', ''], ['Bordonhos', 'Pedro', ''], ['Dias', 'Paulo', ''], ['Santos', 'Beatriz Sousa', '']]","['Information Visualization', 'demographic data', '3D globe', 'WebGL Globe', 'usability evaluation', 'heuristic evaluation']"
5363,1611.08550,Adele Paul-Hus,"Adele Paul-Hus, Philippe Mongeon, Maxime Sainte-Marie and Vincent
  Lariviere","The sum of it all: revealing collaboration patterns by combining
  authorship and acknowledgements",,,10.1016/j.joi.2016.11.005,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Acknowledgments are one of many conventions by which researchers publicly
bestow recognition towards individuals, organizations and institutions that
contributed in some way to the work that led to publication. Combining data on
both co-authors and acknowledged individuals, the present study analyses
disciplinary differences in researchers credit attribution practices in
collaborative context. Our results show that the important differences
traditionally observed between disciplines in terms of team size are greatly
reduced when acknowledgees are taken into account. Broadening the measurement
of collaboration beyond co-authorship by including individuals credited in the
acknowledgements allows for an assessment of collaboration practices and team
work that might be closer to the reality of contemporary research, especially
in the social sciences and humanities.
","[{'version': 'v1', 'created': 'Fri, 25 Nov 2016 18:51:13 GMT'}]",2016-11-28,"[['Paul-Hus', 'Adele', ''], ['Mongeon', 'Philippe', ''], ['Sainte-Marie', 'Maxime', ''], ['Lariviere', 'Vincent', '']]","['collaboration', 'co-authorship', 'acknowledgements', 'credit attribution']"
5364,1005.5271,Secretary Aircc Journal,Luis Alvarez Sabucedo and Luis Anido Rifon,"A Restful Approach for Managing Citizen profiles Using A Semantic
  Support","18 Pages, IJDMS","International Journal of Database Management Systems 2.2 (2010)
  1-18",10.5121/ijdms.2010.2201,,cs.IR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Several steps are missing in the current high-speed race towards the holistic
support of citizen needs in the domain of eGovernment. This paper is focused on
how to provide support for the citizen profile. This profile, in a wide sense,
includes personal information as well documents in possession of the citizen.
This also involves the provision of those mechanisms required to publish,
access and submit the convenient information to a Public Administration in due
curse of a transactional services provided with the last one. Main features of
the system are related to interoperability and possibilities for its inclusion
in a cost effective manner in already developed platforms. To make that
possible, this approach will take full advantage of semantic technologies and
the RESTful paradigm to design the entire system. The paper presents the
overall system with some notes on the deployment of the solution for its
further reuse in similar contexts.
","[{'version': 'v1', 'created': 'Fri, 28 May 2010 11:55:04 GMT'}]",2010-07-15,"[['Sabucedo', 'Luis Alvarez', ''], ['Rifon', 'Luis Anido', '']]","['eGovernment', 'semantic', 'software architecture', 'interoperability']"
5365,1811.01163,Alexander Engelmann,"Timm Faulwasser, Alexander Engelmann, Tillmann M\""uhlpfordt, Veit
  Hagenmeyer","Optimal Power Flow: An Introduction to Predictive, Distributed and
  Stochastic Control Challenges",,"at-Automatisierungstechnik, 66(7), 2018, pp. 573-589",10.1515/auto-2018-0040,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Energiewende is a paradigm change that can be witnessed at latest since
the political decision to step out of nuclear energy. Moreover, despite common
roots in Electrical Engineering, the control community and the power systems
community face a lack of common vocabulary. In this context, this paper aims at
providing a systems-and-control specific introduction to optimal power flow
problems which are pivotal in the operation of energy systems. Based on a
concise problem statement, we introduce a common description of optimal power
flow variants including multi-stage-problems and predictive control, stochastic
uncertainties, and issues of distributed optimization. Moreover, we sketch open
questions that might be of interest for the systems and control community.
","[{'version': 'v1', 'created': 'Sat, 3 Nov 2018 05:13:56 GMT'}]",2018-11-13,"[['Faulwasser', 'Timm', ''], ['Engelmann', 'Alexander', ''], ['Mühlpfordt', 'Tillmann', ''], ['Hagenmeyer', 'Veit', '']]","['Optimal power flow', 'stochastic uncertainties', 'distributed optimization', 'modelpredictive control']"
5366,1811.00424,Daniel Rodriguez,"Raul-Jose Palma-Mendoza, Daniel Rodriguez, Luis de-Marcos",Distributed ReliefF based Feature Selection in Spark,,,10.1007/s10115-017-1145-y,,cs.LG cs.DC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feature selection (FS) is a key research area in the machine learning and
data mining fields, removing irrelevant and redundant features usually helps to
reduce the effort required to process a dataset while maintaining or even
improving the processing algorithm's accuracy. However, traditional algorithms
designed for executing on a single machine lack scalability to deal with the
increasing amount of data that has become available in the current Big Data
era. ReliefF is one of the most important algorithms successfully implemented
in many FS applications. In this paper, we present a completely redesigned
distributed version of the popular ReliefF algorithm based on the novel Spark
cluster computing model that we have called DiReliefF. Spark is increasing its
popularity due to its much faster processing times compared with Hadoop's
MapReduce model implementation. The effectiveness of our proposal is tested on
four publicly available datasets, all of them with a large number of instances
and two of them with also a large number of features. Subsets of these datasets
were also used to compare the results to a non-distributed implementation of
the algorithm. The results show that the non-distributed implementation is
unable to handle such large volumes of data without specialized hardware, while
our design can process them in a scalable way with much better processing times
and memory usage.
","[{'version': 'v1', 'created': 'Thu, 1 Nov 2018 15:11:32 GMT'}]",2018-11-02,"[['Palma-Mendoza', 'Raul-Jose', ''], ['Rodriguez', 'Daniel', ''], ['de-Marcos', 'Luis', '']]","['feature selection', 'relieff', 'distributed algorithm', 'big data andapache spark']"
5367,2011.14751,Mat\'u\v{s} Sul\'ir,Mat\'u\v{s} Sul\'ir,"Toward a Benchmark Repository for Software Maintenance Tool Evaluations
  with Humans",,"Proceedings of the 2019 ACM SIGPLAN International Conference on
  Systems, Programming, Languages, and Applications: Software for Humanity
  (SPLASH Companion '19), ACM, 2019, pp. 7-8",10.1145/3359061.3362776,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To evaluate software maintenance techniques and tools in controlled
experiments with human participants, researchers currently use projects and
tasks selected on an ad-hoc basis. This can unrealistically favor their tool,
and it makes the comparison of results difficult. We suggest a gradual creation
of a benchmark repository with projects, tasks, and metadata relevant for
human-based studies. In this paper, we discuss the requirements and challenges
of such a repository, along with the steps which could lead to its
construction.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2020 13:05:38 GMT'}]",2020-12-01,"[['Sulír', 'Matúš', '']]","['benchmarking', 'programming', 'techniques', 'tools']"
5368,1810.09528,Muhammad Usman Rafique,"Nathan Jacobs, Adam Kraft, Muhammad Usman Rafique, Ranti Dev Sharma","A Weakly Supervised Approach for Estimating Spatial Density Functions
  from High-Resolution Satellite Imagery","10 pages, 8 figures. ACM SIGSPATIAL 2018, Seattle, USA","26th ACM SIGSPATIAL International Conference on Advances in
  Geographic Information Systems (SIGSPATIAL 18), 2018, Seattle, WA, USA",10.1145/3274895.3274934,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a neural network component, the regional aggregation layer, that
makes it possible to train a pixel-level density estimator using only
coarse-grained density aggregates, which reflect the number of objects in an
image region. Our approach is simple to use and does not require
domain-specific assumptions about the nature of the density function. We
evaluate our approach on several synthetic datasets. In addition, we use this
approach to learn to estimate high-resolution population and housing density
from satellite imagery. In all cases, we find that our approach results in
better density estimates than a commonly used baseline. We also show how our
housing density estimator can be used to classify buildings as residential or
non-residential.
","[{'version': 'v1', 'created': 'Mon, 22 Oct 2018 20:14:46 GMT'}]",2018-10-24,"[['Jacobs', 'Nathan', ''], ['Kraft', 'Adam', ''], ['Rafique', 'Muhammad Usman', ''], ['Sharma', 'Ranti Dev', '']]","['Remote sensing', 'population density', 'dasymetric mapping']"
5369,1208.4192,Preetha K G,"K G Preetha, A Unnikrishnan, K Poulose Jacob","Performance improvement of multiple Connections in AODV with the concern
  of Node bandwidth","9 Pages, 4 figures","International Journal on AdHoc Networking Systems (IJANS) Vol. 2,
  No. 3, July 2012",10.5121/ijans.2012.23034,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile Ad-hoc Networks (MANETS) consists of a collection of mobile nodes
without having a central coordination. In MANET, node mobility and dynamic
topology play an important role in the performance. MANET provide a solution
for network connection at anywhere and at any time. The major features of MANET
are quick set up, self organization and self maintenance. Routing is a major
challenge in MANET due to it's dynamic topology and high mobility. Several
routing algorithms have been developed for routing. This paper studies the AODV
protocol and how AODV is performed under multiple connections in the network.
Several issues have been identified. The bandwidth is recognized as the
prominent factor reducing the performance of the network. This paper gives an
improvement of normal AODV for simultaneous multiple connections under the
consideration of bandwidth of node.
","[{'version': 'v1', 'created': 'Tue, 21 Aug 2012 05:11:45 GMT'}]",2012-08-22,"[['Preetha', 'K G', ''], ['Unnikrishnan', 'A', ''], ['Jacob', 'K Poulose', '']]","['Mobile Network', 'MANET', 'AODV', 'Multiple connections', 'Bandwidth']"
5370,1007.5129,Secretary  Ijaia,"Mohammed J. Islam, Majid Ahmadi and Maher A. Sid-Ahmed (University of
  Windsor, Canada)","An Efficient Automatic Mass Classification Method In Digitized
  Mammograms Using Artificial Neural Network","13 pages, 10 figures","International Journal of Artificial Intelligence & Applications
  1.3 (2010) 1-13",10.5121/ijaia.2010.1301,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper we present an efficient computer aided mass classification
method in digitized mammograms using Artificial Neural Network (ANN), which
performs benign-malignant classification on region of interest (ROI) that
contains mass. One of the major mammographic characteristics for mass
classification is texture. ANN exploits this important factor to classify the
mass into benign or malignant. The statistical textural features used in
characterizing the masses are mean, standard deviation, entropy, skewness,
kurtosis and uniformity. The main aim of the method is to increase the
effectiveness and efficiency of the classification process in an objective
manner to reduce the numbers of false-positive of malignancies. Three layers
artificial neural network (ANN) with seven features was proposed for
classifying the marked regions into benign and malignant and 90.91% sensitivity
and 83.87% specificity is achieved that is very much promising compare to the
radiologist's sensitivity 75%.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2010 07:19:58 GMT'}]",2010-07-30,"[['Islam', 'Mohammed J.', '', 'University of\n  Windsor, Canada'], ['Ahmadi', 'Majid', '', 'University of\n  Windsor, Canada'], ['Sid-Ahmed', 'Maher A.', '', 'University of\n  Windsor, Canada']]","['Artificial Neural Network', 'Digitized Mammograms', 'Texture Features']"
5371,1511.06975,Shini Renjith,Shini Renjith,"An Integrated Framework to Recommend Personalized Retention Actions to
  Control B2C E-Commerce Customer Churn","6 pages, 7 figures, Published with International Journal of
  Engineering Trends and Technology (IJETT)","IJETT, V27(3),152-157 September 2015. ISSN:2231-5381.
  www.ijettjournal.org",10.14445/22315381/IJETT-V27P227,,cs.IR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Considering the level of competition prevailing in Business-to-Consumer (B2C)
E-Commerce domain and the huge investments required to attract new customers,
firms are now giving more focus to reduce their customer churn rate. Churn rate
is the ratio of customers who part away with the firm in a specific time
period. One of the best mechanism to retain current customers is to identify
any potential churn and respond fast to prevent it. Detecting early signs of a
potential churn, recognizing what the customer is looking for by the movement
and automating personalized win back campaigns are essential to sustain
business in this era of competition. E-Commerce firms normally possess large
volume of data pertaining to their existing customers like transaction history,
search history, periodicity of purchases, etc. Data mining techniques can be
applied to analyse customer behaviour and to predict the potential customer
attrition so that special marketing strategies can be adopted to retain them.
This paper proposes an integrated model that can predict customer churn and
also recommend personalized win back actions.
","[{'version': 'v1', 'created': 'Sun, 22 Nov 2015 07:37:53 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Dec 2021 15:03:43 GMT'}]",2021-12-20,"[['Renjith', 'Shini', '']]","['Business-to-Consumer (B2C) E-commerce', 'Customer Churn', 'Predictive Analytics', 'Cluster Analysis', 'Personalization']"
5372,1705.06342,Thommen Karimpanal George,"Thommen George Karimpanal, Erik Wilhelm","Identification and Off-Policy Learning of Multiple Objectives Using
  Adaptive Clustering","Accepted in Neurocomputing: Special Issue on Multiobjective
  Reinforcement Learning: Theory and Applications, 24 pages, 6 figures","Neurocomputing 263, 39-47, 2017",10.1016/j.neucom.2017.04.074,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we present a methodology that enables an agent to make
efficient use of its exploratory actions by autonomously identifying possible
objectives in its environment and learning them in parallel. The identification
of objectives is achieved using an online and unsupervised adaptive clustering
algorithm. The identified objectives are learned (at least partially) in
parallel using Q-learning. Using a simulated agent and environment, it is shown
that the converged or partially converged value function weights resulting from
off-policy learning can be used to accumulate knowledge about multiple
objectives without any additional exploration. We claim that the proposed
approach could be useful in scenarios where the objectives are initially
unknown or in real world scenarios where exploration is typically a time and
energy intensive process. The implications and possible extensions of this work
are also briefly discussed.
","[{'version': 'v1', 'created': 'Wed, 17 May 2017 20:55:15 GMT'}]",2019-01-11,"[['Karimpanal', 'Thommen George', ''], ['Wilhelm', 'Erik', '']]","['Reinforcement Learning', 'Q-learning', 'Off-Policy', 'AdaptiveClustering', 'Multiobjective learning']"
5373,1112.4057,Bartlomiej Placzek,Bart{\l}omiej P{\l}aczek,"Performance Evaluation of Road Traffic Control Using a Fuzzy Cellular
  Model",The final publication is available at http://www.springerlink.com,"P{\l}aczek, B., Performance Evaluation of Road Traffic Control
  Using a Fuzzy Cellular Model. Lecture Notes in Artificial Intelligence 6679.
  Springer-Verlag, Berlin Heidelberg, pp. 59-66, 2011",10.1007/978-3-642-21222-2_8,,cs.AI cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper a method is proposed for performance evaluation of road traffic
control systems. The method is designed to be implemented in an on-line
simulation environment, which enables optimisation of adaptive traffic control
strategies. Performance measures are computed using a fuzzy cellular traffic
model, formulated as a hybrid system combining cellular automata and fuzzy
calculus. Experimental results show that the introduced method allows the
performance to be evaluated using imprecise traffic measurements. Moreover, the
fuzzy definitions of performance measures are convenient for uncertainty
determination in traffic control decisions.
","[{'version': 'v1', 'created': 'Sat, 17 Dec 2011 14:23:53 GMT'}]",2011-12-20,"[['Płaczek', 'Bartłomiej', '']]","['fuzzy numbers', 'cellular automata', 'traffic control', 'traffic modelling']"
5374,1709.06516,Ismael Torres,"Marc Gil, Christophe Joubert, Ismael Torres","Model-driven Engineering IDE for Quality Assessment of Data-intensive
  Applications",,,10.1145/3053600.3053633,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article introduces a model-driven engineering (MDE) integrated
development environment (IDE) for Data-Intensive Cloud Applications (DIA) with
iterative quality enhancements. As part of the H2020 DICE project (ICT-9-2014,
id 644869), a framework is being constructed and it is composed of a set of
tools developed to support a new MDE methodology. One of these tools is the IDE
which acts as the front-end of the methodology and plays a pivotal role in
integrating the other tools of the framework. The IDE enables designers to
produce from the architectural structure of the general application along with
their properties and QoS/QoD annotations up to the deployment model.
Administrators, quality assurance engineers or software architects may also run
and examine the output of the design and analysis tools in addition to the
designer in order to assess the DIA quality in an iterative process.
","[{'version': 'v1', 'created': 'Wed, 19 Jul 2017 10:49:16 GMT'}]",2017-09-20,"[['Gil', 'Marc', ''], ['Joubert', 'Christophe', ''], ['Torres', 'Ismael', '']]","['IDE', 'Data-intensive technologies', 'Eclipse', 'Model-driven engineering', 'Quality-assessment']"
5375,1810.07042,Sayed Chhattan Shah,Sayed Chhattan Shah,Recent Advances in Mobile Grid and Cloud Computing,24 pages,"Intelligent Automation and Soft Computing, February 2017",10.1080/10798587.2017.1280995,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Grid and cloud computing systems have been extensively used to solve large
and complex problems in science and engineering areas. These systems include
powerful computing resources connected through high-speed networks. Due to
recent advances in mobile computing and networking technologies, it has become
feasible to integrate various mobile devices such as robots, aerial vehicles,
sensors, and smartphones with grid and cloud computing systems. This
integration enables design and development of next generation of applications
through sharing of resources in mobile environments and also introduces several
challenges due to dynamic and unpredictable network. This paper discusses
applications, research challenges involved in design and development of mobile
grid and cloud computing systems, and recent advances in the field.
","[{'version': 'v1', 'created': 'Tue, 16 Oct 2018 14:42:04 GMT'}]",2018-10-17,"[['Shah', 'Sayed Chhattan', '']]","['Cloud Robotics', 'Sensor Cloud', 'Mobile Distributed Systems', 'Ad hoc Networks']"
5376,1901.04392,Pierre Tirilly,"Pierre Falez, Pierre Tirilly, Ioan Marius Bilasco, Philippe Devienne,
  Pierre Boulet","Unsupervised Visual Feature Learning with Spike-timing-dependent
  Plasticity: How Far are we from Traditional Feature Learning Approaches?",,,10.1016/j.patcog.2019.04.016,,cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spiking neural networks (SNNs) equipped with latency coding and spike-timing
dependent plasticity rules offer an alternative to solve the data and energy
bottlenecks of standard computer vision approaches: they can learn visual
features without supervision and can be implemented by ultra-low power hardware
architectures. However, their performance in image classification has never
been evaluated on recent image datasets. In this paper, we compare SNNs to
auto-encoders on three visual recognition datasets, and extend the use of SNNs
to color images. The analysis of the results helps us identify some bottlenecks
of SNNs: the limits of on-center/off-center coding, especially for color
images, and the ineffectiveness of current inhibition mechanisms. These issues
should be addressed to build effective SNNs for image recognition.
","[{'version': 'v1', 'created': 'Mon, 14 Jan 2019 16:42:30 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Apr 2019 11:04:24 GMT'}]",2020-12-22,"[['Falez', 'Pierre', ''], ['Tirilly', 'Pierre', ''], ['Bilasco', 'Ioan Marius', ''], ['Devienne', 'Philippe', ''], ['Boulet', 'Pierre', '']]","['feature learning', 'unsupervised learning', 'spiking neural networks', 'spike-timing dependent plasticity', 'auto-encoders', 'image recognition']"
5377,2105.10845,Stuart Eiffert,"Stuart Eiffert, Nathan D. Wallace, He Kong, Navid Pirmarzdashti, and
  Salah Sukkarieh","Experimental Evaluation of a Hierarchical Operating Framework for Ground
  Robots in Agriculture","Accepted for publication in the 17th International Symposium of
  Experimental Robotics (ISER 2020), SPAR, Springer Nature",,10.1007/978-3-030-71151-1_14,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  For mobile robots to be effectively applied to real world unstructured
environments -- such as large scale farming -- they require the ability to
generate adaptive plans that account both for limited onboard resources, and
the presence of dynamic changes, including nearby moving individuals. This work
provides a real world empirical evaluation of our proposed hierarchical
framework for long-term autonomy of field robots, conducted on University of
Sydney's Swagbot agricultural robot platform. We demonstrate the ability of the
framework to navigate an unstructured and dynamic environment in an effective
manner, validating its use for long-term deployment in large scale farming, for
tasks such as autonomous weeding in the presence of moving individuals.
","[{'version': 'v1', 'created': 'Sun, 23 May 2021 01:57:47 GMT'}]",2021-05-25,"[['Eiffert', 'Stuart', ''], ['Wallace', 'Nathan D.', ''], ['Kong', 'He', ''], ['Pirmarzdashti', 'Navid', ''], ['Sukkarieh', 'Salah', '']]","['Field Robotics', 'Navigation', 'Dynamic Path Planning']"
5378,1806.08291,Duc A. Hoang,"Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara",Shortest Reconfiguration Sequence for Sliding Tokens on Spiders,Accepted for presentation at CIAC 2019,,10.1007/978-3-030-17402-6_22,,cs.DS cs.DM math.CO,http://creativecommons.org/licenses/by-sa/4.0/,"  Suppose that two independent sets $I$ and $J$ of a graph with $\vert I \vert
= \vert J \vert$ are given, and a token is placed on each vertex in $I$. The
Sliding Token problem is to determine whether there exists a sequence of
independent sets which transforms $I$ into $J$ so that each independent set in
the sequence results from the previous one by sliding exactly one token along
an edge in the graph. It is one of the representative reconfiguration problems
that attract the attention from the viewpoint of theoretical computer science.
For a yes-instance of a reconfiguration problem, finding a shortest
reconfiguration sequence has a different aspect. In general, even if it is
polynomial time solvable to decide whether two instances are reconfigured with
each other, it can be $\mathsf{NP}$-hard to find a shortest sequence between
them. In this paper, we show that the problem for finding a shortest sequence
between two independent sets is polynomial time solvable for spiders (i.e.,
trees having exactly one vertex of degree at least three).
","[{'version': 'v1', 'created': 'Thu, 21 Jun 2018 15:32:45 GMT'}, {'version': 'v2', 'created': 'Sat, 27 Oct 2018 06:41:33 GMT'}, {'version': 'v3', 'created': 'Wed, 30 Jan 2019 15:03:58 GMT'}]",2019-05-22,"[['Hoang', 'Duc A.', ''], ['Khorramian', 'Amanj', ''], ['Uehara', 'Ryuhei', '']]","['sliding token', 'shortest reconfiguration', 'independent set', 'spider tree', 'polynomial-timealgorithm']"
5379,1507.03518,Homa Alemzadeh,"Homa Alemzadeh, Ravishankar K. Iyer, Zbigniew Kalbarczyk, Nancy
  Leveson, Jaishankar Raman","Adverse Events in Robotic Surgery: A Retrospective Study of 14 Years of
  FDA Data","Presented as the J. Maxwell Chamberlain Memorial Paper for adult
  cardiac surgery at the 50th Annual Meeting of the Society of Thoracic
  Surgeons in January. See Appendix for more detailed results, discussions, and
  related work. Updated the headers",PLOS ONE 11(4) (2016) e0151470,10.1371/journal.pone.0151470,,cs.RO cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding the causes and patient impacts of surgical adverse events will
help improve systems and operational practices to avoid incidents in the
future. We analyzed the adverse events data related to robotic systems and
instruments used in minimally invasive surgery, reported to the U.S. FDA MAUDE
database from January 2000 to December 2013. We determined the number of events
reported per procedure and per surgical specialty, the most common types of
device malfunctions and their impact on patients, and the causes for
catastrophic events such as major complications, patient injuries, and deaths.
During the study period, 144 deaths (1.4% of the 10,624 reports), 1,391 patient
injuries (13.1%), and 8,061 device malfunctions (75.9%) were reported. The
numbers of injury and death events per procedure have stayed relatively
constant since 2007 (mean = 83.4, 95% CI, 74.2-92.7). Surgical specialties, for
which robots are extensively used, such as gynecology and urology, had lower
number of injuries, deaths, and conversions per procedure than more complex
surgeries, such as cardiothoracic and head and neck (106.3 vs. 232.9, Risk
Ratio = 2.2, 95% CI, 1.9-2.6). Device and instrument malfunctions, such as
falling of burnt/broken pieces of instruments into the patient (14.7%),
electrical arcing of instruments (10.5%), unintended operation of instruments
(8.6%), system errors (5%), and video/imaging problems (2.6%), constituted a
major part of the reports. Device malfunctions impacted patients in terms of
injuries or procedure interruptions. In 1,104 (10.4%) of the events, the
procedure was interrupted to restart the system (3.1%), to convert the
procedure to non-robotic techniques (7.3%), or to reschedule it to a later time
(2.5%). Adoption of advanced techniques in design and operation of robotic
surgical systems may reduce these preventable incidents in the future.
","[{'version': 'v1', 'created': 'Mon, 13 Jul 2015 19:41:14 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Jul 2015 02:06:44 GMT'}]",2016-11-29,"[['Alemzadeh', 'Homa', ''], ['Iyer', 'Ravishankar K.', ''], ['Kalbarczyk', 'Zbigniew', ''], ['Leveson', 'Nancy', ''], ['Raman', 'Jaishankar', '']]","['Robotics', 'Minimally invasive surgery', 'Patient safety', 'Surgery complications', 'Surgical']"
5380,1404.1292,Omaima Al-Allaf Nazar,Omaima N. A. AL-Allaf,"Review of Face Detection Systems Based Artificial Neural Networks
  Algorithms","16 pages, 12 figures, 1 table, IJMA Journal","The International Journal of Multimedia & Its Applications (IJMA)
  Vol.6, No.1, February 2014",10.5121/ijma.2013.6101,,cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Face detection is one of the most relevant applications of image processing
and biometric systems. Artificial neural networks (ANN) have been used in the
field of image processing and pattern recognition. There is lack of literature
surveys which give overview about the studies and researches related to the
using of ANN in face detection. Therefore, this research includes a general
review of face detection studies and systems which based on different ANN
approaches and algorithms. The strengths and limitations of these literature
studies and systems were included also.
","[{'version': 'v1', 'created': 'Thu, 20 Mar 2014 19:47:58 GMT'}]",2014-04-07,"[['AL-Allaf', 'Omaima N. A.', '']]","['Face Detection', 'Face Recognition', 'Artificial Neural Networks']"
5381,1810.12253,Jesse Beisegel,"Jesse Beisegel and Carolin Denkert and Ekkehard K\""ohler and
  Matja\v{z} Krnc and Nevena Piva\v{c} and Robert Scheffler and Martin Strehler",On the End-Vertex Problem of Graph Searches,,"Discrete Mathematics & Theoretical Computer Science, vol. 21 no.
  1, ICGT 2018 (June 13, 2019) dmtcs:5572",10.23638/DMTCS-21-1-13,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  End vertices of graph searches can exhibit strong structural properties and
are crucial for many graph algorithms. The problem of deciding whether a given
vertex of a graph is an end-vertex of a particular search was first introduced
by Corneil, K\""ohler and Lanlignel in 2010. There they showed that this problem
is in fact NP-complete for LBFS on weakly chordal graphs. A similar result for
BFS was obtained by Charbit, Habib and Mamcarz in 2014. Here, we prove that the
end-vertex problem is NP-complete for MNS on weakly chordal graphs and for MCS
on general graphs. Moreover, building on previous results, we show that this
problem is linear for various searches on split and unit interval graphs.
","[{'version': 'v1', 'created': 'Mon, 29 Oct 2018 17:00:48 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Oct 2018 16:17:05 GMT'}, {'version': 'v3', 'created': 'Wed, 15 May 2019 12:42:14 GMT'}, {'version': 'v4', 'created': 'Mon, 20 May 2019 14:30:42 GMT'}, {'version': 'v5', 'created': 'Wed, 5 Jun 2019 14:26:50 GMT'}]",2021-01-04,"[['Beisegel', 'Jesse', ''], ['Denkert', 'Carolin', ''], ['Köhler', 'Ekkehard', ''], ['Krnc', 'Matjaž', ''], ['Pivač', 'Nevena', ''], ['Scheffler', 'Robert', ''], ['Strehler', 'Martin', '']]","['end-vertex', 'graph search', 'maximum cardinality search', 'maximal neighborhood search', 'graph classes']"
5382,1903.00077,Jeannette Janssen,Joshua Feldman and Jeannette Janssen,"High Degree Vertices and Spread of Infections in Spatially Modelled
  Social Networks",,"In: Bonato A., Chung Graham F., Pra{\l}at P. (eds) Algorithms and
  Models for the Web Graph. WAW 2017. LNCS 10519. Springer, pp. 60-74",10.1007/978-3-319-67810-8_5,,cs.SI math.CO physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We examine how the behaviour of high degree vertices in a network affects
whether an infection spreads through communities or jumps between them. We
study two stochastic susceptible-infected-recovered (SIR) processes and
represent our network with a spatial preferential attachment (SPA) network. In
one of the two epidemic scenarios we adjust the contagiousness of high degree
vertices so that they are less contagious. We show that, for this scenario, the
infection travels through communities rather than jumps between them. We
conjecture that this is not the case in the other scenario, when contagion is
independent of the degree of the originating vertex. Our theoretical results
and conjecture are supported by simulations.
","[{'version': 'v1', 'created': 'Thu, 28 Feb 2019 21:39:12 GMT'}]",2019-03-04,"[['Feldman', 'Joshua', ''], ['Janssen', 'Jeannette', '']]","['Spatial graph model', 'preferential attachment', 'infection innetworks', 'contact process']"
5383,1006.1193,Secretary Aircc Journal,"P.Raja Rajeswari (1) Allam Apparo (2) and V.K. Kumar (3) ((1) Acharya
  Nagarjuna University, India, (2) Jawaharlal Nehru Technological University,
  India and (3) S.V.H. College Of Engineering, India)","Genbit Compress Tool(GBC): A Java-Based Tool to Compress DNA Sequences
  and Compute Compression Ratio(bits/base) of Genomes",11 pages,"International Journal of Computer Science and Information
  Technology 2.3 (2010) 181-191",10.5121/ijcsit.2010.2313,,cs.MS,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We present a Compression Tool, ""GenBit Compress"", for genetic sequences based
on our new proposed ""GenBit Compress Algorithm"". Our Tool achieves the best
compression ratios for Entire Genome (DNA sequences) . Significantly better
compression results show that GenBit compress algorithm is the best among the
remaining Genome compression algorithms for non-repetitive DNA sequences in
Genomes. The standard Compression algorithms such as gzip or compress cannot
compress DNA sequences but only expand them in size. In this paper we consider
the problem of DNA compression. It is well known that one of the main features
of DNA Sequences is that they contain substrings which are duplicated except
for a few random Mutations. For this reason most DNA compressors work by
searching and encoding approximate repeats. We depart from this strategy by
searching and encoding only exact repeats. our proposed algorithm achieves the
best compression ratio for DNA sequences for larger genome. As long as 8 lakh
characters can be given as input While achieving the best compression ratios
for DNA sequences, our new GenBit Compress program significantly improves the
running time of all previous DNA compressors. Assigning binary bits for
fragments of DNA sequence is also a unique concept introduced in this program
for the first time in DNA compression.
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2010 07:37:49 GMT'}]",2010-07-15,"[['Rajeswari', 'P. Raja', ''], ['Apparo', 'Allam', ''], ['Kumar', 'V. K.', '']]","['compression', 'biocompress', 'Gencompress', 'compression ratio', 'encode', 'decode']"
5384,0709.4669,Muhammad Marwan Muhammad Fuad,"Muhammad Marwan Muhammad Fuad (VALORIA), Pierre-Fran\c{c}ois Marteau
  (VALORIA)",The Extended Edit Distance Metric,Technical report,"Content-Based Multimedia Indexing, CBMI 2008, london : United
  Kingdom (2008)",10.1109/CBMI.2008.4564953,,cs.IR,,"  Similarity search is an important problem in information retrieval. This
similarity is based on a distance. Symbolic representation of time series has
attracted many researchers recently, since it reduces the dimensionality of
these high dimensional data objects. We propose a new distance metric that is
applied to symbolic data objects and we test it on time series data bases in a
classification task. We compare it to other distances that are well known in
the literature for symbolic data objects. We also prove, mathematically, that
our distance is metric.
","[{'version': 'v1', 'created': 'Fri, 28 Sep 2007 18:45:48 GMT'}]",2010-06-18,"[['Fuad', 'Muhammad Marwan Muhammad', '', 'VALORIA'], ['Marteau', 'Pierre-François', '', 'VALORIA']]","['Time Series', 'Symbolic Representation', 'SAX', 'Edit Distance', 'Extended Edit Distance']"
5385,1005.1758,Secretary Aircc Journal,"Ayman Khalil, Matthieu Crussiere and Jean-Francois Helard, (Institute
  of Electronics and Telecommunications of Rennes, France)","Cross-Layer Resource Allocation Scheme Under Heterogeneous Constraints
  for Next Generation High Rate WPAN","17 Pages, IJCNC","International Journal of Computer Networks & Communications 2.3
  (2010) 152-168",10.5121/ijcnc.2010.2312,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In the next generation wireless networks, the growing demand for new wireless
applications is accompanied with high expectations for better quality of
service (QoS) fulfillment especially for multimedia applications. Furthermore,
the coexistence of future unlicensed users with existing licensed users is
becoming a challenging task in the next generation communication systems to
overcome the underutilization of the spectrum. A QoS and interference aware
resource allocation is thus of special interest in order to respond to the
heterogeneous constraints of the next generation networks. In this work, we
address the issue of resource allocation under heterogeneous constraints for
unlicensed multiband ultra-wideband (UWB) systems in the context of Future Home
Networks, i.e. the wireless personal area network (WPAN). The problem is first
studied analytically using a heterogeneous constrained optimization problem
formulation. After studying the characteristics of the optimal solution, we
propose a low-complexity suboptimal algorithm based on a cross-layer approach
that combines information provided by the PHY and MAC layers. While the PHY
layer is responsible for providing the channel quality of the unlicensed UWB
users as well as their interference power that they cause on licensed users,
the MAC layer is responsible for classifying the unlicensed users using a
two-class based approach that guarantees for multimedia services a
high-priority level compared to other services. Combined in an efficient and
simple way, the PHY and MAC information present the key elements of the aimed
resource allocation. Simulation results demonstrate that the proposed scheme
provides a good tradeoff between the QoS satisfaction of the unlicensed
applications with hard QoS requirements and the limitation of the interference
affecting the licensed users.
","[{'version': 'v1', 'created': 'Tue, 11 May 2010 08:45:24 GMT'}]",2010-07-15,"[['Khalil', 'Ayman', ''], ['Crussiere', 'Matthieu', ''], ['Helard', 'Jean-Francois', '']]","['Interference limitation', 'MB-OFDM', 'QoS', 'service differentiation']"
5386,1709.03265,Robert Riemann,"St\'ephane Grumbach (DICE), Robert Riemann (DICE)",Secure and Trustable Distributed Aggregation based on Kademlia,,"ICT Systems Security and Privacy Protection: 32nd IFIP TC 11
  International Conference, May 2017, Rome, Italy. pp.171-185, 2017",10.1007/978-3-319-58469-0_12,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aggregation of values that need to be kept confidential while guaranteeing
the robustness of the process and the correctness of the result is required in
an increasing number of applications. We propose an aggregation algorithm,
which supports a large spectrum of potential applications including complex
voting protocols. It relies on the distributed hash table Kademlia, used in
BitTorrent, for pseudonymous communication between randomly predetermined peers
to ensure a high degree of confidentiality which does not solely relies on
cryptography. The distribution of data and computation limits the potential for
data breaches, and reduces the need for institutional trust. Experimental
results confirm the complexity of O(n) for n peers allowing for large-scale
applications.
","[{'version': 'v1', 'created': 'Mon, 11 Sep 2017 07:05:26 GMT'}]",2017-09-12,"[['Grumbach', 'Stéphane', '', 'DICE'], ['Riemann', 'Robert', '', 'DICE']]","['distributed aggregation', 'DHT', 'privacy', 'trust']"
5387,1602.00661,Simon De Ridder,"Simon De Ridder, Benjamin Vandermarliere, Jan Ryckebusch","Detection and localization of change points in temporal networks with
  the aid of stochastic block models","This is an author-created, un-copyedited version of an article
  accepted for publication/published in Journal of Statistical Mechanics:
  Theory and Experiment. IOP Publishing Ltd is not responsible for any errors
  or omissions in this version of the manuscript or any version derived from
  it. The Version of Record is available online at
  http://dx.doi.org/10.1088/1742-5468/2016/11/113302",J. Stat. Mech.(2016) 113302,10.1088/1742-5468/2016/11/113302,,cs.SI physics.data-an physics.soc-ph stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A framework based on generalized hierarchical random graphs (GHRGs) for the
detection of change points in the structure of temporal networks has recently
been developed by Peel and Clauset [1]. We build on this methodology and extend
it to also include the versatile stochastic block models (SBMs) as a parametric
family for reconstructing the empirical networks. We use five different
techniques for change point detection on prototypical temporal networks,
including empirical and synthetic ones. We find that none of the considered
methods can consistently outperform the others when it comes to detecting and
locating the expected change points in empirical temporal networks. With
respect to the precision and the recall of the results of the change points, we
find that the method based on a degree-corrected SBM has better recall
properties than other dedicated methods, especially for sparse networks and
smaller sliding time window widths.
","[{'version': 'v1', 'created': 'Mon, 1 Feb 2016 20:17:03 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Nov 2016 11:15:10 GMT'}]",2016-11-18,"[['De Ridder', 'Simon', ''], ['Vandermarliere', 'Benjamin', ''], ['Ryckebusch', 'Jan', '']]","['Random graphs', 'networks', 'Network dynamics', 'Statistical inference', 'Messagepassing algorithms']"
5388,1705.07839,Ivo Sousa,"Ivo Sousa, Maria Paula Queluz and Ant\'onio Rodrigues",A Survey on QoE-oriented Wireless Resources Scheduling,"Revised version: updated according to the most recent related
  literature; added references; corrected typos",J.Netw.Comput.Appl 158 (2020) 102594,10.1016/j.jnca.2020.102594,,cs.NI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Future wireless systems are expected to provide a wide range of services to
more and more users. Advanced scheduling strategies thus arise not only to
perform efficient radio resource management, but also to provide fairness among
the users. On the other hand, the users' perceived quality, i.e., Quality of
Experience (QoE), is becoming one of the main drivers within the schedulers
design. In this context, this paper starts by providing a comprehension of what
is QoE and an overview of the evolution of wireless scheduling techniques.
Afterwards, a survey on the most recent QoE-based scheduling strategies for
wireless systems is presented, highlighting the application/service of the
different approaches reported in the literature, as well as the parameters that
were taken into account for QoE optimization. Therefore, this paper aims at
helping readers interested in learning the basic concepts of QoE-oriented
wireless resources scheduling, as well as getting in touch with its current
research frontier.
","[{'version': 'v1', 'created': 'Mon, 22 May 2017 16:33:30 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Mar 2019 21:53:41 GMT'}, {'version': 'v3', 'created': 'Sat, 14 Mar 2020 14:08:39 GMT'}]",2020-03-23,"[['Sousa', 'Ivo', ''], ['Queluz', 'Maria Paula', ''], ['Rodrigues', 'António', '']]","['Quality of Experience (QoE)', 'Scheduling', 'Radio Resource Management', 'Wireless Networks']"
5389,1903.07748,Panagiotis Tampakis,"Panagiotis Tampakis, Christos Doulkeridis, Nikos Pelekis and Yannis
  Theodoridis",Distributed Subtrajectory Join on Massive Datasets,,"ACM Transactions on Spatial Algorithms and Systems (TSAS), Volume
  6, Issue 2, (2020), Article No.: 8",10.1145/3373642,,cs.DB cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Joining trajectory datasets is a significant operation in mobility data
analytics and the cornerstone of various methods that aim to extract knowledge
out of them. In the era of Big Data, the production of mobility data has become
massive and, consequently, performing such an operation in a centralized way is
not feasible. In this paper, we address the problem of Distributed
Subtrajectory Join processing by utilizing the MapReduce programming model.
Compared to traditional trajectory join queries, this problem is even more
challenging since the goal is to retrieve all the ""maximal"" portions of
trajectories that are ""similar"". We propose three solutions: (i) a
well-designed basic solution, coined DTJb, (ii) a solution that uses a
preprocessing step that repartitions the data, labeled DTJr, and (iii) a
solution that, additionally, employs an indexing scheme, named DTJi. In our
experimental study, we utilize a 56GB dataset of real trajectories from the
maritime domain, which, to the best of our knowledge, is the largest real
dataset used for experimentation in the literature of trajectory data
management. The results show that DTJi performs up to 16x faster compared with
DTJb, 10x faster than DTJr and 3x faster than the closest related state of the
art algorithm.
","[{'version': 'v1', 'created': 'Mon, 18 Mar 2019 22:39:30 GMT'}]",2020-02-07,"[['Tampakis', 'Panagiotis', ''], ['Doulkeridis', 'Christos', ''], ['Pelekis', 'Nikos', ''], ['Theodoridis', 'Yannis', '']]","['(Sub)Trajectory Join', 'Distributed Join Processing', 'MapReduce']"
5390,1605.06417,Yuan Jiang,"Wei Shen, Yuan Jiang, Wenjing Gao, Dan Zeng, Xinggang Wang",Shape Recognition by Bag of Skeleton-associated Contour Parts,10 pages. Has been Accepted by Pattern Recognition Letters 2016,,10.1007/978-3-662-45646-0_40,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Contour and skeleton are two complementary representations for shape
recognition. However combining them in a principal way is nontrivial, as they
are generally abstracted by different structures (closed string vs graph),
respectively. This paper aims at addressing the shape recognition problem by
combining contour and skeleton according to the correspondence between them.
The correspondence provides a straightforward way to associate skeletal
information with a shape contour. More specifically, we propose a new shape
descriptor. named Skeleton-associated Shape Context (SSC), which captures the
features of a contour fragment associated with skeletal information. Benefited
from the association, the proposed shape descriptor provides the complementary
geometric information from both contour and skeleton parts, including the
spatial distribution and the thickness change along the shape part. To form a
meaningful shape feature vector for an overall shape, the Bag of Features
framework is applied to the SSC descriptors extracted from it. Finally, the
shape feature vector is fed into a linear SVM classifier to recognize the
shape. The encouraging experimental results demonstrate that the proposed way
to combine contour and skeleton is effective for shape recognition, which
achieves the state-of-the-art performances on several standard shape
benchmarks.
","[{'version': 'v1', 'created': 'Fri, 20 May 2016 16:07:41 GMT'}]",2016-05-23,"[['Shen', 'Wei', ''], ['Jiang', 'Yuan', ''], ['Gao', 'Wenjing', ''], ['Zeng', 'Dan', ''], ['Wang', 'Xinggang', '']]","['Shape recognition', 'skeleton-associated contour parts', 'bag of features']"
5391,1902.09820,Michele Tonutti,"Michele Tonutti, Emanuele Ruffaldi, Alessandro Cattaneo, Carlo Alberto
  Avizzano","Robust and Subject-Independent Driving Manoeuvre Anticipation through
  Domain-Adversarial Recurrent Neural Networks","40 pages, 4 figures. Published online in Robotics and Autonomous
  Systems",Robot.Auton.Syst. 115 (2019) 162-173,10.1016/j.robot.2019.02.007,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Through deep learning and computer vision techniques, driving manoeuvres can
be predicted accurately a few seconds in advance. Even though adapting a
learned model to new drivers and different vehicles is key for robust
driver-assistance systems, this problem has received little attention so far.
This work proposes to tackle this challenge through domain adaptation, a
technique closely related to transfer learning. A proof of concept for the
application of a Domain-Adversarial Recurrent Neural Network (DA-RNN) to
multi-modal time series driving data is presented, in which domain-invariant
features are learned by maximizing the loss of an auxiliary domain classifier.
Our implementation is evaluated using a leave-one-driver-out approach on
individual drivers from the Brain4Cars dataset, as well as using a new dataset
acquired through driving simulations, yielding an average increase in
performance of 30% and 114% respectively compared to no adaptation. We also
show the importance of fine-tuning sections of the network to optimise the
extraction of domain-independent features. The results demonstrate the
applicability of the approach to driver-assistance systems as well as training
and simulation environments.
","[{'version': 'v1', 'created': 'Tue, 26 Feb 2019 09:32:14 GMT'}]",2019-03-12,"[['Tonutti', 'Michele', ''], ['Ruffaldi', 'Emanuele', ''], ['Cattaneo', 'Alessandro', ''], ['Avizzano', 'Carlo Alberto', '']]","['Manoeuvre anticipation', 'ADAS', 'Deep learning', 'LSTM', 'Recurrent']"
5392,1603.04139,Frank Nielsen,Junlin Yao and Frank Nielsen,"SSSC-AM: A Unified Framework for Video Co-Segmentation by Structured
  Sparse Subspace Clustering with Appearance and Motion Features","19 pages, 6 figures, 5 tables, extend ICIP 2016","IEEE International Conference on Image Processing (ICIP), 2016",10.1109/ICIP.2016.7533102,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video co-segmentation refers to the task of jointly segmenting common objects
appearing in a given group of videos. In practice, high-dimensional data such
as videos can be conceptually thought as being drawn from a union of subspaces
corresponding to categories rather than from a smooth manifold. Therefore,
segmenting data into respective subspaces --- subspace clustering --- finds
widespread applications in computer vision, including co-segmentation.
State-of-the-art methods via subspace clustering seek to solve the problem in
two steps:
  First, an affinity matrix is built from data, with appearance features or
motion patterns. Second, the data are segmented by applying spectral clustering
to the affinity matrix. However, this process is insufficient to obtain an
optimal solution since it does not take into account the {\em interdependence}
of the affinity matrix with the segmentation. In this work, we present a novel
unified video co-segmentation framework inspired by the recent Structured
Sparse Subspace Clustering ($\mathrm{S^{3}C}$) based on the {\em
self-expressiveness} model. Our method yields more consistent segmentation
results. In order to improve the detectability of motion features with missing
trajectories due to occlusion or tracked points moving out of frames, we add an
extra-dimensional signature to the motion trajectories. Moreover, we
reformulate the $\mathrm{S^{3}C}$ algorithm by adding the affine subspace
constraint in order to make it more suitable to segment rigid motions lying in
affine subspaces of dimension at most $3$. Our experiments on MOViCS dataset
show that our framework achieves the highest overall performance among baseline
algorithms and demonstrate its robustness to heavy noise.
","[{'version': 'v1', 'created': 'Mon, 14 Mar 2016 05:36:40 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Sep 2016 22:05:15 GMT'}]",2021-04-29,"[['Yao', 'Junlin', ''], ['Nielsen', 'Frank', '']]","['Object video co-segmentation', 'subspace clustering', 'self-expressiveness model', 'sparse representation', 'affine motion subspaces']"
5393,1907.07009,Moreno Marzolla,Moreno Marzolla and Raffaela Mirandola,"Gender Balance in Computer Science and Engineering in Italian
  Universities",,"Proceedings of the 13th European Conference on Software
  Architecture - Volume 2 Pages 82-87, Paris, France, September 09-13, 2019",10.1145/3344948.3344966,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multiple studies have shown that gender balance in the fields of Science,
Technology, Engineering and Maths -- and in particular in ICT -- is still far
to be achieved. Several initiatives have been recently taken to increase the
women participation, but it is difficult, at present, to evaluate their impact
and their potential of changing the situation. This paper contributes to the
discussion by presenting a descriptive analysis of the gender balance in
Computer Science and Computer Engineering in Italian Universities.
","[{'version': 'v1', 'created': 'Tue, 16 Jul 2019 13:55:55 GMT'}]",2019-09-11,"[['Marzolla', 'Moreno', ''], ['Mirandola', 'Raffaela', '']]","['gender equality', 'Italy', 'computer education', 'statistical study']"
5394,1606.07777,Vicen\c{c} G\'omez Cerd\`a,"Dominik Thalmeier, Vicen\c{c} G\'omez, Hilbert J. Kappen","Action selection in growing state spaces: Control of Network Structure
  Growth","23 pages, 7 figures","Journal of Physics A: Mathematical and Theoretical, Volume 50,
  Number 3, 034006, 2017",10.1088/1751-8121/50/3/034006,,cs.SI cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The dynamical processes taking place on a network depend on its topology.
Influencing the growth process of a network therefore has important
implications on such dynamical processes. We formulate the problem of
influencing the growth of a network as a stochastic optimal control problem in
which a structural cost function penalizes undesired topologies. We approximate
this control problem with a restricted class of control problems that can be
solved using probabilistic inference methods. To deal with the increasing
problem dimensionality, we introduce an adaptive importance sampling method for
approximating the optimal control. We illustrate this methodology in the
context of formation of information cascades, considering the task of
influencing the structure of a growing conversation thread, as in Internet
forums. Using a realistic model of growing trees, we show that our approach can
yield conversation threads with better structural properties than the ones
observed without control.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2016 13:04:29 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Dec 2016 16:35:45 GMT'}]",2016-12-28,"[['Thalmeier', 'Dominik', ''], ['Gómez', 'Vicenç', ''], ['Kappen', 'Hilbert J.', '']]","['control', 'complex Networks', 'sampling', 'conversation threads']"
5395,1004.3774,Couvreur Alain,Alain Couvreur,Incidence structures from the blown-up plane and LDPC codes,"31 pages, 10 figures","IEEE, Trans. Inform. Theory, volume 57(7), Pages 4401 - 4416, 2011",10.1109/TIT.2011.2146490,,cs.IT math.AG math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, new regular incidence structures are presented. They arise
from sets of conics in the affine plane blown-up at its rational points. The
LDPC codes given by these incidence matrices are studied. These sparse
incidence matrices turn out to be redundant, which means that their number of
rows exceeds their rank. Such a feature is absent from random LDPC codes and is
in general interesting for the efficiency of iterative decoding. The
performance of some codes under iterative decoding is tested. Some of them turn
out to perform better than regular Gallager codes having similar rate and row
weight.
","[{'version': 'v1', 'created': 'Wed, 21 Apr 2010 19:07:54 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Nov 2010 21:03:51 GMT'}, {'version': 'v3', 'created': 'Mon, 24 Jan 2011 12:05:17 GMT'}]",2015-03-14,"[['Couvreur', 'Alain', '']]","['Incidence structures', 'LDPC codes', 'algebraic geometry', 'finite geometry', 'conics', 'linear systems of curves', 'blowing up']"
5396,1610.00361,Csaba D. Toth,Hugo A. Akitaya and Csaba D. T\'oth,Reconstruction of weakly simple polygons from their edges,"15 pages, 8 figures. The first 12 pages will appear in the
  Proceedings of the 27th International Symposium on Algorithms and Computation
  (December 12-14 2016, Sydney, Australia)",Internat. J. Comput. Geom. Appl. 28 (2) (2018) 161-180,10.1142/S021819591860004X,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given $n$ line segments in the plane, do they form the edge set of a
\emph{weakly simple polygon}; that is, can the segment endpoints be perturbed
by at most $\varepsilon$, for any $\varepsilon>0$, to obtain a simple polygon?
While the analogous question for \emph{simple polygons} can easily be answered
in $O(n\log n)$ time, we show that it is NP-complete for weakly simple
polygons. We give $O(n)$-time algorithms in two special cases: when all
segments are collinear, or the segment endpoints are in general position. These
results extend to the variant in which the segments are \emph{directed}, and
the counterclockwise traversal of a polygon should follow the orientation.
  We study related problems for the case that the union of the $n$ input
segments is connected. (i) If each segment can be subdivided into several
segments, find the minimum number of subdivision points to form a weakly simple
polygon. (ii) If new line segments can be added, find the minimum total length
of new segments that creates a weakly simple polygon. We give worst-case upper
and lower bounds for both problems.
","[{'version': 'v1', 'created': 'Sun, 2 Oct 2016 22:12:56 GMT'}]",2018-12-27,"[['Akitaya', 'Hugo A.', ''], ['Tóth', 'Csaba D.', '']]","['simple polygon', 'line segment', 'geometric graph']"
5397,0710.3918,Bernard Cousin,"Simon Gyula (IRISA), Miklos Molnar (IRISA), Laszlo Gonczy (IRISA),
  Bernard Cousin (IRISA)",Dependable k-coverage algorithms for sensor networks,,"Dans Instrumentation and Measurement Technology Conference
  Proceedings - IEEE Instrumentation and Measurement Technology Conference,
  Varsovie : Pologne (2007)",10.1109/IMTC.2007.379153,,cs.NI,,"  Redundant sensing capabilities are often required in sensor network
applications due to various reasons, e.g. robustness, fault tolerance, or
increased accuracy. At the same time high sensor redundancy offers the
possibility of increasing network lifetime by scheduling sleep intervals for
some sensors and still providing continuous service with help of the remaining
active sensors. In this paper centralized and distributed algorithms are
proposed to solve the k-coverage sensing problem and maximize network lifetime.
When physically possible, the proposed robust Controlled Greedy Sleep Algorithm
provides guaranteed service independently of node and communication errors in
the network. The performance of the algorithm is illustrated and compared to
results of a random solution by simulation examples.
","[{'version': 'v1', 'created': 'Sun, 21 Oct 2007 09:48:42 GMT'}]",2007-10-23,"[['Gyula', 'Simon', '', 'IRISA'], ['Molnar', 'Miklos', '', 'IRISA'], ['Gonczy', 'Laszlo', '', 'IRISA'], ['Cousin', 'Bernard', '', 'IRISA']]","['sensor network', 'k-coverage', 'dependable', 'sleepscheduling']"
5398,1405.0293,Cl\'audia Nalon,"Cl\'audia Nalon, Jo\~ao Marcos and Clare Dixon",Clausal Resolution for Modal Logics of Confluence,"15 pages, 1 figure. Preprint of the paper accepted to IJCAR 2014",,10.1007/978-3-319-08587-6_24,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a clausal resolution-based method for normal multimodal logics of
confluence, whose Kripke semantics are based on frames characterised by
appropriate instances of the Church-Rosser property. Here we restrict attention
to eight families of such logics. We show how the inference rules related to
the normal logics of confluence can be systematically obtained from the
parametrised axioms that characterise such systems. We discuss soundness,
completeness, and termination of the method. In particular, completeness can be
modularly proved by showing that the conclusions of each newly added inference
rule ensures that the corresponding conditions on frames hold. Some examples
are given in order to illustrate the use of the method.
","[{'version': 'v1', 'created': 'Thu, 1 May 2014 20:03:39 GMT'}]",2014-08-20,"[['Nalon', 'Cláudia', ''], ['Marcos', 'João', ''], ['Dixon', 'Clare', '']]","['normal modal logics', 'combined logics', 'resolution method']"
5399,1208.2333,Arindam Sarkar,Arindam Sarkar and J. K. Mandal,"Energy Efficient Wireless Communication using Genetic Algorithm Guided
  Faster Light Weight Digital Signature Algorithm (GADSA)",17 pages,"International Journal Of Advanced Smart Sensor Network Systems (
  IJASSN ), Vol 2, No.3, July 2012, 9-25",10.5121/ijassn.2012.2302,,cs.CR cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper GA based light weight faster version of Digital Signature
Algorithm (GADSA) in wireless communication has been proposed. Various genetic
operators like crossover and mutation are used to optimizing amount of modular
multiplication. Roulette Wheel selection mechanism helps to select best
chromosome which in turn helps in faster computation and minimizes the time
requirements for DSA. Minimization of number of modular multiplication itself a
NP-hard problem that means there is no polynomial time deterministic algorithm
for this purpose. This paper deals with this problem using GA based
optimization algorithm for minimization of the modular multiplication. Proposed
GADSA initiates with an initial population comprises of set of valid and
complete set of individuals. Some operators are used to generate feasible valid
offspring from the existing one. Among several exponents the best solution
reached by GADSA is compared with some of the existing techniques. Extensive
simulations shows competitive results for the proposed GADSA.
","[{'version': 'v1', 'created': 'Sat, 11 Aug 2012 09:46:49 GMT'}]",2012-08-14,"[['Sarkar', 'Arindam', ''], ['Mandal', 'J. K.', '']]","['GA', 'Digital Signature Algorithm', 'Energy Efficient', 'Light Weight', 'Wireless Communication']"
5400,2106.03346,Yannic Noller,"Yannic Noller, Saeid Tizpaz-Niari",QFuzz: Quantitative Fuzzing for Side Channels,,"ACM SIGSOFT International Symposium on Software Testing and
  Analysis (ISSTA'21), July 11-17, 2021, Virtual, Denmark",10.1145/3460319.3464817,,cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Side channels pose a significant threat to the confidentiality of software
systems. Such vulnerabilities are challenging to detect and evaluate because
they arise from non-functional properties of software such as execution times
and require reasoning on multiple execution traces. Recently, noninterference
notions have been adapted in static analysis, symbolic execution, and greybox
fuzzing techniques. However, noninterference is a strict notion and may reject
security even if the strength of information leaks are weak. A quantitative
notion of security allows for the relaxation of noninterference and tolerates
small (unavoidable) leaks. Despite progress in recent years, the existing
quantitative approaches have scalability limitations in practice. In this work,
we present QFuzz, a greybox fuzzing technique to quantitatively evaluate the
strength of side channels with a focus on min entropy. Min entropy is a measure
based on the number of distinguishable observations (partitions) to assess the
resulting threat from an attacker who tries to compromise secrets in one try.
We develop a novel greybox fuzzing equipped with two partitioning algorithms
that try to maximize the number of distinguishable observations and the cost
differences between them. We evaluate QFuzz on a large set of benchmarks from
existing work and real-world libraries (with a total of 70 subjects). QFuzz
compares favorably to three state-of-the-art detection techniques. QFuzz
provides quantitative information about leaks beyond the capabilities of all
three techniques. Crucially, we compare QFuzz to a state-of-the-art
quantification tool and find that QFuzz significantly outperforms the tool in
scalability while maintaining similar precision. Overall, we find that our
approach scales well for real-world applications and provides useful
information to evaluate resulting threats. Additionally, QFuzz identifies a
zero-d...
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2021 05:25:45 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Jun 2021 05:35:52 GMT'}, {'version': 'v3', 'created': 'Thu, 8 Jul 2021 02:46:14 GMT'}]",2021-07-09,"[['Noller', 'Yannic', ''], ['Tizpaz-Niari', 'Saeid', '']]","['vulnerability detection', 'side-channel analysis', 'quantification', 'dynamic analysis', 'fuzzing']"
5401,2001.11810,Antti Knutas,"Antti Knutas, Andrew Petersen","The Effect of Civic Knowledge and Attitudes on CS Student Work
  Preferences",,"In Proceedings of the 19th Koli Calling International Conference
  on Computing Education Research. ACM. 37, 1-2",10.1145/3364510.3366159,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an investigation in the connection between computing students'
civic knowledge, attitude, or self-efficacy and their willingness to work on
civic technologies. Early results indicate that these factors are related to a
willingness to accept government work in technology but not non-profit work
focused on civic technologies.
","[{'version': 'v1', 'created': 'Thu, 30 Jan 2020 14:12:11 GMT'}]",2020-02-03,"[['Knutas', 'Antti', ''], ['Petersen', 'Andrew', '']]","['civic knowledge', 'civic tech', 'govtech', 'computer science careers']"
5402,2105.10983,Bulut Aygunes,"Bulut Aygunes, Ramazan Gokberk Cinbis, Selim Aksoy","Weakly Supervised Instance Attention for Multisource Fine-Grained Object
  Recognition with an Application to Tree Species Classification","Accepted for publication in ISPRS Journal of Photogrammetry and
  Remote Sensing",,10.1016/j.isprsjprs.2021.03.021,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Multisource image analysis that leverages complementary spectral, spatial,
and structural information benefits fine-grained object recognition that aims
to classify an object into one of many similar subcategories. However, for
multisource tasks that involve relatively small objects, even the smallest
registration errors can introduce high uncertainty in the classification
process. We approach this problem from a weakly supervised learning perspective
in which the input images correspond to larger neighborhoods around the
expected object locations where an object with a given class label is present
in the neighborhood without any knowledge of its exact location. The proposed
method uses a single-source deep instance attention model with parallel
branches for joint localization and classification of objects, and extends this
model into a multisource setting where a reference source that is assumed to
have no location uncertainty is used to aid the fusion of multiple sources in
four different levels: probability level, logit level, feature level, and pixel
level. We show that all levels of fusion provide higher accuracies compared to
the state-of-the-art, with the best performing method of feature-level fusion
resulting in 53% accuracy for the recognition of 40 different types of trees,
corresponding to an improvement of 5.7% over the best performing baseline when
RGB, multispectral, and LiDAR data are used. We also provide an in-depth
comparison by evaluating each model at various parameter complexity settings,
where the increased model capacity results in a further improvement of 6.3%
over the default capacity setting.
","[{'version': 'v1', 'created': 'Sun, 23 May 2021 17:51:14 GMT'}, {'version': 'v2', 'created': 'Tue, 25 May 2021 20:35:38 GMT'}]",2021-05-27,"[['Aygunes', 'Bulut', ''], ['Cinbis', 'Ramazan Gokberk', ''], ['Aksoy', 'Selim', '']]","['Multisource classification', 'fine-grained object recognition', 'weakly supervised learning', 'deep learning']"
5403,1406.1561,EPTCS,"Ruben Gamboa (University of Wyoming), John Cowles (University of
  Wyoming)","Formal Verification of Medina's Sequence of Polynomials for
  Approximating Arctangent","In Proceedings ACL2 2014, arXiv:1406.1238","EPTCS 152, 2014, pp. 101-110",10.4204/EPTCS.152.9,,cs.LO cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The verification of many algorithms for calculating transcendental functions
is based on polynomial approximations to these functions, often Taylor series
approximations. However, computing and verifying approximations to the
arctangent function are very challenging problems, in large part because the
Taylor series converges very slowly to arctangent-a 57th-degree polynomial is
needed to get three decimal places for arctan(0.95). Medina proposed a series
of polynomials that approximate arctangent with far faster convergence-a
7th-degree polynomial is all that is needed to get three decimal places for
arctan(0.95). We present in this paper a proof in ACL2(r) of the correctness
and convergence rate of this sequence of polynomials. The proof is particularly
beautiful, in that it uses many results from real analysis. Some of these
necessary results were proven in prior work, but some were proven as part of
this effort.
","[{'version': 'v1', 'created': 'Fri, 6 Jun 2014 01:48:16 GMT'}]",2014-06-09,"[['Gamboa', 'Ruben', '', 'University of Wyoming'], ['Cowles', 'John', '', 'University of\n  Wyoming']]","['Arctangent', 'taylor series', 'polynomial approximations']"
5404,1703.01972,Benjamin Berkels,"Rosalia Tatano, Benjamin Berkels, Thomas M. Deserno",Mesh-to-raster based non-rigid registration of multi-modal images,,"Journal of Medical Imaging 4(4), 044002 (27 October 2017)",10.1117/1.JMI.4.4.044002,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Region of interest (ROI) alignment in medical images plays a crucial role in
diagnostics, procedure planning, treatment, and follow-up. Frequently, a model
is represented as triangulated mesh while the patient data is provided from CAT
scanners as pixel or voxel data. Previously, we presented a 2D method for
curve-to-pixel registration. This paper contributes (i) a general
mesh-to-raster (M2R) framework to register ROIs in multi-modal images; (ii) a
3D surface-to-voxel application, and (iii) a comprehensive quantitative
evaluation in 2D using ground truth provided by the simultaneous truth and
performance level estimation (STAPLE) method. The registration is formulated as
a minimization problem where the objective consists of a data term, which
involves the signed distance function of the ROI from the reference image, and
a higher order elastic regularizer for the deformation. The evaluation is based
on quantitative light-induced fluoroscopy (QLF) and digital photography (DP) of
decalcified teeth. STAPLE is computed on 150 image pairs from 32 subjects, each
showing one corresponding tooth in both modalities. The ROI in each image is
manually marked by three experts (900 curves in total). In the QLF-DP setting,
our approach significantly outperforms the mutual information-based
registration algorithm implemented with the Insight Segmentation and
Registration Toolkit (ITK) and Elastix.
","[{'version': 'v1', 'created': 'Mon, 6 Mar 2017 16:58:03 GMT'}, {'version': 'v2', 'created': 'Tue, 31 Oct 2017 15:35:05 GMT'}]",2017-11-01,"[['Tatano', 'Rosalia', ''], ['Berkels', 'Benjamin', ''], ['Deserno', 'Thomas M.', '']]","['Curve-to-pixel registration', 'Surface-to-voxel registration', 'ROI alignment', 'Evaluation', 'STAPLE', 'VirtualPhysiological Human']"
5405,1303.5050,Bernard Yannou,"Fran\c{c}ois Cluzel (LGI), Bernard Yannou (LGI), Markus Dihlmann (US)","Using evolutionary design to interactively sketch car silhouettes and
  stimulate designer's creativity",,"Engineering Applications of Artificial Intelligence 25 (2012)
  1413-1424",10.1016/j.engappai.2012.02.011,,cs.NE cs.HC physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An Interactive Genetic Algorithm is proposed to progressively sketch the
desired side-view of a car profile. It adopts a Fourier decomposition of a 2D
profile as the genotype, and proposes a cross-over mechanism. In addition, a
formula function of two genes' discrepancies is fitted to the perceived
dissimilarity between two car profiles. This similarity index is intensively
used, throughout a series of user tests, to highlight the added value of the
IGA compared to a systematic car shape exploration, to prove its ability to
create superior satisfactory designs and to stimulate designer's creativity.
These tests have involved six designers with a design goal defined by a
semantic attribute. The results reveal that if ""friendly"" is diversely
interpreted in terms of car shapes, ""sportive"" denotes a very conventional
representation which may be a limitation for shape renewal.
","[{'version': 'v1', 'created': 'Sun, 17 Mar 2013 19:33:57 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Mar 2013 07:13:14 GMT'}]",2013-03-22,"[['Cluzel', 'François', '', 'LGI'], ['Yannou', 'Bernard', '', 'LGI'], ['Dihlmann', 'Markus', '', 'US']]","['interactive genetic algorithm', 'evolutionary design', 'shape design', 'subjective evaluation', 'user tests', 'car profile']"
5406,1603.07421,Ye Yuan,"Ye Yuan, Mu Li, Jun Liu, Claire J. Tomlin",On the Powerball Method for Optimization,,,10.1109/LCSYS.2019.2913770,,cs.SY cs.LG math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new method to accelerate the convergence of optimization
algorithms. This method simply adds a power coefficient $\gamma\in[0,1)$ to the
gradient during optimization. We call this the Powerball method and analyze the
convergence rate for the Powerball method for strongly convex functions. While
theoretically the Powerball method is guaranteed to have a linear convergence
rate in the same order of the gradient method, we show that empirically it
significantly outperforms the gradient descent and Newton's method, especially
during the initial iterations. We demonstrate that the Powerball method
provides a $10$-fold speedup of the convergence of both gradient descent and
L-BFGS on multiple real datasets.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2016 03:13:40 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Jun 2016 16:15:35 GMT'}, {'version': 'v3', 'created': 'Tue, 18 Oct 2016 12:57:04 GMT'}, {'version': 'v4', 'created': 'Fri, 1 Sep 2017 08:23:07 GMT'}]",2019-09-24,"[['Yuan', 'Ye', ''], ['Li', 'Mu', ''], ['Liu', 'Jun', ''], ['Tomlin', 'Claire J.', '']]","['Optimization algorithms', 'Convex programming', 'Dynamical systems', 'Lyapunov function', 'Convergence analysis']"
5407,1611.05428,Daniel Lemire,Daniel Lemire and Christoph Rupp,"Upscaledb: Efficient Integer-Key Compression in a Key-Value Store using
  SIMD Instructions",,"Information Systems Volume 66, June 2017, Pages 13-23",10.1016/j.is.2017.01.002,,cs.DB,http://creativecommons.org/licenses/by/4.0/,"  Compression can sometimes improve performance by making more of the data
available to the processors faster. We consider the compression of integer keys
in a B+-tree index. For this purpose, systems such as IBM DB2 use variable-byte
compression over differentially coded keys. We revisit this problem with
various compression alternatives such as Google's VarIntGB, Binary Packing and
Frame-of-Reference. In all cases, we describe algorithms that can operate
directly on compressed data. Many of our alternatives exploit the
single-instruction-multiple-data (SIMD) instructions supported by modern CPUs.
We evaluate our techniques in a database environment provided by Upscaledb, a
production-quality key-value database. Our best techniques are SIMD
accelerated: they simultaneously reduce memory usage while improving
single-threaded speeds. In particular, a differentially coded SIMD
binary-packing techniques (BP128) can offer a superior query speed (e.g., 40%
better than an uncompressed database) while providing the best compression
(e.g., by a factor of ten). For analytic workloads, our fast compression
techniques offer compelling benefits. Our software is available as open source.
","[{'version': 'v1', 'created': 'Wed, 16 Nov 2016 20:17:07 GMT'}, {'version': 'v2', 'created': 'Mon, 9 Jan 2017 15:40:05 GMT'}]",2017-01-18,"[['Lemire', 'Daniel', ''], ['Rupp', 'Christoph', '']]","['B+-tree', 'Data Compression', 'Vectorization', 'Key-Value Stores']"
5408,1904.00460,Paolo Barucca,Paolo Barucca,Spectral density of equitable core-periphery graphs,"12 pages, 2 figures. arXiv admin note: text overlap with
  arXiv:1610.02668",,10.1016/j.physa.2020.124649,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Core-periphery structure is an emerging property of a wide range of complex
systems and indicate the presence of group of actors in the system with an
higher number of connections among them and a lower number of connections with
a sparsely connected periphery. The dynamics of a complex system which is
interacting on a given graph structure is strictly connected with the spectral
properties of the graph itself, nevertheless it is generally extremely hard to
obtain analytic results which will hold for arbitrary large systems. Recently a
statistical ensemble of random graphs with a regular block structure, i.e. the
ensemble of equitable graphs, has been introduced and analytic results have
been derived in the computationally-hard context of graph partitioning and
community detection. In this paper, we present a general analytic result for a
ensemble of equitable core-periphery graphs, yielding a new explicit formula
for the spectral density of networks with core-periphery structure.
","[{'version': 'v1', 'created': 'Sun, 31 Mar 2019 18:39:37 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Apr 2019 09:30:09 GMT'}, {'version': 'v3', 'created': 'Mon, 8 Apr 2019 10:33:53 GMT'}]",2020-06-24,"[['Barucca', 'Paolo', '']]","['network theory', 'core-periphery', 'spectral theory', 'cavity method']"
5409,1907.11146,Justin Edwards,"Benjamin R. Cowan, Philip Doyle, Justin Edwards, Diego Garaialde, Ali
  Hayes-Brady, Holly P. Branigan, Jo\~ao Cabral, Leigh Clark","What's in an accent? The impact of accented synthetic speech on lexical
  choice in human-machine dialogue","In press, accepted at 1st International Conference on Conversational
  User Interfaces (CUI 2019)",,10.1145/3342775.3342786,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The assumptions we make about a dialogue partner's knowledge and
communicative ability (i.e. our partner models) can influence our language
choices. Although similar processes may operate in human-machine dialogue, the
role of design in shaping these models, and their subsequent effects on
interaction are not clearly understood. Focusing on synthesis design, we
conduct a referential communication experiment to identify the impact of
accented speech on lexical choice. In particular, we focus on whether accented
speech may encourage the use of lexical alternatives that are relevant to a
partner's accent, and how this is may vary when in dialogue with a human or
machine. We find that people are more likely to use American English terms when
speaking with a US accented partner than an Irish accented partner in both
human and machine conditions. This lends support to the proposal that synthesis
design can influence partner perception of lexical knowledge, which in turn
guide user's lexical choices. We discuss the findings with relation to the
nature and dynamics of partner models in human machine dialogue.
","[{'version': 'v1', 'created': 'Thu, 25 Jul 2019 15:39:11 GMT'}]",2019-07-26,"[['Cowan', 'Benjamin R.', ''], ['Doyle', 'Philip', ''], ['Edwards', 'Justin', ''], ['Garaialde', 'Diego', ''], ['Hayes-Brady', 'Ali', ''], ['Branigan', 'Holly P.', ''], ['Cabral', 'João', ''], ['Clark', 'Leigh', '']]","['Speech synthesis', 'lexical choice', 'speech interface', 'perspective taking', 'partner modeling']"
5410,1211.0592,Hadi Saboohi Hadi Saboohi,Hadi Saboohi and Sameem Abdul Kareem,"Requirements of a Recovery Solution for Failure of Composite Web
  Services","International Journal of Web & Semantic Technology (IJWesT) Vol.3,
  No.4, October 2012",,10.5121/ijwest.2012.3402,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web services are building blocks of interoperable systems. Composing Web
services makes the processes capable of doing complex tasks. Composite services
may fail during their execution which can be diagnosed by a mediator. The
mediator adapts the structure so that the failure is recovered. Moreover,
future executions should avoid the situation or organize a strategy to repair
the structure with a minimum delay. In this paper the failure reasons of a
composite service are reviewed. Furthermore, the requirements of a solution for
recovery of a system from a failure are investigated.
","[{'version': 'v1', 'created': 'Sat, 3 Nov 2012 04:44:15 GMT'}]",2012-11-27,"[['Saboohi', 'Hadi', ''], ['Kareem', 'Sameem Abdul', '']]","['Web Service', 'Composite Web Service', 'Failure Recovery', 'Adaptation', 'Requirement']"
5411,1211.4654,Suprativ Saha,Suprativ Saha and Rituparna Chaki,Application of Data mining in Protein sequence Classification,"16 Pages, 7 Figures, 3 Tables","International Journal of Database Management Systems ( IJDMS )
  Vol.4, No.5, October 2012",10.5121/ijdms.2012.4508,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Protein sequence classification involves feature selection for accurate
classification. Popular protein sequence classification techniques involve
extraction of specific features from the sequences. Researchers apply some
well-known classification techniques like neural networks, Genetic algorithm,
Fuzzy ARTMAP,Rough Set Classifier etc for accurate classification. This paper
presents a review is with three different classification models such as neural
network model, fuzzy ARTMAP model and Rough set classifier model. This is
followed by a new technique for classifying protein sequences. The proposed
model is typically implemented with an own designed tool and tries to reduce
the computational overheads encountered by earlier approaches and increase the
accuracy of classification
","[{'version': 'v1', 'created': 'Tue, 20 Nov 2012 02:59:28 GMT'}]",2012-11-21,"[['Saha', 'Suprativ', ''], ['Chaki', 'Rituparna', '']]","['Data Mining', 'Neural Network Model', 'Fuzzy ARTMAP Model', 'Rough Set Classifier', 'Protein Sequence', '2gram encoding method', '6-letter exchange group method']"
5412,1904.00812,Ramon Ferrer i Cancho,"Bernardino Casas, Antoni Hern\'andez-Fern\'andez, Neus Catal\`a, Ramon
  Ferrer-i-Cancho and Jaume Baixeries",Polysemy and brevity versus frequency in language,,"Computer Speech and Language 58, 19-50 (2019)",10.1016/j.csl.2019.03.007,,cs.CL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The pioneering research of G. K. Zipf on the relationship between word
frequency and other word features led to the formulation of various linguistic
laws. The most popular is Zipf's law for word frequencies. Here we focus on two
laws that have been studied less intensively: the meaning-frequency law, i.e.
the tendency of more frequent words to be more polysemous, and the law of
abbreviation, i.e. the tendency of more frequent words to be shorter. In a
previous work, we tested the robustness of these Zipfian laws for English,
roughly measuring word length in number of characters and distinguishing adult
from child speech. In the present article, we extend our study to other
languages (Dutch and Spanish) and introduce two additional measures of length:
syllabic length and phonemic length. Our correlation analysis indicates that
both the meaning-frequency law and the law of abbreviation hold overall in all
the analyzed languages.
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2019 14:21:57 GMT'}]",2020-09-24,"[['Casas', 'Bernardino', ''], ['Hernández-Fernández', 'Antoni', ''], ['Català', 'Neus', ''], ['Ferrer-i-Cancho', 'Ramon', ''], ['Baixeries', 'Jaume', '']]","['Zipf’s laws', 'polysemy', 'brevity', 'word frequency']"
5413,1309.5688,Andi Wahju Rahardjo Emanuel,"Andi Wahju Rahardjo Emanuel, Daniel Jahja Surjawan","Revised Modularity Index to Measure Modularity of OSS Projects with Case
  Study of Freemind","6 pages, 9 figures, Published with International Journal of Computer
  Applications (IJCA)","IJCA 59(12):28-33, December 2012. Published by Foundation of
  Computer Science, New York, USA",10.5120/9602-4227,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Open Source Software (OSS) Projects are gaining popularity worldwide. Studies
by many researchers show that the important key success factor is modularity of
the source code. This paper presents the revised Modularity Index which is a
software metrics to measure the modularity level of a javabased OSS Projects.
To show its effectiveness in analyzing OSS Project, the Modularity Index and
its supporting software metrics are then used to analyze the evolution of
Freemind mind mapping OSS Project. The analysis using Modularity Index and its
supporting metrics shows the strength and weaknesses of the Freemind OSS
Projects.
","[{'version': 'v1', 'created': 'Mon, 23 Sep 2013 03:22:03 GMT'}]",2013-09-24,"[['Emanuel', 'Andi Wahju Rahardjo', ''], ['Surjawan', 'Daniel Jahja', '']]","['Modularity', 'java', 'package cohesion', 'package coupling', 'Open Source', 'software architecture', 'Freemind']"
5414,0911.1741,Andrew King,Andrew D. King,"Hitting all maximum cliques with a stable set using lopsided independent
  transversals",7 pages. v4: Correction to statement of Lemma 8 and clarified proof.,,10.1002/jgt.20532,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rabern recently proved that any graph with omega >= (3/4)(Delta+1) contains a
stable set meeting all maximum cliques. We strengthen this result, proving that
such a stable set exists for any graph with omega > (2/3)(Delta+1). This is
tight, i.e. the inequality in the statement must be strict. The proof relies on
finding an independent transversal in a graph partitioned into vertex sets of
unequal size.
","[{'version': 'v1', 'created': 'Mon, 9 Nov 2009 17:55:06 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Dec 2009 19:35:42 GMT'}, {'version': 'v3', 'created': 'Tue, 2 Mar 2010 15:35:15 GMT'}, {'version': 'v4', 'created': 'Wed, 10 Mar 2010 15:16:08 GMT'}]",2011-02-11,"[['King', 'Andrew D.', '']]","['maximum clique', 'stable set', 'graph colouring', 'independent transversal', 'independent system of representatives']"
5415,1405.4596,Zhenyu Huang,"Zhenyu Huang, Yao Sun, Dongdai Lin","On the Efficiency of Solving Boolean Polynomial Systems with the
  Characteristic Set Method",,,10.1016/j.jsc.2019.11.001,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An improved characteristic set algorithm for solving Boolean polynomial
systems is proposed. This algorithm is based on the idea of converting all the
polynomials into monic ones by zero decomposition, and using additions to
obtain pseudo-remainders. Three important techniques are applied in the
algorithm. The first one is eliminating variables by new generated linear
polynomials. The second one is optimizing the strategy of choosing polynomial
for zero decomposition. The third one is to compute add-remainders to eliminate
the leading variable of new generated monic polynomials. By analyzing the depth
of the zero decomposition tree, we present some complexity bounds of this
algorithm, which are lower than the complexity bounds of previous
characteristic set algorithms. Extensive experimental results show that this
new algorithm is more efficient than previous characteristic set algorithms for
solving Boolean polynomial systems.
","[{'version': 'v1', 'created': 'Mon, 19 May 2014 04:23:42 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Feb 2015 03:18:24 GMT'}, {'version': 'v3', 'created': 'Fri, 21 Oct 2016 02:08:57 GMT'}, {'version': 'v4', 'created': 'Mon, 11 Nov 2019 01:35:13 GMT'}]",2019-11-12,"[['Huang', 'Zhenyu', ''], ['Sun', 'Yao', ''], ['Lin', 'Dongdai', '']]","['Boolean polynomial system', 'Characteristic Set method', 'Computationcomplexity', 'Zero decomposition', 'Cryptanalysis']"
5416,0911.3418,Shashank Shekhar,"Shashank Shekhar, Mohit Soni, NVSN Kalyan Chakravarthy","Flare: Architecture for rapid and easy development of Internet-based
  Applications","4 pages, 5 figures",,10.5120/549-716,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an architecture, Flare, that is a structured and easy way to
develop applications rapidly, in a multitude of languages, which make use of
online storage of data and management of users. The architecture eliminates the
need for server-side programming in most cases, creation and management of
online database storage servers, re-creation of user management schemes and
writing a lot of unnecessary code for accessing different web-based services
using their APIs. A Web API provides a common API for various web-based
services like Blogger [2], Wordpress, MSN Live, Facebook [3] etc. Access
Libraries provided for major programming languages and platforms make it easy
to develop applications using the Flare Web Service. We demonstrate a simple
micro-blogging service developed using these APIs in two modes: a graphical
browser-based mode, and a command-line mode in C++, which provide two different
interfaces to the same account and data.
","[{'version': 'v1', 'created': 'Tue, 17 Nov 2009 22:25:49 GMT'}]",2015-05-14,"[['Shekhar', 'Shashank', ''], ['Soni', 'Mohit', ''], ['Chakravarthy', 'NVSN Kalyan', '']]","['Internet-based', 'Application development', 'Cloud storage', 'Unified API', 'Web Service', 'User management']"
5417,1803.00204,Chen Wang,"Chen Wang, Xiaomei Yang, Shaomin Fei, Kai Zhou, Xiaofeng Gong, Miao
  Du, Ruisen Luo",Scalar Quantization as Sparse Least Square Optimization,,"IEEE Transactions on Pattern Analysis and Machine Intelligence,
  2019",10.1109/TPAMI.2019.2952096,,cs.LG cs.AI cs.NA stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Quantization can be used to form new vectors/matrices with shared values
close to the original. In recent years, the popularity of scalar quantization
for value-sharing applications has been soaring as it has been found huge
utilities in reducing the complexity of neural networks. Existing
clustering-based quantization techniques, while being well-developed, have
multiple drawbacks including the dependency of the random seed, empty or
out-of-the-range clusters, and high time complexity for a large number of
clusters. To overcome these problems, in this paper, the problem of scalar
quantization is examined from a new perspective, namely sparse least square
optimization. Specifically, inspired by the property of sparse least square
regression, several quantization algorithms based on $l_1$ least square are
proposed. In addition, similar schemes with $l_1 + l_2$ and $l_0$
regularization are proposed. Furthermore, to compute quantization results with
a given amount of values/clusters, this paper designed an iterative method and
a clustering-based method, and both of them are built on sparse least square.
The paper shows that the latter method is mathematically equivalent to an
improved version of k-means clustering-based quantization algorithm, although
the two algorithms originated from different intuitions. The algorithms
proposed were tested with three types of data and their computational
performances, including information loss, time consumption, and the
distribution of the values of the sparse vectors, were compared and analyzed.
The paper offers a new perspective to probe the area of quantization, and the
algorithms proposed can outperform existing methods especially under some
bit-width reduction scenarios, when the required post-quantization resolution
(number of values) is not significantly lower than the original number.
","[{'version': 'v1', 'created': 'Thu, 1 Mar 2018 04:07:40 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Sep 2018 16:24:26 GMT'}, {'version': 'v3', 'created': 'Wed, 25 Sep 2019 17:32:25 GMT'}, {'version': 'v4', 'created': 'Wed, 6 Nov 2019 04:12:41 GMT'}]",2019-12-11,"[['Wang', 'Chen', ''], ['Yang', 'Xiaomei', ''], ['Fei', 'Shaomin', ''], ['Zhou', 'Kai', ''], ['Gong', 'Xiaofeng', ''], ['Du', 'Miao', ''], ['Luo', 'Ruisen', '']]","['Scalar Quantization', 'l0 Least Square', 'l1 Least Square', 'Clustering', 'Approximation']"
5418,2102.12165,Ngoc Tran,"Toan Pham Van, Ngoc N. Tran, Hoang Pham Minh, Tam Nguyen Minh and
  Thanh Ta Minh","Efficient Low-Latency Dynamic Licensing for Deep Neural Network
  Deployment on Edge Devices","Published in 2020 The 3rd International Conference on Computational
  Intelligence and Intelligent Systems","CIIS 2020: 2020 The 3rd International Conference on Computational
  Intelligence and Intelligent Systems, November 2020, Pages 44-49",10.1145/3440840.3440860,,cs.LG cs.NI,http://creativecommons.org/licenses/by-sa/4.0/,"  Along with the rapid development in the field of artificial intelligence,
especially deep learning, deep neural network applications are becoming more
and more popular in reality. To be able to withstand the heavy load from
mainstream users, deployment techniques are essential in bringing neural
network models from research to production. Among the two popular computing
topologies for deploying neural network models in production are
cloud-computing and edge-computing. Recent advances in communication
technologies, along with the great increase in the number of mobile devices,
has made edge-computing gradually become an inevitable trend. In this paper, we
propose an architecture to solve deploying and processing deep neural networks
on edge-devices by leveraging their synergy with the cloud and the
access-control mechanisms of the database. Adopting this architecture allows
low-latency DNN model updates on devices. At the same time, with only one model
deployed, we can easily make different versions of it by setting access
permissions on the model weights. This method allows for dynamic model
licensing, which benefits commercial applications.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2021 09:36:39 GMT'}]",2021-09-27,"[['Van', 'Toan Pham', ''], ['Tran', 'Ngoc N.', ''], ['Minh', 'Hoang Pham', ''], ['Minh', 'Tam Nguyen', ''], ['Minh', 'Thanh Ta', '']]","['Edge Computing', 'Artificial Intelligence', 'Dynamic Licensing', 'Deployment Architecture']"
5419,1810.08276,Rudini Sampaio,"Rafael Araujo, Eurinardo Costa, Sulamita Klein, Rudini Sampaio,
  Ueverton S. Souza",FPT algorithms to recognize well covered graphs,"15 pages, 2 figures","Discrete Mathematics & Theoretical Computer Science, vol. 21 no.
  1, ICGT 2018 (April 2, 2019) dmtcs:5342",10.23638/DMTCS-21-1-3,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a graph $G$, let $vc(G)$ and $vc^+(G)$ be the sizes of a minimum and a
maximum minimal vertex covers of $G$, respectively. We say that $G$ is well
covered if $vc(G)=vc^+(G)$ (that is, all minimal vertex covers have the same
size). Determining if a graph is well covered is a coNP-complete problem. In
this paper, we obtain $O^*(2^{vc})$-time and $O^*(1.4656^{vc^+})$-time
algorithms to decide well coveredness, improving results of Boria et. al.
(2015). Moreover, using crown decomposition, we show that such problems admit
kernels having linear number of vertices. In 2018, Alves et. al. (2018) proved
that recognizing well covered graphs is coW[2]-hard when the independence
number $\alpha(G)=n-vc(G)$ is the parameter. Contrasting with such
coW[2]-hardness, we present an FPT algorithm to decide well coveredness when
$\alpha(G)$ and the degeneracy of the input graph $G$ are aggregate parameters.
Finally, we use the primeval decomposition technique to obtain a linear time
algorithm for extended $P_4$-laden graphs and $(q,q-4)$-graphs, which is FPT
parameterized by $q$, improving results of Klein et al (2013).
","[{'version': 'v1', 'created': 'Thu, 18 Oct 2018 21:01:47 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Oct 2018 03:42:41 GMT'}, {'version': 'v3', 'created': 'Wed, 20 Mar 2019 20:31:28 GMT'}, {'version': 'v4', 'created': 'Mon, 1 Apr 2019 15:23:34 GMT'}]",2021-01-04,"[['Araujo', 'Rafael', ''], ['Costa', 'Eurinardo', ''], ['Klein', 'Sulamita', ''], ['Sampaio', 'Rudini', ''], ['Souza', 'Ueverton S.', '']]","['Well covered graphs', 'primeval decomposition', 'degenerate graphs', 'fixed parameter tractability', 'polynomial kernel']"
5420,1708.01419,Zheng Li,Zheng Li and Liam O'Brien and Maria Kihl,"DoKnowMe: Towards a Domain Knowledge-driven Methodology for Performance
  Evaluation",,"ACM SIGMETRICS Performance Evaluation Review, vol. 43, no. 4, pp.
  23-32 (2016)",10.1145/2897356.2897360,,cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software engineering considers performance evaluation to be one of the key
portions of software quality assurance. Unfortunately, there seems to be a lack
of standard methodologies for performance evaluation even in the scope of
experimental computer science. Inspired by the concept of ""instantiation"" in
object-oriented programming, we distinguish the generic performance evaluation
logic from the distributed and ad-hoc relevant studies, and develop an abstract
evaluation methodology (by analogy of ""class"") we name Domain Knowledge-driven
Methodology (DoKnowMe). By replacing five predefined domain-specific knowledge
artefacts, DoKnowMe could be instantiated into specific methodologies (by
analogy of ""object"") to guide evaluators in performance evaluation of different
software and even computing systems. We also propose a generic validation
framework with four indicators (i.e.~usefulness, feasibility, effectiveness and
repeatability), and use it to validate DoKnowMe in the Cloud services
evaluation domain. Given the positive and promising validation result, we plan
to integrate more common evaluation strategies to improve DoKnowMe and further
focus on the performance evaluation of Cloud autoscaler systems.
","[{'version': 'v1', 'created': 'Fri, 4 Aug 2017 08:33:10 GMT'}]",2017-08-07,"[['Li', 'Zheng', ''], [""O'Brien"", 'Liam', ''], ['Kihl', 'Maria', '']]","['domain-specific knowledge', 'experimental computer science', 'methodology', 'performance evaluation']"
5421,1610.05984,Daniel Hein,"Daniel Hein, Alexander Hentschel, Thomas Runkler, Steffen Udluft","Particle Swarm Optimization for Generating Interpretable Fuzzy
  Reinforcement Learning Policies",,"Engineering Applications of Artificial Intelligence, Volume 65C,
  October 2017, Pages 87-98",10.1016/j.engappai.2017.07.005,,cs.NE cs.AI cs.LG cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fuzzy controllers are efficient and interpretable system controllers for
continuous state and action spaces. To date, such controllers have been
constructed manually or trained automatically either using expert-generated
problem-specific cost functions or incorporating detailed knowledge about the
optimal control strategy. Both requirements for automatic training processes
are not found in most real-world reinforcement learning (RL) problems. In such
applications, online learning is often prohibited for safety reasons because
online learning requires exploration of the problem's dynamics during policy
training. We introduce a fuzzy particle swarm reinforcement learning (FPSRL)
approach that can construct fuzzy RL policies solely by training parameters on
world models that simulate real system dynamics. These world models are created
by employing an autonomous machine learning technique that uses previously
generated transition samples of a real system. To the best of our knowledge,
this approach is the first to relate self-organizing fuzzy controllers to
model-based batch RL. Therefore, FPSRL is intended to solve problems in domains
where online learning is prohibited, system dynamics are relatively easy to
model from previously generated default policy transition samples, and it is
expected that a relatively easily interpretable control policy exists. The
efficiency of the proposed approach with problems from such domains is
demonstrated using three standard RL benchmarks, i.e., mountain car, cart-pole
balancing, and cart-pole swing-up. Our experimental results demonstrate
high-performing, interpretable fuzzy policies.
","[{'version': 'v1', 'created': 'Wed, 19 Oct 2016 12:41:52 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Apr 2017 07:22:21 GMT'}, {'version': 'v3', 'created': 'Fri, 5 May 2017 09:01:41 GMT'}, {'version': 'v4', 'created': 'Thu, 29 Jun 2017 07:13:09 GMT'}, {'version': 'v5', 'created': 'Tue, 15 Aug 2017 21:41:03 GMT'}]",2017-08-18,"[['Hein', 'Daniel', ''], ['Hentschel', 'Alexander', ''], ['Runkler', 'Thomas', ''], ['Udluft', 'Steffen', '']]","['interpretable', 'reinforcement learning', 'fuzzy policy', 'fuzzy controller', 'particle swarm optimization']"
5422,1403.2814,Gideon Naah,Gideon Naah and Edwin Boadu Okoampa,Clustering Effects on Wireless Mobile Ad-Hoc Networks Performances,"journal, 19 pages, 14 figures and 1 table,
  http://airccse.org/journal/ijcsit2014_curr.html",,10.5121/ijcsit.2014.6105,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new era is dawning for wireless mobile ad hoc networks where communication
will be done using a group of mobile devices called cluster, hence clustered
network. In a clustered network, protocols used by these mobile devices are
different from those used in a wired network; which helps to save computation
time and resources efficiently. This paper focuses on Cluster-Based Routing
Protocol and Dynamic Source Routing. The results presented in this paper
illustrates the implementation of Ad-hoc On-Demand Distance Vector routing
protocol for enhancing mobile nodes performance and lifetime in a clustered
network and to demonstrate how this routing protocol results in time efficient
and resource saving in wireless mobile ad hoc networks.
","[{'version': 'v1', 'created': 'Wed, 12 Mar 2014 05:10:20 GMT'}]",2014-03-13,"[['Naah', 'Gideon', ''], ['Okoampa', 'Edwin Boadu', '']]","['AODV', 'CBRP', 'DSR', 'MANETs', 'Routing']"
5423,2105.08429,Rogier van de Wetering,"Rogier van de Wetering, Patrick Mikalef and Adamantia Pateli","Strategic alignment between IT flexibility and dynamic capabilities: an
  empirical investigation","13 pages, 2 figures","International Journal of IT/Business Alignment and Governance
  (IJITBAG), 9(1), 1-20. 2018",10.4018/IJITBAG.2018010101,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Dynamic capabilities theory emerged as a leading framework in the process of
value creation for firms. Its core notion complements the premise of the
resource-based view of the firm and is considered an important theoretical and
management framework in modern information systems research. However, despite
DCTs significant contributions, its strength and core focus are essentially in
its use for historical firm performance explanation. Furthermore, valuable
contributions have been made by several researchers in order to extend the DCT
to fit the constantly changing IT environments and other imperative drivers for
competitive performance. However, no DCT extension has been developed which
allows firms to integrally assess their current state of maturity in order to
derive imperative steps for further performance enhancements. In light of
empirical advancement, this paper aims to develop a strategic alignment model
for IT flexibility and dynamic capabilities and empirically validates proposed
hypotheses using correlation and regression analyses on a large data sample of
322 international firms. We conjecture that the combined synergetic effect of
the underlying dimensions of a firms IT flexibility architecture and dynamic
capabilities enables organizations to cope with changing environmental
conditions and drive competitive firm performance. Findings of this study
suggest that there is a significant positive relationship between the firms
degree of strategic alignment defined as the degree of balance between all
dimensions and competitive firm performance. Strategic alignment can,
therefore, be seen as an important condition that significantly influences a
firms competitive advantage in constantly changing environments. The proposed
framework helps firms assess and improve their maturity and alignment of IT
flexibility and dynamic capabilities.
","[{'version': 'v1', 'created': 'Tue, 18 May 2021 10:37:33 GMT'}]",2021-05-19,"[['van de Wetering', 'Rogier', ''], ['Mikalef', 'Patrick', ''], ['Pateli', 'Adamantia', '']]","['IT flexibility', 'dynamic capabilities', 'IS/IT-alignment', 'firm performance', 'assessment tool']"
5424,1811.08691,Giovanni Abramo,"Giovanni Abramo, Ciriaco Andrea D'Angelo","A Decision Support System for Public Research Organizations
  Participating in National Research Assessment Exercises",,"Abramo, G., D'Angelo, C.A. (2009). A decision support system for
  public research organizations participating in national research assessment
  exercises. JASIST, 60(10), 2095-2106",10.1002/asi.21126,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We are witnessing a rapid trend towards the adoption of exercises for
evaluation of national research systems, generally based on the peer review
approach. They respond to two main needs: stimulating higher efficiency in
research activities by public laboratories, and realizing better allocative
efficiency in government funding of such institutions. However the peer review
approach is typified by several limitations that raise doubts for the
achievement of the ultimate objectives. In particular, subjectivity of
judgment, which occurs during the step of selecting research outputs to be
submitted for the evaluations, risks heavily distorting both the final ratings
of the organizations evaluated and the ultimate funding they receive. These
distortions become ever more relevant if the evaluation is limited to small
samples of the scientific production of the research institutions. The
objective of the current study is to propose a quantitative methodology based
on bibliometric data that would provide a reliable support for the process of
selecting the best products of a laboratory, and thus limit distortions.
Benefits are twofold: single research institutions can maximize the probability
of receiving a fair evaluation coherent with the real quality of their
research. At the same time, broader adoptions of this approach could also
provide strong advantages at the macroeconomic level, since it guarantees
financial allocations based on the real value of the institutions under
evaluation. In this study, the proposed methodology has been applied to the
hard science sectors of the Italian university research system for the period
2004-2006.
","[{'version': 'v1', 'created': 'Wed, 21 Nov 2018 11:36:28 GMT'}]",2018-11-22,"[['Abramo', 'Giovanni', ''], [""D'Angelo"", 'Ciriaco Andrea', '']]","['Research assessment exercises', 'peer review', 'bibliometrics', 'DSS', 'universities', 'Italy']"
5425,1403.2848,Suprativ Saha,Ananya Bose and Suprativ Saha,"Delineation of Techniques to implement on the enhanced proposed model
  using data mining for protein sequence classification","8 pages, 1 figures","International Journal of Database Management Systems ( IJDMS )
  Vol.6, No.1, February 2014",10.5121/ijdms.2014.6105,,cs.DB cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In post genomic era with the advent of new technologies a huge amount of
complex molecular data are generated with high throughput. The management of
this biological data is definitely a challenging task due to complexity and
heterogeneity of data for discovering new knowledge. Issues like managing noisy
and incomplete data are needed to be dealt with. Use of data mining in
biological domain has made its inventory success. Discovering new knowledge
from the biological data is a major challenge in data mining technique. The
novelty of the proposed model is its combined use of intelligent techniques to
classify the protein sequence faster and efficiently. Use of FFT, fuzzy
classifier, String weighted algorithm, gram encoding method, neural network
model and rough set classifier in a single model and in an appropriate place
can enhance the quality of the classification system.Thus the primary challenge
is to identify and classify the large protein sequences in a very fast and easy
but intellectual way to decrease the time complexity and space complexity.
","[{'version': 'v1', 'created': 'Wed, 12 Mar 2014 08:44:08 GMT'}]",2014-03-13,"[['Bose', 'Ananya', ''], ['Saha', 'Suprativ', '']]","['Neural Network', 'Fuzzy ARTMAP Model', 'FFT', 'String Weighted Schema', 'Rough Set classifier.   1']"
5426,1408.0733,Shilpa Sreekumar,Shilpa Sreekumar and Vincy Salam,Advanced reversible Data Hiding With Encrypted Data,"4 pages, 10 figures, Published with International Journal of
  Engineering Trends and Technology (IJETT)","IJETT, V13(7),310-313 July 2014. ISSN:2231-5381",10.14445/22315381/IJETT-V13P262,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The advanced RDH work focuses on both data encryption and image encryption
which makes it more secure and free of errors. All previous methods embed data
without encrypting the data which may subject to errors on the data extraction
or image recovery. The proposed work provides a novel RDH scheme in which both
data and image can be encrypted and extracted reversibly without any errors. In
the proposed work, data extraction and image recovery are free of any errors.
The PSNR is significantly improved in the proposed work. This advanced work
also performs data hiding in videos.
","[{'version': 'v1', 'created': 'Mon, 4 Aug 2014 16:14:42 GMT'}]",2014-08-05,"[['Sreekumar', 'Shilpa', ''], ['Salam', 'Vincy', '']]","['AES algorithm', 'Blowfish algorithm', 'Data embedding']"
5427,1703.00133,Wei Fu,"Wei Fu, Tim Menzies",Easy over Hard: A Case Study on Deep Learning,"12 pages, 6 figures, accepted at FSE2017",,10.1145/3106237.3106256,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While deep learning is an exciting new technique, the benefits of this method
need to be assessed with respect to its computational cost. This is
particularly important for deep learning since these learners need hours (to
weeks) to train the model. Such long training time limits the ability of (a)~a
researcher to test the stability of their conclusion via repeated runs with
different random seeds; and (b)~other researchers to repeat, improve, or even
refute that original work.
  For example, recently, deep learning was used to find which questions in the
Stack Overflow programmer discussion forum can be linked together. That deep
learning system took 14 hours to execute. We show here that applying a very
simple optimizer called DE to fine tune SVM, it can achieve similar (and
sometimes better) results. The DE approach terminated in 10 minutes; i.e. 84
times faster hours than deep learning method.
  We offer these results as a cautionary tale to the software analytics
community and suggest that not every new innovation should be applied without
critical analysis. If researchers deploy some new and expensive process, that
work should be baselined against some simpler and faster alternatives.
","[{'version': 'v1', 'created': 'Wed, 1 Mar 2017 04:38:35 GMT'}, {'version': 'v2', 'created': 'Sat, 24 Jun 2017 16:43:01 GMT'}]",2017-06-27,"[['Fu', 'Wei', ''], ['Menzies', 'Tim', '']]","['Search based sofware engineering', 'sofware analytics', 'parametertuning', 'data analytics for sofware engineering', 'deep learning', 'SVM', 'diferential evolution']"
5428,1001.5244,Carlos Gershenson,Carlos Gershenson,"Computing Networks: A General Framework to Contrast Neural and Swarm
  Cognitions","18 pages, 5 figures","Paladyn, Journal of Behavioral Robotics 1(2): 147-153, 2010",10.2478/s13230-010-0015-z,C3 Report No. 2010.01,cs.NE cs.AI nlin.AO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the Computing Networks (CNs) framework. CNs are used to
generalize neural and swarm architectures. Artificial neural networks, ant
colony optimization, particle swarm optimization, and realistic biological
models are used as examples of instantiations of CNs. The description of these
architectures as CNs allows their comparison. Their differences and
similarities allow the identification of properties that enable neural and
swarm architectures to perform complex computations and exhibit complex
cognitive abilities. In this context, the most relevant characteristics of CNs
are the existence multiple dynamical and functional scales. The relationship
between multiple dynamical and functional scales with adaptation, cognition (of
brains and swarms) and computation is discussed.
","[{'version': 'v1', 'created': 'Thu, 28 Jan 2010 18:55:53 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Apr 2010 20:47:26 GMT'}, {'version': 'v3', 'created': 'Mon, 26 Jul 2010 21:21:02 GMT'}]",2010-09-15,"[['Gershenson', 'Carlos', '']]","['cognition', 'computation', 'neural architecture', 'swarm architecture', 'swarmcognition', 'multiple scales']"
5429,1804.03803,Yu Wu,"Yu Wu, Linchao Zhu, Lu Jiang, Yi Yang",Decoupled Novel Object Captioner,Accepted to ACM MM 2018,,10.1145/3240508.3240640,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image captioning is a challenging task where the machine automatically
describes an image by sentences or phrases. It often requires a large number of
paired image-sentence annotations for training. However, a pre-trained
captioning model can hardly be applied to a new domain in which some novel
object categories exist, i.e., the objects and their description words are
unseen during model training. To correctly caption the novel object, it
requires professional human workers to annotate the images by sentences with
the novel words. It is labor expensive and thus limits its usage in real-world
applications.
  In this paper, we introduce the zero-shot novel object captioning task where
the machine generates descriptions without extra sentences about the novel
object. To tackle the challenging problem, we propose a Decoupled Novel Object
Captioner (DNOC) framework that can fully decouple the language sequence model
from the object descriptions. DNOC has two components. 1) A Sequence Model with
the Placeholder (SM-P) generates a sentence containing placeholders. The
placeholder represents an unseen novel object. Thus, the sequence model can be
decoupled from the novel object descriptions. 2) A key-value object memory
built upon the freely available detection model, contains the visual
information and the corresponding word for each object. The SM-P will generate
a query to retrieve the words from the object memory. The placeholder will then
be filled with the correct word, resulting in a caption with novel object
descriptions. The experimental results on the held-out MSCOCO dataset
demonstrate the ability of DNOC in describing novel concepts in the zero-shot
novel object captioning task.
","[{'version': 'v1', 'created': 'Wed, 11 Apr 2018 04:21:22 GMT'}, {'version': 'v2', 'created': 'Sat, 11 Aug 2018 08:36:55 GMT'}]",2018-08-14,"[['Wu', 'Yu', ''], ['Zhu', 'Linchao', ''], ['Jiang', 'Lu', ''], ['Yang', 'Yi', '']]","['image captioning', 'novel object', 'novel object captioning']"
5430,1902.06852,Debajyoti Bera,Debajyoti Bera and Tharrmashastha P.V,Error reduction of quantum algorithms,,"Phys. Rev. A 100, 012331 (2019)",10.1103/PhysRevA.100.012331,,cs.CC quant-ph,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We give a technique to reduce the error probability of quantum algorithms
that determine whether its input has a specified property of interest. The
standard process of reducing this error is statistical processing of the
results of multiple independent executions of an algorithm. Denoting by $\rho$
an upper bound of this probability (wlog., assume $\rho \le \frac{1}{2}$),
classical techniques require $O(\frac{\rho}{[(1-\rho) - \rho]^2})$ executions
to reduce the error to a negligible constant. We investigated when and how
quantum algorithmic techniques like amplitude amplification and estimation may
reduce the number of executions. On one hand, the former idea does not directly
benefit algorithms that can err on both yes and no answers and the number of
executions in the latter approach is $O(\frac{1}{(1-\rho) - \rho})$. We propose
a novel approach named as {\em Amplitude Separation} that combines both these
approaches and achieves $O(\frac{1}{\sqrt{1-\rho} - \sqrt{\rho}})$ executions
that betters existing approaches when the errors are high.
  In the Multiple-Weight Decision Problem, the input is an $n$-bit Boolean
function $f()$ given as a black-box and the objective is to determine the
number of $x$ for which $f(x)=1$, denoted as $wt(f)$, given some possible
values $\{w_1, \ldots, w_k\}$ for $wt(f)$. When our technique is applied to
this problem, we obtain the correct answer, maybe with a negligible error,
using $O(\log_2 k \sqrt{2^n})$ calls to $f()$ that shows a quadratic speedup
over classical approaches and currently known quantum algorithms.
","[{'version': 'v1', 'created': 'Tue, 19 Feb 2019 00:47:31 GMT'}]",2019-07-24,"[['Bera', 'Debajyoti', ''], ['P.', 'Tharrmashastha', 'V']]","['Quantum algorithm', 'Amplitude amplification and estimation', 'Weight decision problem']"
5431,1706.03702,Adam Harrison,"Adam P. Harrison and Ziyue Xu and Kevin George and Le Lu and Ronald M.
  Summers and Daniel J. Mollura","Progressive and Multi-Path Holistically Nested Neural Networks for
  Pathological Lung Segmentation from CT Images","8 Pages, 4 figures, MICCAI 2007",Proc. MICCAI (2017); pp 621-629,10.1007/978-3-319-66179-7_71,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pathological lung segmentation (PLS) is an important, yet challenging,
medical image application due to the wide variability of pathological lung
appearance and shape. Because PLS is often a pre-requisite for other imaging
analytics, methodological simplicity and generality are key factors in
usability. Along those lines, we present a bottom-up deep-learning based
approach that is expressive enough to handle variations in appearance, while
remaining unaffected by any variations in shape. We incorporate the deeply
supervised learning framework, but enhance it with a simple, yet effective,
progressive multi-path scheme, which more reliably merges outputs from
different network stages. The result is a deep model able to produce finer
detailed masks, which we call progressive holistically-nested networks
(P-HNNs). Using extensive cross-validation, our method is tested on
multi-institutional datasets comprising 929 CT scans (848 publicly available),
of pathological lungs, reporting mean dice scores of 0.985 and demonstrating
significant qualitative and quantitative improvements over state-of-the art
approaches.
","[{'version': 'v1', 'created': 'Mon, 12 Jun 2017 15:54:35 GMT'}]",2018-02-09,"[['Harrison', 'Adam P.', ''], ['Xu', 'Ziyue', ''], ['George', 'Kevin', ''], ['Lu', 'Le', ''], ['Summers', 'Ronald M.', ''], ['Mollura', 'Daniel J.', '']]","['progressive and multi-path convolutional neural networks', 'holistically nested neural networks', 'pathological lung segmentation']"
5432,2205.00242,Sue Sin Chong,Sue Sin Chong,"Approximating Permutations with Neural Network Components for Travelling
  Photographer Problem",11 pages,"Published in 2022 Asia Conference on Algorithms, Computing and
  Machine Learning (CACML 2022)",10.1109/CACML55074.2022.00036,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Most of the current inference techniques rely upon Bayesian inference on
Probabilistic Graphical Models of observations and do predictions and
classification on observations. However, there is very little literature on the
mining of relationships between observations and building models of the
relationship between sets of observations or the generating context of the
observations. Moreover, event understanding of machines with observation inputs
needs to understand the relationship between observations. Thus there is a
crucial need to build models and develop effective data structures to
accumulate and organize relationships between observations. Given a PGM model,
this paper attempts to fit a permutation of states to a sequence of observation
tokens (The Travelling Photographer Problem). We have devised a machine
learning inspired architecture for randomized approximation of state
permutation, facilitating parallelization of heuristic search of permutations.
As a result, our algorithm can solve The Travelling Photographer Problem with
minimal error. Furthermore, we demonstrate that by mimicking machine learning
components such as normalization, dropout, and lambda layer with a randomized
algorithm, we can devise an architecture that solves TPP, a permutation NP-Hard
problem. Other than TPP, we can also provide a 2-Local improvement heuristic
for the Travelling Salesman Problem (TSP) with similar ideas.
","[{'version': 'v1', 'created': 'Sat, 30 Apr 2022 11:24:21 GMT'}, {'version': 'v2', 'created': 'Mon, 23 May 2022 07:22:02 GMT'}]",2022-05-24,"[['Chong', 'Sue Sin', '']]","['attention mechanism', 'simulation', 'approximationalgorithm', 'randomized algorithm', 'permutations', 'problemdriven architecture']"
5433,1312.2919,Daniel Zinn,"Daniel Zinn and Todd J Green and Bertram Lud\""ascher",Win-Move is Coordination-Free (Sometimes),"Proceedings of the 15th International Conference on Database Theory.
  Pages 99-113. March 26-30, 2012, Berlin, Germany",,10.1145/2274576.2274588,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a recent paper by Hellerstein [15], a tight relationship was conjectured
between the number of strata of a Datalog${}^\neg$ program and the number of
""coordination stages"" required for its distributed computation. Indeed, Ameloot
et al. [9] showed that a query can be computed by a coordination-free
relational transducer network iff it is monotone, thus answering in the
affirmative a variant of Hellerstein's CALM conjecture, based on a particular
definition of coordination-free computation. In this paper, we present three
additional models for declarative networking. In these variants, relational
transducers have limited access to the way data is distributed. This variation
allows transducer networks to compute more queries in a coordination-free
manner: e.g., a transducer can check whether a ground atom $A$ over the input
schema is in the ""scope"" of the local node, and then send either $A$ or $\neg
A$ to other nodes.
  We show the surprising result that the query given by the well-founded
semantics of the unstratifiable win-move program is coordination-free in some
of the models we consider. We also show that the original transducer network
model [9] and our variants form a strict hierarchy of classes of
coordination-free queries. Finally, we identify different syntactic fragments
of Datalog${}^{\neg\neg}_{\forall}$, called semi-monotone programs, which can
be used as declarative network programming languages, whose distributed
computation is guaranteed to be eventually consistent and coordination-free.
","[{'version': 'v1', 'created': 'Tue, 10 Dec 2013 19:27:41 GMT'}]",2013-12-11,"[['Zinn', 'Daniel', ''], ['Green', 'Todd J', ''], ['Ludäscher', 'Bertram', '']]","['Datalog', 'distribution', 'relational transducer', 'monotonicity']"
5434,2203.13941,Tommy Nilsson,"Tommy Nilsson, Flavie Rometsch, Andrea E. M. Casini, Enrico Guerra,
  Leonie Becker, Andreas Treuer, Paul de Medeiros, Hanjo Schnellbaecher, Anna
  Vock, Aidan Cowley","Using Virtual Reality to Design and Evaluate a Lunar Lander: The EL3
  Case Study",,"CHI Conference on Human Factors in Computing Systems, 2022, ACM",10.1145/3491101.3519775,,cs.HC cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The European Large Logistics Lander (EL3) is being designed to carry out
cargo delivery missions in support of future lunar ground crews. The capacity
of virtual reality (VR) to visualize and interactively simulate the unique
lunar environment makes it a potentially powerful design tool during the early
development stages of such solutions. Based on input from the EL3 development
team, we have produced a VR-based operational scenario featuring a hypothetical
configuration of the lander. Relying on HCI research methods, we have
subsequently evaluated this scenario with relevant experts (n=10). Qualitative
findings from this initial pilot study have demonstrated the usefulness of VR
as a design tool in this context, but likewise surfaced a number of limitations
in the form of potentially impaired validity and generalizability. We conclude
by outlining our future research plan and reflect on the potential use of
physical stimuli to improve the validity of VR-based simulations in forthcoming
design activities.
","[{'version': 'v1', 'created': 'Fri, 25 Mar 2022 23:52:10 GMT'}]",2022-03-29,"[['Nilsson', 'Tommy', ''], ['Rometsch', 'Flavie', ''], ['Casini', 'Andrea E. M.', ''], ['Guerra', 'Enrico', ''], ['Becker', 'Leonie', ''], ['Treuer', 'Andreas', ''], ['de Medeiros', 'Paul', ''], ['Schnellbaecher', 'Hanjo', ''], ['Vock', 'Anna', ''], ['Cowley', 'Aidan', '']]","['virtual reality', 'human factors', 'ergonomics', 'human spaceflight', 'aerospace engineering']"
5435,1412.5204,Shoni Gilboa,"Shoni Gilboa, Shay Gueron and Ben Morris","How many queries are needed to distinguish a truncated random
  permutation from a random function?",,"Journal of Cryptology, January 2018, Volume 31, Issue 1, pp
  162-171",10.1007/s00145-017-9253-0,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An oracle chooses a function $f$ from the set of $n$ bits strings to itself,
which is either a randomly chosen permutation or a randomly chosen function.
When queried by an $n$-bit string $w$, the oracle computes $f(w)$, truncates
the $m$ last bits, and returns only the first $n-m$ bits of $f(w)$. How many
queries does a querying adversary need to submit in order to distinguish the
truncated permutation from the (truncated) function?
  In 1998, Hall et al. showed an algorithm for determining (with high
probability) whether or not $f$ is a permutation, using $O(2^{\frac{m+n}{2}})$
queries. They also showed that if $m < n/7$, a smaller number of queries will
not suffice. For $m > n/7$, their method gives a weaker bound. In this note, we
first show how a modification of the approximation method used by Hall et al.
can solve the problem completely. It extends the result to practically any $m$,
showing that $\Omega(2^{\frac{m+n}{2}})$ queries are needed to get a
non-negligible distinguishing advantage. However, more surprisingly, a better
bound for the distinguishing advantage can be obtained from a result of Stam
published, in a different context, already in 1978. We also show that, at least
in some cases, Stam's bound is tight.
","[{'version': 'v1', 'created': 'Tue, 16 Dec 2014 21:32:05 GMT'}]",2018-01-08,"[['Gilboa', 'Shoni', ''], ['Gueron', 'Shay', ''], ['Morris', 'Ben', '']]","['Pseudo random permutations', 'pseudo random functions', 'advantage']"
5436,1701.03849,Pavel Kral,"Ladislav Lenc, Pavel Kr\'al",Deep Neural Networks for Czech Multi-label Document Classification,"Presented at 17th International Conference on Intelligent Text
  Processing and Computational Linguistics (CICLing 2016), Konya, Turkey, 3-9
  April 2016, pp. 460-471, Springer, ISBN: 978-3-319-75487-1",,10.1007/978-3-319-75487-1_36,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is focused on automatic multi-label document classification of
Czech text documents. The current approaches usually use some pre-processing
which can have negative impact (loss of information, additional implementation
work, etc). Therefore, we would like to omit it and use deep neural networks
that learn from simple features. This choice was motivated by their successful
usage in many other machine learning fields. Two different networks are
compared: the first one is a standard multi-layer perceptron, while the second
one is a popular convolutional network. The experiments on a Czech newspaper
corpus show that both networks significantly outperform baseline method which
uses a rich set of features with maximum entropy classifier. We have also shown
that convolutional network gives the best results.
","[{'version': 'v1', 'created': 'Fri, 13 Jan 2017 23:23:12 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Jan 2017 23:17:30 GMT'}, {'version': 'v3', 'created': 'Tue, 6 Oct 2020 20:07:14 GMT'}]",2020-10-08,"[['Lenc', 'Ladislav', ''], ['Král', 'Pavel', '']]","['Czech', 'Deep Neural Networks', 'Document Classification', 'Multi-label']"
5437,1202.4943,Bheshaj Dewangan,"Bheshaj Kumar, Kavita Thakur and G. R. Sinha","A new hybrid jpeg image compression scheme using symbol reduction
  technique","11 pages,9 figures, SIP 2012 held on 3-4 January 2012,at
  Bangalore,India. arXiv admin note: text overlap with standard references on
  JPEG without attribution",,10.5121/csit.2012.2101-10.5121-csit.2012.2141,,cs.MM cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lossy JPEG compression is a widely used compression technique. Normally the
JPEG standard technique uses three process mapping reduces interpixel
redundancy, quantization, which is lossy process and entropy encoding, which is
considered lossless process. In this paper, a new technique has been proposed
by combining the JPEG algorithm and Symbol Reduction Huffman technique for
achieving more compression ratio. The symbols reduction technique reduces the
number of symbols by combining together to form a new symbol. As a result of
this technique the number of Huffman code to be generated also reduced. It is
simple fast and easy to implement. The result shows that the performance of
standard JPEG method can be improved by proposed method. This hybrid approach
achieves about 20% more compression ratio than the Standard JPEG.
","[{'version': 'v1', 'created': 'Wed, 22 Feb 2012 15:43:56 GMT'}]",2012-08-15,"[['Kumar', 'Bheshaj', ''], ['Thakur', 'Kavita', ''], ['Sinha', 'G. R.', '']]","['Image Compression', 'JPEG', 'Source Symbol Reduction', 'Entropy Encoder', 'Huffman coding']"
5438,1008.3288,Md. Saiful Islam,"Md. Saiful Islam, Zerina Begum",Reversible Logic Synthesis of Fault Tolerant Carry Skip BCD Adder,"9 pages, 7 figures, 5 tables","Bangladesh Academy of Science Journal, Vol. 32, No. 2, pp.
  193-200, December 2008",10.3329/jbas.v32i2.2431,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reversible logic is emerging as an important research area having its
application in diverse fields such as low power CMOS design, digital signal
processing, cryptography, quantum computing and optical information processing.
This paper presents a new 4*4 parity preserving reversible logic gate, IG. The
proposed parity preserving reversible gate can be used to synthesize any
arbitrary Boolean function. It allows any fault that affects no more than a
single signal readily detectable at the circuit's primary outputs. It is shown
that a fault tolerant reversible full adder circuit can be realized using only
two IGs. The proposed fault tolerant full adder (FTFA) is used to design other
arithmetic logic circuits for which it is used as the fundamental building
block. It has also been demonstrated that the proposed design offers less
hardware complexity and is efficient in terms of gate count, garbage outputs
and constant inputs than the existing counterparts.
","[{'version': 'v1', 'created': 'Thu, 19 Aug 2010 12:25:44 GMT'}]",2010-08-20,"[['Islam', 'Md. Saiful', ''], ['Begum', 'Zerina', '']]","['Reversible Logic', 'Parity Preserving Reversible Gate', 'IG Gate', 'FTFA and Carry Skip']"
5439,1706.06720,Mohamed Loey,"Mohamed Loey, Ahmed El-Sawy, Hazem EL-Bakry","Deep Learning Autoencoder Approach for Handwritten Arabic Digits
  Recognition",6 pages,,10.1007/978-3-319-48308-5_54,,cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new unsupervised learning approach with stacked
autoencoder (SAE) for Arabic handwritten digits categorization. Recently,
Arabic handwritten digits recognition has been an important area due to its
applications in several fields. This work is focusing on the recognition part
of handwritten Arabic digits recognition that face several challenges,
including the unlimited variation in human handwriting and the large public
databases. Arabic digits contains ten numbers that were descended from the
Indian digits system. Stacked autoencoder (SAE) tested and trained the MADBase
database (Arabic handwritten digits images) that contain 10000 testing images
and 60000 training images. We show that the use of SAE leads to significant
improvements across different machine-learning classification algorithms. SAE
is giving an average accuracy of 98.5%.
","[{'version': 'v1', 'created': 'Wed, 21 Jun 2017 02:02:31 GMT'}]",2020-04-07,"[['Loey', 'Mohamed', ''], ['El-Sawy', 'Ahmed', ''], ['EL-Bakry', 'Hazem', '']]","['Deep Learning', 'Stacked autoencoder', 'Arabic Digits recognition']"
5440,1502.03556,Md. Hanif Seddiqui,"Md. Hanif Seddiqui, Rudra Pratap Deb Nath, Masaki Aono","An Efficient Metric of Automatic Weight Generation for Properties in
  Instance Matching Technique","17 pages, 5 figures, 3 tables, pp. 1-17, publication year 2015,
  journal publication, vol. 6 number 1","Journal of Web and Semantic Technology (IJWeST), vol.6 no.1, pp.
  1-17 (2015)",10.5121/ijwest.2015.6101,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The proliferation of heterogeneous data sources of semantic knowledge base
intensifies the need of an automatic instance matching technique. However, the
efficiency of instance matching is often influenced by the weight of a property
associated to instances. Automatic weight generation is a non-trivial, however
an important task in instance matching technique. Therefore, identifying an
appropriate metric for generating weight for a property automatically is
nevertheless a formidable task. In this paper, we investigate an approach of
generating weights automatically by considering hypotheses: (1) the weight of a
property is directly proportional to the ratio of the number of its distinct
values to the number of instances contain the property, and (2) the weight is
also proportional to the ratio of the number of distinct values of a property
to the number of instances in a training dataset. The basic intuition behind
the use of our approach is the classical theory of information content that
infrequent words are more informative than frequent ones. Our mathematical
model derives a metric for generating property weights automatically, which is
applied in instance matching system to produce re-conciliated instances
efficiently. Our experiments and evaluations show the effectiveness of our
proposed metric of automatic weight generation for properties in an instance
matching technique.
","[{'version': 'v1', 'created': 'Thu, 12 Feb 2015 07:51:39 GMT'}]",2015-02-13,"[['Seddiqui', 'Md. Hanif', ''], ['Nath', 'Rudra Pratap Deb', ''], ['Aono', 'Masaki', '']]","['Instance Matching', 'Automatic Property Weight', 'Semantic Integration', 'Identity Recognition', 'RecordLinkage']"
5441,1303.0926,Zhi Hu,"Lin Wang, Zhi Hu","Injectivity w.r.t. Distribution of Elements in the Compressed Sequences
  Derived from Primitive Sequences over $Z/p^eZ$","42 pages, updated version",,10.1007/s12095-017-0278-x,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $p\geq3$ be a prime and $e\geq2$ an integer. Let $\sigma(x)$ be a
primitive polynomial of degree $n$ over $Z/p^eZ$ and $G'(\sigma(x),p^e)$ the
set of primitive linear recurring sequences generated by $\sigma(x)$. A
compressing map $\varphi$ on $Z/p^eZ$ naturally induces a map $\hat{\varphi}$
on $G'(\sigma(x),p^e)$. For a subset $D$ of the image of
$\varphi$,$\hat{\varphi}$ is called to be injective w.r.t. $D$-uniformity if
the distribution of elements of $D$ in the compressed sequence implies all
information of the original primitive sequence. In this correspondence, for at
least $1-2(p-1)/(p^n-1)$ of primitive polynomials of degree $n$, a clear
criterion on $\varphi$ is obtained to decide whether $\hat{\varphi}$ is
injective w.r.t. $D$-uniformity, and the majority of maps on $Z/p^eZ$ induce
injective maps on $G'(\sigma(x),p^e)$. Furthermore, a sufficient condition on
$\varphi$ is given to ensure injectivity of $\hat{\varphi}$ w.r.t.
$D$-uniformity. It follows from the sufficient condition that if $\sigma(x)$ is
strongly primitive and the compressing map $\varphi(x)=f(x_{e-1})$, where
$f(x_{e-1})$ is a permutation polynomial over $\mathbb{F}_{p}$, then
$\hat{\varphi}$ is injective w.r.t. $D$-uniformity for $\emptyset\neq
D\subset\mathbb{F}_{p}$. Moreover, we give three specific families of
compressing maps which induce injective maps on $G'(\sigma(x),p^e)$.
","[{'version': 'v1', 'created': 'Tue, 5 Mar 2013 05:05:42 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Oct 2013 02:57:00 GMT'}, {'version': 'v3', 'created': 'Wed, 19 Feb 2014 10:57:37 GMT'}, {'version': 'v4', 'created': 'Wed, 14 Jan 2015 02:10:18 GMT'}]",2018-10-02,"[['Wang', 'Lin', ''], ['Hu', 'Zhi', '']]","['Residue ring', 'compressing map', 'primitive sequence', 'uniformity', 'equivalence closure']"
5442,1907.07275,John Cook,"John Cook, Rishab Nithyanand and Zubair Shafiq","Inferring Tracker-Advertiser Relationships in the Online Advertising
  Ecosystem using Header Bidding","18 pages, 2 figures, Privacy Enhancing Technologies Symposium (2020)",,10.2478/popets-2020-0001,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online advertising relies on trackers and data brokers to show targeted ads
to users. To improve targeting, different entities in the intricately
interwoven online advertising and tracking ecosystems are incentivized to share
information with each other through client-side or server-side mechanisms.
Inferring data sharing between entities, especially when it happens at the
server-side, is an important and challenging research problem. In this paper,
we introduce KASHF: a novel method to infer data sharing relationships between
advertisers and trackers by studying how an advertiser's bidding behavior
changes as we manipulate the presence of trackers. We operationalize this
insight by training an interpretable machine learning model that uses the
presence of trackers as features to predict the bidding behavior of an
advertiser. By analyzing the machine learning model, we are able to infer
relationships between advertisers and trackers irrespective of whether data
sharing occurs at the client-side or the server-side. We are also able to
identify several server-side data sharing relationships that are validated
externally but are not detected by client-side cookie syncing.
","[{'version': 'v1', 'created': 'Tue, 16 Jul 2019 22:15:00 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Sep 2019 20:08:25 GMT'}]",2019-09-24,"[['Cook', 'John', ''], ['Nithyanand', 'Rishab', ''], ['Shafiq', 'Zubair', '']]","['cookie syncing', 'header bidding', 'online advertising', 'tracking']"
5443,2102.07923,Seyed Amir Tafrishi,"Seyed Amir Tafrishi, Mikhail Svinin and Motoji Yamamoto","Darboux-Frame-Based Parametrization for a Spin-Rolling Sphere on a
  Plane: A Nonlinear Transformation of Underactuated System to Fully-Actuated
  Model","17 pages, 7 figures, Accepted at Mechanism and Machine Theory
  Elsevier",,10.1016/j.mechmachtheory.2021.104415,,cs.RO math.DG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper presents a new kinematic model based on the Darboux frame for
motion control and planning. In this work, we show that an underactuated model
of a spin-rolling sphere on a plane with five states and three inputs can be
transformed into a fully-actuated one by a given Darboux frame transformation.
This nonlinear state transformation establishes a geometric model that is
different from conventional state-space ones. First, a kinematic model of the
Darboux frame at the contact point of the rolling sphere is established. Next,
we propose a virtual surface that is trapped between the sphere and the contact
plane. This virtual surface is used for generating arc-length-based inputs for
controlling the contact trajectories on the sphere and the plane. Finally, we
discuss the controllability of this new model. In the future, we will design a
geometric path planning method for the proposed kinematic model.
","[{'version': 'v1', 'created': 'Tue, 16 Feb 2021 02:23:43 GMT'}, {'version': 'v2', 'created': 'Sat, 12 Jun 2021 13:09:07 GMT'}]",2021-06-15,"[['Tafrishi', 'Seyed Amir', ''], ['Svinin', 'Mikhail', ''], ['Yamamoto', 'Motoji', '']]","['Darboux frame', 'parameterization', 'spin-rolling', 'sphere on plane', 'controllability', 'underactuatedsystem']"
5444,1701.06307,Anton V. Proskurnikov,"Anton V. Proskurnikov, Roberto Tempo",A Tutorial on Modeling and Analysis of Dynamic Social Networks. Part I,under review in Annual Reviews in Control,"Annual Reviews in Control, 2017, vol. 43, pp. 65-79",10.1016/j.arcontrol.2017.03.002,,cs.SY cs.MA cs.SI nlin.AO physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, we have observed a significant trend towards filling the gap
between social network analysis and control. This trend was enabled by the
introduction of new mathematical models describing dynamics of social groups,
the advancement in complex networks theory and multi-agent systems, and the
development of modern computational tools for big data analysis. The aim of
this tutorial is to highlight a novel chapter of control theory, dealing with
applications to social systems, to the attention of the broad research
community. This paper is the first part of the tutorial, and it is focused on
the most classical models of social dynamics and on their relations to the
recent achievements in multi-agent systems.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2017 09:36:38 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Mar 2017 20:14:55 GMT'}]",2017-10-16,"[['Proskurnikov', 'Anton V.', ''], ['Tempo', 'Roberto', '']]","['Social network', 'opinion dynamics', 'multi-agent systems', 'distributed algorithms']"
5445,1804.08091,Luca Di Stefano,"Rocco De Nicola, Luca Di Stefano, Omar Inverso",Towards formal models and languages for verifiable Multi-Robot Systems,Changed formatting,,10.3389/frobt.2018.00094,,cs.PL cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Incorrect operations of a Multi-Robot System (MRS) may not only lead to
unsatisfactory results, but can also cause economic losses and threats to
safety. These threats may not always be apparent, since they may arise as
unforeseen consequences of the interactions between elements of the system.
This call for tools and techniques that can help in providing guarantees about
MRSs behaviour. We think that, whenever possible, these guarantees should be
backed up by formal proofs to complement traditional approaches based on
testing and simulation.
  We believe that tailored linguistic support to specify MRSs is a major step
towards this goal. In particular, reducing the gap between typical features of
an MRS and the level of abstraction of the linguistic primitives would simplify
both the specification of these systems and the verification of their
properties. In this work, we review different agent-oriented languages and
their features; we then consider a selection of case studies of interest and
implement them useing the surveyed languages. We also evaluate and compare
effectiveness of the proposed solution, considering, in particular, easiness of
expressing non-trivial behaviour.
","[{'version': 'v1', 'created': 'Sun, 22 Apr 2018 10:14:37 GMT'}, {'version': 'v2', 'created': 'Tue, 8 May 2018 12:56:07 GMT'}]",2018-09-06,"[['De Nicola', 'Rocco', ''], ['Di Stefano', 'Luca', ''], ['Inverso', 'Omar', '']]","['multi-robot systems', 'languages', 'communication', 'collective behaviour', 'automated reasoning']"
5446,1605.06047,Gerasimos Spanakis,"Gerasimos Spanakis, Gerhard Weiss","AMSOM: Adaptive Moving Self-organizing Map for Clustering and
  Visualization",ICAART 2016 accepted full paper,,10.5220/0005704801290140,,cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-Organizing Map (SOM) is a neural network model which is used to obtain a
topology-preserving mapping from the (usually high dimensional) input/feature
space to an output/map space of fewer dimensions (usually two or three in order
to facilitate visualization). Neurons in the output space are connected with
each other but this structure remains fixed throughout training and learning is
achieved through the updating of neuron reference vectors in feature space.
Despite the fact that growing variants of SOM overcome the fixed structure
limitation they increase computational cost and also do not allow the removal
of a neuron after its introduction. In this paper, a variant of SOM is proposed
called AMSOM (Adaptive Moving Self-Organizing Map) that on the one hand creates
a more flexible structure where neuron positions are dynamically altered during
training and on the other hand tackles the drawback of having a predefined grid
by allowing neuron addition and/or removal during training. Experiments using
multiple literature datasets show that the proposed method improves training
performance of SOM, leads to a better visualization of the input dataset and
provides a framework for determining the optimal number and structure of
neurons.
","[{'version': 'v1', 'created': 'Thu, 19 May 2016 16:41:00 GMT'}]",2016-05-20,"[['Spanakis', 'Gerasimos', ''], ['Weiss', 'Gerhard', '']]","['Self-Organizing Maps', 'Clustering', 'Visualization', 'Unsupervised Learning']"
5447,1610.08098,Eduardo Graells-Garrido,"Eduardo Graells-Garrido, Leo Ferres, Diego Caro, Loreto Bravo","The Effect of Pok\'emon Go on The Pulse of the City: A Natural
  Experiment","23 pages, 7 figures. Published at EPJ Data Science",,10.1140/epjds/s13688-017-0119-3,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pok\'emon Go, a location-based game that uses augmented reality techniques,
received unprecedented media coverage due to claims that it allowed for greater
access to public spaces, increasing the number of people out on the streets,
and generally improving health, social, and security indices. However, the true
impact of Pok\'emon Go on people's mobility patterns in a city is still largely
unknown. In this paper, we perform a natural experiment using data from mobile
phone networks to evaluate the effect of Pok\'emon Go on the pulse of a big
city: Santiago, capital of Chile. We found significant effects of the game on
the floating population of Santiago compared to movement prior to the game's
release in August 2016: in the following week, up to 13.8\% more people spent
time outside at certain times of the day, even if they do not seem to go out of
their usual way. These effects were found by performing regressions using count
models over the states of the cellphone network during each day under study.
The models used controlled for land use, daily patterns, and points of interest
in the city.
  Our results indicate that, on business days, there are more people on the
street at commuting times, meaning that people did not change their daily
routines but slightly adapted them to play the game. Conversely, on Saturday
and Sunday night, people indeed went out to play, but favored places close to
where they live.
  Even if the statistical effects of the game do not reflect the massive change
in mobility behavior portrayed by the media, at least in terms of expanse, they
do show how ""the street"" may become a new place of leisure. This change should
have an impact on long-term infrastructure investment by city officials, and on
the drafting of public policies aimed at stimulating pedestrian traffic.
","[{'version': 'v1', 'created': 'Tue, 25 Oct 2016 21:13:55 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Sep 2017 16:50:12 GMT'}]",2017-09-19,"[['Graells-Garrido', 'Eduardo', ''], ['Ferres', 'Leo', ''], ['Caro', 'Diego', ''], ['Bravo', 'Loreto', '']]","['Pokémon', 'Mobile Phone Data', 'Call Detail Records', 'Floating Population', 'Urban Informatics']"
5448,1709.05675,Andrey Savchenko,"Anastasiia D. Sokolova, Angelina S. Kharchevnikova, Andrey V.
  Savchenko","Organizing Multimedia Data in Video Surveillance Systems Based on Face
  Verification with Convolutional Neural Networks","8 pages; 1 figure, accepted for publication at AIST17","Proceedings of the International Conference on Analysis of Images,
  Social Networks and Texts (AIST), 2018, pp. 223-230",10.1007/978-3-319-73013-4_20,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose the two-stage approach of organizing information in
video surveillance systems. At first, the faces are detected in each frame and
a video stream is split into sequences of frames with face region of one
person. Secondly, these sequences (tracks) that contain identical faces are
grouped using face verification algorithms and hierarchical agglomerative
clustering. Gender and age are estimated for each cluster (person) in order to
facilitate the usage of the organized video collection. The particular
attention is focused on the aggregation of features extracted from each frame
with the deep convolutional neural networks. The experimental results of the
proposed approach using YTF and IJB-A datasets demonstrated that the most
accurate and fast solution is achieved for matching of normalized average of
feature vectors of all frames in a track.
","[{'version': 'v1', 'created': 'Sun, 17 Sep 2017 14:57:55 GMT'}]",2018-01-04,"[['Sokolova', 'Anastasiia D.', ''], ['Kharchevnikova', 'Angelina S.', ''], ['Savchenko', 'Andrey V.', '']]","['Organizing video data', 'video surveillance system', 'deep convolutional neural networks', 'clustering', 'face verification']"
5449,1703.06680,Gabriele D'Angelo,"Moreno Marzolla, Gabriele D'Angelo","Parallel Sort-Based Matching for Data Distribution Management on
  Shared-Memory Multiprocessors","Proceedings of the 21-th ACM/IEEE International Symposium on
  Distributed Simulation and Real Time Applications (DS-RT 2017). Best Paper
  Award @DS-RT 2017",,10.1109/DISTRA.2017.8167660,,cs.DC cs.DS cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider the problem of identifying intersections between
two sets of d-dimensional axis-parallel rectangles. This is a common problem
that arises in many agent-based simulation studies, and is of central
importance in the context of High Level Architecture (HLA), where it is at the
core of the Data Distribution Management (DDM) service. Several realizations of
the DDM service have been proposed; however, many of them are either
inefficient or inherently sequential. These are serious limitations since
multicore processors are now ubiquitous, and DDM algorithms -- being
CPU-intensive -- could benefit from additional computing power. We propose a
parallel version of the Sort-Based Matching algorithm for shared-memory
multiprocessors. Sort-Based Matching is one of the most efficient serial
algorithms for the DDM problem, but is quite difficult to parallelize due to
data dependencies. We describe the algorithm and compute its asymptotic running
time; we complete the analysis by assessing its performance and scalability
through extensive experiments on two commodity multicore systems based on a
dual socket Intel Xeon processor, and a single socket Intel Core i7 processor.
","[{'version': 'v1', 'created': 'Mon, 20 Mar 2017 11:17:39 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Jul 2017 06:02:24 GMT'}, {'version': 'v3', 'created': 'Wed, 25 Oct 2017 08:42:20 GMT'}, {'version': 'v4', 'created': 'Tue, 7 Aug 2018 07:20:05 GMT'}]",2018-08-08,"[['Marzolla', 'Moreno', ''], [""D'Angelo"", 'Gabriele', '']]","['Data Distribution Management (DDM)', 'Parallel And Distributed Simulation (PADS)', 'High Level Architecture (HLA)', 'Parallel Algorithms']"
5450,1903.12400,Efstratios Rappos,Efstratios Rappos and Stephan Robert and Philippe Cudr\'e-Mauroux,A Force-Directed Approach for Offline GPS Trajectory Map Matching,"10 pages, 12 figures, accepted version of article submitted to ACM
  SIGSPATIAL 2018, Seattle, USA","26th ACM SIGSPATIAL International Conference on Advances in
  Geographic Information Systems (SIGSPATIAL '18), November 6-9, 2018, Seattle,
  WA, USA",10.1145/3274895.3274919,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a novel algorithm to match GPS trajectories onto maps offline (in
batch mode) using techniques borrowed from the field of force-directed graph
drawing. We consider a simulated physical system where each GPS trajectory is
attracted or repelled by the underlying road network via electrical-like
forces. We let the system evolve under the action of these physical forces such
that individual trajectories are attracted towards candidate roads to obtain a
map matching path. Our approach has several advantages compared to traditional,
routing-based, algorithms for map matching, including the ability to account
for noise and to avoid large detours due to outliers in the data whilst taking
into account the underlying topological restrictions (such as one-way roads).
Our empirical evaluation using real GPS traces shows that our method produces
better map matching results compared to alternative offline map matching
algorithms on average, especially for routes in dense, urban areas.
","[{'version': 'v1', 'created': 'Fri, 29 Mar 2019 08:58:41 GMT'}]",2019-04-01,"[['Rappos', 'Efstratios', ''], ['Robert', 'Stephan', ''], ['Cudré-Mauroux', 'Philippe', '']]","['Map matching', 'force-directed algorithms', 'GPS trajectory', 'road map', 'offline routing']"
5451,1808.06178,Mohammad Reza Mohammadi Dr.,Mohammad Reza Mohammadi,"Deep Multiple Instance Learning for Airplane Detection in High
  Resolution Imagery","12 pages, 12 figures, 5 tables",,10.1007/s00138-020-01153-7,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic airplane detection in aerial imagery has a variety of applications.
Two of the significant challenges in this task are variations in the scale and
direction of the airplanes. To solve these challenges, we present a
rotation-and-scale invariant airplane proposal generator. We call this
generator symmetric line segments (SLS) that is developed based on the
symmetric and regular boundaries of airplanes from the top view. Then, the
generated proposals are used to train a deep convolutional neural network for
removing non-airplane proposals. Since each airplane can have multiple SLS
proposals, where some of them are not in the direction of the fuselage, we
collect all proposals corresponding to one ground-truth as a positive bag and
the others as the negative instances. To have multiple instance deep learning,
we modify the loss function of the network to learn from each positive bag at
least one instance as well as all negative instances. Finally, we employ
non-maximum suppression to remove duplicate detections. Our experiments on NWPU
VHR-10 and DOTA datasets show that our method is a promising approach for
automatic airplane detection in very high-resolution images. Moreover, we
estimate the direction of the airplanes using box-level annotations as an extra
achievement.
","[{'version': 'v1', 'created': 'Sun, 19 Aug 2018 07:36:22 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Oct 2020 04:40:36 GMT'}]",2020-11-03,"[['Mohammadi', 'Mohammad Reza', '']]","['Airplane detection', 'Convolutional neural networks', 'Deep learning', 'Multiple instance learning', 'Proposal generation', 'Symmetricline segments', 'Transfer learning']"
5452,1107.4747,Fabrizio Riguzzi PhD,Fabrizio Riguzzi and Terrance Swift,"The PITA System: Tabling and Answer Subsumption for Reasoning under
  Uncertainty",,"Theory and Practice of Logic Programming, 27th International
  Conference on Logic Programming (ICLP'11) Special Issue, 11(4-5), 433-449,
  2011",10.1017/S147106841100010X,,cs.AI cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many real world domains require the representation of a measure of
uncertainty. The most common such representation is probability, and the
combination of probability with logic programs has given rise to the field of
Probabilistic Logic Programming (PLP), leading to languages such as the
Independent Choice Logic, Logic Programs with Annotated Disjunctions (LPADs),
Problog, PRISM and others. These languages share a similar distribution
semantics, and methods have been devised to translate programs between these
languages. The complexity of computing the probability of queries to these
general PLP programs is very high due to the need to combine the probabilities
of explanations that may not be exclusive. As one alternative, the PRISM system
reduces the complexity of query answering by restricting the form of programs
it can evaluate. As an entirely different alternative, Possibilistic Logic
Programs adopt a simpler metric of uncertainty than probability. Each of these
approaches -- general PLP, restricted PLP, and Possibilistic Logic Programming
-- can be useful in different domains depending on the form of uncertainty to
be represented, on the form of programs needed to model problems, and on the
scale of the problems to be solved. In this paper, we show how the PITA system,
which originally supported the general PLP language of LPADs, can also
efficiently support restricted PLP and Possibilistic Logic Programs. PITA
relies on tabling with answer subsumption and consists of a transformation
along with an API for library functions that interface with answer subsumption.
","[{'version': 'v1', 'created': 'Sun, 24 Jul 2011 11:22:41 GMT'}]",2011-07-26,"[['Riguzzi', 'Fabrizio', ''], ['Swift', 'Terrance', '']]","['Probabilistic Logic Programming', 'Possibilistic Logic Programming', 'Tabling', 'Answer Subsumption', 'Program Transformation']"
5453,1409.6448,Bo Han,"Bo Han, Bo He, Tingting Sun, Mengmeng Ma, Amaury Lendasse","HSR: L1/2 Regularized Sparse Representation for Fast Face Recognition
  using Hierarchical Feature Selection",Submitted to IEEE Computational Intelligence Magazine in 09/2014,,10.1007/s00521-015-1907-y,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel method for fast face recognition called
L1/2 Regularized Sparse Representation using Hierarchical Feature Selection
(HSR). By employing hierarchical feature selection, we can compress the scale
and dimension of global dictionary, which directly contributes to the decrease
of computational cost in sparse representation that our approach is strongly
rooted in. It consists of Gabor wavelets and Extreme Learning Machine
Auto-Encoder (ELM-AE) hierarchically. For Gabor wavelets part, local features
can be extracted at multiple scales and orientations to form Gabor-feature
based image, which in turn improves the recognition rate. Besides, in the
presence of occluded face image, the scale of Gabor-feature based global
dictionary can be compressed accordingly because redundancies exist in
Gabor-feature based occlusion dictionary. For ELM-AE part, the dimension of
Gabor-feature based global dictionary can be compressed because
high-dimensional face images can be rapidly represented by low-dimensional
feature. By introducing L1/2 regularization, our approach can produce sparser
and more robust representation compared to regularized Sparse Representation
based Classification (SRC), which also contributes to the decrease of the
computational cost in sparse representation. In comparison with related work
such as SRC and Gabor-feature based SRC (GSRC), experimental results on a
variety of face databases demonstrate the great advantage of our method for
computational cost. Moreover, we also achieve approximate or even better
recognition rate.
","[{'version': 'v1', 'created': 'Tue, 23 Sep 2014 08:36:05 GMT'}]",2016-03-29,"[['Han', 'Bo', ''], ['He', 'Bo', ''], ['Sun', 'Tingting', ''], ['Ma', 'Mengmeng', ''], ['Lendasse', 'Amaury', '']]","['Fast Face Recognition', 'Hierarchical Feature Selection', 'Gabor wavelets', 'ELM-AE', 'Sparse Representation', '⁄  Regularization', 'HSR']"
5454,1809.01986,Vijay Anand,Vijay Anand and Vivek kanhangad,"Pore detection in high-resolution fingerprint images using Deep Residual
  Network","9 pages, 1 figure, 4 Tables",,10.1117/1.JEI.28.2.020502,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This letter presents a residual learning-based convolutional neural network,
referred to as DeepResPore, for detection of pores in high-resolution
fingerprint images. Specifically, the proposed DeepResPore model generates a
pore intensity map from the input fingerprint image. Subsequently, the local
maxima filter is operated on the pore intensity map to identify the pore
coordinates. The results of our experiments indicate that the proposed approach
is effective in extracting pores with a true detection rate of 94:49% on Test
set I and 93:78% on Test set II of the publicly available PolyU HRF dataset.
Most importantly, the proposed approach achieves state-of-the-art performance
on both test sets.
","[{'version': 'v1', 'created': 'Thu, 6 Sep 2018 13:38:16 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Sep 2018 09:41:17 GMT'}]",2019-07-24,"[['Anand', 'Vijay', ''], ['kanhangad', 'Vivek', '']]","['pore detection', 'high-resolution fingerprint', 'deep residual network']"
5455,1309.5319,Clement Moulin-Frier,"Cl\'ement Moulin-Frier (INRIA Bordeaux - Sud-Ouest, GIPSA-lab), M. A.
  Arbib (USC)","Recognizing Speech in a Novel Accent: The Motor Theory of Speech
  Perception Reframed",,"Biological Cybernetics 107, 4 (2013) 421-447",10.1007/s00422-013-0557-3,,cs.CL cs.LG q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The motor theory of speech perception holds that we perceive the speech of
another in terms of a motor representation of that speech. However, when we
have learned to recognize a foreign accent, it seems plausible that recognition
of a word rarely involves reconstruction of the speech gestures of the speaker
rather than the listener. To better assess the motor theory and this
observation, we proceed in three stages. Part 1 places the motor theory of
speech perception in a larger framework based on our earlier models of the
adaptive formation of mirror neurons for grasping, and for viewing extensions
of that mirror system as part of a larger system for neuro-linguistic
processing, augmented by the present consideration of recognizing speech in a
novel accent. Part 2 then offers a novel computational model of how a listener
comes to understand the speech of someone speaking the listener's native
language with a foreign accent. The core tenet of the model is that the
listener uses hypotheses about the word the speaker is currently uttering to
update probabilities linking the sound produced by the speaker to phonemes in
the native language repertoire of the listener. This, on average, improves the
recognition of later words. This model is neutral regarding the nature of the
representations it uses (motor vs. auditory). It serve as a reference point for
the discussion in Part 3, which proposes a dual-stream neuro-linguistic
architecture to revisits claims for and against the motor theory of speech
perception and the relevance of mirror neurons, and extracts some implications
for the reframing of the motor theory.
","[{'version': 'v1', 'created': 'Fri, 20 Sep 2013 16:47:48 GMT'}]",2013-09-23,"[['Moulin-Frier', 'Clément', '', 'INRIA Bordeaux - Sud-Ouest, GIPSA-lab'], ['Arbib', 'M. A.', '', 'USC']]","['Neurolinguistics', 'computational modeling', 'mirror neurons', 'speech recognition', 'foreign accent', 'Motor theory of speech perception', 'Hidden Markov Models']"
5456,1803.06867,Richard McClatchey,"Khawar Hasham, Kamran Munir, Richard McClatchey","Cloud Infrastructure Provenance Collection and Management to Reproduce
  Scientific Workflow Execution","59 pages, 21 figures, 4 algorithms, 6 tables, Future Generation
  Computer Systems. March 2018",,10.1016/j.future.2017.07.015,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The emergence of Cloud computing provides a new computing paradigm for
scientific workflow execution. It provides dynamic, on-demand and scalable
resources that enable the processing of complex workflow-based experiments.
With the ever growing size of the experimental data and increasingly complex
processing workflows, the need for reproducibility has also become essential.
Provenance has been thought of a mechanism to verify a workflow and to provide
workflow reproducibility. One of the obstacles in reproducing an experiment
execution is the lack of information about the execution infrastructure in the
collected provenance. This information becomes critical in the context of Cloud
in which resources are provisioned on-demand and by specifying resource
configurations. Therefore, a mechanism is required that enables capturing of
infrastructure information along with the provenance of workflows executing on
the Cloud to facilitate the re-creation of execution environment on the Cloud.
This paper presents a framework, ReCAP, along with the proposed mapping
approaches that aid in capturing the Cloud-aware provenance information and
help in re-provisioning the execution resource on the Cloud with similar
configurations. Experimental evaluation has shown the impact of different
resource configurations on the workflow execution performance, therefore
justifies the need for collecting such provenance information in the context of
Cloud. The evaluation has also demonstrated that the proposed mapping
approaches can capture Cloud information in various Cloud usage scenarios
without causing performance overhead and can also enable the re-provisioning of
resources on Cloud. Experiments were conducted using workflows from different
scientific domains such as astronomy and neuroscience to demonstrate the
applicability of this research for different workflows.
","[{'version': 'v1', 'created': 'Mon, 19 Mar 2018 10:52:43 GMT'}]",2018-03-20,"[['Hasham', 'Khawar', ''], ['Munir', 'Kamran', ''], ['McClatchey', 'Richard', '']]","['Scientific Workflows', 'Cloud Computing', 'Cloud Infrastructure', 'Provenance', 'Reproducibility']"
5457,1901.04194,Marcos Baez,"Marcos Baez, Radoslaw Nielek, Fabio Casati, Adam Wierzbicki",Technologies for promoting social participation in later life,,,10.1007/978-981-13-3693-5_17,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social participation is known to bring great benefits to the health and
well-being of people as they age. From being in contact with others to engaging
in group activities, keeping socially active can help slow down the effects of
age-related declines, reduce risks of loneliness and social isolation and even
mortality in old age. There are unfortunately a variety of barriers that make
it difficult for older adults to engage in social activities in a regular
basis. In this chapter, we give an overview of the challenges to social
participation and discuss how technology can help overcome these barriers and
promote participation in social activities. We examine two particular research
threads and designs, exploring ways in which technology can support co-located
and virtual participation: i) an application that motivates the virtual
participation in group training programs, and ii) a location-based game that
supports co-located intergenerational ICT training classes. We discuss the
effectiveness and limitations of various design choices in the two use cases
and outline the lessons learned
","[{'version': 'v1', 'created': 'Mon, 14 Jan 2019 09:05:31 GMT'}]",2019-01-15,"[['Baez', 'Marcos', ''], ['Nielek', 'Radoslaw', ''], ['Casati', 'Fabio', ''], ['Wierzbicki', 'Adam', '']]","['social interaction', 'active aging', 'older adults', 'persuasion', 'technology']"
5458,2004.05383,Sebastian Feld,"Sebastian Feld (1), Steffen Illium (1), Andreas Sedlmeier (1), Lenz
  Belzner (2) ((1) Mobile and Distributed Systems Group LMU Munich, (2)
  MaibornWolff Munich)",Trajectory annotation using sequences of spatial perception,"10 pages, 17 figures","Proceedings of the 26th ACM SIGSPATIAL International Conference on
  Advances in Geographic Information Systems (SIGSPATIAL '18), 2018, p. 329-338",10.1145/3274895.3274968,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the near future, more and more machines will perform tasks in the vicinity
of human spaces or support them directly in their spatially bound activities.
In order to simplify the verbal communication and the interaction between
robotic units and/or humans, reliable and robust systems w.r.t. noise and
processing results are needed. This work builds a foundation to address this
task. By using a continuous representation of spatial perception in interiors
learned from trajectory data, our approach clusters movement in dependency to
its spatial context. We propose an unsupervised learning approach based on a
neural autoencoding that learns semantically meaningful continuous encodings of
spatio-temporal trajectory data. This learned encoding can be used to form
prototypical representations. We present promising results that clear the path
for future applications.
","[{'version': 'v1', 'created': 'Sat, 11 Apr 2020 12:22:27 GMT'}]",2020-04-14,"[['Feld', 'Sebastian', ''], ['Illium', 'Steffen', ''], ['Sedlmeier', 'Andreas', ''], ['Belzner', 'Lenz', '']]","['Spatial Syntax', 'Isovist Analysis', 'Geospatial Trajectories', 'IndoorNavigation', 'Auto-Encoder', 'Artificial Neural Networks']"
5459,1407.8355,Waldir Moreira,"Waldir Moreira, Ronedo Ferreira, Douglas Cirqueira, Paulo Mendes and
  Eduardo Cerqueira",SocialDTN: A DTN implementation for Digital and Social Inclusion,"3 pages, 4 figures",,10.1145/2502880.2502892,,cs.NI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite of the importance of access to computers and to the Internet for the
development of people and their inclusion in society, there are people that
still suffer with digital divide and social exclusion.
Delay/Disruption-Tolerant Networking (DTN) can help the digital/social
inclusion of these people as it allows opportunistic and asynchronous
communication, which does not depend upon networking infrastructure. We
introduce SocialDTN, an implementation of the DTN architecture for Android
devices that operates over Bluetooth, taking advantages of the social daily
routines of users. As we want to exploit the social proximity and interactions
existing among users, SocialDTN includes a social-aware opportunistic routing
proposal, dLife, instead of the well-known (but social-oblivious) PROPHET.
Simulations show the potential of dLife for our needs. Additionally, some
preliminary results from field experimentations are presented.
","[{'version': 'v1', 'created': 'Thu, 31 Jul 2014 11:12:13 GMT'}]",2014-08-01,"[['Moreira', 'Waldir', ''], ['Ferreira', 'Ronedo', ''], ['Cirqueira', 'Douglas', ''], ['Mendes', 'Paulo', ''], ['Cerqueira', 'Eduardo', '']]","['delay/disruption-tolerant networking', 'social proximity', 'Amazon riverside communities', 'digital/social inclusion']"
5460,1908.03781,Arthur Franz,"Arthur Franz, Oleksandr Antonenko, Roman Soletskyi",A theory of incremental compression,"24 pages, 3 figures","Information Sciences, Volume 547, Pages 28-48, 2021",10.1016/j.ins.2020.08.035,,cs.IT cs.LG math.IT,http://creativecommons.org/licenses/by/4.0/,"  The ability to find short representations, i.e. to compress data, is crucial
for many intelligent systems. We present a theory of incremental compression
showing that arbitrary data strings, that can be described by a set of
features, can be compressed by searching for those features incrementally,
which results in a partition of the information content of the string into a
complete set of pairwise independent pieces. The description length of this
partition turns out to be close to optimal in terms of the Kolmogorov
complexity of the string. Exploiting this decomposition, we introduce ALICE - a
computable ALgorithm for Incremental ComprEssion - and derive an expression for
its time complexity. Finally, we show that our concept of a feature is closely
related to Martin-L\""of randomness tests, thereby formalizing the meaning of
""property"" for computable objects.
","[{'version': 'v1', 'created': 'Sat, 10 Aug 2019 16:55:42 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Sep 2020 12:11:05 GMT'}]",2020-09-15,"[['Franz', 'Arthur', ''], ['Antonenko', 'Oleksandr', ''], ['Soletskyi', 'Roman', '']]","['compression', 'autoencoder', 'feature', 'Kolmogorov complexity', 'Occam’s razor', 'Martin-Löf randomness']"
5461,1208.0803,Nilanjan  Dey,"Nilanjan Dey, Anamitra Bardhan Roy, Sayantan Dey",A Novel Approach of Color Image Hiding using RGB Color planes and DWT,"6 pages, 14 figures, Published with International Journal of Computer
  Applications (IJCA)","International Journal of Computer Applications 36(5):19-24,
  December 2011",10.5120/4487-6316,,cs.CR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work proposes a wavelet based Steganographic technique for the color
image. The true color cover image and the true color secret image both are
decomposed into three separate color planes namely R, G and B. Each plane of
the images is decomposed into four sub bands using DWT. Each color plane of the
secret image is hidden by alpha blending technique in the corresponding sub
bands of the respective color planes of the original image. During embedding,
secret image is dispersed within the original image depending upon the alpha
value. Extraction of the secret image varies according to the alpha value. In
this approach the stego image generated is of acceptable level of
imperceptibility and distortion compared to the cover image and the overall
security is high.
","[{'version': 'v1', 'created': 'Fri, 3 Aug 2012 17:41:55 GMT'}]",2012-08-06,"[['Dey', 'Nilanjan', ''], ['Roy', 'Anamitra Bardhan', ''], ['Dey', 'Sayantan', '']]","['Color Planes', 'DWT', 'Alpha Blending', 'Steganography']"
5462,1709.05122,Robert Riemann,"St\'ephane Grumbach (1), Robert Riemann (1) ((1) DICE, DATASPHERE)",Distributed Random Process for a Large-Scale Peer-to-Peer Lottery,,"Lydia Y. Chen; Hans P. Reiser. Proc. of 17th IFIP Distributed
  Applications and Interoperable Systems, Jun 2017, Neuch{\^a}tel, Switzerland.
  Springer, 10320, pp.34-48, 2017, LNCS - Lecture Notes in Computer Science",10.1007/978-3-319-59665-5_3,,cs.DC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most online lotteries today fail to ensure the verifiability of the random
process and rely on a trusted third party. This issue has received little
attention since the emergence of distributed protocols like Bitcoin that
demonstrated the potential of protocols with no trusted third party. We argue
that the security requirements of online lotteries are similar to those of
online voting, and propose a novel distributed online lottery protocol that
applies techniques developed for voting applications to an existing lottery
protocol. As a result, the protocol is scalable, provides efficient
verification of the random process and does not rely on a trusted third party
nor on assumptions of bounded computational resources. An early prototype
confirms the feasibility of our approach.
","[{'version': 'v1', 'created': 'Fri, 15 Sep 2017 09:23:34 GMT'}]",2017-09-18,"[['Grumbach', 'Stéphane', '', 'DICE, DATASPHERE'], ['Riemann', 'Robert', '', 'DICE, DATASPHERE']]","['distributed aggregation', 'online lottery', 'DHT', 'trust', 'scalability']"
5463,1803.01248,Giovanni Vincenti,Giovanni Vincenti,Imprecise temporal associations and decision support systems,"6 pages, 3 figures",,10.1016/j.procs.2018.04.096,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The quick and pervasive infiltration of decision support systems, artificial
intelligence, and data mining in consumer electronics and everyday life in
general has been significant in recent years. Fields such as UX have been
facilitating the integration of such technologies into software and hardware,
but the back-end processing is still based on binary foundations. This article
describes an approach to mining for imprecise temporal associations among
events in data streams, taking into account the very natural concept of
approximation. This type of association analysis is likely to lead to more
meaningful and actionable decision support systems.
","[{'version': 'v1', 'created': 'Sat, 3 Mar 2018 21:40:33 GMT'}]",2018-04-13,"[['Vincenti', 'Giovanni', '']]","['Association analysis', 'Temporal data mining', 'Imprecise temporal associations', 'Fuzzy sets']"
5464,1905.03297,Chirag Nagpal,"Chirag Nagpal, Dennis Wei, Bhanukiran Vinzamuri, Monica Shekhar, Sara
  E. Berger, Subhro Das, Kush R. Varshney","Interpretable Subgroup Discovery in Treatment Effect Estimation with
  Application to Opioid Prescribing Guidelines",,"First ACM Conference on Health, Inference and Learning (CHIL) 2020",10.1145/3368555.3384456,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The dearth of prescribing guidelines for physicians is one key driver of the
current opioid epidemic in the United States. In this work, we analyze medical
and pharmaceutical claims data to draw insights on characteristics of patients
who are more prone to adverse outcomes after an initial synthetic opioid
prescription. Toward this end, we propose a generative model that allows
discovery from observational data of subgroups that demonstrate an enhanced or
diminished causal effect due to treatment. Our approach models these
sub-populations as a mixture distribution, using sparsity to enhance
interpretability, while jointly learning nonlinear predictors of the potential
outcomes to better adjust for confounding. The approach leads to
human-interpretable insights on discovered subgroups, improving the practical
utility for decision support
","[{'version': 'v1', 'created': 'Wed, 8 May 2019 19:00:09 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Feb 2020 20:27:46 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Mar 2020 19:48:54 GMT'}]",2020-05-01,"[['Nagpal', 'Chirag', ''], ['Wei', 'Dennis', ''], ['Vinzamuri', 'Bhanukiran', ''], ['Shekhar', 'Monica', ''], ['Berger', 'Sara E.', ''], ['Das', 'Subhro', ''], ['Varshney', 'Kush R.', '']]","['causal treatment effect', 'heterogeneous treatment effect', 'Bayesiannetworks', 'decision support']"
5465,1501.03691,Christoph Koutschan,"Manuel Kauers, Christoph Koutschan",Integral D-Finite Functions,,"Proceedings of the International Symposium on Symbolic and
  Algebraic Computation (ISSAC 2015), pages 251-258, 2015. ACM, New York, USA,
  ISBN 978-1-4503-3435-8",10.1145/2755996.2756658,,cs.SC math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a differential analog of the notion of integral closure of
algebraic function fields. We present an algorithm for computing the integral
closure of the algebra defined by a linear differential operator. Our algorithm
is a direct analog of van Hoeij's algorithm for computing integral bases of
algebraic function fields.
","[{'version': 'v1', 'created': 'Thu, 15 Jan 2015 14:29:19 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Jun 2015 07:27:48 GMT'}]",2015-07-01,"[['Kauers', 'Manuel', ''], ['Koutschan', 'Christoph', '']]","['Integral Basis', 'D-finite Function', 'Differential Operator']"
5466,1005.2211,Francisco Soulignac,"Min Chih Lin, Francisco J. Soulignac, Jayme L. Szwarcfiter","Arboricity, h-Index, and Dynamic Algorithms","19 pages, no figures",,10.1016/j.tcs.2011.12.006,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a modification of a technique by Chiba and Nishizeki
[Chiba and Nishizeki: Arboricity and Subgraph Listing Algorithms, SIAM J.
Comput. 14(1), pp. 210--223 (1985)]. Based on it, we design a data structure
suitable for dynamic graph algorithms. We employ the data structure to
formulate new algorithms for several problems, including counting subgraphs of
four vertices, recognition of diamond-free graphs, cop-win graphs and strongly
chordal graphs, among others. We improve the time complexity for graphs with
low arboricity or h-index.
","[{'version': 'v1', 'created': 'Wed, 12 May 2010 21:33:10 GMT'}]",2014-08-18,"[['Lin', 'Min Chih', ''], ['Soulignac', 'Francisco J.', ''], ['Szwarcfiter', 'Jayme L.', '']]","['data structures', 'dynamic algorithms', 'arboricity', 'h-index', 'cop-win graphs', 'diamond-free graphs', 'strongly chordal graphs']"
5467,1902.10008,Matheus Venturyne Xavier Ferreira,"Tithi Chattopadhyay and Nick Feamster and Matheus V. X. Ferreira and
  Danny Yuxing Huang and S. Matthew Weinberg",Selling a Single Item with Negative Externalities,,"The World Wide Web Conference, 2019, 196-206",10.1145/3308558.3313692,,cs.GT cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of regulating products with negative externalities to
a third party that is neither the buyer nor the seller, but where both the
buyer and seller can take steps to mitigate the externality. The motivating
example to have in mind is the sale of Internet-of-Things (IoT) devices, many
of which have historically been compromised for DDoS attacks that disrupted
Internet-wide services such as Twitter. Neither the buyer (i.e., consumers) nor
seller (i.e., IoT manufacturers) was known to suffer from the attack, but both
have the power to expend effort to secure their devices. We consider a
regulator who regulates payments (via fines if the device is compromised, or
market prices directly), or the product directly via mandatory security
requirements.
  Both regulations come at a cost---implementing security requirements
increases production costs, and the existence of fines decreases consumers'
values---thereby reducing the seller's profits. The focus of this paper is to
understand the \emph{efficiency} of various regulatory policies. That is,
policy A is more efficient than policy B if A more successfully minimizes
negatives externalities, while both A and B reduce seller's profits equally.
  We develop a simple model to capture the impact of regulatory policies on a
buyer's behavior. {In this model, we show that for \textit{homogeneous}
markets---where the buyer's ability to follow security practices is always high
or always low---the optimal (externality-minimizing for a given profit
constraint) regulatory policy need regulate \emph{only} payments \emph{or}
production.} In arbitrary markets, by contrast, we show that while the optimal
policy may require regulating both aspects, there is always an approximately
optimal policy which regulates just one.
","[{'version': 'v1', 'created': 'Tue, 26 Feb 2019 15:43:12 GMT'}]",2020-06-08,"[['Chattopadhyay', 'Tithi', ''], ['Feamster', 'Nick', ''], ['Ferreira', 'Matheus V. X.', ''], ['Huang', 'Danny Yuxing', ''], ['Weinberg', 'S. Matthew', '']]","['Mechanism Design and Approximation', 'Auction Design', 'Negative Externalities', 'Tragedy of the Commons', 'Policy and Regulation']"
5468,0808.3546,Ioan Raicu,"Ioan Raicu, Yong Zhao, Ian Foster, Alex Szalay",Accelerating Large-scale Data Exploration through Data Diffusion,"IEEE/ACM International Workshop on Data-Aware Distributed Computing
  2008",,10.1145/1383519.1383521,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data-intensive applications often require exploratory analysis of large
datasets. If analysis is performed on distributed resources, data locality can
be crucial to high throughput and performance. We propose a ""data diffusion""
approach that acquires compute and storage resources dynamically, replicates
data in response to demand, and schedules computations close to data. As demand
increases, more resources are acquired, thus allowing faster response to
subsequent requests that refer to the same data; when demand drops, resources
are released. This approach can provide the benefits of dedicated hardware
without the associated high costs, depending on workload and resource
characteristics. The approach is reminiscent of cooperative caching,
web-caching, and peer-to-peer storage systems, but addresses different
application demands. Other data-aware scheduling approaches assume dedicated
resources, which can be expensive and/or inefficient if load varies
significantly. To explore the feasibility of the data diffusion approach, we
have extended the Falkon resource provisioning and task scheduling system to
support data caching and data-aware scheduling. Performance results from both
micro-benchmarks and a large scale astronomy application demonstrate that our
approach improves performance relative to alternative approaches, as well as
provides improved scalability as aggregated I/O bandwidth scales linearly with
the number of data cache nodes.
","[{'version': 'v1', 'created': 'Tue, 26 Aug 2008 16:02:50 GMT'}]",2016-11-17,"[['Raicu', 'Ioan', ''], ['Zhao', 'Yong', ''], ['Foster', 'Ian', ''], ['Szalay', 'Alex', '']]","['Data diffusion', 'data caching', 'data management', 'data-aware scheduling', 'data-intensive applications', 'Grid', 'Falkon', 'Swift']"
5469,1309.0339,Taisuke Sato,Taisuke Sato and Philipp Meyer,Infinite probability computation by cyclic explanation graphs,29 pages,Theory and Practice of Logic Programming 14 (2014) 909-937,10.1017/S1471068413000562,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tabling in logic programming has been used to eliminate redundant computation
and also to stop infinite loop. In this paper we investigate another
possibility of tabling, i.e. to compute an infinite sum of probabilities for
probabilistic logic programs. Using PRISM, a logic-based probabilistic modeling
language with a tabling mechanism, we generalize prefix probability computation
for probabilistic context free grammars (PCFGs) to probabilistic logic
programs. Given a top-goal, we search for all proofs with tabling and obtain an
explanation graph which compresses them and may be cyclic. We then convert the
explanation graph to a set of linear probability equations and solve them by
matrix operation. The solution gives us the probability of the top-goal, which,
in nature, is an infinite sum of probabilities. Our general approach to prefix
probability computation through tabling not only allows to deal with non-PCFGs
such as probabilistic left-corner grammars (PLCGs) but has applications such as
plan recognition and probabilistic model checking and makes it possible to
compute probability for probabilistic models describing cyclic relations. To
appear in Theory and Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Mon, 2 Sep 2013 09:44:28 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Sep 2013 04:36:40 GMT'}]",2020-02-19,"[['Sato', 'Taisuke', ''], ['Meyer', 'Philipp', '']]","['tabling', 'probability computation', 'prefix', 'probability equation']"
5470,1907.10914,Fernando S\'aenz-P\'erez,Fernando S\'aenz-P\'erez,Applying Constraint Logic Programming to SQL Semantic Analysis,"Paper presented at the 35th International Conference on Logic
  Programming (ICLP 2019), Las Cruces, New Mexico, USA, 20-25 September 2019,
  16 pages",Theory and Practice of Logic Programming 19 (2019) 808-825,10.1017/S1471068419000206,,cs.DB cs.AI cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes the use of Constraint Logic Programming (CLP) to model
SQL queries in a data-independent abstract layer by focusing on some semantic
properties for signalling possible errors in such queries. First, we define a
translation from SQL to Datalog, and from Datalog to CLP, so that solving this
CLP program will give information about inconsistency, tautology, and possible
simplifications. We use different constraint domains which are mapped to SQL
types, and propose them to cooperate for improving accuracy. Our approach
leverages a deductive system that includes SQL and Datalog, and we present an
implementation in this system which is currently being tested in classroom,
showing its advantages and differences with respect to other approaches, as
well as some performance data. This paper is under consideration for acceptance
in TPLP.
","[{'version': 'v1', 'created': 'Thu, 25 Jul 2019 09:19:30 GMT'}]",2020-02-19,"[['Sáenz-Pérez', 'Fernando', '']]","['Constraint Logic Programming', 'SQL', 'Semantic Checking', 'Datalog Educational System']"
5471,1603.01562,Ellen Le,"Ellen B. Le, Aaron Myers, Tan Bui-Thanh and Quoc P. Nguyen","A Data-Scalable Randomized Misfit Approach for Solving Large-Scale
  PDE-Constrained Inverse Problems",29 pages,,10.1088/1361-6420/aa6cbd,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A randomized misfit approach is presented for the efficient solution of
large-scale PDE-constrained inverse problems with high-dimensional data. The
purpose of this paper is to offer a theory-based framework for random
projections in this inverse problem setting. The stochastic approximation to
the misfit is analyzed using random projection theory. By expanding beyond mean
estimator convergence, a practical characterization of randomized misfit
convergence can be achieved. The theoretical results developed hold with any
valid random projection in the literature. The class of feasible distributions
is broad yet simple to characterize compared to previous stochastic misfit
methods. This class includes very sparse random projections which provide
additional computational benefit. A different proof for a variant of the
Johnson-Lindenstrauss lemma is also provided. This leads to a different
intuition for the $O(\epsilon^{-2})$ factor in bounds for Johnson-Lindenstrauss
results. The main contribution of this paper is a theoretical result showing
the method guarantees a valid solution for small reduced misfit dimensions. The
interplay between Johnson-Lindenstrauss theory and Morozov's discrepancy
principle is shown to be essential to the result. The computational cost
savings for large-scale PDE-constrained problems with high- dimensional data is
discussed. Numerical verification of the developed theory is presented for
model problems of estimating a distributed parameter in an elliptic partial
differential equation. Results with different random projections are presented
to demonstrate the viability and accuracy of the proposed approach.
","[{'version': 'v1', 'created': 'Fri, 4 Mar 2016 18:26:27 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Feb 2017 06:34:51 GMT'}, {'version': 'v3', 'created': 'Mon, 17 Apr 2017 15:52:43 GMT'}]",2017-04-18,"[['Le', 'Ellen B.', ''], ['Myers', 'Aaron', ''], ['Bui-Thanh', 'Tan', ''], ['Nguyen', 'Quoc P.', '']]","['Random projections', 'stochastic programming', 'large-scale inverse problems', 'model reduction', 'large deviation theory', 'Johnson-Lindenstrauss lemma', 'big data']"
5472,1902.10320,Shromona Ghosh,"Shromona Ghosh, Somil Bansal, Alberto Sangiovanni-Vincentelli, Sanjit
  A. Seshia, Claire J. Tomlin","A New Simulation Metric to Determine Safe Environments and Controllers
  for Systems with Unknown Dynamics","22nd ACM International Conference on Hybrid Systems: Computation and
  Control (2019)",,10.1145/3302504.3311795,,cs.RO cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of extracting safe environments and controllers for
reach-avoid objectives for systems with known state and control spaces, but
unknown dynamics. In a given environment, a common approach is to synthesize a
controller from an abstraction or a model of the system (potentially learned
from data). However, in many situations, the relationship between the dynamics
of the model and the \textit{actual system} is not known; and hence it is
difficult to provide safety guarantees for the system. In such cases, the
Standard Simulation Metric (SSM), defined as the worst-case norm distance
between the model and the system output trajectories, can be used to modify a
reach-avoid specification for the system into a more stringent specification
for the abstraction. Nevertheless, the obtained distance, and hence the
modified specification, can be quite conservative. This limits the set of
environments for which a safe controller can be obtained. We propose SPEC, a
specification-centric simulation metric, which overcomes these limitations by
computing the distance using only the trajectories that violate the
specification for the system. We show that modifying a reach-avoid
specification with SPEC allows us to synthesize a safe controller for a larger
set of environments compared to SSM. We also propose a probabilistic method to
compute SPEC for a general class of systems. Case studies using simulators for
quadrotors and autonomous cars illustrate the advantages of the proposed metric
for determining safe environment sets and controllers.
","[{'version': 'v1', 'created': 'Wed, 27 Feb 2019 03:30:01 GMT'}]",2019-02-28,"[['Ghosh', 'Shromona', ''], ['Bansal', 'Somil', ''], ['Sangiovanni-Vincentelli', 'Alberto', ''], ['Seshia', 'Sanjit A.', ''], ['Tomlin', 'Claire J.', '']]","['Simulation metric', 'Safe environment assumptions', 'Safe controllersynthesis', 'Model-mismatch', 'Reach-avoid objectives', 'Scenario optimization']"
5473,1203.2832,Marco Scarsini,Ehud Lehrer and Marco Scarsini,On the Core of Dynamic Cooperative Games,25 pages,,10.1007/s13235-013-0078-7,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider dynamic cooperative games, where the worth of coalitions varies
over time according to the history of allocations. When defining the core of a
dynamic game, we allow the possibility for coalitions to deviate at any time
and thereby to give rise to a new environment. A coalition that considers a
deviation needs to take the consequences into account because from the
deviation point on, the game is no longer played with the original set of
players. The deviating coalition becomes the new grand coalition which, in
turn, induces a new dynamic game. The stage games of the new dynamical game
depend on all previous allocation including those that have materialized from
the deviating time on.
  We define three types of core solutions: fair core, stable core and credible
core. We characterize the first two in case where the instantaneous game
depends on the last allocation (rather than on the whole history of
allocations) and the third in the general case. The analysis and the results
resembles to a great extent the theory of non-cooperative dynamic games.
","[{'version': 'v1', 'created': 'Tue, 13 Mar 2012 15:11:35 GMT'}]",2017-04-04,"[['Lehrer', 'Ehud', ''], ['Scarsini', 'Marco', '']]","['fair core', 'stable core', 'credible core', 'convexification of a game']"
5474,1811.12721,Marco Torchiano,"Mohammad Rifat Ahmmad Rashid and Giuseppe Rizzo and Marco Torchiano
  and Nandana Mihindukulasooriya and Oscar Corcho and Ra\'ul Garc\'ia-Castro",Completeness and Consistency Analysis for Evolving Knowledge Bases,Accepted for Journal of Web Semantics,,10.1016/j.websem.2018.11.004,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Assessing the quality of an evolving knowledge base is a challenging task as
it often requires to identify correct quality assessment procedures.
  Since data is often derived from autonomous, and increasingly large data
sources, it is impractical to manually curate the data, and challenging to
continuously and automatically assess their quality.
  In this paper, we explore two main areas of quality assessment related to
evolving knowledge bases: (i) identification of completeness issues using
knowledge base evolution analysis, and (ii) identification of consistency
issues based on integrity constraints, such as minimum and maximum cardinality,
and range constraints.
  For completeness analysis, we use data profiling information from consecutive
knowledge base releases to estimate completeness measures that allow predicting
quality issues. Then, we perform consistency checks to validate the results of
the completeness analysis using integrity constraints and learning models.
  The approach has been tested both quantitatively and qualitatively by using a
subset of datasets from both DBpedia and 3cixty knowledge bases. The
performance of the approach is evaluated using precision, recall, and F1 score.
From completeness analysis, we observe a 94% precision for the English DBpedia
KB and 95% precision for the 3cixty Nice KB. We also assessed the performance
of our consistency analysis by using five learning models over three sub-tasks,
namely minimum cardinality, maximum cardinality, and range constraint. We
observed that the best performing model in our experimental setup is the Random
Forest, reaching an F1 score greater than 90% for minimum and maximum
cardinality and 84% for range constraints.
","[{'version': 'v1', 'created': 'Fri, 30 Nov 2018 11:01:47 GMT'}]",2018-12-03,"[['Rashid', 'Mohammad Rifat Ahmmad', ''], ['Rizzo', 'Giuseppe', ''], ['Torchiano', 'Marco', ''], ['Mihindukulasooriya', 'Nandana', ''], ['Corcho', 'Oscar', ''], ['García-Castro', 'Raúl', '']]","['Quality Assessment', 'Evolution Analysis', 'Validation', 'Knowledge Base', 'RDF Shape', 'Machine Learning']"
5475,2102.11127,Xueli Yu,"Xueli Yu, Weizhi Xu, Zeyu Cui, Shu Wu, Liang Wang",Graph-based Hierarchical Relevance Matching Signals for Ad-hoc Retrieval,To appear at WWW 2021,,10.1145/3442381.3450115,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  The ad-hoc retrieval task is to rank related documents given a query and a
document collection. A series of deep learning based approaches have been
proposed to solve such problem and gained lots of attention. However, we argue
that they are inherently based on local word sequences, ignoring the subtle
long-distance document-level word relationships. To solve the problem, we
explicitly model the document-level word relationship through the graph
structure, capturing the subtle information via graph neural networks. In
addition, due to the complexity and scale of the document collections, it is
considerable to explore the different grain-sized hierarchical matching signals
at a more general level. Therefore, we propose a Graph-based Hierarchical
Relevance Matching model (GHRM) for ad-hoc retrieval, by which we can capture
the subtle and general hierarchical matching signals simultaneously. We
validate the effects of GHRM over two representative ad-hoc retrieval
benchmarks, the comprehensive experiments and results demonstrate its
superiority over state-of-the-art methods.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2021 15:57:08 GMT'}]",2021-02-23,"[['Yu', 'Xueli', ''], ['Xu', 'Weizhi', ''], ['Cui', 'Zeyu', ''], ['Wu', 'Shu', ''], ['Wang', 'Liang', '']]","['Hierarchical graph neural networks', 'Ad-hoc retrieval', 'Relevancematching']"
5476,1805.09644,Siamak Barzegar,"Siamak Barzegar, Juliano Efson Sales, Andre Freitas, Siegfried
  Handschuh and Brian Davis",DINFRA: A One Stop Shop for Computing Multilingual Semantic Relatedness,"2 pages, 2 figures, SIGIR Conference",,10.1145/2766462.2767870,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This demonstration presents an infrastructure for computing multilingual
semantic relatedness and correlation for twelve natural languages by using
three distributional semantic models (DSMs). Our demonsrator - DInfra
(Distributional Infrastructure) provides researchers and developers with a
highly useful platform for processing large-scale corpora and conducting
experiments with distributional semantics. We integrate several multilingual
DSMs in our webservice so the end user can obtain a result without worrying
about the complexities involved in building DSMs. Our webservice allows the
users to have easy access to a wide range of comparisons of DSMs with different
parameters. In addition, users can configure and access DSM parameters using an
easy to use API.
","[{'version': 'v1', 'created': 'Wed, 16 May 2018 21:06:59 GMT'}]",2018-05-25,"[['Barzegar', 'Siamak', ''], ['Sales', 'Juliano Efson', ''], ['Freitas', 'Andre', ''], ['Handschuh', 'Siegfried', ''], ['Davis', 'Brian', '']]","['Distirbutional Infrastructure', 'Multilingual Semantic Relatedness', 'Distributional Semantic Models']"
5477,2102.07545,Keisuke Fujii,Keisuke Fujii,Data-driven Analysis for Understanding Team Sports Behaviors,"9 pages, 2 figures. This is the first draft and the final version
  will be published in the Journal of Robotics and Mechatronics","J. Robot. Mechatron., Vol.33, No.3, pp. 505-514, 2021",10.20965/jrm.2021.p0505,,cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Understanding the principles of real-world biological multi-agent behaviors
is a current challenge in various scientific and engineering fields. The rules
regarding the real-world biological multi-agent behaviors such as team sports
are often largely unknown due to their inherently higher-order interactions,
cognition, and body dynamics. Estimation of the rules from data, i.e.,
data-driven approaches such as machine learning, provides an effective way for
the analysis of such behaviors. Although most data-driven models have
non-linear structures and high prediction performances, it is sometimes hard to
interpret them. This survey focuses on data-driven analysis for quantitative
understanding of invasion team sports behaviors such as basketball and
football, and introduces two main approaches for understanding such multi-agent
behaviors: (1) extracting easily interpretable features or rules from data and
(2) generating and controlling behaviors in visually-understandable ways. The
first approach involves the visualization of learned representations and the
extraction of mathematical structures behind the behaviors. The second approach
can be used to test hypotheses by simulating and controlling future and
counterfactual behaviors. Lastly, the potential practical applications of
extracted rules, features, and generated behaviors are discussed. These
approaches can contribute to a better understanding of multi-agent behaviors in
the real world.
","[{'version': 'v1', 'created': 'Mon, 15 Feb 2021 13:31:45 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Feb 2021 07:27:48 GMT'}]",2021-06-22,"[['Fujii', 'Keisuke', '']]","['Human behavior', 'Machine learning', 'Dynamical systems', 'Sports', 'Interpretability']"
5478,1807.05381,Michael Veale,Vasilios Mavroudis and Michael Veale,"Eavesdropping Whilst You're Shopping: Balancing Personalisation and
  Privacy in Connected Retail Spaces","10 pages, 1 figure, Proceedings of the PETRAS/IoTUK/IET Living in the
  Internet of Things Conference, London, United Kingdom, 28-29 March 2018",,10.1049/cp.2018.0018,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Physical retailers, who once led the way in tracking with loyalty cards and
`reverse appends', now lag behind online competitors. Yet we might be seeing
these tables turn, as many increasingly deploy technologies ranging from simple
sensors to advanced emotion detection systems, even enabling them to tailor
prices and shopping experiences on a per-customer basis. Here, we examine these
in-store tracking technologies in the retail context, and evaluate them from
both technical and regulatory standpoints. We first introduce the relevant
technologies in context, before considering privacy impacts, the current
remedies individuals might seek through technology and the law, and those
remedies' limitations. To illustrate challenging tensions in this space we
consider the feasibility of technical and legal approaches to both a) the
recent `Go' store concept from Amazon which requires fine-grained, multi-modal
tracking to function as a shop, and b) current challenges in opting in or out
of increasingly pervasive passive Wi-Fi tracking. The `Go' store presents
significant challenges with its legality in Europe significantly unclear and
unilateral, technical measures to avoid biometric tracking likely ineffective.
In the case of MAC addresses, we see a difficult-to-reconcile clash between
privacy-as-confidentiality and privacy-as-control, and suggest a technical
framework which might help balance the two. Significant challenges exist when
seeking to balance personalisation with privacy, and researchers must work
together, including across the boundaries of preferred privacy definitions, to
come up with solutions that draw on both technology and the legal frameworks to
provide effective and proportionate protection. Retailers, simultaneously, must
ensure that their tracking is not just legal, but worthy of the trust of
concerned data subjects.
","[{'version': 'v1', 'created': 'Sat, 14 Jul 2018 11:26:35 GMT'}]",2018-07-17,"[['Mavroudis', 'Vasilios', ''], ['Veale', 'Michael', '']]","['customer profiling', 'personalisation', 'data protection', 'in-store tracking', 'privacy']"
5479,1509.01771,Gibran Fuentes-Pineda,Gibran Fuentes-Pineda and Ivan Vladimir Meza-Ruiz,Sampled Weighted Min-Hashing for Large-Scale Topic Mining,"10 pages, Proceedings of the Mexican Conference on Pattern
  Recognition 2015",,10.1007/978-3-319-19264-2_20,,cs.LG cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present Sampled Weighted Min-Hashing (SWMH), a randomized approach to
automatically mine topics from large-scale corpora. SWMH generates multiple
random partitions of the corpus vocabulary based on term co-occurrence and
agglomerates highly overlapping inter-partition cells to produce the mined
topics. While other approaches define a topic as a probabilistic distribution
over a vocabulary, SWMH topics are ordered subsets of such vocabulary.
Interestingly, the topics mined by SWMH underlie themes from the corpus at
different levels of granularity. We extensively evaluate the meaningfulness of
the mined topics both qualitatively and quantitatively on the NIPS (1.7 K
documents), 20 Newsgroups (20 K), Reuters (800 K) and Wikipedia (4 M) corpora.
Additionally, we compare the quality of SWMH with Online LDA topics for
document representation in classification.
","[{'version': 'v1', 'created': 'Sun, 6 Sep 2015 06:09:28 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Sep 2015 03:14:12 GMT'}]",2015-09-09,"[['Fuentes-Pineda', 'Gibran', ''], ['Meza-Ruiz', 'Ivan Vladimir', '']]","['large-scale topic mining', 'min-hashing', 'co-occurring terms']"
5480,0902.2859,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",Transmission protocols for instruction streams,13 pages,"In ICTAC 2009, pages 127--139. Springer-Verlag, LNCS 5684, 2009",10.1007/978-3-642-03466-4_8,PRG0903,cs.PL cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Threads as considered in thread algebra model behaviours to be controlled by
some execution environment: upon each action performed by a thread, a reply
from its execution environment -- which takes the action as an instruction to
be processed -- determines how the thread proceeds. In this paper, we are
concerned with the case where the execution environment is remote: we describe
and analyse some transmission protocols for passing instructions from a thread
to a remote execution environment.
","[{'version': 'v1', 'created': 'Tue, 17 Feb 2009 08:41:22 GMT'}]",2009-09-02,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['transmission protocol', 'instruction stream', 'thread algebra', 'process algebra', 'process extraction']"
5481,2103.03335,Leonid Boytsov,"Iurii Mokrii, Leonid Boytsov, Pavel Braslavski","A Systematic Evaluation of Transfer Learning and Pseudo-labeling with
  BERT-based Ranking Models",,"SIGIR 2021 (44th International ACM SIGIR Conference on Research
  and Development in Information Retrieval)",10.1145/3404835.3463093,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to high annotation costs making the best use of existing human-created
training data is an important research direction. We, therefore, carry out a
systematic evaluation of transferability of BERT-based neural ranking models
across five English datasets. Previous studies focused primarily on zero-shot
and few-shot transfer from a large dataset to a dataset with a small number of
queries. In contrast, each of our collections has a substantial number of
queries, which enables a full-shot evaluation mode and improves reliability of
our results. Furthermore, since source datasets licences often prohibit
commercial use, we compare transfer learning to training on pseudo-labels
generated by a BM25 scorer. We find that training on pseudo-labels -- possibly
with subsequent fine-tuning using a modest number of annotated queries -- can
produce a competitive or better model compared to transfer learning. Yet, it is
necessary to improve the stability and/or effectiveness of the few-shot
training, which, sometimes, can degrade performance of a pretrained model.
","[{'version': 'v1', 'created': 'Thu, 4 Mar 2021 21:08:06 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Mar 2021 16:34:14 GMT'}, {'version': 'v3', 'created': 'Tue, 22 Jun 2021 03:18:49 GMT'}, {'version': 'v4', 'created': 'Mon, 22 Nov 2021 03:51:12 GMT'}]",2021-11-23,"[['Mokrii', 'Iurii', ''], ['Boytsov', 'Leonid', ''], ['Braslavski', 'Pavel', '']]","['Neural information retrieval', 'transfer learning', 'pseudo-labeling']"
5482,1706.06376,Atif Mashkoor,Atif Mashkoor,Model-Driven Development of High-Assurance Active Medical Devices,,"Software Quality Journal, 24(3), 571-596 (2016)",10.1007/s11219-015-9288-0,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advanced medical devices exploit the advantages of embedded software whose
development is subject to compliance with stringent requirements of
standardization and certification regimes due to the critical nature of such
systems. This paper presents initial results and lessons learned from an
ongoing project focusing on the development of a formal model of a subsystem of
a software-controlled safety-critical Active Medical Device (AMD) responsible
for renal replacement therapy. The use of formal approaches for the development
of AMDs is highly recommended by standards and regulations, and motivates the
recent advancement of the state of the art of related methods and tools
including Event-B and Rodin applied in this paper. It is expected that the
presented model development approach and the specification of a high-confidence
medical system will contribute to the still sparse experience base available at
the disposal of the scientific and practitioner community of formal methods and
software engineering.
","[{'version': 'v1', 'created': 'Tue, 20 Jun 2017 11:45:14 GMT'}]",2017-06-21,"[['Mashkoor', 'Atif', '']]","['Model-driven development', 'Formal methods', 'Event-B', 'Activemedical devices', 'hemodialysis']"
5483,1903.10584,Zachariah Carmichael,"Zachariah Carmichael, Hamed F.Langroudi, Char Khazanov, Jeffrey
  Lillie, John L. Gustafson, Dhireesha Kudithipudi","Performance-Efficiency Trade-off of Low-Precision Numerical Formats in
  Deep Neural Networks","9 pages, Proceedings of the ACM Conference for Next Generation
  Arithmetic (CoNGA) 2019",,10.1145/3316279.3316282,,cs.DC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks (DNNs) have been demonstrated as effective prognostic
models across various domains, e.g. natural language processing, computer
vision, and genomics. However, modern-day DNNs demand high compute and memory
storage for executing any reasonably complex task. To optimize the inference
time and alleviate the power consumption of these networks, DNN accelerators
with low-precision representations of data and DNN parameters are being
actively studied. An interesting research question is in how low-precision
networks can be ported to edge-devices with similar performance as
high-precision networks. In this work, we employ the fixed-point, floating
point, and posit numerical formats at $\leq$8-bit precision within a DNN
accelerator, Deep Positron, with exact multiply-and-accumulate (EMAC) units for
inference. A unified analysis quantifies the trade-offs between overall network
efficiency and performance across five classification tasks. Our results
indicate that posits are a natural fit for DNN inference, outperforming at
$\leq$8-bit precision, and can be realized with competitive resource
requirements relative to those of floating point.
","[{'version': 'v1', 'created': 'Mon, 25 Mar 2019 20:21:45 GMT'}]",2019-03-27,"[['Carmichael', 'Zachariah', ''], ['Langroudi', 'Hamed F.', ''], ['Khazanov', 'Char', ''], ['Lillie', 'Jeffrey', ''], ['Gustafson', 'John L.', ''], ['Kudithipudi', 'Dhireesha', '']]","['DNN accelerators', 'posit numerical format', 'deep neural networks', 'machine learning', 'floating point', 'tapered precision', 'low-precision']"
5484,1808.09730,Vincent Lostanlen,"Vincent Lostanlen, Joakim And\'en, Mathieu Lagrange","Extended playing techniques: The next milestone in musical instrument
  recognition","10 pages, 9 figures. The source code to reproduce the experiments of
  this paper is made available at:
  https://www.github.com/mathieulagrange/dlfm2018","Proceedings of the 5th International Workshop on Digital Libraries
  for Musicology (DLfM), Paris, France, September 2018. Published by ACM's
  International Conference Proceedings Series (ICPS)",,,cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The expressive variability in producing a musical note conveys information
essential to the modeling of orchestration and style. As such, it plays a
crucial role in computer-assisted browsing of massive digital music corpora.
Yet, although the automatic recognition of a musical instrument from the
recording of a single ""ordinary"" note is considered a solved problem, automatic
identification of instrumental playing technique (IPT) remains largely
underdeveloped. We benchmark machine listening systems for query-by-example
browsing among 143 extended IPTs for 16 instruments, amounting to 469 triplets
of instrument, mute, and technique. We identify and discuss three necessary
conditions for significantly outperforming the traditional mel-frequency
cepstral coefficient (MFCC) baseline: the addition of second-order scattering
coefficients to account for amplitude modulation, the incorporation of
long-range temporal dependencies, and metric learning using large-margin
nearest neighbors (LMNN) to reduce intra-class variability. Evaluating on the
Studio On Line (SOL) dataset, we obtain a precision at rank 5 of 99.7% for
instrument recognition (baseline at 89.0%) and of 61.0% for IPT recognition
(baseline at 44.5%). We interpret this gain through a qualitative assessment of
practical usability and visualization using nonlinear dimensionality reduction.
","[{'version': 'v1', 'created': 'Wed, 29 Aug 2018 11:16:30 GMT'}]",2018-08-30,"[['Lostanlen', 'Vincent', ''], ['Andén', 'Joakim', ''], ['Lagrange', 'Mathieu', '']]","['playing technique similarity', 'musical instrument recognition', 'scattering transform', 'metric learning', 'large-margin nearest neighbors']"
5485,0911.4366,"Gwena\""el Joret","Samuel Fiorini, Gwena\""el Joret, Ugo Pietropaoli",Hitting Diamonds and Growing Cacti,v2: several minor changes.,,10.1007/978-3-642-13036-6_15,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the following NP-hard problem: in a weighted graph, find a
minimum cost set of vertices whose removal leaves a graph in which no two
cycles share an edge. We obtain a constant-factor approximation algorithm,
based on the primal-dual method. Moreover, we show that the integrality gap of
the natural LP relaxation of the problem is \Theta(\log n), where n denotes the
number of vertices in the graph.
","[{'version': 'v1', 'created': 'Mon, 23 Nov 2009 11:14:06 GMT'}, {'version': 'v2', 'created': 'Sun, 21 Mar 2010 21:03:38 GMT'}]",2015-05-14,"[['Fiorini', 'Samuel', ''], ['Joret', 'Gwenaël', ''], ['Pietropaoli', 'Ugo', '']]","['Approximation algorithm', 'primal-dual method', 'covering problem']"
5486,0902.1610,Stefano Zacchiroli,"Roberto Di Cosmo (PPS), Stefano Zacchiroli (PPS), Paulo Trezentos",Package upgrades in FOSS distributions: details and challenges,,"International Workshop On Hot Topics In Software Upgrades
  Proceedings of the 1st International Workshop on Hot Topics in Software
  Upgrades, Nashville, Tennessee : \'Etats-Unis d'Am\'erique (2008)",10.1145/1490283.1490292,,cs.SE cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The upgrade problems faced by Free and Open Source Software distributions
have characteristics not easily found elsewhere. We describe the structure of
packages and their role in the upgrade process. We show that state of the art
package managers have shortcomings inhibiting their ability to cope with
frequent upgrade failures. We survey current countermeasures to such failures,
argue that they are not satisfactory, and sketch alternative solutions.
","[{'version': 'v1', 'created': 'Tue, 10 Feb 2009 09:14:59 GMT'}]",2009-02-11,"[['Di Cosmo', 'Roberto', '', 'PPS'], ['Zacchiroli', 'Stefano', '', 'PPS'], ['Trezentos', 'Paulo', '']]","['FOSS', 'upgrade', 'packages', 'distribution', 'rollback']"
5487,1609.02974,Nima Khademi Kalantari,"Nima Khademi Kalantari, Ting-Chun Wang, Ravi Ramamoorthi",Learning-Based View Synthesis for Light Field Cameras,in ACM Transactions on Graphics 2016,,10.1145/2980179.2980251,,cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the introduction of consumer light field cameras, light field imaging
has recently become widespread. However, there is an inherent trade-off between
the angular and spatial resolution, and thus, these cameras often sparsely
sample in either spatial or angular domain. In this paper, we use machine
learning to mitigate this trade-off. Specifically, we propose a novel
learning-based approach to synthesize new views from a sparse set of input
views. We build upon existing view synthesis techniques and break down the
process into disparity and color estimation components. We use two sequential
convolutional neural networks to model these two components and train both
networks simultaneously by minimizing the error between the synthesized and
ground truth images. We show the performance of our approach using only four
corner sub-aperture views from the light fields captured by the Lytro Illum
camera. Experimental results show that our approach synthesizes high-quality
images that are superior to the state-of-the-art techniques on a variety of
challenging real-world scenes. We believe our method could potentially decrease
the required angular resolution of consumer light field cameras, which allows
their spatial resolution to increase.
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2016 23:33:38 GMT'}]",2016-09-13,"[['Kalantari', 'Nima Khademi', ''], ['Wang', 'Ting-Chun', ''], ['Ramamoorthi', 'Ravi', '']]","['view synthesis', 'light field', 'convolutional neural network', 'disparity estimation']"
5488,1903.01341,Federico Galatolo,"Federico A. Galatolo, Mario G. C. A. Cimino, Gigliola Vaglini","Using stigmergy as a computational memory in the design of recurrent
  neural networks",,,10.5220/0007581508300836,,cs.NE cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a novel architecture of Recurrent Neural Network (RNN) is
designed and experimented. The proposed RNN adopts a computational memory based
on the concept of stigmergy. The basic principle of a Stigmergic Memory (SM) is
that the activity of deposit/removal of a quantity in the SM stimulates the
next activities of deposit/removal. Accordingly, subsequent SM activities tend
to reinforce/weaken each other, generating a coherent coordination between the
SM activities and the input temporal stimulus. We show that, in a problem of
supervised classification, the SM encodes the temporal input in an emergent
representational model, by coordinating the deposit, removal and classification
activities. This study lays down a basic framework for the derivation of a
SM-RNN. A formal ontology of SM is discussed, and the SM-RNN architecture is
detailed. To appreciate the computational power of an SM-RNN, comparative NNs
have been selected and trained to solve the MNIST handwritten digits
recognition benchmark in its two variants: spatial (sequences of bitmap rows)
and temporal (sequences of pen strokes).
","[{'version': 'v1', 'created': 'Wed, 9 Jan 2019 22:26:39 GMT'}]",2019-04-30,"[['Galatolo', 'Federico A.', ''], ['Cimino', 'Mario G. C. A.', ''], ['Vaglini', 'Gigliola', '']]","['Artificial Neural Networks', 'Recurrent Neural Network', 'Stigmergy', 'Deep Learning', 'Supervised Learning']"
5489,cs/0011033,Raymond Kosala,"Raymond Kosala, Hendrik Blockeel",Web Mining Research: A Survey,15 pages,"ACM SIGKDD Explorations, 2(1):1-15, 2000",,,cs.LG cs.DB,,"  With the huge amount of information available online, the World Wide Web is a
fertile area for data mining research. The Web mining research is at the cross
road of research from several research communities, such as database,
information retrieval, and within AI, especially the sub-areas of machine
learning and natural language processing. However, there is a lot of confusions
when comparing research efforts from different point of views. In this paper,
we survey the research in the area of Web mining, point out some confusions
regarded the usage of the term Web mining and suggest three Web mining
categories. Then we situate some of the research with respect to these three
categories. We also explore the connection between the Web mining categories
and the related agent paradigm. For the survey, we focus on representation
issues, on the process, on the learning algorithm, and on the application of
the recent works as the criteria. We conclude the paper with some research
issues.
","[{'version': 'v1', 'created': 'Wed, 22 Nov 2000 09:41:53 GMT'}]",2007-05-23,"[['Kosala', 'Raymond', ''], ['Blockeel', 'Hendrik', '']]","['Web', 'data mining', 'information retrieval', 'information extraction']"
5490,1708.03157,Kai Staats,"Kai Staats, Edward Pantridge, Marco Cavaglia, Iurii Milovanov, Arun
  Aniyan",TensorFlow Enabled Genetic Programming,"8 pages, 5 figures; presented at GECCO 2017, Berlin, Germany","Proceedings of the Genetic and Evolutionary Computation Conference
  (GECCO) Companion, ACM 2017, pp. 1872-1879",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Genetic Programming, a kind of evolutionary computation and machine learning
algorithm, is shown to benefit significantly from the application of vectorized
data and the TensorFlow numerical computation library on both CPU and GPU
architectures. The open source, Python Karoo GP is employed for a series of 190
tests across 6 platforms, with real-world datasets ranging from 18 to 5.5M data
points. This body of tests demonstrates that datasets measured in tens and
hundreds of data points see 2-15x improvement when moving from the scalar/SymPy
configuration to the vector/TensorFlow configuration, with a single core
performing on par or better than multiple CPU cores and GPUs. A dataset
composed of 90,000 data points demonstrates a single vector/TensorFlow CPU core
performing 875x better than 40 scalar/Sympy CPU cores. And a dataset containing
5.5M data points sees GPU configurations out-performing CPU configurations on
average by 1.3x.
","[{'version': 'v1', 'created': 'Thu, 10 Aug 2017 10:33:42 GMT'}]",2017-08-11,"[['Staats', 'Kai', ''], ['Pantridge', 'Edward', ''], ['Cavaglia', 'Marco', ''], ['Milovanov', 'Iurii', ''], ['Aniyan', 'Arun', '']]","['genetic programming', 'evolutionary computation', 'machine learning', 'multicore', 'gpu', 'tensorfow', 'vectorized', 'parallel']"
5491,1807.04868,Suhad Faisal Behadili,"Suhad Faisal Behadili, Cyrille Bertelle, Loay E. George",Human Mobility Patterns Modelling using CDRs,,,10.5121/iju.2016.7102,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The research objectives are exploring characteristics of human mobility
patterns, subsequently modelling them mathematically depending on inter-event
time and traveled distances parameters using CDRs (Call Detailed Records). The
observations are obtained from Armada festival in France. Understanding,
modelling and simulating human mobility among urban regions is excitement
approach, due to itsimportance in rescue situations for various events either
indoor events like evacuation of buildings or outdoor ones like public
assemblies,community evacuation in casesemerged during emergency situations,
moreover serves urban planning and smart cities.
","[{'version': 'v1', 'created': 'Thu, 12 Jul 2018 23:52:05 GMT'}]",2018-07-16,"[['Behadili', 'Suhad Faisal', ''], ['Bertelle', 'Cyrille', ''], ['George', 'Loay E.', '']]","['Modelling', 'CDRs', 'Power-law Distribution', 'Inter-event time', 'Displacements  1']"
5492,1806.11526,Ho-Chun Herbert Chang,"Ho-Chun Herbert Chang, Feng Fu",Co-Diffusion of Social Contagions,"27 pages, 15 figures",,10.1088/1367-2630/aadce7,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Prior social contagion models consider the spread of either one contagion at
a time on interdependent networks or multiple contagions on single layer
networks or under assumptions of competition. We propose a new threshold model
for the diffusion of multiple contagions. Individuals are placed on a multiplex
network with a periodic lattice and a random-regular-graph layer. On these
population structures, we study the interface between two key aspects of the
diffusion process: the level of synergy between two contagions, and the rate at
which individuals become dormant after adoption. Dormancy is defined as a
looser form of immunity that models the ability to spread without resistance.
Monte Carlo simulations reveal lower synergy makes contagions more susceptible
to percolation, especially those that diffuse on lattices. Faster diffusion of
one contagion with dormancy probabilistically blocks the diffusion of the
other, in a way similar to ring vaccination. We show that within a band of
synergy, contagions on the lattices undergo bimodal or trimodal branching if
they are the slower diffusing contagion.
","[{'version': 'v1', 'created': 'Fri, 29 Jun 2018 16:42:46 GMT'}]",2018-09-13,"[['Chang', 'Ho-Chun Herbert', ''], ['Fu', 'Feng', '']]","['Co-diffusion', 'complex contagions', 'synergy', 'multiplex networks modeling']"
5493,1708.06039,Xavier Gir\'o-i-Nieto,"Delia Fernandez, Alejandro Woodward, Victor Campos, Xavier
  Giro-i-Nieto, Brendan Jou and Shih-Fu Chang",More cat than cute? Interpretable Prediction of Adjective-Noun Pairs,"Oral paper at ACM Multimedia 2017 Workshop on Multimodal
  Understanding of Social, Affective and Subjective Attributes (MUSA2)",,10.1145/3132515.3132520,,cs.CV cs.AI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing availability of affect-rich multimedia resources has bolstered
interest in understanding sentiment and emotions in and from visual content.
Adjective-noun pairs (ANP) are a popular mid-level semantic construct for
capturing affect via visually detectable concepts such as ""cute dog"" or
""beautiful landscape"". Current state-of-the-art methods approach ANP prediction
by considering each of these compound concepts as individual tokens, ignoring
the underlying relationships in ANPs. This work aims at disentangling the
contributions of the `adjectives' and `nouns' in the visual prediction of ANPs.
Two specialised classifiers, one trained for detecting adjectives and another
for nouns, are fused to predict 553 different ANPs. The resulting ANP
prediction model is more interpretable as it allows us to study contributions
of the adjective and noun components. Source code and models are available at
https://imatge-upc.github.io/affective-2017-musa2/ .
","[{'version': 'v1', 'created': 'Mon, 21 Aug 2017 00:33:05 GMT'}]",2017-08-22,"[['Fernandez', 'Delia', ''], ['Woodward', 'Alejandro', ''], ['Campos', 'Victor', ''], ['Giro-i-Nieto', 'Xavier', ''], ['Jou', 'Brendan', ''], ['Chang', 'Shih-Fu', '']]","['affective computing', 'convolutional neural networks', 'compoundconcepts', 'adjective noun pairs', 'interpretable models']"
5494,1605.06236,Harishchandra Dubey,"Admir Monteiro, Harishchandra Dubey, Leslie Mahler, Qing Yang, and
  Kunal Mankodiya",FIT A Fog Computing Device for Speech TeleTreatments,"3 pages, 5 figures, 1 table, 2nd IEEE International Conference on
  Smart Computing SMARTCOMP 2016, Missouri, USA, 2016",,10.13140/RG.2.1.1023.8328,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is an increasing demand for smart fogcomputing gateways as the size of
cloud data is growing. This paper presents a Fog computing interface (FIT) for
processing clinical speech data. FIT builds upon our previous work on EchoWear,
a wearable technology that validated the use of smartwatches for collecting
clinical speech data from patients with Parkinson's disease (PD). The fog
interface is a low-power embedded system that acts as a smart interface between
the smartwatch and the cloud. It collects, stores, and processes the speech
data before sending speech features to secure cloud storage. We developed and
validated a working prototype of FIT that enabled remote processing of clinical
speech data to get speech clinical features such as loudness, short-time
energy, zero-crossing rate, and spectral centroid. We used speech data from six
patients with PD in their homes for validating FIT. Our results showed the
efficacy of FIT as a Fog interface to translate the clinical speech processing
chain (CLIP) from a cloud-based backend to a fog-based smart gateway.
","[{'version': 'v1', 'created': 'Fri, 20 May 2016 07:51:13 GMT'}]",2016-05-23,"[['Monteiro', 'Admir', ''], ['Dubey', 'Harishchandra', ''], ['Mahler', 'Leslie', ''], ['Yang', 'Qing', ''], ['Mankodiya', 'Kunal', '']]","['Edge Computing', 'Fog Computing', 'Internet-of']"
5495,1211.0620,Majid Nezakatolhoseini,"Majid Nezakatolhoseini, Mohammad Amin Taherkhani",A Framework For Performance Evaluation Of ASIPS In Network-Based IDS,"13 pages, 3 figures, International Journal of Network Security & Its
  Applications (IJNSA), Vol.4, No.5, September 2012",,10.5121/ijnsa.2012.4504,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays efficient usage of high-tech security tools and appliances is
considered as an important criterion for security improvement of computer
networks. Based on this assumption, Intrusion Detection and Prevention Systems
(IDPS) have key role for applying the defense in depth strategy. In this
situation, by increasing network bandwidth in addition to increasing number of
threats, Network-based IDPSes have been faced with performance challenge for
processing of huge traffic in the networks. A general solution for this
bottleneck is exploitation of efficient hardware architectures for performance
improvement of IDPS. In this paper a framework for analysis and performance
evaluation of application specific instruction set processors is presented for
usage in application of attack detection in Networkbased Intrusion Detection
Systems(NIDS). By running this framework as a security application on V850,
OR1K, MIPS32, ARM7TDMI and PowerPC32 microprocessors, their performance has
been evaluated and analyzed. For performance improvement, the compiler
optimization levels are employed and at the end; base on O2 optimization level
a new combination of optimization flags is presented. The experiments show that
the framework results 18.10% performance improvements for pattern matching on
ARM7TDMI microprocessors.
","[{'version': 'v1', 'created': 'Sat, 3 Nov 2012 16:28:22 GMT'}]",2012-11-06,"[['Nezakatolhoseini', 'Majid', ''], ['Taherkhani', 'Mohammad Amin', '']]","['Intrusion Detection', 'Hardware Architecture', 'Network based IDS', 'ASIP', 'Optimization in Compiler level']"
5496,1912.02660,D\'avid K\'osz\'o,"Zolt\'an F\""ul\""op, D\'avid K\'osz\'o, Heiko Vogler",Crisp-determinization of weighted tree automata over strong bimonoids,,"Discrete Mathematics & Theoretical Computer Science, vol. 23 no.
  1, Automata, Logic and Semantics (June 15, 2021) dmtcs:7580",10.46298/dmtcs.5943,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider weighted tree automata (wta) over strong bimonoids and their
initial algebra semantics and their run semantics. There are wta for which
these semantics are different; however, for bottom-up deterministic wta and for
wta over semirings, the difference vanishes. A wta is crisp-deterministic if it
is bottom-up deterministic and each transition is weighted by one of the unit
elements of the strong bimonoid. We prove that the class of weighted tree
languages recognized by crisp-deterministic wta is the same as the class of
recognizable step mappings. Moreover, we investigate the following two
crisp-determinization problems: for a given wta ${\cal A}$, (a) does there
exist a crisp-deterministic wta which computes the initial algebra semantics of
${\cal A}$ and (b) does there exist a crisp-deterministic wta which computes
the run semantics of ${\cal A}$? We show that the finiteness of the Nerode
algebra ${\cal N}({\cal A})$ of ${\cal A}$ implies a positive answer for (a),
and that the finite order property of ${\cal A}$ implies a positive answer for
(b). We show a sufficient condition which guarantees the finiteness of ${\cal
N}({\cal A})$ and a sufficient condition which guarantees the finite order
property of ${\cal A}$. Also, we provide an algorithm for the construction of
the crisp-deterministic wta according to (a) if ${\cal N}({\cal A})$ is finite,
and similarly for (b) if ${\cal A}$ has finite order property. We prove that it
is undecidable whether an arbitrary wta ${\cal A}$ is crisp-determinizable. We
also prove that both, the finiteness of ${\cal N}({\cal A})$ and the finite
order property of ${\cal A}$ are undecidable.
","[{'version': 'v1', 'created': 'Thu, 5 Dec 2019 15:46:17 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Feb 2021 14:47:22 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Jun 2021 12:49:59 GMT'}]",2021-10-04,"[['Fülöp', 'Zoltán', ''], ['Kószó', 'Dávid', ''], ['Vogler', 'Heiko', '']]","['strong bimonoid', 'semiring', 'weighted tree automaton', 'determinization', 'undecidability']"
5497,1107.4185,Anandthirtha B Gudi,"Anandthirtha B. Gudi, H. K. Shreedhar and H. C. Nagaraj",Estimation of Severity of Speech Disability through Speech Envelope,"8 pages,4 Figures,Signal & Image Processing Journal AIRCC","Signal & Image Processing : An International Journal (SIPIJ)
  Vol.2, No.2, June 2011",10.5121/sipij.2011.2203,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, envelope detection of speech is discussed to distinguish the
pathological cases of speech disabled children. The speech signal samples of
children of age between five to eight years are considered for the present
study. These speech signals are digitized and are used to determine the speech
envelope. The envelope is subjected to ratio mean analysis to estimate the
disability. This analysis is conducted on ten speech signal samples which are
related to both place of articulation and manner of articulation. Overall
speech disability of a pathological subject is estimated based on the results
of above analysis.
","[{'version': 'v1', 'created': 'Thu, 21 Jul 2011 07:17:34 GMT'}]",2011-07-22,"[['Gudi', 'Anandthirtha B.', ''], ['Shreedhar', 'H. K.', ''], ['Nagaraj', 'H. C.', '']]","['Envelope', 'Mean Analysis', 'Pathology', 'Ratio and Speech']"
5498,1607.04805,Paris Perdikaris,"Maziar Raissi, Paris Perdikaris, George Em. Karniadakis","Inferring solutions of differential equations using noisy multi-fidelity
  data","19 pages, 3 figures",,10.1016/j.jcp.2017.01.060,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For more than two centuries, solutions of differential equations have been
obtained either analytically or numerically based on typically well-behaved
forcing and boundary conditions for well-posed problems. We are changing this
paradigm in a fundamental way by establishing an interface between
probabilistic machine learning and differential equations. We develop
data-driven algorithms for general linear equations using Gaussian process
priors tailored to the corresponding integro-differential operators. The only
observables are scarce noisy multi-fidelity data for the forcing and solution
that are not required to reside on the domain boundary. The resulting
predictive posterior distributions quantify uncertainty and naturally lead to
adaptive solution refinement via active learning. This general framework
circumvents the tyranny of numerical discretization as well as the consistency
and stability issues of time-integration, and is scalable to high-dimensions.
","[{'version': 'v1', 'created': 'Sat, 16 Jul 2016 22:12:26 GMT'}]",2017-03-08,"[['Raissi', 'Maziar', ''], ['Perdikaris', 'Paris', ''], ['Karniadakis', 'George Em.', '']]","['Machine learning', 'Integro-differential equations', 'Multi-fidelitymodeling', 'Uncertainty quantification']"
5499,1902.07304,Jacek Komorowski,"Jacek Komorowski, Grzegorz Kurzejamski, Grzegorz Sarwas",DeepBall: Deep Neural-Network Ball Detector,Conference: VISAPP 2019,"VISIGRAPP 2019 - Proceedings of the 14th International Joint
  Conference on Computer Vision, Imaging and Computer Graphics Theory and
  Applications, vol. 5, 2019, SciTePress, ISBN 978-989-758-354-4, p. 297-304",10.5220/0007348902970304,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper describes a deep network based object detector specialized for ball
detection in long shot videos. Due to its fully convolutional design, the
method operates on images of any size and produces \emph{ball confidence map}
encoding the position of detected ball. The network uses hypercolumn concept,
where feature maps from different hierarchy levels of the deep convolutional
network are combined and jointly fed to the convolutional classification layer.
This allows boosting the detection accuracy as larger visual context around the
object of interest is taken into account. The method achieves state-of-the-art
results when tested on publicly available ISSIA-CNR Soccer Dataset.
","[{'version': 'v1', 'created': 'Tue, 19 Feb 2019 21:57:48 GMT'}]",2019-08-22,"[['Komorowski', 'Jacek', ''], ['Kurzejamski', 'Grzegorz', ''], ['Sarwas', 'Grzegorz', '']]","['Ball detection', 'Neural network based object detection', 'Single stage detector']"
5500,1711.07695,Christoph Wick,"Christoph Wick, Frank Puppe","Fully Convolutional Neural Networks for Page Segmentation of Historical
  Document Images","6 pages, 7 figures, conference",,10.1109/DAS.2018.39,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a high-performance fully convolutional neural network (FCN) for
historical document segmentation that is designed to process a single page in
one step. The advantage of this model beside its speed is its ability to
directly learn from raw pixels instead of using preprocessing steps e. g.
feature computation or superpixel generation. We show that this network yields
better results than existing methods on different public data sets. For
evaluation of this model we introduce a novel metric that is independent of
ambiguous ground truth called Foreground Pixel Accuracy (FgPA). This pixel
based measure only counts foreground pixels in the binarized page, any
background pixel is omitted. The major advantage of this metric is, that it
enables researchers to compare different segmentation methods on their ability
to successfully segment text or pictures and not on their ability to learn and
possibly overfit the peculiarities of an ambiguous hand-made ground truth
segmentation.
","[{'version': 'v1', 'created': 'Tue, 21 Nov 2017 10:02:34 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Feb 2018 12:52:33 GMT'}]",2018-07-25,"[['Wick', 'Christoph', ''], ['Puppe', 'Frank', '']]","['page segmentation', 'historical document analysis', 'fully convolutional network', 'foreground pixel accuracy']"
5501,1907.11803,Omid Jafari,"Omid Jafari, John Ossorgin, Parth Nagarkar","qwLSH: Cache-conscious Indexing for Processing Similarity Search Query
  Workloads in High-Dimensional Spaces",Extended version of the published work,"In Proceedings of ICMR '19, pp. 329-333. ACM, 2019",10.1145/3323873.3325048,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Similarity search queries in high-dimensional spaces are an important type of
queries in many domains such as image processing, machine learning, etc. Since
exact similarity search indexing techniques suffer from the well-known curse of
dimensionality in high-dimensional spaces, approximate search techniques are
often utilized instead. Locality Sensitive Hashing (LSH) has been shown to be
an effective approximate search method for solving similarity search queries in
high-dimensional spaces. Often times, queries in real-world settings arrive as
part of a query workload. LSH and its variants are particularly designed to
solve single queries effectively. They suffer from one major drawback while
executing query workloads: they do not take into consideration important data
characteristics for effective cache utilization while designing the index
structures. In this paper, we present qwLSH, an index structure for efficiently
processing similarity search query workloads in high-dimensional spaces. We
intelligently divide a given cache during processing of a query workload by
using novel cost models. Experimental results show that, given a query
workload, qwLSH is able to perform faster than existing techniques due to its
unique cost models and strategies.
","[{'version': 'v1', 'created': 'Fri, 26 Jul 2019 22:17:07 GMT'}]",2019-07-30,"[['Jafari', 'Omid', ''], ['Ossorgin', 'John', ''], ['Nagarkar', 'Parth', '']]","['Nearest-neighbor Search', 'Locality Sensitive Hashing', 'High-dimensional Search']"
5502,1804.05938,Qingyao Ai,"Qingyao Ai, Keping Bi, Cheng Luo, Jiafeng Guo, W. Bruce Croft",Unbiased Learning to Rank with Unbiased Propensity Estimation,,,10.1145/3209978.3209986,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning to rank with biased click data is a well-known challenge. A variety
of methods has been explored to debias click data for learning to rank such as
click models, result interleaving and, more recently, the unbiased
learning-to-rank framework based on inverse propensity weighting. Despite their
differences, most existing studies separate the estimation of click bias
(namely the \textit{propensity model}) from the learning of ranking algorithms.
To estimate click propensities, they either conduct online result
randomization, which can negatively affect the user experience, or offline
parameter estimation, which has special requirements for click data and is
optimized for objectives (e.g. click likelihood) that are not directly related
to the ranking performance of the system. In this work, we address those
problems by unifying the learning of propensity models and ranking models. We
find that the problem of estimating a propensity model from click data is a
dual problem of unbiased learning to rank. Based on this observation, we
propose a Dual Learning Algorithm (DLA) that jointly learns an unbiased ranker
and an \textit{unbiased propensity model}. DLA is an automatic unbiased
learning-to-rank framework as it directly learns unbiased ranking models from
biased click data without any preprocessing. It can adapt to the change of bias
distributions and is applicable to online learning. Our empirical experiments
with synthetic and real-world data show that the models trained with DLA
significantly outperformed the unbiased learning-to-rank algorithms based on
result randomization and the models trained with relevance signals extracted by
click models.
","[{'version': 'v1', 'created': 'Mon, 16 Apr 2018 21:03:07 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Apr 2018 18:09:08 GMT'}]",2018-04-25,"[['Ai', 'Qingyao', ''], ['Bi', 'Keping', ''], ['Luo', 'Cheng', ''], ['Guo', 'Jiafeng', ''], ['Croft', 'W. Bruce', '']]","['Learning to rank', 'propensity estimation', 'inverse propensity weighting']"
5503,1808.06452,Jorge Samper-Gonz\'alez,"Jorge Samper-Gonz\'alez, Ninon Burgos, Simona Bottani, Sabrina
  Fontanella, Pascal Lu, Arnaud Marcoux, Alexandre Routier, J\'er\'emy Guillon,
  Michael Bacci, Junhao Wen, Anne Bertrand, Hugo Bertin, Marie-Odile Habert,
  Stanley Durrleman, Theodoros Evgeniou, Olivier Colliot (for the Alzheimer's
  Disease Neuroimaging Initiative and the Australian Imaging Biomarkers and
  Lifestyle flagship study of ageing)","Reproducible evaluation of classification methods in Alzheimer's
  disease: framework and application to MRI and PET data",,,10.1016/j.neuroimage.2018.08.042,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A large number of papers have introduced novel machine learning and feature
extraction methods for automatic classification of AD. However, they are
difficult to reproduce because key components of the validation are often not
readily available. These components include selected participants and input
data, image preprocessing and cross-validation procedures. The performance of
the different approaches is also difficult to compare objectively. In
particular, it is often difficult to assess which part of the method provides a
real improvement, if any. We propose a framework for reproducible and objective
classification experiments in AD using three publicly available datasets (ADNI,
AIBL and OASIS). The framework comprises: i) automatic conversion of the three
datasets into BIDS format, ii) a modular set of preprocessing pipelines,
feature extraction and classification methods, together with an evaluation
framework, that provide a baseline for benchmarking the different components.
We demonstrate the use of the framework for a large-scale evaluation on 1960
participants using T1 MRI and FDG PET data. In this evaluation, we assess the
influence of different modalities, preprocessing, feature types, classifiers,
training set sizes and datasets. Performances were in line with the
state-of-the-art. FDG PET outperformed T1 MRI for all classification tasks. No
difference in performance was found for the use of different atlases, image
smoothing, partial volume correction of FDG PET images, or feature type. Linear
SVM and L2-logistic regression resulted in similar performance and both
outperformed random forests. The classification performance increased along
with the number of subjects used for training. Classifiers trained on ADNI
generalized well to AIBL and OASIS. All the code of the framework and the
experiments is publicly available at:
https://gitlab.icm-institute.org/aramislab/AD-ML.
","[{'version': 'v1', 'created': 'Mon, 20 Aug 2018 13:54:03 GMT'}]",2019-08-14,"[['Samper-González', 'Jorge', '', ""for the Alzheimer's\n  Disease Neuroimaging Initiative and the Australian Imaging Biomarkers and\n  Lifestyle flagship study of ageing""], ['Burgos', 'Ninon', '', ""for the Alzheimer's\n  Disease Neuroimaging Initiative and the Australian Imaging Biomarkers and\n  Lifestyle flagship study of ageing""], ['Bottani', 'Simona', '', ""for the Alzheimer's\n  Disease Neuroimaging Initiative and the Australian Imaging Biomarkers and\n  Lifestyle flagship study of ageing""], ['Fontanella', 'Sabrina', '', ""for the Alzheimer's\n  Disease Neuroimaging Initiative and the Australian Imaging Biomarkers and\n  Lifestyle flagship study of ageing""], ['Lu', 'Pascal', '', ""for the Alzheimer's\n  Disease Neuroimaging Initiative and the Australian Imaging Biomarkers and\n  Lifestyle flagship study of ageing""], ['Marcoux', 'Arnaud', '', ""for the Alzheimer's\n  Disease Neuroimaging Initiative and the Australian Imaging Biomarkers and\n  Lifestyle flagship study of ageing""], ['Routier', 'Alexandre', '', ""for the Alzheimer's\n  Disease Neuroimaging Initiative and the Australian Imaging Biomarkers and\n  Lifestyle flagship study of ageing""], ['Guillon', 'Jérémy', '', ""for the Alzheimer's\n  Disease Neuroimaging Initiative and the Australian Imaging Biomarkers and\n  Lifestyle flagship study of ageing""], ['Bacci', 'Michael', '', ""for the Alzheimer's\n  Disease Neuroimaging Initiative and the Australian Imaging Biomarkers and\n  Lifestyle flagship study of ageing""], ['Wen', 'Junhao', '', ""for the Alzheimer's\n  Disease Neuroimaging Initiative and the Australian Imaging Biomarkers and\n  Lifestyle flagship study of ageing""], ['Bertrand', 'Anne', '', ""for the Alzheimer's\n  Disease Neuroimaging Initiative and the Australian Imaging Biomarkers and\n  Lifestyle flagship study of ageing""], ['Bertin', 'Hugo', '', ""for the Alzheimer's\n  Disease Neuroimaging Initiative and the Australian Imaging Biomarkers and\n  Lifestyle flagship study of ageing""], ['Habert', 'Marie-Odile', '', ""for the Alzheimer's\n  Disease Neuroimaging Initiative and the Australian Imaging Biomarkers and\n  Lifestyle flagship study of ageing""], ['Durrleman', 'Stanley', '', ""for the Alzheimer's\n  Disease Neuroimaging Initiative and the Australian Imaging Biomarkers and\n  Lifestyle flagship study of ageing""], ['Evgeniou', 'Theodoros', '', ""for the Alzheimer's\n  Disease Neuroimaging Initiative and the Australian Imaging Biomarkers and\n  Lifestyle flagship study of ageing""], ['Colliot', 'Olivier', '', ""for the Alzheimer's\n  Disease Neuroimaging Initiative and the Australian Imaging Biomarkers and\n  Lifestyle flagship study of ageing""]]","['classification', 'reproducibility', ""Alzheimer's disease"", 'magnetic resonance imaging', 'positron emission tomography', 'open-source']"
5504,1509.06562,Phillippe Samer,"Rafael A. Melo, Phillippe Samer, Sebasti\'an Urrutia","An effective decomposition approach and heuristics to generate spanning
  trees with a small number of branch vertices","18 pages; 5 figures; accepted for publication in Computational
  Optimization and Applications",,10.1007/s10589-016-9850-0,,cs.DM math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a graph $G=(V,E)$, the minimum branch vertices problem consists in
finding a spanning tree $T=(V,E')$ of $G$ minimizing the number of vertices
with degree greater than two. We consider a simple combinatorial lower bound
for the problem, from which we propose a decomposition approach. The motivation
is to break down the problem into several smaller subproblems which are more
tractable computationally, and then recombine the obtained solutions to
generate a solution to the original problem. We also propose effective
constructive heuristics to the problem which take into consideration the
problem's structure in order to obtain good feasible solutions. Computational
results show that our decomposition approach is very fast and can drastically
reduce the size of the subproblems to be solved. This allows a branch and cut
algorithm to perform much better than when used over the full original problem.
The results also show that the proposed constructive heuristics are highly
efficient and generate very good quality solutions, outperforming other
heuristics available in the literature in several situations.
","[{'version': 'v1', 'created': 'Tue, 22 Sep 2015 12:09:59 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Jun 2016 22:46:15 GMT'}]",2016-07-04,"[['Melo', 'Rafael A.', ''], ['Samer', 'Phillippe', ''], ['Urrutia', 'Sebastián', '']]","['minimum branch vertices', 'spanning tree', 'graph decomposition', 'heuristics', 'branch and cut', 'combinatorial optimization']"
5505,1201.2125,Suresh Kumar Mr.,"P. Suresh Kumar, P. Sateesh Kumar, S. Ramachandram",Purging of untrustworthy recommendations from a grid,"8 pages, 4 figures, 1 table published by IJNGN journal; International
  Journal of Next-Generation Networks (IJNGN) Vol.3, No.4, December 2011",,10.5121/ijngn.2011.3403,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In grid computing, trust has massive significance. There is lot of research
to propose various models in providing trusted resource sharing mechanisms. The
trust is a belief or perception that various researchers have tried to
correlate with some computational model. Trust on any entity can be direct or
indirect. Direct trust is the impact of either first impression over the entity
or acquired during some direct interaction. Indirect trust is the trust may be
due to either reputation gained or recommendations received from various
recommenders of a particular domain in a grid or any other domain outside that
grid or outside that grid itself. Unfortunately, malicious indirect trust leads
to the misuse of valuable resources of the grid. This paper proposes the
mechanism of identifying and purging the untrustworthy recommendations in the
grid environment. Through the obtained results, we show the way of purging of
untrustworthy entities.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2012 17:46:16 GMT'}]",2012-01-11,"[['Kumar', 'P. Suresh', ''], ['Kumar', 'P. Sateesh', ''], ['Ramachandram', 'S.', '']]","['Grid computing', 'trust', 'direct trust', 'indirect trust', 'untrustworthy entities']"
5506,1708.07476,Kevin Bowden,"Kevin K. Bowden, Grace I. Lin, Lena I. Reed, Marilyn A. Walker",M2D: Monolog to Dialog Generation for Conversational Story Telling,,ICIDS 2016,10.1007/978-3-319-48279-8_2,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Storytelling serves many different social functions, e.g. stories are used to
persuade, share troubles, establish shared values, learn social behaviors, and
entertain. Moreover, stories are often told conversationally through dialog,
and previous work suggests that information provided dialogically is more
engaging than when provided in monolog. In this paper, we present algorithms
for converting a deep representation of a story into a dialogic storytelling,
that can vary aspects of the telling, including the personality of the
storytellers. We conduct several experiments to test whether dialogic
storytellings are more engaging, and whether automatically generated variants
in linguistic form that correspond to personality differences can be recognized
in an extended storytelling dialog.
","[{'version': 'v1', 'created': 'Thu, 24 Aug 2017 16:06:18 GMT'}]",2018-01-08,"[['Bowden', 'Kevin K.', ''], ['Lin', 'Grace I.', ''], ['Reed', 'Lena I.', ''], ['Walker', 'Marilyn A.', '']]","['ICIDS', 'Dialog', 'Natural Language Generation', 'Personality', 'Conversational Storytelling', 'Analysis', 'Evaluation of Systems']"
5507,2008.06293,Dmitri Goldenberg,"Dmitri Goldenberg, Javier Albert, Lucas Bernardi and Pablo Estevez","Free Lunch! Retrospective Uplift Modeling for Dynamic Promotions
  Recommendation within ROI Constraints","Accepted to Fourteenth ACM Conference on Recommender Systems, Brazil,
  September, 2020","2020. In Fourteenth ACM Conference on Recommender Systems (RecSys
  '20). Association for Computing Machinery, New York, NY, USA, 486-491",10.1145/3383313.3412215,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Promotions and discounts have become key components of modern e-commerce
platforms. For online travel platforms (OTPs), popular promotions include room
upgrades, free meals and transportation services. By offering these promotions,
customers can get more value for their money, while both the OTP and its travel
partners may grow their loyal customer base. However, the promotions usually
incur a cost that, if uncontrolled, can become unsustainable. Consequently, for
a promotion to be viable, its associated costs must be balanced by incremental
revenue within set financial constraints. Personalized treatment assignment can
be used to satisfy such constraints.
  This paper introduces a novel uplift modeling technique, relying on the
Knapsack Problem formulation, that dynamically optimizes the incremental
treatment outcome subject to the required Return on Investment (ROI)
constraints. The technique leverages Retrospective Estimation, a modeling
approach that relies solely on data from positive outcome examples. The method
also addresses training data bias, long term effects, and seasonality
challenges via online-dynamic calibration. This approach was tested via offline
experiments and online randomized controlled trials at Booking .com - a leading
OTP with millions of customers worldwide, resulting in a significant increase
in the target outcome while staying within the required financial constraints
and outperforming other approaches.
","[{'version': 'v1', 'created': 'Fri, 14 Aug 2020 11:13:58 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Aug 2020 06:31:44 GMT'}]",2020-09-29,"[['Goldenberg', 'Dmitri', ''], ['Albert', 'Javier', ''], ['Bernardi', 'Lucas', ''], ['Estevez', 'Pablo', '']]","['Uplift Modeling', 'Machine Learning', 'Causal Inference', 'Benefits Recommendation', 'Implicit Feedback']"
5508,1504.02018,Md. Rafiqul Islam,Md. Rafiqul Islam and Md. Ahsan Habib,"A Data Mining Approach to Predict Prospective Business Sectors for
  Lending in Retail Banking Using Decision Tree","This paper contains 10 pages, 7 figures, 1 table and 1 algorithm. See
  more from here, http://airccse.org/journal/ijdkp/papers/5215ijdkp02.pdf and
  journal information see here http://airccse.org/journal/ijdkp/ijdkp.html
  http://www.airccse.org http://www.airccj.org","International Journal of Data Mining & Knowledge Management
  Process (IJDKP), vol. 5(2), pp. 13-22, 2015",10.5121/ijdkp.2015.5202,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A potential objective of every financial organization is to retain existing
customers and attain new prospective customers for long-term. The economic
behaviour of customer and the nature of the organization are controlled by a
prescribed form called Know Your Customer (KYC) in manual banking. Depositor
customers in some sectors (business of Jewellery/Gold, Arms, Money exchanger
etc) are with high risk; whereas in some sectors (Transport Operators,
Auto-delear, religious) are with medium risk; and in remaining sectors (Retail,
Corporate, Service, Farmer etc) belongs to low risk. Presently, credit risk for
counterparty can be broadly categorized under quantitative and qualitative
factors. Although there are many existing systems on customer retention as well
as customer attrition systems in bank, these rigorous methods suffers clear and
defined approach to disburse loan in business sector. In the paper, we have
used records of business customers of a retail commercial bank in the city
including rural and urban area of (Tangail city) Bangladesh to analyse the
major transactional determinants of customers and predicting of a model for
prospective sectors in retail bank. To achieve this, data mining approach is
adopted for analysing the challenging issues, where pruned decision tree
classification technique has been used to develop the model and finally tested
its performance with Weka result. Moreover, this paper attempts to build up a
model to predict prospective business sectors in retail banking.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2015 16:07:11 GMT'}]",2015-04-09,"[['Islam', 'Md. Rafiqul', ''], ['Habib', 'Md. Ahsan', '']]","['Data Mining', 'Decision Tree', 'Tree Pruning', 'Prospective Business Sector', 'Customer', 'Bank']"
5509,1711.06766,Eli (Omid) David,"Dror Sholomon, Eli David, Nathan S. Netanyahu","Genetic Algorithm-Based Solver for Very Large Multiple Jigsaw Puzzles of
  Unknown Dimensions and Piece Orientation",,"ACM Genetic and Evolutionary Computation Conference (GECCO), pages
  1191-1198, Vancouver, Canada, July 2014",10.1145/2576768.2598289,,cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose the first genetic algorithm (GA)-based solver for
jigsaw puzzles of unknown puzzle dimensions and unknown piece location and
orientation. Our solver uses a novel crossover technique, and sets a new
state-of-the-art in terms of the puzzle sizes solved and the accuracy obtained.
The results are significantly improved, even when compared to previous solvers
assuming known puzzle dimensions. Moreover, the solver successfully contends
with a mixed bag of multiple puzzle pieces, assembling simultaneously all
puzzles.
","[{'version': 'v1', 'created': 'Fri, 17 Nov 2017 23:17:20 GMT'}]",2017-11-21,"[['Sholomon', 'Dror', ''], ['David', 'Eli', ''], ['Netanyahu', 'Nathan S.', '']]","['Computer Vision', 'Genetic Algorithms', 'Jigsaw Puzzle', 'Recombination Operators']"
5510,1007.0642,Andreas U. Schmidt,"Andreas U. Schmidt, Andreas Leicher, Yogendra Shah, Inhyok Cha",Tree-formed Verification Data for Trusted Platforms,"15 pages, 11 figures, v3: Reference added, v4: Revised, accepted for
  publication in Computers and Security",Computers & Security 32 (2013) 19-35,10.1016/j.cose.2012.09.004,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The establishment of trust relationships to a computing platform relies on
validation processes. Validation allows an external entity to build trust in
the expected behaviour of the platform based on provided evidence of the
platform's configuration. In a process like remote attestation, the 'trusted'
platform submits verification data created during a start up process. These
data consist of hardware-protected values of platform configuration registers,
containing nested measurement values, e.g., hash values, of loaded or started
components. Commonly, the register values are created in linear order by a
hardware-secured operation. Fine-grained diagnosis of components, based on the
linear order of verification data and associated measurement logs, is not
optimal. We propose a method to use tree-formed verification data to validate a
platform. Component measurement values represent leaves, and protected
registers represent roots of a hash tree. We describe the basic mechanism of
validating a platform using tree-formed measurement logs and root registers and
show an logarithmic speed-up for the search of faults. Secure creation of a
tree is possible using a limited number of hardware-protected registers and a
single protected operation. In this way, the security of tree-formed
verification data is maintained.
","[{'version': 'v1', 'created': 'Mon, 5 Jul 2010 09:28:23 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Jul 2010 16:17:42 GMT'}, {'version': 'v3', 'created': 'Thu, 19 Aug 2010 08:35:35 GMT'}, {'version': 'v4', 'created': 'Thu, 18 Oct 2012 11:39:49 GMT'}]",2013-01-24,"[['Schmidt', 'Andreas U.', ''], ['Leicher', 'Andreas', ''], ['Shah', 'Yogendra', ''], ['Cha', 'Inhyok', '']]","['trusted platform', 'remote attestation', 'hash tree', 'measurement log', 'verification data', 'validation']"
5511,1112.3972,Serguei Mokhov,Emil Vassev and Serguei A. Mokhov,"Developing Autonomic Properties for Distributed Pattern-Recognition
  Systems with ASSL: A Distributed MARF Case Study","28 pages; 16 figures; Submitted and accepted in 2010; to appear in
  ""E. Vassev and S. A. Mokhov. Development and evaluation of autonomic
  properties for pattern-recognition systems with ASSL -- a distributed MARF
  case study. Transactions on Computational Science, Special Issue on Advances
  in Autonomic Computing: Formal Engineering Methods for Nature-Inspired
  Computing Systems, XV (LNCS7050).""","J. Trans. on Comput. Sci. XV, Springer-Verlag,130-157",10.1007/978-3-642-28525-7_5,,cs.DC cs.CV cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we discuss our research towards developing special properties
that introduce autonomic behavior in pattern-recognition systems. In our
approach we use ASSL (Autonomic System Specification Language) to formally
develop such properties for DMARF (Distributed Modular Audio Recognition
Framework). These properties enhance DMARF with an autonomic middleware that
manages the four stages of the framework's pattern-recognition pipeline. DMARF
is a biologically inspired system employing pattern recognition, signal
processing, and natural language processing helping us process audio, textual,
or imagery data needed by a variety of scientific applications, e.g., biometric
applications. In that context, the notion go autonomic DMARF (ADMARF) can be
employed by autonomous and robotic systems that theoretically require
less-to-none human intervention other than data collection for pattern analysis
and observing the results. In this article, we explain the ASSL specification
models for the autonomic properties of DMARF.
","[{'version': 'v1', 'created': 'Fri, 16 Dec 2011 21:12:17 GMT'}]",2013-07-08,"[['Vassev', 'Emil', ''], ['Mokhov', 'Serguei A.', '']]","['autonomic computing', 'formal methods', 'ASSL', 'DMARF']"
5512,1902.00953,Rayed AlGhamdi,Rayed AlGhamdi and Adel Bahadad,"Assessing the Usages of LMS at KAU and Proposing FORCE Strategy for the
  Diffusion",pp: 45-60,"JKAU: Comp. IT. Sci, 2018",10.4197/Comp.7-1.4,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since the beginning of the Saudi Arabian academic year 1435 (Sept 2014), the
web-based learning management system Blackboard has been introduced and made
available to all instructors and students for all courses at King Abdulaziz
University (KAU). The current study takes place to assess the current usages of
the Blackboard usages at KAU. The data collected from the 923 students of the
foundation year which represent about one-third of the total number of the male
students for the academic 2016-2017. Based on statistical evidence gained from
the students responses to the survey questions, 78% of the students are
inactive users of the Blackboard. The study follows up with interviewing five
instructors who teach first-year students in order to seek explanations of the
Blackboard low usages by the students. The outcomes point significant processes
at an individual level and as well as an organizational level. The Diffusion of
Innovation (DOI) was used to study the case because it is believed to be the
best explain such adoption of innovation at individual and organizational
levels. Based on the current outcomes and the author's experience in teaching a
computer course using Blackboard, a strategy called 'FORCE' is proposed for the
diffusion process.
","[{'version': 'v1', 'created': 'Sun, 3 Feb 2019 18:45:43 GMT'}]",2019-02-05,"[['AlGhamdi', 'Rayed', ''], ['Bahadad', 'Adel', '']]","['Blackboard', 'higher education', 'diffusion of innovation']"
5513,1903.02185,Suthee Ruangwises,"Suthee Ruangwises, Toshiya Itoh",Stable Noncrossing Matchings,This paper has appeared at IWOCA 2019,,10.1007/978-3-030-25005-8_33,,cs.DS cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a set of $n$ men represented by $n$ points lying on a line, and $n$
women represented by $n$ points lying on another parallel line, with each
person having a list that ranks some people of opposite gender as his/her
acceptable partners in strict order of preference. In this problem, we want to
match people of opposite genders to satisfy people's preferences as well as
making the edges not crossing one another geometrically. A noncrossing blocking
pair w.r.t. a matching $M$ is a pair $(m,w)$ of a man and a woman such that
they are not matched with each other but prefer each other to their own
partners in $M$, and the segment $(m,w)$ does not cross any edge in $M$. A
weakly stable noncrossing matching (WSNM) is a noncrossing matching that does
not admit any noncrossing blocking pair. In this paper, we prove the existence
of a WSNM in any instance by developing an $O(n^2)$ algorithm to find one in a
given instance.
","[{'version': 'v1', 'created': 'Wed, 6 Mar 2019 05:50:40 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Jul 2019 09:31:00 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Oct 2019 07:31:08 GMT'}, {'version': 'v4', 'created': 'Fri, 25 Oct 2019 08:54:56 GMT'}]",2019-10-30,"[['Ruangwises', 'Suthee', ''], ['Itoh', 'Toshiya', '']]","['stable matching', 'stable marriage problem', 'noncrossing matching', 'geometric matching']"
5514,1204.1820,Preetha K G,"K. G. Preetha, A. Unnikrishnan and K. Poulose Jacob","A probabilistic approach to reduce the route establishment overhead in
  AODV algorithm for manet","International Journal of Distributed and Parallel Systems (IJDPS)
  Vol.3, No.2, March 2012",,10.5121/ijdps.2012.3218,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile Ad-hoc Networks (MANETS) is a collection of wireless nodes without any
infrastructure support. The nodes in MANET can act as either router or source
and the control of the network is distributed among nodes. The nodes in MANETS
are highly mobile and it maintains dynamic interconnection between those mobile
nodes. MANTEs have been considered as isolated stand-alone network. This can
turn the dream of networking ""at any time and at any where"" into reality. The
main purpose of this paper is to study the issues in route discovery process in
AODV protocol for MANET. Flooding of route request message imposes major
concern in route establishment. This paper suggests a new approach to reduce
the routing overhead during the route discovery phase. By considering the
previous behaviour of the network, the new protocol reduces the unwanted
searches during route establishment process
","[{'version': 'v1', 'created': 'Mon, 9 Apr 2012 08:07:54 GMT'}]",2012-04-10,"[['Preetha', 'K. G.', ''], ['Unnikrishnan', 'A.', ''], ['Jacob', 'K. Poulose', '']]","['Wireless Network', 'Mobile Network', 'MANET', 'AODV', 'Flooding']"
5515,1208.2770,EPTCS,"Alberto Dennunzio (Universit\'a degli Studi di Milano-Bicocca,
  Dipartimento di Informatica Sistemistica e Comunicazione, Italy), Pietro Di
  Lena (Universit\'a degli Studi di Bologna, Dipartimento di Scienze
  dell'Informazione, Italy), Luciano Margara (Universit\'a degli Studi di
  Bologna, Dipartimento di Scienze dell'Informazione, Italy)",Strictly Temporally Periodic Points in Cellular Automata,"In Proceedings AUTOMATA&JAC 2012, arXiv:1208.2498","EPTCS 90, 2012, pp. 225-235",10.4204/EPTCS.90.18,,cs.FL cs.CC cs.DM nlin.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the set of strictly periodic points in surjective cellular automata,
i.e., the set of those configurations which are temporally periodic for a given
automaton but they not spatially periodic. This set turns out to be dense for
almost equicontinuous surjective cellular automata while it is empty for the
positively expansive ones. In the class of additive cellular automata, the set
of strictly periodic points can be either dense or empty. The latter happens if
and only if the cellular automaton is topologically transitive.
","[{'version': 'v1', 'created': 'Tue, 14 Aug 2012 02:02:29 GMT'}]",2012-08-15,"[['Dennunzio', 'Alberto', '', 'Universitá degli Studi di Milano-Bicocca,\n  Dipartimento di Informatica Sistemistica e Comunicazione, Italy'], ['Di Lena', 'Pietro', '', ""Universitá degli Studi di Bologna, Dipartimento di Scienze\n  dell'Informazione, Italy""], ['Margara', 'Luciano', '', ""Universitá degli Studi di\n  Bologna, Dipartimento di Scienze dell'Informazione, Italy""]]","['cellular automata', 'symbolic dynamics', 'spatially', 'temporally periodic configurations']"
5516,2209.01339,Mengqi Huang,"Mengqi Huang, Zhendong Mao, Penghui Wang, Quan Wang, Yongdong Zhang","DSE-GAN: Dynamic Semantic Evolution Generative Adversarial Network for
  Text-to-Image Generation",,ACM Multimedia 2022,10.1145/3503161.3547881,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Text-to-image generation aims at generating realistic images which are
semantically consistent with the given text. Previous works mainly adopt the
multi-stage architecture by stacking generator-discriminator pairs to engage
multiple adversarial training, where the text semantics used to provide
generation guidance remain static across all stages. This work argues that text
features at each stage should be adaptively re-composed conditioned on the
status of the historical stage (i.e., historical stage's text and image
features) to provide diversified and accurate semantic guidance during the
coarse-to-fine generation process. We thereby propose a novel Dynamical
Semantic Evolution GAN (DSE-GAN) to re-compose each stage's text features under
a novel single adversarial multi-stage architecture. Specifically, we design
(1) Dynamic Semantic Evolution (DSE) module, which first aggregates historical
image features to summarize the generative feedback, and then dynamically
selects words required to be re-composed at each stage as well as re-composed
them by dynamically enhancing or suppressing different granularity subspace's
semantics. (2) Single Adversarial Multi-stage Architecture (SAMA), which
extends the previous structure by eliminating complicated multiple adversarial
training requirements and therefore allows more stages of text-image
interactions, and finally facilitates the DSE module. We conduct comprehensive
experiments and show that DSE-GAN achieves 7.48\% and 37.8\% relative FID
improvement on two widely used benchmarks, i.e., CUB-200 and MSCOCO,
respectively.
","[{'version': 'v1', 'created': 'Sat, 3 Sep 2022 06:13:26 GMT'}]",2022-09-27,"[['Huang', 'Mengqi', ''], ['Mao', 'Zhendong', ''], ['Wang', 'Penghui', ''], ['Wang', 'Quan', ''], ['Zhang', 'Yongdong', '']]","['Text-to-Image', 'Generative Adversarial Network', 'Dynamic Network']"
5517,1609.03338,Malvin Gattinger,"Jan van Eijck, Malvin Gattinger, Yanjing Wang",Knowing Values and Public Inspection,,,10.1007/978-3-662-54069-5_7,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a basic dynamic epistemic logic of ""knowing the value"". Analogous
to public announcement in standard DEL, we study ""public inspection"", a new
dynamic operator which updates the agents' knowledge about the values of
constants. We provide a sound and strongly complete axiomatization for the
single and multi-agent case, making use of the well-known Armstrong axioms for
dependencies in databases.
","[{'version': 'v1', 'created': 'Mon, 12 Sep 2016 10:45:44 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Nov 2016 14:58:41 GMT'}]",2017-01-17,"[['van Eijck', 'Jan', ''], ['Gattinger', 'Malvin', ''], ['Wang', 'Yanjing', '']]","['Knowing what', 'Bisimulation', 'Public Announcement Logic']"
5518,1512.05974,Omar Darwish,Omar Darwish and Kurt Mehlhorn,Improved Balanced Flow Computation Using Parametric Flow,Article will appear in Information Processing Letters,,10.1016/j.ipl.2016.04.008,,cs.DS cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new algorithm for computing balanced flows in equality networks
arising in market equilibrium computations. The current best time bound for
computing balanced flows in such networks requires $O(n)$ maxflow computations,
where $n$ is the number of nodes in the network [Devanur et al. 2008]. Our
algorithm requires only a single parametric flow computation. The best
algorithm for computing parametric flows [Gallo et al. 1989] is only by a
logarithmic factor slower than the best algorithms for computing maxflows.
Hence, the running time of the algorithms in [Devanur et al. 2008] and [Duan
and Mehlhorn 2015] for computing market equilibria in linear Fisher and
Arrow-Debreu markets improve by almost a factor of $n$.
","[{'version': 'v1', 'created': 'Fri, 18 Dec 2015 14:41:01 GMT'}, {'version': 'v2', 'created': 'Fri, 13 May 2016 11:34:17 GMT'}]",2016-05-16,"[['Darwish', 'Omar', ''], ['Mehlhorn', 'Kurt', '']]","['Algorithms', 'Network Flow', 'Market Equilibrium', 'Balanced Flow', 'Parametric Flow']"
5519,1807.00938,Gibran Fuentes-Pineda,Gibran Fuentes-Pineda and Ivan Vladimir Meza-Ruiz,Topic Discovery in Massive Text Corpora Based on Min-Hashing,,,10.1016/j.eswa.2019.06.024,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The task of discovering topics in text corpora has been dominated by Latent
Dirichlet Allocation and other Topic Models for over a decade. In order to
apply these approaches to massive text corpora, the vocabulary needs to be
reduced considerably and large computer clusters and/or GPUs are typically
required. Moreover, the number of topics must be provided beforehand but this
depends on the corpus characteristics and it is often difficult to estimate,
especially for massive text corpora. Unfortunately, both topic quality and time
complexity are sensitive to this choice. This paper describes an alternative
approach to discover topics based on Min-Hashing, which can handle massive text
corpora and large vocabularies using modest computer hardware and does not
require to fix the number of topics in advance. The basic idea is to generate
multiple random partitions of the corpus vocabulary to find sets of highly
co-occurring words, which are then clustered to produce the final topics. In
contrast to probabilistic topic models where topics are distributions over the
complete vocabulary, the topics discovered by the proposed approach are sets of
highly co-occurring words. Interestingly, these topics underlie various
thematics with different levels of granularity. An extensive qualitative and
quantitative evaluation using the 20 Newsgroups (18K), Reuters (800K), Spanish
Wikipedia (1M), and English Wikipedia (5M) corpora shows that the proposed
approach is able to consistently discover meaningful and coherent topics.
Remarkably, the time complexity of the proposed approach is linear with respect
to corpus and vocabulary size; a non-parallel implementation was able to
discover topics from the entire English edition of Wikipedia with over 5
million documents and 1 million words in less than 7 hours.
","[{'version': 'v1', 'created': 'Tue, 3 Jul 2018 00:52:50 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Aug 2019 06:41:03 GMT'}]",2019-08-08,"[['Fuentes-Pineda', 'Gibran', ''], ['Meza-Ruiz', 'Ivan Vladimir', '']]","['topic discovery', 'sampled min-hashing', 'beyond-pairwise', 'co-occurringwords', 'large-scale']"
5520,1701.01639,Pece Mitrevski,Vesna Kumbaroska and Pece Mitrevski,"Behavioural - based modelling and analysis of Navigation Patterns across
  Information Networks","15 pages, 7 figures, 9 tables","Emerging Research and Solutions in ICT (ERSICT), 1(2):60-74, 2016",10.20544/ERSICT.02.16.P06,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Navigation behaviour can be considered as one of the most crucial aspects of
user behaviour in an electronic commerce environment, which is very good
indicator of user's interests either in the process of browsing or purchasing.
Revealing user navigation patterns is very helpful in finding out a way for
increasing sale, turning the most browsers into buyers, keeping costumer's
attention, loyalty, adjusting and improving the interface in order to boost the
user experience and interaction with the system. In this regard, this research
has identified the most common user navigation patterns across information
networks, illustrated through the example of an electronic bookstore. A
behavioural-based model that provides profound knowledge about the processes of
navigation is proposed, specifically examined for different types of users,
automatically identified and clustered into two clusters according to their
navigational behaviour. The developed model is based on stochastic modelling
using the concept of Generalized Stochastic Petri Nets which complex solution
relies on Continuous Time Markov Chain. As a result, calculation of several
performance measures is performed, such as: expected time spent in a transient
tangible marking, cumulative sojourn time spent in a transient tangible
marking, total number of visits in a transient tangible marking etc.
","[{'version': 'v1', 'created': 'Fri, 6 Jan 2017 14:04:36 GMT'}]",2017-01-09,"[['Kumbaroska', 'Vesna', ''], ['Mitrevski', 'Pece', '']]","['user behaviour', 'navigation behavior patterns', 'Generalized Stochastic Petri Net', 'Continuous Time Markov Chain']"
5521,1901.08783,Alberto F. Mart\'in,"Santiago Badia, Alberto F. Mart\'in, Marc Olm",Scalable solvers for complex electromagnetics problems,,,10.1016/j.finel.2019.04.003,,cs.CE cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we present scalable balancing domain decomposition by
constraints methods for linear systems arising from arbitrary order edge finite
element discretizations of multi-material and heterogeneous 3D problems. In
order to enforce the continuity across subdomains of the method, we use a
partition of the interface objects (edges and faces) into sub-objects
determined by the variation of the physical coefficients of the problem. For
multi-material problems, a constant coefficient condition is enough to define
this sub-partition of the objects. For arbitrarily heterogeneous problems, a
relaxed version of the method is defined, where we only require that the
maximal contrast of the physical coefficient in each object is smaller than a
predefined threshold. Besides, the addition of perturbation terms to the
preconditioner is empirically shown to be effective in order to deal with the
case where the two coefficients of the model problem jump simultaneously across
the interface. The new method, in contrast to existing approaches for problems
in curl-conforming spaces does not require spectral information whilst
providing robustness with regard to coefficient jumps and heterogeneous
materials. A detailed set of numerical experiments, which includes the
application of the preconditioner to 3D realistic cases, shows excellent weak
scalability properties of the implementation of the proposed algorithms.
","[{'version': 'v1', 'created': 'Fri, 25 Jan 2019 08:51:38 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Apr 2019 07:43:18 GMT'}, {'version': 'v3', 'created': 'Wed, 10 Apr 2019 16:16:53 GMT'}]",2019-05-08,"[['Badia', 'Santiago', ''], ['Martín', 'Alberto F.', ''], ['Olm', 'Marc', '']]","['Finite Element Method', 'Maxwell Equations', 'Domain Decomposition', 'Electromagnetics', 'Solvers']"
5522,1902.00804,Nikolaj Tatti,Nikolaj Tatti,Itemsets for Real-valued Datasets,,,10.1109/ICDM.2013.138,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pattern mining is one of the most well-studied subfields in exploratory data
analysis. While there is a significant amount of literature on how to discover
and rank itemsets efficiently from binary data, there is surprisingly little
research done in mining patterns from real-valued data. In this paper we
propose a family of quality scores for real-valued itemsets. We approach the
problem by considering casting the dataset into a binary data and computing the
support from this data. This naive approach requires us to select thresholds.
To remedy this, instead of selecting one set of thresholds, we treat thresholds
as random variables and compute the average support. We show that we can
compute this support efficiently, and we also introduce two normalisations,
namely comparing the support against the independence assumption and, more
generally, against the partition assumption. Our experimental evaluation
demonstrates that we can discover statistically significant patterns
efficiently.
","[{'version': 'v1', 'created': 'Sat, 2 Feb 2019 22:21:53 GMT'}]",2019-02-05,"[['Tatti', 'Nikolaj', '']]","['pattern mining', 'itemsets', 'real-valued itemsets']"
5523,1403.2990,Akanksha Tyagi,"Aditya Goyal, Akanksha Tyagi, Manisha Bhende, Swapnil Kawade",A Framework for Pricing Schemes for Networks under Complete Information,"5 pages, 6 figures, Published with International Journal of
  Engineering Trends and Technology (IJETT). arXiv admin note: text overlap
  with arXiv:1011.1065 by other authors","International Journal of Engineering Trends and Technology(IJETT),
  V9(2),69-73 March 2014",10.14445/22315381/IJETT-V9P214,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The revenue maximization problem of service provider is considered and
different pricing schemes to solve the above problem are implemented. The
service provider can choose an apt pricing scheme subjected to limited
resources, if he knows the utility function and identity of the user. The
complete price differentiation can achieve a large revenue gain but has high
implementation complexity. The partial price differentiation scheme to overcome
the high implementational complexity of complete price differentiation scheme
is also studied. A polynomial- time algorithm is designed for partial price
differentiation scheme that can compute the optimal partial differentiation
prices. The willingness of the users to pay is also considered while designing
price differentiation schemes.
","[{'version': 'v1', 'created': 'Wed, 12 Mar 2014 15:53:41 GMT'}]",2014-03-13,"[['Goyal', 'Aditya', ''], ['Tyagi', 'Akanksha', ''], ['Bhende', 'Manisha', ''], ['Kawade', 'Swapnil', '']]","['Network Pricing', 'Price Differentiation', 'Revenue Management', 'Resource Allocation']"
5524,1210.8378,Zungeru Adamu Murtala,"A. M. Zungeru, M. S. Ahmed",Development of a Dual Sensor Heat Control System,"16 pages, 10 figures, journal article","International Journal of Instrumentation and Control Systems
  (IJICS), vol. 2(4), pp. 11-26, 2012",10.5121/ijics.2012.2402,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convenience and safeguarding our home appliances have become an important
issue when dealing with an advancement and growth of an economy. This research
focuses on the design and construction of a Dual Sensor heat-monitoring system.
The circuit works by monitoring temperature from an external input and
comparing the temperature level with that of a preset temperature value. The
power output of the circuit is cut off or switched OFF or an alarm is triggered
ON if the temperature of the external input is equal to or, greater than the
preset temperature value. The methodology involves the application of linear
precision temperature sensors i.e., they generate a voltage that is directly
proportional to the temperature. Basically the system is constructed using
temperature sensors and comparators. The system is powered using a 12V power
supply. The results of the tests showed that the power output of the circuit is
switched OFF hence switching OFF the heating device or an alarm is triggered ON
when the device exceeded a preset temperature level. The general operation of
the system and performance is dependent on the temperature difference between
the preset temperature value and external temperature intended to be monitored.
The overall system was tested and found perfectly functional.
","[{'version': 'v1', 'created': 'Wed, 31 Oct 2012 16:22:03 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Nov 2012 02:47:51 GMT'}]",2012-11-07,"[['Zungeru', 'A. M.', ''], ['Ahmed', 'M. S.', '']]","['Temperature Sensor', 'Automation', 'Control System', 'Electronic Circuit', 'Heat', 'Alarm']"
5525,1201.2288,Vijay Dhir,"Vijay Dhir, Rattan K. Datta and Maitreyee Dutta",Nimble@ITCEcnoGrid: A Grid in Research Domain for Weather Forecasting,11 pages,"International Journal of Grid Computing & Applications (IJGCA)
  Vol.2, No.4, December 2011, 37-47",10.5121/ijgca.2011.2404,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer Technology has Revolutionized Science. This has motivated scientists
to develop mathematical model to simulate salient features of Physical
universe. These models can approximate reality at many levels of scale such as
atomic nucleus, Earth's biosphere & weather/climate assessment. If the computer
power is greater, the greater will be the accuracy in approximation i.e. close
will be the approximation to the reality. The speed of the computer required
for solution of such problems require computers with processing power of
teraflops to Pets flops speed.. The way to speed up the computation is to
""parallelize"" it. One of the approach is to use multimillion dollar
Supercomputer or use Computational Grid (which is also called poor man's
supercomputer) having geographically distributed resources e.g. SETI@home (Used
to detect radio waves emitted by intelligent civilizations outside earth) has
4.6 million participants computers. There are many alternatives tools available
to achieve this goal like Globus Toolkit, Entropia, Legion, BOINC etc but they
are mainly based on Linux platform. As majority of the computers available are
windows based, so it will be easy to develop a larger network of computers
which will use the free cycles of the computer to solve the complex problem at
window platform. Nimble@ITCEcnoGrid has been developed. It includes the feature
of Inter Thread Communication which is missing in any of the toolkits
available. Nimble@ITCEcnoGrid Framework (A Fast Grid with Inter-thread
communication with Economic Based Policy) was tested for computation of 'PI' up
to 120 decimal points. Encouraged by the speed the same system has been
utilized to computes the Momentum, Thermodynamics and Continuity equations for
the Weather Forecasting using the Windows based Desktop computers.
","[{'version': 'v1', 'created': 'Wed, 11 Jan 2012 12:02:39 GMT'}]",2012-01-12,"[['Dhir', 'Vijay', ''], ['Datta', 'Rattan K.', ''], ['Dutta', 'Maitreyee', '']]","['Computational Grid', 'Inter Thread', 'Momentum', 'Thermodynamic', 'Continuity', ""Machin's formula"", 'Maclaurin series']"
5526,1708.06131,Battista Biggio,"Battista Biggio, Igino Corona, Davide Maiorca, Blaine Nelson, Nedim
  Srndic, Pavel Laskov, Giorgio Giacinto, Fabio Roli",Evasion Attacks against Machine Learning at Test Time,"In this paper, in 2013, we were the first to introduce the notion of
  evasion attacks (adversarial examples) created with high confidence (instead
  of minimum-distance misclassifications), and the notion of surrogate learners
  (substitute models). These two concepts are now widely re-used in developing
  attacks against deep networks (even if not always referring to the ideas
  reported in this work). arXiv admin note: text overlap with arXiv:1401.7727","ECML PKDD, Part III, vol. 8190, LNCS, pp. 387--402. Springer, 2013",10.1007/978-3-642-40994-3_25,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In security-sensitive applications, the success of machine learning depends
on a thorough vetting of their resistance to adversarial data. In one
pertinent, well-motivated attack scenario, an adversary may attempt to evade a
deployed system at test time by carefully manipulating attack samples. In this
work, we present a simple but effective gradient-based approach that can be
exploited to systematically assess the security of several, widely-used
classification algorithms against evasion attacks. Following a recently
proposed framework for security evaluation, we simulate attack scenarios that
exhibit different risk levels for the classifier by increasing the attacker's
knowledge of the system and her ability to manipulate attack samples. This
gives the classifier designer a better picture of the classifier performance
under evasion attacks, and allows him to perform a more informed model
selection (or parameter setting). We evaluate our approach on the relevant
security task of malware detection in PDF files, and show that such systems can
be easily evaded. We also sketch some countermeasures suggested by our
analysis.
","[{'version': 'v1', 'created': 'Mon, 21 Aug 2017 09:55:37 GMT'}]",2017-08-22,"[['Biggio', 'Battista', ''], ['Corona', 'Igino', ''], ['Maiorca', 'Davide', ''], ['Nelson', 'Blaine', ''], ['Srndic', 'Nedim', ''], ['Laskov', 'Pavel', ''], ['Giacinto', 'Giorgio', ''], ['Roli', 'Fabio', '']]","['adversarial machine learning', 'evasion attacks', 'support vector machines', 'neural networks']"
5527,1801.01453,Mark Kibanov,"Mark Kibanov, Martin Becker, Juergen Mueller, Martin Atzmueller,
  Andreas Hotho, Gerd Stumme","Adaptive kNN using Expected Accuracy for Classification of Geo-Spatial
  Data",,,10.1145/3167132.3167226,,cs.CV cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The k-Nearest Neighbor (kNN) classification approach is conceptually simple -
yet widely applied since it often performs well in practical applications.
However, using a global constant k does not always provide an optimal solution,
e.g., for datasets with an irregular density distribution of data points. This
paper proposes an adaptive kNN classifier where k is chosen dynamically for
each instance (point) to be classified, such that the expected accuracy of
classification is maximized. We define the expected accuracy as the accuracy of
a set of structurally similar observations. An arbitrary similarity function
can be used to find these observations. We introduce and evaluate different
similarity functions. For the evaluation, we use five different classification
tasks based on geo-spatial data. Each classification task consists of (tens of)
thousands of items. We demonstrate, that the presented expected accuracy
measures can be a good estimator for kNN performance, and the proposed adaptive
kNN classifier outperforms common kNN and previously introduced adaptive kNN
algorithms. Also, we show that the range of considered k can be significantly
reduced to speed up the algorithm without negative influence on classification
accuracy.
","[{'version': 'v1', 'created': 'Thu, 14 Dec 2017 14:09:06 GMT'}]",2018-01-08,"[['Kibanov', 'Mark', ''], ['Becker', 'Martin', ''], ['Mueller', 'Juergen', ''], ['Atzmueller', 'Martin', ''], ['Hotho', 'Andreas', ''], ['Stumme', 'Gerd', '']]","['Classification', 'kNN', 'Geo-spatial Data', 'Adaptive Algorithms']"
5528,1808.01075,Zhi Li,"Zhi Li, Hongke Zhao, Qi Liu, Zhenya Huang, Tao Mei, Enhong Chen","Learning from History and Present: Next-item Recommendation via
  Discriminatively Exploiting User Behaviors","10 pages, 7 figures, KDD 2018",,10.1145/3219819.3220014,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the modern e-commerce, the behaviors of customers contain rich
information, e.g., consumption habits, the dynamics of preferences. Recently,
session-based recommendations are becoming popular to explore the temporal
characteristics of customers' interactive behaviors. However, existing works
mainly exploit the short-term behaviors without fully taking the customers'
long-term stable preferences and evolutions into account. In this paper, we
propose a novel Behavior-Intensive Neural Network (BINN) for next-item
recommendation by incorporating both users' historical stable preferences and
present consumption motivations. Specifically, BINN contains two main
components, i.e., Neural Item Embedding, and Discriminative Behaviors Learning.
Firstly, a novel item embedding method based on user interactions is developed
for obtaining an unified representation for each item. Then, with the embedded
items and the interactive behaviors over item sequences, BINN discriminatively
learns the historical preferences and present motivations of the target users.
Thus, BINN could better perform recommendations of the next items for the
target users. Finally, for evaluating the performances of BINN, we conduct
extensive experiments on two real-world datasets, i.e., Tianchi and JD. The
experimental results clearly demonstrate the effectiveness of BINN compared
with several state-of-the-art methods.
","[{'version': 'v1', 'created': 'Fri, 3 Aug 2018 03:16:49 GMT'}]",2018-08-06,"[['Li', 'Zhi', ''], ['Zhao', 'Hongke', ''], ['Liu', 'Qi', ''], ['Huang', 'Zhenya', ''], ['Mei', 'Tao', ''], ['Chen', 'Enhong', '']]","['Next-item Recommendation', 'Sequential Behaviors', 'Item Embedding', 'Recurrent Neural Networks']"
5529,1512.00070,Syed (Shawon) Rahman,DJ Neal and Shawon Rahman,Video Surveillance in the Cloud?,,,10.5121/ijcis.2012.2301,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A high-resolution video surveillance management system incurs huge amounts of
storage and network bandwidth. The current infrastructure required to support a
high resolution video surveillance management system (VMS) is expensive and
time consuming to plan, implement and maintain. With the recent advances in
cloud technologies, opportunity for the utilization of virtualization and the
opportunity for distributed computing techniques of cloud storage have been
pursued on the basis to find out if the various cloud computing services that
are available can support the current requirements to a high resolution video
surveillance management system. The research concludes, after investigating and
comparing various Software as a Service (SaaS), Platform as a Service (PaaS),
and Infrastructure as a Service (IaaS) cloud computing provides what is
possible to architect a VMS using cloud technologies; however, it is more
expensive and it will require additional reviews for legal implications, as
well as emerging threats and countermeasures associated with using cloud
technologies for a video surveillance management system
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2015 22:24:33 GMT'}]",2015-12-02,"[['Neal', 'DJ', ''], ['Rahman', 'Shawon', '']]","['Video Surveillance', 'Cloud-Computing', 'IP-Camera', 'SPI Model', 'Cloud storage', 'virtualization']"
5530,1707.04439,David Stuart Dr,"Mercedes Echeverria, David Stuart, Tobias Blanke","Medical Theses and Derivative Articles: Dissemination Of Contents and
  Publication Patterns",,Scientometrics (2015) 102: 559,10.1007/s11192-014-1442-0,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Doctoral theses are an important source of publication in universities,
although little research has been carried out on the publications resulting
from theses, on so-called derivative articles. This study investigates how
derivative articles can be identified through a text analysis based on the
full-text of a set of medical theses and the full-text of articles, with which
they shared authorship. The text similarity analysis methodology applied
consisted in exploiting the full-text articles according to organization of
scientific discourse (IMRaD) using the TurnItIn plagiarism tool. The study
found that the text similarity rate in the Discussion section can be used to
discriminate derivative articles from non-derivative articles. Additional
findings were: the first position of the thesis's author dominated in 85% of
derivative articles, the participation of supervisors as coauthors occurred in
100% of derivative articles, the authorship credit retained by the thesis's
author was 42% in derivative articles, the number of coauthors by article was 5
in derivative articles versus 6.4 coauthors, as average, in non-derivative
articles and the time differential regarding the year of thesis completion
showed that 87.5% of derivative articles were published before or in the same
year of thesis completion.
","[{'version': 'v1', 'created': 'Fri, 14 Jul 2017 10:07:46 GMT'}]",2017-07-17,"[['Echeverria', 'Mercedes', ''], ['Stuart', 'David', ''], ['Blanke', 'Tobias', '']]","['Derivative articles', 'cluster analysis methodology', 'medical theses', 'coauthorship', 'theses supervisors']"
5531,1207.2607,Prasun Chowdhury,"Prasun Chowdhury, Anindita Kundu, Iti Saha Misra, Salil K Sanyal","Load Balancing with Reduced Unnecessary Handoff in Energy Efficient
  Macro/Femto-cell based BWA Networks",14 pages,"International Journal of Wireless & Mobile Networks (IJWMN) Vol.
  4, No. 3, June 2012",10.5121/ijwmn.2012.4307,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The hierarchical macro/femto cell based BWA networks are observed to be quite
promising for mobile operators as it improves their network coverage and
capacity at the outskirt of the macro cell. However, this new technology
introduces increased number of macro/femto handoff and wastage of electrical
energy which in turn may affect the system performance. Users moving with high
velocity or undergoing real-time transmission suffers degraded performance due
to huge number of unnecessary macro/femto handoff. On the other hand, huge
amount of electrical energy is wasted when a femto BS is active in the network
but remains unutilized due to low network load. Our proposed energy efficient
handoff decision algorithm eliminates the unnecessary handoff while balancing
the load of the macro and femto cells at minimal energy consumption. The
performance of the proposed algorithm is analyzed using Continuous Time Markov
Chain (CTMC) Model. In addition, we have also contributed a method to determine
the balanced threshold level of the received signal strength (RSS) from macro
base station (BS). The balanced threshold level provides equal load
distribution of the mobile users to the macro and femto BSs. The balanced
threshold level is evaluated based on the distant location of the femto cells
for small scaled networks. Numerical analysis shows that threshold level above
the balanced threshold results in higher load distribution of the mobile users
to the femto BSs.
","[{'version': 'v1', 'created': 'Wed, 11 Jul 2012 12:10:38 GMT'}]",2012-07-12,"[['Chowdhury', 'Prasun', ''], ['Kundu', 'Anindita', ''], ['Misra', 'Iti Saha', ''], ['Sanyal', 'Salil K', '']]","['Hierarchical BWA Networks', 'Handoff; Continuous Time Markov Chain', 'QoS Management', 'Load Balancing', 'Energy Efficient Femto BS']"
5532,1509.01951,Atul Katole,"Atul Laxman Katole, Krishna Prasad Yellapragada, Amish Kumar Bedi,
  Sehaj Singh Kalra and Mynepalli Siva Chaitanya",Hierarchical Deep Learning Architecture For 10K Objects Classification,"As appeared in proceedings for CS & IT 2015 - Second International
  Conference on Computer Science & Engineering (CSEN 2015)",Computer Science & Information Technology (CS & IT) (2015) 77-93,10.5121/csit.2015.51408,,cs.CV cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evolution of visual object recognition architectures based on Convolutional
Neural Networks & Convolutional Deep Belief Networks paradigms has
revolutionized artificial Vision Science. These architectures extract & learn
the real world hierarchical visual features utilizing supervised & unsupervised
learning approaches respectively. Both the approaches yet cannot scale up
realistically to provide recognition for a very large number of objects as high
as 10K. We propose a two level hierarchical deep learning architecture inspired
by divide & conquer principle that decomposes the large scale recognition
architecture into root & leaf level model architectures. Each of the root &
leaf level models is trained exclusively to provide superior results than
possible by any 1-level deep learning architecture prevalent today. The
proposed architecture classifies objects in two steps. In the first step the
root level model classifies the object in a high level category. In the second
step, the leaf level recognition model for the recognized high level category
is selected among all the leaf models. This leaf level model is presented with
the same input object image which classifies it in a specific category. Also we
propose a blend of leaf level models trained with either supervised or
unsupervised learning approaches. Unsupervised learning is suitable whenever
labelled data is scarce for the specific leaf level models. Currently the
training of leaf level models is in progress; where we have trained 25 out of
the total 47 leaf level models as of now. We have trained the leaf models with
the best case top-5 error rate of 3.2% on the validation data set for the
particular leaf models. Also we demonstrate that the validation error of the
leaf level models saturates towards the above mentioned accuracy as the number
of epochs are increased to more than sixty.
","[{'version': 'v1', 'created': 'Mon, 7 Sep 2015 08:49:39 GMT'}]",2015-09-08,"[['Katole', 'Atul Laxman', ''], ['Yellapragada', 'Krishna Prasad', ''], ['Bedi', 'Amish Kumar', ''], ['Kalra', 'Sehaj Singh', ''], ['Chaitanya', 'Mynepalli Siva', '']]","['Convolutional Neural Network [CNN]', 'Convolutional Deep Belief Network [CDBN]', 'Supervised & Unsupervised training']"
5533,1911.09242,Son Doan <,"Son Doan, Amanda Ritchart, Nicholas Perry, Juan D Chaparro, Mike
  Conway","How Do You #relax When You're #stressed? A Content Analysis and
  Infodemiology Study of Stress-Related Tweets","38 pages,12 figures, 6 tables, 5 Appendix (full version) -- shorter
  version published in JMIR Public Health Surveill 2017;3(2):e35",JMIR Public Health Surveill 2017;3(2):e35,10.2196/publichealth.5939,,cs.CL cs.AI cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Background: Stress is a contributing factor to many major health problems in
the United States, such as heart disease, depression, and autoimmune diseases.
Relaxation is often recommended in mental health treatment as a frontline
strategy to reduce stress, thereby improving health conditions.
  Objective: The objective of our study was to understand how people express
their feelings of stress and relaxation through Twitter messages.
  Methods: We first performed a qualitative content analysis of 1326 and 781
tweets containing the keywords ""stress"" and ""relax"", respectively. We then
investigated the use of machine learning algorithms to automatically classify
tweets as stress versus non stress and relaxation versus non relaxation.
Finally, we applied these classifiers to sample datasets drawn from 4 cities
with the goal of evaluating the extent of any correlation between our automatic
classification of tweets and results from public stress surveys.
  Results: Content analysis showed that the most frequent topic of stress
tweets was education, followed by work and social relationships. The most
frequent topic of relaxation tweets was rest and vacation, followed by nature
and water. When we applied the classifiers to the cities dataset, the
proportion of stress tweets in New York and San Diego was substantially higher
than that in Los Angeles and San Francisco.
  Conclusions: This content analysis and infodemiology study revealed that
Twitter, when used in conjunction with natural language processing techniques,
is a useful data source for understanding stress and stress management
strategies, and can potentially supplement infrequently collected survey-based
stress data.
","[{'version': 'v1', 'created': 'Thu, 21 Nov 2019 02:08:14 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Nov 2019 19:06:20 GMT'}]",2019-12-05,"[['Doan', 'Son', ''], ['Ritchart', 'Amanda', ''], ['Perry', 'Nicholas', ''], ['Chaparro', 'Juan D', ''], ['Conway', 'Mike', '']]","['social media', 'Twitter', 'stress', 'relaxation', 'natural language processing', 'machine learning']"
5534,1711.06356,Ehsan Hemmati,"Mansour Sheikhan, Reza Shahnazi, Ehasn Hemmati","Adaptive active queue management controller for TCP communication
  networks using PSO-RBF models",arXiv admin note: text overlap with arXiv:1711.06317,"Neural Computing and Applications, Volume 22, Issue 5, Pages
  933-94, 2012",10.1007/s00521-011-0786-0,,cs.NI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Addressing performance degradations in end-to-end congestion control has been
one of the most active research areas in the last decade. Active queue
management (AQM) aims to improve the overall network throughput, while
providing lower delay and reduce packet loss and improving network. The basic
idea is to actively trigger packet dropping (or marking provided by explicit
congestion notification (ECN)) before buffer overflow. Radial bias function
(RBF)-based AQM controller is proposed in this paper. RBF controller is
suitable as an AQM scheme to control congestion in TCP communication networks
since it is nonlinear. Particle swarm optimization (PSO) algorithm is also
employed to derive RBF parameters such that the integrated-absolute error (IAE)
is minimized. Furthermore, in order to improve the robustness of RBF
controller, an error-integral term is added to RBF equation. The results of the
comparison with Drop Tail, adaptive random early detection (ARED), random
exponential marking (REM), and proportional-integral (PI) controllers are
presented. Integral-RBF has better performance not only in comparison with RBF
but also with ARED, REM and PI controllers in the case of link utilization
while packet loss rate is small.
","[{'version': 'v1', 'created': 'Thu, 16 Nov 2017 23:46:16 GMT'}]",2017-11-20,"[['Sheikhan', 'Mansour', ''], ['Shahnazi', 'Reza', ''], ['Hemmati', 'Ehasn', '']]","['Active queue management', 'RBF neural network', 'PSO algorithm']"
5535,1405.7011,Daniel Severin Dr.,Isabel M\'endez-D\'iaz and Graciela Nasini and Daniel Sever\'in,An exact DSatur-based algorithm for the Equitable Coloring Problem,,"Electronic Notes in Discrete Mathematics. Volume 44 (2013), p.
  281--286",10.1016/j.endm.2013.10.044,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes an exact algorithm for the Equitable Coloring Problem,
based on the well known DSatur algorithm for the classic Coloring Problem with
new pruning rules specifically derived from the equity constraint.
Computational experiences show that our algorithm is competitive with those
known in literature.
","[{'version': 'v1', 'created': 'Tue, 27 May 2014 18:59:54 GMT'}]",2014-05-28,"[['Méndez-Díaz', 'Isabel', ''], ['Nasini', 'Graciela', ''], ['Severín', 'Daniel', '']]","['equitable coloring', 'DSatur', 'exact algorithm']"
5536,1004.0514,Sisir Koppaka,Sisir Koppaka and Ashish Ranjan Hota,"Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard
  Walks","2 pages, 2 figures, 1 table, late-breaking","In Proceedings of the 12th annual conference companion on Genetic
  and evolutionary computation (GECCO '10). ACM, New York, NY, USA, 2093-2094",10.1145/1830761.1830878,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper extends the analogies employed in the development of
quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard
walks, called QHW. A novel quantum-inspired evolutionary algorithm, called
HQEA, for solving combinatorial optimization problems, is also proposed. The
novelty of HQEA lies in it's incorporation of QHW Remote Search and QHW Local
Search - the quantum equivalents of classical mutation and local search, that
this paper defines. The intuitive reasoning behind this approach, and the
exploration-exploitation balance thus occurring is explained. From the results
of the experiments carried out on the 0,1-knapsack problem, HQEA performs
significantly better than a conventional genetic algorithm, CGA, and two
quantum-inspired evolutionary algorithms - QEA and NQEA, in terms of
convergence speed and accuracy.
","[{'version': 'v1', 'created': 'Sun, 4 Apr 2010 15:38:48 GMT'}]",2011-05-17,"[['Koppaka', 'Sisir', ''], ['Hota', 'Ashish Ranjan', '']]","['Evolutionary Algorithms', 'Quantum Computing', 'RandomWalks', 'Combinatorial Optimization', 'Knapsack Problem', 'LateBreaking Abstract']"
5537,2212.06220,Jessie J. Smith,"Jessie J. Smith, Blakeley H. Payne, Shamika Klassen, Dylan Thomas
  Doyle, Casey Fiesler",Incorporating Ethics in Computing Courses: Perspectives from Educators,,"Proceedings of the 54th ACM Technical Symposium on Computing
  Science Education V. 1 March 15--18, 2023. Toronto, ON, Canada",10.1145/3545945.3569855,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Incorporating ethics into computing education has become a priority for the
SIGCSE community. Many computing departments and educators have contributed to
this endeavor by creating standalone computing ethics courses or integrating
ethics modules and discussions into preexisting curricula. In this study, we
hope to support this effort by reporting on computing educators' attitudes
toward including ethics in their computing classroom, with a special focus on
the structures that hinder or help this endeavor. We surveyed 138 higher
education computing instructors to understand their attitudes toward including
ethics in their classes, what barriers might be preventing them from doing so,
and which structures best support them. We found that even though instructors
were generally positive about ethics as a component of computing education,
there are specific barriers preventing ethics from being included in some
computing courses. In this work, we explore how to alleviate these barriers and
outline support structures that could encourage further integration of ethics
and computing in higher education.
","[{'version': 'v1', 'created': 'Mon, 12 Dec 2022 20:05:43 GMT'}]",2022-12-14,"[['Smith', 'Jessie J.', ''], ['Payne', 'Blakeley H.', ''], ['Klassen', 'Shamika', ''], ['Doyle', 'Dylan Thomas', ''], ['Fiesler', 'Casey', '']]","['Ethics', 'Post-Secondary', 'Curriculum', 'Perspectives', 'Survey']"
5538,1212.4935,Shahkar Tramboo,"Shahkar Tramboo, Humma, S M Shafi, Sumeer Gul","A Study on the Open Source Digital Library Software's: Special Reference
  to DSpace, EPrints and Greenstone","9 Pages, 3 Figures, 1 Table, ""Published with International Journal of
  Computer Applications (IJCA)""","Article: A study on the Open Source Digital Library Softwares:
  Special Reference to DSpace, EPrints and Greenstone. International Journal of
  Computer Applications 59(16):1-9, December 2012. Published by Foundation of
  Computer Science,USA",10.5120/9629-4272,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The richness in knowledge has changed access methods for all stake holders in
retrieving key knowledge and relevant information. This paper presents a study
of three open source digital library management software used to assimilate and
disseminate information to world audience. The methodology followed involves
online survey and study of related software documentation and associated
technical manuals.
","[{'version': 'v1', 'created': 'Thu, 20 Dec 2012 06:44:42 GMT'}]",2012-12-21,"[['Tramboo', 'Shahkar', ''], ['Humma', '', ''], ['Shafi', 'S M', ''], ['Gul', 'Sumeer', '']]","['Open source', 'Digital Library', 'Digital Library Management Software', 'Information Dissemination']"
5539,1604.00547,Hoang X. Nguyen,"Hoang X. Nguyen, Tuan N. Nguyen, M. Abdel-Wahab, S.P.A. Bordas, H.
  Nguyen-Xuan, Thuc P. Vo","Isogeometric analysis for functionally graded microplates based on
  modified couple stress theory","57 pages, 14 figures, 18 tables",,10.1016/j.cma.2016.10.002,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Analysis of static bending, free vibration and buckling behaviours of
functionally graded microplates is investigated in this study. The main idea is
to use the isogeometric analysis in associated with novel four-variable refined
plate theory and quasi-3D theory. More importantly, the modified couple stress
theory with only one material length scale parameter is employed to effectively
capture the size-dependent effects within the microplates. Meanwhile, the
quasi-3D theory which is constructed from a novel seventh-order shear
deformation refined plate theory with four unknowns is able to consider both
shear deformations and thickness stretching effect without requiring shear
correction factors. The NURBS-based isogeometric analysis is integrated to
exactly describe the geometry and approximately calculate the unknown fields
with higher-order derivative and continuity requirements. The convergence and
verification show the validity and efficiency of this proposed computational
approach in comparison with those existing in the literature. It is further
applied to study the static bending, free vibration and buckling responses of
rectangular and circular functionally graded microplates with various types of
boundary conditions. A number of investigations are also conducted to
illustrate the effects of the material length scale, material index, and
length-to-thickness ratios on the responses of the microplates.
","[{'version': 'v1', 'created': 'Sat, 2 Apr 2016 19:33:15 GMT'}]",2016-12-21,"[['Nguyen', 'Hoang X.', ''], ['Nguyen', 'Tuan N.', ''], ['Abdel-Wahab', 'M.', ''], ['Bordas', 'S. P. A.', ''], ['Nguyen-Xuan', 'H.', ''], ['Vo', 'Thuc P.', '']]","['Functionally graded microplates', 'Modified couple stress theory', 'Refined platetheory', 'Quasi-3D theory', 'Isogemetric analysis']"
5540,2102.11828,Sergey Goncharov,Sergey Goncharov,Uniform Elgot Iteration in Foundations,Full version of ICALP 2021 accepted paper,,10.4230/LIPIcs.ICALP.2021.131,,cs.LO,http://creativecommons.org/licenses/by-sa/4.0/,"  Category theory is famous for its innovative way of thinking of concepts by
their descriptions, in particular by establishing universal properties.
Concepts that can be characterized in a universal way receive a certain quality
seal, which makes them easily transferable across application domains. The
notion of partiality is however notoriously difficult to characterize in this
way, although the importance of it is certain, especially for computer science
where entire research areas, such as synthetic and axiomatic domain theory
revolve around notions of partiality. More recently, this issue resurfaced in
the context of (constructive) intensional type theory. Here, we provide a
generic categorical iteration-based notion of partiality, which is arguably the
most basic one. We show that the emerging free structures, which we dub
uniform-iteration algebras enjoy various desirable properties, in particular,
yield an equational lifting monad. We then study the impact of classicality
assumptions and choice principles on this monad, in particular, we establish a
suitable categorial formulation of the axiom of countable choice entailing that
the monad is an Elgot monad.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2021 18:00:32 GMT'}, {'version': 'v2', 'created': 'Sat, 3 Jul 2021 19:31:54 GMT'}]",2021-07-06,"[['Goncharov', 'Sergey', '']]","['Elgot monad', 'partiality monad', 'delay monad', 'restriction category']"
5541,1806.08467,Henrique Ferraz de Arruda,"Henrique F. de Arruda, Vanessa Q. Marinho, Luciano da F. Costa, Diego
  R. Amancio","Paragraph-based complex networks: application to document classification
  and authenticity verification",,"Information Processing & Management 56 (3) 479-494, 2019",10.1016/j.ipm.2018.12.008,,cs.CL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the increasing number of texts made available on the Internet, many
applications have relied on text mining tools to tackle a diversity of
problems. A relevant model to represent texts is the so-called word adjacency
(co-occurrence) representation, which is known to capture mainly syntactical
features of texts.In this study, we introduce a novel network representation
that considers the semantic similarity between paragraphs. Two main properties
of paragraph networks are considered: (i) their ability to incorporate
characteristics that can discriminate real from artificial, shuffled
manuscripts and (ii) their ability to capture syntactical and semantic textual
features. Our results revealed that real texts are organized into communities,
which turned out to be an important feature for discriminating them from
artificial texts. Interestingly, we have also found that, differently from
traditional co-occurrence networks, the adopted representation is able to
capture semantic features. Additionally, the proposed framework was employed to
analyze the Voynich manuscript, which was found to be compatible with texts
written in natural languages. Taken together, our findings suggest that the
proposed methodology can be combined with traditional network models to improve
text classification tasks.
","[{'version': 'v1', 'created': 'Fri, 22 Jun 2018 01:58:44 GMT'}]",2019-02-25,"[['de Arruda', 'Henrique F.', ''], ['Marinho', 'Vanessa Q.', ''], ['Costa', 'Luciano da F.', ''], ['Amancio', 'Diego R.', '']]","['network science', 'complex networks', 'language networks', 'document classification', 'text networks']"
5542,1809.10895,Laurent Orgogozo,"L. Orgogozo (GET), N. Renon (CALMIP), C. Soulaine (IMFT), F. H\'enon
  (IMFT), S. K. Tomer (CESBIO), D. Labat (GET), O.S. Pokrovsky (GET), M.
  Sekhar, R. Ababou (IMFT), M. Quintard (IMFT)","An open source massively parallel solver for Richards equation:
  Mechanistic modelling of water fluxes at the watershed scale",,"Computer Physics Communications, Elsevier, 2014, 185 (12),
  pp.3358-3371",10.1016/j.cpc.2014.08.004,,cs.CE cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a massively parallel open source solver for Richards
equation, named the RichardsFOAM solver. This solver has been developed in the
framework of the open source generalist computational fluid dynamics tool box
OpenFOAM (R) and is capable to deal with large scale problems in both space and
time. The source code for RichardsFOAM may be downloaded from the CPC program
library website.It exhibits good parallel performances (up to $\sim$90%
parallel efficiency with 1024 processors both in strong and weak scaling), and
the conditions required for obtaining such performances are analysed and
discussed. These performances enable the mechanistic modelling of water fluxes
at the scale of experimental watersheds (up to few square kilometres of surface
area), and on time scales of decades to a century. Such a solver can be useful
in various applications, such as environmental engineering for long term
transport of pollutants in soils, water engineering for assessing the impact of
land settlement on water resources, or in the study of weathering processes on
the watersheds.
","[{'version': 'v1', 'created': 'Fri, 28 Sep 2018 07:36:52 GMT'}]",2018-10-01,"[['Orgogozo', 'L.', '', 'GET'], ['Renon', 'N.', '', 'CALMIP'], ['Soulaine', 'C.', '', 'IMFT'], ['Hénon', 'F.', '', 'IMFT'], ['Tomer', 'S. K.', '', 'CESBIO'], ['Labat', 'D.', '', 'GET'], ['Pokrovsky', 'O. S.', '', 'GET'], ['Sekhar', 'M.', '', 'IMFT'], ['Ababou', 'R.', '', 'IMFT'], ['Quintard', 'M.', '', 'IMFT']]","['Variably saturated flow', 'Richards equation', 'OpenFOAM®', 'massively parallel']"
5543,1305.3253,Ketul Sheth,"Ketul Sheth, Shreya Shah, Darshan Shah and Anuja Odhekar",Social Network for Smart Devices using Embedded Ethernet,"15 pages, 8 figures, Submitted to: 'Computer Science and Engineering:
  An International Journal', Currently we are working on further enhancing the
  website to give the appearance of a social networking website","Computer Science & Engineering: An International Journal (CSEIJ),
  Vol. 3, No. 2, April 2013, Pg no. 41-55",10.5121/cseij.2013.3204,,cs.NI cs.SI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Embedded Ethernet is nothing but a microcontroller which is able to
communicate with the network. A design of AVR controller-based embedded
Ethernet interface is presented. In the design, an existing SPI serial device
can be converted into a network interface peripheral to obtain compatibility
with the network. By typing the IP-address of LAN on the web browser, the user
gets a web page on screen; this page contains all the information about the
status of the devices. The user can also control the devices interfaced to the
web server by pressing buttons provided in the web page. This creates a network
for easy communication among the devices.
","[{'version': 'v1', 'created': 'Tue, 14 May 2013 18:54:54 GMT'}]",2013-05-15,"[['Sheth', 'Ketul', ''], ['Shah', 'Shreya', ''], ['Shah', 'Darshan', ''], ['Odhekar', 'Anuja', '']]","['Embedded Ethernet', 'AVR controller', 'SPI', 'Web server']"
5544,1903.02230,Chao-Chun Hsu,"Chao-Chun Hsu and Yu-Hua Chen and Zi-Yuan Chen, Hsin-Yu Lin, Ting-Hao
  'Kenneth' Huang, Lun-Wei Ku",Dixit: Interactive Visual Storytelling via Term Manipulation,"WWW'19 Demo, demo video: https://www.youtube.com/watch?v=CUu1MOwnveI",,10.1145/3308558.3314131,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce Dixit, an interactive visual storytelling system
that the user interacts with iteratively to compose a short story for a photo
sequence. The user initiates the process by uploading a sequence of photos.
Dixit first extracts text terms from each photo which describe the objects
(e.g., boy, bike) or actions (e.g., sleep) in the photo, and then allows the
user to add new terms or remove existing terms. Dixit then generates a short
story based on these terms. Behind the scenes, Dixit uses an LSTM-based model
trained on image caption data and FrameNet to distill terms from each image and
utilizes a transformer decoder to compose a context-coherent story. Users
change images or terms iteratively with Dixit to create the most ideal story.
Dixit also allows users to manually edit and rate stories. The proposed
procedure opens up possibilities for interpretable and controllable visual
storytelling, allowing users to understand the story formation rationale and to
intervene in the generation process.
","[{'version': 'v1', 'created': 'Wed, 6 Mar 2019 08:08:01 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Mar 2019 06:03:56 GMT'}, {'version': 'v3', 'created': 'Fri, 31 May 2019 05:57:15 GMT'}]",2019-06-03,"[['Hsu', 'Chao-Chun', ''], ['Chen', 'Yu-Hua', ''], ['Chen', 'Zi-Yuan', ''], ['Lin', 'Hsin-Yu', ''], ['Huang', ""Ting-Hao 'Kenneth'"", ''], ['Ku', 'Lun-Wei', '']]","['Interactive System', 'Visual Storytelling', 'Web Application']"
5545,1501.01301,David Delahaye,"M\'elanie Jacquel, Karim Berkani, David Delahaye (CEDRIC, CNAM Paris,
  INRIA), Catherine Dubois (CEDRIC, INRIA, ENSIIE)",Tableaux Modulo Theories Using Superdeduction,arXiv admin note: substantial text overlap with arXiv:1501.01170,"Global Journal of Advanced Software Engineering (GJASE), Avanti
  Publishers, 2014, 1, pp.1 - 13",10.1007/978-3-642-31365-3_26,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a method that allows us to develop tableaux modulo theories using
the principles of superdeduction, among which the theory is used to enrich the
deduction system with new deduction rules. This method is presented in the
framework of the Zenon automated theorem prover, and is applied to the set
theory of the B method. This allows us to provide another prover to Atelier B,
which can be used to verify B proof rules in particular. We also propose some
benchmarks, in which this prover is able to automatically verify a part of the
rules coming from the database maintained by Siemens IC-MOL. Finally, we
describe another extension of Zenon with superdeduction, which is able to deal
with any first order theory, and provide a benchmark coming from the TPTP
library, which contains a large set of first order problems.
","[{'version': 'v1', 'created': 'Tue, 6 Jan 2015 13:13:59 GMT'}]",2015-01-08,"[['Jacquel', 'Mélanie', '', 'CEDRIC, CNAM Paris,\n  INRIA'], ['Berkani', 'Karim', '', 'CEDRIC, CNAM Paris,\n  INRIA'], ['Delahaye', 'David', '', 'CEDRIC, CNAM Paris,\n  INRIA'], ['Dubois', 'Catherine', '', 'CEDRIC, INRIA, ENSIIE']]","['Automated Deduction', 'Tableaux', 'Superdeduction', 'Zenon', 'Set Theory', 'B Method', 'First Order Theories']"
5546,1504.03875,Kevin Roussel,"K\'evin Roussel (INRIA Nancy - Grand Est / LORIA), Ye-Qiong Song
  (INRIA Nancy - Grand Est / LORIA), Olivier Zendra (INRIA Nancy - Grand Est /
  LORIA)","RIOT OS Paves the Way for Implementation of High-Performance MAC
  Protocols","SCITEPRESS. SENSORNETS 2015, Feb 2015, Angers, France.
  http://www.scitepress.org",,10.5220/0005237600050014,,cs.NI cs.OS cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Implementing new, high-performance MAC protocols requires real-time features,
to be able to synchronize correctly between different unrelated devices. Such
features are highly desirable for operating wireless sensor networks (WSN) that
are designed to be part of the Internet of Things (IoT). Unfortunately, the
operating systems commonly used in this domain cannot provide such features. On
the other hand, ""bare-metal"" development sacrifices portability, as well as the
mul-titasking abilities needed to develop the rich applications that are useful
in the domain of the Internet of Things. We describe in this paper how we
helped solving these issues by contributing to the development of a port of
RIOT OS on the MSP430 microcontroller, an architecture widely used in
IoT-enabled motes. RIOT OS offers rich and advanced real-time features,
especially the simultaneous use of as many hardware timers as the underlying
platform (microcontroller) can offer. We then demonstrate the effectiveness of
these features by presenting a new implementation, on RIOT OS, of S-CoSenS, an
efficient MAC protocol that uses very low processing power and energy.
","[{'version': 'v1', 'created': 'Wed, 15 Apr 2015 12:05:59 GMT'}]",2015-04-16,"[['Roussel', 'Kévin', '', 'INRIA Nancy - Grand Est / LORIA'], ['Song', 'Ye-Qiong', '', 'INRIA Nancy - Grand Est / LORIA'], ['Zendra', 'Olivier', '', 'INRIA Nancy - Grand Est /\n  LORIA']]","['Real-Time', 'Wireless Sensor Networks', 'Internet of Things', 'MAC protocols', 'RIOT OS']"
5547,1008.2186,Julien Leblay,"Fran\c{c}ois Goasdou\'e (LRI), Konstantinos Karanasos (INRIA Saclay -
  Ile de France), Julien Leblay (INRIA Saclay - Ile de France), Ioana Manolescu
  (LRI, INRIA Saclay - Ile de France)",RDFViewS: A Storage Tuning Wizard for RDF Applications,,"ACM International Conference on Information and Knowledge
  Management, Toronto : Canada (2010)",,,cs.DB cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, the significant growth of RDF data used in numerous
applications has made its efficient and scalable manipulation an important
issue. In this paper, we present RDFViewS, a system capable of choosing the
most suitable views to materialize, in order to minimize the query response
time for a specific SPARQL query workload, while taking into account the view
maintenance cost and storage space constraints. Our system employs practical
algorithms and heuristics to navigate through the search space of potential
view configurations, and exploits the possibly available semantic information -
expressed via an RDF Schema - to ensure the completeness of the query
evaluation.
","[{'version': 'v1', 'created': 'Thu, 12 Aug 2010 18:55:15 GMT'}]",2010-08-13,"[['Goasdoué', 'François', '', 'LRI'], ['Karanasos', 'Konstantinos', '', 'INRIA Saclay -\n  Ile de France'], ['Leblay', 'Julien', '', 'INRIA Saclay - Ile de France'], ['Manolescu', 'Ioana', '', 'LRI, INRIA Saclay - Ile de France']]","['RDF Data Management', 'View Selection', 'Materialized Views', 'Query Optimization', 'RDFS']"
5548,1902.00524,Florian Myter,"Florian Myter (Vrije Unversiteit Brussel, Belgium), Christophe
  Scholliers (Ghent University, Belgium), Wolfgang De Meuter (Vrije
  Universiteit Brussel, Belgium)",Distributed Reactive Programming for Reactive Distributed Systems,,"The Art, Science, and Engineering of Programming, 2019, Vol. 3,
  Issue 3, Article 5",10.22152/programming-journal.org/2019/3/5,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: The term reactivity is popular in two areas of research: programming
languages and distributed systems. On one hand, reactive programming is a
paradigm which provides programmers with the means to declaratively write
event-driven applications. On the other hand, reactive distributed systems
handle client requests in a timely fashion regardless of load or failures.
Inquiry: Reactive programming languages and frameworks tailored to the
implementation of distributed systems have previously been proposed. However,
we argue that these approaches are ill fit to implement reactive distributed
systems. Approach: We analyse state of the art runtimes for distributed
reactive programming and identify two key issues with regards to reactive
distributed systems. They rely on single, central points of coordination and/or
assume a lack of partial failures in the systems they support. Knowledge: Based
on our analysis we propose a novel runtime for distributed reactive programming
languages and frameworks. This runtime supports reactive distributed systems by
design. Grounding: We implement a proof of concept framework for reactive
distributed systems in JavaScript which builds atop our runtime. Using this
framework we implement a case study application which highlights the
applicability of our approach. Moreover, we benchmark our runtime against a
similar approach in order to showcase its runtime properties and we prove its
correctness. Importance: This work aims to bridge the gap between two kinds of
reactivity: reactive distributed systems and distributed reactive programming.
Current distributed reactive programming approaches do not support reactive
distributed systems. Our runtime is the first to bridge this reactivity gap: it
allows for reactive distributed systems to be implemented using distributed
reactive programming.
","[{'version': 'v1', 'created': 'Fri, 1 Feb 2019 19:06:08 GMT'}]",2019-02-05,"[['Myter', 'Florian', '', 'Vrije Unversiteit Brussel, Belgium'], ['Scholliers', 'Christophe', '', 'Ghent University, Belgium'], ['De Meuter', 'Wolfgang', '', 'Vrije\n  Universiteit Brussel, Belgium']]","['reactive programming', 'reactive systems', 'propagation algorithm', 'distributed programming', 'glitch']"
5549,1007.5115,Secretary Ijsea,"Mohamed Abouelela and Luigi Benedicenti (University of Regina, Canada)",Bayesian Network Based XP Process Modelling,"15 Pages, 7 Figures","International Journal of Software Engineering & Applications 1.3
  (2010) 1-15",10.5121/ijsea.2010.1301,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  A Bayesian Network based mathematical model has been used for modelling
Extreme Programming software development process. The model is capable of
predicting the expected finish time and the expected defect rate for each XP
release. Therefore, it can be used to determine the success/failure of any XP
Project. The model takes into account the effect of three XP practices, namely:
Pair Programming, Test Driven Development and Onsite Customer practices. The
model's predictions were validated against two case studies. Results show the
precision of our model especially in Predicting the project finish time.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2010 06:06:25 GMT'}]",2010-07-30,"[['Abouelela', 'Mohamed', '', 'University of Regina, Canada'], ['Benedicenti', 'Luigi', '', 'University of Regina, Canada']]","['Bayesian Networks', 'Extreme Programming', 'Process Modelling', 'Software Process']"
5550,1603.08092,Jianyu Tang,"Jianyu Tang, Hanzi Wang and Yan Yan","Learning Hough Regression Models via Bridge Partial Least Squares for
  Object Detection",,"Neurocomputing, 2015,152(3):236-249",10.1016/j.neucom.2014.10.071,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Popular Hough Transform-based object detection approaches usually construct
an appearance codebook by clustering local image features. However, how to
choose appropriate values for the parameters used in the clustering step
remains an open problem. Moreover, some popular histogram features extracted
from overlapping image blocks may cause a high degree of redundancy and
multicollinearity. In this paper, we propose a novel Hough Transform-based
object detection approach. First, to address the above issues, we exploit a
Bridge Partial Least Squares (BPLS) technique to establish context-encoded
Hough Regression Models (HRMs), which are linear regression models that cast
probabilistic Hough votes to predict object locations. BPLS is an efficient
variant of Partial Least Squares (PLS). PLS-based regression techniques
(including BPLS) can reduce the redundancy and eliminate the multicollinearity
of a feature set. And the appropriate value of the only parameter used in PLS
(i.e., the number of latent components) can be determined by using a
cross-validation procedure. Second, to efficiently handle object scale changes,
we propose a novel multi-scale voting scheme. In this scheme, multiple Hough
images corresponding to multiple object scales can be obtained simultaneously.
Third, an object in a test image may correspond to multiple true and false
positive hypotheses at different scales. Based on the proposed multi-scale
voting scheme, a principled strategy is proposed to fuse hypotheses to reduce
false positives by evaluating normalized pointwise mutual information between
hypotheses. In the experiments, we also compare the proposed HRM approach with
its several variants to evaluate the influences of its components on its
performance. Experimental results show that the proposed HRM approach has
achieved desirable performances on popular benchmark datasets.
","[{'version': 'v1', 'created': 'Sat, 26 Mar 2016 09:33:30 GMT'}]",2016-03-29,"[['Tang', 'Jianyu', ''], ['Wang', 'Hanzi', ''], ['Yan', 'Yan', '']]","['Object Detection', 'Hough Transform', 'Partial Least Squares', 'Mutual Information']"
5551,1007.3223,"Matti J\""arvisalo","Robert Brummayer, Matti J\""arvisalo",Testing and Debugging Techniques for Answer Set Solver Development,18 pages,"Theory and Practice of Logic Programming, 10(4-6):741-758, 2010",10.1017/S1471068410000396,,cs.AI cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper develops automated testing and debugging techniques for answer set
solver development. We describe a flexible grammar-based black-box ASP fuzz
testing tool which is able to reveal various defects such as unsound and
incomplete behavior, i.e. invalid answer sets and inability to find existing
solutions, in state-of-the-art answer set solver implementations. Moreover, we
develop delta debugging techniques for shrinking failure-inducing inputs on
which solvers exhibit defective behavior. In particular, we develop a delta
debugging algorithm in the context of answer set solving, and evaluate two
different elimination strategies for the algorithm.
","[{'version': 'v1', 'created': 'Mon, 19 Jul 2010 17:51:54 GMT'}]",2010-07-20,"[['Brummayer', 'Robert', ''], ['Järvisalo', 'Matti', '']]","['answer set programming', 'answer set solvers', 'testing', 'debugging']"
5552,1610.02517,Ali Bou Nassif,"Mohammad Azzeh, Ali Bou Nassif","A Hybrid Model for Estimating Software Project Effort from Use Case
  Points",,,10.1016/j.asoc.2016.05.008,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Early software effort estimation is a hallmark of successful software project
management. Building a reliable effort estimation model usually requires
historical data. Unfortunately, since the information available at early stages
of software development is scarce, it is recommended to use software size
metrics as key cost factor of effort estimation. Use Case Points (UCP) is a
prominent size measure designed mainly for object-oriented projects.
Nevertheless, there are no established models that can translate UCP into its
corresponding effort, therefore, most models use productivity as a second cost
driver. The productivity in those models is usually guessed by experts and does
not depend on historical data, which makes it subject to uncertainty. Thus,
these models were not well examined using a large number of historical data. In
this paper, we designed a hybrid model that consists of classification and
prediction stages using a support vector machine and radial basis neural
networks. The proposed model was constructed over a large number of
observations collected from industrial and student projects. The proposed model
was compared against previous UCP prediction models. The validation and
empirical results demonstrated that the proposed model significantly surpasses
these models on all datasets. The main conclusion is that the environmental
factors of UCP can be used to classify and estimate productivity.
","[{'version': 'v1', 'created': 'Sat, 8 Oct 2016 12:18:18 GMT'}]",2017-03-20,"[['Azzeh', 'Mohammad', ''], ['Nassif', 'Ali Bou', '']]","['Effort Estimation', 'Use Case Points', 'Radial Basis Neural Networks', 'Support Vector Machine.  1']"
5553,2102.00378,Yishuai Li,"Yishuai Li, Benjamin C. Pierce, and Steve Zdancewic",Model-Based Testing of Networked Applications,"11 pages, 15 figures","Proceedings of the 30th ACM SIGSOFT International Symposium on
  Software Testing and Analysis (ISSTA 2021). Association for Computing
  Machinery, New York, NY, USA, 529--539",10.1145/3460319.3464798,,cs.SE cs.PL,http://creativecommons.org/licenses/by/4.0/,"  We present a principled automatic testing framework for application-layer
protocols. The key innovation is a domain-specific embedded language for
writing nondeterministic models of the behavior of networked servers. These
models are defined within the Coq interactive theorem prover, supporting a
smooth transition from testing to formal verification.
  Given a server model, we show how to automatically derive a tester that
probes the server for unexpected behaviors. We address the uncertainties caused
by both the server's internal choices and the network delaying messages
nondeterministically. The derived tester accepts server implementations whose
possible behaviors are a subset of those allowed by the nondeterministic model.
  We demonstrate the effectiveness of this framework by using it to specify and
test a fragment of the HTTP/1.1 protocol, showing that the automatically
derived tester can capture RFC violations in buggy server implementations,
including the latest versions of Apache and Nginx.
","[{'version': 'v1', 'created': 'Sun, 31 Jan 2021 04:58:10 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Jul 2021 21:33:29 GMT'}]",2021-07-13,"[['Li', 'Yishuai', ''], ['Pierce', 'Benjamin C.', ''], ['Zdancewic', 'Steve', '']]","['Model-based testing', 'nondeterminism', 'network refinement', 'interaction trees', 'Coq', 'HTTP']"
5554,1702.08008,Arthur-Jozsef Molnar,Arthur-Jozsef Molnar,JETracer - A Framework for Java GUI Event Tracing,"Proceedings of ENASE 2015, ISBN: 978-989-758-100-7",,10.5220/0005372902070214,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The present paper introduces the open-source Java Event Tracer (JETracer)
framework for real-time tracing of GUI events within applications based on the
AWT, Swing or SWT graphical toolkits. Our framework provides a common event
model for supported toolkits, the possibility of receiving GUI events in
real-time, good performance in the case of complex target applications and the
possibility of deployment over a network. The present paper provides the
rationale for JETracer, presents related research and details its technical
implementation. An empirical evaluation where JETracer is used to trace GUI
events within five popular, open-source applications is also presented.
","[{'version': 'v1', 'created': 'Sun, 26 Feb 2017 09:28:55 GMT'}]",2017-02-28,"[['Molnar', 'Arthur-Jozsef', '']]","['GUI', 'event', 'tracing', 'analysis', 'instrumentation', 'Java']"
5555,1608.04051,Ting Liu,"Ting Liu, Miaomiao Zhang, Mehran Javanmardi, Nisha Ramesh, Tolga
  Tasdizen","SSHMT: Semi-supervised Hierarchical Merge Tree for Electron Microscopy
  Image Segmentation",Accepted by ECCV 2016,"Computer Vision - 14th European Conference, ECCV 2016,
  Proceedings, 144--159",10.1007/978-3-319-46448-0_9,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Region-based methods have proven necessary for improving segmentation
accuracy of neuronal structures in electron microscopy (EM) images. Most
region-based segmentation methods use a scoring function to determine region
merging. Such functions are usually learned with supervised algorithms that
demand considerable ground truth data, which are costly to collect. We propose
a semi-supervised approach that reduces this demand. Based on a merge tree
structure, we develop a differentiable unsupervised loss term that enforces
consistent predictions from the learned function. We then propose a Bayesian
model that combines the supervised and the unsupervised information for
probabilistic learning. The experimental results on three EM data sets
demonstrate that by using a subset of only 3% to 7% of the entire ground truth
data, our approach consistently performs close to the state-of-the-art
supervised method with the full labeled data set, and significantly outperforms
the supervised method with the same labeled subset.
","[{'version': 'v1', 'created': 'Sun, 14 Aug 2016 02:34:29 GMT'}]",2018-04-04,"[['Liu', 'Ting', ''], ['Zhang', 'Miaomiao', ''], ['Javanmardi', 'Mehran', ''], ['Ramesh', 'Nisha', ''], ['Tasdizen', 'Tolga', '']]","['Image segmentation', 'electron microscopy', 'semi-supervisedlearning', 'hierarchical segmentation', 'connectomics']"
5556,1306.1478,Benaboud Rohallah Mr,Benaboud Rohallah and Maamri Ramdane and Sahnoun Zaidi,"Agents and owl-s based semantic web service discovery with user
  preference support","19 pages, 10 figures","International Journal of Web & Semantic Technology (IJWesT), April
  2013, Volume 4, Number 2, pp 57-75",10.5121/ijwest.2013.4206,,cs.IR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Service-oriented computing (SOC) is an interdisciplinary paradigm that
revolutionizes the very fabric of distributed software development applications
that adopt service-oriented architectures (SOA) can evolve during their
lifespan and adapt to changing or unpredictable environments more easily. SOA
is built around the concept of Web Services. Although the Web services
constitute a revolution in Word Wide Web, they are always regarded as
non-autonomous entities and can be exploited only after their discovery. With
the help of software agents, Web services are becoming more efficient and more
dynamic. The topic of this paper is the development of an agent based approach
for Web services discovery and selection in witch, OWL-S is used to describe
Web services, QoS and service customer request. We develop an efficient
semantic service matching which takes into account concepts properties to match
concepts in Web service and service customer request descriptions. Our approach
is based on an architecture composed of four layers: Web service and Request
description layer, Functional match layer, QoS computing layer and Reputation
computing layer.
","[{'version': 'v1', 'created': 'Thu, 6 Jun 2013 17:25:54 GMT'}]",2013-06-07,"[['Rohallah', 'Benaboud', ''], ['Ramdane', 'Maamri', ''], ['Zaidi', 'Sahnoun', '']]","['Web service', 'discovery', 'agents', 'OWL-S & QoS']"
5557,0903.2904,Andreas Bauer,"Andreas Bauer, Rajeev Gore, Alwen Tiu",A decidable policy language for history-based transaction monitoring,,,10.1007/978-3-642-03466-4_6,,cs.LO cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online trading invariably involves dealings between strangers, so it is
important for one party to be able to judge objectively the trustworthiness of
the other. In such a setting, the decision to trust a user may sensibly be
based on that user's past behaviour. We introduce a specification language
based on linear temporal logic for expressing a policy for categorising the
behaviour patterns of a user depending on its transaction history. We also
present an algorithm for checking whether the transaction history obeys the
stated policy. To be useful in a real setting, such a language should allow one
to express realistic policies which may involve parameter quantification and
quantitative or statistical patterns. We introduce several extensions of linear
temporal logic to cater for such needs: a restricted form of universal and
existential quantification; arbitrary computable functions and relations in the
term language; and a ""counting"" quantifier for counting how many times a
formula holds in the past. We then show that model checking a transaction
history against a policy, which we call the history-based transaction
monitoring problem, is PSPACE-complete in the size of the policy formula and
the length of the history. The problem becomes decidable in polynomial time
when the policies are fixed. We also consider the problem of transaction
monitoring in the case where not all the parameters of actions are observable.
We formulate two such ""partial observability"" monitoring problems, and show
their decidability under certain restrictions.
","[{'version': 'v1', 'created': 'Tue, 17 Mar 2009 06:23:44 GMT'}]",2015-05-13,"[['Bauer', 'Andreas', ''], ['Gore', 'Rajeev', ''], ['Tiu', 'Alwen', '']]","['History-based access control', 'security policies', 'temporal logic', 'monitoring', 'model checking']"
5558,1208.2102,Abdul Kareem,"Abdul Kareem, Mohammad Fazle Azeem","A Novel Fuzzy Logic Based Adaptive Supertwisting Sliding Mode Control
  Algorithm for Dynamic Uncertain Systems",14 pages,"International Journal of Artificial Intelligence & Applications
  (IJAIA), Vol.3, No.4, July 2012, 21-34",10.5121/ijaia.2012.3402,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel fuzzy logic based Adaptive Super-twisting Sliding
Mode Controller for the control of dynamic uncertain systems. The proposed
controller combines the advantages of Second order Sliding Mode Control, Fuzzy
Logic Control and Adaptive Control. The reaching conditions, stability and
robustness of the system with the proposed controller are guaranteed. In
addition, the proposed controller is well suited for simple design and
implementation. The effectiveness of the proposed controller over the first
order Sliding Mode Fuzzy Logic controller is illustrated by Matlab based
simulations performed on a DC-DC Buck converter. Based on this comparison, the
proposed controller is shown to obtain the desired transient response without
causing chattering and error under steady-state conditions. The proposed
controller is able to give robust performance in terms of rejection to input
voltage variations and load variations.
","[{'version': 'v1', 'created': 'Fri, 10 Aug 2012 07:19:48 GMT'}]",2012-08-13,"[['Kareem', 'Abdul', ''], ['Azeem', 'Mohammad Fazle', '']]","['Super-twisting Sliding Mode Control', 'Fuzzy Logic Control', 'Chattering', 'Adaptive Control', 'DC-DC Buckconverter']"
5559,1404.4141,Richa Gupta Ms,Richa Gupta,Information Hiding and Attacks : Review,"4 pages. arXiv admin note: substantial text overlap with
  arXiv:1404.3063","International Journal of Computer Trends and Technology (IJCTT)
  10(1): 1-4, April 2014. Published by Seventh Sense Research Group",10.14445/22312803/IJCTT-V10P105.,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information Hiding is considered very important part of our lives. There
exist many techniques for securing the information. This paper briefs on the
techniques for information hiding and the potential threats to those methods.
This paper briefs about cryptanalysis and stegananlysis, two methods for
breaching into the security methods.
","[{'version': 'v1', 'created': 'Wed, 16 Apr 2014 05:24:41 GMT'}]",2014-04-17,"[['Gupta', 'Richa', '']]","['information hiding', 'cryptanalysis', 'steganalysis']"
5560,2102.12518,Jinghui Cheng,"Jazlyn Hellman, Jinghui Cheng, Jin L.C. Guo","Facilitating Asynchronous Participatory Design of Open Source Software:
  Bringing End Users into the Loop","7 pages, 3 figures, CHI 2021 Extended Abstracts",,10.1145/3411763.3451643,,cs.HC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As open source software (OSS) becomes increasingly mature and popular, there
are significant challenges with properly accounting for usability concerns for
the diverse end users. Participatory design, where multiple stakeholders
collaborate on iterating the design, can be an efficient way to address the
usability concerns for OSS projects. However, barriers such as a code-centric
mindset and insufficient tool support often prevent OSS teams from effectively
including end users in participatory design methods. This paper proposes
preliminary contributions to this problem through the user-centered exploration
of (1) a set of design guidelines that capture the needs of OSS participatory
design tools, (2) two personas that represent the characteristics of OSS
designers and end users, and (3) a low-fidelity prototype tool for end user
involvement in OSS projects. This work paves the road for future studies about
tool design that would eventually help improve OSS usability.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2021 19:23:11 GMT'}]",2021-02-26,"[['Hellman', 'Jazlyn', ''], ['Cheng', 'Jinghui', ''], ['Guo', 'Jin L. C.', '']]","['open source software', 'usability', 'participatory design', 'asynchronouscollaboration']"
5561,2104.04118,Tica Lin,"Tica Lin, Rishi Singh, Yalong Yang, Carolina Nobre, Johanna Beyer,
  Maurice A. Smith and Hanspeter Pfister","Towards an Understanding of Situated AR Visualization for Basketball
  Free-Throw Training","To appear in the 2021 ACM Conference on Human Factors in Computing
  Systems (CHI 2021)",,10.1145/3411764.3445649,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an observational study to compare co-located and situated
real-time visualizations in basketball free-throw training. Our goal is to
understand the advantages and concerns of applying immersive visualization to
real-world skill-based sports training and to provide insights for designing AR
sports training systems. We design both a situated 3D visualization on a
head-mounted display and a 2D visualization on a co-located display to provide
immediate visual feedback on a player's shot performance. Using a
within-subject study design with experienced basketball shooters, we
characterize user goals, report on qualitative training experiences, and
compare the quantitative training results. Our results show that real-time
visual feedback helps athletes refine subsequent shots. Shooters in our study
achieve greater angle consistency with our visual feedback. Furthermore, AR
visualization promotes an increased focus on body form in athletes. Finally, we
present suggestions for the design of future sports AR studies.
","[{'version': 'v1', 'created': 'Thu, 8 Apr 2021 23:54:31 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Apr 2021 16:24:04 GMT'}]",2021-04-13,"[['Lin', 'Tica', ''], ['Singh', 'Rishi', ''], ['Yang', 'Yalong', ''], ['Nobre', 'Carolina', ''], ['Beyer', 'Johanna', ''], ['Smith', 'Maurice A.', ''], ['Pfister', 'Hanspeter', '']]","['Immersive Analytics', 'Situated Analytics', 'SportsXR', 'AugmentedReality', 'Data Visualization']"
5562,2104.04696,Antony Thomas,"Antony Thomas, Fulvio Mastrogiovanni, Marco Baglietto",MPTP: Motion-Planning-aware Task Planning for Navigation in Belief Space,"Accepted for publication in Robotics and Autonomous Systems. arXiv
  admin note: text overlap with arXiv:1910.11683, arXiv:2010.00780",,10.1016/j.robot.2021.103786,,cs.RO cs.AI,http://creativecommons.org/licenses/by/4.0/,"  We present an integrated Task-Motion Planning (TMP) framework for navigation
in large-scale environments. Of late, TMP for manipulation has attracted
significant interest resulting in a proliferation of different approaches. In
contrast, TMP for navigation has received considerably less attention.
Autonomous robots operating in real-world complex scenarios require planning in
the discrete (task) space and the continuous (motion) space. In
knowledge-intensive domains, on the one hand, a robot has to reason at the
highest-level, for example, the objects to procure, the regions to navigate to
in order to acquire them; on the other hand, the feasibility of the respective
navigation tasks have to be checked at the execution level. This presents a
need for motion-planning-aware task planners. In this paper, we discuss a
probabilistically complete approach that leverages this task-motion interaction
for navigating in large knowledge-intensive domains, returning a plan that is
optimal at the task-level. The framework is intended for motion planning under
motion and sensing uncertainty, which is formally known as belief space
planning. The underlying methodology is validated in simulation, in an office
environment and its scalability is tested in the larger Willow Garage world. A
reasonable comparison with a work that is closest to our approach is also
provided. We also demonstrate the adaptability of our approach by considering a
building floor navigation domain. Finally, we also discuss the limitations of
our approach and put forward suggestions for improvements and future work.
","[{'version': 'v1', 'created': 'Sat, 10 Apr 2021 06:52:16 GMT'}]",2021-11-05,"[['Thomas', 'Antony', ''], ['Mastrogiovanni', 'Fulvio', ''], ['Baglietto', 'Marco', '']]","['Task-Motion Planning', 'Belief Space Planning', 'Autonomous Navigation']"
5563,2110.03760,Ayush Raina,"Ayush Raina, Jonathan Cagan, Christopher McComb","Design Strategy Network: A deep hierarchical framework to represent
  generative design strategies in complex action spaces",Published in Journal of Mechanical Design,"J. Mech. Des. Feb 2022, 144(2): 021404 (12 pages)",10.1115/1.4052566,Volume 144 Issue 2,cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Generative design problems often encompass complex action spaces that may be
divergent over time, contain state-dependent constraints, or involve hybrid
(discrete and continuous) domains. To address those challenges, this work
introduces Design Strategy Network (DSN), a data-driven deep hierarchical
framework that can learn strategies over these arbitrary complex action spaces.
The hierarchical architecture decomposes every action decision into first
predicting a preferred spatial region in the design space and then outputting a
probability distribution over a set of possible actions from that region. This
framework comprises a convolutional encoder to work with image-based design
state representations, a multi-layer perceptron to predict a spatial region,
and a weight-sharing network to generate a probability distribution over
unordered set-based inputs of feasible actions. Applied to a truss design
study, the framework learns to predict the actions of human designers in the
study, capturing their truss generation strategies in the process. Results show
that DSNs significantly outperform non-hierarchical methods of policy
representation, demonstrating their superiority in complex action space
problems.
","[{'version': 'v1', 'created': 'Thu, 7 Oct 2021 19:29:40 GMT'}]",2021-10-14,"[['Raina', 'Ayush', ''], ['Cagan', 'Jonathan', ''], ['McComb', 'Christopher', '']]","['Decision making', 'Complex Action Spaces', 'Imitation Learning', 'Design Automation', 'Deep']"
5564,cs/0610147,Kun-Hong Liu,"Kun-hong Liu, Yong Xu, De-shuang Huang, Min Cheng","Grooming of Dynamic Traffic in WDM Star and Tree Networks Using Genetic
  Algorithm",15 pages,"Photonic Network Communications,Volume 15, Number 2, 2008",10.1007/s11107-007-0103-0,,cs.NI,,"  The advances in WDM technology lead to the great interest in traffic grooming
problems. As traffic often changes from time to time, the problem of grooming
dynamic traffic is of great practical value. In this paper, we discuss dynamic
grooming of traffic in star and tree networks. A genetic algorithm (GA) based
approach is proposed to support arbitrary dynamic traffic patterns, which
minimizes the number of ADM's and wavelengths. To evaluate the algorithm,
tighter bounds are derived. Computer simulation results show that our algorithm
is efficient in reducing both the numbers of ADM's and wavelengths in tree and
star networks.
","[{'version': 'v1', 'created': 'Thu, 26 Oct 2006 02:56:54 GMT'}]",2008-04-20,"[['Liu', 'Kun-hong', ''], ['Xu', 'Yong', ''], ['Huang', 'De-shuang', ''], ['Cheng', 'Min', '']]","['WDM', 'Traffic Grooming', 'Genetic Algorithm', 'Dynamic Traffic', 'tree network']"
5565,1709.10402,Krishna Dasaratha,Krishna Dasaratha,Distributions of Centrality on Networks,,"Games and Economic Behavior, Vol. 122, July 2020, 1-27",10.1016/j.geb.2020.03.008,,cs.SI physics.soc-ph q-fin.EC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide a framework for determining the centralities of agents in a broad
family of random networks. Current understanding of network centrality is
largely restricted to deterministic settings, but practitioners frequently use
random network models to accommodate data limitations or prove asymptotic
results. Our main theorems show that on large random networks, centrality
measures are close to their expected values with high probability. We
illustrate the economic consequences of these results by presenting three
applications: (1) In network formation models based on community structure
(called stochastic block models), we show network segregation and differences
in community size produce inequality. Benefits from peer effects tend to accrue
disproportionately to bigger and better-connected communities. (2) When link
probabilities depend on geography, we can compute and compare the centralities
of agents in different locations. (3) In models where connections depend on
several independent characteristics, we give a formula that determines
centralities 'characteristic-by-characteristic'. The basic techniques from
these applications, which use the main theorems to reduce questions about
random networks to deterministic calculations, extend to many network games.
","[{'version': 'v1', 'created': 'Fri, 29 Sep 2017 13:34:03 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Jan 2018 00:01:21 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Aug 2018 19:48:00 GMT'}, {'version': 'v4', 'created': 'Mon, 10 Jun 2019 15:24:40 GMT'}]",2022-02-07,"[['Dasaratha', 'Krishna', '']]","['Centrality', 'networks', 'social networks', 'peer effects', 'inequality', 'segregation']"
5566,2101.06563,Runqiu Bao,"Runqiu Bao, Ren Komatsu, Renato Miyagusuku, Masaki Chino, Atsushi
  Yamashita, Hajime Asama","Stereo Camera Visual SLAM with Hierarchical Masking and Motion-state
  Classification at Outdoor Construction Sites Containing Large Dynamic Objects","This is an Accepted Manuscript of an article published by Taylor &
  Francis in Advanced Robotics on Jan. 11th, 2021, available online:
  https://www.tandfonline.com/doi/full/10.1080/01691864.2020.1869586 [Article
  DOI:10.1080/01691864.2020.1869586]",Advanced Robotics (2021) 1-14,10.1080/01691864.2020.1869586,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  At modern construction sites, utilizing GNSS (Global Navigation Satellite
System) to measure the real-time location and orientation (i.e. pose) of
construction machines and navigate them is very common. However, GNSS is not
always available. Replacing GNSS with on-board cameras and visual simultaneous
localization and mapping (visual SLAM) to navigate the machines is a
cost-effective solution. Nevertheless, at construction sites, multiple
construction machines will usually work together and side-by-side, causing
large dynamic occlusions in the cameras' view. Standard visual SLAM cannot
handle large dynamic occlusions well. In this work, we propose a motion
segmentation method to efficiently extract static parts from crowded dynamic
scenes to enable robust tracking of camera ego-motion. Our method utilizes
semantic information combined with object-level geometric constraints to
quickly detect the static parts of the scene. Then, we perform a two-step
coarse-to-fine ego-motion tracking with reference to the static parts. This
leads to a novel dynamic visual SLAM formation. We test our proposals through a
real implementation based on ORB-SLAM2, and datasets we collected from real
construction sites. The results show that when standard visual SLAM fails, our
method can still retain accurate camera ego-motion tracking in real-time.
Comparing to state-of-the-art dynamic visual SLAM methods, ours shows
outstanding efficiency and competitive result trajectory accuracy.
","[{'version': 'v1', 'created': 'Sun, 17 Jan 2021 00:50:41 GMT'}]",2021-01-19,"[['Bao', 'Runqiu', ''], ['Komatsu', 'Ren', ''], ['Miyagusuku', 'Renato', ''], ['Chino', 'Masaki', ''], ['Yamashita', 'Atsushi', ''], ['Asama', 'Hajime', '']]","['dynamic visual SLAM', 'motion segmentation', 'hierarchical masking', 'object motion-state classification', 'ego-motion tracking']"
5567,2110.11744,Alan Medlar,"Alan Medlar, Jing Li, Yang Liu, Dorota Glowacka",Critiquing-based Modeling of Subjective Preferences,,,10.1145/3503252.3531314,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Applications designed for entertainment and other non-instrumental purposes
are challenging to optimize because the relationships between system parameters
and user experience can be unclear. Ideally, we would crowdsource these design
questions, but existing approaches are geared towards evaluation or ranking
discrete choices and not for optimizing over continuous parameter spaces. In
addition, users are accustomed to informally expressing opinions about
experiences as critiques (e.g. it's too cold, too spicy, too big), rather than
giving precise feedback as an optimization algorithm would require.
Unfortunately, it can be difficult to analyze qualitative feedback, especially
in the context of quantitative modeling. In this article, we present collective
criticism, a critiquing-based approach for modeling relationships between
system parameters and subjective preferences. We transform critiques, such as
""it was too easy/too challenging"", into censored intervals and analyze them
using interval regression. Collective criticism has several advantages over
other approaches: ""too much/too little""-style feedback is intuitive for users
and allows us to build predictive models for the optimal parameterization of
the variables being critiqued. We present two studies where we model: (i)
aesthetic preferences for images generated with neural style transfer, and (ii)
users' experiences of challenge in the video game Tetris. These studies
demonstrate the flexibility of our approach, and show that it produces robust
results that are straightforward to interpret and inline with users' stated
preferences.
","[{'version': 'v1', 'created': 'Fri, 22 Oct 2021 12:36:06 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Feb 2022 10:37:32 GMT'}, {'version': 'v3', 'created': 'Mon, 25 Apr 2022 13:18:17 GMT'}]",2022-04-26,"[['Medlar', 'Alan', ''], ['Li', 'Jing', ''], ['Liu', 'Yang', ''], ['Glowacka', 'Dorota', '']]","['critiquing', 'subjective preferences', 'user experience', 'randomized experiments']"
5568,2104.05742,Tarik A. Rashid,"Nitish Maharjan, Abeer Alsadoon, P.W.C. Prasad, Salma Abdullah, Tarik
  A. Rashid","A Novel Visualization System of Using Augmented Reality in Knee
  Replacement Surgery: Enhanced Bidirectional Maximum Correntropy Algorithm",27 pages,"The International Journal of Medical Robotics and Computer
  Assisted Surgery, 2020",10.1002/rcs.2154,,cs.CV cs.AI cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Background and aim: Image registration and alignment are the main limitations
of augmented reality-based knee replacement surgery. This research aims to
decrease the registration error, eliminate outcomes that are trapped in local
minima to improve the alignment problems, handle the occlusion, and maximize
the overlapping parts. Methodology: markerless image registration method was
used for Augmented reality-based knee replacement surgery to guide and
visualize the surgical operation. While weight least square algorithm was used
to enhance stereo camera-based tracking by filling border occlusion in right to
left direction and non-border occlusion from left to right direction. Results:
This study has improved video precision to 0.57 mm~0.61 mm alignment error.
Furthermore, with the use of bidirectional points, for example, forwards and
backwards directional cloud point, the iteration on image registration was
decreased. This has led to improve the processing time as well. The processing
time of video frames was improved to 7.4~11.74 fps. Conclusions: It seems clear
that this proposed system has focused on overcoming the misalignment difficulty
caused by movement of patient and enhancing the AR visualization during knee
replacement surgery. The proposed system was reliable and favorable which helps
in eliminating alignment error by ascertaining the optimal rigid transformation
between two cloud points and removing the outliers and non-Gaussian noise. The
proposed augmented reality system helps in accurate visualization and
navigation of anatomy of knee such as femur, tibia, cartilage, blood vessels,
etc.
","[{'version': 'v1', 'created': 'Sat, 13 Mar 2021 19:18:16 GMT'}]",2021-04-14,"[['Maharjan', 'Nitish', ''], ['Alsadoon', 'Abeer', ''], ['Prasad', 'P. W. C.', ''], ['Abdullah', 'Salma', ''], ['Rashid', 'Tarik A.', '']]","['Augmented reality', 'Image registration', 'Iterative Closest Point (ICP)', 'Bidirectional maximum Correntropy', 'Stereo Tracking', 'knee replacement surgery']"
5569,2209.03557,Chengzhi Zhang,"Lei Zhao, Yingyi Zhang, Chengzhi Zhang","Does Attention Mechanism Possess the Feature of Human Reading? A
  Perspective of Sentiment Classification Task",,,10.1108/AJIM-12-2021-0385,,cs.CL cs.HC,http://creativecommons.org/licenses/by/4.0/,"  [Purpose] To understand the meaning of a sentence, humans can focus on
important words in the sentence, which reflects our eyes staying on each word
in different gaze time or times. Thus, some studies utilize eye-tracking values
to optimize the attention mechanism in deep learning models. But these studies
lack to explain the rationality of this approach. Whether the attention
mechanism possesses this feature of human reading needs to be explored.
[Design/methodology/approach] We conducted experiments on a sentiment
classification task. Firstly, we obtained eye-tracking values from two
open-source eye-tracking corpora to describe the feature of human reading.
Then, the machine attention values of each sentence were learned from a
sentiment classification model. Finally, a comparison was conducted to analyze
machine attention values and eye-tracking values. [Findings] Through
experiments, we found the attention mechanism can focus on important words,
such as adjectives, adverbs, and sentiment words, which are valuable for
judging the sentiment of sentences on the sentiment classification task. It
possesses the feature of human reading, focusing on important words in
sentences when reading. Due to the insufficient learning of the attention
mechanism, some words are wrongly focused. The eye-tracking values can help the
attention mechanism correct this error and improve the model performance.
[Originality/value] Our research not only provides a reasonable explanation for
the study of using eye-tracking values to optimize the attention mechanism, but
also provides new inspiration for the interpretability of attention mechanism.
","[{'version': 'v1', 'created': 'Thu, 8 Sep 2022 04:19:48 GMT'}]",2022-09-09,"[['Zhao', 'Lei', ''], ['Zhang', 'Yingyi', ''], ['Zhang', 'Chengzhi', '']]","['Eye-tracking values', 'Attention mechanism', 'Attention', 'Human reading Paper type Research paper']"
5570,2101.09869,Lelia Marie Hampton,Lelia Marie Hampton,Black Feminist Musings on Algorithmic Oppression,"12 pages, accepted to ACM Conference on Fairness, Accountability, and
  Transparency 2021",,10.1145/3442188.3445929,,cs.CY cs.AI cs.HC cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper unapologetically reflects on the critical role that Black feminism
can and should play in abolishing algorithmic oppression. Positioning
algorithmic oppression in the broader field of feminist science and technology
studies, I draw upon feminist philosophical critiques of science and technology
and discuss histories and continuities of scientific oppression against
historically marginalized people. Moreover, I examine the concepts of
invisibility and hypervisibility in oppressive technologies a l\'a the
canonical double bind. Furthermore, I discuss what it means to call for
diversity as a solution to algorithmic violence, and I critique dialectics of
the fairness, accountability, and transparency community. I end by inviting you
to envision and imagine the struggle to abolish algorithmic oppression by
abolishing oppressive systems and shifting algorithmic development practices,
including engaging our communities in scientific processes, centering
marginalized communities in design, and consensual data and algorithmic
practices.
","[{'version': 'v1', 'created': 'Mon, 25 Jan 2021 03:04:05 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Feb 2021 01:54:26 GMT'}]",2021-02-04,"[['Hampton', 'Lelia Marie', '']]","['Algorithmic oppression', 'Black feminism', 'abolition']"
5571,2111.09035,"Lars Kl\""oser","Lars Kl\""oser, Philipp Kohl, Bodo Kraft, Albert Z\""undorf","Multi-Attribute Relation Extraction (MARE) -- Simplifying the
  Application of Relation Extraction","Preprint of short paper for the 2nd International Conference on Deep
  Learning Theory and Applications (2021)","Proceedings of the 2nd International Conference on Deep Learning
  Theory and Applications, Vol. 1, (2021), P. 148 - 156",10.5220/0010559201480156,,cs.CL cs.AI cs.IR cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  Natural language understanding's relation extraction makes innovative and
encouraging novel business concepts possible and facilitates new digitilized
decision-making processes. Current approaches allow the extraction of relations
with a fixed number of entities as attributes. Extracting relations with an
arbitrary amount of attributes requires complex systems and costly
relation-trigger annotations to assist these systems. We introduce
multi-attribute relation extraction (MARE) as an assumption-less problem
formulation with two approaches, facilitating an explicit mapping from business
use cases to the data annotations. Avoiding elaborated annotation constraints
simplifies the application of relation extraction approaches. The evaluation
compares our models to current state-of-the-art event extraction and binary
relation extraction methods. Our approaches show improvement compared to these
on the extraction of general multi-attribute relations.
","[{'version': 'v1', 'created': 'Wed, 17 Nov 2021 11:06:39 GMT'}]",2021-11-18,"[['Klöser', 'Lars', ''], ['Kohl', 'Philipp', ''], ['Kraft', 'Bodo', ''], ['Zündorf', 'Albert', '']]","['Natural Language Processing', 'Natural Language Understanding', 'Information Extraction', 'Relation Extraction', 'Joint Relation Extraction', 'Event Extraction']"
5572,2106.15182,Pietro Liguori,"Domenico Cotroneo, Luigi De Simone, Pietro Liguori, Roberto Natella","Enhancing the Analysis of Software Failures in Cloud Computing Systems
  with Deep Learning","Paper accepted to the Journal of Systems and Software on June 28th,
  2021",,10.1016/j.jss.2021.111043,,cs.AI cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Identifying the failure modes of cloud computing systems is a difficult and
time-consuming task, due to the growing complexity of such systems, and the
large volume and noisiness of failure data. This paper presents a novel
approach for analyzing failure data from cloud systems, in order to relieve
human analysts from manually fine-tuning the data for feature engineering. The
approach leverages Deep Embedded Clustering (DEC), a family of unsupervised
clustering algorithms based on deep learning, which uses an autoencoder to
optimize data dimensionality and inter-cluster variance. We applied the
approach in the context of the OpenStack cloud computing platform, both on the
raw failure data and in combination with an anomaly detection pre-processing
algorithm. The results show that the performance of the proposed approach, in
terms of purity of clusters, is comparable to, or in some cases even better
than manually fine-tuned clustering, thus avoiding the need for deep domain
knowledge and reducing the effort to perform the analysis. In all cases, the
proposed approach provides better performance than unsupervised clustering when
no feature engineering is applied to the data. Moreover, the distribution of
failure modes from the proposed approach is closer to the actual frequency of
the failure modes.
","[{'version': 'v1', 'created': 'Tue, 29 Jun 2021 09:00:41 GMT'}]",2022-03-09,"[['Cotroneo', 'Domenico', ''], ['De Simone', 'Luigi', ''], ['Liguori', 'Pietro', ''], ['Natella', 'Roberto', '']]","['Failure Mode Analysis', 'Software Failures', 'Fault Injection', 'Cloud Computing', 'Deep Learning', 'OpenStack']"
5573,2110.03338,Ralph Peeters,"Ralph Peeters, Christian Bizer",Cross-Language Learning for Entity Matching,,,10.1145/3487553.3524234,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transformer-based entity matching methods have significantly moved the state
of the art for less-structured matching tasks such as matching product offers
in e-commerce. In order to excel at these tasks, Transformer-based matching
methods require a decent amount of training pairs. Providing enough training
data can be challenging, especially if a matcher for non-English product
descriptions should be learned. This poster explores along the use case of
matching product offers from different e-shops to which extent it is possible
to improve the performance of Transformer-based matchers by complementing a
small set of training pairs in the target language, German in our case, with a
larger set of English-language training pairs. Our experiments using different
Transformers show that extending the German set with English pairs improves the
matching performance in all cases. The impact of adding the English pairs is
especially high in low-resource settings in which only a rather small number of
non-English pairs is available. As it is often possible to automatically gather
English training pairs from the Web by exploiting schema.org annotations, our
results are relevant for many product matching scenarios targeting low-resource
languages.
","[{'version': 'v1', 'created': 'Thu, 7 Oct 2021 11:08:31 GMT'}, {'version': 'v2', 'created': 'Mon, 2 May 2022 10:46:28 GMT'}]",2022-05-03,"[['Peeters', 'Ralph', ''], ['Bizer', 'Christian', '']]","['entity matching', 'cross-language learning', 'e-commerce', 'transformers', 'schema']"
5574,1605.03047,Nasser Ghadiri,"Nasser Ghadiri, Meysam Ghaffari, Mohammad Amin Nikbakht","BigFCM: Fast, Precise and Scalable FCM on Hadoop",,,10.1016/j.future.2017.06.010,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering plays an important role in mining big data both as a modeling
technique and a preprocessing step in many data mining process implementations.
Fuzzy clustering provides more flexibility than non-fuzzy methods by allowing
each data record to belong to more than one cluster to some degree. However, a
serious challenge in fuzzy clustering is the lack of scalability. Massive
datasets in emerging fields such as geosciences, biology and networking do
require parallel and distributed computations with high performance to solve
real-world problems. Although some clustering methods are already improved to
execute on big data platforms, but their execution time is highly increased for
large datasets. In this paper, a scalable Fuzzy C-Means (FCM) clustering named
BigFCM is proposed and designed for the Hadoop distributed data platform. Based
on the map-reduce programming model, it exploits several mechanisms including
an efficient caching design to achieve several orders of magnitude reduction in
execution time. Extensive evaluation over multi-gigabyte datasets shows that
BigFCM is scalable while it preserves the quality of clustering.
","[{'version': 'v1', 'created': 'Tue, 10 May 2016 15:04:01 GMT'}]",2018-11-26,"[['Ghadiri', 'Nasser', ''], ['Ghaffari', 'Meysam', ''], ['Nikbakht', 'Mohammad Amin', '']]","['Fuzzy clustering', 'Scalable Clustering', 'Hadoop clustering', 'Machine learning', 'MapReduce']"
5575,2202.06248,Lordjette Leigh Lecaros,Lordjette Leigh M. Lecaros and Concepcion L. Khan,"A Tech Hybrid-Recommendation Engine and Personalized Notification: An
  integrated tool to assist users through Recommendations (Project ATHENA)",15 pages,,10.25147/ijcsr.2017.001.1.81,"Vol. 6, pp. 925-939",cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Project ATHENA aims to develop an application to address information
overload, primarily focused on Recommendation Systems (RSs) with the
personalization and user experience design of a modern system. Two machine
learning (ML) algorithms were used: (1) TF-IDF for Content-based filtering
(CBF); (2) Classification with Matrix Factorization- Singular Value
Decomposition(SVD) applied with Collaborative filtering (CF) and mean
(normalization) for prediction accuracy of the CF. Data sampling in academic
Research and Development of Philippine Council for Agriculture, Aquatic, and
Natural Resources Research and Development (PCAARRD) e-Library and Project
SARAI publications plus simulated data used as training sets to generate a
recommendation of items that uses the three RS filtering (CF, CBF, and
personalized version of item recommendations). Series of Testing and TAM
performed and discussed. Findings allow users to engage in online information
and quickly evaluate retrieved items produced by the application.
Compatibility-testing (CoT) shows the application is compatible with all major
browsers and mobile-friendly. Performance-testing (PT) recommended v-parameter
specs and TAM evaluations results indicate strongly associated with overall
positive feedback, thoroughly enough to address the information-overload
problem as the core of the paper. A modular architecture presented addressing
the information overload, primarily focused on RSs with the personalization and
design of modern systems. Developers utilized Two ML algorithms and prototyped
a simplified version of the architecture. Series of testing (CoT and PT) and
evaluations with TAM were performed and discussed. Project ATHENA added a UX
feature design of a modern system.
","[{'version': 'v1', 'created': 'Sun, 13 Feb 2022 08:04:31 GMT'}]",2022-02-15,"[['Lecaros', 'Lordjette Leigh M.', ''], ['Khan', 'Concepcion L.', '']]","['content-based filtering', 'collaborative filtering', 'hybrid-recommendation system', 'machine learning algorithm   INTRODUCTION']"
5576,1710.04552,Jorn Reniers,"Jorn M. Reniers, Grietus Mulder, Sina Ober-Blobaum, David A. Howey","Improving optimal control of grid-connected lithium-ion batteries
  through more accurate battery and degradation modelling",,,10.1016/j.jpowsour.2018.01.004,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increased deployment of intermittent renewable energy generators opens up
opportunities for grid-connected energy storage. Batteries offer significant
flexibility but are relatively expensive at present. Battery lifetime is a key
factor in the business case, and it depends on usage, but most techno-economic
analyses do not account for this. For the first time, this paper quantifies the
annual benefits of grid-connected batteries including realistic physical
dynamics and nonlinear electrochemical degradation. Three lithium-ion battery
models of increasing realism are formulated, and the predicted degradation of
each is compared with a large-scale experimental degradation data set
(Mat4Bat). A respective improvement in RMS capacity prediction error from 11\%
to 5\% is found by increasing the model accuracy. The three models are then
used within an optimal control algorithm to perform price arbitrage over one
year, including degradation. Results show that the revenue can be increased
substantially while degradation can be reduced by using more realistic models.
The estimated best case profit using a sophisticated model is a 175%
improvement compared with the simplest model. This illustrates that using a
simplistic battery model in a techno-economic assessment of grid-connected
batteries might substantially underestimate the business case and lead to
erroneous conclusions.
","[{'version': 'v1', 'created': 'Thu, 12 Oct 2017 14:58:09 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Jan 2018 13:56:16 GMT'}, {'version': 'v3', 'created': 'Wed, 17 Jan 2018 09:45:36 GMT'}]",2018-02-21,"[['Reniers', 'Jorn M.', ''], ['Mulder', 'Grietus', ''], ['Ober-Blobaum', 'Sina', ''], ['Howey', 'David A.', '']]","['Lithium Ion', 'Degradation', 'Grid-connected Battery', 'Optimal control', 'Battery ageing', 'Battery']"
5577,2203.11766,Carlos Salvador Carbone Lorio,"Carlos Carbone, Dario Albani, Federico Magistri, Dimitri Ognibene,
  Cyrill Stachniss, Gert Kootstra, Daniele Nardi, and Vito Trianni","Monitoring and mapping of crop fields with UAV swarms based on
  information gain",,,10.1007/978-3-030-92790-5_24,,cs.RO,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Monitoring crop fields to map features like weeds can be efficiently
performed with unmanned aerial vehicles (UAVs) that can cover large areas in a
short time due to their privileged perspective and motion speed. However, the
need for high-resolution images for precise classification of features (e.g.,
detecting even the smallest weeds in the field) contrasts with the limited
payload and ight time of current UAVs. Thus, it requires several flights to
cover a large field uniformly. However, the assumption that the whole field
must be observed with the same precision is unnecessary when features are
heterogeneously distributed, like weeds appearing in patches over the field. In
this case, an adaptive approach that focuses only on relevant areas can perform
better, especially when multiple UAVs are employed simultaneously. Leveraging
on a swarm-robotics approach, we propose a monitoring and mapping strategy that
adaptively chooses the target areas based on the expected information gain,
which measures the potential for uncertainty reduction due to further
observations. The proposed strategy scales well with group size and leads to
smaller mapping errors than optimal pre-planned monitoring approaches.
","[{'version': 'v1', 'created': 'Tue, 22 Mar 2022 14:28:58 GMT'}]",2022-03-23,"[['Carbone', 'Carlos', ''], ['Albani', 'Dario', ''], ['Magistri', 'Federico', ''], ['Ognibene', 'Dimitri', ''], ['Stachniss', 'Cyrill', ''], ['Kootstra', 'Gert', ''], ['Nardi', 'Daniele', ''], ['Trianni', 'Vito', '']]","['swarm robotics', 'precision farming', 'information gain', 'UAV']"
5578,2110.08303,Liwei Guo,"Liwei Guo, Felix Xiaozhu Lin",Minimum Viable Device Drivers for ARM TrustZone,Eurosys 2022,,10.1145/3492321.3519565,,cs.OS cs.CR,http://creativecommons.org/licenses/by/4.0/,"  While TrustZone can isolate IO hardware, it lacks drivers for modern IO
devices. Rather than porting drivers, we propose a novel approach to deriving
minimum viable drivers: developers exercise a full driver and record the
driver/device interactions; the processed recordings, dubbed driverlets, are
replayed in the TEE at run time to access IO devices.
  Driverlets address two key challenges: correctness and expressiveness, for
which they build on a key construct called interaction template. The
interaction template ensures faithful reproduction of recorded IO jobs (albeit
on new IO data); it accepts dynamic input values; it tolerates nondeterministic
device behaviors.
  We demonstrate driverlets on a series of sophisticated devices, making them
accessible to TrustZone for the first time to our knowledge. Our experiments
show that driverlets are secure, easy to build, and incur acceptable overhead
(1.4x -2.7x compared to native drivers). Driverlets fill a critical gap in the
TrustZone TEE, realizing its long-promised vision of secure IO.
","[{'version': 'v1', 'created': 'Fri, 15 Oct 2021 18:22:10 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Mar 2022 15:50:04 GMT'}]",2022-03-16,"[['Guo', 'Liwei', ''], ['Lin', 'Felix Xiaozhu', '']]","['Operating systems', 'Security', 'Device Drivers', 'ArmTrustZone']"
5579,2006.09287,Daniele Ucci,"Daniele Ucci, Roberto Perdisci, Jaewoo Lee, Mustaque Ahamad","Building a Collaborative Phone Blacklisting System with Local
  Differential Privacy","15 pages, 10 figures, 7 algorithms",,10.1145/3427228.3427239,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spam phone calls have been rapidly growing from nuisance to an increasingly
effective scam delivery tool. To counter this increasingly successful attack
vector, a number of commercial smartphone apps that promise to block spam phone
calls have appeared on app stores, and are now used by hundreds of thousands or
even millions of users. However, following a business model similar to some
online social network services, these apps often collect call records or other
potentially sensitive information from users' phones with little or no formal
privacy guarantees.
  In this paper, we study whether it is possible to build a practical
collaborative phone blacklisting system that makes use of local differential
privacy (LDP) mechanisms to provide clear privacy guarantees. We analyze the
challenges and trade-offs related to using LDP, evaluate our LDP-based system
on real-world user-reported call records collected by the FTC, and show that it
is possible to learn a phone blacklist using a reasonable overall privacy
budget and at the same time preserve users' privacy while maintaining utility
for the learned blacklist.
","[{'version': 'v1', 'created': 'Tue, 16 Jun 2020 16:30:19 GMT'}]",2021-06-11,"[['Ucci', 'Daniele', ''], ['Perdisci', 'Roberto', ''], ['Lee', 'Jaewoo', ''], ['Ahamad', 'Mustaque', '']]","['Phone Spam', 'Collaborative Blacklisting', 'Local Differential Privacy']"
5580,2203.09578,Shiqing Wu,"Shiqing Wu, Weihua Li, Quan Bai","GAC: A Deep Reinforcement Learning Model Toward User Incentivization in
  Unknown Social Networks",Accepted by Knowledge-Based Systems,,10.1016/j.knosys.2022.110060,,cs.SI cs.AI,http://creativecommons.org/licenses/by/4.0/,"  In recent years, many applications have deployed incentive mechanisms to
promote users' attention and engagement. Most incentive mechanisms determine
specific incentive values based on users' attributes (e.g., preferences), while
such information is unavailable in many real-world applications. Meanwhile, due
to budget restrictions, realizing successful incentivization for all users can
be challenging to complete. In this light, we consider leveraging social
influence to maximize the incentivization result. We can directly incentivize
influential users to affect more users, so the cost of incentivizing these
users can be decreased. However, identifying influential users in a social
network requires complete information about influence strength among users,
which is impractical to acquire in real-world situations. In this research, we
propose an end-to-end reinforcement learning-based framework, called Geometric
Actor-Critic (GAC), to tackle the abovementioned problem. The proposed approach
can realize effective incentive allocation without having prior knowledge about
users' attributes. Three real-world social network datasets have been adopted
in the experiments to evaluate the performance of GAC. The experimental results
indicate that GAC can learn and apply effective incentive allocation policies
in unknown social networks and outperform existing incentive allocation
approaches.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2022 19:41:49 GMT'}, {'version': 'v2', 'created': 'Sun, 13 Nov 2022 06:33:03 GMT'}]",2022-11-15,"[['Wu', 'Shiqing', ''], ['Li', 'Weihua', ''], ['Bai', 'Quan', '']]","['Incentive Allocation', 'Reinforcement Learning', 'Unknown Social Network', 'Social Simulation']"
5581,1811.05659,Alexander Gribov,Alexander Gribov,"An Efficient Combinatorial Algorithm for Optimal Compression of a
  Polyline with Segments and Arcs","10 pages, 7 figures, extended abstract published at the conference","An Efficient Combinatorial Algorithm for Optimal Compression of a
  Polyline with Segments and Arcs, in 2017 14th IAPR International Conference
  on Document Analysis and Recognition (ICDAR), vol. 02, November 2017, pp. 7-8",10.1109/ICDAR.2017.251,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The task of finding the optimal compression of a polyline with straight-line
segments and arcs is performed in many applications, such as polyline
compression, noise filtering, and feature recognition. Optimal compression
algorithms find the best solution using the dynamic programming approach, which
requires a significant amount of arc fitting. This paper describes an
improvement to the dynamic programming approach by reducing the amount of arc
fitting necessary to find the optimal solution. Instead of processing from the
second to the last vertices in the dynamic programming approach, the algorithm
proceeds forward and skips as many steps as possible without affecting the
inference in any way. Such a modification extends the practical application of
the algorithm to polylines having arcs with a large number of vertices.
","[{'version': 'v1', 'created': 'Wed, 14 Nov 2018 06:03:53 GMT'}]",2018-11-15,"[['Gribov', 'Alexander', '']]","['dynamic programming', 'polyline compression', 'polyline approximation', 'arc fitting', 'generalization']"
5582,2107.02689,Armin Moin,"Armin Moin, Moharram Challenger, Atta Badii and Stephan G\""unnemann","A Model-Driven Approach to Machine Learning and Software Modeling for
  the IoT",Preliminary version,"Software and Systems Modeling, January 2022",10.1007/s10270-021-00967-x,,cs.SE cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Models are used in both Software Engineering (SE) and Artificial Intelligence
(AI). SE models may specify the architecture at different levels of abstraction
and for addressing different concerns at various stages of the software
development life-cycle, from early conceptualization and design, to
verification, implementation, testing and evolution. However, AI models may
provide smart capabilities, such as prediction and decision-making support. For
instance, in Machine Learning (ML), which is currently the most popular
sub-discipline of AI, mathematical models may learn useful patterns in the
observed data and can become capable of making predictions. The goal of this
work is to create synergy by bringing models in the said communities together
and proposing a holistic approach to model-driven software development for
intelligent systems that require ML. We illustrate how software models can
become capable of creating and dealing with ML models in a seamless manner. The
main focus is on the domain of the Internet of Things (IoT), where both ML and
model-driven SE play a key role. In the context of the need to take a
Cyber-Physical System-of-Systems perspective of the targeted architecture, an
integrated design environment for both SE and ML sub-systems would best support
the optimization and overall efficiency of the implementation of the resulting
system. In particular, we implement the proposed approach, called ML-Quadrat,
based on ThingML, and validate it using a case study from the IoT domain, as
well as through an empirical user evaluation. It transpires that the proposed
approach is not only feasible, but may also contribute to the performance leap
of software development for smart Cyber-Physical Systems (CPS) which are
connected to the IoT, as well as an enhanced user experience of the
practitioners who use the proposed modeling solution.
","[{'version': 'v1', 'created': 'Tue, 6 Jul 2021 15:50:50 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Nov 2021 14:16:45 GMT'}, {'version': 'v3', 'created': 'Tue, 23 Nov 2021 15:21:05 GMT'}]",2022-01-20,"[['Moin', 'Armin', ''], ['Challenger', 'Moharram', ''], ['Badii', 'Atta', ''], ['Günnemann', 'Stephan', '']]","['model-driven software engineering', 'domain-specific modeling', 'analytics modeling', 'machine learning', 'internet of things', 'cyber-physicalsystems']"
5583,2110.05529,Shreshth Tuli,"Shreshth Tuli, Sukhpal Singh Gill, Minxian Xu, Peter Garraghan, Rami
  Bahsoon, Schahram Dustdar, Rizos Sakellariou, Omer Rana, Rajkumar Buyya,
  Giuliano Casale and Nicholas R. Jennings","HUNTER: AI based Holistic Resource Management for Sustainable Cloud
  Computing","Accepted in Elsevier Journal of Systems and Software, 2021",,10.1016/j.jss.2021.111124,,cs.DC cs.LG cs.PF,http://creativecommons.org/licenses/by/4.0/,"  The worldwide adoption of cloud data centers (CDCs) has given rise to the
ubiquitous demand for hosting application services on the cloud. Further,
contemporary data-intensive industries have seen a sharp upsurge in the
resource requirements of modern applications. This has led to the provisioning
of an increased number of cloud servers, giving rise to higher energy
consumption and, consequently, sustainability concerns. Traditional heuristics
and reinforcement learning based algorithms for energy-efficient cloud resource
management address the scalability and adaptability related challenges to a
limited extent. Existing work often fails to capture dependencies across
thermal characteristics of hosts, resource consumption of tasks and the
corresponding scheduling decisions. This leads to poor scalability and an
increase in the compute resource requirements, particularly in environments
with non-stationary resource demands. To address these limitations, we propose
an artificial intelligence (AI) based holistic resource management technique
for sustainable cloud computing called HUNTER. The proposed model formulates
the goal of optimizing energy efficiency in data centers as a multi-objective
scheduling problem, considering three important models: energy, thermal and
cooling. HUNTER utilizes a Gated Graph Convolution Network as a surrogate model
for approximating the Quality of Service (QoS) for a system state and
generating optimal scheduling decisions. Experiments on simulated and physical
cloud environments using the CloudSim toolkit and the COSCO framework show that
HUNTER outperforms state-of-the-art baselines in terms of energy consumption,
SLA violation, scheduling time, cost and temperature by up to 12, 35, 43, 54
and 3 percent respectively.
","[{'version': 'v1', 'created': 'Mon, 11 Oct 2021 18:11:26 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Oct 2021 21:07:15 GMT'}, {'version': 'v3', 'created': 'Thu, 28 Oct 2021 11:21:40 GMT'}]",2021-10-29,"[['Tuli', 'Shreshth', ''], ['Gill', 'Sukhpal Singh', ''], ['Xu', 'Minxian', ''], ['Garraghan', 'Peter', ''], ['Bahsoon', 'Rami', ''], ['Dustdar', 'Schahram', ''], ['Sakellariou', 'Rizos', ''], ['Rana', 'Omer', ''], ['Buyya', 'Rajkumar', ''], ['Casale', 'Giuliano', ''], ['Jennings', 'Nicholas R.', '']]","['Holistic Resource Management', 'Energy-Efficiency', 'Cloud Computing', 'Artificial Intelligence', 'Thermal Management']"
5584,2105.00336,M Tanveer PhD,M. Tanveer and T. Rajani and R. Rastogi and Y.H. Shao and M. A. Ganaie,Comprehensive Review On Twin Support Vector Machines,,"Annals of Operations Research, Springer (2022) 1-46",10.1007/s10479-022-04575-w,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Twin support vector machine (TWSVM) and twin support vector regression (TSVR)
are newly emerging efficient machine learning techniques which offer promising
solutions for classification and regression challenges respectively. TWSVM is
based upon the idea to identify two nonparallel hyperplanes which classify the
data points to their respective classes. It requires to solve two small sized
quadratic programming problems (QPPs) in lieu of solving single large size QPP
in support vector machine (SVM) while TSVR is formulated on the lines of TWSVM
and requires to solve two SVM kind problems. Although there has been good
research progress on these techniques; there is limited literature on the
comparison of different variants of TSVR. Thus, this review presents a rigorous
analysis of recent research in TWSVM and TSVR simultaneously mentioning their
limitations and advantages. To begin with we first introduce the basic theory
of support vector machine, TWSVM and then focus on the various improvements and
applications of TWSVM, and then we introduce TSVR and its various enhancements.
Finally, we suggest future research and development prospects.
","[{'version': 'v1', 'created': 'Sat, 1 May 2021 19:48:45 GMT'}, {'version': 'v2', 'created': 'Sat, 6 Nov 2021 07:55:42 GMT'}, {'version': 'v3', 'created': 'Fri, 18 Mar 2022 11:26:09 GMT'}]",2022-03-21,"[['Tanveer', 'M.', ''], ['Rajani', 'T.', ''], ['Rastogi', 'R.', ''], ['Shao', 'Y. H.', ''], ['Ganaie', 'M. A.', '']]","['Machine learning', 'Twin support vector machines (SVM)', 'twinSVM', 'survey of twin SVM', 'review of twin SVM', 'Classification', 'Regression', 'Clustering']"
5585,2108.09104,Jizhou Huang,"Yibo Sun, Jizhou Huang, Chunyuan Yuan, Miao Fan, Haifeng Wang, Ming
  Liu, Bing Qin","GEDIT: Geographic-Enhanced and Dependency-Guided Tagging for Joint POI
  and Accessibility Extraction at Baidu Maps",Accepted by CIKM'21,,10.1145/3459637.3481924,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Providing timely accessibility reminders of a point-of-interest (POI) plays a
vital role in improving user satisfaction of finding places and making visiting
decisions. However, it is difficult to keep the POI database in sync with the
real-world counterparts due to the dynamic nature of business changes. To
alleviate this problem, we formulate and present a practical solution that
jointly extracts POI mentions and identifies their coupled accessibility labels
from unstructured text. We approach this task as a sequence tagging problem,
where the goal is to produce <POI name, accessibility label> pairs from
unstructured text. This task is challenging because of two main issues: (1) POI
names are often newly-coined words so as to successfully register new entities
or brands and (2) there may exist multiple pairs in the text, which
necessitates dealing with one-to-many or many-to-one mapping to make each POI
coupled with its accessibility label. To this end, we propose a
Geographic-Enhanced and Dependency-guIded sequence Tagging (GEDIT) model to
concurrently address the two challenges. First, to alleviate challenge #1, we
develop a geographic-enhanced pre-trained model to learn the text
representations. Second, to mitigate challenge #2, we apply a relational graph
convolutional network to learn the tree node representations from the parsed
dependency tree. Finally, we construct a neural sequence tagging model by
integrating and feeding the previously pre-learned representations into a CRF
layer. Extensive experiments conducted on a real-world dataset demonstrate the
superiority and effectiveness of GEDIT. In addition, it has already been
deployed in production at Baidu Maps. Statistics show that the proposed
solution can save significant human effort and labor costs to deal with the
same amount of documents, which confirms that it is a practical way for POI
accessibility maintenance.
","[{'version': 'v1', 'created': 'Fri, 20 Aug 2021 10:55:48 GMT'}]",2021-08-23,"[['Sun', 'Yibo', ''], ['Huang', 'Jizhou', ''], ['Yuan', 'Chunyuan', ''], ['Fan', 'Miao', ''], ['Wang', 'Haifeng', ''], ['Liu', 'Ming', ''], ['Qin', 'Bing', '']]","['joint POI and accessibility extraction', 'geographic-enhanced sequence tagging', 'pre-trained model', 'Baidu Maps']"
5586,2103.13742,Luigi Brugnano,"Pierluigi Amodio, Luigi Brugnano, Filippo Scarselli","Implementation of the PaperRank and AuthorRank indices in the Scopus
  database","20 pages, 3 figures, 4 tables. Accepted version on Journal of
  Infometrics",Journal of Informetrics 15 (2021) 101206,10.1016/j.joi.2021.101206,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We implement the PaperRank and AuthorRank indices introduced in [Amodio &
Brugnano, 2014] in the Scopus database, in order to highlight quantitative and
qualitative information that the bare number of citations and/or the h-index of
an author are unable to provide. In addition to this, the new indices can be
cheaply updated in Scopus, since this has a cost comparable to that of updating
the number of citations. Some examples are reported to provide insight in their
potentialities, as well as possible extensions.
","[{'version': 'v1', 'created': 'Thu, 25 Mar 2021 10:45:37 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Aug 2021 08:43:50 GMT'}]",2022-09-26,"[['Amodio', 'Pierluigi', ''], ['Brugnano', 'Luigi', ''], ['Scarselli', 'Filippo', '']]","['bibliometric index', 'PaperRank', 'AuthorRank', 'Scopus database', 'number of citations', 'h-index']"
5587,2004.11575,Jan Vykopal,"Pavel \v{C}eleda, Jan Vykopal, Valdemar \v{S}v\'abensk\'y, Karel
  Slav\'i\v{c}ek","KYPO4INDUSTRY: A Testbed for Teaching Cybersecurity of Industrial
  Control Systems","ACM SIGCSE 2020 conference, 7 pages, 5 figures, 1 table",,10.1145/3328778.3366908,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are different requirements on cybersecurity of industrial control
systems and information technology systems. This fact exacerbates the global
issue of hiring cybersecurity employees with relevant skills. In this paper, we
present KYPO4INDUSTRY training facility and a course syllabus for beginner and
intermediate computer science students to learn cybersecurity in a simulated
industrial environment. The training facility is built using open-source
hardware and software and provides reconfigurable modules of industrial control
systems. The course uses a flipped classroom format with hands-on projects: the
students create educational games that replicate real cyber attacks. Throughout
the semester, they learn to understand the risks and gain capabilities to
respond to cyber attacks that target industrial control systems. Our described
experience from the design of the testbed and its usage can help any educator
interested in teaching cybersecurity of cyber-physical systems.
","[{'version': 'v1', 'created': 'Fri, 24 Apr 2020 07:30:38 GMT'}]",2020-04-27,"[['Čeleda', 'Pavel', ''], ['Vykopal', 'Jan', ''], ['Švábenský', 'Valdemar', ''], ['Slavíček', 'Karel', '']]","['training facility', 'modular testbed', 'cyber-physical systems', 'industrialcontrol systems', 'ICS', 'SCADA', 'cybersecurity education', 'syllabus']"
5588,2106.09440,Wuqi Zhang,"Wuqi Zhang, Lili Wei, Shuqing Li, Yepang Liu, Shing-Chi Cheung","{\DH}Archer: Detecting On-Chain-Off-Chain Synchronization Bugs in
  Decentralized Applications","Accepted by the 29th ACM Joint European Software Engineering
  Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE
  2021)",,10.1145/3468264.3468546,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Since the emergence of Ethereum, blockchain-based decentralized applications
(DApps) have become increasingly popular and important. To balance the
security, performance, and costs, a DApp typically consists of two layers: an
on-chain layer to execute transactions and store crucial data on the blockchain
and an off-chain layer to interact with users. A DApp needs to synchronize its
off-chain layer with the on-chain layer proactively. Otherwise, the
inconsistent data in the off-chain layer could mislead users and cause
undesirable consequences, e.g., loss of transaction fees. However, transactions
sent to the blockchain are not guaranteed to be executed and could even be
reversed after execution due to chain reorganization. Such non-determinism in
the transaction execution is unique to blockchain. DApp developers may fail to
perform the on-chain-off-chain synchronization accurately due to their lack of
familiarity with the complex transaction lifecycle. In this work, we
investigate the challenges of synchronizing on-chain and off-chain data in
Ethereum-based DApps. We present two types of bugs that could result in
inconsistencies between the on-chain and off-chain layers. To help detect such
on-chain-off-chain synchronization bugs, we introduce a state transition model
to guide the testing of DApps and propose two effective oracles to facilitate
the automatic identification of bugs. We build the first testing framework,
DArcher, to detect on-chain-off-chain synchronization bugs in DApps. We have
evaluated DArcher on 11 popular real-world DApps. DArcher achieves high
precision (99.3%), recall (87.6%), and accuracy (89.4%) in bug detection and
significantly outperforms the baseline methods. It has found 15 real bugs in
the 11 DApps. So far, six of the 15 bugs have been confirmed by the developers,
and three have been fixed. These promising results demonstrate the usefulness
of DArcher.
","[{'version': 'v1', 'created': 'Thu, 17 Jun 2021 12:43:11 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Sep 2021 07:12:08 GMT'}]",2021-09-08,"[['Zhang', 'Wuqi', ''], ['Wei', 'Lili', ''], ['Li', 'Shuqing', ''], ['Liu', 'Yepang', ''], ['Cheung', 'Shing-Chi', '']]","['Software testing', 'Decentralized applications', 'DApps', 'Blockchain']"
5589,2012.03750,Paul Maxwell,"Paul Maxwell, David Niblick, and Daniel C. Ruiz","Using Side Channel Information and Artificial Intelligence for Malware
  Detection",7 pages,"2021 IEEE International Conference on Artificial Intelligence and
  Computer Applications (ICAICA)",10.1109/ICAICA52286.2021.9498094,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Cybersecurity continues to be a difficult issue for society especially as the
number of networked systems grows. Techniques to protect these systems range
from rules-based to artificial intelligence-based intrusion detection systems
and anti-virus tools. These systems rely upon the information contained in the
network packets and download executables to function. Side channel information
leaked from hardware has been shown to reveal secret information in systems
such as encryption keys. This work demonstrates that side channel information
can be used to detect malware running on a computing platform without access to
the code involved.
","[{'version': 'v1', 'created': 'Thu, 3 Dec 2020 18:38:53 GMT'}]",2022-05-10,"[['Maxwell', 'Paul', ''], ['Niblick', 'David', ''], ['Ruiz', 'Daniel C.', '']]","['artificial intelligence', 'side channel analysis', 'malware', 'cybersecurity']"
5590,1905.06975,\'Italo Assis,"\'Italo A. S. Assis, Jo\~ao B. Fernandes, Tiago Barros, Samuel
  Xavier-de-Souza","Auto-tuning of dynamic scheduling applied to 3D reverse time migration
  on multicore systems",,,10.1109/ACCESS.2020.3015045,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reverse time migration (RTM) is an algorithm widely used in the oil and gas
industry to process seismic data. It is a computationally intensive task that
suits well in parallel computers. Methods such as RTM can be parallelized in
shared memory systems through scheduling iterations of parallel loops to
threads. However, several aspects, such as memory size and hierarchy, number of
cores, and input size, make optimal scheduling very challenging. In this paper,
we introduce a run-time strategy to automatically tune the dynamic scheduling
of parallel loops iterations in iterative applications, such as the RTM, in
multicore systems. The proposed method aims to reduce the execution time of
such applications. To find the optimal granularity, we propose a coupled
simulated annealing (CSA) based auto-tuning strategy that adjusts the chunk
size of work that OpenMP parallel loops assign dynamically to worker threads
during the initialization of a 3D RTM application. Experiments performed with
different computational systems and input sizes show that the proposed method
is consistently better than the default OpenMP schedulers, static, auto, and
guided, causing the application to be up to 33% faster. We show that the
possible reason for this performance is the reduction of cache misses, mainly
level L3, and low overhead, inferior to 2%. Having shown to be robust and
scalable for the 3D RTM, the proposed method could also improve the performance
of similar wave-based algorithms, such as full-waveform inversion (FWI) and
other iterative applications.
","[{'version': 'v1', 'created': 'Thu, 16 May 2019 18:04:05 GMT'}, {'version': 'v2', 'created': 'Sun, 5 Jul 2020 20:23:45 GMT'}]",2020-08-14,"[['Assis', 'Ítalo A. S.', ''], ['Fernandes', 'João B.', ''], ['Barros', 'Tiago', ''], ['Xavier-de-Souza', 'Samuel', '']]","['Auto-tuning', 'Coupled simulated annealing', 'Reverse time migration', 'OpenMP', 'Dynamic scheduling']"
5591,2103.12532,Quentin Jodelet,"Quentin Jodelet, Xin Liu and Tsuyoshi Murata","Balanced softmax cross-entropy for incremental learning with and without
  memory","Journal extension of the ICANN 2021 paper (arXiv:2103.12532v3),
  published in Computer Vision and Image Understanding",,10.1016/j.cviu.2022.103582,,cs.LG cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  When incrementally trained on new classes, deep neural networks are subject
to catastrophic forgetting which leads to an extreme deterioration of their
performance on the old classes while learning the new ones. Using a small
memory containing few samples from past classes has shown to be an effective
method to mitigate catastrophic forgetting. However, due to the limited size of
the replay memory, there is a large imbalance between the number of samples for
the new and the old classes in the training dataset resulting in bias in the
final model. To address this issue, we propose to use the Balanced Softmax
Cross-Entropy and show that it can be seamlessly combined with state-of-the-art
approaches for class-incremental learning in order to improve their accuracy
while also potentially decreasing the computational cost of the training
procedure. We further extend this approach to the more demanding
class-incremental learning without memory setting and achieve competitive
results with memory-based approaches. Experiments on the challenging ImageNet,
ImageNet-Subset and CIFAR100 benchmarks with various settings demonstrate the
benefits of our approach.
","[{'version': 'v1', 'created': 'Tue, 23 Mar 2021 13:30:26 GMT'}, {'version': 'v2', 'created': 'Wed, 31 Mar 2021 10:05:32 GMT'}, {'version': 'v3', 'created': 'Tue, 28 Dec 2021 11:58:17 GMT'}, {'version': 'v4', 'created': 'Wed, 9 Feb 2022 06:39:34 GMT'}, {'version': 'v5', 'created': 'Mon, 14 Nov 2022 07:27:58 GMT'}]",2022-11-15,"[['Jodelet', 'Quentin', ''], ['Liu', 'Xin', ''], ['Murata', 'Tsuyoshi', '']]","['Continual Learning', 'Class Incremental Learning', 'Image Classification', 'Bias Mitigation']"
5592,2210.02826,Stephan Krenn,"Stephan Krenn and Thomas Lor\""unser",Single-Use Delegatable Signatures Based on Smart Contracts,"The 16th International Workshop on Frontiers in Availability,
  Reliability and Security (FARES 2021)",,10.1145/3465481.3469192,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Delegation of cryptographic signing rights has found many application in the
literature and the real world. However, despite very advanced functionalities
and specific use cases, existing solutions share the natural limitation that
the number of usages of these signing rights cannot be efficiently limited, but
users can at most be disincentivized to abuse their rights.
  In this paper, we suggest a solution to this problem based on blockchains. We
let a user define a smart contract defining delegated signing rights, which
needs to be triggered to successfully sign a message. By leveraging the
immutability of the blockchain, our construction can now guarantee that a
user-defined threshold of signature invocations cannot be exceeded, thereby
circumventing the need for dedicated hardware or similar assistance in existing
constructions for one-time programs.
  We discuss different constructions supporting different features, and provide
concrete implementations in the Solidity language of the Ethereum blockchain,
proving the real-world efficiency and feasibility of our construction.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2022 11:33:31 GMT'}]",2022-10-07,"[['Krenn', 'Stephan', ''], ['Lorünser', 'Thomas', '']]","['Delegatable signatures', 'one-time programs', 'smart contracts']"
5593,2111.06636,Xili Dai,"Xili Dai, Shengbang Tong, Mingyang Li, Ziyang Wu, Michael Psenka, Kwan
  Ho Ryan Chan, Pengyuan Zhai, Yaodong Yu, Xiaojun Yuan, Heung Yeung Shum, Yi
  Ma",Closed-Loop Data Transcription to an LDR via Minimaxing Rate Reduction,41 pages,,10.3390/e24040456,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work proposes a new computational framework for learning a structured
generative model for real-world datasets. In particular, we propose to learn a
closed-loop transcription between a multi-class multi-dimensional data
distribution and a linear discriminative representation (LDR) in the feature
space that consists of multiple independent multi-dimensional linear subspaces.
In particular, we argue that the optimal encoding and decoding mappings sought
can be formulated as the equilibrium point of a two-player minimax game between
the encoder and decoder. A natural utility function for this game is the
so-called rate reduction, a simple information-theoretic measure for distances
between mixtures of subspace-like Gaussians in the feature space. Our
formulation draws inspiration from closed-loop error feedback from control
systems and avoids expensive evaluating and minimizing approximated distances
between arbitrary distributions in either the data space or the feature space.
To a large extent, this new formulation unifies the concepts and benefits of
Auto-Encoding and GAN and naturally extends them to the settings of learning a
both discriminative and generative representation for multi-class and
multi-dimensional real-world data. Our extensive experiments on many benchmark
imagery datasets demonstrate tremendous potential of this new closed-loop
formulation: under fair comparison, visual quality of the learned decoder and
classification performance of the encoder is competitive and often better than
existing methods based on GAN, VAE, or a combination of both. Unlike existing
generative models, the so learned features of the multiple classes are
structured: different classes are explicitly mapped onto corresponding
independent principal subspaces in the feature space. Source code can be found
at https://github.com/Delay-Xili/LDR.
","[{'version': 'v1', 'created': 'Fri, 12 Nov 2021 10:06:08 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Mar 2022 08:02:29 GMT'}, {'version': 'v3', 'created': 'Thu, 3 Mar 2022 07:13:43 GMT'}]",2022-04-06,"[['Dai', 'Xili', ''], ['Tong', 'Shengbang', ''], ['Li', 'Mingyang', ''], ['Wu', 'Ziyang', ''], ['Psenka', 'Michael', ''], ['Chan', 'Kwan Ho Ryan', ''], ['Zhai', 'Pengyuan', ''], ['Yu', 'Yaodong', ''], ['Yuan', 'Xiaojun', ''], ['Shum', 'Heung Yeung', ''], ['Ma', 'Yi', '']]","['data transcription', 'linear discriminative representation', 'rate reduction', 'minimax game', 'closed-loop feedback']"
5594,2002.05983,Hamid Reza Zohouri,"Hamid Reza Zohouri, Artur Podobas, Satoshi Matsuoka",High-Performance High-Order Stencil Computation on FPGAs Using OpenCL,"Published at RAW'18: 25th Anniversary of Reconfigurable Architectures
  Workshop held in conjunction with IPDPS'18",,10.1109/IPDPSW.2018.00027,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we evaluate the performance of FPGAs for high-order stencil
computation using High-Level Synthesis. We show that despite the higher
computation intensity and on-chip memory requirement of such stencils compared
to first-order ones, our design technique with combined spatial and temporal
blocking remains effective. This allows us to reach similar, or even higher,
compute performance compared to first-order stencils. We use an OpenCL-based
design that, apart from parameterizing performance knobs, also parameterizes
the stencil radius. Furthermore, we show that our performance model exhibits
the same accuracy as first-order stencils in predicting the performance of
high-order ones. On an Intel Arria 10 GX 1150 device, for 2D and 3D star-shaped
stencils, we achieve over 700 and 270 GFLOP/s of compute performance,
respectively, up to a stencil radius of four. These results outperform the
state-of-the-art YASK framework on a modern Xeon for 2D and 3D stencils, and
outperform a modern Xeon Phi for 2D stencils, while achieving competitive
performance in 3D. Furthermore, our FPGA design achieves better power
efficiency in almost all cases.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 11:54:34 GMT'}]",2020-02-17,"[['Zohouri', 'Hamid Reza', ''], ['Podobas', 'Artur', ''], ['Matsuoka', 'Satoshi', '']]","['FPGA', 'OpenCL', 'High-Order Stencil']"
5595,2108.05317,Qingyao Ai,"Qingyao Ai, Lakshmi Narayanan Ramasamy","Model-agnostic vs. Model-intrinsic Interpretability for Explainable
  Product Search",,,10.1145/3459637.3482276,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Product retrieval systems have served as the main entry for customers to
discover and purchase products online. With increasing concerns on the
transparency and accountability of AI systems, studies on explainable
information retrieval has received more and more attention in the research
community. Interestingly, in the domain of e-commerce, despite the extensive
studies on explainable product recommendation, the studies of explainable
product search is still in an early stage. In this paper, we study how to
construct effective explainable product search by comparing model-agnostic
explanation paradigms with model-intrinsic paradigms and analyzing the
important factors that determine the performance of product search
explanations. We propose an explainable product search model with
model-intrinsic interpretability and conduct crowdsourcing to compare it with
the state-of-the-art explainable product search model with model-agnostic
interpretability. We observe that both paradigms have their own advantages and
the effectiveness of search explanations on different properties are affected
by different factors. For example, explanation fidelity is more important for
user's overall satisfaction on the system while explanation novelty may be more
useful in attracting user purchases. These findings could have important
implications for the future studies and design of explainable product search
engines.
","[{'version': 'v1', 'created': 'Wed, 11 Aug 2021 16:54:05 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Aug 2021 15:50:02 GMT'}]",2021-08-18,"[['Ai', 'Qingyao', ''], ['Ramasamy', 'Lakshmi Narayanan', '']]","['Product Search', 'Attention Mechanism', 'Search Explanation']"
5596,1707.00445,David Sanchez,"David S\'anchez, Montserrat Batet","Privacy-preserving data outsourcing in the cloud via semantic data
  splitting",,"Computer Communications, Volume 110, Pages 187-201 (15 September
  2017)",10.1016/j.comcom.2017.06.012,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Even though cloud computing provides many intrinsic benefits, privacy
concerns related to the lack of control over the storage and management of the
outsourced data still prevent many customers from migrating to the cloud.
Several privacy-protection mechanisms based on a prior encryption of the data
to be outsourced have been proposed. Data encryption offers robust security,
but at the cost of hampering the efficiency of the service and limiting the
functionalities that can be applied over the (encrypted) data stored on cloud
premises. Because both efficiency and functionality are crucial advantages of
cloud computing, in this paper we aim at retaining them by proposing a
privacy-protection mechanism that relies on splitting (clear) data, and on the
distributed storage offered by the increasingly popular notion of multi-clouds.
We propose a semantically-grounded data splitting mechanism that is able to
automatically detect pieces of data that may cause privacy risks and split them
on local premises, so that each chunk does not incur in those risks; then,
chunks of clear data are independently stored into the separate locations of a
multi-cloud, so that external entities cannot have access to the whole
confidential data. Because partial data are stored in clear on cloud premises,
outsourced functionalities are seamlessly and efficiently supported by just
broadcasting queries to the different cloud locations. To enforce a robust
privacy notion, our proposal relies on a privacy model that offers a priori
privacy guarantees; to ensure its feasibility, we have designed heuristic
algorithms that minimize the number of cloud storage locations we need; to show
its potential and generality, we have applied it to the least structured and
most challenging data type: plain textual documents.
","[{'version': 'v1', 'created': 'Mon, 3 Jul 2017 08:49:20 GMT'}]",2017-07-07,"[['Sánchez', 'David', ''], ['Batet', 'Montserrat', '']]","['data outsourcing', 'multi-cloud', 'privacy protection', 'data splitting', 'semantics']"
5597,2203.02461,Laura Bocchi,"Laura Bocchi (University of Kent, UK), Dominic Orchard (University of
  Kent, UK / University of Cambridge, UK), A. Laura Voinea (University of
  Glasgow, UK)",A Theory of Composing Protocols,,"The Art, Science, and Engineering of Programming, 2023, Vol. 7,
  Issue 2, Article 6",10.22152/programming-journal.org/2023/7/6,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In programming, protocols are everywhere. Protocols describe the pattern of
interaction (or communication) between software systems, for example, between a
user-space program and the kernel or between a local application and an online
service. Ensuring conformance to protocols avoids a significant class of
software errors. Subsequently, there has been a lot of work on verifying code
against formal protocol specifications. The pervading approaches focus on
distributed settings involving parallel composition of processes within a
single monolithic protocol description. However we observe that, at the level
of a single thread/process, modern software must often implement a number of
clearly delineated protocols at the same time which become dependent on each
other, e.g., a banking API and one or more authentication protocols. Rather
than plugging together modular protocol-following components, the code must
re-integrate multiple protocols into a single component.
  We address this concern of combining protocols via a novel notion of
'interleaving' composition for protocols described via a process algebra.
User-specified, domain-specific constraints can be inserted into the individual
protocols to serve as 'contact points' to guide this composition procedure,
which outputs a single combined protocol that can be programmed against. Our
approach allows an engineer to then program against a number of protocols that
have been composed (re-integrated), reflecting the true nature of applications
that must handle multiple protocols at once.
  We prove various desirable properties of the composition, including behaviour
preservation: that the composed protocol implements the behaviour of both
component protocols. We demonstrate our approach in the practical setting of
Erlang, with a tool implementing protocol composition that both generates
Erlang code from a protocol and generates a protocol from Erlang code. This
tool shows that, for a range of sample protocols (including real-world
examples), a modest set of constraints can be inserted to produce a small
number of candidate compositions to choose from.
  As we increasingly build software interacting with many programs and
subsystems, this new perspective gives a foundation for improving software
quality via protocol conformance in a multi-protocol setting.
","[{'version': 'v1', 'created': 'Fri, 4 Mar 2022 17:47:11 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Nov 2022 13:01:34 GMT'}]",2022-11-08,"[['Bocchi', 'Laura', '', 'University of Kent, UK'], ['Orchard', 'Dominic', '', 'University of\n  Kent, UK / University of Cambridge, UK'], ['Voinea', 'A. Laura', '', 'University of\n  Glasgow, UK']]","['Distributed protocols', 'Composition', 'Engineering', 'Process-calculi']"
5598,2110.01009,Zhiling Zhang,"Zhiling Zhang, Zelin Zhou, Haifeng Tang, Guangwei Li, Mengyue Wu,
  Kenny Q. Zhu","Enriching Ontology with Temporal Commonsense for Low-Resource Audio
  Tagging",CIKM 2021,,10.1145/3459637.3482097,,cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Audio tagging aims at predicting sound events occurred in a recording.
Traditional models require enormous laborious annotations, otherwise
performance degeneration will be the norm. Therefore, we investigate robust
audio tagging models in low-resource scenarios with the enhancement of
knowledge graphs. Besides existing ontological knowledge, we further propose a
semi-automatic approach that can construct temporal knowledge graphs on diverse
domain-specific label sets. Moreover, we leverage a variant of relation-aware
graph neural network, D-GCN, to combine the strength of the two knowledge
types. Experiments on AudioSet and SONYC urban sound tagging datasets suggest
the effectiveness of the introduced temporal knowledge, and the advantage of
the combined KGs with D-GCN over single knowledge source.
","[{'version': 'v1', 'created': 'Sun, 3 Oct 2021 14:19:56 GMT'}]",2021-10-05,"[['Zhang', 'Zhiling', ''], ['Zhou', 'Zelin', ''], ['Tang', 'Haifeng', ''], ['Li', 'Guangwei', ''], ['Wu', 'Mengyue', ''], ['Zhu', 'Kenny Q.', '']]","['Audio Tagging', 'Low-Resource', 'Graph Neural Network', 'KnowledgeGraph']"
5599,2104.05432,Nils Gumpfer,"Michael Guckert, Nils Gumpfer, Jennifer Hannig, Till Keller and Neil
  Urquhart","A Conceptual Framework for Establishing Trust in Real World Intelligent
  Systems",,,10.1016/j.cogsys.2021.04.001,,cs.CY cs.AI cs.GT cs.HC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intelligent information systems that contain emergent elements often
encounter trust problems because results do not get sufficiently explained and
the procedure itself can not be fully retraced. This is caused by a control
flow depending either on stochastic elements or on the structure and relevance
of the input data. Trust in such algorithms can be established by letting users
interact with the system so that they can explore results and find patterns
that can be compared with their expected solution. Reflecting features and
patterns of human understanding of a domain against algorithmic results can
create awareness of such patterns and may increase the trust that a user has in
the solution. If expectations are not met, close inspection can be used to
decide whether a solution conforms to the expectations or whether it goes
beyond the expected. By either accepting or rejecting a solution, the user's
set of expectations evolves and a learning process for the users is
established. In this paper we present a conceptual framework that reflects and
supports this process. The framework is the result of an analysis of two
exemplary case studies from two different disciplines with information systems
that assist experts in their complex tasks.
","[{'version': 'v1', 'created': 'Mon, 12 Apr 2021 12:58:47 GMT'}]",2021-04-30,"[['Guckert', 'Michael', ''], ['Gumpfer', 'Nils', ''], ['Hannig', 'Jennifer', ''], ['Keller', 'Till', ''], ['Urquhart', 'Neil', '']]","['Intelligent Systems', 'AI', 'Trust', 'Explainable AI', 'Knowledge Management', 'Knowledge Patterns']"
5600,2207.11677,Mang Ye,"Junwu Zhang, Mang Ye, Yao Yang",Learnable Privacy-Preserving Anonymization for Pedestrian Images,Accepted by ACMMM2022 \url{https://github.com/whuzjw/privacy-reid},,10.1145/3503161.3548766,,cs.CV cs.MM,http://creativecommons.org/licenses/by/4.0/,"  This paper studies a novel privacy-preserving anonymization problem for
pedestrian images, which preserves personal identity information (PII) for
authorized models and prevents PII from being recognized by third parties.
Conventional anonymization methods unavoidably cause semantic information loss,
leading to limited data utility. Besides, existing learned anonymization
techniques, while retaining various identity-irrelevant utilities, will change
the pedestrian identity, and thus are unsuitable for training robust
re-identification models. To explore the privacy-utility trade-off for
pedestrian images, we propose a joint learning reversible anonymization
framework, which can reversibly generate full-body anonymous images with little
performance drop on person re-identification tasks. The core idea is that we
adopt desensitized images generated by conventional methods as the initial
privacy-preserving supervision and jointly train an anonymization encoder with
a recovery decoder and an identity-invariant model. We further propose a
progressive training strategy to improve the performance, which iteratively
upgrades the initial anonymization supervision. Experiments further demonstrate
the effectiveness of our anonymized pedestrian images for privacy protection,
which boosts the re-identification performance while preserving privacy. Code
is available at \url{https://github.com/whuzjw/privacy-reid}.
","[{'version': 'v1', 'created': 'Sun, 24 Jul 2022 07:04:16 GMT'}]",2022-07-26,"[['Zhang', 'Junwu', ''], ['Ye', 'Mang', ''], ['Yang', 'Yao', '']]","['pedestrian image', 'privacy protection', 'person re-identification']"
5601,2111.09872,Dimitrios Miltiadou,"Dimitrios Miltiadou (1), Stamatis Pitsios (1), Dimitrios Spyropoulos
  (1), Dimitrios Alexandrou (1), Fenareti Lampathaki (2), Domenico Messina (3),
  Konstantinos Perakis (1) ((1) UBITECH, (2) Suite5, (3) ENGINEERING Ingegneria
  Informatica S.p.A.)","A big data intelligence marketplace and secure analytics experimentation
  platform for the aviation industry",,"LNICST (2021), volume 371, pp 48-62",10.1007/978-3-030-72802-1_4,,cs.CR cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The unprecedented volume, diversity and richness of aviation data that can be
acquired, generated, stored, and managed provides unique capabilities for the
aviation-related industries and pertains value that remains to be unlocked with
the adoption of the innovative Big Data Analytics technologies. Despite the
large efforts and investments on research and innovation, the Big Data
technologies introduce a number of challenges to its adopters. Besides the
effective storage and access to the underlying big data, efficient data
integration and data interoperability should be considered, while at the same
time multiple data sources should be effectively combined by performing data
exchange and data sharing between the different stakeholders. However, this
reveals additional challenges for the crucial preservation of the information
security of the collected data, the trusted and secure data exchange and data
sharing, as well as the robust data access control. The current paper aims to
introduce the ICARUS big data-enabled platform that aims provide a multi-sided
platform that offers a novel aviation data and intelligence marketplace
accompanied by a trusted and secure analytics workspace. It holistically
handles the complete big data lifecycle from the data collection, data curation
and data exploration to the data integration and data analysis of data
originating from heterogeneous data sources with different velocity, variety
and volume in a trusted and secure manner.
","[{'version': 'v1', 'created': 'Thu, 18 Nov 2021 18:51:40 GMT'}]",2021-11-19,"[['Miltiadou', 'Dimitrios', ''], ['Pitsios', 'Stamatis', ''], ['Spyropoulos', 'Dimitrios', ''], ['Alexandrou', 'Dimitrios', ''], ['Lampathaki', 'Fenareti', ''], ['Messina', 'Domenico', ''], ['Perakis', 'Konstantinos', '']]","['Big Data', 'Data Analytics', 'Data Sharing', 'Data Driven Intelligence']"
5602,2301.08177,Stefania Ionescu,"Stefania Ionescu, Nicolo Pagan, and Aniko Hannak",Individual Fairness for Social Media Influencers,,,10.1007/978-3-031-21127-0_14,,cs.SI cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, many social media platforms are centered around content creators
(CC). On these platforms, the tie formation process depends on two factors: (a)
the exposure of users to CCs (decided by, e.g., a recommender system), and (b)
the following decision-making process of users. Recent research studies
underlined the importance of content quality by showing that under exploratory
recommendation strategies, the network eventually converges to a state where
the higher the quality of the CC, the higher their expected number of
followers. In this paper, we extend prior work by (a) looking beyond averages
to assess the fairness of the process and (b) investigating the importance of
exploratory recommendations for achieving fair outcomes. Using an analytical
approach, we show that non-exploratory recommendations converge fast but
usually lead to unfair outcomes. Moreover, even with exploration, we are only
guaranteed fair outcomes for the highest (and lowest) quality CCs.
","[{'version': 'v1', 'created': 'Thu, 19 Jan 2023 17:07:46 GMT'}]",2023-01-20,"[['Ionescu', 'Stefania', ''], ['Pagan', 'Nicolo', ''], ['Hannak', 'Aniko', '']]","['Social network formation', 'individual fairness', 'Markov Chains']"
5603,2109.01613,Hamid Ghourchian,"Hamid Ghourchian, Photios A. Stavrou, Tobias J. Oechtering, Mikael
  Skoglund","Secure Source Coding with Side-information at Decoder and Shared Key at
  Encoder and Decoder","Long version of the accepted paper in the Information Theory Workshop
  (ITW 2021). 23 pages, 4 figures",,10.1109/ITW48936.2021.9611508,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of rate-distortion-equivocation with side-information
only available at the decoder when an independent private random key is shared
between the sender and the receiver. The sender compresses the sequence, and
the receiver reconstructs it such that the average distortion between the
source and the output is limited. The equivocation is measured at an
eavesdropper that intercepts the source encoded message, utilizing
side-information correlated with the source and the side-information at the
decoder. We have derived the entire achievable rate-distortion-equivocation
region for this problem.
","[{'version': 'v1', 'created': 'Fri, 3 Sep 2021 16:43:08 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Nov 2021 00:18:19 GMT'}, {'version': 'v3', 'created': 'Mon, 24 Jan 2022 00:17:24 GMT'}]",2022-01-25,"[['Ghourchian', 'Hamid', ''], ['Stavrou', 'Photios A.', ''], ['Oechtering', 'Tobias J.', ''], ['Skoglund', 'Mikael', '']]","['Source coding', 'rate-distortion', 'security', 'side-information', 'shared key']"
5604,2111.13463,Ivica Kostric,Ivica Kostric and Krisztian Balog and Filip Radlinski,"Soliciting User Preferences in Conversational Recommender Systems via
  Usage-related Questions",Proceedings of ACM Conference on Recommender Systems (RecSys '21),,10.1145/3460231.3478861,,cs.IR cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A key distinguishing feature of conversational recommender systems over
traditional recommender systems is their ability to elicit user preferences
using natural language. Currently, the predominant approach to preference
elicitation is to ask questions directly about items or item attributes. These
strategies do not perform well in cases where the user does not have sufficient
knowledge of the target domain to answer such questions. Conversely, in a
shopping setting, talking about the planned use of items does not present any
difficulties, even for those that are new to a domain. In this paper, we
propose a novel approach to preference elicitation by asking implicit questions
based on item usage. Our approach consists of two main steps. First, we
identify the sentences from a large review corpus that contain information
about item usage. Then, we generate implicit preference elicitation questions
from those sentences using a neural text-to-text model. The main contributions
of this work also include a multi-stage data annotation protocol using
crowdsourcing for collecting high-quality labeled training data for the neural
model. We show that our approach is effective in selecting review sentences and
transforming them to elicitation questions, even with limited training data.
Additionally, we provide an analysis of patterns where the model does not
perform optimally.
","[{'version': 'v1', 'created': 'Fri, 26 Nov 2021 12:23:14 GMT'}]",2021-11-29,"[['Kostric', 'Ivica', ''], ['Balog', 'Krisztian', ''], ['Radlinski', 'Filip', '']]","['Conversational recommender systems', 'preference elicitation', 'question generation']"
5605,2005.01433,Masahiro Oda Dr.,"Masahiro Oda, Takefumi Yamaguchi, Hideki Fukuoka, Yuta Ueno, Kensaku
  Mori","Automated eye disease classification method from anterior eye image
  using anatomical structure focused image classification technique","Accepted paper as a poster presentation at SPIE Medical Imaging 2020,
  Houston, TX, USA","Proceedings of SPIE Medical Imaging 2020: Computer-Aided
  Diagnosis, Vol.11314, 1131446",10.1117/12.2549951,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an automated classification method of infective and
non-infective diseases from anterior eye images. Treatments for cases of
infective and non-infective diseases are different. Distinguishing them from
anterior eye images is important to decide a treatment plan. Ophthalmologists
distinguish them empirically. Quantitative classification of them based on
computer assistance is necessary. We propose an automated classification method
of anterior eye images into cases of infective or non-infective disease.
Anterior eye images have large variations of the eye position and brightness of
illumination. This makes the classification difficult. If we focus on the
cornea, positions of opacified areas in the corneas are different between cases
of the infective and non-infective diseases. Therefore, we solve the anterior
eye image classification task by using an object detection approach targeting
the cornea. This approach can be said as ""anatomical structure focused image
classification"". We use the YOLOv3 object detection method to detect corneas of
infective disease and corneas of non-infective disease. The detection result is
used to define a classification result of a image. In our experiments using
anterior eye images, 88.3% of images were correctly classified by the proposed
method.
","[{'version': 'v1', 'created': 'Mon, 4 May 2020 12:42:54 GMT'}]",2020-05-05,"[['Oda', 'Masahiro', ''], ['Yamaguchi', 'Takefumi', ''], ['Fukuoka', 'Hideki', ''], ['Ueno', 'Yuta', ''], ['Mori', 'Kensaku', '']]","['Anterior eye', 'infective disease', 'non-infective disease', 'classification', 'object detection']"
5606,2209.11306,Yousef El-Laham,"Yousef El-Laham, Svitlana Vyetrenko",StyleTime: Style Transfer for Synthetic Time Series Generation,,,10.1145/3533271.3561772,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural style transfer is a powerful computer vision technique that can
incorporate the artistic ""style"" of one image to the ""content"" of another. The
underlying theory behind the approach relies on the assumption that the style
of an image is represented by the Gram matrix of its features, which is
typically extracted from pre-trained convolutional neural networks (e.g.,
VGG-19). This idea does not straightforwardly extend to time series stylization
since notions of style for two-dimensional images are not analogous to notions
of style for one-dimensional time series. In this work, a novel formulation of
time series style transfer is proposed for the purpose of synthetic data
generation and enhancement. We introduce the concept of stylized features for
time series, which is directly related to the time series realism properties,
and propose a novel stylization algorithm, called StyleTime, that uses explicit
feature extraction techniques to combine the underlying content (trend) of one
time series with the style (distributional properties) of another. Further, we
discuss evaluation metrics, and compare our work to existing state-of-the-art
time series generation and augmentation schemes. To validate the effectiveness
of our methods, we use stylized synthetic data as a means for data augmentation
to improve the performance of recurrent neural network models on several
forecasting tasks.
","[{'version': 'v1', 'created': 'Thu, 22 Sep 2022 20:42:19 GMT'}]",2022-09-26,"[['El-Laham', 'Yousef', ''], ['Vyetrenko', 'Svitlana', '']]","['synthetic time series', 'neural style transfer', 'time series augmentation']"
5607,2108.02572,Naili Xing,"Naili Xing, Sai Ho Yeung, Chenghao Cai, Teck Khim Ng, Wei Wang,
  Kaiyuan Yang, Nan Yang, Meihui Zhang, Gang Chen, Beng Chin Ooi",SINGA-Easy: An Easy-to-Use Framework for MultiModal Analysis,"10 pages, 10 figures",,10.1145/1122445.1122456,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning has achieved great success in a wide spectrum of multimedia
applications such as image classification, natural language processing and
multimodal data analysis. Recent years have seen the development of many deep
learning frameworks that provide a high-level programming interface for users
to design models, conduct training and deploy inference. However, it remains
challenging to build an efficient end-to-end multimedia application with most
existing frameworks. Specifically, in terms of usability, it is demanding for
non-experts to implement deep learning models, obtain the right settings for
the entire machine learning pipeline, manage models and datasets, and exploit
external data sources all together. Further, in terms of adaptability, elastic
computation solutions are much needed as the actual serving workload fluctuates
constantly, and scaling the hardware resources to handle the fluctuating
workload is typically infeasible. To address these challenges, we introduce
SINGA-Easy, a new deep learning framework that provides distributed
hyper-parameter tuning at the training stage, dynamic computational cost
control at the inference stage, and intuitive user interactions with multimedia
contents facilitated by model explanation. Our experiments on the training and
deployment of multi-modality data analysis applications show that the framework
is both usable and adaptable to dynamic inference loads. We implement
SINGA-Easy on top of Apache SINGA and demonstrate our system with the entire
machine learning life cycle.
","[{'version': 'v1', 'created': 'Tue, 3 Aug 2021 08:39:54 GMT'}]",2021-08-06,"[['Xing', 'Naili', ''], ['Yeung', 'Sai Ho', ''], ['Cai', 'Chenghao', ''], ['Ng', 'Teck Khim', ''], ['Wang', 'Wei', ''], ['Yang', 'Kaiyuan', ''], ['Yang', 'Nan', ''], ['Zhang', 'Meihui', ''], ['Chen', 'Gang', ''], ['Ooi', 'Beng Chin', '']]","['deep learning', 'data analytics', 'multimedia application', 'distributedtraining', 'dynamic inference']"
5608,2204.11321,Fillipe Santos,"Fillipe Santos, Roger Immich, Edmundo R. M. Madeira","Multimedia Services Placement Algorithm for Cloud-Fog Hierarchical
  Environments",,,10.1016/j.comcom.2022.04.009,COMCOM7086,cs.PF,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  With the rapid development of mobile communication, multimedia services have
experienced explosive growth in the last few years. The high quantity of mobile
users, both consuming and producing these services to and from the Cloud
Computing (CC), can outpace the available bandwidth capacity. Fog Computing
(FG) presents itself as a solution to improve on this and other issues. With a
reduction in network latency, real-time applications benefit from improved
response time and greater overall user experience. Taking this into account,
the main goal of this work is threefold. Firstly, it is proposed a method to
build an environment based on Cloud-Fog Computing (CFC). Secondly, it is
designed two models based on Autoregressive Integrated Moving Average (ARIMA)
and Long Short-Term Memory (LSTM). The goal is to predict demand and reserve
the nodes' storage capacity to improve the positioning of multimedia services.
Later, an algorithm for the multimedia service placement problem which is aware
of data traffic prediction is proposed. The goal is to select the minimum
number of nodes, considering their hardware capacities for providing multimedia
services in such a way that the latency for servicing all the demands is
minimized. An evaluation with actual data showed that the proposed algorithm
selects the nodes closer to the user to meet their demands. This improves the
services delivered to end-users and enhances the deployed network to mitigate
provider costs. Moreover, reduce the demand to Cloud allowing turning off
servers in the data center not to waste energy
","[{'version': 'v1', 'created': 'Sun, 24 Apr 2022 17:07:27 GMT'}]",2022-04-26,"[['Santos', 'Fillipe', ''], ['Immich', 'Roger', ''], ['Madeira', 'Edmundo R. M.', '']]","['Cloud-to-Fog Networks', 'Multimedia Services', 'Placement Strategies']"
5609,2209.04514,Zhiqiang Zang,Zhiqiang Zang and Nathan Wiatrek and Milos Gligoric and August Shi,Compiler Testing using Template Java Programs,"13 pages, 6 figures, 2 tables, accepted in ASE 2022 (Research Papers
  track)",,10.1145/3551349.3556958,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present JAttack, a framework that enables template-based testing for
compilers. Using JAttack, a developer writes a template program that describes
a set of programs to be generated and given as test inputs to a compiler. Such
a framework enables developers to incorporate their domain knowledge on testing
compilers, giving a basic program structure that allows for exploring complex
programs that can trigger sophisticated compiler optimizations. A developer
writes a template program in the host language (Java) that contains holes to be
filled by JAttack. Each hole, written using a domain-specific language,
constructs a node within an extended abstract syntax tree (eAST). An eAST node
defines the search space for the hole, i.e., a set of expressions and values.
JAttack generates programs by executing templates and filling each hole by
randomly choosing expressions and values (available within the search space
defined by the hole). Additionally, we introduce several optimizations to
reduce JAttack's generation cost. While JAttack could be used to test various
compiler features, we demonstrate its capabilities in helping test just-in-time
(JIT) Java compilers, whose optimizations occur at runtime after a sufficient
number of executions. Using JAttack, we have found six critical bugs that were
confirmed by Oracle developers. Four of them were previously unknown, including
two unknown CVEs (Common Vulnerabilities and Exposures). JAttack shows the
power of combining developers' domain knowledge (via templates) with random
testing to detect bugs in JIT compilers.
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2022 20:31:38 GMT'}]",2022-09-13,"[['Zang', 'Zhiqiang', ''], ['Wiatrek', 'Nathan', ''], ['Gligoric', 'Milos', ''], ['Shi', 'August', '']]","['Testing', 'test generation', 'program generation', 'compiler', 'templates']"
5610,2101.09161,Jonas Oppenlaender,"Jonas Oppenlaender, Elina Kuosmanen, Andr\'es Lucero, Simo Hosio","Hardhats and Bungaloos: Comparing Crowdsourced Design Feedback with Peer
  Design Feedback in the Classroom","14 pages. CHI Conference on Human Factors in Computing Systems (CHI
  '21), May 8-13, 2021",,10.1145/3411764.3445380,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feedback is an important aspect of design education, and crowdsourcing has
emerged as a convenient way to obtain feedback at scale. In this paper, we
investigate how crowdsourced design feedback compares to peer design feedback
within a design-oriented HCI class and across two metrics: perceived quality
and perceived fairness. We also examine the perceived monetary value of
crowdsourced feedback, which provides an interesting contrast to the typical
requester-centric view of the value of labor on crowdsourcing platforms. Our
results reveal that the students (N=106) perceived the crowdsourced design
feedback as inferior to peer design feedback in multiple ways. However, they
also identified various positive aspects of the online crowds that peers cannot
provide. We discuss the meaning of the findings and provide suggestions for
teachers in HCI and other researchers interested in crowd feedback systems on
using crowds as a potential complement to peers.
","[{'version': 'v1', 'created': 'Wed, 20 Jan 2021 08:51:12 GMT'}]",2021-01-25,"[['Oppenlaender', 'Jonas', ''], ['Kuosmanen', 'Elina', ''], ['Lucero', 'Andrés', ''], ['Hosio', 'Simo', '']]","['crowdsourcing', 'design feedback', 'crowd feedback system', 'classroomstudy', 'peer review']"
5611,2003.08170,Teemu Lehto,Teemu Lehto and Markku Hinkka,"Discovering Business Area Effects to Process Mining Analysis Using
  Clustering and Influence Analysis","12 pages. Paper accepted in 23rd International Conference on Business
  Information Systems (BIS 2020) to be published in a proceedings edition of
  the Lecture Notes in Business Information Processing","Abramowicz W., Klein G. (eds) Business Information Systems. BIS
  2020. Lecture Notes in Business Information Processing, vol 389. Springer,
  Cham",10.1007/978-3-030-53337-3_18,"LNBIP, volume 389",cs.DB cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A common challenge for improving business processes in large organizations is
that business people in charge of the operations are lacking a fact-based
understanding of the execution details, process variants, and exceptions taking
place in business operations. While existing process mining methodologies can
discover these details based on event logs, it is challenging to communicate
the process mining findings to business people. In this paper, we present a
novel methodology for discovering business areas that have a significant effect
on the process execution details. Our method uses clustering to group similar
cases based on process flow characteristics and then influence analysis for
detecting those business areas that correlate most with the discovered
clusters. Our analysis serves as a bridge between BPM people and business,
people facilitating the knowledge sharing between these groups. We also present
an example analysis based on publicly available real-life purchase order
process data.
","[{'version': 'v1', 'created': 'Wed, 18 Mar 2020 11:58:01 GMT'}]",2021-08-26,"[['Lehto', 'Teemu', ''], ['Hinkka', 'Markku', '']]","['process mining', 'clustering', 'influence analysis', 'contribution', 'business area', 'classification rule mining', 'data mining']"
5612,2001.11591,Ivan Reinaldo Meneghini,"Ivan Reinaldo Meneghini, Marcos Antonio Alves, Ant\'onio Gaspar-Cunha,
  Frederico Gadelha Guimar\~aes","Scalable and Customizable Benchmark Problems for Many-Objective
  Optimization","24 pages, 23 figures, to be published in Applied Soft computing","Applied Soft Computing, Volume 90, 2020, 106139",10.1016/j.asoc.2020.106139,,cs.NE cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Solving many-objective problems (MaOPs) is still a significant challenge in
the multi-objective optimization (MOO) field. One way to measure algorithm
performance is through the use of benchmark functions (also called test
functions or test suites), which are artificial problems with a well-defined
mathematical formulation, known solutions and a variety of features and
difficulties. In this paper we propose a parameterized generator of scalable
and customizable benchmark problems for MaOPs. It is able to generate problems
that reproduce features present in other benchmarks and also problems with some
new features. We propose here the concept of generative benchmarking, in which
one can generate an infinite number of MOO problems, by varying parameters that
control specific features that the problem should have: scalability in the
number of variables and objectives, bias, deceptiveness, multimodality, robust
and non-robust solutions, shape of the Pareto front, and constraints. The
proposed Generalized Position-Distance (GPD) tunable benchmark generator uses
the position-distance paradigm, a basic approach to building test functions,
used in other benchmarks such as Deb, Thiele, Laumanns and Zitzler (DTLZ),
Walking Fish Group (WFG) and others. It includes scalable problems in any
number of variables and objectives and it presents Pareto fronts with different
characteristics. The resulting functions are easy to understand and visualize,
easy to implement, fast to compute and their Pareto optimal solutions are
known.
","[{'version': 'v1', 'created': 'Sun, 26 Jan 2020 12:39:51 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Feb 2020 12:49:59 GMT'}]",2020-02-13,"[['Meneghini', 'Ivan Reinaldo', ''], ['Alves', 'Marcos Antonio', ''], ['Gaspar-Cunha', 'António', ''], ['Guimarães', 'Frederico Gadelha', '']]","['Benchmark Functions', 'Scalable Test Functions', 'Many-Objective Optimization', 'EvolutionaryAlgorithms']"
5613,1810.02488,Mostafa Zaman Chowdhury,"Mostafa Zaman Chowdhurya, Seung Que Leeb, Byung Han Rub, Namhoon
  Parkb, and Yeong Min Jang","Service Quality Improvement of Mobile Users in Vehicular Environment by
  Mobile Femtocell Network Deployment","International Conference on ICT Convergence (ICTC), Sept. 2011,
  Seoul, Korea, pp. 194 -198",,10.1109/ICTC.2011.6082578,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The femto-access-point (FAP), a low power small cellular base station
provides better signal quality for the indoor users. The mobile users in the
vehicular environment suffer for the low quality signal from the outside
wireless networks. The deployment of femtocells in the vehicular environment
can solve the low level signal-to-noise plus interference problem. In this
paper, we propose new application of the femtocell technology. The femtocells
are deployed in the vehicular environment. Short distance between the user and
the FAP provides better signal quality. The inside FAPs are connected to the
core network through the outside macrocellular networks or the satellite
networks. One stronger transceiver is installed at outside the vehicle. This
transceiver is connected to FAPs using wired connection and to macrocellular or
the satellite access networks through wireless link. The capacity and the
outage probability are analyzed. The simulation results show that the proposed
mobile femtocell deployment significantly enhances the service quality of
mobile users in the vehicular environment.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 01:47:56 GMT'}]",2018-10-08,"[['Chowdhurya', 'Mostafa Zaman', ''], ['Leeb', 'Seung Que', ''], ['Rub', 'Byung Han', ''], ['Parkb', 'Namhoon', ''], ['Jang', 'Yeong Min', '']]","['¾ Mobile femtocell', 'vehicle', 'throughput', 'SNIR', 'outage probability', 'macrocellular networks', 'femtocellular network']"
5614,1904.12117,Morad Behandish,"Saigopal Nelaturi, Morad Behandish, Amir M. Mirzendehdel, Johan de
  Kleer",Automatic Support Removal for Additive Manufacturing Post Processing,Special Issue on symposium on Solid and Physical Modeling (SPM'2019),"Journal of Computer-Aided Design, 2019",10.1016/j.cad.2019.05.030,,cs.CG cs.GR cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An additive manufacturing (AM) process often produces a {\it near-net} shape
that closely conforms to the intended design to be manufactured. It sometimes
contains additional support structure (also called scaffolding), which has to
be removed in post-processing. We describe an approach to automatically
generate process plans for support removal using a multi-axis machining
instrument. The goal is to fracture the contact regions between each support
component and the part, and to do it in the most cost-effective order while
avoiding collisions with evolving near-net shape, including the remaining
support components. A recursive algorithm identifies a maximal collection of
support components whose connection regions to the part are accessible as well
as the orientations at which they can be removed at a given round. For every
such region, the accessible orientations appear as a 'fiber' in the
collision-free space of the evolving near-net shape and the tool assembly. To
order the removal of accessible supports, the algorithm constructs a search
graph whose edges are weighted by the Riemannian distance between the fibers.
The least expensive process plan is obtained by solving a traveling salesman
problem (TSP) over the search graph. The sequence of configurations obtained by
solving TSP is used as the input to a motion planner that finds collision free
paths to visit all accessible features. The resulting part without the support
structure can then be finished using traditional machining to produce the
intended design. The effectiveness of the method is demonstrated through
benchmark examples in 3D.
","[{'version': 'v1', 'created': 'Sat, 27 Apr 2019 06:45:42 GMT'}, {'version': 'v2', 'created': 'Thu, 23 May 2019 03:33:32 GMT'}, {'version': 'v3', 'created': 'Tue, 28 May 2019 22:37:55 GMT'}]",2019-05-30,"[['Nelaturi', 'Saigopal', ''], ['Behandish', 'Morad', ''], ['Mirzendehdel', 'Amir M.', ''], ['de Kleer', 'Johan', '']]","['Support Removal', 'Additive Manufacturing', 'Post-Processing', 'Accessibility Analysis', 'Configuration Space']"
5615,cs/0411080,Valmir Barbosa,"C. A. G. Assis, E. S. T. Fernandes, V. C. Barbosa","Modeling the input history of programs for improved instruction-memory
  performance",,"Computer Journal 49 (2006), 744-761",10.1093/comjnl/bxl044,ES-662/04,cs.OS,,"  When a program is loaded into memory for execution, the relative position of
its basic blocks is crucial, since loading basic blocks that are unlikely to be
executed first places them high in the instruction-memory hierarchy only to be
dislodged as the execution goes on. In this paper we study the use of Bayesian
networks as models of the input history of a program. The main point is the
creation of a probabilistic model that persists as the program is run on
different inputs and at each new input refines its own parameters in order to
reflect the program's input history more accurately. As the model is thus
tuned, it causes basic blocks to be reordered so that, upon arrival of the next
input for execution, loading the basic blocks into memory automatically takes
into account the input history of the program. We report on extensive
experiments, whose results demonstrate the efficacy of the overall approach in
progressively lowering the execution times of a program on identical inputs
placed randomly in a sequence of varied inputs. We provide results on selected
SPEC CINT2000 programs and also evaluate our approach as compared to the gcc
level-3 optimization and to Pettis-Hansen reordering.
","[{'version': 'v1', 'created': 'Tue, 23 Nov 2004 16:52:26 GMT'}]",2007-05-23,"[['Assis', 'C. A. G.', ''], ['Fernandes', 'E. S. T.', ''], ['Barbosa', 'V. C.', '']]","['Instruction memory', 'Code-layout optimization', 'Bayesiannetworks']"
5616,2009.12978,Oscar Darwin,Oscar Darwin and Stefan Kiefer,Equivalence of Hidden Markov Models with Continuous Observations,"17 pages, 9 figures, Submitted to FSTTCS 2020",,10.4230/LIPIcs.CVIT.2016.23,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider Hidden Markov Models that emit sequences of observations that are
drawn from continuous distributions. For example, such a model may emit a
sequence of numbers, each of which is drawn from a uniform distribution, but
the support of the uniform distribution depends on the state of the Hidden
Markov Model. Such models generalise the more common version where each
observation is drawn from a finite alphabet. We prove that one can determine in
polynomial time whether two Hidden Markov Models with continuous observations
are equivalent.
","[{'version': 'v1', 'created': 'Sun, 27 Sep 2020 23:09:05 GMT'}]",2020-09-29,"[['Darwin', 'Oscar', ''], ['Kiefer', 'Stefan', '']]","['Markov chains', 'equivalence', 'probabilistic systems', 'verification']"
5617,1905.01361,Abolghasem Daeichian,Abolghasem Daeichian and Amir Haghani,"Fuzzy Q-Learning Based Multi-Agent System for Intelligent Traffic
  Control by a Game Theory Approach","10 pages, 10 figures",Arabian Journal for Science and Engineering (2017): 1-7,10.1007/s13369-017-3018-9,,cs.MA math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a multi-agent approach to adjust traffic lights based
on traffic situation in order to reduce average delay time. In the traffic
model, lights of each intersection are controlled by an autonomous agent. Since
decision of each agent affects neighbor agents, this approach creates a
classical non-stationary environment. Thus, each agent not only needs to learn
from the past experience but also has to consider decision of neighbors to
overcome dynamic changes of the traffic network. Fuzzy Q-learning and Game
theory are employed to make policy based on previous experiences and decision
of neighbor agents. Simulation results illustrate the advantage of the proposed
method over fixed time, fuzzy, Q-learning and fuzzy Q-learning control methods.
","[{'version': 'v1', 'created': 'Tue, 23 Apr 2019 14:20:44 GMT'}]",2019-05-07,"[['Daeichian', 'Abolghasem', ''], ['Haghani', 'Amir', '']]","['Traffic control', 'Multi-agent system', 'Game theory', 'Fuzzy Q-learning']"
5618,1805.01220,Esteban Pardo,"Esteban Pardo, Jos\'e M\'ario T Morgado, Norberto Malpica",Semantic segmentation of mFISH images using convolutional networks,,,10.1002/cyto.a.23375,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Multicolor in situ hybridization (mFISH) is a karyotyping technique used to
detect major chromosomal alterations using fluorescent probes and imaging
techniques. Manual interpretation of mFISH images is a time consuming step that
can be automated using machine learning; in previous works, pixel or patch wise
classification was employed, overlooking spatial information which can help
identify chromosomes. In this work, we propose a fully convolutional semantic
segmentation network for the interpretation of mFISH images, which uses both
spatial and spectral information to classify each pixel in an end-to-end
fashion. The semantic segmentation network developed was tested on samples
extracted from a public dataset using cross validation. Despite having no
labeling information of the image it was tested on our algorithm yielded an
average correct classification ratio (CCR) of 87.41%. Previously, this level of
accuracy was only achieved with state of the art algorithms when classifying
pixels from the same image in which the classifier has been trained. These
results provide evidence that fully convolutional semantic segmentation
networks may be employed in the computer aided diagnosis of genetic diseases
with improved performance over the current methods of image analysis.
","[{'version': 'v1', 'created': 'Thu, 3 May 2018 11:04:47 GMT'}]",2018-05-04,"[['Pardo', 'Esteban', ''], ['Morgado', 'José Mário T', ''], ['Malpica', 'Norberto', '']]","['mFISH', 'Convolutional Networks', 'Semantic Segmentation', 'chromosome image analysis']"
5619,2004.14476,Jaehoon Oh,"Gihun Lee, Sangmin Bae, Jaehoon Oh, Se-Young Yun",SIPA: A Simple Framework for Efficient Networks,"14 pages, 9 figures","20th International Conference on Data Mining Workshops, 2020,
  729-736",10.1109/ICDMW51313.2020.00105,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the success of deep learning in various fields and the advent of
numerous Internet of Things (IoT) devices, it is essential to lighten models
suitable for low-power devices. In keeping with this trend, MicroNet Challenge,
which is the challenge to build efficient models from the view of both storage
and computation, was hosted at NeurIPS 2019. To develop efficient models
through this challenge, we propose a framework, coined as SIPA, consisting of
four stages: Searching, Improving, Pruning, and Accelerating. With the proposed
framework, our team, OSI AI, compressed 334x the parameter storage and 357x the
math operation compared to WideResNet-28-10 and took 4th place in the CIFAR-100
track at MicroNet Challenge 2019 with the top 10% highly efficient computation.
Our source code is available from https://github.com/Lee-Gihun/MicroNet_OSI-AI.
","[{'version': 'v1', 'created': 'Fri, 24 Apr 2020 06:39:15 GMT'}]",2021-03-04,"[['Lee', 'Gihun', ''], ['Bae', 'Sangmin', ''], ['Oh', 'Jaehoon', ''], ['Yun', 'Se-Young', '']]","['efficient neural network', 'compression', 'acceleration', 'MicroNet challenge']"
5620,2112.04563,Christian Hesch,"Felix Schmidt and Melanie Kr\""uger and Marc-Andre Keip and Christian
  Hesch",Computational homogenization of higher-order continua,,Int J Numer Methods Eng. 2022;1-31,10.1002/nme.6948,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  We introduce a novel computational framework for the multiscale simulation of
higher-order continua that allows for the consideration of first-, second- and
third- order effects at both micro- and macro-level. In line with classical
two-scale approaches, we describe the microstructure via representative volume
elements (RVE) that are attached at each integration point of the macroscopic
problem. To take account of the extended continuity requirements of independent
fields at micro- and macro-level, we discretize both scales via isogeometric
analysis (IGA). As a result, we obtain an IGA2-method that is conceptually
similar to the well-known FE2-method. We demonstrate the functionality and
accuracy of this novel multiscale method by means of a series of multiscale
simulations involving different kinds of higher-order continua.
","[{'version': 'v1', 'created': 'Wed, 8 Dec 2021 20:08:45 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Dec 2021 14:22:22 GMT'}, {'version': 'v3', 'created': 'Mon, 7 Mar 2022 08:30:22 GMT'}]",2022-03-08,"[['Schmidt', 'Felix', ''], ['Krüger', 'Melanie', ''], ['Keip', 'Marc-Andre', ''], ['Hesch', 'Christian', '']]","['higher-order gradient material', 'representative volume element', 'energeticcriteria', 'consistent linearization', 'NURBS', 'IGA2-method', 'multigrid']"
5621,2103.12876,Chen Zhao,"Chen Zhao, Chenyan Xiong, Xin Qian and Jordan Boyd-Graber",Complex Factoid Question Answering with a Free-Text Knowledge Graph,WWW2020,,10.1145/3366423.3380197,,cs.CL cs.IR,http://creativecommons.org/licenses/by/4.0/,"  We introduce DELFT, a factoid question answering system which combines the
nuance and depth of knowledge graph question answering approaches with the
broader coverage of free-text. DELFT builds a free-text knowledge graph from
Wikipedia, with entities as nodes and sentences in which entities co-occur as
edges. For each question, DELFT finds the subgraph linking question entity
nodes to candidates using text sentences as edges, creating a dense and high
coverage semantic graph. A novel graph neural network reasons over the
free-text graph-combining evidence on the nodes via information along edge
sentences-to select a final answer. Experiments on three question answering
datasets show DELFT can answer entity-rich questions better than machine
reading based models, bert-based answer ranking and memory networks. DELFT's
advantage comes from both the high coverage of its free-text knowledge
graph-more than double that of dbpedia relations-and the novel graph neural
network which reasons on the rich but noisy free-text evidence.
","[{'version': 'v1', 'created': 'Tue, 23 Mar 2021 22:53:09 GMT'}]",2021-03-25,"[['Zhao', 'Chen', ''], ['Xiong', 'Chenyan', ''], ['Qian', 'Xin', ''], ['Boyd-Graber', 'Jordan', '']]","['Free-Text Knowledge Graph', 'Factoid Question Answering', 'GraphNeural Network']"
5622,2208.06983,Fady Alajaji,"Ferenc Cole Thierrin, Fady Alajaji, Tam\'as Linder","R\'{e}nyi Cross-Entropy Measures for Common Distributions and Processes
  with Memory",,"Entropy, Vol. 24, Issue, 10, October 2022",10.3390/e24101417,,cs.IT math.IT,http://creativecommons.org/licenses/by/4.0/,"  Two R\'{e}nyi-type generalizations of the Shannon cross-entropy, the
R\'{e}nyi cross-entropy and the Natural R\'{e}nyi cross-entropy, were recently
used as loss functions for the improved design of deep learning generative
adversarial networks. In this work, we build upon our results in [1] by
deriving the R\'{e}nyi and Natural R\'{e}nyi differential cross-entropy
measures in closed form for a wide class of common continuous distributions
belonging to the exponential family and tabulating the results for ease of
reference. We also summarise the R\'{e}nyi-type cross-entropy rates between
stationary Gaussian processes and between finite-alphabet time-invariant Markov
sources.
","[{'version': 'v1', 'created': 'Mon, 15 Aug 2022 03:00:19 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Aug 2022 16:29:23 GMT'}]",2022-10-06,"[['Thierrin', 'Ferenc Cole', ''], ['Alajaji', 'Fady', ''], ['Linder', 'Tamás', '']]","['R´enyi information measures', 'cross-entropy', 'divergence measures', 'exponential family distributions', 'Gaussian pro']"
5623,2206.03876,Djennifer Madzia-Madzou,Djennifer K. Madzia-Madzou and Hugo J. Kuijf,Progressive GANomaly: Anomaly detection with progressively growing GANs,SPIE Medical Imaging 2022: Image Processing conference,,10.1117/12.2611105,,cs.CV eess.IV,http://creativecommons.org/licenses/by/4.0/,"  In medical imaging, obtaining large amounts of labeled data is often a
hurdle, because annotations and pathologies are scarce. Anomaly detection is a
method that is capable of detecting unseen abnormal data while only being
trained on normal (unannotated) data. Several algorithms based on generative
adversarial networks (GANs) exist to perform this task, yet certain limitations
are in place because of the instability of GANs. This paper proposes a new
method by combining an existing method, GANomaly, with progressively growing
GANs. The latter is known to be more stable, considering its ability to
generate high-resolution images. The method is tested using Fashion MNIST,
Medical Out-of-Distribution Analysis Challenge (MOOD), and in-house brain MRI;
using patches of sizes 16x16 and 32x32. Progressive GANomaly outperforms a
one-class SVM or regular GANomaly on Fashion MNIST. Artificial anomalies are
created in MOOD images with varying intensities and diameters. Progressive
GANomaly detected the most anomalies with varying intensity and size.
Additionally, the intermittent reconstructions are proven to be better from
progressive GANomaly. On the in-house brain MRI dataset, regular GANomaly
outperformed the other methods.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2022 13:13:01 GMT'}]",2022-06-09,"[['Madzia-Madzou', 'Djennifer K.', ''], ['Kuijf', 'Hugo J.', '']]","['Anomaly detection', 'generative adversarial networks', 'MRI', 'brain scans']"
5624,1702.02878,Leonardo Fernandez-Jambrina,L. Fern\'andez-Jambrina,Bezier developable surfaces,"26 pages, 10 figures, Computer Aided Geometric Design special number
  in memoriam Professor Gerald Farin","Computer Aided Geometric Design 55, 15-28 (2017)",10.1016/j.cagd.2017.02.001,,cs.GR math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we address the issue of designing developable surfaces with
Bezier patches. We show that developable surfaces with a polynomial edge of
regression are the set of developable surfaces which can be constructed with
Aumann's algorithm. We also obtain the set of polynomial developable surfaces
which can be constructed using general polynomial curves. The conclusions can
be extended to spline surfaces as well.
","[{'version': 'v1', 'created': 'Thu, 9 Feb 2017 16:23:36 GMT'}]",2017-06-19,"[['Fernández-Jambrina', 'L.', '']]","['developable surface', 'B´ezier', 'blossom', 'edge of regression']"
5625,2105.02182,Caroline Pitt,"Caroline Pitt (1), Adam Bell (2), Brandyn S. Boyd (1), Nikki Demmel
  (1), and Katie Davis (1) ((1) The Information School, University of
  Washington, (2) College of Education, University of Washington)","Connected Learning, Collapsed Contexts","22 pages, 2 figures, Proceedings of the ACM Conference on Human
  Factors in Computing Systems (CHI '21)",,10.1145/3411764.3445635,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Researchers and designers have incorporated social media affordances into
learning technologies to engage young people and support personally relevant
learning, but youth may reject these attempts because they do not meet user
expectations. Through in-depth case studies, we explore the sociotechnical
ecosystems of six teens (ages 15-18) working at a science center that had
recently introduced a digital badge system to track and recognize their
learning. By analyzing interviews, observations, ecological momentary
assessments, and system data, we examined tensions in how badges as connected
learning technologies operate in teens' sociotechnical ecosystems. We found
that, due to issues of unwanted context collapse and incongruent identity
representations, youth only used certain affordances of the system and did so
sporadically. Additionally, we noted that some features seemed to prioritize
values of adult stakeholders over youth. Using badges as a lens, we reveal
critical tensions and offer design recommendations for networked learning
technologies.
","[{'version': 'v1', 'created': 'Wed, 5 May 2021 16:50:52 GMT'}]",2021-05-06,"[['Pitt', 'Caroline', ''], ['Bell', 'Adam', ''], ['Boyd', 'Brandyn S.', ''], ['Demmel', 'Nikki', ''], ['Davis', 'Katie', '']]","['Identity', 'social media', 'digital badges', 'sociotechnical systems', 'informal learning', 'identity development']"
5626,1709.00848,Denis Kleyko,"V.I. Gritsenko, D.A. Rachkovskij, A.A. Frolov, R. Gayler, D. Kleyko,
  E. Osipov",Neural Distributed Autoassociative Memories: A Survey,31 pages,"Cybernetics and Computer Engineering, 2017. 2(188), 5-35",10.15407/kvt188.02.005,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Introduction. Neural network models of autoassociative, distributed memory
allow storage and retrieval of many items (vectors) where the number of stored
items can exceed the vector dimension (the number of neurons in the network).
This opens the possibility of a sublinear time search (in the number of stored
items) for approximate nearest neighbors among vectors of high dimension. The
purpose of this paper is to review models of autoassociative, distributed
memory that can be naturally implemented by neural networks (mainly with local
learning rules and iterative dynamics based on information locally available to
neurons). Scope. The survey is focused mainly on the networks of Hopfield,
Willshaw and Potts, that have connections between pairs of neurons and operate
on sparse binary vectors. We discuss not only autoassociative memory, but also
the generalization properties of these networks. We also consider neural
networks with higher-order connections and networks with a bipartite graph
structure for non-binary data with linear constraints. Conclusions. In
conclusion we discuss the relations to similarity search, advantages and
drawbacks of these techniques, and topics for further research. An interesting
and still not completely resolved question is whether neural autoassociative
memories can search for approximate nearest neighbors faster than other index
structures for similarity search, in particular for the case of very high
dimensional vectors.
","[{'version': 'v1', 'created': 'Mon, 4 Sep 2017 07:54:53 GMT'}]",2017-09-05,"[['Gritsenko', 'V. I.', ''], ['Rachkovskij', 'D. A.', ''], ['Frolov', 'A. A.', ''], ['Gayler', 'R.', ''], ['Kleyko', 'D.', ''], ['Osipov', 'E.', '']]","['distributed  associative  memory', 'sparse  binary  vector', 'Hopfield  network', 'Willshaw memory', 'Potts model', 'nearest neighbor', 'similarity search']"
5627,2207.03823,Roman Heinrich,"Roman Heinrich, Manisha Luthra, Harald Kornmayer, Carsten Binnig",Zero-Shot Cost Models for Distributed Stream Processing,"To appear in the Proceedings of The 16th ACM International Conference
  on Distributed and Event-based Systems (DEBS `22), June 27-30, 2022,
  Copenhagen, Denmark",,10.1145/3524860.3539639,,cs.DC cs.DB,http://creativecommons.org/licenses/by-sa/4.0/,"  This paper proposes a learned cost estimation model for Distributed Stream
Processing Systems (DSPS) with an aim to provide accurate cost predictions of
executing queries. A major premise of this work is that the proposed learned
model can generalize to the dynamics of streaming workloads out-of-the-box.
This means a model once trained can accurately predict performance metrics such
as latency and throughput even if the characteristics of the data and workload
or the deployment of operators to hardware changes at runtime. That way, the
model can be used to solve tasks such as optimizing the placement of operators
to minimize the end-to-end latency of a streaming query or maximize its
throughput even under varying conditions. Our evaluation on a well-known DSPS,
Apache Storm, shows that the model can predict accurately for unseen workloads
and queries while generalizing across real-world benchmarks.
","[{'version': 'v1', 'created': 'Fri, 8 Jul 2022 11:01:03 GMT'}]",2022-07-11,"[['Heinrich', 'Roman', ''], ['Luthra', 'Manisha', ''], ['Kornmayer', 'Harald', ''], ['Binnig', 'Carsten', '']]","['Stream processing', 'Cost Models', 'Zero-shot learning']"
5628,2205.15060,Ting-En Lin,"Ting-En Lin, Yuchuan Wu, Fei Huang, Luo Si, Jian Sun, Yongbin Li","Duplex Conversation: Towards Human-like Interaction in Spoken Dialogue
  Systems","Accepted by KDD 2022, ADS track",,10.1145/3534678.3539209,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we present Duplex Conversation, a multi-turn, multimodal
spoken dialogue system that enables telephone-based agents to interact with
customers like a human. We use the concept of full-duplex in telecommunication
to demonstrate what a human-like interactive experience should be and how to
achieve smooth turn-taking through three subtasks: user state detection,
backchannel selection, and barge-in detection. Besides, we propose
semi-supervised learning with multimodal data augmentation to leverage
unlabeled data to increase model generalization. Experimental results on three
sub-tasks show that the proposed method achieves consistent improvements
compared with baselines. We deploy the Duplex Conversation to Alibaba
intelligent customer service and share lessons learned in production. Online
A/B experiments show that the proposed system can significantly reduce response
latency by 50%.
","[{'version': 'v1', 'created': 'Mon, 30 May 2022 12:41:23 GMT'}, {'version': 'v2', 'created': 'Tue, 31 May 2022 14:15:58 GMT'}, {'version': 'v3', 'created': 'Thu, 9 Jun 2022 16:06:23 GMT'}, {'version': 'v4', 'created': 'Tue, 14 Jun 2022 10:45:56 GMT'}]",2022-06-15,"[['Lin', 'Ting-En', ''], ['Wu', 'Yuchuan', ''], ['Huang', 'Fei', ''], ['Si', 'Luo', ''], ['Sun', 'Jian', ''], ['Li', 'Yongbin', '']]","['Duplex conversation', 'multimodal', 'turn-taking', 'barge-in', 'data augmentation', 'semi-supervised', 'dialogue system']"
5629,2007.02722,Aocheng Li,"Aocheng Li, Jie Guo, Yanwen Guo",Image Stitching Based on Planar Region Consensus,"15 pages, 9 figures",,10.1109/TIP.2021.3086079,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image stitching for two images without a global transformation between them
is notoriously difficult. In this paper, noticing the importance of planar
structure under perspective geometry, we propose a new image stitching method
which stitches images by allowing for the alignment of a set of matched
dominant planar regions. Clearly different from previous methods resorting to
plane segmentation, the key to our approach is to utilize rich semantic
information directly from RGB images to extract planar image regions with a
deep Convolutional Neural Network (CNN). We specifically design a new module to
make fully use of existing semantic segmentation networks to accommodate planar
segmentation. To train the network, a dataset for planar region segmentation is
contributed. With the planar region knowledge, a set of local transformations
can be obtained by constraining matched regions, enabling more precise
alignment in the overlapping area. We also use planar knowledge to estimate a
transformation field over the whole image. The final mosaic is obtained by a
mesh-based optimization framework which maintains high alignment accuracy and
relaxes similarity transformation at the same time. Extensive experiments with
quantitative comparisons show that our method can deal with different
situations and outperforms the state-of-the-arts on challenging scenes.
","[{'version': 'v1', 'created': 'Mon, 6 Jul 2020 13:07:20 GMT'}]",2021-07-07,"[['Li', 'Aocheng', ''], ['Guo', 'Jie', ''], ['Guo', 'Yanwen', '']]","['Image stitching', 'image warping', 'image segmentation']"
5630,2207.04706,Tom\'a\v{s} Bravenec,"Tomas Bravenec, Joaqu\'in Torres-Sospedra, Michael Gould, Tomas Fryza","What Your Wearable Devices Revealed About You and Possibilities of
  Non-Cooperative 802.11 Presence Detection During Your Last IPIN Visit","7 pages, 7 figures, submitted to IPIN2022 conference",,10.1109/IPIN54987.2022.9918134,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  The focus on privacy-related measures regarding wireless networks grew in
last couple of years. This is especially important with technologies like Wi-Fi
or Bluetooth, which are all around us and our smartphones use them not just for
connection to the internet or other devices, but for localization purposes as
well. In this paper, we analyze and evaluate probe request frames of 802.11
wireless protocol captured during the 11th international conference on Indoor
Positioning and Indoor Navigation (IPIN) 2021. We explore the temporal
occupancy of the conference space during four days of the conference as well as
non-cooperatively track the presence of devices in the proximity of the session
rooms using 802.11 management frames, with and without using MAC address
randomization. We carried out this analysis without trying to identify/reveal
the identity of the users or in any way reverse the MAC address randomization.
As a result of the analysis, we detected that there are still many devices not
adopting MAC randomization, because either it is not implemented, or users
disabled it. In addition, many devices can be easily tracked despite employing
MAC randomization.
","[{'version': 'v1', 'created': 'Mon, 11 Jul 2022 08:37:54 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Nov 2022 11:11:46 GMT'}]",2022-11-08,"[['Bravenec', 'Tomas', ''], ['Torres-Sospedra', 'Joaquín', ''], ['Gould', 'Michael', ''], ['Fryza', 'Tomas', '']]","['MAC randomization', 'temporal analysis', 'privacy', 'probe requests']"
5631,2210.05350,Ashwin Agrawal,"Ashwin Agrawal, Vishal Singh, Martin Fischer","A new perspective on Digital Twins: Imparting intelligence and agency to
  entities",,IEEE Journal of Radio Frequency Identification 2022,10.1109/JRFID.2022.3225741,,cs.HC cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Despite the Digital Twin (DT) concept being in the industry for a long time,
it remains ambiguous, unable to differentiate itself from information models,
general computing, and simulation technologies. Part of this confusion stems
from previous studies overlooking the DT's bidirectional nature, that enables
the shift of agency (delegating control) from humans to physical elements,
something that was not possible with earlier technologies. Thus, we present DTs
in a new light by viewing them as a means of imparting intelligence and agency
to entities, emphasizing that DTs are not just expert-centric tools but are
active systems that extend the capabilities of the entities being twinned. This
new perspective on DTs can help reduce confusion and humanize the concept by
starting discussions about how intelligent a DT should be, and its roles and
responsibilities, as well as setting a long-term direction for DTs.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2022 11:27:14 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Dec 2022 09:47:19 GMT'}]",2022-12-06,"[['Agrawal', 'Ashwin', ''], ['Singh', 'Vishal', ''], ['Fischer', 'Martin', '']]","['Digital Twin', 'Intelligence', 'Autonomy']"
5632,2107.07298,Nicolas Chappe,"Nicolas Chappe (University of Lyon, France / EnsL, France / Claude
  Bernard University Lyon 1, France / CNRS, France / Inria, France / LIP,
  France), Ludovic Henrio (University of Lyon, France / EnsL, France / Claude
  Bernard University Lyon 1, France / CNRS, France / Inria, France / LIP,
  France), Amaury Maill\'e (University of Lyon, France / EnsL, France / Claude
  Bernard University Lyon 1, France / CNRS, France / Inria, France / LIP,
  France), Matthieu Moy (University of Lyon, France / EnsL, France / Claude
  Bernard University Lyon 1, France / CNRS, France / Inria, France / LIP,
  France), Hadrien Renaud (University of Lyon, France / EnsL, France / Claude
  Bernard University Lyon 1, France / CNRS, France / Inria, France / LIP,
  France / \'Ecole Polytechnique, France / Institut Polytechnique de Paris,
  France)",An Optimised Flow for Futures: From Theory to Practice,,"The Art, Science, and Engineering of Programming, 2022, Vol. 6,
  Issue 1, Article 3",10.22152/programming-journal.org/2022/6/3,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A future is an entity representing the result of an ongoing computation. A
synchronisation with a ""get"" operation blocks the caller until the computation
is over, to return the corresponding value. When a computation in charge of
fulfilling a future delegates part of its processing to another task,
mainstream languages return nested futures, and several ""get"" operations are
needed to retrieve the computed value (we call such futures ""control-flow
futures""). Several approaches were proposed to tackle this issues: the
""forward"" construct, that allows the programmer to make delegation explicit and
avoid nested futures, and ""data-flow explicit futures"" which natively collapse
nested futures into plain futures. This paper supports the claim that data-flow
explicit futures form a powerful set of language primitives, on top of which
other approaches can be built. We prove the equivalence, in the context of
data-flow explicit futures, between the ""forward"" construct and classical
""return"" from functions. The proof relies on a branching bisimulation between a
program using ""forward"" and its ""return"" counterpart. This result allows
language designers to consider ""forward"" as an optimisation directive rather
than as a language primitive. Following the principles of the Godot system, we
provide a library implementation of control-flow futures, based on data-flow
explicit futures implemented in the compiler. This small library supports the
claim that the implementation of classical futures based on data-flow ones is
easier than the opposite. Our benchmarks show the viability of the approach
from a performance point of view.
","[{'version': 'v1', 'created': 'Thu, 15 Jul 2021 13:03:38 GMT'}]",2021-07-16,"[['Chappe', 'Nicolas', '', 'University of Lyon, France / EnsL, France / Claude\n  Bernard University Lyon 1, France / CNRS, France / Inria, France / LIP,\n  France'], ['Henrio', 'Ludovic', '', 'University of Lyon, France / EnsL, France / Claude\n  Bernard University Lyon 1, France / CNRS, France / Inria, France / LIP,\n  France'], ['Maillé', 'Amaury', '', 'University of Lyon, France / EnsL, France / Claude\n  Bernard University Lyon 1, France / CNRS, France / Inria, France / LIP,\n  France'], ['Moy', 'Matthieu', '', 'University of Lyon, France / EnsL, France / Claude\n  Bernard University Lyon 1, France / CNRS, France / Inria, France / LIP,\n  France'], ['Renaud', 'Hadrien', '', 'University of Lyon, France / EnsL, France / Claude\n  Bernard University Lyon 1, France / CNRS, France / Inria, France / LIP,\n  France / École Polytechnique, France / Institut Polytechnique de Paris,\n  France']]","['parallelism', 'programming languages', 'futures']"
5633,2006.08486,Andrej Kastrin,Andrej Kastrin and Dimitar Hristovski,"Scientometric analysis and knowledge mapping of literature-based
  discovery (1986-2020)","43 pages, 12 figures",,10.1007/s11192-020-03811-z,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Literature-based discovery (LBD) aims to discover valuable latent
relationships between disparate sets of literatures. This paper presents the
first inclusive scientometric overview of LBD research. We utilize a
comprehensive scientometric approach incorporating CiteSpace to systematically
analyze the literature on LBD from the last four decades (1986-2020). After
manual cleaning, we have retrieved a total of 409 documents from six
bibliographic databases and two preprint servers. The 35 years' history of LBD
could be partitioned into three phases according to the published papers per
year: incubation (1986-2003), developing (2004-2008), and mature phase
(2009-2020). The annual production of publications follows Price's law. The
co-authorship network exhibits many subnetworks, indicating that LBD research
is composed of many small and medium-sized groups with little collaboration
among them. Science mapping reveals that mainstream research in LBD has shifted
from baseline co-occurrence approaches to semantic-based methods at the
beginning of the new millennium. In the last decade, we can observe the leaning
of LBD towards modern network science ideas. In an applied sense, the LBD is
increasingly used in predicting adverse drug reactions and drug repurposing.
Besides theoretical considerations, the researchers have put a lot of effort
into the development of Web-based LBD applications. Nowadays, LBD is becoming
increasingly interdisciplinary and involves methods from information science,
scientometrics, and machine learning. Unfortunately, LBD is mainly limited to
the biomedical domain. The cascading citation expansion announces deep learning
and explainable artificial intelligence as emerging topics in LBD. The results
indicate that LBD is still growing and evolving.
","[{'version': 'v1', 'created': 'Mon, 15 Jun 2020 15:42:28 GMT'}, {'version': 'v2', 'created': 'Sun, 29 Nov 2020 11:51:34 GMT'}]",2020-12-01,"[['Kastrin', 'Andrej', ''], ['Hristovski', 'Dimitar', '']]","['Literature-based discovery', 'Scientometrics', 'Information visualization', 'CiteSpace']"
5634,2011.09676,Benjamin Berg,"Benjamin Berg, Rein Vesilo, Mor Harchol-Balter",heSRPT: Parallel Scheduling to Minimize Mean Slowdown,arXiv admin note: substantial text overlap with arXiv:1903.09346,Performance Evaluation (2020) 102147,10.1016/j.peva.2020.102147,,cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern data centers serve workloads which are capable of exploiting
parallelism. When a job parallelizes across multiple servers it will complete
more quickly, but jobs receive diminishing returns from being allocated
additional servers. Because allocating multiple servers to a single job is
inefficient, it is unclear how best to allocate a fixed number of servers
between many parallelizable jobs. This paper provides the first optimal
allocation policy for minimizing the mean slowdown of parallelizable jobs of
known size when all jobs are present at time 0. Our policy provides a simple
closed form formula for the optimal allocations at every moment in time.
Minimizing mean slowdown usually requires favoring short jobs over long ones
(as in the SRPT policy). However, because parallelizable jobs have sublinear
speedup functions, system efficiency is also an issue. System efficiency is
maximized by giving equal allocations to all jobs and thus competes with the
goal of prioritizing small jobs. Our optimal policy, high-efficiency SRPT
(heSRPT), balances these competing goals. heSRPT completes jobs according to
their size order, but maintains overall system efficiency by allocating some
servers to each job at every moment in time. Our results generalize to also
provide the optimal allocation policy with respect to mean flow time. Finally,
we consider the online case where jobs arrive to the system over time. While
optimizing mean slowdown in the online setting is even more difficult, we find
that heSRPT provides an excellent heuristic policy for the online setting. In
fact, our simulations show that heSRPT significantly outperforms
state-of-the-art allocation policies for parallelizable jobs.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2020 18:56:10 GMT'}]",2020-11-20,"[['Berg', 'Benjamin', ''], ['Vesilo', 'Rein', ''], ['Harchol-Balter', 'Mor', '']]","['Parallel Scheduling', 'Server Allocation', 'Optimization', 'Speedup Curves', 'Slowdown', 'Flow Time']"
5635,2004.07002,Marek Tyburec,"Marek Tyburec, Jan Zeman, Martin Do\v{s}k\'a\v{r}, Martin
  Kru\v{z}\'ik, and Mat\v{e}j Lep\v{s}","Modular-topology optimization with Wang tilings: An application to truss
  structures","17 pages, 16 figures","Structural and Multidisciplinary Optimization volume 63,
  pages1099-1117 (2021)",10.1007/s00158-020-02744-8,,cs.CE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modularity is appealing for solving many problems in optimization. It brings
the benefits of manufacturability and reconfigurability to structural
optimization, and enables a trade-off between the computational performance of
a Periodic Unit Cell (PUC) and the efficacy of non-uniform designs in
multi-scale material optimization. Here, we introduce a novel strategy for
concurrent minimum-compliance design of truss modules topologies and their
macroscopic assembly encoded using Wang tiling, a formalism providing
independent control over the number of modules and their interfaces. We tackle
the emerging bilevel optimization problem with a combination of meta-heuristics
and mathematical programming. At the upper level, we employ a genetic algorithm
to optimize module assemblies. For each assembly, we obtain optimal module
topologies as a solution to a convex second-order conic program that exploits
the underlying modularity, incorporating stress constraints, multiple load
cases, and reuse of module(s) for various structures. Merits of the proposed
strategy are illustrated with three representative examples, clearly
demonstrating that the best designs obtained by our method exhibited decreased
compliance: from 56% to 69% compared to the PUC designs.
","[{'version': 'v1', 'created': 'Wed, 15 Apr 2020 11:06:37 GMT'}]",2021-03-31,"[['Tyburec', 'Marek', ''], ['Zeman', 'Jan', ''], ['Doškář', 'Martin', ''], ['Kružík', 'Martin', ''], ['Lepš', 'Matěj', '']]","['modular-topology optimization', 'secondorder cone programming', 'truss microstructures', 'bileveloptimization', 'Wang tiling']"
5636,2205.01284,Jianli Bai,"Jianli Bai, Xiangfu Song, Shujie Cui, Ee-Chien Chang and Giovanni
  Russello",Scalable Private Decision Tree Evaluation with Sublinear Communication,,,10.1145/3488932.3517413,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Private decision tree evaluation (PDTE) allows a decision tree holder to run
a secure protocol with a feature provider. By running the protocol, the feature
provider will learn a classification result. Nothing more is revealed to either
party. In most existing PDTE protocols, the required communication grows
exponentially with the tree's depth $d$, which is highly inefficient for large
trees. This shortcoming motivated us to design a sublinear PDTE protocol with
$O(d)$ communication complexity. The core of our construction is a shared
oblivious selection (SOS) functionality, allowing two parties to perform a
secret-shared oblivious read operation from an array. We provide two SOS
protocols, both of which achieve sublinear communication and propose
optimizations to further improve their efficiency. Our sublinear PDTE protocol
is based on the proposed SOS functionality and we prove its security under a
semi-honest adversary. We compare our protocol with the state-of-the-art, in
terms of communication and computation, under various network settings. The
performance evaluation shows that our protocol is practical and more scalable
over large trees than existing solutions.
","[{'version': 'v1', 'created': 'Tue, 3 May 2022 03:15:50 GMT'}]",2022-05-04,"[['Bai', 'Jianli', ''], ['Song', 'Xiangfu', ''], ['Cui', 'Shujie', ''], ['Chang', 'Ee-Chien', ''], ['Russello', 'Giovanni', '']]","['decision tree', 'secure computation', 'sublinear communication']"
5637,2104.05866,Angelika Romanou,"Angelika Romanou, Panayiotis Smeros, Karl Aberer","On Representation Learning for Scientific News Articles Using
  Heterogeneous Knowledge Graphs",,,10.1145/3442442.3451362,,cs.SI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  In the era of misinformation and information inflation, the credibility
assessment of the produced news is of the essence. However, fact-checking can
be challenging considering the limited references presented in the news. This
challenge can be transcended by utilizing the knowledge graph that is related
to the news articles. In this work, we present a methodology for creating
scientific news article representations by modeling the directed graph between
the scientific news articles and the cited scientific publications. The network
used for the experiments is comprised of the scientific news articles, their
topic, the cited research literature, and their corresponding authors. We
implement and present three different approaches: 1) a baseline Relational
Graph Convolutional Network (R-GCN), 2) a Heterogeneous Graph Neural Network
(HetGNN) and 3) a Heterogeneous Graph Transformer (HGT). We test these models
in the downstream task of link prediction on the: a) news article - paper links
and b) news article - article topic links. The results show promising
applications of graph neural network approaches in the domains of knowledge
tracing and scientific news credibility assessment.
","[{'version': 'v1', 'created': 'Mon, 12 Apr 2021 23:46:54 GMT'}]",2021-04-14,"[['Romanou', 'Angelika', ''], ['Smeros', 'Panayiotis', ''], ['Aberer', 'Karl', '']]","['heterogeneous knowledge graphs', 'graph neural networks', 'misinformation', 'graph embeddings']"
5638,1910.13313,Hesaneh Kazemi,"Hesaneh Kazemi, Ashkan Vaziri and Julian A. Norato","Multi-material Topology Optimization of Lattice Structures using
  Geometry Projection",,,10.1016/j.cma.2020.112895,,cs.CE math.OC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This work presents a computational method for the design of architected truss
lattice materials where each strut can be made of one of a set of available
materials. We design the lattices to extremize effective properties. As
customary in topology optimization, we design a periodic unit cell of the
lattice and obtain the effective properties via numerical homogenization. Each
bar is represented as a cylindrical offset surface of a medial axis
parameterized by the positions of the endpoints of the medial axis. These
parameters are smoothly mapped onto a continuous density field for the primal
and sensitivity analysis via the geometry projection method. A size variable
per material is ascribed to each bar and penalized as in density-based topology
optimization to facilitate the entire removal of bars from the design. During
the optimization, we allow bars to be made of a mixture of the available
materials. However, to ensure each bar is either exclusively made of one
material or removed altogether from the optimal design, we impose optimization
constraints that ensure each size variable is 0 or 1, and that at most one
material size variable is 1. The proposed material interpolation scheme readily
accommodates any number of materials. To obtain lattices with desired material
symmetries, we design only a reference region of the unit cell and reflect its
geometry projection with respect to the appropriate planes of symmetry. Also,
to ensure bars remain whole upon reflection inside the unit cell or with
respect to the periodic boundaries, we impose a no-cut constraint on the bars.
We demonstrate the efficacy of our method via numerical examples of bulk and
shear moduli maximization and Poisson's ratio minimization for two- and
three-material lattices with cubic symmetry.
","[{'version': 'v1', 'created': 'Wed, 23 Oct 2019 20:40:13 GMT'}]",2020-04-22,"[['Kazemi', 'Hesaneh', ''], ['Vaziri', 'Ashkan', ''], ['Norato', 'Julian A.', '']]","['Topology Optimization', 'Multi-material', 'Lattice Structures']"
5639,2104.09075,Mohamed Wahib,"Albert Njoroge Kahira, Truong Thao Nguyen, Leonardo Bautista Gomez,
  Ryousei Takano, Rosa M Badia, Mohamed Wahib","An Oracle for Guiding Large-Scale Model/Hybrid Parallel Training of
  Convolutional Neural Networks","The International ACM Symposium on High-Performance Parallel and
  Distributed Computing 2021 (HPDC'21)",,10.1145/3431379.3460644,,cs.DC cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Deep Neural Network (DNN) frameworks use distributed training to enable
faster time to convergence and alleviate memory capacity limitations when
training large models and/or using high dimension inputs. With the steady
increase in datasets and model sizes, model/hybrid parallelism is deemed to
have an important role in the future of distributed training of DNNs. We
analyze the compute, communication, and memory requirements of Convolutional
Neural Networks (CNNs) to understand the trade-offs between different
parallelism approaches on performance and scalability. We leverage our
model-driven analysis to be the basis for an oracle utility which can help in
detecting the limitations and bottlenecks of different parallelism approaches
at scale. We evaluate the oracle on six parallelization strategies, with four
CNN models and multiple datasets (2D and 3D), on up to 1024 GPUs. The results
demonstrate that the oracle has an average accuracy of about 86.74% when
compared to empirical results, and as high as 97.57% for data parallelism.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2021 06:45:51 GMT'}]",2021-04-20,"[['Kahira', 'Albert Njoroge', ''], ['Nguyen', 'Truong Thao', ''], ['Gomez', 'Leonardo Bautista', ''], ['Takano', 'Ryousei', ''], ['Badia', 'Rosa M', ''], ['Wahib', 'Mohamed', '']]","['Deep Learning', 'Model Parallelism', 'Performance Modeling']"
5640,1909.12232,Sebastian Bayerl,Sebastian P. Bayerl and Korbinian Riedhammer,A Comparison of Hybrid and End-to-End Models for Syllable Recognition,"22th International Conference of Text, Speech and Dialogue TSD2019",,10.1007/978-3-030-27947-9_30,,cs.CL cs.LG cs.SD eess.AS stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a comparison of a traditional hybrid speech recognition
system (kaldi using WFST and TDNN with lattice-free MMI) and a lexicon-free
end-to-end (TensorFlow implementation of multi-layer LSTM with CTC training)
models for German syllable recognition on the Verbmobil corpus. The results
show that explicitly modeling prior knowledge is still valuable in building
recognition systems. With a strong language model (LM) based on syllables, the
structured approach significantly outperforms the end-to-end model. The best
word error rate (WER) regarding syllables was achieved using kaldi with a
4-gram LM, modeling all syllables observed in the training set. It achieved
10.0% WER w.r.t. the syllables, compared to the end-to-end approach where the
best WER was 27.53%. The work presented here has implications for building
future recognition systems that operate independent of a large vocabulary, as
typically used in a tasks such as recognition of syllabic or agglutinative
languages, out-of-vocabulary techniques, keyword search indexing and medical
speech processing.
","[{'version': 'v1', 'created': 'Thu, 19 Sep 2019 09:51:35 GMT'}]",2019-09-27,"[['Bayerl', 'Sebastian P.', ''], ['Riedhammer', 'Korbinian', '']]","['speech recognition', 'language model', 'CTC', 'end-2-end', 'syllables']"
5641,1810.02010,Ting-Wu Chin,"Ting-Wu Chin, Chia-Lin Yu, Matthew Halpern, Hasan Genc, Shiao-Li Tsao
  and Vijay Janapa Reddi",Domain Specific Approximation for Object Detection,"6 pages, 6 figures. Published in IEEE Micro, vol. 38, no. 1, pp.
  31-40, January/February 2018","T. Chin, C. Yu, M. Halpern, H. Genc, S. Tsao and V. J. Reddi,
  ""Domain-Specific Approximation for Object Detection,"" in IEEE Micro, vol. 38,
  no. 1, pp. 31-40, January/February 2018",10.1109/MM.2018.112130335,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is growing interest in object detection in advanced driver assistance
systems and autonomous robots and vehicles. To enable such innovative systems,
we need faster object detection. In this work, we investigate the trade-off
between accuracy and speed with domain-specific approximations, i.e.
category-aware image size scaling and proposals scaling, for two
state-of-the-art deep learning-based object detection meta-architectures. We
study the effectiveness of applying approximation both statically and
dynamically to understand the potential and the applicability of them. By
conducting experiments on the ImageNet VID dataset, we show that
domain-specific approximation has great potential to improve the speed of the
system without deteriorating the accuracy of object detectors, i.e. up to 7.5x
speedup for dynamic domain-specific approximation. To this end, we present our
insights toward harvesting domain-specific approximation as well as devise a
proof-of-concept runtime, AutoFocus, that exploits dynamic domain-specific
approximation.
","[{'version': 'v1', 'created': 'Thu, 4 Oct 2018 00:25:02 GMT'}]",2018-10-05,"[['Chin', 'Ting-Wu', ''], ['Yu', 'Chia-Lin', ''], ['Halpern', 'Matthew', ''], ['Genc', 'Hasan', ''], ['Tsao', 'Shiao-Li', ''], ['Reddi', 'Vijay Janapa', '']]","['approximation computing', 'embedded vision', 'autonomous systems', 'object detection']"
5642,1606.01721,John See,"Sze-Teng Liong, John See, KokSheik Wong, Raphael C.-W. Phan",Less is More: Micro-expression Recognition from Video using Apex Frame,"14 pages double-column, author affiliations updated, acknowledgment
  of grant support added","Signal Processing: Image Communication, Vol. 62, March 2018, pages
  82-92",10.1016/j.image.2017.11.006,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite recent interest and advances in facial micro-expression research,
there is still plenty room for improvement in terms of micro-expression
recognition. Conventional feature extraction approaches for micro-expression
video consider either the whole video sequence or a part of it, for
representation. However, with the high-speed video capture of micro-expressions
(100-200 fps), are all frames necessary to provide a sufficiently meaningful
representation? Is the luxury of data a bane to accurate recognition? A novel
proposition is presented in this paper, whereby we utilize only two images per
video: the apex frame and the onset frame. The apex frame of a video contains
the highest intensity of expression changes among all frames, while the onset
is the perfect choice of a reference frame with neutral expression. A new
feature extractor, Bi-Weighted Oriented Optical Flow (Bi-WOOF) is proposed to
encode essential expressiveness of the apex frame. We evaluated the proposed
method on five micro-expression databases: CAS(ME)$^2$, CASME II, SMIC-HS,
SMIC-NIR and SMIC-VIS. Our experiments lend credence to our hypothesis, with
our proposed technique achieving a state-of-the-art F1-score recognition
performance of 61% and 62% in the high frame rate CASME II and SMIC-HS
databases respectively.
","[{'version': 'v1', 'created': 'Mon, 6 Jun 2016 12:59:14 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Dec 2017 04:04:24 GMT'}, {'version': 'v3', 'created': 'Thu, 15 Feb 2018 06:28:15 GMT'}]",2018-02-16,"[['Liong', 'Sze-Teng', ''], ['See', 'John', ''], ['Wong', 'KokSheik', ''], ['Phan', 'Raphael C. -W.', '']]","['Micro-expressions', 'emotion', 'apex', 'optical flow', 'optical strain', 'recognition']"
5643,2203.15491,Lars Reimann,"Lars Reimann, G\""unter Kniesel-W\""unsche","Improving the Learnability of Machine Learning APIs by Semi-Automated
  API Wrapping","The definitive Version of Record was published in New Ideas and
  Emerging Results (ICSE-NIER'22), May 21-29, 2022, Pittsburgh, PA, USA",,10.1145/3510455.3512789,,cs.SE cs.LG,http://creativecommons.org/licenses/by/4.0/,"  A major hurdle for students and professional software developers who want to
enter the world of machine learning (ML), is mastering not just the scientific
background but also the available ML APIs. Therefore, we address the challenge
of creating APIs that are easy to learn and use, especially by novices.
However, it is not clear how this can be achieved without compromising
expressiveness. We investigate this problem for scikit-learn, a widely used ML
API. In this paper, we analyze its use by the Kaggle community, identifying
unused and apparently useless parts of the API that can be eliminated without
affecting client programs. In addition, we discuss usability issues in the
remaining parts, propose related design improvements and show how they can be
implemented by semi-automated wrapping of the existing third-party API.
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2022 12:42:05 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Apr 2022 13:29:22 GMT'}]",2022-04-07,"[['Reimann', 'Lars', ''], ['Kniesel-Wünsche', 'Günter', '']]","['APIs', 'libraries', 'usability', 'learnability', 'machine learning']"
5644,2001.04910,Alejandro Corti\~nas,"Alejandro Corti\~nas, Miguel R. Luaces, Tirso V. Rodeiro","A Case Study on Visualizing Large Spatial Datasets in a Web-based Map
  Viewer","This research has received funding from the European Union's Horizon
  2020 research and innovation programme under the Marie Sk{\l}odowska-Curie
  Actions H2020-MSCA-RISE-2015 BIRDS GA No. 690941","Proc. of the 18th International Conference On Web Engineering
  (ICWE 2018), Springer International Publishing, Caceres (Spain), 2018, pp.
  296-303",10.1007/978-3-319-91662-0_23,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lately, many companies are using Mobile Workforce Management technologies
combined with information collected by sensors from mobile devices in order to
improve their business processes. Even for small companies, the information
that needs to be handled grows at a high rate, and most of the data collected
have a geographic dimension. Being able to visualize this data in real-time
within a map viewer is a very important deal for these companies. In this paper
we focus on this topic, presenting a case study on visualizing large spatial
datasets. Particularly, since most of the Mobile Workforce Management software
is web-based, we propose a solution suitable for this environment.
","[{'version': 'v1', 'created': 'Tue, 14 Jan 2020 17:09:34 GMT'}]",2020-01-15,"[['Cortiñas', 'Alejandro', ''], ['Luaces', 'Miguel R.', ''], ['Rodeiro', 'Tirso V.', '']]","['spatial big data', 'web-based GIS', 'software architectures']"
5645,2204.08663,Fang Wu,"Fang Wu, Shuting Jin, Yinghui Jiang, Xurui Jin, Bowen Tang, Zhangming
  Niu, Xiangrong Liu, Qiang Zhang, Xiangxiang Zeng, Stan Z. Li","Pre-training of Equivariant Graph Matching Networks with Conformation
  Flexibility for Drug Binding",,Advanced Science 2022,10.1002/advs.202203796,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The latest biological findings observe that the traditional motionless
'lock-and-key' theory is not generally applicable because the receptor and
ligand are constantly moving. Nonetheless, remarkable changes in associated
atomic sites and binding pose can provide vital information in understanding
the process of drug binding. Based on this mechanism, molecular dynamics (MD)
simulations were invented as a useful tool for investigating the dynamic
properties of a molecular system. However, the computational expenditure limits
the growth and application of protein trajectory-related studies, thus
hindering the possibility of supervised learning. To tackle this obstacle, we
present a novel spatial-temporal pre-training method based on the modified
Equivariant Graph Matching Networks (EGMN), dubbed ProtMD, which has two
specially designed self-supervised learning tasks: an atom-level prompt-based
denoising generative task and a conformation-level snapshot ordering task to
seize the flexibility information inside MD trajectories with very fine
temporal resolutions. The ProtMD can grant the encoder network the capacity to
capture the time-dependent geometric mobility of conformations along MD
trajectories. Two downstream tasks are chosen, i.e., the binding affinity
prediction and the ligand efficacy prediction, to verify the effectiveness of
ProtMD through linear detection and task-specific fine-tuning. We observe a
huge improvement from current state-of-the-art methods, with a decrease of
4.3\% in RMSE for the binding affinity problem and an average increase of
13.8\% in AUROC and AUPRC for the ligand efficacy problem. The results
demonstrate valuable insight into a strong correlation between the magnitude of
conformation's motion in the 3D space (i.e., flexibility) and the strength with
which the ligand binds with its receptor.
","[{'version': 'v1', 'created': 'Tue, 19 Apr 2022 04:55:43 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Jun 2022 03:57:44 GMT'}, {'version': 'v3', 'created': 'Thu, 9 Jun 2022 05:17:20 GMT'}, {'version': 'v4', 'created': 'Sat, 7 Jan 2023 06:20:34 GMT'}]",2023-01-10,"[['Wu', 'Fang', ''], ['Jin', 'Shuting', ''], ['Jiang', 'Yinghui', ''], ['Jin', 'Xurui', ''], ['Tang', 'Bowen', ''], ['Niu', 'Zhangming', ''], ['Liu', 'Xiangrong', ''], ['Zhang', 'Qiang', ''], ['Zeng', 'Xiangxiang', ''], ['Li', 'Stan Z.', '']]","['Deep Learning', 'Pre-training', 'Drug Binding', 'Molecular Dynamics']"
5646,1712.04980,Abbas Kiani,"Abbas Kiani, Nirwan Ansari",Edge Computing Aware NOMA for 5G Networks,,"IEEE Internet of Things Journal, 2018",10.1109/JIOT.2018.2796542,TR-ANL-2017-007,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the fast development of Internet of things (IoT), the fifth generation
(5G) wireless networks need to provide massive connectivity of IoT devices and
meet the demand for low latency. To satisfy these requirements, Non-Orthogonal
Multiple Access (NOMA) has been recognized as a promising solution for 5G
networks to significantly improve the network capacity. In parallel with the
development of NOMA techniques, Mobile Edge Computing (MEC) is becoming one of
the key emerging technologies to reduce the latency and improve the Quality of
Service (QoS) for 5G networks. In order to capture the potential gains of NOMA
in the context of MEC, this paper proposes an edge computing aware NOMA
technique which can enjoy the benefits of uplink NOMA in reducing MEC users'
uplink energy consumption. To this end, we formulate a NOMA based optimization
framework which minimizes the energy consumption of MEC users via optimizing
the user clustering, computing and communication resource allocation, and
transmit powers. In particular, similar to frequency Resource Blocks (RBs), we
divide the computing capacity available at the cloudlet to computing RBs.
Accordingly, we explore the joint allocation of the frequency and computing RBs
to the users that are assigned to different order indices within the NOMA
clusters. We also design an efficient heuristic algorithm for user clustering
and RBs allocation, and formulate a convex optimization problem for the power
control to be solved independently per NOMA cluster. The performance of the
proposed NOMA scheme is evaluated via simulations.
","[{'version': 'v1', 'created': 'Wed, 13 Dec 2017 19:52:29 GMT'}]",2018-02-07,"[['Kiani', 'Abbas', ''], ['Ansari', 'Nirwan', '']]","['Mobile edge computing', 'NOMA', 'power control']"
5647,2206.03288,Jiannan Guo,"Jiannan Guo, Yangyang Kang, Yu Duan, Xiaozhong Liu, Siliang Tang,
  Wenqiao Zhang, Kun Kuang, Changlong Sun, Fei Wu","Collaborative Intelligence Orchestration: Inconsistency-Based Fusion of
  Semi-Supervised Learning and Active Learning",Accepted to KDD 2022,,10.1145/3534678.3539022,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While annotating decent amounts of data to satisfy sophisticated learning
models can be cost-prohibitive for many real-world applications. Active
learning (AL) and semi-supervised learning (SSL) are two effective, but often
isolated, means to alleviate the data-hungry problem. Some recent studies
explored the potential of combining AL and SSL to better probe the unlabeled
data. However, almost all these contemporary SSL-AL works use a simple
combination strategy, ignoring SSL and AL's inherent relation. Further, other
methods suffer from high computational costs when dealing with large-scale,
high-dimensional datasets. Motivated by the industry practice of labeling data,
we propose an innovative Inconsistency-based virtual aDvErsarial Active
Learning (IDEAL) algorithm to further investigate SSL-AL's potential
superiority and achieve mutual enhancement of AL and SSL, i.e., SSL propagates
label information to unlabeled samples and provides smoothed embeddings for AL,
while AL excludes samples with inconsistent predictions and considerable
uncertainty for SSL. We estimate unlabeled samples' inconsistency by
augmentation strategies of different granularities, including fine-grained
continuous perturbation exploration and coarse-grained data transformations.
Extensive experiments, in both text and image domains, validate the
effectiveness of the proposed algorithm, comparing it against state-of-the-art
baselines. Two real-world case studies visualize the practical industrial value
of applying and deploying the proposed data sampling algorithm.
","[{'version': 'v1', 'created': 'Tue, 7 Jun 2022 13:28:43 GMT'}]",2022-06-08,"[['Guo', 'Jiannan', ''], ['Kang', 'Yangyang', ''], ['Duan', 'Yu', ''], ['Liu', 'Xiaozhong', ''], ['Tang', 'Siliang', ''], ['Zhang', 'Wenqiao', ''], ['Kuang', 'Kun', ''], ['Sun', 'Changlong', ''], ['Wu', 'Fei', '']]","['active learning', 'semi-supervised learning', 'adversarial learning']"
5648,1708.05545,Amarnath R,Amarnath R and P. Nagabhushan,"Spotting Separator Points at Line Terminals in Compressed Document
  Images for Text-line Segmentation","Line separators, Document image analysis, Handwritten text,
  Compression and decompression, RLE, CCITT. Line separator points at every
  line terminal in a compressed handwritten document images enabling text line
  segmentation","International Journal of Computer Applications 172(4): 40-47
  (2017)",10.5120/ijca2017915133,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Line separators are used to segregate text-lines from one another in document
image analysis. Finding the separator points at every line terminal in a
document image would enable text-line segmentation. In particular, identifying
the separators in handwritten text could be a thrilling exercise. Obviously it
would be challenging to perform this in the compressed version of a document
image and that is the proposed objective in this research. Such an effort would
prevent the computational burden of decompressing a document for text-line
segmentation. Since document images are generally compressed using run length
encoding (RLE) technique as per the CCITT standards, the first column in the
RLE will be a white column. The value (depth) in the white column is very low
when a particular line is a text line and the depth could be larger at the
point of text line separation. A longer consecutive sequence of such larger
depth should indicate the gap between the text lines, which provides the
separator region. In case of over separation and under separation issues,
corrective actions such as deletion and insertion are suggested respectively.
An extensive experimentation is conducted on the compressed images of the
benchmark datasets of ICDAR13 and Alireza et al [17] to demonstrate the
efficacy.
","[{'version': 'v1', 'created': 'Fri, 18 Aug 2017 09:51:17 GMT'}]",2017-08-21,"[['R', 'Amarnath', ''], ['Nagabhushan', 'P.', '']]","['Line separators', 'Document image analysis', 'Handwritten text', 'Compression and decompression', 'RLE', 'CCITT']"
5649,1401.7528,Reza Farrahi Moghaddam,"Reza Farrahi Moghaddam, Vahid Asghari, Fereydoun Farrahi Moghaddam,
  Yves Lemieux, Mohamed Cheriet","A Monte-Carlo Approach to Lifespan Failure Performance Analysis of the
  Network Fabric in Modular Data Centers","29 Pages, 14 figures",,10.1016/j.jnca.2017.03.015,,cs.PF cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data centers have been evolved from a passive element of compute
infrastructure to become an active, core part of any ICT solution. In
particular, modular data centers (MDCs), which are a promising design approach
to improve resiliency of data centers, can play a key role in deploying ICT
infrastructure in remote and inhospitable environments in order to take
advantage of low temperatures and hydro- and wind-electric capabilities. This
is because of capability of the modular data centers to survive even in lack of
continuous on-site maintenance and support. The most critical part of a data
center is its network fabric that could impede the whole system even if all
other components are fully functional, assuming that other analyses has been
already performed to ensure the reliability of the underlying infrastructure
and support systems. In this work, a complete failure analysis of modular data
centers using failure models of various components including servers, switches,
and links is performed using a proposed Monte-Carlo approach. The proposed
Monte-Carlo approach, which is based on the concept of snapshots, allows us to
effectively calculate the performance of a design along its lifespan even up to
the terminal stages. To show the capabilities of the proposed approach, various
network topologies, such as FatTree, BCube, MDCube, and their modifications are
considered. The performance and also the lifespan of each topology design in
presence of failures of their components are studied against the topology
parameters.
","[{'version': 'v1', 'created': 'Wed, 29 Jan 2014 15:02:16 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Mar 2014 03:33:12 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Mar 2017 16:23:49 GMT'}]",2017-03-23,"[['Moghaddam', 'Reza Farrahi', ''], ['Asghari', 'Vahid', ''], ['Moghaddam', 'Fereydoun Farrahi', ''], ['Lemieux', 'Yves', ''], ['Cheriet', 'Mohamed', '']]","['Monte-Carlo Analysis', 'Failure Analysis', 'Modular Data Centers', 'Network Topology']"
5650,2103.17213,Andrea Loddo,"Andrea Loddo, Cecilia Di Ruberto, A.M.P.G. Vale, Mariano Ucchesu, J.M.
  Soares, Gianluigi Bacchetta",An effective and friendly tool for seed image analysis,,,10.1007/s00371-021-02333-w,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image analysis is an essential field for several topics in the life sciences,
such as biology or botany. In particular, the analysis of seeds (e.g. fossil
research) can provide significant information on their evolution, the history
of agriculture, plant domestication and knowledge of diets in ancient times.
This work aims to present software that performs image analysis for feature
extraction and classification from images containing seeds through a novel and
unique framework. In detail, we propose two plugins \emph{ImageJ}, one able to
extract morphological, textual and colour features from seed images, and
another to classify seeds into categories using the extracted features. The
experimental results demonstrated the correctness and validity of both the
extracted features and the classification predictions. The proposed tool is
easily extendable to other fields of image analysis.
","[{'version': 'v1', 'created': 'Wed, 31 Mar 2021 16:56:22 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Jul 2021 10:34:12 GMT'}]",2022-01-19,"[['Loddo', 'Andrea', ''], ['Di Ruberto', 'Cecilia', ''], ['Vale', 'A. M. P. G.', ''], ['Ucchesu', 'Mariano', ''], ['Soares', 'J. M.', ''], ['Bacchetta', 'Gianluigi', '']]","['image analysis', 'features', 'classification', 'biology', 'seeds', 'ImageJ']"
5651,1903.06249,Saeed Masoudnia,"Omid Mersa, Farhood Etaati, Saeed Masoudnia and Babak N. Araabi","Learning Representations from Persian Handwriting for Offline Signature
  Verification, a Deep Transfer Learning Approach",,"2019 4th International Conference on Pattern Recognition and Image
  Analysis (IPRIA)",10.1109/PRIA.2019.8785979,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Offline Signature Verification (OSV) is a challenging pattern recognition
task, especially when it is expected to generalize well on the skilled
forgeries that are not available during the training. Its challenges also
include small training sample and large intra-class variations. Considering the
limitations, we suggest a novel transfer learning approach from Persian
handwriting domain to multi-language OSV domain. We train two Residual CNNs on
the source domain separately based on two different tasks of word
classification and writer identification. Since identifying a person signature
resembles identifying ones handwriting, it seems perfectly convenient to use
handwriting for the feature learning phase. The learned representation on the
more varied and plentiful handwriting dataset can compensate for the lack of
training data in the original task, i.e. OSV, without sacrificing the
generalizability. Our proposed OSV system includes two steps: learning
representation and verification of the input signature. For the first step, the
signature images are fed into the trained Residual CNNs. The output
representations are then used to train SVMs for the verification. We test our
OSV system on three different signature datasets, including MCYT (a Spanish
signature dataset), UTSig (a Persian one) and GPDS-Synthetic (an artificial
dataset). On UT-SIG, we achieved 9.80% Equal Error Rate (EER) which showed
substantial improvement over the best EER in the literature, 17.45%. Our
proposed method surpassed state-of-the-arts by 6% on GPDS-Synthetic, achieving
6.81%. On MCYT, EER of 3.98% was obtained which is comparable to the best
previously reported results.
","[{'version': 'v1', 'created': 'Thu, 28 Feb 2019 08:13:55 GMT'}]",2019-08-09,"[['Mersa', 'Omid', ''], ['Etaati', 'Farhood', ''], ['Masoudnia', 'Saeed', ''], ['Araabi', 'Babak N.', '']]","['Transfer learning', 'Persian Handwriting', 'Offline']"
5652,2103.08253,Sebastian Gajek,"Sebastian Gajek, Matti Schneider and Thomas B\""ohlke","An FE-DMN method for the multiscale analysis of fiber reinforced plastic
  components","Submitted to ""Computer Methods in Applied Mechanics and Engineering""","Computer Methods in Applied Mechanics and Engineering 384 (2021)
  113952",10.1016/j.cma.2021.113952,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we propose a fully coupled multiscale strategy for components
made from short fiber reinforced composites, where each Gauss point of the
macroscopic finite element model is equipped with a deep material network (DMN)
which covers the different fiber orientation states varying within the
component. These DMNs need to be identified by linear elastic precomputations
on representative volume elements, and serve as high-fidelity surrogates for
full-field simulations on microstructures with inelastic constituents. We
discuss how to extend direct DMNs to account for varying fiber orientation, and
propose a simplified sampling strategy which significantly speeds up the
training process. To enable concurrent multiscale simulations, evaluating the
DMNs efficiently is crucial. We discuss dedicated techniques for exploiting
sparsity and high-performance linear algebra modules, and demonstrate the power
of the proposed approach on an industrial-scale three-dimensional component.
Indeed, the DMN is capable of accelerating two-scale simulations significantly,
providing possible speed-ups of several magnitudes.
","[{'version': 'v1', 'created': 'Mon, 15 Mar 2021 10:06:11 GMT'}]",2021-09-24,"[['Gajek', 'Sebastian', ''], ['Schneider', 'Matti', ''], ['Böhlke', 'Thomas', '']]","['Micromechanics', 'computational homogenization', 'multiscale simulation', 'deep materialnetworks', 'laminates', 'short fiber reinforced composites']"
5653,1806.04311,Mohamed Faten Zhani,"Richard Olaniyan, Olamilekan Fadahunsi, Muthucumaru Maheswaran,
  Mohamed Faten Zhani","Opportunistic Edge Computing: Concepts, Opportunities and Research
  Challenges","22 pages, 10 figures, journal paper","Elsevier Future Generation Computer Systems Journal, 2018",10.1016/j.future.2018.07.040,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The growing need for low-latency access to computing resources has motivated
the introduction of edge computing, where resources are strategically placed at
the access networks. Unfortunately, edge computing infrastructures like fogs
and cloudlets have limited scalability and may be prohibitively expensive to
install given the vast edge of the Internet. In this paper, we present
Opportunistic Edge Computing (OEC), a new computing paradigm that provides a
framework to create scalable infrastructures at the edge using end-user
contributed resources. One of the goals of OEC is to place resources where
there is high demand for them by incentivizing people to share their resources.
This paper defines the OEC paradigm and the involved stakeholders and puts
forward a management framework to build, manage and monitor scalable edge
infrastructures. It also highlights the key differences between the OEC
computing models and the existing computing models and shed the light on early
works on the topic. The paper also presents preliminary experimental results
that highlight the benefits and the limitations of OEC compared to the regular
cloud computing deployment and the Fog deployment. It finally summarizes key
research directions pertaining to resource management in OEC environments.
","[{'version': 'v1', 'created': 'Tue, 12 Jun 2018 03:09:25 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Jul 2018 18:56:32 GMT'}, {'version': 'v3', 'created': 'Tue, 24 Jul 2018 20:14:48 GMT'}]",2018-07-26,"[['Olaniyan', 'Richard', ''], ['Fadahunsi', 'Olamilekan', ''], ['Maheswaran', 'Muthucumaru', ''], ['Zhani', 'Mohamed Faten', '']]","['Opportunistic Edge Computing', 'Fog Computing', 'Cloud Computing', 'Resource management']"
5654,2007.00570,Nina Pardal,"Flavia Bonomo-Braberman, Guillermo A. Dur\'an, Nina Pardal, Mart\'in
  D. Safe","Forbidden induced subgraph characterization of circle graphs within
  split graphs","59 pages, 15 figures",,10.1016/j.dam.2020.12.021,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A graph is circle if its vertices are in correspondence with a family of
chords in a circle in such a way that every two distinct vertices are adjacent
if and only if the corresponding chords have nonempty intersection. Even though
there are diverse characterizations of circle graphs, a structural
characterization by minimal forbidden induced subgraphs for the entire class of
circle graphs is not known, not even restricted to split graphs (which are the
graphs whose vertex set can be partitioned into a clique and a stable set). In
this work, we give a characterization by minimal forbidden induced subgraphs of
circle graphs, restricted to split graphs.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2020 15:56:34 GMT'}]",2021-03-08,"[['Bonomo-Braberman', 'Flavia', ''], ['Durán', 'Guillermo A.', ''], ['Pardal', 'Nina', ''], ['Safe', 'Martín D.', '']]","['circle graphs', 'forbidden induced subgraphs', 'split graphs', 'structural characterization']"
5655,2108.06606,Aman Kataria Dr.,"Aman Kataria, Smarajit Ghosh and Vinod Karar","Prediction Analysis of Optical Tracker Parameters using Machine Learning
  Approaches for efficient Head Tracking","7 Pages, 9 Figures, 7 tables","International Journal of Recent Technology and Engineering, Volume
  8 , Issue 3, September 2019",10.35940/ijrte.C4860.098319,,cs.NI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  A head tracker is a crucial part of the head mounted display systems, as it
tracks the head of the pilot in the plane/cockpit simulator. The operational
flaws of head trackers are also dependent on different environmental conditions
like different lighting conditions and stray light interference. In this
letter, an optical tracker has been employed to gather the 6-DoF data of head
movements under different environmental conditions. Also, the effect of
different environmental conditions and variation in distance between the
receiver and optical transmitter on the 6-DoF data was analyzed.
","[{'version': 'v1', 'created': 'Sat, 14 Aug 2021 19:27:38 GMT'}]",2021-08-17,"[['Kataria', 'Aman', ''], ['Ghosh', 'Smarajit', ''], ['Karar', 'Vinod', '']]","['Machine Learning', 'Head Tracking', 'Random Forest', 'Optical Head Tracking', 'Aviation']"
5656,2210.11991,Bram Vanherle,"Bram Vanherle, Jeroen Put, Nick Michiels, Frank Van Reeth",Real-time Detection of 2D Tool Landmarks with Synthetic Training Data,,"ROBOVIS, 2021, 40-47",10.5220/0010689900003061,,cs.CV cs.AI,http://creativecommons.org/licenses/by/4.0/,"  In this paper a deep learning architecture is presented that can, in real
time, detect the 2D locations of certain landmarks of physical tools, such as a
hammer or screwdriver. To avoid the labor of manual labeling, the network is
trained on synthetically generated data. Training computer vision models on
computer generated images, while still achieving good accuracy on real images,
is a challenge due to the difference in domain. The proposed method uses an
advanced rendering method in combination with transfer learning and an
intermediate supervision architecture to address this problem. It is shown that
the model presented in this paper, named Intermediate Heatmap Model (IHM),
generalizes to real images when trained on synthetic data. To avoid the need
for an exact textured 3D model of the tool in question, it is shown that the
model will generalize to an unseen tool when trained on a set of different 3D
models of the same type of tool. IHM is compared to two existing approaches to
keypoint detection and it is shown that it outperforms those at detecting tool
landmarks, trained on synthetic data.
","[{'version': 'v1', 'created': 'Fri, 21 Oct 2022 14:31:43 GMT'}]",2022-10-24,"[['Vanherle', 'Bram', ''], ['Put', 'Jeroen', ''], ['Michiels', 'Nick', ''], ['Van Reeth', 'Frank', '']]","['Object Keypoint Detection', 'Deep Learning', 'Synthetic Data Generation']"
5657,2111.07102,Ajoy Mondal Dr.,"Rajdeep Das, Ajoy Mondal, Tapan Chakraborty, and Kuntal Ghosh","Deep Neural Networks for Automatic Grain-matrix Segmentation in Plane
  and Cross-polarized Sandstone Photomicrographs",,,10.1007/s10489-021-02530-z,,cs.CV cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Grain segmentation of sandstone that is partitioning the grain from its
surrounding matrix/cement in the thin section is the primary step for
computer-aided mineral identification and sandstone classification. The
microscopic images of sandstone contain many mineral grains and their
surrounding matrix/cement. The distinction between adjacent grains and the
matrix is often ambiguous, making grain segmentation difficult. Various
solutions exist in literature to handle these problems; however, they are not
robust against sandstone petrography's varied pattern. In this paper, we
formulate grain segmentation as a pixel-wise two-class (i.e., grain and
background) semantic segmentation task. We develop a deep learning-based
end-to-end trainable framework named Deep Semantic Grain Segmentation network
(DSGSN), a data-driven method, and provide a generic solution. As per the
authors' knowledge, this is the first work where the deep neural network is
explored to solve the grain segmentation problem. Extensive experiments on
microscopic images highlight that our method obtains better segmentation
accuracy than various segmentation architectures with more parameters.
","[{'version': 'v1', 'created': 'Sat, 13 Nov 2021 12:04:06 GMT'}]",2021-11-16,"[['Das', 'Rajdeep', ''], ['Mondal', 'Ajoy', ''], ['Chakraborty', 'Tapan', ''], ['Ghosh', 'Kuntal', '']]","['Grain segmentation', 'microscopic sandstone image', 'data-driven', 'semantic segmentation']"
5658,2104.06326,Annalisa Milella,"Giulio Reina, Annalisa Milella, Rocco Galati","Terrain assessment for precision agriculture using vehicle dynamic
  modelling",,biosystems engineering 162 (2017) 124 - 139,10.1016/j.biosystemseng.2017.06.025,,cs.RO cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advances in precision agriculture greatly rely on innovative control and
sensing technologies that allow service units to increase their level of
driving automation while ensuring at the same time high safety standards. This
paper deals with automatic terrain estimation and classification that is
performed simultaneously by an agricultural vehicle during normal operations.
Vehicle mobility and safety, and the successful implementation of important
agricultural tasks including seeding, ploughing, fertilising and controlled
traffic depend or can be improved by a correct identification of the terrain
that is traversed. The novelty of this research lies in that terrain estimation
is performed by using not only traditional appearance-based features, that is
colour and geometric properties, but also contact-based features, that is
measuring physics-based dynamic effects that govern the vehicleeterrain
interaction and that greatly affect its mobility. Experimental results obtained
from an all-terrain vehicle operating on different surfaces are presented to
validate the system in the field. It was shown that a terrain classifier
trained with contact features was able to achieve a correct prediction rate of
85.1%, which is comparable or better than that obtained with approaches using
traditional feature sets. To further improve the classification performance,
all feature sets were merged in an augmented feature space, reaching, for these
tests, 89.1% of correct predictions.
","[{'version': 'v1', 'created': 'Tue, 13 Apr 2021 16:09:01 GMT'}]",2021-04-14,"[['Reina', 'Giulio', ''], ['Milella', 'Annalisa', ''], ['Galati', 'Rocco', '']]","['Self-driving vehicles', 'vehicle dynamics', 'agricultural robotics', 'terrain']"
5659,2107.06790,Mirko Zichichi,"Mirko Zichichi, Luca Serena, Stefano Ferretti, Gabriele D'Angelo",Governing Decentralized Complex Queries Through a DAO,,"Proceedings of the Conference on Information Technology for Social
  Good (GoodIT 2021)",10.1145/3462203.3475910,,cs.DC cs.CR cs.NI cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, a new generation of P2P systems capable of addressing data
integrity and authenticity has emerged for the development of new applications
for a ""more"" decentralized Internet, i.e., Distributed Ledger Technologies
(DLT) and Decentralized File Systems (DFS). However, these technologies still
have some unanswered issues, mostly related to data lookup and discovery. In
this paper, first, we propose a Distributed Hash Table (DHT) system that
efficiently manages decentralized keyword-based queries executed on data stored
in DFS. Through a hypercube logical layout, queries are efficiently routed
among the network, where each node is responsible for a specific keywords set
and the related contents. Second, we provide a framework for the governance of
the above network, based on a Decentralized Autonomous Organization (DAO)
implementation. We show how the use of smart contracts enables organizational
decision making and rewards for nodes that have actively contributed to the
DHT. Finally, we provide experimental validation of an implementation of our
proposal, where the execution of the same protocol for different logical nodes
of the hypercube allows us to evaluate the efficiency of communication within
the network.
","[{'version': 'v1', 'created': 'Wed, 14 Jul 2021 15:46:01 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Sep 2021 15:35:34 GMT'}]",2021-09-13,"[['Zichichi', 'Mirko', ''], ['Serena', 'Luca', ''], ['Ferretti', 'Stefano', ''], [""D'Angelo"", 'Gabriele', '']]","['Distributed Ledger Technology', 'Decentralized File Storage', 'Distributed Hash Table', 'Keyword Search', 'Smart Contracts']"
5660,2203.08069,Rohan Yadav,Rohan Yadav and Alex Aiken and Fredrik Kjolstad,DISTAL: The Distributed Tensor Algebra Compiler,,,10.1145/3519939.3523437,,cs.PL cs.DC,http://creativecommons.org/licenses/by/4.0/,"  We introduce DISTAL, a compiler for dense tensor algebra that targets modern
distributed and heterogeneous systems. DISTAL lets users independently describe
how tensors and computation map onto target machines through separate format
and scheduling languages. The combination of choices for data and computation
distribution creates a large design space that includes many algorithms from
both the past (e.g., Cannon's algorithm) and the present (e.g., COSMA). DISTAL
compiles a tensor algebra domain specific language to a distributed task-based
runtime system and supports nodes with multi-core CPUs and multiple GPUs. Code
generated by DISTAL is competitive with optimized codes for matrix multiply on
256 nodes of the Lassen supercomputer and outperforms existing systems by
between 1.8x to 3.7x (with a 45.7x outlier) on higher order tensor operations.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2022 16:59:56 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Mar 2022 16:42:25 GMT'}]",2022-03-18,"[['Yadav', 'Rohan', ''], ['Aiken', 'Alex', ''], ['Kjolstad', 'Fredrik', '']]","['Compilers', 'Distributed Systems', 'High Performance Computing']"
5661,cs/0703018,Satoshi Matsuoka,Satoshi Matsuoka,A Coding Theoretic Study on MLL proof nets,minor modifications,,10.1017/S0960129511000582,,cs.LO cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Coding theory is very useful for real world applications. A notable example
is digital television. Basically, coding theory is to study a way of detecting
and/or correcting data that may be true or false. Moreover coding theory is an
area of mathematics, in which there is an interplay between many branches of
mathematics, e.g., abstract algebra, combinatorics, discrete geometry,
information theory, etc. In this paper we propose a novel approach for
analyzing proof nets of Multiplicative Linear Logic (MLL) by coding theory. We
define families of proof structures and introduce a metric space for each
family. In each family, 1. an MLL proof net is a true code element; 2. a proof
structure that is not an MLL proof net is a false (or corrupted) code element.
The definition of our metrics reflects the duality of the multiplicative
connectives elegantly. In this paper we show that in the framework one
error-detecting is possible but one error-correcting not. Our proof of the
impossibility of one error-correcting is interesting in the sense that a proof
theoretical property is proved using a graph theoretical argument. In addition,
we show that affine logic and MLL + MIX are not appropriate for this framework.
That explains why MLL is better than such similar logics.
","[{'version': 'v1', 'created': 'Mon, 5 Mar 2007 07:49:55 GMT'}, {'version': 'v10', 'created': 'Thu, 20 Dec 2007 11:48:29 GMT'}, {'version': 'v11', 'created': 'Fri, 23 May 2008 13:51:28 GMT'}, {'version': 'v12', 'created': 'Mon, 26 May 2008 11:58:28 GMT'}, {'version': 'v13', 'created': 'Wed, 28 May 2008 19:46:44 GMT'}, {'version': 'v14', 'created': 'Thu, 29 May 2008 16:30:06 GMT'}, {'version': 'v15', 'created': 'Fri, 30 May 2008 09:03:13 GMT'}, {'version': 'v16', 'created': 'Mon, 2 Jun 2008 08:36:44 GMT'}, {'version': 'v17', 'created': 'Tue, 3 Jun 2008 04:46:49 GMT'}, {'version': 'v18', 'created': 'Mon, 9 Jun 2008 12:00:03 GMT'}, {'version': 'v19', 'created': 'Tue, 10 Jun 2008 12:02:45 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Mar 2007 02:36:44 GMT'}, {'version': 'v20', 'created': 'Sun, 15 Jun 2008 10:13:57 GMT'}, {'version': 'v21', 'created': 'Wed, 18 Jun 2008 19:27:48 GMT'}, {'version': 'v22', 'created': 'Sun, 22 Jun 2008 10:18:35 GMT'}, {'version': 'v23', 'created': 'Fri, 19 Feb 2010 11:21:12 GMT'}, {'version': 'v24', 'created': 'Tue, 6 Jul 2010 07:37:55 GMT'}, {'version': 'v3', 'created': 'Mon, 12 Mar 2007 05:42:45 GMT'}, {'version': 'v4', 'created': 'Mon, 16 Apr 2007 13:41:04 GMT'}, {'version': 'v5', 'created': 'Tue, 17 Apr 2007 08:47:21 GMT'}, {'version': 'v6', 'created': 'Tue, 24 Apr 2007 10:22:17 GMT'}, {'version': 'v7', 'created': 'Mon, 13 Aug 2007 13:49:06 GMT'}, {'version': 'v8', 'created': 'Tue, 14 Aug 2007 07:45:21 GMT'}, {'version': 'v9', 'created': 'Sat, 18 Aug 2007 08:17:45 GMT'}]",2012-02-06,"[['Matsuoka', 'Satoshi', '']]","['Linear Logic', 'proof nets', 'error-correcting codes', 'graph isomorphisms', 'combinatorics']"
5662,2012.01386,Nikhil Kapoor,"Nikhil Kapoor, Chun Yuan, Jonas L\""ohdefink, Roland Zimmermann, Serin
  Varghese, Fabian H\""uger, Nico Schmidt, Peter Schlicht, Tim Fingscheidt","A Self-Supervised Feature Map Augmentation (FMA) Loss and Combined
  Augmentations Finetuning to Efficiently Improve the Robustness of CNNs","Accepted at ACM CSCS 2020 (8 pages, 4 figures)",,10.1145/3385958.3430477,,cs.CV cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks are often not robust to semantically-irrelevant changes
in the input. In this work we address the issue of robustness of
state-of-the-art deep convolutional neural networks (CNNs) against commonly
occurring distortions in the input such as photometric changes, or the addition
of blur and noise. These changes in the input are often accounted for during
training in the form of data augmentation. We have two major contributions:
First, we propose a new regularization loss called feature-map augmentation
(FMA) loss which can be used during finetuning to make a model robust to
several distortions in the input. Second, we propose a new combined
augmentations (CA) finetuning strategy, that results in a single model that is
robust to several augmentation types at the same time in a data-efficient
manner. We use the CA strategy to improve an existing state-of-the-art method
called stability training (ST). Using CA, on an image classification task with
distorted images, we achieve an accuracy improvement of on average 8.94% with
FMA and 8.86% with ST absolute on CIFAR-10 and 8.04% with FMA and 8.27% with ST
absolute on ImageNet, compared to 1.98% and 2.12%, respectively, with the well
known data augmentation method, while keeping the clean baseline performance.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2020 18:32:14 GMT'}]",2020-12-03,"[['Kapoor', 'Nikhil', ''], ['Yuan', 'Chun', ''], ['Löhdefink', 'Jonas', ''], ['Zimmermann', 'Roland', ''], ['Varghese', 'Serin', ''], ['Hüger', 'Fabian', ''], ['Schmidt', 'Nico', ''], ['Schlicht', 'Peter', ''], ['Fingscheidt', 'Tim', '']]","['neural networks', 'robustness', 'data augmentation', 'safety', 'fine-tuning', 'convolutional neural networks']"
5663,1707.01046,Luiz Otavio Vilas Boas Oliveira,"Luis F. Miranda, Luiz Otavio V. B. Oliveira, Joao Francisco B. S.
  Martins, Gisele L. Pappa",How Noisy Data Affects Geometric Semantic Genetic Programming,"8 pages, In proceedings of Genetic and Evolutionary Computation
  Conference (GECCO 2017), Berlin, Germany",,10.1145/3071178.3071300,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Noise is a consequence of acquiring and pre-processing data from the
environment, and shows fluctuations from different sources---e.g., from
sensors, signal processing technology or even human error. As a machine
learning technique, Genetic Programming (GP) is not immune to this problem,
which the field has frequently addressed. Recently, Geometric Semantic Genetic
Programming (GSGP), a semantic-aware branch of GP, has shown robustness and
high generalization capability. Researchers believe these characteristics may
be associated with a lower sensibility to noisy data. However, there is no
systematic study on this matter. This paper performs a deep analysis of the
GSGP performance over the presence of noise. Using 15 synthetic datasets where
noise can be controlled, we added different ratios of noise to the data and
compared the results obtained with those of a canonical GP. The results show
that, as we increase the percentage of noisy instances, the generalization
performance degradation is more pronounced in GSGP than GP. However, in
general, GSGP is more robust to noise than GP in the presence of up to 10% of
noise, and presents no statistical difference for values higher than that in
the test bed.
","[{'version': 'v1', 'created': 'Tue, 4 Jul 2017 15:56:35 GMT'}]",2017-07-05,"[['Miranda', 'Luis F.', ''], ['Oliveira', 'Luiz Otavio V. B.', ''], ['Martins', 'Joao Francisco B. S.', ''], ['Pappa', 'Gisele L.', '']]","['symbolic regression', 'geometric semantic genetic programming', 'noise impact']"
5664,1806.04808,Guansong Pang,"Guansong Pang, Longbing Cao, Ling Chen, Huan Liu","Learning Representations of Ultrahigh-dimensional Data for Random
  Distance-based Outlier Detection","10 pages, 4 figures, 3 tables. To appear in the proceedings of KDD18,
  Long presentation (oral)",,10.1145/3219819.3220042,,cs.LG cs.AI cs.DB stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning expressive low-dimensional representations of ultrahigh-dimensional
data, e.g., data with thousands/millions of features, has been a major way to
enable learning methods to address the curse of dimensionality. However,
existing unsupervised representation learning methods mainly focus on
preserving the data regularity information and learning the representations
independently of subsequent outlier detection methods, which can result in
suboptimal and unstable performance of detecting irregularities (i.e.,
outliers).
  This paper introduces a ranking model-based framework, called RAMODO, to
address this issue. RAMODO unifies representation learning and outlier
detection to learn low-dimensional representations that are tailored for a
state-of-the-art outlier detection approach - the random distance-based
approach. This customized learning yields more optimal and stable
representations for the targeted outlier detectors. Additionally, RAMODO can
leverage little labeled data as prior knowledge to learn more expressive and
application-relevant representations. We instantiate RAMODO to an efficient
method called REPEN to demonstrate the performance of RAMODO.
  Extensive empirical results on eight real-world ultrahigh dimensional data
sets show that REPEN (i) enables a random distance-based detector to obtain
significantly better AUC performance and two orders of magnitude speedup; (ii)
performs substantially better and more stably than four state-of-the-art
representation learning methods; and (iii) leverages less than 1% labeled data
to achieve up to 32% AUC improvement.
","[{'version': 'v1', 'created': 'Wed, 13 Jun 2018 00:53:56 GMT'}]",2018-06-14,"[['Pang', 'Guansong', ''], ['Cao', 'Longbing', ''], ['Chen', 'Ling', ''], ['Liu', 'Huan', '']]","['Outlier Detection', 'Representation Learning', 'Ultrahigh-dimensionalData', 'Dimension Reduction']"
5665,1909.13403,Zinan Lin,"Zinan Lin, Alankar Jain, Chen Wang, Giulia Fanti, Vyas Sekar","Using GANs for Sharing Networked Time Series Data: Challenges, Initial
  Promise, and Open Questions","Published in IMC 2020. 20 pages, 26 figures",,10.1145/3419394.3423643,,cs.LG cs.DC cs.NI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Limited data access is a longstanding barrier to data-driven research and
development in the networked systems community. In this work, we explore if and
how generative adversarial networks (GANs) can be used to incentivize data
sharing by enabling a generic framework for sharing synthetic datasets with
minimal expert knowledge. As a specific target, our focus in this paper is on
time series datasets with metadata (e.g., packet loss rate measurements with
corresponding ISPs). We identify key challenges of existing GAN approaches for
such workloads with respect to fidelity (e.g., long-term dependencies, complex
multidimensional relationships, mode collapse) and privacy (i.e., existing
guarantees are poorly understood and can sacrifice fidelity). To improve
fidelity, we design a custom workflow called DoppelGANger (DG) and demonstrate
that across diverse real-world datasets (e.g., bandwidth measurements, cluster
requests, web sessions) and use cases (e.g., structural characterization,
predictive modeling, algorithm comparison), DG achieves up to 43% better
fidelity than baseline models. Although we do not resolve the privacy problem
in this work, we identify fundamental challenges with both classical notions of
privacy and recent advances to improve the privacy properties of GANs, and
suggest a potential roadmap for addressing these challenges. By shedding light
on the promise and challenges, we hope our work can rekindle the conversation
on workflows for data sharing.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2019 00:13:19 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Sep 2020 06:39:40 GMT'}, {'version': 'v3', 'created': 'Tue, 29 Sep 2020 15:45:27 GMT'}, {'version': 'v4', 'created': 'Sun, 15 Nov 2020 01:20:02 GMT'}, {'version': 'v5', 'created': 'Sun, 17 Jan 2021 04:54:51 GMT'}]",2021-01-19,"[['Lin', 'Zinan', ''], ['Jain', 'Alankar', ''], ['Wang', 'Chen', ''], ['Fanti', 'Giulia', ''], ['Sekar', 'Vyas', '']]","['synthetic data generation', 'time series', 'generative adversarial networks', 'privacy']"
5666,2008.12154,Shuai Wang,"Shuai Wang, Qingchao Kong, Yuqi Wang and Lei Wang","Enhancing Rumor Detection in Social Media Using Dynamic Propagation
  Structures","6 pages, 3figures","2019 IEEE International Conference on Intelligence and Security
  Informatics (ISI)",10.1109/ISI.2019.8823266,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media, such as Facebook and Twitter, has become one of the most
important channels for information dissemination. However, these social media
platforms are often misused to spread rumors, which has brought about severe
social problems, and consequently, there are urgent needs for automatic rumor
detection techniques. Existing work on rumor detection concentrates more on the
utilization of textual features, but diffusion structure itself can provide
critical propagating information in identifying rumors. Previous works which
have considered structural information, only utilize limited propagation
structures. Moreover, few related research has considered the dynamic evolution
of diffusion structures. To address these issues, in this paper, we propose a
Neural Model using Dynamic Propagation Structures (NM-DPS) for rumor detection
in social media. Firstly, we propose a partition approach to model the dynamic
evolution of propagation structure and then use temporal attention based neural
model to learn a representation for the dynamic structure. Finally, we fuse the
structure representation and content features into a unified framework for
effective rumor detection. Experimental results on two real-world social media
datasets demonstrate the salience of dynamic propagation structure information
and the effectiveness of our proposed method in capturing the dynamic
structure.
","[{'version': 'v1', 'created': 'Thu, 27 Aug 2020 14:31:35 GMT'}]",2020-08-28,"[['Wang', 'Shuai', ''], ['Kong', 'Qingchao', ''], ['Wang', 'Yuqi', ''], ['Wang', 'Lei', '']]","['rumor detection', 'dynamic propagation structure', 'diffusion process']"
5667,2205.08148,Yusuke Hirota,"Yusuke Hirota, Yuta Nakashima, Noa Garcia",Gender and Racial Bias in Visual Question Answering Datasets,"ACM Conference on Fairness, Accountability, and Transparency (FAccT
  2022)",,10.1145/3531146.3533184,,cs.CV cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vision-and-language tasks have increasingly drawn more attention as a means
to evaluate human-like reasoning in machine learning models. A popular task in
the field is visual question answering (VQA), which aims to answer questions
about images. However, VQA models have been shown to exploit language bias by
learning the statistical correlations between questions and answers without
looking into the image content: e.g., questions about the color of a banana are
answered with yellow, even if the banana in the image is green. If societal
bias (e.g., sexism, racism, ableism, etc.) is present in the training data,
this problem may be causing VQA models to learn harmful stereotypes. For this
reason, we investigate gender and racial bias in five VQA datasets. In our
analysis, we find that the distribution of answers is highly different between
questions about women and men, as well as the existence of detrimental
gender-stereotypical samples. Likewise, we identify that specific race-related
attributes are underrepresented, whereas potentially discriminatory samples
appear in the analyzed datasets. Our findings suggest that there are dangers
associated to using VQA datasets without considering and dealing with the
potentially harmful stereotypes. We conclude the paper by proposing solutions
to alleviate the problem before, during, and after the dataset collection
process.
","[{'version': 'v1', 'created': 'Tue, 17 May 2022 07:33:24 GMT'}, {'version': 'v2', 'created': 'Wed, 18 May 2022 08:47:20 GMT'}, {'version': 'v3', 'created': 'Fri, 3 Jun 2022 06:36:16 GMT'}]",2022-06-06,"[['Hirota', 'Yusuke', ''], ['Nakashima', 'Yuta', ''], ['Garcia', 'Noa', '']]","['visual question answering', 'gender stereotype', 'racial stereotype', 'datasets']"
5668,1807.08657,Evan Bollig,"Evan F. Bollig, Graham T. Allan, Benjamin J. Lynch, Yectli A. Huerta,
  Mathew Mix, Edward A. Munsell, Raychel M. Benson, Brent Swartz",Leveraging OpenStack and Ceph for a Controlled-Access Data Cloud,"7 pages, 5 figures, PEARC '18: Practice and Experience in Advanced
  Research Computing, July 22--26, 2018, Pittsburgh, PA, USA",,10.1145/3219104.3219165,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  While traditional HPC has and continues to satisfy most workflows, a new
generation of researchers has emerged looking for sophisticated, scalable,
on-demand, and self-service control of compute infrastructure in a cloud-like
environment. Many also seek safe harbors to operate on or store sensitive
and/or controlled-access data in a high capacity environment.
  To cater to these modern users, the Minnesota Supercomputing Institute
designed and deployed Stratus, a locally-hosted cloud environment powered by
the OpenStack platform, and backed by Ceph storage. The subscription-based
service complements existing HPC systems by satisfying the following unmet
needs of our users: a) on-demand availability of compute resources, b)
long-running jobs (i.e., $> 30$ days), c) container-based computing with
Docker, and d) adequate security controls to comply with controlled-access data
requirements.
  This document provides an in-depth look at the design of Stratus with respect
to security and compliance with the NIH's controlled-access data policy.
Emphasis is placed on lessons learned while integrating OpenStack and Ceph
features into a so-called ""walled garden"", and how those technologies
influenced the security design. Many features of Stratus, including tiered
secure storage with the introduction of a controlled-access data ""cache"",
fault-tolerant live-migrations, and fully integrated two-factor authentication,
depend on recent OpenStack and Ceph features.
","[{'version': 'v1', 'created': 'Mon, 23 Jul 2018 15:01:25 GMT'}]",2018-07-24,"[['Bollig', 'Evan F.', ''], ['Allan', 'Graham T.', ''], ['Lynch', 'Benjamin J.', ''], ['Huerta', 'Yectli A.', ''], ['Mix', 'Mathew', ''], ['Munsell', 'Edward A.', ''], ['Benson', 'Raychel M.', ''], ['Swartz', 'Brent', '']]","['OpenStack', 'Ceph', 'Protected Data', 'dbGaP', 'S3', 'Private Cloud', 'Docker', 'Cloud Computing']"
5669,2003.05471,Vage Egiazarian,"Vage Egiazarian, Oleg Voynov, Alexey Artemov, Denis Volkhonskiy,
  Aleksandr Safin, Maria Taktasheva, Denis Zorin, Evgeny Burnaev",Deep Vectorization of Technical Drawings,,,10.1007/978-3-030-58601-0_35,,cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new method for vectorization of technical line drawings, such as
floor plans, architectural drawings, and 2D CAD images. Our method includes (1)
a deep learning-based cleaning stage to eliminate the background and
imperfections in the image and fill in missing parts, (2) a transformer-based
network to estimate vector primitives, and (3) optimization procedure to obtain
the final primitive configurations. We train the networks on synthetic data,
renderings of vector line drawings, and manually vectorized scans of line
drawings. Our method quantitatively and qualitatively outperforms a number of
existing techniques on a collection of representative technical drawings.
","[{'version': 'v1', 'created': 'Wed, 11 Mar 2020 18:19:00 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Mar 2020 20:54:55 GMT'}, {'version': 'v3', 'created': 'Thu, 30 Jul 2020 14:32:11 GMT'}]",2021-01-20,"[['Egiazarian', 'Vage', ''], ['Voynov', 'Oleg', ''], ['Artemov', 'Alexey', ''], ['Volkhonskiy', 'Denis', ''], ['Safin', 'Aleksandr', ''], ['Taktasheva', 'Maria', ''], ['Zorin', 'Denis', ''], ['Burnaev', 'Evgeny', '']]","['transformer network', 'vectorization', 'floor plans', 'technicaldrawings']"
5670,2006.09507,Yingqian Zhang,"Bram Cals, Yingqian Zhang, Remco Dijkman, Claudy van Dorst","Solving the Order Batching and Sequencing Problem using Deep
  Reinforcement Learning",Preprint,Computers & Industrial Engineering 156 (2021): 107221,10.1016/j.cie.2021.107221,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In e-commerce markets, on time delivery is of great importance to customer
satisfaction. In this paper, we present a Deep Reinforcement Learning (DRL)
approach for deciding how and when orders should be batched and picked in a
warehouse to minimize the number of tardy orders. In particular, the technique
facilitates making decisions on whether an order should be picked individually
(pick-by-order) or picked in a batch with other orders (pick-by-batch), and if
so with which other orders. We approach the problem by formulating it as a
semi-Markov decision process and develop a vector-based state representation
that includes the characteristics of the warehouse system. This allows us to
create a deep reinforcement learning solution that learns a strategy by
interacting with the environment and solve the problem with a proximal policy
optimization algorithm. We evaluate the performance of the proposed DRL
approach by comparing it with several batching and sequencing heuristics in
different problem settings. The results show that the DRL approach is able to
develop a strategy that produces consistent, good solutions and performs better
than the proposed heuristics.
","[{'version': 'v1', 'created': 'Tue, 16 Jun 2020 20:40:41 GMT'}]",2021-10-13,"[['Cals', 'Bram', ''], ['Zhang', 'Yingqian', ''], ['Dijkman', 'Remco', ''], ['van Dorst', 'Claudy', '']]","['Deep reinforcement learning', 'Order batching', 'Sequential decision mak']"
5671,2106.10507,Yufei Li,"Ke Chen, Yufei Li, Yingfeng Chen, Changjie Fan, Zhipeng Hu, Wei Yang",GLIB: Towards Automated Test Oracle for Graphically-Rich Applications,ESEC/FSE 2021,,10.1145/3468264.3468586,,cs.SE cs.CV cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  Graphically-rich applications such as games are ubiquitous with attractive
visual effects of Graphical User Interface (GUI) that offers a bridge between
software applications and end-users. However, various types of graphical
glitches may arise from such GUI complexity and have become one of the main
component of software compatibility issues. Our study on bug reports from game
development teams in NetEase Inc. indicates that graphical glitches frequently
occur during the GUI rendering and severely degrade the quality of
graphically-rich applications such as video games. Existing automated testing
techniques for such applications focus mainly on generating various GUI test
sequences and check whether the test sequences can cause crashes. These
techniques require constant human attention to captures non-crashing bugs such
as bugs causing graphical glitches. In this paper, we present the first step in
automating the test oracle for detecting non-crashing bugs in graphically-rich
applications. Specifically, we propose \texttt{GLIB} based on a code-based data
augmentation technique to detect game GUI glitches. We perform an evaluation of
\texttt{GLIB} on 20 real-world game apps (with bug reports available) and the
result shows that \texttt{GLIB} can achieve 100\% precision and 99.5\% recall
in detecting non-crashing bugs such as game GUI glitches. Practical application
of \texttt{GLIB} on another 14 real-world games (without bug reports) further
demonstrates that \texttt{GLIB} can effectively uncover GUI glitches, with 48
of 53 bugs reported by \texttt{GLIB} having been confirmed and fixed so far.
","[{'version': 'v1', 'created': 'Sat, 19 Jun 2021 14:50:43 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Jul 2021 17:22:48 GMT'}, {'version': 'v3', 'created': 'Thu, 15 Jul 2021 22:39:34 GMT'}]",2021-09-24,"[['Chen', 'Ke', ''], ['Li', 'Yufei', ''], ['Chen', 'Yingfeng', ''], ['Fan', 'Changjie', ''], ['Hu', 'Zhipeng', ''], ['Yang', 'Wei', '']]","['Automated Test Oracle', 'Game Testing', 'GUI Testing', 'Deep Learning']"
5672,1906.00931,Jeffrey Uhlmann,Jeffrey Uhlmann and Jie Wang,"On Radically Expanding the Landscape of Potential Applications for
  Automated Proof Methods",Expanded narrative,SN Computer Science (2021) 2:259,10.1007/s42979-021-00674-w,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we examine the potential of computer-assisted proof methods to
be applied much more broadly than commonly recognized. More specifically, we
contend that there are vast opportunities to derive useful mathematical results
and properties that are extremely narrow in scope, and of practical relevance
only to highly-specialized engineering applications, that are presently
overlooked because they have characteristics atypical of those that are
conventionally pursued in the areas of pure and applied mathematics. As a
concrete example, we demonstrate use of automated methods for certifying
polynomial nonnegativity as a part of a dimension-pinning strategy to prove
that the inverse of the relative gain array (RGA) of a d-dimensional
positive-definite matrix is doubly-stochastic for $d\leq 4$.
","[{'version': 'v1', 'created': 'Mon, 3 Jun 2019 17:09:32 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Oct 2019 18:42:18 GMT'}, {'version': 'v3', 'created': 'Wed, 9 Dec 2020 17:05:40 GMT'}]",2021-05-27,"[['Uhlmann', 'Jeffrey', ''], ['Wang', 'Jie', '']]","['Automated Proofs', 'Automated Software Methods', 'ComputerAided System Design', 'Computer-Assisted Proofs', 'SOS Proofs', 'Sum ofSquares Optimization']"
5673,2101.09321,Maria A. Zuluaga,"Vien Ngoc Dang and Francesco Galati and Rosa Cortese and Giuseppe Di
  Giacomo and Viola Marconetto and Prateek Mathur and Karim Lekadir and Marco
  Lorenzi and Ferran Prados and Maria A. Zuluaga","Vessel-CAPTCHA: an efficient learning framework for vessel annotation
  and segmentation",,,10.1016/j.media.2021.102263,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning techniques for 3D brain vessel image segmentation have not been
as successful as in the segmentation of other organs and tissues. This can be
explained by two factors. First, deep learning techniques tend to show poor
performances at the segmentation of relatively small objects compared to the
size of the full image. Second, due to the complexity of vascular trees and the
small size of vessels, it is challenging to obtain the amount of annotated
training data typically needed by deep learning methods. To address these
problems, we propose a novel annotation-efficient deep learning vessel
segmentation framework. The framework avoids pixel-wise annotations, only
requiring weak patch-level labels to discriminate between vessel and non-vessel
2D patches in the training set, in a setup similar to the CAPTCHAs used to
differentiate humans from bots in web applications. The user-provided weak
annotations are used for two tasks: 1) to synthesize pixel-wise pseudo-labels
for vessels and background in each patch, which are used to train a
segmentation network, and 2) to train a classifier network. The classifier
network allows to generate additional weak patch labels, further reducing the
annotation burden, and it acts as a noise filter for poor quality images. We
use this framework for the segmentation of the cerebrovascular tree in
Time-of-Flight angiography (TOF) and Susceptibility-Weighted Images (SWI). The
results show that the framework achieves state-of-the-art accuracy, while
reducing the annotation time by ~77% w.r.t. learning-based segmentation methods
using pixel-wise labels for training.
","[{'version': 'v1', 'created': 'Fri, 22 Jan 2021 20:29:23 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Jan 2021 14:09:45 GMT'}, {'version': 'v3', 'created': 'Fri, 29 Jan 2021 09:44:51 GMT'}, {'version': 'v4', 'created': 'Tue, 20 Jul 2021 12:39:31 GMT'}]",2021-11-04,"[['Dang', 'Vien Ngoc', ''], ['Galati', 'Francesco', ''], ['Cortese', 'Rosa', ''], ['Di Giacomo', 'Giuseppe', ''], ['Marconetto', 'Viola', ''], ['Mathur', 'Prateek', ''], ['Lekadir', 'Karim', ''], ['Lorenzi', 'Marco', ''], ['Prados', 'Ferran', ''], ['Zuluaga', 'Maria A.', '']]","['Efficient Annotation', 'Deep learning', 'Segmentation', 'Cerebrovascular Tree']"
5674,1907.00879,\'Italo Assis,"\'Italo A. S. Assis, Ant\^onio D. S. Oliveira, Tiago Barros, Idalmis
  M. Sardina, Calebe P. Bianchini, Samuel Xavier-de-Souza","Distributed-Memory Load Balancing with Cyclic Token-based Work-Stealing
  Applied to Reverse Time Migration",,,10.1109/ACCESS.2019.2939100,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reverse time migration (RTM) is a prominent technique in seismic imaging. Its
resulting subsurface images are used in the industry to investigate with higher
confidence the existence and the conditions of oil and gas reservoirs. Because
of its high computational cost, RTM must make use of parallel computers.
Balancing the workload distribution of an RTM is a growing challenge in
distributed computing systems. The competition for shared resources and the
differently-sized tasks of the RTM are some of the possible sources of load
imbalance. Although many load balancing techniques exist, scaling up for large
problems and large systems remains a challenge because synchronization overhead
also scales. This paper proposes a cyclic token-based work-stealing (CTWS)
algorithm for distributed memory systems applied to RTM. The novel cyclic token
approach reduces the number of failed steals, avoids communication overhead,
and simplifies the victim selection and the termination strategy. The proposed
method is implemented as a C library using the one-sided communication feature
of the message passing interface (MPI) standard. Results obtained by applying
the proposed technique to balance the workload of a 3D RTM system present a
factor of 14.1% speedup and reductions of the load imbalance of 78.4% when
compared to the conventional static distribution.
","[{'version': 'v1', 'created': 'Mon, 1 Jul 2019 15:49:38 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Aug 2019 14:59:06 GMT'}]",2019-09-05,"[['Assis', 'Ítalo A. S.', ''], ['Oliveira', 'Antônio D. S.', ''], ['Barros', 'Tiago', ''], ['Sardina', 'Idalmis M.', ''], ['Bianchini', 'Calebe P.', ''], ['Xavier-de-Souza', 'Samuel', '']]","['Load balancing', 'Reverse Time Migration', 'Work-Stealing', 'One-Sided Communication', 'Distributed Memory']"
5675,1904.09834,Tamara Radivilova A,Tamara Radivilova and Lyudmyla Kirichenko and Igor Ivanisenko,"Calculation of distributed system imbalance in condition of multifractal
  load","4 pages, 3 figures, 6 equations. arXiv admin note: text overlap with
  arXiv:1904.05218","2016 Third International Scientific-Practical Conference Problems
  of Infocommunications Science and Technology (PIC S&T), Kharkiv, 2016, pp.
  156-158",10.1109/INFOCOMMST.2016.7905366,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The method of calculating a distributed system imbalance based on the
calculation of node system load was proposed in the work. Calculation of node
system load is carried out by calculating the average coefficient of
utilization of CPU, memory, bandwidth of each system node, taking into account
multifractal properties of input data flows. The simulation of the proposed
method for different multifractal parameters was conducted. The simulation
showed that the characteristics of multifractal traffic have a considerable
effect on the system imbalance. Using the proposed method allows to distribute
requests across the servers so that the deviation of the load servers from the
average value was minimal, which allows to get higher system performance
metrics and faster processing flows.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2019 11:35:11 GMT'}]",2019-04-23,"[['Radivilova', 'Tamara', ''], ['Kirichenko', 'Lyudmyla', ''], ['Ivanisenko', 'Igor', '']]","['load balancing', 'distributed system', 'multifractal']"
5676,2011.13226,Han Hu,"Qing Zhu and Shengzhi Huang and Han Hu and Haifeng Li and Min Chen and
  Ruofei Zhong","Depth-Enhanced Feature Pyramid Network for Occlusion-Aware Verification
  of Buildings from Oblique Images",,,10.1016/j.isprsjprs.2021.01.025,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Detecting the changes of buildings in urban environments is essential.
Existing methods that use only nadir images suffer from severe problems of
ambiguous features and occlusions between buildings and other regions.
Furthermore, buildings in urban environments vary significantly in scale, which
leads to performance issues when using single-scale features. To solve these
issues, this paper proposes a fused feature pyramid network, which utilizes
both color and depth data for the 3D verification of existing buildings 2D
footprints from oblique images. First, the color data of oblique images are
enriched with the depth information rendered from 3D mesh models. Second,
multiscale features are fused in the feature pyramid network to convolve both
the color and depth data. Finally, multi-view information from both the nadir
and oblique images is used in a robust voting procedure to label changes in
existing buildings. Experimental evaluations using both the ISPRS benchmark
datasets and Shenzhen datasets reveal that the proposed method outperforms the
ResNet and EfficientNet networks by 5\% and 2\%, respectively, in terms of
recall rate and precision. We demonstrate that the proposed method can
successfully detect all changed buildings; therefore, only those marked as
changed need to be manually checked during the pipeline updating procedure;
this significantly reduces the manual quality control requirements. Moreover,
ablation studies indicate that using depth data, feature pyramid modules, and
multi-view voting strategies can lead to clear and progressive improvements.
","[{'version': 'v1', 'created': 'Thu, 26 Nov 2020 10:51:36 GMT'}, {'version': 'v2', 'created': 'Sat, 23 Jan 2021 08:46:50 GMT'}]",2021-02-25,"[['Zhu', 'Qing', ''], ['Huang', 'Shengzhi', ''], ['Hu', 'Han', ''], ['Li', 'Haifeng', ''], ['Chen', 'Min', ''], ['Zhong', 'Ruofei', '']]","['Building verification', 'Feature Pyramid Network', '3D Modeling', 'Oblique images']"
5677,2206.02784,Christos Diou,"Christos Diou, Konstantinos Kyritsis, Vasileios Papapanagiotou and
  Ioannis Sarafis","Intake Monitoring in Free-Living Conditions: Overview and Lessons we
  Have Learned",,"Appetite, 2022, 106096",10.1016/j.appet.2022.106096,,cs.HC cs.AI,http://creativecommons.org/licenses/by/4.0/,"  The progress in artificial intelligence and machine learning algorithms over
the past decade has enabled the development of new methods for the objective
measurement of eating, including both the measurement of eating episodes as
well as the measurement of in-meal eating behavior. These allow the study of
eating behavior outside the laboratory in free-living conditions, without the
need for video recordings and laborious manual annotations. In this paper, we
present a high-level overview of our recent work on intake monitoring using a
smartwatch, as well as methods using an in-ear microphone. We also present
evaluation results of these methods in challenging, real-world datasets.
Furthermore, we discuss use-cases of such intake monitoring tools for advancing
research in eating behavior, for improving dietary monitoring, as well as for
developing evidence-based health policies. Our goal is to inform researchers
and users of intake monitoring methods regarding (i) the development of new
methods based on commercially available devices, (ii) what to expect in terms
of effectiveness, and (iii) how these methods can be used in research as well
as in practical applications.
","[{'version': 'v1', 'created': 'Sat, 4 Jun 2022 08:38:23 GMT'}]",2022-06-08,"[['Diou', 'Christos', ''], ['Kyritsis', 'Konstantinos', ''], ['Papapanagiotou', 'Vasileios', ''], ['Sarafis', 'Ioannis', '']]","['Objective intake monitoring', 'Passive intake monitoring', 'Wearables', 'Artificial intelligence for dietary monitoring']"
5678,2205.05282,Sungnyun Kim,"Jaehoon Oh, Sungnyun Kim, Namgyu Ho, Jin-Hwa Kim, Hwanjun Song,
  Se-Young Yun","ReFine: Re-randomization before Fine-tuning for Cross-domain Few-shot
  Learning","CIKM 2022 Short; 5 pages, 3 figures, 4 tables",,10.1145/3511808.3557681,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cross-domain few-shot learning (CD-FSL), where there are few target samples
under extreme differences between source and target domains, has recently
attracted huge attention. Recent studies on CD-FSL generally focus on transfer
learning based approaches, where a neural network is pre-trained on popular
labeled source domain datasets and then transferred to target domain data.
Although the labeled datasets may provide suitable initial parameters for the
target data, the domain difference between the source and target might hinder
fine-tuning on the target domain. This paper proposes a simple yet powerful
method that re-randomizes the parameters fitted on the source domain before
adapting to the target data. The re-randomization resets source-specific
parameters of the source pre-trained model and thus facilitates fine-tuning on
the target domain, improving few-shot performance.
","[{'version': 'v1', 'created': 'Wed, 11 May 2022 05:59:49 GMT'}, {'version': 'v2', 'created': 'Sun, 19 Jun 2022 05:59:43 GMT'}, {'version': 'v3', 'created': 'Sat, 17 Sep 2022 15:40:17 GMT'}]",2022-09-20,"[['Oh', 'Jaehoon', ''], ['Kim', 'Sungnyun', ''], ['Ho', 'Namgyu', ''], ['Kim', 'Jin-Hwa', ''], ['Song', 'Hwanjun', ''], ['Yun', 'Se-Young', '']]","['cross-domain', 'few-shot', 'transfer learning', 're-randomization']"
5679,2206.10795,Maneesha Perera,"Maneesha Perera, Julian De Hoog, Kasun Bandara and Saman Halgamuge","Multi-Resolution, Multi-Horizon Distributed Solar PV Power Forecasting
  with Forecast Combinations",,Expert Systems with Applications 205 (2022),10.1016/j.eswa.2022.117690,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Distributed, small-scale solar photovoltaic (PV) systems are being installed
at a rapidly increasing rate. This can cause major impacts on distribution
networks and energy markets. As a result, there is a significant need for
improved forecasting of the power generation of these systems at different time
resolutions and horizons. However, the performance of forecasting models
depends on the resolution and horizon. Forecast combinations (ensembles), that
combine the forecasts of multiple models into a single forecast may be robust
in such cases. Therefore, in this paper, we provide comparisons and insights
into the performance of five state-of-the-art forecast models and existing
forecast combinations at multiple resolutions and horizons. We propose a
forecast combination approach based on particle swarm optimization (PSO) that
will enable a forecaster to produce accurate forecasts for the task at hand by
weighting the forecasts produced by individual models. Furthermore, we compare
the performance of the proposed combination approach with existing forecast
combination approaches. A comprehensive evaluation is conducted using a
real-world residential PV power data set measured at 25 houses located in three
locations in the United States. The results across four different resolutions
and four different horizons show that the PSO-based forecast combination
approach outperforms the use of any individual forecast model and other
forecast combination counterparts, with an average Mean Absolute Scaled Error
reduction by 3.81% compared to the best performing individual model. Our
approach enables a solar forecaster to produce accurate forecasts for their
application regardless of the forecast resolution or horizon.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2022 01:27:04 GMT'}]",2022-06-23,"[['Perera', 'Maneesha', ''], ['De Hoog', 'Julian', ''], ['Bandara', 'Kasun', ''], ['Halgamuge', 'Saman', '']]","['Solar Photovoltaic Power Forecasting', 'Forecast Combinations', 'Ensembles', 'Particle Swarm Optimization', 'Multi-Resolution', 'Multi-Horizon']"
5680,2106.11181,Junbin Zhang,"Pei-Hsuan Tsai, Yu-Lin Tseng, Jun-Bin Zhang, Meng-Hsun Tsai",A Query-based Routing Table Update Mechanism for Content-Centric Network,"6 pages, 14 figures, conference. ISBN:978-1-7281-9256-7","2020 International Computer Symposium (ICS), 2020, pp. 266-271",10.1109/ICS51289.2020.00060,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the popularity of network applications, such as multimedia, online
shopping, Internet of Things (IoT), and 5G, the contents cached in the routers
are frequently replaced in Content-Centric Networking (CCN). Generally, cache
miss causes numerous propagated packets to get the required content that
deteriorates network congestion and delay the response time of consumers. Many
caching strategies and routing policies were proposed to solve the problem.
This paper presents an alternative solution by designing a query-based routing
table update mechanism to increase the accuracy of routing tables. By adding an
additional query content in interest packets, our approach real-time explores
the cached content in routers and updated the routing table accordingly. This
paper uses a general network simulator, ndnSIM, to compare basic CCN and our
approach. The results show that our approach improves the response time of
consumers and network congestion and is compatible with general forwarding
strategies.
","[{'version': 'v1', 'created': 'Mon, 21 Jun 2021 15:20:21 GMT'}]",2021-06-22,"[['Tsai', 'Pei-Hsuan', ''], ['Tseng', 'Yu-Lin', ''], ['Zhang', 'Jun-Bin', ''], ['Tsai', 'Meng-Hsun', '']]","['content-centric networking', 'routing table', 'query name', 'exploration', 'update mechanism']"
5681,2103.11100,Vivek Kumar Singh Ph.D.,"Vivek Kumar Singh, Prashasti Singh, Ashraf Uddin, Parveen Arora, Sujit
  Bhattacharya","Exploring the relationship between journals indexed from a country and
  its research output: An empirical investigation",6 figures and 4 tables,Scientometrics 2022,10.1007/s11192-022-04366-x,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Scientific journals are currently the primary medium used by researchers to
report their research findings. The transformation of print journals into
e-journals has simplified the process of submissions to journals and also their
access has become wider. Journals are usually published by commercial
publishers, learned societies as well as Universities. There are different
number of journals published from different countries. This paper attempts to
explore whether the number of journals published from a country influences its
research output. Scopus master journal list is analysed to identify journals
published from 50 selected countries with significant volume of research
output. The following relationship are analysed: (a) number of journals from a
country and its research output, (b) growth rate of journals and research
output for different countries, (c) global share of journals and research
output for different countries, and (d) subject area-wise number of journals
and research output in that subject area for different countries. Factors like
journal packing density are also analysed. The results obtained show that for
majority of the countries, the number of journals is positively correlated to
their research output volume, though some other factors also play a role in
growth of research output. The study at the end presents a discussion of the
analytical outcomes and provides useful suggestions on policy perspectives for
different countries.
","[{'version': 'v1', 'created': 'Sat, 20 Mar 2021 05:17:16 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Jul 2022 02:15:37 GMT'}]",2022-08-01,"[['Singh', 'Vivek Kumar', ''], ['Singh', 'Prashasti', ''], ['Uddin', 'Ashraf', ''], ['Arora', 'Parveen', ''], ['Bhattacharya', 'Sujit', '']]","['Journal Indexing', 'Publication Sources', 'Research Productivity', 'Scholarly Databases', 'Scholarly journals', 'Scopus']"
5682,2107.02317,Luis Carlos Garcia-Peraza-Herrera,"Caspar Gruijthuijsen, Luis C. Garcia-Peraza-Herrera, Gianni Borghesan,
  Dominiek Reynaerts, Jan Deprest, Sebastien Ourselin, Tom Vercauteren,
  Emmanuel Vander Poorten",Robotic Endoscope Control via Autonomous Instrument Tracking,"Caspar Gruijthuijsen and Luis C. Garcia-Peraza-Herrera have
  contributed equally to this work and share first authorship",,10.3389/frobt.2022.832208,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many keyhole interventions rely on bi-manual handling of surgical
instruments, forcing the main surgeon to rely on a second surgeon to act as a
camera assistant. In addition to the burden of excessively involving surgical
staff, this may lead to reduced image stability, increased task completion time
and sometimes errors due to the monotony of the task. Robotic endoscope
holders, controlled by a set of basic instructions, have been proposed as an
alternative, but their unnatural handling may increase the cognitive load of
the (solo) surgeon, which hinders their clinical acceptance. More seamless
integration in the surgical workflow would be achieved if robotic endoscope
holders collaborated with the operating surgeon via semantically rich
instructions that closely resemble instructions that would otherwise be issued
to a human camera assistant, such as ""focus on my right-hand instrument"". As a
proof of concept, this paper presents a novel system that paves the way towards
a synergistic interaction between surgeons and robotic endoscope holders. The
proposed platform allows the surgeon to perform a bimanual coordination and
navigation task, while a robotic arm autonomously performs the endoscope
positioning tasks. Within our system, we propose a novel tooltip localization
method based on surgical tool segmentation and a novel visual servoing approach
that ensures smooth and appropriate motion of the endoscope camera. We validate
our vision pipeline and run a user study of this system. The clinical relevance
of the study is ensured through the use of a laparoscopic exercise validated by
the European Academy of Gynaecological Surgery which involves bi-manual
coordination and navigation. Successful application of our proposed system
provides a promising starting point towards broader clinical adoption of
robotic endoscope holders.
","[{'version': 'v1', 'created': 'Mon, 5 Jul 2021 23:24:46 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Dec 2021 20:28:35 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Feb 2022 16:46:46 GMT'}]",2022-07-28,"[['Gruijthuijsen', 'Caspar', ''], ['Garcia-Peraza-Herrera', 'Luis C.', ''], ['Borghesan', 'Gianni', ''], ['Reynaerts', 'Dominiek', ''], ['Deprest', 'Jan', ''], ['Ourselin', 'Sebastien', ''], ['Vercauteren', 'Tom', ''], ['Poorten', 'Emmanuel Vander', '']]","['Minimally Invasive Surgery', 'Endoscope Holders', 'Endoscope Robots', 'Endoscope Control', 'Visual Servoing']"
5683,1811.05902,Gerard Llorach,Gerard Llorach and Josep Blat,Say Hi to Eliza. An Embodied Conversational Agent on the Web,"4 Pages, 1 figure, 17th International Conference Intelligence Virtual
  Agents (IVA)",,10.1007/978-3-319-67401-8_34,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The creation and support of Embodied Conversational Agents (ECAs) has been
quite challenging, as features required might not be straight-forward to
implement and to integrate in a single application. Furthermore, ECAs as
desktop applications present drawbacks for both developers and users; the
former have to develop for each device and operating system and the latter must
install additional software, limiting their widespread use. In this paper we
demonstrate how recent advances in web technologies show promising steps
towards capable web-based ECAs, through some off-the-shelf technologies, in
particular, the Web Speech API, Web Audio API, WebGL and Web Workers. We
describe their integration into a simple fully functional web-based 3D ECA
accessible from any modern device, with special attention to our novel work in
the creation and support of the embodiment aspects.
","[{'version': 'v1', 'created': 'Wed, 14 Nov 2018 16:55:01 GMT'}]",2018-11-15,"[['Llorach', 'Gerard', ''], ['Blat', 'Josep', '']]","['embodied conversational agents', 'web technologies', 'virtualcharacters']"
5684,1909.01056,Koustav Ghosal,"Xu Zheng, Tejo Chalasani, Koustav Ghosal, Sebastian Lutz, Aljosa
  Smolic",STaDA: Style Transfer as Data Augmentation,"14th International Conference on Computer Vision Theory and
  Applications, 2019",,10.5220/0007353401070114,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The success of training deep Convolutional Neural Networks (CNNs) heavily
depends on a significant amount of labelled data. Recent research has found
that neural style transfer algorithms can apply the artistic style of one image
to another image without changing the latter's high-level semantic content,
which makes it feasible to employ neural style transfer as a data augmentation
method to add more variation to the training dataset. The contribution of this
paper is a thorough evaluation of the effectiveness of the neural style
transfer as a data augmentation method for image classification tasks. We
explore the state-of-the-art neural style transfer algorithms and apply them as
a data augmentation method on Caltech 101 and Caltech 256 dataset, where we
found around 2% improvement from 83% to 85% of the image classification
accuracy with VGG16, compared with traditional data augmentation strategies. We
also combine this new method with conventional data augmentation approaches to
further improve the performance of image classification. This work shows the
potential of neural style transfer in computer vision field, such as helping us
to reduce the difficulty of collecting sufficient labelled data and improve the
performance of generic image-based deep learning algorithms.
","[{'version': 'v1', 'created': 'Tue, 3 Sep 2019 10:48:42 GMT'}]",2019-09-04,"[['Zheng', 'Xu', ''], ['Chalasani', 'Tejo', ''], ['Ghosal', 'Koustav', ''], ['Lutz', 'Sebastian', ''], ['Smolic', 'Aljosa', '']]","['Neural Style Transfer', 'Data Augmentation', 'Image Classification']"
5685,2005.06270,Ond\v{r}ej Benedikt,"Ond\v{r}ej Benedikt, P\v{r}emysl \v{S}\r{u}cha, Zden\v{e}k Hanz\'alek","On Idle Energy Consumption Minimization in Production: Industrial
  Example and Mathematical Model","Accepted to 9th International Conference on Operations Research and
  Enterprise Systems (ICORES 2020)","In Proceedings of the 9th International Conference on Operations
  Research and Enterprise Systems - Volume 1: ICORES, 35-46, 2020, Valletta,
  Malta",10.5220/0008877400350046,,cs.CE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper, inspired by a real production process of steel hardening,
investigates a scheduling problem to minimize the idle energy consumption of
machines. The energy minimization is achieved by switching a machine to some
power-saving mode when it is idle. For the steel hardening process, the mode of
the machine (i.e., furnace) can be associated with its inner temperature.
Contrary to the recent methods, which consider only a small number of machine
modes, the temperature in the furnace can be changed continuously, and so an
infinite number of the power-saving modes must be considered to achieve the
highest possible savings. To model the machine modes efficiently, we use the
concept of the energy function, which was originally introduced in the domain
of embedded systems but has yet to take roots in the domain of production
research. The energy function is illustrated with several application examples
from the literature. Afterward, it is integrated into a mathematical model of a
scheduling problem with parallel identical machines and jobs characterized by
release times, deadlines, and processing times. Numerical experiments show that
the proposed model outperforms a reference model adapted from the literature.
","[{'version': 'v1', 'created': 'Tue, 12 May 2020 11:44:44 GMT'}]",2020-05-15,"[['Benedikt', 'Ondřej', ''], ['Šůcha', 'Přemysl', ''], ['Hanzálek', 'Zdeněk', '']]","['Scheduling', 'Energy Optimization', 'Operation Modes', 'Mixed Integer Linear Programming', 'Parallel Machines']"
5686,1712.01821,Mercedes Garc\'ia-Mart\'inez,"Mercedes Garc\'ia-Mart\'inez and Lo\""ic Barrault and Fethi Bougares",Neural Machine Translation by Generating Multiple Linguistic Factors,"11 pages, 3 figues, SLSP conference",,10.1007/978-3-319-68456-7_2,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Factored neural machine translation (FNMT) is founded on the idea of using
the morphological and grammatical decomposition of the words (factors) at the
output side of the neural network. This architecture addresses two well-known
problems occurring in MT, namely the size of target language vocabulary and the
number of unknown tokens produced in the translation. FNMT system is designed
to manage larger vocabulary and reduce the training time (for systems with
equivalent target language vocabulary size). Moreover, we can produce
grammatically correct words that are not part of the vocabulary. FNMT model is
evaluated on IWSLT'15 English to French task and compared to the baseline
word-based and BPE-based NMT systems. Promising qualitative and quantitative
results (in terms of BLEU and METEOR) are reported.
","[{'version': 'v1', 'created': 'Tue, 5 Dec 2017 18:53:49 GMT'}]",2017-12-07,"[['García-Martínez', 'Mercedes', ''], ['Barrault', 'Loïc', ''], ['Bougares', 'Fethi', '']]","['Machine Translation', 'Neural Networks', 'Deep Learning', 'Factored representation']"
5687,2004.05137,Crefeda Rodrigues,"Crefeda Faviola Rodrigues, Graham Riley, Mikel Lujan","Energy Predictive Models for Convolutional Neural Networks on Mobile
  Platforms","9 pages, 4 Figures",,10.13140/RG.2.2.15224.80644,,cs.PF cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Energy use is a key concern when deploying deep learning models on mobile and
embedded platforms. Current studies develop energy predictive models based on
application-level features to provide researchers a way to estimate the energy
consumption of their deep learning models. This information is useful for
building resource-aware models that can make efficient use of the hard-ware
resources. However, previous works on predictive modelling provide little
insight into the trade-offs involved in the choice of features on the final
predictive model accuracy and model complexity. To address this issue, we
provide a comprehensive analysis of building regression-based predictive models
for deep learning on mobile devices, based on empirical measurements gathered
from the SyNERGY framework.Our predictive modelling strategy is based on two
types of predictive models used in the literature:individual layers and
layer-type. Our analysis of predictive models show that simple layer-type
features achieve a model complexity of 4 to 32 times less for convolutional
layer predictions for a similar accuracy compared to predictive models using
more complex features adopted by previous approaches. To obtain an overall
energy estimate of the inference phase, we build layer-type predictive models
for the fully-connected and pooling layers using 12 representative
Convolutional NeuralNetworks (ConvNets) on the Jetson TX1 and the Snapdragon
820using software backends such as OpenBLAS, Eigen and CuDNN. We obtain an
accuracy between 76% to 85% and a model complexity of 1 for the overall energy
prediction of the test ConvNets across different hardware-software
combinations.
","[{'version': 'v1', 'created': 'Fri, 10 Apr 2020 17:35:40 GMT'}]",2020-04-13,"[['Rodrigues', 'Crefeda Faviola', ''], ['Riley', 'Graham', ''], ['Lujan', 'Mikel', '']]","['Convolutional Neural Networks', 'Energy Prediction', 'mobile platforms']"
5688,2112.04271,Nathaniel K. Brown,"Nathaniel K. Brown, Travis Gagie and Massimiliano Rossi",RLBWT Tricks,"15 pages, 8 figures. New edition with expanded experimental results
  after poster acceptance at earlier conference. Section 4 removed, sections
  added for implementation details","20th International Symposium on Experimental Algorithms (2022),
  volume 233, pages 16:1--16:16",10.4230/LIPIcs.SEA.2022.16,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Until recently, most experts would probably have agreed we cannot
backwards-step in constant time with a run-length compressed Burrows-Wheeler
Transform (RLBWT), since doing so relies on rank queries on sparse bitvectors
and those inherit lower bounds from predecessor queries. At ICALP '21, however,
Nishimoto and Tabei described a new, simple and constant-time implementation.
For a permutation $\pi$, it stores an $O (r)$-space table -- where $r$ is the
number of positions $i$ where either $i = 0$ or $\pi (i + 1) \neq \pi (i) + 1$
-- that enables the computation of successive values of $\pi(i)$ by table
look-ups and linear scans. Nishimoto and Tabei showed how to increase the
number of rows in the table to bound the length of the linear scans such that
the query time for computing $\pi(i)$ is constant while maintaining $O
(r)$-space.
  In this paper we refine Nishimoto and Tabei's approach, including a
time-space tradeoff, and experimentally evaluate different implementations
demonstrating the practicality of part of their result. We show that even
without adding rows to the table, in practice we almost always scan only a few
entries during queries. We propose a decomposition scheme of the permutation
$\pi$ corresponding to the LF-mapping that allows an improved compression of
the data structure, while limiting the query time. We tested our implementation
on real-world genomic datasets and found that without compression of the table,
backward-stepping is drastically faster than with sparse bitvector
implementations but, unfortunately, also uses drastically more space. After
compression, backward-stepping is competitive both in time and space with the
best existing implementations.
","[{'version': 'v1', 'created': 'Wed, 8 Dec 2021 13:05:32 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Jul 2022 01:29:39 GMT'}]",2022-07-15,"[['Brown', 'Nathaniel K.', ''], ['Gagie', 'Travis', ''], ['Rossi', 'Massimiliano', '']]","['Compressed String Indexes', 'Repetitive Text Collections', 'Burrows-WheelerTransform']"
5689,2208.03437,Sankalok Sen,"Srinjoy Bhuiya, Ayushman Kumar, Sankalok Sen","Exploring the Effects of Data Augmentation for Drivable Area
  Segmentation","16 pages, 10 figures, Presented at International Conference of
  Undergraduate Students, ICUS 2021",,10.52458/978-81-95502-01-1,,cs.CV cs.AI,http://creativecommons.org/licenses/by/4.0/,"  The real-time segmentation of drivable areas plays a vital role in
accomplishing autonomous perception in cars. Recently there have been some
rapid strides in the development of image segmentation models using deep
learning. However, most of the advancements have been made in model
architecture design. In solving any supervised deep learning problem related to
segmentation, the success of the model that one builds depends upon the amount
and quality of input training data we use for that model. This data should
contain well-annotated varied images for better working of the segmentation
model. Issues like this pertaining to annotations in a dataset can lead the
model to conclude with overwhelming Type I and II errors in testing and
validation, causing malicious issues when trying to tackle real world problems.
To address this problem and to make our model more accurate, dynamic, and
robust, data augmentation comes into usage as it helps in expanding our sample
training data and making it better and more diversified overall. Hence, in our
study, we focus on investigating the benefits of data augmentation by analyzing
pre-existing image datasets and performing augmentations accordingly. Our
results show that the performance and robustness of existing state of the art
(or SOTA) models can be increased dramatically without any increase in model
complexity or inference time. The augmentations decided on and used in this
paper were decided only after thorough research of several other augmentation
methodologies and strategies and their corresponding effects that are in
widespread usage today. All our results are being reported on the widely used
Cityscapes Dataset.
","[{'version': 'v1', 'created': 'Sat, 6 Aug 2022 03:39:37 GMT'}]",2022-08-15,"[['Bhuiya', 'Srinjoy', ''], ['Kumar', 'Ayushman', ''], ['Sen', 'Sankalok', '']]","['Drivable-area', 'Segmentation', 'Augmentation', 'Deep Convolutional Neural Networks', 'Road Scenes', 'Encoder-Decoder', 'Pooling', 'Upsampling']"
5690,1803.10551,Bilen Emek Abali,B. E. Abali and A. F. Queiruga,"Theory and computation of electromagnetic fields and thermomechanical
  structure interaction for systems undergoing large deformations",,,10.1016/j.jcp.2019.05.045,,cs.CE physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For an accurate description of electromagneto-thermomechanical systems,
electromagnetic fields need to be described in a Eulerian frame, whereby the
thermomechanics is solved in a Lagrangean frame. It is possible to map the
Eulerian frame to the current placement of the matter and the Lagrangean frame
to a reference placement. We present a rigorous and thermodynamically
consistent derivation of governing equations for fully coupled
electromagneto-thermomechanical systems properly handling finite deformations.
A clear separation of the different frames is necessary. There are various
attempts to formulate electromagnetism in the Lagrangean frame, or even to
compute all fields in the current placement. Both formulations are challenging
and heavily discussed in the literature. In this work, we propose another
solution scheme that exploits the capabilities of advanced computational tools.
Instead of amending the formulation, we can solve thermomechanics in the
Lagrangean frame and electromagnetism in the Eulerian frame and manage the
interaction between the fields. The approach is similar to its analog in fluid
structure interaction, but more challenging because the field equations in
electromagnetism must also be solved within the solid body while following
their own different set of transformation rules. We additionally present a
mesh-morphing algorithm necessary to accommodate finite deformations to solve
the electromagnetic fields outside of the material body. We illustrate the use
of the new formulation by developing an open-source implementation using the
FEniCS package and applying this implementation to several engineering problems
in electromagnetic structure interaction undergoing large deformations.
","[{'version': 'v1', 'created': 'Wed, 28 Mar 2018 12:09:16 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Jun 2019 09:19:36 GMT'}]",2019-06-05,"[['Abali', 'B. E.', ''], ['Queiruga', 'A. F.', '']]","['continuum mechanics', 'thermodynamics', 'electromagnetism', 'finite element method']"
5691,1904.09612,Qian Yang,"Qian Yang, Aaron Steinfeld, John Zimmerman","Unremarkable AI: Fitting Intelligent Decision Support into Critical,
  Clinical Decision-Making Processes",,"CHI Conference on Human Factors in Computing Systems Proceedings
  2019 (CHI'19)",10.1145/3290605.3300468,,cs.HC cs.AI cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clinical decision support tools (DST) promise improved healthcare outcomes by
offering data-driven insights. While effective in lab settings, almost all DSTs
have failed in practice. Empirical research diagnosed poor contextual fit as
the cause. This paper describes the design and field evaluation of a radically
new form of DST. It automatically generates slides for clinicians' decision
meetings with subtly embedded machine prognostics. This design took inspiration
from the notion of ""Unremarkable Computing"", that by augmenting the users'
routines technology/AI can have significant importance for the users yet remain
unobtrusive. Our field evaluation suggests clinicians are more likely to
encounter and embrace such a DST. Drawing on their responses, we discuss the
importance and intricacies of finding the right level of unremarkableness in
DST design, and share lessons learned in prototyping critical AI systems as a
situated experience.
","[{'version': 'v1', 'created': 'Sun, 21 Apr 2019 14:57:44 GMT'}]",2019-04-23,"[['Yang', 'Qian', ''], ['Steinfeld', 'Aaron', ''], ['Zimmerman', 'John', '']]","['Decision Support Systems', 'Healthcare', 'User Experience']"
5692,2001.06094,Debi Prasanna Mohanty Mr,"Sumit Kumar, Gopi Ramena, Manoj Goyal, Debi Mohanty, Ankur Agarwal,
  Benu Changmai, Sukumar Moharana",On- Device Information Extraction from Screenshots in form of tags,,,10.1145/3371158.3371200,,cs.CV cs.CL cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We propose a method to make mobile screenshots easily searchable. In this
paper, we present the workflow in which we: 1) preprocessed a collection of
screenshots, 2) identified script presentin image, 3) extracted unstructured
text from images, 4) identifiedlanguage of the extracted text, 5) extracted
keywords from the text, 6) identified tags based on image features, 7) expanded
tag set by identifying related keywords, 8) inserted image tags with relevant
images after ranking and indexed them to make it searchable on device. We made
the pipeline which supports multiple languages and executed it on-device, which
addressed privacy concerns. We developed novel architectures for components in
the pipeline, optimized performance and memory for on-device computation. We
observed from experimentation that the solution developed can reduce overall
user effort and improve end user experience while searching, whose results are
published.
","[{'version': 'v1', 'created': 'Sat, 11 Jan 2020 12:15:30 GMT'}]",2020-12-15,"[['Kumar', 'Sumit', ''], ['Ramena', 'Gopi', ''], ['Goyal', 'Manoj', ''], ['Mohanty', 'Debi', ''], ['Agarwal', 'Ankur', ''], ['Changmai', 'Benu', ''], ['Moharana', 'Sukumar', '']]","['on-device search', 'tag recommendation', 'tag expansion', 'on-devicetag extraction']"
5693,2111.03270,Shivam Gupta Mr,"Virender Ranga, Shivam Gupta, Jyoti Meena, Priyansh Agrawal",Automated Human Mind Reading Using EEG Signals for Seizure Detection,"11 Pages, 12 Figures, 5 Tables","Journal of Medical Engineering & Technology,2020, 44:5, 237-246",10.1080/03091902.2020.1791988,,cs.LG eess.SP q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Epilepsy is one of the most occurring neurological disease globally emerged
back in 4000 BC. It is affecting around 50 million people of all ages these
days. The trait of this disease is recurrent seizures. In the past few decades,
the treatments available for seizure control have improved a lot with the
advancements in the field of medical science and technology.
Electroencephalogram (EEG) is a widely used technique for monitoring the brain
activity and widely popular for seizure region detection. It is performed
before surgery and also to predict seizure at the time operation which is
useful in neuro stimulation device. But in most of cases visual examination is
done by neurologist in order to detect and classify patterns of the disease but
this requires a lot of pre-domain knowledge and experience. This all in turns
put a pressure on neurosurgeons and leads to time wastage and also reduce their
accuracy and efficiency. There is a need of some automated systems in arena of
information technology like use of neural networks in deep learning which can
assist neurologists. In the present paper, a model is proposed to give an
accuracy of 98.33% which can be used for development of automated systems. The
developed system will significantly help neurologists in their performance.
","[{'version': 'v1', 'created': 'Fri, 5 Nov 2021 05:31:33 GMT'}]",2021-11-08,"[['Ranga', 'Virender', ''], ['Gupta', 'Shivam', ''], ['Meena', 'Jyoti', ''], ['Agrawal', 'Priyansh', '']]","['Epilepsy', 'Seizure', 'EEG', 'Neural network', 'Deep Learning', 'Medical Diagnosis']"
5694,2005.13267,Miguel Rodr\'iguez P\'erez,"Miguel Rodr\'iguez P\'erez, Sergio Herrer\'ia Alonso, Ra\'ul F.
  Rodr\'iguez Rubio, and Jos\'e Carlos L\'opez Ardao","Leveraging Energy Saving Capabilities of Current EEE Interfaces via
  Pre-Coalescing","25 pages, 11 figures","Journal of Network and Computer Applications Volume 166, 15
  September 2020, 102734",10.1016/j.jnca.2020.102734,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The low power idle mode implemented by Energy Efficient Ethernet (EEE) allows
network interfaces to save up to 90% of their nominal energy consumption when
idling. There is an ample body of research that recommends the use of frame
coalescing algorithms---that enter the low power mode as soon as there is no
more traffic waiting to be sent, and delay the exit from this mode until there
is an acceptable amount of traffic queued---to minimize energy usage while
maintaining an acceptable performance. However, EEE capable hardware from
several manufactures delays the entrance to the low power mode for a
considerable amount of time (hysteresis). In this paper we augment existing EEE
energy models to account for the hysteresis delay and show that, using the
configuration ranges provided by manufacturers, most existing EEE networking
devices are unable to obtain significant energy savings. To improve their
energy efficiency, we propose to implement frame coalescing directly at traffic
sources, before reaching the network interface. We also derive the optimum
coalescing parameters to obtain a given target energy consumption at the EEE
device when its configuration parameters are known in advance.
","[{'version': 'v1', 'created': 'Wed, 27 May 2020 10:05:48 GMT'}, {'version': 'v2', 'created': 'Sat, 6 Jun 2020 15:42:23 GMT'}]",2020-06-16,"[['Pérez', 'Miguel Rodríguez', ''], ['Alonso', 'Sergio Herrería', ''], ['Rubio', 'Raúl F. Rodríguez', ''], ['Ardao', 'José Carlos López', '']]","['Energy efficient Ethernet', 'Traffic coalescing', 'Local area networks', 'Modeling and simulation', 'Green communications']"
5695,1904.06765,Alexander Fabisch,Alexander Fabisch,"A Comparison of Policy Search in Joint Space and Cartesian Space for
  Refinement of Skills",,,10.1007/978-3-030-19648-6_35,,cs.RO cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Imitation learning is a way to teach robots skills that are demonstrated by
humans. Transfering skills between these different kinematic structures seems
to be straightforward in Cartesian space. Because of the correspondence
problem, however, the result will most likely not be identical. This is why
refinement is required, for example, by policy search. Policy search in
Cartesian space is prone to reachability problems when using conventional
inverse kinematic solvers. We propose a configurable approximate inverse
kinematic solver and show that it can accelerate the refinement process
considerably. We also compare empirically refinement in Cartesian space and
refinement in joint space.
","[{'version': 'v1', 'created': 'Sun, 14 Apr 2019 21:41:28 GMT'}]",2019-06-11,"[['Fabisch', 'Alexander', '']]","['learning from demonstration', 'imitation learning', 'reinforcement learning', 'policy search', 'inverse kinematics']"
5696,2111.08617,Ilia Markov,"Ilia Markov, Hamidreza Ramezanikebrya, Dan Alistarh",CGX: Adaptive System Support for Communication-Efficient Deep Learning,,Middleware 2022,10.1145/3528535.3565248,,cs.DC cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The ability to scale out training workloads has been one of the key
performance enablers of deep learning. The main scaling approach is
data-parallel GPU-based training, which has been boosted by hardware and
software support for highly efficient point-to-point communication, and in
particular via hardware bandwidth overprovisioning. Overprovisioning comes at a
cost: there is an order of magnitude price difference between ""cloud-grade""
servers with such support, relative to their popular ""consumer-grade""
counterparts, although single server-grade and consumer-grade GPUs can have
similar computational envelopes.
  In this paper, we show that the costly hardware overprovisioning approach can
be supplanted via algorithmic and system design, and propose a framework called
CGX, which provides efficient software support for compressed communication in
ML applications, for both multi-GPU single-node training, as well as
larger-scale multi-node training. CGX is based on two technical advances:
\emph{At the system level}, it relies on a re-developed communication stack for
ML frameworks, which provides flexible, highly-efficient support for compressed
communication. \emph{At the application level}, it provides \emph{seamless,
parameter-free} integration with popular frameworks, so that end-users do not
have to modify training recipes, nor significant training code. This is
complemented by a \emph{layer-wise adaptive compression} technique which
dynamically balances compression gains with accuracy preservation. CGX
integrates with popular ML frameworks, providing up to 3X speedups for
multi-GPU nodes based on commodity hardware, and order-of-magnitude
improvements in the multi-node setting, with negligible impact on accuracy.
","[{'version': 'v1', 'created': 'Tue, 16 Nov 2021 17:00:42 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Nov 2021 14:00:02 GMT'}, {'version': 'v3', 'created': 'Fri, 4 Feb 2022 16:33:14 GMT'}, {'version': 'v4', 'created': 'Tue, 24 May 2022 21:15:50 GMT'}, {'version': 'v5', 'created': 'Thu, 29 Dec 2022 15:07:04 GMT'}]",2023-01-02,"[['Markov', 'Ilia', ''], ['Ramezanikebrya', 'Hamidreza', ''], ['Alistarh', 'Dan', '']]","['Distributed Systems', 'Deep Learning', 'Gradients compression']"
5697,2209.02427,Qian Cao,"Qian Cao, Xu Chen, Ruihua Song, Hao Jiang, Guang Yang, Zhao Cao",Multi-Modal Experience Inspired AI Creation,Accepted by ACM Multimedia 2022,,10.1145/3503161.3548189,,cs.AI,http://creativecommons.org/licenses/by/4.0/,"  AI creation, such as poem or lyrics generation, has attracted increasing
attention from both industry and academic communities, with many promising
models proposed in the past few years. Existing methods usually estimate the
outputs based on single and independent visual or textual information. However,
in reality, humans usually make creations according to their experiences, which
may involve different modalities and be sequentially correlated. To model such
human capabilities, in this paper, we define and solve a novel AI creation
problem based on human experiences. More specifically, we study how to generate
texts based on sequential multi-modal information. Compared with the previous
works, this task is much more difficult because the designed model has to well
understand and adapt the semantics among different modalities and effectively
convert them into the output in a sequential manner. To alleviate these
difficulties, we firstly design a multi-channel sequence-to-sequence
architecture equipped with a multi-modal attention network. For more effective
optimization, we then propose a curriculum negative sampling strategy tailored
for the sequential inputs. To benchmark this problem and demonstrate the
effectiveness of our model, we manually labeled a new multi-modal experience
dataset. With this dataset, we conduct extensive experiments by comparing our
model with a series of representative baselines, where we can demonstrate
significant improvements in our model based on both automatic and
human-centered metrics. The code and data are available at:
\url{https://github.com/Aman-4-Real/MMTG}.
","[{'version': 'v1', 'created': 'Fri, 2 Sep 2022 11:50:41 GMT'}]",2022-09-07,"[['Cao', 'Qian', ''], ['Chen', 'Xu', ''], ['Song', 'Ruihua', ''], ['Jiang', 'Hao', ''], ['Yang', 'Guang', ''], ['Cao', 'Zhao', '']]","['AI Creation', 'Experience', 'Multi-modal']"
5698,1703.10858,Arik Hadas,"Arik Hadas (Open University of Israel, Israel), David H Lorenz (Open
  University of Israel, Israel)",Language Oriented Modularity: From Theory to Practice,,"The Art, Science, and Engineering of Programming, 2017, Vol. 1,
  Issue 2, Article 10",10.22152/programming-journal.org/2017/1/10,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Language-oriented modularity (LOM) is a methodology that complements
language-oriented programming (LOP) in providing on-demand language abstraction
solutions during software development. It involves the implementation and
immediate utilization of domain-specific languages (DSLs) that are also
aspect-oriented (DSALs). However, while DSL development is affordable thanks to
modern language workbenches, DSAL development lacks similar tool support.
Consequently, LOM is often impractical and underutilized. The challenge we
address is making the complexity of DSAL implementation comparable to that of
DSLs and the effectiveness of programming with DSALs comparable to that of
general-purpose aspect languages (GPALs). Today, despite being essentially both
domain-specific and aspect-oriented, DSALs seem to be second-class. Aspect
development tools (e.g., AJDT) do not work on DSAL code. DSL development tools
like language workbenches (e.g., Spoofax) neither deal with the backend weaving
nor handle the composition of DSALs. DSAL composition frameworks (e.g.,
Awesome) do not provide frontend development tools. DSAL code transformation
approaches (e.g., XAspects) do not preserve the semantics of DSAL programs in
the presence of other aspect languages. We extend AspectJ with a small set of
annotations and interfaces that allows DSAL designers to define a
semantic-preserving transformation to AspectJ and interface with AspectJ tools.
Our transformation approach enables the use of standard language workbench to
implement DSALs and use of standard aspect development tools to program with
those DSALs. As a result, DSALs regain first-class status with respect to both
DSLs and aspect languages. This, on the one hand, lowers the cost of developing
DSALs to the level of DSLs and, on the other hand, raises the effectiveness of
using a DSAL to the level of a GPAL. Consequently, LOM becomes cost-effective
compared to the LOP baseline. We modified the ajc compiler to support our
approach. Using two different language workbenches (Spoofax and Xtext) we then
implemented several DSALs. AspectJ was supported out-of-the-box. We implemented
Cool to demonstrate that the non-trivial composition of AspectJ and Cool can be
accommodated using our approach. We applied LOM to crosscutting concerns in two
open source projects (oVirt and muCommander), implementing in the process
application-specific DSALs, thus providing a sense of the decrease in the cost
of developing composable DSALs and the increase in the effectiveness of
programming with them. Crosscutting concerns remain a problem in modern
real-world projects (e.g., as observed in oVirt). DSALs are often the right
tool for addressing these concerns. Our work makes LOM practical, thus
facilitating use of DSAL solutions in the software development process.
","[{'version': 'v1', 'created': 'Fri, 31 Mar 2017 11:45:38 GMT'}]",2017-04-03,"[['Hadas', 'Arik', '', 'Open University of Israel, Israel'], ['Lorenz', 'David H', '', 'Open\n  University of Israel, Israel']]","['Domain-specifc languages (DSLs)', 'Aspect-oriented programming (AOP)', 'Language-oriented']"
5699,2011.07661,Luca Parisi,"Luca Parisi, Renfei Ma, Narrendar RaviChandran and Matteo Lanzillotta","hyper-sinh: An Accurate and Reliable Function from Shallow to Deep
  Learning in TensorFlow and Keras","19 pages, 6 listings/Python code snippets, 4 figures, 5 tables",,10.1016/j.mlwa.2021.100112,,cs.CV cs.AI cs.CL cs.LG cs.NE,http://creativecommons.org/licenses/by/4.0/,"  This paper presents the 'hyper-sinh', a variation of the m-arcsinh activation
function suitable for Deep Learning (DL)-based algorithms for supervised
learning, such as Convolutional Neural Networks (CNN). hyper-sinh, developed in
the open source Python libraries TensorFlow and Keras, is thus described and
validated as an accurate and reliable activation function for both shallow and
deep neural networks. Improvements in accuracy and reliability in image and
text classification tasks on five (N = 5) benchmark data sets available from
Keras are discussed. Experimental results demonstrate the overall competitive
classification performance of both shallow and deep neural networks, obtained
via this novel function. This function is evaluated with respect to gold
standard activation functions, demonstrating its overall competitive accuracy
and reliability for both image and text classification.
","[{'version': 'v1', 'created': 'Sun, 15 Nov 2020 23:38:59 GMT'}]",2021-08-19,"[['Parisi', 'Luca', ''], ['Ma', 'Renfei', ''], ['RaviChandran', 'Narrendar', ''], ['Lanzillotta', 'Matteo', '']]","['Activation', 'Deep Learning', 'Convolutional Neural Network', 'TensorFlow', 'Keras']"
5700,2109.03627,Marta Lagomarsino,"Marta Lagomarsino, Marta Lorenzini, Elena De Momi, Arash Ajoudani",An Online Framework for Cognitive Load Assessment in Assembly Tasks,,"Robotics and Computer-Integrated Manufacturing, Volume 78,
  December 2022",10.1016/j.rcim.2022.102380,,cs.RO cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ongoing trend towards Industry 4.0 has revolutionised ordinary
workplaces, profoundly changing the role played by humans in the production
chain. Research on ergonomics in industrial settings mainly focuses on reducing
the operator's physical fatigue and discomfort to improve throughput and avoid
safety hazards. However, as the production complexity increases, the cognitive
resources demand and mental workload could compromise the operator's
performance and the efficiency of the shop floor workplace. State-of-the-art
methods in cognitive science work offline and/or involve bulky equipment hardly
deployable in industrial settings. This paper presents a novel method for
online assessment of cognitive load in manufacturing, primarily assembly, by
detecting patterns in human motion directly from the input images of a stereo
camera. Head pose estimation and skeleton tracking are exploited to investigate
the workers' attention and assess hyperactivity and unforeseen movements. Pilot
experiments suggest that our factor assessment tool provides significant
insights into workers' mental workload, even confirmed by correlations with
physiological and performance measurements. According to data gathered in this
study, a vision-based cognitive load assessment has the potential to be
integrated into the development of mechatronic systems for improving cognitive
ergonomics in manufacturing.
","[{'version': 'v1', 'created': 'Wed, 8 Sep 2021 13:19:27 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Oct 2021 07:23:59 GMT'}]",2022-07-11,"[['Lagomarsino', 'Marta', ''], ['Lorenzini', 'Marta', ''], ['De Momi', 'Elena', ''], ['Ajoudani', 'Arash', '']]","['Cognitive ergonomics', 'Cognitive manufacturing', 'Assembly', 'Attention estimation', 'Stress detection']"
5701,1810.05405,Mohammad Al Shinwan,Mohammad Al Shinwan and Kim Chul-Soo,A future mobile packet core network based on ip-in-ip protocol,"21 pages, 29 figures","International Journal of Computer Networks & Communications
  (IJCNC) Vol.10, No.5, September 2018",10.5121/ijcnc.2018.10505,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The current Evolved Packet Core (EPC) 4th generation (4G) mobile network
architecture features complicated control plane protocols and requires
expensive equipment. Data delivery in the mobile packet core is performed based
on a centralized mobility anchor between eNode B (eNB) elements and the network
gateways. The mobility anchor is performed based on General Packet Radio
Service tunnelling protocol (GTP), which has numerous drawbacks, including high
tunnelling overhead and suboptimal routing between mobile devices on the same
network. To address these challenges, here we describe new mobile core
architecture for future mobile networks. The proposed scheme is based on IP
encapsulated within IP (IP-in-IP) for mobility management and data delivery. In
this scheme, the core network functions via layer 3 switching (L3S), and data
delivery is implemented based on IP-in-IP routing, thus eliminating the GTP
tunnelling protocol. For handover between eNB elements located near to one
another, we propose the creation of a tunnel that maintains data delivery to
mobile devices until the new eNB element updates the route with the gateway,
which prevents data packet loss during handover. For this, we propose Generic
Routing Encapsulation (GRE) tunnelling protocol. We describe the results of
numerical analyses and simulation results showing that the proposed network
core architecture provides superior performance compared with the current 4G
architecture in terms of handover delay, tunnelling overhead and total
transmission delay.
","[{'version': 'v1', 'created': 'Fri, 12 Oct 2018 08:42:24 GMT'}]",2018-10-15,"[['Shinwan', 'Mohammad Al', ''], ['Chul-Soo', 'Kim', '']]","['5G network', 'mobile core network', 'IP-in-IP', 'GRE   1']"
5702,2207.13434,Fiseha Berhanu Tesema Dr.,"Fiseha B. Tesema, Zheyuan Lin, Shiqiang Zhu, Wei Song, Jason Gu, Hong
  Wu",End-To-End Audiovisual Feature Fusion for Active Speaker Detection,"To appear on the proceeding of the Fourteenth International
  Conference on Digital Image Processing (ICDIP 2022), May 20-23, Wuhan, China,
  8 pages, 3 figures","Proceedings Volume 12342, Fourteenth International Conference on
  Digital Image Processing (ICDIP 2022); 123422A (2022)",10.1117/12.2643881,,cs.SD cs.CV cs.MM eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Active speaker detection plays a vital role in human-machine interaction.
Recently, a few end-to-end audiovisual frameworks emerged. However, these
models' inference time was not explored and are not applicable for real-time
applications due to their complexity and large input size. In addition, they
explored a similar feature extraction strategy that employs the ConvNet on
audio and visual inputs. This work presents a novel two-stream end-to-end
framework fusing features extracted from images via VGG-M with raw Mel
Frequency Cepstrum Coefficients features extracted from the audio waveform. The
network has two BiGRU layers attached to each stream to handle each stream's
temporal dynamic before fusion. After fusion, one BiGRU layer is attached to
model the joint temporal dynamics. The experiment result on the
AVA-ActiveSpeaker dataset indicates that our new feature extraction strategy
shows more robustness to noisy signals and better inference time than models
that employed ConvNet on both modalities. The proposed model predicts within
44.41 ms, which is fast enough for real-time applications. Our best-performing
model attained 88.929% accuracy, nearly the same detection result as
state-of-the-art -work.
","[{'version': 'v1', 'created': 'Wed, 27 Jul 2022 10:25:59 GMT'}]",2022-11-24,"[['Tesema', 'Fiseha B.', ''], ['Lin', 'Zheyuan', ''], ['Zhu', 'Shiqiang', ''], ['Song', 'Wei', ''], ['Gu', 'Jason', ''], ['Wu', 'Hong', '']]","['Audiovisual active speaker detection', 'MFCC', 'VGG-M', 'Audiovisual fusion', 'BiGRU']"
5703,2003.06990,Yibin Xu,"Yibin Xu, Yangyu Huang, Jianhua Shao, George Theodorakopoulos","A Flexible n/2 Adversary Node Resistant and Halting Recoverable
  Blockchain Sharding Protocol",Accepted by Concurrency and Computation Practice and Experience,,10.1002/CPE.5773,,cs.DC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Blockchain sharding is a promising approach to solving the dilemma between
decentralisation and high performance (transaction throughput) for blockchain.
The main challenge of Blockchain sharding systems is how to reach a decision on
a statement among a sub-group (shard) of people while ensuring the whole
population recognises this statement. Namely, the challenge is to prevent an
adversary who does not have the majority of nodes globally but have the
majority of nodes inside a shard. Most Blockchain sharding approaches can only
reach a correct consensus inside a shard with at most $n/3$ evil nodes in a $n$
node system. There is a blockchain sharding approach which can prevent an
incorrect decision to be reached when the adversary does not have $n/2$ nodes
globally. However, the system can be stopped from reaching consensus (become
deadlocked) if the adversary controls a smaller number of nodes.
  In this paper, we present an improved Blockchain sharding approach that can
withstand $n/2$ adversarial nodes and recover from deadlocks. The recovery is
made by dynamically adjusting the number of shards and the shard size. A
performance analysis suggests our approach has a high performance (transaction
throughput) while requiring little bandwidth for synchronisation.
","[{'version': 'v1', 'created': 'Mon, 16 Mar 2020 03:21:01 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Mar 2020 08:16:05 GMT'}, {'version': 'v3', 'created': 'Thu, 19 Mar 2020 11:05:19 GMT'}, {'version': 'v4', 'created': 'Mon, 23 Mar 2020 13:16:28 GMT'}]",2020-03-24,"[['Xu', 'Yibin', ''], ['Huang', 'Yangyu', ''], ['Shao', 'Jianhua', ''], ['Theodorakopoulos', 'George', '']]","['Blockchain sharding', 'Halting', 'Distributed Ledger']"
5704,2107.14681,Elisa Claire Alem\'an Carre\'on,"Elisa Claire Alem\'an Carre\'on and Hugo Alberto Mendoza Espa\~na and
  Hirofumi Nonaka and Toru Hiraoka","Differences in Chinese and Western tourists faced with Japanese
  hospitality: A natural language processing approach","Published Online at:
  https://link.springer.com/article/10.1007%2Fs40558-021-00203-8","2021. Information Technology & Tourism, Vol. 23, No. 3, pp.
  281-438",10.1007/s40558-021-00203-8,,cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Since culture influences expectations, perceptions, and satisfaction, a
cross-culture study is necessary to understand the differences between Japan's
biggest tourist populations, Chinese and Western tourists. However, with
ever-increasing customer populations, this is hard to accomplish without
extensive customer base studies. There is a need for an automated method for
identifying these expectations at a large scale. For this, we used a
data-driven approach to our analysis. Our study analyzed their satisfaction
factors comparing soft attributes, such as service, with hard attributes, such
as location and facilities, and studied different price ranges. We collected
hotel reviews and extracted keywords to classify the sentiment of sentences
with an SVC. We then used dependency parsing and part-of-speech tagging to
extract nouns tied to positive adjectives. We found that Chinese tourists
consider room quality more than hospitality, whereas Westerners are delighted
more by staff behavior. Furthermore, the lack of a Chinese-friendly environment
for Chinese customers and cigarette smell for Western ones can be disappointing
factors of their stay. As one of the first studies in the tourism field to use
the high-standard Japanese hospitality environment for this analysis, our
cross-cultural study contributes to both the theoretical understanding of
satisfaction and suggests practical applications and strategies for hotel
managers.
","[{'version': 'v1', 'created': 'Fri, 30 Jul 2021 15:00:09 GMT'}]",2021-09-06,"[['Carreón', 'Elisa Claire Alemán', ''], ['España', 'Hugo Alberto Mendoza', ''], ['Nonaka', 'Hirofumi', ''], ['Hiraoka', 'Toru', '']]","['Sentiment Analysis · Hotels', 'Lodging · Text Mining · Chinese ·English · Satisfaction', 'Dissatisfaction Factors']"
5705,1908.06126,Anna Smagina Mrs,"Anna Smagina, Egor Ershov, Anton Grigoryev",Multiple Light Source Dataset for Colour Research,,"Proceedings Volume 11433, Twelfth International Conference on
  Machine Vision (ICMV 2019); 114332C",10.1117/12.2559491,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We present a collection of 24 multiple object scenes each recorded under 18
multiple light source illumination scenarios. The illuminants are varying in
dominant spectral colours, intensity and distance from the scene. We mainly
address the realistic scenarios for evaluation of computational colour
constancy algorithms, but also have aimed to make the data as general as
possible for computational colour science and computer vision. Along with the
images of the scenes, we provide spectral characteristics of the camera, light
sources and the objects and include pixel-by-pixel ground truth annotation of
uniformly coloured object surfaces thus making this useful for benchmarking
colour-based image segmentation algorithms. The dataset is freely available at
https://github.com/visillect/mls-dataset.
","[{'version': 'v1', 'created': 'Fri, 16 Aug 2019 18:49:32 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Sep 2019 10:53:09 GMT'}, {'version': 'v3', 'created': 'Thu, 24 Oct 2019 07:06:11 GMT'}, {'version': 'v4', 'created': 'Sun, 27 Oct 2019 10:42:04 GMT'}]",2020-03-27,"[['Smagina', 'Anna', ''], ['Ershov', 'Egor', ''], ['Grigoryev', 'Anton', '']]","['computer vision', 'colour constancy', 'illuminant estimation', 'multiple light source']"
5706,2206.14256,Do\u{g}ay Kamar,"Do\u{g}ay Kamar (1), Naz{\i}m Kemal \""Ure (1 and 2), G\""ozde \""Unal (1
  and 2) ((1) Faculty of Computer and Informatics, Istanbul Technical
  University (2) Artificial Intelligence and Data Science Research Center,
  Istanbul Technical University)","GAN-based Intrinsic Exploration For Sample Efficient Reinforcement
  Learning",,"International Conference on Agents and Artificial Intelligence -
  ICAART, Volume 2, 264-272 (2022)",10.5220/0010825500003116,,cs.LG cs.AI cs.CV,http://creativecommons.org/licenses/by/4.0/,"  In this study, we address the problem of efficient exploration in
reinforcement learning. Most common exploration approaches depend on random
action selection, however these approaches do not work well in environments
with sparse or no rewards. We propose Generative Adversarial Network-based
Intrinsic Reward Module that learns the distribution of the observed states and
sends an intrinsic reward that is computed as high for states that are out of
distribution, in order to lead agent to unexplored states. We evaluate our
approach in Super Mario Bros for a no reward setting and in Montezuma's Revenge
for a sparse reward setting and show that our approach is indeed capable of
exploring efficiently. We discuss a few weaknesses and conclude by discussing
future works.
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2022 19:16:52 GMT'}]",2022-06-30,"[['Kamar', 'Doğay', '', '1 and 2'], ['Üre', 'Nazım Kemal', '', '1 and 2'], ['Ünal', 'Gözde', '', '1\n  and 2']]","['Deep Learning', 'Reinforcement Learning', 'Generative Adversarial Networks', 'Efficient Exploration in Reinforcement Learning']"
5707,2004.03493,Hanzhi Wang,"Hanzhi Wang, Zhewei Wei, Ye Yuan, Xiaoyong Du, Ji-Rong Wen",Exact Single-Source SimRank Computation on Large Graphs,ACM SIGMOD 2020,,10.1145/3318464.3389781,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  SimRank is a popular measurement for evaluating the node-to-node similarities
based on the graph topology. In recent years, single-source and top-$k$ SimRank
queries have received increasing attention due to their applications in web
mining, social network analysis, and spam detection. However, a fundamental
obstacle in studying SimRank has been the lack of ground truths. The only exact
algorithm, Power Method, is computationally infeasible on graphs with more than
$10^6$ nodes. Consequently, no existing work has evaluated the actual
trade-offs between query time and accuracy on large real-world graphs. In this
paper, we present ExactSim, the first algorithm that computes the exact
single-source and top-$k$ SimRank results on large graphs. With high
probability, this algorithm produces ground truths with a rigorous theoretical
guarantee. We conduct extensive experiments on real-world datasets to
demonstrate the efficiency of ExactSim. The results show that ExactSim provides
the ground truth for any single-source SimRank query with a precision up to 7
decimal places within a reasonable query time.
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2020 15:45:59 GMT'}, {'version': 'v2', 'created': 'Fri, 29 May 2020 10:13:47 GMT'}, {'version': 'v3', 'created': 'Thu, 18 Jun 2020 13:20:27 GMT'}]",2020-06-19,"[['Wang', 'Hanzhi', ''], ['Wei', 'Zhewei', ''], ['Yuan', 'Ye', ''], ['Du', 'Xiaoyong', ''], ['Wen', 'Ji-Rong', '']]","['SimRank', 'Exact computation', 'Ground truths']"
5708,1712.05840,"Daniel Bj\""orkegren","Daniel Bj\""orkegren and Darrell Grissen",Behavior Revealed in Mobile Phone Usage Predicts Loan Repayment,,,10.1093/wber/lhz006,,cs.CY q-fin.RM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many households in developing countries lack formal financial histories,
making it difficult for firms to extend credit, and for potential borrowers to
receive it. However, many of these households have mobile phones, which
generate rich data about behavior. This article shows that behavioral
signatures in mobile phone data predict default, using call records matched to
repayment outcomes for credit extended by a South American telecom. On a sample
of individuals with (thin) financial histories, our method actually outperforms
models using credit bureau information, both within time and when tested on a
different time period. But our method also attains similar performance on those
without financial histories, who cannot be scored using traditional methods.
Individuals in the highest quintile of risk by our measure are 2.8 times more
likely to default than those in the lowest quintile. The method forms the basis
for new forms of credit that reach the unbanked.
","[{'version': 'v1', 'created': 'Sat, 9 Dec 2017 05:28:07 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Feb 2018 01:42:11 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Dec 2019 17:13:57 GMT'}]",2020-02-17,"[['Björkegren', 'Daniel', ''], ['Grissen', 'Darrell', '']]","['credit scoring', 'machine learning', 'digital credit', 'mobile phones', 'financial inclusion']"
5709,1905.12133,Edmon Begoli,"Edmon Begoli, Tyler Akidau, Fabian Hueske, Julian Hyde, Kathryn
  Knight, Kenneth Knowles",One SQL to Rule Them All,,,10.1145/3299869.3314040,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real-time data analysis and management are increasingly critical for today`s
businesses. SQL is the de facto lingua franca for these endeavors, yet support
for robust streaming analysis and management with SQL remains limited. Many
approaches restrict semantics to a reduced subset of features and/or require a
suite of non-standard constructs. Additionally, use of event timestamps to
provide native support for analyzing events according to when they actually
occurred is not pervasive, and often comes with important limitations. We
present a three-part proposal for integrating robust streaming into the SQL
standard, namely: (1) time-varying relations as a foundation for classical
tables as well as streaming data, (2) event time semantics, (3) a limited set
of optional keyword extensions to control the materialization of time-varying
query results. Motivated and illustrated using examples and lessons learned
from implementations in Apache Calcite, Apache Flink, and Apache Beam, we show
how with these minimal additions it is possible to utilize the complete suite
of standard SQL semantics to perform robust stream processing.
","[{'version': 'v1', 'created': 'Tue, 28 May 2019 23:26:08 GMT'}]",2019-05-30,"[['Begoli', 'Edmon', ''], ['Akidau', 'Tyler', ''], ['Hueske', 'Fabian', ''], ['Hyde', 'Julian', ''], ['Knight', 'Kathryn', ''], ['Knowles', 'Kenneth', '']]","['stream processing', 'data management', 'query processing']"
5710,2107.13280,Laura De Lorenzis,Tymofiy Gerasimov and Laura De Lorenzis,Second-order phase-field formulations for anisotropic brittle fracture,,,10.1016/j.cma.2021.114403,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  We address brittle fracture in anisotropic materials featuring two-fold and
four-fold symmetric fracture toughness. For these two classes, we develop two
variational phase-field models based on the family of regularizations proposed
by Focardi (Focardi, M. On the variational approximation of free-discontinuity
problems in the vectorial case. Math. Models Methods App. Sci., 11:663{684,
2001), for which Gamma-convergence results hold. Since both models are of
second order, as opposed to the previously available fourth-order models for
four-fold symmetric fracture toughness, they do not require basis functions of
C1-continuity nor mixed variational principles for finite element
discretization. For the four-fold symmetric formulation we show that the
standard quadratic degradation function is unsuitable and devise a procedure to
derive a suitable one. The performance of the new models is assessed via
several numerical examples that simulate anisotropic fracture under anti-plane
shear loading. For both formulations at fixed displacements (i.e. within an
alternate minimization procedure), we also provide some existence and
uniqueness results for the phase-field solution.
","[{'version': 'v1', 'created': 'Wed, 28 Jul 2021 11:21:48 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Oct 2021 17:37:39 GMT'}]",2021-12-22,"[['Gerasimov', 'Tymofiy', ''], ['De Lorenzis', 'Laura', '']]","['anisotropic fracture', 'two-fold symmetry', 'four-fold symmetry', 'phase-field modeling', 'zig-zag cracking']"
5711,1910.11494,Jianxun Lian,"Danyang Liu, Jianxun Lian, Shiyin Wang, Ying Qiao, Jiun-Hung Chen,
  Guangzhong Sun, Xing Xie",KRED: Knowledge-Aware Document Representation for News Recommendations,RecSys'20,,10.1145/3383313.3412237,,cs.IR cs.CL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  News articles usually contain knowledge entities such as celebrities or
organizations. Important entities in articles carry key messages and help to
understand the content in a more direct way. An industrial news recommender
system contains various key applications, such as personalized recommendation,
item-to-item recommendation, news category classification, news popularity
prediction and local news detection. We find that incorporating knowledge
entities for better document understanding benefits these applications
consistently. However, existing document understanding models either represent
news articles without considering knowledge entities (e.g., BERT) or rely on a
specific type of text encoding model (e.g., DKN) so that the generalization
ability and efficiency is compromised. In this paper, we propose KRED, which is
a fast and effective model to enhance arbitrary document representation with a
knowledge graph. KRED first enriches entities' embeddings by attentively
aggregating information from their neighborhood in the knowledge graph. Then a
context embedding layer is applied to annotate the dynamic context of different
entities such as frequency, category and position. Finally, an information
distillation layer aggregates the entity embeddings under the guidance of the
original document representation and transforms the document vector into a new
one. We advocate to optimize the model with a multi-task framework, so that
different news recommendation applications can be united and useful information
can be shared across different tasks. Experiments on a real-world Microsoft
News dataset demonstrate that KRED greatly benefits a variety of news
recommendation applications.
","[{'version': 'v1', 'created': 'Fri, 25 Oct 2019 02:21:33 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Jun 2020 12:03:47 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Sep 2020 11:25:04 GMT'}]",2020-09-15,"[['Liu', 'Danyang', ''], ['Lian', 'Jianxun', ''], ['Wang', 'Shiyin', ''], ['Qiao', 'Ying', ''], ['Chen', 'Jiun-Hung', ''], ['Sun', 'Guangzhong', ''], ['Xie', 'Xing', '']]","['knowledge-aware document representation', 'news recommendersystems', 'knowledge graphs']"
5712,2106.06358,Timo Koch,Timo Koch,"Projection-based resolved interface mixed-dimension method for embedded
  tubular network systems","33 pages, 15 figures",,10.1016/j.camwa.2022.01.021,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a flexible discretization technique for computational models of
thin tubular networks embedded in a bulk domain, for example a porous medium.
These systems occur in the simulation of fluid flow in vascularized biological
tissue, root water and nutrient uptake in soil, hydrological or petroleum wells
in rock formations, or heat transport in micro-cooling devices. The key
processes, such as heat and mass transfer, are usually dominated by the
exchange between the network system and the embedding domain. By explicitly
resolving the interface between these domains with the computational mesh, we
can accurately describe these processes. The network is efficiently described
by a network of line segments. Coupling terms are evaluated by projection of
the interface variables. The new method is naturally applicable for nonlinear
and time-dependent problems and can therefore be used as a reference method in
the development of novel implicit interface 1D-3D methods and in the design of
verification benchmarks for embedded tubular network methods. Implicit
interface, not resolving the bulk-network interface explicitly have proven to
be very efficient but have only been mathematically analyzed for linear
elliptic problems so far. Using two application scenarios, fluid perfusion of
vascularized tissue and root water uptake from soil, we investigate the effect
of some common modeling assumptions of implicit interface methods numerically.
","[{'version': 'v1', 'created': 'Fri, 11 Jun 2021 12:57:37 GMT'}]",2022-02-01,"[['Koch', 'Timo', '']]","['1D-3D coupling', 'model verification', 'mixed-dimension', 'embeddednetworks', 'vascularized tissue', 'root-soil interaction', 'resolved interface']"
5713,1810.02561,Simon Olofsson,"Simon Olofsson and Lukas Hebing and Sebastian Niedenf\""uhr and Marc
  Peter Deisenroth and Ruth Misener","GPdoemd: a Python package for design of experiments for model
  discrimination",,"Computers & Chemical Engineering, Volume 125, 2019, Pages 54-70",10.1016/j.compchemeng.2019.03.010,,cs.MS stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Model discrimination identifies a mathematical model that usefully explains
and predicts a given system's behaviour. Researchers will often have several
models, i.e. hypotheses, about an underlying system mechanism, but insufficient
experimental data to discriminate between the models, i.e. discard inaccurate
models. Given rival mathematical models and an initial experimental data set,
optimal design of experiments suggests maximally informative experimental
observations that maximise a design criterion weighted by prediction
uncertainty. The model uncertainty requires gradients, which may not be readily
available for black-box models. This paper (i) proposes a new design criterion
using the Jensen-R\'enyi divergence, and (ii) develops a novel method replacing
black-box models with Gaussian process surrogates. Using the surrogates, we
marginalise out the model parameters with approximate inference. Results show
these contributions working well for both classical and new test instances. We
also (iii) introduce and discuss GPdoemd, the open-source implementation of the
Gaussian process surrogate method.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 08:02:28 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Jan 2019 17:34:03 GMT'}, {'version': 'v3', 'created': 'Fri, 8 Mar 2019 15:24:29 GMT'}]",2019-03-20,"[['Olofsson', 'Simon', ''], ['Hebing', 'Lukas', ''], ['Niedenführ', 'Sebastian', ''], ['Deisenroth', 'Marc Peter', ''], ['Misener', 'Ruth', '']]","['Design of Experiments', 'Model Discrimination', 'Jensen-RényiDivergence', 'Gaussian Processes', 'Open-Source Software']"
5714,2009.12853,Nicolas E. Diaz Ferreyra PhD,"Nicolas E. D\'iaz Ferreyra, Esma A\""imeur, Hicham Hage, Maritta Heisel
  and Catherine Garc\'ia van Hoogstraten","Persuasion Meets AI: Ethical Considerations for the Design of Social
  Engineering Countermeasures",Accepted for publication at IC3K 2020,,10.5220/0010142402040211,,cs.CY cs.HC cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Privacy in Social Network Sites (SNSs) like Facebook or Instagram is closely
related to people's self-disclosure decisions and their ability to foresee the
consequences of sharing personal information with large and diverse audiences.
Nonetheless, online privacy decisions are often based on spurious risk
judgements that make people liable to reveal sensitive data to untrusted
recipients and become victims of social engineering attacks. Artificial
Intelligence (AI) in combination with persuasive mechanisms like nudging is a
promising approach for promoting preventative privacy behaviour among the users
of SNSs. Nevertheless, combining behavioural interventions with high levels of
personalization can be a potential threat to people's agency and autonomy even
when applied to the design of social engineering countermeasures. This paper
elaborates on the ethical challenges that nudging mechanisms can introduce to
the development of AI-based countermeasures, particularly to those addressing
unsafe self-disclosure practices in SNSs. Overall, it endorses the elaboration
of personalized risk awareness solutions as i) an ethical approach to
counteract social engineering, and ii) as an effective means for promoting
reflective privacy decisions.
","[{'version': 'v1', 'created': 'Sun, 27 Sep 2020 14:24:29 GMT'}]",2020-11-13,"[['Ferreyra', 'Nicolas E. Díaz', ''], ['Aïmeur', 'Esma', ''], ['Hage', 'Hicham', ''], ['Heisel', 'Maritta', ''], ['van Hoogstraten', 'Catherine García', '']]","['social engineering', 'digital nudging', 'privacy awareness', 'risk management', 'self-disclosure', 'AI', 'ethics']"
5715,2202.00379,Thien-Minh Nguyen,"Thien-Minh Nguyen, Shenghai Yuan, Muqing Cao, Yang Lyu, Thien Hoang
  Nguyen, Lihua Xie","NTU VIRAL: A Visual-Inertial-Ranging-Lidar Dataset, From an Aerial
  Vehicle Viewpoint",IJRR 2021,,10.1177/02783649211052312,,cs.RO cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  In recent years, autonomous robots have become ubiquitous in research and
daily life. Among many factors, public datasets play an important role in the
progress of this field, as they waive the tall order of initial investment in
hardware and manpower. However, for research on autonomous aerial systems,
there appears to be a relative lack of public datasets on par with those used
for autonomous driving and ground robots. Thus, to fill in this gap, we conduct
a data collection exercise on an aerial platform equipped with an extensive and
unique set of sensors: two 3D lidars, two hardware-synchronized global-shutter
cameras, multiple Inertial Measurement Units (IMUs), and especially, multiple
Ultra-wideband (UWB) ranging units. The comprehensive sensor suite resembles
that of an autonomous driving car, but features distinct and challenging
characteristics of aerial operations. We record multiple datasets in several
challenging indoor and outdoor conditions. Calibration results and ground truth
from a high-accuracy laser tracker are also included in each package. All
resources can be accessed via our webpage
https://ntu-aris.github.io/ntu_viral_dataset.
","[{'version': 'v1', 'created': 'Tue, 1 Feb 2022 12:46:52 GMT'}]",2022-02-02,"[['Nguyen', 'Thien-Minh', ''], ['Yuan', 'Shenghai', ''], ['Cao', 'Muqing', ''], ['Lyu', 'Yang', ''], ['Nguyen', 'Thien Hoang', ''], ['Xie', 'Lihua', '']]","['Dataset', 'Aerial Robot', 'Autonomous System', 'Simultaneous Localization', 'Mapping']"
5716,2006.07937,Ronaldo Araujo,Ronaldo Ferreira Araujo,"Communities of attention networks: introducing qualitative and
  conversational perspectives for altmetrics","23 pages, 5 figures, paper accepted for publication in Scientometrics","Scientometrics, 2020",10.1007/s11192-020-03566-7,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose to analyze the level of recommendation and spreading in the
sharing of scientific papers on Twitter to understand the interactions of
communities around papers and to develop the ""Community of Attention Network""
(CAN). In this paper, a pilot case study was conducted for the paper
'Pharmacological Treatment of Obesity' authored by Mancini & Halpern (2002), an
extensive review of the criteria for evaluating the efficacy of anti-obesity
treatments and derived pharmacological agents. The altmetric data was collected
from Altmetric.com and the description information for each tweeter was
extracted from their Twitter profiles. The data were analyzed with
Microanalysis Of Online Data perspective to investigate the formation of a CAN
around this focal paper and the context of its formation. The studied article
received 736 tweets from 134 different users with a combined exposure of more
than 459,018 followers and a high level of spreading (67.26%) and
recommendation (28.53%). The user's bios information analysis of who shares the
article indicate individual profiles focused on personal issues and strong
civic and political engagement. Personal-professional and institutional
tweeters of the national political scene are often mentioned in the tweets. In
analyzing the content of the tweets, we note that the altmetric score of the
paper is a result of its strategic use as an online activism resource and a
digital advocacy tool used to mobilize stakeholders for awareness and support
activities. This study and the contextual and network perspective it introduces
may help to understand the social impact of publications by using altmetrics.
","[{'version': 'v1', 'created': 'Sun, 14 Jun 2020 15:59:15 GMT'}]",2020-06-16,"[['Araujo', 'Ronaldo Ferreira', '']]","['Altmetrics', 'Online attention', 'Communities of attention network', 'Twitter']"
5717,2209.12391,Paarth Neekhara,"Shehzeen Hussain, Nojan Sheybani, Paarth Neekhara, Xinqiao Zhang,
  Javier Duarte, Farinaz Koushanfar","FastStamp: Accelerating Neural Steganography and Digital Watermarking of
  Images on FPGAs",Accepted at ICCAD 2022,,10.1145/3508352.3549357,,cs.CV cs.AI cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Steganography and digital watermarking are the tasks of hiding recoverable
data in image pixels. Deep neural network (DNN) based image steganography and
watermarking techniques are quickly replacing traditional hand-engineered
pipelines. DNN based watermarking techniques have drastically improved the
message capacity, imperceptibility and robustness of the embedded watermarks.
However, this improvement comes at the cost of increased computational overhead
of the watermark encoder neural network. In this work, we design the first
accelerator platform FastStamp to perform DNN based steganography and digital
watermarking of images on hardware. We first propose a parameter efficient DNN
model for embedding recoverable bit-strings in image pixels. Our proposed model
can match the success metrics of prior state-of-the-art DNN based watermarking
methods while being significantly faster and lighter in terms of memory
footprint. We then design an FPGA based accelerator framework to further
improve the model throughput and power consumption by leveraging data
parallelism and customized computation paths. FastStamp allows embedding
hardware signatures into images to establish media authenticity and ownership
of digital media. Our best design achieves 68 times faster inference as
compared to GPU implementations of prior DNN based watermark encoder while
consuming less power.
","[{'version': 'v1', 'created': 'Mon, 26 Sep 2022 03:08:29 GMT'}]",2022-09-27,"[['Hussain', 'Shehzeen', ''], ['Sheybani', 'Nojan', ''], ['Neekhara', 'Paarth', ''], ['Zhang', 'Xinqiao', ''], ['Duarte', 'Javier', ''], ['Koushanfar', 'Farinaz', '']]","['Digital watermarking', 'steganography', 'FPGA', 'deep learning']"
5718,1908.11459,Gorm Lai,"Gorm Lai, Kai Erenli, Foaad Khosmood, William Latham",Introducing: The Game Jam License,,,10.1145/3337722.3341844,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since their inception at the Indie Game Jam in 2002, a significant part of
game jams has been knowledge sharing and showcasing ideas and work to peers.
While various licensing mechanisms have been used for game jams throughout the
years, there has never been a licence uniquely designed for artifacts created
during a game jam. In this paper, we present to the community the Game Jam
License (GJL) which is designed to facilitate that sharing and knowledge
transfer, while making sure the original creators retain commercial rights. The
Global Game Jam, since 2009, strives to formalise sharing in a similar manner,
by having jammers upload and license their creations under Creative Commons Non
Commercial Share Alike 3.0 free license. However, the CC family of licenses is
not well suited for software. CC is not compatible with most other licenses,
and introduces a legal grey area with the division between commercial and
non-commercial use. Moreover, open source licences like GPL are well suited for
source code, but not for art and design content. Instead the GJL presented in
this paper, aims to uphold the original ideas of game jams (sharing and
knowledge transfer), while still allowing the original team to hold on to all
rights to their creation, without any of the deficiencies of the CC family of
licenses.
","[{'version': 'v1', 'created': 'Thu, 29 Aug 2019 21:35:50 GMT'}]",2019-09-02,"[['Lai', 'Gorm', ''], ['Erenli', 'Kai', ''], ['Khosmood', 'Foaad', ''], ['Latham', 'William', '']]","['game jams', 'licenses', 'open source', 'creative commons', 'global gamejam', 'copyright', 'sharing', 'law']"
5719,2201.06444,Federico Milani,"Piero Fraternali, Federico Milani, Rocio Nahime Torres, Niccol\`o
  Zangrando","Black-box Error Diagnosis in Deep Neural Networks for Computer Vision: a
  Survey of Tools","Published in Springer Neural Computing and Applications,
  https://link.springer.com/article/10.1007/s00521-022-08100-9",,10.1007/s00521-022-08100-9,,cs.LG cs.AI cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The application of Deep Neural Networks (DNNs) to a broad variety of tasks
demands methods for coping with the complex and opaque nature of these
architectures. When a gold standard is available, performance assessment treats
the DNN as a black box and computes standard metrics based on the comparison of
the predictions with the ground truth. A deeper understanding of performances
requires going beyond such evaluation metrics to diagnose the model behavior
and the prediction errors. This goal can be pursued in two complementary ways.
On one side, model interpretation techniques ""open the box"" and assess the
relationship between the input, the inner layers and the output, so as to
identify the architecture modules most likely to cause the performance loss. On
the other hand, black-box error diagnosis techniques study the correlation
between the model response and some properties of the input not used for
training, so as to identify the features of the inputs that make the model
fail. Both approaches give hints on how to improve the architecture and/or the
training process. This paper focuses on the application of DNNs to Computer
Vision (CV) tasks and presents a survey of the tools that support the black-box
performance diagnosis paradigm. It illustrates the features and gaps of the
current proposals, discusses the relevant research directions and provides a
brief overview of the diagnosis tools in sectors other than CV.
","[{'version': 'v1', 'created': 'Mon, 17 Jan 2022 14:55:15 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Jun 2022 13:38:30 GMT'}, {'version': 'v3', 'created': 'Tue, 27 Sep 2022 08:38:20 GMT'}, {'version': 'v4', 'created': 'Thu, 22 Dec 2022 08:55:27 GMT'}]",2022-12-23,"[['Fraternali', 'Piero', ''], ['Milani', 'Federico', ''], ['Torres', 'Rocio Nahime', ''], ['Zangrando', 'Niccolò', '']]","['black-box', 'error diagnosis', 'machine learning', 'evaluation', 'metrics']"
5720,1904.05027,Enrique Fernandez-Blanco,"Daniel Rivero, Enrique Fernandez-Blanco, Julian Dorado, Alejandro
  Pazos",Classification of Two-channel Signals by Means of Genetic Programming,"Conference paper, doble-column, 7 pages, 1 figure, 3 tables","Proceedings of Annual Conference on Genetic and Evolutionary
  Computation 2015 (GECCO'15), pp. 1319-1325",10.1145/2739482.2768507,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditionally, signal classification is a process in which previous knowledge
of the signals is needed. Human experts decide which features are extracted
from the signals, and used as inputs to the classification system. This
requirement can make significant unknown information of the signal be missed by
the experts and not be included in the features. This paper proposes a new
method that automatically analyses the signals and extracts the features
without any human participation. Therefore, there is no need for previous
knowledge about the signals to be classified. The proposed method is based on
Genetic Programming and, in order to test this method, it has been applied to a
well-known EEG database related to epilepsy, a disease suffered by millions of
people. As the results section shows, high accuracies in classification are
obtained
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2019 07:18:49 GMT'}]",2019-04-11,"[['Rivero', 'Daniel', ''], ['Fernandez-Blanco', 'Enrique', ''], ['Dorado', 'Julian', ''], ['Pazos', 'Alejandro', '']]","['Genetic Programming', 'Evolutionary Computation', 'Signal Analysis', 'Automatic Feature Extraction', 'EEG Analysis']"
5721,2103.10561,Minsung Kim,"Minsung Kim, Salvatore Mandr\`a, Davide Venturelli, Kyle Jamieson","Physics-Inspired Heuristics for Soft MIMO Detection in 5G New Radio and
  Beyond",ACM MobiCom '21 (https://doi.org/10.1145/3447993.3448619),,10.1145/3447993.3448619,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Overcoming the conventional trade-off between throughput and bit error rate
(BER) performance, versus computational complexity is a long-term challenge for
uplink Multiple-Input Multiple-Output (MIMO) detection in base station design
for the cellular 5G New Radio roadmap, as well as in next generation wireless
local area networks. In this work, we present ParaMax, a MIMO detector
architecture that for the first time brings to bear physics-inspired parallel
tempering algorithmic techniques [28, 50, 67] on this class of problems.
ParaMax can achieve near optimal maximum-likelihood (ML) throughput performance
in the Large MIMO regime, Massive MIMO systems where the base station has
additional RF chains, to approach the number of base station antennas, in order
to support even more parallel spatial streams. ParaMax is able to achieve a
near ML-BER performance up to 160x160 and 80x80 Large MIMO for low-order
modulations such as BPSK and QPSK, respectively, only requiring less than tens
of processing elements. With respect to Massive MIMO systems, in 12x24 MIMO
with 16-QAM at SNR 16 dB, ParaMax achieves 330 Mbits/s near-optimal system
throughput with 4--8 processing elements per subcarrier, which is approximately
1.4x throughput than linear detector-based Massive MIMO systems.
","[{'version': 'v1', 'created': 'Thu, 18 Mar 2021 23:04:57 GMT'}]",2021-03-22,"[['Kim', 'Minsung', ''], ['Mandrà', 'Salvatore', ''], ['Venturelli', 'Davide', ''], ['Jamieson', 'Kyle', '']]","['Parallel Tempering', 'Massive MIMO', 'MU-MIMO Detection', '5G']"
5722,2208.05734,Pino Caballero-Gil,"Nayra Rodr\'iguez-P\'erez, Josu\'e Toledo-Castro, Pino Caballero-Gil,
  Iv\'an Santos-Gonz\'alez, Candelaria Hern\'andez-Goya",Secure ambient intelligence prototype for airports,,,10.1007/s12652-020-01683-y,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Nowadays, many technological advances applied to the Internet of Things (IoT)
make the introduction of innovative sensors aimed to deploy efficient wireless
sensor networks possible. In order to improve the environment and people's
lives, real time analysis of certain environmental variables may favor the
reduction of health risks related to the deterioration of air quality. To this
respect, the proposed system implements a particular prototype of IoT device
characterized by the assembly of ambient sensors capable of measuring pollutant
gases, temperature and humidity. For this purpose, Raspberry Pi and Arduino
platforms are used. Several security methods are introduced to ensure the
integrity of air quality data by implementing Merkle Trees on each IoT node and
on the Cloud server. Besides, the authenticity of IoT devices and the
confidentiality of communications are guaranteed by implementing HTTPS
requests. Finally, authentication tokens are used to identify system users, and
different security rules are applied to manage database operations.
","[{'version': 'v1', 'created': 'Thu, 11 Aug 2022 10:00:14 GMT'}]",2022-08-12,"[['Rodríguez-Pérez', 'Nayra', ''], ['Toledo-Castro', 'Josué', ''], ['Caballero-Gil', 'Pino', ''], ['Santos-González', 'Iván', ''], ['Hernández-Goya', 'Candelaria', '']]","['Air Quality', 'Wireless Sensor Networks', 'Merkle Trees', 'Security', 'Airports']"
5723,2112.07548,\'Etienne Andr\'e,"\'Etienne Andr\'e, Emmanuel Coquard, Laurent Fribourg, Jawher Jerray
  and David Lesens","Parametric schedulability analysis of a launcher flight control system
  under reactivity constraints","This manuscript is the author version of the manuscript of the same
  name published in Fundamenta Informatica 182(1). This is an extended version
  of the manuscript published in the proceedings of the 19th International
  Conference on Application of Concurrency to System Design (ACSD 2019). arXiv
  admin note: substantial text overlap with arXiv:1903.07217","Fundamenta Informaticae 181(1), pages 31-67, 2021",10.3233/FI-2021-2065,,cs.SE cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The next generation of space systems will have to achieve more and more
complex missions. In order to master the development cost and duration of such
systems, an alternative to a manual design is to automatically synthesize the
main parameters of the system. In this paper, we present an approach for the
specific case of the scheduling of the flight control of a space launcher. The
approach requires two successive steps: (1) the formalization of the problem to
be solved in a parametric formal model and (2) the synthesis of the model
parameters with a tool. We first describe the problem of the scheduling of a
launcher flight control, then we show how this problem can be formalized with
parametric stopwatch automata; we then present the results computed by the
parametric timed model checker IMITATOR. We enhance our model by taking into
consideration the time for switching context, and we compare the results to
those obtained by other tools classically used in scheduling.
","[{'version': 'v1', 'created': 'Wed, 13 Oct 2021 11:23:12 GMT'}]",2021-12-15,"[['André', 'Étienne', ''], ['Coquard', 'Emmanuel', ''], ['Fribourg', 'Laurent', ''], ['Jerray', 'Jawher', ''], ['Lesens', 'David', '']]","['scheduling', 'real-time systems', 'model checking', 'parameter synthesis', 'IMITATOR']"
5724,1910.05404,Manuel Camargo,"Manuel Camargo, Marlon Dumas, Oscar Gonz\'alez-Rojas","Automated Discovery of Business Process Simulation Models from Event
  Logs","34 pages, 5 figures, Research paper",,10.1016/j.dss.2020.113284,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Business process simulation is a versatile technique to estimate the
performance of a process under multiple scenarios. This, in turn, allows
analysts to compare alternative options to improve a business process. A common
roadblock for business process simulation is that constructing accurate
simulation models is cumbersome and error-prone. Modern information systems
store detailed execution logs of the business processes they support. Previous
work has shown that these logs can be used to discover simulation models.
However, existing methods for log-based discovery of simulation models do not
seek to optimize the accuracy of the resulting models. Instead they leave it to
the user to manually tune the simulation model to achieve the desired level of
accuracy. This article presents an accuracy-optimized method to discover
business process simulation models from execution logs. The method decomposes
the problem into a series of steps with associated configuration parameters. A
hyper-parameter optimization method is used to search through the space of
possible configurations so as to maximize the similarity between the behavior
of the simulation model and the behavior observed in the log. The method has
been implemented as a tool and evaluated using logs from different domains.
","[{'version': 'v1', 'created': 'Fri, 11 Oct 2019 20:47:26 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Oct 2019 08:26:46 GMT'}, {'version': 'v3', 'created': 'Thu, 27 Feb 2020 22:58:16 GMT'}]",2020-03-30,"[['Camargo', 'Manuel', ''], ['Dumas', 'Marlon', ''], ['González-Rojas', 'Oscar', '']]","['Process simulation', 'Process mining', 'Automated process discovery']"
5725,2006.03292,Ayush Garg,"Ayush Garg, Sammed Shantinath Kagi, Mayank Singh",SEAL: Scientific Keyphrase Extraction and Classification,Accepted at JCDL 2020,,10.1145/3383583.3398625,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic scientific keyphrase extraction is a challenging problem
facilitating several downstream scholarly tasks like search, recommendation,
and ranking. In this paper, we introduce SEAL, a scholarly tool for automatic
keyphrase extraction and classification. The keyphrase extraction module
comprises two-stage neural architecture composed of Bidirectional Long
Short-Term Memory cells augmented with Conditional Random Fields. The
classification module comprises of a Random Forest classifier. We extensively
experiment to showcase the robustness of the system. We evaluate multiple
state-of-the-art baselines and show a significant improvement. The current
system is hosted at http://lingo.iitgn.ac.in:5000/.
","[{'version': 'v1', 'created': 'Fri, 5 Jun 2020 08:21:26 GMT'}]",2020-06-08,"[['Garg', 'Ayush', ''], ['Kagi', 'Sammed Shantinath', ''], ['Singh', 'Mayank', '']]","['Scholarly Keyphrases', 'Extraction', 'Classification', 'BiLSTM', 'MLP', 'CRF']"
5726,1402.6065,Tsung-Hui Chang,Tsung-Hui Chang and Mingyi Hong and Xiangfeng Wang,Multi-Agent Distributed Optimization via Inexact Consensus ADMM,"submitted to IEEE Trans. Signal Processing; Revised April 2014 and
  August 2014",,10.1109/TSP.2014.2367458,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-agent distributed consensus optimization problems arise in many signal
processing applications. Recently, the alternating direction method of
multipliers (ADMM) has been used for solving this family of problems. ADMM
based distributed optimization method is shown to have faster convergence rate
compared with classic methods based on consensus subgradient, but can be
computationally expensive, especially for problems with complicated structures
or large dimensions. In this paper, we propose low-complexity algorithms that
can reduce the overall computational cost of consensus ADMM by an order of
magnitude for certain large-scale problems. Central to the proposed algorithms
is the use of an inexact step for each ADMM update, which enables the agents to
perform cheap computation at each iteration. Our convergence analyses show that
the proposed methods converge well under some convexity assumptions. Numerical
results show that the proposed algorithms offer considerably lower
computational complexity than the standard ADMM based distributed optimization
methods.
","[{'version': 'v1', 'created': 'Tue, 25 Feb 2014 06:44:49 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Sep 2014 02:55:27 GMT'}]",2015-06-18,"[['Chang', 'Tsung-Hui', ''], ['Hong', 'Mingyi', ''], ['Wang', 'Xiangfeng', '']]","['− Distributed optimization', 'ADMM', 'Consensus']"
5727,2202.11998,Kunlun Xu,"Kunlun Xu and Zhimin Li and Zhijun Zhang and Leizhen Dong and Wenhui
  Xu and Luxin Yan and Sheng Zhong and Xu Zou",Effective Actor-centric Human-object Interaction Detection,11 pages,,10.1016/j.imavis.2022.104422,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  While Human-Object Interaction(HOI) Detection has achieved tremendous
advances in recent, it still remains challenging due to complex interactions
with multiple humans and objects occurring in images, which would inevitably
lead to ambiguities. Most existing methods either generate all human-object
pair candidates and infer their relationships by cropped local features
successively in a two-stage manner, or directly predict interaction points in a
one-stage procedure. However, the lack of spatial configurations or reasoning
steps of two- or one- stage methods respectively limits their performance in
such complex scenes. To avoid this ambiguity, we propose a novel actor-centric
framework. The main ideas are that when inferring interactions: 1) the
non-local features of the entire image guided by actor position are obtained to
model the relationship between the actor and context, and then 2) we use an
object branch to generate pixel-wise interaction area prediction, where the
interaction area denotes the object central area. Moreover, we also use an
actor branch to get interaction prediction of the actor and propose a novel
composition strategy based on center-point indexing to generate the final HOI
prediction. Thanks to the usage of the non-local features and the
partly-coupled property of the human-objects composition strategy, our proposed
framework can detect HOI more accurately especially for complex images.
Extensive experimental results show that our method achieves the
state-of-the-art on the challenging V-COCO and HICO-DET benchmarks and is more
robust especially in multiple persons and/or objects scenes.
","[{'version': 'v1', 'created': 'Thu, 24 Feb 2022 10:24:44 GMT'}]",2022-04-04,"[['Xu', 'Kunlun', ''], ['Li', 'Zhimin', ''], ['Zhang', 'Zhijun', ''], ['Dong', 'Leizhen', ''], ['Xu', 'Wenhui', ''], ['Yan', 'Luxin', ''], ['Zhong', 'Sheng', ''], ['Zou', 'Xu', '']]","['Human-Object Interaction Detection', 'Global Context Utilizing', 'Pixel-wise Prediction', 'Deep Learning']"
5728,2204.05182,Usman Rafiq,Usman Rafiq,Towards Understanding Analytics in Software Startups,"8 pages, 2 figures, accepted for presentation at 5th International
  Workshop on Software-intensive Business: Towards Sustainable Software
  Business, Pittsburgh, PA, USA",,10.1145/3524614.3528632,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Analytics plays a crucial role in the data-informed decision-making processes
of modern businesses. Unlike established software companies, software startups
are not seen utilizing the potential of analytics even though a startup process
should be primarily data-driven. There has been little understanding in the
literature about analytics for software startups. This study set out to address
the knowledge gap by exploring how analytics is understood in the context of
software startups. To this end, we collected the qualitative data of three
analytics platforms that are mostly used by startups from multiple sources. We
covered platform documentation as well as experience reports of the software
startups using these platforms. The data was analyzed using content analysis
techniques. Four high-level concepts were identified that encapsulate the real
understanding of software startups on analytics, including instrumentation of
analytics, experimentation, diagnostic analysis, and getting insights. The
first concept describes how startups set up analytics and the latter three
illustrate the usage scenarios of analytics. This study is the first step
toward understanding analytics in the software startup context. The identified
concepts can guide further investigation of analytics in this context. It also
provides some insights for software startups to set up analytics for
data-informed decisions. Given the limitation of the data used in the study,
the immediate next step is to ground as well as validate the acquired
understanding using the primary data, by directly interacting with software
startups.
","[{'version': 'v1', 'created': 'Mon, 11 Apr 2022 15:13:33 GMT'}]",2022-04-12,"[['Rafiq', 'Usman', '']]","['analytics', 'metrics', 'abstraction', 'software startups']"
5729,2212.00522,Fangye Wang,"Fangye Wang, Yingxu Wang, Dongsheng Li, Hansu Gu, Tun Lu, Peng Zhang,
  Ning Gu",CL4CTR: A Contrastive Learning Framework for CTR Prediction,WSDM 2023,,10.1145/3539597.3570372,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many Click-Through Rate (CTR) prediction works focused on designing advanced
architectures to model complex feature interactions but neglected the
importance of feature representation learning, e.g., adopting a plain embedding
layer for each feature, which results in sub-optimal feature representations
and thus inferior CTR prediction performance. For instance, low frequency
features, which account for the majority of features in many CTR tasks, are
less considered in standard supervised learning settings, leading to
sub-optimal feature representations. In this paper, we introduce
self-supervised learning to produce high-quality feature representations
directly and propose a model-agnostic Contrastive Learning for CTR (CL4CTR)
framework consisting of three self-supervised learning signals to regularize
the feature representation learning: contrastive loss, feature alignment, and
field uniformity. The contrastive module first constructs positive feature
pairs by data augmentation and then minimizes the distance between the
representations of each positive feature pair by the contrastive loss. The
feature alignment constraint forces the representations of features from the
same field to be close, and the field uniformity constraint forces the
representations of features from different fields to be distant. Extensive
experiments verify that CL4CTR achieves the best performance on four datasets
and has excellent effectiveness and compatibility with various representative
baselines.
","[{'version': 'v1', 'created': 'Thu, 1 Dec 2022 14:18:02 GMT'}]",2022-12-02,"[['Wang', 'Fangye', ''], ['Wang', 'Yingxu', ''], ['Li', 'Dongsheng', ''], ['Gu', 'Hansu', ''], ['Lu', 'Tun', ''], ['Zhang', 'Peng', ''], ['Gu', 'Ning', '']]","['Contrastive Learning', 'Representation Learning', 'CTR Prediction']"
5730,2111.10862,"Rafa\""el Bocquet","Rafa\""el Bocquet","Strictification of weakly stable type-theoretic structures using generic
  contexts",,"27th International Conference on Types for Proofs and Programs
  (TYPES 2021), 3:1-3:23",10.4230/LIPIcs.TYPES.2021.3,,cs.LO math.CT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new strictification method for type-theoretic structures that
are only weakly stable under substitution. Given weakly stable structures over
some model of type theory, we construct equivalent strictly stable structures
by evaluating the weakly stable structures at generic contexts. These generic
contexts are specified using the categorical notion of familial
representability. This generalizes the local universes method of Lumsdaine and
Warren.
  We show that generic contexts can also be constructed in any category with
families which is freely generated by collections of types and terms, without
any definitional equality. This relies on the fact that they support
first-order unification. These free models can only be equipped with weak
type-theoretic structures, whose computation rules are given by typal
equalities. Our main result is that any model of type theory with weakly stable
weak type-theoretic structures admits an equivalent model with strictly stable
weak type-theoretic structures.
","[{'version': 'v1', 'created': 'Sun, 21 Nov 2021 17:05:55 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Nov 2022 11:12:48 GMT'}]",2022-11-28,"[['Bocquet', 'Rafaël', '']]","['type theory', 'strictification', 'coherence', 'familial representability', 'unification']"
5731,2208.08919,Ben Chugg,"Ben Chugg, Nicolas Rothbacher, Alex Feng, Xiaoqi Long, Daniel E. Ho","Detecting Environmental Violations with Satellite Imagery in Near Real
  Time: Land Application under the Clean Water Act",Accepted to CIKM '22,,10.1145/3511808.3557104,,cs.CV cs.CY,http://creativecommons.org/licenses/by/4.0/,"  This paper introduces a new, highly consequential setting for the use of
computer vision for environmental sustainability. Concentrated Animal Feeding
Operations (CAFOs) (aka intensive livestock farms or ""factory farms"") produce
significant manure and pollution. Dumping manure in the winter months poses
significant environmental risks and violates environmental law in many states.
Yet the federal Environmental Protection Agency (EPA) and state agencies have
relied primarily on self-reporting to monitor such instances of ""land
application."" Our paper makes four contributions. First, we introduce the
environmental, policy, and agricultural setting of CAFOs and land application.
Second, we provide a new dataset of high-cadence (daily to weekly) 3m/pixel
satellite imagery from 2018-20 for 330 CAFOs in Wisconsin with hand labeled
instances of land application (n=57,697). Third, we develop an object detection
model to predict land application and a system to perform inference in near
real-time. We show that this system effectively appears to detect land
application (PR AUC = 0.93) and we uncover several outlier facilities which
appear to apply regularly and excessively. Last, we estimate the population
prevalence of land application events in Winter 2021/22. We show that the
prevalence of land application is much higher than what is self-reported by
facilities. The system can be used by environmental regulators and interest
groups, one of which piloted field visits based on this system this past
winter. Overall, our application demonstrates the potential for AI-based
computer vision systems to solve major problems in environmental compliance
with near-daily imagery.
","[{'version': 'v1', 'created': 'Thu, 18 Aug 2022 15:42:02 GMT'}]",2022-08-19,"[['Chugg', 'Ben', ''], ['Rothbacher', 'Nicolas', ''], ['Feng', 'Alex', ''], ['Long', 'Xiaoqi', ''], ['Ho', 'Daniel E.', '']]","['computer vision', 'environmental protection', 'satellite imagery', 'eventdetection']"
5732,2101.03861,Johannes Kromer,Johannes Kromer and Dieter Bothe,Face-based Volume-of-Fluid interface positioning in arbitrary polyhedra,,,10.1016/j.jcp.2021.110776,,cs.CG physics.comp-ph,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We introduce a fast and robust algorithm for finding a plane $\Gamma$ with
given normal $\vec{n}_\Gamma$, which truncates an arbitrary polyhedron
$\mathcal{P}$ such that the remaining sub-polyhedron admits a given volume
$\alpha|\mathcal{P}|$. In the literature, this is commonly referred to as
Volume-of-Fluid (VoF) interface positioning problem. The novelty of our work is
twofold: firstly, by recursive application of the Gaussian divergence theorem,
the volume of a truncated polyhedron can be computed at high efficiency, based
on summation over quantities associated to the faces of the polyhedron. One
obtains a very convenient piecewise parametrization (within so-called brackets)
in terms of the signed distance s to the plane $\Gamma$. As an implication, one
can restrain from the costly necessity to establish topological connectivity,
rendering the present approach most suitable for the application to
unstructured computational meshes. Secondly, in the vicinity of the truncation
position s, the volume can be expressed exactly, i.e. in terms of a cubic
polynomial of the normal distance to the PLIC plane. The local knowledge of
derivatives enables to construct a root-finding algorithm that pairs bracketing
and higher-order approximation. The performance is assessed by conducting an
extensive set of numerical experiments, considering convex and non-convex
polyhedra of genus (i.e., number of holes) zero and one in combination with
carefully selected volume fractions $\alpha$ (including $\alpha\approx0$ and
$\alpha\approx1$) and normal orientations $\vec{n}_\Gamma$. For all
configurations we obtain a significant reduction of the number of
(computationally costly) truncations required for the positioning: on average,
our algorithm requires between one and two polyhedron truncations to find the
position of the plane $\Gamma$, outperforming existing methods.
","[{'version': 'v1', 'created': 'Mon, 11 Jan 2021 13:13:44 GMT'}]",2021-11-24,"[['Kromer', 'Johannes', ''], ['Bothe', 'Dieter', '']]","['PLIC', 'interface positioning', 'Volume-of-Fluid method']"
5733,2107.06131,Michaela Beneder,"Gabriel Kronberger, Lukas Kammerer, Michael Kommenda",Identification of Dynamical Systems using Symbolic Regression,"The final authenticated publication is available online at
  https://doi.org/10.1007/978-3-030-45093-9","In Computer Aided Systems Theory - EUROCAST 2019, Series Volume
  12013, pp. 370-377. Springer. (2020)",10.1007/978-3-030-45093-9,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a method for the identification of models for dynamical systems
from observational data. The method is based on the concept of symbolic
regression and uses genetic programming to evolve a system of ordinary
differential equations (ODE). The novelty is that we add a step of
gradient-based optimization of the ODE parameters. For this we calculate the
sensitivities of the solution to the initial value problem (IVP) using
automatic differentiation. The proposed approach is tested on a set of 19
problem instances taken from the literature which includes datasets from
simulated systems as well as datasets captured from mechanical systems. We find
that gradient-based optimization of parameters improves predictive accuracy of
the models. The best results are obtained when we first fit the individual
equations to the numeric differences and then subsequently fine-tune the
identified parameter values by fitting the IVP solution to the observed
variable values.
","[{'version': 'v1', 'created': 'Tue, 6 Jul 2021 11:41:10 GMT'}]",2021-07-14,"[['Kronberger', 'Gabriel', ''], ['Kammerer', 'Lukas', ''], ['Kommenda', 'Michael', '']]","['System dynamics', 'Genetic programming', 'Symbolic regression']"
5734,2103.07492,Andrea Cossu,"Andrea Cossu, Antonio Carta, Vincenzo Lomonaco, Davide Bacciu","Continual Learning for Recurrent Neural Networks: an Empirical
  Evaluation",Published in Neural Networks,"Neural Networks, Volume 143, 2021, pages 607-627",10.1016/j.neunet.2021.07.021,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning continuously during all model lifetime is fundamental to deploy
machine learning solutions robust to drifts in the data distribution. Advances
in Continual Learning (CL) with recurrent neural networks could pave the way to
a large number of applications where incoming data is non stationary, like
natural language processing and robotics. However, the existing body of work on
the topic is still fragmented, with approaches which are application-specific
and whose assessment is based on heterogeneous learning protocols and datasets.
In this paper, we organize the literature on CL for sequential data processing
by providing a categorization of the contributions and a review of the
benchmarks. We propose two new benchmarks for CL with sequential data based on
existing datasets, whose characteristics resemble real-world applications. We
also provide a broad empirical evaluation of CL and Recurrent Neural Networks
in class-incremental scenario, by testing their ability to mitigate forgetting
with a number of different strategies which are not specific to sequential data
processing. Our results highlight the key role played by the sequence length
and the importance of a clear specification of the CL scenario.
","[{'version': 'v1', 'created': 'Fri, 12 Mar 2021 19:25:28 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Mar 2021 11:10:43 GMT'}, {'version': 'v3', 'created': 'Fri, 28 May 2021 08:25:39 GMT'}, {'version': 'v4', 'created': 'Mon, 2 Aug 2021 14:06:51 GMT'}]",2021-08-03,"[['Cossu', 'Andrea', ''], ['Carta', 'Antonio', ''], ['Lomonaco', 'Vincenzo', ''], ['Bacciu', 'Davide', '']]","['continual learning', 'recurrent neural networks', 'benchmarks', 'evaluation']"
5735,1810.02589,Mostafa Zaman Chowdhury,"Md. Tanvir Hossan, Mostafa Zaman Chowdhury, Moh. Khalid Hasan, Md.
  Shahjalal, Trang Nguyen, Nam Tuan Le, and Yeong Min Jang","A New Vehicle Localization Scheme Based on Combined Optical Camera
  Communication and Photogrammetry",,"Mobile Information Systems, vol. 2018, March 2018",10.1155/2018/8501898,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The demand for autonomous vehicles is increasing gradually owing to their
enormous potential benefits. However, several challenges, such as vehicle
localization, are involved in the development of autonomous vehicles. A simple
and secure algorithm for vehicle positioning is proposed herein without
massively modifying the existing transportation infrastructure. For vehicle
localization, vehicles on the road are classified into two categories: host
vehicles (HVs) are the ones used to estimate other vehicles' positions and
forwarding vehicles (FVs) are the ones that move in front of the HVs. The FV
transmits modulated data from the tail (or back) light, and the camera of the
HV receives that signal using optical camera communication (OCC). In addition,
the streetlight (SL) data are considered to ensure the position accuracy of the
HV. Determining the HV position minimizes the relative position variation
between the HV and FV. Using photogrammetry, the distance between FV or SL and
the camera of the HV is calculated by measuring the occupied image area on the
image sensor. Comparing the change in distance between HV and SLs with the
change in distance between HV and FV, the positions of FVs are determined. The
performance of the proposed technique is analyzed, and the results indicate a
significant improvement in performance. The experimental distance measurement
validated the feasibility of the proposed scheme.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 10:00:05 GMT'}]",2018-10-08,"[['Hossan', 'Md. Tanvir', ''], ['Chowdhury', 'Mostafa Zaman', ''], ['Hasan', 'Moh. Khalid', ''], ['Shahjalal', 'Md.', ''], ['Nguyen', 'Trang', ''], ['Le', 'Nam Tuan', ''], ['Jang', 'Yeong Min', '']]","['Vehicle localization', 'vehicle-to-vehicle communication', 'vehicle-to-infrastructure communication', 'optical camera']"
5736,2108.05233,Yushun Dong,"Yushun Dong, Ninghao Liu, Brian Jalaian, Jundong Li",EDITS: Modeling and Mitigating Data Bias for Graph Neural Networks,Published at The Web Conference 2022 (WWW 2022),,10.1145/3485447.3512173,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph Neural Networks (GNNs) have shown superior performance in analyzing
attributed networks in various web-based applications such as social
recommendation and web search. Nevertheless, in high-stake decision-making
scenarios such as online fraud detection, there is an increasing societal
concern that GNNs could make discriminatory decisions towards certain
demographic groups. Despite recent explorations on fair GNNs, these works are
tailored for a specific GNN model. However, myriads of GNN variants have been
proposed for different applications, and it is costly to fine-tune existing
debiasing algorithms for each specific GNN architecture. Different from
existing works that debias GNN models, we aim to debias the input attributed
network to achieve fairer GNNs through feeding GNNs with less biased data.
Specifically, we propose novel definitions and metrics to measure the bias in
an attributed network, which leads to the optimization objective to mitigate
bias. We then develop a framework EDITS to mitigate the bias in attributed
networks while maintaining the performance of GNNs in downstream tasks. EDITS
works in a model-agnostic manner, i.e., it is independent of any specific GNN.
Experiments demonstrate the validity of the proposed bias metrics and the
superiority of EDITS on both bias mitigation and utility maintenance.
Open-source implementation: https://github.com/yushundong/EDITS.
","[{'version': 'v1', 'created': 'Wed, 11 Aug 2021 14:07:01 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Feb 2022 08:35:44 GMT'}]",2022-02-22,"[['Dong', 'Yushun', ''], ['Liu', 'Ninghao', ''], ['Jalaian', 'Brian', ''], ['Li', 'Jundong', '']]","['graph neural networks', 'algorithmic fairness', 'data bias']"
5737,2106.08142,Alessio Santamaria,"Filippo Bonchi, Alessio Santamaria, Jens Seeber, Pawe{\l} Soboci\'nski",On Doctrines and Cartesian Bicategories,,"9th Conference on Algebra and Coalgebra in Computer Science (CALCO
  2021)",10.4230/LIPIcs.CALCO.2021.10,,cs.LO math.CT,http://creativecommons.org/licenses/by/4.0/,"  We study the relationship between cartesian bicategories and a specialisation
of Lawvere's hyperdoctrines, namely elementary existential doctrines. Both
provide different ways of abstracting the structural properties of logical
systems: the former in algebraic terms based on a string diagrammatic calculus,
the latter in universal terms using the fundamental notion of adjoint functor.
We prove that these two approaches are related by an adjunction, which can be
strengthened to an equivalence by imposing further constraints on doctrines.
","[{'version': 'v1', 'created': 'Tue, 15 Jun 2021 13:46:33 GMT'}]",2021-11-09,"[['Bonchi', 'Filippo', ''], ['Santamaria', 'Alessio', ''], ['Seeber', 'Jens', ''], ['Sobociński', 'Paweł', '']]","['Cartesian bicategories', 'elementary existential doctrines', 'string diagram']"
5738,1811.06363,Thierry Garaix,"C. Rodriguez, Thierry Garaix (LIMOS, CIS-ENSMSE), X. Xie, V. Augusto",Staff dimensioning in homecare services with uncertain demands,,"International Journal of Production Research, Taylor & Francis,
  2015, 53 (24), pp.7396 - 7410",10.1080/00207543.2015.1081427,,cs.CY cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem addressed in this paper is how to calculate the amount of
personnel required to ensure the activity of a home health care (HHC) center on
a tactical horizon. Design of quantitative approaches for this question is
challenging. The number of caregivers has to be determined for each profession
in order to balance the coverage of patients in a region and the workforce cost
over several months. Unknown demand in care and spatial dimensions, combination
of skills to cover a care and individual trips visiting patients make the
underlaying optimization problem very hard. Few studies are dedicated to staff
dimensioning for HHC compared to patient to nurses assignment/sequencing and
centers location problems. We propose an original two-stage approach based on
integer linear stochastic programming, that exploits historical medical data.
The first stage calculates (near-)optimal levels of resources for possible
demand scenarios , while the second stage computes the optimal number of
caregiver for each profession to meet a target coverage indicator. For
decision-makers, our algorithm gives the number of employees for each category
required to satisfy the demand without any recourse (overtime, external
resources) with fixed probability and confidence interval. The approach has
been tested on various instances built from data of the French agency of
hospitalization data (ATIH).
","[{'version': 'v1', 'created': 'Mon, 29 Oct 2018 15:32:56 GMT'}]",2018-11-16,"[['Rodriguez', 'C.', '', 'LIMOS, CIS-ENSMSE'], ['Garaix', 'Thierry', '', 'LIMOS, CIS-ENSMSE'], ['Xie', 'X.', ''], ['Augusto', 'V.', '']]","['homecare', 'staff dimensioning', 'stochastic programming', 'stochastic vehicle routing problem']"
5739,2106.03943,Ajay Kshemkalyani,Ajay D. Kshemkalyani and Gokarna Sharma,Near-Optimal Dispersion on Arbitrary Anonymous Graphs,11 pages,OPODIS 2021: 8:1-8:19,10.4230/LIPIcs.OPODIS.2021.8,,cs.DC cs.DS cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given an undirected, anonymous, port-labeled graph of $n$ memory-less nodes,
$m$ edges, and degree $\Delta$, we consider the problem of dispersing $k\leq n$
robots (or tokens) positioned initially arbitrarily on one or more nodes of the
graph to exactly $k$ different nodes of the graph, one on each node. The
objective is to simultaneously minimize time to achieve dispersion and memory
requirement at each robot. If all $k$ robots are positioned initially on a
single node, depth first search (DFS) traversal solves this problem in
$O(\min\{m,k\Delta\})$ time with $\Theta(\log(k+\Delta))$ bits at each robot.
However, if robots are positioned initially on multiple nodes, the best
previously known algorithm solves this problem in $O(\min\{m,k\Delta\}\cdot
\log \ell)$ time storing $\Theta(\log(k+\Delta))$ bits at each robot, where
$\ell\leq k/2$ is the number of multiplicity nodes in the initial
configuration. In this paper, we present a novel multi-source DFS traversal
algorithm solving this problem in $O(\min\{m,k\Delta\})$ time with
$\Theta(\log(k+\Delta))$ bits at each robot, improving the time bound of the
best previously known algorithm by $O(\log \ell)$ and matching asymptotically
the single-source DFS traversal bounds. This is the first algorithm for
dispersion that is optimal in both time and memory in arbitrary anonymous
graphs of constant degree, $\Delta=O(1)$. Furthermore, the result holds in both
synchronous and asynchronous settings.
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2021 20:08:48 GMT'}]",2022-04-05,"[['Kshemkalyani', 'Ajay D.', ''], ['Sharma', 'Gokarna', '']]","['Multi-agent systems', 'Mobile robots', 'Local communication', 'Dispersion', 'Exploration', 'Time and memory complexity']"
5740,2210.13151,Mahmood Khosrowjerdi Dr.,Mahmood Khosrowjerdi,"Good governance and national information transparency: A comparative
  study of 117 countries",18 pages,"2022. Lecture Notes in Computer Science, 13192, pp. 143-160",10.1007/978-3-030-96957-8_14,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Information transparency is a major building block of responsible
governments. We explored factors influencing the information transparency of
117 world nations. After controlling for the effects of confounding variables
of wealth (GDP per capita), corruption rate, population density, human capital,
and telecommunication infrastructure, we found that the good governance indices
(democracy, economy, and management) were strong and stable predictors of
information transparency of world nations.
","[{'version': 'v1', 'created': 'Mon, 24 Oct 2022 12:09:00 GMT'}]",2022-10-25,"[['Khosrowjerdi', 'Mahmood', '']]","['Information Transparency', 'Information Policy', 'Information Quantity', 'Information Quality', 'Access to Information', 'Democracy', 'Culture', 'CrossNational Study']"
5741,2111.08262,Jeroen Zuiddam,"Matthias Christandl, Omar Fawzi, Hoang Ta, Jeroen Zuiddam",Larger Corner-Free Sets from Combinatorial Degenerations,"A short version of this paper will appear in the proceedings of ITCS
  2022. This paper improves results that appeared in arxiv:2104.01130v1","Proceedings of 13th Innovations in Theoretical Computer Science
  Conference (ITCS 2022)",10.4230/LIPIcs.ITCS.2022.48,,cs.CC math.CO,http://creativecommons.org/licenses/by/4.0/,"  There is a large and important collection of Ramsey-type combinatorial
problems, closely related to central problems in complexity theory, that can be
formulated in terms of the asymptotic growth of the size of the maximum
independent sets in powers of a fixed small (directed or undirected)
hypergraph, also called the Shannon capacity. An important instance of this is
the corner problem studied in the context of multiparty communication
complexity in the Number On the Forehead (NOF) model. Versions of this problem
and the NOF connection have seen much interest (and progress) in recent works
of Linial, Pitassi and Shraibman (ITCS 2019) and Linial and Shraibman (CCC
2021).
  We introduce and study a general algebraic method for lower bounding the
Shannon capacity of directed hypergraphs via combinatorial degenerations, a
combinatorial kind of ""approximation"" of subgraphs that originates from the
study of matrix multiplication in algebraic complexity theory (and which play
an important role there) but which we use in a novel way.
  Using the combinatorial degeneration method, we make progress on the corner
problem by explicitly constructing a corner-free subset in $F_2^n \times F_2^n$
of size $\Omega(3.39^n/poly(n))$, which improves the previous lower bound
$\Omega(2.82^n)$ of Linial, Pitassi and Shraibman (ITCS 2019) and which gets us
closer to the best upper bound $4^{n - o(n)}$. Our new construction of
corner-free sets implies an improved NOF protocol for the Eval problem. In the
Eval problem over a group $G$, three players need to determine whether their
inputs $x_1, x_2, x_3 \in G$ sum to zero. We find that the NOF communication
complexity of the Eval problem over $F_2^n$ is at most $0.24n + O(\log n)$,
which improves the previous upper bound $0.5n + O(\log n)$.
","[{'version': 'v1', 'created': 'Tue, 16 Nov 2021 07:08:31 GMT'}]",2022-02-01,"[['Christandl', 'Matthias', ''], ['Fawzi', 'Omar', ''], ['Ta', 'Hoang', ''], ['Zuiddam', 'Jeroen', '']]","['Corner-free sets', 'communication complexity', 'number on the forehead', 'combinatorial degeneration', 'hypergraphs', 'Shannon capacity', 'eval problem']"
5742,2107.13957,Pavlos Fafalios,"Pavlos Fafalios, Konstantina Konsolaki, Lida Charami, Kostas Petrakis,
  Manos Paterakis, Dimitris Angelakis, Yannis Tzitzikas, Chrysoula Bekiari,
  Martin Doerr","Towards Semantic Interoperability in Historical Research: Documenting
  Research Data and Knowledge with Synthesis","This is a preprint of an article accepted for publication at the 20th
  International Semantic Web Conference (ISWC 2021)",,10.1007/978-3-030-88361-4_40,,cs.DL cs.DB,http://creativecommons.org/licenses/by/4.0/,"  A vast area of research in historical science concerns the documentation and
study of artefacts and related evidence. Current practice mostly uses
spreadsheets or simple relational databases to organise the information as rows
with multiple columns of related attributes. This form offers itself for data
analysis and scholarly interpretation, however it also poses problems including
i) the difficulty for collaborative but controlled documentation by a large
number of users, ii) the lack of representation of the details from which the
documented relations are inferred, iii) the difficulty to extend the underlying
data structures as well as to combine and integrate data from multiple and
diverse information sources, and iv) the limitation to reuse the data beyond
the context of a particular research activity. To support historians to cope
with these problems, in this paper we describe the Synthesis documentation
system and its use by a large number of historians in the context of an ongoing
research project in the field of History of Art. The system is Web-based and
collaborative, and makes use of existing standards for information
documentation and publication (CIDOC-CRM, RDF), focusing on semantic
interoperability and the production of data of high value and long-term
validity.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2021 13:37:39 GMT'}]",2022-10-19,"[['Fafalios', 'Pavlos', ''], ['Konsolaki', 'Konstantina', ''], ['Charami', 'Lida', ''], ['Petrakis', 'Kostas', ''], ['Paterakis', 'Manos', ''], ['Angelakis', 'Dimitris', ''], ['Tzitzikas', 'Yannis', ''], ['Bekiari', 'Chrysoula', ''], ['Doerr', 'Martin', '']]","['Historical Research', 'Documentation', 'Digital Humanities', 'Semantic Interoperability']"
5743,1601.01920,Adeyinka K. Akanbi MR,Adeyinka K. Akanbi and Muthoni Masinde,"Towards Semantic Integration of Heterogeneous Sensor Data with
  Indigenous Knowledge for Drought Forecasting","5 pages, 3 figures, In Proceedings of the Doctoral Symposium of the
  16th International Middleware Conference (Middleware Doct Symposium 2015),
  Ivan Beschastnikh and Wouter Joosen (Eds.). ACM, New York, NY, USA",,10.1145/2843966.2843968,,cs.AI cs.NI cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the Internet of Things (IoT) domain, various heterogeneous ubiquitous
devices would be able to connect and communicate with each other seamlessly,
irrespective of the domain. Semantic representation of data through detailed
standardized annotation has shown to improve the integration of the
interconnected heterogeneous devices. However, the semantic representation of
these heterogeneous data sources for environmental monitoring systems is not
yet well supported. To achieve the maximum benefits of IoT for drought
forecasting, a dedicated semantic middleware solution is required. This
research proposes a middleware that semantically represents and integrates
heterogeneous data sources with indigenous knowledge based on a unified
ontology for an accurate IoT-based drought early warning system (DEWS).
","[{'version': 'v1', 'created': 'Fri, 8 Jan 2016 15:57:00 GMT'}]",2016-01-11,"[['Akanbi', 'Adeyinka K.', ''], ['Masinde', 'Muthoni', '']]","['Internet of Things', 'Semantic Middleware', 'Semantic Integration', 'Interoperability', 'Drought Forecasting', 'Ontology']"
5744,1806.06010,Thommen George Karimpanal,Thommen George Karimpanal,A Self-Replication Basis for Designing Complex Agents,"2 pages, 1 figure","Proceedings of the Genetic and Evolutionary Computation Conference
  Companion, Pages 45-46, Kyoto, Japan, July 15 - 19, 2018",10.1145/3205651.3208762,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we describe a self-replication-based mechanism for designing
agents of increasing complexity. We demonstrate the validity of this approach
by solving simple, standard evolutionary computation problems in simulation. In
the context of these simulation results, we describe the fundamental
differences of this approach when compared to traditional approaches. Further,
we highlight the possible advantages of applying this approach to the problem
of designing complex artificial agents, along with the potential drawbacks and
issues to be addressed in the future.
","[{'version': 'v1', 'created': 'Fri, 18 May 2018 03:57:41 GMT'}]",2018-07-20,"[['Karimpanal', 'Thommen George', '']]","['Self-replication', 'Artificial life', 'Agent Complexity']"
5745,1903.05219,Babak Hosseini,"Babak Hosseini, Barbara Hammer",Confident Kernel Sparse Coding and Dictionary Learning,"10 pages, ICDM 2018 conference",,10.1109/ICDM.2018.00130,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, kernel-based sparse coding (K-SRC) has received particular
attention due to its efficient representation of nonlinear data structures in
the feature space. Nevertheless, the existing K-SRC methods suffer from the
lack of consistency between their training and test optimization frameworks. In
this work, we propose a novel confident K-SRC and dictionary learning algorithm
(CKSC) which focuses on the discriminative reconstruction of the data based on
its representation in the kernel space. CKSC focuses on reconstructing each
data sample via weighted contributions which are confident in its corresponding
class of data. We employ novel discriminative terms to apply this scheme to
both training and test frameworks in our algorithm. This specific design
increases the consistency of these optimization frameworks and improves the
discriminative performance in the recall phase. In addition, CKSC directly
employs the supervised information in its dictionary learning framework to
enhance the discriminative structure of the dictionary. For empirical
evaluations, we implement our CKSC algorithm on multivariate time-series
benchmarks such as DynTex++ and UTKinect. Our claims regarding the superior
performance of the proposed algorithm are justified throughout comparing its
classification results to the state-of-the-art K-SRC algorithms.
","[{'version': 'v1', 'created': 'Tue, 12 Mar 2019 21:15:51 GMT'}]",2019-03-14,"[['Hosseini', 'Babak', ''], ['Hammer', 'Barbara', '']]","['Discriminative dictionary learning', 'Kernel sparse coding', 'Non-negative reconstruction']"
5746,1904.09530,Kevin Karsch,"Kevin Karsch, John C. Hart",Snaxels on a Plane,,,10.1145/2024676.2024683,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While many algorithms exist for tracing various contours for illustrating a
meshed object, few algorithms organize these contours into region-bounding
closed loops. Tracing closed-loop boundaries on a mesh can be problematic due
to switchbacks caused by subtle surface variation, and the organization of
these regions into a planar map can lead to many small region components due to
imprecision and noise. This paper adapts ""snaxels,"" an energy minimizing active
contour method designed for robust mesh processing, and repurposes it to
generate visual, shadow and shading contours, and a simplified visual-surface
planar map, useful for stylized vector art illustration of the mesh. The snaxel
active contours can also track contours as the mesh animates, and
frame-to-frame correspondences between snaxels lead to a new method to convert
the moving contours on a 3-D animated mesh into 2-D SVG curve animations for
efficient embedding in Flash, PowerPoint and other dynamic vector art
platforms.
","[{'version': 'v1', 'created': 'Sun, 21 Apr 2019 02:36:36 GMT'}]",2019-04-23,"[['Karsch', 'Kevin', ''], ['Hart', 'John C.', '']]","['contour', 'line/vector art', 'planar map', 'SVG']"
5747,2201.06700,Ke Shang,"Ke Shang and Tianye Shu and Hisao Ishibuchi and Yang Nan and Lie Meng
  Pang","Benchmarking Subset Selection from Large Candidate Solution Sets in
  Evolutionary Multi-objective Optimization",,,10.1016/j.ins.2022.11.155,,cs.NE cs.AI,http://creativecommons.org/licenses/by/4.0/,"  In the evolutionary multi-objective optimization (EMO) field, the standard
practice is to present the final population of an EMO algorithm as the output.
However, it has been shown that the final population often includes solutions
which are dominated by other solutions generated and discarded in previous
generations. Recently, a new EMO framework has been proposed to solve this
issue by storing all the non-dominated solutions generated during the evolution
in an archive and selecting a subset of solutions from the archive as the
output. The key component in this framework is the subset selection from the
archive which usually stores a large number of candidate solutions. However,
most studies on subset selection focus on small candidate solution sets for
environmental selection. There is no benchmark test suite for large-scale
subset selection. This paper aims to fill this research gap by proposing a
benchmark test suite for subset selection from large candidate solution sets,
and comparing some representative methods using the proposed test suite. The
proposed test suite together with the benchmarking studies provides a baseline
for researchers to understand, use, compare, and develop subset selection
methods in the EMO field.
","[{'version': 'v1', 'created': 'Tue, 18 Jan 2022 02:09:08 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Mar 2022 22:43:09 GMT'}]",2022-12-12,"[['Shang', 'Ke', ''], ['Shu', 'Tianye', ''], ['Ishibuchi', 'Hisao', ''], ['Nan', 'Yang', ''], ['Pang', 'Lie Meng', '']]","['Subset selection', 'Benchmarking', 'Evolutionary multi-objective']"
5748,1605.02494,Matthew England Dr,Matthew England and James H. Davenport,"The complexity of cylindrical algebraic decomposition with respect to
  polynomial degree",,"V.P. Gerdt, W. Koepf, W.M. Seiler and E.V. Vorozhtsov, eds.
  Computer Algebra in Scientific Computing, pp. 172-192. (Lecture Notes in
  Computer Science, 9890). Springer International, 2016",10.1007/978-3-319-45641-6_12,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cylindrical algebraic decomposition (CAD) is an important tool for working
with polynomial systems, particularly quantifier elimination. However, it has
complexity doubly exponential in the number of variables. The base algorithm
can be improved by adapting to take advantage of any equational constraints
(ECs): equations logically implied by the input. Intuitively, we expect the
double exponent in the complexity to decrease by one for each EC. In ISSAC 2015
the present authors proved this for the factor in the complexity bound
dependent on the number of polynomials in the input. However, the other term,
that dependent on the degree of the input polynomials, remained unchanged.
  In the present paper the authors investigate how CAD in the presence of ECs
could be further refined using the technology of Groebner Bases to move towards
the intuitive bound for polynomial degree.
","[{'version': 'v1', 'created': 'Mon, 9 May 2016 09:46:37 GMT'}]",2016-10-03,"[['England', 'Matthew', ''], ['Davenport', 'James H.', '']]","['computer algebra', 'cylindrical algebraic decomposition', 'equational constraint', 'Gr¨obner bases', 'quantifier elimination']"
5749,2010.01821,Michael Lyons,"Laurent Prevost, Olivier Liechti, Michael J. Lyons",Design and Implementation of a Mobile Exergaming Platform,"8 pages, 3 figures, International Conference on Intelligent
  Technologies for Interactive Entertainment, INTETAIN 2009","Lecture Notes of the Institute for Computer Sciences, Social
  Informatics and Telecommunications Engineering, vol. 9, 2009",10.1007/978-3-642-02315-6_22?,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the design, implementation, and initial testing of a
reusable platform for the creation of pervasive games with geo-localization
services. We concentrate on role-playing games built by combining several types
of simpler mini-games having three major components: Quests; Collectables; and
Non-player characters (NPC). Quests encourage players to be active in their
physical environment and take part in collaborative play; Collectables provide
motivation; and NPCs enable player-friendly interaction with the platform. Each
of these elements poses different technical requirements, which were met by
implementing the gaming platform using the inTrack pervasive middle-ware being
developed by our group. Several sample games were implemented and tested within
the urban environment of Kyoto, Japan, using gaming clients running on mobile
phones from NTT DoCoMo, Japan's largest mobile provider.
","[{'version': 'v1', 'created': 'Mon, 5 Oct 2020 07:16:09 GMT'}]",2020-10-06,"[['Prevost', 'Laurent', ''], ['Liechti', 'Olivier', ''], ['Lyons', 'Michael J.', '']]","['pervasive computing', 'exergaming', 'location-based service']"
5750,2103.09743,Val\'erian Jacques-Dumas,"Val\'erian Jacques-Dumas, Francesco Ragone, Pierre Borgnat, Patrice
  Abry, Freddy Bouchet",Deep Learning-based Extreme Heatwave Forecast,"21 pages, 5 figures",,10.3389/fclim.2022.789641,,cs.LG physics.ao-ph physics.data-an,http://creativecommons.org/licenses/by/4.0/,"  Because of the impact of extreme heat waves and heat domes on society and
biodiversity, their study is a key challenge. We specifically study
long-lasting extreme heat waves, which are among the most important for climate
impacts. Physics driven weather forecast systems or climate models can be used
to forecast their occurrence or predict their probability. The present work
explores the use of deep learning architectures, trained using outputs of a
climate model, as an alternative strategy to forecast the occurrence of extreme
long-lasting heatwaves. This new approach will be useful for several key
scientific goals which include the study of climate model statistics, building
a quantitative proxy for resampling rare events in climate models, study the
impact of climate change, and should eventually be useful for forecasting.
Fulfilling these important goals implies addressing issues such as class-size
imbalance that is intrinsically associated with rare event prediction,
assessing the potential benefits of transfer learning to address the nested
nature of extreme events (naturally included in less extreme ones). We train a
Convolutional Neural Network, using 1000 years of climate model outputs, with
large-class undersampling and transfer learning. From the observed snapshots of
the surface temperature and the 500 hPa geopotential height fields, the trained
network achieves significant performance in forecasting the occurrence of
long-lasting extreme heatwaves. We are able to predict them at three different
levels of intensity, and as early as 15 days ahead of the start of the event
(30 days ahead of the end of the event).
","[{'version': 'v1', 'created': 'Wed, 17 Mar 2021 16:10:06 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Oct 2021 16:08:18 GMT'}, {'version': 'v3', 'created': 'Thu, 13 Jan 2022 15:19:29 GMT'}]",2022-01-14,"[['Jacques-Dumas', 'Valérian', ''], ['Ragone', 'Francesco', ''], ['Borgnat', 'Pierre', ''], ['Abry', 'Patrice', ''], ['Bouchet', 'Freddy', '']]","['Heatwave', 'Extreme event', 'Atmosphere dynamics', 'Deep learning', 'Prediction']"
5751,1812.08947,Chuan Qin,"Chuan Qin, Hengshu Zhu, Tong Xu, Chen Zhu, Liang Jiang, Enhong Chen,
  Hui Xiong","Enhancing Person-Job Fit for Talent Recruitment: An Ability-aware Neural
  Network Approach",This is an extended version of our SIGIR18 paper,,10.1145/3209978.3210025,,cs.AI cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The wide spread use of online recruitment services has led to information
explosion in the job market. As a result, the recruiters have to seek the
intelligent ways for Person Job Fit, which is the bridge for adapting the right
job seekers to the right positions. Existing studies on Person Job Fit have a
focus on measuring the matching degree between the talent qualification and the
job requirements mainly based on the manual inspection of human resource
experts despite of the subjective, incomplete, and inefficient nature of the
human judgement. To this end, in this paper, we propose a novel end to end
Ability aware Person Job Fit Neural Network model, which has a goal of reducing
the dependence on manual labour and can provide better interpretation about the
fitting results. The key idea is to exploit the rich information available at
abundant historical job application data. Specifically, we propose a word level
semantic representation for both job requirements and job seekers' experiences
based on Recurrent Neural Network. Along this line, four hierarchical ability
aware attention strategies are designed to measure the different importance of
job requirements for semantic representation, as well as measuring the
different contribution of each job experience to a specific ability
requirement. Finally, extensive experiments on a large scale real world data
set clearly validate the effectiveness and interpretability of the APJFNN
framework compared with several baselines.
","[{'version': 'v1', 'created': 'Fri, 21 Dec 2018 05:02:02 GMT'}]",2018-12-24,"[['Qin', 'Chuan', ''], ['Zhu', 'Hengshu', ''], ['Xu', 'Tong', ''], ['Zhu', 'Chen', ''], ['Jiang', 'Liang', ''], ['Chen', 'Enhong', ''], ['Xiong', 'Hui', '']]","['Recruitment Analysis', 'Person-Job Fit', 'Neural Network']"
5752,2104.09231,Ryuji Watanabe,"Ryuji Watanabe, Hideaki Ishibashi, Tetsuo Furukawa","Visual analytics of set data for knowledge discovery and member
  selection support","This is accepted manuscript in Decision Support Systems. The codes of
  prototype system are available on
  https://github.com/furukawa-laboratory/demo-visual-analytics-set-data",,10.1016/j.dss.2021.113635,,cs.HC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visual analytics (VA) is a visually assisted exploratory analysis approach in
which knowledge discovery is executed interactively between the user and system
in a human-centered manner. The purpose of this study is to develop a method
for the VA of set data aimed at supporting knowledge discovery and member
selection. A typical target application is a visual support system for team
analysis and member selection, by which users can analyze past teams and
examine candidate lineups for new teams. Because there are several
difficulties, such as the combinatorial explosion problem, developing a VA
system of set data is challenging. In this study, we first define the
requirements that the target system should satisfy and clarify the accompanying
challenges. Then we propose a method for the VA of set data, which satisfies
the requirements. The key idea is to model the generation process of sets and
their outputs using a manifold network model. The proposed method visualizes
the relevant factors as a set of topographic maps on which various information
is visualized. Furthermore, using the topographic maps as a bidirectional
interface, users can indicate their targets of interest in the system on these
maps. We demonstrate the proposed method by applying it to basketball teams,
and compare with a benchmark system for outcome prediction and lineup
reconstruction tasks. Because the method can be adapted to individual
application cases by extending the network structure, it can be a general
method by which practical systems can be built.
","[{'version': 'v1', 'created': 'Sun, 4 Apr 2021 08:22:01 GMT'}, {'version': 'v2', 'created': 'Sat, 24 Jul 2021 06:44:39 GMT'}]",2021-07-27,"[['Watanabe', 'Ryuji', ''], ['Ishibashi', 'Hideaki', ''], ['Furukawa', 'Tetsuo', '']]","['Visual analytics', 'Set data', 'Manifold modeling', 'Team formationsupport', 'Interactive visualization']"
5753,2103.07117,Aurora Saibene,"Aurora Saibene (1 and 2) and Francesca Gasparini (1 and 2) ((1)
  University of Milano-Bicocca, Department of Informatics, Systems and
  Communications, Multi Media Signal Processing Laboratory, (2) University of
  Milano-Bicocca, NeuroMI)",Genetic algorithm for feature selection of EEG heterogeneous data,"accepted by Expert Systems with Applications (see
  https://www.sciencedirect.com/science/article/abs/pii/S0957417422025076)",,10.1016/j.eswa.2022.119488,,cs.NE cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The electroencephalographic (EEG) signals provide highly informative data on
brain activities and functions. However, their heterogeneity and high
dimensionality may represent an obstacle for their interpretation. The
introduction of a priori knowledge seems the best option to mitigate high
dimensionality problems, but could lose some information and patterns present
in the data, while data heterogeneity remains an open issue that often makes
generalization difficult. In this study, we propose a genetic algorithm (GA)
for feature selection that can be used with a supervised or unsupervised
approach. Our proposal considers three different fitness functions without
relying on expert knowledge. Starting from two publicly available datasets on
cognitive workload and motor movement/imagery, the EEG signals are processed,
normalized and their features computed in the time, frequency and
time-frequency domains. The feature vector selection is performed by applying
our GA proposal and compared with two benchmarking techniques. The results show
that different combinations of our proposal achieve better results in respect
to the benchmark in terms of overall performance and feature reduction.
Moreover, the proposed GA, based on a novel fitness function here presented,
outperforms the benchmark when the two different datasets considered are merged
together, showing the effectiveness of our proposal on heterogeneous data.
","[{'version': 'v1', 'created': 'Fri, 12 Mar 2021 07:27:42 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Jan 2023 13:15:00 GMT'}]",2023-01-18,"[['Saibene', 'Aurora', '', '1 and 2'], ['Gasparini', 'Francesca', '', '1 and 2']]","['Electroencephalography', 'Evolutionary feature selection', 'Genetic']"
5754,2202.11698,Dong Cheng,"Dong Cheng, Xiaoxiao Hu, Kit Ian Kou",Signal reconstruction from noisy multichannel samples,"31 pages, 6 figures","Digital Signal Processing, Volume 129, September 2022, 103673",10.1016/j.dsp.2022.103673,,cs.IT math.CA math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the signal reconstruction problem under the case of the signals
sampled in the multichannel way and with the presence of noise. Observing that
if the samples are inexact, the rigorous enforcement of multichannel
interpolation is inappropriate. Thus the reasonable smoothing and regularized
corrections are indispensable. In this paper, we propose several alternative
methods for the signal reconstruction from the noisy multichannel samples under
different smoothing and regularization principles. We compare these signal
reconstruction methods theoretically and experimentally in the various
situations. To demonstrate the effectiveness of the proposed methods, the
probability interpretation and the error analysis for these methods are
provided. Additionally, the numerical simulations as well as some guidelines to
use the methods are also presented.
","[{'version': 'v1', 'created': 'Fri, 11 Feb 2022 08:28:41 GMT'}]",2022-09-20,"[['Cheng', 'Dong', ''], ['Hu', 'Xiaoxiao', ''], ['Kou', 'Kit Ian', '']]","['Signal reconstruction', 'multichannel samples', 'denoising', 'error analysis', 'smoothing', 'regularization']"
5755,2206.14669,Binbin Xu,"Jialiang Wei, Anne-Lise Courbis, Thomas Lambolais, Binbin Xu, Pierre
  Louis Bernard, G\'erard Dray","Towards a Data-Driven Requirements Engineering Approach: Automatic
  Analysis of User Reviews","7th National Conference on Practical Applications of Artificial
  Intelligence, 2022. Saint-\'Etienne, France. article in English and French, 4
  pages each",,10.5281/zenodo.7261877,,cs.CL cs.SE,http://creativecommons.org/licenses/by/4.0/,"  We are concerned by Data Driven Requirements Engineering, and in particular
the consideration of user's reviews. These online reviews are a rich source of
information for extracting new needs and improvement requests. In this work, we
provide an automated analysis using CamemBERT, which is a state-of-the-art
language model in French. We created a multi-label classification dataset of
6000 user reviews from three applications in the Health & Fitness field. The
results are encouraging and suggest that it's possible to identify
automatically the reviews concerning requests for new features.
  Dataset is available at:
https://github.com/Jl-wei/APIA2022-French-user-reviews-classification-dataset.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2022 14:14:54 GMT'}]",2022-11-01,"[['Wei', 'Jialiang', ''], ['Courbis', 'Anne-Lise', ''], ['Lambolais', 'Thomas', ''], ['Xu', 'Binbin', ''], ['Bernard', 'Pierre Louis', ''], ['Dray', 'Gérard', '']]","['Requirements Engineering', 'Data Driven RequirementsEngineering', 'Deep Learning', 'NLP', 'CamemBERT']"
5756,2109.13596,Astrid Merckling,"Astrid Merckling, Nicolas Perrin-Gilbert, Alex Coninx, St\'ephane
  Doncieux",Exploratory State Representation Learning,,"Frontiers in Robotics and AI, 14 February 2022",10.3389/frobt.2022.762051,,cs.LG cs.RO,http://creativecommons.org/licenses/by-sa/4.0/,"  Not having access to compact and meaningful representations is known to
significantly increase the complexity of reinforcement learning (RL). For this
reason, it can be useful to perform state representation learning (SRL) before
tackling RL tasks. However, obtaining a good state representation can only be
done if a large diversity of transitions is observed, which can require a
difficult exploration, especially if the environment is initially reward-free.
To solve the problems of exploration and SRL in parallel, we propose a new
approach called XSRL (eXploratory State Representation Learning). On one hand,
it jointly learns compact state representations and a state transition
estimator which is used to remove unexploitable information from the
representations. On the other hand, it continuously trains an inverse model,
and adds to the prediction error of this model a $k$-step learning progress
bonus to form the maximization objective of a discovery policy. This results in
a policy that seeks complex transitions from which the trained models can
effectively learn. Our experimental results show that the approach leads to
efficient exploration in challenging environments with image observations, and
to state representations that significantly accelerate learning in RL tasks.
","[{'version': 'v1', 'created': 'Tue, 28 Sep 2021 10:11:07 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Feb 2022 10:11:51 GMT'}]",2022-02-16,"[['Merckling', 'Astrid', ''], ['Perrin-Gilbert', 'Nicolas', ''], ['Coninx', 'Alex', ''], ['Doncieux', 'Stéphane', '']]","['state representation learning', 'pretraining', 'exploration', 'unsupervised learning', 'deep reinforcementlearning']"
5757,1507.00627,Florin-Constantin Mihai,"Florin-Constantin Mihai, Adrian Ursu, Pavel Ichim and Dan-Adrian
  Chelaru","Determining rural areas vulnerable to illegal dumping using GIS
  techniques. Case study: Neamt county, Romania",,"13th International Multidisciplinary Scientific GeoConference on
  ECOLOGY, ECONOMICS, EDUCATION AND LEGISLATION, SGEM 2013 Conference
  Proceedings vol 1 : 275-282",10.5593/SGEM2013/BE5.V1/S20.037,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper aims to mapping the potential vulnerable areas to illegal dumping
of household waste from rural areas in the extra- Carpathian region of Neamt
County. These areas are ordinary in the proximity of built-up areas and buffers
areas of 1 km were delimited for every locality. Based on various map layers in
vector formats (land use, rivers, built-up areas, roads etc) an assessment
method is performed to highlight the potential areas vulnerable to illegal
dumping inside these buffer areas at local scale. The results are correlated to
field observations and current situation of waste management systems. The maps
outline local disparities due to various geographical conditions of county.
This approach is a necessary tool in EIA studies particularly for rural waste
management systems at local and regional scale which are less studied in
current literature than urban areas.
","[{'version': 'v1', 'created': 'Thu, 2 Jul 2015 15:25:12 GMT'}]",2015-07-04,"[['Mihai', 'Florin-Constantin', ''], ['Ursu', 'Adrian', ''], ['Ichim', 'Pavel', ''], ['Chelaru', 'Dan-Adrian', '']]","['illegal dumping', 'GIS', 'disparities', 'waste management', 'rural areas']"
5758,2205.09392,Yannan Zheng,"Yannan Zheng, Weiling Chen, Rongfu Lin, Tiesong Zhao",UIF: An Objective Quality Assessment for Underwater Image Enhancement,This paper was submitted to ACMMM 2021,,10.1109/TIP.2022.3196815,,cs.CV eess.IV,http://creativecommons.org/licenses/by/4.0/,"  Due to complex and volatile lighting environment, underwater imaging can be
readily impaired by light scattering, warping, and noises. To improve the
visual quality, Underwater Image Enhancement (UIE) techniques have been widely
studied. Recent efforts have also been contributed to evaluate and compare the
UIE performances with subjective and objective methods. However, the subjective
evaluation is time-consuming and uneconomic for all images, while existing
objective methods have limited capabilities for the newly-developed UIE
approaches based on deep learning. To fill this gap, we propose an Underwater
Image Fidelity (UIF) metric for objective evaluation of enhanced underwater
images. By exploiting the statistical features of these images, we present to
extract naturalness-related, sharpness-related, and structure-related features.
Among them, the naturalness-related and sharpness-related features evaluate
visual improvement of enhanced images; the structure-related feature indicates
structural similarity between images before and after UIE. Then, we employ
support vector regression to fuse the above three features into a final UIF
metric. In addition, we have also established a large-scale UIE database with
subjective scores, namely Underwater Image Enhancement Database (UIED), which
is utilized as a benchmark to compare all objective metrics. Experimental
results confirm that the proposed UIF outperforms a variety of underwater and
general-purpose image quality metrics.
","[{'version': 'v1', 'created': 'Thu, 19 May 2022 08:43:47 GMT'}]",2022-08-31,"[['Zheng', 'Yannan', ''], ['Chen', 'Weiling', ''], ['Lin', 'Rongfu', ''], ['Zhao', 'Tiesong', '']]","['Image Quality Assessment (IQA)', 'Underwater Image Enhancement(UIE)', 'underwater image processing']"
5759,2202.02623,Chris Neale,"Christoper Neale, Ian Kennedy, Blain Price, Bashar Nuseibeh",The case for Zero Trust Digital Forensics,,2022_301352,10.1016/j.fsidi.2022.301352,,cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  It is imperative for all stakeholders that digital forensics investigations
produce reliable results to ensure the field delivers a positive contribution
to the pursuit of justice across the globe. Some aspects of these
investigations are inevitably contingent on trust, however this is not always
explicitly considered or critically evaluated. Erroneously treating features of
the investigation as trusted can be enormously damaging to the overall
reliability of an investigations findings as well as the confidence that
external stakeholders can have in it. As an example, digital crime scenes can
be manipulated by tampering with the digital artefacts left on devices, yet
recent studies have shown that efforts to detect occurrences of this are rare
and argue that this leaves digital forensics investigations vulnerable to
accusations of inaccuracy. In this paper a new approach to digital forensics is
considered based on the concept of Zero Trust, an increasingly popular design
in network security. Zero Trust describes the practitioner mindset and
principles upon which the reliance on trust in network components is eliminated
in favour of dynamic verification of network interactions. An initial
definition of Zero Trust Digital Forensics will be proposed and then a specific
example considered showing how this strategy can be applied to digital forensic
investigations to mitigate against the specific risk of evidence tampering. A
definition of Zero Trust Digital Forensics is proposed, specifically that it is
a strategy adopted by investigators whereby each aspect of an investigation is
assumed to be unreliable until verified. A new principle will be introduced,
namely the multifaceted verification of digital artefacts that can be used by
practitioners who wish to adopt a Zero Trust Digital Forensics strategy during
their investigations...
","[{'version': 'v1', 'created': 'Sat, 5 Feb 2022 19:54:57 GMT'}]",2022-02-15,"[['Neale', 'Christoper', ''], ['Kennedy', 'Ian', ''], ['Price', 'Blain', ''], ['Nuseibeh', 'Bashar', '']]","['Anti-Forensics', 'Evidence Tampering', 'Reliability', 'Trust', 'Verification', 'Zero Trust']"
5760,1909.08815,Raphael Mosaner,"Raphael Mosaner, David Leopoldseder, Manuel Rigger, Roland Schatz,
  Hanspeter M\""ossenb\""ock","Supporting On-Stack Replacement in Unstructured Languages by Loop
  Reconstruction and Extraction",Accepted at MPLR 2019. This is the author's version of the work,,10.1145/3357390.3361030,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  On-stack replacement (OSR) is a common technique employed by dynamic
compilers to reduce program warm-up time. OSR allows switching from interpreted
to compiled code during the execution of this code. The main targets are long
running loops, which need to be represented explicitly, with dedicated
information about condition and body, to be optimized at run time. Bytecode
interpreters, however, represent control flow implicitly via unstructured jumps
and thus do not exhibit the required high-level loop representation. To enable
OSR also for jump-based - often called unstructured - languages, we propose the
partial reconstruction of loops in order to explicitly represent them in a
bytecode interpreter. Besides an outline of the general idea, we implemented
our approach in Sulong, a bytecode interpreter for LLVM bitcode, which allows
the execution of C/C++. We conducted an evaluation with a set of C benchmarks,
which showed speed-ups in warm-up of up to 9x for certain benchmarks. This
facilitates execution of programs with long-running loops in rarely called
functions, which would yield significant slowdown without OSR. While shown with
a prototype implementation, the overall idea of our approach is generalizable
for all bytecode interpreters.
","[{'version': 'v1', 'created': 'Thu, 19 Sep 2019 06:03:51 GMT'}]",2019-09-20,"[['Mosaner', 'Raphael', ''], ['Leopoldseder', 'David', ''], ['Rigger', 'Manuel', ''], ['Schatz', 'Roland', ''], ['Mössenböck', 'Hanspeter', '']]","['On-stack Replacement', 'Truffle', 'Sulong']"
5761,1810.00674,Vladim\'ir Luke\v{s},"Robert Cimrman, Vladim\'ir Luke\v{s}, Eduard Rohan",Multiscale finite element calculations in Python using SfePy,"This manuscript version is made available under the CC-BY-NC-ND 4.0
  license","Advances in Computational Mathematics, 45(4): 1897-1921 (2019)",10.1007/s10444-019-09666-0,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  SfePy (Simple finite elements in Python) is a software for solving various
kinds of problems described by partial differential equations in one, two or
three spatial dimensions by the finite element method. Its source code is
mostly (85\%) Python and relies on fast vectorized operations provided by the
NumPy package. For a particular problem two interfaces can be used: a
declarative application programming interface (API), where problem
description/definition files (Python modules) are used to define a calculation,
and an imperative API, that can be used for interactive commands, or in scripts
and libraries. After outlining the SfePy package development, the paper
introduces its implementation, structure and general features. The components
for defining a partial differential equation are described using an example of
a simple heat conduction problem. Specifically, the declarative API of SfePy is
presented in the example. To illustrate one of SfePy's main assets, the
framework for implementing complex multiscale models based on the theory of
homogenization, an example of a two-scale piezoelastic model is presented,
showing both the mathematical description of the problem and the corresponding
code.
","[{'version': 'v1', 'created': 'Mon, 1 Oct 2018 12:41:29 GMT'}]",2019-08-20,"[['Cimrman', 'Robert', ''], ['Lukeš', 'Vladimír', ''], ['Rohan', 'Eduard', '']]","['finite element method', 'multiscale simulations', 'piezoelasticity', 'SfePy', 'Python']"
5762,1911.00761,Jun Zhao,Jun Zhao,Relations among different privacy notions,"Published in: IEEE 55th Annual Allerton Conference on Communication,
  Control, and Computing (Allerton), UIUC, Illinois, US, October 2017",,10.1109/ALLERTON.2017.8262821,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a comprehensive view of the relations among several privacy
notions: differential privacy (DP) [1], Bayesian differential privacy (BDP)
[2], semantic privacy (SP) [3], and membership privacy (MP) [4]. The results
are organized into two parts. In part one, we extend the notion of semantic
privacy (SP) to Bayesian semantic privacy (BSP) and show its essential
equivalence with Bayesian differential privacy (BDP) in the quantitative sense.
We prove the relations between BDP, BSP, and SP as follows: $\epsilon$-BDP
$\Longleftarrow$ $\big(\frac{1}{2}-\frac{1}{e^{\epsilon}+1}\big)$-BSP, and
$\epsilon$-BDP $\Longrightarrow$ $(e^{2\epsilon}-1)$-BSP $\Longrightarrow$
$(e^{2\epsilon}-1)$-SP. In addition, we obtain a minor result $\epsilon$-DP
$\Longleftarrow$ $\big(\frac{1}{2}-\frac{1}{e^{\epsilon}+1}\big)$-SP, which
improves the result of Kasiviswanathan and Smith [3] stating $\epsilon$-DP
$\Longleftarrow$ $\epsilon/6$-SP for $\epsilon \leq 1.35$. In part two, we
establish the relations between BDP and MP. First, $\epsilon$-BDP
$\Longrightarrow$ $\epsilon$-MP. Second, for a family of distributions that are
downward scalable in the sense of Li et al. [4], it is shown that
$\epsilon$-BDP $\Longleftarrow$ $\epsilon$-MP.
","[{'version': 'v1', 'created': 'Sat, 2 Nov 2019 18:05:47 GMT'}]",2019-11-05,"[['Zhao', 'Jun', '']]","['Differentialprivacy', 'Bayesiandifferentialprivacy', 'semantic privacy', 'membership privacy']"
5763,2102.13191,Chenhao Xie,"Chenhao Xie, Xie Li, Yang Hu, Huwan Peng, Michael Taylor, Shuaiwen
  Leon Song","Q-VR: System-Level Design for Future Mobile Collaborative Virtual
  Reality",,,10.1145/3445814.3446715,,cs.AR cs.GR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  High Quality Mobile Virtual Reality (VR) is what the incoming graphics
technology era demands: users around the world, regardless of their hardware
and network conditions, can all enjoy the immersive virtual experience.
However, the state-of-the-art software-based mobile VR designs cannot fully
satisfy the realtime performance requirements due to the highly interactive
nature of user's actions and complex environmental constraints during VR
execution. Inspired by the unique human visual system effects and the strong
correlation between VR motion features and realtime hardware-level information,
we propose Q-VR, a novel dynamic collaborative rendering solution via
software-hardware co-design for enabling future low-latency high-quality mobile
VR. At software-level, Q-VR provides flexible high-level tuning interface to
reduce network latency while maintaining user perception. At hardware-level,
Q-VR accommodates a wide spectrum of hardware and network conditions across
users by effectively leveraging the computing capability of the increasingly
powerful VR hardware. Extensive evaluation on real-world games demonstrates
that Q-VR can achieve an average end-to-end performance speedup of 3.4x (up to
6.7x) over the traditional local rendering design in commercial VR devices, and
a 4.1x frame rate improvement over the state-of-the-art static collaborative
rendering.
","[{'version': 'v1', 'created': 'Thu, 25 Feb 2021 21:56:05 GMT'}]",2021-03-01,"[['Xie', 'Chenhao', ''], ['Li', 'Xie', ''], ['Hu', 'Yang', ''], ['Peng', 'Huwan', ''], ['Taylor', 'Michael', ''], ['Song', 'Shuaiwen Leon', '']]","['Virtual Reality', 'Mobile System', 'System-on-Chip', 'Realtime Learning', 'Planet-Scale System Design']"
5764,2007.00842,Martin Skrodzki,"Sunil Kumar Yadav and Martin Skrodzki and Eric Zimmermann and Konrad
  Polthier","Surface Denoising based on Normal Filtering in a Robust Statistics
  Framework","In: Cheng, J., Dinghua, X., Saeki, O., Shirai, T. (eds) Proceedings
  of the Forum (2021)",,10.1007/978-981-16-5576-0_6,,cs.GR cs.CG cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During a surface acquisition process using 3D scanners, noise is inevitable
and an important step in geometry processing is to remove these noise
components from these surfaces (given as points-set or triangulated mesh). The
noise-removal process (denoising) can be performed by filtering the surface
normals first and by adjusting the vertex positions according to filtered
normals afterwards. Therefore, in many available denoising algorithms, the
computation of noise-free normals is a key factor. A variety of filters have
been introduced for noise-removal from normals, with different focus points
like robustness against outliers or large amplitude of noise. Although these
filters are performing well in different aspects, a unified framework is
missing to establish the relation between them and to provide a theoretical
analysis beyond the performance of each method.
  In this paper, we introduce such a framework to establish relations between a
number of widely-used nonlinear filters for face normals in mesh denoising and
vertex normals in point set denoising. We cover robust statistical estimation
with M-smoothers and their application to linear and non-linear normal
filtering. Although these methods originate in different mathematical theories
- which include diffusion-, bilateral-, and directional curvature-based
algorithms - we demonstrate that all of them can be cast into a unified
framework of robust statistics using robust error norms and their corresponding
influence functions. This unification contributes to a better understanding of
the individual methods and their relations with each other. Furthermore, the
presented framework provides a platform for new techniques to combine the
advantages of known filters and to compare them with available methods.
","[{'version': 'v1', 'created': 'Thu, 2 Jul 2020 02:31:24 GMT'}]",2022-05-16,"[['Yadav', 'Sunil Kumar', ''], ['Skrodzki', 'Martin', ''], ['Zimmermann', 'Eric', ''], ['Polthier', 'Konrad', '']]","['computational geometry', 'mesh processing', 'robust statistics']"
5765,2002.01632,Wataru Ohata,Wataru Ohata and Jun Tani,"Investigation of the Sense of Agency in Social Cognition, based on
  frameworks of Predictive Coding and Active Inference: A simulation study on
  multimodal imitative interaction","23 pages, 8 figures",Front. Neurorobot. 2020,10.3389/fnbot.2020.00061,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When agents interact socially with different intentions, conflicts are
difficult to avoid. Although how agents can resolve such problems autonomously
has not been determined, dynamic characteristics of agency may shed light on
underlying mechanisms. The current study focused on the sense of agency (SoA),
a specific aspect of agency referring to congruence between the agent's
intention in acting and the outcome. Employing predictive coding and active
inference as theoretical frameworks of perception and action generation, we
hypothesize that regulation of complexity in the evidence lower bound of an
agent's model should affect the strength of the agent's SoA and should have a
critical impact on social interactions. We built a computational model of
imitative interaction between a robot and a human via visuo-proprioceptive
sensation with a variational Bayes recurrent neural network, and simulated the
model in the form of pseudo-imitative interaction using recorded human body
movement data. A key feature of the model is that each modality's complexity
can be regulated differently with a hyperparameter assigned to each module. We
first searched for an optimal setting that endows the model with appropriate
coordination of multimodal sensation. This revealed that the vision module's
complexity should be more tightly regulated than that of the proprioception
module. Using the optimally trained model, we examined how changing the
tightness of complexity regulation after training affects the strength of the
SoA during interactions. The results showed that with looser regulation, an
agent tends to act more egocentrically, without adapting to the other. In
contrast, with tighter regulation, the agent tends to follow the other by
adjusting its intention. We conclude that the tightness of complexity
regulation crucially affects the strength of the SoA and the dynamics of
interactions between agents.
","[{'version': 'v1', 'created': 'Wed, 5 Feb 2020 04:22:12 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Aug 2020 12:49:09 GMT'}]",2020-10-05,"[['Ohata', 'Wataru', ''], ['Tani', 'Jun', '']]","['sense of agency', 'predictive coding', 'active inference', 'multimodal perception', 'human-robotinteraction', 'recurrent neural network', 'variational Bayes']"
5766,2111.04465,Damiano Perri,"Damiano Perri, Marco Simonetti, Alex Bordini, Simone Cimarelli,
  Osvaldo Gervasi",IoT to monitor people flow in areas of public interest,"International Conference on Computational Science and Its
  Applications, ICCSA 2021","LNCS, volume 12958, 2021",10.1007/978-3-030-87016-4_47,,cs.CY cs.AI,http://creativecommons.org/licenses/by/4.0/,"  The unexpected historical period we are living has abruptly pushed us to
loosen any sort of interaction between individuals, gradually forcing us to
deal with new ways to allow compliance with safety distances; indeed the
present situation has demonstrated more than ever how critical it is to be able
to properly organize our travel plans, put people in safe conditions, and avoid
harmful circumstances. The aim of this research is to set up a system to
monitor the flow of people inside public places and facilities of interest
(museums, theatres, cinemas, etc.) without collecting personal or sensitive
data. Weak monitoring of people flows (i.e. monitoring without personal
identification of the monitored subjects) through Internet of Things tools
might be a viable solution to minimize lineups and overcrowding. Our study,
which began as an experiment in the Umbria region of Italy, aims to be one of
several answers to automated planning of people's flows in order to make our
land more liveable. We intend to show that the Internet of Things gives almost
unlimited tools and possibilities, from developing a basic information process
to implementing a true portal which enables business people to connect with
interested consumers.
","[{'version': 'v1', 'created': 'Wed, 3 Nov 2021 01:53:49 GMT'}]",2021-11-09,"[['Perri', 'Damiano', ''], ['Simonetti', 'Marco', ''], ['Bordini', 'Alex', ''], ['Cimarelli', 'Simone', ''], ['Gervasi', 'Osvaldo', '']]","['IOT', 'Sensors', 'Image Processing', 'Augmented Reality', 'Virtual Reality']"
5767,2011.00227,Kristina Marner,"Kristina Marner, Stefan Wagner, Guenther Ruhe","Stakeholder identification for a structured release planning approach in
  the automotive domain",Submitted to Journal Requirements Engineering,"Requirements Engineering, 2022",10.1007/s00766-021-00369-x,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Context: In regulated domains like automotive, release planning is a complex
process. The agreement between traditional product development processes for
hardware as well as mechanic systems and agile development approaches for
software development is a major challenge. Especially the creation and
synchronization of a release plan is challenging. Objective: The aim of this
work is to present identified stakeholders of a release plan as an appropriate
approach to create transparency in release planning in the automotive domain.
Method: Action research to elaborate relevant stakeholders for release planning
was conducted at Dr. Ing. h. c. F. Porsche AG. Results: We present a detailed
overview of identified stakeholders due to release planning as well as their
required content and added value regarding to two pilot projects. The results
confirm the fact that almost every stakeholder is involved in a release plan in
a certain way. Conclusions: Release planning within a complex project
environment and complicated customer constellations is difficult to manage. We
discuss how the presented stakeholders could meet with the given conditions in
the automotive domain. With this contribution, identified stakeholders of
release planning from hardware and software point of view is introduced. It
helps to reach transparency and to handle the given complexity.
","[{'version': 'v1', 'created': 'Sat, 31 Oct 2020 10:13:28 GMT'}]",2022-04-15,"[['Marner', 'Kristina', ''], ['Wagner', 'Stefan', ''], ['Ruhe', 'Guenther', '']]","['automotive', 'hybrid development process', 'traditional process', 'product development process', 'release planning', 'stakeholder identification']"
5768,2104.10073,Jun-Jie Zhang,"Xiao-Yan Cao, Jun-Jie Zhang",ZMCintegral-v5.1: Support for Multi-function Integrations on GPUs,"5pages, 1figure","Computer Physics Communications Volume 265, August 2021, 107994",10.1016/j.cpc.2021.107994,,cs.DC hep-ph,http://creativecommons.org/publicdomain/zero/1.0/,"  In this new version of ZMCintegral, we have added the functionality of
multi-function integrations, i.e. the ability to integrate more than $10^{3}$
different functions on GPUs. The Python API remains the similar as the previous
versions. For integrands less than 5 dimensions, it usually takes less than 10
minutes to finish the evaluation of $10^{3}$ integrations on one Tesla v100
card. The performance scales linearly with the increasing of the GPUs.
","[{'version': 'v1', 'created': 'Tue, 13 Apr 2021 13:43:28 GMT'}]",2022-09-19,"[['Cao', 'Xiao-Yan', ''], ['Zhang', 'Jun-Jie', '']]","['Monte Carlo integration', 'multi-function integrations', 'Numba', 'Ray']"
5769,2110.03553,Qiyu Wan,"Qiyu Wan, Haojun Xia, Xingyao Zhang, Lening Wang, Shuaiwen Leon Song,
  Xin Fu","Shift-BNN: Highly-Efficient Probabilistic Bayesian Neural Network
  Training via Memory-Friendly Pattern Retrieving",54th IEEE/ACM International Symposium on Microarchitecture,,10.1145/3466752.3480120,,cs.AR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bayesian Neural Networks (BNNs) that possess a property of uncertainty
estimation have been increasingly adopted in a wide range of safety-critical AI
applications which demand reliable and robust decision making, e.g.,
self-driving, rescue robots, medical image diagnosis. The training procedure of
a probabilistic BNN model involves training an ensemble of sampled DNN models,
which induces orders of magnitude larger volume of data movement than training
a single DNN model. In this paper, we reveal that the root cause for BNN
training inefficiency originates from the massive off-chip data transfer by
Gaussian Random Variables (GRVs). To tackle this challenge, we propose a novel
design that eliminates all the off-chip data transfer by GRVs through the
reversed shifting of Linear Feedback Shift Registers (LFSRs) without incurring
any training accuracy loss. To efficiently support our LFSR reversion strategy
at the hardware level, we explore the design space of the current DNN
accelerators and identify the optimal computation mapping scheme to best
accommodate our strategy. By leveraging this finding, we design and prototype
the first highly efficient BNN training accelerator, named Shift-BNN, that is
low-cost and scalable. Extensive evaluation on five representative BNN models
demonstrates that Shift-BNN achieves an average of 4.9x (up to 10.8x) boost in
energy efficiency and 1.6x (up to 2.8x) speedup over the baseline DNN training
accelerator.
","[{'version': 'v1', 'created': 'Thu, 7 Oct 2021 15:20:53 GMT'}]",2021-10-08,"[['Wan', 'Qiyu', ''], ['Xia', 'Haojun', ''], ['Zhang', 'Xingyao', ''], ['Wang', 'Lening', ''], ['Song', 'Shuaiwen Leon', ''], ['Fu', 'Xin', '']]","['Bayesian neural networks accelerator', 'energy efficiency', 'randomnumber generation']"
5770,2111.01689,Michal Ptaszynski Prof.,"Juuso Eronen, Michal Ptaszynski, Fumito Masui, Aleksander
  Smywi\'nski-Pohl, Gniewosz Leliwa, Michal Wroczynski","Improving Classifier Training Efficiency for Automatic Cyberbullying
  Detection with Feature Density","73 pages, 4 figures, 19 tables, Information Processing and
  Management, Vol. 58, Issue 5, September 2021, paper ID: 102616","Information Processing and Management, Vol. 58, Issue 5, September
  2021, paper ID: 102616",10.1016/j.ipm.2021.102616,,cs.CL cs.AI cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We study the effectiveness of Feature Density (FD) using different
linguistically-backed feature preprocessing methods in order to estimate
dataset complexity, which in turn is used to comparatively estimate the
potential performance of machine learning (ML) classifiers prior to any
training. We hypothesise that estimating dataset complexity allows for the
reduction of the number of required experiments iterations. This way we can
optimize the resource-intensive training of ML models which is becoming a
serious issue due to the increases in available dataset sizes and the ever
rising popularity of models based on Deep Neural Networks (DNN). The problem of
constantly increasing needs for more powerful computational resources is also
affecting the environment due to alarmingly-growing amount of CO2 emissions
caused by training of large-scale ML models. The research was conducted on
multiple datasets, including popular datasets, such as Yelp business review
dataset used for training typical sentiment analysis models, as well as more
recent datasets trying to tackle the problem of cyberbullying, which, being a
serious social problem, is also a much more sophisticated problem form the
point of view of linguistic representation. We use cyberbullying datasets
collected for multiple languages, namely English, Japanese and Polish. The
difference in linguistic complexity of datasets allows us to additionally
discuss the efficacy of linguistically-backed word preprocessing.
","[{'version': 'v1', 'created': 'Tue, 2 Nov 2021 15:48:28 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Nov 2021 01:46:27 GMT'}]",2021-11-04,"[['Eronen', 'Juuso', ''], ['Ptaszynski', 'Michal', ''], ['Masui', 'Fumito', ''], ['Smywiński-Pohl', 'Aleksander', ''], ['Leliwa', 'Gniewosz', ''], ['Wroczynski', 'Michal', '']]","['feature density', 'dataset complexity', 'linguistics', 'cyberbullying', 'document']"
5771,2106.00267,Sabah Al-Fedaghi Dr.,Sabah Al-Fedaghi,"Classes in Object-Oriented Modeling (UML): Further Understanding and
  Abstraction","12 pages, 22 figures","IJCSNS International Journal of Computer Science and Network
  Security, Vol. 21, No. 5, pp. 139-150, May, 2021",10.22937/IJCSNS.2021.21.5.21,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Object orientation has become the predominant paradigm for conceptual
modeling (e.g., UML), where the notions of class and object form the primitive
building blocks of thought. Classes act as templates for objects that have
attributes and methods (actions). The modeled systems are not even necessarily
software systems: They can be human and artificial systems of many different
kinds (e.g., teaching and learning systems). The UML class diagram is described
as a central component of model-driven software development. It is the most
common diagram in object-oriented models and used to model the static design
view of a system. Objects both carry data and execute actions. According to
some authorities in modeling, a certain degree of difficulty exists in
understanding the semantics of these notions in UML class diagrams. Some
researchers claim class diagrams have limited use for conceptual analysis and
that they are best used for logical design. Performing conceptual analysis
should not concern the ways facts are grouped into structures. Whether a fact
will end up in the design as an attribute is not a conceptual issue. UML leads
to drilling down into physical design details (e.g., private/public attributes,
encapsulated operations, and navigating direction of an association). This
paper is a venture to further the understanding of object-orientated concepts
as exemplified in UML with the aim of developing a broad comprehension of
conceptual modeling fundamentals. Thinging machine (TM) modeling is a new
modeling language employed in such an undertaking. TM modeling interlaces
structure (components) and actionality where actions infiltrate the attributes
as much as the classes. Although space limitations affect some aspects of the
class diagram, the concluding assessment of this study reveals the class
description is a kind of shorthand for a richer sematic TM construct.
","[{'version': 'v1', 'created': 'Tue, 1 Jun 2021 06:58:48 GMT'}]",2021-06-02,"[['Al-Fedaghi', 'Sabah', '']]","['Conceptual analysis', 'logical design', 'classes', 'static model', 'behavioral model']"
5772,2207.07073,Sidi Yaya Arnaud Yarga,"Sidi Yaya Arnaud Yarga, Jean Rouat, Sean U. N. Wood",Efficient spike encoding algorithms for neuromorphic speech recognition,"Accepted to International Conference on Neuromorphic Systems (ICONS
  2022)",,10.1145/3546790.3546803,,cs.NE cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spiking Neural Networks (SNN) are known to be very effective for neuromorphic
processor implementations, achieving orders of magnitude improvements in energy
efficiency and computational latency over traditional deep learning approaches.
Comparable algorithmic performance was recently made possible as well with the
adaptation of supervised training algorithms to the context of SNN. However,
information including audio, video, and other sensor-derived data are typically
encoded as real-valued signals that are not well-suited to SNN, preventing the
network from leveraging spike timing information. Efficient encoding from
real-valued signals to spikes is therefore critical and significantly impacts
the performance of the overall system. To efficiently encode signals into
spikes, both the preservation of information relevant to the task at hand as
well as the density of the encoded spikes must be considered. In this paper, we
study four spike encoding methods in the context of a speaker independent digit
classification system: Send on Delta, Time to First Spike, Leaky Integrate and
Fire Neuron and Bens Spiker Algorithm. We first show that all encoding methods
yield higher classification accuracy using significantly fewer spikes when
encoding a bio-inspired cochleagram as opposed to a traditional short-time
Fourier transform. We then show that two Send On Delta variants result in
classification results comparable with a state of the art deep convolutional
neural network baseline, while simultaneously reducing the encoded bit rate.
Finally, we show that several encoding methods result in improved performance
over the conventional deep learning baseline in certain cases, further
demonstrating the power of spike encoding algorithms in the encoding of
real-valued signals and that neuromorphic implementation has the potential to
outperform state of the art techniques.
","[{'version': 'v1', 'created': 'Thu, 14 Jul 2022 17:22:07 GMT'}]",2022-07-15,"[['Yarga', 'Sidi Yaya Arnaud', ''], ['Rouat', 'Jean', ''], ['Wood', 'Sean U. N.', '']]","['Spiking Neural Networks', 'Spike Encoding', 'Neuromorphic Computing', 'Speech Processing', 'Speech Recognition']"
5773,2006.16920,Amanda Stathopoulos,"M Said, A Biehl, A Stathopoulos","Interdependence in active mobility adoption: Joint modelling and
  motivational spill-over in walking, cycling and bike-sharing",Transportation Research Board 2019,International Journal of Sustainable Transportation 2021,10.1080/15568318.2021.1885769,,cs.CY econ.EM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Active mobility offers an array of physical, emotional, and social wellbeing
benefits. However, with the proliferation of the sharing economy, new
nonmotorized means of transport are entering the fold, complementing some
existing mobility options while competing with others. The purpose of this
research study is to investigate the adoption of three active travel modes;
namely walking, cycling and bikesharing, in a joint modeling framework. The
analysis is based on an adaptation of the stages of change framework, which
originates from the health behavior sciences. Multivariate ordered probit
modeling drawing on U.S. survey data provides well-needed insights into
individuals preparedness to adopt multiple active modes as a function of
personal, neighborhood and psychosocial factors. The research suggests three
important findings. 1) The joint model structure confirms interdependence among
different active mobility choices. The strongest complementarity is found for
walking and cycling adoption. 2) Each mode has a distinctive adoption path with
either three or four separate stages. We discuss the implications of derived
stage-thresholds and plot adoption contours for selected scenarios. 3)
Psychological and neighborhood variables generate more coupling among active
modes than individual and household factors. Specifically, identifying strongly
with active mobility aspirations, experiences with multimodal travel,
possessing better navigational skills, along with supportive local community
norms are the factors that appear to drive the joint adoption decisions. This
study contributes to the understanding of how decisions within the same
functional domain are related and help to design policies that promote active
mobility by identifying positive spillovers and joint determinants.
","[{'version': 'v1', 'created': 'Wed, 24 Jun 2020 17:37:45 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Oct 2020 19:14:12 GMT'}]",2021-12-03,"[['Said', 'M', ''], ['Biehl', 'A', ''], ['Stathopoulos', 'A', '']]","['stages of change', 'shared mobility', 'active mobility', 'joint modeling', 'ordered']"
5774,2007.15356,Gustavo Penha,Gustavo Penha and Claudia Hauff,"What does BERT know about books, movies and music? Probing BERT for
  Conversational Recommendation",Accepted for publication at RecSys'20,,10.1145/3383313.3412249,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Heavily pre-trained transformer models such as BERT have recently shown to be
remarkably powerful at language modelling by achieving impressive results on
numerous downstream tasks. It has also been shown that they are able to
implicitly store factual knowledge in their parameters after pre-training.
Understanding what the pre-training procedure of LMs actually learns is a
crucial step for using and improving them for Conversational Recommender
Systems (CRS). We first study how much off-the-shelf pre-trained BERT ""knows""
about recommendation items such as books, movies and music. In order to analyze
the knowledge stored in BERT's parameters, we use different probes that require
different types of knowledge to solve, namely content-based and
collaborative-based. Content-based knowledge is knowledge that requires the
model to match the titles of items with their content information, such as
textual descriptions and genres. In contrast, collaborative-based knowledge
requires the model to match items with similar ones, according to community
interactions such as ratings. We resort to BERT's Masked Language Modelling
head to probe its knowledge about the genre of items, with cloze style prompts.
In addition, we employ BERT's Next Sentence Prediction head and
representations' similarity to compare relevant and non-relevant search and
recommendation query-document inputs to explore whether BERT can, without any
fine-tuning, rank relevant items first. Finally, we study how BERT performs in
a conversational recommendation downstream task. Overall, our analyses and
experiments show that: (i) BERT has knowledge stored in its parameters about
the content of books, movies and music; (ii) it has more content-based
knowledge than collaborative-based knowledge; and (iii) fails on conversational
recommendation when faced with adversarial data.
","[{'version': 'v1', 'created': 'Thu, 30 Jul 2020 10:08:19 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Mar 2021 15:00:17 GMT'}]",2021-03-05,"[['Penha', 'Gustavo', ''], ['Hauff', 'Claudia', '']]","['conversational recommendation', 'conversational search', 'probing']"
5775,2111.03845,Qinghui Liu,"Qinghui Liu, Michael Kampffmeyer, Robert Jenssen and Arnt-B{\o}rre
  Salberg","Multi-modal land cover mapping of remote sensing images using pyramid
  attention and gated fusion networks","24 pages, 11 figures, submitted to IJRS",,10.1080/01431161.2022.2098078,,cs.CV eess.IV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Multi-modality data is becoming readily available in remote sensing (RS) and
can provide complementary information about the Earth's surface. Effective
fusion of multi-modal information is thus important for various applications in
RS, but also very challenging due to large domain differences, noise, and
redundancies. There is a lack of effective and scalable fusion techniques for
bridging multiple modality encoders and fully exploiting complementary
information. To this end, we propose a new multi-modality network (MultiModNet)
for land cover mapping of multi-modal remote sensing data based on a novel
pyramid attention fusion (PAF) module and a gated fusion unit (GFU). The PAF
module is designed to efficiently obtain rich fine-grained contextual
representations from each modality with a built-in cross-level and cross-view
attention fusion mechanism, and the GFU module utilizes a novel gating
mechanism for early merging of features, thereby diminishing hidden
redundancies and noise. This enables supplementary modalities to effectively
extract the most valuable and complementary information for late feature
fusion. Extensive experiments on two representative RS benchmark datasets
demonstrate the effectiveness, robustness, and superiority of the MultiModNet
for multi-modal land cover classification.
","[{'version': 'v1', 'created': 'Sat, 6 Nov 2021 10:01:01 GMT'}]",2022-07-27,"[['Liu', 'Qinghui', ''], ['Kampffmeyer', 'Michael', ''], ['Jenssen', 'Robert', ''], ['Salberg', 'Arnt-Børre', '']]","['Multiple modalities', 'Pyramid attention', 'Gated fusion', 'Multi-modal segmentation', 'Remote sensing']"
5776,2002.09227,Jacinto Carrasco,"J. Carrasco, S. Garc\'ia, M.M. Rueda, S. Das and F. Herrera","Recent Trends in the Use of Statistical Tests for Comparing Swarm and
  Evolutionary Computing Algorithms: Practical Guidelines and a Critical Review","52 pages, 10 figures, 19 tables","SWEVO, Volume 54, May 2020, 100665",10.1016/j.swevo.2020.100665,,cs.NE stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A key aspect of the design of evolutionary and swarm intelligence algorithms
is studying their performance. Statistical comparisons are also a crucial part
which allows for reliable conclusions to be drawn. In the present paper we
gather and examine the approaches taken from different perspectives to
summarise the assumptions made by these statistical tests, the conclusions
reached and the steps followed to perform them correctly. In this paper, we
conduct a survey on the current trends of the proposals of statistical analyses
for the comparison of algorithms of computational intelligence and include a
description of the statistical background of these tests. We illustrate the use
of the most common tests in the context of the Competition on single-objective
real parameter optimisation of the IEEE Congress on Evolutionary Computation
(CEC) 2017 and describe the main advantages and drawbacks of the use of each
kind of test and put forward some recommendations concerning their use.
","[{'version': 'v1', 'created': 'Fri, 21 Feb 2020 11:06:47 GMT'}]",2020-02-26,"[['Carrasco', 'J.', ''], ['García', 'S.', ''], ['Rueda', 'M. M.', ''], ['Das', 'S.', ''], ['Herrera', 'F.', '']]","['statistical tests', 'optimisation', 'parametric', 'non-parametric', 'Bayesian']"
5777,1803.10202,Jan Stolarek,"Jan Stolarek (The University of Edinburgh, United Kingdom), James
  Cheney (The University of Edinburgh, United Kingdom)",Language-integrated provenance in Haskell,,"The Art, Science, and Engineering of Programming, 2018, Vol. 2,
  Issue 3, Article 11",10.22152/programming-journal.org/2018/2/11,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scientific progress increasingly depends on data management, particularly to
clean and curate data so that it can be systematically analyzed and reused. A
wealth of techniques for managing and curating data (and its provenance) have
been proposed, largely in the database community. In particular, a number of
influential papers have proposed collecting provenance information explaining
where a piece of data was copied from, or what other records were used to
derive it. Most of these techniques, however, exist only as research prototypes
and are not available in mainstream database systems. This means scientists
must either implement such techniques themselves or (all too often) go without.
  This is essentially a code reuse problem: provenance techniques currently
cannot be implemented reusably, only as ad hoc, usually unmaintained extensions
to standard databases. An alternative, relatively unexplored approach is to
support such techniques at a higher abstraction level, using metaprogramming or
reflection techniques. Can advanced programming techniques make it easier to
transfer provenance research results into practice?
  We build on a recent approach called language-integrated provenance, which
extends language-integrated query techniques with source-to-source query
translations that record provenance. In previous work, a proof of concept was
developed in a research programming language called Links, which supports
sophisticated Web and database programming. In this paper, we show how to adapt
this approach to work in Haskell building on top of the Database-Supported
Haskell (DSH) library.
  Even though it seemed clear in principle that Haskell's rich programming
features ought to be sufficient, implementing language-integrated provenance in
Haskell required overcoming a number of technical challenges due to
interactions between these capabilities. Our implementation serves as a proof
of concept showing how this combination of metaprogramming features can, for
the first time, make data provenance facilities available to programmers as a
library in a widely-used, general-purpose language.
  In our work we were successful in implementing forms of provenance known as
where-provenance and lineage. We have tested our implementation using a simple
database and query set and established that the resulting queries are executed
correctly on the database. Our implementation is publicly available on GitHub.
  Our work makes provenance tracking available to users of DSH at little cost.
Although Haskell is not widely used for scientific database development, our
work suggests which languages features are necessary to support provenance as
library. We also highlight how combining Haskell's advanced type programming
features can lead to unexpected complications, which may motivate further
research into type system expressiveness.
","[{'version': 'v1', 'created': 'Tue, 27 Mar 2018 17:38:00 GMT'}]",2018-03-28,"[['Stolarek', 'Jan', '', 'The University of Edinburgh, United Kingdom'], ['Cheney', 'James', '', 'The University of Edinburgh, United Kingdom']]","['language-integrated queries', 'provenance', 'embedded domain-specifc languages', 'Haskell']"
5778,cs/0310034,Sandor P. Fekete,Sandor P. Fekete and Marco Luebbecke and Henk Meijer,"Minimizing the stabbing number of matchings, trees, and triangulations","25 pages, 12 figures, Latex. To appear in ""Discrete and Computational
  Geometry"". Previous version (extended abstract) appears in SODA 2004, pp.
  430-439",,10.1007/s00454-008-9114-6,,cs.CG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The (axis-parallel) stabbing number of a given set of line segments is the
maximum number of segments that can be intersected by any one (axis-parallel)
line. This paper deals with finding perfect matchings, spanning trees, or
triangulations of minimum stabbing number for a given set of points. The
complexity of these problems has been a long-standing open question; in fact,
it is one of the original 30 outstanding open problems in computational
geometry on the list by Demaine, Mitchell, and O'Rourke. The answer we provide
is negative for a number of minimum stabbing problems by showing them NP-hard
by means of a general proof technique. It implies non-trivial lower bounds on
the approximability. On the positive side we propose a cut-based integer
programming formulation for minimizing the stabbing number of matchings and
spanning trees. We obtain lower bounds (in polynomial time) from the
corresponding linear programming relaxations, and show that an optimal
fractional solution always contains an edge of at least constant weight. This
result constitutes a crucial step towards a constant-factor approximation via
an iterated rounding scheme. In computational experiments we demonstrate that
our approach allows for actually solving problems with up to several hundred
points optimally or near-optimally.
","[{'version': 'v1', 'created': 'Thu, 16 Oct 2003 14:01:32 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Sep 2005 12:20:58 GMT'}, {'version': 'v3', 'created': 'Fri, 5 Sep 2008 17:02:14 GMT'}]",2008-09-05,"[['Fekete', 'Sandor P.', ''], ['Luebbecke', 'Marco', ''], ['Meijer', 'Henk', '']]","['Stabbing number', 'matching', 'spanning tree', 'triangulation', 'complexity', 'linear programming relaxation', 'iterated rounding']"
5779,2108.12285,Rob Scharff,"Sander C. van den Berg, Rob B.N. Scharff, Zolt\'an Rus\'ak, and Jun Wu","OpenFish: Biomimetic Design of a Soft Robotic Fish for High Speed
  Locomotion",,"HardwareX, 2022, e00320, ISSN 2468-0672,
  (https://www.sciencedirect.com/science/article/pii/S2468067222000657)",10.1016/j.ohx.2022.e00320,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present OpenFish: an open source soft robotic fish which is optimized for
speed and efficiency. The soft robotic fish uses a combination of an active and
passive tail segment to accurately mimic the thunniform swimming mode. Through
the implementation of a novel propulsion system that is capable of achieving
higher oscillation frequencies with a more sinusoidal waveform, the open source
soft robotic fish achieves a top speed of $0.85~\mathrm{m/s}$. Hereby, it
outperforms the previously reported fastest soft robotic fish by $27\%$.
Besides the propulsion system, the optimization of the fish morphology played a
crucial role in achieving this speed. In this work, a detailed description of
the design, construction and customization of the soft robotic fish is
presented. Hereby, we hope this open source design will accelerate future
research and developments in soft robotic fish.
","[{'version': 'v1', 'created': 'Tue, 20 Jul 2021 08:38:08 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Jun 2022 12:48:12 GMT'}]",2022-06-06,"[['Berg', 'Sander C. van den', ''], ['Scharff', 'Rob B. N.', ''], ['Rusák', 'Zoltán', ''], ['Wu', 'Jun', '']]","['Soft robotic fish', 'Oscillating propulsion', 'Marine robotics', 'Biomimetics']"
5780,2212.09515,Martin Grambow,"Martin Grambow, Denis Kovalev, Christoph Laaber, Philipp Leitner,
  David Bermbach",Using Microbenchmark Suites to Detect Application Performance Changes,Accepted for publication in IEEE Transactions on Cloud Computing,,10.1109/TCC.2022.3217947,,cs.PF cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Software performance changes are costly and often hard to detect pre-release.
Similar to software testing frameworks, either application benchmarks or
microbenchmarks can be integrated into quality assurance pipelines to detect
performance changes before releasing a new application version. Unfortunately,
extensive benchmarking studies usually take several hours which is problematic
when examining dozens of daily code changes in detail; hence, trade-offs have
to be made. Optimized microbenchmark suites, which only include a small subset
of the full suite, are a potential solution for this problem, given that they
still reliably detect the majority of the application performance changes such
as an increased request latency. It is, however, unclear whether
microbenchmarks and application benchmarks detect the same performance problems
and one can be a proxy for the other.
  In this paper, we explore whether microbenchmark suites can detect the same
application performance changes as an application benchmark. For this, we run
extensive benchmark experiments with both the complete and the optimized
microbenchmark suites of the two time-series database systems InuxDB and
VictoriaMetrics and compare their results to the results of corresponding
application benchmarks. We do this for 70 and 110 commits, respectively. Our
results show that it is possible to detect application performance changes
using an optimized microbenchmark suite if frequent false-positive alarms can
be tolerated.
","[{'version': 'v1', 'created': 'Mon, 19 Dec 2022 14:55:39 GMT'}]",2022-12-20,"[['Grambow', 'Martin', ''], ['Kovalev', 'Denis', ''], ['Laaber', 'Christoph', ''], ['Leitner', 'Philipp', ''], ['Bermbach', 'David', '']]","['Benchmarking; Microbenchmarks', 'Performance Testing', 'Performance Change Detection', 'Regression Detection']"
5781,2110.02686,Zhiliang Peng,"Zhiliang Peng, Wei Huang, Zonghao Guo, Xiaosong Zhang, Jianbin Jiao,
  Qixiang Ye",Long-tailed Distribution Adaptation,Accepted in acm mm2021,,10.1145/3474085.3475479,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Recognizing images with long-tailed distributions remains a challenging
problem while there lacks an interpretable mechanism to solve this problem. In
this study, we formulate Long-tailed recognition as Domain Adaption (LDA), by
modeling the long-tailed distribution as an unbalanced domain and the general
distribution as a balanced domain. Within the balanced domain, we propose to
slack the generalization error bound, which is defined upon the empirical risks
of unbalanced and balanced domains and the divergence between them. We propose
to jointly optimize empirical risks of the unbalanced and balanced domains and
approximate their domain divergence by intra-class and inter-class distances,
with the aim to adapt models trained on the long-tailed distribution to general
distributions in an interpretable way. Experiments on benchmark datasets for
image recognition, object detection, and instance segmentation validate that
our LDA approach, beyond its interpretability, achieves state-of-the-art
performance. Code is available at https://github.com/pengzhiliang/LDA.
","[{'version': 'v1', 'created': 'Wed, 6 Oct 2021 12:15:22 GMT'}]",2021-10-07,"[['Peng', 'Zhiliang', ''], ['Huang', 'Wei', ''], ['Guo', 'Zonghao', ''], ['Zhang', 'Xiaosong', ''], ['Jiao', 'Jianbin', ''], ['Ye', 'Qixiang', '']]","['long-tail distribution', 'domain adaptation', 'classification', 'object detection', 'instance segmentation']"
5782,2103.15774,Tianyi Yang,"Tianyi Yang, Cuiyun Gao, Jingya Zang, David Lo, Michael R. Lyu","TOUR: Dynamic Topic and Sentiment Analysis of User Reviews for Assisting
  App Release",,,10.1145/3442442.3458612,,cs.SE cs.CL,http://creativecommons.org/licenses/by/4.0/,"  App reviews deliver user opinions and emerging issues (e.g., new bugs) about
the app releases. Due to the dynamic nature of app reviews, topics and
sentiment of the reviews would change along with app release versions. Although
several studies have focused on summarizing user opinions by analyzing user
sentiment towards app features, no practical tool is released. The large
quantity of reviews and noise words also necessitates an automated tool for
monitoring user reviews. In this paper, we introduce TOUR for dynamic TOpic and
sentiment analysis of User Reviews. TOUR is able to (i) detect and summarize
emerging app issues over app versions, (ii) identify user sentiment towards app
features, and (iii) prioritize important user reviews for facilitating
developers' examination. The core techniques of TOUR include the online topic
modeling approach and sentiment prediction strategy. TOUR provides entries for
developers to customize the hyper-parameters and the results are presented in
an interactive way. We evaluate TOUR by conducting a developer survey that
involves 15 developers, and all of them confirm the practical usefulness of the
recommended feature changes by TOUR.
","[{'version': 'v1', 'created': 'Fri, 26 Mar 2021 08:44:55 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Aug 2021 11:24:00 GMT'}]",2022-04-26,"[['Yang', 'Tianyi', ''], ['Gao', 'Cuiyun', ''], ['Zang', 'Jingya', ''], ['Lo', 'David', ''], ['Lyu', 'Michael R.', '']]","['App review', 'review topic', 'sentiment analysis']"
5783,1906.06717,Marko Vasic,"Marko Vasic, Andrija Petrovic, Kaiyuan Wang, Mladen Nikolic, Rishabh
  Singh, Sarfraz Khurshid","Mo\""ET: Mixture of Expert Trees and its Application to Verifiable
  Reinforcement Learning",,"Neural Networks, Volume 151, 2022, Pages 34-47",10.1016/j.neunet.2022.03.022,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rapid advancements in deep learning have led to many recent breakthroughs.
While deep learning models achieve superior performance, often statistically
better than humans, their adoption into safety-critical settings, such as
healthcare or self-driving cars is hindered by their inability to provide
safety guarantees or to expose the inner workings of the model in a human
understandable form. We present Mo\""ET, a novel model based on Mixture of
Experts, consisting of decision tree experts and a generalized linear model
gating function. Thanks to such gating function the model is more expressive
than the standard decision tree. To support non-differentiable decision trees
as experts, we formulate a novel training procedure. In addition, we introduce
a hard thresholding version, Mo\""ETH, in which predictions are made solely by a
single expert chosen via the gating function. Thanks to that property, Mo\""ETH
allows each prediction to be easily decomposed into a set of logical rules in a
form which can be easily verified. While Mo\""ET is a general use model, we
illustrate its power in the reinforcement learning setting. By training Mo\""ET
models using an imitation learning procedure on deep RL agents we outperform
the previous state-of-the-art technique based on decision trees while
preserving the verifiability of the models. Moreover, we show that Mo\""ET can
also be used in real-world supervised problems on which it outperforms other
verifiable machine learning models.
","[{'version': 'v1', 'created': 'Sun, 16 Jun 2019 15:28:35 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Sep 2019 02:51:48 GMT'}, {'version': 'v3', 'created': 'Tue, 1 Jun 2021 09:24:03 GMT'}, {'version': 'v4', 'created': 'Wed, 6 Apr 2022 19:22:23 GMT'}]",2022-04-08,"[['Vasic', 'Marko', ''], ['Petrovic', 'Andrija', ''], ['Wang', 'Kaiyuan', ''], ['Nikolic', 'Mladen', ''], ['Singh', 'Rishabh', ''], ['Khurshid', 'Sarfraz', '']]","['Verification', 'Deep Learning', 'Reinforcement Learning', 'Mixtureof Experts', 'Explainability']"
5784,2201.03941,Gihan Weeraprameshwara,"Gihan Weeraprameshwara, Vihanga Jayawickrama, Nisansa de Silva,
  Yudhanjaya Wijeratne","Sentiment Analysis with Deep Learning Models: A Comparative Study on a
  Decade of Sinhala Language Facebook Data","8 pages, LaTeX; typos corrected",,10.1145/3512826.3512829,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The relationship between Facebook posts and the corresponding reaction
feature is an interesting subject to explore and understand. To achieve this
end, we test state-of-the-art Sinhala sentiment analysis models against a data
set containing a decade worth of Sinhala posts with millions of reactions. For
the purpose of establishing benchmarks and with the goal of identifying the
best model for Sinhala sentiment analysis, we also test, on the same data set
configuration, other deep learning models catered for sentiment analysis. In
this study we report that the 3 layer Bidirectional LSTM model achieves an F1
score of 84.58% for Sinhala sentiment analysis, surpassing the current
state-of-the-art model; Capsule B, which only manages to get an F1 score of
82.04%. Further, since all the deep learning models show F1 scores above 75% we
conclude that it is safe to claim that Facebook reactions are suitable to
predict the sentiment of a text.
","[{'version': 'v1', 'created': 'Tue, 11 Jan 2022 13:31:15 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Jan 2022 02:42:07 GMT'}]",2022-08-04,"[['Weeraprameshwara', 'Gihan', ''], ['Jayawickrama', 'Vihanga', ''], ['de Silva', 'Nisansa', ''], ['Wijeratne', 'Yudhanjaya', '']]","['NLP', 'Sentiment Analysis', 'Sinhala', 'Deep Learning']"
5785,2208.14614,A S M Ahsan-Ul Haque,"A S M Ahsan-Ul Haque, Hongning Wang","Rethinking Conversational Recommendations: Is Decision Tree All You
  Need?","19 pages, 5 figures",,10.1145/3511808.3557433,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Conversational recommender systems (CRS) dynamically obtain the user
preferences via multi-turn questions and answers. The existing CRS solutions
are widely dominated by deep reinforcement learning algorithms. However, deep
reinforcement learning methods are often criticised for lacking
interpretability and requiring a large amount of training data to perform.
  In this paper, we explore a simpler alternative and propose a decision tree
based solution to CRS. The underlying challenge in CRS is that the same item
can be described differently by different users. We show that decision trees
are sufficient to characterize the interactions between users and items, and
solve the key challenges in multi-turn CRS: namely which questions to ask, how
to rank the candidate items, when to recommend, and how to handle negative
feedback on the recommendations. Firstly, the training of decision trees
enables us to find questions which effectively narrow down the search space.
Secondly, by learning embeddings for each item and tree nodes, the candidate
items can be ranked based on their similarity to the conversation context
encoded by the tree nodes. Thirdly, the diversity of items associated with each
tree node allows us to develop an early stopping strategy to decide when to
make recommendations. Fourthly, when the user rejects a recommendation, we
adaptively choose the next decision tree to improve subsequent questions and
recommendations. Extensive experiments on three publicly available benchmark
CRS datasets show that our approach provides significant improvement to the
state of the art CRS methods.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2022 03:28:21 GMT'}]",2022-09-01,"[['Haque', 'A S M Ahsan-Ul', ''], ['Wang', 'Hongning', '']]","['Recommender system', 'conversational recommender system', 'user system interaction']"
5786,2205.05389,Raphael Azriel,"Raphael Azriel, Cecil D. Hahn, Thomas De Cooman, Sabine Van Huffel,
  Eric T. Payne, Kristin L. McBain, Danny Eytan and Joachim A. Behar","Machine Learning to Support Triage of Children at Risk for Epileptic
  Seizures in the Pediatric Intensive Care Unit","8 pages, 9 figures, submitted to Physiological Measurement",,10.1088/1361-6579/ac8ccd,,cs.LG eess.SP,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Objective: Epileptic seizures are relatively common in critically-ill
children admitted to the pediatric intensive care unit (PICU) and thus serve as
an important target for identification and treatment. Most of these seizures
have no discernible clinical manifestation but still have a significant impact
on morbidity and mortality. Children that are deemed at risk for seizures
within the PICU are monitored using continuous-electroencephalogram (cEEG).
cEEG monitoring cost is considerable and as the number of available machines is
always limited, clinicians need to resort to triaging patients according to
perceived risk in order to allocate resources. This research aims to develop a
computer aided tool to improve seizures risk assessment in critically-ill
children, using an ubiquitously recorded signal in the PICU, namely the
electrocardiogram (ECG). Approach: A novel data-driven model was developed at a
patient-level approach, based on features extracted from the first hour of ECG
recording and the clinical data of the patient. Main results: The most
predictive features were the age of the patient, the brain injury as coma
etiology and the QRS area. For patients without any prior clinical data, using
one hour of ECG recording, the classification performance of the random forest
classifier reached an area under the receiver operating characteristic curve
(AUROC) score of 0.84. When combining ECG features with the patients clinical
history, the AUROC reached 0.87. Significance: Taking a real clinical scenario,
we estimated that our clinical decision support triage tool can improve the
positive predictive value by more than 59% over the clinical standard.
","[{'version': 'v1', 'created': 'Wed, 11 May 2022 10:24:58 GMT'}]",2022-10-05,"[['Azriel', 'Raphael', ''], ['Hahn', 'Cecil D.', ''], ['De Cooman', 'Thomas', ''], ['Van Huffel', 'Sabine', ''], ['Payne', 'Eric T.', ''], ['McBain', 'Kristin L.', ''], ['Eytan', 'Danny', ''], ['Behar', 'Joachim A.', '']]","['Epileptic seizures', 'Machine learning', 'Pediatric intensive care unit', 'Subclinical seizures']"
5787,2107.12045,Florian Tambon,"Florian Tambon, Gabriel Laberge, Le An, Amin Nikanjam, Paulina Stevia
  Nouwou Mindom, Yann Pequignot, Foutse Khomh, Giulio Antoniol, Ettore Merlo
  and Fran\c{c}ois Laviolette","How to Certify Machine Learning Based Safety-critical Systems? A
  Systematic Literature Review","60 pages (92 pages with references and complements), submitted to a
  journal (Automated Software Engineering). Changes: Emphasizing difference
  traditional software engineering / ML approach. Adding Related Works, Threats
  to Validity and Complementary Materials. Adding a table listing papers
  reference for each section/subsections","Autom Softw Eng 29, 38 (2022)",10.1007/s10515-022-00337-x,,cs.LG cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Machine Learning (ML) has been at the heart of many innovations over
the past years. However, including it in so-called 'safety-critical' systems
such as automotive or aeronautic has proven to be very challenging, since the
shift in paradigm that ML brings completely changes traditional certification
approaches.
  Objective: This paper aims to elucidate challenges related to the
certification of ML-based safety-critical systems, as well as the solutions
that are proposed in the literature to tackle them, answering the question 'How
to Certify Machine Learning Based Safety-critical Systems?'.
  Method: We conduct a Systematic Literature Review (SLR) of research papers
published between 2015 to 2020, covering topics related to the certification of
ML systems. In total, we identified 217 papers covering topics considered to be
the main pillars of ML certification: Robustness, Uncertainty, Explainability,
Verification, Safe Reinforcement Learning, and Direct Certification. We
analyzed the main trends and problems of each sub-field and provided summaries
of the papers extracted.
  Results: The SLR results highlighted the enthusiasm of the community for this
subject, as well as the lack of diversity in terms of datasets and type of
models. It also emphasized the need to further develop connections between
academia and industries to deepen the domain study. Finally, it also
illustrated the necessity to build connections between the above mention main
pillars that are for now mainly studied separately.
  Conclusion: We highlighted current efforts deployed to enable the
certification of ML based software systems, and discuss some future research
directions.
","[{'version': 'v1', 'created': 'Mon, 26 Jul 2021 09:03:22 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Aug 2021 19:38:21 GMT'}, {'version': 'v3', 'created': 'Wed, 1 Dec 2021 14:18:23 GMT'}]",2022-04-15,"[['Tambon', 'Florian', ''], ['Laberge', 'Gabriel', ''], ['An', 'Le', ''], ['Nikanjam', 'Amin', ''], ['Mindom', 'Paulina Stevia Nouwou', ''], ['Pequignot', 'Yann', ''], ['Khomh', 'Foutse', ''], ['Antoniol', 'Giulio', ''], ['Merlo', 'Ettore', ''], ['Laviolette', 'François', '']]","['Machine Learning', 'Certification', 'Safety-critical', 'SystematicLiterature Review']"
5788,1911.07936,Efe Bozkir,"Efe Bozkir, Ali Burak \""Unal, Mete Akg\""un, Enkelejda Kasneci, Nico
  Pfeifer","Privacy Preserving Gaze Estimation using Synthetic Images via a
  Randomized Encoding Based Framework","In Symposium on Eye Tracking Research and Applications (ETRA '20).
  Authors' copy of the published paper, refer to the doi for the definitive
  version",,10.1145/3379156.3391364,,cs.CV cs.CR cs.HC cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Eye tracking is handled as one of the key technologies for applications that
assess and evaluate human attention, behavior, and biometrics, especially using
gaze, pupillary, and blink behaviors. One of the challenges with regard to the
social acceptance of eye tracking technology is however the preserving of
sensitive and personal information. To tackle this challenge, we employ a
privacy-preserving framework based on randomized encoding to train a Support
Vector Regression model using synthetic eye images privately to estimate the
human gaze. During the computation, none of the parties learn about the data or
the result that any other party has. Furthermore, the party that trains the
model cannot reconstruct pupil, blinks or visual scanpath. The experimental
results show that our privacy-preserving framework is capable of working in
real-time, with the same accuracy as compared to non-private version and could
be extended to other eye tracking related problems.
","[{'version': 'v1', 'created': 'Wed, 6 Nov 2019 12:52:09 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Feb 2020 13:57:04 GMT'}, {'version': 'v3', 'created': 'Mon, 6 Apr 2020 21:09:16 GMT'}, {'version': 'v4', 'created': 'Tue, 13 Jul 2021 13:04:07 GMT'}]",2021-07-14,"[['Bozkir', 'Efe', ''], ['Ünal', 'Ali Burak', ''], ['Akgün', 'Mete', ''], ['Kasneci', 'Enkelejda', ''], ['Pfeifer', 'Nico', '']]","['privacy preserving machine learning', 'gaze estimation', 'randomizedencoding', 'eye tracking', 'human computer interaction']"
5789,1506.08815,Jayati Ghosh Dastidar,"Merina Kundu, Dhriti Sengupta, Jayati Ghosh Dastidar","Tracking Direction of Human Movement - An Efficient Implementation using
  Skeleton",arXiv admin note: text overlap with arXiv:1506.08682,"International Journal of Computer Applications 96(13):27-33, June
  2014",10.5120/16855-6722,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sometimes a simple and fast algorithm is required to detect human presence
and movement with a low error rate in a controlled environment for security
purposes. Here a light weight algorithm has been presented that generates alert
on detection of human presence and its movement towards a certain direction.
The algorithm uses fixed angle CCTV camera images taken over time and relies
upon skeleton transformation of successive images and calculation of difference
in their coordinates.
","[{'version': 'v1', 'created': 'Mon, 29 Jun 2015 15:48:02 GMT'}]",2015-07-01,"[['Kundu', 'Merina', ''], ['Sengupta', 'Dhriti', ''], ['Dastidar', 'Jayati Ghosh', '']]","['Skeleton', 'Fork Points', 'End Points', 'Descriptor', 'Features', 'Centre of Gravity (CG)']"
5790,2111.06318,Wei Zhou,"Wei Zhou, Dong Chen, Jun Yan, Zhaojian Li, Huilin Yin, Wanchen Ge","Multi-agent Reinforcement Learning for Cooperative Lane Changing of
  Connected and Autonomous Vehicles in Mixed Traffic",,,10.1007/s43684-022-00023-5,,cs.LG cs.MA,http://creativecommons.org/licenses/by/4.0/,"  Autonomous driving has attracted significant research interests in the past
two decades as it offers many potential benefits, including releasing drivers
from exhausting driving and mitigating traffic congestion, among others.
Despite promising progress, lane-changing remains a great challenge for
autonomous vehicles (AV), especially in mixed and dynamic traffic scenarios.
Recently, reinforcement learning (RL), a powerful data-driven control method,
has been widely explored for lane-changing decision makings in AVs with
encouraging results demonstrated. However, the majority of those studies are
focused on a single-vehicle setting, and lane-changing in the context of
multiple AVs coexisting with human-driven vehicles (HDVs) have received scarce
attention. In this paper, we formulate the lane-changing decision making of
multiple AVs in a mixed-traffic highway environment as a multi-agent
reinforcement learning (MARL) problem, where each AV makes lane-changing
decisions based on the motions of both neighboring AVs and HDVs. Specifically,
a multi-agent advantage actor-critic network (MA2C) is developed with a novel
local reward design and a parameter sharing scheme. In particular, a
multi-objective reward function is proposed to incorporate fuel efficiency,
driving comfort, and safety of autonomous driving. Comprehensive experimental
results, conducted under three different traffic densities and various levels
of human driver aggressiveness, show that our proposed MARL framework
consistently outperforms several state-of-the-art benchmarks in terms of
efficiency, safety and driver comfort.
","[{'version': 'v1', 'created': 'Thu, 11 Nov 2021 17:17:24 GMT'}]",2022-03-17,"[['Zhou', 'Wei', ''], ['Chen', 'Dong', ''], ['Yan', 'Jun', ''], ['Li', 'Zhaojian', ''], ['Yin', 'Huilin', ''], ['Ge', 'Wanchen', '']]","['Multi-agent deep reinforcement learning', 'lane-changing', 'connected autonomous vehicles', 'mixed traffic']"
5791,1907.02821,Lia Morra,Lia Morra and Fabrizio Lamberti,Benchmarking unsupervised near-duplicate image detection,Accepted for publication in Expert Systems with Applications,"Expert Systems with Applications, online first, 2019",10.1016/j.eswa.2019.05.002,,cs.CV cs.CR cs.LG cs.MM stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Unsupervised near-duplicate detection has many practical applications ranging
from social media analysis and web-scale retrieval, to digital image forensics.
It entails running a threshold-limited query on a set of descriptors extracted
from the images, with the goal of identifying all possible near-duplicates,
while limiting the false positives due to visually similar images. Since the
rate of false alarms grows with the dataset size, a very high specificity is
thus required, up to $1 - 10^{-9}$ for realistic use cases; this important
requirement, however, is often overlooked in literature. In recent years,
descriptors based on deep convolutional neural networks have matched or
surpassed traditional feature extraction methods in content-based image
retrieval tasks. To the best of our knowledge, ours is the first attempt to
establish the performance range of deep learning-based descriptors for
unsupervised near-duplicate detection on a range of datasets, encompassing a
broad spectrum of near-duplicate definitions. We leverage both established and
new benchmarks, such as the Mir-Flick Near-Duplicate (MFND) dataset, in which a
known ground truth is provided for all possible pairs over a general, large
scale image collection. To compare the specificity of different descriptors, we
reduce the problem of unsupervised detection to that of binary classification
of near-duplicate vs. not-near-duplicate images. The latter can be conveniently
characterized using Receiver Operating Curve (ROC). Our findings in general
favor the choice of fine-tuning deep convolutional networks, as opposed to
using off-the-shelf features, but differences at high specificity settings
depend on the dataset and are often small. The best performance was observed on
the MFND benchmark, achieving 96\% sensitivity at a false positive rate of
$1.43 \times 10^{-6}$.
","[{'version': 'v1', 'created': 'Wed, 3 Jul 2019 09:08:47 GMT'}]",2019-10-29,"[['Morra', 'Lia', ''], ['Lamberti', 'Fabrizio', '']]","['Near-duplicate detection', 'convolutional neural networks', 'instance-level retrieval', 'unsupervised detection', 'performance analysis', 'image']"
5792,2203.00920,Denis Kleyko,"Denis Kleyko, Connor Bybee, Christopher J. Kymn, Bruno A. Olshausen,
  Amir Khosrowshahi, Dmitri E. Nikonov, Friedrich T. Sommer, E. Paxon Frady",Integer Factorization with Compositional Distributed Representations,"8 pages, 4 figures",NICE 2022: Neuro-Inspired Computational Elements Conference,10.1145/3517343.3517368,,cs.NE,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we present an approach to integer factorization using
distributed representations formed with Vector Symbolic Architectures. The
approach formulates integer factorization in a manner such that it can be
solved using neural networks and potentially implemented on parallel
neuromorphic hardware. We introduce a method for encoding numbers in
distributed vector spaces and explain how the resonator network can solve the
integer factorization problem. We evaluate the approach on factorization of
semiprimes by measuring the factorization accuracy versus the scale of the
problem. We also demonstrate how the proposed approach generalizes beyond the
factorization of semiprimes; in principle, it can be used for factorization of
any composite number. This work demonstrates how a well-known combinatorial
search problem may be formulated and solved within the framework of Vector
Symbolic Architectures, and it opens the door to solving similarly difficult
problems in other domains.
","[{'version': 'v1', 'created': 'Wed, 2 Mar 2022 08:09:17 GMT'}]",2022-09-02,"[['Kleyko', 'Denis', ''], ['Bybee', 'Connor', ''], ['Kymn', 'Christopher J.', ''], ['Olshausen', 'Bruno A.', ''], ['Khosrowshahi', 'Amir', ''], ['Nikonov', 'Dmitri E.', ''], ['Sommer', 'Friedrich T.', ''], ['Frady', 'E. Paxon', '']]","['Collective-State Computing', 'Hyperdimensional Computing', 'Vector Symbolic Architectures', 'Resonator network', 'Fractional PowerEncoding', 'Integer Factorization']"
5793,2012.00250,Charles Martin,Charles Martin and Chi-Hsia Lai,Strike on Stage: a percussion and media performance,,"Proceedings of the International Conference on New Interfaces for
  Musical Expression (2011) pp. 142-143",10.5281/zenodo.1178103,,cs.SD cs.HC eess.AS,http://creativecommons.org/licenses/by/4.0/,"  This paper describes Strike on Stage, an interface and corresponding
audio-visual performance work developed and performed in 2010 by percussionists
and media artists Chi-Hsia Lai and Charles Martin. The concept of Strike on
Stage is to integrate computer visuals and sound into an improvised percussion
performance. A large projection surface is positioned directly behind the
performers, while a computer vision system tracks their movements. The setup
allows computer visualisation and sonification to be directly responsive and
unified with the performers' gestures.
","[{'version': 'v1', 'created': 'Tue, 1 Dec 2020 04:10:24 GMT'}]",2020-12-02,"[['Martin', 'Charles', ''], ['Lai', 'Chi-Hsia', '']]","['percussion', 'media performance', 'computer vision']"
5794,2003.04799,Franziska Tachtler,"Franziska Tachtler, Toni Michel, Petr Slov\'ak, Geraldine Fitzpatrick","Supporting the Supporters of Unaccompanied Migrant Youth: Designing for
  Social-ecological Resilience","10 pages (excluding references), 1 figure. To appear in the
  Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems
  (CHI'20), April 25--30, 2020, Honolulu, HI, USA","Proceedings of the 2020 CHI Conference on Human Factors in
  Computing Systems (CHI'20)",10.1145/3313831.3376458,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Unaccompanied migrant youth, fleeing to a new country without their parents,
are exposed to mental health risks. Resilience interventions mitigate such
risks, but access can be hindered by systemic and personal barriers. While much
work has recently addressed designing technology to promote mental health, none
has focused on the needs of these populations. This paper presents the results
of interviews with 18 professional/ volunteer support workers and 5
unaccompanied migrant youths, followed by three design workshops. The results
point to the diverse systems that can facilitate youths' resilience
development. The relationship between the youth and volunteers acting as
mentors is particularly important for increasing resilience but comes with
challenges. This suggests the relevance of a social-ecological model of
resilience with a focus on designing technology to support the mentors in order
to help them better support the youth. We conclude by mapping out the design
space for mentor support.
","[{'version': 'v1', 'created': 'Tue, 10 Mar 2020 15:24:07 GMT'}]",2020-03-11,"[['Tachtler', 'Franziska', ''], ['Michel', 'Toni', ''], ['Slovák', 'Petr', ''], ['Fitzpatrick', 'Geraldine', '']]","['Refugees', 'Mental Health Technology', 'Resilience', 'Care']"
5795,2107.13045,Alexander Dallmann,"Alexander Dallmann, Daniel Zoller, Andreas Hotho","A Case Study on Sampling Strategies for Evaluating Neural Sequential
  Item Recommendation Models",,,10.1145/3460231.3475943,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  At the present time, sequential item recommendation models are compared by
calculating metrics on a small item subset (target set) to speed up
computation. The target set contains the relevant item and a set of negative
items that are sampled from the full item set. Two well-known strategies to
sample negative items are uniform random sampling and sampling by popularity to
better approximate the item frequency distribution in the dataset. Most
recently published papers on sequential item recommendation rely on sampling by
popularity to compare the evaluated models. However, recent work has already
shown that an evaluation with uniform random sampling may not be consistent
with the full ranking, that is, the model ranking obtained by evaluating a
metric using the full item set as target set, which raises the question whether
the ranking obtained by sampling by popularity is equal to the full ranking. In
this work, we re-evaluate current state-of-the-art sequential recommender
models from the point of view, whether these sampling strategies have an impact
on the final ranking of the models. We therefore train four recently proposed
sequential recommendation models on five widely known datasets. For each
dataset and model, we employ three evaluation strategies. First, we compute the
full model ranking. Then we evaluate all models on a target set sampled by the
two different sampling strategies, uniform random sampling and sampling by
popularity with the commonly used target set size of 100, compute the model
ranking for each strategy and compare them with each other. Additionally, we
vary the size of the sampled target set. Overall, we find that both sampling
strategies can produce inconsistent rankings compared with the full ranking of
the models. Furthermore, both sampling by popularity and uniform random
sampling do not consistently produce the same ranking ...
","[{'version': 'v1', 'created': 'Tue, 27 Jul 2021 19:06:03 GMT'}]",2021-07-29,"[['Dallmann', 'Alexander', ''], ['Zoller', 'Daniel', ''], ['Hotho', 'Andreas', '']]","['Sequential Item Recommendation', 'Evaluation', 'Metrics', 'SampledMetrics']"
5796,2205.10116,Anish Thite,"Gabriel Wang, Anish Thite, Rodd Talebi, Anthony D'Achille, Alex Mussa,
  and Jason Zutty",Evolving SimGANs to Improve Abnormal Electrocardiogram Classification,"8 pages, presented at The Genetic and Evolutionary Computation
  Conference 2022",,10.1145/3520304.3534048,,cs.NE cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Machine Learning models are used in a wide variety of domains. However,
machine learning methods often require a large amount of data in order to be
successful. This is especially troublesome in domains where collecting
real-world data is difficult and/or expensive. Data simulators do exist for
many of these domains, but they do not sufficiently reflect the real world data
due to factors such as a lack of real-world noise. Recently generative
adversarial networks (GANs) have been modified to refine simulated image data
into data that better fits the real world distribution, using the SimGAN
method. While evolutionary computing has been used for GAN evolution, there are
currently no frameworks that can evolve a SimGAN. In this paper we (1) extend
the SimGAN method to refine one-dimensional data, (2) modify Easy Cartesian
Genetic Programming (ezCGP), an evolutionary computing framework, to create
SimGANs that more accurately refine simulated data, and (3) create new
feature-based quantitative metrics to evaluate refined data. We also use our
framework to augment an electrocardiogram (ECG) dataset, a domain that suffers
from the issues previously mentioned. In particular, while healthy ECGs can be
simulated there are no current simulators of abnormal ECGs. We show that by
using an evolved SimGAN to refine simulated healthy ECG data to mimic
real-world abnormal ECGs, we can improve the accuracy of abnormal ECG
classifiers.
","[{'version': 'v1', 'created': 'Thu, 12 May 2022 17:27:38 GMT'}]",2022-05-23,"[['Wang', 'Gabriel', ''], ['Thite', 'Anish', ''], ['Talebi', 'Rodd', ''], [""D'Achille"", 'Anthony', ''], ['Mussa', 'Alex', ''], ['Zutty', 'Jason', '']]","['datasets', 'neural networks', 'general adversarial networks', 'automatedmachine learning']"
5797,2104.06523,Iyiola E. Olatunji,"Iyiola E. Olatunji, Jens Rauch, Matthias Katzensteiner, Megha Khosla",A Review of Anonymization for Healthcare Data,,Big Data (2022),10.1089/big.2021.0169,,cs.CR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Mining health data can lead to faster medical decisions, improvement in the
quality of treatment, disease prevention, reduced cost, and it drives
innovative solutions within the healthcare sector. However, health data is
highly sensitive and subject to regulations such as the General Data Protection
Regulation (GDPR), which aims to ensure patient's privacy. Anonymization or
removal of patient identifiable information, though the most conventional way,
is the first important step to adhere to the regulations and incorporate
privacy concerns. In this paper, we review the existing anonymization
techniques and their applicability to various types (relational and
graph-based) of health data. Besides, we provide an overview of possible
attacks on anonymized data. We illustrate via a reconstruction attack that
anonymization though necessary, is not sufficient to address patient privacy
and discuss methods for protecting against such attacks. Finally, we discuss
tools that can be used to achieve anonymization.
","[{'version': 'v1', 'created': 'Tue, 13 Apr 2021 21:44:29 GMT'}]",2022-04-28,"[['Olatunji', 'Iyiola E.', ''], ['Rauch', 'Jens', ''], ['Katzensteiner', 'Matthias', ''], ['Khosla', 'Megha', '']]","['Privacy', 'Healthcare data', 'Anonymization', 'Attacks']"
5798,2107.07406,Omar Otoniel Flores-Cortez,"Otoniel Flores-Cortez, Ronny Cortez, Bruno Gonz\'alez","Design and Implementation of an IoT Based LPG and CO Gases Monitoring
  System","David C. Wyld et al. (Eds): BIoT, DKMP, CCSEA, EMSA - 2021 pp. 31-39,
  2021. CS & IT - CSCP 2021",,10.5121/csit.2021.110803,,cs.DC cs.NI,http://creativecommons.org/licenses/by/4.0/,"  Nowadays use of liquefied petroleum gas (LPG) has increased. LPG is an
asphyxiating, volatile and highly flammable gas. In a LPG leak situation,
potential health accidents are increased either by inhalation or by combustion
of the gas. On the other hand, carbon monoxide (CO) is a toxic gas that comes
mainly from combustion in car engines. Breathing CO-polluted air can cause
dizziness, fainting, breathing problems, and sometimes death. To prevent health
accidents, including explosions, in open or closed environments, remote and
real-time monitoring of the concentration levels of CO and LPG gases has become
a necessity. The aim of this work is to demonstrate the use of Internet of
Things (IoT) techniques to design and build a telemetry system to monitor in
real-time the concentration of GLP and CO gases in the surrounding air. To
implement this work, as central hardware there is a microcontroller, CO and PLG
sensors on the electronic station. Besides, Amazon Web Services (AWS) was used
as an IoT platform and data storage in the cloud. The main result was a
telematics system to monitor in real time the concentrations of both GLP and CO
gases, whose data is accessible from any device with internet access through a
website. Field tests have been successful and have shown that the proposed
system is an efficient and low-cost option.
","[{'version': 'v1', 'created': 'Tue, 22 Jun 2021 16:01:55 GMT'}]",2021-07-16,"[['Flores-Cortez', 'Otoniel', ''], ['Cortez', 'Ronny', ''], ['González', 'Bruno', '']]","['Internet of things', 'Microcontroller', 'Remote sensing', 'LPG', 'CO']"
5799,2203.16697,Zheng Guo,"Zheng Guo, David Cao, Davin Tjong, Jean Yang, Cole Schlesinger, Nadia
  Polikarpova",Type-Directed Program Synthesis for RESTful APIs,,,10.1145/3519939.3523450,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rise of software-as-a-service and microservice architectures,
RESTful APIs are now ubiquitous in mobile and web applications. A service can
have tens or hundreds of API methods, making it a challenge for programmers to
find the right combination of methods to solve their task.
  We present APIphany, a component-based synthesizer for programs that compose
calls to RESTful APIs. The main innovation behind APIphany is the use of
precise semantic types, both to specify user intent and to direct the search.
APIphany contributes three novel mechanisms to overcome challenges in adapting
component-based synthesis to the REST domain: (1) a type inference algorithm
for augmenting REST specifications with semantic types; (2) an efficient
synthesis technique for ""wrangling"" semi-structured data, which is commonly
required in working with RESTful APIs; and (3) a new form of simulated
execution to avoid executing APIs calls during synthesis. We evaluate APIphany
on three real-world APIs and 32 tasks extracted from GitHub repositories and
StackOverflow. In our experiments, APIphany found correct solutions to 29
tasks, with 23 of them reported among top ten synthesis results.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2022 22:41:07 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Apr 2022 17:58:05 GMT'}]",2022-04-06,"[['Guo', 'Zheng', ''], ['Cao', 'David', ''], ['Tjong', 'Davin', ''], ['Yang', 'Jean', ''], ['Schlesinger', 'Cole', ''], ['Polikarpova', 'Nadia', '']]","['Program Synthesis', 'RESTful API', 'Type Inference']"
5800,2101.01165,Ilke Demir,Ilke Demir and Umur A. Ciftci,Where Do Deep Fakes Look? Synthetic Face Detection via Gaze Tracking,To appear in the proceedings of ACM ETRA 2021,,10.1145/3448017.3457387,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Following the recent initiatives for the democratization of AI, deep fake
generators have become increasingly popular and accessible, causing dystopian
scenarios towards social erosion of trust. A particular domain, such as
biological signals, attracted attention towards detection methods that are
capable of exploiting authenticity signatures in real videos that are not yet
faked by generative approaches. In this paper, we first propose several
prominent eye and gaze features that deep fakes exhibit differently. Second, we
compile those features into signatures and analyze and compare those of real
and fake videos, formulating geometric, visual, metric, temporal, and spectral
variations. Third, we generalize this formulation to the deep fake detection
problem by a deep neural network, to classify any video in the wild as fake or
real. We evaluate our approach on several deep fake datasets, achieving 92.48%
accuracy on FaceForensics++, 80.0% on Deep Fakes (in the wild), 88.35% on
CelebDF, and 99.27% on DeeperForensics datasets. Our approach outperforms most
deep and biological fake detectors with complex network architectures without
the proposed gaze signatures. We conduct ablation studies involving different
features, architectures, sequence durations, and post-processing artifacts.
","[{'version': 'v1', 'created': 'Mon, 4 Jan 2021 18:54:46 GMT'}, {'version': 'v2', 'created': 'Thu, 20 May 2021 17:59:20 GMT'}]",2021-05-21,"[['Demir', 'Ilke', ''], ['Ciftci', 'Umur A.', '']]","['deep fakes', 'neural networks', 'gaze', 'generative models', 'fake detection']"
5801,2011.03117,Francesca Noardo,"Francesca Noardo, Teng Wu, Ken Arroyo Ohori, Thomas Krijnen, Jantien
  Stoter","IFC models for (semi)automating common planning checks for building
  permits","Author version of the manuscript, published by Automation in
  construction","Automation in construction (ISSN: 0926-5805) 134, 104097, 2022",10.1016/j.autcon.2021.104097,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  To support building permit issuing with automatic digital tools, the reuse of
models produced by designers would make the process quicker and more objective.
However, current studies and pilots often leave a gap with respect to the
models as actually provided by architects, having varying quality and content.
In this study, rather than taking a top down approach, we started from the
available data and made the necessary inferences, which gave the opportunity to
tackle basic and common issues often preventing smooth automatic processing.
Specific characteristics of the IFC models were outlined and a tool was
developed to extract the necessary information from them to check
representative regulations. While the case study is specific in location,
regulations and input models, the type of issues encountered are a generally
applicable example for automated code compliance checking. This represents a
solid base for future works towards the automation of building permits issuing.
","[{'version': 'v1', 'created': 'Tue, 3 Nov 2020 15:29:47 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Apr 2021 11:34:22 GMT'}, {'version': 'v3', 'created': 'Mon, 20 Dec 2021 16:35:25 GMT'}]",2021-12-21,"[['Noardo', 'Francesca', ''], ['Wu', 'Teng', ''], ['Ohori', 'Ken Arroyo', ''], ['Krijnen', 'Thomas', ''], ['Stoter', 'Jantien', '']]","['BIM', 'Building Information Modelling', 'Industry Foundation Classes', 'urban planningcompliance', 'digital building permit', 'data quality']"
5802,2106.05848,Haitao Liu,"Haitao Liu, Changjun Liu, Xiaomo Jiang, Xudong Chen, Shuhua Yang,
  Xiaofang Wang","Deep Probabilistic Time Series Forecasting using Augmented Recurrent
  Input for Dynamic Systems","30 pages, 8 figures, 4 tables, preprint under review",,10.1016/j.ymssp.2022.109212,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  The demand of probabilistic time series forecasting has been recently raised
in various dynamic system scenarios, for example, system identification and
prognostic and health management of machines. To this end, we combine the
advances in both deep generative models and state space model (SSM) to come up
with a novel, data-driven deep probabilistic sequence model. Specifically, we
follow the popular encoder-decoder generative structure to build the recurrent
neural networks (RNN) assisted variational sequence model on an augmented
recurrent input space, which could induce rich stochastic sequence dependency.
Besides, in order to alleviate the inconsistency issue of the posterior between
training and predicting as well as improving the mining of dynamic patterns, we
(i) propose using a lagged hybrid output as input for the posterior at next
time step, which brings training and predicting into alignment; and (ii)
further devise a generalized auto-regressive strategy that encodes all the
historical dependencies for the posterior. Thereafter, we first investigate the
methodological characteristics of the proposed deep probabilistic sequence
model on toy cases, and then comprehensively demonstrate the superiority of our
model against existing deep probabilistic SSM models through extensive
numerical experiments on eight system identification benchmarks from various
dynamic systems. Finally, we apply our sequence model to a real-world
centrifugal compressor forecasting problem, and again verify its outstanding
performance by quantifying the time series predictive distribution.
","[{'version': 'v1', 'created': 'Thu, 3 Jun 2021 23:41:11 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Apr 2022 03:27:28 GMT'}]",2022-05-25,"[['Liu', 'Haitao', ''], ['Liu', 'Changjun', ''], ['Jiang', 'Xiaomo', ''], ['Chen', 'Xudong', ''], ['Yang', 'Shuhua', ''], ['Wang', 'Xiaofang', '']]","['State space model', 'Dynamic system', 'Recurrent neural networks', 'Variational inference', 'Variational autoencoder', 'Compressor']"
5803,2209.06212,Murtuza Shahzad Syed,"Murtuza Shahzad, Hamed Alhoori, Reva Freedman, Shaikh Abdul Rahman",Quantifying the Online Long-Term Interest in Research,Journal of Informetrics,Journal of Informetrics 16.2 (2022): 101288,10.1016/j.joi.2022.101288,,cs.DL cs.AI cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Research articles are being shared in increasing numbers on multiple online
platforms. Although the scholarly impact of these articles has been widely
studied, the online interest determined by how long the research articles are
shared online remains unclear. Being cognizant of how long a research article
is mentioned online could be valuable information to the researchers. In this
paper, we analyzed multiple social media platforms on which users share and/or
discuss scholarly articles. We built three clusters for papers, based on the
number of yearly online mentions having publication dates ranging from the year
1920 to 2016. Using the online social media metrics for each of these three
clusters, we built machine learning models to predict the long-term online
interest in research articles. We addressed the prediction task with two
different approaches: regression and classification. For the regression
approach, the Multi-Layer Perceptron model performed best, and for the
classification approach, the tree-based models performed better than other
models. We found that old articles are most evident in the contexts of
economics and industry (i.e., patents). In contrast, recently published
articles are most evident in research platforms (i.e., Mendeley) followed by
social media platforms (i.e., Twitter).
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2022 16:57:44 GMT'}]",2022-09-15,"[['Shahzad', 'Murtuza', ''], ['Alhoori', 'Hamed', ''], ['Freedman', 'Reva', ''], ['Rahman', 'Shaikh Abdul', '']]","['Long-term research interest', 'online scholarly impact', 'Aging of']"
5804,1411.6757,N. Michael Mayer,Norbert Michael Mayer,Echo State Condition at the Critical Point,,"Entropy 2017, 19(1), 3",10.3390/e19010003,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recurrent networks with transfer functions that fulfill the Lipschitz
continuity with K=1 may be echo state networks if certain limitations on the
recurrent connectivity are applied. It has been shown that it is sufficient if
the largest singular value of the recurrent connectivity is smaller than 1. The
main achievement of this paper is a proof under which conditions the network is
an echo state network even if the largest singular value is one. It turns out
that in this critical case the exact shape of the transfer function plays a
decisive role in determining whether the network still fulfills the echo state
condition. In addition, several examples with one neuron networks are outlined
to illustrate effects of critical connectivity. Moreover, within the manuscript
a mathematical definition for a critical echo state network is suggested.
","[{'version': 'v1', 'created': 'Tue, 25 Nov 2014 08:09:43 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Dec 2014 05:16:24 GMT'}, {'version': 'v3', 'created': 'Thu, 26 Mar 2015 07:32:15 GMT'}, {'version': 'v4', 'created': 'Fri, 17 Jul 2015 10:04:41 GMT'}, {'version': 'v5', 'created': 'Thu, 26 Nov 2015 07:06:20 GMT'}, {'version': 'v6', 'created': 'Mon, 22 Feb 2016 09:21:12 GMT'}, {'version': 'v7', 'created': 'Tue, 29 Mar 2016 10:33:01 GMT'}, {'version': 'v8', 'created': 'Wed, 26 Oct 2016 11:37:34 GMT'}, {'version': 'v9', 'created': 'Mon, 26 Dec 2016 05:06:40 GMT'}]",2016-12-28,"[['Mayer', 'Norbert Michael', '']]","['Reservoir computing', 'uniformly state contracting networks', 'power law']"
5805,2106.03458,Nesara Dissanayake,"Nesara Dissanayake and Mansooreh Zahedi and Asangi Jayatilaka and
  Muhammad Ali Babar","A Grounded Theory of the Role of Coordination in Software Security Patch
  Management","Accepted for publication at the 29th ACM Joint European Software
  Engineering Conference and Symposium on the Foundations of Software
  Engineering (ESEC/FSE '21)",,10.1145/3468264.3468595,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Several disastrous security attacks can be attributed to delays in patching
software vulnerabilities. While researchers and practitioners have paid
significant attention to automate vulnerabilities identification and patch
development activities of software security patch management, there has been
relatively little effort dedicated to gain an in-depth understanding of the
socio-technical aspects, e.g., coordination of interdependent activities of the
patching process and patching decisions, that may cause delays in applying
security patches. We report on a Grounded Theory study of the role of
coordination in security patch management. The reported theory consists of four
inter-related dimensions, i.e., causes, breakdowns, constraints, and
mechanisms. The theory explains the causes that define the need for
coordination among interdependent software and hardware components and multiple
stakeholders' decisions, the constraints that can negatively impact
coordination, the breakdowns in coordination, and the potential corrective
measures. This study provides potentially useful insights for researchers and
practitioners who can carefully consider the needs of and devise suitable
solutions for supporting the coordination of interdependencies involved in
security patch management.
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2021 09:39:00 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Jun 2021 07:58:20 GMT'}]",2021-06-21,"[['Dissanayake', 'Nesara', ''], ['Zahedi', 'Mansooreh', ''], ['Jayatilaka', 'Asangi', ''], ['Babar', 'Muhammad Ali', '']]","['software security patch management', 'grounded theory', 'socio-technicalfactors', 'coordination']"
5806,2210.06792,"Kubilay Ahmet K\""u\c{c}\""uk","Kubilay Ahmet K\""u\c{c}\""uk, Steve Moyle, Andrew Martin, Alexandru
  Mereacre, Nicholas Allott",SoK: How Not to Architect Your Next-Generation TEE Malware?,"Kubilay Ahmet K\""u\c{c}\""uk, Steve Moyle, Andrew Martin, Alexandru
  Mereacre, and Nicholas Allott. 2022. SoK: How Not to Architect Your
  Next-Generation TEE Malware?. In Hardware and Architectural Support for
  Security and Privacy (HASP 22), October 1, 2022, Chicago, IL, USA. ACM, New
  York, NY, USA, 10 pages. https://doi.org/10.1145/3569562.3569568",,10.1145/3569562.3569568,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Besides Intel's SGX technology, there are long-running discussions on how
trusted computing technologies can be used to cloak malware. Past research
showed example methods of malicious activities utilising Flicker, Trusted
Platform Module, and recently integrating with enclaves. We observe two
ambiguous methodologies of malware development being associated with SGX, and
it is crucial to systematise their details. One methodology is to use the core
SGX ecosystem to cloak malware; potentially affecting a large number of
systems. The second methodology is to create a custom enclave not adhering to
base assumptions of SGX, creating a demonstration code of malware behaviour
with these incorrect assumptions; remaining local without any impact. We
examine what malware aims to do in real-world scenarios and state-of-art
techniques in malware evasion. We present multiple limitations of maintaining
the SGX-assisted malware and evading it from anti-malware mechanisms. The
limitations make SGX enclaves a poor choice for achieving a successful malware
campaign. We systematise twelve misconceptions (myths) outlining how an
overfit-malware using SGX weakens malware's existing abilities. We find the
differences by comparing SGX assistance for malware with non-SGX malware (i.e.,
malware in the wild in our paper). We conclude that the use of hardware
enclaves does not increase the preexisting attack surface, enables no new
infection vector, and does not contribute any new methods to the stealthiness
of malware.
","[{'version': 'v1', 'created': 'Thu, 13 Oct 2022 07:11:51 GMT'}, {'version': 'v2', 'created': 'Mon, 31 Oct 2022 23:48:41 GMT'}]",2022-11-02,"[['Küçük', 'Kubilay Ahmet', ''], ['Moyle', 'Steve', ''], ['Martin', 'Andrew', ''], ['Mereacre', 'Alexandru', ''], ['Allott', 'Nicholas', '']]","['Malware in commodity systems', 'Malware in Enclave', 'SoftwareGuard eXtensions (SGX)', 'Trusted Execution Environments (TEE)', 'Evil Light Bulb (ELB) in IoT']"
5807,1412.2877,Dominik Egarter,Dominik Egarter and Wilfried Elmenreich,"Autonomous Load Disaggregation Approach based on Active Power
  Measurements",,,10.1109/PERCOMW.2015.7134051,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the help of smart metering valuable information of the appliance usage
can be retrieved. In detail, non-intrusive load monitoring (NILM), also called
load disaggregation, tries to identify appliances in the power draw of an
household. In this paper an unsupervised load disaggregation approach is
proposed that works without a priori knowledge about appliances. The proposed
algorithm works autonomously in real time. The number of used appliances and
the corresponding appliance models are learned in operation and are
progressively updated. The proposed algorithm is considering each useful and
suitable detected power state. The algorithm tries to detect power states
corresponding to on/off appliances as well as to multi-state appliances based
on active power measurements in 1s resolution. We evaluated the novel
introduced load disaggregation approach on real world data by testing the
possibility to disaggregate energy demand on appliance level.
","[{'version': 'v1', 'created': 'Tue, 9 Dec 2014 07:50:57 GMT'}, {'version': 'v2', 'created': 'Sun, 14 Dec 2014 11:59:05 GMT'}]",2018-07-03,"[['Egarter', 'Dominik', ''], ['Elmenreich', 'Wilfried', '']]","['Non-intrusive load monitoring', 'load disaggregation', 'unsupervised classification and learning', 'factorial hidden Markov models']"
5808,2001.03282,Wiroonsak Santipach,Kaemmatat Jiravanstit and Wiroonsak Santipach,"Energy-Minimizing Bit Allocation For Powerline OFDM With Multiple Delay
  Constraints",,"Physical Communication, vol. 39, 101015, Apr. 2020",10.1016/j.phycom.2020.101015,,cs.IT eess.SP math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a bit-allocation scheme for powerline orthogonal
frequency-division multiplexing (OFDM) that minimizes total transmit energy
subject to total-bit and delay constraints. Multiple delay requirements stem
from different sets of data that a transmitter must time-multiplex and transmit
to a receiver. The proposed bit allocation takes into account the channel
power-to-noise density ratio of subchannels as well as statistic of narrowband
interference and impulsive noise that is pervasive in powerline communication
(PLC) channels. The proposed scheme is optimal with 1 or 2 sets of data, and is
suboptimal with more than 2 sets of data. However, numerical examples show that
the proposed scheme performs close to the optimum. Also, it is less
computationally complex than the optimal scheme especially when minimizing
total energy over large number of data sets. We also compare the proposed
scheme with some existing schemes and find that our scheme requires less total
transmit energy when the number of delay constraints is large.
","[{'version': 'v1', 'created': 'Fri, 10 Jan 2020 02:07:05 GMT'}]",2020-01-20,"[['Jiravanstit', 'Kaemmatat', ''], ['Santipach', 'Wiroonsak', '']]","['Bit allocation', 'energy minimization', 'delay constraints', 'OFDM', 'powerline channels']"
5809,2011.09069,Vivek Kumar Singh Ph.D.,"Mousumi Karmakar, Sumit Kumar Banshal, Vivek Kumar Singh","A large-scale comparison of social media coverage and mentions captured
  by the two altmetric aggregators- Altmetric.com and PlumX",23 pages including 4 figures and 7 tables,Scientometrics 2021,10.1007/s11192-021-03941-y,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  The increased social media attention to scholarly articles has resulted in
efforts to create platforms & services to track and measure the social media
transactions around scholarly articles in different social platforms (such as
Twitter, Blog, Facebook) and academic social networks (such as Mendeley,
Academia and ResearchGate). Altmetric.com and PlumX are two popular aggregators
that track social media activity around scholarly articles from a variety of
social platforms and provide the coverage and transaction data to researchers
for various purposes. However, some previous studies have shown that the social
media data captured by the two aggregators have differences in terms of
coverage and magnitude of mentions. This paper aims to revisit the question by
doing a large-scale analysis of social media mentions of a data sample of
1,785,149 publication records (drawn from multiple disciplines, demographies,
publishers). Results obtained show that PlumX tracks more wide sources and more
articles as compared to Altmetric.com. However, the coverage and average
mentions of the two aggregators vary across different social media platforms,
with Altmetric.com recording higher mentions in Twitter and Blog, and PlumX
recording higher mentions in Facebook and Mendeley, for the same set of
articles. The coverage and average mentions captured by the two aggregators
across different document types, disciplines and publishers is also analyzed.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2020 03:38:56 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Mar 2021 06:28:07 GMT'}]",2021-03-30,"[['Karmakar', 'Mousumi', ''], ['Banshal', 'Sumit Kumar', ''], ['Singh', 'Vivek Kumar', '']]","['Academic Social Networks', 'Altmetrics', 'Altmetric aggregators', 'Altmetric.com', 'PlumX', 'Social Media Platforms']"
5810,1903.04251,Jonas Engels,"Jonas Engels, Bert Claessens, Geert Deconinck","Techno-Economic Analysis and Optimal Control of Battery Storage for
  Frequency Control Services, Applied to the German Market",Submitted to Applied Energy,,10.1016/j.apenergy.2019.03.128,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optimal investment in battery energy storage systems, taking into account
degradation, sizing and control, is crucial for the deployment of battery
storage, of which providing frequency control is one of the major applications.
In this paper, we present a holistic, data-driven framework to determine the
optimal investment, size and controller of a battery storage system providing
frequency control. We optimised the controller towards minimum degradation and
electricity costs over its lifetime, while ensuring the delivery of frequency
control services compliant with regulatory requirements. We adopted a detailed
battery model, considering the dynamics and degradation when exposed to actual
frequency data. Further, we used a stochastic optimisation objective while
constraining the probability on unavailability to deliver the frequency control
service. Through a thorough analysis, we were able to decrease the amount of
data needed and thereby decrease the execution time while keeping the
approximation error within limits. Using the proposed framework, we performed a
techno-economic analysis of a battery providing 1 MW capacity in the German
primary frequency control market. Results showed that a battery rated at 1.6
MW, 1.6 MWh has the highest net present value, yet this configuration is only
profitable if costs are low enough or in case future frequency control prices
do not decline too much. It transpires that calendar ageing drives battery
degradation, whereas cycle ageing has less impact.
","[{'version': 'v1', 'created': 'Mon, 11 Mar 2019 12:39:52 GMT'}]",2019-04-02,"[['Engels', 'Jonas', ''], ['Claessens', 'Bert', ''], ['Deconinck', 'Geert', '']]","['Battery storage', 'Chance constraints', 'Frequency control', 'Monte Carlo analysis', 'Optimalcontrol', 'Techno-economic analysis']"
5811,2001.07534,Mohammad Khodaei,"Nikolaos Alexiou, Marcello Lagan\`a, Stylianos Gisdakis, Mohammad
  Khodaei, and Panagiotis Papadimitratos",VeSPA: Vehicular Security and Privacy-preserving Architecture,"5 pages, 2 figures, HotWiSec'13: Proceedings of the 2nd ACM workshop
  on Hot topics on wireless network security and privacy, April 2013",,10.1145/2463183.2463189,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Standardization and harmonization efforts have reached a consensus towards
using a special-purpose Vehicular Public-Key Infrastructure (VPKI) in upcoming
Vehicular Communication (VC) systems. However, there are still several
technical challenges with no conclusive answers; one such an important yet open
challenge is the acquisition of short-term credentials, pseudonym: how should
each vehicle interact with the VPKI, e.g., how frequently and for how long?
Should each vehicle itself determine the pseudonym lifetime? Answering these
questions is far from trivial. Each choice can affect both the user privacy and
the system performance and possibly, as a result, its security. In this paper,
we make a novel systematic effort to address this multifaceted question. We
craft three generally applicable policies and experimentally evaluate the VPKI
system performance, leveraging two large-scale mobility datasets. We consider
the most promising, in terms of efficiency, pseudonym acquisition policies; we
find that within this class of policies, the most promising policy in terms of
privacy protection can be supported with moderate overhead. Moreover, in all
cases, this work is the first to provide tangible evidence that the
state-of-the-art VPKI can serve sizable areas or domain with modest computing
resources.
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2020 13:45:36 GMT'}]",2020-01-22,"[['Alexiou', 'Nikolaos', ''], ['Laganà', 'Marcello', ''], ['Gisdakis', 'Stylianos', ''], ['Khodaei', 'Mohammad', ''], ['Papadimitratos', 'Panagiotis', '']]","['Vehicular Communications', 'Security', 'Privacy', 'Access Control', 'Identity and Credential Management', 'Vehicular PKI']"
5812,1904.09813,Hao Tong,"Hao Tong, Jialin Liu, Xin Yao","Algorithm Portfolio for Individual-based Surrogate-Assisted Evolutionary
  Algorithms",,,10.1145/3321707.3321715,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Surrogate-assisted evolutionary algorithms (SAEAs) are powerful optimisation
tools for computationally expensive problems (CEPs). However, a randomly
selected algorithm may fail in solving unknown problems due to no free lunch
theorems, and it will cause more computational resource if we re-run the
algorithm or try other algorithms to get a much solution, which is more serious
in CEPs. In this paper, we consider an algorithm portfolio for SAEAs to reduce
the risk of choosing an inappropriate algorithm for CEPs. We propose two
portfolio frameworks for very expensive problems in which the maximal number of
fitness evaluations is only 5 times of the problem's dimension. One framework
named Par-IBSAEA runs all algorithm candidates in parallel and a more
sophisticated framework named UCB-IBSAEA employs the Upper Confidence Bound
(UCB) policy from reinforcement learning to help select the most appropriate
algorithm at each iteration. An effective reward definition is proposed for the
UCB policy. We consider three state-of-the-art individual-based SAEAs on
different problems and compare them to the portfolios built from their
instances on several benchmark problems given limited computation budgets. Our
experimental studies demonstrate that our proposed portfolio frameworks
significantly outperform any single algorithm on the set of benchmark problems.
","[{'version': 'v1', 'created': 'Mon, 22 Apr 2019 12:09:52 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Oct 2019 09:12:25 GMT'}]",2019-10-28,"[['Tong', 'Hao', ''], ['Liu', 'Jialin', ''], ['Yao', 'Xin', '']]","['Algorithm portfolio', 'surrogate model', 'evolutionary algorithm', 'computationally expensive problem']"
5813,2109.03373,Yuqi Xue,"Luyi Kang, Yuqi Xue, Weiwei Jia, Xiaohao Wang, Jongryool Kim,
  Changhwan Youn, Myeong Joon Kang, Hyung Jin Lim, Bruce Jacob, Jian Huang",IceClave: A Trusted Execution Environment for In-Storage Computing,11 pages. Accepted to MICRO'21,,10.1145/3466752.3480109,,cs.AR cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In-storage computing with modern solid-state drives (SSDs) enables developers
to offload programs from the host to the SSD. It has been proven to be an
effective approach to alleviate the I/O bottleneck. To facilitate in-storage
computing, many frameworks have been proposed. However, few of them treat the
in-storage security as the first citizen. Specifically, since modern SSD
controllers do not have a trusted execution environment, an offloaded
(malicious) program could steal, modify, and even destroy the data stored in
the SSD. In this paper, we first investigate the attacks that could be
conducted by offloaded in-storage programs. To defend against these attacks, we
build a lightweight trusted execution environment, named IceClave for
in-storage computing. IceClave enables security isolation between in-storage
programs and flash management functions that include flash address translation,
data access control, and garbage collection, with TrustZone extensions.
IceClave also achieves security isolation between in-storage programs by
enforcing memory integrity verification of in-storage DRAM with low overhead.
To protect data loaded from flash chips, IceClave develops a lightweight data
encryption/decryption mechanism in flash controllers. We develop IceClave with
a full system simulator. We evaluate IceClave with a variety of data-intensive
applications such as databases. Compared to state-of-the-art in-storage
computing approaches, IceClave introduces only 7.6% performance overhead, while
enforcing security isolation in the SSD controller with minimal hardware cost.
IceClave still keeps the performance benefit of in-storage computing by
delivering up to 2.31$\times$ better performance than the conventional
host-based trusted computing approach.
","[{'version': 'v1', 'created': 'Wed, 8 Sep 2021 00:10:11 GMT'}]",2021-09-09,"[['Kang', 'Luyi', ''], ['Xue', 'Yuqi', ''], ['Jia', 'Weiwei', ''], ['Wang', 'Xiaohao', ''], ['Kim', 'Jongryool', ''], ['Youn', 'Changhwan', ''], ['Kang', 'Myeong Joon', ''], ['Lim', 'Hyung Jin', ''], ['Jacob', 'Bruce', ''], ['Huang', 'Jian', '']]","['In-Storage Computing', 'Trusted Execution Environment', 'SecurityIsolation', 'ARM TrustZone']"
5814,2106.15850,Asim Waqas,"Asim Waqas (1), Ghulam Rasool (1), Hamza Farooq (2), and Nidhal C.
  Bouaynaya (1), ((1) Rowan University, (2) University of Minnesota)",Exploring Robust Architectures for Deep Artificial Neural Networks,"27 pages, 16 figures",,10.1038/s44172-022-00043-2,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The architectures of deep artificial neural networks (DANNs) are routinely
studied to improve their predictive performance. However, the relationship
between the architecture of a DANN and its robustness to noise and adversarial
attacks is less explored. We investigate how the robustness of DANNs relates to
their underlying graph architectures or structures. This study: (1) starts by
exploring the design space of architectures of DANNs using graph-theoretic
robustness measures; (2) transforms the graphs to DANN architectures to
train/validate/test on various image classification tasks; (3) explores the
relationship between the robustness of trained DANNs against noise and
adversarial attacks and the robustness of their underlying architectures
estimated via graph-theoretic measures. We show that the topological entropy
and Olivier-Ricci curvature of the underlying graphs can quantify the
robustness performance of DANNs. The said relationship is stronger for complex
tasks and large DANNs. Our work will allow autoML and neural architecture
search community to explore design spaces of robust and accurate DANNs.
","[{'version': 'v1', 'created': 'Wed, 30 Jun 2021 07:12:19 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Apr 2022 22:46:04 GMT'}]",2023-01-24,"[['Waqas', 'Asim', '', 'Rowan University'], ['Rasool', 'Ghulam', '', 'Rowan University'], ['Farooq', 'Hamza', '', 'University of Minnesota'], ['Bouaynaya', 'Nidhal C.', '', 'Rowan University']]","['Deep artificial neural networks', 'Graph theory', 'Curvature', 'Entropy', 'Adversarial robustness']"
5815,2102.13034,Yuan Shen,"Yuan Shen, Niviru Wijayaratne, Peter Du, Shanduojiao Jiang, Katherine
  Driggs Campbell",AutoPreview: A Framework for Autopilot Behavior Understanding,"7 pages, 5 figures, CHI 2021 Late breaking Work","CHI Conference on Human Factors in Computing Systems Extended
  Abstracts (CHI '21 Extended Abstracts), May 8 to 13, 2021, Yokohama, Japan",10.1145/3411763.3451591,,cs.AI cs.HC cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The behavior of self driving cars may differ from people expectations, (e.g.
an autopilot may unexpectedly relinquish control). This expectation mismatch
can cause potential and existing users to distrust self driving technology and
can increase the likelihood of accidents. We propose a simple but effective
framework, AutoPreview, to enable consumers to preview a target autopilot
potential actions in the real world driving context before deployment. For a
given target autopilot, we design a delegate policy that replicates the target
autopilot behavior with explainable action representations, which can then be
queried online for comparison and to build an accurate mental model. To
demonstrate its practicality, we present a prototype of AutoPreview integrated
with the CARLA simulator along with two potential use cases of the framework.
We conduct a pilot study to investigate whether or not AutoPreview provides
deeper understanding about autopilot behavior when experiencing a new autopilot
policy for the first time. Our results suggest that the AutoPreview method
helps users understand autopilot behavior in terms of driving style
comprehension, deployment preference, and exact action timing prediction.
","[{'version': 'v1', 'created': 'Thu, 25 Feb 2021 17:40:59 GMT'}]",2021-02-26,"[['Shen', 'Yuan', ''], ['Wijayaratne', 'Niviru', ''], ['Du', 'Peter', ''], ['Jiang', 'Shanduojiao', ''], ['Campbell', 'Katherine Driggs', '']]","['Autonomous Vehicle', 'Mental Model', 'Human Robot Interaction', 'Imitation Learning', 'Agent Behavior Understanding', 'Preview']"
5816,2205.01763,Shuo Zhang,"Shuo Zhang, Mu-Chun Wang, Krisztian Balog","Analyzing and Simulating User Utterance Reformulation in Conversational
  Recommender Systems","Proceedings of the 45th International ACM SIGIR Conference on
  Research and Development in Information Retrieval",,10.1145/3477495.3531936,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  User simulation has been a cost-effective technique for evaluating
conversational recommender systems. However, building a human-like simulator is
still an open challenge. In this work, we focus on how users reformulate their
utterances when a conversational agent fails to understand them. First, we
perform a user study, involving five conversational agents across different
domains, to identify common reformulation types and their transition
relationships. A common pattern that emerges is that persistent users would
first try to rephrase, then simplify, before giving up. Next, to incorporate
the observed reformulation behavior in a user simulator, we introduce the task
of reformulation sequence generation: to generate a sequence of reformulated
utterances with a given intent (rephrase or simplify). We develop methods by
extending transformer models guided by the reformulation type and perform
further filtering based on estimated reading difficulty. We demonstrate the
effectiveness of our approach using both automatic and human evaluation.
","[{'version': 'v1', 'created': 'Tue, 3 May 2022 20:16:00 GMT'}]",2022-05-05,"[['Zhang', 'Shuo', ''], ['Wang', 'Mu-Chun', ''], ['Balog', 'Krisztian', '']]","['Conversational recommender system', 'utterance reformulation', 'userstudy', 'user simulation']"
5817,2206.10608,Ya-Chuan Hsu,"Ya-Chuan Hsu, Matthew C. Fontaine, Sam Earle, Maria Edwards, Julian
  Togelius, Stefanos Nikolaidis",Generating Diverse Indoor Furniture Arrangements,,,10.1145/3532719.3543244,,cs.LG cs.AI cs.GR cs.RO,http://creativecommons.org/licenses/by/4.0/,"  We present a method for generating arrangements of indoor furniture from
human-designed furniture layout data. Our method creates arrangements that
target specified diversity, such as the total price of all furniture in the
room and the number of pieces placed. To generate realistic furniture
arrangement, we train a generative adversarial network (GAN) on human-designed
layouts. To target specific diversity in the arrangements, we optimize the
latent space of the GAN via a quality diversity algorithm to generate a diverse
arrangement collection. Experiments show our approach discovers a set of
arrangements that are similar to human-designed layouts but varies in price and
number of furniture pieces.
","[{'version': 'v1', 'created': 'Mon, 20 Jun 2022 08:15:50 GMT'}]",2022-06-23,"[['Hsu', 'Ya-Chuan', ''], ['Fontaine', 'Matthew C.', ''], ['Earle', 'Sam', ''], ['Edwards', 'Maria', ''], ['Togelius', 'Julian', ''], ['Nikolaidis', 'Stefanos', '']]","['Furniture arrangement', 'Generative adversarial network', 'Latentspace illumination', 'Quality-diversity algorithm']"
5818,2208.04192,Vivek Kumar Singh Ph.D.,"Hiran H Lathabai, Abhirup Nandy, Vivek Kumar Singh","Institutional Collaboration Recommendation: An expertise-based framework
  using NLP and Network Analysis",,Expert Systems with Applications 2022,10.1016/j.eswa.2022.118317,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  The shift from 'trust-based funding' to 'performance-based funding' is one of
the factors that has forced institutions to strive for continuous improvement
of performance. Several studies have established the importance of
collaboration in enhancing the performance of paired institutions. However,
identification of suitable institutions for collaboration is sometimes
difficult and therefore institutional collaboration recommendation systems can
be vital. Currently, there are no well-developed institutional collaboration
recommendation systems. In order to bridge this gap, we design a framework that
recognizes thematic strengths and core competencies of institutions, which can
in turn be used for collaboration recommendations. The framework, based on NLP
and network analysis techniques, is capable of determining the strengths of an
institution in different thematic areas within a field and thereby determining
the core competency and potential core competency areas of that institution. A
major advantage of the system is that it can help to determine and improve the
research portfolio of an institution within a field through suitable
collaboration, which may lead to the overall improvement of the performance of
the institution in that field. The framework is demonstrated by analyzing the
performance of 195 Indian institutions in the field of 'Computer Science'. Upon
validation using standard metrics for novelty, coverage and diversity of
recommendation systems, the framework is found to be of sufficient coverage and
capable of tossing novel and diverse recommendations. The article thus presents
an institutional collaboration recommendation system which can be used by
institutions to identify potential collaborators.
","[{'version': 'v1', 'created': 'Mon, 8 Aug 2022 14:47:50 GMT'}]",2022-08-09,"[['Lathabai', 'Hiran H', ''], ['Nandy', 'Abhirup', ''], ['Singh', 'Vivek Kumar', '']]","['Institutional Collaboration', 'Recommendation System', 'NLP', 'Network Analysis', 'Research Expertise', 'Expertise indices']"
5819,2110.08818,Ravi Kiran Sarvadevabhatla,"Rishabh Baghel, Abhishek Trivedi, Tejas Ravichandran, Ravi Kiran
  Sarvadevabhatla","MeronymNet: A Hierarchical Approach for Unified and Controllable
  Multi-Category Object Generation","Accepted at ACM Multimedia (ACMMM) 2021 [ORAL] . Website :
  https://meronymnet.github.io/. arXiv admin note: text overlap with
  arXiv:2006.00190",,10.1145/3474085.3475521,,cs.CV cs.GR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce MeronymNet, a novel hierarchical approach for controllable,
part-based generation of multi-category objects using a single unified model.
We adopt a guided coarse-to-fine strategy involving semantically conditioned
generation of bounding box layouts, pixel-level part layouts and ultimately,
the object depictions themselves. We use Graph Convolutional Networks, Deep
Recurrent Networks along with custom-designed Conditional Variational
Autoencoders to enable flexible, diverse and category-aware generation of 2-D
objects in a controlled manner. The performance scores for generated objects
reflect MeronymNet's superior performance compared to multiple strong baselines
and ablative variants. We also showcase MeronymNet's suitability for
controllable object generation and interactive object editing at various levels
of structural and semantic granularity.
","[{'version': 'v1', 'created': 'Sun, 17 Oct 2021 13:20:35 GMT'}]",2021-10-19,"[['Baghel', 'Rishabh', ''], ['Trivedi', 'Abhishek', ''], ['Ravichandran', 'Tejas', ''], ['Sarvadevabhatla', 'Ravi Kiran', '']]","['deep generative model', 'object', 'part', 'hierarchical']"
5820,1508.07275,Luiz Capretz Dr.,"Ali Bou Nassif, Mohammad Azzeh, Luiz Fernando Capretz, Danny Ho","A Comparison Between Decision Trees and Decision Tree Forest Models for
  Software Development Effort Estimation","3rd International Conference on Communications and Information
  Technology (ICCIT), Beirut, Lebanon, pp. 220-224, 2013",,10.1109/ICCITechnology.2013.6579553,,cs.SE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate software effort estimation has been a challenge for many software
practitioners and project managers. Underestimation leads to disruption in the
projects estimated cost and delivery. On the other hand, overestimation causes
outbidding and financial losses in business. Many software estimation models
exist; however, none have been proven to be the best in all situations. In this
paper, a decision tree forest (DTF) model is compared to a traditional decision
tree (DT) model, as well as a multiple linear regression model (MLR). The
evaluation was conducted using ISBSG and Desharnais industrial datasets.
Results show that the DTF model is competitive and can be used as an
alternative in software effort prediction.
","[{'version': 'v1', 'created': 'Fri, 28 Aug 2015 16:52:21 GMT'}]",2015-08-31,"[['Nassif', 'Ali Bou', ''], ['Azzeh', 'Mohammad', ''], ['Capretz', 'Luiz Fernando', ''], ['Ho', 'Danny', '']]","['Software Effort Estimation', 'Decision Tree', 'Decision Tree Forests', 'Project Management']"
5821,2005.05826,Igor Sfiligoi,"Igor Sfiligoi, Daniel McDonald and Rob Knight",Porting and optimizing UniFrac for GPUs,"4 pages, 3 figures, 4 tables",,10.1145/3311790.3399614,,cs.DC q-bio.QM,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  UniFrac is a commonly used metric in microbiome research for comparing
microbiome profiles to one another (""beta diversity""). The recently implemented
Striped UniFrac added the capability to split the problem into many independent
subproblems and exhibits near linear scaling. In this paper we describe steps
undertaken in porting and optimizing Striped Unifrac to GPUs. We reduced the
run time of computing UniFrac on the published Earth Microbiome Project dataset
from 13 hours on an Intel Xeon E5-2680 v4 CPU to 12 minutes on an NVIDIA Tesla
V100 GPU, and to about one hour on a laptop with NVIDIA GTX 1050 (with minor
loss in precision). Computing UniFrac on a larger dataset containing 113k
samples reduced the run time from over one month on the CPU to less than 2
hours on the V100 and 9 hours on an NVIDIA RTX 2080TI GPU (with minor loss in
precision). This was achieved by using OpenACC for generating the GPU offload
code and by improving the memory access patterns. A BSD-licensed implementation
is available, which produces a C shared library linkable by any programming
language.
","[{'version': 'v1', 'created': 'Tue, 12 May 2020 14:41:28 GMT'}]",2020-07-28,"[['Sfiligoi', 'Igor', ''], ['McDonald', 'Daniel', ''], ['Knight', 'Rob', '']]","['Microbiome', 'GPU', 'OpenACC', 'Optimization', 'UniFrac']"
5822,2211.08245,Hanchen David Wang,"Hanchen David Wang, Meiyi Ma",PhysiQ: Off-site Quality Assessment of Exercise in Physical Therapy,22 pages,,10.1145/3570349,,cs.HC cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Physical therapy (PT) is crucial for patients to restore and maintain
mobility, function, and well-being. Many on-site activities and body exercises
are performed under the supervision of therapists or clinicians. However, the
postures of some exercises at home cannot be performed accurately due to the
lack of supervision, quality assessment, and self-correction. Therefore, in
this paper, we design a new framework, PhysiQ, that continuously tracks and
quantitatively measures people's off-site exercise activity through passive
sensory detection. In the framework, we create a novel multi-task
spatio-temporal Siamese Neural Network that measures the absolute quality
through classification and relative quality based on an individual's PT
progress through similarity comparison. PhysiQ digitizes and evaluates
exercises in three different metrics: range of motions, stability, and
repetition.
","[{'version': 'v1', 'created': 'Sat, 12 Nov 2022 01:53:38 GMT'}]",2022-11-16,"[['Wang', 'Hanchen David', ''], ['Ma', 'Meiyi', '']]","['Activity Quantitative Assessment', 'HAR', 'Neural Network', 'Physical Therapy']"
5823,2008.11238,Vishal Dey,"Vishal Dey, Peter Krasniak, Minh Nguyen, Clara Lee and Xia Ning","A Pipeline to Understand Emerging Illness via Social Media Data
  Analysis: A Case Study on Breast Implant Illness",The manuscript has been accepted at the JMIR Medical Informatics,"JMIR Medical Informaatics 2021, 9(11):e29768",10.2196/29768,,cs.IR cs.CY cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Background: A new illness could first come to the public attention over
social media before it is medically defined, formally documented or
systematically studied. One example is a phenomenon known as breast implant
illness (BII) that has been extensively discussed on social media, though
vaguely defined in medical literature. Objectives: The objective of this study
is to construct a data analysis pipeline to understand emerging illness using
social media data, and to apply the pipeline to understand key attributes of
BII. Methods: We conducted a pipeline of social media data analysis using
Natural Language Processing (NLP) and topic modeling. We extracted mentions
related to signs/symptoms, diseases/disorders and medical procedures using the
Clinical Text Analysis and Knowledge Extraction System (cTAKES) from social
media data. We mapped the mentions to standard medical concepts. We summarized
mapped concepts to topics using Latent Dirichlet Allocation (LDA). Finally, we
applied this pipeline to understand BII from several BII-dedicated social media
sites. Results: Our pipeline identified topics related to toxicity, cancer and
mental health issues that are highly associated with BII. Our pipeline also
shows that cancers, autoimmune disorders and mental health problems are
emerging concerns associated with breast implants based on social media
discussions. The pipeline also identified mentions such as rupture, infection,
pain and fatigue as common self-reported issues among the public, as well as
toxicity from silicone implants. Conclusions: Our study could inspire future
work studying the suggested symptoms and factors of BII. Our study provides the
first analysis and derived knowledge of BII from social media using NLP
techniques, and demonstrates the potential of using social media information to
better understand similar emerging illnesses.
","[{'version': 'v1', 'created': 'Tue, 25 Aug 2020 19:00:25 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Mar 2022 22:37:24 GMT'}]",2022-03-10,"[['Dey', 'Vishal', ''], ['Krasniak', 'Peter', ''], ['Nguyen', 'Minh', ''], ['Lee', 'Clara', ''], ['Ning', 'Xia', '']]","['Breast Implant Illness', 'Social Media', 'Natural Language Processing', 'Topic Modeling']"
5824,2211.16837,Fabian Meyer,"Fabian Meyer, Katharina Glock","Kinematic Orienteering Problem With Time-Optimal Trajectories for
  Multirotor UAVs","This work was published in IEEE Robotics and Automation Letteres,
  VOL. 7, NO. 4, OCTOBER 2022","in IEEE Robotics and Automation Letters, vol. 7, no. 4, pp.
  11402-11409, Oct. 2022",10.1109/LRA.2022.3194688,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many unmanned aerial vehicle (UAV) applications for surveillance and data
collection, it is not possible to reach all requested locations due to the
given maximum flight time. Hence, the requested locations must be prioritized
and the problem of selecting the most important locations is modeled as an
Orienteering Problem (OP). To fully exploit the kinematic properties of the UAV
in such scenarios, we combine the OP with the generation of time-optimal
trajectories with bounds on velocity and acceleration. We define the resulting
problem as the Kinematic Orienteering Problem (KOP) and propose an exact
mixed-integer formulation together with a Large Neighborhood Search (LNS) as a
heuristic solution method. We demonstrate the effectiveness of our approach
based on Orienteering instances from the literature and benchmark against
optimal solutions of the Dubins Orienteering Problem (DOP) as the
state-of-the-art. Additionally, we show by simulation \color{black} that the
resulting solutions can be tracked precisely by a modern MPC-based flight
controller. Since we demonstrate that the state-of-the-art in generating
time-optimal trajectories in multiple dimensions is not generally correct, we
further present an improved analytical method for time-optimal trajectory
generation.
","[{'version': 'v1', 'created': 'Wed, 30 Nov 2022 09:17:58 GMT'}]",2022-12-01,"[['Meyer', 'Fabian', ''], ['Glock', 'Katharina', '']]","['Orienteering Problem', 'multirotor UAV', 'route planning', 'trajectory generation', 'time-optimality']"
5825,2202.12064,Cristian Alb,Cristian Alb,Interfering Paths in Decision Trees: A Note on Deodata Predictors,,,10.13140/RG.2.2.12510.10565,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  A technique for improving the prediction accuracy of decision trees is
proposed. It consists in evaluating the tree's branches in parallel over
multiple paths. The technique enables predictions that are more aligned with
the ones generated by the nearest neighborhood variant of the deodata
algorithms. The technique also enables the hybridization of the decision tree
algorithm with the nearest neighborhood variant.
","[{'version': 'v1', 'created': 'Thu, 24 Feb 2022 12:41:20 GMT'}]",2022-02-25,"[['Alb', 'Cristian', '']]","['decision tree', 'missing attribute', 'nearest neighborhood hybrid']"
5826,2010.00401,Aniruddh Herle Mr.,"Aniruddh Herle, Janamejaya Channegowda, Dinakar Prabhu","Quasar Detection using Linear Support Vector Machine with Learning From
  Mistakes Methodology","Published in 2020 IEEE International Conference on Electronics,
  Computing and Communication Technologies (CONECCT)",,10.1109/CONECCT50063.2020.9198529,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The field of Astronomy requires the collection and assimilation of vast
volumes of data. The data handling and processing problem has become severe as
the sheer volume of data produced by scientific instruments each night grows
exponentially. This problem becomes extensive for conventional methods of
processing the data, which was mostly manual, but is the perfect setting for
the use of Machine Learning approaches. While building classifiers for
Astronomy, the cost of losing a rare object like supernovae or quasars to
detection losses is far more severe than having many false positives, given the
rarity and scientific value of these objects. In this paper, a Linear Support
Vector Machine (LSVM) is explored to detect Quasars, which are extremely bright
objects in which a supermassive black hole is surrounded by a luminous
accretion disk. In Astronomy, it is vital to correctly identify quasars, as
they are very rare in nature. Their rarity creates a class-imbalance problem
that needs to be taken into consideration. The class-imbalance problem and high
cost of misclassification are taken into account while designing the
classifier. To achieve this detection, a novel classifier is explored, and its
performance is evaluated. It was observed that LSVM along with Ensemble Bagged
Trees (EBT) achieved a 10x reduction in the False Negative Rate, using the
Learning from Mistakes methodology.
","[{'version': 'v1', 'created': 'Thu, 1 Oct 2020 13:41:51 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Oct 2020 13:59:59 GMT'}]",2020-10-05,"[['Herle', 'Aniruddh', ''], ['Channegowda', 'Janamejaya', ''], ['Prabhu', 'Dinakar', '']]","['Classification', 'machine learning', 'support vectormachines', 'quasars', 'astronomy']"
5827,2208.11125,Kexuan Xin,"Kexuan Xin, Zequn Sun, Wen Hua, Wei Hu, Jianfeng Qu, Xiaofang Zhou","Large-scale Entity Alignment via Knowledge Graph Merging, Partitioning
  and Embedding",Accepted by CIKM 2022,,10.1145/3511808.3557374,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Entity alignment is a crucial task in knowledge graph fusion. However, most
entity alignment approaches have the scalability problem. Recent methods
address this issue by dividing large KGs into small blocks for embedding and
alignment learning in each. However, such a partitioning and learning process
results in an excessive loss of structure and alignment. Therefore, in this
work, we propose a scalable GNN-based entity alignment approach to reduce the
structure and alignment loss from three perspectives. First, we propose a
centrality-based subgraph generation algorithm to recall some landmark entities
serving as the bridges between different subgraphs. Second, we introduce
self-supervised entity reconstruction to recover entity representations from
incomplete neighborhood subgraphs, and design cross-subgraph negative sampling
to incorporate entities from other subgraphs in alignment learning. Third,
during the inference process, we merge the embeddings of subgraphs to make a
single space for alignment search. Experimental results on the benchmark OpenEA
dataset and the proposed large DBpedia1M dataset verify the effectiveness of
our approach.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2022 07:09:59 GMT'}]",2022-08-25,"[['Xin', 'Kexuan', ''], ['Sun', 'Zequn', ''], ['Hua', 'Wen', ''], ['Hu', 'Wei', ''], ['Qu', 'Jianfeng', ''], ['Zhou', 'Xiaofang', '']]","['large-scale', 'entity alignment', 'graph neural networks']"
5828,2005.09874,Weizun Zhao,"Weizun Zhao (1), Lishuai Li (2 and 1), Sameer Alam (3), Yanjun Wang
  (4) ((1) Department of Systems Engineering and Engineering Management, City
  University of Hong Kong, (2) Air Transport and Operations, Faculty of
  Aerospace Engineering, Delft University of Technology, (3) School of
  Mechanical & Aerospace Engineering, Nanyang Technological University, (4)
  College of Civil Aviation, Nanjing University of Aeronautics and
  Astronautics)",An Incremental Clustering Method for Anomaly Detection in Flight Data,,"Transportation Research Part C: Emerging Technologies, Volume 132,
  2021, 103406",10.1016/j.trc.2021.103406,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Safety is a top priority for civil aviation. New anomaly detection methods,
primarily clustering methods, have been developed to monitor pilot operations
and detect any risks from such flight data. However, all existing anomaly
detection methods are offlline learning - the models are trained once using
historical data and used for all future predictions. In practice, new flight
data are accumulated continuously and analyzed every month at airlines.
Clustering such dynamically growing data is challenging for an offlline method
because it is memory and time intensive to re-train the model every time new
data come in. If the model is not re-trained, false alarms or missed detections
may increase since the model cannot reflect changes in data patterns. To
address this problem, we propose a novel incremental anomaly detection method
based on Gaussian Mixture Model (GMM) to identify common patterns and detect
outliers in flight operations from digital flight data. It is a probabilistic
clustering model of flight operations that can incrementally update its
clusters based on new data rather than to re-cluster all data from scratch. It
trains an initial GMM model based on historical offlline data. Then, it
continuously adapts to new incoming data points via an expectation-maximization
(EM) algorithm. To track changes in flight operation patterns, only model
parameters need to be saved. The proposed method was tested on three sets of
simulation data and two sets of real-world flight data. Compared with the
traditional offline GMM method, the proposed method can generate similar
clustering results with significantly reduced processing time (57 % - 99 % time
reduction in testing sets) and memory usage (91 % - 95 % memory usage reduction
in testing sets). Preliminary results indicate that the incremental learning
scheme is effective in dealing with dynamically growing data in flight data
analytics.
","[{'version': 'v1', 'created': 'Wed, 20 May 2020 06:58:25 GMT'}, {'version': 'v2', 'created': 'Thu, 21 May 2020 02:18:12 GMT'}, {'version': 'v3', 'created': 'Wed, 27 May 2020 10:30:28 GMT'}, {'version': 'v4', 'created': 'Wed, 6 Oct 2021 04:32:18 GMT'}]",2021-10-07,"[['Zhao', 'Weizun', '', '2 and 1'], ['Li', 'Lishuai', '', '2 and 1'], ['Alam', 'Sameer', ''], ['Wang', 'Yanjun', '']]","['Gaussian mixture model', 'incremental clustering', 'flight data', 'anomaly detection']"
5829,2202.10381,Sheng Zhang,"Lihan Chen, Sihang Jiang, Jingping Liu, Chao Wang, Sheng Zhang,
  Chenhao Xie, Jiaqing Liang, Yanghua Xiao and Rui Song",Rule Mining over Knowledge Graphs via Reinforcement Learning,Knowledge-Based Systems,"KNOSYS_108371, 2022",10.1016/j.knosys.2022.108371,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge graphs (KGs) are an important source repository for a wide range of
applications and rule mining from KGs recently attracts wide research interest
in the KG-related research community. Many solutions have been proposed for the
rule mining from large-scale KGs, which however are limited in the inefficiency
of rule generation and ineffectiveness of rule evaluation. To solve these
problems, in this paper we propose a generation-then-evaluation rule mining
approach guided by reinforcement learning. Specifically, a two-phased framework
is designed. The first phase aims to train a reinforcement learning agent for
rule generation from KGs, and the second is to utilize the value function of
the agent to guide the step-by-step rule generation. We conduct extensive
experiments on several datasets and the results prove that our rule mining
solution achieves state-of-the-art performance in terms of efficiency and
effectiveness.
","[{'version': 'v1', 'created': 'Mon, 21 Feb 2022 17:18:31 GMT'}]",2022-02-22,"[['Chen', 'Lihan', ''], ['Jiang', 'Sihang', ''], ['Liu', 'Jingping', ''], ['Wang', 'Chao', ''], ['Zhang', 'Sheng', ''], ['Xie', 'Chenhao', ''], ['Liang', 'Jiaqing', ''], ['Xiao', 'Yanghua', ''], ['Song', 'Rui', '']]","['Rule mining', 'Reinforcement learning', 'Representation learning']"
5830,1906.06956,Panagiotis Tampakis,"Panagiotis Tampakis, Nikos Pelekis, Christos Doulkeridis and Yannis
  Theodoridis",Scalable Distributed Subtrajectory Clustering,,2019 IEEE International Conference on Big Data (Big Data),10.1109/BigData47090.2019.9005563,,cs.DB cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Trajectory clustering is an important operation of knowledge discovery from
mobility data. Especially nowadays, the need for performing advanced analytic
operations over massively produced data, such as mobility traces, in efficient
and scalable ways is imperative. However, discovering clusters of complete
trajectories can overlook significant patterns that exist only for a small
portion of their lifespan. In this paper, we address the problem of Distributed
Subtrajectory Clustering in an efficient and highly scalable way. The problem
is challenging because the subtrajectories to be clustered are not known in
advance, but they need to be discovered dynamically based on adjacent
subtrajectories in space and time. Towards this objective, we split the
original problem to three sub-problems, namely Subtrajectory Join, Trajectory
Segmentation and Clustering and Outlier Detection, and deal with each one in a
distributed fashion by utilizing the MapReduce programming model. The
efficiency and the effectiveness of our solution is demonstrated experimentally
over a synthetic and two large real datasets from the maritime and urban
domains and through comparison with two state of the art subtrajectory
clustering algorithms.
","[{'version': 'v1', 'created': 'Mon, 17 Jun 2019 11:15:21 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Jun 2019 07:32:22 GMT'}]",2020-03-03,"[['Tampakis', 'Panagiotis', ''], ['Pelekis', 'Nikos', ''], ['Doulkeridis', 'Christos', ''], ['Theodoridis', 'Yannis', '']]","['Mobility data', 'trajectories', 'subtrajectory clustering', 'big mobility data mining', 'distributed clustering', 'mapreduce']"
5831,1602.06897,Jorge Fandinno,Pedro Cabalar and Jorge Fandinno,Enablers and Inhibitors in Causal Justifications of Logic Programs,,,10.1017/S1471068416000107,,cs.LO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To appear in Theory and Practice of Logic Programming (TPLP). In this paper
we propose an extension of logic programming (LP) where each default literal
derived from the well-founded model is associated to a justification
represented as an algebraic expression. This expression contains both causal
explanations (in the form of proof graphs built with rule labels) and terms
under the scope of negation that stand for conditions that enable or disable
the application of causal rules. Using some examples, we discuss how these new
conditions, we respectively call ""enablers"" and ""inhibitors"", are intimately
related to default negation and have an essentially different nature from
regular cause-effect relations. The most important result is a formal
comparison to the recent algebraic approaches for justifications in LP:
""Why-not Provenance"" (WnP) and ""Causal Graphs"" (CG). We show that the current
approach extends both WnP and CG justifications under the Well-Founded
Semantics and, as a byproduct, we also establish a formal relation between
these two approaches.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2016 19:18:54 GMT'}]",2016-05-11,"[['Cabalar', 'Pedro', ''], ['Fandinno', 'Jorge', '']]","['causal justifications', 'well-founded semantics', 'stable models', 'answer set programming']"
5832,1506.09166,Ali Avanaki,"Ali R. N. Avanaki, Kathryn S. Espig, Sameer Sawhney, Liron
  Pantanowitz, Anil V. Parwani, Albert Xthona, Tom R. L. Kimpe",Aging display's effect on interpretation of digital pathology slides,,,10.1117/12.2082315,,cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is our conjecture that the variability of colors in a pathology image
effects the interpretation of pathology cases, whether it is diagnostic
accuracy, diagnostic confidence, or workflow efficiency. In this paper, digital
pathology images are analyzed to quantify the perceived difference in color
that occurs due to display aging, in particular a change in the maximum
luminance, white point, and color gamut. The digital pathology images studied
include diagnostically important features, such as the conspicuity of nuclei.
Three different display aging models are applied to images: aging of luminance
& chrominance, aging of chrominance only, and a stabilized luminance &
chrominance (i.e., no aging). These display models and images are then used to
compare conspicuity of nuclei using CIE deltaE2000, a perceptual color
difference metric. The effect of display aging using these display models and
images is further analyzed through a human reader study designed to quantify
the effects from a clinical perspective. Results from our reader study indicate
significant impact of aged displays on workflow as well as diagnosis as follow.
As compared to the originals (no-aging), slides with the effect of aging
simulated were significantly more difficult to read (p-value of 0.0005) and
took longer to score (p-value of 0.02). Moreover, luminance+chrominance aging
significantly reduced inter-session percent agreement of diagnostic scores
(p-value of 0.0418).
","[{'version': 'v1', 'created': 'Tue, 30 Jun 2015 17:29:43 GMT'}]",2015-07-01,"[['Avanaki', 'Ali R. N.', ''], ['Espig', 'Kathryn S.', ''], ['Sawhney', 'Sameer', ''], ['Pantanowitz', 'Liron', ''], ['Parwani', 'Anil V.', ''], ['Xthona', 'Albert', ''], ['Kimpe', 'Tom R. L.', '']]","['Display Aging', 'Display Models', 'Display Aging Models']"
5833,2205.07868,Joachim Pedersen,"Joachim Winther Pedersen, Sebastian Risi",Minimal Neural Network Models for Permutation Invariant Agents,,,10.1145/3512290.3528839,,cs.LG cs.AI cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Organisms in nature have evolved to exhibit flexibility in face of changes to
the environment and/or to themselves. Artificial neural networks (ANNs) have
proven useful for controlling of artificial agents acting in environments.
However, most ANN models used for reinforcement learning-type tasks have a
rigid structure that does not allow for varying input sizes. Further, they fail
catastrophically if inputs are presented in an ordering unseen during
optimization. We find that these two ANN inflexibilities can be mitigated and
their solutions are simple and highly related. For permutation invariance, no
optimized parameters can be tied to a specific index of the input elements. For
size invariance, inputs must be projected onto a common space that does not
grow with the number of projections. Based on these restrictions, we construct
a conceptually simple model that exhibit flexibility most ANNs lack. We
demonstrate the model's properties on multiple control problems, and show that
it can cope with even very rapid permutations of input indices, as well as
changes in input size. Ablation studies show that is possible to achieve these
properties with simple feedforward structures, but that it is much easier to
optimize recurrent structures.
","[{'version': 'v1', 'created': 'Thu, 12 May 2022 08:03:29 GMT'}]",2022-05-18,"[['Pedersen', 'Joachim Winther', ''], ['Risi', 'Sebastian', '']]","['Permutation Invariant Networks', 'Recurrent Neural Networks', 'Parameters Sharing']"
5834,2006.03271,Valerio Schiavoni Dr,Pascal Maissen and Pascal Felber and Peter Kropf and Valerio Schiavoni,FaaSdom: A Benchmark Suite for Serverless Computing,ACM DEBS'20,,10.1145/3401025.3401738,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Serverless computing has become a major trend among cloud providers. With
serverless computing, developers fully delegate the task of managing the
servers, dynamically allocating the required resources, as well as handling
availability and fault-tolerance matters to the cloud provider. In doing so,
developers can solely focus on the application logic of their software, which
is then deployed and completely managed in the cloud. Despite its increasing
popularity, not much is known regarding the actual system performance
achievable on the currently available serverless platforms. Specifically, it is
cumbersome to benchmark such systems in a language- or runtime-independent
manner. Instead, one must resort to a full application deployment, to later
take informed decisions on the most convenient solution along several
dimensions, including performance and economic costs. FaaSdom is a modular
architecture and proof-of-concept implementation of a benchmark suite for
serverless computing platforms. It currently supports the current mainstream
serverless cloud providers (i.e., AWS, Azure, Google, IBM), a large set of
benchmark tests and a variety of implementation languages. The suite fully
automatizes the deployment, execution and clean-up of such tests, providing
insights (including historical) on the performance observed by serverless
applications. FaaSdom also integrates a model to estimate budget costs for
deployments across the supported providers. FaaSdom is open-source and
available at https://github.com/bschitter/benchmark-suite-serverless-computing.
","[{'version': 'v1', 'created': 'Fri, 5 Jun 2020 07:43:40 GMT'}]",2020-06-08,"[['Maissen', 'Pascal', ''], ['Felber', 'Pascal', ''], ['Kropf', 'Peter', ''], ['Schiavoni', 'Valerio', '']]","['serverless', 'function as a service', 'benchmark suite', 'opensource']"
5835,1704.03141,Yejin Kim,"Yejin Kim, Jimeng Sun, Hwanjo Yu, Xiaoqian Jiang",Federated Tensor Factorization for Computational Phenotyping,,,10.1145/3097983.3098118,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tensor factorization models offer an effective approach to convert massive
electronic health records into meaningful clinical concepts (phenotypes) for
data analysis. These models need a large amount of diverse samples to avoid
population bias. An open challenge is how to derive phenotypes jointly across
multiple hospitals, in which direct patient-level data sharing is not possible
(e.g., due to institutional policies). In this paper, we developed a novel
solution to enable federated tensor factorization for computational phenotyping
without sharing patient-level data. We developed secure data harmonization and
federated computation procedures based on alternating direction method of
multipliers (ADMM). Using this method, the multiple hospitals iteratively
update tensors and transfer secure summarized information to a central server,
and the server aggregates the information to generate phenotypes. We
demonstrated with real medical datasets that our method resembles the
centralized training model (based on combined datasets) in terms of accuracy
and phenotypes discovery while respecting privacy.
","[{'version': 'v1', 'created': 'Tue, 11 Apr 2017 04:28:03 GMT'}]",2017-10-13,"[['Kim', 'Yejin', ''], ['Sun', 'Jimeng', ''], ['Yu', 'Hwanjo', ''], ['Jiang', 'Xiaoqian', '']]","['ADMM', 'Federated approach', 'Phenotype']"
5836,2201.02448,Paolo Pellizzoni,"Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci",k-Center Clustering with Outliers in Sliding Windows,,Algorithms. 2022; 15(2):52,10.3390/a15020052,,cs.LG cs.DS,http://creativecommons.org/licenses/by/4.0/,"  Metric $k$-center clustering is a fundamental unsupervised learning
primitive. Although widely used, this primitive is heavily affected by noise in
the data, so that a more sensible variant seeks for the best solution that
disregards a given number $z$ of points of the dataset, called outliers. We
provide efficient algorithms for this important variant in the streaming model
under the sliding window setting, where, at each time step, the dataset to be
clustered is the window $W$ of the most recent data items. Our algorithms
achieve $O(1)$ approximation and, remarkably, require a working memory linear
in $k+z$ and only logarithmic in $|W|$. As a by-product, we show how to
estimate the effective diameter of the window $W$, which is a measure of the
spread of the window points, disregarding a given fraction of noisy distances.
We also provide experimental evidence of the practical viability of our
theoretical results.
","[{'version': 'v1', 'created': 'Fri, 7 Jan 2022 13:34:05 GMT'}]",2022-02-28,"[['Pellizzoni', 'Paolo', ''], ['Pietracaprina', 'Andrea', ''], ['Pucci', 'Geppino', '']]","['k-center with outliers', 'effective diameter', 'big data', 'data stream model', 'sliding windows', 'coreset', 'doublingdimension', 'approximation algorithms']"
5837,2301.05663,Patrick Jonk,"Patrick Jonk, Vincent de Vries, Rombout Wever, Georgios Sidiropoulos,
  Evangelos Kanoulas","Natural Language Processing of Aviation Occurrence Reports for Safety
  Management",,"Proceedings of the 32nd European Safety and Reliability Conference
  (ESREL 2022)",10.3850/978-981-18-5183-4_S05-06-449-cd,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Occurrence reporting is a commonly used method in safety management systems
to obtain insight in the prevalence of hazards and accident scenarios. In
support of safety data analysis, reports are often categorized according to a
taxonomy. However, the processing of the reports can require significant effort
from safety analysts and a common problem is interrater variability in labeling
processes. Also, in some cases, reports are not processed according to a
taxonomy, or the taxonomy does not fully cover the contents of the documents.
This paper explores various Natural Language Processing (NLP) methods to
support the analysis of aviation safety occurrence reports. In particular, the
problems studied are the automatic labeling of reports using a classification
model, extracting the latent topics in a collection of texts using a topic
model and the automatic generation of probable cause texts. Experimental
results showed that (i) under the right conditions the labeling of occurrence
reports can be effectively automated with a transformer-based classifier, (ii)
topic modeling can be useful for finding the topics present in a collection of
reports, and (iii) using a summarization model can be a promising direction for
generating probable cause texts.
","[{'version': 'v1', 'created': 'Fri, 13 Jan 2023 17:00:09 GMT'}]",2023-01-16,"[['Jonk', 'Patrick', ''], ['de Vries', 'Vincent', ''], ['Wever', 'Rombout', ''], ['Sidiropoulos', 'Georgios', ''], ['Kanoulas', 'Evangelos', '']]","['Machine Learning', 'Natural Language Processing', 'Artificial Intelligence', 'Occurrence Reporting', 'Aviation', 'Safety Management']"
5838,2005.13439,Alfonso Santiago Ferrandez,"A. Santiago, M. Zavala-Ak\'e, R. Borell, G. Houzeaux",HPC compact quasi-Newton algorithm for interface problems,"33 pages: 23 manuscript, 10 appendix. 16 figures: 4 manuscript, 12
  appendix. 10 Tables: 3 manuscript, 7 appendix",Journal of Fluids and Structures (2020) 103009,10.1016/j.jfluidstructs.2020.103009,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we present a robust interface coupling algorithm called Compact
Interface quasi-Newton (CIQN). It is designed for computationally intensive
applications using an MPI multi-code partitioned scheme. The algorithm allows
to reuse information from previous time steps, feature that has been previously
proposed to accelerate convergence. Through algebraic manipulation, an
efficient usage of the computational resources is achieved by: avoiding
construction of dense matrices and reduce every multiplication to a
matrix-vector product and reusing the computationally expensive loops. This
leads to a compact version of the original quasi-Newton algorithm. Altogether
with an efficient communication, in this paper we show an efficient scalability
up to 4800 cores. Three examples with qualitatively different dynamics are
shown to prove that the algorithm can efficiently deal with added mass
instability and two-field coupled problems. We also show how reusing histories
and filtering does not necessarily makes a more robust scheme and, finally, we
prove the necessity of this HPC version of the algorithm. The novelty of this
article lies in the HPC focused implementation of the algorithm, detailing how
to fuse and combine the composing blocks to obtain an scalable MPI
implementation. Such an implementation is mandatory in large scale cases, for
which the contact surface cannot be stored in a single computational node, or
the number of contact nodes is not negligible compared with the size of the
domain. \c{opyright} <2020> Elsevier. This manuscript version is made available
under the CC-BY-NC-ND 4.0 license
http://creativecommons.org/licenses/by-nc-nd/4.0/
","[{'version': 'v1', 'created': 'Fri, 22 May 2020 06:36:43 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Jun 2020 14:37:36 GMT'}]",2020-06-02,"[['Santiago', 'A.', ''], ['Zavala-Aké', 'M.', ''], ['Borell', 'R.', ''], ['Houzeaux', 'G.', '']]","['coupling scheme', 'fluid-structure interaction', 'high performance']"
5839,1806.05984,Rodrigo Berriel,"Rodrigo F. Berriel, Edilson de Aguiar, Alberto F. de Souza, Thiago
  Oliveira-Santos",Ego-Lane Analysis System (ELAS): Dataset and Algorithms,"13 pages, 17 figures,
  github.com/rodrigoberriel/ego-lane-analysis-system, and published by Image
  and Vision Computing (IMAVIS)",Image and Vision Computing 68 (2017) 64-75,10.1016/J.IMAVIS.2017.07.005,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Decreasing costs of vision sensors and advances in embedded hardware boosted
lane related research detection, estimation, and tracking in the past two
decades. The interest in this topic has increased even more with the demand for
advanced driver assistance systems (ADAS) and self-driving cars. Although
extensively studied independently, there is still need for studies that propose
a combined solution for the multiple problems related to the ego-lane, such as
lane departure warning (LDW), lane change detection, lane marking type (LMT)
classification, road markings detection and classification, and detection of
adjacent lanes (i.e., immediate left and right lanes) presence. In this paper,
we propose a real-time Ego-Lane Analysis System (ELAS) capable of estimating
ego-lane position, classifying LMTs and road markings, performing LDW and
detecting lane change events. The proposed vision-based system works on a
temporal sequence of images. Lane marking features are extracted in perspective
and Inverse Perspective Mapping (IPM) images that are combined to increase
robustness. The final estimated lane is modeled as a spline using a combination
of methods (Hough lines with Kalman filter and spline with particle filter).
Based on the estimated lane, all other events are detected. To validate ELAS
and cover the lack of lane datasets in the literature, a new dataset with more
than 20 different scenes (in more than 15,000 frames) and considering a variety
of scenarios (urban road, highways, traffic, shadows, etc.) was created. The
dataset was manually annotated and made publicly available to enable evaluation
of several events that are of interest for the research community (i.e., lane
estimation, change, and centering; road markings; intersections; LMTs;
crosswalks and adjacent lanes). ELAS achieved high detection rates in all
real-world events and proved to be ready for real-time applications.
","[{'version': 'v1', 'created': 'Fri, 15 Jun 2018 14:02:44 GMT'}]",2018-06-18,"[['Berriel', 'Rodrigo F.', ''], ['de Aguiar', 'Edilson', ''], ['de Souza', 'Alberto F.', ''], ['Oliveira-Santos', 'Thiago', '']]","['ego-lane analysis', 'lane estimation', 'Kalman filter', 'particle filter', 'dataset', 'image processing']"
5840,2109.06967,Thomas Thuesen Enevoldsen,Thomas T. Enevoldsen and Roberto Galeazzi,"Grounding-aware RRT* for Path Planning and Safe Navigation of Marine
  Crafts in Confined Waters","Accepted for publication at the 13th IFAC Conference on Control
  Applications in Marine Systems, Robotics, and Vehicles, 2021 (CAMS)",,10.1016/j.ifacol.2021.10.093,,cs.RO cs.SI cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The paper presents a path planning algorithm based on RRT* that addresses the
risk of grounding during evasive manoeuvres to avoid collision. The planner
achieves this objective by integrating a collective navigation experience with
the systematic use of water depth information from the electronic navigational
chart. Multivariate kernel density estimation is applied to historical AIS data
to generate a probabilistic model describing seafarer's best practices while
sailing in confined waters. This knowledge is then encoded into the RRT* cost
function to penalize path deviations that would lead own ship to sail in
shallow waters. Depth contours satisfying the own ship draught define the
actual navigable area, and triangulation of this non-convex region is adopted
to enable uniform sampling. This ensures the optimal path deviation.
","[{'version': 'v1', 'created': 'Tue, 14 Sep 2021 20:53:18 GMT'}]",2021-11-04,"[['Enevoldsen', 'Thomas T.', ''], ['Galeazzi', 'Roberto', '']]","['Path planning', 'Collision and grounding avoidance', 'Kernel density estimation', 'AIS']"
5841,2008.08693,Sven Weinzierl,"Sven Weinzierl and Sebastian Dunzer and Sandra Zilker and Martin
  Matzner","Prescriptive Business Process Monitoring for Recommending Next Best
  Actions",,,10.1007/978-3-030-58638-6_12,,cs.AI cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predictive business process monitoring (PBPM) techniques predict future
process behaviour based on historical event log data to improve operational
business processes. Concerning the next activity prediction, recent PBPM
techniques use state-of-the-art deep neural networks (DNNs) to learn predictive
models for producing more accurate predictions in running process instances.
Even though organisations measure process performance by key performance
indicators (KPIs), the DNN`s learning procedure is not directly affected by
them. Therefore, the resulting next most likely activity predictions can be
less beneficial in practice. Prescriptive business process monitoring (PrBPM)
approaches assess predictions regarding their impact on the process performance
(typically measured by KPIs) to prevent undesired process activities by raising
alarms or recommending actions. However, none of these approaches recommends
actual process activities as actions that are optimised according to a given
KPI. We present a PrBPM technique that transforms the next most likely
activities into the next best actions regarding a given KPI. Thereby, our
technique uses business process simulation to ensure the control-flow
conformance of the recommended actions. Based on our evaluation with two
real-life event logs, we show that our technique`s next best actions can
outperform next activity predictions regarding the optimisation of a KPI and
the distance from the actual process instances.
","[{'version': 'v1', 'created': 'Wed, 19 Aug 2020 22:33:54 GMT'}]",2020-09-14,"[['Weinzierl', 'Sven', ''], ['Dunzer', 'Sebastian', ''], ['Zilker', 'Sandra', ''], ['Matzner', 'Martin', '']]","['Prescriptive business process monitoring', 'predictive business process monitoring', 'business process management']"
5842,1801.07553,Marieke van der Wegen,Ragnar Groot Koerkamp and Marieke van der Wegen,Stable gonality is computable,15 pages; v2 minor changes; v3 minor changes,"Discrete Mathematics & Theoretical Computer Science, vol. 21 no.
  1, ICGT 2018 (June 13, 2019) dmtcs:5557",10.23638/DMTCS-21-1-10,,cs.DM cs.DS math.CO math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stable gonality is a multigraph parameter that measures the complexity of a
graph. It is defined using maps to trees. Those maps, in some sense, divide the
edges equally over the edges of the tree; stable gonality asks for the map with
the minimum number of edges mapped to each edge of the tree. This parameter is
related to treewidth, but unlike treewidth, it distinguishes multigraphs from
their underlying simple graphs. Stable gonality is relevant for problems in
number theory. In this paper, we show that deciding whether the stable gonality
of a given graph is at most a given integer $k$ belongs to the class NP, and we
give an algorithm that computes the stable gonality of a graph in
$O((1.33n)^nm^m \text{poly}(n,m))$ time.
","[{'version': 'v1', 'created': 'Tue, 23 Jan 2018 14:21:55 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Oct 2018 16:15:34 GMT'}, {'version': 'v3', 'created': 'Wed, 17 Apr 2019 10:03:46 GMT'}, {'version': 'v4', 'created': 'Thu, 6 Jun 2019 12:38:10 GMT'}]",2021-01-04,"[['Koerkamp', 'Ragnar Groot', ''], ['van der Wegen', 'Marieke', '']]","['algorithm', 'gonality', 'graph parameter']"
5843,1905.11596,Bei Chen,"Yihong Chen, Bei Chen, Xiangnan He, Chen Gao, Yong Li, Jian-Guang Lou,
  Yue Wang",LambdaOpt: Learn to Regularize Recommender Models in Finer Levels,Accepted by KDD 2019,,10.1145/3292500.3330880,,cs.LG cs.IR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommendation models mainly deal with categorical variables, such as
user/item ID and attributes. Besides the high-cardinality issue, the
interactions among such categorical variables are usually long-tailed, with the
head made up of highly frequent values and a long tail of rare ones. This
phenomenon results in the data sparsity issue, making it essential to
regularize the models to ensure generalization. The common practice is to
employ grid search to manually tune regularization hyperparameters based on the
validation data. However, it requires non-trivial efforts and large computation
resources to search the whole candidate space; even so, it may not lead to the
optimal choice, for which different parameters should have different
regularization strengths. In this paper, we propose a hyperparameter
optimization method, LambdaOpt, which automatically and adaptively enforces
regularization during training. Specifically, it updates the regularization
coefficients based on the performance of validation data. With LambdaOpt, the
notorious tuning of regularization hyperparameters can be avoided; more
importantly, it allows fine-grained regularization (i.e. each parameter can
have an individualized regularization coefficient), leading to better
generalized models. We show how to employ LambdaOpt on matrix factorization, a
classical model that is representative of a large family of recommender models.
Extensive experiments on two public benchmarks demonstrate the superiority of
our method in boosting the performance of top-K recommendation.
","[{'version': 'v1', 'created': 'Tue, 28 May 2019 03:54:38 GMT'}]",2019-05-29,"[['Chen', 'Yihong', ''], ['Chen', 'Bei', ''], ['He', 'Xiangnan', ''], ['Gao', 'Chen', ''], ['Li', 'Yong', ''], ['Lou', 'Jian-Guang', ''], ['Wang', 'Yue', '']]","['Top-K Recommendation', 'Regularization Hyperparameter', 'MatrixFactorization']"
5844,1912.11580,Muhammad Usman,"Muhammad Usman, Wenxi Wang, Kaiyuan Wang, Marko Vasic, Haris Vikalo,
  Sarfraz Khurshid","A Study of the Learnability of Relational Properties: Model Counting
  Meets Machine Learning (MCML)",,,10.1145/3385412.3386015,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces the MCML approach for empirically studying the
learnability of relational properties that can be expressed in the well-known
software design language Alloy. A key novelty of MCML is quantification of the
performance of and semantic differences among trained machine learning (ML)
models, specifically decision trees, with respect to entire (bounded) input
spaces, and not just for given training and test datasets (as is the common
practice). MCML reduces the quantification problems to the classic complexity
theory problem of model counting, and employs state-of-the-art model counters.
The results show that relatively simple ML models can achieve surprisingly high
performance (accuracy and F1-score) when evaluated in the common setting of
using training and test datasets - even when the training dataset is much
smaller than the test dataset - indicating the seeming simplicity of learning
relational properties. However, MCML metrics based on model counting show that
the performance can degrade substantially when tested against the entire
(bounded) input space, indicating the high complexity of precisely learning
these properties, and the usefulness of model counting in quantifying the true
performance.
","[{'version': 'v1', 'created': 'Wed, 25 Dec 2019 02:44:13 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Sep 2020 02:14:51 GMT'}]",2020-09-08,"[['Usman', 'Muhammad', ''], ['Wang', 'Wenxi', ''], ['Wang', 'Kaiyuan', ''], ['Vasic', 'Marko', ''], ['Vikalo', 'Haris', ''], ['Khurshid', 'Sarfraz', '']]","['Relational properties', 'machine learning', 'modelcounting', 'SAT solving', 'Alloy', 'ApproxMC', 'ProjMC']"
5845,2103.08560,Eric Wagner,"Eric Wagner, Jan Bauer, Martin Henze","Take a Bite of the Reality Sandwich: Revisiting the Security of
  Progressive Message Authentication Codes",ACM WiSec'22,,10.1145/3507657.3528539,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Message authentication guarantees the integrity of messages exchanged over
untrusted channels. However, to achieve this goal, message authentication
considerably expands packet sizes, which is especially problematic in
constrained wireless environments. To address this issue, progressive message
authentication provides initially reduced integrity protection that is often
sufficient to process messages upon reception. This reduced security is then
successively improved with subsequent messages to uphold the strong guarantees
of traditional integrity protection. However, contrary to previous claims, we
show in this paper that existing progressive message authentication schemes are
highly susceptible to packet loss induced by poor channel conditions or jamming
attacks. Thus, we consider it imperative to rethink how authentication tags
depend on the successful reception of surrounding packets. To this end, we
propose R2-D2, which uses randomized dependencies with parameterized security
guarantees to increase the resilience of progressive authentication against
packet loss. To deploy our approach to resource-constrained devices, we
introduce SP-MAC, which implements R2-D2 using efficient XOR operations. Our
evaluation shows that SP-MAC is resilient to sophisticated network-level
attacks and operates as resources-conscious and fast as existing, yet insecure,
progressive message authentication schemes.
","[{'version': 'v1', 'created': 'Mon, 15 Mar 2021 17:24:37 GMT'}, {'version': 'v2', 'created': 'Fri, 7 May 2021 11:23:41 GMT'}, {'version': 'v3', 'created': 'Thu, 19 May 2022 16:13:41 GMT'}]",2022-05-20,"[['Wagner', 'Eric', ''], ['Bauer', 'Jan', ''], ['Henze', 'Martin', '']]","['ProMACs', 'Progressive Authentication', 'Cyber-Physical Systems']"
5846,2104.13133,Jakob Bossek,"Jakob Bossek, Aneta Neumann, Frank Neumann","Breeding Diverse Packings for the Knapsack Problem by Means of
  Diversity-Tailored Evolutionary Algorithms",,,10.1145/3449639.3459364,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In practise, it is often desirable to provide the decision-maker with a rich
set of diverse solutions of decent quality instead of just a single solution.
In this paper we study evolutionary diversity optimization for the knapsack
problem (KP). Our goal is to evolve a population of solutions that all have a
profit of at least $(1-\varepsilon)\cdot OPT$, where OPT is the value of an
optimal solution. Furthermore, they should differ in structure with respect to
an entropy-based diversity measure. To this end we propose a simple
$(\mu+1)$-EA with initial approximate solutions calculated by a well-known
FPTAS for the KP. We investigate the effect of different standard mutation
operators and introduce biased mutation and crossover which puts strong
probability on flipping bits of low and/or high frequency within the
population. An experimental study on different instances and settings shows
that the proposed mutation operators in most cases perform slightly inferior in
the long term, but show strong benefits if the number of function evaluations
is severely limited.
","[{'version': 'v1', 'created': 'Tue, 27 Apr 2021 12:26:18 GMT'}]",2021-04-28,"[['Bossek', 'Jakob', ''], ['Neumann', 'Aneta', ''], ['Neumann', 'Frank', '']]","['Evolutionary algorithms', 'tailored operators', 'evolutionary diversityoptimization', 'knapsack problem']"
5847,2204.02022,"J\""urgen Dobaj","J\""urgen Dobaj, Andreas Riel, Thomas Krug, Matthias Seidl, Georg
  Macher, Markus Egretzberger","Towards Digital Twin-enabled DevOps for CPS providing Architecture-Based
  Service Adaptation & Verification at Runtime","Final published version appearing in 17th Symposium on Software
  Engineering for Adaptive and Self-Managing Systems (SEAMS 2022)",,10.1145/3524844.3528057,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Industrial Product-Service Systems (IPSS) denote a service-oriented (SO) way
of providing access to CPS capabilities. The design of such systems bears high
risk due to uncertainty in requirements related to service function and
behavior, operation environments, and evolving customer needs. Such risks and
uncertainties are well known in the IT sector, where DevOps principles ensure
continuous system improvement through reliable and frequent delivery processes.
A modular and SO system architecture complements these processes to facilitate
IT system adaptation and evolution. This work proposes a method to use and
extend the Digital Twins (DTs) of IPSS assets for enabling the continuous
optimization of CPS service delivery and the latter's adaptation to changing
needs and environments. This reduces uncertainty during design and operations
by assuring IPSS integrity and availability, especially for design and service
adaptations at CPS runtime. The method builds on transferring IT DevOps
principles to DT-enabled CPS IPSS. The chosen design approach integrates,
reuses, and aligns the DT processing and communication resources with DevOps
requirements derived from literature. We use these requirements to propose a
DT-enabled self-adaptive CPS model, which guides the realization of DT-enabled
DevOps in CPS IPSS. We further propose detailed design models for
operation-critical DTs that integrate CPS closed-loop control and
architecture-based CPS adaptation. This integrated approach enables the
implementation of A/B testing as a use case and central concept to enable CPS
IPSS service adaptation and reconfiguration. The self-adaptive CPS model and DT
design concept have been validated in an evaluation environment for
operation-critical CPS IPSS. The demonstrator achieved sub-millisecond cycle
times during service A/B testing at runtime without causing CPS operation
interferences and downtime.
","[{'version': 'v1', 'created': 'Tue, 5 Apr 2022 06:57:10 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Apr 2022 20:59:59 GMT'}, {'version': 'v3', 'created': 'Fri, 6 May 2022 09:57:06 GMT'}]",2022-05-09,"[['Dobaj', 'Jürgen', ''], ['Riel', 'Andreas', ''], ['Krug', 'Thomas', ''], ['Seidl', 'Matthias', ''], ['Macher', 'Georg', ''], ['Egretzberger', 'Markus', '']]","['DevOps', 'Digital Twin', 'Self-Adaptation', 'CPS', 'Deployment', 'IPSS']"
5848,1910.00100,Jiatong Li,"Jiatong Li, Ricardo Guerrero, Vladimir Pavlovic",Deep Cooking: Predicting Relative Food Ingredient Amounts from Images,,,10.1145/3347448.3357164,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the novel problem of not only predicting ingredients
from a food image, but also predicting the relative amounts of the detected
ingredients. We propose two prediction-based models using deep learning that
output sparse and dense predictions, coupled with important semi-automatic
multi-database integrative data pre-processing, to solve the problem.
Experiments on a dataset of recipes collected from the Internet show the models
generate encouraging experimental results.
","[{'version': 'v1', 'created': 'Thu, 26 Sep 2019 19:49:28 GMT'}]",2019-10-02,"[['Li', 'Jiatong', ''], ['Guerrero', 'Ricardo', ''], ['Pavlovic', 'Vladimir', '']]","['amount estimation', 'ingredients', 'datasets', 'neural networks']"
5849,2001.00119,Simone Parisi,"Simone Parisi, Davide Tateo, Maximilian Hensel, Carlo D'Eramo, Jan
  Peters, Joni Pajarinen","Long-Term Visitation Value for Deep Exploration in Sparse Reward
  Reinforcement Learning",,"Algorithms 2022, 15(3), 81",10.3390/a15030081,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Reinforcement learning with sparse rewards is still an open challenge.
Classic methods rely on getting feedback via extrinsic rewards to train the
agent, and in situations where this occurs very rarely the agent learns slowly
or cannot learn at all. Similarly, if the agent receives also rewards that
create suboptimal modes of the objective function, it will likely prematurely
stop exploring. More recent methods add auxiliary intrinsic rewards to
encourage exploration. However, auxiliary rewards lead to a non-stationary
target for the Q-function. In this paper, we present a novel approach that (1)
plans exploration actions far into the future by using a long-term visitation
count, and (2) decouples exploration and exploitation by learning a separate
function assessing the exploration value of the actions. Contrary to existing
methods which use models of reward and dynamics, our approach is off-policy and
model-free. We further propose new tabular environments for benchmarking
exploration in reinforcement learning. Empirical results on classic and novel
benchmarks show that the proposed approach outperforms existing methods in
environments with sparse rewards, especially in the presence of rewards that
create suboptimal modes of the objective function. Results also suggest that
our approach scales gracefully with the size of the environment. Source code is
available at https://github.com/sparisi/visit-value-explore
","[{'version': 'v1', 'created': 'Wed, 1 Jan 2020 01:01:15 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Mar 2022 06:51:10 GMT'}]",2022-03-04,"[['Parisi', 'Simone', ''], ['Tateo', 'Davide', ''], ['Hensel', 'Maximilian', ''], [""D'Eramo"", 'Carlo', ''], ['Peters', 'Jan', ''], ['Pajarinen', 'Joni', '']]","['reinforcement learning', 'sparse reward', 'exploration', 'upper confidence bound', 'off-policy']"
5850,1911.01914,Gonzalo Mart\'inez-Mu\~noz,"Candice Bent\'ejac and Anna Cs\""org\H{o} and Gonzalo
  Mart\'inez-Mu\~noz",A Comparative Analysis of XGBoost,,,10.1007/s10462-020-09896-5,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  XGBoost is a scalable ensemble technique based on gradient boosting that has
demonstrated to be a reliable and efficient machine learning challenge solver.
This work proposes a practical analysis of how this novel technique works in
terms of training speed, generalization performance and parameter setup. In
addition, a comprehensive comparison between XGBoost, random forests and
gradient boosting has been performed using carefully tuned models as well as
using the default settings. The results of this comparison may indicate that
XGBoost is not necessarily the best choice under all circumstances. Finally an
extensive analysis of XGBoost parametrization tuning process is carried out.
","[{'version': 'v1', 'created': 'Tue, 5 Nov 2019 16:18:29 GMT'}]",2020-09-11,"[['Bentéjac', 'Candice', ''], ['Csörgő', 'Anna', ''], ['Martínez-Muñoz', 'Gonzalo', '']]","['XGBoost', 'gradient boosting', 'random forest', 'ensembles of classifiers']"
5851,2111.03438,Konrad Wolsing,"Konrad Wolsing, Eric Wagner, Antoine Saillard, Martin Henze","IPAL: Breaking up Silos of Protocol-dependent and Domain-specific
  Industrial Intrusion Detection Systems",,"Proceedings of the 25th International Symposium on Research in
  Attacks, Intrusions and Defenses (RAID 2022)",10.1145/3545948.3545968,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing interconnection of industrial networks exposes them to an
ever-growing risk of cyber attacks. To reveal such attacks early and prevent
any damage, industrial intrusion detection searches for anomalies in otherwise
predictable communication or process behavior. However, current efforts mostly
focus on specific domains and protocols, leading to a research landscape broken
up into isolated silos. Thus, existing approaches cannot be applied to other
industries that would equally benefit from powerful detection. To better
understand this issue, we survey 53 detection systems and find no fundamental
reason for their narrow focus. Although they are often coupled to specific
industrial protocols in practice, many approaches could generalize to new
industrial scenarios in theory. To unlock this potential, we propose IPAL, our
industrial protocol abstraction layer, to decouple intrusion detection from
domain-specific industrial protocols. After proving IPAL's correctness in a
reproducibility study of related work, we showcase its unique benefits by
studying the generalizability of existing approaches to new datasets and
conclude that they are indeed not restricted to specific domains or protocols
and can perform outside their restricted silos.
","[{'version': 'v1', 'created': 'Fri, 5 Nov 2021 12:02:29 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Jul 2022 12:00:33 GMT'}]",2022-07-12,"[['Wolsing', 'Konrad', ''], ['Wagner', 'Eric', ''], ['Saillard', 'Antoine', ''], ['Henze', 'Martin', '']]","['Industrial Intrusion Detection', 'IDS', 'CPS', 'ICS', 'Industrial Protocols']"
5852,2208.08502,Huaishu Peng,"Zeyu Yan, Anup Sathya, Sahra Yusuf, Jyh-Ming Lien, Huaishu Peng","Fibercuit: Prototyping High-Resolution Flexible and Kirigami Circuits
  with a Fiber Laser Engraver",,"UIST '22, October 29-November 2, 2022, Bend, OR, USA",10.1145/3526113.3545652,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Prototyping compact devices with unique form factors often requires the PCB
manufacturing process to be outsourced, which can be expensive and
time-consuming. In this paper, we present Fibercuit, a set of rapid prototyping
techniques to fabricate high-resolution, flexible circuits on-demand using a
fiber laser engraver. We showcase techniques that can laser cut copper-based
composites to form fine-pitch conductive traces, laser fold copper substrates
that can form kirigami structures, and laser solder surface-mount electrical
components using off-the-shelf soldering pastes. Combined with our software
pipeline, an end user can design and fabricate flexible circuits which are
dual-layer and three-dimensional, thereby exhibiting a wide range of form
factors. We demonstrate Fibercuit by showcasing a set of examples, including a
custom dice, flex cables, custom end-stop switches, electromagnetic coils, LED
earrings and a circuit in the form of kirigami crane.
","[{'version': 'v1', 'created': 'Wed, 17 Aug 2022 19:42:04 GMT'}, {'version': 'v2', 'created': 'Sat, 27 Aug 2022 21:20:40 GMT'}]",2022-08-30,"[['Yan', 'Zeyu', ''], ['Sathya', 'Anup', ''], ['Yusuf', 'Sahra', ''], ['Lien', 'Jyh-Ming', ''], ['Peng', 'Huaishu', '']]","['fiber laser', 'laser cut', 'PCB', 'circuit board', 'kirigami', 'flexible PCB']"
5853,2011.07821,Stefano Zacchiroli,"Antoine Pietri (DGD-I), Guillaume Rousseau (UP, DGD-I), Stefano
  Zacchiroli (UP, DGD-I)",Forking Without Clicking: on How to Identify Software Repository Forks,,"MSR 2020 -17th International Conference on Mining Software
  Repositories, Oct 2020, Seoul, South Korea. pp.25 - 26",10.1145/3379597.3387450,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The notion of software ''fork'' has been shifting over time from the
(negative) phenomenon of community disagreements that result in the creation of
separate development lines and ultimately software products, to the (positive)
practice of using distributed version control system (VCS) repositories to
collaboratively improve a single product without stepping on each others toes.
In both cases the VCS repositories participating in a fork share parts of a
common development history. Studies of software forks generally rely on hosting
platform metadata, such as GitHub, as the source of truth for what constitutes
a fork. These ''forge forks'' however can only identify as forks repositories
that have been created on the platform, e.g., by clicking a ''fork'' button on
the platform user interface. The increased diversity in code hosting platforms
(e.g., GitLab) and the habits of significant development communities (e.g., the
Linux kernel, which is not primarily hosted on any single platform) call into
question the reliability of trusting code hosting platforms to identify forks.
Doing so might introduce selection and methodological biases in empirical
studies. In this article we explore various definitions of ''software forks'',
trying to capture forking workflows that exist in the real world. We quantify
the differences in how many repositories would be identified as forks on GitHub
according to the various definitions, confirming that a significant number
could be overlooked by only considering forge forks. We study the structure and
size of fork networks , observing how they are affected by the proposed
definitions and discuss the potential impact on empirical research.
","[{'version': 'v1', 'created': 'Mon, 16 Nov 2020 09:48:14 GMT'}]",2020-11-17,"[['Pietri', 'Antoine', '', 'DGD-I'], ['Rousseau', 'Guillaume', '', 'UP, DGD-I'], ['Zacchiroli', 'Stefano', '', 'UP, DGD-I']]","['software evolution', 'source code', 'software fork', 'open source', 'freesoftware', 'version control system']"
5854,1903.06142,Silvio Peroni,"Silvio Peroni, Paolo Ciancarini, Aldo Gangemi, Andrea Giovanni
  Nuzzolese, Francesco Poggi, Valentina Presutti",The practice of self-citations: a longitudinal study,,,10.1007/s11192-020-03397-6,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, we discuss the outcomes of an experiment where we analysed
whether and to what extent the introduction, in 2012, of the new research
assessment exercise in Italy (a.k.a. Italian Scientific Habilitation) affected
self-citation behaviours in the Italian research community. The Italian
Scientific Habilitation attests to the scientific maturity of researchers and
in Italy, as in many other countries, is a requirement for accessing to a
professorship. To this end, we obtained from ScienceDirect 35,673 articles
published from 1957 and 2016 by the participants to the 2012 Italian Scientific
Habilitation, that resulted in the extraction of 1,379,050 citations retrieved
through Semantic Publishing technologies. Our analysis showed an overall
increment in author self-citations (i.e. where the citing article and the cited
article share at least one author) in several of the 24 academic disciplines
considered. However, we depicted a stronger causal relation between such
increment and the rules introduced by the 2012 Italian Scientific Habilitation
in 10 out of 24 disciplines analysed.
","[{'version': 'v1', 'created': 'Thu, 14 Mar 2019 17:40:51 GMT'}, {'version': 'v2', 'created': 'Sat, 10 Aug 2019 14:20:47 GMT'}, {'version': 'v3', 'created': 'Wed, 19 Feb 2020 12:16:14 GMT'}]",2020-02-20,"[['Peroni', 'Silvio', ''], ['Ciancarini', 'Paolo', ''], ['Gangemi', 'Aldo', ''], ['Nuzzolese', 'Andrea Giovanni', ''], ['Poggi', 'Francesco', ''], ['Presutti', 'Valentina', '']]","['author self-citations', 'author network self-citations', 'self-citations', 'RDF', 'Semantic Publishing   Article Highlights']"
5855,2007.02200,Benyamin Ghojogh,"Milad Sikaroudi, Benyamin Ghojogh, Amir Safarpoor, Fakhri Karray, Mark
  Crowley, H.R. Tizhoosh","Offline versus Online Triplet Mining based on Extreme Distances of
  Histopathology Patches","Accepted for presentation at the 15th International Symposium on
  Visual Computing (ISVC) 2020, Springer. v2: corrected a small mathematical
  typo","15th International Symposium on Visual Computing (ISVC), pp.
  333-345, Springer, 2020",10.1007/978-3-030-64556-4_26,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze the effect of offline and online triplet mining for colorectal
cancer (CRC) histopathology dataset containing 100,000 patches. We consider the
extreme, i.e., farthest and nearest patches to a given anchor, both in online
and offline mining. While many works focus solely on selecting the triplets
online (batch-wise), we also study the effect of extreme distances and neighbor
patches before training in an offline fashion. We analyze extreme cases'
impacts in terms of embedding distance for offline versus online mining,
including easy positive, batch semi-hard, batch hard triplet mining,
neighborhood component analysis loss, its proxy version, and distance weighted
sampling. We also investigate online approaches based on extreme distance and
comprehensively compare offline, and online mining performance based on the
data patterns and explain offline mining as a tractable generalization of the
online mining with large mini-batch size. As well, we discuss the relations of
different colorectal tissue types in terms of extreme distances. We found that
offline and online mining approaches have comparable performances for a
specific architecture, such as ResNet-18 in this study. Moreover, we found the
assorted case, including different extreme distances, is promising, especially
in the online approach.
","[{'version': 'v1', 'created': 'Sat, 4 Jul 2020 22:33:08 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Sep 2020 15:17:03 GMT'}, {'version': 'v3', 'created': 'Wed, 10 Aug 2022 05:39:56 GMT'}]",2022-08-11,"[['Sikaroudi', 'Milad', ''], ['Ghojogh', 'Benyamin', ''], ['Safarpoor', 'Amir', ''], ['Karray', 'Fakhri', ''], ['Crowley', 'Mark', ''], ['Tizhoosh', 'H. R.', '']]","['Histopathology', 'Triplet mining', 'Extreme distances', 'Onlinemining', 'Offline mining', 'Triplet network']"
5856,2010.11711,Yingheng Wang,"Yingheng Wang, Yaosen Min, Xin Chen, Ji Wu","Multi-view Graph Contrastive Representation Learning for Drug-Drug
  Interaction Prediction",In Proceedings of the Web Conference 2021 (WWW '21),,10.1145/3442381.3449786,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Drug-drug interaction(DDI) prediction is an important task in the medical
health machine learning community. This study presents a new method, multi-view
graph contrastive representation learning for drug-drug interaction prediction,
MIRACLE for brevity, to capture inter-view molecule structure and intra-view
interactions between molecules simultaneously. MIRACLE treats a DDI network as
a multi-view graph where each node in the interaction graph itself is a drug
molecular graph instance. We use GCNs and bond-aware attentive message passing
networks to encode DDI relationships and drug molecular graphs in the MIRACLE
learning stage, respectively. Also, we propose a novel unsupervised contrastive
learning component to balance and integrate the multi-view information.
Comprehensive experiments on multiple real datasets show that MIRACLE
outperforms the state-of-the-art DDI prediction models consistently.
","[{'version': 'v1', 'created': 'Thu, 22 Oct 2020 13:37:19 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Dec 2020 11:28:24 GMT'}, {'version': 'v3', 'created': 'Sat, 10 Apr 2021 08:30:57 GMT'}]",2021-04-13,"[['Wang', 'Yingheng', ''], ['Min', 'Yaosen', ''], ['Chen', 'Xin', ''], ['Wu', 'Ji', '']]","['multi-view graph', 'contrastive learning', 'link prediction', 'graph embedding']"
5857,2201.10295,Sebastian Bordt,"Sebastian Bordt, Mich\`ele Finck, Eric Raidl, Ulrike von Luxburg","Post-Hoc Explanations Fail to Achieve their Purpose in Adversarial
  Contexts",FAccT 2022,,10.1145/3531146.3533153,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing and planned legislation stipulates various obligations to provide
information about machine learning algorithms and their functioning, often
interpreted as obligations to ""explain"". Many researchers suggest using
post-hoc explanation algorithms for this purpose. In this paper, we combine
legal, philosophical and technical arguments to show that post-hoc explanation
algorithms are unsuitable to achieve the law's objectives. Indeed, most
situations where explanations are requested are adversarial, meaning that the
explanation provider and receiver have opposing interests and incentives, so
that the provider might manipulate the explanation for her own ends. We show
that this fundamental conflict cannot be resolved because of the high degree of
ambiguity of post-hoc explanations in realistic application scenarios. As a
consequence, post-hoc explanation algorithms are unsuitable to achieve the
transparency objectives inherent to the legal norms. Instead, there is a need
to more explicitly discuss the objectives underlying ""explainability""
obligations as these can often be better achieved through other mechanisms.
There is an urgent need for a more open and honest discussion regarding the
potential and limitations of post-hoc explanations in adversarial contexts, in
particular in light of the current negotiations of the European Union's draft
Artificial Intelligence Act.
","[{'version': 'v1', 'created': 'Tue, 25 Jan 2022 13:12:02 GMT'}, {'version': 'v2', 'created': 'Tue, 10 May 2022 21:43:22 GMT'}]",2022-05-12,"[['Bordt', 'Sebastian', ''], ['Finck', 'Michèle', ''], ['Raidl', 'Eric', ''], ['von Luxburg', 'Ulrike', '']]","['Explainability', 'Transparency', 'Regulation', 'Artificial Intelligence Act', 'GDPR', 'Counterfactual Explanations', 'SHAP', 'LIME']"
5858,1902.04738,Emery Berger,"Bobby Powers, David Tench, Emery D. Berger, Andrew McGregor",Mesh: Compacting Memory Management for C/C++ Applications,"Draft version, accepted at PLDI 2019",,10.1145/3314221.3314582,,cs.PL cs.DS cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Programs written in C/C++ can suffer from serious memory fragmentation,
leading to low utilization of memory, degraded performance, and application
failure due to memory exhaustion. This paper introduces Mesh, a plug-in
replacement for malloc that, for the first time, eliminates fragmentation in
unmodified C/C++ applications. Mesh combines novel randomized algorithms with
widely-supported virtual memory operations to provably reduce fragmentation,
breaking the classical Robson bounds with high probability. Mesh generally
matches the runtime performance of state-of-the-art memory allocators while
reducing memory consumption; in particular, it reduces the memory of
consumption of Firefox by 16% and Redis by 39%.
","[{'version': 'v1', 'created': 'Wed, 13 Feb 2019 04:40:05 GMT'}, {'version': 'v2', 'created': 'Sat, 16 Feb 2019 19:03:03 GMT'}]",2020-04-30,"[['Powers', 'Bobby', ''], ['Tench', 'David', ''], ['Berger', 'Emery D.', ''], ['McGregor', 'Andrew', '']]","['Memory management', 'runtime systems', 'unmanaged languages']"
5859,2206.08705,Charles Wan,"Charles Wan, Rodrigo Belo, Leid Zejnilovi\'c","Explainability's Gain is Optimality's Loss? -- How Explanations Bias
  Decision-making","To appear in the Proceedings of the 2022 AAAI/ACM Conference on AI,
  Ethics, and Society (AIES '22)",,10.1145/3514094.3534156,,cs.HC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Decisions in organizations are about evaluating alternatives and choosing the
one that would best serve organizational goals. To the extent that the
evaluation of alternatives could be formulated as a predictive task with
appropriate metrics, machine learning algorithms are increasingly being used to
improve the efficiency of the process. Explanations help to facilitate
communication between the algorithm and the human decision-maker, making it
easier for the latter to interpret and make decisions on the basis of
predictions by the former. Feature-based explanations' semantics of causal
models, however, induce leakage from the decision-maker's prior beliefs. Our
findings from a field experiment demonstrate empirically how this leads to
confirmation bias and disparate impact on the decision-maker's confidence in
the predictions. Such differences can lead to sub-optimal and biased decision
outcomes.
","[{'version': 'v1', 'created': 'Fri, 17 Jun 2022 11:43:42 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jun 2022 14:48:16 GMT'}]",2022-06-30,"[['Wan', 'Charles', ''], ['Belo', 'Rodrigo', ''], ['Zejnilović', 'Leid', '']]","['explanations', 'bias', 'confirmation bias', 'decision-making', 'human causalreasoning', 'human-algorithm communication', 'semantics of explanations']"
5860,1506.05527,Kim-Kwang Raymond Choo,"Ben Martini, Quang Do, Kim-Kwang Raymond Choo","Conceptual evidence collection and analysis methodology for Android
  devices","in Cloud Security Ecosystem (Syngress, an Imprint of Elsevier), 2015",,10.1016/B978-0-12-801595-7.00014-8,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Android devices continue to grow in popularity and capability meaning the
need for a forensically sound evidence collection methodology for these devices
also increases. This chapter proposes a methodology for evidence collection and
analysis for Android devices that is, as far as practical, device agnostic.
Android devices may contain a significant amount of evidential data that could
be essential to a forensic practitioner in their investigations. However, the
retrieval of this data requires that the practitioner understand and utilize
techniques to analyze information collected from the device. The major
contribution of this research is an in-depth evidence collection and analysis
methodology for forensic practitioners.
","[{'version': 'v1', 'created': 'Thu, 18 Jun 2015 01:25:00 GMT'}]",2015-06-19,"[['Martini', 'Ben', ''], ['Do', 'Quang', ''], ['Choo', 'Kim-Kwang Raymond', '']]","['Android forensics', 'digital forensics', 'evidence collection', 'evidence analysis', 'mobile analysis', 'mobile forensics', 'mobile evidence']"
5861,1912.07618,Arjun Gupta,"Arjun Gupta, E. A. Huerta, Zhizhen Zhao and Issam Moussa","Deep Learning for Cardiologist-level Myocardial Infarction Detection in
  Electrocardiograms","Accepted to the European Medical and Biological Engineering
  Conference (EMBEC) 2020",,10.1007/978-3-030-64610-3_40,,cs.LG eess.SP physics.med-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Myocardial infarction is the leading cause of death worldwide. In this paper,
we design domain-inspired neural network models to detect myocardial
infarction. First, we study the contribution of various leads. This systematic
analysis, first of its kind in the literature, indicates that out of 15 ECG
leads, data from the v6, vz, and ii leads are critical to correctly identify
myocardial infarction. Second, we use this finding and adapt the ConvNetQuake
neural network model--originally designed to identify earthquakes--to attain
state-of-the-art classification results for myocardial infarction, achieving
$99.43\%$ classification accuracy on a record-wise split, and $97.83\%$
classification accuracy on a patient-wise split. These two results represent
cardiologist-level performance level for myocardial infarction detection after
feeding only 10 seconds of raw ECG data into our model. Third, we show that our
multi-ECG-channel neural network achieves cardiologist-level performance
without the need of any kind of manual feature extraction or data
pre-processing.
","[{'version': 'v1', 'created': 'Mon, 16 Dec 2019 19:00:03 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Aug 2020 05:07:12 GMT'}, {'version': 'v3', 'created': 'Mon, 21 Sep 2020 16:59:49 GMT'}]",2021-01-27,"[['Gupta', 'Arjun', ''], ['Huerta', 'E. A.', ''], ['Zhao', 'Zhizhen', ''], ['Moussa', 'Issam', '']]","['machine learning', 'signal processing', 'biomedical engineering']"
5862,2205.00132,Ziyue Wang,"Ziyue Wang, Aozhu Chen, Fan Hu and Xirong Li",Learn to Understand Negation in Video Retrieval,Accepted by ACMMM2022,,10.1145/3503161.3547968,,cs.MM cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Negation is a common linguistic skill that allows human to express what we do
NOT want. Naturally, one might expect video retrieval to support
natural-language queries with negation, e.g., finding shots of kids sitting on
the floor and not playing with a dog. However, the state-of-the-art deep
learning based video retrieval models lack such ability, as they are typically
trained on video description datasets such as MSR-VTT and VATEX that lack
negated descriptions. Their retrieved results basically ignore the negator in
the sample query, incorrectly returning videos showing kids playing with dog.
This paper presents the first study on learning to understand negation in video
retrieval and make contributions as follows. By re-purposing two existing
datasets (MSR-VTT and VATEX), we propose a new evaluation protocol for video
retrieval with negation. We propose a learning based method for training a
negation-aware video retrieval model. The key idea is to first construct a soft
negative caption for a specific training video by partially negating its
original caption, and then compute a bidirectionally constrained loss on the
triplet. This auxiliary loss is weightedly added to a standard retrieval loss.
Experiments on the re-purposed benchmarks show that re-training the CLIP
(Contrastive Language-Image Pre-Training) model by the proposed method clearly
improves its ability to handle queries with negation. In addition, the model
performance on the original benchmarks is also improved.
","[{'version': 'v1', 'created': 'Sat, 30 Apr 2022 02:22:18 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Jul 2022 11:51:28 GMT'}]",2022-07-14,"[['Wang', 'Ziyue', ''], ['Chen', 'Aozhu', ''], ['Hu', 'Fan', ''], ['Li', 'Xirong', '']]","['Text-to-video retrieval (T2VR)', 'nT2VR', 'negation learning']"
5863,1708.01636,Muaz Niazi,"Aisha D. Farooqui, Muaz A. Niazi",Game theory models for communication between agents: a review,"31 pages, 7 figures","Complex Adaptive Systems Modeling, 4(1), 13. (2016)",10.1186/s40294-016-0026-7,,cs.GT cs.AI cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the real world, agents or entities are in a continuous state of
interactions. These inter- actions lead to various types of complexity
dynamics. One key difficulty in the study of complex agent interactions is the
difficulty of modeling agent communication on the basis of rewards. Game theory
offers a perspective of analysis and modeling these interactions. Previously,
while a large amount of literature is available on game theory, most of it is
from specific domains and does not cater for the concepts from an agent- based
perspective. Here in this paper, we present a comprehensive multidisciplinary
state-of-the-art review and taxonomy of game theory models of complex
interactions between agents.
","[{'version': 'v1', 'created': 'Fri, 4 Aug 2017 18:37:27 GMT'}]",2017-08-08,"[['Farooqui', 'Aisha D.', ''], ['Niazi', 'Muaz A.', '']]","['Game theory applications', 'Agent-based approach', 'Complex adaptive systems', 'Complex systems modeling', 'Complex networks', 'Economics']"
5864,1403.0461,Francesco Santini,"Stefano Bistarelli, Maurizio Gabbrielli, Maria Chiara Meo, Francesco
  Santini","Timed Soft Concurrent Constraint Programs: An Interleaved and a Parallel
  Approach",,Theory and Practice of Logic Programming 15 (2014) 743-782,10.1017/S1471068414000106,,cs.PL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a timed and soft extension of Concurrent Constraint Programming.
The time extension is based on the hypothesis of bounded asynchrony: the
computation takes a bounded period of time and is measured by a discrete global
clock. Action prefixing is then considered as the syntactic marker which
distinguishes a time instant from the next one. Supported by soft constraints
instead of crisp ones, tell and ask agents are now equipped with a preference
(or consistency) threshold which is used to determine their success or
suspension. In the paper we provide a language to describe the agents behavior,
together with its operational and denotational semantics, for which we also
prove the compositionality and correctness properties. After presenting a
semantics using maximal parallelism of actions, we also describe a version for
their interleaving on a single processor (with maximal parallelism for time
elapsing). Coordinating agents that need to take decisions both on preference
values and time events may benefit from this language. To appear in Theory and
Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Mon, 24 Feb 2014 12:23:38 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Apr 2014 09:08:34 GMT'}]",2015-10-07,"[['Bistarelli', 'Stefano', ''], ['Gabbrielli', 'Maurizio', ''], ['Meo', 'Maria Chiara', ''], ['Santini', 'Francesco', '']]","['Soft Concurrent Constraint Programming', 'Timed Concurrent ConstraintProgramming', 'Interleaving', 'Parallelism']"
5865,2005.11949,Yunfei Yang,"Yunfei Yang, Zhen Li, Yang Wang",Approximation in shift-invariant spaces with deep ReLU neural networks,,,10.1016/j.neunet.2022.06.013,,cs.LG cs.NA math.NA stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the expressive power of deep ReLU neural networks for approximating
functions in dilated shift-invariant spaces, which are widely used in signal
processing, image processing, communications and so on. Approximation error
bounds are estimated with respect to the width and depth of neural networks.
The network construction is based on the bit extraction and data-fitting
capacity of deep neural networks. As applications of our main results, the
approximation rates of classical function spaces such as Sobolev spaces and
Besov spaces are obtained. We also give lower bounds of the $L^p (1\le p \le
\infty)$ approximation error for Sobolev spaces, which show that our
construction of neural network is asymptotically optimal up to a logarithmic
factor.
","[{'version': 'v1', 'created': 'Mon, 25 May 2020 07:23:47 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Jun 2021 08:47:13 GMT'}, {'version': 'v3', 'created': 'Sun, 19 Jun 2022 07:13:05 GMT'}]",2022-06-22,"[['Yang', 'Yunfei', ''], ['Li', 'Zhen', ''], ['Wang', 'Yang', '']]","['deep neural networks', 'approximation complexity', 'shift-invariant spaces', 'Sobolev spaces', 'Besov spaces']"
5866,2206.13981,Lovedeep Singh,Lovedeep Singh,Hybrid Ensemble for Fake News Detection: An attempt,,,10.1007/978-981-16-2641-8_10,,cs.CL cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Fake News Detection has been a challenging problem in the field of Machine
Learning. Researchers have approached it via several techniques using old
Statistical Classification models and modern Deep Learning. Today, with the
growing amount of data, developments in the field of NLP and ML, and an
increase in the computation power at disposal, there are infinite permutations
and combinations to approach this problem from a different perspective. In this
paper, we try different methods to tackle Fake News, and try to build, and
propose the possibilities of a Hybrid Ensemble combining the classical Machine
Learning techniques with the modern Deep Learning Approaches
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2022 01:34:38 GMT'}]",2022-06-29,"[['Singh', 'Lovedeep', '']]","['Fake News Detection', 'NLP', 'Ensemble Techniques']"
5867,2108.06575,Mengkun She,"Mengkun She, David Nakath, Yifan Song, Kevin K\""oser",Refractive Geometry for Underwater Domes,"47 pages, 18 figures",ISPRS Journal of Photogrammetry and Remote Sensing 2022,10.1016/j.isprsjprs.2021.11.006.,ISSN 0924-2716,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Underwater cameras are typically placed behind glass windows to protect them
from the water. Spherical glass, a dome port, is well suited for high water
pressures at great depth, allows for a large field of view, and avoids
refraction if a pinhole camera is positioned exactly at the sphere's center.
Adjusting a real lens perfectly to the dome center is a challenging task, both
in terms of how to actually guide the centering process (e.g. visual servoing)
and how to measure the alignment quality, but also, how to mechanically perform
the alignment. Consequently, such systems are prone to being decentered by some
offset, leading to challenging refraction patterns at the sphere that
invalidate the pinhole camera model. We show that the overall camera system
becomes an axial camera, even for thick domes as used for deep sea exploration
and provide a non-iterative way to compute the center of refraction without
requiring knowledge of exact air, glass or water properties. We also analyze
the refractive geometry at the sphere, looking at effects such as forward- vs.
backward decentering, iso-refraction curves and obtain a 6th-degree polynomial
equation for forward projection of 3D points in thin domes. We then propose a
pure underwater calibration procedure to estimate the decentering from multiple
images. This estimate can either be used during adjustment to guide the
mechanical position of the lens, or can be considered in photogrammetric
underwater applications.
","[{'version': 'v1', 'created': 'Sat, 14 Aug 2021 16:19:11 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Sep 2021 08:42:15 GMT'}]",2021-12-15,"[['She', 'Mengkun', ''], ['Nakath', 'David', ''], ['Song', 'Yifan', ''], ['Köser', 'Kevin', '']]","['Underwater camera', 'Dome port', 'Refraction', 'Spherical refractive']"
5868,2202.06689,Maliheh Izadi,"Maliheh Izadi, Roberta Gismondi, Georgios Gousios","CodeFill: Multi-token Code Completion by Jointly Learning from Structure
  and Naming Sequences","To appear in the proceedings of the 44th International Conference on
  Software Engineering (ICSE 2022)",,10.1145/3510003.3510172,,cs.SE cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Code completion is an essential feature of IDEs, yet current autocompleters
are restricted to either grammar-based or NLP-based single token completions.
Both approaches have significant drawbacks: grammar-based autocompletion is
restricted in dynamically-typed language environments, whereas NLP-based
autocompleters struggle to understand the semantics of the programming language
and the developer's code context.
  In this work, we present CodeFill, a language model for autocompletion that
combines learned structure and naming information. Using a parallel Transformer
architecture and multi-task learning, CodeFill consumes sequences of source
code token names and their equivalent AST token types. Uniquely, CodeFill is
trained both for single-token and multi-token (statement) prediction, which
enables it to learn long-range dependencies among grammatical and naming
elements. We train CodeFill on two datasets, consisting of 29M and 425M lines
of code, respectively. To make the evaluation more realistic, we develop a
method to automatically infer points in the source code at which completion
matters. We compare CodeFill against four baselines and two state-of-the-art
models, GPT-C and TravTrans+.CodeFill surpasses all baselines in single token
prediction (MRR: 70.9% vs. 66.2% and 67.8%) and outperforms the state of the
art for multi-token prediction (ROUGE-L: 63.7% vs. 52.4% and 59.2%, for n=4
tokens). We publicly release our source code and datasets.
","[{'version': 'v1', 'created': 'Mon, 14 Feb 2022 13:26:54 GMT'}]",2022-02-15,"[['Izadi', 'Maliheh', ''], ['Gismondi', 'Roberta', ''], ['Gousios', 'Georgios', '']]","['Automatic Code Completion', 'Transformers', 'Multi-Task Learning', 'Types', 'Dynamically-typed Languages']"
5869,2111.04879,Stefan Heindorf,"Stefan Heindorf, Lukas Bl\""ubaum, Nick D\""usterhus, Till Werner, Varun
  Nandkumar Golani, Caglar Demir, Axel-Cyrille Ngonga Ngomo",EvoLearner: Learning Description Logics with Evolutionary Algorithms,Accepted at WWW 2022,,10.1145/3485447.3511925,,cs.AI cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classifying nodes in knowledge graphs is an important task, e.g., for
predicting missing types of entities, predicting which molecules cause cancer,
or predicting which drugs are promising treatment candidates. While black-box
models often achieve high predictive performance, they are only post-hoc and
locally explainable and do not allow the learned model to be easily enriched
with domain knowledge. Towards this end, learning description logic concepts
from positive and negative examples has been proposed. However, learning such
concepts often takes a long time and state-of-the-art approaches provide
limited support for literal data values, although they are crucial for many
applications. In this paper, we propose EvoLearner - an evolutionary approach
to learn concepts in ALCQ(D), which is the attributive language with complement
(ALC) paired with qualified cardinality restrictions (Q) and data properties
(D). We contribute a novel initialization method for the initial population:
starting from positive examples, we perform biased random walks and translate
them to description logic concepts. Moreover, we improve support for data
properties by maximizing information gain when deciding where to split the
data. We show that our approach significantly outperforms the state of the art
on the benchmarking framework SML-Bench for structured machine learning. Our
ablation study confirms that this is due to our novel initialization method and
support for data properties.
","[{'version': 'v1', 'created': 'Mon, 8 Nov 2021 23:47:39 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Mar 2022 19:03:38 GMT'}]",2022-03-10,"[['Heindorf', 'Stefan', ''], ['Blübaum', 'Lukas', ''], ['Düsterhus', 'Nick', ''], ['Werner', 'Till', ''], ['Golani', 'Varun Nandkumar', ''], ['Demir', 'Caglar', ''], ['Ngomo', 'Axel-Cyrille Ngonga', '']]","['Description Logics', 'Evolutionary Algorithms', 'Machine Learning']"
5870,2204.01438,Larissa Chazette,"Larissa Chazette, Jil Kl\""under, Merve Balci and Kurt Schneider","How Can We Develop Explainable Systems? Insights from a Literature
  Review and an Interview Study",,,10.1145/3529320.3529321,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quality aspects such as ethics, fairness, and transparency have been proven
to be essential for trustworthy software systems. Explainability has been
identified not only as a means to achieve all these three aspects in systems,
but also as a way to foster users' sentiments of trust. Despite this, research
has only marginally focused on the activities and practices to develop
explainable systems. To close this gap, we recommend six core activities and
associated practices for the development of explainable systems based on the
results of a literature review and an interview study. First, we identified and
summarized activities and corresponding practices in the literature. To
complement these findings, we conducted interviews with 19 industry
professionals who provided recommendations for the development process of
explainable systems and reviewed the activities and practices based on their
expertise and knowledge. We compared and combined the findings of the
interviews and the literature review to recommend the activities and assess
their applicability in industry. Our findings demonstrate that the activities
and practices are not only feasible, but can also be integrated in different
development processes.
","[{'version': 'v1', 'created': 'Mon, 4 Apr 2022 12:43:26 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Apr 2022 18:50:16 GMT'}]",2022-04-08,"[['Chazette', 'Larissa', ''], ['Klünder', 'Jil', ''], ['Balci', 'Merve', ''], ['Schneider', 'Kurt', '']]","['explainability', 'explainable systems', 'software process', 'interviewstudy']"
5871,2006.07674,Andr\'es Ezequiel Viso,"Alexis Mart\'in, Alejandro R\'ios, Andr\'es Viso",Pure Pattern Calculus \`a la de Bruijn,,,10.1016/j.entcs.2020.08.006,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is well-known in the field of programming languages that dealing with
variable names and binders may lead to conflicts such as undesired captures
when implementing interpreters or compilers. This situation has been overcome
by resorting to de Bruijn indices for calculi where binders capture only one
variable name, like the $\lambda$-calculus. The advantage of this approach
relies on the fact that so-called $\alpha$-equivalence becomes syntactical
equality when working with indices.
  In recent years pattern calculi have gained considerable attention given
their expressiveness. They turn out to be notoriously convenient to study the
foundations of modern functional programming languages modeling features like
pattern matching, path polymorphism, pattern polymorphism, etc. However, the
literature falls short when it comes to dealing with $\alpha$-conversion and
binders capturing simultaneously several variable names. Such is the case of
the Pure Pattern Calculus (PPC): a natural extension of $\lambda$-calculus that
allows to abstract virtually any term.
  This paper extends de Bruijn's ideas to properly overcome the multi-binding
problem by introducing a novel presentation of PPC with bidimensional indices,
in an effort to implement a prototype for a typed functional programming
language based on PPC that captures path polymorphism.
","[{'version': 'v1', 'created': 'Sat, 13 Jun 2020 16:27:35 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Jun 2020 20:20:18 GMT'}]",2021-10-29,"[['Martín', 'Alexis', ''], ['Ríos', 'Alejandro', ''], ['Viso', 'Andrés', '']]","['de Bruijn indices', 'pattern calculi', 'pattern matching', 'α-equivalence']"
5872,2208.05707,Pino Caballero-Gil,"Mois\'es Lodeiro-Santiago, Pino Caballero-Gil, C\'andido
  Caballero-Gil, F\'elix Herrera Priano","Improving Tourist Experience Through an IoT Application Based on
  FatBeacons",,"International Conference on Ubiquitous Computing and Ambient
  Intelligence, pp. 149-160, 2017",10.1007/978-3-319-67585-5_16,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper describes the use of a new extension of the Bluetooth connection
protocol, called FatBeacon, which faces the problem of obtaining information
where no Internet connection is available. Rather than advertising a URL to
load a web page, the FatBeacon protocol has the ability to broadcast any basic
web contents actually hosted on the device. In particular, FatBeacons are here
used to improve the tourist experience in places with no Internet coverage
through a new application of the Internet of Things (IoT). Thanks to the fact
that the web content is emitted by the own FatBeacon, any smartphone with
Bluetooth Low Energy (BLE) can be used to receive touristic information, even
in uncovered areas, such as rural or mountain destinations. This work does not
only show the applicability of the new FatBeacon protocol, but it also presents
a performance comparison of different BLE technologies used for similar
touristic applications.
","[{'version': 'v1', 'created': 'Thu, 11 Aug 2022 09:08:03 GMT'}]",2022-08-12,"[['Lodeiro-Santiago', 'Moisés', ''], ['Caballero-Gil', 'Pino', ''], ['Caballero-Gil', 'Cándido', ''], ['Priano', 'Félix Herrera', '']]","['Bluetooth Low Energy', 'FatBeacon', 'IoT', 'Tourism', 'Point of Interest']"
5873,2102.01391,Bjarne Grimstad,"Bjarne Grimstad, Mathilde Hotvedt, Anders T. Sandnes, Odd
  Kolbj{\o}rnsen, Lars S. Imsland",Bayesian Neural Networks for Virtual Flow Metering: An Empirical Study,"34 pages, 11 figures","Applied Soft Computing, Volume 112, 2021",10.1016/j.asoc.2021.107776,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent works have presented promising results from the application of machine
learning (ML) to the modeling of flow rates in oil and gas wells. Encouraging
results and advantageous properties of ML models, such as computationally cheap
evaluation and ease of calibration to new data, have sparked optimism for the
development of data-driven virtual flow meters (VFMs). Data-driven VFMs are
developed in the small data regime, where it is important to question the
uncertainty and robustness of models. The modeling of uncertainty may help to
build trust in models, which is a prerequisite for industrial applications. The
contribution of this paper is the introduction of a probabilistic VFM based on
Bayesian neural networks. Uncertainty in the model and measurements is
described, and the paper shows how to perform approximate Bayesian inference
using variational inference. The method is studied by modeling on a large and
heterogeneous dataset, consisting of 60 wells across five different oil and gas
assets. The predictive performance is analyzed on historical and future test
data, where an average error of 4-6% and 8-13% is achieved for the 50% best
performing models, respectively. Variational inference appears to provide more
robust predictions than the reference approach on future data. Prediction
performance and uncertainty calibration is explored in detail and discussed in
light of four data challenges. The findings motivate the development of
alternative strategies to improve the robustness of data-driven VFMs.
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2021 09:05:19 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Apr 2021 07:02:25 GMT'}, {'version': 'v3', 'created': 'Sun, 13 Jun 2021 09:20:25 GMT'}]",2022-01-10,"[['Grimstad', 'Bjarne', ''], ['Hotvedt', 'Mathilde', ''], ['Sandnes', 'Anders T.', ''], ['Kolbjørnsen', 'Odd', ''], ['Imsland', 'Lars S.', '']]","['Neural Network', 'Bayesian Inference', 'Variational Inference', 'VirtualFlow Metering', 'Heteroscedasticity']"
5874,2109.05729,Yunfan Shao,"Yunfan Shao, Zhichao Geng, Yitao Liu, Junqi Dai, Hang Yan, Fei Yang,
  Li Zhe, Hujun Bao, Xipeng Qiu","CPT: A Pre-Trained Unbalanced Transformer for Both Chinese Language
  Understanding and Generation",Code is available at https://github.com/fastnlp/CPT,,10.1007/s11432-021-3536-5,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we take the advantage of previous pre-trained models (PTMs)
and propose a novel Chinese Pre-trained Unbalanced Transformer (CPT). Different
from previous Chinese PTMs, CPT is designed to utilize the shared knowledge
between natural language understanding (NLU) and natural language generation
(NLG) to boost the performance. CPT consists of three parts: a shared encoder,
an understanding decoder, and a generation decoder. Two specific decoders with
a shared encoder are pre-trained with masked language modeling (MLM) and
denoising auto-encoding (DAE) tasks, respectively. With the partially shared
architecture and multi-task pre-training, CPT can (1) learn specific knowledge
of both NLU or NLG tasks with two decoders and (2) be fine-tuned flexibly that
fully exploits the potential of the model. Moreover, the unbalanced Transformer
saves the computational and storage cost, which makes CPT competitive and
greatly accelerates the inference of text generation. Experimental results on a
wide range of Chinese NLU and NLG tasks show the effectiveness of CPT.
","[{'version': 'v1', 'created': 'Mon, 13 Sep 2021 06:25:45 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Sep 2021 08:35:14 GMT'}, {'version': 'v3', 'created': 'Fri, 8 Oct 2021 13:22:19 GMT'}, {'version': 'v4', 'created': 'Mon, 18 Jul 2022 08:19:30 GMT'}]",2022-07-19,"[['Shao', 'Yunfan', ''], ['Geng', 'Zhichao', ''], ['Liu', 'Yitao', ''], ['Dai', 'Junqi', ''], ['Yan', 'Hang', ''], ['Yang', 'Fei', ''], ['Zhe', 'Li', ''], ['Bao', 'Hujun', ''], ['Qiu', 'Xipeng', '']]","['pre-trained model', 'transformer', 'language model', 'generation', 'unified model']"
5875,2010.13702,Haiguang Liao,"Haiguang Liao, Qingyi Dong, Weiyi Qi, Elias Fallon, Levent Burak Kara","Track-Assignment Detailed Routing Using Attention-based Policy Model
  With Supervision",,,10.1145/3380446.3430629,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detailed routing is one of the most critical steps in analog circuit design.
Complete routing has become increasingly more challenging in advanced node
analog circuits, making advances in efficient automatic routers ever more
necessary. In this work, we propose a machine learning driven method for
solving the track-assignment detailed routing problem for advanced node analog
circuits. Our approach adopts an attention-based reinforcement learning (RL)
policy model. Our main insight and advancement over this RL model is the use of
supervision as a way to leverage solutions generated by a conventional genetic
algorithm (GA). For this, our approach minimizes the Kullback-Leibler
divergence loss between the output from the RL policy model and a solution
distribution obtained from the genetic solver. The key advantage of this
approach is that the router can learn a policy in an offline setting with
supervision, while improving the run-time performance nearly 100x over the
genetic solver. Moreover, the quality of the solutions our approach produces
matches well with those generated by GA. We show that especially for complex
problems, our supervised RL method provides good quality solution similar to
conventional attention-based RL without comprising run time performance. The
ability to learn from example designs and train the router to get similar
solutions with orders of magnitude run-time improvement can impact the design
flow dramatically, potentially enabling increased design exploration and
routability-driven placement.
","[{'version': 'v1', 'created': 'Mon, 26 Oct 2020 16:40:11 GMT'}]",2020-10-27,"[['Liao', 'Haiguang', ''], ['Dong', 'Qingyi', ''], ['Qi', 'Weiyi', ''], ['Fallon', 'Elias', ''], ['Kara', 'Levent Burak', '']]","['reinforcement learning', 'supervised learning', 'policy model', 'detailedrouting']"
5876,2203.12472,Tao Chen,Tao Chen,Planning Landscape Analysis for Self-Adaptive Systems,"The paper has been accepted by the 17th International Symposium on
  Software Engineering for Adaptive and Self-Managing Systems, SEAMS'22, 2022",,10.1145/3524844.3528060,,cs.SE cs.AI,http://creativecommons.org/licenses/by/4.0/,"  To assure performance on the fly, planning is arguably one of the most
important steps for self-adaptive systems (SASs), especially when they are
highly configurable with a daunting number of adaptation options. However,
there has been little understanding of the planning landscape or ways by which
it can be analyzed. This inevitably creates barriers to the design of better
and tailored planners for SASs. In this paper, we showcase how the planning
landscapes of SASs can be quantified and reasoned, particularly with respect to
the different environments. By studying four diverse real-world SASs and 14
environments, we found that (1) the SAS planning landscapes often provide
strong guidance to the planner, but their ruggedness and multi-modality can be
the major obstacle; (2) the extents of guidance and number of global/local
optima are sensitive to the changing environment, but not the ruggedness of the
surface; (3) the local optima are often closer to the global optimum than other
random points; and (4) there are considerable (and useful) overlaps on the
global/local optima between landscapes under different environments. We then
discuss the potential implications to the future work of planner designs for
SASs.
","[{'version': 'v1', 'created': 'Wed, 23 Mar 2022 15:10:06 GMT'}]",2022-03-24,"[['Chen', 'Tao', '']]","['Self-adaptive system', 'configuration tuning', 'planning', 'performanceoptimization', 'search-based software engineering', 'landscape']"
5877,2106.11762,A K M Nuhil Mehdy,"A K M Nuhil Mehdy, Hoda Mehrpouyan","Modeling of Personalized Privacy Disclosure Behavior: A Formal Method
  Approach",,,10.1145/3465481.3470102,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to create user-centric and personalized privacy management tools,
the underlying models must account for individual users' privacy expectations,
preferences, and their ability to control their information sharing activities.
Existing studies of users' privacy behavior modeling attempt to frame the
problem from a request's perspective, which lack the crucial involvement of the
information owner, resulting in limited or no control of policy management.
Moreover, very few of them take into the consideration the aspect of
correctness, explainability, usability, and acceptance of the methodologies for
each user of the system. In this paper, we present a methodology to formally
model, validate, and verify personalized privacy disclosure behavior based on
the analysis of the user's situational decision-making process. We use a model
checking tool named UPPAAL to represent users' self-reported privacy disclosure
behavior by an extended form of finite state automata (FSA), and perform
reachability analysis for the verification of privacy properties through
computation tree logic (CTL) formulas. We also describe the practical use cases
of the methodology depicting the potential of formal technique towards the
design and development of user-centric behavioral modeling. This paper, through
extensive amounts of experimental outcomes, contributes several insights to the
area of formal methods and user-tailored privacy behavior modeling.
","[{'version': 'v1', 'created': 'Fri, 18 Jun 2021 09:56:48 GMT'}]",2021-06-23,"[['Mehdy', 'A K M Nuhil', ''], ['Mehrpouyan', 'Hoda', '']]","['behavioral analysis', 'user behavior modeling', 'privacy', 'security', 'formal methods']"
5878,1905.09520,Katherine Cordwell,Katherine Cordwell and Andr\'e Platzer,Towards Physical Hybrid Systems,CADE 2019,,10.1007/978-3-030-29436-6_13,,cs.LO cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Some hybrid systems models are unsafe for mathematically correct but
physically unrealistic reasons. For example, mathematical models can classify a
system as being unsafe on a set that is too small to have physical importance.
In particular, differences in measure zero sets in models of cyber-physical
systems (CPS) have significant mathematical impact on the mathematical safety
of these models even though differences on measure zero sets have no tangible
physical effect in a real system. We develop the concept of ""physical hybrid
systems"" (PHS) to help reunite mathematical models with physical reality. We
modify a hybrid systems logic (differential temporal dynamic logic) by adding a
first-class operator to elide distinctions on measure zero sets of time within
CPS models. This approach facilitates modeling since it admits the verification
of a wider class of models, including some physically realistic models that
would otherwise be classified as mathematically unsafe. We also develop a proof
calculus to help with the verification of PHS.
","[{'version': 'v1', 'created': 'Thu, 23 May 2019 08:00:17 GMT'}, {'version': 'v2', 'created': 'Sat, 14 Sep 2019 14:35:09 GMT'}]",2019-09-17,"[['Cordwell', 'Katherine', ''], ['Platzer', 'André', '']]","['hybrid systems', 'almost everywhere', 'differential temporal dynamic logic', 'proofcalculus']"
5879,2202.05960,Haotian Li,"Haotian Li, Yong Wang, Aoyu Wu, Huan Wei, Huamin Qu",Structure-aware Visualization Retrieval,"Accepted to the 2022 CHI Conference on Human Factors in Computing
  Systems (CHI 22)",,10.1145/3491102.3502048,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the wide usage of data visualizations, a huge number of Scalable Vector
Graphic (SVG)-based visualizations have been created and shared online.
Accordingly, there has been an increasing interest in exploring how to retrieve
perceptually similar visualizations from a large corpus, since it can benefit
various downstream applications such as visualization recommendation. Existing
methods mainly focus on the visual appearance of visualizations by regarding
them as bitmap images. However, the structural information intrinsically
existing in SVG-based visualizations is ignored. Such structural information
can delineate the spatial and hierarchical relationship among visual elements,
and characterize visualizations thoroughly from a new perspective. This paper
presents a structure-aware method to advance the performance of visualization
retrieval by collectively considering both the visual and structural
information. We extensively evaluated our approach through quantitative
comparisons, a user study and case studies. The results demonstrate the
effectiveness of our approach and its advantages over existing methods.
","[{'version': 'v1', 'created': 'Sat, 12 Feb 2022 02:35:46 GMT'}]",2022-02-15,"[['Li', 'Haotian', ''], ['Wang', 'Yong', ''], ['Wu', 'Aoyu', ''], ['Wei', 'Huan', ''], ['Qu', 'Huamin', '']]","['Data Visualization', 'Visualization Retrieval', 'Visualization Similarity', 'Representation Learning', 'Visualization Embedding']"
5880,2105.02317,Candice Schumann,"Candice Schumann, Susanna Ricco, Utsav Prabhu, Vittorio Ferrari,
  Caroline Pantofaru",A Step Toward More Inclusive People Annotations for Fairness,,AIES (2021),10.1145/3461702.3462594,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The Open Images Dataset contains approximately 9 million images and is a
widely accepted dataset for computer vision research. As is common practice for
large datasets, the annotations are not exhaustive, with bounding boxes and
attribute labels for only a subset of the classes in each image. In this paper,
we present a new set of annotations on a subset of the Open Images dataset
called the MIAP (More Inclusive Annotations for People) subset, containing
bounding boxes and attributes for all of the people visible in those images.
The attributes and labeling methodology for the MIAP subset were designed to
enable research into model fairness. In addition, we analyze the original
annotation methodology for the person class and its subclasses, discussing the
resulting patterns in order to inform future annotation efforts. By considering
both the original and exhaustive annotation sets, researchers can also now
study how systematic patterns in training annotations affect modeling.
","[{'version': 'v1', 'created': 'Wed, 5 May 2021 20:44:56 GMT'}]",2021-05-07,"[['Schumann', 'Candice', ''], ['Ricco', 'Susanna', ''], ['Prabhu', 'Utsav', ''], ['Ferrari', 'Vittorio', ''], ['Pantofaru', 'Caroline', '']]","['datasets', 'fairness', 'computer vision']"
5881,2204.08758,Fangye Wang,"Fangye Wang, Yingxu Wang, Dongsheng Li, Hansu Gu, Tun Lu, Peng Zhang,
  Ning Gu","Enhancing CTR Prediction with Context-Aware Feature Representation
  Learning",SIGIR 2022,,10.1145/3477495.3531970,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CTR prediction has been widely used in the real world. Many methods model
feature interaction to improve their performance. However, most methods only
learn a fixed representation for each feature without considering the varying
importance of each feature under different contexts, resulting in inferior
performance. Recently, several methods tried to learn vector-level weights for
feature representations to address the fixed representation issue. However,
they only produce linear transformations to refine the fixed feature
representations, which are still not flexible enough to capture the varying
importance of each feature under different contexts. In this paper, we propose
a novel module named Feature Refinement Network (FRNet), which learns
context-aware feature representations at bit-level for each feature in
different contexts. FRNet consists of two key components: 1) Information
Extraction Unit (IEU), which captures contextual information and cross-feature
relationships to guide context-aware feature refinement; and 2) Complementary
Selection Gate (CSGate), which adaptively integrates the original and
complementary feature representations learned in IEU with bit-level weights.
Notably, FRNet is orthogonal to existing CTR methods and thus can be applied in
many existing methods to boost their performance. Comprehensive experiments are
conducted to verify the effectiveness, efficiency, and compatibility of FRNet.
","[{'version': 'v1', 'created': 'Tue, 19 Apr 2022 08:55:38 GMT'}]",2022-12-02,"[['Wang', 'Fangye', ''], ['Wang', 'Yingxu', ''], ['Li', 'Dongsheng', ''], ['Gu', 'Hansu', ''], ['Lu', 'Tun', ''], ['Zhang', 'Peng', ''], ['Gu', 'Ning', '']]","['Representation Learning', 'Feature Interaction', 'CTR Prediction']"
5882,2007.14195,Jan Stodt,"Jan Stodt, Christoph Reich","Data Confidentiality In P2P Communication And Smart Contracts Of
  Blockchain In Industry 4.0","10 pages, 4 figures","10th International Conference on Computer Science, Engineering and
  Applications (CCSEA 2020), July 25~26, 2020, London, United Kingdom",10.5121/csit.2020.101001,,cs.CR,http://creativecommons.org/licenses/by-sa/4.0/,"  Increased collaborative production and dynamic selection of production
partners within industry 4.0 manufacturing leads to ever-increasing automatic
data exchange between companies. Automatic and unsupervised data exchange
creates new attack vectors, which could be used by a malicious insider to leak
secrets via an otherwise considered secure channel without anyone noticing. In
this paper we reflect upon approaches to prevent the exposure of secret data
via blockchain technology, while also providing auditable proof of data
exchange. We show that previous blockchain based privacy protection approaches
offer protection, but give the control of the data to (potentially not
trustworthy) third parties, which also can be considered a privacy violation.
The approach taken in this paper is not utilize centralized data storage for
data. It realizes data confidentiality of P2P communication and data processing
in smart contracts of blockchains.
","[{'version': 'v1', 'created': 'Tue, 28 Jul 2020 13:23:15 GMT'}]",2020-07-29,"[['Stodt', 'Jan', ''], ['Reich', 'Christoph', '']]","['blockchain', 'privacy protection', 'P2P communication', 'smart contracts', 'industry 4']"
5883,2108.12303,Dorothee Henke,"Christoph Buchheim, Dorothee Henke, Jannik Irmai","The Stochastic Bilevel Continuous Knapsack Problem with Uncertain
  Follower's Objective","A preliminary version of parts of this article can be found in
  Section 8 of arXiv:1903.02810v2","Journal of Optimization Theory and Applications 194(2), 521-542
  (2022)",10.1007/s10957-022-02037-8,,cs.DS cs.DM math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a bilevel continuous knapsack problem where the leader controls
the capacity of the knapsack, while the follower chooses a feasible packing
maximizing his own profit. The leader's aim is to optimize a linear objective
function in the capacity and in the follower's solution, but with respect to
different item values. We address a stochastic version of this problem where
the follower's profits are uncertain from the leader's perspective, and only a
probability distribution is known. Assuming that the leader aims at optimizing
the expected value of her objective function, we first observe that the
stochastic problem is tractable as long as the possible scenarios are given
explicitly as part of the input, which also allows to deal with general
distributions using a sample average approximation. For the case of
independently and uniformly distributed item values, we show that the problem
is #P-hard in general, and the same is true even for evaluating the leader's
objective function. Nevertheless, we present pseudo-polynomial time algorithms
for this case, running in time linear in the total size of the items. Based on
this, we derive an additive approximation scheme for the general case of
independently distributed item values, which runs in pseudo-polynomial time.
","[{'version': 'v1', 'created': 'Fri, 27 Aug 2021 14:30:14 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Jul 2022 13:02:42 GMT'}]",2022-07-19,"[['Buchheim', 'Christoph', ''], ['Henke', 'Dorothee', ''], ['Irmai', 'Jannik', '']]","['bilevel optimization', 'stochastic optimization', 'complexity']"
5884,1911.03391,Abdallah Benzine,"Abdallah Benzine, Bertrand Luvison, Quoc Cuong Pham, Catherine Achard",Single-shot 3D multi-person pose estimation in complex images,,,10.1016/j.patcog.2020.107534,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a new single shot method for multi-person 3D human
pose estimation in complex images. The model jointly learns to locate the human
joints in the image, to estimate their 3D coordinates and to group these
predictions into full human skeletons. The proposed method deals with a
variable number of people and does not need bounding boxes to estimate the 3D
poses. It leverages and extends the Stacked Hourglass Network and its
multi-scale feature learning to manage multi-person situations. Thus, we
exploit a robust 3D human pose formulation to fully describe several 3D human
poses even in case of strong occlusions or crops. Then, joint grouping and
human pose estimation for an arbitrary number of people are performed using the
associative embedding method. Our approach significantly outperforms the state
of the art on the challenging CMU Panoptic and a previous single shot method on
the MuPoTS-3D dataset. Furthermore, it leads to good results on the complex and
synthetic images from the newly proposed JTA Dataset.
","[{'version': 'v1', 'created': 'Fri, 8 Nov 2019 17:13:33 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jan 2021 09:59:22 GMT'}]",2021-01-08,"[['Benzine', 'Abdallah', ''], ['Luvison', 'Bertrand', ''], ['Pham', 'Quoc Cuong', ''], ['Achard', 'Catherine', '']]","['multi-person', '3D', 'human pose', 'deep learning']"
5885,2203.15319,Pietro Liguori,"Pietro Liguori, Cristina Improta, Simona De Vivo, Roberto Natella,
  Bojan Cukic and Domenico Cotroneo","Can NMT Understand Me? Towards Perturbation-based Evaluation of NMT
  Models for Code Generation","Paper accepted for publication in the proceedings of The 1st Intl.
  Workshop on Natural Language-based Software Engineering (NLBSE) to be held
  with ICSE 2022",,10.1145/3528588.3528653,,cs.CL cs.LG cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Neural Machine Translation (NMT) has reached a level of maturity to be
recognized as the premier method for the translation between different
languages and aroused interest in different research areas, including software
engineering. A key step to validate the robustness of the NMT models consists
in evaluating the performance of the models on adversarial inputs, i.e., inputs
obtained from the original ones by adding small amounts of perturbation.
However, when dealing with the specific task of the code generation (i.e., the
generation of code starting from a description in natural language), it has not
yet been defined an approach to validate the robustness of the NMT models. In
this work, we address the problem by identifying a set of perturbations and
metrics tailored for the robustness assessment of such models. We present a
preliminary experimental evaluation, showing what type of perturbations affect
the model the most and deriving useful insights for future directions.
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2022 08:01:39 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Mar 2022 12:58:40 GMT'}]",2022-03-31,"[['Liguori', 'Pietro', ''], ['Improta', 'Cristina', ''], ['De Vivo', 'Simona', ''], ['Natella', 'Roberto', ''], ['Cukic', 'Bojan', ''], ['Cotroneo', 'Domenico', '']]","['neural machine translation', 'robustness testing', 'code generation', 'adversarial inputs']"
5886,2103.04286,Hui Li,"Hui Li, Xiao-Jun Wu, Josef Kittler","RFN-Nest: An end-to-end residual fusion network for infrared and visible
  images","Accepted by Information Fusion. 17 pages, 18 figures, 8 tables",,10.1016/j.inffus.2021.02.023,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In the image fusion field, the design of deep learning-based fusion methods
is far from routine. It is invariably fusion-task specific and requires a
careful consideration. The most difficult part of the design is to choose an
appropriate strategy to generate the fused image for a specific task in hand.
Thus, devising learnable fusion strategy is a very challenging problem in the
community of image fusion. To address this problem, a novel end-to-end fusion
network architecture (RFN-Nest) is developed for infrared and visible image
fusion. We propose a residual fusion network (RFN) which is based on a residual
architecture to replace the traditional fusion approach. A novel
detail-preserving loss function, and a feature enhancing loss function are
proposed to train RFN. The fusion model learning is accomplished by a novel
two-stage training strategy. In the first stage, we train an auto-encoder based
on an innovative nest connection (Nest) concept. Next, the RFN is trained using
the proposed loss functions. The experimental results on public domain data
sets show that, compared with the existing methods, our end-to-end fusion
network delivers a better performance than the state-of-the-art methods in both
subjective and objective evaluation. The code of our fusion method is available
at https://github.com/hli1221/imagefusion-rfn-nest
","[{'version': 'v1', 'created': 'Sun, 7 Mar 2021 07:29:50 GMT'}, {'version': 'v2', 'created': 'Sun, 14 Mar 2021 06:16:15 GMT'}]",2021-03-16,"[['Li', 'Hui', ''], ['Wu', 'Xiao-Jun', ''], ['Kittler', 'Josef', '']]","['image fusion', 'end-to-end network', 'nest connection', 'residual network', 'infrared image', 'visible image']"
5887,2203.13912,Alexander Edwards,"Xuan Hu, Benjamin W. Walker, Felipe Garc\'ia-S\'anchez, Alexander J.
  Edwards, Peng Zhou, Jean Anne C. Incorvia, Alexandru Paler, Michael P. Frank,
  Joseph S. Friedman",Logical and Physical Reversibility of Conservative Skyrmion Logic,,,10.1109/LMAG.2022.3174514,,cs.ET cond-mat.mes-hall physics.app-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Magnetic skyrmions are nanoscale whirls of magnetism that can be propagated
with electrical currents. The repulsion between skyrmions inspires their use
for reversible computing based on the elastic billiard ball collisions proposed
for conservative logic in 1982. Here we evaluate the logical and physical
reversibility of this skyrmion logic paradigm, as well as the limitations that
must be addressed before dissipation-free computation can be realized.
","[{'version': 'v1', 'created': 'Fri, 25 Mar 2022 21:12:44 GMT'}]",2022-05-12,"[['Hu', 'Xuan', ''], ['Walker', 'Benjamin W.', ''], ['García-Sánchez', 'Felipe', ''], ['Edwards', 'Alexander J.', ''], ['Zhou', 'Peng', ''], ['Incorvia', 'Jean Anne C.', ''], ['Paler', 'Alexandru', ''], ['Frank', 'Michael P.', ''], ['Friedman', 'Joseph S.', '']]","['Spin Electronics', 'Reversible Computing', 'Conservative Logic', 'Spintronics', 'Skyrmion', 'VCMA']"
5888,2008.02115,Mike Eichhorn,Mike Eichhorn,"Optimal Routing Strategies for Autonomous Underwater Vehicles in
  Time-Varying Environment","12 pages, 13 figures. arXiv admin note: substantial text overlap with
  arXiv:1702.08101, arXiv:1702.08104",Rob. Auton. Syst. 67 (2015) 33-43,10.1016/j.robot.2013.08.010,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a mission system and the therein implemented algorithms
for path planning in a time-varying environment based on graph methods. The
basic task of the introduced path planning algorithms is to find a time-optimal
path from a defined start position to a goal position with consideration of the
time-varying ocean current for an autonomous underwater vehicle (AUV). Building
on this, additional practice-oriented considerations in planning are discussed
in this paper. Such points are the discussion of possible methods to accelerate
the algorithms and the determination of the optimal departure time. The
solutions and algorithms presented in this paper are focused on path planning
requirements for the AUV ``SLOCUM Glider''. These algorithms are equally
applicable to other AUVs or aerial mobile autonomous systems.
","[{'version': 'v1', 'created': 'Tue, 4 Aug 2020 05:41:43 GMT'}]",2020-08-06,"[['Eichhorn', 'Mike', '']]","['Path planning', 'Geometrical graph', 'Graph methods', 'Time-varying environment', 'AUV', 'AUV “SLOCUMGlider”', 'Autonomous systems']"
5889,1703.10860,Simon Thompson,"Simon Thompson (University of Kent, United Kingdom), Huiqing Li
  (University of Kent, United Kingdom), Andreas Schumacher (Ericsson AB,
  Sweden)",The pragmatics of clone detection and elimination,,"The Art, Science, and Engineering of Programming, 2017, Vol. 1,
  Issue 2, Article 8",10.22152/programming-journal.org/2017/1/8,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The occurrence of similar code, or `code clones', can make program code
difficult to read, modify and maintain. This paper describes industrial case
studies of clone detection and elimination using a refactoring and clone
detection tool. We discuss how the studies have informed the design of the
tool; more importantly, we use the studies to illustrate the complex set of
decisions that have to be taken when performing clone elimination in practice.
The case studies were performed in collaboration with engineers from Ericsson
AB, and used the refactoring tool Wrangler for Erlang. However, the conclusions
we draw are largely language-independent, and set out the pragmatics of clone
detection and elimination in real-world projects as well as design principles
for clone detection decision-support tools.
","[{'version': 'v1', 'created': 'Fri, 31 Mar 2017 11:46:26 GMT'}]",2017-04-03,"[['Thompson', 'Simon', '', 'University of Kent, United Kingdom'], ['Li', 'Huiqing', '', 'University of Kent, United Kingdom'], ['Schumacher', 'Andreas', '', 'Ericsson AB,\n  Sweden']]","['similar code', 'clone detection', 'clone elimination', 'clone removal', 'refactoring', 'testing', 'program']"
5890,1904.07764,Wensheng Gan,"Wensheng Gan, Jerry Chun-Wei Lin, Jiexiong Zhang, Han-Chieh Chao,
  Hamido Fujita and Philip S. Yu",ProUM: Projection-based Utility Mining on Sequence Data,"Elsevier Information Science, 17 pages, 4 figures","Information Science, 2020",10.1016/j.ins.2019.10.033,,cs.DB cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Utility is an important concept in economics. A variety of applications
consider utility in real-life situations, which has lead to the emergence of
utility-oriented mining (also called utility mining) in the recent decade.
Utility mining has attracted a great amount of attention, but most of the
existing studies have been developed to deal with itemset-based data.
Time-ordered sequence data is more commonly seen in real-world situations,
which is different from itemset-based data. Since they are time-consuming and
require large amount of memory usage, current utility mining algorithms still
have limitations when dealing with sequence data. In addition, the mining
efficiency of utility mining on sequence data still needs to be improved,
especially for long sequences or when there is a low minimum utility threshold.
In this paper, we propose an efficient Projection-based Utility Mining (ProUM)
approach to discover high-utility sequential patterns from sequence data. The
utility-array structure is designed to store the necessary information of the
sequence-order and utility. ProUM can significantly improve the mining
efficiency by utilizing the projection technique in generating utility-array,
and it effectively reduces the memory consumption. Furthermore, a new upper
bound named sequence extension utility is proposed and several pruning
strategies are further applied to improve the efficiency of ProUM. By taking
utility theory into account, the derived high-utility sequential patterns have
more insightful and interesting information than other kinds of patterns.
Experimental results showed that the proposed ProUM algorithm significantly
outperformed the state-of-the-art algorithms in terms of execution time, memory
usage, and scalability.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2019 15:34:40 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Sep 2019 09:18:50 GMT'}]",2021-04-01,"[['Gan', 'Wensheng', ''], ['Lin', 'Jerry Chun-Wei', ''], ['Zhang', 'Jiexiong', ''], ['Chao', 'Han-Chieh', ''], ['Fujita', 'Hamido', ''], ['Yu', 'Philip S.', '']]","['economics', 'utility mining', 'sequence', 'projection', 'sequential pattern']"
5891,2105.01423,Bilal Thonnam Thodi,"Bilal Thonnam Thodi, Zaid Saeed Khan, Saif Eddin Jabari and Monica
  Menendez",Learning Traffic Speed Dynamics from Visualizations,"8 pages, 9 figures; Submitted to the 2021 IEEE International
  Intelligent Transportation Systems Conference (ITSC)","The 2021 IEEE International Intelligent Transportation Systems
  Conference (ITSC), 2021, pp.1239-1244",10.1109/ITSC48978.2021.9564541,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Space-time visualizations of macroscopic or microscopic traffic variables is
a qualitative tool used by traffic engineers to understand and analyze
different aspects of road traffic dynamics. We present a deep learning method
to learn the macroscopic traffic speed dynamics from these space-time
visualizations, and demonstrate its application in the framework of traffic
state estimation. Compared to existing estimation approaches, our approach
allows a finer estimation resolution, eliminates the dependence on the initial
conditions, and is agnostic to external factors such as traffic demand, road
inhomogeneities and driving behaviors. Our model respects causality in traffic
dynamics, which improves the robustness of estimation. We present the
high-resolution traffic speed fields estimated for several freeway sections
using the data obtained from the Next Generation Simulation Program (NGSIM) and
German Highway (HighD) datasets. We further demonstrate the quality and utility
of the estimation by inferring vehicle trajectories from the estimated speed
fields, and discuss the benefits of deep neural network models in approximating
the traffic dynamics.
","[{'version': 'v1', 'created': 'Tue, 4 May 2021 11:17:43 GMT'}]",2022-04-12,"[['Thodi', 'Bilal Thonnam', ''], ['Khan', 'Zaid Saeed', ''], ['Jabari', 'Saif Eddin', ''], ['Menendez', 'Monica', '']]","['Traffic flow dynamics', 'traffic anisotropy', 'deep learning']"
5892,2008.02015,Jorge Fandinno,"Pedro Cabalar, Jorge Fandinno and Yuliya Lierler",Modular Answer Set Programming as a Formal Specification Language,"Paper presented at the 36th International Conference on Logic
  Programming (ICLP 2019), University Of Calabria, Rende (CS), Italy, September
  2020, 16 pages",Theory and Practice of Logic Programming 20 (2020) 767-782,10.1017/S1471068420000265,,cs.LO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the problem of formal verification for Answer Set
Programming (ASP), namely, obtaining a formal proof showing that the answer
sets of a given (non-ground) logic program P correctly correspond to the
solutions to the problem encoded by P, regardless of the problem instance. To
this aim, we use a formal specification language based on ASP modules, so that
each module can be proved to capture some informal aspect of the problem in an
isolated way. This specification language relies on a novel definition of
(possibly nested, first order) program modules that may incorporate local
hidden atoms at different levels. Then, verifying the logic program P amounts
to prove some kind of equivalence between P and its modular specification.
Under consideration for acceptance in TPLP.
","[{'version': 'v1', 'created': 'Wed, 5 Aug 2020 09:25:51 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Aug 2020 09:40:40 GMT'}]",2020-09-23,"[['Cabalar', 'Pedro', ''], ['Fandinno', 'Jorge', ''], ['Lierler', 'Yuliya', '']]","['Answer Set Programming', 'Formal Specification', 'Formal Verification', 'ModularLogic Programs']"
5893,2001.00137,Gwenaelle Cunha Sergio,Gwenaelle Cunha Sergio and Minho Lee,Stacked DeBERT: All Attention in Incomplete Data for Text Classification,"Published (https://doi.org/10.1016/j.neunet.2020.12.018), Code
  (https://github.com/gcunhase/StackedDeBERT)",Neural Networks 136 (2021) 87-96,10.1016/j.neunet.2020.12.018,,cs.CL cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this paper, we propose Stacked DeBERT, short for Stacked Denoising
Bidirectional Encoder Representations from Transformers. This novel model
improves robustness in incomplete data, when compared to existing systems, by
designing a novel encoding scheme in BERT, a powerful language representation
model solely based on attention mechanisms. Incomplete data in natural language
processing refer to text with missing or incorrect words, and its presence can
hinder the performance of current models that were not implemented to withstand
such noises, but must still perform well even under duress. This is due to the
fact that current approaches are built for and trained with clean and complete
data, and thus are not able to extract features that can adequately represent
incomplete data. Our proposed approach consists of obtaining intermediate input
representations by applying an embedding layer to the input tokens followed by
vanilla transformers. These intermediate features are given as input to novel
denoising transformers which are responsible for obtaining richer input
representations. The proposed approach takes advantage of stacks of multilayer
perceptrons for the reconstruction of missing words' embeddings by extracting
more abstract and meaningful hidden feature vectors, and bidirectional
transformers for improved embedding representation. We consider two datasets
for training and evaluation: the Chatbot Natural Language Understanding
Evaluation Corpus and Kaggle's Twitter Sentiment Corpus. Our model shows
improved F1-scores and better robustness in informal/incorrect texts present in
tweets and in texts with Speech-to-Text error in the sentiment and intent
classification tasks.
","[{'version': 'v1', 'created': 'Wed, 1 Jan 2020 04:49:23 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Jan 2021 14:13:49 GMT'}]",2021-01-15,"[['Sergio', 'Gwenaelle Cunha', ''], ['Lee', 'Minho', '']]","['Incomplete Text Classification', 'Incomplete Data', 'Speech-to-Text']"
5894,2103.05275,Christian Krogh,"Christian Krogh, Johnny Jakobsen, Jakob Wilm","Will it Crease or Cease? A study of Debulking of Air Pockets in
  Automated Prepreg Composite Layup",Accepted manuscript,"Composites Part A: Applied Science and Manufacturing, Volume 138,
  November 2020, 106052",10.1016/j.compositesa.2020.106052,,cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Automatic draping of carbon-fiber prepreg plies for the aerospace industry is
a promising technique for lowering the manufacturing costs and to this end, a
thorough in-process quality control is crucial. In this paper, out-of-plane
defects in the layup are investigated. After draping, air pockets are
occasionally encountered. The question is, if such apparent defects can be
mitigated sufficiently during vacuum debulking. The 3D topology is measured by
means of a structured-light 3D scanner and air pockets are segmented. An
approximate mass-spring ply model is used to study the behavior of the air
pockets during application of vacuum pressure. The model is computationally
fast and will indicate online whether the air pocket will be removed or manual
intervention is required. Upon comparing the model predictions with
experimental data, it is shown that the system is capable of correctly
predicting 13 out of 14 air pockets in a test layup.
","[{'version': 'v1', 'created': 'Tue, 9 Mar 2021 07:48:24 GMT'}]",2021-03-10,"[['Krogh', 'Christian', ''], ['Jakobsen', 'Johnny', ''], ['Wilm', 'Jakob', '']]","['Draping', 'Debulking', 'Approximate modeling', 'Vision system']"
5895,2108.02953,Wanqi Yang,"Shengqi Huang, Wanqi Yang, Lei Wang, Luping Zhou, Ming Yang","Few-shot Unsupervised Domain Adaptation with Image-to-class Sparse
  Similarity Encoding","Proceedings of the 29th ACM International Conference on Multimedia
  (MM '21)",,10.1145/3474085.3475232,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates a valuable setting called few-shot unsupervised
domain adaptation (FS-UDA), which has not been sufficiently studied in the
literature. In this setting, the source domain data are labelled, but with
few-shot per category, while the target domain data are unlabelled. To address
the FS-UDA setting, we develop a general UDA model to solve the following two
key issues: the few-shot labeled data per category and the domain adaptation
between support and query sets. Our model is general in that once trained it
will be able to be applied to various FS-UDA tasks from the same source and
target domains. Inspired by the recent local descriptor based few-shot learning
(FSL), our general UDA model is fully built upon local descriptors (LDs) for
image classification and domain adaptation. By proposing a novel concept called
similarity patterns (SPs), our model not only effectively considers the spatial
relationship of LDs that was ignored in previous FSL methods, but also makes
the learned image similarity better serve the required domain alignment.
Specifically, we propose a novel IMage-to-class sparse Similarity Encoding
(IMSE) method. It learns SPs to extract the local discriminative information
for classification and meanwhile aligns the covariance matrix of the SPs for
domain adaptation. Also, domain adversarial training and multi-scale local
feature matching are performed upon LDs. Extensive experiments conducted on a
multi-domain benchmark dataset DomainNet demonstrates the state-of-the-art
performance of our IMSE for the novel setting of FS-UDA. In addition, for FSL,
our IMSE can also show better performance than most of recent FSL methods on
miniImageNet.
","[{'version': 'v1', 'created': 'Fri, 6 Aug 2021 06:15:02 GMT'}]",2021-08-09,"[['Huang', 'Shengqi', ''], ['Yang', 'Wanqi', ''], ['Wang', 'Lei', ''], ['Zhou', 'Luping', ''], ['Yang', 'Ming', '']]","['Few-shot', 'unsupervised domain adaptation', 'image-to-class similarity', 'local descriptors', 'similarity patterns']"
5896,1903.06756,Ibrahim AlZuabi,"Ibrahim Mousa AlZuabi, Assef Jafar and Kadan Aljoumaa",Predicting customer's gender and age depending on mobile phone data,,,10.1186/s40537-019-0180-9,,cs.LG cs.CY stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the age of data driven solution, the customer demographic attributes, such
as gender and age, play a core role that may enable companies to enhance the
offers of their services and target the right customer in the right time and
place. In the marketing campaign, the companies want to target the real user of
the GSM (global system for mobile communications), not the line owner. Where
sometimes they may not be the same. This work proposes a method that predicts
users' gender and age based on their behavior, services and contract
information. We used call detail records (CDRs), customer relationship
management (CRM) and billing information as a data source to analyze telecom
customer behavior, and applied different types of machine learning algorithms
to provide marketing campaigns with more accurate information about customer
demographic attributes. This model is built using reliable data set of 18,000
users provided by SyriaTel Telecom Company, for training and testing. The model
applied by using big data technology and achieved 85.6% accuracy in terms of
user gender prediction and 65.5% of user age prediction. The main contribution
of this work is the improvement in the accuracy in terms of user gender
prediction and user age prediction based on mobile phone data and end-to-end
solution that approaches customer data from multiple aspects in the telecom
domain.
","[{'version': 'v1', 'created': 'Wed, 20 Feb 2019 07:46:13 GMT'}]",2019-03-19,"[['AlZuabi', 'Ibrahim Mousa', ''], ['Jafar', 'Assef', ''], ['Aljoumaa', 'Kadan', '']]","['Gender prediction', 'Age prediction', 'Customer behavior', 'Machine learning', 'Big data', 'Classification', 'CDR']"
5897,1902.05197,Linshan Jiang,Linshan Jiang and Rui Tan and Xin Lou and Guosheng Lin,On Lightweight Privacy-Preserving Collaborative Learning for IoT Objects,"12 pages,IOTDI 2019",,10.1145/3302505.3310070,,cs.LG cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Internet of Things (IoT) will be a main data generation infrastructure
for achieving better system intelligence. This paper considers the design and
implementation of a practical privacy-preserving collaborative learning scheme,
in which a curious learning coordinator trains a better machine learning model
based on the data samples contributed by a number of IoT objects, while the
confidentiality of the raw forms of the training data is protected against the
coordinator. Existing distributed machine learning and data encryption
approaches incur significant computation and communication overhead, rendering
them ill-suited for resource-constrained IoT objects. We study an approach that
applies independent Gaussian random projection at each IoT object to obfuscate
data and trains a deep neural network at the coordinator based on the projected
data from the IoT objects. This approach introduces light computation overhead
to the IoT objects and moves most workload to the coordinator that can have
sufficient computing resources. Although the independent projections performed
by the IoT objects address the potential collusion between the curious
coordinator and some compromised IoT objects, they significantly increase the
complexity of the projected data. In this paper, we leverage the superior
learning capability of deep learning in capturing sophisticated patterns to
maintain good learning performance. Extensive comparative evaluation shows that
this approach outperforms other lightweight approaches that apply additive
noisification for differential privacy and/or support vector machines for
learning in the applications with light data pattern complexities.
","[{'version': 'v1', 'created': 'Wed, 13 Feb 2019 06:31:21 GMT'}]",2019-02-15,"[['Jiang', 'Linshan', ''], ['Tan', 'Rui', ''], ['Lou', 'Xin', ''], ['Lin', 'Guosheng', '']]","['Internet of Things', 'collaborative learning', 'privacy']"
5898,2109.02645,Aan Erlansari,"Aan Erlansari, Rusdi Effendi, Funny Farady C, Andang Wijanarko, Boko
  Susilo, Reza Hardiansyah","Backpropagation and fuzzy algorithm Modelling to Resolve Blood Supply
  Chain Issues in the Covid-19 Pandemic",,,10.5281/zenodo.4940183,,cs.LG cs.AI cs.CY cs.IT math.IT,http://creativecommons.org/licenses/by/4.0/,"  Bloodstock shortages and its uncertain demand has become a major problem for
all countries worldwide. Therefore, this study aims to provide solution to the
issues of blood distribution during the Covid-19 Pandemic at Bengkulu,
Indonesia. The Backpropagation algorithm was used to improve the possibility of
discovering available and potential donors. Furthermore, the distances, age,
and length of donation were measured to obtain the right person to donate blood
when it needed. The Backpropagation uses three input layers to classify
eligible donors, namely age, body, weight, and bias. In addition, the system
through its query automatically counts the variables via the Fuzzy Tahani and
simultaneously access the vast database.
","[{'version': 'v1', 'created': 'Mon, 6 Sep 2021 15:00:12 GMT'}]",2021-09-08,"[['Erlansari', 'Aan', ''], ['Effendi', 'Rusdi', ''], ['C', 'Funny Farady', ''], ['Wijanarko', 'Andang', ''], ['Susilo', 'Boko', ''], ['Hardiansyah', 'Reza', '']]","['Blood Supply Chain', 'Backpropagation', 'fuzzy tahini']"
5899,1904.10027,Yongxing Wang,"Yongxing Wang, Peter K. Jimack and Mark A. Walkley","A theoretical and experimental investigation of a family of immersed
  finite element methods",,,10.1016/j.jfluidstructs.2019.102754,,cs.NA math.AP math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article we consider the widely used immersed finite element method
(IFEM), in both explicit and implicit form, and its relationship to our more
recent one-field fictitious domain method (FDM). We review and extend the
formulation of these methods, based upon an operator splitting scheme, in order
to demonstrate that both the explicit IFEM and the one-field FDM can be
regarded as particular linearizations of the fully implicit IFEM. However, the
one-field FDM can be shown to be more robust than the explicit IFEM and can
simulate a wider range of solid parameters with a relatively large time step.
In addition, it can produce results almost identical to the implicit IFEM but
without iteration inside each time step. We study the effect on these methods
of variations in viscosity and density of fluid and solid materials. The
advantages of the one-field FDM within the IFEM framework are illustrated
through a selection of parameter sets for two benchmark cases.
","[{'version': 'v1', 'created': 'Mon, 22 Apr 2019 18:51:20 GMT'}]",2019-10-23,"[['Wang', 'Yongxing', ''], ['Jimack', 'Peter K.', ''], ['Walkley', 'Mark A.', '']]","['fluid structure', 'finite element', 'fictitious domain', 'immersed finiteelement', 'one field', 'monolithic scheme', 'Eulerian formulation']"
5900,2002.01699,Jacopo Soldani,"Matteo Bogo, Jacopo Soldani, Davide Neri, Antonio Brogi","Component-aware Orchestration of Cloud-based Enterprise Applications,
  from TOSCA to Docker and Kubernetes",,"Software: Practice and Experience, 2020",10.1002/spe.2848,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Enterprise IT is currently facing the challenge of coordinating the
management of complex, multi-component applications across heterogeneous cloud
platforms. Containers and container orchestrators provide a valuable solution
to deploy multi-component applications over cloud platforms, by coupling the
lifecycle of each application component to that of its hosting container. We
hereby propose a solution for going beyond such a coupling, based on the OASIS
standard TOSCA and on Docker. We indeed propose a novel approach for deploying
multi-component applications on top of existing container orchestrators, which
allows to manage each component independently from the container used to run
it. We also present prototype tools implementing our approach, and we show how
we effectively exploited them to carry out a concrete case study.
","[{'version': 'v1', 'created': 'Wed, 5 Feb 2020 09:49:52 GMT'}, {'version': 'v2', 'created': 'Sun, 26 Apr 2020 15:05:47 GMT'}, {'version': 'v3', 'created': 'Wed, 6 May 2020 08:13:32 GMT'}]",2020-05-07,"[['Bogo', 'Matteo', ''], ['Soldani', 'Jacopo', ''], ['Neri', 'Davide', ''], ['Brogi', 'Antonio', '']]","['application orchestration', 'cloud', 'Docker', 'TOSCA']"
5901,1812.08288,Simone Parisi,"Simone Parisi, Voot Tangkaratt, Jan Peters, and Mohammad Emtiyaz Khan",TD-Regularized Actor-Critic Methods,,,10.1007/s10994-019-05788-0,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Actor-critic methods can achieve incredible performance on difficult
reinforcement learning problems, but they are also prone to instability. This
is partly due to the interaction between the actor and critic during learning,
e.g., an inaccurate step taken by one of them might adversely affect the other
and destabilize the learning. To avoid such issues, we propose to regularize
the learning objective of the actor by penalizing the temporal difference (TD)
error of the critic. This improves stability by avoiding large steps in the
actor update whenever the critic is highly inaccurate. The resulting method,
which we call the TD-regularized actor-critic method, is a simple plug-and-play
approach to improve stability and overall performance of the actor-critic
methods. Evaluations on standard benchmarks confirm this.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2018 23:15:16 GMT'}, {'version': 'v2', 'created': 'Sun, 23 Dec 2018 16:25:20 GMT'}, {'version': 'v3', 'created': 'Mon, 25 Feb 2019 16:41:26 GMT'}]",2019-02-26,"[['Parisi', 'Simone', ''], ['Tangkaratt', 'Voot', ''], ['Peters', 'Jan', ''], ['Khan', 'Mohammad Emtiyaz', '']]","['reinforcement learning', 'actor-critic', 'temporal difference']"
5902,2208.07011,Hilmil Pradana,Hilmil Pradana and Keiichi Horio,"Automatic Controlling Fish Feeding Machine using Feature Extraction of
  Nutriment and Ripple Behavior",,"International Journal of Innovative Computing, Information and
  Control (IJICIC) October 2021",10.24507/ijicic.17.05.1483,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Controlling fish feeding machine is challenging problem because experienced
fishermen can adequately control based on assumption. To build robust method
for reasonable application, we propose automatic controlling fish feeding
machine based on computer vision using combination of counting nutriments and
estimating ripple behavior using regression and textural feature, respectively.
To count number of nutriments, we apply object detection and tracking methods
to acknowledge the nutriments moving to sea surface. Recently, object tracking
is active research and challenging problem in computer vision. Unfortunately,
the robust tracking method for multiple small objects with dense and complex
relationships is unsolved problem in aquaculture field with more appearance
creatures. Based on the number of nutriments and ripple behavior, we can
control fish feeding machine which consistently performs well in real
environment. Proposed method presents the agreement for automatic controlling
fish feeding by the activation graphs and textural feature of ripple behavior.
Our tracking method can precisely track the nutriments in next frame comparing
with other methods. Based on computational time, proposed method reaches 3.86
fps while other methods spend lower than 1.93 fps. Quantitative evaluation can
promise that proposed method is valuable for aquaculture fish farm with widely
applied to real environment.
","[{'version': 'v1', 'created': 'Mon, 15 Aug 2022 05:52:37 GMT'}]",2022-08-16,"[['Pradana', 'Hilmil', ''], ['Horio', 'Keiichi', '']]","['Fish Feeding', 'Ripple Behavior', 'Textural Feature', 'Nutriments', 'Tracking', 'Multiple Small Objects']"
5903,2008.02347,Subhadip Maji,"Subhadip Maji, Anudeep Srivatsav Appe, Raghav Bali, Veera Raghavendra
  Chikka, Arijit Ghosh Chowdhury and Vamsi M Bhandaru","An Interpretable Deep Learning System for Automatically Scoring Request
  for Proposals","8 pages, 4 figures","2021 IEEE 33rd International Conference on Tools with Artificial
  Intelligence (ICTAI)",10.1109/ICTAI52525.2021.00136,,cs.CL cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Managed Care system within Medicaid (US Healthcare) uses Request For
Proposals (RFP) to award contracts for various healthcare and related services.
RFP responses are very detailed documents (hundreds of pages) submitted by
competing organisations to win contracts. Subject matter expertise and domain
knowledge play an important role in preparing RFP responses along with analysis
of historical submissions. Automated analysis of these responses through
Natural Language Processing (NLP) systems can reduce time and effort needed to
explore historical responses, and assisting in writing better responses. Our
work draws parallels between scoring RFPs and essay scoring models, while
highlighting new challenges and the need for interpretability. Typical scoring
models focus on word level impacts to grade essays and other short write-ups.
We propose a novel Bi-LSTM based regression model, and provide deeper insight
into phrases which latently impact scoring of responses. We contend the merits
of our proposed methodology using extensive quantitative experiments. We also
qualitatively asses the impact of important phrases using human evaluators.
Finally, we introduce a novel problem statement that can be used to further
improve the state of the art in NLP based automatic scoring systems.
","[{'version': 'v1', 'created': 'Wed, 5 Aug 2020 20:21:35 GMT'}]",2022-06-01,"[['Maji', 'Subhadip', ''], ['Appe', 'Anudeep Srivatsav', ''], ['Bali', 'Raghav', ''], ['Chikka', 'Veera Raghavendra', ''], ['Chowdhury', 'Arijit Ghosh', ''], ['Bhandaru', 'Vamsi M', '']]","['NLP', 'Deep Learning', 'Healthcare', 'Automatic Scoring Systems']"
5904,2204.09758,Adrian Mos,"Jos\'e Miguel P\'erez-\'Alvarez, Adrian Mos, Benjamin V. Hanrahan,
  Iyadunni J. Adenuga","Lowering Barriers to Application Development With Cloud-Native
  Domain-Specific Functions",,,10.1145/3510458.3513017,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Creating and maintaining a modern, heterogeneous set of client applications
remains an obstacle for many businesses and individuals. While simple
domain-specific graphical languages and libraries can empower a variety of
users to create application behaviors and logic, using these languages to
produce and maintain a set of heterogeneous client applications is a challenge.
Primarily because each client typically requires the developers to both
understand and embed the domain-specific logic. This is because application
logic must be encoded to some extent in both the server and client sides.
  In this paper, we propose an alternative approach, which allows the
specification of application logic to reside solely on the cloud. We have built
a system where reusable application components can be assembled on the cloud in
different logical chains and the client is largely decoupled from this logic
and is solely concerned with how data is displayed and gathered from users of
the application. In this way, the chaining of requests and responses is done by
the cloud and the client side has no knowledge of the application logic.
  An additional effect of our approach is that the client side developer is
able to immediately see any changes they make, while executing the logic
residing on the cloud. This further allows more novice programmers to perform
these customizations, as they do not need to `get the full application working'
and are able to see the results of their code as they go, thereby lowering the
obstacles to businesses and individuals to produce and maintain applications.
Furthermore, this decoupling enables the quick generation and customization of
a variety of application clients, ranging from web to mobile devices and
personal assistants, while customizing one or more as needed.
","[{'version': 'v1', 'created': 'Wed, 20 Apr 2022 19:45:13 GMT'}]",2022-04-22,"[['Pérez-Álvarez', 'José Miguel', ''], ['Mos', 'Adrian', ''], ['Hanrahan', 'Benjamin V.', ''], ['Adenuga', 'Iyadunni J.', '']]","['domain-specific', 'activity flow', 'cloud execution', 'model-driven engineering']"
5905,2205.02089,Ahmed El Ouadrhiri,"Ahmed El Ouadrhiri, Ahmed Abdelhadi","A New Dimensionality Reduction Method Based on Hensel's Compression for
  Privacy Protection in Federated Learning","6 pages, 7 figures",,10.1109/ACCESS.2022.3151670,,cs.CR cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Differential privacy (DP) is considered a de-facto standard for protecting
users' privacy in data analysis, machine, and deep learning. Existing DP-based
privacy-preserving training approaches consist of adding noise to the clients'
gradients before sharing them with the server. However, implementing DP on the
gradient is not efficient as the privacy leakage increases by increasing the
synchronization training epochs due to the composition theorem. Recently
researchers were able to recover images used in the training dataset using
Generative Regression Neural Network (GRNN) even when the gradient was
protected by DP. In this paper, we propose two layers of privacy protection
approach to overcome the limitations of the existing DP-based approaches. The
first layer reduces the dimension of the training dataset based on Hensel's
Lemma. We are the first to use Hensel's Lemma for reducing the dimension (i.e.,
compress) of a dataset. The new dimensionality reduction method allows reducing
the dimension of a dataset without losing information since Hensel's Lemma
guarantees uniqueness. The second layer applies DP to the compressed dataset
generated by the first layer. The proposed approach overcomes the problem of
privacy leakage due to composition by applying DP only once before the
training; clients train their local model on the privacy-preserving dataset
generated by the second layer. Experimental results show that the proposed
approach ensures strong privacy protection while achieving good accuracy. The
new dimensionality reduction method achieves an accuracy of 97%, with only 25 %
of the original data size.
","[{'version': 'v1', 'created': 'Sun, 1 May 2022 23:52:16 GMT'}]",2022-05-05,"[['Ouadrhiri', 'Ahmed El', ''], ['Abdelhadi', 'Ahmed', '']]","['Federated learning', 'Privacy protection', 'Differential privacy', 'dimensionality reduction', 'Hensel’s compression']"
5906,2107.09917,Hendrik Heuer,Hendrik Heuer,"Audit, Don't Explain -- Recommendations Based on a Socio-Technical
  Understanding of ML-Based Systems","This paper will be presented at the Workshop on User-Centered
  Artificial Intelligence (UCAI '21) at Mensch und Computer 2021",,10.18420/muc2021-mci-ws02-232,,cs.HC cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this position paper, I provide a socio-technical perspective on machine
learning-based systems. I also explain why systematic audits may be preferable
to explainable AI systems. I make concrete recommendations for how institutions
governed by public law akin to the German T\""UV and Stiftung Warentest can
ensure that ML systems operate in the interest of the public.
","[{'version': 'v1', 'created': 'Wed, 21 Jul 2021 07:36:01 GMT'}]",2021-07-22,"[['Heuer', 'Hendrik', '']]","['Algorithmic Bias', 'Algorithmic Experience', 'Algorithmic Transparency', 'Human-Centered Machine Learning', 'Recommender Systems', 'Social Media', 'User Beliefs']"
5907,2205.13947,Bin Lu,"Bin Lu, Xiaoying Gan, Weinan Zhang, Huaxiu Yao, Luoyi Fu, Xinbing Wang","Spatio-Temporal Graph Few-Shot Learning with Cross-City Knowledge
  Transfer",Accepted to KDD2022,,10.1145/3534678.3539281,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Spatio-temporal graph learning is a key method for urban computing tasks,
such as traffic flow, taxi demand and air quality forecasting. Due to the high
cost of data collection, some developing cities have few available data, which
makes it infeasible to train a well-performed model. To address this challenge,
cross-city knowledge transfer has shown its promise, where the model learned
from data-sufficient cities is leveraged to benefit the learning process of
data-scarce cities. However, the spatio-temporal graphs among different cities
show irregular structures and varied features, which limits the feasibility of
existing Few-Shot Learning (\emph{FSL}) methods. Therefore, we propose a
model-agnostic few-shot learning framework for spatio-temporal graph called
ST-GFSL. Specifically, to enhance feature extraction by transfering cross-city
knowledge, ST-GFSL proposes to generate non-shared parameters based on
node-level meta knowledge. The nodes in target city transfer the knowledge via
parameter matching, retrieving from similar spatio-temporal characteristics.
Furthermore, we propose to reconstruct the graph structure during
meta-learning. The graph reconstruction loss is defined to guide
structure-aware learning, avoiding structure deviation among different
datasets. We conduct comprehensive experiments on four traffic speed prediction
benchmarks and the results demonstrate the effectiveness of ST-GFSL compared
with state-of-the-art methods.
","[{'version': 'v1', 'created': 'Fri, 27 May 2022 12:46:52 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Jun 2022 08:57:36 GMT'}]",2022-06-06,"[['Lu', 'Bin', ''], ['Gan', 'Xiaoying', ''], ['Zhang', 'Weinan', ''], ['Yao', 'Huaxiu', ''], ['Fu', 'Luoyi', ''], ['Wang', 'Xinbing', '']]","['Spatio-temporal data', 'Few-shot learning', 'Traffic forecasting', 'Graphneural network']"
5908,2105.01196,Patryk Orzechowski,"Pawe{\l} Renc, Patryk Orzechowski, Aleksander Byrski, Jaros{\l}aw
  W\k{a}s, and Jason H. Moore","EBIC.JL -- an Efficient Implementation of Evolutionary Biclustering
  Algorithm in Julia","9 pages, 11 figures",,10.1145/3449726.3463197,,cs.LG cs.AI cs.DC cs.NE q-bio.GN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Biclustering is a data mining technique which searches for local patterns in
numeric tabular data with main application in bioinformatics. This technique
has shown promise in multiple areas, including development of biomarkers for
cancer, disease subtype identification, or gene-drug interactions among others.
In this paper we introduce EBIC.JL - an implementation of one of the most
accurate biclustering algorithms in Julia, a modern highly parallelizable
programming language for data science. We show that the new version maintains
comparable accuracy to its predecessor EBIC while converging faster for the
majority of the problems. We hope that this open source software in a
high-level programming language will foster research in this promising field of
bioinformatics and expedite development of new biclustering methods for big
data.
","[{'version': 'v1', 'created': 'Mon, 3 May 2021 22:30:38 GMT'}]",2021-05-05,"[['Renc', 'Paweł', ''], ['Orzechowski', 'Patryk', ''], ['Byrski', 'Aleksander', ''], ['Wąs', 'Jarosław', ''], ['Moore', 'Jason H.', '']]","['biclustering', 'data mining', 'machine learning', 'evolutionary computation', 'parallel algorithms']"
5909,2106.02257,Jiayi Wei,"Jiayi Wei, Xilian Li, Yi Zhang, Xin Wang",Visual Question Rewriting for Increasing Response Rate,,,10.1145/3404835.3463114,,cs.CV cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  When a human asks questions online, or when a conversational virtual agent
asks human questions, questions triggering emotions or with details might more
likely to get responses or answers. we explore how to automatically rewrite
natural language questions to improve the response rate from people. In
particular, a new task of Visual Question Rewriting(VQR) task is introduced to
explore how visual information can be used to improve the new questions. A data
set containing around 4K bland questions, attractive questions and images
triples is collected. We developed some baseline sequence to sequence models
and more advanced transformer based models, which take a bland question and a
related image as input and output a rewritten question that is expected to be
more attractive. Offline experiments and mechanical Turk based evaluations show
that it is possible to rewrite bland questions in a more detailed and
attractive way to increase the response rate, and images can be helpful.
","[{'version': 'v1', 'created': 'Fri, 4 Jun 2021 04:46:47 GMT'}]",2021-06-07,"[['Wei', 'Jiayi', ''], ['Li', 'Xilian', ''], ['Zhang', 'Yi', ''], ['Wang', 'Xin', '']]","['Natural language processing', 'Computer vision', 'Question rewriting', 'Sequence2sequence', 'Transformer', 'Response Rate']"
5910,2206.09113,Zezhi Shao,"Zezhi Shao, Zhao Zhang, Fei Wang, Yongjun Xu","Pre-training Enhanced Spatial-temporal Graph Neural Network for
  Multivariate Time Series Forecasting",Accepted by SIGKDD 2022 (Research Track),,10.1145/3534678.3539396,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Multivariate Time Series (MTS) forecasting plays a vital role in a wide range
of applications. Recently, Spatial-Temporal Graph Neural Networks (STGNNs) have
become increasingly popular MTS forecasting methods. STGNNs jointly model the
spatial and temporal patterns of MTS through graph neural networks and
sequential models, significantly improving the prediction accuracy. But limited
by model complexity, most STGNNs only consider short-term historical MTS data,
such as data over the past one hour. However, the patterns of time series and
the dependencies between them (i.e., the temporal and spatial patterns) need to
be analyzed based on long-term historical MTS data. To address this issue, we
propose a novel framework, in which STGNN is Enhanced by a scalable time series
Pre-training model (STEP). Specifically, we design a pre-training model to
efficiently learn temporal patterns from very long-term history time series
(e.g., the past two weeks) and generate segment-level representations. These
representations provide contextual information for short-term time series input
to STGNNs and facilitate modeling dependencies between time series. Experiments
on three public real-world datasets demonstrate that our framework is capable
of significantly enhancing downstream STGNNs, and our pre-training model aptly
captures temporal patterns.
","[{'version': 'v1', 'created': 'Sat, 18 Jun 2022 04:24:36 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Aug 2022 06:45:44 GMT'}]",2022-08-17,"[['Shao', 'Zezhi', ''], ['Zhang', 'Zhao', ''], ['Wang', 'Fei', ''], ['Xu', 'Yongjun', '']]","['multivariate time series forecasting', 'spatial-temporal graph neuralnetwork', 'pre-training model']"
5911,2208.02490,Ashad Kabir,"Sabiha Samad, Fahmida Ahmed, Samsun Naher, Muhammad Ashad Kabir, Anik
  Das, Sumaiya Amin, Sheikh Mohammed Shariful Islam","Smartphone Apps for Tracking Food Consumption and Recommendations:
  Evaluating Artificial Intelligence-based Functionalities, Features and
  Quality of Current Apps",,"Intelligent Systems with Applications, Volume 15, September 2022,
  200103",10.1016/j.iswa.2022.200103,,cs.SE cs.MM,http://creativecommons.org/licenses/by/4.0/,"  The advancement of artificial intelligence (AI) and the significant growth in
the use of food consumption tracking and recommendation-related apps in the app
stores have created a need for an evaluation system, as minimal information is
available about the evidence-based quality and technological advancement of
these apps. Electronic searches were conducted across three major app stores
and the selected apps were evaluated by three independent raters. A total of
473 apps were found and 80 of them were selected for review based on inclusion
and exclusion criteria. An app rating tool is devised to evaluate the selected
apps. Our rating tool assesses the apps' essential features, AI-based advanced
functionalities, and software quality characteristics required for food
consumption tracking and recommendations, as well as their usefulness to
general users. Users' comments from the app stores are collected and evaluated
to better understand their expectations and perspectives. Following an
evaluation of the assessed applications, design considerations that emphasize
automation-based approaches using artificial intelligence are proposed.
According to our assessment, most mobile apps in the app stores do not satisfy
the overall requirements for tracking food consumption and recommendations.
""Foodvisor"" is the only app that can automatically recognize food items, and
compute the recommended volume and nutritional information of that food item.
However, these features need to be improvised in the food consumption tracking
and recommendation apps. This study provides both researchers and developers
with an insight into current state-of-the-art apps and design guidelines with
necessary information on essential features and software quality
characteristics for designing and developing a better app.
","[{'version': 'v1', 'created': 'Thu, 4 Aug 2022 06:39:48 GMT'}]",2022-08-05,"[['Samad', 'Sabiha', ''], ['Ahmed', 'Fahmida', ''], ['Naher', 'Samsun', ''], ['Kabir', 'Muhammad Ashad', ''], ['Das', 'Anik', ''], ['Amin', 'Sumaiya', ''], ['Islam', 'Sheikh Mohammed Shariful', '']]","['Smartphone apps', 'food nutrition', 'food consumption', 'food recommendations', 'apps evaluation', 'design']"
5912,1906.00374,Abuthahir A,"Abuthahir Abuthahir, Nizar Malangadan, Gaurav Raina","Effect of two forms of feedback on the performance of the Rate Control
  Protocol (RCP)",,,10.1016/j.cnsns.2020.105225,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Rate Control Protocol (RCP) uses explicit feedback from routers to
control network congestion. RCP estimates it's fair rate from two forms of
feedback: rate mismatch and queue size. An important design question that
remains open in RCP is whether the presence of queue size feedback is helpful,
given the presence of feedback from rate mismatch. The feedback from routers to
end-systems is time delayed, and may introduce instabilities and complex
non-linear dynamics. Delay dynamical systems are often modeled using delay
differential equations to facilitate a mathematical analysis of their
performance and dynamics. The RCP models with and without queue size feedback
give rise to two distinct non-linear delay differential equations. Earlier work
on this design question was based on methods of linear systems theory. For
further progress, it is quite natural to employ nonlinear techniques. In this
study, we approach this design question using tools from control and
bifurcation theory. The analytical results reveal that the removal of queue
feedback could enhance both stability and convergence properties. Further,
using Poincar\'{e} normal forms and center manifold theory, we investigate two
nonlinear properties, namely, the type of Hopf bifurcation and the asymptotic
stability of the bifurcating limit cycles. We show that the presence of queue
feedback in the RCP can lead to a sub-critical Hopf bifurcation, which would
give rise either to the onset of large amplitude limit cycles or to unstable
limit cycles. Whereas, in the absence of queue feedback, the Hopf bifurcation
is always super-critical and the bifurcating limit cycles are stable. The
analysis is complemented with computations and some packet-level simulations as
well. In terms of design, our study suggests that the presence of both forms of
feedback may be detrimental to the performance of RCP.
","[{'version': 'v1', 'created': 'Sun, 2 Jun 2019 09:27:16 GMT'}]",2020-04-22,"[['Abuthahir', 'Abuthahir', ''], ['Malangadan', 'Nizar', ''], ['Raina', 'Gaurav', '']]","['Congestion control', 'Rate control protocol', 'queue feedback', 'stability', 'convergence', 'Hopf bifurcation']"
5913,2204.04312,Ian T Foster,"Ian Foster, Carl Kesselman",The History of the Grid,,"High Performance Computing: From Grids and Clouds to Exascale, IOS
  Press, pages 3-30, 2011",10.3233/978-1-60750-803-8-3,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the widespread availability of high-speed networks, it becomes feasible
to outsource computing to remote providers and to federate resources from many
locations. Such observations motivated the development, from the mid-1990s
onwards, of a range of innovative Grid technologies, applications, and
infrastructures. We review the history, current status, and future prospects
for Grid computing.
","[{'version': 'v1', 'created': 'Fri, 8 Apr 2022 22:08:36 GMT'}]",2022-04-12,"[['Foster', 'Ian', ''], ['Kesselman', 'Carl', '']]","['Grid', 'Globus', 'distributed computing', 'scientific computing', 'cloud computing']"
5914,1712.05870,Tai-Xiang Jiang,"Tai-Xiang Jiang, Ting-Zhu Huang, Xi-Le Zhao, and Liang-Jian Deng","Multi-dimensional imaging data recovery via minimizing the partial sum
  of tubal nuclear norm",,,10.1016/j.cam.2019.112680,,cs.NA cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate tensor recovery problems within the tensor
singular value decomposition (t-SVD) framework. We propose the partial sum of
the tubal nuclear norm (PSTNN) of a tensor. The PSTNN is a surrogate of the
tensor tubal multi-rank. We build two PSTNN-based minimization models for two
typical tensor recovery problems, i.e., the tensor completion and the tensor
principal component analysis. We give two algorithms based on the alternating
direction method of multipliers (ADMM) to solve proposed PSTNN-based tensor
recovery models. Experimental results on the synthetic data and real-world data
reveal the superior of the proposed PSTNN.
","[{'version': 'v1', 'created': 'Fri, 15 Dec 2017 22:51:13 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Feb 2018 17:40:15 GMT'}, {'version': 'v3', 'created': 'Thu, 23 Jan 2020 08:12:53 GMT'}]",2020-01-24,"[['Jiang', 'Tai-Xiang', ''], ['Huang', 'Ting-Zhu', ''], ['Zhao', 'Xi-Le', ''], ['Deng', 'Liang-Jian', '']]","['tensor singular value decomposition (t-SVD)', 'tubal multi-rank', 'tubal nuclear norm']"
5915,2101.06383,Soumendu Chakraborty,"Soumendu Chakraborty, and Anand Singh Jalal",A Novel Local Binary Pattern Based Blind Feature Image Steganography,,"Multimedia Tools and Applications, vol-79, no-27-28, pp.
  19561-19574, 2020",10.1007/s11042-020-08828-3,,cs.MM cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Steganography methods in general terms tend to embed more and more secret
bits in the cover images. Most of these methods are designed to embed secret
information in such a way that the change in the visual quality of the
resulting stego image is not detectable. There exists some methods which
preserve the global structure of the cover after embedding. However, the
embedding capacity of these methods is very less. In this paper a novel feature
based blind image steganography technique is proposed, which preserves the LBP
(Local binary pattern) feature of the cover with comparable embedding rates.
Local binary pattern is a well known image descriptor used for image
representation. The proposed scheme computes the local binary pattern to hide
the bits of the secret image in such a way that the local relationship that
exists in the cover are preserved in the resulting stego image. The performance
of the proposed steganography method has been tested on several images of
different types to show the robustness. State of the art LSB based
steganography methods are compared with the proposed method to show the
effectiveness of feature based image steganography
","[{'version': 'v1', 'created': 'Sat, 16 Jan 2021 06:37:00 GMT'}]",2021-01-19,"[['Chakraborty', 'Soumendu', ''], ['Jalal', 'Anand Singh', '']]","['LBP', 'LSB', 'Steganography', 'Feature based steganography']"
5916,1708.03878,Cihan Kucukkececi,"Cihan K\""u\c{c}\""ukke\c{c}eci, Adnan Yaz{\i}c{\i}","Big Data Model Simulation on a Graph Database for Surveillance in
  Wireless Multimedia Sensor Networks",,https://doi.org/10.1016/j.bdr.2017.09.003,10.1016/j.bdr.2017.09.003,,cs.DB cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sensors are present in various forms all around the world such as mobile
phones, surveillance cameras, smart televisions, intelligent refrigerators and
blood pressure monitors. Usually, most of the sensors are a part of some other
system with similar sensors that compose a network. One of such networks is
composed of millions of sensors connect to the Internet which is called
Internet of things (IoT). With the advances in wireless communication
technologies, multimedia sensors and their networks are expected to be major
components in IoT. Many studies have already been done on wireless multimedia
sensor networks in diverse domains like fire detection, city surveillance,
early warning systems, etc. All those applications position sensor nodes and
collect their data for a long time period with real-time data flow, which is
considered as big data. Big data may be structured or unstructured and needs to
be stored for further processing and analyzing. Analyzing multimedia big data
is a challenging task requiring a high-level modeling to efficiently extract
valuable information/knowledge from data. In this study, we propose a big
database model based on graph database model for handling data generated by
wireless multimedia sensor networks. We introduce a simulator to generate
synthetic data and store and query big data using graph model as a big
database. For this purpose, we evaluate the well-known graph-based NoSQL
databases, Neo4j and OrientDB, and a relational database, MySQL.We have run a
number of query experiments on our implemented simulator to show that which
database system(s) for surveillance in wireless multimedia sensor networks is
efficient and scalable.
","[{'version': 'v1', 'created': 'Sun, 13 Aug 2017 09:05:58 GMT'}]",2019-07-18,"[['Küçükkeçeci', 'Cihan', ''], ['Yazıcı', 'Adnan', '']]","['Internet of things (IoT)', 'big graph databases', 'NoSQL databases', 'wireless multimedia sensor networks', 'simulator']"
5917,1810.04879,Sao Mai Nguyen,"Maxime Devanne (IMT Atlantique), Sao Mai Nguyen","Generating Shared Latent Variables for Robots to Imitate Human Movements
  and Understand their Physical Limitations",,"Leal-Taix{\'e} L; Roth S. Lecture Notes in Computer Science,
  11130, Springer, Cham, pp.190-197, 2019, Computer Vision -- ECCV 2018
  Workshops",10.1007/978-3-030-11012-3_15,,cs.RO cs.AI cs.CV cs.HC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Assistive robotics and particularly robot coaches may be very helpful for
rehabilitation healthcare. In this context, we propose a method based on
Gaussian Process Latent Variable Model (GP-LVM) to transfer knowledge between a
physiotherapist, a robot coach and a patient. Our model is able to map visual
human body features to robot data in order to facilitate the robot learning and
imitation. In addition , we propose to extend the model to adapt robots'
understanding to patient's physical limitations during the assessment of
rehabilitation exercises. Experimental evaluation demonstrates promising
results for both robot imitation and model adaptation according to the
patients' limitations.
","[{'version': 'v1', 'created': 'Thu, 11 Oct 2018 08:01:08 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Feb 2019 22:09:34 GMT'}, {'version': 'v3', 'created': 'Wed, 3 Nov 2021 09:25:53 GMT'}]",2021-11-04,"[['Devanne', 'Maxime', '', 'IMT Atlantique'], ['Nguyen', 'Sao Mai', '']]","['Robot imitation', 'transfer knowledge', 'physical rehabilitation', 'shared Gaussian Process Latent Variable Model', 'motion analysis']"
5918,2001.10248,Tobias Urban,"Tobias Urban, Martin Degeling, Thorsten Holz, Norbert Pohlmann",Beyond the Front Page: Measuring Third Party Dynamics in the Field,,,10.1145/3366423.3380203,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  In the modern Web, service providers often rely heavily on third parties to
run their services. For example, they make use of ad networks to finance their
services, externally hosted libraries to develop features quickly, and
analytics providers to gain insights into visitor behavior.
  For security and privacy, website owners need to be aware of the content they
provide their users. However, in reality, they often do not know which third
parties are embedded, for example, when these third parties request additional
content as it is common in real-time ad auctions.
  In this paper, we present a large-scale measurement study to analyze the
magnitude of these new challenges. To better reflect the connectedness of third
parties, we measured their relations in a model we call third party trees,
which reflects an approximation of the loading dependencies of all third
parties embedded into a given website. Using this concept, we show that
including a single third party can lead to subsequent requests from up to eight
additional services. Furthermore, our findings indicate that the third parties
embedded on a page load are not always deterministic, as 50% of the branches in
the third party trees change between repeated visits. In addition, we found
that 93% of the analyzed websites embedded third parties that are located in
regions that might not be in line with the current legal framework. Our study
also replicates previous work that mostly focused on landing pages of websites.
We show that this method is only able to measure a lower bound as subsites show
a significant increase of privacy-invasive techniques. For example, our results
show an increase of used cookies by about 36% when crawling websites more
deeply.
","[{'version': 'v1', 'created': 'Tue, 28 Jan 2020 10:29:15 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Feb 2020 08:00:04 GMT'}]",2020-02-04,"[['Urban', 'Tobias', ''], ['Degeling', 'Martin', ''], ['Holz', 'Thorsten', ''], ['Pohlmann', 'Norbert', '']]","['third parties', 'cookies', 'privacy', 'web measurement']"
5919,1704.03669,Jelmer Wolterink,"Jelmer M. Wolterink and Tim Leiner and Max A. Viergever and Ivana
  I\v{s}gum","Dilated Convolutional Neural Networks for Cardiovascular MR Segmentation
  in Congenital Heart Disease",,"RAMBO 2016, HVSMR 2016. LNCS 10129. pp. 95-102",10.1007/978-3-319-52280-7_9,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an automatic method using dilated convolutional neural networks
(CNNs) for segmentation of the myocardium and blood pool in cardiovascular MR
(CMR) of patients with congenital heart disease (CHD).
  Ten training and ten test CMR scans cropped to an ROI around the heart were
provided in the MICCAI 2016 HVSMR challenge. A dilated CNN with a receptive
field of 131x131 voxels was trained for myocardium and blood pool segmentation
in axial, sagittal and coronal image slices. Performance was evaluated within
the HVSMR challenge.
  Automatic segmentation of the test scans resulted in Dice indices of
0.80$\pm$0.06 and 0.93$\pm$0.02, average distances to boundaries of
0.96$\pm$0.31 and 0.89$\pm$0.24 mm, and Hausdorff distances of 6.13$\pm$3.76
and 7.07$\pm$3.01 mm for the myocardium and blood pool, respectively.
Segmentation took 41.5$\pm$14.7 s per scan.
  In conclusion, dilated CNNs trained on a small set of CMR images of CHD
patients showing large anatomical variability provide accurate myocardium and
blood pool segmentations.
","[{'version': 'v1', 'created': 'Wed, 12 Apr 2017 09:28:40 GMT'}]",2017-04-13,"[['Wolterink', 'Jelmer M.', ''], ['Leiner', 'Tim', ''], ['Viergever', 'Max A.', ''], ['Išgum', 'Ivana', '']]","['Deep learning', 'Dilated convolutional neural networks', 'Medical image segmentation', 'Cardiovascular MR', 'Congenital heart disease']"
5920,2003.11561,Felipe Maia Polo,"Felipe Maia Polo, Itamar Ciochetti, Emerson Bertolo","Predicting Legal Proceedings Status: Approaches Based on Sequential Text
  Data","Published at the 18th International Conference on Artificial
  Intelligence and Law (ICAIL) 2021 as an extended abstract",,10.1145/3462757.3466138,,cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The objective of this paper is to develop predictive models to classify
Brazilian legal proceedings in three possible classes of status: (i) archived
proceedings, (ii) active proceedings, and (iii) suspended proceedings. This
problem's resolution is intended to assist public and private institutions in
managing large portfolios of legal proceedings, providing gains in scale and
efficiency. In this paper, legal proceedings are made up of sequences of short
texts called ""motions."" We combined several natural language processing (NLP)
and machine learning techniques to solve the problem. Although working with
Portuguese NLP, which can be challenging due to lack of resources, our
approaches performed remarkably well in the classification task, achieving
maximum accuracy of .93 and top average F1 Scores of .89 (macro) and .93
(weighted). Furthermore, we could extract and interpret the patterns learned by
one of our models besides quantifying how those patterns relate to the
classification task. The interpretability step is important among machine
learning legal applications and gives us an exciting insight into how black-box
models make decisions.
","[{'version': 'v1', 'created': 'Fri, 13 Mar 2020 19:40:57 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Oct 2020 20:36:55 GMT'}, {'version': 'v3', 'created': 'Mon, 19 Apr 2021 16:24:36 GMT'}, {'version': 'v4', 'created': 'Wed, 23 Jun 2021 02:57:08 GMT'}]",2021-06-24,"[['Polo', 'Felipe Maia', ''], ['Ciochetti', 'Itamar', ''], ['Bertolo', 'Emerson', '']]","['Law', 'Machine Learning', 'Natural Language Processing', 'Text Sequences']"
5921,2201.10833,Alexander Barabanov,"Alexander Barabanov, Denis Dergunov, Denis Makrushin, Aleksey Teplov","Automatic detection of access control vulnerabilities via API
  specification processing",,Voprosy kiberbezopasnosti.2022.1(47).p.49-65,10.21681/2311-3456-2022-1-49-65,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Objective. Insecure Direct Object Reference (IDOR) or Broken Object Level
Authorization (BOLA) are one of the critical type of access control
vulnerabilities for modern applications. As a result, an attacker can bypass
authorization checks leading to information leakage, account takeover. Our main
research goal was to help an application security architect to optimize
security design and testing process by giving an algorithm and tool that allows
to automatically analyze system API specifications and generate list of
possible vulnerabilities and attack vector ready to be used as security
non-functional requirements. Method. We conducted a multivocal review of
research and conference papers, bug bounty program reports and other grey
sources of literature to outline patterns of attacks against IDOR
vulnerability. These attacks are collected in groups proceeding with further
analysis common attributes between these groups and what features compose the
group. Endpoint properties and attack techniques comprise a group of attacks.
Mapping between group features and existing OpenAPI specifications is performed
to implement a tool for automatic discovery of potentially vulnerable
endpoints. Results and practical relevance. In this work, we provide
systematization of IDOR/BOLA attack techniques based on literature review, real
cases analysis and derive IDOR/BOLA attack groups. We proposed an approach to
describe IDOR/BOLA attacks based on OpenAPI specifications properties. We
develop an algorithm of potential IDOR/BOLA vulnerabilities detection based on
OpenAPI specification processing. We implemented our novel algorithm using
Python and evaluated it. The results show that algorithm is resilient and can
be used in practice to detect potential IDOR/BOLA vulnerabilities.
","[{'version': 'v1', 'created': 'Wed, 26 Jan 2022 09:25:05 GMT'}]",2022-01-27,"[['Barabanov', 'Alexander', ''], ['Dergunov', 'Denis', ''], ['Makrushin', 'Denis', ''], ['Teplov', 'Aleksey', '']]","['microservices', 'security', 'threat modeling', 'REST API', 'Insecure Direct Object Reference', 'Broken object level authorization', 'access control vulnerability']"
5922,2205.00926,Daria Alexander,"Daria Alexander, Wojciech Kusa, Arjen P. de Vries",ORCAS-I: Queries Annotated with Intent using Weak Supervision,presented at SIGIR 2022 (resource track),,10.1145/3477495.3531737,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  User intent classification is an important task in information retrieval. In
this work, we introduce a revised taxonomy of user intent. We take the widely
used differentiation between navigational, transactional and informational
queries as a starting point, and identify three different sub-classes for the
informational queries: instrumental, factual and abstain. The resulting
classification of user queries is more fine-grained, reaches a high level of
consistency between annotators, and can serve as the basis for an effective
automatic classification process. The newly introduced categories help
distinguish between types of queries that a retrieval system could act upon,
for example by prioritizing different types of results in the ranking.We have
used a weak supervision approach based on Snorkel to annotate the ORCAS dataset
according to our new user intent taxonomy, utilising established heuristics and
keywords to construct rules for the prediction of the intent category. We then
present a series of experiments with a variety of machine learning models,
using the labels from the weak supervision stage as training data, but find
that the results produced by Snorkel are not outperformed by these competing
approaches and can be considered state-of-the-art. The advantage of a
rule-based approach like Snorkel's is its efficient deployment in an actual
system, where intent classification would be executed for every query issued.
The resource released with this paper is the ORCAS-I dataset: a labelled
version of the ORCAS click-based dataset of Web queries, which provides 18
million connections to 10 million distinct queries.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 14:10:36 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Sep 2022 14:07:15 GMT'}]",2022-09-28,"[['Alexander', 'Daria', ''], ['Kusa', 'Wojciech', ''], ['de Vries', 'Arjen P.', '']]","['intent labelling', 'weak supervision', 'click data', 'Snorkel', 'web search']"
5923,2203.10647,Nguyen Khoi Tran,"Nguyen Khoi Tran, M. Ali Babar, Andrew Walters","A Framework for Automating Deployment and Evaluation of Blockchain
  Network",Published in the Journal of Network and Computer Applications,,10.1016/j.jnca.2022.103460,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Blockchain network deployment and evaluation have become prevalent due to the
demand for private blockchains by enterprises, governments, and edge computing
systems. Whilst a blockchain network's deployment and evaluation are driven by
its architecture, practitioners still need to learn and carry out many
repetitive and error-prone activities to transform architecture into an
operational blockchain network and evaluate it. Greater efficiency could be
gained if practitioners focus solely on the architecture design, a valuable and
hard-to-automate activity, and leave the implementation steps to an automation
framework. This paper proposes an automation framework called NVAL (Network
Deployment and Evaluation Framework), which can deploy and evaluate blockchain
networks based on their architecture specifications. The key idea of NVAL is
reusing and combining the existing automation scripts and utilities of various
blockchain types to deploy and evaluate incoming blockchain network
architectures. We propose a novel meta-model to capture blockchain network
architectures as computer-readable artefacts and employ a state-space search
approach to plan and conduct their deployment and evaluation. An evaluative
case study shows that NVAL successfully combines seven deployment and
evaluation procedures to deploy 65 networks with 12 different architectures and
generate 295 evaluation datasets whilst incurring a negligible processing time
overhead.
","[{'version': 'v1', 'created': 'Sun, 20 Mar 2022 21:02:41 GMT'}, {'version': 'v2', 'created': 'Sun, 24 Jul 2022 21:58:23 GMT'}]",2022-07-26,"[['Tran', 'Nguyen Khoi', ''], ['Babar', 'M. Ali', ''], ['Walters', 'Andrew', '']]","['Blockchain', 'Distributed Ledger', 'Deployment', 'Evaluation', 'Automation', 'Framework']"
5924,1904.05926,Tamara Radivilova A,"Dmytro Ageyev and Lyudmyla Kirichenko and Tamara Radivilova and Maksym
  TawalbehRadivilova and Maksym Tawalbeh and Oleksii Baranovskyi","Method of Self-Similar Load Balancing in Network Intrusion Detection
  System","5 pages. 2018 28th International Conference Radioelektronika
  (RADIOELEKTRONIKA)",,10.1109/RADIOELEK.2018.8376406,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the problem of load balancing in network intrusion detection
system is considered. Load balancing method based on work of several components
of network intrusion detection system and on the analysis of multifractal
properties of incoming traffic is proposed. The proposed method takes into
account a degree of multifractality for calculation of deep packet inspection
time, on the basis of which the time necessary for comparing the packet with
the signatures is calculated. Load balancing rules are generated using the
estimated average deep packet inspection time and the multifractality
parameters of incoming load. Comparative analysis of the proposed load
balancing method with the standard one showed that the proposed method improves
the quality of service parameters and the percentage of packets that are not
analyzed.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2019 18:57:34 GMT'}]",2019-04-15,"[['Ageyev', 'Dmytro', ''], ['Kirichenko', 'Lyudmyla', ''], ['Radivilova', 'Tamara', ''], ['TawalbehRadivilova', 'Maksym', ''], ['Tawalbeh', 'Maksym', ''], ['Baranovskyi', 'Oleksii', '']]","['load balancing', 'intrusion detection system', 'self']"
5925,2008.05611,Feng Xia,"Poria Pirozmand, Guowei Wu, Behrouz Jedari, Feng Xia","Human Mobility in Opportunistic Networks: Characteristics, Models and
  Prediction Methods","18 pages, 1 figure","Journal of Network and Computer Applications, Volume 42, June 2014",10.1016/j.jnca.2014.03.007,,cs.SI cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Opportunistic networks (OppNets) are modern types of intermittently connected
networks in which mobile users communicate with each other via their
short-range devices to share data among interested observers. In this setting,
humans are the main carriers of mobile devices. As such, this mobility can be
exploited by retrieving inherent user habits, interests, and social features
for the simulation and evaluation of various scenarios. Several research
challenges concerning human mobility in OppNets have been explored in the
literature recently. In this paper, we present a thorough survey of human
mobility issues in three main groups (1) mobility characteristics, (2) mobility
models and traces, and (3) mobility prediction techniques. Firstly, spatial,
temporal, and connectivity properties of human motion are explored. Secondly,
real mobility traces which have been captured using Bluetooth/Wi-Fi
technologies or location-based social networks are summarized. Furthermore,
simulation-based mobility models are categorized and state-of-the art articles
in each category are highlighted. Thirdly, new human mobility prediction
techniques which aim to forecast the three aspects of human mobility, i.e.,
users' next walks, stay duration and contact opportunities are studied
comparatively. To conclude, some major open issues are outlined.
","[{'version': 'v1', 'created': 'Sun, 9 Aug 2020 04:01:38 GMT'}]",2020-08-14,"[['Pirozmand', 'Poria', ''], ['Wu', 'Guowei', ''], ['Jedari', 'Behrouz', ''], ['Xia', 'Feng', '']]","['Opportunistic networks', 'human mobility characteristics', 'real traces', 'simulation-based models', 'mobility prediction']"
5926,1906.07631,Fehmi Cirak,"Ge Yin, Xiao Xiao, Fehmi Cirak",Topologically robust CAD model generation for structural optimisation,,,10.1016/j.cma.2020.113102,,cs.GR cs.CE cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer-aided design (CAD) models play a crucial role in the design,
manufacturing and maintenance of products. Therefore, the mesh-based finite
element descriptions common in structural optimisation must be first translated
into CAD models. Currently, this can at best be performed semi-manually. We
propose a fully automated and topologically accurate approach to synthesise a
structurally-sound parametric CAD model from topology optimised finite element
models. Our solution is to first convert the topology optimised structure into
a spatial frame structure and then to regenerate it in a CAD system using
standard constructive solid geometry (CSG) operations. The obtained parametric
CAD models are compact, that is, have as few as possible geometric parameters,
which makes them ideal for editing and further processing within a CAD system.
The critical task of converting the topology optimised structure into an
optimal spatial frame structure is accomplished in several steps. We first
generate from the topology optimised voxel model a one-voxel-wide voxel chain
model using a topology-preserving skeletonisation algorithm from digital
topology. The weighted undirected graph defined by the voxel chain model yields
a spatial frame structure after processing it with standard graph algorithms.
Subsequently, we optimise the cross-sections and layout of the frame members to
recover its optimality, which may have been compromised during the conversion
process. At last, we generate the obtained frame structure in a CAD system by
repeatedly combining primitive solids, like cylinders and spheres, using
boolean operations. The resulting solid model is a boundary representation
(B-Rep) consisting of trimmed non-uniform rational B-spline (NURBS) curves and
surfaces.
","[{'version': 'v1', 'created': 'Mon, 17 Jun 2019 15:09:02 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Jun 2020 22:20:33 GMT'}]",2020-07-15,"[['Yin', 'Ge', ''], ['Xiao', 'Xiao', ''], ['Cirak', 'Fehmi', '']]","['topology optimisation', 'computer-aided design', 'digital topology', 'homotopic skeletonisation', 'CSG tree']"
5927,2012.04372,"Peter F\""orster","Peter F\""orster, Sebastian Sch\""ops, Joachim Enders, Maximilian
  Herbert, Abele Simona","Freeform shape optimization of a compact DC photo-electron gun using
  isogeometric analysis",,"Phys. Rev. Accel. Beams 25, 034601 (2022)",10.1103/physrevaccelbeams.25.034601,,cs.CE physics.acc-ph,http://creativecommons.org/licenses/by/4.0/,"  Compact DC high-voltage photo-electron guns are able to meet the
sophisticated demands of high-current applications such as energy recovery
linacs. A main design parameter for such sources is the electric field
strength, which depends on the electrode geometry and is limited by the field
emission threshold of the electrode material. In order to minimize the maximum
field strength for optimal gun operation, isogeometric analysis (IGA) can be
used to exploit the axisymmetric geometry and describe its cross section by
non-uniform rational B-splines, the control points of which are the parameters
to be optimized. This computationally efficient method is capable of describing
CAD-generated geometries using open source software (GeoPDEs, NLopt, Octave)
and it can simplify the step from design to simulation. We will present the
mathematical formulation, the software workflow, and the results of an
IGA-based shape optimization for a planned high-voltage upgrade of the DC
photogun teststand Photo-CATCH at TU Darmstadt. The software builds on a
general framework for isogeometric analysis and allows for easy adaptations to
other geometries or quantities of interest. Simulations assuming a bias voltage
of -300 kV yielded maximum field gradients of 9.06 MV/m on the surface of an
inverted insulator electrode and below 3 MV/m on the surface of the
photocathode.
","[{'version': 'v1', 'created': 'Tue, 8 Dec 2020 11:31:39 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Mar 2022 19:13:46 GMT'}]",2022-03-09,"[['Förster', 'Peter', ''], ['Schöps', 'Sebastian', ''], ['Enders', 'Joachim', ''], ['Herbert', 'Maximilian', ''], ['Simona', 'Abele', '']]","['electron gun', 'shape optimization', 'finite elements', 'splines']"
5928,2203.10965,Junda He,"Junda He, Bowen Xu, Zhou Yang, DongGyun Han, Chengran Yang, and David
  Lo","PTM4Tag: Sharpening Tag Recommendation of Stack Overflow Posts with
  Pre-trained Models",Accepted for Research Track ICPC 2022,,10.1145/3524610.3527897,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Stack Overflow is often viewed as the most influential Software Question
Answer (SQA) website with millions of programming-related questions and
answers. Tags play a critical role in efficiently structuring the contents in
Stack Overflow and are vital to support a range of site operations, e.g.,
querying relevant contents. Poorly selected tags often introduce extra noise
and redundancy, which leads to tag synonym and tag explosion problems. Thus, an
automated tag recommendation technique that can accurately recommend
high-quality tags is desired to alleviate the problems mentioned above.
Inspired by the recent success of pre-trained language models (PTMs) in natural
language processing (NLP), we present PTM4Tag, a tag recommendation framework
for Stack Overflow posts that utilize PTMs with a triplet architecture, which
models the components of a post, i.e., Title, Description, and Code with
independent language models. To the best of our knowledge, this is the first
work that leverages PTMs in the tag recommendation task of SQA sites. We
comparatively evaluate the performance of PTM4Tag based on five popular
pre-trained models: BERT, RoBERTa, ALBERT, CodeBERT, and BERTOverflow. Our
results show that leveraging the software engineering (SE) domain-specific PTM
CodeBERT in PTM4Tag achieves the best performance among the five considered
PTMs and outperforms the state-of-the-art deep learning (Convolutional Neural
Network-based) approach by a large margin in terms of average $Precision@k$,
$Recall@k$, and $F1$-$score@k$. We conduct an ablation study to quantify the
contribution of a post's constituent components (Title, Description, and Code
Snippets) to the performance of PTM4Tag. Our results show that Title is the
most important in predicting the most relevant tags, and utilizing all the
components achieves the best performance.
","[{'version': 'v1', 'created': 'Mon, 21 Mar 2022 13:24:59 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Mar 2022 07:05:37 GMT'}, {'version': 'v3', 'created': 'Fri, 25 Mar 2022 01:04:47 GMT'}, {'version': 'v4', 'created': 'Wed, 11 May 2022 07:56:55 GMT'}]",2022-05-12,"[['He', 'Junda', ''], ['Xu', 'Bowen', ''], ['Yang', 'Zhou', ''], ['Han', 'DongGyun', ''], ['Yang', 'Chengran', ''], ['Lo', 'David', '']]","['Tag Recommendation', 'Transformer', 'Pre-Trained Models']"
5929,2109.06958,Hang Zhou,Claire Mathieu and Hang Zhou,Probabilistic Analysis of Euclidean Capacitated Vehicle Routing,,,10.4230/LIPIcs.ISAAC.2021.43,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  We give a probabilistic analysis of the unit-demand Euclidean capacitated
vehicle routing problem in the random setting, where the input distribution
consists of $n$ unit-demand customers modeled as independent, identically
distributed uniform random points in the two-dimensional plane. The objective
is to visit every customer using a set of routes of minimum total length, such
that each route visits at most $k$ customers, where $k$ is the capacity of a
vehicle. All of the following results are in the random setting and hold
asymptotically almost surely.
  The best known polynomial-time approximation for this problem is the iterated
tour partitioning (ITP) algorithm, introduced in 1985 by Haimovich and Rinnooy
Kan. They showed that the ITP algorithm is near-optimal when $k$ is either
$o(\sqrt{n})$ or $\omega(\sqrt{n})$, and they asked whether the ITP algorithm
was also effective in the intermediate range. In this work, we show that when
$k=\sqrt{n}$, the ITP algorithm is at best a $(1+c_0)$-approximation for some
positive constant $c_0$.
  On the other hand, the approximation ratio of the ITP algorithm was known to
be at most $0.995+\alpha$ due to Bompadre, Dror, and Orlin, where $\alpha$ is
the approximation ratio of an algorithm for the traveling salesman problem. In
this work, we improve the upper bound on the approximation ratio of the ITP
algorithm to $0.915+\alpha$. Our analysis is based on a new lower bound on the
optimal cost for the metric capacitated vehicle routing problem, which may be
of independent interest.
","[{'version': 'v1', 'created': 'Tue, 14 Sep 2021 20:35:18 GMT'}]",2021-12-14,"[['Mathieu', 'Claire', ''], ['Zhou', 'Hang', '']]","['capacitated vehicle routing', 'iterated tour partitioning', 'probabilistic analysis', 'approximation algorithms']"
5930,1709.01709,Dan Li,"Dan Li, Evangelos Kanoulas",Active Sampling for Large-scale Information Retrieval Evaluation,,,10.1145/3132847.3133015,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evaluation is crucial in Information Retrieval. The development of models,
tools and methods has significantly benefited from the availability of reusable
test collections formed through a standardized and thoroughly tested
methodology, known as the Cranfield paradigm. Constructing these collections
requires obtaining relevance judgments for a pool of documents, retrieved by
systems participating in an evaluation task; thus involves immense human labor.
To alleviate this effort different methods for constructing collections have
been proposed in the literature, falling under two broad categories: (a)
sampling, and (b) active selection of documents. The former devises a smart
sampling strategy by choosing only a subset of documents to be assessed and
inferring evaluation measure on the basis of the obtained sample; the sampling
distribution is being fixed at the beginning of the process. The latter
recognizes that systems contributing documents to be judged vary in quality,
and actively selects documents from good systems. The quality of systems is
measured every time a new document is being judged. In this paper we seek to
solve the problem of large-scale retrieval evaluation combining the two
approaches. We devise an active sampling method that avoids the bias of the
active selection methods towards good systems, and at the same time reduces the
variance of the current sampling approaches by placing a distribution over
systems, which varies as judgments become available. We validate the proposed
method using TREC data and demonstrate the advantages of this new method
compared to past approaches.
","[{'version': 'v1', 'created': 'Wed, 6 Sep 2017 08:15:42 GMT'}]",2017-09-07,"[['Li', 'Dan', ''], ['Kanoulas', 'Evangelos', '']]","['Evaluation', 'Cranfeld', 'Sampling with varying probabilities', 'HorvitzTompson estimator']"
5931,2004.13438,Maher Alharby,Maher Alharby and Aad van Moorsel,BlockSim: An Extensible Simulation Tool for Blockchain Systems,"Frontiers in Blockchain:
  https://www.frontiersin.org/article/10.3389/fbloc.2020.00028",Frontiers in Blockchain 3(2020),10.3389/fbloc.2020.00028,,cs.CR cs.PF,http://creativecommons.org/licenses/by/4.0/,"  Both in the design and deployment of blockchain solutions many
performance-impacting configuration choices need to be made. We introduce
BlockSim, a framework and software tool to build and simulate discrete-event
dynamic systems models for blockchain systems. BlockSim is designed to support
the analysis of a large variety of blockchains and blockchain deployments as
well as a wide set of analysis questions. At the core of BlockSim is a Base
Model, which contains the main model constructs common across various
blockchain systems organized in three abstraction layers (network, consensus
and incentives layer). The Base Model is usable for a wide variety of
blockchain systems and can be extended easily to include system or deployment
particulars. The BlockSim software tool provides a simulator that implements
the Base Model in Python. This paper describes the Base Model, the simulator
implementation, and the application of BlockSim to Bitcoin, Ethereum and other
consensus algorithms. We validate BlockSim simulation results by comparison
with performance results from actual systems and from other studies in the
literature. We close the paper by a BlockSim simulation study of the impact of
uncle blocks rewards on mining decentralization, for a variety of blockchain
configurations.
","[{'version': 'v1', 'created': 'Tue, 28 Apr 2020 11:44:07 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Oct 2020 21:48:10 GMT'}]",2020-10-16,"[['Alharby', 'Maher', ''], ['van Moorsel', 'Aad', '']]","['blockchain', 'performance', 'simulation', 'analysis', 'proof of work', 'consensus', 'Ethereum', 'Bitcoin']"
5932,1703.10859,Stefan Ramson,"Stefan Ramson (Hasso Plattner Institute, Germany), Robert Hirschfeld
  (Hasso Plattner Institute, Germany)",Active Expressions: Basic Building Blocks for Reactive Programming,,"The Art, Science, and Engineering of Programming, 2017, Vol. 1,
  Issue 2, Article 12",10.22152/programming-journal.org/2017/1/12,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern software development without reactive programming is hard to imagine.
Reactive programming favors a wide class of contemporary software systems that
respond to user input, network messages, and other events. While reactive
programming is an active field of research, the implementation of reactive
concepts remains challenging. In particular, change detection represents a hard
but inevitable necessity when implementing reactive concepts. Typically, change
detection mechanisms are not intended for reuse but are tightly coupled to the
particular change resolution mechanism. As a result, developers often have to
re-implement similar abstractions. A reusable primitive for change detection is
still missing. To find a suitable primitive, we identify commonalities in
existing reactive concepts. We discover a class of reactive concepts,
state-based reactive concepts. All state-based reactive concepts share a common
change detection mechanism: they detect changes in the evaluation result of an
expression. On the basis of the identified common change detection mechanism,
we propose active expressions as a reusable primitive. By abstracting the
tedious implementation details of change detection, active expressions can ease
the implementation of reactive programming concepts. We evaluate the design of
active expressions by re-implementing a number of existing state-based reactive
concepts using them. The resulting implementations highlight the expressiveness
of active expressions. Active expressions enable the separation of essential
from non-essential parts when reasoning about reactive programming concepts. By
using active expressions as a primitive for change detection, developers of
reactive language constructs and runtime support can now focus on the design of
how application programmers should be able to react to change. Ultimately, we
would like active expressions to encourage experiments with novel reactive
programming concepts and with that to yield a wider variety of them to explore.
","[{'version': 'v1', 'created': 'Fri, 31 Mar 2017 11:46:09 GMT'}]",2017-04-03,"[['Ramson', 'Stefan', '', 'Hasso Plattner Institute, Germany'], ['Hirschfeld', 'Robert', '', 'Hasso Plattner Institute, Germany']]","['reactive programming', 'object-oriented programming', 'change detection']"
5933,2004.08425,David Daly,Henrik Ingo and David Daly,Automated System Performance Testing at MongoDB,Author Preprint. Appearing in DBTest.io 2020,,10.1145/3395032.3395323,,cs.DB cs.PF cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Distributed Systems Infrastructure (DSI) is MongoDB's framework for running
fully automated system performance tests in our Continuous Integration (CI)
environment. To run in CI it needs to automate everything end-to-end:
provisioning and deploying multi-node clusters, executing tests, tuning the
system for repeatable results, and collecting and analyzing the results. Today
DSI is MongoDB's most used and most useful performance testing tool. It runs
almost 200 different benchmarks in daily CI, and we also use it for manual
performance investigations. As we can alert the responsible engineer in a
timely fashion, all but one of the major regressions were fixed before the
4.2.0 release. We are also able to catch net new improvements, of which DSI
caught 17. We open sourced DSI in March 2020.
","[{'version': 'v1', 'created': 'Fri, 17 Apr 2020 19:14:24 GMT'}]",2020-04-21,"[['Ingo', 'Henrik', ''], ['Daly', 'David', '']]","['Databases', 'Distributed Databases', 'Testing', 'Performance', 'MongoDB', 'Python', 'Cloud']"
5934,2103.00508,Miguel Arana-Catania,"M. Arana-Catania, F.A. Van Lier, Rob Procter, Nataliya Tkachenko,
  Yulan He, Arkaitz Zubiaga, Maria Liakata",Citizen Participation and Machine Learning for a Better Democracy,"19 pages, 5 figures, 4 tables, to appear in Digital Government:
  Research and Practice (DGOV)",,10.1145/3452118,,cs.CL cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The development of democratic systems is a crucial task as confirmed by its
selection as one of the Millennium Sustainable Development Goals by the United
Nations. In this article, we report on the progress of a project that aims to
address barriers, one of which is information overload, to achieving effective
direct citizen participation in democratic decision-making processes. The main
objectives are to explore if the application of Natural Language Processing
(NLP) and machine learning can improve citizens' experience of digital citizen
participation platforms. Taking as a case study the ""Decide Madrid"" Consul
platform, which enables citizens to post proposals for policies they would like
to see adopted by the city council, we used NLP and machine learning to provide
new ways to (a) suggest to citizens proposals they might wish to support; (b)
group citizens by interests so that they can more easily interact with each
other; (c) summarise comments posted in response to proposals; (d) assist
citizens in aggregating and developing proposals. Evaluation of the results
confirms that NLP and machine learning have a role to play in addressing some
of the barriers users of platforms such as Consul currently experience.
","[{'version': 'v1', 'created': 'Sun, 28 Feb 2021 13:30:07 GMT'}]",2021-08-27,"[['Arana-Catania', 'M.', ''], ['Van Lier', 'F. A.', ''], ['Procter', 'Rob', ''], ['Tkachenko', 'Nataliya', ''], ['He', 'Yulan', ''], ['Zubiaga', 'Arkaitz', ''], ['Liakata', 'Maria', '']]","['Natural language processing', 'machine learning', 'digital citizen participation platforms']"
5935,2203.04605,Beomjoon Kim,"Beomjoon Kim, Luke Shimanuki, Leslie Pack Kaelbling, Tom\'as
  Lozano-P\'erez","Representation, learning, and planning algorithms for geometric task and
  motion planning",,International Journal of Robotics Research 2021,10.1177/02783649211038280,,cs.RO cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We present a framework for learning to guide geometric task and motion
planning (GTAMP). GTAMP is a subclass of task and motion planning in which the
goal is to move multiple objects to target regions among movable obstacles. A
standard graph search algorithm is not directly applicable, because GTAMP
problems involve hybrid search spaces and expensive action feasibility checks.
To handle this, we introduce a novel planner that extends basic heuristic
search with random sampling and a heuristic function that prioritizes
feasibility checking on promising state action pairs. The main drawback of such
pure planners is that they lack the ability to learn from planning experience
to improve their efficiency. We propose two learning algorithms to address
this. The first is an algorithm for learning a rank function that guides the
discrete task level search, and the second is an algorithm for learning a
sampler that guides the continuous motionlevel search. We propose design
principles for designing data efficient algorithms for learning from planning
experience and representations for effective generalization. We evaluate our
framework in challenging GTAMP problems, and show that we can improve both
planning and data efficiency
","[{'version': 'v1', 'created': 'Wed, 9 Mar 2022 09:47:01 GMT'}]",2022-03-10,"[['Kim', 'Beomjoon', ''], ['Shimanuki', 'Luke', ''], ['Kaelbling', 'Leslie Pack', ''], ['Lozano-Pérez', 'Tomás', '']]","['Task-and-motion planning', 'graph neural networks', 'generative adversarial networks', 'representations']"
5936,2201.01181,Roman Natarov,"R. Kovtun, S. Radchenko, A. Netreba, O. Sudakov, R. Natarov, Z. Dyka,
  I. Kabin, P. Langend\""orfer",Exploiting EEG Signals for Eye Motion Tracking,5 pages,"2020 IEEE East-West Design & Test Symposium (EWDTS), 2020, pp. 1-5",10.1109/EWDTS50664.2020.9225144,,cs.HC eess.SP,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Human eye tracking devices can help to investigate principles of processing
visual information by humans. The attention focus movement during the gaze can
be used for behavioural analysis of humans. In this work we describe our
experimental system that we designed for synchronous recording of
electroencephalographic signals, events of external tests and gaze direction.
As external tests we used virtual cognitive tests. We investigated the
possibility to exploit electroencephalographic signals for eye motion tracking.
Our experimental system is a first step for the designing an automatic eye
tracking system and can additionally be used as a laboratory equipment for
teaching students.
","[{'version': 'v1', 'created': 'Tue, 4 Jan 2022 15:10:49 GMT'}]",2022-01-05,"[['Kovtun', 'R.', ''], ['Radchenko', 'S.', ''], ['Netreba', 'A.', ''], ['Sudakov', 'O.', ''], ['Natarov', 'R.', ''], ['Dyka', 'Z.', ''], ['Kabin', 'I.', ''], ['Langendörfer', 'P.', '']]","['eye tracking', 'electroencephalographic (EEG) signals', 'exploratory factor analysis', 'visual behavioural analysis']"
5937,2010.11797,Fuli Feng,"Fuli Feng, Weiran Huang, Xiangnan He, Xin Xin, Qifan Wang, Tat-Seng
  Chua","Should Graph Convolution Trust Neighbors? A Simple Causal Inference
  Method",Accepted by SIGIR'21,,10.1145/3404835.3462971,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph Convolutional Network (GCN) is an emerging technique for information
retrieval (IR) applications. While GCN assumes the homophily property of a
graph, real-world graphs are never perfect: the local structure of a node may
contain discrepancy, e.g., the labels of a node's neighbors could vary. This
pushes us to consider the discrepancy of local structure in GCN modeling.
Existing work approaches this issue by introducing an additional module such as
graph attention, which is expected to learn the contribution of each neighbor.
However, such module may not work reliably as expected, especially when there
lacks supervision signal, e.g., when the labeled data is small. Moreover,
existing methods focus on modeling the nodes in the training data, and never
consider the local structure discrepancy of testing nodes.
  This work focuses on the local structure discrepancy issue for testing nodes,
which has received little scrutiny. From a novel perspective of causality, we
investigate whether a GCN should trust the local structure of a testing node
when predicting its label. To this end, we analyze the working mechanism of GCN
with causal graph, estimating the causal effect of a node's local structure for
the prediction. The idea is simple yet effective: given a trained GCN model, we
first intervene the prediction by blocking the graph structure; we then compare
the original prediction with the intervened prediction to assess the causal
effect of the local structure on the prediction. Through this way, we can
eliminate the impact of local structure discrepancy and make more accurate
prediction. Extensive experiments on seven node classification datasets show
that our method effectively enhances the inference stage of GCN.
","[{'version': 'v1', 'created': 'Thu, 22 Oct 2020 15:21:47 GMT'}, {'version': 'v2', 'created': 'Sun, 6 Jun 2021 06:29:34 GMT'}]",2021-06-08,"[['Feng', 'Fuli', ''], ['Huang', 'Weiran', ''], ['He', 'Xiangnan', ''], ['Xin', 'Xin', ''], ['Wang', 'Qifan', ''], ['Chua', 'Tat-Seng', '']]","['GCN', 'Causal Intervention', 'Model Inference']"
5938,1802.00539,Ruyue Xin,Ruyue Xin and Jiang Zhang and Yitong Shao,Complex Network Classification with Convolutional Neural Network,,,10.26599/TST.2019.9010055,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classifying large scale networks into several categories and distinguishing
them according to their fine structures is of great importance with several
applications in real life. However, most studies of complex networks focus on
properties of a single network but seldom on classification, clustering, and
comparison between different networks, in which the network is treated as a
whole. Due to the non-Euclidean properties of the data, conventional methods
can hardly be applied on networks directly. In this paper, we propose a novel
framework of complex network classifier (CNC) by integrating network embedding
and convolutional neural network to tackle the problem of network
classification. By training the classifiers on synthetic complex network data
and real international trade network data, we show CNC can not only classify
networks in a high accuracy and robustness, it can also extract the features of
the networks automatically.
","[{'version': 'v1', 'created': 'Fri, 2 Feb 2018 02:12:33 GMT'}, {'version': 'v2', 'created': 'Sun, 8 Apr 2018 13:31:41 GMT'}]",2022-09-07,"[['Xin', 'Ruyue', ''], ['Zhang', 'Jiang', ''], ['Shao', 'Yitong', '']]","['Complex network', 'network classifcation', 'DeepWalk', 'CNN']"
5939,2008.11958,Setareh Maghsudi,Setareh Maghsudi and Max Davy,"Computational Models of Human Decision-Making with Application to the
  Internet of Everything",,,10.1109/MWC.001.2000250,,cs.MA cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The concept of the Internet of Things (IoT) first appeared a few decades ago.
Today, by the ubiquitous wireless connectivity, the boost of machine learning
and artificial intelligence, and the advances in big data analytics, it is safe
to say that IoT has evolved to a new concept called the Internet of Everything
(IoE) or the Internet of All. IoE has four pillars: Things, human, data, and
processes, which render it as an inhomogeneous large-scale network. A crucial
challenge of such a network is to develop management, analysis, and
optimization policies that besides utility-maximizer machines, also take
irrational humans into account. We discuss several networking applications in
which appropriate modeling of human decision-making is vital. We then provide a
brief review of computational models of human decision-making. Based on one
such model, we develop a solution for a task offloading problem in fog
computing and we analyze the implications of including humans in the loop.
","[{'version': 'v1', 'created': 'Thu, 27 Aug 2020 07:21:47 GMT'}]",2020-11-12,"[['Maghsudi', 'Setareh', ''], ['Davy', 'Max', '']]","['Cognitive hierarchy', 'Decision-making', 'Human agent', 'IoE', 'Prospect theory', 'Social preference']"
5940,1907.05671,Graham Spinks,"Graham Spinks, Marie-Francine Moens",Justifying Diagnosis Decisions by Deep Neural Networks,,,10.1016/j.jbi.2019.103248,,cs.LG cs.CL cs.HC eess.IV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An integrated approach is proposed across visual and textual data to both
determine and justify a medical diagnosis by a neural network. As deep learning
techniques improve, interest grows to apply them in medical applications. To
enable a transition to workflows in a medical context that are aided by machine
learning, the need exists for such algorithms to help justify the obtained
outcome so human clinicians can judge their validity. In this work, deep
learning methods are used to map a frontal X-Ray image to a continuous textual
representation. This textual representation is decoded into a diagnosis and the
associated textual justification that will help a clinician evaluate the
outcome. Additionally, more explanatory data is provided for the diagnosis by
generating a realistic X-Ray that belongs to the nearest alternative diagnosis.
With a clinical expert opinion study on a subset of the X-Ray data set from the
Indiana University hospital network, we demonstrate that our justification
mechanism significantly outperforms existing methods that use saliency maps.
While performing multi-task training with multiple loss functions, our method
achieves excellent diagnosis accuracy and captioning quality when compared to
current state-of-the-art single-task methods.
","[{'version': 'v1', 'created': 'Fri, 12 Jul 2019 10:51:48 GMT'}]",2019-07-15,"[['Spinks', 'Graham', ''], ['Moens', 'Marie-Francine', '']]","['Justification', 'Neural Networks', 'Text representations', 'Generalization', 'X-Ray diagnosis']"
5941,2212.00104,Aaron Paul Dela Rosa,"Aaron Paul M. Dela Rosa, Luigi Miguel M. Villanueva, John Mardy R. San
  Miguel, and John Emmanuel B. Quinto",Web-based Database Courses E-Learning Application,,"International Journal of Computing Sciences Research (ISSN print:
  2546-0552; ISSN online: 2546-115X) Vol. 6, August 20, 2022",10.25147/ijcsr.2017.001.1.115,,cs.HC cs.CY,http://creativecommons.org/licenses/by/4.0/,"  This study was focused on the development of a web e-learning application for
the database courses taken by Information Technology (IT) students at the
College of Information and Communications Technology (CICT) of Bulacan State
University (BulSU). The research methodology used in this project was the
cross-sectional developmental approach. The Agile Software Development
methodology was followed phase by phase, up to the development phase, to
develop the system. It was used to produce the desired output rapidly while
allowing users to go back through phases without finishing the whole cycle. The
goal of this study was to create a web application that teaches Structured
Query Language (SQL) in both the MySQL and SQL Server approaches. The
application contains quizzes and examinations to allow self-assessment of
learning. Additionally, an Entity Relationship Diagram (ERD) simulation was
included to provide ERD creations in a drag-and-drop fashion. This study was
evaluated using ISO/IEC 25010 software quality evaluation criteria. The study's
overall mean was 4.24, 4.41, and 4.33, all with the descriptive meaning of
""Very Good,"" which showed that the system performed its necessary functions as
perceived by students, faculty members, and experts, respectively. In summary,
the e-learning web application for database courses was fully developed.
Moreover, the entity-relationship diagram was integrated well within the system
and is accessible to the users. Lastly, respondents evaluated the developed web
application using the ISO/IEC 25010 with an overall descriptive interpretation
of ""Very Good."" For future developments of the study, an administrator panel
may be developed to manage users and do other administrative tasks. Lastly,
higher-order thinking skills questions on assessments and quizzes may be
included.
","[{'version': 'v1', 'created': 'Wed, 23 Nov 2022 06:40:24 GMT'}]",2022-12-02,"[['Rosa', 'Aaron Paul M. Dela', ''], ['Villanueva', 'Luigi Miguel M.', ''], ['Miguel', 'John Mardy R. San', ''], ['Quinto', 'John Emmanuel B.', '']]","['e-learning', 'database', 'structured query language', 'learning management', 'web application development   INTRODUCTION']"
5942,2107.08185,Roopak Sinha,"Shihui Han, Roopak Sinha, and Andrew Lowe","Assessing Support for Industry Standards in Reference Medical Software
  Architectures","Conference paper, 5 pages, 1 figure, 5 tables","Proceedings of the 46th Annual Conference of the IEEE Industrial
  Electronics Society (IECON2020). Singapore, IEEE Computer Society Press,
  pp.3403-3407",10.1109/IECON43393.2020.9255309.,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Industrial standards for developing medical device software provide
requirements that conforming devices must meet. A number of reference software
architectures have been proposed to develop such software. The ISO/IEC
25010:2011 family of standards provides a comprehensive software product
quality model, including characteristics that are highly desirable in medical
devices. Furthermore, frameworks like 4+1 Views provide a robust framework to
develop the software architecture or high level design for any software,
including for medical devices. However, the alignment between industrial
standards and reference architectures for medical device software, on one hand,
and ISO/IEC 25010:2011 and 4+1 Views, on the other, is not well understood.
This paper aims to explore how ISO/IEC 25010:2011 and 4+1 Views are supported
by current standards, namely ISO 13485:2016, ISO 14971:2012, IEC 62304:2006 and
IEC 62366:2015, and current reference architectures for medical device
software. We classified requirements from medical devices standards into
qualities from ISO/IEC 25010:2011 and architectural views from 4+1 Views. A
systematic literature review (SLR) method was followed to review current
references software architectures and a mapping of their support for the
identified ISO/IEC 25010:2011 qualities in the previous step was carried out.
Our results show that ISO/IEC 25010:2011 qualities like functional suitability,
portability, maintainability, usability, security, reliability and
compatibility are highly emphasised in medical device standards. Furthermore,
we show that current reference architectures only partially support these
qualities. This paper can help medical device developers identify focus areas
for developing standards-compliant software. A wider study involving
under-development medical devices can help improve the accuracy of our findings
in the future.
","[{'version': 'v1', 'created': 'Sat, 17 Jul 2021 05:19:53 GMT'}]",2021-07-20,"[['Han', 'Shihui', ''], ['Sinha', 'Roopak', ''], ['Lowe', 'Andrew', '']]","['medical devices', 'standard', 'systematic literature review']"
5943,2112.02175,Grischa Fraumann,"Grischa Fraumann, Ruediger Mutz",The h-index,"In book: Handbook Bibliometrics | Edition: De Gruyter Reference |
  Chapter: 3.4 | Publisher: De Gruyter Saur",,10.1515/9783110646610-018,,cs.DL cs.SI,http://creativecommons.org/licenses/by/4.0/,"  The h-index is a mainstream bibliometric indicator, since it is widely used
in academia, research management and research policy. While its advantages have
been highlighted, such as its simple calculation, it has also received
widespread criticism. The criticism is mainly based on the negative effects it
may have on scholars, when the index is used to describe the quality of a
scholar. The ""h"" means ""highly-cited"" and ""high achievement"", and should not be
confused with the last name of its inventor, Hirsch. Put simply, the h-index
combines a measure of quantity and impact in a single indicator. Several
initiatives try to provide alternatives to the h-index to counter some of its
shortcomings.
","[{'version': 'v1', 'created': 'Fri, 3 Dec 2021 22:16:01 GMT'}]",2021-12-07,"[['Fraumann', 'Grischa', ''], ['Mutz', 'Ruediger', '']]","['h-index', 'metrics', 'author-level metrics', 'indicators', 'productivity', 'publications', 'citation impact']"
5944,2201.00304,Kexuan Xin,"Kexuan Xin, Zequn Sun, Wen Hua, Wei Hu, Xiaofang Zhou",Informed Multi-context Entity Alignment,accepted by wsdm 2022,,10.1145/3488560.3498523,,cs.AI cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Entity alignment is a crucial step in integrating knowledge graphs (KGs) from
multiple sources. Previous attempts at entity alignment have explored different
KG structures, such as neighborhood-based and path-based contexts, to learn
entity embeddings, but they are limited in capturing the multi-context
features. Moreover, most approaches directly utilize the embedding similarity
to determine entity alignment without considering the global interaction among
entities and relations. In this work, we propose an Informed Multi-context
Entity Alignment (IMEA) model to address these issues. In particular, we
introduce Transformer to flexibly capture the relation, path, and neighborhood
contexts, and design holistic reasoning to estimate alignment probabilities
based on both embedding similarity and the relation/entity functionality. The
alignment evidence obtained from holistic reasoning is further injected back
into the Transformer via the proposed soft label editing to inform embedding
learning. Experimental results on several benchmark datasets demonstrate the
superiority of our IMEA model compared with existing state-of-the-art entity
alignment methods.
","[{'version': 'v1', 'created': 'Sun, 2 Jan 2022 06:29:30 GMT'}]",2022-01-04,"[['Xin', 'Kexuan', ''], ['Sun', 'Zequn', ''], ['Hua', 'Wen', ''], ['Hu', 'Wei', ''], ['Zhou', 'Xiaofang', '']]","['Knowledge Graph', 'Entity Alignment', 'Multi-context Transformer', 'Holistic Reasoning']"
5945,1812.10384,Avishek Choudhury,Avishek Choudhury,"Identification of Cancer -- Mesothelioma Disease Using Logistic
  Regression and Association Rule",,"American Journal of Engineering and Applied Sciences 2018,
  11(4):1310.1319",10.3844/ajeassp.2018.1310.1319,,cs.CY cs.LG q-bio.QM stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Malignant Pleural Mesothelioma (MPM) or malignant mesothelioma (MM) is an
atypical, aggressive tumor that matures into cancer in the pleura, a stratum of
tissue bordering the lungs. Diagnosis of MPM is difficult and it accounts for
about seventy-five percent of all mesothelioma diagnosed yearly in the United
States of America. Being a fatal disease, early identification of MPM is
crucial for patient survival. Our study implements logistic regression and
develops association rules to identify early stage symptoms of MM. We retrieved
medical reports generated by Dicle University and implemented logistic
regression to measure the model accuracy. We conducted (a) logistic
correlation, (b) Omnibus test and (c) Hosmer and Lemeshow test for model
evaluation. Moreover, we also developed association rules by confidence, rule
support, lift, condition support and deployability. Categorical logistic
regression increases the training accuracy from 72.30% to 81.40% with a testing
accuracy of 63.46%. The study also shows the top 5 symptoms that is mostly
likely indicates the presence in MM. This study concludes that using predictive
modeling can enhance primary presentation and diagnosis of MM.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2018 16:20:31 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Aug 2019 03:32:24 GMT'}]",2019-08-22,"[['Choudhury', 'Avishek', '']]","['Logistic Regression', 'Mesothelioma', 'Predictive Modeling', 'Cancer Detection', 'Association Rules']"
5946,2002.08523,Rose Bohrer,"Rose Bohrer, Andr\'e Platzer",Constructive Game Logic,"74 pages, extended preprint for ESOP",,10.1007/978-3-030-44914-8_4,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Game Logic is an excellent setting to study proofs-about-programs via the
interpretation of those proofs as programs, because constructive proofs for
games correspond to effective winning strategies to follow in response to the
opponent's actions. We thus develop Constructive Game Logic which extends
Parikh's Game Logic (GL) with constructivity and with first-order programs a la
Pratt's first-order dynamic logic (DL). Our major contributions include:
  1) a novel realizability semantics capturing the adversarial dynamics of
games, 2) a natural deduction calculus and operational semantics describing the
computational meaning of strategies via proof-terms, and 3) theoretical results
including soundness of the proof calculus w.r.t. realizability semantics,
progress and preservation of the operational semantics of proofs, and Existence
Properties on support of the extraction of computational artifacts from game
proofs.
  Together, these results provide the most general account of a Curry-Howard
interpretation for any program logic to date, and the first at all for Game
Logic.
","[{'version': 'v1', 'created': 'Thu, 20 Feb 2020 01:44:24 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Jul 2020 12:44:05 GMT'}]",2022-10-07,"[['Bohrer', 'Rose', ''], ['Platzer', 'André', '']]","['Game Logic', 'Constructive Logic', 'Natural Deduction', 'Proof Terms']"
5947,1711.10079,Ramin Soltani,"Ramin Soltani, Dennis Goeckel, Don Towsley, Amir Houmansadr",Towards Provably Invisible Network Flow Fingerprints,,,10.1109/ACSSC.2017.8335179,,cs.NI cs.CR cs.IT math.IT math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network traffic analysis reveals important information even when messages are
encrypted. We consider active traffic analysis via flow fingerprinting by
invisibly embedding information into packet timings of flows. In particular,
assume Alice wishes to embed fingerprints into flows of a set of network input
links, whose packet timings are modeled by Poisson processes, without being
detected by a watchful adversary Willie. Bob, who receives the set of
fingerprinted flows after they pass through the network modeled as a collection
of independent and parallel $M/M/1$ queues, wishes to extract Alice's embedded
fingerprints to infer the connection between input and output links of the
network. We consider two scenarios: 1) Alice embeds fingerprints in all of the
flows; 2) Alice embeds fingerprints in each flow independently with probability
$p$. Assuming that the flow rates are equal, we calculate the maximum number of
flows in which Alice can invisibly embed fingerprints while having those
fingerprints successfully decoded by Bob. Then, we extend the construction and
analysis to the case where flow rates are distinct, and discuss the extension
of the network model.
","[{'version': 'v1', 'created': 'Tue, 28 Nov 2017 01:44:08 GMT'}, {'version': 'v2', 'created': 'Sun, 23 Sep 2018 02:37:02 GMT'}]",2018-09-25,"[['Soltani', 'Ramin', ''], ['Goeckel', 'Dennis', ''], ['Towsley', 'Don', ''], ['Houmansadr', 'Amir', '']]","['Computer Networks', 'Network Security', 'Network Analysis', 'Network Security Analysis', 'Net']"
5948,2012.00464,Aleksandr Popov,"Milutin Brankovic, Kevin Buchin, Koen Klaren, Andr\'e Nusser,
  Aleksandr Popov, Sampson Wong","(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time
  Warping","12 pages, 16 figures. This is the authors' version of the paper
  published in SIGSPATIAL 2020",,10.1145/3397536.3422245,,cs.LG cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the massively increasing amount of available geospatial data and the
need to present it in an understandable way, clustering this data is more
important than ever. As clusters might contain a large number of objects,
having a representative for each cluster significantly facilitates
understanding a clustering. Clustering methods relying on such representatives
are called center-based. In this work we consider the problem of center-based
clustering of trajectories.
  In this setting, the representative of a cluster is again a trajectory. To
obtain a compact representation of the clusters and to avoid overfitting, we
restrict the complexity of the representative trajectories by a parameter l.
This restriction, however, makes discrete distance measures like dynamic time
warping (DTW) less suited.
  There is recent work on center-based clustering of trajectories with a
continuous distance measure, namely, the Fr\'echet distance. While the
Fr\'echet distance allows for restriction of the center complexity, it can also
be sensitive to outliers, whereas averaging-type distance measures, like DTW,
are less so. To obtain a trajectory clustering algorithm that allows
restricting center complexity and is more robust to outliers, we propose the
usage of a continuous version of DTW as distance measure, which we call
continuous dynamic time warping (CDTW). Our contribution is twofold:
  1. To combat the lack of practical algorithms for CDTW, we develop an
approximation algorithm that computes it.
  2. We develop the first clustering algorithm under this distance measure and
show a practical way to compute a center from a set of trajectories and
subsequently iteratively improve it.
  To obtain insights into the results of clustering under CDTW on practical
data, we conduct extensive experiments.
","[{'version': 'v1', 'created': 'Tue, 1 Dec 2020 13:17:27 GMT'}]",2020-12-02,"[['Brankovic', 'Milutin', ''], ['Buchin', 'Kevin', ''], ['Klaren', 'Koen', ''], ['Nusser', 'André', ''], ['Popov', 'Aleksandr', ''], ['Wong', 'Sampson', '']]","['Trajectory Similarity', 'Trajectory Clustering', 'Continuous DynamicTime Warping']"
5949,2108.02535,Juan Cante,"J. Oliver, D. Yago, J. Cante, O. Lloberas-Valls","Variational approach to relaxed topological optimization: closed form
  solutions for structural problems in a sequential pseudo-time framework",,"Computer Methods in Applied Mechanics and Engineering, 355,
  779-819, 2019",10.1016/j.cma.2019.06.038,,cs.CE math-ph math.MP,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The work explores a specific scenario for structural computational
optimization based on the following elements: (a) a relaxed optimization
setting considering the ersatz (bi-material) approximation, (b) a treatment
based on a nonsmoothed characteristic function field as a topological design
variable, (c) the consistent derivation of a relaxed topological derivative
whose determination is simple, general and efficient, (d) formulation of the
overall increasing cost function topological sensitivity as a suitable
optimality criterion, and (e) consideration of a pseudo-time framework for the
problem solution, ruled by the problem constraint evolution. In this setting,
it is shown that the optimization problem can be analytically solved in a
variational framework, leading to, nonlinear, closed-form algebraic solutions
for the characteristic function, which are then solved, in every time-step, via
fixed point methods based on a pseudo-energy cutting algorithm combined with
the exact fulfillment of the constraint, at every iteration of the non-linear
algorithm, via a bisection method. The issue of the ill-posedness (mesh
dependency) of the topological solution, is then easily solved via a Laplacian
smoothing of that pseudo-energy. In the aforementioned context, a number of
(3D) topological structural optimization benchmarks are solved, and the
solutions obtained with the explored closed-form solution method, are analyzed,
and compared, with their solution through an alternative level set method.
Although the obtained results, in terms of the cost function and topology
designs, are very similar in both methods, the associated computational cost is
about five times smaller in the closedform solution method this possibly being
one of its advantages.
","[{'version': 'v1', 'created': 'Thu, 5 Aug 2021 11:47:01 GMT'}]",2021-08-06,"[['Oliver', 'J.', ''], ['Yago', 'D.', ''], ['Cante', 'J.', ''], ['Lloberas-Valls', 'O.', '']]","['Topological optimization', 'Variational approach', 'Closed-form solutions', 'Pseudo-time sequential analysis', 'Structural topological optimization']"
5950,1710.02315,Thomas Strasser,"Cornelius Steinbrink, Sebastian Lehnhoff, Sebastian Rohjans, Thomas I.
  Strasser, Edmund Widl, Cyndi Moyo, Georg Lauss, Felix Lehfuss, Mario
  Faschang, Peter Palensky, Arjen A. van der Meer, Kai Heussen, Oliver Gehrke,
  Efren Guillo-Sansano, Mazheruddin H. Syed, Abdullah Emhemed, Ron Brandl, Van
  Hoa Nguyen, Ata Khavari, Quoc Tuan Tran, Panos Kotsampopoulos, Nikos
  Hatziargyriou, Akroud Akroud, Evangelos Rikos, Merkebu Z. Degefa","Simulation-based Validation of Smart Grids - Status Quo and Future
  Research Trends","8th International Conference on Industrial Applications of Holonic
  and Multi-Agent Systems (HoloMAS 2017)",,10.1007/978-3-319-64635-0_13,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smart grid systems are characterized by high complexity due to interactions
between a traditional passive network and active power electronic components,
coupled using communication links. Additionally, automation and information
technology plays an important role in order to operate and optimize such
cyber-physical energy systems with a high(er) penetration of fluctuating
renewable generation and controllable loads. As a result of these developments
the validation on the system level becomes much more important during the whole
engineering and deployment process, today. In earlier development stages and
for larger system configurations laboratory-based testing is not always an
option. Due to recent developments, simulation-based approaches are now an
appropriate tool to support the development, implementation, and roll-out of
smart grid solutions. This paper discusses the current state of
simulation-based approaches and outlines the necessary future research and
development directions in the domain of power and energy systems.
","[{'version': 'v1', 'created': 'Fri, 6 Oct 2017 09:04:23 GMT'}]",2017-10-09,"[['Steinbrink', 'Cornelius', ''], ['Lehnhoff', 'Sebastian', ''], ['Rohjans', 'Sebastian', ''], ['Strasser', 'Thomas I.', ''], ['Widl', 'Edmund', ''], ['Moyo', 'Cyndi', ''], ['Lauss', 'Georg', ''], ['Lehfuss', 'Felix', ''], ['Faschang', 'Mario', ''], ['Palensky', 'Peter', ''], ['van der Meer', 'Arjen A.', ''], ['Heussen', 'Kai', ''], ['Gehrke', 'Oliver', ''], ['Guillo-Sansano', 'Efren', ''], ['Syed', 'Mazheruddin H.', ''], ['Emhemed', 'Abdullah', ''], ['Brandl', 'Ron', ''], ['Nguyen', 'Van Hoa', ''], ['Khavari', 'Ata', ''], ['Tran', 'Quoc Tuan', ''], ['Kotsampopoulos', 'Panos', ''], ['Hatziargyriou', 'Nikos', ''], ['Akroud', 'Akroud', ''], ['Rikos', 'Evangelos', ''], ['Degefa', 'Merkebu Z.', '']]","['Co-simulation', 'Cyber-Physical Energy Systems', 'Hardwarein-the-Loop', 'Modeling', 'Real-time Simulation', 'Smart Grids', 'Validation']"
5951,1807.10552,Yongxiang Huang,Yongxiang Huang and Albert Chi-shing Chung,"Improving High Resolution Histology Image Classification with Deep
  Spatial Fusion Network","8 pages, MICCAI workshop preceedings","Computational Pathology and Ophthalmic Medical Image Analysis.
  Springer, Cham, 2018. 19-26",10.1007/978-3-030-00949-6_3,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Histology imaging is an essential diagnosis method to finalize the grade and
stage of cancer of different tissues, especially for breast cancer diagnosis.
Specialists often disagree on the final diagnosis on biopsy tissue due to the
complex morphological variety. Although convolutional neural networks (CNN)
have advantages in extracting discriminative features in image classification,
directly training a CNN on high resolution histology images is computationally
infeasible currently. Besides, inconsistent discriminative features often
distribute over the whole histology image, which incurs challenges in
patch-based CNN classification method. In this paper, we propose a novel
architecture for automatic classification of high resolution histology images.
First, an adapted residual network is employed to explore hierarchical features
without attenuation. Second, we develop a robust deep fusion network to utilize
the spatial relationship between patches and learn to correct the prediction
bias generated from inconsistent discriminative feature distribution. The
proposed method is evaluated using 10-fold cross-validation on 400 high
resolution breast histology images with balanced labels and reports 95%
accuracy on 4-class classification and 98.5% accuracy, 99.6% AUC on 2-class
classification (carcinoma and non-carcinoma), which substantially outperforms
previous methods and close to pathologist performance.
","[{'version': 'v1', 'created': 'Fri, 27 Jul 2018 12:34:34 GMT'}]",2019-09-17,"[['Huang', 'Yongxiang', ''], ['Chung', 'Albert Chi-shing', '']]","['Histology Imaging', 'Computer-aided diagnosis', 'Image Classification', 'Deep Learning']"
5952,1710.04120,Alexander Khoperskov V.,"Alexander Voronin, Inessa Isaeva, Alexander Khoperskov, Sergey
  Grebenjuk","Decision Support System for Urbanization of the Northern Part of the
  Volga-Akhtuba Floodplain (Russia) on the Basis of Interdisciplinary Computer
  Modeling","14 pages, 5 figures; Conference: Creativity in Intelligent
  Technologies and Data Science. CIT&DS 2017","Communications in Computer and Information Science, 2017, vol.
  754, p. 419-429",10.1007/978-3-319-65551-2_30,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a computer decision support system (CDSS) for urbanization of the
northern part of the Volga-Akhtuba floodplain. This system includes subsystems
of cognitive and game-theoretic analysis, geoinformation and hydrodynamic
simulations. The paper presents the cognitive graph, two-level and three-level
models of hierarchical games for the cases of uncontrolled and controlled
development of the problem situation. We described the quantitative analysis of
the effects of different strategies for the spatial distribution of the
urbanized territories. For this reason we conducted the territory zoning
according to the level of negative consequences of urbanization for various
agents. In addition, we found an analytical solution for games with the linear
dependence of the average flooded area on the urbanized area. We numerically
computed a game equilibrium for dependences derived from the imitational
geoinformation and hydrodynamic modeling of flooding. As the result, we showed
that the transition to the three-level management system and the implementation
of an optimal urbanization strategy minimize its negative consequences.
","[{'version': 'v1', 'created': 'Sat, 9 Sep 2017 07:27:09 GMT'}]",2017-10-12,"[['Voronin', 'Alexander', ''], ['Isaeva', 'Inessa', ''], ['Khoperskov', 'Alexander', ''], ['Grebenjuk', 'Sergey', '']]","['cognitive analysis', 'game theory', 'geoinformatics', 'numerical modeling', 'decisionsupport system']"
5953,2101.12075,"David H\""agele","David H\""agele, Moataz Abdelaal, Ozgur S. Oguz, Marc Toussaint, Daniel
  Weiskopf",Visualization of Nonlinear Programming for Robot Motion Planning,"8 pages, 6 figures","Proceedings of the 13th International Symposium on Visual
  Information Communication and Interaction (2020), Article No. 10, Pages 1-8",10.1145/3430036.3430050,,cs.RO cs.HC cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nonlinear programming targets nonlinear optimization with constraints, which
is a generic yet complex methodology involving humans for problem modeling and
algorithms for problem solving. We address the particularly hard challenge of
supporting domain experts in handling, understanding, and trouble-shooting
high-dimensional optimization with a large number of constraints. Leveraging
visual analytics, users are supported in exploring the computation process of
nonlinear constraint optimization. Our system was designed for robot motion
planning problems and developed in tight collaboration with domain experts in
nonlinear programming and robotics. We report on the experiences from this
design study, illustrate the usefulness for relevant example cases, and discuss
the extension to visual analytics for nonlinear programming in general.
","[{'version': 'v1', 'created': 'Thu, 28 Jan 2021 15:47:22 GMT'}]",2021-01-29,"[['Hägele', 'David', ''], ['Abdelaal', 'Moataz', ''], ['Oguz', 'Ozgur S.', ''], ['Toussaint', 'Marc', ''], ['Weiskopf', 'Daniel', '']]","['Visual analytics', 'nonlinear programming', 'trajectory visualization', 'optimization']"
5954,2209.00277,Yan Xia,"Yan Xia, Zhou Zhao, Shangwei Ye, Yang Zhao, Haoyuan Li, Yi Ren",Video-Guided Curriculum Learning for Spoken Video Grounding,Accepted by ACM MM 2022,,10.1145/3503161.3547996,,cs.CV cs.CL cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce a new task, spoken video grounding (SVG), which
aims to localize the desired video fragments from spoken language descriptions.
Compared with using text, employing audio requires the model to directly
exploit the useful phonemes and syllables related to the video from raw speech.
Moreover, we randomly add environmental noises to this speech audio, further
increasing the difficulty of this task and better simulating real applications.
To rectify the discriminative phonemes and extract video-related information
from noisy audio, we develop a novel video-guided curriculum learning (VGCL)
during the audio pre-training process, which can make use of the vital visual
perceptions to help understand the spoken language and suppress the external
noise. Considering during inference the model can not obtain ground truth video
segments, we design a curriculum strategy that gradually shifts the input video
from the ground truth to the entire video content during pre-training. Finally,
the model can learn how to extract critical visual information from the entire
video clip to help understand the spoken language. In addition, we collect the
first large-scale spoken video grounding dataset based on ActivityNet, which is
named as ActivityNet Speech dataset. Extensive experiments demonstrate our
proposed video-guided curriculum learning can facilitate the pre-training
process to obtain a mutual audio encoder, significantly promoting the
performance of spoken video grounding tasks. Moreover, we prove that in the
case of noisy sound, our model outperforms the method that grounding video with
ASR transcripts, further demonstrating the effectiveness of our curriculum
strategy.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2022 07:47:01 GMT'}]",2022-09-02,"[['Xia', 'Yan', ''], ['Zhao', 'Zhou', ''], ['Ye', 'Shangwei', ''], ['Zhao', 'Yang', ''], ['Li', 'Haoyuan', ''], ['Ren', 'Yi', '']]","['datasets', 'contrastive learning', 'curriculum learning', 'video grounding']"
5955,1802.00148,Minjia Shi,"Minjia Shi, Hongwei Zhu, Patrick Sol\'e, and G\'erard D. Cohen",How many weights can a linear code have ?,,"Designs, Codes and Cryptography, 2018",10.1007/s10623-018-0488-z,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the combinatorial function $L(k,q),$ the maximum number of nonzero
weights a linear code of dimension $k$ over $\F_q$ can have. We determine it
completely for $q=2,$ and for $k=2,$ and provide upper and lower bounds in the
general case when both $k$ and $q$ are $\ge 3.$ A refinement $L(n,k,q),$ as
well as nonlinear analogues $N(M,q)$ and $N(n,M,q),$ are also introduced and
studied.
","[{'version': 'v1', 'created': 'Thu, 1 Feb 2018 03:48:02 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Apr 2018 01:23:45 GMT'}]",2018-04-26,"[['Shi', 'Minjia', ''], ['Zhu', 'Hongwei', ''], ['Solé', 'Patrick', ''], ['Cohen', 'Gérard D.', '']]","['linear codes', 'Hamming weight', 'perfect difference sets']"
5956,1911.07841,Tiancheng Xu,"Tiancheng Xu, Boyuan Tian, Yuhao Zhu",Tigris: Architecture and Algorithms for 3D Perception in Point Clouds,"Published at MICRO-52 (52nd IEEE/ACM International Symposium on
  Microarchitecture); Tiancheng Xu and Boyuan Tian are co-primary authors",,10.1145/3352460.3358259,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Machine perception applications are increasingly moving toward manipulating
and processing 3D point cloud. This paper focuses on point cloud registration,
a key primitive of 3D data processing widely used in high-level tasks such as
odometry, simultaneous localization and mapping, and 3D reconstruction. As
these applications are routinely deployed in energy-constrained environments,
real-time and energy-efficient point cloud registration is critical.
  We present Tigris, an algorithm-architecture co-designed system specialized
for point cloud registration. Through an extensive exploration of the
registration pipeline design space, we find that, while different design points
make vastly different trade-offs between accuracy and performance, KD-tree
search is a common performance bottleneck, and thus is an ideal candidate for
architectural specialization. While KD-tree search is inherently sequential, we
propose an acceleration-amenable data structure and search algorithm that
exposes different forms of parallelism of KD-tree search in the context of
point cloud registration. The co-designed accelerator systematically exploits
the parallelism while incorporating a set of architectural techniques that
further improve the accelerator efficiency. Overall, Tigris achieves
77.2$\times$ speedup and 7.4$\times$ power reduction in KD-tree search over an
RTX 2080 Ti GPU, which translates to a 41.7% registration performance
improvements and 3.0$\times$ power reduction.
","[{'version': 'v1', 'created': 'Sat, 16 Nov 2019 16:54:53 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Nov 2019 01:41:17 GMT'}, {'version': 'v3', 'created': 'Thu, 21 Nov 2019 01:42:42 GMT'}]",2019-11-22,"[['Xu', 'Tiancheng', ''], ['Tian', 'Boyuan', ''], ['Zhu', 'Yuhao', '']]","['Perception', 'Point Cloud', 'Registration', 'KD-Tree', 'Nearest NeighborSearch', 'Architecture-Algorithm Co-Design']"
5957,2001.04918,Burak \c{C}akmak,Burak \c{C}akmak and Manfred Opper,"Analysis of Bayesian Inference Algorithms by the Dynamical Functional
  Approach","25 pages, 2 figures",,10.1088/1751-8121/ab8ff4,,cs.LG cond-mat.dis-nn stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze the dynamics of an algorithm for approximate inference with large
Gaussian latent variable models in a student-teacher scenario. To model
nontrivial dependencies between the latent variables, we assume random
covariance matrices drawn from rotation invariant ensembles. For the case of
perfect data-model matching, the knowledge of static order parameters derived
from the replica method allows us to obtain efficient algorithmic updates in
terms of matrix-vector multiplications with a fixed matrix. Using the dynamical
functional approach, we obtain an exact effective stochastic process in the
thermodynamic limit for a single node. From this, we obtain closed-form
expressions for the rate of the convergence. Analytical results are excellent
agreement with simulations of single instances of large models.
","[{'version': 'v1', 'created': 'Tue, 14 Jan 2020 17:22:02 GMT'}]",2020-08-26,"[['Çakmak', 'Burak', ''], ['Opper', 'Manfred', '']]","['Bayesian Inference', 'Iterative Algorithms', 'TAP Equations', 'Random Matrices', 'Dynamical Functional Theory']"
5958,2208.11167,Li Ding,"Li Ding, Lee Spector","Evolutionary Quantum Architecture Search for Parametrized Quantum
  Circuits",,"Proceedings of the 2022 Genetic and Evolutionary Computation
  Conference Companion (pp. 2190-2195)",10.3390/e25010093,,cs.NE quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advancements in quantum computing have shown promising computational
advantages in many problem areas. As one of those areas with increasing
attention, hybrid quantum-classical machine learning systems have demonstrated
the capability to solve various data-driven learning tasks. Recent works show
that parameterized quantum circuits (PQCs) can be used to solve challenging
reinforcement learning (RL) tasks with provable learning advantages. While
existing works yield potentials of PQC-based methods, the design choices of PQC
architectures and their influences on the learning tasks are generally
underexplored. In this work, we introduce EQAS-PQC, an evolutionary quantum
architecture search framework for PQC-based models, which uses a
population-based genetic algorithm to evolve PQC architectures by exploring the
search space of quantum operations. Experimental results show that our method
can significantly improve the performance of hybrid quantum-classical models in
solving benchmark reinforcement problems. We also model the probability
distributions of quantum operations in top-performing architectures to identify
essential design choices that are critical to the performance.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2022 19:47:37 GMT'}]",2023-01-18,"[['Ding', 'Li', ''], ['Spector', 'Lee', '']]","['evolutionary algorithms', 'quantum computing', 'quantum architecture search', 'reinforcement learning']"
5959,2202.11089,Chirag Nagpal,"Chirag Nagpal, Mononito Goswami, Keith Dufendach and Artur Dubrawski",Counterfactual Phenotyping with Censored Time-to-Events,"KDD 2022 Applied Data Science Paper. Note this version includes a
  correction of the published version in the definition of Restricted Mean
  Survival Time",,10.1145/3534678.3539110,,cs.LG stat.AP stat.ME stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Estimation of treatment efficacy of real-world clinical interventions
involves working with continuous outcomes such as time-to-death,
re-hospitalization, or a composite event that may be subject to censoring.
Counterfactual reasoning in such scenarios requires decoupling the effects of
confounding physiological characteristics that affect baseline survival rates
from the effects of the interventions being assessed. In this paper, we present
a latent variable approach to model heterogeneous treatment effects by
proposing that an individual can belong to one of latent clusters with distinct
response characteristics. We show that this latent structure can mediate the
base survival rates and helps determine the effects of an intervention. We
demonstrate the ability of our approach to discover actionable phenotypes of
individuals based on their treatment response on multiple large randomized
clinical trials originally conducted to assess appropriate treatments to reduce
cardiovascular risk.
","[{'version': 'v1', 'created': 'Tue, 22 Feb 2022 18:34:40 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Jun 2022 00:42:16 GMT'}, {'version': 'v3', 'created': 'Tue, 9 Aug 2022 23:51:55 GMT'}]",2022-08-11,"[['Nagpal', 'Chirag', ''], ['Goswami', 'Mononito', ''], ['Dufendach', 'Keith', ''], ['Dubrawski', 'Artur', '']]","['Time-to-Event', 'Survival Analysis', 'Heterogeneous Treatment Effects', 'Phenotyping', 'Hazard Ratio', 'Subgroup Discovery']"
5960,2204.03764,Debasish Chakroborti,"Debasish Chakroborti, Kevin A. Schneider, Chanchal K. Roy","Backports: Change Types, Challenges and Strategies","In 30th International Conference on Program Comprehension (ICPC 22),
  May 16 to 17, 2022, Virtual Event, Pittsburgh",,10.1145/3524610.3527920,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Source code repositories allow developers to manage multiple versions (or
branches) of a software system. Pull-requests are used to modify a branch, and
backporting is a regular activity used to port changes from a current
development branch to other versions. In open-source software, backports are
common and often need to be adapted by hand, which motivates us to explore
backports and backporting challenges and strategies. In our exploration of
68,424 backports from 10 GitHub projects, we found that bug, test, document,
and feature changes are commonly backported. We identified a number of
backporting challenges, including that backports were inconsistently linked to
their original pull-request (49%), that backports had incompatible code (13%),
that backports failed to be accepted (10%), and that there were backporting
delays (16 days to create, 5 days to merge). We identified some general
strategies for addressing backporting issues. We also noted that backporting
strategies depend on the project type and that further investigation is needed
to determine their suitability. Furthermore, we created the first-ever
backports dataset that can be used by other researchers and practitioners for
investigating backports and backporting.
","[{'version': 'v1', 'created': 'Thu, 7 Apr 2022 22:39:10 GMT'}]",2022-04-11,"[['Chakroborti', 'Debasish', ''], ['Schneider', 'Kevin A.', ''], ['Roy', 'Chanchal K.', '']]","['pull-request', 'port', 'backport', 'branches', 'GitHub']"
5961,2001.05068,Aaron Tucker,"Aaron D. Tucker, Markus Anderljung, and Allan Dafoe",Social and Governance Implications of Improved Data Efficiency,"7 pages, 2 figures, accepted to Artificial Intelligence Ethics and
  Society 2020",,10.1145/3375627.3375863,,cs.CY cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many researchers work on improving the data efficiency of machine learning.
What would happen if they succeed? This paper explores the social-economic
impact of increased data efficiency. Specifically, we examine the intuition
that data efficiency will erode the barriers to entry protecting incumbent
data-rich AI firms, exposing them to more competition from data-poor firms. We
find that this intuition is only partially correct: data efficiency makes it
easier to create ML applications, but large AI firms may have more to gain from
higher performing AI systems. Further, we find that the effect on privacy, data
markets, robustness, and misuse are complex. For example, while it seems
intuitive that misuse risk would increase along with data efficiency -- as more
actors gain access to any level of capability -- the net effect crucially
depends on how much defensive measures are improved. More investigation into
data efficiency, as well as research into the ""AI production function"", will be
key to understanding the development of the AI industry and its societal
impacts.
","[{'version': 'v1', 'created': 'Tue, 14 Jan 2020 22:26:12 GMT'}]",2020-01-16,"[['Tucker', 'Aaron D.', ''], ['Anderljung', 'Markus', ''], ['Dafoe', 'Allan', '']]","['Data efficiency', 'Production function', 'Competitive Advantage', 'Transfer learning', 'Active learning', 'Data markets']"
5962,2005.08191,Saeideh Ghanbari Azar,"Saeideh Ghanbari Azar and Saeed Meshgini and Tohid Yousefi Rezaii and
  Soosan Beheshti","Hyperspectral Image Classification Based on Sparse Modeling of Spectral
  Blocks",,,10.1016/j.neucom.2020.04.138,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hyperspectral images provide abundant spatial and spectral information that
is very valuable for material detection in diverse areas of practical science.
The high-dimensions of data lead to many processing challenges that can be
addressed via existent spatial and spectral redundancies. In this paper, a
sparse modeling framework is proposed for hyperspectral image classification.
Spectral blocks are introduced to be used along with spatial groups to jointly
exploit spectral and spatial redundancies. To reduce the computational
complexity of sparse modeling, spectral blocks are used to break the
high-dimensional optimization problems into small-size sub-problems that are
faster to solve. Furthermore, the proposed sparse structure enables to extract
the most discriminative spectral blocks and further reduce the computational
burden. Experiments on three benchmark datasets, i.e., Pavia University Image
and Indian Pines Image verify that the proposed method leads to a robust sparse
modeling of hyperspectral images and improves the classification accuracy
compared to several state-of-the-art methods. Moreover, the experiments
demonstrate that the proposed method requires less processing time.
","[{'version': 'v1', 'created': 'Sun, 17 May 2020 08:18:13 GMT'}]",2020-05-19,"[['Azar', 'Saeideh Ghanbari', ''], ['Meshgini', 'Saeed', ''], ['Rezaii', 'Tohid Yousefi', ''], ['Beheshti', 'Soosan', '']]","['sparse modeling', 'dictionary learning', 'hyperspectral image', 'classification']"
5963,2207.09505,Sefa Burak Okcu,"Sefa Burak Okcu, Burak O\u{g}uz \""Ozkalayc{\i} and Cevahir
  \c{C}{\i}\u{g}la",An Efficient Method for Face Quality Assessment on the Edge,Accepted to ECCV2020-Embedded Vision Workshop,Computer Vision - ECCV 2020 Workshops (2020) 54-70,10.1007/978-3-030-68238-5_5,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Face recognition applications in practice are composed of two main steps:
face detection and feature extraction. In a sole vision-based solution, the
first step generates multiple detection for a single identity by ingesting a
camera stream. A practical approach on edge devices should prioritize these
detection of identities according to their conformity to recognition. In this
perspective, we propose a face quality score regression by just appending a
single layer to a face landmark detection network. With almost no additional
cost, face quality scores are obtained by training this single layer to regress
recognition scores with surveillance like augmentations. We implemented the
proposed approach on edge GPUs with all face detection pipeline steps,
including detection, tracking, and alignment. Comprehensive experiments show
the proposed approach's efficiency through comparison with SOTA face quality
regression models on different data sets and real-life scenarios.
","[{'version': 'v1', 'created': 'Tue, 19 Jul 2022 18:29:43 GMT'}]",2022-07-21,"[['Okcu', 'Sefa Burak', ''], ['Özkalaycı', 'Burak Oğuz', ''], ['Çığla', 'Cevahir', '']]","['face quality assessment', 'key frame extraction', 'face detection', 'edge processing']"
5964,cs/0503005,Artak Isoyan,"A. Kuyumchyan, A. Isoyan, E. Shulakov, V. Aristov, M. Kondratenkov, A.
  Snigirev, I. Snigireva, A. Souvorov, K. Tamasaku, M. Yabashi, T. Ishikawa, K.
  Trouni","High efficiency and low absorption Fresnel compound zone plates for hard
  X-ray focusing","5 pages, 7 figures","Proceedings of SPIE, 2002, vol. 4783, p. 92-96",10.1117/12.450480,SPIE-4783-11,cs.OH,,"  Circular and linear zone plates have been fabricated on the surface of
silicon crystals for the energy of 8 keV by electron beam lithography and deep
ion plasma etching methods. Various variants of compound zone plates with
first, second, third diffraction orders have been made. The zone relief height
is about 10 mkm, the outermost zone width of the zone plate is 0.4 mkm. The
experimental testing of the zone plates has been conducted on SPring-8 and ESRF
synchrotron radiation sources. A focused spot size and diffraction efficiency
measured by knife-edge scanning are accordingly 0.5 mkm and 39% for the first
order circular zone plate.
","[{'version': 'v1', 'created': 'Wed, 2 Mar 2005 12:17:51 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Nov 2005 21:59:30 GMT'}]",2015-06-25,"[['Kuyumchyan', 'A.', ''], ['Isoyan', 'A.', ''], ['Shulakov', 'E.', ''], ['Aristov', 'V.', ''], ['Kondratenkov', 'M.', ''], ['Snigirev', 'A.', ''], ['Snigireva', 'I.', ''], ['Souvorov', 'A.', ''], ['Tamasaku', 'K.', ''], ['Yabashi', 'M.', ''], ['Ishikawa', 'T.', ''], ['Trouni', 'K.', '']]","['Fresnel', 'zone plate', 'compound', 'focusing', 'X-ray']"
5965,2003.10662,Piyush Gupta,"Piyush Gupta, Demetris Coleman, Joshua E. Siegel","Towards Safer Self-Driving Through Great PAIN (Physically Adversarial
  Intelligent Networks)",,,10.1109/LCSYS.2022.3230085,,cs.LG cs.MA cs.SY eess.SY stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated vehicles' neural networks suffer from overfit, poor
generalizability, and untrained edge cases due to limited data availability.
Researchers synthesize randomized edge-case scenarios to assist in the training
process, though simulation introduces potential for overfit to latent rules and
features. Automating worst-case scenario generation could yield informative
data for improving self driving. To this end, we introduce a ""Physically
Adversarial Intelligent Network"" (PAIN), wherein self-driving vehicles interact
aggressively in the CARLA simulation environment. We train two agents, a
protagonist and an adversary, using dueling double deep Q networks (DDDQNs)
with prioritized experience replay. The coupled networks alternately
seek-to-collide and to avoid collisions such that the ""defensive"" avoidance
algorithm increases the mean-time-to-failure and distance traveled under
non-hostile operating conditions. The trained protagonist becomes more
resilient to environmental uncertainty and less prone to corner case failures
resulting in collisions than the agent trained without an adversary.
","[{'version': 'v1', 'created': 'Tue, 24 Mar 2020 05:04:13 GMT'}]",2022-12-23,"[['Gupta', 'Piyush', ''], ['Coleman', 'Demetris', ''], ['Siegel', 'Joshua E.', '']]","['Physically Adversarial Intelligent Network', 'Dueling DoubleDeep Q Network', 'Prioritized Experience Replay', 'Protagonist', 'Adversary']"
5966,2203.11610,M Tanveer PhD,"M. Tanveer, Jatin Jangir, M.A. Ganaie, Iman Beheshti, M. Tabish,
  Nikunj Chhabra",Diagnosis of Schizophrenia: A comprehensive evaluation,,"IEEE Journal of Biomedical Health and Informatics, 2022",10.1109/JBHI.2022.3168357,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning models have been successfully employed in the diagnosis of
Schizophrenia disease. The impact of classification models and the feature
selection techniques on the diagnosis of Schizophrenia have not been evaluated.
Here, we sought to access the performance of classification models along with
different feature selection approaches on the structural magnetic resonance
imaging data. The data consist of 72 subjects with Schizophrenia and 74 healthy
control subjects. We evaluated different classification algorithms based on
support vector machine (SVM), random forest, kernel ridge regression and
randomized neural networks. Moreover, we evaluated T-Test, Receiver Operator
Characteristics (ROC), Wilcoxon, entropy, Bhattacharyya, Minimum Redundancy
Maximum Relevance (MRMR) and Neighbourhood Component Analysis (NCA) as the
feature selection techniques. Based on the evaluation, SVM based models with
Gaussian kernel proved better compared to other classification models and
Wilcoxon feature selection emerged as the best feature selection approach.
Moreover, in terms of data modality the performance on integration of the grey
matter and white matter proved better compared to the performance on the grey
and white matter individually. Our evaluation showed that classification
algorithms along with the feature selection approaches impact the diagnosis of
Schizophrenia disease. This indicates that proper selection of the features and
the classification models can improve the diagnosis of Schizophrenia.
","[{'version': 'v1', 'created': 'Tue, 22 Mar 2022 10:55:51 GMT'}]",2022-07-05,"[['Tanveer', 'M.', ''], ['Jangir', 'Jatin', ''], ['Ganaie', 'M. A.', ''], ['Beheshti', 'Iman', ''], ['Tabish', 'M.', ''], ['Chhabra', 'Nikunj', '']]","['Schizophrenia', 'classification', 'machine learning']"
5967,2107.02472,Marco Guerini,"Yi-Ling Chung, Serra Sinem Tekiroglu, Sara Tonelli, Marco Guerini",Empowering NGOs in Countering Online Hate Messages,"Preprint of the paper published in Online Social Networks and Media
  Journal (OSNEM)",,10.1016/j.osnem.2021.100150,,cs.CL cs.AI cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Studies on online hate speech have mostly focused on the automated detection
of harmful messages. Little attention has been devoted so far to the
development of effective strategies to fight hate speech, in particular through
the creation of counter-messages. While existing manual scrutiny and
intervention strategies are time-consuming and not scalable, advances in
natural language processing have the potential to provide a systematic approach
to hatred management. In this paper, we introduce a novel ICT platform that NGO
operators can use to monitor and analyze social media data, along with a
counter-narrative suggestion tool. Our platform aims at increasing the
efficiency and effectiveness of operators' activities against islamophobia. We
test the platform with more than one hundred NGO operators in three countries
through qualitative and quantitative evaluation. Results show that NGOs favor
the platform solution with the suggestion tool, and that the time required to
produce counter-narratives significantly decreases.
","[{'version': 'v1', 'created': 'Tue, 6 Jul 2021 08:36:24 GMT'}]",2021-07-07,"[['Chung', 'Yi-Ling', ''], ['Tekiroglu', 'Serra Sinem', ''], ['Tonelli', 'Sara', ''], ['Guerini', 'Marco', '']]","['Hate speech countering', 'Counter-narrative generation', 'Natural Language Processing', 'Human-computer Interaction']"
5968,2011.13004,Jeffrey Carver,"Lucas Cordova, Jeffrey Carver, Gursimran Walia, Noah Gershmel","A Comparison of Inquiry-Based Conceptual Feedback vs. Traditional
  Detailed Feedback Mechanisms in Software Testing Education: An Empirical
  Investigation",,SIGCSE TS 2021,10.1145/3408877.3432417,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  The feedback provided by current testing education tools about the
deficiencies in a student's test suite either mimics industry code coverage
tools or lists specific instructor test cases that are missing from the
student's test suite. While useful in some sense, these types of feedback are
akin to revealing the solution to the problem, which can inadvertently
encourage students to pursue a trial-and-error approach to testing, rather than
using a more systematic approach that encourages learning. In addition to not
teaching students why their test suite is inadequate, this type of feedback may
motivate students to become dependent on the feedback rather than thinking for
themselves. To address this deficiency, there is an opportunity to investigate
alternative feedback mechanisms that include a positive reinforcement of
testing concepts. We argue that using an inquiry-based learning approach is
better than simply providing the answers. To facilitate this type of learning,
we present Testing Tutor, a web-based assignment submission platform that
supports different levels of testing pedagogy via a customizable feedback
engine. We evaluated the impact of the different types of feedback through an
empirical study in two sophomore-level courses. We use Testing Tutor to provide
students with different types of feedback, either traditional detailed code
coverage feedback or inquiry-based learning conceptual feedback, and compare
the effects. The results show that students that receive conceptual feedback
had higher code coverage (by different measures), fewer redundant test cases,
and higher programming grades than the students who receive traditional code
coverage feedback.
","[{'version': 'v1', 'created': 'Wed, 25 Nov 2020 20:13:03 GMT'}]",2020-11-30,"[['Cordova', 'Lucas', ''], ['Carver', 'Jeffrey', ''], ['Walia', 'Gursimran', ''], ['Gershmel', 'Noah', '']]","['Testing', 'Education', 'Pedagogy', 'Tools']"
5969,1805.00987,Laurynas Karazija,"Laurynas Karazija, Petar Veli\v{c}kovi\'c, and Pietro Li\`o",Automatic Inference of Cross-modal Connection Topologies for X-CNNs,"10 pages, 3 figures, 2 tables, to appear in ISNN 2018",,10.1007/978-3-319-92537-0_7,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a way to learn cross-modal convolutional neural network
(X-CNN) architectures from a base convolutional network (CNN) and the training
data to reduce the design cost and enable applying cross-modal networks in
sparse data environments. Two approaches for building X-CNNs are presented. The
base approach learns the topology in a data-driven manner, by using
measurements performed on the base CNN and supplied data. The iterative
approach performs further optimisation of the topology through a combined
learning procedure, simultaneously learning the topology and training the
network. The approaches were evaluated agains examples of hand-designed X-CNNs
and their base variants, showing superior performance and, in some cases,
gaining an additional 9% of accuracy. From further considerations, we conclude
that the presented methodology takes less time than any manual approach would,
whilst also significantly reducing the design complexity. The application of
the methods is fully automated and implemented in Xsertion library.
","[{'version': 'v1', 'created': 'Wed, 2 May 2018 19:16:17 GMT'}]",2019-12-24,"[['Karazija', 'Laurynas', ''], ['Veličković', 'Petar', ''], ['Liò', 'Pietro', '']]","['deep learning', 'model selection and structure learning', 'optimisation algorithms', 'evolutionary neural networks']"
5970,2010.04513,Weihao Xia,"Weihao Xia, Yujiu Yang, Jing-Hao Xue, Wensen Feng",Controllable Continuous Gaze Redirection,"accepted by ACM International Conference on Multimedia (ACM MM), 2020",,10.1145/3394171.3413868,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we present interpGaze, a novel framework for controllable gaze
redirection that achieves both precise redirection and continuous
interpolation. Given two gaze images with different attributes, our goal is to
redirect the eye gaze of one person into any gaze direction depicted in the
reference image or to generate continuous intermediate results. To accomplish
this, we design a model including three cooperative components: an encoder, a
controller and a decoder. The encoder maps images into a well-disentangled and
hierarchically-organized latent space. The controller adjusts the magnitudes of
latent vectors to the desired strength of corresponding attributes by altering
a control vector. The decoder converts the desired representations from the
attribute space to the image space. To facilitate covering the full space of
gaze directions, we introduce a high-quality gaze image dataset with a large
range of directions, which also benefits researchers in related areas.
Extensive experimental validation and comparisons to several baseline methods
show that the proposed interpGaze outperforms state-of-the-art methods in terms
of image quality and redirection precision.
","[{'version': 'v1', 'created': 'Fri, 9 Oct 2020 11:50:06 GMT'}]",2020-10-12,"[['Xia', 'Weihao', ''], ['Yang', 'Yujiu', ''], ['Xue', 'Jing-Hao', ''], ['Feng', 'Wensen', '']]","['neural networks', 'precise gaze redirection', 'continuous gaze interpolation', 'continuous image generation']"
5971,2109.11777,Theofanis Raptis,"Sotiris Nikoletseas, Theofanis P. Raptis, Christoforos Raptopoulos","Radiation-constrained algorithms for Wireless Energy Transfer in Ad hoc
  Networks",,"Computer Networks, Volume 124, 2017, Pages 1-10, ISSN 1389-1286",10.1016/j.comnet.2017.05.025,,cs.NI cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We study the problem of efficiently charging a set of rechargeable nodes
using a set of wireless chargers, under safety constraints on the
electromagnetic radiation incurred. In particular, we define a new charging
model that greatly differs from existing models in that it takes into account
real technology restrictions of the chargers and nodes of the network, mainly
regarding energy limitations. Our model also introduces non-linear constraints
(in the time domain), that radically change the nature of the computational
problems we consider. In this charging model, we present and study the Low
Radiation Efficient Charging Problem (LREC), in which we wish to optimize the
amount of ""useful"" energy transferred from chargers to nodes (under constraints
on the maximum level of imposed radiation). We present several fundamental
properties of this problem and provide indications of its hardness. Finally, we
propose an iterative local improvement heuristic for LREC, which runs in
polynomial time and we evaluate its performance via simulation. Our algorithm
decouples the computation of the objective function from the computation of the
maximum radiation and also does not depend on the exact formula used for the
computation of the electromagnetic radiation in each point of the network,
achieving good trade-offs between charging efficiency and radiation control; it
also exhibits good energy balance properties. We provide extensive simulation
results supporting our claims and theoretical results.
","[{'version': 'v1', 'created': 'Fri, 24 Sep 2021 07:18:01 GMT'}]",2021-09-27,"[['Nikoletseas', 'Sotiris', ''], ['Raptis', 'Theofanis P.', ''], ['Raptopoulos', 'Christoforos', '']]","['Wireless Energy Transfer', 'Ad hoc Networks', 'Electromagnetic Radiation', 'Algorithms']"
5972,2202.12122,Tobias Thommes,"Tobias Thommes (1), Sven Bordukat (1), Andreas Gr\""ubl (1), Vitali
  Karasenko (1), Eric M\""uller (1), Johannes Schemmel (1) ((1)
  Kirchhoff-Institute for Physics, Heidelberg, Germany)",Demonstrating BrainScaleS-2 Inter-Chip Pulse-Communication using EXTOLL,"3 pages, 2 figures, submitted to the Neuro Inspired Computational
  Elements 2022 (NICE'2022) conference, accepted and presented as a
  lightning-talk in March 2022; 1st replacement: version to be published in the
  conference proceedings",,10.1145/3517343.3517376,,cs.AR cs.NE cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The BrainScaleS-2 (BSS-2) Neuromorphic Computing System currently consists of
multiple single-chip setups, which are connected to a compute cluster via
Gigabit-Ethernet network technology. This is convenient for small experiments,
where the neural networks fit into a single chip. When modeling networks of
larger size, neurons have to be connected across chip boundaries. We implement
these connections for BSS-2 using the EXTOLL networking technology. This
provides high bandwidths and low latencies, as well as high message rates.
Here, we describe the targeted pulse-routing implementation and required
extensions to the BSS-2 software stack. We as well demonstrate feed-forward
pulse-routing on BSS-2 using a scaled-down version without temporal merging.
","[{'version': 'v1', 'created': 'Thu, 24 Feb 2022 14:23:54 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Mar 2022 16:19:53 GMT'}]",2022-03-04,"[['Thommes', 'Tobias', ''], ['Bordukat', 'Sven', ''], ['Grübl', 'Andreas', ''], ['Karasenko', 'Vitali', ''], ['Müller', 'Eric', ''], ['Schemmel', 'Johannes', '']]","['brain-inspired computing', 'neuromorphic', 'spike routing', 'FPGA', 'lowlatency', 'packet-based network']"
5973,2205.05043,Peng Liang,"Yajing Luo, Peng Liang, Mojtaba Shahin, Zengyang Li, Chen Yang",Decisions in Continuous Integration and Delivery: An Exploratory Study,"The 34th International Conference on Software Engineering and
  Knowledge Engineering (SEKE)",,10.18293/SEKE2022-171,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  In recent years, Continuous Integration (CI) and Continuous Delivery (CD) has
been heatedly discussed and widely used in part or all of the software
development life cycle as the practices and pipeline to deliver software
products in an efficient way. There are many tools, such as Travis CI, that
offer various features to support the CI/CD pipeline, but there is a lack of
understanding about what decisions are frequently made in CI/CD. In this work,
we explored one popular open-source project on GitHub, Budibase, to provide
insights on the types of decisions made in CI/CD from a practitioners'
perspective. We first explored the GitHub Trending page, conducted a pilot
repository extraction, and identified the Budibase repository as the case for
our study. We then crawled all the closed issues from the repository and got
1,168 closed issues. Irrelevant issues were filtered out based on certain
criteria, and 370 candidate issues that contain decisions were obtained for
data extraction. We analyzed the issues using a hybrid approach combining
pre-defined types and the Constant Comparison method to get the categories of
decisions. The results show that the major type of decisions in the Budibase
closed issues is Functional Requirement Decision (67.6%), followed by
Architecture Decision (11.1%). Our findings encourage developers to put more
effort on the issues and making decisions related to CI/CD, and provide
researchers with a reference of decision classification made in CI/CD.
","[{'version': 'v1', 'created': 'Tue, 10 May 2022 16:57:05 GMT'}]",2022-05-11,"[['Luo', 'Yajing', ''], ['Liang', 'Peng', ''], ['Shahin', 'Mojtaba', ''], ['Li', 'Zengyang', ''], ['Yang', 'Chen', '']]","['Decision', 'Continuous Integration and Delivery', 'CI/CD', 'Budibase', 'Empirical Study']"
5974,2007.08292,Manuel Rigger,"Manuel Rigger, Zhendong Su","Detecting Optimization Bugs in Database Engines via Non-Optimizing
  Reference Engine Construction","Accepted at the 28th ACM Joint European Software Engineering
  Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE
  '20)",,10.1145/3368089.3409710,,cs.SE cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Database Management Systems (DBMS) are used ubiquitously. To efficiently
access data, they apply sophisticated optimizations. Incorrect optimizations
can result in logic bugs, which cause a query to compute an incorrect result
set. We propose Non-Optimizing Reference Engine Construction (NoREC), a
fully-automatic approach to detect optimization bugs in DBMS. Conceptually,
this approach aims to evaluate a query by an optimizing and a non-optimizing
version of a DBMS, to then detect differences in their returned result set,
which would indicate a bug in the DBMS. Obtaining a non-optimizing version of a
DBMS is challenging, because DBMS typically provide limited control over
optimizations. Our core insight is that a given, potentially randomly-generated
optimized query can be rewritten to one that the DBMS cannot optimize.
Evaluating this unoptimized query effectively corresponds to a non-optimizing
reference engine executing the original query. We evaluated NoREC in an
extensive testing campaign on four widely-used DBMS, namely PostgreSQL,
MariaDB, SQLite, and CockroachDB. We found 159 previously unknown bugs in the
latest versions of these systems, 141 of which have been fixed by the
developers. Of these, 51 were optimization bugs, while the remaining were error
and crash bugs. Our results suggest that NoREC is effective, general and
requires little implementation effort, which makes the technique widely
applicable in practice.
","[{'version': 'v1', 'created': 'Thu, 16 Jul 2020 12:30:21 GMT'}]",2020-07-17,"[['Rigger', 'Manuel', ''], ['Su', 'Zhendong', '']]","['database testing', 'DBMS testing', 'query optimizer bugs', 'test oracle']"
5975,2112.01237,Johannes Sedlmeir,"Vincent Schlatt, Johannes Sedlmeir, Simon Feulner, Nils Urbach","Designing a Framework for Digital KYC Processes Built on
  Blockchain-Based Self-Sovereign Identity",,"Information & Management, Special Issue ""Blockchain Innovations:
  Business Opportunities and Management Challenges"", 2021",10.1016/j.im.2021.103553,,cs.CY cs.CR econ.GN q-fin.EC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Know your customer (KYC) processes place a great burden on banks, because
they are costly, inefficient, and inconvenient for customers. While blockchain
technology is often mentioned as a potential solution, it is not clear how to
use the technology's advantages without violating data protection regulations
and customer privacy. We demonstrate how blockchain-based self-sovereign
identity (SSI) can solve the challenges of KYC. We follow a rigorous design
science research approach to create a framework that utilizes SSI in the KYC
process, deriving nascent design principles that theorize on blockchain's role
for SSI.
","[{'version': 'v1', 'created': 'Thu, 11 Nov 2021 11:05:06 GMT'}]",2021-12-03,"[['Schlatt', 'Vincent', ''], ['Sedlmeir', 'Johannes', ''], ['Feulner', 'Simon', ''], ['Urbach', 'Nils', '']]","['Banking', 'digital certificate', 'digital wallet', 'decentralized identity', 'distributed ledger']"
5976,1812.10067,Tianyu He,"Zhibo Chen, Tianyu He",Learning based Facial Image Compression with Semantic Fidelity Metric,Accepted by Neurocomputing,,10.1016/j.neucom.2019.01.086,,cs.MM cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Surveillance and security scenarios usually require high efficient facial
image compression scheme for face recognition and identification. While either
traditional general image codecs or special facial image compression schemes
only heuristically refine codec separately according to face verification
accuracy metric. We propose a Learning based Facial Image Compression (LFIC)
framework with a novel Regionally Adaptive Pooling (RAP) module whose
parameters can be automatically optimized according to gradient feedback from
an integrated hybrid semantic fidelity metric, including a successfully
exploration to apply Generative Adversarial Network (GAN) as metric directly in
image compression scheme. The experimental results verify the framework's
efficiency by demonstrating performance improvement of 71.41%, 48.28% and
52.67% bitrate saving separately over JPEG2000, WebP and neural network-based
codecs under the same face verification accuracy distortion metric. We also
evaluate LFIC's superior performance gain compared with latest specific facial
image codecs. Visual experiments also show some interesting insight on how LFIC
can automatically capture the information in critical areas based on semantic
distortion metrics for optimized compression, which is quite different from the
heuristic way of optimization in traditional image compression algorithms.
","[{'version': 'v1', 'created': 'Tue, 25 Dec 2018 08:42:55 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Mar 2019 11:54:39 GMT'}]",2019-03-08,"[['Chen', 'Zhibo', ''], ['He', 'Tianyu', '']]","['end-to-end', 'semantic metric', 'facial image compression', 'adversarial training']"
5977,1811.06892,Steven Kelk,Steven Kelk and Simone Linz,"A tight kernel for computing the tree bisection and reconnection
  distance between two phylogenetic trees","One figure added, two small typos fixed. This version to appear in
  SIDMA (SIAM Journal on Discrete Mathematics)","SIAM Journal on Discrete Mathematics, 33:1556-1574, 2019",10.1137/18M122724X,,cs.DS math.CO q-bio.PE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 2001 Allen and Steel showed that, if subtree and chain reduction rules
have been applied to two unrooted phylogenetic trees, the reduced trees will
have at most 28k taxa where k is the TBR (Tree Bisection and Reconnection)
distance between the two trees. Here we reanalyse Allen and Steel's
kernelization algorithm and prove that the reduced instances will in fact have
at most 15k-9 taxa. Moreover we show, by describing a family of instances which
have exactly 15k-9 taxa after reduction, that this new bound is tight. These
instances also have no common clusters, showing that a third
commonly-encountered reduction rule, the cluster reduction, cannot further
reduce the size of the kernel in the worst case. To achieve these results we
introduce and use ""unrooted generators"" which are analogues of rooted
structures that have appeared earlier in the phylogenetic networks literature.
Using similar argumentation we show that, for the minimum hybridization problem
on two rooted trees, 9k-2 is a tight bound (when subtree and chain reduction
rules have been applied) and 9k-4 is a tight bound (when, additionally, the
cluster reduction has been applied) on the number of taxa, where k is the
hybridization number of the two trees.
","[{'version': 'v1', 'created': 'Fri, 16 Nov 2018 16:29:16 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Jul 2019 16:44:37 GMT'}]",2021-04-13,"[['Kelk', 'Steven', ''], ['Linz', 'Simone', '']]","['fixed-parameter tractability', 'tree bisection and reconnection', 'generator', 'kernelization', 'phylogenetic network', 'phylogenetic tree', 'hybridization number']"
5978,1809.06130,Bob D. de Vos,"Bob D. de Vos, Floris F. Berendsen, Max A. Viergever, Hessam Sokooti,
  Marius Staring, Ivana Isgum","A Deep Learning Framework for Unsupervised Affine and Deformable Image
  Registration",Accepted: Medical Image Analysis - Elsevier,"Medical Image Analysis, Volume 52, February 2019, Pages 128-143",10.1016/j.media.2018.11.010,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image registration, the process of aligning two or more images, is the core
technique of many (semi-)automatic medical image analysis tasks. Recent studies
have shown that deep learning methods, notably convolutional neural networks
(ConvNets), can be used for image registration. Thus far training of ConvNets
for registration was supervised using predefined example registrations.
However, obtaining example registrations is not trivial. To circumvent the need
for predefined examples, and thereby to increase convenience of training
ConvNets for image registration, we propose the Deep Learning Image
Registration (DLIR) framework for \textit{unsupervised} affine and deformable
image registration. In the DLIR framework ConvNets are trained for image
registration by exploiting image similarity analogous to conventional
intensity-based image registration. After a ConvNet has been trained with the
DLIR framework, it can be used to register pairs of unseen images in one shot.
We propose flexible ConvNets designs for affine image registration and for
deformable image registration. By stacking multiple of these ConvNets into a
larger architecture, we are able to perform coarse-to-fine image registration.
We show for registration of cardiac cine MRI and registration of chest CT that
performance of the DLIR framework is comparable to conventional image
registration while being several orders of magnitude faster.
","[{'version': 'v1', 'created': 'Mon, 17 Sep 2018 11:14:54 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Dec 2018 14:38:00 GMT'}]",2021-09-09,"[['de Vos', 'Bob D.', ''], ['Berendsen', 'Floris F.', ''], ['Viergever', 'Max A.', ''], ['Sokooti', 'Hessam', ''], ['Staring', 'Marius', ''], ['Isgum', 'Ivana', '']]","['deep learning', 'unsupervised learning', 'affine image registration', 'deformable image registration', 'cardiac cineMRI', 'chest CT']"
5979,1811.07939,Xiaokang Zhang,"Xiaokang Zhang, Inge Jonassen",EFSIS: Ensemble Feature Selection Integrating Stability,"20 pages, 3 figures","2019 IEEE International Conference on Bioinformatics and
  Biomedicine (BIBM), San Diego, CA, USA, 2019, pp. 2792-2798",10.1109/BIBM47256.2019.8983310,,cs.LG q-bio.QM stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ensemble learning that can be used to combine the predictions from multiple
learners has been widely applied in pattern recognition, and has been reported
to be more robust and accurate than the individual learners. This ensemble
logic has recently also been more applied in feature selection. There are
basically two strategies for ensemble feature selection, namely data
perturbation and function perturbation. Data perturbation performs feature
selection on data subsets sampled from the original dataset and then selects
the features consistently ranked highly across those data subsets. This has
been found to improve both the stability of the selector and the prediction
accuracy for a classifier. Function perturbation frees the user from having to
decide on the most appropriate selector for any given situation and works by
aggregating multiple selectors. This has been found to maintain or improve
classification performance. Here we propose a framework, EFSIS, combining these
two strategies. Empirical results indicate that EFSIS gives both high
prediction accuracy and stability.
","[{'version': 'v1', 'created': 'Mon, 19 Nov 2018 19:19:55 GMT'}]",2020-02-12,"[['Zhang', 'Xiaokang', ''], ['Jonassen', 'Inge', '']]","['feature selection', 'ensemble learning', 'stability']"
5980,2204.02608,Marcos Faundez-Zanuy,Marcos Faundez-Zanuy,Face recognition in a transformed domain,"9 pages, published in IEEE 37th Annual 2003 International Carnahan
  Conference on Security Technology, 2003. Proceedings. 14-16 Oct. 2003 Taipei
  (Taiwan)","IEEE 37th Annual 2003 International Carnahan Conference on
  Security Technology (ICCST), 2003",10.1109/CCST.2003.1297575,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper proposes the use of a discrete cosine transform (DCT) instead of
the eigenfaces method (Karhunen-Loeve Transform) for biometric identification
based on frontal face images. Experimental results show better recognition
accuracies and reduced computational burden. This paper includes results with
different classifiers and a combination of them.
","[{'version': 'v1', 'created': 'Wed, 6 Apr 2022 06:36:57 GMT'}]",2022-04-07,"[['Faundez-Zanuy', 'Marcos', '']]","['face recognition', 'neural nets', 'Discrete Cosine Transform']"
5981,2108.02180,Tom Braude,"Tom Braude, Idan Schwartz, Alexander Schwing, Ariel Shamir",Ordered Attention for Coherent Visual Storytelling,"9 pages, 7 figures",,10.1145/3503161.3548161,,cs.CV cs.CL,http://creativecommons.org/licenses/by/4.0/,"  We address the problem of visual storytelling, i.e., generating a story for a
given sequence of images. While each sentence of the story should describe a
corresponding image, a coherent story also needs to be consistent and relate to
both future and past images. To achieve this we develop ordered image attention
(OIA). OIA models interactions between the sentence-corresponding image and
important regions in other images of the sequence. To highlight the important
objects, a message-passing-like algorithm collects representations of those
objects in an order-aware manner. To generate the story's sentences, we then
highlight important image attention vectors with an Image-Sentence Attention
(ISA). Further, to alleviate common linguistic mistakes like repetitiveness, we
introduce an adaptive prior. The obtained results improve the METEOR score on
the VIST dataset by 1%. In addition, an extensive human study verifies
coherency improvements and shows that OIA and ISA generated stories are more
focused, shareable, and image-grounded.
","[{'version': 'v1', 'created': 'Wed, 4 Aug 2021 17:12:39 GMT'}, {'version': 'v2', 'created': 'Sun, 22 Aug 2021 08:14:17 GMT'}, {'version': 'v3', 'created': 'Tue, 11 Oct 2022 14:09:46 GMT'}]",2022-11-10,"[['Braude', 'Tom', ''], ['Schwartz', 'Idan', ''], ['Schwing', 'Alexander', ''], ['Shamir', 'Ariel', '']]","['Visual grounding', 'Visual storytelling', 'Ordered Attention']"
5982,2111.13955,Ruo-Qian Wang,Ruo-Qian Wang,"A Recommender System-Inspired Cloud Data Filling Scheme for
  Satellite-based Coastal Observation",,,10.1016/j.jag.2022.102770,,cs.LG eess.IV stat.AP,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Filling missing data in cloud-covered areas of satellite imaging is an
important task to improve data quantity and quality for enhanced earth
observation. Traditional cloud filling studies focused on continuous numerical
data such as temperature and cyanobacterial concentration in the open ocean.
Cloud data filling issues in coastal imaging is far less studied because of the
complex landscape. Inspired by the success of data imputation methods in
recommender systems that are designed for online shopping, the present study
explored their application to satellite cloud data filling tasks. A numerical
experiment was designed and conducted for a LandSat dataset with a range of
synthetic cloud covers to examine the performance of different data filling
schemes. The recommender system-inspired matrix factorization algorithm called
Funk-SVD showed superior performance in computational accuracy and efficiency
for the task of recovering landscape types in a complex coastal area than the
traditional data filling scheme of DINEOF (Data Interpolating Empirical
Orthogonal Functions) and the deep learning method of Datawig. The new method
achieved the best filling accuracy and reached a speed comparable to DINEOF and
much faster than deep learning. A theoretical framework was created to analyze
the error propagation in DINEOF and found the algorithm needs to be modified to
converge to the ground truth. The present study showed that Funk-SVD has great
potential to enhance cloud data filling performance and connects the fields of
recommender systems and cloud filling to promote the improvement and sharing of
useful algorithms.
","[{'version': 'v1', 'created': 'Sat, 27 Nov 2021 18:26:11 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Dec 2021 03:02:24 GMT'}]",2022-05-02,"[['Wang', 'Ruo-Qian', '']]","['Data Filling', 'Data Imputation', 'Matrix Factorization', 'Deep Learning', 'Recommender System']"
5983,2201.09451,Soroush Vosoughi Dr,"Xiaobo Guo, Yaojia Sun, Soroush Vosoughi",Emotion-based Modeling of Mental Disorders on Social Media,"Proceedings of the 20th IEEE/WIC/ACM International Joint Conference
  on Web Intelligence and Intelligent Agent Technology (WI-IAT)",,10.1145/3486622.3493916,,cs.SI cs.CL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  According to the World Health Organization (WHO), one in four people will be
affected by mental disorders at some point in their lives. However, in many
parts of the world, patients do not actively seek professional diagnosis
because of stigma attached to mental illness, ignorance of mental health and
its associated symptoms. In this paper, we propose a model for passively
detecting mental disorders using conversations on Reddit. Specifically, we
focus on a subset of mental disorders that are characterized by distinct
emotional patterns (henceforth called emotional disorders): major depressive,
anxiety, and bipolar disorders. Through passive (i.e., unprompted) detection,
we can encourage patients to seek diagnosis and treatment for mental disorders.
Our proposed model is different from other work in this area in that our model
is based entirely on the emotional states, and the transition between these
states of users on Reddit, whereas prior work is typically based on
content-based representations (e.g., n-grams, language model embeddings, etc).
We show that content-based representation is affected by domain and topic bias
and thus does not generalize, while our model, on the other hand, suppresses
topic-specific information and thus generalizes well across different topics
and times. We conduct experiments on our model's ability to detect different
emotional disorders and on the generalizability of our model. Our experiments
show that while our model performs comparably to content-based models, such as
BERT, it generalizes much better across time and topic.
","[{'version': 'v1', 'created': 'Mon, 24 Jan 2022 04:41:02 GMT'}]",2022-04-18,"[['Guo', 'Xiaobo', ''], ['Sun', 'Yaojia', ''], ['Vosoughi', 'Soroush', '']]","['Emotional Disorders', 'Unprompted Detection', 'Emotional States', 'Emotion Classification', 'Reddit', 'Social Media']"
5984,1704.00323,Jose Moura,Jose Moura and David Hutchison,"Game Theory for Multi-Access Edge Computing: Survey, Use Cases, and
  Future Trends","Published in IEEE Communications Surveys & Tutorials, 39 pages, 8
  Tables, 11 figures, 278 references","IEEE Communications Surveys & Tutorials, vol. 21, no. 1, pp.
  260-288, Firstquarter 2019",10.1109/COMST.2018.2863030,,cs.GT cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Game Theory (GT) has been used with significant success to formulate, and
either design or optimize, the operation of many representative communications
and networking scenarios. The games in these scenarios involve, as usual,
diverse players with conflicting goals. This paper primarily surveys the
literature that has applied theoretical games to wireless networks, emphasizing
use cases of upcoming Multi-Access Edge Computing (MEC). MEC is relatively new
and offers cloud services at the network periphery, aiming to reduce service
latency backhaul load, and enhance relevant operational aspects such as Quality
of Experience or security. Our presentation of GT is focused on the major
challenges imposed by MEC services over the wireless resources. The survey is
divided into classical and evolutionary games. Then, our discussion proceeds to
more specific aspects which have a considerable impact on the game usefulness,
namely: rational vs. evolving strategies, cooperation among players, available
game information, the way the game is played (single turn, repeated), the game
model evaluation, and how the model results can be applied for both optimizing
resource-constrained resources and balancing diverse trade-offs in real edge
networking scenarios. Finally, we reflect on lessons learned, highlighting
future trends and research directions for applying theoretical model games in
upcoming MEC services, considering both network design issues and usage
scenarios.
","[{'version': 'v1', 'created': 'Sun, 2 Apr 2017 16:13:45 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Jun 2017 17:42:44 GMT'}, {'version': 'v3', 'created': 'Thu, 20 Jul 2017 17:39:32 GMT'}, {'version': 'v4', 'created': 'Sat, 20 Jan 2018 21:58:23 GMT'}, {'version': 'v5', 'created': 'Tue, 19 Jun 2018 07:20:07 GMT'}, {'version': 'v6', 'created': 'Sun, 24 Feb 2019 17:18:36 GMT'}]",2019-02-26,"[['Moura', 'Jose', ''], ['Hutchison', 'David', '']]","['Wireless networks', 'resource management', 'model games', 'fog environment', 'multi-access edge computing']"
5985,2210.04975,Vijja Wichitwechkarn,Vijja Wichitwechkarn and Charles Fox,"MACARONS: A Modular and Open-Sourced Automation System for Vertical
  Farming",,,10.5334/joh.53,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  The Modular Automated Crop Array Online System (MACARONS) is an extensible,
scalable, open hardware system for plant transport in automated horticulture
systems such as vertical farms. It is specified to move trays of plants up to
1060mm x 630mm and 12.5kg at a rate of 100mm/s along the guide rails and
41.7mm/s up the lifts, such as between stations for monitoring and actuating
plants. The cost for the construction of one grow unit of MACARONS is 144.96USD
which equates to 128.85USD/m2 of grow area. The designs are released and meets
the requirements of CERN-OSH-W, which includes step-by-step graphical build
instructions and can be built by a typical technical person in one day at a
cost of 1535.50USD. Integrated tests are included in the build instructions are
used to validate against the specifications, and we report on a successful
build. Through a simple analysis, we demonstrate that MACARONS can operate at a
rate sufficient to automate tray loading/unloading, to reduce labour costs in a
vertical farm.
","[{'version': 'v1', 'created': 'Mon, 10 Oct 2022 19:18:36 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Nov 2022 15:28:13 GMT'}]",2023-01-16,"[['Wichitwechkarn', 'Vijja', ''], ['Fox', 'Charles', '']]","['Vertical farming', 'automation', 'agriculture', 'robotics', 'open-source hardware']"
5986,2009.05784,Weicong Chen,"Weicong Chen, Xu Tan, Yingce Xia, Tao Qin, Yu Wang, Tie-Yan Liu",DualLip: A System for Joint Lip Reading and Generation,Accepted by ACM Multimedia 2020,,10.1145/3394171.3413623,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lip reading aims to recognize text from talking lip, while lip generation
aims to synthesize talking lip according to text, which is a key component in
talking face generation and is a dual task of lip reading. In this paper, we
develop DualLip, a system that jointly improves lip reading and generation by
leveraging the task duality and using unlabeled text and lip video data. The
key ideas of the DualLip include: 1) Generate lip video from unlabeled text
with a lip generation model, and use the pseudo pairs to improve lip reading;
2) Generate text from unlabeled lip video with a lip reading model, and use the
pseudo pairs to improve lip generation. We further extend DualLip to talking
face generation with two additionally introduced components: lip to face
generation and text to speech generation. Experiments on GRID and TCD-TIMIT
demonstrate the effectiveness of DualLip on improving lip reading, lip
generation, and talking face generation by utilizing unlabeled data.
Specifically, the lip generation model in our DualLip system trained with
only10% paired data surpasses the performance of that trained with the whole
paired data. And on the GRID benchmark of lip reading, we achieve 1.16%
character error rate and 2.71% word error rate, outperforming the
state-of-the-art models using the same amount of paired data.
","[{'version': 'v1', 'created': 'Sat, 12 Sep 2020 13:13:55 GMT'}]",2020-09-15,"[['Chen', 'Weicong', ''], ['Tan', 'Xu', ''], ['Xia', 'Yingce', ''], ['Qin', 'Tao', ''], ['Wang', 'Yu', ''], ['Liu', 'Tie-Yan', '']]","['lip reading', 'lip generation', 'task duality', 'talking face generation', 'lipto face', 'text to speech']"
5987,2007.16088,Emmanouil Rigas,"Emmanouil Rigas, Konstantinos Tsompanidis","Congestion Management for Mobility-on-Demand Schemes that use Electric
  Vehicles",,,10.1007/978-3-030-66412-1_4,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To date the majority of commuters use their privately owned vehicle that uses
an internal combustion engine. This transportation model suffers from low
vehicle utilization and causes environmental pollution. This paper studies the
use of Electric Vehicles (EVs) operating in a Mobility-on-Demand (MoD) scheme
and tackles the related management challenges. We assume a number of customers
acting as cooperative agents requesting a set of alternative trips and EVs
distributed across a number of pick-up and drop-off stations. In this setting,
we propose congestion management algorithms which take as input the trip
requests and calculate the EV-to-customer assignment aiming to maximize trip
execution by keeping the system balanced in terms of matching demand and
supply. We propose a Mixed-Integer-Programming (MIP) optimal offline solution
which assumes full knowledge of customer demand and an equivalent online greedy
algorithm that can operate in real time. The online algorithm uses three
alternative heuristic functions in deciding whether to execute a customer
request: (a) The sum of squares of all EVs in all stations, (b) the percentage
of trips' destination location fullness and (c) a random choice of trip
execution. Through a detailed evaluation, we observe that (a) provides an
increase of up to 4.8% compared to (b) and up to 11.5% compared to (c) in terms
of average trip execution, while all of them achieve close to the optimal
performance. At the same time, the optimal scales up to settings consisting of
tenths of EVs and a few hundreds of customer requests.
","[{'version': 'v1', 'created': 'Tue, 21 Jul 2020 09:38:10 GMT'}]",2021-01-11,"[['Rigas', 'Emmanouil', ''], ['Tsompanidis', 'Konstantinos', '']]","['Electric vehicles', 'mobility-on-demand', 'scheduling', 'heuristicsearch', 'cooperative']"
5988,2101.04271,Kelly Mack,"Kelly Mack, Emma McDonnell, Dhruv Jain, Lucy Lu Wang, Jon E.
  Froehlich, Leah Findlater","What Do We Mean by ""Accessibility Research""? A Literature Survey of
  Accessibility Papers in CHI and ASSETS from 1994 to 2019",,,10.1145/3411764.3445412,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Accessibility research has grown substantially in the past few decades, yet
there has been no literature review of the field. To understand current and
historical trends, we created and analyzed a dataset of accessibility papers
appearing at CHI and ASSETS since ASSETS' founding in 1994. We qualitatively
coded areas of focus and methodological decisions for the past 10 years
(2010-2019, N=506 papers), and analyzed paper counts and keywords over the full
26 years (N=836 papers). Our findings highlight areas that have received
disproportionate attention and those that are underserved--for example, over
43% of papers in the past 10 years are on accessibility for blind and low
vision people. We also capture common study characteristics, such as the roles
of disabled and nondisabled participants as well as sample sizes (e.g., a
median of 13 for participant groups with disabilities and older adults). We
close by critically reflecting on gaps in the literature and offering guidance
for future work in the field.
","[{'version': 'v1', 'created': 'Tue, 12 Jan 2021 03:00:44 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Jan 2021 22:10:55 GMT'}, {'version': 'v3', 'created': 'Tue, 19 Jan 2021 20:03:04 GMT'}, {'version': 'v4', 'created': 'Wed, 3 Feb 2021 21:10:48 GMT'}]",2021-02-05,"[['Mack', 'Kelly', ''], ['McDonnell', 'Emma', ''], ['Jain', 'Dhruv', ''], ['Wang', 'Lucy Lu', ''], ['Froehlich', 'Jon E.', ''], ['Findlater', 'Leah', '']]","['Accessibility', 'assistive technology', 'disability', 'literature review']"
5989,2203.02241,Nicole Hengesbach,Nicole Hengesbach,Undoing Seamlessness: Exploring Seams for Critical Visualization,,,10.1145/3491101.3519703,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While seamful design has been part of discourses and work within HCI contexts
for some time, it has not yet been fully explored in data visualization design.
At the same time, critics of visualization have been arguing that the
representation of data as contextual, contingent, relational, partial,
heterogeneous, and situated is currently lacking in visualization. Seamful
visualization promises a fresh perspective on visualization design as we seek
to find more expressive encodings and novel approaches to representing data
that acknowledge their wider qualities and limitations. By consulting seams in
other realms and exploring existing seams and seamfulness in visualization,
this paper offers a foundation for conceptualizing seamful visualization,
points towards the value of seams and seamfulness in critical visualization,
and proposes principles for engaging with seamful visualization in practice and
research.
","[{'version': 'v1', 'created': 'Fri, 4 Mar 2022 11:17:17 GMT'}]",2022-03-07,"[['Hengesbach', 'Nicole', '']]","['data visualization', 'critical visualization', 'seamful design', 'seamfulvisualization']"
5990,1906.05574,Dragos-Adrian Seredinschi M.Sc.,"Rachid Guerraoui and Petr Kuznetsov and Matteo Monti and Matej
  Pavlovic and Dragos-Adrian Seredinschi",The Consensus Number of a Cryptocurrency (Extended Version),"11 pages. This is an extended version of a conference article
  appearing in PODC'19. In the proceedings of the 2019 ACM Symposium on
  Principles of Distributed Computing, July 29-August 2, 2019, Toronto, ON,
  Canada. ACM, New York, NY, USA. arXiv admin note: substantial text overlap
  with arXiv:1812.10844",,10.1145/3293611.3331589,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many blockchain-based algorithms, such as Bitcoin, implement a decentralized
asset transfer system, often referred to as a cryptocurrency. As stated in the
original paper by Nakamoto, at the heart of these systems lies the problem of
preventing double-spending; this is usually solved by achieving consensus on
the order of transfers among the participants. In this paper, we treat the
asset transfer problem as a concurrent object and determine its consensus
number, showing that consensus is, in fact, not necessary to prevent
double-spending. We first consider the problem as defined by Nakamoto, where
only a single process---the account owner---can withdraw from each account.
Safety and liveness need to be ensured for correct account owners, whereas
misbehaving account owners might be unable to perform transfers. We show that
the consensus number of an asset transfer object is $1$. We then consider a
more general $k$-shared asset transfer object where up to $k$ processes can
atomically withdraw from the same account, and show that this object has
consensus number $k$. We establish our results in the context of shared memory
with benign faults, allowing us to properly understand the level of difficulty
of the asset transfer problem. We also translate these results in the message
passing setting with Byzantine players, a model that is more relevant in
practice. In this model, we describe an asynchronous Byzantine fault-tolerant
asset transfer implementation that is both simpler and more efficient than
state-of-the-art consensus-based solutions. Our results are applicable to both
the permissioned (private) and permissionless (public) setting, as normally
their differentiation is hidden by the abstractions on top of which our
algorithms are based.
","[{'version': 'v1', 'created': 'Thu, 13 Jun 2019 09:45:24 GMT'}]",2019-06-14,"[['Guerraoui', 'Rachid', ''], ['Kuznetsov', 'Petr', ''], ['Monti', 'Matteo', ''], ['Pavlovic', 'Matej', ''], ['Seredinschi', 'Dragos-Adrian', '']]","['distributed computing', 'distributed asset transfer', 'blockchain', 'consensus']"
5991,1905.07137,Mohamed Faten Zhani,Mohamed Faten Zhani and Hesham ElBakoury,"FlexNGIA: A Flexible Internet Architecture for the Next-Generation
  Tactile Internet","35 pages, 14 figures","Journal of Network and Systems Management (Spinger), 2020",10.1007/s10922-020-09525-0,,cs.NI cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  From virtual reality and telepresence, to augmented reality, holoportation,
and remotely controlled robotics, these future network applications promise an
unprecedented development for society, economics and culture by revolutionizing
the way we live, learn, work and play. In order to deploy such futuristic
applications and to cater to their performance requirements, recent trends
stressed the need for the Tactile Internet, an Internet that, according to the
International Telecommunication Union, combines ultra low latency with
extremely high availability, reliability and security. Unfortunately, today's
Internet falls short when it comes to providing such stringent requirements due
to several fundamental limitations in the design of the current network
architecture and communication protocols. This brings the need to rethink the
network architecture and protocols, and efficiently harness recent
technological advances in terms of virtualization and network softwarization to
design the Tactile Internet of the future.
  In this paper, we start by analyzing the characteristics and requirements of
future networking applications. We then highlight the limitations of the
traditional network architecture and protocols and their inability to cater to
these requirements. Afterward, we put forward a novel network architecture
adapted to the Tactile Internet called FlexNGIA, a Flexible Next-Generation
Internet Architecture. We then describe some use-cases where we discuss the
potential mechanisms and control loops that could be offered by FlexNGIA in
order to ensure the required performance and reliability guarantees for future
applications. Finally, we identify the key research challenges to further
develop FlexNGIA towards a full-fledged architecture for the future Tactile
Internet.
","[{'version': 'v1', 'created': 'Fri, 17 May 2019 07:24:51 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Jul 2020 23:57:56 GMT'}]",2020-07-24,"[['Zhani', 'Mohamed Faten', ''], ['ElBakoury', 'Hesham', '']]","['Tactile Internet', 'Next-Generation Internet Architecture', 'Ultra-low Latency', 'High-Precision Networking', 'Cross-Layer']"
5992,2111.06908,Yanou Ramon,"Yanou Ramon, Sandra C. Matz, R.A. Farrokhnia, David Martens","Explainable AI for Psychological Profiling from Digital Footprints: A
  Case Study of Big Five Personality Predictions from Spending Data","24 pages, 12 figures, 6 tables",,10.3390/info12120518,,cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Every step we take in the digital world leaves behind a record of our
behavior; a digital footprint. Research has suggested that algorithms can
translate these digital footprints into accurate estimates of psychological
characteristics, including personality traits, mental health or intelligence.
The mechanisms by which AI generates these insights, however, often remain
opaque. In this paper, we show how Explainable AI (XAI) can help domain experts
and data subjects validate, question, and improve models that classify
psychological traits from digital footprints. We elaborate on two popular XAI
methods (rule extraction and counterfactual explanations) in the context of Big
Five personality predictions (traits and facets) from financial transactions
data (N = 6,408). First, we demonstrate how global rule extraction sheds light
on the spending patterns identified by the model as most predictive for
personality, and discuss how these rules can be used to explain, validate, and
improve the model. Second, we implement local rule extraction to show that
individuals are assigned to personality classes because of their unique
financial behavior, and that there exists a positive link between the model's
prediction confidence and the number of features that contributed to the
prediction. Our experiments highlight the importance of both global and local
XAI methods. By better understanding how predictive models work in general as
well as how they derive an outcome for a particular person, XAI promotes
accountability in a world in which AI impacts the lives of billions of people
around the world.
","[{'version': 'v1', 'created': 'Fri, 12 Nov 2021 19:28:56 GMT'}]",2021-12-17,"[['Ramon', 'Yanou', ''], ['Matz', 'Sandra C.', ''], ['Farrokhnia', 'R. A.', ''], ['Martens', 'David', '']]","['psychological profiling', 'classification', 'digital footprints', 'explainable artificial intelligence', 'rule extractionABSTRACT']"
5993,2205.01588,Zijian Zhang,"Zijian Zhang, Vinay Setty and Avishek Anand","SparCAssist: A Model Risk Assessment Assistant Based on Sparse Generated
  Counterfactuals","5 pages, 2 figures, submitted and accepted as a demo paper in
  SIGIR2022",,10.1145/3477495.3531677,,cs.CL cs.AI,http://creativecommons.org/licenses/by-sa/4.0/,"  We introduce SparcAssist, a general-purpose risk assessment tool for the
machine learning models trained for language tasks. It evaluates models' risk
by inspecting their behavior on counterfactuals, namely out-of-distribution
instances generated based on the given data instance. The counterfactuals are
generated by replacing tokens in rational subsequences identified by ExPred,
while the replacements are retrieved using HotFlip or
Masked-Language-Model-based algorithms. The main purpose of our system is to
help the human annotators to assess the model's risk on deployment. The
counterfactual instances generated during the assessment are the by-product and
can be used to train more robust NLP models in the future.
","[{'version': 'v1', 'created': 'Tue, 3 May 2022 16:10:45 GMT'}]",2022-05-04,"[['Zhang', 'Zijian', ''], ['Setty', 'Vinay', ''], ['Anand', 'Avishek', '']]","['Interpretable Machine Learning', 'Counterfactual Interpretation', 'Dataannotation tools', 'Human-in-the-loop Machine Learning']"
5994,2008.03427,Yixue Zhao,"Yixue Zhao, Justin Chen, Adriana Sejfia, Marcelo Schmitt Laser, Jie
  Zhang, Federica Sarro, Mark Harman, Nenad Medvidovic",FrUITeR: A Framework for Evaluating UI Test Reuse,ESEC/FSE 2020,,10.1145/3368089.3409708,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  UI testing is tedious and time-consuming due to the manual effort required.
Recent research has explored opportunities for reusing existing UI tests from
an app to automatically generate new tests for other apps. However, the
evaluation of such techniques currently remains manual, unscalable, and
unreproducible, which can waste effort and impede progress in this emerging
area. We introduce FrUITeR, a framework that automatically evaluates UI test
reuse in a reproducible way. We apply FrUITeR to existing test-reuse techniques
on a uniform benchmark we established, resulting in 11,917 test reuse cases
from 20 apps. We report several key findings aimed at improving UI test reuse
that are missed by existing work.
","[{'version': 'v1', 'created': 'Sat, 8 Aug 2020 03:07:34 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Sep 2020 19:44:24 GMT'}, {'version': 'v3', 'created': 'Sun, 27 Sep 2020 18:49:47 GMT'}, {'version': 'v4', 'created': 'Tue, 3 Nov 2020 18:08:47 GMT'}]",2020-11-04,"[['Zhao', 'Yixue', ''], ['Chen', 'Justin', ''], ['Sejfia', 'Adriana', ''], ['Laser', 'Marcelo Schmitt', ''], ['Zhang', 'Jie', ''], ['Sarro', 'Federica', ''], ['Harman', 'Mark', ''], ['Medvidovic', 'Nenad', '']]","['Software Testing', 'Test Reuse', 'Mobile Application', 'Open Science']"
5995,2104.12653,Kerstin Bongard-Blanchy Dr,"Kerstin Bongard-Blanchy, Arianna Rossi, Salvador Rivas, Sophie
  Doublet, Vincent Koenig, Gabriele Lenzini","I am Definitely Manipulated, Even When I am Aware of it. It s
  Ridiculous! -- Dark Patterns from the End-User Perspective","ACM DIS Conference on Designing interactive systems, June 28 - July
  2, 2021, online. ACM, New York, NY, USA",,10.1145/3461778.3462086,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Online services pervasively employ manipulative designs (i.e., dark patterns)
to influence users to purchase goods and subscriptions, spend more time
on-site, or mindlessly accept the harvesting of their personal data. To protect
users from the lure of such designs, we asked: are users aware of the presence
of dark patterns? If so, are they able to resist them? By surveying 406
individuals, we found that they are generally aware of the influence that
manipulative designs can exert on their online behaviour. However, being aware
does not equip users with the ability to oppose such influence. We further find
that respondents, especially younger ones, often recognise the ""darkness"" of
certain designs, but remain unsure of the actual harm they may suffer. Finally,
we discuss a set of interventions (e.g., bright patterns, design frictions,
training games, applications to expedite legal enforcement) in the light of our
findings.
","[{'version': 'v1', 'created': 'Mon, 26 Apr 2021 15:30:22 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Jun 2021 06:31:05 GMT'}]",2021-06-02,"[['Bongard-Blanchy', 'Kerstin', ''], ['Rossi', 'Arianna', ''], ['Rivas', 'Salvador', ''], ['Doublet', 'Sophie', ''], ['Koenig', 'Vincent', ''], ['Lenzini', 'Gabriele', '']]","['dark patterns', 'online manipulation', 'digital nudging', 'consumer protection', 'user experience', 'user interface']"
5996,2207.12087,Clinton Cao,"Clinton Cao, Agathe Blaise, Sicco Verwer, Filippo Rebecchi","Learning State Machines to Monitor and Detect Anomalies on a Kubernetes
  Cluster","9 pages, 12 figures, workshop paper",,10.1145/3538969.3543810,,cs.DC cs.LG,http://creativecommons.org/licenses/by/4.0/,"  These days more companies are shifting towards using cloud environments to
provide their services to their client. While it is easy to set up a cloud
environment, it is equally important to monitor the system's runtime behaviour
and identify anomalous behaviours that occur during its operation. In recent
years, the utilisation of \ac{rnn} and \ac{dnn} to detect anomalies that might
occur during runtime has been a trending approach. However, it is unclear how
to explain the decisions made by these networks and how these networks should
be interpreted to understand the runtime behaviour that they model. On the
contrary, state machine models provide an easier manner to interpret and
understand the behaviour that they model. In this work, we propose an approach
that learns state machine models to model the runtime behaviour of a cloud
environment that runs multiple microservice applications. To the best of our
knowledge, this is the first work that tries to apply state machine models to
microservice architectures. The state machine model is used to detect the
different types of attacks that we launch on the cloud environment. From our
experiment results, our approach can detect the attacks very well, achieving a
balanced accuracy of 99.2% and an F1 score of 0.982.
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2022 11:12:25 GMT'}]",2022-07-26,"[['Cao', 'Clinton', ''], ['Blaise', 'Agathe', ''], ['Verwer', 'Sicco', ''], ['Rebecchi', 'Filippo', '']]","['Kubernetes', 'Runtime Monitoring', 'State Machine', 'Anomaly Detection', 'Microservice Architecture']"
5997,1908.06435,Gabriele Pergola,"Gabriele Pergola, Lin Gui, Yulan He",TDAM: a Topic-Dependent Attention Model for Sentiment Analysis,,"Information Processing & Management, 56 (6), 102084, July 2019",10.1016/j.ipm.2019.102084,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a topic-dependent attention model for sentiment classification and
topic extraction. Our model assumes that a global topic embedding is shared
across documents and employs an attention mechanism to derive local topic
embedding for words and sentences. These are subsequently incorporated in a
modified Gated Recurrent Unit (GRU) for sentiment classification and extraction
of topics bearing different sentiment polarities. Those topics emerge from the
words' local topic embeddings learned by the internal attention of the GRU
cells in the context of a multi-task learning framework. In this paper, we
present the hierarchical architecture, the new GRU unit and the experiments
conducted on users' reviews which demonstrate classification performance on a
par with the state-of-the-art methodologies for sentiment classification and
topic coherence outperforming the current approaches for supervised topic
extraction. In addition, our model is able to extract coherent aspect-sentiment
clusters despite using no aspect-level annotations for training.
","[{'version': 'v1', 'created': 'Sun, 18 Aug 2019 12:50:47 GMT'}]",2019-08-20,"[['Pergola', 'Gabriele', ''], ['Gui', 'Lin', ''], ['He', 'Yulan', '']]","['sentiment analysis', 'neural attention', 'topic modeling']"
5998,2202.07360,Abdul Rafey Aftab,"Abdul Rafey Aftab, Michael von der Beeck","Multimodal Driver Referencing: A Comparison of Pointing to Objects
  Inside and Outside the Vehicle",,"27th International Conference on Intelligent User Interfaces (IUI
  '22), March 22--25, 2022, Helsinki, Finland",10.1145/3490099.3511142,,cs.HC cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Advanced in-cabin sensing technologies, especially vision based approaches,
have tremendously progressed user interaction inside the vehicle, paving the
way for new applications of natural user interaction. Just as humans use
multiple modes to communicate with each other, we follow an approach which is
characterized by simultaneously using multiple modalities to achieve natural
human-machine interaction for a specific task: pointing to or glancing towards
objects inside as well as outside the vehicle for deictic references. By
tracking the movements of eye-gaze, head and finger, we design a multimodal
fusion architecture using a deep neural network to precisely identify the
driver's referencing intent. Additionally, we use a speech command as a trigger
to separate each referencing event. We observe differences in driver behavior
in the two pointing use cases (i.e. for inside and outside objects), especially
when analyzing the preciseness of the three modalities eye, head, and finger.
We conclude that there is no single modality that is solely optimal for all
cases as each modality reveals certain limitations. Fusion of multiple
modalities exploits the relevant characteristics of each modality, hence
overcoming the case dependent limitations of each individual modality.
Ultimately, we propose a method to identity whether the driver's referenced
object lies inside or outside the vehicle, based on the predicted pointing
direction.
","[{'version': 'v1', 'created': 'Tue, 15 Feb 2022 12:40:13 GMT'}]",2022-02-16,"[['Aftab', 'Abdul Rafey', ''], ['von der Beeck', 'Michael', '']]","['Multimodal fusion', 'natural user interaction', 'gaze tracking', 'headpose', 'gesture recognition']"
5999,1904.06198,Issam Damaj,"Hassan Diab (1), Issam Damaj (2) ((1) American University of Beirut,
  (2) London South Bank University)",Cyclic Coding Algorithms under MorphoSys Reconfigurable Computing System,"30 Pages, 11 figures, 9 tables. arXiv admin note: substantial text
  overlap with arXiv:1904.04953",Adv. in. Eng. SW. Elsevier. 34(2003) 61-72,10.1016/S0965-9978(02)00101-1,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces reconfigurable computing (RC) and specifically chooses
one of the prototypes in this field, MorphoSys (M1) [1 - 5]. The paper
addresses the results obtained when using RC in mapping algorithms pertaining
to digital coding in relation to previous research [6 - 10]. The chosen
algorithms relate to cyclic coding techniques, namely the CCITT CRC-16 and the
CRC-16. A performance analysis study of the M1 RC system is also presented to
evaluate the efficiency of the algorithm execution on the M1 system. For
comparison purposes, three other systems where used to map the same algorithms
showing the advantages and disadvantages of each compared with the M1 system.
The algorithms were run on the 8x8 RC (reconfigurable) array of the M1
(MorphoSys) system; numerical examples were simulated to validate our results,
using the MorphoSys mULATE program, which simulates MorphoSys operations.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2019 00:56:12 GMT'}]",2019-04-15,"[['Diab', 'Hassan', ''], ['Damaj', 'Issam', '']]","['Reconfigurable Computing', 'MorphoSys', 'Information Coding', 'Cyclic Codes', 'Algorithms Mapping']"
6000,2009.09837,Balagopal Ramdurai,Balagopal Ramdurai,Detailed Review of Cloud based Mobile application for the stroke patient,"7 pages with review of existing studies, how telemedicine can help
  stroke patients and reduce fatality","International Journal of Computer Trends and Technology
  (IJCTT)2020",10.14445/22312803,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the current years, due to the significant developments in technologies in
almost every domain, the standard of living has been improved. Emergence of
latest innovations, advanced machinery and equipment especially in the
healthcare domain, have simplified the diagonalizing process to a wide extent.
","[{'version': 'v1', 'created': 'Thu, 17 Sep 2020 13:22:42 GMT'}]",2020-09-22,"[['Ramdurai', 'Balagopal', '']]","['stroke', 'cloud computing', 'healthcare', 'mobile application']"
6001,1704.03667,Antonio Luca Alfeo,"Antonio L. Alfeo, Mario G. C. A. Cimino, Sara Egidi, Bruno Lepri, Alex
  Pentland, Gigliola Vaglini","Stigmergy-based modeling to discover urban activity patterns from
  positioning data",,"in Proc. of the International Conference SBP-BRiMS 2017,
  Washington, DC, USA, 5-8 July, 2017, LNCS 10354, pp. 292-301",10.1007/978-3-319-60240-0_35,,cs.AI cs.SI physics.soc-ph,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Positioning data offer a remarkable source of information to analyze crowds
urban dynamics. However, discovering urban activity patterns from the emergent
behavior of crowds involves complex system modeling. An alternative approach is
to adopt computational techniques belonging to the emergent paradigm, which
enables self-organization of data and allows adaptive analysis. Specifically,
our approach is based on stigmergy. By using stigmergy each sample position is
associated with a digital pheromone deposit, which progressively evaporates and
aggregates with other deposits according to their spatiotemporal proximity.
Based on this principle, we exploit positioning data to identify high density
areas (hotspots) and characterize their activity over time. This
characterization allows the comparison of dynamics occurring in different days,
providing a similarity measure exploitable by clustering techniques. Thus, we
cluster days according to their activity behavior, discovering unexpected urban
activity patterns. As a case study, we analyze taxi traces in New York City
during 2015.
","[{'version': 'v1', 'created': 'Wed, 12 Apr 2017 09:24:37 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Jan 2019 10:13:57 GMT'}]",2019-01-23,"[['Alfeo', 'Antonio L.', ''], ['Cimino', 'Mario G. C. A.', ''], ['Egidi', 'Sara', ''], ['Lepri', 'Bruno', ''], ['Pentland', 'Alex', ''], ['Vaglini', 'Gigliola', '']]","['Urban mobility', 'stigmergy', 'emergent paradigm', 'hotspot', 'pattern mining', 'taxi-GPS traces']"
6002,2008.08355,Aliakbar Akbaritabar,Aliakbar Akbaritabar,"Berlin: A Quantitative View of the Structure of Institutional Scientific
  Collaborations","10 tables, 8 figures",Quantitative Science Studies (2021) 2 (2) 753-777,10.1162/qss_a_00131,,cs.DL cs.SI,http://creativecommons.org/licenses/by/4.0/,"  This paper examines the structure of scientific collaborations in a large
European metropolitan area. It aims to identify strategic coalitions among
organizations in Berlin as a specific case with high institutional and sectoral
diversity. By adopting a global, regional and organization based approach we
provide a quantitative, exploratory and macro view of this diversity. We use
publications data with at least one organization located in Berlin from
1996-2017. We further investigate four members of the Berlin University
Alliance (BUA) through their self-represented research profiles comparing it
with empirical results of OECD disciplines. Using a bipartite network modeling
framework, we are able to move beyond the uncontested trend towards team
science and increasing internationalization. Our results show that BUA members
shape the structure of scientific collaborations in the region. However, they
are not collaborating cohesively in all disciplines. Larger divides exist in
some disciplines e.g., Agricultural Sciences and Humanities. Only Medical and
Health Sciences have cohesive intraregional collaborations which signals the
success of regional cooperation established in 2003. We explain possible
underlying factors shaping the observed trends and sectoral and intra-regional
groupings. A major methodological contribution of this paper is evaluating
coverage and accuracy of different organization name disambiguation techniques.
","[{'version': 'v1', 'created': 'Wed, 19 Aug 2020 09:54:06 GMT'}]",2021-12-30,"[['Akbaritabar', 'Aliakbar', '']]","['Berlin', 'Internationalization', 'Co-authorship Network Analysis', 'Bipartite Community Detection', 'Disambiguation', 'Berlin University Alliance']"
6003,1910.08604,Todd Davies,John Gastil and Todd Davies,"Digital Democracy: Episode IV -- A New Hope, How a Corporation for
  Public Software Could Transform Digital Engagement for Government and Civil
  Society","17 pages, 1 figure, 2 tables, to appear in Digital Government:
  Research and Practice (DGOV)","Digital Government: Research and Practice (DGOV), 1(1):Article 6,
  February 2020",10.1145/3342194,,cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Though successive generations of digital technology have become increasingly
powerful in the past twenty years, digital democracy has yet to realize its
potential for deliberative transformation. The undemocratic exploitation of
massive social media systems continued this trend, but it only worsened an
existing problem of modern democracies, which were already struggling to
develop deliberative infrastructure independent of digital technologies. There
have been many creative conceptions of civic tech, but implementation has
lagged behind innovation. This essay argues for implementing one such vision of
digital democracy through the establishment of a public corporation. Modeled on
the Corporation for Public Broadcasting in the U.S., this entity would foster
the creation of new digital technology by providing a stable source of funding
to nonprofit technologists, interest groups, civic organizations, government,
researchers, private companies, and the public. Funded entities would produce
and maintain software infrastructure for public benefit. The concluding
sections identify what circumstances might create and sustain such an entity.
","[{'version': 'v1', 'created': 'Fri, 18 Oct 2019 19:52:07 GMT'}, {'version': 'v2', 'created': 'Sun, 15 Dec 2019 03:44:40 GMT'}, {'version': 'v3', 'created': 'Tue, 3 Mar 2020 22:45:46 GMT'}]",2020-03-05,"[['Gastil', 'John', ''], ['Davies', 'Todd', '']]","['Civic engagement', 'Deliberative democracy', 'Government consultation', 'Nonprofit technology', 'Political participation', 'Public media']"
6004,2001.02530,Jin Xu,Jin Xu and Natarajan Gautam,On Competitive Analysis for Polling Systems,,Naval Research Logistics. 2020; 67: 404-419,10.1002/nav.21926,,cs.PF cs.DM math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Polling systems have been widely studied, however most of these studies focus
on polling systems with renewal processes for arrivals and random variables for
service times. There is a need driven by practical applications to study
polling systems with arbitrary arrivals (not restricted to time-varying or in
batches) and revealed service time upon a job's arrival. To address that need,
our work considers a polling system with generic setting and for the first time
provides the worst-case analysis for online scheduling policies in this system.
We provide conditions for the existence of constant competitive ratios, and
competitive lower bounds for general scheduling policies in polling systems.
Our work also bridges the queueing and scheduling communities by proving the
competitive ratios for several well-studied policies in the queueing
literature, such as cyclic policies with exhaustive, gated or l-limited service
disciplines for polling systems.
","[{'version': 'v1', 'created': 'Tue, 7 Jan 2020 18:58:16 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Jun 2020 20:28:07 GMT'}]",2020-08-04,"[['Xu', 'Jin', ''], ['Gautam', 'Natarajan', '']]","['Scheduling', 'Online Algorithm', 'worst-case Analysis', 'Competitive Ratio', 'Parallel Queues with']"
6005,2204.13261,Shuyue Stella Li,"Shuyue Stella Li, Hannah Peeler, Andrew N. Sloss, Kenneth N. Reid,
  Wolfgang Banzhaf","Genetic Improvement in the Shackleton Framework for Optimizing LLVM Pass
  Sequences","3 pages, 2 figures",,10.1145/3520304.3534000,,cs.NE cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Genetic improvement is a search technique that aims to improve a given
acceptable solution to a problem. In this paper, we present the novel use of
genetic improvement to find problem-specific optimized LLVM pass sequences. We
develop a pass-level patch representation in the linear genetic programming
framework, Shackleton, to evolve the modifications to be applied to the default
optimization pass sequences. Our GI-evolved solution has a mean of 3.7% runtime
improvement compared to the -O3 optimization level in the default code
generation options which optimizes on runtime. The proposed GI method provides
an automatic way to find a problem-specific optimization sequence that improves
upon a general solution without any expert domain knowledge. In this paper, we
discuss the advantages and limitations of the GI feature in the Shackleton
Framework and present our results.
","[{'version': 'v1', 'created': 'Thu, 28 Apr 2022 02:48:04 GMT'}]",2022-04-29,"[['Li', 'Shuyue Stella', ''], ['Peeler', 'Hannah', ''], ['Sloss', 'Andrew N.', ''], ['Reid', 'Kenneth N.', ''], ['Banzhaf', 'Wolfgang', '']]","['Evolutionary Algorithms', 'Genetic Programming', 'Genetic Improvement', 'Compiler Optimization', 'Parameter Tuning', 'Metaheuristics']"
6006,2106.09230,Bla\v{z} \v{S}krlj,"Timen Stepi\v{s}nik Perdih, Senja Pollak, Bla\v{z} \v{Skrlj}","JSI at the FinSim-2 task: Ontology-Augmented Financial Concept
  Classification",,,10.1145/3442442.3451383,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ontologies are increasingly used for machine reasoning over the last few
years. They can provide explanations of concepts or be used for concept
classification if there exists a mapping from the desired labels to the
relevant ontology. Another advantage of using ontologies is that they do not
need a learning process, meaning that we do not need the train data or time
before using them. This paper presents a practical use of an ontology for a
classification problem from the financial domain. It first transforms a given
ontology to a graph and proceeds with generalization with the aim to find
common semantic descriptions of the input sets of financial concepts.
  We present a solution to the shared task on Learning Semantic Similarities
for the Financial Domain (FinSim-2 task). The task is to design a system that
can automatically classify concepts from the Financial domain into the most
relevant hypernym concept in an external ontology - the Financial Industry
Business Ontology. We propose a method that maps given concepts to the
mentioned ontology and performs a graph search for the most relevant hypernyms.
We also employ a word vectorization method and a machine learning classifier to
supplement the method with a ranked list of labels for each concept.
","[{'version': 'v1', 'created': 'Thu, 17 Jun 2021 03:56:15 GMT'}]",2021-06-18,"[['Perdih', 'Timen Stepišnik', ''], ['Pollak', 'Senja', ''], ['\\v{Skrlj}', 'Blaž', '']]","['concept classification', 'ontology', 'FIBO', 'generalization', 'hypernymdiscovery', 'financial vocabulary']"
6007,2111.05034,Keiichi Shima,"Keiichi Shima, Ryo Nakamura, Kazuya Okada, Tomohiro Ishihara, Daisuke
  Miyamoto, Yuji Sekiya","Classifying DNS Servers based on Response Message Matrix using Machine
  Learning",,,10.1109/CSCI49370.2019.00291,,cs.NI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Improperly configured domain name system (DNS) servers are sometimes used as
packet reflectors as part of a DoS or DDoS attack. Detecting packets created as
a result of this activity is logically possible by monitoring the DNS request
and response traffic. Any response that does not have a corresponding request
can be considered a reflected message; checking and tracking every DNS packet,
however, is a non-trivial operation. In this paper, we propose a detection
mechanism for DNS servers used as reflectors by using a DNS server feature
matrix built from a small number of packets and a machine learning algorithm.
The F1 score of bad DNS server detection was more than 0.9 when the test and
training data are generated within the same day, and more than 0.7 for the data
not used for the training and testing phase of the same day.
","[{'version': 'v1', 'created': 'Tue, 9 Nov 2021 10:20:17 GMT'}]",2021-11-10,"[['Shima', 'Keiichi', ''], ['Nakamura', 'Ryo', ''], ['Okada', 'Kazuya', ''], ['Ishihara', 'Tomohiro', ''], ['Miyamoto', 'Daisuke', ''], ['Sekiya', 'Yuji', '']]","['DNS', 'reflection', 'DoS/DDoS detection', 'machine learning']"
6008,1604.04725,Victor Sanchez-Anguix Dr.,"Victor Sanchez-Anguix, Reyhan Aydogan, Vicente Julian and Catholijn
  Jonker","Unanimously acceptable agreements for negotiation teams in unpredictable
  domains","Electronic Commerce Research and Applications, 2014",,10.1016/j.elerap.2014.05.002,,cs.MA cs.AI cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A negotiation team is a set of agents with common and possibly also
conflicting preferences that forms one of the parties of a negotiation. A
negotiation team is involved in two decision making processes simultaneously, a
negotiation with the opponents, and an intra-team process to decide on the
moves to make in the negotiation. This article focuses on negotiation team
decision making for circumstances that require unanimity of team decisions.
Existing agent-based approaches only guarantee unanimity in teams negotiating
in domains exclusively composed of predictable and compatible issues. This
article presents a model for negotiation teams that guarantees unanimous team
decisions in domains consisting of predictable and compatible, and also
unpredictable issues. Moreover, the article explores the influence of using
opponent, and team member models in the proposing strategies that team members
use. Experimental results show that the team benefits if team members employ
Bayesian learning to model their teammates' preferences.
","[{'version': 'v1', 'created': 'Sat, 16 Apr 2016 11:01:44 GMT'}]",2016-04-19,"[['Sanchez-Anguix', 'Victor', ''], ['Aydogan', 'Reyhan', ''], ['Julian', 'Vicente', ''], ['Jonker', 'Catholijn', '']]","['Automated negotiation', 'Multi-agent systems', 'Agreement technologies']"
6009,2106.14149,Xu Wang Dr,"Xu Wang (1), Wei Ni (2), Xuan Zha (3), Guangsheng Yu (1), Ren Ping Liu
  (1), Nektarios Georgalas (4), Andrew Reeves (4) ((1) Global Big Data
  Technologies Centre, University of Technology Sydney, Australia, (2) Data61,
  CSIRO, Australia, (3) China Academy of Information and Communications
  Technology, Beijing, China, (4) Applied Research, British Telecom,
  Martlesham, UK)",Capacity Analysis of Public Blockchain,,,10.1016/j.comcom.2021.06.019,,cs.CR cs.DC cs.NI cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As distributed ledgers, blockchains run consensus protocols which trade
capacity for consistency, especially in non-ideal networks with incomplete
connectivity and erroneous links. Existing studies on the tradeoff between
capacity and consistency are only qualitative or rely on specific assumptions.
This paper presents discrete-time Markov chain models to quantify the capacity
of Proof-of-Work based public blockchains in non-ideal networks. The
comprehensive model is collapsed to be ergodic under the eventual consistency
of blockchains, achieving tractability and efficient evaluations of blockchain
capacity. A closed-form expression for the capacity is derived in the case of
two miners. Another important aspect is that we extend the ergodic model to
analyze the capacity under strong consistency, evaluating the robustness of
blockchains against double-spending attacks. Validated by simulations, the
proposed models are accurate and reveal the effect of link quality and the
distribution of mining rates on blockchain capacity and the ratio of stale
blocks.
","[{'version': 'v1', 'created': 'Sun, 27 Jun 2021 05:38:13 GMT'}]",2021-06-29,"[['Wang', 'Xu', ''], ['Ni', 'Wei', ''], ['Zha', 'Xuan', ''], ['Yu', 'Guangsheng', ''], ['Liu', 'Ren Ping', ''], ['Georgalas', 'Nektarios', ''], ['Reeves', 'Andrew', '']]","['Markov Chain', 'Blockchain', 'Capacity', 'Stale Blocks', 'Consistency']"
6010,2011.13978,Denis Newman-Griffis,Denis Newman-Griffis and Eric Fosler-Lussier,"Automated Coding of Under-Studied Medical Concept Domains: Linking
  Physical Activity Reports to the International Classification of Functioning,
  Disability, and Health","Updated final version, published in Frontiers in Digital Health,
  https://doi.org/10.3389/fdgth.2021.620828. 34 pages (23 text + 11
  references); 9 figures, 2 tables","Frontiers in Digital Health, 3:620828 (2021)",10.3389/fdgth.2021.620828,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linking clinical narratives to standardized vocabularies and coding systems
is a key component of unlocking the information in medical text for analysis.
However, many domains of medical concepts lack well-developed terminologies
that can support effective coding of medical text. We present a framework for
developing natural language processing (NLP) technologies for automated coding
of under-studied types of medical information, and demonstrate its
applicability via a case study on physical mobility function. Mobility is a
component of many health measures, from post-acute care and surgical outcomes
to chronic frailty and disability, and is coded in the International
Classification of Functioning, Disability, and Health (ICF). However, mobility
and other types of functional activity remain under-studied in medical
informatics, and neither the ICF nor commonly-used medical terminologies
capture functional status terminology in practice. We investigated two
data-driven paradigms, classification and candidate selection, to link
narrative observations of mobility to standardized ICF codes, using a dataset
of clinical narratives from physical therapy encounters. Recent advances in
language modeling and word embedding were used as features for established
machine learning models and a novel deep learning approach, achieving a macro
F-1 score of 84% on linking mobility activity reports to ICF codes. Both
classification and candidate selection approaches present distinct strengths
for automated coding in under-studied domains, and we highlight that the
combination of (i) a small annotated data set; (ii) expert definitions of codes
of interest; and (iii) a representative text corpus is sufficient to produce
high-performing automated coding systems. This study has implications for the
ongoing growth of NLP tools for a variety of specialized applications in
clinical care and research.
","[{'version': 'v1', 'created': 'Fri, 27 Nov 2020 20:02:59 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Mar 2021 18:05:55 GMT'}]",2021-03-11,"[['Newman-Griffis', 'Denis', ''], ['Fosler-Lussier', 'Eric', '']]","['Disability', 'Rehabilitation', 'Natural language processing', 'Machine learning', 'EHR data', 'Free text', 'Physical function', 'ICF']"
6011,2105.13718,Amin Honarmandi Shandiz,Amin Honarmandi Shandiz and L\'aszl\'o T\'oth,"Voice Activity Detection for Ultrasound-based Silent Speech Interfaces
  using Convolutional Neural Networks","12 pages, 7 tables, 4 figures",,10.1007/978-3-030-83527-9_43,,cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Voice Activity Detection (VAD) is not easy task when the input audio signal
is noisy, and it is even more complicated when the input is not even an audio
recording. This is the case with Silent Speech Interfaces (SSI) where we record
the movement of the articulatory organs during speech, and we aim to
reconstruct the speech signal from this recording. Our SSI system synthesizes
speech from ultrasonic videos of the tongue movement, and the quality of the
resulting speech signals are evaluated by metrics such as the mean squared
error loss function of the underlying neural network and the Mel-Cepstral
Distortion (MCD) of the reconstructed speech compared to the original. Here, we
first demonstrate that the amount of silence in the training data can have an
influence both on the MCD evaluation metric and on the performance of the
neural network model. Then, we train a convolutional neural network classifier
to separate silent and speech-containing ultrasound tongue images, using a
conventional VAD algorithm to create the training labels from the corresponding
speech signal. In the experiments our ultrasound-based speech/silence separator
achieved a classification accuracy of about 85\% and an AUC score around 86\%.
","[{'version': 'v1', 'created': 'Fri, 28 May 2021 10:33:22 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Jun 2021 11:40:48 GMT'}, {'version': 'v3', 'created': 'Sat, 18 Sep 2021 20:47:32 GMT'}]",2021-09-21,"[['Shandiz', 'Amin Honarmandi', ''], ['Tóth', 'László', '']]","['Silent Speech Interface', 'speech/silence classification', 'VoiceActivity Detection', 'convolutional neural network']"
6012,2109.10549,M.L Puertas,"E.M. Garz\'on, J.A. Mart\'inez, J.J. Moreno, M.L. Puertas",On the $2$-domination number of cylinders with small cycles,"15 pages, 1 figure","Fundamenta Informaticae, Volume 185, Issue 2, pp 185-199 (2022)
  fi:8908",10.3233/FI-222107,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Domination-type parameters are difficult to manage in Cartesian product
graphs and there is usually no general relationship between the parameter in
both factors and in the product graph. This is the situation of the domination
number, the Roman domination number or the $2$-domination number, among others.
Contrary to what happens with the domination number and the Roman domination
number, the $2$-domination number remains unknown in cylinders, that is, the
Cartesian product of a cycle and a path and in this paper, we will compute this
parameter in the cylinders with small cycles. We will develop two algorithms
involving the $(\min,+)$ matrix product that will allow us to compute the
desired values of $\gamma_2(C_n\Box P_m)$, with $3\leq n\leq 15$ and $m\geq 2$.
We will also pose a conjecture about the general formulae for the
$2$-domination number in this graph class.
","[{'version': 'v1', 'created': 'Wed, 22 Sep 2021 07:26:33 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Jan 2022 12:03:34 GMT'}, {'version': 'v3', 'created': 'Thu, 14 Apr 2022 17:00:50 GMT'}]",2022-04-15,"[['Garzón', 'E. M.', ''], ['Martínez', 'J. A.', ''], ['Moreno', 'J. J.', ''], ['Puertas', 'M. L.', '']]","['2-domination', 'Cartesian product', '(min', '+) matrix product']"
6013,1810.04892,Federico Cerutti,"Pietro Baroni, Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin",Automata for Infinite Argumentation Structures,,,10.1016/j.artint.2013.05.002,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The theory of abstract argumentation frameworks (afs) has, in the main,
focused on finite structures, though there are many significant contexts where
argumentation can be regarded as a process involving infinite objects. To
address this limitation, in this paper we propose a novel approach for
describing infinite afs using tools from formal language theory. In particular,
the possibly infinite set of arguments is specified through the language
recognized by a deterministic finite automaton while a suitable formalism,
called attack expression, is introduced to describe the relation of attack
between arguments. The proposed approach is shown to satisfy some desirable
properties which can not be achieved through other ""naive"" uses of formal
languages. In particular, the approach is shown to be expressive enough to
capture (besides any arbitrary finite structure) a large variety of infinite
afs including two major examples from previous literature and two sample cases
from the domains of multi-agent negotiation and ambient intelligence. On the
computational side, we show that several decision and construction problems
which are known to be polynomial time solvable in finite afs are decidable in
the context of the proposed formalism and we provide the relevant algorithms.
Moreover we obtain additional results concerning the case of finitary afs.
","[{'version': 'v1', 'created': 'Thu, 11 Oct 2018 08:26:59 GMT'}]",2018-10-12,"[['Baroni', 'Pietro', ''], ['Cerutti', 'Federico', ''], ['Dunne', 'Paul E.', ''], ['Giacomin', 'Massimiliano', '']]","['Infinite argumentation frameworks', 'Automata-basedrepresentation', 'Argumentation semantics computation']"
6014,1811.08318,Thommen George Karimpanal,Thommen George Karimpanal and Roland Bouffanais,"Self-Organizing Maps for Storage and Transfer of Knowledge in
  Reinforcement Learning","35 pages, 11 figures, Accepted in the journal Adaptive Behavior.
  arXiv admin note: substantial text overlap with arXiv:1807.07530",Adaptive Behavior 27 (2018) 111-126,10.1177/1059712318818568,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The idea of reusing or transferring information from previously learned tasks
(source tasks) for the learning of new tasks (target tasks) has the potential
to significantly improve the sample efficiency of a reinforcement learning
agent. In this work, we describe a novel approach for reusing previously
acquired knowledge by using it to guide the exploration of an agent while it
learns new tasks. In order to do so, we employ a variant of the growing
self-organizing map algorithm, which is trained using a measure of similarity
that is defined directly in the space of the vectorized representations of the
value functions. In addition to enabling transfer across tasks, the resulting
map is simultaneously used to enable the efficient storage of previously
acquired task knowledge in an adaptive and scalable manner. We empirically
validate our approach in a simulated navigation environment, and also
demonstrate its utility through simple experiments using a mobile
micro-robotics platform. In addition, we demonstrate the scalability of this
approach, and analytically examine its relation to the proposed network growth
mechanism. Further, we briefly discuss some of the possible improvements and
extensions to this approach, as well as its relevance to real world scenarios
in the context of continual learning.
","[{'version': 'v1', 'created': 'Sun, 18 Nov 2018 07:27:21 GMT'}]",2022-09-28,"[['Karimpanal', 'Thommen George', ''], ['Bouffanais', 'Roland', '']]","['Self-organizing maps', 'Q-learning', 'Transfer Learning', 'Multi-taskReinforcement Learning', 'Continual Learning']"
6015,2209.08376,Bahdan Zviazhynski,"Bahdan Zviazhynski, Gareth Conduit",Unveil the unseen: Exploit information hidden in noise,"13 pages, 10 figures. Appl Intell (2022)",,10.1007/s10489-022-04102-1,,cs.LG cond-mat.mtrl-sci physics.comp-ph,http://creativecommons.org/licenses/by/4.0/,"  Noise and uncertainty are usually the enemy of machine learning, noise in
training data leads to uncertainty and inaccuracy in the predictions. However,
we develop a machine learning architecture that extracts crucial information
out of the noise itself to improve the predictions. The phenomenology computes
and then utilizes uncertainty in one target variable to predict a second target
variable. We apply this formalism to PbZr$_{0.7}$Sn$_{0.3}$O$_{3}$ crystal,
using the uncertainty in dielectric constant to extrapolate heat capacity,
correctly predicting a phase transition that otherwise cannot be extrapolated.
For the second example -- single-particle diffraction of droplets -- we utilize
the particle count together with its uncertainty to extrapolate the ground
truth diffraction amplitude, delivering better predictions than when we utilize
only the particle count. Our generic formalism enables the exploitation of
uncertainty in machine learning, which has a broad range of applications in the
physical sciences and beyond.
","[{'version': 'v1', 'created': 'Sat, 17 Sep 2022 17:43:57 GMT'}]",2022-09-20,"[['Zviazhynski', 'Bahdan', ''], ['Conduit', 'Gareth', '']]","['machine learning', 'uncertainty', 'extrapolation', 'case studies']"
6016,2011.13998,Alexander Schein,"A. Schein, K. T. Carlberg, M. J. Zahr","Preserving general physical properties in model reduction of dynamical
  systems via constrained-optimization projection",,,10.1002/nme.6667,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Model-reduction techniques aim to reduce the computational complexity of
simulating dynamical systems by applying a (Petrov-)Galerkin projection process
that enforces the dynamics to evolve in a low-dimensional subspace of the
original state space. Frequently, the resulting reduced-order model (ROM)
violates intrinsic physical properties of the original full-order model (FOM)
(e.g., global conservation, Lagrangian structure, state-variable bounds)
because the projection process does not generally ensure preservation of these
properties. However, in many applications, ensuring the ROM preserves such
intrinsic properties can enable the ROM to retain physical meaning and lead to
improved accuracy and stability properties. In this work, we present a general
constrained-optimization formulation for projection-based model reduction that
can be used as a template to enforce the ROM to satisfy specific properties on
the kinematics and dynamics. We introduce constrained-optimization formulations
at both the time-continuous (i.e., ODE) level, which leads to a constrained
Galerkin projection, and at the time-discrete level, which leads to a
least-squares Petrov-Galerkin (LSPG) projection, in the context of linear
multistep schemes. We demonstrate the ability of the proposed formulations to
equip ROMs with desired properties such as global energy conservation and
bounds on the total variation.
","[{'version': 'v1', 'created': 'Fri, 27 Nov 2020 21:38:20 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Mar 2021 09:07:00 GMT'}, {'version': 'v3', 'created': 'Thu, 1 Apr 2021 12:04:27 GMT'}]",2021-04-02,"[['Schein', 'A.', ''], ['Carlberg', 'K. T.', ''], ['Zahr', 'M. J.', '']]","['projection-based model reduction', 'Galerkin projection', 'least-squares Petrov–Galerkinprojection', 'constrained optimization']"
6017,2106.14190,Stephen MacDonell,"Nidhi Gowdra, Roopak Sinha, Stephen MacDonell and Wei Qi Yan","Mitigating severe over-parameterization in deep convolutional neural
  networks through forced feature abstraction and compression with an
  entropy-based heuristic","Journal paper, 14 pages, 3 tables, 3 figures","Pattern Recognition 119(2021), pp.108057",10.1016/j.patcog.2021.108057.,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convolutional Neural Networks (CNNs) such as ResNet-50, DenseNet-40 and
ResNeXt-56 are severely over-parameterized, necessitating a consequent increase
in the computational resources required for model training which scales
exponentially for increments in model depth. In this paper, we propose an
Entropy-Based Convolutional Layer Estimation (EBCLE) heuristic which is robust
and simple, yet effective in resolving the problem of over-parameterization
with regards to network depth of CNN model. The EBCLE heuristic employs a
priori knowledge of the entropic data distribution of input datasets to
determine an upper bound for convolutional network depth, beyond which identity
transformations are prevalent offering insignificant contributions for
enhancing model performance. Restricting depth redundancies by forcing feature
compression and abstraction restricts over-parameterization while decreasing
training time by 24.99% - 78.59% without degradation in model performance. We
present empirical evidence to emphasize the relative effectiveness of broader,
yet shallower models trained using the EBCLE heuristic, which maintains or
outperforms baseline classification accuracies of narrower yet deeper models.
The EBCLE heuristic is architecturally agnostic and EBCLE based CNN models
restrict depth redundancies resulting in enhanced utilization of the available
computational resources. The proposed EBCLE heuristic is a compelling technique
for researchers to analytically justify their HyperParameter (HP) choices for
CNNs. Empirical validation of the EBCLE heuristic in training CNN models was
established on five benchmarking datasets (ImageNet32, CIFAR-10/100, STL-10,
MNIST) and four network architectures (DenseNet, ResNet, ResNeXt and
EfficientNet B0-B2) with appropriate statistical tests employed to infer any
conclusive claims presented in this paper.
","[{'version': 'v1', 'created': 'Sun, 27 Jun 2021 10:34:39 GMT'}]",2021-06-29,"[['Gowdra', 'Nidhi', ''], ['Sinha', 'Roopak', ''], ['MacDonell', 'Stephen', ''], ['Yan', 'Wei Qi', '']]","['Convolutional neural networks (CNNs)', 'Depth redundancy', 'Entropy', 'Feature compression', 'EBCLE']"
6018,1910.01197,Bin Zhu,"Bin Zhu, Xin Guo, Kenneth Barner, Charles Boncelet",Automatic Group Cohesiveness Detection With Multi-modal Features,,,10.1145/3340555.3355716,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Group cohesiveness is a compelling and often studied composition in group
dynamics and group performance. The enormous number of web images of groups of
people can be used to develop an effective method to detect group cohesiveness.
This paper introduces an automatic group cohesiveness prediction method for the
7th Emotion Recognition in the Wild (EmotiW 2019) Grand Challenge in the
category of Group-based Cohesion Prediction. The task is to predict the
cohesive level for a group of people in images. To tackle this problem, a
hybrid network including regression models which are separately trained on face
features, skeleton features, and scene features is proposed. Predicted
regression values, corresponding to each feature, are fused for the final
cohesive intensity. Experimental results demonstrate that the proposed hybrid
network is effective and makes promising improvements. A mean squared error
(MSE) of 0.444 is achieved on the testing sets which outperforms the baseline
MSE of 0.5.
","[{'version': 'v1', 'created': 'Wed, 2 Oct 2019 20:04:42 GMT'}]",2019-10-04,"[['Zhu', 'Bin', ''], ['Guo', 'Xin', ''], ['Barner', 'Kenneth', ''], ['Boncelet', 'Charles', '']]","['Cohesion Prediction', 'Multi-modal features', 'Transfer learning']"
6019,2003.03804,Federico Giaimo,"Federico Giaimo, Hugo Andrade, Christian Berger","Continuous Experimentation and the Cyber-Physical Systems challenge: An
  overview of the literature and the industrial perspective","Paper published in the Journal of Systems and Software. 42 pages, 2
  figures",,10.1016/j.jss.2020.110781,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: New software development patterns are emerging aiming at
accelerating the process of delivering value. One is Continuous
Experimentation, which allows to systematically deploy and run instrumented
software variants during development phase in order to collect data from the
field of application. While currently this practice is used on a daily basis on
web-based systems, technical difficulties challenge its adoption in fields
where computational resources are constrained, e.g., cyber-physical systems and
the automotive industry. Objective: This paper aims at providing an overview of
the engagement on the Continuous Experimentation practice in the context of
cyber-physical systems. %To provide an understanding of what is the
state-of-the-art of the Continuous Experimentation practice in the context of
cyber-physical systems, and what is the practitioners' feedback about this
practice. Method: A systematic literature review has been conducted to
investigate the link between the practice and the field of application.
Additionally, an industrial multiple case study is reported. Results: The study
presents the current state-of-the-art regarding Continuous Experimentation in
the field of cyber-physical systems. The current perspective of Continuous
Experimentation in industry is also reported. Conclusions: The field has not
reached maturity yet. More conceptual analyses are found than solution
proposals and the state-of-practice is yet to be achieved. However it is
expected that in time an increasing number of solutions will be proposed and
validated.
","[{'version': 'v1', 'created': 'Sun, 8 Mar 2020 16:07:29 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Jul 2020 00:32:36 GMT'}, {'version': 'v3', 'created': 'Fri, 11 Sep 2020 16:50:26 GMT'}]",2020-09-14,"[['Giaimo', 'Federico', ''], ['Andrade', 'Hugo', ''], ['Berger', 'Christian', '']]","['Continuous Experimentation', 'Cyber-physical Systems', 'Software']"
6020,2009.01215,Michael Lyons,Michael J. Lyons,"Excavating ""Excavating AI"": The Elephant in the Gallery","15 pages, 4 figures",,10.5281/zenodo.4037538,,cs.CY cs.AI cs.CV cs.HC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two art exhibitions, ""Training Humans"" and ""Making Faces,"" and the
accompanying essay ""Excavating AI: The politics of images in machine learning
training sets"" by Kate Crawford and Trevor Paglen, are making substantial
impact on discourse taking place in the social and mass media networks, and
some scholarly circles. Critical scrutiny reveals, however, a
self-contradictory stance regarding informed consent for the use of facial
images, as well as serious flaws in their critique of ML training sets. Our
analysis underlines the non-negotiability of informed consent when using human
data in artistic and other contexts, and clarifies issues relating to the
description of ML training sets.
","[{'version': 'v1', 'created': 'Wed, 2 Sep 2020 17:42:06 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Sep 2020 17:07:10 GMT'}, {'version': 'v3', 'created': 'Thu, 24 Dec 2020 01:27:53 GMT'}]",2020-12-25,"[['Lyons', 'Michael J.', '']]","['digital ethics', 'informed consent', 'training sets', 'ai', 'machine learning', 'affective computing']"
6021,2008.07069,Jens Dietrich,Patrick Lam and Jens Dietrich and David J. Pearce,Putting the Semantics into Semantic Versioning,to be published as Onward! Essays 2020,,10.1145/3426428.3426922,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The long-standing aspiration for software reuse has made astonishing strides
in the past few years. Many modern software development ecosystems now come
with rich sets of publicly-available components contributed by the community.
Downstream developers can leverage these upstream components, boosting their
productivity.
  However, components evolve at their own pace. This imposes obligations on and
yields benefits for downstream developers, especially since changes can be
breaking, requiring additional downstream work to adapt to. Upgrading too late
leaves downstream vulnerable to security issues and missing out on useful
improvements; upgrading too early results in excess work. Semantic versioning
has been proposed as an elegant mechanism to communicate levels of
compatibility, enabling downstream developers to automate dependency upgrades.
  While it is questionable whether a version number can adequately characterize
version compatibility in general, we argue that developers would greatly
benefit from tools such as semantic version calculators to help them upgrade
safely. The time is now for the research community to develop such tools: large
component ecosystems exist and are accessible, component interactions have
become observable through automated builds, and recent advances in program
analysis make the development of relevant tools feasible. In particular,
contracts (both traditional and lightweight) are a promising input to semantic
versioning calculators, which can suggest whether an upgrade is likely to be
safe.
","[{'version': 'v1', 'created': 'Mon, 17 Aug 2020 03:20:05 GMT'}]",2022-09-07,"[['Lam', 'Patrick', ''], ['Dietrich', 'Jens', ''], ['Pearce', 'David J.', '']]","['program evolution', 'semantic versioning', 'program analysis', 'verification', 'code contracts']"
6022,2002.07582,Indika Weerasingha Dewage,"Indika Kumara, Jun Han, Alan Colman, Willem-Jan van den Heuvel, Damian
  A. Tamburri, Malinda Kapuruge","SDSN@RT: a middleware environment for single-instance multi-tenant cloud
  applications",,Software: Practice and Experience 49.5 (2019): 813-839,10.1002/spe.2686,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the Single-Instance Multi-Tenancy (SIMT) model for composite
Software-as-a-Service (SaaS) applications, a single composite application
instance can host multiple tenants, yielding the benefits of better service and
resource utilization, and reduced operational cost for the SaaS provider. An
SIMT application needs to share services and their aggregation (the
application) among its tenants while supporting variations in the functional
and performance requirements of the tenants. The SaaS provider requires a
middleware environment that can deploy, enact and manage a designed SIMT
application, to achieve the varied requirements of the different tenants in a
controlled manner. This paper presents the SDSN@RT (Software-Defined Service
Networks @ RunTime) middleware environment that can meet the aforementioned
requirements. SDSN@RT represents an SIMT composite cloud application as a
multi-tenant service network, where the same service network simultaneously
hosts a set of virtual service networks (VSNs), one for each tenant. A service
network connects a set of services, and coordinates the interactions between
them. A VSN realizes the requirements for a specific tenant and can be
deployed, configured, and logically isolated in the service network at runtime.
SDSN@RT also supports the monitoring and runtime changes of the deployed
multi-tenant service networks. We show the feasibility of SDSN@RT with a
prototype implementation, and demonstrate its capabilities to host SIMT
applications and support their changes with a case study. The performance study
of the prototype implementation shows that the runtime capabilities of our
middleware incur little overhead.
","[{'version': 'v1', 'created': 'Mon, 10 Feb 2020 19:37:06 GMT'}]",2020-02-19,"[['Kumara', 'Indika', ''], ['Han', 'Jun', ''], ['Colman', 'Alan', ''], ['Heuvel', 'Willem-Jan van den', ''], ['Tamburri', 'Damian A.', ''], ['Kapuruge', 'Malinda', '']]","['middleware', 'service network', 'virtual service network', 'multi-tenancy', 'SaaS', 'cloud application', 'SDSN']"
6023,1710.01969,Yassine Hamoudi,Yassine Hamoudi,Simultaneous Multiparty Communication Complexity of Composed Functions,"17 pages, 1 figure; v2: improved introduction, better cost analysis
  for the 2nd protocol","43rd International Symposium on Mathematical Foundations of
  Computer Science (MFCS 2018), LIPIcs vol.117, pp. 14:1--14:15, 2018",10.4230/LIPIcs.MFCS.2018.14,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the Number On the Forehead (NOF) multiparty communication model, $k$
players want to evaluate a function $F : X_1 \times\cdots\times X_k\rightarrow
Y$ on some input $(x_1,\dots,x_k)$ by broadcasting bits according to a
predetermined protocol. The input is distributed in such a way that each player
$i$ sees all of it except $x_i$. In the simultaneous setting, the players
cannot speak to each other but instead send information to a referee. The
referee does not know the players' input, and cannot give any information back.
At the end, the referee must be able to recover $F(x_1,\dots,x_k)$ from what
she obtained.
  A central open question, called the $\log n$ barrier, is to find a function
which is hard to compute for $polylog(n)$ or more players (where the $x_i$'s
have size $poly(n)$) in the simultaneous NOF model. This has important
applications in circuit complexity, as it could help to separate $ACC^0$ from
other complexity classes. One of the candidates belongs to the family of
composed functions. The input to these functions is represented by a $k\times
(t\cdot n)$ boolean matrix $M$, whose row $i$ is the input $x_i$ and $t$ is a
block-width parameter. A symmetric composed function acting on $M$ is specified
by two symmetric $n$- and $kt$-variate functions $f$ and $g$, that output
$f\circ g(M)=f(g(B_1),\dots,g(B_n))$ where $B_j$ is the $j$-th block of width
$t$ of $M$. As the majority function $MAJ$ is conjectured to be outside of
$ACC^0$, Babai et. al. suggested to study $MAJ\circ MAJ_t$, with $t$ large
enough.
  So far, it was only known that $t=1$ is not enough for $MAJ\circ MAJ_t$ to
break the $\log n$ barrier in the simultaneous deterministic NOF model. In this
paper, we extend this result to any constant block-width $t>1$, by giving a
protocol of cost $2^{O(2^t)}\log^{2^{t+1}}(n)$ for any symmetric composed
function when there are $2^{\Omega(2^t)}\log n$ players.
","[{'version': 'v1', 'created': 'Thu, 5 Oct 2017 11:23:44 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Jan 2018 21:56:20 GMT'}]",2018-09-19,"[['Hamoudi', 'Yassine', '']]","['Communication complexity', 'Number On the Forehead model', 'Simultaneous Message Passing', 'Log n barrier', 'Symmetric Composed functions']"
6024,1401.6495,Wei Jeng,"Wei Jeng, Daqing He, Jiepu Jiang","User Participation in an Academic Social Networking Service: A Survey of
  Open Group Users on Mendeley",,"Journal of the Association for Information Science and Technology.
  66(2015), 890-904",10.1002/asi.23225,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although there are a number of social networking services that specifically
target scholars, little has been published about the actual practices and the
usage of these so-called academic social networking services (ASNSs). To fill
this gap, we explore the populations of academics who engage in social
activities using an ASNS; as an indicator of further engagement, we also
determine their various motivations for joining a group in ASNSs. Using groups
and their members in Mendeley as the platform for our case study, we obtained
146 participant responses from our online survey about users' common
activities, usage habits, and motivations for joining groups. Our results show
that 1) participants did not engage with social-based features as frequently
and actively as they engaged with research-based features, and 2) users who
joined more groups seemed to have a stronger motivation to increase their
professional visibility and to contribute the research articles they had read
to the group reading list. Our results generate interesting insights into
Mendeley's user populations, their activities, and their motivations relative
to the social features of Mendeley. We also argue that further design of ASNSs
is needed to take greater account of disciplinary differences in scholarly
communication and to establish incentive mechanisms for encouraging user
participation.
","[{'version': 'v1', 'created': 'Sat, 25 Jan 2014 04:48:07 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Feb 2014 16:50:59 GMT'}, {'version': 'v3', 'created': 'Tue, 9 Jun 2015 20:08:07 GMT'}]",2015-06-11,"[['Jeng', 'Wei', ''], ['He', 'Daqing', ''], ['Jiang', 'Jiepu', '']]","['Academic social networking', 'Mendeley', 'digital scholarship', 'online communities', 'research networks']"
6025,2107.09698,Rahul Krishna,"Anup Kalia, Jin Xiao, Rahul Krishna, Saurabh Sinha, Maja Vukovic,
  Debasish Banerjee","Mono2Micro: A Practical and Effective Tool for Decomposing Monolithic
  Java Applications to Microservices",,,10.1145/3468264.3473915,,cs.SE,http://creativecommons.org/publicdomain/zero/1.0/,"  In migrating production workloads to cloud, enterprises often face the
daunting task of evolving monolithic applications toward a microservice
architecture. At IBM, we developed a tool called Mono2Micro to assist with this
challenging task. Mono2Micro performs spatio-temporal decomposition, leveraging
well-defined business use cases and runtime call relations to create
functionally cohesive partitioning of application classes. Our preliminary
evaluation of Mono2Micro showed promising results. How well does Mono2Micro
perform against other decomposition techniques, and how do practitioners
perceive the tool? This paper describes the technical foundations of Mono2Micro
and presents results to answer these two questions. To answer the first
question, we evaluated Mono2Micro against four existing techniques on a set of
open-source and proprietary Java applications and using different metrics to
assess the quality of decomposition and tool's efficiency. Our results show
that Mono2Micro significantly outperforms state-of-the-art baselines in
specific metrics well-defined for the problem domain. To answer the second
question, we conducted a survey of twenty-one practitioners in various industry
roles who have used Mono2Micro. This study highlights several benefits of the
tool, interesting practitioner perceptions, and scope for further improvements.
Overall, these results show that Mono2Micro can provide a valuable aid to
practitioners in creating functionally cohesive and explainable microservice
decompositions.
","[{'version': 'v1', 'created': 'Tue, 20 Jul 2021 18:05:14 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Sep 2021 18:37:21 GMT'}]",2021-09-16,"[['Kalia', 'Anup', ''], ['Xiao', 'Jin', ''], ['Krishna', 'Rahul', ''], ['Sinha', 'Saurabh', ''], ['Vukovic', 'Maja', ''], ['Banerjee', 'Debasish', '']]","['microservices', 'dynamic analysis', 'clustering']"
6026,1909.02410,Alejandro Lopez-Cifuentes,"Alejandro L\'opez-Cifuentes, Marcos Escudero-Vi\~nolo, Jes\'us
  Besc\'os, \'Alvaro Garc\'ia-Mart\'in",Semantic-Aware Scene Recognition,"Paper submitted for publication to Elsevier Pattern Recognition
  journal","Pattern Recognition Volume 102, June 2020, 107256",10.1016/j.patcog.2020.107256,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scene recognition is currently one of the top-challenging research fields in
computer vision. This may be due to the ambiguity between classes: images of
several scene classes may share similar objects, which causes confusion among
them. The problem is aggravated when images of a particular scene class are
notably different. Convolutional Neural Networks (CNNs) have significantly
boosted performance in scene recognition, albeit it is still far below from
other recognition tasks (e.g., object or image recognition). In this paper, we
describe a novel approach for scene recognition based on an end-to-end
multi-modal CNN that combines image and context information by means of an
attention module. Context information, in the shape of semantic segmentation,
is used to gate features extracted from the RGB image by leveraging on
information encoded in the semantic representation: the set of scene objects
and stuff, and their relative locations. This gating process reinforces the
learning of indicative scene content and enhances scene disambiguation by
refocusing the receptive fields of the CNN towards them. Experimental results
on four publicly available datasets show that the proposed approach outperforms
every other state-of-the-art method while significantly reducing the number of
network parameters. All the code and data used along this paper is available at
https://github.com/vpulab/Semantic-Aware-Scene-Recognition
","[{'version': 'v1', 'created': 'Thu, 5 Sep 2019 13:44:03 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Sep 2019 10:44:22 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Jan 2020 16:03:52 GMT'}]",2020-02-28,"[['López-Cifuentes', 'Alejandro', ''], ['Escudero-Viñolo', 'Marcos', ''], ['Bescós', 'Jesús', ''], ['García-Martín', 'Álvaro', '']]","['Scene recognition', 'deep learning', 'convolutional neural networks', 'semantic segmentation']"
6027,2109.10002,Joachim Wehler,Joachim Wehler,"Perpetual Free-choice Petri nets are lucent -- proof of a theorem of van
  der Aalst using CP-exhaustions",Published by Fundamenta Informaticae,"Fundamenta Informaticae, Volume 182, Issue 4 (November 18, 2021)
  fi:8698",10.3233/FI-2021-2078,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  Van der Aalst's theorem is an important result for the analysis and synthesis
of process models. The paper proves the theorem by exhausting perpetual
free-choice Petri nets by CP-subnets. The resulting T-systems are investigated
by elementary methods.
","[{'version': 'v1', 'created': 'Tue, 21 Sep 2021 07:12:46 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Nov 2021 10:37:50 GMT'}]",2021-12-11,"[['Wehler', 'Joachim', '']]","['Free-choice system', 'CP-subnet', 'perpetuality', 'lucency']"
6028,2104.15010,Johannes Cornelius Schoeman,"J. C. Schoeman, C. E. van Daalen, J. A. du Preez",Degenerate Gaussian factors for probabilistic inference,"Accepted by International Journal of Approximate Reasoning on 17
  January 2022","International Journal of Approximate Reasoning, vol. 143, pp.
  159-191, 2022",10.1016/j.ijar.2022.01.008,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this paper, we propose a parametrised factor that enables inference on
Gaussian networks where linear dependencies exist among the random variables.
Our factor representation is effectively a generalisation of traditional
Gaussian parametrisations where the positive-definite constraint of the
covariance matrix has been relaxed. For this purpose, we derive various
statistical operations and results (such as marginalisation, multiplication and
affine transformations of random variables) that extend the capabilities of
Gaussian factors to these degenerate settings. By using this principled factor
definition, degeneracies can be accommodated accurately and automatically at
little additional computational cost. As illustration, we apply our methodology
to a representative example involving recursive state estimation of cooperative
mobile robots.
","[{'version': 'v1', 'created': 'Fri, 30 Apr 2021 13:58:29 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Aug 2022 15:30:36 GMT'}]",2022-08-05,"[['Schoeman', 'J. C.', ''], ['van Daalen', 'C. E.', ''], ['Preez', 'J. A. du', '']]","['Gaussian network', 'inference', 'linear dependence', 'degenerate factor', 'Dirac delta function', 'recursive state estimation']"
6029,2007.03059,Valentin Deschaintre,"Valentin Deschaintre, George Drettakis and Adrien Bousseau",Guided Fine-Tuning for Large-Scale Material Transfer,"Published in Computer Graphics Forum, 39(4); Proceedings of the
  Eurographics Symposium on Rendering 2020",,10.1111/cgf.14056,,cs.GR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a method to transfer the appearance of one or a few exemplar
SVBRDFs to a target image representing similar materials. Our solution is
extremely simple: we fine-tune a deep appearance-capture network on the
provided exemplars, such that it learns to extract similar SVBRDF values from
the target image. We introduce two novel material capture and design workflows
that demonstrate the strength of this simple approach. Our first workflow
allows to produce plausible SVBRDFs of large-scale objects from only a few
pictures. Specifically, users only need take a single picture of a large
surface and a few close-up flash pictures of some of its details. We use
existing methods to extract SVBRDF parameters from the close-ups, and our
method to transfer these parameters to the entire surface, enabling the
lightweight capture of surfaces several meters wide such as murals, floors and
furniture. In our second workflow, we provide a powerful way for users to
create large SVBRDFs from internet pictures by transferring the appearance of
existing, pre-designed SVBRDFs. By selecting different exemplars, users can
control the materials assigned to the target image, greatly enhancing the
creative possibilities offered by deep appearance capture.
","[{'version': 'v1', 'created': 'Mon, 6 Jul 2020 20:55:37 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Jul 2020 17:12:21 GMT'}]",2020-07-09,"[['Deschaintre', 'Valentin', ''], ['Drettakis', 'George', ''], ['Bousseau', 'Adrien', '']]","['material transfer', 'material capture', 'appearance capture', 'SVBRDF', 'deep learning', 'fine tuning']"
6030,1801.07664,Andrew Pitts,"Daniel R. Licata, Ian Orton, Andrew M. Pitts, Bas Spitters",Internal Universes in Models of Homotopy Type Theory,"In H. Kirchner (ed), Proceedings of the 3rd International Conference
  on Formal Structures for Computation and Deduction (FSCD 2018), Leibniz
  International Proceedings in Informatics (LIPIcs), Vol. 108, pp. 22:1-22:17,
  2018","Leibniz International Proceedings in Informatics (LIPIcs), Vol.
  108, pp. 22:1-22:17, 2018",10.4230/LIPIcs.FSCD.2018.22,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  We begin by recalling the essentially global character of universes in
various models of homotopy type theory, which prevents a straightforward
axiomatization of their properties using the internal language of the presheaf
toposes from which these model are constructed. We get around this problem by
extending the internal language with a modal operator for expressing properties
of global elements. In this setting we show how to construct a universe that
classifies the Cohen-Coquand-Huber-M\""ortberg (CCHM) notion of fibration from
their cubical sets model, starting from the assumption that the interval is
tiny - a property that the interval in cubical sets does indeed have. This
leads to an elementary axiomatization of that and related models of homotopy
type theory within what we call crisp type theory.
","[{'version': 'v1', 'created': 'Tue, 23 Jan 2018 17:21:55 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Jan 2018 11:50:58 GMT'}, {'version': 'v3', 'created': 'Mon, 30 Apr 2018 09:42:09 GMT'}, {'version': 'v4', 'created': 'Thu, 5 Jul 2018 08:54:10 GMT'}]",2019-12-18,"[['Licata', 'Daniel R.', ''], ['Orton', 'Ian', ''], ['Pitts', 'Andrew M.', ''], ['Spitters', 'Bas', '']]","['cubical sets', 'dependent type theory', 'homotopy type theory', 'internallanguage', 'modalities', 'univalent foundations', 'universes']"
6031,1907.03702,Nagesh Chandra Kanth,"Raghav Lakhotia, Chandra Kanth Nagesh, Krishna Madgula","Identifying Missing Component in the Bechdel Test Using Principal
  Component Analysis Method","8 pages, 6 images, Published in the Proceedings of International
  Conference on Machine Learning and Applications (ICMLA), 324 - 331, June
  2019, Copenhagen, Denmark, Recipient of the Best Paper Award","World Academy of Science, Engineering and Technology International
  Journal of Computer and Systems Engineering Vol:13, No:6, 2019",10.5281/zenodo.3299335,,cs.CY cs.LG,http://creativecommons.org/licenses/by/4.0/,"  A lot has been said and discussed regarding the rationale and significance of
the Bechdel Score. It became a digital sensation in 2013 when Swedish cinemas
began to showcase the Bechdel test score of a film alongside its rating. The
test has drawn criticism from experts and the film fraternity regarding its use
to rate the female presence in a movie. The pundits believe that the score is
too simplified and the underlying criteria of a film to pass the test must
include 1) at least two women, 2) who have at least one dialogue, 3) about
something other than a man, is egregious. In this research, we have considered
a few more parameters which highlight how we represent females in film, like
the number of female dialogues in a movie, dialogue genre, and part of speech
tags in the dialogue. The parameters were missing in the existing criteria to
calculate the Bechdel score. The research aims to analyze 342 movies scripts to
test a hypothesis if these extra parameters, above with the current Bechdel
criteria, are significant in calculating the female representation score. The
result of the Principal Component Analysis method concludes that the female
dialogue content is a key component and should be considered while measuring
the representation of women in a work of fiction.
","[{'version': 'v1', 'created': 'Wed, 19 Jun 2019 15:09:35 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Nov 2020 06:52:51 GMT'}]",2020-11-24,"[['Lakhotia', 'Raghav', ''], ['Nagesh', 'Chandra Kanth', ''], ['Madgula', 'Krishna', '']]","['Bechdel test', 'dialogue genre', 'parts of speech tags', 'principal component analysis']"
6032,2301.00764,Christian Lenz,"Christian Lenz, Sven Behnke","Bimanual Telemanipulation with Force and Haptic Feedback through an
  Anthropomorphic Avatar System","Published in Robotics and Autonomous Systems, 2022
  (https://doi.org/10.1016/j.robot.2022.104338). arXiv admin note: substantial
  text overlap with arXiv:2109.13382",,10.1016/j.robot.2022.104338,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robotic teleoperation is a key technology for a wide variety of applications.
It allows sending robots instead of humans in remote, possibly dangerous
locations while still using the human brain with its enormous knowledge and
creativity, especially for solving unexpected problems. A main challenge in
teleoperation consists of providing enough feedback to the human operator for
situation awareness and thus create full immersion, as well as offering the
operator suitable control interfaces to achieve efficient and robust task
fulfillment. We present a bimanual telemanipulation system consisting of an
anthropomorphic avatar robot and an operator station providing force and haptic
feedback to the human operator. The avatar arms are controlled in Cartesian
space with a direct mapping of the operator movements. The measured forces and
torques on the avatar side are haptically displayed to the operator. We
developed a predictive avatar model for limit avoidance which runs on the
operator side, ensuring low latency. The system was successfully evaluated
during the ANA Avatar XPRIZE competition semifinals. In addition, we performed
in lab experiments and carried out a small user study with mostly untrained
operators.
","[{'version': 'v1', 'created': 'Mon, 2 Jan 2023 17:26:54 GMT'}]",2023-01-03,"[['Lenz', 'Christian', ''], ['Behnke', 'Sven', '']]","['force feedback control', 'teleoperation', 'dual arm manipulation', 'human robot interaction', 'real-time control', 'haptic interface']"
6033,2108.12288,Gunnar Stefansson,"Gunnar Stefansson, Anna Helga Jonsdottir, Thorarinn Jonmundsson, Gylfi
  Snaer Sigurdsson, Ingunn Lilja Bergsdottir",Identifying rote learning and the supporting effects of hints in drills,,,10.21125/inted.2021.0556,,cs.CY stat.AP,http://creativecommons.org/licenses/by-sa/4.0/,"  Whenever students use any drilling system the question arises how much of
their learning is meaningful learning vs memorisation through repetition or
rote learning. Although both types of learning have their place in an
educational system it is important to be able to distinguish between these two
approaches to learning and identify options which can dislodge students from
rote learning and motivate them towards meaningful learning. The tutor-web is
an online drilling system. The design aim of the system is learning rather than
evaluation. This is done by presenting students with multiple-choice questions
which are selected randomly but linked to the students' performance. The
questions themselves can be generated for a specific topic by drawing correct
and incorrect answers from a collection associated with a general problem
statement or heading. With this generating process students may see the same
question heading twice but be presented with all new answer options or a
mixture of new and old answer options. Data from a course on probability theory
and statistics, taught during COVID-19, are analysed to separate rote learning
from meaningful learning. The analyses show non-rote learning, but even with
large question databases, students' performance is better when they are
presented with an answer option they have seen before. An element of rote
learning is thus exhibited but a deeper learning is also demonstrated. The item
database has been seeded with hints such that some questions contain clues to
cue the students towards the correct answer. This ties in with the issue of
meaningful learning versus rote learning since the hope is that a new hint will
work as a cue to coax the student to think harder about the question rather
than continue to employ rote learning. Preliminary results indicate that hints
are particularly useful for students with poor performance metrics.
","[{'version': 'v1', 'created': 'Thu, 19 Aug 2021 16:29:50 GMT'}]",2021-08-31,"[['Stefansson', 'Gunnar', ''], ['Jonsdottir', 'Anna Helga', ''], ['Jonmundsson', 'Thorarinn', ''], ['Sigurdsson', 'Gylfi Snaer', ''], ['Bergsdottir', 'Ingunn Lilja', '']]","['Identifying rote learning', 'applying learning to new problems', 'drills with clues', 'personalised drills']"
6034,1908.05380,Henrique Ferrolho,"Henrique Ferrolho and Wolfgang Merkt and Carlo Tiseo and Sethu
  Vijayakumar","Residual Force Polytope: Admissible Task-Space Forces of Dynamic
  Trajectories","Accepted to Robotics and Autonomous Systems (RAS).
  https://doi.org/10.1016/j.robot.2021.103814",,10.1016/j.robot.2021.103814,,cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We propose a representation for the set of forces a robot can counteract
using full system dynamics: the residual force polytope. Given the nominal
torques required by a dynamic motion, this representation models the forces
which can be sustained without interfering with that motion. The residual force
polytope can be used to analyze and compare the set of admissible forces of
different trajectories, but it can also be used to define metrics for solving
optimization problems, such as in trajectory optimization or system design. We
demonstrate how such a metric can be applied to trajectory optimization and
compare it against other objective functions typically used. Our results show
that the trajectories computed by optimizing objectives defined as functions of
the residual force polytope are more robust to unknown external disturbances.
The computational cost of these metrics is relatively high and not compatible
with the short planning times required by online methods, but they are
acceptable for planning motions offline.
","[{'version': 'v1', 'created': 'Thu, 15 Aug 2019 00:38:04 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Jul 2020 11:11:31 GMT'}, {'version': 'v3', 'created': 'Tue, 25 May 2021 11:02:12 GMT'}]",2021-05-26,"[['Ferrolho', 'Henrique', ''], ['Merkt', 'Wolfgang', ''], ['Tiseo', 'Carlo', ''], ['Vijayakumar', 'Sethu', '']]","['Robustness', 'Polytopes', 'Trajectory Optimization', 'Robotic Arms']"
6035,2005.08479,Wenjing Fang,"Wenjing Fang, Derun Zhao, Jin Tan, Chaochao Chen, Chaofan Yu, Li Wang,
  Lei Wang, Jun Zhou, Benyu Zhang",Large-Scale Secure XGB for Vertical Federated Learning,accepted by cikm21,,10.1145/3459637.3482361,,cs.LG cs.CR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Privacy-preserving machine learning has drawn increasingly attention
recently, especially with kinds of privacy regulations come into force. Under
such situation, Federated Learning (FL) appears to facilitate
privacy-preserving joint modeling among multiple parties. Although many
federated algorithms have been extensively studied, there is still a lack of
secure and practical gradient tree boosting models (e.g., XGB) in literature.
In this paper, we aim to build large-scale secure XGB under vertically
federated learning setting. We guarantee data privacy from three aspects.
Specifically, (i) we employ secure multi-party computation techniques to avoid
leaking intermediate information during training, (ii) we store the output
model in a distributed manner in order to minimize information release, and
(iii) we provide a novel algorithm for secure XGB predict with the distributed
model. Furthermore, by proposing secure permutation protocols, we can improve
the training efficiency and make the framework scale to large dataset. We
conduct extensive experiments on both public datasets and real-world datasets,
and the results demonstrate that our proposed XGB models provide not only
competitive accuracy but also practical performance.
","[{'version': 'v1', 'created': 'Mon, 18 May 2020 06:31:10 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Sep 2021 04:11:18 GMT'}]",2021-09-03,"[['Fang', 'Wenjing', ''], ['Zhao', 'Derun', ''], ['Tan', 'Jin', ''], ['Chen', 'Chaochao', ''], ['Yu', 'Chaofan', ''], ['Wang', 'Li', ''], ['Wang', 'Lei', ''], ['Zhou', 'Jun', ''], ['Zhang', 'Benyu', '']]","['Secure multi-party computation', 'secret sharing', 'secure permutation', 'gradient tree boosting']"
6036,1702.06087,Nicolas Kourtellis Ph.D.,"Nicolas Kourtellis, Tharaka Alahakoon, Ramanuja Simha, Adriana
  Iamnitchi, Rahul Tripathi",Identifying high betweenness centrality nodes in large social networks,"16 pages, 10 figures, 2 tables","Springer Journal on Social Network Analysis and Mining, Volume 3,
  Issue 4, pp. 899-914 (December 2013)",10.1007/s13278-012-0076-6,,cs.DS cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes an alternative way to identify nodes with high
betweenness centrality. It introduces a new metric, k-path centrality, and a
randomized algorithm for estimating it, and shows empirically that nodes with
high k-path centrality have high node betweenness centrality. The randomized
algorithm runs in time $O(\kappa^{3}n^{2-2\alpha}\log n)$ and outputs, for each
vertex v, an estimate of its k-path centrality up to additive error of $\pm
n^{1/2+ \alpha}$ with probability $1-1/n^2$. Experimental evaluations on real
and synthetic social networks show improved accuracy in detecting high
betweenness centrality nodes and significantly reduced execution time when
compared with existing randomized algorithms.
","[{'version': 'v1', 'created': 'Mon, 20 Feb 2017 18:06:42 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Feb 2017 10:44:45 GMT'}]",2017-02-23,"[['Kourtellis', 'Nicolas', ''], ['Alahakoon', 'Tharaka', ''], ['Simha', 'Ramanuja', ''], ['Iamnitchi', 'Adriana', ''], ['Tripathi', 'Rahul', '']]","['betweenness centrality', 'social network analysis', 'algorithms', 'experimental evaluation']"
6037,2103.17178,Pawe{\l} Guzewicz,"Yanlei Diao, Pawe{\l} Guzewicz, Ioana Manolescu, Mirjana Mazuran",Efficient Exploration of Interesting Aggregates in RDF Graphs,"Accepted for publication in proceedings of the 2021 International
  Conference on Management of Data (SIGMOD '21), June 20--25, 2021, Virtual
  Event, China",,10.1145/3448016.3457307,,cs.DB,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  As large Open Data are increasingly shared as RDF graphs today, there is a
growing demand to help users discover the most interesting facets of a graph,
which are often hard to grasp without automatic tools. We consider the problem
of automatically identifying the k most interesting aggregate queries that can
be evaluated on an RDF graph, given an integer k and a user-specified
interestingness function. Our problem departs from analytics in relational data
warehouses in that (i) in an RDF graph we are not given but we must identify
the facts, dimensions, and measures of candidate aggregates; (ii) the classical
approach to efficiently evaluating multiple aggregates breaks in the face of
multi-valued dimensions in RDF data. In this work, we propose an extensible
end-to-end framework that enables the identification and evaluation of
interesting aggregates based on a new RDF-compatible one-pass algorithm for
efficiently evaluating a lattice of aggregates and a novel early-stop technique
(with probabilistic guarantees) that can prune uninteresting aggregates.
Experiments using both real and synthetic graphs demonstrate the ability of our
framework to find interesting aggregates in a large search space, the
efficiency of our algorithms (with up to 2.9x speedup over a similar pipeline
based on existing algorithms), and scalability as the data size and complexity
grow.
","[{'version': 'v1', 'created': 'Wed, 31 Mar 2021 15:52:18 GMT'}]",2021-04-01,"[['Diao', 'Yanlei', ''], ['Guzewicz', 'Paweł', ''], ['Manolescu', 'Ioana', ''], ['Mazuran', 'Mirjana', '']]","['data analytics', 'data exploration', 'graphs', 'RDF']"
6038,2011.03463,Reynald Affeldt,"Reynald Affeldt, David Nowak",Extending Equational Monadic Reasoning with Monad Transformers,"19 pages, 26th International Conference on Types for Proofs and
  Programs (TYPES 2020)",,10.4230/LIPIcs.TYPES.2020.2,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a recent interest for the verification of monadic programs using
proof assistants. This line of research raises the question of the integration
of monad transformers, a standard technique to combine monads. In this paper,
we extend Monae, a Coq library for monadic equational reasoning, with monad
transformers and we explain the benefits of this extension. Our starting point
is the existing theory of modular monad transformers, which provides a uniform
treatment of operations. Using this theory, we simplify the formalization of
models in Monae and we propose an approach to support monadic equational
reasoning in the presence of monad transformers. We also use Monae to revisit
the lifting theorems of modular monad transformers by providing equational
proofs and explaining how to patch a known bug using a non-standard use of Coq
that combines impredicative polymorphism and parametricity.
","[{'version': 'v1', 'created': 'Fri, 6 Nov 2020 16:32:38 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Mar 2021 10:10:55 GMT'}, {'version': 'v3', 'created': 'Sun, 18 Jul 2021 09:29:49 GMT'}]",2021-07-20,"[['Affeldt', 'Reynald', ''], ['Nowak', 'David', '']]","['monads', 'monad transformers', 'Coq', 'impredicativity', 'parametricity']"
6039,2207.03170,Kinga Skorupska,"Kinga Skorupska, Rados{\l}aw Nielek, Wies{\l}aw Kope\'c","AFFORCE: Actionable Framework for Designing Crowdsourcing Experiences
  for Older Adults","7 pages, 6 figures, presented at the WI-IAT 2021 Conference",,10.1145/3486622.3494026,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article we propose a unique framework for designing attractive and
engaging crowdsourcing systems for older adults, which is called AFFORCE
(Actionable Framework For Crowdsourcing Experiences). We first categorize and
map mitigating factors and barriers to crowdsourcing for older adults to
finally discuss, present and combine system elements addressing them into an
actionable reference framework. This innovative framework is based on our
experience with the design of crowdsourcing systems for older adults in
exploratory cases and studies, related work, as well as our and related
research at the intersection of older adults' use of ICT, crowdsourcing and
citizen science.
","[{'version': 'v1', 'created': 'Thu, 7 Jul 2022 08:59:48 GMT'}]",2022-07-08,"[['Skorupska', 'Kinga', ''], ['Nielek', 'Radosław', ''], ['Kopeć', 'Wiesław', '']]","['crowdsourcing', 'older adults', 'user experience design', 'crowdsourcing framework', 'crowdsourcing system', 'crowdsourcing experience', 'active aging']"
6040,2101.11268,Suyuchen Wang,"Suyuchen Wang, Ruihui Zhao, Xi Chen, Yefeng Zheng and Bang Liu","Enquire One's Parent and Child Before Decision: Fully Exploit
  Hierarchical Structure for Self-Supervised Taxonomy Expansion","12 pages, 6 figures. To appear in The Web Conference (WWW) 2021",,10.1145/3442381.3449948,,cs.CL cs.AI cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Taxonomy is a hierarchically structured knowledge graph that plays a crucial
role in machine intelligence. The taxonomy expansion task aims to find a
position for a new term in an existing taxonomy to capture the emerging
knowledge in the world and keep the taxonomy dynamically updated. Previous
taxonomy expansion solutions neglect valuable information brought by the
hierarchical structure and evaluate the correctness of merely an added edge,
which downgrade the problem to node-pair scoring or mini-path classification.
In this paper, we propose the Hierarchy Expansion Framework (HEF), which fully
exploits the hierarchical structure's properties to maximize the coherence of
expanded taxonomy. HEF makes use of taxonomy's hierarchical structure in
multiple aspects: i) HEF utilizes subtrees containing most relevant nodes as
self-supervision data for a complete comparison of parental and sibling
relations; ii) HEF adopts a coherence modeling module to evaluate the coherence
of a taxonomy's subtree by integrating hypernymy relation detection and several
tree-exclusive features; iii) HEF introduces the Fitting Score for position
selection, which explicitly evaluates both path and level selections and takes
full advantage of parental relations to interchange information for
disambiguation and self-correction. Extensive experiments show that by better
exploiting the hierarchical structure and optimizing taxonomy's coherence, HEF
vastly surpasses the prior state-of-the-art on three benchmark datasets by an
average improvement of 46.7% in accuracy and 32.3% in mean reciprocal rank.
","[{'version': 'v1', 'created': 'Wed, 27 Jan 2021 08:57:47 GMT'}]",2022-04-27,"[['Wang', 'Suyuchen', ''], ['Zhao', 'Ruihui', ''], ['Chen', 'Xi', ''], ['Zheng', 'Yefeng', ''], ['Liu', 'Bang', '']]","['taxonomy expansion', 'self-supervised learning', 'hierarchical structure']"
6041,2209.13978,Peter Bludau,Peter Bludau and Alexander Pretschner,Feature Sets in Just-in-Time Defect Prediction: An Empirical Evaluation,"10 pages, 3 figures, accepted at the 18th edition of the
  International Conference on Predictive Models and Data Analytics in Software
  Engineering (PROMISE'22)",,10.1145/3558489.3559068,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Just-in-time defect prediction assigns a defect risk to each new change to a
software repository in order to prioritize review and testing efforts. Over the
last decades different approaches were proposed in literature to craft more
accurate prediction models. However, defect prediction is still not widely used
in industry, due to predictions with varying performance. In this study, we
evaluate existing features on six open-source projects and propose two new
features sets, not yet discussed in literature. By combining all feature sets,
we improve MCC by on average 21%, leading to the best performing models when
compared to state-of-the-art approaches. We also evaluate effort-awareness and
find that on average 14% more defects can be identified, inspecting 20% of
changed lines.
","[{'version': 'v1', 'created': 'Wed, 28 Sep 2022 10:22:37 GMT'}]",2022-09-29,"[['Bludau', 'Peter', ''], ['Pretschner', 'Alexander', '']]","['JIT defect prediction', 'machine learning', 'empirical evaluation']"
6042,1909.10593,Mahdi Miraz,Md Mehedi Hassan Onik and Mahdi H. Miraz,"Performance Analytical Comparison of Blockchain-as-a-Service (BaaS)
  Platforms",,"Springer Nature LNICST Series, vol. 285, Online ISBN:
  978-3-030-23942-8, Print ISBN: 978-3-030-23943-5, Series Print ISSN:
  1867-8211, Series Online ISSN: 1867-822X, pp. 3-18, August 2019",10.1007/978-3-030-23943-5_1,,cs.NI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Both blockchain technologies and cloud computing are contemporary emerging
technologies. While the application of Blockchain technologies is being spread
beyond cryptocurrency, cloud computing is also seeing a paradigm shift to meet
the needs of the 4th industrial revolution (Industry 4.0). New technological
ad-vancement, especially by the fusion of these two, such as
Blockchain-as-a-Service (BaaS), is considered to be able to significantly
generate values to the en-terprises. This article surveys the current status of
BaaS in terms of technological development, applications, market potentials and
so forth. An evaluative judge-ment, comparing amongst various BaaS platforms,
has been presented, along with the trajectory of adoption, challenges and risk
factors. Finally, the study suggests standardisation of available BaaS
platforms.
","[{'version': 'v1', 'created': 'Mon, 2 Sep 2019 03:54:53 GMT'}]",2019-09-25,"[['Onik', 'Md Mehedi Hassan', ''], ['Miraz', 'Mahdi H.', '']]","['Atomic Swap', 'Blockchain', 'Blockchain-as-a-Service', 'BaaS', 'Cloud Computing', 'Distributed Ledger Technology', 'DLT', 'Lightning Network']"
6043,2205.00816,Huan Yin,"Huan Yin, Zhiyi Lin, Justin K.W. Yeoh",Semantic localization on BIM-generated maps using a 3D LiDAR sensor,"Accepted by Automation in Construction. Please refer to the published
  version online. A video demonstration is at https://youtu.be/6jscy2Y5mj4","Year 2023, Volume 146",10.1016/j.autcon.2022.104641,,cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Conventional sensor-based localization relies on high-precision maps, which
are generally built using specialized mapping techniques involving high labor
and computational costs. In the architectural, engineering and construction
industry, Building Information Models (BIM) are available and can provide
informative descriptions of environments. This paper explores an effective way
to localize a mobile 3D LiDAR sensor on BIM-generated maps considering both
geometric and semantic properties. First, original BIM elements are converted
to semantically augmented point cloud maps using categories and locations.
After that, a coarse-to-fine semantic localization is performed to align laser
points to the map based on iterative closest point registration. The
experimental results show that the semantic localization can track the pose
successfully with only one LiDAR sensor, thus demonstrating the feasibility of
the proposed mapping-free localization framework. The results also show that
using semantic information can help reduce localization errors on BIM-generated
maps.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 11:42:09 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Nov 2022 03:47:56 GMT'}]",2022-11-30,"[['Yin', 'Huan', ''], ['Lin', 'Zhiyi', ''], ['Yeoh', 'Justin K. W.', '']]","['= Building information modeling', 'LiDAR', 'Localization', 'Semantic', 'Iterative closest point}']"
6044,1908.06817,Sterling Ramroach,"Sterling Ramroach, Melford John, and Ajay Joshi","The efficacy of various machine learning models for multi-class
  classification of RNA-seq expression data","12 pages, 4 figures, 3 tables, conference paper: Computing Conference
  2019, published at
  https://link.springer.com/chapter/10.1007/978-3-030-22871-2_65",,10.1007/978-3-030-22871-2_65,,cs.LG q-bio.GN stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Late diagnosis and high costs are key factors that negatively impact the care
of cancer patients worldwide. Although the availability of biological markers
for the diagnosis of cancer type is increasing, costs and reliability of tests
currently present a barrier to the adoption of their routine use. There is a
pressing need for accurate methods that enable early diagnosis and cover a
broad range of cancers. The use of machine learning and RNA-seq expression
analysis has shown promise in the classification of cancer type. However,
research is inconclusive about which type of machine learning models are
optimal. The suitability of five algorithms were assessed for the
classification of 17 different cancer types. Each algorithm was fine-tuned and
trained on the full array of 18,015 genes per sample, for 4,221 samples (75 %
of the dataset). They were then tested with 1,408 samples (25 % of the dataset)
for which cancer types were withheld to determine the accuracy of prediction.
The results show that ensemble algorithms achieve 100% accuracy in the
classification of 14 out of 17 types of cancer. The clustering and
classification models, while faster than the ensembles, performed poorly due to
the high level of noise in the dataset. When the features were reduced to a
list of 20 genes, the ensemble algorithms maintained an accuracy above 95% as
opposed to the clustering and classification models.
","[{'version': 'v1', 'created': 'Mon, 19 Aug 2019 14:10:44 GMT'}]",2019-08-20,"[['Ramroach', 'Sterling', ''], ['John', 'Melford', ''], ['Joshi', 'Ajay', '']]","['Machine learning', 'Cancer classification', 'Supervised learning']"
6045,2002.06667,Igor Sfiligoi,"Igor Sfiligoi, Frank Wuerthwein, Benedikt Riedel, and David Schultz","Running a Pre-Exascale, Geographically Distributed, Multi-Cloud
  Scientific Simulation","18 pages, 5 figures, 4 tables, to be published in Proceedings of ISC
  High Performance 2020","Lecture Notes in Computer Science, vol 12151, year 2020. Springer",10.1007/978-3-030-50743-5_2,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  As we approach the Exascale era, it is important to verify that the existing
frameworks and tools will still work at that scale. Moreover, public Cloud
computing has been emerging as a viable solution for both prototyping and
urgent computing. Using the elasticity of the Cloud, we have thus put in place
a pre-exascale HTCondor setup for running a scientific simulation in the Cloud,
with the chosen application being IceCube's photon propagation simulation. I.e.
this was not a purely demonstration run, but it was also used to produce
valuable and much needed scientific results for the IceCube collaboration. In
order to reach the desired scale, we aggregated GPU resources across 8 GPU
models from many geographic regions across Amazon Web Services, Microsoft
Azure, and the Google Cloud Platform. Using this setup, we reached a peak of
over 51k GPUs corresponding to almost 380 PFLOP32s, for a total integrated
compute of about 100k GPU hours. In this paper we provide the description of
the setup, the problems that were discovered and overcome, as well as a short
description of the actual science output of the exercise.
","[{'version': 'v1', 'created': 'Sun, 16 Feb 2020 20:13:39 GMT'}]",2020-06-23,"[['Sfiligoi', 'Igor', ''], ['Wuerthwein', 'Frank', ''], ['Riedel', 'Benedikt', ''], ['Schultz', 'David', '']]","['Cloud', 'Exascale', 'GPU', 'HTCondor', 'IceCube', 'astrophysics']"
6046,2009.01178,Paolo Mantovani,"Paolo Mantovani, Davide Giri, Giuseppe Di Guglielmo, Luca Piccolboni,
  Joseph Zuckerman, Emilio G. Cota, Michele Petracca, Christian Pilato and Luca
  P. Carloni",Agile SoC Development with Open ESP,"Invited Paper at the 2020 International Conference On Computer Aided
  Design (ICCAD) - Special Session on Opensource Tools and Platforms for Agile
  Development of Specialized Architectures",,10.1145/3400302.3415753,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  ESP is an open-source research platform for heterogeneous SoC design. The
platform combines a modular tile-based architecture with a variety of
application-oriented flows for the design and optimization of accelerators. The
ESP architecture is highly scalable and strikes a balance between regularity
and specialization. The companion methodology raises the level of abstraction
to system-level design and enables an automated flow from software and hardware
development to full-system prototyping on FPGA. For application developers, ESP
offers domain-specific automated solutions to synthesize new accelerators for
their software and to map complex workloads onto the SoC architecture. For
hardware engineers, ESP offers automated solutions to integrate their
accelerator designs into the complete SoC. Conceived as a heterogeneous
integration platform and tested through years of teaching at Columbia
University, ESP supports the open-source hardware community by providing a
flexible platform for agile SoC development.
","[{'version': 'v1', 'created': 'Wed, 2 Sep 2020 16:38:48 GMT'}]",2020-09-03,"[['Mantovani', 'Paolo', ''], ['Giri', 'Davide', ''], ['Di Guglielmo', 'Giuseppe', ''], ['Piccolboni', 'Luca', ''], ['Zuckerman', 'Joseph', ''], ['Cota', 'Emilio G.', ''], ['Petracca', 'Michele', ''], ['Pilato', 'Christian', ''], ['Carloni', 'Luca P.', '']]","['System-level design', 'SoC', 'accelerators', 'network-on-chip']"
6047,1902.02816,Ajay Jain,"Charith Mendis, Ajay Jain, Paras Jain and Saman Amarasinghe",Revec: Program Rejuvenation through Revectorization,"The first two authors contributed equally to this work. Published at
  CC 2019",Compiler Construction (CC) 2019,10.1145/3302516.3307357,,cs.PL cs.PF,http://creativecommons.org/licenses/by/4.0/,"  Modern microprocessors are equipped with Single Instruction Multiple Data
(SIMD) or vector instructions which expose data level parallelism at a fine
granularity. Programmers exploit this parallelism by using low-level vector
intrinsics in their code. However, once programs are written using vector
intrinsics of a specific instruction set, the code becomes non-portable. Modern
compilers are unable to analyze and retarget the code to newer vector
instruction sets. Hence, programmers have to manually rewrite the same code
using vector intrinsics of a newer generation to exploit higher data widths and
capabilities of new instruction sets. This process is tedious, error-prone and
requires maintaining multiple code bases. We propose Revec, a compiler
optimization pass which revectorizes already vectorized code, by retargeting it
to use vector instructions of newer generations. The transformation is
transparent, happening at the compiler intermediate representation level, and
enables performance portability of hand-vectorized code.
  Revec can achieve performance improvements in real-world performance critical
kernels. In particular, Revec achieves geometric mean speedups of 1.160$\times$
and 1.430$\times$ on fast integer unpacking kernels, and speedups of
1.145$\times$ and 1.195$\times$ on hand-vectorized x265 media codec kernels
when retargeting their SSE-series implementations to use AVX2 and AVX-512
vector instructions respectively. We also extensively test Revec's impact on
216 intrinsic-rich implementations of image processing and stencil kernels
relative to hand-retargeting.
","[{'version': 'v1', 'created': 'Thu, 7 Feb 2019 19:37:45 GMT'}]",2019-02-11,"[['Mendis', 'Charith', ''], ['Jain', 'Ajay', ''], ['Jain', 'Paras', ''], ['Amarasinghe', 'Saman', '']]","['vectorization', 'program rejuvenation', 'Single Instruction MultipleData (SIMD)', 'optimizing compilation']"
6048,2210.02760,Venkatesh  Kumar M,Venkatesh Kumar M,"Cyber-Resilient Privacy Preservation and Secure Billing Approach for
  Smart Energy Metering Devices",Journal article,"Volume 70 Issue 9, 337-345, September 2022",10.14445/22315381/IJETT-V70I9P233,,cs.CR cs.IR cs.NI,http://creativecommons.org/licenses/by/4.0/,"  Most of the smart applications, such as smart energy metering devices, demand
strong privacy preservation to strengthen data privacy. However, it is
difficult to protect the privacy of the smart device data, especially on the
client side. It is mainly because payment for billing is computed by the server
deployed at the client's side, and it is highly challenging to prevent the
leakage of client's information to unauthorised users. Various researchers have
discussed this problem and have proposed different privacy preservation
techniques. Conventional techniques suffer from the problem of high
computational and communication overload on the client side. In addition, the
performance of these techniques deteriorates due to computational complexity
and their inability to handle the security of large-scale data. Due to these
limitations, it becomes easy for the attackers to introduce malicious attacks
on the server, posing a significant threat to data security. In this context,
this proposal intends to design novel privacy preservation and secure billing
framework using deep learning techniques to ensure data security in smart
energy metering devices. This research aims to overcome the limitations of the
existing techniques to achieve robust privacy preservation in smart devices and
increase the cyber resilience of these devices.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2022 09:01:13 GMT'}]",2022-10-07,"[['M', 'Venkatesh Kumar', '']]","['Cyber Resilient', 'Data mining', 'Data Security', 'Privacy Preservation', 'Smart Metering.  1']"
6049,2206.15218,Matti Pouke,"Matti Pouke, Evan G. Center, Alexis P. Chambers, Sakaria Pouke, Timo
  Ojala, Steven M. LaValle",The Body Scaling Effect and Its Impact on Physics Plausibility,"Accepted version. Published version at
  https://www.frontiersin.org/articles/10.3389/frvir.2022.869603/full","Frontiers in Virtual Reality, 3, 2022",10.3389/frvir.2022.869603,,cs.MM cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study we investigated the effect of body ownership illusion-based
body scaling on physics plausibility in Virtual Reality (VR). Our interest was
in examining whether body ownership illusion-based body scaling could affect
the plausibility of rigid body dynamics similarly to altering VR users' scale
by manipulating their virtual interpupillary distance and viewpoint height. The
procedure involved the conceptual replication of two previous studies. We
investigated physics plausibility with 40 participants under two conditions. In
our synchronous condition, we used visuo-tactile stimuli to elicit a body
ownership illusion of inhabiting an invisible doll-sized body on participants
reclining on an exam table. Our asynchronous condition was otherwise similar,
but the visuo-tactile stimuli were provided asynchronously to prevent the onset
of the body ownership illusion. We were interested in whether the correct
approximation of physics (true physics) or physics that are incorrect and
appearing as if the environment is five times larger instead (movie physics)
appear more realistic to participants as a function of body scale. We found
that movie physics did appear more realistic to participants under the body
ownership illusion condition. However, our hypothesis that true physics would
appear more realistic in the asynchronous condition was unsupported. Our
exploratory analyses revealed that movie physics were perceived as plausible
under both conditions. Moreover, we were not able to replicate previous
findings from literature concerning object size estimations while inhabiting a
small invisible body. However, we found a significant opposite effect regarding
size estimations; the object sizes were on average underestimated during the
synchronous visuo-tactile condition when compared to the asynchronous
condition.
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2022 12:04:43 GMT'}]",2022-07-01,"[['Pouke', 'Matti', ''], ['Center', 'Evan G.', ''], ['Chambers', 'Alexis P.', ''], ['Pouke', 'Sakaria', ''], ['Ojala', 'Timo', ''], ['LaValle', 'Steven M.', '']]","['Virtual Reality', 'Perception', 'Scaling', 'Embodiment', 'Human Factors']"
6050,2004.08607,Nassim Dehouche,Nassim Dehouche,Accumulator Bet Selection Through Stochastic Diffusion Search,,"Information and Control, Volume 15, Number 2, pp 641 652 (2019)",10.24507/ijicic.15.02.641,,cs.AI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An accumulator is a bet that presents a rather unique payout structure, in
that it combines multiple bets into a wager that can generate a total payout
given by the multiplication of the individual odds of its parts. These
potentially important returns come however at an increased risk of a loss.
Indeed, the presence of a single incorrect bet in this selection would make the
whole accumulator lose. The complexity of selecting a set of matches to place
an accumulator bet on, as well as the number of opportunities to identify
winning combinations have both dramatically increased with the easier access to
online and offline bookmakers that bettors have nowadays. We address this
relatively under-studied combinatorial aspect of sports betting, and propose a
binary optimization model for the problem of selecting the most promising
combinations of matches, in terms of their total potential payout and
probability of a win, to form an accumulator bet. The results of an ongoing
computational experiment, in which our model is applied to real data pertaining
to the four main football leagues in the world over a complete season, are
presented and compared to those of single bet selection methods.
","[{'version': 'v1', 'created': 'Sat, 18 Apr 2020 12:42:23 GMT'}]",2020-04-21,"[['Dehouche', 'Nassim', '']]","['Combinatorial Optimization', 'Metaheuristics', 'Stochastic Diffusion Search', 'Decision Support Systems', 'Recommender Systems', 'Football Betting']"
6051,2009.09983,Suthee Ruangwises,"Suthee Ruangwises, Toshiya Itoh",Physical Zero-Knowledge Proof for Ripple Effect,A preliminary version of this paper has appeared at WALCOM 2021,"Theoretical Computer Science, 895: 115-123 (2021)",10.1016/j.tcs.2021.09.034,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ripple Effect is a logic puzzle where the player has to fill numbers into
empty cells in a rectangular grid. The grid is divided into rooms, and each
room must contain consecutive integers starting from 1 to its size. Also, if
two cells in the same row or column contain the same number $x$, there must be
a space of at least $x$ cells separating the two cells. In this paper, we
develop a physical zero-knowledge proof for the Ripple Effect puzzle using a
deck of cards, which allows a prover to convince a verifier that he/she knows a
solution without revealing it. In particular, given a secret number $x$ and a
list of numbers, our protocol can physically verify that $x$ does not appear
among the first $x$ numbers in the list without revealing $x$ or any number in
the list.
","[{'version': 'v1', 'created': 'Mon, 21 Sep 2020 16:08:08 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Feb 2021 17:55:43 GMT'}, {'version': 'v3', 'created': 'Mon, 27 Sep 2021 13:05:53 GMT'}]",2021-11-11,"[['Ruangwises', 'Suthee', ''], ['Itoh', 'Toshiya', '']]","['zero-knowledge proof', 'card-based cryptography', 'Ripple Effect', 'puzzle']"
6052,2208.07217,Farshad Ahmadi Asl,Farshad Ahmadi Asl and Mehmet Bodur,"Comparison of Forecasting Methods of House Electricity Consumption for
  Honda Smart Home","10th International Conference on Artificial Intelligence, Soft
  Computing (AISC 2022) July 30-31, 2022, London, United Kingdom",,10.5121/csit.2022.121311,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The electricity consumption of buildings composes a major part of the city's
energy consumption. Electricity consumption forecasting enables the development
of home energy management systems resulting in the future design of more
sustainable houses and a decrease in total energy consumption. Energy
performance in buildings is influenced by many factors like ambient
temperature, humidity, and a variety of electrical devices. Therefore,
multivariate prediction methods are preferred rather than univariate. The Honda
Smart Home US data set was selected to compare three methods for minimizing
forecasting errors, MAE and RMSE: Artificial Neural Networks, Support Vector
Regression, and Fuzzy Rule-Based Systems for Regression by constructing many
models for each method on a multivariate data set in different time terms. The
comparison shows that SVR is a superior method over the alternatives.
","[{'version': 'v1', 'created': 'Thu, 11 Aug 2022 19:04:41 GMT'}]",2022-08-16,"[['Asl', 'Farshad Ahmadi', ''], ['Bodur', 'Mehmet', '']]","['Forecasting', 'Mathematical Models', 'Electricity', 'Prediction', 'Consumption', 'ANN', 'SVR', 'FRBS']"
6053,2106.07449,Calvin Deutschbein,"Calvin Deutschbein, Andres Meza, Francesco Restuccia, Ryan Kastner and
  Cynthia Sturton","Isadora: Automated Information Flow Property Generation for Hardware
  Designs","10 pages, 4 figures, accepted at ASHES 2021",,10.1145/3474376.3487286,,cs.CR cs.AR,http://creativecommons.org/licenses/by/4.0/,"  Isadora is a methodology for creating information flow specifications of
hardware designs. The methodology combines information flow tracking and
specification mining to produce a set of information flow properties that are
suitable for use during the security validation process, and which support a
better understanding of the security posture of the design. Isadora is fully
automated; the user provides only the design under consideration and a
testbench and need not supply a threat model nor security specifications. We
evaluate Isadora on a RISC-V processor plus two designs related to SoC access
control. Isadora generates security properties that align with those suggested
by the Common Weakness Enumerations (CWEs), and in the case of the SoC designs,
align with the properties written manually by security experts.
","[{'version': 'v1', 'created': 'Mon, 14 Jun 2021 14:20:33 GMT'}, {'version': 'v2', 'created': 'Sat, 2 Oct 2021 18:19:22 GMT'}]",2021-10-05,"[['Deutschbein', 'Calvin', ''], ['Meza', 'Andres', ''], ['Restuccia', 'Francesco', ''], ['Kastner', 'Ryan', ''], ['Sturton', 'Cynthia', '']]","['Information Flow tracking', 'Specification Mining', 'Hardware Security']"
6054,2301.10633,Clement Vella,"Cl\'ement Vella (LaMcube), Serge Prudhomme",PGD reduced-order modeling for structural dynamics applications,,"Computer Methods in Applied Mechanics and Engineering, 2022, 402,
  pp.115736",10.1016/j.cma.2022.115736,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose in this paper a Proper Generalized Decomposition (PGD) approach
for the solution of problems in linear elastodynamics. The novelty of the work
lies in the development of weak formulations of the PGD problems based on the
Lagrangian and Hamiltonian Mechanics, the main objective being to devise
numerical methods that are numerically stable and energy conservative. We show
that the methodology allows one to consider the Galerkin-based version of the
PGD and numerically demonstrate that the PGD solver based on the Hamiltonian
formulation offers better stability and energy conservation properties than the
Lagrangian formulation. The performance of the two formulations is illustrated
and compared on several numerical examples describing the dynamical behavior of
a one-dimensional bar.
","[{'version': 'v1', 'created': 'Wed, 25 Jan 2023 15:16:00 GMT'}]",2023-01-26,"[['Vella', 'Clément', '', 'LaMcube'], ['Prudhomme', 'Serge', '']]","['Proper Generalized Decomposition', 'Wave Equation', 'Lagrangian and Hamiltonian Mechanics', 'Law of Conservation of Energy']"
6055,1805.03218,Junjie Wang,Junjie Wang and Ye Yang and Zhe Yu and Tim Menzies and Qing Wang,Crowdtesting : When is The Party Over?,12 pages,"iSENSE: completion-aware crowdtesting management. ICSE 2019:
  912-923",10.1109/ICSE.2019.00097,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Trade-offs such as ""how much testing is enough"" are critical yet challenging
project decisions in software engineering. Most existing approaches adopt
risk-driven or value-based analysis to prioritize test cases and minimize test
runs. However, none of these is applicable to the emerging crowd testing
paradigm where task requesters typically have no control over online
crowdworkers's dynamic behavior and uncertain performance.
  In current practice, deciding when to close a crowdtesting task is largely
done by guesswork due to lack of decision support. This paper intends to fill
this gap by introducing automated decision support for monitoring and
determining appropriate time to close the crowdtesting tasks.
  First, this paper investigates the necessity and feasibility of close
prediction of crowdtesting tasks based on industrial dataset. Then,it designs 8
methods for close prediction, based on various models including the bug trend,
bug arrival model, capture-recapture model.Finally, the evaluation is conducted
on 218 crowdtesting tasks from one of the largest crowdtesting platforms in
China, and the results show that a median of 91% bugs can be detected with 49%
saved cost.
","[{'version': 'v1', 'created': 'Tue, 8 May 2018 18:03:37 GMT'}]",2022-01-31,"[['Wang', 'Junjie', ''], ['Yang', 'Ye', ''], ['Yu', 'Zhe', ''], ['Menzies', 'Tim', ''], ['Wang', 'Qing', '']]","['Crowdtesting', 'Close Prediction', 'Software Bug']"
6056,1805.02125,Ebrahim Karami,"Ebrahim Karami, Mohamed Shehata, Andrew Smith","Estimation and Tracking of AP-diameter of the Inferior Vena Cava in
  Ultrasound Images Using a Novel Active Circle Algorithm",Published in Computers in Biology and Medicine,"In Computers in Biology and Medicine, vol. 98, pp. 16-25, July
  2018",10.1016/j.compbiomed.2018.05.001,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Medical research suggests that the anterior-posterior (AP)-diameter of the
inferior vena cava (IVC) and its associated temporal variation as imaged by
bedside ultrasound is useful in guiding fluid resuscitation of the
critically-ill patient. Unfortunately, indistinct edges and gaps in vessel
walls are frequently present which impede accurate estimation of the IVC
AP-diameter for both human operators and segmentation algorithms. The majority
of research involving use of the IVC to guide fluid resuscitation involves
manual measurement of the maximum and minimum AP-diameter as it varies over
time. This effort proposes using a time-varying circle fitted inside the
typically ellipsoid IVC as an efficient, consistent and novel approach to
tracking and approximating the AP-diameter even in the context of poor image
quality. In this active-circle algorithm, a novel evolution functional is
proposed and shown to be a useful tool for ultrasound image processing. The
proposed algorithm is compared with an expert manual measurement, and
state-of-the-art relevant algorithms. It is shown that the algorithm
outperforms other techniques and performs very close to manual measurement.
","[{'version': 'v1', 'created': 'Sat, 5 May 2018 23:47:24 GMT'}, {'version': 'v2', 'created': 'Tue, 8 May 2018 05:16:29 GMT'}, {'version': 'v3', 'created': 'Wed, 8 Aug 2018 18:41:43 GMT'}]",2018-08-10,"[['Karami', 'Ebrahim', ''], ['Shehata', 'Mohamed', ''], ['Smith', 'Andrew', '']]","['Inferior vena cava (IVC)', 'ultrasound imaging', 'image segmentation', 'active circle', 'evolutionfunctional', 'volume status', 'fluid responsiveness', 'resuscitation']"
6057,1910.00056,Sadegh Momeni Milajerdi,"Sadegh M. Milajerdi, Birhanu Eshete, Rigel Gjomemo, V.N.
  Venkatakrishnan","POIROT: Aligning Attack Behavior with Kernel Audit Records for Cyber
  Threat Hunting","The final version of this paper is going to appear in the ACM SIGSAC
  Conference on Computer and Communications Security (CCS'19), November 11-15,
  2019, London, United Kingdom",,10.1145/3319535.3363217,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cyber threat intelligence (CTI) is being used to search for indicators of
attacks that might have compromised an enterprise network for a long time
without being discovered. To have a more effective analysis, CTI open standards
have incorporated descriptive relationships showing how the indicators or
observables are related to each other. However, these relationships are either
completely overlooked in information gathering or not used for threat hunting.
In this paper, we propose a system, called POIROT, which uses these
correlations to uncover the steps of a successful attack campaign. We use
kernel audits as a reliable source that covers all causal relations and
information flows among system entities and model threat hunting as an inexact
graph pattern matching problem. Our technical approach is based on a novel
similarity metric which assesses an alignment between a query graph constructed
out of CTI correlations and a provenance graph constructed out of kernel audit
log records. We evaluate POIROT on publicly released real-world incident
reports as well as reports of an adversarial engagement designed by DARPA,
including ten distinct attack campaigns against different OS platforms such as
Linux, FreeBSD, and Windows. Our evaluation results show that POIROT is capable
of searching inside graphs containing millions of nodes and pinpoint the
attacks in a few minutes, and the results serve to illustrate that CTI
correlations could be used as robust and reliable artifacts for threat hunting.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2019 18:56:03 GMT'}]",2019-10-02,"[['Milajerdi', 'Sadegh M.', ''], ['Eshete', 'Birhanu', ''], ['Gjomemo', 'Rigel', ''], ['Venkatakrishnan', 'V. N.', '']]","['Cyber Threat Hunting', 'Cyber Threat Intelligence', 'Indicator of Compromise', 'Graph Alignment', 'Graph Pattern Matching']"
6058,2007.01719,Halcyon Carvalho,"Halcyon D. P. Carvalho, Mar\'ilia N. C. A. Lima, Wylliams B. Santos
  and Roberta A. de A.Fagunde","Ensemble Regression Models for Software Development Effort Estimation: A
  Comparative Study",,"International Journal of Software Engineering & Applications
  (IJSEA), Vol.11, No.3, May 2020",10.5121/ijsea.2020.11305,,cs.SE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As demand for computer software continually increases, software scope and
complexity become higher than ever. The software industry is in real need of
accurate estimates of the project under development. Software development
effort estimation is one of the main processes in software project management.
However, overestimation and underestimation may cause the software industry
loses. This study determines which technique has better effort prediction
accuracy and propose combined techniques that could provide better estimates.
Eight different ensemble models to estimate effort with Ensemble Models were
compared with each other base on the predictive accuracy on the Mean Absolute
Residual (MAR) criterion and statistical tests. The results have indicated that
the proposed ensemble models, besides delivering high efficiency in contrast to
its counterparts, and produces the best responses for software project effort
estimation. Therefore, the proposed ensemble models in this study will help the
project managers working with development quality software.
","[{'version': 'v1', 'created': 'Fri, 3 Jul 2020 14:40:41 GMT'}]",2020-07-06,"[['Carvalho', 'Halcyon D. P.', ''], ['Lima', 'Marília N. C. A.', ''], ['Santos', 'Wylliams B.', ''], ['Fagunde', 'Roberta A. de A.', '']]","['Ensemble Models', 'Bagging', 'Stacking', 'Prediction', 'Machine Learning', 'Effort Estimation', 'Project Management']"
6059,1908.11588,Chang Liu,"Chang Liu, Yi Dong, Han Yu, Zhiqi Shen, Zhanning Gao, Pan Wang,
  Changgong Zhang, Peiran Ren, Xuansong Xie, Lizhen Cui, Chunyan Miao",Generating Persuasive Visual Storylines for Promotional Videos,"10 pages, accepted by The 28th ACM International Conference on
  Information and Knowledge Management (CIKM)",,10.1145/3357384.3357906,,cs.MM cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video contents have become a critical tool for promoting products in
E-commerce. However, the lack of automatic promotional video generation
solutions makes large-scale video-based promotion campaigns infeasible. The
first step of automatically producing promotional videos is to generate visual
storylines, which is to select the building block footage and place them in an
appropriate order. This task is related to the subjective viewing experience.
It is hitherto performed by human experts and thus, hard to scale. To address
this problem, we propose WundtBackpack, an algorithmic approach to generate
storylines based on available visual materials, which can be video clips or
images. It consists of two main parts, 1) the Learnable Wundt Curve to evaluate
the perceived persuasiveness based on the stimulus intensity of a sequence of
visual materials, which only requires a small volume of data to train; and 2) a
clustering-based backpacking algorithm to generate persuasive sequences of
visual materials while considering video length constraints. In this way, the
proposed approach provides a dynamic structure to empower artificial
intelligence (AI) to organize video footage in order to construct a sequence of
visual stimuli with persuasive power. Extensive real-world experiments show
that our approach achieves close to 10% higher perceived persuasiveness scores
by human testers, and 12.5% higher expected revenue compared to the best
performing state-of-the-art approach.
","[{'version': 'v1', 'created': 'Fri, 30 Aug 2019 08:13:22 GMT'}]",2021-03-31,"[['Liu', 'Chang', ''], ['Dong', 'Yi', ''], ['Yu', 'Han', ''], ['Shen', 'Zhiqi', ''], ['Gao', 'Zhanning', ''], ['Wang', 'Pan', ''], ['Zhang', 'Changgong', ''], ['Ren', 'Peiran', ''], ['Xie', 'Xuansong', ''], ['Cui', 'Lizhen', ''], ['Miao', 'Chunyan', '']]","['Visual Storyline Generation', 'Persuasive Video Generation', 'VisualMaterial Presentation', 'Computer Vision']"
6060,2106.14621,Sreenivasa Reddy Yeduri,"Yeduri Sreenivasa Reddy, Garima Chopra, Ankit Dubey, Abhinav Kumar,
  Trilochan Panigrahi, and Linga Reddy Cenkeramaddi","Rate-Splitting Random Access Mechanism for Massive Machine Type
  Communications in 5G Cellular Internet-of-Things","6 pages, 6 figures, accepted for publication in IEEE PIMRC 2021","2021 IEEE 32nd Annual International Symposium on Personal, Indoor
  and Mobile Radio Communications (PIMRC)",10.1109/PIMRC50174.2021.9569424,,cs.IT math.IT,http://creativecommons.org/licenses/by/4.0/,"  The cellular Internet-of-Things has resulted in the deployment of millions of
machine-type communication (MTC) devices. These massive number of devices must
communicate with a single gNodeB (gNB) via the random access channel (RACH)
mechanism. However, existing RACH mechanisms are inefficient when dealing with
such large number of devices. To address this issue, we propose the
rate-splitting random access (RSRA) mechanism, which uses rate splitting and
decoding in rate-splitting multiple access (RSMA) to improve RACH success
rates. The proposed mechanism divides the message into common and private
messages and enhances the decoding performance. We demonstrate, using extensive
simulations, that the proposed RSRA mechanism significantly improves the
success rate of MTC in cellular IoT networks. We also evaluate the performance
of the proposed mechanism with increasing number of devices and received power
difference.
","[{'version': 'v1', 'created': 'Tue, 8 Jun 2021 13:03:56 GMT'}]",2021-10-26,"[['Reddy', 'Yeduri Sreenivasa', ''], ['Chopra', 'Garima', ''], ['Dubey', 'Ankit', ''], ['Kumar', 'Abhinav', ''], ['Panigrahi', 'Trilochan', ''], ['Cenkeramaddi', 'Linga Reddy', '']]","['Cellular Internet-of-Things', 'gNodeB', 'machine type communications (MTC)', 'random access channel', 'rate-splitting multiple access', 'received power']"
6061,2209.02158,Majid Saeedan,"Majid Saeedan, Ahmed Eldawy","Spatial Parquet: A Column File Format for Geospatial Data Lakes
  [Extended Version]","A short version of this paper is published in SIGSPATIAL`22.
  Available at: https://doi.org/10.1145/3557915",,10.1145/3557915.3561038,,cs.DB,http://creativecommons.org/licenses/by/4.0/,"  Modern data analytics applications prefer to use column-storage formats due
to their improved storage efficiency through encoding and compression. Parquet
is the most popular file format for column data storage that provides several
of these benefits out of the box. However, geospatial data is not readily
supported by Parquet. This paper introduces Spatial Parquet, a Parquet
extension that efficiently supports geospatial data. Spatial Parquet inherits
all the advantages of Parquet for non-spatial data, such as rich data types,
compression, and column/row filtering. Additionally, it adds three new features
to accommodate geospatial data. First, it introduces a geospatial data type
that can encode all standard spatial data types in a column format compatible
with Parquet. Second, it adds a new lossless and efficient encoding method,
termed FP-delta, that is customized to efficiently store geospatial coordinates
stored in floating-point format. Third, it adds a light-weight spatial index
that allows the reader to skip non-relevant parts of the file for increased
read efficiency. Experiments on large-scale real data showed that
SpatialParquet can reduce the data size by a factor of three, even without
compression. Compression can further reduce the storage size. Additionally,
Spatial Parquet can reduce the reading time by two orders of magnitude when the
light-weight index is applied. This initial prototype can open new research
directions to further improve geospatial data storage in column format.
","[{'version': 'v1', 'created': 'Mon, 5 Sep 2022 22:40:38 GMT'}]",2022-12-14,"[['Saeedan', 'Majid', ''], ['Eldawy', 'Ahmed', '']]","['datasets', 'geospatial', 'column store', 'parquet']"
6062,2103.04609,Mattia Lecci,"Mattia Lecci, Andrea Zanella, Michele Zorzi","An ns-3 Implementation of a Bursty Traffic Framework for Virtual Reality
  Sources","9 pages, 6 figures. Please cite it as: M. Lecci, A. Zanella, M.
  Zorzi, ""An ns-3 Implementation of a Bursty Traffic Framework for Virtual
  Reality Sources,"" in Workshop on ns-3 (WNS3), Jun. 2021, Virtual Event, US",,10.1145/3460797.3460807,,cs.NI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Next-generation wireless communication technologies will allow users to
obtain unprecedented performance, paving the way to new and immersive
applications. A prominent application requiring high data rates and low
communication delay is Virtual Reality (VR), whose presence will become
increasingly stronger in the years to come. To the best of our knowledge, we
propose the first traffic model for VR applications based on traffic traces
acquired from a commercial VR streaming software, allowing the community to
further study and improve the technology to manage this type of traffic. This
work implements ns-3 applications able to generate and process large bursts of
packets, enabling the possibility of analyzing APP-level end-to-end metrics,
making the source code as well as the acquired VR traffic traces publicly
available and open-source.
","[{'version': 'v1', 'created': 'Mon, 8 Mar 2021 08:59:58 GMT'}, {'version': 'v2', 'created': 'Mon, 3 May 2021 10:03:37 GMT'}]",2021-05-04,"[['Lecci', 'Mattia', ''], ['Zanella', 'Andrea', ''], ['Zorzi', 'Michele', '']]","['Virtual Reality', 'Video Traffic', 'Traffic Modeling', 'ns-3']"
6063,2005.12802,Bence Toth,B. G. T\'oth and I. Horv\'ath,"How the planned V0 railway line would increase the resilience of the
  railway network of Hungary against attacks","21 pages, 9 figures, 4 tables","Academic and Applied Research in Military and Public Management
  Science 18 (3), pp. 109-129. (2019)",10.32565/aarms.2019.3.6,,cs.CE cs.DM math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The spatial distribution of the railway crossings on the river Danube in
Hungary is very uneven. There is only one electrified and double-tracked bridge
in the country, the Southern Railway Bridge in Budapest. The \'Ujpest bridge in
Budapest only provides connection through line 4 which is not electrified and
the Baja bridge is not electrified, too, and both of them are single-tracked.
The long-planned V0 railway line that is to be cross the Danube approximately
halfway between Budapest and Baja would not only help to redistribute the total
network flow which currently passes through almost exclusively the Southern
bridge but would also provide redundancy for the existing bridges in the case
of their disruption. Four of the five proposed V0 path alternatives are
analyzed on the basis of these two network properties.
","[{'version': 'v1', 'created': 'Tue, 26 May 2020 15:36:44 GMT'}]",2020-05-27,"[['Tóth', 'B. G.', ''], ['Horváth', 'I.', '']]","['railway', 'network', 'disruption', 'redundancy']"
6064,2209.11902,Michael DeLeo,"Michael DeLeo, Erhan Guven",Learning Chess With Language Models and Transformers,Conference Paper,,10.5121/csit.2022.121515,,cs.AI cs.CL cs.GT cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Representing a board game and its positions by text-based notation enables
the possibility of NLP applications. Language models, can help gain insight
into a variety of interesting problems such as unsupervised learning rules of a
game, detecting player behavior patterns, player attribution, and ultimately
learning the game to beat state of the art. In this study, we applied BERT
models, first to the simple Nim game to analyze its performance in the presence
of noise in a setup of a few-shot learning architecture. We analyzed the model
performance via three virtual players, namely Nim Guru, Random player, and
Q-learner. In the second part, we applied the game learning language model to
the chess game, and a large set of grandmaster games with exhaustive
encyclopedia openings. Finally, we have shown that model practically learns the
rules of the chess game and can survive games against Stockfish at a category-A
rating level.
","[{'version': 'v1', 'created': 'Sat, 24 Sep 2022 01:22:59 GMT'}]",2022-09-27,"[['DeLeo', 'Michael', ''], ['Guven', 'Erhan', '']]","['Natural Language Processing', 'Chess', 'BERT', 'Sequence Learning']"
6065,1704.02286,Xavier Bellekens,"Elike Hodo and Xavier Bellekens and Andrew Hamilton and Pierre-louis
  Dubouilh and Ephraim Iorkyase and Christos Tachtatzis and Robert Atkinson","Threat analysis of IoT networks Using Artificial Neural Network
  Intrusion Detection System","Published in The 2016 International Symposium on Networks, Computers
  and Communications (IEEE ISNCC'16) , Hammamet, Tunisia, 2016",,10.1109/ISNCC.2016.7746067,,cs.NE cs.CR,http://creativecommons.org/licenses/by/4.0/,"  The Internet of things (IoT) is still in its infancy and has attracted much
interest in many industrial sectors including medical fields, logistics
tracking, smart cities and automobiles. However as a paradigm, it is
susceptible to a range of significant intrusion threats. This paper presents a
threat analysis of the IoT and uses an Artificial Neural Network (ANN) to
combat these threats. A multi-level perceptron, a type of supervised ANN, is
trained using internet packet traces, then is assessed on its ability to thwart
Distributed Denial of Service (DDoS/DoS) attacks. This paper focuses on the
classification of normal and threat patterns on an IoT Network. The ANN
procedure is validated against a simulated IoT network. The experimental
results demonstrate 99.4% accuracy and can successfully detect various DDoS/DoS
attacks.
","[{'version': 'v1', 'created': 'Fri, 7 Apr 2017 16:40:13 GMT'}]",2017-04-10,"[['Hodo', 'Elike', ''], ['Bellekens', 'Xavier', ''], ['Hamilton', 'Andrew', ''], ['Dubouilh', 'Pierre-louis', ''], ['Iorkyase', 'Ephraim', ''], ['Tachtatzis', 'Christos', ''], ['Atkinson', 'Robert', '']]","['Internet of things', 'Artificial Neural Network', 'Denial']"
6066,1702.07388,Ian McQuillan,Oscar H. Ibarra and Ian McQuillan,On Store Languages of Language Acceptors,"19 pages, preprint to be submitted to a journal","Theoretical Computer Science, 745, 114-132, 2018",10.1016/j.tcs.2018.05.036,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is well known that the ""store language"" of every pushdown automaton -- the
set of store configurations (state and stack contents) that can appear as an
intermediate step in accepting computations -- is a regular language. Here many
models of language acceptors with various data structures are examined, along
with a study of their store languages. For each model, an attempt is made to
find the simplest model that accepts their store languages. Some connections
between store languages of one-way and two-way machines generally are
demonstrated, as with connections between nondeterministic and deterministic
machines. A nice application of these store language results is also presented,
showing a general technique for proving families accepted by many deterministic
models are closed under right quotient with regular languages, resolving some
open questions (and significantly simplifying proofs for others that are known)
in the literature. Lower bounds on the space complexity for recognizing store
languages for the languages to be non-regular are obtained.
","[{'version': 'v1', 'created': 'Thu, 23 Feb 2017 20:55:12 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Mar 2019 16:36:35 GMT'}]",2019-03-08,"[['Ibarra', 'Oscar H.', ''], ['McQuillan', 'Ian', '']]","['Store Languages', 'Turing Machines', 'Storage Structures', 'Right Quotient', 'Automata']"
6067,2208.02981,Jiashu Wu,"Jiashu Wu, Yang Wang, Xiaopeng Fan, Kejiang Ye, Chengzhong Xu","Towards Fast Theta-join: A Prefiltering and Amalgamated Partitioning
  Approach",Accepted by Concurrency and Computation: Practice and Experience,,10.1002/cpe.6996,,cs.DS cs.DB,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  As one of the most useful online processing techniques, the theta-join
operation has been utilized by many applications to fully excavate the
relationships between data streams in various scenarios. As such, constant
research efforts have been put to optimize its performance in the distributed
environment, which is typically characterized by reducing the number of
Cartesian products as much as possible. In this article, we design and
implement a novel fast theta-join algorithm, called Prefap, by developing two
distinct techniques - prefiltering and amalgamated partitioning-based on the
state-of-the-art FastThetaJoin algorithm to optimize the efficiency of the
theta-join operation. Firstly, we develop a prefiltering strategy before data
streams are partitioned to reduce the amount of data to be involved and benefit
a more fine-grained partitioning. Secondly, to avoid the data streams being
partitioned in a coarse-grained isolated manner and improve the quality of the
partition-level filtering, we introduce an amalgamated partitioning mechanism
that can amalgamate the partitioning boundaries of two data streams to assist a
fine-grained partitioning. With the integration of these two techniques into
the existing FastThetaJoin algorithm, we design and implement a new framework
to achieve a decreased number of Cartesian products and a higher theta-join
efficiency. By comparing with existing algorithms, FastThetaJoin in particular,
we evaluate the performance of Prefap on both synthetic and real data streams
from two-way to multiway theta-join to demonstrate its superiority.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2022 04:36:01 GMT'}]",2022-08-08,"[['Wu', 'Jiashu', ''], ['Wang', 'Yang', ''], ['Fan', 'Xiaopeng', ''], ['Ye', 'Kejiang', ''], ['Xu', 'Chengzhong', '']]","['Theta-join (휃-join)', 'Online data stream', 'Pre-filtering', 'Amalgamated data stream partitioning', 'Cartesian']"
6068,1801.06457,Jose Bernal Moyano,"Jose Bernal, Kaisar Kushibar, Mariano Cabezas, Sergi Valverde, Arnau
  Oliver, Xavier Llad\'o","Quantitative analysis of patch-based fully convolutional neural networks
  for tissue segmentation on brain magnetic resonance imaging",,,10.1109/ACCESS.2019.2926697,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate brain tissue segmentation in Magnetic Resonance Imaging (MRI) has
attracted the attention of medical doctors and researchers since variations in
tissue volume help in diagnosing and monitoring neurological diseases. Several
proposals have been designed throughout the years comprising conventional
machine learning strategies as well as convolutional neural networks (CNN)
approaches. In particular, in this paper, we analyse a sub-group of deep
learning methods producing dense predictions. This branch, referred in the
literature as Fully CNN (FCNN), is of interest as these architectures can
process an input volume in less time than CNNs and local spatial dependencies
may be encoded since several voxels are classified at once. Our study focuses
on understanding architectural strengths and weaknesses of literature-like
approaches. Hence, we implement eight FCNN architectures inspired by robust
state-of-the-art methods on brain segmentation related tasks. We evaluate them
using the IBSR18, MICCAI2012 and iSeg2017 datasets as they contain infant and
adult data and exhibit varied voxel spacing, image quality, number of scans and
available imaging modalities. The discussion is driven in three directions:
comparison between 2D and 3D approaches, the importance of multiple modalities
and overlapping as a sampling strategy for training and testing models. To
encourage other researchers to explore the evaluation framework, a public
version is accessible to download from our research website.
","[{'version': 'v1', 'created': 'Fri, 19 Jan 2018 15:24:15 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Feb 2018 11:43:59 GMT'}]",2019-07-30,"[['Bernal', 'Jose', ''], ['Kushibar', 'Kaisar', ''], ['Cabezas', 'Mariano', ''], ['Valverde', 'Sergi', ''], ['Oliver', 'Arnau', ''], ['Lladó', 'Xavier', '']]","['Quantitative analysis', 'brain MRI', 'tissue segmentation', 'fully convolutional neural networks']"
6069,2106.02287,"Cha\""im van Toledo","Cha\""im van Toledo, Friso van Dijk, Marco Spruit","Dutch Named Entity Recognition and De-identification Methods for the
  Human Resource Domain",,"International Journal on Natural Language Computing (IJNLC) Vol.9,
  No.6, December 2020",10.5121/ijnlc.2020.9602,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  The human resource (HR) domain contains various types of privacy-sensitive
textual data, such as e-mail correspondence and performance appraisal. Doing
research on these documents brings several challenges, one of them
anonymisation. In this paper, we evaluate the current Dutch text
de-identification methods for the HR domain in four steps. First, by updating
one of these methods with the latest named entity recognition (NER) models. The
result is that the NER model based on the CoNLL 2002 corpus in combination with
the BERTje transformer give the best combination for suppressing persons
(recall 0.94) and locations (recall 0.82). For suppressing gender, DEDUCE is
performing best (recall 0.53). Second NER evaluation is based on both strict
de-identification of entities (a person must be suppressed as a person) and
third evaluation on a loose sense of de-identification (no matter what how a
person is suppressed, as long it is suppressed). In the fourth and last step a
new kind of NER dataset is tested for recognising job titles in texts.
","[{'version': 'v1', 'created': 'Fri, 4 Jun 2021 06:59:25 GMT'}]",2021-06-07,"[['van Toledo', 'Chaïm', ''], ['van Dijk', 'Friso', ''], ['Spruit', 'Marco', '']]","['Named Entity Recognition', 'Dutch', 'NER', 'BERT', 'evaluation', 'de-identification', 'job title recognition  1']"
6070,1708.02393,Chadarat Phipathananunth,Panuchart Bunyakiati and Chadarat Phipathananunth,"Cherry-Picking of Code Commits in Long-Running, Multi-release Software",5 pages,,10.1145/3106237.3122818,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents Tartarian, a tool that supports maintenance of software
with long-running, multi-release branches in distributed version control
systems. When new maintenance code, such as bug fixes and code improvement, is
committed into a branch, it is likely that such code can be applied or reused
with some other branches. To do so, a developer may manually identify a commit
and cherry pick it. Tartarian can support this activity by providing commit
hashtags, which the developer uses as metadata to specify their intentions when
committing the code. With these tags, Tartarian uses dependency graph, that
represents the dependency constraints of the branches, and Branch Identifier,
which matches the commit hashtags with the dependency graph, to identify the
applicable branches for the commits. Using Tartarian, developers may be able to
maintain software with multiple releases more efficiently.
","[{'version': 'v1', 'created': 'Tue, 8 Aug 2017 07:43:31 GMT'}]",2017-08-09,"[['Bunyakiati', 'Panuchart', ''], ['Phipathananunth', 'Chadarat', '']]","['version control system', 'git', 'github', 'cherry pick', 'dependency']"
6071,2012.14219,Antoine Kaufmann,"Hejing Li, Jialin Li, Antoine Kaufmann",SimBricks: End-to-End Network System Evaluation with Modular Simulation,"17 pages, 13 figures, appeared in In Proceedings of ACM SIGCOMM 2022
  Conference (SIGCOMM '22), August 22-26, 2022, Amsterdam, Netherlands",,10.1145/3544216.3544253,,cs.DC cs.NI cs.OS,http://creativecommons.org/licenses/by/4.0/,"  Full system ""end-to-end"" measurements in physical testbeds are the gold
standard for network systems evaluation but are often not feasible. When
physical testbeds are not available we frequently turn to simulation for
evaluation. Unfortunately, existing simulators are insufficient for end-to-end
evaluation, as they either cannot simulate all components, or simulate them
with inadequate detail. We address this through modular simulation, flexibly
combining and connecting multiple existing simulators for different components,
including processor and memory, devices, and network, into virtual end-to-end
testbeds tuned for each use-case. Our architecture, SimBricks, combines
well-defined component interfaces for extensibility and modularity, efficient
communication channels for local and distributed simulation, and a co-designed
efficient synchronization mechanism for accurate timing across simulators. We
demonstrate SimBricks scales to 1000 simulated hosts, each running a full
software stack including Linux, and that it can simulate testbeds with existing
NIC and switch RTL implementations. We also reproduce key findings from prior
work in congestion control, NIC architecture, and in-network computing in
SimBricks.
","[{'version': 'v1', 'created': 'Mon, 28 Dec 2020 13:03:04 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Oct 2021 11:57:05 GMT'}, {'version': 'v3', 'created': 'Wed, 6 Jul 2022 10:10:41 GMT'}]",2022-07-07,"[['Li', 'Hejing', ''], ['Li', 'Jialin', ''], ['Kaufmann', 'Antoine', '']]","['Modular Simulation', 'End-to-End Evaluation', 'Network Systems']"
6072,1909.02215,Baris Gecer,"Baris Gecer, Alexander Lattas, Stylianos Ploumpis, Jiankang Deng,
  Athanasios Papaioannou, Stylianos Moschoglou, Stefanos Zafeiriou","Synthesizing Coupled 3D Face Modalities by Trunk-Branch Generative
  Adversarial Networks","Check project page: https://github.com/barisgecer/TBGAN for the full
  resolution results and the accompanying video","In: European conference on computer vision. Springer, Cham, 2020.
  p. 415-433",10.1007/978-3-030-58526-6_25,,cs.CV cs.GR,http://creativecommons.org/licenses/by/4.0/,"  Generating realistic 3D faces is of high importance for computer graphics and
computer vision applications. Generally, research on 3D face generation
revolves around linear statistical models of the facial surface. Nevertheless,
these models cannot represent faithfully either the facial texture or the
normals of the face, which are very crucial for photo-realistic face synthesis.
Recently, it was demonstrated that Generative Adversarial Networks (GANs) can
be used for generating high-quality textures of faces. Nevertheless, the
generation process either omits the geometry and normals, or independent
processes are used to produce 3D shape information. In this paper, we present
the first methodology that generates high-quality texture, shape, and normals
jointly, which can be used for photo-realistic synthesis. To do so, we propose
a novel GAN that can generate data from different modalities while exploiting
their correlations. Furthermore, we demonstrate how we can condition the
generation on the expression and create faces with various facial expressions.
The qualitative results shown in this paper are compressed due to size
limitations, full-resolution results and the accompanying video can be found in
the supplementary documents. The code and models are available at the project
page: https://github.com/barisgecer/TBGAN.
","[{'version': 'v1', 'created': 'Thu, 5 Sep 2019 05:33:50 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Sep 2020 18:25:34 GMT'}, {'version': 'v3', 'created': 'Wed, 2 Dec 2020 01:12:57 GMT'}]",2022-03-28,"[['Gecer', 'Baris', ''], ['Lattas', 'Alexander', ''], ['Ploumpis', 'Stylianos', ''], ['Deng', 'Jiankang', ''], ['Papaioannou', 'Athanasios', ''], ['Moschoglou', 'Stylianos', ''], ['Zafeiriou', 'Stefanos', '']]","['Synthetic 3D Face', 'Face Generation', 'Generative Adversarial Networks', '3D Morphable Models', 'Facial Expression Generation']"
6073,1604.04736,Victor Sanchez-Anguix Dr.,"Victor Sanchez-Anguix, Reyhan Aydogan, Vicente Julian and Catholijn
  Jonker","Intra-Team Strategies for Teams Negotiating Against Competitor,
  Matchers, and Conceders","Novel Insights in Agent-based Complex Automated Negotiation, 2014",,10.1007/978-4-431-54758-7_1,,cs.MA cs.AI cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Under some circumstances, a group of individuals may need to negotiate
together as a negotiation team against another party. Unlike bilateral
negotiation between two individuals, this type of negotiations entails to adopt
an intra-team strategy for negotiation teams in order to make team decisions
and accordingly negotiate with the opponent. It is crucial to be able to
negotiate successfully with heterogeneous opponents since opponents'
negotiation strategy and behavior may vary in an open environment. While one
opponent might collaborate and concede over time, another may not be inclined
to concede. This paper analyzes the performance of recently proposed intra-team
strategies for negotiation teams against different categories of opponents:
competitors, matchers, and conceders. Furthermore, it provides an extension of
the negotiation tool Genius for negotiation teams in bilateral settings.
Consequently, this work facilitates research in negotiation teams.
","[{'version': 'v1', 'created': 'Sat, 16 Apr 2016 12:11:02 GMT'}]",2016-04-19,"[['Sanchez-Anguix', 'Victor', ''], ['Aydogan', 'Reyhan', ''], ['Julian', 'Vicente', ''], ['Jonker', 'Catholijn', '']]","['Negotiation Teams', 'Collective Decision Making', 'AgreementTechnologies']"
6074,2105.02703,Martin Obaidi,"Martin Obaidi, Jil Kl\""under","Development and Application of Sentiment Analysis Tools in Software
  Engineering: A Systematic Literature Review","10 pages, 1 figure",,10.1145/3463274.3463328,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software development is a collaborative task and, hence, involves different
persons. Research has shown the relevance of social aspects in the development
team for a successful and satisfying project closure. Especially the mood of a
team has been proven to be of particular importance. Thus, project managers or
project leaders want to be aware of situations in which negative mood is
present to allow for interventions. So-called sentiment analysis tools offer a
way to determine the mood based on text-based communication. In this paper, we
present the results of a systematic literature review of sentiment analysis
tools developed for or applied in the context of software engineering. Our
results summarize insights from 80 papers with respect to (1) the application
domain, (2) the purpose, (3) the used data sets, (4) the approaches for
developing sentiment analysis tools and (5) the difficulties researchers face
when applying sentiment analysis in the context of software projects. According
to our results, sentiment analysis is frequently applied to open-source
software projects, and most tools are based on support-vector machines. Despite
the frequent use of sentiment analysis in software engineering, there are open
issues, e.g., regarding the identification of irony or sarcasm, pointing to
future research directions.
","[{'version': 'v1', 'created': 'Thu, 6 May 2021 14:18:44 GMT'}]",2021-05-07,"[['Obaidi', 'Martin', ''], ['Klünder', 'Jil', '']]","['Social Software Engineering', 'Sentiment Analysis', 'Machine Learning', 'Systematic Literature Review']"
6075,2009.07015,Wishnu Prasetya,"I.S.W.B. Prasetya, Maurin Voshol, Tom Tanis, Adam Smits, Bram Smit,
  Jacco van Mourik, Menno Klunder, Frank Hoogmoed, Stijn Hinlopen, August van
  Casteren, Jesse van de Berg, Naraenda G.W.Y. Prasetya, Samira
  Shirzadehhajimahmood, Saba Gholizadeh Ansari",Navigation and Exploration in 3D-Game Automated Play Testing,,,10.1145/3412452.3423570,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To enable automated software testing, the ability to automatically navigate
to a state of interest and to explore all, or at least sufficient number of,
instances of such a state is fundamental. When testing a computer game the
problem has an extra dimension, namely the virtual world where the game is
played on. This world often plays a dominant role in constraining which logical
states are reachable, and how to reach them. So, any automated testing
algorithm for computer games will inevitably need a layer that deals with
navigation on a virtual world. Unlike e.g. navigating through the GUI of a
typical web-based application, navigating over a virtual world is much more
challenging. This paper discusses how concepts from geometry and graph-based
path finding can be applied in the context of game testing to solve the problem
of automated navigation and exploration. As a proof of concept, the paper also
briefly discusses the implementation of the proposed approach.
","[{'version': 'v1', 'created': 'Tue, 15 Sep 2020 12:33:28 GMT'}]",2020-09-16,"[['Prasetya', 'I. S. W. B.', ''], ['Voshol', 'Maurin', ''], ['Tanis', 'Tom', ''], ['Smits', 'Adam', ''], ['Smit', 'Bram', ''], ['van Mourik', 'Jacco', ''], ['Klunder', 'Menno', ''], ['Hoogmoed', 'Frank', ''], ['Hinlopen', 'Stijn', ''], ['van Casteren', 'August', ''], ['van de Berg', 'Jesse', ''], ['Prasetya', 'Naraenda G. W. Y.', ''], ['Shirzadehhajimahmood', 'Samira', ''], ['Ansari', 'Saba Gholizadeh', '']]","['automated game testing', 'automated play testing', 'agent-based testing']"
6076,1807.08284,Mitko Veta,"Mitko Veta, Yujing J. Heng, Nikolas Stathonikos, Babak Ehteshami
  Bejnordi, Francisco Beca, Thomas Wollmann, Karl Rohr, Manan A. Shah, Dayong
  Wang, Mikael Rousson, Martin Hedlund, David Tellez, Francesco Ciompi, Erwan
  Zerhouni, David Lanyi, Matheus Viana, Vassili Kovalev, Vitali Liauchuk, Hady
  Ahmady Phoulady, Talha Qaiser, Simon Graham, Nasir Rajpoot, Erik Sj\""oblom,
  Jesper Molin, Kyunghyun Paeng, Sangheum Hwang, Sunggyun Park, Zhipeng Jia,
  Eric I-Chao Chang, Yan Xu, Andrew H. Beck, Paul J. van Diest and Josien P. W.
  Pluim","Predicting breast tumor proliferation from whole-slide images: the
  TUPAC16 challenge",Overview paper of the TUPAC16 challenge: http://tupac.tue-image.nl/,,10.1016/j.media.2019.02.012,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tumor proliferation is an important biomarker indicative of the prognosis of
breast cancer patients. Assessment of tumor proliferation in a clinical setting
is highly subjective and labor-intensive task. Previous efforts to automate
tumor proliferation assessment by image analysis only focused on mitosis
detection in predefined tumor regions. However, in a real-world scenario,
automatic mitosis detection should be performed in whole-slide images (WSIs)
and an automatic method should be able to produce a tumor proliferation score
given a WSI as input. To address this, we organized the TUmor Proliferation
Assessment Challenge 2016 (TUPAC16) on prediction of tumor proliferation scores
from WSIs. The challenge dataset consisted of 500 training and 321 testing
breast cancer histopathology WSIs. In order to ensure fair and independent
evaluation, only the ground truth for the training dataset was provided to the
challenge participants. The first task of the challenge was to predict mitotic
scores, i.e., to reproduce the manual method of assessing tumor proliferation
by a pathologist. The second task was to predict the gene expression based
PAM50 proliferation scores from the WSI. The best performing automatic method
for the first task achieved a quadratic-weighted Cohen's kappa score of
$\kappa$ = 0.567, 95% CI [0.464, 0.671] between the predicted scores and the
ground truth. For the second task, the predictions of the top method had a
Spearman's correlation coefficient of r = 0.617, 95% CI [0.581 0.651] with the
ground truth. This was the first study that investigated tumor proliferation
assessment from WSIs. The achieved results are promising given the difficulty
of the tasks and weakly-labelled nature of the ground truth. However, further
research is needed to improve the practical utility of image analysis methods
for this task.
","[{'version': 'v1', 'created': 'Sun, 22 Jul 2018 13:46:03 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Mar 2019 15:39:03 GMT'}]",2019-04-01,"[['Veta', 'Mitko', ''], ['Heng', 'Yujing J.', ''], ['Stathonikos', 'Nikolas', ''], ['Bejnordi', 'Babak Ehteshami', ''], ['Beca', 'Francisco', ''], ['Wollmann', 'Thomas', ''], ['Rohr', 'Karl', ''], ['Shah', 'Manan A.', ''], ['Wang', 'Dayong', ''], ['Rousson', 'Mikael', ''], ['Hedlund', 'Martin', ''], ['Tellez', 'David', ''], ['Ciompi', 'Francesco', ''], ['Zerhouni', 'Erwan', ''], ['Lanyi', 'David', ''], ['Viana', 'Matheus', ''], ['Kovalev', 'Vassili', ''], ['Liauchuk', 'Vitali', ''], ['Phoulady', 'Hady Ahmady', ''], ['Qaiser', 'Talha', ''], ['Graham', 'Simon', ''], ['Rajpoot', 'Nasir', ''], ['Sjöblom', 'Erik', ''], ['Molin', 'Jesper', ''], ['Paeng', 'Kyunghyun', ''], ['Hwang', 'Sangheum', ''], ['Park', 'Sunggyun', ''], ['Jia', 'Zhipeng', ''], ['Chang', 'Eric I-Chao', ''], ['Xu', 'Yan', ''], ['Beck', 'Andrew H.', ''], ['van Diest', 'Paul J.', ''], ['Pluim', 'Josien P. W.', '']]","['breast cancer', 'cancer prognostication', 'tumor proliferation', 'deep learning']"
6077,2111.03550,Luis Miguel Contreras Murillo,"Luis M. Contreras, Jose A. Ordonez-Lucena","On Slice Isolation Options in the Transport Network and Associated
  Feasibility Indicators","5 pages, 2 tables, 1 figure, conference",,10.1109/NetSoft51509.2021.9492546,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Isolation is one of the more relevant attributes associated to the idea of
network slicing, introduced by 5G services. Through isolation it is expected
that slices from different customers could gracefully coexist without
interfering each other, in the sense that whatever misbehavior or unforeseen
demand from one slice customer could not affect the communication service
received by any other slice customer supported atop the same physical transport
infrastructure. This paper surveys and compare different technical approaches
that can be taken for providing distinct isolation levels in the transport
network, as a major component of end-to-end network slices. Furthermore, a
number of isolation feasibility indicators are defined and proposed. These
indicators are based on the approaches referred before, as a mean of guiding
orchestration decisions at the time of provisioning or reconfiguring the
transport slices in the network.
","[{'version': 'v1', 'created': 'Fri, 5 Nov 2021 15:14:54 GMT'}]",2021-11-08,"[['Contreras', 'Luis M.', ''], ['Ordonez-Lucena', 'Jose A.', '']]","['slicing', 'isolation', 'transport network', 'indicators']"
6078,2205.15285,Jiemin Fang,"Jiemin Fang, Taoran Yi, Xinggang Wang, Lingxi Xie, Xiaopeng Zhang,
  Wenyu Liu, Matthias Nie{\ss}ner, Qi Tian",Fast Dynamic Radiance Fields with Time-Aware Neural Voxels,SIGGRAPH Asia 2022. Project page: https://jaminfong.cn/tineuvox,,10.1145/3550469.3555383,,cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural radiance fields (NeRF) have shown great success in modeling 3D scenes
and synthesizing novel-view images. However, most previous NeRF methods take
much time to optimize one single scene. Explicit data structures, e.g. voxel
features, show great potential to accelerate the training process. However,
voxel features face two big challenges to be applied to dynamic scenes, i.e.
modeling temporal information and capturing different scales of point motions.
We propose a radiance field framework by representing scenes with time-aware
voxel features, named as TiNeuVox. A tiny coordinate deformation network is
introduced to model coarse motion trajectories and temporal information is
further enhanced in the radiance network. A multi-distance interpolation method
is proposed and applied on voxel features to model both small and large
motions. Our framework significantly accelerates the optimization of dynamic
radiance fields while maintaining high rendering quality. Empirical evaluation
is performed on both synthetic and real scenes. Our TiNeuVox completes training
with only 8 minutes and 8-MB storage cost while showing similar or even better
rendering performance than previous dynamic NeRF methods.
","[{'version': 'v1', 'created': 'Mon, 30 May 2022 17:47:31 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Sep 2022 09:04:53 GMT'}]",2022-09-27,"[['Fang', 'Jiemin', ''], ['Yi', 'Taoran', ''], ['Wang', 'Xinggang', ''], ['Xie', 'Lingxi', ''], ['Zhang', 'Xiaopeng', ''], ['Liu', 'Wenyu', ''], ['Nießner', 'Matthias', ''], ['Tian', 'Qi', '']]","['neural rendering', 'novel view synthesis', 'dynamic scenes', 'neuralvoxels', 'temporal information encoding']"
6079,2208.13707,Hui Zhou,"Hui Zhou, Ken Raffenetti, Yanfei Guo, and Rajeev Thakur",MPIX Stream: An Explicit Solution to Hybrid MPI+X Programming,"10 pages, EuroMPI/USA'22",,10.1145/3555819.3555820,,cs.DC cs.PF,http://creativecommons.org/licenses/by/4.0/,"  The hybrid MPI+X programming paradigm, where X refers to threads or GPUs, has
gained prominence in the high-performance computing arena. This corresponds to
a trend of system architectures growing more heterogeneous. The current MPI
standard only specifies the compatibility levels between MPI and threading
runtimes. No MPI concept or interface exists for applications to pass thread
context or GPU stream context to MPI implementations explicitly. This lack has
made performance optimization complicated in some cases and impossible in other
cases. We propose a new concept in MPI, called MPIX stream, to represent the
general serial execution context that exists in X runtimes. MPIX streams can be
directly mapped to threads or GPU execution streams. Passing thread context
into MPI allows implementations to precisely map the execution contexts to
network endpoints. Passing GPU execution context into MPI allows
implementations to directly operate on GPU streams, lowering the CPU/GPU
synchronization cost.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2022 16:36:03 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Aug 2022 02:15:43 GMT'}]",2022-08-31,"[['Zhou', 'Hui', ''], ['Raffenetti', 'Ken', ''], ['Guo', 'Yanfei', ''], ['Thakur', 'Rajeev', '']]","['MPI+X', 'MPI+Threads', 'MPI+GPUs', 'Network Endpoints', 'MPIX Stream', 'GPU Stream']"
6080,2211.08292,Jennifer Andreoli-Fang,"Jennifer Andreoli-Fang, John T Chapman",Mobile-Aware Scheduling for Low Latency Backhaul over DOCSIS,"IEEE International Symposium on Personal, Indoor and Mobile Radio
  Communications (PIMRC), 2017",,10.1109/PIMRC.2017.8292173,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we discuss latency reduction techniques for mobile backhaul
over Data Over Cable Service Interface Specifications (DOCSIS) networks. When
the latencies from both the wireless and the DOCSIS networks are added
together, it can result in noticeable end-to-end system latency, particularly
under network congestion. Previously, we proposed a method to improve upstream
user-to-mobile core latency by coordinating the LTE and DOCSIS scheduling. The
method reduces the impact on system latency from the DOCSIS network's
request-grant-data loop, which is the main contributor of backhaul upstream
latency. Since the method reduces latency on the DOCSIS data path, it will
therefore improve performance of latency sensitive applications, particularly
if TCP is used as the transport protocol, especially when the link is
congested. In this paper, we investigate the effect of HARQ failure on system
performance. Through simulation, we show that despite the uncertainty
introduced by the LTE protocol, coordinated scheduling improves overall system
latency.
","[{'version': 'v1', 'created': 'Tue, 15 Nov 2022 16:45:26 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Nov 2022 16:38:44 GMT'}]",2022-11-17,"[['Andreoli-Fang', 'Jennifer', ''], ['Chapman', 'John T', '']]","['backhaul', 'small cell', 'hybrid fiber coaxial', 'DOCSIS', 'latency', 'access network architecture', 'scheduler', 'pipelining']"
6081,2106.11610,Bo Wang,"Bo Wang, Teodora Baluta, Aashish Kolluri, Prateek Saxena",SynGuar: Guaranteeing Generalization in Programming by Example,,,10.1145/3468264.3468621,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Programming by Example (PBE) is a program synthesis paradigm in which the
synthesizer creates a program that matches a set of given examples. In many
applications of such synthesis (e.g., program repair or reverse engineering),
we are to reconstruct a program that is close to a specific target program, not
merely to produce some program that satisfies the seen examples. In such
settings, we wish that the synthesized program generalizes well, i.e., has as
few errors as possible on the unobserved examples capturing the target function
behavior. In this paper, we propose the first framework (called SynGuar) for
PBE synthesizers that guarantees to achieve low generalization error with high
probability. Our main contribution is a procedure to dynamically calculate how
many additional examples suffice to theoretically guarantee generalization. We
show how our techniques can be used in 2 well-known synthesis approaches: PROSE
and STUN (synthesis through unification), for common string-manipulation
program benchmarks. We find that often a few hundred examples suffice to
provably bound generalization error below $5\%$ with high ($\geq 98\%$)
probability on these benchmarks. Further, we confirm this empirically: SynGuar
significantly improves the accuracy of existing synthesizers in generating the
right target programs. But with fewer examples chosen arbitrarily, the same
baseline synthesizers (without SynGuar) overfit and lose accuracy.
","[{'version': 'v1', 'created': 'Tue, 22 Jun 2021 08:44:05 GMT'}]",2021-06-23,"[['Wang', 'Bo', ''], ['Baluta', 'Teodora', ''], ['Kolluri', 'Aashish', ''], ['Saxena', 'Prateek', '']]","['Program Synthesis', 'Generalization', 'Sample Complexity']"
6082,2201.08042,Ervin Dervishaj,Ervin Dervishaj and Paolo Cremonesi,GAN-based Matrix Factorization for Recommender Systems,"Accepted at the 37th ACM/SIGAPP Symposium on Applied Computing (SAC
  '22)",,10.1145/3477314.3507099,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Proposed in 2014, Generative Adversarial Networks (GAN) initiated a fresh
interest in generative modelling. They immediately achieved state-of-the-art in
image synthesis, image-to-image translation, text-to-image generation, image
inpainting and have been used in sciences ranging from medicine to high-energy
particle physics. Despite their popularity and ability to learn arbitrary
distributions, GAN have not been widely applied in recommender systems (RS).
Moreover, only few of the techniques that have introduced GAN in RS have
employed them directly as a collaborative filtering (CF) model. In this work we
propose a new GAN-based approach that learns user and item latent factors in a
matrix factorization setting for the generic top-N recommendation problem.
Following the vector-wise GAN training approach for RS introduced by CFGAN, we
identify 2 unique issues when utilizing GAN for CF. We propose solutions for
both of them by using an autoencoder as discriminator and incorporating an
additional loss function for the generator. We evaluate our model, GANMF,
through well-known datasets in the RS community and show improvements over
traditional CF approaches and GAN-based models. Through an ablation study on
the components of GANMF we aim to understand the effects of our architectural
choices. Finally, we provide a qualitative evaluation of the matrix
factorization performance of GANMF.
","[{'version': 'v1', 'created': 'Thu, 20 Jan 2022 08:14:29 GMT'}]",2022-01-21,"[['Dervishaj', 'Ervin', ''], ['Cremonesi', 'Paolo', '']]","['collaborative filtering', 'matrix factorization', 'generative adversarialnetworks', 'autoencoder', 'feature matching']"
6083,2205.10412,Mustafa Jarrar,"Eman Naser-Karajah, Nabil Arman, Mustafa Jarrar","Current Trends and Approaches in Synonyms Extraction: Potential
  Adaptation to Arabic",,"In Proceedings of the 11th Workshop on Semantic Evaluation
  (SemEval2021), 2021 International Conference on Information Technology
  (ICIT), 2021, pp. 428-434, IEEE",10.1109/ICIT52682.2021.9491713,,cs.CL cs.AI cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Extracting synonyms from dictionaries or corpora is gaining special attention
as synonyms play an important role in improving NLP application performance.
This paper presents a survey of the different approaches and trends used in
automatically extracting the synonyms. These approaches can be divided into
four main categories. The first approach is to find the Synonyms using a
translation graph. The second approach is to discover new transition pairs such
as (Arabic-English) (English-France) then (Arabic-France). The third approach
is to construct new WordNets by exploring synonymy graphs, and the fourth
approach is to find similar words from corpora using Deep Learning methods,
such as word embeddings and recently BERT models. The paper also presents a
comparative analysis between these approaches and highlights potential
adaptation to generate synonyms automatically in the Arabic language as future
work.
","[{'version': 'v1', 'created': 'Fri, 20 May 2022 19:05:10 GMT'}]",2022-05-24,"[['Naser-Karajah', 'Eman', ''], ['Arman', 'Nabil', ''], ['Jarrar', 'Mustafa', '']]","['Synonyms', 'Synonym Extraction', 'WordNet Synsets', 'Translation Graphs', 'Bilingual Dictionaries', 'NLP', 'Arabic']"
6084,1908.06672,Jianfeng Huang,"Lihua Yang, Anna Qi, Chao Huang, Jianfeng Huang",Graph Fourier Transform Based on $\ell_1$ Norm Variation Minimization,,,10.1016/j.acha.2020.04.001,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The definition of the graph Fourier transform is a fundamental issue in graph
signal processing. Conventional graph Fourier transform is defined through the
eigenvectors of the graph Laplacian matrix, which minimize the $\ell_2$ norm
signal variation. However, the computation of Laplacian eigenvectors is
expensive when the graph is large. In this paper, we propose an alternative
definition of graph Fourier transform based on the $\ell_1$ norm variation
minimization. We obtain a necessary condition satisfied by the $\ell_1$ Fourier
basis, and provide a fast greedy algorithm to approximate the $\ell_1$ Fourier
basis. Numerical experiments show the effectiveness of the greedy algorithm.
Moreover, the Fourier transform under the greedy basis demonstrates a similar
rate of decay to that of Laplacian basis for simulated or real signals.
","[{'version': 'v1', 'created': 'Mon, 19 Aug 2019 09:57:23 GMT'}]",2020-05-05,"[['Yang', 'Lihua', ''], ['Qi', 'Anna', ''], ['Huang', 'Chao', ''], ['Huang', 'Jianfeng', '']]","['graph signal processing', 'graph Fourier transform', 'signal variation', 'ℓ1 norm']"
6085,1905.06124,Igor Ivkic,"Igor Ivkic, Andreas Mauthe, Markus Tauber",Towards a Security Cost Model for Cyber-Physical Systems,,"2019 16th IEEE Annual Consumer Communications & Networking
  Conference (CCNC), Las Vegas, USA",10.1109/CCNC.2019.8651751,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In times of Industry 4.0 and cyber-physical systems (CPS) providing security
is one of the biggest challenges. A cyber attack launched at a CPS poses a huge
threat, since a security incident may affect both the cyber and the physical
world. Since CPS are very flexible systems, which are capable of adapting to
environmental changes, it is important to keep an overview of the resulting
costs of providing security. However, research regarding CPS currently focuses
more on engineering secure systems and does not satisfactorily provide
approaches for evaluating the resulting costs. This paper presents an
interaction-based model for evaluating security costs in a CPS. Furthermore,
the paper demonstrates in a use case driven study, how this approach could be
used to model the resulting costs for guaranteeing security.
","[{'version': 'v1', 'created': 'Wed, 15 May 2019 12:19:48 GMT'}]",2019-05-16,"[['Ivkic', 'Igor', ''], ['Mauthe', 'Andreas', ''], ['Tauber', 'Markus', '']]","['cyber-physical systems', 'onion layer model', 'cost ofsecurity']"
6086,2002.04491,Thibaut Verron,"Xavier Caruso (LFANT), Tristan Vaccon (XLIM-MATHIS), Thibaut Verron
  (JKU)","Signature-based algorithms for Gr{\""o}bner bases over Tate algebras","ISSAC 2021 - International Symposium on Symbolic and Algebraic
  Computation, Jul 2020, Kalamata / Virtual, Greece",,10.1145/3373207.3404035,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Introduced by Tate in [Ta71], Tate algebras play a major role in the context
of analytic geometry over the-adics, where they act as a counterpart to the use
of polynomial algebras in classical algebraic geometry. In [CVV19] the
formalism of Gr{\""o}bner bases over Tate algebras has been introduced and
effectively implemented. One of the bottleneck in the algorithms was the time
spent on reduction , which are significantly costlier than over polynomials. In
the present article, we introduce two signature-based Gr{\""o}bner bases
algorithms for Tate algebras, in order to avoid many reductions. They have been
implemented in SageMath. We discuss their superiority based on numerical
evidences.
","[{'version': 'v1', 'created': 'Tue, 11 Feb 2020 15:47:40 GMT'}, {'version': 'v2', 'created': 'Mon, 10 May 2021 09:43:01 GMT'}]",2021-05-11,"[['Caruso', 'Xavier', '', 'LFANT'], ['Vaccon', 'Tristan', '', 'XLIM-MATHIS'], ['Verron', 'Thibaut', '', 'JKU']]","['Algorithms', 'Power series', 'Tate algebra', 'Gröbner bases', 'F5 algorithm', '푝-adic precision']"
6087,2010.08062,Przemyslaw Musialski,"Stefan Pillwein, Johanna K\""ubert, Florian Rist, Przemyslaw Musialski",Design and Fabrication of Elastic Geodesic Grid Structures,"11 pages, 15 figures",,10.1145/3424630.3425412,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Elastic geodesic grids (EGG) are lightweight structures that can be easily
deployed to approximate designer provided free-form surfaces. In the initial
configuration the grids are perfectly flat, during deployment, though,
curvature is induced to the structure, as grid elements bend and twist. Their
layout is found geometrically, it is based on networks of geodesic curves on
free-form design-surfaces. Generating a layout with this approach encodes an
elasto-kinematic mechanism to the grid that creates the curved shape during
deployment. In the final state the grid can be fixed to supports and serve for
all kinds of purposes like free-form sub-structures, paneling, sun and rain
protectors, pavilions, etc. However, so far these structures have only been
investigated using small-scale desktop models. We investigate the scalability
of such structures, presenting a medium sized model. It was designed by an
architecture student without expert knowledge on elastic structures or
differential geometry, just using the elastic geodesic grids design-pipeline.
We further present a fabrication-process for EGG-models. They can be built
quickly and with a small budget.
","[{'version': 'v1', 'created': 'Thu, 15 Oct 2020 23:10:08 GMT'}]",2020-10-23,"[['Pillwein', 'Stefan', ''], ['Kübert', 'Johanna', ''], ['Rist', 'Florian', ''], ['Musialski', 'Przemyslaw', '']]","['fabrication', 'deployable structures', 'elastic gridshells', 'geometric modeling', 'elastic deformation', 'architectural geometry']"
6088,1710.02312,Thomas Strasser,"Thomas I. Strasser, Cyndi Moyo, Roland Br\""undlinger, Sebastian
  Lehnhoff, Marita Blank, Peter Palensky, Arjen A. van der Meer, Kai Heussen,
  Oliver Gehrke, J. Emilio Rodriguez, Julia Merino, Carlo Sandroni, Maurizio
  Verga, Mihai Calin, Ata Khavari, Maria Sosnina, Erik de Jong, Sebastian
  Rohjans, Anna Kulmala, Kari M\""aki, Ron Brandl, Federico Coffele, Graeme M.
  Burt, Panos Kotsampopoulos, Nikos Hatziargyriou","An Integrated Research Infrastructure for Validating Cyber-Physical
  Energy Systems","8th International Conference on Industrial Applications of Holonic
  and Multi-Agent Systems (HoloMAS 2017)",,10.1007/978-3-319-64635-0_12,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Renewables are key enablers in the plight to reduce greenhouse gas emissions
and cope with anthropogenic global warming. The intermittent nature and limited
storage capabilities of renewables culminate in new challenges that power
system operators have to deal with in order to regulate power quality and
ensure security of supply. At the same time, the increased availability of
advanced automation and communication technologies provides new opportunities
for the derivation of intelligent solutions to tackle the challenges. Previous
work has shown various new methods of operating highly interconnected power
grids, and their corresponding components, in a more effective way. As a
consequence of these developments, the traditional power system is being
transformed into a cyber-physical energy system, a smart grid. Previous and
ongoing research have tended to mainly focus on how specific aspects of smart
grids can be validated, but until there exists no integrated approach for the
analysis and evaluation of complex cyber-physical systems configurations. This
paper introduces integrated research infrastructure that provides methods and
tools for validating smart grid systems in a holistic, cyber-physical manner.
The corresponding concepts are currently being developed further in the
European project ERIGrid.
","[{'version': 'v1', 'created': 'Fri, 6 Oct 2017 08:55:09 GMT'}]",2017-10-09,"[['Strasser', 'Thomas I.', ''], ['Moyo', 'Cyndi', ''], ['Bründlinger', 'Roland', ''], ['Lehnhoff', 'Sebastian', ''], ['Blank', 'Marita', ''], ['Palensky', 'Peter', ''], ['van der Meer', 'Arjen A.', ''], ['Heussen', 'Kai', ''], ['Gehrke', 'Oliver', ''], ['Rodriguez', 'J. Emilio', ''], ['Merino', 'Julia', ''], ['Sandroni', 'Carlo', ''], ['Verga', 'Maurizio', ''], ['Calin', 'Mihai', ''], ['Khavari', 'Ata', ''], ['Sosnina', 'Maria', ''], ['de Jong', 'Erik', ''], ['Rohjans', 'Sebastian', ''], ['Kulmala', 'Anna', ''], ['Mäki', 'Kari', ''], ['Brandl', 'Ron', ''], ['Coffele', 'Federico', ''], ['Burt', 'Graeme M.', ''], ['Kotsampopoulos', 'Panos', ''], ['Hatziargyriou', 'Nikos', '']]","['Cyber-Physical Energy Systems', 'Research Infrastructure', 'Smart Grids', 'Testing', 'Validation']"
6089,2112.02757,Poornima Mahadevappa,Poornima Mahadevappa and Raja Kumar Murugesan,"Review of Data Integrity Attacks and Mitigation Methods in Edge
  computing",,,10.1007/978-981-16-8059-5_31,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, edge computing has emerged as a promising technology due to
its unique feature of real-time computing and parallel processing. They provide
computing and storage capacity closer to the data source and bypass the distant
links to the cloud. The edge data analytics process the ubiquitous data on the
edge layer to offer real-time interactions for the application. However, this
process can be prone to security threats like gaining malicious access or
manipulating sensitive data. This can lead to the intruder's control, alter, or
add erroneous data affecting the integrity and data analysis efficiency. Due to
the lack of transparency of stakeholders processing edge data, it is
challenging to identify the vulnerabilities. Many reviews are available on data
security issues on the edge layer; however, they do not address integrity
issues exclusively. Therefore, this paper concentrates only on data integrity
threats that directly influence edge data analysis. Further shortcomings in
existing work are identified with few research directions.
","[{'version': 'v1', 'created': 'Mon, 6 Dec 2021 03:17:23 GMT'}]",2021-12-07,"[['Mahadevappa', 'Poornima', ''], ['Murugesan', 'Raja Kumar', '']]","['Data Integrity', 'Data Security', 'Edge computing', 'Edge Data Analytics']"
6090,2109.12443,Florian Suri-Payer,"Florian Suri-Payer, Matthew Burke, Zheng Wang, Yunhao Zhang, Lorenzo
  Alvisi, Natacha Crooks",Basil: Breaking up BFT with ACID (transactions),24 pages. 7 Figures. To be published at SOSP'21,,10.1145/3477132.3483552,,cs.DC cs.CR cs.DB,http://creativecommons.org/licenses/by/4.0/,"  This paper presents Basil, the first transactional, leaderless Byzantine
Fault Tolerant key-value store. Basil leverages ACID transactions to scalably
implement the abstraction of a trusted shared log in the presence of Byzantine
actors. Unlike traditional BFT approaches, Basil executes non-conflicting
operations in parallel and commits transactions in a single round-trip during
fault-free executions. Basil improves throughput over traditional BFT systems
by four to five times, and is only four times slower than TAPIR, a
non-Byzantine replicated system. Basil's novel recovery mechanism further
minimizes the impact of failures: with 30% Byzantine clients, throughput drops
by less than 25% in the worst-case.
","[{'version': 'v1', 'created': 'Sat, 25 Sep 2021 21:53:06 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Oct 2021 15:00:48 GMT'}]",2021-10-06,"[['Suri-Payer', 'Florian', ''], ['Burke', 'Matthew', ''], ['Wang', 'Zheng', ''], ['Zhang', 'Yunhao', ''], ['Alvisi', 'Lorenzo', ''], ['Crooks', 'Natacha', '']]","['database systems', 'Byzantine fault tolerance', 'blockchains', 'distributed systems']"
6091,2108.07052,Gordon Fraser,"Luisa Greifenstein, Florian Oberm\""uller, Ewald Wasmeier, Ute Heuer,
  Gordon Fraser","Effects of Hints on Debugging Scratch Programs: An Empirical Study with
  Primary School Teachers in Training","To be published in the proceedings of the 16th Workshop in Primary
  and Secondary Computing Education (WIPSCE)",,10.1145/3481312.3481344,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bugs in learners' programs are often the result of fundamental
misconceptions. Teachers frequently face the challenge of first having to
understand such bugs, and then suggest ways to fix them. In order to enable
teachers to do so effectively and efficiently, it is desirable to support them
in recognising and fixing bugs. Misconceptions often lead to recurring patterns
of similar bugs, enabling automated tools to provide this support in terms of
hints on occurrences of common bug patterns. In this paper, we investigate to
what extent the hints improve the effectiveness and efficiency of teachers in
debugging learners' programs using a cohort of 163 primary school teachers in
training, tasked to correct buggy Scratch programs, with and without hints on
bug patterns. Our experiment suggests that automatically generated hints can
reduce the effort of finding and fixing bugs from 8.66 to 5.24 minutes, while
increasing the effectiveness by 34% more correct solutions. While this
improvement is convincing, arguably teachers in training might first need to
learn debugging ""the hard way"" to not miss the opportunity to learn by relying
on tools. We therefore investigate whether the use of hints during training
affects their ability to recognise and fix bugs without hints. Our experiment
provides no significant evidence that either learning to debug with hints or
learning to debug ""the hard way"" leads to better learning effects. Overall,
this suggests that bug patterns might be a useful concept to include in the
curriculum for teachers in training, while tool-support to recognise these
patterns is desirable for teachers in practice.
","[{'version': 'v1', 'created': 'Mon, 16 Aug 2021 12:43:38 GMT'}]",2021-08-17,"[['Greifenstein', 'Luisa', ''], ['Obermüller', 'Florian', ''], ['Wasmeier', 'Ewald', ''], ['Heuer', 'Ute', ''], ['Fraser', 'Gordon', '']]","['Scratch', 'Block-based programming', 'Bug patterns', 'Hints', 'Teachers']"
6092,2107.12142,Americo Cunha Jr,"Americo Cunha Jr, Jorge Luis Palacios Felix, Jos\'e Manoel Balthazar","Quantification of parametric uncertainties induced by irregular soil
  loading in orchard tower sprayer nonlinear dynamics",,"Journal of Sound and Vibration, vol. 408, pp. 252-269, 2017",10.1016/j.jsv.2017.07.023,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with the nonlinear stochastic dynamics of an orchard tower
sprayer subjected to random excitations due to soil irregularities. A
consistent stochastic model of uncertainties is constructed to describe random
loadings and to predict variabilities in mechanical system response. The
dynamics is addressed in time and frequency domains. Monte Carlo method is
employed to compute the propagation of uncertainties through the stochastic
model. Numerical simulations reveals a very rich dynamics, which is able to
produce chaos. This numerical study also indicates that lateral vibrations
follow a direct energy cascade law. A probabilistic analysis reveals the
possibility of large lateral vibrations during the equipment operation.
","[{'version': 'v1', 'created': 'Wed, 14 Jul 2021 05:26:38 GMT'}]",2021-07-27,"[['Cunha', 'Americo', 'Jr'], ['Felix', 'Jorge Luis Palacios', ''], ['Balthazar', 'José Manoel', '']]","['orchard tower sprayer', 'nonlinear dynamics', 'uncertaintyquantification', 'parametric probabilistic approach', 'Karhunen-Lo`evedecomposition']"
6093,1909.07252,Milad Ganjalizadeh,"Milad Ganjalizadeh, Piergiuseppe Di Marco, Jonas Kronander, Joachim
  Sachs, and Marina Petrova","Impact of Correlated Failures in 5G Dual Connectivity Architectures for
  URLLC Applications",Accepted in 2019 IEEE Globecom Workshops (GC Wkshps),,10.1109/GCWkshps45667.2019.9024415,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Achieving end-to-end ultra-reliability and resiliency in mission critical
communications is a major challenge for future wireless networks. Dual
connectivity has been proposed by 3GPP as one of the viable solutions to
fulfill the reliability requirements. However, the potential correlation in
failures occurring over different wireless links is commonly neglected in
current network design approaches. In this paper, we investigate the impact of
realistic correlation among different wireless links on end-to-end reliability
for two selected architectures from 3GPP. In ultra-reliable use-cases, we show
that even small values of correlation can increase the end-to-end error rate by
orders of magnitude. This may suggest alternative feasible architecture designs
and paves the way towards serving ultra-reliable communications in 5G networks.
","[{'version': 'v1', 'created': 'Mon, 16 Sep 2019 14:57:30 GMT'}]",2020-05-20,"[['Ganjalizadeh', 'Milad', ''], ['Di Marco', 'Piergiuseppe', ''], ['Kronander', 'Jonas', ''], ['Sachs', 'Joachim', ''], ['Petrova', 'Marina', '']]","['Correlation', 'reliability', 'dual connectivity', 'packet duplication', 'shadow fading', 'URLLC', '5G']"
6094,2002.06206,Keiji Onishi,Keiji Onishi and Makoto Tsubokura,"Topology-free immersed boundary method for incompressible turbulence
  flows: An aerodynamic simulation for 'dirty' CAD geometry","33 pages, 23 figures",,10.1016/j.cma.2021.113734,,cs.CE physics.comp-ph physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To design a method to solve the issues of handling 'dirty' and highly complex
geometries, the topology-free method combined with the immersed boundary method
is presented for viscous and incompressible flows at a high Reynolds number.
The method simultaneously employs a ghost-cell technique and distributed
forcing technique to impose the boundary conditions. An axis-projected
interpolation scheme is used to avoid searching failures during fluid and solid
identification. This method yields a topology-free immersed boundary, which
particularly suits flow simulations of highly complex geometries. Difficulties
generally arise when generating the calculation grid for these scenarios. This
method allows dirty data to be handled without any preparatory treatment work
to simplify or clean-up the geometry. This method is also applicable to the
coherent structural turbulence model employed in this study. The verification
cases, used in conjunction with the second-order central-difference scheme,
resulted in first-order accuracy at finer resolution, although the coarser
resolution retained second-order accuracy. This method is fully parallelized
for distributed memory platforms. In this study, the accuracy and fidelity of
this method were examined by simulating the flow around the bluff body, past a
flat plate, and past dirty spheres. These simulations were compared with
experimental data and other established results. Finally, results from the
simulation of practical applications demonstrate the ability of the method to
model highly complex, non-canonical three-dimensional flows. The countermeasure
based on the accurate classification of geometric features has provided a
robust and reasonable solution.
","[{'version': 'v1', 'created': 'Sat, 15 Feb 2020 08:30:35 GMT'}]",2022-06-06,"[['Onishi', 'Keiji', ''], ['Tsubokura', 'Makoto', '']]","['Computational fluid dynamics', 'Immersed boundary method', 'Dirty geometry', 'Preprocessing', 'Vehicle aerodynamics', 'Turbulence']"
6095,1410.4011,EPTCS,"Amir M. Ben-Amram, Aviad Pineles","Flowchart Programs, Regular Expressions, and Decidability of Polynomial
  Growth-Rate","In Proceedings VPT 2016, arXiv:1607.01835","EPTCS 216, 2016, pp. 24-49",10.4204/EPTCS.216.2,,cs.PL cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new method for inferring complexity properties for a class of
programs in the form of flowcharts annotated with loop information.
Specifically, our method can (soundly and completely) decide if computed values
are polynomially bounded as a function of the input; and similarly for the
running time. Such complexity properties are undecidable for a Turing-complete
programming language, and a common work-around in program analysis is to settle
for sound but incomplete solutions. In contrast, we consider a class of
programs that is Turing-incomplete, but strong enough to include several
challenges for this kind of analysis. For a related language that has
well-structured syntax, similar to Meyer and Ritchie's LOOP programs, the
problem has been previously proved to be decidable. The analysis relied on the
compositionality of programs, hence the challenge in obtaining similar results
for flowchart programs with arbitrary control-flow graphs. Our answer to the
challenge is twofold: first, we propose a class of loop-annotated flowcharts,
which is more general than the class of flowcharts that directly represent
structured programs; secondly, we present a technique to reuse the ideas from
the work on tructured programs and apply them to such flowcharts. The technique
is inspired by the classic translation of non-deterministic automata to regular
expressions, but we obviate the exponential cost of constructing such an
expression, obtaining a polynomial-time analysis. These ideas may well be
applicable to other analysis problems.
","[{'version': 'v1', 'created': 'Wed, 15 Oct 2014 11:16:16 GMT'}, {'version': 'v2', 'created': 'Sun, 13 Mar 2016 14:40:47 GMT'}, {'version': 'v3', 'created': 'Sun, 20 Mar 2016 10:01:27 GMT'}, {'version': 'v4', 'created': 'Wed, 1 Jun 2016 16:30:18 GMT'}, {'version': 'v5', 'created': 'Fri, 8 Jul 2016 05:30:33 GMT'}]",2016-07-11,"[['Ben-Amram', 'Amir M.', ''], ['Pineles', 'Aviad', '']]","['polynomial time complexity', 'cost analysis', 'program transformation']"
6096,2205.13740,Christina Lu,"Christina Lu, Jackie Kay, Kevin R. McKee","Subverting machines, fluctuating identities: Re-learning human
  categorization","In Proceedings of the 2022 ACM Conference on Fairness,
  Accountability, and Transparency (FAccT '22), June 21-24, 2022, Seoul,
  Republic of Korea. First two authors contributed equally to this work",,10.1145/3531146.3533161,,cs.LG cs.AI cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Most machine learning systems that interact with humans construct some notion
of a person's ""identity,"" yet the default paradigm in AI research envisions
identity with essential attributes that are discrete and static. In stark
contrast, strands of thought within critical theory present a conception of
identity as malleable and constructed entirely through interaction; a doing
rather than a being. In this work, we distill some of these ideas for machine
learning practitioners and introduce a theory of identity as autopoiesis,
circular processes of formation and function. We argue that the default
paradigm of identity used by the field immobilizes existing identity categories
and the power differentials that co$\unicode{x2010}$occur, due to the absence
of iterative feedback to our models. This includes a critique of emergent AI
fairness practices that continue to impose the default paradigm. Finally, we
apply our theory to sketch approaches to autopoietic identity through
multilevel optimization and relational learning. While these ideas raise many
open questions, we imagine the possibilities of machines that are capable of
expressing human identity as a relationship perpetually in flux.
","[{'version': 'v1', 'created': 'Fri, 27 May 2022 03:09:25 GMT'}]",2022-05-30,"[['Lu', 'Christina', ''], ['Kay', 'Jackie', ''], ['McKee', 'Kevin R.', '']]","['algorithmic fairness', 'theories of identity', 'social construction', 'identity systems']"
6097,2107.12146,Jian-Xun Wang,Han Gao and Matthew J. Zahr and Jian-Xun Wang,"Physics-informed graph neural Galerkin networks: A unified framework for
  solving PDE-governed forward and inverse problems","27 pages, 10 figures",,10.1016/j.cma.2021.114502,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  Despite the great promise of the physics-informed neural networks (PINNs) in
solving forward and inverse problems, several technical challenges are present
as roadblocks for more complex and realistic applications. First, most existing
PINNs are based on point-wise formulation with fully-connected networks to
learn continuous functions, which suffer from poor scalability and hard
boundary enforcement. Second, the infinite search space over-complicates the
non-convex optimization for network training. Third, although the convolutional
neural network (CNN)-based discrete learning can significantly improve training
efficiency, CNNs struggle to handle irregular geometries with unstructured
meshes. To properly address these challenges, we present a novel discrete PINN
framework based on graph convolutional network (GCN) and variational structure
of PDE to solve forward and inverse partial differential equations (PDEs) in a
unified manner. The use of a piecewise polynomial basis can reduce the
dimension of search space and facilitate training and convergence. Without the
need of tuning penalty parameters in classic PINNs, the proposed method can
strictly impose boundary conditions and assimilate sparse data in both forward
and inverse settings. The flexibility of GCNs is leveraged for irregular
geometries with unstructured meshes. The effectiveness and merit of the
proposed method are demonstrated over a variety of forward and inverse
computational mechanics problems governed by both linear and nonlinear PDEs.
","[{'version': 'v1', 'created': 'Fri, 16 Jul 2021 20:23:52 GMT'}]",2022-01-26,"[['Gao', 'Han', ''], ['Zahr', 'Matthew J.', ''], ['Wang', 'Jian-Xun', '']]","['Partial differential equations', 'Inverse problem', 'Physics-informed machine']"
6098,2203.15044,Dilrukshi Gamage,"Dilrukshi Gamage, Piyush Ghasiya, Vamshi Krishna Bonagiri, Mark E
  Whiting, Kazutoshi Sasahara","Are Deepfakes Concerning? Analyzing Conversations of Deepfakes on Reddit
  and Exploring Societal Implications","19pgs, CHI22: CHI Conference on Human Factors in Computing Systems
  April 29-May 5, 2022 New Orleans, LA, USA",,10.1145/3491102.3517446,,cs.HC cs.SI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Deepfakes are synthetic content generated using advanced deep learning and AI
technologies. The advancement of technology has created opportunities for
anyone to create and share deepfakes much easier. This may lead to societal
concerns based on how communities engage with it. However, there is limited
research available to understand how communities perceive deepfakes. We
examined deepfake conversations on Reddit from 2018 to 2021 -- including major
topics and their temporal changes as well as implications of these
conversations. Using a mixed-method approach -- topic modeling and qualitative
coding, we found 6,638 posts and 86,425 comments discussing concerns of the
believable nature of deepfakes and how platforms moderate them. We also found
Reddit conversations to be pro-deepfake and building a community that supports
creating and sharing deepfake artifacts and building a marketplace regardless
of the consequences. Possible implications derived from qualitative codes
indicate that deepfake conversations raise societal concerns. We propose that
there are implications for Human Computer Interaction (HCI) to mitigate the
harm created from deepfakes.
","[{'version': 'v1', 'created': 'Mon, 14 Mar 2022 09:36:17 GMT'}]",2022-03-30,"[['Gamage', 'Dilrukshi', ''], ['Ghasiya', 'Piyush', ''], ['Bonagiri', 'Vamshi Krishna', ''], ['Whiting', 'Mark E', ''], ['Sasahara', 'Kazutoshi', '']]","['deepfake', 'societal implication', 'content analysis', 'topic modeling']"
6099,2204.09397,Loris Giulivi,"Loris Giulivi, Malhar Jere, Loris Rossi, Farinaz Koushanfar, Gabriela
  Ciocarlie, Briland Hitaj, Giacomo Boracchi",Adversarial Scratches: Deployable Attacks to CNN Classifiers,"This work is published at Pattern Recognition (Elsevier). This paper
  stems from 'Scratch that! An Evolution-based Adversarial Attack against
  Neural Networks' for which an arXiv preprint is available at
  arXiv:1912.02316. Further studies led to a complete overhaul of the work,
  resulting in this paper",,10.1016/j.patcog.2022.108985,,cs.LG cs.CR cs.CV,http://creativecommons.org/licenses/by-sa/4.0/,"  A growing body of work has shown that deep neural networks are susceptible to
adversarial examples. These take the form of small perturbations applied to the
model's input which lead to incorrect predictions. Unfortunately, most
literature focuses on visually imperceivable perturbations to be applied to
digital images that often are, by design, impossible to be deployed to physical
targets. We present Adversarial Scratches: a novel L0 black-box attack, which
takes the form of scratches in images, and which possesses much greater
deployability than other state-of-the-art attacks. Adversarial Scratches
leverage B\'ezier Curves to reduce the dimension of the search space and
possibly constrain the attack to a specific location. We test Adversarial
Scratches in several scenarios, including a publicly available API and images
of traffic signs. Results show that, often, our attack achieves higher fooling
rate than other deployable state-of-the-art methods, while requiring
significantly fewer queries and modifying very few pixels.
","[{'version': 'v1', 'created': 'Wed, 20 Apr 2022 11:42:24 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Aug 2022 08:22:01 GMT'}]",2022-08-31,"[['Giulivi', 'Loris', ''], ['Jere', 'Malhar', ''], ['Rossi', 'Loris', ''], ['Koushanfar', 'Farinaz', ''], ['Ciocarlie', 'Gabriela', ''], ['Hitaj', 'Briland', ''], ['Boracchi', 'Giacomo', '']]","['Adversarial Perturbations', 'Adversarial Attacks', 'Deep Learning', 'Convolutional NeuralNetworks', 'B´ezier Curves']"
6100,2112.00190,Zeyneb Kurt Dr.,"Zoe Moorton, Zeyneb Kurt, Wai Lok Woo","Is the use of Deep Learning and Artificial Intelligence an appropriate
  means to locate debris in the ocean without harming aquatic wildlife?","reference list is added/updated; sorry for causing any
  inconveniences. 3681 words, 14 pages",,10.1016/j.marpolbul.2022.113853,,cs.LG cs.CV eess.IV,http://creativecommons.org/licenses/by/4.0/,"  With the global issue of plastic debris ever expanding, it is about time that
the technology industry stepped in. This study aims to assess whether deep
learning can successfully distinguish between marine life and man-made debris
underwater. The aim is to find if we are safely able to clean up our oceans
with Artificial Intelligence without disrupting the delicate balance of the
aquatic ecosystems. The research explores the use of Convolutional Neural
Networks from the perspective of protecting the ecosystem, rather than
primarily collecting rubbish. We did this by building a custom-built, deep
learning model, with an original database including 1,644 underwater images and
used a binary classification to sort synthesised material from aquatic life. We
concluded that although it is possible to safely distinguish between debris and
life, further exploration with a larger database and stronger CNN structure has
the potential for much more promising results.
","[{'version': 'v1', 'created': 'Wed, 1 Dec 2021 00:12:04 GMT'}]",2022-12-14,"[['Moorton', 'Zoe', ''], ['Kurt', 'Zeyneb', ''], ['Woo', 'Wai Lok', '']]","['deep learning', 'artificial intelligence', 'neural networks', 'ocean pollution', 'marine debris']"
6101,1903.04552,Nilaksh Das,"Nilaksh Das, Sanya Chaba, Renzhi Wu, Sakshi Gandhi, Duen Horng Chau,
  Xu Chu",GOGGLES: Automatic Image Labeling with Affinity Coding,"Published at 2020 ACM SIGMOD International Conference on Management
  of Data",,10.1145/3318464.3380592,,cs.CV cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generating large labeled training data is becoming the biggest bottleneck in
building and deploying supervised machine learning models. Recently, the data
programming paradigm has been proposed to reduce the human cost in labeling
training data. However, data programming relies on designing labeling functions
which still requires significant domain expertise. Also, it is prohibitively
difficult to write labeling functions for image datasets as it is hard to
express domain knowledge using raw features for images (pixels).
  We propose affinity coding, a new domain-agnostic paradigm for automated
training data labeling. The core premise of affinity coding is that the
affinity scores of instance pairs belonging to the same class on average should
be higher than those of pairs belonging to different classes, according to some
affinity functions. We build the GOGGLES system that implements affinity coding
for labeling image datasets by designing a novel set of reusable affinity
functions for images, and propose a novel hierarchical generative model for
class inference using a small development set.
  We compare GOGGLES with existing data programming systems on 5 image labeling
tasks from diverse domains. GOGGLES achieves labeling accuracies ranging from a
minimum of 71% to a maximum of 98% without requiring any extensive human
annotation. In terms of end-to-end performance, GOGGLES outperforms the
state-of-the-art data programming system Snuba by 21% and a state-of-the-art
few-shot learning technique by 5%, and is only 7% away from the fully
supervised upper bound.
","[{'version': 'v1', 'created': 'Mon, 11 Mar 2019 19:19:30 GMT'}, {'version': 'v2', 'created': 'Sun, 1 Mar 2020 02:43:24 GMT'}, {'version': 'v3', 'created': 'Tue, 3 Mar 2020 06:30:24 GMT'}]",2020-03-04,"[['Das', 'Nilaksh', ''], ['Chaba', 'Sanya', ''], ['Wu', 'Renzhi', ''], ['Gandhi', 'Sakshi', ''], ['Chau', 'Duen Horng', ''], ['Chu', 'Xu', '']]","['affinity coding', 'probabilistic labels', 'data programming', 'weaksupervision', 'computer vision', 'image labeling']"
6102,2101.12284,Prasanth Murali,"Prasanth Murali, Javier Hernandez, Daniel McDuff, Kael Rowan, Jina
  Suh, Mary Czerwinski","AffectiveSpotlight: Facilitating the Communication of Affective
  Responses from Audience Members during Online Presentations",,,10.1145/3411764.3445235,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ability to monitor audience reactions is critical when delivering
presentations. However, current videoconferencing platforms offer limited
solutions to support this. This work leverages recent advances in affect
sensing to capture and facilitate communication of relevant audience signals.
Using an exploratory survey (N = 175), we assessed the most relevant audience
responses such as confusion, engagement, and head-nods. We then implemented
AffectiveSpotlight, a Microsoft Teams bot that analyzes facial responses and
head gestures of audience members and dynamically spotlights the most
expressive ones. In a within-subjects study with 14 groups (N = 117), we
observed that the system made presenters significantly more aware of their
audience, speak for a longer period of time, and self-assess the quality of
their talk more similarly to the audience members, compared to two control
conditions (randomly-selected spotlight and default platform UI). We provide
design recommendations for future affective interfaces for online presentations
based on feedback from the study.
","[{'version': 'v1', 'created': 'Thu, 28 Jan 2021 21:18:57 GMT'}]",2021-02-01,"[['Murali', 'Prasanth', ''], ['Hernandez', 'Javier', ''], ['McDuff', 'Daniel', ''], ['Rowan', 'Kael', ''], ['Suh', 'Jina', ''], ['Czerwinski', 'Mary', '']]","['Affective Computing', 'Public Speaking', 'Intelligent User Interfaces', 'Videoconferencing']"
6103,1712.01718,Ronny Tschueter,"Ronny Tsch\""uter, Johannes Ziegenbalg, Bert Wesarg, Matthias Weber,
  Christian Herold, Sebastian D\""obel, Ronny Brendel",An LLVM Instrumentation Plug-in for Score-P,8 pages,"LLVM-HPC'17: Proceedings of the Fourth Workshop on the LLVM
  Compiler Infrastructure in HPC, 2017, 2:1--2:8",10.1145/3148173.3148187,,cs.SE cs.PF cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reducing application runtime, scaling parallel applications to higher numbers
of processes/threads, and porting applications to new hardware architectures
are tasks necessary in the software development process. Therefore, developers
have to investigate and understand application runtime behavior. Tools such as
monitoring infrastructures that capture performance relevant data during
application execution assist in this task. The measured data forms the basis
for identifying bottlenecks and optimizing the code. Monitoring infrastructures
need mechanisms to record application activities in order to conduct
measurements. Automatic instrumentation of the source code is the preferred
method in most application scenarios. We introduce a plug-in for the LLVM
infrastructure that enables automatic source code instrumentation at
compile-time. In contrast to available instrumentation mechanisms in
LLVM/Clang, our plug-in can selectively include/exclude individual application
functions. This enables developers to fine-tune the measurement to the required
level of detail while avoiding large runtime overheads due to excessive
instrumentation.
","[{'version': 'v1', 'created': 'Fri, 1 Dec 2017 13:15:49 GMT'}]",2017-12-06,"[['Tschüter', 'Ronny', ''], ['Ziegenbalg', 'Johannes', ''], ['Wesarg', 'Bert', ''], ['Weber', 'Matthias', ''], ['Herold', 'Christian', ''], ['Döbel', 'Sebastian', ''], ['Brendel', 'Ronny', '']]","['instrumentation', 'performance analysis', 'performance measurement', 'function pass', 'LLVM']"
6104,1911.06353,Yiding Cao,"Yiding Cao, Yingjun Dong, Minjun Kim, Neil G. MacLaren, Ankita
  Kulkarni, Shelley D. Dionne, Francis J. Yammarino, and Hiroki Sayama","Capturing the Production of the Innovative Ideas: An Online Social
  Network Experiment and ""Idea Geography"" Visualization","16 pages, 10 figures, submitted to CSS 2019 (Computational Social
  Science 2019)","Proceedings of the 2019 International Conference of The
  Computational Social Science Society of the Americas pp 341-354",10.1007/978-3-030-77517-9_20,,cs.SI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Collective design and innovation are crucial in organizations. To investigate
how the collective design and innovation processes would be affected by the
diversity of knowledge and background of collective individual members, we
conducted three collaborative design task experiments which involved nearly 300
participants who worked together anonymously in a social network structure
using a custom-made computer-mediated collaboration platform. We compared the
idea generation activity among three different background distribution
conditions (clustered, random, and dispersed) with the help of the ""doc2vec""
text representation machine learning algorithm. We also developed a new method
called ""Idea Geography"" to visualize the idea utility terrain on a 2D problem
domain. The results showed that groups with random background allocation tended
to produce the best design idea with highest utility values. It was also
suggested that the diversity of participants' backgrounds distribution on the
network might interact with each other to affect the diversity of ideas
generated. The proposed idea geography successfully visualized that the
collective design processes did find the high utility area through exploration
and exploitation in collaborative work.
","[{'version': 'v1', 'created': 'Thu, 14 Nov 2019 19:38:50 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Feb 2020 04:07:23 GMT'}]",2021-10-19,"[['Cao', 'Yiding', ''], ['Dong', 'Yingjun', ''], ['Kim', 'Minjun', ''], ['MacLaren', 'Neil G.', ''], ['Kulkarni', 'Ankita', ''], ['Dionne', 'Shelley D.', ''], ['Yammarino', 'Francis J.', ''], ['Sayama', 'Hiroki', '']]","['Collective design and innovation', 'collaboration', 'background', 'human-subject experiment', 'Idea Geography']"
6105,2211.03715,Dingwen Tao,"Lizhi Xiang, Miao Yin, Chengming Zhang, Aravind Sukumaran-Rajam, P.
  Sadayappan, Bo Yuan, Dingwen Tao","TDC: Towards Extremely Efficient CNNs on GPUs via Hardware-Aware Tucker
  Decomposition","14 pages, 9 figures, 3 tables, accepted by PPoPP '23",,10.1145/3572848.3577478,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Tucker decomposition is one of the SOTA CNN model compression techniques.
However, unlike the FLOPs reduction, we observe very limited inference time
reduction with Tucker-compressed models using existing GPU software such as
cuDNN. To this end, we propose an efficient end-to-end framework that can
generate highly accurate and compact CNN models via Tucker decomposition and
optimized inference code on GPUs. Specifically, we propose an ADMM-based
training algorithm that can achieve highly accurate Tucker-format models. We
also develop a high-performance kernel for Tucker-format convolutions and
analytical performance models to guide the selection of execution parameters.
We further propose a co-design framework to determine the proper Tucker ranks
driven by practical inference time (rather than FLOPs). Our evaluation on five
modern CNNs with A100 demonstrates that our compressed models with our
optimized code achieve up to 2.21X speedup over cuDNN, 1.12X speedup over TVM,
and 3.27X over the original models using cuDNN with at most 0.05% accuracy
loss.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2022 17:40:32 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Jan 2023 03:18:52 GMT'}]",2023-01-06,"[['Xiang', 'Lizhi', ''], ['Yin', 'Miao', ''], ['Zhang', 'Chengming', ''], ['Sukumaran-Rajam', 'Aravind', ''], ['Sadayappan', 'P.', ''], ['Yuan', 'Bo', ''], ['Tao', 'Dingwen', '']]","['Convolutional neural network', 'inference', 'GPU', 'performance', 'model compression']"
6106,1810.04063,Vajira Thambawita,"Vajira Thambawita, Roshan G. Ragel, Dhammike Elkaduwe",To Use or Not to Use: CPUs' Cache Optimization Techniques on GPGPUs,"6 pages, 15 Figures","ICIAfS 2016- IEEE International Conference on Information and
  Automation for Sustainability",10.1109/ICIAFS.2016.7946534,,cs.DC cs.CC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  General Purpose Graphic Processing Unit(GPGPU) is used widely for achieving
high performance or high throughput in parallel programming. This capability of
GPGPUs is very famous in the new era and mostly used for scientific computing
which requires more processing power than normal personal computers. Therefore,
most of the programmers, researchers and industry use this new concept for
their work. However, achieving high-performance or high-throughput using GPGPUs
are not an easy task compared with conventional programming concepts in the CPU
side. In this research, the CPU's cache memory optimization techniques have
been adopted to the GPGPU's cache memory to identify rare performance
improvement techniques compared to GPGPU's best practices. The cache
optimization techniques of blocking, loop fusion, array merging and array
transpose were tested on GPGPUs for finding suitability of these techniques.
Finally, we identified that some of the CPU cache optimization techniques go
well with the cache memory system of the GPGPU and shows performance
improvements while some others show the opposite effect on the GPGPUs compared
with the CPUs.
","[{'version': 'v1', 'created': 'Tue, 9 Oct 2018 15:10:33 GMT'}]",2018-10-10,"[['Thambawita', 'Vajira', ''], ['Ragel', 'Roshan G.', ''], ['Elkaduwe', 'Dhammike', '']]","['GPGPU', 'CPU', 'Cache Optimization', 'CUDA', 'FermiArchitecture']"
6107,1906.05020,Leonardo Bautista Gomez,"Julien Adam, Maxime Kermarquer, Jean-Baptiste Besnard, Leonardo
  Bautista-Gomez, Marc Perache, Patrick Carribault, Julien Jaeger, Allen D.
  Malony, Sameer Shende",Checkpoint/restart approaches for a thread-based MPI runtime,"This research has been partially sponsored by the European Union s
  Horizon 2020 Programme under the LEGaTO Project (www.legato-project.eu),
  grant agreement 780681 and the Mont-Blanc 2020 project, grant agreement no.
  779877",,10.1016/j.parco.2019.02.006,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fault-tolerance has always been an important topic when it comes to running
massively parallel programs at scale. Statistically, hardware and software
failures are expected to occur more often on systems gathering millions of
computing units. Moreover, the larger jobs are, the more computing hours would
be wasted by a crash. In this paper, we describe the work done in our MPI
runtime to enable both transparent and application-level checkpointing
mechanisms. Unlike the MPI 4.0 User-Level Failure Mitigation (ULFM) interface,
our work targets solely Checkpoint/Restart and ignores other features such as
resiliency. We show how existing checkpointing methods can be practically
applied to a thread-based MPI implementation given sufficient runtime
collaboration. The two main contributions are the preservation of high-speed
network performance during transparent C/R and the over-subscription of
checkpoint data replication thanks to a dedicated user-level scheduler support.
These techniques are measured on MPI benchmarks such as IMB, Lulesh and
Heatdis, and associated overhead and trade-offs are discussed.
","[{'version': 'v1', 'created': 'Wed, 12 Jun 2019 09:18:43 GMT'}]",2019-06-13,"[['Adam', 'Julien', ''], ['Kermarquer', 'Maxime', ''], ['Besnard', 'Jean-Baptiste', ''], ['Bautista-Gomez', 'Leonardo', ''], ['Perache', 'Marc', ''], ['Carribault', 'Patrick', ''], ['Jaeger', 'Julien', ''], ['Malony', 'Allen D.', ''], ['Shende', 'Sameer', '']]","['Checkpoint-Restart', 'Fault-Tolerance', 'DMTCP', 'Infiniband', 'Multilevel Checkpointing', 'MPI Oversubscribing']"
6108,2210.06974,Taras Kucherenko,"Yuan He, Andr\'e Pereira, and Taras Kucherenko","Evaluating Data-Driven Co-Speech Gestures of Embodied Conversational
  Agents through Real-Time Interaction","Published at the International Conference on Intelligent Virtual
  Agents",,10.1145/3514197.3549697,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Embodied Conversational Agents that make use of co-speech gestures can
enhance human-machine interactions in many ways. In recent years, data-driven
gesture generation approaches for ECAs have attracted considerable research
attention, and related methods have continuously improved. Real-time
interaction is typically used when researchers evaluate ECA systems that
generate rule-based gestures. However, when evaluating the performance of ECAs
based on data-driven methods, participants are often required only to watch
pre-recorded videos, which cannot provide adequate information about what a
person perceives during the interaction. To address this limitation, we
explored use of real-time interaction to assess data-driven gesturing ECAs. We
provided a testbed framework, and investigated whether gestures could affect
human perception of ECAs in the dimensions of human-likeness, animacy,
perceived intelligence, and focused attention. Our user study required
participants to interact with two ECAs - one with and one without hand
gestures. We collected subjective data from the participants' self-report
questionnaires and objective data from a gaze tracker. To our knowledge, the
current study represents the first attempt to evaluate data-driven gesturing
ECAs through real-time interaction and the first experiment using gaze-tracking
to examine the effect of ECAs' gestures.
","[{'version': 'v1', 'created': 'Thu, 13 Oct 2022 12:50:03 GMT'}]",2022-10-14,"[['He', 'Yuan', ''], ['Pereira', 'André', ''], ['Kucherenko', 'Taras', '']]","['embodied conversational agent', 'user study', 'evaluation instrument', 'data-driven', 'gesture generation', 'gaze tracking']"
6109,1910.03667,Jos\'e Ignacio Orlando PhD,"Jos\'e Ignacio Orlando, Huazhu Fu, Jo\~ao Barbossa Breda, Karel van
  Keer, Deepti R. Bathula, Andr\'es Diaz-Pinto, Ruogu Fang, Pheng-Ann Heng,
  Jeyoung Kim, JoonHo Lee, Joonseok Lee, Xiaoxiao Li, Peng Liu, Shuai Lu,
  Balamurali Murugesan, Valery Naranjo, Sai Samarth R. Phaye, Sharath M.
  Shankaranarayana, Apoorva Sikka, Jaemin Son, Anton van den Hengel, Shujun
  Wang, Junyan Wu, Zifeng Wu, Guanghui Xu, Yongli Xu, Pengshuai Yin, Fei Li,
  Xiulan Zhang, Yanwu Xu, Xiulan Zhang, Hrvoje Bogunovi\'c","REFUGE Challenge: A Unified Framework for Evaluating Automated Methods
  for Glaucoma Assessment from Fundus Photographs",Accepted for publication in Medical Image Analysis,,10.1016/j.media.2019.101570,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Glaucoma is one of the leading causes of irreversible but preventable
blindness in working age populations. Color fundus photography (CFP) is the
most cost-effective imaging modality to screen for retinal disorders. However,
its application to glaucoma has been limited to the computation of a few
related biomarkers such as the vertical cup-to-disc ratio. Deep learning
approaches, although widely applied for medical image analysis, have not been
extensively used for glaucoma assessment due to the limited size of the
available data sets. Furthermore, the lack of a standardize benchmark strategy
makes difficult to compare existing methods in a uniform way. In order to
overcome these issues we set up the Retinal Fundus Glaucoma Challenge, REFUGE
(\url{https://refuge.grand-challenge.org}), held in conjunction with MICCAI
2018. The challenge consisted of two primary tasks, namely optic disc/cup
segmentation and glaucoma classification. As part of REFUGE, we have publicly
released a data set of 1200 fundus images with ground truth segmentations and
clinical glaucoma labels, currently the largest existing one. We have also
built an evaluation framework to ease and ensure fairness in the comparison of
different models, encouraging the development of novel techniques in the field.
12 teams qualified and participated in the online challenge. This paper
summarizes their methods and analyzes their corresponding results. In
particular, we observed that two of the top-ranked teams outperformed two human
experts in the glaucoma classification task. Furthermore, the segmentation
results were in general consistent with the ground truth annotations, with
complementary outcomes that can be further exploited by ensembling the results.
","[{'version': 'v1', 'created': 'Tue, 8 Oct 2019 20:20:43 GMT'}]",2019-10-10,"[['Orlando', 'José Ignacio', ''], ['Fu', 'Huazhu', ''], ['Breda', 'João Barbossa', ''], ['van Keer', 'Karel', ''], ['Bathula', 'Deepti R.', ''], ['Diaz-Pinto', 'Andrés', ''], ['Fang', 'Ruogu', ''], ['Heng', 'Pheng-Ann', ''], ['Kim', 'Jeyoung', ''], ['Lee', 'JoonHo', ''], ['Lee', 'Joonseok', ''], ['Li', 'Xiaoxiao', ''], ['Liu', 'Peng', ''], ['Lu', 'Shuai', ''], ['Murugesan', 'Balamurali', ''], ['Naranjo', 'Valery', ''], ['Phaye', 'Sai Samarth R.', ''], ['Shankaranarayana', 'Sharath M.', ''], ['Sikka', 'Apoorva', ''], ['Son', 'Jaemin', ''], ['Hengel', 'Anton van den', ''], ['Wang', 'Shujun', ''], ['Wu', 'Junyan', ''], ['Wu', 'Zifeng', ''], ['Xu', 'Guanghui', ''], ['Xu', 'Yongli', ''], ['Yin', 'Pengshuai', ''], ['Li', 'Fei', ''], ['Zhang', 'Xiulan', ''], ['Xu', 'Yanwu', ''], ['Zhang', 'Xiulan', ''], ['Bogunović', 'Hrvoje', '']]","['Glaucoma', 'Fundus photography', 'Deep Learning', 'Image segmentation', 'Image classification']"
6110,2109.11791,Theofanis Raptis,"Ioannis Katsidimas, Sotiris Nikoletseas, Theofanis P. Raptis,
  Christoforos Raptopoulos","An algorithmic study in the vector model for Wireless Power Transfer
  maximization",,"Pervasive and Mobile Computing, Volume 42, 2017, Pages 108-123,
  ISSN 1574-1192",10.1016/j.pmcj.2017.10.001,,cs.NI cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Rapid technological advances in the domain of Wireless Power Transfer (WPT)
pave the way for novel methods for power management in systems of wireless
devices and recent research works have already started considering algorithmic
solutions for tackling emerging problems. However, many of those works are
limited by the system modelling, and more specifically the one-dimensional
abstraction suggested by Friis formula for the power received by one antenna
under idealized conditions given another antenna some distance away. Different
to those works, we use a model which arises naturally from fundamental
properties of the superposition of energy fields. This model has been shown to
be more realistic than other one-dimensional models that have been used in the
past and can capture superadditive and cancellation effects. Under this model,
we define two new interesting problems for configuring the wireless power
transmitters so as to maximize the total power in the system and we prove that
the first problem can be solved in polynomial time. We present a distributed
solution that runs in pseudo-polynomial time and uses various knowledge levels
and we provide theoretical performance guarantees. Finally, we design three
heuristics for the second problem and evaluate them via simulations.
","[{'version': 'v1', 'created': 'Fri, 24 Sep 2021 07:47:45 GMT'}]",2021-09-27,"[['Katsidimas', 'Ioannis', ''], ['Nikoletseas', 'Sotiris', ''], ['Raptis', 'Theofanis P.', ''], ['Raptopoulos', 'Christoforos', '']]","['Wireless Power Transfer', 'Distributed Algorithms', 'Wireless Systems']"
6111,1906.09456,Huy Kang Kim,"Hye Min Kim, Hyun Min Song, Jae Woo Seo, Huy Kang Kim","Andro-Simnet: Android Malware Family Classification Using Social Network
  Analysis","13 pages, 11 figures, dataset link:
  http://ocslab.hksecurity.net/Datasets/andro-simnet , demo video:
  https://youtu.be/JmfS-ZtCbg4 , In Proceedings of the 16th Annual Conference
  on Privacy, Security and Trust (PST), 2018","2018 16th Annual Conference on Privacy, Security and Trust (PST),
  Belfast, 2018, pp. 1-8",10.1109/PST.2018.8514216,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While the rapid adaptation of mobile devices changes our daily life more
conveniently, the threat derived from malware is also increased. There are lots
of research to detect malware to protect mobile devices, but most of them adopt
only signature-based malware detection method that can be easily bypassed by
polymorphic and metamorphic malware. To detect malware and its variants, it is
essential to adopt behavior-based detection for efficient malware
classification. This paper presents a system that classifies malware by using
common behavioral characteristics along with malware families. We measure the
similarity between malware families with carefully chosen features commonly
appeared in the same family. With the proposed similarity measure, we can
classify malware by malware's attack behavior pattern and tactical
characteristics. Also, we apply a community detection algorithm to increase the
modularity within each malware family network aggregation. To maintain high
classification accuracy, we propose a process to derive the optimal weights of
the selected features in the proposed similarity measure. During this process,
we find out which features are significant for representing the similarity
between malware samples. Finally, we provide an intuitive graph visualization
of malware samples which is helpful to understand the distribution and likeness
of the malware networks. In the experiment, the proposed system achieved 97%
accuracy for malware classification and 95% accuracy for prediction by K-fold
cross-validation using the real malware dataset.
","[{'version': 'v1', 'created': 'Sat, 22 Jun 2019 14:48:24 GMT'}]",2019-06-25,"[['Kim', 'Hye Min', ''], ['Song', 'Hyun Min', ''], ['Seo', 'Jae Woo', ''], ['Kim', 'Huy Kang', '']]","['malware similarity · machine learning', 'malware classification', 'social network analysis']"
6112,1508.06158,{\L}ukasz D\k{e}bowski,{\L}ukasz D\k{e}bowski,"Regular Hilberg Processes: An Example of Processes with a Vanishing
  Entropy Rate",19 pages,"IEEE Transactions on Information Theory 63(10):6538-6546, 2017",10.1109/TIT.2017.2734655,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A regular Hilberg process is a stationary process that satisfies both a
hyperlogarithmic growth of maximal repetition and a power-law growth of
topological entropy, which are a kind of dual conditions. The hyperlogarithmic
growth of maximal repetition has been experimentally observed for texts in
natural language, whereas the power-law growth of topological entropy implies a
vanishing Shannon entropy rate and thus probably does not hold for natural
language. In this paper, we provide a constructive example of regular Hilberg
processes, which we call random hierarchical association (RHA) processes. Our
construction does not apply the standard cutting and stacking method. For the
constructed RHA processes, we demonstrate that the expected length of any
uniquely decodable code is orders of magnitude larger than the Shannon block
entropy of the ergodic component of the RHA process. Our proposition
supplements the classical result by Shields concerning nonexistence of
universal redundancy rates.
","[{'version': 'v1', 'created': 'Tue, 25 Aug 2015 14:04:33 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Nov 2016 11:45:22 GMT'}]",2020-03-11,"[['Dębowski', 'Łukasz', '']]","['maximal repetition', 'topological entropy', 'entropy rate', 'asymptotically mean stationary processes']"
6113,2111.08500,Shuo Jiang,"Shuo Jiang, Serhad Sarica, Binyang Song, Jie Hu, Jianxi Luo","Patent Data for Engineering Design: A Critical Review and Future
  Directions",Accepted by JCISE,"Journal of Computing and Information Science in Engineering.
  22(6), 2022, 060902",10.1115/1.4054802,,cs.DL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Patent data have long been used for engineering design research because of
its large and expanding size, and widely varying massive amount of design
information contained in patents. Recent advances in artificial intelligence
and data science present unprecedented opportunities to develop data-driven
design methods and tools, as well as advance design science, using the patent
database. Herein, we survey and categorize the patent-for-design literature
based on its contributions to design theories, methods, tools, and strategies,
as well as the types of patent data and data-driven methods used in respective
studies. Our review highlights promising future research directions in patent
data-driven design research and practice.
","[{'version': 'v1', 'created': 'Mon, 15 Nov 2021 05:42:26 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Feb 2022 12:51:29 GMT'}, {'version': 'v3', 'created': 'Tue, 14 Jun 2022 06:02:11 GMT'}]",2022-11-04,"[['Jiang', 'Shuo', ''], ['Sarica', 'Serhad', ''], ['Song', 'Binyang', ''], ['Hu', 'Jie', ''], ['Luo', 'Jianxi', '']]","['Patent', 'Engineering Design', 'Data-Driven Design', 'Artificial Intelligence', 'Data Science']"
6114,2102.00451,Nikita Zhivotovskiy,Nikita Puchkin and Nikita Zhivotovskiy,Exponential Savings in Agnostic Active Learning through Abstention,"31 pages, IEEE Transactions on Information Theory",,10.1109/TIT.2022.3156592,,cs.LG cs.IT math.IT math.ST stat.TH,http://creativecommons.org/licenses/by/4.0/,"  We show that in pool-based active classification without assumptions on the
underlying distribution, if the learner is given the power to abstain from some
predictions by paying the price marginally smaller than the average loss $1/2$
of a random guess, exponential savings in the number of label requests are
possible whenever they are possible in the corresponding realizable problem. We
extend this result to provide a necessary and sufficient condition for
exponential savings in pool-based active classification under the model
misspecification.
","[{'version': 'v1', 'created': 'Sun, 31 Jan 2021 13:43:14 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Jun 2021 19:24:12 GMT'}, {'version': 'v3', 'created': 'Sun, 17 Apr 2022 19:43:45 GMT'}]",2022-04-19,"[['Puchkin', 'Nikita', ''], ['Zhivotovskiy', 'Nikita', '']]","['active learning', 'sample complexity', 'abstention', 'reject option', 'Chow’s risk', 'VC dimension', 'model selection aggregation', 'Massart’s noise']"
6115,2009.13747,Yuanchun Li,"Ziqi Zhang, Yuanchun Li, Yao Guo, Xiangqun Chen, Yunxin Liu",Dynamic Slicing for Deep Neural Networks,"11 pages, ESEC/FSE '20",,10.1145/3368089.3409676,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Program slicing has been widely applied in a variety of software engineering
tasks. However, existing program slicing techniques only deal with traditional
programs that are constructed with instructions and variables, rather than
neural networks that are composed of neurons and synapses. In this paper, we
propose NNSlicer, the first approach for slicing deep neural networks based on
data flow analysis. Our method understands the reaction of each neuron to an
input based on the difference between its behavior activated by the input and
the average behavior over the whole dataset. Then we quantify the neuron
contributions to the slicing criterion by recursively backtracking from the
output neurons, and calculate the slice as the neurons and the synapses with
larger contributions. We demonstrate the usefulness and effectiveness of
NNSlicer with three applications, including adversarial input detection, model
pruning, and selective model protection. In all applications, NNSlicer
significantly outperforms other baselines that do not rely on data flow
analysis.
","[{'version': 'v1', 'created': 'Tue, 29 Sep 2020 03:28:31 GMT'}]",2020-09-30,"[['Zhang', 'Ziqi', ''], ['Li', 'Yuanchun', ''], ['Guo', 'Yao', ''], ['Chen', 'Xiangqun', ''], ['Liu', 'Yunxin', '']]","['Program slicing', 'deep neural networks', 'dynamic slicing', 'data flowanalysis']"
6116,2207.13075,Tarik A. Rashid,"Maryam T. Abdulkhaleq, Tarik A. Rashid, Abeer Alsadoon, Bryar A.
  Hassan, Mokhtar Mohammadi, Jaza M. Abdullah, Amit Chhabra, Sazan L. Ali,
  Rawshan N. Othman, Hadil A. Hasan, Sara Azad, Naz A. Mahmood, Sivan S.
  Abdalrahman, Hezha O. Rasul, Nebojsa Bacanin, S.Vimal",Harmony Search: Current Studies and Uses on Healthcare Systems,37 pages,"Artificial Intelligence in Medicine, 2022",10.1016/j.artmed.2022.102348,,cs.NE cs.CY,http://creativecommons.org/licenses/by/4.0/,"  One of the popular metaheuristic search algorithms is Harmony Search (HS). It
has been verified that HS can find solutions to optimization problems due to
its balanced exploratory and convergence behavior and its simple and flexible
structure. This capability makes the algorithm preferable to be applied in
several real-world applications in various fields, including healthcare
systems, different engineering fields, and computer science. The popularity of
HS urges us to provide a comprehensive survey of the literature on HS and its
variants on health systems, analyze its strengths and weaknesses, and suggest
future research directions. In this review paper, the current studies and uses
of harmony search are studied in four main domains. (i) The variants of HS,
including its modifications and hybridization. (ii) Summary of the previous
review works. (iii) Applications of HS in healthcare systems. (iv) And finally,
an operational framework is proposed for the applications of HS in healthcare
systems. The main contribution of this review is intended to provide a thorough
examination of HS in healthcare systems while also serving as a valuable
resource for prospective scholars who want to investigate or implement this
method.
","[{'version': 'v1', 'created': 'Tue, 19 Jul 2022 08:37:42 GMT'}]",2022-07-27,"[['Abdulkhaleq', 'Maryam T.', ''], ['Rashid', 'Tarik A.', ''], ['Alsadoon', 'Abeer', ''], ['Hassan', 'Bryar A.', ''], ['Mohammadi', 'Mokhtar', ''], ['Abdullah', 'Jaza M.', ''], ['Chhabra', 'Amit', ''], ['Ali', 'Sazan L.', ''], ['Othman', 'Rawshan N.', ''], ['Hasan', 'Hadil A.', ''], ['Azad', 'Sara', ''], ['Mahmood', 'Naz A.', ''], ['Abdalrahman', 'Sivan S.', ''], ['Rasul', 'Hezha O.', ''], ['Bacanin', 'Nebojsa', ''], ['Vimal', 'S.', '']]","['Harmony Search', 'Optimization', 'Evolutionary Algorithms', 'Meta-heuristics', 'Health Care', 'Medical']"
6117,2104.04675,Stephen MacDonell,"Marco Kuhrmann, Philipp Diebold, Stephen MacDonell, and J\""urgen
  M\""unch","2nd Workshop on Hybrid Development Approaches in Software Systems
  Development","Article/Book Chapter, 4 pages, 2 figures, 1 table","Product-Focused Software Process Improvement (PROFES 2017).
  Lecture Notes in Computer Science, vol 10611, pp.397-403",10.1007/978-3-319-69926-4_28,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software and system development is complex and diverse, and a multitude of
development approaches is used and combined with each other to address the
manifold challenges companies face today. To study the current state of the
practice and to build a sound understanding about the utility of different
development approaches and their application to modern software system
development, in 2016, we launched the HELENA initiative. This paper introduces
the 2nd HELENA workshop and provides an overview of the current project state.
In the workshop, six teams present initial findings from their regions, impulse
talk are given, and further steps of the HELENA roadmap are discussed.
","[{'version': 'v1', 'created': 'Sat, 10 Apr 2021 03:30:40 GMT'}]",2021-04-13,"[['Kuhrmann', 'Marco', ''], ['Diebold', 'Philipp', ''], ['MacDonell', 'Stephen', ''], ['Münch', 'Jürgen', '']]","['Software process', 'Process description', 'Process improvement', 'Agile methods', 'Hybrid development approaches']"
6118,1601.03907,Thang Duong,"Roger A. Sauer, Thang X. Duong, Kranthi K. Mandadapu, David J.
  Steigmann","A stabilized finite element formulation for liquid shells and its
  application to lipid bilayers","Corrected typo in axes of Fig.3, results unchanged",,10.1016/j.jcp.2016.11.004,,cs.CE cond-mat.soft,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new finite element (FE) formulation for liquid shells
that is based on an explicit, 3D surface discretization using $C^1$-continuous
finite elements constructed from NURBS interpolation. Both displacement-based
and mixed FE formulations are proposed. The latter is needed for
area-incompressible material behavior, where penalty-type regularizations can
lead to misleading results. In order to obtain quasi-static solutions, several
numerical stabilization schemes are proposed based on either stiffness,
viscosity or projection. Several numerical examples are considered in order to
illustrate the accuracy and the capabilities of the proposed formulation, and
to compare the different stabilization schemes. The presented formulation is
capable of simulating non-trivial surface shapes associated with tube formation
and protein-induced budding of lipid bilayers. In the latter case, the
presented formulation yields non-axisymmetric solutions, which have not been
observed in previous simulations. It is shown that those non-axisymmetric
shapes are preferred over axisymmetric ones.
","[{'version': 'v1', 'created': 'Fri, 15 Jan 2016 13:24:53 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Jan 2016 02:51:49 GMT'}]",2017-01-04,"[['Sauer', 'Roger A.', ''], ['Duong', 'Thang X.', ''], ['Mandadapu', 'Kranthi K.', ''], ['Steigmann', 'David J.', '']]","['cell budding', 'cell tethering', 'Helfrich energy', 'isogeoemetric analysis', 'non-linearfinite elements', 'non-linear shell theory']"
6119,2004.07221,Vladislav Ryzhikov Dr,"Alessandro Artale, Roman Kontchakov, Alisa Kovtunova, Vladislav
  Ryzhikov, Frank Wolter, Michael Zakharyaschev","First-Order Rewritability of Ontology-Mediated Queries in Linear
  Temporal Logic",,,10.1016/j.artint.2021.103536,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate ontology-based data access to temporal data. We consider
temporal ontologies given in linear temporal logic LTL interpreted over
discrete time (Z,<). Queries are given in LTL or MFO(<), monadic first-order
logic with a built-in linear order. Our concern is first-order rewritability of
ontology-mediated queries (OMQs) consisting of a temporal ontology and a query.
By taking account of the temporal operators used in the ontology and
distinguishing between ontologies given in full LTL and its core, Krom and Horn
fragments, we identify a hierarchy of OMQs with atomic queries by proving
rewritability into either FO(<), first-order logic with the built-in linear
order, or FO(<,E), which extends FO(<) with the standard arithmetic predicates
saying that ""x is equivalent to 0 modulo n"", for any fixed n > 1, or FO(RPR),
which extends FO(<) with relational primitive recursion. In terms of circuit
complexity, FO(<,E)- and FO(RPR)-rewritability guarantee OMQ answering in
uniform AC0 and, respectively, NC1.
  We obtain similar hierarchies for more expressive types of queries: positive
LTL-formulas, monotone MFO(<)- and arbitrary MFO(<)-formulas. Our results are
directly applicable if the temporal data to be accessed is one-dimensional;
moreover, they lay foundations for investigating ontology-based access using
combinations of temporal and description logics over two-dimensional temporal
data.
","[{'version': 'v1', 'created': 'Wed, 15 Apr 2020 17:22:10 GMT'}, {'version': 'v2', 'created': 'Tue, 26 May 2020 17:47:40 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Mar 2021 10:00:54 GMT'}, {'version': 'v4', 'created': 'Tue, 25 May 2021 10:30:51 GMT'}]",2021-05-26,"[['Artale', 'Alessandro', ''], ['Kontchakov', 'Roman', ''], ['Kovtunova', 'Alisa', ''], ['Ryzhikov', 'Vladislav', ''], ['Wolter', 'Frank', ''], ['Zakharyaschev', 'Michael', '']]","['Linear temporal logic', 'description logic', 'ontology-based data access', 'first-order rewritability', 'datacomplexity']"
6120,2206.06317,Hans Weytjens,Hans Weytjens and Jochen De Weerdt,"Learning Uncertainty with Artificial Neural Networks for Improved
  Predictive Process Monitoring",,"Applied Soft Computing (2022), 109134",10.1016/j.asoc.2022.109134,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The inability of artificial neural networks to assess the uncertainty of
their predictions is an impediment to their widespread use. We distinguish two
types of learnable uncertainty: model uncertainty due to a lack of training
data and noise-induced observational uncertainty. Bayesian neural networks use
solid mathematical foundations to learn the model uncertainties of their
predictions. The observational uncertainty can be calculated by adding one
layer to these networks and augmenting their loss functions. Our contribution
is to apply these uncertainty concepts to predictive process monitoring tasks
to train uncertainty-based models to predict the remaining time and outcomes.
Our experiments show that uncertainty estimates allow more and less accurate
predictions to be differentiated and confidence intervals to be constructed in
both regression and classification tasks. These conclusions remain true even in
early stages of running processes. Moreover, the deployed techniques are fast
and produce more accurate predictions. The learned uncertainty could increase
users' confidence in their process prediction systems, promote better
cooperation between humans and these systems, and enable earlier
implementations with smaller datasets.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2022 17:05:27 GMT'}]",2022-06-14,"[['Weytjens', 'Hans', ''], ['De Weerdt', 'Jochen', '']]","['Predictive Process Monitoring', 'Remaining Time Prediction', 'Outcome']"
6121,2008.07815,Gabriel Michau Dr.,Gabriel Michau and Olga Fink,"Unsupervised Transfer Learning for Anomaly Detection: Application to
  Complementary Operating Condition Transfer","14 pages, 7 figures, 3 tables",,10.1016/j.knosys.2021.106816,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Anomaly Detectors are trained on healthy operating condition data and raise
an alarm when the measured samples deviate from the training data distribution.
This means that the samples used to train the model should be sufficient in
quantity and representative of the healthy operating conditions. But for
industrial systems subject to changing operating conditions, acquiring such
comprehensive sets of samples requires a long collection period and delay the
point at which the anomaly detector can be trained and put in operation.
  A solution to this problem is to perform unsupervised transfer learning
(UTL), to transfer complementary data between different units. In the
literature however, UTL aims at finding common structure between the datasets,
to perform clustering or dimensionality reduction. Yet, the task of
transferring and combining complementary training data has not been studied.
  Our proposed framework is designed to transfer complementary operating
conditions between different units in a completely unsupervised way to train
more robust anomaly detectors. It differs, thereby, from other unsupervised
transfer learning works as it focuses on a one-class classification problem.
The proposed methodology enables to detect anomalies in operating conditions
only experienced by other units. The proposed end-to-end framework uses
adversarial deep learning to ensure alignment of the different units'
distributions. The framework introduces a new loss, inspired by a
dimensionality reduction tool, to enforce the conservation of the inherent
variability of each dataset, and uses state-of-the art once-class approach to
detect anomalies. We demonstrate the benefit of the proposed framework using
three open source datasets.
","[{'version': 'v1', 'created': 'Tue, 18 Aug 2020 09:23:39 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Nov 2020 10:32:27 GMT'}]",2021-02-24,"[['Michau', 'Gabriel', ''], ['Fink', 'Olga', '']]","['Anomaly Detection', 'Fault detection', 'Unsupervised Domain Adaptation', 'Aircraft', 'Bearings', 'ImageProcessing']"
6122,2004.12501,Raz Saremi,"Razieh Saremi, Mostaan Lotfalian Saremi, Prasad Desai, and Robert
  Anzalone","Is This the Right Time to Post My Task? An Empirical Analysis on a Task
  Similarity Arrival in TopCoder","15 pages, 6 figures, 2 tables, HCI International 2020","S. Yamamoto and H. Mori (Eds.) HCII 2020, LNCS 12185, pp. 96-110,
  2020",10.1007/978-3-030-50017-7,,cs.SE cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existed studies have shown that crowd workers are more interested in taking
similar tasks in terms of context, field, and required technology, rather than
tasks from the same project. Therefore, it is important for task owners to not
only be able to plan 'when the new task should arrive?' but also, to justify
'what the strategic task arrival plan should be?' in order to receive a valid
submission for the posted task. To address these questions this research
reports an empirical analysis on the impact of similar task arrival in the
platform, on both tasks' success level and workers' performance. Our study
supports that 1- A higher number of arrival tasks with similarity level greater
than 70% will negatively impact on task competition level, 2- A bigger pool of
similar open and arrival tasks would lead to lower worker attraction and
elasticity, and 3- Workers who register for tasks with lower similarity level
are more reliable to make a valid submission and 4- arriving task to the pool
of 60% similar task will provide the highest chance of receiving a valid
submission.
","[{'version': 'v1', 'created': 'Sun, 26 Apr 2020 23:19:25 GMT'}]",2020-07-29,"[['Saremi', 'Razieh', ''], ['Saremi', 'Mostaan Lotfalian', ''], ['Desai', 'Prasad', ''], ['Anzalone', 'Robert', '']]","['Task Similarity', 'Task Arrival', 'Crowdsourced Software Development', 'Worker Performance', 'Competition Level', 'Stability', 'Topcoder']"
6123,2112.13142,Zhaiyu Chen,"Zhaiyu Chen, Hugo Ledoux, Seyran Khademi, Liangliang Nan","Reconstructing Compact Building Models from Point Clouds Using Deep
  Implicit Fields","Accepted for publication in ISPRS Journal of Photogrammetry and
  Remote Sensing",,10.1016/j.isprsjprs.2022.09.017,,cs.CV cs.GR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  While three-dimensional (3D) building models play an increasingly pivotal
role in many real-world applications, obtaining a compact representation of
buildings remains an open problem. In this paper, we present a novel framework
for reconstructing compact, watertight, polygonal building models from point
clouds. Our framework comprises three components: (a) a cell complex is
generated via adaptive space partitioning that provides a polyhedral embedding
as the candidate set; (b) an implicit field is learned by a deep neural network
that facilitates building occupancy estimation; (c) a Markov random field is
formulated to extract the outer surface of a building via combinatorial
optimization. We evaluate and compare our method with state-of-the-art methods
in generic reconstruction, model-based reconstruction, geometry simplification,
and primitive assembly. Experiments on both synthetic and real-world point
clouds have demonstrated that, with our neural-guided strategy, high-quality
building models can be obtained with significant advantages in fidelity,
compactness, and computational efficiency. Our method also shows robustness to
noise and insufficient measurements, and it can directly generalize from
synthetic scans to real-world measurements. The source code of this work is
freely available at https://github.com/chenzhaiyu/points2poly.
","[{'version': 'v1', 'created': 'Fri, 24 Dec 2021 21:32:32 GMT'}, {'version': 'v2', 'created': 'Sun, 9 Jan 2022 22:14:45 GMT'}, {'version': 'v3', 'created': 'Mon, 26 Sep 2022 13:24:05 GMT'}]",2022-12-20,"[['Chen', 'Zhaiyu', ''], ['Ledoux', 'Hugo', ''], ['Khademi', 'Seyran', ''], ['Nan', 'Liangliang', '']]","['3D reconstruction', 'Compact building model', 'Point cloud', 'Deepneural network', 'Implicit field']"
6124,2001.00293,Xin Wang,"Wenwu Zhu, Xin Wang, Peng Cui",Deep Learning for Learning Graph Representations,"51 pages, 8 figures",,10.1007/978-3-030-31756-0_6,,cs.LG cs.IR cs.SI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mining graph data has become a popular research topic in computer science and
has been widely studied in both academia and industry given the increasing
amount of network data in the recent years. However, the huge amount of network
data has posed great challenges for efficient analysis. This motivates the
advent of graph representation which maps the graph into a low-dimension vector
space, keeping original graph structure and supporting graph inference. The
investigation on efficient representation of a graph has profound theoretical
significance and important realistic meaning, we therefore introduce some basic
ideas in graph representation/network embedding as well as some representative
models in this chapter.
","[{'version': 'v1', 'created': 'Thu, 2 Jan 2020 02:13:28 GMT'}]",2020-01-03,"[['Zhu', 'Wenwu', ''], ['Wang', 'Xin', ''], ['Cui', 'Peng', '']]","['Deep Learning', 'Graph Representation', 'Network Embedding']"
6125,2003.08116,\'Etienne Andr\'e,"\'Etienne Andr\'e, Tian Huat Tan, Manman Chen, Shuang Liu, Jun Sun,
  Yang Liu, and Jin Song Dong",Automated synthesis of local time requirement for service composition,"This is a pre-print of an article published in the International
  Journal on Software and Systems Modeling (SoSyM)",,10.1007/s10270-020-00787-5,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Service composition aims at achieving a business goal by composing existing
service-based applications or components. The response time of a service is
crucial especially in time critical business environments, which is often
stated as a clause in service level agreements between service providers and
service users. To meet the guaranteed response time requirement of a composite
service, it is important to select a feasible set of component services such
that their response time will collectively satisfy the response time
requirement of the composite service. In this work, we use the BPEL modeling
language, that aims at specifying Web services. We extend it with timing
parameters, and equip it with a formal semantics. Then, we propose a fully
automated approach to synthesize the response time requirement of component
services modeled using BPEL, in the form of a constraint on the local response
times. The synthesized requirement will guarantee the satisfaction of the
global response time requirement, statically or dynamically. We implemented our
work into a tool, Selamat, and performed several experiments to evaluate the
validity of our approach.
","[{'version': 'v1', 'created': 'Wed, 18 Mar 2020 09:28:40 GMT'}]",2020-03-19,"[['André', 'Étienne', ''], ['Tan', 'Tian Huat', ''], ['Chen', 'Manman', ''], ['Liu', 'Shuang', ''], ['Sun', 'Jun', ''], ['Liu', 'Yang', ''], ['Dong', 'Jin Song', '']]","['Web service composition', 'Parameter synthesis', 'Modeling Webservices', 'Formal semantics', 'BPEL', 'Parametric model checking']"
6126,2107.06833,Tarik A. Rashid,"Ravi Teja Batchu, Abeer Alsadoon, P.W.C. Prasad, Rasha S. Ali, Tarik
  A. Rashid, Ghossoon Alsadoon, Oday D. Jerew","A Review-based Taxonomy for Secure Health Care Monitoring: Wireless
  Smart Cameras",29 pages,"Journal of Applied Security Research, 2021",10.1080/19361610.2021.1947112,,cs.CR cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Health records data security is one of the main challenges in e-health
systems. Authentication is one of the essential security services to support
the stored data confidentiality, integrity, and availability. This research
focuses on the secure storage of patient and medical records in the healthcare
sector where data security and unauthorized access is an ongoing issue. A
potential solution comes from biometrics, although their use may be
time-consuming and can slow down data retrieval. This research aims to overcome
these challenges and enhance data access control in the healthcare sector
through the addition of biometrics in the form of fingerprints. The proposed
model for application in the healthcare sector consists of Collection, Network
communication, and Authentication (CNA) using biometrics, which replaces an
existing password-based access control method. A sensor then collects data and
by using a network (wireless or Zig-bee), a connection is established, after
connectivity analytics and data management work which processes and aggregate
the data. Subsequently, access is granted to authenticated users of the
application. This IoT-based biometric authentication system facilitates
effective recognition and ensures confidentiality, integrity, and reliability
of patients, records and other sensitive data. The proposed solution provides
reliable access to healthcare data and enables secure access through the
process of user and device authentication. The proposed model has been
developed for access control to data through the authentication of users in
healthcare to reduce data manipulation or theft.
","[{'version': 'v1', 'created': 'Mon, 5 Jul 2021 11:59:10 GMT'}]",2021-07-15,"[['Batchu', 'Ravi Teja', ''], ['Alsadoon', 'Abeer', ''], ['Prasad', 'P. W. C.', ''], ['Ali', 'Rasha S.', ''], ['Rashid', 'Tarik A.', ''], ['Alsadoon', 'Ghossoon', ''], ['Jerew', 'Oday D.', '']]","['Healthcare sector', 'biometric technique', 'access control']"
6127,2108.01682,Zaid Khan,Zaid Khan and Yun Fu,"Exploiting BERT For Multimodal Target Sentiment Classification Through
  Input Space Translation",ACM Multimedia 2021 Oral,,10.1145/3474085.3475692,,cs.CL cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Multimodal target/aspect sentiment classification combines multimodal
sentiment analysis and aspect/target sentiment classification. The goal of the
task is to combine vision and language to understand the sentiment towards a
target entity in a sentence. Twitter is an ideal setting for the task because
it is inherently multimodal, highly emotional, and affects real world events.
However, multimodal tweets are short and accompanied by complex, possibly
irrelevant images. We introduce a two-stream model that translates images in
input space using an object-aware transformer followed by a single-pass
non-autoregressive text generation approach. We then leverage the translation
to construct an auxiliary sentence that provides multimodal information to a
language model. Our approach increases the amount of text available to the
language model and distills the object-level information in complex images. We
achieve state-of-the-art performance on two multimodal Twitter datasets without
modifying the internals of the language model to accept multimodal data,
demonstrating the effectiveness of our translation. In addition, we explain a
failure mode of a popular approach for aspect sentiment analysis when applied
to tweets. Our code is available at
\textcolor{blue}{\url{https://github.com/codezakh/exploiting-BERT-thru-translation}}.
","[{'version': 'v1', 'created': 'Tue, 3 Aug 2021 18:02:38 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Aug 2021 20:58:17 GMT'}]",2021-08-09,"[['Khan', 'Zaid', ''], ['Fu', 'Yun', '']]","['sentiment analysis', 'BERT', 'deep learning', 'vision-language', 'twitter']"
6128,2207.03484,Lei Lei,Christian Boin and Lei Lei and Simon X. Yang,"AVDDPG: Federated reinforcement learning applied to autonomous platoon
  control",,,10.20517/ir.2022.11,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Since 2016 federated learning (FL) has been an evolving topic of discussion
in the artificial intelligence (AI) research community. Applications of FL led
to the development and study of federated reinforcement learning (FRL). Few
works exist on the topic of FRL applied to autonomous vehicle (AV) platoons. In
addition, most FRL works choose a single aggregation method (usually weight or
gradient aggregation). We explore FRL's effectiveness as a means to improve AV
platooning by designing and implementing an FRL framework atop a custom AV
platoon environment. The application of FRL in AV platooning is studied under
two scenarios: (1) Inter-platoon FRL (Inter-FRL) where FRL is applied to AVs
across different platoons; (2) Intra-platoon FRL (Intra-FRL) where FRL is
applied to AVs within a single platoon. Both Inter-FRL and Intra-FRL are
applied to a custom AV platooning environment using both gradient and weight
aggregation to observe the performance effects FRL can have on AV platoons
relative to an AV platooning environment trained without FRL. It is concluded
that Intra-FRL using weight aggregation (Intra-FRLWA) provides the best
performance for controlling an AV platoon. In addition, we found that weight
aggregation in FRL for AV platooning provides increases in performance relative
to gradient aggregation. Finally, a performance analysis is conducted for
Intra-FRLWA versus a platooning environment without FRL for platoons of length
3, 4 and 5 vehicles. It is concluded that Intra-FRLWA largely out-performs the
platooning environment that is trained without FRL.
","[{'version': 'v1', 'created': 'Tue, 5 Jul 2022 21:30:44 GMT'}]",2022-07-11,"[['Boin', 'Christian', ''], ['Lei', 'Lei', ''], ['Yang', 'Simon X.', '']]","['Deep reinforcement learning', 'autonomous driving', 'federated reinforcement learning', 'platooning']"
6129,2009.02483,Arthur-Jozsef Molnar,Iuliana Marin and Maria Iuliana Bocicor and Arthur-Jozsef Molnar,"Intelligent Luminaire based Real-time Indoor Positioning for Assisted
  Living",,"In Proceedings of the 15th International Conference on Evaluation
  of Novel Approaches to Software Engineering - Volume 1: ENASE 2020, ISBN
  978-989-758-421-3, pages 548-555",10.5220/0009578705480555,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an experimental evaluation on the accuracy of indoor
localisation. The research was carried out as part of a European Union project
targeting the creation of ICT solutions for older adult care. Current
expectation is that advances in technology will supplement the human workforce
required for older adult care, improve their quality of life and decrease
healthcare expenditure. The proposed approach is implemented in the form of a
configurable cyber-physical system that enables indoor localization and
monitoring of older adults living at home or in residential buildings. Hardware
consists of custom developed luminaires with sensing, communication and
processing capabilities. They replace the existing lighting infrastructure, do
not look out of place and are cost effective. The luminaires record the
strength of a Bluetooth signal emitted by a wearable device equipped by the
monitored user. The system's software server uses trilateration to calculate
the person's location based on known luminaire placement and recorded signal
strengths. However, multipath fading caused by the presence of walls, furniture
and other objects introduces localisation errors. Our previous experiments
showed that room-level accuracy can be achieved using software-based filtering
for a stationary subject. Our current objective is to assess system accuracy in
the context of a moving subject, and ascertain whether room-level localization
is feasible in real time.
","[{'version': 'v1', 'created': 'Sat, 5 Sep 2020 07:19:20 GMT'}]",2020-09-08,"[['Marin', 'Iuliana', ''], ['Bocicor', 'Maria Iuliana', ''], ['Molnar', 'Arthur-Jozsef', '']]","['Cyber-Physical System', 'Ambient Assisted Living', 'Received Signal Strength', 'Indoor Localisation', 'Trilateration', 'Levenberg-Marquardt Algorithm']"
6130,2012.01065,Weijie He,"Weijie He, Xiaohao Mao, Chao Ma, Yu Huang, Jos\'e Miguel
  Hern\'andez-Lobato, Ting Chen",BSODA: A Bipartite Scalable Framework for Online Disease Diagnosis,The Web Conference 2022,,10.1145/3485447.3512123,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  A growing number of people are seeking healthcare advice online. Usually,
they diagnose their medical conditions based on the symptoms they are
experiencing, which is also known as self-diagnosis. From the machine learning
perspective, online disease diagnosis is a sequential feature (symptom)
selection and classification problem. Reinforcement learning (RL) methods are
the standard approaches to this type of tasks. Generally, they perform well
when the feature space is small, but frequently become inefficient in tasks
with a large number of features, such as the self-diagnosis. To address the
challenge, we propose a non-RL Bipartite Scalable framework for Online Disease
diAgnosis, called BSODA. BSODA is composed of two cooperative branches that
handle symptom-inquiry and disease-diagnosis, respectively. The inquiry branch
determines which symptom to collect next by an information-theoretic reward. We
employ a Product-of-Experts encoder to significantly improve the handling of
partial observations of a large number of features. Besides, we propose several
approximation methods to substantially reduce the computational cost of the
reward to a level that is acceptable for online services. Additionally, we
leverage the diagnosis model to estimate the reward more precisely. For the
diagnosis branch, we use a knowledge-guided self-attention model to perform
predictions. In particular, BSODA determines when to stop inquiry and output
predictions using both the inquiry and diagnosis models. We demonstrate that
BSODA outperforms the state-of-the-art methods on several public datasets.
Moreover, we propose a novel evaluation method to test the transferability of
symptom checking methods from synthetic to real-world tasks. Compared to
existing RL baselines, BSODA is more effectively scalable to large search
spaces.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2020 10:12:49 GMT'}, {'version': 'v2', 'created': 'Sat, 29 May 2021 14:53:00 GMT'}, {'version': 'v3', 'created': 'Thu, 20 Jan 2022 07:10:23 GMT'}]",2022-01-21,"[['He', 'Weijie', ''], ['Mao', 'Xiaohao', ''], ['Ma', 'Chao', ''], ['Huang', 'Yu', ''], ['Hernández-Lobato', 'José Miguel', ''], ['Chen', 'Ting', '']]","['online disease diagnosis', 'self-diagnosis', 'symptom checking']"
6131,2103.03500,Mark Zhao,"Mark Zhao, Mingyu Gao, and Christos Kozyrakis",ShEF: Shielded Enclaves for Cloud FPGAs,,,10.1145/3503222.3507733,,cs.CR cs.AR,http://creativecommons.org/licenses/by/4.0/,"  FPGAs are now used in public clouds to accelerate a wide range of
applications, including many that operate on sensitive data such as financial
and medical records. We present ShEF, a trusted execution environment (TEE) for
cloud-based reconfigurable accelerators. ShEF is independent from CPU-based
TEEs and allows secure execution under a threat model where the adversary can
control all software running on the CPU connected to the FPGA, has physical
access to the FPGA, and can compromise the FPGA interface logic of the cloud
provider. ShEF provides a secure boot and remote attestation process that
relies solely on existing FPGA mechanisms for root of trust. It also includes a
Shield component that provides secure access to data while the accelerator is
in use. The Shield is highly customizable and extensible, allowing users to
craft a bespoke security solution that fits their accelerator's memory access
patterns, bandwidth, and security requirements at minimum performance and area
overheads. We describe a prototype implementation of ShEF for existing cloud
FPGAs, map ShEF to a performant and secure storage application, and measure the
performance benefits of customizable security using five additional
accelerators.
","[{'version': 'v1', 'created': 'Fri, 5 Mar 2021 07:02:26 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Jan 2022 00:01:04 GMT'}]",2022-01-31,"[['Zhao', 'Mark', ''], ['Gao', 'Mingyu', ''], ['Kozyrakis', 'Christos', '']]","['trusted execution', 'enclaves', 'cloud computing', 'FPGAs', 'reconfigurable computing']"
6132,2101.12411,Rajesh Kumar,"Rajesh Kumar, Sudipto Mukherjee",A note on synthesizing geodesic based contact curves,,"Mechanism and Machine Theory (2021), 104255",10.1016/j.mechmachtheory.2021.104255,,cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The paper focuses on synthesizing optimal contact curves that can be used to
ensure a rolling constraint between two bodies in relative motion. We show that
geodesic based contact curves generated on both the contacting surfaces are
sufficient conditions to ensure rolling. The differential geodesic equations,
when modified, can ensure proper disturbance rejection in case the system of
interacting bodies is perturbed from the desired curve. A corollary states that
geodesic curves are generated on the surface if rolling constraints are
satisfied. Simulations in the context of in-hand manipulations of the objects
are used as examples.
","[{'version': 'v1', 'created': 'Fri, 29 Jan 2021 05:43:30 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Feb 2021 05:12:34 GMT'}, {'version': 'v3', 'created': 'Sun, 21 Feb 2021 05:12:53 GMT'}, {'version': 'v4', 'created': 'Thu, 15 Apr 2021 14:08:44 GMT'}, {'version': 'v5', 'created': 'Fri, 11 Jun 2021 17:10:46 GMT'}, {'version': 'v6', 'created': 'Mon, 14 Jun 2021 10:10:16 GMT'}]",2021-06-15,"[['Kumar', 'Rajesh', ''], ['Mukherjee', 'Sudipto', '']]","['Geodesic Curves', 'Contact Curves', 'Rolling']"
6133,2110.05119,Ciprian Orhei,"Ciprian Orhei, Muguras Mocofan, Silviu Vert, Radu Vasiu",An automated threshold Edge Drawing algorithm,,,10.1109/TSP52935.2021.9522661,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Parameter choosing in classical edge detection algorithms can be a costly and
complex task. Choosing the correct parameters can improve considerably the
resulting edge-map. In this paper we present a version of Edge Drawing
algorithm in which we include an automated threshold choosing step. To better
highlight the effect of this additional step we use different first order
operators in the algorithm. Visual and statistical results are presented to
sustain the benefits of the proposed automated threshold scheme.
","[{'version': 'v1', 'created': 'Mon, 11 Oct 2021 09:53:18 GMT'}]",2021-10-12,"[['Orhei', 'Ciprian', ''], ['Mocofan', 'Muguras', ''], ['Vert', 'Silviu', ''], ['Vasiu', 'Radu', '']]","['Edge detection', 'Edge Drawing (ED)', 'Otsu threshold', 'Automated threshold']"
6134,2003.08656,Xia Zhang,"Xia Zhang, Hao Sun, Xuanzhu Jin and Moses Olabhele Esangbedo","Existence of an equilibrium for pure exchange economy with fuzzy
  preferences",,"[J]. Journal of Intelligent & Fuzzy Systems, 2020, 39(3):
  2737-2752",10.3233/JIFS-191011,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper focuses on a new model to reach the existence of equilibrium in a
pure exchange economy with fuzzy preferences (PXE-FP). The proposed model
integrates exchange, consumption and the agent's fuzzy preference in the
consumption set. We set up a new fuzzy binary relation on the consumption set
to evaluate the fuzzy preferences. Also, we prove that there exists a
continuous fuzzy order-preserving function in the consumption set under certain
conditions. The existence of a fuzzy competitive equilibrium for the PXE-FP is
confirmed through a new result on the existence of fuzzy Nash equilibrium for
fuzzy non-cooperative games. The payoffs of all strategy profiles for any agent
are fuzzy numbers in fuzzy non-cooperative games. Finally, we show that the
fuzzy competitive equilibrium could be characterized as a solution to an
associated quasi-variational inequality, giving rise to an equilibrium
solution.
","[{'version': 'v1', 'created': 'Thu, 19 Mar 2020 10:05:12 GMT'}]",2020-10-13,"[['Zhang', 'Xia', ''], ['Sun', 'Hao', ''], ['Jin', 'Xuanzhu', ''], ['Esangbedo', 'Moses Olabhele', '']]","['Pure exchange economy', 'Fuzzy preference', 'Fuzzy utility function', 'Fuzzy competitive equilibrium', 'Quasi-variationalinequality']"
6135,2004.00878,Qinheping Hu,"Qinheping Hu, John Cyphert, Loris D'Antoni, Thomas Reps","Exact and Approximate Methods for Proving Unrealizability of
  Syntax-Guided Synthesis Problems",,PLDI 2020,10.1145/3385412.3385979,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of automatically establishing that a given
syntax-guided-synthesis (SyGuS) problem is unrealizable (i.e., has no
solution). We formulate the problem of proving that a SyGuS problem is
unrealizable over a finite set of examples as one of solving a set of
equations: the solution yields an overapproximation of the set of possible
outputs that any term in the search space can produce on the given examples. If
none of the possible outputs agrees with all of the examples, our technique has
proven that the given SyGuS problem is unrealizable. We then present an
algorithm for exactly solving the set of equations that result from SyGuS
problems over linear integer arithmetic (LIA) and LIA with conditionals (CLIA),
thereby showing that LIA and CLIA SyGuS problems over finitely many examples
are decidable. We implement the proposed technique and algorithms in a tool
called Nay. Nay can prove unrealizability for 70/132 existing SyGuS benchmarks,
with running times comparable to those of the state-of-the-art tool Nope.
Moreover, Nay can solve 11 benchmarks that Nope cannot solve.
","[{'version': 'v1', 'created': 'Thu, 2 Apr 2020 08:53:17 GMT'}]",2020-04-03,"[['Hu', 'Qinheping', ''], ['Cyphert', 'John', ''], [""D'Antoni"", 'Loris', ''], ['Reps', 'Thomas', '']]","['Program Synthesis', 'Unrealizability', 'GrammarFlow Analysis', 'Syntax-Guided Synthesis (SyGuS)']"
6136,2208.03088,EPTCS,"Joachim Niehren (Inria Lille), Sylvain Salvati (Universit\'e de
  Lille), Rustam Azimov (Saint Petersburg State University)",Jumping Evaluation of Nested Regular Path Queries,"In Proceedings ICLP 2022, arXiv:2208.02685","EPTCS 364, 2022, pp. 79-92",10.4204/EPTCS.364.8,,cs.CC cs.DB cs.DS cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nested regular path queries are used for querying graph databases and RDF
triple stores. We propose a new algorithm for evaluating nested regular path
queries on a graph from a set of start nodes in combined linear time. We show
that this complexity upper bound can be reduced by making it dependent on the
size of the query's top-down needed subgraph, a notion that we introduce. For
many queries in practice, the top-down needed subgraph is way smaller than the
whole graph. Our algorithm is based on a novel compilation schema from nested
regular path queries to monadic datalog queries. Its complexity upper bound
follows from known properties of top-down datalog evaluation. As an
application, we show that our algorithm permits to reformulate in simple terms
a variant of a very efficient automata-based algorithm proposed by Maneth and
Nguyen that evaluates navigational path queries in datatrees based on indexes
and jumping. Moreover, it overcomes some limitations of Maneth and Nguyen's: it
is not bound to trees and applies to graphs; it is not limited to forward
navigational XPath but can treat any nested regular path query and it can be
implemented efficiently without any dedicated techniques, by using any
efficient datalog evaluator such as LogicBlox.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2022 10:47:24 GMT'}]",2022-08-08,"[['Niehren', 'Joachim', '', 'Inria Lille'], ['Salvati', 'Sylvain', '', 'Université de\n  Lille'], ['Azimov', 'Rustam', '', 'Saint Petersburg State University']]","['Graph databases', 'path queries', 'propositional dynamic logic', 'XPath', 'Datalog']"
6137,1908.07162,Yu Meng,"Yu Meng, Jiaxin Huang, Guangyuan Wang, Zihan Wang, Chao Zhang, Yu
  Zhang, Jiawei Han",Discriminative Topic Mining via Category-Name Guided Text Embedding,WWW 2020. (Code: https://github.com/yumeng5/CatE),,10.1145/3366423.3380278,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mining a set of meaningful and distinctive topics automatically from massive
text corpora has broad applications. Existing topic models, however, typically
work in a purely unsupervised way, which often generate topics that do not fit
users' particular needs and yield suboptimal performance on downstream tasks.
We propose a new task, discriminative topic mining, which leverages a set of
user-provided category names to mine discriminative topics from text corpora.
This new task not only helps a user understand clearly and distinctively the
topics he/she is most interested in, but also benefits directly keyword-driven
classification tasks. We develop CatE, a novel category-name guided text
embedding method for discriminative topic mining, which effectively leverages
minimal user guidance to learn a discriminative embedding space and discover
category representative terms in an iterative manner. We conduct a
comprehensive set of experiments to show that CatE mines high-quality set of
topics guided by category names only, and benefits a variety of downstream
applications including weakly-supervised classification and lexical entailment
direction identification.
","[{'version': 'v1', 'created': 'Tue, 20 Aug 2019 04:32:30 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Jan 2020 21:34:49 GMT'}]",2020-01-29,"[['Meng', 'Yu', ''], ['Huang', 'Jiaxin', ''], ['Wang', 'Guangyuan', ''], ['Wang', 'Zihan', ''], ['Zhang', 'Chao', ''], ['Zhang', 'Yu', ''], ['Han', 'Jiawei', '']]","['Topic Mining', 'Discriminative Analysis', 'Text Embedding', 'Text Classification']"
6138,2207.12507,Nairen Cao,"Nairen Cao, Jeremy T. Fineman, Shi Li, Juli\'an Mestre, Katina
  Russell, Seeun William Umboh",Nested Active-Time Scheduling,,,10.1145/3490148.3538554,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  The active-time scheduling problem considers the problem of scheduling
preemptible jobs with windows (release times and deadlines) on a parallel
machine that can schedule up to $g$ jobs during each timestep. The goal in the
active-time problem is to minimize the number of active steps, i.e., timesteps
in which at least one job is scheduled. In this way, the active time models
parallel scheduling when there is a fixed cost for turning the machine on at
each discrete step.
  This paper presents a 9/5-approximation algorithm for a special case of the
active-time scheduling problem in which job windows are laminar (nested). This
result improves on the previous best 2-approximation for the general case.
","[{'version': 'v1', 'created': 'Mon, 25 Jul 2022 20:12:56 GMT'}]",2022-07-27,"[['Cao', 'Nairen', ''], ['Fineman', 'Jeremy T.', ''], ['Li', 'Shi', ''], ['Mestre', 'Julián', ''], ['Russell', 'Katina', ''], ['Umboh', 'Seeun William', '']]","['Scheduling algorithms', 'Active time', 'Approximation algorithm']"
6139,2204.06850,Marek Bolanowski,"Jitendra Kumar Samriya, Mohit Kumar, Maria Ganzha, Marcin Paprzycki,
  Marek Bolanowski, Andrzej Paszkiewicz","An Energy Aware Clustering Scheme for 5G-enabled Edge Computing based
  IoMT Framework",,,10.1007/978-3-031-08754-7_23,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  In recent years, 5G network systems start to offer communication
infrastructure for Internet of Things (IoT) applications, especially for health
care service pro-viders. In smart health care systems, edge computing enabled
Internet of Medical Things (IoMT) is an innovative technology to provide online
health care monitor-ing facility to patients. Here, energy consumption, along
with extending the lifespan of biosensor network, is a key concern. In this
contribution, a Chicken Swarm Optimization algorithm, based on Energy Efficient
Multi-objective clus-tering scheme is applied in the context of IoMT system. An
effective fitness func-tion is designed for cluster head selection., using
multiple objectives, such as re-sidual energy, queuing delay, communication
cost, link quality and node centrali-ty. Simulated outcomes of the proposed
scheme are compared with the existing schemes in terms of parameters such as
cluster formation time, energy consump-tion, network lifetime, throughput and
propagation delay.
","[{'version': 'v1', 'created': 'Thu, 14 Apr 2022 09:51:17 GMT'}]",2022-07-22,"[['Samriya', 'Jitendra Kumar', ''], ['Kumar', 'Mohit', ''], ['Ganzha', 'Maria', ''], ['Paprzycki', 'Marcin', ''], ['Bolanowski', 'Marek', ''], ['Paszkiewicz', 'Andrzej', '']]","['energy efficiency', 'network lifetime', 'clustering', 'cluster head selection', 'delay', 'chicken swarm optimization', 'sensor networks', 'adaptive networks']"
6140,1401.3230,K Paramesha,K Paramesha and K C Ravishankar,Optimization Of Cross Domain Sentiment Analysis Using Sentiwordnet,,"International Journal in Foundations of Computer Science &
  Technology (IJFCST), Vol. 3, No.5, September 2013",10.5121/ijfcst.2013.3504,,cs.CL cs.IR,http://creativecommons.org/licenses/publicdomain/,"  The task of sentiment analysis of reviews is carried out using manually built
/ automatically generated lexicon resources of their own with which terms are
matched with lexicon to compute the term count for positive and negative
polarity. On the other hand the Sentiwordnet, which is quite different from
other lexicon resources that gives scores (weights) of the positive and
negative polarity for each word. The polarity of a word namely positive,
negative and neutral have the score ranging between 0 to 1 indicates the
strength/weight of the word with that sentiment orientation. In this paper, we
show that using the Sentiwordnet, how we could enhance the performance of the
classification at both sentence and document level.
","[{'version': 'v1', 'created': 'Tue, 8 Oct 2013 13:48:02 GMT'}]",2014-01-15,"[['Paramesha', 'K', ''], ['Ravishankar', 'K C', '']]","['Optimization', 'Sentiment analysis', 'Cross Domain', 'Genetic algorithm', 'Fine-grained', 'Sentiwordnet']"
6141,2108.06113,Dongyu Rao,"D.Y. Rao, X.J. Wu, H. Li, J. Kittler, T.Y. Xu","UMFA: A photorealistic style transfer method based on U-Net and
  multi-layer feature aggregation",,,10.1117/1.JEI.30.5.053013,,cs.CV eess.IV,http://creativecommons.org/publicdomain/zero/1.0/,"  In this paper, we propose a photorealistic style transfer network to
emphasize the natural effect of photorealistic image stylization. In general,
distortion of the image content and lacking of details are two typical issues
in the style transfer field. To this end, we design a novel framework employing
the U-Net structure to maintain the rich spatial clues, with a multi-layer
feature aggregation (MFA) method to simultaneously provide the details obtained
by the shallow layers in the stylization processing. In particular, an encoder
based on the dense block and a decoder form a symmetrical structure of U-Net
are jointly staked to realize an effective feature extraction and image
reconstruction. Besides, a transfer module based on MFA and ""adaptive instance
normalization"" (AdaIN) is inserted in the skip connection positions to achieve
the stylization. Accordingly, the stylized image possesses the texture of a
real photo and preserves rich content details without introducing any mask or
post-processing steps. The experimental results on public datasets demonstrate
that our method achieves a more faithful structural similarity with a lower
style loss, reflecting the effectiveness and merit of our approach.
","[{'version': 'v1', 'created': 'Fri, 13 Aug 2021 08:06:29 GMT'}]",2021-12-01,"[['Rao', 'D. Y.', ''], ['Wu', 'X. J.', ''], ['Li', 'H.', ''], ['Kittler', 'J.', ''], ['Xu', 'T. Y.', '']]","['photorealistic style transfer', 'U-Net', 'deep learning', 'AdaIN', 'Dense block']"
6142,1906.03307,Drahomira Herrmannova,"Drahomira Herrmannova, Nancy Pontika, Petr Knoth",Do Authors Deposit on Time? Tracking Open Access Policy Compliance,"\c{opyright} 2019 IEEE. Personal use of this material is permitted.
  Permission from IEEE must be obtained for all other uses, in any current or
  future media, including reprinting/republishing this material for advertising
  or promotional purposes, creating new collective works, for resale or
  redistribution to servers or lists, or reuse of any copyrighted component of
  this work in other works",,10.1109/JCDL.2019.00037,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent years have seen fast growth in the number of policies mandating Open
Access (OA) to research outputs. We conduct a large-scale analysis of over 800
thousand papers from repositories around the world published over a period of 5
years to investigate: a) if the time lag between the date of publication and
date of deposit in a repository can be effectively tracked across thousands of
repositories globally, and b) if introducing deposit deadlines is associated
with a reduction of time from acceptance to public availability of research
outputs. We show that after the introduction of the UK REF 2021 OA policy, this
time lag has decreased significantly in the UK and that the policy introduction
might have accelerated the UK's move towards immediate OA compared to other
countries. This supports the argument for the inclusion of a time-limited
deposit requirement in OA policies.
","[{'version': 'v1', 'created': 'Fri, 7 Jun 2019 19:44:27 GMT'}]",2019-06-11,"[['Herrmannova', 'Drahomira', ''], ['Pontika', 'Nancy', ''], ['Knoth', 'Petr', '']]","['Open Access', 'Scholarly Data', 'Data Mining', 'Research Evaluation', 'Research Excellence Framework', 'REF']"
6143,2210.15600,Luca Foppiano,"Luca Foppiano, Pedro Baptista de Castro, Pedro Ortiz Suarez, Kensei
  Terashima, Yoshihiko Takano, Masashi Ishii","Automatic extraction of materials and properties from superconductors
  scientific literature","20 pages, 11 figures, 8 tables",,10.1080/27660400.2022.2153633,,cs.CL cond-mat.supr-con cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The automatic extraction of materials and related properties from the
scientific literature is gaining attention in data-driven materials science
(Materials Informatics). In this paper, we discuss Grobid-superconductors, our
solution for automatically extracting superconductor material names and
respective properties from text. Built as a Grobid module, it combines machine
learning and heuristic approaches in a multi-step architecture that supports
input data as raw text or PDF documents. Using Grobid-superconductors, we built
SuperCon2, a database of 40324 materials and properties records from 37700
papers. The material (or sample) information is represented by name, chemical
formula, and material class, and is characterized by shape, doping,
substitution variables for components, and substrate as adjoined information.
The properties include the Tc superconducting critical temperature and, when
available, applied pressure with the Tc measurement method.
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2022 01:03:28 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Nov 2022 01:08:46 GMT'}]",2022-12-09,"[['Foppiano', 'Luca', ''], ['de Castro', 'Pedro Baptista', ''], ['Suarez', 'Pedro Ortiz', ''], ['Terashima', 'Kensei', ''], ['Takano', 'Yoshihiko', ''], ['Ishii', 'Masashi', '']]","['materials informatics', 'superconductors', 'machine learning', 'nlp', 'tdm']"
6144,2103.00031,Dominik Aumayr,"Dominik Aumayr, Stefan Marr, Sophie Kaleba, Elisa Gonzalez Boix,
  Hanspeter M\""ossenb\""ock","Capturing High-level Nondeterminism in Concurrent Programs for Practical
  Concurrency Model Agnostic Record & Replay",,"The Art, Science, and Engineering of Programming, 2021, Vol. 5,
  Issue 3, Article 14",10.22152/programming-journal.org/2021/5/14,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With concurrency being integral to most software systems, developers combine
high-level concurrency models in the same application to tackle each problem
with appropriate abstractions. While languages and libraries offer a wide range
of concurrency models, debugging support for applications that combine them has
not yet gained much attention. Record & replay aids debugging by
deterministically reproducing recorded bugs, but is typically designed for a
single concurrency model only. This paper proposes a practical
concurrency-model-agnostic record & replay approach for multi-paradigm
concurrent programs, i.e. applications that combine concurrency models. Our
approach traces high-level nondeterministic events by using a uniform
model-agnostic trace format and infrastructure. This enables orderingbased
record & replay support for a wide range of concurrency models, and thereby
enables debugging of applications that combine them. In addition, it allows
language implementors to add new concurrency models and reuse the
model-agnostic record & replay support. We argue that a
concurrency-model-agnostic record & replay is practical and enables advanced
debugging support for a wide range of concurrency models. The evaluation shows
that our approach is expressive and flexible enough to support record & replay
of applications using threads & locks, communicating event loops, communicating
sequential processes, software transactional memory and combinations of those
concurrency models. For the actor model, we reach recording performance
competitive with an optimized special-purpose record & replay solution. The
average recording overhead on the Savina actor benchmark suite is 10% (min. 0%,
max. 23%). The performance for other concurrency models and combinations
thereof is at a similar level. We believe our concurrency-model-agnostic
approach helps developers of applications that mix and match concurrency
models. We hope that this substrate inspires new tools and languages making
building and maintaining of multi-paradigm concurrent applications simpler and
safer.
","[{'version': 'v1', 'created': 'Fri, 26 Feb 2021 19:48:15 GMT'}]",2021-03-02,"[['Aumayr', 'Dominik', ''], ['Marr', 'Stefan', ''], ['Kaleba', 'Sophie', ''], ['Boix', 'Elisa Gonzalez', ''], ['Mössenböck', 'Hanspeter', '']]","['Concurrency', 'Record & Replay', 'Multi-Paradigm', 'Nondeterminism']"
6145,2105.02697,Bryar Hassan Dr.,"Bryar A. Hassan, Aram M. Ahmed, Soran A. Saeed, Awin A. Saeed","Evaluating e-Government Services in Kurdistan Institution for Strategic
  Studies and Scientific Research Using the EGOVSAT Model",,,10.24017/science.2016.1.2.2,,cs.IR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Office automation is an initiative used to digitally deliver services to
citizens, private and public sectors. It is used to digitally collect, store,
create, and manipulate office information as a need of accomplishing basic
tasks. Azya Office Automation has been implemented as a pilot project in
Kurdistan Institution for Strategic Studies and Scientific Research (KISSR)
since 2013. The efficiency of governance in Kurdistan Institution for Strategic
Studies and Scientific Research has been improved, thanks to its
implementation. The aims of this research paper is to evaluate user
satisfaction of this software and identify its significant predictors using
EGOVSAT Model. The user satisfaction of this model encompasses five main parts,
which are utility, reliability, efficiency, customization, and flexibility. For
that purpose, a detailed survey is conducted to measure the level of user
satisfaction. A total of sixteen questions have distributed among forty one
users of the software in KISSR. In order to evaluate the software, three
measurement have been used which are reliability test, regression analysis and
correlation analysis. The results indicate that the software is successful to a
decent extent based on user satisfaction feedbacks obtained by using EGOVSAT
Model.
","[{'version': 'v1', 'created': 'Thu, 6 May 2021 14:14:20 GMT'}]",2021-05-07,"[['Hassan', 'Bryar A.', ''], ['Ahmed', 'Aram M.', ''], ['Saeed', 'Soran A.', ''], ['Saeed', 'Awin A.', '']]","['Office Automation', 'e-Organization', 'User Satisfaction', 'EGOVSAT Model']"
6146,2103.15986,Jhonny Mertz,Jhonny Mertz and Ingrid Nunes,Tigris: a DSL and Framework for Monitoring Software Systems at Runtime,in Journal of Systems and Software,,10.1016/j.jss.2021.110963,,cs.SE,http://creativecommons.org/licenses/by-sa/4.0/,"  The understanding of the behavioral aspects of a software system is an
essential enabler for many software engineering activities, such as adaptation.
This involves collecting runtime data from the system so that it is possible to
analyze the collected data to guide actions upon the system. Consequently,
software monitoring imposes practical challenges because it is often done by
intercepting the system execution and recording gathered information. Such
monitoring may degrade the performance and disrupt the system execution to
unacceptable levels. In this paper, we introduce a two-phase monitoring
approach to support the monitoring step in adaptive systems. The first phase
collects lightweight coarse-grained information and identifies relevant parts
of the software that should be monitored in detail based on a provided
domain-specific language. This language is informed by a systematic literature
review. The second phase collects relevant and fine-grained information needed
for deciding whether and how to adapt the managed system. Our approach is
implemented as a framework, called Tigris, that can be seamlessly integrated
into existing software systems to support monitoring-based activities. To
validate our proposal, we instantiated Tigris to support an application-level
caching approach, which adapts caching decisions of a software system at
runtime to improve its performance.
","[{'version': 'v1', 'created': 'Mon, 29 Mar 2021 23:16:06 GMT'}]",2021-03-31,"[['Mertz', 'Jhonny', ''], ['Nunes', 'Ingrid', '']]","['Monitoring', 'logging', 'execution trace', 'sampling', 'caching', 'performance']"
6147,2103.05124,Piotr Szwed PhD,Piotr Szwed,Classification and Feature Transformation with Fuzzy Cognitive Maps,,,10.1016/j.asoc.2021.107271,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fuzzy Cognitive Maps (FCMs) are considered a soft computing technique
combining elements of fuzzy logic and recurrent neural networks. They found
multiple application in such domains as modeling of system behavior, prediction
of time series, decision making and process control. Less attention, however,
has been turned towards using them in pattern classification. In this work we
propose an FCM based classifier with a fully connected map structure. In
contrast to methods that expect reaching a steady system state during
reasoning, we chose to execute a few FCM iterations (steps) before collecting
output labels. Weights were learned with a gradient algorithm and logloss or
cross-entropy were used as the cost function. Our primary goal was to verify,
whether such design would result in a descent general purpose classifier, with
performance comparable to off the shelf classical methods. As the preliminary
results were promising, we investigated the hypothesis that the performance of
$d$-step classifier can be attributed to a fact that in previous $d-1$ steps it
transforms the feature space by grouping observations belonging to a given
class, so that they became more compact and separable. To verify this
hypothesis we calculated three clustering scores for the transformed feature
space. We also evaluated performance of pipelines built from FCM-based data
transformer followed by a classification algorithm. The standard statistical
analyzes confirmed both the performance of FCM based classifier and its
capability to improve data. The supporting prototype software was implemented
in Python using TensorFlow library.
","[{'version': 'v1', 'created': 'Mon, 8 Mar 2021 22:26:24 GMT'}]",2021-03-16,"[['Szwed', 'Piotr', '']]","['Fuzzy Cognitive Maps', 'classification', 'feature transformation']"
6148,2006.01321,Zhiping Xiao,"Zhiping Xiao, Weiping Song, Haoyan Xu, Zhicheng Ren, Yizhou Sun","TIMME: Twitter Ideology-detection via Multi-task Multi-relational
  Embedding","In proceedings of KDD'20, Applied Data Science Track; 9 pages, 2
  supplementary pages",,10.1145/3394486.3403275,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We aim at solving the problem of predicting people's ideology, or political
tendency. We estimate it by using Twitter data, and formalize it as a
classification problem. Ideology-detection has long been a challenging yet
important problem. Certain groups, such as the policy makers, rely on it to
make wise decisions. Back in the old days when labor-intensive survey-studies
were needed to collect public opinions, analyzing ordinary citizens' political
tendencies was uneasy. The rise of social medias, such as Twitter, has enabled
us to gather ordinary citizen's data easily. However, the incompleteness of the
labels and the features in social network datasets is tricky, not to mention
the enormous data size and the heterogeneousity. The data differ dramatically
from many commonly-used datasets, thus brings unique challenges. In our work,
first we built our own datasets from Twitter. Next, we proposed TIMME, a
multi-task multi-relational embedding model, that works efficiently on
sparsely-labeled heterogeneous real-world dataset. It could also handle the
incompleteness of the input features. Experimental results showed that TIMME is
overall better than the state-of-the-art models for ideology detection on
Twitter. Our findings include: links can lead to good classification outcomes
without text; conservative voice is under-represented on Twitter; follow is the
most important relation to predict ideology; retweet and mention enhance a
higher chance of like, etc. Last but not least, TIMME could be extended to
other datasets and tasks in theory.
","[{'version': 'v1', 'created': 'Tue, 2 Jun 2020 00:00:39 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Jun 2020 02:55:39 GMT'}, {'version': 'v3', 'created': 'Thu, 18 Jun 2020 05:08:45 GMT'}]",2020-06-19,"[['Xiao', 'Zhiping', ''], ['Song', 'Weiping', ''], ['Xu', 'Haoyan', ''], ['Ren', 'Zhicheng', ''], ['Sun', 'Yizhou', '']]","['multi-task learning', 'ideology detection', 'heterogeneous informationnetwork', 'social network analysis', 'graph convolutional networks']"
6149,1812.10194,Yugandhar Sarkale,"Saeed Nozhati, Yugandhar Sarkale, Edwin K. P. Chong, Bruce R.
  Ellingwood","Optimal Stochastic Dynamic Scheduling for Managing Community Recovery
  from Natural Hazards",Submitted to Reliability Engineering and System Safety,,10.1016/j.ress.2019.106627,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Following the occurrence of an extreme natural or man-made event, community
recovery management should aim at providing optimal restoration policies for a
community over a planning horizon. Calculating such optimal restoration polices
in the presence of uncertainty poses significant challenges for community
leaders. Stochastic scheduling for several interdependent infrastructure
systems is a difficult control problem with huge decision spaces. The Markov
decision process (MDP)-based optimization approach proposed in this study
incorporates different sources of uncertainties to compute the restoration
policies. The computation of optimal scheduling schemes using our method
employs the rollout algorithm, which provides an effective computational tool
for optimization problems dealing with real-world large-scale networks and
communities. We apply the proposed methodology to a realistic community
recovery problem, where different decision-making objectives are considered.
Our approach accommodates current restoration strategies employed in recovery
management. Our computational results indicate that the restoration policies
calculated using our techniques significantly outperform the current recovery
strategies. Finally, we study the applicability of our method to address
different risk attitudes of policymakers, which include risk-neutral and
risk-averse attitudes in the community recovery management.
","[{'version': 'v1', 'created': 'Wed, 26 Dec 2018 01:02:08 GMT'}]",2019-09-16,"[['Nozhati', 'Saeed', ''], ['Sarkale', 'Yugandhar', ''], ['Chong', 'Edwin K. P.', ''], ['Ellingwood', 'Bruce R.', '']]","['Approximate Dynamic Programming', 'Community-level Decision Making', 'Community Recovery Management', 'Markov Decision Process', 'Optimization', 'Rollout']"
6150,2005.09367,Lucas Woltmann,"Lucas Woltmann (1), Claudio Hartmann (1), Dirk Habich (1), Wolfgang
  Lehner (1) ((1) TU Dresden)","Machine Learning-based Cardinality Estimation in DBMS on Pre-Aggregated
  Data","10 pages, technical report",Datenbank-Spektrum 22 (2022) 1-13,10.1007/s13222-021-00400-z,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cardinality estimation is a fundamental task in database query processing and
optimization. As shown in recent papers, machine learning (ML)-based approaches
can deliver more accurate cardinality estimations than traditional approaches.
However, a lot of example queries have to be executed during the model training
phase to learn a data-dependent ML model leading to a very time-consuming
training phase. Many of those example queries use the same base data, have the
same query structure, and only differ in their predicates. Thus, index
structures appear to be an ideal optimization technique at first glance.
However, their benefit is limited. To speed up this model training phase, our
core idea is to determine a predicate-independent pre-aggregation of the base
data and to execute the example queries over this pre-aggregated data. Based on
this idea, we present a specific aggregate-enabled training phase for ML-based
cardinality estimation approaches in this paper. As we are going to show with
different workloads in our evaluation, we are able to achieve an average
speedup of 63 with our aggregate-enabled training phase.
","[{'version': 'v1', 'created': 'Tue, 19 May 2020 11:24:36 GMT'}]",2022-01-19,"[['Woltmann', 'Lucas', '', 'TU Dresden'], ['Hartmann', 'Claudio', '', 'TU Dresden'], ['Habich', 'Dirk', '', 'TU Dresden'], ['Lehner', 'Wolfgang', '', 'TU Dresden']]","['cardinality estimation', 'machine learning', 'database support', 'workload optimization; pre-aggregation']"
6151,2211.00722,Brandon Yushan Feng,"Brandon Yushan Feng, Susmija Jabbireddy, Amitabh Varshney","VIINTER: View Interpolation with Implicit Neural Representations of
  Images",SIGGRAPH Asia 2022,,10.1145/3550469.3555417,,cs.CV cs.GR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present VIINTER, a method for view interpolation by interpolating the
implicit neural representation (INR) of the captured images. We leverage the
learned code vector associated with each image and interpolate between these
codes to achieve viewpoint transitions. We propose several techniques that
significantly enhance the interpolation quality. VIINTER signifies a new way to
achieve view interpolation without constructing 3D structure, estimating camera
poses, or computing pixel correspondence. We validate the effectiveness of
VIINTER on several multi-view scenes with different types of camera layout and
scene composition. As the development of INR of images (as opposed to surface
or volume) has centered around tasks like image fitting and super-resolution,
with VIINTER, we show its capability for view interpolation and offer a
promising outlook on using INR for image manipulation tasks.
","[{'version': 'v1', 'created': 'Tue, 1 Nov 2022 19:51:30 GMT'}]",2022-11-03,"[['Feng', 'Brandon Yushan', ''], ['Jabbireddy', 'Susmija', ''], ['Varshney', 'Amitabh', '']]","['implicit neural representation', 'coordinate network', 'view synthesis']"
6152,2001.07938,Bruce Collie,"Philip Ginsbach, Bruce Collie, Michael F.P. O'Boyle",Automatically Harnessing Sparse Acceleration,Accepted to CC 2020,,10.1145/3377555.3377893,,cs.PF cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sparse linear algebra is central to many scientific programs, yet compilers
fail to optimize it well. High-performance libraries are available, but
adoption costs are significant. Moreover, libraries tie programs into
vendor-specific software and hardware ecosystems, creating non-portable code.
  In this paper, we develop a new approach based on our specification Language
for implementers of Linear Algebra Computations (LiLAC). Rather than requiring
the application developer to (re)write every program for a given library, the
burden is shifted to a one-off description by the library implementer. The
LiLAC-enabled compiler uses this to insert appropriate library routines without
source code changes.
  LiLAC provides automatic data marshaling, maintaining state between calls and
minimizing data transfers. Appropriate places for library insertion are
detected in compiler intermediate representation, independent of source
languages.
  We evaluated on large-scale scientific applications written in FORTRAN;
standard C/C++ and FORTRAN benchmarks; and C++ graph analytics kernels. Across
heterogeneous platforms, applications and data sets we show speedups of
1.1$\times$ to over 10$\times$ without user intervention.
","[{'version': 'v1', 'created': 'Wed, 22 Jan 2020 10:04:36 GMT'}]",2020-01-29,"[['Ginsbach', 'Philip', ''], ['Collie', 'Bruce', ''], [""O'Boyle"", 'Michael F. P.', '']]","['sparse linear algebra', 'domain specific languages', 'library integration', 'declarative langauges', 'data marshalling']"
6153,2104.08460,Kosuke Toda,"Kosuke Toda, Naomi Kuze, and Toshimitsu Ushio","Stability analysis and control of decision-making of miners in
  blockchain","8 pages, 4 figures, accepted to a journal",,10.1587/transfun.2021EAP1099,,cs.GT cs.CR,http://creativecommons.org/licenses/by/4.0/,"  To maintain blockchain-based services with ensuring its security, it is an
important issue how to decide a mining reward so that the number of miners
participating in the mining increases. We propose a dynamical model of
decision-making for miners using an evolutionary game approach and analyze the
stability of equilibrium points of the proposed model. The proposed model is
described by the 1st-order differential equation. So, it is simple but its
theoretical analysis gives an insight into the characteristics of the
decision-making. Through the analysis of the equilibrium points, we show the
transcritical bifurcations and hysteresis phenomena of the equilibrium points.
We also design a controller that determines the mining reward based on the
number of participating miners to stabilize the state that all miners
participate in the mining. Numerical simulation shows that there is a trade-off
in the choice of the design parameters.
","[{'version': 'v1', 'created': 'Sat, 17 Apr 2021 05:52:12 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Sep 2021 04:36:23 GMT'}]",2022-04-13,"[['Toda', 'Kosuke', ''], ['Kuze', 'Naomi', ''], ['Ushio', 'Toshimitsu', '']]","['Blockchain', 'Proof-of-work', 'Decisionmaking', 'Evolutionary Game', 'Bifurcation', 'Hysteresis', 'Feedback control']"
6154,2006.15259,Ramtin Afshar,"Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda",Reconstructing Biological and Digital Phylogenetic Trees in Parallel,,"Leibniz International Proceedings in Informatics (LIPICS) 173
  (2020) 3:1-3:24",10.4230/LIPIcs.ESA.2020.3,,cs.DS cs.DC cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the parallel query complexity of reconstructing
biological and digital phylogenetic trees from simple queries involving their
nodes. This is motivated from computational biology, data protection, and
computer security settings, which can be abstracted in terms of two parties, a
responder, Alice, who must correctly answer queries of a given type regarding a
degree-d tree, T, and a querier, Bob, who issues batches of queries, with each
query in a batch being independent of the others, so as to eventually infer the
structure of T. We show that a querier can efficiently reconstruct an n-node
degree-d tree, T, with a logarithmic number of rounds and quasilinear number of
queries, with high probability, for various types of queries, including
relative-distance queries and path queries. Our results are all asymptotically
optimal and improve the asymptotic (sequential) query complexity for one of the
problems we study. Moreover, through an experimental analysis using both
real-world and synthetic data, we provide empirical evidence that our
algorithms provide significant parallel speedups while also improving the total
query complexities for the problems we study.
","[{'version': 'v1', 'created': 'Sat, 27 Jun 2020 02:28:44 GMT'}, {'version': 'v2', 'created': 'Sun, 5 Jul 2020 20:40:23 GMT'}, {'version': 'v3', 'created': 'Wed, 9 Sep 2020 17:58:57 GMT'}]",2020-09-10,"[['Afshar', 'Ramtin', ''], ['Goodrich', 'Michael T.', ''], ['Matias', 'Pedro', ''], ['Osegueda', 'Martha C.', '']]","['Tree Reconstruction', 'Parallel Algorithms', 'Privacy', 'Phylogenetic Trees', 'DataStructures', 'Hierarchical Clustering']"
6155,2001.03000,Tom Vander Aa,Imen Chakroun and Tom Vander Aa and Thomas J. Ashby,"Guidelines for enhancing data locality in selected machine learning
  algorithms","European Commission Project: EPEEC - European joint Effort toward a
  Highly Productive Programming Environment for Heterogeneous Exascale
  Computing (EC-H2020-80151) This an extended version of arXiv:1904.11203","Intelligent Data Analysis, vol. 23, no. 5, pp. 1003-1020, 2019",10.3233/IDA-184287,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To deal with the complexity of the new bigger and more complex generation of
data, machine learning (ML) techniques are probably the first and foremost
used. For ML algorithms to produce results in a reasonable amount of time, they
need to be implemented efficiently. In this paper, we analyze one of the means
to increase the performances of machine learning algorithms which is exploiting
data locality. Data locality and access patterns are often at the heart of
performance issues in computing systems due to the use of certain hardware
techniques to improve performance. Altering the access patterns to increase
locality can dramatically increase performance of a given algorithm. Besides,
repeated data access can be seen as redundancy in data movement. Similarly,
there can also be redundancy in the repetition of calculations. This work also
identifies some of the opportunities for avoiding these redundancies by
directly reusing computation results. We start by motivating why and how a more
efficient implementation can be achieved by exploiting reuse in the memory
hierarchy of modern instruction set processors. Next we document the
possibilities of such reuse in some selected machine learning algorithms.
","[{'version': 'v1', 'created': 'Thu, 9 Jan 2020 14:16:40 GMT'}]",2020-01-10,"[['Chakroun', 'Imen', ''], ['Aa', 'Tom Vander', ''], ['Ashby', 'Thomas J.', '']]","['Increasing data locality', 'data redundancy and reuse', 'machine learning', 'supervisedlearners']"
6156,2009.12531,Ryoji Tanabe Dr.,Ryoji Tanabe,"Analyzing Adaptive Parameter Landscapes in Parameter Adaptation Methods
  for Differential Evolution","This is an accepted version of a paper published in the proceedings
  of GECCO 2020",,10.1145/3377930.3389820,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since the scale factor and the crossover rate significantly influence the
performance of differential evolution (DE), parameter adaptation methods (PAMs)
for the two parameters have been well studied in the DE community. Although
PAMs can sufficiently improve the effectiveness of DE, PAMs are poorly
understood (e.g., the working principle of PAMs). One of the difficulties in
understanding PAMs comes from the unclarity of the parameter space that
consists of the scale factor and the crossover rate. This paper addresses this
issue by analyzing adaptive parameter landscapes in PAMs for DE. First, we
propose a concept of an adaptive parameter landscape, which captures a moment
in a parameter adaptation process. For each iteration, each individual in the
population has its adaptive parameter landscape. Second, we propose a method of
analyzing adaptive parameter landscapes using a 1-step-lookahead greedy
improvement metric. Third, we examine adaptive parameter landscapes in PAMs by
using the proposed method. Results provide insightful information about PAMs in
DE.
","[{'version': 'v1', 'created': 'Sat, 26 Sep 2020 08:12:59 GMT'}]",2020-09-29,"[['Tanabe', 'Ryoji', '']]","['DE', 'parameter adaptation methods', 'landscape analysis']"
6157,1810.05547,Mohammad Amin Nabian,"Mohammad Amin Nabian, Hadi Meidani","Physics-Driven Regularization of Deep Neural Networks for Enhanced
  Engineering Design and Analysis",,"Journal of Computing and Information Science in Engineering, 20(1)
  (2020)",10.1115/1.4044507,,cs.LG cs.CE cs.NA math.AP math.NA stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce a physics-driven regularization method for
training of deep neural networks (DNNs) for use in engineering design and
analysis problems. In particular, we focus on prediction of a physical system,
for which in addition to training data, partial or complete information on a
set of governing laws is also available. These laws often appear in the form of
differential equations, derived from first principles, empirically-validated
laws, or domain expertise, and are usually neglected in data-driven prediction
of engineering systems. We propose a training approach that utilizes the known
governing laws and regularizes data-driven DNN models by penalizing divergence
from those laws. The first two numerical examples are synthetic examples, where
we show that in constructing a DNN model that best fits the measurements from a
physical system, the use of our proposed regularization results in DNNs that
are more interpretable with smaller generalization errors, compared to other
common regularization methods. The last two examples concern metamodeling for a
random Burgers' system and for aerodynamic analysis of passenger vehicles,
where we demonstrate that the proposed regularization provides superior
generalization accuracy compared to other common alternatives.
","[{'version': 'v1', 'created': 'Thu, 11 Oct 2018 17:12:34 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Oct 2019 22:27:24 GMT'}]",2019-10-17,"[['Nabian', 'Mohammad Amin', ''], ['Meidani', 'Hadi', '']]","['Deep neural networks', 'regularization', 'predictive modeling', 'data-driven prediction', 'design optimization', 'metamodels']"
6158,2104.00460,Lampis Alevizos,"Lampis Alevizos, Vinh Thong Ta, Max Hashem Eiza","Augmenting Zero Trust Architecture to Endpoints Using Blockchain: A
  State-of-The-Art Review","(1) Fixed the reference numbering (2) Fixed syntax errors,
  improvements (3) document re-structured",Security and Privacy. 2021;e191,10.1002/spy2.191,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  With the purpose of defending against lateral movement in today's borderless
networks, Zero Trust Architecture (ZTA) adoption is gaining momentum. With a
full scale ZTA implementation, it is unlikely that adversaries will be able to
spread through the network starting from a compromised endpoint. However, the
already authenticated and authorised session of a compromised endpoint can be
leveraged to perform limited, though malicious, activities ultimately rendering
the endpoints the Achilles heel of ZTA. To effectively detect such attacks,
distributed collaborative intrusion detection systems with an attack
scenario-based approach have been developed. Nonetheless, Advanced Persistent
Threats (APTs) have demonstrated their ability to bypass this approach with a
high success ratio. As a result, adversaries can pass undetected or potentially
alter the detection logging mechanisms to achieve a stealthy presence.
Recently, blockchain technology has demonstrated solid use cases in the cyber
security domain. In this paper, motivated by the convergence of ZTA and
blockchain-based intrusion detection and prevention, we examine how ZTA can be
augmented onto endpoints. Namely, we perform a state-of-the-art review of ZTA
models, real-world architectures with a focus on endpoints, and
blockchain-based intrusion detection systems. We discuss the potential of
blockchain's immutability fortifying the detection process and identify open
challenges as well as potential solutions and future directions.
","[{'version': 'v1', 'created': 'Thu, 1 Apr 2021 13:44:29 GMT'}, {'version': 'v2', 'created': 'Mon, 5 Apr 2021 22:31:44 GMT'}, {'version': 'v3', 'created': 'Mon, 12 Apr 2021 20:26:23 GMT'}, {'version': 'v4', 'created': 'Mon, 15 Nov 2021 20:50:34 GMT'}]",2021-11-17,"[['Alevizos', 'Lampis', ''], ['Ta', 'Vinh Thong', ''], ['Eiza', 'Max Hashem', '']]","['Zero trust architecture', 'blockchain', 'distributed']"
6159,1905.12763,Seung Yeob Shin,"Seung Yeob Shin and Shiva Nejati and Mehrdad Sabetzadeh and Lionel C.
  Briand and Chetan Arora and Frank Zimmer","Dynamic Adaptation of Software-defined Networks for IoT Systems: A
  Search-based Approach","This paper has been accepted at IEEE/ACM 15th International Symposium
  on Software Engineering for Adaptive and Self-Managing Systems (SEAMS 2020)",,10.1145/3387939.3391603,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The concept of Internet of Things (IoT) has led to the development of many
complex and critical systems such as smart emergency management systems.
IoT-enabled applications typically depend on a communication network for
transmitting large volumes of data in unpredictable and changing environments.
These networks are prone to congestion when there is a burst in demand, e.g.,
as an emergency situation is unfolding, and therefore rely on configurable
software-defined networks (SDN). In this paper, we propose a dynamic adaptive
SDN configuration approach for IoT systems. The approach enables resolving
congestion in real time while minimizing network utilization, data transmission
delays and adaptation costs. Our approach builds on existing work in dynamic
adaptive search-based software engineering (SBSE) to reconfigure an SDN while
simultaneously ensuring multiple quality of service criteria. We evaluate our
approach on an industrial national emergency management system, which is aimed
at detecting disasters and emergencies, and facilitating recovery and rescue
operations by providing first responders with a reliable communication
infrastructure. Our results indicate that (1) our approach is able to
efficiently and effectively adapt an SDN to dynamically resolve congestion, and
(2) compared to two baseline data forwarding algorithms that are static and
non-adaptive, our approach increases data transmission rate by a factor of at
least 3 and decreases data loss by at least 70%.
","[{'version': 'v1', 'created': 'Wed, 29 May 2019 22:44:39 GMT'}, {'version': 'v2', 'created': 'Fri, 15 May 2020 18:40:43 GMT'}]",2020-05-19,"[['Shin', 'Seung Yeob', ''], ['Nejati', 'Shiva', ''], ['Sabetzadeh', 'Mehrdad', ''], ['Briand', 'Lionel C.', ''], ['Arora', 'Chetan', ''], ['Zimmer', 'Frank', '']]","['Search-based Software Engineering', 'Dynamic Adaptive Systems', 'Internet of Things', 'Software-defined Networks']"
6160,2211.05199,George Djorgovski,"S. Lombeyda, S. G. Djorgovski, A. Tran, J. Liu, A. Noyes, and S.
  Fomina","An Open, Multi-Platform Software Architecture for Online Education in
  the Metaverse","4 pages, 3 figures; In The 27th International Conference on 3D Web
  Technology (Web3D 2022). ACM, New York, NY, USA",,10.1145/3564533.3564576,,cs.HC physics.ed-ph,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Use of online platforms for education is a vibrant and growing arena,
incorporating a variety of software platforms and technologies, including
various modalities of extended reality. We present our Enhanced Reality
Teaching Concierge, an open networking hub architected to enable efficient and
easy connectivity between a wide variety of services or applications to a wide
variety of clients, designed to showcase 3D for academic purposes across web
technologies, virtual reality, and even virtual worlds. The agnostic nature of
the system, paired with efficient architecture, and simple and open protocols
furnishes an ecosystem that can easily be tailored to maximize the innate
characteristics of each 3D display environment while sharing common data and
control systems with the ultimate goal of a seamless, expandable, nimble
education metaverse.
","[{'version': 'v1', 'created': 'Wed, 9 Nov 2022 21:13:24 GMT'}]",2022-11-11,"[['Lombeyda', 'S.', ''], ['Djorgovski', 'S. G.', ''], ['Tran', 'A.', ''], ['Liu', 'J.', ''], ['Noyes', 'A.', ''], ['Fomina', 'S.', '']]","['Education', 'Mixed Reality', 'Agnostic Web Clients']"
6161,2110.06015,Chiara Boldrini,"Kilian Ollivier, Chiara Boldrini, Andrea Passarella, Marco Conti","Structural invariants in individuals language use: the ""ego network"" of
  words","This work was partially funded by the following projects. European
  Union's Horizon 2020 research and innovation programme: SoBigData++ (No
  871042), HumaneAI-Net (No 952026), MARVEL (No 957337). Italian PON-MISE
  program: OK-INSAID project (No ARS01 00917)","In: Aref S. et al. (eds) Social Informatics. SocInfo 2020. Lecture
  Notes in Computer Science, vol 12467. Springer, Cham",10.1007/978-3-030-60975-7_20,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The cognitive constraints that humans exhibit in their social interactions
have been extensively studied by anthropologists, who have highlighted their
regularities across different types of social networks. We postulate that
similar regularities can be found in other cognitive processes, such as those
involving language production. In order to provide preliminary evidence for
this claim, we analyse a dataset containing tweets of a heterogeneous group of
Twitter users (regular users and professional writers). Leveraging a
methodology similar to the one used to uncover the well-established social
cognitive constraints, we find that a concentric layered structure (which we
call ego network of words, in analogy to the ego network of social
relationships) very well captures how individuals organise the words they use.
The size of the layers in this structure regularly grows (approximately 2-3
times with respect to the previous one) when moving outwards, and the two
penultimate external layers consistently account for approximately 60% and 30%
of the used words (the outermost layer contains 100% of the words),
irrespective of the number of the total number of layers of the user.
","[{'version': 'v1', 'created': 'Tue, 12 Oct 2021 13:59:08 GMT'}]",2021-10-13,"[['Ollivier', 'Kilian', ''], ['Boldrini', 'Chiara', ''], ['Passarella', 'Andrea', ''], ['Conti', 'Marco', '']]","['language', 'cognitive constraints', 'structural invariants']"
6162,2101.08102,Severin Kacianka,Severin Kacianka and Alexander Pretschner,Designing Accountable Systems,"accepted for publication at the ACM Conference on Fairness,
  Accountability, and Transparency (ACM FAccT) 2021",,10.1145/3442188.3445905,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accountability is an often called for property of technical systems. It is a
requirement for algorithmic decision systems, autonomous cyber-physical
systems, and for software systems in general. As a concept, accountability goes
back to the early history of Liberalism and is suggested as a tool to limit the
use of power. This long history has also given us many, often slightly
differing, definitions of accountability. The problem that software developers
now face is to understand what accountability means for their systems and how
to reflect it in a system's design. To enable the rigorous study of
accountability in a system, we need models that are suitable for capturing such
a varied concept. In this paper, we present a method to express and compare
different definitions of accountability using Structural Causal Models. We show
how these models can be used to evaluate a system's design and present a small
use case based on an autonomous car.
","[{'version': 'v1', 'created': 'Wed, 20 Jan 2021 12:59:03 GMT'}]",2021-04-30,"[['Kacianka', 'Severin', ''], ['Pretschner', 'Alexander', '']]","['Accountability', 'Structural Causal Models', 'Socio-Technical Systems']"
6163,2101.11987,Shankar Gangisetty,Sindhu Hegde and Shankar Gangisetty,"PIG-Net: Inception based Deep Learning Architecture for 3D Point Cloud
  Segmentation","11 pages, 5 Figures, 6 Tables, Accepted in Computers & Graphics
  Journal 2021",,10.1016/j.cag.2021.01.004,,cs.CV cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Point clouds, being the simple and compact representation of surface geometry
of 3D objects, have gained increasing popularity with the evolution of deep
learning networks for classification and segmentation tasks. Unlike human,
teaching the machine to analyze the segments of an object is a challenging task
and quite essential in various machine vision applications. In this paper, we
address the problem of segmentation and labelling of the 3D point clouds by
proposing a inception based deep network architecture called PIG-Net, that
effectively characterizes the local and global geometric details of the point
clouds. In PIG-Net, the local features are extracted from the transformed input
points using the proposed inception layers and then aligned by feature
transform. These local features are aggregated using the global average pooling
layer to obtain the global features. Finally, feed the concatenated local and
global features to the convolution layers for segmenting the 3D point clouds.
We perform an exhaustive experimental analysis of the PIG-Net architecture on
two state-of-the-art datasets, namely, ShapeNet [1] and PartNet [2]. We
evaluate the effectiveness of our network by performing ablation study.
","[{'version': 'v1', 'created': 'Thu, 28 Jan 2021 13:27:55 GMT'}]",2021-01-29,"[['Hegde', 'Sindhu', ''], ['Gangisetty', 'Shankar', '']]","['Point cloud segmentation', 'Inception module', 'Global average pooling', 'PointNet', 'ShapeNet', 'PartNet', 'MLP']"
6164,2002.05049,Christian Wachinger,"Christian Wachinger and Anna Rieckmann and Sebastian P\""olsterl",Detect and Correct Bias in Multi-Site Neuroimaging Datasets,,"Medical Image Analysis, 2020",10.1016/j.media.2020.101879,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The desire to train complex machine learning algorithms and to increase the
statistical power in association studies drives neuroimaging research to use
ever-larger datasets. The most obvious way to increase sample size is by
pooling scans from independent studies. However, simple pooling is often
ill-advised as selection, measurement, and confounding biases may creep in and
yield spurious correlations. In this work, we combine 35,320 magnetic resonance
images of the brain from 17 studies to examine bias in neuroimaging. In the
first experiment, Name That Dataset, we provide empirical evidence for the
presence of bias by showing that scans can be correctly assigned to their
respective dataset with 71.5% accuracy. Given such evidence, we take a closer
look at confounding bias, which is often viewed as the main shortcoming in
observational studies. In practice, we neither know all potential confounders
nor do we have data on them. Hence, we model confounders as unknown, latent
variables. Kolmogorov complexity is then used to decide whether the confounded
or the causal model provides the simplest factorization of the graphical model.
Finally, we present methods for dataset harmonization and study their ability
to remove bias in imaging features. In particular, we propose an extension of
the recently introduced ComBat algorithm to control for global variation across
image features, inspired by adjusting for population stratification in
genetics. Our results demonstrate that harmonization can reduce
dataset-specific information in image features. Further, confounding bias can
be reduced and even turned into a causal relationship. However, harmonziation
also requires caution as it can easily remove relevant subject-specific
information. Code is available at https://github.com/ai-med/Dataset-Bias.
","[{'version': 'v1', 'created': 'Wed, 12 Feb 2020 15:32:24 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Oct 2020 20:11:25 GMT'}]",2020-10-29,"[['Wachinger', 'Christian', ''], ['Rieckmann', 'Anna', ''], ['Pölsterl', 'Sebastian', '']]","['Bias', 'MRI', 'Big Data', 'Causal inference', 'Harmonization']"
6165,2010.10626,Kazem Meidani,"Kazem Meidani, Amir Barati Farimani","Data-driven Identification of 2D Partial Differential Equations using
  extracted physical features",,,10.1016/j.cma.2021.113831,,cs.LG physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many scientific phenomena are modeled by Partial Differential Equations
(PDEs). The development of data gathering tools along with the advances in
machine learning (ML) techniques have raised opportunities for data-driven
identification of governing equations from experimentally observed data. We
propose an ML method to discover the terms involved in the equation from
two-dimensional spatiotemporal data. Robust and useful physical features are
extracted from data samples to represent the specific behaviors imposed by each
mathematical term in the equation. Compared to the previous models, this idea
provides us with the ability to discover 2D equations with time derivatives of
different orders, and also to identify new underlying physics on which the
model has not been trained. Moreover, the model can work with small sets of
low-resolution data while avoiding numerical differentiations. The results
indicate robustness of the features extracted based on prior knowledge in
comparison to automatically detected features by a Three-dimensional
Convolutional Neural Network (3D CNN) given the same amounts of data. Although
particular PDEs are studied in this work, the idea of the proposed approach
could be extended for reliable identification of various PDEs.
","[{'version': 'v1', 'created': 'Tue, 20 Oct 2020 21:06:50 GMT'}]",2021-05-05,"[['Meidani', 'Kazem', ''], ['Farimani', 'Amir Barati', '']]","['Machine Learning', 'Partial Differential Equations', 'Scientific Data', 'Data-drivenmodeling', 'Feature Extraction']"
6166,1910.03964,Gerrit Gro{\ss}mann,"Gerrit Gro{\ss}mann, Luca Bortolussi, Verena Wolf",Rejection-Based Simulation of Non-Markovian Agents on Complex Networks,14 pages including 2 pages Appendix and 2 pages references,,10.1371/journal.pone.0241394,,cs.SI cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stochastic models in which agents interact with their neighborhood according
to a network topology are a powerful modeling framework to study the emergence
of complex dynamic patterns in real-world systems. Stochastic simulations are
often the preferred - sometimes the only feasible - way to investigate such
systems. Previous research focused primarily on Markovian models where the
random time until an interaction happens follows an exponential distribution.
In this work, we study a general framework to model systems where each agent is
in one of several states. Agents can change their state at random, influenced
by their complete neighborhood, while the time to the next event can follow an
arbitrary probability distribution. Classically, these simulations are hindered
by high computational costs of updating the rates of interconnected agents and
sampling the random residence times from arbitrary distributions. We propose a
rejection-based, event-driven simulation algorithm to overcome these
limitations. Our method over-approximates the instantaneous rates corresponding
to inter-event times while rejection events counterbalance these
over-approximations. We demonstrate the effectiveness of our approach on models
of epidemic and information spreading.
","[{'version': 'v1', 'created': 'Wed, 9 Oct 2019 13:06:58 GMT'}]",2021-01-27,"[['Großmann', 'Gerrit', ''], ['Bortolussi', 'Luca', ''], ['Wolf', 'Verena', '']]","['Gillespie Simulation', 'Complex Networks', 'Epidemic Modeling', 'Rejection Sampling', 'Multi-Agent System']"
6167,1805.03386,Roland Kluge,"Roland Kluge, Michael Stein, Gergely Varr\'o, Andy Sch\""urr, Matthias
  Hollick, Max M\""uhlh\""auser","A Systematic Approach to Constructing Incremental Topology Control
  Algorithms Using Graph Transformation","This document corresponds to the accepted manuscript of the
  referenced journal article","JVLC, vol. 38, 2017, pp. 47-83, ISSN 1045-926X",10.1016/j.jvlc.2016.10.003,,cs.SE cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Communication networks form the backbone of our society. Topology control
algorithms optimize the topology of such communication networks. Due to the
importance of communication networks, a topology control algorithm should
guarantee certain required consistency properties (e.g., connectivity of the
topology), while achieving desired optimization properties (e.g., a bounded
number of neighbors). Real-world topologies are dynamic (e.g., because nodes
join, leave, or move within the network), which requires topology control
algorithms to operate in an incremental way, i.e., based on the recently
introduced modifications of a topology. Visual programming and specification
languages are a proven means for specifying the structure as well as
consistency and optimization properties of topologies. In this paper, we
present a novel methodology, based on a visual graph transformation and graph
constraint language, for developing incremental topology control algorithms
that are guaranteed to fulfill a set of specified consistency and optimization
constraints. More specifically, we model the possible modifications of a
topology control algorithm and the environment using graph transformation
rules, and we describe consistency and optimization properties using graph
constraints. On this basis, we apply and extend a well-known constructive
approach to derive refined graph transformation rules that preserve these graph
constraints. We apply our methodology to re-engineer an established topology
control algorithm, kTC, and evaluate it in a network simulation study to show
the practical applicability of our approach
","[{'version': 'v1', 'created': 'Wed, 9 May 2018 06:49:16 GMT'}]",2018-05-10,"[['Kluge', 'Roland', ''], ['Stein', 'Michael', ''], ['Varró', 'Gergely', ''], ['Schürr', 'Andy', ''], ['Hollick', 'Matthias', ''], ['Mühlhäuser', 'Max', '']]","['model-driven software engineering', 'graph transformation', 'graph constraint', 'topology control', 'static analysis', 'correct by construction']"
6168,1508.05163,Yustinus Soelistio Eko,"Yustinus Eko Soelistio, Martinus Raditia Sigit Surendra","Simple Text Mining for Sentiment Analysis of Political Figure Using
  Naive Bayes Classifier Method","5 pages, published in the Proceedings of the 7th ICTS",,10.12962/p9772338185001.a18,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Text mining can be applied to many fields. One of the application is using
text mining in digital newspaper to do politic sentiment analysis. In this
paper sentiment analysis is applied to get information from digital news
articles about its positive or negative sentiment regarding particular
politician. This paper suggests a simple model to analyze digital newspaper
sentiment polarity using naive Bayes classifier method. The model uses a set of
initial data to begin with which will be updated when new information appears.
The model showed promising result when tested and can be implemented to some
other sentiment analysis problems.
","[{'version': 'v1', 'created': 'Fri, 21 Aug 2015 01:40:54 GMT'}]",2015-08-24,"[['Soelistio', 'Yustinus Eko', ''], ['Surendra', 'Martinus Raditia Sigit', '']]","['text mining', 'naïve Bayesian', 'sentiment analysis  1']"
6169,1709.10260,Ahmadreza Montazerolghaem,"Ahmadreza Montazerolghaem, Mohammad Hossein Yaghmaee, Alberto
  Leon-Garcia, Mahmoud Naghibzadeh, Farzad Tashtarian",A Load-Balanced Call Admission Controller for IMS Cloud Computing,,,10.1109/TNSM.2016.2572161,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network functions virtualization provides opportunities to design, deploy,
and manage networking services. It utilizes cloud computing virtualization
services that run on high-volume servers, switches, and storage hardware to
virtualize network functions. Virtualization techniques can be used in IP
multimedia subsystem (IMS) cloud computing to develop different networking
functions (e.g., load balancing and call admission control). IMS network
signaling happens through session initiation protocol (SIP). An open issue is
the control of overload that occurs when an SIP server lacks sufficient CPU and
memory resources to process all messages. This paper proposes a virtual load
balanced call admission controller (VLB-CAC) for the cloud-hosted SIP servers.
VLB-CAC determines the optimal call admission rates and signaling paths for
admitted calls along with the optimal allocation of CPU and memory resources of
the SIP servers. This optimal solution is derived through a new linear
programming model. This model requires some critical information of SIP servers
as input. Further, VLB-CAC is equipped with an autoscaler to overcome resource
limitations. The proposed scheme is implemented in smart applications on
virtual infrastructure (SAVI) which serves as a virtual testbed. An assessment
of the numerical and experimental results demonstrates the efficiency of the
proposed work.
","[{'version': 'v1', 'created': 'Fri, 29 Sep 2017 07:27:20 GMT'}]",2017-10-02,"[['Montazerolghaem', 'Ahmadreza', ''], ['Yaghmaee', 'Mohammad Hossein', ''], ['Leon-Garcia', 'Alberto', ''], ['Naghibzadeh', 'Mahmoud', ''], ['Tashtarian', 'Farzad', '']]","['SIP servers', 'Resource allocation', 'Cloud']"
6170,1410.3944,Yuantao Gu,"Xiaohan Wang, Pengfei Liu, Yuantao Gu",Local-set-based Graph Signal Reconstruction,"28 pages, 9 figures, 6 tables, journal manuscript",,10.1109/TSP.2015.2411217,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Signal processing on graph is attracting more and more attentions. For a
graph signal in the low-frequency subspace, the missing data associated with
unsampled vertices can be reconstructed through the sampled data by exploiting
the smoothness of the graph signal. In this paper, the concept of local set is
introduced and two local-set-based iterative methods are proposed to
reconstruct bandlimited graph signal from sampled data. In each iteration, one
of the proposed methods reweights the sampled residuals for different vertices,
while the other propagates the sampled residuals in their respective local
sets. These algorithms are built on frame theory and the concept of local sets,
based on which several frames and contraction operators are proposed. We then
prove that the reconstruction methods converge to the original signal under
certain conditions and demonstrate the new methods lead to a significantly
faster convergence compared with the baseline method. Furthermore, the
correspondence between graph signal sampling and time-domain irregular sampling
is analyzed comprehensively, which may be helpful to future works on graph
signals. Computer simulations are conducted. The experimental results
demonstrate the effectiveness of the reconstruction methods in various sampling
geometries, imprecise priori knowledge of cutoff frequency, and noisy
scenarios.
","[{'version': 'v1', 'created': 'Wed, 15 Oct 2014 07:05:27 GMT'}, {'version': 'v2', 'created': 'Sun, 18 Jan 2015 12:51:35 GMT'}, {'version': 'v3', 'created': 'Tue, 24 Feb 2015 12:10:32 GMT'}]",2015-06-23,"[['Wang', 'Xiaohan', ''], ['Liu', 'Pengfei', ''], ['Gu', 'Yuantao', '']]","['graph signal processing', 'irregular domain', 'graph signal sampling andreconstruction', 'frame theory', 'local set', 'bandlimited subspace']"
6171,2103.06767,Kostiantyn Khabarlak,"Kostiantyn Khabarlak, Larysa Koriashkina",Mobile Access Control System Based on RFID Tags And Facial Information,,"In Bulletin of National Technical University ""KhPI"". Series:
  System Analysis, Control and Information Technologies 2 (4) (2020): 69-74",10.20998/2079-0023.2020.02.12,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Better access control system security comes at a higher price. It many cases
the price is too high for small companies, leaving them vulnerable with cheap
and insecure systems. In this work we introduce an alternative access control
scheme, which improves access control security while lowering the cost. In the
proposed model, passive RFID tags are mounted near a turnstile or a smart door.
Tag reading and programming is done via NFC chip directly on the users
smartphone. To enhance security, together with smartphone-based authorization
we require the user to provide his photograph while entering a secure gate. The
photograph is then displayed on a monitoring dashboard side-by-side with the
registration picture, so that the two can be matched against each other. The
developed client-server application offers administrative system used to
configure gate access policies and monitor entrances with filters by access
time, user and gate. Also, we propose a mobile application that allows gate
registration and serves as a door unlock key. The suggested access control
model reduces installation costs required, while maintaining good security. The
system is fully wireless and uses cheap autonomous RFID-tags as its main
component. We hope, that the proposed system architecture will find its
application in small to medium-sized companies.
","[{'version': 'v1', 'created': 'Thu, 11 Mar 2021 16:23:45 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Jun 2022 08:26:29 GMT'}]",2022-06-23,"[['Khabarlak', 'Kostiantyn', ''], ['Koriashkina', 'Larysa', '']]","['Access Control System', 'RFID Tags', 'NFC', 'Mobile Access Control', 'Security', 'Person Identification']"
6172,2209.01484,Simon X. Yang,"Zhe Xu, Tao Yan, Simon X. Yang, S. Andrew Gadsden","A Hybrid Tracking Control Strategy for an Unmanned Underwater Vehicle
  Aided with Bioinspired Neural Dynamics",,,10.1049/csy2.12060,,cs.RO cs.AI cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  Tracking control has been a vital research topic in robotics. This paper
presents a novel hybrid control strategy for an unmanned underwater vehicle
(UUV) based on a bioinspired neural dynamics model. An enhanced backstepping
kinematic control strategy is first developed to avoid sharp velocity jumps and
provides smooth velocity commands relative to conventional methods. Then, a
novel sliding mode control is proposed, which is capable of providing smooth
and continuous torque commands free from chattering. In comparative studies,
the proposed combined hybrid control strategy has ensured control signals
smoothness, which is critical in real world applications, especially for an
unmanned underwater vehicle that needs to operate in complex underwater
environments.
","[{'version': 'v1', 'created': 'Sat, 3 Sep 2022 19:18:54 GMT'}]",2022-09-07,"[['Xu', 'Zhe', ''], ['Yan', 'Tao', ''], ['Yang', 'Simon X.', ''], ['Gadsden', 'S. Andrew', '']]","['Backstepping', 'Bioinspired neural dynamics', 'Sliding mode control', 'Unmanned underwater vehicle']"
6173,cs/0507021,Valmir Barbosa,"Renato C. Dutra, Valmir C. Barbosa",Finding routes in anonymous sensor networks,,"Information Processing Letters 98 (2006), 139-144",10.1016/j.ipl.2006.01.001,,cs.NI,,"  We consider networks of anonymous sensors and address the problem of
constructing routes for the delivery of information from a group of sensors in
response to a query by a sink. In order to circumvent the restrictions imposed
by anonymity, we rely on using the power level perceived by the sensors in the
query from the sink. We introduce a simple distributed algorithm to achieve the
building of routes to the sink and evaluate its performance by means of
simulations.
","[{'version': 'v1', 'created': 'Thu, 7 Jul 2005 16:28:13 GMT'}]",2007-05-23,"[['Dutra', 'Renato C.', ''], ['Barbosa', 'Valmir C.', '']]","['Distributed computing', 'Anonymous systems', 'Sensor networks']"
6174,1606.02442,Benedikt Eberhardinger,"Benedikt Eberhardinger, Gerrit Anders, Hella Seebach, Florian Siefert,
  Alexander Knapp, Wolfgang Reif",An Approach for Isolated Testing of Self-Organization Algorithms,"Preprint of Eberhardinger, B., Anders, G., Seebach, H., Siefert, F.,
  Knapp, A., Reif, W.: An approach for isolated testing of self-organization
  algorithms. In: de Lemos, R., et al. (eds.) Software Engineering for
  Self-Adaptive Systems III, LNCS, vol. 9640. Springer (2016)",,10.1007/978-3-319-74183-3_7,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide a systematic approach for testing self-organization (SO)
algorithms. The main challenges for such a testing domain are the strongly
ramified state space, the possible error masking, the interleaving of
mechanisms, and the oracle problem resulting from the main characteristics of
SO algorithms: their inherent non-deterministic behavior on the one hand, and
their dynamic environment on the other. A key to success for our SO algorithm
testing framework is automation, since it is rarely possible to cope with the
ramified state space manually. The test automation is based on a model-based
testing approach where probabilistic environment profiles are used to derive
test cases that are performed and evaluated on isolated SO algorithms. Besides
isolation, we are able to achieve representative test results with respect to a
specific application. For illustration purposes, we apply the concepts of our
framework to partitioning-based SO algorithms and provide an evaluation in the
context of an existing smart-grid application.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2016 08:13:32 GMT'}]",2018-01-24,"[['Eberhardinger', 'Benedikt', ''], ['Anders', 'Gerrit', ''], ['Seebach', 'Hella', ''], ['Siefert', 'Florian', ''], ['Knapp', 'Alexander', ''], ['Reif', 'Wolfgang', '']]","['Self-organizing Systems', 'Adaptive Systems', 'Self-organization Algorithms', 'Software Engineering', 'Quality Assurance', 'Software Test']"
6175,2202.08239,Vibhor Agarwal,"Vibhor Agarwal, Nishanth Sastry","""Way back then"": A Data-driven View of 25+ years of Web Evolution",To appear at The ACM Web Conference 2022,,10.1145/3485447.3512283,,cs.CY,http://creativecommons.org/licenses/by-sa/4.0/,"  Since the inception of the first web page three decades back, the Web has
evolved considerably, from static HTML pages in the beginning to the dynamic
web pages of today, from mainly the text-based pages of the 1990s to today's
multimedia rich pages, etc. Although much of this is known anecdotally, to our
knowledge, there is no quantitative documentation of the extent and timing of
these changes. This paper attempts to address this gap in the literature by
looking at the top 100 Alexa websites for over 25 years from the Internet
Archive or the ""Wayback Machine"", archive.org. We study the changes in
popularity, from Geocities and Yahoo! in the mid-to-late 1990s to the likes of
Google, Facebook, and Tiktok of today. We also look at different categories of
websites and their popularity over the years and find evidence for the decline
in popularity of news and education-related websites, which have been replaced
by streaming media and social networking sites. We explore the emergence and
relative prevalence of different MIME-types (text vs. image vs. video vs.
javascript and json) and study whether the use of text on the Internet is
declining.
","[{'version': 'v1', 'created': 'Wed, 16 Feb 2022 18:36:03 GMT'}]",2022-02-17,"[['Agarwal', 'Vibhor', ''], ['Sastry', 'Nishanth', '']]","['web history', 'internet archive', 'wayback machine', 'archive']"
6176,2110.01749,Xiao Li,"Xiao Li, Yutong Li, Nan Li, Anouck Girard, Ilya Kolmanovsky","Set-theoretic Localization for Mobile Robots with Infrastructure-based
  Sensing",,,10.1002/adc2.117,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce a set-theoretic approach for mobile robot
localization with infrastructure-based sensing. The proposed method computes
sets that over-bound the robot body and orientation under an assumption of
known noise bounds on the sensor and robot motion model. We establish
theoretical properties and computational approaches for this set-theoretic
localization approach and illustrate its application to an automated valet
parking example in simulations and to omnidirectional robot localization
problems in real-world experiments. We demonstrate that the set-theoretic
localization method can perform robustly against uncertainty set initialization
and sensor noises compared to the FastSLAM.
","[{'version': 'v1', 'created': 'Mon, 4 Oct 2021 23:43:23 GMT'}, {'version': 'v2', 'created': 'Sat, 27 Aug 2022 23:18:04 GMT'}]",2022-11-22,"[['Li', 'Xiao', ''], ['Li', 'Yutong', ''], ['Li', 'Nan', ''], ['Girard', 'Anouck', ''], ['Kolmanovsky', 'Ilya', '']]","['localization', 'set-membership', 'mobile robot']"
6177,1606.00502,EPTCS,"Nafi Diallo (NJIT, Newark NJ), Wided Ghardallou (FST, Tunis, Tunisia),
  Ali Mili (NJIT, Newark NJ)",Program Repair by Stepwise Correctness Enhancement,"In Proceedings PrePost 2016, arXiv:1605.08096","EPTCS 208, 2016, pp. 1-15",10.4204/EPTCS.208.1,,cs.SE cs.DM cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Relative correctness is the property of a program to be more-correct than
another with respect to a given specification. Whereas the traditional
definition of (absolute) correctness divides candidate program into two classes
(correct, and incorrect), relative correctness arranges candidate programs on
the richer structure of a partial ordering. In other venues we discuss the
impact of relative correctness on program derivation, and on program
verification. In this paper, we discuss the impact of relative correctness on
program testing; specifically, we argue that when we remove a fault from a
program, we ought to test the new program for relative correctness over the old
program, rather than for absolute correctness. We present analytical arguments
to support our position, as well as an empirical argument in the form of a
small program whose faults are removed in a stepwise manner as its relative
correctness rises with each fault removal until we obtain a correct program.
","[{'version': 'v1', 'created': 'Wed, 1 Jun 2016 23:59:02 GMT'}]",2016-06-03,"[['Diallo', 'Nafi', '', 'NJIT, Newark NJ'], ['Ghardallou', 'Wided', '', 'FST, Tunis, Tunisia'], ['Mili', 'Ali', '', 'NJIT, Newark NJ']]","['Program correctness', 'Relative correctness', 'Absolute correctness', 'Program repair']"
6178,2009.06687,Mohamed Nafzi,"Mohamed Nafzi, Michael Brauckmann, Tobias Glasmachers",Methods of the Vehicle Re-identification,"Proceedings of the 2020 Intelligent Systems Conference (IntelliSys)
  Volume 1-3, 3-4 Sep. 2020 Amsterdam",,10.1007/978-3-030-55180-3_38,,cs.CV,http://creativecommons.org/publicdomain/zero/1.0/,"  Most of researchers use the vehicle re-identification based on
classification. This always requires an update with the new vehicle models in
the market. In this paper, two types of vehicle re-identification will be
presented. First, the standard method, which needs an image from the search
vehicle. VRIC and VehicleID data set are suitable for training this module. It
will be explained in detail how to improve the performance of this method using
a trained network, which is designed for the classification. The second method
takes as input a representative image of the search vehicle with similar
make/model, released year and colour. It is very useful when an image from the
search vehicle is not available. It produces as output a shape and a colour
features. This could be used by the matching across a database to re-identify
vehicles, which look similar to the search vehicle. To get a robust module for
the re-identification, a fine-grained classification has been trained, which
its class consists of four elements: the make of a vehicle refers to the
vehicle's manufacturer, e.g. Mercedes-Benz, the model of a vehicle refers to
type of model within that manufacturer's portfolio, e.g. C Class, the year
refers to the iteration of the model, which may receive progressive alterations
and upgrades by its manufacturer and the perspective of the vehicle. Thus, all
four elements describe the vehicle at increasing degree of specificity. The aim
of the vehicle shape classification is to classify the combination of these
four elements. The colour classification has been separately trained. The
results of vehicle re-identification will be shown. Using a developed tool, the
re-identification of vehicles on video images and on controlled data set will
be demonstrated. This work was partially funded under the grant.
","[{'version': 'v1', 'created': 'Mon, 14 Sep 2020 18:50:50 GMT'}]",2020-09-16,"[['Nafzi', 'Mohamed', ''], ['Brauckmann', 'Michael', ''], ['Glasmachers', 'Tobias', '']]","['Vehicle Re-identification', 'Mix-Mode', 'CNN', 'Shape and Colour classification']"
6179,2101.02352,JianGang Liu,"Yao Chen, Jiangang Liu, Zhe Zhang, Shiping Wen, Wenjun Xiong","M\""{o}biusE: Knowledge Graph Embedding on M\""{o}bius Ring",,,10.1016/j.knosys.2021.107181,,cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we propose a novel Knowledge Graph Embedding (KGE) strategy,
called M\""{o}biusE, in which the entities and relations are embedded to the
surface of a M\""{o}bius ring. The proposition of such a strategy is inspired by
the classic TorusE, in which the addition of two arbitrary elements is subject
to a modulus operation. In this sense, TorusE naturally guarantees the critical
boundedness of embedding vectors in KGE. However, the nonlinear property of
addition operation on Torus ring is uniquely derived by the modulus operation,
which in some extent restricts the expressiveness of TorusE. As a further
generalization of TorusE, M\""{o}biusE also uses modulus operation to preserve
the closeness of addition operation on it, but the coordinates on M\""{o}bius
ring interacts with each other in the following way: {\em \color{red} any
vector on the surface of a M\""{o}bius ring moves along its parametric trace
will goes to the right opposite direction after a cycle}. Hence, M\""{o}biusE
assumes much more nonlinear representativeness than that of TorusE, and in turn
it generates much more precise embedding results. In our experiments,
M\""{o}biusE outperforms TorusE and other classic embedding strategies in
several key indicators.
","[{'version': 'v1', 'created': 'Thu, 7 Jan 2021 03:35:06 GMT'}]",2021-07-06,"[['Chen', 'Yao', ''], ['Liu', 'Jiangang', ''], ['Zhang', 'Zhe', ''], ['Wen', 'Shiping', ''], ['Xiong', 'Wenjun', '']]","['M¨obius ring', 'Torus ring', 'Knowledge graph', 'Embedding']"
6180,2112.01250,Rushit Dave,"Rushit Dave, Naeem Seliya, Nyle Siddiqui","The Benefits of Edge Computing in Healthcare, Smart Cities, and IoT",,"Journal of Computer Sciences and Applications. 2021, 9(1), 23-34",10.12691/jcsa-9-1-3,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Recent advancements in technology now allow for the generation of massive
quantities of data. There is a growing need to transmit this data faster and
more securely such that it cannot be accessed by malicious individuals. Edge
computing has emerged in previous research as a method capable of improving
data transmission times and security before the data ends up in the cloud. Edge
computing has an impressive transmission speed based on fifth generation (5G)
communication which transmits data with low latency and high bandwidth. While
edge computing is sufficient to extract important features from the raw data to
prevent large amounts of data requiring excessive bandwidth to be transmitted,
cloud computing is used for the computational processes required for developing
algorithms and modeling the data. Edge computing also improves the quality of
the user experience by saving time and integrating quality of life (QoL)
features. QoL features are important for the healthcare sector by helping to
provide real-time feedback of data produced by healthcare devices back to
patients for a faster recovery. Edge computing has better energy efficiency,
can reduce the electricity cost, and in turn help people reduce their living
expenses. This paper will take a detailed look into edge computing applications
around Internet of Things (IoT) devices, smart city infrastructure, and
benefits to healthcare.
","[{'version': 'v1', 'created': 'Mon, 22 Nov 2021 07:29:21 GMT'}]",2021-12-03,"[['Dave', 'Rushit', ''], ['Seliya', 'Naeem', ''], ['Siddiqui', 'Nyle', '']]","['edge computing', 'Internet of Things (IoT)', 'smart city', 'healthcare', 'cloud computing']"
6181,2001.10169,Kumar Shikhar Deep,"Kumar Shikhar Deep, Asif Ekbal, Pushpak Bhattacharyya",A Deep Neural Framework for Contextual Affect Detection,"12 pages, 5 tables and 3 figures. Accepted in ICONIP 2019
  (International Conference on Neural Information Processing) Published in
  Lecture Notes in Computer Science, vol 11955. Springer, Cham
  https://link.springer.com/chapter/10.1007/978-3-030-36718-3_34",LNCS 11955 (2019) 398-409,10.1007/978-3-030-36718-3_34,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A short and simple text carrying no emotion can represent some strong
emotions when reading along with its context, i.e., the same sentence can
express extreme anger as well as happiness depending on its context. In this
paper, we propose a Contextual Affect Detection (CAD) framework which learns
the inter-dependence of words in a sentence, and at the same time the
inter-dependence of sentences in a dialogue. Our proposed CAD framework is
based on a Gated Recurrent Unit (GRU), which is further assisted by contextual
word embeddings and other diverse hand-crafted feature sets. Evaluation and
analysis suggest that our model outperforms the state-of-the-art methods by
5.49% and 9.14% on Friends and EmotionPush dataset, respectively.
","[{'version': 'v1', 'created': 'Tue, 28 Jan 2020 05:03:15 GMT'}]",2020-02-06,"[['Deep', 'Kumar Shikhar', ''], ['Ekbal', 'Asif', ''], ['Bhattacharyya', 'Pushpak', '']]","['Emotion Classification', 'Emotion in Dialogue', 'ContextualWord Embedding']"
6182,1904.05533,Murray Tannock,Murray Tannock and Michael Albert,Prolific Compositions,,"Discrete Mathematics & Theoretical Computer Science, Vol. 21 no.
  2, Permutation Patters 2018, Permutation Patterns (December 13, 2019)
  dmtcs:5930",10.23638/DMTCS-21-2-10,,cs.DM math.CO,http://creativecommons.org/licenses/by/4.0/,"  Under what circumstances might every extension of a combinatorial structure
contain more copies of another one than the original did? This property, which
we call prolificity, holds universally in some cases (e.g., finite linear
orders) and only trivially in others (e.g., permutations). Integer
compositions, or equivalently layered permutations, provide a middle ground. In
that setting, there are prolific compositions for a given pattern if and only
if that pattern begins and ends with 1. For each pattern, there is an easily
constructed automaton that recognises prolific compositions for that pattern.
Some instances where there is a unique minimal prolific composition for a
pattern are classified.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2019 04:58:41 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Oct 2019 21:26:30 GMT'}, {'version': 'v3', 'created': 'Mon, 4 Nov 2019 03:31:27 GMT'}, {'version': 'v4', 'created': 'Mon, 2 Dec 2019 02:05:13 GMT'}]",2021-02-10,"[['Tannock', 'Murray', ''], ['Albert', 'Michael', '']]","['patterns', 'occurrences', 'compositions']"
6183,2205.15631,Andreas Malcher,"Martin Kutrib and Andreas Malcher and Carlo Mereghetti and Beatrice
  Palano","Computational and Descriptional Power of Nondeterministic Iterated
  Uniform Finite-State Transducers",,Fundamenta Informaticae 185 (2022) 337-356,10.3233/FI-222113,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An iterated uniform finite-state transducer (IUFST) runs the same
length-preserving transduction, starting with a sweep on the input string and
then iteratively sweeping on the output of the previous sweep. The IUFST
accepts the input string by halting in an accepting state at the end of a
sweep. We consider both the deterministic (IUFST) and nondeterministic (NIUFST)
version of this device. We show that constant sweep bounded IUFSTs and NIUFSTs
accept all and only regular languages. We study the state complexity of
removing nondeterminism as well as sweeps on constant sweep bounded NIUFSTs,
the descriptional power of constant sweep bounded IUFSTs and NIUFSTs with
respect to classical models of finite-state automata, and the computational
complexity of several decidability questions. Then, we focus on non-constant
sweep bounded devices, proving the existence of a proper infinite nonregular
language hierarchy depending on the sweep complexity both in the deterministic
and nondeterministic case. Though NIUFSTss are ""one-way"" devices we show that
they characterize the class of context-sensitive languages, that is, the
complexity class DSpace(lin). Finally, we show that the nondeterministic
devices are more powerful than their deterministic variant for a sublinear
number of sweeps that is at least logarithmic.
","[{'version': 'v1', 'created': 'Tue, 31 May 2022 09:19:22 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Jun 2022 05:51:48 GMT'}]",2022-06-07,"[['Kutrib', 'Martin', ''], ['Malcher', 'Andreas', ''], ['Mereghetti', 'Carlo', ''], ['Palano', 'Beatrice', '']]","['Iterated transducers', 'nondeterminism', 'descriptional complexity', 'sweep complexity', 'language hierarchies']"
6184,2301.01256,Hocine Cherifi,"Ahmed Ibnoulouafi, Mohamed El Haziti and Hocine Cherifi","M-Centrality: identifying key nodes based on global position and local
  degree variation",,"Journal of Statistical Mechanics: Theory and Experiment, Volume
  2018, July 2018",10.1088/1742-5468/aace08,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identifying influential nodes in a network is a major issue due to the great
deal of applications concerned, such as disease spreading and rumor dynamics.
That is why, a plethora of centrality measures has emerged over the years in
order to rank nodes according to their topological importance in the network.
Local metrics such as degree centrality make use of a very limited information
and are easy to compute. Global metrics such as betweenness centrality exploit
the information of the whole network structure at the cost of a very high
computational complexity. Recent works have shown that combining multiple
metrics is a promising strategy to quantify the node's influential ability. Our
work is in this line. In this paper, we introduce a multi-attributes centrality
measure called M-Centrality that combines the information on the position of
the node in the network with the local information on its nearest neighborhood.
The position is measured by the K-shell decomposition, and the degree variation
in the neighborhood of the node quantifies the influence of the local context.
In order to examine the performances of the proposed measure, we conduct
experiments on small and large scale real-world networks from the perspectives
of transmission dynamics and network connectivity. According to the empirical
results, the M-Centrality outperforms its alternatives in identifying both
influential spreaders and nodes essential to maintain the network connectivity.
In addition, its low computational complexity makes it easily applied to large
scale networks.
","[{'version': 'v1', 'created': 'Tue, 3 Jan 2023 17:54:59 GMT'}]",2023-01-04,"[['Ibnoulouafi', 'Ahmed', ''], ['Haziti', 'Mohamed El', ''], ['Cherifi', 'Hocine', '']]","['Complex networks', 'Centrality measures', 'Influential nodes']"
6185,1908.04560,Ren\'e B{\o}dker Christensen,Ren\'e B{\o}dker Christensen and Olav Geil,On Steane-Enlargement of Quantum Codes from Cartesian Product Point Sets,12 pages,,10.1007/s11128-020-02691-9,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we study quantum error-correcting codes obtained by using
Steane-enlargement. We apply this technique to certain codes defined from
Cartesian products previously considered by Galindo et al. in [4]. We give
bounds on the dimension increase obtained via enlargement, and additionally
give an algorithm to compute the true increase. A number of examples of codes
are provided, and their parameters are compared to relevant codes in the
literature, which shows that the parameters of the enlarged codes are
advantageous. Furthermore, comparison with the Gilbert-Varshamov bound for
stabilizer quantum codes shows that several of the enlarged codes match or
exceed the parameters promised by the bound.
","[{'version': 'v1', 'created': 'Tue, 13 Aug 2019 09:32:25 GMT'}]",2020-05-26,"[['Christensen', 'René Bødker', ''], ['Geil', 'Olav', '']]","['Cartesian product', 'Quantum code', 'Steane-enlargement', 'Finite fields']"
6186,1909.09432,SeyedAbolghasem Mirroshandel,"Erfan Miahi, Seyed Abolghasem Mirroshandel, Alexis Nasr","Genetic Neural Architecture Search for automatic assessment of human
  sperm images",,"Expert Systems with Applications, 2021",10.1016/j.eswa.2021.115937,,cs.LG cs.CV cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Male infertility is a disease which affects approximately 7% of men. Sperm
morphology analysis (SMA) is one of the main diagnosis methods for this
problem. Manual SMA is an inexact, subjective, non-reproducible, and hard to
teach process. As a result, in this paper, we introduce a novel automatic SMA
based on a neural architecture search algorithm termed Genetic Neural
Architecture Search (GeNAS). For this purpose, we used a collection of images
called MHSMA dataset contains 1,540 sperm images which have been collected from
235 patients with infertility problems. GeNAS is a genetic algorithm that acts
as a meta-controller which explores the constrained search space of plain
convolutional neural network architectures. Every individual of the genetic
algorithm is a convolutional neural network trained to predict morphological
deformities in different segments of human sperm (head, vacuole, and acrosome),
and its fitness is calculated by a novel proposed method named GeNAS-WF
especially designed for noisy, low resolution, and imbalanced datasets. Also, a
hashing method is used to save each trained neural architecture fitness, so we
could reuse them during fitness evaluation and speed up the algorithm. Besides,
in terms of running time and computation power, our proposed architecture
search method is far more efficient than most of the other existing neural
architecture search algorithms. Additionally, other proposed methods have been
evaluated on balanced datasets, whereas GeNAS is built specifically for noisy,
low quality, and imbalanced datasets which are common in the field of medical
imaging. In our experiments, the best neural architecture found by GeNAS has
reached an accuracy of 91.66%, 77.33%, and 77.66% in the vacuole, head, and
acrosome abnormality detection, respectively. In comparison to other proposed
algorithms for MHSMA dataset, GeNAS achieved state-of-the-art results.
","[{'version': 'v1', 'created': 'Fri, 20 Sep 2019 11:25:05 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Sep 2020 11:12:35 GMT'}]",2021-10-01,"[['Miahi', 'Erfan', ''], ['Mirroshandel', 'Seyed Abolghasem', ''], ['Nasr', 'Alexis', '']]","['Human Sperm Morphometry', 'Infertility', 'Genetic Algorithm', 'Deep Learning', 'NeuralArchitecture Search']"
6187,2211.06386,Wishnu Prasetya,"I. S. W. B. Prasetya, Fernando Pastor Ric\'os, Fitsum Kifetew, Davide
  Prandi, Samira Shirzadeh-hajimahmood, Tanja E. J. Vos, Premysl Paska, Karel
  Hovorska, Raihana Ferdous, Angelo Susi, Joseph Davidson",An Agent-based Approach to Automated Game Testing: an Experience Report,,,10.1145/3548659.3561305,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Computer games are very challenging to handle for traditional automated
testing algorithms. In this paper we will look at intelligent agents as a
solution. Agents are suitable for testing games, since they are reactive and
able to reason about their environment to decide the action they want to take.
This paper presents the experience of using an agent-based automated testing
framework called \ivxr\ to test computer games. Three games will be discussed,
including a sophisticated 3D game called Space Engineers. We will show how the
framework can be used in different ways, either directly to drive a test agent,
or as an intelligent functionality that can be driven by a traditional
automated testing algorithm such as a random algorithm or a model based testing
algorithm.
","[{'version': 'v1', 'created': 'Fri, 11 Nov 2022 18:08:42 GMT'}]",2022-11-14,"[['Prasetya', 'I. S. W. B.', ''], ['Ricós', 'Fernando Pastor', ''], ['Kifetew', 'Fitsum', ''], ['Prandi', 'Davide', ''], ['Shirzadeh-hajimahmood', 'Samira', ''], ['Vos', 'Tanja E. J.', ''], ['Paska', 'Premysl', ''], ['Hovorska', 'Karel', ''], ['Ferdous', 'Raihana', ''], ['Susi', 'Angelo', ''], ['Davidson', 'Joseph', '']]","['automated game testing', 'agent-based testing', 'model-based gametesting', '3D game testing']"
6188,2101.08166,Panagiotis Kourtesis P.K.,"Panagiotis Kourtesis, Danai Korre, Simona Collina, Leonidas A.A.
  Doumas, and Sarah E. MacPherson","Guidelines for the Development of Immersive Virtual Reality Software for
  Cognitive Neuroscience and Neuropsychology: The Development of Virtual
  Reality Everyday Assessment Lab (VR-EAL)",Published in Frontier in Computer Science,"Frontiers in Computer Science, 1, p.12 (2020)",10.3389/fcomp.2019.00012,,cs.HC cs.CY cs.MM,http://creativecommons.org/licenses/by/4.0/,"  Virtual reality (VR) head-mounted displays (HMD) appear to be effective
research tools, which may address the problem of ecological validity in
neuropsychological testing. However, their widespread implementation is
hindered by VR induced symptoms and effects (VRISE) and the lack of skills in
VR software development. This study offers guidelines for the development of VR
software in cognitive neuroscience and neuropsychology, by describing and
discussing the stages of the development of Virtual Reality Everyday Assessment
Lab (VR-EAL), the first neuropsychological battery in immersive VR. Techniques
for evaluating cognitive functions within a realistic storyline are discussed.
The utility of various assets in Unity, software development kits, and other
software are described so that cognitive scientists can overcome challenges
pertinent to VRISE and the quality of the VR software. In addition, this pilot
study attempts to evaluate VR-EAL in accordance with the necessary criteria for
VR software for research purposes. The VR neuroscience questionnaire (VRNQ;
Kourtesis et al., 2019b) was implemented to appraise the quality of the three
versions of VR-EAL in terms of user experience, game mechanics, in-game
assistance, and VRISE. Twenty-five participants aged between 20 and 45 years
with 12-16 years of full-time education evaluated various versions of VR-EAL.
The final version of VR-EAL achieved high scores in every sub-score of the VRNQ
and exceeded its parsimonious cut-offs. It also appeared to have better in-game
assistance and game mechanics, while its improved graphics substantially
increased the quality of the user experience and almost eradicated VRISE. The
results substantially support the feasibility of the development of effective
VR research and clinical software without the presence of VRISE during a
60-minute VR session.
","[{'version': 'v1', 'created': 'Wed, 20 Jan 2021 14:55:57 GMT'}]",2021-01-21,"[['Kourtesis', 'Panagiotis', ''], ['Korre', 'Danai', ''], ['Collina', 'Simona', ''], ['Doumas', 'Leonidas A. A.', ''], ['MacPherson', 'Sarah E.', '']]","['Virtual Reality1', 'Prospective Memory2', 'Episodic Memory3', 'Cybersickness4', 'Executive Function5', 'Neuropsychology6', 'Everyday Functioning7', 'Attention8']"
6189,1702.07502,Borislav Stoyanov,"Borislav Stoyanov, Krzysztof Szczypiorski, Krasimir Kordov",Yet Another Pseudorandom Number Generator,"5 pages, 7 figures; to be published in International Journal of
  Electronics and Telecommunications, vol.63, no.4",,10.1515/eletel-2017-0026,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel pseudorandom number generator based on R\""ossler attractor
and bent Boolean function. We estimated the output bits properties by number of
statistical tests. The results of the cryptanalysis show that the new
pseudorandom number generation scheme provides a high level of data security.
","[{'version': 'v1', 'created': 'Fri, 24 Feb 2017 09:11:56 GMT'}]",2018-07-31,"[['Stoyanov', 'Borislav', ''], ['Szczypiorski', 'Krzysztof', ''], ['Kordov', 'Krasimir', '']]","['R¨ossler attractor', 'bent Boolean function', 'pseudorandom number generator']"
6190,2301.10191,Kuldeep S. Meel,Sourav Chakraborty and N.V. Vinodchandran and Kuldeep S. Meel,Distinct Elements in Streams: An Algorithm for the (Text) Book,"The earlier version of the paper, as published at ESA-22, contained
  error in the proof of Claim 4. The current revised version fixes the error in
  the proof. The authors decided to forgo the old convention of alphabetical
  ordering of authors in favor of a randomized ordering, denoted by
  \textcircled{r}","In 30th Annual European Symposium on Algorithms (ESA 2022).
  Schloss Dagstuhl-Leibniz-Zentrum f\""ur Informatik, 2022",10.4230/LIPIcs.ESA.2022.34,,cs.DS cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a data stream $\mathcal{D} = \langle a_1, a_2, \ldots, a_m \rangle$ of
$m$ elements where each $a_i \in [n]$, the Distinct Elements problem is to
estimate the number of distinct elements in $\mathcal{D}$.
  Distinct Elements has been a subject of theoretical and empirical
investigations over the past four decades resulting in space optimal algorithms
for it.
  All the current state-of-the-art algorithms are, however, beyond the reach of
an undergraduate textbook owing to their reliance on the usage of notions such
as pairwise independence and universal hash functions. We present a simple,
intuitive, sampling-based space-efficient algorithm whose description and the
proof are accessible to undergraduates with the knowledge of basic probability
theory.
","[{'version': 'v1', 'created': 'Tue, 24 Jan 2023 18:08:03 GMT'}]",2023-01-25,"[['Chakraborty', 'Sourav', ''], ['Vinodchandran', 'N. V.', ''], ['Meel', 'Kuldeep S.', '']]","['F0 Estimation', 'Streaming', 'Sampling']"
6191,2202.08934,Leandro Passos,"Leandro Aparecido Passos, Danilo S. Jodas, Luiz C. F. Ribeiro, Marco
  Akio, Andre Nunes de Souza, Jo\~ao Paulo Papa",Handling Imbalanced Datasets Through Optimum-Path Forest,,,10.1016/j.knosys.2022.108445,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  In the last decade, machine learning-based approaches became capable of
performing a wide range of complex tasks sometimes better than humans,
demanding a fraction of the time. Such an advance is partially due to the
exponential growth in the amount of data available, which makes it possible to
extract trustworthy real-world information from them. However, such data is
generally imbalanced since some phenomena are more likely than others. Such a
behavior yields considerable influence on the machine learning model's
performance since it becomes biased on the more frequent data it receives.
Despite the considerable amount of machine learning methods, a graph-based
approach has attracted considerable notoriety due to the outstanding
performance over many applications, i.e., the Optimum-Path Forest (OPF). In
this paper, we propose three OPF-based strategies to deal with the imbalance
problem: the $\text{O}^2$PF and the OPF-US, which are novel approaches for
oversampling and undersampling, respectively, as well as a hybrid strategy
combining both approaches. The paper also introduces a set of variants
concerning the strategies mentioned above. Results compared against several
state-of-the-art techniques over public and private datasets confirm the
robustness of the proposed approaches.
","[{'version': 'v1', 'created': 'Thu, 17 Feb 2022 23:24:49 GMT'}]",2022-02-21,"[['Passos', 'Leandro Aparecido', ''], ['Jodas', 'Danilo S.', ''], ['Ribeiro', 'Luiz C. F.', ''], ['Akio', 'Marco', ''], ['de Souza', 'Andre Nunes', ''], ['Papa', 'João Paulo', '']]","['Imbalanced data', 'Oversampling', 'Undersampling', 'Optimum-Path']"
6192,1410.5242,Moritz Kreutzer,"Moritz Kreutzer, Georg Hager, Gerhard Wellein, Andreas Pieper, Andreas
  Alvermann, Holger Fehske","Performance Engineering of the Kernel Polynomial Method on Large-Scale
  CPU-GPU Systems","10 pages, 12 figures","Proceedings of the 2015 IEEE International Parallel and
  Distributed Processing Symposium (IPDPS) 417-426",10.1109/IPDPS.2015.76,,cs.CE cond-mat.mes-hall cs.DC cs.PF physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Kernel Polynomial Method (KPM) is a well-established scheme in quantum
physics and quantum chemistry to determine the eigenvalue density and spectral
properties of large sparse matrices. In this work we demonstrate the high
optimization potential and feasibility of peta-scale heterogeneous CPU-GPU
implementations of the KPM. At the node level we show that it is possible to
decouple the sparse matrix problem posed by KPM from main memory bandwidth both
on CPU and GPU. To alleviate the effects of scattered data access we combine
loosely coupled outer iterations with tightly coupled block sparse matrix
multiple vector operations, which enables pure data streaming. All
optimizations are guided by a performance analysis and modelling process that
indicates how the computational bottlenecks change with each optimization step.
Finally we use the optimized node-level KPM with a hybrid-parallel framework to
perform large scale heterogeneous electronic structure calculations for novel
topological materials on a petascale-class Cray XC30 system.
","[{'version': 'v1', 'created': 'Mon, 20 Oct 2014 12:16:22 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jul 2015 10:52:10 GMT'}]",2015-07-30,"[['Kreutzer', 'Moritz', ''], ['Hager', 'Georg', ''], ['Wellein', 'Gerhard', ''], ['Pieper', 'Andreas', ''], ['Alvermann', 'Andreas', ''], ['Fehske', 'Holger', '']]","['Parallel programming', 'Quantum mechanics', 'Performance analysis', 'Sparse matrices']"
6193,2111.02740,Jaeyoung Choi,"Jihyeon Kim, Jinkyung Kim, Jaeyoung Choi","Sequential Movie Genre Prediction using Average Transition Probability
  with Clustering",Published as a journal (https://doi.org/10.3390/app112411841),"Applied Sciences, 2021.12",10.3390/app112411841,,cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent movie recommendations, predicting the user's sequential behavior
and suggesting the next movie to watch is one of the most important issues.
However, capturing such sequential behavior is not easy because each user's
short-term or long-term behavior must be taken into account. For this reason,
many research results show that the performance of recommending a specific
movie is not very high in a sequential recommendation. In this paper, we
propose a cluster-based method for classifying users with similar movie
purchase patterns and a movie genre prediction algorithm rather than the movie
itself considering their short-term and long-term behaviors. The movie genre
prediction does not recommend a specific movie, but it predicts the genre for
the next movie to watch in consideration of each user's preference for the
movie genre based on the genre included in the movie. Through this, it is
possible to provide appropriate guidelines for recommending movies including
the genre to users who tend to prefer a specific genre. In particular, in this
paper, users with similar genre preferences are organized into clusters to
recommend genres, and in clusters that do not have relatively specific
tendencies, genre prediction is performed by appropriately trimming genres that
are not necessary for recommendation in order to improve performance. We
evaluate our method on well-known movie datasets, and qualitatively that it
captures personalized dynamics and is able to make meaningful recommendations.
","[{'version': 'v1', 'created': 'Thu, 4 Nov 2021 10:46:53 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Jun 2022 12:17:15 GMT'}]",2022-06-29,"[['Kim', 'Jihyeon', ''], ['Kim', 'Jinkyung', ''], ['Choi', 'Jaeyoung', '']]","['Movie genre prediction', 'Sequential recommendation', 'Transitionprobability', 'User clustering']"
6194,2006.15754,Eric Heiden,"Ali-akbar Agha-mohammadi, Eric Heiden, Karol Hausman, Gaurav S.
  Sukhatme",Confidence-rich grid mapping,"Published at International Journal of Robotics Research (IJRR) 2019
  (https://journals.sagepub.com/doi/10.1177/0278364919839762)","The International Journal of Robotics Research, 38(12-13),
  1352-1374 (2019)",10.1177/0278364919839762,,cs.RO cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Representing the environment is a fundamental task in enabling robots to act
autonomously in unknown environments. In this work, we present confidence-rich
mapping (CRM), a new algorithm for spatial grid-based mapping of the 3D
environment. CRM augments the occupancy level at each voxel by its confidence
value. By explicitly storing and evolving confidence values using the CRM
filter, CRM extends traditional grid mapping in three ways: first, it partially
maintains the probabilistic dependence among voxels. Second, it relaxes the
need for hand-engineering an inverse sensor model and proposes the concept of
sensor cause model that can be derived in a principled manner from the forward
sensor model. Third, and most importantly, it provides consistent confidence
values over the occupancy estimation that can be reliably used in collision
risk evaluation and motion planning. CRM runs online and enables mapping
environments where voxels might be partially occupied. We demonstrate the
performance of the method on various datasets and environments in simulation
and on physical systems. We show in real-world experiments that, in addition to
achieving maps that are more accurate than traditional methods, the proposed
filtering scheme demonstrates a much higher level of consistency between its
error and the reported confidence, hence, enabling a more reliable collision
risk evaluation for motion planning.
","[{'version': 'v1', 'created': 'Mon, 29 Jun 2020 00:21:30 GMT'}]",2020-06-30,"[['Agha-mohammadi', 'Ali-akbar', ''], ['Heiden', 'Eric', ''], ['Hausman', 'Karol', ''], ['Sukhatme', 'Gaurav S.', '']]","['Occupancy grid', 'mapping', 'uncertainty', 'range sensing', 'volumetric representation']"
6195,2112.11829,Yurij Katchanov,"Yurij L. Katchanov, Yulia V. Markova",Dynamics of senses of new physics discourse: co-keywords analysis,"36 pages, 10 figures",,10.1016/j.joi.2021.101245,,cs.DL stat.AP,http://creativecommons.org/licenses/by/4.0/,"  The paper presents a longitudinal analysis of the evolution of new physics
keywords co-occurrence patterns. For that, we explore the documents indexed in
the INSPIRE database from 1989 to 2018. Our purpose is to quantify the
knowledge structure of the fast-growing subfield of new physics. The
development of a novel approach to keywords co-occurrence analysis is the main
point of the paper. In contrast to traditional co-keyword network analysis, we
investigate structures that unite physics concepts in different documents and
bind different documents with the same physics concepts. We consider the
structures that reveal relationships among concepts as topological and call
them ""physics senses"". Based on the notion of trajectory mutual information,
the paper offers clustering of physics senses, determines their period of life,
and constructs a classification of senses' ""authority"".
","[{'version': 'v1', 'created': 'Wed, 22 Dec 2021 12:13:29 GMT'}]",2021-12-30,"[['Katchanov', 'Yurij L.', ''], ['Markova', 'Yulia V.', '']]","['Co-occurrence analysis', 'Keywords', 'New physics', 'INSPIRE']"
6196,cs/0511080,Valmir Barbosa,"Alexandre O. Stauffer, Valmir C. Barbosa",A dissemination strategy for immunizing scale-free networks,,"Physical Review E 74 (2006), 056105",10.1103/PhysRevE.74.056105,,cs.NI,,"  We consider the problem of distributing a vaccine for immunizing a scale-free
network against a given virus or worm. We introduce a new method, based on
vaccine dissemination, that seems to reflect more accurately what is expected
to occur in real-world networks. Also, since the dissemination is performed
using only local information, the method can be easily employed in practice.
Using a random-graph framework, we analyze our method both mathematically and
by means of simulations. We demonstrate its efficacy regarding the trade-off
between the expected number of nodes that receive the vaccine and the network's
resulting vulnerability to develop an epidemic as the virus or worm attempts to
infect one of its nodes. For some scenarios, the new method is seen to render
the network practically invulnerable to attacks while requiring only a small
fraction of the nodes to receive the vaccine.
","[{'version': 'v1', 'created': 'Tue, 22 Nov 2005 10:59:50 GMT'}]",2007-05-23,"[['Stauffer', 'Alexandre O.', ''], ['Barbosa', 'Valmir C.', '']]","['Network immunization', 'Random networks', 'Heuristic flooding']"
6197,2204.07764,Marcos Faundez-Zanuy,Marcos Faundez-Zanuy,Biometric verification of humans by means of hand geometry,"8 pages, published in Proceedings 39th Annual 2005 International
  Carnahan Conference on Security Technology ICCST2005 Las Palmas, Spain. arXiv
  admin note: substantial text overlap with arXiv:2204.03925","IEEE Proceedings 39th Annual 2005 International Carnahan
  Conference on Security Technology, 2005, pp. 61-67",10.1109/CCST.2005.1594816,,cs.CV cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper describes a hand geometry biometric identification system. We have
acquired a database of 22 people, 10 acquisitions per person, using a
conventional document scanner. We propose a feature extraction and classifier.
The experimental results reveal a maximum identification rate equal to 93.64%,
and a minimum value of the detection cost function equal to 2.92% using a multi
layer perceptron classifier.
","[{'version': 'v1', 'created': 'Sat, 16 Apr 2022 09:29:28 GMT'}]",2022-04-19,"[['Faundez-Zanuy', 'Marcos', '']]","['Hand geometry', 'Neural Networks', 'feature extraction', 'chain code']"
6198,2202.07845,Wen-Bo Xie,"Xin Wang, Zhuo Lan, Yu-Ang He, Yang Wang, Zhi-Gui Liu, Wen-Bo Xie",Near-optimal Top-k Pattern Mining,,"Expert Systems with Applications, Volume 202, 15 September 2022",10.1016/j.eswa.2022.117262,,cs.DB,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Nowadays, frequent pattern mining (FPM) on large graphs receives increasing
attention, since it is crucial to a variety of applications, e.g., social
analysis. Informally, the FPM problem is defined as finding all the patterns in
a large graph with frequency above a user-defined threshold. However, this
problem is nontrivial due to the unaffordable computational and space costs in
the mining process. In light of this, we propose a cost-effective approach to
mining near-optimal top-k patterns. Our approach applies a ""level-wise""
strategy to incrementally detect frequent patterns, hence is able to terminate
as soon as top-k patterns are discovered. Moreover, we develop a technique to
compute the lower bound of support with smart traverse strategy and compact
data structures. Extensive experimental studies on real-life and synthetic
graphs show that our approach performs well, i.e., it outperforms traditional
counterparts in efficiency, memory footprint, recall and scalability.
","[{'version': 'v1', 'created': 'Wed, 16 Feb 2022 03:54:11 GMT'}]",2022-05-04,"[['Wang', 'Xin', ''], ['Lan', 'Zhuo', ''], ['He', 'Yu-Ang', ''], ['Wang', 'Yang', ''], ['Liu', 'Zhi-Gui', ''], ['Xie', 'Wen-Bo', '']]","['Frequent Pattern Mining', 'Graph Mining', 'Social analysis']"
6199,2208.05325,Ireneusz Mrozek,I. Mrozek and N. A. Shevchenko and V. N. Yarmolik,Universal Address Sequence Generator for Memory Built-in Self-test,,,10.3233/FI-222141,,cs.AR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper presents the universal address sequence generator (UASG) for
memory built-in-self-test. The studies are based on the proposed universal
method for generating address sequences with the desired properties for
multirun march memory tests. As a mathematical model, a modification of the
recursive relation for quasi-random sequence generation is used. For this
model, a structural diagram of the hardware implementation is given, of which
the basis is a storage device for storing so-called direction numbers of the
generation matrix. The form of the generation matrix determines the basic
properties of the generated address sequences. The proposed UASG generates a
wide spectrum of different address sequences, including the standard ones, such
as linear, address complement, gray code, worst-case gate delay, $2^i$, next
address, and pseudorandom. Examples of the use of the proposed methods are
considered. The result of the practical implementation of the UASG is
presented, and the main characteristics are evaluated.
","[{'version': 'v1', 'created': 'Sun, 31 Jul 2022 22:22:46 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Jan 2023 20:44:33 GMT'}]",2023-01-05,"[['Mrozek', 'I.', ''], ['Shevchenko', 'N. A.', ''], ['Yarmolik', 'V. N.', '']]","['antirandom tests', 'controlled random tests', 'multiple tests', 'RAM testing']"
6200,2012.07198,Francisco Revson Fernandes Pereira,Francisco Revson F. Pereira and Stefano Mancini,Polar Codes for Quantum Reading,A reference has been added and few typos adjusted,"IEEE Transactions on Information Theory 2022, 68(7), 4531-4548",10.1109/TIT.2022.3159488,,cs.IT math.IT quant-ph,http://creativecommons.org/publicdomain/zero/1.0/,"  Quantum reading provides a general framework where to formulate the
statistical discrimination of quantum channels. Several paths have been taken
for such a problem. However, there is much to be done in the avenue of
optimizing channel discrimination using classical codes. At least two open
questions can be pointed to: how to construct low complexity encoding schemes
that are interesting for channel discrimination and, more importantly, how to
develop capacity-achieving protocols. The aim of this paper is to present a
solution to these questions using polar codes. Firstly, we characterize the
rate and reliability of the channels under polar encoding. We also show that
the error probability of the scheme proposed decays exponentially with respect
to the code length. Lastly, an analysis of the optimal quantum states to be
used as probes is given.
","[{'version': 'v1', 'created': 'Mon, 14 Dec 2020 01:24:11 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Dec 2020 13:35:24 GMT'}]",2022-06-22,"[['Pereira', 'Francisco Revson F.', ''], ['Mancini', 'Stefano', '']]","['Quantum Reading', 'Polar Codes', 'Capacity-Achieving Protocols']"
6201,2101.11978,Rodrigo Agerri,"Elena Zotova, Rodrigo Agerri, German Rigau","Semi-automatic Generation of Multilingual Datasets for Stance Detection
  in Twitter","Stance detection, multilingualism, text categorization, fake news,
  deep learning","Expert Systems with Applications, 170 (2021), Elsevier",10.1016/j.eswa.2020.114547,,cs.CL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Popular social media networks provide the perfect environment to study the
opinions and attitudes expressed by users. While interactions in social media
such as Twitter occur in many natural languages, research on stance detection
(the position or attitude expressed with respect to a specific topic) within
the Natural Language Processing field has largely been done for English.
Although some efforts have recently been made to develop annotated data in
other languages, there is a telling lack of resources to facilitate
multilingual and crosslingual research on stance detection. This is partially
due to the fact that manually annotating a corpus of social media texts is a
difficult, slow and costly process. Furthermore, as stance is a highly domain-
and topic-specific phenomenon, the need for annotated data is specially
demanding. As a result, most of the manually labeled resources are hindered by
their relatively small size and skewed class distribution. This paper presents
a method to obtain multilingual datasets for stance detection in Twitter.
Instead of manually annotating on a per tweet basis, we leverage user-based
information to semi-automatically label large amounts of tweets. Empirical
monolingual and cross-lingual experimentation and qualitative analysis show
that our method helps to overcome the aforementioned difficulties to build
large, balanced and multilingual labeled corpora. We believe that our method
can be easily adapted to easily generate labeled social media data for other
Natural Language Processing tasks and domains.
","[{'version': 'v1', 'created': 'Thu, 28 Jan 2021 13:05:09 GMT'}]",2021-01-29,"[['Zotova', 'Elena', ''], ['Agerri', 'Rodrigo', ''], ['Rigau', 'German', '']]","['Stance detection', 'multilingualism', 'text categorization', 'fake news', 'deeplearning']"
6202,2207.02070,Francisco L\'opez,"Francisco L\'opez, Lars Karlsson and Paolo Bientinesi",FLOPs as a Discriminant for Dense Linear Algebra Algorithms,"10 pages, 11 figures, 2 tables. Accepted in the 51st International
  Conference on Parallel Processing (ICPP'22)","Francisco L\'opez, Lars Karlsson, and Paolo Bientinesi. 2022.
  FLOPs as a Discriminant for Dense Linear Algebra Algorithms. In 51st
  International Conference on Parallel Processing (ICPP'22), August
  29-September 1, 2022, Bordeaux, France",10.1145/3545008.3545072,,cs.PF cs.MS,http://creativecommons.org/licenses/by-sa/4.0/,"  Expressions that involve matrices and vectors, known as linear algebra
expressions, are commonly evaluated through a sequence of invocations to highly
optimised kernels provided in libraries such as BLAS and LAPACK. A sequence of
kernels represents an algorithm, and in general, because of associativity,
algebraic identities, and multiple kernels, one expression can be evaluated via
many different algorithms. These algorithms are all mathematically equivalent
(i.e., in exact arithmetic, they all compute the same result), but often differ
noticeably in terms of execution time. When faced with a decision, high-level
languages, libraries, and tools such as Julia, Armadillo, and Linnea choose by
selecting the algorithm that minimises the FLOP count. In this paper, we test
the validity of the FLOP count as a discriminant for dense linear algebra
algorithms, analysing ""anomalies"": problem instances for which the fastest
algorithm does not perform the least number of FLOPs.
  To do so, we focused on relatively simple expressions and analysed when and
why anomalies occurred. We found that anomalies exist and tend to cluster into
large contiguous regions. For one expression anomalies were rare, whereas for
the other they were abundant. We conclude that FLOPs is not a sufficiently
dependable discriminant even when building algorithms with highly optimised
kernels. Plus, most of the anomalies remained as such even after filtering out
the inter-kernel cache effects. We conjecture that combining FLOP counts with
kernel performance models will significantly improve our ability to choose
optimal algorithms.
","[{'version': 'v1', 'created': 'Tue, 5 Jul 2022 14:19:55 GMT'}]",2022-07-06,"[['López', 'Francisco', ''], ['Karlsson', 'Lars', ''], ['Bientinesi', 'Paolo', '']]","['linear algebra', 'algorithm selection', 'scientific computing']"
6203,1807.10436,Ali Dehghantanha,"James Baldwin, Omar M. K. Alhawi, Simone Shaughnessy, Alex Akinbi, Ali
  Dehghantanha","Emerging from The Cloud: A Bibliometric Analysis of Cloud Forensics
  Studies",22 Pages,,10.1007/978-3-319-73951-9_16,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The emergence of cloud computing technologies has changed the way we store,
retrieve, and archive our data. With the promise of unlimited, reliable and
always-available storage, a lot of private and confidential data are now stored
on different cloud platforms. Being such a gold mine of data, cloud platforms
are among the most valuable targets for attackers. Therefore, many forensics
investigators have tried to develop tools, tactics and procedures to collect,
preserve, analyse and report evidences of attackers activities on different
cloud platforms. Despite the number of published articles there is not a
bibliometric study that presents cloud forensics research trends. This paper
aims to address this problem by providing a comprehensive assessment of cloud
forensics research trends between 2009 and 2016. Moreover, we provide a
classification of cloud forensics process to detect the most profound research
areas and highlight remaining challenges.
","[{'version': 'v1', 'created': 'Fri, 27 Jul 2018 05:25:44 GMT'}]",2018-07-30,"[['Baldwin', 'James', ''], ['Alhawi', 'Omar M. K.', ''], ['Shaughnessy', 'Simone', ''], ['Akinbi', 'Alex', ''], ['Dehghantanha', 'Ali', '']]","['Cloud Forensics', 'Cloud Computing', 'Cloud Analysis', 'Cloud Investigation', 'Digital Forensics']"
6204,2204.09388,Fran\c{c}ois Gauthier,Francois Gauthier and Sora Bae,Runtime Prevention of Deserialization Attacks,,,10.1145/3510455.3512786,,cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Untrusted deserialization exploits, where a serialised object graph is used
to achieve denial-of-service or arbitrary code execution, have become so
prominent that they were introduced in the 2017 OWASP Top 10. In this paper, we
present a novel and lightweight approach for runtime prevention of
deserialization attacks using Markov chains. The intuition behind our work is
that the features and ordering of classes in malicious object graphs make them
distinguishable from benign ones. Preliminary results indeed show that our
approach achieves an F1-score of 0.94 on a dataset of 264 serialised payloads,
collected from an industrial Java EE application server and a repository of
deserialization exploits.
","[{'version': 'v1', 'created': 'Wed, 20 Apr 2022 11:01:46 GMT'}]",2022-04-21,"[['Gauthier', 'Francois', ''], ['Bae', 'Sora', '']]","['Deserialization', 'Markov chains', 'Runtime protection']"
6205,1601.03531,Omar Al-Kadi,"O. S. Al-Kadi, Daniel Y.F. Chung, Robert C. Carlisle, Constantin C.
  Coussios, J. Alison Noble","Quantification of Ultrasonic Texture heterogeneity via Volumetric
  Stochastic Modeling for Tissue Characterization","Supplementary data associated with this article can be found, in the
  online version, at http://dx.doi.org/10.1016/j.media.2014.12. 004","Medical Image Analysis, vol. 21(1), pp. 59-71, 2015",10.1016/j.media.2014.12.004,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Intensity variations in image texture can provide powerful quantitative
information about physical properties of biological tissue. However, tissue
patterns can vary according to the utilized imaging system and are
intrinsically correlated to the scale of analysis. In the case of ultrasound,
the Nakagami distribution is a general model of the ultrasonic backscattering
envelope under various scattering conditions and densities where it can be
employed for characterizing image texture, but the subtle intra-heterogeneities
within a given mass are difficult to capture via this model as it works at a
single spatial scale. This paper proposes a locally adaptive 3D
multi-resolution Nakagami-based fractal feature descriptor that extends
Nakagami-based texture analysis to accommodate subtle speckle spatial frequency
tissue intensity variability in volumetric scans. Local textural fractal
descriptors - which are invariant to affine intensity changes - are extracted
from volumetric patches at different spatial resolutions from voxel
lattice-based generated shape and scale Nakagami parameters. Using ultrasound
radio-frequency datasets we found that after applying an adaptive fractal
decomposition label transfer approach on top of the generated Nakagami voxels,
tissue characterization results were superior to the state of art. Experimental
results on real 3D ultrasonic pre-clinical and clinical datasets suggest that
describing tumor intra-heterogeneity via this descriptor may facilitate
improved prediction of therapy response and disease characterization.
","[{'version': 'v1', 'created': 'Thu, 14 Jan 2016 09:51:37 GMT'}]",2016-01-15,"[['Al-Kadi', 'O. S.', ''], ['Chung', 'Daniel Y. F.', ''], ['Carlisle', 'Robert C.', ''], ['Coussios', 'Constantin C.', ''], ['Noble', 'J. Alison', '']]","['texture analysis', 'fractal dimension', 'tumor characterization', 'Nakagami modeling', 'ultrasound imaging']"
6206,2010.11732,Paulo Renato Conceicao Mendes,"Paulo R C Mendes, Antonio J G Busson, S\'ergio Colcher, Daniel
  Schwabe, \'Alan L V Guedes, Carlos Laufer",A Cluster-Matching-Based Method for Video Face Recognition,13 pages,,10.1145/3428658.3430967,,cs.CV cs.AI cs.LG cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Face recognition systems are present in many modern solutions and thousands
of applications in our daily lives. However, current solutions are not easily
scalable, especially when it comes to the addition of new targeted people. We
propose a cluster-matching-based approach for face recognition in video. In our
approach, we use unsupervised learning to cluster the faces present in both the
dataset and targeted videos selected for face recognition. Moreover, we design
a cluster matching heuristic to associate clusters in both sets that is also
capable of identifying when a face belongs to a non-registered person. Our
method has achieved a recall of 99.435% and a precision of 99.131% in the task
of video face recognition. Besides performing face recognition, it can also be
used to determine the video segments where each person is present.
","[{'version': 'v1', 'created': 'Tue, 20 Oct 2020 00:44:54 GMT'}]",2020-12-03,"[['Mendes', 'Paulo R C', ''], ['Busson', 'Antonio J G', ''], ['Colcher', 'Sérgio', ''], ['Schwabe', 'Daniel', ''], ['Guedes', 'Álan L V', ''], ['Laufer', 'Carlos', '']]","['Face recognition', 'Deep learning', 'Clustering']"
6207,2103.01488,Takeshi D. Itoh,Takeshi D. Itoh and Takatomi Kubo and Kazushi Ikeda,"Multi-Level Attention Pooling for Graph Neural Networks: Unifying Graph
  Representations with Multiple Localities","17 pages + 5 appendix pages, 16 figures + 2 appendix figures, 2
  tables + 5 appendix tables",Neural Netw. 145 (2022) 356-373,10.1016/j.neunet.2021.11.001,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Graph neural networks (GNNs) have been widely used to learn vector
representation of graph-structured data and achieved better task performance
than conventional methods. The foundation of GNNs is the message passing
procedure, which propagates the information in a node to its neighbors. Since
this procedure proceeds one step per layer, the range of the information
propagation among nodes is small in the lower layers, and it expands toward the
higher layers. Therefore, a GNN model has to be deep enough to capture global
structural information in a graph. On the other hand, it is known that deep GNN
models suffer from performance degradation because they lose nodes' local
information, which would be essential for good model performance, through many
message passing steps. In this study, we propose multi-level attention pooling
(MLAP) for graph-level classification tasks, which can adapt to both local and
global structural information in a graph. It has an attention pooling layer for
each message passing step and computes the final graph representation by
unifying the layer-wise graph representations. The MLAP architecture allows
models to utilize the structural information of graphs with multiple levels of
localities because it preserves layer-wise information before losing them due
to oversmoothing. Results of our experiments show that the MLAP architecture
improves the graph classification performance compared to the baseline
architectures. In addition, analyses on the layer-wise graph representations
suggest that aggregating information from multiple levels of localities indeed
has the potential to improve the discriminability of learned graph
representations.
","[{'version': 'v1', 'created': 'Tue, 2 Mar 2021 05:58:12 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Jul 2021 06:25:10 GMT'}, {'version': 'v3', 'created': 'Wed, 29 Sep 2021 13:29:52 GMT'}, {'version': 'v4', 'created': 'Mon, 1 Nov 2021 03:00:19 GMT'}]",2022-01-31,"[['Itoh', 'Takeshi D.', ''], ['Kubo', 'Takatomi', ''], ['Ikeda', 'Kazushi', '']]","['Graph representation learning (GRL)', 'Graph neural network (GNN)', 'Multi-level attention pooling(MLAP)', 'Multi-level locality']"
6208,2002.01633,Deyu Bo,"Deyu Bo, Xiao Wang, Chuan Shi, Meiqi Zhu, Emiao Lu and Peng Cui",Structural Deep Clustering Network,"Published at The Web Conference (WWW) 2020, full paper",,10.1145/3366423.3380214,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering is a fundamental task in data analysis. Recently, deep clustering,
which derives inspiration primarily from deep learning approaches, achieves
state-of-the-art performance and has attracted considerable attention. Current
deep clustering methods usually boost the clustering results by means of the
powerful representation ability of deep learning, e.g., autoencoder, suggesting
that learning an effective representation for clustering is a crucial
requirement. The strength of deep clustering methods is to extract the useful
representations from the data itself, rather than the structure of data, which
receives scarce attention in representation learning. Motivated by the great
success of Graph Convolutional Network (GCN) in encoding the graph structure,
we propose a Structural Deep Clustering Network (SDCN) to integrate the
structural information into deep clustering. Specifically, we design a delivery
operator to transfer the representations learned by autoencoder to the
corresponding GCN layer, and a dual self-supervised mechanism to unify these
two different deep neural architectures and guide the update of the whole
model. In this way, the multiple structures of data, from low-order to
high-order, are naturally combined with the multiple representations learned by
autoencoder. Furthermore, we theoretically analyze the delivery operator, i.e.,
with the delivery operator, GCN improves the autoencoder-specific
representation as a high-order graph regularization constraint and autoencoder
helps alleviate the over-smoothing problem in GCN. Through comprehensive
experiments, we demonstrate that our propose model can consistently perform
better over the state-of-the-art techniques.
","[{'version': 'v1', 'created': 'Wed, 5 Feb 2020 04:33:40 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Feb 2020 01:38:08 GMT'}, {'version': 'v3', 'created': 'Wed, 12 Feb 2020 13:27:06 GMT'}]",2020-02-13,"[['Bo', 'Deyu', ''], ['Wang', 'Xiao', ''], ['Shi', 'Chuan', ''], ['Zhu', 'Meiqi', ''], ['Lu', 'Emiao', ''], ['Cui', 'Peng', '']]","['deep clustering', 'graph convolutional network', 'neural network', 'selfsupervised learning']"
6209,1802.00822,Ruizhe Cai,"Ruizhe Cai, Ao Ren, Ning Liu, Caiwen Ding, Luhao Wang, Xuehai Qian,
  Massoud Pedram, Yanzhi Wang",VIBNN: Hardware Acceleration of Bayesian Neural Networks,,,10.1145/3173162.3173212,,cs.LG cs.AR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bayesian Neural Networks (BNNs) have been proposed to address the problem of
model uncertainty in training and inference. By introducing weights associated
with conditioned probability distributions, BNNs are capable of resolving the
overfitting issue commonly seen in conventional neural networks and allow for
small-data training, through the variational inference process. Frequent usage
of Gaussian random variables in this process requires a properly optimized
Gaussian Random Number Generator (GRNG). The high hardware cost of conventional
GRNG makes the hardware implementation of BNNs challenging.
  In this paper, we propose VIBNN, an FPGA-based hardware accelerator design
for variational inference on BNNs. We explore the design space for massive
amount of Gaussian variable sampling tasks in BNNs. Specifically, we introduce
two high performance Gaussian (pseudo) random number generators: the RAM-based
Linear Feedback Gaussian Random Number Generator (RLF-GRNG), which is inspired
by the properties of binomial distribution and linear feedback logics; and the
Bayesian Neural Network-oriented Wallace Gaussian Random Number Generator. To
achieve high scalability and efficient memory access, we propose a deep
pipelined accelerator architecture with fast execution and good hardware
utilization. Experimental results demonstrate that the proposed VIBNN
implementations on an FPGA can achieve throughput of 321,543.4 Images/s and
energy efficiency upto 52,694.8 Images/J while maintaining similar accuracy as
its software counterpart.
","[{'version': 'v1', 'created': 'Fri, 2 Feb 2018 19:26:59 GMT'}]",2018-02-06,"[['Cai', 'Ruizhe', ''], ['Ren', 'Ao', ''], ['Liu', 'Ning', ''], ['Ding', 'Caiwen', ''], ['Wang', 'Luhao', ''], ['Qian', 'Xuehai', ''], ['Pedram', 'Massoud', ''], ['Wang', 'Yanzhi', '']]","['Bayesian Neural Network', 'Neural Network', 'FPGA']"
6210,1910.05091,Mirko Trisolini,"Mirko Trisolini, Hugh G. Lewis, Camilla Colombo",Spacecraft design optimisation for demise and survivability,Paper accepted for publication in Aerospace Science and Technology,,10.1016/j.ast.2018.04.006,,cs.NE astro-ph.EP cs.CE math.OC physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Among the mitigation measures introduced to cope with the space debris issue
there is the de-orbiting of decommissioned satellites. Guidelines for
re-entering objects call for a ground casualty risk no higher than 0.0001. To
comply with this requirement, satellites can be designed through a
design-for-demise philosophy. Still, a spacecraft designed to demise has to
survive the debris-populated space environment for many years. The demisability
and the survivability of a satellite can both be influenced by a set of common
design choices such as the material selection, the geometry definition, and the
position of the components. Within this context, two models have been developed
to analyse the demise and the survivability of satellites. Given the competing
nature of the demisability and the survivability, a multi-objective
optimisation framework was developed, with the aim to identify trade-off
solutions for the preliminary design of satellites. As the problem is nonlinear
and involves the combination of continuous and discrete variables, classical
derivative based approaches are unsuited and a genetic algorithm was selected
instead. The genetic algorithm uses the developed demisability and
survivability criteria as the fitness functions of the multi-objective
algorithm. The paper presents a test case, which considers the preliminary
optimisation of tanks in terms of material, geometry, location, and number of
tanks for a representative Earth observation mission. The configuration of the
external structure of the spacecraft is fixed. Tanks were selected because they
are sensitive to both design requirements: they represent critical components
in the demise process and impact damage can cause the loss of the mission
because of leaking and ruptures. The results present the possible trade off
solutions, constituting the Pareto front obtained from the multi-objective
optimisation.
","[{'version': 'v1', 'created': 'Fri, 11 Oct 2019 11:39:22 GMT'}]",2019-10-14,"[['Trisolini', 'Mirko', ''], ['Lewis', 'Hugh G.', ''], ['Colombo', 'Camilla', '']]","['design-for-demise', 'survivability', 'multi-objective optimisation', 'tanks  Nomenclature']"
6211,1412.0426,John Lasseter,John H. E. Lasseter,The Interpreter In An Undergraduate Compilers Course,Final version to appear in SIGCSE '15,,10.1145/2676723.2677314,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An undergraduate compilers course poses significant challenges to students,
in both the conceptual richness of the major components and in the programming
effort necessary to implement them. In this paper, I argue that a related
architecture, the interpreter, serves as an effective conceptual framework in
which to teach some of the later stages of the compiler pipeline. This
framework can serve both to unify some of the major concepts that are taught in
a typical undergraduate course and to structure the implementation of a
semester-long compiler project.
","[{'version': 'v1', 'created': 'Mon, 1 Dec 2014 11:07:47 GMT'}]",2014-12-02,"[['Lasseter', 'John H. E.', '']]","['compilers education', 'design patterns', 'partial evaluation', 'abstract interpretation']"
6212,2208.14073,Li Sun,"Li Sun, Junda Ye, Hao Peng, Philip S. Yu","A Self-supervised Riemannian GNN with Time Varying Curvature for
  Temporal Graph Learning",Accepted by CIKM22 (Full Paper),,10.1145/3511808.3557222,,cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Representation learning on temporal graphs has drawn considerable research
attention owing to its fundamental importance in a wide spectrum of real-world
applications. Though a number of studies succeed in obtaining time-dependent
representations, it still faces significant challenges. On the one hand, most
of the existing methods restrict the embedding space with a certain curvature.
However, the underlying geometry in fact shifts among the positive curvature
hyperspherical, zero curvature Euclidean and negative curvature hyperbolic
spaces in the evolvement over time. On the other hand, these methods usually
require abundant labels to learn temporal representations, and thereby notably
limit their wide use in the unlabeled graphs of the real applications. To
bridge this gap, we make the first attempt to study the problem of
self-supervised temporal graph representation learning in the general
Riemannian space, supporting the time-varying curvature to shift among
hyperspherical, Euclidean and hyperbolic spaces. In this paper, we present a
novel self-supervised Riemannian graph neural network (SelfRGNN). Specifically,
we design a curvature-varying Riemannian GNN with a theoretically grounded time
encoding, and formulate a functional curvature over time to model the
evolvement shifting among the positive, zero and negative curvature spaces. To
enable the self-supervised learning, we propose a novel reweighting
self-contrastive approach, exploring the Riemannian space itself without
augmentation, and propose an edge-based self-supervised curvature learning with
the Ricci curvature. Extensive experiments show the superiority of SelfRGNN,
and moreover, the case study shows the time-varying curvature of temporal graph
in reality.
","[{'version': 'v1', 'created': 'Tue, 30 Aug 2022 08:43:06 GMT'}]",2022-08-31,"[['Sun', 'Li', ''], ['Ye', 'Junda', ''], ['Peng', 'Hao', ''], ['Yu', 'Philip S.', '']]","['Temporal Graphs', 'Riemannian Geometry', 'Contrastive Learning']"
6213,2007.15254,Frank Havemann,Frank Havemann,"Topics as Clusters of Citation Links to Highly Cited Sources: The Case
  of Research on International Relations","37 pages, 12 figures, 9 tables",Quantitative Science Studies (2021) 2 (1): 204-223,10.1162/qss_a_00108,,cs.DL cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Following Henry Small in his approach to co-citation analysis, highly cited
sources are seen as concept symbols of research fronts. But instead of co-cited
sources I cluster citation links, which are the thematically least heterogenous
elements in bibliometric studies. To obtain clusters representing topics
characterised by concepts I restrict link clustering to citation links to
highly cited sources. Clusters of citation links between papers in a
political-science subfield (International Relations) and 300 of their sources
most cited in the period 2006-2015 are constructed by a local memetic
algorithm. It finds local minima in a cost landscape corresponding to clusters,
which can overlap each other pervasively. The clusters obtained are well
separated from the rest of the network but can have suboptimal cohesion.
Cohesive cores of topics are found by applying an algorithm that constructs
core-periphery structures in link sets. In this methodological paper I only
discuss some first clustering results for the second half of the 10-years
period.
","[{'version': 'v1', 'created': 'Thu, 30 Jul 2020 06:33:31 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Nov 2020 14:10:05 GMT'}]",2022-01-26,"[['Havemann', 'Frank', '']]","['topics', 'citation networks', 'concept symbols', 'overlapping communities', 'linkclustering', 'memetic algorithm', 'core-peripherystructures']"
6214,2105.01939,Nagy Marcell,"P\'eter Tam\'as Kov\'acs, Marcell Nagy, Roland Molontay",Comparative Analysis of Box-Covering Algorithms for Fractal Networks,"The paper has been published in Applied Network Science:
  https://appliednetsci.springeropen.com/articles/10.1007/s41109-021-00410-6","Applied Network Science (2021), volume 6, Article number: 73",10.1007/s41109-021-00410-6,,cs.SI cs.DM physics.data-an physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  Research on fractal networks is a dynamically growing field of network
science. A central issue is to analyze fractality with the so-called
box-covering method. As this problem is known to be NP-hard, a plethora of
approximating algorithms have been proposed throughout the years. This study
aims to establish a unified framework for comparing approximating box-covering
algorithms by collecting, implementing, and evaluating these methods in various
aspects including running time and approximation ability. This work might also
serve as a reference for both researchers and practitioners, allowing fast
selection from a rich collection of box-covering algorithms with a publicly
available codebase.
","[{'version': 'v1', 'created': 'Wed, 5 May 2021 09:16:34 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Oct 2021 08:39:59 GMT'}]",2021-10-12,"[['Kovács', 'Péter Tamás', ''], ['Nagy', 'Marcell', ''], ['Molontay', 'Roland', '']]","['Fractality', 'Box-covering', 'Box-counting', 'Approximating algorithms', 'Comparative study', 'Open source']"
6215,2205.03096,Carolina Coimbra Vieira,"Carolina Coimbra Vieira, Diego Alburez-Gutierrez, Mar\'ilia R.
  Nepomuceno and Tom Theile","Desaparecidxs: characterizing the population of missing children using
  Twitter",,,10.1145/3501247.3531589,,cs.SI cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Missing children, i.e., children reported to a relevant authority as having
""disappeared,"" constitute an important but often overlooked population. From a
research perspective, missing children constitute a hard-to-reach population
about which little is known. This is a particular problem in regions of the
Global South that lack robust or centralized data collection systems. In this
study, we analyze the composition of the population of missing children in
Guatemala, a country with high levels of violence. We contrast the official
aggregated-level data from the Guatemalan National Police during the 2018-2020
period with real-time individual-level data on missing children from the
official Twitter account of the Alerta Alba-Keneth, a governmental warning
system tasked with disseminating information about missing children. Using the
Twitter data, we characterize the population of missing children in Guatemala
by single-year age, sex, and place of disappearance. Our results show that
women are more likely to be reported as missing, particularly those aged 13-17.
We discuss the findings in light of the known links between missing people,
violence, and human trafficking. Finally, the study highlights the potential of
web data to contribute to society by improving our understanding of this and
similar hard-to-reach populations.
","[{'version': 'v1', 'created': 'Fri, 6 May 2022 09:24:50 GMT'}]",2022-05-09,"[['Vieira', 'Carolina Coimbra', ''], ['Alburez-Gutierrez', 'Diego', ''], ['Nepomuceno', 'Marília R.', ''], ['Theile', 'Tom', '']]","['population', 'missing children', 'disappearance', 'social media data', 'Twitter']"
6216,2210.11124,Philippe Voinov,"Philippe Voinov (ETH Zurich), Manuel Rigger (National University of
  Singapore), Zhendong Su (ETH Zurich)",Forest: Structural Code Editing with Multiple Cursors,"To be published in ""Onward! '22: 2022 ACM SIGPLAN International
  Symposium on New Ideas, New Paradigms, and Reflections on Programming and
  Software Proceedings""",,10.1145/3563835.3567663,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software developers frequently refactor code. Often, a single logical
refactoring change involves changing multiple related components in a source
base such as renaming each occurrence of a variable or function. While many
code editors can perform such common and generic refactorings, they do not
support more complex refactorings or those that are specific to a given code
base. For those, as a flexible - albeit less interactive - alternative,
developers can write refactoring scripts that can implement arbitrarily complex
logic by manipulating the program's tree representation. In this work, we
present Forest, a structural code editor that aims to bridge the gap between
the interactiveness of code editors and the expressiveness of refactoring
scripts. While structural editors have occupied a niche as general code
editors, the key insight of this work is that they enable a novel structural
multi-cursor design that allows Forest to reach a similar expressiveness as
refactoring scripts; Forest allows to perform a single action simultaneously in
multiple program locations and thus support complex refactorings. To support
interactivity, Forest provides features typical for text code editors such as
writing and displaying the program through its textual representation. Our
evaluation demonstrates that Forest allows performing edits similar to those
from refactoring scripts, while still being interactive. We attempted to
perform edits from 48 real-world refactoring scripts using Forest and found
that 11 were possible, while another 17 would be possible with added features.
We believe that a multi-cursor setting plays to the strengths of structural
editing, since it benefits from reliable and expressive commands. Our results
suggest that multi-cursor structural editors could be practical for performing
small-scale specialized refactorings.
","[{'version': 'v1', 'created': 'Thu, 20 Oct 2022 09:35:14 GMT'}]",2022-10-21,"[['Voinov', 'Philippe', '', 'ETH Zurich'], ['Rigger', 'Manuel', '', 'National University of\n  Singapore'], ['Su', 'Zhendong', '', 'ETH Zurich']]","['Structural editing', 'refactoring', 'multi-cursor']"
6217,2105.14457,David Chuan-En Lin,"David Chuan-En Lin, Nikolas Martelaro",Learning Personal Style from Few Examples,,,10.1145/3461778.3462115,,cs.CV cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A key task in design work is grasping the client's implicit tastes. Designers
often do this based on a set of examples from the client. However, recognizing
a common pattern among many intertwining variables such as color, texture, and
layout and synthesizing them into a composite preference can be challenging. In
this paper, we leverage the pattern recognition capability of computational
models to aid in this task. We offer a set of principles for computationally
learning personal style. The principles are manifested in PseudoClient, a deep
learning framework that learns a computational model for personal graphic
design style from only a handful of examples. In several experiments, we found
that PseudoClient achieves a 79.40% accuracy with only five positive and
negative examples, outperforming several alternative methods. Finally, we
discuss how PseudoClient can be utilized as a building block to support the
development of future design applications.
","[{'version': 'v1', 'created': 'Sun, 30 May 2021 08:04:42 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Jun 2021 12:30:13 GMT'}]",2021-06-18,"[['Lin', 'David Chuan-En', ''], ['Martelaro', 'Nikolas', '']]","['style', 'personal preference', 'graphic design', 'machine learning']"
6218,2207.09078,Gopinath Chennupati,"Gopinath Chennupati, Milind Rao, Gurpreet Chadha, Aaron Eakin, Anirudh
  Raju, Gautam Tiwari, Anit Kumar Sahu, Ariya Rastrow, Jasha Droppo, Andy
  Oberlin, Buddha Nandanoor, Prahalad Venkataramanan, Zheng Wu, Pankaj Sitpure","ILASR: Privacy-Preserving Incremental Learning for Automatic Speech
  Recognition at Production Scale",9 pages,,10.1145/3534678.3539174,,cs.CL cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Incremental learning is one paradigm to enable model building and updating at
scale with streaming data. For end-to-end automatic speech recognition (ASR)
tasks, the absence of human annotated labels along with the need for privacy
preserving policies for model building makes it a daunting challenge. Motivated
by these challenges, in this paper we use a cloud based framework for
production systems to demonstrate insights from privacy preserving incremental
learning for automatic speech recognition (ILASR). By privacy preserving, we
mean, usage of ephemeral data which are not human annotated. This system is a
step forward for production levelASR models for incremental/continual learning
that offers near real-time test-bed for experimentation in the cloud for
end-to-end ASR, while adhering to privacy-preserving policies. We show that the
proposed system can improve the production models significantly(3%) over a new
time period of six months even in the absence of human annotated labels with
varying levels of weak supervision and large batch sizes in incremental
learning. This improvement is 20% over test sets with new words and phrases in
the new time period. We demonstrate the effectiveness of model building in a
privacy-preserving incremental fashion for ASR while further exploring the
utility of having an effective teacher model and use of large batch sizes.
","[{'version': 'v1', 'created': 'Tue, 19 Jul 2022 05:24:13 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Jul 2022 21:44:40 GMT'}]",2022-07-26,"[['Chennupati', 'Gopinath', ''], ['Rao', 'Milind', ''], ['Chadha', 'Gurpreet', ''], ['Eakin', 'Aaron', ''], ['Raju', 'Anirudh', ''], ['Tiwari', 'Gautam', ''], ['Sahu', 'Anit Kumar', ''], ['Rastrow', 'Ariya', ''], ['Droppo', 'Jasha', ''], ['Oberlin', 'Andy', ''], ['Nandanoor', 'Buddha', ''], ['Venkataramanan', 'Prahalad', ''], ['Wu', 'Zheng', ''], ['Sitpure', 'Pankaj', '']]","['Incremental Learning', 'Automatic Speech Recognition', 'Privacypreserving Machine Learning']"
6219,1904.08809,Dario  Izzo,"Dario Izzo, Ekin \""Ozt\""urk, Marcus M\""artens","Interplanetary Transfers via Deep Representations of the Optimal Policy
  and/or of the Value Function",,,10.1145/3319619.3326834,,cs.NE cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A number of applications to interplanetary trajectories have been recently
proposed based on deep networks. These approaches often rely on the
availability of a large number of optimal trajectories to learn from. In this
paper we introduce a new method to quickly create millions of optimal
spacecraft trajectories from a single nominal trajectory. Apart from the
generation of the nominal trajectory, no additional optimal control problems
need to be solved as all the trajectories, by construction, satisfy
Pontryagin's minimum principle and the relevant transversality conditions. We
then consider deep feed forward neural networks and benchmark three learning
methods on the created dataset: policy imitation, value function learning and
value function gradient learning. Our results are shown for the case of the
interplanetary trajectory optimization problem of reaching Venus orbit, with
the nominal trajectory starting from the Earth. We find that both policy
imitation and value function gradient learning are able to learn the optimal
state feedback, while in the case of value function learning the optimal policy
is not captured, only the final value of the optimal propellant mass is.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2019 14:33:34 GMT'}]",2019-12-18,"[['Izzo', 'Dario', ''], ['Öztürk', 'Ekin', ''], ['Märtens', 'Marcus', '']]","['artificial neural networks', 'optimization', 'deep learning', 'trajectory design']"
6220,2208.11144,Xingyu Liu,"Xingyu ""Bruce"" Liu, Ruolin Wang, Dingzeyu Li, Xiang 'Anthony' Chen,
  Amy Pavel","CrossA11y: Identifying Video Accessibility Issues via Cross-modal
  Grounding",,,10.1145/3526113.3545703,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Authors make their videos visually accessible by adding audio descriptions
(AD), and auditorily accessible by adding closed captions (CC). However,
creating AD and CC is challenging and tedious, especially for non-professional
describers and captioners, due to the difficulty of identifying accessibility
problems in videos. A video author will have to watch the video through and
manually check for inaccessible information frame-by-frame, for both visual and
auditory modalities. In this paper, we present CrossA11y, a system that helps
authors efficiently detect and address visual and auditory accessibility issues
in videos. Using cross-modal grounding analysis, CrossA11y automatically
measures accessibility of visual and audio segments in a video by checking for
modality asymmetries. CrossA11y then displays these segments and surfaces
visual and audio accessibility issues in a unified interface, making it
intuitive to locate, review, script AD/CC in-place, and preview the described
and captioned video immediately. We demonstrate the effectiveness of CrossA11y
through a lab study with 11 participants, comparing to existing baseline.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2022 18:08:13 GMT'}]",2022-08-25,"[['Liu', 'Xingyu ""Bruce""', ''], ['Wang', 'Ruolin', ''], ['Li', 'Dingzeyu', ''], ['Chen', ""Xiang 'Anthony'"", ''], ['Pavel', 'Amy', '']]","['audio description', 'closed caption', 'video', 'accessibility']"
6221,2010.13986,Zhuqi Li,"Zhuqi Li, Can Wu, Sigurd Wagner, James C. Sturm, Naveen Verma, Kyle
  Jamieson",REITS: Reflective Surface for Intelligent Transportation Systems,,,10.1145/3446382.3448650,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autonomous vehicles are predicted to dominate the transportation industry in
the foreseeable future. Safety is one of the major challenges to the early
deployment of self-driving systems. To ensure safety, self-driving vehicles
must sense and detect humans, other vehicles, and road infrastructure
accurately, robustly, and timely. However, existing sensing techniques used by
self-driving vehicles may not be absolutely reliable. In this paper, we design
REITS, a system to improve the reliability of RF-based sensing modules for
autonomous vehicles. We conduct theoretical analysis on possible failures of
existing RF-based sensing systems. Based on the analysis, REITS adopts a
multi-antenna design, which enables constructive blind beamforming to return an
enhanced radar signal in the incident direction. REITS can also let the
existing radar system sense identification information by switching between
constructive beamforming state and destructive beamforming state. Preliminary
results show that REITS improves the detection distance of a self-driving car
radar by a factor of 3.63.
","[{'version': 'v1', 'created': 'Tue, 27 Oct 2020 01:45:09 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Nov 2020 15:57:35 GMT'}, {'version': 'v3', 'created': 'Tue, 2 Feb 2021 16:25:12 GMT'}]",2021-02-03,"[['Li', 'Zhuqi', ''], ['Wu', 'Can', ''], ['Wagner', 'Sigurd', ''], ['Sturm', 'James C.', ''], ['Verma', 'Naveen', ''], ['Jamieson', 'Kyle', '']]","['Self-driving car', 'Robustness', 'Surface']"
6222,2109.11126,Edward Raff,"Robert J. Joyce, Edward Raff, Charles Nicholas","A Framework for Cluster and Classifier Evaluation in the Absence of
  Reference Labels","to appear in Proceedings of the 14th ACM Workshop on Artificial
  Intelligence and Security",,10.1145/3474369.3486867,,cs.LG cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In some problem spaces, the high cost of obtaining ground truth labels
necessitates use of lower quality reference datasets. It is difficult to
benchmark model performance using these datasets, as evaluation results may be
biased. We propose a supplement to using reference labels, which we call an
approximate ground truth refinement (AGTR). Using an AGTR, we prove that bounds
on specific metrics used to evaluate clustering algorithms and multi-class
classifiers can be computed without reference labels. We also introduce a
procedure that uses an AGTR to identify inaccurate evaluation results produced
from datasets of dubious quality. Creating an AGTR requires domain knowledge,
and malware family classification is a task with robust domain knowledge
approaches that support the construction of an AGTR. We demonstrate our AGTR
evaluation framework by applying it to a popular malware labeling tool to
diagnose over-fitting in prior testing and evaluate changes whose impact could
not be meaningfully quantified under previous data.
","[{'version': 'v1', 'created': 'Thu, 23 Sep 2021 03:42:01 GMT'}]",2021-09-24,"[['Joyce', 'Robert J.', ''], ['Raff', 'Edward', ''], ['Nicholas', 'Charles', '']]","['malware', 'label quality', 'classifier evaluation']"
6223,2012.08375,Elahe Arani,"Hemang Chawla, Matti Jukola, Shabbir Marzban, Elahe Arani and Bahram
  Zonooz","Practical Auto-Calibration for Spatial Scene-Understanding from
  Crowdsourced Dashcamera Videos","Accepted at 16th International Conference on Computer Vision Theory
  and Applications (VISAP, 2021)",,10.5220/0010255808690880,,cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spatial scene-understanding, including dense depth and ego-motion estimation,
is an important problem in computer vision for autonomous vehicles and advanced
driver assistance systems. Thus, it is beneficial to design perception modules
that can utilize crowdsourced videos collected from arbitrary vehicular onboard
or dashboard cameras. However, the intrinsic parameters corresponding to such
cameras are often unknown or change over time. Typical manual calibration
approaches require objects such as a chessboard or additional scene-specific
information. On the other hand, automatic camera calibration does not have such
requirements. Yet, the automatic calibration of dashboard cameras is
challenging as forward and planar navigation results in critical motion
sequences with reconstruction ambiguities. Structure reconstruction of complete
visual-sequences that may contain tens of thousands of images is also
computationally untenable. Here, we propose a system for practical monocular
onboard camera auto-calibration from crowdsourced videos. We show the
effectiveness of our proposed system on the KITTI raw, Oxford RobotCar, and the
crowdsourced D$^2$-City datasets in varying conditions. Finally, we demonstrate
its application for accurate monocular dense depth and ego-motion estimation on
uncalibrated videos.
","[{'version': 'v1', 'created': 'Tue, 15 Dec 2020 15:38:17 GMT'}]",2021-03-03,"[['Chawla', 'Hemang', ''], ['Jukola', 'Matti', ''], ['Marzban', 'Shabbir', ''], ['Arani', 'Elahe', ''], ['Zonooz', 'Bahram', '']]","['vision for robotics', 'crowdsourced videos', 'auto-calibration', 'depth estimation', 'ego-motion estimation']"
6224,1907.03236,Kei Majima,"Naoko Koide-Majima, Kei Majima","Quantum-inspired canonical correlation analysis for exponentially large
  dimensional data","45 pages, 9 figures. This article will appear in Neural Networks","Neural Networks, 2020",10.1016/j.neunet.2020.11.019,,cs.LG quant-ph stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Canonical correlation analysis (CCA) is a technique to find statistical
dependencies between a pair of multivariate data. However, its application to
high dimensional data is limited due to the resulting time complexity. While
the conventional CCA algorithm requires polynomial time, we have developed an
algorithm that approximates CCA with computational time proportional to the
logarithm of the input dimensionality using quantum-inspired computation. The
computational efficiency and approximation performance of the proposed
quantum-inspired CCA (qiCCA) algorithm are experimentally demonstrated.
Furthermore, the fast computation of qiCCA allows us to directly apply CCA even
after nonlinearly mapping raw input data into very high dimensional spaces.
Experiments performed using a benchmark dataset demonstrated that, by mapping
the raw input data into the high dimensional spaces with second-order
monomials, the proposed qiCCA extracted more correlations than linear CCA and
was comparable to deep CCA and kernel CCA. These results suggest that qiCCA is
considerably useful and quantum-inspired computation has the potential to
unlock a new field in which exponentially large dimensional data can be
analyzed.
","[{'version': 'v1', 'created': 'Sun, 7 Jul 2019 07:35:55 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Dec 2020 14:19:47 GMT'}]",2020-12-29,"[['Koide-Majima', 'Naoko', ''], ['Majima', 'Kei', '']]","['canonical correlation analysis', 'quantum-inspired computation', 'high-dimensional data', 'machine learning']"
6225,2006.00204,Mostafa Zaman Chowdhury,"Mostafa Zaman Chowdhury, Moh Khalid Hasan, Md Shahjalal, Md Tanvir
  Hossan, Yeong Min Jang",Optical wireless hybrid networks for 5G and beyond communications,"2018 International Conference on Information and Communication
  Technology Convergence (ICTC)",,10.1109/ICTC.2018.8539460,,cs.NI eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The next 5 th generation (5G) and above ultra-high speed, ultra-low latency,
and extremely high reliable communication systems will consist of heterogeneous
networks. These heterogeneous networks will consist not only radio frequency
(RF) based systems but also optical wireless based systems. Hybrid
architectures among different networks is an excellent approach for achieving
the required level of service quality. In this paper, we provide the
opportunities bring by hybrid systems considering RF as well as optical
wireless based communication technologies. We also discuss about the key
research direction of hybrid network systems.
","[{'version': 'v1', 'created': 'Sat, 30 May 2020 07:05:27 GMT'}]",2020-06-03,"[['Chowdhury', 'Mostafa Zaman', ''], ['Hasan', 'Moh Khalid', ''], ['Shahjalal', 'Md', ''], ['Hossan', 'Md Tanvir', ''], ['Jang', 'Yeong Min', '']]","['Optical wireless', 'radio frequency', 'hybrid', 'small-cell', 'visible light communication', 'optical camera communication', 'free space optical communication']"
6226,1908.11344,Xiangyang He,"Xiangyang He, Yubo Tao, Qirui Wang, Hai Lin",Multivariate Spatial Data Visualization: A Survey,"16 pages, 5 figures. Corresponding author: Yubo Tao","Journal of Visualization, (2019), 1-16",10.1007/s12650-019-00584-3,,cs.HC cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multivariate spatial data plays an important role in computational science
and engineering simulations. The potential features and hidden relationships in
multivariate data can assist scientists to gain an in-depth understanding of a
scientific process, verify a hypothesis and further discover a new physical or
chemical law. In this paper, we present a comprehensive survey of the
state-of-the-art techniques for multivariate spatial data visualization. We
first introduce the basic concept and characteristics of multivariate spatial
data, and describe three main tasks in multivariate data visualization: feature
classification, fusion visualization, and correlation analysis. Finally, we
prospect potential research topics for multivariate data visualization
according to the current research.
","[{'version': 'v1', 'created': 'Sun, 18 Aug 2019 06:07:17 GMT'}]",2019-08-30,"[['He', 'Xiangyang', ''], ['Tao', 'Yubo', ''], ['Wang', 'Qirui', ''], ['Lin', 'Hai', '']]","['Multivariate spatial data', 'feature classification', 'fusion visualization', 'correlation analysis']"
6227,2011.05523,Shang Jiang,"Shang Jiang, Haoran Qin, Bingli Zhang, Jieyu Zheng","Optimized Loss Functions for Object detection: A Case Study on Nighttime
  Vehicle Detection","Part D: Journal of Automobile Engineering, 2021",,10.1177/09544070211036366,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Loss functions is a crucial factor that affecting the detection precision in
object detection task. In this paper, we optimize both two loss functions for
classification and localization simultaneously. Firstly, by multiplying an
IoU-based coefficient by the standard cross entropy loss in classification loss
function, the correlation between localization and classification is
established. Compared to the existing studies, in which the correlation is only
applied to improve the localization accuracy for positive samples, this paper
utilizes the correlation to obtain the really hard negative samples and aims to
decrease the misclassified rate for negative samples. Besides, a novel
localization loss named MIoU is proposed by incorporating a Mahalanobis
distance between predicted box and target box, which eliminate the gradients
inconsistency problem in the DIoU loss, further improving the localization
accuracy. Finally, sufficient experiments for nighttime vehicle detection have
been done on two datasets. Our results show than when train with the proposed
loss functions, the detection performance can be outstandingly improved. The
source code and trained models are available at
https://github.com/therebellll/NegIoU-PosIoU-Miou.
","[{'version': 'v1', 'created': 'Wed, 11 Nov 2020 03:00:49 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Nov 2020 10:34:48 GMT'}]",2021-08-02,"[['Jiang', 'Shang', ''], ['Qin', 'Haoran', ''], ['Zhang', 'Bingli', ''], ['Zheng', 'Jieyu', '']]","['Object detection', 'Loss function optimization', 'Nighttime vehicle detection', 'Deep neural network']"
6228,2203.01229,Georgios Tsialiamanis,"G. Tsialiamanis, M.D. Champneys, N. Dervilis, D.J. Wagg, K. Worden","On the application of generative adversarial networks for nonlinear
  modal analysis",,"Mechanical Systems and Signal Processing, Volume 166, 1 March
  2022, 108473",10.1016/j.ymssp.2021.108473,,cs.LG cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Linear modal analysis is a useful and effective tool for the design and
analysis of structures. However, a comprehensive basis for nonlinear modal
analysis remains to be developed. In the current work, a machine learning
scheme is proposed with a view to performing nonlinear modal analysis. The
scheme is focussed on defining a one-to-one mapping from a latent `modal' space
to the natural coordinate space, whilst also imposing orthogonality of the mode
shapes. The mapping is achieved via the use of the recently-developed
cycle-consistent generative adversarial network (cycle-GAN) and an assembly of
neural networks targeted on maintaining the desired orthogonality. The method
is tested on simulated data from structures with cubic nonlinearities and
different numbers of degrees of freedom, and also on data from an experimental
three-degree-of-freedom set-up with a column-bumper nonlinearity. The results
reveal the method's efficiency in separating the `modes'. The method also
provides a nonlinear superposition function, which in most cases has very good
accuracy.
","[{'version': 'v1', 'created': 'Wed, 2 Mar 2022 16:46:41 GMT'}]",2022-03-03,"[['Tsialiamanis', 'G.', ''], ['Champneys', 'M. D.', ''], ['Dervilis', 'N.', ''], ['Wagg', 'D. J.', ''], ['Worden', 'K.', '']]","['Generative adversarial networks (GANs)', 'cycleGAN', 'nonlinear modalanalysis', 'inductive biases']"
6229,2009.14083,Vu Tran,Vu Tran and Minh Le Nguyen and Ken Satoh,"Building Legal Case Retrieval Systems with Lexical Matching and
  Summarization using A Pre-Trained Phrase Scoring Model",,,10.1145/3322640.3326740,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present our method for tackling the legal case retrieval task of the
Competition on Legal Information Extraction/Entailment 2019. Our approach is
based on the idea that summarization is important for retrieval. On one hand,
we adopt a summarization based model called encoded summarization which encodes
a given document into continuous vector space which embeds the summary
properties of the document. We utilize the resource of COLIEE 2018 on which we
train the document representation model. On the other hand, we extract lexical
features on different parts of a given query and its candidates. We observe
that by comparing different parts of the query and its candidates, we can
achieve better performance. Furthermore, the combination of the lexical
features with latent features by the summarization-based method achieves even
better performance. We have achieved the state-of-the-art result for the task
on the benchmark of the competition.
","[{'version': 'v1', 'created': 'Tue, 29 Sep 2020 15:10:59 GMT'}]",2020-09-30,"[['Tran', 'Vu', ''], ['Nguyen', 'Minh Le', ''], ['Satoh', 'Ken', '']]","['legal texts', 'deep learning', 'document representation', 'structure analysis', 'information retrieval']"
6230,2007.15030,Eugenio Mart\'inez-C\'amara,"Nuria Rodr\'iguez-Barroso, Eugenio Mart\'inez-C\'amara, M. Victoria
  Luz\'on, Francisco Herrera","Dynamic Defense Against Byzantine Poisoning Attacks in Federated
  Learning",10 pages,"Future Generation Computer Systems, 133 (2022), 1-9",10.1016/j.future.2022.03.003,,cs.LG cs.AI cs.CR stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Federated learning, as a distributed learning that conducts the training on
the local devices without accessing to the training data, is vulnerable to
Byzatine poisoning adversarial attacks. We argue that the federated learning
model has to avoid those kind of adversarial attacks through filtering out the
adversarial clients by means of the federated aggregation operator. We propose
a dynamic federated aggregation operator that dynamically discards those
adversarial clients and allows to prevent the corruption of the global learning
model. We assess it as a defense against adversarial attacks deploying a deep
learning classification model in a federated learning setting on the Fed-EMNIST
Digits, Fashion MNIST and CIFAR-10 image datasets. The results show that the
dynamic selection of the clients to aggregate enhances the performance of the
global learning model and discards the adversarial and poor (with low quality
models) clients.
","[{'version': 'v1', 'created': 'Wed, 29 Jul 2020 18:02:11 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Feb 2022 16:01:44 GMT'}]",2022-09-20,"[['Rodríguez-Barroso', 'Nuria', ''], ['Martínez-Cámara', 'Eugenio', ''], ['Luzón', 'M. Victoria', ''], ['Herrera', 'Francisco', '']]","['Federated Learning', 'Deep Learning', 'adversarial attacks', 'byzantine attacks', 'dynamic aggregation operator']"
6231,2008.12017,Sajida Kairm Ms,"Sajida Karim, Hui He, Asif Ali Laghari and Hina Madiha",Quality of Service (QoS): Measurements of Video Streaming,,,10.5281/zenodo.3987056,,cs.MM cs.PF,http://creativecommons.org/publicdomain/zero/1.0/,"  Nowadays video streaming is growing over the social clouds, where end-users
always want to share High Definition (HD) videos among friends. Mostly videos
were recorded via smartphones and other HD devices and short time videos have a
big file size. The big file size of videos required high bandwidth to upload
and download on the Internet and also required more time to load in a web page
for play. So avoiding this problem social cloud compress videos during the
upload for smooth play and fast loading in a web page. Compression decreases
the video quality which also decreases the quality of experience of end users.
In this paper we measure the QoS of different standard video file formats on
social clouds; they varied from each other in resolution, audio/video bitrate,
and storage size.
","[{'version': 'v1', 'created': 'Thu, 27 Aug 2020 09:38:46 GMT'}]",2020-08-28,"[['Karim', 'Sajida', ''], ['He', 'Hui', ''], ['Laghari', 'Asif Ali', ''], ['Madiha', 'Hina', '']]","['Quality of Service', 'Streaming', 'Video Quality', 'Video File Formats', 'Video Resolution']"
6232,2104.11234,Ivan Cviti\'c,"Ivan Cviti\'c, Dragan Perakovi\'c, Marko Peri\v{s}a, Anca D. Jurcut","Methodology proposal for proactive detection of network anomalies in
  e-learning system during the COVID-19 scenario",arXiv admin note: substantial text overlap with arXiv:2104.11041,,10.1007/978-3-030-67241-6_12,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In specific conditions and crisis situations such as the pandemic of
coronavirus (SARS-CoV-2), or the COVID-19 disease, e-learning systems be-came
crucial for the smooth performing of teaching and other educational pro-cesses.
In such scenarios, the availability of e-learning ecosystem elements is further
highlighted. An indicator of the importance for securing the availability of
such an ecosystem is evident from the DDoS (Distributed Denial of Service)
attack on AAI@EduHr as a key authentication service for number of e-learning
users in Republic of Croatia. In doing so, numerous users
(teach-ers/students/administrators) were prevented from implementing and
participat-ing in the planned teaching process. Given that DDoS as an anomaly
of network traffic has been identified as one of the key threats to the
e-learning ecosystem in crisis scenarios, this research will focus on overview
of methodology for de-veloping a model for proactive detection of DDoS traffic.
The challenge in de-tection is to effectively differentiate the increased
traffic intensity and service requests caused by legitimate user activity
(flash crowd) from the illegitimate traffic caused by a DDoS attack. The DDoS
traffic detection model developed by following analyzed methodology would serve
as a basis for providing further guidelines and recommendations in the form of
response to events that may negatively affect the availability of e-learning
ecosystem elements such as DDoS attack.
","[{'version': 'v1', 'created': 'Thu, 22 Apr 2021 13:28:36 GMT'}]",2021-09-07,"[['Cvitić', 'Ivan', ''], ['Peraković', 'Dragan', ''], ['Periša', 'Marko', ''], ['Jurcut', 'Anca D.', '']]","['Availability', 'Cyber-threats', 'DDoS', 'SARS-CoV-2', 'Pandemic']"
6233,1905.10090,Fabio Baruffa,"David Brayford, Sofia Vallecorsa, Atanas Atanasov, Fabio Baruffa,
  Walter Riviera",Deploying AI Frameworks on Secure HPC Systems with Containers,"6 pages, 2 figures, 2019 IEEE High Performance Extreme Computing
  Conference",,10.1109/HPEC.2019.8916576,,cs.DC cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing interest in the usage of Artificial Intelligence techniques
(AI) from the research community and industry to tackle ""real world"" problems,
requires High Performance Computing (HPC) resources to efficiently compute and
scale complex algorithms across thousands of nodes. Unfortunately, typical data
scientists are not familiar with the unique requirements and characteristics of
HPC environments. They usually develop their applications with high-level
scripting languages or frameworks such as TensorFlow and the installation
process often requires connection to external systems to download open source
software during the build. HPC environments, on the other hand, are often based
on closed source applications that incorporate parallel and distributed
computing API's such as MPI and OpenMP, while users have restricted
administrator privileges, and face security restrictions such as not allowing
access to external systems. In this paper we discuss the issues associated with
the deployment of AI frameworks in a secure HPC environment and how we
successfully deploy AI frameworks on SuperMUC-NG with Charliecloud.
","[{'version': 'v1', 'created': 'Fri, 24 May 2019 08:45:56 GMT'}]",2020-01-14,"[['Brayford', 'David', ''], ['Vallecorsa', 'Sofia', ''], ['Atanasov', 'Atanas', ''], ['Baruffa', 'Fabio', ''], ['Riviera', 'Walter', '']]","['HPC', 'AI', 'containers', 'security']"
6234,2005.03963,Tristan Millington,"Tristan Millington, Mahesan Niranjan","Construction of Minimum Spanning Trees from Financial Returns using Rank
  Correlation",,,10.1016/j.physa.2020.125605,,cs.CE q-fin.ST,http://creativecommons.org/licenses/by/4.0/,"  The construction of minimum spanning trees (MSTs) from correlation matrices
is an often used method to study relationships in the financial markets.
However most of the work on this topic tends to use the Pearson correlation
coefficient, which relies on the assumption of normality and can be brittle to
the presence of outliers, neither of which is ideal for the study of financial
returns. In this paper we study the inference of MSTs from daily US, UK and
German financial returns using Pearson and two rank correlation methods,
Spearman and Kendall's $\tau$. MSTs constructed using these rank methods tend
to be more stable and maintain more edges over the dataset than those
constructed using Pearson correlation. The edge agreement between the Pearson
and rank MSTs varies significantly depending on the state of the markets, but
the rank MSTs generally show strong agreement at all times. Deviation from
univariate normality can be related to changes in the correlation matrices but
is more difficult to connect to changes in the MSTs. Irrelevant of coefficient,
the trees tend to have similar topologies. Portfolios constructed from the MST
correlation matrices have a smaller turnover than those from the full
covariance matrix for the larger markets, but not for the smaller German
market. Using a bootstrap method we find that the correlation matrices
constructed using the rank correlations are more robust, but there is little
difference between the robustness of the MSTs.
","[{'version': 'v1', 'created': 'Fri, 8 May 2020 11:27:15 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Nov 2020 12:05:38 GMT'}]",2021-02-03,"[['Millington', 'Tristan', ''], ['Niranjan', 'Mahesan', '']]","['networks', 'correlation', 'finance', 'minimum spanning trees']"
6235,2201.01459,Yintong Huo,"Yintong Huo, Yuxin Su, Hongming Zhang, Michael R. Lyu",ARCLIN: Automated API Mention Resolution for Unformatted Texts,"Accepted by the 44th International Conference on Software Engineering
  (ICSE '22)",,10.1145/3510003.3510158,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online technical forums (e.g., StackOverflow) are popular platforms for
developers to discuss technical problems such as how to use specific
Application Programming Interface (API), how to solve the programming tasks, or
how to fix bugs in their codes. These discussions can often provide auxiliary
knowledge of how to use the software that is not covered by the official
documents. The automatic extraction of such knowledge will support a set of
downstream tasks like API searching or indexing. However, unlike official
documentation written by experts, discussions in open forums are made by
regular developers who write in short and informal texts, including spelling
errors or abbreviations. There are three major challenges for the accurate APIs
recognition and linking mentioned APIs from unstructured natural language
documents to an entry in the API repository: (1) distinguishing API mentions
from common words; (2) identifying API mentions without a fully qualified name;
and (3) disambiguating API mentions with similar method names but in a
different library. In this paper, to tackle these challenges, we propose an
ARCLIN tool, which can effectively distinguish and link APIs without using
human annotations. Specifically, we first design an API recognizer to
automatically extract API mentions from natural language sentences by a
Conditional Random Field (CRF) on the top of a Bi-directional Long Short-Term
Memory (Bi-LSTM) module, then we apply a context-aware scoring mechanism to
compute the mention-entry similarity for each entry in an API repository.
Compared to previous approaches with heuristic rules, our proposed tool without
manual inspection outperforms by 8% in a high-quality dataset Py-mention, which
contains 558 mentions and 2,830 sentences from five popular Python libraries.
","[{'version': 'v1', 'created': 'Wed, 5 Jan 2022 05:15:04 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Apr 2022 15:54:41 GMT'}]",2022-04-21,"[['Huo', 'Yintong', ''], ['Su', 'Yuxin', ''], ['Zhang', 'Hongming', ''], ['Lyu', 'Michael R.', '']]","['API', 'API disambiguation', 'text mining']"
6236,2002.07563,Mohammad Reza Feizi Derakhshi,"Zoleikha Jahanbakhsh-Nagadeh, Mohammad-Reza Feizi-Derakhshi, Majid
  Ramezani, Taymaz Akan (Rahkar-Farshi), Meysam Asgari-Chenaghlu, Narjes
  Nikzad-Khasmakhi, Ali-Reza Feizi-Derakhshi, Mehrdad Ranjbar-Khadivi, Elnaz
  Zafarani-Moattar and Mohammad-Ali Balafar",A Model to Measure the Spread Power of Rumors,"This is a preprint of an article published in ""Journal of Ambient
  Intelligence and Humanized Computing""",,10.1007/s12652-022-04034-1,,cs.SI cs.CL,http://creativecommons.org/licenses/by/4.0/,"  With technologies that have democratized the production and reproduction of
information, a significant portion of daily interacted posts in social media
has been infected by rumors. Despite the extensive research on rumor detection
and verification, so far, the problem of calculating the spread power of rumors
has not been considered. To address this research gap, the present study seeks
a model to calculate the Spread Power of Rumor (SPR) as the function of
content-based features in two categories: False Rumor (FR) and True Rumor (TR).
For this purpose, the theory of Allport and Postman will be adopted, which it
claims that importance and ambiguity are the key variables in rumor-mongering
and the power of rumor. Totally 42 content features in two categories
""importance"" (28 features) and ""ambiguity"" (14 features) are introduced to
compute SPR. The proposed model is evaluated on two datasets, Twitter and
Telegram. The results showed that (i) the spread power of False Rumor documents
is rarely more than True Rumors. (ii) there is a significant difference between
the SPR means of two groups False Rumor and True Rumor. (iii) SPR as a
criterion can have a positive impact on distinguishing False Rumors and True
Rumors.
","[{'version': 'v1', 'created': 'Tue, 18 Feb 2020 13:57:10 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Feb 2020 16:40:59 GMT'}, {'version': 'v3', 'created': 'Wed, 18 Nov 2020 16:07:36 GMT'}, {'version': 'v4', 'created': 'Thu, 20 Jan 2022 12:51:23 GMT'}, {'version': 'v5', 'created': 'Fri, 17 Jun 2022 05:04:17 GMT'}]",2022-06-20,"[['Jahanbakhsh-Nagadeh', 'Zoleikha', '', 'Rahkar-Farshi'], ['Feizi-Derakhshi', 'Mohammad-Reza', '', 'Rahkar-Farshi'], ['Ramezani', 'Majid', '', 'Rahkar-Farshi'], ['Akan', 'Taymaz', '', 'Rahkar-Farshi'], ['Asgari-Chenaghlu', 'Meysam', ''], ['Nikzad-Khasmakhi', 'Narjes', ''], ['Feizi-Derakhshi', 'Ali-Reza', ''], ['Ranjbar-Khadivi', 'Mehrdad', ''], ['Zafarani-Moattar', 'Elnaz', ''], ['Balafar', 'Mohammad-Ali', '']]","['Spread Power of Rumor (SPR)', 'Ambiguity of rumor', 'Importance of rumor', 'Automatic rumorverification']"
6237,2003.11644,Ankit Pal,"Ankit Pal, Muru Selvakumar and Malaikannan Sankarasubbu","Multi-Label Text Classification using Attention-based Graph Neural
  Network",,"12th International Conference on Agents and Artificial
  Intelligence (ICAART 2020)",10.5220/0008940304940505,,cs.CL cs.LG stat.ML,http://creativecommons.org/licenses/by-sa/4.0/,"  In Multi-Label Text Classification (MLTC), one sample can belong to more than
one class. It is observed that most MLTC tasks, there are dependencies or
correlations among labels. Existing methods tend to ignore the relationship
among labels. In this paper, a graph attention network-based model is proposed
to capture the attentive dependency structure among the labels. The graph
attention network uses a feature matrix and a correlation matrix to capture and
explore the crucial dependencies between the labels and generate classifiers
for the task. The generated classifiers are applied to sentence feature vectors
obtained from the text feature extraction network (BiLSTM) to enable end-to-end
training. Attention allows the system to assign different weights to neighbor
nodes per label, thus allowing it to learn the dependencies among labels
implicitly. The results of the proposed model are validated on five real-world
MLTC datasets. The proposed model achieves similar or better performance
compared to the previous state-of-the-art models.
","[{'version': 'v1', 'created': 'Sun, 22 Mar 2020 17:12:43 GMT'}]",2020-03-27,"[['Pal', 'Ankit', ''], ['Selvakumar', 'Muru', ''], ['Sankarasubbu', 'Malaikannan', '']]","['Multi-label text classification', 'Graph Neural Networks', 'Attention networks', 'Deep Learning', 'Natural LanguageProcessing', 'Supervised Learning']"
6238,2112.14328,Niklas Carlsson,"David Hasselquist, Christoffer Lindstr\""om, Nikita Korzhitskii, Niklas
  Carlsson, and Andrei Gurtov",QUIC Throughput and Fairness over Dual Connectivity,14 pages. This paper is published in Computer Networks (by Elsevier),"Computer Networks (by Elsevier), Volume 219, Dec. 2022",10.1016/j.comnet.2022.109431,,cs.NI cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dual Connectivity (DC) is an important lower-layer feature accelerating the
transition from 4G to 5G that also is expected to play an important role in
standalone 5G radio networks. However, even though the packet reordering
introduced by DC can significantly impact the performance of upper-layer
protocols, no prior work has studied the impact of DC on QUIC. In this paper,
we present the first such performance study. Using a series of throughput and
fairness experiments, we show how QUIC is affected by different DC parameters,
network conditions, and whether the DC implementation aims to improve
throughput or reliability. Results for two QUIC implementations (aioquic,
ngtcp2) and two congestion control algorithms (NewReno, CUBIC) are presented
under both static and highly time-varying network conditions. Our findings
provide network operators with insights and understanding into the impacts of
splitting QUIC traffic in a DC environment. With reasonably selected DC
parameters and increased UDP receive buffers, QUIC over DC performs similarly
to TCP over DC and achieves optimal fairness under symmetric link conditions
when DC is not used for packet duplication. The insights can help network
operators provide modern users with better end-to-end service when deploying
DC.
","[{'version': 'v1', 'created': 'Tue, 28 Dec 2021 23:28:42 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Dec 2022 14:06:13 GMT'}]",2022-12-21,"[['Hasselquist', 'David', ''], ['Lindström', 'Christoffer', ''], ['Korzhitskii', 'Nikita', ''], ['Carlsson', 'Niklas', ''], ['Gurtov', 'Andrei', '']]","['QUIC', 'Dual Connectivity', 'Throughput', 'Fairness', 'Transport Protocol', 'Multipath']"
6239,2001.08250,Raymond Cheng,"Raymond Cheng, William Scott, Elisaweta Masserova, Irene Zhang, Vipul
  Goyal, Thomas Anderson, Arvind Krishnamurthy, and Bryan Parno",Talek: Private Group Messaging with Hidden Access Patterns,,,10.1145/3427228.3427231,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Talek is a private group messaging system that sends messages through
potentially untrustworthy servers, while hiding both data content and the
communication patterns among its users. Talek explores a new point in the
design space of private messaging; it guarantees access sequence
indistinguishability, which is among the strongest guarantees in the space,
while assuming an anytrust threat model, which is only slightly weaker than the
strongest threat model currently found in related work. Our results suggest
that this is a pragmatic point in the design space, since it supports strong
privacy and good performance: we demonstrate a 3-server Talek cluster that
achieves throughput of 9,433 messages/second for 32,000 active users with
1.7-second end-to-end latency. To achieve its security goals without
coordination between clients, Talek relies on information-theoretic private
information retrieval. To achieve good performance and minimize server-side
storage, Talek introduces new techniques and optimizations that may be of
independent interest, e.g., a novel use of blocked cuckoo hashing and support
for private notifications. The latter provide a private, efficient mechanism
for users to learn, without polling, which logs have new messages.
","[{'version': 'v1', 'created': 'Wed, 22 Jan 2020 19:49:53 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Feb 2020 22:45:33 GMT'}, {'version': 'v3', 'created': 'Wed, 16 Dec 2020 03:51:07 GMT'}]",2020-12-17,"[['Cheng', 'Raymond', ''], ['Scott', 'William', ''], ['Masserova', 'Elisaweta', ''], ['Zhang', 'Irene', ''], ['Goyal', 'Vipul', ''], ['Anderson', 'Thomas', ''], ['Krishnamurthy', 'Arvind', ''], ['Parno', 'Bryan', '']]","['privacy', 'anonymity', 'messaging']"
6240,1904.07118,Sarah Wunderlich,"Sarah Wunderlich, Markus Ring, Dieter Landes and Andreas Hotho",Comparison of System Call Representations for Intrusion Detection,"12 pages, 1 figure, submitted to CISIS 2019",,10.1007/978-3-030-20005-3_2,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the years, artificial neural networks have been applied successfully in
many areas including IT security. Yet, neural networks can only process
continuous input data. This is particularly challenging for security-related
non-continuous data like system calls. This work focuses on four different
options to preprocess sequences of system calls so that they can be processed
by neural networks. These input options are based on one-hot encoding and
learning word2vec or GloVe representations of system calls. As an additional
option, we analyze if the mapping of system calls to their respective kernel
modules is an adequate generalization step for (a) replacing system calls or
(b) enhancing system call data with additional information regarding their
context. However, when performing such preprocessing steps it is important to
ensure that no relevant information is lost during the process. The overall
objective of system call based intrusion detection is to categorize sequences
of system calls as benign or malicious behavior. Therefore, this scenario is
used to evaluate the different input options as a classification task. The
results show, that each of the four different methods is a valid option when
preprocessing input data, but the use of kernel modules only is not recommended
because too much information is being lost during the mapping process.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2019 15:26:38 GMT'}, {'version': 'v2', 'created': 'Tue, 28 May 2019 09:52:24 GMT'}]",2019-05-29,"[['Wunderlich', 'Sarah', ''], ['Ring', 'Markus', ''], ['Landes', 'Dieter', ''], ['Hotho', 'Andreas', '']]","['HIDS', 'System Calls', 'Intrusion Detection', 'LSTMs']"
6241,2005.13342,Malte Ostendorff,"Malte Ostendorff, Till Blume, Saskia Ostendorff",Towards an Open Platform for Legal Information,"Accepted at ACM/IEEE Joint Conference on Digital Libraries (JCDL)
  2020",,10.1145/3383583.3398616,,cs.DL cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advances in the area of legal information systems have led to a
variety of applications that promise support in processing and accessing legal
documents. Unfortunately, these applications have various limitations, e.g.,
regarding scope or extensibility. Furthermore, we do not observe a trend
towards open access in digital libraries in the legal domain as we observe in
other domains, e.g., economics of computer science. To improve open access in
the legal domain, we present our approach for an open source platform to
transparently process and access Legal Open Data. This enables the sustainable
development of legal applications by offering a single technology stack.
Moreover, the approach facilitates the development and deployment of new
technologies. As proof of concept, we implemented six technologies and
generated metadata for more than 250,000 German laws and court decisions. Thus,
we can provide users of our platform not only access to legal documents, but
also the contained information.
","[{'version': 'v1', 'created': 'Wed, 27 May 2020 13:16:19 GMT'}]",2020-05-28,"[['Ostendorff', 'Malte', ''], ['Blume', 'Till', ''], ['Ostendorff', 'Saskia', '']]","['Legal information system', 'Open data', 'Open source', 'Legal data']"
6242,2110.02776,Alessio Fagioli,"Danilo Avola, Luigi Cinque, Alessio Fagioli, Gian Luca Foresti","SIRe-Networks: Convolutional Neural Networks Architectural Extension for
  Information Preservation via Skip/Residual Connections and Interlaced
  Auto-Encoders",,Neural Networks 153 (2022): 386-398,10.1016/j.neunet.2022.06.030,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Improving existing neural network architectures can involve several design
choices such as manipulating the loss functions, employing a diverse learning
strategy, exploiting gradient evolution at training time, optimizing the
network hyper-parameters, or increasing the architecture depth. The latter
approach is a straightforward solution, since it directly enhances the
representation capabilities of a network; however, the increased depth
generally incurs in the well-known vanishing gradient problem. In this paper,
borrowing from different methods addressing this issue, we introduce an
interlaced multi-task learning strategy, defined SIRe, to reduce the vanishing
gradient in relation to the object classification task. The presented
methodology directly improves a convolutional neural network (CNN) by
preserving information from the input image through interlaced auto-encoders
(AEs), and further refines the base network architecture by means of skip and
residual connections. To validate the presented methodology, a simple CNN and
various implementations of famous networks are extended via the SIRe strategy
and extensively tested on five collections, i.e., MNIST, Fashion-MNIST,
CIFAR-10, CIFAR-100, and Caltech-256; where the SIRe-extended architectures
achieve significantly increased performances across all models and datasets,
thus confirming the presented approach effectiveness.
","[{'version': 'v1', 'created': 'Wed, 6 Oct 2021 13:54:49 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Oct 2022 11:20:50 GMT'}]",2022-10-27,"[['Avola', 'Danilo', ''], ['Cinque', 'Luigi', ''], ['Fagioli', 'Alessio', ''], ['Foresti', 'Gian Luca', '']]","['neural network architectures', 'multi-task learning', 'deep learning', 'object classification']"
6243,2004.03717,Anup Das,"Shihao Song, Adarsha Balaji, Anup Das, Nagarajan Kandasamy, and James
  Shackleford",Compiling Spiking Neural Networks to Neuromorphic Hardware,"10 pages, 17 figures, accepted at 21st ACM SIGPLAN/SIGBED
  International Conference on Languages, Compilers, and Tools for Embedded
  Systems (LCTES 2020)",,10.1145/3372799.3394364,,cs.DC cs.AR cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Machine learning applications that are implemented with spike-based
computation model, e.g., Spiking Neural Network (SNN), have a great potential
to lower the energy consumption when they are executed on a neuromorphic
hardware. However, compiling and mapping an SNN to the hardware is challenging,
especially when compute and storage resources of the hardware (viz. crossbar)
need to be shared among the neurons and synapses of the SNN. We propose an
approach to analyze and compile SNNs on a resource-constrained neuromorphic
hardware, providing guarantee on key performance metrics such as execution time
and throughput. Our approach makes the following three key contributions.
First, we propose a greedy technique to partition an SNN into clusters of
neurons and synapses such that each cluster can fit on to the resources of a
crossbar. Second, we exploit the rich semantics and expressiveness of
Synchronous Dataflow Graphs (SDFGs) to represent a clustered SNN and analyze
its performance using Max-Plus Algebra, considering the available compute and
storage capacities, buffer sizes, and communication bandwidth. Third, we
propose a self-timed execution-based fast technique to compile and admit
SNN-based applications to a neuromorphic hardware at run-time, adapting
dynamically to the available resources on the hardware. We evaluate our
approach with standard SNN-based applications and demonstrate a significant
performance improvement compared to current practices.
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2020 21:13:27 GMT'}, {'version': 'v2', 'created': 'Tue, 12 May 2020 14:02:31 GMT'}]",2020-05-13,"[['Song', 'Shihao', ''], ['Balaji', 'Adarsha', ''], ['Das', 'Anup', ''], ['Kandasamy', 'Nagarajan', ''], ['Shackleford', 'James', '']]","['neuromorphic computing', 'data flow', 'machinelearning', 'spiking neural network']"
6244,2109.02889,Zhiyuan Zhang,"Zhiyuan Zhang, Ruixuan Luo, Xuancheng Ren, Qi Su, Liangyou Li, Xu Sun",Adversarial Parameter Defense by Multi-Step Risk Minimization,"Accepted to Neural Networks. A substantial journal extension of our
  previous conference paper arXiv:2006.05620",Neural Networks 144C (2021) pp. 154-163,10.1016/j.neunet.2021.08.022,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Previous studies demonstrate DNNs' vulnerability to adversarial examples and
adversarial training can establish a defense to adversarial examples. In
addition, recent studies show that deep neural networks also exhibit
vulnerability to parameter corruptions. The vulnerability of model parameters
is of crucial value to the study of model robustness and generalization. In
this work, we introduce the concept of parameter corruption and propose to
leverage the loss change indicators for measuring the flatness of the loss
basin and the parameter robustness of neural network parameters. On such basis,
we analyze parameter corruptions and propose the multi-step adversarial
corruption algorithm. To enhance neural networks, we propose the adversarial
parameter defense algorithm that minimizes the average risk of multiple
adversarial parameter corruptions. Experimental results show that the proposed
algorithm can improve both the parameter robustness and accuracy of neural
networks.
","[{'version': 'v1', 'created': 'Tue, 7 Sep 2021 06:13:32 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Apr 2022 03:17:11 GMT'}]",2022-04-15,"[['Zhang', 'Zhiyuan', ''], ['Luo', 'Ruixuan', ''], ['Ren', 'Xuancheng', ''], ['Su', 'Qi', ''], ['Li', 'Liangyou', ''], ['Sun', 'Xu', '']]","['Vulnerability of Deep Neural Networks', 'Parameter Corruption', 'Adversarial Parameter Defense']"
6245,2202.13547,Jian Kang,"Jian Kang, Yan Zhu, Yinglong Xia, Jiebo Luo, Hanghang Tong","RawlsGCN: Towards Rawlsian Difference Principle on Graph Convolutional
  Network",WWW'22,,10.1145/3485447.3512169,,cs.LG cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Graph Convolutional Network (GCN) plays pivotal roles in many real-world
applications. Despite the successes of GCN deployment, GCN often exhibits
performance disparity with respect to node degrees, resulting in worse
predictive accuracy for low-degree nodes. We formulate the problem of
mitigating the degree-related performance disparity in GCN from the perspective
of the Rawlsian difference principle, which is originated from the theory of
distributive justice. Mathematically, we aim to balance the utility between
low-degree nodes and high-degree nodes while minimizing the task-specific loss.
Specifically, we reveal the root cause of this degree-related unfairness by
analyzing the gradients of weight matrices in GCN. Guided by the gradients of
weight matrices, we further propose a pre-processing method RawlsGCN-Graph and
an in-processing method RawlsGCN-Grad that achieves fair predictive accuracy in
low-degree nodes without modification on the GCN architecture or introduction
of additional parameters. Extensive experiments on real-world graphs
demonstrate the effectiveness of our proposed RawlsGCN methods in significantly
reducing degree-related bias while retaining comparable overall performance.
","[{'version': 'v1', 'created': 'Mon, 28 Feb 2022 05:07:57 GMT'}]",2022-03-01,"[['Kang', 'Jian', ''], ['Zhu', 'Yan', ''], ['Xia', 'Yinglong', ''], ['Luo', 'Jiebo', ''], ['Tong', 'Hanghang', '']]","['Graph neural networks', 'algorithmic fairness', 'distributive justice']"
6246,2002.05410,Tchuitcheu Willy Carlos,"Willy Carlos Tchuitcheu, Christophe Bobda, and Md Jubaer Hossain
  Pantho","Internet of Smart-Cameras for Traffic Lights Optimization in Smart
  Cities",12 pages,Internet of Things(2020),10.1016/j.iot.2020.100207,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smart and decentralized control systems have recently been proposed to handle
the growing traffic congestion in urban cities. Proposed smart traffic light
solutions based on Wireless Sensor Network and Vehicular Ad-hoc NETwork are
either unreliable and inflexible or complex and costly. Furthermore, the
handling of special vehicles such as emergency is still not viable, especially
during busy hours. Inspired by the emergence of distributed smart cameras, we
present a novel approach to traffic control at intersections. Our approach uses
smart cameras at intersections along with image understanding for real-time
traffic monitoring and assessment. Besides understanding the traffic flow, the
cameras can detect and track special vehicles and help prioritize emergency
cases. Traffic violations can be identified as well and traffic statistics
collected. In this paper, we introduce a flexible, adaptive and distributed
control algorithm that uses the information provided by distributed smart
cameras to efficiently control traffic signals. Experimental results show that
our collision-free approach outperforms the state-of-the-art of the average
user's waiting time in the queue and improves the routing of emergency vehicles
in a cross congestion area.
","[{'version': 'v1', 'created': 'Thu, 13 Feb 2020 09:51:34 GMT'}]",2020-05-14,"[['Tchuitcheu', 'Willy Carlos', ''], ['Bobda', 'Christophe', ''], ['Pantho', 'Md Jubaer Hossain', '']]","['distributed smart-cameras', 'smart city', 'image processing', 'traffic signal', 'intelligent traffic management system', 'emergency vehicles']"
6247,2111.07693,Malte Krack,"Carlo Monjaraz-Tec, Johann Gross, Malte Krack","A massless boundary component mode synthesis method for elastodynamic
  contact problems","The final version of this article is available online at
  https://doi.org/10.1016/j.compstruc.2021.106698",,10.1016/j.compstruc.2021.106698,,cs.CE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We propose to combine the ideas of mass redistribution and component mode
synthesis. More specifically, we employ the MacNeal method, which readily leads
to a singular mass matrix, and an accordingly modified version of the
Craig-Bampton method. Besides obtaining a massless boundary, we achieve a
drastic reduction of the mathematical model order in this way compared to the
parent finite element model. Contact is modeled using set-valued laws and time
stepping is carried out with a semi-explicit scheme. We assess the method's
computational performance by a series of benchmarks, including both
frictionless and frictional contact. The results indicate that the proposed
method achieves excellent energy conservation properties and superior
convergence behavior. It reduces the spurious oscillations and decreases the
computational effort by about 1-2 orders of magnitude compared to the current
state of the art (mass-carrying component mode synthesis method). We believe
that the computational performance and favorable energy conservation properties
will be valuable for the prediction of vibro-impact processes and physical
damping.
","[{'version': 'v1', 'created': 'Mon, 15 Nov 2021 12:02:07 GMT'}]",2021-11-16,"[['Monjaraz-Tec', 'Carlo', ''], ['Gross', 'Johann', ''], ['Krack', 'Malte', '']]","['vibro-impact', 'mass redistribution', 'singular dynamic method', 'model order reduction', 'dynamicsubstructuring']"
6248,2007.15154,Jiajian Liang,"Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang",Approximate Ridesharing of Personal Vehicles Problem,"39 pages, 6 figures","Theoretical Computer Science, Volume 871, 6 June 2021, Pages 30-50",10.1016/j.tcs.2021.04.009,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ridesharing problem is that given a set of trips, each trip consists of
an individual, a vehicle of the individual and some requirements, select a
subset of trips and use the vehicles of selected trips to deliver all
individuals to their destinations satisfying the requirements. Requirements of
trips are specified by parameters including source, destination, vehicle
capacity, preferred paths of a driver, detour distance and number of stops a
driver is willing to make, and time constraints. We analyze the relations
between the time complexity and parameters for two optimization problems:
minimizing the number of selected vehicles and minimizing total travel distance
of the vehicles. We consider the following conditions: (1) all trips have the
same source or same destination, (2) no detour is allowed, (3) each participant
has one preferred path, (4) no limit on the number of stops, and (5) all trips
have the same departure and same arrival time. It is known that both
minimization problems are NP-hard if one of Conditions (1), (2) and (3) is not
satisfied. We prove that both problems are NP-hard and further show that it is
NP-hard to approximate both problems within a constant factor if Conditions (4)
or (5) is not satisfied. We give $\frac{K+2}{2}$-approximation algorithms for
minimizing the number of selected vehicles when condition (4) is not satisfied,
where $K$ is the largest capacity of all vehicles.
","[{'version': 'v1', 'created': 'Thu, 30 Jul 2020 00:01:22 GMT'}, {'version': 'v2', 'created': 'Sun, 30 May 2021 21:44:40 GMT'}]",2021-06-01,"[['Gu', 'Qian-Ping', ''], ['Liang', 'Jiajian Leo', ''], ['Zhang', 'Guochuan', '']]","['Ridesharing problem', 'optimization problems', 'approximation algorithms', 'algorithmic analysis']"
6249,1902.05029,Agostino Funel,Agostino Funel,"The Graph Structure of the Internet at the Autonomous Systems Level
  during Ten Years",,Journal of Computer and Communications 7 (2019) 17-32,10.4236/jcc.2019.78003,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study how the graph structure of the Internet at the Autonomous Systems
(AS) level evolved during a decade. For each year of the period 2008-2017 we
consider a snapshot of the AS graph and examine how many features related to
structure, connectivity and centrality changed over time. The analysis of these
metrics provides topological and data traffic information and allows to clarify
some assumptions about the models concerning the evolution of the Internet
graph structure. We find that the size of the Internet roughly doubled. The
overall trend of the average connectivity is an increase over time, while that
of the shortest path length is a decrease over time. The internal core of the
Internet is composed of a small fraction of big AS and is more stable and
connected that external cores. A hierarchical organization emerges where a
small fraction of big hubs are connected to many regions with high internal
cohesiveness, poorly connected among them and containing AS with low and medium
number of links. Centrality measurements indicate that the average number of
shortest paths crossing an AS or containing a link between two of them
decreased over time.
","[{'version': 'v1', 'created': 'Wed, 13 Feb 2019 17:47:30 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Feb 2019 10:31:41 GMT'}, {'version': 'v3', 'created': 'Mon, 26 Aug 2019 11:47:02 GMT'}]",2019-08-27,"[['Funel', 'Agostino', '']]","['Network analysis', 'Graph theory', 'Internet', 'Autonomous Systems']"
6250,2106.11594,Stephan Steinmann,"Ruben Staub (LC), Stephan N. Steinmann (LC)",Efficient recursive least squares solver for rank-deficient matrices,,"Applied Mathematics and Computation, Elsevier, 2021, 399,
  pp.125996",10.1016/j.amc.2021.125996,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Updating a linear least squares solution can be critical for near real-time
signalprocessing applications. The Greville algorithm proposes a simple formula
for updating the pseudoinverse of a matrix A $\in$ R nxm with rank r. In this
paper, we explicitly derive a similar formula by maintaining a general rank
factorization, which we call rank-Greville. Based on this formula, we
implemented a recursive least squares algorithm exploiting the rank-deficiency
of A, achieving the update of the minimum-norm least-squares solution in O(mr)
operations and, therefore, solving the linear least-squares problem from
scratch in O(nmr) operations. We empirically confirmed that this algorithm
displays a better asymptotic time complexity than LAPACK solvers for
rank-deficient matrices. The numerical stability of rank-Greville was found to
be comparable to Cholesky-based solvers. Nonetheless, our implementation
supports exact numerical representations of rationals, due to its remarkable
algebraic simplicity.
","[{'version': 'v1', 'created': 'Tue, 22 Jun 2021 07:59:35 GMT'}]",2021-06-23,"[['Staub', 'Ruben', '', 'LC'], ['Steinmann', 'Stephan N.', '', 'LC']]","['Moore-Penrose pseudoinverse', 'Generalized inverse', 'Recursive leastsquares', 'Rank-deficient linear systems']"
6251,2108.13038,Jianhua Jiang,"Jianhua Jiang, Yangang Ren, Yang Guan, Shengbo Eben Li, Yuming Yin and
  Xiaoping Jin","Integrated Decision and Control at Multi-Lane Intersections with Mixed
  Traffic Flow","8 pages, 10 figures, 11 equations and 14 conferences",,10.1088/1742-6596/2234/1/012015,,cs.LG cs.AI cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autonomous driving at intersections is one of the most complicated and
accident-prone traffic scenarios, especially with mixed traffic participants
such as vehicles, bicycles and pedestrians. The driving policy should make safe
decisions to handle the dynamic traffic conditions and meet the requirements of
on-board computation. However, most of the current researches focuses on
simplified intersections considering only the surrounding vehicles and
idealized traffic lights. This paper improves the integrated decision and
control framework and develops a learning-based algorithm to deal with complex
intersections with mixed traffic flows, which can not only take account of
realistic characteristics of traffic lights, but also learn a safe policy under
different safety constraints. We first consider different velocity models for
green and red lights in the training process and use a finite state machine to
handle different modes of light transformation. Then we design different types
of distance constraints for vehicles, traffic lights, pedestrians, bicycles
respectively and formulize the constrained optimal control problems (OCPs) to
be optimized. Finally, reinforcement learning (RL) with value and policy
networks is adopted to solve the series of OCPs. In order to verify the safety
and efficiency of the proposed method, we design a multi-lane intersection with
the existence of large-scale mixed traffic participants and set practical
traffic light phases. The simulation results indicate that the trained decision
and control policy can well balance safety and tracking performance. Compared
with model predictive control (MPC), the computational time is three orders of
magnitude lower.
","[{'version': 'v1', 'created': 'Mon, 30 Aug 2021 07:55:32 GMT'}]",2022-04-27,"[['Jiang', 'Jianhua', ''], ['Ren', 'Yangang', ''], ['Guan', 'Yang', ''], ['Li', 'Shengbo Eben', ''], ['Yin', 'Yuming', ''], ['Jin', 'Xiaoping', '']]","['Intersections', 'mixed traffic flow', 'reinforcement learning', 'decisionmaking']"
6252,2106.12633,Anthony Steed,"Anthony Steed, Tuukka M. Takala, Daniel Archer, Wallace Lages, Robert
  W. Lindeman",Directions for 3D User Interface Research from Consumer VR Games,"24 pages, 15 figures",,10.1109/TVCG.2021.3106431,,cs.HC cs.GR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  With the continuing development of affordable immersive virtual reality (VR)
systems, there is now a growing market for consumer content. The current form
of consumer systems is not dissimilar to the lab-based VR systems of the past
30 years: the primary input mechanism is a head-tracked display and one or two
tracked hands with buttons and joysticks on hand-held controllers. Over those
30 years, a very diverse academic literature has emerged that covers design and
ergonomics of 3D user interfaces (3DUIs). However, the growing consumer market
has engaged a very broad range of creatives that have built a very diverse set
of designs. Sometimes these designs adopt findings from the academic
literature, but other times they experiment with completely novel or
counter-intuitive mechanisms. In this paper and its online adjunct, we report
on novel 3DUI design patterns that are interesting from both design and
research perspectives: they are highly novel, potentially broadly re-usable
and/or suggest interesting avenues for evaluation. The supplemental material,
which is a living document, is a crowd-sourced repository of interesting
patterns. This paper is a curated snapshot of those patterns that were
considered to be the most fruitful for further elaboration.
","[{'version': 'v1', 'created': 'Wed, 23 Jun 2021 19:05:01 GMT'}]",2023-01-24,"[['Steed', 'Anthony', ''], ['Takala', 'Tuukka M.', ''], ['Archer', 'Daniel', ''], ['Lages', 'Wallace', ''], ['Lindeman', 'Robert W.', '']]","['Virtual reality', '3D user interfaces', 'games', 'interaction patterns', 'consumer head-mounted displays']"
6253,1412.0439,Chee Seng Chan,"Chern Hong Lim, Ekta Vats and Chee Seng Chan",Fuzzy human motion analysis: A review,"Accepted in Pattern Recognition, first survey paper that discusses
  and reviews fuzzy approaches towards HMA",Pattern Recognition 48(5) 2015 1773-1796,10.1016/j.patcog.2014.11.016,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human Motion Analysis (HMA) is currently one of the most popularly active
research domains as such significant research interests are motivated by a
number of real world applications such as video surveillance, sports analysis,
healthcare monitoring and so on. However, most of these real world applications
face high levels of uncertainties that can affect the operations of such
applications. Hence, the fuzzy set theory has been applied and showed great
success in the recent past. In this paper, we aim at reviewing the fuzzy set
oriented approaches for HMA, individuating how the fuzzy set may improve the
HMA, envisaging and delineating the future perspectives. To the best of our
knowledge, there is not found a single survey in the current literature that
has discussed and reviewed fuzzy approaches towards the HMA. For ease of
understanding, we conceptually classify the human motion into three broad
levels: Low-Level (LoL), Mid-Level (MiL), and High-Level (HiL) HMA.
","[{'version': 'v1', 'created': 'Mon, 1 Dec 2014 11:42:51 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Dec 2014 18:19:13 GMT'}]",2017-11-01,"[['Lim', 'Chern Hong', ''], ['Vats', 'Ekta', ''], ['Chan', 'Chee Seng', '']]","['Human motion analysis', 'fuzzy set theory', 'action recognition']"
6254,1802.05033,Francisco Charte,"Francisco Charte and Antonio J. Rivera and Mar\'ia J. del Jesus and
  Francisco Herrera",Dealing with Difficult Minority Labels in Imbalanced Mutilabel Data Sets,,,10.1016/j.neucom.2016.08.158,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multilabel classification is an emergent data mining task with a broad range
of real world applications. Learning from imbalanced multilabel data is being
deeply studied latterly, and several resampling methods have been proposed in
the literature. The unequal label distribution in most multilabel datasets,
with disparate imbalance levels, could be a handicap while learning new
classifiers. In addition, this characteristic challenges many of the existent
preprocessing algorithms. Furthermore, the concurrence between imbalanced
labels can make harder the learning from certain labels. These are what we call
\textit{difficult} labels. In this work, the problem of difficult labels is
deeply analyzed, its influence in multilabel classifiers is studied, and a
novel way to solve this problem is proposed. Specific metrics to assess this
trait in multilabel datasets, called \textit{SCUMBLE} (\textit{Score of
ConcUrrence among iMBalanced LabEls}) and \textit{SCUMBLELbl}, are presented
along with REMEDIAL (\textit{REsampling MultilabEl datasets by Decoupling
highly ImbAlanced Labels}), a new algorithm aimed to relax label concurrence.
How to deal with this problem using the R mldr package is also outlined.
","[{'version': 'v1', 'created': 'Wed, 14 Feb 2018 11:00:03 GMT'}]",2018-02-15,"[['Charte', 'Francisco', ''], ['Rivera', 'Antonio J.', ''], ['del Jesus', 'María J.', ''], ['Herrera', 'Francisco', '']]","['Multilabel classification', 'Imbalanced classification', 'Preprocessing algorithms', 'Label concurrence']"
6255,2102.00983,Moritz Wiese,Moritz Wiese and Holger Boche,Mosaics of combinatorial designs for information-theoretic security,,"Designs, Codes and Cryptography (2022) 90:593-632",10.1007/s10623-021-00994-1,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study security functions which can serve to establish semantic security
for the two central problems of information-theoretic security: the wiretap
channel, and privacy amplification for secret key generation. The security
functions are functional forms of mosaics of combinatorial designs, more
precisely, of group divisible designs and balanced incomplete block designs.
Every member of a mosaic is associated with a unique color, and each color
corresponds to a unique message or key value. Every block index of the mosaic
corresponds to a public seed shared between the two trusted communicating
parties. The seed set should be as small as possible. We give explicit examples
which have an optimal or nearly optimal trade-off of seed length versus color
(i.e., message or key) rate. We also derive bounds for the security performance
of security functions given by functional forms of mosaics of designs.
","[{'version': 'v1', 'created': 'Mon, 1 Feb 2021 17:07:17 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Jun 2021 19:07:57 GMT'}, {'version': 'v3', 'created': 'Wed, 8 Dec 2021 14:35:03 GMT'}]",2022-03-21,"[['Wiese', 'Moritz', ''], ['Boche', 'Holger', '']]","['Wiretap channel', 'privacy amplification', 'semantic security', 'mosaic of designs', 'balanced incomplete block design', 'group divisible design']"
6256,1601.05104,Ryan Womack,Ryan P. Womack,ARL Libraries and Research: Correlates of Grant Funding,"revised June 2016 version of original January 2016 submission.
  Revision contains no substantive changes, made exclusively to correct typos
  detected in the original manuscript",,10.1016/j.acalib.2016.06.006,,cs.DL stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While providing the resources and tools that make advanced research possible
is a primary mission of academic libraries at large research universities, many
other elements also contribute to the success of the research enterprise, such
as institutional funding, staffing, labs, and equipment. This study focuses on
U.S. members of the ARL, the Association for Research Libraries. Research
success is measured by the total grant funding received by the University,
creating an ordered set of categories. Combining data from the NSF National
Center for Science and Engineering Statistics, ARL Statistics, and IPEDS, the
primary explanatory factors for research success are examined. Using linear
regression, logistic regression, and the cumulative logit model, the
best-fitting models generated by ARL data, NSF data, and the combined data set
for both nominal and per capita funding are compared. These models produce the
most relevant explanatory variables for research funding, which do not include
library-related variables in most cases.
","[{'version': 'v1', 'created': 'Mon, 18 Jan 2016 05:17:51 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Jun 2016 04:13:36 GMT'}]",2016-06-22,"[['Womack', 'Ryan P.', '']]","['Academic Libraries', 'Research', 'Universities']"
6257,2201.02816,Lovedeep Singh,Lovedeep Singh,Clustering Text Using Attention,"2021 12th International Conference on Computing Communication and
  Networking Technologies (ICCCNT)",,10.1109/ICCCNT51525.2021.9579951,,cs.CL cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Clustering Text has been an important problem in the domain of Natural
Language Processing. While there are techniques to cluster text based on using
conventional clustering techniques on top of contextual or non-contextual
vector space representations, it still remains a prevalent area of research
possible to various improvements in performance and implementation of these
techniques. This paper discusses a novel technique to cluster text using
attention mechanisms. Attention Mechanisms have proven to be highly effective
in various NLP tasks in recent times. This paper extends the idea of attention
mechanism in clustering space and sheds some light on a whole new area of
research
","[{'version': 'v1', 'created': 'Sat, 8 Jan 2022 12:18:49 GMT'}]",2022-01-11,"[['Singh', 'Lovedeep', '']]","['Clustering text', 'Attention techniques', 'Natural']"
6258,1904.05250,Antonino Furnari,"Antonino Furnari, Sebastiano Battiato, Kristen Grauman, Giovanni Maria
  Farinella",Next-Active-Object prediction from Egocentric Videos,,"Journal of Visual Communication and Image Representation, Volume
  49, 2017, Pages 401-411, ISSN 1047-3203",10.1016/j.jvcir.2017.10.004,,cs.CV cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although First Person Vision systems can sense the environment from the
user's perspective, they are generally unable to predict his intentions and
goals. Since human activities can be decomposed in terms of atomic actions and
interactions with objects, intelligent wearable systems would benefit from the
ability to anticipate user-object interactions. Even if this task is not
trivial, the First Person Vision paradigm can provide important cues to address
this challenge. We propose to exploit the dynamics of the scene to recognize
next-active-objects before an object interaction begins. We train a classifier
to discriminate trajectories leading to an object activation from all others
and forecast next-active-objects by analyzing fixed-length trajectory segments
within a temporal sliding window. The proposed method compares favorably with
respect to several baselines on the Activity of Daily Living (ADL) egocentric
dataset comprising 10 hours of videos acquired by 20 subjects while performing
unconstrained interactions with several objects.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2019 15:39:19 GMT'}]",2019-04-11,"[['Furnari', 'Antonino', ''], ['Battiato', 'Sebastiano', ''], ['Grauman', 'Kristen', ''], ['Farinella', 'Giovanni Maria', '']]","['egocentric vision', 'forecasting', 'object interaction', 'next-active-object']"
6259,1809.05604,Davide Brunelli PhD,"Luca Tessaro, Cristiano Raffaldi, Maurizio Rossi, Davide Brunelli","Lightweight Synchronization Algorithm with Self-Calibration for
  Industrial LORA Sensor Networks",,,10.1109/METROI4.2018.8428309,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless sensor and actuator networks are gaining momentum in the era of
Industrial Internet of Things IIoT. The usage of the close-loop data from
sensors in the manufacturing chain is extending the common monitoring scenario
of the Wireless Sensors Networks WSN where data were just logged. In this paper
we present an accurate timing synchronization for TDMA implemented on the state
of art IoT radio, such as LoRa, that is a good solution in industrial
environments for its high robustness. Experimental results show how it is
possible to modulate the drift correction and keep the synchronization error
within the requirements.
","[{'version': 'v1', 'created': 'Fri, 14 Sep 2018 22:04:07 GMT'}]",2018-09-18,"[['Tessaro', 'Luca', ''], ['Raffaldi', 'Cristiano', ''], ['Rossi', 'Maurizio', ''], ['Brunelli', 'Davide', '']]","['TDMA', 'Synchronization', 'LoRa', 'Wireless Sensors Network', 'IIoT']"
6260,2108.01200,Tiago Barros,"T. Barros, P. Conde, G. Gon\c{c}alves, C. Premebida, M. Monteiro,
  C.S.S. Ferreira, U.J. Nunes",Multispectral Vineyard Segmentation: A Deep Learning approach,Accepted in Computer and Electronics in Agriculture journal,,10.1016/j.compag.2022.106782,,cs.CV cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Digital agriculture has evolved significantly over the last few years due to
the technological developments in automation and computational intelligence
applied to the agricultural sector, including vineyards which are a relevant
crop in the Mediterranean region. In this work, a study is presented of
semantic segmentation for vine detection in real-world vineyards by exploring
state-of-the-art deep segmentation networks and conventional unsupervised
methods. Camera data have been collected on vineyards using an Unmanned Aerial
System (UAS) equipped with a dual imaging sensor payload, namely a
high-definition RGB camera and a five-band multispectral and thermal camera.
Extensive experiments using deep-segmentation networks and unsupervised methods
have been performed on multimodal datasets representing four distinct vineyards
located in the central region of Portugal. The reported results indicate that
SegNet, U-Net, and ModSegNet have equivalent overall performance in vine
segmentation. The results also show that multimodality slightly improves the
performance of vine segmentation, but the NIR spectrum alone generally is
sufficient on most of the datasets. Furthermore, results suggest that
high-definition RGB images produce equivalent or higher performance than any
lower resolution multispectral band combination. Lastly, Deep Learning (DL)
networks have higher overall performance than classical methods. The code and
dataset are publicly available at
https://github.com/Cybonic/DL_vineyard_segmentation_study.git
","[{'version': 'v1', 'created': 'Mon, 2 Aug 2021 22:36:07 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Aug 2021 11:27:34 GMT'}, {'version': 'v3', 'created': 'Tue, 1 Mar 2022 17:59:16 GMT'}]",2022-08-18,"[['Barros', 'T.', ''], ['Conde', 'P.', ''], ['Gonçalves', 'G.', ''], ['Premebida', 'C.', ''], ['Monteiro', 'M.', ''], ['Ferreira', 'C. S. S.', ''], ['Nunes', 'U. J.', '']]","['Multispectral', 'Vineyard Segmentation', 'Deep Learning', 'Precision Agriculture']"
6261,2112.09533,Yanyi Peng,"Yanyi Peng, Masato Kikuchi, Tadachika Ozono",Online Classroom Evaluation System Based on Multi-Reaction Estimation,"6 pages, 6 figures, IEEE/WIC/ACM International Conference on Web
  Intelligence (WI-IAT21)",,10.1145/3486622.3493984,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Compared with traditional face-to-face teaching, online learning is more
convenient. However, during online classes, it is more difficult for teachers
to observe all student reactions at the same time. Our system is designed to
help teachers to adjust the speed of their lessons by detecting student
reactions. In this study, we estimate student head pose, hand poses, and
expressions through the camera, all these poses will be used as criteria for
judging the student participation. After estimating, we proposed a method to
evaluate classroom participation based on student head pose, hand poses, and
facial expression recognition. The estimated result divides the class quality
into positive, neutral, and negative, then, under the help of the system,
teachers can rearrange the content of the class.
","[{'version': 'v1', 'created': 'Fri, 17 Dec 2021 14:32:28 GMT'}]",2021-12-20,"[['Peng', 'Yanyi', ''], ['Kikuchi', 'Masato', ''], ['Ozono', 'Tadachika', '']]","['Online classroom', 'Classroom evaluation', 'Human behavior detection', 'Head pose', 'Facial expression recognition']"
6262,cs/0407010,Alexander Barg,Alexander Barg,"Improved error bounds for the erasure/list scheme: the binary and
  spherical cases","18 pages, 3 figures. Submitted to IEEE Transactions on Informatin
  Theory in May 2001, will appear in Oct. 2004 (tentative)","IEEE Transactions on Informatin Theory, vol. 50, no. 10, 2004, pp.
  2503-2511",10.1109/TIT.2004.834753,,cs.IT math.IT,,"  We derive improved bounds on the error and erasure rate for spherical codes
and for binary linear codes under Forney's erasure/list decoding scheme and
prove some related results.
","[{'version': 'v1', 'created': 'Sun, 4 Jul 2004 21:13:20 GMT'}]",2016-11-17,"[['Barg', 'Alexander', '']]","['distance distribution', 'erasure/list decoding', 'error exponent', 'spherical codes']"
6263,2101.06030,Yunlong Wang,"Samuel Rhys Cox, Yunlong Wang, Ashraf Abdul, Christian von der Weth,
  Brian Y. Lim","Directed Diversity: Leveraging Language Embedding Distances for
  Collective Creativity in Crowd Ideation",CHI 2021,,10.1145/3411764.3445782,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Crowdsourcing can collect many diverse ideas by prompting ideators
individually, but this can generate redundant ideas. Prior methods reduce
redundancy by presenting peers' ideas or peer-proposed prompts, but these
require much human coordination. We introduce Directed Diversity, an automatic
prompt selection approach that leverages language model embedding distances to
maximize diversity. Ideators can be directed towards diverse prompts and away
from prior ideas, thus improving their collective creativity. Since there are
diverse metrics of diversity, we present a Diversity Prompting Evaluation
Framework consolidating metrics from several research disciplines to analyze
along the ideation chain - prompt selection, prompt creativity, prompt-ideation
mediation, and ideation creativity. Using this framework, we evaluated Directed
Diversity in a series of a simulation study and four user studies for the use
case of crowdsourcing motivational messages to encourage physical activity. We
show that automated diverse prompting can variously improve collective
creativity across many nuanced metrics of diversity.
","[{'version': 'v1', 'created': 'Fri, 15 Jan 2021 09:36:05 GMT'}]",2021-01-18,"[['Cox', 'Samuel Rhys', ''], ['Wang', 'Yunlong', ''], ['Abdul', 'Ashraf', ''], ['von der Weth', 'Christian', ''], ['Lim', 'Brian Y.', '']]","['Diversity', 'Collective Creativity', 'Crowdsourcing', 'Ideation', 'Motivational messaging', 'Collective Intelligence', 'Creativity Support Tool']"
6264,2110.07200,Harald Willmann,"Harald Willmann, Wolfgang A. Wall","Inverse analysis of material parameters in coupled multi-physics biofilm
  models",,,10.1186/s40323-022-00220-0,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article we propose an inverse analysis algorithm to find the best fit
of multiple material parameters in different coupled multi-physics biofilm
models. We use a nonlinear continuum mechanical approach to model biofilm
deformation that occurs in flow cell experiments. The objective function is
based on a simple geometrical measurement of the distance of the fluid biofilm
interface between model and experiments. A Levenberg-Marquardt algorithm based
on finite difference approximation is used as an optimizer. The proposed method
uses a moderate to low amount of model evaluations. For a first presentation
and evaluation the algorithm is applied and tested on different numerical
examples based on generated numerical results and the addition of Gaussian
noise. Achieved numerical results show that the proposed method serves well for
different physical effects investigated and numerical approaches chosen for the
model. Presented examples show the inverse analysis for multiple parameters in
biofilm models including fluid-solid interaction effects, poroelasticity,
heterogeneous material properties and growth.
","[{'version': 'v1', 'created': 'Thu, 14 Oct 2021 07:47:59 GMT'}]",2022-12-26,"[['Willmann', 'Harald', ''], ['Wall', 'Wolfgang A.', '']]","['inverse analysis', 'fluid-solid interaction', 'biofilm', 'coupled multi-physics']"
6265,2002.10986,Nikolaos Dimitriou,"Nikolaos Dimitriou, Lampros Leontaris, Thanasis Vafeiadis, Dimosthenis
  Ioannidis, Tracy Wotherspoon, Gregory Tinker, Dimitrios Tzovaras","A Deep Learning Framework for Simulation and Defect Prediction Applied
  in Microelectronics","21 pages, 5 figures","Simulation Modelling Practice and Theory, Volume 100, 2020",10.1016/j.simpat.2019.102063,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The prediction of upcoming events in industrial processes has been a
long-standing research goal since it enables optimization of manufacturing
parameters, planning of equipment maintenance and more importantly prediction
and eventually prevention of defects. While existing approaches have
accomplished substantial progress, they are mostly limited to processing of one
dimensional signals or require parameter tuning to model environmental
parameters. In this paper, we propose an alternative approach based on deep
neural networks that simulates changes in the 3D structure of a monitored
object in a batch based on previous 3D measurements. In particular, we propose
an architecture based on 3D Convolutional Neural Networks (3DCNN) in order to
model the geometric variations in manufacturing parameters and predict upcoming
events related to sub-optimal performance. We validate our framework on a
microelectronics use-case using the recently published PCB scans dataset where
we simulate changes on the shape and volume of glue deposited on an Liquid
Crystal Polymer (LCP) substrate before the attachment of integrated circuits
(IC). Experimental evaluation examines the impact of different choices in the
cost function during training and shows that the proposed method can be
efficiently used for defect prediction.
","[{'version': 'v1', 'created': 'Tue, 25 Feb 2020 15:54:33 GMT'}]",2020-02-26,"[['Dimitriou', 'Nikolaos', ''], ['Leontaris', 'Lampros', ''], ['Vafeiadis', 'Thanasis', ''], ['Ioannidis', 'Dimosthenis', ''], ['Wotherspoon', 'Tracy', ''], ['Tinker', 'Gregory', ''], ['Tzovaras', 'Dimitrios', '']]","['deep learning', 'defect prediction', 'industrial simulation', 'integrated circuit']"
6266,2103.00032,Janice Chin,"Janice Chin, David Pearce",Finding Bugs with Specification-Based Testing is Easy!,,"The Art, Science, and Engineering of Programming, 2021, Vol. 5,
  Issue 3, Article 13",10.22152/programming-journal.org/2021/5/13,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated specification-based testing has a long history with several notable
tools having emerged. For example, QuickCheck for Haskell focuses on testing
against user-provided properties. Others, such as JMLUnit, use specifications
in the form of pre- and post-conditions to drive testing. An interesting (and
under-explored) question is how effective this approach is at finding bugs in
practice. In general, one would assume automated testing is less effective at
bug finding than static verification. But, how much less effective? To shed
light on this question, we consider automated testing of programs written in
Whiley -- a language with first-class support for specifications. Whilst
originally designed with static verification in mind, we have anecdotally found
automated testing for Whiley surprisingly useful and cost-effective. For
example, when an error is detected with automated testing, a counterexample is
always provided. This has motivated the more rigorous empirical examination
presented in this paper. To that end, we provide a technical discussion of the
implementation behind an automated testing tool for Whiley. Here, a key
usability concern is the ability to parameterise the input space, and we
present novel approaches for references and lambdas. We then report on several
large experiments investigating the tool's effectiveness at bug finding using a
range of benchmarks, including a suite of 1800+ mutants. The results indicate
the automated testing is effective in many cases, and that sampling offers
useful performance benefits with only modest reductions in bug-finding
capability. Finally, we report on some real-world uses of the tool where it has
proved effective at finding bugs (such as in the standard library).
","[{'version': 'v1', 'created': 'Fri, 26 Feb 2021 19:49:48 GMT'}]",2021-03-02,"[['Chin', 'Janice', ''], ['Pearce', 'David', '']]","['Testing', 'Verification', 'Formal Methods']"
6267,2101.04954,Dazhen Deng,"Dazhen Deng, Jiang Wu, Jiachen Wang, Yihong Wu, Xiao Xie, Zheng Zhou,
  Hui Zhang, Xiaolong Zhang, Yingcai Wu","EventAnchor: Reducing Human Interactions in Event Annotation of Racket
  Sports Videos",,"Proceedings of the 2021 CHI Conference on Human Factors in
  Computing Systems",10.1145/3411764.3445431,,cs.HC cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The popularity of racket sports (e.g., tennis and table tennis) leads to high
demands for data analysis, such as notational analysis, on player performance.
While sports videos offer many benefits for such analysis, retrieving accurate
information from sports videos could be challenging. In this paper, we propose
EventAnchor, a data analysis framework to facilitate interactive annotation of
racket sports video with the support of computer vision algorithms. Our
approach uses machine learning models in computer vision to help users acquire
essential events from videos (e.g., serve, the ball bouncing on the court) and
offers users a set of interactive tools for data annotation. An evaluation
study on a table tennis annotation system built on this framework shows
significant improvement of user performances in simple annotation tasks on
objects of interest and complex annotation tasks requiring domain knowledge.
","[{'version': 'v1', 'created': 'Wed, 13 Jan 2021 09:32:05 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Jan 2021 03:10:54 GMT'}]",2021-05-21,"[['Deng', 'Dazhen', ''], ['Wu', 'Jiang', ''], ['Wang', 'Jiachen', ''], ['Wu', 'Yihong', ''], ['Xie', 'Xiao', ''], ['Zhou', 'Zheng', ''], ['Zhang', 'Hui', ''], ['Zhang', 'Xiaolong', ''], ['Wu', 'Yingcai', '']]","['Racket sports', 'visualization', 'computer vision', 'data annotation']"
6268,2006.12399,Ana Valdivia,"Ana Valdivia, Javier S\'anchez-Monedero and Jorge Casillas","How fair can we go in machine learning? Assessing the boundaries of
  fairness in decision trees",,International Journal of Intelligent Systems (2021),10.1002/int.22354,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Fair machine learning works have been focusing on the development of
equitable algorithms that address discrimination of certain groups. Yet, many
of these fairness-aware approaches aim to obtain a unique solution to the
problem, which leads to a poor understanding of the statistical limits of bias
mitigation interventions. We present the first methodology that allows to
explore those limits within a multi-objective framework that seeks to optimize
any measure of accuracy and fairness and provides a Pareto front with the best
feasible solutions. In this work, we focus our study on decision tree
classifiers since they are widely accepted in machine learning, are easy to
interpret and can deal with non-numerical information naturally. We conclude
experimentally that our method can optimize decision tree models by being
fairer with a small cost of the classification error. We believe that our
contribution will help stakeholders of sociotechnical systems to assess how far
they can go being fair and accurate, thus serving in the support of enhanced
decision making where machine learning is used.
","[{'version': 'v1', 'created': 'Mon, 22 Jun 2020 16:28:26 GMT'}]",2021-12-14,"[['Valdivia', 'Ana', ''], ['Sánchez-Monedero', 'Javier', ''], ['Casillas', 'Jorge', '']]","['algorithmic fairness', 'group fairness', 'multi-objective optimization']"
6269,2010.04444,Paul J. Pritz,Paul J. Pritz and Liang Ma and Kin K. Leung,"Jointly-Learned State-Action Embedding for Efficient Reinforcement
  Learning",,,10.1145/3459637.3482357,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While reinforcement learning has achieved considerable successes in recent
years, state-of-the-art models are often still limited by the size of state and
action spaces. Model-free reinforcement learning approaches use some form of
state representations and the latest work has explored embedding techniques for
actions, both with the aim of achieving better generalization and
applicability. However, these approaches consider only states or actions,
ignoring the interaction between them when generating embedded representations.
In this work, we establish the theoretical foundations for the validity of
training a reinforcement learning agent using embedded states and actions. We
then propose a new approach for jointly learning embeddings for states and
actions that combines aspects of model-free and model-based reinforcement
learning, which can be applied in both discrete and continuous domains.
Specifically, we use a model of the environment to obtain embeddings for states
and actions and present a generic architecture that leverages these to learn a
policy. In this way, the embedded representations obtained via our approach
enable better generalization over both states and actions by capturing
similarities in the embedding spaces. Evaluations of our approach on several
gaming, robotic control, and recommender systems show it significantly
outperforms state-of-the-art models in both discrete/continuous domains with
large state/action spaces, thus confirming its efficacy.
","[{'version': 'v1', 'created': 'Fri, 9 Oct 2020 09:09:31 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Oct 2020 20:52:20 GMT'}, {'version': 'v3', 'created': 'Fri, 4 Dec 2020 16:37:54 GMT'}, {'version': 'v4', 'created': 'Fri, 20 Aug 2021 10:20:11 GMT'}]",2021-08-23,"[['Pritz', 'Paul J.', ''], ['Ma', 'Liang', ''], ['Leung', 'Kin K.', '']]","['reinforcement learning', 'embeddings', 'representation learning']"
6270,2110.01718,Sudam Surasinghe,Sudam Surasinghe and Erik M. Bollt,Randomized Projection Learning Method forDynamic Mode Decomposition,,,10.3390/math9212803,,cs.LG cs.NA math.NA math.ST stat.TH,http://creativecommons.org/licenses/by/4.0/,"  A data-driven analysis method known as dynamic mode decomposition (DMD)
approximates the linear Koopman operator on projected space. In the spirit of
Johnson-Lindenstrauss Lemma, we will use random projection to estimate the DMD
modes in reduced dimensional space. In practical applications, snapshots are in
high dimensional observable space and the DMD operator matrix is massive.
Hence, computing DMD with the full spectrum is infeasible, so our main
computational goal is estimating the eigenvalue and eigenvectors of the DMD
operator in a projected domain. We will generalize the current algorithm to
estimate a projected DMD operator. We focus on a powerful and simple random
projection algorithm that will reduce the computational and storage cost. While
clearly, a random projection simplifies the algorithmic complexity of a
detailed optimal projection, as we will show, generally the results can be
excellent nonetheless, and quality understood through a well-developed theory
of random projections. We will demonstrate that modes can be calculated for a
low cost by the projected data with sufficient dimension.
  Keyword: Koopman Operator, Dynamic Mode Decomposition(DMD),
Johnson-Lindenstrauss Lemma, Random Projection, Data-driven method.
","[{'version': 'v1', 'created': 'Wed, 22 Sep 2021 15:10:34 GMT'}]",2021-11-09,"[['Surasinghe', 'Sudam', ''], ['Bollt', 'Erik M.', '']]","['Koopman Operator', 'Dynamic Mode Decomposition(DMD)', 'Johnson-Lindenstrauss Lemma', 'Random Projection', 'Data-driven method']"
6271,1709.01684,Abhinav Shukla,"Abhinav Shukla, Shruti Shriya Gullapuram, Harish Katti, Karthik
  Yadati, Mohan Kankanhalli, Ramanathan Subramanian",Evaluating Content-centric vs User-centric Ad Affect Recognition,"Accepted at the ACM International Conference on Multimodal Interation
  (ICMI) 2017",,10.1145/3136755.3136796,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the fact that advertisements (ads) often include strongly emotional
content, very little work has been devoted to affect recognition (AR) from ads.
This work explicitly compares content-centric and user-centric ad AR
methodologies, and evaluates the impact of enhanced AR on computational
advertising via a user study. Specifically, we (1) compile an affective ad
dataset capable of evoking coherent emotions across users; (2) explore the
efficacy of content-centric convolutional neural network (CNN) features for
encoding emotions, and show that CNN features outperform low-level emotion
descriptors; (3) examine user-centered ad AR by analyzing Electroencephalogram
(EEG) responses acquired from eleven viewers, and find that EEG signals encode
emotional information better than content descriptors; (4) investigate the
relationship between objective AR and subjective viewer experience while
watching an ad-embedded online video stream based on a study involving 12
users. To our knowledge, this is the first work to (a) expressly compare user
vs content-centered AR for ads, and (b) study the relationship between modeling
of ad emotions and its impact on a real-life advertising application.
","[{'version': 'v1', 'created': 'Wed, 6 Sep 2017 06:17:06 GMT'}]",2017-09-07,"[['Shukla', 'Abhinav', ''], ['Gullapuram', 'Shruti Shriya', ''], ['Katti', 'Harish', ''], ['Yadati', 'Karthik', ''], ['Kankanhalli', 'Mohan', ''], ['Subramanian', 'Ramanathan', '']]","['Afect recognition', 'Ads', 'Content-centric vs User-centric', 'CNNs', 'EEG', 'Multimodal analytics', 'Computational Advertising']"
6272,2010.01576,Kenji Mase,Kenji Mase and Tomoko Yonezawa,"Body, Clothes, Water, and Toys: Media Towards Natural Music Expressions
  with Digital Sounds","Proceedings of the International Conference on New Interfaces for
  Musical Expression, 2001",,10.5281/zenodo.1176368,,cs.HC cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we introduce our research challenges for creating new musical
instruments using everyday-life media with intimate interfaces, such as the
self-body, clothes, water and stuffed toys. Various sensor technologies
including image processing and general touch sensitive devices are employed to
exploit these interaction media. The focus of our effort is to provide
user-friendly and enjoyable experiences for new music and sound performances.
Multimodality of musical instruments is explored in each attempt. The degree of
controllability in the performance and the richness of expressions are also
discussed for each installation.
","[{'version': 'v1', 'created': 'Sun, 4 Oct 2020 12:57:58 GMT'}]",2020-10-06,"[['Mase', 'Kenji', ''], ['Yonezawa', 'Tomoko', '']]","['New interface', 'music controller', 'dance', 'image processing', 'water interface', 'stuffed toy']"
6273,2206.10916,Kostia Chardonnet,"Kostia Chardonnet, Beno\^it Valiron, Renaud Vilmart",Geometry of Interaction for ZX-Diagrams,,"46th International Symposium on Mathematical Foundations of
  Computer Science (MFCS 2021)",10.4230/LIPIcs.MFCS.2021.30,,cs.LO quant-ph,http://creativecommons.org/licenses/by/4.0/,"  ZX-Calculus is a versatile graphical language for quantum computation
equipped with an equational theory. Getting inspiration from Geometry of
Interaction, in this paper we propose a token-machine-based asynchronous model
of both pure ZX-Calculus and its extension to mixed processes. We also show how
to connect this new semantics to the usual standard interpretation of
ZX-diagrams. This model allows us to have a new look at what ZX-diagrams
compute, and give a more local, operational view of the semantics of
ZX-diagrams.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2022 08:52:58 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Aug 2022 14:06:07 GMT'}]",2022-08-04,"[['Chardonnet', 'Kostia', ''], ['Valiron', 'Benoît', ''], ['Vilmart', 'Renaud', '']]","['Quantum Computation', 'Linear Logic', 'ZX-Calculus', 'Geometry of Interaction']"
6274,2001.01828,Xiaofeng Zhu,"Xiaofeng Zhu, Diego Klabjan",Listwise Learning to Rank by Exploring Unique Ratings,,WSDM 2020,10.1145/3336191.3371814,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose new listwise learning-to-rank models that mitigate
the shortcomings of existing ones. Existing listwise learning-to-rank models
are generally derived from the classical Plackett-Luce model, which has three
major limitations. (1) Its permutation probabilities overlook ties, i.e., a
situation when more than one document has the same rating with respect to a
query. This can lead to imprecise permutation probabilities and inefficient
training because of selecting documents one by one. (2) It does not favor
documents having high relevance. (3) It has a loose assumption that sampling
documents at different steps is independent. To overcome the first two
limitations, we model ranking as selecting documents from a candidate set based
on unique rating levels in decreasing order. The number of steps in training is
determined by the number of unique rating levels. We propose a new loss
function and associated four models for the entire sequence of weighted
classification tasks by assigning high weights to the selected documents with
high ratings for optimizing Normalized Discounted Cumulative Gain (NDCG). To
overcome the final limitation, we further propose a novel and efficient way of
refining prediction scores by combining an adapted Vanilla Recurrent Neural
Network (RNN) model with pooling given selected documents at previous steps. We
encode all of the documents already selected by an RNN model. In a single step,
we rank all of the documents with the same ratings using the last cell of the
RNN multiple times. We have implemented our models using three settings: neural
networks, neural networks with gradient boosting, and regression trees with
gradient boosting. We have conducted experiments on four public datasets. The
experiments demonstrate that the models notably outperform state-of-the-art
learning-to-rank models.
","[{'version': 'v1', 'created': 'Tue, 7 Jan 2020 00:50:37 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Jan 2020 03:51:49 GMT'}, {'version': 'v3', 'created': 'Thu, 23 Jan 2020 01:55:15 GMT'}]",2020-01-24,"[['Zhu', 'Xiaofeng', ''], ['Klabjan', 'Diego', '']]","['learning to rank', 'listwise learning to rank', 'deep learning', 'recurrentneural network']"
6275,cs/0604112,Jim Gray,"Jacek Becla, Andrew Hanushevsky, Sergei Nikolaev, Ghaleb Abdulla, Alex
  Szalay, Maria Nieto-Santisteban, Ani Thakar, Jim Gray",Designing a Multi-petabyte Database for LSST,8 pages. to appear in SPIE,,10.1117/12.671721,,cs.DB cs.DL,,"  The 3.2 giga-pixel LSST camera will produce approximately half a petabyte of
archive images every month. These data need to be reduced in under a minute to
produce real-time transient alerts, and then added to the cumulative catalog
for further analysis. The catalog is expected to grow about three hundred
terabytes per year. The data volume, the real-time transient alerting
requirements of the LSST, and its spatio-temporal aspects require innovative
techniques to build an efficient data access system at reasonable cost. As
currently envisioned, the system will rely on a database for catalogs and
metadata. Several database systems are being evaluated to understand how they
perform at these data rates, data volumes, and access patterns. This paper
describes the LSST requirements, the challenges they impose, the data access
philosophy, results to date from evaluating available database technologies
against LSST requirements, and the proposed database architecture to meet the
data challenges.
","[{'version': 'v1', 'created': 'Fri, 28 Apr 2006 03:04:00 GMT'}]",2009-11-11,"[['Becla', 'Jacek', ''], ['Hanushevsky', 'Andrew', ''], ['Nikolaev', 'Sergei', ''], ['Abdulla', 'Ghaleb', ''], ['Szalay', 'Alex', ''], ['Nieto-Santisteban', 'Maria', ''], ['Thakar', 'Ani', ''], ['Gray', 'Jim', '']]","['database', 'VLDB', 'petabyte', 'LSST', 'archive', 'catalog']"
6276,2206.14390,Xiaodong Gu,"Zhaowei Zhang, Hongyu Zhang, Beijun Shen, Xiaodong Gu","Diet Code Is Healthy: Simplifying Programs for Pre-trained Models of
  Code",Accepted to be published in ESEC/FSE 2022,,10.1145/3540250.3549094,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Pre-trained code representation models such as CodeBERT have demonstrated
superior performance in a variety of software engineering tasks, yet they are
often heavy in complexity, quadratically with the length of the input sequence.
Our empirical analysis of CodeBERT's attention reveals that CodeBERT pays more
attention to certain types of tokens and statements such as keywords and
data-relevant statements. Based on these findings, we propose DietCode, which
aims at lightweight leverage of large pre-trained models for source code.
DietCode simplifies the input program of CodeBERT with three strategies,
namely, word dropout, frequency filtering, and an attention-based strategy
which selects statements and tokens that receive the most attention weights
during pre-training. Hence, it gives a substantial reduction in the
computational cost without hampering the model performance. Experimental
results on two downstream tasks show that DietCodeBERT provides comparable
results to CodeBERT with 40% less computational cost in fine-tuning and
testing.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2022 04:04:38 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Aug 2022 09:23:19 GMT'}, {'version': 'v3', 'created': 'Tue, 30 Aug 2022 12:14:22 GMT'}, {'version': 'v4', 'created': 'Tue, 20 Sep 2022 08:18:43 GMT'}, {'version': 'v5', 'created': 'Mon, 21 Nov 2022 13:31:39 GMT'}]",2022-11-22,"[['Zhang', 'Zhaowei', ''], ['Zhang', 'Hongyu', ''], ['Shen', 'Beijun', ''], ['Gu', 'Xiaodong', '']]","['Program simplification', 'Pre-trained models', 'Learning program representations', 'Code intelligence']"
6277,1804.00485,Didier Verna,"Didier Verna (EPITA Research and Development Laboratory (LRDE),
  France)","Lisp, Jazz, Aikido -- Three Expressions of a Single Essence",,"The Art, Science, and Engineering of Programming, 2018, Vol. 2,
  Issue 3, Article 10",10.22152/programming-journal.org/2018/2/10,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The relation between Science (what we can explain) and Art (what we can't)
has long been acknowledged and while every science contains an artistic part,
every art form also needs a bit of science. Among all scientific disciplines,
programming holds a special place for two reasons. First, the artistic part is
not only undeniable but also essential. Second, and much like in a purely
artistic discipline, the act of programming is driven partly by the notion of
aesthetics: the pleasure we have in creating beautiful things. Even though the
importance of aesthetics in the act of programming is now unquestioned, more
could still be written on the subject. The field called ""psychology of
programming"" focuses on the cognitive aspects of the activity, with the goal of
improving the productivity of programmers. While many scientists have
emphasized their concern for aesthetics and the impact it has on their
activity, few computer scientists have actually written about their thought
process while programming. What makes us like or dislike such and such language
or paradigm? Why do we shape our programs the way we do? By answering these
questions from the angle of aesthetics, we may be able to shed some new light
on the art of programming. Starting from the assumption that aesthetics is an
inherently transversal dimension, it should be possible for every programmer to
find the same aesthetic driving force in every creative activity they
undertake, not just programming, and in doing so, get deeper insight on why and
how they do things the way they do. On the other hand, because our aesthetic
sensitivities are so personal, all we can really do is relate our own
experiences and share it with others, in the hope that it will inspire them to
do the same. My personal life has been revolving around three major creative
activities, of equal importance: programming in Lisp, playing Jazz music, and
practicing Aikido. But why so many of them, why so different ones, and why
these specifically? By introspecting my personal aesthetic sensitivities, I
eventually realized that my tastes in the scientific, artistic, and physical
domains are all motivated by the same driving forces, hence unifying Lisp,
Jazz, and Aikido as three expressions of a single essence, not so different
after all. Lisp, Jazz, and Aikido are governed by a limited set of rules which
remain simple and unobtrusive. Conforming to them is a pleasure. Because Lisp,
Jazz, and Aikido are inherently introspective disciplines, they also invite you
to transgress the rules in order to find your own. Breaking the rules is fun.
Finally, if Lisp, Jazz, and Aikido unify so many paradigms, styles, or
techniques, it is not by mere accumulation but because they live at the
meta-level and let you reinvent them. Working at the meta-level is an
enlightening experience. Understand your aesthetic sensitivities and you may
gain considerable insight on your own psychology of programming. Mine is
perhaps common to most lispers. Perhaps also common to other programming
communities, but that, is for the reader to decide...
","[{'version': 'v1', 'created': 'Tue, 27 Mar 2018 17:56:08 GMT'}]",2018-04-03,"[['Verna', 'Didier', '', 'EPITA Research and Development Laboratory']]","['Programming Languages', 'Martial Arts', 'Music', 'Aesthetics']"
6278,cs/0404029,David Eppstein,"Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein,
  and Christian Scheideler",The Effect of Faults on Network Expansion,8 pages; to appear at SPAA 2004,Theor. Comput. Syst. 39(6):903-928. November 2006,10.1007/s00224-006-1349-0,,cs.DC cs.DM,,"  In this paper we study the problem of how resilient networks are to node
faults. Specifically, we investigate the question of how many faults a network
can sustain so that it still contains a large (i.e. linear-sized) connected
component that still has approximately the same expansion as the original
fault-free network. For this we apply a pruning technique which culls away
parts of the faulty network which have poor expansion. This technique can be
applied to both adversarial faults and to random faults. For adversarial faults
we prove that for every network with expansion alpha, a large connected
component with basically the same expansion as the original network exists for
up to a constant times alpha n faults. This result is tight in the sense that
every graph G of size n and uniform expansion alpha(.), i.e. G has an expansion
of alpha(n) and every subgraph G' of size m of G has an expansion of
O(alpha(m)), can be broken into sublinear components with omega(alpha(n) n)
faults.
  For random faults we observe that the situation is significantly different,
because in this case the expansion of a graph only gives a very weak bound on
its resilience to random faults. More specifically, there are networks of
uniform expansion O(sqrt{n}) that are resilient against a constant fault
probability but there are also networks of uniform expansion Omega(1/log n)
that are not resilient against a O(1/log n) fault probability. Thus, a
different parameter is needed. For this we introduce the span of a graph which
allows us to determine the maximum fault probability in a much better way than
the expansion can. We use the span to show the first known results for the
effect of random faults on the expansion of d-dimensional meshes.
","[{'version': 'v1', 'created': 'Tue, 13 Apr 2004 18:33:36 GMT'}]",2014-09-01,"[['Bagchi', 'Amitabha', ''], ['Bhargava', 'Ankur', ''], ['Chaudhary', 'Amitabh', ''], ['Eppstein', 'David', ''], ['Scheideler', 'Christian', '']]","['faulty networks', 'expansion', 'd-dimensional mesh', 'random faults']"
6279,2104.11170,Lucrezia Grassi,"Lucrezia Grassi, Carmine Tommaso Recchiuto, Antonio Sgorbissa","Knowledge Triggering, Extraction and Storage via Human-Robot Verbal
  Interaction","19 pages, 7 figures, submitted to Robotics and Autonomous Systems",Robotics and Autonomous Systems 148 (2022),10.1016/j.robot.2021.103938,,cs.RO cs.AI,http://creativecommons.org/licenses/by/4.0/,"  This article describes a novel approach to expand in run-time the knowledge
base of an Artificial Conversational Agent. A technique for automatic knowledge
extraction from the user's sentence and four methods to insert the new acquired
concepts in the knowledge base have been developed and integrated into a system
that has already been tested for knowledge-based conversation between a social
humanoid robot and residents of care homes. The run-time addition of new
knowledge allows overcoming some limitations that affect most robots and
chatbots: the incapability of engaging the user for a long time due to the
restricted number of conversation topics. The insertion in the knowledge base
of new concepts recognized in the user's sentence is expected to result in a
wider range of topics that can be covered during an interaction, making the
conversation less repetitive. Two experiments are presented to assess the
performance of the knowledge extraction technique, and the efficiency of the
developed insertion methods when adding several concepts in the Ontology.
","[{'version': 'v1', 'created': 'Thu, 22 Apr 2021 16:41:15 GMT'}]",2022-03-09,"[['Grassi', 'Lucrezia', ''], ['Recchiuto', 'Carmine Tommaso', ''], ['Sgorbissa', 'Antonio', '']]","['Social Robotics', 'Human-Robot Interaction', 'Knowledge-grounded conversation', 'Knowledgeextraction']"
6280,2205.00188,Katie Seaborn,"Jacqueline Urakami, Yeongdae Kim, Hiroki Oura, Katie Seaborn","Finding Strategies Against Misinformation in Social Media: A Qualitative
  Study",Accepted at CHI EA '22,"CHI EA '22: CHI Conference on Human Factors in Computing Systems
  Extended Abstracts, April 2022, Article No.: 242",10.1145/3491101.3519661,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Misinformation spread through social media has become a fundamental challenge
in modern society. Recent studies have evaluated various strategies for
addressing this problem, such as by modifying social media platforms or
educating people about misinformation, to varying degrees of success. Our goal
is to develop a new strategy for countering misinformation: intelligent tools
that encourage social media users to foster metacognitive skills ""in the wild.""
As a first step, we conducted focus groups with social media users to discover
how they can be best supported in combating misinformation. Qualitative
analyses of the discussions revealed that people find it difficult to detect
misinformation. Findings also indicated a need for but lack of resources to
support cross-validation of information. Moreover, misinformation had a nuanced
emotional impact on people. Suggestions for the design of intelligent tools
that support social media users in information selection, information
engagement, and emotional response management are presented.
","[{'version': 'v1', 'created': 'Sat, 30 Apr 2022 07:29:48 GMT'}]",2022-05-03,"[['Urakami', 'Jacqueline', ''], ['Kim', 'Yeongdae', ''], ['Oura', 'Hiroki', ''], ['Seaborn', 'Katie', '']]","['misinformation', 'social media', 'focus group', 'opinion discussion', 'emotional reactions']"
6281,2111.07592,Tanay Gummadi,"Naveen Ram, Tanay Gummadi, Rahul Bhethanabotla, Richard J. Savery, Gil
  Weinberg","Say What? Collaborative Pop Lyric Generation Using Multitask Transfer
  Learning","HAI '21: Proceedings of the 9th International Conference on
  Human-Agent Interaction","Proceedings of the 9th International Conference on Human-Agent
  Interaction (2021) 165-173",10.1145/3472307.3484175,,cs.CL cs.HC cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Lyric generation is a popular sub-field of natural language generation that
has seen growth in recent years. Pop lyrics are of unique interest due to the
genre's unique style and content, in addition to the high level of
collaboration that goes on behind the scenes in the professional pop
songwriting process. In this paper, we present a collaborative line-level lyric
generation system that utilizes transfer-learning via the T5 transformer model,
which, till date, has not been used to generate pop lyrics. By working and
communicating directly with professional songwriters, we develop a model that
is able to learn lyrical and stylistic tasks like rhyming, matching line beat
requirements, and ending lines with specific target words. Our approach
compares favorably to existing methods for multiple datasets and yields
positive results from our online studies and interviews with industry
songwriters.
","[{'version': 'v1', 'created': 'Mon, 15 Nov 2021 08:13:26 GMT'}]",2021-11-16,"[['Ram', 'Naveen', ''], ['Gummadi', 'Tanay', ''], ['Bhethanabotla', 'Rahul', ''], ['Savery', 'Richard J.', ''], ['Weinberg', 'Gil', '']]","['lyric generation', 'collaborative AI', 'transfer learning', 'transformers', 'natural language generation', 'pop music']"
6282,2204.07731,Suwichaya Suwanwimolkul,Suwichaya Suwanwimolkul and Satoshi Komorita,Efficient Linear Attention for Fast and Accurate Keypoint Matching,To be published in ACM ICMR 2022,,10.1145/3512527.3531369,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently Transformers have provided state-of-the-art performance in sparse
matching, crucial to realize high-performance 3D vision applications. Yet,
these Transformers lack efficiency due to the quadratic computational
complexity of their attention mechanism. To solve this problem, we employ an
efficient linear attention for the linear computational complexity. Then, we
propose a new attentional aggregation that achieves high accuracy by
aggregating both the global and local information from sparse keypoints. To
further improve the efficiency, we propose the joint learning of feature
matching and description. Our learning enables simpler and faster matching than
Sinkhorn, often used in matching the learned descriptors from Transformers. Our
method achieves competitive performance with only 0.84M learnable parameters
against the bigger SOTAs, SuperGlue (12M parameters) and SGMNet (30M
parameters), on three benchmarks, HPatch, ETH, and Aachen Day-Night.
","[{'version': 'v1', 'created': 'Sat, 16 Apr 2022 06:17:36 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Apr 2022 05:07:41 GMT'}, {'version': 'v3', 'created': 'Fri, 22 Apr 2022 16:16:26 GMT'}]",2022-04-25,"[['Suwanwimolkul', 'Suwichaya', ''], ['Komorita', 'Satoshi', '']]","['Sparse matching', 'learning-based matching', 'visual localization', 'SfM']"
6283,2107.06108,Franz Poeschel,"Franz Poeschel and Juncheng E and William F. Godoy and Norbert
  Podhorszki and Scott Klasky and Greg Eisenhauer and Philip E. Davis and
  Lipeng Wan and Ana Gainaru and Junmin Gu and Fabian Koller and Ren\'e Widera
  and Michael Bussmann and Axel Huebl","Transitioning from file-based HPC workflows to streaming data pipelines
  with openPMD and ADIOS2","18 pages, 9 figures, SMC2021, supplementary material at
  https://zenodo.org/record/4906276",,10.1007/978-3-030-96498-6_6,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper aims to create a transition path from file-based IO to
streaming-based workflows for scientific applications in an HPC environment. By
using the openPMP-api, traditional workflows limited by filesystem bottlenecks
can be overcome and flexibly extended for in situ analysis. The openPMD-api is
a library for the description of scientific data according to the Open Standard
for Particle-Mesh Data (openPMD). Its approach towards recent challenges posed
by hardware heterogeneity lies in the decoupling of data description in domain
sciences, such as plasma physics simulations, from concrete implementations in
hardware and IO. The streaming backend is provided by the ADIOS2 framework,
developed at Oak Ridge National Laboratory. This paper surveys two
openPMD-based loosely-coupled setups to demonstrate flexible applicability and
to evaluate performance. In loose coupling, as opposed to tight coupling, two
(or more) applications are executed separately, e.g. in individual MPI
contexts, yet cooperate by exchanging data. This way, a streaming-based
workflow allows for standalone codes instead of tightly-coupled plugins, using
a unified streaming-aware API and leveraging high-speed communication
infrastructure available in modern compute clusters for massive data exchange.
We determine new challenges in resource allocation and in the need of
strategies for a flexible data distribution, demonstrating their influence on
efficiency and scaling on the Summit compute system. The presented setups show
the potential for a more flexible use of compute resources brought by streaming
IO as well as the ability to increase throughput by avoiding filesystem
bottlenecks.
","[{'version': 'v1', 'created': 'Tue, 13 Jul 2021 13:59:04 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Jan 2022 15:05:32 GMT'}]",2022-03-22,"[['Poeschel', 'Franz', ''], ['E', 'Juncheng', ''], ['Godoy', 'William F.', ''], ['Podhorszki', 'Norbert', ''], ['Klasky', 'Scott', ''], ['Eisenhauer', 'Greg', ''], ['Davis', 'Philip E.', ''], ['Wan', 'Lipeng', ''], ['Gainaru', 'Ana', ''], ['Gu', 'Junmin', ''], ['Koller', 'Fabian', ''], ['Widera', 'René', ''], ['Bussmann', 'Michael', ''], ['Huebl', 'Axel', '']]","['high performance computing', 'big data', 'streaming', 'RDMA']"
6284,2204.05902,Isabella Gra{\ss}l,"Isabella Gra{\ss}l, Gordon Fraser","Scratch as Social Network: Topic Modeling and Sentiment Analysis in
  Scratch Projects",,,10.1145/3510458.3513021,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Societal matters like the Black Lives Matter (BLM) movement influence
software engineering, as the recent debate on replacing certain discriminatory
terms such as whitelist/blacklist has shown. Identifying relevant and trending
societal matters is important, and often done using social network analysis for
traditional social media channels such as twitter. In this paper we explore
whether this type of analysis can also be used for introspection of the
software world, by looking at the thriving scene of young Scratch programmers.
The educational programming language Scratch is not only used for teaching
programming concepts, but offers a platform for young programmers to express
and share their creativity on any topics of relevance. By analyzing titles and
project comments in a dataset of 106.032 Scratch projects, we explore which
topics are common in the Scratch community, whether socially relevant events
are reflected and how how the sentiment in the comments is. It turns out that
the diversity of topics within the Scratch projects make the analysis process
challenging. Our results nevertheless show that topics from pop and net culture
in particular are present, and even recent societal events such as the Covid-19
pandemic or BLM are to some extent reflected in Scratch. The tone in the
comments is mostly positive with catchy youth language. Hence, despite the
challenges, Scratch projects can be studied in the same way as social networks,
which opens up new possibilities to improve our understanding of the behavior
and motivation of novice programmers.
","[{'version': 'v1', 'created': 'Tue, 12 Apr 2022 15:55:52 GMT'}]",2022-04-13,"[['Graßl', 'Isabella', ''], ['Fraser', 'Gordon', '']]","['Scratch', 'topic modeling', 'sentiment analysis', 'social network']"
6285,2008.06402,Stefanos Laskaridis,"Stefanos Laskaridis, Stylianos I. Venieris, Mario Almeida, Ilias
  Leontiadis, Nicholas D. Lane","SPINN: Synergistic Progressive Inference of Neural Networks over Device
  and Cloud","Accepted at the 26th Annual International Conference on Mobile
  Computing and Networking (MobiCom), 2020",,10.1145/3372224.3419194,,cs.LG cs.CV cs.DC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the soaring use of convolutional neural networks (CNNs) in mobile
applications, uniformly sustaining high-performance inference on mobile has
been elusive due to the excessive computational demands of modern CNNs and the
increasing diversity of deployed devices. A popular alternative comprises
offloading CNN processing to powerful cloud-based servers. Nevertheless, by
relying on the cloud to produce outputs, emerging mission-critical and
high-mobility applications, such as drone obstacle avoidance or interactive
applications, can suffer from the dynamic connectivity conditions and the
uncertain availability of the cloud. In this paper, we propose SPINN, a
distributed inference system that employs synergistic device-cloud computation
together with a progressive inference method to deliver fast and robust CNN
inference across diverse settings. The proposed system introduces a novel
scheduler that co-optimises the early-exit policy and the CNN splitting at run
time, in order to adapt to dynamic conditions and meet user-defined
service-level requirements. Quantitative evaluation illustrates that SPINN
outperforms its state-of-the-art collaborative inference counterparts by up to
2x in achieved throughput under varying network conditions, reduces the server
cost by up to 6.8x and improves accuracy by 20.7% under latency constraints,
while providing robust operation under uncertain connectivity conditions and
significant energy savings compared to cloud-centric execution.
","[{'version': 'v1', 'created': 'Fri, 14 Aug 2020 15:00:19 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Aug 2020 10:24:41 GMT'}]",2020-08-25,"[['Laskaridis', 'Stefanos', ''], ['Venieris', 'Stylianos I.', ''], ['Almeida', 'Mario', ''], ['Leontiadis', 'Ilias', ''], ['Lane', 'Nicholas D.', '']]","['Deep neural networks', 'distributed systems', 'mobile computing']"
6286,2210.02009,Jialei Xu,"Jialei Xu, Xianming Liu, Yuanchao Bai, Junjun Jiang, Kaixuan Wang,
  Xiaozhi Chen, Xiangyang Ji","Multi-Camera Collaborative Depth Prediction via Consistent Structure
  Estimation",,,10.1145/3503161.3548394,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Depth map estimation from images is an important task in robotic systems.
Existing methods can be categorized into two groups including multi-view stereo
and monocular depth estimation. The former requires cameras to have large
overlapping areas and sufficient baseline between cameras, while the latter
that processes each image independently can hardly guarantee the structure
consistency between cameras. In this paper, we propose a novel multi-camera
collaborative depth prediction method that does not require large overlapping
areas while maintaining structure consistency between cameras. Specifically, we
formulate the depth estimation as a weighted combination of depth basis, in
which the weights are updated iteratively by a refinement network driven by the
proposed consistency loss. During the iterative update, the results of depth
estimation are compared across cameras and the information of overlapping areas
is propagated to the whole depth maps with the help of basis formulation.
Experimental results on DDAD and NuScenes datasets demonstrate the superior
performance of our method.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2022 03:44:34 GMT'}]",2022-10-06,"[['Xu', 'Jialei', ''], ['Liu', 'Xianming', ''], ['Bai', 'Yuanchao', ''], ['Jiang', 'Junjun', ''], ['Wang', 'Kaixuan', ''], ['Chen', 'Xiaozhi', ''], ['Ji', 'Xiangyang', '']]","['Depth estimation', 'multi-camera', '3D perception']"
6287,2104.01270,Benno Stein,"Benno Stein, Bor-Yuh Evan Chang, Manu Sridharan",Demanded Abstract Interpretation (Extended Version),extended version of PLDI'21 paper (with appendices),,10.1145/3453483.3454044,,cs.PL,http://creativecommons.org/licenses/by/4.0/,"  We consider the problem of making expressive static analyzers interactive.
Formal static analysis is seeing increasingly widespread adoption as a tool for
verification and bug-finding, but even with powerful cloud infrastructure it
can take minutes or hours to get batch analysis results after a code change.
While existing techniques offer some demand-driven or incremental aspects for
certain classes of analysis, the fundamental challenge we tackle is doing both
for arbitrary abstract interpreters.
  Our technique, demanded abstract interpretation, lifts program syntax and
analysis state to a dynamically evolving graph structure, in which program
edits, client-issued queries, and evaluation of abstract semantics are all
treated uniformly. The key difficulty addressed by our approach is the
application of general incremental computation techniques to the complex,
cyclic dependency structure induced by abstract interpretation of loops with
widening operators. We prove that desirable abstract interpretation
meta-properties, including soundness and termination, are preserved in our
approach, and that demanded analysis results are equal to those computed by a
batch abstract interpretation. Experimental results suggest promise for a
prototype demanded abstract interpretation framework: by combining incremental
and demand-driven techniques, our framework consistently delivers analysis
results at interactive speeds, answering 95% of queries within 1.2 seconds.
","[{'version': 'v1', 'created': 'Fri, 2 Apr 2021 23:08:47 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Apr 2021 22:25:43 GMT'}]",2021-04-08,"[['Stein', 'Benno', ''], ['Chang', 'Bor-Yuh Evan', ''], ['Sridharan', 'Manu', '']]","['Abstract interpretation', 'Incremental computation', 'Demand-driven query evaluation', 'Demanded fixed points']"
6288,2202.06066,Jayson Victoriano Mr.,"Jayson M. Victoriano, Manuel Luis C. Delos Santos, Albert A. Vinluan
  and Jennifer T. Carpio","Predicting Pollution Level Using Random Forest: A Case Study of Marilao
  River in Bulacan Province, Philippines",,"International Journal of Computing Sciences Research (ISSN print:
  2546-0552; ISSN online: 2546-115X) Vol. 3, No. 1, pp. 151-162, March 11, 2019",10.25147/ijcsr.2017.001.1.30,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study aims to predict the pollution level that threatens the Marilao
River, located in the province of Bulacan, Philippines. The inhabitants of this
area are now being exposed to pollution. Contamination of this waterway comes
from both formal and informal industries, such as a used lead-acid battery,
open dumpsites metal refining, and other toxic metals. Using various water
quality parameters like Dissolved Oxygen (DO), Potential of Hydrogen (pH),
Biochemical Oxygen Demand (BOD) and Total Suspended Solids (TSS) were the basis
for predicting the pollution level. This study used the Data Mining technique
based on the sample data collected from January of 2013 to November of 2017.
These were used as a training data and test results to predict the river
condition with its corresponding pollution level classification indicated with
the used of colors such as Green for Normal, Yellow for Average, Orange for
Polluted and Red for Highly Polluted. The model got an accuracy of 91.75% with
a Kappa value of 0.8115, interpreted as Strong in terms of the level of
agreement.
","[{'version': 'v1', 'created': 'Sat, 12 Feb 2022 13:47:21 GMT'}]",2022-02-15,"[['Victoriano', 'Jayson M.', ''], ['Santos', 'Manuel Luis C. Delos', ''], ['Vinluan', 'Albert A.', ''], ['Carpio', 'Jennifer T.', '']]","['machine learning', 'river pollution', 'data mining', 'random forest    INTRODUCTION']"
6289,1707.09038,Mario Linares-V\'asquez,"Mario Linares-V\'asquez, Gabriele Bavota, Michele Tufano, Kevin Moran,
  Massimiliano Di Penta, Christopher Vendome, Carlos Bernal-C\'ardenas, Denys
  Poshyvanyk",Enabling Mutation Testing for Android Apps,"Accepted at 11TH Joint Meeting of the European Software Engineering
  Conference and the ACM SIGSOFT Symposium on the Foundations of Software
  Engineering (ESEC/FSE 17)",,10.1145/3106237.3106275,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mutation testing has been widely used to assess the fault-detection
effectiveness of a test suite, as well as to guide test case generation or
prioritization. Empirical studies have shown that, while mutants are generally
representative of real faults, an effective application of mutation testing
requires ""traditional"" operators designed for programming languages to be
augmented with operators specific to an application domain and/or technology.
This paper proposes MDroid+, a framework for effective mutation testing of
Android apps. First, we systematically devise a taxonomy of 262 types of
Android faults grouped in 14 categories by manually analyzing 2,023 software
artifacts from different sources (e.g., bug reports, commits). Then, we
identified a set of 38 mutation operators, and implemented an infrastructure to
automatically seed mutations in Android apps with 35 of the identified
operators. The taxonomy and the proposed operators have been evaluated in terms
of stillborn/trivial mutants generated and their capacity to represent real
faults in Android apps, as compared to other well know mutation tools.
","[{'version': 'v1', 'created': 'Thu, 27 Jul 2017 20:49:04 GMT'}, {'version': 'v2', 'created': 'Mon, 31 Jul 2017 00:35:57 GMT'}, {'version': 'v3', 'created': 'Tue, 1 Aug 2017 03:02:58 GMT'}]",2017-08-02,"[['Linares-Vásquez', 'Mario', ''], ['Bavota', 'Gabriele', ''], ['Tufano', 'Michele', ''], ['Moran', 'Kevin', ''], ['Di Penta', 'Massimiliano', ''], ['Vendome', 'Christopher', ''], ['Bernal-Cárdenas', 'Carlos', ''], ['Poshyvanyk', 'Denys', '']]","['Mutation testing', 'Fault taxonomy', 'Operators', 'Android']"
6290,1902.03088,Hasan Asy'ari Arief,"Hasan Asyari Arief, Ulf Geir Indahl, Geir-Harald Strand, H{\aa}vard
  Tveite",Addressing Overfitting on Pointcloud Classification using Atrous XCRF,,"ISPRS Journal of Photogrammetry and Remote Sensing Volume 155,
  September 2019, Pages 90-101",10.1016/j.isprsjprs.2019.07.002,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advances in techniques for automated classification of pointcloud data
introduce great opportunities for many new and existing applications. However,
with a limited number of labeled points, automated classification by a machine
learning model is prone to overfitting and poor generalization. The present
paper addresses this problem by inducing controlled noise (on a trained model)
generated by invoking conditional random field similarity penalties using
nearby features. The method is called Atrous XCRF and works by forcing a
trained model to respect the similarity penalties provided by unlabeled data.
In a benchmark study carried out using the ISPRS 3D labeling dataset, our
technique achieves 84.97% in term of overall accuracy, and 71.05% in term of F1
score. The result is on par with the current best model for the benchmark
dataset and has the highest value in term of F1 score.
","[{'version': 'v1', 'created': 'Fri, 8 Feb 2019 14:20:42 GMT'}]",2019-10-09,"[['Arief', 'Hasan Asyari', ''], ['Indahl', 'Ulf Geir', ''], ['Strand', 'Geir-Harald', ''], ['Tveite', 'Håvard', '']]","['pointcloud classification', 'overfitting problem', 'conditional random field']"
6291,2103.04863,Mo Han,"Mo Han, Sezen Ya{\u{g}}mur G\""unay, \.Ilkay Y{\i}ld{\i}z, Paolo
  Bonato, Cagdas D. Onal, Ta\c{s}k{\i}n Pad{\i}r, Gunar Schirner, Deniz
  Erdo{\u{g}}mu\c{s}","From Hand-Perspective Visual Information to Grasp Type Probabilities:
  Deep Learning via Ranking Labels",,,10.1145/3316782.3316794,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Limb deficiency severely affects the daily lives of amputees and drives
efforts to provide functional robotic prosthetic hands to compensate this
deprivation. Convolutional neural network-based computer vision control of the
prosthetic hand has received increased attention as a method to replace or
complement physiological signals due to its reliability by training visual
information to predict the hand gesture. Mounting a camera into the palm of a
prosthetic hand is proved to be a promising approach to collect visual data.
However, the grasp type labelled from the eye and hand perspective may differ
as object shapes are not always symmetric. Thus, to represent this difference
in a realistic way, we employed a dataset containing synchronous images from
eye- and hand- view, where the hand-perspective images are used for training
while the eye-view images are only for manual labelling. Electromyogram (EMG)
activity and movement kinematics data from the upper arm are also collected for
multi-modal information fusion in future work. Moreover, in order to include
human-in-the-loop control and combine the computer vision with physiological
signal inputs, instead of making absolute positive or negative predictions, we
build a novel probabilistic classifier according to the Plackett-Luce model. To
predict the probability distribution over grasps, we exploit the statistical
model over label rankings to solve the permutation domain problems via a
maximum likelihood estimation, utilizing the manually ranked lists of grasps as
a new form of label. We indicate that the proposed model is applicable to the
most popular and productive convolutional neural network frameworks.
","[{'version': 'v1', 'created': 'Mon, 8 Mar 2021 16:12:38 GMT'}]",2021-03-09,"[['Han', 'Mo', ''], ['Günay', 'Sezen Ya{ğ}mur', ''], ['Yıldız', 'İlkay', ''], ['Bonato', 'Paolo', ''], ['Onal', 'Cagdas D.', ''], ['Padır', 'Taşkın', ''], ['Schirner', 'Gunar', ''], ['Erdo{ğ}muş', 'Deniz', '']]","['probability estimation', 'label ranking', 'grasp dataset', 'grasp classi\uffffcation', 'multi-class classi\uffffcation', 'prosthetic hand']"
6292,1903.07022,Kexue Zhang,Kexue Zhang,"Integral Input-to-State Stability of Nonlinear Time-Delay Systems with
  Delay-Dependent Impulse Effects",,Nonlinear Analysis: Hybrid Systems 37 (2020) 100907,10.1016/j.nahs.2020.100907,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies integral input-to-state stability (iISS) of nonlinear
impulsive systems with time-delay in both the continuous dynamics and the
impulses. Several iISS results are established by using the method of
Lyapunov-Krasovskii functionals. For impulsive systems with iISS continuous
dynamics and destabilizing impulses, we derive two iISS criteria that guarantee
the uniform iISS of the whole system provided that the time period between two
successive impulse moments is appropriately bounded from below. Then we provide
an iISS result for systems with unstable continuous dynamics and stabilizing
impulses. For this scenario, it is shown that the iISS properties are
guaranteed if the impulses occur frequently enough. For impulsive systems with
stabilizing impulses and stable continuous dynamics for zero input, we obtain
an iISS result which shows that the entire system is uniformly iISS over
arbitrary impulse time sequences. As applications, iISS properties of a class
of bilinear systems are studied in details with simulations to demonstrate the
presented results.
","[{'version': 'v1', 'created': 'Sun, 17 Mar 2019 03:35:24 GMT'}, {'version': 'v2', 'created': 'Sat, 26 Oct 2019 23:47:48 GMT'}, {'version': 'v3', 'created': 'Tue, 4 Feb 2020 18:09:08 GMT'}]",2022-06-09,"[['Zhang', 'Kexue', '']]","['Impulsive systems', 'time-delay', 'integral input-to-state stability', 'delay-dependent']"
6293,2203.09639,Alhasan Abdellatif,"Alhasan Abdellatif, Ahmed H. Elsheikh, Gavin Graham, Daniel Busby,
  Philippe Berthet","Generating unrepresented proportions of geological facies using
  Generative Adversarial Networks",,,10.1016/j.cageo.2022.105085,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we investigate the capacity of Generative Adversarial Networks
(GANs) in interpolating and extrapolating facies proportions in a geological
dataset. The new generated realizations with unrepresented (aka. missing)
proportions are assumed to belong to the same original data distribution.
Specifically, we design a conditional GANs model that can drive the generated
facies toward new proportions not found in the training set. The presented
study includes an investigation of various training settings and model
architectures. In addition, we devised new conditioning routines for an
improved generation of the missing samples. The presented numerical experiments
on images of binary and multiple facies showed good geological consistency as
well as strong correlation with the target conditions.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2022 22:38:45 GMT'}]",2022-05-12,"[['Abdellatif', 'Alhasan', ''], ['Elsheikh', 'Ahmed H.', ''], ['Graham', 'Gavin', ''], ['Busby', 'Daniel', ''], ['Berthet', 'Philippe', '']]","['Generative Adversarial Networks (GANs)', 'Stochastic Fields', 'Multipoint Geostatistics']"
6294,1710.04131,Thomas Strasser,"Panos Kotsampopoulos, Nikos Hatziargyriou, Thomas I. Strasser, Cyndi
  Moyo, Sebastian Rohjans, Cornelius Steinbrink, Sebastian Lehnhoff, Peter
  Palensky, Arjen A. van der Meer, Daniel Esteban Morales Bondy, Kai Heussen,
  Mihai Calin, Ata Khavari, Maria Sosnina, J. Emilio Rodriguez, Graeme M. Burt","Validating Intelligent Power and Energy Systems - A Discussion of
  Educational Needs","8th International Conference on Industrial Applications of Holonic
  and Multi-Agent Systems (HoloMAS 2017)",,10.1007/978-3-319-64635-0_15,,cs.CY cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional power systems education and training is flanked by the demand for
coping with the rising complexity of energy systems, like the integration of
renewable and distributed generation, communication, control and information
technology. A broad understanding of these topics by the current/future
researchers and engineers is becoming more and more necessary. This paper
identifies educational and training needs addressing the higher complexity of
intelligent energy systems. Education needs and requirements are discussed,
such as the development of systems-oriented skills and cross-disciplinary
learning. Education and training possibilities and necessary tools are
described focusing on classroom but also on laboratory-based learning methods.
In this context, experiences of using notebooks, co-simulation approaches,
hardware-in-the-loop methods and remote labs experiments are discussed.
","[{'version': 'v1', 'created': 'Fri, 6 Oct 2017 09:09:42 GMT'}]",2017-10-12,"[['Kotsampopoulos', 'Panos', ''], ['Hatziargyriou', 'Nikos', ''], ['Strasser', 'Thomas I.', ''], ['Moyo', 'Cyndi', ''], ['Rohjans', 'Sebastian', ''], ['Steinbrink', 'Cornelius', ''], ['Lehnhoff', 'Sebastian', ''], ['Palensky', 'Peter', ''], ['van der Meer', 'Arjen A.', ''], ['Bondy', 'Daniel Esteban Morales', ''], ['Heussen', 'Kai', ''], ['Calin', 'Mihai', ''], ['Khavari', 'Ata', ''], ['Sosnina', 'Maria', ''], ['Rodriguez', 'J. Emilio', ''], ['Burt', 'Graeme M.', '']]","['Cyber-Physical Energy Systems', 'Education', 'Learning', 'Smartgrids', 'Training', 'Validation']"
6295,2212.00557,Miguel Rios,"Miguel Rios, Ameen Abu-Hanna","Deep Kernel Learning for Mortality Prediction in the Face of Temporal
  Shift","Rios, M., Abu-Hanna, A. (2021). Deep Kernel Learning for Mortality
  Prediction in the Face of Temporal Shift. In: Tucker, A., Henriques Abreu,
  P., Cardoso, J., Pereira Rodrigues, P., Ria\~no, D. (eds) Artificial
  Intelligence in Medicine. AIME 2021. Lecture Notes in Computer Science(), vol
  12721. Springer, Cham. https://doi.org/10.1007/978-3-030-77211-6_22",,10.1007/978-3-030-77211-6_22,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Neural models, with their ability to provide novel representations, have
shown promising results in prediction tasks in healthcare. However, patient
demographics, medical technology, and quality of care change over time. This
often leads to drop in the performance of neural models for prospective
patients, especially in terms of their calibration. The deep kernel learning
(DKL) framework may be robust to such changes as it combines neural models with
Gaussian processes, which are aware of prediction uncertainty. Our hypothesis
is that out-of-distribution test points will result in probabilities closer to
the global mean and hence prevent overconfident predictions. This in turn, we
hypothesise, will result in better calibration on prospective data.
  This paper investigates DKL's behaviour when facing a temporal shift, which
was naturally introduced when an information system that feeds a cohort
database was changed. We compare DKL's performance to that of a neural baseline
based on recurrent neural networks. We show that DKL indeed produced superior
calibrated predictions. We also confirm that the DKL's predictions were indeed
less sharp. In addition, DKL's discrimination ability was even improved: its
AUC was 0.746 (+- 0.014 std), compared to 0.739 (+- 0.028 std) for the
baseline. The paper demonstrated the importance of including uncertainty in
neural computing, especially for their prospective use.
","[{'version': 'v1', 'created': 'Thu, 1 Dec 2022 15:04:05 GMT'}]",2022-12-02,"[['Rios', 'Miguel', ''], ['Abu-Hanna', 'Ameen', '']]","['Deep Kernel Learning', 'temporal shift', 'time series', 'calibration', 'Gaussian process', 'mortality prediction']"
6296,1709.02101,EPTCS,"John C. McCabe-Dansted, Mark Reynolds (The University of Western
  Australia)",A Parallel Linear Temporal Logic Tableau,"In Proceedings GandALF 2017, arXiv:1709.01761","EPTCS 256, 2017, pp. 166-179",10.4204/EPTCS.256.12,,cs.LO cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For many applications, we are unable to take full advantage of the potential
massive parallelisation offered by supercomputers or cloud computing because it
is too hard to work out how to divide up the computation task between
processors in such a way to minimise the need for communication. However, a
recently developed branch-independent tableaux for the common LTL temporal
logic should intuitively be easy to parallelise as each branch can be developed
independently. Here we describe a simple technique for partitioning such a
tableau such that each partition can be processed independently without need
for interprocess communication. We investigate the extent to which this
technique improves the performance of the LTL tableau on standard benchmarks
and random formulas.
","[{'version': 'v1', 'created': 'Thu, 7 Sep 2017 06:57:51 GMT'}]",2017-09-08,"[['McCabe-Dansted', 'John C.', '', 'The University of Western\n  Australia'], ['Reynolds', 'Mark', '', 'The University of Western\n  Australia']]","['one-pass', 'tableaux', 'cloud', 'parallel', 'computation', 'LTL']"
6297,2208.04451,Matthew Brehmer,"Brian D. Hall, Lyn Bartram, Matthew Brehmer",Augmented Chironomia for Presenting Data to Remote Audiences,"To appear at the 2022 ACM Symposium on User Interface Software and
  Technology (UIST, Bend, OR, Oct 29 - Nov 2, 2022). Supplemental video
  available at https://vimeo.com/737703966",,10.1145/3526113.3545614,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  To facilitate engaging and nuanced conversations around data, we contribute a
touchless approach to interacting directly with visualization in remote
presentations. We combine dynamic charts overlaid on a presenter's webcam feed
with continuous bimanual hand tracking, demonstrating interactions that
highlight and manipulate chart elements appearing in the foreground. These
interactions are simultaneously functional and deictic, and some allow for the
addition of ""rhetorical flourish"", or expressive movement used when speaking
about quantities, categories, and time intervals. We evaluated our approach in
two studies with professionals who routinely deliver and attend presentations
about data. The first study considered the presenter perspective, where 12
participants delivered presentations to a remote audience using a presentation
environment incorporating our approach. The second study considered the
audience experience of 17 participants who attended presentations supported by
our environment. Finally, we reflect on observations from these studies and
discuss related implications for engaging remote audiences in conversations
about data.
","[{'version': 'v1', 'created': 'Mon, 8 Aug 2022 22:27:29 GMT'}]",2022-08-10,"[['Hall', 'Brian D.', ''], ['Bartram', 'Lyn', ''], ['Brehmer', 'Matthew', '']]","['Visualization', 'augmented reality', 'pointing', 'gesture', 'rhetoric', 'video']"
6298,2010.10007,Li Yuan,"Li Yuan, Shuning Chang, Ziyuan Huang, Yichen Zhou, Yunpeng Chen,
  Xuecheng Nie, Francis E.H. Tay, Jiashi Feng, Shuicheng Yan",A Simple Baseline for Pose Tracking in Videos of Crowded Scenes,"2nd Place in ACM Multimedia Grand Challenge: Human in Events, Track3:
  Crowd Pose Tracking in Complex Events. ACM Multimedia 2020. arXiv admin note:
  substantial text overlap with arXiv:2010.08365, arXiv:2010.10008",,10.1145/3394171.3416300,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents our solution to ACM MM challenge: Large-scale
Human-centric Video Analysis in Complex Events\cite{lin2020human};
specifically, here we focus on Track3: Crowd Pose Tracking in Complex Events.
Remarkable progress has been made in multi-pose training in recent years.
However, how to track the human pose in crowded and complex environments has
not been well addressed. We formulate the problem as several subproblems to be
solved. First, we use a multi-object tracking method to assign human ID to each
bounding box generated by the detection model. After that, a pose is generated
to each bounding box with ID. At last, optical flow is used to take advantage
of the temporal information in the videos and generate the final pose tracking
result.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2020 13:06:21 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Oct 2020 03:37:18 GMT'}]",2020-10-22,"[['Yuan', 'Li', ''], ['Chang', 'Shuning', ''], ['Huang', 'Ziyuan', ''], ['Zhou', 'Yichen', ''], ['Chen', 'Yunpeng', ''], ['Nie', 'Xuecheng', ''], ['Tay', 'Francis E. H.', ''], ['Feng', 'Jiashi', ''], ['Yan', 'Shuicheng', '']]","['pose tracking', 'human detection', 'human tracking', 'pose estimation', 'human in events']"
6299,2210.13625,Paul Mineiro,"Wangda Zhang, Matteo Interlandi, Paul Mineiro, Shi Qiao, Nasim
  Ghazanfari Karlen Lie, Marc Friedman, Rafah Hosn, Hiren Patel, Alekh Jindal",Deploying a Steered Query Optimizer in Production at Microsoft,,"Proceedings of the 2022 International Conference on Management of
  Data 2022 Jun 10 (pp. 2299-2311)",10.1145/3514221.3526052,,cs.DB cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern analytical workloads are highly heterogeneous and massively complex,
making generic query optimizers untenable for many customers and scenarios. As
a result, it is important to specialize these optimizers to instances of the
workloads. In this paper, we continue a recent line of work in steering a query
optimizer towards better plans for a given workload, and make major strides in
pushing previous research ideas to production deployment. Along the way we
solve several operational challenges including, making steering actions more
manageable, keeping the costs of steering within budget, and avoiding
unexpected performance regressions in production. Our resulting system,
QQ-advisor, essentially externalizes the query planner to a massive offline
pipeline for better exploration and specialization. We discuss various aspects
of our design and show detailed results over production SCOPE workloads at
Microsoft, where the system is currently enabled by default.
","[{'version': 'v1', 'created': 'Mon, 24 Oct 2022 21:57:57 GMT'}]",2022-10-26,"[['Zhang', 'Wangda', ''], ['Interlandi', 'Matteo', ''], ['Mineiro', 'Paul', ''], ['Qiao', 'Shi', ''], ['Lie', 'Nasim Ghazanfari Karlen', ''], ['Friedman', 'Marc', ''], ['Hosn', 'Rafah', ''], ['Patel', 'Hiren', ''], ['Jindal', 'Alekh', '']]","['query optimization', 'SCOPE', 'machine learning', 'contextual bandit']"
6300,2204.06843,Mathies Wedler M.Sc.,"Mathies Wedler (1), Merten Stender (1), Marco Klein (1), Svenja Ehlers
  (1), Norbert Hoffmann (1 and 2) ((1) Hamburg University of Technology, (2)
  Imperial College London)","Surface Similarity Parameter: A New Machine Learning Loss Metric for
  Oscillatory Spatio-Temporal Data","19 pages, 7 figures, submitted to Elsevier Neural Networks",,10.1016/j.neunet.2022.09.023,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Supervised machine learning approaches require the formulation of a loss
functional to be minimized in the training phase. Sequential data are
ubiquitous across many fields of research, and are often treated with Euclidean
distance-based loss functions that were designed for tabular data. For smooth
oscillatory data, those conventional approaches lack the ability to penalize
amplitude, frequency and phase prediction errors at the same time, and tend to
be biased towards amplitude errors. We introduce the surface similarity
parameter (SSP) as a novel loss function that is especially useful for training
machine learning models on smooth oscillatory sequences. Our extensive
experiments on chaotic spatio-temporal dynamics systems indicate that the SSP
is beneficial for shaping gradients, thereby accelerating the training process,
reducing the final prediction error, increasing weight initialization
robustness, and implementing a stronger regularization effect compared to using
classical loss functions. The results indicate the potential of the novel loss
metric particularly for highly complex and chaotic data, such as data stemming
from the nonlinear two-dimensional Kuramoto-Sivashinsky equation and the linear
propagation of dispersive surface gravity waves in fluids.
","[{'version': 'v1', 'created': 'Thu, 14 Apr 2022 09:27:33 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Sep 2022 09:43:59 GMT'}]",2022-09-30,"[['Wedler', 'Mathies', '', '1 and 2'], ['Stender', 'Merten', '', '1 and 2'], ['Klein', 'Marco', '', '1 and 2'], ['Ehlers', 'Svenja', '', '1 and 2'], ['Hoffmann', 'Norbert', '', '1 and 2']]","['deep learning', 'loss function', 'error metric', 'similarity', 'nonlinear dynamics', 'spatio-temporaldynamics']"
6301,2110.08517,Sojhal Ismail Khan,"Sojhal Ismail Khan, Dominika Woszczyk, Chengzeng You, Soteris
  Demetriou, Muhammad Naveed","Characterizing Improper Input Validation Vulnerabilities of Mobile
  Crowdsourcing Services",,"Annual Computer Security Applications Conference (ACSAC '21),
  December 6--10, 2021, USA",10.1145/3485832.3485888,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Mobile crowdsourcing services (MCS), enable fast and economical data
acquisition at scale and find applications in a variety of domains. Prior work
has shown that Foursquare and Waze (a location-based and a navigation MCS) are
vulnerable to different kinds of data poisoning attacks. Such attacks can be
upsetting and even dangerous especially when they are used to inject improper
inputs to mislead users. However, to date, there is no comprehensive study on
the extent of improper input validation (IIV) vulnerabilities and the
feasibility of their exploits in MCSs across domains. In this work, we leverage
the fact that MCS interface with their participants through mobile apps to
design tools and new methodologies embodied in an end-to-end feedback-driven
analysis framework which we use to study 10 popular and previously unexplored
services in five different domains. Using our framework we send tens of
thousands of API requests with automatically generated input values to
characterize their IIV attack surface. Alarmingly, we found that most of them
(8/10) suffer from grave IIV vulnerabilities which allow an adversary to launch
data poisoning attacks at scale: 7400 spoofed API requests were successful in
faking online posts for robberies, gunshots, and other dangerous incidents,
faking fitness activities with supernatural speeds and distances among many
others. Lastly, we discuss easy to implement and deploy mitigation strategies
which can greatly reduce the IIV attack surface and argue for their use as a
necessary complementary measure working toward trustworthy mobile crowdsourcing
services.
","[{'version': 'v1', 'created': 'Sat, 16 Oct 2021 09:02:39 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Oct 2021 02:40:34 GMT'}]",2021-10-20,"[['Khan', 'Sojhal Ismail', ''], ['Woszczyk', 'Dominika', ''], ['You', 'Chengzeng', ''], ['Demetriou', 'Soteris', ''], ['Naveed', 'Muhammad', '']]","['crowdsourcing', 'real-time', 'data-poisoning', 'api fuzzing']"
6302,1905.09181,Robin Kaarsgaard,Robin Kaarsgaard,"Condition/Decision Duality and the Internal Logic of Extensive
  Restriction Categories","19 pages, including 6 page appendix of proofs. Accepted for MFPS XXXV",,10.1016/j.entcs.2019.09.010,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In flowchart languages, predicates play an interesting double role. In the
textual representation, they are often presented as conditions, i.e.,
expressions which are easily combined with other conditions (often via Boolean
combinators) to form new conditions, though they only play a supporting role in
aiding branching statements choose a branch to follow. On the other hand, in
the graphical representation they are typically presented as decisions,
intrinsically capable of directing control flow yet mostly oblivious to Boolean
combination. While categorical treatments of flowchart languages are abundant,
none of them provide a treatment of this dual nature of predicates. In the
present paper, we argue that extensive restriction categories are precisely
categories that capture such a condition/decision duality, by means of
morphisms which, coincidentally, are also called decisions. Further, we show
that having these categorical decisions amounts to having an internal logic:
Analogous to how subobjects of an object in a topos form a Heyting algebra, we
show that decisions on an object in an extensive restriction category form a De
Morgan quasilattice, the algebraic structure associated with the (three-valued)
weak Kleene logic $\mathbf{K}^w_3$. Full classical propositional logic can be
recovered by restricting to total decisions, yielding extensive categories in
the usual sense, and confirming (from a different direction) a result from
effectus theory that predicates on objects in extensive categories form Boolean
algebras. As an application, since (categorical) decisions are partial
isomorphisms, this approach provides naturally reversible models of classical
propositional logic and weak Kleene logic.
","[{'version': 'v1', 'created': 'Wed, 22 May 2019 15:02:10 GMT'}]",2020-09-25,"[['Kaarsgaard', 'Robin', '']]","['categorical logic', 'flowchart languages', 'restriction categories', 'extensivity', 'weak Kleene logic']"
6303,1904.07698,Fahad Sohrab,"Fahad Sohrab, Jenni Raitoharju, Alexandros Iosifidis, Moncef Gabbouj",Multimodal Subspace Support Vector Data Description,"26 pages manuscript (6 tables, 2 figures), 24 pages supplementary
  material (27 tables, 10 figures). The manuscript and supplementary material
  are combined as a single .pdf (50 pages) file","Pattern Recognition, 2020",10.1016/j.patcog.2020.107648,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel method for projecting data from multiple
modalities to a new subspace optimized for one-class classification. The
proposed method iteratively transforms the data from the original feature space
of each modality to a new common feature space along with finding a joint
compact description of data coming from all the modalities. For data in each
modality, we define a separate transformation to map the data from the
corresponding feature space to the new optimized subspace by exploiting the
available information from the class of interest only. We also propose
different regularization strategies for the proposed method and provide both
linear and non-linear formulations. The proposed Multimodal Subspace Support
Vector Data Description outperforms all the competing methods using data from a
single modality or fusing data from all modalities in four out of five
datasets.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2019 14:16:09 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Sep 2020 13:31:50 GMT'}]",2020-09-15,"[['Sohrab', 'Fahad', ''], ['Raitoharju', 'Jenni', ''], ['Iosifidis', 'Alexandros', ''], ['Gabbouj', 'Moncef', '']]","['Feature Transformation', 'Multimodal Data', 'One-class Classification', 'Support VectorData Description', 'Subspace Learning']"
6304,2008.05132,Jieshan Chen,"Jieshan Chen, Mulong Xie, Zhenchang Xing, Chunyang Chen, Xiwei Xu,
  Liming Zhu and Guoqiang Li","Object Detection for Graphical User Interface: Old Fashioned or Deep
  Learning or a Combination?","13 pages, accepted to ESEC/FSE '20",,10.1145/3368089.3409691,,cs.CV cs.HC cs.LG cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detecting Graphical User Interface (GUI) elements in GUI images is a
domain-specific object detection task. It supports many software engineering
tasks, such as GUI animation and testing, GUI search and code generation.
Existing studies for GUI element detection directly borrow the mature methods
from computer vision (CV) domain, including old fashioned ones that rely on
traditional image processing features (e.g., canny edge, contours), and deep
learning models that learn to detect from large-scale GUI data. Unfortunately,
these CV methods are not originally designed with the awareness of the unique
characteristics of GUIs and GUI elements and the high localization accuracy of
the GUI element detection task. We conduct the first large-scale empirical
study of seven representative GUI element detection methods on over 50k GUI
images to understand the capabilities, limitations and effective designs of
these methods. This study not only sheds the light on the technical challenges
to be addressed but also informs the design of new GUI element detection
methods. We accordingly design a new GUI-specific old-fashioned method for
non-text GUI element detection which adopts a novel top-down coarse-to-fine
strategy, and incorporate it with the mature deep learning model for GUI text
detection.Our evaluation on 25,000 GUI images shows that our method
significantly advances the start-of-the-art performance in GUI element
detection.
","[{'version': 'v1', 'created': 'Wed, 12 Aug 2020 06:36:33 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Sep 2020 12:57:33 GMT'}]",2020-09-08,"[['Chen', 'Jieshan', ''], ['Xie', 'Mulong', ''], ['Xing', 'Zhenchang', ''], ['Chen', 'Chunyang', ''], ['Xu', 'Xiwei', ''], ['Zhu', 'Liming', ''], ['Li', 'Guoqiang', '']]","['Android', 'Object Detection', 'User Interface', 'Deep Learning', 'Computer Vision']"
6305,2201.08058,Lucas Gren,Lucas Gren and Paul Ralph,What Makes Effective Leadership in Agile Software Development Teams?,,"44th International Conference on Software Engineering (Technical
  Track ICSE2022), May 21-29, 2022 Pittsburgh, PA, USA",10.1145/3510003.3510100,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Effective leadership is one of the key drivers of business and project
success, and one of the most active areas of management research. But how does
leadership work in agile software development, which emphasizes self-management
and self-organization and marginalizes traditional leadership roles? To find
out, this study examines agile leadership from the perspective of thirteen
professionals who identify as agile leaders, in different roles, at ten
different software development companies of varying sizes. Data from
semi-structured interviews reveals that leadership: (1) is dynamically shared
among team members; (2) engenders a sense of belonging to the team; and (3)
involves balancing competing organizational cultures (e.g. balancing the new
agile culture with the old milestone-driven culture). In other words, agile
leadership is a property of a team, not a role, and effectiveness depends on
agile team members' identifying with the team, accepting responsibility, and
being sensitive to cultural conflict.
","[{'version': 'v1', 'created': 'Thu, 20 Jan 2022 08:47:57 GMT'}]",2022-01-21,"[['Gren', 'Lucas', ''], ['Ralph', 'Paul', '']]","['agile methods', 'leadership', 'management', 'culture']"
6306,2003.03207,William Seymour,William Seymour and Max Van Kleek,"Does Siri Have a Soul? Exploring Voice Assistants Through Shinto Design
  Fictions","11 pages, 2 images. To appear in the Extended Abstracts of the 2020
  CHI Conference on Human Factors in Computing Systems (CHI '20)",,10.1145/3334480.3381809,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It can be difficult to critically reflect on technology that has become part
of everyday rituals and routines. To combat this, speculative and fictional
approaches have previously been used by HCI to decontextualise the familiar and
imagine alternatives. In this work we turn to Japanese Shinto narratives as a
way to defamiliarise voice assistants, inspired by the similarities between how
assistants appear to 'inhabit' objects similarly to kami. Describing an
alternate future where assistant presences live inside objects, this approach
foregrounds some of the phenomenological quirks that can otherwise easily
become lost. Divorced from the reality of daily life, this approach allows us
to reevaluate some of the common interactions and design patterns that are
common in the virtual assistants of the present.
","[{'version': 'v1', 'created': 'Fri, 6 Mar 2020 13:54:08 GMT'}]",2020-03-09,"[['Seymour', 'William', ''], ['Van Kleek', 'Max', '']]","['Voice Assistants', 'Design Fiction', 'Critical Design', 'Shinto']"
6307,2006.13140,Zohreh Kaheh,"Zohreh Kaheh, Reza Baradaran Kazemzadeh, Ellips Masehian, Ali
  Husseinzadeh Kashan","A Mathematical Negotiation Mechanism for Distributed Procurement
  Problems and a Hybrid Algorithm for its Solution","26 pages, 6 figures",,10.24200/J65.2018.20035,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a mathematical negotiation mechanism is designed to minimize
the negotiators' costs in a distributed procurement problem at two echelons of
an automotive supply chain. The buyer's costs are procurement cost and shortage
penalty in a one-period contract. On the other hand, the suppliers intend to
solve a multi-period, multi-product production planning to minimize their
costs. Such a mechanism provides an alignment among suppliers' production
planning and order allocation, also supports the partnership with the valued
suppliers by taking suppliers' capacities into account. Such a circumstance has
been modeled via bi-level programming, in which the buyer acts as a leader, and
the suppliers individually appear as followers in the lower level. To solve
this nonlinear bi-level programming model, a hybrid algorithm by combining the
particle swarm optimization (PSO) algorithm with a heuristic algorithm based on
A search is proposed. The heuristic A algorithm is embedded to solve the
mixed-integer nonlinear programming (MINLP) sub-problems for each supplier
according to the received variable values determined by PSO system particles
(buyer's request for quotations (RFQs)). The computational analyses have shown
that the proposed hybrid algorithm called PSO-A outperforms PSO-SA and
PSO-Greedy algorithms.
","[{'version': 'v1', 'created': 'Fri, 12 Jun 2020 21:05:16 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Sep 2020 16:01:37 GMT'}, {'version': 'v3', 'created': 'Sat, 18 Dec 2021 00:27:35 GMT'}]",2021-12-21,"[['Kaheh', 'Zohreh', ''], ['Kazemzadeh', 'Reza Baradaran', ''], ['Masehian', 'Ellips', ''], ['Kashan', 'Ali Husseinzadeh', '']]","['Decentralized decision making', 'Procurement problem', 'Bargaining power', 'Bi-level programming', 'PSOA* algorithm']"
6308,2103.01489,Kartik Hegde,"Kartik Hegde, Po-An Tsai, Sitao Huang, Vikas Chandra, Angshuman
  Parashar, and Christopher W. Fletcher","Mind Mappings: Enabling Efficient Algorithm-Accelerator Mapping Space
  Search","Appears in the proceedings of the 26th ACM International Conference
  on Architectural Support for Programming Languages and Operating Systems
  (ASPLOS '21), April 19-23, 2021, Virtual, USA",,10.1145/3445814.3446762,,cs.LG cs.AR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Modern day computing increasingly relies on specialization to satiate growing
performance and efficiency requirements. A core challenge in designing such
specialized hardware architectures is how to perform mapping space search,
i.e., search for an optimal mapping from algorithm to hardware. Prior work
shows that choosing an inefficient mapping can lead to multiplicative-factor
efficiency overheads. Additionally, the search space is not only large but also
non-convex and non-smooth, precluding advanced search techniques. As a result,
previous works are forced to implement mapping space search using expert
choices or sub-optimal search heuristics.
  This work proposes Mind Mappings, a novel gradient-based search method for
algorithm-accelerator mapping space search. The key idea is to derive a smooth,
differentiable approximation to the otherwise non-smooth, non-convex search
space. With a smooth, differentiable approximation, we can leverage efficient
gradient-based search algorithms to find high-quality mappings. We extensively
compare Mind Mappings to black-box optimization schemes used in prior work.
When tasked to find mappings for two important workloads (CNN and MTTKRP), the
proposed search finds mappings that achieve an average $1.40\times$,
$1.76\times$, and $1.29\times$ (when run for a fixed number of steps) and
$3.16\times$, $4.19\times$, and $2.90\times$ (when run for a fixed amount of
time) better energy-delay product (EDP) relative to Simulated Annealing,
Genetic Algorithms and Reinforcement Learning, respectively. Meanwhile, Mind
Mappings returns mappings with only $5.32\times$ higher EDP than a possibly
unachievable theoretical lower-bound, indicating proximity to the global
optima.
","[{'version': 'v1', 'created': 'Tue, 2 Mar 2021 06:11:58 GMT'}]",2021-03-03,"[['Hegde', 'Kartik', ''], ['Tsai', 'Po-An', ''], ['Huang', 'Sitao', ''], ['Chandra', 'Vikas', ''], ['Parashar', 'Angshuman', ''], ['Fletcher', 'Christopher W.', '']]","['programmable domain-specific accelerators', 'mapping space search', 'gradient-based search']"
6309,2207.09525,Julia Barnett,Julia Barnett and Nicholas Diakopoulos,"Crowdsourcing Impacts: Exploring the Utility of Crowds for Anticipating
  Societal Impacts of Algorithmic Decision Making","10 pages, 2 figures. Proceedings of the 2022 AAAI/ACM Conference on
  AI, Ethics, and Society (August 2022)",,10.1145/3514094.3534145,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the increasing pervasiveness of algorithms across industry and
government, a growing body of work has grappled with how to understand their
societal impact and ethical implications. Various methods have been used at
different stages of algorithm development to encourage researchers and
designers to consider the potential societal impact of their research. An
understudied yet promising area in this realm is using participatory foresight
to anticipate these different societal impacts. We employ crowdsourcing as a
means of participatory foresight to uncover four different types of impact
areas based on a set of governmental algorithmic decision making tools: (1)
perceived valence, (2) societal domains, (3) specific abstract impact types,
and (4) ethical algorithm concerns. Our findings suggest that this method is
effective at leveraging the cognitive diversity of the crowd to uncover a range
of issues. We further analyze the complexities within the interaction of the
impact areas identified to demonstrate how crowdsourcing can illuminate
patterns around the connections between impacts. Ultimately this work
establishes crowdsourcing as an effective means of anticipating algorithmic
impact which complements other approaches towards assessing algorithms in
society by leveraging participatory foresight and cognitive diversity.
","[{'version': 'v1', 'created': 'Tue, 19 Jul 2022 19:46:53 GMT'}]",2022-07-21,"[['Barnett', 'Julia', ''], ['Diakopoulos', 'Nicholas', '']]","['algorithmic impact', 'anticipatory ethics', 'natural language processing', 'cognitive diversity', 'participatory foresight']"
6310,1907.01536,Taha Yasseri,Bertie Vidgen and Taha Yasseri,"What, When and Where of petitions submitted to the UK Government during
  a time of chaos",Preprint; under review,"Policy Sci 53, 535-557 (2020)",10.1007/s11077-020-09395-y,,cs.CY cs.SI physics.data-an physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In times marked by political turbulence and uncertainty, as well as
increasing divisiveness and hyperpartisanship, Governments need to use every
tool at their disposal to understand and respond to the concerns of their
citizens. We study issues raised by the UK public to the Government during
2015-2017 (surrounding the UK EU-membership referendum), mining public opinion
from a dataset of 10,950 petitions (representing 30.5 million signatures). We
extract the main issues with a ground-up natural language processing (NLP)
method, latent Dirichlet allocation (LDA). We then investigate their temporal
dynamics and geographic features. We show that whilst the popularity of some
issues is stable across the two years, others are highly influenced by external
events, such as the referendum in June 2016. We also study the relationship
between petitions' issues and where their signatories are geographically
located. We show that some issues receive support from across the whole country
but others are far more local. We then identify six distinct clusters of
constituencies based on the issues which constituents sign. Finally, we
validate our approach by comparing the petitions' issues with the top issues
reported in Ipsos MORI survey data. These results show the huge power of
computationally analyzing petitions to understand not only what issues citizens
are concerned about but also when and from where.
","[{'version': 'v1', 'created': 'Tue, 2 Jul 2019 17:40:40 GMT'}]",2023-01-05,"[['Vidgen', 'Bertie', ''], ['Yasseri', 'Taha', '']]","['petition', 'political participation', 'Brexit', 'opinion mining', 'government']"
6311,1904.05419,Will Epperson,"\'Angel Alexander Cabrera, Will Epperson, Fred Hohman, Minsuk Kahng,
  Jamie Morgenstern, Duen Horng Chau","FairVis: Visual Analytics for Discovering Intersectional Bias in Machine
  Learning",Accepted as a VAST conference paper to IEEE VIS'19,,10.1109/VAST47406.2019.8986948,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The growing capability and accessibility of machine learning has led to its
application to many real-world domains and data about people. Despite the
benefits algorithmic systems may bring, models can reflect, inject, or
exacerbate implicit and explicit societal biases into their outputs,
disadvantaging certain demographic subgroups. Discovering which biases a
machine learning model has introduced is a great challenge, due to the numerous
definitions of fairness and the large number of potentially impacted subgroups.
We present FairVis, a mixed-initiative visual analytics system that integrates
a novel subgroup discovery technique for users to audit the fairness of machine
learning models. Through FairVis, users can apply domain knowledge to generate
and investigate known subgroups, and explore suggested and similar subgroups.
FairVis' coordinated views enable users to explore a high-level overview of
subgroup performance and subsequently drill down into detailed investigation of
specific subgroups. We show how FairVis helps to discover biases in two real
datasets used in predicting income and recidivism. As a visual analytics system
devoted to discovering bias in machine learning, FairVis demonstrates how
interactive visualization may help data scientists and the general public
understand and create more equitable algorithmic systems.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2019 20:07:35 GMT'}, {'version': 'v2', 'created': 'Wed, 31 Jul 2019 01:34:48 GMT'}, {'version': 'v3', 'created': 'Thu, 1 Aug 2019 20:30:36 GMT'}, {'version': 'v4', 'created': 'Sun, 1 Sep 2019 19:54:28 GMT'}]",2021-10-28,"[['Cabrera', 'Ángel Alexander', ''], ['Epperson', 'Will', ''], ['Hohman', 'Fred', ''], ['Kahng', 'Minsuk', ''], ['Morgenstern', 'Jamie', ''], ['Chau', 'Duen Horng', '']]","['Machine learning fairness', 'visual analytics', 'intersectional bias', 'subgroup discovery']"
6312,2208.05220,Lechao Cheng,"Yingzi Fan, Longfei Han, Yue Zhang, Lechao Cheng, Chen Xia, Di Hu",Dual Domain-Adversarial Learning for Audio-Visual Saliency Prediction,Accepted by ACM MM workshop 2022(HCMA2022),,10.1145/3552458.3556447,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Both visual and auditory information are valuable to determine the salient
regions in videos. Deep convolution neural networks (CNN) showcase strong
capacity in coping with the audio-visual saliency prediction task. Due to
various factors such as shooting scenes and weather, there often exists
moderate distribution discrepancy between source training data and target
testing data. The domain discrepancy induces to performance degradation on
target testing data for CNN models. This paper makes an early attempt to tackle
the unsupervised domain adaptation problem for audio-visual saliency
prediction. We propose a dual domain-adversarial learning algorithm to mitigate
the domain discrepancy between source and target data. First, a specific domain
discrimination branch is built up for aligning the auditory feature
distributions. Then, those auditory features are fused into the visual features
through a cross-modal self-attention module. The other domain discrimination
branch is devised to reduce the domain discrepancy of visual features and
audio-visual correlations implied by the fused audio-visual features.
Experiments on public benchmarks demonstrate that our method can relieve the
performance degradation caused by domain discrepancy.
","[{'version': 'v1', 'created': 'Wed, 10 Aug 2022 08:50:32 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Aug 2022 07:10:40 GMT'}]",2022-08-17,"[['Fan', 'Yingzi', ''], ['Han', 'Longfei', ''], ['Zhang', 'Yue', ''], ['Cheng', 'Lechao', ''], ['Xia', 'Chen', ''], ['Hu', 'Di', '']]","['Audio-visual saliency prediction', 'Cross-modal self-attention', 'Unsupervised domain adaptation']"
6313,1911.07253,Suping Zhou,"Suping Zhou, Jia Jia, Yufeng Yin, Xiang Li, Yang Yao, Ying Zhang,
  Zeyang Ye, Kehua Lei, Yan Huang, Jialie Shen","Understanding the Teaching Styles by an Attention based Multi-task
  Cross-media Dimensional modelling",ACM Muitimedia 2019,,10.1145/3343031.3351059,,cs.MM cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Teaching style plays an influential role in helping students to achieve
academic success. In this paper, we explore a new problem of effectively
understanding teachers' teaching styles. Specifically, we study 1) how to
quantitatively characterize various teachers' teaching styles for various
teachers and 2) how to model the subtle relationship between cross-media
teaching related data (speech, facial expressions and body motions, content et
al.) and teaching styles. Using the adjectives selected from more than 10,000
feedback questionnaires provided by an educational enterprise, a novel concept
called Teaching Style Semantic Space (TSSS) is developed based on the
pleasure-arousal dimensional theory to describe teaching styles quantitatively
and comprehensively. Then a multi-task deep learning based model,
Attention-based Multi-path Multi-task Deep Neural Network (AMMDNN), is proposed
to accurately and robustly capture the internal correlations between
cross-media features and TSSS. Based on the benchmark dataset, we further
develop a comprehensive data set including 4,541 full-annotated cross-modality
teaching classes. Our experimental results demonstrate that the proposed AMMDNN
outperforms (+0.0842 in terms of the concordance correlation coefficient (CCC)
on average) baseline methods. To further demonstrate the advantages of the
proposed TSSS and our model, several interesting case studies are carried out,
such as teaching styles comparison among different teachers and courses, and
leveraging the proposed method for teaching quality analysis.
","[{'version': 'v1', 'created': 'Sun, 17 Nov 2019 15:05:39 GMT'}]",2019-11-19,"[['Zhou', 'Suping', ''], ['Jia', 'Jia', ''], ['Yin', 'Yufeng', ''], ['Li', 'Xiang', ''], ['Yao', 'Yang', ''], ['Zhang', 'Ying', ''], ['Ye', 'Zeyang', ''], ['Lei', 'Kehua', ''], ['Huang', 'Yan', ''], ['Shen', 'Jialie', '']]","['Teaching styles', 'Multi-task', 'Attention']"
6314,2205.14925,Roberto Dillon,Roberto Dillon,"The u-index: a simple metric to objectively measure academic impact of
  individual researchers","3 pages, 1 table, no figures",,10.48550/arXiv.2205.14925,,cs.DL stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This short paper introduces the u-index, a simple and objective metric to
evaluate the impact and relevance of academic research output, as a possible
alternative to widespread metrics such as the h-index or the i10-index. The
proposed index is designed to address possible issues with standard metrics
such as inflated ratings resulting from self-citations or by means of extended
co-authorship numbers where every citation has the same impact as for works
written by smaller groups, despite limited individual contributions. The new
index makes also possible to differentiate scholars who would otherwise fall
into the same h-index group, hence providing further insights into the actual
impact of a specific individual researcher.
","[{'version': 'v1', 'created': 'Mon, 30 May 2022 08:48:15 GMT'}, {'version': 'v2', 'created': 'Tue, 31 May 2022 05:34:01 GMT'}, {'version': 'v3', 'created': 'Fri, 3 Jun 2022 00:55:53 GMT'}]",2022-06-06,"[['Dillon', 'Roberto', '']]","['citation data', 'Hirsch index', 'metric', 'academic impact']"
6315,1806.04385,Thomas Kohler,"Thomas Kohler, Ruben Mayer, Frank D\""urr, Marius Maa{\ss}, Sukanya
  Bhowmik, Kurt Rothermel",P4CEP: Towards In-Network Complex Event Processing,6 pages. Author's version,,10.1145/3229591.3229593,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In-network computing using programmable networking hardware is a strong trend
in networking that promises to reduce latency and consumption of server
resources through offloading to network elements (programmable switches and
smart NICs). In particular, the data plane programming language P4 together
with powerful P4 networking hardware has spawned projects offloading services
into the network, e.g., consensus services or caching services. In this paper,
we present a novel case for in-network computing, namely, Complex Event
Processing (CEP). CEP processes streams of basic events, e.g., stemming from
networked sensors, into meaningful complex events. Traditionally, CEP
processing has been performed on servers or overlay networks. However, we argue
in this paper that CEP is a good candidate for in-network computing along the
communication path avoiding detouring streams to distant servers to minimize
communication latency while also exploiting processing capabilities of novel
networking hardware. We show that it is feasible to express CEP operations in
P4 and also present a tool to compile CEP operations, formulated in our P4CEP
rule specification language, to P4 code. Moreover, we identify challenges and
problems that we have encountered to show future research directions for
implementing full-fledged in-network CEP systems.
","[{'version': 'v1', 'created': 'Tue, 12 Jun 2018 08:20:20 GMT'}]",2018-06-13,"[['Kohler', 'Thomas', ''], ['Mayer', 'Ruben', ''], ['Dürr', 'Frank', ''], ['Maaß', 'Marius', ''], ['Bhowmik', 'Sukanya', ''], ['Rothermel', 'Kurt', '']]","['In-network Computing', 'Data Plane Programming', 'P4', 'ComplexEvent Processing (CEP)']"
6316,2104.08774,Antonios Liapis,"Theodoros Galanos and Antonios Liapis and Georgios N. Yannakakis and
  Reinhard Koenig",ARCH-Elites: Quality-Diversity for Urban Design,"Published at Genetic and Evolutionary Computation Conference
  Companion, 2021, 2 pages, 1 figure",,10.1145/3449726.3459490,,cs.NE cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces ARCH-Elites, a MAP-Elites implementation that can
reconfigure large-scale urban layouts at real-world locations via a pre-trained
surrogate model instead of costly simulations. In a series of experiments, we
generate novel urban designs for two real-world locations in Boston,
Massachusetts. Combining the exploration of a possibility space with real-time
performance evaluation creates a powerful new paradigm for architectural
generative design that can extract and articulate design intelligence.
","[{'version': 'v1', 'created': 'Sun, 18 Apr 2021 08:46:38 GMT'}]",2021-04-20,"[['Galanos', 'Theodoros', ''], ['Liapis', 'Antonios', ''], ['Yannakakis', 'Georgios N.', ''], ['Koenig', 'Reinhard', '']]","['evolutionary algorithms', 'quality diversity', 'MAP-Elites', 'urban design', 'architecture']"
6317,2301.07465,Nico Ebert,"Nico Ebert, Bj\""orn Scheppler, Kurt Ackermann, Tim Geppert","QButterfly: Lightweight Survey Extension for Online User Interaction
  Studies for Non-Tech-Savvy Researchers",,,10.1145/3544548.3580780,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  We provide a user-friendly, flexible, and lightweight open-source HCI toolkit
(github.com/QButterfly) that allows non-tech-savvy researchers to conduct
online user interaction studies using the widespread Qualtrics and LimeSurvey
platforms. These platforms already provide rich functionality (e.g., for
experiments or usability tests) and therefore lend themselves to an extension
to display stimulus web pages and record clickstreams. The toolkit consists of
a survey template with embedded JavaScript, a JavaScript library embedded in
the HTML web pages, and scripts to analyze the collected data. No special
programming skills are required to set up a study or match survey data and user
interaction data after data collection. We empirically validated the software
in a laboratory and a field study. We conclude that this extension, even in its
preliminary version, has the potential to make online user interaction studies
(e.g., with crowdsourced participants) accessible to a broader range of
researchers.
","[{'version': 'v1', 'created': 'Wed, 18 Jan 2023 12:20:27 GMT'}]",2023-01-19,"[['Ebert', 'Nico', ''], ['Scheppler', 'Björn', ''], ['Ackermann', 'Kurt', ''], ['Geppert', 'Tim', '']]","['online user interaction studies', 'online experiments', 'Qualtrics', 'LimeSurvey', 'open source', 'HCI toolkit']"
6318,2210.05280,Yuqian Fu,"Yuqian Fu, Yu Xie, Yanwei Fu, Jingjing Chen, Yu-Gang Jiang","ME-D2N: Multi-Expert Domain Decompositional Network for Cross-Domain
  Few-Shot Learning",Accepted by ACM Multimedia 2022,,10.1145/3503161.3547995,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, Cross-Domain Few-Shot Learning (CD-FSL) which aims at addressing
the Few-Shot Learning (FSL) problem across different domains has attracted
rising attention. The core challenge of CD-FSL lies in the domain gap between
the source and novel target datasets. Though many attempts have been made for
CD-FSL without any target data during model training, the huge domain gap makes
it still hard for existing CD-FSL methods to achieve very satisfactory results.
Alternatively, learning CD-FSL models with few labeled target domain data which
is more realistic and promising is advocated in previous
work~\cite{fu2021meta}. Thus, in this paper, we stick to this setting and
technically contribute a novel Multi-Expert Domain Decompositional Network
(ME-D2N). Concretely, to solve the data imbalance problem between the source
data with sufficient examples and the auxiliary target data with limited
examples, we build our model under the umbrella of multi-expert learning. Two
teacher models which can be considered to be experts in their corresponding
domain are first trained on the source and the auxiliary target sets,
respectively. Then, the knowledge distillation technique is introduced to
transfer the knowledge from two teachers to a unified student model. Taking a
step further, to help our student model learn knowledge from different domain
teachers simultaneously, we further present a novel domain decomposition module
that learns to decompose the student model into two domain-related sub parts.
This is achieved by a novel domain-specific gate that learns to assign each
filter to only one specific domain in a learnable way. Extensive experiments
demonstrate the effectiveness of our method. Codes and models are available at
https://github.com/lovelyqian/ME-D2N_for_CDFSL.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2022 09:24:47 GMT'}]",2022-10-12,"[['Fu', 'Yuqian', ''], ['Xie', 'Yu', ''], ['Fu', 'Yanwei', ''], ['Chen', 'Jingjing', ''], ['Jiang', 'Yu-Gang', '']]","['cross-domain few-shot learning', 'classification for unbalanced data', 'multi-expert learning', 'network decomposition']"
6319,2012.07654,Nishant Yadav,"Nishant Yadav, Rajat Sen, Daniel N. Hill, Arya Mazumdar, Inderjit S.
  Dhillon",Session-Aware Query Auto-completion using Extreme Multi-label Ranking,Accepted in KDD 2021. Updated results for baseline XMR,,10.1145/3447548.3467087,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Query auto-completion (QAC) is a fundamental feature in search engines where
the task is to suggest plausible completions of a prefix typed in the search
bar. Previous queries in the user session can provide useful context for the
user's intent and can be leveraged to suggest auto-completions that are more
relevant while adhering to the user's prefix. Such session-aware QACs can be
generated by recent sequence-to-sequence deep learning models; however, these
generative approaches often do not meet the stringent latency requirements of
responding to each user keystroke. Moreover, these generative approaches pose
the risk of showing nonsensical queries.
  In this paper, we provide a solution to this problem: we take the novel
approach of modeling session-aware QAC as an eXtreme Multi-Label Ranking (XMR)
problem where the input is the previous query in the session and the user's
current prefix, while the output space is the set of tens of millions of
queries entered by users in the recent past. We adapt a popular XMR algorithm
for this purpose by proposing several modifications to the key steps in the
algorithm. The proposed modifications yield a 3.9x improvement in terms of Mean
Reciprocal Rank (MRR) over the baseline XMR approach on a public search logs
dataset. We are able to maintain an inference latency of less than 10 ms while
still using session context. When compared against baseline models of
acceptable latency, we observed a 33% improvement in MRR for short prefixes of
up to 3 characters. Moreover, our model yielded a statistically significant
improvement of 2.81% over a production QAC system in terms of suggestion
acceptance rate, when deployed on the search bar of an online shopping store as
part of an A/B test.
","[{'version': 'v1', 'created': 'Wed, 9 Dec 2020 17:56:22 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Jun 2021 19:05:55 GMT'}, {'version': 'v3', 'created': 'Sat, 21 Aug 2021 22:48:35 GMT'}]",2021-08-24,"[['Yadav', 'Nishant', ''], ['Sen', 'Rajat', ''], ['Hill', 'Daniel N.', ''], ['Mazumdar', 'Arya', ''], ['Dhillon', 'Inderjit S.', '']]","['eXtreme multi-label ranking', 'auto-complete', 'session-aware']"
6320,2106.08704,Md Rafiqul Islam Rabin,"Md Rafiqul Islam Rabin, Aftab Hussain, Mohammad Amin Alipour and
  Vincent J. Hellendoorn",Memorization and Generalization in Neural Code Intelligence Models,"Information and Software Technology, IST Journal 2022, Elsevier",,10.1016/j.infsof.2022.107066,,cs.LG cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep Neural Networks (DNNs) are increasingly being used in software
engineering and code intelligence tasks. These are powerful tools that are
capable of learning highly generalizable patterns from large datasets through
millions of parameters. At the same time, their large capacity can render them
prone to memorizing data points. Recent work suggests that the memorization
risk manifests especially strongly when the training dataset is noisy,
involving many ambiguous or questionable samples, and memorization is the only
recourse. The goal of this paper is to evaluate and compare the extent of
memorization and generalization in neural code intelligence models. It aims to
provide insights on how memorization may impact the learning behavior of neural
models in code intelligence systems. To observe the extent of memorization in
models, we add random noise to the original training dataset and use various
metrics to quantify the impact of noise on various aspects of training and
testing. We evaluate several state-of-the-art neural code intelligence models
and benchmarks based on Java, Python, and Ruby codebases. Our results highlight
important risks: millions of trainable parameters allow the neural networks to
memorize anything, including noisy data, and provide a false sense of
generalization. We observed all models manifest some forms of memorization.
This can be potentially troublesome in most code intelligence tasks where they
rely on rather noise-prone and repetitive data sources, such as code from
GitHub. To the best of our knowledge, we provide the first study to quantify
memorization effects in the domain of software engineering and code
intelligence systems. This work raises awareness and provides new insights into
important issues of training neural models in code intelligence systems that
are usually overlooked by software engineering researchers.
","[{'version': 'v1', 'created': 'Wed, 16 Jun 2021 11:11:41 GMT'}, {'version': 'v2', 'created': 'Sat, 5 Feb 2022 04:45:38 GMT'}, {'version': 'v3', 'created': 'Mon, 12 Sep 2022 04:38:12 GMT'}]",2022-09-15,"[['Rabin', 'Md Rafiqul Islam', ''], ['Hussain', 'Aftab', ''], ['Alipour', 'Mohammad Amin', ''], ['Hellendoorn', 'Vincent J.', '']]","['machine learning', 'software engineering', 'memorization and generalization', 'empirical results', 'models of code']"
6321,1906.11427,Vishal Sharma,"Gaurav Choudhary, Jiyoon Kim, Vishal Sharma",Security of 5G-Mobile Backhaul Networks: A Survey,"30 pages, 6 figures, 6 tables, Journal of Wireless Mobile Networks,
  Ubiquitous Computing, and Dependable Applications (JoWUA)","Journal of Wireless Mobile Networks, Ubiquitous Computing, and
  Dependable Applications (JoWUA), 9:4 (Dec. 2018), pp. 41-70",10.22667/JOWUA.2018.12.31.041,,cs.NI cs.CR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rapid involution of the mobile generation with incipient data networking
capabilities and utilization has exponentially increased the data traffic
volumes. Such traffic drains various key issues in 5G mobile backhaul networks.
Security of mobile backhaul is of utmost importance; however, there are a
limited number of articles, which have explored such a requirement. This paper
discusses the potential design issues and key challenges of the secure 5G
mobile backhaul architecture. The comparisons of the existing state-of-the-art
solutions for secure mobile backhaul, together with their major contributions
have been explored. Furthermore, the paper discussed various key issues related
to Quality of Service (QoS), routing and scheduling, resource management,
capacity enhancement, latency, security-management, and handovers using
mechanisms like Software Defined Networking and millimeter Wave technologies.
Moreover, the trails of research challenges and future directions are
additionally presented.
","[{'version': 'v1', 'created': 'Thu, 27 Jun 2019 03:55:36 GMT'}]",2019-06-28,"[['Choudhary', 'Gaurav', ''], ['Kim', 'Jiyoon', ''], ['Sharma', 'Vishal', '']]","['5G', 'Mobile Backhaul', 'Security', 'SDN', 'mmWave']"
6322,2003.05289,Guangping Li,"Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin
  N\""ollenburg",Balanced Independent and Dominating Sets on Colored Interval Graphs,"In Section 4.2 of an earlier version, we presented a local search
  approach and claimed it was a PTAS for the 1-MCIS problem. After its
  publication date, we noted that our claim was in contradiction with the
  APX-hardness result of the Job Interval Scheduling Problem and found a
  mistake in the proof of our Lemma 9. In this erratum, we removed Section 4.2
  and added a correction note",,10.1007/978-3-030-67731-2_7,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study two new versions of independent and dominating set problems on
vertex-colored interval graphs, namely $f$-Balanced Independent Set ($f$-BIS)
and $f$-Balanced Dominating Set ($f$-BDS). Let $G=(V,E)$ be a vertex-colored
interval graph with a color assignment function $\gamma \colon V \rightarrow
\{1,\ldots,k\}$ that maps all vertices in $G$ onto $k$ colors. A subset of
vertices $S\subseteq V$ is called $f$-balanced if $S$ contains $f$ vertices
from each color class. In the $f$-BIS and $f$-BDS problems, the objective is to
compute an independent set or a dominating set that is $f$-balanced. We show
that both problems are NP-complete even on proper interval graphs. For the
$f$-BIS problem, we design two FPT algorithms, one parameterized by $(f,k)$ for
interval graphs and the other parameterized by the vertex cover number for
general graphs. Moreover, for an optimization variant of BIS on interval
graphs, we show that a simple greedy approach achieves an approximation ratio
of $2$.
","[{'version': 'v1', 'created': 'Wed, 11 Mar 2020 13:49:37 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Oct 2020 17:24:27 GMT'}, {'version': 'v3', 'created': 'Sun, 27 Mar 2022 09:25:33 GMT'}]",2022-03-29,"[['Bhore', 'Sujoy', ''], ['Haunert', 'Jan-Henrik', ''], ['Klute', 'Fabian', ''], ['Li', 'Guangping', ''], ['Nöllenburg', 'Martin', '']]","['Interval graphs', 'Independent set', 'NP-completeness']"
6323,2107.06538,Xinda Liu,"Xinda Liu, Lili Wang, Xiaoguang Han","Transformer with Peak Suppression and Knowledge Guidance for
  Fine-grained Image Recognition",,,10.1016/j.neucom.2022.04.037,,cs.MM cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fine-grained image recognition is challenging because discriminative clues
are usually fragmented, whether from a single image or multiple images. Despite
their significant improvements, most existing methods still focus on the most
discriminative parts from a single image, ignoring informative details in other
regions and lacking consideration of clues from other associated images. In
this paper, we analyze the difficulties of fine-grained image recognition from
a new perspective and propose a transformer architecture with the peak
suppression module and knowledge guidance module, which respects the
diversification of discriminative features in a single image and the
aggregation of discriminative clues among multiple images. Specifically, the
peak suppression module first utilizes a linear projection to convert the input
image into sequential tokens. It then blocks the token based on the attention
response generated by the transformer encoder. This module penalizes the
attention to the most discriminative parts in the feature learning process,
therefore, enhancing the information exploitation of the neglected regions. The
knowledge guidance module compares the image-based representation generated
from the peak suppression module with the learnable knowledge embedding set to
obtain the knowledge response coefficients. Afterwards, it formalizes the
knowledge learning as a classification problem using response coefficients as
the classification scores. Knowledge embeddings and image-based representations
are updated during training so that the knowledge embedding includes
discriminative clues for different images. Finally, we incorporate the acquired
knowledge embeddings into the image-based representations as comprehensive
representations, leading to significantly higher performance. Extensive
evaluations on the six popular datasets demonstrate the advantage of the
proposed method.
","[{'version': 'v1', 'created': 'Wed, 14 Jul 2021 08:07:58 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Dec 2021 06:14:42 GMT'}]",2022-06-07,"[['Liu', 'Xinda', ''], ['Wang', 'Lili', ''], ['Han', 'Xiaoguang', '']]","['Fine-grained image recognition', 'food recognition', 'knowledge guidance', 'peak suppression', 'vision transformer']"
6324,2205.14584,Shahar Kvatinsky Prof.,Shahar Kvatinsky,Making Real Memristive Processing-in-Memory Faster and Reliable,,,10.1109/CNNA49188.2021.9610786,,cs.AR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Memristive technologies are attractive candidates to replace conventional
memory technologies, and can also be used to perform logic and arithmetic
operations using a technique called 'stateful logic.' Combining data storage
and computation in the memory array enables a novel non-von Neumann
architecture, where both the operations are performed within a memristive
Memory Processing Unit (mMPU). The mMPU relies on adding computing capabilities
to the memristive memory cells without changing the basic memory array
structure. The use of an mMPU alleviates the primary restriction on performance
and energy in a von Neumann machine, which is the data transfer between CPU and
memory. Here, the various aspects of mMPU are discussed, including its
architecture and implications on the computing system and software, as well as
examining the microarchitectural aspects. We show how mMPU can be improved to
accelerate different applications and how the poor reliability of memristors
can be improved as part of the mMPU operation.
","[{'version': 'v1', 'created': 'Sun, 29 May 2022 06:50:49 GMT'}]",2022-05-31,"[['Kvatinsky', 'Shahar', '']]","['memristor', 'stateful logic', 'memristive memory']"
6325,2105.14280,Wei Wu,"Wei Wu, Bin Li, Chuan Luo, Wolfgang Nejdl",Hashing-Accelerated Graph Neural Networks for Link Prediction,,The Web Conference 2021,10.1145/3442381.3449884,,cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Networks are ubiquitous in the real world. Link prediction, as one of the key
problems for network-structured data, aims to predict whether there exists a
link between two nodes. The traditional approaches are based on the explicit
similarity computation between the compact node representation by embedding
each node into a low-dimensional space. In order to efficiently handle the
intensive similarity computation in link prediction, the hashing technique has
been successfully used to produce the node representation in the Hamming space.
However, the hashing-based link prediction algorithms face accuracy loss from
the randomized hashing techniques or inefficiency from the learning to hash
techniques in the embedding process. Currently, the Graph Neural Network (GNN)
framework has been widely applied to the graph-related tasks in an end-to-end
manner, but it commonly requires substantial computational resources and memory
costs due to massive parameter learning, which makes the GNN-based algorithms
impractical without the help of a powerful workhorse. In this paper, we propose
a simple and effective model called #GNN, which balances the trade-off between
accuracy and efficiency. #GNN is able to efficiently acquire node
representation in the Hamming space for link prediction by exploiting the
randomized hashing technique to implement message passing and capture
high-order proximity in the GNN framework. Furthermore, we characterize the
discriminative power of #GNN in probability. The extensive experimental results
demonstrate that the proposed #GNN algorithm achieves accuracy comparable to
the learning-based algorithms and outperforms the randomized algorithm, while
running significantly faster than the learning-based algorithms. Also, the
proposed algorithm shows excellent scalability on a large-scale network with
the limited resources.
","[{'version': 'v1', 'created': 'Sat, 29 May 2021 12:04:27 GMT'}]",2021-06-01,"[['Wu', 'Wei', ''], ['Li', 'Bin', ''], ['Luo', 'Chuan', ''], ['Nejdl', 'Wolfgang', '']]","['Link Prediction', 'Attributed Network', 'Hashing', 'Graph Neural Networks']"
6326,2006.12736,Ziaur Rahman,"Ziaur Rahman, Asma Islam Swapna, Habibur Rahman Habib and Akramuzzaman
  Shaoun","Performance Evaluation of Fuzzy Integrated Firewall Model for Hybrid
  Cloud based on Packet Utilization","6 Pages, 2 Tables, 7 Figures","2016 First IEEE International Conference on Computer Communication
  and the Internet (ICCCI), Wuhan, 2016, pp. 253-256",10.1109/CCI.2016.7778919.,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Cloud computing is one of the highly flexible, confidential and easily
accessible medium of platforms and provides powerful service for sharing
information over the Internet. Cloud security has become an emerging issue as
network manager eventually encounter its data protection, vulnerability during
information exchange on the cloud system. We can protect our data from unwanted
access on a hybrid cloud through controlling the respective firewall of the
network. But, the firewall has already proved its weakness as it is unable to
ensure multi-layered, secured accessibility of the cloud network. Efficient
packet utilization sometimes causes high response time in accessing hybrid
cloud. In this paper, a Cloud Model with Hybrid functionality and a secure
Fuzzy Integrated Firewall for that Hybrid Cloud is proposed and thereby
evaluated for the performance in traffic response. Experimental result
illustrated that having a fuzzified firewall gives high point-to-point packet
utilization decreasing the response time than a conventional firewall. Results
from this research work will highly be implemented in transplanting artificial
intelligence in future Internet of Things (IoT).
","[{'version': 'v1', 'created': 'Sun, 21 Jun 2020 05:12:52 GMT'}]",2020-06-24,"[['Rahman', 'Ziaur', ''], ['Swapna', 'Asma Islam', ''], ['Habib', 'Habibur Rahman', ''], ['Shaoun', 'Akramuzzaman', '']]","['Firewall Security', 'Security Evaluation', 'Cloud Net']"
6327,1806.06870,Shawn Jones,"Shawn M. Jones, Michele C. Weigle, Michael L. Nelson",The Off-Topic Memento Toolkit,"10 pages, 14 figures, to appear in the proceedings of the 15th
  International Conference on Digital Preservation (iPres 2018)",,10.17605/OSF.IO/UBW87,,cs.DL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web archive collections are created with a particular purpose in mind. A
curator selects seeds, or original resources, which are then captured by an
archiving system and stored as archived web pages, or mementos. The systems
that build web archive collections are often configured to revisit the same
original resource multiple times. This is incredibly useful for understanding
an unfolding news story or the evolution of an organization. Unfortunately,
over time, some of these original resources can go off-topic and no longer suit
the purpose for which the collection was originally created. They can go
off-topic due to web site redesigns, changes in domain ownership, financial
issues, hacking, technical problems, or because their content has moved on from
the original topic. Even though they are off-topic, the archiving system will
still capture them, thus it becomes imperative to anyone performing research on
these collections to identify these off-topic mementos. Hence, we present the
Off-Topic Memento Toolkit, which allows users to detect off-topic mementos
within web archive collections. The mementos identified by this toolkit can
then be separately removed from a collection or merely excluded from downstream
analysis. The following similarity measures are available: byte count, word
count, cosine similarity, Jaccard distance, S{\o}rensen-Dice distance, Simhash
using raw text content, Simhash using term frequency, and Latent Semantic
Indexing via the gensim library. We document the implementation of each of
these similarity measures. We possess a gold standard dataset generated by
manual analysis, which contains both off-topic and on-topic mementos. Using
this gold standard dataset, we establish a default threshold corresponding to
the best F1 score for each measure. We also provide an overview of potential
future directions that the toolkit may take.
","[{'version': 'v1', 'created': 'Mon, 18 Jun 2018 18:05:12 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Sep 2018 17:52:02 GMT'}]",2021-01-26,"[['Jones', 'Shawn M.', ''], ['Weigle', 'Michele C.', ''], ['Nelson', 'Michael L.', '']]","['topic drift', 'Archive-It', 'web archive', 'similarity']"
6328,2101.06105,Daniel Cebo,Daniel Cebo,"Scientific Relevance and Future of Digital Immortality and Virtual
  Humans",5 pages,"International Journal of Research & Development, volume 5, issue
  12, December 2020, SJIF Impact Factor: 7.001, ISI I.F.Value:1.241",10.6084/m9.figshare.13514371,2101.06105,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  We are on the threshold of a significant change in the way we view digital
life, which will have a major effect on the physical world. Computers have
increasingly emulated deceased human beings through growing awareness in the
fields of artificial intelligence, big data, and machine learning, and have
symbolically managed to overcome death with the help of technology. One thing
is clear, though: now that there are proper and legitimate discussions
happening about human immortality, we can be certain that the future is upon
us. This article attempts to explain and challenge the ways in which digital
immortality, in particular, has manifested itself. This paper summarizes the
technological solutions, research findings and technical challenges of major
researchers by reviewing the key technologies and general technical schemes in
the field of digital human beings. The prospects of digital human beings are
being investigated.
","[{'version': 'v1', 'created': 'Sat, 9 Jan 2021 22:11:16 GMT'}]",2021-01-26,"[['Cebo', 'Daniel', '']]","['computational modelling', 'virtual visible human', 'virtual intelligent human', 'avatar', 'immortality']"
6329,1910.00445,Ivan Y. Tyukin,"Ivan Y. Tyukin, Alexander N. Gorban, Alistair A. McEwan, Sepehr
  Meshkinfamfard, Lixin Tang",Blessing of dimensionality at the edge,,"Information Sciences, 564, 124-143 (2021)",10.1016/j.ins.2021.01.022,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  In this paper we present theory and algorithms enabling classes of Artificial
Intelligence (AI) systems to continuously and incrementally improve with
a-priori quantifiable guarantees - or more specifically remove classification
errors - over time. This is distinct from state-of-the-art machine learning,
AI, and software approaches. Another feature of this approach is that, in the
supervised setting, the computational complexity of training is linear in the
number of training samples. At the time of classification, the computational
complexity is bounded by few inner product calculations. Moreover, the
implementation is shown to be very scalable. This makes it viable for
deployment in applications where computational power and memory are limited,
such as embedded environments. It enables the possibility for fast on-line
optimisation using improved training samples. The approach is based on the
concentration of measure effects and stochastic separation theorems and is
illustrated with an example on the identification faulty processes in Computer
Numerical Control (CNC) milling and with a case study on adaptive removal of
false positives in an industrial video surveillance and analytics system.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2019 16:18:42 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Jul 2020 15:48:40 GMT'}]",2022-05-18,"[['Tyukin', 'Ivan Y.', ''], ['Gorban', 'Alexander N.', ''], ['McEwan', 'Alistair A.', ''], ['Meshkinfamfard', 'Sepehr', ''], ['Tang', 'Lixin', '']]","['Stochastic separation theorems', 'artificial intelligence', 'machinelearning', 'computer vision']"
6330,1902.04995,John Charlton,"John Charlton, Steve Maddock, Paul Richmond",Two-Dimensional Batch Linear Programming on the GPU,"22 pages, 11 figures, 1 listing","Journal of Parallel and Distributed Computing, Volume 126, April
  2019, Pages 152-160",10.1016/j.jpdc.2019.01.001,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper presents a novel, high-performance, graphical processing
unit-based algorithm for efficiently solving two-dimensional linear programs in
batches. The domain of two-dimensional linear programs is particularly useful
due to the prevalence of relevant geometric problems. Batch linear programming
refers to solving numerous different linear programs within one operation. By
solving many linear programs simultaneously and distributing workload evenly
across threads, graphical processing unit utilization can be maximized.
Speedups of over 22 times and 63 times are obtained against state-of-the-art
graphics processing unit and CPU linear program solvers, respectively.
","[{'version': 'v1', 'created': 'Wed, 13 Feb 2019 16:40:15 GMT'}]",2019-02-14,"[['Charlton', 'John', ''], ['Maddock', 'Steve', ''], ['Richmond', 'Paul', '']]","['Graphics Processing Unit', 'GPU-computing', 'Incremental LinearProgramming', 'Cooperative Thread Array']"
6331,2006.16860,Sabah Al-Fedaghi Dr.,Sabah Al-Fedaghi and Bader Behbehani,How to Document Computer Networks,"14 pages, 9 figures","Journal of Computer Science, 16 (6), 723-434, June, 2020",10.3844/jcssp.2020.723.434,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Documenting networks is an essential tool for troubleshooting network
problems. The documentation details a network's structure and context, serves
as a reference and makes network management more effective. Complex network
diagrams are hard to document and maintain and are not guaranteed to reflect
reality. They contain many superficial icons (e.g., wall, screen and tower).
Defining a single coherent network architecture and topology, similar to
engineering schematics, has received great interest. We propose a fundamental
approach for methodically specifying a network architecture using a diagramming
method to conceptualize the network s structure. The method is called a
thinging (abstract) machine, through which the network world is viewed as a
single unifying element called the thing/machine (thimac), providing the
ontology for modeling the network. To test its viability, the
thinging-machine-based methodology was applied to an existing computer network
to produce a single integrated, diagrammatic representation that incorporates
communication, software and hardware. The resultant description shows a viable,
coherent depiction that can replace the current methods.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2020 11:14:27 GMT'}]",2020-07-01,"[['Al-Fedaghi', 'Sabah', ''], ['Behbehani', 'Bader', '']]","['Network Documentation', 'Conceptual Model', 'Computer Network Diagram', 'Network Architecture']"
6332,2207.00417,Joachim Sachs,"Joachim Sachs, Krister Landern\""as",Review of 5G capabilities for smart manufacturing,"Published at 17th International Symposium on Wireless Communication
  Systems (ISWCS), 2021",,10.1109/ISWCS49558.2021.9562173,,cs.NI cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  5G has been defined to address new use cases beyond consumer-focused mobile
broadband services. In particular industrial use cases, for example in smart
manufacturing, have been addressed in the 5G standardization, so that 5G can
support industrial IoT services and wireless industrial networking. To this
end, 5G needs to integrate with the industrial network based on Ethernet and
TSN. 5G can create new opportunities for smart manufacturing by enabling
flexibility and increasing the automation in the production. This paper
provides an overview of the use cases and requirements for smart manufacturing
that can be addressed with 5G and which are validated in three industrial 5G
trial systems. The capabilities of 5G are described for providing non-public
networks that support industrial LAN services based on Ethernet and TSN. The 5G
radio access network functionality is described and discussed for practical
deployments. The paper provides an overview of the current state-of-the-art of
using 5G for smart manufacturing.
","[{'version': 'v1', 'created': 'Fri, 20 May 2022 13:04:26 GMT'}]",2022-07-04,"[['Sachs', 'Joachim', ''], ['Landernäs', 'Krister', '']]","['5G System', 'non-public networks', 'TSN', 'industrial']"
6333,2001.04692,Marco Toldo,"Marco Toldo and Umberto Michieli and Gianluca Agresti and Pietro
  Zanuttigh","Unsupervised Domain Adaptation for Mobile Semantic Segmentation based on
  Cycle Consistency and Feature Alignment","11 pages, 3 figures, 3 tables","Image and Vision Computing, Volume 95, March 2020",10.1016/j.imavis.2020.103889,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The supervised training of deep networks for semantic segmentation requires a
huge amount of labeled real world data. To solve this issue, a commonly
exploited workaround is to use synthetic data for training, but deep networks
show a critical performance drop when analyzing data with slightly different
statistical properties with respect to the training set. In this work, we
propose a novel Unsupervised Domain Adaptation (UDA) strategy to address the
domain shift issue between real world and synthetic representations. An
adversarial model, based on the cycle consistency framework, performs the
mapping between the synthetic and real domain. The data is then fed to a
MobileNet-v2 architecture that performs the semantic segmentation task. An
additional couple of discriminators, working at the feature level of the
MobileNet-v2, allows to better align the features of the two domain
distributions and to further improve the performance. Finally, the consistency
of the semantic maps is exploited. After an initial supervised training on
synthetic data, the whole UDA architecture is trained end-to-end considering
all its components at once. Experimental results show how the proposed strategy
is able to obtain impressive performance in adapting a segmentation network
trained on synthetic data to real world scenarios. The usage of the lightweight
MobileNet-v2 architecture allows its deployment on devices with limited
computational resources as the ones employed in autonomous vehicles.
","[{'version': 'v1', 'created': 'Tue, 14 Jan 2020 10:12:20 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Mar 2020 10:22:43 GMT'}]",2020-03-13,"[['Toldo', 'Marco', ''], ['Michieli', 'Umberto', ''], ['Agresti', 'Gianluca', ''], ['Zanuttigh', 'Pietro', '']]","['Unsupervised Domain Adaptation', 'Semantic Segmentation', 'Adversarial Learning', 'Transfer Learning', 'Image-to-ImageTranslation']"
6334,2111.10414,Tim Nelson,"Tim Nelson (Brown University, USA), Elijah Rivera (Brown University,
  USA), Sam Soucie (Indiana University, USA), Thomas Del Vecchio (Brown
  University, USA), John Wrenn (Brown University, USA), Shriram Krishnamurthi
  (Brown University, USA)","Automated, Targeted Testing of Property-Based Testing Predicates",,"The Art, Science, and Engineering of Programming, 2022, Vol. 6,
  Issue 2, Article 10",10.22152/programming-journal.org/2022/6/10,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: This work is based on property-based testing (PBT). PBT is an
increasingly important form of software testing. Furthermore, it serves as a
concrete gateway into the abstract area of formal methods. Specifically, we
focus on students learning PBT methods.
  Inquiry: How well do students do at PBT? Our goal is to assess the quality of
the predicates they write as part of PBT. Prior work introduced the idea of
decomposing the predicate's property into a conjunction of independent
subproperties. Testing the predicate against each subproperty gives a
""semantic"" understanding of their performance.
  Approach: The notion of independence of subproperties both seems intuitive
and was an important condition in prior work. First, we show that this
condition is overly restrictive and might hide valuable information: it both
undercounts errors and makes it hard to capture misconceptions. Second, we
introduce two forms of automation, one based on PBT tools and the other on
SAT-solving, to enable testing of student predicates. Third, we compare the
output of these automated tools against manually-constructed tests. Fourth, we
also measure the performance of those tools. Finally, we re-assess student
performance reported in prior work.
  Knowledge: We show the difficulty caused by the independent subproperty
requirement. We provide insight into how to use automation effectively to
assess PBT predicates. In particular, we discuss the steps we had to take to
beat human performance. We also provide insight into how to make the automation
work efficiently. Finally, we present a much richer account than prior work of
how students did.
  Grounding: Our methods are grounded in mathematical logic. We also make use
of well-understood principles of test generation from more formal
specifications. This combination ensures the soundness of our work. We use
standard methods to measure performance.
  Importance: As both educators and programmers, we believe PBT is a valuable
tool for students to learn, and its importance will only grow as more
developers appreciate its value. Effective teaching requires a clear
understanding of student knowledge and progress. Our methods enable a rich and
automated analysis of student performance on PBT that yields insight into their
understanding and can capture misconceptions. We therefore expect these results
to be valuable to educators.
","[{'version': 'v1', 'created': 'Fri, 19 Nov 2021 19:50:16 GMT'}]",2021-11-23,"[['Nelson', 'Tim', '', 'Brown University, USA'], ['Rivera', 'Elijah', '', 'Brown University,\n  USA'], ['Soucie', 'Sam', '', 'Indiana University, USA'], ['Del Vecchio', 'Thomas', '', 'Brown\n  University, USA'], ['Wrenn', 'John', '', 'Brown University, USA'], ['Krishnamurthi', 'Shriram', '', 'Brown University, USA']]","['Property-Based Testing', 'Test Oracles', 'Education', 'Specification']"
6335,1602.07210,Nils Kriege,"Andre Droschinsky, Nils M. Kriege, Petra Mutzel",Faster Algorithms for the Maximum Common Subtree Isomorphism Problem,,,10.4230/LIPIcs.MFCS.2016.33,,cs.DS cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The maximum common subtree isomorphism problem asks for the largest possible
isomorphism between subtrees of two given input trees. This problem is a
natural restriction of the maximum common subgraph problem, which is ${\sf
NP}$-hard in general graphs. Confining to trees renders polynomial time
algorithms possible and is of fundamental importance for approaches on more
general graph classes. Various variants of this problem in trees have been
intensively studied. We consider the general case, where trees are neither
rooted nor ordered and the isomorphism is maximum w.r.t. a weight function on
the mapped vertices and edges. For trees of order $n$ and maximum degree
$\Delta$ our algorithm achieves a running time of $\mathcal{O}(n^2\Delta)$ by
exploiting the structure of the matching instances arising as subproblems. Thus
our algorithm outperforms the best previously known approaches. No faster
algorithm is possible for trees of bounded degree and for trees of unbounded
degree we show that a further reduction of the running time would directly
improve the best known approach to the assignment problem. Combining a
polynomial-delay algorithm for the enumeration of all maximum common subtree
isomorphisms with central ideas of our new algorithm leads to an improvement of
its running time from $\mathcal{O}(n^6+Tn^2)$ to $\mathcal{O}(n^3+Tn\Delta)$,
where $n$ is the order of the larger tree, $T$ is the number of different
solutions, and $\Delta$ is the minimum of the maximum degrees of the input
trees. Our theoretical results are supplemented by an experimental evaluation
on synthetic and real-world instances.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2016 15:48:25 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Jun 2016 15:32:22 GMT'}, {'version': 'v3', 'created': 'Mon, 13 Jun 2016 15:01:42 GMT'}, {'version': 'v4', 'created': 'Fri, 12 Aug 2016 15:08:46 GMT'}]",2016-08-23,"[['Droschinsky', 'Andre', ''], ['Kriege', 'Nils M.', ''], ['Mutzel', 'Petra', '']]","['MCS', 'maximum common subtree', 'enumeration algorithms', 'maximumweight bipartite matchings']"
6336,1712.06074,Xiao-Yong Yan,"Xiaoyong Yan, Seong-Gyu Yang, Beom Jun Kim and Petter Minnhagen",Benford's Law and First Letter of Word,"10 pages, 11 figures","Physica A 512, 305-315 (2018)",10.1016/j.physa.2018.08.133,,cs.CL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A universal First-Letter Law (FLL) is derived and described. It predicts the
percentages of first letters for words in novels. The FLL is akin to Benford's
law (BL) of first digits, which predicts the percentages of first digits in a
data collection of numbers. Both are universal in the sense that FLL only
depends on the numbers of letters in the alphabet, whereas BL only depends on
the number of digits in the base of the number system. The existence of these
types of universal laws appears counter-intuitive. Nonetheless both describe
data very well. Relations to some earlier works are given. FLL predicts that an
English author on the average starts about 16 out of 100 words with the English
letter `t'. This is corroborated by data, yet an author can freely write
anything. Fuller implications and the applicability of FLL remain for the
future.
","[{'version': 'v1', 'created': 'Sun, 17 Dec 2017 08:53:13 GMT'}]",2018-08-21,"[['Yan', 'Xiaoyong', ''], ['Yang', 'Seong-Gyu', ''], ['Kim', 'Beom Jun', ''], ['Minnhagen', 'Petter', '']]","['First-Letter Law', 'Benford’s law', 'universal frequency ladder', 'Random Group Formation', 'maximumentropy']"
6337,2204.06846,Jingrui Yu,"Jingrui Yu, Roman Seidel, Gangolf Hirtz","OmniPD: One-Step Person Detection in Top-View Omnidirectional Indoor
  Scenes",,Current Directions in Biomedical Engineering 5.1 (2019): 239-244,10.1515/cdbme-2019-0061,,cs.CV cs.AI,http://creativecommons.org/licenses/by/4.0/,"  We propose a one-step person detector for topview omnidirectional indoor
scenes based on convolutional neural networks (CNNs). While state of the art
person detectors reach competitive results on perspective images, missing CNN
architectures as well as training data that follows the distortion of
omnidirectional images makes current approaches not applicable to our data. The
method predicts bounding boxes of multiple persons directly in omnidirectional
images without perspective transformation, which reduces overhead of pre- and
post-processing and enables real-time performance. The basic idea is to utilize
transfer learning to fine-tune CNNs trained on perspective images with data
augmentation techniques for detection in omnidirectional images. We fine-tune
two variants of Single Shot MultiBox detectors (SSDs). The first one uses
Mobilenet v1 FPN as feature extractor (moSSD). The second one uses ResNet50 v1
FPN (resSSD). Both models are pre-trained on Microsoft Common Objects in
Context (COCO) dataset. We fine-tune both models on PASCAL VOC07 and VOC12
datasets, specifically on class person. Random 90-degree rotation and random
vertical flipping are used for data augmentation in addition to the methods
proposed by original SSD. We reach an average precision (AP) of 67.3 % with
moSSD and 74.9 % with resSSD onthe evaluation dataset. To enhance the
fine-tuning process, we add a subset of HDA Person dataset and a subset of
PIROPOdatabase and reduce the number of perspective images to PASCAL VOC07. The
AP rises to 83.2 % for moSSD and 86.3 % for resSSD, respectively. The average
inference speed is 28 ms per image for moSSD and 38 ms per image for resSSD
using Nvidia Quadro P6000. Our method is applicable to other CNN-based object
detectors and can potentially generalize for detecting other objects in
omnidirectional images.
","[{'version': 'v1', 'created': 'Thu, 14 Apr 2022 09:41:53 GMT'}]",2022-04-15,"[['Yu', 'Jingrui', ''], ['Seidel', 'Roman', ''], ['Hirtz', 'Gangolf', '']]","['Convolutional Neural Networks (CNNs)', 'Transfer Learning', 'Omnidirectional Images', 'Fisheye Camera', 'Object Detection', 'Active Assisted Living (AAL)']"
6338,2205.05563,Alex Sim,"Ruize Han, Alex Sim, Kesheng Wu, Inder Monga, Chin Guok, Frank
  W\""urthwein, Diego Davila, Justas Balcas, Harvey Newman",Access Trends of In-network Cache for Scientific Data,,,10.1145/3526064.3534110,,cs.NI cs.DC cs.LG cs.PF,http://creativecommons.org/licenses/by-sa/4.0/,"  Scientific collaborations are increasingly relying on large volumes of data
for their work and many of them employ tiered systems to replicate the data to
their worldwide user communities. Each user in the community often selects a
different subset of data for their analysis tasks; however, members of a
research group often are working on related research topics that require
similar data objects. Thus, there is a significant amount of data sharing
possible. In this work, we study the access traces of a federated storage cache
known as the Southern California Petabyte Scale Cache. By studying the access
patterns and potential for network traffic reduction by this caching system, we
aim to explore the predictability of the cache uses and the potential for a
more general in-network data caching. Our study shows that this distributed
storage cache is able to reduce the network traffic volume by a factor of 2.35
during a part of the study period. We further show that machine learning models
could predict cache utilization with an accuracy of 0.88. This demonstrates
that such cache usage is predictable, which could be useful for managing
complex networking resources such as in-network caching.
","[{'version': 'v1', 'created': 'Wed, 11 May 2022 15:22:00 GMT'}]",2022-05-12,"[['Han', 'Ruize', ''], ['Sim', 'Alex', ''], ['Wu', 'Kesheng', ''], ['Monga', 'Inder', ''], ['Guok', 'Chin', ''], ['Würthwein', 'Frank', ''], ['Davila', 'Diego', ''], ['Balcas', 'Justas', ''], ['Newman', 'Harvey', '']]","['network cache', 'resource utilization', 'data pattern', 'prediction', 'xcache']"
6339,2211.03452,Noemi Mauro,"Noemi Mauro, Zhongli Filippo Hu and Liliana Ardissono",Justification of Recommender Systems Results: A Service-based Approach,,User Modeling and User-Adapted Interaction (2022),10.1007/s11257-022-09345-8,,cs.IR cs.AI cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  With the increasing demand for predictable and accountable Artificial
Intelligence, the ability to explain or justify recommender systems results by
specifying how items are suggested, or why they are relevant, has become a
primary goal. However, current models do not explicitly represent the services
and actors that the user might encounter during the overall interaction with an
item, from its selection to its usage. Thus, they cannot assess their impact on
the user's experience. To address this issue, we propose a novel justification
approach that uses service models to (i) extract experience data from reviews
concerning all the stages of interaction with items, at different granularity
levels, and (ii) organize the justification of recommendations around those
stages. In a user study, we compared our approach with baselines reflecting the
state of the art in the justification of recommender systems results. The
participants evaluated the Perceived User Awareness Support provided by our
service-based justification models higher than the one offered by the
baselines. Moreover, our models received higher Interface Adequacy and
Satisfaction evaluations by users having different levels of Curiosity or low
Need for Cognition (NfC). Differently, high NfC participants preferred a direct
inspection of item reviews. These findings encourage the adoption of service
models to justify recommender systems results but suggest the investigation of
personalization strategies to suit diverse interaction needs.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2022 11:08:19 GMT'}]",2022-11-08,"[['Mauro', 'Noemi', ''], ['Hu', 'Zhongli Filippo', ''], ['Ardissono', 'Liliana', '']]","['justification of recommender systems results', 'service models', 'service blueprints']"
6340,2202.06200,Zihan Lin,"Zihan Lin, Changxin Tian, Yupeng Hou and Wayne Xin Zhao","Improving Graph Collaborative Filtering with Neighborhood-enriched
  Contrastive Learning","10 pages, 6 figures. Accepted by TheWebConf 2022",,10.1145/3485447.3512104,,cs.IR cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Recently, graph collaborative filtering methods have been proposed as an
effective recommendation approach, which can capture users' preference over
items by modeling the user-item interaction graphs. In order to reduce the
influence of data sparsity, contrastive learning is adopted in graph
collaborative filtering for enhancing the performance. However, these methods
typically construct the contrastive pairs by random sampling, which neglect the
neighboring relations among users (or items) and fail to fully exploit the
potential of contrastive learning for recommendation. To tackle the above
issue, we propose a novel contrastive learning approach, named
Neighborhood-enriched Contrastive Learning, named NCL, which explicitly
incorporates the potential neighbors into contrastive pairs. Specifically, we
introduce the neighbors of a user (or an item) from graph structure and
semantic space respectively. For the structural neighbors on the interaction
graph, we develop a novel structure-contrastive objective that regards users
(or items) and their structural neighbors as positive contrastive pairs. In
implementation, the representations of users (or items) and neighbors
correspond to the outputs of different GNN layers. Furthermore, to excavate the
potential neighbor relation in semantic space, we assume that users with
similar representations are within the semantic neighborhood, and incorporate
these semantic neighbors into the prototype-contrastive objective. The proposed
NCL can be optimized with EM algorithm and generalized to apply to graph
collaborative filtering methods. Extensive experiments on five public datasets
demonstrate the effectiveness of the proposed NCL, notably with 26% and 17%
performance gain over a competitive graph collaborative filtering base model on
the Yelp and Amazon-book datasets respectively. Our code is available at:
https://github.com/RUCAIBox/NCL.
","[{'version': 'v1', 'created': 'Sun, 13 Feb 2022 04:18:18 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Feb 2022 06:50:40 GMT'}]",2022-02-16,"[['Lin', 'Zihan', ''], ['Tian', 'Changxin', ''], ['Hou', 'Yupeng', ''], ['Zhao', 'Wayne Xin', '']]","['Recommender System', 'Collaborative Filtering', 'Contrastive Learning', 'Graph Neural Network']"
6341,2110.09109,Pan Gao Prof.,"Kang You, Pan Gao",Patch-Based Deep Autoencoder for Point Cloud Geometry Compression,Accepted to ACM Multimedia Asia (MMAsia '21),,10.1145/3469877.3490611,,cs.CV cs.MM eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ever-increasing 3D application makes the point cloud compression
unprecedentedly important and needed. In this paper, we propose a patch-based
compression process using deep learning, focusing on the lossy point cloud
geometry compression. Unlike existing point cloud compression networks, which
apply feature extraction and reconstruction on the entire point cloud, we
divide the point cloud into patches and compress each patch independently. In
the decoding process, we finally assemble the decompressed patches into a
complete point cloud. In addition, we train our network by a patch-to-patch
criterion, i.e., use the local reconstruction loss for optimization, to
approximate the global reconstruction optimality. Our method outperforms the
state-of-the-art in terms of rate-distortion performance, especially at low
bitrates. Moreover, the compression process we proposed can guarantee to
generate the same number of points as the input. The network model of this
method can be easily applied to other point cloud reconstruction problems, such
as upsampling.
","[{'version': 'v1', 'created': 'Mon, 18 Oct 2021 08:59:57 GMT'}]",2021-10-19,"[['You', 'Kang', ''], ['Gao', 'Pan', '']]","['point cloud geometry compression', 'lossy compression', 'deep learning']"
6342,2010.05599,Lilang Lin,"Lilang Lin, Sijie Song, Wenhan Yan and Jiaying Liu","MS$^2$L: Multi-Task Self-Supervised Learning for Skeleton Based Action
  Recognition",Accepted by ACMMM 2020,,10.1145/3394171.3413548,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we address self-supervised representation learning from human
skeletons for action recognition. Previous methods, which usually learn feature
presentations from a single reconstruction task, may come across the
overfitting problem, and the features are not generalizable for action
recognition. Instead, we propose to integrate multiple tasks to learn more
general representations in a self-supervised manner. To realize this goal, we
integrate motion prediction, jigsaw puzzle recognition, and contrastive
learning to learn skeleton features from different aspects. Skeleton dynamics
can be modeled through motion prediction by predicting the future sequence. And
temporal patterns, which are critical for action recognition, are learned
through solving jigsaw puzzles. We further regularize the feature space by
contrastive learning. Besides, we explore different training strategies to
utilize the knowledge from self-supervised tasks for action recognition. We
evaluate our multi-task self-supervised learning approach with action
classifiers trained under different configurations, including unsupervised,
semi-supervised and fully-supervised settings. Our experiments on the NW-UCLA,
NTU RGB+D, and PKUMMD datasets show remarkable performance for action
recognition, demonstrating the superiority of our method in learning more
discriminative and general features. Our project website is available at
https://langlandslin.github.io/projects/MSL/.
","[{'version': 'v1', 'created': 'Mon, 12 Oct 2020 11:09:44 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Oct 2020 07:07:05 GMT'}]",2020-10-15,"[['Lin', 'Lilang', ''], ['Song', 'Sijie', ''], ['Yan', 'Wenhan', ''], ['Liu', 'Jiaying', '']]","['Action recognition', 'multi-task', 'self-supervised learning']"
6343,2009.14313,Jonatas Santos De Souza J. S. de Souza,"Jonatas S. de Souza, Jair M. Abe, Luiz A. de Lima, Nilson A. de Souza","The General Law Principles for Protection the Personal Data and their
  Importance","12 pages, 5 figures, 7th International Conference on Computer
  Science, Engineering and Information Technology (CSEIT 2020)","Computer Science & Information Technology (CS & IT), 2020",10.5121/csit.2020.101110,,cs.CR cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Rapid technological change and globalization have created new challenges when
it comes to the protection and processing of personal data. In 2018, Brazil
presented a new law that has the proposal to inform how personal data should be
collected and treated, to guarantee the security and integrity of the data
holder. The purpose of this paper is to emphasize the principles of the General
Law on Personal Data Protection, informing real cases of leakage of personal
data and thus obtaining an understanding of the importance of gains that meet
the interests of Internet users on the subject and its benefits to the entire
Brazilian society.
","[{'version': 'v1', 'created': 'Tue, 29 Sep 2020 21:28:14 GMT'}]",2020-10-01,"[['de Souza', 'Jonatas S.', ''], ['Abe', 'Jair M.', ''], ['de Lima', 'Luiz A.', ''], ['de Souza', 'Nilson A.', '']]","['Data', 'Law General', 'Personal', 'Protection', 'Regulation', 'Legal']"
6344,2201.10102,Md. Shohanur Islam Sobuj,"Md. Ferdous Wahid, Md. Fahim Shahriar, Md. Shohanur Islam Sobuj","A Classical Approach to Handcrafted Feature Extraction Techniques for
  Bangla Handwritten Digit Recognition",,,10.1109/ICECIT54077.2021.9641406,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Bangla Handwritten Digit recognition is a significant step forward in the
development of Bangla OCR. However, intricate shape, structural likeness and
distinctive composition style of Bangla digits makes it relatively challenging
to distinguish. Thus, in this paper, we benchmarked four rigorous classifiers
to recognize Bangla Handwritten Digit: K-Nearest Neighbor (KNN), Support Vector
Machine (SVM), Random Forest (RF), and Gradient-Boosted Decision Trees (GBDT)
based on three handcrafted feature extraction techniques: Histogram of Oriented
Gradients (HOG), Local Binary Pattern (LBP), and Gabor filter on four publicly
available Bangla handwriting digits datasets: NumtaDB, CMARTdb, Ekush and BDRW.
Here, handcrafted feature extraction methods are used to extract features from
the dataset image, which are then utilized to train machine learning
classifiers to identify Bangla handwritten digits. We further fine-tuned the
hyperparameters of the classification algorithms in order to acquire the finest
Bangla handwritten digits recognition performance from these algorithms, and
among all the models we employed, the HOG features combined with SVM model
(HOG+SVM) attained the best performance metrics across all datasets. The
recognition accuracy of the HOG+SVM method on the NumtaDB, CMARTdb, Ekush and
BDRW datasets reached 93.32%, 98.08%, 95.68% and 89.68%, respectively as well
as we compared the model performance with recent state-of-art methods.
","[{'version': 'v1', 'created': 'Tue, 25 Jan 2022 05:27:57 GMT'}]",2022-01-26,"[['Wahid', 'Md. Ferdous', ''], ['Shahriar', 'Md. Fahim', ''], ['Sobuj', 'Md. Shohanur Islam', '']]","['Bangla Handwritten Digit recognition', 'Bangla OCR', 'handcrafted feature extraction', 'machine learning classifiers', 'HOG', 'LBP', 'Gabor']"
6345,2006.06295,Justin Edwards,Justin Edwards and Allison Perrone and Philip R. Doyle,Transparency in Language Generation: Levels of Automation,Accepted for publication at CUI 2020,,10.1145/3405755.3406136,,cs.HC cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Language models and conversational systems are growing increasingly advanced,
creating outputs that may be mistaken for humans. Consumers may thus be misled
by advertising, media reports, or vagueness regarding the role of automation in
the production of language. We propose a taxonomy of language automation, based
on the SAE levels of driving automation, to establish a shared set of terms for
describing automated language. It is our hope that the proposed taxonomy can
increase transparency in this rapidly advancing field.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2020 10:01:59 GMT'}]",2020-06-12,"[['Edwards', 'Justin', ''], ['Perrone', 'Allison', ''], ['Doyle', 'Philip R.', '']]","['transparency', 'natural language generation', 'language models', 'taxonomy', 'levels of automation']"
6346,1910.05699,Dhawal Jethwani,"Dhawal Jethwani, Fran\c{c}ois Le Gall, Sanjay K. Singh",Quantum-Inspired Classical Algorithms for Singular Value Transformation,19 pages,"Proceedings of the 45th International Symposium on Mathematical
  Foundations of Computer Science (MFCS 2020), 53:1-53:14, 2020",10.4230/LIPIcs.MFCS.2020.53,,cs.DS quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A recent breakthrough by Tang (STOC 2019) showed how to ""dequantize"" the
quantum algorithm for recommendation systems by Kerenidis and Prakash (ITCS
2017). The resulting algorithm, classical but ""quantum-inspired"", efficiently
computes a low-rank approximation of the users' preference matrix. Subsequent
works have shown how to construct efficient quantum-inspired algorithms for
approximating the pseudo-inverse of a low-rank matrix as well, which can be
used to (approximately) solve low-rank linear systems of equations. In the
present paper, we pursue this line of research and develop quantum-inspired
algorithms for a large class of matrix transformations that are defined via the
singular value decomposition of the matrix. In particular, we obtain classical
algorithms with complexity polynomially related (in most parameters) to the
complexity of the best quantum algorithms for singular value transformation
recently developed by Chakraborty, Gily\'{e}n and Jeffery (ICALP 2019) and
Gily\'{e}n, Su, Low and Wiebe (STOC19).
","[{'version': 'v1', 'created': 'Sun, 13 Oct 2019 06:39:48 GMT'}, {'version': 'v2', 'created': 'Mon, 4 May 2020 13:04:51 GMT'}, {'version': 'v3', 'created': 'Mon, 6 Jul 2020 10:46:57 GMT'}]",2021-10-05,"[['Jethwani', 'Dhawal', ''], ['Gall', 'François Le', ''], ['Singh', 'Sanjay K.', '']]","['Sampling algorithms', 'quantum-inspired algorithms', 'linear algebra']"
6347,2004.07882,Zongwei Zhou,"Zongwei Zhou, Vatsal Sodha, Jiaxuan Pang, Michael B. Gotway, Jianming
  Liang",Models Genesis,"Journal version of arXiv:1908.06912, accepted by Medical Image
  Analysis",,10.1016/j.media.2020.101840,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transfer learning from natural images to medical images has been established
as one of the most practical paradigms in deep learning for medical image
analysis. To fit this paradigm, however, 3D imaging tasks in the most prominent
imaging modalities (e.g., CT and MRI) have to be reformulated and solved in 2D,
losing rich 3D anatomical information, thereby inevitably compromising its
performance. To overcome this limitation, we have built a set of models, called
Generic Autodidactic Models, nicknamed Models Genesis, because they are created
ex nihilo (with no manual labeling), self-taught (learnt by self-supervision),
and generic (served as source models for generating application-specific target
models). Our extensive experiments demonstrate that our Models Genesis
significantly outperform learning from scratch and existing pre-trained 3D
models in all five target 3D applications covering both segmentation and
classification. More importantly, learning a model from scratch simply in 3D
may not necessarily yield performance better than transfer learning from
ImageNet in 2D, but our Models Genesis consistently top any 2D/2.5D approaches
including fine-tuning the models pre-trained from ImageNet as well as
fine-tuning the 2D versions of our Models Genesis, confirming the importance of
3D anatomical information and significance of Models Genesis for 3D medical
imaging. This performance is attributed to our unified self-supervised learning
framework, built on a simple yet powerful observation: the sophisticated and
recurrent anatomy in medical images can serve as strong yet free supervision
signals for deep models to learn common anatomical representation automatically
via self-supervision. As open science, all codes and pre-trained Models Genesis
are available at https://github.com/MrGiovanni/ModelsGenesis.
","[{'version': 'v1', 'created': 'Thu, 9 Apr 2020 20:37:33 GMT'}, {'version': 'v2', 'created': 'Sun, 27 Sep 2020 05:34:40 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Dec 2020 06:29:32 GMT'}, {'version': 'v4', 'created': 'Wed, 16 Dec 2020 19:58:08 GMT'}]",2020-12-18,"[['Zhou', 'Zongwei', ''], ['Sodha', 'Vatsal', ''], ['Pang', 'Jiaxuan', ''], ['Gotway', 'Michael B.', ''], ['Liang', 'Jianming', '']]","['3D Deep Learning', 'Representation Learning', 'Transfer Learning', 'Self-supervised Learning']"
6348,2004.05696,Husam Suleiman,"Husam Suleiman, Otman Basir","Service Level Driven Job Scheduling in Multi-Tier Cloud Computing: A
  Biologically Inspired Approach",,"pp.99-118, Volume 9, Number 9, July 2019",10.5121/csit.2019.90910,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing environments often have to deal with random-arrival
computational workloads that vary in resource requirements and demand high
Quality of Service (QoS) obligations. It is typical that a
Service-Level-Agreement (SLA) is employed to govern the QoS obligations of the
cloud computing service provider to the client. A typical challenge
service-providers face every day is maintaining a balance between the limited
resources available for computing and the high QoS requirements of varying
random demands. Any imbalance in managing these conflicting objectives may
result in either dissatisfied clients and potentially significant commercial
penalties, or an over-resourced cloud computing environment that can be
significantly costly to acquire and operate. Thus, scheduling the clients'
workloads as they arrive at the environment to ensure their timely execution
has been a central issue in cloud computing. Various approaches have been
reported in the literature to address this problem: Shortest-Queue,
Join-Idle-Queue, Round Robin, MinMin, MaxMin, and Least Connection, to name a
few. However, optimization strategies of such approaches fail to capture QoS
obligations and their associated commercial penalties. This paper presents an
approach for service-level driven load scheduling and balancing in multi-tier
environments. Joint scheduling and balancing operations are employed to
distribute and schedule jobs among the resources, such that the total waiting
time of client jobs is minimized, and thus the potential of a penalty to be
incurred by the service provider is mitigated. A penalty model is used to
quantify the penalty the service provider incurs as a function of the jobs'
total waiting time. A Virtual-Queue abstraction is proposed to facilitate
optimal job scheduling at the tier level. This problem is NP-complete, a
genetic algorithm is proposed for computing job schedules.
","[{'version': 'v1', 'created': 'Sun, 12 Apr 2020 21:03:37 GMT'}]",2020-04-21,"[['Suleiman', 'Husam', ''], ['Basir', 'Otman', '']]","['Heuristic Optimization', 'Job Scheduling', 'Job Allocation', 'Load Balancing', 'Multi-Tier Cloud Computing']"
6349,2301.02999,Qiang Zou,"Qiang Zou, Hsi-Yung Feng, Shuming Gao","Variational Direct Modeling: A framework towards integration of
  parametric modeling and direct modeling in CAD",19pages,,10.1016/j.cad.2022.103465,,cs.GR cs.CG,http://creativecommons.org/licenses/by/4.0/,"  Feature-based parametric modeling is the de facto standard in CAD. Boundary
representation-based direct modeling is another CAD paradigm developed
recently. They have complementary advantages and limitations, thereby offering
huge potential for improvement towards an integrated CAD modeling scheme. Most
existing integration methods are developed by industry and typically treat
direct edits as pseudo-features, where little can be said about seamless
integration. This paper presents an alternative method for seamless
parametric/direct integration, which allows parametric and direct edits to work
in a unified way. The fundamental issues and challenges of parametric/direct
integration are first explained. A framework is then proposed to handle those
information inconsistencies, based on a detection-then-resolution strategy.
Algorithms that can systematically detect and resolve all possible types of
information inconsistencies are also given to implement the framework. With
them, model validity can be maintained during the whole model editing process,
and then the discrepancy between direct edits and parametric edits can be
resolved. The effectiveness of the proposed approach has been shown with a
series of case studies and comparisons, based on a preliminary prototype.
","[{'version': 'v1', 'created': 'Sun, 8 Jan 2023 08:16:28 GMT'}]",2023-01-10,"[['Zou', 'Qiang', ''], ['Feng', 'Hsi-Yung', ''], ['Gao', 'Shuming', '']]","['Computer-aided design', 'Solid modeling', 'Parametric/Direct integration', 'Information inconsistency', 'Validitymaintenance', 'Decision-making', 'Intelligent CAD']"
6350,1710.03394,EPTCS,"Chris Leong, Tim Kelly, Rob Alexander","Incorporating Epistemic Uncertainty into the Safety Assurance of
  Socio-Technical Systems","In Proceedings CREST 2017, arXiv:1710.02770","EPTCS 259, 2017, pp. 56-71",10.4204/EPTCS.259.7,,cs.SE cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In system development, epistemic uncertainty is an ever-present possibility
when reasoning about the causal factors during hazard analysis. Such
uncertainty is common when complicated systems interact with one another, and
it is dangerous because it impairs hazard analysis and thus increases the
chance of overlooking unsafe situations. Uncertainty around causation thus
needs to be managed well. Unfortunately, existing hazard analysis techniques
tend to ignore unknown uncertainties, and system stakeholders rarely track
known uncertainties well through the system lifecycle. In this paper, we
outline an approach to managing epistemic uncertainty in existing hazard
analysis techniques by focusing on known and unknown uncertainty. We have
created a reference populated with a wide range of safety-critical causal
relationships to recognise unknown uncertainty, and we have developed a model
to systematically capture and track known uncertainty around such factors. We
have also defined a process for using the reference and model to assess
possible causal factors that are suspected during hazard analysis. To assess
the applicability of our approach, we have analysed the widely-used MoDAF
architectural model and determined that there is potential for our approach to
identify additional causal factors that are not apparent from individual MoDAF
views. We have also reviewed an existing safety assessment example (the ARP4761
Aircraft System analysis) and determined that our approach could indeed be
incorporated into that process. We have also integrated our approach into the
STPA hazard analysis technique to demonstrate its feasibility to incorporate
into existing techniques. It is therefore plausible that our approach can
increase safety assurance provided by hazard analysis in the face of epistemic
uncertainty.
","[{'version': 'v1', 'created': 'Tue, 10 Oct 2017 03:52:28 GMT'}]",2017-10-20,"[['Leong', 'Chris', ''], ['Kelly', 'Tim', ''], ['Alexander', 'Rob', '']]","['Safety assurance', 'causal factors', 'epistemic uncertainty', 'socio-technical systems', 'hazard analysis']"
6351,1905.01453,Atsushi Igarashi,Hiroaki Inoue and Atsushi Igarashi,"A Type System for First-Class Layers with Inheritance, Subtyping, and
  Swapping",,Sci. Comput. Program. 179: 54-86 (2019),10.1016/j.scico.2019.03.008,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context-Oriented Programming (COP) is a programming paradigm to encourage
modularization of context-dependent software. Key features of COP are
layers---modules to describe context-dependent behavioral variations of a
software system---and their dynamic activation, which can modify the behavior
of multiple objects that have already been instantiated. Typechecking programs
written in a COP language is difficult because the activation of a layer can
even change objects' interfaces. Inoue et al. have informally discussed how to
make JCop, an extension of Java for COP by Appeltauer et al., type-safe.
  In this article, we formalize a small COP language called ContextFJ$_{<:}$
with its operational semantics and type system and show its type soundness. The
language models main features of the type-safe version of JCop, including
dynamically activated first-class layers, inheritance of layer definitions,
layer subtyping, and layer swapping.
","[{'version': 'v1', 'created': 'Sat, 4 May 2019 08:12:29 GMT'}]",2019-09-04,"[['Inoue', 'Hiroaki', ''], ['Igarashi', 'Atsushi', '']]","['Context-oriented programming', 'dynamic layer composition', 'first-classlayers', 'layer inheritance', 'type systems']"
6352,2203.15510,Lars Reimann,"Lars Reimann, G\""unter Kniesel-W\""unsche","Achieving Guidance in Applied Machine Learning through Software
  Engineering Techniques","The definitive Version of Record was published in Companion
  Proceedings of the 4th International Conference on the Art, Science, and
  Engineering of Programming (<Programming'20> Companion), March 23-26, 2020,
  Porto, Portugal",,10.1145/3397537.3397552,,cs.SE cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Development of machine learning (ML) applications is hard. Producing
successful applications requires, among others, being deeply familiar with a
variety of complex and quickly evolving application programming interfaces
(APIs). It is therefore critical to understand what prevents developers from
learning these APIs, using them properly at development time, and understanding
what went wrong when it comes to debugging. We look at the (lack of) guidance
that currently used development environments and ML APIs provide to developers
of ML applications, contrast these with software engineering best practices,
and identify gaps in the current state of the art. We show that current ML
tools fall short of fulfilling some basic software engineering gold standards
and point out ways in which software engineering concepts, tools and techniques
need to be extended and adapted to match the special needs of ML application
development. Our findings point out ample opportunities for research on
ML-specific software engineering.
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2022 12:54:57 GMT'}]",2022-03-30,"[['Reimann', 'Lars', ''], ['Kniesel-Wünsche', 'Günter', '']]","['machine learning', 'software engineering', 'guidance', 'usability', 'learnability']"
6353,2108.13342,Wei Niu,"Wei Niu, Jiexiong Guan, Yanzhi Wang, Gagan Agrawal, Bin Ren","DNNFusion: Accelerating Deep Neural Networks Execution with Advanced
  Operator Fusion",,,10.1145/3416510,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Deep Neural Networks (DNNs) have emerged as the core enabler of many major
applications on mobile devices. To achieve high accuracy, DNN models have
become increasingly deep with hundreds or even thousands of operator layers,
leading to high memory and computational requirements for inference. Operator
fusion (or kernel/layer fusion) is key optimization in many state-of-the-art
DNN execution frameworks, such as TensorFlow, TVM, and MNN. However, these
frameworks usually adopt fusion approaches based on certain patterns that are
too restrictive to cover the diversity of operators and layer connections.
Polyhedral-based loop fusion techniques, on the other hand, work on a low-level
view of the computation without operator-level information, and can also miss
potential fusion opportunities. To address this challenge, this paper proposes
a novel and extensive loop fusion framework called DNNFusion. The basic idea of
this work is to work at an operator view of DNNs, but expand fusion
opportunities by developing a classification of both individual operators and
their combinations. In addition, DNNFusion includes 1) a novel
mathematical-property-based graph rewriting framework to reduce evaluation
costs and facilitate subsequent operator fusion, 2) an integrated fusion plan
generation that leverages the high-level analysis and accurate light-weight
profiling, and 3) additional optimizations during fusion code generation.
DNNFusion is extensively evaluated on 15 DNN models with varied types of tasks,
model sizes, and layer counts. The evaluation results demonstrate that
DNNFusion finds up to 8.8x higher fusion opportunities, outperforms four
state-of-the-art DNN execution frameworks with 9.3x speedup. The memory
requirement reduction and speedups can enable the execution of many of the
target models on mobile devices and even make them part of a real-time
application.
","[{'version': 'v1', 'created': 'Mon, 30 Aug 2021 16:11:38 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Dec 2021 01:44:57 GMT'}]",2021-12-02,"[['Niu', 'Wei', ''], ['Guan', 'Jiexiong', ''], ['Wang', 'Yanzhi', ''], ['Agrawal', 'Gagan', ''], ['Ren', 'Bin', '']]","['Compiler Optimization', 'Operator Fusion', 'DeepNeural Network', 'Mobile Devices']"
6354,2007.11983,Kenneth Lai,Kenneth Lai and Svetlana N. Yanushkevich,CNN+RNN Depth and Skeleton based Dynamic Hand Gesture Recognition,,"2018 24th International Conference on Pattern Recognition (ICPR),
  Beijing, 2018, pp. 3451-3456",10.1109/ICPR.2018.8545718,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human activity and gesture recognition is an important component of rapidly
growing domain of ambient intelligence, in particular in assisting living and
smart homes. In this paper, we propose to combine the power of two deep
learning techniques, the convolutional neural networks (CNN) and the recurrent
neural networks (RNN), for automated hand gesture recognition using both depth
and skeleton data. Each of these types of data can be used separately to train
neural networks to recognize hand gestures. While RNN were reported previously
to perform well in recognition of sequences of movement for each skeleton joint
given the skeleton information only, this study aims at utilizing depth data
and apply CNN to extract important spatial information from the depth images.
Together, the tandem CNN+RNN is capable of recognizing a sequence of gestures
more accurately. As well, various types of fusion are studied to combine both
the skeleton and depth information in order to extract temporal-spatial
information. An overall accuracy of 85.46% is achieved on the dynamic hand
gesture-14/28 dataset.
","[{'version': 'v1', 'created': 'Wed, 22 Jul 2020 10:25:19 GMT'}]",2020-07-24,"[['Lai', 'Kenneth', ''], ['Yanushkevich', 'Svetlana N.', '']]","['Biometrics', 'gesture recognition', 'convolutional neuralnetworks', 'recurrent neural networks']"
6355,2010.10409,Faegheh Hasibi,Emma J. Gerritse and Faegheh Hasibi and Arjen P. de Vries,"Bias in Conversational Search: The Double-Edged Sword of the
  Personalized Knowledge Graph",,,10.1145/3409256.3409834,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Conversational AI systems are being used in personal devices, providing users
with highly personalized content. Personalized knowledge graphs (PKGs) are one
of the recently proposed methods to store users' information in a structured
form and tailor answers to their liking. Personalization, however, is prone to
amplifying bias and contributing to the echo-chamber phenomenon. In this paper,
we discuss different types of biases in conversational search systems, with the
emphasis on the biases that are related to PKGs. We review existing definitions
of bias in the literature: people bias, algorithm bias, and a combination of
the two, and further propose different strategies for tackling these biases for
conversational search systems. Finally, we discuss methods for measuring bias
and evaluating user satisfaction.
","[{'version': 'v1', 'created': 'Tue, 20 Oct 2020 16:14:33 GMT'}]",2020-10-21,"[['Gerritse', 'Emma J.', ''], ['Hasibi', 'Faegheh', ''], ['de Vries', 'Arjen P.', '']]","['Bias', 'Conversational search', 'Knowledge graphs', 'Fairness']"
6356,2008.08931,Liyi Guo,"Liyi Guo, Rui Lu, Haoqi Zhang, Junqi Jin, Zhenzhe Zheng, Fan Wu, Jin
  Li, Haiyang Xu, Han Li, Wenkai Lu, Jian Xu, Kun Gai","A Deep Prediction Network for Understanding Advertiser Intent and
  Satisfaction",,"CIKM 2020, Virtual Event, Ireland",10.1145/3340531.3412681,,cs.SI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For e-commerce platforms such as Taobao and Amazon, advertisers play an
important role in the entire digital ecosystem: their behaviors explicitly
influence users' browsing and shopping experience; more importantly,
advertiser's expenditure on advertising constitutes a primary source of
platform revenue. Therefore, providing better services for advertisers is
essential for the long-term prosperity for e-commerce platforms. To achieve
this goal, the ad platform needs to have an in-depth understanding of
advertisers in terms of both their marketing intents and satisfaction over the
advertising performance, based on which further optimization could be carried
out to service the advertisers in the correct direction. In this paper, we
propose a novel Deep Satisfaction Prediction Network (DSPN), which models
advertiser intent and satisfaction simultaneously. It employs a two-stage
network structure where advertiser intent vector and satisfaction are jointly
learned by considering the features of advertiser's action information and
advertising performance indicators. Experiments on an Alibaba advertisement
dataset and online evaluations show that our proposed DSPN outperforms
state-of-the-art baselines and has stable performance in terms of AUC in the
online environment. Further analyses show that DSPN not only predicts
advertisers' satisfaction accurately but also learns an explainable advertiser
intent, revealing the opportunities to optimize the advertising performance
further.
","[{'version': 'v1', 'created': 'Thu, 20 Aug 2020 15:08:50 GMT'}]",2020-09-01,"[['Guo', 'Liyi', ''], ['Lu', 'Rui', ''], ['Zhang', 'Haoqi', ''], ['Jin', 'Junqi', ''], ['Zheng', 'Zhenzhe', ''], ['Wu', 'Fan', ''], ['Li', 'Jin', ''], ['Xu', 'Haiyang', ''], ['Li', 'Han', ''], ['Lu', 'Wenkai', ''], ['Xu', 'Jian', ''], ['Gai', 'Kun', '']]","['submitted in an ad auction as a directexpression of intent', 'use them to determine the relevance of thead', 'user query']"
6357,2005.06832,Yinghong Zhao,"Yinghong Zhao, Xiao He, Junfeng Zhang, Hongquan Ji, Donghua Zhou,
  Michael G. Pecht","Detection of Intermittent Faults Based on an Optimally Weighted Moving
  Average T^2 Control Chart with Stationary Observations","Automatica, Published online, 2020",,10.1016/j.automatica.2020.109298,,cs.IT cs.SY eess.SY math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The moving average (MA)-type scheme, also known as the smoothing method, has
been well established within the multivariate statistical process monitoring
(MSPM) framework since the 1990s. However, its theoretical basis is still
limited to smoothing independent data, and the optimality of its equally or
exponentially weighted scheme remains unproven. This paper aims to weaken the
independence assumption in the existing MA method, and then extend it to a
broader area of dealing with autocorrelated weakly stationary processes. With
the discovery of the non-optimality of the equally and exponentially weighted
schemes used for fault detection when data have autocorrelation, the essence
that they do not effectively utilize the correlation information of samples is
revealed, giving birth to an optimally weighted moving average (OWMA) theory.
The OWMA method is combined with the Hotelling's $T^2$ statistic to form an
OWMA $T^2$ control chart (OWMA-TCC), in order to detect a more challenging type
of fault, i.e., intermittent fault (IF). Different from the MA scheme that puts
an equal weight on samples within a time window, OWMA-TCC uses correlation
(autocorrelation and cross-correlation) information to find an optimal weight
vector (OWV) for the purpose of IF detection (IFD). In order to achieve a best
IFD performance, the concept of IF detectability is defined and corresponding
detectability conditions are provided, which further serve as selection
criteria of the OWV. Then, the OWV is given in the form of a solution to
nonlinear equations, whose existence is proven with the aid of the Brouwer
fixed-point theory. Moreover, symmetrical structure of the OWV is revealed, and
the optimality of the MA scheme for any IF directions when data exhibit no
autocorrelation is proven.
","[{'version': 'v1', 'created': 'Thu, 14 May 2020 09:24:07 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Nov 2020 02:53:11 GMT'}]",2020-11-11,"[['Zhao', 'Yinghong', ''], ['He', 'Xiao', ''], ['Zhang', 'Junfeng', ''], ['Ji', 'Hongquan', ''], ['Zhou', 'Donghua', ''], ['Pecht', 'Michael G.', '']]","['Weighted moving average', 'optimal weight', 'intermittent faults', 'fault detection', 'detectability']"
6358,2203.09127,Jizhou Huang,"Jizhou Huang, Haifeng Wang, Yibo Sun, Yunsheng Shi, Zhengjie Huang, An
  Zhuo, Shikun Feng","ERNIE-GeoL: A Geography-and-Language Pre-trained Model and its
  Applications in Baidu Maps","Accepted by KDD 2022, camera-ready version",,10.1145/3534678.3539021,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pre-trained models (PTMs) have become a fundamental backbone for downstream
tasks in natural language processing and computer vision. Despite initial gains
that were obtained by applying generic PTMs to geo-related tasks at Baidu Maps,
a clear performance plateau over time was observed. One of the main reasons for
this plateau is the lack of readily available geographic knowledge in generic
PTMs. To address this problem, in this paper, we present ERNIE-GeoL, which is a
geography-and-language pre-trained model designed and developed for improving
the geo-related tasks at Baidu Maps. ERNIE-GeoL is elaborately designed to
learn a universal representation of geography-language by pre-training on
large-scale data generated from a heterogeneous graph that contains abundant
geographic knowledge. Extensive quantitative and qualitative experiments
conducted on large-scale real-world datasets demonstrate the superiority and
effectiveness of ERNIE-GeoL. ERNIE-GeoL has already been deployed in production
at Baidu Maps since April 2021, which significantly benefits the performance of
various downstream tasks. This demonstrates that ERNIE-GeoL can serve as a
fundamental backbone for a wide range of geo-related tasks.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2022 07:07:33 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Apr 2022 01:29:32 GMT'}, {'version': 'v3', 'created': 'Fri, 10 Jun 2022 08:31:18 GMT'}]",2022-06-13,"[['Huang', 'Jizhou', ''], ['Wang', 'Haifeng', ''], ['Sun', 'Yibo', ''], ['Shi', 'Yunsheng', ''], ['Huang', 'Zhengjie', ''], ['Zhuo', 'An', ''], ['Feng', 'Shikun', '']]","['pre-training', 'heterogeneous graph', 'graph neural network']"
6359,2009.04535,Bla\v{z} \v{S}krlj,"Sebastian Me\v{z}nar, Nada Lavra\v{c}, Bla\v{z} \v{S}krlj",SNoRe: Scalable Unsupervised Learning of Symbolic Node Representations,Accepted to IEEEAccess,,10.1109/ACCESS.2020.3039541,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning from complex real-life networks is a lively research area, with
recent advances in learning information-rich, low-dimensional network node
representations. However, state-of-the-art methods are not necessarily
interpretable and are therefore not fully applicable to sensitive settings in
biomedical or user profiling tasks, where explicit bias detection is highly
relevant. The proposed SNoRe (Symbolic Node Representations) algorithm is
capable of learning symbolic, human-understandable representations of
individual network nodes, based on the similarity of neighborhood hashes which
serve as features. SNoRe's interpretable features are suitable for direct
explanation of individual predictions, which we demonstrate by coupling it with
the widely used instance explanation tool SHAP to obtain nomograms representing
the relevance of individual features for a given classification. To our
knowledge, this is one of the first such attempts in a structural node
embedding setting. In the experimental evaluation on eleven real-life datasets,
SNoRe proved to be competitive to strong baselines, such as variational graph
autoencoders, node2vec and LINE. The vectorized implementation of SNoRe scales
to large networks, making it suitable for contemporary network learning and
analysis tasks.
","[{'version': 'v1', 'created': 'Tue, 8 Sep 2020 08:13:21 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Nov 2020 13:34:42 GMT'}]",2020-12-01,"[['Mežnar', 'Sebastian', ''], ['Lavrač', 'Nada', ''], ['Škrlj', 'Blaž', '']]","['node embedding', 'feature construction', 'symbolic learning', 'interpretable machine learning']"
6360,2004.10827,Tal Linzen,Tal Linzen and Marco Baroni,Syntactic Structure from Deep Learning,In press at Annual Reviews of Linguistics,,10.1146/annurev-linguistics-032020-051035,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern deep neural networks achieve impressive performance in engineering
applications that require extensive linguistic skills, such as machine
translation. This success has sparked interest in probing whether these models
are inducing human-like grammatical knowledge from the raw data they are
exposed to, and, consequently, whether they can shed new light on long-standing
debates concerning the innate structure necessary for language acquisition. In
this article, we survey representative studies of the syntactic abilities of
deep networks, and discuss the broader implications that this work has for
theoretical linguistics.
","[{'version': 'v1', 'created': 'Wed, 22 Apr 2020 20:02:49 GMT'}]",2020-04-24,"[['Linzen', 'Tal', ''], ['Baroni', 'Marco', '']]","['deep learning', 'syntax', 'nature vs']"
6361,2004.04573,Mark Crowley,"Benyamin Ghojogh, Fakhri Karray, Mark Crowley","Backprojection for Training Feedforward Neural Networks in the Input and
  Feature Spaces","Accepted (to appear) in International Conference on Image Analysis
  and Recognition (ICIAR) 2020, Springer","International Conference on Image Analysis and Recognition, vol 2,
  pp. 16-24. Springer, Cham, 2020",10.1007/978-3-030-50516-5_2,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  After the tremendous development of neural networks trained by
backpropagation, it is a good time to develop other algorithms for training
neural networks to gain more insights into networks. In this paper, we propose
a new algorithm for training feedforward neural networks which is fairly faster
than backpropagation. This method is based on projection and reconstruction
where, at every layer, the projected data and reconstructed labels are forced
to be similar and the weights are tuned accordingly layer by layer. The
proposed algorithm can be used for both input and feature spaces, named as
backprojection and kernel backprojection, respectively. This algorithm gives an
insight to networks with a projection-based perspective. The experiments on
synthetic datasets show the effectiveness of the proposed method.
","[{'version': 'v1', 'created': 'Sun, 5 Apr 2020 20:53:11 GMT'}]",2020-07-01,"[['Ghojogh', 'Benyamin', ''], ['Karray', 'Fakhri', ''], ['Crowley', 'Mark', '']]","['Neural network', 'backprojection', 'kernel backprojection', 'projection', 'training']"
6362,1810.06689,Ripon Patgiri,"Ripon Patgiri, Sabuzima Nayak, Samir Kumar Borgohain",Preventing DDoS using Bloom Filter: A Survey,"9 pages, 1 figure. This article is accepted for publication in EAI
  Endorsed Transactions on Scalable Information Systems","EAI Endorsed Transactions on Scalable Information Systems, 5(19),
  2018",10.4108/eai.19-6-2018.155865,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed Denial-of-Service (DDoS) is a menace for service provider and
prominent issue in network security. Defeating or defending the DDoS is a prime
challenge. DDoS make a service unavailable for a certain time. This phenomenon
harms the service providers, and hence, loss of business revenue. Therefore,
DDoS is a grand challenge to defeat. There are numerous mechanism to defend
DDoS, however, this paper surveys the deployment of Bloom Filter in defending a
DDoS attack. The Bloom Filter is a probabilistic data structure for membership
query that returns either true or false. Bloom Filter uses tiny memory to store
information of large data. Therefore, packet information is stored in Bloom
Filter to defend and defeat DDoS. This paper presents a survey on DDoS
defending technique using Bloom Filter.
","[{'version': 'v1', 'created': 'Mon, 15 Oct 2018 21:00:12 GMT'}]",2019-03-18,"[['Patgiri', 'Ripon', ''], ['Nayak', 'Sabuzima', ''], ['Borgohain', 'Samir Kumar', '']]","['Bloom Filter', 'Membership Filter', 'DDoS', 'Network Security', 'Attacks', 'Survey']"
6363,2004.04977,Evangelos Ntavelis,"Evangelos Ntavelis, Andr\'es Romero, Iason Kastanis, Luc Van Gool and
  Radu Timofte","SESAME: Semantic Editing of Scenes by Adding, Manipulating or Erasing
  Objects",,,10.1007/978-3-030-58542-6_24,,cs.CV cs.GR cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advances in image generation gave rise to powerful tools for semantic
image editing. However, existing approaches can either operate on a single
image or require an abundance of additional information. They are not capable
of handling the complete set of editing operations, that is addition,
manipulation or removal of semantic concepts. To address these limitations, we
propose SESAME, a novel generator-discriminator pair for Semantic Editing of
Scenes by Adding, Manipulating or Erasing objects. In our setup, the user
provides the semantic labels of the areas to be edited and the generator
synthesizes the corresponding pixels. In contrast to previous methods that
employ a discriminator that trivially concatenates semantics and image as an
input, the SESAME discriminator is composed of two input streams that
independently process the image and its semantics, using the latter to
manipulate the results of the former. We evaluate our model on a diverse set of
datasets and report state-of-the-art performance on two tasks: (a) image
manipulation and (b) image generation conditioned on semantic labels.
","[{'version': 'v1', 'created': 'Fri, 10 Apr 2020 10:19:19 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Oct 2020 14:52:01 GMT'}]",2020-10-09,"[['Ntavelis', 'Evangelos', ''], ['Romero', 'Andrés', ''], ['Kastanis', 'Iason', ''], ['Van Gool', 'Luc', ''], ['Timofte', 'Radu', '']]","['Generative Adversarial Networks', 'Interactive Image Editing', 'Image Synthesis']"
6364,1606.02899,Manuel Mazzara,"Jordi Vallverd\'u, Max Talanov, Salvatore Distefano, Manuel Mazzara,
  Alexander Tchitchigin, Ildar Nurgaliev","A Cognitive Architecture for the Implementation of Emotions in Computing
  Systems",,"BICA, Volume 15, January 2016, Pages 34-40",10.1016/j.bica.2015.11.002,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a new neurobiologically-inspired affective cognitive
architecture: NEUCOGAR (NEUromodulating COGnitive ARchitecture). The objective
of NEUCOGAR is the identification of a mapping from the influence of serotonin,
dopamine and noradrenaline to the computing processes based on Von Neuman's
architecture, in order to implement affective phenomena which can operate on
the Turing's machine model. As basis of the modeling we use and extend the
L\""ovheim Cube of Emotion with parameters of the Von Neumann architecture.
Validation is conducted via simulation on a computing system of dopamine
neuromodulation and its effects on the Cortex. In the experimental phase of the
project, the increase of computing power and storage redistribution due to
emotion stimulus modulated by the dopamine system, confirmed the soundness of
the model.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2016 10:43:21 GMT'}]",2016-06-10,"[['Vallverdú', 'Jordi', ''], ['Talanov', 'Max', ''], ['Distefano', 'Salvatore', ''], ['Mazzara', 'Manuel', ''], ['Tchitchigin', 'Alexander', ''], ['Nurgaliev', 'Ildar', '']]","['Cognitive architecture', 'Affects', 'Emotions', 'Emotion Modeling', 'Neuromodulation', 'Affective computing']"
6365,1908.11590,Davide Taibi,"Valentina Lenarduzzi, Nyyti Saarim\""aki, Davide Taibi","Some SonarQube Issues have a Significant but SmallEffect on Faults and
  Changes. A large-scale empirical study",,"Journal of Systems and Software Volume 170, December 2020, 110750",10.1016/j.jss.2020.110750,,cs.SE,http://creativecommons.org/licenses/by-sa/4.0/,"  Context. Companies commonly invest effort to remove technical issues believed
to impact software qualities, such as removing anti-patterns or coding styles
violations. Objective. Our aim is to analyze the diffuseness of Technical Debt
(TD) items in software systems and to assess their impact on code changes and
fault-proneness, considering also the type of TD items and their severity.
Method. We conducted a case study among 33 Java projects from the Apache
Software Foundation (ASF) repository. We analyzed 726 commits containing 27K
faults and 12M changes. The projects violated 173 SonarQube rules generating
more than 95K TD items in more than 200K classes. Results. Clean classes
(classes not affected by TD items) are less change-prone than dirty ones, but
the difference between the groups is small. Clean classes are slightly more
change-prone than classes affected by TD items of type Code Smell or Security
Vulnerability. As for fault-proneness, there is no difference between clean and
dirty classes. Moreover, we found a lot of incongruities in the type and
severity level assigned by SonarQube. Conclusions. Our result can be useful for
practitioners to understand which TD items they should refactor and for
researchers to bridge the missing gaps. They can also support companies and
tool vendors in identifying TD items as accurately as possible.
","[{'version': 'v1', 'created': 'Fri, 30 Aug 2019 08:21:57 GMT'}]",2021-03-09,"[['Lenarduzzi', 'Valentina', ''], ['Saarimäki', 'Nyyti', ''], ['Taibi', 'Davide', '']]","['Change-proneness', 'Fault-proneness', 'SonarQube']"
6366,2008.04397,Steven W. D. Chien,"Steven W. D. Chien, Jonas Nylund, Gabriel Bengtsson, Ivy B. Peng,
  Artur Podobas, Stefano Markidis",sputniPIC: an Implicit Particle-in-Cell Code for Multi-GPU Systems,"Accepted for publication at the 32nd International Symposium on
  Computer Architecture and High Performance Computing (SBAC-PAD 2020)",,10.1109/SBAC-PAD49847.2020.00030,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Large-scale simulations of plasmas are essential for advancing our
understanding of fusion devices, space, and astrophysical systems.
Particle-in-Cell (PIC) codes have demonstrated their success in simulating
numerous plasma phenomena on HPC systems. Today, flagship supercomputers
feature multiple GPUs per compute node to achieve unprecedented computing power
at high power efficiency. PIC codes require new algorithm design and
implementation for exploiting such accelerated platforms. In this work, we
design and optimize a three-dimensional implicit PIC code, called sputniPIC, to
run on a general multi-GPU compute node. We introduce a particle decomposition
data layout, in contrast to domain decomposition on CPU-based implementations,
to use particle batches for overlapping communication and computation on GPUs.
sputniPIC also natively supports different precision representations to achieve
speed up on hardware that supports reduced precision. We validate sputniPIC
through the well-known GEM challenge and provide performance analysis. We test
sputniPIC on three multi-GPU platforms and report a 200-800x performance
improvement with respect to the sputniPIC CPU OpenMP version performance. We
show that reduced precision could further improve performance by 45% to 80% on
the three platforms. Because of these performance improvements, on a single
node with multiple GPUs, sputniPIC enables large-scale three-dimensional PIC
simulations that were only possible using clusters.
","[{'version': 'v1', 'created': 'Mon, 10 Aug 2020 20:10:23 GMT'}]",2021-07-05,"[['Chien', 'Steven W. D.', ''], ['Nylund', 'Jonas', ''], ['Bengtsson', 'Gabriel', ''], ['Peng', 'Ivy B.', ''], ['Podobas', 'Artur', ''], ['Markidis', 'Stefano', '']]","['Nvidia GPU', 'implicit Particle-in-Cell', 'multi-GPU', 'CUDA']"
6367,2202.05402,Krzysztof Gajos,Krzysztof Z. Gajos and Lena Mamykina,"Do People Engage Cognitively with AI? Impact of AI Assistance on
  Incidental Learning","13 pages, 6 figures, to appear in ACM IUI'22",,10.1145/3490099.3511138,,cs.HC cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When people receive advice while making difficult decisions, they often make
better decisions in the moment and also increase their knowledge in the
process. However, such incidental learning can only occur when people
cognitively engage with the information they receive and process this
information thoughtfully. How do people process the information and advice they
receive from AI, and do they engage with it deeply enough to enable learning?
To answer these questions, we conducted three experiments in which individuals
were asked to make nutritional decisions and received simulated AI
recommendations and explanations. In the first experiment, we found that when
people were presented with both a recommendation and an explanation before
making their choice, they made better decisions than they did when they
received no such help, but they did not learn. In the second experiment,
participants first made their own choice, and only then saw a recommendation
and an explanation from AI; this condition also resulted in improved decisions,
but no learning. However, in our third experiment, participants were presented
with just an AI explanation but no recommendation and had to arrive at their
own decision. This condition led to both more accurate decisions and learning
gains. We hypothesize that learning gains in this condition were due to deeper
engagement with explanations needed to arrive at the decisions. This work
provides some of the most direct evidence to date that it may not be sufficient
to include explanations together with AI-generated recommendation to ensure
that people engage carefully with the AI-provided information. This work also
presents one technique that enables incidental learning and, by implication,
can help people process AI recommendations and explanations more carefully.
","[{'version': 'v1', 'created': 'Fri, 11 Feb 2022 01:28:59 GMT'}]",2022-02-14,"[['Gajos', 'Krzysztof Z.', ''], ['Mamykina', 'Lena', '']]","['decision support systems', 'incidental learning', 'cognitive engagement', 'explainable AI', 'human-centered AI']"
6368,1904.09020,Giovanni Campagna,"Giovanni Campagna, Silei Xu, Mehrad Moradshahi, Richard Socher, Monica
  S. Lam","Genie: A Generator of Natural Language Semantic Parsers for Virtual
  Assistant Commands",To appear in PLDI 2019,,10.1145/3314221.3314594,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To understand diverse natural language commands, virtual assistants today are
trained with numerous labor-intensive, manually annotated sentences. This paper
presents a methodology and the Genie toolkit that can handle new compound
commands with significantly less manual effort. We advocate formalizing the
capability of virtual assistants with a Virtual Assistant Programming Language
(VAPL) and using a neural semantic parser to translate natural language into
VAPL code. Genie needs only a small realistic set of input sentences for
validating the neural model. Developers write templates to synthesize data;
Genie uses crowdsourced paraphrases and data augmentation, along with the
synthesized data, to train a semantic parser. We also propose design principles
that make VAPL languages amenable to natural language translation. We apply
these principles to revise ThingTalk, the language used by the Almond virtual
assistant. We use Genie to build the first semantic parser that can support
compound virtual assistants commands with unquoted free-form parameters. Genie
achieves a 62% accuracy on realistic user inputs. We demonstrate Genie's
generality by showing a 19% and 31% improvement over the previous state of the
art on a music skill, aggregate functions, and access control.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2019 21:33:15 GMT'}]",2019-04-22,"[['Campagna', 'Giovanni', ''], ['Xu', 'Silei', ''], ['Moradshahi', 'Mehrad', ''], ['Socher', 'Richard', ''], ['Lam', 'Monica S.', '']]","['virtual assistants', 'semantic parsing', 'trainingdata generation', 'data augmentation', 'data engineering']"
6369,2001.07434,Monika Grewal,"Monika Grewal, Timo M. Deist, Jan Wiersma, Peter A. N. Bosman, Tanja
  Alderliesten","An End-to-end Deep Learning Approach for Landmark Detection and Matching
  in Medical Images",SPIE Medical Imaging Conference - 2020,,10.1117/12.2549302,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Anatomical landmark correspondences in medical images can provide additional
guidance information for the alignment of two images, which, in turn, is
crucial for many medical applications. However, manual landmark annotation is
labor-intensive. Therefore, we propose an end-to-end deep learning approach to
automatically detect landmark correspondences in pairs of two-dimensional (2D)
images. Our approach consists of a Siamese neural network, which is trained to
identify salient locations in images as landmarks and predict matching
probabilities for landmark pairs from two different images. We trained our
approach on 2D transverse slices from 168 lower abdominal Computed Tomography
(CT) scans. We tested the approach on 22,206 pairs of 2D slices with varying
levels of intensity, affine, and elastic transformations. The proposed approach
finds an average of 639, 466, and 370 landmark matches per image pair for
intensity, affine, and elastic transformations, respectively, with spatial
matching errors of at most 1 mm. Further, more than 99% of the landmark pairs
are within a spatial matching error of 2 mm, 4 mm, and 8 mm for image pairs
with intensity, affine, and elastic transformations, respectively. To
investigate the utility of our developed approach in a clinical setting, we
also tested our approach on pairs of transverse slices selected from follow-up
CT scans of three patients. Visual inspection of the results revealed landmark
matches in both bony anatomical regions as well as in soft tissues lacking
prominent intensity gradients.
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2020 10:35:48 GMT'}]",2020-04-09,"[['Grewal', 'Monika', ''], ['Deist', 'Timo M.', ''], ['Wiersma', 'Jan', ''], ['Bosman', 'Peter A. N.', ''], ['Alderliesten', 'Tanja', '']]","['end-to-end', 'landmark detection', 'CT', 'deep learning', 'deformable image registration']"
6370,2012.00552,Cristina Abad,"Cristina L. Abad, Eduardo Ortiz-Holguin, Edwin F. Boza",Have We Reached Consensus? An Analysis of Distributed Systems Syllabi,"Accepted for publication at ACM SIGCSE Technical Symposium 2021:
  https://sigcse2021.sigcse.org/ Publication DOI (already assigned by ACM):
  10.1145/3408877.3432409 Dataset available at:
  https://zenodo.org/record/4290623#.X8ZaOWjYre8",,10.1145/3408877.3432409,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Correctly applying distributed systems concepts is important for software
that seeks to be scalable, reliable and fast. For this reason, Distributed
Systems is a course included in many Computer Science programs. To both
describe current trends in teaching distributed systems and as a reference for
educators that seek to improve the quality of their syllabi, we present a
review of 51 syllabi of distributed systems courses from top Computer Science
programs around the world. We manually curated the syllabi and extracted data
that allowed us to identify approaches used in teaching this subject, including
choice of topics, book, and paper reading list. We present our results and a
discussion on whether what is being taught matches the guidelines of two
important curriculum initiatives.
","[{'version': 'v1', 'created': 'Tue, 1 Dec 2020 15:00:32 GMT'}]",2020-12-02,"[['Abad', 'Cristina L.', ''], ['Ortiz-Holguin', 'Eduardo', ''], ['Boza', 'Edwin F.', '']]","['distributed systems', 'syllabi', 'course topics', 'curricula']"
6371,2005.12516,Chang-You Tai,"Chang-You Tai, Meng-Ru Wu, Yun-Wei Chu, Shao-Yu Chu, Lun-Wei Ku",MVIN: Learning Multiview Items for Recommendation,,,10.1145/3397271.3401126,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Researchers have begun to utilize heterogeneous knowledge graphs (KGs) as
auxiliary information in recommendation systems to mitigate the cold start and
sparsity issues. However, utilizing a graph neural network (GNN) to capture
information in KG and further apply in RS is still problematic as it is unable
to see each item's properties from multiple perspectives. To address these
issues, we propose the multi-view item network (MVIN), a GNN-based
recommendation model which provides superior recommendations by describing
items from a unique mixed view from user and entity angles. MVIN learns item
representations from both the user view and the entity view. From the user
view, user-oriented modules score and aggregate features to make
recommendations from a personalized perspective constructed according to KG
entities which incorporates user click information. From the entity view, the
mixing layer contrasts layer-wise GCN information to further obtain
comprehensive features from internal entity-entity interactions in the KG. We
evaluate MVIN on three real-world datasets: MovieLens-1M (ML-1M), LFM-1b 2015
(LFM-1b), and Amazon-Book (AZ-book). Results show that MVIN significantly
outperforms state-of-the-art methods on these three datasets. In addition, from
user-view cases, we find that MVIN indeed captures entities that attract users.
Figures further illustrate that mixing layers in a heterogeneous KG plays a
vital role in neighborhood information aggregation.
","[{'version': 'v1', 'created': 'Tue, 26 May 2020 05:19:27 GMT'}]",2020-05-27,"[['Tai', 'Chang-You', ''], ['Wu', 'Meng-Ru', ''], ['Chu', 'Yun-Wei', ''], ['Chu', 'Shao-Yu', ''], ['Ku', 'Lun-Wei', '']]","['Recommendation', 'Graph Neural Network', 'Higher-order Connectivity', 'Embedding Propagation', 'Knowledge Graph']"
6372,2108.10663,Hala Hamdoun,"Hala Hamdoun, Alaa Sagheer and Hassan Youness","Energy time series forecasting-Analytical and empirical assessment of
  conventional and machine learning models",,"Journal of Intelligent & Fuzzy Systems, 40(6), 12477- 12502, 2021",10.3233/JIFS-201717,,cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Machine learning methods have been adopted in the literature as contenders to
conventional methods to solve the energy time series forecasting (TSF)
problems. Recently, deep learning methods have been emerged in the artificial
intelligence field attaining astonishing performance in a wide range of
applications. Yet, the evidence about their performance in to solve the energy
TSF problems, in terms of accuracy and computational requirements, is scanty.
Most of the review articles that handle the energy TSF problem are systematic
reviews, however, a qualitative and quantitative study for the energy TSF
problem is not yet available in the literature. The purpose of this paper is
twofold, first it provides a comprehensive analytical assessment for
conventional,machine learning, and deep learning methods that can be utilized
to solve various energy TSF problems. Second, the paper carries out an
empirical assessment for many selected methods through three real-world
datasets. These datasets related to electrical energy consumption problem,
natural gas problem, and electric power consumption of an individual household
problem.The first two problems are univariate TSF and the third problem is a
multivariate TSF. Com-pared to both conventional and machine learning
contenders, the deep learning methods attain a significant improvement in terms
of accuracy and forecasting horizons examined. In the mean-time, their
computational requirements are notably greater than other contenders.
Eventually,the paper identifies a number of challenges, potential research
directions, and recommendations to the research community may serve as a basis
for further research in the energy forecasting domain.
","[{'version': 'v1', 'created': 'Tue, 24 Aug 2021 12:02:26 GMT'}]",2021-08-25,"[['Hamdoun', 'Hala', ''], ['Sagheer', 'Alaa', ''], ['Youness', 'Hassan', '']]","['Energy time series forecasting', 'Conventional forecasting methods', 'Machine learning', 'Deeplearning', 'Energy management systems']"
6373,2104.08579,Robbe Cools,"Robbe Cools, Jihae Han, Adalberto L. Simeone","SelectVisAR: Selective Visualisation of Virtual Environments in
  Augmented Reality",,,10.1145/3461778.3462096,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  When establishing a visual connection between a virtual reality user and an
augmented reality user, it is important to consider whether the augmented
reality user faces a surplus of information. Augmented reality, compared to
virtual reality, involves two, not one, planes of information: the physical and
the virtual. We propose SelectVisAR, a selective visualisation system of
virtual environments in augmented reality. Our system enables an augmented
reality spectator to perceive a co-located virtual reality user in the context
of four distinct visualisation conditions: Interactive, Proximity, Everything,
and Dollhouse. We explore an additional two conditions, Context and Spotlight,
in a follow-up study. Our design uses a human-centric approach to information
filtering, selectively visualising only parts of the virtual environment
related to the interactive possibilities of a virtual reality user. The
research investigates how selective visualisations can be helpful or trivial
for the augmented reality user when observing a virtual reality user.
","[{'version': 'v1', 'created': 'Sat, 17 Apr 2021 15:47:48 GMT'}, {'version': 'v2', 'created': 'Tue, 4 May 2021 17:29:28 GMT'}]",2021-05-05,"[['Cools', 'Robbe', ''], ['Han', 'Jihae', ''], ['Simeone', 'Adalberto L.', '']]","['virtual reality', 'augmented reality', 'cross-reality interaction']"
6374,2202.11086,Zijie Wang,"Zijie J. Wang, Katie Dai, W. Keith Edwards",StickyLand: Breaking the Linear Presentation of Computational Notebooks,"Accepted at CHI 2022 (Late-Breaking Work). 7 pages, 6 figures. For a
  demo video, see https://youtu.be/OKaPmEBzEX0. For a live demo, visit
  https://zijie.wang/#stickyland-demo",,10.1145/3491101.3519653,,cs.HC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  How can we better organize code in computational notebooks? Notebooks have
become a popular tool among data scientists, as they seamlessly weave text and
code together, supporting users to rapidly iterate and document code
experiments. However, it is often challenging to organize code in notebooks,
partially because there is a mismatch between the linear presentation of code
and the non-linear process of exploratory data analysis. We present StickyLand,
a notebook extension for empowering users to freely organize their code in
non-linear ways. With sticky cells that are always shown on the screen, users
can quickly access their notes, instantly observe experiment results, and
easily build interactive dashboards that support complex visual analytics. Case
studies highlight how our tool can enhance notebook users's productivity and
identify opportunities for future notebook designs. StickyLand is available at
https://github.com/xiaohk/stickyland.
","[{'version': 'v1', 'created': 'Tue, 22 Feb 2022 18:25:54 GMT'}]",2022-02-23,"[['Wang', 'Zijie J.', ''], ['Dai', 'Katie', ''], ['Edwards', 'W. Keith', '']]","['Computational Notebooks', 'Exploratory Programming', 'Code Layout']"
6375,1911.06147,Sergio Gast\'on Burdisso,"Sergio G. Burdisso, Marcelo Errecalde, Manuel Montes-y-G\'omez","t-SS3: a text classifier with dynamic n-grams for early risk detection
  over text streams","Highlights: (*) A classifier that is able to dynamically learn and
  recognize important word n-grams. (*) A novel text classifier having the
  ability to visually explain its rationale. (*) Support for incremental
  learning and text classification over streams. (*) Efficient model for
  addressing early risk detection problems","Pattern Recognition Letters, Elsevier, 2020",10.1016/j.patrec.2020.07.001,,cs.CL cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A recently introduced classifier, called SS3, has shown to be well suited to
deal with early risk detection (ERD) problems on text streams. It obtained
state-of-the-art performance on early depression and anorexia detection on
Reddit in the CLEF's eRisk open tasks. SS3 was created to deal with ERD
problems naturally since: it supports incremental training and classification
over text streams, and it can visually explain its rationale. However, SS3
processes the input using a bag-of-word model lacking the ability to recognize
important word sequences. This aspect could negatively affect the
classification performance and also reduces the descriptiveness of visual
explanations. In the standard document classification field, it is very common
to use word n-grams to try to overcome some of these limitations.
Unfortunately, when working with text streams, using n-grams is not trivial
since the system must learn and recognize which n-grams are important ""on the
fly"". This paper introduces t-SS3, an extension of SS3 that allows it to
recognize useful patterns over text streams dynamically. We evaluated our model
in the eRisk 2017 and 2018 tasks on early depression and anorexia detection.
Experimental results suggest that t-SS3 is able to improve both current results
and the richness of visual explanations.
","[{'version': 'v1', 'created': 'Mon, 11 Nov 2019 22:06:40 GMT'}, {'version': 'v2', 'created': 'Wed, 6 May 2020 23:04:03 GMT'}]",2020-07-14,"[['Burdisso', 'Sergio G.', ''], ['Errecalde', 'Marcelo', ''], ['Montes-y-Gómez', 'Manuel', '']]","['Early Text Classification', 'Dynamic Word N-Grams', 'Incremental Classification', 'SS3', 'Explainability', 'Trie', 'Digital Tree']"
6376,2103.11738,Hippolyte Verdier,"Hippolyte Verdier (UP), Maxime Duval, Fran\c{c}ois Laurent, Alhassan
  Cass\'e, Christian Vestergaard, Jean-Baptiste Masson","Learning physical properties of anomalous random walks using graph
  neural networks",,,10.1088/1751-8121/abfa45,,cs.LG physics.bio-ph physics.data-an q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Single particle tracking allows probing how biomolecules interact physically
with their natural environments. A fundamental challenge when analysing
recorded single particle trajectories is the inverse problem of inferring the
physical model or class of models of the underlying random walks. Reliable
inference is made difficult by the inherent stochastic nature of single
particle motion, by experimental noise, and by the short duration of most
experimental trajectories. Model identification is further complicated by the
fact that main physical properties of random walk models are only defined
asymptotically, and are thus degenerate for short trajectories. Here, we
introduce a new, fast approach to inferring random walk properties based on
graph neural networks (GNNs). Our approach consists in associating a vector of
features with each observed position, and a sparse graph structure with each
observed trajectory. By performing simulation-based supervised learning on this
construct [1], we show that we can reliably learn models of random walks and
their anomalous exponents. The method can naturally be applied to trajectories
of any length. We show its efficiency in analysing various anomalous random
walks of biological relevance that were proposed in the AnDi challenge [2]. We
explore how information is encoded in the GNN, and we show that it learns
relevant physical features of the random walks. We furthermore evaluate its
ability to generalize to types of trajectories not seen during training, and we
show that the GNN retains high accuracy even with few parameters. We finally
discuss the possibility to leverage these networks to analyse experimental
data.
","[{'version': 'v1', 'created': 'Mon, 22 Mar 2021 11:32:10 GMT'}]",2021-07-07,"[['Verdier', 'Hippolyte', '', 'UP'], ['Duval', 'Maxime', ''], ['Laurent', 'François', ''], ['Cassé', 'Alhassan', ''], ['Vestergaard', 'Christian', ''], ['Masson', 'Jean-Baptiste', '']]","['inverse problems', 'graphical models', 'random walks', 'amortised inference', 'single particle tracking', 'deep learning', 'graph neural networks']"
6377,2201.12585,Meng Ai,"Meng Ai, Biao Li, Heyang Gong, Qingwei Yu, Shengjie Xue, Yuan Zhang,
  Yunzhou Zhang, Peng Jiang",LBCF: A Large-Scale Budget-Constrained Causal Forest Algorithm,Published in Web Conference 2022 (WWW'2022),,10.1145/3485447.3512103,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Offering incentives (e.g., coupons at Amazon, discounts at Uber and video
bonuses at Tiktok) to user is a common strategy used by online platforms to
increase user engagement and platform revenue. Despite its proven
effectiveness, these marketing incentives incur an inevitable cost and might
result in a low ROI (Return on Investment) if not used properly. On the other
hand, different users respond differently to these incentives, for instance,
some users never buy certain products without coupons, while others do anyway.
Thus, how to select the right amount of incentives (i.e. treatment) to each
user under budget constraints is an important research problem with great
practical implications. In this paper, we call such problem as a
budget-constrained treatment selection (BTS) problem.
  The challenge is how to efficiently solve BTS problem on a Large-Scale
dataset and achieve improved results over the existing techniques. We propose a
novel tree-based treatment selection technique under budget constraints, called
Large-Scale Budget-Constrained Causal Forest (LBCF) algorithm, which is also an
efficient treatment selection algorithm suitable for modern distributed
computing systems. A novel offline evaluation method is also proposed to
overcome an intrinsic challenge in assessing solutions' performance for BTS
problem in randomized control trials (RCT) data. We deploy our approach in a
real-world scenario on a large-scale video platform, where the platform gives
away bonuses in order to increase users' campaign engagement duration. The
simulation analysis, offline and online experiments all show that our method
outperforms various tree-based state-of-the-art baselines. The proposed
approach is currently serving over hundreds of millions of users on the
platform and achieves one of the most tremendous improvements over these
months.
","[{'version': 'v1', 'created': 'Sat, 29 Jan 2022 13:21:07 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Feb 2022 12:37:07 GMT'}]",2022-02-21,"[['Ai', 'Meng', ''], ['Li', 'Biao', ''], ['Gong', 'Heyang', ''], ['Yu', 'Qingwei', ''], ['Xue', 'Shengjie', ''], ['Zhang', 'Yuan', ''], ['Zhang', 'Yunzhou', ''], ['Jiang', 'Peng', '']]","['Personalization', 'Heterogeneous causal effects', 'Constraint optimization', 'Treatment Selection', 'Distributed Computing']"
6378,1906.11649,Frederic Blanqui,"Fr\'ed\'eric Blanqui (DEDUCTEAM, LSV, ENS Paris Saclay), Guillaume
  Genestier (DEDUCTEAM, LSV, ENS Paris Saclay, CRI), Olivier Hermant (CRI)",Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting,"FSCD 2019 - 4th International Conference on Formal Structures for
  Computation and Deduction, Jun 2019, Dortmund, Germany",,10.4230/LIPIcs.FSCD.2019.9,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dependency pairs are a key concept at the core of modern automated
termination provers for first-order term rewriting systems. In this paper, we
introduce an extension of this technique for a large class of dependently-typed
higher-order rewriting systems. This extends previous resultsby Wahlstedt on
the one hand and the first author on the other hand to strong normalization and
non-orthogonal rewriting systems. This new criterion is implemented in the
type-checker Dedukti.
","[{'version': 'v1', 'created': 'Thu, 27 Jun 2019 13:48:50 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Oct 2019 12:02:11 GMT'}]",2020-07-16,"[['Blanqui', 'Frédéric', '', 'DEDUCTEAM, LSV, ENS Paris Saclay'], ['Genestier', 'Guillaume', '', 'DEDUCTEAM, LSV, ENS Paris Saclay, CRI'], ['Hermant', 'Olivier', '', 'CRI']]","['Termination', 'Higher-Order Rewriting', 'Dependent Types', 'Dependency Pairs']"
6379,1807.09320,Antoine Amarilli,"Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth",Constant-Delay Enumeration for Nondeterministic Document Spanners,"25 pages including 17 pages of main material. Integrates all reviewer
  feedback. T paper is exactly the same as the ICDT'19 paper except that it
  contains 6 pages of technical appendix, and except that we corrected some
  additional minor mistakes following reviews of the journal version
  (arXiv:2003.02576). We recommend reading the journal version instead of this
  paper",,10.4230/LIPIcs.ICDT.2019.19,,cs.DB cs.IR,http://creativecommons.org/licenses/by/4.0/,"  We consider the information extraction framework known as document spanners,
and study the problem of efficiently computing the results of the extraction
from an input document, where the extraction task is described as a sequential
variable-set automaton (VA). We pose this problem in the setting of enumeration
algorithms, where we can first run a preprocessing phase and must then produce
the results with a small delay between any two consecutive results. Our goal is
to have an algorithm which is tractable in combined complexity, i.e., in the
sizes of the input document and the VA; while ensuring the best possible data
complexity bounds in the input document size, i.e., constant delay in the
document size. Several recent works at PODS'18 proposed such algorithms but
with linear delay in the document size or with an exponential dependency in
size of the (generally nondeterministic) input VA. In particular, Florenzano et
al. suggest that our desired runtime guarantees cannot be met for general
sequential VAs. We refute this and show that, given a nondeterministic
sequential VA and an input document, we can enumerate the mappings of the VA on
the document with the following bounds: the preprocessing is linear in the
document size and polynomial in the size of the VA, and the delay is
independent of the document and polynomial in the size of the VA. The resulting
algorithm thus achieves tractability in combined complexity and the best
possible data complexity bounds. Moreover, it is rather easy to describe, in
particular for the restricted case of so-called extended VAs.
","[{'version': 'v1', 'created': 'Tue, 24 Jul 2018 19:49:14 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Sep 2018 13:23:00 GMT'}, {'version': 'v3', 'created': 'Sat, 2 Mar 2019 14:53:12 GMT'}, {'version': 'v4', 'created': 'Fri, 25 Sep 2020 07:54:45 GMT'}, {'version': 'v5', 'created': 'Mon, 7 Dec 2020 13:43:35 GMT'}]",2020-12-08,"[['Amarilli', 'Antoine', ''], ['Bourhis', 'Pierre', ''], ['Mengel', 'Stefan', ''], ['Niewerth', 'Matthias', '']]","['Enumeration', 'Spanners', 'Automata']"
6380,2001.03002,Jawad Ali,"Jawad Ali, Toqeer Ali, Yazed Alsaawy, Ahmad Shahrafidz Khalid,
  Shahrulniza Musa",Blockchain-based Smart-IoT Trust Zone Measurement Architecture,"6 pages, 5 Figures, International Conference on Omni-Layer
  Intelligent Systems, COINS May 2019. arXiv admin note: substantial text
  overlap with arXiv:2001.01841","International Conference on Omni-Layer Intelligent Systems, COINS
  May 2019, Pages 152-157",10.1145/3312614.3312646,,cs.CR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  With a rapid growth in the IT industry, Internet of Things (IoT) has gained a
tremendous attention and become a central aspect of our environment. In IoT the
things (devices) communicate and exchange the data without the act of human
intervention. Such autonomy and proliferation of IoT ecosystem make the devices
more vulnerable to attacks. In this paper, we propose a behavior monitor in
IoT-Blockchain setup which can provide trust-confidence to outside networks.
Behavior monitor extracts the activity of each device and analyzes the behavior
using deep auto-encoders. In addition, we also incorporate Trusted Execution
Technology (Intel SGX) in order to provide a secure execution environment for
applications and data on blockchain. Finally, in evaluation we analyze three
IoT devices data that is infected by mirai attack. The evaluation results
demonstrate the ability of our proposed method in terms of accuracy and time
required for detection.
","[{'version': 'v1', 'created': 'Wed, 8 Jan 2020 03:41:27 GMT'}]",2020-01-10,"[['Ali', 'Jawad', ''], ['Ali', 'Toqeer', ''], ['Alsaawy', 'Yazed', ''], ['Khalid', 'Ahmad Shahrafidz', ''], ['Musa', 'Shahrulniza', '']]","['Blockchain', 'IoT', 'Security', 'Trust', 'Behavior', 'Deep Learning']"
6381,2012.02239,Alexander Maletzky,Alexander Maletzky,"A Generic and Executable Formalization of Signature-Based Gr\""obner
  Basis Algorithms",,"Journal of Symbolic Computation 106: 23-47, 2021",10.1016/j.jsc.2020.12.001,,cs.SC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We present a generic and executable formalization of signature-based
algorithms (such as Faug\`ere's $F_5$) for computing Gr\""obner bases, as well
as their mathematical background, in the Isabelle/HOL proof assistant. Said
algorithms are currently the best known algorithms for computing Gr\""obner
bases in terms of computational efficiency. The formal development attempts to
be as generic as possible, generalizing most known variants of signature-based
algorithms, but at the same time the implemented functions are effectively
executable on concrete input for efficiently computing mechanically verified
Gr\""obner bases. Besides correctness the formalization also proves that under
certain conditions the algorithms a-priori detect and avoid all useless
reductions to zero, and return minimal signature Gr\""obner bases.
  To the best of our knowledge, the formalization presented here is the only
formalization of signature-based Gr\""obner basis algorithms in existence so
far.
","[{'version': 'v1', 'created': 'Thu, 3 Dec 2020 20:11:55 GMT'}]",2020-12-15,"[['Maletzky', 'Alexander', '']]","['Gröbner bases', 'signature-based algorithms', 'interactive theorem proving', 'Isabelle/HOL']"
6382,1307.0118,Yanshu Zhu,"Yanshu Zhu, Feng Sun, Yi-King Choi, Bert J\""uttler, Wenping Wang","Computing a Compact Spline Representation of the Medial Axis Transform
  of a 2D Shape",GMP14 (Geometric Modeling and Processing),,10.1016/j.gmod.2014.03.007,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a full pipeline for computing the medial axis transform of an
arbitrary 2D shape. The instability of the medial axis transform is overcome by
a pruning algorithm guided by a user-defined Hausdorff distance threshold. The
stable medial axis transform is then approximated by spline curves in 3D to
produce a smooth and compact representation. These spline curves are computed
by minimizing the approximation error between the input shape and the shape
represented by the medial axis transform. Our results on various 2D shapes
suggest that our method is practical and effective, and yields faithful and
compact representations of medial axis transforms of 2D shapes.
","[{'version': 'v1', 'created': 'Sat, 29 Jun 2013 15:32:23 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Dec 2013 11:44:55 GMT'}, {'version': 'v3', 'created': 'Sat, 10 May 2014 19:56:31 GMT'}]",2014-05-13,"[['Zhu', 'Yanshu', ''], ['Sun', 'Feng', ''], ['Choi', 'Yi-King', ''], ['Jüttler', 'Bert', ''], ['Wang', 'Wenping', '']]","['shape modeling', 'medial axis transform', 'spline', 'curve fitting']"
6383,2008.08692,Yingtong Dou,"Yingtong Dou, Zhiwei Liu, Li Sun, Yutong Deng, Hao Peng, Philip S. Yu","Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged
  Fraudsters",Accepted by CIKM 2020,,10.1145/3340531.3411903,,cs.SI cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph Neural Networks (GNNs) have been widely applied to fraud detection
problems in recent years, revealing the suspiciousness of nodes by aggregating
their neighborhood information via different relations. However, few prior
works have noticed the camouflage behavior of fraudsters, which could hamper
the performance of GNN-based fraud detectors during the aggregation process. In
this paper, we introduce two types of camouflages based on recent empirical
studies, i.e., the feature camouflage and the relation camouflage. Existing
GNNs have not addressed these two camouflages, which results in their poor
performance in fraud detection problems. Alternatively, we propose a new model
named CAmouflage-REsistant GNN (CARE-GNN), to enhance the GNN aggregation
process with three unique modules against camouflages. Concretely, we first
devise a label-aware similarity measure to find informative neighboring nodes.
Then, we leverage reinforcement learning (RL) to find the optimal amounts of
neighbors to be selected. Finally, the selected neighbors across different
relations are aggregated together. Comprehensive experiments on two real-world
fraud datasets demonstrate the effectiveness of the RL algorithm. The proposed
CARE-GNN also outperforms state-of-the-art GNNs and GNN-based fraud detectors.
We integrate all GNN-based fraud detectors as an opensource toolbox:
https://github.com/safe-graph/DGFraud. The CARE-GNN code and datasets are
available at https://github.com/YingtongDou/CARE-GNN.
","[{'version': 'v1', 'created': 'Wed, 19 Aug 2020 22:33:12 GMT'}]",2020-08-21,"[['Dou', 'Yingtong', ''], ['Liu', 'Zhiwei', ''], ['Sun', 'Li', ''], ['Deng', 'Yutong', ''], ['Peng', 'Hao', ''], ['Yu', 'Philip S.', '']]","['Graph Neural Networks', 'Fraud Detection', 'Reinforcement Learning']"
6384,1709.01547,Ivan Yu. Tyukin,"Ivan Y. Tyukin, Alexander N. Gorban, Konstantin Sofeikov, Ilya
  Romanenko",Knowledge Transfer Between Artificial Intelligence Systems,,Front Neurorobot. 2018; 12: 49,10.3389/fnbot.2018.00049,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the fundamental question: how a legacy ""student"" Artificial
Intelligent (AI) system could learn from a legacy ""teacher"" AI system or a
human expert without complete re-training and, most importantly, without
requiring significant computational resources. Here ""learning"" is understood as
an ability of one system to mimic responses of the other and vice-versa. We
call such learning an Artificial Intelligence knowledge transfer. We show that
if internal variables of the ""student"" Artificial Intelligent system have the
structure of an $n$-dimensional topological vector space and $n$ is
sufficiently high then, with probability close to one, the required knowledge
transfer can be implemented by simple cascades of linear functionals. In
particular, for $n$ sufficiently large, with probability close to one, the
""student"" system can successfully and non-iteratively learn $k\ll n$ new
examples from the ""teacher"" (or correct the same number of mistakes) at the
cost of two additional inner products. The concept is illustrated with an
example of knowledge transfer from a pre-trained convolutional neural network
to a simple linear classifier with HOG features.
","[{'version': 'v1', 'created': 'Tue, 5 Sep 2017 18:38:07 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Nov 2017 08:21:13 GMT'}]",2022-05-17,"[['Tyukin', 'Ivan Y.', ''], ['Gorban', 'Alexander N.', ''], ['Sofeikov', 'Konstantin', ''], ['Romanenko', 'Ilya', '']]","['Learning', 'neural networks', 'approximation', 'measure concentration']"
6385,2204.10702,Sylvain Sen\'e,"Eric Goles, Fabiola Lobos, Gonzalo A. Ruz and Sylvain Sen\'e",Attractor landscapes in Boolean networks with firing memory,,"Natural Computing, vol. 19, pp 295-319, 2020",10.1007/s11047-020-09789-0,,cs.DM,http://creativecommons.org/licenses/by/4.0/,"  In this paper we study the dynamical behavior of Boolean networks with firing
memory, namely Boolean networks whose vertices are updated synchronously
depending on their proper Boolean local transition functions so that each
vertex remains at its firing state a finite number of steps. We prove in
particular that these networks have the same computational power than the
classical ones, ie any Boolean network with firing memory composed of $m$
vertices can be simulated by a Boolean network by adding vertices. We also
prove general results on specific classes of networks. For instance, we show
that the existence of at least one delay greater than 1 in disjunctive networks
makes such networks have only fixed points as attractors. Moreover, for
arbitrary networks composed of two vertices, we characterize the delay phase
space, \ie the delay values such that networks admits limit cycles or fixed
points. Finally, we analyze two classical biological models by introducing
delays: the model of the immune control of the $\lambda$-phage and that of the
genetic control of the floral morphogenesis of the plant \emph{Arabidopsis
thaliana}.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2022 13:43:04 GMT'}]",2022-04-25,"[['Goles', 'Eric', ''], ['Lobos', 'Fabiola', ''], ['Ruz', 'Gonzalo A.', ''], ['Sené', 'Sylvain', '']]","['Discrete dynamical systems', 'Boolean networks', 'Biological network modeling']"
6386,2208.10072,Asrar Ahmed Baktayan Ms,"Asrar Ahmed Baktayan, Ibrahim Ahmed Al-Baltah","A Survey on Intelligent Computation Offloading and Pricing Strategy in
  UAV-Enabled MEC Network: Challenges and Research Directions",,"Sustainable Engineering and Innovation 2022 vol 4, 2",10.37868/sei.v4i2.id179,,cs.NI cs.DC,http://creativecommons.org/licenses/by/4.0/,"  The Mobile Network Operator (MNO) must select how to delegate Mobile Device
(MD) queries to its Mobile Edge Computing (MEC) server in order to maximize the
overall benefit of admitted requests with varying latency needs. Unmanned
Aerial Vehicles (UAVs) and Artificial Intelligent (AI) can increase MNO
performance because of their flexibility in deployment, high mobility of UAV,
and efficiency of AI algorithms. There is a trade-off between the cost incurred
by the MD and the profit received by the MNO. Intelligent computing offloading
to UAV-enabled MEC, on the other hand, is a promising way to bridge the gap
between MDs' limited processing resources, as well as the intelligent
algorithms that are utilized for computation offloading in the UAV-MEC network
and the high computing demands of upcoming applications. This study looks at
some of the research on the benefits of computation offloading process in the
UAV-MEC network, as well as the intelligent models that are utilized for
computation offloading. In addition, this article examines several intelligent
pricing techniques in different structures in the UAV-MEC network. Finally,
this work highlights some important open research issues and future research
directions of Artificial Intelligent (AI) in computation offloading and
applying intelligent pricing strategies in the UAV-MEC network.
","[{'version': 'v1', 'created': 'Mon, 22 Aug 2022 06:14:20 GMT'}]",2022-12-20,"[['Baktayan', 'Asrar Ahmed', ''], ['Al-Baltah', 'Ibrahim Ahmed', '']]","['Intelligent Computation Offloading', 'Intelligent Pricing Strategies', 'Unmanned Aerial Vehicles (UAVs)', 'Intelligent Decision Making']"
6387,1601.04245,Rim Hendel,"Rim Hendel, Farid Khaber, Najib Essounbouli","Adaptive type-2 fuzzy second order sliding mode control for nonlinear
  uncertain chaotic system","14 pages, 13 figures, International Journal of Computational Science,
  Information Technology and Control Engineering (IJCSITCE) Vol.2, No.4,
  October 2015",,10.5121/ijcsitce.2015.2401,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a robust adaptive type-2 fuzzy higher order sliding mode
controller is designed to stabilize the unstable periodic orbits of uncertain
perturbed chaotic system with internal parameter uncertainties and external
disturbances. In Higher Order Sliding Mode Control (HOSMC),the chattering
phenomena of the control effort is reduced, by using Super Twisting algorithm.
Adaptive interval type-2 fuzzy systems are proposed to approximate the unknown
part of uncertain chaotic system and to generate the Super Twisting signals.
Based on Lyapunov criterion, adaptation laws are derived and the closed loop
system stability is guaranteed. An illustrative example is given to demonstrate
the effectiveness of the proposed controller.
","[{'version': 'v1', 'created': 'Sat, 7 Nov 2015 16:09:32 GMT'}]",2016-01-19,"[['Hendel', 'Rim', ''], ['Khaber', 'Farid', ''], ['Essounbouli', 'Najib', '']]","['Chaotic System', 'Type-2 Fuzzy Logic System', 'second order Sliding Mode Control', 'Lyapunov Stability']"
6388,1401.6370,Haipeng Zhang Ph.D.,"Haipeng Zhang, Lingjun Kong, Xiuju Huang, Mengmeng Cao","Design of a High Speed XAUI Based on Dynamic Reconfigurable Transceiver
  IP Core","10 pages, 5 figures, 5 tables, 14 references","International Journal of Soft Computing And Software Engineering
  (JSCSE) Vol.2,No.9, 2012 Published online: Sep 25, 2012",10.7321/jscse.v2.n9.4,,cs.AR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  By using the dynamic reconfigurable transceiver in high speed interface
design, designer can solve critical technology problems such as ensuring signal
integrity conveniently, with lower error binary rate. In this paper, we
designed a high speed XAUI (10Gbps Ethernet Attachment Unit Interface) to
transparently extend the physical reach of the XGMII. The following points are
focused: (1) IP (Intellectual Property) core usage. Altera Co. offers two
transceiver IP cores in Quartus II MegaWizard Plug-In Manager for XAUI design
which is featured of dynamic reconfiguration performance, that is,
ALTGX_RECO?FIG instance and ALTGX instance, we can get various groups by
changing settings of the devices without power off. These two blocks can
accomplish function of PCS (Physical Coding Sub-layer) and PMA (Physical Medium
Attachment), however, with higher efficiency and reliability. (2) 1+1
protection. In our design, two ALTGX IP cores are used to work in parallel,
which named XAUI0 and XAUI1. The former works as the main channel while the
latter redundant channel. When XAUI0 is out of service for some reasons, XAUI1
will start to work to keep the business. (3) RTL (Register Transfer Level)
coding with Verilog HDL and simulation. Create the ALTGX_RECO?FIG instance and
ALTGX instance, enable dynamic reconfiguration in the ALTGXB Megafunction, then
connect the ALTGX_RECO?FIG with the ALTGX instances. After RTL coding, the
design was simulated on VCS simulator. The validated result indicates that the
packets are transferred efficiently. FPGA makes high-speed optical
communication system design simplified.
","[{'version': 'v1', 'created': 'Fri, 24 Jan 2014 15:14:52 GMT'}]",2014-01-27,"[['Zhang', 'Haipeng', ''], ['Kong', 'Lingjun', ''], ['Huang', 'Xiuju', ''], ['Cao', 'Mengmeng', '']]","['High speed XAUI', 'Dynamic reconfigurable transceiver', 'EBR', 'FPGA']"
6389,2104.02423,Andrew Jeffery,"Andrew Jeffery, Heidi Howard, Richard Mortier",Rearchitecting Kubernetes for the Edge,6 pages. Accepted in EdgeSys '21,"Proceedings of the 4th International Workshop on Edge Systems,
  Analytics and Networking (2021) 7-12",10.1145/3434770.3459730,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Recent years have seen Kubernetes emerge as a primary choice for container
orchestration. Kubernetes largely targets the cloud environment but new use
cases require performant, available and scalable orchestration at the edge.
Kubernetes stores all cluster state in etcd, a strongly consistent key-value
store. We find that at larger etcd cluster sizes, offering higher availability,
write request latency significantly increases and throughput decreases
similarly. Coupled with approximately 30% of Kubernetes requests being writes,
this directly impacts the request latency and availability of Kubernetes,
reducing its suitability for the edge. We revisit the requirement of strong
consistency and propose an eventually consistent approach instead. This enables
higher performance, availability and scalability whilst still supporting the
broad needs of Kubernetes. This aims to make Kubernetes much more suitable for
performance-critical, dynamically-scaled edge solutions.
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2021 10:56:42 GMT'}]",2021-04-27,"[['Jeffery', 'Andrew', ''], ['Howard', 'Heidi', ''], ['Mortier', 'Richard', '']]","['edge', 'orchestration', 'Kubernetes', 'eventual consistency', 'CRDTs']"
6390,1905.06113,Andrey Rudenko,"Andrey Rudenko, Luigi Palmieri, Michael Herman, Kris M. Kitani, Dariu
  M. Gavrila and Kai O. Arras",Human Motion Trajectory Prediction: A Survey,"Submitted to the International Journal of Robotics Research (IJRR),
  37 pages",,10.1177/0278364920917446,,cs.RO cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With growing numbers of intelligent autonomous systems in human environments,
the ability of such systems to perceive, understand and anticipate human
behavior becomes increasingly important. Specifically, predicting future
positions of dynamic agents and planning considering such predictions are key
tasks for self-driving vehicles, service robots and advanced surveillance
systems. This paper provides a survey of human motion trajectory prediction. We
review, analyze and structure a large selection of work from different
communities and propose a taxonomy that categorizes existing methods based on
the motion modeling approach and level of contextual information used. We
provide an overview of the existing datasets and performance metrics. We
discuss limitations of the state of the art and outline directions for further
research.
","[{'version': 'v1', 'created': 'Wed, 15 May 2019 12:09:55 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Jun 2019 11:09:46 GMT'}, {'version': 'v3', 'created': 'Tue, 17 Dec 2019 09:27:25 GMT'}]",2020-07-27,"[['Rudenko', 'Andrey', ''], ['Palmieri', 'Luigi', ''], ['Herman', 'Michael', ''], ['Kitani', 'Kris M.', ''], ['Gavrila', 'Dariu M.', ''], ['Arras', 'Kai O.', '']]","['Survey', 'review', 'motion prediction', 'robotics', 'video surveillance', 'autonomous driving']"
6391,2107.08567,Spyridon Ampanavos,"Spyridon Ampanavos, Mehdi Nourbakhsh, Chin-Yi Cheng","Structural Design Recommendations in the Early Design Phase using
  Machine Learning",CAAD Futures 2021,,10.1007/978-981-19-1280-1_12,,cs.LG cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Structural engineering knowledge can be of significant importance to the
architectural design team during the early design phase. However, architects
and engineers do not typically work together during the conceptual phase; in
fact, structural engineers are often called late into the process. As a result,
updates in the design are more difficult and time-consuming to complete. At the
same time, there is a lost opportunity for better design exploration guided by
structural feedback. In general, the earlier in the design process the
iteration happens, the greater the benefits in cost efficiency and informed
de-sign exploration, which can lead to higher-quality creative results. In
order to facilitate an informed exploration in the early design stage, we
suggest the automation of fundamental structural engineering tasks and
introduce ApproxiFramer, a Machine Learning-based system for the automatic
generation of structural layouts from building plan sketches in real-time. The
system aims to assist architects by presenting them with feasible structural
solutions during the conceptual phase so that they proceed with their design
with adequate knowledge of its structural implications. In this paper, we
describe the system and evaluate the performance of a proof-of-concept
implementation in the domain of orthogonal, metal, rigid structures. We trained
a Convolutional Neural Net to iteratively generate structural design solutions
for sketch-level building plans using a synthetic dataset and achieved an
average error of 2.2% in the predicted positions of the columns.
","[{'version': 'v1', 'created': 'Mon, 19 Jul 2021 01:02:14 GMT'}]",2022-04-19,"[['Ampanavos', 'Spyridon', ''], ['Nourbakhsh', 'Mehdi', ''], ['Cheng', 'Chin-Yi', '']]","['Machine learning', 'Structure Approximation', 'Convolutional Neural Net', 'Design Assistance']"
6392,2211.04989,Jordan Aiko Deja Mr,Jordan Aiko Deja,"Piano Learning and Improvisation through Adaptive Visualisation and
  Digital Augmentation","8 pages, 1 figure, doctoral symposium paper",,10.1145/3532104.3571464,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The task of learning the piano has been a centuries-old challenge for
novices, experts and technologists. Several innovations have been introduced to
support proper posture, movement, and motivation, while sight-reading and
improvisation remain the least-explored areas. In this PhD, we address this gap
by redesigning the piano augmentation as an interactive and adaptive space.
Specifically, we will explore how to support learners with adaptive
visualisations through a two-pronged approach: (1) by designing adaptive
visualisations based on the proficiency of the learner to support regular piano
playing and (2) by assisting them with expert annotations projected on the
piano to encourage improvisation. To this end, we will build a model to
understand the complexities of learners' spatiotemporal data and use these to
support learning. We will then evaluate our approach through user studies
enabling practice and improvisation. Our work contributes to how adaptive
visualisations can push music instrument learning and support multi-target
selection tasks in immersive spaces.
","[{'version': 'v1', 'created': 'Wed, 9 Nov 2022 16:04:55 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Nov 2022 13:32:56 GMT'}]",2022-11-14,"[['Deja', 'Jordan Aiko', '']]","['augmented piano', 'music learning', 'improvisation', 'piano']"
6393,2211.14729,Gang Chen,"Gang Chen, Jiawei Chen, Fuli Feng, Sheng Zhou, Xiangnan He",Unbiased Knowledge Distillation for Recommendation,,,10.1145/3539597.3570477,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As a promising solution for model compression, knowledge distillation (KD)
has been applied in recommender systems (RS) to reduce inference latency.
Traditional solutions first train a full teacher model from the training data,
and then transfer its knowledge (\ie \textit{soft labels}) to supervise the
learning of a compact student model. However, we find such a standard
distillation paradigm would incur serious bias issue -- popular items are more
heavily recommended after the distillation. This effect prevents the student
model from making accurate and fair recommendations, decreasing the
effectiveness of RS.
  In this work, we identify the origin of the bias in KD -- it roots in the
biased soft labels from the teacher, and is further propagated and intensified
during the distillation. To rectify this, we propose a new KD method with a
stratified distillation strategy. It first partitions items into multiple
groups according to their popularity, and then extracts the ranking knowledge
within each group to supervise the learning of the student. Our method is
simple and teacher-agnostic -- it works on distillation stage without affecting
the training of the teacher model. We conduct extensive theoretical and
empirical studies to validate the effectiveness of our proposal. We release our
code at: https://github.com/chengang95/UnKD.
","[{'version': 'v1', 'created': 'Sun, 27 Nov 2022 05:14:03 GMT'}]",2022-11-29,"[['Chen', 'Gang', ''], ['Chen', 'Jiawei', ''], ['Feng', 'Fuli', ''], ['Zhou', 'Sheng', ''], ['He', 'Xiangnan', '']]","['Recommendation', 'Knowledge Distillation', 'Bias and Debias']"
6394,2012.10091,Marcello Meldi,"Gabriel Moldovan, Guillame Lehnasch, Laurent Cordier and Marcello
  Meldi","A multigrid/ensemble Kalman Filter strategy for assimilation of unsteady
  flows",,,10.1016/j.jcp.2021.110481,,cs.CE physics.flu-dyn,http://creativecommons.org/licenses/by/4.0/,"  A sequential estimator based on the Ensemble Kalman Filter for Data
Assimilation of fluid flows is presented in this research work. The main
feature of this estimator is that the Kalman filter update, which relies on the
determination of the Kalman gain, is performed exploiting the algorithmic
features of the numerical solver employed as a model. More precisely, the
multilevel resolution associated with the multigrid iterative approach for time
advancement is used to generate several low-resolution numerical simulations.
These results are used as ensemble members to determine the correction via
Kalman filter, which is then projected on the high-resolution grid to correct a
single simulation which corresponds to the numerical model. The assessment of
the method is performed via the analysis of one-dimensional and two-dimensional
test cases, using different dynamic equations. The results show an efficient
trade-off in terms of accuracy and computational costs required. In addition, a
physical regularization of the flow, which is not granted by classical KF
approaches, is naturally obtained owing to the multigrid iterative
calculations. The algorithm is also well suited for the analysis of unsteady
phenomena and, in particular,for potential application to in-streaming Data
Assimilation techniques.
","[{'version': 'v1', 'created': 'Fri, 18 Dec 2020 07:52:53 GMT'}]",2021-07-28,"[['Moldovan', 'Gabriel', ''], ['Lehnasch', 'Guillame', ''], ['Cordier', 'Laurent', ''], ['Meldi', 'Marcello', '']]","['Kalman Filter', 'Data Assimilation', 'compressible flows']"
6395,2007.13689,Barbara Benato,"Barbara Caroline Benato and Jancarlo Ferreira Gomes and Alexandru
  Cristian Telea and Alexandre Xavier Falc\~ao",Semi-Automatic Data Annotation guided by Feature Space Projection,"28 pages, 10 figures",,10.1016/j.patcog.2020.107612,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data annotation using visual inspection (supervision) of each training sample
can be laborious. Interactive solutions alleviate this by helping experts
propagate labels from a few supervised samples to unlabeled ones based solely
on the visual analysis of their feature space projection (with no further
sample supervision). We present a semi-automatic data annotation approach based
on suitable feature space projection and semi-supervised label estimation. We
validate our method on the popular MNIST dataset and on images of human
intestinal parasites with and without fecal impurities, a large and diverse
dataset that makes classification very hard. We evaluate two approaches for
semi-supervised learning from the latent and projection spaces, to choose the
one that best reduces user annotation effort and also increases classification
accuracy on unseen data. Our results demonstrate the added-value of visual
analytics tools that combine complementary abilities of humans and machines for
more effective machine learning.
","[{'version': 'v1', 'created': 'Mon, 27 Jul 2020 17:03:50 GMT'}]",2020-08-25,"[['Benato', 'Barbara Caroline', ''], ['Gomes', 'Jancarlo Ferreira', ''], ['Telea', 'Alexandru Cristian', ''], ['Falcão', 'Alexandre Xavier', '']]","['Semi-Supervised Learning', 'Unsupervised Feature Learning', 'Interactive Data Annotation', 'Autoencoder-Neural Networks', 'DataVisualization']"
6396,1712.02719,Syed Shakib Sarwar,"Syed Shakib Sarwar, Aayush Ankit and Kaushik Roy","Incremental Learning in Deep Convolutional Neural Networks Using Partial
  Network Sharing","18 pages, 13 figures. IEEE Access 2019",,10.1109/ACCESS.2019.2963056,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep convolutional neural network (DCNN) based supervised learning is a
widely practiced approach for large-scale image classification. However,
retraining these large networks to accommodate new, previously unseen data
demands high computational time and energy requirements. Also, previously seen
training samples may not be available at the time of retraining. We propose an
efficient training methodology and incrementally growing DCNN to learn new
tasks while sharing part of the base network. Our proposed methodology is
inspired by transfer learning techniques, although it does not forget
previously learned tasks. An updated network for learning new set of classes is
formed using previously learned convolutional layers (shared from initial part
of base network) with addition of few newly added convolutional kernels
included in the later layers of the network. We employed a `clone-and-branch'
technique which allows the network to learn new tasks one after another without
any performance loss in old tasks. We evaluated the proposed scheme on several
recognition applications. The classification accuracy achieved by our approach
is comparable to the regular incremental learning approach (where networks are
updated with new training samples only, without any network sharing), while
achieving energy efficiency, reduction in storage requirements, memory access
and training time.
","[{'version': 'v1', 'created': 'Thu, 7 Dec 2017 17:05:54 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Sep 2018 18:10:52 GMT'}, {'version': 'v3', 'created': 'Fri, 29 Mar 2019 07:22:16 GMT'}, {'version': 'v4', 'created': 'Thu, 2 May 2019 06:20:19 GMT'}]",2020-03-26,"[['Sarwar', 'Syed Shakib', ''], ['Ankit', 'Aayush', ''], ['Roy', 'Kaushik', '']]","['Incremental learning', 'Catastrophic forgetting', 'Lifelong learning', 'Energy-efficient learning', 'Networksharing']"
6397,2008.05731,Gwenole Quellec,"Gwenol\'e Quellec, Hassan Al Hajj, Mathieu Lamard, Pierre-Henri Conze,
  Pascale Massin, B\'eatrice Cochener","ExplAIn: Explanatory Artificial Intelligence for Diabetic Retinopathy
  Diagnosis",,"Medical Image Analysis, Volume 72, August 2021, 102118",10.1016/j.media.2021.102118,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In recent years, Artificial Intelligence (AI) has proven its relevance for
medical decision support. However, the ""black-box"" nature of successful AI
algorithms still holds back their wide-spread deployment. In this paper, we
describe an eXplanatory Artificial Intelligence (XAI) that reaches the same
level of performance as black-box AI, for the task of classifying Diabetic
Retinopathy (DR) severity using Color Fundus Photography (CFP). This algorithm,
called ExplAIn, learns to segment and categorize lesions in images; the final
image-level classification directly derives from these multivariate lesion
segmentations. The novelty of this explanatory framework is that it is trained
from end to end, with image supervision only, just like black-box AI
algorithms: the concepts of lesions and lesion categories emerge by themselves.
For improved lesion localization, foreground/background separation is trained
through self-supervision, in such a way that occluding foreground pixels
transforms the input image into a healthy-looking image. The advantage of such
an architecture is that automatic diagnoses can be explained simply by an image
and/or a few sentences. ExplAIn is evaluated at the image level and at the
pixel level on various CFP image datasets. We expect this new framework, which
jointly offers high classification performance and explainability, to
facilitate AI deployment.
","[{'version': 'v1', 'created': 'Thu, 13 Aug 2020 07:34:05 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Sep 2020 15:22:55 GMT'}, {'version': 'v3', 'created': 'Thu, 22 Jul 2021 12:16:08 GMT'}]",2021-07-23,"[['Quellec', 'Gwenolé', ''], ['Hajj', 'Hassan Al', ''], ['Lamard', 'Mathieu', ''], ['Conze', 'Pierre-Henri', ''], ['Massin', 'Pascale', ''], ['Cochener', 'Béatrice', '']]","['explanatory artificial intelligence', 'self-supervised learning', 'diabetic retinopathy diagnosis']"
6398,2006.06928,Rima Hazra,"Rima Hazra and Aryan and Hardik Aggarwal and Matteo Marsili and
  Animesh Mukherjee","Characterising authors on the extent of their paper acceptance: A case
  study of the Journal of High Energy Physics",Accepted in JCDL'2020,,10.1145/3383583.3398527,,cs.DL cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  New researchers are usually very curious about the recipe that could
accelerate the chances of their paper getting accepted in a reputed forum
(journal/conference). In search of such a recipe, we investigate the profile
and peer review text of authors whose papers almost always get accepted at a
venue (Journal of High Energy Physics in our current work). We find authors
with high acceptance rate are likely to have a high number of citations, high
$h$-index, higher number of collaborators etc. We notice that they receive
relatively lengthy and positive reviews for their papers. In addition, we also
construct three networks -- co-reviewer, co-citation and collaboration network
and study the network-centric features and intra- and inter-category edge
interactions. We find that the authors with high acceptance rate are more
`central' in these networks; the volume of intra- and inter-category
interactions are also drastically different for the authors with high
acceptance rate compared to the other authors. Finally, using the above set of
features, we train standard machine learning models (random forest, XGBoost)
and obtain very high class wise precision and recall. In a followup discussion
we also narrate how apart from the author characteristics, the peer-review
system might itself have a role in propelling the distinction among the
different categories which could lead to potential discrimination and
unfairness and calls for further investigation by the system admins.
","[{'version': 'v1', 'created': 'Fri, 12 Jun 2020 03:26:25 GMT'}]",2020-06-15,"[['Hazra', 'Rima', ''], ['Aryan', '', ''], ['Aggarwal', 'Hardik', ''], ['Marsili', 'Matteo', ''], ['Mukherjee', 'Animesh', '']]","['Peer review system', 'JHEP', 'co-reviewer network', 'co-citation network', 'collaboration network']"
6399,1801.06407,Andrey Kutuzov,"Andrey Kutuzov, Maria Kunilovskaya","Size vs. Structure in Training Corpora for Word Embedding Models:
  Araneum Russicum Maximum and Russian National Corpus",,"In: van der Aalst W. et al. (eds) Analysis of Images, Social
  Networks and Texts. AIST 2017. Lecture Notes in Computer Science, vol 10716.
  Springer, Cham",10.1007/978-3-319-73013-4_5,,cs.CL,http://creativecommons.org/licenses/by-sa/4.0/,"  In this paper, we present a distributional word embedding model trained on
one of the largest available Russian corpora: Araneum Russicum Maximum (over 10
billion words crawled from the web). We compare this model to the model trained
on the Russian National Corpus (RNC). The two corpora are much different in
their size and compilation procedures. We test these differences by evaluating
the trained models against the Russian part of the Multilingual SimLex999
semantic similarity dataset. We detect and describe numerous issues in this
dataset and publish a new corrected version. Aside from the already known fact
that the RNC is generally a better training corpus than web corpora, we
enumerate and explain fine differences in how the models process semantic
similarity task, what parts of the evaluation set are difficult for particular
models and why. Additionally, the learning curves for both models are
described, showing that the RNC is generally more robust as training material
for this task.
","[{'version': 'v1', 'created': 'Fri, 19 Jan 2018 14:11:16 GMT'}]",2018-01-22,"[['Kutuzov', 'Andrey', ''], ['Kunilovskaya', 'Maria', '']]","['word embeddings', 'web corpora', 'semantic similarity']"
6400,1711.08894,Woubshet Nema Behutiye,"Woubshet Behutiye, Pertti Karhap\""a\""a, Dolors Costal, Markku Oivo and
  Xavier Franch","Non-functional Requirements Documentation in Agile Software Development:
  Challenges and Solution Proposal","8 pages, Authors post print version, the original work is published
  in Product-Focused Software Process Improvement, PROFES 2017",,10.1007/978-3-319-69926-4_41,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Non-functional requirements (NFRs) are determinant for the success of
software projects. However,they are characterized as hard to define, and in
agile software development(ASD), are often given less priority and usually not
documented. In this paper, we present the findings of the documentation
practices and challenges of NFRs in companies utilizing ASD and propose
guidelines for enhancing NFRs documentation in ASD. We interviewed
practitioners from four companies and identified that epics, features, user
stories, acceptance criteria,Definition of Done(DoD), product and sprint
backlogs are used for documenting NFRS. Please refer to the manuscript for the
full abstract.
","[{'version': 'v1', 'created': 'Fri, 24 Nov 2017 08:39:07 GMT'}]",2017-11-27,"[['Behutiye', 'Woubshet', ''], ['Karhapää', 'Pertti', ''], ['Costal', 'Dolors', ''], ['Oivo', 'Markku', ''], ['Franch', 'Xavier', '']]","['Non-functional requirements', 'quality requirements', 'NFR', 'agile software development', 'non-functional requirements documentation']"
6401,2205.11303,Istvan David,Istvan David and Eugene Syriani,"Real-time Collaborative Multi-Level Modeling by Conflict-Free Replicated
  Data Types",,,10.1007/s10270-022-01054-5,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The need for real-time collaborative solutions in model-driven engineering
has been increasing over the past years. Conflict-free replicated data types
(CRDT) provide scalable and robust replication mechanisms that align well with
the requirements of real-time collaborative environments. In this paper, we
propose a real-time collaborative multi-level modeling framework to support
advanced modeling scenarios, built on a collection of custom CRDT, specifically
tailored for the needs of modeling environments. We demonstrate the benefits of
the framework through an illustrative modeling case and compare it with other
state-of-the-art modeling frameworks.
","[{'version': 'v1', 'created': 'Mon, 23 May 2022 13:42:46 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Aug 2022 21:44:47 GMT'}, {'version': 'v3', 'created': 'Wed, 12 Oct 2022 16:27:51 GMT'}]",2022-10-13,"[['David', 'Istvan', ''], ['Syriani', 'Eugene', '']]","['Collaborative modeling', 'Real-time collaboration', 'Multi-level modeling', 'Conflict-free replicateddata types', 'Model-driven engineering']"
6402,2106.10354,Alper Ahmeto\u{g}lu,"Alper Ahmetoglu, Emre Ugur, Minoru Asada, Erhan Oztop","High-level Features for Resource Economy and Fast Learning in Skill
  Transfer",,,10.1080/01691864.2021.2019613,,cs.RO cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Abstraction is an important aspect of intelligence which enables agents to
construct robust representations for effective decision making. In the last
decade, deep networks are proven to be effective due to their ability to form
increasingly complex abstractions. However, these abstractions are distributed
over many neurons, making the re-use of a learned skill costly. Previous work
either enforced formation of abstractions creating a designer bias, or used a
large number of neural units without investigating how to obtain high-level
features that may more effectively capture the source task. For avoiding
designer bias and unsparing resource use, we propose to exploit neural response
dynamics to form compact representations to use in skill transfer. For this, we
consider two competing methods based on (1) maximum information compression
principle and (2) the notion that abstract events tend to generate slowly
changing signals, and apply them to the neural signals generated during task
execution. To be concrete, in our simulation experiments, we either apply
principal component analysis (PCA) or slow feature analysis (SFA) on the
signals collected from the last hidden layer of a deep network while it
performs a source task, and use these features for skill transfer in a new
target task. We compare the generalization performance of these alternatives
with the baselines of skill transfer with full layer output and no-transfer
settings. Our results show that SFA units are the most successful for skill
transfer. SFA as well as PCA, incur less resources compared to usual skill
transfer, whereby many units formed show a localized response reflecting
end-effector-obstacle-goal relations. Finally, SFA units with lowest
eigenvalues resembles symbolic representations that highly correlate with
high-level features such as joint angles which might be thought of precursors
for fully symbolic systems.
","[{'version': 'v1', 'created': 'Fri, 18 Jun 2021 21:05:21 GMT'}]",2022-09-28,"[['Ahmetoglu', 'Alper', ''], ['Ugur', 'Emre', ''], ['Asada', 'Minoru', ''], ['Oztop', 'Erhan', '']]","['transfer learning', 'symbol emergence', 'reinforcement learning']"
6403,2002.03064,Jordan Henkel,"Jordan Henkel, Christian Bird, Shuvendu K. Lahiri, Thomas Reps","Learning from, Understanding, and Supporting DevOps Artifacts for Docker",Published in ICSE'2020,,10.1145/3377811.3380406,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the growing use of DevOps tools and frameworks, there is an increased
need for tools and techniques that support more than code. The current
state-of-the-art in static developer assistance for tools like Docker is
limited to shallow syntactic validation. We identify three core challenges in
the realm of learning from, understanding, and supporting developers writing
DevOps artifacts: (i) nested languages in DevOps artifacts, (ii) rule mining,
and (iii) the lack of semantic rule-based analysis. To address these challenges
we introduce a toolset, binnacle, that enabled us to ingest 900,000 GitHub
repositories.
  Focusing on Docker, we extracted approximately 178,000 unique Dockerfiles,
and also identified a Gold Set of Dockerfiles written by Docker experts. We
addressed challenge (i) by reducing the number of effectively uninterpretable
nodes in our ASTs by over 80% via a technique we call phased parsing. To
address challenge (ii), we introduced a novel rule-mining technique capable of
recovering two-thirds of the rules in a benchmark we curated. Through this
automated mining, we were able to recover 16 new rules that were not found
during manual rule collection. To address challenge (iii), we manually
collected a set of rules for Dockerfiles from commits to the files in the Gold
Set. These rules encapsulate best practices, avoid docker build failures, and
improve image size and build latency. We created an analyzer that used these
rules, and found that, on average, Dockerfiles on GitHub violated the rules
five times more frequently than the Dockerfiles in our Gold Set. We also found
that industrial Dockerfiles fared no better than those sourced from GitHub.
  The learned rules and analyzer in binnacle can be used to aid developers in
the IDE when creating Dockerfiles, and in a post-hoc fashion to identify issues
in, and to improve, existing Dockerfiles.
","[{'version': 'v1', 'created': 'Sat, 8 Feb 2020 01:59:06 GMT'}]",2020-02-11,"[['Henkel', 'Jordan', ''], ['Bird', 'Christian', ''], ['Lahiri', 'Shuvendu K.', ''], ['Reps', 'Thomas', '']]","['Docker', 'DevOps', 'Mining', 'Static Checking']"
6404,2002.08204,Fabian Timm,Lukas Enderich and Fabian Timm and Wolfram Burgard,"SYMOG: learning symmetric mixture of Gaussian modes for improved
  fixed-point quantization",Preprint submitted to Neurocomputing,Neurocomputing 2020,10.1016/j.neucom.2019.11.114,,cs.LG cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks (DNNs) have been proven to outperform classical methods
on several machine learning benchmarks. However, they have high computational
complexity and require powerful processing units. Especially when deployed on
embedded systems, model size and inference time must be significantly reduced.
We propose SYMOG (symmetric mixture of Gaussian modes), which significantly
decreases the complexity of DNNs through low-bit fixed-point quantization.
SYMOG is a novel soft quantization method such that the learning task and the
quantization are solved simultaneously. During training the weight distribution
changes from an unimodal Gaussian distribution to a symmetric mixture of
Gaussians, where each mean value belongs to a particular fixed-point mode. We
evaluate our approach with different architectures (LeNet5, VGG7, VGG11,
DenseNet) on common benchmark data sets (MNIST, CIFAR-10, CIFAR-100) and we
compare with state-of-the-art quantization approaches. We achieve excellent
results and outperform 2-bit state-of-the-art performance with an error rate of
only 5.71% on CIFAR-10 and 27.65% on CIFAR-100.
","[{'version': 'v1', 'created': 'Wed, 19 Feb 2020 14:17:32 GMT'}]",2020-10-20,"[['Enderich', 'Lukas', ''], ['Timm', 'Fabian', ''], ['Burgard', 'Wolfram', '']]","['Deep neural network', 'Model reduction', 'Fixed-pointquantization', 'Gradient descent', 'Weight clipping']"
6405,2101.11898,Patrik Jonell,"Patrik Jonell, Youngwoo Yoon, Pieter Wolfert, Taras Kucherenko, Gustav
  Eje Henter",HEMVIP: Human Evaluation of Multiple Videos in Parallel,"6 pages, 1 figures. Proceedings of the 22th ACM International
  Conference on Multimodal Interaction. 2021. Montreal, Canada",,10.1145/3462244.3479957,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many research areas, for example motion and gesture generation, objective
measures alone do not provide an accurate impression of key stimulus traits
such as perceived quality or appropriateness. The gold standard is instead to
evaluate these aspects through user studies, especially subjective evaluations
of video stimuli. Common evaluation paradigms either present individual stimuli
to be scored on Likert-type scales, or ask users to compare and rate videos in
a pairwise fashion. However, the time and resources required for such
evaluations scale poorly as the number of conditions to be compared increases.
Building on standards used for evaluating the quality of multimedia codecs,
this paper instead introduces a framework for granular rating of multiple
comparable videos in parallel. This methodology essentially analyses all
condition pairs at once. Our contributions are 1) a proposed framework, called
HEMVIP, for parallel and granular evaluation of multiple video stimuli and 2) a
validation study confirming that results obtained using the tool are in close
agreement with results of prior studies using conventional multiple pairwise
comparisons.
","[{'version': 'v1', 'created': 'Thu, 28 Jan 2021 10:00:34 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Sep 2021 20:53:21 GMT'}, {'version': 'v3', 'created': 'Wed, 20 Oct 2021 14:16:32 GMT'}]",2021-10-22,"[['Jonell', 'Patrik', ''], ['Yoon', 'Youngwoo', ''], ['Wolfert', 'Pieter', ''], ['Kucherenko', 'Taras', ''], ['Henter', 'Gustav Eje', '']]","['evaluation paradigms', 'video evaluation', 'conversational agents', 'gesture generation']"
6406,2001.07418,Caglar Demir,Caglar Demir and Axel-Cyrille Ngonga Ngomo,A Physical Embedding Model for Knowledge Graphs,"9th Joint International Conference, JIST 2019, Hangzhou, China",,10.1007/978-981-15-3412-6,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge graph embedding methods learn continuous vector representations for
entities in knowledge graphs and have been used successfully in a large number
of applications. We present a novel and scalable paradigm for the computation
of knowledge graph embeddings, which we dub PYKE . Our approach combines a
physical model based on Hooke's law and its inverse with ideas from simulated
annealing to compute embeddings for knowledge graphs efficiently. We prove that
PYKE achieves a linear space complexity. While the time complexity for the
initialization of our approach is quadratic, the time complexity of each of its
iterations is linear in the size of the input knowledge graph. Hence, PYKE's
overall runtime is close to linear. Consequently, our approach easily scales up
to knowledge graphs containing millions of triples. We evaluate our approach
against six state-of-the-art embedding approaches on the DrugBank and DBpedia
datasets in two series of experiments. The first series shows that the cluster
purity achieved by PYKE is up to 26% (absolute) better than that of the state
of art. In addition, PYKE is more than 22 times faster than existing embedding
solutions in the best case. The results of our second series of experiments
show that PYKE is up to 23% (absolute) better than the state of art on the task
of type prediction while maintaining its superior scalability. Our
implementation and results are open-source and are available at
http://github.com/dice-group/PYKE.
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2020 10:02:18 GMT'}]",2020-01-22,"[['Demir', 'Caglar', ''], ['Ngomo', 'Axel-Cyrille Ngonga', '']]","['Knowledge graph embedding', 'Hooke’s law', 'type prediction']"
6407,1910.13247,Luca Heltai,"Daniel Arndt, Wolfgang Bangerth, Denis Davydov, Timo Heister, Luca
  Heltai, Martin Kronbichler, Matthias Maier, Jean-Paul Pelteret, Bruno
  Turcksin, David Wells","The deal.II finite element library: design, features, and insights","36 pages, 3 figures","Computers {\&} Mathematics with Applications, 81: 407--422, 2021",10.1016/j.camwa.2020.02.022,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  deal.II is a state-of-the-art finite element library focused on generality,
dimension-independent programming, parallelism, and extensibility. Herein, we
outline its primary design considerations and its sophisticated features such
as distributed meshes, $hp$-adaptivity, support for complex geometries, and
matrix-free algorithms. But deal.II is more than just a software library: It is
also a diverse and worldwide community of developers and users, as well as an
educational platform. We therefore also discuss some of the technical and
social challenges and lessons learned in running a large community software
project over the course of two decades.
","[{'version': 'v1', 'created': 'Thu, 24 Oct 2019 13:40:13 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Feb 2020 11:06:13 GMT'}]",2021-02-16,"[['Arndt', 'Daniel', ''], ['Bangerth', 'Wolfgang', ''], ['Davydov', 'Denis', ''], ['Heister', 'Timo', ''], ['Heltai', 'Luca', ''], ['Kronbichler', 'Martin', ''], ['Maier', 'Matthias', ''], ['Pelteret', 'Jean-Paul', ''], ['Turcksin', 'Bruno', ''], ['Wells', 'David', '']]","['Finite Elements', 'Mathematical Software', 'Scientific Computing', 'Software Design']"
6408,2007.12520,Marvin Wyrich,Marvin Mu\~noz Bar\'on and Marvin Wyrich and Stefan Wagner,"An Empirical Validation of Cognitive Complexity as a Measure of Source
  Code Understandability","12 pages. To be published at ESEM '20: ACM / IEEE International
  Symposium on Empirical Software Engineering and Measurement",,10.1145/3382494.3410636,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Developers spend a lot of their time on understanding source
code. Static code analysis tools can draw attention to code that is difficult
for developers to understand. However, most of the findings are based on
non-validated metrics, which can lead to confusion and code, that is hard to
understand, not being identified.
  Aims: In this work, we validate a metric called Cognitive Complexity which
was explicitly designed to measure code understandability and which is already
widely used due to its integration in well-known static code analysis tools.
  Method: We conducted a systematic literature search to obtain data sets from
studies which measured code understandability. This way we obtained about
24,000 understandability evaluations of 427 code snippets. We calculated the
correlations of these measurements with the corresponding metric values and
statistically summarized the correlation coefficients through a meta-analysis.
  Results: Cognitive Complexity positively correlates with comprehension time
and subjective ratings of understandability. The metric showed mixed results
for the correlation with the correctness of comprehension tasks and with
physiological measures.
  Conclusions: It is the first validated and solely code-based metric which is
able to reflect at least some aspects of code understandability. Moreover, due
to its methodology, this work shows that code understanding is currently
measured in many different ways, which we also do not know how they are
related. This makes it difficult to compare the results of individual studies
as well as to develop a metric that measures code understanding in all its
facets.
","[{'version': 'v1', 'created': 'Fri, 24 Jul 2020 13:39:07 GMT'}]",2020-07-27,"[['Barón', 'Marvin Muñoz', ''], ['Wyrich', 'Marvin', ''], ['Wagner', 'Stefan', '']]","['cognitive complexity', 'source code understandability', 'source codecomprehension', 'software metrics', 'meta-analysis']"
6409,1806.07727,Chakkrit Tantithamthavorn,"Chakkrit Tantithamthavorn, Surafel Lemma Abebe, Ahmed E. Hassan,
  Akinori Ihara, Kenichi Matsumoto","The Impact of IR-based Classifier Configuration on the Performance and
  the Effort of Method-Level Bug Localization",Accepted at Journal of Information and Software Technology (IST),,10.1016/j.infsof.2018.06.001,,cs.SE cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: IR-based bug localization is a classifier that assists developers in
locating buggy source code entities (e.g., files and methods) based on the
content of a bug report. Such IR-based classifiers have various parameters that
can be configured differently (e.g., the choice of entity representation).
Objective: In this paper, we investigate the impact of the choice of the
IR-based classifier configuration on the top-k performance and the required
effort to examine source code entities before locating a bug at the method
level. Method: We execute a large space of classifier configuration, 3,172 in
total, on 5,266 bug reports of two software systems, i.e., Eclipse and Mozilla.
Results: We find that (1) the choice of classifier configuration impacts the
top-k performance from 0.44% to 36% and the required effort from 4,395 to
50,000 LOC; (2) classifier configurations with similar top-k performance might
require different efforts; (3) VSM achieves both the best top-k performance and
the least required effort for method-level bug localization; (4) the likelihood
of randomly picking a configuration that performs within 20% of the best top-k
classifier configuration is on average 5.4% and that of the least effort is on
average 1%; (5) configurations related to the entity representation of the
analyzed data have the most impact on both the top-k performance and the
required effort; and (6) the most efficient classifier configuration obtained
at the method-level can also be used at the file-level (and vice versa).
Conclusion: Our results lead us to conclude that configuration has a large
impact on both the top-k performance and the required effort for method-level
bug localization, suggesting that the IR-based configuration settings should be
carefully selected and the required effort metric should be included in future
bug localization studies.
","[{'version': 'v1', 'created': 'Wed, 20 Jun 2018 13:43:33 GMT'}]",2018-06-21,"[['Tantithamthavorn', 'Chakkrit', ''], ['Abebe', 'Surafel Lemma', ''], ['Hassan', 'Ahmed E.', ''], ['Ihara', 'Akinori', ''], ['Matsumoto', 'Kenichi', '']]","['Bug Localization', 'Classifier Configuration', 'Evaluation Metrics', 'Top-k Performance', 'Effort']"
6410,2202.02326,Gopi Krishnan Rajbahadur,"Boyuan Chen, Mingzhi Wen, Yong Shi, Dayi Lin, Gopi Krishnan
  Rajbahadur, Zhen Ming (Jack) Jiang",Towards Training Reproducible Deep Learning Models,,,10.1145/3510003.3510163,,cs.LG cs.AI cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Reproducibility is an increasing concern in Artificial Intelligence (AI),
particularly in the area of Deep Learning (DL). Being able to reproduce DL
models is crucial for AI-based systems, as it is closely tied to various tasks
like training, testing, debugging, and auditing. However, DL models are
challenging to be reproduced due to issues like randomness in the software
(e.g., DL algorithms) and non-determinism in the hardware (e.g., GPU). There
are various practices to mitigate some of the aforementioned issues. However,
many of them are either too intrusive or can only work for a specific usage
context. In this paper, we propose a systematic approach to training
reproducible DL models. Our approach includes three main parts: (1) a set of
general criteria to thoroughly evaluate the reproducibility of DL models for
two different domains, (2) a unified framework which leverages a
record-and-replay technique to mitigate software-related randomness and a
profile-and-patch technique to control hardware-related non-determinism, and
(3) a reproducibility guideline which explains the rationales and the
mitigation strategies on conducting a reproducible training process for DL
models. Case study results show our approach can successfully reproduce six
open source and one commercial DL models.
","[{'version': 'v1', 'created': 'Fri, 4 Feb 2022 18:14:39 GMT'}]",2022-02-08,"[['Chen', 'Boyuan', '', 'Jack'], ['Wen', 'Mingzhi', '', 'Jack'], ['Shi', 'Yong', '', 'Jack'], ['Lin', 'Dayi', '', 'Jack'], ['Rajbahadur', 'Gopi Krishnan', '', 'Jack'], ['Ming', 'Zhen', '', 'Jack'], ['Jiang', '', '']]","['Artificial Intelligence', 'Deep Learning', 'Software Engineering', 'Reproducibility']"
6411,2008.01566,Md Rafiqul Islam Rabin,"Md Rafiqul Islam Rabin, Nghi D. Q. Bui, Ke Wang, Yijun Yu, Lingxiao
  Jiang, Mohammad Amin Alipour","On the Generalizability of Neural Program Models with respect to
  Semantic-Preserving Program Transformations","Information and Software Technology, IST Journal 2021, Elsevier.
  Related to arXiv:2004.07313",,10.1016/j.infsof.2021.106552,,cs.SE cs.LG cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the prevalence of publicly available source code repositories to train
deep neural network models, neural program models can do well in source code
analysis tasks such as predicting method names in given programs that cannot be
easily done by traditional program analysis techniques. Although such neural
program models have been tested on various existing datasets, the extent to
which they generalize to unforeseen source code is largely unknown. Since it is
very challenging to test neural program models on all unforeseen programs, in
this paper, we propose to evaluate the generalizability of neural program
models with respect to semantic-preserving transformations: a generalizable
neural program model should perform equally well on programs that are of the
same semantics but of different lexical appearances and syntactical structures.
We compare the results of various neural program models for the method name
prediction task on programs before and after automated semantic-preserving
transformations. We use three Java datasets of different sizes and three
state-of-the-art neural network models for code, namely code2vec, code2seq, and
GGNN, to build nine such neural program models for evaluation. Our results show
that even with small semantically preserving changes to the programs, these
neural program models often fail to generalize their performance. Our results
also suggest that neural program models based on data and control dependencies
in programs generalize better than neural program models based only on abstract
syntax trees. On the positive side, we observe that as the size of the training
dataset grows and diversifies the generalizability of correct predictions
produced by the neural program models can be improved too. Our results on the
generalizability of neural program models provide insights to measure their
limitations and provide a stepping stone for their improvement.
","[{'version': 'v1', 'created': 'Fri, 31 Jul 2020 20:39:20 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Nov 2020 12:55:45 GMT'}, {'version': 'v3', 'created': 'Thu, 18 Mar 2021 07:35:13 GMT'}]",2022-07-12,"[['Rabin', 'Md Rafiqul Islam', ''], ['Bui', 'Nghi D. Q.', ''], ['Wang', 'Ke', ''], ['Yu', 'Yijun', ''], ['Jiang', 'Lingxiao', ''], ['Alipour', 'Mohammad Amin', '']]","['neural models', 'code representation', 'model evaluation', 'programtransformation', 'generalizability']"
6412,2205.09888,Mat\'ias R. Bender,Mat\'ias R. Bender,Solving sparse polynomial systems using Groebner bases and resultants,,,10.1145/3476446.3535498,,cs.SC math.AG,http://creativecommons.org/licenses/by/4.0/,"  Solving systems of polynomial equations is a central problem in nonlinear and
computational algebra. Since Buchberger's algorithm for computing Gr\""obner
bases in the 60s, there has been a lot of progress in this domain. Moreover,
these equations have been employed to model and solve problems from diverse
disciplines such as biology, cryptography, and robotics. Currently, we have a
good understanding of how to solve generic systems from a theoretical and
algorithmic point of view. However, polynomial equations encountered in
practice are usually structured, and so many properties and results about
generic systems do not apply to them. For this reason, a common trend in the
last decades has been to develop mathematical and algorithmic frameworks to
exploit specific structures of systems of polynomials.
  Arguably, the most common structure is sparsity; that is, the polynomials of
the systems only involve a few monomials. Since Bernstein, Khovanskii, and
Kushnirenko's work on the expected number of solutions of sparse systems, toric
geometry has been the default mathematical framework to employ sparsity. In
particular, it is the crux of the matter behind the extension of classical
tools to systems, such as resultant computations, homotopy continuation
methods, and most recently, Gr\""obner bases. In this work, we will review these
classical tools, their extensions, and recent progress in exploiting sparsity
for solving polynomial systems.
  This manuscript complements its homonymous tutorial presented at the
conference ISSAC 2022.
","[{'version': 'v1', 'created': 'Thu, 19 May 2022 22:38:23 GMT'}]",2022-05-23,"[['Bender', 'Matías R.', '']]","['Sparse polynomials', 'Gröbner bases', 'resultants', 'solving polynomialsystems']"
6413,2006.16409,Sachin Singh Gautam Dr.,"Saipraneeth Gouravaraju, Jyotindra Narayan, Roger A. Sauer, Sachin
  Singh Gautam","A Bayesian regularization-backpropagation neural network model for
  peeling computations","18 pages, 9 figures",,10.1080/00218464.2021.2001335,,cs.CE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bayesian regularization-backpropagation neural network (BR-BPNN) model is
employed to predict some aspects of the gecko spatula peeling viz. the
variation of the maximum normal and tangential pull-off forces and the
resultant force angle at detachment with the peeling angle. K-fold cross
validation is used to improve the effectiveness of the model. The input data is
taken from finite element (FE) peeling results. The neural network is trained
with 75% of the FE dataset. The remaining 25% are utilized to predict the
peeling behavior. The training performance is evaluated for every change in the
number of hidden layer neurons to determine the optimal network structure. The
relative error is calculated to draw a clear comparison between predicted and
FE results. It is shown that the BR-BPNN model in conjunction with k-fold
technique has significant potential to estimate the peeling behavior.
","[{'version': 'v1', 'created': 'Mon, 29 Jun 2020 21:58:43 GMT'}, {'version': 'v2', 'created': 'Fri, 28 May 2021 09:49:52 GMT'}, {'version': 'v3', 'created': 'Mon, 24 Jan 2022 12:54:00 GMT'}]",2022-01-25,"[['Gouravaraju', 'Saipraneeth', ''], ['Narayan', 'Jyotindra', ''], ['Sauer', 'Roger A.', ''], ['Gautam', 'Sachin Singh', '']]","['Machine learning', 'Adhesion', 'Peeling', 'Artificial neural networks', 'Bayesian']"
6414,2107.05979,Liam Jordon,"Liam Jordon, Philippe Moser",Normal Sequences with Non-Maximal Automatic Complexity,"Conference Version: FSTTCS 2021: 41st IARCS Annual Conference on
  Foundations of Software Technology and Theoretical Computer Science -
  December 2021 - Gao, India","LIPIcs, Volume 213, FSTTCS 2021, 2021, 47:1--47:16",10.4230/LIPIcs.FSTTCS.2021.47,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper examines Automatic Complexity, a complexity notion introduced by
Shallit and Wang in 2001. We demonstrate that there exists a normal sequence
$T$ such that $I(T) = 0$ and $S(T) \leq 1/2$, where $I(T)$ and $S(T)$ are the
lower and upper automatic complexity rates of $T$ respectively. We furthermore
show that there exists a Champernowne sequence $C$, i.e. a sequence formed by
concatenating all strings of length $1$ followed by concatenating all strings
of length $2$ and so on, such that $S(C) \leq 2/3$.
","[{'version': 'v1', 'created': 'Tue, 13 Jul 2021 10:54:35 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Oct 2021 11:05:09 GMT'}, {'version': 'v3', 'created': 'Mon, 29 Nov 2021 18:09:07 GMT'}]",2021-11-30,"[['Jordon', 'Liam', ''], ['Moser', 'Philippe', '']]","['Automatic Complexity', 'finite-state complexity', 'normal sequences', 'Champernowne sequences', 'de Bruijn strings', 'Kolmogorov complexity']"
6415,1902.05922,Shuwei Zhou,"Shuwei Zhou, Timon Rabczuk, and Xiaoying Zhuang","Phase field modeling of quasi-static and dynamic crack propagation:
  COMSOL implementation and case studies",36 pages,"Advances in Engineering Software, 2018, 122: 31-49",10.1016/j.advengsoft.2018.03.012,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The phase-field model (PFM) represents the crack geometry in a diffusive way
without introducing sharp discontinuities. This feature enables PFM to
effectively model crack propagation compared with numerical methods based on
discrete crack model, especially for complex crack patterns. Due to the
involvement of \phased field"", phase-field method can be essentially treated a
multifield problem even for pure mechanical problem. Therefore, it is supposed
that the implementation of PFM based on a software developer that especially
supports the solution of multifield problems should be more effective, simpler
and more efficient than PFM implemented on a general finite element software.
In this work, the authors aim to devise a simple and efficient implementation
of phase-field model for the modelling of quasi-static and dynamic fracture in
the general purpose commercial software developer, COMSOL Multiphysics. Notably
only the tensile stress induced crack is accounted for crack evolution by using
the decomposition of elastic strain energy. The width of the diffusive crack is
controlled by a length-scale parameter. Equations that govern body motion and
phase-field evolution are written into different modules in COMSOL, which are
then coupled to a whole system to be solved. A staggered scheme is adopted to
solve the coupled system and each module is solved sequentially during one time
step. A number of 2D and 3D examples are tested to investigate the performance
of the present implementation. Our simulations show good agreement with
previous works, indicating the feasibility and validity of the COMSOL
implementation of PFM.
","[{'version': 'v1', 'created': 'Thu, 14 Feb 2019 10:27:01 GMT'}]",2019-02-18,"[['Zhou', 'Shuwei', ''], ['Rabczuk', 'Timon', ''], ['Zhuang', 'Xiaoying', '']]","['phase-field', 'multi-field', 'fracture mechanics', 'COMSOL', 'crack propagation', 'Quasi-static', 'dynamicfracture']"
6416,2202.01308,Bahar Uddin Mahmud,"Bahar Uddin Mahmud, Afsana Sharmin","Impact Analysis of Harassment Against Women Using Association Rule
  Mining Approaches: Bangladesh Prospective","15 pages, journal, 8 figures","Southeast University Journal of Science and Engineering (SEUJSE),
  ISSN: 1999-1630",10.5281/zenodo.3752498,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, it has been noticed that women are making progress in every
sector of society. Their involvement in every field, such as education, job
market, social work, etc., is increasing at a remarkable rate. For the last
several years, the government has been trying its level best for the
advancement of women in every sector by doing several research work and
activities and funding several organizations to motivate women. Although
women's involvement in several fields is increasing, the big concern is they
are facing several barriers in their advancement, and it is not surprising that
sexual harassment is one of them. In Bangladesh, harassment against women,
especially students, is a common phenomenon, and it is increasing. In this
paper, a survey-based and Apriori algorithm are used to analyze the several
impacts of harassment among several age groups. Also, several factors such as
frequent impacts of harassment, most vulnerable groups, women mostly facing
harassment, the alleged person behind harassment, etc., are analyzed through
association rule mining of Apriori algorithm and F.P. Growth algorithm. And
then, a comparison of performance between both algorithms has been shown
briefly. For this analysis, data have been carefully collected from all ages.
","[{'version': 'v1', 'created': 'Wed, 2 Feb 2022 22:21:36 GMT'}]",2022-02-04,"[['Mahmud', 'Bahar Uddin', ''], ['Sharmin', 'Afsana', '']]","['Impact analysis', 'Harassment', 'Association rule mining', 'Data mining', 'Apriori', 'F.P. Growth']"
6417,1712.07525,Ayush Singhal,"Ayush Singhal, Pradeep Sinha, Rakesh Pant","Use of Deep Learning in Modern Recommendation System: A Summary of
  Recent Works","6 pages, 1 figure, 1 table, ""Published with International Journal of
  Computer Applications (IJCA)""","International Journal of Computer Applications 180(7):17-22,
  December 2017",10.5120/ijca2017916055,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the exponential increase in the amount of digital information over the
internet, online shops, online music, video and image libraries, search engines
and recommendation system have become the most convenient ways to find relevant
information within a short time. In the recent times, deep learning's advances
have gained significant attention in the field of speech recognition, image
processing and natural language processing. Meanwhile, several recent studies
have shown the utility of deep learning in the area of recommendation systems
and information retrieval as well. In this short review, we cover the recent
advances made in the field of recommendation using various variants of deep
learning technology. We organize the review in three parts: Collaborative
system, Content based system and Hybrid system. The review also discusses the
contribution of deep learning integrated recommendation systems into several
application domains. The review concludes by discussion of the impact of deep
learning in recommendation system in various domain and whether deep learning
has shown any significant improvement over the conventional systems for
recommendation. Finally, we also provide future directions of research which
are possible based on the current state of use of deep learning in
recommendation systems.
","[{'version': 'v1', 'created': 'Wed, 20 Dec 2017 15:25:31 GMT'}]",2017-12-21,"[['Singhal', 'Ayush', ''], ['Sinha', 'Pradeep', ''], ['Pant', 'Rakesh', '']]","['Deep Learning', 'Recommender system', 'Literature review', 'Machine Learning', 'Collaborative filtering', 'Hybrid system']"
6418,1401.2937,Ralf Steinberger,Ralf Steinberger,"A survey of methods to ease the development of highly multilingual text
  mining applications",22 pages. Published online on 12 October 2011,"Language Resources and Evaluation, Volume 46, Issue 2, pp 155-176,
  June 2012",10.1007/s10579-011-9165-9,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multilingual text processing is useful because the information content found
in different languages is complementary, both regarding facts and opinions.
While Information Extraction and other text mining software can, in principle,
be developed for many languages, most text analysis tools have only been
applied to small sets of languages because the development effort per language
is large. Self-training tools obviously alleviate the problem, but even the
effort of providing training data and of manually tuning the results is usually
considerable. In this paper, we gather insights by various multilingual system
developers on how to minimise the effort of developing natural language
processing applications for many languages. We also explain the main guidelines
underlying our own effort to develop complex text mining software for tens of
languages. While these guidelines - most of all: extreme simplicity - can be
very restrictive and limiting, we believe to have shown the feasibility of the
approach through the development of the Europe Media Monitor (EMM) family of
applications (http://emm.newsbrief.eu/overview.html). EMM is a set of complex
media monitoring tools that process and analyse up to 100,000 online news
articles per day in between twenty and fifty languages. We will also touch upon
the kind of language resources that would make it easier for all to develop
highly multilingual text mining applications. We will argue that - to achieve
this - the most needed resources would be freely available, simple, parallel
and uniform multilingual dictionaries, corpora and software tools.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2014 18:05:28 GMT'}]",2014-01-14,"[['Steinberger', 'Ralf', '']]","['text mining', 'information extraction', 'multilinguality', 'saving effort …']"
6419,1708.04390,Xirong Li,"Weiyu Lan, Xirong Li and Jianfeng Dong",Fluency-Guided Cross-Lingual Image Captioning,"9 pages, 2 figures, accepted as ORAL by ACM Multimedia 2017",,10.1145/3123266.3123366,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image captioning has so far been explored mostly in English, as most
available datasets are in this language. However, the application of image
captioning should not be restricted by language. Only few studies have been
conducted for image captioning in a cross-lingual setting. Different from these
works that manually build a dataset for a target language, we aim to learn a
cross-lingual captioning model fully from machine-translated sentences. To
conquer the lack of fluency in the translated sentences, we propose in this
paper a fluency-guided learning framework. The framework comprises a module to
automatically estimate the fluency of the sentences and another module to
utilize the estimated fluency scores to effectively train an image captioning
model for the target language. As experiments on two bilingual
(English-Chinese) datasets show, our approach improves both fluency and
relevance of the generated captions in Chinese, but without using any manually
written sentences from the target language.
","[{'version': 'v1', 'created': 'Tue, 15 Aug 2017 03:46:31 GMT'}]",2017-08-16,"[['Lan', 'Weiyu', ''], ['Li', 'Xirong', ''], ['Dong', 'Jianfeng', '']]","['Cross-lingual image captioning', 'English-Chinese', 'Sentence fuency']"
6420,2003.06507,Gabriel Lima,"Gabriel Lima, Meeyoung Cha, Chihyung Jeon, Kyungsin Park",The Conflict Between People's Urge to Punish AI and Legal Systems,"Published at Frontiers in AI and Robots - Ethics in Robotics and
  Artificial Intelligence Section",,10.3389/frobt.2021.756242,,cs.CY cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Regulating artificial intelligence (AI) has become necessary in light of its
deployment in high-risk scenarios. This paper explores the proposal to extend
legal personhood to AI and robots, which had not yet been examined through the
lens of the general public. We present two studies (N = 3,559) to obtain
people's views of electronic legal personhood vis-\`a-vis existing liability
models. Our study reveals people's desire to punish automated agents even
though these entities are not recognized any mental state. Furthermore, people
did not believe automated agents' punishment would fulfill deterrence nor
retribution and were unwilling to grant them legal punishment preconditions,
namely physical independence and assets. Collectively, these findings suggest a
conflict between the desire to punish automated agents and its perceived
impracticability. We conclude by discussing how future design and legal
decisions may influence how the public reacts to automated agents' wrongdoings.
","[{'version': 'v1', 'created': 'Fri, 13 Mar 2020 23:19:58 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Feb 2021 02:55:49 GMT'}, {'version': 'v3', 'created': 'Thu, 11 Nov 2021 02:36:45 GMT'}]",2021-11-12,"[['Lima', 'Gabriel', ''], ['Cha', 'Meeyoung', ''], ['Jeon', 'Chihyung', ''], ['Park', 'Kyungsin', '']]","['artificial intelligence', 'robots', 'AI', 'legal system', 'legal personhood', 'punishment', 'responsibility']"
6421,2207.13678,Aristotelis Ballas,Aristotelis Ballas and Christos Diou,Multi-layer Representation Learning for Robust OOD Image Classification,"Paper accepted for publication in the 12th Hellenic Conference on
  Artificial Intelligence (SETN 2022)",,10.1145/3549737.3549780,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Convolutional Neural Networks have become the norm in image classification.
Nevertheless, their difficulty to maintain high accuracy across datasets has
become apparent in the past few years. In order to utilize such models in
real-world scenarios and applications, they must be able to provide trustworthy
predictions on unseen data. In this paper, we argue that extracting features
from a CNN's intermediate layers can assist in the model's final prediction.
Specifically, we adapt the Hypercolumns method to a ResNet-18 and find a
significant increase in the model's accuracy, when evaluating on the NICO
dataset.
","[{'version': 'v1', 'created': 'Wed, 27 Jul 2022 17:46:06 GMT'}]",2022-07-28,"[['Ballas', 'Aristotelis', ''], ['Diou', 'Christos', '']]","['deep learning', 'domain generalization', 'out of distribution', 'image classification']"
6422,2111.13985,Mohammed Daoudi,"Emery Pierson, Juan-Carlos Alvarez Paiva, Mohamed Daoudi","Projection-based Classification of Surfaces for 3D Human Mesh Sequence
  Retrieval",,"Computers & Graphics, 2 November 2021",10.1016/j.cag.2021.10.012,,cs.CG,http://creativecommons.org/licenses/by/4.0/,"  We analyze human poses and motion by introducing three sequences of easily
calculated surface descriptors that are invariant under reparametrizations and
Euclidean transformations. These descriptors are obtained by associating to
each finitely-triangulated surface two functions on the unit sphere: for each
unit vector u we compute the weighted area of the projection of the surface
onto the plane orthogonal to u and the length of its projection onto the line
spanned by u. The L2 norms and inner products of the projections of these
functions onto the space of spherical harmonics of order k provide us with
three sequences of Euclidean and reparametrization invariants of the surface.
The use of these invariants reduces the comparison of 3D+time surface
representations to the comparison of polygonal curves in R^n. The experimental
results on the FAUST and CVSSP3D artificial datasets are promising. Moreover, a
slight modification of our method yields good results on the noisy CVSSP3D real
dataset.
","[{'version': 'v1', 'created': 'Sat, 27 Nov 2021 21:04:30 GMT'}]",2021-11-30,"[['Pierson', 'Emery', ''], ['Paiva', 'Juan-Carlos Alvarez', ''], ['Daoudi', 'Mohamed', '']]","['3D Human Shape Analysis', '4D Human Retrieval', 'Convex geometry', 'spherical harmonics analysis']"
6423,2208.06354,Tarik A. Rashid,"Marmik Shrestha, Omar Hisham Alsadoon, Abeer Alsadoon, Thair
  Al-Dala'in, Tarik A. Rashid, P.W.C. Prasad, Ahmad Alrubaie","A novel solution of deep learning for enhanced support vector machine
  for predicting the onset of type 2 diabetes",18 pages,"Multimedia Tools and Applications, 2022",10.1007/s11042-022-13582-9,,cs.LG cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Type 2 Diabetes is one of the most major and fatal diseases known to human
beings, where thousands of people are subjected to the onset of Type 2 Diabetes
every year. However, the diagnosis and prevention of Type 2 Diabetes are
relatively costly in today's scenario; hence, the use of machine learning and
deep learning techniques is gaining momentum for predicting the onset of Type 2
Diabetes. This research aims to increase the accuracy and Area Under the Curve
(AUC) metric while improving the processing time for predicting the onset of
Type 2 Diabetes. The proposed system consists of a deep learning technique that
uses the Support Vector Machine (SVM) algorithm along with the Radial Base
Function (RBF) along with the Long Short-term Memory Layer (LSTM) for
prediction of onset of Type 2 Diabetes. The proposed solution provides an
average accuracy of 86.31 % and an average AUC value of 0.8270 or 82.70 %, with
an improvement of 3.8 milliseconds in the processing. Radial Base Function
(RBF) kernel and the LSTM layer enhance the prediction accuracy and AUC metric
from the current industry standard, making it more feasible for practical use
without compromising the processing time.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2022 18:15:40 GMT'}]",2022-08-15,"[['Shrestha', 'Marmik', ''], ['Alsadoon', 'Omar Hisham', ''], ['Alsadoon', 'Abeer', ''], [""Al-Dala'in"", 'Thair', ''], ['Rashid', 'Tarik A.', ''], ['Prasad', 'P. W. C.', ''], ['Alrubaie', 'Ahmad', '']]","['Deep Learning', 'Type 2 Diabetes', 'Support Vector Machine', 'Radial Base Function', 'Long Short-term Memory', 'Electronic Health Record']"
6424,1508.04403,Niall Murphy,"Neil Dalchau, Niall Murphy, Rasmus Petersen, Boyan Yordanov","Synthesizing and tuning chemical reaction networks with specified
  behaviours","17 pages, 6 figures, appeared the proceedings of the 21st conference
  on DNA Computing and Molecular Programming, 2015",LNCS 9211 pp 16-33 2015,10.1007/978-3-319-21999-8_2,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider how to generate chemical reaction networks (CRNs) from functional
specifications. We propose a two-stage approach that combines synthesis by
satisfiability modulo theories and Markov chain Monte Carlo based optimisation.
First, we identify candidate CRNs that have the possibility to produce correct
computations for a given finite set of inputs. We then optimise the reaction
rates of each CRN using a combination of stochastic search techniques applied
to the chemical master equation, simultaneously improving the of correct
behaviour and ruling out spurious solutions. In addition, we use techniques
from continuous time Markov chain theory to study the expected termination time
for each CRN. We illustrate our approach by identifying CRNs for majority
decision-making and division computation, which includes the identification of
both known and unknown networks.
","[{'version': 'v1', 'created': 'Tue, 18 Aug 2015 18:23:14 GMT'}]",2015-08-19,"[['Dalchau', 'Neil', ''], ['Murphy', 'Niall', ''], ['Petersen', 'Rasmus', ''], ['Yordanov', 'Boyan', '']]","['Chemical Reaction Networks', 'Program Synthesis', 'Parameteroptimisation', 'Chemical Master Equation', 'Satisfiability Modulo Theories', 'Markov chain Monte Carlo']"
6425,2012.08297,Kondo Adjallah,"K. Adjallah (ISTIT), K. Adzakpa","Minimizing Maintenance Cost Involving Flow-time and Tardiness Penalty
  with Unequal Release Dates",,"Proceedings of the Institution of Mechanical Engineers, Part O:
  Journal of Risk and Reliability, SAGE Publications, 2007, 221 (1), pp.57-65",10.1243/1748006XJRR24,,cs.PF cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes important and useful results relating to the minimization
of the sum of the flow-time and the tardiness of tasks or jobs with unequal
release dates (occurrence date), with application to maintenance planning and
scheduling. Firstly, the policy of real-time maintenance is defined for
minimizing the cost of tardiness and critical states. The required local
optimality rule (FTR) is proved, in order to minimize the sum or the linear
combination of the tasks' flow-time and tardiness costs. This rule has served
to design a scheduling algorithm, with O(n 3) complexity when it is applied to
schedule a set of n tasks on one processor. To evaluate its performance, the
results are compared to a lower bound that is provided, in a numerical case
study. Using this algorithm in combination with the tasks urgency criterion, a
real-time algorithm is developed to schedule the tasks on q parallel
processors. This latter algorithm is finally applied to schedule and assign
preventive maintenance tasks to processors in the case of a distributed system.
Its efficiency enables, as shown in the numerical example, to minimize the cost
of preventive maintenance tasks, expressed as the sum of the tasks tardiness
and flow-time. This corresponds to costs of critical states and of tardiness of
preventive maintenance.
","[{'version': 'v1', 'created': 'Tue, 15 Dec 2020 14:05:41 GMT'}]",2020-12-16,"[['Adjallah', 'K.', '', 'ISTIT'], ['Adzakpa', 'K.', '']]","['Task scheduling', 'maintenance planning', 'flow-time', 'tardiness', 'release date (occurrence date)', 'availability', 'distributed systems']"
6426,1810.01794,Tiantu Xu,"Tiantu Xu, Luis Materon Botelho, Felix Xiaozhu Lin",VStore: A Data Store for Analytics on Large Videos,,,10.1145/3302424.3303971,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present VStore, a data store for supporting fast, resource-efficient
analytics over large archival videos. VStore manages video ingestion, storage,
retrieval, and consumption. It controls video formats along the video data
path. It is challenged by i) the huge combinatorial space of video format
knobs; ii) the complex impacts of these knobs and their high profiling cost;
iii) optimizing for multiple resource types. It explores an idea called
backward derivation of configuration: in the opposite direction along the video
data path, VStore passes the video quantity and quality expected by analytics
backward to retrieval, to storage, and to ingestion. In this process, VStore
derives an optimal set of video formats, optimizing for different resources in
a progressive manner. VStore automatically derives large, complex
configurations consisting of more than one hundred knobs over tens of video
formats. In response to queries, VStore selects video formats catering to the
executed operators and the target accuracy. It streams video data from disks
through decoder to operators. It runs queries as fast as 362x of video
realtime.
","[{'version': 'v1', 'created': 'Wed, 3 Oct 2018 15:31:36 GMT'}, {'version': 'v2', 'created': 'Sat, 13 Oct 2018 21:03:20 GMT'}, {'version': 'v3', 'created': 'Sun, 17 Feb 2019 19:31:41 GMT'}]",2019-02-19,"[['Xu', 'Tiantu', ''], ['Botelho', 'Luis Materon', ''], ['Lin', 'Felix Xiaozhu', '']]","['Video Analytics', 'Data Store', 'Deep Neural Networks']"
6427,2107.01607,Fabio Henrique Viduani Martinez,Eloi Araujo and Luiz Rozante and Diego P. Rubert and Fabio V. Martinez,Algorithms for normalized multiple sequence alignments,"24 pages, 2 figures, 5 algorithms",,10.4230/LIPIcs.ISAAC.2021.40,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  Sequence alignment supports numerous tasks in bioinformatics, natural
language processing, pattern recognition, social sciences, and others fields.
While the alignment of two sequences may be performed swiftly in many
applications, the simultaneous alignment of multiple sequences proved to be
naturally more intricate. Although most multiple sequence alignment (MSA)
formulations are NP-hard, several approaches have been developed, as they can
outperform pairwise alignment methods or are necessary for some applications.
  Taking into account not only similarities but also the lengths of the
compared sequences (i.e. normalization) can provide better alignment results
than both unnormalized or post-normalized approaches. While some normalized
methods have been developed for pairwise sequence alignment, none have been
proposed for MSA. This work is a first effort towards the development of
normalized methods for MSA.
  We discuss multiple aspects of normalized multiple sequence alignment (NMSA).
We define three new criteria for computing normalized scores when aligning
multiple sequences, showing the NP-hardness and exact algorithms for solving
the NMSA using those criteria. In addition, we provide approximation algorithms
for MSA and NMSA for some classes of scoring matrices.
","[{'version': 'v1', 'created': 'Sun, 4 Jul 2021 12:45:20 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Dec 2021 12:47:03 GMT'}]",2021-12-06,"[['Araujo', 'Eloi', ''], ['Rozante', 'Luiz', ''], ['Rubert', 'Diego P.', ''], ['Martinez', 'Fabio V.', '']]","['Multiple sequence alignment (MSA)', 'Normalized multiple sequence alignment (NMSA)', 'Algorithmsand complexity']"
6428,2007.13592,Jorge Melegati,Jorge Melegati and Xiaofeng Wang,Case Survey Studies in Software Engineering Research,"Accepted for presentation at ACM / IEEE International Symposium on
  Empirical Software Engineering and Measurement (ESEM) (ESEM '20)",,10.1145/3382494.3410683,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Given the social aspects of Software Engineering (SE), in the
last twenty years, researchers from the field started using research methods
common in social sciences such as case study, ethnography, and grounded theory.
More recently, case survey, another imported research method, has seen its
increasing use in SE studies. It is based on existing case studies reported in
the literature and intends to harness the generalizability of survey and the
depth of case study. However, little is known on how case survey has been
applied in SE research, let alone guidelines on how to employ it properly.
Aims: This article aims to provide a better understanding of how case survey
has been applied in Software Engineering research. Method: To address this
knowledge gap, we performed a systematic mapping study and analyzed 12 Software
Engineering studies that used the case survey method. Results: Our findings
show that these studies presented a heterogeneous understanding of the approach
ranging from secondary studies to primary inquiries focused on a large number
of instances of a research phenomenon. They have not applied the case survey
method consistently as defined in the seminal methodological papers.
Conclusions: We conclude that a set of clearly defined guidelines are needed on
how to use case survey in SE research, to ensure the quality of the studies
employing this approach and to provide a set of clearly defined criteria to
evaluate such work.
","[{'version': 'v1', 'created': 'Mon, 27 Jul 2020 14:18:59 GMT'}]",2020-07-28,"[['Melegati', 'Jorge', ''], ['Wang', 'Xiaofeng', '']]","['case surveys', 'empirical software engineering', 'research methods']"
6429,2012.03787,Eric Pahl,"Eric S. Pahl, W. Nick Street, Hans J. Johnson, Alan I. Reed","A predictive model for kidney transplant graft survival using machine
  learning","This work has been published: Pahl ES, Street WN, Johnson HJ, Reed
  AI. ""A Predictive Model for Kidney Transplant Graft Survival Using Machine
  Learning."" 4th International Conference on Computer Science and Information
  Technology (COMIT 2020), November 28-29, 2020, Dubai, UAE. ISBN:
  978-1-925953-30-5. Volume 10, Number 16.10.5121/csit.2020.101609","4th International Conference on Computer Science and Information
  Technology (COMIT 2020), November 28-29, 2020, Dubai, UAE. ISBN:
  978-1-925953-30-5. Volume 10, Number 16",10.5121/csit.2020.101609,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Kidney transplantation is the best treatment for end-stage renal failure
patients. The predominant method used for kidney quality assessment is the Cox
regression-based, kidney donor risk index. A machine learning method may
provide improved prediction of transplant outcomes and help decision-making. A
popular tree-based machine learning method, random forest, was trained and
evaluated with the same data originally used to develop the risk index (70,242
observations from 1995-2005). The random forest successfully predicted an
additional 2,148 transplants than the risk index with equal type II error rates
of 10%. Predicted results were analyzed with follow-up survival outcomes up to
240 months after transplant using Kaplan-Meier analysis and confirmed that the
random forest performed significantly better than the risk index (p<0.05). The
random forest predicted significantly more successful and longer-surviving
transplants than the risk index. Random forests and other machine learning
models may improve transplant decisions.
","[{'version': 'v1', 'created': 'Mon, 7 Dec 2020 15:29:51 GMT'}]",2020-12-08,"[['Pahl', 'Eric S.', ''], ['Street', 'W. Nick', ''], ['Johnson', 'Hans J.', ''], ['Reed', 'Alan I.', '']]","['Kidney Transplant', 'Decision Support', 'Random Forest', 'Health Informatics', 'Clinical Decision Making', 'Machine Learning & Survival Analysis']"
6430,1809.05958,Shuo Li,"S.Li, M.M.O.I. Ozo, C. De Wagter, G.C.H.E. de Croon","Autonomous drone race: A computationally efficient vision-based
  navigation and control strategy",,,10.1016/j.robot.2020.103621,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Drone racing is becoming a popular sport where human pilots have to control
their drones to fly at high speed through complex environments and pass a
number of gates in a pre-defined sequence. In this paper, we develop an
autonomous system for drones to race fully autonomously using only onboard
resources. Instead of commonly used visual navigation methods, such as
simultaneous localization and mapping and visual inertial odometry, which are
computationally expensive for micro aerial vehicles (MAVs), we developed the
highly efficient snake gate detection algorithm for visual navigation, which
can detect the gate at 20HZ on a Parrot Bebop drone. Then, with the gate
detection result, we developed a robust pose estimation algorithm which has
better tolerance to detection noise than a state-of-the-art perspective-n-point
method. During the race, sometimes the gates are not in the drone's field of
view. For this case, a state prediction-based feed-forward control strategy is
developed to steer the drone to fly to the next gate. Experiments show that the
drone can fly a half-circle with 1.5m radius within 2 seconds with only 30cm
error at the end of the circle without any position feedback. Finally, the
whole system is tested in a complex environment (a showroom in the faculty of
Aerospace Engineering, TU Delft). The result shows that the drone can complete
the track of 15 gates with a speed of 1.5m/s which is faster than the speeds
exhibited at the 2016 and 2017 IROS autonomous drone races.
","[{'version': 'v1', 'created': 'Sun, 16 Sep 2018 21:17:52 GMT'}, {'version': 'v2', 'created': 'Sun, 15 Dec 2019 16:00:55 GMT'}]",2021-09-23,"[['Li', 'S.', ''], ['Ozo', 'M. M. O. I.', ''], ['De Wagter', 'C.', ''], ['de Croon', 'G. C. H. E.', '']]","['micro aerial vehicle', 'visual navigation', 'autonomous drone race']"
6431,cs/0511055,Guido Governatori,"Grigoris Antoniou, David Billington, Guido Governatori, and Michael J.
  Maher",Embedding Defeasible Logic into Logic Programming,To appear in Theory and Practice of Logic Programming,"Theory and Practice of Logic Programming, 6, 6 (2006): 703-735",10.1017/S147106840600277,,cs.LO,,"  Defeasible reasoning is a simple but efficient approach to nonmonotonic
reasoning that has recently attracted considerable interest and that has found
various applications. Defeasible logic and its variants are an important family
of defeasible reasoning methods. So far no relationship has been established
between defeasible logic and mainstream nonmonotonic reasoning approaches.
  In this paper we establish close links to known semantics of logic programs.
In particular, we give a translation of a defeasible theory D into a
meta-program P(D). We show that under a condition of decisiveness, the
defeasible consequences of D correspond exactly to the sceptical conclusions of
P(D) under the stable model semantics. Without decisiveness, the result holds
only in one direction (all defeasible consequences of D are included in all
stable models of P(D)). If we wish a complete embedding for the general case,
we need to use the Kunen semantics of P(D), instead.
","[{'version': 'v1', 'created': 'Tue, 15 Nov 2005 10:39:38 GMT'}]",2012-06-26,"[['Antoniou', 'Grigoris', ''], ['Billington', 'David', ''], ['Governatori', 'Guido', ''], ['Maher', 'Michael J.', '']]","['Defeasible logic', 'stable semantics', 'Kunen semantics', 'non-monotonic logic']"
6432,1606.02144,Robert Richardson,"Robert R. Richardson, Shi Zhao and David A. Howey","On-board monitoring of 2-D spatially-resolved temperatures in
  cylindrical lithium-ion batteries: Part I. Low-order thermal modelling","13 pages, 6 figures, submitted to the Journal of Power Sources, 2016",,10.1016/j.jpowsour.2016.06.103,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Estimating the temperature distribution within Li-ion batteries during
operation is critical for safety and control purposes. Although existing
control-oriented thermal models - such as thermal equivalent circuits (TEC) -
are computationally efficient, they only predict average temperatures, and are
unable to predict the spatially resolved temperature distribution throughout
the cell. We present a low-order 2D thermal model of a cylindrical battery
based on a Chebyshev spectral-Galerkin (SG) method, capable of predicting the
full temperature distribution with a similar efficiency to a TEC. The model
accounts for transient heat generation, anisotropic heat conduction, and
non-homogeneous convection boundary conditions. The accuracy of the model is
validated through comparison with finite element simulations, which show that
the 2-D temperature field (r, z) of a large format (64 mm diameter) cell can be
accurately modelled with as few as 4 states. Furthermore, the performance of
the model for a range of Biot numbers is investigated via frequency analysis.
For larger cells or highly transient thermal dynamics, the model order can be
increased for improved accuracy. The incorporation of this model in a state
estimation scheme with experimental validation against thermocouple
measurements is presented in the companion contribution (Part II).
","[{'version': 'v1', 'created': 'Mon, 6 Jun 2016 15:02:16 GMT'}]",2016-06-28,"[['Richardson', 'Robert R.', ''], ['Zhao', 'Shi', ''], ['Howey', 'David A.', '']]","['Lithium-ion battery', 'thermal model', 'spectral methods', 'low-order modelling', 'temperature estimation']"
6433,1810.06033,Xutan Peng,"Chen Li, Xutan Peng, Shanghang Zhang, Hao Peng, Philip S. Yu, Min He,
  Linfeng Du, Lihong Wang","Modeling relation paths for knowledge base completion via joint
  adversarial training",Accepted by Knowledge-Based Systems,,10.1016/j.knosys.2020.105865,,cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge Base Completion (KBC), which aims at determining the missing
relations between entity pairs, has received increasing attention in recent
years. Most existing KBC methods focus on either embedding the Knowledge Base
(KB) into a specific semantic space or leveraging the joint probability of
Random Walks (RWs) on multi-hop paths. Only a few unified models take both
semantic and path-related features into consideration with adequacy. In this
paper, we propose a novel method to explore the intrinsic relationship between
the single relation (i.e. 1-hop path) and multi-hop paths between paired
entities. We use Hierarchical Attention Networks (HANs) to select important
relations in multi-hop paths and encode them into low-dimensional vectors. By
treating relations and multi-hop paths as two different input sources, we use a
feature extractor, which is shared by two downstream components (i.e. relation
classifier and source discriminator), to capture shared/similar information
between them. By joint adversarial training, we encourage our model to extract
features from the multi-hop paths which are representative for relation
completion. We apply the trained model (except for the source discriminator) to
several large-scale KBs for relation completion. Experimental results show that
our method outperforms existing path information-based approaches. Since each
sub-module of our model can be well interpreted, our model can be applied to a
large number of relation learning tasks.
","[{'version': 'v1', 'created': 'Sun, 14 Oct 2018 13:26:34 GMT'}, {'version': 'v2', 'created': 'Tue, 19 May 2020 08:55:36 GMT'}]",2020-05-20,"[['Li', 'Chen', ''], ['Peng', 'Xutan', ''], ['Zhang', 'Shanghang', ''], ['Peng', 'Hao', ''], ['Yu', 'Philip S.', ''], ['He', 'Min', ''], ['Du', 'Linfeng', ''], ['Wang', 'Lihong', '']]","['Joint Adversarial Training', 'Hierarchical Attention Mechanism', 'Knowledge Base Completion']"
6434,2005.03241,Ziaur Rahman,"Md. Emran, Humaun Kabir, Ziaur Rahman, Nazrul Islam","Enhancing Software Development Process Using Automated Adaptation of
  Object Ensembles","6 pages, 5 figures, 2 tables published in the IEEE Sponsored
  Conferences",2016 IEEE EICT Conference,10.1109/EICT.2015.7392015,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software development has been changing rapidly. This development process can
be influenced through changing developer friendly approaches. We can save time
consumption and accelerate the development process if we can automatically
guide programmer during software development. There are some approaches that
recommended relevant code snippets and APIitems to the developer. Some
approaches apply general code, searching techniques and some approaches use an
online based repository mining strategies. But it gets quite difficult to help
programmers when they need particular type conversion problems. More
specifically when they want to adapt existing interfaces according to their
expectation. One of the familiar triumph to guide developers in such situation
is adapting collections and arrays through automated adaptation of object
ensembles. But how does it help to a novice developer in real time software
development that is not explicitly specified? In this paper, we have developed
a system that works as a plugin-tool integrated with a particular Data Mining
Integrated environment (DMIE) to recommend relevant interface while they seek
for a type conversion situation. We have a mined repository of respective
adapter classes and related APIs from where developer, search their query and
get their result using the relevant transformer classes. The system that
recommends developers titled automated objective ensembles (AOE plugin).From
the investigation as we have ever made, we can see that our approach much
better than some of the existing approaches.
","[{'version': 'v1', 'created': 'Thu, 7 May 2020 04:17:19 GMT'}]",2020-05-08,"[['Emran', 'Md.', ''], ['Kabir', 'Humaun', ''], ['Rahman', 'Ziaur', ''], ['Islam', 'Nazrul', '']]","['Adaptation of Object Ensembles', 'Source Repository', 'Software Developing Process', 'Data Mining Integrated Environment']"
6435,2110.00998,Laila Rasmy,"Laila Rasmy, Jie Zhu, Zhiheng Li, Xin Hao, Hong Thoai Tran, Yujia
  Zhou, Firat Tiryaki, Yang Xiang, Hua Xu, Degui Zhi","Simple Recurrent Neural Networks is all we need for clinical events
  predictions using EHR data","This podium abstract was peer-reviewed and accepted in 2018, and
  presented at Medinfo-2019 in Leon France in August 2019",,10.13140/RG.2.2.13199.51368,,cs.LG cs.AI cs.CL cs.NE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Recently, there is great interest to investigate the application of deep
learning models for the prediction of clinical events using electronic health
records (EHR) data. In EHR data, a patient's history is often represented as a
sequence of visits, and each visit contains multiple events. As a result, deep
learning models developed for sequence modeling, like recurrent neural networks
(RNNs) are common architecture for EHR-based clinical events predictive models.
While a large variety of RNN models were proposed in the literature, it is
unclear if complex architecture innovations will offer superior predictive
performance. In order to move this field forward, a rigorous evaluation of
various methods is needed. In this study, we conducted a thorough benchmark of
RNN architectures in modeling EHR data. We used two prediction tasks: the risk
for developing heart failure and the risk of early readmission for inpatient
hospitalization. We found that simple gated RNN models, including GRUs and
LSTMs, often offer competitive results when properly tuned with Bayesian
Optimization, which is in line with similar to findings in the natural language
processing (NLP) domain. For reproducibility, Our codebase is shared at
https://github.com/ZhiGroup/pytorch_ehr.
","[{'version': 'v1', 'created': 'Sun, 3 Oct 2021 13:07:23 GMT'}]",2021-10-05,"[['Rasmy', 'Laila', ''], ['Zhu', 'Jie', ''], ['Li', 'Zhiheng', ''], ['Hao', 'Xin', ''], ['Tran', 'Hong Thoai', ''], ['Zhou', 'Yujia', ''], ['Tiryaki', 'Firat', ''], ['Xiang', 'Yang', ''], ['Xu', 'Hua', ''], ['Zhi', 'Degui', '']]","['Deep Learning', 'Patient-Specific Modeling', 'Electronic Health Records']"
6436,2009.13154,Matias Quintana,"Matias Quintana, Stefano Schiavon, Kwok Wai Tham, and Clayton Miller","Balancing thermal comfort datasets: We GAN, but should we?","10 pages, submitted and accepted to BuildSys'20
  (http://buildsys.acm.org/2020/)",,10.1145/3408308.3427612,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Thermal comfort assessment for the built environment has become more
available to analysts and researchers due to the proliferation of sensors and
subjective feedback methods. These data can be used for modeling comfort
behavior to support design and operations towards energy efficiency and
well-being. By nature, occupant subjective feedback is imbalanced as indoor
conditions are designed for comfort, and responses indicating otherwise are
less common. This situation creates a scenario for the machine learning
workflow where class balancing as a pre-processing step might be valuable for
developing predictive thermal comfort classification models with
high-performance. This paper investigates the various thermal comfort dataset
class balancing techniques from the literature and proposes a modified
conditional Generative Adversarial Network (GAN), $\texttt{comfortGAN}$, to
address this imbalance scenario. These approaches are applied to three publicly
available datasets, ranging from 30 and 67 participants to a global collection
of thermal comfort datasets, with 1,474; 2,067; and 66,397 data points,
respectively. This work finds that a classification model trained on a balanced
dataset, comprised of real and generated samples from $\texttt{comfortGAN}$,
has higher performance (increase between 4% and 17% in classification accuracy)
than other augmentation methods tested. However, when classes representing
discomfort are merged and reduced to three, better imbalanced performance is
expected, and the additional increase in performance by $\texttt{comfortGAN}$
shrinks to 1-2%. These results illustrate that class balancing for thermal
comfort modeling is beneficial using advanced techniques such as GANs, but its
value is diminished in certain scenarios. A discussion is provided to assist
potential users in determining which scenarios this process is useful and which
method works best.
","[{'version': 'v1', 'created': 'Mon, 28 Sep 2020 09:09:34 GMT'}]",2020-11-25,"[['Quintana', 'Matias', ''], ['Schiavon', 'Stefano', ''], ['Tham', 'Kwok Wai', ''], ['Miller', 'Clayton', '']]","['Data Augmentation', 'Class Balancing', 'Thermal Comfort', 'Generative Adversarial Network', 'Survey', 'Buildings', 'Machine Learning']"
6437,1909.07704,Vaibhav Bansal,"Vaibhav Bansal, Stuart James and Alessio Del Bue","re-OBJ: Jointly Learning the Foreground and Background for Object
  Instance Re-identification",Accepted to ICIAP 2019 and awarded the Best Student Paper,,10.1007/978-3-030-30645-8_37,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Conventional approaches to object instance re-identification rely on matching
appearances of the target objects among a set of frames. However, learning
appearances of the objects alone might fail when there are multiple objects
with similar appearance or multiple instances of same object class present in
the scene. This paper proposes that partial observations of the background can
be utilized to aid in the object re-identification task for a rigid scene,
especially a rigid environment with a lot of reoccurring identical models of
objects. Using an extension to the Mask R-CNN architecture, we learn to encode
the important and distinct information in the background jointly with the
foreground relevant to rigid real-world scenarios such as an indoor environment
where objects are static and the camera moves around the scene. We demonstrate
the effectiveness of our joint visual feature in the re-identification of
objects in the ScanNet dataset and show a relative improvement of around 28.25%
in the rank-1 accuracy over the deepSort method.
","[{'version': 'v1', 'created': 'Tue, 17 Sep 2019 10:36:12 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Sep 2019 17:21:55 GMT'}]",2019-09-24,"[['Bansal', 'Vaibhav', ''], ['James', 'Stuart', ''], ['Del Bue', 'Alessio', '']]","['Re-identification', 'Object detection', 'Multi-view', 'Triplet loss']"
6438,1910.13796,Niall O' Mahony,"Niall O' Mahony, Sean Campbell, Anderson Carvalho, Suman
  Harapanahalli, Gustavo Velasco-Hernandez, Lenka Krpalkova, Daniel Riordan,
  Joseph Walsh",Deep Learning vs. Traditional Computer Vision,,"in Advances in Computer Vision Proceedings of the 2019 Computer
  Vision Conference (CVC). Springer Nature Switzerland AG, pp. 128-144",10.1007/978-3-030-17795-9,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep Learning has pushed the limits of what was possible in the domain of
Digital Image Processing. However, that is not to say that the traditional
computer vision techniques which had been undergoing progressive development in
years prior to the rise of DL have become obsolete. This paper will analyse the
benefits and drawbacks of each approach. The aim of this paper is to promote a
discussion on whether knowledge of classical computer vision techniques should
be maintained. The paper will also explore how the two sides of computer vision
can be combined. Several recent hybrid methodologies are reviewed which have
demonstrated the ability to improve computer vision performance and to tackle
problems not suited to Deep Learning. For example, combining traditional
computer vision techniques with Deep Learning has been popular in emerging
domains such as Panoramic Vision and 3D vision for which Deep Learning models
have not yet been fully optimised
","[{'version': 'v1', 'created': 'Wed, 30 Oct 2019 12:25:10 GMT'}]",2019-10-31,"[['Mahony', ""Niall O'"", ''], ['Campbell', 'Sean', ''], ['Carvalho', 'Anderson', ''], ['Harapanahalli', 'Suman', ''], ['Velasco-Hernandez', 'Gustavo', ''], ['Krpalkova', 'Lenka', ''], ['Riordan', 'Daniel', ''], ['Walsh', 'Joseph', '']]","['Computer Vision', 'Deep Learning', 'Hybrid techniques']"
6439,2108.07502,Xiaojing Zhong,"Xiaojing Zhong, Zhonghua Wu, Taizhe Tan, Guosheng Lin, Qingyao Wu",MV-TON: Memory-based Video Virtual Try-on network,,,10.1145/3474085.3475269,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the development of Generative Adversarial Network, image-based virtual
try-on methods have made great progress. However, limited work has explored the
task of video-based virtual try-on while it is important in real-world
applications. Most existing video-based virtual try-on methods usually require
clothing templates and they can only generate blurred and low-resolution
results. To address these challenges, we propose a Memory-based Video virtual
Try-On Network (MV-TON), which seamlessly transfers desired clothes to a target
person without using any clothing templates and generates high-resolution
realistic videos. Specifically, MV-TON consists of two modules: 1) a try-on
module that transfers the desired clothes from model images to frame images by
pose alignment and region-wise replacing of pixels; 2) a memory refinement
module that learns to embed the existing generated frames into the latent space
as external memory for the following frame generation. Experimental results
show the effectiveness of our method in the video virtual try-on task and its
superiority over other existing methods.
","[{'version': 'v1', 'created': 'Tue, 17 Aug 2021 08:35:23 GMT'}]",2021-08-18,"[['Zhong', 'Xiaojing', ''], ['Wu', 'Zhonghua', ''], ['Tan', 'Taizhe', ''], ['Lin', 'Guosheng', ''], ['Wu', 'Qingyao', '']]","['virtual try-on', 'video generation', 'memory aggregation']"
6440,2202.03477,Tarik A. Rashid,"Bestan B. Maaroof, Tarik A. Rashid, Jaza M. Abdulla, Bryar A. Hassan,
  Abeer Alsadoon, Mokhtar Mohammadi, Mohammad Khishe, Seyedali Mirjalili","Current Studies and Applications of Shuffled Frog Leaping Algorithm: A
  Review",28 pages,"Arch Computat Methods Eng, 2022",10.1007/s11831-021-09707-2,,cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Shuffled Frog Leaping Algorithm (SFLA) is one of the most widespread
algorithms. It was developed by Eusuff and Lansey in 2006. SFLA is a
population-based metaheuristic algorithm that combines the benefits of memetics
with particle swarm optimization. It has been used in various areas, especially
in engineering problems due to its implementation easiness and limited
variables. Many improvements have been made to the algorithm to alleviate its
drawbacks, whether they were achieved through modifications or hybridizations
with other well-known algorithms. This paper reviews the most relevant works on
this algorithm. An overview of the SFLA is first conducted, followed by the
algorithm's most recent modifications and hybridizations. Next, recent
applications of the algorithm are discussed. Then, an operational framework of
SLFA and its variants is proposed to analyze their uses on different cohorts of
applications. Finally, future improvements to the algorithm are suggested. The
main incentive to conduct this survey to provide useful information about the
SFLA to researchers interested in working on the algorithm's enhancement or
application
","[{'version': 'v1', 'created': 'Thu, 27 Jan 2022 13:26:26 GMT'}]",2022-02-09,"[['Maaroof', 'Bestan B.', ''], ['Rashid', 'Tarik A.', ''], ['Abdulla', 'Jaza M.', ''], ['Hassan', 'Bryar A.', ''], ['Alsadoon', 'Abeer', ''], ['Mohammadi', 'Mokhtar', ''], ['Khishe', 'Mohammad', ''], ['Mirjalili', 'Seyedali', '']]","['Shuffled Leap-Frog Algorithm (SFLA)', 'Hybridization', 'Modification Application', 'Review']"
6441,2006.12582,Mohammad Majdi,"Mohammad Sadegh Majdi, Emad Fatemizadeh",Laplacian Mixture Model Point Based Registration,,"2015 9th Iranian Conference on Machine Vision and Image Processing
  (MVIP), Tehran, 2015, pp. 57-60",10.1109/IranianMVIP.2015.7397504,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Point base registration is an important part in many machine VISIOn
applications, medical diagnostics, agricultural studies etc. The goal of point
set registration is to find correspondences between different data sets and
estimate the appropriate transformation that can map one set to another. Here
we introduce a novel method for matching of different data sets based on
Laplacian distribution. We consider the alignment of two point sets as
probability density estimation problem. By using maximum likelihood methods we
try to fit the Laplacian mixture model (LMM) centroids (source point set) to
the data point set.
","[{'version': 'v1', 'created': 'Mon, 22 Jun 2020 19:46:41 GMT'}]",2020-06-24,"[['Majdi', 'Mohammad Sadegh', ''], ['Fatemizadeh', 'Emad', '']]","['registration', 'correspondence', 'alignment', 'rigid', 'laplacian', 'mixture model', 'affine', 'point base']"
6442,2112.06609,Jonathan Prieto-Cubides,Jonathan Prieto-Cubides,On Homotopy of Walks and Spherical Maps in Homotopy Type Theory,"14 pages. Part of the 11th ACM SIGPLAN International Conference on
  Certified Programs and Proofs CPP'22. Fixed some urls in the references and
  typos",,10.1145/3497775.3503671,,cs.LO math.CO,http://creativecommons.org/licenses/by-sa/4.0/,"  We work with combinatorial maps to represent graph embeddings into surfaces
up to isotopy. The surface in which the graph is embedded is left implicit in
this approach. The constructions herein are proof-relevant and stated with a
subset of the language of homotopy type theory.
  This article presents a refinement of one characterisation of embeddings in
the sphere, called spherical maps, of connected and directed multigraphs with
discrete node sets. A combinatorial notion of homotopy for walks and the normal
form of walks under a reduction relation is introduced. The first
characterisation of spherical maps states that a graph can be embedded in the
sphere if any pair of walks with the same endpoints are merely walk-homotopic.
The refinement of this definition filters out any walk with inner cycles. As we
prove in one of the lemmas, if a spherical map is given for a graph with a
discrete node set, then any walk in the graph is merely walk-homotopic to a
normal form.
  The proof assistant Agda contributed to formalising the results recorded in
this article.
","[{'version': 'v1', 'created': 'Mon, 13 Dec 2021 12:43:17 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Dec 2021 17:28:07 GMT'}, {'version': 'v3', 'created': 'Thu, 16 Dec 2021 23:25:52 GMT'}]",2021-12-20,"[['Prieto-Cubides', 'Jonathan', '']]","['graph maps', 'walk normal forms', 'HoTT', 'Agda']"
6443,2101.00238,Hui Zhong,"Hui Zhong, Zaiyi Chen, Chuan Qin, Zai Huang, Vincent W. Zheng, Tong
  Xu, Enhong Chen",Adam revisited: a weighted past gradients perspective,"Zhong, Hui, et al. ""Adam revisited: a weighted past gradients
  perspective."" Frontiers of Computer Science 14.5 (2020): 1-16","Front. Comput. Sci. 14, 145309 (2020)",10.1007/s11704-019-8457-x,,cs.LG math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Adaptive learning rate methods have been successfully applied in many fields,
especially in training deep neural networks. Recent results have shown that
adaptive methods with exponential increasing weights on squared past gradients
(i.e., ADAM, RMSPROP) may fail to converge to the optimal solution. Though many
algorithms, such as AMSGRAD and ADAMNC, have been proposed to fix the
non-convergence issues, achieving a data-dependent regret bound similar to or
better than ADAGRAD is still a challenge to these methods. In this paper, we
propose a novel adaptive method weighted adaptive algorithm (WADA) to tackle
the non-convergence issues. Unlike AMSGRAD and ADAMNC, we consider using a
milder growing weighting strategy on squared past gradient, in which weights
grow linearly. Based on this idea, we propose weighted adaptive gradient method
framework (WAGMF) and implement WADA algorithm on this framework. Moreover, we
prove that WADA can achieve a weighted data-dependent regret bound, which could
be better than the original regret bound of ADAGRAD when the gradients decrease
rapidly. This bound may partially explain the good performance of ADAM in
practice. Finally, extensive experiments demonstrate the effectiveness of WADA
and its variants in comparison with several variants of ADAM on training convex
problems and deep neural networks.
","[{'version': 'v1', 'created': 'Fri, 1 Jan 2021 14:01:52 GMT'}]",2021-01-05,"[['Zhong', 'Hui', ''], ['Chen', 'Zaiyi', ''], ['Qin', 'Chuan', ''], ['Huang', 'Zai', ''], ['Zheng', 'Vincent W.', ''], ['Xu', 'Tong', ''], ['Chen', 'Enhong', '']]","['adaptivelearningratemethods', 'stochasticgradient descent', 'online learning']"
6444,2009.03001,Alberto Gutierrez-Torre,"Alberto Gutierrez-Torre, Josep Ll. Berral, David Buchaca, Marc
  Guevara, Albert Soret, David Carrera","Improving Maritime Traffic Emission Estimations on Missing Data with
  CRBMs","12 pages, 7 figures. Postprint accepted manuscript, find the full
  version at Engineering Applications of Artificial Intelligence
  (https://doi.org/10.1016/j.engappai.2020.103793)","Engineering Applications of Artificial Intelligence Volume 94,
  September 2020, 103793",10.1016/j.engappai.2020.103793,,cs.CY cs.CE cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Maritime traffic emissions are a major concern to governments as they heavily
impact the Air Quality in coastal cities. Ships use the Automatic
Identification System (AIS) to continuously report position and speed among
other features, and therefore this data is suitable to be used to estimate
emissions, if it is combined with engine data. However, important ship features
are often inaccurate or missing. State-of-the-art complex systems, like CALIOPE
at the Barcelona Supercomputing Center, are used to model Air Quality. These
systems can benefit from AIS based emission models as they are very precise in
positioning the pollution. Unfortunately, these models are sensitive to missing
or corrupted data, and therefore they need data curation techniques to
significantly improve the estimation accuracy. In this work, we propose a
methodology for treating ship data using Conditional Restricted Boltzmann
Machines (CRBMs) plus machine learning methods to improve the quality of data
passed to emission models. Results show that we can improve the default methods
proposed to cover missing data. In our results, we observed that using our
method the models boosted their accuracy to detect otherwise undetectable
emissions. In particular, we used a real data-set of AIS data, provided by the
Spanish Port Authority, to estimate that thanks to our method, the model was
able to detect 45% of additional emissions, of additional emissions,
representing 152 tonnes of pollutants per week in Barcelona and propose new
features that may enhance emission modeling.
","[{'version': 'v1', 'created': 'Mon, 7 Sep 2020 10:32:43 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Sep 2020 09:04:42 GMT'}]",2020-09-11,"[['Gutierrez-Torre', 'Alberto', ''], ['Berral', 'Josep Ll.', ''], ['Buchaca', 'David', ''], ['Guevara', 'Marc', ''], ['Soret', 'Albert', ''], ['Carrera', 'David', '']]","['Data cleaning', 'AIS', 'Emission modeling', 'CRBM', 'Ship time series', 'GPS']"
6445,1401.3446,Shiplu Hawlader,Md. Shiplu Hawlader and Saifuddin Md. Tareeq,"Amino Acid Interaction Network Prediction using Multi-objective
  Optimization",,,10.5121/csit.2014.4113,,cs.CE cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Protein can be represented by amino acid interaction network. This network is
a graph whose vertices are the proteins amino acids and whose edges are the
interactions between them. This interaction network is the first step of
proteins three-dimensional structure prediction. In this paper we present a
multi-objective evolutionary algorithm for interaction prediction and ant
colony probabilistic optimization algorithm is used to confirm the interaction.
","[{'version': 'v1', 'created': 'Wed, 15 Jan 2014 04:59:08 GMT'}]",2014-01-16,"[['Hawlader', 'Md. Shiplu', ''], ['Tareeq', 'Saifuddin Md.', '']]","['Protein Structure', 'Interaction Network', 'Multi-objective Optimization', 'Genetic Algorithm', 'Ant Colony Optimization']"
6446,2102.01882,Ammar Kamoona,"Ammar Mansoor Kamoona, Amirali Khodadadian Gostar, Alireza
  Bab-Hadiashar, Reza Hoseinnezhad","Evaluation of Point Pattern Features for Anomaly Detection of Defect
  within Random Finite Set Framework",under review. 6 pages,,10.1109/ACCESS.2021.3130261,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Defect detection in the manufacturing industry is of utmost importance for
product quality inspection. Recently, optical defect detection has been
investigated as an anomaly detection using different deep learning methods.
However, the recent works do not explore the use of point pattern features,
such as SIFT for anomaly detection using the recently developed set-based
methods. In this paper, we present an evaluation of different point pattern
feature detectors and descriptors for defect detection application. The
evaluation is performed within the random finite set framework. Handcrafted
point pattern features, such as SIFT as well as deep features are used in this
evaluation. Random finite set-based defect detection is compared with
state-of-the-arts anomaly detection methods. The results show that using point
pattern features, such as SIFT as data points for random finite set-based
anomaly detection achieves the most consistent defect detection accuracy on the
MVTec-AD dataset.
","[{'version': 'v1', 'created': 'Wed, 3 Feb 2021 05:30:32 GMT'}]",2021-11-29,"[['Kamoona', 'Ammar Mansoor', ''], ['Gostar', 'Amirali Khodadadian', ''], ['Bab-Hadiashar', 'Alireza', ''], ['Hoseinnezhad', 'Reza', '']]","['defect detection', 'anomaly detection', 'random finite set', 'keypoint detection.  I']"
6447,1710.07778,Hua Wang,"P. Vimalachandran, H. Wang, Y. Zhang and G. Zhuo","The Australian PCEHR system: Ensuring Privacy and Security through an
  Improved Access Control Mechanism",,"EAI Endorsed Transactions on Scalable Information Systems 16(8):
  e4, 2016",10.4108/eai.9-8-2016.151633,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An Electronic Health Record (EHR) is designed to store diverse data
accurately from a range of health care providers and to capture the status of a
patient by a range of health care providers across time. Realising the numerous
benefits of the system, EHR adoption is growing globally and many countries
invest heavily in electronic health systems. In Australia, the Government
invested $467 million to build key components of the Personally Controlled
Electronic Health Record (PCEHR) system in July 2012. However, in the last
three years, the uptake from individuals and health care providers has not been
satisfactory. Unauthorised access of the PCEHR was one of the major barriers.
We propose an improved access control model for the PCEHR system to resolve the
unauthorised access issue. We discuss the unauthorised access issue with real
examples and present a potential solution to overcome the issue to make the
PCEHR system a success in Australia.
","[{'version': 'v1', 'created': 'Sat, 21 Oct 2017 09:53:03 GMT'}]",2017-10-24,"[['Vimalachandran', 'P.', ''], ['Wang', 'H.', ''], ['Zhang', 'Y.', ''], ['Zhuo', 'G.', '']]","['EHR security', 'PCEHR privacy', 'information security']"
6448,1809.06190,Laurenz Aldu Cornelissen Mr.,"Laurenz A Cornelissen, Richard J Barnett, Petrus Schoonwinkel, Brent
  D. Eichstadt, Hluma B. Magodla",A Network Topology Approach to Bot Classification,,,10.1145/3278681.3278692,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated social agents, or bots, are increasingly becoming a problem on
social media platforms. There is a growing body of literature and multiple
tools to aid in the detection of such agents on online social networking
platforms. We propose that the social network topology of a user would be
sufficient to determine whether the user is a automated agent or a human. To
test this, we use a publicly available dataset containing users on Twitter
labelled as either automated social agent or human. Using an unsupervised
machine learning approach, we obtain a detection accuracy rate of 70%.
","[{'version': 'v1', 'created': 'Mon, 17 Sep 2018 13:29:00 GMT'}]",2018-09-18,"[['Cornelissen', 'Laurenz A', ''], ['Barnett', 'Richard J', ''], ['Schoonwinkel', 'Petrus', ''], ['Eichstadt', 'Brent D.', ''], ['Magodla', 'Hluma B.', '']]","['Automated Social Agent Detection', 'Social Network Theory', 'Unsupervised Machine Learning', 'Twitter']"
6449,2111.11509,Yassine Himeur,"Yassine Himeur, Aya Sayed, Abdullah Alsalemi, Faycal Bensaali, Abbes
  Amira, Iraklis Varlamis, Magdalini Eirinaki, Christos Sardianos and George
  Dimitrakopoulos","Blockchain-based Recommender Systems: Applications, Challenges and
  Future Opportunities","25 pages, 6 figures, 3 tables","Computer Science Review, Volume 43, February 2022, 100439",10.1016/j.cosrev.2021.100439,,cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Recommender systems have been widely used in different application domains
including energy-preservation, e-commerce, healthcare, social media, etc. Such
applications require the analysis and mining of massive amounts of various
types of user data, including demographics, preferences, social interactions,
etc. in order to develop accurate and precise recommender systems. Such
datasets often include sensitive information, yet most recommender systems are
focusing on the models' accuracy and ignore issues related to security and the
users' privacy. Despite the efforts to overcome these problems using different
risk reduction techniques, none of them has been completely successful in
ensuring cryptographic security and protection of the users' private
information. To bridge this gap, the blockchain technology is presented as a
promising strategy to promote security and privacy preservation in recommender
systems, not only because of its security and privacy salient features, but
also due to its resilience, adaptability, fault tolerance and trust
characteristics. This paper presents a holistic review of blockchain-based
recommender systems covering challenges, open issues and solutions.
Accordingly, a well-designed taxonomy is introduced to describe the security
and privacy challenges, overview existing frameworks and discuss their
applications and benefits when using blockchain before indicating opportunities
for future research.
","[{'version': 'v1', 'created': 'Mon, 22 Nov 2021 20:09:38 GMT'}]",2021-11-26,"[['Himeur', 'Yassine', ''], ['Sayed', 'Aya', ''], ['Alsalemi', 'Abdullah', ''], ['Bensaali', 'Faycal', ''], ['Amira', 'Abbes', ''], ['Varlamis', 'Iraklis', ''], ['Eirinaki', 'Magdalini', ''], ['Sardianos', 'Christos', ''], ['Dimitrakopoulos', 'George', '']]","['Recommender systemsblockchainsecurity', 'privacy preservationdecentralized', 'collaborative recommender systemsbig data', 'machine learningscalability']"
6450,2009.12589,Bilen Emek Abali,Bilen Emek Abali and Emilio Barchiesi,"Additive manufacturing introduced substructure and computational
  determination of metamaterials parameters by means of the asymptotic
  homogenization",,,10.1007/s00161-020-00941-w,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Metamaterials exhibit materials response deviation from conventional
elasticity. This phenomenon is captured by the generalized elasticity as a
result of extending the theory at the expense of introducing additional
parameters. These parameters are linked to internal length scales. Describing
on a macroscopic level a material possessing a substructure at a microscopic
length scale calls for introducing additional constitutive parameters.
Therefore, in principle, an asymptotic homogenization is feasible to determine
these parameters given an accurate knowledge on the substructure. Especially in
additive manufacturing, known under the infill ratio, topology optimization
introduces a substructure leading to higher order terms in mechanical response.
Hence, weight reduction creates a metamaterial with an accurately known
substructure. Herein, we develop a computational scheme using both scales for
numerically identifying metamaterials parameters. As a specific example we
apply it on a honeycomb substructure and discuss the infill ratio. Such a
computational approach is applicable to a wide class substructures and makes
use of open-source codes; we make it publicly available for a transparent
scientific exchange.
","[{'version': 'v1', 'created': 'Sat, 26 Sep 2020 13:29:27 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Oct 2020 07:14:20 GMT'}]",2021-06-10,"[['Abali', 'Bilen Emek', ''], ['Barchiesi', 'Emilio', '']]","['Metamaterials', 'Homogenization', 'Generalized mechanics', 'Finite Element Method (FEM)']"
6451,2208.00376,Yu Li,"Yu Li, Chun-Yen Chen, Dian Yu, Sam Davidson, Ryan Hou, Xun Yuan,
  Yinghua Tan, Derek Pham and Zhou Yu",Using Chatbots to Teach Languages,Accepted to Learning @ Scale 2022,,10.1145/3491140.3528329,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper reports on progress towards building an online language learning
tool to provide learners with conversational experience by using dialog systems
as conversation practice partners. Our system can adapt to users' language
proficiency on the fly. We also provide automatic grammar error feedback to
help users learn from their mistakes. According to our first adopters, our
system is entertaining and useful. Furthermore, we will provide the learning
technology community a large-scale conversation dataset on language learning
and grammar correction. Our next step is to make our system more adaptive to
user profile information by using reinforcement learning algorithms.
","[{'version': 'v1', 'created': 'Sun, 31 Jul 2022 07:01:35 GMT'}]",2022-08-02,"[['Li', 'Yu', ''], ['Chen', 'Chun-Yen', ''], ['Yu', 'Dian', ''], ['Davidson', 'Sam', ''], ['Hou', 'Ryan', ''], ['Yuan', 'Xun', ''], ['Tan', 'Yinghua', ''], ['Pham', 'Derek', ''], ['Yu', 'Zhou', '']]","['dialog systems', 'language learning', 'artificial intelligence']"
6452,1905.09372,Thomas Helmuth,"Thomas Helmuth, Edward Pantridge, Lee Spector",Lexicase Selection of Specialists,,,10.1145/3321707.3321875,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lexicase parent selection filters the population by considering one random
training case at a time, eliminating any individuals with errors for the
current case that are worse than the best error in the selection pool, until a
single individual remains. This process often stops before considering all
training cases, meaning that it will ignore the error values on any cases that
were not yet considered. Lexicase selection can therefore select specialist
individuals that have poor errors on some training cases, if they have great
errors on others and those errors come near the start of the random list of
cases used for the parent selection event in question. We hypothesize here that
selecting these specialists, which may have poor total error, plays an
important role in lexicase selection's observed performance advantages over
error-aggregating parent selection methods such as tournament selection, which
select specialists much less frequently. We conduct experiments examining this
hypothesis, and find that lexicase selection's performance and diversity
maintenance degrade when we deprive it of the ability of selecting specialists.
These findings help explain the improved performance of lexicase selection
compared to tournament selection, and suggest that specialists help drive
evolution under lexicase selection toward global solutions.
","[{'version': 'v1', 'created': 'Wed, 22 May 2019 21:26:02 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Jul 2019 14:42:54 GMT'}, {'version': 'v3', 'created': 'Thu, 2 Jan 2020 18:50:32 GMT'}]",2020-01-03,"[['Helmuth', 'Thomas', ''], ['Pantridge', 'Edward', ''], ['Spector', 'Lee', '']]","['genetic programming', 'lexicase selection', 'specialization']"
6453,2003.08627,Marcin Jurdzi\'nski,Laure Daviaud and Marcin Jurdzi\'nski and K. S. Thejaswini,The Strahler number of a parity game,To appear in ICALP 2020,,10.4230/LIPIcs.ICALP.2020.123,,cs.DS cs.FL cs.GT cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Strahler number of a rooted tree is the largest height of a perfect
binary tree that is its minor. The Strahler number of a parity game is proposed
to be defined as the smallest Strahler number of the tree of any of its
attractor decompositions. It is proved that parity games can be solved in
quasi-linear space and in time that is polynomial in the number of vertices~$n$
and linear in $({d}/{2k})^k$, where $d$ is the number of priorities and $k$ is
the Strahler number. This complexity is quasi-polynomial because the Strahler
number is at most logarithmic in the number of vertices. The proof is based on
a new construction of small Strahler-universal trees.
  It is shown that the Strahler number of a parity game is a robust parameter:
it coincides with its alternative version based on trees of progress measures
and with the register number defined by Lehtinen~(2018). It follows that parity
games can be solved in quasi-linear space and in time that is polynomial in the
number of vertices and linear in $({d}/{2k})^k$, where $k$ is the register
number. This significantly improves the running times and space achieved for
parity games of bounded register number by Lehtinen (2018) and by Parys (2020).
  The running time of the algorithm based on small Strahler-universal trees
yields a novel trade-off $k \cdot \lg(d/k) = O(\log n)$ between the two natural
parameters that measure the structural complexity of a parity game, which
allows solving parity games in polynomial time. This includes as special cases
the asymptotic settings of those parameters covered by the results of Calude,
Jain Khoussainov, Li, and Stephan (2017), of Jurdzi\'nski and Lazi\'c (2017),
and of Lehtinen (2018), and it significantly extends the range of such
settings, for example to $d = 2^{O\left(\sqrt{\lg n}\right)}$ and $k =
O\!\left(\sqrt{\lg n}\right)$.
","[{'version': 'v1', 'created': 'Thu, 19 Mar 2020 08:36:48 GMT'}, {'version': 'v2', 'created': 'Mon, 4 May 2020 12:36:53 GMT'}]",2020-08-04,"[['Daviaud', 'Laure', ''], ['Jurdziński', 'Marcin', ''], ['Thejaswini', 'K. S.', '']]","['parity game', 'attractor decomposition', 'progress measure', 'universal tree', 'Strahler number']"
6454,2205.12955,Jiaming Sun,"Jiaming Sun, Xi Chen, Qianqian Wang, Zhengqi Li, Hadar Averbuch-Elor,
  Xiaowei Zhou, Noah Snavely",Neural 3D Reconstruction in the Wild,"Accepted to SIGGRAPH 2022 (Conference Proceedings). Project page:
  https://zju3dv.github.io/neuralrecon-w/",,10.1145/3528233.3530718,,cs.CV cs.GR,http://creativecommons.org/licenses/by-sa/4.0/,"  We are witnessing an explosion of neural implicit representations in computer
vision and graphics. Their applicability has recently expanded beyond tasks
such as shape generation and image-based rendering to the fundamental problem
of image-based 3D reconstruction. However, existing methods typically assume
constrained 3D environments with constant illumination captured by a small set
of roughly uniformly distributed cameras. We introduce a new method that
enables efficient and accurate surface reconstruction from Internet photo
collections in the presence of varying illumination. To achieve this, we
propose a hybrid voxel- and surface-guided sampling technique that allows for
more efficient ray sampling around surfaces and leads to significant
improvements in reconstruction quality. Further, we present a new benchmark and
protocol for evaluating reconstruction performance on such in-the-wild scenes.
We perform extensive experiments, demonstrating that our approach surpasses
both classical and neural reconstruction methods on a wide variety of metrics.
","[{'version': 'v1', 'created': 'Wed, 25 May 2022 17:59:53 GMT'}]",2022-05-26,"[['Sun', 'Jiaming', ''], ['Chen', 'Xi', ''], ['Wang', 'Qianqian', ''], ['Li', 'Zhengqi', ''], ['Averbuch-Elor', 'Hadar', ''], ['Zhou', 'Xiaowei', ''], ['Snavely', 'Noah', '']]","['3D Reconstruction', 'Novel View Synthesis', 'Neural Rendering']"
6455,2009.06082,Karina Kanjaria,"Karina Kanjaria, Anup Pillai, Chaitanya Shivade, Marina Bendersky,
  Ashutosh Jadhav, Vandana Mukherjee, Tanveer Syeda-Mahmood","Receptivity of an AI Cognitive Assistant by the Radiology Community: A
  Report on Data Collected at RSNA",,"Proceedings of the 13th International Joint Conference on
  Biomedical Engineering Systems and Technologies - Volume 5: HEALTHINF, ISBN
  978-989-758-398-8, pages 178-186. 2020",10.5220/0008984901780186,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to advances in machine learning and artificial intelligence (AI), a new
role is emerging for machines as intelligent assistants to radiologists in
their clinical workflows. But what systematic clinical thought processes are
these machines using? Are they similar enough to those of radiologists to be
trusted as assistants? A live demonstration of such a technology was conducted
at the 2016 Scientific Assembly and Annual Meeting of the Radiological Society
of North America (RSNA). The demonstration was presented in the form of a
question-answering system that took a radiology multiple choice question and a
medical image as inputs. The AI system then demonstrated a cognitive workflow,
involving text analysis, image analysis, and reasoning, to process the question
and generate the most probable answer. A post demonstration survey was made
available to the participants who experienced the demo and tested the question
answering system. Of the reported 54,037 meeting registrants, 2,927 visited the
demonstration booth, 1,991 experienced the demo, and 1,025 completed a
post-demonstration survey. In this paper, the methodology of the survey is
shown and a summary of its results are presented. The results of the survey
show a very high level of receptiveness to cognitive computing technology and
artificial intelligence among radiologists.
","[{'version': 'v1', 'created': 'Sun, 13 Sep 2020 20:40:30 GMT'}]",2020-09-15,"[['Kanjaria', 'Karina', ''], ['Pillai', 'Anup', ''], ['Shivade', 'Chaitanya', ''], ['Bendersky', 'Marina', ''], ['Jadhav', 'Ashutosh', ''], ['Mukherjee', 'Vandana', ''], ['Syeda-Mahmood', 'Tanveer', '']]","['Radiology survey', 'decision support', 'question answering', 'deep learning', 'machine learning', 'artificial intelligence', 'cognitive computing']"
6456,2004.08144,Marc Van Zee,"Marc van Zee, Dragan Doder, Leendert van der Torre, Mehdi Dastani,
  Thomas Icard, Eric Pacuit",Intention as Commitment toward Time,"83 pages, 4 figures, Artificial Intelligence journal pre-print","Artificial Intelligence, Volume 283, June 2020, 103270",10.1016/j.artint.2020.103270,,cs.LO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we address the interplay among intention, time, and belief in
dynamic environments. The first contribution is a logic for reasoning about
intention, time and belief, in which assumptions of intentions are represented
by preconditions of intended actions. Intentions and beliefs are coherent as
long as these assumptions are not violated, i.e. as long as intended actions
can be performed such that their preconditions hold as well. The second
contribution is the formalization of what-if scenarios: what happens with
intentions and beliefs if a new (possibly conflicting) intention is adopted, or
a new fact is learned? An agent is committed to its intended actions as long as
its belief-intention database is coherent. We conceptualize intention as
commitment toward time and we develop AGM-based postulates for the iterated
revision of belief-intention databases, and we prove a Katsuno-Mendelzon-style
representation theorem.
","[{'version': 'v1', 'created': 'Fri, 17 Apr 2020 09:47:39 GMT'}]",2020-04-20,"[['van Zee', 'Marc', ''], ['Doder', 'Dragan', ''], ['van der Torre', 'Leendert', ''], ['Dastani', 'Mehdi', ''], ['Icard', 'Thomas', ''], ['Pacuit', 'Eric', '']]","['Intention', 'BDI logic', 'Belief revision']"
6457,2009.01959,Marcelo De Rezende Martins,Marcelo de Rezende Martins and Marco A. Gerosa,CoNCRA: A Convolutional Neural Network Code Retrieval Approach,,,10.1145/3422392.3422462,,cs.LG cs.CL cs.SE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software developers routinely search for code using general-purpose search
engines. However, these search engines cannot find code semantically unless it
has an accompanying description. We propose a technique for semantic code
search: A Convolutional Neural Network approach to code retrieval (CoNCRA). Our
technique aims to find the code snippet that most closely matches the
developer's intent, expressed in natural language. We evaluated our approach's
efficacy on a dataset composed of questions and code snippets collected from
Stack Overflow. Our preliminary results showed that our technique, which
prioritizes local interactions (words nearby), improved the state-of-the-art
(SOTA) by 5% on average, retrieving the most relevant code snippets in the top
3 (three) positions by almost 80% of the time. Therefore, our technique is
promising and can improve the efficacy of semantic code retrieval.
","[{'version': 'v1', 'created': 'Thu, 3 Sep 2020 23:38:52 GMT'}]",2021-01-27,"[['Martins', 'Marcelo de Rezende', ''], ['Gerosa', 'Marco A.', '']]","['code search', 'neural networks', 'joint embedding']"
6458,2109.08309,EPTCS,"Domenico Cantone (Dept. of Mathematics and Computer Science,
  University of Catania, Italy), Andrea De Domenico (Scuola Superiore di
  Catania, University of Catania, Italy), Pietro Maugeri (Dept. of Mathematics
  and Computer Science, University of Catania, Italy)","On the Convexity of a Fragment of Pure Set Theory with Applications
  within a Nelson-Oppen Framework","In Proceedings GandALF 2021, arXiv:2109.07798","EPTCS 346, 2021, pp. 195-210",10.4204/EPTCS.346.13,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Satisfiability Modulo Theories (SMT) issue concerns the satisfiability of
formulae from multiple background theories, usually expressed in the language
of first-order predicate logic with equality. SMT solvers are often based on
variants of the Nelson-Oppen combination method, a solver for the
quantifier-free fragment of the combination of theories with disjoint
signatures, via cooperation among their decision procedures. When each of the
theories to be combined by the Nelson-Oppen method is convex (that is, any
conjunction of its literals can imply a disjunction of equalities only when it
implies at least one of the equalities) and decidable in polynomial time, the
running time of the combination procedure is guaranteed to be polynomial in the
size of the input formula. In this paper, we prove the convexity of a fragment
of Zermelo-Fraenkel set theory, called Multi-Level Syllogistic, most of whose
polynomially decidable fragments we have recently characterized.
","[{'version': 'v1', 'created': 'Fri, 17 Sep 2021 02:07:32 GMT'}]",2021-09-20,"[['Cantone', 'Domenico', '', 'Dept. of Mathematics and Computer Science,\n  University of Catania, Italy'], ['De Domenico', 'Andrea', '', 'Scuola Superiore di\n  Catania, University of Catania, Italy'], ['Maugeri', 'Pietro', '', 'Dept. of Mathematics\n  and Computer Science, University of Catania, Italy']]","['convex theories', 'satisfiability modulo theories', 'decision problem', 'computable set theory']"
6459,2207.11451,Haris Moazam Sheikh,"Haris Moazam Sheikh, Tess A. Callan, Kealan J. Hennessy and Philip S.
  Marcus","Optimization of the Shape of a Hydrokinetic Turbine's Draft Tube and Hub
  Assembly Using Design-by-Morphing with Bayesian Optimization",,,10.1016/j.cma.2022.115654,,cs.CG cs.CE cs.LG math.GT stat.CO,http://creativecommons.org/licenses/by/4.0/,"  Finding the optimal design of a hydrodynamic or aerodynamic surface is often
impossible due to the expense of evaluating the cost functions (say, with
computational fluid dynamics) needed to determine the performances of the flows
that the surface controls. In addition, inherent limitations of the design
space itself due to imposed geometric constraints, conventional
parameterization methods, and user bias can restrict {\it all} of the designs
within a chosen design space regardless of whether traditional optimization
methods or newer, data-driven design algorithms with machine learning are used
to search the design space. We present a 2-pronged attack to address these
difficulties: we propose (1) a methodology to create the design space using
morphing that we call {\it Design-by-Morphing} (DbM); and (2) an optimization
algorithm to search that space that uses a novel Bayesian Optimization (BO)
strategy that we call {\it Mixed variable, Multi-Objective Bayesian
Optimization} (MixMOBO). We apply this shape optimization strategy to maximize
the power output of a hydrokinetic turbine. Applying these two strategies in
tandem, we demonstrate that we can create a novel, geometrically-unconstrained,
design space of a draft tube and hub shape and then optimize them
simultaneously with a {\it minimum} number of cost function calls. Our
framework is versatile and can be applied to the shape optimization of a
variety of fluid problems.
","[{'version': 'v1', 'created': 'Sat, 23 Jul 2022 07:39:27 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Aug 2022 06:19:11 GMT'}, {'version': 'v3', 'created': 'Mon, 12 Sep 2022 20:58:08 GMT'}, {'version': 'v4', 'created': 'Fri, 16 Sep 2022 08:38:40 GMT'}]",2022-11-15,"[['Sheikh', 'Haris Moazam', ''], ['Callan', 'Tess A.', ''], ['Hennessy', 'Kealan J.', ''], ['Marcus', 'Philip S.', '']]","['Draft-Tubes', 'Hydro-Kinetic Turbines', 'Design-by-Morphing', 'Shape Optimization', 'CFD', 'Bayesian optimization', 'MixMOBO', 'HedgeMO']"
6460,2301.08140,Alistair Weld,"Alistair Weld, Joao Cartucho, Chi Xu, Joseph Davids and Stamatia
  Giannarou","Regularizing disparity estimation via multi task learning with
  structured light reconstruction",,"Computer Methods in Biomechanics and Biomedical Engineering:
  Imaging & Visualization 2022",10.1080/21681163.2022.2156391,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  3D reconstruction is a useful tool for surgical planning and guidance.
However, the lack of available medical data stunts research and development in
this field, as supervised deep learning methods for accurate disparity
estimation rely heavily on large datasets containing ground truth information.
Alternative approaches to supervision have been explored, such as
self-supervision, which can reduce or remove entirely the need for ground
truth. However, no proposed alternatives have demonstrated performance
capabilities close to what would be expected from a supervised setup. This work
aims to alleviate this issue. In this paper, we investigate the learning of
structured light projections to enhance the development of direct disparity
estimation networks. We show for the first time that it is possible to
accurately learn the projection of structured light on a scene, implicitly
learning disparity. Secondly, we \textcolor{black}{explore the use of a multi
task learning (MTL) framework for the joint training of structured light and
disparity. We present results which show that MTL with structured light
improves disparity training; without increasing the number of model parameters.
Our MTL setup outperformed the single task learning (STL) network in every
validation test. Notably, in the medical generalisation test, the STL error was
1.4 times worse than that of the best MTL performance. The benefit of using MTL
is emphasised when the training data is limited.} A dataset containing
stereoscopic images, disparity maps and structured light projections on medical
phantoms and ex vivo tissue was created for evaluation together with virtual
scenes. This dataset will be made publicly available in the future.
","[{'version': 'v1', 'created': 'Thu, 19 Jan 2023 15:54:52 GMT'}]",2023-01-20,"[['Weld', 'Alistair', ''], ['Cartucho', 'Joao', ''], ['Xu', 'Chi', ''], ['Davids', 'Joseph', ''], ['Giannarou', 'Stamatia', '']]","['Disparity estimation', 'structured light', 'multi task learning', 'small data']"
6461,2205.15917,Cristina Matache,"Cristina Matache, Sean Moss and Sam Staton","Concrete categories and higher-order recursion (With applications
  including probability, differentiability, and full abstraction)",,,10.1145/3531130.3533370,,cs.PL cs.LO math.CT,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We study concrete sheaf models for a call-by-value higher-order language with
recursion. Our family of sheaf models is a generalization of many examples from
the literature, such as models for probabilistic and differentiable
programming, and fully abstract logical relations models. We treat recursion in
the spirit of synthetic domain theory. We provide a general construction of a
lifting monad starting from a class of admissible monomorphisms in the site of
the sheaf category. In this way, we obtain a family of models parametrized by a
concrete site and a class of monomorphisms, for which we prove a general
computational adequacy theorem.
","[{'version': 'v1', 'created': 'Tue, 31 May 2022 16:06:42 GMT'}]",2022-06-01,"[['Matache', 'Cristina', ''], ['Moss', 'Sean', ''], ['Staton', 'Sam', '']]","['category', 'concrete sheaves', 'domains', 'higher-order', 'logical relations', 'recursion', 'synthetic domain theory']"
6462,2209.07394,Rohit Mehra,"Priyavanshi Pathania, Rohit Mehra, Vibhu Saujanya Sharma, Vikrant
  Kaulgud, Sanjay Podder, Adam P. Burden",ESAVE: Estimating Server and Virtual Machine Energy,"3 pages. To be published in the proceedings of 37th IEEE/ACM
  International Conference on Automated Software Engineering: Late Breaking
  Results Track (ASE '22), October 10-14, 2022, Michigan, USA",,10.1145/3551349.3561170,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sustainable software engineering has received a lot of attention in recent
times, as we witness an ever-growing slice of energy use, for example, at data
centers, as software systems utilize the underlying infrastructure.
Characterizing servers for their energy use accurately without being intrusive,
is therefore important to make sustainable software deployment choices. In this
paper, we introduce ESAVE which is a machine learning-based approach that
leverages a small set of hardware attributes to characterize a server or
virtual machine's energy usage across different levels of utilization. This is
based upon an extensive exploration of multiple ML approaches, with a focus on
a minimal set of required attributes, while showcasing good accuracy. Early
validations show that ESAVE has only around 12% average prediction error,
despite being non-intrusive.
","[{'version': 'v1', 'created': 'Thu, 15 Sep 2022 15:55:09 GMT'}]",2022-09-16,"[['Pathania', 'Priyavanshi', ''], ['Mehra', 'Rohit', ''], ['Sharma', 'Vibhu Saujanya', ''], ['Kaulgud', 'Vikrant', ''], ['Podder', 'Sanjay', ''], ['Burden', 'Adam P.', '']]","['Sustainable Software Engineering', 'Green IT', 'Energy Estimation', 'Carbon Emissions', 'Machine Learning', 'Energy Modeling']"
6463,2012.04986,Marianne Gauffriau,Marianne Gauffriau,"Counting methods introduced into the bibliometric research literature
  1970-2018: A review",,,10.1162/qss_a_00141,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  The present review of bibliometric counting methods investigates 1) the
number of unique counting methods in the bibliometric research literature, 2)
to what extent the counting methods can be categorized according to selected
characteristics of the counting methods, 3) methods and elements to assess the
internal validity of the counting methods, and 4) to what extent and with which
characteristics the counting methods are used in research evaluations.
  The review identifies 32 counting methods introduced during the period 1981 -
2018. Two frameworks categorize these counting methods. Framework 1 describes
selected mathematical properties of counting methods, and Framework 2 describes
arguments for choosing a counting method. Twenty of the 32 counting methods are
rank-dependent, fractionalized, and introduced to measure contribution,
participation, etc. of an object of study. Next, three criteria for internal
validity are used to identify five methods that test the adequacy of counting
methods, two elements that test sensitivity, and three elements that test
homogeneity of the counting methods. These methods and elements may be used to
assess the internal validity of counting methods. Finally, a literature search
finds research evaluations that use the counting methods. Only three of the 32
counting methods are used by four research evaluations or more. Of these three
counting methods, two are used with the same characteristics as defined in the
studies that introduced the counting methods.
  The review provides practitioners in research evaluation and researchers in
bibliometrics with a detailed foundation for working with counting methods. At
the same time, many of the findings in the review provide bases for future
investigations of counting methods.
","[{'version': 'v1', 'created': 'Wed, 9 Dec 2020 11:29:35 GMT'}]",2021-06-22,"[['Gauffriau', 'Marianne', '']]","['Counting method', 'mathematical property', 'argument for introduction', 'internal validity', 'research evaluation']"
6464,2104.03019,Chao Wang,"Chao Wang, Thomas H. Weisswange, Matti Krueger, Christiane B.
  Wiebel-Herboth","Human-Vehicle Cooperation on Prediction-Level: Enhancing Automated
  Driving with Human Foresight",,,10.1109/IVWorkshops54471.2021.9669247,,cs.RO cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To maximize safety and driving comfort, autonomous driving systems can
benefit from implementing foresighted action choices that take different
potential scenario developments into account. While artificial scene prediction
methods are making fast progress, an attentive human driver may still be able
to identify relevant contextual features which are not adequately considered by
the system or for which the human driver may have a lack of trust into the
system's capabilities to treat them appropriately. We implement an approach
that lets a human driver quickly and intuitively supplement scene predictions
to an autonomous driving system by gaze. We illustrate the feasibility of this
approach in an existing autonomous driving system running a variety of
scenarios in a simulator. Furthermore, a Graphical User Interface (GUI) was
designed and integrated to enhance the trust and explainability of the system.
The utilization of such cooperatively augmented scenario predictions has the
potential to improve a system's foresighted driving abilities and make
autonomous driving more trustable, comfortable and personalized.
","[{'version': 'v1', 'created': 'Wed, 7 Apr 2021 09:49:34 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Apr 2021 16:33:29 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Jun 2021 08:12:36 GMT'}]",2022-04-15,"[['Wang', 'Chao', ''], ['Weisswange', 'Thomas H.', ''], ['Krueger', 'Matti', ''], ['Wiebel-Herboth', 'Christiane B.', '']]","['Human-Machine Interface', 'Automated Vehicles', 'Novel Interfaces and Displays']"
6465,2204.08566,Parastoo Abtahi,"Parastoo Abtahi, Sidney Q. Hough, James A. Landay, Sean Follmer","Beyond Being Real: A Sensorimotor Control Perspective on Interactions in
  Virtual Reality","To appear at the ACM Conference on Human Factors in Computing Systems
  (CHI 2022)",,10.1145/3491102.3517706,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We can create Virtual Reality (VR) interactions that have no equivalent in
the real world by remapping spacetime or altering users' body representation,
such as stretching the user's virtual arm for manipulation of distant objects
or scaling up the user's avatar to enable rapid locomotion. Prior research has
leveraged such approaches, what we call beyond-real techniques, to make
interactions in VR more practical, efficient, ergonomic, and accessible. We
present a survey categorizing prior movement-based VR interaction literature as
reality-based, illusory, or beyond-real interactions. We survey relevant
conferences (CHI, IEEE VR, VRST, UIST, and DIS) while focusing on selection,
manipulation, locomotion, and navigation in VR. For beyond-real interactions,
we describe the transformations that have been used by prior works to create
novel remappings. We discuss open research questions through the lens of the
human sensorimotor control system and highlight challenges that need to be
addressed for effective utilization of beyond-real interactions in future VR
applications, including plausibility, control, long-term adaptation, and
individual differences.
","[{'version': 'v1', 'created': 'Mon, 18 Apr 2022 21:28:34 GMT'}]",2022-04-20,"[['Abtahi', 'Parastoo', ''], ['Hough', 'Sidney Q.', ''], ['Landay', 'James A.', ''], ['Follmer', 'Sean', '']]","['virtual reality', 'interaction design', 'framework', 'sensorimotor control']"
6466,2003.10681,Karina Roundtree,"Karina A. Roundtree and Jason R. Cody and Jennifer Leaf and H. Onan
  Demirel and Julie A. Adams",Human collective visualization transparency,"32 pages, 4 figures,",,10.1007/s11721-021-00194-6,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interest in collective robotic systems has increased rapidly due to the
potential benefits that can be offered to operators, such as increased safety
and support, who perform challenging tasks in high-risk environments.
Human-collective transparency research has focused on how the design of the
algorithms, visualizations, and control mechanisms influence human-collective
behavior. Traditional collective visualizations have shown all of the
individual entities composing a collective, which may become problematic as
collectives scale in size and heterogeneity, and tasks become more demanding.
Human operators can become overloaded with information, which will negatively
affect their understanding of the collective's current state and overall
behaviors, which can cause poor teaming performance. An analysis of
visualization transparency and the derived visualization design guidance, based
on remote supervision of collectives, are the primary contributions of this
manuscript. The individual agent and abstract visualizations were analyzed for
sequential best-of-n decision-making tasks involving four collectives, composed
of 200 entities each. The abstract visualization provided better transparency
by enabling operators with different individual differences and capabilities to
perform relatively the same and promoted higher human-collective performance.
","[{'version': 'v1', 'created': 'Tue, 24 Mar 2020 06:39:43 GMT'}]",2021-06-07,"[['Roundtree', 'Karina A.', ''], ['Cody', 'Jason R.', ''], ['Leaf', 'Jennifer', ''], ['Demirel', 'H. Onan', ''], ['Adams', 'Julie A.', '']]","['Transparency', 'Visualization', 'Human-Robot Interaction']"
6467,2010.10242,Thomas Cilloni,"Thomas Cilloni, Wei Wang, Charles Walter, Charles Fleming",Ulixes: Facial Recognition Privacy with Adversarial Machine Learning,,"PoPETS Proceedings on Privacy Enhancing Technologies 2022;
  (1):148-165",10.2478/popets-2022-0008,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Facial recognition tools are becoming exceptionally accurate in identifying
people from images. However, this comes at the cost of privacy for users of
online services with photo management (e.g. social media platforms).
Particularly troubling is the ability to leverage unsupervised learning to
recognize faces even when the user has not labeled their images. In this paper
we propose Ulixes, a strategy to generate visually non-invasive facial noise
masks that yield adversarial examples, preventing the formation of identifiable
user clusters in the embedding space of facial encoders. This is applicable
even when a user is unmasked and labeled images are available online. We
demonstrate the effectiveness of Ulixes by showing that various classification
and clustering methods cannot reliably label the adversarial examples we
generate. We also study the effects of Ulixes in various black-box settings and
compare it to the current state of the art in adversarial machine learning.
Finally, we challenge the effectiveness of Ulixes against adversarially trained
models and show that it is robust to countermeasures.
","[{'version': 'v1', 'created': 'Tue, 20 Oct 2020 13:05:51 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Feb 2022 18:10:16 GMT'}]",2022-02-02,"[['Cilloni', 'Thomas', ''], ['Wang', 'Wei', ''], ['Walter', 'Charles', ''], ['Fleming', 'Charles', '']]","['adversarial machine learning', 'facial recognition', 'privacy']"
6468,2012.00357,Robert Eggersmann,"Robert Eggersmann, Laurent Stainier, Michael Ortiz, Stefanie Reese","Efficient Data Structures for Model-free Data-Driven Computational
  Mechanics",,,10.1016/j.cma.2021.113855,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The data-driven computing paradigm initially introduced by Kirchdoerfer and
Ortiz (2016) enables finite element computations in solid mechanics to be
performed directly from material data sets, without an explicit material model.
From a computational effort point of view, the most challenging task is the
projection of admissible states at material points onto their closest states in
the material data set. In this study, we compare and develop several possible
data structures for solving the nearest-neighbor problem. We show that
approximate nearest-neighbor (ANN) algorithms can accelerate material data
searches by several orders of magnitude relative to exact searching algorithms.
The approximations are suggested by--and adapted to--the structure of the
data-driven iterative solver and result in no significant loss of solution
accuracy. We assess the performance of the ANN algorithm with respect to
material data set size with the aid of a 3D elasticity test case. We show that
computations on a single processor with up to one billion material data points
are feasible within a few seconds execution time with a speedup of more than
106 with respect to exact k-d trees.
","[{'version': 'v1', 'created': 'Tue, 1 Dec 2020 09:32:39 GMT'}]",2021-05-19,"[['Eggersmann', 'Robert', ''], ['Stainier', 'Laurent', ''], ['Ortiz', 'Michael', ''], ['Reese', 'Stefanie', '']]","['data-driven computing', 'solid mechanics', 'nearest neighborproblem', 'approximate nearest-neighbor search', 'data structures', 'data science']"
6469,1904.13154,Ioan Marius Bilasco PhD,"Delphine Poux and Benjamin Allaert and Jose Mennesson and Nacim
  Ihaddadene and Ioan Marius Bilasco and Chaabane Djeraba","Facial Expressions Analysis Under Occlusions Based on Specificities of
  Facial Motion Propagation",,,10.1007/s11042-020-08993-5,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although much progress has been made in the facial expression analysis field,
facial occlusions are still challenging. The main innovation brought by this
contribution consists in exploiting the specificities of facial movement
propagation for recognizing expressions in presence of important occlusions.
The movement induced by an expression extends beyond the movement epicenter.
Thus, the movement occurring in an occluded region propagates towards
neighboring visible regions. In presence of occlusions, per expression, we
compute the importance of each unoccluded facial region and we construct
adapted facial frameworks that boost the performance of per expression binary
classifier. The output of each expression-dependant binary classifier is then
aggregated and fed into a fusion process that aims constructing, per occlusion,
a unique model that recognizes all the facial expressions considered. The
evaluations highlight the robustness of this approach in presence of
significant facial occlusions.
","[{'version': 'v1', 'created': 'Tue, 30 Apr 2019 10:57:37 GMT'}]",2020-12-22,"[['Poux', 'Delphine', ''], ['Allaert', 'Benjamin', ''], ['Mennesson', 'Jose', ''], ['Ihaddadene', 'Nacim', ''], ['Bilasco', 'Ioan Marius', ''], ['Djeraba', 'Chaabane', '']]","['Facial occlusions', 'motion propagation', 'facial framework', 'facialexpressions']"
6470,1910.05109,Daniel Lemire,"Wojciech Mu{\l}a, Daniel Lemire",Base64 encoding and decoding at almost the speed of a memory copy,,"Software: Practice and Experience 50 (2), 2020",10.1002/spe.2777,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Many common document formats on the Internet are text-only such as email
(MIME) and the Web (HTML, JavaScript, JSON and XML). To include images or
executable code in these documents, we first encode them as text using base64.
Standard base64 encoding uses 64~ASCII characters: both lower and upper case
Latin letters, digits and two other symbols. We show how we can encode and
decode base64 data at nearly the speed of a memory copy (memcpy) on recent
Intel processors, as long as the data does not fit in the first-level (L1)
cache. We use the SIMD (Single Instruction Multiple Data) instruction set
AVX-512 available on commodity processors. Our implementation generates several
times fewer instructions than previous SIMD-accelerated base64 codecs. It is
also more versatile, as it can be adapted---even at runtime---to any base64
variant by only changing constants.
","[{'version': 'v1', 'created': 'Wed, 2 Oct 2019 15:39:28 GMT'}]",2020-01-08,"[['Muła', 'Wojciech', ''], ['Lemire', 'Daniel', '']]","['Binary-to-text encoding', 'Vectorization', 'Data URI', 'Web Performance']"
6471,2206.12089,Moshe Sipper,Raz Lapid and Moshe Sipper,"Evolution of Activation Functions for Deep Learning-Based Image
  Classification",,"Proceedings of 2022 Genetic and Evolutionary Computation
  Conference",10.1145/3520304.3533949,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Activation functions (AFs) play a pivotal role in the performance of neural
networks. The Rectified Linear Unit (ReLU) is currently the most commonly used
AF. Several replacements to ReLU have been suggested but improvements have
proven inconsistent. Some AFs exhibit better performance for specific tasks,
but it is hard to know a priori how to select the appropriate one(s). Studying
both standard fully connected neural networks (FCNs) and convolutional neural
networks (CNNs), we propose a novel, three-population, coevolutionary algorithm
to evolve AFs, and compare it to four other methods, both evolutionary and
non-evolutionary. Tested on four datasets -- MNIST, FashionMNIST, KMNIST, and
USPS -- coevolution proves to be a performant algorithm for finding good AFs
and AF architectures.
","[{'version': 'v1', 'created': 'Fri, 24 Jun 2022 05:58:23 GMT'}]",2022-06-27,"[['Lapid', 'Raz', ''], ['Sipper', 'Moshe', '']]","['deep learning', 'activation functions', 'coevolution']"
6472,2107.07809,Michael Lukin,"K. I. Mihajlenko, M. A. Lukin, A. S. Stankevich",A method for decompilation of AMD GCN kernels to OpenCL,"10 pages, 5 figures","Information and Control Systems, 2021, no. 2, pp. 33-42",10.31799/1684-8853-2021-2-33-42,,cs.PL cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Introduction: Decompilers are useful tools for software analysis and support
in the absence of source code. They are available for many hardware
architectures and programming languages. However, none of the existing
decompilers support modern AMD GPU architectures such as AMD GCN and RDNA.
Purpose: We aim at developing the first assembly decompiler tool for a modern
AMD GPU architecture that generates code in the OpenCL language, which is
widely used for programming GPGPUs. Results: We developed the algorithms for
the following operations: preprocessing assembly code, searching data accesses,
extracting system values, decompiling arithmetic operations and recovering data
types. We also developed templates for decompilation of branching operations.
Practical relevance: We implemented the presented algorithms in Python as a
tool called OpenCLDecompiler, which supports a large subset of AMD GCN
instructions. This tool automatically converts disassembled GPGPU code into the
equivalent OpenCL code, which reduces the effort required to analyze assembly
code.
","[{'version': 'v1', 'created': 'Fri, 16 Jul 2021 10:32:54 GMT'}]",2021-07-19,"[['Mihajlenko', 'K. I.', ''], ['Lukin', 'M. A.', ''], ['Stankevich', 'A. S.', '']]","['decompiler', 'disassembler', 'OpenCL', 'AMD GCN', 'GPGPU', 'control flow graph', 'reverse engineering']"
6473,2010.01574,Michael Gurevich,Michael Gurevich and Stephan von Muehlen,The Accordiatron: A MIDI Controller For Interactive Music,"Proceedings of the International Conference on New Interfaces for
  Musical Expression, 2001",,10.5281/zenodo.1176364,,cs.HC cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  The Accordiatron is a new MIDI controller for real-time performance based on
the paradigm of a conventional squeeze box or concertina. It translates the
gestures of a performer to the standard communication protocol of MIDI,
allowing for flexible mappings of performance data to sonic parameters. When
used in conjunction with a realtime signal processing environment, the
Accordiatron becomes an expressive, versatile musical instrument. A combination
of sensory outputs providing both discrete and continuous data gives the subtle
expressiveness and control necessary for interactive music.
","[{'version': 'v1', 'created': 'Sun, 4 Oct 2020 12:57:08 GMT'}]",2020-10-06,"[['Gurevich', 'Michael', ''], ['von Muehlen', 'Stephan', '']]","['MIDI controllers', 'computer music', 'interactive music', 'electronic musical instruments', 'musical instrument design', 'human computer interface']"
6474,2205.04284,Eduardo Nuno Almeida,"Eduardo Nuno Almeida, Mohammed Rushad, Sumanth Reddy Kota, Akshat
  Nambiar, Hardik L. Harti, Chinmay Gupta, Danish Waseem, Gon\c{c}alo Santos,
  Helder Fontes, Rui Campos, Mohit P. Tahiliani","Machine Learning Based Propagation Loss Module for Enabling Digital
  Twins of Wireless Networks in ns-3",,,10.1145/3532577.3532607,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The creation of digital twins of experimental testbeds allows the validation
of novel wireless networking solutions and the evaluation of their performance
in realistic conditions, without the cost, complexity and limited availability
of experimental testbeds. Current trace-based simulation approaches for ns-3
enable the repetition and reproduction of the same exact conditions observed in
past experiments. However, they are limited by the fact that the simulation
setup must exactly match the original experimental setup, including the network
topology, the mobility patterns and the number of network nodes. In this paper,
we propose the Machine Learning based Propagation Loss (MLPL) module for ns-3.
Based on network traces collected in an experimental testbed, the MLPL module
estimates the propagation loss as the sum of a deterministic path loss and a
stochastic fast-fading loss. The MLPL module is validated with unit tests.
Moreover, we test the MLPL module with real network traces, and compare the
results obtained with existing propagation loss models in ns-3 and real
experimental results. The results obtained show that the MLPL module can
accurately predict the propagation loss observed in a real environment and
reproduce the experimental conditions of a given testbed, enabling the creation
of digital twins of wireless network environments in ns-3.
","[{'version': 'v1', 'created': 'Mon, 9 May 2022 13:55:15 GMT'}]",2022-05-10,"[['Almeida', 'Eduardo Nuno', ''], ['Rushad', 'Mohammed', ''], ['Kota', 'Sumanth Reddy', ''], ['Nambiar', 'Akshat', ''], ['Harti', 'Hardik L.', ''], ['Gupta', 'Chinmay', ''], ['Waseem', 'Danish', ''], ['Santos', 'Gonçalo', ''], ['Fontes', 'Helder', ''], ['Campos', 'Rui', ''], ['Tahiliani', 'Mohit P.', '']]","['Machine learning', 'Trace-based simulation', 'Propagation loss model']"
6475,2108.04178,Sergio Nicoli,"Sergio Nicoli, Konstantinos Agathos and Eleni Chatzi","Moment fitted cut spectral elements for explicit analysis of guided wave
  propagation","26 pages, 16 figures",,10.1016/j.cma.2022.115140,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, a method for the simulation of guided wave propagation in
solids defined by implicit surfaces is presented. The method employs structured
grids of spectral elements in combination to a fictitious domain approach to
represent complex geometrical features through singed distance functions. A
novel approach, based on moment fitting, is introduced to restore the diagonal
mass matrix property in elements intersected by interfaces, thus enabling the
use of explicit time integrators. Since this approach can lead to significantly
decreased critical time steps for intersected elements, a ""leap-frog"" algorithm
is employed to locally comply with this condition, thus introducing only a
small computational overhead. The resulting method is tested through a series
of numerical examples of increasing complexity, where it is shown that it
offers increased accuracy compared to other similar approaches. Due to these
improvements, components of interest for SHM-related tasks can be effectively
discretized, while maintaining a performance comparable or only slightly worse
than the standard spectral element method.
","[{'version': 'v1', 'created': 'Mon, 9 Aug 2021 17:02:20 GMT'}]",2022-07-08,"[['Nicoli', 'Sergio', ''], ['Agathos', 'Konstantinos', ''], ['Chatzi', 'Eleni', '']]","['Guided wave propagation', 'spectral element method', 'spectral cell method', 'fictitious domain methods', 'mass matrix lumping', 'moment fitting']"
6476,2104.05270,Annalisa Milella,"Giulio Reina, Annalisa Milella, Raphael Rouveure, Michael Nielsen,
  Rainer Worst, Morten R. Blas",Ambient awareness for agricultural robotic vehicles,,Biosystems Engineering 146 (2016) 114-132,10.1016/j.biosystemseng.2015.12.010,,cs.RO cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last few years, robotic technology has been increasingly employed in
agriculture to develop intelligent vehicles that can improve productivity and
competitiveness. Accurate and robust environmental perception is a critical
requirement to address unsolved issues including safe interaction with field
workers and animals, obstacle detection in controlled traffic applications,
crop row guidance, surveying for variable rate applications, and situation
awareness, in general, towards increased process automation. Given the variety
of conditions thatmay be encountered in the field, no single sensor exists that
can guarantee reliable results in every scenario. The development of a
multi-sensory perception systemto increase the ambient awareness of an
agricultural vehicle operating in crop fields is the objective of the Ambient
Awareness for Autonomous Agricultural Vehicles (QUAD-AV) project. Different
onboard sensor technologies, namely stereovision, LIDAR, radar, and
thermography, are considered. Novel methods for their combination are proposed
to automatically detect obstacles and discern traversable from non-traversable
areas. Experimental results, obtained in agricultural contexts, are presented
showing the effectiveness of the proposed methods.
","[{'version': 'v1', 'created': 'Mon, 12 Apr 2021 08:05:10 GMT'}]",2021-04-13,"[['Reina', 'Giulio', ''], ['Milella', 'Annalisa', ''], ['Rouveure', 'Raphael', ''], ['Nielsen', 'Michael', ''], ['Worst', 'Rainer', ''], ['Blas', 'Morten R.', '']]","['agricultural robotics', 'intelligent vehicles', 'safe driving in crop fields', 'advanced perception systems', 'ambient awareness']"
6477,2010.00774,Talia Ringer,"Talia Ringer, RanDair Porter, Nathaniel Yazdani, John Leo, Dan
  Grossman",Proof Repair across Type Equivalences,"Tool repository with code guide:
  https://github.com/uwplse/pumpkin-pi/blob/v2.0.0/GUIDE.md",,10.1145/3453483.3454033,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a new approach to automatically repairing broken proofs in the
Coq proof assistant in response to changes in types. Our approach combines a
configurable proof term transformation with a decompiler from proof terms to
tactic scripts. The proof term transformation implements transport across
equivalences in a way that removes references to the old version of the changed
type and does not rely on axioms beyond those Coq assumes.
  We have implemented this approach in PUMPKIN Pi, an extension to the PUMPKIN
PATCH Coq plugin suite for proof repair. We demonstrate PUMPKIN Pi's
flexibility on eight case studies, including supporting a benchmark from a user
study, easing development with dependent types, porting functions and proofs
between unary and binary numbers, and supporting an industrial proof engineer
to interoperate between Coq and other verification tools more easily.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2020 04:49:32 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Nov 2020 03:19:47 GMT'}, {'version': 'v3', 'created': 'Wed, 31 Mar 2021 17:23:58 GMT'}, {'version': 'v4', 'created': 'Wed, 12 May 2021 03:31:08 GMT'}]",2021-05-13,"[['Ringer', 'Talia', ''], ['Porter', 'RanDair', ''], ['Yazdani', 'Nathaniel', ''], ['Leo', 'John', ''], ['Grossman', 'Dan', '']]","['proof engineering', 'proof repair', 'proof reuse']"
6478,2104.01103,Octave Mariotti,"Octave Mariotti, Hakan Bilen","Semi-supervised Viewpoint Estimation with Geometry-aware Conditional
  Generation",,ECCV 2020: Computer Vision - ECCV 2020 Workshops pp 631-647,10.1007/978-3-030-66096-3_42,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  There is a growing interest in developing computer vision methods that can
learn from limited supervision. In this paper, we consider the problem of
learning to predict camera viewpoints, where obtaining ground-truth annotations
are expensive and require special equipment, from a limited number of labeled
images. We propose a semi-supervised viewpoint estimation method that can learn
to infer viewpoint information from unlabeled image pairs, where two images
differ by a viewpoint change. In particular our method learns to synthesize the
second image by combining the appearance from the first one and viewpoint from
the second one. We demonstrate that our method significantly improves the
supervised techniques, especially in the low-label regime and outperforms the
state-of-the-art semi-supervised methods.
","[{'version': 'v1', 'created': 'Fri, 2 Apr 2021 15:55:27 GMT'}]",2021-04-05,"[['Mariotti', 'Octave', ''], ['Bilen', 'Hakan', '']]","['3D viewpoint estimation', 'semi-supervised learning', 'conditional image generation']"
6479,2004.03179,Seiichi Uchida,"Takuro Karamatsu, Gibran Benitez-Garcia, Keiji Yanai, Seiichi Uchida",Iconify: Converting Photographs into Icons,"to appear at 2020 Joint Workshop on Multimedia Artworks Analysis and
  Attractiveness Computing in Multimedia (MMArt-ACM'20)",,10.1145/3379173.3393708,,cs.GR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we tackle a challenging domain conversion task between photo
and icon images. Although icons often originate from real object images (i.e.,
photographs), severe abstractions and simplifications are applied to generate
icon images by professional graphic designers. Moreover, there is no one-to-one
correspondence between the two domains, for this reason we cannot use it as the
ground-truth for learning a direct conversion function. Since generative
adversarial networks (GAN) can undertake the problem of domain conversion
without any correspondence, we test CycleGAN and UNIT to generate icons from
objects segmented from photo images. Our experiments with several image
datasets prove that CycleGAN learns sufficient abstraction and simplification
ability to generate icon-like images.
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2020 08:01:47 GMT'}]",2020-04-08,"[['Karamatsu', 'Takuro', ''], ['Benitez-Garcia', 'Gibran', ''], ['Yanai', 'Keiji', ''], ['Uchida', 'Seiichi', '']]","['icons', 'image generation', 'generative adversarial networks']"
6480,2110.12555,Jihun Yoon,"Jihun Yoon, Jiwon Lee, Sunghwan Heo, Hayeong Yu, Jayeon Lim, Chi Hyun
  Song, SeulGi Hong, Seungbum Hong, Bokyung Park, SungHyun Park, Woo Jin Hyung
  and Min-Kook Choi","hSDB-instrument: Instrument Localization Database for Laparoscopic and
  Robotic Surgeries",https://hsdb-instrument.github.io,MICCAI 2021 pp 393-402,10.1007/978-3-030-87202-1_38 10.1007/978-3-030-87202-1_38,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Automated surgical instrument localization is an important technology to
understand the surgical process and in order to analyze them to provide
meaningful guidance during surgery or surgical index after surgery to the
surgeon. We introduce a new dataset that reflects the kinematic characteristics
of surgical instruments for automated surgical instrument localization of
surgical videos. The hSDB(hutom Surgery DataBase)-instrument dataset consists
of instrument localization information from 24 cases of laparoscopic
cholecystecomy and 24 cases of robotic gastrectomy. Localization information
for all instruments is provided in the form of a bounding box for object
detection. To handle class imbalance problem between instruments, synthesized
instruments modeled in Unity for 3D models are included as training data.
Besides, for 3D instrument data, a polygon annotation is provided to enable
instance segmentation of the tool. To reflect the kinematic characteristics of
all instruments, they are annotated with head and body parts for laparoscopic
instruments, and with head, wrist, and body parts for robotic instruments
separately. Annotation data of assistive tools (specimen bag, needle, etc.)
that are frequently used for surgery are also included. Moreover, we provide
statistical information on the hSDB-instrument dataset and the baseline
localization performances of the object detection networks trained by the
MMDetection library and resulting analyses.
","[{'version': 'v1', 'created': 'Sun, 24 Oct 2021 23:35:37 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Oct 2021 02:02:04 GMT'}]",2021-10-27,"[['Yoon', 'Jihun', ''], ['Lee', 'Jiwon', ''], ['Heo', 'Sunghwan', ''], ['Yu', 'Hayeong', ''], ['Lim', 'Jayeon', ''], ['Song', 'Chi Hyun', ''], ['Hong', 'SeulGi', ''], ['Hong', 'Seungbum', ''], ['Park', 'Bokyung', ''], ['Park', 'SungHyun', ''], ['Hyung', 'Woo Jin', ''], ['Choi', 'Min-Kook', '']]","['Surgical Instrument Localization', 'Object Detection', 'ClassImbalance', 'Domain Randomization']"
6481,2010.04502,Ye Zheng,"Ye Zheng, Ruoran Huang, Chuanqi Han, Xi Huang, Li Cui",Background Learnable Cascade for Zero-Shot Object Detection,"18 pages, 5figures",,10.1007/978-3-030-69535-4_7,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Zero-shot detection (ZSD) is crucial to large-scale object detection with the
aim of simultaneously localizing and recognizing unseen objects. There remain
several challenges for ZSD, including reducing the ambiguity between background
and unseen objects as well as improving the alignment between visual and
semantic concept. In this work, we propose a novel framework named Background
Learnable Cascade (BLC) to improve ZSD performance. The major contributions for
BLC are as follows: (i) we propose a multi-stage cascade structure named
Cascade Semantic R-CNN to progressively refine the alignment between visual and
semantic of ZSD; (ii) we develop the semantic information flow structure and
directly add it between each stage in Cascade Semantic RCNN to further improve
the semantic feature learning; (iii) we propose the background learnable region
proposal network (BLRPN) to learn an appropriate word vector for background
class and use this learned vector in Cascade Semantic R CNN, this design makes
\Background Learnable"" and reduces the confusion between background and unseen
classes. Our extensive experiments show BLC obtains significantly performance
improvements for MS-COCO over state-of-the-art methods.
","[{'version': 'v1', 'created': 'Fri, 9 Oct 2020 11:20:02 GMT'}]",2021-04-15,"[['Zheng', 'Ye', ''], ['Huang', 'Ruoran', ''], ['Han', 'Chuanqi', ''], ['Huang', 'Xi', ''], ['Cui', 'Li', '']]","['Zero-shot object detection', 'Multi-stage structure', 'Backgroundlearnable', 'Semantic information flow']"
6482,2212.13843,Haiwei Dong,"Ying Qiu, Yang Liu, Juan Arteaga-Falconi, Haiwei Dong, and
  Abdulmotaleb El Saddik",EVM-CNN: Real-Time Contactless Heart Rate Estimation from Facial Video,,"IEEE Transactions on Multimedia, vol. 21, no. 7, pp. 1778-1787,
  2019",10.1109/TMM.2018.2883866,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the increase in health consciousness, noninvasive body monitoring has
aroused interest among researchers. As one of the most important pieces of
physiological information, researchers have remotely estimated the heart rate
(HR) from facial videos in recent years. Although progress has been made over
the past few years, there are still some limitations, like the processing time
increasing with accuracy and the lack of comprehensive and challenging datasets
for use and comparison. Recently, it was shown that HR information can be
extracted from facial videos by spatial decomposition and temporal filtering.
Inspired by this, a new framework is introduced in this paper to remotely
estimate the HR under realistic conditions by combining spatial and temporal
filtering and a convolutional neural network. Our proposed approach shows
better performance compared with the benchmark on the MMSE-HR dataset in terms
of both the average HR estimation and short-time HR estimation. High
consistency in short-time HR estimation is observed between our method and the
ground truth.
","[{'version': 'v1', 'created': 'Sun, 25 Dec 2022 15:25:15 GMT'}]",2022-12-29,"[['Qiu', 'Ying', ''], ['Liu', 'Yang', ''], ['Arteaga-Falconi', 'Juan', ''], ['Dong', 'Haiwei', ''], ['Saddik', 'Abdulmotaleb El', '']]","['Spatial decomposition', 'temporal filtering', 'convolutional neural network']"
6483,1907.00811,Xiaoyang Wang,"Xiaoyang Wang, Ioannis Mavromatis, Andrea Tassi, Raul
  Santos-Rodriguez, Robert J. Piechocki",Location Anomalies Detection for Connected and Autonomous Vehicles,Accepted to IEEE CAVS 2019,,10.1109/CAVS.2019.8887778,,cs.LG cs.NI eess.SP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Future Connected and Automated Vehicles (CAV), and more generally ITS, will
form a highly interconnected system. Such a paradigm is referred to as the
Internet of Vehicles (herein Internet of CAVs) and is a prerequisite to
orchestrate traffic flows in cities. For optimal decision making and
supervision, traffic centres will have access to suitably anonymized CAV
mobility information. Safe and secure operations will then be contingent on
early detection of anomalies. In this paper, a novel unsupervised learning
model based on deep autoencoder is proposed to detect the self-reported
location anomaly in CAVs, using vehicle locations and the Received Signal
Strength Indicator (RSSI) as features. Quantitative experiments on simulation
datasets show that the proposed approach is effective and robust in detecting
self-reported location anomalies.
","[{'version': 'v1', 'created': 'Mon, 1 Jul 2019 14:16:54 GMT'}]",2022-09-05,"[['Wang', 'Xiaoyang', ''], ['Mavromatis', 'Ioannis', ''], ['Tassi', 'Andrea', ''], ['Santos-Rodriguez', 'Raul', ''], ['Piechocki', 'Robert J.', '']]","['anomaly detection', 'deep neural network', 'autoencoder', 'connected and autonomous vehicles (CAV)', 'IntelligentTransportation Systems (ITS)']"
6484,2104.06200,Jose Manuel Gomez-Perez,"Andres Garcia-Silva, Ronald Denaux, Jose Manuel Gomez-Perez","On the Impact of Knowledge-based Linguistic Annotations in the Quality
  of Scientific Embeddings",Accepted for publication in Future Generation Computer Systems,,10.1016/j.future.2021.02.019,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In essence, embedding algorithms work by optimizing the distance between a
word and its usual context in order to generate an embedding space that encodes
the distributional representation of words. In addition to single words or word
pieces, other features which result from the linguistic analysis of text,
including lexical, grammatical and semantic information, can be used to improve
the quality of embedding spaces. However, until now we did not have a precise
understanding of the impact that such individual annotations and their possible
combinations may have in the quality of the embeddings. In this paper, we
conduct a comprehensive study on the use of explicit linguistic annotations to
generate embeddings from a scientific corpus and quantify their impact in the
resulting representations. Our results show how the effect of such annotations
in the embeddings varies depending on the evaluation task. In general, we
observe that learning embeddings using linguistic annotations contributes to
achieve better evaluation results.
","[{'version': 'v1', 'created': 'Tue, 13 Apr 2021 13:51:22 GMT'}]",2021-04-14,"[['Garcia-Silva', 'Andres', ''], ['Denaux', 'Ronald', ''], ['Gomez-Perez', 'Jose Manuel', '']]","['Natural language processing', 'linguistic analysis', 'knowledge graphs', 'embeddings']"
6485,2108.02502,Alptekin Temizel,"Ayberk Aydin, Deniz Sen, Berat Tuna Karli, Oguz Hanoglu and Alptekin
  Temizel",Imperceptible Adversarial Examples by Spatial Chroma-Shift,"10 pages, 5 figures. Accepted to International Workshop on
  Adversarial Learning for Multimedia, ACM Multimedia 2021",,10.1145/3475724.3483604,,cs.CV cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Deep Neural Networks have been shown to be vulnerable to various kinds of
adversarial perturbations. In addition to widely studied additive noise based
perturbations, adversarial examples can also be created by applying a per pixel
spatial drift on input images. While spatial transformation based adversarial
examples look more natural to human observers due to absence of additive noise,
they still possess visible distortions caused by spatial transformations. Since
the human vision is more sensitive to the distortions in the luminance compared
to those in chrominance channels, which is one of the main ideas behind the
lossy visual multimedia compression standards, we propose a spatial
transformation based perturbation method to create adversarial examples by only
modifying the color components of an input image. While having competitive
fooling rates on CIFAR-10 and NIPS2017 Adversarial Learning Challenge datasets,
examples created with the proposed method have better scores with regards to
various perceptual quality metrics. Human visual perception studies validate
that the examples are more natural looking and often indistinguishable from
their original counterparts.
","[{'version': 'v1', 'created': 'Thu, 5 Aug 2021 10:19:23 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Sep 2021 17:19:30 GMT'}]",2021-09-03,"[['Aydin', 'Ayberk', ''], ['Sen', 'Deniz', ''], ['Karli', 'Berat Tuna', ''], ['Hanoglu', 'Oguz', ''], ['Temizel', 'Alptekin', '']]","['adversarial examples', 'neural networks', 'computer vision']"
6486,1804.01155,M\'arton Karsai,"Jacob Levy Abitbol, M\'arton Karsai, Jean-Philippe Magu\'e,
  Jean-Pierre Chevrot and Eric Fleury","Socioeconomic Dependencies of Linguistic Patterns in Twitter: A
  Multivariate Analysis","In WWW 2018: The Web Conference, 10 pages, 6 figures",,10.1145/3178876.3186011,,cs.CL cs.CY cs.SI physics.soc-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our usage of language is not solely reliant on cognition but is arguably
determined by myriad external factors leading to a global variability of
linguistic patterns. This issue, which lies at the core of sociolinguistics and
is backed by many small-scale studies on face-to-face communication, is
addressed here by constructing a dataset combining the largest French Twitter
corpus to date with detailed socioeconomic maps obtained from national census
in France. We show how key linguistic variables measured in individual Twitter
streams depend on factors like socioeconomic status, location, time, and the
social network of individuals. We found that (i) people of higher socioeconomic
status, active to a greater degree during the daytime, use a more standard
language; (ii) the southern part of the country is more prone to use more
standard language than the northern one, while locally the used variety or
dialect is determined by the spatial distribution of socioeconomic status; and
(iii) individuals connected in the social network are closer linguistically
than disconnected ones, even after the effects of status homophily have been
removed. Our results inform sociolinguistic theory and may inspire novel
learning methods for the inference of socioeconomic status of people from the
way they tweet.
","[{'version': 'v1', 'created': 'Tue, 3 Apr 2018 20:18:11 GMT'}]",2018-04-05,"[['Abitbol', 'Jacob Levy', ''], ['Karsai', 'Márton', ''], ['Magué', 'Jean-Philippe', ''], ['Chevrot', 'Jean-Pierre', ''], ['Fleury', 'Eric', '']]","['computational sociolinguistics', 'Twitter data', 'socioeconomic statusinference', 'social network analysis', 'spatiotemporal data']"
6487,1909.01127,Guanxiong Luo,"GuanXiong Luo, Na Zhao, Wenhao Jiang, Edward S. Hui, Peng Cao",MRI Reconstruction Using Deep Bayesian Estimation,,,10.1002/mrm.28274,,cs.CV eess.SP,http://creativecommons.org/licenses/by-sa/4.0/,"  Purpose: To develop a deep learning-based Bayesian inference for MRI
reconstruction. Methods: We modeled the MRI reconstruction problem with Bayes's
theorem, following the recently proposed PixelCNN++ method. The image
reconstruction from incomplete k-space measurement was obtained by maximizing
the posterior possibility. A generative network was utilized as the image
prior, which was computationally tractable, and the k-space data fidelity was
enforced by using an equality constraint. The stochastic backpropagation was
utilized to calculate the descent gradient in the process of maximum a
posterior, and a projected subgradient method was used to impose the equality
constraint. In contrast to the other deep learning reconstruction methods, the
proposed one used the likelihood of prior as the training loss and the
objective function in reconstruction to improve the image quality. Results: The
proposed method showed an improved performance in preserving image details and
reducing aliasing artifacts, compared with GRAPPA, $\ell_1$-ESPRiT, and MODL, a
state-of-the-art deep learning reconstruction method. The proposed method
generally achieved more than 5 dB peak signal-to-noise ratio improvement for
compressed sensing and parallel imaging reconstructions compared with the other
methods. Conclusion: The Bayesian inference significantly improved the
reconstruction performance, compared with the conventional $\ell_1$-sparsity
prior in compressed sensing reconstruction tasks. More importantly, the
proposed reconstruction framework can be generalized for most MRI
reconstruction scenarios.
","[{'version': 'v1', 'created': 'Tue, 3 Sep 2019 12:54:58 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Dec 2020 22:59:53 GMT'}, {'version': 'v3', 'created': 'Thu, 17 Feb 2022 17:32:46 GMT'}]",2022-02-18,"[['Luo', 'GuanXiong', ''], ['Zhao', 'Na', ''], ['Jiang', 'Wenhao', ''], ['Hui', 'Edward S.', ''], ['Cao', 'Peng', '']]","['Generative network', 'Bayesian estimation', 'Deep learning reconstruction', 'Compressed sensing', 'Parallel Imaging']"
6488,2109.04351,Tobias Thummerer,"Tobias Thummerer, Josef Kircher, Lars Mikelsons",NeuralFMU: Towards Structural Integration of FMUs into Neural Networks,,,10.3384/ecp21181297,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper covers two major subjects: First, the presentation of a new
open-source library called FMI.jl for integrating FMI into the Julia
programming environment by providing the possibility to load, parameterize and
simulate FMUs. Further, an extension to this library called FMIFlux.jl is
introduced, that allows the integration of FMUs into a neural network topology
to obtain a NeuralFMU. This structural combination of an industry typical
black-box model and a data-driven machine learning model combines the different
advantages of both modeling approaches in one single development environment.
This allows for the usage of advanced data driven modeling techniques for
physical effects that are difficult to model based on first principles.
","[{'version': 'v1', 'created': 'Thu, 9 Sep 2021 15:42:01 GMT'}]",2022-09-09,"[['Thummerer', 'Tobias', ''], ['Kircher', 'Josef', ''], ['Mikelsons', 'Lars', '']]","['NeuralFMU', 'FMI', 'FMU', 'Julia', 'NeuralODE']"
6489,2105.00763,Arnaud Mazier,"Arnaud Mazier (1), Sophie Ribes (2), Benjamin Gilles (2), St\'ephane
  P.A Bordas (1 and 3). ((1) Universit\'e du Luxembourg, (2) AnatoScope, (3)
  China Medical University Hospital)",A rigged model of the breast for preoperative surgical planning,"20 pages, 8 figures, submitted to Journal of Biomechanics","Journal of Biomechanics, Volume 128, 2021, 110645, ISSN 0021-9290,",10.1016/j.jbiomech.2021.110645,,cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In breast surgical practice, drawing is part of the preoperative planning
procedure and is essential for a successful operation. In this study, we design
a pipeline to assist surgeons with patient-specific breast surgical drawings.
We use a deformable torso model containing the surgical patterns to match any
breast surface scan. To be compatible with surgical timing, we build an
articulated model through a skinning process coupled with shape deformers to
enhance a fast registration process. On one hand, the scalable bones of the
skinning account for pose and morphological variations of the patients. On the
other hand, pre-designed artistic blendshapes create a linear space for
guaranteeing anatomical variations. Then, we apply meaningful constraints to
the model to find a trade-off between precision and speed. The experiments were
conducted on 7 patients, in 2 different poses (prone and supine) with a breast
size ranging from 36A and 42C (US/UK bra sizing). The acquisitions were
obtained using the depth camera Structure Sensor, and the breast scans were
acquired in less than 1 minute. The result is a registration method converging
within a few seconds (3 maximum), reaching a Mean Absolute Error of 2.3 mm for
mesh registration and 8.0 mm for breast anatomical landmarks. Compared to the
existing literature, our model can be personalized and does not require any
database. Finally, our registered model can be used to transfer surgical
reference patterns onto any patient in any position.
","[{'version': 'v1', 'created': 'Mon, 3 May 2021 11:45:06 GMT'}, {'version': 'v2', 'created': 'Tue, 31 May 2022 13:02:44 GMT'}]",2022-06-01,"[['Mazier', 'Arnaud', '', '1 and 3'], ['Ribes', 'Sophie', '', '1 and 3'], ['Gilles', 'Benjamin', '', '1 and 3'], ['Bordas', 'Stéphane P. A', '', '1 and 3'], ['.', '', '']]","['surgical planning', 'model-based registration', 'animation', 'anatomical variability', 'breast']"
6490,1710.07845,Gustavo Maciel Dias Vieira,"Gustavo M. D. Vieira, Islene C. Garcia, Luiz E. Buzato",Seamless Paxos Coordinators,"11 pages, final published version, with correct experimental data",Cluster Computing (2014) 17:463-473,10.1007/s10586-013-0264-9,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Paxos algorithm requires a single correct coordinator process to operate.
After a failure, the replacement of the coordinator may lead to a temporary
unavailability of the application implemented atop Paxos. So far, this
unavailability has been addressed by reducing the coordinator replacement rate
through the use of stable coordinator selection algorithms. We have observed
that the cost of recovery of the newly elected coordinator's state is at the
core of this unavailability problem. In this paper we present a new technique
to manage coordinator replacement that allows the recovery to occur
concurrently with new consensus rounds. Experimental results show that our
seamless approach effectively solves the temporary unavailability problem, its
adoption entails uninterrupted execution of the application. Our solution
removes the restriction that the occurrence of coordinator replacements is
something to be avoided, allowing the decoupling of the application execution
from the accuracy of the mechanism used to choose a coordinator. This result
increases the performance of the application even in the presence of failures,
it is of special importance to the autonomous operation of replicated
applications that have to adapt to varying network conditions and partial
failures.
","[{'version': 'v1', 'created': 'Sat, 21 Oct 2017 19:12:48 GMT'}]",2017-10-24,"[['Vieira', 'Gustavo M. D.', ''], ['Garcia', 'Islene C.', ''], ['Buzato', 'Luiz E.', '']]","['Consensus', 'failure detector', 'fault tolerance', 'Paxos', 'replication']"
6491,2210.03496,Haoqin Tu,"Haoqin Tu, Zhongliang Yang, Jinshuai Yang, Siyu Zhang, Yongfeng Huang","PCAE: A Framework of Plug-in Conditional Auto-Encoder for Controllable
  Text Generation",Knowledge-Based Systems,,10.1016/j.knosys.2022.109766,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Controllable text generation has taken a gigantic step forward these days.
Yet existing methods are either constrained in a one-off pattern or not
efficient enough for receiving multiple conditions at every generation stage.
We propose a model-agnostic framework Plug-in Conditional Auto-Encoder for
Controllable Text Generation (PCAE) towards flexible and semi-supervised text
generation. Our framework is ""plug-and-play"" with partial parameters to be
fine-tuned in the pre-trained model (less than a half). Crucial to the success
of PCAE is the proposed broadcasting label fusion network for navigating the
global latent code to a specified local and confined space. Visualization of
the local latent prior well confirms the primary devotion in hidden space of
the proposed model. Moreover, extensive experiments across five related
generation tasks (from 2 conditions up to 10 conditions) on both RNN- based and
pre-trained BART [26] based auto-encoders reveal the high capability of PCAE,
which enables generation that is highly manipulable, syntactically diverse and
time-saving with minimum labeled samples. We will release our code at
https://github.com/ImKeTT/pcae.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2022 12:31:47 GMT'}]",2022-10-10,"[['Tu', 'Haoqin', ''], ['Yang', 'Zhongliang', ''], ['Yang', 'Jinshuai', ''], ['Zhang', 'Siyu', ''], ['Huang', 'Yongfeng', '']]","['controllable text generation', 'plug-andplay', 'model-agnostic', 'transformers']"
6492,2212.05113,Stephen MacNeil,"Stephen MacNeil, Andrew Tran, Juho Leinonen, Paul Denny, Joanne Kim,
  Arto Hellas, Seth Bernstein, Sami Sarsa","Automatically Generating CS Learning Materials with Large Language
  Models","In Proceedings of the 54th ACM Technical Symposium on Computing
  Science Education",,10.1145/3545947.3569630,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Recent breakthroughs in Large Language Models (LLMs), such as GPT-3 and
Codex, now enable software developers to generate code based on a natural
language prompt. Within computer science education, researchers are exploring
the potential for LLMs to generate code explanations and programming
assignments using carefully crafted prompts. These advances may enable students
to interact with code in new ways while helping instructors scale their
learning materials. However, LLMs also introduce new implications for academic
integrity, curriculum design, and software engineering careers. This workshop
will demonstrate the capabilities of LLMs to help attendees evaluate whether
and how LLMs might be integrated into their pedagogy and research. We will also
engage attendees in brainstorming to consider how LLMs will impact our field.
","[{'version': 'v1', 'created': 'Fri, 9 Dec 2022 20:37:44 GMT'}]",2022-12-13,"[['MacNeil', 'Stephen', ''], ['Tran', 'Andrew', ''], ['Leinonen', 'Juho', ''], ['Denny', 'Paul', ''], ['Kim', 'Joanne', ''], ['Hellas', 'Arto', ''], ['Bernstein', 'Seth', ''], ['Sarsa', 'Sami', '']]","['large language models', 'explanations', 'computer science education']"
6493,2205.13505,Mikaela Meyer,"Mikaela Meyer, Aaron Horowitz, Erica Marshall, and Kristian Lum","Flipping the Script on Criminal Justice Risk Assessment: An actuarial
  model for assessing the risk the federal sentencing system poses to
  defendants","Conference on Fairness, Accountability, and Transparency (FAccT 2022)",,10.1145/3531146.3533104,,cs.CY stat.AP,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In the criminal justice system, algorithmic risk assessment instruments are
used to predict the risk a defendant poses to society; examples include the
risk of recidivating or the risk of failing to appear at future court dates.
However, defendants are also at risk of harm from the criminal justice system.
To date, there exists no risk assessment instrument that considers the risk the
system poses to the individual. We develop a risk assessment instrument that
""flips the script."" Using data about U.S. federal sentencing decisions, we
build a risk assessment instrument that predicts the likelihood an individual
will receive an especially lengthy sentence given factors that should be
legally irrelevant to the sentencing decision. To do this, we develop a
two-stage modeling approach. Our first-stage model is used to determine which
sentences were ""especially lengthy."" We then use a second-stage model to
predict the defendant's risk of receiving a sentence that is flagged as
especially lengthy given factors that should be legally irrelevant. The factors
that should be legally irrelevant include, for example, race, court location,
and other socio-demographic information about the defendant. Our instrument
achieves comparable predictive accuracy to risk assessment instruments used in
pretrial and parole contexts. We discuss the limitations of our modeling
approach and use the opportunity to highlight how traditional risk assessment
instruments in various criminal justice settings also suffer from many of the
same limitations and embedded value systems of their creators.
","[{'version': 'v1', 'created': 'Thu, 26 May 2022 17:17:13 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Jul 2022 21:56:07 GMT'}]",2022-07-15,"[['Meyer', 'Mikaela', ''], ['Horowitz', 'Aaron', ''], ['Marshall', 'Erica', ''], ['Lum', 'Kristian', '']]","['risk assessment', 'criminal justice', 'heteroscedastic Bayesian additiveregression trees', 'LASSO', 'two-stage model', 'perspective reversal']"
6494,2004.10657,Miltiadis Allamanis,"Miltiadis Allamanis, Earl T. Barr, Soline Ducousso, and Zheng Gao",Typilus: Neural Type Hints,Accepted to PLDI 2020,,10.1145/3385412.3385997,,cs.PL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Type inference over partial contexts in dynamically typed languages is
challenging. In this work, we present a graph neural network model that
predicts types by probabilistically reasoning over a program's structure,
names, and patterns. The network uses deep similarity learning to learn a
TypeSpace -- a continuous relaxation of the discrete space of types -- and how
to embed the type properties of a symbol (i.e. identifier) into it.
Importantly, our model can employ one-shot learning to predict an open
vocabulary of types, including rare and user-defined ones. We realise our
approach in Typilus for Python that combines the TypeSpace with an optional
type checker. We show that Typilus accurately predicts types. Typilus
confidently predicts types for 70% of all annotatable symbols; when it predicts
a type, that type optionally type checks 95% of the time. Typilus can also find
incorrect type annotations; two important and popular open source libraries,
fairseq and allennlp, accepted our pull requests that fixed the annotation
errors Typilus discovered.
","[{'version': 'v1', 'created': 'Mon, 6 Apr 2020 11:14:03 GMT'}]",2020-04-23,"[['Allamanis', 'Miltiadis', ''], ['Barr', 'Earl T.', ''], ['Ducousso', 'Soline', ''], ['Gao', 'Zheng', '']]","['type inference', 'structured learning', 'deep learning', 'graph neural networks', 'meta-learning']"
6495,2201.11764,Stefan Hristozov,"Stefan Hristozov, Moritz Wettermann, Manuel Huber",A TOCTOU Attack on DICE Attestation,"10 pages, 3 figures, to appear at CODASPY'22",,10.1145/3508398.3511507,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A major security challenge for modern Internet of Things (IoT) deployments is
to ensure that the devices run legitimate firmware free from malware. This
challenge can be addressed through a security primitive called attestation
which allows a remote backend to verify the firmware integrity of the devices
it manages. In order to accelerate broad attestation adoption in the IoT domain
the Trusted Computing Group (TCG) has introduced the Device Identifier
Composition Engine (DICE) series of specifications. DICE is a hardware-software
architecture for constrained, e.g., microcontroller-based IoT devices where the
firmware is divided into successively executed layers.
  In this paper, we demonstrate a remote Time-Of-Check Time-Of-Use (TOCTOU)
attack on DICE-based attestation. We demonstrate that it is possible to install
persistent malware in the flash memory of a constrained microcontroller that
cannot be detected through DICE-based attestation. The main idea of our attack
is to install malware during runtime of application logic in the top firmware
layer. The malware reads the valid attestation key and stores it on the
device's flash memory. After reboot, the malware uses the previously stored key
for all subsequent attestations to the backend. We conduct the installation of
malware and copying of the key through Return-Oriented Programming (ROP). As a
platform for our demonstration, we use the Cortex-M-based nRF52840
microcontroller. We provide a discussion of several possible countermeasures
which can mitigate the shortcomings of the DICE specifications.
","[{'version': 'v1', 'created': 'Thu, 27 Jan 2022 19:05:53 GMT'}]",2022-01-31,"[['Hristozov', 'Stefan', ''], ['Wettermann', 'Moritz', ''], ['Huber', 'Manuel', '']]","['Attestation', 'DICE', 'TOCTOU', 'IoT', 'Trusted computing', 'TCG', 'ROP', 'Malware']"
6496,1606.01199,Ian McQuillan,Joey Eremondi and Oscar H. Ibarra and Ian McQuillan,On the Complexity and Decidability of Some Problems Involving Shuffle,Preprint submitted to Information and Computation,"Information and Computation 259: 214-224, 2018",10.1016/j.ic.2017.09.002,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The complexity and decidability of various decision problems involving the
shuffle operation are studied. The following three problems are all shown to be
$NP$-complete: given a nondeterministic finite automaton (NFA) $M$, and two
words $u$ and $v$, is $L(M)$ not a subset of $u$ shuffled with $v$, is $u$
shuffled with $v$ not a subset of $L(M)$, and is $L(M)$ not equal to $u$
shuffled with $v$? It is also shown that there is a polynomial-time algorithm
to determine, for $NFA$s $M_1, M_2$ and a deterministic pushdown automaton
$M_3$, whether $L(M_1)$ shuffled with $L(M_2)$ is a subset of $L(M_3)$. The
same is true when $M_1, M_2,M_3$ are one-way nondeterministic
$l$-reversal-bounded $k$-counter machines, with $M_3$ being deterministic.
Other decidability and complexity results are presented for testing whether
given languages $L_1, L_2$ and $R$ from various languages families satisfy
$L_1$ shuffled with $L_2$ is a subset of $R$, and $R$ is a subset of $L_1$
shuffled with $L_2$. Several closure results on shuffle are also shown.
","[{'version': 'v1', 'created': 'Fri, 3 Jun 2016 17:40:47 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Mar 2019 15:03:57 GMT'}]",2019-03-08,"[['Eremondi', 'Joey', ''], ['Ibarra', 'Oscar H.', ''], ['McQuillan', 'Ian', '']]","['Automata and Logic', 'Shuffle', 'Counter Machines', 'Pushdown Machines', 'Reversal-Bounds', 'Determinism', 'Commutativity', 'Strings']"
6497,2210.14325,Alarith Uhde,Alarith Uhde and Tim zum Hoff and Marc Hassenzahl,"Obtrusive Subtleness and Why We Should Focus on Meaning, not Form, in
  Social Acceptability Studies","11 pages, 4 figures",,10.1145/3568444.3568457,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, interactive technologies are used almost everywhere. As a result,
designers need to increasingly make them ""socially acceptable"". Previous work
recommends ""subtle"" forms of interaction to increase social acceptability and
avoid negative experiences. Although often appropriate, such uniform
recommendations neglect the variety of social situations. We demonstrate this
limitation in an experiment (N=35), by comparing the observer experience of
different forms of interaction in ""face-to-face conversations"", a social
situation rarely studied. Here, the typically recommended form of interaction
(""subtle"") led to a more negative observer experience than the usually
deprecated form (""suspenseful""), in terms of affective experience and product
perception. It also made the user appear less extraverted. We conclude by
positioning interactions with technology not as separate from the social
situation in which they are performed, but as a constitutive part of it that
meaningfully relates to other situated activities.
","[{'version': 'v1', 'created': 'Tue, 25 Oct 2022 20:34:39 GMT'}]",2022-10-27,"[['Uhde', 'Alarith', ''], ['Hoff', 'Tim zum', ''], ['Hassenzahl', 'Marc', '']]","['social acceptability', 'subtle', 'suspenseful', 'social situation', 'social context', 'gesture-based interaction', 'design for the social']"
6498,2005.00472,Salomon Sickert,"Salomon Sickert, Javier Esparza","An Efficient Normalisation Procedure for Linear Temporal Logic and Very
  Weak Alternating Automata","This is the extended version of the referenced conference paper and
  contains an appendix with additional material",,10.1145/3373718.3394743,,cs.LO cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the mid 80s, Lichtenstein, Pnueli, and Zuck proved a classical theorem
stating that every formula of Past LTL (the extension of LTL with past
operators) is equivalent to a formula of the form $\bigwedge_{i=1}^n
\mathbf{G}\mathbf{F} \varphi_i \vee \mathbf{F}\mathbf{G} \psi_i$, where
$\varphi_i$ and $\psi_i$ contain only past operators. Some years later, Chang,
Manna, and Pnueli built on this result to derive a similar normal form for LTL.
Both normalisation procedures have a non-elementary worst-case blow-up, and
follow an involved path from formulas to counter-free automata to star-free
regular expressions and back to formulas. We improve on both points. We present
a direct and purely syntactic normalisation procedure for LTL yielding a normal
form, comparable to the one by Chang, Manna, and Pnueli, that has only a single
exponential blow-up. As an application, we derive a simple algorithm to
translate LTL into deterministic Rabin automata. The algorithm normalises the
formula, translates it into a special very weak alternating automaton, and
applies a simple determinisation procedure, valid only for these special
automata.
","[{'version': 'v1', 'created': 'Fri, 1 May 2020 16:24:24 GMT'}]",2020-05-04,"[['Sickert', 'Salomon', ''], ['Esparza', 'Javier', '']]","['Linear Temporal Logic', 'Normal Form', 'Weak Alternating Automata', 'Deterministic Automata']"
6499,1902.05205,Luis Garcia,"Luis Garcia, Stefan Mitsch, Andre Platzer","HyPLC: Hybrid Programmable Logic Controller Program Translation for
  Verification","13 pages, 9 figures. ICCPS 2019",,10.1145/3302509.3311036,,cs.PL cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Programmable Logic Controllers (PLCs) provide a prominent choice of
implementation platform for safety-critical industrial control systems. Formal
verification provides ways of establishing correctness guarantees, which can be
quite important for such safety-critical applications. But since PLC code does
not include an analytic model of the system plant, their verification is
limited to discrete properties. In this paper, we, thus, start the other way
around with hybrid programs that include continuous plant models in addition to
discrete control algorithms. Even deep correctness properties of hybrid
programs can be formally verified in the theorem prover KeYmaera X that
implements differential dynamic logic, dL, for hybrid programs. After verifying
the hybrid program, we now present an approach for translating hybrid programs
into PLC code. The new tool, HyPLC, implements this translation of discrete
control code of verified hybrid program models to PLC controller code and, vice
versa, the translation of existing PLC code into the discrete control actions
for a hybrid program given an additional input of the continuous dynamics of
the system to be verified. This approach allows for the generation of real
controller code while preserving, by compilation, the correctness of a valid
and verified hybrid program. PLCs are common cyber-physical interfaces for
safety-critical industrial control applications, and HyPLC serves as a
pragmatic tool for bridging formal verification of complex cyber-physical
systems at the algorithmic level of hybrid programs with the execution layer of
concrete PLC implementations.
","[{'version': 'v1', 'created': 'Thu, 14 Feb 2019 03:48:04 GMT'}]",2019-02-15,"[['Garcia', 'Luis', ''], ['Mitsch', 'Stefan', ''], ['Platzer', 'Andre', '']]","['Industrial control', 'programming languages', 'formal verification', 'semantics']"
6500,2203.15542,Bairan Fu,"Zhifang Fan, Dan Ou, Yulong Gu, Bairan Fu, Xiang Li, Wentian Bao,
  Xin-Yu Dai, Xiaoyi Zeng, Tao Zhuang, Qingwen Liu","Modeling Users' Contextualized Page-wise Feedback for Click-Through Rate
  Prediction in E-commerce Search",,,10.1145/3488560.3498478,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modeling user's historical feedback is essential for Click-Through Rate
Prediction in personalized search and recommendation. Existing methods usually
only model users' positive feedback information such as click sequences which
neglects the context information of the feedback. In this paper, we propose a
new perspective for context-aware users' behavior modeling by including the
whole page-wisely exposed products and the corresponding feedback as
contextualized page-wise feedback sequence. The intra-page context information
and inter-page interest evolution can be captured to learn more specific user
preference. We design a novel neural ranking model RACP(i.e., Recurrent
Attention over Contextualized Page sequence), which utilizes page-context aware
attention to model the intra-page context. A recurrent attention process is
used to model the cross-page interest convergence evolution as denoising the
interest in the previous pages. Experiments on public and real-world industrial
datasets verify our model's effectiveness.
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2022 13:26:55 GMT'}]",2022-03-30,"[['Fan', 'Zhifang', ''], ['Ou', 'Dan', ''], ['Gu', 'Yulong', ''], ['Fu', 'Bairan', ''], ['Li', 'Xiang', ''], ['Bao', 'Wentian', ''], ['Dai', 'Xin-Yu', ''], ['Zeng', 'Xiaoyi', ''], ['Zhuang', 'Tao', ''], ['Liu', 'Qingwen', '']]","['user sequence modeling', 'neural networks', 'personalized search']"
6501,2103.06364,Himan Abdollahpouri,"Himan Abdollahpouri, Masoud Mansoury, Robin Burke, Bamshad Mobasher,
  Edward Malthouse",User-centered Evaluation of Popularity Bias in Recommender Systems,"Proceedings of the 29th ACM Conference on User Modeling, Adaptation
  and Personalization (UMAP '21), June 21--25, 2021, Utrecht, Netherlands.
  arXiv admin note: text overlap with arXiv:2007.12230",,10.1145/3450613.3456821,,cs.IR cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Recommendation and ranking systems are known to suffer from popularity bias;
the tendency of the algorithm to favor a few popular items while
under-representing the majority of other items. Prior research has examined
various approaches for mitigating popularity bias and enhancing the
recommendation of long-tail, less popular, items. The effectiveness of these
approaches is often assessed using different metrics to evaluate the extent to
which over-concentration on popular items is reduced. However, not much
attention has been given to the user-centered evaluation of this bias; how
different users with different levels of interest towards popular items are
affected by such algorithms. In this paper, we show the limitations of the
existing metrics to evaluate popularity bias mitigation when we want to assess
these algorithms from the users' perspective and we propose a new metric that
can address these limitations. In addition, we present an effective approach
that mitigates popularity bias from the user-centered point of view. Finally,
we investigate several state-of-the-art approaches proposed in recent years to
mitigate popularity bias and evaluate their performances using the existing
metrics and also from the users' perspective. Our experimental results using
two publicly-available datasets show that existing popularity bias mitigation
techniques ignore the users' tolerance towards popular items. Our proposed
user-centered method can tackle popularity bias effectively for different users
while also improving the existing metrics.
","[{'version': 'v1', 'created': 'Wed, 10 Mar 2021 22:12:51 GMT'}]",2021-03-12,"[['Abdollahpouri', 'Himan', ''], ['Mansoury', 'Masoud', ''], ['Burke', 'Robin', ''], ['Mobasher', 'Bamshad', ''], ['Malthouse', 'Edward', '']]","['recommender systems', 'popularity bias', 'long-tail recommendation', 'calibration', 'fairness']"
6502,2101.09355,Dmitrii Ustiugov,"Dmitrii Ustiugov, Plamen Petrov, Marios Kogias, Edouard Bugnion, Boris
  Grot","Benchmarking, Analysis, and Optimization of Serverless Function
  Snapshots",To appear in ASPLOS 2021,,10.1145/3445814.3446714,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Serverless computing has seen rapid adoption due to its high scalability and
flexible, pay-as-you-go billing model. In serverless, developers structure
their services as a collection of functions, sporadically invoked by various
events like clicks. High inter-arrival time variability of function invocations
motivates the providers to start new function instances upon each invocation,
leading to significant cold-start delays that degrade user experience. To
reduce cold-start latency, the industry has turned to snapshotting, whereby an
image of a fully-booted function is stored on disk, enabling a faster
invocation compared to booting a function from scratch.
  This work introduces vHive, an open-source framework for serverless
experimentation with the goal of enabling researchers to study and innovate
across the entire serverless stack. Using vHive, we characterize a
state-of-the-art snapshot-based serverless infrastructure, based on
industry-leading Containerd orchestration framework and Firecracker hypervisor
technologies. We find that the execution time of a function started from a
snapshot is 95% higher, on average, than when the same function is
memory-resident. We show that the high latency is attributable to frequent page
faults as the function's state is brought from disk into guest memory one page
at a time. Our analysis further reveals that functions access the same stable
working set of pages across different invocations of the same function. By
leveraging this insight, we build REAP, a light-weight software mechanism for
serverless hosts that records functions' stable working set of guest memory
pages and proactively prefetches it from disk into memory. Compared to baseline
snapshotting, REAP slashes the cold-start delays by 3.7x, on average.
","[{'version': 'v1', 'created': 'Sat, 16 Jan 2021 00:03:28 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Jan 2021 17:57:59 GMT'}, {'version': 'v3', 'created': 'Fri, 5 Feb 2021 21:26:44 GMT'}]",2021-02-09,"[['Ustiugov', 'Dmitrii', ''], ['Petrov', 'Plamen', ''], ['Kogias', 'Marios', ''], ['Bugnion', 'Edouard', ''], ['Grot', 'Boris', '']]","['cloud computing', 'datacenters', 'serverless', 'virtualization', 'snapshots']"
6503,2201.02693,Yoshitomo Matsubara,"Yoshitomo Matsubara, Davide Callegaro, Sameer Singh, Marco Levorato,
  Francesco Restuccia","BottleFit: Learning Compressed Representations in Deep Neural Networks
  for Effective and Efficient Split Computing","Accepted to IEEE WoWMoM 2022. Code and models are available at
  https://github.com/yoshitomo-matsubara/bottlefit-split_computing","2022 IEEE 23rd International Symposium on a World of Wireless,
  Mobile and Multimedia Networks (WoWMoM)",10.1109/WoWMoM54355.2022.00032,,cs.LG cs.CV eess.IV eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although mission-critical applications require the use of deep neural
networks (DNNs), their continuous execution at mobile devices results in a
significant increase in energy consumption. While edge offloading can decrease
energy consumption, erratic patterns in channel quality, network and edge
server load can lead to severe disruption of the system's key operations. An
alternative approach, called split computing, generates compressed
representations within the model (called ""bottlenecks""), to reduce bandwidth
usage and energy consumption. Prior work has proposed approaches that introduce
additional layers, to the detriment of energy consumption and latency. For this
reason, we propose a new framework called BottleFit, which, in addition to
targeted DNN architecture modifications, includes a novel training strategy to
achieve high accuracy even with strong compression rates. We apply BottleFit on
cutting-edge DNN models in image classification, and show that BottleFit
achieves 77.1% data compression with up to 0.6% accuracy loss on ImageNet
dataset, while state of the art such as SPINN loses up to 6% in accuracy. We
experimentally measure the power consumption and latency of an image
classification application running on an NVIDIA Jetson Nano board (GPU-based)
and a Raspberry PI board (GPU-less). We show that BottleFit decreases power
consumption and latency respectively by up to 49% and 89% with respect to
(w.r.t.) local computing and by 37% and 55% w.r.t. edge offloading. We also
compare BottleFit with state-of-the-art autoencoders-based approaches, and show
that (i) BottleFit reduces power consumption and execution time respectively by
up to 54% and 44% on the Jetson and 40% and 62% on Raspberry PI; (ii) the size
of the head model executed on the mobile device is 83 times smaller. We publish
the code repository for reproducibility of the results in this study.
","[{'version': 'v1', 'created': 'Fri, 7 Jan 2022 22:08:07 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Apr 2022 06:06:15 GMT'}]",2022-09-07,"[['Matsubara', 'Yoshitomo', ''], ['Callegaro', 'Davide', ''], ['Singh', 'Sameer', ''], ['Levorato', 'Marco', ''], ['Restuccia', 'Francesco', '']]","['Split Computing', 'Split Deep Neural Networks', 'EdgeComputing']"
6504,1508.03686,Diederik Aerts,Diederik Aerts and Massimiliano Sassoli de Bianchi,"Beyond-Quantum Modeling of Question Order Effects and Response
  Replicability in Psychological Measurements","32 pages, 5 figures","Journal of Mathematical Psychology Volume 79, August 2017, Pages
  104-120",10.1016/j.jmp.2017.03.004,,cs.AI quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A general tension-reduction (GTR) model was recently considered to derive
quantum probabilities as (universal) averages over all possible forms of
non-uniform fluctuations, and explain their considerable success in describing
experimental situations also outside of the domain of physics, for instance in
the ambit of quantum models of cognition and decision. Yet, this result also
highlighted the possibility of observing violations of the predictions of the
Born rule, in those situations where the averaging would not be large enough,
or would be altered because of the combination of multiple measurements. In
this article we show that this is indeed the case in typical psychological
measurements exhibiting question order effects, by showing that their
statistics of outcomes are inherently non-Hilbertian, and require the larger
framework of the GTR-model to receive an exact mathematical description. We
also consider another unsolved problem of quantum cognition: response
replicability. It is has been observed that when question order effects and
response replicability occur together, the situation cannot be handled anymore
by quantum theory. However, we show that it can be easily and naturally
described in the GTR-model. Based on these findings, we motivate the adoption
in cognitive science of a hidden-measurements interpretation of the quantum
formalism, and of its GTR-model generalization, as the natural interpretational
framework explaining the data of psychological measurements on conceptual
entities.
","[{'version': 'v1', 'created': 'Sat, 15 Aug 2015 02:07:30 GMT'}]",2017-09-07,"[['Aerts', 'Diederik', ''], ['de Bianchi', 'Massimiliano Sassoli', '']]","['Question order effects', 'Response replicability', 'Quantum cognition', 'Quantum probability', 'Hidden-measurements', 'Born rule', 'Bloch sphere']"
6505,2104.15064,Giovanni Iacca Prof.,"Hao Qiu, Leonardo Lucio Custode, Giovanni Iacca",Black-box adversarial attacks using Evolution Strategies,"To be published in the proceedings of ACM Genetic and Evolutionary
  Computation Conference (GECCO) Companion 2021",,10.1145/3449726.3463137,,cs.CV cs.LG cs.NE,http://creativecommons.org/licenses/by/4.0/,"  In the last decade, deep neural networks have proven to be very powerful in
computer vision tasks, starting a revolution in the computer vision and machine
learning fields. However, deep neural networks, usually, are not robust to
perturbations of the input data. In fact, several studies showed that slightly
changing the content of the images can cause a dramatic decrease in the
accuracy of the attacked neural network. Several methods able to generate
adversarial samples make use of gradients, which usually are not available to
an attacker in real-world scenarios. As opposed to this class of attacks,
another class of adversarial attacks, called black-box adversarial attacks,
emerged, which does not make use of information on the gradients, being more
suitable for real-world attack scenarios. In this work, we compare three
well-known evolution strategies on the generation of black-box adversarial
attacks for image classification tasks. While our results show that the
attacked neural networks can be, in most cases, easily fooled by all the
algorithms under comparison, they also show that some black-box optimization
algorithms may be better in ""harder"" setups, both in terms of attack success
rate and efficiency (i.e., number of queries).
","[{'version': 'v1', 'created': 'Fri, 30 Apr 2021 15:33:07 GMT'}]",2021-05-03,"[['Qiu', 'Hao', ''], ['Custode', 'Leonardo Lucio', ''], ['Iacca', 'Giovanni', '']]","['Adversarial attacks', 'evolution strategies', 'CMA-ES', 'neural networks']"
6506,2002.08455,Mohsen Parisay,"Mohsen Parisay, Charalambos Poullis, Marta Kersten","EyeTAP: A Novel Technique using Voice Inputs to Address the Midas Touch
  Problem for Gaze-based Interactions",,,10.1016/j.ijhcs.2021.102676,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  One of the main challenges of gaze-based interactions is the ability to
distinguish normal eye function from a deliberate interaction with the computer
system, commonly referred to as 'Midas touch'. In this paper we propose, EyeTAP
(Eye tracking point-and-select by Targeted Acoustic Pulse) a hands-free
interaction method for point-and-select tasks. We evaluated the prototype in
two separate user studies, each containing two experiments with 33 participants
and found that EyeTAP is robust even in presence of ambient noise in the audio
input signal with tolerance of up to 70 dB, results in a faster movement time,
and faster task completion time, and has a lower cognitive workload than voice
recognition. In addition, EyeTAP has a lower error rate than the dwell-time
method in a ribbon-shaped experiment. These characteristics make it applicable
for users for whom physical movements are restricted or not possible due to a
disability. Furthermore, EyeTAP has no specific requirements in terms of user
interface design and therefore it can be easily integrated into existing
systems with minimal modifications. EyeTAP can be regarded as an acceptable
alternative to address the Midas touch.
","[{'version': 'v1', 'created': 'Wed, 19 Feb 2020 21:36:25 GMT'}, {'version': 'v2', 'created': 'Sun, 22 Mar 2020 13:41:52 GMT'}]",2021-06-18,"[['Parisay', 'Mohsen', ''], ['Poullis', 'Charalambos', ''], ['Kersten', 'Marta', '']]","['Human-computer interaction', 'eye tracking', 'Midas touch', 'voicerecognition', 'dwell-time', 'hands-free interaction', 'touchless interaction']"
6507,2201.08473,Jeff Nichols,"Jeffrey A. Nichols, Kevin D. Spakes, Cory L. Watson, Robert A. Bridges","Assembling a Cyber Range to Evaluate Artificial Intelligence / Machine
  Learning (AI/ML) Security Tools","ICCWS 2021 16th International Conference on Cyber Warfare and
  Security. Academic Conferences Limited, 2021",,10.34190/IWS.121.079,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  In this case study, we describe the design and assembly of a cyber security
testbed at Oak Ridge National Laboratory in Oak Ridge, TN, USA. The range is
designed to provide agile reconfigurations to facilitate a wide variety of
experiments for evaluations of cyber security tools -- particularly those
involving AI/ML. In particular, the testbed provides realistic test
environments while permitting control and programmatic observations/data
collection during the experiments. We have designed in the ability to repeat
the evaluations, so additional tools can be evaluated and compared at a later
time. The system is one that can be scaled up or down for experiment sizes. At
the time of the conference we will have completed two full-scale, national,
government challenges on this range. These challenges are evaluating the
performance and operating costs for AI/ML-based cyber security tools for
application into large, government-sized networks. These evaluations will be
described as examples providing motivation and context for various design
decisions and adaptations we have made. The first challenge measured end-point
security tools against 100K file samples (benignware and malware) chosen across
a range of file types. The second is an evaluation of network intrusion
detection systems efficacy in identifying multi-step adversarial campaigns --
involving reconnaissance, penetration and exploitations, lateral movement, etc.
-- with varying levels of covertness in a high-volume business network. The
scale of each of these challenges requires automation systems to repeat, or
simultaneously mirror identical the experiments for each ML tool under test.
Providing an array of easy-to-difficult malicious activity for sussing out the
true abilities of the AI/ML tools has been a particularly interesting and
challenging aspect of designing and executing these challenge events.
","[{'version': 'v1', 'created': 'Thu, 20 Jan 2022 22:13:34 GMT'}]",2022-01-24,"[['Nichols', 'Jeffrey A.', ''], ['Spakes', 'Kevin D.', ''], ['Watson', 'Cory L.', ''], ['Bridges', 'Robert A.', '']]","['cybersecurity', 'testbed', 'evaluation', 'challenge']"
6508,2202.13626,Dongjun Hwang,"Dongjun Hwang, Hyunsu Mun, Youngseok Lee",Improving Response Time of Home IoT Services in Federated Learning,"To appear at SAC 2022. Code:
  https://github.com/HwangDongJun/Federated_Learning_using_Websockets",,10.1145/3477314.3508380,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For intelligent home IoT services with sensors and machine learning, we need
to upload IoT data to the cloud server which cannot share private data for
training. A recent machine learning approach, called federated learning, keeps
user data on the device in the distributed computing environment. Though
federated learning is useful for protecting privacy, it experiences poor
performance in terms of the end-to-end response time in home IoT services,
because IoT devices are usually controlled by remote servers in the cloud. In
addition, it is difficult to achieve the high accuracy of federated learning
models due to insufficient data problems and model inversion attacks. In this
paper, we propose a local IoT control method for a federated learning home
service that recognizes the user behavior in the home network quickly and
accurately. We present a federated learning client with transfer learning and
differential privacy to solve data scarcity and data model inversion attack
problems. From experiments, we show that the local control of home IoT devices
for user authentication and control message transmission by the federated
learning clients improves the response time to less than 1 second. Moreover, we
demonstrate that federated learning with transfer learning achieves 97% of
accuracy under 9,000 samples, which is only 2% of the difference from
centralized learning.
","[{'version': 'v1', 'created': 'Mon, 28 Feb 2022 09:08:10 GMT'}]",2022-03-01,"[['Hwang', 'Dongjun', ''], ['Mun', 'Hyunsu', ''], ['Lee', 'Youngseok', '']]","['Internet of Things (IoT)', 'federated learning', 'transfer learning', 'differential privacy', 'response time']"
6509,2007.11197,Rosziati Ibrahim Dr.,"Rosziati Ibrahim, Ammar Aminuddin Bani Amin, Sapiee Jamel, Jahari
  Abdul Wahab","EPiT : A Software Testing Tool for Generation of Test Cases
  Automatically","5 pages, 9 figures",2020 by IJETT Journal,10.14445/22315381/IJETT-V68I7P202S,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software test cases can be defined as a set of condition where a tester needs
to test and determine that the System Under Test (SUT) satisfied with the
expected result correctly. This paper discusses the optimization technique in
generating cases automatically by using EpiT (Eclipse Plug-in Tool). EpiT is
developed to optimize the generation of test cases from source code in order to
reduce time used for conventional manually creating test cases. By using code
smell functionality, EpiT helps to generate test cases automatically from Java
programs by checking its line of code (LOC). The implementation of EpiT will
also be presented based on several case studies conducted to show the
optimization of the test cases generated. Based on the results presented, EpiT
is proven to solve the problem for software tester to generate test case
manually and check the optimization from the source code using code smell
technique.
","[{'version': 'v1', 'created': 'Wed, 22 Jul 2020 04:39:41 GMT'}]",2020-07-23,"[['Ibrahim', 'Rosziati', ''], ['Amin', 'Ammar Aminuddin Bani', ''], ['Jamel', 'Sapiee', ''], ['Wahab', 'Jahari Abdul', '']]","['Software Testing', 'Test Cases', 'Code Smell', 'Source Code', 'System Optimization', 'Line of Code;']"
6510,2208.04952,Aleksandr Dekhovich,"Aleksandr Dekhovich, David M.J. Tax, Marcel H.F. Sluiter, Miguel A.
  Bessa","Continual Prune-and-Select: Class-incremental learning with specialized
  subnetworks",,"Applied Intelligence, 1-16 (2023)",10.1007/s10489-022-04441-z,,cs.LG cs.AI cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The human brain is capable of learning tasks sequentially mostly without
forgetting. However, deep neural networks (DNNs) suffer from catastrophic
forgetting when learning one task after another. We address this challenge
considering a class-incremental learning scenario where the DNN sees test data
without knowing the task from which this data originates. During training,
Continual-Prune-and-Select (CP&S) finds a subnetwork within the DNN that is
responsible for solving a given task. Then, during inference, CP&S selects the
correct subnetwork to make predictions for that task. A new task is learned by
training available neuronal connections of the DNN (previously untrained) to
create a new subnetwork by pruning, which can include previously trained
connections belonging to other subnetwork(s) because it does not update shared
connections. This enables to eliminate catastrophic forgetting by creating
specialized regions in the DNN that do not conflict with each other while still
allowing knowledge transfer across them. The CP&S strategy is implemented with
different subnetwork selection strategies, revealing superior performance to
state-of-the-art continual learning methods tested on various datasets
(CIFAR-100, CUB-200-2011, ImageNet-100 and ImageNet-1000). In particular, CP&S
is capable of sequentially learning 10 tasks from ImageNet-1000 keeping an
accuracy around 94% with negligible forgetting, a first-of-its-kind result in
class-incremental learning. To the best of the authors' knowledge, this
represents an improvement in accuracy above 10% when compared to the best
alternative method.
","[{'version': 'v1', 'created': 'Tue, 9 Aug 2022 10:49:40 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Jan 2023 11:14:40 GMT'}]",2023-01-18,"[['Dekhovich', 'Aleksandr', ''], ['Tax', 'David M. J.', ''], ['Sluiter', 'Marcel H. F.', ''], ['Bessa', 'Miguel A.', '']]","['continual learning', 'class-incremental learning', 'sparse network representation']"
6511,2101.09294,Eddie Yang,"Eddie Yang, Margaret E. Roberts",Censorship of Online Encyclopedias: Implications for NLP Models,Accepted for publication at ACM FAccT 2021,,10.1145/3442188.3445916,,cs.CL cs.AI cs.CY cs.LG,http://creativecommons.org/licenses/by/4.0/,"  While artificial intelligence provides the backbone for many tools people use
around the world, recent work has brought to attention that the algorithms
powering AI are not free of politics, stereotypes, and bias. While most work in
this area has focused on the ways in which AI can exacerbate existing
inequalities and discrimination, very little work has studied how governments
actively shape training data. We describe how censorship has affected the
development of Wikipedia corpuses, text data which are regularly used for
pre-trained inputs into NLP algorithms. We show that word embeddings trained on
Baidu Baike, an online Chinese encyclopedia, have very different associations
between adjectives and a range of concepts about democracy, freedom, collective
action, equality, and people and historical events in China than its regularly
blocked but uncensored counterpart - Chinese language Wikipedia. We examine the
implications of these discrepancies by studying their use in downstream AI
applications. Our paper shows how government repression, censorship, and
self-censorship may impact training data and the applications that draw from
them.
","[{'version': 'v1', 'created': 'Fri, 22 Jan 2021 19:09:53 GMT'}]",2021-01-26,"[['Yang', 'Eddie', ''], ['Roberts', 'Margaret E.', '']]","['word embeddings', 'censorship', 'training data', 'machine learning']"
6512,2110.14270,Emanuele Albini,"Emanuele Albini, Jason Long, Danial Dervovic, Daniele Magazzeni",Counterfactual Shapley Additive Explanations,"Accepted at FAccT '22 (2022 ACM Conference on Fairness,
  Accountability, and Transparency)",,10.1145/3531146.3533168,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Feature attributions are a common paradigm for model explanations due to
their simplicity in assigning a single numeric score for each input feature to
a model. In the actionable recourse setting, wherein the goal of the
explanations is to improve outcomes for model consumers, it is often unclear
how feature attributions should be correctly used. With this work, we aim to
strengthen and clarify the link between actionable recourse and feature
attributions. Concretely, we propose a variant of SHAP, Counterfactual SHAP
(CF-SHAP), that incorporates counterfactual information to produce a background
dataset for use within the marginal (a.k.a. interventional) Shapley value
framework. We motivate the need within the actionable recourse setting for
careful consideration of background datasets when using Shapley values for
feature attributions with numerous synthetic examples. Moreover, we demonstrate
the efficacy of CF-SHAP by proposing and justifying a quantitative score for
feature attributions, counterfactual-ability, showing that as measured by this
metric, CF-SHAP is superior to existing methods when evaluated on public
datasets using tree ensembles.
","[{'version': 'v1', 'created': 'Wed, 27 Oct 2021 08:44:53 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Nov 2021 14:59:28 GMT'}, {'version': 'v3', 'created': 'Thu, 17 Mar 2022 23:27:56 GMT'}, {'version': 'v4', 'created': 'Mon, 16 May 2022 14:28:42 GMT'}]",2022-05-17,"[['Albini', 'Emanuele', ''], ['Long', 'Jason', ''], ['Dervovic', 'Danial', ''], ['Magazzeni', 'Daniele', '']]","['XAI', 'SHAP', 'actionable recourse', 'counterfactual explanations', 'feature attributions', 'feature importance', 'Shapley values', 'explainability']"
6513,1911.07617,Kai Li,"Kai Li, Wei Ni, Yousef Emami, Yiran Shen, Ricardo Severino, David
  Pereira, Eduardo Tovar","Design and Implementation of Secret Key Agreement for Platoon-based
  Vehicular Cyber-Physical Systems",To be published in ACM Transactions on Cyber-Physical Systems (TCPS),,10.1145/3365996,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In platoon-based vehicular cyber-physical system (PVCPS), a lead vehicle that
is responsible for managing the platoon's moving directions and velocity
periodically disseminates control messages to the vehicles that follow.
Securing wireless transmissions of the messages between the vehicles is
critical for privacy and confidentiality of platoon's driving pattern. However,
due to the broadcast nature of radio channels, the transmissions are vulnerable
to eavesdropping. In this paper, we propose a cooperative secret key agreement
(CoopKey) scheme for encrypting/decrypting the control messages, where the
vehicles in PVCPS generate a unified secret key based on the quantized fading
channel randomness. Channel quantization intervals are optimized by dynamic
programming to minimize the mismatch of keys. A platooning testbed is built
with autonomous robotic vehicles, where a TelosB wireless node is used for
onboard data processing and multi-hop dissemination. Extensive real-world
experiments demonstrate that CoopKey achieves significantly low secret bit
mismatch rate in a variety of settings. Moreover, the standard NIST test suite
is employed to verify randomness of the generated keys, where the p-values of
our CoopKey pass all the randomness tests. We also evaluate CoopKey with an
extended platoon size via simulations to investigate the effect of system
scalability on performance.
","[{'version': 'v1', 'created': 'Tue, 22 Oct 2019 00:49:58 GMT'}]",2019-11-19,"[['Li', 'Kai', ''], ['Ni', 'Wei', ''], ['Emami', 'Yousef', ''], ['Shen', 'Yiran', ''], ['Severino', 'Ricardo', ''], ['Pereira', 'David', ''], ['Tovar', 'Eduardo', '']]","['Autonomous vehicles', 'Data dissemination', 'Vehicularcyber-physical system', 'Wireless security', 'Key generation']"
6514,1412.2114,Toru Ohira,Toru Ohira,"Chases and Escapes, and Optimization Problems","3 pages, 4 figures. To appear in the Proceedings of the International
  Symposium on Artificial Life and Robotics (AROB20th), Beppu, Oita Japan,
  January 21-23, 2015",Artificial Life Robotics (2015) 20: 257,10.1007/s10015-015-0220-2,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new approach for solving combinatorial optimization problem by
utilizing the mechanism of chases and escapes, which has a long history in
mathematics. In addition to the well-used steepest descent and neighboring
search, we perform a chase and escape game on the ""landscape"" of the cost
function. We have created a concrete algorithm for the Traveling Salesman
Problem. Our preliminary test indicates a possibility that this new fusion of
chases and escapes problem into combinatorial optimization search is fruitful.
","[{'version': 'v1', 'created': 'Mon, 1 Dec 2014 06:47:28 GMT'}]",2018-04-25,"[['Ohira', 'Toru', '']]","['Problem of Chases and Escapes', 'Combinatorial Optimization', 'Traveling Salesman Problem']"
6515,2005.04158,Omar Reyad,"M.E. Karar, M.F. Al-Rasheed, A.F. Al-Rasheed, O. Reyad","IoT and Neural Network-Based Water Pumping Control System For Smart
  Irrigation","6 pages, 5 figures, 1 table","Inf. Sci. Lett. 9(2), 107-112 (2020)",10.18576/isl/090207,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article aims at saving the wasted water in the process of irrigation
using the Internet of Things (IoT) based on a set of sensors and Multi-Layer
Perceptron (MLP) neural network. The developed system handles the sensor data
using the Arduino board to control the water pump automatically. The sensors
measure the environmental factors; namely temperature, humidity, and soil
moisture to estimate the required time for the operation of water irrigation.
The water pump control system consists of software and hardware tools such as
Arduino Remote XY interface and electronic sensors in the framework of IoT
technology. The machine learning algorithm such as the MLP neural network plays
an important role to support the decision of automatic control of IoT-based
irrigation system, managing the water consumption effectively.
","[{'version': 'v1', 'created': 'Fri, 8 May 2020 16:51:26 GMT'}]",2020-05-11,"[['Karar', 'M. E.', ''], ['Al-Rasheed', 'M. F.', ''], ['Al-Rasheed', 'A. F.', ''], ['Reyad', 'O.', '']]","['Artificial Intelligence', 'Smart Agriculture', 'Internet of Things', 'Embedded Systems']"
6516,2104.05314,Christian Janiesch,"Christian Janiesch, Patrick Zschech, Kai Heinrich",Machine learning and deep learning,Published online first in Electronic Markets,,10.1007/s12525-021-00475-2,,cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Today, intelligent systems that offer artificial intelligence capabilities
often rely on machine learning. Machine learning describes the capacity of
systems to learn from problem-specific training data to automate the process of
analytical model building and solve associated tasks. Deep learning is a
machine learning concept based on artificial neural networks. For many
applications, deep learning models outperform shallow machine learning models
and traditional data analysis approaches. In this article, we summarize the
fundamentals of machine learning and deep learning to generate a broader
understanding of the methodical underpinning of current intelligent systems. In
particular, we provide a conceptual distinction between relevant terms and
concepts, explain the process of automated analytical model building through
machine learning and deep learning, and discuss the challenges that arise when
implementing such intelligent systems in the field of electronic markets and
networked business. These naturally go beyond technological aspects and
highlight issues in human-machine interaction and artificial intelligence
servitization.
","[{'version': 'v1', 'created': 'Mon, 12 Apr 2021 09:54:12 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Apr 2021 10:31:01 GMT'}]",2021-04-15,"[['Janiesch', 'Christian', ''], ['Zschech', 'Patrick', ''], ['Heinrich', 'Kai', '']]","['Machine learning', 'Deep learning', 'Artificial intelligence', 'Artificial neural networks']"
6517,2111.00480,Justin Edwards,"Justin Edwards, Orla Cooney, Rachel Edwards","Alexa, Play Fetch! A Review of Alexa Skills for Pets","Accepted, Animal Computer Interaction 2021 (ACI '21)",,10.1145/3493842.3493902,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Alexa Skills are used for a variety of daily routines and purposes, but
little research has focused on a key part of many people's daily lives: their
pets. We present a systematic review categorizing the purposes of 88 Alexa
Skills aimed at pets and pet owners and introduce a veterinary perspective to
assess their benefits and risks. We present 8 themes of the purposes for Skills
aimed at pets and their owners: Calming, Animal Audience, Smart Device,
Tracking, Training and Health, Translator, Entertainment/Trivia, and Other -
Human Audience. Broadly, we find that these purposes mirror the purposes people
have for using Alexa overall, and they largely are supported by veterinary
evidence, though caution must be used when Skills relate to animal health. More
collaboration between Conversational Agent researchers and animal scientists is
called for to better understand the efficacy of using Alexa with pets.
","[{'version': 'v1', 'created': 'Sun, 31 Oct 2021 12:24:06 GMT'}]",2021-11-02,"[['Edwards', 'Justin', ''], ['Cooney', 'Orla', ''], ['Edwards', 'Rachel', '']]","['conversational agents', 'Alexa', 'pets', 'animals', 'animal-computer interaction']"
6518,1911.00760,Sendong Zhao,"Sendong Zhao, Chang Su, Andrea Sboner, Fei Wang","GRAPHENE: A Precise Biomedical Literature Retrieval Engine with Graph
  Augmented Deep Learning and External Knowledge Empowerment",CIKM 2019,,10.1145/3357384.3358038,,cs.IR cs.CL cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Effective biomedical literature retrieval (BLR) plays a central role in
precision medicine informatics. In this paper, we propose GRAPHENE, which is a
deep learning based framework for precise BLR. GRAPHENE consists of three main
different modules 1) graph-augmented document representation learning; 2) query
expansion and representation learning and 3) learning to rank biomedical
articles. The graph-augmented document representation learning module
constructs a document-concept graph containing biomedical concept nodes and
document nodes so that global biomedical related concept from external
knowledge source can be captured, which is further connected to a BiLSTM so
both local and global topics can be explored. Query expansion and
representation learning module expands the query with abbreviations and
different names, and then builds a CNN-based model to convolve the expanded
query and obtain a vector representation for each query. Learning to rank
minimizes a ranking loss between biomedical articles with the query to learn
the retrieval function. Experimental results on applying our system to TREC
Precision Medicine track data are provided to demonstrate its effectiveness.
","[{'version': 'v1', 'created': 'Sat, 2 Nov 2019 18:05:20 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Nov 2019 20:39:33 GMT'}]",2019-11-22,"[['Zhao', 'Sendong', ''], ['Su', 'Chang', ''], ['Sboner', 'Andrea', ''], ['Wang', 'Fei', '']]","['Biomedical Literature Retrieval', 'Graph Augmented Document Representation Learning', 'Deep Neural Networks', 'Learning to Rank']"
6519,2101.11441,Mauro Innocente,"Mauro S. Innocente, Johann Sienz","Pseudo-Adaptive Penalization to Handle Constraints in Particle Swarm
  Optimizers","Preprint submitted to Proceedings of the tenth International
  Conference on Computational Structures Technology",,10.4203/ccp.93.123,,cs.NE math.OC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The penalization method is a popular technique to provide particle swarm
optimizers with the ability to handle constraints. The downside is the need of
penalization coefficients whose settings are problem-specific. While adaptive
coefficients can be found in the literature, a different adaptive scheme is
proposed in this paper, where coefficients are kept constant. A pseudo-adaptive
relaxation of the tolerances for constraint violations while penalizing only
violations beyond such tolerances results in a pseudo-adaptive penalization. A
particle swarm optimizer is tested on a suite of benchmark problems for three
types of tolerance relaxation: no relaxation; self-tuned initial relaxation
with deterministic decrease; and self-tuned initial relaxation with
pseudo-adaptive decrease. Other authors' results are offered as frames of
reference.
","[{'version': 'v1', 'created': 'Mon, 25 Jan 2021 10:09:48 GMT'}]",2021-01-28,"[['Innocente', 'Mauro S.', ''], ['Sienz', 'Johann', '']]","['particle swarm optimization', 'constrained problems', 'penalization with constant coefficients', 'pseudo-adaptive tolerance relaxation']"
6520,2008.06133,Marc Badger,"Marc Badger, Yufu Wang, Adarsh Modh, Ammon Perkes, Nikos Kolotouros,
  Bernd G. Pfrommer, Marc F. Schmidt, Kostas Daniilidis","3D Bird Reconstruction: a Dataset, Model, and Shape Recovery from a
  Single View",In ECCV 2020,"ECCV 2020, vol 12363, pp 1-17",10.1007/978-3-030-58523-5_1,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated capture of animal pose is transforming how we study neuroscience
and social behavior. Movements carry important social cues, but current methods
are not able to robustly estimate pose and shape of animals, particularly for
social animals such as birds, which are often occluded by each other and
objects in the environment. To address this problem, we first introduce a model
and multi-view optimization approach, which we use to capture the unique shape
and pose space displayed by live birds. We then introduce a pipeline and
experiments for keypoint, mask, pose, and shape regression that recovers
accurate avian postures from single views. Finally, we provide extensive
multi-view keypoint and mask annotations collected from a group of 15 social
birds housed together in an outdoor aviary. The project website with videos,
results, code, mesh model, and the Penn Aviary Dataset can be found at
https://marcbadger.github.io/avian-mesh.
","[{'version': 'v1', 'created': 'Thu, 13 Aug 2020 23:29:04 GMT'}]",2021-01-13,"[['Badger', 'Marc', ''], ['Wang', 'Yufu', ''], ['Modh', 'Adarsh', ''], ['Perkes', 'Ammon', ''], ['Kolotouros', 'Nikos', ''], ['Pfrommer', 'Bernd G.', ''], ['Schmidt', 'Marc F.', ''], ['Daniilidis', 'Kostas', '']]","['pose estimation', 'shape estimation', 'birds', 'animals', 'dataset']"
6521,2212.02679,Hui Li,"Zequan Xu, Lianyun Li, Hui Li, Qihang Sun, Shaofeng Hu, Rongrong Ji","Self-supervised Graph Representation Learning for Black Market Account
  Detection",WSDM 2023. This is the complete version containing the appendix,,10.1145/3539597.3570466,,cs.SI cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, Multi-purpose Messaging Mobile App (MMMA) has become increasingly
prevalent. MMMAs attract fraudsters and some cybercriminals provide support for
frauds via black market accounts (BMAs). Compared to fraudsters, BMAs are not
directly involved in frauds and are more difficult to detect. This paper
illustrates our BMA detection system SGRL (Self-supervised Graph Representation
Learning) used in WeChat, a representative MMMA with over a billion users. We
tailor Graph Neural Network and Graph Self-supervised Learning in SGRL for BMA
detection. The workflow of SGRL contains a pretraining phase that utilizes
structural information, node attribute information and available human
knowledge, and a lightweight detection phase. In offline experiments, SGRL
outperforms state-of-the-art methods by 16.06%-58.17% on offline evaluation
measures. We deploy SGRL in the online environment to detect BMAs on the
billion-scale WeChat graph, and it exceeds the alternative by 7.27% on the
online evaluation measure. In conclusion, SGRL can alleviate label reliance,
generalize well to unseen data, and effectively detect BMAs in WeChat.
","[{'version': 'v1', 'created': 'Tue, 6 Dec 2022 00:42:00 GMT'}]",2022-12-07,"[['Xu', 'Zequan', ''], ['Li', 'Lianyun', ''], ['Li', 'Hui', ''], ['Sun', 'Qihang', ''], ['Hu', 'Shaofeng', ''], ['Ji', 'Rongrong', '']]","['black market account detection', 'multi-purpose messaging mobileapp', 'self-supervised learning', 'graph neural network']"
6522,2301.02555,Siddharth Karamcheti,"Yuchen Cui and Siddharth Karamcheti and Raj Palleti and Nidhya
  Shivakumar and Percy Liang and Dorsa Sadigh","""No, to the Right"" -- Online Language Corrections for Robotic
  Manipulation via Shared Autonomy","Accepted to the 18th ACM/IEEE International Conference on Human Robot
  Interaction (HRI), Marc 2023. First two authors contributed equally. 9 Pages,
  7 Figures",,10.1145/3568162.3578623,,cs.RO cs.AI cs.CL cs.HC cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Systems for language-guided human-robot interaction must satisfy two key
desiderata for broad adoption: adaptivity and learning efficiency.
Unfortunately, existing instruction-following agents cannot adapt, lacking the
ability to incorporate online natural language supervision, and even if they
could, require hundreds of demonstrations to learn even simple policies. In
this work, we address these problems by presenting Language-Informed Latent
Actions with Corrections (LILAC), a framework for incorporating and adapting to
natural language corrections - ""to the right,"" or ""no, towards the book"" -
online, during execution. We explore rich manipulation domains within a shared
autonomy paradigm. Instead of discrete turn-taking between a human and robot,
LILAC splits agency between the human and robot: language is an input to a
learned model that produces a meaningful, low-dimensional control space that
the human can use to guide the robot. Each real-time correction refines the
human's control space, enabling precise, extended behaviors - with the added
benefit of requiring only a handful of demonstrations to learn. We evaluate our
approach via a user study where users work with a Franka Emika Panda
manipulator to complete complex manipulation tasks. Compared to existing
learned baselines covering both open-loop instruction following and single-turn
shared autonomy, we show that our corrections-aware approach obtains higher
task completion rates, and is subjectively preferred by users because of its
reliability, precision, and ease of use.
","[{'version': 'v1', 'created': 'Fri, 6 Jan 2023 15:03:27 GMT'}]",2023-01-09,"[['Cui', 'Yuchen', ''], ['Karamcheti', 'Siddharth', ''], ['Palleti', 'Raj', ''], ['Shivakumar', 'Nidhya', ''], ['Liang', 'Percy', ''], ['Sadigh', 'Dorsa', '']]","['Online corrections', 'language & shared autonomy', 'robot learning']"
6523,2107.08621,Qingzhong Wang,"Qingzhong Wang, Pengfei Zhang, Haoyi Xiong and Jian Zhao",Face.evoLVe: A High-Performance Face Recognition Library,"A short verson is accepted by NeuroComputing
  (https://www.sciencedirect.com/science/article/pii/S0925231222005057?via%3Dihub).
  Primary corresponding author is Dr. Jian Zhao",NeuroComputing 494 (2022) 443-445,10.1016/j.neucom.2022.04.118,,cs.CV cs.AI cs.MM,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we develop face.evoLVe -- a comprehensive library that
collects and implements a wide range of popular deep learning-based methods for
face recognition. First of all, face.evoLVe is composed of key components that
cover the full process of face analytics, including face alignment, data
processing, various backbones, losses, and alternatives with bags of tricks for
improving performance. Later, face.evoLVe supports multi-GPU training on top of
different deep learning platforms, such as PyTorch and PaddlePaddle, which
facilitates researchers to work on both large-scale datasets with millions of
images and low-shot counterparts with limited well-annotated data. More
importantly, along with face.evoLVe, images before & after alignment in the
common benchmark datasets are released with source codes and trained models
provided. All these efforts lower the technical burdens in reproducing the
existing methods for comparison, while users of our library could focus on
developing advanced approaches more efficiently. Last but not least,
face.evoLVe is well designed and vibrantly evolving, so that new face
recognition approaches can be easily plugged into our framework. Note that we
have used face.evoLVe to participate in a number of face recognition
competitions and secured the first place. The version that supports PyTorch is
publicly available at https://github.com/ZhaoJ9014/face.evoLVe.PyTorch and the
PaddlePaddle version is available at
https://github.com/ZhaoJ9014/face.evoLVe.PyTorch/tree/master/paddle.
Face.evoLVe has been widely used for face analytics, receiving 2.4K stars and
622 forks.
","[{'version': 'v1', 'created': 'Mon, 19 Jul 2021 05:38:50 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Jul 2021 09:24:48 GMT'}, {'version': 'v3', 'created': 'Sat, 9 Oct 2021 03:20:11 GMT'}, {'version': 'v4', 'created': 'Thu, 5 May 2022 06:30:07 GMT'}]",2022-05-06,"[['Wang', 'Qingzhong', ''], ['Zhang', 'Pengfei', ''], ['Xiong', 'Haoyi', ''], ['Zhao', 'Jian', '']]","['Face Analytics', 'Toolbox', 'Library', 'PyTorch', 'PaddlePaddle']"
6524,cs/0608050,Matthieu Latapy,Pascal Pons and Matthieu Latapy,"Post-Processing Hierarchical Community Structures: Quality Improvements
  and Multi-scale View",,"Theoretical Computer Science, volume 412, issues 8-10, 4 March
  2011, pages 892-900",10.1016/j.tcs.2010.11.041,,cs.DS cond-mat.dis-nn physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  Dense sub-graphs of sparse graphs (communities), which appear in most
real-world complex networks, play an important role in many contexts. Most
existing community detection algorithms produce a hierarchical structure of
community and seek a partition into communities that optimizes a given quality
function. We propose new methods to improve the results of any of these
algorithms. First we show how to optimize a general class of additive quality
functions (containing the modularity, the performance, and a new similarity
based quality function we propose) over a larger set of partitions than the
classical methods. Moreover, we define new multi-scale quality functions which
make it possible to detect the different scales at which meaningful community
structures appear, while classical approaches find only one partition.
","[{'version': 'v1', 'created': 'Wed, 9 Aug 2006 09:23:06 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Jan 2021 15:13:55 GMT'}]",2021-01-13,"[['Pons', 'Pascal', ''], ['Latapy', 'Matthieu', '']]","['hierarchical clustering', 'community detection', 'complex network', 'graph algorithm', 'multi-scale']"
6525,2203.12455,Eoghan Cunningham,"Eoghan Cunningham, Derek Greene",Assessing Network Representations for Identifying Interdisciplinarity,,,10.1145/3487553.3524653,,cs.DL cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Many studies have sought to identify interdisciplinary research as a function
of the diversity of disciplines identified in an article's references or
citations. However, given the constant evolution of the scientific landscape,
disciplinary boundaries are shifting and blurring, making it increasingly
difficult to describe research within a strict taxonomy. In this work, we
explore the potential for graph learning methods to learn embedded
representations for research papers that encode their 'interdisciplinarity' in
a citation network. This facilitates the identification of interdisciplinary
research without the use of disciplinary categories. We evaluate these
representations and their ability to identify interdisciplinary research,
according to their utility in interdisciplinary citation prediction. We find
that those representations which preserve structural equivalence in the
citation graph are best able to predict distant, interdisciplinary interactions
in the network, according to multiple definitions of citation distance.
","[{'version': 'v1', 'created': 'Wed, 23 Mar 2022 14:54:07 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Apr 2022 11:59:15 GMT'}]",2022-04-11,"[['Cunningham', 'Eoghan', ''], ['Greene', 'Derek', '']]","['datasets', 'scientific knowledge representation', 'interdisciplinarity']"
6526,2204.10851,Jamie Seol,"Jinseok Seol, Youngrok Ko, Sang-goo Lee","Exploiting Session Information in BERT-based Session-aware Sequential
  Recommendation","6 pages, accepted in The 45th International ACM SIGIR Conference on
  Research and Development in Information Retrieval (SIGIR) 2022, short paper",,10.1145/3477495.3531910,,cs.IR cs.AI,http://creativecommons.org/licenses/by-sa/4.0/,"  In recommendation systems, utilizing the user interaction history as
sequential information has resulted in great performance improvement. However,
in many online services, user interactions are commonly grouped by sessions
that presumably share preferences, which requires a different approach from
ordinary sequence representation techniques. To this end, sequence
representation models with a hierarchical structure or various viewpoints have
been developed but with a rather complex network structure. In this paper, we
propose three methods to improve recommendation performance by exploiting
session information while minimizing additional parameters in a BERT-based
sequential recommendation model: using session tokens, adding session segment
embeddings, and a time-aware self-attention. We demonstrate the feasibility of
the proposed methods through experiments on widely used recommendation
datasets.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2022 17:58:10 GMT'}, {'version': 'v2', 'created': 'Wed, 4 May 2022 16:53:33 GMT'}, {'version': 'v3', 'created': 'Thu, 19 May 2022 18:13:23 GMT'}]",2022-05-23,"[['Seol', 'Jinseok', ''], ['Ko', 'Youngrok', ''], ['Lee', 'Sang-goo', '']]","['Session-aware Recommendation', 'Sequential Recommendation', 'Temporal Self-Attention']"
6527,1604.04641,David Guillermo Fajardo Ortiz,"David Fajardo-Ortiz, Luis Duran, Laura Moreno, Hector Ochoa, Victor-M
  Castano","Liposomes versus metallic nanostructures: differences in the process of
  knowledge translation in cancer",,International Journal of Nanomedicine. 2014; 9: 2627-2634,10.2147/IJN.S62315,,cs.DL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This research maps the knowledge translation process for two different types
of nanotechnologies applied to cancer: liposomes and metallic nanostructures
(MNs). We performed a structural analysis of citation networks and text mining
supported in controlled vocabularies. In the case of liposomes, our results
identify subnetworks (invisible colleges) associated with different therapeutic
strategies: nanopharmacology, hyperthermia, and gene therapy. Only in the
pharmacological strategy was an organized knowledge translation process
identified, which, however, is monopolized by the liposomal doxorubicins. In
the case of MNs, subnetworks are not differentiated by the type of therapeutic
strategy, and the content of the documents is still basic research. Research on
MNs is highly focused on developing a combination of molecular imaging and
photothermal therapy.
","[{'version': 'v1', 'created': 'Tue, 12 Apr 2016 15:06:02 GMT'}]",2016-04-19,"[['Fajardo-Ortiz', 'David', ''], ['Duran', 'Luis', ''], ['Moreno', 'Laura', ''], ['Ochoa', 'Hector', ''], ['Castano', 'Victor-M', '']]","['nanotechnology', 'citation network analysis', 'basic research', 'clinics', 'health care']"
6528,2205.15426,Andrea Raffo,"Andrea Raffo, Chiara Romanengo, Bianca Falcidieno, Silvia Biasotti","Fitting and recognition of geometric primitives in segmented 3D point
  clouds using a localized voting procedure",,,10.1016/j.cagd.2022.102123,,cs.CV cs.CG cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The automatic creation of geometric models from point clouds has numerous
applications in CAD (e.g., reverse engineering, manufacturing, assembling) and,
more in general, in shape modelling and processing. Given a segmented point
cloud representing a man-made object, we propose a method for recognizing
simple geometric primitives and their interrelationships. Our approach is based
on the Hough transform (HT) for its ability to deal with noise, missing parts
and outliers. In our method we introduce a novel technique for processing
segmented point clouds that, through a voting procedure, is able to provide an
initial estimate of the geometric parameters characterizing each primitive
type. By using these estimates, we localize the search of the optimal solution
in a dimensionally-reduced parameter space thus making it efficient to extend
the HT to more primitives than those that are generally found in the
literature, i.e. planes and spheres. Then, we extract a number of geometric
descriptors that uniquely characterize a segment, and, on the basis of these
descriptors, we show how to aggregate parts of primitives (segments).
Experiments on both synthetic and industrial scans reveal the robustness of the
primitive fitting method and its effectiveness for inferring relations among
segments.
","[{'version': 'v1', 'created': 'Mon, 30 May 2022 20:47:43 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jul 2022 08:54:44 GMT'}]",2022-07-08,"[['Raffo', 'Andrea', ''], ['Romanengo', 'Chiara', ''], ['Falcidieno', 'Bianca', ''], ['Biasotti', 'Silvia', '']]","['point clouds', 'surface primitives', 'standard forms', 'geometric descriptors']"
6529,2009.14474,Qiang Dong,"Qiang Dong, Shuang-Shuang Xie, Wen-Jun Li",User-item matching for recommendation fairness,,"Q. Dong*, S.-S. Xie, W.-J. Li, User-item matching for
  recommendation fairness, IEEE Access, 2021, 9: 130389-130398",10.1109/ACCESS.2021.3113975.,,cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As we all know, users and item-providers are two main parties of participants
in recommender systems. However, most existing research efforts on
recommendation were focused on better serving users and overlooked the purpose
of item-providers. This paper is devoted to improve the item exposure fairness
for item-providers' objective, and keep the recommendation accuracy not
decreased or even improved for users' objective. We propose to set stock volume
constraints on items, to be specific, limit the maximally allowable recommended
times of an item to be proportional to the frequency of its being interacted in
the past, which is validated to achieve superior item exposure fairness to
common recommenders and thus mitigates the Matthew Effect on item popularity.
With the two constraints of pre-existing recommendation length of users and our
stock volumes of items, a heuristic strategy based on normalized scores and a
Minimum Cost Maximum Flow (MCMF) based model are proposed to solve the optimal
user-item matching problem, whose accuracy performances are even better than
that of baseline algorithm in regular recommendation context, and in line with
state-of-the-art enhancement of the baseline. What's more, our MCMF based
strategy is parameter-free, while those counterpart algorithms have to resort
to parameter traversal process to achieve their best performance.
","[{'version': 'v1', 'created': 'Wed, 30 Sep 2020 07:20:45 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Oct 2021 06:29:29 GMT'}]",2021-10-22,"[['Dong', 'Qiang', ''], ['Xie', 'Shuang-Shuang', ''], ['Li', 'Wen-Jun', '']]","['Minimum Cost Maximum Flow', 'popularity bias', 'recommendation fairness', 'recommender systems', 'stock constraint']"
6530,2007.00636,John Leung,"John Kalung Leung, Igor Griva, William G. Kennedy","Using Affective Features from Media Content Metadata for Better Movie
  Recommendations","8 pages, 10 tables, 1 figure, and presented in KDIR2020 Proceedings
  of the 12th International Joint Conference on Knowledge Discovery, Knowledge
  Engineering and Knowledge Management","In Proceedings of the 12th International Joint Conference on
  Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume
  1: KDIR, 161-168, 2020",10.5220/0010056201610168,,cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper investigates the causality in the decision making of movie
recommendations through the users' affective profiles. We advocate a method of
assigning emotional tags to a movie by the auto-detection of the affective
features in the movie's overview. We apply a text-based Emotion Detection and
Recognition model, which trained by tweets short messages and transfers the
learned model to detect movie overviews' implicit affective features. We
vectorized the affective movie tags to represent the mood embeddings of the
movie. We obtain the user's emotional features by taking the average of all the
movies' affective vectors the user has watched. We apply five-distance metrics
to rank the Top-N movie recommendations against the user's emotion profile. We
found Cosine Similarity distance metrics performed better than other distance
metrics measures. We conclude that by replacing the top-N recommendations
generated by the Recommender with the reranked recommendations list made by the
Cosine Similarity distance metrics, the user will effectively get affective
aware top-N recommendations while making the Recommender feels like an Emotion
Aware Recommender.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2020 17:36:24 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Feb 2021 19:17:29 GMT'}]",2021-02-12,"[['Leung', 'John Kalung', ''], ['Griva', 'Igor', ''], ['Kennedy', 'William G.', '']]","['affective computing', 'affective aware top-N recommendations', 'deep learning', 'text-based emotion mining']"
6531,2205.03464,Poorna Dasgupta,Poorna Banerjee Dasgupta,"Comparative Analysis of Non-Blind Deblurring Methods for Noisy Blurred
  Images","8 pages, Published with International Journal of Computer Trends and
  Technology (IJCTT), Volume-70 Issue-3, 2022",,10.14445/22312803/IJCTT-V70I3P101,,cs.CV eess.IV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Image blurring refers to the degradation of an image wherein the image's
overall sharpness decreases. Image blurring is caused by several factors.
Additionally, during the image acquisition process, noise may get added to the
image. Such a noisy and blurred image can be represented as the image resulting
from the convolution of the original image with the associated point spread
function, along with additive noise. However, the blurred image often contains
inadequate information to uniquely determine the plausible original image.
Based on the availability of blurring information, image deblurring methods can
be classified as blind and non-blind. In non-blind image deblurring, some prior
information is known regarding the corresponding point spread function and the
added noise. The objective of this study is to determine the effectiveness of
non-blind image deblurring methods with respect to the identification and
elimination of noise present in blurred images. In this study, three non-blind
image deblurring methods, namely Wiener deconvolution, Lucy-Richardson
deconvolution, and regularized deconvolution were comparatively analyzed for
noisy images featuring salt-and-pepper noise. Two types of blurring effects
were simulated, namely motion blurring and Gaussian blurring. The said three
non-blind deblurring methods were applied under two scenarios: direct
deblurring of noisy blurred images and deblurring of images after denoising
through the application of the adaptive median filter. The obtained results
were then compared for each scenario to determine the best approach for
deblurring noisy images.
","[{'version': 'v1', 'created': 'Fri, 6 May 2022 20:07:29 GMT'}]",2022-05-10,"[['Dasgupta', 'Poorna Banerjee', '']]","['Deconvolution', 'Image blurring', 'Noise', 'Nonblind image deblurring', 'Point spread function']"
6532,1810.03993,Margaret Mitchell,"Margaret Mitchell and Simone Wu and Andrew Zaldivar and Parker Barnes
  and Lucy Vasserman and Ben Hutchinson and Elena Spitzer and Inioluwa Deborah
  Raji and Timnit Gebru",Model Cards for Model Reporting,,"FAT* '19: Conference on Fairness, Accountability, and
  Transparency, January 29--31, 2019, Atlanta, GA, USA",10.1145/3287560.3287596,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Trained machine learning models are increasingly used to perform high-impact
tasks in areas such as law enforcement, medicine, education, and employment. In
order to clarify the intended use cases of machine learning models and minimize
their usage in contexts for which they are not well suited, we recommend that
released models be accompanied by documentation detailing their performance
characteristics. In this paper, we propose a framework that we call model
cards, to encourage such transparent model reporting. Model cards are short
documents accompanying trained machine learning models that provide benchmarked
evaluation in a variety of conditions, such as across different cultural,
demographic, or phenotypic groups (e.g., race, geographic location, sex,
Fitzpatrick skin type) and intersectional groups (e.g., age and race, or sex
and Fitzpatrick skin type) that are relevant to the intended application
domains. Model cards also disclose the context in which models are intended to
be used, details of the performance evaluation procedures, and other relevant
information. While we focus primarily on human-centered machine learning models
in the application fields of computer vision and natural language processing,
this framework can be used to document any trained machine learning model. To
solidify the concept, we provide cards for two supervised models: One trained
to detect smiling faces in images, and one trained to detect toxic comments in
text. We propose model cards as a step towards the responsible democratization
of machine learning and related AI technology, increasing transparency into how
well AI technology works. We hope this work encourages those releasing trained
machine learning models to accompany model releases with similar detailed
evaluation numbers and other relevant documentation.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 22:33:43 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Jan 2019 20:25:27 GMT'}]",2019-01-16,"[['Mitchell', 'Margaret', ''], ['Wu', 'Simone', ''], ['Zaldivar', 'Andrew', ''], ['Barnes', 'Parker', ''], ['Vasserman', 'Lucy', ''], ['Hutchinson', 'Ben', ''], ['Spitzer', 'Elena', ''], ['Raji', 'Inioluwa Deborah', ''], ['Gebru', 'Timnit', '']]","['datasheets', 'model cards', 'documentation', 'disaggregated evaluation', 'fairness evaluation', 'ML model evaluation', 'ethical considerations']"
6533,1907.01421,Mark Scanlon,Xiaoyu Du and Mark Scanlon,"Methodology for the Automated Metadata-Based Classification of
  Incriminating Digital Forensic Artefacts",,"14th International Conference on Availability, Reliability and
  Security (ARES 2019), Canterbury, UK, August 2019",10.1145/3339252.3340517,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ever increasing volume of data in digital forensic investigation is one
of the most discussed challenges in the field. Usually, most of the file
artefacts on seized devices are not pertinent to the investigation. Manually
retrieving suspicious files relevant to the investigation is akin to finding a
needle in a haystack. In this paper, a methodology for the automatic
prioritisation of suspicious file artefacts (i.e., file artefacts that are
pertinent to the investigation) is proposed to reduce the manual analysis
effort required. This methodology is designed to work in a human-in-the-loop
fashion. In other words, it predicts/recommends that an artefact is likely to
be suspicious rather than giving the final analysis result. A supervised
machine learning approach is employed, which leverages the recorded results of
previously processed cases. The process of features extraction, dataset
generation, training and evaluation are presented in this paper. In addition, a
toolkit for data extraction from disk images is outlined, which enables this
method to be integrated with the conventional investigation process and work in
an automated fashion.
","[{'version': 'v1', 'created': 'Tue, 2 Jul 2019 14:58:24 GMT'}]",2019-07-03,"[['Du', 'Xiaoyu', ''], ['Scanlon', 'Mark', '']]","['Digital Forensics', 'Automatic Forensic Investigation', 'Artefact Relevancy', 'Machine Learning']"
6534,1411.7149,Mart\'in Pereira-Fari\~na,"M. Pereira-Fari\~na, Juan C. Vidal, F. D\'iaz-Hermida, A. Bugar\'in",A Fuzzy Syllogistic Reasoning Schema for Generalized Quantifiers,"22 pages, 6 figures, journal paper","(2014) Fuzzy Sets and Systems 234, 79-96",10.1016/j.fss.2013.02.007,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a new approximate syllogistic reasoning schema is described
that expands some of the approaches expounded in the literature into two ways:
(i) a number of different types of quantifiers (logical, absolute,
proportional, comparative and exception) taken from Theory of Generalized
Quantifiers and similarity quantifiers, taken from statistics, are considered
and (ii) any number of premises can be taken into account within the reasoning
process. Furthermore, a systematic reasoning procedure to solve the syllogism
is also proposed, interpreting it as an equivalent mathematical optimization
problem, where the premises constitute the constraints of the searching space
for the quantifier in the conclusion.
","[{'version': 'v1', 'created': 'Wed, 26 Nov 2014 09:26:14 GMT'}]",2014-11-27,"[['Pereira-Fariña', 'M.', ''], ['Vidal', 'Juan C.', ''], ['Díaz-Hermida', 'F.', ''], ['Bugarín', 'A.', '']]","['fuzzy syllogism', 'fuzzy quantifiers', 'approximate reasoning']"
6535,2006.04275,Mirko Marras,"Ludovico Boratto, Gianni Fenu, Mirko Marras","Connecting User and Item Perspectives in Popularity Debiasing for
  Collaborative Recommendation","Accepted in Information Processing & Management, 58(1), 102387","Information Processing & Management, 58(1), 102387 (2021)",10.1016/j.ipm.2020.102387,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender systems learn from historical users' feedback that is often
non-uniformly distributed across items. As a consequence, these systems may end
up suggesting popular items more than niche items progressively, even when the
latter would be of interest for users. This can hamper several core qualities
of the recommended lists (e.g., novelty, coverage, diversity), impacting on the
future success of the underlying platform itself. In this paper, we formalize
two novel metrics that quantify how much a recommender system equally treats
items along the popularity tail. The first one encourages equal probability of
being recommended across items, while the second one encourages true positive
rates for items to be equal. We characterize the recommendations of
representative algorithms by means of the proposed metrics, and we show that
the item probability of being recommended and the item true positive rate are
biased against the item popularity. To promote a more equal treatment of items
along the popularity tail, we propose an in-processing approach aimed at
minimizing the biased correlation between user-item relevance and item
popularity. Extensive experiments show that, with small losses in accuracy, our
popularity-mitigation approach leads to important gains in beyond-accuracy
recommendation quality.
","[{'version': 'v1', 'created': 'Sun, 7 Jun 2020 21:45:55 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Oct 2020 17:32:54 GMT'}]",2020-10-06,"[['Boratto', 'Ludovico', ''], ['Fenu', 'Gianni', ''], ['Marras', 'Mirko', '']]","['Recommender Systems', 'Popularity Bias', 'Beyond-Accuracy']"
6536,1410.5694,Sahar Vahdati,"Sahar Vahdati, Christoph Lange, S\""oren Auer","OpenCourseWare Observatory -- Does the Quality of OpenCourseWare Live up
  to its Promise?","A later version of this paper was presented in the proceedings of the
  Fifth International Conference on Learning Analytics And Knowledge(2015),
  pages 73-82. http://dl.acm.org/citation.cfm?id=2723605 On Zenodo:
  https://zenodo.org/deposit/21264/",,10.1145/2723576.2723605,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  A vast amount of OpenCourseWare (OCW) is meanwhile being published online to
make educational content accessible to larger audiences. The awareness of such
courses among users and the popularity of systems providing such courses are
increasing. However, from a subjective experience, OCW is frequently cursory,
outdated or non-reusable. In order to obtain a better understanding of the
quality of OCW, we assess the quality in terms of fitness for use. Based on
three OCW use case scenarios, we define a range of dimensions according to
which the quality of courses can be measured. From the definition of each
dimension a comprehensive list of quality metrics is derived. In order to
obtain a representative overview of the quality of OCW, we performed a quality
assessment on a set of 100 randomly selected courses obtained from 20 different
OCW repositories. Based on this assessment we identify crucial areas in which
OCW needs to improve in order to deliver up to its promises.
","[{'version': 'v1', 'created': 'Tue, 21 Oct 2014 14:54:56 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Apr 2015 09:14:47 GMT'}]",2015-04-15,"[['Vahdati', 'Sahar', ''], ['Lange', 'Christoph', ''], ['Auer', 'Sören', '']]","['OpenCourseWare', 'Quality Metrics', 'Quality Assessment', 'EducationalContent']"
6537,2201.12914,Stephany Rajeh,"Stephany Rajeh and Marinette Savonnet and Eric Leclercq and Hocine
  Cherifi","Investigating Centrality Measures in Social Networks with Community
  Structure","Accepted in The International Conference on Complex Networks and
  their Applications (2020)",,10.1007/978-3-030-65347-7_18,,cs.SI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Centrality measures are crucial in quantifying the influence of the members
of a social network. Although there has been a great deal of work dealing with
this issue, the vast majority of classical centrality measures are agnostic of
the community structure characterizing many social networks. Recent works have
developed community-aware centrality measures that exploit features of the
community structure information encountered in most real-world complex
networks. In this paper, we investigate the interactions between 5 popular
classical centrality measures and 5 community-aware centrality measures using 8
real-world online networks. Correlation as well as similarity measures between
both type of centrality measures are computed. Results show that
community-aware centrality measures can be divided into two groups. The first
group, which includes Bridging centrality, Community Hub-Bridge and
Participation Coefficient, provides distinctive node information as compared to
classical centrality. This behavior is consistent across the networks. The
second group which includes Community-based Mediator and Number of Neighboring
Communities is characterized by more mixed results that vary across networks.
","[{'version': 'v1', 'created': 'Sun, 30 Jan 2022 21:06:33 GMT'}]",2022-02-01,"[['Rajeh', 'Stephany', ''], ['Savonnet', 'Marinette', ''], ['Leclercq', 'Eric', ''], ['Cherifi', 'Hocine', '']]","['Centrality', 'Community Structure', 'Influential Nodes']"
6538,2207.07976,Filip Matzner,Filip Matzner,Hyperparameter Tuning in Echo State Networks,"To appear in Proceedings of the Genetic and Evolutionary Computation
  Conference 2022 (GECCO '22)",,10.1145/3512290.3528721,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Echo State Networks represent a type of recurrent neural network with a large
randomly generated reservoir and a small number of readout connections trained
via linear regression. The most common topology of the reservoir is a fully
connected network of up to thousands of neurons. Over the years, researchers
have introduced a variety of alternative reservoir topologies, such as a
circular network or a linear path of connections. When comparing the
performance of different topologies or other architectural changes, it is
necessary to tune the hyperparameters for each of the topologies separately
since their properties may significantly differ. The hyperparameter tuning is
usually carried out manually by selecting the best performing set of parameters
from a sparse grid of predefined combinations. Unfortunately, this approach may
lead to underperforming configurations, especially for sensitive topologies. We
propose an alternative approach of hyperparameter tuning based on the
Covariance Matrix Adaptation Evolution Strategy (CMA-ES). Using this approach,
we have improved multiple topology comparison results by orders of magnitude
suggesting that topology alone does not play as important role as properly
tuned hyperparameters.
","[{'version': 'v1', 'created': 'Sat, 16 Jul 2022 16:20:01 GMT'}]",2022-07-19,"[['Matzner', 'Filip', '']]","['echo state networks', 'evolution strategies', 'parameter tuning', 'continuous optimization']"
6539,2208.00037,Johan Lin{\aa}ker,"Johan Lin{\aa}ker, Maria Krantz, Martin H\""ost","On infrastructure for facilitation of inner source in small development
  teams",,"2014. In International Conference on Product-Focused Software
  Process Improvement (pp. 149-163). Springer, Cham",10.1007/978-3-319-13835-0_11,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  The phenomenon of adopting open source software development practices in a
corporate environment is known by many names, one being inner source. The
objective of this study is to investigate how an organization consisting of
small development teams can benefit from adopting inner source and assess the
level of applicability. The research has been conducted as a case study at a
software development company. Data collection was carried out through
interviews and a series of focus group meetings, and then analyzed by mapping
it to an available framework. The analysis shows that the organization
possesses potential, and also identified a number of challenges and benefits of
special importance to the case company. To address these challenges, the case
study synthesized the organizational and infrastructural needs of the
organization in a requirements specification describing a technical
infrastructure, also known as a software forge, with an adapted organizational
context and work process.
","[{'version': 'v1', 'created': 'Fri, 29 Jul 2022 18:37:10 GMT'}]",2022-08-02,"[['Linåker', 'Johan', ''], ['Krantz', 'Maria', ''], ['Höst', 'Martin', '']]","['Inner Source', 'Life cycle', 'Programming teams', 'Software process models', 'Reusable software']"
6540,1802.00690,Peter Bruza,Peter D. Bruza,"Modelling contextuality by probabilistic programs with hypergraph
  semantics","Accepted for ""Theoretical Computer Science""",,10.1016/j.tcs.2017.11.028,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Models of a phenomenon are often developed by examining it under different
experimental conditions, or measurement contexts. The resultant probabilistic
models assume that the underlying random variables, which define a measurable
set of outcomes, can be defined independent of the measurement context. The
phenomenon is deemed contextual when this assumption fails. Contextuality is an
important issue in quantum physics. However, there has been growing speculation
that it manifests outside the quantum realm with human cognition being a
particularly prominent area of investigation. This article contributes the
foundations of a probabilistic programming language that allows convenient
exploration of contextuality in wide range of applications relevant to
cognitive science and artificial intelligence. Specific syntax is proposed to
allow the specification of ""measurement contexts"". Each such context delivers a
partial model of the phenomenon based on the associated experimental condition
described by the measurement context. The probabilistic program is translated
into a hypergraph in a modular way. Recent theoretical results from the field
of quantum physics show that contextuality can be equated with the possibility
of constructing a probabilistic model on the resulting hypergraph. The use of
hypergraphs opens the door for a theoretically succinct and efficient
computational semantics sensitive to modelling both contextual and
non-contextual phenomena. Finally, this article raises awareness of
contextuality beyond quantum physics and to contribute formal methods to detect
its presence by means of hypergraph semantics.
","[{'version': 'v1', 'created': 'Wed, 31 Jan 2018 22:19:41 GMT'}]",2018-02-05,"[['Bruza', 'Peter D.', '']]","['probabilistic programming', 'probabilistic modelling', 'programminglanguage semantics', 'contextuality']"
6541,2111.07885,Padraig Corcoran,Padraig Corcoran and Andrei Gagarin,"Heuristics for k-domination models of facility location problems in
  street networks",,Computers & Operations Research (2021): 105368,10.1016/j.cor.2021.105368,,cs.DM,http://creativecommons.org/licenses/by/4.0/,"  We present new greedy and beam search heuristic methods to find small-size
$k$-dominating sets in graphs. The methods are inspired by a new problem
formulation which explicitly highlights a certain structure of the problem. An
empirical evaluation of the new methods is done with respect to two existing
methods, using instances of graphs corresponding to street networks. The
k-domination problem with respect to this class of graphs can be used to model
real-world facility location problem scenarios. For the classic minimum
dominating set ($1$-domination) problem, all except one methods perform
similarly, which is due to their equivalence in this particular case. However,
for the k-domination problem with k>1, the new methods outperform the benchmark
methods, and the performance gain is more significant for larger values of k.
","[{'version': 'v1', 'created': 'Wed, 10 Nov 2021 09:21:44 GMT'}]",2021-11-16,"[['Corcoran', 'Padraig', ''], ['Gagarin', 'Andrei', '']]","['k-domination', 'heuristic methods', 'facility location']"
6542,2111.09766,Guangping Li,"Sujoy Bhore, Guangping Li, Martin N\""ollenburg, Ignaz Rutter and
  Hsiang-Yun Wu",Untangling Circular Drawings: Algorithms and Complexity,"20 pages, 10 figures, extended version of ISAAC 2021 paper",,10.4230/LIPIcs.ISAAC.2021.19,,cs.CG cs.DM,http://creativecommons.org/licenses/by/4.0/,"  We consider the problem of untangling a given (non-planar) straight-line
circular drawing $\delta_G$ of an outerplanar graph $G=(V, E)$ into a planar
straight-line circular drawing by shifting a minimum number of vertices to a
new position on the circle. For an outerplanar graph $G$, it is clear that such
a crossing-free circular drawing always exists and we define the circular
shifting number shift$(\delta_G)$ as the minimum number of vertices that are
required to be shifted in order to resolve all crossings of $\delta_G$. We show
that the problem Circular Untangling, asking whether shift$(\delta_G) \le K$
for a given integer $K$, is NP-complete. For $n$-vertex outerplanar graphs, we
obtain a tight upper bound of shift$(\delta_G) \le n - \lfloor\sqrt{n-2}\rfloor
-2$. Based on these results we study Circular Untangling for almost-planar
circular drawings, in which a single edge is involved in all the crossings. In
this case, we provide a tight upper bound shift$(\delta_G) \le \lfloor
\frac{n}{2} \rfloor-1$ and present a constructive polynomial-time algorithm to
compute the circular shifting number of almost-planar drawings.
","[{'version': 'v1', 'created': 'Thu, 18 Nov 2021 15:54:21 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Dec 2021 15:44:47 GMT'}]",2021-12-21,"[['Bhore', 'Sujoy', ''], ['Li', 'Guangping', ''], ['Nöllenburg', 'Martin', ''], ['Rutter', 'Ignaz', ''], ['Wu', 'Hsiang-Yun', '']]","['graph drawing', 'outerplanarity', 'NP-hardness', 'untangling', 'permutations andcombinations']"
6543,2002.10131,Chrysoula Terizi,"Chrysoula Terizi, Despoina Chatzakou, Evaggelia Pitoura, Panayiotis
  Tsaparas and Nicolas Kourtellis",Modeling Aggression Propagation on Social Media,"13 pages, 5 figures, 3 tables",Online Social Networks and Media 24 (2021): 100137,10.1016/j.osnem.2021.100137,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cyberaggression has been studied in various contexts and online social
platforms, and modeled on different data using state-of-the-art machine and
deep learning algorithms to enable automatic detection and blocking of this
behavior. Users can be influenced to act aggressively or even bully others
because of elevated toxicity and aggression in their own (online) social
circle. In effect, this behavior can propagate from one user and neighborhood
to another, and therefore, spread in the network. Interestingly, to our
knowledge, no work has modeled the network dynamics of aggressive behavior. In
this paper, we take a first step towards this direction by studying propagation
of aggression on social media using opinion dynamics. We propose ways to model
how aggression may propagate from one user to another, depending on how each
user is connected to other aggressive or regular users. Through extensive
simulations on Twitter data, we study how aggressive behavior could propagate
in the network. We validate our models with crawled and annotated ground truth
data, reaching up to 80% AUC, and discuss the results and implications of our
work.
","[{'version': 'v1', 'created': 'Mon, 24 Feb 2020 09:50:49 GMT'}, {'version': 'v2', 'created': 'Thu, 21 May 2020 21:13:00 GMT'}, {'version': 'v3', 'created': 'Fri, 25 Jun 2021 09:13:40 GMT'}]",2021-06-28,"[['Terizi', 'Chrysoula', ''], ['Chatzakou', 'Despoina', ''], ['Pitoura', 'Evaggelia', ''], ['Tsaparas', 'Panayiotis', ''], ['Kourtellis', 'Nicolas', '']]","['modeling aggression', 'cyberaggression', 'aggressive behavior', 'diffusion of aggression', 'opinion models', 'social networks', 'Twitter']"
6544,2104.04846,Marc Erich Latoschik,Marc Erich Latoschik and Carolin Wienrich,"Congruence and Plausibility, not Presence?! Pivotal Conditions for XR
  Experiences and Effects, a Novel Model","10 pages,2 figures",Frontiers in Virtual Reality 3 (2022),10.3389/frvir.2022.694433,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Presence often is considered the most important quale describing the
subjective feeling of being in a computer-generated and/or computer-mediated
virtual environment. The identification and separation of orthogonal presence
components, i.e., the place illusion and the plausibility illusion, has been an
accepted theoretical model describing Virtual Reality (VR) experiences for some
time. This perspective article challenges this presence-oriented VR theory.
First, we argue that a place illusion cannot be the major construct to describe
the much wider scope of Virtual, Augmented, and Mixed Reality (VR, AR, MR: or
XR for short). Second, we argue that there is no plausibility illusion but
merely plausibility, and we derive the place illusion caused by congruent and
plausible generation of spatial cues, and similarly for all the current model's
so-defined illusions. Finally, we propose congruence and plausibility to become
the central essential conditions in a novel theoretical model describing XR
experiences and effects.
","[{'version': 'v1', 'created': 'Sat, 10 Apr 2021 19:25:17 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Apr 2021 06:51:11 GMT'}, {'version': 'v3', 'created': 'Tue, 22 Jun 2021 14:59:38 GMT'}, {'version': 'v4', 'created': 'Thu, 26 Aug 2021 15:39:46 GMT'}, {'version': 'v5', 'created': 'Mon, 6 Jun 2022 06:10:37 GMT'}]",2022-06-22,"[['Latoschik', 'Marc Erich', ''], ['Wienrich', 'Carolin', '']]","['XR', 'experience', 'presence', 'congruence', 'plausibility', 'coherence', 'theory', 'prediction']"
6545,2108.03320,Tanhim Islam,"Tanhim Islam, Tanjir Alam Chisty, Amitabha Chakrabarty","A Deep Neural Network Approach for Crop Selection and Yield Prediction
  in Bangladesh",,,10.1109/R10-HTC.2018.8629828,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Agriculture is the essential ingredients to mankind which is a major source
of livelihood. Agriculture work in Bangladesh is mostly done in old ways which
directly affects our economy. In addition, institutions of agriculture are
working with manual data which cannot provide a proper solution for crop
selection and yield prediction. This paper shows the best way of crop selection
and yield prediction in minimum cost and effort. Artificial Neural Network is
considered robust tools for modeling and prediction. This algorithm aims to get
better output and prediction, as well as, support vector machine, Logistic
Regression, and random forest algorithm is also considered in this study for
comparing the accuracy and error rate. Moreover, all of these algorithms used
here are just to see how well they performed for a dataset which is over 0.3
million. We have collected 46 parameters such as maximum and minimum
temperature, average rainfall, humidity, climate, weather, and types of land,
types of chemical fertilizer, types of soil, soil structure, soil composition,
soil moisture, soil consistency, soil reaction and soil texture for applying
into this prediction process. In this paper, we have suggested using the deep
neural network for agricultural crop selection and yield prediction.
","[{'version': 'v1', 'created': 'Fri, 6 Aug 2021 22:25:46 GMT'}]",2021-08-10,"[['Islam', 'Tanhim', ''], ['Chisty', 'Tanjir Alam', ''], ['Chakrabarty', 'Amitabha', '']]","['Deep neural network', 'Crop yield prediction', 'Soil']"
6546,2012.07347,Maxim Vashkevich,Maxim Vashkevich and Yulia Rushkevich,"Classification of ALS patients based on acoustic analysis of sustained
  vowel phonations",,"Biomedical Signal Processing and Control, Volume 65, March 2021,
  102350",10.1016/j.bspc.2020.102350,,cs.SD cs.CL cs.LG eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Amyotrophic lateral sclerosis (ALS) is incurable neurological disorder with
rapidly progressive course. Common early symptoms of ALS are difficulty in
swallowing and speech. However, early acoustic manifestation of speech and
voice symptoms is very variable, that making their detection very challenging,
both by human specialists and automatic systems. This study presents an
approach to voice assessment for automatic system that separates healthy people
from patients with ALS. In particular, this work focus on analysing of sustain
phonation of vowels /a/ and /i/ to perform automatic classification of ALS
patients. A wide range of acoustic features such as MFCC, formants, jitter,
shimmer, vibrato, PPE, GNE, HNR, etc. were analysed. We also proposed a new set
of acoustic features for characterizing harmonic structure of the vowels.
Calculation of these features is based on pitch synchronized voice analysis. A
linear discriminant analysis (LDA) was used to classify the phonation produced
by patients with ALS and those by healthy individuals. Several algorithms of
feature selection were tested to find optimal feature subset for LDA model. The
study's experiments show that the most successful LDA model based on 32
features picked out by LASSO feature selection algorithm attains 99.7% accuracy
with 99.3% sensitivity and 99.9% specificity. Among the classifiers with a
small number of features, we can highlight LDA model with 5 features, which has
89.0% accuracy (87.5% sensitivity and 90.4% specificity).
","[{'version': 'v1', 'created': 'Mon, 14 Dec 2020 08:56:53 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Jan 2021 08:41:07 GMT'}]",2021-01-12,"[['Vashkevich', 'Maxim', ''], ['Rushkevich', 'Yulia', '']]","['Voice pathology detection', 'amyotrophic lateral sclerosis', 'ALS', 'Acoustic analysis', 'voice quality']"
6547,2009.12204,Cedric Herzog,"C\'edric Herzog (Inria, CIDRE), Val\'erie Viet Triem Tong (MSR -
  INRIA, CIDRE), Pierre Wilke (CIDRE), Arnaud van Straaten (MSR - INRIA),
  Jean-Louis Lanet (LHS - Inria, CIDRE)","Evasive Windows Malware: Impact on Antiviruses and Possible
  Countermeasures",,"17th International Conference on Security and Cryptography, Jul
  2020, Lieusaint - Paris, France. pp.302-309",10.5220/0009816703020309,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The perpetual opposition between antiviruses and malware leads both parties
to evolve continuously. On the one hand, antiviruses put in place solutions
that are more and more sophisticated and propose more complex detection
techniques in addition to the classic signature analysis. This sophistication
leads antiviruses to leave more traces of their presence on the machine they
protect. To remain undetected as long as possible, malware can avoid executing
within such environments by hunting down the modifications left by the
antiviruses. This paper aims at determining the possibilities for malware to
detect the antiviruses and then evaluating the efficiency of these techniques
on a panel of antiviruses that are the most used nowadays. We then collect
samples showing this kind of behavior and propose to evaluate a countermeasure
that creates false artifacts, thus forcing malware to evade.
","[{'version': 'v1', 'created': 'Fri, 25 Sep 2020 12:59:43 GMT'}]",2020-09-28,"[['Herzog', 'Cédric', '', 'Inria, CIDRE'], ['Tong', 'Valérie Viet Triem', '', 'MSR -\n  INRIA, CIDRE'], ['Wilke', 'Pierre', '', 'CIDRE'], ['van Straaten', 'Arnaud', '', 'MSR - INRIA'], ['Lanet', 'Jean-Louis', '', 'LHS - Inria, CIDRE']]","['Antivirus', 'Evasion', 'Windows Malware', 'Windows API']"
6548,1412.0801,Poorna Dasgupta,Poorna Banerjee Dasgupta,"Analytical Comparison of Noise Reduction Filters for Image Restoration
  Using SNR Estimation","4 pages,Published with International Journal of Computer Trends and
  Technology (IJCTT), volume 17 number 3, Nov 2014","International Journal of Computer Trends and Technology (IJCTT)
  V17(3):121-124, Nov 2014. ISSN:2231-2803. www.ijcttjournal.org",10.14445/22312803/IJCTT-V17P123,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Noise removal from images is a part of image restoration in which we try to
reconstruct or recover an image that has been degraded by using apriori
knowledge of the degradation phenomenon. Noises present in images can be of
various types with their characteristic Probability Distribution Functions
(PDF). Noise removal techniques depend on the kind of noise present in the
image rather than on the image itself. This paper explores the effects of
applying noise reduction filters having similar properties on noisy images with
emphasis on Signal-to-Noise-Ratio (SNR) value estimation for comparing the
results.
","[{'version': 'v1', 'created': 'Tue, 2 Dec 2014 07:35:27 GMT'}]",2014-12-03,"[['Dasgupta', 'Poorna Banerjee', '']]","['Noise', 'Image filters', 'Probability Distribution Function (PDF)', 'Signal-to-Noise-Ratio (SNR)']"
6549,2111.02682,Joachim Nyborg,"Joachim Nyborg, Charlotte Pelletier, S\'ebastien Lef\`evre, Ira Assent","TimeMatch: Unsupervised Cross-Region Adaptation by Temporal Shift
  Estimation",,"ISPRS Journal of Photogrammetry and Remote Sensing, Volume 188,
  June 2022, Pages 301-313",10.1016/j.isprsjprs.2022.04.018,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The recent developments of deep learning models that capture complex temporal
patterns of crop phenology have greatly advanced crop classification from
Satellite Image Time Series (SITS). However, when applied to target regions
spatially different from the training region, these models perform poorly
without any target labels due to the temporal shift of crop phenology between
regions. Although various unsupervised domain adaptation techniques have been
proposed in recent years, no method explicitly learns the temporal shift of
SITS and thus provides only limited benefits for crop classification. To
address this, we propose TimeMatch, which explicitly accounts for the temporal
shift for improved SITS-based domain adaptation. In TimeMatch, we first
estimate the temporal shift from the target to the source region using the
predictions of a source-trained model. Then, we re-train the model for the
target region by an iterative algorithm where the estimated shift is used to
generate accurate target pseudo-labels. Additionally, we introduce an
open-access dataset for cross-region adaptation from SITS in four different
regions in Europe. On our dataset, we demonstrate that TimeMatch outperforms
all competing methods by 11% in average F1-score across five different
adaptation scenarios, setting a new state-of-the-art in cross-region
adaptation.
","[{'version': 'v1', 'created': 'Thu, 4 Nov 2021 08:32:59 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Mar 2022 11:47:26 GMT'}, {'version': 'v3', 'created': 'Mon, 9 May 2022 07:12:00 GMT'}]",2022-05-10,"[['Nyborg', 'Joachim', ''], ['Pelletier', 'Charlotte', ''], ['Lefèvre', 'Sébastien', ''], ['Assent', 'Ira', '']]","['Satellite Image Time Series', 'Temporal Shift', 'Crop Classification', 'Domain Adaptation', 'Deep Learning']"
6550,1506.05628,Martin Tomko PhD.,"Yongli Ren, Martin Tomko, Flora Salim, Kevin Ong, Mark Sanderson",Analyzing Web Behavior in Indoor Retail Spaces,,,10.1002/asi.23587,,cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze 18 million rows of Wi-Fi access logs collected over a one year
period from over 120,000 anonymized users at an inner-city shopping mall. The
anonymized dataset gathered from an opt-in system provides users' approximate
physical location, as well as Web browsing and some search history. Such data
provides a unique opportunity to analyze the interaction between people's
behavior in physical retail spaces and their Web behavior, serving as a proxy
to their information needs. We find: (1) the use of Wi-Fi network maps the
opening hours of the mall; (2) there is a weekly periodicity in users' visits
to the mall; (3) around 60% of registered Wi-Fi users actively browse the Web
and around 10% of them use Wi-Fi for accessing Web search engines; (4) people
are likely to spend a relatively constant amount of time browsing the Web while
their visiting duration may vary; (5) people tend to visit similar mall
locations and Web content during their repeated visits to the mall; (6) the
physical spatial context has a small but significant influence on the Web
content that indoor users browse; (7) accompanying users tend to access
resources from the same Web domains.
","[{'version': 'v1', 'created': 'Thu, 18 Jun 2015 11:21:59 GMT'}]",2022-03-24,"[['Ren', 'Yongli', ''], ['Tomko', 'Martin', ''], ['Salim', 'Flora', ''], ['Ong', 'Kevin', ''], ['Sanderson', 'Mark', '']]","['Indoor Web behaviour', 'indoor spatial context', 'log analysis']"
6551,2112.12845,Wentao Ning,"Wentao Ning, Reynold Cheng, Jiajun Shen, Nur Al Hasan Haldar, Ben Kao,
  Xiao Yan, Nan Huo, Wai Kit Lam, Tian Li and Bo Tang",Automatic Meta-Path Discovery for Effective Graph-Based Recommendation,This paper is accepted as a full research paper by CIKM 2022,,10.1145/3511808.3557244,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Heterogeneous Information Networks (HINs) are labeled graphs that depict
relationships among different types of entities (e.g., users, movies and
directors). For HINs, meta-path-based recommenders (MPRs) utilize meta-paths
(i.e., abstract paths consisting of node and link types) to predict user
preference, and have attracted a lot of attention due to their explainability
and performance. We observe that the performance of MPRs is highly sensitive to
the meta-paths they use, but existing works manually select the meta-paths from
many possible ones. Thus, to discover effective meta-paths automatically, we
propose the Reinforcement learning-based Meta-path Selection (RMS) framework.
Specifically, we define a vector encoding for meta-paths and design a policy
network to extend meta-paths. The policy network is trained based on the
results of downstream recommendation tasks and an early stopping approximation
strategy is proposed to speed up training. RMS is a general model, and it can
work with all existing MPRs. We also propose a new MPR called RMS-HRec, which
uses an attention mechanism to aggregate information from the meta-paths. We
conduct extensive experiments on real datasets. Compared with the manually
selected meta-paths, the meta-paths identified by RMS consistently improve
recommendation quality. Moreover, RMS-HRec outperforms state-of-the-art
recommender systems by an average of 7% in hit ratio. The codes and datasets
are available on https://github.com/Stevenn9981/RMS-HRec.
","[{'version': 'v1', 'created': 'Thu, 23 Dec 2021 21:03:00 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Dec 2021 03:49:37 GMT'}, {'version': 'v3', 'created': 'Wed, 3 Aug 2022 16:00:23 GMT'}, {'version': 'v4', 'created': 'Sun, 21 Aug 2022 12:52:24 GMT'}, {'version': 'v5', 'created': 'Wed, 7 Sep 2022 05:31:45 GMT'}]",2022-09-08,"[['Ning', 'Wentao', ''], ['Cheng', 'Reynold', ''], ['Shen', 'Jiajun', ''], ['Haldar', 'Nur Al Hasan', ''], ['Kao', 'Ben', ''], ['Yan', 'Xiao', ''], ['Huo', 'Nan', ''], ['Lam', 'Wai Kit', ''], ['Li', 'Tian', ''], ['Tang', 'Bo', '']]","['reinforcement learning', 'meta-path', 'graph neural network']"
6552,1803.10327,EPTCS,"Robert Gl\""uck (DIKU, Dept. of Computer Science, University of
  Copenhagen)","An Experiment in Ping-Pong Protocol Verification by Nondeterministic
  Pushdown Automata","In Proceedings MARS/VPT 2018, arXiv:1803.08668","EPTCS 268, 2018, pp. 169-184",10.4204/EPTCS.268.6,,cs.PL cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An experiment is described that confirms the security of a well-studied class
of cryptographic protocols (Dolev-Yao intruder model) can be verified by
two-way nondeterministic pushdown automata (2NPDA). A nondeterministic pushdown
program checks whether the intersection of a regular language (the protocol to
verify) and a given Dyck language containing all canceling words is empty. If
it is not, an intruder can reveal secret messages sent between trusted users.
The verification is guaranteed to terminate in cubic time at most on a
2NPDA-simulator. The interpretive approach used in this experiment simplifies
the verification, by separating the nondeterministic pushdown logic and program
control, and makes it more predictable. We describe the interpretive approach
and the known transformational solutions, and show they share interesting
features. Also noteworthy is how abstract results from automata theory can
solve practical problems by programming language means.
","[{'version': 'v1', 'created': 'Tue, 27 Mar 2018 21:00:27 GMT'}]",2018-04-02,"[['Glück', 'Robert', '', 'DIKU, Dept. of Computer Science, University of\n  Copenhagen']]","['protocol verification', 'ping-pong protocols', 'cryptographic protocols', 'nondeterministicprogramming', 'two-way pushdown automata', 'memoizing interpreters']"
6553,2207.09021,Zeyan Li,"Zeyan Li, Nengwen Zhao, Mingjie Li, Xianglin Lu, Lixin Wang, Dongdong
  Chang, Xiaohui Nie, Li Cao, Wenzhi Zhang, Kaixin Sui, Yanhua Wang, Xu Du,
  Guoqiang Duan, Dan Pei","Actionable and Interpretable Fault Localization for Recurring Failures
  in Online Service Systems",Accepted by ESEC/FSE 2022,,10.1145/3540250.3549092,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Fault localization is challenging in an online service system due to its
monitoring data's large volume and variety and complex dependencies across or
within its components (e.g., services or databases). Furthermore, engineers
require fault localization solutions to be actionable and interpretable, which
existing research approaches cannot satisfy. Therefore, the common industry
practice is that, for a specific online service system, its experienced
engineers focus on localization for recurring failures based on the knowledge
accumulated about the system and historical failures. Although the above common
practice is actionable and interpretable, it is largely manual, thus slow and
sometimes inaccurate. In this paper, we aim to automate this practice through
machine learning. That is, we propose an actionable and interpretable fault
localization approach, DejaVu, for recurring failures in online service
systems. For a specific online service system, DejaVu takes historical failures
and dependencies in the system as input and trains a localization model
offline; for an incoming failure, the trained model online recommends where the
failure occurs (i.e., the faulty components) and which kind of failure occurs
(i.e., the indicative group of metrics) (thus actionable), which are further
interpreted by both global and local interpretation methods (thus
interpretable). Based on the evaluation on 601 failures from three production
systems and one open-source benchmark, in less than one second, DejaVu can on
average rank the ground truths at 1.66-th to 5.03-th among a long candidate
list, outperforming baselines by at least 51.51%.
","[{'version': 'v1', 'created': 'Tue, 19 Jul 2022 01:55:07 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Jul 2022 01:52:07 GMT'}, {'version': 'v3', 'created': 'Mon, 5 Sep 2022 03:05:34 GMT'}]",2022-09-07,"[['Li', 'Zeyan', ''], ['Zhao', 'Nengwen', ''], ['Li', 'Mingjie', ''], ['Lu', 'Xianglin', ''], ['Wang', 'Lixin', ''], ['Chang', 'Dongdong', ''], ['Nie', 'Xiaohui', ''], ['Cao', 'Li', ''], ['Zhang', 'Wenzhi', ''], ['Sui', 'Kaixin', ''], ['Wang', 'Yanhua', ''], ['Du', 'Xu', ''], ['Duan', 'Guoqiang', ''], ['Pei', 'Dan', '']]","['Fault Localization', 'Online Service Systems', 'Recurring Failures']"
6554,2007.13551,Shitong Luo,"Shitong Luo, Wei Hu",Differentiable Manifold Reconstruction for Point Cloud Denoising,This work has been accepted to ACM MM 2020,,10.1145/3394171.3413727,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  3D point clouds are often perturbed by noise due to the inherent limitation
of acquisition equipments, which obstructs downstream tasks such as surface
reconstruction, rendering and so on. Previous works mostly infer the
displacement of noisy points from the underlying surface, which however are not
designated to recover the surface explicitly and may lead to sub-optimal
denoising results. To this end, we propose to learn the underlying manifold of
a noisy point cloud from differentiably subsampled points with trivial noise
perturbation and their embedded neighborhood feature, aiming to capture
intrinsic structures in point clouds. Specifically, we present an
autoencoder-like neural network. The encoder learns both local and non-local
feature representations of each point, and then samples points with low noise
via an adaptive differentiable pooling operation. Afterwards, the decoder
infers the underlying manifold by transforming each sampled point along with
the embedded feature of its neighborhood to a local surface centered around the
point. By resampling on the reconstructed manifold, we obtain a denoised point
cloud. Further, we design an unsupervised training loss, so that our network
can be trained in either an unsupervised or supervised fashion. Experiments
show that our method significantly outperforms state-of-the-art denoising
methods under both synthetic noise and real world noise. The code and data are
available at https://github.com/luost26/DMRDenoise
","[{'version': 'v1', 'created': 'Mon, 27 Jul 2020 13:31:41 GMT'}, {'version': 'v2', 'created': 'Sun, 9 Aug 2020 09:23:44 GMT'}]",2020-08-11,"[['Luo', 'Shitong', ''], ['Hu', 'Wei', '']]","['point clouds', 'denoising', 'manifold', 'differentiable pooling']"
6555,2112.00797,Abimbola Afolayan,"Abimbola Helen Afolayan, Bolanle Adefowoke Ojokoh, and Adebayo
  Adetunmbi","A Feedback Integrated Web-Based Multi-Criteria Group Decision Support
  Model for Contractor Selection using Fuzzy Analytic Hierarchy Process","20 pages, 2 figures","In: Arai K., Kapoor S., Bhatia R. (eds) Intelligent Systems and
  Applications. IntelliSys 2020. Advances in Intelligent Systems and Computing,
  Springer, Cham. 1251, 511-528. Springer, Cham",10.1007/978-3-030-55187-2_38,,cs.AI,http://creativecommons.org/licenses/by/4.0/,"  In this paper, a feedback integrated multi-criteria group decision support
model for contractor selection was proposed.
","[{'version': 'v1', 'created': 'Fri, 19 Nov 2021 17:57:32 GMT'}]",2021-12-03,"[['Afolayan', 'Abimbola Helen', ''], ['Ojokoh', 'Bolanle Adefowoke', ''], ['Adetunmbi', 'Adebayo', '']]","['Construction Sector', 'Contractors', 'Technical Evaluation Module', 'Financial Evaluation Module', 'Fuzzy Analytic Hierarchy Process', 'Consistency Module']"
6556,1401.7077,Gerardo Febres,"Gerardo Febres, Klaus Jaffe",Quantifying literature quality using complexity criteria,"Submitted for publication. 29 pages. 8 figures, 4 tables, 4
  appendixes","Journal of Quantitative Linguistics, 2017, Vol 24, Iss 1",10.1080/09296174.2016.1169847,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We measured entropy and symbolic diversity for English and Spanish texts
including literature Nobel laureates and other famous authors. Entropy, symbol
diversity and symbol frequency profiles were compared for these four groups. We
also built a scale sensitive to the quality of writing and evaluated its
relationship with the Flesch's readability index for English and the
Szigriszt's perspicuity index for Spanish. Results suggest a correlation
between entropy and word diversity with quality of writing. Text genre also
influences the resulting entropy and diversity of the text. Results suggest the
plausibility of automated quality assessment of texts.
","[{'version': 'v1', 'created': 'Tue, 28 Jan 2014 03:48:01 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Feb 2014 20:11:28 GMT'}, {'version': 'v3', 'created': 'Sat, 24 Jan 2015 03:38:02 GMT'}, {'version': 'v4', 'created': 'Sun, 15 Jan 2017 15:49:55 GMT'}]",2017-01-17,"[['Febres', 'Gerardo', ''], ['Jaffe', 'Klaus', '']]","['symbol diversity', 'entropy', 'complexity', 'readability', 'writing quality']"
6557,2010.16301,Humberto Rodriguez Avila,"Humberto Rodriguez Avila, Joeri De Koster, Wolfgang De Meuter",Advanced Join Patterns for the Actor Model based on CEP Techniques,,"The Art, Science, and Engineering of Programming, 2021, Vol. 5,
  Issue 2, Article 10",10.22152/programming-journal.org/2021/5/10,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Actor-based programming languages offer many essential features for
developing modern distributed reactive systems. These systems exploit the actor
model's isolation property to fulfill their performance and scalability
demands. Unfortunately, the reliance of the model on isolation as its most
fundamental property requires programmers to express complex interaction
patterns between their actors to be expressed manually in terms of complex
combinations of messages sent between the isolated actors.
  Inquiry: In the last three decades, several language design proposals have
been introduced to reduce the complexity that emerges from describing said
interaction and coordination of actors. We argue that none of these proposals
is satisfactory in order to express the many complex interaction patterns
between actors found in modern reactive distributed systems.
  Approach: We describe seven smart home automation scenarios (in which an
actor represents every smart home appliance) to motivate the support by actor
languages for five radically different types of message synchronization
patterns, which are lacking in modern distributed actor-based languages.
Fortunately, these five types of synchronisation patterns have been studied
extensively by the Complex Event Processing (CEP) community. Our paper
describes how such CEP patterns are elegantly added to an actor-based
programming language.
  Knowledge: Based on our findings, we propose an extension of the
single-message matching paradigm of contemporary actor-based languages in order
to support a multiple-message matching way of thinking in the same way as
proposed by CEP languages. Our proposal thus enriches the actor-model by ways
of declaratively describing complex message combinations to which an actor can
respond.
  Grounding: We base the problem-statement of the paper on an online poll in
the home automation community that has motivated the real need for the
CEP-based synchronisation operators between actors proposed in the paper.
Furthermore, we implemented a DSL -- called Sparrow -- that supports said
operators and we argue quantitatively (in terms of LOC and in terms of a
reduction of the concerns that have to be handled by programmers) that the DSL
outperforms existing approaches.
  Importance: This work aims to provide a set of synchronization operators that
help actor-based languages to handle the complex interaction required by modern
reactive distributed systems. To the best of our knowledge, our proposal is the
first one to add advanced CEP synchronization operators to the -- relatively
simplistic single-message based matching -- mechanisms of most actor-based
languages.
","[{'version': 'v1', 'created': 'Fri, 30 Oct 2020 14:53:11 GMT'}]",2020-11-02,"[['Avila', 'Humberto Rodriguez', ''], ['De Koster', 'Joeri', ''], ['De Meuter', 'Wolfgang', '']]","['actors', 'coordination', 'complex event processing', 'join patterns', 'rete']"
6558,2211.04169,Arpit Merchant,"Arpit Merchant, Michael Mathioudakis, Yanhao Wang",Graph Summarization via Node Grouping: A Spectral Algorithm,Full version of the paper published at WSDM 2023,,10.1145/3539597.3570441,,cs.SI cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Graph summarization via node grouping is a popular method to build concise
graph representations by grouping nodes from the original graph into supernodes
and encoding edges into superedges such that the loss of adjacency information
is minimized. Such summaries have immense applications in large-scale graph
analytics due to their small size and high query processing efficiency. In this
paper, we reformulate the loss minimization problem for summarization into an
equivalent integer maximization problem. By initially allowing relaxed
(fractional) solutions for integer maximization, we analytically expose the
underlying connections to the spectral properties of the adjacency matrix.
Consequently, we design an algorithm called SpecSumm that consists of two
phases. In the first phase, motivated by spectral graph theory, we apply
k-means clustering on the k largest (in magnitude) eigenvectors of the
adjacency matrix to assign nodes to supernodes. In the second phase, we propose
a greedy heuristic that updates the initial assignment to further improve
summary quality. Finally, via extensive experiments on 11 datasets, we show
that SpecSumm efficiently produces high-quality summaries compared to
state-of-the-art summarization algorithms and scales to graphs with millions of
nodes.
","[{'version': 'v1', 'created': 'Tue, 8 Nov 2022 11:23:16 GMT'}]",2022-11-09,"[['Merchant', 'Arpit', ''], ['Mathioudakis', 'Michael', ''], ['Wang', 'Yanhao', '']]","['Graph Summarization', 'Spectral Algorithms', 'Clustering']"
6559,1905.11757,Simon D. Duque Anton,"Simon Duque Anton, Suneetha Kanoor, Daniel Fraunholz, and Hans Dieter
  Schotten","Evaluation of Machine Learning-based Anomaly Detection Algorithms on an
  Industrial Modbus/TCP Data Set","This is a preprint of a work published in the Proceedings of the 13th
  International Conference on Availability, Reliability and Security (ARES
  2018)",,10.1145/3230833.3232818,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the context of the Industrial Internet of Things, communication
technology, originally used in home and office environments, is introduced into
industrial applications. Commercial off-the-shelf products, as well as unified
and well-established communication protocols make this technology easy to
integrate and use. Furthermore, productivity is increased in comparison to
classic industrial control by making systems easier to manage, set up and
configure. Unfortunately, most attack surfaces of home and office environments
are introduced into industrial applications as well, which usually have very
few security mechanisms in place. Over the last years, several technologies
tackling that issue have been researched. In this work, machine learning-based
anomaly detection algorithms are employed to find malicious traffic in a
synthetically generated data set of Modbus/TCP communication of a fictitious
industrial scenario. The applied algorithms are Support Vector Machine (SVM),
Random Forest, k-nearest neighbour and k-means clustering. Due to the synthetic
data set, supervised learning is possible. Support Vector Machine and k-nearest
neighbour perform well with different data sets, while k-nearest neighbour and
k-means clustering do not perform satisfactorily.
","[{'version': 'v1', 'created': 'Tue, 28 May 2019 11:52:25 GMT'}]",2019-05-29,"[['Anton', 'Simon Duque', ''], ['Kanoor', 'Suneetha', ''], ['Fraunholz', 'Daniel', ''], ['Schotten', 'Hans Dieter', '']]","['Modbus', 'Machine Learning', 'Anomaly Detection', 'Industrial', 'ITSecurity']"
6560,2008.13517,Yishi Xu,"Yishi Xu, Yingxue Zhang, Wei Guo, Huifeng Guo, Ruiming Tang, Mark
  Coates","GraphSAIL: Graph Structure Aware Incremental Learning for Recommender
  Systems",Accepted by CIKM2020 Applied Research Track,,10.1145/3340531.3412754,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given the convenience of collecting information through online services,
recommender systems now consume large scale data and play a more important role
in improving user experience. With the recent emergence of Graph Neural
Networks (GNNs), GNN-based recommender models have shown the advantage of
modeling the recommender system as a user-item bipartite graph to learn
representations of users and items. However, such models are expensive to train
and difficult to perform frequent updates to provide the most up-to-date
recommendations. In this work, we propose to update GNN-based recommender
models incrementally so that the computation time can be greatly reduced and
models can be updated more frequently. We develop a Graph Structure Aware
Incremental Learning framework, GraphSAIL, to address the commonly experienced
catastrophic forgetting problem that occurs when training a model in an
incremental fashion. Our approach preserves a user's long-term preference (or
an item's long-term property) during incremental model updating. GraphSAIL
implements a graph structure preservation strategy which explicitly preserves
each node's local structure, global structure, and self-information,
respectively. We argue that our incremental training framework is the first
attempt tailored for GNN based recommender systems and demonstrate its
improvement compared to other incremental learning techniques on two public
datasets. We further verify the effectiveness of our framework on a large-scale
industrial dataset.
","[{'version': 'v1', 'created': 'Tue, 25 Aug 2020 04:33:59 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Sep 2020 02:56:15 GMT'}]",2020-09-03,"[['Xu', 'Yishi', ''], ['Zhang', 'Yingxue', ''], ['Guo', 'Wei', ''], ['Guo', 'Huifeng', ''], ['Tang', 'Ruiming', ''], ['Coates', 'Mark', '']]","['incremental learning', 'catastrophic forgetting', 'recommendation system', 'graph neural networks', 'representation learning']"
6561,1712.03163,Valdemar \v{S}v\'abensk\'y,Valdemar \v{S}v\'abensk\'y and Jan Vykopal,Challenges Arising from Prerequisite Testing in Cybersecurity Games,"ACM SIGCSE 2018 conference, 6 pages, 4 figures, 4 tables",,10.1145/3159450.3159454,,cs.CY cs.CR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cybersecurity games are an attractive and popular method of active learning.
However, the majority of current games are created for advanced players, which
often leads to frustration in less experienced learners. Therefore, we decided
to focus on a diagnostic assessment of participants entering the games. We
assume that information about the players' knowledge, skills, and experience
enables tutors or learning environments to suitably assist participants with
game challenges and maximize learning in their virtual adventure. In this
paper, we present a pioneering experiment examining the predictive value of a
short quiz and self-assessment for identifying learners' readiness before
playing a cybersecurity game. We hypothesized that these predictors would model
players' performance. A linear regression analysis showed that the game
performance can be accurately predicted by well-designed prerequisite testing,
but not by self-assessment. At the same time, we identified major challenges
related to the design of pretests for cybersecurity games: calibrating test
questions with respect to the skills relevant for the game, minimizing the
quiz's length while maximizing its informative value, and embedding the pretest
in the game. Our results are relevant for educational researchers and
cybersecurity instructors of students at all learning levels.
","[{'version': 'v1', 'created': 'Fri, 8 Dec 2017 16:36:02 GMT'}]",2017-12-11,"[['Švábenský', 'Valdemar', ''], ['Vykopal', 'Jan', '']]","['active learning', 'cybersecurity games', 'diagnostic assessment', 'prerequisite testing', 'self-assessment', 'linear regression modeling']"
6562,2110.06051,Jurek Leonhardt,"Jurek Leonhardt, Koustav Rudra, Megha Khosla, Abhijit Anand, Avishek
  Anand",Efficient Neural Ranking using Forward Indexes,Full paper at TheWebConf 2022,,10.1145/3485447.3511955,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Neural document ranking approaches, specifically transformer models, have
achieved impressive gains in ranking performance. However, query processing
using such over-parameterized models is both resource and time intensive. In
this paper, we propose the Fast-Forward index -- a simple vector forward index
that facilitates ranking documents using interpolation of lexical and semantic
scores -- as a replacement for contextual re-rankers and dense indexes based on
nearest neighbor search. Fast-Forward indexes rely on efficient sparse models
for retrieval and merely look up pre-computed dense transformer-based vector
representations of documents and passages in constant time for fast CPU-based
semantic similarity computation during query processing. We propose index
pruning and theoretically grounded early stopping techniques to improve the
query processing throughput. We conduct extensive large-scale experiments on
TREC-DL datasets and show improvements over hybrid indexes in performance and
query processing efficiency using only CPUs. Fast-Forward indexes can provide
superior ranking performance using interpolation due to the complementary
benefits of lexical and semantic similarities.
","[{'version': 'v1', 'created': 'Tue, 12 Oct 2021 14:53:40 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Apr 2022 09:09:32 GMT'}]",2022-04-05,"[['Leonhardt', 'Jurek', ''], ['Rudra', 'Koustav', ''], ['Khosla', 'Megha', ''], ['Anand', 'Abhijit', ''], ['Anand', 'Avishek', '']]","['retrieval', 'dense', 'sparse', 'ranking', 'interpolation']"
6563,2009.08052,Chang Liu,"Chang Liu, Huichu Zhang, Weinan Zhang, Guanjie Zheng, Yong Yu","GeneraLight: Improving Environment Generalization of Traffic Signal
  Control via Meta Reinforcement Learning","Proceedings of the 29th ACM International on Conference on
  Information and Knowledge Management (CIKM). ACM, 2020",,10.1145/3340531.3411859,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The heavy traffic congestion problem has always been a concern for modern
cities. To alleviate traffic congestion, researchers use reinforcement learning
(RL) to develop better traffic signal control (TSC) algorithms in recent years.
However, most RL models are trained and tested in the same traffic flow
environment, which results in a serious overfitting problem. Since the traffic
flow environment in the real world keeps varying, these models can hardly be
applied due to the lack of generalization ability. Besides, the limited number
of accessible traffic flow data brings extra difficulty in testing the
generalization ability of the models. In this paper, we design a novel traffic
flow generator based on Wasserstein generative adversarial network to generate
sufficient diverse and quality traffic flows and use them to build proper
training and testing environments. Then we propose a meta-RL TSC framework
GeneraLight to improve the generalization ability of TSC models. GeneraLight
boosts the generalization performance by combining the idea of flow clustering
and model-agnostic meta-learning. We conduct extensive experiments on multiple
real-world datasets to show the superior performance of GeneraLight on
generalizing to different traffic flows.
","[{'version': 'v1', 'created': 'Thu, 17 Sep 2020 04:14:28 GMT'}]",2020-09-18,"[['Liu', 'Chang', ''], ['Zhang', 'Huichu', ''], ['Zhang', 'Weinan', ''], ['Zheng', 'Guanjie', ''], ['Yu', 'Yong', '']]","['Traffic Signal Control', 'Environment Generalized Model', 'Meta Reinforcement Learning', 'Generative Adversarial Network']"
6564,2204.12852,Sean MacAvaney,Prashansa Gupta and Sean MacAvaney,On Survivorship Bias in MS MARCO,SIGIR 2022,,10.1145/3477495.3531832,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Survivorship bias is the tendency to concentrate on the positive outcomes of
a selection process and overlook the results that generate negative outcomes.
We observe that this bias could be present in the popular MS MARCO dataset,
given that annotators could not find answers to 38--45% of the queries, leading
to these queries being discarded in training and evaluation processes. Although
we find that some discarded queries in MS MARCO are ill-defined or otherwise
unanswerable, many are valid questions that could be answered had the
collection been annotated more completely (around two thirds using modern
ranking techniques). This survivability problem distorts the MS MARCO
collection in several ways. We find that it affects the natural distribution of
queries in terms of the type of information needed. When used for evaluation,
we find that the bias likely yields a significant distortion of the absolute
performance scores observed. Finally, given that MS MARCO is frequently used
for model training, we train models based on subsets of MS MARCO that simulates
more survivorship bias. We find that models trained in this setting are up to
9.9% worse when evaluated on versions of the dataset with more complete
annotations, and up to 3.5% worse at zero-shot transfer. Our findings are
complementary to other recent suggestions for further annotation of MS MARCO,
but with a focus on discarded queries. Code and data for reproducing the
results of this paper are available in an online appendix.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2022 11:34:14 GMT'}]",2022-04-28,"[['Gupta', 'Prashansa', ''], ['MacAvaney', 'Sean', '']]","['Survivorship Bias', 'MS MARCO', 'Evaluation', 'Neural IR']"
6565,2207.09928,Jan Tobias Muehlberg,"Tommaso Crepax, Jan Tobias Muehlberg","Upgrading the protection of children from manipulative and addictive
  strategies in online games: Legal and technical solutions beyond privacy
  regulation",,"The International Review of Information Ethics, special issue on
  Ethics in the Age of Smart Systems, Volume 31, Issue 1, August 2022",10.29173/irie480,,cs.CR cs.CY,http://creativecommons.org/licenses/by-sa/4.0/,"  Despite the increasing awareness from academia, civil society and media to
the issue of child manipulation online, the current EU regulatory system fails
at providing sufficient levels of protection. Given the universality of the
issue, there is a need to combine and further these scattered efforts into a
unitary, multidisciplinary theory of digital manipulation that identifies
causes and effects, systematizes the technical and legal knowledge on
manipulative and addictive tactics, and to find effective regulatory mechanisms
to fill the legislative gaps. In this paper we discuss manipulative and
exploitative strategies in the context of online games for children, suggest a
number of possible reasons for the failure of the applicable regulatory system,
propose an ""upgrade"" for the regulatory approach to address these risks from
the perspective of freedom of thought, and present and discuss technological
approaches that allow for the development of games that verifiably protect the
privacy and freedoms of players.
","[{'version': 'v1', 'created': 'Wed, 20 Jul 2022 14:13:17 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Sep 2022 10:26:59 GMT'}]",2022-09-02,"[['Crepax', 'Tommaso', ''], ['Muehlberg', 'Jan Tobias', '']]","['online games', 'children', 'privacy', 'data protection', 'freedom of thought', 'confidential computing']"
6566,2205.05339,Pierre-Loic Garoche,"Farah Benmouhoub (UPVD), Pierre-Lo\""ic Garoche (ENAC), Matthieu Martel
  (UPVD)","An Efficient Summation Algorithm for the Accuracy, Convergence and
  Reproducibility of Parallel Numerical Methods",,"Numerical Software Verification, Jul 2021, Los Angeles, United
  States. pp.165-181",10.1007/978-3-030-95561-8_10,,cs.CL cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, parallel computing is ubiquitous in several application fields,
both in engineering and science. The computations rely on the floating-point
arithmetic specified by the IEEE754 Standard. In this context, an elementary
brick of computation, used everywhere, is the sum of a sequence of numbers.
This sum is subject to many numerical errors in floating-point arithmetic. To
alleviate this issue, we have introduced a new parallel algorithm for summing a
sequence of floating-point numbers. This algorithm which scales up easily with
the number of processors, adds numbers of the same exponents first. In this
article, our main contribution is an extensive analysis of its efficiency with
respect to several properties: accuracy, convergence and reproducibility. In
order to show the usefulness of our algorithm, we have chosen a set of
representative numerical methods which are Simpson, Jacobi, LU factorization
and the Iterated power method.
","[{'version': 'v1', 'created': 'Wed, 11 May 2022 08:31:48 GMT'}]",2022-05-12,"[['Benmouhoub', 'Farah', '', 'UPVD'], ['Garoche', 'Pierre-Loïc', '', 'ENAC'], ['Martel', 'Matthieu', '', 'UPVD']]","['floating-point arithmetic', 'accurate summation', 'numericalaccuracy', 'numerical methods', 'convergence', 'reproducibility']"
6567,2006.00144,Xue Li,Xue Li and Yuanzhi Cheng,"Understanding the Message Passing in Graph Neural Networks via Power
  Iteration Clustering",,"Neural Networks, 140, pp. 130- 135, 2021",10.1016/j.neunet.2021.02.025,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The mechanism of message passing in graph neural networks (GNNs) is still
mysterious. Apart from convolutional neural networks, no theoretical origin for
GNNs has been proposed. To our surprise, message passing can be best understood
in terms of power iteration. By fully or partly removing activation functions
and layer weights of GNNs, we propose subspace power iteration clustering
(SPIC) models that iteratively learn with only one aggregator. Experiments show
that our models extend GNNs and enhance their capability to process random
featured networks. Moreover, we demonstrate the redundancy of some
state-of-the-art GNNs in design and define a lower limit for model evaluation
by a random aggregator of message passing. Our findings push the boundaries of
the theoretical understanding of neural networks.
","[{'version': 'v1', 'created': 'Sat, 30 May 2020 01:44:34 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Jun 2020 06:28:59 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Jan 2021 06:13:38 GMT'}]",2021-04-16,"[['Li', 'Xue', ''], ['Cheng', 'Yuanzhi', '']]","['Graph Neural Networks', 'Message Passing', 'Power Iteration', 'Subspace Power Iteration Clustering']"
6568,2008.13491,Arti Pandey,"Michael A. Henning, Arti Pandey, Vikash Tripathi",Semipaired Domination in Some Subclasses of Chordal Graphs,,"Discrete Mathematics & Theoretical Computer Science, vol. 23 no.
  1, Discrete Algorithms (July 6, 2021) dmtcs:7650",10.46298/dmtcs.6782,,cs.DM cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A dominating set $D$ of a graph $G$ without isolated vertices is called
semipaired dominating set if $D$ can be partitioned into $2$-element subsets
such that the vertices in each set are at distance at most $2$. The semipaired
domination number, denoted by $\gamma_{pr2}(G)$ is the minimum cardinality of a
semipaired dominating set of $G$. Given a graph $G$ with no isolated vertices,
the \textsc{Minimum Semipaired Domination} problem is to find a semipaired
dominating set of $G$ of cardinality $\gamma_{pr2}(G)$. The decision version of
the \textsc{Minimum Semipaired Domination} problem is already known to be
NP-complete for chordal graphs, an important graph class. In this paper, we
show that the decision version of the \textsc{Minimum Semipaired Domination}
problem remains NP-complete for split graphs, a subclass of chordal graphs. On
the positive side, we propose a linear-time algorithm to compute a minimum
cardinality semipaired dominating set of block graphs. In addition, we prove
that the \textsc{Minimum Semipaired Domination} problem is APX-complete for
graphs with maximum degree $3$.
","[{'version': 'v1', 'created': 'Mon, 31 Aug 2020 11:07:51 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Mar 2021 09:15:46 GMT'}, {'version': 'v3', 'created': 'Sat, 3 Jul 2021 11:21:36 GMT'}]",2021-10-04,"[['Henning', 'Michael A.', ''], ['Pandey', 'Arti', ''], ['Tripathi', 'Vikash', '']]","['Domination', 'Semipaired domination', 'Block graphs', 'NP-completeness', 'Graph algorithms']"
6569,2006.07273,Georgios Damaskinos,"Georgios Damaskinos, Rachid Guerraoui, Anne-Marie Kermarrec, Vlad
  Nitu, Rhicheek Patra, Francois Taiani","FLeet: Online Federated Learning via Staleness Awareness and Performance
  Prediction",,,10.1145/3423211.3425685,,cs.LG cs.DC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Federated Learning (FL) is very appealing for its privacy benefits:
essentially, a global model is trained with updates computed on mobile devices
while keeping the data of users local. Standard FL infrastructures are however
designed to have no energy or performance impact on mobile devices, and are
therefore not suitable for applications that require frequent (online) model
updates, such as news recommenders.
  This paper presents FLeet, the first Online FL system, acting as a middleware
between the Android OS and the machine learning application. FLeet combines the
privacy of Standard FL with the precision of online learning thanks to two core
components: (i) I-Prof, a new lightweight profiler that predicts and controls
the impact of learning tasks on mobile devices, and (ii) AdaSGD, a new adaptive
learning algorithm that is resilient to delayed updates.
  Our extensive evaluation shows that Online FL, as implemented by FLeet, can
deliver a 2.3x quality boost compared to Standard FL, while only consuming
0.036% of the battery per day. I-Prof can accurately control the impact of
learning tasks by improving the prediction accuracy up to 3.6x (computation
time) and up to 19x (energy). AdaSGD outperforms alternative FL approaches by
18.4% in terms of convergence speed on heterogeneous data.
","[{'version': 'v1', 'created': 'Fri, 12 Jun 2020 15:43:38 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Dec 2020 11:19:50 GMT'}]",2020-12-04,"[['Damaskinos', 'Georgios', ''], ['Guerraoui', 'Rachid', ''], ['Kermarrec', 'Anne-Marie', ''], ['Nitu', 'Vlad', ''], ['Patra', 'Rhicheek', ''], ['Taiani', 'Francois', '']]","['federated learning', 'online learning', 'asynchronous gradient descent', 'profiling', 'mobile Android devices']"
6570,2007.15206,Rui Li,"Rui Li, Jianbo Yang, Xianguo Tuo and Rui Shi","Research on Fitness Function of Two Evolution Algorithms Used for
  Neutron Spectrum Unfolding","12 pages,5 figures",,10.1007/s40042-020-00005-x,,cs.NE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When evolution algorithms are used to unfold the neutron energy spectrum,
fitness function design is an important fundamental work for evaluating the
quality of the solution, but it has not attracted much attention. In this work,
we investigated the performance of eight fitness functions attached to the
genetic algorithm (GA) and the differential evolution algorithm (DEA) used for
unfolding four neutron spectra selected from the IAEA 403 report. Experiments
show that the fitness functions with a maximum in the GA can limit the ability
of the population to percept the fitness change, but the ability can be made up
in the DEA. The fitness function with a feature penalty term helps to improve
the performance of solutions, and the fitness function using the standard
deviation and the Chi-squared result shows the balance between the algorithm
and the spectra. The results also show that the DEA has good potential for
neutron energy spectrum unfolding. The purposes of this work are to provide
evidence for structuring and modifying the fitness functions and to suggest
some genetic operations that should receive attention when using the fitness
function to unfold neutron spectra.
","[{'version': 'v1', 'created': 'Thu, 30 Jul 2020 03:27:09 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Jan 2021 01:17:56 GMT'}]",2021-02-03,"[['Li', 'Rui', ''], ['Yang', 'Jianbo', ''], ['Tuo', 'Xianguo', ''], ['Shi', 'Rui', '']]","['Fitness function', 'Difference evolution algorithm', 'Genetic algorithm', 'Neutron spectrum']"
6571,2001.04192,Bernard Espinasse,"Rinaldo Lima, Bernard Espinasse (LIS, R2I), Fred Freitas","A logic-based relational learning approach to relation extraction: The
  OntoILPER system",,"Engineering Applications of Artificial Intelligence, Elsevier,
  2019, 78, pp.142-157",10.1016/j.engappai.2018.11.001,,cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Relation Extraction (RE), the task of detecting and characterizing semantic
relations between entities in text, has gained much importance in the last two
decades, mainly in the biomedical domain. Many papers have been published on
Relation Extraction using supervised machine learning techniques. Most of these
techniques rely on statistical methods, such as feature-based and
tree-kernels-based methods. Such statistical learning techniques are usually
based on a propositional hypothesis space for representing examples, i.e., they
employ an attribute-value representation of features. This kind of
representation has some drawbacks, particularly in the extraction of complex
relations which demand more contextual information about the involving
instances, i.e., it is not able to effectively capture structural information
from parse trees without loss of information. In this work, we present
OntoILPER, a logic-based relational learning approach to Relation Extraction
that uses Inductive Logic Programming for generating extraction models in the
form of symbolic extraction rules. OntoILPER takes profit of a rich relational
representation of examples, which can alleviate the aforementioned drawbacks.
The proposed relational approach seems to be more suitable for Relation
Extraction than statistical ones for several reasons that we argue. Moreover,
OntoILPER uses a domain ontology that guides the background knowledge
generation process and is used for storing the extracted relation instances.
The induced extraction rules were evaluated on three protein-protein
interaction datasets from the biomedical domain. The performance of OntoILPER
extraction models was compared with other state-of-the-art RE systems. The
encouraging results seem to demonstrate the effectiveness of the proposed
solution.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2020 12:47:49 GMT'}]",2020-01-14,"[['Lima', 'Rinaldo', '', 'LIS, R2I'], ['Espinasse', 'Bernard', '', 'LIS, R2I'], ['Freitas', 'Fred', '']]","['Relation Extraction', 'Rule Induction', 'Information Extraction', 'Inductive Logic Programming', 'Relational Learning']"
6572,1910.05779,Amin M Khan,"Petter Tunstad, Amin M. Khan, Phuong Hoai Ha","HyperProv: Decentralized Resilient Data Provenance at the Edge with
  Blockchains",,,10.1145/3366627.3368105,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data provenance and lineage are critical for ensuring integrity and
reproducibility of information in research and application. This is
particularly challenging for distributed scenarios, where data may be
originating from decentralized sources without any central control by a single
trusted entity. We present HyperProv, a general framework for data provenance
based on the permissioned blockchain Hyperledger Fabric (HLF), and to the best
of our knowledge, the first system that is ported to ARM based devices such as
Raspberry Pi (RPi). HyperProv tracks the metadata, operation history and data
lineage through a set of built-in queries using smart contracts, enabling
lightweight retrieval of provenance data. HyperProv provides convenient
integration through a NodeJS client library, and also includes off-chain
storage through the SSH file system. We evaluate HyperProv's performance,
throughput, resource consumption, and energy efficiency on x86-64 machines, as
well as on RPi devices for IoT use cases at the edge.
","[{'version': 'v1', 'created': 'Sun, 13 Oct 2019 16:16:52 GMT'}]",2020-01-20,"[['Tunstad', 'Petter', ''], ['Khan', 'Amin M.', ''], ['Ha', 'Phuong Hoai', '']]","['Blockchain', 'Data Provenance', 'Edge Computing']"
6573,2009.02062,Foivos Diakogiannis,"Foivos I. Diakogiannis, Fran\c{c}ois Waldner, Peter Caccetta",Looking for change? Roll the Dice and demand Attention,"28 pages, under review in ISPRS P&RS, 1st revision. Figures of low
  quality due to compression for arxiv. Reduced abstract in arxiv due to
  character limitations",https://www.mdpi.com/2072-4292/13/18/3707,10.3390/rs13183707,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Change detection, i.e. identification per pixel of changes for some classes
of interest from a set of bi-temporal co-registered images, is a fundamental
task in the field of remote sensing. It remains challenging due to unrelated
forms of change that appear at different times in input images. Here, we
propose a reliable deep learning framework for the task of semantic change
detection in very high-resolution aerial images. Our framework consists of a
new loss function, new attention modules, new feature extraction building
blocks, and a new backbone architecture that is tailored for the task of
semantic change detection. Specifically, we define a new form of set
similarity, that is based on an iterative evaluation of a variant of the Dice
coefficient. We use this similarity metric to define a new loss function as
well as a new spatial and channel convolution Attention layer (the FracTAL).
The new attention layer, designed specifically for vision tasks, is memory
efficient, thus suitable for use in all levels of deep convolutional networks.
Based on these, we introduce two new efficient self-contained feature
extraction convolution units. We validate the performance of these feature
extraction building blocks on the CIFAR10 reference data and compare the
results with standard ResNet modules. Further, we introduce a new
encoder/decoder scheme, a network macro-topology, that is tailored for the task
of change detection. Our network moves away from any notion of subtraction of
feature layers for identifying change. We validate our approach by showing
excellent performance and achieving state of the art score (F1 and Intersection
over Union-hereafter IoU) on two building change detection datasets, namely,
the LEVIRCD (F1: 0.918, IoU: 0.848) and the WHU (F1: 0.938, IoU: 0.882)
datasets.
","[{'version': 'v1', 'created': 'Fri, 4 Sep 2020 08:30:25 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Mar 2021 08:15:48 GMT'}]",2021-09-20,"[['Diakogiannis', 'Foivos I.', ''], ['Waldner', 'François', ''], ['Caccetta', 'Peter', '']]","['convolutional neural network', 'change detection', 'Attention', 'Dice similarity', 'Tanimoto', 'semantic segmentation']"
6574,2011.05734,Tobias Scheck,"Tobias Scheck, Ana Perez Grassi, Gangolf Hirtz","A CNN-based Feature Space for Semi-supervised Incremental Learning in
  Assisted Living Applications",Accepted in VISAPP 2020,,10.5220/0008871302170224,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  A Convolutional Neural Network (CNN) is sometimes confronted with objects of
changing appearance ( new instances) that exceed its generalization capability.
This requires the CNN to incorporate new knowledge, i.e., to learn
incrementally. In this paper, we are concerned with this problem in the context
of assisted living. We propose using the feature space that results from the
training dataset to automatically label problematic images that could not be
properly recognized by the CNN. The idea is to exploit the extra information in
the feature space for a semi-supervised labeling and to employ problematic
images to improve the CNN's classification model. Among other benefits, the
resulting semi-supervised incremental learning process allows improving the
classification accuracy of new instances by 40% as illustrated by extensive
experiments.
","[{'version': 'v1', 'created': 'Wed, 11 Nov 2020 12:31:48 GMT'}]",2020-11-12,"[['Scheck', 'Tobias', ''], ['Grassi', 'Ana Perez', ''], ['Hirtz', 'Gangolf', '']]","['Ambient Assisted Living', 'Convolutional Neural Networks', 'Semi-Supervised', 'Incremental Learning']"
6575,1906.10679,Karsten Paul,"Karsten Paul, Christopher Zimmermann, Kranthi K. Mandadapu, Thomas
  J.R. Hughes, Chad M. Landis, Roger A. Sauer","An adaptive space-time phase field formulation for dynamic fracture of
  brittle shells based on LR NURBS","In this version, typos were fixed, Fig. 16 is added, the literature
  review is extended and clarifying explanations and remarks are added at
  several places. Supplementary movies are available at
  https://av.tib.eu/series/641/supplemental+videos+of+the+paper+an+adaptive+space+time+phase+field+formulation+for+dynamic+fracture+of+brittle+shells+based+on+lr+nurbs","Comput. Mech. 65, 1039-1062 (2020)",10.1007/s00466-019-01807-y,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an adaptive space-time phase field formulation for dynamic
fracture of brittle shells. Their deformation is characterized by the
Kirchhoff-Love thin shell theory using a curvilinear surface description. All
kinematical objects are defined on the shell's mid-plane. The evolution
equation for the phase field is determined by the minimization of an energy
functional based on Griffith's theory of brittle fracture. Membrane and bending
contributions to the fracture process are modeled separately and a thickness
integration is established for the latter. The coupled system consists of two
nonlinear fourth-order PDEs and all quantities are defined on an evolving
two-dimensional manifold. Since the weak form requires $C^1$-continuity,
isogeometric shape functions are used. The mesh is adaptively refined based on
the phase field using Locally Refinable (LR) NURBS. Time is discretized based
on a generalized-$\alpha$ method using adaptive time-stepping, and the
discretized coupled system is solved with a monolithic Newton-Raphson scheme.
The interaction between surface deformation and crack evolution is demonstrated
by several numerical examples showing dynamic crack propagation and branching.
","[{'version': 'v1', 'created': 'Tue, 25 Jun 2019 17:35:04 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Jun 2020 08:06:34 GMT'}]",2020-06-19,"[['Paul', 'Karsten', ''], ['Zimmermann', 'Christopher', ''], ['Mandadapu', 'Kranthi K.', ''], ['Hughes', 'Thomas J. R.', ''], ['Landis', 'Chad M.', ''], ['Sauer', 'Roger A.', '']]","['Phase fields', 'brittle fracture', 'isogeometric analysis', 'adaptive local refinement', 'LRNURBS', 'nonlinear finite elements', 'Kirchhoff-Love shells']"
6576,2109.14840,Roopak Sinha,"Shereen Afifi, Hamid GholamHosseini, and Roopak Sinha",A system on chip for melanoma detection using FPGA-based SVM classifier,"Journal paper, 13 pages, 3 figures, 9 tables","A system on chip for melanoma detection using FPGA-based SVM
  classifier, Microprocessors and Microsystems 65(2019) pp.57-68",10.1016/j.micpro.2018.12.005,,cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Support Vector Machine (SVM) is a robust machine learning model that shows
high accuracy with different classification problems, and is widely used for
various embedded applications. However , implementation of embedded SVM
classifiers is challenging, due to the inherent complicated computations
required. This motivates implementing the SVM on hardware platforms for
achieving high performance computing at low cost and power consumption.
Melanoma is the most aggressive form of skin cancer that increases the
mortality rate. We aim to develop an optimized embedded SVM classifier
dedicated for a low-cost handheld device for early detection of melanoma at the
primary healthcare. In this paper, we propose a hardware/software co-design for
implementing the SVM classifier onto FPGA to realize melanoma detection on a
chip. The implemented SVM on a recent hybrid FPGA (Zynq) platform utilizing the
modern UltraFast High-Level Synthesis design methodology achieves efficient
melanoma classification on chip. The hardware implementation results
demonstrate classification accuracy of 97.9%, and a significant hardware
acceleration rate of 21 with only 3% resources utilization and 1.69W for power
consumption. These results show that the implemented system on chip meets
crucial embedded system constraints of high performance and low resources
utilization, power consumption, and cost, while achieving efficient
classification with high classification accuracy.
","[{'version': 'v1', 'created': 'Thu, 30 Sep 2021 04:30:54 GMT'}]",2021-10-01,"[['Afifi', 'Shereen', ''], ['GholamHosseini', 'Hamid', ''], ['Sinha', 'Roopak', '']]","['SVM', 'FPGA', 'Embedded system', 'System on chip', 'Hardware/software co-design', 'Melanoma']"
6577,2109.10886,Alka Khurana,Alka Khurana and Vasudha Bhatnagar,Investigating Entropy for Extractive Document Summarization,,,10.1016/j.eswa.2021.115820,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Automatic text summarization aims to cut down readers time and cognitive
effort by reducing the content of a text document without compromising on its
essence. Ergo, informativeness is the prime attribute of document summary
generated by an algorithm, and selecting sentences that capture the essence of
a document is the primary goal of extractive document summarization. In this
paper, we employ Shannon entropy to capture informativeness of sentences. We
employ Non-negative Matrix Factorization (NMF) to reveal probability
distributions for computing entropy of terms, topics, and sentences in latent
space. We present an information theoretic interpretation of the computed
entropy, which is the bedrock of the proposed E-Summ algorithm, an unsupervised
method for extractive document summarization. The algorithm systematically
applies information theoretic principle for selecting informative sentences
from important topics in the document. The proposed algorithm is generic and
fast, and hence amenable to use for summarization of documents in real time.
Furthermore, it is domain-, collection-independent and agnostic to the language
of the document. Benefiting from strictly positive NMF factor matrices, E-Summ
algorithm is transparent and explainable too. We use standard ROUGE toolkit for
performance evaluation of the proposed method on four well known public
data-sets. We also perform quantitative assessment of E-Summ summary quality by
computing its semantic similarity w.r.t the original document. Our
investigation reveals that though using NMF and information theoretic approach
for document summarization promises efficient, explainable, and language
independent text summarization, it needs to be bolstered to match the
performance of deep neural methods.
","[{'version': 'v1', 'created': 'Wed, 22 Sep 2021 17:54:30 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Sep 2021 02:10:22 GMT'}]",2021-10-01,"[['Khurana', 'Alka', ''], ['Bhatnagar', 'Vasudha', '']]","['Entropy', 'Non-negative Matrix Factorization', 'Extractive']"
6578,1912.10762,Wen Song,"Wen Song, Zhiguang Cao, Jie Zhang, Andrew Lim","Learning Variable Ordering Heuristics for Solving Constraint
  Satisfaction Problems",,,10.1016/j.engappai.2021.104603,,cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Backtracking search algorithms are often used to solve the Constraint
Satisfaction Problem (CSP). The efficiency of backtracking search depends
greatly on the variable ordering heuristics. Currently, the most commonly used
heuristics are hand-crafted based on expert knowledge. In this paper, we
propose a deep reinforcement learning based approach to automatically discover
new variable ordering heuristics that are better adapted for a given class of
CSP instances. We show that directly optimizing the search cost is hard for
bootstrapping, and propose to optimize the expected cost of reaching a leaf
node in the search tree. To capture the complex relations among the variables
and constraints, we design a representation scheme based on Graph Neural
Network that can process CSP instances with different sizes and constraint
arities. Experimental results on random CSP instances show that the learned
policies outperform classical hand-crafted heuristics in terms of minimizing
the search tree size, and can effectively generalize to instances that are
larger than those used in training.
","[{'version': 'v1', 'created': 'Mon, 23 Dec 2019 12:27:04 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Nov 2020 06:45:31 GMT'}, {'version': 'v3', 'created': 'Sat, 25 Dec 2021 12:24:49 GMT'}]",2021-12-28,"[['Song', 'Wen', ''], ['Cao', 'Zhiguang', ''], ['Zhang', 'Jie', ''], ['Lim', 'Andrew', '']]","['Constraint Satisfaction Problem', 'variable ordering', 'deep reinforcement learning', 'Graph NeuralNetwork']"
6579,2005.04398,Claudiu Herteliu,"Catalin Emilian Boja, Claudiu Herteliu, Marian Dardala, Bogdan Vasile
  Ileanu","Day of the week submission effect for accepted papers in Physica A, PLOS
  ONE, Nature and Cell","113 pages, 5 figures, 7 tables, 42 references, 4 SI figures, 3 SI
  tables, 4 SI sections","Published, Scientometrics, Volume 117, Issue 2, 2018, pp. 887-918",10.1007/s11192-018-2911-7,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The particular day of the week when an event occurs seems to have unexpected
consequences. For example, the day of the week when a paper is submitted to a
peer reviewed journal correlates with whether that paper is accepted. Using an
econometric analysis (a mix of log-log and semi-log based on undated and panel
structured data) we find that more papers are submitted to certain peer review
journals on particular weekdays than others, with fewer papers being submitted
on weekends. Seasonal effects, geographical information as well as potential
changes over time are examined. This finding rests on a large (178 000) and
reliable sample; the journals polled are broadly recognized (Nature, Cell, PLOS
ONE and Physica A). Day of the week effect in the submission of accepted papers
should be of interest to many researchers, editors and publishers, and perhaps
also to managers and psychologists.
","[{'version': 'v1', 'created': 'Sat, 9 May 2020 09:23:44 GMT'}]",2020-05-12,"[['Boja', 'Catalin Emilian', ''], ['Herteliu', 'Claudiu', ''], ['Dardala', 'Marian', ''], ['Ileanu', 'Bogdan Vasile', '']]","['day of the week effect', 'DWE', 'peer reviewed journals', 'seasonal effects', 'GIS']"
6580,2109.11970,Eleonora Borgia,"Eleonora Borgia, Raffaele Bruno, Andrea Passarella","Making opportunistic networks in IoT environments CCN-ready: A
  performance evaluation of the MobCCN protocol",,Computer Communications 123 (2018): 81-96,10.1016/j.comcom.2018.03.005,,cs.NI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In future IoT environments it is expected that the role of personal devices
of mobile users in the physical area where IoT devices are deployed will become
more and more important. In particular, due to the push towards
decentralisation of services towards the edge, it is likely that a significant
share of data generated by IoT devices will be needed by other (mobile) nodes
nearby, while global Internet access will be limited only to a small fraction
of data. In this context, opportunistic networking schemes can be adopted to
build efficient content-centric protocols, through which data generated by IoT
devices (or by mobile nodes themselves) can be accessed by the other nodes
nearby. In this paper, we propose MobCCN, which is an ICN-compliant protocol
for this heterogeneous environment. MobCCN is designed to implement the routing
and forwarding mechanisms of the main ICN realisations, such as CCN. The
original aspect of MobCCN is to implement an efficient opportunistic networking
routing scheme to populate the Forwarding Interest Base (FIB) tables of the
nodes, in order to guide the propagation of Interest packets towards nodes that
store the required data. Specifically, MobCCN defines the utility of each node
as a forwarder of Interest packets for a certain type of content, such that
Interest packets can be propagated along a positive utility gradient, until
reaching some node storing the data. We evaluate MobCCN against protocols
representing two possible endpoints of the spectrum, respectively in terms of
minimising the data delivery delay and the resource consumption. Performance
results show that MobCCN is very effective and efficient, as it guarantees very
high delivery rates and low delays, while keeping the total generated traffic
at a reasonable level and also saving local resources.
","[{'version': 'v1', 'created': 'Fri, 24 Sep 2021 13:58:43 GMT'}]",2021-09-27,"[['Borgia', 'Eleonora', ''], ['Bruno', 'Raffaele', ''], ['Passarella', 'Andrea', '']]","['Information-centric Networks', 'CCN', 'Opportunistic Networks', 'IoT']"
6581,1704.02272,Xavier Bellekens,"Xavier Bellekens and Christos Tachtatzis and Robert Atkinson and Craig
  Renfrew and Tony Kirkham","A Highly-Efficient Memory-Compression Scheme for GPU-Accelerated
  Intrusion Detection Systems","Published in The 7th International Conference of Security of
  Information and Networks, SIN 2014, Glasgow, UK, September, 2014",,10.1145/2659651.2659723,,cs.DC cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Pattern Matching is a computationally intensive task used in many research
fields and real world applications. Due to the ever-growing volume of data to
be processed, and increasing link speeds, the number of patterns to be matched
has risen significantly. In this paper we explore the parallel capabilities of
modern General Purpose Graphics Processing Units (GPGPU) applications for high
speed pattern matching. A highly compressed failure-less Aho-Corasick algorithm
is presented for Intrusion Detection Systems on off-the-shelf hardware. This
approach maximises the bandwidth for data transfers between the host and the
Graphics Processing Unit (GPU). Experiments are performed on multiple alphabet
sizes, demonstrating the capabilities of the library to be used in different
research fields, while sustaining an adequate throughput for intrusion
detection systems or DNA sequencing. The work also explores the performance
impact of adequate prefix matching for alphabet sizes and varying pattern
numbers achieving speeds up to 8Gbps and low memory consumption for intrusion
detection systems.
","[{'version': 'v1', 'created': 'Fri, 7 Apr 2017 15:57:37 GMT'}]",2017-04-10,"[['Bellekens', 'Xavier', ''], ['Tachtatzis', 'Christos', ''], ['Atkinson', 'Robert', ''], ['Renfrew', 'Craig', ''], ['Kirkham', 'Tony', '']]","['Security', 'GPU', 'CUDA', 'Pattern Matching', 'Intrusion Detection Systems']"
6582,2109.12014,Nathanael Perraudin N. P.,"Romana Rust, Achilleas Xydis, Kurt Heutschi, Nathana\""el Perraudin,
  Gonzalo Casas, Chaoyu Du, J\""urgen Strauss, Kurt Eggenschwiler, Fernando
  Perez-Cruz, Fabio Gramazio, Matthias Kohler",A data acquisition setup for data driven acoustic design,,Building Acoustics. February 2021,10.1177/1351010X20986901,,cs.SD cs.LG eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a novel interdisciplinary approach to study the
relationship between diffusive surface structures and their acoustic
performance. Using computational design, surface structures are iteratively
generated and 3D printed at 1:10 model scale. They originate from different
fabrication typologies and are designed to have acoustic diffusion and
absorption effects. An automated robotic process measures the impulse responses
of these surfaces by positioning a microphone and a speaker at multiple
locations. The collected data serves two purposes: first, as an exploratory
catalogue of different spatio-temporal-acoustic scenarios and second, as data
set for predicting the acoustic response of digitally designed surface
geometries using machine learning. In this paper, we present the automated data
acquisition setup, the data processing and the computational generation of
diffusive surface structures. We describe first results of comparative studies
of measured surface panels and conclude with steps of future research.
","[{'version': 'v1', 'created': 'Fri, 24 Sep 2021 15:20:02 GMT'}]",2021-09-27,"[['Rust', 'Romana', ''], ['Xydis', 'Achilleas', ''], ['Heutschi', 'Kurt', ''], ['Perraudin', 'Nathanaël', ''], ['Casas', 'Gonzalo', ''], ['Du', 'Chaoyu', ''], ['Strauss', 'Jürgen', ''], ['Eggenschwiler', 'Kurt', ''], ['Perez-Cruz', 'Fernando', ''], ['Gramazio', 'Fabio', ''], ['Kohler', 'Matthias', '']]","['Architecture', 'Acoustics', 'Digital Fabrication', 'Computational Design', 'Machine Learning']"
6583,2212.13369,Le Cai,"Le Cai, Sam Ferguson, Haiyan Lu and Gengfa Fang","Feature Selection Approaches for Optimising Music Emotion Recognition
  Methods",,,10.5121/csit.2022.122302,,cs.SD cs.LG cs.MM eess.AS,http://creativecommons.org/licenses/by/4.0/,"  The high feature dimensionality is a challenge in music emotion recognition.
There is no common consensus on a relation between audio features and emotion.
The MER system uses all available features to recognize emotion; however, this
is not an optimal solution since it contains irrelevant data acting as noise.
In this paper, we introduce a feature selection approach to eliminate redundant
features for MER. We created a Selected Feature Set (SFS) based on the feature
selection algorithm (FSA) and benchmarked it by training with two models,
Support Vector Regression (SVR) and Random Forest (RF) and comparing them
against with using the Complete Feature Set (CFS). The result indicates that
the performance of MER has improved for both Random Forest (RF) and Support
Vector Regression (SVR) models by using SFS. We found using FSA can improve
performance in all scenarios, and it has potential benefits for model
efficiency and stability for MER task.
","[{'version': 'v1', 'created': 'Tue, 27 Dec 2022 05:55:34 GMT'}]",2022-12-29,"[['Cai', 'Le', ''], ['Ferguson', 'Sam', ''], ['Lu', 'Haiyan', ''], ['Fang', 'Gengfa', '']]","['Emotion recognition', 'Music Information Retrieval', 'Audio Features', 'Feature Selection', 'Mediaeval']"
6584,2109.08477,M\'elodie Boillet,"M\'elodie Boillet, Martin Maarand, Thierry Paquet and Christopher
  Kermorvant","Including Keyword Position in Image-based Models for Act Segmentation of
  Historical Registers",,"The 6th International Workshop on Historical Document Imaging and
  Processing (2021)",10.1145/3476887.3476905,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The segmentation of complex images into semantic regions has seen a growing
interest these last years with the advent of Deep Learning. Until recently,
most existing methods for Historical Document Analysis focused on the visual
appearance of documents, ignoring the rich information that textual content can
offer. However, the segmentation of complex documents into semantic regions is
sometimes impossible relying only on visual features and recent models embed
both visual and textual information. In this paper, we focus on the use of both
visual and textual information for segmenting historical registers into
structured and meaningful units such as acts. An act is a text recording
containing valuable knowledge such as demographic information (baptism,
marriage or death) or royal decisions (donation or pardon). We propose a simple
pipeline to enrich document images with the position of text lines containing
key-phrases and show that running a standard image-based layout analysis system
on these images can lead to significant gains. Our experiments show that the
detection of acts increases from 38 % of mAP to 74 % when adding textual
information, in real use-case conditions where text lines positions and content
are extracted with an automatic recognition system.
","[{'version': 'v1', 'created': 'Fri, 17 Sep 2021 11:38:34 GMT'}]",2021-11-03,"[['Boillet', 'Mélodie', ''], ['Maarand', 'Martin', ''], ['Paquet', 'Thierry', ''], ['Kermorvant', 'Christopher', '']]","['Historical Document', 'Act Segmentation', 'Deep Learning']"
6585,2007.09352,Amin Jalali,Amin Jalali,Graph-based process mining,,,10.1007/978-3-030-72693-5_21,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Process mining is an area of research that supports discovering information
about business processes from their execution event logs. The increasing amount
of event logs in organizations challenges current process mining techniques,
which tend to load data into the memory of a computer. This issue limits the
organizations to apply process mining on a large scale and introduces risks due
to the lack of data management capabilities. Therefore, this paper introduces
and formalizes a new approach to store and retrieve event logs into/from graph
databases. It defines an algorithm to compute Directly Follows Graph (DFG)
inside the graph database, which shifts the heavy computation parts of process
mining into the graph database. Calculating DFG in graph databases enables
leveraging the graph databases' horizontal and vertical scaling capabilities in
favor of applying process mining on a large scale. Besides, it removes the
requirement to move data into analysts' computer. Thus, it enables using data
management capabilities in graph databases. We implemented this approach in
Neo4j and evaluated its performance compared with current techniques using a
real log file. The result shows that our approach enables the calculation of
DFG when the data is much bigger than the computational memory. It also shows
better performance when dicing data into small chunks.
","[{'version': 'v1', 'created': 'Sat, 18 Jul 2020 07:15:32 GMT'}]",2022-02-10,"[['Jalali', 'Amin', '']]","['Process mining', 'graph database', 'Big Data', 'Neo4j']"
6586,2009.13792,K K Thyagharajan,"S. D. Lalitha, K. K. Thyagharajan","Micro-Facial Expression Recognition in Video Based on Optimal
  Convolutional Neural Network (MFEOCNN) Algorithm","19 pages, 10 figures, ""for published version see
  https://www.ijeat.org/wp-content/uploads/papers/v9i1/A9802109119.pdf""",,10.35940/ijeat.A9802.109119,,cs.CV cs.AI cs.LG cs.MM eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Facial expression is a standout amongst the most imperative features of human
emotion recognition. For demonstrating the emotional states facial expressions
are utilized by the people. In any case, recognition of facial expressions has
persisted a testing and intriguing issue with regards to PC vision. Recognizing
the Micro-Facial expression in video sequence is the main objective of the
proposed approach. For efficient recognition, the proposed method utilizes the
optimal convolution neural network. Here the proposed method considering the
input dataset is the CK+ dataset. At first, by means of Adaptive median
filtering preprocessing is performed in the input image. From the preprocessed
output, the extracted features are Geometric features, Histogram of Oriented
Gradients features and Local binary pattern features. The novelty of the
proposed method is, with the help of Modified Lion Optimization (MLO)
algorithm, the optimal features are selected from the extracted features. In a
shorter computational time, it has the benefits of rapidly focalizing and
effectively acknowledging with the aim of getting an overall arrangement or
idea. Finally, the recognition is done by Convolution Neural network (CNN).
Then the performance of the proposed MFEOCNN method is analysed in terms of
false measures and recognition accuracy. This kind of emotion recognition is
mainly used in medicine, marketing, E-learning, entertainment, law and
monitoring. From the simulation, we know that the proposed approach achieves
maximum recognition accuracy of 99.2% with minimum Mean Absolute Error (MAE)
value. These results are compared with the existing for MicroFacial Expression
Based Deep-Rooted Learning (MFEDRL), Convolutional Neural Network with Lion
Optimization (CNN+LO) and Convolutional Neural Network (CNN) without
optimization. The simulation of the proposed method is done in the working
platform of MATLAB.
","[{'version': 'v1', 'created': 'Tue, 29 Sep 2020 05:56:26 GMT'}]",2020-09-30,"[['Lalitha', 'S. D.', ''], ['Thyagharajan', 'K. K.', '']]","['Adaptive median Filter', 'Micro-Facial Expression', 'Histogram of Oriented Gradients', 'Local binary pattern', 'Geometric']"
6587,2110.06475,Shen Qijie,"Qijie Shen, Wanjie Tao, Jing Zhang, Hong Wen, Zulong Chen, Quan Lu","SAR-Net: A Scenario-Aware Ranking Network for Personalized Fair
  Recommendation in Hundreds of Travel Scenarios",Accepted by CIKM 2021,,10.1145/3459637.3481948,,cs.LG cs.AI cs.IR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The travel marketing platform of Alibaba serves an indispensable role for
hundreds of different travel scenarios from Fliggy, Taobao, Alipay apps, etc.
To provide personalized recommendation service for users visiting different
scenarios, there are two critical issues to be carefully addressed. First,
since the traffic characteristics of different scenarios, it is very
challenging to train a unified model to serve all. Second, during the promotion
period, the exposure of some specific items will be re-weighted due to manual
intervention, resulting in biased logs, which will degrade the ranking model
trained using these biased data. In this paper, we propose a novel
Scenario-Aware Ranking Network (SAR-Net) to address these issues. SAR-Net
harvests the abundant data from different scenarios by learning users'
cross-scenario interests via two specific attention modules, which leverage the
scenario features and item features to modulate the user behavior features,
respectively. Then, taking the encoded features of previous module as input, a
scenario-specific linear transformation layer is adopted to further extract
scenario-specific features, followed by two groups of debias expert networks,
i.e., scenario-specific experts and scenario-shared experts. They output
intermediate results independently, which are further fused into the final
result by a multi-scenario gating module. In addition, to mitigate the data
fairness issue caused by manual intervention, we propose the concept of
Fairness Coefficient (FC) to measures the importance of individual sample and
use it to reweigh the prediction in the debias expert networks. Experiments on
an offline dataset covering over 80 million users and 1.55 million travel items
and an online A/B test demonstrate the effectiveness of our SAR-Net and its
superiority over state-of-the-art methods.
","[{'version': 'v1', 'created': 'Wed, 13 Oct 2021 03:49:45 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Oct 2021 12:55:43 GMT'}]",2021-10-20,"[['Shen', 'Qijie', ''], ['Tao', 'Wanjie', ''], ['Zhang', 'Jing', ''], ['Wen', 'Hong', ''], ['Chen', 'Zulong', ''], ['Lu', 'Quan', '']]","['Recommender system', 'Click-through rate prediction', 'Scenarioaware', 'Fairness coefficient']"
6588,1508.07240,Sajjad Khaleqi,"Kourosh Parand, Sajjad Khaleqi","Rational Chebyshev of Second Kind Collocation Method for Solving a Class
  of Astrophysics Problems",arXiv admin note: text overlap with arXiv:1008.2063,,10.1140/epjp/i2016-16024-8,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Lane-Emden equation has been used to model several phenomenas in
theoretical physics, mathematical physics and astrophysics such as the theory
of stellar structure. This study is an attempt to utilize the collocation
method with the Rational Chebyshev of Second Kind function (RSC) to solve the
Lane-Emden equation over the semi-infinit interval [0; +infinity). According to
well-known results and comparing with previous methods, it can be said that
this method is efficient and applicable.
","[{'version': 'v1', 'created': 'Fri, 28 Aug 2015 15:18:17 GMT'}]",2016-05-27,"[['Parand', 'Kourosh', ''], ['Khaleqi', 'Sajjad', '']]","['Lane-Emden', 'Collocation method', 'Rational Chebyshev of Second Kind', 'Nonlinear ODE', 'Astrophysics']"
6589,2010.11263,Wojciech Kozlowski,"Wojciech Kozlowski, Fernando Kuipers, Stephanie Wehner",A P4 Data Plane for the Quantum Internet,,"In Proceedings of the 3rd P4 Workshop in Europe (EuroP4'20).
  Association for Computing Machinery, New York, NY, USA, 49-51. (2020)",10.1145/3426744.3431321,,cs.NI quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The quantum technology revolution brings with it the promise of a quantum
internet. A new -- quantum -- network stack will be needed to account for the
fundamentally new properties of quantum entanglement. The first realisations of
quantum networks are imminent and research interest in quantum network
protocols has started growing. In the non-quantum world, programmable data
planes have broken the pattern of ossification of the protocol stack and
enabled a new -- software-defined -- network software architecture. Similarly,
a programmable quantum data plane could pave the way for a software-defined
quantum network architecture. In this paper, we demonstrate how we use
P4$_{16}$ to explore abstractions and device architectures for quantum
networks.
","[{'version': 'v1', 'created': 'Wed, 21 Oct 2020 19:37:23 GMT'}]",2020-12-02,"[['Kozlowski', 'Wojciech', ''], ['Kuipers', 'Fernando', ''], ['Wehner', 'Stephanie', '']]","['quantum internet', 'quantum networks', 'quantum communication', 'quantum data plane', 'P4', 'programmable networks']"
6590,2205.08175,"Nathana\""el Fijalkow","Nathana\""el Fijalkow, Cristian Riveros, James Worrell",Probabilistic Automata of Bounded Ambiguity,"Short version in CONCUR'17, Long version in Information and
  Computation (special issue on Weighted Automata)","Information and Computation, Volume 282, January 2022, 104648",10.1016/j.ic.2020.104648,,cs.FL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Probabilistic automata are an extension of nondeterministic finite automata
in which transitions are annotated with probabilities. Despite its simplicity,
this model is very expressive and many of the associated algorithmic questions
are undecidable. In this work we focus on the emptiness problem (and its
variant the value problem), which asks whether a given probabilistic automaton
accepts some word with probability greater than a given threshold. We consider
a natural and well-studied structural restriction on automata, namely the
degree of ambiguity, which is defined as the maximum number of accepting runs
over all words. The known undecidability proofs exploits infinite ambiguity and
so we focus on the case of finitely ambiguous probabilistic automata. Our main
contributions are to construct efficient algorithms for analysing finitely
ambiguous probabilistic automata through a reduction to a multi-objective
optimisation problem called the stochastic path problem. We obtain a polynomial
time algorithm for approximating the value of probabilistic automata of fixed
ambiguity and a quasi-polynomial time algorithm for the emptiness problem for
2-ambiguous probabilistic automata. We complement these positive results by an
inapproximability result stating that the value of finitely ambiguous
probabilistic automata cannot be approximated unless PTIME = NP.
","[{'version': 'v1', 'created': 'Tue, 17 May 2022 08:37:40 GMT'}, {'version': 'v2', 'created': 'Thu, 19 May 2022 12:32:59 GMT'}]",2022-05-20,"[['Fijalkow', 'Nathanaël', ''], ['Riveros', 'Cristian', ''], ['Worrell', 'James', '']]","['probabilistic automata', 'weighted automata', 'multi-objectiveoptimisation']"
6591,2208.10499,Jun Rekimoto,Jun Rekimoto,"DualVoice: Speech Interaction that Discriminates between Normal and
  Whispered Voice Input",to appear as ACM UIST 2022 paper,,10.1145/3526113.3545685,,cs.HC cs.LG cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interactions based on automatic speech recognition (ASR) have become widely
used, with speech input being increasingly utilized to create documents.
However, as there is no easy way to distinguish between commands being issued
and text required to be input in speech, misrecognitions are difficult to
identify and correct, meaning that documents need to be manually edited and
corrected. The input of symbols and commands is also challenging because these
may be misrecognized as text letters. To address these problems, this study
proposes a speech interaction method called DualVoice, by which commands can be
input in a whispered voice and letters in a normal voice. The proposed method
does not require any specialized hardware other than a regular microphone,
enabling a complete hands-free interaction. The method can be used in a wide
range of situations where speech recognition is already available, ranging from
text input to mobile/wearable computing. Two neural networks were designed in
this study, one for discriminating normal speech from whispered speech, and the
second for recognizing whisper speech. A prototype of a text input system was
then developed to show how normal and whispered voice can be used in speech
text input. Other potential applications using DualVoice are also discussed.
","[{'version': 'v1', 'created': 'Mon, 22 Aug 2022 13:01:28 GMT'}]",2022-08-24,"[['Rekimoto', 'Jun', '']]","['speech interaction', 'whisper voice recognition', 'whisper voice classification', 'neural networks']"
6592,1902.02834,Nikolaj Tatti,"Nikolaj Tatti, Jilles Vreeken","The Long and the Short of It: Summarising Event Sequences with Serial
  Episodes",,,10.1145/2339530.2339606,,cs.DS cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An ideal outcome of pattern mining is a small set of informative patterns,
containing no redundancy or noise, that identifies the key structure of the
data at hand. Standard frequent pattern miners do not achieve this goal, as due
to the pattern explosion typically very large numbers of highly redundant
patterns are returned.
  We pursue the ideal for sequential data, by employing a pattern set mining
approach-an approach where, instead of ranking patterns individually, we
consider results as a whole. Pattern set mining has been successfully applied
to transactional data, but has been surprisingly under studied for sequential
data.
  In this paper, we employ the MDL principle to identify the set of sequential
patterns that summarises the data best. In particular, we formalise how to
encode sequential data using sets of serial episodes, and use the encoded
length as a quality score. As search strategy, we propose two approaches: the
first algorithm selects a good pattern set from a large candidate set, while
the second is a parameter-free any-time algorithm that mines pattern sets
directly from the data. Experimentation on synthetic and real data demonstrates
we efficiently discover small sets of informative patterns.
","[{'version': 'v1', 'created': 'Thu, 7 Feb 2019 20:25:50 GMT'}]",2019-02-11,"[['Tatti', 'Nikolaj', ''], ['Vreeken', 'Jilles', '']]","['serial episodes', 'event sequence', 'pattern mining', 'pattern set mining']"
6593,1906.05586,Shuyuan Li,"Shuyuan Li, Jianguo Li, Hanlin Tang, Rui Qian, Weiyao Lin",ATRW: A Benchmark for Amur Tiger Re-identification in the Wild,ACM Multimedia (MM) 2020,,10.1145/3394171.3413569,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Monitoring the population and movements of endangered species is an important
task to wildlife conversation. Traditional tagging methods do not scale to
large populations, while applying computer vision methods to camera sensor data
requires re-identification (re-ID) algorithms to obtain accurate counts and
moving trajectory of wildlife. However, existing re-ID methods are largely
targeted at persons and cars, which have limited pose variations and
constrained capture environments. This paper tries to fill the gap by
introducing a novel large-scale dataset, the Amur Tiger Re-identification in
the Wild (ATRW) dataset. ATRW contains over 8,000 video clips from 92 Amur
tigers, with bounding box, pose keypoint, and tiger identity annotations. In
contrast to typical re-ID datasets, the tigers are captured in a diverse set of
unconstrained poses and lighting conditions. We demonstrate with a set of
baseline algorithms that ATRW is a challenging dataset for re-ID. Lastly, we
propose a novel method for tiger re-identification, which introduces precise
pose parts modeling in deep neural networks to handle large pose variation of
tigers, and reaches notable performance improvement over existing re-ID
methods. The dataset is public available at https://cvwc2019.github.io/ .
","[{'version': 'v1', 'created': 'Thu, 13 Jun 2019 10:16:30 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Jun 2019 08:25:54 GMT'}, {'version': 'v3', 'created': 'Tue, 27 Oct 2020 10:20:17 GMT'}, {'version': 'v4', 'created': 'Thu, 29 Oct 2020 11:04:38 GMT'}, {'version': 'v5', 'created': 'Sat, 31 Oct 2020 17:46:09 GMT'}]",2020-11-03,"[['Li', 'Shuyuan', ''], ['Li', 'Jianguo', ''], ['Tang', 'Hanlin', ''], ['Qian', 'Rui', ''], ['Lin', 'Weiyao', '']]","['re-identification', 'benchmark evaluation', 'wildlife conservation', 'techfor good']"
6594,2107.08699,Laura M. Castro,"Fernando Benavides Rodr\'iguez, Laura M. Castro","Detecting Oxbow Code in Erlang Codebases with the Highest Degree of
  Certainty","13 pages, 1 figure, 2 tables",,10.1145/3471871.3472961,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The presence of source code that is no longer needed is a handicap to project
maintainability. The larger and longer-lived the project, the higher the
chances of accumulating dead code in its different forms.
  Manually detecting unused code is time-consuming, tedious, error-prone, and
requires a great level of deep knowledge about the codebase. In this paper, we
examine the kinds of dead code (specifically, oxbow code) that can appear in
Erlang projects, and formulate rules to identify them with high accuracy.
  We also present an open-source static analyzer that implements these rules,
allowing for the automatic detection and confident removal of oxbow code in
Erlang codebases, actively contributing to increasing their quality and
maintainability.
","[{'version': 'v1', 'created': 'Mon, 19 Jul 2021 09:17:12 GMT'}]",2021-07-20,"[['Rodríguez', 'Fernando Benavides', ''], ['Castro', 'Laura M.', '']]","['oxbow code', 'maintainability', 'quality', 'Erlang']"
6595,2101.11218,Jennifer Jacobs,"Jingyi Li, Sonia Hashim, Jennifer Jacobs",What We Can Learn From Visual Artists About Software Development,"1 figure, CHI 2021",,10.1145/3411764.344568,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  This paper explores software's role in visual art production by examining how
artists use and develop software. We conducted interviews with professional
artists who were collaborating with software developers, learning software
development, and building and maintaining software. We found artists were
motivated to learn software development for intellectual growth and access to
technical communities. Artists valued efficient workflows through skilled
manual execution and personal software development, but avoided high-level
forms of software automation. Artists identified conflicts between their
priorities and those of professional developers and computational art
communities, which influenced how they used computational aesthetics in their
work. These findings contribute to efforts in systems engineering research to
integrate end-user programming and creativity support across software and
physical media, suggesting opportunities for artists as collaborators. Artists'
experiences writing software can guide technical implementations of
domain-specific representations, and their experiences in interdisciplinary
production can aid inclusive community building around computational tools.
","[{'version': 'v1', 'created': 'Wed, 27 Jan 2021 06:04:55 GMT'}]",2021-01-28,"[['Li', 'Jingyi', ''], ['Hashim', 'Sonia', ''], ['Jacobs', 'Jennifer', '']]","['visual art', 'software development', 'creativity support tools']"
6596,2208.05908,Dingyi Zhuang,"Dingyi Zhuang, Shenhao Wang, Haris N. Koutsopoulos, and Jinhua Zhao","Uncertainty Quantification of Sparse Travel Demand Prediction with
  Spatial-Temporal Graph Neural Networks",Accepted by KDD 2022,,10.1145/3534678.3539093,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Origin-Destination (O-D) travel demand prediction is a fundamental challenge
in transportation. Recently, spatial-temporal deep learning models demonstrate
the tremendous potential to enhance prediction accuracy. However, few studies
tackled the uncertainty and sparsity issues in fine-grained O-D matrices. This
presents a serious problem, because a vast number of zeros deviate from the
Gaussian assumption underlying the deterministic deep learning models. To
address this issue, we design a Spatial-Temporal Zero-Inflated Negative
Binomial Graph Neural Network (STZINB-GNN) to quantify the uncertainty of the
sparse travel demand. It analyzes spatial and temporal correlations using
diffusion and temporal convolution networks, which are then fused to
parameterize the probabilistic distributions of travel demand. The STZINB-GNN
is examined using two real-world datasets with various spatial and temporal
resolutions. The results demonstrate the superiority of STZINB-GNN over
benchmark models, especially under high spatial-temporal resolutions, because
of its high accuracy, tight confidence intervals, and interpretable parameters.
The sparsity parameter of the STZINB-GNN has physical interpretation for
various transportation applications.
","[{'version': 'v1', 'created': 'Thu, 11 Aug 2022 16:21:10 GMT'}]",2022-08-17,"[['Zhuang', 'Dingyi', ''], ['Wang', 'Shenhao', ''], ['Koutsopoulos', 'Haris N.', ''], ['Zhao', 'Jinhua', '']]","['Spatial-temporal Sparse Data', 'Uncertainty Quantification', 'GraphNeural Networks', 'Travel Demand']"
6597,2002.00717,Xinze Zhang,"Xinze Zhang, Kun He, Yukun Bao","Error-feedback stochastic modeling strategy for time series forecasting
  with convolutional neural networks",,Neurocomputing 459 (2021): 234-248,10.1016/j.neucom.2021.06.051,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the superiority of convolutional neural networks demonstrated in time
series modeling and forecasting, it has not been fully explored on the design
of the neural network architecture and the tuning of the hyper-parameters.
Inspired by the incremental construction strategy for building a random
multilayer perceptron, we propose a novel Error-feedback Stochastic Modeling
(ESM) strategy to construct a random Convolutional Neural Network (ESM-CNN) for
time series forecasting task, which builds the network architecture adaptively.
The ESM strategy suggests that random filters and neurons of the error-feedback
fully connected layer are incrementally added to steadily compensate the
prediction error during the construction process, and then a filter selection
strategy is introduced to enable ESM-CNN to extract the different size of
temporal features, providing helpful information at each iterative process for
the prediction. The performance of ESM-CNN is justified on its prediction
accuracy of one-step-ahead and multi-step-ahead forecasting tasks respectively.
Comprehensive experiments on both the synthetic and real-world datasets show
that the proposed ESM-CNN not only outperforms the state-of-art random neural
networks, but also exhibits stronger predictive power and less computing
overhead in comparison to trained state-of-art deep neural network models.
","[{'version': 'v1', 'created': 'Mon, 3 Feb 2020 13:30:29 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Feb 2022 14:02:34 GMT'}]",2022-02-14,"[['Zhang', 'Xinze', ''], ['He', 'Kun', ''], ['Bao', 'Yukun', '']]","['Convolutional neural network', 'error-feedback stochastic modeling', 'time seriesforecasting']"
6598,1508.05253,Ulrich Pferschy,Gaia Nicosia and Andrea Pacifici and Ulrich Pferschy,Price of Fairness for Allocating a Bounded Resource,,"European Journal of Operational Research 257, 2017, 933-943",10.1016/j.ejor.2016.08.013,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we study the problem of allocating a scarce resource among
several players (or agents). A central decision maker wants to maximize the
total utility of all agents. However, such a solution may be unfair for one or
more agents in the sense that it can be achieved through a very unbalanced
allocation of the resource. On the other hand fair/balanced allocations may be
far from being optimal from a central point of view. So, in this paper we are
interested in assessing the quality of fair solutions, i.e. in measuring the
system efficiency loss under a fair allocation compared to the one that
maximizes the sum of agents utilities. This indicator is usually called the
Price of Fairness and we study it under three different definitions of
fairness, namely maximin, Kalai-Smorodinski and proportional fairness.
  Our results are of two different types. We first formalize a number of
properties holding for any general multi-agent problem without any special
assumption on the agents utility sets. Then we introduce an allocation problem,
where each agent can consume the resource in given discrete quantities (items),
such that the maximization of the total utility is given by a Subset Sum
Problem. For the resulting Fair Subset Sum Problem, in the case of two agents,
we provide upper and lower bounds on the Price of Fairness as functions of an
upper bound on the items size.
","[{'version': 'v1', 'created': 'Fri, 21 Aug 2015 12:08:05 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Dec 2015 12:23:57 GMT'}]",2016-11-21,"[['Nicosia', 'Gaia', ''], ['Pacifici', 'Andrea', ''], ['Pferschy', 'Ulrich', '']]","['subset sum problem', 'fairness', 'multi-agent systems', 'bicriteria optimization']"
6599,1904.10411,Bolun Cai,"Bolun Cai, Xiangmin Xu, Xiaofen Xing, Kui Jia, Jie Miao, Dacheng Tao",BIT: Biologically Inspired Tracker,,IEEE Trans. on Image Proc. 25 (2016) 1327-1339,10.1109/TIP.2016.2520358,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visual tracking is challenging due to image variations caused by various
factors, such as object deformation, scale change, illumination change and
occlusion. Given the superior tracking performance of human visual system
(HVS), an ideal design of biologically inspired model is expected to improve
computer visual tracking. This is however a difficult task due to the
incomplete understanding of neurons' working mechanism in HVS. This paper aims
to address this challenge based on the analysis of visual cognitive mechanism
of the ventral stream in the visual cortex, which simulates shallow neurons (S1
units and C1 units) to extract low-level biologically inspired features for the
target appearance and imitates an advanced learning mechanism (S2 units and C2
units) to combine generative and discriminative models for target location. In
addition, fast Gabor approximation (FGA) and fast Fourier transform (FFT) are
adopted for real-time learning and detection in this framework. Extensive
experiments on large-scale benchmark datasets show that the proposed
biologically inspired tracker performs favorably against state-of-the-art
methods in terms of efficiency, accuracy, and robustness. The acceleration
technique in particular ensures that BIT maintains a speed of approximately 45
frames per second.
","[{'version': 'v1', 'created': 'Tue, 23 Apr 2019 16:32:24 GMT'}]",2019-04-24,"[['Cai', 'Bolun', ''], ['Xu', 'Xiangmin', ''], ['Xing', 'Xiaofen', ''], ['Jia', 'Kui', ''], ['Miao', 'Jie', ''], ['Tao', 'Dacheng', '']]","['Biologically inspired model', 'visual tracking', 'fastGabor approximation', 'fast Fourier transform']"
6600,2202.07036,Felix Ott,"Felix Ott and David R\""ugamer and Lucas Heublein and Tim Hamann and
  Jens Barth and Bernd Bischl and Christopher Mutschler","Benchmarking Online Sequence-to-Sequence and Character-based Handwriting
  Recognition from IMU-Enhanced Pens","Accepted for International Journal on Document Analysis and
  Recognition (IJDAR)",,10.1007/s10032-022-00415-6,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose. Handwriting is one of the most frequently occurring patterns in
everyday life and with it come challenging applications such as handwriting
recognition (HWR), writer identification, and signature verification. In
contrast to offline HWR that only uses spatial information (i.e., images),
online HWR (OnHWR) uses richer spatio-temporal information (i.e., trajectory
data or inertial data). While there exist many offline HWR datasets, there is
only little data available for the development of OnHWR methods on paper as it
requires hardware-integrated pens. Methods. This paper presents data and
benchmark models for real-time sequence-to-sequence (seq2seq) learning and
single character-based recognition. Our data is recorded by a sensor-enhanced
ballpoint pen, yielding sensor data streams from triaxial accelerometers, a
gyroscope, a magnetometer and a force sensor at 100 Hz. We propose a variety of
datasets including equations and words for both the writer-dependent and
writer-independent tasks. Our datasets allow a comparison between classical
OnHWR on tablets and on paper with sensor-enhanced pens. We provide an
evaluation benchmark for seq2seq and single character-based HWR using recurrent
and temporal convolutional networks and Transformers combined with a
connectionist temporal classification (CTC) loss and cross-entropy (CE) losses.
Results. Our convolutional network combined with BiLSTMs outperforms
Transformer-based architectures, is on par with InceptionTime for
sequence-based classification tasks, and yields better results compared to 28
state-of-the-art techniques. Time-series augmentation methods improve the
sequence-based task, and we show that CE variants can improve the single
classification task.
","[{'version': 'v1', 'created': 'Mon, 14 Feb 2022 20:55:33 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Sep 2022 21:38:54 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Sep 2022 15:17:22 GMT'}]",2022-09-22,"[['Ott', 'Felix', ''], ['Rügamer', 'David', ''], ['Heublein', 'Lucas', ''], ['Hamann', 'Tim', ''], ['Barth', 'Jens', ''], ['Bischl', 'Bernd', ''], ['Mutschler', 'Christopher', '']]","['Online handwriting recognition', 'sequencebased and character datasets', 'time-series data', 'sensorenhanced pen', 'writer-(in)dependent', 'architectures']"
6601,2112.02163,Manabu Tsukada,Kosuke Nakagawa and Manabu Tsukada and Keiichi Shima and Hiroshi Esaki,"WebRTC-based measurement tool for peer-to-peer applications and
  preliminary findings with real users","Accepted to 16th Asian Internet Engineering Conference (AINTEC), 2021",,10.1145/3497777.3498544,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  Direct peer-to-peer (P2P) communication is often used to minimize the
end-to-end latency for real-time applications that require accurate
synchronization, such as remote musical ensembles. However, there are few
studies on the performance of P2P communication between home network
environments, thus hindering the deployment of services that require
synchronization. In this study, we developed a P2P performance measurement tool
using the Web Real-Time Communication (WebRTC) statistics application
programming interface. Using this tool, we can easily measure P2P performance
between home network environments on a web browser without downloading client
applications. We also verified the reliability of round-trip time (RTT)
measurements using WebRTC and confirmed that our system could provide the
necessary measurement accuracy for RTT and jitter measurements for real-time
applications. In addition, we measured the performance of a full mesh topology
connection with 10 users in an actual environment in Japan. Consequently, we
found that only 66% of the peer connections had a latency of 30 ms or less,
which is the minimum requirement for high synchronization applications, such as
musical ensembles.
","[{'version': 'v1', 'created': 'Fri, 3 Dec 2021 21:29:17 GMT'}]",2021-12-07,"[['Nakagawa', 'Kosuke', ''], ['Tsukada', 'Manabu', ''], ['Shima', 'Keiichi', ''], ['Esaki', 'Hiroshi', '']]","['Remote Collaboration', 'P2P', 'Network Measurements', 'WebRTC']"
6602,2108.06127,Teresa Gomez-Diaz,"Teresa Gomez-Diaz, Tomas Recio","Open comments on the Task Force SIRS report: Scholarly Infrastructures
  for Research Software (EOSC Executive Board, EOSCArchitecture)",,Research Ideas and Outcomes 7: e63872 (2021),10.3897/rio.7.e63872,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  The goal of this document is to openly contribute with our comments to the
EOSCArchitecture report: Scholarly Infrastructures for Research Software
(SIRS), and thus, to participate in the European Open Science Cloud (EOSC)
architecture design.
","[{'version': 'v1', 'created': 'Fri, 13 Aug 2021 09:04:52 GMT'}]",2021-08-24,"[['Gomez-Diaz', 'Teresa', ''], ['Recio', 'Tomas', '']]","['Open Science Infrastructures', 'Research Software', 'Open Science']"
6603,2202.04561,Ashwin Singh,"Ashwin Singh, Arvindh Arun, Ayushi Jain, Pooja Desur, Pulak Malhotra,
  Duen Horng Chau, Ponnurangam Kumaraguru","Erasing Labor with Labor: Dark Patterns and Lockstep Behaviors on Google
  Play",,,10.1145/3511095.3536368,,cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Google Play's policy forbids the use of incentivized installs, ratings, and
reviews to manipulate the placement of apps. However, there still exist apps
that incentivize installs for other apps on the platform. To understand how
install-incentivizing apps affect users, we examine their ecosystem through a
socio-technical lens and perform a mixed-methods analysis of their reviews and
permissions. Our dataset contains 319K reviews collected daily over five months
from 60 such apps that cumulatively account for over 160.5M installs. We
perform qualitative analysis of reviews to reveal various types of dark
patterns that developers incorporate in install-incentivizing apps,
highlighting their normative concerns at both user and platform levels.
Permissions requested by these apps validate our discovery of dark patterns,
with over 92% apps accessing sensitive user information. We find evidence of
fraudulent reviews on install-incentivizing apps, following which we model them
as an edge stream in a dynamic bipartite graph of apps and reviewers. Our
proposed reconfiguration of a state-of-the-art microcluster anomaly detection
algorithm yields promising preliminary results in detecting this fraud. We
discover highly significant lockstep behaviors exhibited by reviews that aim to
boost the overall rating of an install-incentivizing app. Upon evaluating the
50 most suspicious clusters of boosting reviews detected by the algorithm, we
find (i) near-identical pairs of reviews across 94% (47 clusters), and (ii)
over 35% (1,687 of 4,717 reviews) present in the same form near-identical pairs
within their cluster. Finally, we conclude with a discussion on how fraud is
intertwined with labor and poses a threat to the trust and transparency of
Google Play.
","[{'version': 'v1', 'created': 'Wed, 9 Feb 2022 16:54:27 GMT'}, {'version': 'v2', 'created': 'Tue, 17 May 2022 22:10:54 GMT'}]",2022-05-19,"[['Singh', 'Ashwin', ''], ['Arun', 'Arvindh', ''], ['Jain', 'Ayushi', ''], ['Desur', 'Pooja', ''], ['Malhotra', 'Pulak', ''], ['Chau', 'Duen Horng', ''], ['Kumaraguru', 'Ponnurangam', '']]","['Google Play', 'Dark Patterns', 'Fraud', 'Labor']"
6604,2006.01310,Antonio Ricardo Alexandre Brasil,"Antonio Ricardo Alexandre Brasil and Jefferson Oliveira Andrade and
  Karin Satie Komati",Eye Movements Biometrics: A Bibliometric Analysis from 2004 to 2019,"9 pages, 2 figures, journal","International Journal of Computer Applications 176(24):1-9, May
  2020",10.5120/ijca2020920243,,cs.HC cs.CV cs.DL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Person identification based on eye movements is getting more and more
attention, as it is anti-spoofing resistant and can be useful for continuous
authentication. Therefore, it is noteworthy for researchers to know who and
what is relevant in the field, including authors, journals, conferences, and
institutions. This paper presents a comprehensive quantitative overview of the
field of eye movement biometrics using a bibliometric approach. All data and
analyses are based on documents written in English published between 2004 and
2019. Scopus was used to perform information retrieval. This research focused
on temporal evolution, leading authors, most cited papers, leading journals,
competitions and collaboration networks.
","[{'version': 'v1', 'created': 'Mon, 1 Jun 2020 23:14:10 GMT'}]",2020-06-03,"[['Brasil', 'Antonio Ricardo Alexandre', ''], ['Andrade', 'Jefferson Oliveira', ''], ['Komati', 'Karin Satie', '']]","['eye movements', 'person identification', 'bibliometric analysis', 'biometrics']"
6605,2204.09310,Yawen Wang,"Yawen Wang, Junjie Wang, Hongyu Zhang, Xuran Ming, Lin Shi, Qing Wang",Where is Your App Frustrating Users?,,,10.1145/3510003.3510189,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  User reviews of mobile apps provide a communication channel for developers to
perceive user satisfaction. Many app features that users have problems with are
usually expressed by key phrases such as ""upload pictures"", which could be
buried in the review texts. The lack of fine-grained view about problematic
features could obscure the developers' understanding of where the app is
frustrating users, and postpone the improvement of the apps. Existing
pattern-based approaches to extract target phrases suffer from low accuracy due
to insufficient semantic understanding of the reviews, thus can only summarize
the high-level topics/aspects of the reviews. This paper proposes a
semantic-aware, fine-grained app review analysis approach (SIRA) to extract,
cluster, and visualize the problematic features of apps. The main component of
SIRA is a novel BERT+Attr-CRF model for fine-grained problematic feature
extraction, which combines textual descriptions and review attributes to better
model the semantics of reviews and boost the performance of the traditional
BERT-CRF model. SIRA also clusters the extracted phrases based on their
semantic relations and presents a visualization of the summaries. Our
evaluation on 3,426 reviews from six apps confirms the effectiveness of SIRA in
problematic feature extraction and clustering. We further conduct an empirical
study with SIRA on 318,534 reviews of 18 popular apps to explore its potential
application and examine its usefulness in real-world practice.
","[{'version': 'v1', 'created': 'Wed, 20 Apr 2022 08:49:02 GMT'}]",2022-04-21,"[['Wang', 'Yawen', ''], ['Wang', 'Junjie', ''], ['Zhang', 'Hongyu', ''], ['Ming', 'Xuran', ''], ['Shi', 'Lin', ''], ['Wang', 'Qing', '']]","['App Review', 'Information Extraction', 'Deep Learning']"
6606,2205.05758,Jakob Schoeffer,"Jakob Schoeffer, Niklas Kuehl, Yvette Machowski","""There Is Not Enough Information"": On the Effects of Explanations on
  Perceptions of Informational Fairness and Trustworthiness in Automated
  Decision-Making","2022 ACM Conference on Fairness, Accountability, and Transparency
  (FAccT '22), June 21--24, 2022, Seoul, Republic of Korea",,10.1145/3531146.3533218,,cs.HC cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Automated decision systems (ADS) are increasingly used for consequential
decision-making. These systems often rely on sophisticated yet opaque machine
learning models, which do not allow for understanding how a given decision was
arrived at. In this work, we conduct a human subject study to assess people's
perceptions of informational fairness (i.e., whether people think they are
given adequate information on and explanation of the process and its outcomes)
and trustworthiness of an underlying ADS when provided with varying types of
information about the system. More specifically, we instantiate an ADS in the
area of automated loan approval and generate different explanations that are
commonly used in the literature. We randomize the amount of information that
study participants get to see by providing certain groups of people with the
same explanations as others plus additional explanations. From our quantitative
analyses, we observe that different amounts of information as well as people's
(self-assessed) AI literacy significantly influence the perceived informational
fairness, which, in turn, positively relates to perceived trustworthiness of
the ADS. A comprehensive analysis of qualitative feedback sheds light on
people's desiderata for explanations, among which are (i) consistency (both
with people's expectations and across different explanations), (ii) disclosure
of monotonic relationships between features and outcome, and (iii)
actionability of recommendations.
","[{'version': 'v1', 'created': 'Wed, 11 May 2022 20:06:03 GMT'}]",2022-05-13,"[['Schoeffer', 'Jakob', ''], ['Kuehl', 'Niklas', ''], ['Machowski', 'Yvette', '']]","['Automated decision-making', 'explanations', 'informational fairness', 'machine learning', 'perceptions', 'trustworthiness']"
6607,2210.13660,Giovanni Apruzzese,"Giovanni Apruzzese, Mauro Conti, Ying Yuan","SpacePhish: The Evasion-space of Adversarial Attacks against Phishing
  Website Detectors using Machine Learning",,,10.1145/3564625.3567980,,cs.CR cs.LG cs.NI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Existing literature on adversarial Machine Learning (ML) focuses either on
showing attacks that break every ML model, or defenses that withstand most
attacks. Unfortunately, little consideration is given to the actual
\textit{cost} of the attack or the defense. Moreover, adversarial samples are
often crafted in the ""feature-space"", making the corresponding evaluations of
questionable value. Simply put, the current situation does not allow to
estimate the actual threat posed by adversarial attacks, leading to a lack of
secure ML systems.
  We aim to clarify such confusion in this paper. By considering the
application of ML for Phishing Website Detection (PWD), we formalize the
""evasion-space"" in which an adversarial perturbation can be introduced to fool
a ML-PWD -- demonstrating that even perturbations in the ""feature-space"" are
useful. Then, we propose a realistic threat model describing evasion attacks
against ML-PWD that are cheap to stage, and hence intrinsically more attractive
for real phishers. Finally, we perform the first statistically validated
assessment of state-of-the-art ML-PWD against 12 evasion attacks. Our
evaluation shows (i) the true efficacy of evasion attempts that are more likely
to occur; and (ii) the impact of perturbations crafted in different
evasion-spaces. Our realistic evasion attempts induce a statistically
significant degradation (3-10% at $p\!<$0.05), and their cheap cost makes them
a subtle threat. Notably, however, some ML-PWD are immune to our most realistic
attacks ($p$=0.22). Our contribution paves the way for a much needed
re-assessment of adversarial attacks against ML systems for cybersecurity.
","[{'version': 'v1', 'created': 'Mon, 24 Oct 2022 23:45:09 GMT'}]",2022-10-26,"[['Apruzzese', 'Giovanni', ''], ['Conti', 'Mauro', ''], ['Yuan', 'Ying', '']]","['Machine Learning', 'Phishing', 'Website', 'Adversarial Attacks']"
6608,2002.04991,Maximilian Weininger,"Pranav Ashok, Mathias Jackermeier, Pushpak Jagtap, Jan
  K\v{r}et\'insk\'y, Maximilian Weininger, Majid Zamani","dtControl: Decision Tree Learning Algorithms for Controller
  Representation",,,10.1145/3365365.3383468,,cs.LG cs.AI cs.SY eess.SY stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Decision tree learning is a popular classification technique most commonly
used in machine learning applications. Recent work has shown that decision
trees can be used to represent provably-correct controllers concisely. Compared
to representations using lookup tables or binary decision diagrams, decision
trees are smaller and more explainable. We present dtControl, an easily
extensible tool for representing memoryless controllers as decision trees. We
give a comprehensive evaluation of various decision tree learning algorithms
applied to 10 case studies arising out of correct-by-construction controller
synthesis. These algorithms include two new techniques, one for using arbitrary
linear binary classifiers in the decision tree learning, and one novel approach
for determinizing controllers during the decision tree construction. In
particular the latter turns out to be extremely efficient, yielding decision
trees with a single-digit number of decision nodes on 5 of the case studies.
","[{'version': 'v1', 'created': 'Wed, 12 Feb 2020 17:13:17 GMT'}]",2021-02-02,"[['Ashok', 'Pranav', ''], ['Jackermeier', 'Mathias', ''], ['Jagtap', 'Pushpak', ''], ['Křetínský', 'Jan', ''], ['Weininger', 'Maximilian', ''], ['Zamani', 'Majid', '']]","['Controller representation', 'Decision tree', 'Machine learning', 'Symbolic control', 'Non-uniform quantizer', 'Explainability', 'Invarianceentropy']"
6609,2101.09716,TianZhang He,"TianZhang He, Adel N. Toosi, Rajkumar Buyya","SLA-Aware Multiple Migration Planning and Scheduling in SDN-NFV-enabled
  Clouds",,"Journal of Systems and Software, Volume 176, 2021, 110943, ISSN
  0164-1212",10.1016/j.jss.2021.110943,,cs.NI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Software-Defined Networking (SDN)-enabled cloud data centers, live
migration is a key approach used for the reallocation of Virtual Machines (VMs)
in cloud services and Virtual Network Functions (VNFs) in Service Function
Chaining (SFC). Using live migration methods, cloud providers can address their
dynamic resource management and fault tolerance objectives without interrupting
the service of users. However, in cloud data centers, performing multiple live
migrations in arbitrary order can lead to service degradation. Therefore,
efficient migration planning is essential to reduce the impact of live
migration overheads. In addition, to prevent Quality of Service (QoS)
degradations and Service Level Agreement (SLA) violations, it is necessary to
set priorities for different live migration requests with various urgency. In
this paper, we propose SLAMIG, a set of algorithms that composes the
deadline-aware multiple migration grouping algorithm and on-line migration
scheduling to determine the sequence of VM/VNF migrations. The experimental
results show that our approach with reasonable algorithm runtime can
efficiently reduce the number of deadline misses and has a good migration
performance compared with the one-by-one scheduling and two state-of-the-art
algorithms in terms of total migration time, average execution time, downtime,
and transferred data. We also evaluate and analyze the impact of multiple
migration planning and scheduling on QoS and energy consumption.
","[{'version': 'v1', 'created': 'Sun, 24 Jan 2021 13:15:59 GMT'}]",2021-12-30,"[['He', 'TianZhang', ''], ['Toosi', 'Adel N.', ''], ['Buyya', 'Rajkumar', '']]","['live VM migration', 'software-defined networking', 'deadlineviolation', 'multiple migration performance', 'energy consumption', 'quality ofservice']"
6610,2208.03136,"J\""urgen Dobaj","J\""urgen Dobaj, Andreas Riel, Georg Macher, Markus Egretzberger","A Method for Deriving Technical Requirements of Digital Twins as
  Industrial Product-Service System Enablers",,,10.1007/978-3-031-15559-8_27,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Industrial Product-Service Systems (IPSS) are increasingly dominant in
several sectors. Predominant value-adding services provided for industrial
assets such as production systems, electric power plants, and car fleets are
remote asset maintenance, monitoring, control, and reconfiguration. IPSS
designers lack methods and tools supporting them in systematically deriving
technical design requirements for the underlying Cyber-Physical System (CPS)
IPSS services. At the same time, the use of Digital Twins (DTs) as digital
representations of CPS as-sets is becoming increasingly feasible thanks to
powerful, networked information technology (IT) and operation technology (OT)
infrastructures and the ubiquity of sensors and data. This paper proposes a
method for guiding IPSS designers in the specification and implementation of DT
instances to serve as the key enablers of IPSS services. The systematic mapping
of the continuous IT design-build-deployment cycle concept to the OT domain of
CPS is at the heart of the applied methodology, which is complemented by a
stakeholder-driven requirements elicitation. The key contribution is a
structured method for deriving technical design requirements for DT instances
as IPSS. This method is validated on real-world use cases in an evaluation
environment for distributed CPS IPSS.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2022 13:02:12 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Aug 2022 09:04:56 GMT'}]",2022-08-11,"[['Dobaj', 'Jürgen', ''], ['Riel', 'Andreas', ''], ['Macher', 'Georg', ''], ['Egretzberger', 'Markus', '']]","['Design', 'Digital Twin', 'IPSS', 'CPS', 'Industry 4.0']"
6611,2202.10848,Thilo Hagendorff,"Thilo Hagendorff, Leonie Bossert, Tse Yip Fai, Peter Singer","Speciesist bias in AI -- How AI applications perpetuate discrimination
  and unfair outcomes against animals",,,10.1007/s43681-022-00199-9,,cs.LG cs.AI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Massive efforts are made to reduce biases in both data and algorithms in
order to render AI applications fair. These efforts are propelled by various
high-profile cases where biased algorithmic decision-making caused harm to
women, people of color, minorities, etc. However, the AI fairness field still
succumbs to a blind spot, namely its insensitivity to discrimination against
animals. This paper is the first to describe the 'speciesist bias' and
investigate it in several different AI systems. Speciesist biases are learned
and solidified by AI applications when they are trained on datasets in which
speciesist patterns prevail. These patterns can be found in image recognition
systems, large language models, and recommender systems. Therefore, AI
technologies currently play a significant role in perpetuating and normalizing
violence against animals. This can only be changed when AI fairness frameworks
widen their scope and include mitigation measures for speciesist biases. This
paper addresses the AI community in this regard and stresses the influence AI
systems can have on either increasing or reducing the violence that is
inflicted on animals, and especially on farmed animals.
","[{'version': 'v1', 'created': 'Tue, 22 Feb 2022 12:23:21 GMT'}]",2022-09-01,"[['Hagendorff', 'Thilo', ''], ['Bossert', 'Leonie', ''], ['Fai', 'Tse Yip', ''], ['Singer', 'Peter', '']]","['speciesist bias', 'fairness', 'artificial intelligence', 'machine learning', 'AI ethics', 'animal ethics']"
6612,2203.08320,Derek Robinson,"Derek Robinson, Keanelek Enns, Neha Koulecar, and Manish Sihag",Two Approaches to Survival Analysis of Open Source Python Projects,"9 pages, 5 figures, to be published at ICPC 2022",,10.1145/3524610.3527871,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  A recent study applied frequentist survival analysis methods to a subset of
the Software Heritage Graph and determined which attributes of an OSS project
contribute to its health. This paper serves as an exact replication of that
study. In addition, Bayesian survival analysis methods were applied to the same
dataset, and an additional project attribute was studied to serve as a
conceptual replication. Both analyses focus on the effects of certain
attributes on the survival of open-source software projects as measured by
their revision activity. Methods such as the Kaplan-Meier estimator, Cox
Proportional-Hazards model, and the visualization of posterior survival
functions were used for each of the project attributes. The results show that
projects which publish major releases, have repositories on multiple hosting
services, possess a large team of developers, and make frequent revisions have
a higher likelihood of survival in the long run. The findings were similar to
the original study; however, a deeper look revealed quantitative
inconsistencies.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2022 23:43:33 GMT'}]",2022-07-20,"[['Robinson', 'Derek', ''], ['Enns', 'Keanelek', ''], ['Koulecar', 'Neha', ''], ['Sihag', 'Manish', '']]","['data science', 'survival analysis', 'open source', 'python', 'Kaplan Meier', 'Cox Proportional-Hazards model', 'Bayesian analysis', 'frequentist']"
6613,2203.08314,Hyeok Kim,"Hyeok Kim, Ryan Rossi, Fan Du, Eunyee Koh, Shunan Guo, Jessica
  Hullman, Jane Hoffswell",Cicero: A Declarative Grammar for Responsive Visualization,"14 pages, 15 figures, accepted to CHI 2022",,10.1145/3491102.3517455,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Designing responsive visualizations can be cast as applying transformations
to a source view to render it suitable for a different screen size. However,
designing responsive visualizations is often tedious as authors must manually
apply and reason about candidate transformations. We present Cicero, a
declarative grammar for concisely specifying responsive visualization
transformations which paves the way for more intelligent responsive
visualization authoring tools. Cicero's flexible specifier syntax allows
authors to select visualization elements to transform, independent of the
source view's structure. Cicero encodes a concise set of actions to encode a
diverse set of transformations in both desktop-first and mobile-first design
processes. Authors can ultimately reuse design-agnostic transformations across
different visualizations. To demonstrate the utility of Cicero, we develop a
compiler to an extended version of Vega-Lite, and provide principles for our
compiler. We further discuss the incorporation of Cicero into responsive
visualization authoring tools, such as a design recommender.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2022 23:18:42 GMT'}]",2022-03-17,"[['Kim', 'Hyeok', ''], ['Rossi', 'Ryan', ''], ['Du', 'Fan', ''], ['Koh', 'Eunyee', ''], ['Guo', 'Shunan', ''], ['Hullman', 'Jessica', ''], ['Hoffswell', 'Jane', '']]","['Visualization', 'responsive visualization', 'grammar']"
6614,2007.01864,Di Yuan,"Di Yuan, Xiu Shu, Nana Fan, Xiaojun Chang, Qiao Liu and Zhenyu He","Accurate Bounding-box Regression with Distance-IoU Loss for Visual
  Tracking",,,10.1016/j.jvcir.2021.103428,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most existing trackers are based on using a classifier and multi-scale
estimation to estimate the target state. Consequently, and as expected,
trackers have become more stable while tracking accuracy has stagnated. While
trackers adopt a maximum overlap method based on an intersection-over-union
(IoU) loss to mitigate this problem, there are defects in the IoU loss itself,
that make it impossible to continue to optimize the objective function when a
given bounding box is completely contained within/without another bounding box;
this makes it very challenging to accurately estimate the target state.
Accordingly, in this paper, we address the above-mentioned problem by proposing
a novel tracking method based on a distance-IoU (DIoU) loss, such that the
proposed tracker consists of target estimation and target classification. The
target estimation part is trained to predict the DIoU score between the target
ground-truth bounding-box and the estimated bounding-box. The DIoU loss can
maintain the advantage provided by the IoU loss while minimizing the distance
between the center points of two bounding boxes, thereby making the target
estimation more accurate. Moreover, we introduce a classification part that is
trained online and optimized with a Conjugate-Gradient-based strategy to
guarantee real-time tracking speed. Comprehensive experimental results
demonstrate that the proposed method achieves competitive tracking accuracy
when compared to state-of-the-art trackers while with a real-time tracking
speed.
","[{'version': 'v1', 'created': 'Fri, 3 Jul 2020 11:57:54 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Aug 2020 07:51:48 GMT'}, {'version': 'v3', 'created': 'Sun, 10 Jan 2021 04:04:45 GMT'}, {'version': 'v4', 'created': 'Thu, 20 Jan 2022 02:43:52 GMT'}]",2022-01-21,"[['Yuan', 'Di', ''], ['Shu', 'Xiu', ''], ['Fan', 'Nana', ''], ['Chang', 'Xiaojun', ''], ['Liu', 'Qiao', ''], ['He', 'Zhenyu', '']]","['visual tracking', 'bounding-box regression', 'distance-IoU loss']"
6615,2001.02382,Ryo Suzuki,"Ryo Suzuki, Ryosuke Nakayama, Dan Liu, Yasuaki Kakehi, Mark D. Gross,
  Daniel Leithinger","LiftTiles: Constructive Building Blocks for Prototyping Room-scale
  Shape-changing Interfaces",TEI 2020,,10.1145/3374920.3374941,,cs.HC cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Large-scale shape-changing interfaces have great potential, but creating such
systems requires substantial time, cost, space, and efforts, which hinders the
research community to explore interactions beyond the scale of human hands. We
introduce modular inflatable actuators as building blocks for prototyping
room-scale shape-changing interfaces. Each actuator can change its height from
15cm to 150cm, actuated and controlled by air pressure. Each unit is low-cost
(8 USD), lightweight (10 kg), compact (15 cm), and robust, making it
well-suited for prototyping room-scale shape transformations. Moreover, our
modular and reconfigurable design allows researchers and designers to quickly
construct different geometries and to explore various applications. This paper
contributes to the design and implementation of highly extendable inflatable
actuators, and demonstrates a range of scenarios that can leverage this modular
building block.
","[{'version': 'v1', 'created': 'Wed, 8 Jan 2020 05:23:32 GMT'}]",2020-01-09,"[['Suzuki', 'Ryo', ''], ['Nakayama', 'Ryosuke', ''], ['Liu', 'Dan', ''], ['Kakehi', 'Yasuaki', ''], ['Gross', 'Mark D.', ''], ['Leithinger', 'Daniel', '']]","['inflatables', 'shape-changing interfaces', 'large-scale interactions']"
6616,2002.11049,Zhe Yu,"Zhe Yu, Fahmid Morshed Fahid, Huy Tu, Tim Menzies","Identifying Self-Admitted Technical Debts with Jitterbug: A Two-step
  Approach","14 pages, 3 pages for appendix, 6+3 figures, 10 tables. Accepted by
  TSE journal",,10.1109/TSE.2020.3031401,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Keeping track of and managing Self-Admitted Technical Debts (SATDs) are
important to maintaining a healthy software project. This requires much time
and effort from human experts to identify the SATDs manually. The current
automated solutions do not have satisfactory precision and recall in
identifying SATDs to fully automate the process. To solve the above problems,
we propose a two-step framework called Jitterbug for identifying SATDs.
Jitterbug first identifies the ""easy to find"" SATDs automatically with close to
100% precision using a novel pattern recognition technique. Subsequently,
machine learning techniques are applied to assist human experts in manually
identifying the remaining ""hard to find"" SATDs with reduced human effort. Our
simulation studies on ten software projects show that Jitterbug can identify
SATDs more efficiently (with less human effort) than the prior state-of-the-art
methods.
","[{'version': 'v1', 'created': 'Tue, 25 Feb 2020 17:20:05 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Jun 2020 23:18:26 GMT'}, {'version': 'v3', 'created': 'Sat, 17 Oct 2020 00:13:06 GMT'}]",2020-10-20,"[['Yu', 'Zhe', ''], ['Fahid', 'Fahmid Morshed', ''], ['Tu', 'Huy', ''], ['Menzies', 'Tim', '']]","['like “hack', 'fixme', 'probably a bug”', 'then ithas a high chance of being related to a SATD']"
6617,1710.08557,Francisco Valero-Cuevas,Francisco J Valero-Cuevas and Marco Santello,"On Neuromechanical Approaches for the Study of Biological Grasp and
  Manipulation",,"Journal of NeuroEngineering and Rehabilitation, 2017",10.1186/s12984-017-0305-3,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Biological and robotic grasp and manipulation are undeniably similar at the
level of mechanical task performance. However, their underlying fundamental
biological vs. engineering mechanisms are, by definition, dramatically
different and can even be antithetical. Even our approach to each is
diametrically opposite: inductive science for the study of biological systems
vs. engineering synthesis for the design and construction of robotic systems.
The past 20 years have seen several conceptual advances in both fields and the
quest to unify them. Chief among them is the reluctant recognition that their
underlying fundamental mechanisms may actually share limited common ground,
while exhibiting many fundamental differences. This recognition is particularly
liberating because it allows us to resolve and move beyond multiple paradoxes
and contradictions that arose from the initial reasonable assumption of a large
common ground. Here, we begin by introducing the perspective of neuromechanics,
which emphasizes that real-world behavior emerges from the intimate
interactions among the physical structure of the system, the mechanical
requirements of a task, the feasible neural control actions to produce it, and
the ability of the neuromuscular system to adapt through interactions with the
environment. This allows us to articulate a succinct overview of a few salient
conceptual paradoxes and contradictions regarding under-determined vs.
over-determined mechanics, under- vs. over-actuated control, prescribed vs.
emergent function, learning vs. implementation vs. adaptation, prescriptive vs.
descriptive synergies, and optimal vs. habitual performance. We conclude by
presenting open questions and suggesting directions for future research. We
hope this frank assessment of the state-of-the-art will encourage and guide
these communities to continue to interact and make progress in these important
areas.
","[{'version': 'v1', 'created': 'Tue, 24 Oct 2017 00:21:32 GMT'}]",2017-10-25,"[['Valero-Cuevas', 'Francisco J', ''], ['Santello', 'Marco', '']]","['Neuromuscular control', 'Hand', 'Prosthetics']"
6618,1906.07841,Lamya Abdullah,"Lamya Abdullah, Felix Freiling, Juan Quintero and Zinaida Benenson","Sealed Computation: Abstract Requirements for Mechanisms to Support
  Trustworthy Cloud Computing",,,10.1007/978-3-030-12786-2_9,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In cloud computing, data processing is delegated to a remote party for
efficiency and flexibility reasons. A practical user requirement usually is
that the confidentiality and integrity of data processing needs to be
protected. In the common scenarios of cloud computing today, this can only be
achieved by assuming that the remote party does not in any form act
maliciously. In this paper, we propose an approach that avoids having to trust
a single entity. Our approach is based on two concepts: (1) the technical
abstraction of sealed computation, i.e., a technical mechanism to confine the
processing of data within a tamper-proof hardware container, and (2) the
additional role of an auditing party that itself cannot add functionality to
the system but is able to check whether the system (including the mechanism for
sealed computation) works as expected. We discuss the abstract technical and
procedural requirements of these concepts and explain how they can be applied
in practice.
","[{'version': 'v1', 'created': 'Tue, 18 Jun 2019 23:20:26 GMT'}]",2019-06-20,"[['Abdullah', 'Lamya', ''], ['Freiling', 'Felix', ''], ['Quintero', 'Juan', ''], ['Benenson', 'Zinaida', '']]","['security requirements', 'trusted computing', 'trustworthy computing', 'cloud computing', 'cloud service', 'auditor']"
6619,2006.11183,Hacer Yalim Keles,"Anil Osman Tur, Hacer Yalim Keles","Evaluation Of Hidden Markov Models Using Deep CNN Features In Isolated
  Sign Recognition","This paper is the preprint of the accepted manuscript at Multimedia
  Tools and Applications Journal. It contains 16 pages, 5 figure, 8 tables",,10.1007/s11042-021-10593-w,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Isolated sign recognition from video streams is a challenging problem due to
the multi-modal nature of the signs, where both local and global hand features
and face gestures needs to be attended simultaneously. This problem has
recently been studied widely using deep Convolutional Neural Network (CNN)
based features and Long Short-Term Memory (LSTM) based deep sequence models.
However, the current literature is lack of providing empirical analysis using
Hidden Markov Models (HMMs) with deep features. In this study, we provide a
framework that is composed of three modules to solve isolated sign recognition
problem using different sequence models. The dimensions of deep features are
usually too large to work with HMM models. To solve this problem, we propose
two alternative CNN based architectures as the second module in our framework,
to reduce deep feature dimensions effectively. After extensive experiments, we
show that using pretrained Resnet50 features and one of our CNN based dimension
reduction models, HMMs can classify isolated signs with 90.15% accuracy in
Montalbano dataset using RGB and Skeletal data. This performance is comparable
with the current LSTM based models. HMMs have fewer parameters and can be
trained and run on commodity computers fast, without requiring GPUs. Therefore,
our analysis with deep features show that HMMs could also be utilized as well
as deep sequence models in challenging isolated sign recognition problem.
","[{'version': 'v1', 'created': 'Fri, 19 Jun 2020 15:18:03 GMT'}, {'version': 'v2', 'created': 'Mon, 10 May 2021 13:24:33 GMT'}]",2021-05-11,"[['Tur', 'Anil Osman', ''], ['Keles', 'Hacer Yalim', '']]","['Isolated Sign Recognition', 'Gesture Recognition', 'CNN', 'LSTM', 'HMM', 'GMM-HMM', 'Deep Learning']"
6620,2301.08584,Adolphe B\'equet J,"Adolphe J. Bequet, Antonio R. Hidalgo-Munoz, Fabien Moreau, Joshua
  Quick, Christophe Jallais","Subtle interactions for distress regulation: efficiency of a haptic
  wearable according to personality",,"International Journal of Human-Computer Studies, 168, 102923
  (2022)",10.1016/j.ijhcs.2022.102923,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The incorporation of empathic systems in everyday life draws a lot of
attention from society. Specifically, the use of wearables to perform stress
regulation is a growing field of research. Among techniques explored, the
haptic emulation of lowered physiological signals has been suggested to be
promising. However, some discrepancies remain in empirical research focusing on
such biofeedback (BF) regarding their efficacy, and the mechanisms underlying
the effects of these wearables remains unclear. Moreover, the influence of
individual traits on the efficiency of BF has been marginally studied, while it
has been shown that personality could impact both stress and its regulation.
The aim of this study is to investigate the outcome of interactions with these
technologies from a psycho-physiological standpoint, but also to explore
whether personality may influence its efficiency when other interaction devices
are present. Participants had to play a challenging game while a lowered haptic
BF of their heart rate was induced on their wrist. Results showed variable
efficiency of the wearable among the participants: a subjective relaxation was
evident for the participants exhibiting the highest neurotic and extraverted
traits score. Our results highlight the plurality of the modes of action of
these techniques, depending on the individual and on the level of stress to
regulate. This study also suggests that tailoring these regulation methods to
individual characteristics, such as personality traits, is important to
consider, and proposes perspectives regarding the investigation of stress and
regulation systems embedded in wearables.
","[{'version': 'v1', 'created': 'Fri, 20 Jan 2023 13:59:43 GMT'}]",2023-01-23,"[['Bequet', 'Adolphe J.', ''], ['Hidalgo-Munoz', 'Antonio R.', ''], ['Moreau', 'Fabien', ''], ['Quick', 'Joshua', ''], ['Jallais', 'Christophe', '']]","['Mindless Computing', 'Stress Regulation', 'Real-time Biofeedback', 'Personality Traits']"
6621,1907.04629,Thijs Laarhoven,Thijs Laarhoven,Evolutionary techniques in lattice sieving algorithms,"9 pages, 2 figures","11th International Conference on Evolutionary Computation Theory
  and Applications (ECTA), pp. 31-39, 2019",10.5220/0007968800310039,,cs.DS cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lattice-based cryptography has recently emerged as a prominent candidate for
secure communication in the quantum age. Its security relies on the hardness of
certain lattice problems, and the inability of known lattice algorithms, such
as lattice sieving, to solve these problems efficiently. In this paper we
investigate the similarities between lattice sieving and evolutionary
algorithms, how various improvements to lattice sieving can be viewed as
applications of known techniques from evolutionary computation, and how other
evolutionary techniques can benefit lattice sieving in practice.
","[{'version': 'v1', 'created': 'Wed, 10 Jul 2019 11:38:33 GMT'}]",2019-10-04,"[['Laarhoven', 'Thijs', '']]","['Evolutionary Algorithms', 'Applications', 'Cryptography', 'Lattice Sieving']"
6622,2004.11083,Mohammed Belkhatir,"Bhawani Selvaretnam, Mohammed Belkhatir","Coupled intrinsic and extrinsic human language resource-based query
  expansion",,Knowledge & Information Systems 2018,10.1007/s10115-018-1267-x,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Poor information retrieval performance has often been attributed to the
query-document vocabulary mismatch problem which is defined as the difficulty
for human users to formulate precise natural language queries that are in line
with the vocabulary of the documents deemed relevant to a specific search goal.
To alleviate this problem, query expansion processes are applied in order to
spawn and integrate additional terms to an initial query. This requires
accurate identification of main query concepts to ensure the intended search
goal is duly emphasized and relevant expansion concepts are extracted and
included in the enriched query. Natural language queries have intrinsic
linguistic properties such as parts-of-speech labels and grammatical relations
which can be utilized in determining the intended search goal. Additionally,
extrinsic language-based resources such as ontologies are needed to suggest
expansion concepts semantically coherent with the query content. We present
here a query expansion framework which capitalizes on both linguistic
characteristics of user queries and ontology resources for query constituent
encoding, expansion concept extraction and concept weighting. A thorough
empirical evaluation on real-world datasets validates our approach against
unigram language model, relevance model and a sequential dependence based
technique.
","[{'version': 'v1', 'created': 'Thu, 23 Apr 2020 11:22:38 GMT'}]",2020-04-24,"[['Selvaretnam', 'Bhawani', ''], ['Belkhatir', 'Mohammed', '']]","['Query Expansion', 'Human Language Processing', 'Concept-based Query Segmentation', 'Ontology Processing', 'Concept Weighting']"
6623,2103.12162,Hamid Sarmadi,"Hamid Sarmadi, Rafael Mu\~noz-Salinas, M.\'Alvaro Berb\'is, Antonio
  Luna, Rafael Medina-Carnicer","3D Reconstruction and Alignment by Consumer RGB-D Sensors and Fiducial
  Planar Markers for Patient Positioning in Radiation Therapy","11 pages, 5 figures",,10.1016/j.cmpb.2019.105004,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  BACKGROUND AND OBJECTIVE: Patient positioning is a crucial step in radiation
therapy, for which non-invasive methods have been developed based on surface
reconstruction using optical 3D imaging. However, most solutions need expensive
specialized hardware and a careful calibration procedure that must be repeated
over time.This paper proposes a fast and cheap patient positioning method based
on inexpensive consumer level RGB-D sensors.
  METHODS: The proposed method relies on a 3D reconstruction approach that
fuses, in real-time, artificial and natural visual landmarks recorded from a
hand-held RGB-D sensor. The video sequence is transformed into a set of
keyframes with known poses, that are later refined to obtain a realistic 3D
reconstruction of the patient. The use of artificial landmarks allows our
method to automatically align the reconstruction to a reference one, without
the need of calibrating the system with respect to the linear accelerator
coordinate system.
  RESULTS:The experiments conducted show that our method obtains a median of 1
cm in translational error, and 1 degree of rotational error with respect to
reference pose. Additionally, the proposed method shows as visual output
overlayed poses (from the reference and the current scene) and an error map
that can be used to correct the patient's current pose to match the reference
pose.
  CONCLUSIONS: A novel approach to obtain 3D body reconstructions for patient
positioning without requiring expensive hardware or dedicated graphic cards is
proposed. The method can be used to align in real time the patient's current
pose to a preview pose, which is a relevant step in radiation therapy.
","[{'version': 'v1', 'created': 'Mon, 22 Mar 2021 20:20:59 GMT'}]",2021-03-24,"[['Sarmadi', 'Hamid', ''], ['Muñoz-Salinas', 'Rafael', ''], ['Berbís', 'M. Álvaro', ''], ['Luna', 'Antonio', ''], ['Medina-Carnicer', 'Rafael', '']]","['Patient Positioning', '3D reconstructions', 'RGB-D Sensors', 'Fiducial Markers', 'Radiation Therapy', 'SurfaceGuided Radiation Therapy (SGRT)']"
6624,2109.08029,Ander Salaberria,"Ander Salaberria, Gorka Azkune, Oier Lopez de Lacalle, Aitor Soroa,
  Eneko Agirre","Image Captioning for Effective Use of Language Models in Knowledge-Based
  Visual Question Answering",Under review. 25 pages with 4 figures,"Expert Systems with Applications, Volume 212, 2023, 118669",10.1016/j.eswa.2022.118669,,cs.CV cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Integrating outside knowledge for reasoning in visio-linguistic tasks such as
visual question answering (VQA) is an open problem. Given that pretrained
language models have been shown to include world knowledge, we propose to use a
unimodal (text-only) train and inference procedure based on automatic
off-the-shelf captioning of images and pretrained language models. Our results
on a visual question answering task which requires external knowledge (OK-VQA)
show that our text-only model outperforms pretrained multimodal (image-text)
models of comparable number of parameters. In contrast, our model is less
effective in a standard VQA task (VQA 2.0) confirming that our text-only method
is specially effective for tasks requiring external knowledge. In addition, we
show that increasing the language model's size improves notably its
performance, yielding results comparable to the state-of-the-art with our
largest model, significantly outperforming current multimodal systems, even
though augmented with external knowledge. Our qualitative analysis on OK-VQA
reveals that automatic captions often fail to capture relevant information in
the images, which seems to be balanced by the better inference ability of the
text-only language models. Our work opens up possibilities to further improve
inference in visio-linguistic tasks
","[{'version': 'v1', 'created': 'Wed, 15 Sep 2021 14:11:29 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Oct 2021 10:46:34 GMT'}, {'version': 'v3', 'created': 'Fri, 25 Mar 2022 08:11:17 GMT'}]",2022-09-14,"[['Salaberria', 'Ander', ''], ['Azkune', 'Gorka', ''], ['de Lacalle', 'Oier Lopez', ''], ['Soroa', 'Aitor', ''], ['Agirre', 'Eneko', '']]","['Visual Question Answering', 'Image Captioning', 'Language Models', 'Deep learning']"
6625,2202.03865,Cristian Alb,Cristian Alb,Backtrack Tie-Breaking for Decision Trees: A Note on Deodata Predictors,,,10.13140/RG.2.2.13630.61763,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  A tie-breaking method is proposed for choosing the predicted class, or
outcome, in a decision tree. The method is an adaptation of a similar technique
used for deodata predictors.
","[{'version': 'v1', 'created': 'Sat, 5 Feb 2022 22:06:56 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Feb 2022 14:29:08 GMT'}]",2022-02-10,"[['Alb', 'Cristian', '']]","['classifier', 'decision tree', 'tie-breaking']"
6626,2104.07959,Joachim Pedersen,Joachim Winther Pedersen and Sebastian Risi,"Evolving and Merging Hebbian Learning Rules: Increasing Generalization
  by Decreasing the Number of Rules",,,10.1145/3449639.3459317,,cs.NE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Generalization to out-of-distribution (OOD) circumstances after training
remains a challenge for artificial agents. To improve the robustness displayed
by plastic Hebbian neural networks, we evolve a set of Hebbian learning rules,
where multiple connections are assigned to a single rule. Inspired by the
biological phenomenon of the genomic bottleneck, we show that by allowing
multiple connections in the network to share the same local learning rule, it
is possible to drastically reduce the number of trainable parameters, while
obtaining a more robust agent. During evolution, by iteratively using simple
K-Means clustering to combine rules, our Evolve and Merge approach is able to
reduce the number of trainable parameters from 61,440 to 1,920, while at the
same time improving robustness, all without increasing the number of
generations used. While optimization of the agents is done on a standard
quadruped robot morphology, we evaluate the agents' performances on slight
morphology modifications in a total of 30 unseen morphologies. Our results add
to the discussion on generalization, overfitting and OOD adaptation. To create
agents that can adapt to a wider array of unexpected situations, Hebbian
learning combined with a regularising ""genomic bottleneck"" could be a promising
research direction.
","[{'version': 'v1', 'created': 'Fri, 16 Apr 2021 08:24:19 GMT'}]",2021-04-19,"[['Pedersen', 'Joachim Winther', ''], ['Risi', 'Sebastian', '']]","['Plastic neural networks', 'local learning', 'indirect encoding', 'generalization']"
6627,2012.01690,Heming Yao,"Heming Yao, Ryan W. Stidham, Zijun Gao, Jonathan Gryak, Kayvan
  Najarian",Motion-based Camera Localization System in Colonoscopy Videos,,Medical image analysis. 2021 Oct 1;73:102180,10.1016/j.media.2021.102180,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optical colonoscopy is an essential diagnostic and prognostic tool for many
gastrointestinal diseases, including cancer screening and staging, intestinal
bleeding, diarrhea, abdominal symptom evaluation, and inflammatory bowel
disease assessment. Automated assessment of colonoscopy is of interest
considering the subjectivity present in qualitative human interpretations of
colonoscopy findings. Localization of the camera is essential to interpreting
the meaning and context of findings for diseases evaluated by colonoscopy. In
this study, we propose a camera localization system to estimate the relative
location of the camera and classify the colon into anatomical segments. The
camera localization system begins with non-informative frame detection and
removal. Then a self-training end-to-end convolutional neural network is built
to estimate the camera motion, where several strategies are proposed to improve
its robustness and generalization on endoscopic videos. Using the estimated
camera motion a camera trajectory can be derived and a relative location index
calculated. Based on the estimated location index, anatomical colon segment
classification is performed by constructing a colon template. The proposed
motion estimation algorithm was evaluated on an external dataset containing the
ground truth for camera pose. The experimental results show that the
performance of the proposed method is superior to other published methods. The
relative location index estimation and anatomical region classification were
further validated using colonoscopy videos collected from routine clinical
practice. This validation yielded an average accuracy in classification of
0.754, which is substantially higher than the performances obtained using
location indices built from other methods.
","[{'version': 'v1', 'created': 'Thu, 3 Dec 2020 03:57:12 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Dec 2020 02:59:32 GMT'}, {'version': 'v3', 'created': 'Thu, 11 Feb 2021 20:09:22 GMT'}]",2021-12-10,"[['Yao', 'Heming', ''], ['Stidham', 'Ryan W.', ''], ['Gao', 'Zijun', ''], ['Gryak', 'Jonathan', ''], ['Najarian', 'Kayvan', '']]","['Colonoscopy Video Analysis', 'Camera Motion Estimation', 'Endoscopy', 'Localization']"
6628,2111.10646,Yoichi Yamazaki,"Yoichi Yamazaki, Masayuki Ishii, Takahiro Ito, and Takuya Hashimoto","Frailty Care Robot for Elderly and Its Application for Physical and
  Psychological Support","9 pages, 15 figures, J. Adv. Comput. Intell. Intell. Inform.(JACIII)","J. Adv. Comput. Intell. Intell. Inform., Vol.25, No.6, pp.
  944-952, 2021",10.20965/jaciii.2021.p0944,,cs.RO cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  To achieve continuous frail care in the daily lives of the elderly, we
propose AHOBO, a frail care robot for the elderly at home. Two types of support
systems by AHOBO were implemented to support the elderly in both physical
health and psychological aspects. For physical health frailty care, we focused
on blood pressure and developed a support system for blood pressure measurement
with AHOBO. For psychological frailty care, we implemented reminiscent coloring
with the AHOBO as a recreational activity with the robot. The usability of the
system was evaluated based on the assumption of continuous use in daily life.
For the support system in blood pressure measurement, we performed a
qualitative evaluation using a questionnaire for 16 subjects, including elderly
people under blood pressure measurement by the system. The results confirmed
that the proposed robot does not affect the blood pressure readings and is
acceptable in terms of ease of use based on subjective evaluation. For the
reminiscent coloring interaction, a subjective evaluation was conducted on two
elderly people under the verbal fluency task, and it has been confirmed that
the interaction can be used continuously in daily life. The widespread use of
the proposed robot as an interface for AI that supports daily life will lead to
a society in which AI robots support people from the cradle to the grave.
","[{'version': 'v1', 'created': 'Sat, 20 Nov 2021 17:57:20 GMT'}]",2021-11-23,"[['Yamazaki', 'Yoichi', ''], ['Ishii', 'Masayuki', ''], ['Ito', 'Takahiro', ''], ['Hashimoto', 'Takuya', '']]","['frailty care', 'healthcare and medical application', 'human robot interaction', 'elderly support', 'blood pressure']"
6629,1905.01520,Abhishek Ghose,"Abhishek Ghose, Balaraman Ravindran",Interpretability with Accurate Small Models,"The presentation of the method was changed. Results are averaged over
  multiple runs for reliability. Core ideas, experiments and ideas are same as
  the previous version","Frontiers in Artificial Intelligence, 3 (2020), 3",10.3389/frai.2020.00003,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Models often need to be constrained to a certain size for them to be
considered interpretable. For example, a decision tree of depth 5 is much
easier to understand than one of depth 50. Limiting model size, however, often
reduces accuracy. We suggest a practical technique that minimizes this
trade-off between interpretability and classification accuracy. This enables an
arbitrary learning algorithm to produce highly accurate small-sized models. Our
technique identifies the training data distribution to learn from that leads to
the highest accuracy for a model of a given size.
  We represent the training distribution as a combination of sampling schemes.
Each scheme is defined by a parameterized probability mass function applied to
the segmentation produced by a decision tree. An Infinite Mixture Model with
Beta components is used to represent a combination of such schemes. The mixture
model parameters are learned using Bayesian Optimization. Under simplistic
assumptions, we would need to optimize for $O(d)$ variables for a distribution
over a $d$-dimensional input space, which is cumbersome for most real-world
data. However, we show that our technique significantly reduces this number to
a \emph{fixed set of eight variables} at the cost of relatively cheap
preprocessing. The proposed technique is flexible: it is \emph{model-agnostic},
i.e., it may be applied to the learning algorithm for any model family, and it
admits a general notion of model size. We demonstrate its effectiveness using
multiple real-world datasets to construct decision trees, linear probability
models and gradient boosted models with different sizes. We observe significant
improvements in the F1-score in most instances, exceeding an improvement of
$100\%$ in some cases.
","[{'version': 'v1', 'created': 'Sat, 4 May 2019 16:43:07 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Oct 2019 23:51:21 GMT'}]",2020-07-02,"[['Ghose', 'Abhishek', ''], ['Ravindran', 'Balaraman', '']]","['ML', 'interpretable machine learning', 'bayesian optimization', 'infinite mixture models', 'density estimation']"
6630,2301.04937,Gennaro Vessio Dr.,"Giovanna Castellano, Eugenio Cotardo, Corrado Mencar, Gennaro Vessio","Density-based clustering with fully-convolutional networks for crowd
  flow detection from drones",Accepted manuscript,Neurocomputing (2023),10.1016/j.neucom.2023.01.059,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Crowd analysis from drones has attracted increasing attention in recent times
due to the ease of use and affordable cost of these devices. However, how this
technology can provide a solution to crowd flow detection is still an
unexplored research question. To this end, we propose a crowd flow detection
method for video sequences shot by a drone. The method is based on a
fully-convolutional network that learns to perform crowd clustering in order to
detect the centroids of crowd-dense areas and track their movement in
consecutive frames. The proposed method proved effective and efficient when
tested on the Crowd Counting datasets of the VisDrone challenge, characterized
by video sequences rather than still images. The encouraging results show that
the proposed method could open up new ways of analyzing high-level crowd
behavior from drones.
","[{'version': 'v1', 'created': 'Thu, 12 Jan 2023 11:10:42 GMT'}]",2023-01-13,"[['Castellano', 'Giovanna', ''], ['Cotardo', 'Eugenio', ''], ['Mencar', 'Corrado', ''], ['Vessio', 'Gennaro', '']]","['drones', 'drone vision', 'computer vision', 'deep learning', 'crowdflow detection', 'crowd density estimation', 'clustering']"
6631,1806.07181,Andrew Adamatzky,"Claire Fullarton, Thomas C. Draper, Neil Phillips, Ben P. J. de Lacy
  Costello, Andrew Adamatzky",Belousov-Zhabotinsky reaction in liquid marbles,,"J. Phys. Mater., 2019, 2, 015005",10.1088/2515-7639/aaed4c,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper reports on a new method of encapsulating BZ solution droplets in a
powder coating of either polyethylene (PE) or polytetrafluoroethylene (PTFE),
to produce BZ liquid marbles (LMs). The BZ LMs have solid--liquid interfaces in
contrast to the previously reported BZ encapsulation systems used to study
pattern formations and wave transfers, such as BZ emulsions and BZ vesicles.
All these systems are important to study as they can be seen as analogues for
information transfer in excitable systems in nature. Due to the powder coating
of the LMs, LMs do not wet the underlying substrate, making the LMs mobile,
enabling them to be easily arranged in arrays. The preparation of complex LMs,
containing an acidic oscillating solution, proves the resilience of LMs and
their application in transporting a wide range of chemical cargoes and in
playing a mediating role in chemical reactions. PTFE-coated LMs were harder to
prepare and not as robust as PE-coated LMs, therefore oscillation studies of BZ
LMs positioned in arrays only focused on PE-coated LMs. Sporadic transfer of
excitation waves was observed between LMs placed in close proximity to each
other in ordered and disordered arrays, suggesting the transfer of liquid
species possibly arises from contact between imperfectly coated areas at the
LM--LM interface or capillary action, where solution is actively transported to
the marble surface through the coating. Propagation pathways of the excitation
waves in both the disordered and ordered arrays of BZ LMs are reported. These
results lay the foundations for future studies on information transmission and
processing arrays of BZ LMs, in addition to observing BZ wave propagation in a
LM and the effect of other physical stimuli such as heat, light and chemical
environments on the dynamics of excitation in arrays of BZ Lms.
","[{'version': 'v1', 'created': 'Tue, 19 Jun 2018 12:31:15 GMT'}]",2019-01-18,"[['Fullarton', 'Claire', ''], ['Draper', 'Thomas C.', ''], ['Phillips', 'Neil', ''], ['Costello', 'Ben P. J. de Lacy', ''], ['Adamatzky', 'Andrew', '']]","['Liquid marbles', 'Belousov-Zhabotinsky (BZ) reaction', 'wave propagation']"
6632,2110.14751,Edson Horta,"Edson Horta, Ho-Ren Chuang, Naarayanan Rao VSathish, Cesar
  Philippidis, Antonio Barbalace, Pierre Olivier, Binoy Ravindran","Xar-Trek: Run-time Execution Migration among FPGAs and Heterogeneous-ISA
  CPUs",,,10.1145/3464298.3493388,,cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Datacenter servers are increasingly heterogeneous: from x86 host CPUs, to ARM
or RISC-V CPUs in NICs/SSDs, to FPGAs. Previous works have demonstrated that
migrating application execution at run-time across heterogeneous-ISA CPUs can
yield significant performance and energy gains, with relatively little
programmer effort. However, FPGAs have often been overlooked in that context:
hardware acceleration using FPGAs involves statically implementing select
application functions, which prohibits dynamic and transparent migration. We
present Xar-Trek, a new compiler and run-time software framework that overcomes
this limitation. Xar-Trek compiles an application for several CPU ISAs and
select application functions for acceleration on an FPGA, allowing execution
migration between heterogeneous-ISA CPUs and FPGAs at run-time. Xar-Trek's
run-time monitors server workloads and migrates application functions to an
FPGA or to heterogeneous-ISA CPUs based on a scheduling policy. We develop a
heuristic policy that uses application workload profiles to make scheduling
decisions. Our evaluations conducted on a system with x86-64 server CPUs, ARM64
server CPUs, and an Alveo accelerator card reveal 88%-1% performance gains over
no-migration baselines.
","[{'version': 'v1', 'created': 'Wed, 27 Oct 2021 20:23:31 GMT'}]",2021-10-29,"[['Horta', 'Edson', ''], ['Chuang', 'Ho-Ren', ''], ['VSathish', 'Naarayanan Rao', ''], ['Philippidis', 'Cesar', ''], ['Barbalace', 'Antonio', ''], ['Olivier', 'Pierre', ''], ['Ravindran', 'Binoy', '']]","['FPGAs', 'reconfigurable computing', 'hardware accelerator', 'heterogeneous-ISA', 'datacenters', 'execution migration']"
6633,2107.06925,Shigang Li,"Shigang Li, Torsten Hoefler","Chimera: Efficiently Training Large-Scale Neural Networks with
  Bidirectional Pipelines","Published in Proceedings of the 2021 International Conference for
  High Performance Computing, Networking, Storage and Analysis (SC'21),
  November 2021, Article No.: 27, Pages 1-14. Best Paper Finalist",,10.1145/3458817.3476145,,cs.DC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Training large deep learning models at scale is very challenging. This paper
proposes Chimera, a novel pipeline parallelism scheme which combines
bidirectional pipelines for efficiently training large-scale models. Chimera is
a synchronous approach and therefore no loss of accuracy, which is more
convergence-friendly than asynchronous approaches. Compared with the latest
synchronous pipeline approach, Chimera reduces the number of bubbles by up to
50%; benefiting from the sophisticated scheduling of bidirectional pipelines,
Chimera has a more balanced activation memory consumption. Evaluations are
conducted on Transformer based language models. For a GPT-2 model with 1.3
billion parameters running on 2,048 GPU nodes of the Piz Daint supercomputer,
Chimera improves the training throughput by 1.16x-2.34x over the
state-of-the-art synchronous and asynchronous pipeline approaches.
","[{'version': 'v1', 'created': 'Wed, 14 Jul 2021 18:16:20 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Nov 2021 14:32:19 GMT'}, {'version': 'v3', 'created': 'Fri, 25 Feb 2022 10:49:12 GMT'}]",2022-02-28,"[['Li', 'Shigang', ''], ['Hoefler', 'Torsten', '']]","['distributed deep learning', 'pipeline parallelism', 'data parallelism', 'operator parallelism', 'model parallelism']"
6634,2206.12690,Fupeng Sun,"Fupeng Sun, Yin Ni, Yihao Luo, Huafei Sun",ECG Classification based on Wasserstein Scalar Curvature,,,10.3390/e24101450,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Electrocardiograms (ECG) analysis is one of the most important ways to
diagnose heart disease. This paper proposes an efficient ECG classification
method based on Wasserstein scalar curvature to comprehend the connection
between heart disease and mathematical characteristics of ECG. The newly
proposed method converts an ECG into a point cloud on the family of Gaussian
distribution, where the pathological characteristics of ECG will be extracted
by the Wasserstein geometric structure of the statistical manifold.
Technically, this paper defines the histogram dispersion of Wasserstein scalar
curvature, which can accurately describe the divergence between different heart
diseases. By combining medical experience with mathematical ideas from geometry
and data science, this paper provides a feasible algorithm for the new method,
and the theoretical analysis of the algorithm is carried out. Digital
experiments on the classical database with large samples show the new
algorithm's accuracy and efficiency when dealing with the classification of
heart disease.
","[{'version': 'v1', 'created': 'Sat, 25 Jun 2022 16:40:27 GMT'}]",2022-10-26,"[['Sun', 'Fupeng', ''], ['Ni', 'Yin', ''], ['Luo', 'Yihao', ''], ['Sun', 'Huafei', '']]","['ECG Classification', 'Positive definite symmetric matrix manifold', 'Wasserstein']"
6635,2001.00858,Lucas Assun\c{c}\~ao,Lucas Assun\c{c}\~ao and Geraldo Robson Mateus,A cutting-plane algorithm for the Steiner team orienteering problem,,"Computers & Industrial Engineering, Volume 135, September 2019,
  Pages 922-939",10.1016/j.cie.2019.06.051,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Team Orienteering Problem (TOP) is an NP-hard routing problem in which a
fleet of identical vehicles aims at collecting rewards (prizes) available at
given locations, while satisfying restrictions on the travel times. In TOP,
each location can be visited by at most one vehicle, and the goal is to
maximize the total sum of rewards collected by the vehicles within a given time
limit. In this paper, we propose a generalization of TOP, namely the Steiner
Team Orienteering Problem (STOP). In STOP, we provide, additionally, a subset
of mandatory locations. In this sense, STOP also aims at maximizing the total
sum of rewards collected within the time limit, but, now, every mandatory
location must be visited. In this work, we propose a new commodity-based
formulation for STOP and use it within a cutting-plane scheme. The algorithm
benefits from the compactness and strength of the proposed formulation and
works by separating three families of valid inequalities, which consist of some
general connectivity constraints, classical lifted cover inequalities based on
dual bounds and a class of conflict cuts. To our knowledge, the last class of
inequalities is also introduced in this work. A state-of-the-art branch-and-cut
algorithm from the literature of TOP is adapted to STOP and used as baseline to
evaluate the performance of the cutting-plane. Extensive computational
experiments show the competitiveness of the new algorithm while solving several
STOP and TOP instances. In particular, it is able to solve, in total, 14 more
TOP instances than any other previous exact algorithm and finds eight new
optimality certificates. With respect to the new STOP instances introduced in
this work, our algorithm solves 30 more instances than the baseline.
","[{'version': 'v1', 'created': 'Fri, 3 Jan 2020 15:04:35 GMT'}]",2020-01-06,"[['Assunção', 'Lucas', ''], ['Mateus', 'Geraldo Robson', '']]","['Vehicle routing', 'Orienteering problems', 'Cutting-plane']"
6636,2205.10775,Xinyan Fan,"Xinyan Fan, Jianxun Lian, Wayne Xin Zhao, Zheng Liu, Chaozhuo Li, Xing
  Xie","Ada-Ranker: A Data Distribution Adaptive Ranking Paradigm for Sequential
  Recommendation",12 pages,,10.1145/3477495.3531931,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A large-scale recommender system usually consists of recall and ranking
modules. The goal of ranking modules (aka rankers) is to elaborately
discriminate users' preference on item candidates proposed by recall modules.
With the success of deep learning techniques in various domains, we have
witnessed the mainstream rankers evolve from traditional models to deep neural
models. However, the way that we design and use rankers remains unchanged:
offline training the model, freezing the parameters, and deploying it for
online serving. Actually, the candidate items are determined by specific user
requests, in which underlying distributions (e.g., the proportion of items for
different categories, the proportion of popular or new items) are highly
different from one another in a production environment. The classical
parameter-frozen inference manner cannot adapt to dynamic serving
circumstances, making rankers' performance compromised. In this paper, we
propose a new training and inference paradigm, termed as Ada-Ranker, to address
the challenges of dynamic online serving. Instead of using parameter-frozen
models for universal serving, Ada-Ranker can adaptively modulate parameters of
a ranker according to the data distribution of the current group of item
candidates. We first extract distribution patterns from the item candidates.
Then, we modulate the ranker by the patterns to make the ranker adapt to the
current data distribution. Finally, we use the revised ranker to score the
candidate list. In this way, we empower the ranker with the capacity of
adapting from a global model to a local model which better handles the current
task.
","[{'version': 'v1', 'created': 'Sun, 22 May 2022 08:44:26 GMT'}]",2022-05-24,"[['Fan', 'Xinyan', ''], ['Lian', 'Jianxun', ''], ['Zhao', 'Wayne Xin', ''], ['Liu', 'Zheng', ''], ['Li', 'Chaozhuo', ''], ['Xie', 'Xing', '']]","['Model Adaptation', 'Sequential Recommendation', 'Dynamic Ranking']"
6637,1907.02889,A\'ecio Solano Rodrigues Santos,"A\'ecio Santos, Sonia Castelo, Cristian Felix, Jorge Piazentin Ono,
  Bowen Yu, Sungsoo Hong, Cl\'audio T. Silva, Enrico Bertini, Juliana Freire","Visus: An Interactive System for Automatic Machine Learning Model
  Building and Curation","Accepted for publication in the 2019 Workshop on Human-In-the-Loop
  Data Analytics (HILDA'19), co-located with SIGMOD 2019",,10.1145/3328519.3329134,,cs.LG cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While the demand for machine learning (ML) applications is booming, there is
a scarcity of data scientists capable of building such models. Automatic
machine learning (AutoML) approaches have been proposed that help with this
problem by synthesizing end-to-end ML data processing pipelines. However, these
follow a best-effort approach and a user in the loop is necessary to curate and
refine the derived pipelines. Since domain experts often have little or no
expertise in machine learning, easy-to-use interactive interfaces that guide
them throughout the model building process are necessary. In this paper, we
present Visus, a system designed to support the model building process and
curation of ML data processing pipelines generated by AutoML systems. We
describe the framework used to ground our design choices and a usage scenario
enabled by Visus. Finally, we discuss the feedback received in user testing
sessions with domain experts.
","[{'version': 'v1', 'created': 'Fri, 5 Jul 2019 15:21:51 GMT'}]",2019-07-08,"[['Santos', 'Aécio', ''], ['Castelo', 'Sonia', ''], ['Felix', 'Cristian', ''], ['Ono', 'Jorge Piazentin', ''], ['Yu', 'Bowen', ''], ['Hong', 'Sungsoo', ''], ['Silva', 'Cláudio T.', ''], ['Bertini', 'Enrico', ''], ['Freire', 'Juliana', '']]","['Data analytics', 'Data visualization', 'Automatic machine learning']"
6638,1802.04090,Christos Katsanos,"Alexandros Liapis, Christos Katsanos, Michalis Xenos","Don't Leave Me Alone: Retrospective Think Aloud supported by Real-time
  Monitoring of Participant's Physiology","International Conference on Human-Computer Interaction (HCII), 11
  pages, 3 figures",,10.1007/978-3-319-91238-7_10,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Think aloud protocols are widely applied in user experience studies. In this
paper, the effect of two different applications of the Retrospective Think
Aloud (RTA) protocol on the number of user-reported usability issues is
examined. To this end, 30 users were asked to use the National Cadastre and
Mapping Agency web application and complete a set of tasks, such as measuring
the land area of a square in their hometown. The order of tasks was randomized
per participant. Next, participants were involved in RTA sessions. Each
participant was involved in two different RTA modes: (a) the strict guidance,
in which the facilitator stayed in the background and prompted participants to
keep thinking aloud based on his judgement and experience, and (b) the
physiology-supported interventions, in which the facilitator intervened based
on real-time monitoring of user's physiological signals. During each session,
three participant's physiological signals were recorded: skin conductance, skin
temperature and blood volume pulse. Participants were also asked to provide
valence-arousal ratings for each self-reported usability issue. Analysis of the
collected data showed that participants in the physiology-supported RTA mode
reported significantly more usability issues. No significant effect of the RTA
mode was found on the va-lence-arousal ratings for the reported usability
issues. Participants' physiological signals during the RTA sessions did not
also differ significantly between the two modes.
","[{'version': 'v1', 'created': 'Mon, 12 Feb 2018 14:58:52 GMT'}]",2019-03-21,"[['Liapis', 'Alexandros', ''], ['Katsanos', 'Christos', ''], ['Xenos', 'Michalis', '']]","['Human-computer interaction', 'physiological signals', 'usability evaluation', 'retrospective think aloud']"
6639,2203.16738,"Rosa Gonz\'alez Hautam\""aki PhD","Lauri Tavi, Tomi Kinnunen, Rosa Gonz\'alez Hautam\""aki","Improving speaker de-identification with functional data analysis of f0
  trajectories",Accepted to Speech Communication. March 2022,,10.1016/j.specom.2022.03.010,,cs.SD cs.CL eess.AS,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Due to a constantly increasing amount of speech data that is stored in
different types of databases, voice privacy has become a major concern. To
respond to such concern, speech researchers have developed various methods for
speaker de-identification. The state-of-the-art solutions utilize deep learning
solutions which can be effective but might be unavailable or impractical to
apply for, for example, under-resourced languages. Formant modification is a
simpler, yet effective method for speaker de-identification which requires no
training data. Still, remaining intonational patterns in formant-anonymized
speech may contain speaker-dependent cues. This study introduces a novel
speaker de-identification method, which, in addition to simple formant shifts,
manipulates f0 trajectories based on functional data analysis. The proposed
speaker de-identification method will conceal plausibly identifying pitch
characteristics in a phonetically controllable manner and improve formant-based
speaker de-identification up to 25%.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2022 01:34:15 GMT'}]",2022-04-01,"[['Tavi', 'Lauri', ''], ['Kinnunen', 'Tomi', ''], ['Hautamäki', 'Rosa González', '']]","['speaker de-identification', 'functional data analysis', 'functionalprincipal component analysis', 'pitch manipulation']"
6640,1606.00626,Patrick O. Glauner,"Patrick Glauner, Jorge Augusto Meira, Petko Valtchev, Radu State,
  Franck Bettinger","The Challenge of Non-Technical Loss Detection using Artificial
  Intelligence: A Survey",,"International Journal of Computational Intelligence Systems
  (IJCIS), vol. 10, issue 1, pp. 760-775, 2017",10.2991/ijcis.2017.10.1.51,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detection of non-technical losses (NTL) which include electricity theft,
faulty meters or billing errors has attracted increasing attention from
researchers in electrical engineering and computer science. NTLs cause
significant harm to the economy, as in some countries they may range up to 40%
of the total electricity distributed. The predominant research direction is
employing artificial intelligence to predict whether a customer causes NTL.
This paper first provides an overview of how NTLs are defined and their impact
on economies, which include loss of revenue and profit of electricity providers
and decrease of the stability and reliability of electrical power grids. It
then surveys the state-of-the-art research efforts in a up-to-date and
comprehensive review of algorithms, features and data sets used. It finally
identifies the key scientific and engineering challenges in NTL detection and
suggests how they could be addressed in the future.
","[{'version': 'v1', 'created': 'Thu, 2 Jun 2016 11:14:47 GMT'}, {'version': 'v2', 'created': 'Sat, 22 Jul 2017 22:30:28 GMT'}, {'version': 'v3', 'created': 'Tue, 25 Jul 2017 04:25:54 GMT'}]",2017-07-26,"[['Glauner', 'Patrick', ''], ['Meira', 'Jorge Augusto', ''], ['Valtchev', 'Petko', ''], ['State', 'Radu', ''], ['Bettinger', 'Franck', '']]","['Covariate shift', 'electricity theft', 'expert systems', 'machine learning', 'non-technical losses', 'stochastic processes']"
6641,1806.06639,Marco Livesu,"Matteo Bracci and Marco Tarini and Nico Pietroni and Marco Livesu and
  Paolo Cignoni",HexaLab.net: an online viewer for hexahedral meshes,,"Computer-Aided Design, Volume 110, May 2019, Pages 24-36",10.1016/j.cad.2018.12.003,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce HexaLab: a WebGL application for real time visualization,
exploration and assessment of hexahedral meshes. HexaLab can be used by simply
opening www.hexalab.net. Our visualization tool targets both users and
scholars. Practitioners who employ hexmeshes for Finite Element Analysis, can
readily check mesh quality and assess its usability for simulation. Researchers
involved in mesh generation may use HexaLab to perform a detailed analysis of
the mesh structure, isolating weak points and testing new solutions to improve
on the state of the art and generate high quality images. To this end, we
support a wide variety of visualization and volume inspection tools. Our system
offers also immediate access to a repository containing all the publicly
available meshes produced with the most recent techniques for hexmesh
generation. We believe HexaLab, providing a common tool for visualizing,
assessing and distributing results, will push forward the recent strive for
replicability in our scientific community.
","[{'version': 'v1', 'created': 'Mon, 18 Jun 2018 12:58:08 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Mar 2019 11:04:43 GMT'}]",2019-03-18,"[['Bracci', 'Matteo', ''], ['Tarini', 'Marco', ''], ['Pietroni', 'Nico', ''], ['Livesu', 'Marco', ''], ['Cignoni', 'Paolo', '']]","['hexahedral mesh', 'hex-mesh', '3D visualization', 'volumetric remeshing', 'benchmarking', '3D web application']"
6642,1910.09329,Nikolaos Stylianou,"Nikolaos Stylianou, Ioannis Vlahavas",A Neural Entity Coreference Resolution Review,"52 pages, 8 figures, 4 tables, Published in Expert Systems with
  Applications","Expert Systems with Applications, Volume 168, 15 April 2021,
  114466",10.1016/j.eswa.2020.114466,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Entity Coreference Resolution is the task of resolving all mentions in a
document that refer to the same real world entity and is considered as one of
the most difficult tasks in natural language understanding. It is of great
importance for downstream natural language processing tasks such as entity
linking, machine translation, summarization, chatbots, etc. This work aims to
give a detailed review of current progress on solving Coreference Resolution
using neural-based approaches. It also provides a detailed appraisal of the
datasets and evaluation metrics in the field, as well as the subtask of Pronoun
Resolution that has seen various improvements in the recent years. We highlight
the advantages and disadvantages of the approaches, the challenges of the task,
the lack of agreed-upon standards in the task and propose a way to further
expand the boundaries of the field.
","[{'version': 'v1', 'created': 'Mon, 21 Oct 2019 12:59:32 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Dec 2020 12:24:28 GMT'}]",2020-12-10,"[['Stylianou', 'Nikolaos', ''], ['Vlahavas', 'Ioannis', '']]","['Coreference resolution', 'Neural Networks', 'Gender Bias', 'Pronounresolution', 'Natural Language Processing', 'Discourse']"
6643,1906.01032,Ben Gelman,"Ben Gelman, Bryan Hoyle, Jessica Moore, Joshua Saxe, David Slater",A Language-Agnostic Model for Semantic Source Code Labeling,MASES 2018 Publication,,10.1145/3243127.3243132,,cs.LG cs.CL cs.SE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Code search and comprehension have become more difficult in recent years due
to the rapid expansion of available source code. Current tools lack a way to
label arbitrary code at scale while maintaining up-to-date representations of
new programming languages, libraries, and functionalities. Comprehensive
labeling of source code enables users to search for documents of interest and
obtain a high-level understanding of their contents. We use Stack Overflow code
snippets and their tags to train a language-agnostic, deep convolutional neural
network to automatically predict semantic labels for source code documents. On
Stack Overflow code snippets, we demonstrate a mean area under ROC of 0.957
over a long-tailed list of 4,508 tags. We also manually validate the model
outputs on a diverse set of unlabeled source code documents retrieved from
Github, and we obtain a top-1 accuracy of 86.6%. This strongly indicates that
the model successfully transfers its knowledge from Stack Overflow snippets to
arbitrary source code documents.
","[{'version': 'v1', 'created': 'Mon, 3 Jun 2019 19:21:42 GMT'}]",2019-06-05,"[['Gelman', 'Ben', ''], ['Hoyle', 'Bryan', ''], ['Moore', 'Jessica', ''], ['Saxe', 'Joshua', ''], ['Slater', 'David', '']]","['deep learning', 'source code', 'natural language processing', 'multilabelclassification', 'semantic labeling', 'crowdsourcing']"
6644,2101.02026,Iuliana Marin,"Monica-Paula Marin, Iuliana Marin, Livia Vidu",Learning about the reduction of food waste using Blockchain technology,,INTED2019 Proceedings,10.21125/inted.2019.0856,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Farmers need to be efficient and dedicate a lot of time in order to sustain
the quality of their animals which are in their care. The most convenient and
good quality - price ratio should be chosen for the feed of animals. Blockchain
is used in a virtual space to store and share information over a network of
users. This is done using the open source Hyperledger Fabric platform. The
transactions can be viewed by all the other users in real time. These
transactions are stored as JSONs inside CouchDB NoSQL database which supports
queries on a large volume of data. When using this technology, the farmer can
know with whom the supplier for animal feed collaborated with. The history of
the transactions are not saved in just one place. In this way, it is more
difficult to hack and provide implausible information. An e-learning platform
was created where the farm's user can post information, respectively new blocks
about the animal's birth, vaccinations, medicines, including the location of
the livestock. The same e-learning platform is accessible from the mobile
phone. By using the blockchain technology, anyone, including the client from
the shop can know a lot about the origin of the products. Fake origins of food
are much more difficult to hide. Fraud is also limited. The system monitored
the traceability of dairy products inside a Romanian farm. Data about fodder
provider and quality, cow productive performances and health and dairy products
process were obtained and analyzed by students who will become specialists at
all the levels of the food chain. Blockchain is the technology which in case of
a dairy products contamination, the origin of the farm is traced in just a
couple of seconds. In this way just a batch of dairy products is removed from
distribution, leading to the reduction of food waste.
","[{'version': 'v1', 'created': 'Sun, 3 Jan 2021 10:19:10 GMT'}]",2021-01-07,"[['Marin', 'Monica-Paula', ''], ['Marin', 'Iuliana', ''], ['Vidu', 'Livia', '']]","['Blockchain', 'food waste', 'farmers', 'e-learning']"
6645,2106.02870,Wonbin Kweon,"Wonbin Kweon, SeongKu Kang, Hwanjo Yu",Bidirectional Distillation for Top-K Recommender System,WWW 2021,,10.1145/3442381.3449878,,cs.IR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Recommender systems (RS) have started to employ knowledge distillation, which
is a model compression technique training a compact model (student) with the
knowledge transferred from a cumbersome model (teacher). The state-of-the-art
methods rely on unidirectional distillation transferring the knowledge only
from the teacher to the student, with an underlying assumption that the teacher
is always superior to the student. However, we demonstrate that the student
performs better than the teacher on a significant proportion of the test set,
especially for RS. Based on this observation, we propose Bidirectional
Distillation (BD) framework whereby both the teacher and the student
collaboratively improve with each other. Specifically, each model is trained
with the distillation loss that makes to follow the other's prediction along
with its original loss function. For effective bidirectional distillation, we
propose rank discrepancy-aware sampling scheme to distill only the informative
knowledge that can fully enhance each other. The proposed scheme is designed to
effectively cope with a large performance gap between the teacher and the
student. Trained in the bidirectional way, it turns out that both the teacher
and the student are significantly improved compared to when being trained
separately. Our extensive experiments on real-world datasets show that our
proposed framework consistently outperforms the state-of-the-art competitors.
We also provide analyses for an in-depth understanding of BD and ablation
studies to verify the effectiveness of each proposed component.
","[{'version': 'v1', 'created': 'Sat, 5 Jun 2021 11:03:32 GMT'}]",2021-06-08,"[['Kweon', 'Wonbin', ''], ['Kang', 'SeongKu', ''], ['Yu', 'Hwanjo', '']]","['Recommender System', 'Collaborative Filtering', 'Knowledge Distillation', 'Learning to Rank', 'Model Compression', 'Retrieval Efficiency']"
6646,2012.14521,Jingbo Liu,Jingbo Liu,Minoration via Mixed Volumes and Cover's Problem for General Channels,"Some materials in Section 3 from the previous version are removed,
  replaced by appropriate references to [Pajor 1984] and [Mendelson, Milman,
  Paouris 2019]. The paper has been published online on Probability Theory and
  Related Fields",,10.1007/s00440-022-01111-6,,cs.IT math.IT math.PR math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give a complete solution to an open problem of Thomas Cover in 1987 about
the capacity of a relay channel in the general discrete memoryless setting
without any additional assumptions. The key step in our approach is to lower
bound a certain soft-max of a stochastic process by convex geometry methods,
which is based on two ideas: First, the soft-max is lower bounded in terms of
the supremum of another process, by approximating a convex set with a polytope
with bounded number of vertices. Second, using a result of Pajor, the supremum
of the process is lower bounded in terms of packing numbers by means of
mixed-volume inequalities (Minkowski's first inequality).
","[{'version': 'v1', 'created': 'Mon, 28 Dec 2020 23:07:47 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Jan 2021 04:17:09 GMT'}, {'version': 'v3', 'created': 'Mon, 31 Jan 2022 22:36:56 GMT'}]",2022-02-02,"[['Liu', 'Jingbo', '']]","['Multiuser Information theory', 'High dimensional probability', 'Empirical process theory', 'Convex geometry', 'Minkowski’s inequality']"
6647,1909.08396,Wojciech Kozlowski,"Wojciech Kozlowski, Stephanie Wehner",Towards Large-Scale Quantum Networks,"To be presented at the Sixth Annual ACM International Conference on
  Nanoscale Computing and Communication, Dublin, Ireland",,10.1145/3345312.3345497,,cs.NI quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The vision of a quantum internet is to fundamentally enhance Internet
technology by enabling quantum communication between any two points on Earth.
While the first realisations of small scale quantum networks are expected in
the near future, scaling such networks presents immense challenges to physics,
computer science and engineering. Here, we provide a gentle introduction to
quantum networking targeted at computer scientists, and survey the state of the
art. We proceed to discuss key challenges for computer science in order to make
such networks a reality.
","[{'version': 'v1', 'created': 'Fri, 6 Sep 2019 16:36:44 GMT'}]",2019-09-19,"[['Kozlowski', 'Wojciech', ''], ['Wehner', 'Stephanie', '']]","['networks', 'quantum networks', 'quantum internet', 'network protocols', 'quantum communications', 'quantum computing']"
6648,1905.11773,Amir Bar,"David Chettrit, Orna Bregman Amitai, Itamar Tamir, Amir Bar, Eldad
  Elnekave","PHT-bot: Deep-Learning based system for automatic risk stratification of
  COPD patients based upon signs of Pulmonary Hypertension",,"Proc. SPIE 10950, Medical Imaging 2019: Computer-Aided Diagnosis,
  109500O",10.1117/12.2512469,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Chronic Obstructive Pulmonary Disease (COPD) is a leading cause of morbidity
and mortality worldwide. Identifying those at highest risk of deterioration
would allow more effective distribution of preventative and surveillance
resources. Secondary pulmonary hypertension is a manifestation of advanced
COPD, which can be reliably diagnosed by the main Pulmonary Artery (PA) to
Ascending Aorta (Ao) ratio. In effect, a PA diameter to Ao diameter ratio of
greater than 1 has been demonstrated to be a reliable marker of increased
pulmonary arterial pressure. Although clinically valuable and readily
visualized, the manual assessment of the PA and the Ao diameters is time
consuming and under-reported. The present study describes a non invasive method
to measure the diameters of both the Ao and the PA from contrast-enhanced chest
Computed Tomography (CT). The solution applies deep learning techniques in
order to select the correct axial slice to measure, and to segment both
arteries. The system achieves test Pearson correlation coefficient scores of
93% for the Ao and 92% for the PA. To the best of our knowledge, it is the
first such fully automated solution.
","[{'version': 'v1', 'created': 'Tue, 28 May 2019 12:39:05 GMT'}]",2019-05-29,"[['Chettrit', 'David', ''], ['Amitai', 'Orna Bregman', ''], ['Tamir', 'Itamar', ''], ['Bar', 'Amir', ''], ['Elnekave', 'Eldad', '']]","['Deep Learning', 'Chest Computed Tomography', 'Pulmonary Hypertension', 'Chronic Obstructive Pulmonary Disease', 'Computer Aided Diagnosis']"
6649,2204.00387,Hristo Petkov,"Hristo Petkov, Colin Hanley and Feng Dong","DAG-WGAN: Causal Structure Learning With Wasserstein Generative
  Adversarial Networks","8th International Conference on Artificial Intelligence and
  Applications (AIFU 2022)",,10.5121/csit.2022.120611,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The combinatorial search space presents a significant challenge to learning
causality from data. Recently, the problem has been formulated into a
continuous optimization framework with an acyclicity constraint, allowing for
the exploration of deep generative models to better capture data sample
distributions and support the discovery of Directed Acyclic Graphs (DAGs) that
faithfully represent the underlying data distribution. However, so far no study
has investigated the use of Wasserstein distance for causal structure learning
via generative models. This paper proposes a new model named DAG-WGAN, which
combines the Wasserstein-based adversarial loss, an auto-encoder architecture
together with an acyclicity constraint. DAG-WGAN simultaneously learns causal
structures and improves its data generation capability by leveraging the
strength from the Wasserstein distance metric. Compared with other models, it
scales well and handles both continuous and discrete data. Our experiments have
evaluated DAG-WGAN against the state-of-the-art and demonstrated its good
performance.
","[{'version': 'v1', 'created': 'Fri, 1 Apr 2022 12:27:27 GMT'}]",2022-04-04,"[['Petkov', 'Hristo', ''], ['Hanley', 'Colin', ''], ['Dong', 'Feng', '']]","['Generative Adversarial Networks', 'Wasserstein Distance', 'Bayesian Networks', 'Causal Structure Learning', 'Directed Acyclic Graphs']"
6650,2101.09385,Joshua Kroll,Joshua A. Kroll,"Outlining Traceability: A Principle for Operationalizing Accountability
  in Computing Systems","To be published in the Proceedings of the 2021 ACM Conference on
  Fairness, Accountability, and Transparency (FAccT'21)",,10.1145/3442188.3445937,,cs.CY cs.AI cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Accountability is widely understood as a goal for well governed computer
systems, and is a sought-after value in many governance contexts. But how can
it be achieved? Recent work on standards for governable artificial intelligence
systems offers a related principle: traceability. Traceability requires
establishing not only how a system worked but how it was created and for what
purpose, in a way that explains why a system has particular dynamics or
behaviors. It connects records of how the system was constructed and what the
system did mechanically to the broader goals of governance, in a way that
highlights human understanding of that mechanical operation and the decision
processes underlying it. We examine the various ways in which the principle of
traceability has been articulated in AI principles and other policy documents
from around the world, distill from these a set of requirements on software
systems driven by the principle, and systematize the technologies available to
meet those requirements. From our map of requirements to supporting tools,
techniques, and procedures, we identify gaps and needs separating what
traceability requires from the toolbox available for practitioners. This map
reframes existing discussions around accountability and transparency, using the
principle of traceability to show how, when, and why transparency can be
deployed to serve accountability goals and thereby improve the normative
fidelity of systems and their development processes.
","[{'version': 'v1', 'created': 'Sat, 23 Jan 2021 00:13:20 GMT'}]",2021-08-23,"[['Kroll', 'Joshua A.', '']]","['traceability', 'accountability', 'transparency', 'AI principles', 'AI ethics']"
6651,1907.01117,Morad Behandish,"Amir M. Mirzendehdel, Morad Behandish, Saigopal Nelaturi",Exploring Feasible Design Spaces for Heterogeneous Constraints,Special Issue on Generative Design,"Journal of Computer-Aided Design, 2019",10.1016/j.cad.2019.06.005,,cs.CG cs.CE cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We demonstrate an approach of exploring design spaces to simultaneously
satisfy kinematics- and physics-based requirements. We present a classification
of constraints and solvers to enable postponing optimization as far down the
design workflow as possible. The solvers are organized into two broad classes
of design space 'pruning' and 'exploration' by considering the types of
constraints they can satisfy. We show that pointwise constraints define
feasible design subspaces that can be represented and computed as first-class
entities by their maximal feasible elements. The design space is pruned upfront
by intersecting maximal elements, without premature optimization. To solve for
other constraints, we apply topology optimization (TO), starting from the
pruned feasible space. The optimization is steered by a topological sensitivity
field (TSF) that measures the global changes in violation of constraints with
respect to local topological punctures. The TSF for global objective functions
is augmented with TSF for global constraints, and penalized/filtered to
incorporate local constraints, including set constraints converted to
differentiable (in)equality constraints. We demonstrate application of the
proposed workflow to nontrivial examples in design and manufacturing. Among
other examples, we show how to explore pruned design spaces via TO to
simultaneously satisfy physics-based constraints (e.g., minimize compliance and
mass) as well as kinematics-based constraints (e.g., maximize accessibility for
machining).
","[{'version': 'v1', 'created': 'Tue, 2 Jul 2019 01:11:49 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Jul 2019 03:24:01 GMT'}]",2019-07-11,"[['Mirzendehdel', 'Amir M.', ''], ['Behandish', 'Morad', ''], ['Nelaturi', 'Saigopal', '']]","['Feasible Design Space', 'Composing Solvers', 'Workflows', 'Maximal Elements', 'Sensitivity Fields']"
6652,2001.00766,G Manjunath,G Manjunath,"Stability and Memory-loss go Hand-in-Hand: Three Results in Dynamics &
  Computation","To appear in the Proceedings of the Royal Society of London, Series A",,10.1098/rspa.2020.0563,,cs.LG math.DS stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The search for universal laws that help establish a relationship between
dynamics and computation is driven by recent expansionist initiatives in
biologically inspired computing. A general setting to understand both such
dynamics and computation is a driven dynamical system that responds to a
temporal input. Surprisingly, we find memory-loss a feature of driven systems
to forget their internal states helps provide unambiguous answers to the
following fundamental stability questions that have been unanswered for
decades: what is necessary and sufficient so that slightly different inputs
still lead to mostly similar responses? How does changing the driven system's
parameters affect stability? What is the mathematical definition of the
edge-of-criticality? We anticipate our results to be timely in understanding
and designing biologically inspired computers that are entering an era of
dedicated hardware implementations for neuromorphic computing and
state-of-the-art reservoir computing applications.
","[{'version': 'v1', 'created': 'Fri, 3 Jan 2020 09:28:00 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Sep 2020 12:24:10 GMT'}]",2020-09-17,"[['Manjunath', 'G', '']]","['Dynamics', 'Complex Systems', 'Stability', 'Edge-of-Criticality', 'Bio-Inspired Computing', 'Reservoir Computing']"
6653,1903.06257,Hyoung Suk Park Ph.D.,"Hyoung Suk Park, Jineon Baek, Sun Kyoung You, Jae Kyu Choi, and Jin
  Keun Seo","Unpaired image denoising using a generative adversarial network in X-ray
  CT",,"IEEE Access, 2019",10.1109/ACCESS.2019.2934178,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a deep learning-based denoising method for noisy low-dose
computerized tomography (CT) images in the absence of paired training data. The
proposed method uses a fidelity-embedded generative adversarial network (GAN)
to learn a denoising function from unpaired training data of low-dose CT (LDCT)
and standard-dose CT (SDCT) images, where the denoising function is the optimal
generator in the GAN framework. This paper analyzes the f-GAN objective to
derive a suitable generator that is optimized by minimizing a weighted sum of
two losses: the Kullback-Leibler divergence between an SDCT data distribution
and a generated distribution, and the $\ell_2$ loss between the LDCT image and
the corresponding generated images (or denoised image). The computed generator
reflects the prior belief about SDCT data distribution through training. We
observed that the proposed method allows the preservation of fine anomalous
features while eliminating noise. The experimental results show that the
proposed deep-learning method with unpaired datasets performs comparably to a
method using paired datasets. A clinical experiment was also performed to show
the validity of the proposed method for noise arising in the low-dose X-ray CT.
","[{'version': 'v1', 'created': 'Mon, 4 Mar 2019 06:01:42 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Aug 2019 08:33:53 GMT'}]",2019-08-13,"[['Park', 'Hyoung Suk', ''], ['Baek', 'Jineon', ''], ['You', 'Sun Kyoung', ''], ['Choi', 'Jae Kyu', ''], ['Seo', 'Jin Keun', '']]","['Computerized tomography', 'denoising', 'low-dose', 'generative adversarial network', 'unsupervised']"
6654,2108.07971,Md. Monowar Anjum,"Md Monowar Anjum, Noman Mohammed, Xiaoqian Jiang","De-identification of Unstructured Clinical Texts from Sequence to
  Sequence Perspective",Accepted in Poster Track for ACM CCS 2021,,10.1145/3460120.3485354,,cs.CL cs.CR cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this work, we propose a novel problem formulation for de-identification of
unstructured clinical text. We formulate the de-identification problem as a
sequence to sequence learning problem instead of a token classification
problem. Our approach is inspired by the recent state-of -the-art performance
of sequence to sequence learning models for named entity recognition. Early
experimentation of our proposed approach achieved 98.91% recall rate on i2b2
dataset. This performance is comparable to current state-of-the-art models for
unstructured clinical text de-identification.
","[{'version': 'v1', 'created': 'Wed, 18 Aug 2021 04:48:58 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Sep 2021 08:46:52 GMT'}]",2021-09-13,"[['Anjum', 'Md Monowar', ''], ['Mohammed', 'Noman', ''], ['Jiang', 'Xiaoqian', '']]","['privacy', 'de-identification', 'named entity recognition']"
6655,2002.10253,Ruiyang Zhang,"Ruiyang Zhang, Yang Liu, Hao Sun","Physics-Informed Multi-LSTM Networks for Metamodeling of Nonlinear
  Structures","21 pages, 13 figures",,10.1016/j.cma.2020.113226,,cs.CE eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces an innovative physics-informed deep learning framework
for metamodeling of nonlinear structural systems with scarce data. The basic
concept is to incorporate physics knowledge (e.g., laws of physics, scientific
principles) into deep long short-term memory (LSTM) networks, which boosts the
learning within a feasible solution space. The physics constraints are embedded
in the loss function to enforce the model training which can accurately capture
latent system nonlinearity even with very limited available training datasets.
Specifically for dynamic structures, physical laws of equation of motion, state
dependency and hysteretic constitutive relationship are considered to construct
the physics loss. In particular, two physics-informed multi-LSTM network
architectures are proposed for structural metamodeling. The satisfactory
performance of the proposed framework is successfully demonstrated through two
illustrative examples (e.g., nonlinear structures subjected to ground motion
excitation). It turns out that the embedded physics can alleviate overfitting
issues, reduce the need of big training datasets, and improve the robustness of
the trained model for more reliable prediction. As a result, the
physics-informed deep learning paradigm outperforms classical
non-physics-guided data-driven neural networks.
","[{'version': 'v1', 'created': 'Tue, 18 Feb 2020 10:35:02 GMT'}]",2020-07-15,"[['Zhang', 'Ruiyang', ''], ['Liu', 'Yang', ''], ['Sun', 'Hao', '']]","['physics-informed deep learning', 'long short-term memory', 'metamodeling', 'nonlinearstructures', 'LSTM', 'PhyLSTM2', 'PhyLSTM3']"
6656,2002.06184,Pascal Weisenburger,"Pascal Weisenburger (TU Darmstadt, Germany), Guido Salvaneschi (TU
  Darmstadt, Germany)","Implementing a Language for Distributed Systems: Choices and Experiences
  with Type Level and Macro Programming in Scala",,"The Art, Science, and Engineering of Programming, 2020, Vol. 4,
  Issue 3, Article 17",10.22152/programming-journal.org/2020/4/17,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multitier programming languages reduce the complexity of developing
distributed systems by developing the distributed system in a single coherent
code base. The compiler or the runtime separate the code for the components of
the distributed system, enabling abstraction over low level implementation
details such as data representation, serialization and network protocols. Our
ScalaLoci language allows developers to declare the different components and
their architectural relation at the type level, allowing static reasoning about
about distribution and remote communication and guaranteeing static type safety
across components. The compiler splits the multitier program into the
component-specific code and automatically generates the communication
boilerplate. Communication between components can be modeled by declaratively
specifying data flows between components using reactive programming.
  In this paper, we report on the implementation of our design and our
experience with embedding our language features into Scala as a host language.
We show how a combination of Scala's advanced type level programming and its
macro system can be used to enrich the language with new abstractions. We
comment on the challenges we encountered and the solutions we developed for our
current implementation and outline suggestions for an improved macro system to
support the such use cases of embedding of domain-specific abstractions.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 18:58:10 GMT'}]",2020-02-17,"[['Weisenburger', 'Pascal', '', 'TU Darmstadt, Germany'], ['Salvaneschi', 'Guido', '', 'TU\n  Darmstadt, Germany']]","['Distributed Programming', 'Multitier Programming', 'Type Level Programming', 'Macro System', 'Scala']"
6657,2101.10629,Gennaro Vessio Dr.,"Eufemia Lella, Gennaro Vessio","Ensembling complex network 'perspectives' for mild cognitive impairment
  detection with artificial neural networks",,"Pattern Recognition Letters, Volume 136, August 2020, Pages
  168-174",10.1016/j.patrec.2020.06.001,,cs.CV eess.IV q-bio.NC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this paper, we propose a novel method for mild cognitive impairment
detection based on jointly exploiting the complex network and the neural
network paradigm. In particular, the method is based on ensembling different
brain structural ""perspectives"" with artificial neural networks. On one hand,
these perspectives are obtained with complex network measures tailored to
describe the altered brain connectivity. In turn, the brain reconstruction is
obtained by combining diffusion-weighted imaging (DWI) data to tractography
algorithms. On the other hand, artificial neural networks provide a means to
learn a mapping from topological properties of the brain to the presence or
absence of cognitive decline. The effectiveness of the method is studied on a
well-known benchmark data set in order to evaluate if it can provide an
automatic tool to support the early disease diagnosis. Also, the effects of
balancing issues are investigated to further assess the reliability of the
complex network approach to DWI data.
","[{'version': 'v1', 'created': 'Tue, 26 Jan 2021 08:38:11 GMT'}]",2021-01-27,"[['Lella', 'Eufemia', ''], ['Vessio', 'Gennaro', '']]","['Decision support systems', 'Mild cognitive impairment', 'Diffusion-weighted imaging', 'Complex networks', 'Artificial neural networks']"
6658,2007.06251,Victor Costa,"Victor Costa, Nuno Louren\c{c}o, Jo\~ao Correia, Penousal Machado",Exploring the Evolution of GANs through Quality Diversity,Published in GECCO 2020,,10.1145/3377930.3389824,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generative adversarial networks (GANs) achieved relevant advances in the
field of generative algorithms, presenting high-quality results mainly in the
context of images. However, GANs are hard to train, and several aspects of the
model should be previously designed by hand to ensure training success. In this
context, evolutionary algorithms such as COEGAN were proposed to solve the
challenges in GAN training. Nevertheless, the lack of diversity and premature
optimization can be found in some of these solutions. We propose in this paper
the application of a quality-diversity algorithm in the evolution of GANs. The
solution is based on the Novelty Search with Local Competition (NSLC)
algorithm, adapting the concepts used in COEGAN to this new proposal. We
compare our proposal with the original COEGAN model and with an alternative
version using a global competition approach. The experimental results evidenced
that our proposal increases the diversity of the discovered solutions and
leverage the performance of the models found by the algorithm. Furthermore, the
global competition approach was able to consistently find better models for
GANs.
","[{'version': 'v1', 'created': 'Mon, 13 Jul 2020 08:54:52 GMT'}]",2020-07-14,"[['Costa', 'Victor', ''], ['Lourenço', 'Nuno', ''], ['Correia', 'João', ''], ['Machado', 'Penousal', '']]","['neuroevolution', 'coevolution', 'generative adversarial networks', 'quality diversity']"
6659,2208.10928,Yoichi Yamazaki,"Yoichi Yamazaki, Tsukuto Yamada, Hiroki Nomura, Nobuaki Hosoda, Ryoma
  Kawamura, Kazuaki Takeuchi, Hiroaki Kato, Ryuma Niiyama, and Kentaro
  Yoshifuji","Meta Avatar Robot Cafe: Linking Physical and Virtual Cybernetic Avatars
  to Provide Physical Augmentation for People with Disabilities","SIGGRAPH '22 Emerging Technologies, 2022, 2 Pages. Project page:
  https://bit.ly/metaavatarrobotcafe",,10.1145/3532721.3546117,,cs.HC cs.CY cs.GR cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Meta avatar robot cafe is a cafe that fuses cyberspace and physical space to
create new encounters with people. We create a place where people with
disabilities who have difficulty going out can freely switch between their
physical bodies and virtual bodies, and communicate their presence and warmth
to each other.
","[{'version': 'v1', 'created': 'Mon, 18 Jul 2022 09:58:07 GMT'}]",2022-08-24,"[['Yamazaki', 'Yoichi', ''], ['Yamada', 'Tsukuto', ''], ['Nomura', 'Hiroki', ''], ['Hosoda', 'Nobuaki', ''], ['Kawamura', 'Ryoma', ''], ['Takeuchi', 'Kazuaki', ''], ['Kato', 'Hiroaki', ''], ['Niiyama', 'Ryuma', ''], ['Yoshifuji', 'Kentaro', '']]","['cybernetic avatar', 'avatar works', 'telepresence robot', 'people withdisabilities', 'human-robot interaction']"
6660,2004.09193,Amir Javadpour,Amir Javadpour,"Improving Resources Management in Network Virtualization by Utilizing a
  Software-Based Network",,,10.1007/s11277-019-06176-6,,cs.NI cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network virtualization is a way to simultaneously run multiple heterogeneous
architectures on a shared substrate. The main issue in network virtualization
is mapping virtual networks to substrate network. How to manage substrate
resources in mapping phase will have an effective role in improving the use of
infrastructure resources. Using software-based networks in network
virtualization which separates control logic from data as a new technology, has
led to efficient resource management in this context. In this article a
software-based network approach has been presented to network virtualization
and manage infrastructure resources efficiently. It optimizes mapping function
by dynamic resource management of infrastructure resource. We have added a
module in the controller to manage the resources dynamically. An initial
mapping will be done for arriving new requests based on number of successful
requests and arriving time slots. They will not be finalized by writing the
rules in the switches before arriving n requests. If some remapping during the
n time window is needed, remapping can be done by the controller and the final
results are sent to the switches to write the flow rules. The simulation has
been done using NS2 simulator showed based on different evaluation criteria
such as acceptance rate, average link utilization, cost and delay. Keywords:
network virtualization, software based network, Virtual network mapping,
substrate network, Virtual network.
","[{'version': 'v1', 'created': 'Mon, 20 Apr 2020 10:39:06 GMT'}]",2020-04-21,"[['Javadpour', 'Amir', '']]","['network virtualization', 'software based network', 'Virtual network mapping', 'substrate network', 'Virtual network']"
6661,1704.02278,Xavier Bellekens,"Xavier Bellekens and Christos Tachtatzis and Robert Atkinson and Craig
  Renfrew and Tony Kirkham","GLoP: Enabling Massively Parallel Incident Response Through GPU Log
  Processing","Published in The 7th International Conference of Security of
  Information and Networks, SIN 2014, Glasgow, UK, September, 2014",,10.1145/2659651.2659700,,cs.DC cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Large industrial systems that combine services and applications, have become
targets for cyber criminals and are challenging from the security, monitoring
and auditing perspectives. Security log analysis is a key step for uncovering
anomalies, detecting intrusion, and enabling incident response. The constant
increase of link speeds, threats and users, produce large volumes of log data
and become increasingly difficult to analyse on a Central Processing Unit
(CPU). This paper presents a massively parallel Graphics Processing Unit (GPU)
LOg Processing (GLoP) library and can also be used for Deep Packet Inspection
(DPI), using a prefix matching technique, harvesting the full power of
off-the-shelf technologies. GLoP implements two different algorithm using
different GPU memory and is compared against CPU counterpart implementations.
The library can be used for processing nodes with single or multiple GPUs as
well as GPU cloud farms. The results show throughput of 20Gbps and demonstrate
that modern GPUs can be utilised to increase the operational speed of large
scale log processing scenarios, saving precious time before and after an
intrusion has occurred.
","[{'version': 'v1', 'created': 'Fri, 7 Apr 2017 16:21:26 GMT'}]",2017-04-10,"[['Bellekens', 'Xavier', ''], ['Tachtatzis', 'Christos', ''], ['Atkinson', 'Robert', ''], ['Renfrew', 'Craig', ''], ['Kirkham', 'Tony', '']]","['Security', 'GPU', 'CUDA', 'Pattern Matching']"
6662,2208.11200,Ali Behrouz,"Farnoosh Hashemi, Ali Behrouz, Laks V.S. Lakshmanan",FirmCore Decomposition of Multilayer Networks,"This is the author's version of the paper. Published in The ACM Web
  Conference (WWW), 2022",,10.1145/3485447.3512205,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A key graph mining primitive is extracting dense structures from graphs, and
this has led to interesting notions such as $k$-cores which subsequently have
been employed as building blocks for capturing the structure of complex
networks and for designing efficient approximation algorithms for challenging
problems such as finding the densest subgraph. In applications such as
biological, social, and transportation networks, interactions between objects
span multiple aspects. Multilayer (ML) networks have been proposed for
accurately modeling such applications. In this paper, we present FirmCore, a
new family of dense subgraphs in ML networks, and show that it satisfies many
of the nice properties of $k$-cores in single-layer graphs. Unlike the state of
the art core decomposition of ML graphs, FirmCores have a polynomial time
algorithm, making them a powerful tool for understanding the structure of
massive ML networks. We also extend FirmCore for directed ML graphs. We show
that FirmCores and directed FirmCores can be used to obtain efficient
approximation algorithms for finding the densest subgraphs of ML graphs and
their directed counterparts. Our extensive experiments over several real ML
graphs show that our FirmCore decomposition algorithm is significantly more
efficient than known algorithms for core decompositions of ML graphs.
Furthermore, it returns solutions of matching or better quality for the densest
subgraph problem over (possibly directed) ML graphs.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2022 21:30:38 GMT'}]",2022-08-25,"[['Hashemi', 'Farnoosh', ''], ['Behrouz', 'Ali', ''], ['Lakshmanan', 'Laks V. S.', '']]","['Graph mining', '𝑘-core', 'multi-layer graph', 'densest subgraph']"
6663,2003.03837,Marcelo Fernandes,"Lucileide M. D. da Silva, Maria G. F. Coutinho, Carlos E. B. Santos,
  Mailson R. Santos, Luiz Affonso Guedes, M. Dolores Ruiz, Marcelo A. C.
  Fernandes","Hardware Architecture Proposal for TEDA algorithm to Data Streaming
  Anomaly Detection",,,10.1109/ACCESS.2021.3098004,,cs.DC cs.LG eess.SP,http://creativecommons.org/licenses/by/4.0/,"  The amount of data in real-time, such as time series and streaming data,
available today continues to grow. Being able to analyze this data the moment
it arrives can bring an immense added value. However, it also requires a lot of
computational effort and new acceleration techniques. As a possible solution to
this problem, this paper proposes a hardware architecture for Typicality and
Eccentricity Data Analytic (TEDA) algorithm implemented on Field Programmable
Gate Arrays (FPGA) for use in data streaming anomaly detection. TEDA is based
on a new approach to outlier detection in the data stream context. In order to
validate the proposals, results of the occupation and throughput of the
proposed hardware are presented. Besides, the bit accurate simulation results
are also presented. The project aims to Xilinx Virtex-6 xc6vlx240t-1ff1156 as
the target FPGA.
","[{'version': 'v1', 'created': 'Sun, 8 Mar 2020 19:28:53 GMT'}]",2021-07-26,"[['da Silva', 'Lucileide M. D.', ''], ['Coutinho', 'Maria G. F.', ''], ['Santos', 'Carlos E. B.', ''], ['Santos', 'Mailson R.', ''], ['Guedes', 'Luiz Affonso', ''], ['Ruiz', 'M. Dolores', ''], ['Fernandes', 'Marcelo A. C.', '']]","['FPGA', 'TEDA', 'data streaming', 'reconfigurable computing']"
6664,2011.11940,Zhiqi Wang,"Zhiqi Wang, Yue Chen, Wolfgang Gl\""anzel","Preprints as accelerator of scholarly communication: An empirical
  analysis in Mathematics","This is the accepted manuscript of the paper being published in
  Journal of Informetrics. The link to the final published journal version :
  https://linkinghub.elsevier.com/retrieve/pii/S1751157720300729","Journal of Informetrics,2020,14(4)",10.1016/j.joi.2020.101097,,cs.DL cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this study we analyse the key driving factors of preprints in enhancing
scholarly communication. To this end we use four groups of metrics, one
referring to scholarly communication and based on bibliometric indicators (Web
of Science and Scopus citations), while the others reflect usage (usage counts
in Web of Science), capture (Mendeley readers) and social media attention
(Tweets). Hereby we measure two effects associated with preprint publishing:
publication delay and impact. We define and use several indicators to assess
the impact of journal articles with previous preprint versions in arXiv. In
particular, the indicators measure several times characterizing the process of
arXiv preprints publishing and the reviewing process of the journal versions,
and the ageing patterns of citations to preprints. In addition, we compare the
observed patterns between preprints and non-OA articles without any previous
preprint versions in arXiv. We could observe that the ""early-view"" and
""open-access"" effects of preprints contribute to a measurable citation and
readership advantage of preprints. Articles with preprint versions are more
likely to be mentioned in social media and have shorter Altmetric attention
delay. Usage and capture prove to have only moderate but stronger correlation
with citations than Tweets. The different slopes of the regression lines
between the different indicators reflect different order of magnitude of usage,
capture and citation data.
","[{'version': 'v1', 'created': 'Tue, 24 Nov 2020 07:32:35 GMT'}, {'version': 'v2', 'created': 'Sat, 28 Nov 2020 00:00:37 GMT'}]",2020-12-01,"[['Wang', 'Zhiqi', ''], ['Chen', 'Yue', ''], ['Glänzel', 'Wolfgang', '']]","['Preprints', 'Publication delay', 'Scholarly impact', 'Social impact', 'WoS usage', 'Altmetrics']"
6665,2104.06641,Gabin An,"Gabin An, Shin Yoo",FDG: A Precise Measurement of Fault Diagnosability Gain of Test Cases,"13 pages, 6 figures (to be published in ISSTA'22)",,10.1145/3533767.3534370,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The performance of many Fault Localisation (FL) techniques directly depends
on the quality of the used test suites. Consequently, it is extremely useful to
be able to precisely measure how much diagnostic power each test case can
introduce when added to a test suite used for FL. Such a measure can help us
not only to prioritise and select test cases to be used for FL, but also to
effectively augment test suites that are too weak to be used with FL
techniques. We propose FDG, a new measure of Fault Diagnosability Gain for
individual test cases. The design of FDG is based on our analysis of existing
metrics that are designed to prioritise test cases for better FL. Unlike other
metrics, FDG exploits the ongoing FL results to emphasise the parts of the
program for which more information is needed. Our evaluation of FDG with
Defects4J shows that it can successfully help the augmentation of test suites
for better FL. When given only a few failing test cases (2.3 test cases on
average), FDG can effectively augment the given test suite by prioritising the
test cases generated automatically by EvoSuite: the augmentation can improve
the acc@1 and acc@10 of the FL results by 11.6x and 2.2x on average, after
requiring only ten human judgements on the correctness of the assertions
EvoSuite generates.
","[{'version': 'v1', 'created': 'Wed, 14 Apr 2021 06:06:29 GMT'}, {'version': 'v2', 'created': 'Thu, 6 May 2021 02:18:55 GMT'}, {'version': 'v3', 'created': 'Tue, 24 May 2022 12:45:38 GMT'}]",2022-09-15,"[['An', 'Gabin', ''], ['Yoo', 'Shin', '']]","['Fault Diagnosability', 'Coverage', 'Test Selection', 'Test Suite Augmentation', 'Iterative Fault Localisation']"
6666,2001.09329,"Michel Kr\""amer","Michel Kr\""amer","GeoRocket: A scalable and cloud-based data store for big geospatial
  files",Accepted. To be published in SoftwareX,"SoftwareX, Volume 11, 2020",10.1016/j.softx.2020.100409,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present GeoRocket, a software for the management of very large geospatial
datasets in the cloud. GeoRocket employs a novel way to handle arbitrarily
large datasets by splitting them into chunks that are processed individually.
The software has a modern reactive architecture and makes use of existing
services including Elasticsearch and storage back ends such as MongoDB or
Amazon S3. GeoRocket is schema-agnostic and supports a wide range of
heterogeneous geospatial file formats. It is also format-preserving and does
not alter imported data in any way. The main benefits of GeoRocket are its
performance, scalability, and usability, which make it suitable for a number of
scientific and commercial use cases dealing with very high data volumes,
complex datasets, and high velocity (Big Data). GeoRocket also provides many
opportunities for further research in the area of geospatial data management.
","[{'version': 'v1', 'created': 'Sat, 25 Jan 2020 15:06:56 GMT'}]",2020-02-04,"[['Krämer', 'Michel', '']]","['Geospatial Data', 'Cloud', 'Big Data', 'Distributed Computing', 'Databases']"
6667,2006.03217,Chiranjibi Sitaula,"Chiranjibi Sitaula and Sunil Aryal and Yong Xiang and Anish Basnet and
  Xuequan Lu",Content and Context Features for Scene Image Representation,Submitted to Knowledge-Based Systems (Elsevier) for consideration,"Knowledge-based Systems (Elsevier), 2021",10.1016/j.knosys.2021.107470,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing research in scene image classification has focused on either content
features (e.g., visual information) or context features (e.g., annotations). As
they capture different information about images which can be complementary and
useful to discriminate images of different classes, we suppose the fusion of
them will improve classification results. In this paper, we propose new
techniques to compute content features and context features, and then fuse them
together. For content features, we design multi-scale deep features based on
background and foreground information in images. For context features, we use
annotations of similar images available in the web to design a filter words
(codebook). Our experiments in three widely used benchmark scene datasets using
support vector machine classifier reveal that our proposed context and content
features produce better results than existing context and content features,
respectively. The fusion of the proposed two types of features significantly
outperform numerous state-of-the-art features.
","[{'version': 'v1', 'created': 'Fri, 5 Jun 2020 03:19:13 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Jan 2021 06:25:35 GMT'}, {'version': 'v3', 'created': 'Sat, 24 Apr 2021 05:37:31 GMT'}]",2021-09-14,"[['Sitaula', 'Chiranjibi', ''], ['Aryal', 'Sunil', ''], ['Xiang', 'Yong', ''], ['Basnet', 'Anish', ''], ['Lu', 'Xuequan', '']]","['Image classification', 'Context features', 'Content features', 'Feature']"
6668,1912.11944,Antonio Fari\~na,"Antonio Fari\~na and Miguel A. Mart\'inez-Prieto and Francisco Claude
  and Gonzalo Navarro and Juan J. Lastra-D\'iaz and Nicola Prezza and Diego
  Seco","On the Reproducibility of Experiments of Indexing Repetitive Document
  Collections","This research has received funding from the European Union's Horizon
  2020 research and innovation programme under the Marie Sklodowska-Curie
  Actions H2020-MSCA-RISE-2015 BIRDS GA No. 690941. Replication framework
  available at: https://github.com/migumar2/uiHRDC/","Information Systems; Volume 83, July 2019; pages 181-194",10.1016/j.is.2019.03.007,,cs.DS cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work introduces a companion reproducible paper with the aim of allowing
the exact replication of the methods, experiments, and results discussed in a
previous work [5]. In that parent paper, we proposed many and varied techniques
for compressing indexes which exploit that highly repetitive collections are
formed mostly of documents that are near-copies of others. More concretely, we
describe a replication framework, called uiHRDC (universal indexes for Highly
Repetitive Document Collections), that allows our original experimental setup
to be easily replicated using various document collections. The corresponding
experimentation is carefully explained, providing precise details about the
parameters that can be tuned for each indexing solution. Finally, note that we
also provide uiHRDC as reproducibility package.
","[{'version': 'v1', 'created': 'Thu, 26 Dec 2019 22:51:13 GMT'}]",2019-12-30,"[['Fariña', 'Antonio', ''], ['Martínez-Prieto', 'Miguel A.', ''], ['Claude', 'Francisco', ''], ['Navarro', 'Gonzalo', ''], ['Lastra-Díaz', 'Juan J.', ''], ['Prezza', 'Nicola', ''], ['Seco', 'Diego', '']]","['repetitive document collections', 'inverted index', 'self-index', 'reproducibility']"
6669,2008.11007,Julien Siebert,"Julien Siebert, Lisa Joeckel, Jens Heidrich, Koji Nakamichi, Kyoko
  Ohashi, Isao Namba, Rieko Yamamoto, Mikio Aoyama",Towards Guidelines for Assessing Qualities of Machine Learning Systems,"Has been accepted at the 13th International Conference on the Quality
  of Information and Communications Technology QUATIC2020
  (https://2020.quatic.org/). QUATIC 2020 proceedings will be included in a
  volume of Springer CCIS Series (Communications in Computer and Information
  Science)","Proceedings of the 13th International Conference on the Quality of
  Information and Communications Technology QUATIC2020
  (https://2020.quatic.org/). Springer CCIS Series (Communications in Computer
  and Information Science)",10.1007/978-3-030-58793-2_2,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, systems containing components based on machine learning (ML)
methods are becoming more widespread. In order to ensure the intended behavior
of a software system, there are standards that define necessary quality aspects
of the system and its components (such as ISO/IEC 25010). Due to the different
nature of ML, we have to adjust quality aspects or add additional ones (such as
trustworthiness) and be very precise about which aspect is really relevant for
which object of interest (such as completeness of training data), and how to
objectively assess adherence to quality requirements. In this article, we
present the construction of a quality model (i.e., evaluation objects, quality
aspects, and metrics) for an ML system based on an industrial use case. This
quality model enables practitioners to specify and assess quality requirements
for such kinds of ML systems objectively. In the future, we want to learn how
the term quality differs between different types of ML systems and come up with
general guidelines for specifying and assessing qualities of ML systems.
","[{'version': 'v1', 'created': 'Tue, 25 Aug 2020 13:45:54 GMT'}]",2020-08-26,"[['Siebert', 'Julien', ''], ['Joeckel', 'Lisa', ''], ['Heidrich', 'Jens', ''], ['Nakamichi', 'Koji', ''], ['Ohashi', 'Kyoko', ''], ['Namba', 'Isao', ''], ['Yamamoto', 'Rieko', ''], ['Aoyama', 'Mikio', '']]","['Machine Learning', 'Software Quality', 'Quality Evaluation']"
6670,2011.04127,Jake Lee,"Jake Lee, Junfeng Yang, Zhangyang Wang",What Does CNN Shift Invariance Look Like? A Visualization Study,"Presented at the 2020 ECCV Workshop on Real-World Computer Vision
  from Inputs with Limited Quality (RLQ-TOD 2020), Glasgow, Scotland",,10.1007/978-3-030-68238-5_15,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feature extraction with convolutional neural networks (CNNs) is a popular
method to represent images for machine learning tasks. These representations
seek to capture global image content, and ideally should be independent of
geometric transformations. We focus on measuring and visualizing the shift
invariance of extracted features from popular off-the-shelf CNN models. We
present the results of three experiments comparing representations of millions
of images with exhaustively shifted objects, examining both local invariance
(within a few pixels) and global invariance (across the image frame). We
conclude that features extracted from popular networks are not globally
invariant, and that biases and artifacts exist within this variance.
Additionally, we determine that anti-aliased models significantly improve local
invariance but do not impact global invariance. Finally, we provide a code
repository for experiment reproduction, as well as a website to interact with
our results at https://jakehlee.github.io/visualize-invariance.
","[{'version': 'v1', 'created': 'Mon, 9 Nov 2020 01:16:30 GMT'}]",2022-03-03,"[['Lee', 'Jake', ''], ['Yang', 'Junfeng', ''], ['Wang', 'Zhangyang', '']]","['Feature Extraction', 'Shift Invariance', 'Robust Recognition']"
6671,1412.1027,Alexei Botchkarev,Alexei Botchkarev and Patrick Finnigan,Complexity in the Context of Systems Approach to Project Management,,"Organisational Project Management, 2015, 2(1): 15-34",10.5130/opm.v2i1.4272,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Complexity is an inherent attribute of any project. The purpose of defining
and documenting complexity is to have an early warning tool allowing a project
team to focus on certain areas and aspects of the project in order to prevent
and alleviate future risks and issues caused by this complexity. The main
contribution of this paper is to present a systematic view of complexity in
project management by identifying its key attributes and classifying complexity
by these attributes. A ""complexity taxonomy"", based on a survey of the existing
complexity literature, is developed and discussed including the product,
project, and external environment dimensions. We show how complexity types are
described through simple real life examples and business cases. Then we develop
a framework (tool) for applying the notion of complexity as an early warning
tool for a project manager in order to timely foresee future risks and
problems. The paper is intended for researchers in complexity, project
management, information systems, technology solutions and business management,
and also for information specialists, project managers, program managers,
financial staff and technology directors.
","[{'version': 'v1', 'created': 'Tue, 2 Dec 2014 19:18:15 GMT'}]",2015-12-25,"[['Botchkarev', 'Alexei', ''], ['Finnigan', 'Patrick', '']]","['Complexity', 'project management', 'systems approach', 'information system']"
6672,2103.01773,Sabah Al-Fedaghi Dr.,Sabah Al-Fedaghi,Conceptual Modeling for Computer Organization and Architecture,"11 pages, 12 figures","Journal of Computer Science 2021, 17 (2): 123.134",10.3844/jcssp.2021.123.1324,,cs.CY cs.AR,http://creativecommons.org/licenses/by/4.0/,"  Understanding computer system hardware, including how computers operate, is
essential for undergraduate students in computer engineering and science.
Literature shows students learning computer organization and assembly language
often find fundamental concepts difficult to comprehend within the topic
materials. Tools have been introduced to improve students comprehension of the
interaction between computer architecture, assembly language, and the operating
system. One such tool is the Little Man Computer (LMC) model that operates in a
way similar to a computer but that is easier to understand. Even though LMC
does not have modern CPUs with multiple cores nor executes multiple
instructions, it nevertheless shows the basic principles of the von Neumann
architecture. LMC aims to introduce students to such concepts as code and
instruction sets. In this paper, LMC is used for an additional purpose: a tool
with which to experiment using a new modeling language (i.e., a thinging
machine; TM) in the area of computer organization and architecture without
involving complexity in the subject. That is, the simplicity of LMC facilitates
the application of TM without going deep into computer
organization/architecture materials. Accordingly, the paper (a) provides a new
way for using the LMC model for whatever purpose (e.g., education) and (b)
demonstrates that TM can be used to build an abstract level of description in
the organization/architect field. The resultant schematics from the TM model of
LMC offer an initial case study that supports our thesis that TM is a viable
method for hardware/software-independent descriptions in the computer
organization and architect field of study.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2021 07:52:49 GMT'}]",2021-03-03,"[['Al-Fedaghi', 'Sabah', '']]","['Conceptual model', 'abstract representation', 'machine']"
6673,2005.13746,Yinan Wang,"Yinan Wang, Weihong ""Grace"" Guo, Xiaowei Yue",Tensor decomposition to Compress Convolutional Layers in Deep Learning,"35 pages, IISE Transactions",,10.1080/24725854.2021.1894514,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feature extraction for tensor data serves as an important step in many tasks
such as anomaly detection, process monitoring, image classification, and
quality control. Although many methods have been proposed for tensor feature
extraction, there are still two challenges that need to be addressed: 1) how to
reduce the computation cost for high dimensional and large volume tensor data;
2) how to interpret the output features and evaluate their significance. {The
most recent methods in deep learning, such as Convolutional Neural Network
(CNN), have shown outstanding performance in analyzing tensor data, but their
wide adoption is still hindered by model complexity and lack of
interpretability. To fill this research gap, we propose to use CP-decomposition
to approximately compress the convolutional layer (CPAC-Conv layer) in deep
learning. The contributions of our work could be summarized into three aspects:
(1) we adapt CP-decomposition to compress convolutional kernels and derive the
expressions of both forward and backward propagations for our proposed
CPAC-Conv layer; (2) compared with the original convolutional layer, the
proposed CPAC-Conv layer can reduce the number of parameters without decaying
prediction performance. It can combine with other layers to build novel deep
Neural Networks; (3) the value of decomposed kernels indicates the significance
of the corresponding feature map, which provides us with insights to guide
feature selection.
","[{'version': 'v1', 'created': 'Thu, 28 May 2020 02:35:48 GMT'}, {'version': 'v2', 'created': 'Mon, 31 May 2021 01:53:10 GMT'}]",2021-06-01,"[['Wang', 'Yinan', ''], ['Guo', 'Weihong ""Grace""', ''], ['Yue', 'Xiaowei', '']]","['CP-decomposition', 'Tensor', 'Convolutional Neural Network (CNN)', 'Model']"
6674,2203.02228,Rafa{\l} Skinderowicz,Rafa{\l} Skinderowicz,"Improving Ant Colony Optimization Efficiency for Solving Large TSP
  Instances","28 pages, 10 figures, 5 tables","Applied Soft Computing, 2022, 108653, ISSN 1568-4946",10.1016/j.asoc.2022.108653,,cs.NE cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Ant Colony Optimization (ACO) is a family of nature-inspired metaheuristics
often applied to finding approximate solutions to difficult optimization
problems. Despite being significantly faster than exact methods, the ACOs can
still be prohibitively slow, especially if compared to basic problem-specific
heuristics. As recent research has shown, it is possible to significantly
improve the performance through algorithm refinements and careful parallel
implementation benefiting from multi-core CPUs and dedicated accelerators. In
this paper, we present a novel ACO variant, namely the Focused ACO (FACO). One
of the core elements of the FACO is a mechanism for controlling the number of
differences between a newly constructed and a selected previous solution. The
mechanism results in a more focused search process, allowing to find
improvements while preserving the quality of the existing solution. An
additional benefit is a more efficient integration with a problem-specific
local search.
  Computational study based on a range of the Traveling Salesman Problem
instances shows that the FACO outperforms the state-of-the-art ACOs when
solving large TSP instances. Specifically, the FACO required less than an hour
of an 8-core commodity CPU time to find high-quality solutions (within 1% from
the best-known results) for TSP Art Instances ranging from 100000 to 200000
nodes.
","[{'version': 'v1', 'created': 'Fri, 4 Mar 2022 10:26:02 GMT'}]",2022-03-07,"[['Skinderowicz', 'Rafał', '']]","['Ant Colony Optimization', 'Traveling Salesman Problem', 'parallel metaheuristics']"
6675,2104.00813,Asmae Benali,Asmae Benali and Bouchra El Asri,"A Context Aware and Self Adaptation Strategy for Cloud Service Selection
  and Configuration in Run Time",URL: https://doi.org/10.5539/cis.v13n1p10,"Vol. 13, No. 1; 2020",10.5539/cis.v13n1p10,,cs.SE cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Day after day, the number of mobile applications deployed on cloud computing
continues in increasing because o f smartphone capabilities improvement. Cloud
computing has already succeeded in the web based application, for that reason,
the demand for context aware services provided by cloud computing increases. To
customize a cloud service that takes into account th e consumer requirements,
which depend on information change, it brings to light many recent challenges
to cloud computing about environment aware, location aware, time aware. The
cloud provider, moreover, has to manage personalized applications and the con
straints of mobile devices in matters of interaction abilities and
communication restrictions. This paper proposes a strategy for selecting
automatically an appropriate cloud environment that runs out whole
requirements, defines a configuration for the ass ociated cloud environment and
able to easily adapt to the change of the environment on either the user or the
cloud side or both. This process builds on the principles of dynamic software
product lines, Agent oriented software engineering, and the MAPE k m odel to
select and configure cloud environments according to the consumer needs and the
context change.
","[{'version': 'v1', 'created': 'Thu, 1 Apr 2021 23:49:33 GMT'}]",2021-04-05,"[['Benali', 'Asmae', ''], ['Asri', 'Bouchra El', '']]","['autonomic system', 'cloud computing', 'context-aware system', 'dynamic software product line', 'multi-agent system', 'variability management']"
6676,2002.06179,Tomoki Nakamaru,"Tomoki Nakamaru (The University of Tokyo, Japan), Shigeru Chiba (The
  University of Tokyo, Japan)",Generating a Generic Fluent API in Java,,"The Art, Science, and Engineering of Programming, 2020, Vol. 4,
  Issue 3, Article 9",10.22152/programming-journal.org/2020/4/9,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: The algorithms for generating a safe fluent API are actively studied
these years. A safe fluent API is the fluent API that reports incorrect
chaining of the API methods as a type error to the API users. Although such a
safe property improves the productivity of its users, the construction of a
safe fluent API is too complicated for the developers. The generation
algorithms are studied to reduce the development cost of a safe fluent API. The
study on the generation would benefit a number of programmers since a fluent
API is a popular design in the real world.
  Inquiry: The generation of a generic fluent API has been left untackled. A
generic fluent API refers to the fluent API that provides generic methods
(methods that contain type parameters in their definitions). The Stream API in
Java is an example of such a generic API. The recent research on the safe
fluent API generation rather focuses on the grammar class that the algorithm
can deal with for syntax checking. The key idea of the previous study is to use
nested generics to represent a stack structure for the parser built on top of
the type system. In that idea, the role of a type parameter was limited to
internally representing a stack element of that parser on the type system. The
library developers could not use type parameters to include a generic method in
their API so that the semantic constraints for their API would be statically
checked, for example, the type constraint on the items passed through a stream.
  Approach: We propose an algorithm to generate a generic fluent API. Our
translation algorithm is modeled as the construction of deterministic finite
automaton (DFA) with type parameter information. Each state of the DFA holds
information about which type parameters are already bound in that state. This
information is used to identify whether a method invocation in a chain newly
binds a type to a type parameter, or refers to a previously bound type. The
identification is required since a type parameter in a chain is bound at a
particular method invocation, and that bound type is referred to in the
following method invocations. Our algorithm constructs the DFA by analyzing the
binding time of type parameters and their propagation among the states in a DFA
that is naively constructed from the given grammar.
  Knowledge and Importance: Our algorithm helps library developers to develop a
generic fluent API. The ability to generate a generic fluent API is essential
to bring the safe fluent API generation to the real world since the use of type
parameters is a common technique in the library API design. By our algorithm,
the generation of a safe fluent API will be ready for practical use.
  Grounding: We implemented a generator named Protocool to demonstrate our
algorithm. We also generated several libraries using Protocool to show the
ability and the limitations of our algorithm.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 18:56:26 GMT'}]",2020-02-17,"[['Nakamaru', 'Tomoki', '', 'The University of Tokyo, Japan'], ['Chiba', 'Shigeru', '', 'The\n  University of Tokyo, Japan']]","['Fluent API', 'Source code generation', 'Domain-specific language']"
6677,2001.11489,Munther Abualkibash,Munther Abualkibash,Machine Learning in Network Security Using KNIME Analytics,,,10.5121/ijnsa.2019.11501,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning has more and more effect on our every day's life. This field
keeps growing and expanding into new areas. Machine learning is based on the
implementation of artificial intelligence that gives systems the capability to
automatically learn and enhance from experiments without being explicitly
programmed. Machine Learning algorithms apply mathematical equations to analyze
datasets and predict values based on the dataset. In the field of
cybersecurity, machine learning algorithms can be utilized to train and analyze
the Intrusion Detection Systems (IDSs) on security-related datasets. In this
paper, we tested different machine learning algorithms to analyze NSL-KDD
dataset using KNIME analytics.
","[{'version': 'v1', 'created': 'Mon, 18 Nov 2019 14:10:17 GMT'}]",2020-01-31,"[['Abualkibash', 'Munther', '']]","['Network Security', 'KNIME', 'NSL-KDD', 'Machine Learning']"
6678,2110.12130,Zhuofan Zong,"Zhuofan Zong, Qianggang Cao, Biao Leng","RCNet: Reverse Feature Pyramid and Cross-scale Shift Network for Object
  Detection",Accepted by ACM MM2021,,10.1145/3474085.3475708,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feature pyramid networks (FPN) are widely exploited for multi-scale feature
fusion in existing advanced object detection frameworks. Numerous previous
works have developed various structures for bidirectional feature fusion, all
of which are shown to improve the detection performance effectively. We observe
that these complicated network structures require feature pyramids to be
stacked in a fixed order, which introduces longer pipelines and reduces the
inference speed. Moreover, semantics from non-adjacent levels are diluted in
the feature pyramid since only features at adjacent pyramid levels are merged
by the local fusion operation in a sequence manner. To address these issues, we
propose a novel architecture named RCNet, which consists of Reverse Feature
Pyramid (RevFP) and Cross-scale Shift Network (CSN). RevFP utilizes local
bidirectional feature fusion to simplify the bidirectional pyramid inference
pipeline. CSN directly propagates representations to both adjacent and
non-adjacent levels to enable multi-scale features more correlative. Extensive
experiments on the MS COCO dataset demonstrate RCNet can consistently bring
significant improvements over both one-stage and two-stage detectors with
subtle extra computational overhead. In particular, RetinaNet is boosted to
40.2 AP, which is 3.7 points higher than baseline, by replacing FPN with our
proposed model. On COCO test-dev, RCNet can achieve very competitive
performance with a single-model single-scale 50.5 AP. Codes will be made
available.
","[{'version': 'v1', 'created': 'Sat, 23 Oct 2021 04:00:25 GMT'}]",2021-10-26,"[['Zong', 'Zhuofan', ''], ['Cao', 'Qianggang', ''], ['Leng', 'Biao', '']]","['Feature Pyramid Networks', 'Multi-scale Feature Fusion', 'Object Detection']"
6679,2109.05929,Mohammad Aliannejadi,"Hamed Bonab, Mohammad Aliannejadi, Ali Vardasbi, Evangelos Kanoulas,
  James Allan",Cross-Market Product Recommendation,Accepted in CIKM 2021,,10.1145/3459637.3482493,,cs.IR cs.AI,http://creativecommons.org/licenses/by/4.0/,"  We study the problem of recommending relevant products to users in relatively
resource-scarce markets by leveraging data from similar, richer in resource
auxiliary markets. We hypothesize that data from one market can be used to
improve performance in another. Only a few studies have been conducted in this
area, partly due to the lack of publicly available experimental data. To this
end, we collect and release XMarket, a large dataset covering 18 local markets
on 16 different product categories, featuring 52.5 million user-item
interactions. We introduce and formalize the problem of cross-market product
recommendation, i.e., market adaptation. We explore different market-adaptation
techniques inspired by state-of-the-art domain-adaptation and meta-learning
approaches and propose a novel neural approach for market adaptation, named
FOREC. Our model follows a three-step procedure -- pre-training, forking, and
fine-tuning -- in order to fully utilize the data from an auxiliary market as
well as the target market. We conduct extensive experiments studying the impact
of market adaptation on different pairs of markets. Our proposed approach
demonstrates robust effectiveness, consistently improving the performance on
target markets compared to competitive baselines selected for our analysis. In
particular, FOREC improves on average 24% and up to 50% in terms of nDCG@10,
compared to the NMF baseline. Our analysis and experiments suggest specific
future directions in this research area. We release our data and code for
academic purposes.
","[{'version': 'v1', 'created': 'Mon, 13 Sep 2021 12:53:45 GMT'}]",2021-09-14,"[['Bonab', 'Hamed', ''], ['Aliannejadi', 'Mohammad', ''], ['Vardasbi', 'Ali', ''], ['Kanoulas', 'Evangelos', ''], ['Allan', 'James', '']]","['Product Recommendation', 'Meta-Learning', 'Domain Adaptation', 'Market Adaptation', 'Cross-Market Recommendation']"
6680,cs/0404019,Matthew Berryman,"Matthew J. Berryman, Andrew Allison and Derek Abbott",Optimizing genetic algorithm strategies for evolving networks,"9 pages, 5 figures",,10.1117/12.548122,,cs.NE cs.NI,,"  This paper explores the use of genetic algorithms for the design of networks,
where the demands on the network fluctuate in time. For varying network
constraints, we find the best network using the standard genetic algorithm
operators such as inversion, mutation and crossover. We also examine how the
choice of genetic algorithm operators affects the quality of the best network
found. Such networks typically contain redundancy in servers, where several
servers perform the same task and pleiotropy, where servers perform multiple
tasks. We explore this trade-off between pleiotropy versus redundancy on the
cost versus reliability as a measure of the quality of the network.
","[{'version': 'v1', 'created': 'Wed, 7 Apr 2004 07:08:09 GMT'}]",2009-11-10,"[['Berryman', 'Matthew J.', ''], ['Allison', 'Andrew', ''], ['Abbott', 'Derek', '']]","['Pleiotropy', 'redundancy', 'genetic algorithms', 'networks']"
6681,2201.06260,Tianyi Xie,"Tianyi Xie, Liucheng Liao, Cheng Bi, Benlai Tang, Xiang Yin, Jianfei
  Yang, Mingjie Wang, Jiali Yao, Yang Zhang, Zejun Ma",Towards Realistic Visual Dubbing with Heterogeneous Sources,"9 pages (including references), 7 figures, Accepted in ACM
  Multimedia, 2021",,10.1145/3474085.3475318,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The task of few-shot visual dubbing focuses on synchronizing the lip
movements with arbitrary speech input for any talking head video. Albeit
moderate improvements in current approaches, they commonly require high-quality
homologous data sources of videos and audios, thus causing the failure to
leverage heterogeneous data sufficiently. In practice, it may be intractable to
collect the perfect homologous data in some cases, for example, audio-corrupted
or picture-blurry videos. To explore this kind of data and support
high-fidelity few-shot visual dubbing, in this paper, we novelly propose a
simple yet efficient two-stage framework with a higher flexibility of mining
heterogeneous data. Specifically, our two-stage paradigm employs facial
landmarks as intermediate prior of latent representations and disentangles the
lip movements prediction from the core task of realistic talking head
generation. By this means, our method makes it possible to independently
utilize the training corpus for two-stage sub-networks using more available
heterogeneous data easily acquired. Besides, thanks to the disentanglement, our
framework allows a further fine-tuning for a given talking head, thereby
leading to better speaker-identity preserving in the final synthesized results.
Moreover, the proposed method can also transfer appearance features from others
to the target speaker. Extensive experimental results demonstrate the
superiority of our proposed method in generating highly realistic videos
synchronized with the speech over the state-of-the-art.
","[{'version': 'v1', 'created': 'Mon, 17 Jan 2022 07:57:24 GMT'}]",2022-01-19,"[['Xie', 'Tianyi', ''], ['Liao', 'Liucheng', ''], ['Bi', 'Cheng', ''], ['Tang', 'Benlai', ''], ['Yin', 'Xiang', ''], ['Yang', 'Jianfei', ''], ['Wang', 'Mingjie', ''], ['Yao', 'Jiali', ''], ['Zhang', 'Yang', ''], ['Ma', 'Zejun', '']]","['few-shot', 'visual dubbing', 'heterogeneous sources', 'two stages']"
6682,2004.10599,Antoine Blanchard,Antoine Blanchard and Themistoklis Sapsis,Bayesian Optimization with Output-Weighted Optimal Sampling,,,10.1016/j.jcp.2020.109901,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Bayesian optimization, accounting for the importance of the output
relative to the input is a crucial yet challenging exercise, as it can
considerably improve the final result but often involves inaccurate and
cumbersome entropy estimations. We approach the problem from the perspective of
importance-sampling theory, and advocate the use of the likelihood ratio to
guide the search algorithm towards regions of the input space where the
objective function to be minimized assumes abnormally small values. The
likelihood ratio acts as a sampling weight and can be computed at each
iteration without severely deteriorating the overall efficiency of the
algorithm. In particular, it can be approximated in a way that makes the
approach tractable in high dimensions. The ""likelihood-weighted"" acquisition
functions introduced in this work are found to outperform their unweighted
counterparts in a number of applications.
","[{'version': 'v1', 'created': 'Wed, 22 Apr 2020 14:38:39 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Jun 2020 16:37:03 GMT'}, {'version': 'v3', 'created': 'Thu, 30 Jul 2020 15:54:17 GMT'}, {'version': 'v4', 'created': 'Sat, 3 Oct 2020 21:58:21 GMT'}]",2020-12-30,"[['Blanchard', 'Antoine', ''], ['Sapsis', 'Themistoklis', '']]","['Bayesian optimization', 'optimal sampling', 'extreme events']"
6683,2106.12765,Yang Lu,"Yang Lu, Qifan Chen and Simon Poon",A Novel Approach to Discover Switch Behaviours in Process Mining,ICPM Workshop 2020,"Process Mining Workshops. ICPM 2020. Lecture Notes in Business
  Information Processing, vol 406. Springer, Cham",10.1007/978-3-030-72693-5_5,,cs.DB cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Process mining is a relatively new subject which builds a bridge between
process modelling and data mining. An exclusive choice in a process model
usually splits the process into different branches. However, in some processes,
it is possible to switch from one branch to another. The inductive miner
guarantees to return sound process models, but fails to return a precise model
when there are switch behaviours between different exclusive choice branches
due to the limitation of process trees. In this paper, we present a novel
extension to the process tree model to support switch behaviours between
different branches of the exclusive choice operator and propose a novel
extension to the inductive miner to discover sound process models with switch
behaviours. The proposed discovery technique utilizes the theory of a previous
study to detect possible switch behaviours. We apply both artificial and
publicly-available datasets to evaluate our approach. Our results show that our
approach can improve the precision of discovered models by 36% while
maintaining high fitness values compared to the original inductive miner.
","[{'version': 'v1', 'created': 'Thu, 24 Jun 2021 04:25:28 GMT'}]",2021-06-25,"[['Lu', 'Yang', ''], ['Chen', 'Qifan', ''], ['Poon', 'Simon', '']]","['Process Discovery', 'Complex Behaviours Detection', 'Switch Behaviours', 'Inductive Miner', 'Process Trees']"
6684,2111.00134,Eseoghene Ben-Iwhiwhu,"Eseoghene Ben-Iwhiwhu, Jeffery Dick, Nicholas A. Ketz, Praveen K.
  Pilly, Andrea Soltoggio",Context Meta-Reinforcement Learning via Neuromodulation,,Neural Networks 2022,10.1016/j.neunet.2022.04.003,,cs.NE cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Meta-reinforcement learning (meta-RL) algorithms enable agents to adapt
quickly to tasks from few samples in dynamic environments. Such a feat is
achieved through dynamic representations in an agent's policy network (obtained
via reasoning about task context, model parameter updates, or both). However,
obtaining rich dynamic representations for fast adaptation beyond simple
benchmark problems is challenging due to the burden placed on the policy
network to accommodate different policies. This paper addresses the challenge
by introducing neuromodulation as a modular component to augment a standard
policy network that regulates neuronal activities in order to produce efficient
dynamic representations for task adaptation. The proposed extension to the
policy network is evaluated across multiple discrete and continuous control
environments of increasing complexity. To prove the generality and benefits of
the extension in meta-RL, the neuromodulated network was applied to two
state-of-the-art meta-RL algorithms (CAVIA and PEARL). The result demonstrates
that meta-RL augmented with neuromodulation produces significantly better
result and richer dynamic representations in comparison to the baselines.
","[{'version': 'v1', 'created': 'Sat, 30 Oct 2021 01:05:40 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Dec 2021 18:08:47 GMT'}, {'version': 'v3', 'created': 'Tue, 26 Apr 2022 15:51:35 GMT'}]",2022-04-27,"[['Ben-Iwhiwhu', 'Eseoghene', ''], ['Dick', 'Jeffery', ''], ['Ketz', 'Nicholas A.', ''], ['Pilly', 'Praveen K.', ''], ['Soltoggio', 'Andrea', '']]","['meta-learning', 'lifelong-learning', 'deep reinforcement learning', 'neuromodulation']"
6685,2107.01996,Chao Wang Senior Scientist,"Chao Wang, Pengcheng An","Explainability via Interactivity? Supporting Nonexperts' Sensemaking of
  Pretrained CNN by Interacting with Their Daily Surroundings",8 pages,,10.1145/3450337.3483487,,cs.HC cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current research on Explainable AI (XAI) heavily targets on expert users
(data scientists or AI developers). However, increasing importance has been
argued for making AI more understandable to nonexperts, who are expected to
leverage AI techniques, but have limited knowledge about AI. We present a
mobile application to support nonexperts to interactively make sense of
Convolutional Neural Networks (CNN); it allows users to play with a pretrained
CNN by taking pictures of their surrounding objects. We use an up-to-date XAI
technique (Class Activation Map) to intuitively visualize the model's decision
(the most important image regions that lead to a certain result). Deployed in a
university course, this playful learning tool was found to support design
students to gain vivid understandings about the capabilities and limitations of
pretrained CNNs in real-world environments. Concrete examples of students'
playful explorations are reported to characterize their sensemaking processes
reflecting different depths of thought.
","[{'version': 'v1', 'created': 'Mon, 31 May 2021 19:22:53 GMT'}]",2021-10-20,"[['Wang', 'Chao', ''], ['An', 'Pengcheng', '']]","['Explainable AI', 'Class Activation Map', 'Mobile Application', 'Convolutional']"
6686,2007.00364,Evangelia Kyrimi,"Evangelia Kyrimi, Mariana Raniere Neves, Scott McLachlan, Martin Neil,
  William Marsh, Norman Fenton",Medical idioms for clinical Bayesian network development,,,10.1016/j.jbi.2020.103495,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bayesian Networks (BNs) are graphical probabilistic models that have proven
popular in medical applications. While numerous medical BNs have been
published, most are presented fait accompli without explanation of how the
network structure was developed or justification of why it represents the
correct structure for the given medical application. This means that the
process of building medical BNs from experts is typically ad hoc and offers
little opportunity for methodological improvement. This paper proposes
generally applicable and reusable medical reasoning patterns to aid those
developing medical BNs. The proposed method complements and extends the
idiom-based approach introduced by Neil, Fenton, and Nielsen in 2000. We
propose instances of their generic idioms that are specific to medical BNs. We
refer to the proposed medical reasoning patterns as medical idioms. In
addition, we extend the use of idioms to represent interventional and
counterfactual reasoning. We believe that the proposed medical idioms are
logical reasoning patterns that can be combined, reused and applied generically
to help develop medical BNs. All proposed medical idioms have been illustrated
using medical examples on coronary artery disease. The method has also been
applied to other ongoing BNs being developed with medical experts. Finally, we
show that applying the proposed medical idioms to published BN models results
in models with a clearer structure.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2020 10:10:52 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Jul 2020 08:03:45 GMT'}]",2020-07-03,"[['Kyrimi', 'Evangelia', ''], ['Neves', 'Mariana Raniere', ''], ['McLachlan', 'Scott', ''], ['Neil', 'Martin', ''], ['Marsh', 'William', ''], ['Fenton', 'Norman', '']]","['Bayesian Networks', 'Medical Idioms', 'Reasoning Patterns', 'Knowledge Elicitation']"
6687,2204.10770,Xiao Chen,"Xiao Chen, Chad Zanocco, June Flora, Ram Rajagopal","Constructing dynamic residential energy lifestyles using Latent
  Dirichlet Allocation",forthcoming in Applied Energy,,10.1016/j.apenergy.2022.119109,,cs.CY cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The rapid expansion of Advanced Meter Infrastructure (AMI) has dramatically
altered the energy information landscape. However, our ability to use this
information to generate actionable insights about residential electricity
demand remains limited. In this research, we propose and test a new framework
for understanding residential electricity demand by using a dynamic energy
lifestyles approach that is iterative and highly extensible. To obtain energy
lifestyles, we develop a novel approach that applies Latent Dirichlet
Allocation (LDA), a method commonly used for inferring the latent topical
structure of text data, to extract a series of latent household energy
attributes. By doing so, we provide a new perspective on household electricity
consumption where each household is characterized by a mixture of energy
attributes that form the building blocks for identifying a sparse collection of
energy lifestyles. We examine this approach by running experiments on one year
of hourly smart meter data from 60,000 households and we extract six energy
attributes that describe general daily use patterns. We then use clustering
techniques to derive six distinct energy lifestyle profiles from energy
attribute proportions. Our lifestyle approach is also flexible to varying time
interval lengths, and we test our lifestyle approach seasonally (Autumn,
Winter, Spring, and Summer) to track energy lifestyle dynamics within and
across households and find that around 73% of households manifest multiple
lifestyles across a year. These energy lifestyles are then compared to
different energy use characteristics, and we discuss their practical
applications for demand response program design and lifestyle change analysis.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2022 15:41:47 GMT'}]",2022-04-25,"[['Chen', 'Xiao', ''], ['Zanocco', 'Chad', ''], ['Flora', 'June', ''], ['Rajagopal', 'Ram', '']]","['Energy Lifestyles', 'Residential Electricity Use', 'Smart Meter', 'Latent DirichletAllocation', 'Topic Modeling', 'Clustering']"
6688,1908.08740,Maximilian Felde,Maximilian Felde and Gerd Stumme,Interactive Collaborative Exploration using Incomplete Contexts,"38 pages (31 pages + 7 pages appendix), 16 figures",,10.1016/j.datak.2022.102104,,cs.AI cs.HC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A well-known knowledge acquisition method in the field of Formal Concept
Analysis (FCA) is attribute exploration. It is used to reveal dependencies in a
set of attributes with help of a domain expert. In most applications no single
expert is capable (time- and knowledge-wise) of exploring the knowledge domain
alone. However, there is up to now no theory that models the interaction of
multiple experts for the task of attribute exploration with incomplete
knowledge. To this end, we to develop a theoretical framework that allows
multiple experts to explore domains together. We use a representation of
incomplete knowledge as three-valued contexts. We then adapt the corresponding
version of attribute exploration to fit the setting of multiple experts. We
suggest formalizations for key components like expert knowledge, interaction
and collaboration strategy. In particular, we define an order that allows to
compare the results of different exploration strategies on the same task with
respect to their information completeness. Furthermore we discuss other ways of
comparing collaboration strategies and suggest avenues for future research.
","[{'version': 'v1', 'created': 'Fri, 23 Aug 2019 09:49:43 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Jan 2020 10:50:53 GMT'}]",2022-12-09,"[['Felde', 'Maximilian', ''], ['Stumme', 'Gerd', '']]","['Formal Concept Analysis', 'Incomplete Context', 'Collaboration', 'Attribute Exploration']"
6689,2006.06343,Emilio Gamba,"Bart Bogaerts, Emilio Gamba, Tias Guns","A framework for step-wise explaining how to solve constraint
  satisfaction problems",,,10.1016/j.artint.2021.103550,,cs.LO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore the problem of step-wise explaining how to solve constraint
satisfaction problems, with a use case on logic grid puzzles. More
specifically, we study the problem of explaining the inference steps that one
can take during propagation, in a way that is easy to interpret for a person.
Thereby, we aim to give the constraint solver explainable agency, which can
help in building trust in the solver by being able to understand and even learn
from the explanations. The main challenge is that of finding a sequence of
simple explanations, where each explanation should aim to be as cognitively
easy as possible for a human to verify and understand. This contrasts with the
arbitrary combination of facts and constraints that the solver may use when
propagating. We propose the use of a cost function to quantify how simple an
individual explanation of an inference step is, and identify the
explanation-production problem of finding the best sequence of explanations of
a CSP. Our approach is agnostic of the underlying constraint propagation
mechanisms, and can provide explanations even for inference steps resulting
from combinations of constraints. In case multiple constraints are involved, we
also develop a mechanism that allows to break the most difficult steps up and
thus gives the user the ability to zoom in on specific parts of the
explanation. Our proposed algorithm iteratively constructs the explanation
sequence by using an optimistic estimate of the cost function to guide the
search for the best explanation at each step. Our experiments on logic grid
puzzles show the feasibility of the approach in terms of the quality of the
individual explanations and the resulting explanation sequences obtained.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2020 11:35:41 GMT'}]",2021-07-06,"[['Bogaerts', 'Bart', ''], ['Gamba', 'Emilio', ''], ['Guns', 'Tias', '']]","['Artificial Intelligence', 'Constraint Solving', 'Explanation']"
6690,2201.01154,Jan Vykopal,"Jan Vykopal, Valdemar \v{S}v\'abensk\'y, Pavel Seda, Pavel \v{C}eleda",Preventing Cheating in Hands-on Lab Assignments,"ACM SIGCSE 2022 conference, 7 pages, 3 figures, 1 table",,10.1145/3478431.3499420,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Networking, operating systems, and cybersecurity skills are exercised best in
an authentic environment. Students work with real systems and tools in a lab
environment and complete assigned tasks. Since all students typically receive
the same assignment, they can consult their approach and progress with an
instructor, a tutoring system, or their peers. They may also search for
information on the Internet. Having the same assignment for all students in
class is standard practice efficient for learning and developing skills.
However, it is prone to cheating when used in a summative assessment such as
graded homework, a mid-term test, or a final exam. Students can easily share
and submit correct answers without completing the assignment. In this paper, we
discuss methods for automatic problem generation for hands-on tasks completed
in a computer lab environment. Using this approach, each student receives
personalized tasks. We developed software for generating and submitting these
personalized tasks and conducted a case study. The software was used for
creating and grading a homework assignment in an introductory security course
enrolled by 207 students. The software revealed seven cases of suspicious
submissions, which may constitute cheating. In addition, students and
instructors welcomed the personalized assignments. Instructors commented that
this approach scales well for large classes. Students rarely encountered issues
while running their personalized lab environment. Finally, we have released the
open-source software to enable other educators to use it in their courses and
learning environments.
","[{'version': 'v1', 'created': 'Tue, 4 Jan 2022 14:34:16 GMT'}]",2022-01-05,"[['Vykopal', 'Jan', ''], ['Švábenský', 'Valdemar', ''], ['Seda', 'Pavel', ''], ['Čeleda', 'Pavel', '']]","['summative assessment', 'automatic problem generation', 'networking', 'operating systems', 'cybersecurity', 'exercise', 'homework', 'case study']"
6691,2008.10497,Pouyan Fotouhi Tehrani,"Pouyan Fotouhi Tehrani, Eric Osterweil, Jochen H. Schiller, Thomas C.
  Schmidt, Matthias W\""ahlisch","Security of Alerting Authorities in the WWW: Measuring Namespaces,
  DNSSEC, and Web PKI",12 pages and 8 figures,Proceedings of the Web Conference 2021 (WWW '21),10.1145/3442381.3450033,,cs.CR cs.NI,http://creativecommons.org/licenses/by/4.0/,"  During disasters, crisis, and emergencies the public relies on online
services provided by official authorities to receive timely alerts, trustworthy
information, and access to relief programs. It is therefore crucial for the
authorities to reduce risks when accessing their online services. This includes
catering to secure identification of service, secure resolution of name to
network service, and content security and privacy as a minimum base for
trustworthy communication.
  In this paper, we take a first look at Alerting Authorities (AA) in the US
and investigate security measures related to trustworthy and secure
communication. We study the domain namespace structure, DNSSEC penetration, and
web certificates. We introduce an integrative threat model to better understand
whether and how the online presence and services of AAs are harmed. As an
illustrative example, we investigate 1,388 Alerting Authorities. We observe
partial heightened security relative to the global Internet trends, yet find
cause for concern as about 78% of service providers fail to deploy measures of
trustworthy service provision. Our analysis shows two major shortcomings.
First, how the DNS ecosystem is leveraged: about 50% of organizations do not
own their dedicated domain names and are dependent on others, 55% opt for
unrestricted-use namespaces, which simplifies phishing, and less than 4% of
unique AA domain names are secured by DNSSEC, which can lead to DNS poisoning
and possibly to certificate misissuance. Second, how Web PKI certificates are
utilized: 15% of all hosts provide none or invalid certificates, thus cannot
cater to confidentiality and data integrity, 64% of the hosts provide domain
validation certification that lack any identity information, and shared
certificates have gained on popularity, which leads to fate-sharing and can be
a cause for instability.
","[{'version': 'v1', 'created': 'Mon, 24 Aug 2020 15:02:09 GMT'}, {'version': 'v2', 'created': 'Sun, 25 Oct 2020 21:12:42 GMT'}, {'version': 'v3', 'created': 'Tue, 13 Apr 2021 08:44:09 GMT'}]",2021-04-15,"[['Tehrani', 'Pouyan Fotouhi', ''], ['Osterweil', 'Eric', ''], ['Schiller', 'Jochen H.', ''], ['Schmidt', 'Thomas C.', ''], ['Wählisch', 'Matthias', '']]","['DNS', 'DNSSEC', 'Web PKI', 'Emergency Management']"
6692,2109.11226,Theofanis Raptis,"Constantinos Marios Angelopoulos, Gabriel Filios, Sotiris Nikoletseas,
  Theofanis P. Raptis","Keeping data at the edge of smart irrigation networks: A case study in
  strawberry greenhouses",,"Computer Networks, Volume 167, 2020, 107039, ISSN 1389-1286",10.1016/j.comnet.2019.107039,,cs.NI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Strawberries are widely appreciated for their aroma, bright red color, juicy
texture, and sweetness. They are, however, among the most sensitive fruits when
it comes to the quality of the end product. The recent commercial trends show a
rising number of farmers who directly sell their products and are interested in
using smart solutions for a continuous quality control of the product.
Cloud-based approaches for smart irrigation have been widely used in the recent
years. However, the network traffic, security and regulatory challenges, which
come hand in hand with sharing the crop data with third parties outside the
edge of the network, lead strawberry farmers and data owners to rely on global
clouds and potentially lose control over their data, which are usually
transferred to third party data centers. In this paper, we follow a three-step
methodological approach in order to design, implement and validate a solution
for smart strawberry irrigation in greenhouses, while keeping the corresponding
data at the edge of the network: (i) We develop a small-scale smart irrigation
prototype solution with off-the-shelf hardware and software equipment, which we
test and evaluate on different kinds of plants in order to gain useful insights
for larger scale deployments, (ii) we introduce a reference network
architecture, specifically targeting smart irrigation and edge data
distribution for strawberry greenhouses, and (iii) adopting the proposed
reference architecture, we implement a full-scale system in an actual
strawberry greenhouse environment in Greece, and we compare its performance
against that of conventional strawberries irrigation. We show that our design
significantly outperforms the conventional approach, both in terms of soil
moisture variation and in terms of water consumption, and conclude by
critically appraising the costs and benefits of our approach in the
agricultural industry.
","[{'version': 'v1', 'created': 'Thu, 23 Sep 2021 09:14:16 GMT'}]",2021-09-24,"[['Angelopoulos', 'Constantinos Marios', ''], ['Filios', 'Gabriel', ''], ['Nikoletseas', 'Sotiris', ''], ['Raptis', 'Theofanis P.', '']]","['Smart farming', 'edge computing', 'network architecture']"
6693,1706.10188,Siwar Jendoubi,Siwar Jendoubi and Arnaud Martin,"A reliability-based approach for influence maximization using the
  evidence theory","14 pages, 8 figures, DaWak 2017 conference",,10.1007/978-3-319-64283-3_23,,cs.SI cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The influence maximization is the problem of finding a set of social network
users, called influencers, that can trigger a large cascade of propagation.
Influencers are very beneficial to make a marketing campaign goes viral through
social networks for example. In this paper, we propose an influence measure
that combines many influence indicators. Besides, we consider the reliability
of each influence indicator and we present a distance-based process that allows
to estimate the reliability of each indicator. The proposed measure is defined
under the framework of the theory of belief functions. Furthermore, the
reliability-based influence measure is used with an influence maximization
model to select a set of users that are able to maximize the influence in the
network. Finally, we present a set of experiments on a dataset collected from
Twitter. These experiments show the performance of the proposed solution in
detecting social influencers with good quality.
","[{'version': 'v1', 'created': 'Fri, 30 Jun 2017 13:23:56 GMT'}]",2017-08-29,"[['Jendoubi', 'Siwar', ''], ['Martin', 'Arnaud', '']]","['Influence measure', 'influence maximization', 'theory of belieffunctions', 'reliability', 'social network']"
6694,2101.07314,Takuma Yagi,"Takuma Yagi, Takumi Nishiyasu, Kunimasa Kawasaki, Moe Matsuki, Yoichi
  Sato","GO-Finder: A Registration-Free Wearable System for Assisting Users in
  Finding Lost Objects via Hand-Held Object Discovery","13 pages, 13 figures, ACM IUI 2021",,10.1145/3397481.3450664,,cs.HC cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  People spend an enormous amount of time and effort looking for lost objects.
To help remind people of the location of lost objects, various computational
systems that provide information on their locations have been developed.
However, prior systems for assisting people in finding objects require users to
register the target objects in advance. This requirement imposes a cumbersome
burden on the users, and the system cannot help remind them of unexpectedly
lost objects. We propose GO-Finder (""Generic Object Finder""), a
registration-free wearable camera based system for assisting people in finding
an arbitrary number of objects based on two key features: automatic discovery
of hand-held objects and image-based candidate selection. Given a video taken
from a wearable camera, Go-Finder automatically detects and groups hand-held
objects to form a visual timeline of the objects. Users can retrieve the last
appearance of the object by browsing the timeline through a smartphone app. We
conducted a user study to investigate how users benefit from using GO-Finder
and confirmed improved accuracy and reduced mental load regarding the object
search task by providing clear visual cues on object locations.
","[{'version': 'v1', 'created': 'Mon, 18 Jan 2021 20:04:56 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Feb 2021 11:16:44 GMT'}]",2021-02-15,"[['Yagi', 'Takuma', ''], ['Nishiyasu', 'Takumi', ''], ['Kawasaki', 'Kunimasa', ''], ['Matsuki', 'Moe', ''], ['Sato', 'Yoichi', '']]","['Memory aid', 'lost objects', 'wearable camera', 'object discovery', 'handobject interaction']"
6695,2203.14614,Augusto Modanese,Augusto Modanese,Sublinear-Time Probabilistic Cellular Automata,"27 pages, 4 figures. To appear in STACS 2023",,10.4230/LIPIcs.STACS.2023.29,,cs.FL cs.CC,http://creativecommons.org/licenses/by/4.0/,"  We propose and investigate a probabilistic model of sublinear-time
one-dimensional cellular automata. In particular, we modify the model of ACA
(which are cellular automata that accept if and only if all cells
simultaneously accept) so that every cell changes its state not only dependent
on the states it sees in its neighborhood but also on an unbiased coin toss of
its own. The resulting model is dubbed probabilistic ACA (PACA). We consider
one- and two-sided error versions of the model (in the same spirit as the
classes $\mathsf{RP}$ and $\mathsf{BPP}$) and establish a separation between
the classes of languages they can recognize all the way up to $o(\sqrt{n})$
time. As a consequence, we have a $\Omega(\sqrt{n})$ lower bound for
derandomizing constant-time one-sided error PACAs (using deterministic ACAs).
We also prove that derandomization of $T(n)$-time PACAs (to polynomial-time
deterministic cellular automata) for various regimes of $T(n) = \omega(\log n)$
implies non-trivial derandomization results for the class $\mathsf{RP}$ (e.g.,
$\mathsf{P} = \mathsf{RP}$). The main contribution is an almost full
characterization of the constant-time PACA classes: For one-sided error, the
class equals that of the deterministic model; that is, constant-time one-sided
error PACAs can be fully derandomized with only a constant multiplicative
overhead in time complexity. As for two-sided error, we identify a natural
class we call the linearly testable languages ($\mathsf{LLT}$) and prove that
the languages decidable by constant-time two-sided error PACAs are ""sandwiched""
in-between the closure of $\mathsf{LLT}$ under union and intersection and the
class of locally threshold testable languages ($\mathsf{LTT}$).
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2022 09:51:29 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Apr 2022 14:32:33 GMT'}, {'version': 'v3', 'created': 'Mon, 27 Jun 2022 14:54:48 GMT'}, {'version': 'v4', 'created': 'Tue, 3 Jan 2023 09:38:52 GMT'}]",2023-01-04,"[['Modanese', 'Augusto', '']]","['Cellular automata', 'local computation', 'probabilistic models', 'subregularlanguage classes']"
6696,2106.05230,Javier Barbero-G\'omez,"Javier Barbero-G\'omez, Pedro-Antonio Guti\'errez, V\'ictor-Manuel
  Vargas, Juan-Antonio Vallejo-Casas, C\'esar Herv\'as-Mart\'inez","An ordinal CNN approach for the assessment of neurological damage in
  Parkinson's disease patients","To be published in Expert Systems with Applications, 33 pages, 6
  figures",,10.1016/j.eswa.2021.115271,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  3D image scans are an assessment tool for neurological damage in Parkinson's
disease (PD) patients. This diagnosis process can be automatized to help
medical staff through Decision Support Systems (DSSs), and Convolutional Neural
Networks (CNNs) are good candidates, because they are effective when applied to
spatial data. This paper proposes a 3D CNN ordinal model for assessing the
level or neurological damage in PD patients. Given that CNNs need large
datasets to achieve acceptable performance, a data augmentation method is
adapted to work with spatial data. We consider the Ordinal Graph-based
Oversampling via Shortest Paths (OGO-SP) method, which applies a gamma
probability distribution for inter-class data generation. A modification of
OGO-SP is proposed, the OGO-SP-$\beta$ algorithm, which applies the beta
distribution for generating synthetic samples in the inter-class region, a
better suited distribution when compared to gamma. The evaluation of the
different methods is based on a novel 3D image dataset provided by the Hospital
Universitario 'Reina Sof\'ia' (C\'ordoba, Spain). We show how the ordinal
methodology improves the performance with respect to the nominal one, and how
OGO-SP-$\beta$ yields better performance than OGO-SP.
","[{'version': 'v1', 'created': 'Mon, 31 May 2021 15:38:59 GMT'}]",2021-06-10,"[['Barbero-Gómez', 'Javier', ''], ['Gutiérrez', 'Pedro-Antonio', ''], ['Vargas', 'Víctor-Manuel', ''], ['Vallejo-Casas', 'Juan-Antonio', ''], ['Hervás-Martínez', 'César', '']]","['Artificial Neural Networks', 'Ordinal Classification', 'Dataaugmentation', 'Computer-Aided Diagnosis']"
6697,2103.03556,Yunior Ramirez-Cruz,"Jesse Laeuchli, Yunior Ram\'irez-Cruz, Rolando Trujillo-Rasua",Analysis of centrality measures under differential privacy models,,"Applied Mathematics and Computation, 412, 2022",10.1016/j.amc.2021.126546,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper provides the first analysis of the differentially private
computation of three centrality measures, namely eigenvector, Laplacian and
closeness centralities, on arbitrary weighted graphs, using the smooth
sensitivity approach. We do so by finding lower bounds on the amounts of noise
that a randomised algorithm needs to add in order to make the output of each
measure differentially private. Our results indicate that these computations
are either infeasible, in the sense that there are large families of graphs for
which smooth sensitivity is unbounded; or impractical, in the sense that even
for the cases where smooth sensitivity is bounded, the required amounts of
noise result in unacceptably large utility losses.
","[{'version': 'v1', 'created': 'Fri, 5 Mar 2021 09:31:27 GMT'}]",2021-08-17,"[['Laeuchli', 'Jesse', ''], ['Ramírez-Cruz', 'Yunior', ''], ['Trujillo-Rasua', 'Rolando', '']]","['social networks', 'centrality', 'differential privacy']"
6698,2212.11763,Mattia Fumagalli,"Gal Engelberg, Mattia Fumagalli, Adrian Kuboszek, Dan Klein, Pnina
  Soffer, Giancarlo Guizzardi",Towards an Ontology-Driven Approach for Process-Aware Risk Propagation,,,10.1145/3555776.3577795,,cs.IT cs.SE math.IT,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The rapid development of cyber-physical systems creates an increasing demand
for a general approach to risk, especially considering how physical and digital
components affect the processes of the system itself. In risk analytics and
management, risk propagation is a central technique, which allows the
calculation of the cascading effect of risk within a system and supports risk
mitigation activities. However, one open challenge is to devise a process-aware
risk propagation solution that can be used to assess the impact of risk at
different levels of abstraction, accounting for actors, processes,
physical-digital objects, and their interrelations. To address this challenge,
we propose a process-aware risk propagation approach that builds on two main
components: i. an ontology, which supports functionalities typical of Semantic
Web technologies (SWT), and semantics-based intelligent systems, representing a
system with processes and objects having different levels of abstraction, and
ii. a method to calculate the propagation of risk within the given system. We
implemented our approach in a proof-of-concept tool, which was validated and
demonstrated in the cybersecurity domain.
","[{'version': 'v1', 'created': 'Thu, 22 Dec 2022 14:56:41 GMT'}]",2022-12-23,"[['Engelberg', 'Gal', ''], ['Fumagalli', 'Mattia', ''], ['Kuboszek', 'Adrian', ''], ['Klein', 'Dan', ''], ['Soffer', 'Pnina', ''], ['Guizzardi', 'Giancarlo', '']]","['Risk propagation', 'risk assessment', 'ontology-driven risk propagation', 'risk', 'ontology']"
6699,2110.07018,Yuxiang Peng,"Yuxiang Peng, Mingsheng Ying, Xiaodi Wu","Algebraic Reasoning of Quantum Programs via Non-idempotent Kleene
  Algebra","extended version, 23 pages, 6 figures, to appear at the 43rd ACM
  SIGPLAN PLDI 2022",,10.1145/3519939.3523713,,cs.PL quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the algebraic reasoning of quantum programs inspired by the
success of classical program analysis based on Kleene algebra. One prominent
example of such is the famous Kleene Algebra with Tests (KAT), which has
furnished both theoretical insights and practical tools. The succinctness of
algebraic reasoning would be especially desirable for scalable analysis of
quantum programs, given the involvement of exponential-size matrices in most of
the existing methods. A few key features of KAT including the idempotent law
and the nice properties of classical tests, however, fail to hold in the
context of quantum programs due to their unique quantum features, especially in
branching. We propose Non-idempotent Kleene Algebra (NKA) as a natural
alternative and identify complete and sound semantic models for NKA as well as
their quantum interpretations. In light of applications of KAT, we demonstrate
algebraic proofs in NKA of quantum compiler optimization and the normal form of
quantum while-programs. Moreover, we extend NKA with Tests (i.e., NKAT), where
tests model quantum predicates following effect algebra, and illustrate how to
encode propositional quantum Hoare logic as NKAT theorems.
","[{'version': 'v1', 'created': 'Wed, 13 Oct 2021 20:27:01 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Mar 2022 03:27:57 GMT'}]",2022-03-30,"[['Peng', 'Yuxiang', ''], ['Ying', 'Mingsheng', ''], ['Wu', 'Xiaodi', '']]","['non-idempotent Kleene algebra', 'compiler optimization', 'normal form theorem', 'quantum Hoare logic']"
6700,2204.10936,Adam B. Block,"Adam Block, Rahul Kidambi, Daniel N. Hill, Thorsten Joachims, and
  Inderjit S. Dhillon","Counterfactual Learning To Rank for Utility-Maximizing Query
  Autocompletion",,,10.1145/3477495.3531958,,cs.IR cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Conventional methods for query autocompletion aim to predict which completed
query a user will select from a list. A shortcoming of this approach is that
users often do not know which query will provide the best retrieval performance
on the current information retrieval system, meaning that any query
autocompletion methods trained to mimic user behavior can lead to suboptimal
query suggestions. To overcome this limitation, we propose a new approach that
explicitly optimizes the query suggestions for downstream retrieval
performance. We formulate this as a problem of ranking a set of rankings, where
each query suggestion is represented by the downstream item ranking it
produces. We then present a learning method that ranks query suggestions by the
quality of their item rankings. The algorithm is based on a counterfactual
learning approach that is able to leverage feedback on the items (e.g., clicks,
purchases) to evaluate query suggestions through an unbiased estimator, thus
avoiding the assumption that users write or select optimal queries. We
establish theoretical support for the proposed approach and provide
learning-theoretic guarantees. We also present empirical results on publicly
available datasets, and demonstrate real-world applicability using data from an
online shopping store.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2022 21:40:51 GMT'}]",2022-04-26,"[['Block', 'Adam', ''], ['Kidambi', 'Rahul', ''], ['Hill', 'Daniel N.', ''], ['Joachims', 'Thorsten', ''], ['Dhillon', 'Inderjit S.', '']]","['Query Auto-Complete', 'Learning to Rank', 'Counterfactual Estimation']"
6701,2005.13400,Byunghyun Ban,Byunghyun Ban,"Deep learning method to remove chemical, kinetic and electric artifacts
  on ISEs",,"2020 International Conference on Information and Communication
  Technology Convergence (ICTC)",10.1109/ICTC49870.2020.9289083,,cs.LG eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We suggest a deep learning based sensor signal processing method to remove
chemical, kinetic and electrical artifacts from ion selective electrodes'
measured values. An ISE is used to investigate the concentration of a specific
ion from aqueous solution, by measuring the Nernst potential along the glass
membrane. However, application of ISE on a mixture of multiple ion has some
problem. First problem is a chemical artifact which is called ion interference
effect. Electrically charged particles interact with each other and flows
through the glass membrane of different ISEs. Second problem is the kinetic
artifact caused by the movement of the liquid. Water molecules collide with the
glass membrane causing abnormal peak values of voltage. The last artifact is
the interference of ISEs. When multiple ISEs are dipped into same solution, one
electrode's signal emission interference voltage measurement of other
electrodes. Therefore, an ISE is recommended to be applied on single-ion
solution, without any other sensors applied at the same time. Deep learning
approach can remove both 3 artifacts at the same time. The proposed method used
5 layers of artificial neural networks to regress correct signal to remove
complex artifacts with one-shot calculation. Its MAPE was less than 1.8% and R2
of regression was 0.997. A randomly chosen value of AI-processed data has MAPE
less than 5% (p-value 0.016).
","[{'version': 'v1', 'created': 'Wed, 20 May 2020 12:48:32 GMT'}, {'version': 'v2', 'created': 'Thu, 28 May 2020 00:26:41 GMT'}, {'version': 'v3', 'created': 'Fri, 5 Jun 2020 07:56:16 GMT'}, {'version': 'v4', 'created': 'Thu, 15 Oct 2020 07:16:45 GMT'}]",2020-12-24,"[['Ban', 'Byunghyun', '']]","['AI', 'Machine Learning', 'ISE', 'Analog Signal Processing', 'Horticulture', 'Aqua Culture']"
6702,2208.04505,Ahmed M. Abdelmoniem,Amna Arouj and Ahmed M. Abdelmoniem,Towards Energy-Aware Federated Learning on Battery-Powered Clients,Accepted in FedEdge workshop of ACM MobiCom 2022,,10.1145/3556557.3557952,,cs.LG cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Federated learning (FL) is a newly emerged branch of AI that facilitates edge
devices to collaboratively train a global machine learning model without
centralizing data and with privacy by default. However, despite the remarkable
advancement, this paradigm comes with various challenges. Specifically, in
large-scale deployments, client heterogeneity is the norm which impacts
training quality such as accuracy, fairness, and time. Moreover, energy
consumption across these battery-constrained devices is largely unexplored and
a limitation for wide-adoption of FL. To address this issue, we develop EAFL,
an energy-aware FL selection method that considers energy consumption to
maximize the participation of heterogeneous target devices. EAFL is a
power-aware training algorithm that cherry-picks clients with higher battery
levels in conjunction with its ability to maximize the system efficiency. Our
design jointly minimizes the time-to-accuracy and maximizes the remaining
on-device battery levels. EAFLimproves the testing model accuracy by up to 85\%
and decreases the drop-out of clients by up to 2.45$\times$.
","[{'version': 'v1', 'created': 'Tue, 9 Aug 2022 02:15:45 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Aug 2022 00:39:29 GMT'}]",2022-08-26,"[['Arouj', 'Amna', ''], ['Abdelmoniem', 'Ahmed M.', '']]","['Federated Learning', 'Heterogeneity', 'Performance', 'Fairness']"
6703,1802.03568,Francisco Charte,"Francisco Charte and Antonio J. Rivera and David Charte and Mar\'ia J.
  del Jesus and Francisco Herrera","Tips, guidelines and tools for managing multi-label datasets: the
  mldr.datasets R package and the Cometa data repository",,,10.1016/j.neucom.2018.02.011,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  New proposals in the field of multi-label learning algorithms have been
growing in number steadily over the last few years. The experimentation
associated with each of them always goes through the same phases: selection of
datasets, partitioning, training, analysis of results and, finally, comparison
with existing methods. This last step is often hampered since it involves using
exactly the same datasets, partitioned in the same way and using the same
validation strategy. In this paper we present a set of tools whose objective is
to facilitate the management of multi-label datasets, aiming to standardize the
experimentation procedure. The two main tools are an R package, mldr.datasets,
and a web repository with datasets, Cometa. Together, these tools will simplify
the collection of datasets, their partitioning, documentation and export to
multiple formats, among other functions. Some tips, recommendations and
guidelines for a good experimental analysis of multi-label methods are also
presented.
","[{'version': 'v1', 'created': 'Sat, 10 Feb 2018 11:30:31 GMT'}]",2018-02-13,"[['Charte', 'Francisco', ''], ['Rivera', 'Antonio J.', ''], ['Charte', 'David', ''], ['del Jesus', 'María J.', ''], ['Herrera', 'Francisco', '']]","['multi-label', 'software', 'tools', 'datasets', 'repository']"
6704,1712.02141,Emekcan Aras,"Emekcan Aras, Nicolas Small, Gowri Sankar Ramachandran, St\'ephane
  Delbruel, Wouter Joosen and Danny Hughes",Selective Jamming of LoRaWAN using Commodity Hardware,"Mobiquitous 2017, November 7-10, 2017, Melbourne, VIC, Australia",,10.1145/3144457.3144478,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Long range, low power networks are rapidly gaining acceptance in the Internet
of Things (IoT) due to their ability to economically support long-range sensing
and control applications while providing multi-year battery life. LoRa is a key
example of this new class of network and is being deployed at large scale in
several countries worldwide. As these networks move out of the lab and into the
real world, they expose a large cyber-physical attack surface. Securing these
networks is therefore both critical and urgent. This paper highlights security
issues in LoRa and LoRaWAN that arise due to the choice of a robust but slow
modulation type in the protocol. We exploit these issues to develop a suite of
practical attacks based around selective jamming. These attacks are conducted
and evaluated using commodity hardware. The paper concludes by suggesting a
range of countermeasures that can be used to mitigate the attacks.
","[{'version': 'v1', 'created': 'Wed, 6 Dec 2017 11:43:16 GMT'}]",2017-12-07,"[['Aras', 'Emekcan', ''], ['Small', 'Nicolas', ''], ['Ramachandran', 'Gowri Sankar', ''], ['Delbruel', 'Stéphane', ''], ['Joosen', 'Wouter', ''], ['Hughes', 'Danny', '']]","['IoT', 'Security', 'LPWAN', 'LoRa', 'LoRaWAN']"
6705,2009.14279,Logan Beaver,Logan E. Beaver and Andreas A. Malikopoulos,An Overview on Optimal Flocking,"21 pages, 5 figures","Annual Reviews in Control, April 2021",10.1016/j.arcontrol.2021.03.004,,cs.MA math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The study of robotic flocking has received considerable attention in the past
twenty years. As we begin to deploy flocking control algorithms on physical
multi-agent and swarm systems, there is an increasing necessity for rigorous
promises on safety and performance. In this paper, we present an overview the
literature focusing on optimization approaches to achieve flocking behavior
that provide strong safety guarantees. We separate the literature into cluster
and line flocking, and categorize cluster flocking with respect to the
system-level objective, which may be realized by a reactive or planning control
algorithm. We also categorize the line flocking literature by the energy-saving
mechanism that is exploited by the agents. We present several approaches aimed
at minimizing the communication and computational requirements in real systems
via neighbor filtering and event-driven planning, and conclude with our
perspective on the outlook and future research direction of optimal flocking as
a field.
","[{'version': 'v1', 'created': 'Tue, 29 Sep 2020 19:44:49 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Jan 2021 15:12:18 GMT'}]",2021-05-11,"[['Beaver', 'Logan E.', ''], ['Malikopoulos', 'Andreas A.', '']]","['Flocking', 'optimization', 'emergence', 'multi-agent systems', 'swarm systems']"
6706,2205.10492,Hao Wang,Hao Wang,"Theoretically Accurate Regularization Technique for Matrix Factorization
  based Recommender Systems",,,10.1145/3507548.3507587,,cs.LG cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Regularization is a popular technique to solve the overfitting problem of
machine learning algorithms. Most regularization technique relies on parameter
selection of the regularization coefficient. Plug-in method and
cross-validation approach are two most common parameter selection approaches
for regression methods such as Ridge Regression, Lasso Regression and Kernel
Regression. Matrix factorization based recommendation system also has heavy
reliance on the regularization technique. Most people select a single scalar
value to regularize the user feature vector and item feature vector
independently or collectively. In this paper, we prove that such approach of
selecting regularization coefficient is invalid, and we provide a theoretically
accurate method that outperforms the most widely used approach in both accuracy
and fairness metrics.
","[{'version': 'v1', 'created': 'Sat, 21 May 2022 02:54:50 GMT'}]",2022-05-24,"[['Wang', 'Hao', '']]","['regularization', 'matrix factorization', 'recommender system', 'overfitting']"
6707,2106.04134,Hoang Nguyen Hung Van,"Hoang Van, Vikas Yadav, Mihai Surdeanu","Cheap and Good? Simple and Effective Data Augmentation for Low Resource
  Machine Reading","5 pages, 1 figure, SIGIR 2021",,10.1145/3404835.3463099,,cs.CL cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a simple and effective strategy for data augmentation for
low-resource machine reading comprehension (MRC). Our approach first pretrains
the answer extraction components of a MRC system on the augmented data that
contains approximate context of the correct answers, before training it on the
exact answer spans. The approximate context helps the QA method components in
narrowing the location of the answers. We demonstrate that our simple strategy
substantially improves both document retrieval and answer extraction
performance by providing larger context of the answers and additional training
data. In particular, our method significantly improves the performance of BERT
based retriever (15.12\%), and answer extractor (4.33\% F1) on TechQA, a
complex, low-resource MRC task. Further, our data augmentation strategy yields
significant improvements of up to 3.9\% exact match (EM) and 2.7\% F1 for
answer extraction on PolicyQA, another practical but moderate sized QA dataset
that also contains long answer spans.
","[{'version': 'v1', 'created': 'Tue, 8 Jun 2021 06:46:50 GMT'}]",2021-06-09,"[['Van', 'Hoang', ''], ['Yadav', 'Vikas', ''], ['Surdeanu', 'Mihai', '']]","['Data augmentation', 'Question answering', 'Document retrieval']"
6708,2009.01654,Arthur-Jozsef Molnar,Iuliana Marin and Maria-Iuliana Bocicor and Arthur-Jozsef Molnar,Indoor Localization Techniques Within a Home Monitoring Platform,,"Damiani E., Spanoudakis G., Maciaszek L. (eds) Evaluation of Novel
  Approaches to Software Engineering. ENASE 2019. Communications in Computer
  and Information Science, vol 1172. Springer, Cham",10.1007/978-3-030-40223-5_19,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper details a number of indoor localization techniques developed for
real-time monitoring of older adults. These were developed within the framework
of the i-Light research project that was funded by the European Union. The
project targeted the development and initial evaluation of a configurable and
cost-effective cyber-physical system for monitoring the safety of older adults
who are living in their own homes. Localization hardware consists of a number
of custom-developed devices that replace existing luminaires. In addition to
lighting capabilities, they measure the strength of a Bluetooth Low Energy
signal emitted by a wearable device on the user. Readings are recorded in real
time and sent to a software server for analysis. We present a comparative
evaluation of the accuracy achieved by several server-side algorithms,
including Kalman filtering, a look-back heuristic as well as a neural
network-based approach. It is known that approaches based on measuring signal
strength are sensitive to the placement of walls, construction materials used,
the presence of doors as well as existing furniture. As such, we evaluate the
proposed approaches in two separate locations having distinct building
characteristics. We show that the proposed techniques improve the accuracy of
localization. As the final step, we evaluate our results against comparable
existing approaches.
","[{'version': 'v1', 'created': 'Thu, 3 Sep 2020 13:40:13 GMT'}]",2020-09-04,"[['Marin', 'Iuliana', ''], ['Bocicor', 'Maria-Iuliana', ''], ['Molnar', 'Arthur-Jozsef', '']]","['indoor localization', 'received signal strength', 'trilateration', 'kalman filter', 'neural network']"
6709,2006.05158,Liangzu Peng,Liangzu Peng and Manolis C. Tsakiris,Homomorphic Sensing of Subspace Arrangements,18 pages,"Applied and Computational Harmonic Analysis, 55, 466-485 (2021)",10.1016/j.acha.2021.06.008,,cs.LG math.AG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Homomorphic sensing is a recent algebraic-geometric framework that studies
the unique recovery of points in a linear subspace from their images under a
given collection of linear maps. It has been successful in interpreting such a
recovery in the case of permutations composed by coordinate projections, an
important instance in applications known as unlabeled sensing, which models
data that are out of order and have missing values. In this paper, we provide
tighter and simpler conditions that guarantee the unique recovery for the
single-subspace case, extend the result to the case of a subspace arrangement,
and show that the unique recovery in a single subspace is locally stable under
noise. We specialize our results to several examples of homomorphic sensing
such as real phase retrieval and unlabeled sensing. In so doing, in a unified
way, we obtain conditions that guarantee the unique recovery for those
examples, typically known via diverse techniques in the literature, as well as
novel conditions for sparse and unsigned versions of unlabeled sensing.
Similarly, our noise result also implies that the unique recovery in unlabeled
sensing is locally stable.
","[{'version': 'v1', 'created': 'Tue, 9 Jun 2020 09:52:15 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Dec 2020 03:27:36 GMT'}, {'version': 'v3', 'created': 'Tue, 1 Jun 2021 06:36:14 GMT'}, {'version': 'v4', 'created': 'Mon, 19 Sep 2022 14:13:47 GMT'}]",2022-09-20,"[['Peng', 'Liangzu', ''], ['Tsakiris', 'Manolis C.', '']]","['homomorphic sensing', 'unlabeled sensing', 'linear regression without correspondences', 'real phaseretrieval', 'mixed linear regression', 'algebraic geometry']"
6710,1702.03880,Timo Kumberg,"Timo Kumberg, Marc Schink, Leonhard Reindl, Christian Schindelhauer","T-ROME: A Simple and Energy Efficient Tree Routing Protocol for
  Low-Power Wake-up Receivers",,,10.1016/j.adhoc.2017.02.003,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless sensor networks are deployed in many monitoring applications but
still suffer from short lifetimes originating from limited energy sources and
storages. Due to their low-power consumption and their on-demand communication
ability, wake-up receivers represent an energy efficient and simple enhancement
to wireless sensor nodes and wireless sensor network protocols. In this
context, wake-up receivers have the ability to increase the network lifetime.
In this article, we present T-ROME, a simple and energy efficient cross-layer
routing protocol for wireless sensor nodes containing wake-up receivers. The
protocol makes use of the different transmission ranges of wake-up and main
radios in order to save energy by skipping nodes during data transfer. With
respect to energy consumption and latency, T-ROME outperforms existing
protocols in many scenarios. Here, we describe and analyze the cross layer
multi-hop protocol by means of a Markov chain model that we verify using a
laboratory test setup.
","[{'version': 'v1', 'created': 'Mon, 13 Feb 2017 17:11:17 GMT'}]",2017-02-17,"[['Kumberg', 'Timo', ''], ['Schink', 'Marc', ''], ['Reindl', 'Leonhard', ''], ['Schindelhauer', 'Christian', '']]","['wireless sensor network', 'wake-up receiver', 'cross-layer', 'routing protocol', 'Markov chain model', 'lowlatency', 'energy efficient']"
6711,1604.05479,Andrew Connor,"Jacques Foottit, Dave Brown, Stefan Marks and Andy M. Connor",A wearable haptic game controller,,"International Journal of Game Theory & Technology, 2(1), 1-19
  (2016)",10.5121/ijgtt.2016.2101,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper outlines the development of a wearable game controller
incorporating vibrotacticle haptic feedback that provides a low cost, versatile
and intuitive interface for controlling digital games. The device differs from
many traditional haptic feedback implementation in that it combines
vibrotactile based haptic feedback with gesture based input, thus becoming a
two way conduit between the user and the virtual environment. The device is
intended to challenge what is considered an ""interface"" and draws on work in
the area of Actor-Network theory to purposefully blur the boundary between man
and machine. This allows for a more immersive experience, so rather than making
the user feel like they are controlling an aircraft the intuitive interface
allows the user to become the aircraft that is controlled by the movements of
the user's hand. This device invites playful action and thrill. It bridges new
territory on portable and low cost solutions for haptic controllers in a gaming
context.
","[{'version': 'v1', 'created': 'Tue, 19 Apr 2016 09:04:34 GMT'}]",2016-04-20,"[['Foottit', 'Jacques', ''], ['Brown', 'Dave', ''], ['Marks', 'Stefan', ''], ['Connor', 'Andy M.', '']]","['Wearable Computing', 'Haptic Devices', 'Vibrotactile Feedback', 'Actor-Network Theory', 'Game Controllers', 'Tangible Interfaces']"
6712,1704.01889,Farhan Khawar,"Farhan Khawar, Nevin L. Zhang",Conformative Filtering for Implicit Feedback Data,,,10.1007/978-3-030-15712-8_11,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Implicit feedback is the simplest form of user feedback that can be used for
item recommendation. It is easy to collect and is domain independent. However,
there is a lack of negative examples. Previous work tackles this problem by
assuming that users are not interested or not as much interested in the
unconsumed items. Those assumptions are often severely violated since
non-consumption can be due to factors like unawareness or lack of resources.
Therefore, non-consumption by a user does not always mean disinterest or
irrelevance. In this paper, we propose a novel method called Conformative
Filtering (CoF) to address the issue. The motivating observation is that if
there is a large group of users who share the same taste and none of them have
consumed an item before, then it is likely that the item is not of interest to
the group. We perform multidimensional clustering on implicit feedback data
using hierarchical latent tree analysis (HLTA) to identify user `tastes' groups
and make recommendations for a user based on her memberships in the groups and
on the past behavior of the groups. Experiments on two real-world datasets from
different domains show that CoF has superior performance compared to several
common baselines.
","[{'version': 'v1', 'created': 'Thu, 6 Apr 2017 15:31:48 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Apr 2019 18:17:56 GMT'}]",2019-04-19,"[['Khawar', 'Farhan', ''], ['Zhang', 'Nevin L.', '']]","['Implicit Feedback', 'One class Collaborative Filtering', 'RecommenderSystems']"
6713,2210.14981,Saravanabalagi Ramachandran,"Saravanabalagi Ramachandran, Jonathan Horgan, Ganesh Sistu, and John
  McDonald","Fast and Efficient Scene Categorization for Autonomous Driving using
  VAEs","Published in the 24th Irish Machine Vision and Image Processing
  Conference (IMVIP 2022)","The 24th Irish Machine Vision and Image Processing Conference
  (IMVIP), 2022, 9-16",10.56541/SUHE3553,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Scene categorization is a useful precursor task that provides prior knowledge
for many advanced computer vision tasks with a broad range of applications in
content-based image indexing and retrieval systems. Despite the success of data
driven approaches in the field of computer vision such as object detection,
semantic segmentation, etc., their application in learning high-level features
for scene recognition has not achieved the same level of success. We propose to
generate a fast and efficient intermediate interpretable generalized global
descriptor that captures coarse features from the image and use a
classification head to map the descriptors to 3 scene categories: Rural, Urban
and Suburban. We train a Variational Autoencoder in an unsupervised manner and
map images to a constrained multi-dimensional latent space and use the latent
vectors as compact embeddings that serve as global descriptors for images. The
experimental results evidence that the VAE latent vectors capture coarse
information from the image, supporting their usage as global descriptors. The
proposed global descriptor is very compact with an embedding length of 128,
significantly faster to compute, and is robust to seasonal and illuminational
changes, while capturing sufficient scene information required for scene
categorization.
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2022 18:50:15 GMT'}]",2022-10-28,"[['Ramachandran', 'Saravanabalagi', ''], ['Horgan', 'Jonathan', ''], ['Sistu', 'Ganesh', ''], ['McDonald', 'John', '']]","['Scene Categorization', 'Image Embeddings', 'Coarse Features', 'Variational Autoencoders']"
6714,1810.01069,Zhengyi Luo,"Zhengyi Luo, Austin Small, Liam Dugan, Stephen Lane","Cloud Chaser: Real Time Deep Learning Computer Vision on Low Computing
  Power Devices","Accepted to The 11th International Conference on Machine Vision (ICMV
  2018). Project site: https://zhengyiluo.github.io/projects/cloudchaser/",,10.1117/12.2523087,,cs.CV,http://creativecommons.org/licenses/by-sa/4.0/,"  Internet of Things(IoT) devices, mobile phones, and robotic systems are often
denied the power of deep learning algorithms due to their limited computing
power. However, to provide time-critical services such as emergency response,
home assistance, surveillance, etc, these devices often need real-time analysis
of their camera data. This paper strives to offer a viable approach to
integrate high-performance deep learning-based computer vision algorithms with
low-resource and low-power devices by leveraging the computing power of the
cloud. By offloading the computation work to the cloud, no dedicated hardware
is needed to enable deep neural networks on existing low computing power
devices. A Raspberry Pi based robot, Cloud Chaser, is built to demonstrate the
power of using cloud computing to perform real-time vision tasks. Furthermore,
to reduce latency and improve real-time performance, compression algorithms are
proposed and evaluated for streaming real-time video frames to the cloud.
","[{'version': 'v1', 'created': 'Tue, 2 Oct 2018 05:08:12 GMT'}, {'version': 'v2', 'created': 'Sun, 8 Nov 2020 22:00:53 GMT'}]",2020-11-10,"[['Luo', 'Zhengyi', ''], ['Small', 'Austin', ''], ['Dugan', 'Liam', ''], ['Lane', 'Stephen', '']]","['Deep Learning', 'Computer Vision', 'real-time computing', 'Cloud Computing', 'Mobile Computing']"
6715,2112.10973,Yosuke Mizutani,"Yosuke Mizutani, Annie Staker and Blair D. Sullivan",Minimizing Congestion for Balanced Dominators,,,10.1145/3534678.3539371,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  A primary challenge in metagenomics is reconstructing individual microbial
genomes from the mixture of short fragments created by sequencing. Recent work
leverages the sparsity of the assembly graph to find $r$-dominating sets which
enable rapid approximate queries through a dominator-centric graph partition.
In this paper, we consider two problems related to reducing uncertainty and
improving scalability in this setting.
  First, we observe that nodes with multiple closest dominators necessitate
arbitrary tie-breaking in the existing pipeline. As such, we propose finding
$\textit{sparse}$ dominating sets which minimize this effect via a new
$\textit{congestion}$ parameter. We prove minimizing congestion is NP-hard, and
give an $\mathcal{O}(\sqrt{\Delta^r})$ approximation algorithm, where $\Delta$
is the max degree.
  To improve scalability, the graph should be partitioned into uniformly sized
pieces, subject to placing vertices with a closest dominator. This leads to
$\textit{balanced neighborhood partitioning}$: given an $r$-dominating set,
find a partition into connected subgraphs with optimal uniformity so that each
vertex is co-assigned with some closest dominator. Using variance of piece
sizes to measure uniformity, we show this problem is NP-hard iff $r$ is greater
than $1$. We design and analyze several algorithms, including a polynomial-time
approach which is exact when $r=1$ (and heuristic otherwise).
  We complement our theoretical results with computational experiments on a
corpus of real-world networks showing sparse dominating sets lead to more
balanced neighborhood partitionings. Further, on the metagenome
$\textsf{HuSB1}$, our approach maintains high query containment and similarity
while reducing piece size variance.
","[{'version': 'v1', 'created': 'Tue, 21 Dec 2021 04:05:50 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Jul 2022 07:59:59 GMT'}]",2023-01-24,"[['Mizutani', 'Yosuke', ''], ['Staker', 'Annie', ''], ['Sullivan', 'Blair D.', '']]","['dominating sets', 'congestion', 'graph partitioning', 'metagenomics']"
6716,2105.02956,Pierre-Alain Fayolle,Markus Friedrich and Pierre-Alain Fayolle,Reconstruction of Convex Polytope Compositions from 3D Point-clouds,"In Proceedings of the 16th International Joint Conference on Computer
  Vision, Imaging and Computer Graphics Theory and Applications - Volume 1:
  GRAPP, ISBN 978-989-758-488-6 ISSN 2184-4321, pages 75-84",,10.5220/0010297100750084,,cs.CV cs.CG,http://creativecommons.org/licenses/by/4.0/,"  Reconstructing a composition (union) of convex polytopes that perfectly fits
the corresponding input point-cloud is a hard optimization problem with
interesting applications in reverse engineering and rigid body dynamics
simulations. We propose a pipeline that first extracts a set of planes, then
partitions the input point-cloud into weakly convex clusters and finally
generates a set of convex polytopes as the intersection of fitted planes for
each partition. Finding the best-fitting convex polytopes is formulated as a
combinatorial optimization problem over the set of fitted planes and is solved
using an Evolutionary Algorithm. For convex clustering, we employ two different
methods and detail their strengths and weaknesses in a thorough evaluation
based on multiple input data-sets.
","[{'version': 'v1', 'created': 'Tue, 27 Apr 2021 00:14:55 GMT'}]",2021-05-10,"[['Friedrich', 'Markus', ''], ['Fayolle', 'Pierre-Alain', '']]","['3D Reconstruction', 'Geometry Processing', 'Spatial Clustering', 'Evolutionary Algorithms']"
6717,2003.12283,Antonio Norelli,"Luca Cosmo, Antonio Norelli, Oshri Halimi, Ron Kimmel, Emanuele
  Rodol\`a","LIMP: Learning Latent Shape Representations with Metric Preservation
  Priors","24 pages (main article 14 + main bibliography 3 + supplementary 6 +
  supplementary bibliography 1)",,10.1007/978-3-030-58580-8_2,,cs.LG cs.CG cs.GR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we advocate the adoption of metric preservation as a powerful
prior for learning latent representations of deformable 3D shapes. Key to our
construction is the introduction of a geometric distortion criterion, defined
directly on the decoded shapes, translating the preservation of the metric on
the decoding to the formation of linear paths in the underlying latent space.
Our rationale lies in the observation that training samples alone are often
insufficient to endow generative models with high fidelity, motivating the need
for large training datasets. In contrast, metric preservation provides a
rigorous way to control the amount of geometric distortion incurring in the
construction of the latent space, leading in turn to synthetic samples of
higher quality. We further demonstrate, for the first time, the adoption of
differentiable intrinsic distances in the backpropagation of a geodesic loss.
Our geometric priors are particularly relevant in the presence of scarce
training data, where learning any meaningful latent structure can be especially
challenging. The effectiveness and potential of our generative model is
showcased in applications of style transfer, content generation, and shape
completion.
","[{'version': 'v1', 'created': 'Fri, 27 Mar 2020 08:53:34 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Sep 2020 13:14:57 GMT'}]",2020-12-14,"[['Cosmo', 'Luca', ''], ['Norelli', 'Antonio', ''], ['Halimi', 'Oshri', ''], ['Kimmel', 'Ron', ''], ['Rodolà', 'Emanuele', '']]","['learning shapes', 'generative model', 'metric distortion']"
6718,1906.02249,Dmitry Kopitkov,Dmitry Kopitkov and Vadim Indelman,"General Purpose Incremental Covariance Update and Efficient Belief Space
  Planning via Factor-Graph Propagation Action Tree",,,10.1177/0278364919875199,,cs.RO stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fast covariance calculation is required both for SLAM (e.g.~in order to solve
data association) and for evaluating the information-theoretic term for
different candidate actions in belief space planning (BSP). In this paper we
make two primary contributions. First, we develop a novel general-purpose
incremental covariance update technique, which efficiently recovers specific
covariance entries after any change in the inference problem, such as
introduction of new observations/variables or re-linearization of the state
vector. Our approach is shown to recover them faster than other
state-of-the-art methods. Second, we present a computationally efficient
approach for BSP in high-dimensional state spaces, leveraging our incremental
covariance update method. State of the art BSP approaches perform belief
propagation for each candidate action and then evaluate an objective function
that typically includes an information-theoretic term, such as entropy or
information gain. Yet, candidate actions often have similar parts (e.g. common
trajectory parts), which are however evaluated separately for each candidate.
Moreover, calculating the information-theoretic term involves a costly
determinant computation of the entire information (covariance) matrix which is
O(n^3) with n being dimension of the state or costly Schur complement
operations if only marginal posterior covariance of certain variables is of
interest. Our approach, rAMDL-Tree, extends our previous BSP method rAMDL, by
exploiting incremental covariance calculation and performing calculation re-use
between common parts of non-myopic candidate actions, such that these parts are
evaluated only once, in contrast to existing approaches.
","[{'version': 'v1', 'created': 'Wed, 5 Jun 2019 18:58:44 GMT'}]",2019-10-08,"[['Kopitkov', 'Dmitry', ''], ['Indelman', 'Vadim', '']]","['Covariance recovery', 'belief space planning', 'active SLAM', 'informative planning', 'active inference', 'autonomous navigation']"
6719,2011.10671,Di Feng,"Di Feng, Ali Harakeh, Steven Waslander, Klaus Dietmayer","A Review and Comparative Study on Probabilistic Object Detection in
  Autonomous Driving","Accepted in the IEEE Transactions on Intelligent Transportation
  Systems",,10.1109/TITS.2021.3096854,,cs.CV cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Capturing uncertainty in object detection is indispensable for safe
autonomous driving. In recent years, deep learning has become the de-facto
approach for object detection, and many probabilistic object detectors have
been proposed. However, there is no summary on uncertainty estimation in deep
object detection, and existing methods are not only built with different
network architectures and uncertainty estimation methods, but also evaluated on
different datasets with a wide range of evaluation metrics. As a result, a
comparison among methods remains challenging, as does the selection of a model
that best suits a particular application. This paper aims to alleviate this
problem by providing a review and comparative study on existing probabilistic
object detection methods for autonomous driving applications. First, we provide
an overview of generic uncertainty estimation in deep learning, and then
systematically survey existing methods and evaluation metrics for probabilistic
object detection. Next, we present a strict comparative study for probabilistic
object detection based on an image detector and three public autonomous driving
datasets. Finally, we present a discussion of the remaining challenges and
future works. Code has been made available at
https://github.com/asharakeh/pod_compare.git
","[{'version': 'v1', 'created': 'Fri, 20 Nov 2020 22:30:36 GMT'}, {'version': 'v2', 'created': 'Sun, 11 Jul 2021 07:04:10 GMT'}]",2021-07-13,"[['Feng', 'Di', ''], ['Harakeh', 'Ali', ''], ['Waslander', 'Steven', ''], ['Dietmayer', 'Klaus', '']]","['Uncertainty estimation', 'object detection', 'deep learning', 'autonomous driving']"
6720,2103.01701,Ab Mosca,"Ab Mosca, Alvitta Ottley, Remco Chang",Does Interaction Improve Bayesian Reasoning with Visualization?,"14 pages, 11 figures, To be published in 2021 ACM CHI Virtual
  Conference on Human Factors in Computing Systems",,10.1145/3411764.3445176,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interaction enables users to navigate large amounts of data effectively,
supports cognitive processing, and increases data representation methods.
However, there have been few attempts to empirically demonstrate whether adding
interaction to a static visualization improves its function beyond popular
beliefs. In this paper, we address this gap. We use a classic Bayesian
reasoning task as a testbed for evaluating whether allowing users to interact
with a static visualization can improve their reasoning. Through two
crowdsourced studies, we show that adding interaction to a static Bayesian
reasoning visualization does not improve participants' accuracy on a Bayesian
reasoning task. In some cases, it can significantly detract from it. Moreover,
we demonstrate that underlying visualization design modulates performance and
that people with high versus low spatial ability respond differently to
different interaction techniques and underlying base visualizations. Our work
suggests that interaction is not as unambiguously good as we often believe; a
well designed static visualization can be as, if not more, effective than an
interactive one.
","[{'version': 'v1', 'created': 'Tue, 2 Mar 2021 13:10:42 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Mar 2021 12:47:39 GMT'}]",2021-03-08,"[['Mosca', 'Ab', ''], ['Ottley', 'Alvitta', ''], ['Chang', 'Remco', '']]","['Data Analysis', 'Reasoning', 'Problem Solving', 'Decision Making', 'Interaction Design', 'Human-Subjects Quantitative Studies']"
6721,1606.03671,Alexandre De Siqueira,"Alexandre Fioravante de Siqueira and Fl\'avio Camargo Cabrera and
  Aylton Pagamisse and Aldo Eloizo Job","Segmentation of scanning electron microscopy images from natural rubber
  samples with gold nanoparticles using starlet wavelets",,,10.1002/jemt.22314,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Electronic microscopy has been used for morphology evaluation of different
materials structures. However, microscopy results may be affected by several
factors. Image processing methods can be used to correct and improve the
quality of these results. In this paper we propose an algorithm based on
starlets to perform the segmentation of scanning electron microscopy images. An
application is presented in order to locate gold nanoparticles in natural
rubber membranes. In this application, our method showed accuracy greater than
85% for all test images. Results given by this method will be used in future
studies, to computationally estimate the density distribution of gold
nanoparticles in natural rubber samples and to predict reduction kinetics of
gold nanoparticles at different time periods.
","[{'version': 'v1', 'created': 'Sun, 12 Jun 2016 06:33:20 GMT'}]",2016-06-14,"[['de Siqueira', 'Alexandre Fioravante', ''], ['Cabrera', 'Flávio Camargo', ''], ['Pagamisse', 'Aylton', ''], ['Job', 'Aldo Eloizo', '']]","['Image Processing', 'Gold Nanoparticles', 'Natural Rubber', 'Scanning Electron Microscopy', 'Segmentation', 'Wavelets']"
6722,2207.13186,Marek Wydmuch,"Erik Schultheis, Marek Wydmuch, Rohit Babbar, Krzysztof Dembczy\'nski","On Missing Labels, Long-tails and Propensities in Extreme Multi-label
  Classification",This is the author's version of the work accepted at KDD '22,,10.1145/3534678.3539466,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The propensity model introduced by Jain et al. 2016 has become a standard
approach for dealing with missing and long-tail labels in extreme multi-label
classification (XMLC). In this paper, we critically revise this approach
showing that despite its theoretical soundness, its application in contemporary
XMLC works is debatable. We exhaustively discuss the flaws of the
propensity-based approach, and present several recipes, some of them related to
solutions used in search engines and recommender systems, that we believe
constitute promising alternatives to be followed in XMLC.
","[{'version': 'v1', 'created': 'Tue, 26 Jul 2022 21:23:23 GMT'}]",2022-07-28,"[['Schultheis', 'Erik', ''], ['Wydmuch', 'Marek', ''], ['Babbar', 'Rohit', ''], ['Dembczyński', 'Krzysztof', '']]","['extreme classification', 'multi-label classification', 'propensity model', 'missing labels', 'long-tail labels', 'recommendation']"
6723,2206.00877,Haoran You,"Haoran You, Cheng Wan, Yang Zhao, Zhongzhi Yu, Yonggan Fu, Jiayi Yuan,
  Shang Wu, Shunyao Zhang, Yongan Zhang, Chaojian Li, Vivek Boominathan, Ashok
  Veeraraghavan, Ziyun Li, Yingyan Lin","EyeCoD: Eye Tracking System Acceleration via FlatCam-based Algorithm &
  Accelerator Co-Design",Accepted by ISCA 2022,,10.1145/3470496.3527443,,cs.HC cs.AR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Eye tracking has become an essential human-machine interaction modality for
providing immersive experience in numerous virtual and augmented reality
(VR/AR) applications desiring high throughput (e.g., 240 FPS), small-form, and
enhanced visual privacy. However, existing eye tracking systems are still
limited by their: (1) large form-factor largely due to the adopted bulky
lens-based cameras; and (2) high communication cost required between the camera
and backend processor, thus prohibiting their more extensive applications. To
this end, we propose a lensless FlatCam-based eye tracking algorithm and
accelerator co-design framework dubbed EyeCoD to enable eye tracking systems
with a much reduced form-factor and boosted system efficiency without
sacrificing the tracking accuracy, paving the way for next-generation eye
tracking solutions. On the system level, we advocate the use of lensless
FlatCams to facilitate the small form-factor need in mobile eye tracking
systems. On the algorithm level, EyeCoD integrates a predict-then-focus
pipeline that first predicts the region-of-interest (ROI) via segmentation and
then only focuses on the ROI parts to estimate gaze directions, greatly
reducing redundant computations and data movements. On the hardware level, we
further develop a dedicated accelerator that (1) integrates a novel workload
orchestration between the aforementioned segmentation and gaze estimation
models, (2) leverages intra-channel reuse opportunities for depth-wise layers,
and (3) utilizes input feature-wise partition to save activation memory size.
On-silicon measurement validates that our EyeCoD consistently reduces both the
communication and computation costs, leading to an overall system speedup of
10.95x, 3.21x, and 12.85x over CPUs, GPUs, and a prior-art eye tracking
processor called CIS-GEP, respectively, while maintaining the tracking
accuracy.
","[{'version': 'v1', 'created': 'Thu, 2 Jun 2022 05:35:43 GMT'}]",2022-06-03,"[['You', 'Haoran', ''], ['Wan', 'Cheng', ''], ['Zhao', 'Yang', ''], ['Yu', 'Zhongzhi', ''], ['Fu', 'Yonggan', ''], ['Yuan', 'Jiayi', ''], ['Wu', 'Shang', ''], ['Zhang', 'Shunyao', ''], ['Zhang', 'Yongan', ''], ['Li', 'Chaojian', ''], ['Boominathan', 'Vivek', ''], ['Veeraraghavan', 'Ashok', ''], ['Li', 'Ziyun', ''], ['Lin', 'Yingyan', '']]","['Eye Tracking Systems', 'VR/AR', 'Algorithm-hardware Co-Design']"
6724,2202.01909,Daniel Bogdoll,"Daniel Bogdoll, Felix Schreyer, J. Marius Z\""ollner",Ad-datasets: a meta-collection of data sets for autonomous driving,"Daniel Bogdoll and Felix Schreyer contributed equally. Accepted for
  publication at VEHITS 2022",,10.5220/0011001900003191,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Autonomous driving is among the largest domains in which deep learning has
been fundamental for progress within the last years. The rise of datasets went
hand in hand with this development. All the more striking is the fact that
researchers do not have a tool available that provides a quick, comprehensive
and up-to-date overview of data sets and their features in the domain of
autonomous driving. In this paper, we present ad-datasets, an online tool that
provides such an overview for more than 150 data sets. The tool enables users
to sort and filter the data sets according to currently 16 different
categories. ad-datasets is an open-source project with community contributions.
It is in constant development, ensuring that the content stays up-to-date.
","[{'version': 'v1', 'created': 'Thu, 3 Feb 2022 23:45:48 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Feb 2022 13:37:42 GMT'}, {'version': 'v3', 'created': 'Tue, 3 May 2022 11:03:33 GMT'}]",2022-05-04,"[['Bogdoll', 'Daniel', ''], ['Schreyer', 'Felix', ''], ['Zöllner', 'J. Marius', '']]","['Autonomous Driving', 'Data Set', 'Overview', 'Collection']"
6725,2006.08820,Ingrid Nunes,"Fernando Santos, Ingrid Nunes, Ana L. C. Bazzan","Quantitatively Assessing the Benefits of Model-driven Development in
  Agent-based Modeling and Simulation",,"Simulation Modelling Practice and Theory, v. 104, 1-19 (2020)",10.1016/j.simpat.2020.102126,,cs.AI cs.SE,http://creativecommons.org/licenses/by/4.0/,"  The agent-based modeling and simulation (ABMS) paradigm has been used to
analyze, reproduce, and predict phenomena related to many application areas.
Although there are many agent-based platforms that support simulation
development, they rely on programming languages that require extensive
programming knowledge. Model-driven development (MDD) has been explored to
facilitate simulation modeling, by means of high-level modeling languages that
provide reusable building blocks that hide computational complexity, and code
generation. However, there is still limited knowledge of how MDD approaches to
ABMS contribute to increasing development productivity and quality. We thus in
this paper present an empirical study that quantitatively compares the use of
MDD and ABMS platforms mainly in terms of effort and developer mistakes. Our
evaluation was performed using MDD4ABMS-an MDD approach with a core and
extensions to two application areas, one of which developed for this study-and
NetLogo, a widely used platform. The obtained results show that MDD4ABMS
requires less effort to develop simulations with similar (sometimes better)
design quality than NetLogo, giving evidence of the benefits that MDD can
provide to ABMS.
","[{'version': 'v1', 'created': 'Mon, 15 Jun 2020 23:29:04 GMT'}]",2020-06-17,"[['Santos', 'Fernando', ''], ['Nunes', 'Ingrid', ''], ['Bazzan', 'Ana L. C.', '']]","['Agent-based Simulation', 'Model-driven Development', 'User Study', 'MDD4ABMS', 'NetLogo']"
6726,2006.04282,Mirko Marras,"Mirko Marras, Ludovico Boratto, Guilherme Ramos, Gianni Fenu","Equality of Learning Opportunity via Individual Fairness in Personalized
  Recommendations",,,10.1007/s40593-021-00271-1,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online educational platforms are playing a primary role in mediating the
success of individuals' careers. Therefore, while building overlying content
recommendation services, it becomes essential to guarantee that learners are
provided with equal recommended learning opportunities, according to the
platform values, context, and pedagogy. Though the importance of ensuring
equality of learning opportunities has been well investigated in traditional
institutions, how this equality can be operationalized in online learning
ecosystems through recommender systems is still under-explored. In this paper,
we formalize educational principles that model recommendations' learning
properties, and a novel fairness metric that combines them in order to monitor
the equality of recommended learning opportunities among learners. Then, we
envision a scenario wherein an educational platform should be arranged in such
a way that the generated recommendations meet each principle to a certain
degree for all learners, constrained to their individual preferences. Under
this view, we explore the learning opportunities provided by recommender
systems in a large-scale course platform, uncovering systematic inequalities.
To reduce this effect, we propose a novel post-processing approach that
balances personalization and equality of recommended opportunities. Experiments
show that our approach leads to higher equality, with a negligible loss in
personalization. Our study moves a step forward in operationalizing the ethics
of human learning in recommendations, a core unit of intelligent educational
systems.
","[{'version': 'v1', 'created': 'Sun, 7 Jun 2020 22:26:51 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Oct 2020 01:45:18 GMT'}]",2022-08-24,"[['Marras', 'Mirko', ''], ['Boratto', 'Ludovico', ''], ['Ramos', 'Guilherme', ''], ['Fenu', 'Gianni', '']]","['AIED', 'Ethics', 'Learning Analytics', 'Recommender Systems']"
6727,2012.06282,"Robert M\""uller","Robert M\""uller, Steffen Illium, Fabian Ritz, Kyrill Schmid",Analysis of Feature Representations for Anomalous Sound Detection,"ICAART 2021, 10 pages, 7 figures, 2 tables",,10.5220/0010226800970106,,cs.SD cs.LG eess.AS,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this work, we thoroughly evaluate the efficacy of pretrained neural
networks as feature extractors for anomalous sound detection. In doing so, we
leverage the knowledge that is contained in these neural networks to extract
semantically rich features (representations) that serve as input to a Gaussian
Mixture Model which is used as a density estimator to model normality. We
compare feature extractors that were trained on data from various domains,
namely: images, environmental sounds and music. Our approach is evaluated on
recordings from factory machinery such as valves, pumps, sliders and fans. All
of the evaluated representations outperform the autoencoder baseline with music
based representations yielding the best performance in most cases. These
results challenge the common assumption that closely matching the domain of the
feature extractor and the downstream task results in better downstream task
performance.
","[{'version': 'v1', 'created': 'Fri, 11 Dec 2020 12:31:50 GMT'}]",2021-02-19,"[['Müller', 'Robert', ''], ['Illium', 'Steffen', ''], ['Ritz', 'Fabian', ''], ['Schmid', 'Kyrill', '']]","['Anomaly Detection', 'Transfer Learning', 'Machine Health Monitoring']"
6728,1907.04628,Thijs Laarhoven,Thijs Laarhoven,"Polytopes, lattices, and spherical codes for the nearest neighbor
  problem","This is the full version of the paper published in the proceedings of
  ICALP 2020 under the same title, which only contains Section 1",ICALP 2020,10.4230/LIPIcs.ICALP.2020.76,,cs.DS cs.CC cs.CG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study locality-sensitive hash methods for the nearest neighbor problem for
the angular distance, focusing on the approach of first projecting down onto a
low-dimensional subspace, and then partitioning the projected vectors according
to Voronoi cells induced by a suitable spherical code. This approach
generalizes and interpolates between the fast but suboptimal hyperplane hashing
of Charikar [STOC'02] and the asymptotically optimal but practically often
slower hash families of Andoni-Indyk [FOCS'06], Andoni-Indyk-Nguyen-Razenshteyn
[SODA'14] and Andoni-Indyk-Laarhoven-Razenshteyn-Schmidt [NIPS'15]. We set up a
framework for analyzing the performance of any spherical code in this context,
and we provide results for various codes from the literature, such as those
related to regular polytopes and root lattices. Similar to hyperplane hashing,
and unlike cross-polytope hashing, our analysis of collision probabilities and
query exponents is exact and does not hide order terms which vanish only for
large $d$, facilitating an easy parameter selection.
  For the two-dimensional case, we derive closed-form expressions for arbitrary
spherical codes, and we show that the equilateral triangle is optimal,
achieving a better performance than the two-dimensional analogues of hyperplane
and cross-polytope hashing. In three and four dimensions, we numerically find
that the tetrahedron, $5$-cell, and $16$-cell achieve the best query exponents,
while in five or more dimensions orthoplices appear to outperform regular
simplices, as well as the root lattice families $A_k$ and $D_k$. We argue that
in higher dimensions, larger spherical codes will likely exist which will
outperform orthoplices in theory, and we argue why using the $D_k$ root
lattices will likely lead to better results in practice, due to a better
trade-off between the asymptotic query exponent and the concrete costs of
hashing.
","[{'version': 'v1', 'created': 'Wed, 10 Jul 2019 11:38:27 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Apr 2020 03:50:06 GMT'}]",2020-06-30,"[['Laarhoven', 'Thijs', '']]","['(approximate) nearest neighbor problem', 'spherical codes', 'polytopes', 'lattices', 'locality-sensitive hashing (LSH)']"
6729,1903.05174,Claudio Gallicchio,Claudio Gallicchio and Alessio Micheli,Richness of Deep Echo State Network Dynamics,Preprint of the paper accepted at IWANN 2019,,10.1007/978-3-030-20521-8_40,,cs.LG cs.AI cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reservoir Computing (RC) is a popular methodology for the efficient design of
Recurrent Neural Networks (RNNs). Recently, the advantages of the RC approach
have been extended to the context of multi-layered RNNs, with the introduction
of the Deep Echo State Network (DeepESN) model. In this paper, we study the
quality of state dynamics in progressively higher layers of DeepESNs, using
tools from the areas of information theory and numerical analysis. Our
experimental results on RC benchmark datasets reveal the fundamental role
played by the strength of inter-reservoir connections to increasingly enrich
the representations developed in higher layers. Our analysis also gives
interesting insights into the possibility of effective exploitation of training
algorithms based on stochastic gradient descent in the RC field.
","[{'version': 'v1', 'created': 'Tue, 12 Mar 2019 19:39:36 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Sep 2019 15:49:55 GMT'}]",2019-09-25,"[['Gallicchio', 'Claudio', ''], ['Micheli', 'Alessio', '']]","['Deep Echo State Networks', 'Deep Reservoir Computing', 'Richness of RNN Dynamics']"
6730,2212.07764,Andrea Bedin,"Andrea Bedin, Alexander Marin\v{s}ek, Shaghayegh Shahcheraghi, Nairy
  Moghadas Gholian, Liesbet Van der Perre","DOPAMINE: Doppler frequency and Angle of arrival MINimization of
  tracking Error for extended reality","6 pages, 5 figures",,10.1145/3565474.3569072,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we investigate how Joint Communication And Sensing (JCAS) can
be used to improve the Inertial Measurement Unit (IMU)- based tracking accuracy
of eXtended Reality (XR) Head-Mounted Displays (HMDs). Such tracking is used
when optical and InfraRed (IR) tracking is lost, and its lack of accuracy can
lead to disruption of the user experience. In particular, we analyze the impact
of using doppler-based speed estimation to aid the accelerometer-based position
estimation, and Angle of Arrival (AoA) estimation to aid the gyroscope-based
orientation estimation. Although less accurate than IMUs for short times in
fact, the JCAS based methods require one fewer integration step, making the
tracking more sustainable over time. Based on the proposed model, we conclude
that at least in the case of the position estimate, introducing JCAS can make
long lasting optical/IR tracking losses more sustainable.
","[{'version': 'v1', 'created': 'Thu, 15 Dec 2022 12:33:47 GMT'}]",2022-12-16,"[['Bedin', 'Andrea', ''], ['Marinšek', 'Alexander', ''], ['Shahcheraghi', 'Shaghayegh', ''], ['Gholian', 'Nairy Moghadas', ''], ['Van der Perre', 'Liesbet', '']]","['Extended reality', 'Joint Communication and Sensing', 'mmWave']"
6731,2208.01827,Wenxue Cui,"Wenxue Cui, Shaohui Liu, Debin Zhao",Fast Hierarchical Deep Unfolding Network for Image Compressed Sensing,Accepted by ACM MM 2022,,10.1145/3503161.3548389,,cs.CV eess.IV,http://creativecommons.org/licenses/by/4.0/,"  By integrating certain optimization solvers with deep neural network, deep
unfolding network (DUN) has attracted much attention in recent years for image
compressed sensing (CS). However, there still exist several issues in existing
DUNs: 1) For each iteration, a simple stacked convolutional network is usually
adopted, which apparently limits the expressiveness of these models. 2) Once
the training is completed, most hyperparameters of existing DUNs are fixed for
any input content, which significantly weakens their adaptability. In this
paper, by unfolding the Fast Iterative Shrinkage-Thresholding Algorithm
(FISTA), a novel fast hierarchical DUN, dubbed FHDUN, is proposed for image
compressed sensing, in which a well-designed hierarchical unfolding
architecture is developed to cooperatively explore richer contextual prior
information in multi-scale spaces. To further enhance the adaptability, series
of hyperparametric generation networks are developed in our framework to
dynamically produce the corresponding optimal hyperparameters according to the
input content. Furthermore, due to the accelerated policy in FISTA, the newly
embedded acceleration module makes the proposed FHDUN save more than 50% of the
iterative loops against recent DUNs. Extensive CS experiments manifest that the
proposed FHDUN outperforms existing state-of-the-art CS methods, while
maintaining fewer iterations.
","[{'version': 'v1', 'created': 'Wed, 3 Aug 2022 03:27:32 GMT'}]",2022-08-04,"[['Cui', 'Wenxue', ''], ['Liu', 'Shaohui', ''], ['Zhao', 'Debin', '']]","['Image compressed sensing', 'deep unfolding network (DUN)', 'FISTA', 'hierarchical architecture', 'hyperparametric generation']"
6732,2110.05951,Mihai Oltean,Mihai Oltean,Evolving Evolutionary Algorithms with Patterns,arXiv admin note: substantial text overlap with arXiv:2109.13110,"Soft Computing, Springer-Verlag Vol. 11, Issue 6, pp. 503-518,
  2007",10.1007/s00500-006-0079-1,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new model for evolving Evolutionary Algorithms (EAs) is proposed in this
paper. The model is based on the Multi Expression Programming (MEP) technique.
Each MEP chromosome encodes an evolutionary pattern that is repeatedly used for
generating the individuals of a new generation. The evolved pattern is embedded
into a standard evolutionary scheme that is used for solving a particular
problem. Several evolutionary algorithms for function optimization are evolved
by using the considered model. The evolved evolutionary algorithms are compared
with a human-designed Genetic Algorithm. Numerical experiments show that the
evolved evolutionary algorithms can compete with standard approaches for
several well-known benchmarking problems.
","[{'version': 'v1', 'created': 'Sun, 10 Oct 2021 16:26:20 GMT'}]",2021-10-13,"[['Oltean', 'Mihai', '']]","['Genetic Algorithms', 'Genetic Programming', 'Evolving Evolutionary Algorithms', 'Multi Expression Programming', 'Linear Genetic Programming']"
6733,1708.01680,Amir Saeidi,"Amir Saeidi (Utrecht University, Netherlands), Jurriaan Hage
  (Universiteit Utrecht, Netherlands), Ravi Khadka (Utrecht University,
  Netherlands), Slinger Jansen (Utrecht University, Netherlands)","On the Effect of Semantically Enriched Context Models on Software
  Modularization",,"The Art, Science, and Engineering of Programming, 2018, Vol. 2,
  Issue 1, Article 2",10.22152/programming-journal.org/2018/2/2,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many of the existing approaches for program comprehension rely on the
linguistic information found in source code, such as identifier names and
comments. Semantic clustering is one such technique for modularization of the
system that relies on the informal semantics of the program, encoded in the
vocabulary used in the source code. Treating the source code as a collection of
tokens loses the semantic information embedded within the identifiers. We try
to overcome this problem by introducing context models for source code
identifiers to obtain a semantic kernel, which can be used for both deriving
the topics that run through the system as well as their clustering. In the
first model, we abstract an identifier to its type representation and build on
this notion of context to construct contextual vector representation of the
source code. The second notion of context is defined based on the flow of data
between identifiers to represent a module as a dependency graph where the nodes
correspond to identifiers and the edges represent the data dependencies between
pairs of identifiers. We have applied our approach to 10 medium-sized open
source Java projects, and show that by introducing contexts for identifiers,
the quality of the modularization of the software systems is improved. Both of
the context models give results that are superior to the plain vector
representation of documents. In some cases, the authoritativeness of
decompositions is improved by 67%. Furthermore, a more detailed evaluation of
our approach on JEdit, an open source editor, demonstrates that inferred topics
through performing topic analysis on the contextual representations are more
meaningful compared to the plain representation of the documents. The proposed
approach in introducing a context model for source code identifiers paves the
way for building tools that support developers in program comprehension tasks
such as application and domain concept location, software modularization and
topic analysis.
","[{'version': 'v1', 'created': 'Fri, 4 Aug 2017 23:08:52 GMT'}]",2017-08-08,"[['Saeidi', 'Amir', '', 'Utrecht University, Netherlands'], ['Hage', 'Jurriaan', '', 'Universiteit Utrecht, Netherlands'], ['Khadka', 'Ravi', '', 'Utrecht University,\n  Netherlands'], ['Jansen', 'Slinger', '', 'Utrecht University, Netherlands']]","['software modularization', 'program comprehension', 'software mining']"
6734,2001.11569,Dongrui Wu,"Xiao Zhang, Dongrui Wu, Lieyun Ding, Hanbin Luo, Chin-Teng Lin,
  Tzyy-Ping Jung, Ricardo Chavarriaga","Tiny noise, big mistakes: Adversarial perturbations induce errors in
  Brain-Computer Interface spellers",,"National Science Review, 8(4), 2021",10.1093/nsr/nwaa233,,cs.HC cs.LG eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An electroencephalogram (EEG) based brain-computer interface (BCI) speller
allows a user to input text to a computer by thought. It is particularly useful
to severely disabled individuals, e.g., amyotrophic lateral sclerosis patients,
who have no other effective means of communication with another person or a
computer. Most studies so far focused on making EEG-based BCI spellers faster
and more reliable; however, few have considered their security. This study, for
the first time, shows that P300 and steady-state visual evoked potential BCI
spellers are very vulnerable, i.e., they can be severely attacked by
adversarial perturbations, which are too tiny to be noticed when added to EEG
signals, but can mislead the spellers to spell anything the attacker wants. The
consequence could range from merely user frustration to severe misdiagnosis in
clinical applications. We hope our research can attract more attention to the
security of EEG-based BCI spellers, and more broadly, EEG-based BCIs, which has
received little attention before.
","[{'version': 'v1', 'created': 'Thu, 30 Jan 2020 21:18:46 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Feb 2020 02:58:43 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Mar 2020 15:47:20 GMT'}, {'version': 'v4', 'created': 'Thu, 16 Jul 2020 23:14:34 GMT'}]",2022-11-15,"[['Zhang', 'Xiao', ''], ['Wu', 'Dongrui', ''], ['Ding', 'Lieyun', ''], ['Luo', 'Hanbin', ''], ['Lin', 'Chin-Teng', ''], ['Jung', 'Tzyy-Ping', ''], ['Chavarriaga', 'Ricardo', '']]","['Electroencephalogram', 'brain-computer interfaces', 'BCI spellers', 'adversarial examples']"
6735,1908.04625,Jan Otop,Jakub Michaliszyn and Jan Otop,Non-deterministic weighted automata evaluated over Markov chains,,,10.1016/j.jcss.2019.10.001,,cs.FL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We present the first study of non-deterministic weighted automata under
probabilistic semantics. In this semantics words are random events, generated
by a Markov chain, and functions computed by weighted automata are random
variables. We consider the probabilistic questions of computing the expected
value and the cumulative distribution for such random variables.
  The exact answers to the probabilistic questions for non-deterministic
automata can be irrational and are uncomputable in general. To overcome this
limitation, we propose approximation algorithms for the probabilistic
questions, which work in exponential time in the size of the automaton and
polynomial time in the size of the Markov chain and the given precision. We
apply this result to show that non-deterministic automata can be effectively
determinised with respect to the standard deviation metric.
","[{'version': 'v1', 'created': 'Tue, 13 Aug 2019 13:14:56 GMT'}, {'version': 'v2', 'created': 'Thu, 31 Oct 2019 13:13:04 GMT'}]",2019-11-01,"[['Michaliszyn', 'Jakub', ''], ['Otop', 'Jan', '']]","['quantitative verification', 'weighted automata', 'expected value']"
6736,2112.15031,Ankush Ganguly,"Benjaphan Sommana, Ukrit Watchareeruetai, Ankush Ganguly, Samuel W.F.
  Earp, Taya Kitiyakara, Suparee Boonmanunt, Ratchainant Thammasudjarit","Development of a face mask detection pipeline for mask-wearing
  monitoring in the era of the COVID-19 pandemic: A modular approach","Accepted at the 19th International Joint Conference on Computer
  Science and Software Engineering (JCSSE 2022)",,10.1109/JCSSE54890.2022.9836283,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During the SARS-Cov-2 pandemic, mask-wearing became an effective tool to
prevent spreading and contracting the virus. The ability to monitor the
mask-wearing rate in the population would be useful for determining public
health strategies against the virus. However, artificial intelligence
technologies for detecting face masks have not been deployed at a large scale
in real-life to measure the mask-wearing rate in public. In this paper, we
present a two-step face mask detection approach consisting of two separate
modules: 1) face detection and alignment and 2) face mask classification. This
approach allowed us to experiment with different combinations of face detection
and face mask classification modules. More specifically, we experimented with
PyramidKey and RetinaFace as face detectors while maintaining a lightweight
backbone for the face mask classification module. Moreover, we also provide a
relabeled annotation of the test set of the AIZOO dataset, where we rectified
the incorrect labels for some face images. The evaluation results on the AIZOO
and Moxa 3K datasets showed that the proposed face mask detection pipeline
surpassed the state-of-the-art methods. The proposed pipeline also yielded a
higher mAP on the relabeled test set of the AIZOO dataset than the original
test set. Since we trained the proposed model using in-the-wild face images, we
can successfully deploy our model to monitor the mask-wearing rate using public
CCTV images.
","[{'version': 'v1', 'created': 'Thu, 30 Dec 2021 12:32:33 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Jul 2022 09:07:46 GMT'}, {'version': 'v3', 'created': 'Mon, 1 Aug 2022 11:37:25 GMT'}]",2022-10-06,"[['Sommana', 'Benjaphan', ''], ['Watchareeruetai', 'Ukrit', ''], ['Ganguly', 'Ankush', ''], ['Earp', 'Samuel W. F.', ''], ['Kitiyakara', 'Taya', ''], ['Boonmanunt', 'Suparee', ''], ['Thammasudjarit', 'Ratchainant', '']]","['face mask detection', 'modular approach', 'maskwearing monitoring']"
6737,1904.11818,Fabian Kunze,"Yannick Forster, Fabian Kunze","A certifying extraction with time bounds from Coq to call-by-value
  $\lambda$-calculus",,,10.4230/LIPIcs.ITP.2019.17,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide a plugin extracting Coq functions of simple polymorphic types to
the (untyped) call-by-value $\lambda$-calculus L. The plugin is implemented in
the MetaCoq framework and entirely written in Coq. We provide Ltac tactics to
automatically verify the extracted terms w.r.t a logical relation connecting
Coq functions with correct extractions and time bounds, essentially performing
a certifying translation and running time validation. We provide three case
studies: A universal L-term obtained as extraction from the Coq definition of a
step-indexed self-interpreter for \L, a many-reduction from solvability of
Diophantine equations to the halting problem of L, and a polynomial-time
simulation of Turing machines in L.
","[{'version': 'v1', 'created': 'Fri, 26 Apr 2019 13:00:47 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Jul 2019 12:46:20 GMT'}]",2022-12-09,"[['Forster', 'Yannick', ''], ['Kunze', 'Fabian', '']]","['cbv λ-calculus', 'Coq', 'constructive type theory', 'extraction', 'computability']"
6738,2208.09926,Gilberto Ochoa-Ruiz,Mansoor Ali and Gilberto Ochoa-Ruiz and Sharib Ali,"A semi-supervised Teacher-Student framework for surgical tool detection
  and localization","Paper accepted at Augmented Reality, Augmented Environments for
  Computer Assisted Interventions (AE-CAI), Computer Assisted and Robotic
  Endoscopy (CARE) and Context-Aware Operating Theaters (OR 2.0) at MICCAI 2022",,10.1080/21681163.2022.2150688,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Surgical tool detection in minimally invasive surgery is an essential part of
computer-assisted interventions. Current approaches are mostly based on
supervised methods which require large fully labeled data to train supervised
models and suffer from pseudo label bias because of class imbalance issues.
However large image datasets with bounding box annotations are often scarcely
available. Semi-supervised learning (SSL) has recently emerged as a means for
training large models using only a modest amount of annotated data; apart from
reducing the annotation cost. SSL has also shown promise to produce models that
are more robust and generalizable. Therefore, in this paper we introduce a
semi-supervised learning (SSL) framework in surgical tool detection paradigm
which aims to mitigate the scarcity of training data and the data imbalance
through a knowledge distillation approach. In the proposed work, we train a
model with labeled data which initialises the Teacher-Student joint learning,
where the Student is trained on Teacher-generated pseudo labels from unlabeled
data. We propose a multi-class distance with a margin based classification loss
function in the region-of-interest head of the detector to effectively
segregate foreground classes from background region. Our results on
m2cai16-tool-locations dataset indicate the superiority of our approach on
different supervised data settings (1%, 2%, 5%, 10% of annotated data) where
our model achieves overall improvements of 8%, 12% and 27% in mAP (on 1%
labeled data) over the state-of-the-art SSL methods and a fully supervised
baseline, respectively. The code is available at
https://github.com/Mansoor-at/Semi-supervised-surgical-tool-det
","[{'version': 'v1', 'created': 'Sun, 21 Aug 2022 17:21:31 GMT'}]",2022-12-26,"[['Ali', 'Mansoor', ''], ['Ochoa-Ruiz', 'Gilberto', ''], ['Ali', 'Sharib', '']]","['Semi-supervised learning', 'Faster-RCNN', 'Surgical tool detection']"
6739,2103.05309,Gianluca Schiavo,"Gianluca Schiavo, Ornella Mich, Michela Ferron, Nadia Mana",Trade-offs in the Design of Multimodal Interaction for Older Adults,,"Behaviour & Information Technology, 2020",10.1080/0144929X.2020.1851768,,cs.HC cs.CY,http://creativecommons.org/licenses/by-sa/4.0/,"  This paper presents key aspects and trade-offs that designers and
Human-Computer Interaction practitioners might encounter when designing
multimodal interaction for older adults. The paper gathers literature on
multimodal interaction and assistive technology, and describes a set of design
challenges specific for older users. Building on these main design challenges,
four trade-offs in the design of multimodal technology for this target group
are presented and discussed. To highlight the relevance of the trade-offs in
the design process of multimodal technology for older adults, two of the four
reported trade-offs are illustrated with two user studies that explored mid-air
and speech-based interaction with a tablet device. The first study investigates
the design trade-offs related to redundant multimodal commands in older,
middle-aged and younger adults, whereas the second one investigates the design
choices related to the definition of a set of mid-air one-hand gestures and
voice input commands. Further reflections highlight the design trade-offs that
such considerations bring in the process, presenting an overview of the design
choices involved and of their potential consequences.
","[{'version': 'v1', 'created': 'Tue, 9 Mar 2021 09:12:16 GMT'}]",2021-03-10,"[['Schiavo', 'Gianluca', ''], ['Mich', 'Ornella', ''], ['Ferron', 'Michela', ''], ['Mana', 'Nadia', '']]","['Multimodal interaction', 'older adults', 'design trade-offs', 'user-centred design']"
6740,2105.01734,Jason Wu,"Jason Wu, Gabriel Reyes, Sam C. White, Xiaoyi Zhang, Jeffrey P. Bigham","When Can Accessibility Help?: An Exploration of Accessibility Feature
  Recommendation on Mobile Devices",Accepted to Web4All 2021 (W4A '21),,10.1145/3430263.3452434,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Numerous accessibility features have been developed and included in consumer
operating systems to provide people with a variety of disabilities additional
ways to access computing devices. Unfortunately, many users, especially older
adults who are more likely to experience ability changes, are not aware of
these features or do not know which combination to use. In this paper, we first
quantify this problem via a survey with 100 participants, demonstrating that
very few people are aware of built-in accessibility features on their phones.
These observations led us to investigate accessibility recommendation as a way
to increase awareness and adoption. We developed four prototype recommenders
that span different accessibility categories, which we used to collect insights
from 20 older adults. Our work demonstrates the need to increase awareness of
existing accessibility features on mobile devices, and shows that automated
recommendation could help people find beneficial accessibility features.
","[{'version': 'v1', 'created': 'Tue, 4 May 2021 20:11:29 GMT'}]",2021-05-06,"[['Wu', 'Jason', ''], ['Reyes', 'Gabriel', ''], ['White', 'Sam C.', ''], ['Zhang', 'Xiaoyi', ''], ['Bigham', 'Jeffrey P.', '']]","['accessibility', 'features', 'recommendation', 'aging', 'older adults', 'mobile device']"
6741,2211.03477,F\'abio C. C. Meneghetti,"F\'abio C. C. Meneghetti and Henrique K. Miyamoto and Sueli I. R.
  Costa","Information Properties of a Random Variable Decomposition through
  Lattices","11 pages, 6 figures. v2: improved some explanations in sections 2 and
  4, typos, and added citation in section 3",,10.3390/psf2022005019,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A full-rank lattice in the Euclidean space is a discrete set formed by all
integer linear combinations of a basis. Given a probability distribution on
$\mathbb{R}^n$, two operations can be induced by considering the quotient of
the space by such a lattice: wrapping and quantization. For a lattice
$\Lambda$, and a fundamental domain $D$ which tiles $\mathbb{R}^n$ through
$\Lambda$, the wrapped distribution over the quotient is obtained by summing
the density over each coset, while the quantized distribution over the lattice
is defined by integrating over each fundamental domain translation. These
operations define wrapped and quantized random variables over $D$ and
$\Lambda$, respectively, which sum up to the original random variable. We
investigate information-theoretic properties of this decomposition, such as
entropy, mutual information and the Fisher information matrix, and show that it
naturally generalizes to the more abstract context of locally compact
topological groups.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2022 11:43:31 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Nov 2022 18:31:40 GMT'}]",2022-12-12,"[['Meneghetti', 'Fábio C. C.', ''], ['Miyamoto', 'Henrique K.', ''], ['Costa', 'Sueli I. R.', '']]","['Fisher information', 'information geometry', 'lattices', 'mutual information', 'quantization', 'topological groups', 'wrapped distributions']"
6742,1712.06276,Houssam Eddine Zahaf,"Houssam Eddine Zahaf (CRIStAL), Giuseppe Lipari (CRIStAL), Luca Abeni,
  Houssam-Eddine Zahaf (CRIStAL)","Migrate when necessary: toward partitioned reclaiming for soft real-time
  tasks",,"Proceedings of International Conference on Real-Time Networks and
  Systems, 2017, 10, pp.1-24",10.1145/3139258.3139280,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new strategy for scheduling soft real-time tasks on
multiple identical cores. The proposed approach is based on partitioned CPU
reservations and it uses a reclaiming mechanism to reduce the number of missed
deadlines. We introduce the possibility for a task to temporarily migrate to
another, less charged, CPU when it has exhausted the reserved bandwidth on its
allocated CPU. In addition, we propose a simple load balancing method to
decrease the number of deadlines missed by the tasks. The proposed algorithm
has been evaluated through simulations, showing its effectiveness (compared to
other multi-core reclaiming approaches) and comparing the performance of
different partitioning heuristics (Best Fit, Worst Fit and First Fit).
","[{'version': 'v1', 'created': 'Mon, 18 Dec 2017 07:32:19 GMT'}]",2019-05-01,"[['Zahaf', 'Houssam Eddine', '', 'CRIStAL'], ['Lipari', 'Giuseppe', '', 'CRIStAL'], ['Abeni', 'Luca', '', 'CRIStAL'], ['Zahaf', 'Houssam-Eddine', '', 'CRIStAL']]","['Resource reservations', 'partitioned scheduling', 'CPU reclaiming']"
6743,1901.03297,Nazeeh Ghatasheh,"Alaa F. Sheta, Nazeeh Ghatasheh, Hossam Faris, Ali Rodan",Robotics Evolution: from Remote Brain to Cloud,,"International Journal of Control and Automation, 11(11), 29-42",10.14257/ijca.2018.11.11.03,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robotic systems have been evolving since decades and touching almost all
aspects of life, either for leisure or critical applications. Most of
traditional robotic systems operate in well-defined environments utilizing
pre-configured on-board processing units. However, modern and foreseen robotic
applications ask for complex processing requirements that exceed the limits of
on-board computing power. Cloud computing and the related technologies have
high potential to overcome on-board hardware restrictions and can improve the
performance efficiency. This research highlights the advancements in robotic
systems with focus on cloud robotics as an emerging trend. There exists an
extensive amount of effort to leverage the potentials of robotic systems and to
handle arising shortcomings. Moreover, there are promising insights for future
breed of intelligent, flexible, and autonomous robotic systems in the Internet
of Things era.
","[{'version': 'v1', 'created': 'Tue, 8 Jan 2019 23:10:11 GMT'}]",2019-01-11,"[['Sheta', 'Alaa F.', ''], ['Ghatasheh', 'Nazeeh', ''], ['Faris', 'Hossam', ''], ['Rodan', 'Ali', '']]","['Cloud Robotics', 'Cloud Computing', 'Review', 'IoT Applications']"
6744,2204.01540,Lars Vilhuber,"Lars Vilhuber and Hyuk Harry Son and Meredith Welch and David N.
  Wasser and Michael Darisse",Teaching for large-scale Reproducibility Verification,,,10.1080/26939169.2022.2074582,,cs.CY stat.OT,http://creativecommons.org/licenses/by-sa/4.0/,"  We describe a unique environment in which undergraduate students from various
STEM and social science disciplines are trained in data provenance and
reproducible methods, and then apply that knowledge to real, conditionally
accepted manuscripts and associated replication packages. We describe in detail
the recruitment, training, and regular activities. While the activity is not
part of a regular curriculum, the skills and knowledge taught through explicit
training of reproducible methods and principles, and reinforced through
repeated application in a real-life workflow, contribute to the education of
these undergraduate students, and prepare them for post-graduation jobs and
further studies.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2022 15:36:14 GMT'}]",2022-12-08,"[['Vilhuber', 'Lars', ''], ['Son', 'Hyuk Harry', ''], ['Welch', 'Meredith', ''], ['Wasser', 'David N.', ''], ['Darisse', 'Michael', '']]","['reproducibility', 'undergraduate training', 'economics']"
6745,2008.12850,Ondrej Rokos,"S.E.H.M. van Bree, O. Roko\v{s}, R.H.J. Peerlings, M.
  Do\v{s}k\'a\v{r}, M.G.D. Geers","A Newton Solver for Micromorphic Computational Homogenization Enabling
  Multiscale Buckling Analysis of Pattern-Transforming Metamaterials","34 pages, 17 figures, 1 table, 1 algorithm, abstract shortened to
  fulfill 1920 character limit",,10.1016/j.cma.2020.113333,,cs.CE cond-mat.soft,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mechanical metamaterials feature engineered microstructures designed to
exhibit exotic, and often counter-intuitive, effective behaviour. Such a
behaviour is often achieved through instability-induced transformations of the
underlying periodic microstructure into one or multiple patterning modes. Due
to a strong kinematic coupling of individual repeating microstructural cells,
non-local behaviour and size effects emerge, which cannot easily be captured by
classical homogenization schemes. In addition, the individual patterning modes
can mutually interact in space as well as in time, while at the engineering
scale the entire structure can buckle globally. For efficient numerical
macroscale predictions, a micromorphic computational homogenization scheme has
recently been developed. Although this framework is in principle capable of
accounting for spatial and temporal interactions between individual patterning
modes, its implementation relied on a gradient-based quasi-Newton solution
technique. This solver is suboptimal because (i) it has sub-quadratic
convergence, and (ii) the absence of Hessians does not allow for proper
bifurcation analyses. Given that mechanical metamaterials often rely on
controlled instabilities, these limitations are serious. To address them, a
full Newton method is provided in detail in this paper. The construction of the
macroscopic tangent operator is not straightforward due to specific model
assumptions on the decomposition of the underlying displacement field pertinent
to the micromorphic framework, involving orthogonality constraints. Analytical
expressions for the first and second variation of the total potential energy
are given, and the complete algorithm is listed. The developed methodology is
demonstrated with two examples in which a competition between local and global
buckling exists and where multiple patterning modes emerge.
","[{'version': 'v1', 'created': 'Mon, 31 Aug 2020 11:06:02 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Sep 2020 14:03:56 GMT'}]",2020-09-04,"[['van Bree', 'S. E. H. M.', ''], ['Rokoš', 'O.', ''], ['Peerlings', 'R. H. J.', ''], ['Doškář', 'M.', ''], ['Geers', 'M. G. D.', '']]","['Mechanical metamaterials', 'computational homogenization', 'micromorphiccontinuum', 'Newton method', 'bifurcation analysis']"
6746,2109.10172,Shengzhe Hou,"Shengzhe Hou, Bruce H. Thomas","VRMenuDesigner: A toolkit for automatically generating and modifying VR
  menus",,,10.1109/AIVR52153.2021.00036,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  With the rapid development of Virtual Reality (VR) technology, the research
of User Interface (UI), especially menus, in the VR environment has attracted
more and more attention. However, it is very tedious for researchers to develop
UI from scratch or modify existing functions and there are no easy-to-use tools
for efficient development. This paper aims to present VRMenuDesigner, a
flexible and modular toolkit for automatically generating/modifying VR menus.
This toolkit is provided as open-source library and easy to extend to adapt to
various requirements. The main contribution of this work is to organize the
menus and functions with object-oriented thinking, which makes the system very
understandable and extensible. VRMenuDesigner includes two key tools: Creator
and Modifier for quickly generating and modifying elements. Moreover, we
developed several built-in menus and discussed their usability. After a brief
review and taxonomy of 3D menus, the architecture and implementation of the
toolbox are introduced.
","[{'version': 'v1', 'created': 'Tue, 21 Sep 2021 13:39:15 GMT'}]",2022-03-21,"[['Hou', 'Shengzhe', ''], ['Thomas', 'Bruce H.', '']]","['Virtual Reality', 'Human-Computer Interaction', '3D Menu', 'User Interface']"
6747,cs/0703002,Plamen Simeonov L.,Plamen L. Simeonov,"Integral Biomathics: A Post-Newtonian View into the Logos of Bios (On
  the New Meaning, Relations and Principles of Life in Science)","85 pages, 6 figures","Progress in Biophysics and Molecular Biology, Vol. 102, Issues
  2-3, 2010, pp. 85-121",10.1016/j.pbiomolbio.2010.01.005,,cs.NE cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work is an attempt for a state-of-the-art survey of natural and life
sciences with the goal to define the scope and address the central questions of
an original research program. It is focused on the phenomena of emergence,
adaptive dynamics and evolution of self-assembling, self-organizing,
self-maintaining and self-replicating biosynthetic systems viewed from a
newly-arranged perspective and understanding of computation and communication
in the living nature.
","[{'version': 'v1', 'created': 'Wed, 28 Feb 2007 22:52:43 GMT'}, {'version': 'v2', 'created': 'Fri, 30 Mar 2007 08:35:36 GMT'}, {'version': 'v3', 'created': 'Tue, 3 Apr 2007 13:54:13 GMT'}, {'version': 'v4', 'created': 'Mon, 11 Jun 2007 16:48:17 GMT'}, {'version': 'v5', 'created': 'Tue, 17 Jul 2007 15:47:18 GMT'}, {'version': 'v6', 'created': 'Fri, 21 Dec 2007 15:53:14 GMT'}, {'version': 'v7', 'created': 'Mon, 31 Dec 2007 20:30:16 GMT'}, {'version': 'v8', 'created': 'Fri, 4 Jan 2008 01:48:58 GMT'}, {'version': 'v9', 'created': 'Fri, 5 Feb 2010 12:03:19 GMT'}]",2015-09-02,"[['Simeonov', 'Plamen L.', '']]","['computational system biology', 'biological mathematics', 'internalism', 'autopoiesis', 'nonTuring machines', 'naturalistic computation', 'natural philosophy']"
6748,1905.06437,Khavee Agustus Botangen,"Khavee Agustus Botangen, Jian Yu, Sira Yongchareon, LiangHuai Yang,
  Quan Bai","Specifying and Reasoning about Contextual Preferences in the
  Goal-oriented Requirements Modelling",10 pages conference paper submitted to ACSW 2018,,10.1145/3167918.3167945,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Goal-oriented requirements variability modelling has established the
understanding for adaptability in the early stage of software development-the
Requirements Engineering phase. Goal-oriented requirements variability
modelling considers both the intentions, which are captured as goals in goal
models, and the preferences of different stakeholders as the main sources of
system behaviour variability. Most often, however, intentions and preferences
vary according to contexts. In this paper, we propose an approach for a
contextual preference-based requirements variability analysis in the
goal-oriented Requirements Engineering. We introduce a quantitative contextual
preference specification to express the varying preferences imposed over
requirements that are represented in the goal model. Such contextual
preferences are used as criteria to evaluate alternative solutions that satisfy
the requirements variability problem. We utilise a state-of-the-art reasoning
implementation from the Answer Set Programming domain to automate the
derivation and evaluation of solutions that fulfill the goals and satisfy the
contextual preferences. Our approach will support systems analysts in their
decisions upon alternative design solutions that define subsequent system
implementations.
","[{'version': 'v1', 'created': 'Wed, 15 May 2019 21:15:55 GMT'}]",2019-05-17,"[['Botangen', 'Khavee Agustus', ''], ['Yu', 'Jian', ''], ['Yongchareon', 'Sira', ''], ['Yang', 'LiangHuai', ''], ['Bai', 'Quan', '']]","['Requirements engineering', 'contextual preferences', 'goal']"
6749,2004.10777,Guilherme Lacerda,"Guilherme Lacerda (1 and 2), Fabio Petrillo (3), Marcelo Pimenta (2),
  Yann Gael Gueheneuc (4) ((1) Unisinos, (2) UFRGS, (3) UQAC (4) Concordia
  University)","Code Smells and Refactoring: A Tertiary Systematic Review of Challenges
  and Observations",,,10.1016/j.jss.2020.110610,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a tertiary systematic literature review of previous
surveys, secondary systematic literature reviews, and systematic mappings. We
identify the main observations (what we know) and challenges (what we do not
know) on code smells and refactoring. We show that code smells and refactoring
have a strong relationship with quality attributes, i.e., with
understandability, maintainability, testability, complexity, functionality, and
reusability. We argue that code smells and refactoring could be considered as
the two faces of a same coin. Besides, we identify how refactoring affects
quality attributes, more than code smells. We also discuss the implications of
this work for practitioners, researchers, and instructors. We identify 13 open
issues that could guide future research work. Thus, we want to highlight the
gap between code smells and refactoring in the current state of
software-engineering research. We wish that this work could help the
software-engineering research community in collaborating on future work on code
smells and refactoring.
","[{'version': 'v1', 'created': 'Wed, 22 Apr 2020 18:23:14 GMT'}]",2020-08-11,"[['Lacerda', 'Guilherme', '', '1 and 2'], ['Petrillo', 'Fabio', ''], ['Pimenta', 'Marcelo', ''], ['Gueheneuc', 'Yann Gael', '']]","['Code Smells', 'refactoring', 'tertiary systematic review']"
6750,2006.16964,Longbing Cao,Longbing Cao,Data Science: Nature and Pitfalls,,"IEEE Intelligent Systems, Volume: 31, Issue: 5, 66-75, 2016",10.1109/MIS.2016.86,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data science is creating very exciting trends as well as significant
controversy. A critical matter for the healthy development of data science in
its early stages is to deeply understand the nature of data and data science,
and to discuss the various pitfalls. These important issues motivate the
discussions in this article.
","[{'version': 'v1', 'created': 'Sun, 28 Jun 2020 02:06:54 GMT'}]",2020-07-01,"[['Cao', 'Longbing', '']]","['Data science', 'big data', 'analytics', 'advanced analytics', 'big data analytics']"
6751,2208.04238,Shalini Jain,"Shalini Jain, Yashas Andaluri, S. VenkataKeerthy, Ramakrishna
  Upadrasta","POSET-RL: Phase ordering for Optimizing Size and Execution Time using
  Reinforcement Learning",Published in ISPASS-2022,,10.1109/ISPASS55109.2022.00012,,cs.PL cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  The ever increasing memory requirements of several applications has led to
increased demands which might not be met by embedded devices. Constraining the
usage of memory in such cases is of paramount importance. It is important that
such code size improvements should not have a negative impact on the runtime.
Improving the execution time while optimizing for code size is a non-trivial
but a significant task. The ordering of standard optimization sequences in
modern compilers is fixed, and are heuristically created by the compiler domain
experts based on their expertise. However, this ordering is sub-optimal, and
does not generalize well across all the cases. We present a reinforcement
learning based solution to the phase ordering problem, where the ordering
improves both the execution time and code size. We propose two different
approaches to model the sequences: one by manual ordering, and other based on a
graph called Oz Dependence Graph (ODG). Our approach uses minimal data as
training set, and is integrated with LLVM. We show results on x86 and AArch64
architectures on the benchmarks from SPEC-CPU 2006, SPEC-CPU 2017 and MiBench.
We observe that the proposed model based on ODG outperforms the current Oz
sequence both in terms of size and execution time by 6.19% and 11.99% in SPEC
2017 benchmarks, on an average.
","[{'version': 'v1', 'created': 'Wed, 27 Jul 2022 08:32:23 GMT'}]",2022-08-09,"[['Jain', 'Shalini', ''], ['Andaluri', 'Yashas', ''], ['VenkataKeerthy', 'S.', ''], ['Upadrasta', 'Ramakrishna', '']]","['Phase Ordering', 'Compiler Optimization', 'Reinforcement learning']"
6752,2208.06979,Jizhou Huang,"Jizhou Huang, Zhengjie Huang, Xiaomin Fang, Shikun Feng, Xuyi Chen,
  Jiaxiang Liu, Haitao Yuan, Haifeng Wang","DuETA: Traffic Congestion Propagation Pattern Modeling via Efficient
  Graph Learning for ETA Prediction at Baidu Maps",To appear at CIKM 2022,,10.1145/3511808.3557091,,cs.LG cs.AI cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Estimated time of arrival (ETA) prediction, also known as travel time
estimation, is a fundamental task for a wide range of intelligent
transportation applications, such as navigation, route planning, and
ride-hailing services. To accurately predict the travel time of a route, it is
essential to take into account both contextual and predictive factors, such as
spatial-temporal interaction, driving behavior, and traffic congestion
propagation inference. The ETA prediction models previously deployed at Baidu
Maps have addressed the factors of spatial-temporal interaction (ConSTGAT) and
driving behavior (SSML). In this work, we focus on modeling traffic congestion
propagation patterns to improve ETA performance. Traffic congestion propagation
pattern modeling is challenging, and it requires accounting for impact regions
over time and cumulative effect of delay variations over time caused by traffic
events on the road network. In this paper, we present a practical
industrial-grade ETA prediction framework named DuETA. Specifically, we
construct a congestion-sensitive graph based on the correlations of traffic
patterns, and we develop a route-aware graph transformer to directly learn the
long-distance correlations of the road segments. This design enables DuETA to
capture the interactions between the road segment pairs that are spatially
distant but highly correlated with traffic conditions. Extensive experiments
are conducted on large-scale, real-world datasets collected from Baidu Maps.
Experimental results show that ETA prediction can significantly benefit from
the learned traffic congestion propagation patterns. In addition, DuETA has
already been deployed in production at Baidu Maps, serving billions of requests
every day. This demonstrates that DuETA is an industrial-grade and robust
solution for large-scale ETA prediction services.
","[{'version': 'v1', 'created': 'Mon, 15 Aug 2022 02:46:33 GMT'}]",2022-08-16,"[['Huang', 'Jizhou', ''], ['Huang', 'Zhengjie', ''], ['Fang', 'Xiaomin', ''], ['Feng', 'Shikun', ''], ['Chen', 'Xuyi', ''], ['Liu', 'Jiaxiang', ''], ['Yuan', 'Haitao', ''], ['Wang', 'Haifeng', '']]","['ETA Prediction', 'travel time estimation', 'graph neural network', 'trafficcondition prediction', 'transportation', 'Baidu Maps']"
6753,1910.05065,Leonidas Doumas,"Leonidas A. A. Doumas, Guillermo Puebla, Andrea E. Martin, John E.
  Hummel",A Theory of Relation Learning and Cross-domain Generalization,Includes supplemental material,"2022, Psychological Review",10.1037/rev0000346,,cs.AI cs.LG cs.NE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  People readily generalize knowledge to novel domains and stimuli. We present
a theory, instantiated in a computational model, based on the idea that
cross-domain generalization in humans is a case of analogical inference over
structured (i.e., symbolic) relational representations. The model is an
extension of the LISA and DORA models of relational inference and learning. The
resulting model learns both the content and format (i.e., structure) of
relational representations from non-relational inputs without supervision, when
augmented with the capacity for reinforcement learning, leverages these
representations to learn individual domains, and then generalizes to new
domains on the first exposure (i.e., zero-shot learning) via analogical
inference. We demonstrate the capacity of the model to learn structured
relational representations from a variety of simple visual stimuli, and to
perform cross-domain generalization between video games (Breakout and Pong) and
between several psychological tasks. We demonstrate that the model's trajectory
closely mirrors the trajectory of children as they learn about relations,
accounting for phenomena from the literature on the development of children's
reasoning and analogy making. The model's ability to generalize between domains
demonstrates the flexibility afforded by representing domains in terms of their
underlying relational structure, rather than simply in terms of the statistical
relations between their inputs and outputs.
","[{'version': 'v1', 'created': 'Fri, 11 Oct 2019 10:21:06 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Oct 2021 18:18:53 GMT'}, {'version': 'v3', 'created': 'Tue, 9 Nov 2021 22:35:07 GMT'}, {'version': 'v4', 'created': 'Tue, 30 Nov 2021 20:25:08 GMT'}, {'version': 'v5', 'created': 'Tue, 7 Dec 2021 14:51:11 GMT'}]",2022-04-01,"[['Doumas', 'Leonidas A. A.', ''], ['Puebla', 'Guillermo', ''], ['Martin', 'Andrea E.', ''], ['Hummel', 'John E.', '']]","['relation learning', 'generalization', 'learning relational content', 'learning structuredrepresentations', 'neural oscillations']"
6754,2101.08539,Sikai Zhang,"Sikai Zhang, Zi-Qiang Lang","Orthogonal Least Squares Based Fast Feature Selection for Linear
  Classification",,,10.1016/j.patcog.2021.108419,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  An Orthogonal Least Squares (OLS) based feature selection method is proposed
for both binomial and multinomial classification. The novel Squared Orthogonal
Correlation Coefficient (SOCC) is defined based on Error Reduction Ratio (ERR)
in OLS and used as the feature ranking criterion. The equivalence between the
canonical correlation coefficient, Fisher's criterion, and the sum of the SOCCs
is revealed, which unveils the statistical implication of ERR in OLS for the
first time. It is also shown that the OLS based feature selection method has
speed advantages when applied for greedy search. The proposed method is
comprehensively compared with the mutual information based feature selection
methods and the embedded methods using both synthetic and real world datasets.
The results show that the proposed method is always in the top 5 among the 12
candidate methods. Besides, the proposed method can be directly applied to
continuous features without discretisation, which is another significant
advantage over mutual information based methods.
","[{'version': 'v1', 'created': 'Thu, 21 Jan 2021 10:42:06 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Jun 2021 10:49:53 GMT'}, {'version': 'v3', 'created': 'Sat, 2 Oct 2021 02:30:21 GMT'}]",2021-11-09,"[['Zhang', 'Sikai', ''], ['Lang', 'Zi-Qiang', '']]","['Feature selection', 'orthogonal least squares', 'canonical correlation analysis', 'linear discriminant']"
6755,2108.11883,Yu Wang,"Yu Wang, Zhiwei Liu, Ziwei Fan, Lichao Sun, Philip S. Yu","DSKReG: Differentiable Sampling on Knowledge Graph for Recommendation
  with Relational GNN",Accepted by CIKM 2021,,10.1145/3459637.3482092.,,cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In the information explosion era, recommender systems (RSs) are widely
studied and applied to discover user-preferred information. A RS performs
poorly when suffering from the cold-start issue, which can be alleviated if
incorporating Knowledge Graphs (KGs) as side information. However, most
existing works neglect the facts that node degrees in KGs are skewed and
massive amount of interactions in KGs are recommendation-irrelevant. To address
these problems, in this paper, we propose Differentiable Sampling on Knowledge
Graph for Recommendation with Relational GNN (DSKReG) that learns the relevance
distribution of connected items from KGs and samples suitable items for
recommendation following this distribution. We devise a differentiable sampling
strategy, which enables the selection of relevant items to be jointly optimized
with the model training procedure. The experimental results demonstrate that
our model outperforms state-of-the-art KG-based recommender systems. The code
is available online at https://github.com/YuWang-1024/DSKReG.
","[{'version': 'v1', 'created': 'Thu, 26 Aug 2021 16:19:59 GMT'}]",2021-08-27,"[['Wang', 'Yu', ''], ['Liu', 'Zhiwei', ''], ['Fan', 'Ziwei', ''], ['Sun', 'Lichao', ''], ['Yu', 'Philip S.', '']]","['Recommender Systems', 'Knowledge Graph', 'Graph Neural Network']"
6756,2212.02785,Zongyao Li,"Zongyao Li, Ren Togo, Takahiro Ogawa, Miki haseyama",Union-set Multi-source Model Adaptation for Semantic Segmentation,Accepted by ECCV2022,,10.1007/978-3-031-19818-2_33,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper solves a generalized version of the problem of multi-source model
adaptation for semantic segmentation. Model adaptation is proposed as a new
domain adaptation problem which requires access to a pre-trained model instead
of data for the source domain. A general multi-source setting of model
adaptation assumes strictly that each source domain shares a common label space
with the target domain. As a relaxation, we allow the label space of each
source domain to be a subset of that of the target domain and require the union
of the source-domain label spaces to be equal to the target-domain label space.
For the new setting named union-set multi-source model adaptation, we propose a
method with a novel learning strategy named model-invariant feature learning,
which takes full advantage of the diverse characteristics of the source-domain
models, thereby improving the generalization in the target domain. We conduct
extensive experiments in various adaptation settings to show the superiority of
our method. The code is available at
https://github.com/lzy7976/union-set-model-adaptation.
","[{'version': 'v1', 'created': 'Tue, 6 Dec 2022 06:48:32 GMT'}]",2022-12-07,"[['Li', 'Zongyao', ''], ['Togo', 'Ren', ''], ['Ogawa', 'Takahiro', ''], ['haseyama', 'Miki', '']]","['Model adaptation', 'domain adaptation', 'semantic segmentation']"
6757,2204.12916,Yu Wang,"Yu Wang, Yu Dong, Xuesong Lu, Aoying Zhou",GypSum: Learning Hybrid Representations for Code Summarization,"12 pages, 6 figures, 6 tables",,10.1145/3524610.3527903,,cs.SE cs.LG cs.PL cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Code summarization with deep learning has been widely studied in recent
years. Current deep learning models for code summarization generally follow the
principle in neural machine translation and adopt the encoder-decoder
framework, where the encoder learns the semantic representations from source
code and the decoder transforms the learnt representations into human-readable
text that describes the functionality of code snippets. Despite they achieve
the new state-of-the-art performance, we notice that current models often
either generate less fluent summaries, or fail to capture the core
functionality, since they usually focus on a single type of code
representations. As such we propose GypSum, a new deep learning model that
learns hybrid representations using graph attention neural networks and a
pre-trained programming and natural language model. We introduce particular
edges related to the control flow of a code snippet into the abstract syntax
tree for graph construction, and design two encoders to learn from the graph
and the token sequence of source code, respectively. We modify the
encoder-decoder sublayer in the Transformer's decoder to fuse the
representations and propose a dual-copy mechanism to facilitate summary
generation. Experimental results demonstrate the superior performance of GypSum
over existing code summarization models.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2022 07:44:49 GMT'}]",2022-04-28,"[['Wang', 'Yu', ''], ['Dong', 'Yu', ''], ['Lu', 'Xuesong', ''], ['Zhou', 'Aoying', '']]","['code summarization', 'deep neural networks', 'graph attention neuralnetworks', 'copy mechanisms']"
6758,1911.02405,Xu Chen,"Xuan Di, Xu Chen, Eric Talley","Liability Design for Autonomous Vehicles and Human-Driven Vehicles: A
  Hierarchical Game-Theoretic Approach",,,10.1016/j.trc.2020.102710,,cs.GT cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autonomous vehicles (AVs) are inevitably entering our lives with potential
benefits for improved traffic safety, mobility, and accessibility. However,
AVs' benefits also introduce a serious potential challenge, in the form of
complex interactions with human-driven vehicles (HVs). The emergence of AVs
introduces uncertainty in the behavior of human actors and in the impact of the
AV manufacturer on autonomous driving design. This paper thus aims to
investigate how AVs affect road safety and to design socially optimal liability
rules for AVs and human drivers. A unified game is developed, including a Nash
game between human drivers, a Stackelberg game between the AV manufacturer and
HVs, and a Stackelberg game between the law maker and other users. We also
establish the existence and uniqueness of the equilibrium of the game. The game
is then simulated with numerical examples to investigate the emergence of human
drivers' moral hazard, the AV manufacturer's role in traffic safety, and the
law maker's role in liability design. Our findings demonstrate that human
drivers could develop moral hazard if they perceive their road environment has
become safer and an optimal liability rule design is crucial to improve social
welfare with advanced transportation technologies. More generally, the
game-theoretic model developed in this paper provides an analytical tool to
assist policy-makers in AV policymaking and hopefully mitigate uncertainty in
the existing regulation landscape about AV technologies.
","[{'version': 'v1', 'created': 'Tue, 5 Nov 2019 03:06:04 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Nov 2019 02:26:47 GMT'}, {'version': 'v3', 'created': 'Mon, 7 Sep 2020 17:46:48 GMT'}]",2020-09-08,"[['Di', 'Xuan', ''], ['Chen', 'Xu', ''], ['Talley', 'Eric', '']]","['Comparative Negligence Liability', 'Mixed Traffic', 'Hierarchical Game']"
6759,2106.02077,Justin Edwards,"Justin Edwards, Christian Janssen, Sandy Gould, and Benjamin R Cowan",Eliciting Spoken Interruptions to Inform Proactive Speech Agent Design,,,10.1145/3469595.3469618.,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Current speech agent interactions are typically user-initiated, limiting the
interactions they can deliver. Future functionality will require agents to be
proactive, sometimes interrupting users. Little is known about how these spoken
interruptions should be designed, especially in urgent interruption contexts.
We look to inform design of proactive agent interruptions through investigating
how people interrupt others engaged in complex tasks. We therefore developed a
new technique to elicit human spoken interruptions of people engaged in other
tasks. We found that people interrupted sooner when interruptions were urgent.
Some participants used access rituals to forewarn interruptions, but most
rarely used them. People balanced speed and accuracy in timing interruptions,
often using cues from the task they interrupted. People also varied phrasing
and delivery of interruptions to reflect urgency. We discuss how our findings
can inform speech agent design and how our paradigm can help gain insight into
human interruptions in new contexts.
","[{'version': 'v1', 'created': 'Thu, 3 Jun 2021 18:48:11 GMT'}]",2021-06-07,"[['Edwards', 'Justin', ''], ['Janssen', 'Christian', ''], ['Gould', 'Sandy', ''], ['Cowan', 'Benjamin R', '']]","['speech interfaces', 'interruptions', 'multitasking', 'proactive agents', 'urgency']"
6760,2101.02006,Abdallah Moubayed,"Abdallah Moubayed, MohammadNoor Injadat, Abdallah Shami, Hanan
  Lutfiyya","Relationship between Student Engagement and Performance in e-Learning
  Environment Using Association Rules","1 Table, 1 Figure, published in 2018 IEEE World Engineering Education
  Conference (EDUNINE)","2018 IEEE World Engineering Education Conference (EDUNINE), 2018,
  pp. 1-6",10.1109/EDUNINE.2018.8451005,,cs.CY cs.HC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The field of e-learning has emerged as a topic of interest in academia due to
the increased ease of accessing the Internet using using smart-phones and
wireless devices. One of the challenges facing e-learning platforms is how to
keep students motivated and engaged. Moreover, it is also crucial to identify
the students that might need help in order to make sure their academic
performance doesn't suffer. To that end, this paper tries to investigate the
relationship between student engagement and their academic performance. Apriori
association rules algorithm is used to derive a set of rules that relate
student engagement to academic performance. Experimental results' analysis done
using confidence and lift metrics show that a positive correlation exists
between students' engagement level and their academic performance in a blended
e-learning environment. In particular, it is shown that higher engagement often
leads to better academic performance. This cements the previous work that
linked engagement and academic performance in traditional classrooms.
","[{'version': 'v1', 'created': 'Fri, 25 Dec 2020 17:00:23 GMT'}]",2021-01-07,"[['Moubayed', 'Abdallah', ''], ['Injadat', 'MohammadNoor', ''], ['Shami', 'Abdallah', ''], ['Lutfiyya', 'Hanan', '']]","['e-Learning', 'Association Rules', 'Apriori Algorithm', 'Support', 'Confidence', 'Lift']"
6761,1909.08933,Davide Taibi,"Florian Auer, Valentina Lenarduzzi, Michael Felderer, Davide Taibi",From Monolithic Systems to Microservices: An Assessment Framework,Information and Software Technology(2021),,10.1016/j.infsof.2021.106600,,cs.SE,http://creativecommons.org/licenses/by-sa/4.0/,"  Context. Re-architecting monolithic systems with Microservices-based
architecture is a common trend. Various companies are migrating to
Microservices for different reasons. However, making such an important decision
like re-architecting an entire system must be based on real facts and not only
on gut feelings. Objective. The goal of this work is to propose an
evidence-based decision support framework for companies that need to migrate to
Microservices, based on the analysis of a set of characteristics and metrics
they should collect before re-architecting their monolithic system. Method. We
designed this study with a mixed-methods approach combining a Systematic
Mapping Study with a survey done in the form of interviews with professionals
to derive the assessment framework based on Grounded Theory. Results. We
identified a set consisting of information and metrics that companies can use
to decide whether to migrate to Microservices or not. The proposed assessment
framework, based on the aforementioned metrics, could be useful for companies
if they need to migrate to Microservices and do not want to run the risk of
failing to consider some important information.
","[{'version': 'v1', 'created': 'Thu, 19 Sep 2019 12:22:29 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Mar 2021 14:34:41 GMT'}, {'version': 'v3', 'created': 'Thu, 15 Apr 2021 09:11:52 GMT'}]",2021-05-03,"[['Auer', 'Florian', ''], ['Lenarduzzi', 'Valentina', ''], ['Felderer', 'Michael', ''], ['Taibi', 'Davide', '']]","['Microservices', 'Cloud Migration', 'Software Measurement']"
6762,2002.02072,Steven Herbst,"Steven Herbst, Byong Chan Lim, Mark Horowitz",Fast FPGA emulation of analog dynamics in digitally-driven systems,"ICCAD '18: Proceedings of the International Conference on
  Computer-Aided Design",,10.1145/3240765.3240808,,cs.AR eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose an architecture for FPGA emulation of mixed-signal
systems that achieves high accuracy at a high throughput. We represent the
analog output of a block as a superposition of step responses to changes in its
analog input, and the output is evaluated only when needed by the digital
subsystem. Our architecture is therefore intended for digitally-driven systems;
that is, those in which the inputs of analog dynamical blocks change only on
digital clock edges. We implemented a high-speed link transceiver design using
the proposed architecture on a Xilinx FPGA. This design demonstrates how our
approach breaks the link between simulation rate and time resolution that is
characteristic of prior approaches. The emulator is flexible, allowing for the
real-time adjustment of analog dynamics, clock jitter, and various design
parameters. We demonstrate that our architecture achieves 1% accuracy while
running 3 orders of magnitude faster than a comparable high-performance CPU
simulation.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2020 02:24:15 GMT'}]",2020-02-07,"[['Herbst', 'Steven', ''], ['Lim', 'Byong Chan', ''], ['Horowitz', 'Mark', '']]","['FPGA emulation', 'mixed-signal circuits', 'verification']"
6763,1809.03668,Alex Biddulph,"Alexander Biddulph, Trent Houlistion, Alexandre Mendes, Stephan K.
  Chalup",Comparing Computing Platforms for Deep Learning on a Humanoid Robot,"12 pages, 5 figures","Neural Information Processing, 11307 (2018), 120-131",10.1007/978-3-030-04239-4_11,,cs.LG cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The goal of this study is to test two different computing platforms with
respect to their suitability for running deep networks as part of a humanoid
robot software system. One of the platforms is the CPU-centered Intel NUC7i7BNH
and the other is a NVIDIA Jetson TX2 system that puts more emphasis on GPU
processing. The experiments addressed a number of benchmarking tasks including
pedestrian detection using deep neural networks. Some of the results were
unexpected but demonstrate that platforms exhibit both advantages and
disadvantages when taking computational performance and electrical power
requirements of such a system into account.
","[{'version': 'v1', 'created': 'Tue, 11 Sep 2018 03:25:36 GMT'}, {'version': 'v2', 'created': 'Sun, 20 Jan 2019 23:38:47 GMT'}]",2019-01-23,"[['Biddulph', 'Alexander', ''], ['Houlistion', 'Trent', ''], ['Mendes', 'Alexandre', ''], ['Chalup', 'Stephan K.', '']]","['deep learning', 'robot vision', 'gpu computing', 'low powereddevices']"
6764,2209.10062,Yang Song,"Yang Song, Junayed Mahmud, Ying Zhou, Oscar Chaparro, Kevin Moran,
  Andrian Marcus, Denys Poshyvanyk",Toward Interactive Bug Reporting for (Android App) End-Users,"Accepted by the Research Papers Track of the ACM Joint European
  Software Engineering Conference and Symposium on the Foundations of Software
  Engineering (ESEC/FSE'22)",,10.1145/3540250.3549131,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Many software bugs are reported manually, particularly bugs that manifest
themselves visually in the user interface. End-users typically report these
bugs via app reviewing websites, issue trackers, or in-app built-in bug
reporting tools, if available. While these systems have various features that
facilitate bug reporting (e.g., textual templates or forms), they often provide
limited guidance, concrete feedback, or quality verification to end-users, who
are often inexperienced at reporting bugs and submit low-quality bug reports
that lead to excessive developer effort in bug report management tasks. We
propose an interactive bug reporting system for end-users (Burt), implemented
as a task-oriented chatbot. Unlike existing bug reporting systems, Burt
provides guided reporting of essential bug report elements (i.e., the observed
behavior, expected behavior, and steps to reproduce the bug), instant quality
verification, and graphical suggestions for these elements. We implemented a
version of Burt for Android and conducted an empirical evaluation study with
end-users, who reported 12 bugs from six Android apps studied in prior work.
The reporters found that Burt's guidance and automated
suggestions/clarifications are useful and Burt is easy to use. We found that
Burt reports contain higher-quality information than reports collected via a
template-based bug reporting system. Improvements to Burt, informed by the
reporters, include support for various wordings to describe bug report elements
and improved quality verification. Our work marks an important paradigm shift
from static to interactive bug reporting for end-users.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2022 01:23:20 GMT'}]",2022-09-22,"[['Song', 'Yang', ''], ['Mahmud', 'Junayed', ''], ['Zhou', 'Ying', ''], ['Chaparro', 'Oscar', ''], ['Moran', 'Kevin', ''], ['Marcus', 'Andrian', ''], ['Poshyvanyk', 'Denys', '']]","['Bug Reporting', 'Task-Oriented Chatbots', 'Android Apps']"
6765,2108.07005,Lizhi Cheng,"Lizhi Cheng, Weijia Jia, Wenmian Yang",An Effective Non-Autoregressive Model for Spoken Language Understanding,,,10.1145/3459637.3482229,,cs.CL cs.AI,http://creativecommons.org/publicdomain/zero/1.0/,"  Spoken Language Understanding (SLU), a core component of the task-oriented
dialogue system, expects a shorter inference latency due to the impatience of
humans. Non-autoregressive SLU models clearly increase the inference speed but
suffer uncoordinated-slot problems caused by the lack of sequential dependency
information among each slot chunk. To gap this shortcoming, in this paper, we
propose a novel non-autoregressive SLU model named Layered-Refine Transformer,
which contains a Slot Label Generation (SLG) task and a Layered Refine
Mechanism (LRM). SLG is defined as generating the next slot label with the
token sequence and generated slot labels. With SLG, the non-autoregressive
model can efficiently obtain dependency information during training and spend
no extra time in inference. LRM predicts the preliminary SLU results from
Transformer's middle states and utilizes them to guide the final prediction.
Experiments on two public datasets indicate that our model significantly
improves SLU performance (1.5\% on Overall accuracy) while substantially speed
up (more than 10 times) the inference process over the state-of-the-art
baseline.
","[{'version': 'v1', 'created': 'Mon, 16 Aug 2021 10:26:57 GMT'}]",2021-08-17,"[['Cheng', 'Lizhi', ''], ['Jia', 'Weijia', ''], ['Yang', 'Wenmian', '']]","['Multi-Task Learning', 'Spoken Interfaces', 'Task-Oriented DialogueSystem']"
6766,1909.00299,Kien Nguyen,"Kien Nguyen, Gabriel Ghinita, Muhammad Naveed, Cyrus Shahabi","A Privacy-Preserving, Accountable and Spam-Resilient Geo-Marketplace","SIGSPATIAL'19, 10 pages",,10.1145/3347146.3359072,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile devices with rich features can record videos, traffic parameters or
air quality readings along user trajectories. Although such data may be
valuable, users are seldom rewarded for collecting them. Emerging digital
marketplaces allow owners to advertise their data to interested buyers. We
focus on geo-marketplaces, where buyers search data based on geo-tags. Such
marketplaces present significant challenges. First, if owners upload data with
revealed geo-tags, they expose themselves to serious privacy risks. Second,
owners must be accountable for advertised data, and must not be allowed to
subsequently alter geo-tags. Third, such a system may be vulnerable to
intensive spam activities, where dishonest owners flood the system with fake
advertisements. We propose a geo-marketplace that addresses all these concerns.
We employ searchable encryption, digital commitments, and blockchain to protect
the location privacy of owners while at the same time incorporating
accountability and spam-resilience mechanisms. We implement a prototype with
two alternative designs that obtain distinct trade-offs between trust
assumptions and performance. Our experiments on real location data show that
one can achieve the above design goals with practical performance and
reasonable financial overhead.
","[{'version': 'v1', 'created': 'Sun, 1 Sep 2019 00:30:58 GMT'}, {'version': 'v2', 'created': 'Sun, 22 Sep 2019 22:05:13 GMT'}, {'version': 'v3', 'created': 'Mon, 30 Sep 2019 18:39:34 GMT'}]",2019-10-02,"[['Nguyen', 'Kien', ''], ['Ghinita', 'Gabriel', ''], ['Naveed', 'Muhammad', ''], ['Shahabi', 'Cyrus', '']]","['location privacy', 'searchable encryption', 'blockchain']"
6767,2104.12710,Saeid Alirezazadeh,Saeid Alirezazadeh and Andr\'e Correia and Lu\'is A. Alexandre,Optimal Algorithm Allocation for Robotic Network Cloud Systems,"This work is accepted for publication in the Elsevier Journal of
  Robotics and Autonomous Systems. Personal use of this material is permitted.
  Permission from Elsevier must be obtained for all other uses","Robotics and Autonomous Systems, 154, August 2022, 104144",10.1016/j.robot.2022.104144,,cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A robotic network is a system with multiple robots connected by a
communication network. Certain tasks that cannot be accomplished with available
robotic resources are candidates for the use of cloud robotics, which overcomes
the limitations of the robot network by adding to the network, either local or
remote servers or cloud infrastructure, to aid in computational demanding tasks
or storage. Previous studies have mainly focused on minimizing the cost of the
robots in retrieving resources by knowing the resource allocation in advance.
We develop a method for a robotic network cloud system that includes robots,
fog and cloud nodes, to determine where each algorithm should be allocated so
that the system achieves optimal performance, regardless of which robot
initiates the request. We can find the minimum required memory for the robots
and the optimal way to allocate the algorithms with the shortest time to
complete each task. We experimentally compare our method with a
state-of-the-art method, using real-world data, showing the improvements that
can be obtained.
","[{'version': 'v1', 'created': 'Mon, 26 Apr 2021 16:48:57 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Sep 2021 16:12:10 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Dec 2021 14:03:40 GMT'}, {'version': 'v4', 'created': 'Thu, 5 May 2022 13:43:00 GMT'}, {'version': 'v5', 'created': 'Fri, 27 May 2022 09:48:38 GMT'}]",2022-05-30,"[['Alirezazadeh', 'Saeid', ''], ['Correia', 'André', ''], ['Alexandre', 'Luís A.', '']]","['Cloud Robotics', 'Robotic Networks', 'Cloud', 'Fog', 'Edge', 'Memory and Time Optimization', 'AlgorithmAllocation']"
6768,2107.12501,Matthew Guzdial,Thomas Maurer and Matthew Guzdial,Adversarial Random Forest Classifier for Automated Game Design,"6 pages, 3 figures, Reflections Track of the 2021 ACM Foundations of
  Digital Games Conference","Proceedings of the 16th International Conference on the
  Foundations of Digital Games (FDG) 2021",10.1145/3472538.3472587,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autonomous game design, generating games algorithmically, has been a longtime
goal within the technical games research field. However, existing autonomous
game design systems have relied in large part on human-authoring for game
design knowledge, such as fitness functions in search-based methods. In this
paper, we describe an experiment to attempt to learn a human-like fitness
function for autonomous game design in an adversarial manner. While our
experimental work did not meet our expectations, we present an analysis of our
system and results that we hope will be informative to future autonomous game
design research.
","[{'version': 'v1', 'created': 'Mon, 26 Jul 2021 22:30:38 GMT'}]",2021-07-28,"[['Maurer', 'Thomas', ''], ['Guzdial', 'Matthew', '']]","['autonomous game design', 'random forests', 'search-based proceduralcontent generation']"
6769,2205.15858,Navid Ghassemi,"Afshin Shoeibi, Navid Ghassemi, Marjane Khodatars, Parisa Moridian,
  Abbas Khosravi, Assef Zare, Juan M. Gorriz, Amir Hossein Chale-Chale, Ali
  Khadem, U. Rajendra Acharya","Automatic diagnosis of schizophrenia and attention deficit hyperactivity
  disorder in rs-fMRI modality using convolutional autoencoder model and
  interval type-2 fuzzy regression",Cogn Neurodyn (2022),,10.1007/s11571-022-09897-w,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Nowadays, many people worldwide suffer from brain disorders, and their health
is in danger. So far, numerous methods have been proposed for the diagnosis of
Schizophrenia (SZ) and attention deficit hyperactivity disorder (ADHD), among
which functional magnetic resonance imaging (fMRI) modalities are known as a
popular method among physicians. This paper presents an SZ and ADHD intelligent
detection method of resting-state fMRI (rs-fMRI) modality using a new deep
learning method. The University of California Los Angeles dataset, which
contains the rs-fMRI modalities of SZ and ADHD patients, has been used for
experiments. The FMRIB software library toolbox first performed preprocessing
on rs-fMRI data. Then, a convolutional Autoencoder model with the proposed
number of layers is used to extract features from rs-fMRI data. In the
classification step, a new fuzzy method called interval type-2 fuzzy regression
(IT2FR) is introduced and then optimized by genetic algorithm, particle swarm
optimization, and gray wolf optimization (GWO) techniques. Also, the results of
IT2FR methods are compared with multilayer perceptron, k-nearest neighbors,
support vector machine, random forest, and decision tree, and adaptive
neuro-fuzzy inference system methods. The experiment results show that the
IT2FR method with the GWO optimization algorithm has achieved satisfactory
results compared to other classifier methods. Finally, the proposed
classification technique was able to provide 72.71% accuracy.
","[{'version': 'v1', 'created': 'Tue, 31 May 2022 15:07:29 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Nov 2022 12:42:06 GMT'}]",2022-11-15,"[['Shoeibi', 'Afshin', ''], ['Ghassemi', 'Navid', ''], ['Khodatars', 'Marjane', ''], ['Moridian', 'Parisa', ''], ['Khosravi', 'Abbas', ''], ['Zare', 'Assef', ''], ['Gorriz', 'Juan M.', ''], ['Chale-Chale', 'Amir Hossein', ''], ['Khadem', 'Ali', ''], ['Acharya', 'U. Rajendra', '']]","['Diagnosis', 'Schizophrenia', 'ADHD', 'fMRI', 'CNN-AE', 'IT2FR', 'GWO']"
6770,2108.02388,Dailan He,"Dailan He, Yusheng Zhao, Junyu Luo, Tianrui Hui, Shaofei Huang, Aixi
  Zhang, Si Liu","TransRefer3D: Entity-and-Relation Aware Transformer for Fine-Grained 3D
  Visual Grounding",ACM MM2021,,10.1145/3474085.3475397,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently proposed fine-grained 3D visual grounding is an essential and
challenging task, whose goal is to identify the 3D object referred by a natural
language sentence from other distractive objects of the same category. Existing
works usually adopt dynamic graph networks to indirectly model the
intra/inter-modal interactions, making the model difficult to distinguish the
referred object from distractors due to the monolithic representations of
visual and linguistic contents. In this work, we exploit Transformer for its
natural suitability on permutation-invariant 3D point clouds data and propose a
TransRefer3D network to extract entity-and-relation aware multimodal context
among objects for more discriminative feature learning. Concretely, we devise
an Entity-aware Attention (EA) module and a Relation-aware Attention (RA)
module to conduct fine-grained cross-modal feature matching. Facilitated by
co-attention operation, our EA module matches visual entity features with
linguistic entity features while RA module matches pair-wise visual relation
features with linguistic relation features, respectively. We further integrate
EA and RA modules into an Entity-and-Relation aware Contextual Block (ERCB) and
stack several ERCBs to form our TransRefer3D for hierarchical multimodal
context modeling. Extensive experiments on both Nr3D and Sr3D datasets
demonstrate that our proposed model significantly outperforms existing
approaches by up to 10.6% and claims the new state-of-the-art. To the best of
our knowledge, this is the first work investigating Transformer architecture
for fine-grained 3D visual grounding task.
","[{'version': 'v1', 'created': 'Thu, 5 Aug 2021 05:47:12 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Aug 2021 09:25:23 GMT'}]",2021-08-12,"[['He', 'Dailan', ''], ['Zhao', 'Yusheng', ''], ['Luo', 'Junyu', ''], ['Hui', 'Tianrui', ''], ['Huang', 'Shaofei', ''], ['Zhang', 'Aixi', ''], ['Liu', 'Si', '']]","['3D visual grounding', 'transformer', 'entity attention', 'relation attention']"
6771,2110.05888,Sascha El-Sharkawy,"Sascha El-Sharkawy, Adam Krafczyk, Klaus Schmid","Fast Static Analyses of Software Product Lines -- An Example With More
  Than 42,000 Metrics",,"Proceedings of the 14th International Working Conference on
  Variability Modelling of Software-Intensive Systems (VaMoS '20), 2020,
  article no. 8",10.1145/3377024.3377031,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Software metrics, as one form of static analyses, is a commonly used
approach in software engineering in order to understand the state of a software
system, in particular to identify potential areas prone to defects.
Family-based techniques extract variability information from code artifacts in
Software Product Lines (SPLs) to perform static analysis for all available
variants. Many different types of metrics with numerous variants have been
defined in literature. When counting all metrics including such variants,
easily thousands of metrics can be defined. Computing all of them for large
product lines can be an extremely expensive process in terms of performance and
resource consumption.
  Objective: We address these performance and resource challenges while
supporting customizable metric suites, which allow running both, single system
and variability-aware code metrics.
  Method: In this paper, we introduce a partial parsing approach used for the
efficient measurement of more than 42,000 code metric variations. The approach
covers variability information and restricts parsing to the relevant parts of
the Abstract Syntax Tree (AST).
  Conclusions: This partial parsing approach is designed to cover all relevant
information to compute a broad variety of variability-aware code metrics on
code artifacts containing annotation-based variability, e.g., realized with
C-preprocessor statements. It allows for the flexible combination of single
system and variability-aware metrics, which is not supported by existing tools.
This is achieved by a novel representation of partially parsed product line
code artifacts, which is tailored to the computation of the metrics. Our
approach consumes considerably less resources, especially when computing many
metric variants in parallel.
","[{'version': 'v1', 'created': 'Tue, 12 Oct 2021 10:57:10 GMT'}]",2021-10-13,"[['El-Sharkawy', 'Sascha', ''], ['Krafczyk', 'Adam', ''], ['Schmid', 'Klaus', '']]","['Software Product Lines', 'SPL', 'Metrics', 'Implementation', 'VariabilityModels', 'Feature Models', 'Abstract Syntax Trees', 'AST']"
6772,2003.01588,Niceto R. Luque,"Richard R Carrillo, Francisco Naveros, Eduardo Ros, Niceto R Luque","A Metric for Evaluating Neural Input Representation in Supervised
  Learning Networks",,,10.3389/fnins.2018.00913,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Supervised learning has long been attributed to several feed-forward neural
circuits within the brain, with attention being paid to the cerebellar granular
layer. The focus of this study is to evaluate the input activity representation
of these feed-forward neural networks. The activity of cerebellar granule cells
is conveyed by parallel fibers and translated into Purkinje cell activity; the
sole output of the cerebellar cortex. The learning process at this
parallel-fiber-to-Purkinje-cell connection makes each Purkinje cell sensitive
to a set of specific cerebellar states, determined by the granule-cell activity
during a certain time window. A Purkinje cell becomes sensitive to each neural
input state and, consequently, the network operates as a function able to
generate a desired output for each provided input by means of supervised
learning. However, not all sets of Purkinje cell responses can be assigned to
any set of input states due to the network's own limitations (inherent to the
network neurobiological substrate), that is, not all input-output mapping can
be learned. A limiting factor is the representation of the input states through
granule-cell activity. The quality of this representation will determine the
capacity of the network to learn a varied set of outputs. In this study we
present an algorithm for evaluating quantitatively the level of
compatibility/interference amongst a set of given cerebellar states according
to their representation (granule-cell activation patterns) without the need for
actually conducting simulations and network training. The algorithm input
consists of a real-number matrix that codifies the activity level of every
considered granule-cell in each state. The capability of this representation to
generate a varied set of outputs is evaluated geometrically, thus resulting in
a real number that assesses the goodness of the representation
","[{'version': 'v1', 'created': 'Tue, 3 Mar 2020 15:21:25 GMT'}]",2020-03-04,"[['Carrillo', 'Richard R', ''], ['Naveros', 'Francisco', ''], ['Ros', 'Eduardo', ''], ['Luque', 'Niceto R', '']]","['supervised learning', 'cerebellum', 'inferior colliculus', 'granular layer', 'population coding', 'convexgeometry', 'high dimensionality', 'non-negativity constraints']"
6773,2111.00758,Seyed Omid Mohammadi,"Seyed Omid Mohammadi, Hossein Bodaghi, Ahmad Kalhor (University of
  Tehran, College of Engineering, School of Electrical and Computer
  Engineering, Tehran, Iran)",Single-Item Fashion Recommender: Towards Cross-Domain Recommendations,"5 Pages, 6 Figures, 1 Table","IEEE 2022 30th International Conference on Electrical Engineering
  (ICEE), 2022, pp. 12-16",10.1109/ICEE55646.2022.9827421,,cs.IR cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, recommender systems and search engines play an integral role in
fashion e-commerce. Still, many challenges lie ahead, and this study tries to
tackle some. This article first suggests a content-based fashion recommender
system that uses a parallel neural network to take a single fashion item shop
image as input and make in-shop recommendations by listing similar items
available in the store. Next, the same structure is enhanced to personalize the
results based on user preferences. This work then introduces a background
augmentation technique that makes the system more robust to out-of-domain
queries, enabling it to make street-to-shop recommendations using only a
training set of catalog shop images. Moreover, the last contribution of this
paper is a new evaluation metric for recommendation tasks called
objective-guided human score. This method is an entirely customizable framework
that produces interpretable, comparable scores from subjective evaluations of
human scorers.
","[{'version': 'v1', 'created': 'Mon, 1 Nov 2021 08:15:31 GMT'}, {'version': 'v2', 'created': 'Sat, 23 Jul 2022 17:06:38 GMT'}]",2022-07-26,"[['Mohammadi', 'Seyed Omid', '', 'University of\n  Tehran, College of Engineering, School of Electrical and Computer\n  Engineering, Tehran, Iran'], ['Bodaghi', 'Hossein', '', 'University of\n  Tehran, College of Engineering, School of Electrical and Computer\n  Engineering, Tehran, Iran'], ['Kalhor', 'Ahmad', '', 'University of\n  Tehran, College of Engineering, School of Electrical and Computer\n  Engineering, Tehran, Iran']]","['Fashion Recommendation', 'Cross-Domain', 'Augmentation', 'Evaluation']"
6774,2203.04011,Alexander Chebykin,"Alexander Chebykin, Tanja Alderliesten, Peter A. N. Bosman",Evolutionary Neural Cascade Search across Supernetworks,"13 pages, 13 figures. Accepted at GECCO 2022",,10.1145/3512290.3528749,,cs.CV cs.NE,http://creativecommons.org/licenses/by-sa/4.0/,"  To achieve excellent performance with modern neural networks, having the
right network architecture is important. Neural Architecture Search (NAS)
concerns the automatic discovery of task-specific network architectures. Modern
NAS approaches leverage supernetworks whose subnetworks encode candidate neural
network architectures. These subnetworks can be trained simultaneously,
removing the need to train each network from scratch, thereby increasing the
efficiency of NAS. A recent method called Neural Architecture Transfer (NAT)
further improves the efficiency of NAS for computer vision tasks by using a
multi-objective evolutionary algorithm to find high-quality subnetworks of a
supernetwork pretrained on ImageNet. Building upon NAT, we introduce ENCAS -
Evolutionary Neural Cascade Search. ENCAS can be used to search over multiple
pretrained supernetworks to achieve a trade-off front of cascades of different
neural network architectures, maximizing accuracy while minimizing FLOPs count.
We test ENCAS on common computer vision benchmarks (CIFAR-10, CIFAR-100,
ImageNet) and achieve Pareto dominance over previous state-of-the-art NAS
models up to 1.5 GFLOPs. Additionally, applying ENCAS to a pool of 518 publicly
available ImageNet classifiers leads to Pareto dominance in all computation
regimes and to increasing the maximum accuracy from 88.6% to 89.0%, accompanied
by an 18\% decrease in computation effort from 362 to 296 GFLOPs. Our code is
available at https://github.com/AwesomeLemon/ENCAS
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2022 11:06:01 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Apr 2022 16:01:47 GMT'}]",2022-04-29,"[['Chebykin', 'Alexander', ''], ['Alderliesten', 'Tanja', ''], ['Bosman', 'Peter A. N.', '']]","['Neural Architecture Search', 'Deep Learning', 'Computer Vision', 'AutoML', 'Evolutionary Computation']"
6775,2011.10515,Rahav Gowtham Venkateswaran,"Rahav Gowtham Venkateswaran, Ursula Kowalsky and Dieter Dinkler","A modified bond model for describing isotropic linear elastic material
  behaviour with the particle method",,,10.1007/s40571-021-00422-0,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Particle based methods such as the Discrete Element Method and the Lattice
Spring Method may be used for describing the behaviour of isotropic linear
elastic materials. However, the common bond models employed to describe the
interaction between particles restrict the range of Poisson's ratio that can be
represented. In this paper, to overcome the restriction, a modified bond model
that includes the coupling of shear strain energy of neighbouring bonds is
proposed. The coupling is described by a multi-bond term that enables the model
to distinguish between shear deformations and rigid-body rotations. The
positive definiteness of the strain energy function of the modified bond model
is verified. To validate the model, uniaxial tension, pure shear, pure bending
and cantilever bending tests are performed. Comparison of the particle
displacements with continuum mechanics solution demonstrates the ability of the
model to describe the behaviour of isotropic linear elastic material for values
of Poisson's ratio in the range $0 \leq \nu < 0.5$.
","[{'version': 'v1', 'created': 'Fri, 20 Nov 2020 17:19:15 GMT'}]",2021-07-06,"[['Venkateswaran', 'Rahav Gowtham', ''], ['Kowalsky', 'Ursula', ''], ['Dinkler', 'Dieter', '']]","['DEM', 'strain energy', 'multi-bond', 'shear', 'rigid-body rotation', 'Poisson’sratio']"
6776,2008.10707,Yangruibo Ding,"Yangruibo Ding, Baishakhi Ray, Premkumar Devanbu, Vincent J.
  Hellendoorn",Patching as Translation: the Data and the Metaphor,,,10.1145/3324884.3416587,,cs.SE cs.LG cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine Learning models from other fields, like Computational Linguistics,
have been transplanted to Software Engineering tasks, often quite successfully.
Yet a transplanted model's initial success at a given task does not necessarily
mean it is well-suited for the task. In this work, we examine a common example
of this phenomenon: the conceit that ""software patching is like language
translation"". We demonstrate empirically that there are subtle, but critical
distinctions between sequence-to-sequence models and translation model: while
program repair benefits greatly from the former, general modeling architecture,
it actually suffers from design decisions built into the latter, both in terms
of translation accuracy and diversity. Given these findings, we demonstrate how
a more principled approach to model design, based on our empirical findings and
general knowledge of software development, can lead to better solutions. Our
findings also lend strong support to the recent trend towards synthesizing
edits of code conditional on the buggy context, to repair bugs. We implement
such models ourselves as ""proof-of-concept"" tools and empirically confirm that
they behave in a fundamentally different, more effective way than the studied
translation-based architectures. Overall, our results demonstrate the merit of
studying the intricacies of machine learned models in software engineering: not
only can this help elucidate potential issues that may be overshadowed by
increases in accuracy; it can also help innovate on these models to raise the
state-of-the-art further. We will publicly release our replication data and
materials at https://github.com/ARiSE-Lab/Patch-as-translation.
","[{'version': 'v1', 'created': 'Mon, 24 Aug 2020 21:05:27 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Sep 2020 02:33:19 GMT'}]",2020-09-02,"[['Ding', 'Yangruibo', ''], ['Ray', 'Baishakhi', ''], ['Devanbu', 'Premkumar', ''], ['Hellendoorn', 'Vincent J.', '']]","['neural machine translation', 'big code', 'sequence-to-sequence model', 'automated program repair']"
6777,2204.01360,Pierre-Hugo Vial,"Pierre-Hugo Vial, Paul Magron, Thomas Oberlin, C\'edric F\'evotte",Learning the Proximity Operator in Unfolded ADMM for Phase Retrieval,"10 pages, 5 figures, submitted to IEEE SPL",,10.1109/LSP.2022.3189275,,cs.SD eess.AS eess.SP,http://creativecommons.org/licenses/by/4.0/,"  This paper considers the phase retrieval (PR) problem, which aims to
reconstruct a signal from phaseless measurements such as magnitude or power
spectrograms. PR is generally handled as a minimization problem involving a
quadratic loss. Recent works have considered alternative discrepancy measures,
such as the Bregman divergences, but it is still challenging to tailor the
optimal loss for a given setting. In this paper we propose a novel strategy to
automatically learn the optimal metric for PR. We unfold a recently introduced
ADMM algorithm into a neural network, and we emphasize that the information
about the loss used to formulate the PR problem is conveyed by the proximity
operator involved in the ADMM updates. Therefore, we replace this proximity
operator with trainable activation functions: learning these in a supervised
setting is then equivalent to learning an optimal metric for PR. Experiments
conducted with speech signals show that our approach outperforms the baseline
ADMM, using a light and interpretable neural architecture.
","[{'version': 'v1', 'created': 'Mon, 4 Apr 2022 10:09:28 GMT'}]",2022-08-17,"[['Vial', 'Pierre-Hugo', ''], ['Magron', 'Paul', ''], ['Oberlin', 'Thomas', ''], ['Févotte', 'Cédric', '']]","['Phase retrieval', 'audio', 'proximity operator learning', 'deep unfolding', 'ADMM']"
6778,2202.08198,Burak \c{C}akmak,"Burak \c{C}akmak, Yue M. Lu and Manfred Opper","Analysis of Random Sequential Message Passing Algorithms for Approximate
  Inference",,,10.1088/1742-5468/ac764a,,cs.LG cs.AI,http://creativecommons.org/publicdomain/zero/1.0/,"  We analyze the dynamics of a random sequential message passing algorithm for
approximate inference with large Gaussian latent variable models in a
student-teacher scenario. To model nontrivial dependencies between the latent
variables, we assume random covariance matrices drawn from rotation invariant
ensembles. Moreover, we consider a model mismatching setting, where the teacher
model and the one used by the student may be different. By means of dynamical
functional approach, we obtain exact dynamical mean-field equations
characterizing the dynamics of the inference algorithm. We also derive a range
of model parameters for which the sequential algorithm does not converge. The
boundary of this parameter range coincides with the de Almeida Thouless (AT)
stability condition of the replica symmetric ansatz for the static
probabilistic model.
","[{'version': 'v1', 'created': 'Wed, 16 Feb 2022 17:16:22 GMT'}]",2022-07-13,"[['Çakmak', 'Burak', ''], ['Lu', 'Yue M.', ''], ['Opper', 'Manfred', '']]","['Bayesian Inference', 'Iterative Algorithms', 'Approximate message passing', 'TAPEquations', 'Random Matrices', 'Dynamical Functional Theory']"
6779,1709.09883,Maciej Wielgosz,"Maciej Wielgosz, Matej Mertik, Andrzej Skocze\'n, Ernesto De Matteis","The model of an anomaly detector for HiLumi LHC magnets based on
  Recurrent Neural Networks and adaptive quantization",Related to arXiv:1702.00833,"Engineering Applications of Artificial Intelligence, Volume 74,
  2018, Pages 166-185",10.1016/j.engappai.2018.06.012,,cs.LG physics.acc-ph physics.ins-det,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper focuses on an examination of an applicability of Recurrent Neural
Network models for detecting anomalous behavior of the CERN superconducting
magnets. In order to conduct the experiments, the authors designed and
implemented an adaptive signal quantization algorithm and a custom GRU-based
detector and developed a method for the detector parameters selection. Three
different datasets were used for testing the detector. Two artificially
generated datasets were used to assess the raw performance of the system
whereas the 231 MB dataset composed of the signals acquired from HiLumi magnets
was intended for real-life experiments and model training. Several different
setups of the developed anomaly detection system were evaluated and compared
with state-of-the-art OC-SVM reference model operating on the same data. The
OC-SVM model was equipped with a rich set of feature extractors accounting for
a range of the input signal properties. It was determined in the course of the
experiments that the detector, along with its supporting design methodology,
reaches F1 equal or very close to 1 for almost all test sets. Due to the
profile of the data, the best_length setup of the detector turned out to
perform the best among all five tested configuration schemes of the detection
system. The quantization parameters have the biggest impact on the overall
performance of the detector with the best values of input/output grid equal to
16 and 8, respectively. The proposed solution of the detection significantly
outperformed OC-SVM-based detector in most of the cases, with much more stable
performance across all the datasets.
","[{'version': 'v1', 'created': 'Thu, 28 Sep 2017 10:19:40 GMT'}, {'version': 'v2', 'created': 'Sat, 25 Nov 2017 16:27:38 GMT'}]",2018-08-02,"[['Wielgosz', 'Maciej', ''], ['Mertik', 'Matej', ''], ['Skoczeń', 'Andrzej', ''], ['De Matteis', 'Ernesto', '']]","['HL-LHC', 'GRU', 'anomaly detection', 'adaptive quantization']"
6780,2004.12636,Jin Hyeok Yoo,Jin Hyeok Yoo and Yecheol Kim and Jisong Kim and Jun Won Choi,"3D-CVF: Generating Joint Camera and LiDAR Features Using Cross-View
  Spatial Feature Fusion for 3D Object Detection",,,10.1007/978-3-030-58583-9_43,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a new deep architecture for fusing camera and LiDAR
sensors for 3D object detection. Because the camera and LiDAR sensor signals
have different characteristics and distributions, fusing these two modalities
is expected to improve both the accuracy and robustness of 3D object detection.
One of the challenges presented by the fusion of cameras and LiDAR is that the
spatial feature maps obtained from each modality are represented by
significantly different views in the camera and world coordinates; hence, it is
not an easy task to combine two heterogeneous feature maps without loss of
information. To address this problem, we propose a method called 3D-CVF that
combines the camera and LiDAR features using the cross-view spatial feature
fusion strategy. First, the method employs auto-calibrated projection, to
transform the 2D camera features to a smooth spatial feature map with the
highest correspondence to the LiDAR features in the bird's eye view (BEV)
domain. Then, a gated feature fusion network is applied to use the spatial
attention maps to mix the camera and LiDAR features appropriately according to
the region. Next, camera-LiDAR feature fusion is also achieved in the
subsequent proposal refinement stage. The camera feature is used from the 2D
camera-view domain via 3D RoI grid pooling and fused with the BEV feature for
proposal refinement. Our evaluations, conducted on the KITTI and nuScenes 3D
object detection datasets demonstrate that the camera-LiDAR fusion offers
significant performance gain over single modality and that the proposed 3D-CVF
achieves state-of-the-art performance in the KITTI benchmark.
","[{'version': 'v1', 'created': 'Mon, 27 Apr 2020 08:34:46 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Jul 2020 03:00:03 GMT'}]",2020-12-10,"[['Yoo', 'Jin Hyeok', ''], ['Kim', 'Yecheol', ''], ['Kim', 'Jisong', ''], ['Choi', 'Jun Won', '']]","['3D Object Detection', 'Sensor Fusion', 'Intelligent Vehicle', 'Camera Sensor', 'LiDAR Sensor', 'Bird’s Eye View']"
6781,2111.10746,Vasile Păiș,"Vasile P\u{a}i\c{s}, Dan Tufi\c{s}",Capitalization and Punctuation Restoration: a Survey,"An improved version of this paper was published in Artificial
  Intelligence Review. This is the article version prior to any reviewer
  comments and improvements","P\u{a}i\c{s}, V., Tufi\c{s}, D. Capitalization and punctuation
  restoration: a survey. Artif Intell Rev (2021)",10.1007/s10462-021-10051-x,,cs.CL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Ensuring proper punctuation and letter casing is a key pre-processing step
towards applying complex natural language processing algorithms. This is
especially significant for textual sources where punctuation and casing are
missing, such as the raw output of automatic speech recognition systems.
Additionally, short text messages and micro-blogging platforms offer unreliable
and often wrong punctuation and casing. This survey offers an overview of both
historical and state-of-the-art techniques for restoring punctuation and
correcting word casing. Furthermore, current challenges and research directions
are highlighted.
","[{'version': 'v1', 'created': 'Sun, 21 Nov 2021 05:48:32 GMT'}]",2021-11-23,"[['Păiş', 'Vasile', ''], ['Tufiş', 'Dan', '']]","['Punctuation restoration', 'capitalization', 'truecasing', 'sentence segmentation']"
6782,1912.07101,Omid Jafari,"Omid Jafari, Parth Nagarkar, Jonathan Monta\~no","Efficient Bitmap-based Indexing and Retrieval of Similarity Search Image
  Queries","Submitted to 2020 IEEE Southwest Symposium on Image Analysis and
  Interpretation (SSIAI 2020)","2020 IEEE Southwest Symposium on Image Analysis and Interpretation
  (SSIAI), Albuquerque, NM, USA, 2020, pp. 58-61",10.1109/SSIAI49293.2020.9094616,,cs.MM cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finding similar images is a necessary operation in many multimedia
applications. Images are often represented and stored as a set of
high-dimensional features, which are extracted using localized feature
extraction algorithms. Locality Sensitive Hashing is one of the most popular
approximate processing techniques for finding similar points in
high-dimensional spaces. Locality Sensitive Hashing (LSH) and its variants are
designed to find similar points, but they are not designed to find objects
(such as images, which are made up of a collection of points) efficiently. In
this paper, we propose an index structure, Bitmap-Image LSH (bImageLSH), for
efficient processing of high-dimensional images. Using a real dataset, we
experimentally show the performance benefit of our novel design while keeping
the accuracy of the image results high.
","[{'version': 'v1', 'created': 'Sun, 15 Dec 2019 20:09:16 GMT'}]",2020-10-16,"[['Jafari', 'Omid', ''], ['Nagarkar', 'Parth', ''], ['Montaño', 'Jonathan', '']]","['Similarity Search', 'Nearest Neighbor Search', 'Approximate Processing', 'Locality Sensitive Hashing']"
6783,1910.01178,Arnaud Mignan,"Arnaud Mignan, Marco Broccardo","Neural Network Applications in Earthquake Prediction (1994-2019):
  Meta-Analytic Insight on their Limitations","25 pages, 7 figures","Seismological Research Letters, 2020",10.1785/0220200021,,cs.NE cs.LG physics.geo-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last few years, deep learning has solved seemingly intractable
problems, boosting the hope to find approximate solutions to problems that now
are considered unsolvable. Earthquake prediction, the Grail of Seismology, is,
in this context of continuous exciting discoveries, an obvious choice for deep
learning exploration. We review the entire literature of artificial neural
network (ANN) applications for earthquake prediction (77 articles, 1994-2019
period) and find two emerging trends: an increasing interest in this domain,
and a complexification of ANN models over time, towards deep learning. Despite
apparent positive results observed in this corpus, we demonstrate that simpler
models seem to offer similar predictive powers, if not better ones. Due to the
structured, tabulated nature of earthquake catalogues, and the limited number
of features so far considered, simpler and more transparent machine learning
models seem preferable at the present stage of research. Those baseline models
follow first physical principles and are consistent with the known empirical
laws of Statistical Seismology, which have minimal abilities to predict large
earthquakes.
","[{'version': 'v1', 'created': 'Wed, 2 Oct 2019 19:28:34 GMT'}]",2020-05-26,"[['Mignan', 'Arnaud', ''], ['Broccardo', 'Marco', '']]","['Geophysics', 'Seismology', 'Meta-analysis', 'Baseline', 'Overfitting']"
6784,1809.03918,Benjamin Finley,"Benjamin Finley, Eren Boz, Kalevi Kilkki, Jukka Manner, Antti
  Oulasvirta, Heikki H\""amm\""ainen",Does network quality matter? A field study of mobile user satisfaction,Accepted Manuscript,"B. Finley, E. Boz, K. Kilkki, J. Manner, A. Oulasvirta, H.
  H\""amm\""ainen, Does network quality matter? A field study of mobile user
  satisfaction, Pervasive and Mobile Computing, Volume 39, 2017, Pages 80-99",10.1016/j.pmcj.2016.08.014,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile quality of experience and user satisfaction are growing research
topics. However, the relationship between a user's satisfaction with network
quality and the networks real performance in the field remains unexplored. This
paper is the first to study both network and non-network predictors of user
satisfaction in the wild. We report findings from a large sample (2224 users
over 12 months) combining both questionnaires and network measurements. We
found that minimum download goodput and device type predict satisfaction with
network availability. Whereas for network speed, only download factors
predicted satisfaction. We observe that users integrate over many measurements
and exhibit a known peak-end effect in their ratings. These results can inform
modeling efforts in quality of experience and user satisfaction.
","[{'version': 'v1', 'created': 'Tue, 11 Sep 2018 14:21:07 GMT'}]",2018-09-12,"[['Finley', 'Benjamin', ''], ['Boz', 'Eren', ''], ['Kilkki', 'Kalevi', ''], ['Manner', 'Jukka', ''], ['Oulasvirta', 'Antti', ''], ['Hämmäinen', 'Heikki', '']]","['User Satisfaction', 'Quality of Experience', 'Network Measurements']"
6785,2004.10849,Wendi Feng,"Wendi Feng, Chuanchang Liu, Zehua Guo, Thar Baker, Gang Wang, Meng
  Wang, Bo Cheng, Junliang Chen","MobiGyges: A mobile hidden volume for preventing data loss, improving
  storage utilization, and avoiding device reboot",Future Generation Computer Systems (2020),,10.1016/j.future.2020.03.048,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sensitive data protection is essential for mobile users. Plausibly Deniable
Encryption (PDE) systems provide an effective manner to protect sensitive data
by hiding them on the device. However, existing PDE systems can lose data due
to overriding the hidden volume, waste physical storage because of the reserved
area used for avoiding data loss, and require device reboot when using the
hidden volume. This paper presents MobiGyges, a hidden volume-based mobile PDE
system, to fill the gap. MobiGyges addresses the problem of data loss by
restricting each storage block used only by one volume, and it improves storage
utilization by eliminating the reserved area. MobiGyges can also avoid device
reboot by mounting the hidden volume dynamically on-demand with the Dynamic
Mounting service. Moreover, we identify two novel PDE oriented attacks, the
capacity comparison attack and the fill-to-full attack. MobiGyges can defend
them by jointly leveraging the Shrunk U-disk method and multi-level
deniability. We implement the MobiGyges proof-of-concept system on a real
mobile phone Google Nexus 6P with LineageOS 13. Experimental results show that
MobiGyges prevents data loss, avoids device reboot, improves storage
utilization by over 30% with acceptable performance overhead compared with
current works.
","[{'version': 'v1', 'created': 'Wed, 22 Apr 2020 20:51:32 GMT'}]",2020-04-24,"[['Feng', 'Wendi', ''], ['Liu', 'Chuanchang', ''], ['Guo', 'Zehua', ''], ['Baker', 'Thar', ''], ['Wang', 'Gang', ''], ['Wang', 'Meng', ''], ['Cheng', 'Bo', ''], ['Chen', 'Junliang', '']]","['data loss preventing', 'hidden volume', 'improving storage utilization', 'sensitive data protection', 'avoiding reboot']"
6786,1806.07740,Mehran Hosseini,"Shaull Almagor, Brynmor Chapman, Mehran Hosseini, Jo\""el Ouaknine,
  James Worrell",Effective Divergence Analysis for Linear Recurrence Sequences,Published in CONCUR 2018,,10.4230/LIPIcs.CONCUR.2018.42,,cs.CC cs.DM,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We study the growth behaviour of rational linear recurrence sequences. We
show that for low-order sequences, divergence is decidable in polynomial time.
We also exhibit a polynomial-time algorithm which takes as input a divergent
rational linear recurrence sequence and computes effective fine-grained lower
bounds on the growth rate of the sequence.
","[{'version': 'v1', 'created': 'Wed, 20 Jun 2018 14:01:22 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Nov 2021 17:42:03 GMT'}]",2021-11-22,"[['Almagor', 'Shaull', ''], ['Chapman', 'Brynmor', ''], ['Hosseini', 'Mehran', ''], ['Ouaknine', 'Joël', ''], ['Worrell', 'James', '']]","['Linear Recurrence Sequences', 'Divergence', 'Algebraic Numbers', 'Positivity']"
6787,2109.04344,Zhi Wang,"Zhi Wang, Chaoge Liu, Xiang Cui, Jie Yin, Xutong Wang",EvilModel 2.0: Bringing Neural Network Models into Malware Attacks,"A newer version of this paper has been accepted at Computers &
  Security. Free access to the final version at
  https://authors.elsevier.com/c/1fJhFc43uylbS before August 16, 2022. This
  paper is an extended version of work that was first presented at the 26th
  IEEE Symposium on Computers and Communications (ISCC 2021)",Computers & Security (2022): 102807,10.1016/j.cose.2022.102807,,cs.CR cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Security issues have gradually emerged with the continuous development of
artificial intelligence (AI). Earlier work verified the possibility of
converting neural network models into stegomalware, embedding malware into a
model with limited impact on the model's performance. However, existing methods
are not applicable in real-world attack scenarios and do not attract enough
attention from the security community due to performance degradation and
additional workload. Therefore, we propose an improved stegomalware EvilModel.
By analyzing the composition of the neural network model, three new methods for
embedding malware into the model are proposed: MSB reservation, fast
substitution, and half substitution, which can embed malware that accounts for
half of the model's volume without affecting the model's performance. We built
550 EvilModels using ten mainstream neural network models and 19 malware
samples. The experiment shows that EvilModel achieved an embedding rate of
48.52\%. A quantitative algorithm is proposed to evaluate the existing
embedding methods. We also design a trigger and propose a threat scenario for
the targeted attack. The practicality and effectiveness of the proposed methods
were demonstrated by experiments and analyses of the embedding capacity,
performance impact, and detection evasion.
","[{'version': 'v1', 'created': 'Thu, 9 Sep 2021 15:31:33 GMT'}, {'version': 'v2', 'created': 'Sat, 13 Nov 2021 16:16:02 GMT'}, {'version': 'v3', 'created': 'Tue, 28 Jun 2022 09:00:19 GMT'}]",2022-06-29,"[['Wang', 'Zhi', ''], ['Liu', 'Chaoge', ''], ['Cui', 'Xiang', ''], ['Yin', 'Jie', ''], ['Wang', 'Xutong', '']]","['Neural Network', 'Malware', 'AI-powered Attack', 'Network Security', 'Steganography']"
6788,2204.12726,Yameng Peng,"Yameng Peng, Andy Song, Vic Ciesielski, Haytham M. Fayek, Xiaojun
  Chang",PRE-NAS: Predictor-assisted Evolutionary Neural Architecture Search,Accepted by GECCO 2022,,10.1145/3512290.3528727,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural architecture search (NAS) aims to automate architecture engineering in
neural networks. This often requires a high computational overhead to evaluate
a number of candidate networks from the set of all possible networks in the
search space during the search. Prediction of the networks' performance can
alleviate this high computational overhead by mitigating the need for
evaluating every candidate network. Developing such a predictor typically
requires a large number of evaluated architectures which may be difficult to
obtain. We address this challenge by proposing a novel evolutionary-based NAS
strategy, Predictor-assisted E-NAS (PRE-NAS), which can perform well even with
an extremely small number of evaluated architectures. PRE-NAS leverages new
evolutionary search strategies and integrates high-fidelity weight inheritance
over generations. Unlike one-shot strategies, which may suffer from bias in the
evaluation due to weight sharing, offspring candidates in PRE-NAS are
topologically homogeneous, which circumvents bias and leads to more accurate
predictions. Extensive experiments on NAS-Bench-201 and DARTS search spaces
show that PRE-NAS can outperform state-of-the-art NAS methods. With only a
single GPU searching for 0.6 days, competitive architecture can be found by
PRE-NAS which achieves 2.40% and 24% test error rates on CIFAR-10 and ImageNet
respectively.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2022 06:40:39 GMT'}]",2022-04-28,"[['Peng', 'Yameng', ''], ['Song', 'Andy', ''], ['Ciesielski', 'Vic', ''], ['Fayek', 'Haytham M.', ''], ['Chang', 'Xiaojun', '']]","['Evolutionary algorithm', 'architecture search', 'performance predictor']"
6789,1906.00923,Michael Fromm,"Michael Fromm, Evgeniy Faerman, Thomas Seidl",TACAM: Topic And Context Aware Argument Mining,,,10.1145/3350546.3352506,,cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we address the problem of argument search. The purpose of
argument search is the distillation of pro and contra arguments for requested
topics from large text corpora. In previous works, the usual approach is to use
a standard search engine to extract text parts which are relevant to the given
topic and subsequently use an argument recognition algorithm to select
arguments from them. The main challenge in the argument recognition task, which
is also known as argument mining, is that often sentences containing arguments
are structurally similar to purely informative sentences without any stance
about the topic. In fact, they only differ semantically. Most approaches use
topic or search term information only for the first search step and therefore
assume that arguments can be classified independently of a topic. We argue that
topic information is crucial for argument mining, since the topic defines the
semantic context of an argument. Precisely, we propose different models for the
classification of arguments, which take information about a topic of an
argument into account. Moreover, to enrich the context of a topic and to let
models understand the context of the potential argument better, we integrate
information from different external sources such as Knowledge Graphs or
pre-trained NLP models. Our evaluation shows that considering topic
information, especially in connection with external information, provides a
significant performance boost for the argument mining task.
","[{'version': 'v1', 'created': 'Sun, 26 May 2019 07:06:58 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Aug 2019 12:33:44 GMT'}]",2019-08-27,"[['Fromm', 'Michael', ''], ['Faerman', 'Evgeniy', ''], ['Seidl', 'Thomas', '']]","['transfer learning', 'argument mining', 'argument search', 'natural language processing']"
6790,2003.05385,Ehsan Kharazmi,"Ehsan Kharazmi, Zhongqiang Zhang, George Em Karniadakis","hp-VPINNs: Variational Physics-Informed Neural Networks With Domain
  Decomposition",,,10.1016/j.cma.2020.113547,,cs.NE cs.LG cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We formulate a general framework for hp-variational physics-informed neural
networks (hp-VPINNs) based on the nonlinear approximation of shallow and deep
neural networks and hp-refinement via domain decomposition and projection onto
space of high-order polynomials. The trial space is the space of neural
network, which is defined globally over the whole computational domain, while
the test space contains the piecewise polynomials. Specifically in this study,
the hp-refinement corresponds to a global approximation with local learning
algorithm that can efficiently localize the network parameter optimization. We
demonstrate the advantages of hp-VPINNs in accuracy and training cost for
several numerical examples of function approximation and solving differential
equations.
","[{'version': 'v1', 'created': 'Wed, 11 Mar 2020 16:06:34 GMT'}]",2020-12-30,"[['Kharazmi', 'Ehsan', ''], ['Zhang', 'Zhongqiang', ''], ['Karniadakis', 'George Em', '']]","['physics-informed learning', 'VPINNs', 'variational neural network', 'domain decomposition', 'automaticdifferentiation', 'hp-refinement', 'partial differential equations']"
6791,2204.09817,Ozan Oktay,"Benedikt Boecking, Naoto Usuyama, Shruthi Bannur, Daniel C. Castro,
  Anton Schwaighofer, Stephanie Hyland, Maria Wetscherek, Tristan Naumann,
  Aditya Nori, Javier Alvarez-Valle, Hoifung Poon, and Ozan Oktay","Making the Most of Text Semantics to Improve Biomedical Vision--Language
  Processing","To appear in ECCV 2022. Code: https://aka.ms/biovil-code Dataset:
  https://aka.ms/ms-cxr Demo Notebook: https://aka.ms/biovil-demo-notebook","Computer Vision - ECCV 2022, LNCS vol 13696, pp 1-21",10.1007/978-3-031-20059-5_1,,cs.CV cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-modal data abounds in biomedicine, such as radiology images and
reports. Interpreting this data at scale is essential for improving clinical
care and accelerating clinical research. Biomedical text with its complex
semantics poses additional challenges in vision--language modelling compared to
the general domain, and previous work has used insufficiently adapted models
that lack domain-specific language understanding. In this paper, we show that
principled textual semantic modelling can substantially improve contrastive
learning in self-supervised vision--language processing. We release a language
model that achieves state-of-the-art results in radiology natural language
inference through its improved vocabulary and novel language pretraining
objective leveraging semantics and discourse characteristics in radiology
reports. Further, we propose a self-supervised joint vision--language approach
with a focus on better text modelling. It establishes new state of the art
results on a wide range of publicly available benchmarks, in part by leveraging
our new domain-specific language model. We release a new dataset with
locally-aligned phrase grounding annotations by radiologists to facilitate the
study of complex semantic modelling in biomedical vision--language processing.
A broad evaluation, including on this new dataset, shows that our contrastive
learning approach, aided by textual-semantic modelling, outperforms prior
methods in segmentation tasks, despite only using a global-alignment objective.
","[{'version': 'v1', 'created': 'Thu, 21 Apr 2022 00:04:35 GMT'}, {'version': 'v2', 'created': 'Tue, 17 May 2022 00:30:53 GMT'}, {'version': 'v3', 'created': 'Thu, 14 Jul 2022 20:45:13 GMT'}, {'version': 'v4', 'created': 'Thu, 21 Jul 2022 14:46:17 GMT'}]",2022-12-08,"[['Boecking', 'Benedikt', ''], ['Usuyama', 'Naoto', ''], ['Bannur', 'Shruthi', ''], ['Castro', 'Daniel C.', ''], ['Schwaighofer', 'Anton', ''], ['Hyland', 'Stephanie', ''], ['Wetscherek', 'Maria', ''], ['Naumann', 'Tristan', ''], ['Nori', 'Aditya', ''], ['Alvarez-Valle', 'Javier', ''], ['Poon', 'Hoifung', ''], ['Oktay', 'Ozan', '']]","['self-supervision', 'multi-modal', 'weak supervision', 'radiology']"
6792,2109.10149,Yunlong Wang,"Yunlong Wang, Priyadarshini Venkatesh, Brian Y. Lim","Interpretable Directed Diversity: Leveraging Model Explanations for
  Iterative Crowd Ideation",,,10.1145/3491102.3517551,,cs.HC cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Feedback in creativity support tools can help crowdworkers to improve their
ideations. However, current feedback methods require human assessment from
facilitators or peers. This is not scalable to large crowds. We propose
Interpretable Directed Diversity to automatically predict ideation quality and
diversity scores, and provide AI explanations - Attribution, Contrastive
Attribution, and Counterfactual Suggestions - to feedback on why ideations were
scored (low), and how to get higher scores. These explanations provide
multi-faceted feedback as users iteratively improve their ideations. We
conducted formative and controlled user studies to understand the usage and
usefulness of explanations to improve ideation diversity and quality. Users
appreciated that explanation feedback helped focus their efforts and provided
directions for improvement. This resulted in explanations improving diversity
compared to no feedback or feedback with scores only. Hence, our approach opens
opportunities for explainable AI towards scalable and rich feedback for
iterative crowd ideation and creativity support tools.
","[{'version': 'v1', 'created': 'Tue, 21 Sep 2021 13:01:05 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Jan 2022 07:49:58 GMT'}, {'version': 'v3', 'created': 'Wed, 2 Mar 2022 12:04:43 GMT'}, {'version': 'v4', 'created': 'Mon, 28 Mar 2022 13:34:00 GMT'}]",2022-03-29,"[['Wang', 'Yunlong', ''], ['Venkatesh', 'Priyadarshini', ''], ['Lim', 'Brian Y.', '']]","['Explainable AI', 'Diversity', 'Collective Creativity', 'Crowdsourcing']"
6793,2002.06191,Daniel Speicher,"Daniel Speicher (Bonn-Aachen International Center for Information
  Technology, B-IT, Germany)","Did JHotDraw Respect the Law of Good Style?: A deep dive into the nature
  of false positives of bad code smells",,"The Art, Science, and Engineering of Programming, 2020, Vol. 4,
  Issue 3, Article 14",10.22152/programming-journal.org/2020/4/14,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Developers need to make a constant effort to improve the quality of their
code if they want to stay productive. Tools that highlight code locations that
could benefit from refactoring are thus highly desirable. The most common name
for such locations is ""bad code smell"". A number of tools offer such quality
feedback and there is a substantial body of related research. However, all
these tools, including those based on Machine Learning, still produce false
positives. Every single false positive shown to the developer places a
cognitive burden on her and should thus be avoided. The literature discusses
the choice of metric thresholds, the general subjectivity of such a judgment
and the relation to conscious design choices, ""design ideas"". To examine false
positives and the relation between bad smells and design ideas, we designed and
conducted an exploratory case study. While previous research presented a broad
overview, we have chosen a narrow setting to reach for even deeper insights:
The framework JHotDraw had been designed so thoughtfully that most smell
warnings are expected to be false positives. Nevertheless, the ""Law of Good
Style"", better known as the ""Law of Demeter"", is a rather restrictive design
rule so that we still expected to find some potential bad smells, i.e.
violations of this ""Law"". This combination led to 1215 potential smells of
which at most 42 are true positives. We found generic as well as specific
design ideas that were traded for the smell. Our confidence in that decision
ranged from high enough to very high. We were surprised to realize that the
smell definition itself required the formulation of constructive design ideas.
Finally we found some smells to be the result of the limitation of the language
and one could introduce auxiliary constructive design ideas to compensate for
them. The decision whether a potential smell occurrence is actually a true
positive was made very meticulously. For that purpose we took three qualities
that the smell could affect negatively into account and we discussed the result
of the recommended refactorings. If we were convinced that we had found a false
positive, we described the relationships with design ideas. The realization
that not only general design ideas but also specific design ideas have an
influence on whether a potential smell is a true positive turns the problem of
false positives from a scientific problem (""What is the true definition of the
smell?"") to a engineering problem (""How can we incorporate design ideas into
smell definitions?""). We recommend to add adaptation points to the smell
definitions. Higher layers may then adapt the smell for specific contexts.
After adaptation the tool may continuously provide distinct and precise quality
feedback, reducing the cognitive load for the developer and preventing
habituation. Furthermore, the schema for the discussion of potential smells may
be used to elaborate more sets of true and false smell occurrences. Finally, it
follows that smell detection based on machine learning should also take signs
of design ideas into account.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 18:59:46 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Jun 2020 19:01:20 GMT'}]",2020-06-08,"[['Speicher', 'Daniel', '', 'Bonn-Aachen International Center for Information\n  Technology, B-IT, Germany']]","['Code Quality', 'Bad Code Smell', 'False Positives', 'Design Ideas']"
6794,2103.06343,Luiz Capretz Dr.,"Pradeep Waychal, Luiz Fernando Capretz, Jingdong Jia, Daniel Varona,
  Yadira Lizama",Practitioners Testimonials about Software Testing,,,10.1109/SANER50967.2021.00070,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As software systems are becoming more pervasive, they are also becoming more
susceptible to failures, resulting in potentially lethal combinations. Software
testing is critical to preventing software failures but is, arguably, the least
understood part of the software life cycle and the toughest to perform
correctly. Adequate research has been carried out in both the process and
technology dimensions of testing, but not in the human dimensions. This paper
attempts to fill in the gap by exploring the human dimension, i.e., trying to
understand the motivation of software professionals to take up and sustain
testing careers. Towards that end, a survey was conducted in four countries -
India, Canada, Cuba, and China - to try to understand how professional software
testers perceive and value work-related factors that could influence their
motivation to take up and sustain testing careers. With a sample of 220
software professionals, we observed that very few professionals are keen to
take up testing careers. Some aspects of software testing, such as the learning
opportunities, appear to be a common motivator across the four countries;
whereas the treatment meted out to testers as second-class citizens and the
complexity of the job appeared to be the most important de-motivators. This
comparative study offers useful insights that can help global software industry
leaders to come up with an action plan to put the software testing profession
under a new light. That could increase the number of software engineers
choosing testing careers, which would facilitate quality testing.
","[{'version': 'v1', 'created': 'Wed, 10 Mar 2021 21:08:11 GMT'}]",2021-03-12,"[['Waychal', 'Pradeep', ''], ['Capretz', 'Luiz Fernando', ''], ['Jia', 'Jingdong', ''], ['Varona', 'Daniel', ''], ['Lizama', 'Yadira', '']]","['software testing', 'testing professionals', 'testers', 'V&V']"
6795,1307.0052,Fang Zhaoxi,"Zhaoxi Fang, Xin Wang, and Xiaojun Yuan","Beamforming Design for Multiuser Two-Way Relaying: A Unified Approach
  via Max-Min SINR","31 pages, 9 figures, submitted to IEEE Trans. Signal Process",,10.1109/TSP.2013.2281032,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we develop a unified framework for beamforming designs in
non-regenerative multiuser two-way relaying (TWR).
","[{'version': 'v1', 'created': 'Sat, 29 Jun 2013 00:38:45 GMT'}]",2015-06-16,"[['Fang', 'Zhaoxi', ''], ['Wang', 'Xin', ''], ['Yuan', 'Xiaojun', '']]","['Two-way relaying', 'beamforming', 'fractional program', 'semi-definite program', 'monotonic optimiza']"
6796,2103.03374,A. Erdem Sariyuce,Ahmet Erdem Sariyuce,Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks,"12 pages, 8 figures. To appear in The Web Conference (WWW) 2021",,10.1145/3442381.3450055,,cs.SI math.CO physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  Dense regions in networks are an indicator of interesting and unusual
information. However, most existing methods only consider simple, undirected,
unweighted networks. Complex networks in the real-world often have rich
information though: edges are asymmetrical and nodes/edges have categorical and
numerical attributes. Finding dense subgraphs in such networks in accordance
with this rich information is an important problem with many applications.
Furthermore, most existing algorithms ignore the higher-order relationships
(i.e., motifs) among the nodes. Motifs are shown to be helpful for dense
subgraph discovery but their wide spectrum in heterogeneous networks makes it
challenging to utilize them effectively. In this work, we propose quark
decomposition framework to locate dense subgraphs that are rich with a given
motif. We focus on networks with directed edges and categorical attributes on
nodes/edges. For a given motif, our framework builds subgraphs, called quarks,
in varying quality and with hierarchical relations. Our framework is versatile,
efficient, and extendible. We discuss the limitations and practical
instantiations of our framework as well as the role confusion problem that
needs to be considered in directed networks. We give an extensive evaluation of
our framework in directed, signed-directed, and node-labeled networks. We
consider various motifs and evaluate the quark decomposition using several
real-world networks. Results show that quark decomposition performs better than
the state-of-the-art techniques. Our framework is also practical and scalable
to networks with up to 101M edges.
","[{'version': 'v1', 'created': 'Thu, 4 Mar 2021 22:57:34 GMT'}]",2021-03-08,"[['Sariyuce', 'Ahmet Erdem', '']]","['graph motif', '𝑘-core', '𝑘-truss', 'dense subgraph discovery']"
6797,2008.06153,Takao Miki,"Takao Miki, Takayuki Yamada","Topology optimization considering the distortion in additive
  manufacturing","35 pages, 20 figures",,10.1016/j.finel.2021.103558,,cs.CE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Additive manufacturing is a free-form manufacturing technique in which parts
are built in a layer-by-layer manner. Laser powder bed fusion is one of the
popular techniques used to fabricate metal parts. However, it induces residual
stress and distortion during fabrication that adversely affects the mechanical
properties and dimensional accuracy of the manufactured parts. Therefore,
predicting and avoiding the residual stress and distortion are critical issues.
In this study, we propose a topology optimization method that accounts for the
distortion. First, we propose a computationally inexpensive analytical model
for additive manufacturing that uses laser powder bed fusion and formulated an
optimization problem. Next, we approximate the topological derivative of the
objective function using an adjoint variable method that is then utilized to
update the level set function via a time evolutionary reaction-diffusion
equation. Finally, the validity and effectiveness of the proposed optimization
method was established using two-dimensional design examples.
","[{'version': 'v1', 'created': 'Fri, 14 Aug 2020 01:18:46 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Feb 2021 05:12:30 GMT'}]",2021-05-07,"[['Miki', 'Takao', ''], ['Yamada', 'Takayuki', '']]","['Topology optimization', 'Level set method', 'Metal additivemanufacturing', 'Inherent strain method']"
6798,2004.06842,Chien-Chun Ni,"Chien-Chun Ni, Kin Sum Liu, Nicolas Torzec","Layered Graph Embedding for Entity Recommendation using Wikipedia in the
  Yahoo! Knowledge Graph","8 pages, 4 figures, 8 tables. To be appeared in Wiki Workshop 2020,
  Companion Proceedings of the Web Conference 2020(WWW 20 Companion), Taipei,
  Taiwan",,10.1145/3366424.3383570,,cs.IR cs.LG cs.SI,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we describe an embedding-based entity recommendation framework
for Wikipedia that organizes Wikipedia into a collection of graphs layered on
top of each other, learns complementary entity representations from their
topology and content, and combines them with a lightweight learning-to-rank
approach to recommend related entities on Wikipedia. Through offline and online
evaluations, we show that the resulting embeddings and recommendations perform
well in terms of quality and user engagement. Balancing simplicity and quality,
this framework provides default entity recommendations for English and other
languages in the Yahoo! Knowledge Graph, which Wikipedia is a core subset of.
","[{'version': 'v1', 'created': 'Wed, 15 Apr 2020 00:49:27 GMT'}]",2020-04-16,"[['Ni', 'Chien-Chun', ''], ['Liu', 'Kin Sum', ''], ['Torzec', 'Nicolas', '']]","['knowledge graph', 'entity recommendation', 'representation learning', 'graph embedding', 'learning-to-rank']"
6799,1803.10195,Tomas Petricek,"Tomas Petricek (The Alan Turing Institute, United Kingdom)",What we talk about when we talk about monads,,"The Art, Science, and Engineering of Programming, 2018, Vol. 2,
  Issue 3, Article 12",10.22152/programming-journal.org/2018/2/12,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer science provides an in-depth understanding of technical aspects of
programming concepts, but if we want to understand how programming concepts
evolve, how programmers think and talk about them and how they are used in
practice, we need to consider a broader perspective that includes historical,
philosophical and cognitive aspects. In this paper, we develop such broader
understanding of monads, a programming concept that has an infamous formal
definition, syntactic support in several programming languages and a reputation
for being elegant and powerful, but also intimidating and difficult to grasp.
This paper is not a monad tutorial. It will not tell you what a monad is.
Instead, it helps you understand how computer scientists and programmers talk
about monads and why they do so. To answer these questions, we review the
history of monads in the context of programming and study the development
through the perspectives of philosophy of science, philosophy of mathematics
and cognitive sciences. More generally, we present a framework for
understanding programming concepts that considers them at three levels: formal,
metaphorical and implementation. We base such observations on established
results about the scientific method and mathematical entities -- cognitive
sciences suggest that the metaphors used when thinking about monads are more
important than widely accepted, while philosophy of science explains how the
research paradigm from which monads originate influences and restricts their
use. Finally, we provide evidence for why a broader philosophical, sociological
look at programming concepts should be of interest for programmers. It lets us
understand programming concepts better and, fundamentally, choose more
appropriate abstractions as illustrated in number of case studies that conclude
the paper.
","[{'version': 'v1', 'created': 'Tue, 27 Mar 2018 17:35:50 GMT'}]",2018-03-28,"[['Petricek', 'Tomas', '', 'The Alan Turing Institute, United Kingdom']]","['monad', 'programming concept', 'abstraction', 'philosophy of science', 'metaphor']"
6800,2002.11944,Asif Ahmed Neloy,"R. A. Bindu, A. A. Neloy, S. Alam, N. J Moni, S. Siddique","Sigma-3: Integration and Analysis of a 6 DOF Robotic Arm Configuration
  in a Rescue Robot","6 pages, 4 figures, To be appear in the proceedings of 2019 4th
  International Conference on Robotics and Automation Engineering. Singapore
  November 22-24, 2019",,10.1109/ICRAE48301.2019.9043799,,cs.RO cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper introduces a rescue robot named Sigma 3 which is developed for
potential applications such as helping hands for humans where a human can not
reach to have an assessment of the hazardous environment. Also, these kinds of
robot can be controlled remotely with an adequate control system. The proposed
methodology forces on two issues : 1. Novel mechanism design for measuring
rotation, joints, links of Degree of Freedom DOF for an arm which is integrated
with Sigma 3, 2. Precise measuring of end effector motion control over three
dimensions. In the proposed mechanism design, the DOF measurement is presented
by a planar and spatial mechanism where 4 types of rigid joints build up each
DOF with controlling by six High Torque MG996R servo motors. Rotation and DOF
measurement are consisting of different theoretical references of Rotation
Matrix, Inverse Kinematics with experimental results. Presented methodology
over Oscillation Damping performance exhibits less than 3 percent error while
configuring for on hands testing. Another evaluation of operating time state
strongly defends the mechanism of low power consumption ability.
","[{'version': 'v1', 'created': 'Thu, 27 Feb 2020 06:58:20 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Apr 2020 08:24:22 GMT'}]",2020-04-29,"[['Bindu', 'R. A.', ''], ['Neloy', 'A. A.', ''], ['Alam', 'S.', ''], ['Moni', 'N. J', ''], ['Siddique', 'S.', '']]","['Sigma-3', 'Rescue Robot', 'Inverse kinematics', 'Rotation matrix', 'Euler Matrix', '6 DOF robotic arm']"
6801,2107.03925,Francesco Pirotti,"Francesco Pirotti, Alberto Guarnieri, Marco Piragnolo, Marco Boscaro,
  Raffaele Cavalli","Analysis of geospatial behaviour of visitors of urban gardens: is
  positioning via smartphones a valid solution?",,,10.1007/978-3-030-94426-1_26,,cs.CY,http://creativecommons.org/licenses/by-sa/4.0/,"  Tracking locations is practical and speditive with smartphones, as they are
omnipresent devices, relatively cheap, and have the necessary sensors for
positioning and networking integrated in the same box. Nowadays recent models
have GNSS antennas capable of receiving multiple constellations. In the
proposed work we test the hypothesis that GNSS positions directly recorded by
smartphones can be a valid solution for spatial analysis of people's behaviour
in an urban garden. Particular behaviours can be linked to therapeutic spots
that promote health and well-being of visitors. Three parts are reported: (i)
assessment of the accuracy of the positions relative to a reference track, (ii)
implementation of a framework for automating transmission and processing of the
location information, (iii) analysis of preferred spots via spatial analytics.
Different devices were used to survey at different times and with different
methods, i.e. in the pocket of the owner or on a rigid frame. Accuracy was
estimated using distance of each located point to the reference track, and
precision was estimated with static multiple measures. A chat-bot through the
Telegram application was implemented to allow users to send their data to a
centralized computing environment thus automating the spatial analysis. Results
report a horizontal accuracy below ~2.3 m at 95% confidence level, without
significant difference between surveys, and very little differences between
devices. GNSS-only and assisted navigation with telephone cells also did not
show significant difference. Autocorrelation of the residuals over time and
space showed strong consistency of the residuals, thus proving a valid solution
for spatial analysis of walking behaviour.
","[{'version': 'v1', 'created': 'Sun, 20 Jun 2021 08:32:05 GMT'}]",2022-01-20,"[['Pirotti', 'Francesco', ''], ['Guarnieri', 'Alberto', ''], ['Piragnolo', 'Marco', ''], ['Boscaro', 'Marco', ''], ['Cavalli', 'Raffaele', '']]","['navigation', 'global navigation satellite systems', 'smartphone', 'low-cost positioning', 'health and well-being (H&WB)']"
6802,1810.01351,Elena Guti\'errez Viedma,Pierre Ganty and Elena Guti\'errez,The Parikh Property for Weighted Context-Free Grammars,"29 pages, 2 figures, long version of FSTTCS'18 paper",,10.4230/LIPIcs.FSTTCS.2018,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parikh's Theorem states that every context-free grammar (CFG) is equivalent
to some regular CFG when the ordering of symbols in the words is ignored. The
same is not true for the so-called weighted CFGs, which additionally assign a
weight to each grammar rule. If the result holds for a given weighted CFG $G$,
we say that $G$ satisfies the Parikh property. We prove constructively that the
Parikh property holds for every weighted nonexpansive CFG. We also give a
decision procedure for the property when the weights are over the rationals.
","[{'version': 'v1', 'created': 'Tue, 2 Oct 2018 16:22:27 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Dec 2018 14:49:19 GMT'}, {'version': 'v3', 'created': 'Wed, 19 Jun 2019 01:24:47 GMT'}]",2019-06-20,"[['Ganty', 'Pierre', ''], ['Gutiérrez', 'Elena', '']]","['Weighted Context-Free Grammars', 'Algebraic Language Theory', 'ParikhImage']"
6803,2202.06335,Xinjie Lin,"Xinjie Lin, Gang Xiong, Gaopeng Gou, Zhen Li, Junzheng Shi, Jing Yu","ET-BERT: A Contextualized Datagram Representation with Pre-training
  Transformers for Encrypted Traffic Classification","This work has been accepted in Security, Privacy, and Trust track at
  The Web Conference 2022 (WWW'22)(see
  https://www2022.thewebconf.org/cfp/research/security/)",,10.1145/3485447.3512217,,cs.CR cs.AI cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Encrypted traffic classification requires discriminative and robust traffic
representation captured from content-invisible and imbalanced traffic data for
accurate classification, which is challenging but indispensable to achieve
network security and network management. The major limitation of existing
solutions is that they highly rely on the deep features, which are overly
dependent on data size and hard to generalize on unseen data. How to leverage
the open-domain unlabeled traffic data to learn representation with strong
generalization ability remains a key challenge. In this paper,we propose a new
traffic representation model called Encrypted Traffic Bidirectional Encoder
Representations from Transformer (ET-BERT), which pre-trains deep
contextualized datagram-level representation from large-scale unlabeled data.
The pre-trained model can be fine-tuned on a small number of task-specific
labeled data and achieves state-of-the-art performance across five encrypted
traffic classification tasks, remarkably pushing the F1 of ISCX-Tor to 99.2%
(4.4% absolute improvement), ISCX-VPN-Service to 98.9% (5.2% absolute
improvement), Cross-Platform (Android) to 92.5% (5.4% absolute improvement),
CSTNET-TLS 1.3 to 97.4% (10.0% absolute improvement). Notably, we provide
explanation of the empirically powerful pre-training model by analyzing the
randomness of ciphers. It gives us insights in understanding the boundary of
classification ability over encrypted traffic. The code is available at:
https://github.com/linwhitehat/ET-BERT.
","[{'version': 'v1', 'created': 'Sun, 13 Feb 2022 14:54:48 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Feb 2022 05:10:36 GMT'}]",2022-02-22,"[['Lin', 'Xinjie', ''], ['Xiong', 'Gang', ''], ['Gou', 'Gaopeng', ''], ['Li', 'Zhen', ''], ['Shi', 'Junzheng', ''], ['Yu', 'Jing', '']]","['Encrypted Traffic Classification', 'Pre-training', 'Transformer', 'MaskedBURST Model', 'Same-origin BURST Prediction']"
6804,2009.11229,Senthil Velan S Dr,Senthil Velan S,"Introducing Aspect-Oriented Programming in Improving the Modularity of
  Middleware for Internet of Things",,,10.1109/ASET48392.2020.9118238,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet of Things (IoT) has become the buzzword for the development of Smart
City and its applications. In this context, development of supporting software
forms the core part of the IoT infrastructure. A Middleware sits in between the
IoT devices and interacts between them to exchange data among the components of
the automated architecture. The Middleware services include hand shaking, data
transfer and security among its core set of functionalities. It also includes
cross-cutting functional services such as authentication, logging and caching.
A software that can run these Middleware services requires a careful choice of
a good software modelling technique. Aspect-Oriented Programming (AOP) is a
software development methodology that can be used to independently encapsulate
the core and cross-cutting functionalities of the Middleware services of the
IoT infrastructure. In this paper, an attempt has been made using a simulation
environment to independently model the two orthogonal functionalities of the
Middleware with the focus to improve its modularity. Further, a quantitative
measurement of the core design property of cohesion has been done to infer on
the improvement in the reusability of the modules encapsulated in the
Middleware of IoT. Based on the measurement, it was found that the modularity
and reusability of functionalities in the Middleware software has improved in
the AspectJ version compared to its equivalent Java version.
","[{'version': 'v1', 'created': 'Wed, 23 Sep 2020 16:01:03 GMT'}]",2020-09-24,"[['S', 'Senthil Velan', '']]","['Internet of Things', 'Middleware', 'Aspect-Oriented Software Development', 'Aspect-Oriented Programming', 'Cohesion Metrics', 'Modularity', 'Reusability']"
6805,1907.02245,Pablo Antolin,"Pablo Antolin, Annalisa Buffa, Elaine Cohen, John F. Dannenhoffer,
  Gershon Elber, Stefanie Elgeti, Robert Haimes, Richard Riesenfeld",Optimizing micro-tiles in micro-structures as a design paradigm,"13 pages, 13 figures, Submitted to SPM 2019, Published in
  Computer-Aided Design, Volume 115, October 2019, Pages 23-33","Computer-Aided Design, Volume 115, October 2019, Pages 23-33",10.1016/j.cad.2019.05.020,,cs.CG cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, new methods have been developed to synthesize complex porous
and micro-structured geometry in a variety of ways. In this work, we take these
approaches one step further and present these methods as an efficacious design
paradigm. Specifically, complex micro-structure geometry can be synthesized
while optimizing certain properties such as maximal heat exchange in heat
exchangers, or minimal weight under stress specifications. By being able to
adjust the geometry, the topology and/or the material properties of individual
tiles in the micro-structure, possibly in a gradual way, a porous object can be
synthesized that is optimal with respect to the design specifications. As part
of this work, we exemplify this paradigm on a variety of diverse applications.
","[{'version': 'v1', 'created': 'Thu, 4 Jul 2019 06:53:58 GMT'}]",2019-07-05,"[['Antolin', 'Pablo', ''], ['Buffa', 'Annalisa', ''], ['Cohen', 'Elaine', ''], ['Dannenhoffer', 'John F.', ''], ['Elber', 'Gershon', ''], ['Elgeti', 'Stefanie', ''], ['Haimes', 'Robert', ''], ['Riesenfeld', 'Richard', '']]","['Analysis', 'heterogeneous materials', 'topological optimization', 'porous geometry']"
6806,2008.10861,Taisuke Kobayashi,Taisuke Kobayashi and Wendyam Eric Lionel Ilboudo,t-Soft Update of Target Network for Deep Reinforcement Learning,"11 pages, 7 figures","Neural Networks, 2021",10.1016/j.neunet.2020.12.023,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a new robust update rule of target network for deep
reinforcement learning (DRL), to replace the conventional update rule, given as
an exponential moving average. The target network is for smoothly generating
the reference signals for a main network in DRL, thereby reducing learning
variance. The problem with its conventional update rule is the fact that all
the parameters are smoothly copied with the same speed from the main network,
even when some of them are trying to update toward the wrong directions. This
behavior increases the risk of generating the wrong reference signals. Although
slowing down the overall update speed is a naive way to mitigate wrong updates,
it would decrease learning speed. To robustly update the parameters while
keeping learning speed, a t-soft update method, which is inspired by student-t
distribution, is derived with reference to the analogy between the exponential
moving average and the normal distribution. Through the analysis of the derived
t-soft update, we show that it takes over the properties of the student-t
distribution. Specifically, with a heavy-tailed property of the student-t
distribution, the t-soft update automatically excludes extreme updates that
differ from past experiences. In addition, when the updates are similar to the
past experiences, it can mitigate the learning delay by increasing the amount
of updates. In PyBullet robotics simulations for DRL, an online actor-critic
algorithm with the t-soft update outperformed the conventional methods in terms
of the obtained return and/or its variance. From the training process by the
t-soft update, we found that the t-soft update is globally consistent with the
standard soft update, and the update rates are locally adjusted for
acceleration or suppression.
","[{'version': 'v1', 'created': 'Tue, 25 Aug 2020 07:41:47 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Dec 2020 01:56:12 GMT'}]",2021-01-12,"[['Kobayashi', 'Taisuke', ''], ['Ilboudo', 'Wendyam Eric Lionel', '']]","['Deep reinforcement learning', 'Target network', 'Student-t distribution']"
6807,1412.1547,Jonathan Spreer,"Bhaskar Bagchi and Benjamin A. Burton and Basudeb Datta and Nitin
  Singh and Jonathan Spreer",Efficient algorithms to decide tightness,"18 pages, 3 figures","32nd International Symposium on Computational Geometry (SoCG
  2016), Leibniz International Proceedings in Informatics (LIPICS), vol. 51,
  12:1-12:15, 2016",10.4230/LIPIcs.SoCG.2016.12,,cs.CG math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tightness is a generalisation of the notion of convexity: a space is tight if
and only if it is ""as convex as possible"", given its topological constraints.
For a simplicial complex, deciding tightness has a straightforward exponential
time algorithm, but efficient methods to decide tightness are only known in the
trivial setting of triangulated surfaces.
  In this article, we present a new polynomial time procedure to decide
tightness for triangulations of $3$-manifolds -- a problem which previously was
thought to be hard. Furthermore, we describe an algorithm to decide general
tightness in the case of $4$-dimensional combinatorial manifolds which is fixed
parameter tractable in the treewidth of the $1$-skeletons of their vertex
links, and we present an algorithm to decide $\mathbb{F}_2$-tightness for weak
pseudomanifolds $M$ of arbitrary but fixed dimension which is fixed parameter
tractable in the treewidth of the dual graph of $M$.
","[{'version': 'v1', 'created': 'Thu, 4 Dec 2014 03:54:03 GMT'}]",2018-10-24,"[['Bagchi', 'Bhaskar', ''], ['Burton', 'Benjamin A.', ''], ['Datta', 'Basudeb', ''], ['Singh', 'Nitin', ''], ['Spreer', 'Jonathan', '']]","['polynomial time algorithms', 'fixed parameter tractability', 'tighttriangulations', 'simplicial complexes', 'combinatorial invariants']"
6808,2001.04191,Johannes Klaus Fichte,"Johannes K. Fichte, Markus Hecher, Patrick Thier, Stefan Woltran",Exploiting Database Management Systems and Treewidth for Counting,"Under consideration in Theory and Practice of Logic Programming
  (TPLP)",,10.1017/S147106842100003X,,cs.AI cs.DS math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bounded treewidth is one of the most cited combinatorial invariants, which
was applied in the literature for solving several counting problems
efficiently. A canonical counting problem is #SAT, which asks to count the
satisfying assignments of a Boolean formula. Recent work shows that
benchmarking instances for #SAT often have reasonably small treewidth. This
paper deals with counting problems for instances of small treewidth. We
introduce a general framework to solve counting questions based on
state-of-the-art database management systems (DBMS). Our framework takes
explicitly advantage of small treewidth by solving instances using dynamic
programming (DP) on tree decompositions (TD). Therefore, we implement the
concept of DP into a DBMS (PostgreSQL), since DP algorithms are already often
given in terms of table manipulations in theory. This allows for elegant
specifications of DP algorithms and the use of SQL to manipulate records and
tables, which gives us a natural approach to bring DP algorithms into practice.
To the best of our knowledge, we present the first approach to employ a DBMS
for algorithms on TDs. A key advantage of our approach is that DBMS naturally
allow to deal with huge tables with a limited amount of main memory (RAM),
parallelization, as well as suspending computation.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2020 12:45:22 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Feb 2021 16:54:41 GMT'}]",2021-07-01,"[['Fichte', 'Johannes K.', ''], ['Hecher', 'Markus', ''], ['Thier', 'Patrick', ''], ['Woltran', 'Stefan', '']]","['Dynamic Programming', 'Parameterized Algorithmics', 'Bounded Treewidth', 'Database Systems', 'SQL', 'Relational Algebra', 'Counting']"
6809,2301.00443,"Daniela P\""ohn","Daniela P\""ohn und Wolfgang Hommel",TaxIdMA: Towards a Taxonomy for Attacks related to Identities,"The 17th International Conference on Availability, Reliability and
  Security (ARES 2022), August 23-26, 2022, Vienna, Austria",,10.1145/3538969.3544430,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identity management refers to the technology and policies for the
identification, authentication, and authorization of users in computer
networks. Identity management is therefore fundamental to today's IT ecosystem.
At the same time, identity management systems, where digital identities are
managed, pose an attractive target for attacks. With the heterogeneity of
identity management systems, every type (i.e., models, protocols,
implementations) has different requirements, typical problems, and hence attack
vectors. In order to provide a systematic and categorized overview, the
framework Taxonomy for Identity Management Attacks (TaxIdMA) for attacks
related to identities is proposed. The purpose of this framework is to classify
existing attacks associated with system identities, identity management
systems, and end-user identities as well as the background using an extensible
structure from a scientific perspective. The taxonomy is then evaluated with
eight real-world attacks resp. vulnerabilities. This analysis shows the
capability of the proposed taxonomy framework TaxIdMA in describing and
categorizing these attacks.
","[{'version': 'v1', 'created': 'Sun, 1 Jan 2023 17:02:34 GMT'}]",2023-01-03,"[['Hommel', 'Daniela Pöhn und Wolfgang', '']]","['identity', 'identity management', 'taxonomy', 'categorization', 'attack', 'vulnerability']"
6810,2102.01900,Rucha Joshi,Rucha Bhalchandra Joshi and Annada Prasad Behera and Subhankar Mishra,Temporal Motifs in Smart Grid,,"Proceedings of the 9th International Conference on Smart Cities
  and Green ICT Systems - Volume 1: SMARTGREENS 2020, ISBN 978-989-758-418-3,
  pages 122-127",10.5220/0009575301220127,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  A complex network can be characterized by patterns. Such frequently occurring
significant patterns are called motifs and in a time dependent network, they
are called temporal motifs. One of the temporal networks where temporal motifs
are observed and play a major role; is the Smart Grid. The energy consumption
pattern across the appliances, houses, communities and entire cities help
energy utility companies and consumers plan their electricity generation and
consumption. The temporal motifs for the smart grid constitutes of the
consumers and producers and the edge or connection represents energy flow
between two participants of the network, these connections last till the power
is being consumed/generated. This paper formally defines the temporal motifs
for smart grid network and proposes a way to create such temporal motifs in the
network. We also discuss how the temporal motifs fit into the hierarchical
structure of power distribution system of Smart Grid.
","[{'version': 'v1', 'created': 'Wed, 3 Feb 2021 06:41:08 GMT'}]",2021-02-04,"[['Joshi', 'Rucha Bhalchandra', ''], ['Behera', 'Annada Prasad', ''], ['Mishra', 'Subhankar', '']]","['Smart Grid', 'Temporal Motifs', 'Complex Systems', 'Cyber-physicalSystems']"
6811,2006.11652,Philipp Harms,"Martin Bauer, Nicolas Charon, Philipp Harms, and Hsi-Wei Hsieh","A numerical framework for elastic surface matching, comparison, and
  interpolation","21 pages, 11 figures, 1 table, 3 algorithms. Forthcoming in the
  International Journal of Computer Vision",,10.1007/s11263-021-01476-6,,cs.CV math.DG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Surface comparison and matching is a challenging problem in computer vision.
While reparametrization-invariant Sobolev metrics provide meaningful elastic
distances and point correspondences via the geodesic boundary value problem,
solving this problem numerically tends to be difficult. Square root normal
fields (SRNF) considerably simplify the computation of certain elastic
distances between parametrized surfaces. Yet they leave open the issue of
finding optimal reparametrizations, which induce elastic distances between
unparametrized surfaces. This issue has concentrated much effort in recent
years and led to the development of several numerical frameworks. In this
paper, we take an alternative approach which bypasses the direct estimation of
reparametrizations: we relax the geodesic boundary constraint using an
auxiliary parametrization-blind varifold fidelity metric. This reformulation
has several notable benefits. By avoiding altogether the need for
reparametrizations, it provides the flexibility to deal with simplicial meshes
of arbitrary topologies and sampling patterns. Moreover, the problem lends
itself to a coarse-to-fine multi-resolution implementation, which makes the
algorithm scalable to large meshes. Furthermore, this approach extends readily
to higher-order feature maps such as square root curvature fields and is also
able to include surface textures in the matching problem. We demonstrate these
advantages on several examples, synthetic and real.
","[{'version': 'v1', 'created': 'Sat, 20 Jun 2020 20:35:59 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Jun 2021 15:14:23 GMT'}]",2021-06-11,"[['Bauer', 'Martin', ''], ['Charon', 'Nicolas', ''], ['Harms', 'Philipp', ''], ['Hsieh', 'Hsi-Wei', '']]","['elastic shape analysis', 'surfaces', 'squareroot normal fields', 'varifolds']"
6812,2106.15832,Markus Amend,"Nathalie Romo Moreno, Markus Amend, Anna Brunstrom, Andreas Kassler
  and Veselin Rakocevic","CCID5: An implementation of the BBR Congestion Control algorithm for
  DCCP and its impact over multi-path scenarios",,,10.1145/3472305.3472322,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Providing multi-connectivity services is an important goal for next
generation wireless networks, where multiple access networks are available and
need to be integrated into a coherent solution that efficiently supports both
reliable and non reliable traffic. Based on virtual network interfaces and per
path congestion controlled tunnels, the MP-DCCP based multiaccess aggregation
framework presents as a novel solution that flexibly supports different path
schedulers and congestion control algorithms as well as reordering modules. The
framework has been implemented within the Linux kernel space and has been
tested over different prototypes. Experimental results have shown that the
overall performance strongly depends upon the congestion control algorithm used
on the individual DCCP tunnels, denoted as CCID. In this paper, we present an
implementation of the BBR (Bottleneck Bandwidth Round Trip propagation time)
congestion control algorithm for DCCP in the Linux kernel. We show how BBR is
integrated into the MP-DCCP multi-access framework and evaluate its performance
over both single and multi-path environments. Our evaluation results show that
BBR improves the performance compared to CCID2 for multi-path scenarios due to
the faster response to changes in the available bandwidth, which reduces
latency and increases performance, especially for unreliable traffic. the
MP-DCCP framework code, including the new CCID5 is available as OpenSource.
","[{'version': 'v1', 'created': 'Wed, 30 Jun 2021 06:26:02 GMT'}]",2021-07-01,"[['Moreno', 'Nathalie Romo', ''], ['Amend', 'Markus', ''], ['Brunstrom', 'Anna', ''], ['Kassler', 'Andreas', ''], ['Rakocevic', 'Veselin', '']]","['DCCP', 'Multi-path DCCP', 'Congestion Control', 'BBR', 'ATSSS']"
6813,2202.12855,Krishnasuri Narayanam,"Krishnasuri Narayanam, Venkatraman Ramakrishna, Dhinakaran
  Vinayagamurthy and Sandeep Nishad",Atomic cross-chain exchanges of shared assets,,,10.1145/3558535.3559786,,cs.CR cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A core enabler for blockchain or DLT interoperability is the ability to
atomically exchange assets held by mutually untrusting owners on different
ledgers. This atomic swap problem has been well-studied, with the Hash Time
Locked Contract (HTLC) emerging as a canonical solution. HTLC ensures atomicity
of exchange, albeit with caveats for node failure and timeliness of claims. But
a bigger limitation of HTLC is that it only applies to a model consisting of
two adversarial parties having sole ownership of a single asset in each ledger.
Realistic extensions of the model in which assets may be jointly owned by
multiple parties, all of whose consents are required for exchanges, or where
multiple assets must be exchanged for one, are susceptible to collusion attacks
and hence cannot be handled by HTLC. In this paper, we generalize the model of
asset exchanges across DLT networks and present a taxonomy of use cases,
describe the threat model, and propose MPHTLC, an augmented HTLC protocol for
atomic multi-owner-and-asset exchanges. We analyze the correctness, safety, and
application scope of MPHTLC. As proof-of-concept, we show how MPHTLC primitives
can be implemented in networks built on Hyperledger Fabric and Corda, and how
MPHTLC can be implemented in the Hyperledger Labs Weaver framework by
augmenting its existing HTLC protocol.
","[{'version': 'v1', 'created': 'Fri, 25 Feb 2022 18:04:30 GMT'}, {'version': 'v2', 'created': 'Tue, 31 May 2022 12:33:04 GMT'}, {'version': 'v3', 'created': 'Sat, 10 Sep 2022 19:50:03 GMT'}]",2022-09-13,"[['Narayanam', 'Krishnasuri', ''], ['Ramakrishna', 'Venkatraman', ''], ['Vinayagamurthy', 'Dhinakaran', ''], ['Nishad', 'Sandeep', '']]","['blockchain', 'distributed ledger technology', 'fair exchange', 'HTLC', 'shared assets', 'co-ownership', 'atomicity', 'interoperability']"
6814,2201.00763,Phillip Rieger,"Phillip Rieger, Thien Duc Nguyen, Markus Miettinen, Ahmad-Reza Sadeghi","DeepSight: Mitigating Backdoor Attacks in Federated Learning Through
  Deep Model Inspection","18 pages, 8 figures; to appear in the Network and Distributed System
  Security Symposium (NDSS)",,10.14722/ndss.2022.23156,,cs.CR cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Federated Learning (FL) allows multiple clients to collaboratively train a
Neural Network (NN) model on their private data without revealing the data.
Recently, several targeted poisoning attacks against FL have been introduced.
These attacks inject a backdoor into the resulting model that allows
adversary-controlled inputs to be misclassified. Existing countermeasures
against backdoor attacks are inefficient and often merely aim to exclude
deviating models from the aggregation. However, this approach also removes
benign models of clients with deviating data distributions, causing the
aggregated model to perform poorly for such clients.
  To address this problem, we propose DeepSight, a novel model filtering
approach for mitigating backdoor attacks. It is based on three novel techniques
that allow to characterize the distribution of data used to train model updates
and seek to measure fine-grained differences in the internal structure and
outputs of NNs. Using these techniques, DeepSight can identify suspicious model
updates. We also develop a scheme that can accurately cluster model updates.
Combining the results of both components, DeepSight is able to identify and
eliminate model clusters containing poisoned models with high attack impact. We
also show that the backdoor contributions of possibly undetected poisoned
models can be effectively mitigated with existing weight clipping-based
defenses. We evaluate the performance and effectiveness of DeepSight and show
that it can mitigate state-of-the-art backdoor attacks with a negligible impact
on the model's performance on benign data.
","[{'version': 'v1', 'created': 'Mon, 3 Jan 2022 17:10:07 GMT'}]",2022-01-04,"[['Rieger', 'Phillip', ''], ['Nguyen', 'Thien Duc', ''], ['Miettinen', 'Markus', ''], ['Sadeghi', 'Ahmad-Reza', '']]","['Deep Learning (DL)', 'Federated Learning (FL)', 'Poisoning', 'Backdoor', 'Model Inspection']"
6815,2205.14825,Jun Lu,Jun Lu,Bayesian Low-Rank Interpolative Decomposition for Complex Datasets,arXiv admin note: text overlap with arXiv:2205.11025,"Journal of Studies in Engineering and Technology, 9 (1), 1-12,
  2022",10.11114/set.v9i1.5624,,cs.LG cs.IT cs.NA math.IT math.NA,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we introduce a probabilistic model for learning interpolative
decomposition (ID), which is commonly used for feature selection, low-rank
approximation, and identifying hidden patterns in data, where the matrix
factors are latent variables associated with each data dimension. Prior
densities with support on the specified subspace are used to address the
constraint for the magnitude of the factored component of the observed matrix.
Bayesian inference procedure based on Gibbs sampling is employed. We evaluate
the model on a variety of real-world datasets including CCLE EC50, CCLE IC50,
CTRP EC50,and MovieLens 100K datasets with different sizes, and dimensions, and
show that the proposed Bayesian ID GBT and GBTN models lead to smaller
reconstructive errors compared to existing randomized approaches.
","[{'version': 'v1', 'created': 'Mon, 30 May 2022 03:06:48 GMT'}]",2022-07-05,"[['Lu', 'Jun', '']]","['Interpolative decomposition', 'Lowrank approximation', 'Bayesian inference', 'Hierarchical model']"
6816,2011.01845,Heinke Hihn,Heinke Hihn and Daniel A. Braun,Specialization in Hierarchical Learning Systems,,"Neural Processing Letters, 1-34, 2020",10.1007/s11063-020-10351-3,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Joining multiple decision-makers together is a powerful way to obtain more
sophisticated decision-making systems, but requires to address the questions of
division of labor and specialization. We investigate in how far information
constraints in hierarchies of experts not only provide a principled method for
regularization but also to enforce specialization. In particular, we devise an
information-theoretically motivated on-line learning rule that allows
partitioning of the problem space into multiple sub-problems that can be solved
by the individual experts. We demonstrate two different ways to apply our
method: (i) partitioning problems based on individual data samples and (ii)
based on sets of data samples representing tasks. Approach (i) equips the
system with the ability to solve complex decision-making problems by finding an
optimal combination of local expert decision-makers. Approach (ii) leads to
decision-makers specialized in solving families of tasks, which equips the
system with the ability to solve meta-learning problems. We show the broad
applicability of our approach on a range of problems including classification,
regression, density estimation, and reinforcement learning problems, both in
the standard machine learning setup and in a meta-learning setting.
","[{'version': 'v1', 'created': 'Tue, 3 Nov 2020 17:00:31 GMT'}]",2020-11-04,"[['Hihn', 'Heinke', ''], ['Braun', 'Daniel A.', '']]","['Meta-Learning', 'Information Theory', 'Bounded Rationality']"
6817,1802.02986,Andrea Marrella,"Andrea Marrella, Massimo Mecella","Cognitive Business Process Management for Adaptive Cyber-Physical
  Processes","Preprint from Proceedings of 1st International Workshop on Cognitive
  Business Process Management (CBPM 2017)",,10.1007/978-3-319-74030-0_33,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the era of Big Data and Internet-of-Things (IoT), all real-world
environments are gradually becoming cyber-physical (e.g., emergency management,
healthcare, smart manufacturing, etc.), with the presence of connected devices
and embedded ICT systems (e.g., smartphones, sensors, actuators) producing huge
amounts of data and events that influence the enactment of the Cyber Physical
Processes (CPPs) enacted in such environments. A Process Management System
(PMS) employed for executing CPPs is required to automatically adapt its
running processes to anomalous situations and exogenous events by minimising
any human intervention at run-time. In this paper, we tackle this issue by
introducing an approach and an adaptive Cognitive PMS that combines process
execution monitoring, unanticipated exception detection and automated
resolution strategies leveraging on well-established action-based formalisms in
Artificial Intelligence, which allow to interpret the ever-changing knowledge
of cyber-physical environments and to adapt CPPs by preserving their base
structure.
","[{'version': 'v1', 'created': 'Thu, 8 Feb 2018 17:57:04 GMT'}]",2018-02-20,"[['Marrella', 'Andrea', ''], ['Mecella', 'Massimo', '']]","['Cognitive Business Process Management', 'Cyber-Physical Processes', 'Process Adaptation and Recovery', 'Situation Calculus', 'IndiGolog', 'Automated Planning']"
6818,2006.09904,Paridhi Maheshwari,"Paridhi Maheshwari, Manoj Ghuhan, Vishwa Vinay",Learning Colour Representations of Search Queries,Accepted as a full paper at SIGIR 2020,,10.1145/3397271.3401095,,cs.IR cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image search engines rely on appropriately designed ranking features that
capture various aspects of the content semantics as well as the historic
popularity. In this work, we consider the role of colour in this relevance
matching process. Our work is motivated by the observation that a significant
fraction of user queries have an inherent colour associated with them. While
some queries contain explicit colour mentions (such as 'black car' and 'yellow
daisies'), other queries have implicit notions of colour (such as 'sky' and
'grass'). Furthermore, grounding queries in colour is not a mapping to a single
colour, but a distribution in colour space. For instance, a search for 'trees'
tends to have a bimodal distribution around the colours green and brown. We
leverage historical clickthrough data to produce a colour representation for
search queries and propose a recurrent neural network architecture to encode
unseen queries into colour space. We also show how this embedding can be learnt
alongside a cross-modal relevance ranker from impression logs where a subset of
the result images were clicked. We demonstrate that the use of a query-image
colour distance feature leads to an improvement in the ranker performance as
measured by users' preferences of clicked versus skipped images.
","[{'version': 'v1', 'created': 'Wed, 17 Jun 2020 14:38:44 GMT'}]",2020-06-18,"[['Maheshwari', 'Paridhi', ''], ['Ghuhan', 'Manoj', ''], ['Vinay', 'Vishwa', '']]","['Colour Representation', 'User Intent Understanding', 'Colour in Ranking', 'Query Log Analysis']"
6819,2010.16115,Gabriel Hondet,"Gabriel Hondet (DEDUCTEAM, LSV, ENS Paris Saclay, CNRS), Fr\'ed\'eric
  Blanqui (DEDUCTEAM, LSV, ENS Paris Saclay, CNRS)",The New Rewriting Engine of Dedukti,,"FSCD 2020 - 5th International Conference on Formal Structures for
  Computation and Deduction, Jun 2020, Paris, France. pp.16",10.4230/LIPIcs.FSCD.2020.35,,cs.PL cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dedukti is a type-checker for the $\lambda$$\Pi$-calculus modulo rewriting,
an extension of Edinburgh's logicalframework LF where functions and type
symbols can be defined by rewrite rules. It thereforecontains an engine for
rewriting LF terms and types according to the rewrite rules given by the user.A
key component of this engine is the matching algorithm to find which rules can
be fired. In thispaper, we describe the class of rewrite rules supported by
Dedukti and the new implementation ofthe matching algorithm. Dedukti supports
non-linear rewrite rules on terms with binders usinghigher-order
pattern-matching as in Combinatory Reduction Systems (CRS). The new
matchingalgorithm extends the technique of decision trees introduced by Luc
Maranget in the OCamlcompiler to this more general context.
","[{'version': 'v1', 'created': 'Fri, 30 Oct 2020 08:19:19 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Feb 2022 14:24:55 GMT'}]",2022-02-16,"[['Hondet', 'Gabriel', '', 'DEDUCTEAM, LSV, ENS Paris Saclay, CNRS'], ['Blanqui', 'Frédéric', '', 'DEDUCTEAM, LSV, ENS Paris Saclay, CNRS']]","['rewriting', 'higher-order pattern-matching', 'decision trees']"
6820,2111.13605,Zeynep Tuna Deger,"Zeynep Tuna Deger and Gulsen Taskin Kaya (Istanbul Technical
  University)","A Novel GPR-Based Prediction Model for Cylic Backbone Curves of
  Reinforced Concrete Shear Walls","16 pages, 5 tables, 7 figures. Submitted to Elsevier",,10.1016/j.engstruct.2022.113874,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  Backbone curves are used to characterize nonlinear responses of structural
elements by simplifying the cyclic force-deformation relationships. Accurate
modeling of cyclic behavior can be achieved with a reliable backbone curve
model. In this paper, a novel machine learning-based model is proposed to
predict the backbone curve of reinforced concrete shear (structural) walls
based on key wall design properties. Reported experimental responses of a
detailed test database consisting of 384 reinforced concrete shear walls under
cyclic loading were utilized to predict seven critical points to define the
backbone curves, namely: shear at cracking point; shear and displacement at
yielding point; and peak shear force and corresponding displacement; and
ultimate displacement and corresponding shear. The predictive models were
developed based on the Gaussian Process Regression method (GPR), which adopts a
non-parametric Bayesian approach. The ability of the proposed GPR-based model
to make accurate and robust estimations for the backbone curves was validated
based on unseen data using a hundred random sampling procedure. The prediction
accuracies (i.e., ratio of predicted/actual values) are close to 1.0, whereas
the coefficient of determination (R2) values range between 0.90-0.97 for all
backbone points. The proposed GPR-based backbone models are shown to reflect
cyclic behavior more accurately than the traditional methods, therefore, they
would serve the earthquake engineering community for better evaluation of the
seismic performance of existing buildings.
","[{'version': 'v1', 'created': 'Fri, 26 Nov 2021 17:08:06 GMT'}]",2022-02-08,"[['Deger', 'Zeynep Tuna', '', 'Istanbul Technical\n  University'], ['Kaya', 'Gulsen Taskin', '', 'Istanbul Technical\n  University']]","['nonlinear modeling', 'reinforced concrete shear walls', 'cyclic behavior', 'backbone curves', 'machinelearning', 'Gaussian Process Regression']"
6821,2010.10844,Yuki Noguchi,"Yuki Noguchi, Takayuki Yamada","Topology optimization of acoustic metasurfaces by using a two-scale
  homogenization method",,,10.1016/j.apm.2021.05.005,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a level set-based topology optimization method for
the unit-cell design of acoustic metasurfaces by using a two-scale
homogenization method. Based on previous works, we first propose a
homogenization method for acoustic metasurfaces that can be combined with
topology optimization. In this method, a nonlocal transmission condition
depending on the unit cell of the metasurface appears in a macroscale problem.
Next, we formulate an optimization problem within the framework of a level
set-based topology optimization method, wherein an objective functional is
expressed as the macroscopic responses obtained through the homogenization, and
material distributions in the unit cell are set as design variables. A
sensitivity analysis is conducted based on the concept of the topological
derivative. To confirm the validity of the proposed method, two-dimensional
numerical examples are provided. First, we provide a numerical example that
supports the validity of the homogenization method, and we then perform
optimization calculations based on the waveguide settings of the acoustic
metasurfaces. In addition, we discuss the mechanism of the obtained optimized
structures.
","[{'version': 'v1', 'created': 'Wed, 21 Oct 2020 09:08:08 GMT'}, {'version': 'v2', 'created': 'Tue, 25 May 2021 00:53:26 GMT'}]",2021-06-23,"[['Noguchi', 'Yuki', ''], ['Yamada', 'Takayuki', '']]","['Acoustic metasurface', 'Two-scale homogenization method', 'Topology optimization', 'Level set method', 'Acoustic metamaterial', 'Topological derivative']"
6822,1809.05889,Sanjay Sahay,"Mohit Sewak, Sanjay K. Sahay and Hemant Rathore","Comparison of Deep Learning and the Classical Machine Learning Algorithm
  for the Malware Detection","11 Pages, 1 figure","IEEE, pp. 293-296, 19th IEEE/ACIS International Conference on
  Software Engineering, Artificial Intelligence, Networking and
  Parallel/Distributed Computing (SNPD), 2018",10.1109/SNPD.2018.8441123,,cs.CR cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, Deep Learning has been showing promising results in various
Artificial Intelligence applications like image recognition, natural language
processing, language modeling, neural machine translation, etc. Although, in
general, it is computationally more expensive as compared to classical machine
learning techniques, their results are found to be more effective in some
cases. Therefore, in this paper, we investigated and compared one of the Deep
Learning Architecture called Deep Neural Network (DNN) with the classical
Random Forest (RF) machine learning algorithm for the malware classification.
We studied the performance of the classical RF and DNN with 2, 4 & 7 layers
architectures with the four different feature sets, and found that irrespective
of the features inputs, the classical RF accuracy outperforms the DNN.
","[{'version': 'v1', 'created': 'Sun, 16 Sep 2018 14:40:16 GMT'}]",2018-09-18,"[['Sewak', 'Mohit', ''], ['Sahay', 'Sanjay K.', ''], ['Rathore', 'Hemant', '']]","['Malware', 'Deep Learning', 'Machine Learning', 'Auto Encoders', 'Deep Neural Networks']"
6823,2208.12510,Xianke Chen,"Jianfeng Dong, Xianke Chen, Minsong Zhang, Xun Yang, Shujie Chen,
  Xirong Li, Xun Wang",Partially Relevant Video Retrieval,"Accepted by ACM MM 2022. The paper's homepage is
  http://danieljf24.github.io/prvr",,10.1145/3503161.3547976,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current methods for text-to-video retrieval (T2VR) are trained and tested on
video-captioning oriented datasets such as MSVD, MSR-VTT and VATEX. A key
property of these datasets is that videos are assumed to be temporally
pre-trimmed with short duration, whilst the provided captions well describe the
gist of the video content. Consequently, for a given paired video and caption,
the video is supposed to be fully relevant to the caption. In reality, however,
as queries are not known a priori, pre-trimmed video clips may not contain
sufficient content to fully meet the query. This suggests a gap between the
literature and the real world. To fill the gap, we propose in this paper a
novel T2VR subtask termed Partially Relevant Video Retrieval (PRVR). An
untrimmed video is considered to be partially relevant w.r.t. a given textual
query if it contains a moment relevant to the query. PRVR aims to retrieve such
partially relevant videos from a large collection of untrimmed videos. PRVR
differs from single video moment retrieval and video corpus moment retrieval,
as the latter two are to retrieve moments rather than untrimmed videos. We
formulate PRVR as a multiple instance learning (MIL) problem, where a video is
simultaneously viewed as a bag of video clips and a bag of video frames. Clips
and frames represent video content at different time scales. We propose a
Multi-Scale Similarity Learning (MS-SL) network that jointly learns clip-scale
and frame-scale similarities for PRVR. Extensive experiments on three datasets
(TVR, ActivityNet Captions, and Charades-STA) demonstrate the viability of the
proposed method. We also show that our method can be used for improving video
corpus moment retrieval.
","[{'version': 'v1', 'created': 'Fri, 26 Aug 2022 09:07:16 GMT'}]",2022-08-29,"[['Dong', 'Jianfeng', ''], ['Chen', 'Xianke', ''], ['Zhang', 'Minsong', ''], ['Yang', 'Xun', ''], ['Chen', 'Shujie', ''], ['Li', 'Xirong', ''], ['Wang', 'Xun', '']]","['Video-Text Retrieval', 'Partially Relevant', 'Multiple Instance Learning', 'Video Representation Learning']"
6824,2301.03166,Jieyang Chen,"Jieyang Chen, Xin Liang, Kai Zhao, Hadi Zamani Sabzi, Laxmi Bhuyan,
  Zizhong Chen","Improving Energy Saving of One-sided Matrix Decompositions on CPU-GPU
  Heterogeneous Systems",,,10.1145/3572848.3577496,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  One-sided dense matrix decompositions (e.g., Cholesky, LU, and QR) are the
key components in scientific computing in many different fields. Although their
design has been highly optimized for modern processors, they still consume a
considerable amount of energy. As CPU-GPU heterogeneous systems are commonly
used for matrix decompositions, in this work, we aim to further improve the
energy saving of one-sided matrix decompositions on CPU-GPU heterogeneous
systems. We first build an Algorithm-Based Fault Tolerance protected
overclocking technique (ABFT-OC) to enable us to exploit reliable overclocking
for key matrix decomposition operations. Then, we design an energy-saving
matrix decomposition framework, Bi-directional Slack Reclamation(BSR), that can
intelligently combine the capability provided by ABFT-OC and DVFS to maximize
energy saving and maintain performance and reliability. Experiments show that
BSR is able to save up to 11.7% more energy compared with the current best
energy saving optimization approach with no performance degradation and up to
14.1% Energy * Delay^2 reduction. Also, BSR enables the Pareto efficient
performance-energy trade-off, which is able to provide up to 1.43x performance
improvement without costing extra energy.
","[{'version': 'v1', 'created': 'Mon, 9 Jan 2023 04:42:37 GMT'}]",2023-01-10,"[['Chen', 'Jieyang', ''], ['Liang', 'Xin', ''], ['Zhao', 'Kai', ''], ['Sabzi', 'Hadi Zamani', ''], ['Bhuyan', 'Laxmi', ''], ['Chen', 'Zizhong', '']]","['GPU', 'matrix decomposition', 'energy saving', 'faulttolerance']"
6825,2101.12478,R\'emi Petitpierre,"R\'emi Petitpierre (Ecole polytechnique f\'ed\'erale de Lausanne,
  EPFL, Switzerland)","Neural networks for semantic segmentation of historical city maps:
  Cross-cultural performance and the impact of figurative diversity",MSc thesis,,10.13140/RG.2.2.10973.64484,,cs.CV cs.HC eess.IV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this work, we present a new semantic segmentation model for historical
city maps that surpasses the state of the art in terms of flexibility and
performance. Research in automatic map processing is largely focused on
homogeneous corpora or even individual maps, leading to inflexible algorithms.
Recently, convolutional neural networks have opened new perspectives for the
development of more generic tools. Based on two new maps corpora, the first one
centered on Paris and the second one gathering cities from all over the world,
we propose a method for operationalizing the figuration based on traditional
computer vision algorithms that allows large-scale quantitative analysis. In a
second step, we propose a semantic segmentation model based on neural networks
and implement several improvements. Finally, we analyze the impact of map
figuration on segmentation performance and evaluate future ways to improve the
representational flexibility of neural networks. To conclude, we show that
these networks are able to semantically segment map data of a very large
figurative diversity with efficiency.
","[{'version': 'v1', 'created': 'Fri, 29 Jan 2021 09:08:12 GMT'}]",2021-02-01,"[['Petitpierre', 'Rémi', '', 'Ecole polytechnique fédérale de Lausanne,\n  EPFL, Switzerland']]","['Maps processing', 'urban cartography', 'semantic segmentation', 'convolutional']"
6826,1712.02617,Piotr Tysowski,"Piotr K. Tysowski, Xinhua Ling, Norbert L\""utkenhaus, Michele Mosca","The Engineering of a Scalable Multi-Site Communications System Utilizing
  Quantum Key Distribution (QKD)",,,10.1088/2058-9565/aa9a5d,,cs.CR cs.NI quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quantum Key Distribution (QKD) is a means of generating keys between a pair
of computing hosts that is theoretically secure against cryptanalysis, even by
a quantum computer. Although there is much active research into improving the
QKD technology itself, there is still significant work to be done to apply
engineering methodology and determine how it can be practically built to scale
within an enterprise IT environment. Significant challenges exist in building a
practical key management service for use in a metropolitan network. QKD is
generally a point-to-point technique only and is subject to steep performance
constraints. The integration of QKD into enterprise-level computing has been
researched, to enable quantum-safe communication. A novel method for
constructing a key management service is presented that allows arbitrary
computing hosts on one site to establish multiple secure communication sessions
with the hosts of another site. A key exchange protocol is proposed where
symmetric private keys are granted to hosts while satisfying the scalability
needs of an enterprise population of users. The key management service operates
within a layered architectural style that is able to interoperate with various
underlying QKD implementations. Variable levels of security for the host
population are enforced through a policy engine. A network layer provides key
generation across a network of nodes connected by quantum links. Scheduling and
routing functionality allows quantum key material to be relayed across trusted
nodes. Optimizations are performed to match the real-time host demand for key
material with the capacity afforded by the infrastructure. The result is a
flexible and scalable architecture that is suitable for enterprise use and
independent of any specific QKD technology.
","[{'version': 'v1', 'created': 'Thu, 7 Dec 2017 13:47:13 GMT'}]",2017-12-08,"[['Tysowski', 'Piotr K.', ''], ['Ling', 'Xinhua', ''], ['Lütkenhaus', 'Norbert', ''], ['Mosca', 'Michele', '']]","['quantum key distribution', 'quantum cryptography', 'software engineering', 'networkengineering', 'network security', 'software architecture', 'enterprise computing']"
6827,2203.04842,Daniel Gebbran Dr.,"Daniel Gebbran, Sleiman Mhanna, Yiju Ma, Archie C. Chapman, Gregor
  Verbic","Fair Coordination of Distributed Energy Resources with Volt-Var Control
  and PV Curtailment",,"Applied Energy, Volume 286, 15 March 2021, 116546",10.1016/j.apenergy.2021.116546,,cs.CE cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  This paper presents a novel distributed optimal power flow (DOPF) method for
fair distributed energy resource (DER) coordination in the context of mandated
rooftop PV inverter control modes. In practice, inverter reactive power control
is increasingly required by grid connection codes, which often unfairly curtail
PV generation of prosumers towards the end of low-voltage feeders. Similarly,
optimization-based DER coordination methods that aim solely for
technically-efficient DER coordination do not consider the distribution of PV
curtailment across customers. To address these concerns, we develop a tractable
multi-objective DOPF method for optimal DER coordination that (i) curtails PV
generation fairly across prosumers, and (ii) incorporates a standard
piecewise-linear volt-var control reactive power control function without using
integer variables. Three equity principles representing different
interpretations of fairness are implemented in our coordination method; namely,
egalitarian, proportional and uniform dynamic PV curtailment redistribution.
The performance of our approach is demonstrated on low-voltage distribution
feeders of different sizes (5, 10, 25, 50 and 100 prosumers) using two network
topologies: line topology without lateral spurs and tree topology with lateral
spurs. Each network considers three levels of PV penetration, giving 30 test
systems in total. The results demonstrate the effectiveness of the proposed
DOPF method for fair DER coordination: PV curtailment is equitably distributed
among prosumers with a computational burden on par with conventional DOPF
approaches. Moreover, different fairness methods result in different patterns
of curtailment, which a regulator may choose between.
","[{'version': 'v1', 'created': 'Wed, 9 Mar 2022 16:15:14 GMT'}]",2022-03-10,"[['Gebbran', 'Daniel', ''], ['Mhanna', 'Sleiman', ''], ['Ma', 'Yiju', ''], ['Chapman', 'Archie C.', ''], ['Verbic', 'Gregor', '']]","['distributed optimal power flow (DOPF)', 'distributed energy resources (DER)', 'ADMM', 'prosumers', 'demand response', 'Volt-Var Control', 'fair PV curtailment']"
6828,2208.12216,Shyam Murthy,"Shyam Murthy, Srinivas Vivek",Passive Triangulation Attack on ORide,,,10.1007/978-3-031-20974-1_8,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Privacy preservation in Ride Hailing Services is intended to protect privacy
of drivers and riders. ORide is one of the early RHS proposals published at
USENIX Security Symposium 2017. In the ORide protocol, riders and drivers,
operating in a zone, encrypt their locations using a Somewhat Homomorphic
Encryption scheme (SHE) and forward them to the Service Provider (SP). SP
homomorphically computes the squared Euclidean distance between riders and
available drivers. Rider receives the encrypted distances and selects the
optimal rider after decryption. In order to prevent a triangulation attack, SP
randomly permutes the distances before sending them to the rider. In this work,
we use propose a passive attack that uses triangulation to determine
coordinates of all participating drivers whose permuted distances are available
from the points of view of multiple honest-but-curious adversary riders. An
attack on ORide was published at SAC 2021. The same paper proposes a
countermeasure using noisy Euclidean distances to thwart their attack. We
extend our attack to determine locations of drivers when given their permuted
and noisy Euclidean distances from multiple points of reference, where the
noise perturbation comes from a uniform distribution. We conduct experiments
with different number of drivers and for different perturbation values. Our
experiments show that we can determine locations of all drivers participating
in the ORide protocol. For the perturbed distance version of the ORide
protocol, our algorithm reveals locations of about 25% to 50% of participating
drivers. Our algorithm runs in time polynomial in number of drivers.
","[{'version': 'v1', 'created': 'Thu, 25 Aug 2022 17:04:36 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Sep 2022 09:05:55 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Jan 2023 11:09:50 GMT'}]",2023-01-05,"[['Murthy', 'Shyam', ''], ['Vivek', 'Srinivas', '']]","['Ride Hailing Services', 'Privacy and Censorship', 'Attack', 'ORide', 'Triangulation']"
6829,2104.06106,Takumi Tanabe,"Takumi Tanabe, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto","Level Generation for Angry Birds with Sequential VAE and Latent Variable
  Evolution",The Genetic and Evolutionary Computation Conference 2021 (GECCO '21),,10.1145/3449639.3459290,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video game level generation based on machine learning (ML), in particular,
deep generative models, has attracted attention as a technique to automate
level generation. However, applications of existing ML-based level generations
are mostly limited to tile-based level representation. When ML techniques are
applied to game domains with non-tile-based level representation, such as Angry
Birds, where objects in a level are specified by real-valued parameters, ML
often fails to generate playable levels. In this study, we develop a
deep-generative-model-based level generation for the game domain of Angry
Birds. To overcome these drawbacks, we propose a sequential encoding of a level
and process it as text data, whereas existing approaches employ a tile-based
encoding and process it as an image. Experiments show that the proposed level
generator drastically improves the stability and diversity of generated levels
compared with existing approaches. We apply latent variable evolution with the
proposed generator to control the feature of a generated level computed through
an AI agent's play, while keeping the level stable and natural.
","[{'version': 'v1', 'created': 'Tue, 13 Apr 2021 11:23:39 GMT'}]",2021-04-14,"[['Tanabe', 'Takumi', ''], ['Fukuchi', 'Kazuto', ''], ['Sakuma', 'Jun', ''], ['Akimoto', 'Youhei', '']]","['Procedural Content Generation', 'AngryBirds', 'Sequential VAE', 'Latent Variable Evolution']"
6830,1410.4303,EPTCS,"Nourhene Ellouze (Communication Networks and Security Research Lab,
  University of Carthage, Tunisia), Slim Rekhis (Communication Networks and
  Security Research Lab, University of Carthage, Tunisia), Mohamed Allouche
  (Department of Forensic Medicine of Charles Nicolle, University of Tunis El
  Manar, Tunisia), Noureddine Boudriga (Communication Networks and Security
  Research Lab, University of Carthage, Tunisia)","Digital Investigation of Security Attacks on Cardiac Implantable Medical
  Devices","In Proceedings AIDP 2014, arXiv:1410.3226","EPTCS 165, 2014, pp. 15-30",10.4204/EPTCS.165.2,,cs.CR cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Cardiac Implantable Medical device (IMD) is a device, which is surgically
implanted into a patient's body, and wirelessly configured using an external
programmer by prescribing physicians and doctors. A set of lethal attacks
targeting these devices can be conducted due to the use of vulnerable wireless
communication and security protocols, and the lack of security protection
mechanisms deployed on IMDs. In this paper, we propose a system for postmortem
analysis of lethal attack scenarios targeting cardiac IMDs. Such a system
reconciles in the same framework conclusions derived by technical investigators
and deductions generated by pathologists. An inference system integrating a
library of medical rules is used to automatically infer potential medical
scenarios that could have led to the death of a patient. A Model Checking based
formal technique allowing the reconstruction of potential technical attack
scenarios on the IMD, starting from the collected evidence, is also proposed. A
correlation between the results obtained by the two techniques allows to prove
whether a potential attack scenario is the source of the patient's death.
","[{'version': 'v1', 'created': 'Thu, 16 Oct 2014 05:53:40 GMT'}]",2014-10-17,"[['Ellouze', 'Nourhene', '', 'Communication Networks and Security Research Lab,\n  University of Carthage, Tunisia'], ['Rekhis', 'Slim', '', 'Communication Networks and\n  Security Research Lab, University of Carthage, Tunisia'], ['Allouche', 'Mohamed', '', 'Department of Forensic Medicine of Charles Nicolle, University of Tunis El\n  Manar, Tunisia'], ['Boudriga', 'Noureddine', '', 'Communication Networks and Security\n  Research Lab, University of Carthage, Tunisia']]","['Cardiac Implantable Medical Devices', 'Lethal attacks', 'Digital investigation', 'Postmortemanalysis', 'Formal techniques']"
6831,2109.02810,EPTCS,"Maria Bendix Mikkelsen (DIKU, University of Copenhagen, Denmark),
  Robert Gl\""uck (DIKU, University of Copenhagen, Denmark), Maja H. Kirkeby
  (Roskilde University, Denmark)","An Inversion Tool for Conditional Term Rewriting Systems -- A Case Study
  of Ackermann Inversion","In Proceedings VPT 2021, arXiv:2109.02001","EPTCS 341, 2021, pp. 33-41",10.4204/EPTCS.341.3,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We report on an inversion tool for a class of oriented conditional
constructor term rewriting systems. Four well-behaved rule inverters ranging
from trivial to full, partial and semi-inverters are included. Conditional term
rewriting systems are theoretically well founded and can model functional and
non-functional rewrite relations. We illustrate the inversion by experiments
with full and partial inversions of the Ackermann function. The case study
demonstrates, among others, that polyvariant inversion and input-output set
propagation can reduce the search space of the generated inverse systems.
","[{'version': 'v1', 'created': 'Tue, 7 Sep 2021 01:55:39 GMT'}]",2021-09-08,"[['Mikkelsen', 'Maria Bendix', '', 'DIKU, University of Copenhagen, Denmark'], ['Glück', 'Robert', '', 'DIKU, University of Copenhagen, Denmark'], ['Kirkeby', 'Maja H.', '', 'Roskilde University, Denmark']]","['program inversion', 'program transformation', 'term rewriting systems', 'case study']"
6832,2004.07044,Muhammad Nazrul Islam,"Muhammad Nazrul Islam, Md. Mahboob Karim, Toki Tahmid Inan, A. K. M.
  Najmul Islam",Investigating usability of mobile health applications in Bangladesh,"13 pages, 4 figures","BMC Medical Informatics and Decision Making, (2020) 20:19",10.1186/s12911-020-1033-3,,cs.HC cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Background: Lack of usability can be a major barrier for the rapid adoption
of mobile services. Therefore, the purpose of this paper is to investigate the
usability of Mobile Health applications in Bangladesh.
  Method: We followed a 3-stage approach in our research. First, we conducted a
keyword-based application search in the popular app stores. We followed the
affinity diagram approach and clustered the found applications into nine
groups. Second, we randomly selected four apps from each group (36 apps in
total) and conducted a heuristic evaluation. Finally, we selected the highest
downloaded app from each group and conducted user studies with 30 participants.
  Results: We found 61% usability problems are catastrophe or major in nature
from heuristic inspection. The most (21%) violated heuristic is aesthetic and
minimalist design. The user studies revealed low System Usability Scale (SUS)
scores for those apps that had a high number of usability problems based on the
heuristic evaluation. Thus, the results of heuristic evaluation and user
studies complement each other.
  Conclusion: Overall, the findings suggest that the usability of the mobile
health apps in Bangladesh is not satisfactory in general and could be a
potential barrier for wider adoption of mobile health services.
","[{'version': 'v1', 'created': 'Wed, 15 Apr 2020 12:21:27 GMT'}]",2020-05-05,"[['Islam', 'Muhammad Nazrul', ''], ['Karim', 'Md. Mahboob', ''], ['Inan', 'Toki Tahmid', ''], ['Islam', 'A. K. M. Najmul', '']]","['Mobile health', 'Usability', 'Usability evaluation', 'System usability scale', 'Bangladesh', 'mHealth applications', 'Health informatics', 'Human-computer interaction (HCI)']"
6833,2004.04120,Federico Galatolo,"Federico A. Galatolo, Mario G.C.A. Cimino, Gigliola Vaglini","Solving the scalarization issues of Advantage-based Reinforcement
  Learning Algorithms",,"Computers & Electrical Engineering, 92, 107117 (2021)",10.1016/j.compeleceng.2021.107117,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this research, some of the issues that arise from the scalarization of the
multi-objective optimization problem in the Advantage Actor Critic (A2C)
reinforcement learning algorithm are investigated. The paper shows how a naive
scalarization can lead to gradients overlapping. Furthermore, the possibility
that the entropy regularization term can be a source of uncontrolled noise is
discussed. With respect to the above issues, a technique to avoid gradient
overlapping is proposed, while keeping the same loss formulation. Moreover, a
method to avoid the uncontrolled noise, by sampling the actions from
distributions with a desired minimum entropy, is investigated. Pilot
experiments have been carried out to show how the proposed method speeds up the
training. The proposed approach can be applied to any Advantage-based
Reinforcement Learning algorithm.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2020 17:03:21 GMT'}, {'version': 'v2', 'created': 'Thu, 21 May 2020 14:58:25 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Jul 2021 14:30:46 GMT'}, {'version': 'v4', 'created': 'Fri, 1 Oct 2021 14:53:15 GMT'}]",2021-10-04,"[['Galatolo', 'Federico A.', ''], ['Cimino', 'Mario G. C. A.', ''], ['Vaglini', 'Gigliola', '']]","['Reinforcement Learning', 'Actor Critic', 'Deep Learning', 'Gradient-based optimization']"
6834,2101.07175,Wouter Caarls,Wouter Caarls,Deep Reinforcement Learning with Embedded LQR Controllers,"This work has been accepted to IFAC for publication under a Creative
  Commons Licence CC-BY-NC-ND",,10.1016/j.ifacol.2020.12.2261,,cs.RO cs.LG cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Reinforcement learning is a model-free optimal control method that optimizes
a control policy through direct interaction with the environment. For reaching
tasks that end in regulation, popular discrete-action methods are not well
suited due to chattering in the goal state. We compare three different ways to
solve this problem through combining reinforcement learning with classical LQR
control. In particular, we introduce a method that integrates LQR control into
the action set, allowing generalization and avoiding fixing the computed
control in the replay memory if it is based on learned dynamics. We also embed
LQR control into a continuous-action method. In all cases, we show that adding
LQR control can improve performance, although the effect is more profound if it
can be used to augment a discrete action set.
","[{'version': 'v1', 'created': 'Mon, 18 Jan 2021 17:28:48 GMT'}]",2021-06-23,"[['Caarls', 'Wouter', '']]","['Reinforcement learning', 'actor-critic methods', 'learning control', 'linear quadraticregulator']"
6835,2007.02095,Lixin Zou,"Lixin Zou, Long Xia, Yulong Gu, Xiangyu Zhao, Weidong Liu, Jimmy
  Xiangji Huang, Dawei Yin",Neural Interactive Collaborative Filtering,,,10.1145/3397271.3401181,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study collaborative filtering in an interactive setting, in
which the recommender agents iterate between making recommendations and
updating the user profile based on the interactive feedback. The most
challenging problem in this scenario is how to suggest items when the user
profile has not been well established, i.e., recommend for cold-start users or
warm-start users with taste drifting. Existing approaches either rely on overly
pessimistic linear exploration strategy or adopt meta-learning based algorithms
in a full exploitation way. In this work, to quickly catch up with the user's
interests, we propose to represent the exploration policy with a neural network
and directly learn it from the feedback data. Specifically, the exploration
policy is encoded in the weights of multi-channel stacked self-attention neural
networks and trained with efficient Q-learning by maximizing users' overall
satisfaction in the recommender systems. The key insight is that the satisfied
recommendations triggered by the exploration recommendation can be viewed as
the exploration bonus (delayed reward) for its contribution on improving the
quality of the user profile. Therefore, the proposed exploration policy, to
balance between learning the user profile and making accurate recommendations,
can be directly optimized by maximizing users' long-term satisfaction with
reinforcement learning. Extensive experiments and analysis conducted on three
benchmark collaborative filtering datasets have demonstrated the advantage of
our method over state-of-the-art methods.
","[{'version': 'v1', 'created': 'Sat, 4 Jul 2020 13:35:39 GMT'}]",2020-07-07,"[['Zou', 'Lixin', ''], ['Xia', 'Long', ''], ['Gu', 'Yulong', ''], ['Zhao', 'Xiangyu', ''], ['Liu', 'Weidong', ''], ['Huang', 'Jimmy Xiangji', ''], ['Yin', 'Dawei', '']]","['Cold start', 'Recommender Systems', 'Meta-learning', 'ReinforcementLearning']"
6836,1709.00411,Amir Varastehhajipour,"Amir Varasteh, Farzad Tashtarian, Maziar Goudarzi",On Reliability-Aware Server Consolidation in Cloud Datacenters,"International Symposium on Parallel and Distributed Computing
  (ISPDC), Innsbruck, Austria, 2017",,10.1109/ISPDC.2017.26,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the past few years, datacenter (DC) energy consumption has become an
important issue in technology world. Server consolidation using virtualization
and virtual machine (VM) live migration allows cloud DCs to improve resource
utilization and hence energy efficiency. In order to save energy, consolidation
techniques try to turn off the idle servers, while because of workload
fluctuations, these offline servers should be turned on to support the
increased resource demands. These repeated on-off cycles could affect the
hardware reliability and wear-and-tear of servers and as a result, increase the
maintenance and replacement costs. In this paper we propose a holistic
mathematical model for reliability-aware server consolidation with the
objective of minimizing total DC costs including energy and reliability costs.
In fact, we try to minimize the number of active PMs and racks, in a
reliability-aware manner. We formulate the problem as a Mixed Integer Linear
Programming (MILP) model which is in form of NP-complete. Finally, we evaluate
the performance of our approach in different scenarios using extensive
numerical MATLAB simulations.
","[{'version': 'v1', 'created': 'Fri, 1 Sep 2017 13:13:47 GMT'}]",2018-07-27,"[['Varasteh', 'Amir', ''], ['Tashtarian', 'Farzad', ''], ['Goudarzi', 'Maziar', '']]","['Cloud computing', 'datacenter', 'energy optimization', 'cost optimization', 'vm placement', 'server consolidation', 'reliability']"
6837,1801.07653,Daniel Hornung,"Timm Fitschen, Alexander Schlemmer, Daniel Hornung, Henrik tom
  W\""orden, Ulrich Parlitz, Stefan Luther","CaosDB - Research Data Management for Complex, Changing, and Automated
  Research Workflows",,"Data 2019, 4(2), 83",10.3390/data4020083,,cs.DB cs.AI,http://creativecommons.org/licenses/by-sa/4.0/,"  Here we present CaosDB, a Research Data Management System (RDMS) designed to
ensure seamless integration of inhomogeneous data sources and repositories of
legacy data. Its primary purpose is the management of data from biomedical
sciences, both from simulations and experiments during the complete research
data lifecycle. An RDMS for this domain faces particular challenges: Research
data arise in huge amounts, from a wide variety of sources, and traverse a
highly branched path of further processing. To be accepted by its users, an
RDMS must be built around workflows of the scientists and practices and thus
support changes in workflow and data structure. Nevertheless it should
encourage and support the development and observation of standards and
furthermore facilitate the automation of data acquisition and processing with
specialized software. The storage data model of an RDMS must reflect these
complexities with appropriate semantics and ontologies while offering simple
methods for finding, retrieving, and understanding relevant data. We show how
CaosDB responds to these challenges and give an overview of the CaosDB Server,
its data model and its easy-to-learn CaosDB Query Language. We briefly discuss
the status of the implementation, how we currently use CaosDB, and how we plan
to use and extend it.
","[{'version': 'v1', 'created': 'Tue, 23 Jan 2018 16:46:18 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Mar 2019 12:46:10 GMT'}]",2019-06-13,"[['Fitschen', 'Timm', ''], ['Schlemmer', 'Alexander', ''], ['Hornung', 'Daniel', ''], ['Wörden', 'Henrik tom', ''], ['Parlitz', 'Ulrich', ''], ['Luther', 'Stefan', '']]","['RDMS', 'research data management', 'FAIR', 'database', 'ACID']"
6838,2204.00716,Shengyao Zhuang,Shengyao Zhuang and Guido Zuccon,"CharacterBERT and Self-Teaching for Improving the Robustness of Dense
  Retrievers on Queries with Typos","9 pages full paper, accepted at SIGIR2022",,10.1145/3477495.3531951,,cs.IR cs.CL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Current dense retrievers are not robust to out-of-domain and outlier queries,
i.e. their effectiveness on these queries is much poorer than what one would
expect. In this paper, we consider a specific instance of such queries: queries
that contain typos. We show that a small character level perturbation in
queries (as caused by typos) highly impacts the effectiveness of dense
retrievers. We then demonstrate that the root cause of this resides in the
input tokenization strategy employed by BERT. In BERT, tokenization is
performed using the BERT's WordPiece tokenizer and we show that a token with a
typo will significantly change the token distributions obtained after
tokenization. This distribution change translates to changes in the input
embeddings passed to the BERT-based query encoder of dense retrievers. We then
turn our attention to devising dense retriever methods that are robust to such
queries with typos, while still being as performant as previous methods on
queries without typos. For this, we use CharacterBERT as the backbone encoder
and an efficient yet effective training method, called Self-Teaching (ST), that
distills knowledge from queries without typos into the queries with typos.
Experimental results show that CharacterBERT in combination with ST achieves
significantly higher effectiveness on queries with typos compared to previous
methods. Along with these results and the open-sourced implementation of the
methods, we also provide a new passage retrieval dataset consisting of
real-world queries with typos and associated relevance assessments on the MS
MARCO corpus, thus supporting the research community in the investigation of
effective and robust dense retrievers. Code, experimental results and dataset
are made available at https://github.com/ielab/CharacterBERT-DR.
","[{'version': 'v1', 'created': 'Fri, 1 Apr 2022 23:02:50 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Apr 2022 08:46:12 GMT'}]",2022-04-27,"[['Zhuang', 'Shengyao', ''], ['Zuccon', 'Guido', '']]","['Dense retrievers', 'Robustness to typos', 'Neural Information Retrieval']"
6839,1806.07174,Farshid Rayhan,"Farshid Rayhan, Sajid Ahmed, Zaynab Mousavian, Dewan Md Farid,
  Swakkhar Shatabda","FRnet-DTI: Deep Convolutional Neural Networks with Evolutionary and
  Structural Features for Drug-Target Interaction",,2019,10.1016/j.heliyon.2020.e03444,,cs.LG stat.ML,http://creativecommons.org/publicdomain/zero/1.0/,"  The task of drug-target interaction prediction holds significant importance
in pharmacology and therapeutic drug design. In this paper, we present
FRnet-DTI, an auto encoder and a convolutional classifier for feature
manipulation and drug target interaction prediction. Two convolutional neural
neworks are proposed where one model is used for feature manipulation and the
other one for classification. Using the first method FRnet-1, we generate 4096
features for each of the instances in each of the datasets and use the second
method, FRnet-2, to identify interaction probability employing those features.
We have tested our method on four gold standard datasets exhaustively used by
other researchers. Experimental results shows that our method significantly
improves over the state-of-the-art method on three of the four drug-target
interaction gold standard datasets on both area under curve for Receiver
Operating Characteristic(auROC) and area under Precision Recall curve(auPR)
metric. We also introduce twenty new potential drug-target pairs for
interaction based on high prediction scores. Codes Available: https: // github.
com/ farshidrayhanuiu/ FRnet-DTI/ Web Implementation: http: // farshidrayhan.
pythonanywhere. com/ FRnet-DTI/
","[{'version': 'v1', 'created': 'Tue, 19 Jun 2018 12:01:57 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Jun 2018 09:14:56 GMT'}, {'version': 'v3', 'created': 'Fri, 31 Aug 2018 08:25:11 GMT'}]",2020-05-26,"[['Rayhan', 'Farshid', ''], ['Ahmed', 'Sajid', ''], ['Mousavian', 'Zaynab', ''], ['Farid', 'Dewan Md', ''], ['Shatabda', 'Swakkhar', '']]","['Class imbalance', 'Drug-Target', 'Classification', 'Ensemble classifier', 'Feature engineering']"
6840,1905.11668,Artur Strzelecki,Artur Strzelecki,A Framework for App Store Optimization,arXiv admin note: text overlap with arXiv:1903.07182,"International Journal of Interactive Mobile Technologies (iJIM)
  2020",10.3991/ijim.v14i13.14143,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper a framework for app store optimization is proposed. The
framework is based on two main areas: developer dependent elements and user
dependent elements. Developer dependent elements are similar to factors in
search engine optimization. User dependent elements are similar to activities
in social media. The proposed framework is modelled after downloading sample
data from two leading app stores: Google Play and Apple iTunes. Results show
that developer dependent elements can be better optimized. Names and
descriptions of mobile apps are not fully utilized.
","[{'version': 'v1', 'created': 'Tue, 28 May 2019 08:17:03 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Aug 2020 10:33:06 GMT'}, {'version': 'v3', 'created': 'Sat, 11 Sep 2021 10:24:36 GMT'}]",2021-09-14,"[['Strzelecki', 'Artur', '']]","['App Store Optimization', 'Google Play', 'Apple iTunes', 'Mobile App Store']"
6841,1710.08335,Anestis Tsakmalis,"Anestis Tsakmalis, Symeon Chatzinotas, Bj\""orn Ottersten","Constrained Bayesian Active Learning of Interference Channels in
  Cognitive Radio Networks","14 pages, 6 figures, submitted to IEEE JSTSP Special Issue on Machine
  Learning for Cognition in Radio Communications and Radar",,10.1109/JSTSP.2017.2785826,,cs.IT cs.LG math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a sequential probing method for interference constraint
learning is proposed to allow a centralized Cognitive Radio Network (CRN)
accessing the frequency band of a Primary User (PU) in an underlay cognitive
scenario with a designed PU protection specification. The main idea is that the
CRN probes the PU and subsequently eavesdrops the reverse PU link to acquire
the binary ACK/NACK packet. This feedback indicates whether the probing-induced
interference is harmful or not and can be used to learn the PU interference
constraint. The cognitive part of this sequential probing process is the
selection of the power levels of the Secondary Users (SUs) which aims to learn
the PU interference constraint with a minimum number of probing attempts while
setting a limit on the number of harmful probing-induced interference events or
equivalently of NACK packet observations over a time window. This constrained
design problem is studied within the Active Learning (AL) framework and an
optimal solution is derived and implemented with a sophisticated, accurate and
fast Bayesian Learning method, the Expectation Propagation (EP). The
performance of this solution is also demonstrated through numerical simulations
and compared with modified versions of AL techniques we developed in earlier
work.
","[{'version': 'v1', 'created': 'Mon, 23 Oct 2017 15:31:32 GMT'}]",2018-03-14,"[['Tsakmalis', 'Anestis', ''], ['Chatzinotas', 'Symeon', ''], ['Ottersten', 'Björn', '']]","['Cognitive Radio Networks', 'Expectation Propagation', 'Active Learning', 'Constrained Dynamic Programming']"
6842,1905.00470,Swagata Duari,Swagata Duari and Vasudha Bhatnagar,Semi-automatic System for Title Construction,"12 pages, 2 figures, conference paper, accepted for publication","Gani A., Das P., Kharb L., Chahal D. (eds) Information,
  Communication and Computing Technology. ICICCT 2019. Communications in
  Computer and Information Science, vol 1025, 216-227. Springer, Singapore",10.1007/978-981-15-1384-8_18,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a semi-automatic system for title construction from
scientific abstracts. The system extracts and recommends impactful words from
the text, which the author can creatively use to construct an appropriate title
for the manuscript. The work is based on the hypothesis that keywords are good
candidates for title construction. We extract important words from the document
by inducing a supervised keyword extraction model. The model is trained on
novel features extracted from graph-of-text representation of the document. We
empirically show that these graph-based features are capable of discriminating
keywords from non-keywords. We further establish empirically that the proposed
approach can be applied to any text irrespective of the training domain and
corpus. We evaluate the proposed system by computing the overlap between
extracted keywords and the list of title-words for documents, and we observe a
macro-averaged precision of 82%.
","[{'version': 'v1', 'created': 'Wed, 1 May 2019 19:49:41 GMT'}]",2019-11-27,"[['Duari', 'Swagata', ''], ['Bhatnagar', 'Vasudha', '']]","['Title Construction', 'Supervised Keyword Extraction', 'Graph-of-text']"
6843,1911.01097,Auriol Degbelo,Auriol Degbelo and Brhane Bahrishum Teka,"Spatial Search Strategies for Open Government Data: A Systematic
  Comparison","Paper accepted to GIR'19: 13th Workshop on Geographic Information
  Retrieval (Lyon, France)",,10.1145/3371140.3371142,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing availability of open government datasets on the Web calls for
ways to enable their efficient access and searching. There is however an
overall lack of understanding regarding spatial search strategies which would
perform best in this context. To address this gap, this work has assessed the
impact of different spatial search strategies on performance and user relevance
judgment. We harvested machine-readable spatial datasets and their metadata
from three English-based open government data portals, performed metadata
enhancement, developed a prototype and performed both a theoretical and
user-based evaluation. The results highlight that (i) switching between area of
overlap and Hausdorff distance for spatial similarity computation does not have
any substantial impact on performance; and (ii) the use of Hausdorff distance
induces slightly better user relevance ratings than the use of area of overlap.
The data collected and the insights gleaned may serve as a baseline against
which future work can compare.
","[{'version': 'v1', 'created': 'Mon, 4 Nov 2019 09:56:45 GMT'}]",2019-11-05,"[['Degbelo', 'Auriol', ''], ['Teka', 'Brhane Bahrishum', '']]","['Spatial Search', 'Open Government Data', 'Hausdorff distance', 'Areaof Overlap', 'Relevance']"
6844,1801.06719,Anton V. Proskurnikov,"Anton Proskurnikov, Roberto Tempo",A Tutorial on Modeling and Analysis of Dynamic Social Networks. Part II,,,10.1016/j.arcontrol.2018.03.005,,cs.SI cs.SY math.OC nlin.AO physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent years have witnessed a significant trend towards filling the gap
between Social Network Analysis (SNA) and control theory. This trend was
enabled by the introduction of new mathematical models describing dynamics of
social groups, the development of algorithms and software for data analysis and
the tremendous progress in understanding complex networks and multi-agent
systems (MAS) dynamics. The aim of this tutorial is to highlight a novel
chapter of control theory, dealing with dynamic models of social networks and
processes over them, to the attention of the broad research community. In its
first part [1], we have considered the most classical models of social
dynamics, which have anticipated and to a great extent inspired the recent
extensive studies on MAS and complex networks. This paper is the second part of
the tutorial, and it is focused on more recent models of social processes that
have been developed concurrently with MAS theory. Future perspectives of
control in social and techno-social systems are also discussed.
","[{'version': 'v1', 'created': 'Sat, 20 Jan 2018 19:52:57 GMT'}, {'version': 'v2', 'created': 'Sat, 31 Mar 2018 20:04:35 GMT'}]",2019-04-04,"[['Proskurnikov', 'Anton', ''], ['Tempo', 'Roberto', '']]","['Social network', 'opinion dynamics', 'multi-agent systems', 'distributed algorithms']"
6845,1710.00163,Ansgar Fehnker,Tim Blok and Ansgar Fehnker,Automated Program Analysis for Novice Programmers,"Published in Proceedings of the 3rd International Conference on
  Higher Education Advances. Eds Josep Domenech, M. Cinta Vicent-Vela, Elena de
  la Poza, Desamparados Blazquez. Valencia. 2017",,10.4995/HEAD17.2017.5533,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper describes how to adapt a static code analyzer to help novice
programmers. Current analyzers have been built to give feedback to experienced
programmers who build new applications or systems. The type of feedback and the
type of analysis of these tools focusses on mistakes that are relevant within
that context, and help with debugging the system. When teaching novice
programmers this type of advice is often not particularly useful. It would be
instead more useful to use these techniques to find problem in the
understanding of students of important programming concepts. This paper first
explores in what respect static analyzers support the learning and teaching of
programming can be implemented based on existing static analysis technology. It
presents an extension to static analyzer PMD was made so that feedback messages
appear which are easier to understand for novice programmers. To answer the
question if these techniques are able to find conceptual mistakes that are
characteristic for novice programmers make, we ran it over a number of student
projects, and compared these results with publicly available mature software
projects.
","[{'version': 'v1', 'created': 'Sat, 30 Sep 2017 08:26:59 GMT'}]",2017-10-03,"[['Blok', 'Tim', ''], ['Fehnker', 'Ansgar', '']]","['Programing education', 'tool support', 'static analysis']"
6846,2106.00965,Marc Zeller,"Kai Hoefig, Marc Zeller, Reiner Heilmann","ALFRED: a methodology to enable component fault trees for layered
  architectures",,"2015 41st Euromicro Conference on Software Engineering and
  Advanced Applications",10.1109/SEAA.2015.26,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identifying drawbacks or insufficiencies in terms of safety is important also
in early development stages of safety critical systems. In industry,
development artefacts such as components or units, are often reused from
existing artefacts to save time and costs. When development artefacts are
reused, their existing safety analysis models are an important input for an
early safety assessment for the new system, since they already provide a valid
model. Component fault trees support such reuse strategies by a compositional
horizontal approach. But current development strategies do not only divide
systems horizontally, e.g., By encapsulating different functionality into
separate components and hierarchies of components, but also vertically, e.g.
Into software and hardware architecture layers. Current safety analysis
methodologies, such as component fault trees, do not support such vertical
layers. Therefore, we present here a methodology that is able to divide safety
analysis models into different layers of a systems architecture. We use so
called Architecture Layer Failure Dependencies to enable component fault trees
on different layers of an architecture. These dependencies are then used to
generate safety evidence for the entire system and over all different
architecture layers. A case study applies the approach to hardware and software
layers.
","[{'version': 'v1', 'created': 'Wed, 2 Jun 2021 06:15:58 GMT'}]",2021-06-03,"[['Hoefig', 'Kai', ''], ['Zeller', 'Marc', ''], ['Heilmann', 'Reiner', '']]","['safety analysis', 'component fault tree', 'compositional safety', 'model-based development', 'component-baseddevelopment', 'embedded systems', 'cyberphysical systems']"
6847,2204.01662,Li Ding,Li Ding and Lee Spector,Evolving Neural Selection with Adaptive Regularization,,"Proceedings of the Genetic and Evolutionary Computation Conference
  Companion (pp. 1717-1725). 2021",10.1145/3449726.3463189,,cs.NE cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over-parameterization is one of the inherent characteristics of modern deep
neural networks, which can often be overcome by leveraging regularization
methods, such as Dropout. Usually, these methods are applied globally and all
the input cases are treated equally. However, given the natural variation of
the input space for real-world tasks such as image recognition and natural
language understanding, it is unlikely that a fixed regularization pattern will
have the same effectiveness for all the input cases. In this work, we
demonstrate a method in which the selection of neurons in deep neural networks
evolves, adapting to the difficulty of prediction. We propose the Adaptive
Neural Selection (ANS) framework, which evolves to weigh neurons in a layer to
form network variants that are suitable to handle different input cases.
Experimental results show that the proposed method can significantly improve
the performance of commonly-used neural network architectures on standard image
recognition benchmarks. Ablation studies also validate the effectiveness and
contribution of each component in the proposed framework.
","[{'version': 'v1', 'created': 'Mon, 4 Apr 2022 17:19:52 GMT'}]",2022-04-05,"[['Ding', 'Li', ''], ['Spector', 'Lee', '']]","['Neural Networks', 'Selection Methods', 'Neural Evolution']"
6848,1910.00084,Gengchen Mai,"Gengchen Mai, Krzysztof Janowicz, Bo Yan, Rui Zhu, Ling Cai, Ni Lao","Contextual Graph Attention for Answering Logical Queries over Incomplete
  Knowledge Graphs","8 pages, 3 figures, camera ready version of article accepted to K-CAP
  2019, Marina del Rey, California, United States","K-CAP 2019, Nov. 19 - 21, 2019, Marina del Rey, CA, USA",10.1145/3360901.3364432,,cs.LG cs.AI cs.CL stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, several studies have explored methods for using KG embedding to
answer logical queries. These approaches either treat embedding learning and
query answering as two separated learning tasks, or fail to deal with the
variability of contributions from different query paths. We proposed to
leverage a graph attention mechanism to handle the unequal contribution of
different query paths. However, commonly used graph attention assumes that the
center node embedding is provided, which is unavailable in this task since the
center node is to be predicted. To solve this problem we propose a multi-head
attention-based end-to-end logical query answering model, called Contextual
Graph Attention model(CGA), which uses an initial neighborhood aggregation
layer to generate the center embedding, and the whole model is trained jointly
on the original KG structure as well as the sampled query-answer pairs. We also
introduce two new datasets, DB18 and WikiGeo19, which are rather large in size
compared to the existing datasets and contain many more relation types, and use
them to evaluate the performance of the proposed model. Our result shows that
the proposed CGA with fewer learnable parameters consistently outperforms the
baseline models on both datasets as well as Bio dataset.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2019 20:20:48 GMT'}]",2019-10-02,"[['Mai', 'Gengchen', ''], ['Janowicz', 'Krzysztof', ''], ['Yan', 'Bo', ''], ['Zhu', 'Rui', ''], ['Cai', 'Ling', ''], ['Lao', 'Ni', '']]","['Knowledge Graph Embedding', 'Logical Query Answering', 'Multihead Attention Model']"
6849,2008.11087,Chuheng Zhang,"Wei Shen, Xiaonan He, Chuheng Zhang, Qiang Ni, Wanchun Dou, Yan Wang","Auxiliary-task Based Deep Reinforcement Learning for Participant
  Selection Problem in Mobile Crowdsourcing",Accepted by CIKM 2020,,10.1145/3340531.3411913,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In mobile crowdsourcing (MCS), the platform selects participants to complete
location-aware tasks from the recruiters aiming to achieve multiple goals
(e.g., profit maximization, energy efficiency, and fairness). However,
different MCS systems have different goals and there are possibly conflicting
goals even in one MCS system. Therefore, it is crucial to design a participant
selection algorithm that applies to different MCS systems to achieve multiple
goals. To deal with this issue, we formulate the participant selection problem
as a reinforcement learning problem and propose to solve it with a novel
method, which we call auxiliary-task based deep reinforcement learning (ADRL).
We use transformers to extract representations from the context of the MCS
system and a pointer network to deal with the combinatorial optimization
problem. To improve the sample efficiency, we adopt an auxiliary-task training
process that trains the network to predict the imminent tasks from the
recruiters, which facilitates the embedding learning of the deep learning
model. Additionally, we release a simulated environment on a specific MCS task,
the ride-sharing task, and conduct extensive performance evaluations in this
environment. The experimental results demonstrate that ADRL outperforms and
improves sample efficiency over other well-recognized baselines in various
settings.
","[{'version': 'v1', 'created': 'Tue, 25 Aug 2020 15:02:54 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Aug 2020 00:55:05 GMT'}]",2020-08-27,"[['Shen', 'Wei', ''], ['He', 'Xiaonan', ''], ['Zhang', 'Chuheng', ''], ['Ni', 'Qiang', ''], ['Dou', 'Wanchun', ''], ['Wang', 'Yan', '']]","['Mobile Crowdsourcing', 'Reinforcement Learning', 'Participant Selection Problem']"
6850,1803.09103,Sowmya Vajjala,Sowmya Vajjala,Machine Learning and Applied Linguistics,"Pre-print version of the article that is accepted for publication in
  ""Encyclopedia of Applied Linguistics""",,10.1002/9781405198431.wbeal1486,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This entry introduces the topic of machine learning and provides an overview
of its relevance for applied linguistics and language learning. The discussion
will focus on giving an introduction to the methods and applications of machine
learning in applied linguistics, and will provide references for further study.
","[{'version': 'v1', 'created': 'Sat, 24 Mar 2018 13:08:56 GMT'}]",2018-04-11,"[['Vajjala', 'Sowmya', '']]","['Machine Learning', 'Language learning Technology', 'CALL', 'NLP', 'Computational Linguistics']"
6851,2109.07857,Pawel Trajdos,"Pawel Trajdos, Marek Kurzynski",Soft Confusion Matrix Classifier for Stream Classification,,,10.1007/978-3-030-77967-2_1,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  In this paper, the issue of tailoring the soft confusion matrix (SCM) based
classifier to deal with stream learning task is addressed. The main goal of the
work is to develop a wrapping-classifier that allows incremental learning to
classifiers that are unable to learn incrementally. The goal is achieved by
making two improvements in the previously developed SCM classifier. The first
one is aimed at reducing the computational cost of the SCM classifier. To do
so, the definition of the fuzzy neighborhood of an object is changed. The
second one is aimed at effective dealing with the concept drift. This is done
by employing the ADWIN-driven concept drift detector that is not only used to
detect the drift but also to control the size of the neighbourhood. The
obtained experimental results show that the proposed approach significantly
outperforms the reference methods.
","[{'version': 'v1', 'created': 'Thu, 16 Sep 2021 10:38:35 GMT'}]",2021-09-17,"[['Trajdos', 'Pawel', ''], ['Kurzynski', 'Marek', '']]","['classification', 'probabilistic model', 'randomized reference classifier', 'soft confusion matrix', 'stream classification']"
6852,2209.01518,Nesara Dissanayake,"Nesara Dissanayake, Asangi Jayatilaka, Mansooreh Zahedi, Muhammad Ali
  Babar",An Empirical Study of Automation in Software Security Patch Management,"13 pages, 2 figures",,10.1145/3551349.3556969,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Several studies have shown that automated support for different activities of
the security patch management process has great potential for reducing delays
in installing security patches. However, it is also important to understand how
automation is used in practice, its limitations in meeting real-world needs and
what practitioners really need, an area that has not been empirically
investigated in the existing software engineering literature. This paper
reports an empirical study aimed at investigating different aspects of
automation for security patch management using semi-structured interviews with
17 practitioners from three different organisations in the healthcare domain.
The findings are focused on the role of automation in security patch management
for providing insights into the as-is state of automation in practice, the
limitations of current automation, how automation support can be enhanced to
effectively meet practitioners' needs, and the role of the human in an
automated process. Based on the findings, we have derived a set of
recommendations for directing future efforts aimed at developing automated
support for security patch management.
","[{'version': 'v1', 'created': 'Sun, 4 Sep 2022 02:58:37 GMT'}]",2022-09-07,"[['Dissanayake', 'Nesara', ''], ['Jayatilaka', 'Asangi', ''], ['Zahedi', 'Mansooreh', ''], ['Babar', 'Muhammad Ali', '']]","['security updates', 'patch management', 'vulnerability management']"
6853,2109.00084,Alexey Svyatkovskiy,"Alexey Svyatkovskiy, Sarah Fakhoury, Negar Ghorbani, Todd Mytkowicz,
  Elizabeth Dinella, Christian Bird, Jinu Jang, Neel Sundaresan, Shuvendu
  Lahiri",Program Merge Conflict Resolution via Neural Transformers,"ESEC/FSE '22 camera ready version. 12 pages, 4 figures, online
  appendix",,10.1145/3540250.3549163,,cs.SE cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Collaborative software development is an integral part of the modern software
development life cycle, essential to the success of large-scale software
projects. When multiple developers make concurrent changes around the same
lines of code, a merge conflict may occur. Such conflicts stall pull requests
and continuous integration pipelines for hours to several days, seriously
hurting developer productivity. To address this problem, we introduce
MergeBERT, a novel neural program merge framework based on token-level
three-way differencing and a transformer encoder model. By exploiting the
restricted nature of merge conflict resolutions, we reformulate the task of
generating the resolution sequence as a classification task over a set of
primitive merge patterns extracted from real-world merge commit data. Our model
achieves 63-68% accuracy for merge resolution synthesis, yielding nearly a 3x
performance improvement over existing semi-structured, and 2x improvement over
neural program merge tools. Finally, we demonstrate that MergeBERT is
sufficiently flexible to work with source code files in Java, JavaScript,
TypeScript, and C# programming languages. To measure the practical use of
MergeBERT, we conduct a user study to evaluate MergeBERT suggestions with 25
developers from large OSS projects on 122 real-world conflicts they
encountered. Results suggest that in practice, MergeBERT resolutions would be
accepted at a higher rate than estimated by automatic metrics for precision and
accuracy. Additionally, we use participant feedback to identify future avenues
for improvement of MergeBERT.
","[{'version': 'v1', 'created': 'Tue, 31 Aug 2021 21:37:53 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Sep 2021 16:28:18 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Sep 2022 21:06:42 GMT'}, {'version': 'v4', 'created': 'Tue, 29 Nov 2022 05:25:10 GMT'}]",2022-11-30,"[['Svyatkovskiy', 'Alexey', ''], ['Fakhoury', 'Sarah', ''], ['Ghorbani', 'Negar', ''], ['Mytkowicz', 'Todd', ''], ['Dinella', 'Elizabeth', ''], ['Bird', 'Christian', ''], ['Jang', 'Jinu', ''], ['Sundaresan', 'Neel', ''], ['Lahiri', 'Shuvendu', '']]","['Software evolution', 'program merge', 'ml4code']"
6854,2009.14125,Xuebin Ren Dr,"Xuebin Ren, Chia-Mu Yu, Wei Yu, Xinyu Yang, Jun Zhao, Shusen Yang","DPCrowd: Privacy-preserving and Communication-efficient Decentralized
  Statistical Estimation for Real-time Crowd-sourced Data",,,10.1109/JIOT.2020.3020089,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Internet of Things (IoT) driven smart-world systems, real-time
crowd-sourced databases from multiple distributed servers can be aggregated to
extract dynamic statistics from a larger population, thus providing more
reliable knowledge for our society. Particularly, multiple distributed servers
in a decentralized network can realize real-time collaborative statistical
estimation by disseminating statistics from their separate databases. Despite
no raw data sharing, the real-time statistics could still expose the data
privacy of crowd-sourcing participants. For mitigating the privacy concern,
while traditional differential privacy (DP) mechanism can be simply implemented
to perturb the statistics in each timestamp and independently for each
dimension, this may suffer a great utility loss from the real-time and
multi-dimensional crowd-sourced data. Also, the real-time broadcasting would
bring significant overheads in the whole network. To tackle the issues, we
propose a novel privacy-preserving and communication-efficient decentralized
statistical estimation algorithm (DPCrowd), which only requires intermittently
sharing the DP protected parameters with one-hop neighbors by exploiting the
temporal correlations in real-time crowd-sourced data. Then, with further
consideration of spatial correlations, we develop an enhanced algorithm,
DPCrowd+, to deal with multi-dimensional infinite crowd-data streams. Extensive
experiments on several datasets demonstrate that our proposed schemes DPCrowd
and DPCrowd+ can significantly outperform existing schemes in providing
accurate and consensus estimation with rigorous privacy protection and great
communication efficiency.
","[{'version': 'v1', 'created': 'Tue, 29 Sep 2020 16:18:44 GMT'}]",2022-04-04,"[['Ren', 'Xuebin', ''], ['Yu', 'Chia-Mu', ''], ['Yu', 'Wei', ''], ['Yang', 'Xinyu', ''], ['Zhao', 'Jun', ''], ['Yang', 'Shusen', '']]","['Differential privacy', 'decentralized statistical estimation', 'real time', 'communication efficiency', 'crowd-sourced data']"
6855,2008.03110,Matthias Stierle,"Matthias Stierle, Sven Weinzierl, Maximilian Harl, Martin Matzner","A Technique for Determining Relevance Scores of Process Activities using
  Graph-based Neural Networks",,"Decision Support Systems, 2021",10.1016/j.dss.2021.113511,,cs.LG cs.AI stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Process models generated through process mining depict the as-is state of a
process. Through annotations with metrics such as the frequency or duration of
activities, these models provide generic information to the process analyst. To
improve business processes with respect to performance measures, process
analysts require further guidance from the process model. In this study, we
design Graph Relevance Miner (GRM), a technique based on graph neural networks,
to determine the relevance scores for process activities with respect to
performance measures. Annotating process models with such relevance scores
facilitates a problem-focused analysis of the business process, placing these
problems at the centre of the analysis. We quantitatively evaluate the
predictive quality of our technique using four datasets from different domains,
to demonstrate the faithfulness of the relevance scores. Furthermore, we
present the results of a case study, which highlight the utility of the
technique for organisations. Our work has important implications both for
research and business applications, because process model-based analyses
feature shortcomings that need to be urgently addressed to realise successful
process mining at an enterprise level.
","[{'version': 'v1', 'created': 'Fri, 7 Aug 2020 12:15:30 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Feb 2021 08:57:52 GMT'}]",2021-02-04,"[['Stierle', 'Matthias', ''], ['Weinzierl', 'Sven', ''], ['Harl', 'Maximilian', ''], ['Matzner', 'Martin', '']]","['Process Mining', 'Process Analytics', 'Business Process Management', 'Deep Learning', 'Graph Neural Networks']"
6856,1709.09972,Andr\'e Hottung,"Andr\'e Hottung, Shunji Tanaka, Kevin Tierney","Deep Learning Assisted Heuristic Tree Search for the Container
  Pre-marshalling Problem",,Computers & Operations Research 113 (2020) 104781,10.1016/j.cor.2019.104781,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The container pre-marshalling problem (CPMP) is concerned with the
re-ordering of containers in container terminals during off-peak times so that
containers can be quickly retrieved when the port is busy. The problem has
received significant attention in the literature and is addressed by a large
number of exact and heuristic methods. Existing methods for the CPMP heavily
rely on problem-specific components (e.g., proven lower bounds) that need to be
developed by domain experts with knowledge of optimization techniques and a
deep understanding of the problem at hand. With the goal to automate the costly
and time-intensive design of heuristics for the CPMP, we propose a new method
called Deep Learning Heuristic Tree Search (DLTS). It uses deep neural networks
to learn solution strategies and lower bounds customized to the CPMP solely
through analyzing existing (near-) optimal solutions to CPMP instances. The
networks are then integrated into a tree search procedure to decide which
branch to choose next and to prune the search tree. DLTS produces the highest
quality heuristic solutions to the CPMP to date with gaps to optimality below
2% on real-world sized instances.
","[{'version': 'v1', 'created': 'Thu, 28 Sep 2017 14:06:28 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Sep 2019 15:16:38 GMT'}]",2019-09-19,"[['Hottung', 'André', ''], ['Tanaka', 'Shunji', ''], ['Tierney', 'Kevin', '']]","['tree search', 'deep learning', 'container pre-marshalling']"
6857,2211.15961,Pengyuan Zhai,"Yuqing Gao, Pengyuan Zhai, Khalid M. Mosalam","Balanced Semi-Supervised Generative Adversarial Network for Damage
  Assessment from Low-Data Imbalanced-Class Regime",,"Computer-Aided Civil and Infrastructure Engineering. 2021; 36:
  1094-1113",10.1111/mice.12741,,cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, applying deep learning (DL) to assess structural damages has
gained growing popularity in vision-based structural health monitoring (SHM).
However, both data deficiency and class-imbalance hinder the wide adoption of
DL in practical applications of SHM. Common mitigation strategies include
transfer learning, over-sampling, and under-sampling, yet these ad-hoc methods
only provide limited performance boost that varies from one case to another. In
this work, we introduce one variant of the Generative Adversarial Network
(GAN), named the balanced semi-supervised GAN (BSS-GAN). It adopts the
semi-supervised learning concept and applies balanced-batch sampling in
training to resolve low-data and imbalanced-class problems. A series of
computer experiments on concrete cracking and spalling classification were
conducted under the low-data imbalanced-class regime with limited computing
power. The results show that the BSS-GAN is able to achieve better damage
detection in terms of recall and $F_\beta$ score than other conventional
methods, indicating its state-of-the-art performance.
","[{'version': 'v1', 'created': 'Tue, 29 Nov 2022 06:40:06 GMT'}]",2022-11-30,"[['Gao', 'Yuqing', ''], ['Zhai', 'Pengyuan', ''], ['Mosalam', 'Khalid M.', '']]","['GAN', 'Imbalanced-class', 'Low-data', 'Semi-supervised learning', 'Structural damage assessment']"
6858,2210.03672,Anthea M\'erida,"Anthea M\'erida, Argyris Kalogeratos and Mathilde Mougeot","To tree or not to tree? Assessing the impact of smoothing the decision
  boundaries","12 pages, 3 figures, 3 tables. arXiv admin note: text overlap with
  arXiv:2006.11458","Artificial Neural Networks and Machine Learning - ICANN 2022: 31st
  International Conference on Artificial Neural Networks, Bristol, UK,
  September 6-9, 2022, Proceedings, Part I. Springer-Verlag, Berlin,
  Heidelberg, 660-672",10.1007/978-3-031-15919-0_55,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When analyzing a dataset, it can be useful to assess how smooth the decision
boundaries need to be for a model to better fit the data. This paper addresses
this question by proposing the quantification of how much should the 'rigid'
decision boundaries, produced by an algorithm that naturally finds such
solutions, be relaxed to obtain a performance improvement. The approach we
propose starts with the rigid decision boundaries of a seed Decision Tree (seed
DT), which is used to initialize a Neural DT (NDT). The initial boundaries are
challenged by relaxing them progressively through training the NDT. During this
process, we measure the NDT's performance and decision agreement to its seed
DT. We show how these two measures can help the user in figuring out how
expressive his model should be, before exploring it further via model
selection. The validity of our approach is demonstrated with experiments on
simulated and benchmark datasets.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2022 16:27:13 GMT'}]",2022-10-10,"[['Mérida', 'Anthea', ''], ['Kalogeratos', 'Argyris', ''], ['Mougeot', 'Mathilde', '']]","['Decision trees', 'neural decision trees', 'neural networks', 'modelfamily selection', 'model selection', 'interpretability', 'data exploration']"
6859,1905.06812,Guan Wang,"Guan Wang, Hamid Laga, Jinyuan Jia, Stanley J. Miklavcic, Anuj
  Srivastava","Statistical Analysis and Modeling of the Geometry and Topology of Plant
  Roots",,"Journal of Theoretical Biology, 2020",10.1016/j.jtbi.2019.110108,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The root is an important organ of a plant since it is responsible for water
and nutrient uptake. Analyzing and modelling variabilities in the geometry and
topology of roots can help in assessing the plant's health, understanding its
growth patterns, and modeling relations between plant species and between
plants and their environment. In this article, we develop a framework for the
statistical analysis and modeling of the geometry and topology of plant roots.
We represent root structures as points in a tree-shape space equipped with a
metric that quantifies geometric and topological differences between pairs of
roots. We then use these building blocks to compute geodesics, i.e., optimal
deformations under the metric between root structures, and to perform
statistical analysis on root populations. We demonstrate the utility of the
proposed framework through an application to a dataset of wheat roots grown in
different environmental conditions. We also show that the framework can be used
in various applications including classification and regression.
","[{'version': 'v1', 'created': 'Thu, 16 May 2019 14:53:05 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Oct 2019 09:45:42 GMT'}]",2021-01-26,"[['Wang', 'Guan', ''], ['Laga', 'Hamid', ''], ['Jia', 'Jinyuan', ''], ['Miklavcic', 'Stanley J.', ''], ['Srivastava', 'Anuj', '']]","['geodesics', 'tree-shape space', 'root shape alignment', 'shape analysis', 'principal component analysis', 'shapemodeling', 'root shape synthesis']"
6860,2010.06544,Eduardo Ribeiro,"Eduardo Godinho Ribeiro, Raul de Queiroz Mendes, Valdir Grassi Jr","Real-Time Deep Learning Approach to Visual Servo Control and Grasp
  Detection for Autonomous Robotic Manipulation","27 pages, 24 figures. Preprint published in the Elsevier's Robotics
  and Autonomous Systems journal on February 24, 2021","Journal: Robotics and Autonomous Systems, publisher: Elsevier,
  volume number: 139, year: 2021, page number: 103757",10.1016/j.robot.2021.103757,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to explore robotic grasping in unstructured and dynamic
environments, this work addresses the visual perception phase involved in the
task. This phase involves the processing of visual data to obtain the location
of the object to be grasped, its pose and the points at which the robot`s
grippers must make contact to ensure a stable grasp. For this, the Cornell
Grasping dataset is used to train a convolutional neural network that, having
an image of the robot`s workspace, with a certain object, is able to predict a
grasp rectangle that symbolizes the position, orientation and opening of the
robot`s grippers before its closing. In addition to this network, which runs in
real-time, another one is designed to deal with situations in which the object
moves in the environment. Therefore, the second network is trained to perform a
visual servo control, ensuring that the object remains in the robot`s field of
view. This network predicts the proportional values of the linear and angular
velocities that the camera must have so that the object is always in the image
processed by the grasp network. The dataset used for training was automatically
generated by a Kinova Gen3 manipulator. The robot is also used to evaluate the
applicability in real-time and obtain practical results from the designed
algorithms. Moreover, the offline results obtained through validation sets are
also analyzed and discussed regarding their efficiency and processing speed.
The developed controller was able to achieve a millimeter accuracy in the final
position considering a target object seen for the first time. To the best of
our knowledge, we have not found in the literature other works that achieve
such precision with a controller learned from scratch. Thus, this work presents
a new system for autonomous robotic manipulation with high processing speed and
the ability to generalize to several different objects.
","[{'version': 'v1', 'created': 'Tue, 13 Oct 2020 16:52:36 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Feb 2021 22:10:42 GMT'}]",2021-03-02,"[['Ribeiro', 'Eduardo Godinho', ''], ['Mendes', 'Raul de Queiroz', ''], ['Grassi', 'Valdir', 'Jr']]","['Robotic Grasping', 'Visual Servoing', 'Real-Time', 'Deep Learning', '7DoF Robot']"
6861,1805.01742,Rafael Pereira Pires,"Sonia Ben Mokhtar, Antoine Boutet, Pascal Felber, Marcelo Pasin,
  Rafael Pires and Valerio Schiavoni",X-Search: Revisiting Private Web Search using Intel SGX,"Proceedings of the 18th ACM/IFIP/USENIX Middleware Conference. Las
  Vegas, NV, USA, December 11-15, 2017, 11 pages",2017 In Proceedings of Middleware '17,10.1145/3135974.3135987,,cs.DC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The exploitation of user search queries by search engines is at the heart of
their economic model. As consequence, offering private Web search
functionalities is essential to the users who care about their privacy.
Nowadays, there exists no satisfactory approach to enable users to access
search engines in a privacy-preserving way. Existing solutions are either too
costly due to the heavy use of cryptographic mechanisms (e.g., private
information retrieval protocols), subject to attacks (e.g., Tor, TrackMeNot,
GooPIR) or rely on weak adversarial models (e.g., PEAS). This paper introduces
X-Search , a novel private Web search mechanism building on the disruptive
Software Guard Extensions (SGX) proposed by Intel. We compare X-Search to its
closest competitors, Tor and PEAS, using a dataset of real web search queries.
Our evaluation shows that: (1) X-Search offers stronger privacy guarantees than
its competitors as it operates under a stronger adversarial model; (2) it
better resists state-of-the-art re-identification attacks; and (3) from the
performance perspective, X-Search outperforms its competitors both in terms of
latency and throughput by orders of magnitude.
","[{'version': 'v1', 'created': 'Fri, 4 May 2018 12:47:49 GMT'}]",2018-05-07,"[['Mokhtar', 'Sonia Ben', ''], ['Boutet', 'Antoine', ''], ['Felber', 'Pascal', ''], ['Pasin', 'Marcelo', ''], ['Pires', 'Rafael', ''], ['Schiavoni', 'Valerio', '']]","['Middleware', 'security', 'SGX', 'web search', 'privacy']"
6862,2108.11460,Ben Carterette,"Ben Carterette, Rosie Jones, Gareth F. Jones, Maria Eskevich, Sravana
  Reddy, Ann Clifton, Yongze Yu, Jussi Karlgren, Ian Soboroff","Podcast Metadata and Content: Episode Relevance andAttractiveness in Ad
  Hoc Search",,,10.1145/3404835.3463101,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Rapidly growing online podcast archives contain diverse content on a wide
range of topics. These archives form an important resource for entertainment
and professional use, but their value can only be realized if users can rapidly
and reliably locate content of interest. Search for relevant content can be
based on metadata provided by content creators, but also on transcripts of the
spoken content itself. Excavating relevant content from deep within these audio
streams for diverse types of information needs requires varying the approach to
systems prototyping. We describe a set of diverse podcast information needs and
different approaches to assessing retrieved content for relevance. We use these
information needs in an investigation of the utility and effectiveness of these
information sources. Based on our analysis, we recommend approaches for
indexing and retrieving podcast content for ad hoc search.
","[{'version': 'v1', 'created': 'Wed, 25 Aug 2021 20:20:57 GMT'}]",2021-08-27,"[['Carterette', 'Ben', ''], ['Jones', 'Rosie', ''], ['Jones', 'Gareth F.', ''], ['Eskevich', 'Maria', ''], ['Reddy', 'Sravana', ''], ['Clifton', 'Ann', ''], ['Yu', 'Yongze', ''], ['Karlgren', 'Jussi', ''], ['Soboroff', 'Ian', '']]","['datasets', 'search', 'information retrieval', 'spoken content retrieval', 'podcasts', 'broadcast media']"
6863,1907.01427,Mark Scanlon,"Felix Anda, David Lillis, Aikaterini Kanta, Brett A. Becker, Elias
  Bou-Harb, Nhien-An Le-Khac, Mark Scanlon","Improving Borderline Adulthood Facial Age Estimation through Ensemble
  Learning",,"14th International Conference on Availability, Reliability and
  Security (ARES 2019), Canterbury, UK, August 2019",10.1145/3339252.3341491,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Achieving high performance for facial age estimation with subjects in the
borderline between adulthood and non-adulthood has always been a challenge.
Several studies have used different approaches from the age of a baby to an
elder adult and different datasets have been employed to measure the mean
absolute error (MAE) ranging between 1.47 to 8 years. The weakness of the
algorithms specifically in the borderline has been a motivation for this paper.
In our approach, we have developed an ensemble technique that improves the
accuracy of underage estimation in conjunction with our deep learning model
(DS13K) that has been fine-tuned on the Deep Expectation (DEX) model. We have
achieved an accuracy of 68% for the age group 16 to 17 years old, which is 4
times better than the DEX accuracy for such age range. We also present an
evaluation of existing cloud-based and offline facial age prediction services,
such as Amazon Rekognition, Microsoft Azure Cognitive Services, How-Old.net and
DEX.
","[{'version': 'v1', 'created': 'Tue, 2 Jul 2019 15:05:24 GMT'}]",2019-07-03,"[['Anda', 'Felix', ''], ['Lillis', 'David', ''], ['Kanta', 'Aikaterini', ''], ['Becker', 'Brett A.', ''], ['Bou-Harb', 'Elias', ''], ['Le-Khac', 'Nhien-An', ''], ['Scanlon', 'Mark', '']]","['Underage Photo Datasets', 'Deep Learning', 'Digital Forensics', 'ChildExploitation Investigation', 'Facial Recognition']"
6864,1711.10521,Fatmatulzehra Uslu Ms.,Fatmatulzehra Uslu and Anil Anthony Bharath,A Recursive Bayesian Approach To Describe Retinal Vasculature Geometry,"26 pages,13 figures, journal paper",,10.1016/j.patcog.2018.10.017,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Demographic studies suggest that changes in the retinal vasculature geometry,
especially in vessel width, are associated with the incidence or progression of
eye-related or systemic diseases. To date, the main information source for
width estimation from fundus images has been the intensity profile between
vessel edges. However, there are many factors affecting the intensity profile:
pathologies, the central light reflex and local illumination levels, to name a
few. In this study, we introduce three information sources for width
estimation. These are the probability profiles of vessel interior, centreline
and edge locations generated by a deep network. The probability profiles
provide direct access to vessel geometry and are used in the likelihood
calculation for a Bayesian method, particle filtering. We also introduce a
geometric model which can handle non-ideal conditions of the probability
profiles. Our experiments conducted on the REVIEW dataset yielded consistent
estimates of vessel width, even in cases when one of the vessel edges is
difficult to identify. Moreover, our results suggest that the method is better
than human observers at locating edges of low contrast vessels.
","[{'version': 'v1', 'created': 'Tue, 28 Nov 2017 19:28:27 GMT'}]",2018-10-16,"[['Uslu', 'Fatmatulzehra', ''], ['Bharath', 'Anil Anthony', '']]","['Particle filtering', 'Deep Belief Nets', 'deep neural networks', 'fundusimages', 'width estimation', 'tracking']"
6865,1704.00206,Dmitry Kulyabov PhD,"M. N. Gevorkyan, A. V. Demidova, A. V. Korolkova, D. S. Kulyabov, L.
  A. Sevastianov",The Stochastic Processes Generation in OpenModelica,"in English, in Russian",,10.1007/978-3-319-51917-3_46,,cs.MS physics.comp-ph,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Background: Component-based modeling language Modelica (OpenModelica is open
source implementation) is used for the numerical simulation of complex
processes of different nature represented by ODE system. However, in
OpenModelica standard library there is no routines for pseudo-random numbers
generation, which makes it impossible to use for stochastic modeling processes.
Purpose: The goal of this article is a brief overview of a number of algorithms
for generation a sequence of uniformly distributed pseudo random numbers and
quality assessment of the sequence given by them, as well as the ways to
implement some of these algorithms in OpenModelica system. Methods: All the
algorithms are implemented in C language, and the results of their work tested
using open source package DieHarder. For those algorithms that do not use bit
operations, we describe there realisation using OpwnModelica. The other
algorithms can be called in OpenModelica as C functions Results: We have
implemented and tested about nine algorithms. DieHarder testing revealed the
highest quality pseudo-random number generators. Also we have reviewed
libraries Noise and AdvancedNoise, who claim to be adding to the Modelica
Standard Library. Conclusions: In OpenModelica system can be implemented
generators of uniformly distributed pseudo-random numbers, which is the first
step towards to make OpenModelica suitable for simulation of stochastic
processes.
","[{'version': 'v1', 'created': 'Sat, 1 Apr 2017 18:17:50 GMT'}]",2017-05-02,"[['Gevorkyan', 'M. N.', ''], ['Demidova', 'A. V.', ''], ['Korolkova', 'A. V.', ''], ['Kulyabov', 'D. S.', ''], ['Sevastianov', 'L. A.', '']]","['Modelica', 'OpenModelica', 'random generator', 'Wiener process', 'Poisson process', 'SDE']"
6866,2210.07689,Velko Vechev,"Velko Vechev, Ronan Hinchet, Stelian Coros, Bernhard Thomaszewski,
  Otmar Hilliges",Computational Design of Active Kinesthetic Garments,,,10.1145/3526113.3545674,,cs.HC cs.RO,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Garments with the ability to provide kinesthetic force-feedback on-demand can
augment human capabilities in a non-obtrusive way, enabling numerous
applications in VR haptics, motion assistance, and robotic control. However,
designing such garments is a complex, and often manual task, particularly when
the goal is to resist multiple motions with a single design. In this work, we
propose a computational pipeline for designing connecting structures between
active components - one of the central challenges in this context. We focus on
electrostatic (ES) clutches that are compliant in their passive state while
strongly resisting elongation when activated. Our method automatically computes
optimized connecting structures that efficiently resist a range of pre-defined
body motions on demand. We propose a novel dual-objective optimization approach
to simultaneously maximize the resistance to motion when clutches are active,
while minimizing resistance when inactive. We demonstrate our method on a set
of problems involving different body sites and a range of motions. We further
fabricate and evaluate a subset of our automatically created designs against
manually created baselines using mechanical testing and in a VR pointing study.
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2022 10:29:20 GMT'}]",2022-10-17,"[['Vechev', 'Velko', ''], ['Hinchet', 'Ronan', ''], ['Coros', 'Stelian', ''], ['Thomaszewski', 'Bernhard', ''], ['Hilliges', 'Otmar', '']]","['computational design', 'topology optimization', 'kinesthetic feedback']"
6867,2012.08153,Han Zhang,"Han Zhang, Wenhao Zheng, Charley Chen, Kevin Gao, Yao Hu, Ling Huang,
  and Wei Xu","Modeling Heterogeneous Statistical Patterns in High-dimensional Data by
  Adversarial Distributions: An Unsupervised Generative Framework",,,10.1145/3366423.3380213,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Since the label collecting is prohibitive and time-consuming, unsupervised
methods are preferred in applications such as fraud detection. Meanwhile, such
applications usually require modeling the intrinsic clusters in
high-dimensional data, which usually displays heterogeneous statistical
patterns as the patterns of different clusters may appear in different
dimensions. Existing methods propose to model the data clusters on selected
dimensions, yet globally omitting any dimension may damage the pattern of
certain clusters. To address the above issues, we propose a novel unsupervised
generative framework called FIRD, which utilizes adversarial distributions to
fit and disentangle the heterogeneous statistical patterns. When applying to
discrete spaces, FIRD effectively distinguishes the synchronized fraudsters
from normal users. Besides, FIRD also provides superior performance on anomaly
detection datasets compared with SOTA anomaly detection methods (over 5%
average AUC improvement). The significant experiment results on various
datasets verify that the proposed method can better model the heterogeneous
statistical patterns in high-dimensional data and benefit downstream
applications.
","[{'version': 'v1', 'created': 'Tue, 15 Dec 2020 08:51:20 GMT'}]",2020-12-16,"[['Zhang', 'Han', ''], ['Zheng', 'Wenhao', ''], ['Chen', 'Charley', ''], ['Gao', 'Kevin', ''], ['Hu', 'Yao', ''], ['Huang', 'Ling', ''], ['Xu', 'Wei', '']]","['unsupervised learning', 'adversarial distributions', 'heterogeneousstatistical patterns', 'high-dimensional data', 'prior knowledge']"
6868,2007.03281,Mohammad Idrees Bhat,Mohammad Idrees Bhat and B. Sharada,"Spectral Graph-based Features for Recognition of Handwritten Characters:
  A Case Study on Handwritten Devanagari Numerals","16 pages, 8 figures","Journal of Intelligent Systems,29,2018,799-813",10.1515/jisys-2017-0448,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interpretation of different writing styles, unconstrained cursiveness and
relationship between different primitive parts is an essential and challenging
task for recognition of handwritten characters. As feature representation is
inadequate, appropriate interpretation/description of handwritten characters
seems to be a challenging task. Although existing research in handwritten
characters is extensive, it still remains a challenge to get the effective
representation of characters in feature space. In this paper, we make an
attempt to circumvent these problems by proposing an approach that exploits the
robust graph representation and spectral graph embedding concept to
characterise and effectively represent handwritten characters, taking into
account writing styles, cursiveness and relationships. For corroboration of the
efficacy of the proposed method, extensive experiments were carried out on the
standard handwritten numeral Computer Vision Pattern Recognition, Unit of
Indian Statistical Institute Kolkata dataset. The experimental results
demonstrate promising findings, which can be used in future studies.
","[{'version': 'v1', 'created': 'Tue, 7 Jul 2020 08:40:08 GMT'}]",2020-07-08,"[['Bhat', 'Mohammad Idrees', ''], ['Sharada', 'B.', '']]","['Writing styles', 'unconstrained cursiveness', 'primitive relationships', 'feature representation', 'graph representation', 'spectral graph embedding']"
6869,2210.03908,Savithramma R M,"Savithramma R M, R Sumathi, Sudhira H S",Variability Analysis of Isolated Intersections Through Case Study,,,10.14445/22315381/IJETT-V70I8P237,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Population and economic growth of urban areas have led to intensive use of
private vehicles, thereby increasing traffic volume and congestion on roads.
The traffic management in the city is a challenge for concerned authorities,
and the signalized intersections are the primary interest of traffic
management. Interpreting traffic patterns and current traffic signal operations
can provide thorough insights to take appropriate actions. In this view, a
comprehensive study is conducted at selected intersections from Tumakuru
(tier-2 city), Karnataka, India. Data estimates traffic parameters such as
saturation flow, composition, volume, and volume-to-capacity ratio. The
statistical results currently confirm the stable traffic condition but do not
ensure sustainability. The volume-to-capacity ratio is greater than 0.73 along
three major arterial roads of study intersections, indicating congestion in the
future as the traffic volume is increasing gradually, as per the Directorate of
Urban Land Use and Transportation, Government of Karnataka. The statistical
results obtained through the current study uphold the report. The empirical
results showed 40% of green time wastage at one of the study intersections,
which results in additional waiting delays, thereby increasing fuel consumption
and emissions. The overall service level of the study intersections is of class
C based on computed delay and volume-to-capacity ratio. The study suggests
possible treatments for improving the service level at the intersection
operations and sustaining the city's stable traffic condition. The study
supports city traffic management authorities in identifying suitable treatment
and implementing accordingly.
","[{'version': 'v1', 'created': 'Sat, 8 Oct 2022 04:13:35 GMT'}]",2022-10-14,"[['M', 'Savithramma R', ''], ['Sumathi', 'R', ''], ['S', 'Sudhira H', '']]","['Heterogeneous traffic', 'Signalized intersections', 'Smart city', 'Traffic composition', 'Variability analysis']"
6870,2005.06953,Amir Javadpour,Amir Javadpour,"Providing a way to create balance between reliability and delays in SDN
  networks by using the appropriate placement of controllers",,,10.1007/s11277-019-06773-5,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer networks covered the entire world and a serious and new development
has not formed for many years. But companies and consumer organizations
complain about the failure to add new features to their networks and according
to their need, like much of the works to be done automatically and they also
like to develop and expand their networks on the software side so they do not
need new expensive hardware for many of the activities and needs of their
network. Analysis of the control layers and writing data in Software-Defined
Network facilitate network management and accelerate innovation in network. In
order to develop broad networks of SDN, often a large number controller is
needed and located position of controllers in the SDN networks and can be
raised as an important and basic issue in the field of SDN network and have
impact on reliability of SDN networks. This paper focused on latency and
reliability in SDN networks. The latency here means the delay in response to
the request of data path that has a significant impact on network latency. In
this paper it is shown that the number of controllers and their position can be
effective on two measures; reliability and latency in SDN networks.
","[{'version': 'v1', 'created': 'Fri, 24 Apr 2020 19:52:12 GMT'}]",2020-05-15,"[['Javadpour', 'Amir', '']]","['Open Flow protocol', 'Software-based networks', 'controller', 'reliability']"
6871,1410.4304,EPTCS,"Chris Chapman (Royal Military College of Canada, Electrical and
  Computer Engineering Department, Kingston, Canada), Scott Knight (Royal
  Military College of Canada, Electrical and Computer Engineering Department,
  Kingston, Canada), Tom Dean (Queen's University, Electrical and Computer
  Engineering Department, Kingston, Canada)",USBcat - Towards an Intrusion Surveillance Toolset,"In Proceedings AIDP 2014, arXiv:1410.3226","EPTCS 165, 2014, pp. 31-43",10.4204/EPTCS.165.3,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper identifies an intrusion surveillance framework which provides an
analyst with the ability to investigate and monitor cyber-attacks in a covert
manner. Where cyber-attacks are perpetrated for the purposes of espionage the
ability to understand an adversary's techniques and objectives are an important
element in network and computer security. With the appropriate toolset,
security investigators would be permitted to perform both live and stealthy
counter-intelligence operations by observing the behaviour and communications
of the intruder. Subsequently a more complete picture of the attacker's
identity, objectives, capabilities, and infiltration could be formulated than
is possible with present technologies. This research focused on developing an
extensible framework to permit the covert investigation of malware.
Additionally, a Universal Serial Bus (USB) Mass Storage Device (MSD) based
covert channel was designed to enable remote command and control of the
framework. The work was validated through the design, implementation and
testing of a toolset.
","[{'version': 'v1', 'created': 'Thu, 16 Oct 2014 05:53:54 GMT'}]",2014-10-17,"[['Chapman', 'Chris', '', 'Royal Military College of Canada, Electrical and\n  Computer Engineering Department, Kingston, Canada'], ['Knight', 'Scott', '', 'Royal\n  Military College of Canada, Electrical and Computer Engineering Department,\n  Kingston, Canada'], ['Dean', 'Tom', '', ""Queen's University, Electrical and Computer\n  Engineering Department, Kingston, Canada""]]","['Computer Security', 'Counter-Intelligence Surveillance Framework', 'USB MSD CovertChannel', 'Malware Analysis']"
6872,2207.07795,Daqian Shi,"Daqian Shi, Xiaolei Diao, Hao Tang, Xiaomin Li, Hao Xing, Hao Xu","RCRN: Real-world Character Image Restoration Network via Skeleton
  Extraction",Accepted to ACM MM 2022,,10.1145/3503161.3548344,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Constructing high-quality character image datasets is challenging because
real-world images are often affected by image degradation. There are
limitations when applying current image restoration methods to such real-world
character images, since (i) the categories of noise in character images are
different from those in general images; (ii) real-world character images
usually contain more complex image degradation, e.g., mixed noise at different
noise levels. To address these problems, we propose a real-world character
restoration network (RCRN) to effectively restore degraded character images,
where character skeleton information and scale-ensemble feature extraction are
utilized to obtain better restoration performance. The proposed method consists
of a skeleton extractor (SENet) and a character image restorer (CiRNet). SENet
aims to preserve the structural consistency of the character and normalize
complex noise. Then, CiRNet reconstructs clean images from degraded character
images and their skeletons. Due to the lack of benchmarks for real-world
character image restoration, we constructed a dataset containing 1,606
character images with real-world degradation to evaluate the validity of the
proposed method. The experimental results demonstrate that RCRN outperforms
state-of-the-art methods quantitatively and qualitatively.
","[{'version': 'v1', 'created': 'Sat, 16 Jul 2022 01:02:52 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Jul 2022 17:52:13 GMT'}]",2022-07-20,"[['Shi', 'Daqian', ''], ['Diao', 'Xiaolei', ''], ['Tang', 'Hao', ''], ['Li', 'Xiaomin', ''], ['Xing', 'Hao', ''], ['Xu', 'Hao', '']]","['Character Image Restoration', 'Skeleton Extraction', 'Generative Adversarial Networks', 'Low-Level Computer Vision', 'Image Denoising']"
6873,2006.05255,\'Angel Gonz\'alez-Prieto,"Jes\'us Bobadilla, Ra\'ul Lara-Cabrera, \'Angel Gonz\'alez-Prieto,
  Fernando Ortega",DeepFair: Deep Learning for Improving Fairness in Recommender Systems,"18 pages, 9 figures, 4 tables","International Journal of Interactive Multimedia and Artificial
  Intelligence, 2020",10.9781/ijimai.2020.11.001,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The lack of bias management in Recommender Systems leads to minority groups
receiving unfair recommendations. Moreover, the trade-off between equity and
precision makes it difficult to obtain recommendations that meet both criteria.
Here we propose a Deep Learning based Collaborative Filtering algorithm that
provides recommendations with an optimum balance between fairness and accuracy
without knowing demographic information about the users. Experimental results
show that it is possible to make fair recommendations without losing a
significant proportion of accuracy.
","[{'version': 'v1', 'created': 'Tue, 9 Jun 2020 13:39:38 GMT'}]",2020-12-22,"[['Bobadilla', 'Jesús', ''], ['Lara-Cabrera', 'Raúl', ''], ['González-Prieto', 'Ángel', ''], ['Ortega', 'Fernando', '']]","['Recommender Systems', 'Collaborative Filtering', 'Deep Learning', 'Fairness', 'Social Equality']"
6874,2005.06915,Damiano Spina,"Kevin Roitero, Michael Soprano, Shaoyang Fan, Damiano Spina, Stefano
  Mizzaro, and Gianluca Demartini","Can The Crowd Identify Misinformation Objectively? The Effects of
  Judgment Scale and Assessor's Background",Preprint of the full paper accepted at SIGIR 2020,,10.1145/3397271.3401112,,cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Truthfulness judgments are a fundamental step in the process of fighting
misinformation, as they are crucial to train and evaluate classifiers that
automatically distinguish true and false statements. Usually such judgments are
made by experts, like journalists for political statements or medical doctors
for medical statements. In this paper, we follow a different approach and rely
on (non-expert) crowd workers. This of course leads to the following research
question: Can crowdsourcing be reliably used to assess the truthfulness of
information and to create large-scale labeled collections for information
credibility systems? To address this issue, we present the results of an
extensive study based on crowdsourcing: we collect thousands of truthfulness
assessments over two datasets, and we compare expert judgments with crowd
judgments, expressed on scales with various granularity levels. We also measure
the political bias and the cognitive background of the workers, and quantify
their effect on the reliability of the data provided by the crowd.
","[{'version': 'v1', 'created': 'Thu, 14 May 2020 12:37:48 GMT'}, {'version': 'v2', 'created': 'Tue, 26 May 2020 09:11:47 GMT'}, {'version': 'v3', 'created': 'Thu, 25 Jun 2020 01:54:21 GMT'}]",2020-06-26,"[['Roitero', 'Kevin', ''], ['Soprano', 'Michael', ''], ['Fan', 'Shaoyang', ''], ['Spina', 'Damiano', ''], ['Mizzaro', 'Stefano', ''], ['Demartini', 'Gianluca', '']]","['Crowdsourcing', 'Information Credibility', 'Classification']"
6875,1911.03776,Sadik Bessou,"Sadik Bessou, Rania Aberkane",Subjective Sentiment Analysis for Arabic Newswire Comments,"7 pages, 7 tables, article in journal",Journal of Digital Information Management ISSN 0972-7272 2019,10.6025/jdim/2019/17/5/289-295,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an approach based on supervised machine learning methods
to discriminate between positive, negative and neutral Arabic reviews in online
newswire. The corpus is labeled for subjectivity and sentiment analysis (SSA)
at the sentence-level. The model uses both count and TF-IDF representations and
apply six machine learning algorithms; Multinomial Naive Bayes, Support Vector
Machines (SVM), Random Forest, Logistic Regression, Multi-layer perceptron and
k-nearest neighbors using uni-grams, bi-grams features. With the goal of
extracting users sentiment from written text. Experimental results showed that
n-gram features could substantially improve performance; and showed that the
Multinomial Naive Bayes approach is the most accurate in predicting topic
polarity. Best results were achieved using count vectors trained by combination
of word-based uni-grams and bi-grams with an overall accuracy of 85.57% over
two classes and 65.64% over three classes.
","[{'version': 'v1', 'created': 'Sat, 9 Nov 2019 20:59:40 GMT'}]",2019-11-12,"[['Bessou', 'Sadik', ''], ['Aberkane', 'Rania', '']]","['Arabic Sentiment Analysis', 'Opinion Mining', 'NaturalLanguage Processing', 'Machine Learning', 'Social Media']"
6876,1809.04365,Ali Abrishami,"Ali Abrishami, Sadegh Aliakbary","Predicting citation counts based on deep neural network learning
  techniques",,"Journal of Informetrics Volume 13, Issue 2, May 2019, Pages
  485-499",10.1016/j.joi.2019.02.011,,cs.DL cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the growing number of published scientific papers world-wide, the need
to evaluation and quality assessment methods for research papers is increasing.
Scientific fields such as scientometrics, informetrics and bibliometrics
establish quantified analysis methods and measurements for scientific papers.
In this area, an important problem is to predict the future influence of a
published paper. Particularly, early discrimination between influential papers
and insignificant papers may find important applications. In this regard, one
of the most important metrics is the number of citations to the paper, since
this metric is widely utilized in the evaluation of scientific publications and
moreover, it serves as the basis for many other metrics such as h-index. In
this paper, we propose a novel method for predicting long-term citations of a
paper based on the number of its citations in the first few years after
publication. In order to train a citations prediction model, we employed
artificial neural networks which is a powerful machine learning tool with
recently growing applications in many domains including image and text
processing. The empirical experiments show that our proposed method
out-performs state-of-the-art methods with respect to the prediction accuracy
in both yearly and total prediction of the number of citations.
","[{'version': 'v1', 'created': 'Wed, 12 Sep 2018 11:41:05 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Oct 2018 07:56:22 GMT'}, {'version': 'v3', 'created': 'Sat, 16 Mar 2019 09:14:06 GMT'}]",2019-03-19,"[['Abrishami', 'Ali', ''], ['Aliakbary', 'Sadegh', '']]","['Informetrics', 'Citation count prediction', 'Neural networks', 'Deep learning', 'Scientific impact', 'Time series prediction']"
6877,2008.04008,Rafael Kiesel,Thomas Eiter and Rafael Kiesel,ASP(AC): Answer Set Programming with Algebraic Constraints,"32 pages, 16 pages are appendix",,10.1017/S1471068420000393,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Weighted Logic is a powerful tool for the specification of calculations over
semirings that depend on qualitative information. Using a novel combination of
Weighted Logic and Here-and-There (HT) Logic, in which this dependence is based
on intuitionistic grounds, we introduce Answer Set Programming with Algebraic
Constraints (ASP(AC)), where rules may contain constraints that compare
semiring values to weighted formula evaluations. Such constraints provide
streamlined access to a manifold of constructs available in ASP, like
aggregates, choice constraints, and arithmetic operators. They extend some of
them and provide a generic framework for defining programs with algebraic
computation, which can be fruitfully used e.g. for provenance semantics of
datalog programs. While undecidable in general, expressive fragments of ASP(AC)
can be exploited for effective problem-solving in a rich framework. This work
is under consideration for acceptance in Theory and Practice of Logic
Programming.
","[{'version': 'v1', 'created': 'Mon, 10 Aug 2020 10:20:49 GMT'}]",2022-11-14,"[['Eiter', 'Thomas', ''], ['Kiesel', 'Rafael', '']]","['Weighted Logic', 'Here-and-There Logic', 'Answer Set Programming', 'Constraints']"
6878,2104.09190,Bilal Abu-Salih,"Bilal Abu-Salih, Pornpit Wongthongtham, Dengya Zhu, Kit Yan Chan, Amit
  Rudra",Credibility Analysis in Social Big Data,,,10.1007/978-981-33-6652-7_3,,cs.SI,http://creativecommons.org/publicdomain/zero/1.0/,"  The concept of social trust has attracted an attention of information
processors/data scientists and information consumers / business firms. One of
the main reasons for acquiring the value of SBD is to provide frameworks and
methodologies using which the credibility of online social services users can
be evaluated. These approaches should be scalable to accommodate large-scale
social data. Hence, there is a need for well comprehending of social trust to
improve and expand the analysis process and inferring credibility of social big
data. Given the exposed environment's settings and fewer limitations related to
online social services, the medium allows legitimate and genuine users as well
as spammers and other low trustworthy users to publish and spread their
content. This chapter presents an overview of the notion of credibility in the
context of SBD. It also list an array of approaches to measure and evaluate the
trustworthiness of users and their contents. Finally, a case study is presented
that incorporates semantic analysis and machine learning modules to measure and
predict users' trustworthiness in numerous domains in different time periods.
The evaluation of the conducted experiment validates the applicability of the
incorporated machine learning techniques to predict highly trustworthy
domain-based users.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2021 10:32:54 GMT'}]",2021-04-20,"[['Abu-Salih', 'Bilal', ''], ['Wongthongtham', 'Pornpit', ''], ['Zhu', 'Dengya', ''], ['Chan', 'Kit Yan', ''], ['Rudra', 'Amit', '']]","['Social Credibility', 'Social Spam', 'Social Influence', 'Semantic Analysis', 'Information Retrieval']"
6879,2104.13424,Nemanja Rakicevic,"Nemanja Rakicevic, Antoine Cully, Petar Kormushev","Policy Manifold Search: Exploring the Manifold Hypothesis for
  Diversity-based Neuroevolution","Accepted as a full paper at Genetic and Evolutionary Computation
  Conference, GECCO 2021. arXiv admin note: substantial text overlap with
  arXiv:2012.08676",,10.1145/3449639.3459320,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neuroevolution is an alternative to gradient-based optimisation that has the
potential to avoid local minima and allows parallelisation. The main limiting
factor is that usually it does not scale well with parameter space
dimensionality. Inspired by recent work examining neural network intrinsic
dimension and loss landscapes, we hypothesise that there exists a
low-dimensional manifold, embedded in the policy network parameter space,
around which a high-density of diverse and useful policies are located. This
paper proposes a novel method for diversity-based policy search via
Neuroevolution, that leverages learned representations of the policy network
parameters, by performing policy search in this learned representation space.
Our method relies on the Quality-Diversity (QD) framework which provides a
principled approach to policy search, and maintains a collection of diverse
policies, used as a dataset for learning policy representations. Further, we
use the Jacobian of the inverse-mapping function to guide the search in the
representation space. This ensures that the generated samples remain in the
high-density regions, after mapping back to the original space. Finally, we
evaluate our contributions on four continuous-control tasks in simulated
environments, and compare to diversity-based baselines.
","[{'version': 'v1', 'created': 'Tue, 27 Apr 2021 18:52:03 GMT'}]",2021-04-29,"[['Rakicevic', 'Nemanja', ''], ['Cully', 'Antoine', ''], ['Kormushev', 'Petar', '']]","['Neuroevolution', 'Manifold Learning', 'Quality-Diversity', 'MAP-Elites']"
6880,2210.13705,Chien Thai,Chien Thai and Viet Tran and Minh Bui and Huong Ninh and Hai Tran,An Effective Deep Network for Head Pose Estimation without Keypoints,,"In Proceedings of the 11th International Conference on Pattern
  Recognition Applications and Methods - ICPRAM 2022, ISBN 978-989-758-549-4;
  ISSN 2184-4313, pages 90-98",10.5220/0010870900003122,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Human head pose estimation is an essential problem in facial analysis in
recent years that has a lot of computer vision applications such as gaze
estimation, virtual reality, and driver assistance. Because of the importance
of the head pose estimation problem, it is necessary to design a compact model
to resolve this task in order to reduce the computational cost when deploying
on facial analysis-based applications such as large camera surveillance
systems, AI cameras while maintaining accuracy. In this work, we propose a
lightweight model that effectively addresses the head pose estimation problem.
Our approach has two main steps. 1) We first train many teacher models on the
synthesis dataset - 300W-LPA to get the head pose pseudo labels. 2) We design
an architecture with the ResNet18 backbone and train our proposed model with
the ensemble of these pseudo labels via the knowledge distillation process. To
evaluate the effectiveness of our model, we use AFLW-2000 and BIWI - two
real-world head pose datasets. Experimental results show that our proposed
model significantly improves the accuracy in comparison with the
state-of-the-art head pose estimation methods. Furthermore, our model has the
real-time speed of $\sim$300 FPS when inferring on Tesla V100.
","[{'version': 'v1', 'created': 'Tue, 25 Oct 2022 01:57:04 GMT'}]",2022-10-26,"[['Thai', 'Chien', ''], ['Tran', 'Viet', ''], ['Bui', 'Minh', ''], ['Ninh', 'Huong', ''], ['Tran', 'Hai', '']]","['head pose estimation', 'knowledge distillation', 'convolutional neural network']"
6881,2209.02005,Annamaria Ficara,"Annamaria Ficara, Giacomo Fiumara, Pasquale De Meo and Salvatore
  Catanese","Classical and Quantum Random Walks to Identify Leaders in Criminal
  Networks","This paper will be included in the COMPLEX NETWORKS 2022 conference
  proceedings to be published by Springer Verlag","Complex Networks and Their Applications XI. COMPLEX NETWORKS 2016
  2022. Studies in Computational Intelligence, vol 1077. Springer, Cham",10.1007/978-3-031-21127-0_16,,cs.SI physics.soc-ph,http://creativecommons.org/licenses/by-sa/4.0/,"  Random walks simulate the randomness of objects, and are key instruments in
various fields such as computer science, biology and physics. The counter part
of classical random walks in quantum mechanics are the quantum walks. Quantum
walk algorithms provide an exponential speedup over classical algorithms.
Classical and quantum random walks can be applied in social network analysis,
and can be used to define specific centrality metrics in terms of node
occupation on single-layer and multilayer networks. In this paper, we applied
these new centrality measures to three real criminal networks derived from an
anti-mafia operation named Montagna and a multilayer network derived from them.
Our aim is to (i) identify leaders in our criminal networks, (ii) study the
dependence between these centralities and the degree, (iii) compare the results
obtained for the real multilayer criminal network with those of a synthetic
multilayer network which replicates its structure.
","[{'version': 'v1', 'created': 'Mon, 5 Sep 2022 15:11:34 GMT'}]",2023-01-09,"[['Ficara', 'Annamaria', ''], ['Fiumara', 'Giacomo', ''], ['De Meo', 'Pasquale', ''], ['Catanese', 'Salvatore', '']]","['Classical random walks', 'quantum random walks', 'centrality', 'criminal networks']"
6882,2111.15208,Kinshuk Sengupta Dr,Kinshuk Sengupta and Praveen Ranjan Srivastava,HRNET: AI on Edge for mask detection and social distancing,,"SN Computer Science, 2022",10.1007/s42979-022-01023-1,"Volume 3, Issue 2, March 2022",cs.CV cs.AI,http://creativecommons.org/licenses/by/4.0/,"  The purpose of the paper is to provide innovative emerging technology
framework for community to combat epidemic situations. The paper proposes a
unique outbreak response system framework based on artificial intelligence and
edge computing for citizen centric services to help track and trace people
eluding safety policies like mask detection and social distancing measure in
public or workplace setup. The framework further provides implementation
guideline in industrial setup as well for governance and contact tracing tasks.
The adoption will thus lead in smart city planning and development focusing on
citizen health systems contributing to improved quality of life. The conceptual
framework presented is validated through quantitative data analysis via
secondary data collection from researcher's public websites, GitHub
repositories and renowned journals and further benchmarking were conducted for
experimental results in Microsoft Azure cloud environment. The study includes
selective AI-models for benchmark analysis and were assessed on performance and
accuracy in edge computing environment for large scale societal setup. Overall
YOLO model Outperforms in object detection task and is faster enough for mask
detection and HRNetV2 outperform semantic segmentation problem applied to solve
social distancing task in AI-Edge inferencing environmental setup. The paper
proposes new Edge-AI algorithm for building technology-oriented solutions for
detecting mask in human movement and social distance. The paper enriches the
technological advancement in artificial intelligence and edge-computing applied
to problems in society and healthcare systems. The framework further equips
government agency, system providers to design and constructs
technology-oriented models in community setup to Increase the quality of life
using emerging technologies into smart urban environments.
","[{'version': 'v1', 'created': 'Tue, 30 Nov 2021 08:39:41 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Feb 2022 12:03:52 GMT'}]",2022-02-04,"[['Sengupta', 'Kinshuk', ''], ['Srivastava', 'Praveen Ranjan', '']]","['deep learning', 'edge-computing', 'social and industrial safety']"
6883,1908.11262,Dogancan Temel,Dogancan Temel and Min-Hung Chen and Ghassan AlRegib,"Traffic Sign Detection under Challenging Conditions: A Deeper Look Into
  Performance Variations and Spectral Characteristics","13 pages, 9 figures, 4 tables. IEEE Transactions on Intelligent
  Transportation Systems, 2019",,10.1109/TITS.2019.2931429,,cs.CV cs.LG eess.IV eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traffic signs are critical for maintaining the safety and efficiency of our
roads. Therefore, we need to carefully assess the capabilities and limitations
of automated traffic sign detection systems. Existing traffic sign datasets are
limited in terms of type and severity of challenging conditions. Metadata
corresponding to these conditions are unavailable and it is not possible to
investigate the effect of a single factor because of simultaneous changes in
numerous conditions. To overcome the shortcomings in existing datasets, we
introduced the CURE-TSD-Real dataset, which is based on simulated challenging
conditions that correspond to adversaries that can occur in real-world
environments and systems. We test the performance of two benchmark algorithms
and show that severe conditions can result in an average performance
degradation of 29% in precision and 68% in recall. We investigate the effect of
challenging conditions through spectral analysis and show that challenging
conditions can lead to distinct magnitude spectrum characteristics. Moreover,
we show that mean magnitude spectrum of changes in video sequences under
challenging conditions can be an indicator of detection performance.
CURE-TSD-Real dataset is available online at
https://github.com/olivesgatech/CURE-TSD.
","[{'version': 'v1', 'created': 'Thu, 29 Aug 2019 14:37:40 GMT'}]",2019-08-30,"[['Temel', 'Dogancan', ''], ['Chen', 'Min-Hung', ''], ['AlRegib', 'Ghassan', '']]","['Autonomous vehicles', 'traffic sign detection andrecognition', 'challenging conditions dataset', 'magnitude spectrum', 'machine learning']"
6884,2208.03541,Pino Caballero-Gil,"V Mora-Afonso, Pino Caballero-Gil, Jezabel Molina-Gil",Strong authentication on smart wireless devices,,"Second International Conference on Future Generation Communication
  Technologies (FGCT 2013), pp. 137-142,",10.1109/FGCT.2013.6767206,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The rapid deployment of wireless technologies has given rise to the current
situation where mobile phones and other wireless devices have become essential
elements in all types of activities, including in the home. In particular,
smartphones and laptops are used for wirelessly sharing photos and documents,
playing games, browsing websites, and viewing multimedia, for example. This
work describes a proposal for both desktop and mobile applications that use
Identity-Based Cryptography (IBC) to protect communications between smart
wireless devices in the home. It combines the use of IBC for Wi-Fi and
Bluetooth communication, with the promising Near Field Communication (NFC)
technology for secure authentication. The proposed scheme involves NFC pairing
to establish as public key a piece of information linked to the device, such as
a phone number or an IP address. In this way, such information can be then used
in an IBC scheme for peer-to-peer communication. This is a work in progress,
but preliminary implementations of prototypes on several mobile platforms have
already produced promising results.
","[{'version': 'v1', 'created': 'Sat, 6 Aug 2022 16:42:39 GMT'}]",2022-08-09,"[['Mora-Afonso', 'V', ''], ['Caballero-Gil', 'Pino', ''], ['Molina-Gil', 'Jezabel', '']]","['Identity-Based Cryptography', 'Mobile Application', 'Near Field Communication']"
6885,1909.11197,Tanwi Mallick,"Tanwi Mallick, Prasanna Balaprakash, Eric Rask, and Jane Macfarlane","Graph-Partitioning-Based Diffusion Convolutional Recurrent Neural
  Network for Large-Scale Traffic Forecasting",,Transportation Research Record (2020),10.1177/0361198120930010,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traffic forecasting approaches are critical to developing adaptive strategies
for mobility. Traffic patterns have complex spatial and temporal dependencies
that make accurate forecasting on large highway networks a challenging task.
Recently, diffusion convolutional recurrent neural networks (DCRNNs) have
achieved state-of-the-art results in traffic forecasting by capturing the
spatiotemporal dynamics of the traffic. Despite the promising results, however,
applying DCRNNs for large highway networks still remains elusive because of
computational and memory bottlenecks. We present an approach for implementing a
DCRNN for a large highway network that overcomes these limitations. Our
approach uses a graph-partitioning method to decompose a large highway network
into smaller networks and trains them independently. We demonstrate the
efficacy of the graph-partitioning-based DCRNN approach to model the traffic on
a large California highway network with 11,160 sensor locations. We develop an
overlapping nodes approach for the graph-partitioning-based DCRNN to include
sensor locations from partitions that are geographically close to a given
partition. Furthermore, we demonstrate that the DCRNN model can be used to
forecast the speed and flow simultaneously and that the forecasted values
preserve fundamental traffic flow dynamics. Our approach to developing DCRNN
models that represent large highway networks can be a potential core capability
in advanced highway traffic monitoring systems, where a trained DCRNN model
forecasting traffic at all sensor locations can be used to adjust traffic
management strategies proactively based on anticipated future conditions.
","[{'version': 'v1', 'created': 'Tue, 24 Sep 2019 21:38:29 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Oct 2019 14:51:19 GMT'}, {'version': 'v3', 'created': 'Mon, 13 Apr 2020 14:55:15 GMT'}, {'version': 'v4', 'created': 'Mon, 20 Apr 2020 13:15:34 GMT'}]",2020-07-23,"[['Mallick', 'Tanwi', ''], ['Balaprakash', 'Prasanna', ''], ['Rask', 'Eric', ''], ['Macfarlane', 'Jane', '']]","['Deep learning', 'Graph neural networks', 'Diffusion', 'Traffic forecasting', 'Graph partitioning']"
6886,2011.14841,Baldomero Coll-Perales,"Baldomero Coll-Perales, Gokulnath Thandavarayan, Miguel Sepulcre and
  Javier Gozalvez","Context-based Broadcast Acknowledgement for Enhanced Reliability of
  Cooperative V2X Messages","2020 IEEE Forum on Integrated and Sustainable Transportation Systems
  (ISTS). 6 pages, 6 figures",,10.1109/FISTS46898.2020.9264879,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most V2X applications/services are supported by the continuous exchange of
broadcast messages. One of the main challenges is to increase the reliability
of broadcast transmissions that lack of mechanisms to assure the correct
delivery of the messages. To address this issue, one option is the use of
acknowledgments. However, this option has scalability issues when applied to
broadcast transmissions because multiple vehicles can transmit acknowledgments
simultaneously. To control scalability while addressing reliability of
broadcast messages, this paper proposes and evaluates a context-based broadcast
acknowledgement mechanism where the transmitting vehicles selectively request
the acknowledgment of specific/critical broadcast messages, and performs
retransmissions if they are not correctly received. In addition, the V2X
applications/services identify the situations/conditions that trigger the
execution of the broadcast acknowledgment mechanism, and the receiver(s) that
should acknowledge the broadcast messages. The paper evaluates the performance
of the context-based broadcast acknowledgment mechanism for a Collective
Perception Service. The obtained results show the proposed mechanism can
contribute to improve the awareness of crossing pedestrians at intersections by
increasing the reliability in the exchange of CPM messages between vehicles
approaching the intersection. This solution is being discussed under IEEE
802.11bd, and thus can be relevant for the standardization process.
","[{'version': 'v1', 'created': 'Wed, 4 Nov 2020 23:09:43 GMT'}]",2020-12-02,"[['Coll-Perales', 'Baldomero', ''], ['Thandavarayan', 'Gokulnath', ''], ['Sepulcre', 'Miguel', ''], ['Gozalvez', 'Javier', '']]","['acknowledgement', 'ACK', 'broadcast', 'collective']"
6887,2208.12981,Sangho Suh,"Sangho Suh, Jian Zhao, and Edith Law","CodeToon: Story Ideation, Auto Comic Generation, and Structure Mapping
  for Code-Driven Storytelling",,,10.1145/3526113.3545617,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent work demonstrated how we can design and use coding strips, a form of
comic strips with corresponding code, to enhance teaching and learning in
programming. However, creating coding strips is a creative, time-consuming
process. Creators have to generate stories from code (code->story) and design
comics from stories (story->comic). We contribute CodeToon, a comic authoring
tool that facilitates this code-driven storytelling process with two
mechanisms: (1) story ideation from code using metaphor and (2) automatic comic
generation from the story. We conducted a two-part user study that evaluates
the tool and the comics generated by participants to test whether CodeToon
facilitates the authoring process and helps generate quality comics. Our
results show that CodeToon helps users create accurate, informative, and useful
coding strips in a significantly shorter time. Overall, this work contributes
methods and design guidelines for code-driven storytelling and opens up
opportunities for using art to support computer science education.
","[{'version': 'v1', 'created': 'Sat, 27 Aug 2022 10:34:54 GMT'}]",2022-08-30,"[['Suh', 'Sangho', ''], ['Zhao', 'Jian', ''], ['Law', 'Edith', '']]","['code-driven storytelling', 'comics', 'coding strip', 'authoring tool']"
6888,1402.6421,Nicolas Moro,"Nicolas Moro (LIP6, SAS-ENSMSE, LETI), Amine Dehbaoui (SAS-ENSMSE),
  Karine Heydemann (LIP6), Bruno Robisson (SAS-ENSMSE, LETI), Emmanuelle
  Encrenaz (LIP6)","Electromagnetic fault injection: towards a fault model on a 32-bit
  microcontroller",10 pages,"10th workshop on Fault Diagnosis and Tolerance in Cryptography -
  FDTC 2013, Santa-Barbara : United States (2013)",10.1109/FDTC.2013.9,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Injection of transient faults as a way to attack cryptographic
implementations has been largely studied in the last decade. Several attacks
that use electromagnetic fault injection against hardware or software
architectures have already been presented. On microcontrollers, electromagnetic
fault injection has mostly been seen as a way to skip assembly instructions or
subroutine calls. However, to the best of our knowledge, no precise study about
the impact of an electromagnetic glitch fault injection on a microcontroller
has been proposed yet. The aim of this paper is twofold: providing a more
in-depth study of the effects of electromagnetic glitch fault injection on a
state-of-the-art microcontroller and building an associated register-transfer
level fault model.
","[{'version': 'v1', 'created': 'Wed, 26 Feb 2014 05:56:59 GMT'}]",2014-02-27,"[['Moro', 'Nicolas', '', 'LIP6, SAS-ENSMSE, LETI'], ['Dehbaoui', 'Amine', '', 'SAS-ENSMSE'], ['Heydemann', 'Karine', '', 'LIP6'], ['Robisson', 'Bruno', '', 'SAS-ENSMSE, LETI'], ['Encrenaz', 'Emmanuelle', '', 'LIP6']]","['microcontroller', 'timingfault', 'electromagneticglitch', 'fault attack', 'fault model']"
6889,2104.02973,Pierre Gutierrez,"Antoine Cordier, Deepan Das, and Pierre Gutierrez",Active learning using weakly supervised signals for quality inspection,"8 pages, 3 Figures, QCAV 2021 conference (proceedings published in
  SPIE)",,10.1117/12.2586595,,cs.CV cs.AI cs.LO stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Because manufacturing processes evolve fast, and since production visual
aspect can vary significantly on a daily basis, the ability to rapidly update
machine vision based inspection systems is paramount. Unfortunately, supervised
learning of convolutional neural networks requires a significant amount of
annotated images for being able to learn effectively from new data.
Acknowledging the abundance of continuously generated images coming from the
production line and the cost of their annotation, we demonstrate it is possible
to prioritize and accelerate the annotation process. In this work, we develop a
methodology for learning actively, from rapidly mined, weakly (i.e. partially)
annotated data, enabling a fast, direct feedback from the operators on the
production line and tackling a big machine vision weakness: false positives. We
also consider the problem of covariate shift, which arises inevitably due to
changing conditions during data acquisition. In that regard, we show
domain-adversarial training to be an efficient way to address this issue.
","[{'version': 'v1', 'created': 'Wed, 7 Apr 2021 07:49:07 GMT'}]",2021-07-23,"[['Cordier', 'Antoine', ''], ['Das', 'Deepan', ''], ['Gutierrez', 'Pierre', '']]","['visual inspection', 'deep learning', 'active learning', 'weakly supervised learning', 'domain adaptation']"
6890,1905.07894,Noe Cecillon,"No\'e Cecillon (LIA), Vincent Labatut (LIA), Richard Dufour (LIA),
  Georges Linar\`es (LIA)","Abusive Language Detection in Online Conversations by Combining
  Content-and Graph-based Features",,"ICWSM International Workshop on Modeling and mining
  Social-Media-driven Complex Networks (Soc2Net) 2019",10.3389/fdata.2019.00008,,cs.IR cs.CL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, online social networks have allowed worldwide users to meet
and discuss. As guarantors of these communities, the administrators of these
platforms must prevent users from adopting inappropriate behaviors. This
verification task, mainly done by humans, is more and more difficult due to the
ever growing amount of messages to check. Methods have been proposed to
automatize this moderation process, mainly by providing approaches based on the
textual content of the exchanged messages. Recent work has also shown that
characteristics derived from the structure of conversations, in the form of
conversational graphs, can help detecting these abusive messages. In this
paper, we propose to take advantage of both sources of information by proposing
fusion methods integrating content-and graph-based features. Our experiments on
raw chat logs show that the content of the messages, but also of their dynamics
within a conversation contain partially complementary information, allowing
performance improvements on an abusive message classification task with a final
F-measure of 93.26%.
","[{'version': 'v1', 'created': 'Mon, 20 May 2019 06:15:07 GMT'}]",2019-06-17,"[['Cecillon', 'Noé', '', 'LIA'], ['Labatut', 'Vincent', '', 'LIA'], ['Dufour', 'Richard', '', 'LIA'], ['Linarès', 'Georges', '', 'LIA']]","['Automatic abuse detection', 'Content analysis', 'Conversational graph', 'Online conversations', 'Social networks']"
6891,1911.01770,Matthias Fontanellaz,"Matthias Fontanellaz and Stergios Christodoulidis and Stavroula
  Mougiakakou","Self-Attention and Ingredient-Attention Based Model for Recipe Retrieval
  from Image Queries","MADiMa 2019,5th International Workshop on Multimedia Assisted Dietary
  Management",,10.1145/3347448.3357163,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Direct computer vision based-nutrient content estimation is a demanding task,
due to deformation and occlusions of ingredients, as well as high intra-class
and low inter-class variability between meal classes. In order to tackle these
issues, we propose a system for recipe retrieval from images. The recipe
information can subsequently be used to estimate the nutrient content of the
meal. In this study, we utilize the multi-modal Recipe1M dataset, which
contains over 1 million recipes accompanied by over 13 million images. The
proposed model can operate as a first step in an automatic pipeline for the
estimation of nutrition content by supporting hints related to ingredient and
instruction. Through self-attention, our model can directly process raw recipe
text, making the upstream instruction sentence embedding process redundant and
thus reducing training time, while providing desirable retrieval results.
Furthermore, we propose the use of an ingredient attention mechanism, in order
to gain insight into which instructions, parts of instructions or single
instruction words are of importance for processing a single ingredient within a
certain recipe. Attention-based recipe text encoding contributes to solving the
issue of high intra-class/low inter-class variability by focusing on
preparation steps specific to the meal. The experimental results demonstrate
the potential of such a system for recipe retrieval from images. A comparison
with respect to two baseline methods is also presented.
","[{'version': 'v1', 'created': 'Tue, 5 Nov 2019 13:42:30 GMT'}]",2019-11-06,"[['Fontanellaz', 'Matthias', ''], ['Christodoulidis', 'Stergios', ''], ['Mougiakakou', 'Stavroula', '']]","['Neural Networks', 'Deep Learning', 'Cross-modal Retrieval', 'NaturalLanguage Processing', 'Self-attention']"
6892,1710.07491,Pawel Trajdos,"Pawel Trajdos, Marek Kurzynski",Dynamic classifier chains for multi-label learning,,,10.1007/978-3-030-33676-9_40,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we deal with the task of building a dynamic ensemble of chain
classifiers for multi-label classification. To do so, we proposed two concepts
of classifier chains algorithms that are able to change label order of the
chain without rebuilding the entire model. Such modes allows anticipating the
instance-specific chain order without a significant increase in computational
burden. The proposed chain models are built using the Naive Bayes classifier
and nearest neighbour approach as a base single-label classifiers. To take the
benefits of the proposed algorithms, we developed a simple heuristic that
allows the system to find relatively good label order. The heuristic sort
labels according to the label-specific classification quality gained during the
validation phase. The heuristic tries to minimise the phenomenon of error
propagation in the chain. The experimental results showed that the proposed
model based on Naive Bayes classifier the above-mentioned heuristic is an
efficient tool for building dynamic chain classifiers.
","[{'version': 'v1', 'created': 'Fri, 20 Oct 2017 11:26:41 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Nov 2017 16:11:39 GMT'}]",2020-01-08,"[['Trajdos', 'Pawel', ''], ['Kurzynski', 'Marek', '']]","['multi-label', 'classifier chains', 'naive bayes', 'dynamic chains', 'nearestneighbour']"
6893,2111.12785,Zhiming Zhao,"Zhiming Zhao, Spiros Koulouzis, Riccardo Bianchi, Siamak Farshidi,
  Zeshun Shi, Ruyue Xin, Yuandou Wang, Na Li, Yifang Shi, Joris Timmermans, W.
  Daniel Kissling","Notebook-as-a-VRE (NaaVRE): from private notebooks to a collaborative
  cloud virtual research environment","A revised version has been published in the journal software practice
  and experience",Softw Pract Exper.2022; 1-20,10.1002/spe.3098,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Virtual Research Environments (VREs) provide user-centric support in the
lifecycle of research activities, e.g., discovering and accessing research
assets, or composing and executing application workflows. A typical VRE is
often implemented as an integrated environment, which includes a catalog of
research assets, a workflow management system, a data management framework, and
tools for enabling collaboration among users. Notebook environments, such as
Jupyter, allow researchers to rapidly prototype scientific code and share their
experiments as online accessible notebooks. Jupyter can support several popular
languages that are used by data scientists, such as Python, R, and Julia.
However, such notebook environments do not have seamless support for running
heavy computations on remote infrastructure or finding and accessing software
code inside notebooks. This paper investigates the gap between a notebook
environment and a VRE and proposes an embedded VRE solution for the Jupyter
environment called Notebook-as-a-VRE (NaaVRE). The NaaVRE solution provides
functional components via a component marketplace and allows users to create a
customized VRE on top of the Jupyter environment. From the VRE, a user can
search research assets (data, software, and algorithms), compose workflows,
manage the lifecycle of an experiment, and share the results among users in the
community. We demonstrate how such a solution can enhance a legacy workflow
that uses Light Detection and Ranging (LiDAR) data from country-wide airborne
laser scanning surveys for deriving geospatial data products of ecosystem
structure at high resolution over broad spatial extents. This enables users to
scale out the processing of multi-terabyte LiDAR point clouds for ecological
applications to more data sources in a distributed cloud environment.
","[{'version': 'v1', 'created': 'Wed, 24 Nov 2021 20:35:06 GMT'}, {'version': 'v2', 'created': 'Wed, 18 May 2022 08:20:34 GMT'}]",2022-05-19,"[['Zhao', 'Zhiming', ''], ['Koulouzis', 'Spiros', ''], ['Bianchi', 'Riccardo', ''], ['Farshidi', 'Siamak', ''], ['Shi', 'Zeshun', ''], ['Xin', 'Ruyue', ''], ['Wang', 'Yuandou', ''], ['Li', 'Na', ''], ['Shi', 'Yifang', ''], ['Timmermans', 'Joris', ''], ['Kissling', 'W. Daniel', '']]","['Virtual research environment', 'Jupyter', 'Cloud']"
6894,2112.02053,Valdemar \v{S}v\'abensk\'y,"Valdemar \v{S}v\'abensk\'y, Richard Weiss, Jack Cook, Jan Vykopal,
  Pavel \v{C}eleda, Jens Mache, Radoslav Chudovsk\'y, Ankur Chattopadhyay","Evaluating Two Approaches to Assessing Student Progress in Cybersecurity
  Exercises","ACM SIGCSE 2022 conference, 7 pages, 3 figures",,10.1145/3478431.3499414,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cybersecurity students need to develop practical skills such as using
command-line tools. Hands-on exercises are the most direct way to assess these
skills, but assessing students' mastery is a challenging task for instructors.
We aim to alleviate this issue by modeling and visualizing student progress
automatically throughout the exercise. The progress is summarized by graph
models based on the shell commands students typed to achieve discrete tasks
within the exercise. We implemented two types of models and compared them using
data from 46 students at two universities. To evaluate our models, we surveyed
22 experienced computing instructors and qualitatively analyzed their
responses. The majority of instructors interpreted the graph models effectively
and identified strengths, weaknesses, and assessment use cases for each model.
Based on the evaluation, we provide recommendations to instructors and explain
how our graph models innovate teaching and promote further research. The impact
of this paper is threefold. First, it demonstrates how multiple institutions
can collaborate to share approaches to modeling student progress in hands-on
exercises. Second, our modeling techniques generalize to data from different
environments to support student assessment, even outside the cybersecurity
domain. Third, we share the acquired data and open-source software so that
others can use the models in their classes or research.
","[{'version': 'v1', 'created': 'Fri, 3 Dec 2021 18:08:27 GMT'}]",2021-12-06,"[['Švábenský', 'Valdemar', ''], ['Weiss', 'Richard', ''], ['Cook', 'Jack', ''], ['Vykopal', 'Jan', ''], ['Čeleda', 'Pavel', ''], ['Mache', 'Jens', ''], ['Chudovský', 'Radoslav', ''], ['Chattopadhyay', 'Ankur', '']]","['cybersecurity education', 'command-line history', 'educational datamining', 'learning analytics', 'assessment', 'modeling']"
6895,2205.01163,Sebastian Baltes,"Paul Ralph, Sebastian Baltes","Paving the Way for Mature Secondary Research: The Seven Types of
  Literature Review","5 pages, 1 table, 30th ACM Joint European Software Engineering
  Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE
  2022)",,10.1145/3540250.3560877,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Confusion over different kinds of secondary research, and their divergent
purposes, is undermining the effectiveness and usefulness of secondary studies
in software engineering. This short paper therefore explains the differences
between ad hoc review, case survey, critical review, meta-analysis (aka
systematic literature review), meta-synthesis (aka thematic analysis), rapid
review and scoping review (aka systematic mapping study). These definitions and
associated guidelines help researchers better select and describe their
literature reviews, while helping reviewers select more appropriate evaluation
criteria.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 19:10:01 GMT'}, {'version': 'v2', 'created': 'Mon, 5 Sep 2022 20:18:41 GMT'}]",2022-09-07,"[['Ralph', 'Paul', ''], ['Baltes', 'Sebastian', '']]","['Literature review', 'secondary research', 'systematic review']"
6896,2011.03654,Jessica Dai,"Jessica Dai, Sina Fazelpour, Zachary C. Lipton",Fair Machine Learning Under Partial Compliance,"Presented at AIES 2021; previously at the NeurIPS 2020 Workshop on
  Consequential Decision Making in Dynamic Environments and the NeurIPS 2020
  Workshop on ML for Economic Policy. Minor correction uploaded Sept. 2022",,10.1145/3461702.3462521,,cs.CY cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Typically, fair machine learning research focuses on a single decisionmaker
and assumes that the underlying population is stationary. However, many of the
critical domains motivating this work are characterized by competitive
marketplaces with many decisionmakers. Realistically, we might expect only a
subset of them to adopt any non-compulsory fairness-conscious policy, a
situation that political philosophers call partial compliance. This possibility
raises important questions: how does the strategic behavior of decision
subjects in partial compliance settings affect the allocation outcomes? If k%
of employers were to voluntarily adopt a fairness-promoting intervention,
should we expect k% progress (in aggregate) towards the benefits of universal
adoption, or will the dynamics of partial compliance wash out the hoped-for
benefits? How might adopting a global (versus local) perspective impact the
conclusions of an auditor? In this paper, we propose a simple model of an
employment market, leveraging simulation as a tool to explore the impact of
both interaction effects and incentive effects on outcomes and auditing
metrics. Our key findings are that at equilibrium: (1) partial compliance (k%
of employers) can result in far less than proportional (k%) progress towards
the full compliance outcomes; (2) the gap is more severe when fair employers
match global (vs local) statistics; (3) choices of local vs global statistics
can paint dramatically different pictures of the performance vis-a-vis fairness
desiderata of compliant versus non-compliant employers; and (4) partial
compliance to local parity measures can induce extreme segregation.
","[{'version': 'v1', 'created': 'Sat, 7 Nov 2020 01:46:53 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Nov 2020 06:55:54 GMT'}, {'version': 'v3', 'created': 'Wed, 5 May 2021 17:17:16 GMT'}, {'version': 'v4', 'created': 'Tue, 27 Sep 2022 02:59:17 GMT'}]",2022-09-28,"[['Dai', 'Jessica', ''], ['Fazelpour', 'Sina', ''], ['Lipton', 'Zachary C.', '']]","['fairness', 'distributive justice', 'hiring', 'simulations', 'segregation', 'regulation']"
6897,1906.08249,Luca Mariot,"Luca Mariot and Maximilien Gadouleau and Enrico Formenti and Alberto
  Leporati",Mutually Orthogonal Latin Squares based on Cellular Automata,"25 pages, 3 figures",,10.1007/s10623-019-00689-8,,cs.DM math.CO nlin.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate sets of Mutually Orthogonal Latin Squares (MOLS) generated by
Cellular Automata (CA) over finite fields. After introducing how a CA defined
by a bipermutive local rule of diameter $d$ over an alphabet of $q$ elements
generates a Latin square of order $q^{d-1}$, we study the conditions under
which two CA generate a pair of orthogonal Latin squares. In particular, we
prove that the Latin squares induced by two Linear Bipermutive CA (LBCA) over
the finite field $\mathbb{F}_q$ are orthogonal if and only if the polynomials
associated to their local rules are relatively prime. Next, we enumerate all
such pairs of orthogonal Latin squares by counting the pairs of coprime monic
polynomials with nonzero constant term and degree $n$ over $\mathbb{F}_q$.
Finally, we present a construction of MOLS generated by LBCA with irreducible
polynomials and prove the maximality of the resulting sets, as well as a lower
bound which is asymptotically close to their actual number.
","[{'version': 'v1', 'created': 'Wed, 19 Jun 2019 17:49:16 GMT'}, {'version': 'v2', 'created': 'Thu, 31 Oct 2019 13:37:45 GMT'}]",2019-11-01,"[['Mariot', 'Luca', ''], ['Gadouleau', 'Maximilien', ''], ['Formenti', 'Enrico', ''], ['Leporati', 'Alberto', '']]","['Mutually orthogonal Latin squares', 'cellular automata', 'Sylvester matrices', 'polynomials']"
6898,2211.12926,Abhirama Subramanyam Penamakuri,"Nakul Sharma, Abhirama S. Penamakuri, Anand Mishra","Contrastive Multi-View Textual-Visual Encoding: Towards One Hundred
  Thousand-Scale One-Shot Logo Identification",Accepted to ICVGIP 2022,,10.1145/3571600.3571625,,cs.CV cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this paper, we study the problem of identifying logos of business brands
in natural scenes in an open-set one-shot setting. This problem setup is
significantly more challenging than traditionally-studied 'closed-set' and
'large-scale training samples per category' logo recognition settings. We
propose a novel multi-view textual-visual encoding framework that encodes text
appearing in the logos as well as the graphical design of the logos to learn
robust contrastive representations. These representations are jointly learned
for multiple views of logos over a batch and thereby they generalize well to
unseen logos. We evaluate our proposed framework for cropped logo verification,
cropped logo identification, and end-to-end logo identification in natural
scene tasks; and compare it against state-of-the-art methods. Further, the
literature lacks a 'very-large-scale' collection of reference logo images that
can facilitate the study of one-hundred thousand-scale logo identification. To
fill this gap in the literature, we introduce Wikidata Reference Logo Dataset
(WiRLD), containing logos for 100K business brands harvested from Wikidata. Our
proposed framework that achieves an area under the ROC curve of 91.3% on the
QMUL-OpenLogo dataset for the verification task, outperforms state-of-the-art
methods by 9.1% and 2.6% on the one-shot logo identification task on the
Toplogos-10 and the FlickrLogos32 datasets, respectively. Further, we show that
our method is more stable compared to other baselines even when the number of
candidate logos is on a 100K scale.
","[{'version': 'v1', 'created': 'Wed, 23 Nov 2022 12:59:41 GMT'}]",2022-11-24,"[['Sharma', 'Nakul', ''], ['Penamakuri', 'Abhirama S.', ''], ['Mishra', 'Anand', '']]","['supervised contrastive learning', 'one-shot learning', 'open-set recognition', 'logo identification']"
6899,1906.03053,Maurice Tchoup\'e Tchendji,"Maurice Tchoup\'e Tchendji, Lionel Tadonfouet, Thomas T\'ebougang
  Tchendji","A Tree Pattern Matching Algorithm for XML Queries with Structural
  Preferences",,"Journal of Computer and Communications, 2019, 7, 61-83",10.4236/jcc.2019.71006,,cs.DB cs.IR,http://creativecommons.org/licenses/by-sa/4.0/,"  In the XML community, exact queries allow users to specify exactly what they
want to check and/or retrieve in an XML document. When they are applied to a
semi-structured document or to a document with an overly complex model, the
lack or the ignorance of the explicit document model (DTD-Document Type
Definition, Schema, etc.) increases the risk of ob-taining an empty result set
when the query is too specific, or, too large result set when it is too vague
(e.g. it contains wildcards such as ""*""). The reason is that in both cases,
users write queries according to the document model they have in mind; this can
be very far from the one that can actually be extracted from the document.
Opposed to exact queries, preference queries are more flexible and can be
relaxed to expand the search space during their evalua-tions. Indeed, during
their evaluation, certain constraints (the preferences they contain) can be
relaxed if necessary to avoid precisely empty results; moreover, the returned
answers can be filtered to retain only the best ones. This paper presents an
algorithm for evaluating such queries inspired by the TreeMatch algorithm
proposed by Yao et al. for exact queries. In the pro-posed algorithm, the best
answers are obtained by using an adaptation of the Skyline operator (defined in
relational databases) in the context of documents (trees) to incrementally
filter into the partial solutions set, those which satisfy the maximum of
preferential constraints. The only restriction imposed on documents is
No-Self-Containment.
","[{'version': 'v1', 'created': 'Fri, 7 Jun 2019 12:46:40 GMT'}]",2019-06-10,"[['Tchendji', 'Maurice Tchoupé', ''], ['Tadonfouet', 'Lionel', ''], ['Tchendji', 'Thomas Tébougang', '']]","['Semi-Structured Documents', 'Preference Queries', 'Tree Pattern Matching', 'TreeMatch Algorithm', 'XML', 'The Skyline Operator']"
6900,1909.04801,Ruhui Jin,"Ruhui Jin, Tamara G. Kolda, Rachel Ward",Faster Johnson-Lindenstrauss Transforms via Kronecker Products,"Information and Inference: A Journal of the IMA, 2020",,10.1093/imaiai/iaaa028,,cs.IT cs.NA math.IT math.NA math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Kronecker product is an important matrix operation with a wide range of
applications in supporting fast linear transforms, including signal processing,
graph theory, quantum computing and deep learning. In this work, we introduce a
generalization of the fast Johnson-Lindenstrauss projection for embedding
vectors with Kronecker product structure, the Kronecker fast
Johnson-Lindenstrauss transform (KFJLT). The KFJLT reduces the embedding cost
to an exponential factor of the standard fast Johnson-Lindenstrauss transform
(FJLT)'s cost when applied to vectors with Kronecker structure, by avoiding
explicitly forming the full Kronecker products. We prove that this
computational gain comes with only a small price in embedding power: given $N =
\prod_{k=1}^d n_k$, consider a finite set of $p$ points in a tensor product of
$d$ constituent Euclidean spaces $\bigotimes_{k=d}^{1}\mathbb{R}^{n_k} \subset
\mathbb{R}^{N}$. With high probability, a random KFJLT matrix of dimension $N
\times m$ embeds the set of points up to multiplicative distortion $(1\pm
\varepsilon)$ provided by $m \gtrsim \varepsilon^{-2} \cdot \log^{2d - 1} (p)
\cdot \log N$. We conclude by describing a direct application of the KFJLT to
the efficient solution of large-scale Kronecker-structured least squares
problems for fitting the CP tensor decomposition.
","[{'version': 'v1', 'created': 'Wed, 11 Sep 2019 00:33:51 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Dec 2019 17:30:46 GMT'}, {'version': 'v3', 'created': 'Thu, 30 Jul 2020 22:15:25 GMT'}]",2020-11-25,"[['Jin', 'Ruhui', ''], ['Kolda', 'Tamara G.', ''], ['Ward', 'Rachel', '']]","['Johnson-Lindenstrauss embedding', 'fast Johnson-Lindenstrauss transform (FJLT)', 'Kronecker structure', 'concentration inequality', 'restricted isometry property']"
6901,2210.06658,Yiyang Li,"Diana Kim, Virgil Watkins, Laszlo Cline, Jingxian Li, Kai Sun, Joshua
  D. Sugar, Elliot J. Fuller, A. Alec Talin, Yiyang Li",Nonvolatile Electrochemical Random-Access Memory Under Short Circuit,"14 pages, 4 figures",,10.1002/aelm.202200958,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Electrochemical random-access memory (ECRAM) is a recently developed and
highly promising analog resistive memory element for in-memory computing. One
longstanding challenge of ECRAM is attaining retention time beyond a few hours.
This short retention has precluded ECRAM from being considered for inference
classification in deep neural networks, which is likely the largest opportunity
for in-memory computing. In this work, we develop an ECRAM cell with orders of
magnitude longer retention than previously achieved, and which we anticipate to
exceed 10 years at 85C. We hypothesize that the origin of this exceptional
retention is phase separation, which enables the formation of multiple
effectively equilibrium resistance states. This work highlights the promises
and opportunities to use phase separation to yield ECRAM cells with
exceptionally long, and potentially permanent, retention times.
","[{'version': 'v1', 'created': 'Thu, 13 Oct 2022 01:37:22 GMT'}]",2022-11-18,"[['Kim', 'Diana', ''], ['Watkins', 'Virgil', ''], ['Cline', 'Laszlo', ''], ['Li', 'Jingxian', ''], ['Sun', 'Kai', ''], ['Sugar', 'Joshua D.', ''], ['Fuller', 'Elliot J.', ''], ['Talin', 'A. Alec', ''], ['Li', 'Yiyang', '']]","['In-memory computing', 'retention', 'tungsten oxide', 'oxygen vacancies']"
6902,2207.14338,Chao Huang,Lianghao Xia and Chao Huang and Chuxu Zhang,Self-Supervised Hypergraph Transformer for Recommender Systems,"This paper has been published as a full paper at the KDD research
  track 2022",,10.1145/3534678.3539473,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph Neural Networks (GNNs) have been shown as promising solutions for
collaborative filtering (CF) with the modeling of user-item interaction graphs.
The key idea of existing GNN-based recommender systems is to recursively
perform the message passing along the user-item interaction edge for refining
the encoded embeddings. Despite their effectiveness, however, most of the
current recommendation models rely on sufficient and high-quality training
data, such that the learned representations can well capture accurate user
preference. User behavior data in many practical recommendation scenarios is
often noisy and exhibits skewed distribution, which may result in suboptimal
representation performance in GNN-based models. In this paper, we propose SHT,
a novel Self-Supervised Hypergraph Transformer framework (SHT) which augments
user representations by exploring the global collaborative relationships in an
explicit way. Specifically, we first empower the graph neural CF paradigm to
maintain global collaborative effects among users and items with a hypergraph
transformer network. With the distilled global context, a cross-view generative
self-supervised learning component is proposed for data augmentation over the
user-item interaction graph, so as to enhance the robustness of recommender
systems. Extensive experiments demonstrate that SHT can significantly improve
the performance over various state-of-the-art baselines. Further ablation
studies show the superior representation ability of our SHT recommendation
framework in alleviating the data sparsity and noise issues. The source code
and evaluation datasets are available at: https://github.com/akaxlh/SHT.
","[{'version': 'v1', 'created': 'Thu, 28 Jul 2022 18:40:30 GMT'}]",2022-08-01,"[['Xia', 'Lianghao', ''], ['Huang', 'Chao', ''], ['Zhang', 'Chuxu', '']]","['Self-Supervised Learning', 'Graph Neural Networks', 'HypergraphRepresentation', 'Recommender System']"
6903,2002.00069,Philokypros Ioulianou,"Ryan Smith, Daniel Palin, Philokypros P. Ioulianou, Vassilios G.
  Vassilakis, Siamak F. Shahandashti",Battery draining attacks against edge computing nodes in IoT networks,"19 pages,","Cyber-Physical Systems (2020), pp.1-21",10.1080/23335777.2020.1716268,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many IoT devices, especially those deployed at the network edge have limited
power resources. A number of attacks aim to exhaust these resources and drain
the batteries of such edge nodes. In this work, we study the effects of a
variety of battery draining attacks against edge nodes. Through simulation, we
clarify the extent to which such attacks are able to increase the usage and
hence waste the power resources of edge nodes. Specifically, we implement hello
flooding, packet flooding, selective forwarding, rank attack, and versioning
attack in ContikiOS and simulate them in the Cooja simulator, and measure and
report a number of time and power resource usage metrics including CPU time,
low power mode time, TX/RX time, and battery consumption. Besides, we test the
stretch attack with three different batteries as an extreme scenario. Our
extensive measurements enable us to compare the effectiveness of these attacks.
Our results show that Versioning attack is the most severe attack in terms of
draining the power resources of the network, followed by Packet Flooding and
Hello Flood attacks. Furthermore, we confirm that Selective Forwarding and Rank
attacks are not able to considerably increase the power resource usage in our
scenarios. By quantifying the effects of these attacks, we demonstrate that
under specific scenarios, Versioning attack can be three to four times as
effective as Packet Flooding and Hello Flood attacks in wasting network
resources, while Packet Flooding is generally comparable to Hello Flood in CPU
and TX time usage increase but twice as powerful in draining device batteries.
","[{'version': 'v1', 'created': 'Fri, 31 Jan 2020 21:44:21 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Feb 2020 17:03:48 GMT'}]",2020-02-05,"[['Smith', 'Ryan', ''], ['Palin', 'Daniel', ''], ['Ioulianou', 'Philokypros P.', ''], ['Vassilakis', 'Vassilios G.', ''], ['Shahandashti', 'Siamak F.', '']]","['Edge computing', 'Internet of things', 'smart sensors', 'battery draining attacks', 'Cooja', 'ContikiOS']"
6904,1805.03324,Shushan Arakelyan,"Shushan Arakelyan, Fred Morstatter, Margaret Martin, Emilio Ferrara,
  Aram Galstyan",Mining and Forecasting Career Trajectories of Music Artists,In HT'18: 29th ACM Conference on Hypertext and Social Media,,10.1145/3209542.3209554,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many musicians, from up-and-comers to established artists, rely heavily on
performing live to promote and disseminate their music. To advertise live
shows, artists often use concert discovery platforms that make it easier for
their fans to track tour dates. In this paper, we ask whether digital traces of
live performances generated on those platforms can be used to understand career
trajectories of artists. First, we present a new dataset we constructed by
cross-referencing data from such platforms. We then demonstrate how this
dataset can be used to mine and predict important career milestones for the
musicians, such as signing by a major music label, or performing at a certain
venue. Finally, we perform a temporal analysis of the bipartite artist-venue
graph, and demonstrate that high centrality on this graph is correlated with
success.
","[{'version': 'v1', 'created': 'Wed, 9 May 2018 00:06:54 GMT'}]",2018-05-10,"[['Arakelyan', 'Shushan', ''], ['Morstatter', 'Fred', ''], ['Martin', 'Margaret', ''], ['Ferrara', 'Emilio', ''], ['Galstyan', 'Aram', '']]","['networks', 'art and music', 'multidisciplinary topics', 'applications']"
6905,2108.08627,Sagar Dasgupta,"Sagar Dasgupta, Courtland Hollis, Mizanur Rahman, Travis Atkison","An Innovative Attack Modelling and Attack Detection Approach for a
  Waiting Time-based Adaptive Traffic Signal Controller",,,10.1061/9780784484326.008,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  An adaptive traffic signal controller (ATSC) combined with a connected
vehicle (CV) concept uses real-time vehicle trajectory data to regulate green
time and has the ability to reduce intersection waiting time significantly and
thereby improve travel time in a signalized corridor. However, the CV-based
ATSC increases the size of the surface vulnerable to potential cyber-attack,
allowing an attacker to generate disastrous traffic congestion in a roadway
network. An attacker can congest a route by generating fake vehicles by
maintaining traffic and car-following rules at a slow rate so that the signal
timing and phase change without having any abrupt changes in number of
vehicles. Because of the adaptive nature of ATSC, it is a challenge to model
this kind of attack and also to develop a strategy for detection. This paper
introduces an innovative ""slow poisoning"" cyberattack for a waiting time based
ATSC algorithm and a corresponding detection strategy. Thus, the objectives of
this paper are to: (i) develop a ""slow poisoning"" attack generation strategy
for an ATSC, and (ii) develop a prediction-based ""slow poisoning"" attack
detection strategy using a recurrent neural network -- i.e., long short-term
memory model. We have generated a ""slow poisoning"" attack modeling strategy
using a microscopic traffic simulator -- Simulation of Urban Mobility (SUMO) --
and used generated data from the simulation to develop both the attack model
and detection model. Our analyses revealed that the attack strategy is
effective in creating a congestion in an approach and detection strategy is
able to flag the attack.
","[{'version': 'v1', 'created': 'Thu, 19 Aug 2021 11:44:21 GMT'}]",2022-09-12,"[['Dasgupta', 'Sagar', ''], ['Hollis', 'Courtland', ''], ['Rahman', 'Mizanur', ''], ['Atkison', 'Travis', '']]","['Cybersecurity', 'slow poisoning attack', 'adaptive traffic signal controller', 'long shortterm memory (LSTM)']"
6906,2208.10719,Li Ding,"Li Ding, Ryan Boldi, Thomas Helmuth, Lee Spector",Lexicase Selection at Scale,,"Proceedings of the 2022 Genetic and Evolutionary Computation
  Conference Companion (pp. 2054-2062)",10.1145/3520304.3534026,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lexicase selection is a semantic-aware parent selection method, which
assesses individual test cases in a randomly-shuffled data stream. It has
demonstrated success in multiple research areas including genetic programming,
genetic algorithms, and more recently symbolic regression and deep learning.
One potential drawback of lexicase selection and its variants is that the
selection procedure requires evaluating training cases in a single data stream,
making it difficult to handle tasks where the evaluation is computationally
heavy or the dataset is large-scale, e.g., deep learning. In this work, we
investigate how the weighted shuffle methods can be employed to improve the
efficiency of lexicase selection. We propose a novel method, fast lexicase
selection, which incorporates lexicase selection and weighted shuffle with
partial evaluation. Experiments on both classic genetic programming and deep
learning tasks indicate that the proposed method can significantly reduce the
number of evaluation steps needed for lexicase selection to select an
individual, improving its efficiency while maintaining the performance.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2022 03:58:47 GMT'}]",2022-08-24,"[['Ding', 'Li', ''], ['Boldi', 'Ryan', ''], ['Helmuth', 'Thomas', ''], ['Spector', 'Lee', '']]","['genetic programming', 'lexicase selection', 'parent selection', 'deeplearning', 'image classification']"
6907,2010.02546,Qianwei Zhou,"Qianwei Zhou, Yuhang Chen, Baoqing Li, Xiaoxin Li, Chen Zhou,
  Jingchang Huang, Haigen Hu","Training Deep Neural Networks for Wireless Sensor Networks Using Loosely
  and Weakly Labeled Images",,,10.1016/j.neucom.2020.09.040,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although deep learning has achieved remarkable successes over the past years,
few reports have been published about applying deep neural networks to Wireless
Sensor Networks (WSNs) for image targets recognition where data, energy,
computation resources are limited. In this work, a Cost-Effective Domain
Generalization (CEDG) algorithm has been proposed to train an efficient network
with minimum labor requirements. CEDG transfers networks from a publicly
available source domain to an application-specific target domain through an
automatically allocated synthetic domain. The target domain is isolated from
parameters tuning and used for model selection and testing only. The target
domain is significantly different from the source domain because it has new
target categories and is consisted of low-quality images that are out of focus,
low in resolution, low in illumination, low in photographing angle. The trained
network has about 7M (ResNet-20 is about 41M) multiplications per prediction
that is small enough to allow a digital signal processor chip to do real-time
recognitions in our WSN. The category-level averaged error on the unseen and
unbalanced target domain has been decreased by 41.12%.
","[{'version': 'v1', 'created': 'Tue, 6 Oct 2020 08:28:34 GMT'}]",2020-10-08,"[['Zhou', 'Qianwei', ''], ['Chen', 'Yuhang', ''], ['Li', 'Baoqing', ''], ['Li', 'Xiaoxin', ''], ['Zhou', 'Chen', ''], ['Huang', 'Jingchang', ''], ['Hu', 'Haigen', '']]","['Deep Neural Networks', 'Wireless Sensor Networks', 'Automated Data Labeling', 'Image Recognition', 'TransferLearning', 'Model Compression']"
6908,2106.02818,Amir Ahooye Atashin,"Amir Ahooye Atashin, Behrooz Razeghi, Deniz G\""und\""uz, Slava
  Voloshynovskiy","Variational Leakage: The Role of Information Complexity in Privacy
  Leakage",,,10.1145/3468218.3469040,,cs.LG cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the role of information complexity in privacy leakage about an
attribute of an adversary's interest, which is not known a priori to the system
designer. Considering the supervised representation learning setup and using
neural networks to parameterize the variational bounds of information
quantities, we study the impact of the following factors on the amount of
information leakage: information complexity regularizer weight, latent space
dimension, the cardinalities of the known utility and unknown sensitive
attribute sets, the correlation between utility and sensitive attributes, and a
potential bias in a sensitive attribute of adversary's interest. We conduct
extensive experiments on Colored-MNIST and CelebA datasets to evaluate the
effect of information complexity on the amount of intrinsic leakage.
","[{'version': 'v1', 'created': 'Sat, 5 Jun 2021 06:56:39 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Jun 2021 09:17:12 GMT'}]",2021-06-09,"[['Atashin', 'Amir Ahooye', ''], ['Razeghi', 'Behrooz', ''], ['Gündüz', 'Deniz', ''], ['Voloshynovskiy', 'Slava', '']]","['Information complexity', 'privacy', 'intrinsic leakage', 'statistical inference', 'information bottleneck']"
6909,1711.10868,Michel Fliess,"Vincent Rocher, C\'edric Join, St\'ephane Mottelet, Jean Bernier,
  Sabrina Rechdaoui-Gu\'erin, Sam Azimi, Paul Lessard, Andr\'e Pauss, Michel
  Fliess","La production de nitrites lors de la d\'enitrification des eaux us\'ees
  par biofiltration - Strat\'egie de contr\^ole et de r\'eduction des
  concentrations r\'esiduelles","in french, Journal of Water Science, to appear","Revue des Sciences de l'Eau, 31(1), 2018, 61-73",10.7202/1047053ar,,cs.SY cs.AI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The recent popularity of post-denitrification processes in the greater Paris
area wastewater treatment plants has caused a resurgence of the presence of
nitrite in the Seine river. Controlling the production of nitrite during the
post-denitrification has thus become a major technical issue. Research studies
have been led in the MOCOPEE program (www.mocopee.com) to better understand the
underlying mechanisms behind the production of nitrite during wastewater
denitrification and to develop technical tools (measurement and control
solutions) to assist on-site reductions of nitrite productions. Prior studies
have shown that typical methanol dosage strategies produce a varying
carbon-to-nitrogen ratio in the reactor, which in turn leads to unstable
nitrite concentrations in the effluent. The possibility of adding a model-free
control to the actual classical dosage strategy has thus been tested on the
SimBio model, which simulates the behavior of wastewater biofilters. The
corresponding ""intelligent"" feedback loop, which is using effluent nitrite
concentrations, compensates the classical strategy only when needed. Simulation
results show a clear improvement in average nitrite concentration level and
level stability in the effluent, without a notable overcost in methanol.
","[{'version': 'v1', 'created': 'Tue, 28 Nov 2017 18:49:32 GMT'}]",2018-06-26,"[['Rocher', 'Vincent', ''], ['Join', 'Cédric', ''], ['Mottelet', 'Stéphane', ''], ['Bernier', 'Jean', ''], ['Rechdaoui-Guérin', 'Sabrina', ''], ['Azimi', 'Sam', ''], ['Lessard', 'Paul', ''], ['Pauss', 'André', ''], ['Fliess', 'Michel', '']]","['Biofiltration', 'denitrification', 'wastewater', 'plant operation', 'nitrites', 'wastewater treatment plant']"
6910,2203.02660,Sicong Cao,"Sicong Cao, Xiaobing Sun, Lili Bo, Rongxin Wu, Bin Li, and Chuanqi Tao","MVD: Memory-Related Vulnerability Detection Based on Flow-Sensitive
  Graph Neural Networks",To appear in the Technical Track of ICSE 2022,,10.1145/3510003.3510219,,cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Memory-related vulnerabilities constitute severe threats to the security of
modern software. Despite the success of deep learning-based approaches to
generic vulnerability detection, they are still limited by the underutilization
of flow information when applied for detecting memory-related vulnerabilities,
leading to high false positives.
  In this paper,we propose MVD, a statement-level Memory-related Vulnerability
Detection approach based on flow-sensitive graph neural networks (FS-GNN).
FS-GNN is employed to jointly embed both unstructured information (i.e., source
code) and structured information (i.e., control- and data-flow) to capture
implicit memory-related vulnerability patterns. We evaluate MVD on the dataset
which contains 4,353 real-world memory-related vulnerabilities, and compare our
approach with three state-of-the-art deep learning-based approaches as well as
five popular static analysisbased memory detectors. The experiment results show
that MVD achieves better detection accuracy, outperforming both state-of-theart
DL-based and static analysis-based approaches. Furthermore, MVD makes a great
trade-off between accuracy and efficiency.
","[{'version': 'v1', 'created': 'Sat, 5 Mar 2022 05:06:10 GMT'}]",2022-03-08,"[['Cao', 'Sicong', ''], ['Sun', 'Xiaobing', ''], ['Bo', 'Lili', ''], ['Wu', 'Rongxin', ''], ['Li', 'Bin', ''], ['Tao', 'Chuanqi', '']]","['Memory-Related Vulnerability', 'Vulnerability Detection', 'Graph Neural Networks', 'Flow Analysis']"
6911,2111.02133,Giacomo Lanciano,"Giacomo Lanciano, Filippo Galli, Tommaso Cucinotta, Davide Bacciu,
  Andrea Passarella",Predictive Auto-scaling with OpenStack Monasca,"Accepted at 2021 IEEE/ACM 14th International Conference on Utility
  and Cloud Computing (UCC'21)",,10.1145/3468737.3494104,,cs.DC cs.LG cs.SY eess.SY,http://creativecommons.org/licenses/by-sa/4.0/,"  Cloud auto-scaling mechanisms are typically based on reactive automation
rules that scale a cluster whenever some metric, e.g., the average CPU usage
among instances, exceeds a predefined threshold. Tuning these rules becomes
particularly cumbersome when scaling-up a cluster involves non-negligible times
to bootstrap new instances, as it happens frequently in production cloud
services.
  To deal with this problem, we propose an architecture for auto-scaling cloud
services based on the status in which the system is expected to evolve in the
near future. Our approach leverages on time-series forecasting techniques, like
those based on machine learning and artificial neural networks, to predict the
future dynamics of key metrics, e.g., resource consumption metrics, and apply a
threshold-based scaling policy on them. The result is a predictive automation
policy that is able, for instance, to automatically anticipate peaks in the
load of a cloud application and trigger ahead of time appropriate scaling
actions to accommodate the expected increase in traffic.
  We prototyped our approach as an open-source OpenStack component, which
relies on, and extends, the monitoring capabilities offered by Monasca,
resulting in the addition of predictive metrics that can be leveraged by
orchestration components like Heat or Senlin. We show experimental results
using a recurrent neural network and a multi-layer perceptron as predictor,
which are compared with a simple linear regression and a traditional
non-predictive auto-scaling policy. However, the proposed framework allows for
the easy customization of the prediction policy as needed.
","[{'version': 'v1', 'created': 'Wed, 3 Nov 2021 11:02:08 GMT'}]",2021-11-04,"[['Lanciano', 'Giacomo', ''], ['Galli', 'Filippo', ''], ['Cucinotta', 'Tommaso', ''], ['Bacciu', 'Davide', ''], ['Passarella', 'Andrea', '']]","['Elasticity auto-scaling', 'Time-series forecasting', 'Predictive operations', 'OpenStack']"
6912,2211.03314,Guohao Li,"Guohao Li, Hu Yang, Feng He, Zhifan Feng, Yajuan Lyu, Hua Wu, Haifeng
  Wang",CLOP: Video-and-Language Pre-Training with Knowledge Regularizations,ACM Multimedia 2022 (MM'22),,10.1145/3503161.3548346,,cs.CV cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video-and-language pre-training has shown promising results for learning
generalizable representations. Most existing approaches usually model video and
text in an implicit manner, without considering explicit structural
representations of the multi-modal content. We denote such form of
representations as structural knowledge, which express rich semantics of
multiple granularities. There are related works that propose object-aware
approaches to inject similar knowledge as inputs. However, the existing methods
usually fail to effectively utilize such knowledge as regularizations to shape
a superior cross-modal representation space. To this end, we propose a
Cross-modaL knOwledge-enhanced Pre-training (CLOP) method with Knowledge
Regularizations. There are two key designs of ours: 1) a simple yet effective
Structural Knowledge Prediction (SKP) task to pull together the latent
representations of similar videos; and 2) a novel Knowledge-guided sampling
approach for Contrastive Learning (KCL) to push apart cross-modal hard negative
samples. We evaluate our method on four text-video retrieval tasks and one
multi-choice QA task. The experiments show clear improvements, outperforming
prior works by a substantial margin. Besides, we provide ablations and insights
of how our methods affect the latent representation space, demonstrating the
value of incorporating knowledge regularizations into video-and-language
pre-training.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2022 05:32:12 GMT'}]",2022-11-08,"[['Li', 'Guohao', ''], ['Yang', 'Hu', ''], ['He', 'Feng', ''], ['Feng', 'Zhifan', ''], ['Lyu', 'Yajuan', ''], ['Wu', 'Hua', ''], ['Wang', 'Haifeng', '']]","['video-and-language pre-training', 'knowledge', 'contrastive learning']"
6913,2012.09015,Nuno Fachada,Nuno Fachada,ColorShapeLinks: A board game AI competition for educators and students,"The peer-reviewed version of this paper is published in Computers and
  Education: Artificial Intelligence at
  https://doi.org/10.1016/j.caeai.2021.100014. This version is typeset by the
  author and differs only in pagination and typographical detail","Computers and Education: Artificial Intelligence, 2, 100014, 2021",10.1016/j.caeai.2021.100014,,cs.CY cs.AI cs.HC,http://creativecommons.org/licenses/by/4.0/,"  ColorShapeLinks is an AI board game competition framework specially designed
for students and educators in videogame development, with openness and
accessibility in mind. The competition is based on an arbitrarily-sized version
of the Simplexity board game, the motto of which, ""simple to learn, complex to
master"", is curiously also applicable to AI agents. ColorShapeLinks offers
graphical and text-based frontends and a completely open and documented
development framework built using industry standard tools and following
software engineering best practices. ColorShapeLinks is not only a competition,
but both a game and a framework which educators and students can extend and use
to host their own competitions. It has been successfully used for running
internal competitions in AI classes, as well as for hosting an international AI
competition at the IEEE Conference on Games.
","[{'version': 'v1', 'created': 'Wed, 16 Dec 2020 15:21:29 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Feb 2021 18:05:20 GMT'}]",2021-03-01,"[['Fachada', 'Nuno', '']]","['Board games', 'Videogame development', 'Computer games', 'Simplexity', 'AIcompetition', 'AI agent', 'AI curriculum', 'DotNet']"
6914,2207.08080,Yili Wang Miss,"Yili Wang, Xin Li, Kun Xu, Dongliang He, Qi Zhang, Fu Li, Errui Ding",Neural Color Operators for Sequential Image Retouching,"Accepted to ECCV 2022. Code is available at
  https://github.com/amberwangyili/neurop",,10.1007/978-3-031-19800-7_3,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  We propose a novel image retouching method by modeling the retouching process
as performing a sequence of newly introduced trainable neural color operators.
The neural color operator mimics the behavior of traditional color operators
and learns pixelwise color transformation while its strength is controlled by a
scalar. To reflect the homomorphism property of color operators, we employ
equivariant mapping and adopt an encoder-decoder structure which maps the
non-linear color transformation to a much simpler transformation (i.e.,
translation) in a high dimensional space. The scalar strength of each neural
color operator is predicted using CNN based strength predictors by analyzing
global image statistics. Overall, our method is rather lightweight and offers
flexible controls. Experiments and user studies on public datasets show that
our method consistently achieves the best results compared with SOTA methods in
both quantitative measures and visual qualities. The code and pretrained models
are provided at https://github.com/amberwangyili/neurop
","[{'version': 'v1', 'created': 'Sun, 17 Jul 2022 05:33:19 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Oct 2022 03:22:45 GMT'}]",2022-10-26,"[['Wang', 'Yili', ''], ['Li', 'Xin', ''], ['Xu', 'Kun', ''], ['He', 'Dongliang', ''], ['Zhang', 'Qi', ''], ['Li', 'Fu', ''], ['Ding', 'Errui', '']]","['image retouching', 'image enhancement', 'color operator', 'neural color operator']"
6915,2109.13732,Rui Yuan,"Rui Yuan, S. Ali Pourmousavi, Wen L. Soong, Giang Nguyen, Jon A. R.
  Liisberg","IRMAC: Interpretable Refined Motifs in Binary Classification for Smart
  Grid Applications","22 pages, 13 figures",Engineering Applicationsof Artificial Intelligence (2022) 105588,10.1016/j.engappai.2022.105588,,cs.LG cs.SY eess.SP eess.SY,http://creativecommons.org/licenses/by/4.0/,"  Modern power systems are experiencing the challenge of high uncertainty with
the increasing penetration of renewable energy resources and the
electrification of heating systems. In this paradigm shift, understanding
electricity users' demand is of utmost value to retailers, aggregators, and
policymakers. However, behind-the-meter (BTM) equipment and appliances at the
household level are unknown to the other stakeholders mainly due to privacy
concerns and tight regulations. In this paper, we seek to identify residential
consumers based on their BTM equipment, mainly rooftop photovoltaic (PV)
systems and electric heating, using imported/purchased energy data from utility
meters. To solve this problem with an interpretable, fast, secure, and
maintainable solution, we propose an integrated method called Interpretable
Refined Motifs And binary Classification (IRMAC). The proposed method comprises
a novel shape-based pattern extraction technique, called Refined Motif (RM)
discovery, and a single-neuron classifier. The first part extracts a
sub-pattern from the long time series considering the frequency of occurrences,
average dissimilarity, and time dynamics while emphasising specific times with
annotated distances. The second part identifies users' types with linear
complexity while preserving the transparency of the algorithms. With the real
data from Australia and Denmark, the proposed method is tested and verified in
identifying PV owners and electrical heating system users.
","[{'version': 'v1', 'created': 'Thu, 23 Sep 2021 03:24:52 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Oct 2021 23:52:49 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Nov 2022 10:11:39 GMT'}]",2022-11-15,"[['Yuan', 'Rui', ''], ['Pourmousavi', 'S. Ali', ''], ['Soong', 'Wen L.', ''], ['Nguyen', 'Giang', ''], ['Liisberg', 'Jon A. R.', '']]","['Motif discovery', 'Data analytic', 'Renewable energy', 'Patternrecognition', 'Binary classification', 'Time series data mining']"
6916,2006.09290,Vineet Sahula,Arjun Singh Chauhan and Vineet Sahula and Atanendu Sekhar Mandal,"Novel Randomized Placement for FPGA Based Robust ROPUF with Improved
  Uniqueness",,"Journal of Electronic Testing volume 35, pages 581 to 601 (2019)",10.1007/s10836-019-05849-1,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The physical unclonable functions (PUF) are used to provide software as well
as hardware security for the cyber-physical systems. They have been used for
performing significant cryptography tasks such as generating keys, device
authentication, securing against IP piracy, and to produce the root of trust as
well. However, they lack in reliability metric. We present a novel approach for
improving the reliability as well as the uniqueness of the field programmable
gated arrays (FPGAs) based ring oscillator PUF and derive a random number,
consuming very small area (< 1%) concerning look-up tables (LUTs). We use
frequency profiling method for distributing frequency variations in ring
oscillators (RO), spatially placed all across the FPGA floor. We are able to
spot suitable locations for RO mapping, which leads to enhanced ROPUF
reliability. We have evaluated the proposed methodology on Xilinx -7 series
FPGAs and tested the robustness against environmental variations, e.g.
temperature and supply voltage variations, simultaneously. The proposed
approach achieves significant improvement (i) in uniqueness value upto 49:90%,
within 0.1% of the theoretical value (ii) in the reliability value upto 99:70%,
which signifies that less than 1 bit flipping has been observed on average, and
(iii) in randomness, signified by passing NIST test suite. The response
generated through the ROPUF passes all the applicable relevant tests of NIST
uniformity statistical test suite.
","[{'version': 'v1', 'created': 'Sun, 7 Jun 2020 10:23:52 GMT'}]",2020-06-17,"[['Chauhan', 'Arjun Singh', ''], ['Sahula', 'Vineet', ''], ['Mandal', 'Atanendu Sekhar', '']]","['Hardware Security', 'PUF', 'Ring Oscillator', 'FPGA', 'Random Number Generator', 'Biased & Randomized Placement', 'NIST Statistical Test', 'K-means Clustering']"
6917,2010.11523,Jorik Jooken,"Jorik Jooken, Pieter Leyman, Tony Wauters and Patrick De Causmaecker","Exploring search space trees using an adapted version of Monte Carlo
  tree search for combinatorial optimization problems",,,10.1016/j.cor.2022.106070,,cs.AI cs.DM math.OC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this article we propose a heuristic algorithm to explore search space
trees associated with instances of combinatorial optimization problems. The
algorithm is based on Monte Carlo tree search, a popular algorithm in game
playing that is used to explore game trees and represents the state-of-the-art
algorithm for a number of games. Several enhancements to Monte Carlo tree
search are proposed that make the algorithm more suitable in a combinatorial
optimization context. These enhancements exploit the combinatorial structure of
the problem and aim to efficiently explore the search space tree by pruning
subtrees, using a heuristic simulation policy, reducing the domains of
variables by eliminating dominated value assignments and using a beam width.
The algorithm was implemented with its components specifically tailored to two
combinatorial optimization problems: the quay crane scheduling problem with
non-crossing constraints and the 0-1 knapsack problem. For the first problem
our algorithm surpasses the state-of-the-art results and several new best
solutions are found for a benchmark set of instances. For the second problem
our algorithm typically produces near-optimal solutions that are slightly worse
than the state-of-the-art results, but it needs only a small fraction of the
time to do so. These results indicate that the algorithm is competitive with
the state-of-the-art for two entirely different combinatorial optimization
problems.
","[{'version': 'v1', 'created': 'Thu, 22 Oct 2020 08:33:58 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Nov 2020 08:54:29 GMT'}, {'version': 'v3', 'created': 'Wed, 16 Nov 2022 12:36:34 GMT'}]",2022-11-17,"[['Jooken', 'Jorik', ''], ['Leyman', 'Pieter', ''], ['Wauters', 'Tony', ''], ['De Causmaecker', 'Patrick', '']]","['Combinatorial optimization', 'Monte Carlo tree search', 'Quay crane scheduling problem with non-crossingconstraints', '0-1 Knapsack problem']"
6918,2107.12055,Jerome Darmont,"Yuzhao Yang (IRIT-SIG), J\'er\^ome Darmont (ERIC), Franck Ravat
  (IRIT-SIG), Olivier Teste (IRIT-SIG)","An Automatic Schema-Instance Approach for Merging Multidimensional Data
  Warehouses","25th International Database Engineering & Applications Symposium
  (IDEAS 2021), Jul 2021, Montreal, Canada",,10.1145/3472163.3472268,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using data warehouses to analyse multidimensional data is a significant task
in company decision-making.The data warehouse merging process is composed of
two steps: matching multidimensional components and then merging them. Current
approaches do not take all the particularities of multidimensional data
warehouses into account, e.g., only merging schemata, but not instances; or not
exploiting hierarchies nor fact tables. Thus, in this paper, we propose an
automatic merging approach for star schema-modeled data warehouses that works
at both the schema and instance levels. We also provide algorithms for merging
hierarchies, dimensions and facts. Eventually, we implement our merging
algorithms and validate them with the use of both synthetic and benchmark
datasets.
","[{'version': 'v1', 'created': 'Mon, 26 Jul 2021 09:24:44 GMT'}]",2021-07-27,"[['Yang', 'Yuzhao', '', 'IRIT-SIG'], ['Darmont', 'Jérôme', '', 'ERIC'], ['Ravat', 'Franck', '', 'IRIT-SIG'], ['Teste', 'Olivier', '', 'IRIT-SIG']]","['Multidimensional data warehouse', 'schema-instance merging', 'automatic integration']"
6919,2209.14756,Lukas Steiner,"Lukas Steiner, Matthias Jung, Michael Huonker, Norbert Wehn",Unveiling the Real Performance of LPDDR5 Memories,ACM/IEEE International Symposium on Memory Systems (MEMSYS 2022),,10.1145/3565053.3565062,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  LPDDR5 is the latest low-power DRAM standard and expected to be used in
various application fields. The vendors have published promising peak
bandwidths up to 50 % higher than those of the predecessor LPDDR4. In this
paper we evaluate the best-case and worst-case real bandwidth utilization of
different LPDDR5 configurations and compare the results to corresponding LPDDR4
configurations. We also show that an upgrade from LPDDR4 to LPDDR5 does not
always bring a bandwidth advantage and that some LPDDR5 configurations should
be avoided for specific workloads.
","[{'version': 'v1', 'created': 'Wed, 28 Sep 2022 11:39:14 GMT'}]",2022-10-03,"[['Steiner', 'Lukas', ''], ['Jung', 'Matthias', ''], ['Huonker', 'Michael', ''], ['Wehn', 'Norbert', '']]","['LPDDR5', 'LPDDR4', 'DRAM', 'Bandwidth']"
6920,2212.05556,Devansh Saxena,Devansh Saxena,"Designing Human-Centered Algorithms for the Public Sector: A Case Study
  of the U.S. Child-Welfare System",,,10.1145/3565967.3571759,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The U.S. Child Welfare System (CWS) is increasingly seeking to emulate
business models of the private sector centered in efficiency, cost reduction,
and innovation through the adoption of algorithms. These data-driven systems
purportedly improve decision-making, however, the public sector poses its own
set of challenges with respect to the technical, theoretical, cultural, and
societal implications of algorithmic decision-making. To fill these gaps, my
dissertation comprises four studies that examine: 1) how caseworkers interact
with algorithms in their day-to-day discretionary work, 2) the impact of
algorithmic decision-making on the nature of practice, organization, and
street-level decision-making, 3) how casenotes can help unpack patterns of
invisible labor and contextualize decision-making processes, and 4) how
casenotes can help uncover deeper systemic constraints and risk factors that
are hard to quantify but directly impact families and street-level
decision-making. My goal for this research is to investigate systemic
disparities and design and develop algorithmic systems that are centered in the
theory of practice and improve the quality of human discretionary work. These
studies have provided actionable steps for human-centered algorithm design in
the public sector.
","[{'version': 'v1', 'created': 'Sun, 11 Dec 2022 17:53:11 GMT'}]",2022-12-13,"[['Saxena', 'Devansh', '']]","['algorithmic decision-making', 'discretion', 'bureaucracy', 'child-welfaresystem', 'computational narrative analysis']"
6921,2012.00936,Baiyang Chen,"Baiyang Chen, Xiaoliang Chen","MAUIL: Multi-level Attribute Embedding for Semi-supervised User Identity
  Linkage",Accepted by Information Sciences in Feb. 2022,,10.1016/j.ins.2022.02.023,,cs.SI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  User identity linkage (UIL) across social networks has recently attracted an
increasing amount of attention due to its significant research challenges and
practical value. Most of the existing methods use a single method to express
different types of attribute features. However, the simplex pattern can neither
cover the entire set of different attribute features nor capture the
higher-level semantic features in the attribute text. This paper establishes a
novel semisupervised model, namely the multilevel attribute embedding for
semisupervised user identity linkage (MAUIL), to seek the common user identity
across social networks. MAUIL includes two components: multilevel attribute
embedding and regularized canonical correlation analysis (RCCA)-based linear
projection. Specifically, the text attributes for each network are first
divided into three types: character-level, word-level, and topic-level
attributes. Second, unsupervised approaches are employed to extract the
corresponding three types of text attribute features, and user relationships
are embedded as a complimentary feature. All the resultant features are
combined to form the final representation of each user. Finally, target social
networks are projected into a common correlated space by RCCA with the help of
a small number of prematched user pairs. We demonstrate the superiority of the
proposed method over state-of-the-art methods through extensive experiments on
two real-world datasets.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2020 02:44:37 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Feb 2022 07:06:18 GMT'}]",2022-02-17,"[['Chen', 'Baiyang', ''], ['Chen', 'Xiaoliang', '']]","['Social network', 'user identity linkage', 'multi-level attributeembedding', 'canonical correlation analysis']"
6922,2204.06765,Binxu Wang,"Binxu Wang, Carlos R. Ponce",High-performance Evolutionary Algorithms for Online Neuron Control,"19 pages, 22 figures, 3 tables. Accepted as full paper to The Genetic
  and Evolutionary Computation Conference 2022",,10.1145/3512290.3528725,,cs.NE cs.CG cs.CV q-bio.NC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Recently, optimization has become an emerging tool for neuroscientists to
study neural code. In the visual system, neurons respond to images with graded
and noisy responses. Image patterns eliciting highest responses are diagnostic
of the coding content of the neuron. To find these patterns, we have used
black-box optimizers to search a 4096d image space, leading to the evolution of
images that maximize neuronal responses. Although genetic algorithm (GA) has
been commonly used, there haven't been any systematic investigations to reveal
the best performing optimizer or the underlying principles necessary to improve
them.
  Here, we conducted a large scale in silico benchmark of optimizers for
activation maximization and found that Covariance Matrix Adaptation (CMA)
excelled in its achieved activation. We compared CMA against GA and found that
CMA surpassed the maximal activation of GA by 66% in silico and 44% in vivo. We
analyzed the structure of Evolution trajectories and found that the key to
success was not covariance matrix adaptation, but local search towards
informative dimensions and an effective step size decay. Guided by these
principles and the geometry of the image manifold, we developed SphereCMA
optimizer which competed well against CMA, proving the validity of the
identified principles. Code available at
https://github.com/Animadversio/ActMax-Optimizer-Dev
","[{'version': 'v1', 'created': 'Thu, 14 Apr 2022 05:49:04 GMT'}]",2022-04-15,"[['Wang', 'Binxu', ''], ['Ponce', 'Carlos R.', '']]","['visual neuroscience', 'differential geometry', 'activation maximization']"
6923,1710.04037,Pekka Abrahamsson,"Sohaib Shahid Bajwa, Xiaofeng Wang, Anh Nguyen Duc and Pekka
  Abrahamsson","Failures to be celebrated: an analysis of major pivots of software
  startups","This is the author's version of the work. Copyright owner's version
  can be accessed at
  https://link.springer.com/article/10.1007/s10664-016-9458-0",Empir Software Eng (2017) 22: 2373,10.1007/s10664-016-9458-0,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the context of software startups, project failure is embraced actively and
considered crucial to obtain validated learning that can lead to pivots. A
pivot is the strategic change of a business concept, product or the different
elements of a business model. A better understanding is needed on different
types of pivots and different factors that lead to failures and trigger pivots,
for software entrepreneurial teams to make better decisions under chaotic and
unpredictable environment. Due to the nascent nature of the topic, the existing
research and knowledge on the pivots of software startups are very limited. In
this study, we aimed at identifying the major types of pivots that software
startups make during their startup processes, and highlighting the factors that
fail software projects and trigger pivots. To achieve this, we conducted a case
survey study based on the secondary data of the major pivots happened in 49
software startups. 10 pivot types and 14 triggering factors were identified.
The findings show that customer need pivot is the most common among all pivot
types. Together with customer segment pivot, they are common market related
pivots. The major product related pivots are zoom-in and technology pivots.
Several new pivot types were identified, including market zoom-in, complete and
side project pivots. Our study also demonstrates that negative customer
reaction and flawed business model are the most common factors that trigger
pivots in software startups. Our study extends the research knowledge on
software startup pivot types and pivot triggering factors. Meanwhile it
provides practical knowledge to software startups, which they can utilize to
guide their effective decisions on pivoting
","[{'version': 'v1', 'created': 'Wed, 11 Oct 2017 12:40:22 GMT'}]",2017-10-12,"[['Bajwa', 'Sohaib Shahid', ''], ['Wang', 'Xiaofeng', ''], ['Duc', 'Anh Nguyen', ''], ['Abrahamsson', 'Pekka', '']]","['Pivot', 'Software startups', 'Lean startup', 'Validated learning', 'Pivoting factor']"
6924,1807.08169,Jibon Naher,"Matiur Rahman Minar, Jibon Naher",Recent Advances in Deep Learning: An Overview,31 pages including bibliography,,10.13140/RG.2.2.24831.10403,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep Learning is one of the newest trends in Machine Learning and Artificial
Intelligence research. It is also one of the most popular scientific research
trends now-a-days. Deep learning methods have brought revolutionary advances in
computer vision and machine learning. Every now and then, new and new deep
learning techniques are being born, outperforming state-of-the-art machine
learning and even existing deep learning techniques. In recent years, the world
has seen many major breakthroughs in this field. Since deep learning is
evolving at a huge speed, its kind of hard to keep track of the regular
advances especially for new researchers. In this paper, we are going to briefly
discuss about recent advances in Deep Learning for past few years.
","[{'version': 'v1', 'created': 'Sat, 21 Jul 2018 15:40:10 GMT'}]",2018-07-24,"[['Minar', 'Matiur Rahman', ''], ['Naher', 'Jibon', '']]","['Neural Networks', 'Machine Learning', 'Deep Learning', 'Recent Advances', 'Overview']"
6925,1803.10144,Vadim Markovtsev,Vadim Markovtsev and Waren Long,Public Git Archive: a Big Code dataset for all,,,10.1145/3196398.3196464,,cs.SE,http://creativecommons.org/licenses/by-sa/4.0/,"  The number of open source software projects has been growing exponentially.
The major online software repository host, GitHub, has accumulated tens of
millions of publicly available Git version-controlled repositories. Although
the research potential enabled by the available open source code is clearly
substantial, no significant large-scale open source code datasets exist. In
this paper, we present the Public Git Archive -- dataset of 182,014
top-bookmarked Git repositories from GitHub. We describe the novel data
retrieval pipeline to reproduce it. We also elaborate on the strategy for
performing dataset updates and legal issues. The Public Git Archive occupies
3.0 TB on disk and is an order of magnitude larger than the current source code
datasets. The dataset is made available through HTTP and provides the source
code of the projects, the related metadata, and development history. The data
retrieval pipeline employs an optimized worker queue model and an optimized
archive format to efficiently store forked Git repositories, reducing the
amount of data to download and persist. Public Git Archive aims to open a
myriad of new opportunities for ``Big Code`` research.
","[{'version': 'v1', 'created': 'Tue, 20 Mar 2018 18:10:26 GMT'}]",2018-03-28,"[['Markovtsev', 'Vadim', ''], ['Long', 'Waren', '']]","['source code', 'git', 'GitHub', 'software repositories', 'development history', 'open dataset']"
6926,2205.10312,Xiaoze Liu,"Yunjun Gao, Xiaoze Liu, Junyang Wu, Tianyi Li, Pengfei Wang, Lu Chen","ClusterEA: Scalable Entity Alignment with Stochastic Training and
  Normalized Mini-batch Similarities",KDD 2022,,10.1145/3534678.3539331,,cs.DB cs.AI cs.CL cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Entity alignment (EA) aims at finding equivalent entities in different
knowledge graphs (KGs). Embedding-based approaches have dominated the EA task
in recent years. Those methods face problems that come from the geometric
properties of embedding vectors, including hubness and isolation. To solve
these geometric problems, many normalization approaches have been adopted for
EA. However, the increasing scale of KGs renders it hard for EA models to adopt
the normalization processes, thus limiting their usage in real-world
applications. To tackle this challenge, we present ClusterEA, a general
framework that is capable of scaling up EA models and enhancing their results
by leveraging normalization methods on mini-batches with a high entity
equivalent rate. ClusterEA contains three components to align entities between
large-scale KGs, including stochastic training, ClusterSampler, and
SparseFusion. It first trains a large-scale Siamese GNN for EA in a stochastic
fashion to produce entity embeddings. Based on the embeddings, a novel
ClusterSampler strategy is proposed for sampling highly overlapped
mini-batches. Finally, ClusterEA incorporates SparseFusion, which normalizes
local and global similarity and then fuses all similarity matrices to obtain
the final similarity matrix. Extensive experiments with real-life datasets on
EA benchmarks offer insight into the proposed framework, and suggest that it is
capable of outperforming the state-of-the-art scalable EA framework by up to 8
times in terms of Hits@1.
","[{'version': 'v1', 'created': 'Fri, 20 May 2022 17:29:50 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Jun 2022 13:55:13 GMT'}]",2022-06-07,"[['Gao', 'Yunjun', ''], ['Liu', 'Xiaoze', ''], ['Wu', 'Junyang', ''], ['Li', 'Tianyi', ''], ['Wang', 'Pengfei', ''], ['Chen', 'Lu', '']]","['Entity Alignment', 'Knowledge Graph', 'Graph Neural Network']"
6927,2006.04975,Philippe Kruchten,Philippe Kruchten,Architectural Blueprints: The 4+1 View Model of Software Architecture,"Early draft, better quality than IEEE published version",,10.1109/52.469759,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents a model for describing the architecture of
software-intensive systems, based on the use of multiple, concurrent views.
This use of multiple views allows to address separately the concerns of the
various stakeholders of the architecture: end-user, developers, systems
engineers, project managers, etc., and to handle separately the functional and
non functional requirements. Each of the five views is described, together with
a notation to capture it. The views are designed using an
architecture-centered, scenario-driven, iterative development process.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2020 22:38:39 GMT'}]",2020-06-11,"[['Kruchten', 'Philippe', '']]","['software architecture', 'view', 'object-oriented design', 'software development process']"
6928,2108.06171,Juan Cante,"D. Roca, D. Yago, J. Cante, O. Lloberas-Valls, J. Oliver",Computational design of locally resonant acoustic metamaterials,,Comput. Methods Appl. Mech. Engrg. 2019,10.1016/j.cma.2018.10.037,,cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The so-called Locally Resonant Acoustic Metamaterials (LRAM) are considered
for the design of specifically engineered devices capable of stopping waves
from propagating in certain frequency regions (bandgaps), this making them
applicable for acoustic insulation purposes. This fact has inspired the design
of a new kind of lightweight acoustic insulation panels with the ability to
attenuate noise sources in the low frequency range (below 5000 Hz) without
requiring thick pieces of very dense materials. A design procedure based on
different computational mechanics tools, namely, (1) a multiscale
homogenization framework, (2) model order reduction strategies and (3)
topological optimization procedures, is proposed. It aims at attenuating sound
waves through the panel for a target set of resonance frequencies as well as
maximizing the associated bandgaps. The resulting design's performance is later
studied by introducing viscoelastic properties in the coating phase, in order
to both analyse their effects on the overall design and account for more
realistic behaviour. The study displays the emerging field of Computational
Material Design (CMD) as a computational mechanics area with enormous potential
for the design of metamaterial-based industrial acoustic parts.
","[{'version': 'v1', 'created': 'Fri, 13 Aug 2021 11:26:02 GMT'}]",2021-08-16,"[['Roca', 'D.', ''], ['Yago', 'D.', ''], ['Cante', 'J.', ''], ['Lloberas-Valls', 'O.', ''], ['Oliver', 'J.', '']]","['Multiscale modelling', 'Computational design', 'Topology optimization', 'Acoustic metamaterials']"
6929,2202.05328,Sam Tobin-Hochstadt,"Sarah Spall, Neil Mitchell, Sam Tobin-Hochstadt","Forward Build Systems, Formally","CPP 2022: Proceedings of the 11th ACM SIGPLAN International
  Conference on Certified Programs and Proofs",,10.1145/3497775.3503687,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Build systems are a fundamental part of software construction, but their
correctness has received comparatively little attention, relative to more
prominent parts of the toolchain. In this paper, we address the correctness of
\emph{forward build systems}, which automatically determine the dependency
structure of the build, rather than having it specified by the programmer.
  We first define what it means for a forward build system to be correct -- it
must behave identically to simply executing the programmer-specified commands
in order. Of course, realistic build systems avoid repeated work, stop early
when possible, and run commands in parallel, and we prove that these
optimizations, as embodied in the recent forward build system \textsc{Rattle},
preserve our definition of correctness. Along the way, we show that other
forward build systems, such as \textsc{Fabricate} and \textsc{Memoize}, are
also correct.
  We carry out all of our work in \Agda, and describe in detail the assumptions
underlying both \textsc{Rattle} itself and our modeling of it.
","[{'version': 'v1', 'created': 'Thu, 10 Feb 2022 21:11:03 GMT'}]",2022-02-14,"[['Spall', 'Sarah', ''], ['Mitchell', 'Neil', ''], ['Tobin-Hochstadt', 'Sam', '']]","['agda', 'build systems', 'concurrency', 'functional programming', 'program verification', 'systems', 'verified applications']"
6930,1905.00126,Vegard Antun,"Ben Adcock, Vegard Antun and Anders C. Hansen","Uniform recovery in infinite-dimensional compressed sensing and
  applications to structured binary sampling",,Appl. Comput. Harmon. Anal. 55 (2021) 1-40,10.1016/j.acha.2021.04.001,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Infinite-dimensional compressed sensing deals with the recovery of analog
signals (functions) from linear measurements, often in the form of integral
transforms such as the Fourier transform. This framework is well-suited to many
real-world inverse problems, which are typically modelled in
infinite-dimensional spaces, and where the application of finite-dimensional
approaches can lead to noticeable artefacts. Another typical feature of such
problems is that the signals are not only sparse in some dictionary, but
possess a so-called local sparsity in levels structure. Consequently, the
sampling scheme should be designed so as to exploit this additional structure.
In this paper, we introduce a series of uniform recovery guarantees for
infinite-dimensional compressed sensing based on sparsity in levels and
so-called multilevel random subsampling. By using a weighted
$\ell^1$-regularizer we derive measurement conditions that are sharp up to log
factors, in the sense they agree with those of certain oracle estimators. These
guarantees also apply in finite dimensions, and improve existing results for
unweighted $\ell^1$-regularization. To illustrate our results, we consider the
problem of binary sampling with the Walsh transform using orthogonal wavelets.
Binary sampling is an important mechanism for certain imaging modalities.
Through carefully estimating the local coherence between the Walsh and wavelet
bases, we derive the first known recovery guarantees for this problem.
","[{'version': 'v1', 'created': 'Tue, 30 Apr 2019 22:53:12 GMT'}]",2021-05-25,"[['Adcock', 'Ben', ''], ['Antun', 'Vegard', ''], ['Hansen', 'Anders C.', '']]","['Infinite-dimensional compressed sensing', 'uniform recovery', 'Walsh sampling', 'waveletrecovery', 'sparsity in levels', 'local coherence']"
6931,2103.01983,Steven Rodriguez,"Steven N. Rodriguez, Athanasios P. Iliopoulos, Kevin T. Carlberg,
  Steven L. Brunton, John C. Steuben, John G. Michopoulos",Projection-tree reduced order modeling for fast N-body computations,,,10.1016/j.jcp.2022.111141,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work presents a data-driven reduced-order modeling framework to
accelerate the computations of $N$-body dynamical systems and their pair-wise
interactions. The proposed framework differs from traditional acceleration
methods, like the Barnes-Hut method, which requires online tree building of the
state space, or the fast-multipole method, which requires rigorous $a$ $priori$
analysis of governing kernels and online tree building. Our approach combines
Barnes-Hut hierarchical decomposition, dimensional compression via the
least-squares Petrov-Galerkin (LSPG) projection, and hyper-reduction by way of
the Gauss-Newton with approximated tensor (GNAT) approach. The resulting
$projection-tree$ reduced order model (PTROM) enables a drastic reduction in
operational count complexity by constructing sparse hyper-reduced pairwise
interactions of the $N$-body dynamical system. As a result, the presented
framework is capable of achieving an operational count complexity that is
independent of $N$, the number of bodies in the numerical domain. Capabilities
of the PTROM method are demonstrated on the two-dimensional fluid-dynamic
Biot-Savart kernel within a parametric and reproductive setting. Results show
the PTROM is capable of achieving over 2000$\times$ wall-time speed-up with
respect to the full-order model, where the speed-up increases with $N$. The
resulting solution delivers quantities of interest with errors that are less
than 0.1$\%$ with respect to full-order model.
","[{'version': 'v1', 'created': 'Tue, 2 Mar 2021 19:04:17 GMT'}, {'version': 'v2', 'created': 'Mon, 17 May 2021 15:20:56 GMT'}]",2022-04-13,"[['Rodriguez', 'Steven N.', ''], ['Iliopoulos', 'Athanasios P.', ''], ['Carlberg', 'Kevin T.', ''], ['Brunton', 'Steven L.', ''], ['Steuben', 'John C.', ''], ['Michopoulos', 'John G.', '']]","['Reduced-order modeling', 'LSPG', 'GNAT', 'tree algorithms', 'Barnes–Hut', 'hyper-reduction']"
6932,1507.00389,Nasir Ahmad,"Nasir Ahmad, Sybil Derrible, Tarsha Eason and Heriberto Cabezas",Using Fisher Information In Big Data,,,10.1098/rsos.160582,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this era of Big Data, proficient use of data mining is the key to capture
useful information from any dataset. As numerous data mining techniques make
use of information theory concepts, in this paper, we discuss how Fisher
information (FI) can be applied to analyze patterns in Big Data. The main
advantage of FI is its ability to combine multiple variables together to inform
us on the overall trends and stability of a system. It can therefore detect
whether a system is losing dynamic order and stability, which may serve as a
signal of an impending regime shift. In this work, we first provide a brief
overview of Fisher information theory, followed by a simple step-by-step
numerical example on how to compute FI. Finally, as a numerical demonstration,
we calculate the evolution of FI for GDP per capita (current US Dollar) and
total population of the USA from 1960 to 2013.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2015 23:23:18 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Jul 2015 16:19:49 GMT'}]",2016-11-17,"[['Ahmad', 'Nasir', ''], ['Derrible', 'Sybil', ''], ['Eason', 'Tarsha', ''], ['Cabezas', 'Heriberto', '']]","['Fisher information', 'Data analysis', 'Big Data']"
6933,1708.00033,Vladimir Mironov,"Vladimir Mironov, Yuri Alexeev, Kristopher Keipert, Michael D'mello,
  Alexander Moskovsky, Mark S. Gordon","An efficient MPI/OpenMP parallelization of the Hartree-Fock method for
  the second generation of Intel Xeon Phi processor","SC17 conference paper, 12 pages, 7 figures",,10.1145/3126908.3126956,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern OpenMP threading techniques are used to convert the MPI-only
Hartree-Fock code in the GAMESS program to a hybrid MPI/OpenMP algorithm. Two
separate implementations that differ by the sharing or replication of key data
structures among threads are considered, density and Fock matrices. All
implementations are benchmarked on a super-computer of 3,000 Intel Xeon Phi
processors. With 64 cores per processor, scaling numbers are reported on up to
192,000 cores. The hybrid MPI/OpenMP implementation reduces the memory
footprint by approximately 200 times compared to the legacy code. The
MPI/OpenMP code was shown to run up to six times faster than the original for a
range of molecular system sizes.
","[{'version': 'v1', 'created': 'Mon, 31 Jul 2017 18:38:52 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Aug 2017 11:29:54 GMT'}]",2017-08-15,"[['Mironov', 'Vladimir', ''], ['Alexeev', 'Yuri', ''], ['Keipert', 'Kristopher', ''], [""D'mello"", 'Michael', ''], ['Moskovsky', 'Alexander', ''], ['Gordon', 'Mark S.', '']]","['Qantum chemistry', 'parallel Hartree-Fock', 'parallel Self ConsistentField', 'OpenMP', 'MPI', 'GAMESS']"
6934,cs/0309039,Valmir Barbosa,"V. C. Barbosa, C. A. G. Assis, J. O. do Nascimento",Two novel evolutionary formulations of the graph coloring problem,To appear in Journal of Combinatorial Optimization,"Journal of Combinatorial Optimization 8 (2004), 41-63",10.1023/B:JOCO.0000021937.26468.b2,ES-553/01,cs.NE,,"  We introduce two novel evolutionary formulations of the problem of coloring
the nodes of a graph. The first formulation is based on the relationship that
exists between a graph's chromatic number and its acyclic orientations. It
views such orientations as individuals and evolves them with the aid of
evolutionary operators that are very heavily based on the structure of the
graph and its acyclic orientations. The second formulation, unlike the first
one, does not tackle one graph at a time, but rather aims at evolving a
`program' to color all graphs belonging to a class whose members all have the
same number of nodes and other common attributes. The heuristics that result
from these formulations have been tested on some of the Second DIMACS
Implementation Challenge benchmark graphs, and have been found to be
competitive when compared to the several other heuristics that have also been
tested on those graphs.
","[{'version': 'v1', 'created': 'Tue, 23 Sep 2003 00:53:20 GMT'}]",2007-05-23,"[['Barbosa', 'V. C.', ''], ['Assis', 'C. A. G.', ''], ['Nascimento', 'J. O. do', '']]","['Graph coloring', 'evolutionary algorithms', 'genetic algorithms', 'genetic programming']"
6935,1909.02737,Haroldo Gambini Santos D.Sc.,"Janniele A.S.Araujo, Haroldo Gambini Santos, Bernard Gendron, Sanjay
  Dominik Jena, Samuel S.Brito, Danilo S.Souzaa","Strong Bounds for Resource Constrained Project Scheduling: Preprocessing
  and Cutting Planes",-,Computers & Operations Research (2019),10.1016/j.cor.2019.104782,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  Resource Constrained Project Scheduling Problems (RCPSPs) without preemption
are well-known NP-hard combinatorial optimization problems. A feasible RCPSP
solution consists of a time-ordered schedule of jobs with corresponding
execution modes, respecting precedence and resources constraints. In this
paper, we propose a cutting plane algorithm to separate five different cut
families, as well as a new preprocessing routine to strengthen resource-related
constraints. New lifted versions of the well-known precedence and cover
inequalities are employed. At each iteration, a dense conflict graph is built
considering feasibility and optimality conditions to separate cliques,
odd-holes and strengthened Chv\'atal-Gomory cuts. The proposed strategies
considerably improve the linear relaxation bounds, allowing a state-of-the-art
mixed-integer linear programming solver to find provably optimal solutions for
754 previously open instances of different variants of the RCPSPs, which was
not possible using the original linear programming formulations.
","[{'version': 'v1', 'created': 'Fri, 6 Sep 2019 07:02:36 GMT'}]",2019-09-09,"[['Araujo', 'Janniele A. S.', ''], ['Santos', 'Haroldo Gambini', ''], ['Gendron', 'Bernard', ''], ['Jena', 'Sanjay Dominik', ''], ['Brito', 'Samuel S.', ''], ['Souzaa', 'Danilo S.', '']]","['Resource Constrained Project Scheduling', 'Cutting Planes', 'Mixed-Integer Linear Programming', 'Preprocessing']"
6936,2110.00247,Mahieddine Djoudi,"Chabane Khentout, Khadidja Harbouche, Mahieddine Djoudi (TECHN\'E - EA
  6316)","Learner to learner fuzzy profiles similarity using a hybrid interaction
  analysis grid",,"Revue des Sciences et Technologies de l'Information - S{\'e}rie
  ISI : Ing{\'e}nierie des Syst{\`e}mes d'Information, Lavoisier, 2021, 26 (4),
  pp.375-386",10.18280/isi.260405,,cs.AI cs.IR cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The analysis of remote discussions is not yet at the same level as the
face-to-face ones. The present paper aspires twofold. On the one hand, it
attempts to establish a suitable environment of interaction and collaboration
among learners by using the speech acts via a semi structured synchronous
communication tool. On the other, it aims to define behavioral profiles and
interpersonal skills hybrid grid by matching the BALES' IPA and PLETY's
analysis system. By applying the fuzzy logic, we formalize human reasoning and,
thus, giving very appreciable flexibility to the reasoning that use it, which
makes it possible to take into account imprecisions and uncertainties. In
addition, the educational data mining techniques are used to optimize the
mapping of behaviors to learner's profile, with similarity-based clustering,
using Eros and PCA measures. In order to show the validity of our system, we
performed an experiment on real-world data. The results show, among others: (1)
the usefulness of fuzzy logic to properly translate the profile text
descriptions into a mathematical format, (2) an irregularity in the behavior of
the learners, (3) the correlation between the profiles, (4) the superiority of
Eros method to the PCA factor in precision.
","[{'version': 'v1', 'created': 'Fri, 1 Oct 2021 08:01:41 GMT'}]",2021-10-04,"[['Khentout', 'Chabane', '', 'TECHNÉ - EA\n  6316'], ['Harbouche', 'Khadidja', '', 'TECHNÉ - EA\n  6316'], ['Djoudi', 'Mahieddine', '', 'TECHNÉ - EA\n  6316']]","['BALES’ IPA', 'clustering', 'fuzzy logic', 'hybrid grid', 'multi variate time series', 'PLETY grid', 'principal component analysis', 'similarity measure']"
6937,2204.12793,Debayan Banerjee,"Debayan Banerjee, Pranav Ajit Nair, Jivat Neet Kaur, Ricardo Usbeck,
  Chris Biemann",Modern Baselines for SPARQL Semantic Parsing,"5 pages, short paper, SIGIR 2022",,10.1145/3477495.3531841,,cs.IR cs.CL,http://creativecommons.org/licenses/by/4.0/,"  In this work, we focus on the task of generating SPARQL queries from natural
language questions, which can then be executed on Knowledge Graphs (KGs). We
assume that gold entity and relations have been provided, and the remaining
task is to arrange them in the right order along with SPARQL vocabulary, and
input tokens to produce the correct SPARQL query. Pre-trained Language Models
(PLMs) have not been explored in depth on this task so far, so we experiment
with BART, T5 and PGNs (Pointer Generator Networks) with BERT embeddings,
looking for new baselines in the PLM era for this task, on DBpedia and Wikidata
KGs. We show that T5 requires special input tokenisation, but produces state of
the art performance on LC-QuAD 1.0 and LC-QuAD 2.0 datasets, and outperforms
task-specific models from previous works. Moreover, the methods enable semantic
parsing for questions where a part of the input needs to be copied to the
output query, thus enabling a new paradigm in KG semantic parsing.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2022 09:26:59 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Jul 2022 13:11:49 GMT'}]",2022-07-27,"[['Banerjee', 'Debayan', ''], ['Nair', 'Pranav Ajit', ''], ['Kaur', 'Jivat Neet', ''], ['Usbeck', 'Ricardo', ''], ['Biemann', 'Chris', '']]","['Knowledge Graph', 'Question Answering', 'Semantic Parsing', 'SPARQL']"
6938,2006.03179,Garrett Bingham,Garrett Bingham and Risto Miikkulainen,Discovering Parametric Activation Functions,"Published in Neural Networks. 34 pages, 10 figures, 11 tables","Neural Networks, Volume 148, 2022, Pages 48-65, ISSN 0893-6080",10.1016/j.neunet.2022.01.001,,cs.LG cs.CV cs.NE stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Recent studies have shown that the choice of activation function can
significantly affect the performance of deep learning networks. However, the
benefits of novel activation functions have been inconsistent and task
dependent, and therefore the rectified linear unit (ReLU) is still the most
commonly used. This paper proposes a technique for customizing activation
functions automatically, resulting in reliable improvements in performance.
Evolutionary search is used to discover the general form of the function, and
gradient descent to optimize its parameters for different parts of the network
and over the learning process. Experiments with four different neural network
architectures on the CIFAR-10 and CIFAR-100 image classification datasets show
that this approach is effective. It discovers both general activation functions
and specialized functions for different architectures, consistently improving
accuracy over ReLU and other activation functions by significant margins. The
approach can therefore be used as an automated optimization step in applying
deep learning to new tasks.
","[{'version': 'v1', 'created': 'Fri, 5 Jun 2020 00:25:33 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Oct 2020 15:33:14 GMT'}, {'version': 'v3', 'created': 'Tue, 8 Dec 2020 19:28:47 GMT'}, {'version': 'v4', 'created': 'Sat, 30 Jan 2021 02:17:20 GMT'}, {'version': 'v5', 'created': 'Fri, 21 Jan 2022 19:39:36 GMT'}]",2022-01-25,"[['Bingham', 'Garrett', ''], ['Miikkulainen', 'Risto', '']]","['Activation Functions', 'Evolutionary Computation', 'Gradient Descent', 'AutoML', 'DeepLearning']"
6939,2012.11808,Jiho Noh,"Jiho Noh, Ramakanth Kavuluru",Improved Biomedical Word Embeddings in the Transformer Era,"This paper has been accepted for publication in the Journal of
  Biomedical Informatics",,10.1016/j.jbi.2021.103867,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Biomedical word embeddings are usually pre-trained on free text corpora with
neural methods that capture local and global distributional properties. They
are leveraged in downstream tasks using various neural architectures that are
designed to optimize task-specific objectives that might further tune such
embeddings. Since 2018, however, there is a marked shift from these static
embeddings to contextual embeddings motivated by language models (e.g., ELMo,
transformers such as BERT, and ULMFiT). These dynamic embeddings have the added
benefit of being able to distinguish homonyms and acronyms given their context.
However, static embeddings are still relevant in low resource settings (e.g.,
smart devices, IoT elements) and to study lexical semantics from a
computational linguistics perspective. In this paper, we jointly learn word and
concept embeddings by first using the skip-gram method and further fine-tuning
them with correlational information manifesting in co-occurring Medical Subject
Heading (MeSH) concepts in biomedical citations. This fine-tuning is
accomplished with the BERT transformer architecture in the two-sentence input
mode with a classification objective that captures MeSH pair co-occurrence. In
essence, we repurpose a transformer architecture (typically used to generate
dynamic embeddings) to improve static embeddings using concept correlations. We
conduct evaluations of these tuned static embeddings using multiple datasets
for word relatedness developed by previous efforts. Without selectively culling
concepts and terms (as was pursued by previous efforts), we believe we offer
the most exhaustive evaluation of static embeddings to date with clear
performance improvements across the board. We provide our code and embeddings
for public use for downstream applications and research endeavors:
https://github.com/bionlproc/BERT-CRel-Embeddings
","[{'version': 'v1', 'created': 'Tue, 22 Dec 2020 03:03:50 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Dec 2020 16:19:09 GMT'}, {'version': 'v3', 'created': 'Fri, 23 Jul 2021 16:54:04 GMT'}]",2021-07-26,"[['Noh', 'Jiho', ''], ['Kavuluru', 'Ramakanth', '']]","['Word embeddings', 'fine-tuned embeddings', 'contextualized embeddings']"
6940,2201.01659,James Brusseau,James Brusseau,From the Ground Truth Up: Doing AI Ethics from Practice to Principles,,AI & Soc (2022),10.1007/s00146-021-01336-4,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Recent AI ethics has focused on applying abstract principles downward to
practice. This paper moves in the other direction. Ethical insights are
generated from the lived experiences of AI-designers working on tangible human
problems, and then cycled upward to influence theoretical debates surrounding
these questions: 1) Should AI as trustworthy be sought through explainability,
or accurate performance? 2) Should AI be considered trustworthy at all, or is
reliability a preferable aim? 3) Should AI ethics be oriented toward
establishing protections for users, or toward catalyzing innovation? Specific
answers are less significant than the larger demonstration that AI ethics is
currently unbalanced toward theoretical principles, and will benefit from
increased exposure to grounded practices and dilemmas.
","[{'version': 'v1', 'created': 'Wed, 5 Jan 2022 15:33:33 GMT'}]",2022-01-06,"[['Brusseau', 'James', '']]","['AI ethics', 'Trustworthy AI', 'Philosophy and AI', 'Healthcare AI', 'AI case studies']"
6941,2201.09242,Sandeep Patel,"Sandeep Kumar Patel, Avtar Singh",Task Scheduling in Cloud Computing Using Hybrid Meta-heuristic: A Review,,,10.1007/978-981-15-7533-4_35,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years with the advent of high bandwidth internet access
availability, the cloud computing applications have boomed. With more and more
applications being run over the cloud and an increase in the overall user base
of the different cloud platforms, the need for highly efficient job scheduling
techniques has also increased. The task of a conventional job scheduling
algorithm is to determine a sequence of execution for the jobs, which uses the
least resources like time, processing, memory, etc. Generally, the user
requires more services and very high efficiency. An efficient scheduling
technique helps in proper utilization of the resources. In this research realm,
the hybrid meta-heuristic algorithms have proven to be very effective in
optimizing the task scheduling by providing better cost efficiency than when
singly employed. This study presents a systematic and extensive analysis of
task scheduling techniques in cloud computing using the various hybrid variants
of meta-heuristic methods, like Genetic Algorithm, Tabu Search, Harmony Search,
Artificial Bee Colony, Particle Swarm Optimization, etc. In this research
review, a separate section discusses the use of various performance evaluation
metrics throughout the literature.
","[{'version': 'v1', 'created': 'Sun, 23 Jan 2022 12:20:21 GMT'}]",2022-01-25,"[['Patel', 'Sandeep Kumar', ''], ['Singh', 'Avtar', '']]","['Cloud Computing', 'Task Scheduling', 'Hybrid Meta-heuristic Approach', 'Genetic Algorithm', 'Harmony Search', 'Tabu Search', 'Performance Metrics']"
6942,1904.04985,Noa Garcia,"Noa Garcia, Benjamin Renoust, Yuta Nakashima",Context-Aware Embeddings for Automatic Art Analysis,,,10.1145/3323873.3325028,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic art analysis aims to classify and retrieve artistic representations
from a collection of images by using computer vision and machine learning
techniques. In this work, we propose to enhance visual representations from
neural networks with contextual artistic information. Whereas visual
representations are able to capture information about the content and the style
of an artwork, our proposed context-aware embeddings additionally encode
relationships between different artistic attributes, such as author, school, or
historical period. We design two different approaches for using context in
automatic art analysis. In the first one, contextual data is obtained through a
multi-task learning model, in which several attributes are trained together to
find visual relationships between elements. In the second approach, context is
obtained through an art-specific knowledge graph, which encodes relationships
between artistic attributes. An exhaustive evaluation of both of our models in
several art analysis problems, such as author identification, type
classification, or cross-modal retrieval, show that performance is improved by
up to 7.3% in art classification and 37.24% in retrieval when context-aware
embeddings are used.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2019 02:37:49 GMT'}]",2019-04-11,"[['Garcia', 'Noa', ''], ['Renoust', 'Benjamin', ''], ['Nakashima', 'Yuta', '']]","['art classification', 'multi-modal retrieval', 'knowledge graphs']"
6943,2205.01573,Yasith Jayawardana,"Yasith Jayawardana, Vikas G. Ashok, Sampath Jayarathna",StreamingHub: Interactive Stream Analysis Workflows,Code Repository at https://github.com/nirdslab/streaminghub,,10.1145/3529372.3530936,,cs.DB cs.DL cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Reusable data/code and reproducible analyses are foundational to quality
research. This aspect, however, is often overlooked when designing interactive
stream analysis workflows for time-series data (e.g., eye-tracking data). A
mechanism to transmit informative metadata alongside data may allow such
workflows to intelligently consume data, propagate metadata to downstream
tasks, and thereby auto-generate reusable, reproducible analytic outputs with
zero supervision. Moreover, a visual programming interface to design, develop,
and execute such workflows may allow rapid prototyping for interdisciplinary
research. Capitalizing on these ideas, we propose StreamingHub, a framework to
build metadata propagating, interactive stream analysis workflows using visual
programming. We conduct two case studies to evaluate the generalizability of
our framework. Simultaneously, we use two heuristics to evaluate their
computational fluidity and data growth. Results show that our framework
generalizes to multiple tasks with a minimal performance overhead.
","[{'version': 'v1', 'created': 'Sun, 1 May 2022 04:35:46 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Jun 2022 06:47:27 GMT'}]",2022-06-20,"[['Jayawardana', 'Yasith', ''], ['Ashok', 'Vikas G.', ''], ['Jayarathna', 'Sampath', '']]","['Interactive Stream Analysis', 'Scientific Workflows', 'Metadata']"
6944,2208.13520,Jamal El-Ouahi,Jamal El-Ouahi and Vincent Lariviere,On the lack of women researchers in the Middle East & North Africa,"29 pages, 11 figures, 4 tables",,10.21203/rs.3.rs-1990618/v1,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Recent gender policies in the Middle East and North Africa (MENA) region have
improved legal equality for women with noticeable effects in some countries.
The implications of these policies on science, however, is not well-understood.
This study applies a bibliometric lens to describe the landscape of gender
disparities in scientific research in MENA. Specifically, we examine 1.7
million papers indexed in the Web of Science published by 1.1 million authors
from MENA between 2008 and 2020. We used bibliometric indicators to analyse
potential disparities between men and women in the share of authors, research
productivity, and seniority in authorship. The results show that gender parity
is far from being achieved in MENA. Overall, men authors obtain higher
representation, research productivity, and seniority. But some countries
standout: Tunisia, Lebanon, Turkey, Algeria and Egypt have higher shares or
women researchers compared to the rest of MENA countries. The UAE, Qatar, and
Jordan have shown progress in terms of women participation in science, but
Saudi Arabia lags behind. We find that women are more likely to stop publishing
than men and that men publish on average between 11% and 51% more than women,
with this gap increasing over time. Finally, men, on average, achieved senior
positions in authorship faster than women. Our longitudinal study contributes
to a better understanding of gender disparities in science in MENA which is
catching up in terms of policy engagement and women representation. However,
the results suggest that the effects of the policy changes have yet to
materialize into distinct improvement in women's participation and performance
in science.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2022 11:50:55 GMT'}, {'version': 'v2', 'created': 'Mon, 5 Sep 2022 13:43:14 GMT'}]",2022-09-07,"[['El-Ouahi', 'Jamal', ''], ['Lariviere', 'Vincent', '']]","['Gender', 'authorship', 'career', 'bibliometrics', 'Middle East and North Africa']"
6945,2201.08679,Rog\'erio Rossi,Rogerio Rossi and Kechi Hirama,Strategic Issues on Implementing a Software Process Improvement Program,"InSITE Conference - Tampa, USA - 2015",,10.28945/2193,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Software technology has high impact on the global economy as in many sectors
of contemporary society. As a product enabling the most varied daily
activities, the software product has to be produced reflecting high quality.
Software quality is dependent on its development that is based in a large set
of software development processes. However, the implementation and continuous
improvement of software process aimed at software product should be carefully
institutionalized by software development organizations such as software
factories, testing factories, V&V organizations, among others. The
institutionalization of programs such as a Software Process Improvement
Program, or SPI Program, require a strategic planning, which is addressed in
this article from the perspective of specific models and frameworks, as well as
reflections based on software process engineering models and standards. In
addition, a set of strategic drivers is proposed to assist the implementation
of a Strategic Plan for a SPI Program which can be considered by the
organizations before starting this kind of Program.
","[{'version': 'v1', 'created': 'Sat, 15 Jan 2022 23:20:22 GMT'}]",2022-01-24,"[['Rossi', 'Rogerio', ''], ['Hirama', 'Kechi', '']]","['Software Technology', 'Software Process Improvement', 'Strategic Planning', 'Strategic Drivers for Software Process Improvement']"
6946,1906.11416,Shizhan Lu,Shizhan Lu,Clustering by the way of atomic fission,"9 pages, 3 figures",IEEE ACCESS 2020,10.1109/ACCESS.2020.2987345,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cluster analysis which focuses on the grouping and categorization of similar
elements is widely used in various fields of research. Inspired by the
phenomenon of atomic fission, a novel density-based clustering algorithm is
proposed in this paper, called fission clustering (FC). It focuses on mining
the dense families of a dataset and utilizes the information of the distance
matrix to fissure clustering dataset into subsets. When we face the dataset
which has a few points surround the dense families of clusters, K-nearest
neighbors local density indicator is applied to distinguish and remove the
points of sparse areas so as to obtain a dense subset that is constituted by
the dense families of clusters. A number of frequently-used datasets were used
to test the performance of this clustering approach, and to compare the results
with those of algorithms. The proposed algorithm is found to outperform other
algorithms in speed and accuracy.
","[{'version': 'v1', 'created': 'Thu, 27 Jun 2019 03:05:13 GMT'}]",2020-04-28,"[['Lu', 'Shizhan', '']]","['Clustering', 'density-based', 'K-nearest neighbors']"
6947,2004.04351,Lan Chen,"Lan Chen, Juntao Ye, Xiaopeng Zhang",Multi-feature super-resolution network for cloth wrinkle synthesis,,JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 36(3): 478-493 May 2021,10.1007/s11390-021-1331-y,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing physical cloth simulators suffer from expensive computation and
difficulties in tuning mechanical parameters to get desired wrinkling
behaviors. Data-driven methods provide an alternative solution. It typically
synthesizes cloth animation at a much lower computational cost, and also
creates wrinkling effects that highly resemble the much controllable training
data. In this paper we propose a deep learning based method for synthesizing
cloth animation with high resolution meshes. To do this we first create a
dataset for training: a pair of low and high resolution meshes are simulated
and their motions are synchronized. As a result the two meshes exhibit similar
large-scale deformation but different small wrinkles. Each simulated mesh pair
are then converted into a pair of low and high resolution ""images"" (a 2D array
of samples), with each sample can be interpreted as any of three features: the
displacement, the normal and the velocity. With these image pairs, we design a
multi-feature super-resolution (MFSR) network that jointly train an upsampling
synthesizer for the three features. The MFSR architecture consists of two key
components: a sharing module that takes multiple features as input to learn
low-level representations from corresponding super-resolution tasks
simultaneously; and task-specific modules focusing on various high-level
semantics. Frame-to-frame consistency is well maintained thanks to the proposed
kinematics-based loss function. Our method achieves realistic results at high
frame rates: 12-14 times faster than traditional physical simulation. We
demonstrate the performance of our method with various experimental scenes,
including a dressed character with sophisticated collisions.
","[{'version': 'v1', 'created': 'Thu, 9 Apr 2020 03:37:57 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Jun 2021 09:27:46 GMT'}]",2021-08-29,"[['Chen', 'Lan', ''], ['Ye', 'Juntao', ''], ['Zhang', 'Xiaopeng', '']]","['cloth animation', 'deep learning', 'multi-feature', 'super-resolution', 'wrinkle synthesis']"
6948,2202.06069,Jayson Victoriano Mr.,"Harold R. Lucero, Jayson M. Victoriano, Jennifer T. Carpio and Paquito
  G. Fernando Jr","Assessment of E-Learning Readiness of Faculty Members and Students in
  the Government and Private Higher Education Institutions in the Philippines",,"International Journal of Computing Sciences Research (ISSN print:
  2546-0552; ISSN online: 2546-115X) Vol. 5, No. 1, pp. 398-406 August 1, 2020",10.25147/ijcsr.2017.001.1.48,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study seeks to determine the level of readiness of selected private and
government-managed colleges and universities in the Philippines. The study also
aims to determine if there's a significant difference in the level of readiness
between the private and government HEI's. In line with this, a
descriptive-comparative method was employed. A questionnaire from the works of
Aklaslan and Merca was utilized to determine the faculty members' and students'
status of their e-learning readiness, acceptance, training, technological
infrastructure, and tool awareness on the implementation of an e-learning
program. Weighted mean was used to determine the level of readiness while a
t-test was employed to determine if there is a significant difference between
results.
","[{'version': 'v1', 'created': 'Sat, 12 Feb 2022 13:55:17 GMT'}]",2022-02-15,"[['Lucero', 'Harold R.', ''], ['Victoriano', 'Jayson M.', ''], ['Carpio', 'Jennifer T.', ''], ['Fernando', 'Paquito G.', 'Jr']]","['E-learning', 'assertion', 'implementation', 'SUC', 'HEI   INTRODUCTION']"
6949,2009.10524,Javad Hassannataj Joloudari,"Javad Hassannataj Joloudari, Mojtaba Haderbadi, Amir Mashmool,
  Mohammad GhasemiGol, Shahab S., Amir Mosavi","Early detection of the advanced persistent threat attack using
  performance analysis of deep learning","38 pages, 15 figures, 5 tables",,10.1109/ACCESS.2020.3029202,,cs.CR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the most common and important destructive attacks on the victim system
is Advanced Persistent Threat (APT)-attack. The APT attacker can achieve his
hostile goals by obtaining information and gaining financial benefits regarding
the infrastructure of a network. One of the solutions to detect a secret APT
attack is using network traffic. Due to the nature of the APT attack in terms
of being on the network for a long time and the fact that the network may crash
because of high traffic, it is difficult to detect this type of attack. Hence,
in this study, machine learning methods such as C5.0 decision tree, Bayesian
network and deep neural network are used for timely detection and
classification of APT-attacks on the NSL-KDD dataset. Moreover, 10-fold cross
validation method is used to experiment these models. As a result, the accuracy
(ACC) of the C5.0 decision tree, Bayesian network and 6-layer deep learning
models is obtained as 95.64%, 88.37% and 98.85%, respectively, and also, in
terms of the important criterion of the false positive rate (FPR), the FPR
value for the C5.0 decision tree, Bayesian network and 6-layer deep learning
models is obtained as 2.56, 10.47 and 1.13, respectively. Other criterions such
as sensitivity, specificity, accuracy, false negative rate and F-measure are
also investigated for the models, and the experimental results show that the
deep learning model with automatic multi-layered extraction of features has the
best performance for timely detection of an APT-attack comparing to other
classification models.
","[{'version': 'v1', 'created': 'Sat, 19 Sep 2020 19:27:35 GMT'}]",2021-01-19,"[['Joloudari', 'Javad Hassannataj', ''], ['Haderbadi', 'Mojtaba', ''], ['Mashmool', 'Amir', ''], ['GhasemiGol', 'Mohammad', ''], ['S.', 'Shahab', ''], ['Mosavi', 'Amir', '']]","['APT-attack', 'detection and classification', 'feature extraction', 'machine learning', 'C5']"
6950,2005.05359,Jianwei Wu,"Jianwei Wu, James Clause","A Pattern-based Approach to Detect and Improve Non-descriptive Test
  Names",Accepted by The Journal of Systems & Software,The Journal of Systems & Software 168C (2020) 110639,10.1016/j.jss.2020.110639,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Unit tests are an important artifact that supports the software development
process in several ways. For example, when a test fails, its name can provide
the first step towards understanding the purpose of the test. Unfortunately,
unit tests often lack descriptive names. In this paper, we propose a new,
pattern-based approach that can help developers improve the quality of test
names of JUnit tests by making them more descriptive. It does this by detecting
non-descriptive test names and in some cases, providing additional information
about how the name can be improved. Our approach was assessed using an
empirical evaluation on 34352 JUnit tests. The results of the evaluation show
that the approach is feasible, accurate, and useful at discriminating
descriptive and non-descriptive names with a 95% true-positive rate.
","[{'version': 'v1', 'created': 'Mon, 11 May 2020 18:08:35 GMT'}]",2020-05-20,"[['Wu', 'Jianwei', ''], ['Clause', 'James', '']]","['Software Testing', 'Software Quality', 'Documentation']"
6951,2211.06030,Joel Mackenzie,Alistair Moffat and Joel Mackenzie,Efficient Immediate-Access Dynamic Indexing,"Information Processing and Management, 2023. See:
  https://www.sciencedirect.com/science/article/pii/S0306457322003491 OR
  https://doi.org/10.1016/j.ipm.2022.103248",,10.1016/j.ipm.2022.103248,,cs.IR cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a dynamic retrieval system, documents must be ingested as they arrive, and
be immediately findable by queries. Our purpose in this paper is to describe an
index structure and processing regime that accommodates that requirement for
immediate access, seeking to make the ingestion process as streamlined as
possible, while at the same time seeking to make the growing index as small as
possible, and seeking to make term-based querying via the index as efficient as
possible. We describe a new compression operation and a novel approach to
extensible lists which together facilitate that triple goal. In particular, the
structure we describe provides incremental document-level indexing using as
little as two bytes per posting and only a small amount more for word-level
indexing; provides fast document insertion; supports immediate and continuous
queryability; provides support for fast conjunctive queries and similarity
score-based ranked queries; and facilitates fast conversion of the dynamic
index to a ""normal"" static compressed inverted index structure. Measurement of
our new mechanism confirms that in-memory dynamic document-level indexes for
collections into the gigabyte range can be constructed at a rate of two
gigabytes/minute using a typical server architecture, that multi-term
conjunctive Boolean queries can be resolved in just a few milliseconds each on
average even while new documents are being concurrently ingested, and that the
net memory space required for all of the required data structures amounts to an
average of as little as two bytes per stored posting, less than half the space
required by the best previous mechanism.
","[{'version': 'v1', 'created': 'Fri, 11 Nov 2022 07:00:53 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Jan 2023 01:41:29 GMT'}]",2023-01-12,"[['Moffat', 'Alistair', ''], ['Mackenzie', 'Joel', '']]","['Information retrieval', 'web search', 'index construction', 'index compression', 'querying']"
6952,2109.13306,Ouahiba Djama,Ouahiba Djama,"Introducing the viewpoint in the resource description using machine
  learning","12 pages, 3 figures, CSITY 2021 conference","David C. Wyld: CSITY, NWCOM, SIGPRO, ASOFT, AIFZ, BDIoT, ITCCMA,
  CLSB, DTMN, MLNLP - 2021. pp. 01-12, 2021. CS & IT - CSCP 2021",10.5121/csit.2021.111401,,cs.LG cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Search engines allow providing the user with data information according to
their interests and specialty. Thus, it is necessary to exploit descriptions of
the resources, which take into consideration viewpoints. Generally, the
resource descriptions are available in RDF (e.g., DBPedia of Wikipedia
content). However, these descriptions do not take into consideration
viewpoints. In this paper, we propose a new approach, which allows converting a
classic RDF resource description to a resource description that takes into
consideration viewpoints. To detect viewpoints in the document, a machine
learning technique will be exploited on an instanced ontology. This latter
allows representing the viewpoint in a given domain. An experimental study
shows that the conversion of the classic RDF resource description to a resource
description that takes into consideration viewpoints, allows giving very
relevant responses to the user's requests.
","[{'version': 'v1', 'created': 'Mon, 27 Sep 2021 18:54:57 GMT'}]",2021-09-29,"[['Djama', 'Ouahiba', '']]","['Resource Description', 'RDF', 'Viewpoint', 'Ontology & Machine Learning']"
6953,2107.11280,Chuangjie Xu,"Serdar Erbatur, Ulrich Sch\""opp, Chuangjie Xu",Type-based Enforcement of Infinitary Trace Properties for Java,"main part (14 pages) published at PPDP'21; arXiv version contains an
  appendix on the FJ operational semantics and the extension to support
  exception handling (15 pages total)",,10.1145/3479394.3479413,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A common approach to improve software quality is to use programming
guidelines to avoid common kinds of errors. In this paper, we consider the
problem of enforcing guidelines for Featherweight Java (FJ). We formalize
guidelines as sets of finite or infinite execution traces and develop a
region-based type and effect system for FJ that can enforce such guidelines. We
build on the work by Erbatur, Hofmann and Z\u{a}linescu, who presented a type
system for verifying the finite event traces of terminating FJ programs. We
refine this type system, separating region typing from FJ typing, and use ideas
of Hofmann and Chen to extend it to capture also infinite traces produced by
non-terminating programs. Our type and effect system can express properties of
both finite and infinite traces and can compute information about the possible
infinite traces of FJ programs. Specifically, the set of infinite traces of a
method is constructed as the greatest fixed point of the operator which
calculates the possible traces of method bodies. Our type inference algorithm
is realized by working with the finitary abstraction of the system based on
B\""uchi automata.
","[{'version': 'v1', 'created': 'Fri, 23 Jul 2021 14:45:46 GMT'}]",2022-09-09,"[['Erbatur', 'Serdar', ''], ['Schöpp', 'Ulrich', ''], ['Xu', 'Chuangjie', '']]","['program analysis', 'Featherweight Java', 'effect types', 'region types', 'abstract interpretation', 'Büchi automata']"
6954,2004.06277,Peter Vamplew,"Peter Vamplew, Cameron Foale and Richard Dazeley","A Demonstration of Issues with Value-Based Multiobjective Reinforcement
  Learning Under Stochastic State Transitions","6 pages. Accepted for presentation in the Adaptive and Learning
  Agents Workshop, AAMAS 2020","The impact of environmental stochasticity on value-based
  multiobjective reinforcement learning, Neural Computing and Applications,
  2021",10.1007/s00521-021-05859-1,,cs.LG cs.MA stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We report a previously unidentified issue with model-free, value-based
approaches to multiobjective reinforcement learning in the context of
environments with stochastic state transitions. An example multiobjective
Markov Decision Process (MOMDP) is used to demonstrate that under such
conditions these approaches may be unable to discover the policy which
maximises the Scalarised Expected Return, and in fact may converge to a
Pareto-dominated solution. We discuss several alternative methods which may be
more suitable for maximising SER in MOMDPs with stochastic transitions.
","[{'version': 'v1', 'created': 'Tue, 14 Apr 2020 02:55:12 GMT'}]",2021-03-16,"[['Vamplew', 'Peter', ''], ['Foale', 'Cameron', ''], ['Dazeley', 'Richard', '']]","['multiobjective reinforcement learning', 'multiobjective MDPs', 'stochastic MDPs']"
6955,2012.01832,Hiya Roy,"Hiya Roy, Subhajit Chaudhury, Toshihiko Yamasaki, Tatsuaki Hashimoto",Image inpainting using frequency domain priors,,,10.1117/1.JEI.30.2.023016,,cs.CV eess.IV,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we present a novel image inpainting technique using frequency
domain information. Prior works on image inpainting predict the missing pixels
by training neural networks using only the spatial domain information. However,
these methods still struggle to reconstruct high-frequency details for real
complex scenes, leading to a discrepancy in color, boundary artifacts,
distorted patterns, and blurry textures. To alleviate these problems, we
investigate if it is possible to obtain better performance by training the
networks using frequency domain information (Discrete Fourier Transform) along
with the spatial domain information. To this end, we propose a frequency-based
deconvolution module that enables the network to learn the global context while
selectively reconstructing the high-frequency components. We evaluate our
proposed method on the publicly available datasets CelebA, Paris Streetview,
and DTD texture dataset, and show that our method outperforms current
state-of-the-art image inpainting techniques both qualitatively and
quantitatively.
","[{'version': 'v1', 'created': 'Thu, 3 Dec 2020 11:08:13 GMT'}]",2021-07-14,"[['Roy', 'Hiya', ''], ['Chaudhury', 'Subhajit', ''], ['Yamasaki', 'Toshihiko', ''], ['Hashimoto', 'Tatsuaki', '']]","['Image inpainting', 'Frequency domain analysis', 'neural networks', 'machine learning', 'Generative AdversarialNetworks']"
6956,1904.06258,Saeed Ghoorchian,"Saeed Ghoorchian, Setareh Maghsudi","Multi-Armed Bandit for Energy-Efficient and Delay-Sensitive Edge
  Computing in Dynamic Networks with Uncertainty","30 pages, 7 figures",,10.1109/TCCN.2020.3012445,,cs.LG eess.SP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the edge computing paradigm, mobile devices offload the computational
tasks to an edge server by routing the required data over the wireless network.
The full potential of edge computing becomes realized only if a smart device
selects the most appropriate server in terms of the latency and energy
consumption, among many available ones. The server selection problem is
challenging due to the randomness of the environment and lack of prior
information about the environment. Therefore, a smart device, which
sequentially chooses a server under uncertainty, aims to improve its decision
based on the historical time and energy consumption. The problem becomes more
complicated in a dynamic environment, where key variables might undergo abrupt
changes. To deal with the aforementioned problem, we first analyze the required
time and energy to data transmission and processing. We then use the analysis
to cast the problem as a budget-limited multi-armed bandit problem, where each
arm is associated with a reward and cost, with time-variant statistical
characteristics. We propose a policy to solve the formulated problem and prove
a regret bound. The numerical results demonstrate the superiority of the
proposed method compared to a number of existing solutions.
","[{'version': 'v1', 'created': 'Fri, 12 Apr 2019 14:46:20 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Dec 2019 17:53:24 GMT'}]",2020-08-25,"[['Ghoorchian', 'Saeed', ''], ['Maghsudi', 'Setareh', '']]","['Computation offloading', 'edge computing', 'multi-armed bandits', 'uncertainty']"
6957,2005.04750,Anup Das,"Shihao Song, Anup Das, Nagarajan Kandasamy","Exploiting Inter- and Intra-Memory Asymmetries for Data Mapping in
  Hybrid Tiered-Memories","15 pages, 29 figures, accepted at ACM SIGPLAN International Symposium
  on Memory Management",,10.1145/3381898.3397215,,cs.AR cs.OS,http://creativecommons.org/licenses/by/4.0/,"  Modern computing systems are embracing hybrid memory comprising of DRAM and
non-volatile memory (NVM) to combine the best properties of both memory
technologies, achieving low latency, high reliability, and high density. A
prominent characteristic of DRAM-NVM hybrid memory is that it has NVM access
latency much higher than DRAM access latency. We call this inter-memory
asymmetry. We observe that parasitic components on a long bitline are a major
source of high latency in both DRAM and NVM, and a significant factor
contributing to high-voltage operations in NVM, which impact their reliability.
We propose an architectural change, where each long bitline in DRAM and NVM is
split into two segments by an isolation transistor. One segment can be accessed
with lower latency and operating voltage than the other. By introducing tiers,
we enable non-uniform accesses within each memory type (which we call
intra-memory asymmetry), leading to performance and reliability trade-offs in
DRAM-NVM hybrid memory. We extend existing NVM-DRAM OS in three ways. First, we
exploit both inter- and intra-memory asymmetries to allocate and migrate memory
pages between the tiers in DRAM and NVM. Second, we improve the OS's page
allocation decisions by predicting the access intensity of a newly-referenced
memory page in a program and placing it to a matching tier during its initial
allocation. This minimizes page migrations during program execution, lowering
the performance overhead. Third, we propose a solution to migrate pages between
the tiers of the same memory without transferring data over the memory channel,
minimizing channel occupancy and improving performance. Our overall approach,
which we call MNEME, to enable and exploit asymmetries in DRAM-NVM hybrid
tiered memory improves both performance and reliability for both single-core
and multi-programmed workloads.
","[{'version': 'v1', 'created': 'Sun, 10 May 2020 18:53:02 GMT'}]",2020-05-12,"[['Song', 'Shihao', ''], ['Das', 'Anup', ''], ['Kandasamy', 'Nagarajan', '']]","['phase change memory (PCM)', 'DRAM', 'tieredmemory', 'bitline parasitic', 'hybrid memory', 'non volatile memory (NVM)', 'NBTI', 'endurance']"
6958,1907.01921,Justin Edwards,"Allison Perrone, Justin Edwards",Chatbots as Unwitting Actors,,,10.1145/3342775.3342799,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Chatbots are popular for both task-oriented conversations and unstructured
conversations with web users. Several different approaches to creating comedy
and art exist across the field of computational creativity. Despite the
popularity and ease of use of chatbots, there have not been any attempts by
artists or comedians to use these systems for comedy performances. We present
two initial attempts to do so from our comedy podcast and call for future work
toward both designing chatbots for performance and for performing alongside
chatbots.
","[{'version': 'v1', 'created': 'Wed, 3 Jul 2019 13:10:10 GMT'}]",2019-07-04,"[['Perrone', 'Allison', ''], ['Edwards', 'Justin', '']]","['chatbots', 'performance', 'comedy', 'performing arts', 'computational creativity']"
6959,2008.01516,"Christoph B\""ohm","Christoph B\""ohm (1), Bla\v{z} Hudobivnik (1), Michele Marino (1 and
  2), Peter Wriggers (1) ((1) Institute of Continuum Mechanics, Leibniz
  University Hanover, Garbsen, Germany, (2) Dep. of Civil Eng. and Computer
  Science, University Rome Tor Vergata, Rome, Italy)","Electro-magneto-mechanically response of polycrystalline materials:
  Computational Homogenization via the Virtual Element Method",,,10.1016/j.cma.2021.113775,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work presents a study on the computational homogenization of
electro-magneto-mechanically coupled problems through the Virtual Element
Method (VEM). VE-approaches have great potential for the homogenization of the
physical properties of heterogeneous polycrystalline microstructures with
anisotropic grains. The flexibility in element shapes can be exploited for
creating VE-mesh with a significant lower number of degrees of freedom if
compared to finite element (FE) meshes, while maintaining a high accuracy.
Evidence that VE-approaches outperform FEM are available in the literature, but
only addressing purely-mechanic problems (i.e. elastic properties) and
transversely anisotropic materials. The aim of this work is twofold. On one
hand, the study compares VE-and FE-based numerical homogenization schemes for
electro-mechanically coupled problems for different crystal lattice structures
and degrees of elastic anisotropy. Within all considered materials, the
VE-approach outperforms the FE-approach for the same number of nodes. On the
other hand a hybrid microstructure made up by both electro-mechanical and
magneto-mechanical grains is investigated resulting in a
electro-magneto-mechanically coupled microstructure. Again, VEM provides a more
accurate solution strategy.
","[{'version': 'v1', 'created': 'Fri, 24 Jul 2020 13:38:42 GMT'}]",2021-04-07,"[['Böhm', 'Christoph', '', '1 and\n  2'], ['Hudobivnik', 'Blaž', '', '1 and\n  2'], ['Marino', 'Michele', '', '1 and\n  2'], ['Wriggers', 'Peter', '']]","['Computational Homogenization', 'Virtual Element Method (VEM)', 'Microstructure', 'Electro-Magneto-Mechanics']"
6960,1605.03152,Marcos Villagra,Benjamin Baran and Marcos Villagra,Multiobjective Optimization in a Quantum Adiabatic Computer,"11 pages, 3 figures. In v3, more typos were corrected. A shorter and
  preliminary version appeared in Proceedings of the 42nd Latin American
  Conference on Informatics (CLEI), Valparaiso, Chile",Axioms 2019,10.3390/axioms8010032,,cs.DS math.OC quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we present a quantum algorithm for multiobjective combinatorial
optimization. We show how to map a convex combination of objective functions
onto a Hamiltonian and then use that Hamiltonian to prove that the quantum
adiabatic algorithm of Farhi \emph{et al.} [arXiv:quant-ph/0001106] can find
Pareto-optimal solutions in finite time provided certain convex combinations of
objectives are used and the underlying multiobjective problem meets certain
restrictions.
","[{'version': 'v1', 'created': 'Tue, 10 May 2016 19:05:12 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Oct 2016 18:54:44 GMT'}, {'version': 'v3', 'created': 'Fri, 30 Jun 2017 18:42:23 GMT'}]",2020-03-25,"[['Baran', 'Benjamin', ''], ['Villagra', 'Marcos', '']]","['quantum computation', 'multiobjective optimization', 'quantum adiabatic evolution']"
6961,2106.07057,Avijit Ghosh,"Avijit Ghosh, Aalok Shanbhag, Christo Wilson",FairCanary: Rapid Continuous Explainable Fairness,"Accepted as a full paper at the 2022 AAAI/ACM Conference on AI,
  Ethics, and Society",,10.1145/3514094.3534157,,cs.LG cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Systems that offer continuous model monitoring have emerged in response to
(1) well-documented failures of deployed Machine Learning (ML) and Artificial
Intelligence (AI) models and (2) new regulatory requirements impacting these
models. Existing monitoring systems continuously track the performance of
deployed ML models and compute feature importance (a.k.a. explanations) for
each prediction to help developers identify the root causes of emergent model
performance problems.
  We present Quantile Demographic Drift (QDD), a novel model bias
quantification metric that uses quantile binning to measure differences in the
overall prediction distributions over subgroups. QDD is ideal for continuous
monitoring scenarios, does not suffer from the statistical limitations of
conventional threshold-based bias metrics, and does not require outcome labels
(which may not be available at runtime). We incorporate QDD into a continuous
model monitoring system, called FairCanary, that reuses existing explanations
computed for each individual prediction to quickly compute explanations for the
QDD bias metrics. This optimization makes FairCanary an order of magnitude
faster than previous work that has tried to generate feature-level bias
explanations.
","[{'version': 'v1', 'created': 'Sun, 13 Jun 2021 17:47:44 GMT'}, {'version': 'v2', 'created': 'Thu, 26 May 2022 21:07:02 GMT'}, {'version': 'v3', 'created': 'Mon, 30 May 2022 20:38:42 GMT'}]",2022-06-01,"[['Ghosh', 'Avijit', ''], ['Shanbhag', 'Aalok', ''], ['Wilson', 'Christo', '']]","['fairness', 'drift', 'model explanation', 'continuous measurement']"
6962,2009.14285,Manasi Mohandas,"Gaganjeet Reen, Manasi Mohandas and S Venkatesan","Decentralized Patient Centric e-Health Record Management System using
  Blockchain and IPFS",,"2019 IEEE Conference on Information and Communication Technology,
  Allahabad, India, 2019, pp. 1-7",10.1109/CICT48419.2019.9066212,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Electronic Health Records(EHR) are gaining a lot of popularity all over the
world. The current EHR systems however have their fair share of problems
related to privacy and security. We have proposed a mechanism which provides a
solution to most of these problems. Using a permissioned Ethereum blockchain
allows the hospitals and patients across the world to be connected to each
other. Our mechanism uses a combination of symmetric and asymmetric key
cryptography to ensure the secure storage and selective access of records. It
gives patients full control over their health records and also allows them to
grant or revoke a hospital's access to his/her records. We have used IPFS(inter
planetary file system) to store records which has the advantage of being
distributed and ensures immutability of records. The proposed model also
maintains the statistics of diseases without violating the privacy of any
patient.
","[{'version': 'v1', 'created': 'Tue, 29 Sep 2020 19:54:58 GMT'}]",2020-10-01,"[['Reen', 'Gaganjeet', ''], ['Mohandas', 'Manasi', ''], ['Venkatesan', 'S', '']]","['Blockchain', 'IPFS', 'e-Health Records', 'DecentralizedStorage']"
6963,1803.09401,Anik Islam,"Anik Islam, Arifa Akter and Bayzid Ashik Hossain","HomeGuard: A Smart System to Deal with the Emergency Response of
  Domestic Violence Victims","10 pages, 5 figures, 2016 International Journal of Computer Science
  Issues",,10.20943/01201606.103112,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Domestic violence is a silent crisis in the developing and underdeveloped
countries, though developed countries also remain drowned in the curse of it.
In developed countries, victims can easily report and ask help on the contrary
in developing and underdeveloped countries victims hardly report the crimes and
when it's noticed by the authority it's become too late to save or support the
victim. If this kind of problems can be identified at the very beginning of the
event and proper actions can be taken, it'll not only help the victim but also
reduce the domestic violence crimes. This paper proposed a smart system which
can extract victim's situation and provide help according to it. Among of the
developing and underdeveloped countries Bangladesh has been chosen though the
rate of reporting of domestic violence is low, the extreme report collected by
authorities is too high. Case studies collected by different NGO's relating to
domestic violence have been studied and applied to extract possible condition
for the victims.
","[{'version': 'v1', 'created': 'Mon, 26 Mar 2018 03:45:56 GMT'}]",2018-03-28,"[['Islam', 'Anik', ''], ['Akter', 'Arifa', ''], ['Hossain', 'Bayzid Ashik', '']]","['Natural language processing', 'Ontology', 'Domestic violence', 'Emergency', 'Intelligent system', 'Semantic web']"
6964,2111.08684,Amber Horvath,"Amber Horvath, Michael Xieyang Liu, River Hendriksen, Connor Shannon,
  Emma Paterson, Kazi Jawad, Andrew Macvean, Brad A. Myers",Understanding How Programmers Can Use Annotations on Documentation,Conditionally accepted for publication at CHI '22,,10.1145/3491102.3502095,,cs.HC cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Modern software development requires developers to find and effectively
utilize new APIs and their documentation, but documentation has many well-known
issues. Despite this, developers eventually overcome these issues but have no
way of sharing what they learned. We investigate sharing this
documentation-specific information through \textit{annotations}, which have
advantages over developer forums as the information is contextualized, not
disruptive, and is short, thus easy to author. Developers can also author
annotations to support their own comprehension. In order to support the
documentation usage behaviors we found, we built the Adamite annotation tool,
which supports features such as multi-anchoring, annotation types, and pinning.
In our user study, we found that developers are able to create annotations that
are useful to themselves and are able to utilize annotations created by other
developers when learning a new API, with readers of the annotations completing
67% more of the task, on average, than the baseline.
","[{'version': 'v1', 'created': 'Tue, 16 Nov 2021 18:38:55 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Jan 2022 13:48:33 GMT'}]",2022-01-12,"[['Horvath', 'Amber', ''], ['Liu', 'Michael Xieyang', ''], ['Hendriksen', 'River', ''], ['Shannon', 'Connor', ''], ['Paterson', 'Emma', ''], ['Jawad', 'Kazi', ''], ['Macvean', 'Andrew', ''], ['Myers', 'Brad A.', '']]","['Annotations', 'software engineering', 'application programming interfaces (APIs)', 'documentation', 'note taking']"
6965,2010.04276,Curtis Bahn,Curtis Bahn and Dan Trueman,interface : Electronic Chamber Ensemble,"Proceedings of the International Conference on New Interfaces for
  Musical Expression, 2001",,10.5281/zenodo.1176355,,cs.HC cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  This paper presents the interface developments and music of the duo
""interface,"" formed by Curtis Bahn and Dan Trueman. We describe gestural
instrument design, interactive performance interfaces for improvisational
music, spherical speakers (multi-channel, outward-radiating geodesic speaker
arrays) and Sensor-Speaker-Arrays (SenSAs: combinations of various sensor
devices with spherical speaker arrays). We discuss the concept, design and
construction of these systems, and, give examples from several newly published
CDs of work by Bahn and Trueman.
","[{'version': 'v1', 'created': 'Thu, 8 Oct 2020 21:57:52 GMT'}]",2020-10-12,"[['Bahn', 'Curtis', ''], ['Trueman', 'Dan', '']]","['Interactive Music Performance', 'Gestural Interface', 'Sonic Display', 'Sensor/Speaker Array', 'SenSA']"
6966,2010.09625,Arliones Stevert Hoeller Junior,"J. M. de Souza Sant'Ana, A. Hoeller, R. D. Souza, H. Alves, S.
  Montejo-S\'anchez",LoRa Performance Analysis with Superposed Signal Decoding,"4 pages, 3 figures, IEEE Wireless Communication Letters",,10.1109/LWC.2020.3006588,,cs.IT cs.NI eess.SP math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the use of successive interference cancellation (SIC) to
decode superposed signals in Long Range (LoRa) networks. We build over a known
stochastic geometry model for LoRa networks and include the effect of
recovering colliding packets through SIC. We derive closed-form expressions for
the successful decoding of packets using SIC taking path loss, fading, noise,
and interference into account, while we validate the model by means of Monte
Carlo simulations. Results show that SIC-enabled LoRa networks improve
worst-case reliability by up to 34%. We show that, for at least one test
scenario, SIC increases by 159% the number of served users with the same
worst-case reliability level.
","[{'version': 'v1', 'created': 'Mon, 19 Oct 2020 16:06:04 GMT'}]",2020-10-20,"[[""Sant'Ana"", 'J. M. de Souza', ''], ['Hoeller', 'A.', ''], ['Souza', 'R. D.', ''], ['Alves', 'H.', ''], ['Montejo-Sánchez', 'S.', '']]","['Internet-of-Things', 'Stochastic Geometry', 'SuccessiveInterference Cancellation', 'LORAWAN']"
6967,2109.13656,Joel Ostblom,"Joel Ostblom, Tiffany Timbers","Opinionated practices for teaching reproducibility: motivation, guided
  instruction and practice",,,10.1080/26939169.2022.2074922,,cs.CY stat.ME,http://creativecommons.org/licenses/by/4.0/,"  In the data science courses at the University of British Columbia, we define
data science as the study, development and practice of reproducible and
auditable processes to obtain insight from data. While reproducibility is core
to our definition, most data science learners enter the field with other
aspects of data science in mind, for example predictive modelling, which is
often one of the most interesting topic to novices. This fact, along with the
highly technical nature of the industry standard reproducibility tools
currently employed in data science, present out-of-the gate challenges in
teaching reproducibility in the data science classroom. Put simply, students
are not as intrinsically motivated to learn this topic, and it is not an easy
one for them to learn. What can a data science educator do? Over several
iterations of teaching courses focused on reproducible data science tools and
workflows, we have found that providing extra motivation, guided instruction
and lots of practice are key to effectively teaching this challenging, yet
important subject. Here we present examples of how we deeply motivate,
effectively guide and provide ample practice opportunities to data science
students to effectively engage them in learning about this topic.
","[{'version': 'v1', 'created': 'Fri, 17 Sep 2021 19:15:41 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Feb 2022 03:21:17 GMT'}]",2022-07-26,"[['Ostblom', 'Joel', ''], ['Timbers', 'Tiffany', '']]","['Reproducibility', 'Data science', 'Education', 'Curriculum']"
6968,2003.05104,Abeer M.Mahmoud,"Ibrahim M. Ahmed, Abeer M. Mahmoud",Development of an Expert System for Diabetic Type-2 Diet,,"International Journal of Computer Applications, 2014, 107(1)",10.5120/18714-9932,,cs.AI,http://creativecommons.org/publicdomain/zero/1.0/,"  A successful intelligent control of patient food for treatment purpose must
combines patient interesting food list and doctors efficient treatment food
list. Actually, many rural communities in Sudan have extremely limited access
to diabetic diet centers. People travel long distances to clinics or medical
facilities, and there is a shortage of medical experts in most of these
facilities. This results in slow service, and patients end up waiting long
hours without receiving any attention. Hence diabetic diet expert systems can
play a significant role in such cases where medical experts are not readily
available. This paper presents the design and implementation of an intelligent
medical expert system for diabetes diet that intended to be used in Sudan. The
development of the proposed expert system went through a number of stages such
problem and need identification, requirements analysis, knowledge acquisition,
formalization, design and implementation. Visual prolog was used for designing
the graphical user interface and the implementation of the system. The proposed
expert system is a promising helpful tool that reduces the workload for
physicians and provides diabetics with simple and valuable assistance.
","[{'version': 'v1', 'created': 'Sat, 22 Feb 2020 09:34:44 GMT'}]",2020-03-12,"[['Ahmed', 'Ibrahim M.', ''], ['Mahmoud', 'Abeer M.', '']]","['Expert systems', 'diet', 'type 2 diabetes', 'meal plan']"
6969,2102.01645,Federico Galatolo,Federico A. Galatolo and Mario G.C.A. Cimino and Gigliola Vaglini,"Generating images from caption and vice versa via CLIP-Guided Generative
  Latent Space Search",,"IMPROVE, ISBN 978-989-758-511-1, pages 166-174 (2021)",10.5220/0010503701660174,,cs.NE cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this research work we present CLIP-GLaSS, a novel zero-shot framework to
generate an image (or a caption) corresponding to a given caption (or image).
CLIP-GLaSS is based on the CLIP neural network, which, given an image and a
descriptive caption, provides similar embeddings. Differently, CLIP-GLaSS takes
a caption (or an image) as an input, and generates the image (or the caption)
whose CLIP embedding is the most similar to the input one. This optimal image
(or caption) is produced via a generative network, after an exploration by a
genetic algorithm. Promising results are shown, based on the experimentation of
the image Generators BigGAN and StyleGAN2, and of the text Generator GPT2
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2021 18:00:13 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Feb 2021 12:14:49 GMT'}, {'version': 'v3', 'created': 'Fri, 26 Feb 2021 22:42:49 GMT'}, {'version': 'v4', 'created': 'Fri, 1 Oct 2021 15:45:51 GMT'}]",2021-10-04,"[['Galatolo', 'Federico A.', ''], ['Cimino', 'Mario G. C. A.', ''], ['Vaglini', 'Gigliola', '']]","['CLIP', 'Generative Adversarial Networks', 'GPT2', 'Genetic Algorithms']"
6970,2007.13312,Yoshitomo Matsubara,"Yoshitomo Matsubara, Marco Levorato","Split Computing for Complex Object Detectors: Challenges and Preliminary
  Results","Accepted to EMDL '20 (4th International Workshop on Embedded and
  Mobile Deep Learning) co-located with ACM MobiCom 2020","Proceedings of the 4th International Workshop on Embedded and
  Mobile Deep Learning (EMDL'20) (2020). Association for Computing Machinery,
  New York, NY, USA, 7-12",10.1145/3410338.3412338,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Following the trends of mobile and edge computing for DNN models, an
intermediate option, split computing, has been attracting attentions from the
research community. Previous studies empirically showed that while mobile and
edge computing often would be the best options in terms of total inference
time, there are some scenarios where split computing methods can achieve
shorter inference time. All the proposed split computing approaches, however,
focus on image classification tasks, and most are assessed with small datasets
that are far from the practical scenarios. In this paper, we discuss the
challenges in developing split computing methods for powerful R-CNN object
detectors trained on a large dataset, COCO 2017. We extensively analyze the
object detectors in terms of layer-wise tensor size and model size, and show
that naive split computing methods would not reduce inference time. To the best
of our knowledge, this is the first study to inject small bottlenecks to such
object detectors and unveil the potential of a split computing approach. The
source code and trained models' weights used in this study are available at
https://github.com/yoshitomo-matsubara/hnd-ghnd-object-detectors .
","[{'version': 'v1', 'created': 'Mon, 27 Jul 2020 05:03:37 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Jul 2020 05:14:59 GMT'}]",2021-11-17,"[['Matsubara', 'Yoshitomo', ''], ['Levorato', 'Marco', '']]","['Object detection', 'Split computing', 'Head network distillation']"
6971,2103.05560,Yan Feng,"Yan Feng, Dorine Duives, Serge Hoogendoorn","Development of a VR tool to study pedestrian route and exit choice
  behaviour in a multi-story building",,,10.1016/j.ssci.2021.105573,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Although route and exit choice in complex buildings are important aspects of
pedestrian behaviour, studies predominantly investigated pedestrian movement in
a single level. This paper presents an innovative VR tool that was designed to
investigate pedestrian route and exit choice in a multi-story building. This
tool supports free navigation and collects pedestrian walking trajectories,
head movements and gaze points automatically. An experiment was conducted to
evaluate the VR tool from objective standpoints (i.e., pedestrian behaviour)
and subjective standpoints (i.e., the feeling of presence, system usability,
simulation sickness). The results show that the VR tool allows for accurate
collection of pedestrian behavioural data in the complex building. Moreover,
the results of the questionnaire report high realism of the virtual
environment, high immersive feeling, high usability, and low simulator
sickness. This paper contributes by showcasing an innovative approach of
applying VR technologies to study pedestrian behaviour in complex and realistic
environments.
","[{'version': 'v1', 'created': 'Tue, 2 Mar 2021 12:49:46 GMT'}]",2021-11-23,"[['Feng', 'Yan', ''], ['Duives', 'Dorine', ''], ['Hoogendoorn', 'Serge', '']]","['virtual reality', 'multi-story building', 'route choice', 'exit choice', 'wayfinding']"
6972,2206.02422,Andrea Passarella,"Valerio Arnaboldi, Marco Conti, Massimiliano La Gala, Andrea
  Passarella, Fabio Pezzoni","Ego Network Structure in Online Social Networks and its Impact on
  Information Diffusion",,"Computer Communications, 76, 2016, pp. 26-41",10.1016/j.comcom.2015.09.028,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last few years, Online Social Networks (OSNs) attracted the interest
of a large number of researchers, thanks to their central role in the society.
Through the analysis of OSNs, many social phenomena have been studied, such as
the viral diffusion of information amongst people. What is still unclear is the
relation between micro-level structural properties of OSNs (i.e. the properties
of the personal networks of the users, also known as ego networks) and the
emergence of such phenomena. A better knowledge of this relation could be
essential for the creation of services for the Future Internet, such as highly
personalised advertisements fitted on users' needs and characteristics. In this
paper, we contribute to bridge this gap by analysing the ego networks of a
large sample of Facebook and Twitter users. Our results indicate that
micro-level structural properties of OSNs are interestingly similar to those
found in social networks formed offline. In particular, online ego networks
show the same structure found offline, with social contacts arranged in layers
with compatible size and composition. From the analysis of Twitter ego
networks, we have been able to find a direct impact of tie strength and ego
network circles on the diffusion of information in the network. Specifically,
there is a high correlation between the frequency of direct contact between
users and her friends in Twitter (a proxy for tie strength), and the frequency
of retweets made by the users from tweets generated by their friends. We
analysed the correlation for each ego network layer identified in Twitter,
discovering their role in the diffusion of information.
","[{'version': 'v1', 'created': 'Mon, 6 Jun 2022 08:31:04 GMT'}]",2022-06-07,"[['Arnaboldi', 'Valerio', ''], ['Conti', 'Marco', ''], ['La Gala', 'Massimiliano', ''], ['Passarella', 'Andrea', ''], ['Pezzoni', 'Fabio', '']]","['Online social networks', 'ego networks', 'tie strength', 'information diffusion']"
6973,2008.11817,Kien Nguyen,"Kien Nguyen, John Krumm, Cyrus Shahabi","Spatial Privacy Pricing: The Interplay between Privacy, Utility and
  Price in Geo-Marketplaces","10 pages, SIGSPATIAL'20",,10.1145/3397536.3422213,,cs.CR cs.AI,http://creativecommons.org/licenses/by/4.0/,"  A geo-marketplace allows users to be paid for their location data. Users
concerned about privacy may want to charge more for data that pinpoints their
location accurately, but may charge less for data that is more vague. A buyer
would prefer to minimize data costs, but may have to spend more to get the
necessary level of accuracy. We call this interplay between privacy, utility,
and price \emph{spatial privacy pricing}. We formalize the issues
mathematically with an example problem of a buyer deciding whether or not to
open a restaurant by purchasing location data to determine if the potential
number of customers is sufficient to open. The problem is expressed as a
sequential decision making problem, where the buyer first makes a series of
decisions about which data to buy and concludes with a decision about opening
the restaurant or not. We present two algorithms to solve this problem,
including experiments that show they perform better than baselines.
","[{'version': 'v1', 'created': 'Tue, 25 Aug 2020 06:28:02 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Sep 2020 01:11:07 GMT'}]",2020-09-07,"[['Nguyen', 'Kien', ''], ['Krumm', 'John', ''], ['Shahabi', 'Cyrus', '']]","['geo-marketplace', 'location privacy', 'privacy pricing']"
6974,2101.07685,Mattia Setzu,"Mattia Setzu, Riccardo Guidotti, Anna Monreale, Franco Turini, Dino
  Pedreschi, Fosca Giannotti",GLocalX -- From Local to Global Explanations of Black Box AI Models,"27 pages, 2 figures, submitted to ""Special Issue on: Explainable AI
  (XAI) for Web-based Information Processing""","Journal of Artificial Intelligence, Volume 294, May 2021, 103457",10.1016/j.artint.2021.103457,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Artificial Intelligence (AI) has come to prominence as one of the major
components of our society, with applications in most aspects of our lives. In
this field, complex and highly nonlinear machine learning models such as
ensemble models, deep neural networks, and Support Vector Machines have
consistently shown remarkable accuracy in solving complex tasks. Although
accurate, AI models often are ""black boxes"" which we are not able to
understand. Relying on these models has a multifaceted impact and raises
significant concerns about their transparency. Applications in sensitive and
critical domains are a strong motivational factor in trying to understand the
behavior of black boxes. We propose to address this issue by providing an
interpretable layer on top of black box models by aggregating ""local""
explanations. We present GLocalX, a ""local-first"" model agnostic explanation
method. Starting from local explanations expressed in form of local decision
rules, GLocalX iteratively generalizes them into global explanations by
hierarchically aggregating them. Our goal is to learn accurate yet simple
interpretable models to emulate the given black box, and, if possible, replace
it entirely. We validate GLocalX in a set of experiments in standard and
constrained settings with limited or no access to either data or local
explanations. Experiments show that GLocalX is able to accurately emulate
several models with simple and small models, reaching state-of-the-art
performance against natively global solutions. Our findings show how it is
often possible to achieve a high level of both accuracy and comprehensibility
of classification models, even in complex domains with high-dimensional data,
without necessarily trading one property for the other. This is a key
requirement for a trustworthy AI, necessary for adoption in high-stakes
decision making applications.
","[{'version': 'v1', 'created': 'Tue, 19 Jan 2021 15:26:09 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Jan 2021 11:26:16 GMT'}]",2021-01-29,"[['Setzu', 'Mattia', ''], ['Guidotti', 'Riccardo', ''], ['Monreale', 'Anna', ''], ['Turini', 'Franco', ''], ['Pedreschi', 'Dino', ''], ['Giannotti', 'Fosca', '']]","['Explainable AI', 'Global Explanation', 'Local Explanations', 'Interpretable Models', 'Open the Black Box']"
6975,1906.09285,Zhen Wang,"Zhen Wang, Xiang Yue, Soheil Moosavinasab, Yungui Huang, Simon Lin,
  Huan Sun",SurfCon: Synonym Discovery on Privacy-Aware Clinical Data,KDD 2019 (Accepted for Oral Presentation at the Research track),,10.1145/3292500.3330894,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Unstructured clinical texts contain rich health-related information. To
better utilize the knowledge buried in clinical texts, discovering synonyms for
a medical query term has become an important task. Recent automatic synonym
discovery methods leveraging raw text information have been developed. However,
to preserve patient privacy and security, it is usually quite difficult to get
access to large-scale raw clinical texts. In this paper, we study a new setting
named synonym discovery on privacy-aware clinical data (i.e., medical terms
extracted from the clinical texts and their aggregated co-occurrence counts,
without raw clinical texts). To solve the problem, we propose a new framework
SurfCon that leverages two important types of information in the privacy-aware
clinical data, i.e., the surface form information, and the global context
information for synonym discovery. In particular, the surface form module
enables us to detect synonyms that look similar while the global context module
plays a complementary role to discover synonyms that are semantically similar
but in different surface forms, and both allow us to deal with the OOV query
issue (i.e., when the query is not found in the given data). We conduct
extensive experiments and case studies on publicly available privacy-aware
clinical data, and show that SurfCon can outperform strong baseline methods by
large margins under various settings.
","[{'version': 'v1', 'created': 'Fri, 21 Jun 2019 18:23:17 GMT'}]",2019-06-25,"[['Wang', 'Zhen', ''], ['Yue', 'Xiang', ''], ['Moosavinasab', 'Soheil', ''], ['Huang', 'Yungui', ''], ['Lin', 'Simon', ''], ['Sun', 'Huan', '']]","['Synonym Discovery', 'Privacy-Aware Clinical Data', 'Medical TermRecommendation']"
6976,2112.10699,Siddhartha Datta,"Siddhartha Datta, Konrad Kollnig, Nigel Shadbolt","Mind-proofing Your Phone: Navigating the Digital Minefield with
  GreaseTerminator",Accepted in ACM IUI 2022,,10.1145/3490099.3511152,,cs.HC cs.CR cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Digital harms are widespread in the mobile ecosystem. As these devices gain
ever more prominence in our daily lives, so too increases the potential for
malicious attacks against individuals. The last line of defense against a range
of digital harms - including digital distraction, political polarisation
through hate speech, and children being exposed to damaging material - is the
user interface. This work introduces GreaseTerminator to enable researchers to
develop, deploy, and test interventions against these harms with end-users. We
demonstrate the ease of intervention development and deployment, as well as the
broad range of harms potentially covered with GreaseTerminator in five in-depth
case studies.
","[{'version': 'v1', 'created': 'Mon, 20 Dec 2021 17:35:02 GMT'}, {'version': 'v2', 'created': 'Mon, 31 Jan 2022 12:14:49 GMT'}, {'version': 'v3', 'created': 'Tue, 1 Feb 2022 13:03:09 GMT'}]",2022-12-20,"[['Datta', 'Siddhartha', ''], ['Kollnig', 'Konrad', ''], ['Shadbolt', 'Nigel', '']]","['digital harms', 'online harms', 'digital intervention', 'dark patterns', 'digital self-control', 'mobile app', 'program repair']"
6977,2108.06493,Weiming Zhuang,"Weiming Zhuang, Yonggang Wen, Shuai Zhang","Joint Optimization in Edge-Cloud Continuum for Federated Unsupervised
  Person Re-identification",ACMMM'21,,10.1145/3474085.3475182,,cs.DC cs.AI cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Person re-identification (ReID) aims to re-identify a person from
non-overlapping camera views. Since person ReID data contains sensitive
personal information, researchers have adopted federated learning, an emerging
distributed training method, to mitigate the privacy leakage risks. However,
existing studies rely on data labels that are laborious and time-consuming to
obtain. We present FedUReID, a federated unsupervised person ReID system to
learn person ReID models without any labels while preserving privacy. FedUReID
enables in-situ model training on edges with unlabeled data. A cloud server
aggregates models from edges instead of centralizing raw data to preserve data
privacy. Moreover, to tackle the problem that edges vary in data volumes and
distributions, we personalize training in edges with joint optimization of
cloud and edge. Specifically, we propose personalized epoch to reassign
computation throughout training, personalized clustering to iteratively predict
suitable labels for unlabeled data, and personalized update to adapt the server
aggregated model to each edge. Extensive experiments on eight person ReID
datasets demonstrate that FedUReID not only achieves higher accuracy but also
reduces computation cost by 29%. Our FedUReID system with the joint
optimization will shed light on implementing federated learning to more
multimedia tasks without data labels.
","[{'version': 'v1', 'created': 'Sat, 14 Aug 2021 08:35:55 GMT'}]",2021-08-17,"[['Zhuang', 'Weiming', ''], ['Wen', 'Yonggang', ''], ['Zhang', 'Shuai', '']]","['federated learning', 'person re-identification', 'unsupervised learning', 'unsupervised person re-identification']"
6978,1904.13213,Elisa Claire Alem\'an Carre\'on,"Yoshiki Horii, Hirofumi Nonaka, Elisa Claire Alem\'an Carre\'on,
  Hiroki Horino and Toru Hiraoka","Topic Classification Method for Analyzing Effect of eWOM on Consumer
  Game Sales","arXiv admin note: substantial text overlap with arXiv:1904.11797,
  arXiv:1904.12039, 1904.13214","In proceedings of the Joint 10th International Conference on Soft
  Computing and Intelligent Systems and 19th International Symposium on
  Advanced Intelligent Systems in conjunction with Intelligent Systems Workshop
  2018 (2018 SCIS-ISIS2018)",10.6084/m9.figshare.8026778,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Electronic word-of-mouth (eWOM) has become an important resource for the
analysis of marketing research. In this study, in order to analyze user needs
for consumer game software, we focus on tweet data. And we proposed topic
extraction method using entropy-based feature selection based feature
expansion. We also applied it to the classification of the data extracted from
tweet data by using SVM. As a result, we achieved a 0.63 F-measure.
","[{'version': 'v1', 'created': 'Tue, 23 Apr 2019 16:18:50 GMT'}]",2019-05-14,"[['Horii', 'Yoshiki', ''], ['Nonaka', 'Hirofumi', ''], ['Carreón', 'Elisa Claire Alemán', ''], ['Horino', 'Hiroki', ''], ['Hiraoka', 'Toru', '']]","['Entropy', 'SVM', 'Game software']"
6979,2207.13861,Hao Li,"Hao Li, Zhijing Yang, Xiaobin Hong, Ziying Zhao, Junyang Chen, Yukai
  Shi, Jinshan Pan","DnSwin: Toward Real-World Denoising via Continuous Wavelet
  Sliding-Transformer","Accepted by KBS; Wavelet downsampling expands window size in
  Transformer cheaply for a better real-world denosing",,10.1016/j.knosys.2022.109815,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Real-world image denoising is a practical image restoration problem that aims
to obtain clean images from in-the-wild noisy inputs. Recently, the Vision
Transformer (ViT) has exhibited a strong ability to capture long-range
dependencies, and many researchers have attempted to apply the ViT to image
denoising tasks. However, a real-world image is an isolated frame that makes
the ViT build long-range dependencies based on the internal patches, which
divides images into patches, disarranges noise patterns and damages gradient
continuity. In this article, we propose to resolve this issue by using a
continuous Wavelet Sliding-Transformer that builds frequency correspondences
under real-world scenes, called DnSwin. Specifically, we first extract the
bottom features from noisy input images by using a convolutional neural network
(CNN) encoder. The key to DnSwin is to extract high-frequency and low-frequency
information from the observed features and build frequency dependencies. To
this end, we propose a Wavelet Sliding-Window Transformer (WSWT) that utilizes
the discrete wavelet transform (DWT), self-attention and the inverse DWT (IDWT)
to extract deep features. Finally, we reconstruct the deep features into
denoised images using a CNN decoder. Both quantitative and qualitative
evaluations conducted on real-world denoising benchmarks demonstrate that the
proposed DnSwin performs favorably against the state-of-the-art methods.
","[{'version': 'v1', 'created': 'Thu, 28 Jul 2022 02:33:57 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Sep 2022 05:14:07 GMT'}]",2022-09-14,"[['Li', 'Hao', ''], ['Yang', 'Zhijing', ''], ['Hong', 'Xiaobin', ''], ['Zhao', 'Ziying', ''], ['Chen', 'Junyang', ''], ['Shi', 'Yukai', ''], ['Pan', 'Jinshan', '']]","['real-world image denoising', 'vision transformer', 'frequencycorrespondence', 'wavelet sliding window']"
6980,2104.08008,Christof Beierle,Christof Beierle and Claude Carlet and Gregor Leander and L\'eo Perrin,A Further Study of Quadratic APN Permutations in Dimension Nine,,Finite Fields Their Appl. 81: 102049 (2022),10.1016/j.ffa.2022.102049,,cs.IT math.IT,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Recently, Beierle and Leander found two new sporadic quadratic APN
permutations in dimension 9. Up to EA-equivalence, we present a single
trivariate representation of those two permutations as $C_u \colon
(\mathbb{F}_{2^m})^3 \rightarrow (\mathbb{F}_{2^m})^3, (x,y,z) \mapsto
(x^3+uy^2z, y^3+uxz^2,z^3+ux^2y)$, where $m=3$ and $u \in
\mathbb{F}_{2^3}\setminus\{0,1\}$ such that the two permutations correspond to
different choices of $u$. We then analyze the differential uniformity and the
nonlinearity of $C_u$ in a more general case. In particular, for $m \geq 3$
being a multiple of 3 and $u \in \mathbb{F}_{2^m}$ not being a 7-th power, we
show that the differential uniformity of $C_u$ is bounded above by 8, and that
the linearity of $C_u$ is bounded above by $8^{1+\lfloor \frac{m}{2} \rfloor}$.
Based on numerical experiments, we conjecture that $C_u$ is not APN if $m$ is
greater than $3$. We also analyze the CCZ-equivalence classes of the quadratic
APN permutations in dimension 9 known so far and derive a lower bound on the
number of their EA-equivalence classes. We further show that the two sporadic
APN permutations share an interesting similarity with Gold APN permutations in
odd dimension divisible by 3, namely that a permutation EA-inequivalent to
those sporadic APN permutations and their inverses can be obtained by just
applying EA transformations and inversion to the original permutations.
","[{'version': 'v1', 'created': 'Fri, 16 Apr 2021 10:05:58 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Apr 2022 09:19:40 GMT'}]",2022-05-03,"[['Beierle', 'Christof', ''], ['Carlet', 'Claude', ''], ['Leander', 'Gregor', ''], ['Perrin', 'Léo', '']]","['APN permutations', 'infinite family', 'CCZ-equivalence', 'EA-equivalence', 'Booleanfunctions']"
6981,2207.00381,Tim Zeitz,"Nils Werner, Tim Zeitz",Combining Predicted and Live Traffic with Time-Dependent A* Potentials,"19 pages, 5 figures. Full version of ESA22 paper",,10.4230/LIPIcs.ESA.2022.89,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  We study efficient and exact shortest path algorithms for routing on road
networks with realistic traffic data. For navigation applications, both current
(i.e., live) traffic events and predictions of future traffic flows play an
important role in routing. While preprocessing-based speedup techniques have
been employed successfully to both settings individually, a combined model
poses significant challenges. Supporting predicted traffic typically requires
expensive preprocessing while live traffic requires fast updates for regular
adjustments. We propose an A*-based solution to this problem. By generalizing
A* potentials to time dependency, i.e. the estimate of the distance from a
vertex to the target also depends on the time of day when the vertex is
visited, we achieve significantly faster query times than previously possible.
Our evaluation shows that our approach enables interactive query times on
continental-sized road networks while allowing live traffic updates within a
fraction of a minute. We achieve a speedup of at least two orders of magnitude
over Dijkstra's algorithm and up to one order of magnitude over
state-of-the-art time-independent A* potentials.
","[{'version': 'v1', 'created': 'Fri, 1 Jul 2022 12:40:14 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Sep 2022 09:05:55 GMT'}]",2022-09-21,"[['Werner', 'Nils', ''], ['Zeitz', 'Tim', '']]","['realistic road networks', 'shortest paths', 'live traffic', 'time-dependent routing']"
6982,2107.10449,Zhendong Chu,"Zhendong Chu, Hongning Wang",Improve Learning from Crowds via Generative Augmentation,KDD 2021,,10.1145/3447548.3467409,,cs.LG cs.CV cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Crowdsourcing provides an efficient label collection schema for supervised
machine learning. However, to control annotation cost, each instance in the
crowdsourced data is typically annotated by a small number of annotators. This
creates a sparsity issue and limits the quality of machine learning models
trained on such data. In this paper, we study how to handle sparsity in
crowdsourced data using data augmentation. Specifically, we propose to directly
learn a classifier by augmenting the raw sparse annotations. We implement two
principles of high-quality augmentation using Generative Adversarial Networks:
1) the generated annotations should follow the distribution of authentic ones,
which is measured by a discriminator; 2) the generated annotations should have
high mutual information with the ground-truth labels, which is measured by an
auxiliary network. Extensive experiments and comparisons against an array of
state-of-the-art learning from crowds methods on three real-world datasets
proved the effectiveness of our data augmentation framework. It shows the
potential of our algorithm for low-budget crowdsourcing in general.
","[{'version': 'v1', 'created': 'Thu, 22 Jul 2021 04:14:30 GMT'}]",2021-07-23,"[['Chu', 'Zhendong', ''], ['Wang', 'Hongning', '']]","['Crowdsourcing', 'generative adversarial nets', 'label noise']"
6983,2006.14513,Jiejun Hu,"Jiejun Hu, Martin Reed, Mays Al-Naday, Nikolaos Thomos","Blockchain-Aided Flow Insertion and Verification in Software Defined
  Networks","9 pages, 6 figures, published in Global Internet of Things Summit
  2020",,10.1109/GIOTS49054.2020.9119638,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Internet of Things (IoT) connected by Software Defined Networking (SDN)
promises to bring great benefits to cyber-physical systems. However, the
increased attack surface offered by the growing number of connected vulnerable
devices and complex nature of SDN control plane applications could overturn the
huge benefits of such a system. This paper addresses the vulnerability of some
unspecified security flaw in the SDN control plane application (such as a
zero-day software vulnerability) which can be exploited to insert malicious
flow rules in the switch that do not match network policies. Specifically, we
propose a blockchain-as-a-service (BaaS) based framework that supports switch
flow verification and insertion; and additionally provides straightforward
deployment of blockchain technology within an existing SDN infrastructure.
While use of an external BaaS brings straightforward deployment, it obscures
knowledge of the blockchain agents who are responsible for flow conformance
testing through a smart blockchain contract, leading to potential exploitation.
Thus, we design a strategy to prevent the blockchain agents from acting
arbitrarily, as this would result in what is termed a ""moral hazard"". We
achieve this by developing a novel mathematical model of the fair reward scheme
based on game theory. To understand the performance of our system, we evaluate
our model using a Matlab based simulation framework. The simulation results
demonstrate that the proposed algorithm balances the needs of the blockchain
agents to maximise the overall social welfare, i.e. the sum of profits across
all parties.
","[{'version': 'v1', 'created': 'Thu, 25 Jun 2020 16:06:19 GMT'}]",2020-06-26,"[['Hu', 'Jiejun', ''], ['Reed', 'Martin', ''], ['Al-Naday', 'Mays', ''], ['Thomos', 'Nikolaos', '']]","['blockchain; SDN; security', 'IoT', 'flowverification;']"
6984,2009.00377,Giuseppe Corrente,Giuseppe Corrente,Performance issues in content dissemination to metropolitan mobile users,"41 pages, 11 figures","Journal of High Speed Networks, vol. 23, no. 2, pp. 149-162, 2017",10.3233/JHS-170562,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider a set of heterogeneous terminals in a urban area
that are interested in collecting the information originated from several
sources. This set includes mobile nodes (pedestrian and vehicles) and fixed
terminals. In particular, each terminal aims at retrieving the data items in a
limited region of interest (ROI) centered around the node position. Since data
items may change over time all nodes must strive for having access to the
latest version. The goal of the paper is to evaluate the amount of information
each node is able to gather (coverage) resorting to simple distributed data
collection and sharing through local broadcast communications. We study the
diffusion of information updates in the whole area, evaluate the impact of
energy saving policies in the protocol version run by pedestrian devices, and
the impact of contextual awareness about location and motion of nodes in the
forwarding policies. The study we present in this paper has been carried out
through simulation. To this end we develop a discrete event simulator working
on top of mobility and radio propagation traces obtained from the UDelModels
tools that allow to obtain realistic traces of mobility and radio propagation.
","[{'version': 'v1', 'created': 'Tue, 1 Sep 2020 12:15:20 GMT'}]",2020-11-10,"[['Corrente', 'Giuseppe', '']]","['opportunistic networking', 'urban mobility', 'data gathering', 'content dissemination']"
6985,1704.00074,"Verena K\""afer","Verena K\""afer (Universit\""at Stuttgart, Germany), Daniel Kulesz
  (Institute for Software Technology, University of Stuttgart, Germany), Stefan
  Wagner (University of Stuttgart, Germany)","What Is the Best Way For Developers to Learn New Software Tools? An
  Empirical Comparison Between a Text and a Video Tutorial",,"The Art, Science, and Engineering of Programming, 2017, Vol. 1,
  Issue 2, Article 17",10.22152/programming-journal.org/2017/1/17,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The better developers can learn software tools, the faster they can start
using them and the more efficiently they can later work with them. Tutorials
are supposed to help here. While in the early days of computing, mostly text
tutorials were available, nowadays software developers can choose among a huge
number of tutorials for almost any popular software tool. However, only little
research was conducted to understand how text tutorials differ from other
tutorials, which tutorial types are preferred and, especially, which tutorial
types yield the best learning experience in terms of efficiency and
effectiveness, especially for programmers. To evaluate these questions, we
converted an existing video tutorial for a novel software tool into a
content-equivalent text tutorial. We then conducted an experiment in three
groups where 42 undergraduate students from a software engineering course were
commissioned to operate the software tool after using a tutorial: the first
group was provided only with the video tutorial, the second group only with the
text tutorial and the third group with both. In this context, the differences
in terms of efficiency were almost negligible: We could observe that
participants using only the text tutorial completed the tutorial faster than
the participants with the video tutorial. However, the participants using only
the video tutorial applied the learned content faster, achieving roughly the
same bottom line performance. We also found that if both tutorial types are
offered, participants prefer video tutorials for learning new content but text
tutorials for looking up ""missed"" information. We mainly gathered our data
through questionnaires and screen recordings and analyzed it with suitable
statistical hypotheses tests. The data is available at [12]. Since producing
tutorials requires effort, knowing with which type of tutorial learnability can
be increased to which extent has an immense practical relevance. We conclude
that in contexts similar to ours, while it would be ideal if software tool
makers would offer both tutorial types, it seems more efficient to produce only
text tutorials instead of a passive video tutorial - provided you manage to
motivate your learners to use them.
","[{'version': 'v1', 'created': 'Fri, 31 Mar 2017 22:24:16 GMT'}]",2017-04-04,"[['Käfer', 'Verena', '', 'Universität Stuttgart, Germany'], ['Kulesz', 'Daniel', '', 'Institute for Software Technology, University of Stuttgart, Germany'], ['Wagner', 'Stefan', '', 'University of Stuttgart, Germany']]","['comparison', 'spreadsheet', 'text tutorial', 'video tutorial', 'software']"
6986,2202.10783,Theodora Kastritsi,Theodora Kastritsi and Zoe Doulgeri,"A passive admittance controller to enforce Remote Center of Motion and
  Tool Spatial constraints with application in hands-on surgical procedures","12 pages, 11 figures, accepted by Robotics and Autonomous Systems
  https://doi.org/10.1016/j.robot.2022.104073",,10.1016/j.robot.2022.104073,,cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The restriction of feasible motions of a manipulator link constrained to move
through an entry port is a common problem in minimum invasive surgery
procedures. Additional spatial restrictions are required to ensure the safety
of sensitive regions from unintentional damage. In this work, we design a
target admittance model that is proved to enforce robot tool manipulation by a
human through a remote center of motion and to guarantee that the tool will
never enter or touch forbidden regions. The control scheme is proved passive
under the exertion of a human force ensuring manipulation stability, and smooth
natural motion in hands-on surgical procedures enhancing the user's feeling of
control over the task. Its performance is demonstrated by experiments with a
setup mimicking a hands-on surgical procedure comprising a KUKA LWR4+ and a
virtual intraoperative environment.
","[{'version': 'v1', 'created': 'Tue, 22 Feb 2022 10:14:32 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Mar 2022 17:56:07 GMT'}]",2022-03-04,"[['Kastritsi', 'Theodora', ''], ['Doulgeri', 'Zoe', '']]","['Physical Human-Robot Interaction', 'RCM manipulation', 'active constraints', 'surgical robots', 'variable damping']"
6987,2201.00504,Soumendu Chakraborty,"Soumendu Chakraborty, Satish Kumar Singh, and Pavan Chakraborty","R-Theta Local Neighborhood Pattern for Unconstrained Facial Image
  Recognition and Retrieval",,,10.1007/s11042-018-6846-z,,cs.CV cs.MM,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this paper R-Theta Local Neighborhood Pattern (RTLNP) is proposed for
facial image retrieval. RTLNP exploits relationships amongst the pixels in
local neighborhood of the reference pixel at different angular and radial
widths. The proposed encoding scheme divides the local neighborhood into
sectors of equal angular width. These sectors are again divided into subsectors
of two radial widths. Average grayscales values of these two subsectors are
encoded to generate the micropatterns. Performance of the proposed descriptor
has been evaluated and results are compared with the state of the art
descriptors e.g. LBP, LTP, CSLBP, CSLTP, Sobel-LBP, LTCoP, LMeP, LDP, LTrP,
MBLBP, BRINT and SLBP. The most challenging facial constrained and
unconstrained databases, namely; AT&T, CARIA-Face-V5-Cropped, LFW, and Color
FERET have been used for showing the efficiency of the proposed descriptor.
Proposed descriptor is also tested on near infrared (NIR) face databases; CASIA
NIR-VIS 2.0 and PolyU-NIRFD to explore its potential with respect to NIR facial
images. Better retrieval rates of RTLNP as compared to the existing state of
the art descriptors show the effectiveness of the descriptor
","[{'version': 'v1', 'created': 'Mon, 3 Jan 2022 07:39:23 GMT'}]",2022-01-04,"[['Chakraborty', 'Soumendu', ''], ['Singh', 'Satish Kumar', ''], ['Chakraborty', 'Pavan', '']]","['Local pattern descriptors', 'local binary pattern (LBP)', 'local derivative pattern (LDP)', 'local ternary pattern']"
6988,1710.03013,Marco Jacopo Ferrarotti,"Marco Jacopo Ferrarotti, Sergio Decherchi and Walter Rocchia",Distributed Kernel K-Means for Large Scale Clustering,Conference paper,"3rd International Conference on Artificial Intelligence and Soft
  Computing, Computer Science & Information Technology, AIRCC, Vol 7, Number
  10, August 2017",10.5121/csit.2017.71015,,cs.DC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering samples according to an effective metric and/or vector space
representation is a challenging unsupervised learning task with a wide spectrum
of applications. Among several clustering algorithms, k-means and its
kernelized version have still a wide audience because of their conceptual
simplicity and efficacy. However, the systematic application of the kernelized
version of k-means is hampered by its inherent square scaling in memory with
the number of samples. In this contribution, we devise an approximate strategy
to minimize the kernel k-means cost function in which the trade-off between
accuracy and velocity is automatically ruled by the available system memory.
Moreover, we define an ad-hoc parallelization scheme well suited for hybrid
cpu-gpu state-of-the-art parallel architectures. We proved the effectiveness
both of the approximation scheme and of the parallelization method on standard
UCI datasets and on molecular dynamics (MD) data in the realm of computational
chemistry. In this applicative domain, clustering can play a key role for both
quantitively estimating kinetics rates via Markov State Models or to give
qualitatively a human compatible summarization of the underlying chemical
phenomenon under study. For these reasons, we selected it as a valuable
real-world application scenario.
","[{'version': 'v1', 'created': 'Mon, 9 Oct 2017 09:55:24 GMT'}]",2017-10-10,"[['Ferrarotti', 'Marco Jacopo', ''], ['Decherchi', 'Sergio', ''], ['Rocchia', 'Walter', '']]","['Clustering', 'Unsupervised Learning', 'Kernel Methods', 'Distributed Computing', 'GPU', 'Molecular Dynamics']"
6989,2205.13033,Anish Thite,"Anish Thite, Mohan Dodda, Pulak Agarwal, Jason Zutty","Concurrent Neural Tree and Data Preprocessing AutoML for Image
  Classification","4 pages Proceedings of the Genetic and Evolutionary Computation
  Conference Companion July 2021 Pages 1990 to 1993",,10.1145/3449726.3463221,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep Neural Networks (DNN's) are a widely-used solution for a variety of
machine learning problems. However, it is often necessary to invest a
significant amount of a data scientist's time to pre-process input data, test
different neural network architectures, and tune hyper-parameters for optimal
performance. Automated machine learning (autoML) methods automatically search
the architecture and hyper-parameter space for optimal neural networks.
However, current state-of-the-art (SOTA) methods do not include traditional
methods for manipulating input data as part of the algorithmic search space. We
adapt the Evolutionary Multi-objective Algorithm Design Engine (EMADE), a
multi-objective evolutionary search framework for traditional machine learning
methods, to perform neural architecture search. We also integrate EMADE's
signal processing and image processing primitives. These primitives allow EMADE
to manipulate input data before ingestion into the simultaneously evolved DNN.
We show that including these methods as part of the search space shows
potential to provide benefits to performance on the CIFAR-10 image
classification benchmark dataset.
","[{'version': 'v1', 'created': 'Wed, 25 May 2022 20:03:09 GMT'}]",2022-05-27,"[['Thite', 'Anish', ''], ['Dodda', 'Mohan', ''], ['Agarwal', 'Pulak', ''], ['Zutty', 'Jason', '']]","['Deep Neural Networks (DNNs)', 'Automated Machine Learning (autoML)', 'Genetic Programming']"
6990,2101.07259,Anuraganand Sharma Dr,Anuraganand Sharma,Guided parallelized stochastic gradient descent for delay compensation,This is a preprint version,Applied Soft Computing (2021),10.1016/j.asoc.2021.107084,,cs.LG cs.NE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Stochastic gradient descent (SGD) algorithm and its variations have been
effectively used to optimize neural network models. However, with the rapid
growth of big data and deep learning, SGD is no longer the most suitable choice
due to its natural behavior of sequential optimization of the error function.
This has led to the development of parallel SGD algorithms, such as
asynchronous SGD (ASGD) and synchronous SGD (SSGD) to train deep neural
networks. However, it introduces a high variance due to the delay in parameter
(weight) update. We address this delay in our proposed algorithm and try to
minimize its impact. We employed guided SGD (gSGD) that encourages consistent
examples to steer the convergence by compensating the unpredictable deviation
caused by the delay. Its convergence rate is also similar to A/SSGD, however,
some additional (parallel) processing is required to compensate for the delay.
The experimental results demonstrate that our proposed approach has been able
to mitigate the impact of delay for the quality of classification accuracy. The
guided approach with SSGD clearly outperforms sequential SGD and even achieves
the accuracy close to sequential SGD for some benchmark datasets.
","[{'version': 'v1', 'created': 'Sun, 17 Jan 2021 23:12:40 GMT'}]",2021-01-20,"[['Sharma', 'Anuraganand', '']]","['asynchronous/synchronous stochastic gradient descent', 'classification', 'deep learning', 'Gradient']"
6991,2201.01153,Ievgen Kabin,"Ievgen Kabin, Alejandro Sosa, Zoya Dyka, Dan Klann, Peter
  Langendoerfer","On the Influence of the FPGA Compiler Optimization Options on the
  Success of the Horizontal Attack","Author's version accepted for ReConFig-2019; the final publication is
  available at https://ieeexplore.ieee.org/document/8994807",,10.1109/ReConFig48160.2019.8994807,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper reports about the impact of compiler options on the resistance of
cryptographic implementations against side channel analysis attacks. We
evaluated four compiler option for six different FPGAs from Intel and Xilinx.
In order to ensure fair assessment we synthesized always the same VHDL code,
kept the measurement setup and statistical analysis method etc. constant. Our
analysis clearly shows that the compiler options have an impact on the success
of attacks but also that the impact is unpredictable not only between different
FPGAs but also for an individual FPGA.
","[{'version': 'v1', 'created': 'Tue, 4 Jan 2022 14:34:04 GMT'}]",2022-01-05,"[['Kabin', 'Ievgen', ''], ['Sosa', 'Alejandro', ''], ['Dyka', 'Zoya', ''], ['Klann', 'Dan', ''], ['Langendoerfer', 'Peter', '']]","['SCA attacks', 'horizontal attacks', 'electromagnetic analysis', 'ECC', 'kP', 'FPGA', 'design compiler options']"
6992,2010.01470,Lequn Luke Wang,Lequn Wang and Thorsten Joachims,"User Fairness, Item Fairness, and Diversity for Rankings in Two-Sided
  Markets","19 pages, 3 figures, ICTIR 2021",,10.1145/3471158.3472260,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ranking items by their probability of relevance has long been the goal of
conventional ranking systems. While this maximizes traditional criteria of
ranking performance, there is a growing understanding that it is an
oversimplification in online platforms that serve not only a diverse user
population, but also the producers of the items. In particular, ranking
algorithms are expected to be fair in how they serve all groups of users -- not
just the majority group -- and they also need to be fair in how they divide
exposure among the items. These fairness considerations can partially be met by
adding diversity to the rankings, as done in several recent works. However, we
show in this paper that user fairness, item fairness and diversity are
fundamentally different concepts. In particular, we find that algorithms that
consider only one of the three desiderata can fail to satisfy and even harm the
other two. To overcome this shortcoming, we present the first ranking algorithm
that explicitly enforces all three desiderata. The algorithm optimizes user and
item fairness as a convex optimization problem which can be solved optimally.
From its solution, a ranking policy can be derived via a novel Birkhoff-von
Neumann decomposition algorithm that optimizes diversity. Beyond the
theoretical analysis, we investigate empirically on a new benchmark dataset how
effectively the proposed ranking algorithm can control user fairness, item
fairness and diversity, as well as the trade-offs between them.
","[{'version': 'v1', 'created': 'Sun, 4 Oct 2020 02:53:09 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Mar 2021 04:00:28 GMT'}, {'version': 'v3', 'created': 'Sun, 12 Sep 2021 13:39:51 GMT'}]",2021-09-14,"[['Wang', 'Lequn', ''], ['Joachims', 'Thorsten', '']]","['Fairness', 'Diversity', 'Algorithmic Bias', 'Social Welfare', 'Ranking', 'Recommender System', 'Two-sided Market']"
6993,2103.13300,Madhurananda Pahar,"Madhurananda Pahar, Marisa Klopper, Byron Reeve, Grant Theron, Rob
  Warren, Thomas Niesler","Automatic Cough Classification for Tuberculosis Screening in a
  Real-World Environment",This paper has been accepted in Physiological Measurement (2021),"Physiological Measurement, 2021",10.1088/1361-6579/ac2fb8,,cs.SD cs.LG eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Objective: The automatic discrimination between the coughing sounds produced
by patients with tuberculosis (TB) and those produced by patients with other
lung ailments.
  Approach: We present experiments based on a dataset of 1358 forced cough
recordings obtained in a developing-world clinic from 16 patients with
confirmed active pulmonary TB and 35 patients suffering from respiratory
conditions suggestive of TB but confirmed to be TB negative. Using nested
cross-validation, we have trained and evaluated five machine learning
classifiers: logistic regression (LR), support vector machines (SVM), k-nearest
neighbour (KNN), multilayer perceptrons (MLP) and convolutional neural networks
(CNN).
  Main Results: Although classification is possible in all cases, the best
performance is achieved using LR. In combination with feature selection by
sequential forward selection (SFS), our best LR system achieves an area under
the ROC curve (AUC) of 0.94 using 23 features selected from a set of 78
high-resolution mel-frequency cepstral coefficients (MFCCs). This system
achieves a sensitivity of 93\% at a specificity of 95\% and thus exceeds the
90\% sensitivity at 70\% specificity specification considered by the World
Health Organisation (WHO) as a minimal requirement for a community-based TB
triage test.
  Significance: The automatic classification of cough audio sounds, when
applied to symptomatic patients requiring investigation for TB, can meet the
WHO triage specifications for the identification of patients who should undergo
expensive molecular downstream testing. This makes it a promising and viable
means of low cost, easily deployable frontline screening for TB, which can
benefit especially developing countries with a heavy TB burden.
","[{'version': 'v1', 'created': 'Tue, 23 Mar 2021 15:03:52 GMT'}, {'version': 'v2', 'created': 'Sun, 17 Oct 2021 17:56:21 GMT'}]",2022-05-12,"[['Pahar', 'Madhurananda', ''], ['Klopper', 'Marisa', ''], ['Reeve', 'Byron', ''], ['Theron', 'Grant', ''], ['Warren', 'Rob', ''], ['Niesler', 'Thomas', '']]","['tuberculosis', 'TB', 'machine learning', 'cough classification', 'triage test']"
6994,2109.11787,Theofanis Raptis,"Sotiris Nikoletseas, Theofanis P. Raptis, Christoforos Raptopoulos","Wireless charging for weighted energy balance in populations of mobile
  peers",,"Ad Hoc Networks, Volume 60, 2017, Pages 1-10, ISSN 1570-8705",10.1016/j.adhoc.2017.03.005,,cs.NI cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Wireless energy transfer is an emerging technology that is used in networks
of battery-powered devices in order to deliver energy and keep the network
functional. Existing state-of-the-art studies have mainly focused on applying
this technology on networks of relatively strong computational and
communicational capabilities (wireless sensor networks, ad-hoc networks); also
they assume energy transfer from special chargers to regular network nodes.
Different from these works, we study how to efficiently transfer energy
wirelessly in populations of battery-limited devices, towards prolonging their
lifetime. In contrast to the state-of-the-art, we assume a much weaker
population of distributed devices which are exchanging energy in a ""peer to
peer"" manner with each other, without any special charger nodes. We address a
quite general case of diverse energy levels and priorities in the network and
study the problem of how the system can efficiently reach a weighted energy
balance state distributively, under both loss-less and lossy power transfer
assumptions. Three protocols are designed, analyzed and evaluated, achieving
different performance trade-offs between energy balance quality, convergence
time and energy efficiency.
","[{'version': 'v1', 'created': 'Fri, 24 Sep 2021 07:35:10 GMT'}]",2021-09-27,"[['Nikoletseas', 'Sotiris', ''], ['Raptis', 'Theofanis P.', ''], ['Raptopoulos', 'Christoforos', '']]","['Wireless Charging', 'Energy Balance', 'Distributed Protocols']"
6995,2007.09296,Hongyang Gao,"Meng Liu, Hongyang Gao, Shuiwang Ji",Towards Deeper Graph Neural Networks,"11 pages, KDD2020",,10.1145/3394486.3403076,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph neural networks have shown significant success in the field of graph
representation learning. Graph convolutions perform neighborhood aggregation
and represent one of the most important graph operations. Nevertheless, one
layer of these neighborhood aggregation methods only consider immediate
neighbors, and the performance decreases when going deeper to enable larger
receptive fields. Several recent studies attribute this performance
deterioration to the over-smoothing issue, which states that repeated
propagation makes node representations of different classes indistinguishable.
In this work, we study this observation systematically and develop new insights
towards deeper graph neural networks. First, we provide a systematical analysis
on this issue and argue that the key factor compromising the performance
significantly is the entanglement of representation transformation and
propagation in current graph convolution operations. After decoupling these two
operations, deeper graph neural networks can be used to learn graph node
representations from larger receptive fields. We further provide a theoretical
analysis of the above observation when building very deep models, which can
serve as a rigorous and gentle description of the over-smoothing issue. Based
on our theoretical and empirical analysis, we propose Deep Adaptive Graph
Neural Network (DAGNN) to adaptively incorporate information from large
receptive fields. A set of experiments on citation, co-authorship, and
co-purchase datasets have confirmed our analysis and insights and demonstrated
the superiority of our proposed methods.
","[{'version': 'v1', 'created': 'Sat, 18 Jul 2020 01:11:14 GMT'}]",2020-07-21,"[['Liu', 'Meng', ''], ['Gao', 'Hongyang', ''], ['Ji', 'Shuiwang', '']]","['deep learning', 'graph representation learning', 'graph neural networks']"
6996,2208.14694,Alexandre Lambert,"Alexandre Lambert, Manolo Dulva Hina, Celine Barth, Assia Soukane and
  Amar Ramdane-Cherif",Modelling and Detection of Driver's Fatigue using Ontology,,,10.5220/0010689700003064,,cs.AI cs.CY cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Road accidents have become the eight leading cause of death all over the
world. Lots of these accidents are due to a driver's inattention or lack of
focus, due to fatigue. Various factors cause driver's fatigue. This paper
considers all the measureable data that manifest driver's fatigue, namely those
manifested in the vehicle measureable data while driving as well as the
driver's physical and physiological data. Each of the three main factors are
further subdivided into smaller details. For example, the vehicle's data is
composed of the values obtained from the steering wheel's angle, yaw angle, the
position on the lane, and the speed and acceleration of the vehicle while
moving. Ontological knowledge and rules for driver fatigue detection are to be
integrated into an intelligent system so that on the first sign of dangerous
level of fatigue is detected, a warning notification is sent to the driver.
This work is intended to contribute to safe road driving.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2022 08:42:28 GMT'}]",2022-09-01,"[['Lambert', 'Alexandre', ''], ['Hina', 'Manolo Dulva', ''], ['Barth', 'Celine', ''], ['Soukane', 'Assia', ''], ['Ramdane-Cherif', 'Amar', '']]","['ontology', 'driver fatigue', 'context modelling', 'safe driving', 'perception', 'data fusion']"
6997,2204.00256,Stefano Zacchiroli,"Stefano Zacchiroli (IP Paris, LTCI)",A Large-scale Dataset of (Open Source) License Text Variants,"The 2022 Mining Software Repositories Conference, May 2022,
  Pittsburgh, Pennsylvania, United States",,10.1145/3524842.3528491,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a large-scale dataset of the complete texts of free/open source
software (FOSS) license variants. To assemble it we have collected from the
Software Heritage archive-the largest publicly available archive of FOSS source
code with accompanying development history-all versions of files whose names
are commonly used to convey licensing terms to software users and
developers.The dataset consists of 6.5 million unique license files that can be
used to conduct empirical studies on open source licensing, training of
automated license classifiers, natural language processing (NLP) analyses of
legal texts, as well as historical and phylogenetic studies on FOSS licensing.
Additional metadata about shipped license files are also provided, making the
dataset ready to use in various contexts; they include: file length measures,
detected MIME type, detected SPDX license (using ScanCode), example origin
(e.g., GitHub repository), oldest public commit in which the license
appeared.The dataset is released as open data as an archive file containing all
deduplicated license files, plus several portable CSV files for metadata,
referencing files via cryptographic checksums.
","[{'version': 'v1', 'created': 'Fri, 1 Apr 2022 07:31:02 GMT'}]",2022-04-04,"[['Zacchiroli', 'Stefano', '', 'IP Paris, LTCI']]","['dataset', 'open source', 'software license', 'copyright', 'intellectual property', 'software engineering', 'natural language processing']"
6998,2112.07137,Liangdong Lu,"Chaofeng Guan, Ruihu Li, Liangdong Lu, Yu Yao",New Binary Quantum Codes Constructed from Quasi-Cyclic Codes,,,10.1007/s10773-022-05126-6,,cs.IT math.IT quant-ph,http://creativecommons.org/licenses/by-sa/4.0/,"  It is well known that quantum codes can be constructed by means of classical
symplectic dual-containing codes. This paper considers a family of
two-generator quasi-cyclic codes and derives sufficient conditions for these
codes to be symplectic dual-containing. Then, a new method for constructing
binary quantum codes using symplectic dual-containing codes is proposed. As an
application, we construct 8 binary quantum codes that exceed the best-known
results. Further, another 36 new binary quantum codes are obtained by
propagation rules, all of which improve the lower bound on the minimum
distances.
","[{'version': 'v1', 'created': 'Tue, 14 Dec 2021 03:22:16 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Jul 2022 00:43:25 GMT'}, {'version': 'v3', 'created': 'Fri, 6 Jan 2023 01:05:31 GMT'}]",2023-01-09,"[['Guan', 'Chaofeng', ''], ['Li', 'Ruihu', ''], ['Lu', 'Liangdong', ''], ['Yao', 'Yu', '']]","['binary quantum codes', 'quasi-cyclic codes', 'symplecticdual-containing codes']"
6999,2008.05395,Feng Xia,"Feng Xia, Hannan Bin Liaqat, Ahmedin Mohammed Ahmed, Li Liu, Jianhua
  Ma, Runhe Huang, Amr Tolba","User Popularity-based Packet Scheduling for Congestion Control in Ad-hoc
  Social Networks","18 pages, 8 figures","Journal of Computer and System Sciences, Vol.82, No.1, 2016, pp.
  93-112",10.1016/j.jcss.2015.07.002,,cs.NI cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional ad-hoc network packet scheduling schemes cannot fulfill the
requirements of proximity-based ad-hoc social networks (ASNETs) and they do not
behave properly in congested environments. To address this issue, we propose a
user popularity-based packet scheduling scheme for congestion control in ASNETs
called Pop-aware. The proposed algorithm exploits social popularity of sender
nodes to prioritize all incoming flows. Pop-aware also provides fairness of
service received by each flow. We evaluate the performance of Pop-aware through
a series of simulations. In comparison with some existing scheduling
algorithms, Pop-aware performs better in terms of control overhead, total
overhead, average throughput, packet loss rate, packet delivery rate and
average delay.
","[{'version': 'v1', 'created': 'Sun, 9 Aug 2020 03:45:29 GMT'}]",2020-08-13,"[['Xia', 'Feng', ''], ['Liaqat', 'Hannan Bin', ''], ['Ahmed', 'Ahmedin Mohammed', ''], ['Liu', 'Li', ''], ['Ma', 'Jianhua', ''], ['Huang', 'Runhe', ''], ['Tolba', 'Amr', '']]","['Mobile social networking in proximity', 'ad-hoc social networks', 'mobile social networks', 'degree centrality', 'first-in-first-out', 'congestion control']"
7000,1702.07099,Dezhi Fang,"Dezhi Fang, Matthew Keezer, Jacob Williams, Kshitij Kulkarni, Robert
  Pienta, Duen Horng Chau","Carina: Interactive Million-Node Graph Visualization using Web Browser
  Technologies",,,10.1145/3041021.3054234,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  We are working on a scalable, interactive visualization system, called
Carina, for people to explore million-node graphs. By using latest web browser
technologies, Carina offers fast graph rendering via WebGL, and works across
desktop (via Electron) and mobile platforms. Different from most existing graph
visualization tools, Carina does not store the full graph in RAM, enabling it
to work with graphs with up to 69M edges. We are working to improve and
open-source Carina, to offer researchers and practitioners a new, scalable way
to explore and visualize large graph datasets.
","[{'version': 'v1', 'created': 'Thu, 23 Feb 2017 05:22:16 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Feb 2017 18:52:52 GMT'}]",2017-02-27,"[['Fang', 'Dezhi', ''], ['Keezer', 'Matthew', ''], ['Williams', 'Jacob', ''], ['Kulkarni', 'Kshitij', ''], ['Pienta', 'Robert', ''], ['Chau', 'Duen Horng', '']]","['Interactive graph visualization', 'web standards', 'WebGL']"
7001,2301.10174,Taminul Islam,"Taminul Islam, Arindom Kundu, Tanzim Ahmed and Nazmul Islam Khan",Analysis of Arrhythmia Classification on ECG Dataset,"6 pages, 5 figures. This paper has been published to 2022 proceedings
  of IEEE 7th International conference for Convergence in Technology (I2CT),
  07-09 April 2022, Mumbai, India","In 2022 IEEE 7th International conference for Convergence in
  Technology (I2CT) (pp. 1-6). IEEE",10.1109/I2CT54291.2022.9825052,,cs.LG eess.SP,http://creativecommons.org/licenses/by-sa/4.0/,"  The heart is one of the most vital organs in the human body. It supplies
blood and nutrients in other parts of the body. Therefore, maintaining a
healthy heart is essential. As a heart disorder, arrhythmia is a condition in
which the heart's pumping mechanism becomes aberrant. The Electrocardiogram is
used to analyze the arrhythmia problem from the ECG signals because of its
fewer difficulties and cheapness. The heart peaks shown in the ECG graph are
used to detect heart diseases, and the R peak is used to analyze arrhythmia
disease. Arrhythmia is grouped into two groups - Tachycardia and Bradycardia
for detection. In this paper, we discussed many different techniques such as
Deep CNNs, LSTM, SVM, NN classifier, Wavelet, TQWT, etc., that have been used
for detecting arrhythmia using various datasets throughout the previous decade.
This work shows the analysis of some arrhythmia classification on the ECG
dataset. Here, Data preprocessing, feature extraction, classification processes
were applied on most research work and achieved better performance for
classifying ECG signals to detect arrhythmia. Automatic arrhythmia detection
can help cardiologists make the right decisions immediately to save human life.
In addition, this research presents various previous research limitations with
some challenges in detecting arrhythmia that will help in future research.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2023 14:02:24 GMT'}]",2023-01-25,"[['Islam', 'Taminul', ''], ['Kundu', 'Arindom', ''], ['Ahmed', 'Tanzim', ''], ['Khan', 'Nazmul Islam', '']]","['Arrhythmia', 'Electrocardiogram', 'MIT-BIH ECG signal dataset', 'Tachycardia', 'Bradycardia']"
7002,2010.04112,Abdulmajid Murad,"Abdulmajid Murad, Frank Alexander Kraemer, Kerstin Bach, Gavin Taylor",Information-Driven Adaptive Sensing Based on Deep Reinforcement Learning,"8 pages, 8 figures","10th International Conference on the Internet of Things (IoT20),
  October 6-9, 2020, Malmo, Sweden",10.1145/3410992.3411001,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to make better use of deep reinforcement learning in the creation of
sensing policies for resource-constrained IoT devices, we present and study a
novel reward function based on the Fisher information value. This reward
function enables IoT sensor devices to learn to spend available energy on
measurements at otherwise unpredictable moments, while conserving energy at
times when measurements would provide little new information. This is a highly
general approach, which allows for a wide range of use cases without
significant human design effort or hyper-parameter tuning. We illustrate the
approach in a scenario of workplace noise monitoring, where results show that
the learned behavior outperforms a uniform sampling strategy and comes close to
a near-optimal oracle solution.
","[{'version': 'v1', 'created': 'Thu, 8 Oct 2020 16:52:05 GMT'}]",2020-10-09,"[['Murad', 'Abdulmajid', ''], ['Kraemer', 'Frank Alexander', ''], ['Bach', 'Kerstin', ''], ['Taylor', 'Gavin', '']]","['internet of things', 'deep reinforcement learning', 'adaptive sensing', 'Gaussian processes']"
7003,2109.03955,Ernesto Diaz-Aviles,"Ernesto Diaz-Aviles and Claudia Orellana-Rodriguez and Igor Brigadir
  and Reshma Narayanan Kutty","NU:BRIEF -- A Privacy-aware Newsletter Personalization Engine for
  Publishers","Fifteenth ACM Conference on Recommender Systems (RecSys '21),
  September 27-October 1, 2021, Amsterdam, Netherlands",,10.1145/3460231.3478884,,cs.DL cs.CY cs.HC cs.IR cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  Newsletters have (re-) emerged as a powerful tool for publishers to engage
with their readers directly and more effectively. Despite the diversity in
their audiences, publishers' newsletters remain largely a one-size-fits-all
offering, which is suboptimal. In this paper, we present NU:BRIEF, a web
application for publishers that enables them to personalize their newsletters
without harvesting personal data. Personalized newsletters build a habit and
become a great conversion tool for publishers, providing an alternative
readers-generated revenue model to a declining ad/clickbait-centered business
model.
","[{'version': 'v1', 'created': 'Wed, 8 Sep 2021 22:36:05 GMT'}]",2021-09-10,"[['Diaz-Aviles', 'Ernesto', ''], ['Orellana-Rodriguez', 'Claudia', ''], ['Brigadir', 'Igor', ''], ['Kutty', 'Reshma Narayanan', '']]","['Newsletter Personalization', 'AI', 'Federated Learning', 'ML', 'NLP', 'Privacy', 'Personalized Ranking']"
7004,2003.03514,Qisheng Wang,Qisheng Wang and Mingsheng Ying,Quantum Random Access Stored-Program Machines,"Final version. 69 pages, 1 figure, 6 tables, 7 algorithms","Journal of Computer and System Sciences, 131: 13-63, 2023",10.1016/j.jcss.2022.08.002,,cs.LO quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Random access machines (RAMs) and random access stored-program machines
(RASPs) are models of computing that are closer to the architecture of
real-world computers than Turing machines (TMs). They are also convenient in
complexity analysis of algorithms. The relationships between RAMs, RASPs and
TMs are well-studied. However, clear relationships between their quantum
counterparts are still missing in the literature. We fill in this gap by
formally defining the models of quantum random access machines (QRAMs) and
quantum random access stored-program machines (QRASPs) and clarifying the
relationships between QRAMs, QRASPs and quantum Turing machines (QTMs). In
particular, we show that $\textbf{P} \subseteq \textbf{EQRAMP} \subseteq
\textbf{EQP} \subseteq \textbf{BQP} = \textbf{BQRAMP}$, where $\textbf{EQRAMP}$
and $\textbf{BQRAMP}$ stand for the sets of problems that can be solved by
polynomial-time QRAMs with certainty and bounded-error, respectively. At the
heart of our proof, is a standardisation of QTM with an extended halting
scheme, which is of independent interest.
","[{'version': 'v1', 'created': 'Sat, 7 Mar 2020 04:21:39 GMT'}, {'version': 'v2', 'created': 'Sat, 10 Sep 2022 05:39:19 GMT'}]",2022-09-13,"[['Wang', 'Qisheng', ''], ['Ying', 'Mingsheng', '']]","['quantum computing', 'random access machine', 'stored-program machine', 'Turing machine']"
7005,2104.14670,Doseok Jang,"Doseok Jang, Lucas Spangher, Manan Khattar, Utkarsha Agwan, Costas
  Spanos","Using Meta Reinforcement Learning to Bridge the Gap between Simulation
  and Experiment in Energy Demand Response",,,10.1145/3447555.3466589,,cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  Our team is proposing to run a full-scale energy demand response experiment
in an office building. Although this is an exciting endeavor which will provide
value to the community, collecting training data for the reinforcement learning
agent is costly and will be limited. In this work, we apply a meta-learning
architecture to warm start the experiment with simulated tasks, to increase
sample efficiency. We present results that demonstrate a similar a step up in
complexity still corresponds with better learning.
","[{'version': 'v1', 'created': 'Thu, 29 Apr 2021 21:55:04 GMT'}, {'version': 'v2', 'created': 'Mon, 17 May 2021 06:09:31 GMT'}]",2021-11-12,"[['Jang', 'Doseok', ''], ['Spangher', 'Lucas', ''], ['Khattar', 'Manan', ''], ['Agwan', 'Utkarsha', ''], ['Spanos', 'Costas', '']]","['prosumer', 'aggregation', 'reinforcement learning', 'microgrid', 'transactive energy']"
7006,2210.16449,Thomas Misa,Thomas J. Misa,Gender Bias in Computing,"21 pages, 5 figures","William Aspray (ed.), Historical Studies in Computing,
  Information, and Society (Springer 2019), 113-133",10.1007/978-3-030-18955-6_6,,cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper examines the historical dimension of gender bias in the US
computing workforce. It offers new quantitative data on the computing workforce
prior to the availability of US Census data in the 1970s. Computer user groups
(including SHARE, Inc., and the Mark IV software user group) are taken as a
cross-section of the computing workforce. A novel method of gender analysis is
developed to estimate women's and men's participation in computing beginning in
the 1950s. The data presented here are consistent with well-known NSF
statistics that show computer science undergraduate programs enrolling
increasing numbers of women students during 1965-1985. These findings challenge
the 'making programming masculine' thesis, and serve to correct the
unrealistically high figures often cited for women's participation in early
computer programming. Gender bias in computing today is traced not to 1960s
professionalization but to cultural changes in the 1980s and beyond.
","[{'version': 'v1', 'created': 'Sat, 29 Oct 2022 00:10:25 GMT'}]",2022-11-01,"[['Misa', 'Thomas J.', '']]","['Gender issues', 'Computer user groups', 'SHARE', 'Inc']"
7007,1908.06660,Johannes Czech,"Johannes Czech, Moritz Willig, Alena Beyer, Kristian Kersting,
  Johannes F\""urnkranz","Learning to play the Chess Variant Crazyhouse above World Champion Level
  with Deep Neural Networks and Human Data","35 pages, 19 figures, 14 tables","Frontiers in Artificial Intelligence, Machine Learning and
  Artificial Intelligence, Volume 3 (2020)",10.3389/frai.2020.00024,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks have been successfully applied in learning the board
games Go, chess and shogi without prior knowledge by making use of
reinforcement learning. Although starting from zero knowledge has been shown to
yield impressive results, it is associated with high computationally costs
especially for complex games. With this paper, we present CrazyAra which is a
neural network based engine solely trained in supervised manner for the chess
variant crazyhouse. Crazyhouse is a game with a higher branching factor than
chess and there is only limited data of lower quality available compared to
AlphaGo. Therefore, we focus on improving efficiency in multiple aspects while
relying on low computational resources. These improvements include
modifications in the neural network design and training configuration, the
introduction of a data normalization step and a more sample efficient
Monte-Carlo tree search which has a lower chance to blunder. After training on
569,537 human games for 1.5 days we achieve a move prediction accuracy of
60.4%. During development, versions of CrazyAra played professional human
players. Most notably, CrazyAra achieved a four to one win over 2017 crazyhouse
world champion Justin Tan (aka LM Jann Lee) who is more than 400 Elo higher
rated compared to the average player in our training set. Furthermore, we test
the playing strength of CrazyAra on CPU against all participants of the second
Crazyhouse Computer Championships 2017, winning against twelve of the thirteen
participants. Finally, for CrazyAraFish we continue training our model on
generated engine games. In ten long-time control matches playing Stockfish 10,
CrazyAraFish wins three games and draws one out of ten matches.
","[{'version': 'v1', 'created': 'Mon, 19 Aug 2019 09:31:47 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Aug 2019 15:56:56 GMT'}]",2020-09-11,"[['Czech', 'Johannes', ''], ['Willig', 'Moritz', ''], ['Beyer', 'Alena', ''], ['Kersting', 'Kristian', ''], ['Fürnkranz', 'Johannes', '']]","['Deep Learning', 'Chess', 'Crazyhouse', 'Supervised Learning', 'Monte-Carlo Tree Search']"
7008,2008.03669,Pierre-Alain Fayolle,"Markus Friedrich and Sebastian Feld and Thomy Phan and Pierre-Alain
  Fayolle","Accelerating Evolutionary Construction Tree Extraction via Graph
  Partitioning","The 26th International Conference in Central Europe on Computer
  Graphics, Visualization and Computer Vision 2016 in co-operation with
  EUROGRAPHICS: University of West Bohemia, Plzen, Czech Republic May 28 - June
  1 2018, p. 29-37",,10.24132/CSRN.2018.2802.5,,cs.GR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Extracting a Construction Tree from potentially noisy point clouds is an
important aspect of Reverse Engineering tasks in Computer Aided Design.
Solutions based on algorithmic geometry impose constraints on usable model
representations (e.g. quadric surfaces only) and noise robustness.
Re-formulating the problem as a combinatorial optimization problem and solving
it with an Evolutionary Algorithm can mitigate some of these constraints at the
cost of increased computational complexity. This paper proposes a graph-based
search space partitioning scheme that is able to accelerate Evolutionary
Construction Tree extraction while exploiting parallelization capabilities of
modern CPUs. The evaluation indicates a speed-up up to a factor of $46.6$
compared to the baseline approach while resulting tree sizes increased by
$25.2\%$ to $88.6\%$.
","[{'version': 'v1', 'created': 'Sun, 9 Aug 2020 06:11:33 GMT'}]",2020-08-11,"[['Friedrich', 'Markus', ''], ['Feld', 'Sebastian', ''], ['Phan', 'Thomy', ''], ['Fayolle', 'Pierre-Alain', '']]","['3-d Reconstruction', 'Reverse Engineering', 'Computer Aided Design', 'Constructive Solid Geometry', 'EvolutionaryAlgorithms', 'Graph Theory']"
7009,2205.12019,Yannick Wack,"Yannick Wack, Martine Baelmans, Robbe Salenbien, Maarten Blommaert","Economic Topology Optimization of District Heating Networks using a Pipe
  Penalization Approach","Changed article template and minor reformulations in abstract,
  introduction and conclusion","Energy, 2022, 126161",10.1016/j.energy.2022.126161,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the presented study, a pipe penalization approach for the economic
topology optimization of District Heating Networks is proposed, drawing
inspiration from density-based topology optimization. For District Heating
Networks, the upfront investment is a crucial factor for the rollout of this
technology. Today, the pipe routing is usually designed relying on a
linearization of the underlying heat transport problem. This study proposes to
solve the optimal pipe routing problem as a non-linear topology optimization
problem, drawing inspiration from density-based topology optimization. The
optimization problem is formulated around a non-linear heat transport model and
minimizes a detailed net present value representation of the heating network
cost. By relaxing the combinatorial problem of pipe placement, this approach
remains scalable for large-scale applications. A discrete network topology and
near-discrete pipe design is achieved by using an intermediate pipe
penalization strategy. For a realistic test case, the proposed algorithm
achieves a discrete network topology and near-discrete pipe design that
outperforms simple post-processing steps.
","[{'version': 'v1', 'created': 'Tue, 24 May 2022 12:09:54 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Jun 2022 11:45:21 GMT'}]",2022-11-24,"[['Wack', 'Yannick', ''], ['Baelmans', 'Martine', ''], ['Salenbien', 'Robbe', ''], ['Blommaert', 'Maarten', '']]","['topology optimization', 'District Heating Network', 'non-linear']"
7010,2204.12290,Barbara Cunha,"Barbara Cunha (LTDS), Abdel-Malek Zine (ICJ), Mohamed Ichchou (ECL),
  Christophe Droz (COSYS-SII), St\'ephane Foulard","On Machine Learning-Driven Surrogates for Sound Transmission Loss
  Simulations",,,10.1121/10.0015797,,cs.SD cs.LG eess.AS physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Surrogate models are data-based approximations of computationally expensive
simulations that enable efficient exploration of the model's design space and
informed decision-making in many physical domains. The usage of surrogate
models in the vibroacoustic domain, however, is challenging due to the
non-smooth, complex behavior of wave phenomena. This paper investigates four
Machine Learning (ML) approaches in the modelling of surrogates of Sound
Transmission Loss (STL). Feature importance and feature engineering are used to
improve the models' accuracy while increasing their interpretability and
physical consistency. The transfer of the proposed techniques to other problems
in the vibroacoustic domain and possible limitations of the models are
discussed.
","[{'version': 'v1', 'created': 'Mon, 25 Apr 2022 08:04:25 GMT'}]",2022-12-14,"[['Cunha', 'Barbara', '', 'LTDS'], ['Zine', 'Abdel-Malek', '', 'ICJ'], ['Ichchou', 'Mohamed', '', 'ECL'], ['Droz', 'Christophe', '', 'COSYS-SII'], ['Foulard', 'Stéphane', '']]","['Surrogate', 'Machine Learning', 'Sound Transmission Loss', 'Vibroacoustic', 'Sensitivity Analysis', 'Physics-Guided Features']"
7011,1903.04484,Mimansa Jaiswal,"Mimansa Jaiswal, Sairam Tabibu, Rajiv Bajpai","The Truth and Nothing but the Truth: Multimodal Analysis for Deception
  Detection","6pages, ICDMW",,10.1109/ICDMW.2016.0137,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a data-driven method for automatic deception detection in
real-life trial data using visual and verbal cues. Using OpenFace with facial
action unit recognition, we analyze the movement of facial features of the
witness when posed with questions and the acoustic patterns using OpenSmile. We
then perform a lexical analysis on the spoken words, emphasizing the use of
pauses and utterance breaks, feeding that to a Support Vector Machine to test
deceit or truth prediction. We then try out a method to incorporate
utterance-based fusion of visual and lexical analysis, using string based
matching.
","[{'version': 'v1', 'created': 'Mon, 11 Mar 2019 18:11:23 GMT'}]",2019-03-13,"[['Jaiswal', 'Mimansa', ''], ['Tabibu', 'Sairam', ''], ['Bajpai', 'Rajiv', '']]","['face tracking', 'support vector machine', 'multimodal']"
7012,2201.01807,Imen Bouabdallah,Imen Bouabdallah and Hakima Mellah,Handling Trust in A Cloud Based Multi Agent System,"13 pages, 9 figures, 10th International Conference on Natural
  Language Processing","David C. Wyld et al. (Eds): NLP, MLTEC, CLBD, SEAPP, NeTIoT,
  VLSIE, ITCS, ARIA, DMS - 2021 pp. 241-255, 2021. CS & IT",10.5121/csit.2021.112319,,cs.MA cs.DB cs.SI,http://creativecommons.org/publicdomain/zero/1.0/,"  Cloud computing is an opened and distributed network that guarantees access
to a large amount of data and IT infrastructure at several levels (software,
hardware...). With the increase demand, handling clients' needs is getting
increasingly challenging. Responding to all requesting clients could lead to
security breaches, and since it is the provider's responsibility to secure not
only the offered cloud services but also the data, it is important to ensure
clients reliability. Although filtering clients in the cloud is not so common,
it is required to assure cloud safety.
  In this paper, by implementing multi agent systems in the cloud to handle
interactions for the providers, trust is introduced at agent level to filtrate
the clients asking for services by using Particle Swarm Optimization and
acquaintance knowledge to determine malicious and untrustworthy clients. The
selection depends on previous knowledge and overall rating of trusted peers.
The conducted experiments show that the model outputs relevant results, and
even with a small number of peers, the framework is able to converge to the
best solution. The model presented in this paper is a part of ongoing work to
adapt interactions in the cloud.
","[{'version': 'v1', 'created': 'Wed, 5 Jan 2022 20:25:16 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Jun 2022 22:04:53 GMT'}]",2022-06-24,"[['Bouabdallah', 'Imen', ''], ['Mellah', 'Hakima', '']]","['Multi agent system', 'cloud', 'trust', 'interaction', 'PSO']"
7013,2208.12484,Sangjun Han,"Sangjun Han, Taeil Hur, Youngmi Hur",Laplacian Pyramid-like Autoencoder,"20 pages, 3 figures, 5 tables, Science and Information Conference
  2022, Intelligent Computing","Intelligent Computing, SAI 2022. Lecture Notes in Networks and
  Systems, vol 507, pp 59-78",10.1007/978-3-031-10464-0_5,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we develop the Laplacian pyramid-like autoencoder (LPAE) by
adding the Laplacian pyramid (LP) concept widely used to analyze images in
Signal Processing. LPAE decomposes an image into the approximation image and
the detail image in the encoder part and then tries to reconstruct the original
image in the decoder part using the two components. We use LPAE for experiments
on classifications and super-resolution areas. Using the detail image and the
smaller-sized approximation image as inputs of a classification network, our
LPAE makes the model lighter. Moreover, we show that the performance of the
connected classification networks has remained substantially high. In a
super-resolution area, we show that the decoder part gets a high-quality
reconstruction image by setting to resemble the structure of LP. Consequently,
LPAE improves the original results by combining the decoder part of the
autoencoder and the super-resolution network.
","[{'version': 'v1', 'created': 'Fri, 26 Aug 2022 07:45:06 GMT'}]",2022-08-29,"[['Han', 'Sangjun', ''], ['Hur', 'Taeil', ''], ['Hur', 'Youngmi', '']]","['Deep Learning', 'Autoencoder', 'Laplacian Pyramid', 'Classification', 'Acceleration', 'Super-resolution']"
7014,2007.06986,Khashayar Etemadi Someoliayi,"Khashayar Etemadi, Niloofar Tarighat, Siddharth Yadav, Matias
  Martinez, Martin Monperrus","Estimating the Potential of Program Repair Search Spaces with Commit
  Analysis",,"Journal of Systems and Software, 2022",10.1016/j.jss.2022.111263,,cs.SE,http://creativecommons.org/publicdomain/zero/1.0/,"  The most natural method for evaluating program repair systems is to run them
on bug datasets, such as Defects4J. Yet, using this evaluation technique on
arbitrary real-world programs requires heavy configuration. In this paper, we
propose a purely static method to evaluate the potential of the search space of
repair approaches. This new method enables researchers and practitioners to
encode the search spaces of repair approaches and select potentially useful
ones without struggling with tool configuration and execution. We encode the
search spaces by specifying the repair strategies they employ. Next, we use the
specifications to check whether past commits lie in repair search spaces. For a
repair approach, including many human-written past commits in its search space
indicates its potential to generate useful patches. We implement our evaluation
method in LighteR. LighteR gets a Git repository and outputs a list of commits
whose source code changes lie in repair search spaces. We run LighteR on 55,309
commits from the history of 72 Github repositories with and show that LighteR's
precision and recall are 77% and 92%, respectively. Overall, our experiments
show that our novel method is both lightweight and effective to study the
search space of program repair approaches.
","[{'version': 'v1', 'created': 'Tue, 14 Jul 2020 12:05:50 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Feb 2022 15:11:00 GMT'}]",2022-02-22,"[['Etemadi', 'Khashayar', ''], ['Tarighat', 'Niloofar', ''], ['Yadav', 'Siddharth', ''], ['Martinez', 'Matias', ''], ['Monperrus', 'Martin', '']]","['Program repair', 'Search-space', 'Static code analysis', 'Commit analysis']"
7015,1903.06640,Genoveva Vargas-Solar,"G\'eraldine Castel (ILCEA4), Genoveva Vargas-Solar (ILCEA4), Javier
  Espinosa-Oviedo (TU Delft)","Analyzing digital politics: Challenges and experiments in a dual
  perspective","Ing{\'e}ni{\'e}rie des Syst{\`e}mes d'Information, Lavoisier, In
  press",,10.3166/RCMA.25.1-n,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social networks have become in the last decade central to political life.
However, to those interested in analysing the communication strategies of
parties and candidates at election time, the introduction of the Internet into
the political sphere has proved a mixed blessing. Indeed, while retrieving,
consulting, and archiving original documents pertaining to a specific campaign
have become easier, faster, and achievable on a larger scale, thus opening up a
promising El Dorado for research in this area, studying online campaigns has
also inevitably introduced new technical, methodological and legal challenges
which have turned out to be increasingly complex for academics in the
humanities and social sciences to solve on their own.This paper therefore
proposes to provide feedback on experience and experimental validation from a
multidisciplinary project called POLIWEB devoted to the comparative analysis of
political campaigns on social media in the run up to the 2014 elections to the
European Parliament in France and in the United Kingdom. Together with
observations from a humanities' perspective on issues related to such a
project, this paper also presents experimental results concerning three of the
data collection life cycle phases: collection, cleaning, and storage. The
outcome is a data collection ready to be analysed for various purposes meant to
address the political science topic under consideration.
","[{'version': 'v1', 'created': 'Thu, 14 Mar 2019 09:56:18 GMT'}]",2019-03-18,"[['Castel', 'Géraldine', '', 'ILCEA4'], ['Vargas-Solar', 'Genoveva', '', 'ILCEA4'], ['Espinosa-Oviedo', 'Javier', '', 'TU Delft']]","['Politics', 'campaigns', 'elections', 'database', 'methodology', 'collaboration', 'Big Data', 'Digital Humanities']"
7016,2112.09391,Michael Saidani,"Michael Saidani (LGI), Harrison Kim, Bernard Yannou (LGI)","Can Machine Learning Tools Support the Identification of Sustainable
  Design Leads From Product Reviews? Opportunities and Challenges","ASME 2021 International Design Engineering Technical Conferences and
  Computers and Information in Engineering Conference, Aug 2021, Virtual,
  United States",,10.1115/DETC2021-70613,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing number of product reviews posted online is a gold mine for
designers to know better about the products they develop, by capturing the
voice of customers, and to improve these products accordingly. In the meantime,
product design and development have an essential role in creating a more
sustainable future. With the recent advance of artificial intelligence
techniques in the field of natural language processing, this research aims to
develop an integrated machine learning solution to obtain sustainable design
insights from online product reviews automatically. In this paper, the
opportunities and challenges offered by existing frameworks - including Python
libraries, packages, as well as state-of-the-art algorithms like BERT - are
discussed, illustrated, and positioned along an ad hoc machine learning
process. This contribution discusses the opportunities to reach and the
challenges to address for building a machine learning pipeline, in order to get
insights from product reviews to design more sustainable products, including
the five following stages, from the identification of sustainability-related
reviews to the interpretation of sustainable design leads: data collection,
data formatting, model training, model evaluation, and model deployment.
Examples of sustainable design insights that can be produced out of product
review mining and processing are given. Finally, promising lines for future
research in the field are provided, including case studies putting in parallel
standard products with their sustainable alternatives, to compare the features
valued by customers and to generate in fine relevant sustainable design leads.
","[{'version': 'v1', 'created': 'Fri, 17 Dec 2021 08:53:58 GMT'}]",2021-12-20,"[['Saidani', 'Michael', '', 'LGI'], ['Kim', 'Harrison', '', 'LGI'], ['Yannou', 'Bernard', '', 'LGI']]","['sustainable design', 'data-driven design', 'machine']"
7017,1712.07476,Renato Portugal,"A. Abreu, L. Cunha, T. Fernandes, C. de Figueiredo, L. Kowada, F.
  Marquezino, D. Posner, R. Portugal","The graph tessellation cover number: extremal bounds, efficient
  algorithms and hardness","13 pages, 5 figs, accepted in Latin 2018","Theoretical Computer Science 801, 175-191, 2020",10.1016/j.tcs.2019.09.013,,cs.DM cs.CC math.CO quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A tessellation of a graph is a partition of its vertices into vertex disjoint
cliques. A tessellation cover of a graph is a set of tessellations that covers
all of its edges. The $t$-tessellability problem aims to decide whether there
is a tessellation cover of the graph with $t$ tessellations. This problem is
motivated by its applications to quantum walk models, in especial, the
evolution operator of the staggered model is obtained from a graph tessellation
cover. We establish upper bounds on the tessellation cover number given by the
minimum between the chromatic index of the graph and the chromatic number of
its clique graph and we show graph classes for which these bounds are tight. We
prove $\mathcal{NP}$-completeness for $t$-tessellability if the instance is
restricted to planar graphs, chordal (2,1)-graphs, (1,2)-graphs, diamond-free
graphs with diameter five, or for any fixed $t$ at least 3. On the other hand,
we improve the complexity for 2-tessellability to a linear-time algorithm.
","[{'version': 'v1', 'created': 'Wed, 20 Dec 2017 13:32:29 GMT'}]",2021-06-24,"[['Abreu', 'A.', ''], ['Cunha', 'L.', ''], ['Fernandes', 'T.', ''], ['de Figueiredo', 'C.', ''], ['Kowada', 'L.', ''], ['Marquezino', 'F.', ''], ['Posner', 'D.', ''], ['Portugal', 'R.', '']]","['staggered quantum walk', 'clique graph', 'tessellation']"
7018,2212.13613,Joachim Moortgat,"Joachim Moortgat, Ziwei Li, Michael Durand, Ian Howat, Bidhyananda
  Yadav, Chunli Dai","Deep Learning Models for River Classification at Sub-Meter Resolutions
  from Multispectral and Panchromatic Commercial Satellite Imagery","21 pages, 10 figures, 3 tables","Remote Sensing of Environment, Volume 282, 1 December 2022, page
  113279",10.1016/j.rse.2022.113279,,cs.CV cs.LG eess.IV physics.geo-ph,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Remote sensing of the Earth's surface water is critical in a wide range of
environmental studies, from evaluating the societal impacts of seasonal
droughts and floods to the large-scale implications of climate change.
Consequently, a large literature exists on the classification of water from
satellite imagery. Yet, previous methods have been limited by 1) the spatial
resolution of public satellite imagery, 2) classification schemes that operate
at the pixel level, and 3) the need for multiple spectral bands. We advance the
state-of-the-art by 1) using commercial imagery with panchromatic and
multispectral resolutions of 30 cm and 1.2 m, respectively, 2) developing
multiple fully convolutional neural networks (FCN) that can learn the
morphological features of water bodies in addition to their spectral
properties, and 3) FCN that can classify water even from panchromatic imagery.
This study focuses on rivers in the Arctic, using images from the Quickbird,
WorldView, and GeoEye satellites. Because no training data are available at
such high resolutions, we construct those manually. First, we use the RGB, and
NIR bands of the 8-band multispectral sensors. Those trained models all achieve
excellent precision and recall over 90% on validation data, aided by on-the-fly
preprocessing of the training data specific to satellite imagery. In a novel
approach, we then use results from the multispectral model to generate training
data for FCN that only require panchromatic imagery, of which considerably more
is available. Despite the smaller feature space, these models still achieve a
precision and recall of over 85%. We provide our open-source codes and trained
model parameters to the remote sensing community, which paves the way to a wide
range of environmental hydrology applications at vastly superior accuracies and
2 orders of magnitude higher spatial resolution than previously possible.
","[{'version': 'v1', 'created': 'Tue, 27 Dec 2022 20:56:34 GMT'}]",2022-12-29,"[['Moortgat', 'Joachim', ''], ['Li', 'Ziwei', ''], ['Durand', 'Michael', ''], ['Howat', 'Ian', ''], ['Yadav', 'Bidhyananda', ''], ['Dai', 'Chunli', '']]","['Remote sensing', 'hydrology', 'rivers', 'deep learning', 'convolutional neural networks']"
7019,2109.12664,Salem Alqahtani,Salem Alqahtani and Murat Demirbas,"BigBFT: A Multileader Byzantine Fault Tolerance Protocol for High
  Throughput",11,,10.1109/IPCCC51483.2021.9679432,,cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper describes BigBFT, a multi-leader Byzantine fault tolerance
protocol that achieves high throughput and scalable consensus in blockchain
systems. BigBFT achieves this by (1) enabling every node to be a leader that
can propose and order the blocks in parallel, (2) piggybacking votes within
rounds, (3) pipelining blocks across rounds, and (4) using only two
communication steps to order blocks in the common case.
  BigBFT has an amortized communication cost of $O(n)$ over $n$ requests. We
evaluate BigBFT's performance both analytically, using back-of-the-envelope
load formulas to construct a cost analysis, and also empirically by
implementing it in our PaxiBFT framework. Our evaluation compares BigBFT with
PBFT, Tendermint, Streamlet, and Hotstuff under various workloads using
deployments of 4 to 20 nodes. Our results show that BigBFT outperforms PBFT,
Tendermint, Streamlet, and Hotstuff protocols either in terms of latency (by up
to $70\%$) or in terms of throughput (by up to $190\%$).
","[{'version': 'v1', 'created': 'Sun, 26 Sep 2021 18:00:27 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Oct 2021 22:32:27 GMT'}]",2022-01-25,"[['Alqahtani', 'Salem', ''], ['Demirbas', 'Murat', '']]","['Byzantine fault tolerance', 'permissioned blockchain', 'distributed ledgers consensus']"
7020,1906.10416,Ralph Ankele,"Ralph Ankele, Stefan Marksteiner, Kai Nahrgang, Heribert Vallant","Requirements and Recommendations for IoT/IIoT Models to automate
  Security Assurance through Threat Modelling, Security Analysis and
  Penetration Testing","8 pages, Proceedings of the 14th International Conference on
  Availability, Reliability and Security (ARES 2019) (ARES '19), August 26-29,
  2019, Canterbury, United Kingdom",,10.1145/3339252.3341482,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  The factories of the future require efficient interconnection of their
physical machines into the cyber space to cope with the emerging need of an
increased uptime of machines, higher performance rates, an improved level of
productivity and a collective collaboration along the supply chain. With the
rapid growth of the Internet of Things (IoT), and its application in industrial
areas, the so called Industrial Internet of Things (IIoT)/Industry 4.0 emerged.
However, further to the rapid growth of IoT/IIoT systems, cyber attacks are an
emerging threat and simple manual security testing can often not cope with the
scale of large IoT/IIoT networks. In this paper, we suggest to extract metadata
from commonly used diagrams and models in a typical software development
process, to automate the process of threat modelling, security analysis and
penetration testing, without detailed prior security knowledge. In that
context, we present requirements and recommendations for metadata in IoT/IIoT
models that are needed as necessary input parameters of security assurance
tools.
","[{'version': 'v1', 'created': 'Tue, 25 Jun 2019 09:43:32 GMT'}]",2019-06-26,"[['Ankele', 'Ralph', ''], ['Marksteiner', 'Stefan', ''], ['Nahrgang', 'Kai', ''], ['Vallant', 'Heribert', '']]","['IoT', 'IIoT', 'Industry 4']"
7021,2007.05351,Marc Aubreville,"Christof A. Bertram and Mitko Veta and Christian Marzahl and Nikolas
  Stathonikos and Andreas Maier and Robert Klopfleisch and Marc Aubreville","Are pathologist-defined labels reproducible? Comparison of the TUPAC16
  mitotic figure dataset with an alternative set of labels","10 pages, submitted to LABELS@MICCAI 2020","In: Cardoso J. et al. (eds) Interpretable and Annotation-Efficient
  Learning for Medical Image Computing. IMIMIC 2020, MIL3ID 2020, LABELS 2020.
  Lecture Notes in Computer Science, vol 12446. Springer, Cham",10.1007/978-3-030-61166-8_22,,cs.CV cs.LG eess.IV q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pathologist-defined labels are the gold standard for histopathological data
sets, regardless of well-known limitations in consistency for some tasks. To
date, some datasets on mitotic figures are available and were used for
development of promising deep learning-based algorithms. In order to assess
robustness of those algorithms and reproducibility of their methods it is
necessary to test on several independent datasets. The influence of different
labeling methods of these available datasets is currently unknown. To tackle
this, we present an alternative set of labels for the images of the auxiliary
mitosis dataset of the TUPAC16 challenge. Additional to manual mitotic figure
screening, we used a novel, algorithm-aided labeling process, that allowed to
minimize the risk of missing rare mitotic figures in the images. All potential
mitotic figures were independently assessed by two pathologists. The novel,
publicly available set of labels contains 1,999 mitotic figures (+28.80%) and
additionally includes 10,483 labels of cells with high similarities to mitotic
figures (hard examples). We found significant difference comparing F_1 scores
between the original label set (0.549) and the new alternative label set
(0.735) using a standard deep learning object detection architecture. The
models trained on the alternative set showed higher overall confidence values,
suggesting a higher overall label consistency. Findings of the present study
show that pathologists-defined labels may vary significantly resulting in
notable difference in the model performance. Comparison of deep learning-based
algorithms between independent datasets with different labeling methods should
be done with caution.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 12:44:54 GMT'}]",2020-10-22,"[['Bertram', 'Christof A.', ''], ['Veta', 'Mitko', ''], ['Marzahl', 'Christian', ''], ['Stathonikos', 'Nikolas', ''], ['Maier', 'Andreas', ''], ['Klopfleisch', 'Robert', ''], ['Aubreville', 'Marc', '']]","['breast cancer', 'mitotic figures', 'computer-aided annotation', 'deep learning']"
7022,2008.06948,Leon Moonen,Carl Martin Rosenberg and Leon Moonen,Spectrum-Based Log Diagnosis,"Published in ESEM'20: ACM/IEEE International Symposium on Empirical
  Software Engineering and Measurement (ESEM), October 8-9, 2020, Bari, Italy.
  ACM, 12 pages",,10.1145/3382494.3410684,,cs.SE cs.IR,http://creativecommons.org/licenses/by/4.0/,"  We present and evaluate Spectrum-Based Log Diagnosis (SBLD), a method to help
developers quickly diagnose problems found in complex integration and
deployment runs. Inspired by Spectrum-Based Fault Localization, SBLD leverages
the differences in event occurrences between logs for failing and passing runs,
to highlight events that are stronger associated with failing runs.
  Using data provided by our industrial partner, we empirically investigate the
following questions: (i) How well does SBLD reduce the effort needed to
identify all failure-relevant events in the log for a failing run? (ii) How is
the performance of SBLD affected by available data? (iii) How does SBLD compare
to searching for simple textual patterns that often occur in failure-relevant
events? We answer (i) and (ii) using summary statistics and heatmap
visualizations, and for (iii) we compare three configurations of SBLD (with
resp. minimum, median and maximum data) against a textual search using Wilcoxon
signed-rank tests and the Vargha-Delaney measure of stochastic superiority.
  Our evaluation shows that (i) SBLD achieves a significant effort reduction
for the dataset used, (ii) SBLD benefits from additional logs for passing runs
in general, and it benefits from additional logs for failing runs when there is
a proportional amount of logs for passing runs in the data. Finally, (iii) SBLD
and textual search are roughly equally effective at effort-reduction, while
textual search has a slightly better recall. We investigate the cause, and
discuss how it is due to the characteristics of a specific part of our data.
  We conclude that SBLD shows promise as a method for diagnosing failing runs,
that its performance is positively affected by additional data, but that it
does not outperform textual search on the dataset considered. Future work
includes investigating SBLD's generalizability on additional datasets.
","[{'version': 'v1', 'created': 'Sun, 16 Aug 2020 16:03:22 GMT'}]",2021-01-08,"[['Rosenberg', 'Carl Martin', ''], ['Moonen', 'Leon', '']]","['continuous engineering', 'failure diagnosis', 'log analysis', 'log mining']"
7023,2002.05659,Mahdi Miraz,Mahdi H. Miraz and Marie Haikel-Elsabeh,"Analysis of Users' Behaviour and Adoption Trends of Social Media Payment
  Platforms",,"2019 International Conference on Computing, Electronics &
  Communications Engineering (iCCECE), London, United Kingdom, 2019, pp.
  197-202",10.1109/iCCECE46942.2019.8941991,,cs.CY cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The recent proliferation of Electronic Commerce (E-commerce) has been further
escalated by multifaceted emerging payment solutions such as cryptocurrencies,
mobile, peer-to-peer (P2P) and social media payment platforms. While these
technological advancements are gaining tremendous popularity, mostly for their
ease of use, various impediments such as security and privacy concerns,
societal and cultural norms etc. forbear the users' adoption trends to some
extents. This article examines the current status of the social media payment
platforms as well as the projection of future adoption trends. Our research
underlines the motivations and obstacles to the adoption of social media
platforms.
","[{'version': 'v1', 'created': 'Sun, 5 Jan 2020 12:08:43 GMT'}]",2020-02-14,"[['Miraz', 'Mahdi H.', ''], ['Haikel-Elsabeh', 'Marie', '']]","['Diffusion of Innovation', 'E-Commerce', 'Mobile Payment Platform', 'Social Media Payment Platform', 'Technology Adoption Trend', 'Users’ Behaviour']"
7024,2004.02634,Katharina Huber,"Katharina T. Huber, Simone Linz, Vincent Moulton",Weakly displaying trees in temporal tree-child network,,"Journal of Mathematical Biology, 82, Article number. 40, 2021",10.1007/s00285-021-01594-2,,cs.DM q-bio.PE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently there has been considerable interest in the problem of finding a
phylogenetic network with a minimum number of reticulation vertices which
displays a given set of phylogenetic trees, that is, a network with minimum
hybrid number. Even so, for certain evolutionary scenarios insisting that a
network displays the set of trees can be an overly restrictive assumption. In
this paper, we consider the less restrictive notion of displaying called weakly
displaying and, in particular, a special case of this which we call rigidly
displaying. We characterize when two trees can be rigidly displayed by a
temporal tree-child network in terms of fork-picking sequences, a concept that
is closely related to that of cherry-picking sequences. We also show that, in
case it exists, the rigid hybrid number for two phylogenetic trees is given by
a minimum weight fork-picking sequence for the trees, and that the rigid hybrid
number can be quite different from the related beaded- and temporal-hybrid
numbers.
","[{'version': 'v1', 'created': 'Fri, 3 Apr 2020 15:12:24 GMT'}]",2021-04-13,"[['Huber', 'Katharina T.', ''], ['Linz', 'Simone', ''], ['Moulton', 'Vincent', '']]","['Phylogenetic network', 'hybrid number', 'cherry-picking sequence', 'forkpicking sequence', 'weakly displaying', 'rigidly displaying', 'temporal tree-child network']"
7025,2008.00474,Aryeh Wiesen,"David Dayan, Rivka Kaplinsky, Aryeh Wiesen, and Simon Bloch",MDA Models and PIM/PSM Transformations Using Extended Automata,"11 pages, 5 figures, 2 tables",,10.1109/SwSTE.2007.13,,cs.SE cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a model of execution platform for the OMG request of a
generic PlatformIndependent-Model (PIM) allowing realization of the Model
Driven Architecture (MDA) standard. We propose AMDA (Automata based MDA), a
method based on the use of parallel automata, which can be a common tool for
building a PIM from UML diagrams (including OCL) and transforming the PIM to
PSM automata and further to compilable code. Each platform would then have a
mechanism to execute the translated code. Our architecture for a general PSM
translator of these automata allows portable execution on various specific
implementation platforms. This general translator must be written, once, for
the languages and with the libraries of the required specific PSM. This allows
also interoperability between different PSMs. An ATM case study example is
presented to illustrate the approach.
","[{'version': 'v1', 'created': 'Sun, 2 Aug 2020 12:53:04 GMT'}]",2020-08-04,"[['Dayan', 'David', ''], ['Kaplinsky', 'Rivka', ''], ['Wiesen', 'Aryeh', ''], ['Bloch', 'Simon', '']]","['MDA', 'UML', 'Extended Automata', 'XSLT.   1']"
7026,1909.10443,Robert Grupp,"Robert Grupp, Mehran Armand, Russell Taylor","Patch-Based Image Similarity for Intraoperative 2D/3D Pelvis
  Registration During Periacetabular Osteotomy",Presented at MICCAI CLIP Workshop 2018,"In OR 2.0 Context-Aware Operating Theaters, Computer Assisted
  Robotic Endoscopy, Clinical Image-Based Procedures, and Skin Image Analysis
  2018 Sep 16 (pp. 153-163). Springer, Cham",10.1007/978-3-030-01201-4_17,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Periacetabular osteotomy is a challenging surgical procedure for treating
developmental hip dysplasia, providing greater coverage of the femoral head via
relocation of a patient's acetabulum. Since fluoroscopic imaging is frequently
used in the surgical workflow, computer-assisted X-Ray navigation of osteotomes
and the relocated acetabular fragment should be feasible. We use
intensity-based 2D/3D registration to estimate the pelvis pose with respect to
fluoroscopic images, recover relative poses of multiple views, and triangulate
landmarks which may be used for navigation. Existing similarity metrics are
unable to consistently account for the inherent mismatch between the
preoperative intact pelvis, and the intraoperative reality of a fractured
pelvis. To mitigate the effect of this mismatch, we continuously estimate the
relevance of each pixel to solving the registration and use these values as
weightings in a patch-based similarity metric. Limiting computation to randomly
selected subsets of patches results in faster runtimes than existing
patch-based methods. A simulation study was conducted with random fragment
shapes, relocations, and fluoroscopic views, and the proposed method achieved a
1.7 mm mean triangulation error over all landmarks, compared to mean errors of
3 mm and 2.8 mm for the non-patched and image-intensity-variance-weighted patch
similarity metrics, respectively.
","[{'version': 'v1', 'created': 'Mon, 23 Sep 2019 15:53:49 GMT'}]",2019-10-31,"[['Grupp', 'Robert', ''], ['Armand', 'Mehran', ''], ['Taylor', 'Russell', '']]","['X-ray navigation', '2D/3D registration', 'Periacetabular osteotomy']"
7027,2105.14874,Zhou Yang,"Zhou Yang, Muhammad Hilmi Asyrofi and David Lo",BiasRV: Uncovering Biased Sentiment Predictions at Runtime,Accepted to appear in the Demonstrations track of the ESEC/FSE 2021,,10.1145/3468264.3473117,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sentiment analysis (SA) systems, though widely applied in many domains, have
been demonstrated to produce biased results. Some research works have been done
in automatically generating test cases to reveal unfairness in SA systems, but
the community still lacks tools that can monitor and uncover biased predictions
at runtime. This paper fills this gap by proposing BiasRV, the first tool to
raise an alarm when a deployed SA system makes a biased prediction on a given
input text. To implement this feature, BiasRV dynamically extracts a template
from an input text and from the template generates gender-discriminatory
mutants (semantically-equivalent texts that only differ in gender information).
Based on popular metrics used to evaluate the overall fairness of an SA system,
we define distributional fairness property for an individual prediction of an
SA system. This property specifies a requirement that for one piece of text,
mutants from different gender classes should be treated similarly as a whole.
Verifying the distributional fairness property causes much overhead to the
running system. To run more efficiently, BiasRV adopts a two-step heuristic:
(1) sampling several mutants from each gender and checking if the system
predicts them as of the same sentiment, (2) checking distributional fairness
only when sampled mutants have conflicting results. Experiments show that
compared to directly checking the distributional fairness property for each
input text, our two-step heuristic can decrease overhead used for analyzing
mutants by 73.81% while only resulting in 6.7% of biased predictions being
missed. Besides, BiasRV can be used conveniently without knowing the
implementation of SA systems. Future researchers can easily extend BiasRV to
detect more types of bias, e.g. race and occupation.
","[{'version': 'v1', 'created': 'Mon, 31 May 2021 10:55:29 GMT'}, {'version': 'v2', 'created': 'Sat, 26 Jun 2021 08:30:12 GMT'}]",2022-01-06,"[['Yang', 'Zhou', ''], ['Asyrofi', 'Muhammad Hilmi', ''], ['Lo', 'David', '']]","['Sentiment Analysis', 'Ethical AI', 'Fairness', 'Runtime Verification']"
7028,1912.08644,Leonardo Andr\'es Espinosa Leal,"Leonardo Espinosa Leal, Kaj-Mikael Bj\""ork, Amaury Lendasse, Anton
  Akusok","A Web Page Classifier Library Based on Random Image Content Analysis
  Using Deep Learning","4 pages, 3 figures. Proceedings of the 11th PErvasive Technologies
  Related to Assistive Environments Conference. ACM, 2018",,10.1145/3197768.3201525,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a methodology and the corresponding Python library
1 for the classification of webpages. Our method retrieves a fixed number of
images from a given webpage, and based on them classifies the webpage into a
set of established classes with a given probability. The library trains a
random forest model build upon the features extracted from images by a
pre-trained deep network. The implementation is tested by recognizing weapon
class webpages in a curated list of 3859 websites. The results show that the
best method of classifying a webpage into the studies classes is to assign the
class according to the maximum probability of any image belonging to this
(weapon) class being above the threshold, across all the retrieved images.
Further research explores the possibilities for the developed methodology to
also apply in image classification for healthcare applications.
","[{'version': 'v1', 'created': 'Wed, 18 Dec 2019 14:50:18 GMT'}]",2019-12-19,"[['Leal', 'Leonardo Espinosa', ''], ['Björk', 'Kaj-Mikael', ''], ['Lendasse', 'Amaury', ''], ['Akusok', 'Anton', '']]","['webpage classification', 'computer vision', 'deep learning']"
7029,2106.08554,Yuzhe Tang,"Yibo Wang and Kai Li and Yuzhe Tang and Jiaqi Chen and Qi Zhang and
  Xiapu Luo and Ting Chen","iBatch: Saving Ethereum Fees via Secure and Cost-Effective Batching of
  Smart-Contract Invocations",Extended version from the ESEC/FSE 2021 paper,,10.1145/3468264.3468568,,cs.CR cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper presents iBatch, a middleware system running on top of an
operational Ethereum network to enable secure batching of smart-contract
invocations against an untrusted relay server off-chain. iBatch does so at a
low overhead by validating the server's batched invocations in smart contracts
without additional states. The iBatch mechanism supports a variety of policies,
ranging from conservative to aggressive batching, and can be configured
adaptively to the current workloads. iBatch automatically rewrites smart
contracts to integrate with legacy applications and support large-scale
deployment.
  For cost evaluation, we develop a platform with fast and cost-accurate
transaction replaying, build real transaction benchmarks on popular Ethereum
applications, and build a functional prototype of iBatch on Ethereum. The
evaluation results show that iBatch saves 14.6%-59.1% Gas cost per invocation
with a moderate 2-minute delay and 19.06%-31.52% Ether cost per invocation with
a delay of 0.26-1.66 blocks.
","[{'version': 'v1', 'created': 'Wed, 16 Jun 2021 05:13:48 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Aug 2021 04:13:33 GMT'}]",2021-08-25,"[['Wang', 'Yibo', ''], ['Li', 'Kai', ''], ['Tang', 'Yuzhe', ''], ['Chen', 'Jiaqi', ''], ['Zhang', 'Qi', ''], ['Luo', 'Xiapu', ''], ['Chen', 'Ting', '']]","['Blockchains', 'smart contracts', 'DeFi', 'cost effectiveness', 'replay attacks']"
7030,2101.08123,Panagiotis Kourtesis P.K.,"Panagiotis Kourtesis, Simona Collina, Leonidas A.A. Doumas, and Sarah
  E. MacPherson","Technological Competence is a Precondition for Effective Implementation
  of Virtual Reality Head Mounted Displays in Human Neuroscience: A
  Technological Review and Meta-analysis","Published in Frontiers in Human Neuroscience, 4 Figures, 4 Tables","2019,Frontiers in Human Neuroscience, 13, p.342",10.3389/fnhum.2019.00342,,cs.HC cs.CY cs.MM,http://creativecommons.org/licenses/by/4.0/,"  Immersive virtual reality (VR) emerges as a promising research and clinical
tool. However, several studies suggest that VR induced adverse symptoms and
effects (VRISE) may undermine the health and safety standards, and the
reliability of the scientific results. In the current literature review, the
technical reasons for the adverse symptomatology are investigated to provide
suggestions and technological knowledge for the implementation of VR
head-mounted display (HMD) systems in cognitive neuroscience. The technological
systematic literature indicated features pertinent to display, sound, motion
tracking, navigation, ergonomic interactions, user experience, and computer
hardware that should be considered by the researchers. Subsequently, a
meta-analysis of 44 neuroscientific or neuropsychological studies involving VR
HMD systems was performed. The meta-analysis of the VR studies demonstrated
that new generation HMDs induced significantly less VRISE and marginally fewer
dropouts.Importantly, the commercial versions of the new generation HMDs with
ergonomic interactions had zero incidents of adverse symptomatology and
dropouts. HMDs equivalent to or greater than the commercial versions of
contemporary HMDs accompanied with ergonomic interactions are suitable for
implementation in cognitive neuroscience. In conclusion, researchers
technological competency, along with meticulous methods and reports pertinent
to software, hardware, and VRISE, are paramount to ensure the health and safety
standards and the reliability of neuroscientific results.
","[{'version': 'v1', 'created': 'Wed, 20 Jan 2021 13:48:11 GMT'}]",2021-01-21,"[['Kourtesis', 'Panagiotis', ''], ['Collina', 'Simona', ''], ['Doumas', 'Leonidas A. A.', ''], ['MacPherson', 'Sarah E.', '']]","['Virtual Reality1', 'VRISE2', 'HMD3', 'Cybersickness4', 'Neuroscience5', 'Neuropsychology6', 'Psychology7', 'VR8']"
7031,1712.06908,Ayan Kumar Bhunia,"Ayan Kumar Bhunia, Partha Pratim Roy, Akash Mohta, Umapada Pal","Cross-language Framework for Word Recognition and Spotting of Indic
  Scripts","Accepted in Pattern Recognition, Elsevier(2018)",,10.1016/j.patcog.2018.01.034,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Handwritten word recognition and spotting of low-resource scripts are
difficult as sufficient training data is not available and it is often
expensive for collecting data of such scripts. This paper presents a novel
cross language platform for handwritten word recognition and spotting for such
low-resource scripts where training is performed with a sufficiently large
dataset of an available script (considered as source script) and testing is
done on other scripts (considered as target script). Training with one source
script and testing with another script to have a reasonable result is not easy
in handwriting domain due to the complex nature of handwriting variability
among scripts. Also it is difficult in mapping between source and target
characters when they appear in cursive word images. The proposed Indic cross
language framework exploits a large resource of dataset for training and uses
it for recognizing and spotting text of other target scripts where sufficient
amount of training data is not available. Since, Indic scripts are mostly
written in 3 zones, namely, upper, middle and lower, we employ zone-wise
character (or component) mapping for efficient learning purpose. The
performance of our cross-language framework depends on the extent of similarity
between the source and target scripts. Hence, we devise an entropy based script
similarity score using source to target character mapping that will provide a
feasibility of cross language transcription. We have tested our approach in
three Indic scripts, namely, Bangla, Devanagari and Gurumukhi, and the
corresponding results are reported.
","[{'version': 'v1', 'created': 'Tue, 19 Dec 2017 13:12:29 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Jan 2018 15:10:48 GMT'}]",2018-02-06,"[['Bhunia', 'Ayan Kumar', ''], ['Roy', 'Partha Pratim', ''], ['Mohta', 'Akash', ''], ['Pal', 'Umapada', '']]","['Indic Script Recognition', 'Handwritten Word Recognition', 'Word Spotting', 'Cross']"
7032,2209.03160,Yiyang Ma,"Yiyang Ma, Huan Yang, Bei Liu, Jianlong Fu, Jiaying Liu","AI Illustrator: Translating Raw Descriptions into Images by Prompt-based
  Cross-Modal Generation",,,10.1145/3503161.3547790,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  AI illustrator aims to automatically design visually appealing images for
books to provoke rich thoughts and emotions. To achieve this goal, we propose a
framework for translating raw descriptions with complex semantics into
semantically corresponding images. The main challenge lies in the complexity of
the semantics of raw descriptions, which may be hard to be visualized (e.g.,
""gloomy"" or ""Asian""). It usually poses challenges for existing methods to
handle such descriptions. To address this issue, we propose a Prompt-based
Cross-Modal Generation Framework (PCM-Frame) to leverage two powerful
pre-trained models, including CLIP and StyleGAN. Our framework consists of two
components: a projection module from Text Embeddings to Image Embeddings based
on prompts, and an adapted image generation module built on StyleGAN which
takes Image Embeddings as inputs and is trained by combined semantic
consistency losses. To bridge the gap between realistic images and illustration
designs, we further adopt a stylization model as post-processing in our
framework for better visual effects. Benefiting from the pre-trained models,
our method can handle complex descriptions and does not require external paired
data for training. Furthermore, we have built a benchmark that consists of 200
raw descriptions. We conduct a user study to demonstrate our superiority over
the competing methods with complicated texts. We release our code at
https://github.com/researchmm/AI_Illustrator.
","[{'version': 'v1', 'created': 'Wed, 7 Sep 2022 13:53:54 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Sep 2022 04:24:35 GMT'}]",2022-09-09,"[['Ma', 'Yiyang', ''], ['Yang', 'Huan', ''], ['Liu', 'Bei', ''], ['Fu', 'Jianlong', ''], ['Liu', 'Jiaying', '']]","['Text-to-image translation', 'Text-to-image semantic alignment', 'Embedding prompt']"
7033,2008.00853,Tristan Miller,"Tristan Miller, Erik-L\^an Do Dinh, Edwin Simpson and Iryna Gurevych","Predicting the Humorousness of Tweets Using Gaussian Process Preference
  Learning","8 pages, 1 figure. A previous version of this paper was published as
  ""OFAI-UKP at HAHA@IberLEF2019: Predicting the Humorousness of Tweets Using
  Gaussian Process Preference Learning"" in the Proceedings of the Iberian
  Languages Evaluation Forum (IberLEF 2019), volume 2421 of CEUR Workshop
  Proceedings, pages 180-190, 2019","Procesamiento del Lenguaje Natural, 64:37-44, March 2020",10.26342/2020-64-4,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Most humour processing systems to date make at best discrete, coarse-grained
distinctions between the comical and the conventional, yet such notions are
better conceptualized as a broad spectrum. In this paper, we present a
probabilistic approach, a variant of Gaussian process preference learning
(GPPL), that learns to rank and rate the humorousness of short texts by
exploiting human preference judgments and automatically sourced linguistic
annotations. We apply our system, which is similar to one that had previously
shown good performance on English-language one-liners annotated with pairwise
humorousness annotations, to the Spanish-language data set of the
HAHA@IberLEF2019 evaluation campaign. We report system performance for the
campaign's two subtasks, humour detection and funniness score prediction, and
discuss some issues arising from the conversion between the numeric scores used
in the HAHA@IberLEF2019 data and the pairwise judgment annotations required for
our method.
","[{'version': 'v1', 'created': 'Mon, 3 Aug 2020 13:05:42 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Mar 2021 20:30:50 GMT'}]",2021-03-30,"[['Miller', 'Tristan', ''], ['Dinh', 'Erik-Lân Do', ''], ['Simpson', 'Edwin', ''], ['Gurevych', 'Iryna', '']]","['Computational humour', 'humour', 'Gaussian process preference learning', 'GPPL', 'best–worst scaling']"
7034,2108.00567,Gunnar Brataas,"Gunnar Brataas (1), Antonio Martini (2), Geir Kjetil Hanssen (1) Georg
  R{\ae}der (3) ((1) SINTEF Digital, Trondheim, Norway (2) University of Oslo,
  Norway (3) TietoEVRY, Fornebu, Norway)","Agile Elicitation of Scalability Requirements for Open Systems: A Case
  Study","36 pages, 7 figures, 6 tables, accepted for publication in Journal of
  Systems and Software","Journal of Systems and Software, Volume 182, December 2021, 111064",10.1016/j.jss.2021.111064,,cs.SE cs.PF,http://creativecommons.org/licenses/by/4.0/,"  Eliciting scalability requirements during agile software development is
complicated and poorly described in previous research. This article presents a
lightweight artifact for eliciting scalability requirements during agile
software development: the ScrumScale model. The ScrumScale model is a simple
spreadsheet. The scalability concepts underlying the ScrumScale model are
clarified in this design science research, which also utilizes coordination
theory. This paper describes the open banking case study, where a legacy
banking system becomes open. This challenges the scalability of this legacy
system. The first step in understanding this challenge is to elicit the new
scalability requirements. In the open banking case study, key stakeholders from
TietoEVRY spent 55 hours eliciting TietoEVRY's open banking project's
scalability requirements. According to TietoEVRY, the ScrumScale model provided
a systematic way of producing scalability requirements. For TietoEVRY, the
scalability concepts behind the ScrumScale model also offered significant
advantages in dialogues with other stakeholders.
","[{'version': 'v1', 'created': 'Sun, 1 Aug 2021 23:44:09 GMT'}]",2021-11-10,"[['Brataas', 'Gunnar', ''], ['Martini', 'Antonio', ''], ['Hanssen', 'Geir Kjetil', ''], ['Ræder', 'Georg', '']]","['Performance requirements', 'software performance engineering', 'agile software development', 'nonfunctional requirements', 'open systems', 'design science']"
7035,2201.13278,Niklas Gard,"Niklas Gard, Anna Hilsmann, Peter Eisert","Combining Local and Global Pose Estimation for Precise Tracking of
  Similar Objects",Accepted at VISAPP 2022,,10.5220/0010882700003124,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a multi-object 6D detection and tracking pipeline
for potentially similar and non-textured objects. The combination of a
convolutional neural network for object classification and rough pose
estimation with a local pose refinement and an automatic mismatch detection
enables direct application in real-time AR scenarios. A new network
architecture, trained solely with synthetic images, allows simultaneous pose
estimation of multiple objects with reduced GPU memory consumption and enhanced
performance. In addition, the pose estimates are further improved by a local
edge-based refinement step that explicitly exploits known object geometry
information. For continuous movements, the sole use of local refinement reduces
pose mismatches due to geometric ambiguities or occlusions. We showcase the
entire tracking pipeline and demonstrate the benefits of the combined approach.
Experiments on a challenging set of non-textured similar objects demonstrate
the enhanced quality compared to the baseline method. Finally, we illustrate
how the system can be used in a real AR assistance application within the field
of construction.
","[{'version': 'v1', 'created': 'Mon, 31 Jan 2022 14:36:57 GMT'}]",2022-03-02,"[['Gard', 'Niklas', ''], ['Hilsmann', 'Anna', ''], ['Eisert', 'Peter', '']]","['6DoF Tracking', '6DoF Pose Estimation', 'Multi-object', 'Synthetic Training', 'Monocular', 'Augmented Reality']"
7036,1810.05313,Daniel Lemire,"Daniel Lemire, Melissa E. O'Neill","Xorshift1024*, Xorshift1024+, Xorshift128+ and Xoroshiro128+ Fail
  Statistical Tests for Linearity",,"Computational and Applied Mathematics 350, 2019",10.1016/j.cam.2018.10.019,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  L'Ecuyer & Simard's Big Crush statistical test suite has revealed statistical
flaws in many popular random number generators including Marsaglia's Xorshift
generators. Vigna recently proposed some 64-bit variations on the Xorshift
scheme that are further scrambled (i.e., Xorshift1024*, Xorshift1024+,
Xorshift128+, Xoroshiro128+). Unlike their unscrambled counterparts, they pass
Big Crush when interleaving blocks of 32 bits for each 64-bit word (most
significant, least significant, most significant, least significant, etc.). We
report that these scrambled generators systematically fail Big
Crush---specifically the linear-complexity and matrix-rank tests that detect
linearity---when taking the 32 lowest-order bits in reverse order from each
64-bit word.
","[{'version': 'v1', 'created': 'Fri, 12 Oct 2018 01:40:57 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Oct 2018 01:30:24 GMT'}]",2019-01-08,"[['Lemire', 'Daniel', ''], [""O'Neill"", 'Melissa E.', '']]","['Random Number Generator', 'Statistical Tests', 'Xorshift']"
7037,2008.01609,Simon Marynissen,"Simon Marynissen, Bart Bogaerts and Marc Denecker",Exploiting Game Theory for Analysing Justifications,"Paper presented at the 36th International Conference on Logic
  Programming (ICLP 2019), University Of Calabria, Rende (CS), Italy, September
  2020, 15+8 pages",Theory and Practice of Logic Programming 20 (2020) 880-894,10.1017/S1471068420000186,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Justification theory is a unifying semantic framework. While it has its roots
in non-monotonic logics, it can be applied to various areas in computer
science, especially in explainable reasoning; its most central concept is a
justification: an explanation why a property holds (or does not hold) in a
model. In this paper, we continue the study of justification theory by means of
three major contributions. The first is studying the relation between
justification theory and game theory. We show that justification frameworks can
be seen as a special type of games. The established connection provides the
theoretical foundations for our next two contributions. The second contribution
is studying under which condition two different dialects of justification
theory (graphs as explanations vs trees as explanations) coincide. The third
contribution is establishing a precise criterion of when a semantics induced by
justification theory yields consistent results. In the past proving that such
semantics were consistent took cumbersome and elaborate proofs. We show that
these criteria are indeed satisfied for all common semantics of logic
programming. This paper is under consideration for acceptance in Theory and
Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Tue, 4 Aug 2020 14:45:08 GMT'}]",2020-09-23,"[['Marynissen', 'Simon', ''], ['Bogaerts', 'Bart', ''], ['Denecker', 'Marc', '']]","['justification theory', 'positional games', 'logic programming', 'non-monotonic logic']"
7038,2104.02085,Stephen MacDonell,"Krassie Petrova, Stephen G. MacDonell and Dave Parry","Mobile Data Service Adoption and Use from a Service Supply Perspective:
  An Empirical Investigation","Conference proceeding, 10 pages, 1 figure, 7 tables, 1 appendix","Proceedings of the 13th International Joint Conference on
  e-Business and Telecommunications (ICE-B 2016). Lisbon, Portugal, SCITEPRESS,
  pp.86-97",10.5220/0005966100860097,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents the findings of an empirical study of the views of a
selection of mobile data service (MDS) supply chain participants about
anticipated MDS customer requirements and expectations, and about the MDS
environment. Applying an inductive thematic analysis approach, the study data
are first represented as a thematic map; the thematic map is then used to
formulate propositions that contribute an MDS supplier perspective to models
investigating MDS customer adoption and use.
","[{'version': 'v1', 'created': 'Fri, 26 Mar 2021 01:52:42 GMT'}]",2021-04-07,"[['Petrova', 'Krassie', ''], ['MacDonell', 'Stephen G.', ''], ['Parry', 'Dave', '']]","['Mobile Services', 'Mobile Applications', 'Service Supply', 'Stakeholder Views', 'Thematic Analysis']"
7039,2009.01077,Isotta Landi,"Isotta Landi, Veronica Mandelli, Michael V. Lombardo","reval: a Python package to determine best clustering solutions with
  stability-based relative clustering validation",,Patterns (2021),10.1016/j.patter.2021.100228,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Determining the best partition for a dataset can be a challenging task
because of 1) the lack of a priori information within an unsupervised learning
framework; and 2) the absence of a unique clustering validation approach to
evaluate clustering solutions. Here we present reval: a Python package that
leverages stability-based relative clustering validation methods to determine
best clustering solutions as the ones that best generalize to unseen data.
Statistical software, both in R and Python, usually rely on internal validation
metrics, such as silhouette, to select the number of clusters that best fits
the data. Meanwhile, open-source software solutions that easily implement
relative clustering techniques are lacking. Internal validation methods exploit
characteristics of the data itself to produce a result, whereas relative
approaches attempt to leverage the unknown underlying distribution of data
points looking for generalizable and replicable results. The implementation of
relative validation methods can further the theory of clustering by enriching
the already available methods that can be used to investigate clustering
results in different situations and for different data distributions. This work
aims at contributing to this effort by developing a stability-based method that
selects the best clustering solution as the one that replicates, via supervised
learning, on unseen subsets of data. The package works with multiple clustering
and classification algorithms, hence allowing both the automatization of the
labeling process and the assessment of the stability of different clustering
mechanisms.
","[{'version': 'v1', 'created': 'Thu, 27 Aug 2020 10:36:56 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Nov 2020 00:32:07 GMT'}]",2021-04-06,"[['Landi', 'Isotta', ''], ['Mandelli', 'Veronica', ''], ['Lombardo', 'Michael V.', '']]","['stability-based relative validation', 'clustering', 'unsupervised learning']"
7040,1604.02704,Javier Enciso,"Javier Enciso, Juan Vargas and Pablo Mart\'inez",Modeling and Simulation of Passenger Traffic in a National Airport,"8 pages, submitted to LACCEI 2016",,10.18687/laccei2016.1.1.217,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optimal operation of a country's air transport infrastructure plays a major
role in the economic development of nations. Due to the increasing use of air
transportation in today's world, flights' boarding times have become a concern
for both airlines and airports, thus the importance of knowing beforehand how
changes in flights demand parameters and physical airport layout will affect
passengers flow and boarding times. This paper presents a pedestrian modeling
study in which a national airport passenger flow was analyzed. The study was
conducted at Vanguardia National Airport in Villavicencio, Meta, Colombia.
Different effects of structural changes are shown and provide judging elements
for decision makers regarding passenger traffic in airport design.
","[{'version': 'v1', 'created': 'Sun, 10 Apr 2016 15:25:23 GMT'}]",2018-06-14,"[['Enciso', 'Javier', ''], ['Vargas', 'Juan', ''], ['Martínez', 'Pablo', '']]","['Passenger traffic flow', 'airport model', 'pedestrian']"
7041,2003.00584,David Daly,"David Daly, William Brown, Henrik Ingo, Jim O'Leary, David Bradford",Change Point Detection in Software Performance Testing,,,10.1145/3358960.3375791,,cs.SE cs.DB cs.PF,http://creativecommons.org/licenses/by/4.0/,"  We describe our process for automatic detection of performance changes for a
software product in the presence of noise. A large collection of tests run
periodically as changes to our software product are committed to our source
repository, and we would like to identify the commits responsible for
performance regressions. Previously, we relied on manual inspection of time
series graphs to identify significant changes. That was later replaced with a
threshold-based detection system, but neither system was sufficient for finding
changes in performance in a timely manner. This work describes our recent
implementation of a change point detection system built upon the E-Divisive
means algorithm. The algorithm produces a list of change points representing
significant changes from a given history of performance results. A human
reviews the list of change points for actionable changes, which are then
triaged for further inspection. Using change point detection has had a dramatic
impact on our ability to detect performance changes. Quantitatively, it has
dramatically dropped our false positive rate for performance changes, while
qualitatively it has made the entire performance evaluation process easier,
more productive (ex. catching smaller regressions), and more timely.
","[{'version': 'v1', 'created': 'Sun, 1 Mar 2020 21:01:25 GMT'}]",2020-03-03,"[['Daly', 'David', ''], ['Brown', 'William', ''], ['Ingo', 'Henrik', ''], [""O'Leary"", 'Jim', ''], ['Bradford', 'David', '']]","['change points', 'performance', 'testing', 'continuous integration']"
7042,2101.08444,Stephen MacDonell,"Laurie McLeod, Stephen G. MacDonell and Bill Doolin","Qualitative Research on Software Development: A Longitudinal Case Study
  Methodology","Journal Paper, 18 pages, 2 figures, 6 tables","Empirical Software Engineering 16(4)(2011), pp.430-459",10.1007/s10664-010-9153-5,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper reports the use of a qualitative methodology for conducting
longitudinal case study research on software development. We provide a detailed
description and explanation of appropriate methods of qualitative data
collection and analysis that can be utilized by other researchers in the
software engineering field. Our aim is to illustrate the utility of
longitudinal case study research, as a complement to existing methodologies for
studying software development, so as to enable the community to develop a
fuller and richer understanding of this complex, multi-dimensional phenomenon.
We discuss the insights gained and lessons learned from applying a longitudinal
qualitative approach to an empirical case study of a software development
project in a large multi-national organization. We evaluate the methodology
used to emphasize its strengths and to address the criticisms traditionally
made of qualitative research.
","[{'version': 'v1', 'created': 'Thu, 21 Jan 2021 05:10:42 GMT'}]",2021-01-22,"[['McLeod', 'Laurie', ''], ['MacDonell', 'Stephen G.', ''], ['Doolin', 'Bill', '']]","['Qualitative methods', 'longitudinal case study', 'software development', 'empirical research  1']"
7043,2105.14508,Luca Giuzzi DPhil,"Angela Aguglia, Michela Ceria, Luca Giuzzi","Some hypersurfaces over finite fields, minimal codes and secret sharing
  schemes",20 pages; fully revised version,"Designs, Codes and Cryptography (2022) 90:1503-1519",10.1007/s10623-022-01051-1,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linear error-correcting codes can be used for constructing secret sharing
schemes; however finding in general the access structures of these secret
sharing schemes and, in particular, determining efficient access structures is
difficult. Here we investigate the properties of certain algebraic
hypersurfaces over finite fields, whose intersection numbers with any
hyperplane only takes a few values; these varieties give rise to $q$-divisible
linear codes with at most $5$ weights. Furthermore, for $q$ odd these codes
turn out to be minimal and we characterize the access structures of the secret
sharing schemes based on their dual codes. Indeed, the secret sharing schemes
thus obtained are democratic, that is each participant belongs to the same
number of minimal access sets and can easily be described.
","[{'version': 'v1', 'created': 'Sun, 30 May 2021 11:35:46 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Jun 2021 15:57:42 GMT'}, {'version': 'v3', 'created': 'Thu, 26 Aug 2021 09:14:34 GMT'}, {'version': 'v4', 'created': 'Tue, 11 Jan 2022 21:03:08 GMT'}, {'version': 'v5', 'created': 'Sun, 5 Jun 2022 13:59:11 GMT'}]",2022-06-07,"[['Aguglia', 'Angela', ''], ['Ceria', 'Michela', ''], ['Giuzzi', 'Luca', '']]","['Algebraic variety', 'Hermitian variety', 'linear code', 'secret sharingscheme']"
7044,2103.08426,Tim Van Der Velden,"Tim van der Velden, Bob Rommes, Andreas Klink, Stefanie Reese, Johanna
  Waimann","A novel approach for the efficient modeling of material dissolution in
  electrochemical machining",,Int. J. Solids Struct. 229 (2021) 111106,10.1016/j.ijsolstr.2021.111106,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work presents a novel approach to efficiently model anodic dissolution
in electrochemical machining. Earlier modeling approaches employ a strict space
discretization of the anodic surface that is associated with a remeshing
procedure at every time step. Besides that, the presented model is formulated
by means of effective material parameters. Thereby, it allows to use a constant
mesh for the entire simulation and, thus, decreases the computational costs.
Based on Faraday's law of electrolysis, an effective dissolution level is
introduced, which describes the ratio of a dissolved volume and its
corresponding reference volume. This inner variable allows the modeling of the
complex dissolution process without the necessity of computationally expensive
remeshing by controlling the effective material parameters. Additionally, full
coupling of the thermoelectric problem is considered and its linearization and
numerical implementation are presented. The model shows good agreement with
analytical and experimental validation examples by yielding realistic results.
Furthermore, simulations of a pulsed electrochemical machining process yield a
process signature of the surface roughness related to the specific accumulated
electric charge. The numerical examples confirm the simulation's computational
efficiency and accurate modeling qualities.
","[{'version': 'v1', 'created': 'Mon, 15 Mar 2021 14:56:43 GMT'}]",2021-07-12,"[['van der Velden', 'Tim', ''], ['Rommes', 'Bob', ''], ['Klink', 'Andreas', ''], ['Reese', 'Stefanie', ''], ['Waimann', 'Johanna', '']]","['Anodic dissolution', 'Electrochemical machining', 'Finite element method']"
7045,1912.11856,Issam Hammad,"Issam Hammad, Kamal El-Sankary, and Jason Gu","A Comparative Study on Machine Learning Algorithms for the Control of a
  Wall Following Robot","Accepted and presented at IEEE International Conference on Robotics
  and Biomimetics (ROBIO) -2019","IEEE International Conference on Robotics and Biomimetics (ROBIO)
  2019",10.1109/ROBIO49542.2019.8961836,,cs.LG cs.CV cs.RO eess.IV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A comparison of the performance of various machine learning models to predict
the direction of a wall following robot is presented in this paper. The models
were trained using an open-source dataset that contains 24 ultrasound sensors
readings and the corresponding direction for each sample. This dataset was
captured using SCITOS G5 mobile robot by placing the sensors on the robot
waist. In addition to the full format with 24 sensors per record, the dataset
has two simplified formats with 4 and 2 input sensor readings per record.
Several control models were proposed previously for this dataset using all
three dataset formats. In this paper, two primary research contributions are
presented. First, presenting machine learning models with accuracies higher
than all previously proposed models for this dataset using all three formats. A
perfect solution for the 4 and 2 inputs sensors formats is presented using
Decision Tree Classifier by achieving a mean accuracy of 100%. On the other
hand, a mean accuracy of 99.82% was achieves using the 24 sensor inputs by
employing the Gradient Boost Classifier. Second, presenting a comparative study
on the performance of different machine learning and deep learning algorithms
on this dataset. Therefore, providing an overall insight on the performance of
these algorithms for similar sensor fusion problems. All the models in this
paper were evaluated using Monte-Carlo cross-validation.
","[{'version': 'v1', 'created': 'Thu, 26 Dec 2019 13:05:05 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Apr 2020 13:27:19 GMT'}]",2020-04-21,"[['Hammad', 'Issam', ''], ['El-Sankary', 'Kamal', ''], ['Gu', 'Jason', '']]","['Decision Tree', 'Deep Learning', 'Gradient Boost']"
7046,2008.10380,Gang Mei,"Gang Mei, Jingzhi Tu, Lei Xiao, Francesco Piccialli","KCoreMotif: An Efficient Graph Clustering Algorithm for Large Networks
  by Exploiting k-core Decomposition and Motifs",33 pages; 11 figures,"Computers & Electrical Engineering, 2021",10.1016/j.compeleceng.2021.107564,,cs.SI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering analysis has been widely used in trust evaluation on various
complex networks such as wireless sensors networks and online social networks.
Spectral clustering is one of the most commonly used algorithms for
graph-structured data (networks). However, the conventional spectral clustering
is inherently difficult to work with large-scale networks due to the fact that
it needs computationally expensive matrix manipulations. To deal with large
networks, in this paper, we propose an efficient graph clustering algorithm,
KCoreMotif, specifically for large networks by exploiting k-core decomposition
and motifs. The essential idea behind the proposed clustering algorithm is to
perform the efficient motif-based spectral clustering algorithm on k-core
subgraphs, rather than on the entire graph. More specifically, (1) we first
conduct the k-core decomposition of the large input network; (2) we then
perform the motif-based spectral clustering for the top k-core subgraphs; (3)
we group the remaining vertices in the rest (k-1)-core subgraphs into
previously found clusters; and finally obtain the desired clusters of the large
input network. To evaluate the performance of the proposed graph clustering
algorithm KCoreMotif, we use both the conventional and the motif-based spectral
clustering algorithms as the baselines and compare our algorithm with them for
18 groups of real-world datasets. Comparative results demonstrate that the
proposed graph clustering algorithm is accurate yet efficient for large
networks, which also means that it can be further used to evaluate the
intra-cluster and inter-cluster trusts on large networks.
","[{'version': 'v1', 'created': 'Fri, 21 Aug 2020 12:21:05 GMT'}]",2021-12-03,"[['Mei', 'Gang', ''], ['Tu', 'Jingzhi', ''], ['Xiao', 'Lei', ''], ['Piccialli', 'Francesco', '']]","['Clustering algorithm', 'Graph', 'k-core decomposition', 'Network motif', 'Trust evaluation']"
7047,2209.08166,William Yue,Alec Sun and William Yue,The trace reconstruction problem for spider graphs,"17 pages, 3 figures","Discrete Mathematics, 346(1), 113115 (2022)",10.1016/j.disc.2022.113115,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the trace reconstruction problem for spider graphs. Let $n$ be the
number of nodes of a spider and $d$ be the length of each leg, and suppose that
we are given independent traces of the spider from a deletion channel in which
each non-root node is deleted with probability $q$. This is a natural
generalization of the string trace reconstruction problem in theoretical
computer science, which corresponds to the special case where the spider has
one leg. In the regime where $d\ge \log_{1/q}(n)$, the problem can be reduced
to the vanilla string trace reconstruction problem. We thus study the more
interesting regime $d\le \log_{1/q}(n)$, in which entire legs of the spider are
deleted with non-negligible probability. We describe an algorithm that
reconstructs spiders with high probability using
$\exp\left(\mathcal{O}\left(\frac{(nq^d)^{1/3}}{d^{1/3}}(\log
n)^{2/3}\right)\right)$ traces. Our algorithm works for all deletion
probabilities $q\in(0,1)$.
","[{'version': 'v1', 'created': 'Fri, 16 Sep 2022 20:49:20 GMT'}]",2022-09-20,"[['Sun', 'Alec', ''], ['Yue', 'William', '']]","['Trace reconstruction', 'Graph algorithms', 'Littlewoodpolynomials']"
7048,2202.09788,Suthee Ruangwises,"Suthee Ruangwises, Toshiya Itoh","How to Physically Verify a Rectangle in a Grid: A Physical ZKP for
  Shikaku",This paper has appeared at FUN 2022,,10.4230/LIPIcs.FUN.2022.24,,cs.CR math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Shikaku is a pencil puzzle consisting of a rectangular grid, with some cells
containing a number. The player has to partition the grid into rectangles such
that each rectangle contains exactly one number equal to the area of that
rectangle. In this paper, we propose two physical zero-knowledge proof
protocols for Shikaku using a deck of playing cards, which allow a prover to
physically show that he/she knows a solution of the puzzle without revealing
it. Most importantly, in our second protocol we develop a general technique to
physically verify a rectangle-shaped area with a certain size in a rectangular
grid, which can be used to verify other problems with similar constraints.
","[{'version': 'v1', 'created': 'Sun, 20 Feb 2022 11:07:26 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Oct 2022 09:29:22 GMT'}]",2022-10-26,"[['Ruangwises', 'Suthee', ''], ['Itoh', 'Toshiya', '']]","['zero-knowledge proof', 'card-based cryptography', 'Shikaku', 'puzzles', 'games']"
7049,2001.06475,Mattia Halter,"Mattia Halter, Laura B\'egon-Lours, Valeria Bragaglia, Marilyne Sousa,
  Bert Jan Offrein, Stefan Abel, Mathieu Luisier, Jean Fompeyriney","A back-end, CMOS compatible ferroelectric Field Effect Transistor for
  synaptic weights","14 pages, 5 figures, supplementary information available, submitted
  to ACS Applied Materials & Interfaces",,10.1021/acsami.0c00877,,cs.ET physics.app-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neuromorphic computing architectures enable the dense co-location of memory
and processing elements within a single circuit. This co-location removes the
communication bottleneck of transferring data between separate memory and
computing units as in standard von Neuman architectures for data-critical
applications including machine learning. The essential building blocks of
neuromorphic systems are non-volatile synaptic elements such as memristors. Key
memristor properties include a suitable non-volatile resistance range,
continuous linear resistance modulation and symmetric switching. In this work,
we demonstrate voltage-controlled, symmetric and analog potentiation and
depression of a ferroelectric Hf$_{57}$Zr$_{43}$O$_{2}$ (HZO) field effect
transistor (FeFET) with good linearity. Our FeFET operates with a low writing
energy (fJ) and fast programming time (40 ns). Retention measurements have been
done over 4-bits depth with low noise (1%) in the tungsten oxide (WO$_{x}$)
read out channel. By adjusting the channel thickness from 15nm to 8nm, the
on/off ratio of the FeFET can be engineered from 1% to 200% with an
on-resistance ideally >100 kOhm, depending on the channel geometry. The device
concept is using earth-abundant materials, and is compatible with a back end of
line (BEOL) integration into complementary metal-oxidesemiconductor (CMOS)
processes. It has therefore a great potential for the fabrication of high
density, large-scale integrated arrays of artificial analog synapses.
","[{'version': 'v1', 'created': 'Fri, 17 Jan 2020 18:54:13 GMT'}]",2020-03-31,"[['Halter', 'Mattia', ''], ['Bégon-Lours', 'Laura', ''], ['Bragaglia', 'Valeria', ''], ['Sousa', 'Marilyne', ''], ['Offrein', 'Bert Jan', ''], ['Abel', 'Stefan', ''], ['Luisier', 'Mathieu', ''], ['Fompeyriney', 'Jean', '']]","['ferroelectric switching', 'hafnium zirconium oxide', 'tungsten oxide', 'BEOL', 'ferroelectric']"
7050,2006.09912,James Trimble,James Trimble,"PACE Solver Description: Bute-Plus: A Bottom-Up Exact Solver for
  Treedepth","4 pages, 1 appendix pages, 0 figures. A version of this tool
  description paper without the appendix is published in the proceedings of
  IPEC 2020:
  https://drops.dagstuhl.de/opus/volltexte/2020/13337/pdf/LIPIcs-IPEC-2020-34.pdf
  . Changes: this version expands the paper from a preliminary version","In 15th International Symposium on Parameterized and Exact
  Computation (IPEC 2020). Schloss Dagstuhl-Leibniz-Zentrum f\""ur Informatik",10.4230/LIPIcs.IPEC.2020.34,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This note introduces Bute-Plus, an exact solver for the treedepth problem.
The core of the solver is a positive-instance driven dynamic program that
constructs an elimination tree of minimum depth in a bottom-up fashion. Three
features greatly improve the algorithm's run time. The first of these is a
specialised trie data structure. The second is a domination rule. The third is
a heuristic presolve step can quickly find a treedepth decomposition of optimal
depth for many instances.
","[{'version': 'v1', 'created': 'Wed, 17 Jun 2020 14:45:58 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Dec 2020 23:20:36 GMT'}]",2020-12-18,"[['Trimble', 'James', '']]","['Treedepth', 'Elimination Tree', 'Graph Algorithms']"
7051,1809.05884,Yongcheng Liu,"Yongcheng Liu, Lu Sheng, Jing Shao, Junjie Yan, Shiming Xiang and
  Chunhong Pan","Multi-Label Image Classification via Knowledge Distillation from
  Weakly-Supervised Detection","accepted by ACM Multimedia 2018, 9 pages, 4 figures, 5 tables",,10.1145/3240508.3240567,,cs.CV cs.AI cs.LG cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-label image classification is a fundamental but challenging task
towards general visual understanding. Existing methods found the region-level
cues (e.g., features from RoIs) can facilitate multi-label classification.
Nevertheless, such methods usually require laborious object-level annotations
(i.e., object labels and bounding boxes) for effective learning of the
object-level visual features. In this paper, we propose a novel and efficient
deep framework to boost multi-label classification by distilling knowledge from
weakly-supervised detection task without bounding box annotations.
Specifically, given the image-level annotations, (1) we first develop a
weakly-supervised detection (WSD) model, and then (2) construct an end-to-end
multi-label image classification framework augmented by a knowledge
distillation module that guides the classification model by the WSD model
according to the class-level predictions for the whole image and the
object-level visual features for object RoIs. The WSD model is the teacher
model and the classification model is the student model. After this cross-task
knowledge distillation, the performance of the classification model is
significantly improved and the efficiency is maintained since the WSD model can
be safely discarded in the test phase. Extensive experiments on two large-scale
datasets (MS-COCO and NUS-WIDE) show that our framework achieves superior
performances over the state-of-the-art methods on both performance and
efficiency.
","[{'version': 'v1', 'created': 'Sun, 16 Sep 2018 14:35:03 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Feb 2019 12:28:58 GMT'}]",2019-02-22,"[['Liu', 'Yongcheng', ''], ['Sheng', 'Lu', ''], ['Shao', 'Jing', ''], ['Yan', 'Junjie', ''], ['Xiang', 'Shiming', ''], ['Pan', 'Chunhong', '']]","['Multi-Label Image Classification', 'Weakly-Supervised Detection', 'Knowledge Distillation']"
7052,2005.05579,Michal Bou\v{s}ka,"Michal Bou\v{s}ka, Anton\'in Nov\'ak, P\v{r}emysl \v{S}\r{u}cha,
  Istv\'an M\'odos, and Zden\v{e}k Hanz\'alek",Data-driven Algorithm for Scheduling with Total Tardiness,,,10.5220/0008915300590068,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate the use of deep learning for solving a
classical NP-Hard single machine scheduling problem where the criterion is to
minimize the total tardiness. Instead of designing an end-to-end machine
learning model, we utilize well known decomposition of the problem and we
enhance it with a data-driven approach. We have designed a regressor containing
a deep neural network that learns and predicts the criterion of a given set of
jobs. The network acts as a polynomial-time estimator of the criterion that is
used in a single-pass scheduling algorithm based on Lawler's decomposition
theorem. Essentially, the regressor guides the algorithm to select the best
position for each job. The experimental results show that our data-driven
approach can efficiently generalize information from the training phase to
significantly larger instances (up to 350 jobs) where it achieves an optimality
gap of about 0.5%, which is four times less than the gap of the
state-of-the-art NBR heuristic.
","[{'version': 'v1', 'created': 'Tue, 12 May 2020 07:16:43 GMT'}]",2020-05-13,"[['Bouška', 'Michal', ''], ['Novák', 'Antonín', ''], ['Šůcha', 'Přemysl', ''], ['Módos', 'István', ''], ['Hanzálek', 'Zdeněk', '']]","['Single Machine Scheduling', 'Total Tardiness', 'Data-Driven Method', 'Deep Neural Networks']"
7053,1708.01412,Zheng Li,"Zheng Li and He Zhang and Liam O'Brien and Rainbow Cai and Shayne
  Flint",On Evaluating Commercial Cloud Services: A Systematic Review,,"Journal of Systems and Software, vol. 86, no. 9, pp. 2371-2393
  (2013)",10.1016/j.jss.2013.04.021,,cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Cloud Computing is increasingly booming in industry with many
competing providers and services. Accordingly, evaluation of commercial Cloud
services is necessary. However, the existing evaluation studies are relatively
chaotic. There exists tremendous confusion and gap between practices and theory
about Cloud services evaluation. Aim: To facilitate relieving the
aforementioned chaos, this work aims to synthesize the existing evaluation
implementations to outline the state-of-the-practice and also identify research
opportunities in Cloud services evaluation. Method: Based on a conceptual
evaluation model comprising six steps, the Systematic Literature Review (SLR)
method was employed to collect relevant evidence to investigate the Cloud
services evaluation step by step. Results: This SLR identified 82 relevant
evaluation studies. The overall data collected from these studies essentially
represent the current practical landscape of implementing Cloud services
evaluation, and in turn can be reused to facilitate future evaluation work.
Conclusions: Evaluation of commercial Cloud services has become a world-wide
research topic. Some of the findings of this SLR identify several research gaps
in the area of Cloud services evaluation (e.g., the Elasticity and Security
evaluation of commercial Cloud services could be a long-term challenge), while
some other findings suggest the trend of applying commercial Cloud services
(e.g., compared with PaaS, IaaS seems more suitable for customers and is
particularly important in industry). This SLR study itself also confirms some
previous experiences and reveals new Evidence-Based Software Engineering (EBSE)
lessons.
","[{'version': 'v1', 'created': 'Fri, 4 Aug 2017 08:12:59 GMT'}]",2017-08-07,"[['Li', 'Zheng', ''], ['Zhang', 'He', ''], [""O'Brien"", 'Liam', ''], ['Cai', 'Rainbow', ''], ['Flint', 'Shayne', '']]","['Cloud Computing', 'Commercial Cloud Service', 'Cloud Services Evaluation', 'Evaluation Evidence', 'Systematic Literature Review']"
7054,2007.01544,Francisco Cruz,"Adam Bignold, Francisco Cruz, Matthew E. Taylor, Tim Brys, Richard
  Dazeley, Peter Vamplew, Cameron Foale","A Conceptual Framework for Externally-influenced Agents: An Assisted
  Reinforcement Learning Review","33 pages, 9 figures",,10.1007/s12652-021-03489-y,,cs.AI cs.LG cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A long-term goal of reinforcement learning agents is to be able to perform
tasks in complex real-world scenarios. The use of external information is one
way of scaling agents to more complex problems. However, there is a general
lack of collaboration or interoperability between different approaches using
external information. In this work, while reviewing externally-influenced
methods, we propose a conceptual framework and taxonomy for assisted
reinforcement learning, aimed at fostering collaboration by classifying and
comparing various methods that use external information in the learning
process. The proposed taxonomy details the relationship between the external
information source and the learner agent, highlighting the process of
information decomposition, structure, retention, and how it can be used to
influence agent learning. As well as reviewing state-of-the-art methods, we
identify current streams of reinforcement learning that use external
information in order to improve the agent's performance and its decision-making
process. These include heuristic reinforcement learning, interactive
reinforcement learning, learning from demonstration, transfer learning, and
learning from multiple sources, among others. These streams of reinforcement
learning operate with the shared objective of scaffolding the learner agent.
Lastly, we discuss further possibilities for future work in the field of
assisted reinforcement learning systems.
","[{'version': 'v1', 'created': 'Fri, 3 Jul 2020 08:07:31 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Sep 2021 03:00:40 GMT'}]",2021-09-21,"[['Bignold', 'Adam', ''], ['Cruz', 'Francisco', ''], ['Taylor', 'Matthew E.', ''], ['Brys', 'Tim', ''], ['Dazeley', 'Richard', ''], ['Vamplew', 'Peter', ''], ['Foale', 'Cameron', '']]","['Assistedreinforcementlearning', 'Externally-influenced agents', 'Assistance taxonomy']"
7055,1907.05559,Chuhan Wu,"Chuhan Wu, Fangzhao Wu, Mingxiao An, Jianqiang Huang, Yongfeng Huang,
  Xing Xie",NPA: Neural News Recommendation with Personalized Attention,,,10.1145/3292500.3330665,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  News recommendation is very important to help users find interested news and
alleviate information overload. Different users usually have different
interests and the same user may have various interests. Thus, different users
may click the same news article with attention on different aspects. In this
paper, we propose a neural news recommendation model with personalized
attention (NPA). The core of our approach is a news representation model and a
user representation model. In the news representation model we use a CNN
network to learn hidden representations of news articles based on their titles.
In the user representation model we learn the representations of users based on
the representations of their clicked news articles. Since different words and
different news articles may have different informativeness for representing
news and users, we propose to apply both word- and news-level attention
mechanism to help our model attend to important words and news articles. In
addition, the same news article and the same word may have different
informativeness for different users. Thus, we propose a personalized attention
network which exploits the embedding of user ID to generate the query vector
for the word- and news-level attentions. Extensive experiments are conducted on
a real-world news recommendation dataset collected from MSN news, and the
results validate the effectiveness of our approach on news recommendation.
","[{'version': 'v1', 'created': 'Fri, 12 Jul 2019 03:11:14 GMT'}]",2019-07-15,"[['Wu', 'Chuhan', ''], ['Wu', 'Fangzhao', ''], ['An', 'Mingxiao', ''], ['Huang', 'Jianqiang', ''], ['Huang', 'Yongfeng', ''], ['Xie', 'Xing', '']]","['News Recommendation', 'Neural Network', 'Personalized Attention']"
7056,2101.00095,Christian Nwachioma,Christian Nwachioma and J. Humberto P\'erez-Cruz,"Analysis of a new chaotic system, electronic realization and use in
  navigation of differential drive mobile robot","12 pages, 13 figures, in revision","Chaos, Solitons and Fractals 144 (2021) 110684",10.1016/j.chaos.2021.110684,,cs.RO cs.SY eess.SP eess.SY nlin.AO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new chaotic system having four attractors, including
two fixed point attractors and two symmetrical chaotic strange attractors.
Dynamical properties of the system, viz. sensitive dependence on initial
conditions, Lyapunov spectrum, strangeness measure, attraction basin, including
the class and size of it, existence of strange attractor, bifurcation analysis,
multistability, electronic circuit design, and hardware implementation, are
rigorously treated. Numerical computations are used to compute the basin of
attraction and show that the system has a far-reaching composite basin of
attraction. Such a basin of attraction is vital for engineering applications.
Moreover, a circuit model of the system is realized using analog electronic
components. A procedure is detailed for converting the system parameters into
corresponding electronic component values such as the circuital resistances
while ensuring the dynamic ranges are bounded. Besides, the system is used as
the source of control inputs for independent navigation of a differential drive
mobile robot, which is subject to the Pfaffian velocity constraint. Due to the
properties of sensitivity on initial conditions and topological mixing, the
robot's path becomes unpredictable and guaranteed to scan the workspace,
respectively.
","[{'version': 'v1', 'created': 'Fri, 11 Dec 2020 05:54:23 GMT'}]",2021-02-17,"[['Nwachioma', 'Christian', ''], ['Pérez-Cruz', 'J. Humberto', '']]","['Chaotic systems', 'Multistability', 'Basin of attraction', 'Bifurcation', 'Circuit model', 'Mobile wheel robot']"
7057,1909.12795,Hongki Lee,"Hongki Lee (Korea Advanced Institute of Science and Technology, South
  Korea), Changhee Park (Samsung Electronics, South Korea), Sukyoung Ryu (Korea
  Advanced Institute of Science and Technology, South Korea)",Automatically Tracing Imprecision Causes in JavaScript Static Analysis,,"The Art, Science, and Engineering of Programming, 2020, Vol. 4,
  Issue 2, Article 2",10.22152/programming-journal.org/2020/4/2,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Researchers have developed various techniques for static analysis of
JavaScript to improve analysis precision. To develop such techniques, they
first identify causes of the precision losses for unproven properties. While
most of the existing work has diagnosed main causes of imprecision in static
analysis by manual investigation, manually tracing the imprecision causes is
challenging because it requires detailed knowledge of analyzer internals.
Recently, several studies proposed to localize the analysis imprecision causes
automatically, but these localization techniques work for only specific
analysis techniques.
  In this paper, we present an automatic technique that can trace analysis
imprecision causes of JavaScript applications starting from user-selected
variables. Given a set of program variables, our technique stops an analysis
when any of the variables gets imprecise analysis values. It then traces the
imprecise analysis values using intermediate analysis results back to program
points where the imprecision first started. Our technique shows the trace
information with a new representation called tracing graphs, whose nodes and
edges together represent traces from imprecise points to precise points. In
order to detect major causes of analysis imprecision automatically, we present
four node/edge patterns in tracing graphs for common imprecision causes. We
formalized the technique of generating tracing graphs and identifying patterns,
and implemented them on SAFE, a state-of-the-art JavaScript static analyzer
with various analysis configurations, such as context-sensitivity,
loop-sensitivity, and heap cloning. Our evaluation demonstrates that the
technique can easily find 96 % of the major causes of the imprecision problems
in 17 applications by only automatic detection in tracing graphs using the
patterns, and selectively adopting various advanced techniques can eliminate
the found causes of imprecision.
","[{'version': 'v1', 'created': 'Fri, 27 Sep 2019 17:01:52 GMT'}]",2019-09-30,"[['Lee', 'Hongki', '', 'Korea Advanced Institute of Science and Technology, South\n  Korea'], ['Park', 'Changhee', '', 'Samsung Electronics, South Korea'], ['Ryu', 'Sukyoung', '', 'Korea\n  Advanced Institute of Science and Technology, South Korea']]","['Static analysis', 'JavaScript', 'Analysis precision']"
7058,2204.11707,Przemys{\l}aw Buczkowski,"Przemys{\l}aw Buczkowski, Pasquale Malacaria, Chris Hankin, Andrew
  Fielder","Optimal security hardening over a probabilistic attack graph: a case
  study of an industrial control system using the CySecTool tool","10 pages, 6 figures, SaT-CPS '22 conference",,10.1145/3510547.3517919,,cs.CR cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  CySecTool is a tool that finds a cost-optimal security controls portfolio in
a given budget for a probabilistic attack graph. A portfolio is a set of
counter-measures, or controls, against vulnerabilities adopted for a computer
system, while an attack graph is a type of a threat scenario model. In an
attack graph, nodes are privilege states of the attacker, edges are
vulnerabilities escalating privileges, and controls reduce the probabilities of
some vulnerabilities being exploited. The tool builds on an optimisation
algorithm published by Khouzani et al. (2019), enabling a user to quickly
create, edit, and incrementally improve models, analyse results for given
portfolios and display the best solutions for all possible budgets in the form
of a Pareto frontier. A case study was performed utilising a system graph and
suspected attack paths prepared by industrial security engineers based on an
industrial source with which they work. The goal of the case study is to model
a supervisory control and data acquisition (SCADA) industrial system which, due
to having the potential to harm people, necessitates strong protection while
not allowing the use of typical penetration tools like vulnerability scanners.
Results are analysed to show how a cyber-security analyst would use CySecTool
to store cyber-security intelligence and draw further conclusions.
","[{'version': 'v1', 'created': 'Mon, 25 Apr 2022 14:52:44 GMT'}]",2022-04-26,"[['Buczkowski', 'Przemysław', ''], ['Malacaria', 'Pasquale', ''], ['Hankin', 'Chris', ''], ['Fielder', 'Andrew', '']]","['threat modelling', 'multi-objective optimisation', 'probabilistic attackgraph', 'industrial control system', 'cybersecurity risk assessment tool']"
7059,2112.02863,Daniel Hirschkoff,"Adrien Durier (LIP, PLUME), Daniel Hirschkoff (LIP, PLUME), Davide
  Sangiorgi (UNIBO, FOCUS)",Eager Functions as Processes,"the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
  (LICS), Jul 2018, Oxford, United Kingdom",,10.1145/3209108.3209152,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study Milner's encoding of the call-by-value $\lambda$-calculus into the
$\pi$-calculus. We show that, by tuning the encoding to two subcalculi of the
$\pi$-calculus (Internal $\pi$ and Asynchronous Local $\pi$), the equivalence
on $\lambda$-terms induced by the encoding coincides with Lassen's eager
normal-form bisimilarity, extended to handle $\eta$-equality. As behavioural
equivalence in the $\pi$-calculus we consider contextual equivalence and barbed
congruence. We also extend the results to preorders. A crucial technical
ingredient in the proofs is the recently-introduced technique of unique
solutions of equations, further developed in this paper. In this respect, the
paper also intends to be an extended case study on the applicability and
expressiveness of the technique.
","[{'version': 'v1', 'created': 'Mon, 6 Dec 2021 08:40:02 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Dec 2021 10:12:53 GMT'}]",2021-12-16,"[['Durier', 'Adrien', '', 'LIP, PLUME'], ['Hirschkoff', 'Daniel', '', 'LIP, PLUME'], ['Sangiorgi', 'Davide', '', 'UNIBO, FOCUS']]","['pi-calculus', 'lambda-calculus', 'full abstraction', 'call-byvalue']"
7060,2007.14767,Jingbo Zhou,"Jingbo Zhou, Zhenwei Tang, Min Zhao, Xiang Ge, Fuzhen Zhuang, Meng
  Zhou, Liming Zou, Chenglei Yang, Hui Xiong","Intelligent Exploration for User Interface Modules of Mobile App with
  Collective Learning","10 pages, accepted as a full paper in KDD 2020",,10.1145/3394486.3403387,,cs.SE cs.HC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A mobile app interface usually consists of a set of user interface modules.
How to properly design these user interface modules is vital to achieving user
satisfaction for a mobile app. However, there are few methods to determine
design variables for user interface modules except for relying on the judgment
of designers. Usually, a laborious post-processing step is necessary to verify
the key change of each design variable. Therefore, there is a only very limited
amount of design solutions that can be tested. It is timeconsuming and almost
impossible to figure out the best design solutions as there are many modules.
To this end, we introduce FEELER, a framework to fast and intelligently explore
design solutions of user interface modules with a collective machine learning
approach. FEELER can help designers quantitatively measure the preference score
of different design solutions, aiming to facilitate the designers to
conveniently and quickly adjust user interface module. We conducted extensive
experimental evaluations on two real-life datasets to demonstrate its
applicability in real-life cases of user interface module design in the Baidu
App, which is one of the most popular mobile apps in China.
","[{'version': 'v1', 'created': 'Tue, 21 Jul 2020 19:00:54 GMT'}, {'version': 'v2', 'created': 'Mon, 31 Aug 2020 17:28:02 GMT'}]",2020-09-01,"[['Zhou', 'Jingbo', ''], ['Tang', 'Zhenwei', ''], ['Zhao', 'Min', ''], ['Ge', 'Xiang', ''], ['Zhuang', 'Fuzhen', ''], ['Zhou', 'Meng', ''], ['Zou', 'Liming', ''], ['Yang', 'Chenglei', ''], ['Xiong', 'Hui', '']]","['User interface exploration', 'user interface design', 'collective learning']"
7061,2012.07989,Shadrack Awah Buo,Shadrack Awah Buo,The Emerging Threats of Deepfake Attacks and Countermeasures,5,,10.13140/RG.2.2.23089.81762,,cs.CR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deepfake technology (DT) has taken a new level of sophistication.
Cybercriminals now can manipulate sounds, images, and videos to defraud and
misinform individuals and businesses. This represents a growing threat to
international institutions and individuals which needs to be addressed. This
paper provides an overview of deepfakes, their benefits to society, and how DT
works. Highlights the threats that are presented by deepfakes to businesses,
politics, and judicial systems worldwide. Additionally, the paper will explore
potential solutions to deepfakes and conclude with future research direction.
","[{'version': 'v1', 'created': 'Mon, 14 Dec 2020 22:40:49 GMT'}]",2020-12-16,"[['Buo', 'Shadrack Awah', '']]","['Deepfakes', 'Artificial Intelligence', 'cybercrime', 'multi-media manipulation']"
7062,1911.06073,George Plastiras,"George Plastiras, Christos Kyrkou, Theocharis Theocharides","Efficient ConvNet-based Object Detection for Unmanned Aerial Vehicles by
  Selective Tile Processing","George Plastiras, Christos Kyrkou, and Theocharis Theocharides. 2018.
  Efficient ConvNet-based Object Detection for Unmanned Aerial Vehicles by
  Selective Tile Processing. In Proceedings of the 12th International
  Conference on Distributed Smart Cameras (ICDSC '18). ACM, New York, NY, USA,
  Article 3, 6 pages","In Proceedings of the 12th International Conference on Distributed
  Smart Cameras (ICDSC 2018)",10.1145/3243394.3243692,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many applications utilizing Unmanned Aerial Vehicles (UAVs) require the use
of computer vision algorithms to analyze the information captured from their
on-board camera. Recent advances in deep learning have made it possible to use
single-shot Convolutional Neural Network (CNN) detection algorithms that
process the input image to detect various objects of interest. To keep the
computational demands low these neural networks typically operate on small
image sizes which, however, makes it difficult to detect small objects. This is
further emphasized when considering UAVs equipped with cameras where due to the
viewing range, objects tend to appear relatively small. This paper therefore,
explores the trade-offs involved when maintaining the resolution of the objects
of interest by extracting smaller patches (tiles) from the larger input image
and processing them using a neural network. Specifically, we introduce an
attention mechanism to focus on detecting objects only in some of the tiles and
a memory mechanism to keep track of information for tiles that are not
processed. Through the analysis of different methods and experiments we show
that by carefully selecting which tiles to process we can considerably improve
the detection accuracy while maintaining comparable performance to CNNs that
resize and process a single image which makes the proposed approach suitable
for UAV applications.
","[{'version': 'v1', 'created': 'Thu, 14 Nov 2019 12:50:27 GMT'}]",2019-11-15,"[['Plastiras', 'George', ''], ['Kyrkou', 'Christos', ''], ['Theocharides', 'Theocharis', '']]","['Object Detection', 'Convolutional Neural Networks', 'Aerial Cameras', 'Pedestrian Detection']"
7063,1907.04099,Markus Kluge,"Markus Kluge, Tim Weyrich, Andreas Kolb",Progressive Refinement Imaging,"This article has been published in final form at
  https://doi.org/10.1111/cgf.13808",,10.1111/cgf.13808,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel technique for progressive online integration of
uncalibrated image sequences with substantial geometric and/or photometric
discrepancies into a single, geometrically and photometrically consistent
image. Our approach can handle large sets of images, acquired from a nearly
planar or infinitely distant scene at different resolutions in object domain
and under variable local or global illumination conditions. It allows for
efficient user guidance as its progressive nature provides a valid and
consistent reconstruction at any moment during the online refinement process.
Our approach avoids global optimization techniques, as commonly used in the
field of image refinement, and progressively incorporates new imagery into a
dynamically extendable and memory-efficient Laplacian pyramid. Our image
registration process includes a coarse homography and a local refinement stage
using optical flow. Photometric consistency is achieved by retaining the
photometric intensities given in a reference image, while it is being refined.
Globally blurred imagery and local geometric inconsistencies due to, e.g.
motion are detected and removed prior to image fusion. We demonstrate the
quality and robustness of our approach using several image and video sequences,
including handheld acquisition with mobile phones and zooming sequences with
consumer cameras.
","[{'version': 'v1', 'created': 'Tue, 9 Jul 2019 11:49:15 GMT'}, {'version': 'v2', 'created': 'Mon, 9 Sep 2019 15:07:02 GMT'}]",2019-09-11,"[['Kluge', 'Markus', ''], ['Weyrich', 'Tim', ''], ['Kolb', 'Andreas', '']]","['image processing', 'image and video processing', 'computational photography']"
7064,2004.01749,Lukas Daniel Klausner,"Tobias Dam, Lukas Daniel Klausner, Sebastian Schrittwieser",Typosquatting for Fun and Profit: Cross-Country Analysis of Pop-Up Scam,"30 pages, 33 figures. Extended journal version of arXiv:1906.10762","J. Cyber Secur. Mobil. 9 (2), 2020, 265-300",10.13052/jcsm2245-1439.924,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today, many different types of scams can be found on the internet. Online
criminals are always finding new creative ways to trick internet users, be it
in the form of lottery scams, downloading scam apps for smartphones or fake
gambling websites. This paper presents a large-scale study on one particular
delivery method of online scam: pop-up scam on typosquatting domains.
Typosquatting describes the concept of registering domains which are very
similar to existing ones while deliberately containing common typing errors;
these domains are then used to trick online users while under the belief of
browsing the intended website. Pop-up scam uses JavaScript alert boxes to
present a message which attracts the user's attention very effectively, as they
are a blocking user interface element.
  Our study among typosquatting domains derived from the Majestic Million list
utilising an Austrian IP address revealed on 1219 distinct typosquatting URLs a
total of 2577 pop-up messages, out of which 1538 were malicious. Approximately
a third of those distinct URLs (403) were targeted and displayed pop-up
messages to one specific HTTP user agent only. Based on our scans, we present
an in-depth analysis as well as a detailed classification of different
targeting parameters (user agent and language) which triggered varying kinds of
pop-up scams. Furthermore, we expound the differences of current pop-up scam
characteristics in comparison with a previous scan performed in late 2018 and
examine the use of IDN homograph attacks as well as the application of message
localisation using additional scans with IP addresses from the United States
and Japan.
","[{'version': 'v1', 'created': 'Thu, 2 Apr 2020 09:14:26 GMT'}]",2020-04-07,"[['Dam', 'Tobias', ''], ['Klausner', 'Lukas Daniel', ''], ['Schrittwieser', 'Sebastian', '']]","['phishing', 'typosquatting', 'scam', 'web security']"
7065,2207.11871,Fengbin Zhu,"Fengbin Zhu, Wenqiang Lei, Fuli Feng, Chao Wang, Haozhou Zhang,
  Tat-Seng Chua",Towards Complex Document Understanding By Discrete Reasoning,Accepted by ACM Multimedia 2022,,10.1145/3503161.3548422,,cs.CV cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Document Visual Question Answering (VQA) aims to understand visually-rich
documents to answer questions in natural language, which is an emerging
research topic for both Natural Language Processing and Computer Vision. In
this work, we introduce a new Document VQA dataset, named TAT-DQA, which
consists of 3,067 document pages comprising semi-structured table(s) and
unstructured text as well as 16,558 question-answer pairs by extending the
TAT-QA dataset. These documents are sampled from real-world financial reports
and contain lots of numbers, which means discrete reasoning capability is
demanded to answer questions on this dataset. Based on TAT-DQA, we further
develop a novel model named MHST that takes into account the information in
multi-modalities, including text, layout and visual image, to intelligently
address different types of questions with corresponding strategies, i.e.,
extraction or reasoning. Extensive experiments show that the MHST model
significantly outperforms the baseline methods, demonstrating its
effectiveness. However, the performance still lags far behind that of expert
humans. We expect that our new TAT-DQA dataset would facilitate the research on
deep understanding of visually-rich documents combining vision and language,
especially for scenarios that require discrete reasoning. Also, we hope the
proposed model would inspire researchers to design more advanced Document VQA
models in future. Our dataset will be publicly available for non-commercial use
at https://nextplusplus.github.io/TAT-DQA/.
","[{'version': 'v1', 'created': 'Mon, 25 Jul 2022 01:43:19 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Sep 2022 14:36:01 GMT'}]",2022-09-08,"[['Zhu', 'Fengbin', ''], ['Lei', 'Wenqiang', ''], ['Feng', 'Fuli', ''], ['Wang', 'Chao', ''], ['Zhang', 'Haozhou', ''], ['Chua', 'Tat-Seng', '']]","['Question Answering', 'Visually-rich Document Understanding', 'Discrete Reasoning']"
7066,1508.03800,Yuhao Yi,"Qian Lv, Yuhao Yi and Zhongzhi Zhang",Corona graphs as a model of small-world networks,"21 pages, 2 figures",,10.1088/1742-5468/2015/11/P11024,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce recursive corona graphs as a model of small-world networks. We
investigate analytically the critical characteristics of the model, including
order and size, degree distribution, average path length, clustering
coefficient, and the number of spanning trees, as well as Kirchhoff index.
Furthermore, we study the spectra for the adjacency matrix and the Laplacian
matrix for the model. We obtain explicit results for all the quantities of the
recursive corona graphs, which are similar to those observed in real-life
networks.
","[{'version': 'v1', 'created': 'Sun, 16 Aug 2015 08:35:13 GMT'}, {'version': 'v10', 'created': 'Fri, 1 Jan 2016 14:34:03 GMT'}, {'version': 'v11', 'created': 'Mon, 25 Jan 2016 05:03:54 GMT'}, {'version': 'v12', 'created': 'Tue, 26 Jan 2016 08:40:10 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Aug 2015 04:15:18 GMT'}, {'version': 'v3', 'created': 'Tue, 13 Oct 2015 04:01:42 GMT'}, {'version': 'v4', 'created': 'Thu, 12 Nov 2015 11:37:42 GMT'}, {'version': 'v5', 'created': 'Wed, 18 Nov 2015 13:28:30 GMT'}, {'version': 'v6', 'created': 'Thu, 19 Nov 2015 01:22:24 GMT'}, {'version': 'v7', 'created': 'Sun, 22 Nov 2015 11:27:13 GMT'}, {'version': 'v8', 'created': 'Wed, 2 Dec 2015 08:11:46 GMT'}, {'version': 'v9', 'created': 'Tue, 15 Dec 2015 13:59:40 GMT'}]",2016-01-27,"[['Lv', 'Qian', ''], ['Yi', 'Yuhao', ''], ['Zhang', 'Zhongzhi', '']]","['Corona product', 'Small-world', 'Spectra', 'Laplacian matrix']"
7067,1909.01602,Andrea Giovanni Nuzzolese,"Paolo Ciancarini and Andrea Giovanni Nuzzolese and Valentina Presutti
  and Daniel Russo","SQuAP-Ont: an Ontology of Software Quality Relational Factors from
  Financial Systems",,,10.3233/SW-200372,,cs.AI cs.DB,http://creativecommons.org/licenses/by/4.0/,"  Quality, architecture, and process are considered the keystones of software
engineering. ISO defines them in three separate standards. However, their
interaction has been scarcely studied, so far. The SQuAP model (Software
Quality, Architecture, Process) describes twenty-eight main factors that impact
on software quality in banking systems, and each factor is described as a
relation among some characteristics from the three ISO standards. Hence, SQuAP
makes such relations emerge rigorously, although informally. In this paper, we
present SQuAP-Ont, an OWL ontology designed by following a well-established
methodology based on the re-use of Ontology Design Patterns (i.e. ODPs).
SQuAP-Ont formalises the relations emerging from SQuAP to represent and reason
via Linked Data about software engineering in a three-dimensional model
consisting of quality, architecture, and process ISO characteristics.
","[{'version': 'v1', 'created': 'Wed, 4 Sep 2019 07:57:54 GMT'}]",2020-04-29,"[['Ciancarini', 'Paolo', ''], ['Nuzzolese', 'Andrea Giovanni', ''], ['Presutti', 'Valentina', ''], ['Russo', 'Daniel', '']]","['Ontologies', 'Ontology Design Patterns', 'Pattern-based Ontology Modelling', 'SoftwareEngineering', 'Software Quality', 'Software Process', 'Software Architecture']"
7068,2011.05940,Sri Jamiya S,"Sri Jamiya S, Esther Rani P",LittleYOLO-SPP: A Delicate Real-Time Vehicle Detection Algorithm,"18 pages, 8 Figures, 7 Tables","Optik - International Journal for Light and Electron optics Volume
  225, 2021, 165818, ISSN 0030-4026",10.1016/j.ijleo.2020.165818,,cs.CV eess.IV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Vehicle detection in real-time is a challenging and important task. The
existing real-time vehicle detection lacks accuracy and speed. Real-time
systems must detect and locate vehicles during criminal activities like theft
of vehicle and road traffic violations with high accuracy. Detection of
vehicles in complex scenes with occlusion is also extremely difficult. In this
study, a lightweight model of deep neural network LittleYOLO-SPP based on the
YOLOv3-tiny network is proposed to detect vehicles effectively in real-time.
The YOLOv3-tiny object detection network is improved by modifying its feature
extraction network to increase the speed and accuracy of vehicle detection. The
proposed network incorporated Spatial pyramid pooling into the network, which
consists of different scales of pooling layers for concatenation of features to
enhance network learning capability. The Mean square error (MSE) and
Generalized IoU (GIoU) loss function for bounding box regression is used to
increase the performance of the network. The network training includes
vehicle-based classes from PASCAL VOC 2007,2012 and MS COCO 2014 datasets such
as car, bus, and truck. LittleYOLO-SPP network detects the vehicle in real-time
with high accuracy regardless of video frame and weather conditions. The
improved network achieves a higher mAP of 77.44% on PASCAL VOC and 52.95% mAP
on MS COCO datasets.
","[{'version': 'v1', 'created': 'Wed, 11 Nov 2020 17:57:49 GMT'}]",2020-11-12,"[['S', 'Sri Jamiya', ''], ['P', 'Esther Rani', '']]","['Vehicle Detection', 'Object Detection', 'YOLOv3-tiny', 'Spatial pyramid pooling', 'Deep Neural Network', 'Convolutional Neural Networks']"
7069,1412.2695,Afdel Karim,"H.Ouahi, M.El Hajji, K. Afdel","Secure and Image Retrieval based on Multipurpose Watermarking for
  Mammography Images Database",28-31,"International Journal of Computer Applications,Volume 90,No
  14,March,2014",10.5120/15789-4536,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In the cancerology domain, we were brought to make periodic mammography
images to monitor tumor patients. Oracle Database Management system (DBMS) is a
solution to manage these images with patient's data recorder. Knowing the large
size of medical images of mammograms, the Oracle DBMS saves these images
outside the Oracle database using external LOBs. The link between these images
and Oracle is done through the BFILE. At this level, two problems are raised:
the first problem is that access to these images can become impossible because
the link is likely to be broken. The second problem is security, the fact that
the images are saved outside the Oracle database, they do not benefit from its
powerful security. The protection of the integrity and confidentiality of data
and patient images are a necessity defended by laws and they must be preserved
against any unauthorized access, alteration or destruction. In this paper, we
propose the method of reversible watermarking technique based on the difference
expansion to resolve these two problems and explore its use in search and
retrieval strategy of images.
","[{'version': 'v1', 'created': 'Mon, 8 Dec 2014 18:46:49 GMT'}]",2014-12-09,"[['Ouahi', 'H.', ''], ['Hajji', 'M. El', ''], ['Afdel', 'K.', '']]","['Reversible Watermarking', 'BFILE', 'external LOBs Oracle', 'image extraction', 'texture', 'Security and mammograms images']"
7070,1910.13821,Sajad Daei Omshi,"Maral Safari, Sajad Daei, Farzan Haddadi","Off-the-grid Recovery of Time and Frequency Shifts with Multiple
  Measurement Vectors",Suggestions of Professor Reinhard Heckel have been applied,"Signal Processing, 2021",10.1016/j.sigpro.2021.108016,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the problem of estimating time and frequency shifts of a known
waveform in the presence of multiple measurement vectors (MMVs). This problem
naturally arises in radar imaging and wireless communications. Specifically, a
signal ensemble is observed, where each signal of the ensemble is formed by a
superposition of a small number of scaled, time-delayed, and frequency shifted
versions of a known waveform sharing the same continuous-valued time and
frequency components. The goal is to recover the continuous-valued
time-frequency pairs from a small number of observations. In this work, we
propose a semidefinite programming which exactly recovers $s$ pairs of
time-frequency shifts from $L$ regularly spaced samples per measurement vector
under a minimum separation condition between the time-frequency shifts.
Moreover, we prove that the number $s$ of time-frequency shifts scales linearly
with the number $L$ of samples up to a log-factor. Extensive numerical results
are also provided to validate the effectiveness of the proposed method over the
single measurement vectors (SMVs) problem. In particular, we find that our
approach leads to a relaxed minimum separation condition and reduced number of
required samples.
","[{'version': 'v1', 'created': 'Wed, 30 Oct 2019 13:02:41 GMT'}, {'version': 'v2', 'created': 'Sat, 30 Jan 2021 16:12:30 GMT'}, {'version': 'v3', 'created': 'Fri, 26 Feb 2021 08:15:04 GMT'}]",2021-03-01,"[['Safari', 'Maral', ''], ['Daei', 'Sajad', ''], ['Haddadi', 'Farzan', '']]","['Atomic norm minimization', 'super-resolution', 'multiplemeasurement vectors']"
7071,2109.06569,Shmuel Onn,Shmuel Onn,The Complexity of Vector Partition,,"Vietnam Journal of Mathematics, 2021",10.1007/s10013-021-00523-6,,cs.DS cs.DM math.CO math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the {\em vector partition problem}, where $n$ agents, each with a
$d$-dimensional attribute vector, are to be partitioned into $p$ parts so as to
minimize cost which is a given function on the sums of attribute vectors in
each part. The problem has applications in a variety of areas including
clustering, logistics and health care. We consider the complexity and
parameterized complexity of the problem under various assumptions on the
natural parameters $p,d,a,t$ of the problem where $a$ is the maximum absolute
value of any attribute and $t$ is the number of agent types, and raise some of
the many remaining open problems.
","[{'version': 'v1', 'created': 'Tue, 14 Sep 2021 10:36:34 GMT'}]",2021-09-15,"[['Onn', 'Shmuel', '']]","['partition', 'clustering', 'combinatorial optimization', 'parameterized complexity', 'integer programming']"
7072,2111.09963,Jacopo Tagliabue,"Patrick John Chia, Jacopo Tagliabue, Federico Bianchi, Chloe He, Brian
  Ko",Beyond NDCG: behavioral testing of recommender systems with RecList,Paper accepted to the WebConf 2022,,10.1145/3487553.3524215,,cs.IR cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  As with most Machine Learning systems, recommender systems are typically
evaluated through performance metrics computed over held-out data points.
However, real-world behavior is undoubtedly nuanced: ad hoc error analysis and
deployment-specific tests must be employed to ensure the desired quality in
actual deployments. In this paper, we propose RecList, a behavioral-based
testing methodology. RecList organizes recommender systems by use case and
introduces a general plug-and-play procedure to scale up behavioral testing. We
demonstrate its capabilities by analyzing known algorithms and black-box
commercial systems, and we release RecList as an open source, extensible
package for the community.
","[{'version': 'v1', 'created': 'Thu, 18 Nov 2021 22:34:38 GMT'}, {'version': 'v2', 'created': 'Sun, 27 Mar 2022 17:42:09 GMT'}]",2022-03-29,"[['Chia', 'Patrick John', ''], ['Tagliabue', 'Jacopo', ''], ['Bianchi', 'Federico', ''], ['He', 'Chloe', ''], ['Ko', 'Brian', '']]","['recommender systems', 'behavioral testing', 'open source']"
7073,2001.10726,Andr\'es Camero,"Andr\'es Camero, Hao Wang, Enrique Alba, Thomas B\""ack","Bayesian Neural Architecture Search using A Training-Free Performance
  Metric",,"Applied Soft Computing, p.107356 (2021)",10.1016/j.asoc.2021.107356,,cs.LG cs.AI cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recurrent neural networks (RNNs) are a powerful approach for time series
prediction. However, their performance is strongly affected by their
architecture and hyperparameter settings. The architecture optimization of RNNs
is a time-consuming task, where the search space is typically a mixture of
real, integer and categorical values. To allow for shrinking and expanding the
size of the network, the representation of architectures often has a variable
length. In this paper, we propose to tackle the architecture optimization
problem with a variant of the Bayesian Optimization (BO) algorithm. To reduce
the evaluation time of candidate architectures the Mean Absolute Error Random
Sampling (MRS), a training-free method to estimate the network performance, is
adopted as the objective function for BO. Also, we propose three fixed-length
encoding schemes to cope with the variable-length architecture representation.
The result is a new perspective on accurate and efficient design of RNNs, that
we validate on three problems. Our findings show that 1) the BO algorithm can
explore different network architectures using the proposed encoding schemes and
successfully designs well-performing architectures, and 2) the optimization
time is significantly reduced by using MRS, without compromising the
performance as compared to the architectures obtained from the actual training
procedure.
","[{'version': 'v1', 'created': 'Wed, 29 Jan 2020 08:42:58 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Apr 2021 07:48:42 GMT'}]",2021-04-26,"[['Camero', 'Andrés', ''], ['Wang', 'Hao', ''], ['Alba', 'Enrique', ''], ['Bäck', 'Thomas', '']]","['bayesian optimization', 'recurrent neural network', 'architectureoptimization']"
7074,2005.02142,Guillermo Arturo Mart\'inez-Mascorro Mr.,"Guillermo A. Mart\'inez-Mascorro, Jos\'e R. Abreu-Pederzini, Jos\'e C.
  Ortiz-Bayliss, Hugo Terashima-Mar\'in","Suspicious Behavior Detection on Shoplifting Cases for Crime Prevention
  by Using 3D Convolutional Neural Networks",,"Computation 2021, 9(2), 24",10.3390/computation9020024,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crime generates significant losses, both human and economic. Every year,
billions of dollars are lost due to attacks, crimes, and scams. Surveillance
video camera networks are generating vast amounts of data, and the surveillance
staff can not process all the information in real-time. The human sight has its
limitations, where the visual focus is among the most critical ones when
dealing with surveillance. A crime can occur in a different screen segment or
on a distinct monitor, and the staff may not notice it. Our proposal focuses on
shoplifting crimes by analyzing special situations that an average person will
consider as typical conditions, but may lead to a crime. While other approaches
identify the crime itself, we instead model suspicious behavior -- the one that
may occur before a person commits a crime -- by detecting precise segments of a
video with a high probability to contain a shoplifting crime. By doing so, we
provide the staff with more opportunities to act and prevent crime. We
implemented a 3DCNN model as a video feature extractor and tested its
performance on a dataset composed of daily-action and shoplifting samples. The
results are encouraging since it correctly identifies 75% of the cases where a
crime is about to happen.
","[{'version': 'v1', 'created': 'Thu, 30 Apr 2020 22:06:16 GMT'}]",2021-02-24,"[['Martínez-Mascorro', 'Guillermo A.', ''], ['Abreu-Pederzini', 'José R.', ''], ['Ortiz-Bayliss', 'José C.', ''], ['Terashima-Marín', 'Hugo', '']]","['3D Convolutional Neural Networks', 'Crime Prevention', 'Pre-Crime Behavior Analysis', 'Shoplifting', 'Suspicious Behavior']"
7075,2010.13035,Michael Lyons,"Tomohiro Tokunaga, Michael J. Lyons",Enactive Mandala: Audio-visualizing Brain Waves,"2 pages, 2 figures","Proceedings of the International Conference on New Interfaces for
  Musical Expression, 2013",10.5281/zenodo.1178678,,cs.HC cs.MM cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  We are exploring the design and implementation of artificial expressions,
kinetic audio-visual representations of real-time physiological data that
reflect emotional and cognitive state. In this work, we demonstrate a
prototype, the Enactive Mandala, which maps real-time EEG signals to modulate
ambient music and animated visual music. Transparent real-time audio-visual
feedback of brainwave qualities supports intuitive insight into the connection
between thoughts and physiological states.
","[{'version': 'v1', 'created': 'Sun, 25 Oct 2020 04:48:47 GMT'}]",2020-10-27,"[['Tokunaga', 'Tomohiro', ''], ['Lyons', 'Michael J.', '']]","['Brain-computer Interfaces', 'BCI', 'EEG', 'Sonification', 'Visualization', 'Artificial Expressions', 'NIME', 'Visual Music']"
7076,2107.12714,Staas De Jong,Staas de Jong,Making grains tangible: microtouch for microsound,"Proceedings of the International Conference on New Interfaces for
  Musical Expression, 2011",,10.5281/zenodo.1178055,,cs.HC cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  This paper proposes a new research direction for the large family of
instrumental musical interfaces where sound is generated using digital granular
synthesis, and where interaction and control involve the (fine) operation of
stiff, flat contact surfaces. First, within a historical context, a general
absence of, and clear need for, tangible output that is dynamically
instantiated by the grain-generating process itself is identified. Second, to
fill this gap, a concrete general approach is proposed based on the careful
construction of non-vibratory and vibratory force pulses, in a one-to-one
relationship with sonic grains. An informal pilot psychophysics experiment
initiating the approach was conducted, which took into account the two main
cases for applying forces to the human skin: perpendicular, and lateral.
Initial results indicate that the force pulse approach can enable perceivably
multidimensional, tangible display of the ongoing grain-generating process.
Moreover, it was found that this can be made to meaningfully happen (in real
time) in the same timescale of basic sonic grain generation. This is not a
trivial property, and provides an important and positive fundament for further
developing this type of enhanced display. It also leads to the exciting
prospect of making arbitrary sonic grains actual physical manipulanda.
","[{'version': 'v1', 'created': 'Tue, 27 Jul 2021 10:18:56 GMT'}]",2021-07-28,"[['de Jong', 'Staas', '']]","['instrumental control', 'tangible display', 'tangible manipulation', 'granular sound synthesis']"
7077,2206.07636,Andrea Raffo,"Chiara Romanengo, Andrea Raffo, Silvia Biasotti, Bianca Falcidieno,
  Vlassis Fotis, Ioannis Romanelis, Eleftheria Psatha, Konstantinos Moustakas,
  Ivan Sipiran, Quang-Thuc Nguyen, Chi-Bien Chu, Khoi-Nguyen Nguyen-Ngoc,
  Dinh-Khoi Vo, Tuan-An To, Nham-Tan Nguyen, Nhat-Quynh Le-Pham, Hai-Dang
  Nguyen, Minh-Triet Tran, Yifan Qie, Nabil Anwer","SHREC 2022: Fitting and recognition of simple geometric primitives on
  point clouds",,,10.1016/j.cag.2022.07.004,,cs.GR cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the methods that have participated in the SHREC 2022
track on the fitting and recognition of simple geometric primitives on point
clouds. As simple primitives we mean the classical surface primitives derived
from constructive solid geometry, i.e., planes, spheres, cylinders, cones and
tori. The aim of the track is to evaluate the quality of automatic algorithms
for fitting and recognising geometric primitives on point clouds. Specifically,
the goal is to identify, for each point cloud, its primitive type and some
geometric descriptors. For this purpose, we created a synthetic dataset,
divided into a training set and a test set, containing segments perturbed with
different kinds of point cloud artifacts. Among the six participants to this
track, two are based on direct methods, while four are either fully based on
deep learning or combine direct and neural approaches. The performance of the
methods is evaluated using various classification and approximation measures.
","[{'version': 'v1', 'created': 'Wed, 15 Jun 2022 16:27:01 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jul 2022 17:21:58 GMT'}]",2022-07-08,"[['Romanengo', 'Chiara', ''], ['Raffo', 'Andrea', ''], ['Biasotti', 'Silvia', ''], ['Falcidieno', 'Bianca', ''], ['Fotis', 'Vlassis', ''], ['Romanelis', 'Ioannis', ''], ['Psatha', 'Eleftheria', ''], ['Moustakas', 'Konstantinos', ''], ['Sipiran', 'Ivan', ''], ['Nguyen', 'Quang-Thuc', ''], ['Chu', 'Chi-Bien', ''], ['Nguyen-Ngoc', 'Khoi-Nguyen', ''], ['Vo', 'Dinh-Khoi', ''], ['To', 'Tuan-An', ''], ['Nguyen', 'Nham-Tan', ''], ['Le-Pham', 'Nhat-Quynh', ''], ['Nguyen', 'Hai-Dang', ''], ['Tran', 'Minh-Triet', ''], ['Qie', 'Yifan', ''], ['Anwer', 'Nabil', '']]","['geometric primitives', 'primitive fitting', 'primitive recognition', 'primitive descriptors', 'SHREC']"
7078,2107.14675,Clemens Hofstadler,Clemens Hofstadler and Thibaut Verron,"Signature Gr\""obner bases, bases of syzygies and cofactor reconstruction
  in the free algebra","31 pages, 2 pages appendix, 1 figure",,10.1016/j.jsc.2022.04.001,,cs.SC math.RA,http://creativecommons.org/licenses/by/4.0/,"  Signature-based algorithms have become a standard approach for computing
Gr\""obner bases in commutative polynomial rings. However, so far, it was not
clear how to extend this concept to the setting of noncommutative polynomials
in the free algebra. In this paper, we present a signature-based algorithm for
computing Gr\""obner bases in precisely this setting. The algorithm is an
adaptation of Buchberger's algorithm including signatures. We prove that our
algorithm correctly enumerates a signature Gr\""obner basis as well as a
Gr\""obner basis of the module generated by the leading terms of the generators'
syzygies, and that it terminates whenever the ideal admits a finite signature
Gr\""obner basis. Additionally, we adapt well-known signature-based criteria
eliminating redundant reductions, such as the syzygy criterion, the F5
criterion and the singular criterion, to the case of noncommutative
polynomials. We also generalize reconstruction methods from the commutative
setting that allow to recover, from partial information about signatures, the
coordinates of elements of a Gr\""obner basis in terms of the input polynomials,
as well as a basis of the syzygy module of the generators. We have written a
toy implementation of all the algorithms in the Mathematica package OperatorGB
and we compare our signature-based algorithm to the classical Buchberger
algorithm for noncommutative polynomials.
","[{'version': 'v1', 'created': 'Fri, 30 Jul 2021 14:52:12 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Nov 2021 12:25:18 GMT'}, {'version': 'v3', 'created': 'Thu, 14 Apr 2022 14:41:41 GMT'}]",2022-04-15,"[['Hofstadler', 'Clemens', ''], ['Verron', 'Thibaut', '']]","['Noncommutative polynomials', 'Signature Gröbner bases', 'Syzygy module', 'Cofactorreconstruction']"
7079,2109.07628,Seok-Ju Hahn,"Seok-Ju Hahn, Minwoo Jeong, Junghye Lee",Connecting Low-Loss Subspace for Personalized Federated Learning,"Appears at ACM SIGKDD 2022. Code available at
  http://github.com/vaseline555/SuPerFed",,10.1145/3534678.3539254,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Due to the curse of statistical heterogeneity across clients, adopting a
personalized federated learning method has become an essential choice for the
successful deployment of federated learning-based services. Among diverse
branches of personalization techniques, a model mixture-based personalization
method is preferred as each client has their own personalized model as a result
of federated learning. It usually requires a local model and a federated model,
but this approach is either limited to partial parameter exchange or requires
additional local updates, each of which is helpless to novel clients and
burdensome to the client's computational capacity. As the existence of a
connected subspace containing diverse low-loss solutions between two or more
independent deep networks has been discovered, we combined this interesting
property with the model mixture-based personalized federated learning method
for improved performance of personalization. We proposed SuPerFed, a
personalized federated learning method that induces an explicit connection
between the optima of the local and the federated model in weight space for
boosting each other. Through extensive experiments on several benchmark
datasets, we demonstrated that our method achieves consistent gains in both
personalization performance and robustness to problematic scenarios possible in
realistic services.
","[{'version': 'v1', 'created': 'Thu, 16 Sep 2021 00:03:23 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Jun 2022 12:10:56 GMT'}, {'version': 'v3', 'created': 'Thu, 11 Aug 2022 16:37:39 GMT'}]",2022-08-12,"[['Hahn', 'Seok-Ju', ''], ['Jeong', 'Minwoo', ''], ['Lee', 'Junghye', '']]","['federated learning', 'non-IID data', 'personalization', 'personalized federated learning', 'label noise', 'mode connectivity']"
7080,2005.05839,Zixiang Zhao,"Zixiang Zhao, Shuang Xu, Chunxia Zhang, Junmin Liu, Jiangshe Zhang",Bayesian Fusion for Infrared and Visible Images,,,10.1016/j.sigpro.2020.107734,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Infrared and visible image fusion has been a hot issue in image fusion. In
this task, a fused image containing both the gradient and detailed texture
information of visible images as well as the thermal radiation and highlighting
targets of infrared images is expected to be obtained. In this paper, a novel
Bayesian fusion model is established for infrared and visible images. In our
model, the image fusion task is cast into a regression problem. To measure the
variable uncertainty, we formulate the model in a hierarchical Bayesian manner.
Aiming at making the fused image satisfy human visual system, the model
incorporates the total-variation(TV) penalty. Subsequently, the model is
efficiently inferred by the expectation-maximization(EM) algorithm. We test our
algorithm on TNO and NIR image fusion datasets with several state-of-the-art
approaches. Compared with the previous methods, the novel model can generate
better fused images with high-light targets and rich texture details, which can
improve the reliability of the target automatic detection and recognition
system.
","[{'version': 'v1', 'created': 'Tue, 12 May 2020 14:57:19 GMT'}]",2020-09-04,"[['Zhao', 'Zixiang', ''], ['Xu', 'Shuang', ''], ['Zhang', 'Chunxia', ''], ['Liu', 'Junmin', ''], ['Zhang', 'Jiangshe', '']]","['image fusion', 'hierarchical Bayesian model', 'total-variation penalty', 'EM algorithm']"
7081,2005.06302,Sarah Spiekermann,"Alexander Novotny, Sarah Spiekermann",Oblivion of Online Reputation: How Time Cues Improve Online Recruitment,"obsolete reputation, online crowdsourcing labour markets, right to be
  forgotten",,10.1504/IJEB.2017.10003869,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In online crowdsourcing labour markets, employers decide which job-seekers to
hire based on their reputation profiles. If reputation systems neglect the
aspect of time when displaying reputation profiles, though, employers risk
taking false decisions, deeming an obsolete reputation to be still relevant. As
a consequence, job-seekers might be unwarrantedly deprived of getting hired for
new jobs and can be harmed in their professional careers in the long-run. This
paper argues that exposing employers to the temporal context of job-seekers'
reputation leads to better hiring decisions. The visible temporal context in
reputation systems helps employers to ignore a job-seeker's obsolete
reputation. An experimental lab study with 335 students shows that current
reputation systems fall short of making them aware of obsolete reputation. In
contrast, graphical time cues improve the social efficiency of hiring
decisions.
","[{'version': 'v1', 'created': 'Wed, 13 May 2020 13:23:05 GMT'}]",2020-05-14,"[['Novotny', 'Alexander', ''], ['Spiekermann', 'Sarah', '']]","['obsolete reputation', 'online crowdsourcing labour markets', 'right to be forgotten']"
7082,2107.03234,Krzysztof Domino,"Krzysztof Domino, Akash Kundu, \""Ozlem Salehi, Krzysztof Krawiec","Quadratic and Higher-Order Unconstrained Binary Optimization of Railway
  Rescheduling for Quantum Computing",,"Quantum Information Processing volume 21, Article number: 337
  (2022)",10.1007/s11128-022-03670-y,,cs.ET cs.SY eess.SY quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As consequences of disruptions in railway traffic affect passenger
experience/satisfaction, appropriate rerouting and/or rescheduling is
necessary. These problems are known to be NP-hard, given the numerous
restrictions of traffic nature. With the recent advances in quantum
technologies, quantum annealing has become an alternative method to solve such
optimization problems. To use quantum annealing, the problem needs to be
encoded in QUBO (quadratic unconstrained binary optimization) or HOBO
(higher-order binary optimization) formulation that can be recast as a QUBO.
This paper introduces QUBO and HOBO representations for rescheduling problems
of railway traffic management; the latter is a new approach up to our
knowledge. This new approach takes into account not only the single-track lines
but also the double- and multi-track lines, as well as stations composed of
tracks and switches. We consider the conditions of minimal headway between
trains, minimal stay on stations, track occupation, and rolling stock
circulation. Furthermore, a hybrid quantum-classical procedure is presented
that includes rerouting. We demonstrate the proof of concept implementation on
the D-Wave Quantum Processing Unit and D-Wave hybrid solver.
","[{'version': 'v1', 'created': 'Wed, 7 Jul 2021 14:07:07 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Aug 2021 15:27:56 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Mar 2022 11:21:01 GMT'}, {'version': 'v4', 'created': 'Wed, 8 Jun 2022 13:15:22 GMT'}, {'version': 'v5', 'created': 'Wed, 20 Jul 2022 09:49:57 GMT'}]",2022-10-06,"[['Domino', 'Krzysztof', ''], ['Kundu', 'Akash', ''], ['Salehi', 'Özlem', ''], ['Krawiec', 'Krzysztof', '']]","['higher-order binary optimization', 'railway rescheduling', 'railway rerouting', 'quantum-classicalhybrid procedure', 'D-Wave annealer']"
7083,1905.07186,Mark Keane,Mark T Keane and Eoin M Kenny,"How Case Based Reasoning Explained Neural Networks: An XAI Survey of
  Post-Hoc Explanation-by-Example in ANN-CBR Twins",15 pages,"Proceedings of the 27th International Conference on Case Based
  Reasoning (ICCBR-19), 2019",10.1007/978-3-030-29249-2_11,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper surveys an approach to the XAI problem, using post-hoc explanation
by example, that hinges on twinning Artificial Neural Networks (ANNs) with
Case-Based Reasoning (CBR) systems, so-called ANN-CBR twins. A systematic
survey of 1100+ papers was carried out to identify the fragmented literature on
this topic and to trace it influence through to more recent work involving Deep
Neural Networks (DNNs). The paper argues that this twin-system approach,
especially using ANN-CBR twins, presents one possible coherent, generic
solution to the XAI problem (and, indeed, XCBR problem). The paper concludes by
road-mapping some future directions for this XAI solution involving (i) further
tests of feature-weighting techniques, (iii) explorations of how explanatory
cases might best be deployed (e.g., in counterfactuals, near-miss cases, a
fortori cases), and (iii) the raising of the unwelcome and, much ignored, issue
of human user evaluation.
","[{'version': 'v1', 'created': 'Fri, 17 May 2019 10:14:29 GMT'}]",2021-04-21,"[['Keane', 'Mark T', ''], ['Kenny', 'Eoin M', '']]","['CBR', 'Explanation', 'Artificial Neural Networks', 'XAI', 'Deep Learning']"
7084,2211.02415,K. Ch. Chatzisavvas,"Sofia Rizou, Antonia Paflioti, Angelos Theofilatos, Athena Vakali,
  George Sarigiannidis and Konstantinos Ch. Chatzisavvas","Multilingual Name Entity Recognition and Intent Classification Employing
  Deep Learning Architectures","24 pages, 5 figures, 11 tables, dataset available","Simulation Modelling Practice and Theory, Vol. 120, 102620 (2022)",10.1016/j.simpat.2022.102620,,cs.CL cs.LG cs.MA,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Named Entity Recognition and Intent Classification are among the most
important subfields of the field of Natural Language Processing. Recent
research has lead to the development of faster, more sophisticated and
efficient models to tackle the problems posed by those two tasks. In this work
we explore the effectiveness of two separate families of Deep Learning networks
for those tasks: Bidirectional Long Short-Term networks and Transformer-based
networks. The models were trained and tested on the ATIS benchmark dataset for
both English and Greek languages. The purpose of this paper is to present a
comparative study of the two groups of networks for both languages and showcase
the results of our experiments. The models, being the current state-of-the-art,
yielded impressive results and achieved high performance.
","[{'version': 'v1', 'created': 'Fri, 4 Nov 2022 12:42:29 GMT'}]",2022-11-07,"[['Rizou', 'Sofia', ''], ['Paflioti', 'Antonia', ''], ['Theofilatos', 'Angelos', ''], ['Vakali', 'Athena', ''], ['Sarigiannidis', 'George', ''], ['Chatzisavvas', 'Konstantinos Ch.', '']]","['Named Entity Recognition', 'Intent Classification', 'Natural Language Understanding', 'Deep Learning', 'LSTM networks', 'Transformer networks', 'Conversational Agents']"
7085,1910.03575,Gregor Ulm,Gregor Ulm and Emil Gustavsson and Mats Jirstrand,Active-Code Replacement in the OODIDA Data Analytics Platform,"6 pages, 2 figures; Published in Euro-Par 2019: Parallel Processing
  Workshops proceedings; DOI was added to the PDF. There is also an extended
  version of this paper, cf. arXiv admin note: text overlap with
  arXiv:1903.09477","Euro-Par 2019: Parallel Processing Workshops Proceedings (Springer
  LNCS 11997)",10.1007/978-3-030-48340-1_55,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  OODIDA (On-board/Off-board Distributed Data Analytics) is a platform for
distributing and executing concurrent data analytics tasks. It targets fleets
of reference vehicles in the automotive industry and has a particular focus on
rapid prototyping. Its underlying message-passing infrastructure has been
implemented in Erlang/OTP. External Python applications perform data analytics
tasks. Most work is performed by clients (on-board). A central cloud server
performs supplementary tasks (off-board). OODIDA can be automatically packaged
and deployed, which necessitates restarting parts of the system, or all of it.
This is potentially disruptive. To address this issue, we added the ability to
execute user-defined Python modules on clients as well as the server. These
modules can be replaced without restarting any part of the system and they can
even be replaced between iterations of an ongoing assignment. This facilitates
use cases such as iterative A/B testing of machine learning algorithms or
modifying experimental algorithms on-the-fly.
","[{'version': 'v1', 'created': 'Thu, 3 Oct 2019 09:06:06 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Jun 2020 22:23:38 GMT'}]",2020-09-17,"[['Ulm', 'Gregor', ''], ['Gustavsson', 'Emil', ''], ['Jirstrand', 'Mats', '']]","['Distributed computing', 'code replacement', 'Erlang']"
7086,2009.00544,Kamwoo Lee,Kamwoo Lee and Jeanine Braithwaite,High-Resolution Poverty Maps in Sub-Saharan Africa,"Changed an author's affiliation, updated the narrowing method for DHS
  clusters leading to slight changes to all validation results",World Development 159 (2022): 106028,10.1016/j.worlddev.2022.106028,,cs.CY cs.LG econ.GN q-fin.EC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Up-to-date poverty maps are an important tool for policy makers, but until
now, have been prohibitively expensive to produce. We propose a generalizable
prediction methodology to produce poverty maps at the village level using
geospatial data and machine learning algorithms. We tested the proposed method
for 25 Sub-Saharan African countries and validated them against survey data.
The proposed method can increase the validity of both single country and
cross-country estimations leading to higher precision in poverty maps of 44
Sub-Saharan African countries than previously available. More importantly, our
cross-country estimation enables the creation of poverty maps when it is not
practical or cost-effective to field new national household surveys, as is the
case with many low- and middle-income countries.
","[{'version': 'v1', 'created': 'Tue, 1 Sep 2020 16:23:43 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Sep 2020 09:27:19 GMT'}, {'version': 'v3', 'created': 'Sun, 13 Sep 2020 03:54:39 GMT'}, {'version': 'v4', 'created': 'Mon, 28 Sep 2020 17:37:05 GMT'}, {'version': 'v5', 'created': 'Mon, 10 May 2021 02:00:52 GMT'}]",2022-08-03,"[['Lee', 'Kamwoo', ''], ['Braithwaite', 'Jeanine', '']]","['poverty estimation', 'machine learning', 'OpenStreetMap', 'satellite imagery', 'cross-country estimation', 'Sub-Saharan Africa']"
7087,2009.02098,Nijat Mehdiyev,Nijat Mehdiyev and Peter Fettke,"Explainable Artificial Intelligence for Process Mining: A General
  Overview and Application of a Novel Local Explanation Approach for Predictive
  Process Monitoring","Manuscript submitted (10.07.2020) to the edited volume ""Interpretable
  Artificial Intelligence: A perspective of Granular Computing"" (published by
  Springer)",,10.1007/978-3-030-64949-4_1,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The contemporary process-aware information systems possess the capabilities
to record the activities generated during the process execution. To leverage
these process specific fine-granular data, process mining has recently emerged
as a promising research discipline. As an important branch of process mining,
predictive business process management, pursues the objective to generate
forward-looking, predictive insights to shape business processes. In this
study, we propose a conceptual framework sought to establish and promote
understanding of decision-making environment, underlying business processes and
nature of the user characteristics for developing explainable business process
prediction solutions. Consequently, with regard to the theoretical and
practical implications of the framework, this study proposes a novel local
post-hoc explanation approach for a deep learning classifier that is expected
to facilitate the domain experts in justifying the model decisions. In contrary
to alternative popular perturbation-based local explanation approaches, this
study defines the local regions from the validation dataset by using the
intermediate latent space representations learned by the deep neural networks.
To validate the applicability of the proposed explanation method, the real-life
process log data delivered by the Volvo IT Belgium's incident management system
are used.The adopted deep learning classifier achieves a good performance with
the Area Under the ROC Curve of 0.94. The generated local explanations are also
visualized and presented with relevant evaluation measures that are expected to
increase the users' trust in the black-box-model.
","[{'version': 'v1', 'created': 'Fri, 4 Sep 2020 10:28:56 GMT'}, {'version': 'v2', 'created': 'Sat, 12 Sep 2020 07:24:36 GMT'}]",2021-05-12,"[['Mehdiyev', 'Nijat', ''], ['Fettke', 'Peter', '']]","['Explainable Artificial Intelligence (XAI)', 'Deep Learning', 'Process Mining', 'Predictive Process Monitoring']"
7088,2203.15026,Chukwuma Okolie,Chukwuma Okolie and Julian Smit,"A systematic review and meta-analysis of Digital Elevation Model (DEM)
  fusion: pre-processing, methods and applications",,,10.1016/j.isprsjprs.2022.03.016,,cs.CV eess.IV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The remote sensing community has identified data fusion as one of the key
challenging topics of the 21st century. The subject of image fusion in
two-dimensional (2D) space has been covered in several published reviews.
However, the special case of 2.5D/3D Digital Elevation Model (DEM) fusion has
not been addressed till date. DEM fusion is a key application of data fusion in
remote sensing. It takes advantage of the complementary characteristics of
multi-source DEMs to deliver a more complete, accurate and reliable elevation
dataset. Although several methods for fusing DEMs have been developed, the
absence of a well-rounded review has limited their proliferation among
researchers and end-users. It is often required to combine knowledge from
multiple studies to inform a holistic perspective and guide further research.
In response, this paper provides a systematic review of DEM fusion: the
pre-processing workflow, methods and applications, enhanced with a
meta-analysis. Through the discussion and comparative analysis, unresolved
challenges and open issues were identified, and future directions for research
were proposed. This review is a timely solution and an invaluable source of
information for researchers within the fields of remote sensing and spatial
information science, and the data fusion community at large.
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2022 18:39:14 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Apr 2022 21:10:55 GMT'}]",2022-04-12,"[['Okolie', 'Chukwuma', ''], ['Smit', 'Julian', '']]","['Data fusion', 'Remote sensing image fusion', 'Multi-sensor fusion', 'Digital elevation']"
7089,2101.00930,Heiko Becker,"Heiko Becker, Nathaniel Bos, Ivan Gavran, Eva Darulova, Rupak Majumdar",Lassie: HOL4 Tactics by Example,,,10.1145/3437992.3439925,,cs.PL cs.LO,http://creativecommons.org/licenses/by-sa/4.0/,"  Proof engineering efforts using interactive theorem proving have yielded
several impressive projects in software systems and mathematics. A key obstacle
to such efforts is the requirement that the domain expert is also an expert in
the low-level details in constructing the proof in a theorem prover. In
particular, the user needs to select a sequence of tactics that lead to a
successful proof, a task that in general requires knowledge of the exact names
and use of a large set of tactics.
  We present Lassie, a tactic framework for the HOL4 theorem prover that allows
individual users to define their own tactic language by example and give
frequently used tactics or tactic combinations easier-to-remember names. The
core of Lassie is an extensible semantic parser, which allows the user to
interactively extend the tactic language through a process of definitional
generalization. Defining tactics in Lassie thus does not require any knowledge
in implementing custom tactics, while proofs written in Lassie retain the
correctness guarantees provided by the HOL4 system. We show through case
studies how Lassie can be used in small and larger proofs by novice and more
experienced interactive theorem prover users, and how we envision it to ease
the learning curve in a HOL4 tutorial.
","[{'version': 'v1', 'created': 'Mon, 4 Jan 2021 12:50:36 GMT'}]",2021-01-13,"[['Becker', 'Heiko', ''], ['Bos', 'Nathaniel', ''], ['Gavran', 'Ivan', ''], ['Darulova', 'Eva', ''], ['Majumdar', 'Rupak', '']]","['Interactive Theorem Proving', 'HOL4', 'SemanticParsing', 'Tactic Programming']"
7090,2001.11298,Matthew Moore,"Matthew Moore, Taylor Walenczyk",The Hidden Subgroup Problem for Universal Algebras,,,10.1145/3373718.3394764,,cs.LO math.CO quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Hidden Subgroup Problem (HSP) is a computational problem which includes
as special cases integer factorization, the discrete logarithm problem, graph
isomorphism, and the shortest vector problem. The celebrated polynomial-time
quantum algorithms for factorization and the discrete logarithm are restricted
versions of a generic polynomial-time quantum solution to the HSP for abelian
groups, but despite focused research no full solution has yet been found. We
propose a generalization of the HSP to include arbitrary algebraic structures
and analyze this new problem on powers of 2-element algebras. We prove a
complete classification of every such power as quantum tractable (i.e.
polynomial-time), classically tractable, quantum intractable, and classically
intractable. In particular, we identify a class of algebras for which the
generalized HSP exhibits super-polynomial speedup on a quantum computer
compared to a classical one.
","[{'version': 'v1', 'created': 'Thu, 30 Jan 2020 13:09:35 GMT'}, {'version': 'v2', 'created': 'Fri, 1 May 2020 20:14:21 GMT'}]",2020-05-05,"[['Moore', 'Matthew', ''], ['Walenczyk', 'Taylor', '']]","['quantum computation', 'hidden subgroup problem', 'hidden kernel problem', 'universal algebra', 'clone theory']"
7091,2004.03442,Nicolo Pollini,Nicol\`o Pollini,Fail-safe optimization of viscous dampers for seismic retrofitting,,Earthquake Engineering & Structural Dynamics 2020,10.1002/eqe.3319,,cs.CE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new optimization approach for designing minimum-cost
fail-safe distributions of fluid viscous dampers for seismic retrofitting.
Failure is modeled as either complete damage of the dampers or partial
degradation of the dampers' properties. In general, this leads to optimization
problems with large number of constraints. Thus, the use of a working-set
optimization algorithm is proposed. The main idea is to solve a sequence of
relaxed optimization sub-problems with a small sub-set of all constraints. The
algorithm terminates once a solution of a sub-problem is found that satisfies
all the constraints of the problem. The retrofitting cost is minimized with
constraints on the inter-story drifts at the peripheries of frame structures.
The structures considered are subjected to a realistic ensemble of ground
motions, and their response is evaluated with time-history analyses. The
transient optimization problem is efficiently solved with a gradient-based
sequential linear programming algorithm. The gradients of the response
functions are calculated with a consistent adjoint sensitivity analysis
procedure. Promising results attained for 3-D irregular frames are presented
and discussed. The numerical results highlight the fact that the optimized
layout and size of the dampers can change significantly even for moderate
levels of damage.
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2020 14:46:04 GMT'}]",2020-07-16,"[['Pollini', 'Nicolò', '']]","['fail-safe design', 'transient optimization', 'adjoint sensitivity analysis', 'viscous dampers', 'seismic retrofitting', 'passive control', 'earthquake engineering']"
7092,2209.00459,Matthew Barthet,"Matthew Barthet, Ahmed Khalifa, Antonios Liapis and Georgios N.
  Yannakakis",Generative Personas That Behave and Experience Like Humans,"10 pages, 6 figures",,10.1145/3555858.3555879,,cs.AI cs.HC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using artificial intelligence (AI) to automatically test a game remains a
critical challenge for the development of richer and more complex game worlds
and for the advancement of AI at large. One of the most promising methods for
achieving that long-standing goal is the use of generative AI agents, namely
procedural personas, that attempt to imitate particular playing behaviors which
are represented as rules, rewards, or human demonstrations. All research
efforts for building those generative agents, however, have focused solely on
playing behavior which is arguably a narrow perspective of what a player
actually does in a game. Motivated by this gap in the existing state of the
art, in this paper we extend the notion of behavioral procedural personas to
cater for player experience, thus examining generative agents that can both
behave and experience their game as humans would. For that purpose, we employ
the Go-Explore reinforcement learning paradigm for training human-like
procedural personas, and we test our method on behavior and experience
demonstrations of more than 100 players of a racing game. Our findings suggest
that the generated agents exhibit distinctive play styles and experience
responses of the human personas they were designed to imitate. Importantly, it
also appears that experience, which is tied to playing behavior, can be a
highly informative driver for better behavioral exploration.
","[{'version': 'v1', 'created': 'Fri, 26 Aug 2022 12:04:53 GMT'}]",2022-09-02,"[['Barthet', 'Matthew', ''], ['Khalifa', 'Ahmed', ''], ['Liapis', 'Antonios', ''], ['Yannakakis', 'Georgios N.', '']]","['go-explore', 'player persona', 'imitation learning', 'reinforcement learning', 'affective computing']"
7093,1708.04807,Andrew Adamatzky,"Thomas C. Draper, Claire Fullarton, Neil Phillips, Ben P. J. De Lacy
  Costello, Andrew Adamatzky",Liquid Marble Interaction Gate for Collision-Based Computing,,"Materials Today, 2017, 20, 561-568",10.1016/j.mattod.2017.09.004,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Liquid marbles are microlitre droplets of liquid, encapsulated by
self-organised hydrophobic particles at the liquid/air interface. They offer an
efficient approach for manipulating liquid droplets and compartmentalising
reactions in droplets. Digital fluidic devices employing liquid marbles might
benefit from having embedded computing circuits without electronics and moving
mechanical parts (apart from the marbles). We present an experimental
implementation of a collision gate with liquid marbles. Mechanics of the gate
follows principles of Margolus' soft-sphere collision gate. Boolean values of
the inputs are given by the absence (FALSE) or presence (TRUE) of a liquid
marble. There are three outputs: two outputs are trajectories of undisturbed
marbles (they only report TRUE when just one marble is present at one of the
inputs), one output is represented by trajectories of colliding marbles (when
two marbles collide they lose their horizontal momentum and fall), this output
reports TRUE only when two marbles are present at inputs. Thus the gate
implements AND and AND-NOT logical functions. We speculate that by merging
trajectories representing AND-NOT output into a single channel one can produce
a one-bit half-adder. Potential design of a one-bit full-adder is discussed,
and the synthesis of both a pure nickel metal and hybrid nickel/polymer liquid
marble is reported.
","[{'version': 'v1', 'created': 'Wed, 16 Aug 2017 08:32:51 GMT'}]",2018-11-06,"[['Draper', 'Thomas C.', ''], ['Fullarton', 'Claire', ''], ['Phillips', 'Neil', ''], ['Costello', 'Ben P. J. De Lacy', ''], ['Adamatzky', 'Andrew', '']]","['Liquid marble', 'Unconventional computing', 'Collision computing', 'Adder', 'Logic gate', 'Microfluidic']"
7094,2208.10366,Bing Liu,"Bing Liu, Wen Hua, Guido Zuccon, Genghong Zhao, Xia Zhang",High-quality Task Division for Large-scale Entity Alignment,,,10.1145/3511808.3557352,,cs.AI cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Entity Alignment (EA) aims to match equivalent entities that refer to the
same real-world objects and is a key step for Knowledge Graph (KG) fusion. Most
neural EA models cannot be applied to large-scale real-life KGs due to their
excessive consumption of GPU memory and time. One promising solution is to
divide a large EA task into several subtasks such that each subtask only needs
to match two small subgraphs of the original KGs. However, it is challenging to
divide the EA task without losing effectiveness. Existing methods display low
coverage of potential mappings, insufficient evidence in context graphs, and
largely differing subtask sizes.
  In this work, we design the DivEA framework for large-scale EA with
high-quality task division. To include in the EA subtasks a high proportion of
the potential mappings originally present in the large EA task, we devise a
counterpart discovery method that exploits the locality principle of the EA
task and the power of trained EA models. Unique to our counterpart discovery
method is the explicit modelling of the chance of a potential mapping. We also
introduce an evidence passing mechanism to quantify the informativeness of
context entities and find the most informative context graphs with flexible
control of the subtask size. Extensive experiments show that DivEA achieves
higher EA performance than alternative state-of-the-art solutions.
","[{'version': 'v1', 'created': 'Mon, 22 Aug 2022 14:46:38 GMT'}]",2022-08-23,"[['Liu', 'Bing', ''], ['Hua', 'Wen', ''], ['Zuccon', 'Guido', ''], ['Zhao', 'Genghong', ''], ['Zhang', 'Xia', '']]","['Large-scale Entity Alignment', 'Knowledge Graph', 'Task division']"
7095,2209.06467,Diab Abueidda,"Junyan He and Diab Abueidda and Rashid Abu Al-Rub and Seid Koric and
  Iwona Jasiuk",A deep learning energy-based method for classical elastoplasticity,,,10.1016/j.ijplas.2023.103531,,cs.CE cs.NA math.NA,http://creativecommons.org/licenses/by/4.0/,"  The deep energy method (DEM) has been used to solve the elastic deformation
of structures with linear elasticity, hyperelasticity, and strain-gradient
elasticity material models based on the principle of minimum potential energy.
In this work, we extend DEM to elastoplasticity problems involving path
dependence and irreversibility. A loss function inspired by the discrete
variational formulation of plasticity is proposed. The radial return algorithm
is coupled with DEM to update the plastic internal state variables without
violating the Kuhn-Tucker consistency conditions. Finite element shape
functions and their gradients are used to approximate the spatial gradients of
the DEM-predicted displacements, and Gauss quadrature is used to integrate the
loss function. Four numerical examples are presented to demonstrate the use of
the framework, such as generating stress-strain curves in cyclic loading,
material heterogeneity, performance comparison with other physics-informed
methods, and simulation/inference on unstructured meshes. In all cases, the DEM
solution shows decent accuracy compared to the reference solution obtained from
the finite element method. The current DEM model marks the first time that
energy-based physics-informed neural networks are extended to plasticity, and
offers promising potential to effectively solve elastoplasticity problems from
scratch using deep neural networks.
","[{'version': 'v1', 'created': 'Wed, 14 Sep 2022 07:46:26 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Nov 2022 11:39:00 GMT'}]",2023-01-26,"[['He', 'Junyan', ''], ['Abueidda', 'Diab', ''], ['Al-Rub', 'Rashid Abu', ''], ['Koric', 'Seid', ''], ['Jasiuk', 'Iwona', '']]","['Deep energy method', 'Plasticity', 'Variational formulation', 'Radial return', 'Cyclic loading']"
7096,2006.10608,Sergio Garc\'ia,"Sergio Garc\'ia, Daniel Str\""uber, Davide Brugali, Thorsten Berger,
  Patrizio Pelliccione","Robotics Software Engineering: A Perspective from the Service Robotics
  Domain","11 pages + 1 page for references, 3 figures, 3 tables, in proceedings
  of ESEC/FSE 2020",,10.1145/3368089.3409743,,cs.SE cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robots that support humans by performing useful tasks (a.k.a., service
robots) are booming worldwide. In contrast to industrial robots, the
development of service robots comes with severe software engineering
challenges, since they require high levels of robustness and autonomy to
operate in highly heterogeneous environments. As a domain with critical safety
implications, service robotics faces a need for sound software development
practices. In this paper, we present the first large-scale empirical study to
assess the state of the art and practice of robotics software engineering. We
conducted 18 semi-structured interviews with industrial practitioners working
in 15 companies from 9 different countries and a survey with 156 respondents
(from 26 countries) from the robotics domain. Our results provide a
comprehensive picture of (i) the practices applied by robotics industrial and
academic practitioners, including processes, paradigms, languages, tools,
frameworks, and reuse practices, (ii) the distinguishing characteristics of
robotics software engineering, and (iii) recurrent challenges usually faced,
together with adopted solutions. The paper concludes by discussing
observations, derived hypotheses, and proposed actions for researchers and
practitioners.
","[{'version': 'v1', 'created': 'Thu, 18 Jun 2020 15:23:54 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Jun 2020 19:53:56 GMT'}, {'version': 'v3', 'created': 'Fri, 26 Jun 2020 07:13:16 GMT'}, {'version': 'v4', 'created': 'Tue, 7 Jul 2020 11:21:13 GMT'}, {'version': 'v5', 'created': 'Mon, 7 Sep 2020 09:08:50 GMT'}, {'version': 'v6', 'created': 'Tue, 8 Sep 2020 11:51:07 GMT'}]",2020-09-09,"[['García', 'Sergio', ''], ['Strüber', 'Daniel', ''], ['Brugali', 'Davide', ''], ['Berger', 'Thorsten', ''], ['Pelliccione', 'Patrizio', '']]","['robotics software engineering', 'interviews', 'online survey']"
7097,2208.06593,Pino Caballero-Gil,"Jezabel Molina-Gil, Pino Caballero-Gil, C\'andido Caballero-Gil,
  Amparo F\'uster-Sabater","Analysis and implementation of the SNOW 3G generator used in 4G/LTE
  systems",arXiv admin note: substantial text overlap with arXiv:2208.06147,"International Joint Conference SOCO CISIS ICEUTE, 499-508, 2014",10.1007/978-3-319-01854-6_51,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The fourth generation of cell phones, marketed as 4G/LTE (Long-Term
Evolution) is being quickly adopted worldwide. Given the mobile and wireless
nature of the involved communications, security is crucial. This paper includes
both a theoretical study and a practical analysis of the SNOW 3G generator,
included in such a standard for protecting confidentiality and integrity. From
its implementation and performance evaluation in mobile devices, several
conclusions about how to improve its efficiency are obtained.
","[{'version': 'v1', 'created': 'Sat, 13 Aug 2022 08:20:45 GMT'}]",2022-08-16,"[['Molina-Gil', 'Jezabel', ''], ['Caballero-Gil', 'Pino', ''], ['Caballero-Gil', 'Cándido', ''], ['Fúster-Sabater', 'Amparo', '']]","['4G/LTE encryption', 'stream cipher', 'SNOW 3G']"
7098,2211.04049,Bela Gipp,"Moritz Schubotz, Ankit Satpute, Andre Greiner-Petter, Akiko Aizawa,
  Bela Gipp","Caching and Reproducibility: Making Data Science experiments faster and
  FAIRer","8 pages, 1 table","Frontiers in Research Metrics and Analytics, volume 7, 2022",10.3389/frma.2022.861944,,cs.SE cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Small to medium-scale data science experiments often rely on research
software developed ad-hoc by individual scientists or small teams. Often there
is no time to make the research software fast, reusable, and open access. The
consequence is twofold. First, subsequent researchers must spend significant
work hours building upon the proposed hypotheses or experimental framework. In
the worst case, others cannot reproduce the experiment and reuse the findings
for subsequent research. Second, suppose the ad-hoc research software fails
during often long-running computationally expensive experiments. In that case,
the overall effort to iteratively improve the software and rerun the
experiments creates significant time pressure on the researchers. We suggest
making caching an integral part of the research software development process,
even before the first line of code is written. This article outlines caching
recommendations for developing research software in data science projects. Our
recommendations provide a perspective to circumvent common problems such as
propriety dependence, speed, etc. At the same time, caching contributes to the
reproducibility of experiments in the open science workflow. Concerning the
four guiding principles, i.e., Findability, Accessibility, Interoperability,
and Reusability (FAIR), we foresee that including the proposed recommendation
in a research software development will make the data related to that software
FAIRer for both machines and humans. We exhibit the usefulness of some of the
proposed recommendations on our recently completed research software project in
mathematical information retrieval.
","[{'version': 'v1', 'created': 'Tue, 8 Nov 2022 07:11:02 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Nov 2022 14:45:50 GMT'}]",2022-11-10,"[['Schubotz', 'Moritz', ''], ['Satpute', 'Ankit', ''], ['Greiner-Petter', 'Andre', ''], ['Aizawa', 'Akiko', ''], ['Gipp', 'Bela', '']]","['Caching', 'Data Science', 'Reproducibility', 'Open Science', 'Research Software']"
7099,2208.13302,Marcos Kalinowski,"Anna Luiza Gomes, Get\'ulio Vianna, Tatiana Escovedo, Marcos
  Kalinowski","Predicting IMDb Rating of TV Series with Deep Learning: The Case of
  Arrow",,XVIII Brazilian Symposium on Information Systems 2022,10.1145/3535511.3535520,,cs.LG cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Context: The number of TV series offered nowadays is very high. Due to its
large amount, many series are canceled due to a lack of originality that
generates a low audience.
  Problem: Having a decision support system that can show why some shows are a
huge success or not would facilitate the choices of renewing or starting a
show.
  Solution: We studied the case of the series Arrow broadcasted by CW Network
and used descriptive and predictive modeling techniques to predict the IMDb
rating. We assumed that the theme of the episode would affect its evaluation by
users, so the dataset is composed only by the director of the episode, the
number of reviews that episode got, the percentual of each theme extracted by
the Latent Dirichlet Allocation (LDA) model of an episode, the number of
viewers from Wikipedia and the rating from IMDb. The LDA model is a generative
probabilistic model of a collection of documents made up of words.
  Method: In this prescriptive research, the case study method was used, and
its results were analyzed using a quantitative approach.
  Summary of Results: With the features of each episode, the model that
performed the best to predict the rating was Catboost due to a similar mean
squared error of the KNN model but a better standard deviation during the test
phase. It was possible to predict IMDb ratings with an acceptable root mean
squared error of 0.55.
","[{'version': 'v1', 'created': 'Sun, 28 Aug 2022 22:16:11 GMT'}]",2022-08-30,"[['Gomes', 'Anna Luiza', ''], ['Vianna', 'Getúlio', ''], ['Escovedo', 'Tatiana', ''], ['Kalinowski', 'Marcos', '']]","['Machine Learning', 'Deep Learning', 'LDA', 'prediction', 'tv-series', 'IMDb']"
7100,2109.09789,Gohar Sargsyan,"Gohar Sargsyan, Nicolas Castellon, Raymond Binnendijk, Peter Cozijnsen","Blockchain Security by Design Framework for Trust and Adoption in IoT
  Environment","This paper is a preprint; it has been accepted for publication in
  2019 IEEE World Congress on Services(SERVICES), 8-13 July 2019, Milan, Italy.
  The paper consists of 6 pages, and contains of 1 figure and 2 tables",IEEE Xplore 29 August 2019,10.1109/SERVICES.2019.00018,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the recent advances of IoT (Internet of Things) new and more robust
security frameworks are needed to detect and mitigate new forms of
cyber-attacks, which exploit complex and heterogeneity IoT networks, as well
as, the existence of many vulnerabilities in IoT devices. With the rise of
blockchain technologies service providers pay considerable attention to better
understand and adopt blockchain technologies in order to have better secure and
trusted systems for own organisations and their customers. The present paper
introduces a high level guide for the senior officials and decision makers in
the organisations and technology managers for blockchain security framework by
design principle for trust and adoption in IoT environments. The paper
discusses Cyber-Trust project blockchain technology development as a
representative case study for offered security framework. Security and privacy
by design approach is introduced as an important consideration in setting up
the framework.
","[{'version': 'v1', 'created': 'Mon, 20 Sep 2021 18:39:31 GMT'}]",2021-09-22,"[['Sargsyan', 'Gohar', ''], ['Castellon', 'Nicolas', ''], ['Binnendijk', 'Raymond', ''], ['Cozijnsen', 'Peter', '']]","['blockchain security', 'cybersecurity', 'trust and']"
7101,1911.01211,"Michael Sch\""uler","Michael Sch\""uler and Denis Gole\v{z} and Yuta Murakami and Nikolaj
  Bittner and Andreas Hermann and Hugo U. R. Strand and Philipp Werner and
  Martin Eckstein",NESSi: The Non-Equilibrium Systems Simulation package,"86 pages, 15 figures",,10.1016/j.cpc.2020.107484,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The nonequilibrium dynamics of correlated many-particle systems is of
interest in connection with pump-probe experiments on molecular systems and
solids, as well as theoretical investigations of transport properties and
relaxation processes. Nonequilibrium Green's functions are a powerful tool to
study interaction effects in quantum many-particle systems out of equilibrium,
and to extract physically relevant information for the interpretation of
experiments. We present the open-source software package NESSi (The
Non-Equilibrium Systems Simulation package) which allows to perform many-body
dynamics simulations based on Green's functions on the L-shaped Kadanoff-Baym
contour. NESSi contains the library libcntr which implements tools for basic
operations on these nonequilibrium Green's functions, for constructing Feynman
diagrams, and for the solution of integral and integro-differential equations
involving contour Green's functions. The library employs a discretization of
the Kadanoff-Baym contour into time $N$ points and a high-order implementation
of integration routines. The total integrated error scales up to
$\mathcal{O}(N^{-7})$, which is important since the numerical effort increases
at least cubically with the simulation time. A distributed-memory
parallelization over reciprocal space allows large-scale simulations of lattice
systems. We provide a collection of example programs ranging from dynamics in
simple two-level systems to problems relevant in contemporary condensed matter
physics, including Hubbard clusters and Hubbard or Holstein lattice models. The
libcntr library is the basis of a follow-up software package for nonequilibrium
dynamical mean-field theory calculations based on strong-coupling perturbative
impurity solvers.
","[{'version': 'v1', 'created': 'Wed, 30 Oct 2019 20:39:50 GMT'}]",2020-08-26,"[['Schüler', 'Michael', ''], ['Golež', 'Denis', ''], ['Murakami', 'Yuta', ''], ['Bittner', 'Nikolaj', ''], ['Hermann', 'Andreas', ''], ['Strand', 'Hugo U. R.', ''], ['Werner', 'Philipp', ''], ['Eckstein', 'Martin', '']]","['numerical simulations', 'nonequilibrium dynamics of quantummany-body problems', 'Keldysh formalism', 'Kadanoff-Baym equations']"
7102,1910.02352,Zenan Li,"Zenan Li, Xiaoxing Ma, Chang Xu, Jingwei Xu, Chun Cao and Jian L\""u","Operational Calibration: Debugging Confidence Errors for DNNs in the
  Field","Published in the Proceedings of the 28th ACM Joint European Software
  Engineering Conference and Symposium on the Foundations of Software
  Engineering (ESEC/FSE 2020)",,10.1145/3368089.3409696,,cs.LG cs.SE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Trained DNN models are increasingly adopted as integral parts of software
systems, but they often perform deficiently in the field. A particularly
damaging problem is that DNN models often give false predictions with high
confidence, due to the unavoidable slight divergences between operation data
and training data. To minimize the loss caused by inaccurate confidence,
operational calibration, i.e., calibrating the confidence function of a DNN
classifier against its operation domain, becomes a necessary debugging step in
the engineering of the whole system.
  Operational calibration is difficult considering the limited budget of
labeling operation data and the weak interpretability of DNN models. We propose
a Bayesian approach to operational calibration that gradually corrects the
confidence given by the model under calibration with a small number of labeled
operation data deliberately selected from a larger set of unlabeled operation
data. The approach is made effective and efficient by leveraging the locality
of the learned representation of the DNN model and modeling the calibration as
Gaussian Process Regression. Comprehensive experiments with various practical
datasets and DNN models show that it significantly outperformed alternative
methods, and in some difficult tasks it eliminated about 71% to 97%
high-confidence (>0.9) errors with only about 10\% of the minimal amount of
labeled operation data needed for practical learning techniques to barely work.
","[{'version': 'v1', 'created': 'Sun, 6 Oct 2019 01:21:14 GMT'}, {'version': 'v2', 'created': 'Sun, 13 Sep 2020 02:28:32 GMT'}]",2020-09-16,"[['Li', 'Zenan', ''], ['Ma', 'Xiaoxing', ''], ['Xu', 'Chang', ''], ['Xu', 'Jingwei', ''], ['Cao', 'Chun', ''], ['Lü', 'Jian', '']]","['Operational Calibration', 'Deep Neural Networks', 'Gaussian Process']"
7103,1908.05361,"Janosch D\""ocker","Janosch D\""ocker, Britta Dorn, Simone Linz, Charles Semple","Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the
  polynomial hierarchy","36 pages; reference corrected in introduction (the result of
  Karpinski and Piecuch establishes NP-completeness of Not-All-Equal 3-SAT if
  each variable appears *at most* four times)","Theoretical Computer Science, 822:72-91, 2020",10.1016/j.tcs.2020.04.003,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The complexity of variants of 3-SAT and Not-All-Equal 3-SAT is well studied.
However, in contrast, very little is known about the complexity of the
problems' quantified counterparts. In the first part of this paper, we show
that $\forall \exists$ 3-SAT is $\Pi_2^P$-complete even if (1) each variable
appears exactly twice unnegated and exactly twice negated, (2) each clause is a
disjunction of exactly three distinct variables, and (3) the number of
universal variables is equal to the number of existential variables.
Furthermore, we show that the problem remains $\Pi_2^P$-complete if (1a) each
universal variable appears exactly once unnegated and exactly once negated,
(1b) each existential variable appears exactly twice unnegated and exactly
twice negated, and (2) and (3) remain unchanged. On the other hand, the problem
becomes NP-complete for certain variants in which each universal variable
appears exactly once. In the second part of the paper, we establish
$\Pi_2^P$-completeness for $\forall \exists$ Not-All-Equal 3-SAT even if (1')
the Boolean formula is linear and monotone, (2') each universal variable
appears exactly once and each existential variable appears exactly three times,
and (3') each clause is a disjunction of exactly three distinct variables that
contains at most one universal variable. On the positive side, we uncover
variants of $\forall \exists$ Not-All-Equal 3-SAT that are co-NP-complete or
solvable in polynomial time.
","[{'version': 'v1', 'created': 'Wed, 14 Aug 2019 22:09:49 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Aug 2019 14:12:01 GMT'}]",2021-04-13,"[['Döcker', 'Janosch', ''], ['Dorn', 'Britta', ''], ['Linz', 'Simone', ''], ['Semple', 'Charles', '']]","['3-Sat', 'Not-All-Equal 3-Sat', 'quantified satisfiability', 'polynomialhierarchy', 'bounded variable appearances', 'computational complexity']"
7104,2004.05018,Daniel Paulusma,"Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniel
  Paulusma",Bounding the Mim-Width of Hereditary Graph Classes,,,10.1002/jgt.22730,,cs.DS cs.CC cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A large number of NP-hard graph problems become polynomial-time solvable on
graph classes where the mim-width is bounded and quickly computable. Hence,
when solving such problems on special graph classes, it is helpful to know
whether the graph class under consideration has bounded mim-width. We first
extend the toolkit for proving (un)boundedness of mim-width of graph classes.
This enables us to initiate a systematic study into bounding mim-width from the
perspective of hereditary graph classes. For a given graph $H$, the class of
$H$-free graphs has bounded mim-width if and only if it has bounded
clique-width. We show that the same is not true for $(H_1,H_2)$-free graphs. We
find several general classes of $(H_1,H_2)$-free graphs having unbounded
clique-width, but the mim-width is bounded and quickly computable. We also
prove a number of new results showing that, for certain $H_1$ and $H_2$, the
class of $(H_1,H_2)$-free graphs has unbounded mim-width. Combining these with
known results, we present summary theorems of the current state of the art for
the boundedness of mim-width for $(H_1,H_2)$-free graphs.
","[{'version': 'v1', 'created': 'Fri, 10 Apr 2020 13:02:31 GMT'}, {'version': 'v2', 'created': 'Mon, 4 May 2020 17:59:47 GMT'}, {'version': 'v3', 'created': 'Wed, 18 Nov 2020 01:06:56 GMT'}]",2021-08-27,"[['Brettell', 'Nick', ''], ['Horsfield', 'Jake', ''], ['Munaro', 'Andrea', ''], ['Paesani', 'Giacomo', ''], ['Paulusma', 'Daniel', '']]","['Width parameter', 'mim-width', 'clique-width', 'hereditary graph class']"
7105,1912.12555,Hanwen Kang,Hanwen Kang and Chao Chen,"Visual Perception and Modelling in Unstructured Orchard for Apple
  Harvesting Robots","21 pages,10 figures",,10.1109/ACCESS.2020.2984556,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vision perception and modelling are the essential tasks of robotic harvesting
in the unstructured orchard. This paper develops a framework of visual
perception and modelling for robotic harvesting of fruits in the orchard
environments. The developed framework includes visual perception, scenarios
mapping, and fruit modelling. The Visual perception module utilises a
deep-learning model to perform multi-purpose visual perception task within the
working scenarios; The scenarios mapping module applies OctoMap to represent
the multiple classes of objects or elements within the environment; The fruit
modelling module estimates the geometry property of objects and estimates the
proper access pose of each fruit. The developed framework is implemented and
evaluated in the apple orchards. The experiment results show that visual
perception and modelling algorithm can accurately detect and localise the
fruits, and modelling working scenarios in real orchard environments. The
$F_{1}$ score and mean intersection of union of visual perception module on
fruit detection and segmentation are 0.833 and 0.852, respectively. The
accuracy of the fruit modelling in terms of centre localisation and pose
estimation are 0.955 and 0.923, respectively. Overall, an accurate visual
perception and modelling algorithm are presented in this paper.
","[{'version': 'v1', 'created': 'Sun, 29 Dec 2019 00:30:59 GMT'}]",2021-12-09,"[['Kang', 'Hanwen', ''], ['Chen', 'Chao', '']]","['robotic harvesting', 'machine vision', 'deep learning', 'pose estimation', 'visual modeling']"
7106,1703.10983,Bartlomiej Placzek,"Bartlomiej Placzek, Marcin Bernas","Detection of malicious data in vehicular ad-hoc networks for traffic
  signal control applications","11 pages, 4 figures","Computer Networks. CCIS, vol. 608, pp. 72-82, 2016",10.1007/978-3-319-39207-3_7,,cs.NI cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Effective applications of vehicular ad hoc networks in traffic signal control
require new methods for detection of malicious data. Injection of malicious
data can result in significantly decreased performance of such applications,
increased vehicle delays, fuel consumption, congestion, or even safety threats.
This paper introduces a method, which combines a model of expected driver
behaviour with position verification in order to detect the malicious data
injected by vehicle nodes that perform Sybil attacks. Effectiveness of this
approach was demonstrated in simulation experiments for a decentralized
self-organizing system that controls the traffic signals at multiple
intersections in an urban road network. Experimental results show that the
proposed method is useful for mitigating the negative impact of malicious data
on the performance of traffic signal control.
","[{'version': 'v1', 'created': 'Fri, 31 Mar 2017 16:59:58 GMT'}]",2017-04-03,"[['Placzek', 'Bartlomiej', ''], ['Bernas', 'Marcin', '']]","['vehicular networks', 'malicious data', 'Sybil attack', 'traffic signal control']"
7107,2110.05118,Felix Engelmann,"Felix Engelmann and Jan Philip Speichert and Ralf God and Frank Kargl
  and Christoph B\""osch",Confidential Token-Based License Management,"To be published in the proceedings of the 2021 Workshop on Additive
  Manufacturing (3D Printing) Security (AMSec '21)",,10.1145/3462223.3485619,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a global economy with many competitive participants, licensing and
tracking of 3D printed parts is desirable if not mandatory for many use-cases.
We investigate a blockchain-based approach, as blockchains provide many
attractive features, like decentralized architecture and high security
assurances. An often neglected aspect of the product life-cycle management is
the confidentiality of transactions to hide valuable business information from
competitors. To solve the combined problem of trust and confidentiality, we
present a confidential licensing and tracking system which works on any
publicly verifiable, token-based blockchain that supports tokens of different
types representing licenses or attributes of parts. Together with the secure
integration of a unique eID in each part, our system provides an efficient,
immutable and authenticated transaction log scalable to thousands of
transactions per second. With our confidential Token-Based License Management
system (cTLM), large industries such as automotive or aviation can license and
trace all parts confidentially.
","[{'version': 'v1', 'created': 'Mon, 11 Oct 2021 09:52:57 GMT'}]",2021-10-12,"[['Engelmann', 'Felix', ''], ['Speichert', 'Jan Philip', ''], ['God', 'Ralf', ''], ['Kargl', 'Frank', ''], ['Bösch', 'Christoph', '']]","['Licensing', 'Confidential Transactions', 'Product Life-cycle Management', 'Track and Trace']"
7108,2012.07563,Musarrat Husssain,"Musarrat Hussain, Fahad Ahmed Satti, Jamil Hussain, Taqdir Ali, Syed
  Imran Ali, Hafiz Syed Muhammad Bilal, Gwang Hoon Park, Sungyoung Lee","A Practical Approach towards Causality Mining in Clinical Text using
  Active Transfer Learning",,Journal of Biomedical Informatics 123 (2021) 103932,10.1016/j.jbi.2021.103932,,cs.CL cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Objective: Causality mining is an active research area, which requires the
application of state-of-the-art natural language processing techniques. In the
healthcare domain, medical experts create clinical text to overcome the
limitation of well-defined and schema driven information systems. The objective
of this research work is to create a framework, which can convert clinical text
into causal knowledge. Methods: A practical approach based on term expansion,
phrase generation, BERT based phrase embedding and semantic matching, semantic
enrichment, expert verification, and model evolution has been used to construct
a comprehensive causality mining framework. This active transfer learning based
framework along with its supplementary services, is able to extract and enrich,
causal relationships and their corresponding entities from clinical text.
Results: The multi-model transfer learning technique when applied over multiple
iterations, gains performance improvements in terms of its accuracy and recall
while keeping the precision constant. We also present a comparative analysis of
the presented techniques with their common alternatives, which demonstrate the
correctness of our approach and its ability to capture most causal
relationships. Conclusion: The presented framework has provided cutting-edge
results in the healthcare domain. However, the framework can be tweaked to
provide causality detection in other domains, as well. Significance: The
presented framework is generic enough to be utilized in any domain, healthcare
services can gain massive benefits due to the voluminous and various nature of
its data. This causal knowledge extraction framework can be used to summarize
clinical text, create personas, discover medical knowledge, and provide
evidence to clinical decision making.
","[{'version': 'v1', 'created': 'Thu, 10 Dec 2020 06:51:13 GMT'}]",2021-10-13,"[['Hussain', 'Musarrat', ''], ['Satti', 'Fahad Ahmed', ''], ['Hussain', 'Jamil', ''], ['Ali', 'Taqdir', ''], ['Ali', 'Syed Imran', ''], ['Bilal', 'Hafiz Syed Muhammad', ''], ['Park', 'Gwang Hoon', ''], ['Lee', 'Sungyoung', '']]","['Causality Mining', 'Active transfer learning', 'Clinical text']"
7109,2107.07233,Sagnik Sarkar,"Shaashwat Agrawal, Sagnik Sarkar, Mamoun Alazab, Praveen Kumar Reddy
  Maddikunta, Thippa Reddy Gadekallu and Quoc-Viet Pham","Genetic CFL: Optimization of Hyper-Parameters in Clustered Federated
  Learning","7 pages, 4 figures, 4 tables","Computational Intelligence and Neuroscience, vol. 2021, Article ID
  7156420, 10 pages, 2021",10.1155/2021/7156420,,cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Federated learning (FL) is a distributed model for deep learning that
integrates client-server architecture, edge computing, and real-time
intelligence. FL has the capability of revolutionizing machine learning (ML)
but lacks in the practicality of implementation due to technological
limitations, communication overhead, non-IID (independent and identically
distributed) data, and privacy concerns. Training a ML model over heterogeneous
non-IID data highly degrades the convergence rate and performance. The existing
traditional and clustered FL algorithms exhibit two main limitations, including
inefficient client training and static hyper-parameter utilization. To overcome
these limitations, we propose a novel hybrid algorithm, namely genetic
clustered FL (Genetic CFL), that clusters edge devices based on the training
hyper-parameters and genetically modifies the parameters cluster-wise. Then, we
introduce an algorithm that drastically increases the individual cluster
accuracy by integrating the density-based clustering and genetic
hyper-parameter optimization. The results are bench-marked using MNIST
handwritten digit dataset and the CIFAR-10 dataset. The proposed genetic CFL
shows significant improvements and works well with realistic cases of non-IID
and ambiguous data.
","[{'version': 'v1', 'created': 'Thu, 15 Jul 2021 10:16:05 GMT'}, {'version': 'v2', 'created': 'Sat, 17 Jul 2021 13:15:20 GMT'}, {'version': 'v3', 'created': 'Fri, 19 Nov 2021 11:53:16 GMT'}]",2021-11-22,"[['Agrawal', 'Shaashwat', ''], ['Sarkar', 'Sagnik', ''], ['Alazab', 'Mamoun', ''], ['Maddikunta', 'Praveen Kumar Reddy', ''], ['Gadekallu', 'Thippa Reddy', ''], ['Pham', 'Quoc-Viet', '']]","['Clustered Federated Learning', 'GeneticHyper-Parameter Optimization', 'Non-IID Data']"
7110,1307.1599,Uwe Aickelin,"Chris Roadknight, Uwe Aickelin, Guoping Qiu, John Scholefield, Lindy
  Durrant","Supervised Learning and Anti-learning of Colorectal Cancer Classes and
  Survival Rates from Cellular Biology Parameters","IEEE International Conference on Systems, Man, and Cybernetics, pp
  797-802, 2012",,10.1109/ICSMC.2012.6377825,,cs.LG cs.CE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we describe a dataset relating to cellular and physical
conditions of patients who are operated upon to remove colorectal tumours. This
data provides a unique insight into immunological status at the point of tumour
removal, tumour classification and post-operative survival. Attempts are made
to learn relationships between attributes (physical and immunological) and the
resulting tumour stage and survival. Results for conventional machine learning
approaches can be considered poor, especially for predicting tumour stages for
the most important types of cancer. This poor performance is further
investigated and compared with a synthetic, dataset based on the logical
exclusive-OR function and it is shown that there is a significant level of
'anti-learning' present in all supervised methods used and this can be
explained by the highly dimensional, complex and sparsely representative
dataset. For predicting the stage of cancer from the immunological attributes,
anti-learning approaches outperform a range of popular algorithms.
","[{'version': 'v1', 'created': 'Fri, 5 Jul 2013 12:53:28 GMT'}]",2016-11-17,"[['Roadknight', 'Chris', ''], ['Aickelin', 'Uwe', ''], ['Qiu', 'Guoping', ''], ['Scholefield', 'John', ''], ['Durrant', 'Lindy', '']]","['Neural Networks', 'Colorectal Cancer', 'Anti-learning']"
7111,2203.04088,Yingjie Hu,"Ting Chang, Yingjie Hu, Dane Taylor, Brian M. Quigley","The role of alcohol outlet visits derived from mobile phone location
  data in enhancing domestic violence prediction at the neighborhood level",35 pages,"Health & Place, 73, 102736 (2022)",10.1016/j.healthplace.2021.102736,,cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Domestic violence (DV) is a serious public health issue, with 1 in 3 women
and 1 in 4 men experiencing some form of partner-related violence every year.
Existing research has shown a strong association between alcohol use and DV at
the individual level. Accordingly, alcohol use could also be a predictor for DV
at the neighborhood level, helping identify the neighborhoods where DV is more
likely to happen. However, it is difficult and costly to collect data that can
represent neighborhood-level alcohol use especially for a large geographic
area. In this study, we propose to derive information about the alcohol outlet
visits of the residents of different neighborhoods from anonymized mobile phone
location data, and investigate whether the derived visits can help better
predict DV at the neighborhood level. We use mobile phone data from the company
SafeGraph, which is freely available to researchers and which contains
information about how people visit various points-of-interest including alcohol
outlets. In such data, a visit to an alcohol outlet is identified based on the
GPS point location of the mobile phone and the building footprint (a polygon)
of the alcohol outlet. We present our method for deriving neighborhood-level
alcohol outlet visits, and experiment with four different statistical and
machine learning models to investigate the role of the derived visits in
enhancing DV prediction based on an empirical dataset about DV in Chicago. Our
results reveal the effectiveness of the derived alcohol outlets visits in
helping identify neighborhoods that are more likely to suffer from DV, and can
inform policies related to DV intervention and alcohol outlet licensing.
","[{'version': 'v1', 'created': 'Sat, 26 Feb 2022 15:50:42 GMT'}]",2022-03-09,"[['Chang', 'Ting', ''], ['Hu', 'Yingjie', ''], ['Taylor', 'Dane', ''], ['Quigley', 'Brian M.', '']]","['Domestic violence', 'alcohol outlet visit', 'mobile phone location data', 'points of interest', 'machine learning']"
7112,2011.03091,Kristijan Bartol,"Kristijan Bartol and David Bojanic and Tomislav Petkovic and Tomislav
  Pribanic and Yago Diez Donoso",Towards Keypoint Guided Self-Supervised Depth Estimation,,"15th International Joint Conference on Computer Vision, Imaging
  and Computer Graphics Theory and Applications, 2019",10.5220/0009190005830589,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes to use keypoints as a self-supervision clue for learning
depth map estimation from a collection of input images. As ground truth depth
from real images is difficult to obtain, there are many unsupervised and
self-supervised approaches to depth estimation that have been proposed. Most of
these unsupervised approaches use depth map and ego-motion estimations to
reproject the pixels from the current image into the adjacent image from the
image collection. Depth and ego-motion estimations are evaluated based on pixel
intensity differences between the correspondent original and reprojected
pixels. Instead of reprojecting the individual pixels, we propose to first
select image keypoints in both images and then reproject and compare the
correspondent keypoints of the two images. The keypoints should describe the
distinctive image features well. By learning a deep model with and without the
keypoint extraction technique, we show that using the keypoints improve the
depth estimation learning. We also propose some future directions for
keypoint-guided learning of structure-from-motion problems.
","[{'version': 'v1', 'created': 'Thu, 5 Nov 2020 20:45:03 GMT'}]",2020-11-09,"[['Bartol', 'Kristijan', ''], ['Bojanic', 'David', ''], ['Petkovic', 'Tomislav', ''], ['Pribanic', 'Tomislav', ''], ['Donoso', 'Yago Diez', '']]","['Monocular Depth Estimation', 'Self-Supervised Learning', 'Keypoint Similarity Loss']"
7113,1908.05674,Dong Cao,"Dong Cao, Lisha Xu","Bypass Enhancement RGB Stream Model for Pedestrian Action Recognition of
  Autonomous Vehicles","Accepted to ACPR 2019 - Workshop on Computer Vision for Modern
  Vehicles",,10.1007/978-981-15-3651-9_2,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pedestrian action recognition and intention prediction is one of the core
issues in the field of autonomous driving. In this research field, action
recognition is one of the key technologies. A large number of scholars have
done a lot of work to im-prove the accuracy of the algorithm for the task.
However, there are relatively few studies and improvements in the computational
complexity of algorithms and sys-tem real-time. In the autonomous driving
application scenario, the real-time per-formance and ultra-low latency of the
algorithm are extremely important evalua-tion indicators, which are directly
related to the availability and safety of the au-tonomous driving system. To
this end, we construct a bypass enhanced RGB flow model, which combines the
previous two-branch algorithm to extract RGB feature information and optical
flow feature information respectively. In the train-ing phase, the two branches
are merged by distillation method, and the bypass enhancement is combined in
the inference phase to ensure accuracy. The real-time behavior of the behavior
recognition algorithm is significantly improved on the premise that the
accuracy does not decrease. Experiments confirm the superiority and
effectiveness of our algorithm.
","[{'version': 'v1', 'created': 'Thu, 15 Aug 2019 07:37:14 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Sep 2019 07:02:31 GMT'}]",2020-04-24,"[['Cao', 'Dong', ''], ['Xu', 'Lisha', '']]","['Pedestrian Action Recognition', 'Autonomous Driving', 'Bypass Enhanced']"
7114,2205.04087,Nicolas Ugrinovic,"Nicolas Ugrinovic, Albert Pumarola, Alberto Sanfeliu and Francesc
  Moreno-Noguer",Single-view 3D Body and Cloth Reconstruction under Complex Poses,,,10.5220/0010896100003124,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Recent advances in 3D human shape reconstruction from single images have
shown impressive results, leveraging on deep networks that model the so-called
implicit function to learn the occupancy status of arbitrarily dense 3D points
in space. However, while current algorithms based on this paradigm, like
PiFuHD, are able to estimate accurate geometry of the human shape and clothes,
they require high-resolution input images and are not able to capture complex
body poses. Most training and evaluation is performed on 1k-resolution images
of humans standing in front of the camera under neutral body poses. In this
paper, we leverage publicly available data to extend existing implicit
function-based models to deal with images of humans that can have arbitrary
poses and self-occluded limbs. We argue that the representation power of the
implicit function is not sufficient to simultaneously model details of the
geometry and of the body pose. We, therefore, propose a coarse-to-fine approach
in which we first learn an implicit function that maps the input image to a 3D
body shape with a low level of detail, but which correctly fits the underlying
human pose, despite its complexity. We then learn a displacement map,
conditioned on the smoothed surface and on the input image, which encodes the
high-frequency details of the clothes and body. In the experimental section, we
show that this coarse-to-fine strategy represents a very good trade-off between
shape detail and pose correctness, comparing favorably to the most recent
state-of-the-art approaches. Our code will be made publicly available.
","[{'version': 'v1', 'created': 'Mon, 9 May 2022 07:34:06 GMT'}]",2022-05-10,"[['Ugrinovic', 'Nicolas', ''], ['Pumarola', 'Albert', ''], ['Sanfeliu', 'Alberto', ''], ['Moreno-Noguer', 'Francesc', '']]","['3D human reconstruction', 'augmented/virtual really', 'deep networks']"
7115,2101.08204,Do Le Quoc,"Do Le Quoc, Franz Gregor, Sergei Arnautov, Roland Kunkel, Pramod
  Bhatotia, Christof Fetzer",secureTF: A Secure TensorFlow Framework,arXiv admin note: text overlap with arXiv:1902.04413,"Pages 44-59, 2020",10.1145/3423211.3425687,,cs.CR cs.DC cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Data-driven intelligent applications in modern online services have become
ubiquitous. These applications are usually hosted in the untrusted cloud
computing infrastructure. This poses significant security risks since these
applications rely on applying machine learning algorithms on large datasets
which may contain private and sensitive information.
  To tackle this challenge, we designed secureTF, a distributed secure machine
learning framework based on Tensorflow for the untrusted cloud infrastructure.
secureTF is a generic platform to support unmodified TensorFlow applications,
while providing end-to-end security for the input data, ML model, and
application code. secureTF is built from ground-up based on the security
properties provided by Trusted Execution Environments (TEEs). However, it
extends the trust of a volatile memory region (or secure enclave) provided by
the single node TEE to secure a distributed infrastructure required for
supporting unmodified stateful machine learning applications running in the
cloud.
  The paper reports on our experiences about the system design choices and the
system deployment in production use-cases. We conclude with the lessons learned
based on the limitations of our commercially available platform, and discuss
open research problems for the future work.
","[{'version': 'v1', 'created': 'Wed, 20 Jan 2021 16:36:53 GMT'}]",2021-01-21,"[['Quoc', 'Do Le', ''], ['Gregor', 'Franz', ''], ['Arnautov', 'Sergei', ''], ['Kunkel', 'Roland', ''], ['Bhatotia', 'Pramod', ''], ['Fetzer', 'Christof', '']]","['secure machine learning', 'confidential computing', 'intel software guard extensions (Intel SGX)', 'tensorflow']"
7116,1905.06417,Ville Vakkuri,"Ville Vakkuri, Kai-Kristian Kemell, Pekka Abrahamsson","Ethically Aligned Design: An empirical evaluation of the
  RESOLVEDD-strategy in Software and Systems development context","This is the author's version of the work. The copyright holder's
  version can be found at https://doi.org/10.1109/SEAA.2019.00015","2019 45th Euromicro Conference on Software Engineering and
  Advanced Applications (SEAA)",10.1109/SEAA.2019.00015,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Use of artificial intelligence (AI) in human contexts calls for ethical
considerations for the design and development of AI-based systems. However,
little knowledge currently exists on how to provide useful and tangible tools
that could help software developers and designers implement ethical
considerations into practice. In this paper, we empirically evaluate a method
that enables ethically aligned design in a decision-making process. Though this
method, titled the RESOLVEDD-strategy, originates from the field of business
ethics, it is being applied in other fields as well. We tested the
RESOLVEDD-strategy in a multiple case study of five student projects where the
use of ethical tools was given as one of the design requirements. A key finding
from the study indicates that simply the presence of an ethical tool has an
effect on ethical consideration, creating more responsibility even in instances
where the use of the tool is not intrinsically motivated.
","[{'version': 'v1', 'created': 'Sat, 4 May 2019 10:33:05 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Jun 2019 15:38:40 GMT'}, {'version': 'v3', 'created': 'Mon, 1 Jul 2019 15:44:38 GMT'}, {'version': 'v4', 'created': 'Wed, 22 Jan 2020 18:50:36 GMT'}]",2020-01-23,"[['Vakkuri', 'Ville', ''], ['Kemell', 'Kai-Kristian', ''], ['Abrahamsson', 'Pekka', '']]","['artificial intelligence', 'ethics', 'design methods', 'ethical tool', 'RESOLVEDD', 'developer commitment']"
7117,2301.00290,MohammadHossein AskariHemmat,"Mohammadhossein Askarihemmat, Sean Wagner, Olexa Bilaniuk, Yassine
  Hariri, Yvon Savaria, Jean-Pierre David",BARVINN: Arbitrary Precision DNN Accelerator Controlled by a RISC-V CPU,"7 pages. Accepted for publication in the 2023, 28th Asia and South
  Pacific Design Automation Conference (ASP-DAC 2023)",,10.1145/3566097.3567872,,cs.AR,http://creativecommons.org/licenses/by/4.0/,"  We present a DNN accelerator that allows inference at arbitrary precision
with dedicated processing elements that are configurable at the bit level. Our
DNN accelerator has 8 Processing Elements controlled by a RISC-V controller
with a combined 8.2 TMACs of computational power when implemented with the
recent Alveo U250 FPGA platform. We develop a code generator tool that ingests
CNN models in ONNX format and generates an executable command stream for the
RISC-V controller. We demonstrate the scalable throughput of our accelerator by
running different DNN kernels and models when different quantization levels are
selected. Compared to other low precision accelerators, our accelerator
provides run time programmability without hardware reconfiguration and can
accelerate DNNs with multiple quantization levels, regardless of the target
FPGA size. BARVINN is an open source project and it is available at
https://github.com/hossein1387/BARVINN.
","[{'version': 'v1', 'created': 'Sat, 31 Dec 2022 21:04:00 GMT'}]",2023-01-03,"[['Askarihemmat', 'Mohammadhossein', ''], ['Wagner', 'Sean', ''], ['Bilaniuk', 'Olexa', ''], ['Hariri', 'Yassine', ''], ['Savaria', 'Yvon', ''], ['David', 'Jean-Pierre', '']]","['neural networks', 'hardware acceleration', 'FPGA', 'low-precision']"
7118,2105.13854,Andriy Temko Dr,"Alison O'Shea, Gordon Lightbody, Geraldine Boylan, Andriy Temko","Neonatal seizure detection from raw multi-channel EEG using a fully
  convolutional architecture",,Neural Networks (2020),10.1016/j.neunet.2019.11.023,,cs.LG cs.AI stat.AP,http://creativecommons.org/licenses/by/4.0/,"  A deep learning classifier for detecting seizures in neonates is proposed.
This architecture is designed to detect seizure events from raw
electroencephalogram (EEG) signals as opposed to the state-of-the-art hand
engineered feature-based representation employed in traditional machine
learning based solutions. The seizure detection system utilises only
convolutional layers in order to process the multichannel time domain signal
and is designed to exploit the large amount of weakly labelled data in the
training stage. The system performance is assessed on a large database of
continuous EEG recordings of 834h in duration; this is further validated on a
held-out publicly available dataset and compared with two baseline SVM based
systems.
  The developed system achieves a 56% relative improvement with respect to a
feature-based state-of-the art baseline, reaching an AUC of 98.5%; this also
compares favourably both in terms of performance and run-time. The effect of
varying architectural parameters is thoroughly studied. The performance
improvement is achieved through novel architecture design which allows more
efficient usage of available training data and end-to-end optimisation from the
front-end feature extraction to the back-end classification. The proposed
architecture opens new avenues for the application of deep learning to neonatal
EEG, where the performance becomes a function of the amount of training data
with less dependency on the availability of precise clinical labels.
","[{'version': 'v1', 'created': 'Fri, 28 May 2021 14:08:36 GMT'}]",2021-05-31,"[[""O'Shea"", 'Alison', ''], ['Lightbody', 'Gordon', ''], ['Boylan', 'Geraldine', ''], ['Temko', 'Andriy', '']]","['convolutional neural networks', 'EEG', 'neonatal seizure detection', 'weak labels']"
7119,2005.04599,Ritam Guha Mr.,"Devroop Kar, Manosij Ghosh, Ritam Guha, Ram Sarkar, Laura
  Garc\'ia-Hern\'andez, Ajith Abraham","Fuzzy Mutation Embedded Hybrids of Gravitational Search and Particle
  Swarm Optimization Methods for Engineering Design Problems","33 pages, 18 figures, submitted to Engineering Applications of
  Artificial Intelligence, Elsevier",,10.1016/j.engappai.2020.103847,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Gravitational Search Algorithm (GSA) and Particle Swarm Optimization (PSO)
are nature-inspired, swarm-based optimization algorithms respectively. Though
they have been widely used for single-objective optimization since their
inception, they suffer from premature convergence. Even though the hybrids of
GSA and PSO perform much better, the problem remains. Hence, to solve this
issue we have proposed a fuzzy mutation model for two hybrid versions of PSO
and GSA - Gravitational Particle Swarm (GPS) and PSOGSA. The developed
algorithms are called Mutation based GPS (MGPS) and Mutation based PSOGSA
(MPSOGSA). The mutation operator is based on a fuzzy model where the
probability of mutation has been calculated based on the closeness of particle
to population centroid and improvement in the particle value. We have evaluated
these two new algorithms on 23 benchmark functions of three categories
(unimodal, multi-modal and multi-modal with fixed dimension). The experimental
outcome shows that our proposed model outperforms their corresponding
ancestors, MGPS outperforms GPS 13 out of 23 times (56.52%) and MPSOGSA
outperforms PSOGSA 17 times out of 23 (73.91 %). We have also compared our
results against those of recent optimization algorithms such as Sine Cosine
Algorithm (SCA), Opposition-Based SCA, and Volleyball Premier League Algorithm
(VPL). In addition, we have applied our proposed algorithms on some classic
engineering design problems and the outcomes are satisfactory. The related
codes of the proposed algorithms can be found in this link:
Fuzzy-Mutation-Embedded-Hybrids-of-GSA-and-PSO.
","[{'version': 'v1', 'created': 'Sun, 10 May 2020 07:42:36 GMT'}]",2020-09-01,"[['Kar', 'Devroop', ''], ['Ghosh', 'Manosij', ''], ['Guha', 'Ritam', ''], ['Sarkar', 'Ram', ''], ['García-Hernández', 'Laura', ''], ['Abraham', 'Ajith', '']]","['Fuzzy logic', 'mutation', 'Gravitational Search Algorithm', 'Particle Swarm Optimization', 'hybrid', 'Engineering design']"
7120,2206.13103,Ali Rajaei Harandi,"Shahed Rezaei, Ali Harandi, Ahmad Moeineddin, Bai-Xiang Xu, Stefanie
  Reese","A mixed formulation for physics-informed neural networks as a potential
  solver for engineering problems in heterogeneous domains: comparison with
  finite element method",,,10.1016/j.cma.2022.115616,,cs.CE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Physics-informed neural networks (PINNs) are capable of finding the solution
for a given boundary value problem. We employ several ideas from the finite
element method (FEM) to enhance the performance of existing PINNs in
engineering problems. The main contribution of the current work is to promote
using the spatial gradient of the primary variable as an output from separated
neural networks. Later on, the strong form which has a higher order of
derivatives is applied to the spatial gradients of the primary variable as the
physical constraint. In addition, the so-called energy form of the problem is
applied to the primary variable as an additional constraint for training. The
proposed approach only required up to first-order derivatives to construct the
physical loss functions. We discuss why this point is beneficial through
various comparisons between different models. The mixed formulation-based PINNs
and FE methods share some similarities. While the former minimizes the PDE and
its energy form at given collocation points utilizing a complex nonlinear
interpolation through a neural network, the latter does the same at element
nodes with the help of shape functions. We focus on heterogeneous solids to
show the capability of deep learning for predicting the solution in a complex
environment under different boundary conditions. The performance of the
proposed PINN model is checked against the solution from FEM on two prototype
problems: elasticity and the Poisson equation (steady-state diffusion problem).
We concluded that by properly designing the network architecture in PINN, the
deep learning model has the potential to solve the unknowns in a heterogeneous
domain without any available initial data from other sources. Finally,
discussions are provided on the combination of PINN and FEM for a fast and
accurate design of composite materials in future developments.
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2022 08:18:08 GMT'}]",2022-10-05,"[['Rezaei', 'Shahed', ''], ['Harandi', 'Ali', ''], ['Moeineddin', 'Ahmad', ''], ['Xu', 'Bai-Xiang', ''], ['Reese', 'Stefanie', '']]","['Physical informed neural networks', 'Unsupervised learning', 'heterogeneous solids']"
7121,1402.0412,Thomas Steiner,Thomas Steiner,"Bots vs. Wikipedians, Anons vs. Logged-Ins","Poster at the Web Science Track of the 23rd International World Wide
  Web Conference (WWW2014), Seoul, Korea",,10.1145/2567948.2576948,,cs.DL cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wikipedia is a global crowdsourced encyclopedia that at time of writing is
available in 287 languages. Wikidata is a likewise global crowdsourced
knowledge base that provides shared facts to be used by Wikipedias. In the
context of this research, we have developed an application and an underlying
Application Programming Interface (API) capable of monitoring realtime edit
activity of all language versions of Wikipedia and Wikidata. This application
allows us to easily analyze edits in order to answer questions such as ""Bots
vs. Wikipedians, who edits more?"", ""Which is the most anonymously edited
Wikipedia?"", or ""Who are the bots and what do they edit?"". To the best of our
knowledge, this is the first time such an analysis could be done in realtime
for Wikidata and for really all Wikipedias--large and small. Our application is
available publicly online at the URL http://wikipedia-edits.herokuapp.com/, its
code has been open-sourced under the Apache 2.0 license.
","[{'version': 'v1', 'created': 'Mon, 3 Feb 2014 16:08:25 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Feb 2014 08:42:32 GMT'}]",2014-02-06,"[['Steiner', 'Thomas', '']]","['Wikipedia', 'Wikidata', 'realtime monitoring', 'study', 'Web app']"
7122,1905.12267,Reza Vosooghi,"Reza Vosooghi (LGI, IRT SystemX), Joseph Kamel (IRT SystemX), Jakob
  Puchinger (LGI, IRT SystemX), Vincent Leblond (IRT SystemX), Marija Jankovic
  (LGI)","Robo-Taxi service fleet sizing: assessing the impact of user trust and
  willingness-to-use","Transportation, Springer Verlag, 2019",,10.1007/s11116-019-10013-x,,cs.MA cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The first commercial fleets of Robo-Taxis will be on the road soon. Today
important efforts are made to anticipate future Robo-Taxi services. Fleet size
is one of the key parameters considered in the planning phase of service design
and configuration. Based on multi-agent approaches, the fleet size can be
explored using dynamic demand response simulations. Time and cost are the most
common variables considered in such simulation approaches. However, personal
taste variation can affect the demand and consequently the required fleet size.
In this paper, we explore the impact of user trust and willingness-to-use on
the Robo-Taxi fleet size. This research is based upon simulating the
transportation system of the Rouen-Normandie metropolitan area in France using
MATSim, a multi-agent activity-based simulator. A local survey is made in order
to explore the variation of user trust and their willingness-to-use future
Robo-Taxis according to the sociodemographic attributes. Integrating survey
data in the model shows the significant importance of traveler trust and
willingness-to-use varying the Robo-Taxi use and the required fleet size.
","[{'version': 'v1', 'created': 'Wed, 29 May 2019 08:22:05 GMT'}]",2019-05-30,"[['Vosooghi', 'Reza', '', 'LGI, IRT SystemX'], ['Kamel', 'Joseph', '', 'IRT SystemX'], ['Puchinger', 'Jakob', '', 'LGI, IRT SystemX'], ['Leblond', 'Vincent', '', 'IRT SystemX'], ['Jankovic', 'Marija', '', 'LGI']]","['Multi-agent simulation', 'Shared autonomous vehicle', 'Robo-Taxi', 'Willingness-to-use', 'User']"
7123,2202.11760,Yelena Mejova,"Yelena Mejova, Tatiana Gracyk, Ronald E. Robertson","Googling for Abortion: Search Engine Mediation of Abortion Accessibility
  in the United States",,"Journal of Quantitative Description: Digital Media, 2, 2022",10.51685/jqd.2022.007,,cs.CY cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Among the myriad barriers to abortion access, crisis pregnancy centers (CPCs)
pose an additional difficulty by targeting women with unexpected or ""crisis""
pregnancies in order to dissuade them from the procedure. Web search engines
may prove to be another barrier, being in a powerful position to direct their
users to health information, and above all, health services. In this study we
ask, to what degree does Google Search provide quality responses to users
searching for an abortion provider, specifically in terms of directing them to
abortion clinics (ACs) or CPCs. To answer this question, we considered the
scenario of a woman searching for abortion services online, and conducted 10
abortion-related queries from 467 locations across the United States once a
week for 14 weeks. Overall, among Google's location results that feature
businesses alongside a map, 79.4% were ACs, and 6.9% were CPCs. When an AC was
returned, it was the closest known AC location 86.9% of the time. However, when
a CPC appeared in a result set, it was the closest one to the search location
75.9% of the time. Examining correlates of AC results, we found that fewer AC
results were returned for searches from poorer and rural areas, and those with
TRAP laws governing AC facility and clinician requirements. We also observed
that Google's performance on our queries significantly improved following a
major algorithm update. These results have important implications concerning
health access quality and equity, both for individual users and public health
policy.
","[{'version': 'v1', 'created': 'Wed, 23 Feb 2022 19:59:30 GMT'}]",2022-02-25,"[['Mejova', 'Yelena', ''], ['Gracyk', 'Tatiana', ''], ['Robertson', 'Ronald E.', '']]","['abortion', 'search engines', 'medical access', 'Google']"
7124,2208.07701,Pino Caballero-Gil,"Alexandra Rivero-Garc\'ia, Iv\'an Santos-Gonz\'alez, Candelaria
  Hern\'andez-Goya, Pino Caballero-Gil","Using blockchain in the follow-up of emergency situations related to
  events",,Software: Practice and Experience 51(10) pp. 2000-2014. 2021,10.1002/spe.2779,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper describes a decentralized low-cost system designed to reinforce
personal security in big events in case of emergency. The proposal consists of
using smart contracts supported by blockchain in the management of events. An
alternative communication channel that does not require any cloud service is
also provided with the aim of improving the coordination of emergency services.
Peers may use this emergency support tool to interact with each other through a
chat when additional support is required. Since information security is
mandatory in this scenario, Identity-Based Signcryption schemes are here used
in order to guarantee communication confidentiality, authenticity and
integrity. Depending on the communication mode (peer-to-peer or broadcast),
different signcryption methods are used. A first implementation of the proposal
has produced promising results.
","[{'version': 'v1', 'created': 'Mon, 15 Aug 2022 15:44:39 GMT'}]",2022-08-17,"[['Rivero-García', 'Alexandra', ''], ['Santos-González', 'Iván', ''], ['Hernández-Goya', 'Candelaria', ''], ['Caballero-Gil', 'Pino', '']]","['Identity-Based Signcryption', 'blockchain', 'smart contract', 'emergencies', 'Android']"
7125,2211.08370,Dami\'an Quijano,Dami\'an Quijano and Richard Gil-Herrera,"Methodological proposal to identify the nationality of Twitter users
  through Random-Forests","31 pages, 10 figures, 4 tables",Plos One (2023),10.1371/journal.pone.0277858,PONE-D-22-30387R1,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  We disclose a methodology to determine the participants in discussions and
their contributions in social networks with a local relationship (e.g.,
nationality), providing certain levels of trust and efficiency in the process.
The dynamic is a challenge that has demanded studies and some approximations to
recent solutions. The study addressed the problem of identifying the
nationality of users in the Twitter social network before an opinion request
(of a political nature and social participation). The employed methodology
classifies, via machine learning, the Twitter users' nationality to carry out
opinion studies in three Central American countries. The Random Forests
algorithm is used to generate classification models with small training
samples, using exclusively numerical characteristics based on the number of
times that different interactions among users occur. When averaging the
proportions achieved by inferences of the ratio of nationals of each country,
in the initial data, an average of 77.40% was calculated, compared to 91.60%
averaged after applying the automatic classification model, an average increase
of 14.20%. In conclusion, it can be seen that the suggested set of method
provides a reasonable approach and efficiency in the face of opinion problems.
","[{'version': 'v1', 'created': 'Tue, 15 Nov 2022 18:20:06 GMT'}]",2023-01-20,"[['Quijano', 'Damián', ''], ['Gil-Herrera', 'Richard', '']]","['Data Analysis', 'Random Forests', 'Social Networks', 'Twitter']"
7126,1908.06211,Soham Sinha,Soham Sinha and Richard West and Ahmad Golchin,PAStime: Progress-aware Scheduling for Time-critical Computing,24 pages,,10.4230/LIPIcs.ECRTS.2020.3,,cs.OS,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Over-estimation of worst-case execution times (WCETs) of real-time tasks
leads to poor resource utilization. In a mixed-criticality system (MCS), the
over-provisioning of CPU time to accommodate the WCETs of highly critical tasks
may lead to degraded service for less critical tasks. In this paper, we present
PAStime, a novel approach to monitor and adapt the runtime progress of highly
time-critical applications, to allow for improved service to lower criticality
tasks. In PAStime, CPU time is allocated to time-critical tasks according to
the delays they experience as they progress through their control flow graphs.
This ensures that as much time as possible is made available to improve the
Quality-of-Service of less critical tasks, while high-criticality tasks are
compensated after their delays.
  In this paper, we integrate PAStime with Adaptive Mixed-criticality (AMC)
scheduling. The LO-mode budget of a high-criticality task is adjusted according
to the delay observed at execution checkpoints. This is the first
implementation of AMC in the scheduling framework Using LITMUS-RT, which is
extended with our PAStime runtime policy and tested with real-time Linux
applications such as object classification and detection. We observe in our
experimental evaluation that AMC-PAStime significantly improves the utilization
of the low-criticality tasks while guaranteeing service to high-criticality
tasks.
","[{'version': 'v1', 'created': 'Sat, 17 Aug 2019 00:24:07 GMT'}, {'version': 'v2', 'created': 'Mon, 31 May 2021 15:53:06 GMT'}]",2021-06-01,"[['Sinha', 'Soham', ''], ['West', 'Richard', ''], ['Golchin', 'Ahmad', '']]","['progress-aware scheduling', 'code instrumentation', 'timing annotation']"
7127,1601.06705,Nikita Polyanskii,"A. G. D'yachkov, I.V. Vorobyev, N.A. Polyanskii and V.Yu. Shchukin",On Multistage Learning a Hidden Hypergraph,"5 pages, IEEE conference",,10.1109/ISIT.2016.7541485,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning a hidden hypergraph is a natural generalization of the classical
group testing problem that consists in detecting unknown hypergraph
$H_{un}=H(V,E)$ by carrying out edge-detecting tests. In the given paper we
focus our attention only on a specific family $F(t,s,\ell)$ of localized
hypergraphs for which the total number of vertices $|V| = t$, the number of
edges $|E|\le s$, $s\ll t$, and the cardinality of any edge $|e|\le\ell$,
$\ell\ll t$. Our goal is to identify all edges of $H_{un}\in F(t,s,\ell)$ by
using the minimal number of tests. We develop an adaptive algorithm that
matches the information theory bound, i.e., the total number of tests of the
algorithm in the worst case is at most $s\ell\log_2 t(1+o(1))$. We also discuss
a probabilistic generalization of the problem.
","[{'version': 'v1', 'created': 'Mon, 25 Jan 2016 18:23:08 GMT'}, {'version': 'v2', 'created': 'Sun, 14 Feb 2016 20:54:09 GMT'}, {'version': 'v3', 'created': 'Tue, 17 May 2016 21:01:27 GMT'}]",2016-11-18,"[[""D'yachkov"", 'A. G.', ''], ['Vorobyev', 'I. V.', ''], ['Polyanskii', 'N. A.', ''], ['Shchukin', 'V. Yu.', '']]","['Group testing problem', 'learning hidden hypergraph', 'capacity', 'asymptotic rate', 'cover-free code']"
7128,2111.06371,Lorenzo Testa,"Christian Esposito and Marco Gortan and Lorenzo Testa and Francesca
  Chiaromonte and Giorgio Fagiolo and Andrea Mina and Giulio Rossetti","Can you always reap what you sow? Network and functional data analysis
  of VC investments in health-tech companies","12 pages, 4 figures, accepted for publication in the proceedings of
  the 10th International Conference on Complex Networks and Their Applications","Proceedings of 10th International Conference of Complex Networks
  and their applications 2021",10.1007/978-3-030-93409-5_61,,cs.SI econ.GN q-fin.EC stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  ""Success"" of firms in venture capital markets is hard to define, and its
determinants are still poorly understood. We build a bipartite network of
investors and firms in the healthcare sector, describing its structure and its
communities. Then, we characterize ""success"" introducing progressively more
refined definitions, and we find a positive association between such
definitions and the centrality of a company. In particular, we are able to
cluster funding trajectories of firms into two groups capturing different
""success"" regimes and to link the probability of belonging to one or the other
to their network features (in particular their centrality and the one of their
investors). We further investigate this positive association by introducing
scalar as well as functional ""success"" outcomes, confirming our findings and
their robustness.
","[{'version': 'v1', 'created': 'Wed, 10 Nov 2021 00:16:40 GMT'}]",2022-01-04,"[['Esposito', 'Christian', ''], ['Gortan', 'Marco', ''], ['Testa', 'Lorenzo', ''], ['Chiaromonte', 'Francesca', ''], ['Fagiolo', 'Giorgio', ''], ['Mina', 'Andrea', ''], ['Rossetti', 'Giulio', '']]","['network analysis', 'functional data analysis', 'success analysis', 'venture capital investments']"
7129,2108.08886,Vasil Kolev,"Lachezar Filchev, Lyubka Pashova, Vasil Kolev, Stuart Frye","Challenges and Solutions for Utilizing Earth Observations in the ""Big
  Data"" era","6 pages, BigSkyEarth conference: AstroGeoInformatics, Tenerife,
  Spain, December 17-19, 2018",,10.5281/zenodo.2391937,,cs.CY cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ever-growing need of data preservation and their systematic analysis
contributing to sustainable development of the society spurred in the past
decade,numerous Big Data projects and initiatives are focusing on the Earth
Observation (EO). The number of Big Data EO applications has grown extremely
worldwide almost simultaneously with other scientific and technological areas
of the human knowledge due to the revolutionary technological progress in the
space and information technology sciences. The substantial contribution to this
development are the space programs of the renowned space agencies, such as
NASA, ESA,Roskosmos, JAXA, DLR, INPE, ISRO, CNES etc. A snap-shot of the
current Big Data sets from available satellite missions covering the Bulgarian
territory is also presented. This short overview of the geoscience Big Data
collection with a focus on EO will emphasize to the multiple Vs of EO in order
to provide a snapshot on the current state-of-the-art in EO data preservation
and manipulation. Main modern approaches for compressing, clustering and
modelling EO in the geoinformation science for Big Data analysis,
interpretation and visualization for a variety of applications are outlined.
Special attention is paid to the contemporary EO data modelling and
visualization systems.
","[{'version': 'v1', 'created': 'Thu, 19 Aug 2021 19:24:32 GMT'}]",2021-08-23,"[['Filchev', 'Lachezar', ''], ['Pashova', 'Lyubka', ''], ['Kolev', 'Vasil', ''], ['Frye', 'Stuart', '']]","['Geo-sensor networks', 'Earth Observations', 'Big Data', 'Data bases', 'EO Analytics']"
7130,2203.07473,Gunnar Kudrjavets,"Gunnar Kudrjavets (University of Groningen), Nachiappan Nagappan
  (Microsoft Research), Ayushi Rastogi (University of Groningen)",The Unexplored Treasure Trove of Phabricator Code Review,"5 pages. To be published in Proceedings of MSR '22: Proceedings of
  the 19th International Conference on Mining Software Repositories (MSR 2022).
  ACM, New York, NY, USA",,10.1145/3524842.3528005,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Phabricator is a modern code collaboration tool used by popular projects like
FreeBSD and Mozilla. However, unlike the other well-known code review
environments, such as Gerrit or GitHub, there is no readily accessible public
code review dataset for Phabricator. This paper describes our experience mining
code reviews from five different projects that use Phabricator (Blender,
FreeBSD, KDE, LLVM, and Mozilla). We discuss the challenges associated with the
data retrieval process and our solutions, resulting in a dataset with details
regarding 317,476 Phabricator code reviews. Our dataset is available in both
JSON and MySQL database dump formats. The dataset enables analyses of the
history of code reviews at a more granular level than other platforms. In
addition, given that the projects we mined are publicly accessible via the
Conduit API, our dataset can be used as a foundation to fetch additional
details and insights.
","[{'version': 'v1', 'created': 'Mon, 14 Mar 2022 20:14:49 GMT'}]",2022-12-01,"[['Kudrjavets', 'Gunnar', '', 'University of Groningen'], ['Nagappan', 'Nachiappan', '', 'Microsoft Research'], ['Rastogi', 'Ayushi', '', 'University of Groningen']]","['Code review', 'dataset', 'mining', 'Phabricator']"
7131,1801.09445,Benjamin Unger,Philipp Schulze and Benjamin Unger,Model reduction for linear systems with low-rank switching,,"SIAM Journal on Control and Optimization 2018 56:6, 4365-4384",10.1137/18M1167887,,cs.SY math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a novel model order reduction method for large-scale linear
switched systems (LSS) where the coefficient matrices are affected by a
low-rank switching. The key idea is to replace the LSS by a non-switched system
with extended input and output vectors - called the envelope system - which is
able to reproduce the dynamical behavior of the original LSS by applying a
certain feedback law. The envelope system can be reduced using standard model
order reduction schemes and then transformed back to an LSS. Furthermore, we
present an upper bound for the output error of the reduced-order LSS and show
how to preserve quadratic Lyapunov stability. The approach is tested by means
of various numerical examples demonstrating the efficacy of the presented
method.
","[{'version': 'v1', 'created': 'Mon, 29 Jan 2018 11:06:13 GMT'}]",2018-12-21,"[['Schulze', 'Philipp', ''], ['Unger', 'Benjamin', '']]","['switched system', 'model reduction', 'balanced truncation', 'rational interpolation', 'stability', 'port-Hamiltonian System']"
7132,2204.06033,Lorenz Graf-Vlachy,"Lorenz Graf-Vlachy, Daniel Graziotin, Stefan Wagner","Text and Team: What Article Metadata Characteristics Drive Citations in
  Software Engineering?","The International Conference on Evaluation and Assessment in Software
  Engineering 2022",,10.1145/3530019.3530022,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Citations are a key measure of scientific performance in most
fields, including software engineering. However, there is limited research that
studies which characteristics of articles' metadata (title, abstract, keywords,
and author list) are driving citations in this field. Objective: In this study,
we propose a simple theoretical model for how citations come to be with respect
to article metadata, we hypothesize theoretical linkages between metadata
characteristics and citations of articles, and we empirically test these
hypotheses. Method: We use multiple regression analyses to examine a data set
comprising the titles, abstracts, keywords, and authors of 16,131 software
engineering articles published between 1990 and 2020 in 20 highly influential
software engineering venues. Results: We find that number of authors, number of
keywords, number of question marks and dividers in the title, number of
acronyms, abstract length, abstract propositional idea density, and
corresponding authors in the core Anglosphere are significantly related to
citations. Conclusion: Various characteristics of articles' metadata are linked
to the frequency with which the corresponding articles are cited. These results
partially confirm and partially go counter to prior findings in software
engineering and other disciplines.
","[{'version': 'v1', 'created': 'Tue, 12 Apr 2022 18:39:11 GMT'}]",2022-04-14,"[['Graf-Vlachy', 'Lorenz', ''], ['Graziotin', 'Daniel', ''], ['Wagner', 'Stefan', '']]","['citations', 'metadata', 'abstract', 'title', 'keyword', 'author']"
7133,2106.10192,Muhammad Najib,"Julian Gutierrez, Muhammad Najib, Giuseppe Perelli, Michael Wooldridge",Equilibrium Design for Concurrent Games,CONCUR 2019 with appendix,"Vol. 140, 2019, 22:1--22:16",10.4230/LIPIcs.CONCUR.2019.22,,cs.GT cs.AI cs.LO cs.MA,http://creativecommons.org/licenses/by/4.0/,"  In game theory, mechanism design is concerned with the design of incentives
so that a desired outcome of the game can be achieved. In this paper, we study
the design of incentives so that a desirable equilibrium is obtained, for
instance, an equilibrium satisfying a given temporal logic property -- a
problem that we call equilibrium design. We base our study on a framework where
system specifications are represented as temporal logic formulae, games as
quantitative concurrent game structures, and players' goals as mean-payoff
objectives. In particular, we consider system specifications given by LTL and
GR(1) formulae, and show that implementing a mechanism to ensure that a given
temporal logic property is satisfied on some/every Nash equilibrium of the
game, whenever such a mechanism exists, can be done in PSPACE for LTL
properties and in NP/$\Sigma^{P}_{2}$ for GR(1) specifications. We also study
the complexity of various related decision and optimisation problems, such as
optimality and uniqueness of solutions, and show that the complexities of all
such problems lie within the polynomial hierarchy. As an application,
equilibrium design can be used as an alternative solution to the rational
synthesis and verification problems for concurrent games with mean-payoff
objectives whenever no solution exists, or as a technique to repair, whenever
possible, concurrent games with undesirable rational outcomes (Nash equilibria)
in an optimal way.
","[{'version': 'v1', 'created': 'Fri, 18 Jun 2021 15:45:45 GMT'}]",2021-06-21,"[['Gutierrez', 'Julian', ''], ['Najib', 'Muhammad', ''], ['Perelli', 'Giuseppe', ''], ['Wooldridge', 'Michael', '']]","['Games', 'Temporal logic', 'Synthesis', 'Model checking', 'Nash equilibrium']"
7134,1811.07901,Vivian Lai,"Vivian Lai, Chenhao Tan","On Human Predictions with Explanations and Predictions of Machine
  Learning Models: A Case Study on Deception Detection","17 pages, 19 figures, in Proceedings of ACM FAT* 2019, dataset & demo
  available at https://deception.machineintheloop.com",,10.1145/3287560.3287590,,cs.AI cs.CL cs.CY physics.soc-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Humans are the final decision makers in critical tasks that involve ethical
and legal concerns, ranging from recidivism prediction, to medical diagnosis,
to fighting against fake news. Although machine learning models can sometimes
achieve impressive performance in these tasks, these tasks are not amenable to
full automation. To realize the potential of machine learning for improving
human decisions, it is important to understand how assistance from machine
learning models affects human performance and human agency.
  In this paper, we use deception detection as a testbed and investigate how we
can harness explanations and predictions of machine learning models to improve
human performance while retaining human agency. We propose a spectrum between
full human agency and full automation, and develop varying levels of machine
assistance along the spectrum that gradually increase the influence of machine
predictions. We find that without showing predicted labels, explanations alone
slightly improve human performance in the end task. In comparison, human
performance is greatly improved by showing predicted labels (>20% relative
improvement) and can be further improved by explicitly suggesting strong
machine performance. Interestingly, when predicted labels are shown,
explanations of machine predictions induce a similar level of accuracy as an
explicit statement of strong machine performance. Our results demonstrate a
tradeoff between human performance and human agency and show that explanations
of machine predictions can moderate this tradeoff.
","[{'version': 'v1', 'created': 'Mon, 19 Nov 2018 19:00:01 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Nov 2018 20:47:12 GMT'}, {'version': 'v3', 'created': 'Wed, 28 Nov 2018 03:52:47 GMT'}, {'version': 'v4', 'created': 'Tue, 8 Jan 2019 21:15:07 GMT'}]",2019-01-10,"[['Lai', 'Vivian', ''], ['Tan', 'Chenhao', '']]","['human agency', 'human performance', 'explanations', 'predictions']"
7135,2204.09218,Charl Maree,Charl Maree and Christian W. Omlin,"Reinforcement Learning with Intrinsic Affinity for Personalized
  Prosperity Management",,Digit Finance 2022,10.1007/s42521-022-00068-4,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  The common purpose of applying reinforcement learning (RL) to asset
management is the maximization of profit. The extrinsic reward function used to
learn an optimal strategy typically does not take into account any other
preferences or constraints. We have developed a regularization method that
ensures that strategies have global intrinsic affinities, i.e., different
personalities may have preferences for certain assets which may change over
time. We capitalize on these intrinsic policy affinities to make our RL model
inherently interpretable. We demonstrate how RL agents can be trained to
orchestrate such individual policies for particular personality profiles and
still achieve high returns.
","[{'version': 'v1', 'created': 'Wed, 20 Apr 2022 04:33:32 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Jul 2022 08:41:45 GMT'}]",2022-09-16,"[['Maree', 'Charl', ''], ['Omlin', 'Christian W.', '']]","['AI in banking', 'personalized financial services', 'explainable AI', 'reinforcement learning', 'policyregularization', 'intrinsic affinity']"
7136,1911.04625,Mark A. Matienzo,"Emily Goodmann, Mark A. Matienzo, Shawn VanCour, William Vanden Dries","Building the National Radio Recordings Database: A Big Data Approach to
  Documenting Audio Heritage","7 pages; accepted by 4th Computational Archival Science (CAS)
  workshop, IEEE Big Data 2019","2019 IEEE International Conference on Big Data (Big Data), Los
  Angeles, CA, USA, 2019, pp. 3080-3086",10.1109/BigData47090.2019.9006520,,cs.DL cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper traces strategies used by the Radio Preservation Task Force of the
Library of Congress's National Recording Preservation Board to develop a
publicly searchable database documenting extant radio materials held by
collecting institutions throughout the country. Having aggregated metadata on
2,500 unique collections to date, the project has encountered a series of
logistical challenges that are not only technical in nature but also
institutional and social, raising critical issues involving organizational
structure, political representation, and the ethics of data access. As the
project continues to expand and evolve, lessons from its early development
offer valuable reminders of the human judgment, hidden labor, and interpersonal
relations required for successful big data work.
","[{'version': 'v1', 'created': 'Tue, 12 Nov 2019 00:59:54 GMT'}]",2020-03-04,"[['Goodmann', 'Emily', ''], ['Matienzo', 'Mark A.', ''], ['VanCour', 'Shawn', ''], ['Dries', 'William Vanden', '']]","['radio preservation', 'big data', 'Radio Preservation Task Force', 'archival representation', 'ethics of access', 'dynamic design']"
7137,2204.01956,Soumik Mohian,"Soumik Mohian, Christoph Csallner",PSDoodle: Fast App Screen Search via Partial Screen Doodle,,,10.1145/3524613.3527816,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Searching through existing repositories for a specific mobile app screen
design is currently either slow or tedious. Such searches are either limited to
basic keyword searches (Google Image Search) or require as input a complete
query screen image (SWIRE). A promising alternative is interactive partial
sketching, which is more structured than keyword search and faster than
complete-screen queries. PSDoodle is the first system to allow interactive
search of screens via interactive sketching. PSDoodle is built on top of a
combination of the Rico repository of some 58k Android app screens, the Google
QuickDraw dataset of icon-level doodles, and DoodleUINet, a curated corpus of
some 10k app icon doodles collected from hundreds of individuals. In our
evaluation with third-party software developers, PSDoodle provided similar
top-10 screen retrieval accuracy as the state of the art from the SWIRE line of
work, while cutting the average time required about in half.
","[{'version': 'v1', 'created': 'Tue, 5 Apr 2022 03:22:09 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Apr 2022 18:36:55 GMT'}]",2022-04-08,"[['Mohian', 'Soumik', ''], ['Csallner', 'Christoph', '']]","['Sketch-based image retrieval', 'SBIR', 'user interface design', 'sketching', 'GUI', 'design examples', 'deep learning']"
7138,2004.12108,Mahawaga Arachchige Pathum Chamikara,"M.A.P. Chamikara, P.Bertok, I.Khalil, D.Liu, S.Camtepe",Privacy Preserving Distributed Machine Learning with Federated Learning,,,10.1016/j.comcom.2021.02.014,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Edge computing and distributed machine learning have advanced to a level that
can revolutionize a particular organization. Distributed devices such as the
Internet of Things (IoT) often produce a large amount of data, eventually
resulting in big data that can be vital in uncovering hidden patterns, and
other insights in numerous fields such as healthcare, banking, and policing.
Data related to areas such as healthcare and banking can contain potentially
sensitive data that can become public if they are not appropriately sanitized.
Federated learning (FedML) is a recently developed distributed machine learning
(DML) approach that tries to preserve privacy by bringing the learning of an ML
model to data owners'. However, literature shows different attack methods such
as membership inference that exploit the vulnerabilities of ML models as well
as the coordinating servers to retrieve private data. Hence, FedML needs
additional measures to guarantee data privacy. Furthermore, big data often
requires more resources than available in a standard computer. This paper
addresses these issues by proposing a distributed perturbation algorithm named
as DISTPAB, for privacy preservation of horizontally partitioned data. DISTPAB
alleviates computational bottlenecks by distributing the task of privacy
preservation utilizing the asymmetry of resources of a distributed environment,
which can have resource-constrained devices as well as high-performance
computers. Experiments show that DISTPAB provides high accuracy, high
efficiency, high scalability, and high attack resistance. Further experiments
on privacy-preserving FedML show that DISTPAB is an excellent solution to stop
privacy leaks in DML while preserving high data utility.
","[{'version': 'v1', 'created': 'Sat, 25 Apr 2020 10:51:36 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Feb 2021 02:48:00 GMT'}]",2021-03-01,"[['Chamikara', 'M. A. P.', ''], ['Bertok', 'P.', ''], ['Khalil', 'I.', ''], ['Liu', 'D.', ''], ['Camtepe', 'S.', '']]","['data privacy', 'distributed data privacy', 'privacy preserving machine learning', 'distributed']"
7139,1710.07363,Michele Alberti,"Michele Alberti, Mathias Seuret, Vinaychandran Pondenkandath, Rolf
  Ingold, Marcus Liwicki","Historical Document Image Segmentation with LDA-Initialized Deep Neural
  Networks",5 pages,ICDAR-HIP 2017,10.1145/3151509.3151519,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a novel approach to perform deep neural networks
layer-wise weight initialization using Linear Discriminant Analysis (LDA).
Typically, the weights of a deep neural network are initialized with: random
values, greedy layer-wise pre-training (usually as Deep Belief Network or as
auto-encoder) or by re-using the layers from another network (transfer
learning). Hence, many training epochs are needed before meaningful weights are
learned, or a rather similar dataset is required for seeding a fine-tuning of
transfer learning. In this paper, we describe how to turn an LDA into either a
neural layer or a classification layer. We analyze the initialization technique
on historical documents. First, we show that an LDA-based initialization is
quick and leads to a very stable initialization. Furthermore, for the task of
layout analysis at pixel level, we investigate the effectiveness of LDA-based
initialization and show that it outperforms state-of-the-art random weight
initialization methods.
","[{'version': 'v1', 'created': 'Thu, 19 Oct 2017 22:43:47 GMT'}]",2017-11-27,"[['Alberti', 'Michele', ''], ['Seuret', 'Mathias', ''], ['Pondenkandath', 'Vinaychandran', ''], ['Ingold', 'Rolf', ''], ['Liwicki', 'Marcus', '']]","['Linear Discriminant Analysis', 'Neural Network', 'Deep Learning', 'Initialization']"
7140,2112.01050,Adi Mesika,"Adi Mesika, Yizhak Ben-Shabat and Ayellet Tal",CloudWalker: Random walks for 3D point cloud shape analysis,,"Computers & Graphics Volume 106, August 2022, Pages 110-118",10.1016/j.cag.2022.06.001,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Point clouds are gaining prominence as a method for representing 3D shapes,
but their irregular structure poses a challenge for deep learning methods. In
this paper we propose CloudWalker, a novel method for learning 3D shapes using
random walks. Previous works attempt to adapt Convolutional Neural Networks
(CNNs) or impose a grid or mesh structure to 3D point clouds. This work
presents a different approach for representing and learning the shape from a
given point set. The key idea is to impose structure on the point set by
multiple random walks through the cloud for exploring different regions of the
3D object. Then we learn a per-point and per-walk representation and aggregate
multiple walk predictions at inference. Our approach achieves state-of-the-art
results for two 3D shape analysis tasks: classification and retrieval.
","[{'version': 'v1', 'created': 'Thu, 2 Dec 2021 08:24:01 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Dec 2021 13:41:21 GMT'}, {'version': 'v3', 'created': 'Fri, 8 Jul 2022 07:36:24 GMT'}]",2022-07-11,"[['Mesika', 'Adi', ''], ['Ben-Shabat', 'Yizhak', ''], ['Tal', 'Ayellet', '']]","['point cloud', 'neural networks', '3d shape classification', '3d shape retrieval']"
7141,1909.00280,Yunior Ram\'irez-Cruz,"Xihui Chen, Sjouke Mauw, Yunior Ram\'irez-Cruz","Publishing Community-Preserving Attributed Social Graphs with a
  Differential Privacy Guarantee",,"Proceedings on Privacy Enhancing Technologies 2020(4):131-152,
  2020",10.2478/popets-2020-0066,,cs.SI cs.CR physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a novel method for publishing differentially private synthetic
attributed graphs. Unlike preceding approaches, our method is able to preserve
the community structure of the original graph without sacrificing the ability
to capture global structural properties. Our proposal relies on C-AGM, a new
community-preserving generative model for attributed graphs. We equip C-AGM
with efficient methods for attributed graph sampling and parameter estimation.
For the latter, we introduce differentially private computation methods, which
allow us to release community-preserving synthetic attributed social graphs
with a strong formal privacy guarantee. Through comprehensive experiments, we
show that our new model outperforms its most relevant counterparts in
synthesising differentially private attributed social graphs that preserve the
community structure of the original graph, as well as degree sequences and
clustering coefficients.
","[{'version': 'v1', 'created': 'Sat, 31 Aug 2019 20:16:51 GMT'}]",2020-09-15,"[['Chen', 'Xihui', ''], ['Mauw', 'Sjouke', ''], ['Ramírez-Cruz', 'Yunior', '']]","['attributed social graphs', 'generative models', 'differential privacy', 'communitydetection']"
7142,1802.03074,An Yan,"An Yan, Nicholas Weber",Mining Open Government Data Used in Scientific Research,Accepted to iConference 2018,"Transforming Digital Worlds. iConference 2018. Lecture Notes in
  Computer Science, vol 10766. Springer, Cham",10.1007/978-3-319-78105-1_34,,cs.CY cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the following paper, we describe results from mining citations, mentions,
and links to open government data (OGD) in peer-reviewed literature. We
inductively develop a method for categorizing how OGD are used by different
research communities, and provide descriptive statistics about the publication
years, publication outlets, and OGD sources. Our results demonstrate that, 1.
The use of OGD in research is steadily increasing from 2009 to 2016; 2.
Researchers use OGD from 96 different open government data portals, with
data.gov.uk and data.gov being the most frequent sources; and, 3.Contrary to
previous findings, we provide evidence suggesting that OGD from developing
nations, notably India and Kenya, are being frequently used to fuel scientific
discoveries. The findings of this paper contribute to ongoing research agendas
aimed at tracking the impact of open government data initiatives, and provides
an initial description of how open government data are valuable to diverse
scientific research communities.
","[{'version': 'v1', 'created': 'Thu, 8 Feb 2018 23:18:44 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Mar 2018 06:44:10 GMT'}, {'version': 'v3', 'created': 'Sat, 24 Mar 2018 10:04:59 GMT'}]",2018-03-28,"[['Yan', 'An', ''], ['Weber', 'Nicholas', '']]","['Open Data', 'Literature Mining', 'Research Policy', 'E-Government']"
7143,2201.08610,Balazs Varga,"Balazs Varga, Balazs Kulcsar, Morteza Haghir Chehreghani",Deep Q-learning: a robust control approach,,Int J Robust Nonlinear Control. 2022; 1- 19,10.1002/rnc.6457,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we place deep Q-learning into a control-oriented perspective
and study its learning dynamics with well-established techniques from robust
control. We formulate an uncertain linear time-invariant model by means of the
neural tangent kernel to describe learning. We show the instability of learning
and analyze the agent's behavior in frequency-domain. Then, we ensure
convergence via robust controllers acting as dynamical rewards in the loss
function. We synthesize three controllers: state-feedback gain scheduling H2,
dynamic Hinf, and constant gain Hinf controllers. Setting up the learning agent
with a control-oriented tuning methodology is more transparent and has
well-established literature compared to the heuristics in reinforcement
learning. In addition, our approach does not use a target network and
randomized replay memory. The role of the target network is overtaken by the
control input, which also exploits the temporal dependency of samples (opposed
to a randomized memory buffer). Numerical simulations in different OpenAI Gym
environments suggest that the Hinf controlled learning performs slightly better
than Double deep Q-learning.
","[{'version': 'v1', 'created': 'Fri, 21 Jan 2022 09:47:34 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Nov 2022 13:02:42 GMT'}]",2022-11-08,"[['Varga', 'Balazs', ''], ['Kulcsar', 'Balazs', ''], ['Chehreghani', 'Morteza Haghir', '']]","['Deep Q-learning', 'Neural Tangent Kernel', 'Robust control', 'Controlled learning']"
7144,2103.16882,Giovanni Iacca Prof.,"Quintino Francesco Lotito, Leonardo Lucio Custode, Giovanni Iacca",A Signal-Centric Perspective on the Evolution of Symbolic Communication,"To be published in the proceedings of ACM Genetic and Evolutionary
  Computation Conference (GECCO) 2021",,10.1145/3449639.3459273,,cs.NE,http://creativecommons.org/licenses/by/4.0/,"  The evolution of symbolic communication is a longstanding open research
question in biology. While some theories suggest that it originated from
sub-symbolic communication (i.e., iconic or indexical), little experimental
evidence exists on how organisms can actually evolve to define a shared set of
symbols with unique interpretable meaning, thus being capable of encoding and
decoding discrete information. Here, we use a simple synthetic model composed
of sender and receiver agents controlled by Continuous-Time Recurrent Neural
Networks, which are optimized by means of neuro-evolution. We characterize
signal decoding as either regression or classification, with limited and
unlimited signal amplitude. First, we show how this choice affects the
complexity of the evolutionary search, and leads to different levels of
generalization. We then assess the effect of noise, and test the evolved
signaling system in a referential game. In various settings, we observe agents
evolving to share a dictionary of symbols, with each symbol spontaneously
associated to a 1-D unique signal. Finally, we analyze the constellation of
signals associated to the evolved signaling systems and note that in most cases
these resemble a Pulse Amplitude Modulation system.
","[{'version': 'v1', 'created': 'Wed, 31 Mar 2021 08:05:01 GMT'}]",2021-04-01,"[['Lotito', 'Quintino Francesco', ''], ['Custode', 'Leonardo Lucio', ''], ['Iacca', 'Giovanni', '']]","['Symbolic Communication', 'Neuro-evolution', 'NEAT', 'ContinuousTime Recurrent Neural Networks', 'Agent-Based Model']"
7145,1904.09544,Aihong Yuan,"Aihong Yuan, Xuelong Li, Xiaoqiang Lu",3G structure for image caption generation,"35 pages, 7 figures, magazine",Neurocomputing 330: 17-28 (2019),10.1016/j.neucom.2018.10.059,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is a big challenge of computer vision to make machine automatically
describe the content of an image with a natural language sentence. Previous
works have made great progress on this task, but they only use the global or
local image feature, which may lose some important subtle or global information
of an image. In this paper, we propose a model with 3-gated model which fuses
the global and local image features together for the task of image caption
generation. The model mainly has three gated structures. 1) Gate for the global
image feature, which can adaptively decide when and how much the global image
feature should be imported into the sentence generator. 2) The gated recurrent
neural network (RNN) is used as the sentence generator. 3) The gated feedback
method for stacking RNN is employed to increase the capability of nonlinearity
fitting. More specially, the global and local image features are combined
together in this paper, which makes full use of the image information. The
global image feature is controlled by the first gate and the local image
feature is selected by the attention mechanism. With the latter two gates, the
relationship between image and text can be well explored, which improves the
performance of the language part as well as the multi-modal embedding part.
Experimental results show that our proposed method outperforms the
state-of-the-art for image caption generation.
","[{'version': 'v1', 'created': 'Sun, 21 Apr 2019 05:43:01 GMT'}]",2019-04-23,"[['Yuan', 'Aihong', ''], ['Li', 'Xuelong', ''], ['Lu', 'Xiaoqiang', '']]","['Image caption generation', 'deep learning', 'convolutional neural']"
7146,2103.07676,Noushath Shaffi Dr,"Noushath Shaffi, Faizal Hajamohideen",uTHCD: A New Benchmarking for Tamil Handwritten OCR,"30 pages, 18 figures, in IEEE Access",,10.1109/ACCESS.2021.3096823,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Handwritten character recognition is a challenging research in the field of
document image analysis over many decades due to numerous reasons such as large
writing styles variation, inherent noise in data, expansive applications it
offers, non-availability of benchmark databases etc. There has been
considerable work reported in literature about creation of the database for
several Indic scripts but the Tamil script is still in its infancy as it has
been reported only in one database [5]. In this paper, we present the work done
in the creation of an exhaustive and large unconstrained Tamil Handwritten
Character Database (uTHCD). Database consists of around 91000 samples with
nearly 600 samples in each of 156 classes. The database is a unified collection
of both online and offline samples. Offline samples were collected by asking
volunteers to write samples on a form inside a specified grid. For online
samples, we made the volunteers write in a similar grid using a digital writing
pad. The samples collected encompass a vast variety of writing styles, inherent
distortions arising from offline scanning process viz stroke discontinuity,
variable thickness of stroke, distortion etc. Algorithms which are resilient to
such data can be practically deployed for real time applications. The samples
were generated from around 650 native Tamil volunteers including school going
kids, homemakers, university students and faculty. The isolated character
database will be made publicly available as raw images and Hierarchical Data
File (HDF) compressed file. With this database, we expect to set a new
benchmark in Tamil handwritten character recognition and serve as a launchpad
for many avenues in document image analysis domain. Paper also presents an
ideal experimental set-up using the database on convolutional neural networks
(CNN) with a baseline accuracy of 88% on test data.
","[{'version': 'v1', 'created': 'Sat, 13 Mar 2021 10:34:08 GMT'}]",2021-07-21,"[['Shaffi', 'Noushath', ''], ['Hajamohideen', 'Faizal', '']]","['Indic Scripts', 'Tamil Handwriting Database', 'Handwriting Recognition', 'Optical']"
7147,2107.13440,Evgeny Bobrov,"Evgeny Bobrov (1 and 2), Dmitry Kropotov (2 and 3), Sergey Troshin
  (3), Danila Zaev (1) ((1) Huawei Russian Research Institute, (2) M. V.
  Lomonosov Moscow State University, (3) National Research University Higher
  School of Economics)","Study on Precoding Optimization Algorithms in Massive MIMO System with
  Multi-Antenna Users","16 pages, 6 figures, 6 tables, the work has been accepted for
  publication in Optimization Methods and Software, comments are welcome",,10.1080/10556788.2022.2091564,,cs.IT cs.NI math.IT,http://creativecommons.org/licenses/by/4.0/,"  The paper studies the multi-user precoding problem as a non-convex
optimization problem for wireless multiple input and multiple output (MIMO)
systems. In our work, we approximate the target Spectral Efficiency function
with a novel computationally simpler function. Then, we reduce the precoding
problem to an unconstrained optimization task using a special differential
projection method and solve it by the Quasi-Newton L-BFGS iterative procedure
to achieve gains in capacity. We are testing the proposed approach in several
scenarios generated using Quadriga - open-source software for generating
realistic radio channel impulse response. Our method shows monotonic
improvement over heuristic methods with reasonable computation time. The
proposed L-BFGS optimization scheme is novel in this area and shows a
significant advantage over the standard approaches. The proposed method has a
simple implementation and can be a good reference for other heuristic
algorithms in this field.
","[{'version': 'v1', 'created': 'Wed, 28 Jul 2021 15:47:06 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Oct 2021 10:29:36 GMT'}, {'version': 'v3', 'created': 'Fri, 26 Nov 2021 10:48:00 GMT'}, {'version': 'v4', 'created': 'Mon, 24 Jan 2022 10:31:27 GMT'}, {'version': 'v5', 'created': 'Mon, 20 Jun 2022 17:03:21 GMT'}]",2022-06-22,"[['Bobrov', 'Evgeny', '', '1 and 2'], ['Kropotov', 'Dmitry', '', '2 and 3'], ['Troshin', 'Sergey', ''], ['Zaev', 'Danila', '']]","['Optimization', 'Massive MIMO', 'Precoding', 'SVD', 'L-BFGS', 'Interior-Point']"
7148,2005.05268,Uzay \c{C}etin,Uzay Cetin and Yunus Emre Gundogmus,"Feature Selection with Evolving, Fast and Slow Using Two Parallel
  Genetic Algorithms",,"Conference: 2019 4th International Conference on Computer Science
  and Engineering (UBMK)",10.1109/UBMK.2019.8907165,,cs.NE cs.AI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feature selection is one of the most challenging issues in machine learning,
especially while working with high dimensional data. In this paper, we address
the problem of feature selection and propose a new approach called Evolving
Fast and Slow. This new approach is based on using two parallel genetic
algorithms having high and low mutation rates, respectively. Evolving Fast and
Slow requires a new parallel architecture combining an automatic system that
evolves fast and an effortful system that evolves slow. With this architecture,
exploration and exploitation can be done simultaneously and in unison. Evolving
fast, with high mutation rate, can be useful to explore new unknown places in
the search space with long jumps; and Evolving Slow, with low mutation rate,
can be useful to exploit previously known places in the search space with short
movements. Our experiments show that Evolving Fast and Slow achieves very good
results in terms of both accuracy and feature elimination.
","[{'version': 'v1', 'created': 'Mon, 11 May 2020 17:10:39 GMT'}]",2020-05-12,"[['Cetin', 'Uzay', ''], ['Gundogmus', 'Yunus Emre', '']]","['Feature selection', 'Genetic Algorithms', 'High Dimensional Data', 'Distributed Computation', 'Machine Learning']"
7149,2008.08807,Benjamin Zi Hao Zhao,"Benjamin Zi Hao Zhao, Mohamed Ali Kaafar, Nicolas Kourtellis","Not one but many Tradeoffs: Privacy Vs. Utility in Differentially
  Private Machine Learning","12 pages, Accepted at CCSW'20, an ACM CCS Workshop",,10.1145/3411495.3421352,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data holders are increasingly seeking to protect their user's privacy, whilst
still maximizing their ability to produce machine models with high quality
predictions. In this work, we empirically evaluate various implementations of
differential privacy (DP), and measure their ability to fend off real-world
privacy attacks, in addition to measuring their core goal of providing accurate
classifications. We establish an evaluation framework to ensure each of these
implementations are fairly evaluated. Our selection of DP implementations add
DP noise at different positions within the framework, either at the point of
data collection/release, during updates while training of the model, or after
training by perturbing learned model parameters. We evaluate each
implementation across a range of privacy budgets, and datasets, each
implementation providing the same mathematical privacy guarantees. By measuring
the models' resistance to real world attacks of membership and attribute
inference, and their classification accuracy. we determine which
implementations provide the most desirable tradeoff between privacy and
utility. We found that the number of classes of a given dataset is unlikely to
influence where the privacy and utility tradeoff occurs. Additionally, in the
scenario that high privacy constraints are required, perturbing input training
data does not trade off as much utility, as compared to noise added later in
the ML process.
","[{'version': 'v1', 'created': 'Thu, 20 Aug 2020 07:06:28 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Sep 2020 06:39:39 GMT'}]",2020-09-16,"[['Zhao', 'Benjamin Zi Hao', ''], ['Kaafar', 'Mohamed Ali', ''], ['Kourtellis', 'Nicolas', '']]","['Machine Learning', 'Differential Privacy', 'Privacy-Utility tradeoffs']"
7150,2005.07059,Jason Z.S. Hu,Jason Z.S. Hu and Jacques Carette,Formalizing of Category Theory in Agda,,,10.1145/3437992.3439922,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  The generality and pervasiness of category theory in modern mathematics makes
it a frequent and useful target of formalization. It is however quite
challenging to formalize, for a variety of reasons. Agda currently (i.e. in
2020) does not have a standard, working formalization of category theory. We
document our work on solving this dilemma. The formalization revealed a number
of potential design choices, and we present, motivate and explain the ones we
picked. In particular, we find that alternative definitions or alternative
proofs from those found in standard textbooks can be advantageous, as well as
""fit"" Agda's type theory more smoothly. Some definitions regarded as equivalent
in standard textbooks turn out to make different ""universe level"" assumptions,
with some being more polymorphic than others. We also pay close attention to
engineering issues so that the library integrates well with Agda's own standard
library, as well as being compatible with as many of supported type theories in
Agda as possible.
","[{'version': 'v1', 'created': 'Thu, 14 May 2020 15:16:19 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Jan 2021 14:27:19 GMT'}]",2021-03-04,"[['Hu', 'Jason Z. S.', ''], ['Carette', 'Jacques', '']]","['Agda', 'category theory', 'formal mathematics']"
7151,1809.05628,Jukka Ruohonen,"Jukka Ruohonen and Joonas Salovaara and Ville Lepp\""anen",On the Integrity of Cross-Origin JavaScripts,"Proceedings of the 33rd IFIP International Conference on ICT Systems
  Security and Privacy Protection (IFIP SEC 2018), Poznan, Springer, pp.
  385--398",,10.1007/978-3-319-99828-2_27,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The same-origin policy is a fundamental part of the Web. Despite the
restrictions imposed by the policy, embedding of third-party JavaScript code is
allowed and commonly used. Nothing is guaranteed about the integrity of such
code. To tackle this deficiency, solutions such as the subresource integrity
standard have been recently introduced. Given this background, this paper
presents the first empirical study on the temporal integrity of cross-origin
JavaScript code. According to the empirical results based on a ten day polling
period of over 35 thousand scripts collected from popular websites, (i)
temporal integrity changes are relatively common; (ii) the adoption of the
subresource integrity standard is still in its infancy; and (iii) it is
possible to statistically predict whether a temporal integrity change is likely
to occur. With these results and the accompanying discussion, the paper
contributes to the ongoing attempts to better understand security and privacy
in the current Web.
","[{'version': 'v1', 'created': 'Sat, 15 Sep 2018 01:15:29 GMT'}]",2018-09-18,"[['Ruohonen', 'Jukka', ''], ['Salovaara', 'Joonas', ''], ['Leppänen', 'Ville', '']]","['same-origin', 'cross-domain', 'remote inclusion', 'subresource integrity']"
7152,2101.10808,Kostiantyn Khabarlak,"Kostiantyn Khabarlak, Larysa Koriashkina",Fast Facial Landmark Detection and Applications: A Survey,,,10.24215/16666038.22.e02,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dense facial landmark detection is one of the key elements of face processing
pipeline. It is used in virtual face reenactment, emotion recognition, driver
status tracking, etc. Early approaches were suitable for facial landmark
detection in controlled environments only, which is clearly insufficient.
Neural networks have shown an astonishing qualitative improvement for
in-the-wild face landmark detection problem, and are now being studied by many
researchers in the field. Numerous bright ideas are proposed, often
complimentary to each other. However, exploration of the whole volume of novel
approaches is quite challenging. Therefore, we present this survey, where we
summarize state-of-the-art algorithms into categories, provide a comparison of
recently introduced in-the-wild datasets (e.g., 300W, AFLW, COFW, WFLW) that
contain images with large pose, face occlusion, taken in unconstrained
conditions. In addition to quality, applications require fast inference, and
preferably on mobile devices. Hence, we include information about algorithm
inference speed both on desktop and mobile hardware, which is rarely studied.
Importantly, we highlight problems of algorithms, their applications,
vulnerabilities, and briefly touch on established methods. We hope that the
reader will find many novel ideas, will see how the algorithms are used in
applications, which will enable further research.
","[{'version': 'v1', 'created': 'Tue, 12 Jan 2021 09:40:40 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Apr 2021 05:14:54 GMT'}, {'version': 'v3', 'created': 'Mon, 25 Apr 2022 09:53:31 GMT'}]",2022-04-26,"[['Khabarlak', 'Kostiantyn', ''], ['Koriashkina', 'Larysa', '']]","['Computer Vision', 'Edge Computing', 'FacialLandmarks', 'Neural Networks', 'Mobile Applications', 'Literature Overview']"
7153,2207.06899,Bangbang Yang,"Boming Zhao, Bangbang Yang, Zhenyang Li, Zuoyue Li, Guofeng Zhang,
  Jiashu Zhao, Dawei Yin, Zhaopeng Cui, Hujun Bao","Factorized and Controllable Neural Re-Rendering of Outdoor Scene for
  Photo Extrapolation","Accepted to ACM Multimedia 2022. Project Page:
  https://zju3dv.github.io/neural_outdoor_rerender/",,10.1145/3503161.3548125,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Expanding an existing tourist photo from a partially captured scene to a full
scene is one of the desired experiences for photography applications. Although
photo extrapolation has been well studied, it is much more challenging to
extrapolate a photo (i.e., selfie) from a narrow field of view to a wider one
while maintaining a similar visual style. In this paper, we propose a
factorized neural re-rendering model to produce photorealistic novel views from
cluttered outdoor Internet photo collections, which enables the applications
including controllable scene re-rendering, photo extrapolation and even
extrapolated 3D photo generation. Specifically, we first develop a novel
factorized re-rendering pipeline to handle the ambiguity in the decomposition
of geometry, appearance and illumination. We also propose a composited training
strategy to tackle the unexpected occlusion in Internet images. Moreover, to
enhance photo-realism when extrapolating tourist photographs, we propose a
novel realism augmentation process to complement appearance details, which
automatically propagates the texture details from a narrow captured photo to
the extrapolated neural rendered image. The experiments and photo editing
examples on outdoor scenes demonstrate the superior performance of our proposed
method in both photo-realism and downstream applications.
","[{'version': 'v1', 'created': 'Thu, 14 Jul 2022 13:28:08 GMT'}]",2022-07-15,"[['Zhao', 'Boming', ''], ['Yang', 'Bangbang', ''], ['Li', 'Zhenyang', ''], ['Li', 'Zuoyue', ''], ['Zhang', 'Guofeng', ''], ['Zhao', 'Jiashu', ''], ['Yin', 'Dawei', ''], ['Cui', 'Zhaopeng', ''], ['Bao', 'Hujun', '']]","['neural rendering', 'outdoor scene re-rendering', 'photograph editing']"
7154,2006.14476,Alberto Sim\~oes,Alberto Sim\~oes and Ricardo Queir\'os,On the Nature of Programming Exercises,,,10.4230/OASIcs.ICPEC.2020.24,,cs.CY cs.PL,http://creativecommons.org/licenses/by/4.0/,"  There are countless reasons cited in scientific studies to explain the
difficulties in programming learning. The reasons range from the subject's
complexity, the ineffective teaching and study methods, to psychological
aspects such as demotivation. Still, learning programming often boils down to
practice on exercise solving. Hence, it is essential to understand that the
nature of a programming exercise is an important factor for the success and
consistent learning.
  This paper explores different approaches on the creation of a programming
exercise, starting with realizing how it is currently formalized, presented and
evaluated. From there, authors suggest variations that seek to broaden the way
an exercise is solved and, with this diversity, increase student engagement and
learning outcome. The several types of exercises presented can use gamification
techniques fostering student motivation. To contextualize the student with his
peers, we finish presenting metrics that can be obtained by existing automatic
assessment tools.
","[{'version': 'v1', 'created': 'Thu, 25 Jun 2020 15:22:26 GMT'}]",2020-06-26,"[['Simões', 'Alberto', ''], ['Queirós', 'Ricardo', '']]","['Programming Exercises', 'Computer Science', 'Automatic Evaluation', 'Programming Challenges']"
7155,2204.09741,Paul Magron,"Paul Magron, C\'edric F\'evotte","A majorization-minimization algorithm for nonnegative binary matrix
  factorization",,,10.1109/LSP.2022.3187368,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper tackles the problem of decomposing binary data using matrix
factorization. We consider the family of mean-parametrized Bernoulli models, a
class of generative models that are well suited for modeling binary data and
enables interpretability of the factors. We factorize the Bernoulli parameter
and consider an additional Beta prior on one of the factors to further improve
the model's expressive power. While similar models have been proposed in the
literature, they only exploit the Beta prior as a proxy to ensure a valid
Bernoulli parameter in a Bayesian setting; in practice it reduces to a uniform
or uninformative prior. Besides, estimation in these models has focused on
costly Bayesian inference. In this paper, we propose a simple yet very
efficient majorization-minimization algorithm for maximum a posteriori
estimation. Our approach leverages the Beta prior whose parameters can be tuned
to improve performance in matrix completion tasks. Experiments conducted on
three public binary datasets show that our approach offers an excellent
trade-off between prediction performance, computational complexity, and
interpretability.
","[{'version': 'v1', 'created': 'Wed, 20 Apr 2022 18:53:34 GMT'}]",2022-07-27,"[['Magron', 'Paul', ''], ['Févotte', 'Cédric', '']]","['Binary data', 'nonnegative matrix factorization', 'mean-parametrized Bernoulli model', 'majorizationminimization']"
7156,1712.05053,Alexey Shvets,"Vladimir Iglovikov, Alexander Rakhlin, Alexandr Kalinin, Alexey Shvets",Pediatric Bone Age Assessment Using Deep Convolutional Neural Networks,"14 pages, 9 figures",,10.1007/978-3-030-00889-5_34,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Skeletal bone age assessment is a common clinical practice to diagnose
endocrine and metabolic disorders in child development. In this paper, we
describe a fully automated deep learning approach to the problem of bone age
assessment using data from Pediatric Bone Age Challenge organized by RSNA 2017.
The dataset for this competition is consisted of 12.6k radiological images of
left hand labeled by the bone age and sex of patients. Our approach utilizes
several deep learning architectures: U-Net, ResNet-50, and custom VGG-style
neural networks trained end-to-end. We use images of whole hands as well as
specific parts of a hand for both training and inference. This approach allows
us to measure importance of specific hand bones for the automated bone age
analysis. We further evaluate performance of the method in the context of
skeletal development stages. Our approach outperforms other common methods for
bone age assessment.
","[{'version': 'v1', 'created': 'Wed, 13 Dec 2017 23:56:15 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Jun 2018 19:46:33 GMT'}]",2018-09-24,"[['Iglovikov', 'Vladimir', ''], ['Rakhlin', 'Alexander', ''], ['Kalinin', 'Alexandr', ''], ['Shvets', 'Alexey', '']]","['Medical Imaging', 'Computer-aided diagnosis (CAD)', 'ComputerVision', 'Image Recognition', 'Deep Learning']"
7157,2008.09912,Dongjie Wang,"Dongjie Wang, Yanjie Fu, Pengyang Wang, Bo Huang, Chang-Tien Lu","Reimagining City Configuration: Automated Urban Planning via Adversarial
  Learning","Proceedings of the 28th International Conference on Advances in
  Geographic Information Systems (2020)",SIGSPATIAL/GIS 2020: 497-506,10.1145/3397536.3422268,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Urban planning refers to the efforts of designing land-use configurations.
Effective urban planning can help to mitigate the operational and social
vulnerability of a urban system, such as high tax, crimes, traffic congestion
and accidents, pollution, depression, and anxiety. Due to the high complexity
of urban systems, such tasks are mostly completed by professional planners.
But, human planners take longer time. The recent advance of deep learning
motivates us to ask: can machines learn at a human capability to automatically
and quickly calculate land-use configuration, so human planners can finally
adjust machine-generated plans for specific needs? To this end, we formulate
the automated urban planning problem into a task of learning to configure
land-uses, given the surrounding spatial contexts. To set up the task, we
define a land-use configuration as a longitude-latitude-channel tensor, where
each channel is a category of POIs and the value of an entry is the number of
POIs. The objective is then to propose an adversarial learning framework that
can automatically generate such tensor for an unplanned area. In particular, we
first characterize the contexts of surrounding areas of an unplanned area by
learning representations from spatial graphs using geographic and human
mobility data. Second, we combine each unplanned area and its surrounding
context representation as a tuple, and categorize all the tuples into positive
(well-planned areas) and negative samples (poorly-planned areas). Third, we
develop an adversarial land-use configuration approach, where the surrounding
context representation is fed into a generator to generate a land-use
configuration, and a discriminator learns to distinguish among positive and
negative samples.
","[{'version': 'v1', 'created': 'Sat, 22 Aug 2020 21:15:39 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jan 2021 16:52:19 GMT'}]",2021-01-08,"[['Wang', 'Dongjie', ''], ['Fu', 'Yanjie', ''], ['Wang', 'Pengyang', ''], ['Huang', 'Bo', ''], ['Lu', 'Chang-Tien', '']]","['urban planning', 'representation learning', 'generative adversarialnetworks', 'graph neural networks']"
7158,2208.11674,Zuguang Gu,Zuguang Gu,On the Dependency Heaviness of CRAN/Bioconductor Ecosystem,Journal of Systems and Software 2023,,10.1016/j.jss.2023.111610,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The R package ecosystem is expanding fast and dependencies among packages in
the ecosystem are becoming more complex. In this study, we explored the package
dependencies from a new aspect. We applied a new metric named ""dependency
heaviness"" which measures the number of additional strong dependencies that a
package uniquely contributes to its child or downstream packages. It also
measures the total reduced dependencies in the ecosystem when the role of a
package is changed from a strong parent to a weak parent. We systematically
studied how the dependency heaviness spreads from parent to child packages, and
how it further spreads to remote downstream packages in the CRAN/Bioconductor
ecosystem. We extracted top packages and key paths that majorly transmit heavy
dependencies in the ecosystem. Additionally, the dependency heaviness analysis
on the ecosystem has been implemented as a web-based database that provides
comprehensive tools for querying dependencies of individual R packages.
","[{'version': 'v1', 'created': 'Wed, 24 Aug 2022 17:12:31 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Dec 2022 17:34:33 GMT'}, {'version': 'v3', 'created': 'Thu, 5 Jan 2023 19:59:13 GMT'}]",2023-01-09,"[['Gu', 'Zuguang', '']]","['CRAN', 'Bioconductor', 'Dependency graph', 'Dependency heaviness', 'Software ecosystem', 'Software engineering']"
7159,2107.04746,Darshan Gera,"Darshan Gera, S. Balasubramanian","Consensual Collaborative Training And Knowledge Distillation Based
  Facial Expression Recognition Under Noisy Annotations","11 pages, 6 figures, Published with International Journal of
  Engineering Trends and Technology (IJETT), Codes:
  https://github.com/1980x/CCT","International Journal of Engineering Trends and Technology
  69.7(2021):244-254",10.14445/22315381/IJETT-V69I7P231,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Presence of noise in the labels of large scale facial expression datasets has
been a key challenge towards Facial Expression Recognition (FER) in the wild.
During early learning stage, deep networks fit on clean data. Then, eventually,
they start overfitting on noisy labels due to their memorization ability, which
limits FER performance. This work proposes an effective training strategy in
the presence of noisy labels, called as Consensual Collaborative Training (CCT)
framework. CCT co-trains three networks jointly using a convex combination of
supervision loss and consistency loss, without making any assumption about the
noise distribution. A dynamic transition mechanism is used to move from
supervision loss in early learning to consistency loss for consensus of
predictions among networks in the later stage. Inference is done using a single
network based on a simple knowledge distillation scheme. Effectiveness of the
proposed framework is demonstrated on synthetic as well as real noisy FER
datasets. In addition, a large test subset of around 5K images is annotated
from the FEC dataset using crowd wisdom of 16 different annotators and reliable
labels are inferred. CCT is also validated on it. State-of-the-art performance
is reported on the benchmark FER datasets RAFDB (90.84%) FERPlus (89.99%) and
AffectNet (66%). Our codes are available at https://github.com/1980x/CCT.
","[{'version': 'v1', 'created': 'Sat, 10 Jul 2021 03:37:06 GMT'}]",2021-07-13,"[['Gera', 'Darshan', ''], ['Balasubramanian', 'S.', '']]","['Collaborative training', 'Crowd-sourcing', 'Knowledge distillation', 'Facial expression recognition', 'Noisy annotation']"
7160,2208.13480,Rui Ma,"Rui Ma, Ning Liu, Jingsong Yuan, Huafeng Yang, Jiandong Zhang","CAEN: A Hierarchically Attentive Evolution Network for
  Item-Attribute-Change-Aware Recommendation in the Growing E-commerce
  Environment","10 pages, Accepted by RecSys 2022",,10.1145/3523227.3546773,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Traditional recommendation systems mainly focus on modeling user interests.
However, the dynamics of recommended items caused by attribute modifications
(e.g. changes in prices) are also of great importance in real systems,
especially in the fast-growing e-commerce environment, which may cause the
users' demands to emerge, shift and disappear. Recent studies that make efforts
on dynamic item representations treat the item attributes as side information
but ignore its temporal dependency, or model the item evolution with a sequence
of related users but do not consider item attributes. In this paper, we propose
Core Attribute Evolution Network (CAEN), which partitions the user sequence
according to the attribute value and thus models the item evolution over
attribute dynamics with these users. Under this framework, we further devise a
hierarchical attention mechanism that applies attribute-aware attention for
user aggregation under each attribute, as well as personalized attention for
activating similar users in assessing the matching degree between target user
and item. Results from the extensive experiments over actual e-commerce
datasets show that our approach outperforms the state-of-art methods and
achieves significant improvements on the items with rapid changes over
attributes, therefore helping the item recommendation to adapt to the growth of
the e-commerce platform.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2022 10:29:06 GMT'}]",2022-08-30,"[['Ma', 'Rui', ''], ['Liu', 'Ning', ''], ['Yuan', 'Jingsong', ''], ['Yang', 'Huafeng', ''], ['Zhang', 'Jiandong', '']]","['product recommendation', 'e-commerce', 'hierarchical attention network', 'item attribute change']"
7161,2103.15481,Di Zuo,"Di Zuo, Yiqian He, St\'ephane Avril, Haitian Yang, Klaus Hackl","A thermodynamic framework for unified continuum models for the healing
  of damaged soft biological tissue","42 pages, 17 figures, 3 tables, submit to Journal of the Mechanics
  and Physics of Solids",,10.1016/j.jmps.2021.104662,,cs.CE physics.med-ph,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  When they are damaged or injured, soft biological tissues are able to
self-repair and heal. Mechanics is critical during the healing process, as the
damaged extracellular matrix (ECM) tends to be replaced with a new undamaged
ECM supporting homeostatic stresses. Computational modeling has been commonly
used to simulate the healing process. However, there is a pressing need to have
a unified thermodynamics theory for healing. From the viewpoint of continuum
damage mechanics, some key parameters related to healing processes, for
instance, the volume fraction of newly grown soft tissue and the growth
deformation, can be regarded as internal variables and have related evolution
equations. This paper is aiming to establish this unified framework inspired by
thermodynamics for continuum damage models for the healing of soft biological
tissues. The significant advantage of the proposed model is that no \textit{ad
hoc} equations are required for describing the healing process. Therefore, this
new model is more concise and offers a universal approach to simulate the
healing process. Three numerical examples are provided to demonstrate the
effectiveness of the proposed model, which is in good agreement with the
existing works, including an application for balloon angioplasty in an
arteriosclerotic artery with a fiber cap.
","[{'version': 'v1', 'created': 'Mon, 29 Mar 2021 10:34:25 GMT'}]",2021-12-08,"[['Zuo', 'Di', ''], ['He', 'Yiqian', ''], ['Avril', 'Stéphane', ''], ['Yang', 'Haitian', ''], ['Hackl', 'Klaus', '']]","['Healing', 'Soft biological tissue', 'Continuum damage model', 'Unified models', 'Thermodynamic framework']"
7162,1801.08613,David Hall,"David Hall, Feras Dayoub, Tristan Perez and Chris McCool","A Rapidly Deployable Classification System using Visual Data for the
  Application of Precision Weed Management","36 pages, 14 figures, published Computers and Electronics in
  Agriculture Vol. 148","D. Hall, F. Dayoub, T. Perez, and C. McCool, ""A Rapidly Deployable
  Classification System using Visual Data for the Application of Precision Weed
  Management,"" Computers and Electronics in Agriculture, Vol. 148, pp. 107-120,
  May 2018",10.1016/j.compag.2018.02.023,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we demonstrate a rapidly deployable weed classification system
that uses visual data to enable autonomous precision weeding without making
prior assumptions about which weed species are present in a given field.
Previous work in this area relies on having prior knowledge of the weed species
present in the field. This assumption cannot always hold true for every field,
and thus limits the use of weed classification systems based on this
assumption. In this work, we obviate this assumption and introduce a rapidly
deployable approach able to operate on any field without any weed species
assumptions prior to deployment. We present a three stage pipeline for the
implementation of our weed classification system consisting of initial field
surveillance, offline processing and selective labelling, and automated
precision weeding. The key characteristic of our approach is the combination of
plant clustering and selective labelling which is what enables our system to
operate without prior weed species knowledge. Testing using field data we are
able to label 12.3 times fewer images than traditional full labelling whilst
reducing classification accuracy by only 14%.
","[{'version': 'v1', 'created': 'Thu, 25 Jan 2018 22:00:00 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Apr 2018 07:36:23 GMT'}]",2018-04-27,"[['Hall', 'David', ''], ['Dayoub', 'Feras', ''], ['Perez', 'Tristan', ''], ['McCool', 'Chris', '']]","['Weed Classification', 'Agricultural Robotics', 'Rapid Deployment', 'Clustering', 'Selective Data Labelling']"
7163,2111.01974,Damiano Perri,"Francesca Santucci, Federico Frenguelli, Alessandro De Angelis, Ilaria
  Cuccaro, Damiano Perri, Marco Simonetti",An immersive Open Source environment using Godot,"International Conference on Computational Science and Its
  Applications, ICCSA 2020","LNCS, volume 12255, 2020",10.1007/978-3-030-58820-5_56,,cs.GR,http://creativecommons.org/licenses/by/4.0/,"  We present a sample implementation of a Virtual and Augmented Reality
immersive environment based on Free and Libre Open Source Hardware and Software
and the HTC Vive system, used to enhance the immersive experience of the user
and to track her/his movements. The sense of immersion has increased and
stimulated using a footplate and a Tibetan bridge, connected to the virtual
world as Augmented Reality applications and implemented through an Arduino
board, thereby adopting a low cost, open source hardware and software approach.
The proposed architecture is relatively affordable from the cost point of view,
easy to implement, configure and adapt to different contexts. It can be of
great help for organizing laboratory classes for young students to afford the
implementation of virtual worlds and Augmented Reality applications.
","[{'version': 'v1', 'created': 'Wed, 3 Nov 2021 01:57:54 GMT'}]",2021-11-04,"[['Santucci', 'Francesca', ''], ['Frenguelli', 'Federico', ''], ['De Angelis', 'Alessandro', ''], ['Cuccaro', 'Ilaria', ''], ['Perri', 'Damiano', ''], ['Simonetti', 'Marco', '']]","['Virtual Reality', 'Augmented Reality', 'Immersive environments', 'Freeand Libre Open Source Software', 'Godot', 'Blender', 'Arduino']"
7164,2005.01112,Maria Kosche,"Pawel Gawrychowski, Maria Kosche, Tore Koss, Florin Manea, Stefan
  Siemer",Efficiently Testing Simon's Congruence,,,10.4230/LIPIcs.STACS.2021.34,,cs.FL cs.DS,http://creativecommons.org/licenses/by/4.0/,"  Simon's congruence $\sim_k$ is defined as follows: two words are
$\sim_k$-equivalent if they have the same set of subsequences of length at most
$k$. We propose an algorithm which computes, given two words $s$ and $t$, the
largest $k$ for which $s\sim_k t$. Our algorithm runs in linear time
$O(|s|+|t|)$ when the input words are over the integer alphabet
$\{1,\ldots,|s|+|t|\}$ (or other alphabets which can be sorted in linear time).
This approach leads to an optimal algorithm in the case of general alphabets as
well. Our results are based on a novel combinatorial approach and a series of
efficient data structures.
","[{'version': 'v1', 'created': 'Sun, 3 May 2020 15:15:47 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Mar 2021 16:31:53 GMT'}]",2021-03-16,"[['Gawrychowski', 'Pawel', ''], ['Kosche', 'Maria', ''], ['Koss', 'Tore', ''], ['Manea', 'Florin', ''], ['Siemer', 'Stefan', '']]","['Simon’s congruence', 'Subsequence', 'Scattered factor', 'Efficient algorithms']"
7165,1810.03382,Declan O'Regan,"Ghalib A. Bello, Timothy J.W. Dawes, Jinming Duan, Carlo Biffi,
  Antonio de Marvao, Luke S.G.E. Howard, J. Simon R. Gibbs, Martin R. Wilkins,
  Stuart A. Cook, Daniel Rueckert, and Declan P. O'Regan",Deep learning cardiac motion analysis for human survival prediction,,"Nature Machine Intelligence, 1, 95-104 (2019)",10.1038/s42256-019-0019-2,,cs.LG cs.CV stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Motion analysis is used in computer vision to understand the behaviour of
moving objects in sequences of images. Optimising the interpretation of dynamic
biological systems requires accurate and precise motion tracking as well as
efficient representations of high-dimensional motion trajectories so that these
can be used for prediction tasks. Here we use image sequences of the heart,
acquired using cardiac magnetic resonance imaging, to create time-resolved
three-dimensional segmentations using a fully convolutional network trained on
anatomical shape priors. This dense motion model formed the input to a
supervised denoising autoencoder (4Dsurvival), which is a hybrid network
consisting of an autoencoder that learns a task-specific latent code
representation trained on observed outcome data, yielding a latent
representation optimised for survival prediction. To handle right-censored
survival outcomes, our network used a Cox partial likelihood loss function. In
a study of 302 patients the predictive accuracy (quantified by Harrell's
C-index) was significantly higher (p < .0001) for our model C=0.73 (95$\%$ CI:
0.68 - 0.78) than the human benchmark of C=0.59 (95$\%$ CI: 0.53 - 0.65). This
work demonstrates how a complex computer vision task using high-dimensional
medical image data can efficiently predict human survival.
","[{'version': 'v1', 'created': 'Mon, 8 Oct 2018 11:34:38 GMT'}]",2019-02-18,"[['Bello', 'Ghalib A.', ''], ['Dawes', 'Timothy J. W.', ''], ['Duan', 'Jinming', ''], ['Biffi', 'Carlo', ''], ['de Marvao', 'Antonio', ''], ['Howard', 'Luke S. G. E.', ''], ['Gibbs', 'J. Simon R.', ''], ['Wilkins', 'Martin R.', ''], ['Cook', 'Stuart A.', ''], ['Rueckert', 'Daniel', ''], [""O'Regan"", 'Declan P.', '']]","['Survival; Machine Learning; Magnetic Resonance Imaging', 'Cine; Hypertension', 'Pulmonary; Heart Failure; Motion']"
7166,2203.17196,Maliheh Izadi,Maliheh Izadi,"CatIss: An Intelligent Tool for Categorizing Issues Reports using
  Transformers","To appear in the Proceedings of the 1sth International Workshop on
  Natural Language-based Software Engineering (NLBSE), co-located with ICSE,
  2022",,10.1145/3528588.3528662,,cs.SE cs.CL cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Users use Issue Tracking Systems to keep track and manage issue reports in
their repositories. An issue is a rich source of software information that
contains different reports including a problem, a request for new features, or
merely a question about the software product. As the number of these issues
increases, it becomes harder to manage them manually. Thus, automatic
approaches are proposed to help facilitate the management of issue reports.
  This paper describes CatIss, an automatic CATegorizer of ISSue reports which
is built upon the Transformer-based pre-trained RoBERTa model. CatIss
classifies issue reports into three main categories of Bug reports,
Enhancement/feature requests, and Questions. First, the datasets provided for
the NLBSE tool competition are cleaned and preprocessed. Then, the pre-trained
RoBERTa model is fine-tuned on the preprocessed dataset. Evaluating CatIss on
about 80 thousand issue reports from GitHub, indicates that it performs very
well surpassing the competition baseline, TicketTagger, and achieving 87.2%
F1-score (micro average). Additionally, as CatIss is trained on a wide set of
repositories, it is a generic prediction model, hence applicable for any unseen
software project or projects with little historical data. Scripts for cleaning
the datasets, training CatIss, and evaluating the model are publicly available.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2022 17:20:58 GMT'}]",2022-04-01,"[['Izadi', 'Maliheh', '']]","['Issue report Management', 'Classification', 'Repositories', 'Transformers', 'Machine Learning', 'Natural Language Processing']"
7167,1710.08147,Bin Han,"Bin Han, Longbao Wang, Hans D. Schotten","A 3D Human Body Blockage Model for Outdoor Millimeter-Wave Cellular
  Communication","Accepted by Physical Communication, in press",Physical Communication 25P2 (2017) pp. 502-510,10.1016/j.phycom.2017.10.008,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Blocking is one of the most important challenges in exploiting
millimeter-wave for fifth-generation (5G) cellular communication systems.
Compared to blockages caused by buildings or terrains, human body blockage
exhibits a higher complexity due to the mobility and dynamic statistics of
humans. To support development of outdoor millimeter-wave cellular systems, in
this paper we present a novel 3D physical model of human body blockage. Based
on the proposed model, the impact of human body blockage on frame-based data
transmission is discussed, with respect to the system specifications and
environment conditions.
","[{'version': 'v1', 'created': 'Mon, 23 Oct 2017 08:47:36 GMT'}]",2017-11-29,"[['Han', 'Bin', ''], ['Wang', 'Longbao', ''], ['Schotten', 'Hans D.', '']]","['Millimeter-Wave', 'Channel Modeling', 'Line-of-Sight', 'HumanBody Blockage', '5G']"
7168,2110.12396,Hacer Yalim Keles,Ozge Mercanoglu Sincan and Hacer Yalim Keles,"Using Motion History Images with 3D Convolutional Networks in Isolated
  Sign Language Recognition",,,10.1109/ACCESS.2022.3151362,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Sign language recognition using computational models is a challenging problem
that requires simultaneous spatio-temporal modeling of the multiple sources,
i.e. faces, hands, body, etc. In this paper, we propose an isolated sign
language recognition model based on a model trained using Motion History Images
(MHI) that are generated from RGB video frames. RGB-MHI images represent
spatio-temporal summary of each sign video effectively in a single RGB image.
We propose two different approaches using this RGB-MHI model. In the first
approach, we use the RGB-MHI model as a motion-based spatial attention module
integrated into a 3D-CNN architecture. In the second approach, we use RGB-MHI
model features directly with the features of a 3D-CNN model using a late fusion
technique. We perform extensive experiments on two recently released
large-scale isolated sign language datasets, namely AUTSL and BosphorusSign22k.
Our experiments show that our models, which use only RGB data, can compete with
the state-of-the-art models in the literature that use multi-modal data.
","[{'version': 'v1', 'created': 'Sun, 24 Oct 2021 09:25:28 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Feb 2022 15:38:54 GMT'}]",2022-02-21,"[['Sincan', 'Ozge Mercanoglu', ''], ['Keles', 'Hacer Yalim', '']]","['3D-CNN', 'attention', 'deep learning', 'motion history image', 'sign language recognition']"
7169,1904.12597,Guillaume Noyel,"Guillaume Noyel (IPRI, SIGPH@iPRI), Michel Jourlin (IPRI)","Region homogeneity in the Logarithmic Image Processing framework:
  application to region growing algorithms",The original publication is available at www.ias-iss.org,"Image Analysis and Stereology, International Society for
  Stereology, 2019, 38 (1), pp.43-52",10.5566/ias.2038,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to create an image segmentation method robust to lighting changes,
two novel homogeneity criteria of an image region were studied. Both were
defined using the Logarithmic Image Processing (LIP) framework whose laws model
lighting changes. The first criterion estimates the LIP-additive homogeneity
and is based on the LIP-additive law. It is theoretically insensitive to
lighting changes caused by variations of the camera exposure-time or source
intensity. The second, the LIP-multiplicative homogeneity criterion, is based
on the LIP-multiplicative law and is insensitive to changes due to variations
of the object thickness or opacity. Each criterion is then applied in Revol and
Jourlin's (1997) region growing method which is based on the homogeneity of an
image region. The region growing method becomes therefore robust to the
lighting changes specific to each criterion. Experiments on simulated and on
real images presenting lighting variations prove the robustness of the criteria
to those variations. Compared to a state-of the art method based on the image
component-tree, ours is more robust. These results open the way to numerous
applications where the lighting is uncontrolled or partially controlled.
","[{'version': 'v1', 'created': 'Wed, 17 Apr 2019 12:34:28 GMT'}]",2019-04-30,"[['Noyel', 'Guillaume', '', 'IPRI, SIGPH@iPRI'], ['Jourlin', 'Michel', '', 'IPRI']]","['Homogeneity of an image region', 'Image segmentation', 'Logarithmic Image Processing', 'RegionGrowing', 'Robustness to lighting changes']"
7170,2001.04187,"Rainer St\""utz","Rainer St\""utz (1), Peter Ga\v{z}i (2), Bernhard Haslhofer (1), Jacob
  Illum (3) ((1) AIT Austrian Institute of Technology, (2) IOHK, (3)
  Chainalysis)",Stake Shift in Major Cryptocurrencies: An Empirical Study,"20 pages, 8 figures, 2 tables, paper accepted for publication at
  Financial Cryptography and Data Security 2020 (FC 2020, see
  https://fc20.ifca.ai)",,10.1007/978-3-030-51280-4_7,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the proof-of-stake (PoS) paradigm for maintaining decentralized,
permissionless cryptocurrencies, Sybil attacks are prevented by basing the
distribution of roles in the protocol execution on the stake distribution
recorded in the ledger itself. However, for various reasons this distribution
cannot be completely up-to-date, introducing a gap between the present stake
distribution, which determines the parties' current incentives, and the one
used by the protocol. In this paper, we investigate this issue, and empirically
quantify its effects. We survey existing provably secure PoS proposals to
observe that the above time gap between the two stake distributions, which we
call stake distribution lag, amounts to several days for each of these
protocols. Based on this, we investigate the ledgers of four major
cryptocurrencies (Bitcoin, Bitcoin Cash, Litecoin and Zcash) and compute the
average stake shift (the statistical distance of the two distributions) for
each value of stake distribution lag between 1 and 14 days, as well as related
statistics. We also empirically quantify the sublinear growth of stake shift
with the length of the considered lag interval. Finally, we turn our attention
to unusual stake-shift spikes in these currencies: we observe that hard forks
trigger major stake shifts and that single real-world actors, mostly exchanges,
account for major stake shifts in established cryptocurrency ecosystems.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2020 12:38:27 GMT'}]",2020-09-10,"[['Stütz', 'Rainer', ''], ['Gaži', 'Peter', ''], ['Haslhofer', 'Bernhard', ''], ['Illum', 'Jacob', '']]","['cryptocurrencies', 'blockchain', 'stake shift', 'proof of stake']"
7171,1905.01614,Farhana Sultana,"F. Sultana, A. Sufian, P. Dutta","A Review of Object Detection Models based on Convolutional Neural
  Network","17 pages, 11 figures, 1 table","Intelligent Computing: Image Processing Based Applications.
  Advances in Intelligent Systems and Computing, vol 1157, pages 1-16, 2020",10.1007/978-981-15-4288-6_1,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convolutional Neural Network (CNN) has become the state-of-the-art for object
detection in image task. In this chapter, we have explained different
state-of-the-art CNN based object detection models. We have made this review
with categorization those detection models according to two different
approaches: two-stage approach and one-stage approach. Through this chapter, it
has shown advancements in object detection models from R-CNN to latest
RefineDet. It has also discussed the model description and training details of
each model. Here, we have also drawn a comparison among those models.
","[{'version': 'v1', 'created': 'Sun, 5 May 2019 05:45:21 GMT'}, {'version': 'v2', 'created': 'Fri, 10 May 2019 15:50:21 GMT'}, {'version': 'v3', 'created': 'Tue, 1 Oct 2019 10:27:07 GMT'}]",2020-06-15,"[['Sultana', 'F.', ''], ['Sufian', 'A.', ''], ['Dutta', 'P.', '']]","['Convolutional Neural Network', 'Deep Learning', 'Mask RCNN', 'Object Detection', 'R-CNN', 'RetinaNet', 'Review', 'YOLO']"
7172,2108.04585,Fabio Bonassi,"Fabio Bonassi, Riccardo Scattolini","Recurrent Neural Network-based Internal Model Control design for stable
  nonlinear systems","Copyright 2022. This manuscript version is made available under the
  CC-BY-NC-ND 4.0 license. This manuscript has been published at Elsevier
  European Journal of Control. Published article available at DOI
  10.1016/j.ejcon.2022.100632",European Journal of Control (2022) 100632,10.1016/j.ejcon.2022.100632,,cs.LG cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Owing to their superior modeling capabilities, gated Recurrent Neural
Networks, such as Gated Recurrent Units (GRUs) and Long Short-Term Memory
networks (LSTMs), have become popular tools for learning dynamical systems.
This paper aims to discuss how these networks can be adopted for the synthesis
of Internal Model Control (IMC) architectures. To this end, first a gated
recurrent network is used to learn a model of the unknown input-output stable
plant. Then, a controller gated recurrent network is trained to approximate the
model inverse. The stability of these networks, ensured by means of a suitable
training procedure, allows to guarantee the input-output closed-loop stability.
The proposed scheme is able to cope with the saturation of the control
variables, and can be deployed on low-power embedded controllers, as it
requires limited online computations. The approach is then tested on the
Quadruple Tank benchmark system and compared to alternative control laws,
resulting in remarkable closed-loop performances.
","[{'version': 'v1', 'created': 'Tue, 10 Aug 2021 11:02:25 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Jan 2022 14:27:26 GMT'}, {'version': 'v3', 'created': 'Thu, 17 Mar 2022 12:56:00 GMT'}]",2022-03-18,"[['Bonassi', 'Fabio', ''], ['Scattolini', 'Riccardo', '']]","['Recurrent Neural Network', 'Internal Model Control', 'Neurocontrollers']"
7173,2110.12679,Weiqiang Jin,"Weiqiang Jin, Biao Zhao, Hang Yu, Xi Tao, Ruiping Yin, Guizhong Liu","Improving Embedded Knowledge Graph Multi-hop Question Answering by
  introducing Relational Chain Reasoning","38 pages, 5 figures; about 67 references",Data Mining and Knowledge Discovery (2022),10.1007/s10618-022-00891-8,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge Graph Question Answering (KGQA) aims to answer user-questions from
a knowledge graph (KG) by identifying the reasoning relations between topic
entity and answer. As a complex branch task of KGQA, multi-hop KGQA requires
reasoning over the multi-hop relational chain preserved in KG to arrive at the
right answer. Despite recent successes, the existing works on answering
multi-hop complex questions still face the following challenges: i) The absence
of an explicit relational chain order reflected in user-question stems from a
misunderstanding of a user's intentions. ii) Incorrectly capturing relational
types on weak supervision of which dataset lacks intermediate reasoning chain
annotations due to expensive labeling cost. iii) Failing to consider implicit
relations between the topic entity and the answer implied in structured KG
because of limited neighborhoods size constraint in subgraph retrieval-based
algorithms.To address these issues in multi-hop KGQA, we propose a novel model
herein, namely Relational Chain based Embedded KGQA (Rce-KGQA), which
simultaneously utilizes the explicit relational chain revealed in natural
language question and the implicit relational chain stored in structured KG.
Our extensive empirical study on three open-domain benchmarks proves that our
method significantly outperforms the state-of-the-art counterparts like
GraftNet, PullNet and EmbedKGQA. Comprehensive ablation experiments also verify
the effectiveness of our method on the multi-hop KGQA task. We have made our
model's source code available at github:
https://github.com/albert-jin/Rce-KGQA.
","[{'version': 'v1', 'created': 'Mon, 25 Oct 2021 06:53:02 GMT'}, {'version': 'v2', 'created': 'Sat, 22 Jan 2022 06:03:42 GMT'}, {'version': 'v3', 'created': 'Sun, 13 Nov 2022 04:32:54 GMT'}]",2022-11-15,"[['Jin', 'Weiqiang', ''], ['Zhao', 'Biao', ''], ['Yu', 'Hang', ''], ['Tao', 'Xi', ''], ['Yin', 'Ruiping', ''], ['Liu', 'Guizhong', '']]","['Data Mining and Search', 'Question Answering', 'Knowledge Graphbased Multi-hop QA', 'Neural Semantic Parsing', 'Knowledge Graph Embedding']"
7174,1903.06925,Srdjan Matic,Srdjan Matic and Gareth Tyson and Gianluca Stringhini,"Pythia: a Framework for the Automated Analysis of Web Hosting
  Environments",,,10.1145/3308558.3313664,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A common approach when setting up a website is to utilize third party Web
hosting and content delivery networks. Without taking this trend into account,
any measurement study inspecting the deployment and operation of websites can
be heavily skewed. Unfortunately, the research community lacks generalizable
tools that can be used to identify how and where a given website is hosted.
Instead, a number of ad hoc techniques have emerged, e.g., using Autonomous
System databases, domain prefixes for CNAME records. In this work we propose
Pythia, a novel lightweight approach for identifying Web content hosted on
third-party infrastructures, including both traditional Web hosts and content
delivery networks. Our framework identifies the organization to which a given
Web page belongs, and it detects which Web servers are self-hosted and which
ones leverage third-party services to provide contents. To test our framework
we run it on 40,000 URLs and evaluate its accuracy, both by comparing the
results with similar services and with a manually validated groundtruth. Our
tool achieves an accuracy of 90% and detects that under 11% of popular domains
are self-hosted. We publicly release our tool to allow other researchers to
reproduce our findings, and to apply it to their own studies.
","[{'version': 'v1', 'created': 'Sat, 16 Mar 2019 13:57:29 GMT'}, {'version': 'v2', 'created': 'Mon, 13 May 2019 14:20:00 GMT'}]",2019-05-14,"[['Matic', 'Srdjan', ''], ['Tyson', 'Gareth', ''], ['Stringhini', 'Gianluca', '']]","['CDNs', 'infrastructure', 'topology', 'web']"
7175,2006.04967,Abdulkadir \c{S}eker,"Abdulkadir \c{S}eker, Banu Diri, Halil Arslan","Summarising Big Data: Common GitHub Dataset for Software Engineering
  Challenges","7 pages, The article was submitted to Cumhuriyet Science Journal","Cumhuriyet Science Journal, 41, (2020), 720-724",10.17776/csj.728932,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In open-source software development environments; textual, numerical and
relationship-based data generated are of interest to researchers. Various data
sets are available for this data, which is frequently used in areas such as
software engineering and natural language processing. However, since these data
sets contain all the data in the environment, the problem arises in the
terabytes of data processing. For this reason, almost all of the studies using
GitHub data use filtered data according to certain criteria. In this context,
using a different data set in each study makes a comparison of the accuracy of
the studies quite difficult. In order to solve this problem, a common dataset
was created and shared with the researchers, which would allow us to work on
many software engineering problems.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2020 22:21:25 GMT'}]",2020-10-01,"[['Şeker', 'Abdulkadir', ''], ['Diri', 'Banu', ''], ['Arslan', 'Halil', '']]","['GitHub', 'ghtorrent', 'big data', 'MongoDB']"
7176,2104.14060,Yunxiang Zhao,Yunxiang Zhao and Jianzhong Qi and Qingwei Liu and Rui Zhang,WGCN: Graph Convolutional Networks with Weighted Structural Features,,,10.1145/3404835.3462834,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph structural information such as topologies or connectivities provides
valuable guidance for graph convolutional networks (GCNs) to learn nodes'
representations. Existing GCN models that capture nodes' structural information
weight in- and out-neighbors equally or differentiate in- and out-neighbors
globally without considering nodes' local topologies. We observe that in- and
out-neighbors contribute differently for nodes with different local topologies.
To explore the directional structural information for different nodes, we
propose a GCN model with weighted structural features, named WGCN. WGCN first
captures nodes' structural fingerprints via a direction and degree aware Random
Walk with Restart algorithm, where the walk is guided by both edge direction
and nodes' in- and out-degrees. Then, the interactions between nodes'
structural fingerprints are used as the weighted node structural features. To
further capture nodes' high-order dependencies and graph geometry, WGCN embeds
graphs into a latent space to obtain nodes' latent neighbors and geometrical
relationships. Based on nodes' geometrical relationships in the latent space,
WGCN differentiates latent, in-, and out-neighbors with an attention-based
geometrical aggregation. Experiments on transductive node classification tasks
show that WGCN outperforms the baseline models consistently by up to 17.07% in
terms of accuracy on five benchmark datasets.
","[{'version': 'v1', 'created': 'Thu, 29 Apr 2021 00:50:06 GMT'}, {'version': 'v2', 'created': 'Mon, 31 May 2021 14:17:20 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Jul 2021 05:07:21 GMT'}]",2021-07-22,"[['Zhao', 'Yunxiang', ''], ['Qi', 'Jianzhong', ''], ['Liu', 'Qingwei', ''], ['Zhang', 'Rui', '']]","['Directional Graph Convolutional Networks', 'Structural Information', 'Random Walk with Restart']"
7177,2101.10913,Min Yan,"Min Yan, Guoshan Zhang, Tong Zhang, Yueming Zhang","Nondiscriminatory Treatment: a straightforward framework for multi-human
  parsing",,"Neurocomputing, 2021, 460: 126-138",10.1016/j.neucom.2021.07.023,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-human parsing aims to segment every body part of every human instance.
Nearly all state-of-the-art methods follow the ""detection first"" or
""segmentation first"" pipelines. Different from them, we present an end-to-end
and box-free pipeline from a new and more human-intuitive perspective. In
training time, we directly do instance segmentation on humans and parts. More
specifically, we introduce a notion of ""indiscriminate objects with categorie""
which treats humans and parts without distinction and regards them both as
instances with categories. In the mask prediction, each binary mask is obtained
by a combination of prototypes shared among all human and part categories. In
inference time, we design a brand-new grouping post-processing method that
relates each part instance with one single human instance and groups them
together to obtain the final human-level parsing result. We name our method as
Nondiscriminatory Treatment between Humans and Parts for Human Parsing (NTHP).
Experiments show that our network performs superiorly against state-of-the-art
methods by a large margin on the MHP v2.0 and PASCAL-Person-Part datasets.
","[{'version': 'v1', 'created': 'Tue, 26 Jan 2021 16:31:21 GMT'}]",2022-01-05,"[['Yan', 'Min', ''], ['Zhang', 'Guoshan', ''], ['Zhang', 'Tong', ''], ['Zhang', 'Yueming', '']]","['Multiple Human Parsing', 'Mask Prototypes', 'Instance Segmentation']"
7178,2208.06100,Junjie Li,"Junjie Li, Zilei Wang, Yuan Gao, Xiaoming Hu","Exploring High-quality Target Domain Information for Unsupervised Domain
  Adaptive Semantic Segmentation",,,10.1145/3503161.3548114,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In unsupervised domain adaptive (UDA) semantic segmentation, the distillation
based methods are currently dominant in performance. However, the distillation
technique requires complicate multi-stage process and many training tricks.
  In this paper, we propose a simple yet effective method that can achieve
competitive performance to the advanced distillation methods. Our core idea is
to fully explore the target-domain information from the views of boundaries and
features.
  First, we propose a novel mix-up strategy to generate high-quality
target-domain boundaries with ground-truth labels. Different from the
source-domain boundaries in previous works, we select the high-confidence
target-domain areas and then paste them to the source-domain images. Such a
strategy can generate the object boundaries in target domain (edge of
target-domain object areas) with the correct labels. Consequently, the boundary
information of target domain can be effectively captured by learning on the
mixed-up samples.
  Second, we design a multi-level contrastive loss to improve the
representation of target-domain data, including pixel-level and prototype-level
contrastive learning.
  By combining two proposed methods, more discriminative features can be
extracted and hard object boundaries can be better addressed for the target
domain.
  The experimental results on two commonly adopted benchmarks (\textit{i.e.},
GTA5 $\rightarrow$ Cityscapes and SYNTHIA $\rightarrow$ Cityscapes) show that
our method achieves competitive performance to complicated distillation
methods. Notably, for the SYNTHIA$\rightarrow$ Cityscapes scenario, our method
  achieves the state-of-the-art performance with $57.8\%$ mIoU and $64.6\%$
mIoU on 16 classes and 13 classes. Code is available at
https://github.com/ljjcoder/EHTDI.
","[{'version': 'v1', 'created': 'Fri, 12 Aug 2022 03:41:38 GMT'}]",2022-08-15,"[['Li', 'Junjie', ''], ['Wang', 'Zilei', ''], ['Gao', 'Yuan', ''], ['Hu', 'Xiaoming', '']]","['unsupervised domain adaptive semantic segmentation', 'contrastivelearning', 'pseudo labels']"
7179,2107.01284,Fahim Faisal Niloy,"Fahim Faisal Niloy, Arif, Abu Bakar Siddik Nayem, Anis Sarker, Ovi
  Paul, M. Ashraful Amin, Amin Ahsan Ali, Moinul Islam Zaber, AKM Mahbubur
  Rahman","A Novel Disaster Image Dataset and Characteristics Analysis using
  Attention Model",ICPR 2020,,10.1109/ICPR48806.2021.9412504,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The advancement of deep learning technology has enabled us to develop systems
that outperform any other classification technique. However, success of any
empirical system depends on the quality and diversity of the data available to
train the proposed system. In this research, we have carefully accumulated a
relatively challenging dataset that contains images collected from various
sources for three different disasters: fire, water and land. Besides this, we
have also collected images for various damaged infrastructure due to natural or
man made calamities and damaged human due to war or accidents. We have also
accumulated image data for a class named non-damage that contains images with
no such disaster or sign of damage in them. There are 13,720 manually annotated
images in this dataset, each image is annotated by three individuals. We are
also providing discriminating image class information annotated manually with
bounding box for a set of 200 test images. Images are collected from different
news portals, social media, and standard datasets made available by other
researchers. A three layer attention model (TLAM) is trained and average five
fold validation accuracy of 95.88% is achieved. Moreover, on the 200 unseen
test images this accuracy is 96.48%. We also generate and compare attention
maps for these test images to determine the characteristics of the trained
attention model. Our dataset is available at
https://niloy193.github.io/Disaster-Dataset
","[{'version': 'v1', 'created': 'Fri, 2 Jul 2021 21:18:20 GMT'}]",2021-07-06,"[['Niloy', 'Fahim Faisal', ''], ['Arif', '', ''], ['Nayem', 'Abu Bakar Siddik', ''], ['Sarker', 'Anis', ''], ['Paul', 'Ovi', ''], ['Amin', 'M. Ashraful', ''], ['Ali', 'Amin Ahsan', ''], ['Zaber', 'Moinul Islam', ''], ['Rahman', 'AKM Mahbubur', '']]","['Disaster Image', 'Attention Model', 'Class Activation Map', 'Three Layer Attention Module']"
7180,2205.09552,Nyasha Masamba,"Nyasha Masamba, Kerstin Eder, Tim Blackmore",Hybrid Intelligent Testing in Simulation-Based Verification,,"2022 IEEE International Conference On Artificial Intelligence
  Testing (AITest), 2022, pp. 26-33",10.1109/AITest55621.2022.00013,,cs.AR cs.AI cs.LG cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Efficient and effective testing for simulation-based hardware verification is
challenging. Using constrained random test generation, several millions of
tests may be required to achieve coverage goals. The vast majority of tests do
not contribute to coverage progress, yet they consume verification resources.
In this paper, we propose a hybrid intelligent testing approach combining two
methods that have previously been treated separately, namely Coverage-Directed
Test Selection and Novelty-Driven Verification. Coverage-Directed Test
Selection learns from coverage feedback to bias testing toward the most
effective tests. Novelty-Driven Verification learns to identify and simulate
stimuli that differ from previous stimuli, thereby reducing the number of
simulations and increasing testing efficiency. We discuss the strengths and
limitations of each method, and we show how our approach addresses each
method's limitations, leading to hardware testing that is both efficient and
effective.
","[{'version': 'v1', 'created': 'Thu, 19 May 2022 13:22:08 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Jun 2022 16:59:13 GMT'}, {'version': 'v3', 'created': 'Sun, 16 Oct 2022 16:21:40 GMT'}]",2022-10-18,"[['Masamba', 'Nyasha', ''], ['Eder', 'Kerstin', ''], ['Blackmore', 'Tim', '']]","['Design Verification', 'Intelligent Testing', 'CoverageDirected Test Selection', 'Novelty-Driven Verification', 'MachineLearning for Verification', 'CDS', 'CDG', 'EDA']"
7181,1710.01408,Mohammed Yousefhussien,"Mohammed Yousefhussien, David J. Kelbe, Emmett J. Ientilucci and Carl
  Salvaggio",A Fully Convolutional Network for Semantic Labeling of 3D Point Clouds,,"ISPRS Journal of Photogrammetry and Remote Sensing, 2018",10.1016/j.isprsjprs.2018.03.018,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When classifying point clouds, a large amount of time is devoted to the
process of engineering a reliable set of features which are then passed to a
classifier of choice. Generally, such features - usually derived from the
3D-covariance matrix - are computed using the surrounding neighborhood of
points. While these features capture local information, the process is usually
time-consuming, and requires the application at multiple scales combined with
contextual methods in order to adequately describe the diversity of objects
within a scene. In this paper we present a 1D-fully convolutional network that
consumes terrain-normalized points directly with the corresponding spectral
data,if available, to generate point-wise labeling while implicitly learning
contextual features in an end-to-end fashion. Our method uses only the
3D-coordinates and three corresponding spectral features for each point.
Spectral features may either be extracted from 2D-georeferenced images, as
shown here for Light Detection and Ranging (LiDAR) point clouds, or extracted
directly for passive-derived point clouds,i.e. from muliple-view imagery. We
train our network by splitting the data into square regions, and use a pooling
layer that respects the permutation-invariance of the input points. Evaluated
using the ISPRS 3D Semantic Labeling Contest, our method scored second place
with an overall accuracy of 81.6%. We ranked third place with a mean F1-score
of 63.32%, surpassing the F1-score of the method with highest accuracy by
1.69%. In addition to labeling 3D-point clouds, we also show that our method
can be easily extended to 2D-semantic segmentation tasks, with promising
initial results.
","[{'version': 'v1', 'created': 'Tue, 3 Oct 2017 22:35:25 GMT'}]",2020-05-22,"[['Yousefhussien', 'Mohammed', ''], ['Kelbe', 'David J.', ''], ['Ientilucci', 'Emmett J.', ''], ['Salvaggio', 'Carl', '']]","['LiDAR', '3D-Labeling Contest', 'Deep Learning']"
7182,2204.04704,Aatif Jamshed Mr.,"Aatif Jamshed, Bhawna Mallick, Rajendra Kumar Bharti","An Efficient Pattern Mining Convolution Neural Network (CNN) algorithm
  with Grey Wolf Optimization (GWO)",,The Imaging Science Journal 2023,10.1080/13682199.2023.2166193,,cs.CV cs.AI,http://creativecommons.org/publicdomain/zero/1.0/,"  Automation of feature analysis in the dynamic image frame dataset deals with
complexity of intensity mapping with normal and abnormal class. The
threshold-based data clustering and feature analysis requires iterative model
to learn the component of image frame in multi-pattern for different image
frame data type. This paper proposed a novel model of feature analysis method
with the CNN based on Convoluted Pattern of Wavelet Transform (CPWT) feature
vectors that are optimized by Grey Wolf Optimization (GWO) algorithm.
Initially, the image frame gets normalized by applying median filter to the
image frame that reduce the noise and apply smoothening on it. From that, the
edge information represents the boundary region of bright spot in the image
frame. Neural network-based image frame classification performs repeated
learning of the feature with minimum training of dataset to cluster the image
frame pixels. Features of the filtered image frame was analyzed in different
pattern of feature extraction model based on the convoluted model of wavelet
transformation method. These features represent the different class of image
frame in spatial and textural pattern of it. Convolutional Neural Network (CNN)
classifier supports to analyze the features and classify the action label for
the image frame dataset. This process enhances the classification with minimum
number of training dataset. The performance of this proposed method can be
validated by comparing with traditional state-of-art methods.
","[{'version': 'v1', 'created': 'Sun, 10 Apr 2022 15:18:42 GMT'}]",2023-01-20,"[['Jamshed', 'Aatif', ''], ['Mallick', 'Bhawna', ''], ['Bharti', 'Rajendra Kumar', '']]","['Action Recognition', 'Pattern Recognition system', 'Convoluted Pattern of Wavelet Transform (CPWT)', 'Grey Wolf']"
7183,2109.09451,Murdoch Gabbay,"Murdoch Gabbay, Arvid Jakobsson, Kristina Sojakova",Money grows on (proof-)trees: the formal FA1.2 ledger standard,,,10.4230/OASIcs.FMBC.2021.2,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Once you have invented digital money, you may need a ledger to track who owns
what -- and an interface to that ledger so that users of your money can
transact. On the Tezos blockchain this implies: a smart contract (distributed
program), storing in its state a ledger to map owner addresses to token
quantities, and standardised entrypoints to transact on accounts.
  A bank does a similar job -- it maps account numbers to account quantities
and permits users to transact -- but in return the bank demands trust, it
incurs expense to maintain a centralised server and staff, it uses a
proprietary interface ... and it may speculate using your money and/or display
rent-seeking behaviour. A blockchain ledger is by design decentralised,
inexpensive, open, and it won't just bet your tokens on risky derivatives
(unless you ask).
  The FA1.2 standard is an open standard for ledger-keeping smart contracts on
the Tezos blockchain. Several FA1.2 implementations already exist.
  Or do they? Is the standard sensible and complete? Are the implementations
correct? And what are they implementations \emph{of}? The FA1.2 standard is
written in English, a specification language favoured by wet human brains but
notorious for its incompleteness and ambiguity when rendered into dry and
unforgiving code.
  In this paper we report on a formalisation of the FA1.2 standard as a Coq
specification, and on a formal verification of three FA1.2-compliant smart
contracts with respect to that specification. Errors were found and ambiguities
were resolved; but also, there now exists a \emph{mathematically precise} and
battle-tested specification of the FA1.2 ledger standard.
  We will describe FA1.2 itself, outline the structure of the Coq theories --
which in itself captures some non-trivial and novel design decisions of the
development -- and review the detailed verification of the implementations.
","[{'version': 'v1', 'created': 'Mon, 20 Sep 2021 12:11:30 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Dec 2021 16:23:14 GMT'}]",2021-12-02,"[['Gabbay', 'Murdoch', ''], ['Jakobsson', 'Arvid', ''], ['Sojakova', 'Kristina', '']]","['Distributed ledger', 'smart contracts', 'Coq', 'formal verification', 'blockchain']"
7184,2206.12303,Tiziano Bacci,"Tiziano Bacci, Sara Mattia and Paolo Ventura",The Bounded Beam Search algorithm for the Block Relocation Problem,,,10.1016/j.cor.2018.11.008,,cs.OH cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we deal with the restricted Block Relocation Problem. We
present a new lower bound and a heuristic approach for the problem. The
proposed lower bound can be computed in polynomial time and it is provably
better than some previously known lower bounds. We use it within a bounded beam
search algorithm to solve the Block Relocation Problem and show that the
considered heuristic approach outperforms the other existing algorithms on most
of the instances in the literature. In order to test the approaches on
real-size dimensions, new large instances of the Block Relocation Problem are
also introduced.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2022 08:46:31 GMT'}]",2022-06-27,"[['Bacci', 'Tiziano', ''], ['Mattia', 'Sara', ''], ['Ventura', 'Paolo', '']]","['Block Relocation', 'Container Relocation', 'Beam Search', 'Lower Bound', 'Heuristics', 'Realistic Instances']"
7185,2012.01987,Mark Scanlon,"Xiaoyu Du, Chris Hargreaves, John Sheppard, Felix Anda, Asanka
  Sayakkara, Nhien-An Le-Khac, Mark Scanlon","SoK: Exploring the State of the Art and the Future Potential of
  Artificial Intelligence in Digital Forensic Investigation",,"The 15th International ARES Conference on Availability,
  Reliability and Security, August 25--28, 2020",10.1145/3407023.3407068,,cs.CR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Multi-year digital forensic backlogs have become commonplace in law
enforcement agencies throughout the globe. Digital forensic investigators are
overloaded with the volume of cases requiring their expertise compounded by the
volume of data to be processed. Artificial intelligence is often seen as the
solution to many big data problems. This paper summarises existing artificial
intelligence based tools and approaches in digital forensics. Automated
evidence processing leveraging artificial intelligence based techniques shows
great promise in expediting the digital forensic analysis process while
increasing case processing capacities. For each application of artificial
intelligence highlighted, a number of current challenges and future potential
impact is discussed.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2020 12:07:21 GMT'}]",2020-12-04,"[['Du', 'Xiaoyu', ''], ['Hargreaves', 'Chris', ''], ['Sheppard', 'John', ''], ['Anda', 'Felix', ''], ['Sayakkara', 'Asanka', ''], ['Le-Khac', 'Nhien-An', ''], ['Scanlon', 'Mark', '']]","['Digital Forensics', 'Machine Learning', 'Deep Learning']"
7186,2107.11597,Omar Al-Harbi Mohammad,Omar Al-Harbi,"Negation Handling in Machine Learning-Based Sentiment Classification for
  Colloquial Arabic",13 pages,"International Journal of Operations Research and Information
  Systems (2020) 33-45",10.4018/IJORIS.2020100102,,cs.CL,http://creativecommons.org/publicdomain/zero/1.0/,"  One crucial aspect of sentiment analysis is negation handling, where the
occurrence of negation can flip the sentiment of a sentence and negatively
affects the machine learning-based sentiment classification. The role of
negation in Arabic sentiment analysis has been explored only to a limited
extent, especially for colloquial Arabic. In this paper, the author addresses
the negation problem of machine learning-based sentiment classification for a
colloquial Arabic language. To this end, we propose a simple rule-based
algorithm for handling the problem; the rules were crafted based on observing
many cases of negation. Additionally, simple linguistic knowledge and sentiment
lexicon are used for this purpose. The author also examines the impact of the
proposed algorithm on the performance of different machine learning algorithms.
The results given by the proposed algorithm are compared with three baseline
models. The experimental results show that there is a positive impact on the
classifiers accuracy, precision and recall when the proposed algorithm is used
compared to the baselines.
","[{'version': 'v1', 'created': 'Sat, 24 Jul 2021 13:12:37 GMT'}]",2021-07-27,"[['Al-Harbi', 'Omar', '']]","['Arabic Sentiment Analysis', 'Negation', 'Colloquial Arabic Language', 'Machine Learning', 'Sentiment Lexicon']"
7187,2003.11940,Jiuyong Li,"Jiuyong Li, Weijia Zhang, Lin Liu, Kui Yu, Thuc Duy Le and Jixue Liu",A general framework for causal classification,"International Journal of Data Science and Analytics (2021). arXiv
  admin note: text overlap with arXiv:1604.07212 by other authors",,10.1007/s41060-021-00249-1,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many applications, there is a need to predict the effect of an
intervention on different individuals from data. For example, which customers
are persuadable by a product promotion? which patients should be treated with a
certain type of treatment? These are typical causal questions involving the
effect or the change in outcomes made by an intervention. The questions cannot
be answered with traditional classification methods as they only use
associations to predict outcomes. For personalised marketing, these questions
are often answered with uplift modelling. The objective of uplift modelling is
to estimate causal effect, but its literature does not discuss when the uplift
represents causal effect. Causal heterogeneity modelling can solve the problem,
but its assumption of unconfoundedness is untestable in data. So practitioners
need guidelines in their applications when using the methods. In this paper, we
use causal classification for a set of personalised decision making problems,
and differentiate it from classification. We discuss the conditions when causal
classification can be resolved by uplift (and causal heterogeneity) modelling
methods. We also propose a general framework for causal classification, by
using off-the-shelf supervised methods for flexible implementations.
Experiments have shown two instantiations of the framework work for causal
classification and for uplift (causal heterogeneity) modelling, and are
competitive with the other uplift (causal heterogeneity) modelling methods.
","[{'version': 'v1', 'created': 'Wed, 25 Mar 2020 11:40:22 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Mar 2020 00:53:53 GMT'}, {'version': 'v3', 'created': 'Tue, 28 Jul 2020 02:12:11 GMT'}, {'version': 'v4', 'created': 'Mon, 15 Mar 2021 01:03:16 GMT'}]",2021-03-16,"[['Li', 'Jiuyong', ''], ['Zhang', 'Weijia', ''], ['Liu', 'Lin', ''], ['Yu', 'Kui', ''], ['Le', 'Thuc Duy', ''], ['Liu', 'Jixue', '']]","['Causal effect estimation', 'Causal heterogeneity', 'Uplift modelling']"
7188,2201.06974,Donald Shenaj,"Donald Shenaj, Francesco Barbato, Umberto Michieli, Pietro Zanuttigh",Continual Coarse-to-Fine Domain Adaptation in Semantic Segmentation,"24 pages, 9 figures, 6 tables, under submission",,10.1016/j.imavis.2022.104426,,cs.CV cs.AI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks are typically trained in a single shot for a specific
task and data distribution, but in real world settings both the task and the
domain of application can change. The problem becomes even more challenging in
dense predictive tasks, such as semantic segmentation, and furthermore most
approaches tackle the two problems separately. In this paper we introduce the
novel task of coarse-to-fine learning of semantic segmentation architectures in
presence of domain shift. We consider subsequent learning stages progressively
refining the task at the semantic level; i.e., the finer set of semantic labels
at each learning step is hierarchically derived from the coarser set of the
previous step. We propose a new approach (CCDA) to tackle this scenario. First,
we employ the maximum squares loss to align source and target domains and, at
the same time, to balance the gradients between well-classified and harder
samples. Second, we introduce a novel coarse-to-fine knowledge distillation
constraint to transfer network capabilities acquired on a coarser set of labels
to a set of finer labels. Finally, we design a coarse-to-fine weight
initialization rule to spread the importance from each coarse class to the
respective finer classes. To evaluate our approach, we design two benchmarks
where source knowledge is extracted from the GTA5 dataset and it is transferred
to either the Cityscapes or the IDD datasets, and we show how it outperforms
the main competitors.
","[{'version': 'v1', 'created': 'Tue, 18 Jan 2022 13:31:19 GMT'}]",2022-06-29,"[['Shenaj', 'Donald', ''], ['Barbato', 'Francesco', ''], ['Michieli', 'Umberto', ''], ['Zanuttigh', 'Pietro', '']]","['Coarse-to-Fine Learning', 'Unsupervised Domain Adaptation', 'Semantic Segmentation', 'Continual Learning', 'Deep Learning']"
7189,2110.06009,Chiara Boldrini,"Pavlos Paraskevopoulos, Chiara Boldrini, Andrea Passarella, Marco
  Conti",Dynamics of scientific collaboration networks due to academic migrations,"This work was partially funded by the following projects. European
  Union's Horizon 2020 research and innovation programme: SoBigData++ (No
  871042), HumaneAI-Net (No 952026), MARVEL (No 957337). Italian PON-MISE
  program: OK-INSAID project (No ARS01 00917)","In: Aref S. et al. (eds) Social Informatics. SocInfo 2020. Lecture
  Notes in Computer Science, vol 12467. Springer, Cham",10.1007/978-3-030-60975-7_21,,cs.DL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Academic migration is the change of host institution by a researcher,
typically aimed at achieving a stronger research profile. Scientific features
such as the number of collaborations, the productivity and its research impact
tend to be directly affected by such movements. In this paper, we analyse the
dynamics of the collaboration network of researchers as they move from an
institution to the next one. We specifically highlight cases where they
increase and when they shrink, and quantify the dependency between the
collaboration networks before and after such a movement. Finally, we drill down
the analysis by dividing movements depending on the career stage of the
researchers. The analysis shows a remarkable dynamism of collaboration networks
across migrations. Interestingly, not always movements result in larger
collaboration networks, while the overall similarity between networks across
movements is quite limited on average. Qualitatively, the same effects can be
found at all career stages, while, clearly, the magnitude of them might vary.
These results are based on a dataset extracted from Scopus, containing detailed
scientific information for the publications of 84,141 researchers.
","[{'version': 'v1', 'created': 'Tue, 12 Oct 2021 13:48:22 GMT'}]",2021-10-13,"[['Paraskevopoulos', 'Pavlos', ''], ['Boldrini', 'Chiara', ''], ['Passarella', 'Andrea', ''], ['Conti', 'Marco', '']]","['academic mobility', 'collaboration networks', 'Scopus dataset']"
7190,2006.09774,Max Bartunik,"Max Bartunik and Marco Fleischer and Werner Haselmayr and Jens
  Kirchner","Colour-Specific Microfluidic Droplet Detection for Molecular
  Communication",,,10.1145/3411295.3411304,,cs.ET eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Droplet-based microfluidic systems are a promising platform forlab-on-a-chip
(LoC) applications. These systems can also be used toenhance LoC applications
with integrated droplet control information or for data transmission scenarios
in the context of molecular communication. For both use-cases the detection and
characterisation of droplets in small microfluidic channels is crucial. So far,
only complex lab setups with restricted capabilities have been presented as
detection devices. We present a new low-cost and portable droplet detector. The
device is used to confidently distinguish between individual droplets in a
droplet-based microfluidic system. Using on-off keying a 16-bit sequence is
successfully transmittedfor the first time with such a setup. Furthermore, the
devices capabilities to characterise droplets regarding colour and size are
demonstrated. Such an application of a spectral sensor in a microfluidic system
presents new possibilities, such as colour-coded data transmission or analysis
of droplet content.
","[{'version': 'v1', 'created': 'Wed, 17 Jun 2020 10:53:23 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Jun 2020 09:35:04 GMT'}]",2021-01-12,"[['Bartunik', 'Max', ''], ['Fleischer', 'Marco', ''], ['Haselmayr', 'Werner', ''], ['Kirchner', 'Jens', '']]","['Droplet detection', 'microfluidic environment', 'molecular communication', 'colour', 'optical sensor']"
7191,2007.12861,Jiaming Zhang,"Jiaming Zhang, Jitao Sang, Xian Zhao, Xiaowen Huang, Yanfeng Sun,
  Yongli Hu",Adversarial Privacy-preserving Filter,Accepted by ACM Multimedia 2020,,10.1145/3394171.3413906,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While widely adopted in practical applications, face recognition has been
critically discussed regarding the malicious use of face images and the
potential privacy problems, e.g., deceiving payment system and causing personal
sabotage. Online photo sharing services unintentionally act as the main
repository for malicious crawler and face recognition applications. This work
aims to develop a privacy-preserving solution, called Adversarial
Privacy-preserving Filter (APF), to protect the online shared face images from
being maliciously used.We propose an end-cloud collaborated adversarial attack
solution to satisfy requirements of privacy, utility and nonaccessibility.
Specifically, the solutions consist of three modules: (1) image-specific
gradient generation, to extract image-specific gradient in the user end with a
compressed probe model; (2) adversarial gradient transfer, to fine-tune the
image-specific gradient in the server cloud; and (3) universal adversarial
perturbation enhancement, to append image-independent perturbation to derive
the final adversarial noise. Extensive experiments on three datasets validate
the effectiveness and efficiency of the proposed solution. A prototype
application is also released for further evaluation.We hope the end-cloud
collaborated attack framework could shed light on addressing the issue of
online multimedia sharing privacy-preserving issues from user side.
","[{'version': 'v1', 'created': 'Sat, 25 Jul 2020 05:41:00 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Aug 2020 05:12:11 GMT'}]",2020-08-05,"[['Zhang', 'Jiaming', ''], ['Sang', 'Jitao', ''], ['Zhao', 'Xian', ''], ['Huang', 'Xiaowen', ''], ['Sun', 'Yanfeng', ''], ['Hu', 'Yongli', '']]","['privacy-preserving', 'face recognition', 'adversarial example', 'photosharing']"
7192,2109.02386,Carlo Godoy Jr,Carlo H. Godoy Jr,Augmented Reality for Education: A Review,7 pages. arXiv admin note: text overlap with arXiv:2101.03683,Volume 5 Issue 6 June 2020,10.38124/IJISRT20JUN256,,cs.HC cs.CY cs.GT,http://creativecommons.org/licenses/by/4.0/,"  Augmented Reality, or simply AR, is the incorporation of information in
digital format that includes live footage of a certain user's real-time
environment. Also now, various universities are using Augmented Reality.
Applying the technology in the education sector can result in having a smart
campus. In line with that, this paper will discuss how Augmented Reality is
being used now in different learning areas.
","[{'version': 'v1', 'created': 'Sat, 7 Aug 2021 17:27:13 GMT'}]",2021-09-07,"[['Godoy', 'Carlo H.', 'Jr']]","['E-Learning', 'Mobile Game Application', 'GameBased Learning', 'Gamification']"
7193,2106.06332,Vivek Ramachandran,"Vivek Ramachandran, Fabian Schilling, Amy R Wu, Dario Floreano","Smart Textiles that Teach: Fabric-Based Haptic Device Improves the Rate
  of Motor Learning",,,10.1002/aisy.202100043,,cs.HC cs.RO,http://creativecommons.org/licenses/by/4.0/,"  People learn motor activities best when they are conscious of their errors
and make a concerted effort to correct them. While haptic interfaces can
facilitate motor training, existing interfaces are often bulky and do not
always ensure post-training skill retention. Here, we describe a programmable
haptic sleeve composed of textile-based electroadhesive clutches for skill
acquisition and retention. We show its functionality in a motor learning study
where users control a drone's movement using elbow joint rotation. Haptic
feedback is used to restrain elbow motion and make users aware of their errors.
This helps users consciously learn to avoid errors from occurring. While all
subjects exhibited similar performance during the baseline phase of motor
learning, those subjects who received haptic feedback from the haptic sleeve
committed 23.5% fewer errors than subjects in the control group during the
evaluation phase. The results show that the sleeve helps users retain and
transfer motor skills better than visual feedback alone. This work shows the
potential for fabric-based haptic interfaces as a training aid for motor tasks
in the fields of rehabilitation and teleoperation.
","[{'version': 'v1', 'created': 'Fri, 11 Jun 2021 12:08:55 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Jul 2021 18:47:10 GMT'}]",2021-07-14,"[['Ramachandran', 'Vivek', ''], ['Schilling', 'Fabian', ''], ['Wu', 'Amy R', ''], ['Floreano', 'Dario', '']]","['Wearable Haptics', 'Textile electronics', 'Motor learning']"
7194,1911.00248,"Ma\""elle Kabir-Querrec","Swe Geng, Georgia Giannopoulou, Ma\""elle Kabir-Querrec",Privacy Protection in Distributed Fingerprint-based Authentication,"This is an extended version of the paper with the same title which
  has been accepted for publication at the Workshop on Privacy in the
  Electronic Society (WPES 2019)",,10.1145/3338498.3358648,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Biometric authentication is getting increasingly popular due to the
convenience of using unique individual traits, such as fingerprints, palm
veins, irises. Especially fingerprints are widely used nowadays due to the
availability and low cost of fingerprint scanners. To avoid identity theft or
impersonation, fingerprint data is typically stored locally, e.g., in a trusted
hardware module, in a single device that is used for user enrollment and
authentication. Local storage, however, limits the ability to implement
distributed applications, in which users can enroll their fingerprint once and
use it to access multiple physical locations and mobile applications
afterwards.
  In this paper, we present a distributed authentication system that stores
fingerprint data in a server or cloud infrastructure in a privacy-preserving
way. Multiple devices can be connected and perform user enrollment or
verification. To secure the privacy and integrity of sensitive data, we employ
a cryptographic construct called fuzzy vault. We highlight challenges in
implementing fuzzy vault-based authentication, for which we propose and compare
alternative solutions. We conduct a security analysis of our biometric
cryptosystem, and as a proof of concept, we build an authentication system for
access control using resource-constrained devices (Raspberry Pis) connected to
fingerprint scanners and the Microsoft Azure cloud environment. Furthermore, we
evaluate the fingerprint matching algorithm against the well-known FVC2006
database and show that it can achieve comparable accuracy to widely-used
matching techniques that are not designed for privacy, while remaining
efficient with an authentication time of few seconds.
","[{'version': 'v1', 'created': 'Fri, 1 Nov 2019 08:22:34 GMT'}]",2019-11-04,"[['Geng', 'Swe', ''], ['Giannopoulou', 'Georgia', ''], ['Kabir-Querrec', 'Maëlle', '']]","['privacy', 'biometrics', 'fngerprint authentication', 'fuzzy vault']"
7195,2101.06120,Wenge Xu,"Wenge Xu, Hai-Ning Liang, Kangyou Yu, Nilufar Baghaei","Effect of Gameplay Uncertainty, Display Type, and Age on Virtual Reality
  Exergames","Accepted to ACM 2021 CHI Conference on Human Factors in Computing
  Systems (CHI 2021)",CHI 2021,10.1145/3411764.3445801,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Uncertainty is widely acknowledged as an engaging gameplay element but rarely
used in exergames. In this research, we explore the role of uncertainty in
exergames and introduce three uncertain elements (false-attacks, misses, and
critical hits) to an exergame. We conducted a study under two conditions
(uncertain and certain), with two display types (virtual reality and large
display) and across young and middle-aged adults to measure their effect on
game performance, experience, and exertion. Results show that (1) our designed
uncertain elements are instrumental in increasing exertion levels; (2) when
playing a motion-based first-person perspective exergame, virtual reality can
improve performance, while maintaining the same motion sickness level as a
large display; and (3) exergames for middle-aged adults should be designed with
age-related declines in mind, similar to designing for elderly adults. We also
framed two design guidelines for exergames that have similar features to the
game used in this research.
","[{'version': 'v1', 'created': 'Fri, 15 Jan 2021 14:03:50 GMT'}]",2021-01-18,"[['Xu', 'Wenge', ''], ['Liang', 'Hai-Ning', ''], ['Yu', 'Kangyou', ''], ['Baghaei', 'Nilufar', '']]","['exergame', 'uncertainty', 'virtual reality', 'young adults', 'middle-agedadults']"
7196,1907.04198,Jennifer Gago,"Jennifer J. Gago, Valentina Vasco, Bartek {\L}ukawski, Ugo Pattacini,
  Vadim Tikhanoff, Juan G. Victores, Carlos Balaguer",Sequence-to-Sequence Natural Language to Humanoid Robot Sign Language,"13 pages, 8 figures, conference",,10.11128/arep.58,,cs.RO cs.CL cs.HC cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper presents a study on natural language to sign language translation
with human-robot interaction application purposes. By means of the presented
methodology, the humanoid robot TEO is expected to represent Spanish sign
language automatically by converting text into movements, thanks to the
performance of neural networks. Natural language to sign language translation
presents several challenges to developers, such as the discordance between the
length of input and output data and the use of non-manual markers. Therefore,
neural networks and, consequently, sequence-to-sequence models, are selected as
a data-driven system to avoid traditional expert system approaches or temporal
dependencies limitations that lead to limited or too complex translation
systems. To achieve these objectives, it is necessary to find a way to perform
human skeleton acquisition in order to collect the signing input data. OpenPose
and skeletonRetriever are proposed for this purpose and a 3D sensor
specification study is developed to select the best acquisition hardware.
","[{'version': 'v1', 'created': 'Tue, 9 Jul 2019 14:41:50 GMT'}]",2019-07-10,"[['Gago', 'Jennifer J.', ''], ['Vasco', 'Valentina', ''], ['Łukawski', 'Bartek', ''], ['Pattacini', 'Ugo', ''], ['Tikhanoff', 'Vadim', ''], ['Victores', 'Juan G.', ''], ['Balaguer', 'Carlos', '']]","['HumanoidRobot', 'Translator', 'Sequence-to-Sequence', 'Sign Language']"
7197,2206.05240,Haozhe Wang,"Haozhe Wang, Chao Du, Panyan Fang, Shuo Yuan, Xuming He, Liang Wang,
  Bo Zheng","ROI-Constrained Bidding via Curriculum-Guided Bayesian Reinforcement
  Learning",Accepted by SIGKDD 2022,,10.1145/3534678.3539211,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Real-Time Bidding (RTB) is an important mechanism in modern online
advertising systems. Advertisers employ bidding strategies in RTB to optimize
their advertising effects subject to various financial requirements, especially
the return-on-investment (ROI) constraint. ROIs change non-monotonically during
the sequential bidding process, and often induce a see-saw effect between
constraint satisfaction and objective optimization. While some existing
approaches show promising results in static or mildly changing ad markets, they
fail to generalize to highly dynamic ad markets with ROI constraints, due to
their inability to adaptively balance constraints and objectives amidst
non-stationarity and partial observability. In this work, we specialize in
ROI-Constrained Bidding in non-stationary markets. Based on a Partially
Observable Constrained Markov Decision Process, our method exploits an
indicator-augmented reward function free of extra trade-off parameters and
develops a Curriculum-Guided Bayesian Reinforcement Learning (CBRL) framework
to adaptively control the constraint-objective trade-off in non-stationary ad
markets. Extensive experiments on a large-scale industrial dataset with two
problem settings reveal that CBRL generalizes well in both in-distribution and
out-of-distribution data regimes, and enjoys superior learning efficiency and
stability.
","[{'version': 'v1', 'created': 'Fri, 10 Jun 2022 17:30:12 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Jun 2022 08:55:21 GMT'}, {'version': 'v3', 'created': 'Tue, 21 Jun 2022 13:35:01 GMT'}, {'version': 'v4', 'created': 'Thu, 23 Jun 2022 04:34:25 GMT'}, {'version': 'v5', 'created': 'Sat, 16 Jul 2022 12:48:42 GMT'}]",2022-07-19,"[['Wang', 'Haozhe', ''], ['Du', 'Chao', ''], ['Fang', 'Panyan', ''], ['Yuan', 'Shuo', ''], ['He', 'Xuming', ''], ['Wang', 'Liang', ''], ['Zheng', 'Bo', '']]","['Online Advertising', 'Reinforcement Learning', 'Bayesian Learning']"
7198,2210.08034,John Musgrave,"John Musgrave, Alina Campan, Temesguen Messay-Kebede, David Kapp, Anca
  Ralescu",Empirical Network Structure of Malicious Programs,"13 pages, 7 figures",,10.20944/preprints202208.0440,,cs.SI cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A modern binary executable is a composition of various networks. Control flow
graphs are commonly used to represent an executable program in labeled datasets
used for classification tasks. Control flow and term representations are widely
adopted, but provide only a partial view of program semantics. This study is an
empirical analysis of the networks composing malicious binaries in order to
provide a complete representation of the structural properties of a program.
This is accomplished by the measurement of structural properties of program
networks in a malicious binary executable dataset. We demonstrate the presence
of Scale-Free properties of network structure for program data dependency and
control flow graphs, and show that data dependency graphs also have Small-World
structural properties. We show that program data dependency graphs have a
degree correlation that is structurally disassortative, and that control flow
graphs have a neutral degree assortativity, indicating the use of random graphs
to model the structural properties of program control flow graphs would show
increased accuracy. By providing an increase in feature resolution within
labeled datasets of executable programs we provide a quantitative basis to
interpret the results of classifiers trained on CFG graph features. An increase
in feature resolution allows for the structural properties of program classes
to be analyzed for patterns as well as their component parts. By capturing a
complete picture of program graphs we can enable theoretical solutions for the
mapping a program's operational semantics to its structure.
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2022 18:02:02 GMT'}]",2022-10-18,"[['Musgrave', 'John', ''], ['Campan', 'Alina', ''], ['Messay-Kebede', 'Temesguen', ''], ['Kapp', 'David', ''], ['Ralescu', 'Anca', '']]","['malware analysis', 'graphs', 'network science', 'security']"
7199,2109.14794,Yuzhe Tang,"Kai Li, Yuzhe Tang, Jiaqi Chen, Yibo Wang and Xianghong Liu","TopoShot: Uncovering Ethereum's Network Topology Leveraging Replacement
  Transactions",ACM IMC 2021,,10.1145/3487552.3487814,,cs.NI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Ethereum relies on a peer-to-peer overlay network to propagate information.
The knowledge of Ethereum network topology holds the key to understanding
Ethereum's security, availability, and user anonymity. From a measurement
perspective, an Ethereum network's topology is routing-table information hidden
inside individual Ethereum nodes, measuring which poses challenges and remains
an open research problem in the existing literature.
  This paper presents TopoShot, a new method uniquely repurposing Ethereum's
transaction replacement/eviction policies for topology measurement. TopoShot
can be configured to support Geth, Parity, and other major Ethereum clients. As
validated on local nodes, TopoShot achieves 100% measurement precision and high
recall 88% - 97%. To efficiently measure the large Ethereum networks in the
wild, we propose a non-trivial schedule to run pair-wise measurements in
parallel. To enable ethical measurement on Ethereum mainnet, we propose
workload-adaptive configurations of TopoShot to minimize the service
interruption to target nodes/network.
  We systematically measure a variety of Ethereum networks and obtain new
knowledge including the full-network topology in major testnets (Ropsten,
Rinkeby and Goerli) and critical sub-network topology in the mainnet. The
results on testnets show interesting graph-theoretic properties, such as all
testnets exhibit graph modularity significantly lower than random graphs,
implying resilience to network partitions. The mainnet results show biased
neighbor selection strategies adopted by critical Ethereum services such as
mining pools and transaction relays, implying a degree of centralization in
real Ethereum networks.
","[{'version': 'v1', 'created': 'Thu, 30 Sep 2021 01:38:27 GMT'}]",2021-10-01,"[['Li', 'Kai', ''], ['Tang', 'Yuzhe', ''], ['Chen', 'Jiaqi', ''], ['Wang', 'Yibo', ''], ['Liu', 'Xianghong', '']]","['Blockchain', 'Overlay networks', 'Network measurements', 'Ethereumtransactions']"
7200,2104.12473,Marcin Maleszka,Marcin Maleszka,Influence of group characteristics on agent voting,"9 pages, 3 figures, paper from the conference ACIIDS 2017","In: Nguyen N., Tojo S., Nguyen L., Trawinski B. (eds) Intelligent
  Information and Database Systems. ACIIDS 2017. Lecture Notes in Computer
  Science, vol 10191. Springer, Cham",10.1007/978-3-319-54472-4_6,,cs.MA,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A collective of identical agents in a multi-agent system often works together
towards the common goal. In situations where no supervisor agents are present
to make decisions for the group, these agents must achieve some consensus via
negotiations and other types of communications. We have previously shown that
the structure of the group and the priority of communication has a high
influence on the group decision if consensus theory methods are used. In this
paper, we explore the influence of preferential communication channels in
asynchronous group communication in situations, where majority vote and
dominant value are used. We also show how this relates to consensus approach in
such groups and how to use a combination of both approaches to improve
performance of real-life multi-agent systems.
","[{'version': 'v1', 'created': 'Mon, 26 Apr 2021 11:12:35 GMT'}]",2021-04-27,"[['Maleszka', 'Marcin', '']]","['knowledge integration', 'multiagent system', 'collective knowledge', 'consensus theory', 'agent voting']"
7201,2004.03212,Lisai Zhang,"Lisai Zhang, Qingcai Chen, Baotian Hu, and Shuoran Jiang",Text-Guided Neural Image Inpainting,"ACM MM'2020 (Oral). 9 pages, 4 tables, 7 figures",,10.1145/3394171.3414017,,cs.CV cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image inpainting task requires filling the corrupted image with contents
coherent with the context. This research field has achieved promising progress
by using neural image inpainting methods. Nevertheless, there is still a
critical challenge in guessing the missed content with only the context pixels.
The goal of this paper is to fill the semantic information in corrupted images
according to the provided descriptive text. Unique from existing text-guided
image generation works, the inpainting models are required to compare the
semantic content of the given text and the remaining part of the image, then
find out the semantic content that should be filled for missing part. To
fulfill such a task, we propose a novel inpainting model named Text-Guided Dual
Attention Inpainting Network (TDANet). Firstly, a dual multimodal attention
mechanism is designed to extract the explicit semantic information about the
corrupted regions, which is done by comparing the descriptive text and
complementary image areas through reciprocal attention. Secondly, an image-text
matching loss is applied to maximize the semantic similarity of the generated
image and the text. Experiments are conducted on two open datasets. Results
show that the proposed TDANet model reaches new state-of-the-art on both
quantitative and qualitative measures. Result analysis suggests that the
generated images are consistent with the guidance text, enabling the generation
of various results by providing different descriptions. Codes are available at
https://github.com/idealwhite/TDANet
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2020 09:04:43 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Apr 2020 03:40:11 GMT'}, {'version': 'v3', 'created': 'Wed, 12 Aug 2020 12:23:53 GMT'}, {'version': 'v4', 'created': 'Mon, 22 Mar 2021 08:12:02 GMT'}]",2021-03-23,"[['Zhang', 'Lisai', ''], ['Chen', 'Qingcai', ''], ['Hu', 'Baotian', ''], ['Jiang', 'Shuoran', '']]","['image inpainting', 'vision and language', 'image processing']"
7202,2106.06128,Xiaotian Zhou,Xiaotian Zhou and Zhongzhi Zhang,Maximizing Influence of Leaders in Social Networks,"10 pages, 2 figures",,10.1145/3447548.3467229,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The operation of adding edges has been frequently used to the study of
opinion dynamics in social networks for various purposes. In this paper, we
consider the edge addition problem for the DeGroot model of opinion dynamics in
a social network with $n$ nodes and $m$ edges, in the presence of a small
number $s \ll n$ of competing leaders with binary opposing opinions 0 or 1.
Concretely, we pose and investigate the problem of maximizing the equilibrium
overall opinion by creating $k$ new edges in a candidate edge set, where each
edge is incident to a 1-valued leader and a follower node. We show that the
objective function is monotone and submodular. We then propose a simple greedy
algorithm with an approximation factor $(1-\frac{1}{e})$ that approximately
solves the problem in $O(n^3)$ time. Moreover, we provide a fast algorithm with
a $(1-\frac{1}{e}-\epsilon)$ approximation ratio and
$\tilde{O}(mk\epsilon^{-2})$ time complexity for any $\epsilon>0$, where
$\tilde{O}(\cdot)$ notation suppresses the ${\rm poly} (\log n)$ factors.
Extensive experiments demonstrate that our second approximate algorithm is
efficient and effective, which scales to large networks with more than a
million nodes.
","[{'version': 'v1', 'created': 'Fri, 11 Jun 2021 02:31:46 GMT'}]",2021-06-14,"[['Zhou', 'Xiaotian', ''], ['Zhang', 'Zhongzhi', '']]","['Opinion dynamics', 'social network', 'multi-agent system', 'graph algorithm', 'influence maximization', 'discrete optimization', 'Laplaciansolver']"
7203,1912.11759,Jiang Zhu,"Qi Zhang, Jiang Zhu, Ning Zhang and Zhiwei Xu",Multidimensional Variational Line Spectra Estimation,,,10.1109/LSP.2020.2995107,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The fundamental multidimensional line spectral estimation problem is
addressed utilizing the Bayesian methods. Motivated by the recently proposed
variational line spectral estimation (VALSE) algorithm, multidimensional VALSE
(MDVALSE) is developed. MDVALSE inherits the advantages of VALSE such as
automatically estimating the model order, noise variance and providing
uncertain degrees of frequency estimates. Compared to VALSE, the
multidimensional frequencies of a single component is treated as a whole, and
the probability density function is projected as independent univariate von
Mises distribution to perform tractable inference. Besides, for the
initialization, efficient fast Fourier transform (FFT) is adopted to
significantly reduce the computation complexity of MDVALSE. Numerical results
demonstrate the effectiveness of the MDVALSE, compared to state-of-art methods.
","[{'version': 'v1', 'created': 'Thu, 26 Dec 2019 03:04:58 GMT'}]",2020-07-15,"[['Zhang', 'Qi', ''], ['Zhu', 'Jiang', ''], ['Zhang', 'Ning', ''], ['Xu', 'Zhiwei', '']]","['Variational Bayesian inference', 'line spectral estimation', 'von Mises distribution', 'multidi']"
7204,2007.02609,Carlos Gemmell,"Carlos Gemmell, Federico Rossetto, Jeffrey Dalton","Relevance Transformer: Generating Concise Code Snippets with Relevance
  Feedback",,,10.1145/3397271.3401215,,cs.CL cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Tools capable of automatic code generation have the potential to augment
programmer's capabilities. While straightforward code retrieval is incorporated
into many IDEs, an emerging area is explicit code generation. Code generation
is currently approached as a Machine Translation task, with Recurrent Neural
Network (RNN) based encoder-decoder architectures trained on code-description
pairs. In this work we introduce and study modern Transformer architectures for
this task. We further propose a new model called the Relevance Transformer that
incorporates external knowledge using pseudo-relevance feedback. The Relevance
Transformer biases the decoding process to be similar to existing retrieved
code while enforcing diversity. We perform experiments on multiple standard
benchmark datasets for code generation including Django, Hearthstone, and
CoNaLa. The results show improvements over state-of-the-art methods based on
BLEU evaluation. The Relevance Transformer model shows the potential of
Transformer-based architectures for code generation and introduces a method of
incorporating pseudo-relevance feedback during inference.
","[{'version': 'v1', 'created': 'Mon, 6 Jul 2020 09:54:17 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Dec 2020 16:33:43 GMT'}]",2020-12-09,"[['Gemmell', 'Carlos', ''], ['Rossetto', 'Federico', ''], ['Dalton', 'Jeffrey', '']]","['Code Generation', 'Code Retrieval', 'Neural Machine Translation']"
7205,1912.13023,Yun He,"Yun He, Jianling Wang, Wei Niu and James Caverlee","A Hierarchical Self-Attentive Model for Recommending User-Generated Item
  Lists",Accepted by CIKM 2019,CIKM 2019,10.1145/3357384.3358030,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  User-generated item lists are a popular feature of many different platforms.
Examples include lists of books on Goodreads, playlists on Spotify and YouTube,
collections of images on Pinterest, and lists of answers on question-answer
sites like Zhihu. Recommending item lists is critical for increasing user
engagement and connecting users to new items, but many approaches are designed
for the item-based recommendation, without careful consideration of the complex
relationships between items and lists. Hence, in this paper, we propose a novel
user-generated list recommendation model called AttList. Two unique features of
AttList are careful modeling of (i) hierarchical user preference, which
aggregates items to characterize the list that they belong to, and then
aggregates these lists to estimate the user preference, naturally fitting into
the hierarchical structure of item lists; and (ii) item and list consistency,
through a novel self-attentive aggregation layer designed for capturing the
consistency of neighboring items and lists to better model user preference.
Through experiments over three real-world datasets reflecting different kinds
of user-generated item lists, we find that AttList results in significant
improvements in NDCG, Precision@k, and Recall@k versus a suite of
state-of-the-art baselines. Furthermore, all code and data are available at
https://github.com/heyunh2015/AttList.
","[{'version': 'v1', 'created': 'Mon, 30 Dec 2019 17:34:47 GMT'}]",2020-01-01,"[['He', 'Yun', ''], ['Wang', 'Jianling', ''], ['Niu', 'Wei', ''], ['Caverlee', 'James', '']]","['Recommender System', 'User-Generated Item Lists', 'Self-Attention']"
7206,2107.01354,Dong-Wan Choi,Hakbin Kim and Dong-Wan Choi,"Pool of Experts: Realtime Querying Specialized Knowledge in Massive
  Neural Networks",In SIGMOD/PODS 2021,SIGMOD Conference 2021: 2244-2252,10.1145/3448016.3457326,,cs.DB cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In spite of the great success of deep learning technologies, training and
delivery of a practically serviceable model is still a highly time-consuming
process. Furthermore, a resulting model is usually too generic and heavyweight,
and hence essentially goes through another expensive model compression phase to
fit in a resource-limited device like embedded systems. Inspired by the fact
that a machine learning task specifically requested by mobile users is often
much simpler than it is supported by a massive generic model, this paper
proposes a framework, called Pool of Experts (PoE), that instantly builds a
lightweight and task-specific model without any training process. For a
realtime model querying service, PoE first extracts a pool of primitive
components, called experts, from a well-trained and sufficiently generic
network by exploiting a novel conditional knowledge distillation method, and
then performs our train-free knowledge consolidation to quickly combine
necessary experts into a lightweight network for a target task. Thanks to this
train-free property, in our thorough empirical study, PoE can build a fairly
accurate yet compact model in a realtime manner, whereas it takes a few minutes
per query for the other training methods to achieve a similar level of the
accuracy.
","[{'version': 'v1', 'created': 'Sat, 3 Jul 2021 06:31:54 GMT'}]",2021-07-06,"[['Kim', 'Hakbin', ''], ['Choi', 'Dong-Wan', '']]","['Lightweight Neural Networks', 'Knowledge Distillation', 'Model Specialization', 'Model Compression']"
7207,2211.11883,Aditi Agrawal,"Aditi Agrawal, Archit Jain, Benjamin Reed",CodEval: Improving Student Success In Programming Assignments,,"EDULEARN 2022 Proceedings, pp. 7546-7554",10.21125/edulearn.2022.1767,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CodEval is a code evaluation tool that integrates with the Canvas Learning
Management System to automatically evaluates students' work within a few
minutes of the submission. This early feedback allows students to catch and
correct problems in their submissions before their submission is graded and
gives them a clear idea of the quality of their submission. CodEval handles the
tedious aspects of grading, such as compiling and running tests, leaving
graders more time to spend on the qualitative aspect of grading.
  Before using CodEval, instructors would not have a clear view of the
student's comprehension of the concept evaluated by the assignment until after
the due date. CodeEval helps instructors identify and address the gaps in
students' understanding and thus helps more students successfully complete the
assignment.
  We implemented CodEval using Python using the public Canvas API. Any
instructor or grader for a Canvas course can use CodEval to automatically
evaluate submissions for programming assignments. We developed a syntax to
express requirements of submissions such as compilation parameters, inputs,
outputs, command-line arguments, timeouts, exit codes, functions used, files
generated, output validators, and more. We have made CodEval open source.
  CodEval is an easy tool for students, graders, and instructors and seamlessly
integrates with Canvas. We share our experience with using CodEval in two
classes with a total of 90 students and multiple coding assignments.
","[{'version': 'v1', 'created': 'Mon, 21 Nov 2022 22:16:52 GMT'}]",2022-11-23,"[['Agrawal', 'Aditi', ''], ['Jain', 'Archit', ''], ['Reed', 'Benjamin', '']]","['Computer science education', 'canvas', 'code evaluation', 'docker', 'learning managementsystems', 'programming exercises', 'teaching assistant']"
7208,2003.07961,Tapajit Dey,"Tapajit Dey, Bogdan Vasilescu, Audris Mockus",An Exploratory Study of Bot Commits,,,10.1145/3387940.3391502,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Bots help automate many of the tasks performed by software
developers and are widely used to commit code in various social coding
platforms. At present, it is not clear what types of activities these bots
perform and understanding it may help design better bots, and find application
areas which might benefit from bot adoption. Aim: We aim to categorize the Bot
Commits by the type of change (files added, deleted, or modified), find the
more commonly changed file types, and identify the groups of file types that
tend to get updated together. Method: 12,326,137 commits made by 461 popular
bots (that made at least 1000 commits) were examined to identify the frequency
and the type of files added/ deleted/ modified by the commits, and association
rule mining was used to identify the types of files modified together. Result:
Majority of the bot commits modify an existing file, a few of them add new
files, while deletion of a file is very rare. Commits involving more than one
type of operation are even rarer. Files containing data, configuration, and
documentation are most frequently updated, while HTML is the most common type
in terms of the number of files added, deleted, and modified. Files of the type
""Markdown"", ""Ignore List"", ""YAML"", ""JSON"" were the types that are updated
together with other types of files most frequently. Conclusion: We observe that
majority of bot commits involve single file modifications, and bots primarily
work with data, configuration, and documentation files. A better understanding
if this is a limitation of the bots and, if overcome, would lead to different
kinds of bots remains an open question.
","[{'version': 'v1', 'created': 'Tue, 17 Mar 2020 21:54:13 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Mar 2020 20:42:40 GMT'}]",2020-11-10,"[['Dey', 'Tapajit', ''], ['Vasilescu', 'Bogdan', ''], ['Mockus', 'Audris', '']]","['Bots', 'Bot Commits', 'Code Commits', 'Association Rules']"
7209,1306.6263,Hossein Ziaei Nafchi,"Seyed Morteza Ayatollahi, Hossein Ziaei Nafchi",Persian Heritage Image Binarization Competition (PHIBC 2012),"4 pages, 2 figures, conference",,10.1109/PRIA.2013.6528442,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The first competition on the binarization of historical Persian documents and
manuscripts (PHIBC 2012) has been organized in conjunction with the first
Iranian conference on pattern recognition and image analysis (PRIA 2013). The
main objective of PHIBC 2012 is to evaluate performance of the binarization
methodologies, when applied on the Persian heritage images. This paper provides
a report on the methodology and performance of the three submitted algorithms
based on evaluation measures has been used.
","[{'version': 'v1', 'created': 'Wed, 26 Jun 2013 14:56:00 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Apr 2016 00:04:34 GMT'}]",2016-04-22,"[['Ayatollahi', 'Seyed Morteza', ''], ['Nafchi', 'Hossein Ziaei', '']]","['Document image processing', 'Historical documentbinarization', 'Persian heritage manuscripts', 'Binarization contest']"
7210,2204.11989,Eugene Yang,"Eugene Yang and Suraj Nair and Ramraj Chandradevan and Rebecca
  Iglesias-Flores and Douglas W. Oard","C3: Continued Pretraining with Contrastive Weak Supervision for Cross
  Language Ad-Hoc Retrieval","6 pages, 2 figures, accepted as a SIGIR 2022 Short Paper",,10.1145/3477495.3531886,,cs.IR cs.CL,http://creativecommons.org/licenses/by-sa/4.0/,"  Pretrained language models have improved effectiveness on numerous tasks,
including ad-hoc retrieval. Recent work has shown that continuing to pretrain a
language model with auxiliary objectives before fine-tuning on the retrieval
task can further improve retrieval effectiveness. Unlike monolingual retrieval,
designing an appropriate auxiliary task for cross-language mappings is
challenging. To address this challenge, we use comparable Wikipedia articles in
different languages to further pretrain off-the-shelf multilingual pretrained
models before fine-tuning on the retrieval task. We show that our approach
yields improvements in retrieval effectiveness.
","[{'version': 'v1', 'created': 'Mon, 25 Apr 2022 23:12:05 GMT'}]",2022-04-27,"[['Yang', 'Eugene', ''], ['Nair', 'Suraj', ''], ['Chandradevan', 'Ramraj', ''], ['Iglesias-Flores', 'Rebecca', ''], ['Oard', 'Douglas W.', '']]","['cross-language information retrieval', 'neural methods', 'pretraining']"
7211,2208.07702,Pino Caballero-Gil,"Iv\'an Santos-Gonz\'alez, Pino Caballero-Gil, Alexandra
  Rivero-Garc\'ia, C\'andido Caballero-Gil",Priority and collision avoidance system for traffic lights,,Ad Hoc Networks 94(2):101931. 2019,10.1016/j.adhoc.2019.101931,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this paper, a collision avoidance system is presented to detect red light
running and warn nearby vehicles and pedestrians in real time in order to
prevent possible accidents. No complex infrastructure-based solution such as
those based on radars or cameras is here required. Instead, a new solution
based on smartphones carried by drivers and pedestrians is proposed so that it
is the device inside the vehicle violating a traffic light, the one that
self-reports the offence in order to generate alerts and warn nearby vehicles
and pedestrians to prevent accidents. The proposal could also be used by road
authorities to collect data on traffic lights that are most frequently violated
in order to define an action plan to investigate causes and look for solutions.
It includes a classifier for learning and estimating driver behaviour based on
collected data, which is used to predict whether he/she is about to run a red
light or detect whether that has already happened. In the first case, the
system broadcasts warnings directly to close vehicles and pedestrians through
Wi-Fi, while in the second case, the proposal warns vehicles and pedestrians in
the neighbourhood through a server. The solution also includes a prioritization
system based on changing traffic lights at intersections according to the needs
and characteristics of the traffic at all times, giving the top priority to
emergency vehicles. Furthermore, the proposal involves the use of cryptographic
schemes to protect authenticity and integrity of messages sent from traffic
lights, smartphones and servers, and privacy and anonymity to promote the use
of the system. A beta version with some parts of the proposal has been
implemented and the obtained results are promising.
","[{'version': 'v1', 'created': 'Sun, 14 Aug 2022 11:53:07 GMT'}]",2022-08-17,"[['Santos-González', 'Iván', ''], ['Caballero-Gil', 'Pino', ''], ['Rivero-García', 'Alexandra', ''], ['Caballero-Gil', 'Cándido', '']]","['Red-light running', 'security', 'Wireless technologies', 'Security', 'Drivingbehaviour', 'Wi-Fi']"
7212,2204.06481,Federico Pigozzi Mr,Federico Pigozzi and Yujin Tang and Eric Medvet and David Ha,"Evolving Modular Soft Robots without Explicit Inter-Module Communication
  using Local Self-Attention","Accepted at the Genetic and Evolutionary Computation Conference 2022
  (GECCO'22) complex systems track as a full paper",,10.1145/3512290.3528762,,cs.RO cs.NE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Modularity in robotics holds great potential. In principle, modular robots
can be disassembled and reassembled in different robots, and possibly perform
new tasks. Nevertheless, actually exploiting modularity is yet an unsolved
problem: controllers usually rely on inter-module communication, a practical
requirement that makes modules not perfectly interchangeable and thus limits
their flexibility. Here, we focus on Voxel-based Soft Robots (VSRs),
aggregations of mechanically identical elastic blocks. We use the same neural
controller inside each voxel, but without any inter-voxel communication, hence
enabling ideal conditions for modularity: modules are all equal and
interchangeable. We optimize the parameters of the neural controller-shared
among the voxels-by evolutionary computation. Crucially, we use a local
self-attention mechanism inside the controller to overcome the absence of
inter-module communication channels, thus enabling our robots to truly be
driven by the collective intelligence of their modules. We show experimentally
that the evolved robots are effective in the task of locomotion: thanks to
self-attention, instances of the same controller embodied in the same robot can
focus on different inputs. We also find that the evolved controllers generalize
to unseen morphologies, after a short fine-tuning, suggesting that an inductive
bias related to the task arises from true modularity.
","[{'version': 'v1', 'created': 'Wed, 13 Apr 2022 16:03:39 GMT'}]",2022-04-14,"[['Pigozzi', 'Federico', ''], ['Tang', 'Yujin', ''], ['Medvet', 'Eric', ''], ['Ha', 'David', '']]","['Neuroevolution', 'collective intelligence', 'soft robots', 'self-attention']"
7213,2106.05039,Simon Erni,"Simon Erni, Martin Kotuliak, Patrick Leu, Marc Roeschlin, Srdjan
  Capkun",AdaptOver: Adaptive Overshadowing Attacks in Cellular Networks,,,10.1145/3495243.3560525,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In cellular networks, attacks on the communication link between a mobile
device and the core network significantly impact privacy and availability. Up
until now, fake base stations have been required to execute such attacks. Since
they require a continuously high output power to attract victims, they are
limited in range and can be easily detected both by operators and dedicated
apps on users' smartphones.
  This paper introduces AdaptOver - a MITM attack system designed for cellular
networks, specifically for LTE and 5G-NSA. AdaptOver allows an adversary to
decode, overshadow (replace) and inject arbitrary messages over the air in
either direction between the network and the mobile device. Using
overshadowing, AdaptOver can cause a persistent ($\geq$ 12h) DoS or a privacy
leak by triggering a UE to transmit its persistent identifier (IMSI) in plain
text. These attacks can be launched against all users within a cell or
specifically target a victim based on its phone number.
  We implement AdaptOver using a software-defined radio and a low-cost
amplification setup. We demonstrate the effects and practicality of the attacks
on a live operational LTE and 5G-NSA network with a wide range of smartphones.
Our experiments show that AdaptOver can launch an attack on a victim more than
3.8km away from the attacker. Given its practicability and efficiency,
AdaptOver shows that existing countermeasures that are focused on fake base
stations are no longer sufficient, marking a paradigm shift for designing
security mechanisms in cellular networks.
","[{'version': 'v1', 'created': 'Wed, 9 Jun 2021 12:54:05 GMT'}, {'version': 'v2', 'created': 'Wed, 4 May 2022 07:19:50 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Sep 2022 23:44:15 GMT'}]",2022-09-09,"[['Erni', 'Simon', ''], ['Kotuliak', 'Martin', ''], ['Leu', 'Patrick', ''], ['Roeschlin', 'Marc', ''], ['Capkun', 'Srdjan', '']]","['Cellular Networks', 'Overshadowing', 'Denial of Service', 'Privacy']"
7214,2208.03130,Richard Marcus,"Richard Marcus, Niklas Knoop, Bernhard Egger and Marc Stamminger",A Lightweight Machine Learning Pipeline for LiDAR-simulation,"Conference: DeLTA 22; ISBN 978-989-758-584-5; ISSN 2184-9277;
  publisher: SciTePress, organization: INSTICC","Proceedings of the 3rd International Conference on Deep Learning
  Theory and Applications - DeLTA, 2022, pages 176-183",10.5220/0011309100003277,,cs.CV eess.IV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Virtual testing is a crucial task to ensure safety in autonomous driving, and
sensor simulation is an important task in this domain. Most current LiDAR
simulations are very simplistic and are mainly used to perform initial tests,
while the majority of insights are gathered on the road. In this paper, we
propose a lightweight approach for more realistic LiDAR simulation that learns
a real sensor's behavior from test drive data and transforms this to the
virtual domain. The central idea is to cast the simulation into an
image-to-image translation problem. We train our pix2pix based architecture on
two real world data sets, namely the popular KITTI data set and the Audi
Autonomous Driving Dataset which provide both, RGB and LiDAR images. We apply
this network on synthetic renderings and show that it generalizes sufficiently
from real images to simulated images. This strategy enables to skip the
sensor-specific, expensive and complex LiDAR physics simulation in our
synthetic world and avoids oversimplification and a large domain-gap through
the clean synthetic environment.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2022 12:45:53 GMT'}]",2022-08-08,"[['Marcus', 'Richard', ''], ['Knoop', 'Niklas', ''], ['Egger', 'Bernhard', ''], ['Stamminger', 'Marc', '']]","['Autonomous Driving', 'LiDAR', 'General Adversarial Neural Network', 'Image-to-image Translation']"
7215,1905.08723,Ting-Shuo Yo,Ting-Shuo Yo and Edwin de Jong,A comparison of evaluation methods in coevolution,"8 pages, 7 figures, GECCO '07: Proceedings of the 9th annual
  conference on Genetic and evolutionary computation",,10.1145/1276958.1277060,,cs.NE cs.LG,http://creativecommons.org/licenses/by/4.0/,"  In this research, we compare four different evaluation methods in coevolution
on the Majority Function problem. The size of the problem is selected such that
evaluation against all possible test cases is feasible. Two measures are used
for the comparisons, i.e., the objective fitness derived from evaluating
solutions against all test cases, and the objective fitness correlation (OFC),
which is defined as the correlation coefficient between subjective and
objective fitness. The results of our experiments suggest that a combination of
average score and weighted informativeness may provide a more accurate
evaluation in coevolution. In order to confirm this difference, a series of
t-tests on the preference between each pair of the evaluation methods is
performed. The resulting significance is affirmative, and the tests for two
quality measures show similar preference on four evaluation methods. %This
study is the first time OFC is actually computed on a real problem. Experiments
on Majority Function problems with larger sizes and Parity problems are in
progress, and their results will be added in the final version.
","[{'version': 'v1', 'created': 'Tue, 21 May 2019 16:11:00 GMT'}]",2019-05-22,"[['Yo', 'Ting-Shuo', ''], ['de Jong', 'Edwin', '']]","['Coevolution', 'evaluation', 'performance comparison', 'objectivefitness corelation', 'OFC']"
7216,2209.06567,Stefan Schulte,"Gerta Sheganaku, Stefan Schulte, Philipp Waibel, Ingo Weber",Cost-efficient Auto-scaling of Container-based Elastic Processes,,,10.1016/j.future.2022.09.001,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In business process landscapes, a common challenge is to provide the
necessary computational resources to enact the single process steps. One
well-known approach to solve this issue in a cost-efficient way is to use the
notion of elasticity, i.e., to provide cloud-based computational resources in a
rapid fashion and to enact the single process steps on these resources.
Existing approaches to provide elastic processes are mostly based on Virtual
Machines (VMs). Utilizing container technologies could enable a more
fine-grained allocation of process steps to computational resources, leading to
a better resource utilization and improved cost efficiency.
  In this paper, we propose an approach to optimize resource allocation for
elastic processes by applying a four-fold auto-scaling approach. The main goal
is to minimize the cost of process enactments by using containers. To this end,
we formulate and implement a multi-objective optimization problem applying
Mixed-Integer Linear Programming and use a transformation step to allocate
software services to containers. We thoroughly evaluate the optimization
problem and show that it can lead to significant cost savings while maintaining
Service Lev
","[{'version': 'v1', 'created': 'Wed, 14 Sep 2022 11:52:05 GMT'}]",2022-09-15,"[['Sheganaku', 'Gerta', ''], ['Schulte', 'Stefan', ''], ['Waibel', 'Philipp', ''], ['Weber', 'Ingo', '']]","['Elastic Processes', 'Business Process Management', 'Cloud Computing', 'Elastic Computing', 'BPM', 'Auto-scaling']"
7217,2111.04302,Thomas Zimmermann,"Margaret-Anne Storey, Brian Houck, Thomas Zimmermann",How Developers and Managers Define and Trade Productivity for Quality,,"CHASE 2022: 15th International Conference on Cooperative and Human
  Aspects of Software Engineering",10.1145/3528579.3529177,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present the findings from a survey study to investigate how
developers and managers define and trade-off developer productivity and
software quality (two related lenses into software development). We found that
developers and managers, as cohorts, are not well aligned in their views of
what it means to be productive (developers think of productivity in terms of
activity, while more managers think of productivity in terms of performance).
We also found that developers are not accurate at predicting their managers'
views of productivity. In terms of quality, we found that individual developers
and managers have quite varied views of what quality means to them, but as
cohorts they are closely aligned in their different views, with the majority in
both groups defining quality in terms of robustness. Over half of the
developers and managers reported that quality can be traded for higher
productivity and why this trade-off can be justified, while one third consider
quality as a necessary part of productivity that cannot be traded. We also
present a new descriptive framework for quality, TRUCE, that we synthesize from
the survey responses. We call for more discussion between developers and
managers about what they each consider as important software quality
attributes, and to have open debate about how software quality relates to
developer productivity and what trade-offs should or should not be made.
","[{'version': 'v1', 'created': 'Mon, 8 Nov 2021 07:14:32 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Apr 2022 15:29:29 GMT'}]",2022-04-28,"[['Storey', 'Margaret-Anne', ''], ['Houck', 'Brian', ''], ['Zimmermann', 'Thomas', '']]","['productivity', 'quality', 'software development', 'trade-offs']"
7218,2003.03014,Julia Mendelsohn,"Julia Mendelsohn, Yulia Tsvetkov, Dan Jurafsky",A Framework for the Computational Linguistic Analysis of Dehumanization,"31 pages, 6 figures (Appendix is 4 pages, 4 figures). Submitted to
  Frontiers in Artificial Intelligence (Language and Computation)",Frontiers in Artificial Intelligence 3 (2020):55,10.3389/frai.2020.00055,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dehumanization is a pernicious psychological process that often leads to
extreme intergroup bias, hate speech, and violence aimed at targeted social
groups. Despite these serious consequences and the wealth of available data,
dehumanization has not yet been computationally studied on a large scale.
Drawing upon social psychology research, we create a computational linguistic
framework for analyzing dehumanizing language by identifying linguistic
correlates of salient components of dehumanization. We then apply this
framework to analyze discussions of LGBTQ people in the New York Times from
1986 to 2015. Overall, we find increasingly humanizing descriptions of LGBTQ
people over time. However, we find that the label homosexual has emerged to be
much more strongly associated with dehumanizing attitudes than other labels,
such as gay. Our proposed techniques highlight processes of linguistic
variation and change in discourses surrounding marginalized groups.
Furthermore, the ability to analyze dehumanizing language at a large scale has
implications for automatically detecting and understanding media bias as well
as abusive language online.
","[{'version': 'v1', 'created': 'Fri, 6 Mar 2020 03:02:12 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Jun 2020 20:00:19 GMT'}]",2020-10-02,"[['Mendelsohn', 'Julia', ''], ['Tsvetkov', 'Yulia', ''], ['Jurafsky', 'Dan', '']]","['computational sociolinguistics', 'dehumanization', 'lexical variation', 'language change', 'media', 'New York Times', 'LGBTQ']"
7219,1702.06527,Rahmtin Rotabi,"Rahmtin Rotabi, Cristian Danescu-Niculescu-Mizil and Jon Kleinberg",Competition and Selection Among Conventions,"To appear in Proceedings of WWW 2017, data at
  https://github.com/CornellNLP/Macros",,10.1145/3038912.3052652,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many domains, a latent competition among different conventions determines
which one will come to dominate. One sees such effects in the success of
community jargon, of competing frames in political rhetoric, or of terminology
in technical contexts. These effects have become widespread in the online
domain, where the data offers the potential to study competition among
conventions at a fine-grained level.
  In analyzing the dynamics of conventions over time, however, even with
detailed on-line data, one encounters two significant challenges. First, as
conventions evolve, the underlying substance of their meaning tends to change
as well; and such substantive changes confound investigations of social
effects. Second, the selection of a convention takes place through the complex
interactions of individuals within a community, and contention between the
users of competing conventions plays a key role in the convention's evolution.
Any analysis must take place in the presence of these two issues.
  In this work we study a setting in which we can cleanly track the competition
among conventions. Our analysis is based on the spread of low-level authoring
conventions in the eprint arXiv over 24 years: by tracking the spread of macros
and other author-defined conventions, we are able to study conventions that
vary even as the underlying meaning remains constant. We find that the
interaction among co-authors over time plays a crucial role in the selection of
them; the distinction between more and less experienced members of the
community, and the distinction between conventions with visible versus
invisible effects, are both central to the underlying processes. Through our
analysis we make predictions at the population level about the ultimate success
of different synonymous conventions over time--and at the individual level
about the outcome of ""fights"" between people over convention choices.
","[{'version': 'v1', 'created': 'Tue, 21 Feb 2017 18:59:12 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Feb 2017 15:46:11 GMT'}, {'version': 'v3', 'created': 'Thu, 2 Mar 2017 19:12:30 GMT'}, {'version': 'v4', 'created': 'Sun, 26 Mar 2017 23:45:53 GMT'}]",2017-03-28,"[['Rotabi', 'Rahmtin', ''], ['Danescu-Niculescu-Mizil', 'Cristian', ''], ['Kleinberg', 'Jon', '']]","['conventions', 'innovations', 'diffusion of information', 'arXiv']"
7220,2103.06650,Xiao-Shan Gao,"Laigang Guo, Chun-Ming Yuan, Xiao-Shan Gao",A Generalization of the Concavity of R\'{e}nyi Entropy Powe,,,10.3390/e23121593,,cs.IT math.IT,http://creativecommons.org/licenses/by/4.0/,"  Recently, Savar\'{e}-Toscani proved that the R\'{e}nyi entropy power of
general probability densities solving the $p$-nonlinear heat equation in
$\mathbb{R}^n$ is always a concave function of time, which extends Costa's
concavity inequality for Shannon's entropy power to R\'{e}nyi entropies. In
this paper, we give a generalization of Savar\'{e}-Toscani's result by giving a
class of sufficient conditions of the parameters under which the concavity of
the R\'{e}nyi entropy power is still valid. These conditions are quite general
and include the parameter range given by Savar\'{e}-Toscani as special cases.
Also, the conditions are obtained with a systematical approach.
","[{'version': 'v1', 'created': 'Thu, 11 Mar 2021 13:06:10 GMT'}]",2021-12-15,"[['Guo', 'Laigang', ''], ['Yuan', 'Chun-Ming', ''], ['Gao', 'Xiao-Shan', '']]","['R´enyi entropy', 'entropy power inequality', 'nonlinear heat equation']"
7221,cs/0311031,J. G. Wolff,J. Gerard Wolff,"Towards an Intelligent Database System Founded on the SP Theory of
  Computing and Cognition",,"J G Wolff, Data & Knowledge Engineering 60, 596-624, 2007",10.1016/j.datak.2006.04.003,,cs.DB cs.AI,,"  The SP theory of computing and cognition, described in previous publications,
is an attractive model for intelligent databases because it provides a simple
but versatile format for different kinds of knowledge, it has capabilities in
artificial intelligence, and it can also function like established database
models when that is required.
  This paper describes how the SP model can emulate other models used in
database applications and compares the SP model with those other models. The
artificial intelligence capabilities of the SP model are reviewed and its
relationship with other artificial intelligence systems is described. Also
considered are ways in which current prototypes may be translated into an
'industrial strength' working system.
","[{'version': 'v1', 'created': 'Fri, 21 Nov 2003 14:44:22 GMT'}]",2014-09-30,"[['Wolff', 'J. Gerard', '']]","['Intelligent database', 'information compression', 'multiple alignment', 'database model', 'relational database', 'hierarchical database', 'networkdatabase']"
7222,2007.04583,Xin Liu Dr.,"Hibiki Taguchi, Xin Liu, Tsuyoshi Murata",Graph Convolutional Networks for Graphs Containing Missing Features,,"Future Generation Computer Systems, Volume 117, Pages 155-168,
  2021",10.1016/j.future.2020.11.016,,cs.LG cs.CY stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph Convolutional Network (GCN) has experienced great success in graph
analysis tasks. It works by smoothing the node features across the graph. The
current GCN models overwhelmingly assume that the node feature information is
complete. However, real-world graph data are often incomplete and containing
missing features. Traditionally, people have to estimate and fill in the
unknown features based on imputation techniques and then apply GCN. However,
the process of feature filling and graph learning are separated, resulting in
degraded and unstable performance. This problem becomes more serious when a
large number of features are missing. We propose an approach that adapts GCN to
graphs containing missing features. In contrast to traditional strategy, our
approach integrates the processing of missing features and graph learning
within the same neural network architecture. Our idea is to represent the
missing data by Gaussian Mixture Model (GMM) and calculate the expected
activation of neurons in the first hidden layer of GCN, while keeping the other
layers of the network unchanged. This enables us to learn the GMM parameters
and network weight parameters in an end-to-end manner. Notably, our approach
does not increase the computational complexity of GCN and it is consistent with
GCN when the features are complete. We demonstrate through extensive
experiments that our approach significantly outperforms the imputation-based
methods in node classification and link prediction tasks. We show that the
performance of our approach for the case with a low level of missing features
is even superior to GCN for the case with complete features.
","[{'version': 'v1', 'created': 'Thu, 9 Jul 2020 06:47:21 GMT'}, {'version': 'v2', 'created': 'Sun, 6 Dec 2020 13:07:35 GMT'}]",2020-12-08,"[['Taguchi', 'Hibiki', ''], ['Liu', 'Xin', ''], ['Murata', 'Tsuyoshi', '']]","['Graph convolutional network', 'GCN', 'Missing data', 'Incomplete data', 'Graph embedding', 'Network representation learning']"
7223,2107.05738,Golsa Heidaei,"Golsa Heidari, Ahmad Ramadan, Markus Stocker, S\""oren Auer",Demonstration of Faceted Search on Scholarly Knowledge Graphs,"2 pages, 1 figure, WWW 2021 Demo. arXiv admin note: substantial text
  overlap with arXiv:2107.05447",,10.1145/3442442.3458605,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Scientists always look for the most accurate and relevant answer to their
queries on the scholarly literature. Traditional scholarly search systems list
documents instead of providing direct answers to the search queries. As data in
knowledge graphs are not acquainted semantically, they are not
machine-readable. Therefore, a search on scholarly knowledge graphs ends up in
a full-text search, not a search in the content of scholarly literature. In
this demo, we present a faceted search system that retrieves data from a
scholarly knowledge graph, which can be compared and filtered to better satisfy
user information needs. Our practice's novelty is that we use dynamic facets,
which means facets are not fixed and will change according to the content of a
comparison.
","[{'version': 'v1', 'created': 'Mon, 5 Jul 2021 09:53:02 GMT'}]",2021-07-14,"[['Heidari', 'Golsa', ''], ['Ramadan', 'Ahmad', ''], ['Stocker', 'Markus', ''], ['Auer', 'Sören', '']]","['Knowledge Graph', 'Scholarly Knowledge', 'Information Retrieval', 'Search System', 'Faceted Search']"
7224,2106.01021,Chao Zhang,"Chao Zhang, Samson Lasaulce, Martin Hennebel, Lucas Saludjian, Patrick
  Panciatici, and H. Vincent Poor","Decision-making Oriented Clustering: Application to Pricing and Power
  Consumption Scheduling",Published in Applied Energy,"Applied Energy, 297:117106, 2021",10.1016/j.apenergy.2021.117106.,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Data clustering is an instrumental tool in the area of energy resource
management. One problem with conventional clustering is that it does not take
the final use of the clustered data into account, which may lead to a very
suboptimal use of energy or computational resources. When clustered data are
used by a decision-making entity, it turns out that significant gains can be
obtained by tailoring the clustering scheme to the final task performed by the
decision-making entity. The key to having good final performance is to
automatically extract the important attributes of the data space that are
inherently relevant to the subsequent decision-making entity, and partition the
data space based on these attributes instead of partitioning the data space
based on predefined conventional metrics. For this purpose, we formulate the
framework of decision-making oriented clustering and propose an algorithm
providing a decision-based partition of the data space and good representative
decisions. By applying this novel framework and algorithm to a typical problem
of real-time pricing and that of power consumption scheduling, we obtain
several insightful analytical results such as the expression of the best
representative price profiles for real-time pricing and a very significant
reduction in terms of required clusters to perform power consumption scheduling
as shown by our simulations.
","[{'version': 'v1', 'created': 'Wed, 2 Jun 2021 08:41:04 GMT'}]",2021-06-03,"[['Zhang', 'Chao', ''], ['Lasaulce', 'Samson', ''], ['Hennebel', 'Martin', ''], ['Saludjian', 'Lucas', ''], ['Panciatici', 'Patrick', ''], ['Poor', 'H. Vincent', '']]","['Clustering', 'Decision-making', 'Pricing', 'Power consumption scheduling', 'EV charging']"
7225,2210.09693,Chaoli Zhang,Chaoli Zhang and Tian Zhou and Qingsong Wen and Liang Sun,"TFAD: A Decomposition Time Series Anomaly Detection Architecture with
  Time-Frequency Analysis",,CIKM 2022,10.1145/3511808.3557470,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Time series anomaly detection is a challenging problem due to the complex
temporal dependencies and the limited label data. Although some algorithms
including both traditional and deep models have been proposed, most of them
mainly focus on time-domain modeling, and do not fully utilize the information
in the frequency domain of the time series data. In this paper, we propose a
Time-Frequency analysis based time series Anomaly Detection model, or TFAD for
short, to exploit both time and frequency domains for performance improvement.
Besides, we incorporate time series decomposition and data augmentation
mechanisms in the designed time-frequency architecture to further boost the
abilities of performance and interpretability. Empirical studies on widely used
benchmark datasets show that our approach obtains state-of-the-art performance
in univariate and multivariate time series anomaly detection tasks. Code is
provided at https://github.com/DAMO-DI-ML/CIKM22-TFAD.
","[{'version': 'v1', 'created': 'Tue, 18 Oct 2022 09:08:57 GMT'}]",2022-10-19,"[['Zhang', 'Chaoli', ''], ['Zhou', 'Tian', ''], ['Wen', 'Qingsong', ''], ['Sun', 'Liang', '']]","['time series anomaly detection', 'frequency domain analysis', 'dataaugmentation', 'time series decomposition']"
7226,2012.15240,Martin Lester,Martin Mariusz Lester,Analysis of MiniJava Programs via Translation to ML,Short paper at Formal Techniques for Java-like Programs (FTfJP) 2019,"FTfJP 2019: Proceedings of the 21st Workshop on Formal Techniques
  for Java-like Programs",10.1145/3340672.3341119,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  MiniJava is a subset of the object-oriented programming language Java.
Standard ML is the canonical representative of the ML family of functional
programming languages, which includes F# and OCaml. Different program analysis
and verification tools and techniques have been developed for both Java-like
and ML-like languages. Naturally, the tools developed for a particular language
emphasise accurate treatment of language features commonly used in that
language. In Java, this means objects with mutable properties and dynamic
method dispatch. In ML, this means higher order functions and algebraic
datatypes with pattern matching.
  We propose to translate programs from one language into the other and use the
target language's tools for analysis and verification. By doing so, we hope to
identify areas for improvement in the target language's tools and suggest
techniques, perhaps as used in the source language's tools, that may guide
their improvement. More generally, we hope to develop tools for reasoning about
programs that are more resilient to changes in the style of code and
representation of data. We begin our programme by outlining a translation from
MiniJava to ML that uses only the core features of ML; in particular, it avoids
the use of ML's mutable references.
","[{'version': 'v1', 'created': 'Wed, 30 Dec 2020 17:35:30 GMT'}]",2021-01-01,"[['Lester', 'Martin Mariusz', '']]","['Java', 'ML', 'automated verification', 'static analysis', 'program transformation']"
7227,2010.00828,Joachim Meyer,Joachim Meyer and James K. Kuchar,"Maximal benefits and possible detrimental effects of binary decision
  aids","Proceedings, 2nd IEEE International Conference on Human-Machine
  Systems (2021)",,10.1109/ICHMS53169.2021.9582632,,cs.HC cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Binary decision aids, such as alerts, are a simple and widely used form of
automation. The formal analysis of a user's task performance with an aid sees
the process as the combination of information from two detectors who both
receive input about an event and evaluate it. The user's decisions are based on
the output of the aid and on the information, the user obtains independently.
We present a simple method for computing the maximal benefits a user can derive
from a binary aid as a function of the user's and the aid's sensitivities.
Combining the user and the aid often adds little to the performance the better
detector could achieve alone. Also, if users assign non-optimal weights to the
aid, performance may drop dramatically. Thus, the introduction of a valid aid
can actually lower detection performance, compared to a more sensitive user
working alone. Similarly, adding a user to a system with high sensitivity may
lower its performance. System designers need to consider the potential adverse
effects of introducing users or aids into systems.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2020 07:46:58 GMT'}]",2022-05-20,"[['Meyer', 'Joachim', ''], ['Kuchar', 'James K.', '']]","['alerts', 'signal detection', 'decision aids', 'security']"
7228,2109.15224,Hendrik Heuer,Hendrik Heuer,The Explanatory Gap in Algorithmic News Curation,"This paper will be presented at the Third Multidisciplinary
  International Symposium, MISDOOM 2021, held in Oxford, UK",,10.1007/978-3-030-87031-7_1,,cs.HC cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Considering the large amount of available content, social media platforms
increasingly employ machine learning (ML) systems to curate news. This paper
examines how well different explanations help expert users understand why
certain news stories are recommended to them. The expert users were
journalists, who are trained to judge the relevance of news. Surprisingly, none
of the explanations are perceived as helpful. Our investigation provides a
first indication of a gap between what is available to explain ML-based
curation systems and what users need to understand such systems. We call this
the Explanatory Gap in Machine Learning-based Curation Systems.
","[{'version': 'v1', 'created': 'Thu, 30 Sep 2021 15:50:44 GMT'}]",2021-10-01,"[['Heuer', 'Hendrik', '']]","['Algorithmic Transparency', 'Algorithmic Experience', 'Recommender System', 'Algorithmic News Curation', 'Machine Learning']"
7229,1906.10689,Jamal Toutouh,"Jamal Toutouh, Diego Rossit, and Sergio Nesmachnow","Soft computing methods for multiobjective location of garbage
  accumulation points in smart cities",,"Annals of Mathematics and Artificial Intelligence, 2019",10.1007/s10472-019-09647-5,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article describes the application of soft computing methods for solving
the problem of locating garbage accumulation points in urban scenarios. This is
a relevant problem in modern smart cities, in order to reduce negative
environmental and social impacts in the waste management process, and also to
optimize the available budget from the city administration to install waste
bins. A specific problem model is presented, which accounts for reducing the
investment costs, enhance the number of citizens served by the installed bins,
and the accessibility to the system. A family of single- and multi-objective
heuristics based on the PageRank method and two mutiobjective evolutionary
algorithms are proposed. Experimental evaluation performed on real scenarios on
the cities of Montevideo (Uruguay) and Bahia Blanca (Argentina) demonstrates
the effectiveness of the proposed approaches. The methods allow computing
plannings with different trade-off between the problem objectives. The computed
results improve over the current planning in Montevideo and provide a
reasonable budget cost and quality of service for Bahia Blanca.
","[{'version': 'v1', 'created': 'Tue, 25 Jun 2019 16:21:16 GMT'}]",2019-06-27,"[['Toutouh', 'Jamal', ''], ['Rossit', 'Diego', ''], ['Nesmachnow', 'Sergio', '']]","['Computational intelligence', 'waste management', 'smart cities']"
7230,2207.00292,Marco Cotogni,"Marco Cotogni, Claudio Cusano",Offset equivariant networks and their applications,13 pages,Neurocomputing 2022,10.1016/j.neucom.2022.06.118,,cs.CV,http://creativecommons.org/licenses/by-sa/4.0/,"  In this paper we present a framework for the design and implementation of
offset equivariant networks, that is, neural networks that preserve in their
output uniform increments in the input. In a suitable color space this kind of
networks achieves equivariance with respect to the photometric transformations
that characterize changes in the lighting conditions. We verified the framework
on three different problems: image recognition, illuminant estimation, and
image inpainting. Our experiments show that the performance of offset
equivariant networks are comparable to those in the state of the art on regular
data. Differently from conventional networks, however, equivariant networks do
behave consistently well when the color of the illuminant changes.
","[{'version': 'v1', 'created': 'Fri, 1 Jul 2022 09:38:19 GMT'}]",2022-07-06,"[['Cotogni', 'Marco', ''], ['Cusano', 'Claudio', '']]","['Equivariant neural networks', 'Convolutional neural network', 'Image recognition', 'Illuminantestimation', 'Inpainting']"
7231,2009.00387,Xiaokai Chen,Xiaokai Chen and Xiaoguang Gu and Libo Fu,Boosting Share Routing for Multi-task Learning,,,10.1145/3442442.3452323,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Multi-task learning (MTL) aims to make full use of the knowledge contained in
multi-task supervision signals to improve the overall performance. How to make
the knowledge of multiple tasks shared appropriately is an open problem for
MTL. Most existing deep MTL models are based on parameter sharing. However,
suitable sharing mechanism is hard to design as the relationship among tasks is
complicated. In this paper, we propose a general framework called Multi-Task
Neural Architecture Search (MTNAS) to efficiently find a suitable sharing route
for a given MTL problem. MTNAS modularizes the sharing part into multiple
layers of sub-networks. It allows sparse connection among these sub-networks
and soft sharing based on gating is enabled for a certain route. Benefiting
from such setting, each candidate architecture in our search space defines a
dynamic sparse sharing route which is more flexible compared with full-sharing
in previous approaches. We show that existing typical sharing approaches are
sub-graphs in our search space. Extensive experiments on three real-world
recommendation datasets demonstrate MTANS achieves consistent improvement
compared with single-task models and typical multi-task methods while
maintaining high computation efficiency. Furthermore, in-depth experiments
demonstrates that MTNAS can learn suitable sparse route to mitigate negative
transfer.
","[{'version': 'v1', 'created': 'Tue, 1 Sep 2020 12:37:19 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Mar 2021 12:00:31 GMT'}]",2021-03-02,"[['Chen', 'Xiaokai', ''], ['Gu', 'Xiaoguang', ''], ['Fu', 'Libo', '']]","['multi-task learning', 'neural architecture search', 'parameter sharing']"
7232,2005.14284,Muhammad Naseer Bajwa,"Muhammad Naseer Bajwa, Muhammad Imran Malik, Shoaib Ahmed Siddiqui,
  Andreas Dengel, Faisal Shafait, Wolfgang Neumeier, Sheraz Ahmed","Two-stage framework for optic disc localization and glaucoma
  classification in retinal fundus images using deep learning","16 Pages, 10 Figures",BMC medical informatics and decision making 19.1 (2019): 136,10.1186/s12911-019-0842-8,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the advancement of powerful image processing and machine learning
techniques, CAD has become ever more prevalent in all fields of medicine
including ophthalmology. Since optic disc is the most important part of retinal
fundus image for glaucoma detection, this paper proposes a two-stage framework
that first detects and localizes optic disc and then classifies it into healthy
or glaucomatous. The first stage is based on RCNN and is responsible for
localizing and extracting optic disc from a retinal fundus image while the
second stage uses Deep CNN to classify the extracted disc into healthy or
glaucomatous. In addition to the proposed solution, we also developed a
rule-based semi-automatic ground truth generation method that provides
necessary annotations for training RCNN based model for automated disc
localization. The proposed method is evaluated on seven publicly available
datasets for disc localization and on ORIGA dataset, which is the largest
publicly available dataset for glaucoma classification. The results of
automatic localization mark new state-of-the-art on six datasets with accuracy
reaching 100% on four of them. For glaucoma classification we achieved AUC
equal to 0.874 which is 2.7% relative improvement over the state-of-the-art
results previously obtained for classification on ORIGA. Once trained on
carefully annotated data, Deep Learning based methods for optic disc detection
and localization are not only robust, accurate and fully automated but also
eliminates the need for dataset-dependent heuristic algorithms. Our empirical
evaluation of glaucoma classification on ORIGA reveals that reporting only AUC,
for datasets with class imbalance and without pre-defined train and test
splits, does not portray true picture of the classifier's performance and calls
for additional performance metrics to substantiate the results.
","[{'version': 'v1', 'created': 'Thu, 28 May 2020 20:40:19 GMT'}]",2020-06-01,"[['Bajwa', 'Muhammad Naseer', ''], ['Malik', 'Muhammad Imran', ''], ['Siddiqui', 'Shoaib Ahmed', ''], ['Dengel', 'Andreas', ''], ['Shafait', 'Faisal', ''], ['Neumeier', 'Wolfgang', ''], ['Ahmed', 'Sheraz', '']]","['Computer aided diagnosis', 'Deep learning', 'Glaucoma detection', 'Machine learning', 'Medical image analysis', 'Optic disc localization']"
7233,2007.07602,Alireza Shojaifar,"Alireza Shojaifar, Samuel A. Fricker, Martin Gwerder","Automating the Communication of Cybersecurity Knowledge: Multi-Case
  Study","14 pages, 1 figure, 13th World Conference on Information Security
  Education",,10.1007/978-3-030-59291-2_8,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Cybersecurity is essential for the protection of companies against cyber
threats. Traditionally, cybersecurity experts assess and improve a company's
capabilities. However, many small and medium-sized businesses (SMBs) consider
such services not to be affordable. We explore an alternative do-it-yourself
(DIY) approach to bringing cybersecurity to SMBs. Our method and tool, CYSEC,
implements the Self-Determination Theory (SDT) to guide and motivate SMBs to
adopt good cybersecurity practices. CYSEC uses assessment questions and
recommendations to communicate cybersecurity knowledge to the end-user SMBs and
encourage self-motivated change. In this paper, the operationalisation of SDT
in CYSEC is presented and the results of a multi-case study shown that offer
insight into how SMBs adopted cybersecurity practices with CYSEC. Effective
automated cybersecurity communication depended on the SMB's hands-on skills,
tools adaptedness, and the users' willingness to documenting confidential
information. The SMBs wanted to learn in simple, incremental steps, allowing
them to understand what they do. An SMB's motivation to improve security
depended on the fitness of assessment questions and recommendations with the
SMB's business model and IT infrastructure. The results of this study indicate
that automated counselling can help many SMBs in security adoption. The final
publication is available at Springer via
https://link.springer.com/chapter/10.1007%2F978-3-030-59291-2_8
","[{'version': 'v1', 'created': 'Wed, 15 Jul 2020 10:30:20 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Oct 2021 17:00:17 GMT'}]",2021-10-12,"[['Shojaifar', 'Alireza', ''], ['Fricker', 'Samuel A.', ''], ['Gwerder', 'Martin', '']]","['Cybersecurity', 'Small and Medium-sized Businesses', 'Capability Assessment and Improvement', 'Do-It-Yourself', 'Multi-Case Study']"
7234,2007.05877,Daniel Z. Huang,"Philip Avery, Daniel Z. Huang, Wanli He, Johanna Ehlers, Armen
  Derkevorkian, Charbel Farhat","A Computationally Tractable Framework for Nonlinear Dynamic Multiscale
  Modeling of Membrane Fabric","29 pages, 12 figures","International Journal for Numerical Methods in Engineering, 2021",10.1002/nme.6634,,cs.CE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A general-purpose computational homogenization framework is proposed for the
nonlinear dynamic analysis of membranes exhibiting complex microscale and/or
mesoscale heterogeneity characterized by in-plane periodicity that cannot be
effectively treated by a conventional method, such as woven fabrics. The
framework is a generalization of the ""finite element squared"" (or FE2) method
in which a localized portion of the periodic subscale structure is modeled
using finite elements. The numerical solution of displacement driven problems
involving this model can be adapted to the context of membranes by a variant of
the Klinkel-Govindjee method[1] originally proposed for using finite strain,
three-dimensional material models in beam and shell elements. This approach
relies on numerical enforcement of the plane stress constraint and is enabled
by the principle of frame invariance. Computational tractability is achieved by
introducing a regression-based surrogate model informed by a physics-inspired
training regimen in which FE$^2$ is utilized to simulate a variety of numerical
experiments including uniaxial, biaxial and shear straining of a material
coupon. Several alternative surrogate models are evaluated including an
artificial neural network. The framework is demonstrated and validated for a
realistic Mars landing application involving supersonic inflation of a
parachute canopy made of woven fabric.
","[{'version': 'v1', 'created': 'Sun, 12 Jul 2020 00:05:11 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Jan 2021 05:22:15 GMT'}]",2021-01-28,"[['Avery', 'Philip', ''], ['Huang', 'Daniel Z.', ''], ['He', 'Wanli', ''], ['Ehlers', 'Johanna', ''], ['Derkevorkian', 'Armen', ''], ['Farhat', 'Charbel', '']]","['artificial neural network', 'FE squared', 'membrane', 'multiscale', 'parachute', 'regression', 'woven fabrics']"
7235,1905.07220,Maryam Abdolali,Maryam Abdolali and Mohammad Rahmati,"Neither Global Nor Local: A Hierarchical Robust Subspace Clustering For
  Image Data",,"Information Sciences 514, pp. 333-353, 2020",10.1016/j.ins.2019.11.031,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider the problem of subspace clustering in presence of
contiguous noise, occlusion and disguise. We argue that self-expressive
representation of data in current state-of-the-art approaches is severely
sensitive to occlusions and complex real-world noises. To alleviate this
problem, we propose a hierarchical framework that brings robustness of local
patches-based representations and discriminant property of global
representations together. This approach consists of 1) a top-down stage, in
which the input data is subject to repeated division to smaller patches and 2)
a bottom-up stage, in which the low rank embedding of local patches in field of
view of a corresponding patch in upper level are merged on a Grassmann
manifold. This summarized information provides two key information for the
corresponding patch on the upper level: cannot-links and recommended-links.
This information is employed for computing a self-expressive representation of
each patch at upper levels using a weighted sparse group lasso optimization
problem. Numerical results on several real data sets confirm the efficiency of
our approach.
","[{'version': 'v1', 'created': 'Fri, 17 May 2019 12:07:01 GMT'}]",2020-01-07,"[['Abdolali', 'Maryam', ''], ['Rahmati', 'Mohammad', '']]","['sparse subspace clustering', 'multi-scale', 'grassmann manifold', 'group lasso', 'spectralclustering', 'graph fusion']"
7236,2104.14860,Silvia Casola,Silvia Casola and Alberto Lavelli,"Summarization, Simplification, and Generation: The Case of Patents",,"Expert System With Applications, 2022",10.1016/j.eswa.2022.117627,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We survey Natural Language Processing (NLP) approaches to summarizing,
simplifying, and generating patents' text. While solving these tasks has
important practical applications - given patents' centrality in the R&D process
- patents' idiosyncrasies open peculiar challenges to the current NLP state of
the art. This survey aims at a) describing patents' characteristics and the
questions they raise to the current NLP systems, b) critically presenting
previous work and its evolution, and c) drawing attention to directions of
research in which further work is needed. To the best of our knowledge, this is
the first survey of generative approaches in the patent domain.
","[{'version': 'v1', 'created': 'Fri, 30 Apr 2021 09:28:29 GMT'}, {'version': 'v2', 'created': 'Thu, 26 May 2022 11:37:02 GMT'}]",2022-05-27,"[['Casola', 'Silvia', ''], ['Lavelli', 'Alberto', '']]","['Natural Language Processing', 'Patent Mining', 'Summarization', 'Simplification', 'Natural Language Generation', 'Survey']"
7237,2002.03620,Anil Yaman,"Anil Yaman, Giovanni Iacca, Decebal Constantin Mocanu, George
  Fletcher, Mykola Pechenizkiy",Novelty Producing Synaptic Plasticity,,,10.1145/3377929.3389976,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A learning process with the plasticity property often requires reinforcement
signals to guide the process. However, in some tasks (e.g. maze-navigation), it
is very difficult (or impossible) to measure the performance of an agent (i.e.
a fitness value) to provide reinforcements since the position of the goal is
not known. This requires finding the correct behavior among a vast number of
possible behaviors without having the knowledge of the reinforcement signals.
In these cases, an exhaustive search may be needed. However, this might not be
feasible especially when optimizing artificial neural networks in continuous
domains. In this work, we introduce novelty producing synaptic plasticity
(NPSP), where we evolve synaptic plasticity rules to produce as many novel
behaviors as possible to find the behavior that can solve the problem. We
evaluate the NPSP on maze-navigation on deceptive maze environments that
require complex actions and the achievement of subgoals to complete. Our
results show that the search heuristic used with the proposed NPSP is indeed
capable of producing much more novel behaviors in comparison with a random
search taken as baseline.
","[{'version': 'v1', 'created': 'Mon, 10 Feb 2020 09:52:41 GMT'}]",2020-12-21,"[['Yaman', 'Anil', ''], ['Iacca', 'Giovanni', ''], ['Mocanu', 'Decebal Constantin', ''], ['Fletcher', 'George', ''], ['Pechenizkiy', 'Mykola', '']]","['Unsupervised learning', 'novelty search', 'task-agnostic learning', 'synaptic plasticity']"
7238,1908.07034,Peter Turney,Peter D. Turney,Symbiosis Promotes Fitness Improvements in the Game of Life,"Changes to Sections 1, 3, 4, 5, and 6. Figures and tables appear at
  the end of the document","Artificial Life, 26(3): 338-365 (2020)",10.1162/artl_a_00326,,cs.NE q-bio.PE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a computational simulation of evolving entities that includes
symbiosis with shifting levels of selection. Evolution by natural selection
shifts from the level of the original entities to the level of the new
symbiotic entity. In the simulation, the fitness of an entity is measured by a
series of one-on-one competitions in the Immigration Game, a two-player
variation of Conway's Game of Life. Mutation, reproduction, and symbiosis are
implemented as operations that are external to the Immigration Game. Because
these operations are external to the game, we are able to freely manipulate the
operations and observe the effects of the manipulations. The simulation is
composed of four layers, each layer building on the previous layer. The first
layer implements a simple form of asexual reproduction, the second layer
introduces a more sophisticated form of asexual reproduction, the third layer
adds sexual reproduction, and the fourth layer adds symbiosis. The experiments
show that a small amount of symbiosis, added to the other layers, significantly
increases the fitness of the population. We suggest that the model may provide
new insights into symbiosis in biological and cultural evolution.
","[{'version': 'v1', 'created': 'Mon, 19 Aug 2019 19:18:47 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Apr 2020 20:28:18 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Jun 2020 19:06:54 GMT'}]",2020-09-24,"[['Turney', 'Peter D.', '']]","['Symbiosis', 'cooperation', 'open-ended evolution', 'Game of Life', 'Immigration Game', 'levels of']"
7239,2203.04440,Kshitiz Bansal,"Kshitiz Bansal, Keshav Rungta, Siyuan Zhu, Dinesh Bharadia",Pointillism: Accurate 3D bounding box estimation with multi-radars,Accepted in SenSys '20. Dataset has been made publicly available,"Proceedings of the 18th Conference on Embedded Networked Sensor
  Systems. Pages 340-353, 2020",10.1145/3384419.3430783,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Autonomous perception requires high-quality environment sensing in the form
of 3D bounding boxes of dynamic objects. The primary sensors used in automotive
systems are light-based cameras and LiDARs. However, they are known to fail in
adverse weather conditions. Radars can potentially solve this problem as they
are barely affected by adverse weather conditions. However, specular
reflections of wireless signals cause poor performance of radar point clouds.
We introduce Pointillism, a system that combines data from multiple spatially
separated radars with an optimal separation to mitigate these problems. We
introduce a novel concept of Cross Potential Point Clouds, which uses the
spatial diversity induced by multiple radars and solves the problem of noise
and sparsity in radar point clouds. Furthermore, we present the design of
RP-net, a novel deep learning architecture, designed explicitly for radar's
sparse data distribution, to enable accurate 3D bounding box estimation. The
spatial techniques designed and proposed in this paper are fundamental to
radars point cloud distribution and would benefit other radar sensing
applications.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2022 23:09:58 GMT'}]",2022-03-10,"[['Bansal', 'Kshitiz', ''], ['Rungta', 'Keshav', ''], ['Zhu', 'Siyuan', ''], ['Bharadia', 'Dinesh', '']]","['mmWaves', 'Radar Perception', 'Deep Learning', 'Adverse Weather', 'Autonomous Driving', 'Object Detection']"
7240,2203.13036,Jane Cleland-Huang,"Jane Cleland-Huang, Ankit Agrawal, Michael Vierhauser, Michael Murphy,
  Mike Prieto",Extending MAPE-K to support Human-Machine Teaming,"Final published version appearing in 17th Symposium on Software
  Engineering for Adaptive and Self-Managing Systems (SEAMS 2022)",,10.1145/3524844.3528054,,cs.RO cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The MAPE-K feedback loop has been established as the primary reference model
for self-adaptive and autonomous systems in domains such as autonomous driving,
robotics, and Cyber-Physical Systems. At the same time, the Human Machine
Teaming (HMT) paradigm is designed to promote partnerships between humans and
autonomous machines. It goes far beyond the degree of collaboration expected in
human-on-the-loop and human-in-the-loop systems and emphasizes interactions,
partnership, and teamwork between humans and machines. However, while MAPE-K
enables fully autonomous behavior, it does not explicitly address the
interactions between humans and machines as intended by HMT. In this paper, we
present the MAPE-K-HMT framework which augments the traditional MAPE-K loop
with support for HMT. We identify critical human-machine teaming factors and
describe the infrastructure needed across the various phases of the MAPE-K loop
in order to effectively support HMT. This includes runtime models that are
constructed and populated dynamically across monitoring, analysis, planning,
and execution phases to support human-machine partnerships. We illustrate
MAPE-K-HMT using examples from an autonomous multi-UAV emergency response
system, and present guidelines for integrating HMT into MAPE-K.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2022 12:30:50 GMT'}]",2022-03-25,"[['Cleland-Huang', 'Jane', ''], ['Agrawal', 'Ankit', ''], ['Vierhauser', 'Michael', ''], ['Murphy', 'Michael', ''], ['Prieto', 'Mike', '']]","['Self-Adaptive Systems', 'Human-Machine Teaming', 'AutonomousSystems', 'MAPE-K']"
7241,1606.02792,John See,"Sze-Teng Liong, John See, Raphael Chung-Wei Phan, Yee-Hui Oh, Anh Cat
  Le Ngo, KokSheik Wong, Su-Wei Tan","Spontaneous Subtle Expression Detection and Recognition based on Facial
  Strain","21 pages (including references), single column format, accepted to
  Signal Processing: Image Communication journal",Signal Proc. Image Comm. 47 (2016) 170-182,10.1016/j.image.2016.06.004,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optical strain is an extension of optical flow that is capable of quantifying
subtle changes on faces and representing the minute facial motion intensities
at the pixel level. This is computationally essential for the relatively new
field of spontaneous micro-expression, where subtle expressions can be
technically challenging to pinpoint. In this paper, we present a novel method
for detecting and recognizing micro-expressions by utilizing facial optical
strain magnitudes to construct optical strain features and optical strain
weighted features. The two sets of features are then concatenated to form the
resultant feature histogram. Experiments were performed on the CASME II and
SMIC databases. We demonstrate on both databases, the usefulness of optical
strain information and more importantly, that our best approaches are able to
outperform the original baseline results for both detection and recognition
tasks. A comparison of the proposed method with other existing spatio-temporal
feature extraction approaches is also presented.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2016 00:47:30 GMT'}]",2016-07-05,"[['Liong', 'Sze-Teng', ''], ['See', 'John', ''], ['Phan', 'Raphael Chung-Wei', ''], ['Oh', 'Yee-Hui', ''], ['Ngo', 'Anh Cat Le', ''], ['Wong', 'KokSheik', ''], ['Tan', 'Su-Wei', '']]","['Subtle expressions', 'Micro-expressions', 'Facial strain', 'Detection', 'Recognition']"
7242,2007.02199,Kaylea Champion,Kaylea Champion,Characterizing Online Vandalism: A Rational Choice Perspective,,,10.1145/3400806.3400813,,cs.SI cs.CY cs.HC,http://creativecommons.org/licenses/by-sa/4.0/,"  What factors influence the decision to vandalize? Although the harm is clear,
the benefit to the vandal is less clear. In many cases, the thing being damaged
may itself be something the vandal uses or enjoys. Vandalism holds
communicative value: perhaps to the vandal themselves, to some audience at whom
the vandalism is aimed, and to the general public. Viewing vandals as rational
community participants despite their antinormative behavior offers the
possibility of engaging with or countering their choices in novel ways.
Rational choice theory (RCT) as applied in value expectancy theory (VET) offers
a strategy for characterizing behaviors in a framework of rational choices, and
begins with the supposition that subject to some weighting of personal
preferences and constraints, individuals maximize their own utility by
committing acts of vandalism. This study applies the framework of RCT and VET
to gain insight into vandals' preferences and constraints. Using a
mixed-methods analysis of Wikipedia, I combine social computing and
criminological perspectives on vandalism to propose an ontology of vandalism
for online content communities. I use this ontology to categorize 141 instances
of vandalism and find that the character of vandalistic acts varies by vandals'
relative identifiability, policy history with Wikipedia, and the effort
required to vandalize.
","[{'version': 'v1', 'created': 'Sat, 4 Jul 2020 22:29:22 GMT'}]",2020-07-07,"[['Champion', 'Kaylea', '']]","['rational choice', 'RCT', 'vandalism', 'wikipedia', 'anonymity', 'graffiti', 'online community']"
7243,2210.05282,Jaros{\l}aw Miszczak,"Mateusz \.Zarski, Bartosz W\'ojcik, Jaros{\l}aw A. Miszczak,
  Bart{\l}omiej Blachowski, Mariusz Ostrowski","Computer Vision based inspection on post-earthquake with UAV synthetic
  dataset","15 pages, 8 figures, published version, software available from
  https://github.com/MatZar01/IC_SHM_P2","IEEE Access, Vol. 10 (2022), pp. 108134-108144",10.1109/ACCESS.2022.3212918,,cs.CV cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  The area affected by the earthquake is vast and often difficult to entirely
cover, and the earthquake itself is a sudden event that causes multiple defects
simultaneously, that cannot be effectively traced using traditional, manual
methods. This article presents an innovative approach to the problem of
detecting damage after sudden events by using an interconnected set of deep
machine learning models organized in a single pipeline and allowing for easy
modification and swapping models seamlessly. Models in the pipeline were
trained with a synthetic dataset and were adapted to be further evaluated and
used with unmanned aerial vehicles (UAVs) in real-world conditions. Thanks to
the methods presented in the article, it is possible to obtain high accuracy in
detecting buildings defects, segmenting constructions into their components and
estimating their technical condition based on a single drone flight.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2022 09:27:07 GMT'}]",2022-11-29,"[['Żarski', 'Mateusz', ''], ['Wójcik', 'Bartosz', ''], ['Miszczak', 'Jarosław A.', ''], ['Blachowski', 'Bartłomiej', ''], ['Ostrowski', 'Mariusz', '']]","['Structural health monitoring', 'machine learning', 'defect detection', 'synthetic dataset']"
7244,2109.00900,Gui Cheng,"Zhenfeng Shao, Gui Cheng, Deren Li, Xiao Huang, Zhipeng Lu, Jian Liu","Spatio-temporal-spectral-angular observation model that integrates
  observations from UAV and mobile mapping vehicle for better urban mapping",,,10.1080/10095020.2021.1961567,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  In a complex urban scene, observation from a single sensor unavoidably leads
to voids in observations, failing to describe urban objects in a comprehensive
manner. In this paper, we propose a spatio-temporal-spectral-angular
observation model to integrate observations from UAV and mobile mapping vehicle
platform, realizing a joint, coordinated observation operation from both air
and ground. We develop a multi-source remote sensing data acquisition system to
effectively acquire multi-angle data of complex urban scenes. Multi-source data
fusion solves the missing data problem caused by occlusion and achieves
accurate, rapid, and complete collection of holographic spatial and temporal
information in complex urban scenes. We carried out an experiment on Baisha
Town, Chongqing, China and obtained multi-sensor, multi-angle data from UAV and
mobile mapping vehicle. We first extracted the point cloud from UAV and then
integrated the UAV and mobile mapping vehicle point cloud. The integrated
results combined both the characteristic of UAV and mobile mapping vehicle
point cloud, confirming the practicability of the proposed joint data
acquisition platform and the effectiveness of spatio-temporal-spectral-angular
observation model. Compared with the observation from UAV or mobile mapping
vehicle alone, the integrated system provides an effective data acquisition
solution towards comprehensive urban monitoring.
","[{'version': 'v1', 'created': 'Tue, 24 Aug 2021 02:58:12 GMT'}, {'version': 'v2', 'created': 'Sun, 5 Sep 2021 14:23:16 GMT'}]",2021-09-07,"[['Shao', 'Zhenfeng', ''], ['Cheng', 'Gui', ''], ['Li', 'Deren', ''], ['Huang', 'Xiao', ''], ['Lu', 'Zhipeng', ''], ['Liu', 'Jian', '']]","['Urban remote sensing', 'data fusion', 'spatio-temporal-spectral-angular observation model', 'UAV', 'mobile mapping vehicle']"
7245,2111.01877,Marlin Strub,"Marlin P. Strub, Jonathan D. Gammell",AIT* and EIT*: Asymmetric bidirectional sampling-based path planning,"25 pages, 12 figures, 2 tables. Videos available at
  https://www.youtube.com/watch?v=aC2xBwOcDoo and
  https://www.youtube.com/playlist?list=PLbaQBz4TuPczfN6PN6NkfmlnXpcf79Aq_","The International Journal of Robotics Research (IJRR), 41(4):
  390-417, 2022",10.1177/02783649211069572,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optimal path planning is the problem of finding a valid sequence of states
between a start and goal that optimizes an objective. Informed path planning
algorithms order their search with problem-specific knowledge expressed as
heuristics and can be orders of magnitude more efficient than uninformed
algorithms. Heuristics are most effective when they are both accurate and
computationally inexpensive to evaluate, but these are often conflicting
characteristics. This makes the selection of appropriate heuristics difficult
for many problems.
  This paper presents two almost-surely asymptotically optimal sampling-based
path planning algorithms to address this challenge, Adaptively Informed Trees
(AIT*) and Effort Informed Trees (EIT*). These algorithms use an asymmetric
bidirectional search in which both searches continuously inform each other.
This allows AIT* and EIT* to improve planning performance by simultaneously
calculating and exploiting increasingly accurate, problem-specific heuristics.
  The benefits of AIT* and EIT* relative to other sampling-based algorithms are
demonstrated on twelve problems in abstract, robotic, and biomedical domains
optimizing path length and obstacle clearance. The experiments show that AIT*
and EIT* outperform other algorithms on problems optimizing obstacle clearance,
where a priori cost heuristics are often ineffective, and still perform well on
problems minimizing path length, where such heuristics are often effective.
","[{'version': 'v1', 'created': 'Tue, 2 Nov 2021 20:29:34 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Oct 2022 17:38:02 GMT'}]",2022-10-24,"[['Strub', 'Marlin P.', ''], ['Gammell', 'Jonathan D.', '']]","['sampling-based path planning', 'optimal path planning', 'heuristics', 'problem-specific heuristics', 'informed search', 'informedbidirectional search']"
7246,2204.04190,Ghassan Samara,"Ghassan Samara, Abla Hussein, Israa Abdullah Matarneh, Mohammed
  Alrefai, Maram Y Al-Safarini",Internet of Robotic Things: Current Technologies and Applications,6 pages,"2021 22nd International Arab Conference on Information Technology
  (ACIT)",10.1109/ACIT53391.2021.9677407,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  The Internet of Robotic Things (IoRT) is a new domain that aims to link the
IoT environment with robotic systems and technologies. IoRT connects robotic
systems, connects them to the cloud, and transfers critical information as well
as knowledge exchange to conduct complicated and intricate activities that a
human cannot readily perform. The pertinent notion of IoRT has been discussed
in this paper, along with the issues that this area faces on a daily basis.
Furthermore, technological applications have been examined in order to provide
a better understanding of IoRT and its current development phenomenon. The
study describes three layers of IoRT infrastructure: network and control,
physical, and service and application layer. In the next section, IoRT problems
have been presented, with a focus on data processing and the security and
safety of IoRT technological systems. In addition to discussing the
difficulties, appropriate solutions have been offered and recommended. IoRT is
regarded as an essential technology with the ability to bring about a plethora
of benefits in smart society upon adoption, contributing to the generation and
development of smart cities and industries in the near future.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2022 10:44:03 GMT'}]",2022-04-11,"[['Samara', 'Ghassan', ''], ['Hussein', 'Abla', ''], ['Matarneh', 'Israa Abdullah', ''], ['Alrefai', 'Mohammed', ''], ['Al-Safarini', 'Maram Y', '']]","['Internet of Robotic Things', 'IoRT', 'Data Processing', 'Security and Safety', 'IoT', 'Cloud Robots']"
7247,2006.05120,Johanna Barzen,"Frank Leymann, Johanna Barzen",Pattern Atlas,10 pages,"Next-Gen Digital Services. A Retrospective and Roadmap for Service
  Computing of the Future. Lecture Notes in Computer Science, vol 12521, 2021,
  Springer, Cham",10.1007/978-3-030-73203-5_5,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pattern languages are well-established in the software architecture
community. Many different aspects of creating a software architecture are
addressed by such languages. Thus, several pattern languages have to be
considered when building a particular architecture. But these pattern languages
are isolated, i.e. it is hard to determine the relevant patterns to be applied
from the different pattern languages. Moreover, the sum of patterns from
different languages may be huge, i.e. restriction to relevant patterns is
desirable. In this contribution we envision an encompassing tool, the pattern
atlas, that supports building complex systems based on pattern languages. The
analogy to cartography motivates the name of the tool.
","[{'version': 'v1', 'created': 'Tue, 9 Jun 2020 08:48:37 GMT'}]",2021-04-21,"[['Leymann', 'Frank', ''], ['Barzen', 'Johanna', '']]","['Pattern Languages', 'Software Architecture', 'Cartography', 'Manifolds']"
7248,1706.10283,Davis Blalock,"Davis W Blalock, John V Guttag",Bolt: Accelerated Data Mining with Fast Vector Compression,Research track paper at KDD 2017,,10.1145/3097983.3098195,,cs.PF stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vectors of data are at the heart of machine learning and data mining.
Recently, vector quantization methods have shown great promise in reducing both
the time and space costs of operating on vectors. We introduce a vector
quantization algorithm that can compress vectors over 12x faster than existing
techniques while also accelerating approximate vector operations such as
distance and dot product computations by up to 10x. Because it can encode over
2GB of vectors per second, it makes vector quantization cheap enough to employ
in many more circumstances. For example, using our technique to compute
approximate dot products in a nested loop can multiply matrices faster than a
state-of-the-art BLAS implementation, even when our algorithm must first
compress the matrices.
  In addition to showing the above speedups, we demonstrate that our approach
can accelerate nearest neighbor search and maximum inner product search by over
100x compared to floating point operations and up to 10x compared to other
vector quantization methods. Our approximate Euclidean distance and dot product
computations are not only faster than those of related algorithms with slower
encodings, but also faster than Hamming distance computations, which have
direct hardware support on the tested platforms. We also assess the errors of
our algorithm's approximate distances and dot products, and find that it is
competitive with existing, slower vector quantization algorithms.
","[{'version': 'v1', 'created': 'Fri, 30 Jun 2017 17:31:59 GMT'}]",2017-07-03,"[['Blalock', 'Davis W', ''], ['Guttag', 'John V', '']]","['Vector Qantization', 'Scalability', 'Compression', 'Nearest NeighborSearch']"
7249,2202.08959,Shen Qijie,"Qijie Shen, Hong Wen, Wanjie Tao, Jing Zhang, Fuyu Lv, Zulong Chen,
  Zhao Li","Deep Interest Highlight Network for Click-Through Rate Prediction in
  Trigger-Induced Recommendation",Accepted by WWW 2022,,10.1145/3485447.3511970,,cs.IR cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In many classical e-commerce platforms, personalized recommendation has been
proven to be of great business value, which can improve user satisfaction and
increase the revenue of platforms. In this paper, we present a new
recommendation problem, Trigger-Induced Recommendation (TIR), where users'
instant interest can be explicitly induced with a trigger item and follow-up
related target items are recommended accordingly. TIR has become ubiquitous and
popular in e-commerce platforms. In this paper, we figure out that although
existing recommendation models are effective in traditional recommendation
scenarios by mining users' interests based on their massive historical
behaviors, they are struggling in discovering users' instant interests in the
TIR scenario due to the discrepancy between these scenarios, resulting in
inferior performance. To tackle the problem, we propose a novel recommendation
method named Deep Interest Highlight Network (DIHN) for Click-Through Rate
(CTR) prediction in TIR scenarios. It has three main components including 1)
User Intent Network (UIN), which responds to generate a precise probability
score to predict user's intent on the trigger item; 2) Fusion Embedding Module
(FEM), which adaptively fuses trigger item and target item embeddings based on
the prediction from UIN; and (3) Hybrid Interest Extracting Module (HIEM),
which can effectively highlight users' instant interest from their behaviors
based on the result of FEM. Extensive offline and online evaluations on a
real-world e-commerce platform demonstrate the superiority of DIHN over
state-of-the-art methods.
","[{'version': 'v1', 'created': 'Sat, 5 Feb 2022 08:40:30 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Feb 2022 02:50:14 GMT'}]",2022-02-22,"[['Shen', 'Qijie', ''], ['Wen', 'Hong', ''], ['Tao', 'Wanjie', ''], ['Zhang', 'Jing', ''], ['Lv', 'Fuyu', ''], ['Chen', 'Zulong', ''], ['Li', 'Zhao', '']]","['Recommender System', 'Click-Through Rate Prediction', 'TriggerInduced Recommendation', 'Users’ Behavior Modelling']"
7250,2110.12490,Akash Pallath,Akash Pallath and Qiyang Zhang,Paperfetcher: A tool to automate handsearch for systematic reviews,,,10.1002/jrsm.1604,,cs.IR stat.AP,http://creativecommons.org/licenses/by/4.0/,"  Handsearch is an important technique that contributes to thorough literature
search in systematic reviews. Traditional handsearch requires reviewers to
systematically browse through each issue of a curated list of field-specific
journals and conference proceedings to find articles relevant to their review.
This manual process is not only time-consuming, laborious, costly, and
error-prone, but it also lacks replicability and cross-checking mechanisms. In
an attempt to solve these problems, this paper presents a free and open-source
Python package and an accompanying web-app, Paperfetcher, to automate
handsearch for systematic reviews. With Paperfetcher's assistance, researchers
can retrieve articles from designated journals within a specified time frame
with just a few clicks. In addition to handsearch, this tool also incorporates
snowballing in both directions. Paperfetcher allows researchers to download
retrieved studies as a list of DOIs or as an RIS database to facilitate
seamless import into citation management and systematic review screening
software. To our knowledge, Paperfetcher is the first tool that automates
handsearch with high usability and a multi-disciplinary focus.
","[{'version': 'v1', 'created': 'Sun, 24 Oct 2021 17:15:17 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Oct 2021 13:34:05 GMT'}, {'version': 'v3', 'created': 'Fri, 7 Jan 2022 03:57:37 GMT'}]",2022-10-21,"[['Pallath', 'Akash', ''], ['Zhang', 'Qiyang', '']]","['Systematic reviews', 'literature search', 'handsearch', 'information retrieval', 'snowballing', 'web-app']"
7251,2103.06569,Hamidreza Dehghani,Hamidreza Dehghani and Andreas Zilian,"ANN-aided incremental multiscale-remodelling-based finite strain
  poroelasticity",,,10.1007/s00466-021-02023-3,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  Mechanical modelling of poroelastic media under finite strain is usually
carried out via phenomenological models neglecting complex micro-macro scales
interdependency. One reason is that the mathematical two-scale analysis is only
straightforward assuming infinitesimal strain theory. Exploiting the potential
of ANNs for fast and reliable upscaling and localisation procedures, we propose
an incremental numerical approach that considers rearrangement of the cell
properties based on its current deformation, which leads to the remodelling of
the macroscopic model after each time increment. This computational framework
is valid for finite strain and large deformation problems while it ensures
infinitesimal strain increments within time steps. The full effects of the
interdependency between the properties and response of macro and micro scales
are considered for the first time providing more accurate predictive analysis
of fluid-saturated porous media which is studied via a numerical consolidation
example. Furthermore, the (nonlinear) deviation from Darcy's law is captured in
fluid filtration numerical analyses. Finally, the brain tissue mechanical
response under uniaxial cyclic test is simulated and studied.
","[{'version': 'v1', 'created': 'Thu, 11 Mar 2021 09:52:12 GMT'}]",2021-05-07,"[['Dehghani', 'Hamidreza', ''], ['Zilian', 'Andreas', '']]","['Homogenisation and Localisation', 'Remodelling', 'PoroHyperelasticity', 'Data-drivencomputational mechanics', 'Deviation from Darcy’s law', 'Brain tissue modelling']"
7252,2106.11929,Zhiqiang Gong,Zhiqiang Gong and Weien Zhou and Jun Zhang and Wei Peng and Wen Yao,"Joint Deep Reversible Regression Model and Physics-Informed Unsupervised
  Learning for Temperature Field Reconstruction",Accepted by Engineering Applications of Artificial Intelligence,"Engineering Applications of Artificial Intelligence, 2023",10.1016/j.engappai.2022.105686,,cs.LG cs.AI,http://creativecommons.org/publicdomain/zero/1.0/,"  Temperature monitoring during the life time of heat source components in
engineering systems becomes essential to guarantee the normal work and the
working life of these components. However, prior methods, which mainly use the
interpolate estimation to reconstruct the temperature field from limited
monitoring points, require large amounts of temperature tensors for an accurate
estimation. This may decrease the availability and reliability of the system
and sharply increase the monitoring cost. To solve this problem, this work
develops a novel physics-informed deep reversible regression models for
temperature field reconstruction of heat-source systems (TFR-HSS), which can
better reconstruct the temperature field with limited monitoring points
unsupervisedly. First, we define the TFR-HSS task mathematically, and
numerically model the task, and hence transform the task as an image-to-image
regression problem. Then this work develops the deep reversible regression
model which can better learn the physical information, especially over the
boundary. Finally, considering the physical characteristics of heat conduction
as well as the boundary conditions, this work proposes the physics-informed
reconstruction loss including four training losses and jointly learns the deep
surrogate model with these losses unsupervisedly. Experimental studies have
conducted over typical two-dimensional heat-source systems to demonstrate the
effectiveness of the proposed method.
","[{'version': 'v1', 'created': 'Tue, 22 Jun 2021 17:01:53 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Jun 2021 03:25:01 GMT'}, {'version': 'v3', 'created': 'Mon, 5 Jul 2021 02:58:16 GMT'}, {'version': 'v4', 'created': 'Thu, 5 May 2022 01:28:24 GMT'}, {'version': 'v5', 'created': 'Tue, 29 Nov 2022 06:57:30 GMT'}]",2022-12-27,"[['Gong', 'Zhiqiang', ''], ['Zhou', 'Weien', ''], ['Zhang', 'Jun', ''], ['Peng', 'Wei', ''], ['Yao', 'Wen', '']]","['Numerically Modeling', 'Image-to-Image Regression', 'Deep']"
7253,1905.13653,Aleksei Shestov,Aleksei Shestov and Mikhail Kumskov,A Riemanian Approach to Blob Detection in Manifold-Valued Images,Published in GSI 2017 proceedings,"Third International Conference, GSI 2017, Paris, France, November
  7-9, 2017, Proceedings, pp. 727-736",10.1007/978-3-319-68445-1,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is devoted to the problem of blob detection in manifold-valued
images. Our solution is based on new definitions of blob response functions. We
define the blob response functions by means of curvatures of an image graph,
considered as a submanifold. We call the proposed framework Riemannian blob
detection. We prove that our approach can be viewed as a generalization of the
grayscale blob detection technique. An expression of the Riemannian blob
response functions through the image Hessian is derived. We provide experiments
for the case of vector-valued images on 2D surfaces: the proposed framework is
tested on the task of chemical compounds classification.
","[{'version': 'v1', 'created': 'Fri, 31 May 2019 14:53:44 GMT'}]",2019-06-03,"[['Shestov', 'Aleksei', ''], ['Kumskov', 'Mikhail', '']]","['blob detection', 'image processing', 'manifold-valued images', 'vector-valued images', 'differential geometry']"
7254,2107.14776,Alberto Mozo,"Alberto Mozo, \'Angel Gonz\'alez-Prieto, Antonio Pastor, Sandra
  G\'omez-Canaval, Edgar Talavera","Synthetic flow-based cryptomining attack generation through Generative
  Adversarial Networks","35 pages, 13 figures, 8 tables",Scientific Reports (2022),10.1038/s41598-022-06057-2,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the growing rise of cyber attacks in the Internet, flow-based data
sets are crucial to increase the performance of the Machine Learning (ML)
components that run in network-based intrusion detection systems (IDS). To
overcome the existing network traffic data shortage in attack analysis, recent
works propose Generative Adversarial Networks (GANs) for synthetic flow-based
network traffic generation. Data privacy is appearing more and more as a strong
requirement when processing such network data, which suggests to find solutions
where synthetic data can fully replace real data. Because of the
ill-convergence of the GAN training, none of the existing solutions can
generate high-quality fully synthetic data that can totally substitute real
data in the training of IDS ML components. Therefore, they mix real with
synthetic data, which acts only as data augmentation components, leading to
privacy breaches as real data is used. In sharp contrast, in this work we
propose a novel deterministic way to measure the quality of the synthetic data
produced by a GAN both with respect to the real data and to its performance
when used for ML tasks. As a byproduct, we present a heuristic that uses these
metrics for selecting the best performing generator during GAN training,
leading to a stopping criterion. An additional heuristic is proposed to select
the best performing GANs when different types of synthetic data are to be used
in the same ML task. We demonstrate the adequacy of our proposal by generating
synthetic cryptomining attack traffic and normal traffic flow-based data using
an enhanced version of a Wasserstein GAN. We show that the generated synthetic
network traffic can completely replace real data when training a ML-based
cryptomining detector, obtaining similar performance and avoiding privacy
violations, since real data is not used in the training of the ML-based
detector.
","[{'version': 'v1', 'created': 'Fri, 30 Jul 2021 17:27:55 GMT'}]",2022-02-09,"[['Mozo', 'Alberto', ''], ['González-Prieto', 'Ángel', ''], ['Pastor', 'Antonio', ''], ['Gómez-Canaval', 'Sandra', ''], ['Talavera', 'Edgar', '']]","['Network traffic generation', 'Generative Adversarial Networks', 'cryptomining', 'Jaccard index', 'Cyber-range']"
7255,2103.08312,Ekaterina Gracheva,Ekaterina Gracheva,Trainless Model Performance Estimation for Neural Architecture Search,,"Array E. Gracheva, Array, Volume 12, December 2021, 100082",10.1016/j.array.2021.100082,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Neural architecture search has become an indispensable part of the deep
learning field. Modern methods allow to find one of the best performing
architectures, or to build one from scratch, but they typically make decisions
based on the trained accuracy information. In the present article we explore
instead how the architectural component of a neural network affects its
prediction power. We focus on relationships between the trained accuracy of an
architecture and its accuracy prior to training, by considering statistics over
multiple initialisations. We observe that minimising the coefficient of
variation of the untrained accuracy, $CV_{U}$, consistently leads to better
performing architectures. We test the $CV_{U}$ as a neural architecture search
scoring metric using the NAS-Bench-201 database of trained neural
architectures. The architectures with the lowest $CV_{U}$ value have on average
an accuracy of $91.90 \pm 2.27$, $64.08 \pm 5.63$ and $38.76 \pm 6.62$ for
CIFAR-10, CIFAR-100 and a downscaled version of ImageNet, respectively. Since
these values are statistically above the random baseline, we make a conclusion
that a good architecture should be stable against weights initialisations. It
takes about $190$ s for CIFAR-10 and CIFAR-100 and $133.9$ s for ImageNet16-120
to process $100$ architectures, on a batch of $256$ images, with $100$
initialisations.
","[{'version': 'v1', 'created': 'Wed, 10 Mar 2021 06:20:27 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Sep 2021 01:05:44 GMT'}]",2021-10-01,"[['Gracheva', 'Ekaterina', '']]","['Neural architecture search', 'Trainless architecture search', 'Deeplearning', 'Machine learning']"
7256,2003.02427,Felix Wolf Hans Erich Von Drigalski,"Felix von Drigalski, Chisato Nakashima, Yoshiya Shibata, Yoshinori
  Konishi, Joshua C. Triyonoputro, Kaidi Nie, Damien Petit, Toshio Ueshiba,
  Ryuichi Takase, Yukiyasu Domae, Taku Yoshioka, Yoshihisa Ijiri, Ixchel G.
  Ramirez-Alpizar, Weiwei Wan and Kensuke Harada","Team O2AS at the World Robot Summit 2018: An Approach to Robotic Kitting
  and Assembly Tasks using General Purpose Grippers and Tools",,,10.1080/01691864.2020.1734481,,cs.RO cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a versatile robotic system for kitting and assembly tasks which
uses no jigs or commercial tool changers. Instead of specialized end effectors,
it uses its two-finger grippers to grasp and hold tools to perform subtasks
such as screwing and suctioning. A third gripper is used as a precision picking
and centering tool, and uses in-built passive compliance to compensate for
small position errors and uncertainty. A novel grasp point detection for bin
picking is described for the kitting task, using a single depth map. Using the
proposed system we competed in the Assembly Challenge of the Industrial
Robotics Category of the World Robot Challenge at the World Robot Summit 2018,
obtaining 4th place and the SICE award for lean design and versatile tool use.
We show the effectiveness of our approach through experiments performed during
the competition.
","[{'version': 'v1', 'created': 'Thu, 5 Mar 2020 04:34:09 GMT'}]",2020-03-06,"[['von Drigalski', 'Felix', ''], ['Nakashima', 'Chisato', ''], ['Shibata', 'Yoshiya', ''], ['Konishi', 'Yoshinori', ''], ['Triyonoputro', 'Joshua C.', ''], ['Nie', 'Kaidi', ''], ['Petit', 'Damien', ''], ['Ueshiba', 'Toshio', ''], ['Takase', 'Ryuichi', ''], ['Domae', 'Yukiyasu', ''], ['Yoshioka', 'Taku', ''], ['Ijiri', 'Yoshihisa', ''], ['Ramirez-Alpizar', 'Ixchel G.', ''], ['Wan', 'Weiwei', ''], ['Harada', 'Kensuke', '']]","['Robots in Manufacturing', 'Robot Competitions', 'Factory Automation', 'Assembly', 'Multi-stage planning']"
7257,2012.01139,Uriel Melendres,Charis Ann M. Sancho and Uriel M. Melendres,"Development of Dynamic Local Area Network (LAN) Based Mock Board
  Examination System",18 pages,"International Journal of Computing Sciences Research, 5(1),
  502-518 (2021)",10.25147/ijcsr.2017.001.1.55,IT4BHEEEM-2020-004,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Purpose-Mock board exam is necessary to identify if the students are ready to
take the board exam. However, preparing for the examination is not easy. It
takes too much time to release the result, given that the College has limited
personnel. Thus, the proponents developed the Dynamic Local Area Network (LAN)
Based Mock Board Examination System that makes the preparation and checking
easy.
  Method-The proponents followed the iterative waterfall model to develop the
system efficiently. Some criteria of ISO 25010 were adopted in the evaluation
instrument. Simultaneously, evaluators are composed of program chairperson,
College of Computer Studies (CCS) faculty, board program students, and alumni.
  Results-The result of 4.91 in Functional Suitability, 4.87 in Performance
Efficiency, 4.91 in Usability, 4.90 in Security, and 4.92 in Maintainability
shows that the system is fully functional and is usable by any board program.
  Conclusion The computer-based examination, implemented through LAN, can
simplify administering personnel of MinSCAT mock board examination. The
development of the ""Dynamic LAN Based Mock Board Examination System"" is a great
help to the MinSCAT and their board program graduates if it is implemented.
  Recommendations-The system has hidden weaknesses that were only identified in
actual operation. Thus, further testing is needed, like beta testing, to
identify and correct it for better performance. After beta-testing, the system
can be improved through iteration of the Waterfall Model phases.
  Research Implications-The developed system can improve the mock board
examination process and ease preparing this significant examination. Moreover,
it immediately provides a result that helps the examinees to identify their
weaknesses and do a further review to master it.
","[{'version': 'v1', 'created': 'Wed, 25 Nov 2020 08:10:06 GMT'}]",2021-02-02,"[['Sancho', 'Charis Ann M.', ''], ['Melendres', 'Uriel M.', '']]","['Software Development', 'Licensure Exam', 'Board Programs', 'LAN', 'Examination   INTRODUCTION']"
7258,2109.06441,Xueyao Zhang,"Xueyao Zhang, Jinchao Zhang, Yao Qiu, Li Wang, Jie Zhou",Structure-Enhanced Pop Music Generation via Harmony-Aware Learning,Accepted by ACM MM 2022,,10.1145/3503161.3548084,,cs.SD cs.LG eess.AS,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Pop music generation has always been an attractive topic for both musicians
and scientists for a long time. However, automatically composing pop music with
a satisfactory structure is still a challenging issue. In this paper, we
propose to leverage harmony-aware learning for structure-enhanced pop music
generation. On the one hand, one of the participants of harmony, chord,
represents the harmonic set of multiple notes, which is integrated closely with
the spatial structure of music, the texture. On the other hand, the other
participant of harmony, chord progression, usually accompanies the development
of the music, which promotes the temporal structure of music, the form.
Moreover, when chords evolve into chord progression, the texture and form can
be bridged by the harmony naturally, which contributes to the joint learning of
the two structures. Furthermore, we propose the Harmony-Aware Hierarchical
Music Transformer (HAT), which can exploit the structure adaptively from the
music, and make the musical tokens interact hierarchically to enhance the
structure in multi-level musical elements. Experimental results reveal that
compared to the existing methods, HAT owns a much better understanding of the
structure and it can also improve the quality of generated music, especially in
the form and texture.
","[{'version': 'v1', 'created': 'Tue, 14 Sep 2021 05:04:13 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Jul 2022 10:11:04 GMT'}]",2022-07-13,"[['Zhang', 'Xueyao', ''], ['Zhang', 'Jinchao', ''], ['Qiu', 'Yao', ''], ['Wang', 'Li', ''], ['Zhou', 'Jie', '']]","['algorithmic composition', 'music generation', 'structure', 'hierarchy', 'transformer']"
7259,2103.05062,Fr\'ed\'eric Lemoine PhD,"Fr\'ed\'eric Lemoine (1), Tatiana Aubonnet (1 and 2) and No\""emie
  Simoni (2) ((1) Conservatoire National des Arts et M\'etiers (CNAM), CEDRIC,
  Paris, France., (2) T\'el\'ecom-Paris, Palaiseau, France.)",Self-Assemble-Featured Internet of Things,"21 pages, 16 figures",Future Generation Computer Systems 112 (2020) 41-57,10.1016/j.future.2020.05.012,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The Internet of Things supports various industrial applications. The
cooperation and coordination of smart things are a promising strategy for
satisfying requirements that are beyond the capacity of a single smart thing.
One of the major challenges for today's software engineering is the management
of large and complex computing systems characterized by a high degree of
physical distribution. Examples of such systems arise in many application
domains. The number of connected devices grows from billions to hundreds of
billions, so a maximum of automatisms must be integrated in IoT architectures
in order to control and manage them. Software architects migrate to service
oriented architecture and applications are now being constructed as service
compositions. Since each IoT device includes one or more microservices, the
increasing number of devices around the user makes them difficult to assemble
in order to achieve a common goal. In this paper, we propose a self-assembling
solution based on self-controlled service components taking into account
non-functional requirements concerning the offered quality of services and the
structuration of the resulting assembly. Its aim is to build and maintain an
assembly of services (taking into account arrival of new peers or failure of
existing ones) that, besides functional requirements, also fulfils global
quality-of-service and structural requirements.
","[{'version': 'v1', 'created': 'Mon, 8 Mar 2021 20:37:45 GMT'}]",2021-03-10,"[['Lemoine', 'Frédéric', '', '1 and 2'], ['Aubonnet', 'Tatiana', '', '1 and 2'], ['Simoni', 'Noëmie', '']]","['Quality of service', 'Service component', 'Service-oriented achitecture', 'Self-assembly', 'Service composition', 'Internet ofThings']"
7260,2004.08518,Prashanta Saha,"Prashanta Saha, Upulee Kanewala","Improving The Effectiveness of Automatically Generated Test Suites Using
  Metamorphic Testing","2 pages, ICSEW'20",,10.1145/3387940.3392253,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated test generation has helped to reduce the cost of software testing.
However, developing effective test oracles for these automatically generated
test inputs is a challenging task. Therefore, most automated test generation
tools use trivial oracles that reduce the fault detection effectiveness of
these automatically generated test cases. In this work, we provide results of
an empirical study showing that utilizing metamorphic relations can increase
the fault detection effectiveness of automatically generated test cases.
","[{'version': 'v1', 'created': 'Sat, 18 Apr 2020 04:04:48 GMT'}]",2020-04-21,"[['Saha', 'Prashanta', ''], ['Kanewala', 'Upulee', '']]","['Metamorphic testing', 'metamorphic relation', 'automated test casegeneration']"
7261,1508.05488,Gang Mei,Gang Mei,CudaChain: A Practical GPU-accelerated 2D Convex Hull Algorithm,,SpringerPlus 2016:2284,10.1186/s40064-016-2284-4,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a practical GPU-accelerated convex hull algorithm and a
novel Sorting-based Preprocessing Approach (SPA) for planar point sets. The
proposed algorithm consists of two stages: (1) two rounds of preprocessing
performed on the GPU and (2) the finalization of calculating the expected
convex hull on the CPU. We first discard the interior points that locate inside
a quadrilateral formed by four extreme points, and then distribute the
remaining points into several (typically four) sub regions. For each subset of
points, we first sort them in parallel, then perform the second round of
discarding using SPA, and finally form a simple chain for the current remaining
points. A simple polygon can be easily generated by directly connecting all the
chains in sub regions. We at last obtain the expected convex hull of the input
points by calculating the convex hull of the simple polygon. We use the library
Thrust to realize the parallel sorting, reduction, and partitioning for better
efficiency and simplicity. Experimental results show that our algorithm
achieves 5x ~ 6x speedups over the Qhull implementation for 20M points. Thus,
this algorithm is competitive in practical applications for its simplicity and
satisfied efficiency.
","[{'version': 'v1', 'created': 'Sat, 22 Aug 2015 09:32:11 GMT'}]",2016-05-24,"[['Mei', 'Gang', '']]","['GPU', 'CUDA', 'Convex Hull', 'Monotone Chain', 'Divide-and-Conquer', 'Data Dependency']"
7262,1908.11298,Tao Wen,Tao Wen and Yong Deng,"Identification of influencers in complex networks by local information
  dimensionality",,Information Sciences 2019,10.1016/j.ins.2019.10.003,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The identification of influential spreaders in complex networks is a popular
topic in studies of network characteristics. Many centrality measures have been
proposed to address this problem, but most have limitations. In this paper, a
method for identifying influencers in complex networks via the local
information dimensionality. The proposed method considers the local structural
properties around the central node; therefore, the scale of locality only
increases to half of the maximum value of the shortest distance from the
central node. Thus, the proposed method considers the quasilocal information
and reduces the computational complexity. The information (number of nodes) in
boxes is described via the Shannon entropy, which is more reasonable. A node is
more influential when its local information dimensionality is higher. In order
to show the effectiveness of the proposed method, five existing centrality
measures are used as comparison methods to rank influential nodes in six real
world complex networks. In addition, a susceptible infected (SI) model and
Kendall's tau coefficient are applied to show the correlation between different
methods. Experiment results show the superiority of the proposed method.
","[{'version': 'v1', 'created': 'Thu, 29 Aug 2019 15:33:05 GMT'}, {'version': 'v2', 'created': 'Sun, 6 Oct 2019 03:40:09 GMT'}]",2019-10-08,"[['Wen', 'Tao', ''], ['Deng', 'Yong', '']]","['Complex network', 'Influential nodes', 'Local dimension', 'Shannonentropy']"
7263,1904.12344,Minyar Sassi Hidri,"Ines Benali-Sougui, Minyar Sassi Hidri, Amel Grissa-Touzi",Towards a New Extracting and Querying Approach of Fuzzy Summaries,"22 pages, 6 figures, 8 tables. Multidisciplinary Approaches to
  Service-Oriented Engineering, 2018. arXiv admin note: text overlap with
  arXiv:1401.0494",,10.4018/978-1-5225-5951-1.ch015,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Diversification of DB applications highlighted the limitations of relational
database management system (RDBMS) particularly on the modeling plan. In fact,
in the real world, we are increasingly faced with the situation where
applications need to handle imprecise data and to offer a flexible querying to
their users. Several theoretical solutions have been proposed. However, the
impact of this work in practice remained negligible with the exception of a few
research prototypes based on the formal model GEFRED. In this chapter, the
authors propose a new approach for exploitation of fuzzy relational databases
(FRDB) described by the model GEFRED. This approach consists of 1) a new
technique for extracting summary fuzzy data, Fuzzy SAINTETIQ, based on the
classification of fuzzy data and formal concepts analysis; 2) an approach of
assessing flexible queries in the context of FDB based on the set of fuzzy
summaries generated by our fuzzy SAINTETIQ system; 3) an approach of repairing
and substituting unanswered query.
","[{'version': 'v1', 'created': 'Sun, 28 Apr 2019 16:49:59 GMT'}]",2019-04-30,"[['Benali-Sougui', 'Ines', ''], ['Hidri', 'Minyar Sassi', ''], ['Grissa-Touzi', 'Amel', '']]","['Fuzzy databases', 'Fuzzy summaries', 'GEFRED', 'Fuzzy-SaintEtiq', 'Fuzzy FCA', 'Flexible querying', 'Substituting query', 'Repairing query']"
7264,2205.11181,Jonathan Bader,"Jonathan Bader, Fabian Lehmann, Lauritz Thamsen, Jonathan Will, Ulf
  Leser, Odej Kao","Lotaru: Locally Estimating Runtimes of Scientific Workflow Tasks in
  Heterogeneous Clusters","paper accepted in 34th International Conference on Scientific and
  Statistical Database Management (SSDBM 2022)",,10.1145/3538712.3538739,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many scientific workflow scheduling algorithms need to be informed about task
runtimes a-priori to conduct efficient scheduling. In heterogeneous cluster
infrastructures, this problem becomes aggravated because these runtimes are
required for each task-node pair. Using historical data is often not feasible
as logs are typically not retained indefinitely and workloads as well as
infrastructure changes. In contrast, online methods, which predict task
runtimes on specific nodes while the workflow is running, have to cope with the
lack of example runs, especially during the start-up.
  In this paper, we present Lotaru, a novel online method for locally
estimating task runtimes in scientific workflows on heterogeneous clusters.
Lotaru first profiles all nodes of a cluster with a set of short-running and
uniform microbenchmarks. Next, it runs the workflow to be scheduled on the
user's local machine with drastically reduced data to determine important task
characteristics. Based on these measurements, Lotaru learns a Bayesian linear
regression model to predict a task's runtime given the input size and finally
adjusts the predicted runtime specifically for each task-node pair in the
cluster based on the micro-benchmark results. Due to its Bayesian approach,
Lotaru can also compute robust uncertainty estimates and provides them as an
input for advanced scheduling methods.
  Our evaluation with five real-world scientific workflows and different
datasets shows that Lotaru significantly outperforms the baselines in terms of
prediction errors for homogeneous and heterogeneous clusters.
","[{'version': 'v1', 'created': 'Mon, 23 May 2022 10:32:20 GMT'}]",2022-05-24,"[['Bader', 'Jonathan', ''], ['Lehmann', 'Fabian', ''], ['Thamsen', 'Lauritz', ''], ['Will', 'Jonathan', ''], ['Leser', 'Ulf', ''], ['Kao', 'Odej', '']]","['Resource Management', 'Scientific Workflow', 'Runtime Estimation', 'Heterogeneous Cluster Resources', 'Scheduling']"
7265,1905.10231,Junxing Hu,"Junxing Hu, Ling Li, Yijun Lin, Fengge Wu, Junsuo Zhao","A Comparison and Strategy of Semantic Segmentation on Remote Sensing
  Images","8 pages, 3 figures, ICNC-FSKD 2019",,10.1007/978-3-030-32456-8_3,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, with the development of aerospace technology, we use more
and more images captured by satellites to obtain information. But a large
number of useless raw images, limited data storage resource and poor
transmission capability on satellites hinder our use of valuable images.
Therefore, it is necessary to deploy an on-orbit semantic segmentation model to
filter out useless images before data transmission. In this paper, we present a
detailed comparison on the recent deep learning models. Considering the
computing environment of satellites, we compare methods from accuracy,
parameters and resource consumption on the same public dataset. And we also
analyze the relation between them. Based on experimental results, we further
propose a viable on-orbit semantic segmentation strategy. It will be deployed
on the TianZhi-2 satellite which supports deep learning methods and will be
lunched soon.
","[{'version': 'v1', 'created': 'Fri, 24 May 2019 13:39:12 GMT'}]",2019-12-11,"[['Hu', 'Junxing', ''], ['Li', 'Ling', ''], ['Lin', 'Yijun', ''], ['Wu', 'Fengge', ''], ['Zhao', 'Junsuo', '']]","['Semantic Segmentation', 'Deep Learning', 'Remote Sensing Images']"
7266,1908.05609,Mostafa Khalaji,Mostafa Khalaji and Nilufar Mohammadnejad,"CUPCF: Combining Users Preferences in Collaborative Filtering for Better
  Recommendation",Accepted in SN Applied sciences journal,,10.1007/s42452-019-1071-6,,cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  How to make the best decision between the opinions and tastes of your friends
and acquaintances? Therefore, recommender systems are used to solve such
issues. The common algorithms use a similarity measure to predict active users'
tastes over a particular item. According to the cold start and data sparsity
problems, these systems cannot predict and suggest particular items to users.
In this paper, we introduce a new recommender system is able to find user
preferences and based on it, provides the recommendations. Our proposed system
called CUPCF is a combination of two similarity measures in collaborative
filtering to solve the data sparsity problem and poor prediction (high
prediction error rate) problems for better recommendation. The experimental
results based on MovieLens dataset show that, combined with the preferences of
the user's nearest neighbor, the proposed system error rate compared to a
number of state-of-the-art recommendation methods improved. Furthermore, the
results indicate the efficiency of CUPCF. The maximum improved error rate of
the system is 15.5% and the maximum values of Accuracy, Precision and Recall of
CUPCF are 0.91402, 0.91436 and 0.9974 respectively.
","[{'version': 'v1', 'created': 'Tue, 13 Aug 2019 13:32:50 GMT'}]",2019-08-16,"[['Khalaji', 'Mostafa', ''], ['Mohammadnejad', 'Nilufar', '']]","['Recommender Systems', 'Collaborative Filtering', 'Users’ Preferences', 'CUPCF', 'Two Similarity Measures']"
7267,2110.11168,Francesco Sovrano,"Francesco Sovrano, Salvatore Sapienza, Monica Palmirani, Fabio Vitali","A Survey on Methods and Metrics for the Assessment of Explainability
  under the Proposed AI Act",Accepted paper at JURIX 2021,,10.3233/FAIA210342,,cs.AI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study discusses the interplay between metrics used to measure the
explainability of the AI systems and the proposed EU Artificial Intelligence
Act. A standardisation process is ongoing: several entities (e.g. ISO) and
scholars are discussing how to design systems that are compliant with the
forthcoming Act and explainability metrics play a significant role. This study
identifies the requirements that such a metric should possess to ease
compliance with the AI Act. It does so according to an interdisciplinary
approach, i.e. by departing from the philosophical concept of explainability
and discussing some metrics proposed by scholars and standardisation entities
through the lenses of the explainability obligations set by the proposed AI
Act. Our analysis proposes that metrics to measure the kind of explainability
endorsed by the proposed AI Act shall be risk-focused, model-agnostic,
goal-aware, intelligible & accessible. This is why we discuss the extent to
which these requirements are met by the metrics currently under discussion.
","[{'version': 'v1', 'created': 'Thu, 21 Oct 2021 14:27:24 GMT'}]",2022-01-20,"[['Sovrano', 'Francesco', ''], ['Sapienza', 'Salvatore', ''], ['Palmirani', 'Monica', ''], ['Vitali', 'Fabio', '']]","['we used were “degree of explainability”', '“explainability metrics”', '“explainability measures”', '“evaluation metrics for contrastive explanations”']"
7268,2111.09553,Sergey Sukhov,"Dmitry Antonov, Kirill Sviatov, Sergey Sukhov",Continuous learning of spiking networks trained with local rules,25 pages,,10.1016/j.neunet.2022.09.003,,cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Artificial neural networks (ANNs) experience catastrophic forgetting (CF)
during sequential learning. In contrast, the brain can learn continuously
without any signs of catastrophic forgetting. Spiking neural networks (SNNs)
are the next generation of ANNs with many features borrowed from biological
neural networks. Thus, SNNs potentially promise better resilience to CF. In
this paper, we study the susceptibility of SNNs to CF and test several
biologically inspired methods for mitigating catastrophic forgetting. SNNs are
trained with biologically plausible local training rules based on
spike-timing-dependent plasticity (STDP). Local training prohibits the direct
use of CF prevention methods based on gradients of a global loss function. We
developed and tested the method to determine the importance of synapses
(weights) based on stochastic Langevin dynamics without the need for the
gradients. Several other methods of catastrophic forgetting prevention adapted
from analog neural networks were tested as well. The experiments were performed
on freely available datasets in the SpykeTorch environment.
","[{'version': 'v1', 'created': 'Thu, 18 Nov 2021 07:13:06 GMT'}]",2022-12-26,"[['Antonov', 'Dmitry', ''], ['Sviatov', 'Kirill', ''], ['Sukhov', 'Sergey', '']]","['continual learning', 'lifelong learning', 'catastrophic forgetting', 'spiking neural network', 'spike']"
7269,1708.03536,Guido Mart\'inez,Alejandro D\'iaz-Caro and Guido Mart\'inez,Confluence in Probabilistic Rewriting,LSFA 2017 Final version,"ENTCS 338:115-131, 2018",10.1016/j.entcs.2018.10.008,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Driven by the interest of reasoning about probabilistic programming
languages, we set out to study a notion of unicity of normal forms for them. To
provide a tractable proof method for it, we define a property of distribution
confluence which is shown to imply the desired uniqueness (even for infinite
sequences of reduction) and further properties. We then carry over several
criteria from the classical case, such as Newman's lemma, to simplify proving
confluence in concrete languages. Using these criteria, we obtain simple proofs
of confluence for $\lambda_1$, an affine probabilistic $\lambda$-calculus, and
for Q$^*$, a quantum programming language for which a related property has
already been proven in the literature.
","[{'version': 'v1', 'created': 'Fri, 11 Aug 2017 13:26:43 GMT'}, {'version': 'v2', 'created': 'Tue, 1 May 2018 03:12:16 GMT'}]",2018-11-06,"[['Díaz-Caro', 'Alejandro', ''], ['Martínez', 'Guido', '']]","['abstract rewriting system', 'probabilistic rewriting', 'confluence']"
7270,2011.13432,Aleix Roca Nonell,"Aleix Roca Nonell, Balazs Gerofi, Leonardo Bautista-Gomez, Dominique
  Martinet, Vicen\c{c} Beltran Querol, Yutaka Ishikawa","On the Applicability of PEBS based Online Memory Access Tracking for
  Heterogeneous Memory Management at Scale","8 pages, 16 figures, conference","Proceedings of the Workshop on Memory Centric High Performance
  Computing (2018) 50-57",10.1145/3286475.3286477,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Operating systems have historically had to manage only a single type of
memory device. The imminent availability of heterogeneous memory devices based
on emerging memory technologies confronts the classic single memory model and
opens a new spectrum of possibilities for memory management. Transparent data
movement between different memory devices based on access patterns of
applications is a desired feature to make optimal use of such devices and to
hide the complexity of memory management to the end-user. However, capturing
memory access patterns of an application at runtime comes at a cost, which is
particularly challenging for large scale parallel applications that may be
sensitive to system noise.
  In this work, we focus on the access pattern profiling phase prior to the
actual memory relocation. We study the feasibility of using Intel's Processor
Event-Based Sampling (PEBS) feature to record memory accesses by sampling at
runtime and study the overhead at scale. We have implemented a custom PEBS
driver in the IHK/McKernel lightweight multi-kernel operating system, one of
whose advantages is minimal system interference due to the lightweight kernel's
simple design compared to other OS kernels such as Linux. We present the PEBS
overhead of a set of scientific applications and show the access patterns
identified in noise-sensitive HPC applications. Our results show that clear
access patterns can be captured with a 10% overhead in the worst-case and 1% in
the best case when running on up to 128k CPU cores (2,048 Intel Xeon Phi
Knights Landing nodes). We conclude that online memory access profiling using
PEBS at large scale is promising for memory management in heterogeneous memory
environments.
","[{'version': 'v1', 'created': 'Thu, 26 Nov 2020 18:39:55 GMT'}]",2020-11-30,"[['Nonell', 'Aleix Roca', ''], ['Gerofi', 'Balazs', ''], ['Bautista-Gomez', 'Leonardo', ''], ['Martinet', 'Dominique', ''], ['Querol', 'Vicenç Beltran', ''], ['Ishikawa', 'Yutaka', '']]","['high-performance computing', 'operating systems', 'heterogeneousmemory']"
7271,2002.01840,Antti Knutas,"Annika Wolff, Antti Knutas, Paula Savolainen","What prevents Finnish women from applying to software engineering roles?
  A preliminary analysis of survey data",,"International Conference on Software Engineering: Software
  Engineering Education and Training (ICSE-SEET'20), May 23-29, 2020, Seoul,
  Republic of Korea",10.1145/3377814.3381708,,cs.SE cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finland is considered a country with a good track record in gender equality.
Whilst statistics support the notion that Finland is performing well compared
to many other countries in terms of workplace equality, there are still many
areas for improvement. This paper focuses on the problems that some women face
in obtaining software engineering roles. We report a preliminary analysis of
survey data from 252 respondents. These are mainly women who have shown an
interest in gaining programming roles by joining the Mimmit koodaa initiative,
which aims to increase equality and diversity within the software industry. The
survey sought to understand what early experiences may influence later career
choices and feelings of efficacy and confidence needed to pursue
technology-related careers. These initial findings reveal that women's feelings
of computing self-efficacy and attitudes towards software engineering are
shaped by early experiences. More negative experiences decrease the likelihood
of working in software engineering roles in the future, despite expressing an
interest in the field.
","[{'version': 'v1', 'created': 'Wed, 5 Feb 2020 16:03:25 GMT'}]",2020-02-06,"[['Wolff', 'Annika', ''], ['Knutas', 'Antti', ''], ['Savolainen', 'Paula', '']]","['women in technology', 'careers', 'barriers', 'quantitative', 'survey', 'pathmodeling']"
7272,2101.04794,Yue You,"Yue You, Yubo Kou, Xianghua Ding, Xinning Gui","The Medical Authority of AI: A Study of AI-enabled Consumer-facing
  Health Technology",,,10.13140/RG.2.2.33097.98403,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Recently, consumer-facing health technologies such as Artificial Intelligence
(AI)-based symptom checkers (AISCs) have sprung up in everyday healthcare
practice. AISCs solicit symptom information from users and provide medical
suggestions and possible diagnoses, a responsibility that people usually
entrust with real-person authorities such as physicians and expert patients.
Thus, the advent of AISCs begs a question of whether and how they transform the
notion of medical authority in everyday healthcare practice. To answer this
question, we conducted an interview study with thirty AISC users. We found that
users assess the medical authority of AISCs using various factors including
automated decisions and interaction design patterns of AISC apps, associations
with established medical authorities like hospitals, and comparisons with other
health technologies. We reveal how AISCs are used in healthcare delivery,
discuss how AI transforms conventional understandings of medical authority, and
derive implications for designing AI-enabled health technology.
","[{'version': 'v1', 'created': 'Tue, 12 Jan 2021 23:02:40 GMT'}]",2021-01-14,"[['You', 'Yue', ''], ['Kou', 'Yubo', ''], ['Ding', 'Xianghua', ''], ['Gui', 'Xinning', '']]","['Medical authority', 'Artificial intelligence', 'Symptom checkers', 'Consumerfacing health technology']"
7273,2202.11286,Zexuan Yin,Zexuan Yin and Paolo Barucca,Deep Recurrent Modelling of Granger Causality with Latent Confounding,,,10.1016/j.eswa.2022.118036.,,cs.LG stat.ME,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Inferring causal relationships in observational time series data is an
important task when interventions cannot be performed. Granger causality is a
popular framework to infer potential causal mechanisms between different time
series. The original definition of Granger causality is restricted to linear
processes and leads to spurious conclusions in the presence of a latent
confounder. In this work, we harness the expressive power of recurrent neural
networks and propose a deep learning-based approach to model non-linear Granger
causality by directly accounting for latent confounders. Our approach leverages
multiple recurrent neural networks to parameterise predictive distributions and
we propose the novel use of a dual-decoder setup to conduct the Granger tests.
We demonstrate the model performance on non-linear stochastic time series for
which the latent confounder influences the cause and effect with different time
lags; results show the effectiveness of our model compared to existing
benchmarks.
","[{'version': 'v1', 'created': 'Wed, 23 Feb 2022 03:26:22 GMT'}]",2022-07-22,"[['Yin', 'Zexuan', ''], ['Barucca', 'Paolo', '']]","['latent confounders', 'recurrent neural networks', 'time series']"
7274,2108.08051,Bongani Bright Maseko,"Bongani B. Maseko, Corn\'e E. van Daalen, Johann Treurnicht",Optimised Informed RRTs for Mobile Robot Path Planning,"6 pages, 3 figures, Control Conference Africa 2021, To be published
  on IFAC-PapersOnline 2021",,10.1016/j.ifacol.2021.12.027,,cs.RO cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Path planners based on basic rapidly-exploring random trees (RRTs) are quick
and efficient, and thus favourable for real-time robot path planning, but are
almost-surely suboptimal. In contrast, the optimal RRT (RRT*) converges to the
optimal solution, but may be expensive in practice. Recent work has focused on
accelerating the RRT*'s convergence rate. The most successful strategies are
informed sampling, path optimisation, and a combination thereof. However,
informed sampling and its combination with path optimisation have not been
applied to the basic RRT. Moreover, while a number of path optimisers can be
used to accelerate the convergence rate, a comparison of their effectiveness is
lacking. This paper investigates the use of informed sampling and path
optimisation to accelerate planners based on both the basic RRT and the RRT*,
resulting in a family of algorithms known as optimised informed RRTs. We apply
different path optimisers and compare their effectiveness. The goal is to
ascertain if applying informed sampling and path optimisation can help the
quick, though almost-surely suboptimal, path planners based on the basic RRT
attain comparable or better performance than RRT*-based planners. Analyses show
that RRT-based optimised informed RRTs do attain better performance than their
RRT*-based counterparts, both when planning time is limited and when there is
more planning time.
","[{'version': 'v1', 'created': 'Wed, 18 Aug 2021 08:58:47 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Aug 2021 09:28:20 GMT'}, {'version': 'v3', 'created': 'Fri, 31 Dec 2021 23:24:10 GMT'}]",2022-01-06,"[['Maseko', 'Bongani B.', ''], ['van Daalen', 'Corné E.', ''], ['Treurnicht', 'Johann', '']]","['Autonomous vehicles', 'robot navigation', 'path planning', 'optimisation', 'constraints']"
7275,1802.02397,Konrad Kulakowski,"Konrad Kulakowski, Jiri Mazurek, Jaroslav Ramik, Michael Soltys",When is the condition of order preservation met?,19 pages,"Ku{\l}akowski, K., Mazurek, J., Ram\'ik, J., & Soltys, M. (2019).
  When is the condition of order preservation met? European Journal of
  Operational Research. http://doi.org/10.1016/j.ejor.2019.01.046",10.1016/j.ejor.2019.01.046,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article explores a relationship between inconsistency in the pairwise
comparisons method and conditions of order preservation. A pairwise comparisons
matrix with elements from an alo-group is investigated. This approach allows
for a generalization of previous results. Sufficient conditions for order
preservation based on the properties of elements of pairwise comparisons matrix
are derived. A numerical example is presented.
","[{'version': 'v1', 'created': 'Wed, 7 Feb 2018 12:08:02 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Mar 2018 17:12:50 GMT'}]",2019-03-29,"[['Kulakowski', 'Konrad', ''], ['Mazurek', 'Jiri', ''], ['Ramik', 'Jaroslav', ''], ['Soltys', 'Michael', '']]","['pairwise comparisons', 'alo-groups', 'EVM', 'GMM', 'COP', 'AHP']"
7276,2106.02529,Hao Wang,"Qing Yang, Hao Wang, Xiaoxiao Wu, Taotao Wang, Shengli Zhang","Blockchain for Transactive Energy Management of Distributed Energy
  Resources in Smart Grid","ACM International Conference on Future Energy Systems (ACM e-Energy)
  2021. arXiv admin note: text overlap with arXiv:2105.00174",,10.1145/3447555.3464848,,cs.DC cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  This work presents the design and implementation of a blockchain system that
enables the trustable transactive energy management for distributed energy
resources (DERs). We model the interactions among DERs, including energy
trading and flexible appliance scheduling, as a cost minimization problem.
Considering the dispersed nature and diverse ownership of DERs, we develop a
distributed algorithm to solve the optimization problem using the alternating
direction method of multipliers (ADMM) method. Furthermore, we develop a
blockchain system, on which we implement the proposed algorithm with the smart
contract, to guarantee the transparency and correctness of the energy
management. We prototype the blockchain in a small-scale test network and
evaluate it through experiments using real-world data. The experimental results
validate the feasibility and effectiveness of our design.
","[{'version': 'v1', 'created': 'Fri, 4 Jun 2021 14:55:20 GMT'}]",2021-06-07,"[['Yang', 'Qing', ''], ['Wang', 'Hao', ''], ['Wu', 'Xiaoxiao', ''], ['Wang', 'Taotao', ''], ['Zhang', 'Shengli', '']]","['Smart grid', 'Distributed energy resource (DER)', 'Blockchain', 'Transactive energy', 'Energy trading', 'Distributed optimization']"
7277,2011.13347,Catarina Lopes-Dias,"Catarina Lopes-Dias, Andreea I. Sburlea, Katharina Breitegger, Daniela
  Wyss, Harald Drescher, Renate Wildburger and Gernot R. M\""uller-Putz","Online asynchronous detection of error-related potentials in
  participants with a spinal cord injury using a generic classifier",,J. Neural Eng. 18 046022 (2021),10.1088/1741-2552/abd1eb,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  A BCI user awareness of an error is associated with a cortical signature
named error-related potential (ErrP). The incorporation of ErrPs' detection in
BCIs can improve BCIs' performance. This work is three-folded. First, we
investigate if an ErrP classifier is transferable from able-bodied participants
to participants with spinal cord injury (SCI). Second, we test this generic
ErrP classifier with SCI and control participants, in an online experiment
without offline calibration. Third, we investigate the morphology of ErrPs in
both groups of participants. We used previously recorded
electroencephalographic (EEG) data from able-bodied participants to train an
ErrP classifier. We tested the classifier asynchronously, in an online
experiment with 16 new participants: 8 participants with SCI and 8 able-bodied
control participants. The experiment had no offline calibration and
participants received feedback regarding the ErrPs' detection from its start.
The generic classifier was not trained with the user's brain signals. Still,
its performance was optimized during the online experiment with the use of
personalized decision thresholds. Participants with SCI presented a
non-homogenous ErrP morphology, and four of them did not present clear ErrP
signals. The generic classifier performed above chance level in participants
with clear ErrP signals, independently of the SCI (11 out of 16 participants).
Three out of the five participants that obtained chance level results with the
generic classifier would have not benefited from the use of a personalized
classifier. This work shows the feasibility of transferring an ErrP classifier
from able-bodied participants to participants with SCI, for asynchronous
detection of ErrPs in an online experiment without offline calibration, which
provided immediate feedback to the users.
","[{'version': 'v1', 'created': 'Thu, 26 Nov 2020 15:24:41 GMT'}, {'version': 'v2', 'created': 'Sun, 6 Dec 2020 08:08:22 GMT'}, {'version': 'v3', 'created': 'Fri, 2 Apr 2021 16:15:12 GMT'}]",2021-04-05,"[['Lopes-Dias', 'Catarina', ''], ['Sburlea', 'Andreea I.', ''], ['Breitegger', 'Katharina', ''], ['Wyss', 'Daniela', ''], ['Drescher', 'Harald', ''], ['Wildburger', 'Renate', ''], ['M\x7füller-Putz', 'Gernot R.', '']]","['error-related potential', 'asynchronous classification', 'generic classifier', 'onlineexperiment', 'spinal cord injury', 'end-users', 'brain-computer interface']"
7278,2104.10873,Hengjie Wang,"Hengjie Wang, Robert Planas, Aparna Chandramowlishwaran, Ramin
  Bostanabad","Mosaic Flows: A Transferable Deep Learning Framework for Solving PDEs on
  Unseen Domains","23 pages, 10 figures",,10.1016/j.cma.2021.114424,,cs.LG cs.PF physics.comp-ph,http://creativecommons.org/licenses/by/4.0/,"  Physics-informed neural networks (PINNs) are increasingly employed to
replace/augment traditional numerical methods in solving partial differential
equations (PDEs). While state-of-the-art PINNs have many attractive features,
they approximate a specific realization of a PDE system and hence are
problem-specific. That is, the model needs to be re-trained each time the
boundary conditions (BCs) and domain shape/size change. This limitation
prohibits the application of PINNs to realistic or large-scale engineering
problems especially since the costs and efforts associated with their training
are considerable. We introduce a transferable framework for solving boundary
value problems (BVPs) via deep neural networks which can be trained once and
used forever for various unseen domains and BCs. We first introduce genomic
flow network(GFNet), a neural network that can infer the solution of a BVP
across arbitrary BCson a small square domain called genome. Then, we proposed
mosaic flow(MF) predictor, a novel iterative algorithm that assembles the
GFNet's inferences for BVPs on large domains with unseen sizes/shapes and BCs
while preserving the spatial regularity of the solution. We demonstrate that
our framework can estimate the solution of Laplace and Navier-Stokes equations
in domains of unseen shapes and BCs that are, respectively, 1200 and 12 times
larger than the training domains. Since our framework eliminates the need to
re-train models for unseen domains and BCs, it demonstrates up to 3
orders-of-magnitude speedups compared to the state-of-the-art.
","[{'version': 'v1', 'created': 'Thu, 22 Apr 2021 05:20:27 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Oct 2021 22:37:08 GMT'}]",2022-01-12,"[['Wang', 'Hengjie', ''], ['Planas', 'Robert', ''], ['Chandramowlishwaran', 'Aparna', ''], ['Bostanabad', 'Ramin', '']]","['Neural networks', 'transferable deep learning', 'scientific machine learning', 'PDEs', 'Navier-Stokesequations']"
7279,1708.01679,Guillermo Polito,"Guillermo Polito (Centre de Recherche en Informatique Signal et
  Automatique de Lille, France), Camille Teruel (Inria, France), St\'ephane
  Ducasse (INRIA, France), Luc Fabresse (Mines Telecom Institute, Douai,
  France)",Scoped Extension Methods in Dynamically-Typed Languages,,"The Art, Science, and Engineering of Programming, 2018, Vol. 2,
  Issue 1, Article 1",10.22152/programming-journal.org/2018/2/1,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context. An extension method is a method declared in a package other than the
package of its host class. Thanks to extension methods, developers can adapt to
their needs classes they do not own: adding methods to core classes is a
typical use case. This is particularly useful for adapting software and
therefore to increase reusability.
  Inquiry. In most dynamically-typed languages, extension methods are globally
visible. Because any developer can define extension methods for any class,
naming conflicts occur: if two developers define an extension method with the
same signature in the same class, only one extension method is visible and
overwrites the other. Similarly, if two developers each define an extension
method with the same name in a class hierarchy, one overrides the other. To
avoid such ""accidental overrides"", some dynamically-typed languages limit the
visibility of an extension method to a particular scope. However, their
semantics have not been fully described and compared. In addition, these
solutions typically rely on a dedicated and slow method lookup algorithm to
resolve conflicts at runtime.
  Approach. In this article, we present a formalization of the underlying
models of Ruby refinements, Groovy categories, Classboxes, and Method Shelters
that are scoping extension method solutions in dynamically-typed languages.
  Knowledge. Our formal framework allows us to objectively compare and analyze
the shortcomings of the studied solutions and other different approaches such
as MultiJava. In addition, language designers can use our formal framework to
determine which mechanism has less risk of ""accidental overrides"".
  Grounding. Our comparison and analysis of existing solutions is grounded
because it is based on denotational semantics formalizations.
  Importance. Extension methods are widely used in programming languages that
support them, especially dynamically-typed languages such as Pharo, Ruby or
Python. However, without a carefully designed mechanism, this feature can cause
insidious hidden bugs or can be voluntarily used to gain access to protected
operations, violate encapsulation or break fundamental invariants.
","[{'version': 'v1', 'created': 'Fri, 4 Aug 2017 23:04:25 GMT'}]",2017-08-08,"[['Polito', 'Guillermo', '', 'Centre de Recherche en Informatique Signal et\n  Automatique de Lille, France'], ['Teruel', 'Camille', '', 'Inria, France'], ['Ducasse', 'Stéphane', '', 'INRIA, France'], ['Fabresse', 'Luc', '', 'Mines Telecom Institute, Douai,\n  France']]","['class extensions', 'scope', 'packages', 'method lookup', 'dynamic languages']"
7280,2002.06176,Satoshi Egi,"Satoshi Egi (Rakuten Institute of Technology, Japan), Yuichi Nishiwaki
  (The University of Tokyo, Japan)",Functional Programming in Pattern-Match-Oriented Programming Style,,"The Art, Science, and Engineering of Programming, 2020, Vol. 4,
  Issue 3, Article 7",10.22152/programming-journal.org/2020/4/7,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Throughout the history of functional programming, recursion has emerged as a
natural method for describing loops in programs. However, there does often
exist a substantial cognitive distance between the recursive definition and the
simplest explanation of an algorithm even for the basic list processing
functions such as map, concat, or unique; when we explain these functions, we
seldom use recursion explicitly as we do in functional programming. For
example, map is often explained as follows: the map function takes a function
and a list and returns a list of the results of applying the function to all
the elements of the list.
  This paper advocates a new programming paradigm called pattern-match-oriented
programming for filling this gap. An essential ingredient of our method is
utilizing pattern matching for non-free data types. Pattern matching for
non-free data types features non-linear pattern matching with backtracking and
extensibility of pattern-matching algorithms. Several non-standard pattern
constructs, such as not-patterns, loop patterns, and sequential patterns, are
derived from this pattern-matching facility. Based on that result, this paper
introduces many programming techniques that replace explicit recursions with an
intuitive pattern by confining recursions inside patterns. We classify these
techniques as pattern-match-oriented programming design patterns.
  These programming techniques allow us to redefine not only the most basic
functions for list processing such as map, concat, or unique more elegantly
than the traditional functional programming style, but also more practical
mathematical algorithms and software such as a SAT solver, computer algebra
system, and database query language that we had not been able to implement
concisely.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 18:55:54 GMT'}]",2020-02-17,"[['Egi', 'Satoshi', '', 'Rakuten Institute of Technology, Japan'], ['Nishiwaki', 'Yuichi', '', 'The University of Tokyo, Japan']]","['pattern-match-oriented programming', 'non-free data type', 'non-linear pattern', 'backtracking']"
7281,2203.15720,Yifeng Jiang,"Yifeng Jiang, Yuting Ye, Deepak Gopinath, Jungdam Won, Alexander W.
  Winkler, C. Karen Liu","Transformer Inertial Poser: Real-time Human Motion Reconstruction from
  Sparse IMUs with Simultaneous Terrain Generation","SIGGRAPH Asia 2022. Video: https://youtu.be/rXb6SaXsnc0. Code:
  https://github.com/jyf588/transformer-inertial-poser",,10.1145/3550469.3555428,,cs.CV cs.GR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Real-time human motion reconstruction from a sparse set of (e.g. six)
wearable IMUs provides a non-intrusive and economic approach to motion capture.
Without the ability to acquire position information directly from IMUs, recent
works took data-driven approaches that utilize large human motion datasets to
tackle this under-determined problem. Still, challenges remain such as temporal
consistency, drifting of global and joint motions, and diverse coverage of
motion types on various terrains. We propose a novel method to simultaneously
estimate full-body motion and generate plausible visited terrain from only six
IMU sensors in real-time. Our method incorporates 1. a conditional Transformer
decoder model giving consistent predictions by explicitly reasoning prediction
history, 2. a simple yet general learning target named ""stationary body points""
(SBPs) which can be stably predicted by the Transformer model and utilized by
analytical routines to correct joint and global drifting, and 3. an algorithm
to generate regularized terrain height maps from noisy SBP predictions which
can in turn correct noisy global motion estimation. We evaluate our framework
extensively on synthesized and real IMU data, and with real-time live demos,
and show superior performance over strong baseline methods.
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2022 16:24:52 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Sep 2022 22:45:58 GMT'}, {'version': 'v3', 'created': 'Thu, 8 Dec 2022 19:29:18 GMT'}]",2022-12-12,"[['Jiang', 'Yifeng', ''], ['Ye', 'Yuting', ''], ['Gopinath', 'Deepak', ''], ['Won', 'Jungdam', ''], ['Winkler', 'Alexander W.', ''], ['Liu', 'C. Karen', '']]","['Wearable Devices', 'Inertial Measurement Units', 'Human Motion']"
7282,1805.02102,Maria Luisa Damiani,"Maria Luisa Damiani, Fatima Hachem, Issa Hamza, Nathan Ranc, Paul
  Moorcroft, Francesca Cagnacci",Cluster-based trajectory segmentation with local noise,"41 pages, Data Mining and Knowledge Discovery (2018)","Data Mining and Knowledge Discovery, 2018, Vol 32, Issue 4,
  1017-1055",10.1007/s10618-018-0561-2,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a framework for the partitioning of a spatial trajectory in a
sequence of segments based on spatial density and temporal criteria. The result
is a set of temporally separated clusters interleaved by sub-sequences of
unclustered points. A major novelty is the proposal of an outlier or noise
model based on the distinction between intra-cluster (local noise) and
inter-cluster noise (transition): the local noise models the temporary absence
from a residence while the transition the definitive departure towards a next
residence. We analyze in detail the properties of the model and present a
comprehensive solution for the extraction of temporally ordered clusters. The
effectiveness of the solution is evaluated first qualitatively and next
quantitatively by contrasting the segmentation with ground truth. The ground
truth consists of a set of trajectories of labeled points simulating animal
movement. Moreover, we show that the approach can streamline the discovery of
additional derived patterns, by presenting a novel technique for the analysis
of periodic movement. From a methodological perspective, a valuable aspect of
this research is that it combines the theoretical investigation with the
application and external validation of the segmentation framework. This paves
the way to an effective deployment of the solution in broad and challenging
fields such as e-science.
","[{'version': 'v1', 'created': 'Sat, 5 May 2018 18:46:46 GMT'}]",2018-06-19,"[['Damiani', 'Maria Luisa', ''], ['Hachem', 'Fatima', ''], ['Hamza', 'Issa', ''], ['Ranc', 'Nathan', ''], ['Moorcroft', 'Paul', ''], ['Cagnacci', 'Francesca', '']]","['Mobility data analysis', 'Trajectories', 'Segmentation', 'Clustering']"
7283,2211.03817,Thomas Vogel,"Thomas Vogel, Marc Carwehl, Gena\'ina Nunes Rodrigues and Lars Grunske","A Property Specification Pattern Catalog for Real-Time System
  Verification with UPPAAL",Accepted Manuscript,"Information and Software Technology, 2022",10.1016/j.infsof.2022.107100,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Context: The goal of specification pattern catalogs for real-time
requirements is to mask the complexity of specifying such requirements in a
timed temporal logic for verification. For this purpose, they provide frontends
to express and translate pattern-based natural language requirements to
formulae in a suitable logic. However, the widely used real-time model checking
tool UPPAAL only supports a restricted subset of those formulae that focus only
on basic and non-nested reachability, safety, and liveness properties. This
restriction renders many specification patterns inapplicable. As a workaround,
timed observer automata need to be constructed manually to express
sophisticated requirements envisioned by these patterns. Objective: In this
work, we fill these gaps by providing a comprehensive specification pattern
catalog for UPPAAL. The catalog supports qualitative and real-time requirements
and covers all corresponding patterns of existing catalogs. Method: The catalog
we propose is integrated with UPPAAL. It supports the specification of
qualitative and real-time requirements using patterns and provides an automated
generator that translates these requirements to observer automata and TCTL
formulae. The resulting artifacts are used for verifying systems in UPPAAL.
Thus, our catalog enables an automated end-to-end verification process for
UPPAAL based on property specification patterns and observer automata. Results:
We evaluate our catalog on three UPPAAL system models reported in the
literature and mostly applied in an industrial setting. As a result, not only
the reproducibility of the related UPPAAL models was possible, but also the
validation of an automated, seamless, and accurate pattern- and observer-based
verification process. Conclusion: The proposed property specification pattern
catalog for UPPAAL enables practitioners to specify qualitative and real-time
requirements...
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2022 19:05:35 GMT'}]",2022-11-09,"[['Vogel', 'Thomas', ''], ['Carwehl', 'Marc', ''], ['Rodrigues', 'Genaína Nunes', ''], ['Grunske', 'Lars', '']]","['Real-time systems', 'Property specification patterns', 'Observer automata']"
7284,1910.03438,Laurent Viennot,"Guillaume Ducoffe (ICI), Michel Habib (IRIF (UMR\_8243)), Laurent
  Viennot (GANG)",Fast Diameter Computation within Split Graphs,,"Discrete Mathematics & Theoretical Computer Science, vol. 23, no.
  3, Graph Theory (November 15, 2021) dmtcs:8680",10.46298/dmtcs.6422,,cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When can we compute the diameter of a graph in quasi linear time? We address
this question for the class of {\em split graphs}, that we observe to be the
hardest instances for deciding whether the diameter is at most two. We stress
that although the diameter of a non-complete split graph can only be either $2$
or $3$, under the Strong Exponential-Time Hypothesis (SETH) we cannot compute
the diameter of an $n$-vertex $m$-edge split graph in less than quadratic time
-- in the size $n+m$ of the input. Therefore it is worth to study the
complexity of diameter computation on {\em subclasses} of split graphs, in
order to better understand the complexity border. Specifically, we consider the
split graphs with bounded {\em clique-interval number} and their complements,
with the former being a natural variation of the concept of interval number for
split graphs that we introduce in this paper. We first discuss the relations
between the clique-interval number and other graph invariants such as the
classic interval number of graphs, the treewidth, the {\em VC-dimension} and
the {\em stabbing number} of a related hypergraph. Then, in part based on these
above relations, we almost completely settle the complexity of diameter
computation on these subclasses of split graphs: - For the $k$-clique-interval
split graphs, we can compute their diameter in truly subquadratic time if
$k={\cal O}(1)$, and even in quasi linear time if $k=o(\log{n})$ and in
addition a corresponding ordering of the vertices in the clique is given.
However, under SETH this cannot be done in truly subquadratic time for any $k =
\omega(\log{n})$. - For the {\em complements} of $k$-clique-interval split
graphs, we can compute their diameter in truly subquadratic time if $k={\cal
O}(1)$, and even in time ${\cal O}(km)$ if a corresponding ordering of the
vertices in the stable set is given. Again this latter result is optimal under
SETH up to polylogarithmic factors. Our findings raise the question whether a
$k$-clique interval ordering can always be computed in quasi linear time. We
prove that it is the case for $k=1$ and for some subclasses such as
bounded-treewidth split graphs, threshold graphs and comparability split
graphs. Finally, we prove that some important subclasses of split graphs --
including the ones mentioned above -- have a bounded clique-interval number.
","[{'version': 'v1', 'created': 'Tue, 8 Oct 2019 14:57:36 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Apr 2020 11:22:44 GMT'}, {'version': 'v3', 'created': 'Thu, 20 May 2021 13:10:28 GMT'}, {'version': 'v4', 'created': 'Fri, 21 May 2021 07:26:55 GMT'}, {'version': 'v5', 'created': 'Tue, 2 Nov 2021 11:47:24 GMT'}]",2021-12-11,"[['Ducoffe', 'Guillaume', '', 'ICI'], ['Habib', 'Michel', '', 'IRIF'], ['Viennot', 'Laurent', '', 'GANG']]","['Graph Diameter', 'Split Graphs', 'Interval Representations', 'Fine-Grained Complexity']"
7285,1810.03473,Mostafa Zaman Chowdhury,"Mostafa Zaman Chowdhury, Sung Hun Chae, and Yeong Min Jang",Group Handover Management in Mobile Femtocellular Network Deployment,"International Conference on Ubiquitous and Future Networks (ICUFN),
  July 2012, Thailand. arXiv admin note: substantial text overlap with
  arXiv:1412.4321",,10.1109/ICUFN.2012.6261685,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The mobile femtocell is the new paradigm for the femtocellular network
deployment. It can enhance the service quality for the users inside the
vehicles. The deployment of mobile femtocells generates lot of handover calls.
Also, number of group handover scenarios are found in mobile femtocellular
network deployment. In this paper, we focus on the resource management for the
group handover in mobile femtocellular network deployment. We discuss a number
of group handover scenarios. We propose a resource management scheme that
contains bandwidth adaptation policy and dynamic bandwidth reservation policy.
The simulation results show that the proposed bandwidth management scheme
significantly reduces the handover call dropping probability without reducing
the bandwidth utilization.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 02:04:34 GMT'}]",2018-10-09,"[['Chowdhury', 'Mostafa Zaman', ''], ['Chae', 'Sung Hun', ''], ['Jang', 'Yeong Min', '']]","['Mobile femtocell', 'handover', 'group handover', 'call dropping probability']"
7286,2008.04632,Alex Shafarenko,Alex Shafarenko,A PLS blockchain for IoT applications: protocols and architecture,"24 pages, 5 figures","Cybersecur 4, 4 (2021)",10.1186/s42400-020-00068-0,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes an architecture and a protocol suite for a permissioned
blockchain for a local IoT network. The architecture is based on a sealed
Sequencer and a Fog Server running (post-quantum) Guy Fawkes protocols. The
blocks of the blockchain are stored in networked Content Addressable Storage
alongside any user data and validity proofs. We maintain that a typical IoT
device can, despite its resource limitations, use our blockchain protocols
directly, without a trusted intermediary. This includes posting and monitoring
transactions as well as off-chain (post-quantum) emergency communications
without an explicit public key. Keywords: blockchain, Guy Fawkes protocol,
post-quantum, HORS-OTS, LoRa, concurrent transmission
","[{'version': 'v1', 'created': 'Tue, 11 Aug 2020 11:21:47 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Aug 2020 14:41:20 GMT'}]",2021-02-02,"[['Shafarenko', 'Alex', '']]","['blockchain', 'Guy Fawkes protocol', 'post-quantum', 'HORS-OTS', 'LoRa', 'concurrent transmission']"
7287,2107.00341,Gonzague Yernaux,Gonzague Yernaux and Wim Vanhoof,Anti-unification of Unordered Goals,CSL 2022 paper with appendices,,10.4230/LIPIcs.CSL.2022.7,,cs.CC cs.LO,http://creativecommons.org/licenses/by/4.0/,"  Anti-unification in logic programming refers to the process of capturing
common syntactic structure among given goals, computing a single new goal that
is more general called a generalization of the given goals. Finding an
arbitrary common generalization for two goals is trivial, but looking for those
common generalizations that are either as large as possible (called largest
common generalizations) or as specific as possible (called most specific
generalizations) is a non-trivial optimization problem, in particular when
goals are considered to be \textit{unordered} sets of atoms. In this work we
provide an in-depth study of the problem by defining two different
generalization relations. We formulate a characterization of what constitutes a
most specific generalization in both settings. While these generalizations can
be computed in polynomial time, we show that when the number of variables in
the generalization needs to be minimized, the problem becomes NP-hard. We
subsequently revisit an abstraction of the largest common generalization when
anti-unification is based on injective variable renamings, and prove that it
can be computed in polynomially bounded time.
","[{'version': 'v1', 'created': 'Thu, 1 Jul 2021 10:11:07 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Oct 2021 10:18:59 GMT'}]",2021-10-22,"[['Yernaux', 'Gonzague', ''], ['Vanhoof', 'Wim', '']]","['Anti-unification', 'Logic programming', 'NP-completeness', 'Time complexity', 'Algorithms', 'Inductive logic programming']"
7288,2205.01729,TianSheuan Chang,Chih-Chyau Yang and Tian-Sheuan Chang,Pre-RTL DNN Hardware Evaluator With Fused Layer Support,"2 pages, 2 figures, published in IEEE ISOCC 2021",,10.1109/ISOCC53507.2021.9614027,,cs.AR cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  With the popularity of the deep neural network (DNN), hardware accelerators
are demanded for real time execution. However, lengthy design process and fast
evolving DNN models make hardware evaluation hard to meet the time to market
need. This paper proposes a pre-RTL DNN hardware evaluator that supports
conventional layer-by-layer processing as well as the fused layer processing
for low external bandwidth requirement. The evaluator supports two
state-of-the-art accelerator architectures and finds the best hardware and
layer fusion group The experimental results show the layer fusion scheme can
achieve 55.6% memory bandwidth reduction, 36.7% latency improvement and 49.2%
energy reduction compared with layer-by-layer operation.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 09:58:57 GMT'}]",2022-05-05,"[['Yang', 'Chih-Chyau', ''], ['Chang', 'Tian-Sheuan', '']]","['deep learning accelerator', 'layer fusion', 'neural network evaluator']"
7289,cs/0612117,Seiji Miyoshi,"Masahiro Urakami, Seiji Miyoshi, Masato Okada","Statistical Mechanics of On-line Learning when a Moving Teacher Goes
  around an Unlearnable True Teacher","12 pages, 5 pages",,10.1143/JPSJ.76.044003,,cs.LG cond-mat.dis-nn,,"  In the framework of on-line learning, a learning machine might move around a
teacher due to the differences in structures or output functions between the
teacher and the learning machine. In this paper we analyze the generalization
performance of a new student supervised by a moving machine. A model composed
of a fixed true teacher, a moving teacher, and a student is treated
theoretically using statistical mechanics, where the true teacher is a
nonmonotonic perceptron and the others are simple perceptrons. Calculating the
generalization errors numerically, we show that the generalization errors of a
student can temporarily become smaller than that of a moving teacher, even if
the student only uses examples from the moving teacher. However, the
generalization error of the student eventually becomes the same value with that
of the moving teacher. This behavior is qualitatively different from that of a
linear model.
","[{'version': 'v1', 'created': 'Fri, 22 Dec 2006 00:25:04 GMT'}]",2009-11-11,"[['Urakami', 'Masahiro', ''], ['Miyoshi', 'Seiji', ''], ['Okada', 'Masato', '']]","['on-line learning', 'generalization error', 'moving teacher', 'true teacher', 'unlearnable']"
7290,2107.01853,Erika Covi Dr.,"Erika Covi, Quang T. Duong, Suzanne Lancaster, Viktor Havel, Jean
  Coignus, Justine Barbot, Ole Richter, Philip Klein, Elisabetta Chicca,
  Laurent Grenouillet, Athanasios Dimoulas, Thomas Mikolajick, and Stefan
  Slesazeck",Ferroelectric Tunneling Junctions for Edge Computing,,"2021 IEEE International Symposium on Circuits and Systems (ISCAS),
  2021, pp. 1-5",10.1109/ISCAS51556.2021.9401800,,cs.ET physics.app-ph,http://creativecommons.org/licenses/by/4.0/,"  Ferroelectric tunneling junctions (FTJ) are considered to be the
intrinsically most energy efficient memristors. In this work, specific
electrical features of ferroelectric hafnium-zirconium oxide based FTJ devices
are investigated. Moreover, the impact on the design of FTJ-based circuits for
edge computing applications is discussed by means of two example circuits.
","[{'version': 'v1', 'created': 'Mon, 5 Jul 2021 08:15:34 GMT'}]",2021-07-06,"[['Covi', 'Erika', ''], ['Duong', 'Quang T.', ''], ['Lancaster', 'Suzanne', ''], ['Havel', 'Viktor', ''], ['Coignus', 'Jean', ''], ['Barbot', 'Justine', ''], ['Richter', 'Ole', ''], ['Klein', 'Philip', ''], ['Chicca', 'Elisabetta', ''], ['Grenouillet', 'Laurent', ''], ['Dimoulas', 'Athanasios', ''], ['Mikolajick', 'Thomas', ''], ['Slesazeck', 'Stefan', '']]","['FTJ', 'edge computing', 'ferroelectric tunneling']"
7291,1708.02151,Max Maass,"Milan Stute, Max Maass, Tom Schons, Matthias Hollick",Reverse Engineering Human Mobility in Large-scale Natural Disasters,"To appear in Proceedings of MSWiM '17. 8 Pages, 9 Figures. Source
  code and data available at
  https://github.com/seemoo-lab/natural-disaster-mobility",,10.1145/3127540.3127542,,cs.NI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Delay/Disruption-Tolerant Networks (DTNs) have been around for more than a
decade and have especially been proposed to be used in scenarios where
communication infrastructure is unavailable. In such scenarios, DTNs can offer
a best-effort communication service by exploiting user mobility. Natural
disasters are an important application scenario for DTNs when the cellular
network is destroyed by natural forces. To assess the performance of such
networks before deployment, we require appropriate knowledge of human mobility.
  In this paper, we address this problem by designing, implementing, and
evaluating a novel mobility model for large-scale natural disasters. Due to the
lack of GPS traces, we reverse-engineer human mobility of past natural
disasters (focusing on 2010 Haiti earthquake and 2013 Typhoon Haiyan) by
leveraging knowledge of 126 experts from 71 Disaster Response Organizations
(DROs). By means of simulation-based experiments, we compare and contrast our
mobility model to other well-known models, and evaluate their impact on DTN
performance. Finally, we make our source code available to the public.
","[{'version': 'v1', 'created': 'Mon, 7 Aug 2017 15:05:51 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Sep 2017 16:07:07 GMT'}]",2017-09-22,"[['Stute', 'Milan', ''], ['Maass', 'Max', ''], ['Schons', 'Tom', ''], ['Hollick', 'Matthias', '']]","['Mobility model', 'disaster response', 'DTN']"
7292,2209.14586,Mohammad Imrul Jubair,"Mohammad Imrul Jubair, Arafat Ibne Yousuf, Tashfiq Ahmed, Hasanath
  Jamy, Foisal Reza, Mohsena Ashraf","DIY Graphics Tab: A Cost-Effective Alternative to Graphics Tablet for
  Educators",Accepted at ACM UIST 2022 (poster),,10.1145/3526114.3558718,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Recording lectures is a normal task for online educators, and a graphics
tablet is a great tool for that. However, it is very expensive for many
instructors. In this paper, we propose an alternative called ""DIY Graphics Tab""
that functions largely in the same way as a graphic tab, but requires only a
pen, paper, and laptop's webcam. Our system takes images of writings on a paper
with a webcam and outputs the contents. The task is not straightforward since
there are obstacles, such as hand occlusion, paper movements, lighting, and
perspective distortion due to the viewing angle. A pipeline is used that
applies segmentation and post-processing for generating appropriate output from
input frames. We also conducted user experience evaluations from the teachers.
","[{'version': 'v1', 'created': 'Thu, 29 Sep 2022 06:55:30 GMT'}]",2022-09-30,"[['Jubair', 'Mohammad Imrul', ''], ['Yousuf', 'Arafat Ibne', ''], ['Ahmed', 'Tashfiq', ''], ['Jamy', 'Hasanath', ''], ['Reza', 'Foisal', ''], ['Ashraf', 'Mohsena', '']]","['Graphics Tab', 'Segmentation', 'Perspective transformation']"
7293,2210.10073,Jialiang Lin,"Jialiang Lin, Yao Yu, Jiaxin Song, Xiaodong Shi","Detecting and analyzing missing citations to published scientific
  entities",Please cite the version of Scientometrics,"Scientometrics, Vol. 127, Issue 5, pp. 2395-2412 (2022)",10.1007/s11192-022-04334-5,,cs.DL cs.AI cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Proper citation is of great importance in academic writing for it enables
knowledge accumulation and maintains academic integrity. However, citing
properly is not an easy task. For published scientific entities, the
ever-growing academic publications and over-familiarity of terms easily lead to
missing citations. To deal with this situation, we design a special method
Citation Recommendation for Published Scientific Entity (CRPSE) based on the
cooccurrences between published scientific entities and in-text citations in
the same sentences from previous researchers. Experimental outcomes show the
effectiveness of our method in recommending the source papers for published
scientific entities. We further conduct a statistical analysis on missing
citations among papers published in prestigious computer science conferences in
2020. In the 12,278 papers collected, 475 published scientific entities of
computer science and mathematics are found to have missing citations. Many
entities mentioned without citations are found to be well-accepted research
results. On a median basis, the papers proposing these published scientific
entities with missing citations were published 8 years ago, which can be
considered the time frame for a published scientific entity to develop into a
well-accepted concept. For published scientific entities, we appeal for
accurate and full citation of their source papers as required by academic
standards.
","[{'version': 'v1', 'created': 'Tue, 18 Oct 2022 18:08:20 GMT'}]",2022-10-20,"[['Lin', 'Jialiang', ''], ['Yu', 'Yao', ''], ['Song', 'Jiaxin', ''], ['Shi', 'Xiaodong', '']]","['Citation recommendation', 'Information retrieval', 'Digitalrepositories', 'Literature aging', 'Knowledge popularization']"
7294,1905.11180,Igor Ivkic,"Igor Ivkic, Harald Pichler, Mario Zsilak, Andreas Mauthe and Markus
  Tauber",A Framework for Measuring the Costs of Security at Runtime,https://www.scitepress.org/PublicationsDetail.aspx?ID=X/mD2ocAMT0=&t=1,,10.5220/0007761604880494,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Industry 4.0, Cyber-Physical Systems (CPS) are formed by components, which
are interconnected with each other over the Internet of Things (IoT). The
resulting capabilities of sensing and affecting the physical world offer a vast
range of opportunities, yet, at the same time pose new security challenges. To
address these challenges there are various IoT Frameworks, which offer
solutions for managing and controlling IoT-components and their interactions.
In this regard, providing security for an interaction usually requires
performing additional security-related tasks (e.g. authorisation, encryption,
etc.) to prevent possible security risks. Research currently focuses more on
designing and developing these frameworks and does not satisfactorily provide
methodologies for evaluating the resulting costs of providing security. In this
paper we propose an initial approach for measuring the resulting costs of
providing security for interacting IoT-components by using a Security Cost
Modelling Framework. Furthermore, we describe the necessary building blocks of
the framework and provide an experimental design showing how it could be used
to measure security costs at runtime.
","[{'version': 'v1', 'created': 'Mon, 27 May 2019 12:59:02 GMT'}]",2019-05-28,"[['Ivkic', 'Igor', ''], ['Pichler', 'Harald', ''], ['Zsilak', 'Mario', ''], ['Mauthe', 'Andreas', ''], ['Tauber', 'Markus', '']]","['Cyber-Physical Systems', 'Internet of Things', 'Component Monitoring', 'Task Tracing', 'Security Cost Modelling']"
7295,2010.16015,EPTCS,"Filip Mari\'c (Faculty of Mathematics, University of Belgrade,
  Serbia), Sana Stojanovi\'c-{\Dj}ur{\dj}evi\'c (Faculty of Mathematics,
  University of Belgrade, Serbia)",Formalizing IMO Problems and Solutions in Isabelle/HOL,"In Proceedings ThEdu'20, arXiv:2010.15832","EPTCS 328, 2020, pp. 35-55",10.4204/EPTCS.328.3,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The International Mathematical Olympiad (IMO) is perhaps the most celebrated
mental competition in the world and as such is among the greatest grand
challenges for Artificial Intelligence (AI). The IMO Grand Challenge, recently
formulated, requires to build an AI that can win a gold medal in the
competition. We present some initial steps that could help to tackle this goal
by creating a public repository of mechanically checked solutions of IMO
Problems in the interactive theorem prover Isabelle/HOL. This repository is
actively maintained by students of the Faculty of Mathematics, University of
Belgrade, Serbia within the course ""Introduction to Interactive Theorem
Proving"".
","[{'version': 'v1', 'created': 'Fri, 30 Oct 2020 01:15:19 GMT'}]",2020-11-02,"[['Marić', 'Filip', '', 'Faculty of Mathematics, University of Belgrade,\n  Serbia'], ['Stojanović-{\\Dj}urđević', 'Sana', '', 'Faculty of Mathematics,\n  University of Belgrade, Serbia']]","['primrec and fun', 'Keywords lemma', 'theorem are used to state the statement being proved']"
7296,2204.03383,Antti Rousi Dr.,Antti Mikael Rousi and Mikael Laakso,Overlay journals: a study of the current landscape,10 pages,"Journal of Librarianship and Information Science, 0(0) (2022)",10.1177/09610006221125208,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Overlay journals are characterised by their articles being published on open
access repositories, often already starting in their initial preprint form as a
prerequisite for submission to the journal prior to initiating the peer-review
process. In this study we aimed to identify currently active overlay journals
and examine their characteristics. We utilised an explorative web search and
contacted key service providers for additional information. The final sample
consisted of 34 overlay journals. While the results show that new overlay
journals have been actively established within recent years, the current
presence of overlay journals remains diminutive compared to the overall number
of open access journals. Most overlay journals publish articles in natural
sciences, mathematics or computer sciences, and are commonly published by
groups of academics rather than formal organisations. They may also rank highly
within the traditional journal citation metrics. None of the investigated
journals required fees from authors, which is likely related to the
cost-effective aspects of the overlay publishing model. Both the growth in
adoption of open access preprint repositories and researchers' willingness to
publish in overlay journals will determine the model's wider impact on
scholarly publishing.
","[{'version': 'v1', 'created': 'Thu, 7 Apr 2022 12:01:20 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Jul 2022 07:15:56 GMT'}, {'version': 'v3', 'created': 'Thu, 3 Nov 2022 11:33:11 GMT'}]",2022-11-04,"[['Rousi', 'Antti Mikael', ''], ['Laakso', 'Mikael', '']]","['Digital repositories', 'open access', 'overlay journals', 'overlay publishing', 'preprint repositories', 'scholarly communication']"
7297,2204.09660,Tarik A. Rashid,"Ari M. Saeed, Shnya R. Hussein, Chro M. Ali, Tarik A. Rashid",Medical Dataset Classification for Kurdish Short Text over Social Media,11 pages,"DIB, 2020",10.1016/j.dib.2022.108089,,cs.CL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The Facebook application is used as a resource for collecting the comments of
this dataset, The dataset consists of 6756 comments to create a Medical Kurdish
Dataset (MKD). The samples are comments of users, which are gathered from
different posts of pages (Medical, News, Economy, Education, and Sport). Six
steps as a preprocessing technique are performed on the raw dataset to clean
and remove noise in the comments by replacing characters. The comments (short
text) are labeled for positive class (medical comment) and negative class
(non-medical comment) as text classification. The percentage ratio of the
negative class is 55% while the positive class is 45%.
","[{'version': 'v1', 'created': 'Sat, 26 Mar 2022 22:11:25 GMT'}]",2022-04-21,"[['Saeed', 'Ari M.', ''], ['Hussein', 'Shnya R.', ''], ['Ali', 'Chro M.', ''], ['Rashid', 'Tarik A.', '']]","['Machine Learning', 'Medical Text Classification', 'Kurdish Short Text', 'Text Pre-Processing']"
7298,2104.04071,Gautam Srivastava,"Farrah Huntinghawk, Candace Richard, Sarah Plosker, Gautam Srivastava","Expanding Cybersecurity Knowledge Through an Indigenous Lens: A First
  Look","9 pages, 0 figures","2020 IEEE CCECE, London, ON, Canada, 2020, pp. 1-4",10.1109/CCECE47787.2020.9255753.,,cs.CY cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Decolonization and Indigenous education are at the forefront of Canadian
content currently in Academia. Over the last few decades, we have seen some
major changes in the way in which we share information. In particular, we have
moved into an age of electronically-shared content, and there is an increasing
expectation in Canada that this content is both culturally significant and
relevant. In this paper, we discuss an ongoing community engagement initiative
with First Nations communities in the Western Manitoba region. The initiative
involves knowledge-sharing activities that focus on the topic of cybersecurity,
and are aimed at a public audience. This initial look into our educational
project focuses on the conceptual analysis and planning stage. We are
developing a ""Cybersecurity 101"" mini-curriculum, to be implemented over
several one-hour long workshops aimed at diverse groups (these public workshops
may include a wide range of participants, from tech-adverse to tech-savvy).
Learning assessment tools have been built in to the workshop program. We have
created informational and promotional pamphlets, posters, lesson plans, and
feedback questionnaires which we believe instill relevance and personal
connection to this topic, helping to bridge gaps in accessibility for
Indigenous communities while striving to build positive, reciprocal
relationships. Our methodology is to approach the subject from a community
needs and priorities perspective. Activities are therefore being tailored to
fit each community.
","[{'version': 'v1', 'created': 'Tue, 30 Mar 2021 19:25:01 GMT'}]",2021-04-12,"[['Huntinghawk', 'Farrah', ''], ['Richard', 'Candace', ''], ['Plosker', 'Sarah', ''], ['Srivastava', 'Gautam', '']]","['Cybersecurity', 'Indigenous', 'Education', 'Public Interest', 'Internet']"
7299,2007.16038,Amirreza Khodadadian,"Nima Noii, Amirreza Khodadadian and Thomas Wick",Bayesian Inversion for Anisotropic Hydraulic Phase-Field Fracture,,,10.1016/j.cma.2021.114118,,cs.CE cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, a Bayesian inversion framework for hydraulic phase-field
transversely isotropic and orthotropy anisotropic fracture is proposed.
Therein, three primary fields are pressure, displacements, and phase-field
while direction-dependent responses are enforced (via penalty-like parameters).
A new crack driving state function is introduced by avoiding the compressible
part of anisotropic energy to be degraded. For the Bayesian inversion, we
employ the delayed rejection adaptive Metropolis (DRAM) algorithm to identify
the parameters. We adjust the algorithm to estimate parameters according to a
hydraulic fracture observation, i.e., the maximum pressure. The focus is on
uncertainties arising from different variables, including elasticity modulus,
Biot's coefficient, Biot's modulus, dynamic fluid viscosity, and Griffith's
energy release rate in the case of the isotropic hydraulic fracture while in
the anisotropic setting, we identify additional penalty-like parameters.
Several numerical examples are employed to substantiate our algorithmic
developments.
","[{'version': 'v1', 'created': 'Wed, 29 Jul 2020 21:25:59 GMT'}]",2021-09-22,"[['Noii', 'Nima', ''], ['Khodadadian', 'Amirreza', ''], ['Wick', 'Thomas', '']]","['Phase-field approach', 'hydraulic fracture', 'fluid-saturated porous media', 'anisotropic materials', 'Bayesian inference', 'DRAM algorithm']"
7300,2111.03199,Ehsan Mikaeili,"Ehsan Mikaeili, Susanne Claus, Pierre Kerfriden","Concurrent multiscale analysis without meshing: Microscale
  representation with CutFEM and micro/macro model blending",,,10.1016/j.cma.2022.114807,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we develop a novel unfitted multiscale framework that combines
two separate scales represented by only one single computational mesh. Our
framework relies on a mixed zooming technique where we zoom at regions of
interest to capture microscale properties and then mix the micro and macroscale
properties in a transition region. Furthermore, we use homogenization
techniques to derive macro model material properties. The microscale features
are discretized using CutFEM. The transition region between the micro and
macroscale is represented by a smooth blending function. To address the issues
with ill-conditioning of the multiscale system matrix due to the arbitrary
intersections in cut elements and the transition region, we add stabilization
terms acting on the jumps of the normal gradient (ghost-penalty stabilization).
We show that our multiscale framework is stable and is capable to reproduce
mechanical responses for heterogeneous structures in a mesh-independent manner.
The efficiency of our methodology is exemplified by 2D and 3D numerical
simulations of linear elasticity problems.
","[{'version': 'v1', 'created': 'Fri, 5 Nov 2021 00:07:08 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Mar 2022 17:23:50 GMT'}, {'version': 'v3', 'created': 'Thu, 26 May 2022 14:17:10 GMT'}]",2022-05-27,"[['Mikaeili', 'Ehsan', ''], ['Claus', 'Susanne', ''], ['Kerfriden', 'Pierre', '']]","['concurrent multiscale', 'CutFEM', 'unfitted mesh', 'partition of models', 'level sets']"
7301,2108.11057,Conrad Sanderson,"Conrad Sanderson, Dan Pagendam, Brendan Power, Frederick Bennett, Ross
  Darnell","Opportunistic Emulation of Computationally Expensive Simulations via
  Deep Learning",,"International Congress on Modelling and Simulation, 2021",10.36334/modsim.2021.L1.sanderson,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the underlying aim of increasing efficiency of computational modelling
pertinent for managing & protecting the Great Barrier Reef, we perform a
preliminary investigation on the use of deep neural networks for opportunistic
model emulation of APSIM models by repurposing an existing large dataset
containing outputs of APSIM model runs. The dataset has not been specifically
tailored for the model emulation task. We employ two neural network
architectures for the emulation task: densely connected feed-forward neural
network (FFNN), and gated recurrent unit feeding into FFNN (GRU-FFNN), a type
of a recurrent neural network. Various configurations of the architectures are
trialled. A minimum correlation statistic is used to identify clusters of APSIM
scenarios that can be aggregated to form training sets for model emulation. We
focus on emulating 4 important outputs of the APSIM model: runoff, soil_loss,
DINrunoff, Nleached. The GRU-FFNN architecture with three hidden layers and 128
units per layer provides good emulation of runoff and DINrunoff. However,
soil_loss and Nleached were emulated relatively poorly under a wide range of
the considered architectures; the emulators failed to capture variability at
higher values of these two outputs. While the opportunistic data available from
past modelling activities provides a large and useful dataset for exploring
APSIM emulation, it may not be sufficiently rich enough for successful deep
learning of more complex model dynamics. Design of Computer Experiments may be
required to generate more informative data to emulate all output variables of
interest. We also suggest the use of synthetic meteorology settings to allow
the model to be fed a wide range of inputs. These need not all be
representative of normal conditions, but can provide a denser, more informative
dataset from which complex relationships between input and outputs can be
learned.
","[{'version': 'v1', 'created': 'Wed, 25 Aug 2021 05:57:16 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Sep 2021 04:25:22 GMT'}, {'version': 'v3', 'created': 'Fri, 17 Dec 2021 02:24:36 GMT'}]",2022-01-03,"[['Sanderson', 'Conrad', ''], ['Pagendam', 'Dan', ''], ['Power', 'Brendan', ''], ['Bennett', 'Frederick', ''], ['Darnell', 'Ross', '']]","['surrogate models', 'model emulation', 'deep neural networks', 'recurrent neural networks', 'APSIM']"
7302,2109.08504,Cl\'ement Rolinat,"Cl\'ement Rolinat, Mathieu Grossard, Saifeddine Aloui, Christelle
  Godin","Learning to Model the Grasp Space of an Underactuated Robot Gripper
  Using Variational Autoencoder",accepted at SYSID 2021 conference,"IFAC-PapersOnLine, 19th IFAC Symposium on System Identification
  SYSID 2021, Volume 54, Issue 7, 2021, Pages 523-528, ISSN 2405-8963",10.1016/j.ifacol.2021.08.413,,cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Grasp planning and most specifically the grasp space exploration is still an
open issue in robotics. This article presents a data-driven oriented
methodology to model the grasp space of a multi-fingered adaptive gripper for
known objects. This method relies on a limited dataset of manually specified
expert grasps, and uses variational autoencoder to learn grasp intrinsic
features in a compact way from a computational point of view. The learnt model
can then be used to generate new non-learnt gripper configurations to explore
the grasp space.
","[{'version': 'v1', 'created': 'Fri, 17 Sep 2021 12:32:18 GMT'}]",2021-09-20,"[['Rolinat', 'Clément', ''], ['Grossard', 'Mathieu', ''], ['Aloui', 'Saifeddine', ''], ['Godin', 'Christelle', '']]","['multi-fingered gripper', 'grasp space exploration', 'variational autoencoder']"
7303,1906.04003,Andrea Raffo,Andrea Raffo and Silvia Biasotti,"Data-driven quasi-interpolant spline surfaces for point cloud
  approximation",,,10.1016/j.cag.2020.05.004,,cs.NA cs.GR math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we investigate a local surface approximation, the Weighted
Quasi Interpolant Spline Approximation (wQISA), specifically designed for large
and noisy point clouds. We briefly describe the properties of the wQISA
representation and introduce a novel data-driven implementation, which combines
prediction capability and complexity efficiency. We provide an extended
comparative analysis with other continuous approximations on real data,
including different types of surfaces and levels of noise, such as 3D models,
terrain data and digital environmental data.
","[{'version': 'v1', 'created': 'Mon, 10 Jun 2019 14:23:14 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Apr 2020 19:09:48 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Oct 2020 13:49:42 GMT'}]",2021-05-14,"[['Raffo', 'Andrea', ''], ['Biasotti', 'Silvia', '']]","['Spline methods', 'quasi-interpolation', 'point clouds', 'noise', 'data-drivenmodel assessment']"
7304,2002.12846,Yibo Yang,"Songsong Ji, Gang Pang, Jiwei Zhang, Yibo Yang, Paris Perdikaris",Exact artificial boundary conditions of 1D semi-discretized peridynamics,"21 pages, 14 figures",,10.1098/rspa.2021.0229,,cs.CE cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The peridynamic theory reformulates the equations of continuum mechanics in
terms of integro-differential equations instead of partial differential
equations. It is not trivial to directly apply naive approach in artificial
boundary conditions for continua to peridynamics modeling, because it usually
involves semi-discretization scheme. In this paper, we present a new way to
construct exact boundary conditions for semi-discretized peridynamics using
kernel functions and recursive relations. Specially, kernel functions are used
to characterize one single source are combined to construct the exact boundary
conditions. The recursive relationships between the kernel functions are
proposed, therefore the kernel functions can be computed through the ordinary
differential system and integral system with high precision. The numerical
results demonstrate that the boundary condition has high accuracy. The proposed
method can be applied to modeling of wave propagation of other nonlocal
theories and high dimensional cases.
","[{'version': 'v1', 'created': 'Tue, 25 Feb 2020 03:48:17 GMT'}]",2021-07-07,"[['Ji', 'Songsong', ''], ['Pang', 'Gang', ''], ['Zhang', 'Jiwei', ''], ['Yang', 'Yibo', ''], ['Perdikaris', 'Paris', '']]","['Semi-discretized peridynamic', 'Laplace transform', 'Kernel functions', 'Recursiverelationship']"
7305,2203.08205,Yue Yu,"Huaiqian You, Quinn Zhang, Colton J. Ross, Chung-Hao Lee, Yue Yu","Learning Deep Implicit Fourier Neural Operators (IFNOs) with
  Applications to Heterogeneous Material Modeling",,,10.1016/j.cma.2022.115296,,cs.LG cond-mat.mtrl-sci,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Constitutive modeling based on continuum mechanics theory has been a
classical approach for modeling the mechanical responses of materials. However,
when constitutive laws are unknown or when defects and/or high degrees of
heterogeneity are present, these classical models may become inaccurate. In
this work, we propose to use data-driven modeling, which directly utilizes
high-fidelity simulation and/or experimental measurements to predict a
material's response without using conventional constitutive models.
Specifically, the material response is modeled by learning the implicit
mappings between loading conditions and the resultant displacement and/or
damage fields, with the neural network serving as a surrogate for a solution
operator. To model the complex responses due to material heterogeneity and
defects, we develop a novel deep neural operator architecture, which we coin as
the Implicit Fourier Neural Operator (IFNO). In the IFNO, the increment between
layers is modeled as an integral operator to capture the long-range
dependencies in the feature space. As the network gets deeper, the limit of
IFNO becomes a fixed point equation that yields an implicit neural operator and
naturally mimics the displacement/damage fields solving procedure in material
modeling problems. We demonstrate the performance of our proposed method for a
number of examples, including hyperelastic, anisotropic and brittle materials.
As an application, we further employ the proposed approach to learn the
material models directly from digital image correlation (DIC) tracking
measurements, and show that the learned solution operators substantially
outperform the conventional constitutive models in predicting displacement
fields.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2022 19:08:13 GMT'}]",2022-07-27,"[['You', 'Huaiqian', ''], ['Zhang', 'Quinn', ''], ['Ross', 'Colton J.', ''], ['Lee', 'Chung-Hao', ''], ['Yu', 'Yue', '']]","['Operator-Regression Neural Networks', 'Fourier Neural Operator (FNO)', 'Data-Driven Material']"
7306,2205.04675,Malika Nisal Ratnayake,"Malika Nisal Ratnayake, Don Chathurika Amarathunga, Asaduz Zaman,
  Adrian G. Dyer, Alan Dorin","Spatial Monitoring and Insect Behavioural Analysis Using Computer Vision
  for Precision Pollination","Accepted to be published in the International Journal of Computer
  Vision (Acceptance date: 7th November 2022) 21 pages, 8 figures",International Journal of Computer Vision (2022),10.1007/s11263-022-01715-4,,cs.CV q-bio.QM,http://creativecommons.org/licenses/by/4.0/,"  Insects are the most important global pollinator of crops and play a key role
in maintaining the sustainability of natural ecosystems. Insect pollination
monitoring and management are therefore essential for improving crop production
and food security. Computer vision facilitated pollinator monitoring can
intensify data collection over what is feasible using manual approaches. The
new data it generates may provide a detailed understanding of insect
distributions and facilitate fine-grained analysis sufficient to predict their
pollination efficacy and underpin precision pollination. Current computer
vision facilitated insect tracking in complex outdoor environments is
restricted in spatial coverage and often constrained to a single insect
species. This limits its relevance to agriculture. Therefore, in this article
we introduce a novel system to facilitate markerless data capture for insect
counting, insect motion tracking, behaviour analysis and pollination prediction
across large agricultural areas. Our system is comprised of edge computing
multi-point video recording, offline automated multispecies insect counting,
tracking and behavioural analysis. We implement and test our system on a
commercial berry farm to demonstrate its capabilities. Our system successfully
tracked four insect varieties, at nine monitoring stations within polytunnels,
obtaining an F-score above 0.8 for each variety. The system enabled calculation
of key metrics to assess the relative pollination impact of each insect
variety. With this technological advancement, detailed, ongoing data collection
for precision pollination becomes achievable. This is important to inform
growers and apiarists managing crop pollination, as it allows data-driven
decisions to be made to improve food production and food security.
","[{'version': 'v1', 'created': 'Tue, 10 May 2022 05:11:28 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Nov 2022 13:17:11 GMT'}]",2022-12-06,"[['Ratnayake', 'Malika Nisal', ''], ['Amarathunga', 'Don Chathurika', ''], ['Zaman', 'Asaduz', ''], ['Dyer', 'Adrian G.', ''], ['Dorin', 'Alan', '']]","['deep learning', 'camera trapping', 'honeybees', 'pollination', 'food security', 'insect tracking']"
7307,2106.12863,Ruo Ando,"Ruo Ando, Youki Kadobayashi and Hiroki Takakura","Choice of Parallelism: Multi-GPU Driven Pipeline for Huge Academic
  Backbone Network","This is an Accepted Manuscript of an article published by Taylor &
  Francis Group in the International Journal of Parallel, Emergent &
  Distributed Systems on 24/06/2021 av lable online:
  http://www.tandfonline.com/ DOI: 10.1080/17445760.2021.1941009",,10.1080/17445760.2021.1941009,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Science Information Network (SINET) is a Japanese academic backbone network
for more than 800 research institutions and universities. In this paper, we
present a multi-GPU-driven pipeline for handling huge session data of SINET.
Our pipeline consists of ELK stack, multi-GPU server, and Splunk. A multi-GPU
server is responsible for two procedures: discrimination and histogramming.
Discrimination is dividing session data into ingoing/outgoing with subnet mask
calculation and network address matching. Histogramming is grouping
ingoing/outgoing session data into bins with map-reduce. In our architecture,
we use GPU for the acceleration of ingress/egress discrimination of session
data. Also, we use a tiling design pattern for building a two-stage map-reduce
of CPU and GPU. Our multi-GPU-driven pipeline has succeeded in processing huge
workloads of about 1.2 to 1.6 billion session streams (500GB-650GB) within 24
hours.
","[{'version': 'v1', 'created': 'Thu, 24 Jun 2021 09:59:29 GMT'}]",2021-06-25,"[['Ando', 'Ruo', ''], ['Kadobayashi', 'Youki', ''], ['Takakura', 'Hiroki', '']]","['Multi-GPU', 'streaming data pipeline', 'massive session data', 'map Reduce', 'tilingpattern']"
7308,2212.07034,Khuong Nguyen-Duy,"Khuong D. Nguyen, Charles E. Augarde, William M. Coombs, H.
  Nguyen-Xuan, M. Abdel-Wahab","Non-conforming multipatches for NURBS-based finite element analysis of
  higher-order phase-field models for brittle fracture","40 pages, 35 figures",,10.1016/j.engfracmech.2020.107133,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  This paper proposes an effective computational tool for brittle crack
propagation problems based on a combination of a higher-order phase-field model
and a non-conforming mesh using a NURBS-based isogeometric approach. This
combination, as demonstrated in this paper, is of great benefit in reducing the
computational cost of using a local refinement mesh and a higher-order
phase-field, which needs higher derivatives of basis functions. Compared with
other approaches using a local refinement mesh, the Virtual
Uncommon-Knot-Inserted Master-Slave (VUKIMS) method presented here is not only
simple to implement but can also reduce the variable numbers. VUKIMS is an
outstanding choice in order to establish a local refinement mesh, i.e. a
non-conforming mesh, in a multi-patch problem. A phase-field model is an
efficient approach for various complicated crack patterns, including those with
or without an initial crack path, curved cracks, crack coalescence, and crack
propagation through holes. The paper demonstrates that cubic NURBS elements are
ideal for balancing the computational cost and the accuracy because they can
produce accurate solutions by utilising a lower degree of freedom number than
an extremely fine mesh of first-order B-spline elements.
","[{'version': 'v1', 'created': 'Wed, 14 Dec 2022 05:03:46 GMT'}]",2022-12-15,"[['Nguyen', 'Khuong D.', ''], ['Augarde', 'Charles E.', ''], ['Coombs', 'William M.', ''], ['Nguyen-Xuan', 'H.', ''], ['Abdel-Wahab', 'M.', '']]","['NURBS-based', 'phase field', 'IGA', 'brittle fracture', 'non-conforming multipatch mesh']"
7309,2201.10406,Nicolas Tempelmeier,"Nicolas Tempelmeier, Elena Demidova",Attention-Based Vandalism Detection in OpenStreetMap,,Proceedings of The Webconference 2022,10.1145/3485447.3512224,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  OpenStreetMap (OSM), a collaborative, crowdsourced Web map, is a unique
source of openly available worldwide map data, increasingly adopted in Web
applications. Vandalism detection is a critical task to support trust and
maintain OSM transparency. This task is remarkably challenging due to the large
scale of the dataset, the sheer number of contributors, various vandalism
forms, and the lack of annotated data. This paper presents Ovid - a novel
attention-based method for vandalism detection in OSM. Ovid relies on a novel
neural architecture that adopts a multi-head attention mechanism to summarize
information indicating vandalism from OSM changesets effectively. To facilitate
automated vandalism detection, we introduce a set of original features that
capture changeset, user, and edit information. Furthermore, we extract a
dataset of real-world vandalism incidents from the OSM edit history for the
first time and provide this dataset as open data. Our evaluation conducted on
real-world vandalism data demonstrates the effectiveness of Ovid.
","[{'version': 'v1', 'created': 'Tue, 25 Jan 2022 15:52:54 GMT'}]",2022-01-26,"[['Tempelmeier', 'Nicolas', ''], ['Demidova', 'Elena', '']]","['Vandalism Detection', 'OpenStreetMap', 'Trustworthiness on the Web']"
7310,2206.04500,"Christian Ganh\""or","Christian Ganh\""or, David Penz, Navid Rekabsaz, Oleg Lesota, Markus
  Schedl","Unlearning Protected User Attributes in Recommendations with Adversarial
  Training",Accepted at SIGIR 2022,,10.1145/3477495.3531820,,cs.IR cs.AI cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Collaborative filtering algorithms capture underlying consumption patterns,
including the ones specific to particular demographics or protected information
of users, e.g. gender, race, and location. These encoded biases can influence
the decision of a recommendation system (RS) towards further separation of the
contents provided to various demographic subgroups, and raise privacy concerns
regarding the disclosure of users' protected attributes. In this work, we
investigate the possibility and challenges of removing specific protected
information of users from the learned interaction representations of a RS
algorithm, while maintaining its effectiveness. Specifically, we incorporate
adversarial training into the state-of-the-art MultVAE architecture, resulting
in a novel model, Adversarial Variational Auto-Encoder with Multinomial
Likelihood (Adv-MultVAE), which aims at removing the implicit information of
protected attributes while preserving recommendation performance. We conduct
experiments on the MovieLens-1M and LFM-2b-DemoBias datasets, and evaluate the
effectiveness of the bias mitigation method based on the inability of external
attackers in revealing the users' gender information from the model. Comparing
with baseline MultVAE, the results show that Adv-MultVAE, with marginal
deterioration in performance (w.r.t. NDCG and recall), largely mitigates
inherent biases in the model on both datasets.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2022 13:36:28 GMT'}]",2022-06-10,"[['Ganhör', 'Christian', ''], ['Penz', 'David', ''], ['Rekabsaz', 'Navid', ''], ['Lesota', 'Oleg', ''], ['Schedl', 'Markus', '']]","['recommendation', 'adversarial training', 'gender bias', 'bias mitigation']"
7311,2207.14636,Son T. Luu,"Co Van Dinh, Son T. Luu and Anh Gia-Tuan Nguyen",Detecting Spam Reviews on Vietnamese E-commerce Websites,"Published at The 14th Asian Conference on Intelligent Information and
  Database Systems (ACIIDS 2022). The dataset is available at
  https://github.com/sonlam1102/vispamdetection",,10.1007/978-3-031-21743-2_48,,cs.CL cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The reviews of customers play an essential role in online shopping. People
often refer to reviews or comments of previous customers to decide whether to
buy a new product. Catching up with this behavior, some people create untruths
and illegitimate reviews to hoax customers about the fake quality of products.
These are called spam reviews, confusing consumers on online shopping platforms
and negatively affecting online shopping behaviors. We propose the dataset
called ViSpamReviews, which has a strict annotation procedure for detecting
spam reviews on e-commerce platforms. Our dataset consists of two tasks: the
binary classification task for detecting whether a review is spam or not and
the multi-class classification task for identifying the type of spam. The
PhoBERT obtained the highest results on both tasks, 86.89% and 72.17%,
respectively, by macro average F1 score.
","[{'version': 'v1', 'created': 'Wed, 27 Jul 2022 10:37:14 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Dec 2022 04:02:18 GMT'}]",2022-12-12,"[['Van Dinh', 'Co', ''], ['Luu', 'Son T.', ''], ['Nguyen', 'Anh Gia-Tuan', '']]","['spam reviews', 'text classification', 'deep neural models', 'transformer models', 'dataset', 'annotation guidelines']"
7312,2208.03646,Hongwu Peng,"Hongwu Peng, Shaoyi Huang, Shiyang Chen, Bingbing Li, Tong Geng, Ang
  Li, Weiwen Jiang, Wujie Wen, Jinbo Bi, Hang Liu and Caiwen Ding","A Length Adaptive Algorithm-Hardware Co-design of Transformer on FPGA
  Through Sparse Attention and Dynamic Pipelining",2022 59th ACM/IEEE Design Automation Conference (DAC),,10.1145/3489517.3530585,,cs.LG cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transformers are considered one of the most important deep learning models
since 2018, in part because it establishes state-of-the-art (SOTA) records and
could potentially replace existing Deep Neural Networks (DNNs). Despite the
remarkable triumphs, the prolonged turnaround time of Transformer models is a
widely recognized roadblock. The variety of sequence lengths imposes additional
computing overhead where inputs need to be zero-padded to the maximum sentence
length in the batch to accommodate the parallel computing platforms. This paper
targets the field-programmable gate array (FPGA) and proposes a coherent
sequence length adaptive algorithm-hardware co-design for Transformer
acceleration. Particularly, we develop a hardware-friendly sparse attention
operator and a length-aware hardware resource scheduling algorithm. The
proposed sparse attention operator brings the complexity of attention-based
models down to linear complexity and alleviates the off-chip memory traffic.
The proposed length-aware resource hardware scheduling algorithm dynamically
allocates the hardware resources to fill up the pipeline slots and eliminates
bubbles for NLP tasks. Experiments show that our design has very small accuracy
loss and has 80.2 $\times$ and 2.6 $\times$ speedup compared to CPU and GPU
implementation, and 4 $\times$ higher energy efficiency than state-of-the-art
GPU accelerator optimized via CUBLAS GEMM.
","[{'version': 'v1', 'created': 'Sun, 7 Aug 2022 05:48:38 GMT'}, {'version': 'v2', 'created': 'Sat, 20 Aug 2022 23:04:20 GMT'}]",2022-08-23,"[['Peng', 'Hongwu', ''], ['Huang', 'Shaoyi', ''], ['Chen', 'Shiyang', ''], ['Li', 'Bingbing', ''], ['Geng', 'Tong', ''], ['Li', 'Ang', ''], ['Jiang', 'Weiwen', ''], ['Wen', 'Wujie', ''], ['Bi', 'Jinbo', ''], ['Liu', 'Hang', ''], ['Ding', 'Caiwen', '']]","['Transformer', 'Attention', 'BERT', 'Length adaptive', 'FPGA']"
7313,2201.12767,Haris Moazam Sheikh,Haris Moazam Sheikh and Philip S. Marcus,Bayesian Optimization For Multi-Objective Mixed-Variable Problems,,,10.1007/s00158-022-03382-y,,cs.LG cs.AI cs.CE math.OC,http://creativecommons.org/licenses/by/4.0/,"  Optimizing multiple, non-preferential objectives for mixed-variable,
expensive black-box problems is important in many areas of engineering and
science. The expensive, noisy, black-box nature of these problems makes them
ideal candidates for Bayesian optimization (BO). Mixed-variable and
multi-objective problems, however, are a challenge due to BO's underlying
smooth Gaussian process surrogate model. Current multi-objective BO algorithms
cannot deal with mixed-variable problems. We present MixMOBO, the first
mixed-variable, multi-objective Bayesian optimization framework for such
problems. Using MixMOBO, optimal Pareto-fronts for multi-objective,
mixed-variable design spaces can be found efficiently while ensuring diverse
solutions. The method is sufficiently flexible to incorporate different kernels
and acquisition functions, including those that were developed for
mixed-variable or multi-objective problems by other authors. We also present
HedgeMO, a modified Hedge strategy that uses a portfolio of acquisition
functions for multi-objective problems. We present a new acquisition function,
SMC. Our results show that MixMOBO performs well against other mixed-variable
algorithms on synthetic problems. We apply MixMOBO to the real-world design of
an architected material and show that our optimal design, which was
experimentally fabricated and validated, has a normalized strain energy density
$10^4$ times greater than existing structures.
","[{'version': 'v1', 'created': 'Sun, 30 Jan 2022 09:38:06 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Aug 2022 20:55:36 GMT'}]",2022-11-15,"[['Sheikh', 'Haris Moazam', ''], ['Marcus', 'Philip S.', '']]","['Bayesian Optimization', 'Mixed Variables', 'Multi Objective', 'MixMOBO', 'HedgeMO', 'ArchitectedMeta-Materials']"
7314,1711.11317,Bo Hu,"Bo Hu, Ye Tang, Eric I-Chao Chang, Yubo Fan, Maode Lai and Yan Xu","Unsupervised Learning for Cell-level Visual Representation in
  Histopathology Images with Generative Adversarial Networks","Accepted for publication in IEEE Journal of Biomedical and Health
  Informatics",,10.1109/JBHI.2018.2852639,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The visual attributes of cells, such as the nuclear morphology and chromatin
openness, are critical for histopathology image analysis. By learning
cell-level visual representation, we can obtain a rich mix of features that are
highly reusable for various tasks, such as cell-level classification, nuclei
segmentation, and cell counting. In this paper, we propose a unified generative
adversarial networks architecture with a new formulation of loss to perform
robust cell-level visual representation learning in an unsupervised setting.
Our model is not only label-free and easily trained but also capable of
cell-level unsupervised classification with interpretable visualization, which
achieves promising results in the unsupervised classification of bone marrow
cellular components. Based on the proposed cell-level visual representation
learning, we further develop a pipeline that exploits the varieties of cellular
elements to perform histopathology image classification, the advantages of
which are demonstrated on bone marrow datasets.
","[{'version': 'v1', 'created': 'Thu, 30 Nov 2017 10:53:56 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Jan 2018 15:04:55 GMT'}, {'version': 'v3', 'created': 'Sun, 1 Apr 2018 09:07:35 GMT'}, {'version': 'v4', 'created': 'Sat, 7 Jul 2018 07:31:18 GMT'}]",2018-07-10,"[['Hu', 'Bo', ''], ['Tang', 'Ye', ''], ['Chang', 'Eric I-Chao', ''], ['Fan', 'Yubo', ''], ['Lai', 'Maode', ''], ['Xu', 'Yan', '']]","['unsupervised learning', 'representation learning', 'generative adversarial networks', 'classification', 'cell']"
7315,1411.6408,Michael Codish,Michael Codish and Lu\'is Cruz-Filipe and Peter Schneider-Kamp,Sorting Networks: the End Game,,,10.1007/978-3-319-15579-1_52,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies properties of the back end of a sorting network and
illustrates the utility of these in the search for networks of optimal size or
depth. All previous works focus on properties of the front end of networks and
on how to apply these to break symmetries in the search. The new properties
help shed understanding on how sorting networks sort and speed-up solvers for
both optimal size and depth by an order of magnitude.
","[{'version': 'v1', 'created': 'Mon, 24 Nov 2014 11:00:09 GMT'}]",2016-11-30,"[['Codish', 'Michael', ''], ['Cruz-Filipe', 'Luís', ''], ['Schneider-Kamp', 'Peter', '']]","['sorting networks', 'SAT solving', 'symmetry breaking']"
7316,2011.00768,Feng Cen,"Feng Cen (1), Xiaoyu Zhao (1), Wuzhuang Li (1) and Guanghui Wang (2)
  ((1) The Department of Control Science & Engineering, College of Electronics
  and Information Engineering, Tongji University, Shanghai 201804, China, (2)
  Department of Computer Science, Ryerson University, Toronto, ON, Canada M5B
  2K3)",Deep Feature Augmentation for Occluded Image Classification,,,10.1016/j.patcog.2020.107737,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the difficulty in acquiring massive task-specific occluded images, the
classification of occluded images with deep convolutional neural networks
(CNNs) remains highly challenging. To alleviate the dependency on large-scale
occluded image datasets, we propose a novel approach to improve the
classification accuracy of occluded images by fine-tuning the pre-trained
models with a set of augmented deep feature vectors (DFVs). The set of
augmented DFVs is composed of original DFVs and pseudo-DFVs. The pseudo-DFVs
are generated by randomly adding difference vectors (DVs), extracted from a
small set of clean and occluded image pairs, to the real DFVs. In the
fine-tuning, the back-propagation is conducted on the DFV data flow to update
the network parameters. The experiments on various datasets and network
structures show that the deep feature augmentation significantly improves the
classification accuracy of occluded images without a noticeable influence on
the performance of clean images. Specifically, on the ILSVRC2012 dataset with
synthetic occluded images, the proposed approach achieves 11.21% and 9.14%
average increases in classification accuracy for the ResNet50 networks
fine-tuned on the occlusion-exclusive and occlusion-inclusive training sets,
respectively.
","[{'version': 'v1', 'created': 'Mon, 2 Nov 2020 06:25:05 GMT'}]",2020-11-03,"[['Cen', 'Feng', ''], ['Zhao', 'Xiaoyu', ''], ['Li', 'Wuzhuang', ''], ['Wang', 'Guanghui', '']]","['deep feature augmentation', 'image occlusion', 'convolutional neural']"
7317,1909.01135,Chidimma Opara,"Chidimma Opara, Bo Wei, and Yingke Chen","HTMLPhish: Enabling Phishing Web Page Detection by Applying Deep
  Learning Techniques on HTML Analysis",,International Joint Conference on Neural Networks (IJCNN) 2020,10.1109/IJCNN48605.2020.9207707,,cs.CR cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, the development and implementation of phishing attacks require
little technical skills and costs. This uprising has led to an ever-growing
number of phishing attacks on the World Wide Web. Consequently, proactive
techniques to fight phishing attacks have become extremely necessary. In this
paper, we propose HTMLPhish, a deep learning based data-driven end-to-end
automatic phishing web page classification approach. Specifically, HTMLPhish
receives the content of the HTML document of a web page and employs
Convolutional Neural Networks (CNNs) to learn the semantic dependencies in the
textual contents of the HTML. The CNNs learn appropriate feature
representations from the HTML document embeddings without extensive manual
feature engineering. Furthermore, our proposed approach of the concatenation of
the word and character embeddings allows our model to manage new features and
ensure easy extrapolation to test data. We conduct comprehensive experiments on
a dataset of more than 50,000 HTML documents that provides a distribution of
phishing to benign web pages obtainable in the real-world that yields over 93
percent Accuracy and True Positive Rate. Also, HTMLPhish is a completely
language-independent and client-side strategy which can, therefore, conduct web
page phishing detection regardless of the textual language.
","[{'version': 'v1', 'created': 'Wed, 28 Aug 2019 23:58:50 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Feb 2020 17:10:56 GMT'}, {'version': 'v3', 'created': 'Fri, 15 May 2020 10:30:32 GMT'}]",2020-11-09,"[['Opara', 'Chidimma', ''], ['Wei', 'Bo', ''], ['Chen', 'Yingke', '']]","['Phishing detection', 'Web pages', 'Classifcation model', 'Convolutional Neural Networks', 'HTML']"
7318,2008.13690,Jussi Tohka,Jussi Tohka and Mark van Gils,"Evaluation of machine learning algorithms for Health and Wellness
  applications: a tutorial",To be published in Computers in Biology and Medicine,,10.1016/j.compbiomed.2021.104324,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Research on decision support applications in healthcare, such as those
related to diagnosis, prediction, treatment planning, etc., have seen
enormously increased interest recently. This development is thanks to the
increase in data availability as well as advances in artificial intelligence
and machine learning research. Highly promising research examples are published
daily. However, at the same time, there are some unrealistic expectations with
regards to the requirements for reliable development and objective validation
that is needed in healthcare settings. These expectations may lead to unmet
schedules and disappointments (or non-uptake) at the end-user side. It is the
aim of this tutorial to provide practical guidance on how to assess performance
reliably and efficiently and avoid common traps. Instead of giving a list of
do's and don't s, this tutorial tries to build a better understanding behind
these do's and don't s and presents both the most relevant performance
evaluation criteria as well as how to compute them. Along the way, we will
indicate common mistakes and provide references discussing various topics more
in-depth.
","[{'version': 'v1', 'created': 'Mon, 31 Aug 2020 15:50:51 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Mar 2021 16:40:09 GMT'}]",2021-03-25,"[['Tohka', 'Jussi', ''], ['van Gils', 'Mark', '']]","['Machine learning', 'Artificial intelligence', 'Biomedicine', 'LifeSciences', 'Performance Assessment', 'Decision Support Systems']"
7319,2209.08920,Nicolau Duran-Silva,"Nicandro Bovenzi, Nicolau Duran-Silva, Francesco Alessandro Massucci,
  Francesco Multari, C\`esar Parra-Rojas, and Josep Pujol-Llatse","Mapping STI ecosystems via Open Data: overcoming the limitations of
  conflicting taxonomies. A case study for Climate Change Research in Denmark","International Conference on Theory and Practice of Digital Libraries
  (TPDL) 2022",,10.1007/978-3-031-16802-4_52,,cs.DL cs.CL,http://creativecommons.org/licenses/by-sa/4.0/,"  Science, Technology and Innovation (STI) decision-makers often need to have a
clear vision of what is researched and by whom to design effective policies.
Such a vision is provided by effective and comprehensive mappings of the
research activities carried out within their institutional boundaries. A major
challenge to be faced in this context is the difficulty in accessing the
relevant data and in combining information coming from different sources:
indeed, traditionally, STI data has been confined within closed data sources
and, when available, it is categorised with different taxonomies. Here, we
present a proof-of-concept study of the use of Open Resources to map the
research landscape on the Sustainable Development Goal (SDG) 13-Climate Action,
for an entire country, Denmark, and we map it on the 25 ERC panels.
","[{'version': 'v1', 'created': 'Mon, 19 Sep 2022 10:59:39 GMT'}]",2022-09-20,"[['Bovenzi', 'Nicandro', ''], ['Duran-Silva', 'Nicolau', ''], ['Massucci', 'Francesco Alessandro', ''], ['Multari', 'Francesco', ''], ['Parra-Rojas', 'Cèsar', ''], ['Pujol-Llatse', 'Josep', '']]","['Science mapping', 'Text mining', 'Deep learning', 'Open data repositories', 'Sustainable Development Goals']"
7320,1912.13347,R Jaberi,Raed Jaberi,$2$-edge-twinless blocks,,"Bulletin des Sciences Math\'ematiques 168 May 2021, 102969",10.1016/j.bulsci.2021.102969,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $G=(V,E)$ be a directed graph. A $2$-edge-twinless block in $G$ is a
maximal vertex set $C^{t}\subseteq V$ with $|C^{t}|>1$ such that for any
distinct vertices $v,w \in C^{t}$, and for every edge $e\in E$, the vertices
$v,w$ are in the same twinless strongly connected component of $G\setminus\left
\lbrace e \right\rbrace $.
  In this paper we study this concept and describe algorithms for computing
$2$-edge-twinless blocks.
","[{'version': 'v1', 'created': 'Tue, 31 Dec 2019 15:12:35 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Jan 2020 10:20:53 GMT'}]",2022-05-10,"[['Jaberi', 'Raed', '']]","['Directed graphs', 'Strong bridges', 'Graph algorithms', '2-blocks', 'Twinless strongly connected graphs']"
7321,1909.00464,Kathleen Gregory,"Kathleen Gregory, Paul Groth, Andrea Scharnhorst, Sally Wyatt",Lost or found? Discovering data needed for research,Harvard Data Science Review (2020),,10.1162/99608f92.e38165eb,,cs.DL cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Finding data is a necessary precursor to being able to reuse data, although
relatively little large-scale empirical evidence exists about how researchers
discover, make sense of and (re)use data for research. This study presents
evidence from the largest known survey investigating how researchers discover
and use data that they do not create themselves. We examine the data needs and
discovery strategies of respondents, propose a typology for data reuse and
probe the role of social interactions and literature search in data discovery.
We consider how data communities can be conceptualized according to data uses
and propose practical applications of our findings for designers of data
discovery systems and repositories. Specifically, we consider how to design for
a diversity of practices, how communities of use can serve as an entry point
for design and the role of metadata in supporting both sensemaking and social
interactions.
","[{'version': 'v1', 'created': 'Sun, 1 Sep 2019 19:56:00 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Jan 2020 12:35:48 GMT'}, {'version': 'v3', 'created': 'Thu, 2 Apr 2020 16:07:10 GMT'}]",2020-06-30,"[['Gregory', 'Kathleen', ''], ['Groth', 'Paul', ''], ['Scharnhorst', 'Andrea', ''], ['Wyatt', 'Sally', '']]","['data discovery', 'data search', 'data reuse', 'research practices', 'open data policy', 'research communities']"
7322,2207.11680,Chaozheng Wang,"Chaozheng Wang, Yuanhang Yang, Cuiyun Gao, Yun Peng, Hongyu Zhang,
  Michael R. Lyu","No More Fine-Tuning? An Experimental Evaluation of Prompt Tuning in Code
  Intelligence",Accepted in ESEC/FSE 2022,,10.1145/3540250.3549113,,cs.SE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pre-trained models have been shown effective in many code intelligence tasks.
These models are pre-trained on large-scale unlabeled corpus and then
fine-tuned in downstream tasks. However, as the inputs to pre-training and
downstream tasks are in different forms, it is hard to fully explore the
knowledge of pre-trained models. Besides, the performance of fine-tuning
strongly relies on the amount of downstream data, while in practice, the
scenarios with scarce data are common. Recent studies in the natural language
processing (NLP) field show that prompt tuning, a new paradigm for tuning,
alleviates the above issues and achieves promising results in various NLP
tasks. In prompt tuning, the prompts inserted during tuning provide
task-specific knowledge, which is especially beneficial for tasks with
relatively scarce data. In this paper, we empirically evaluate the usage and
effect of prompt tuning in code intelligence tasks. We conduct prompt tuning on
popular pre-trained models CodeBERT and CodeT5 and experiment with three code
intelligence tasks including defect prediction, code summarization, and code
translation. Our experimental results show that prompt tuning consistently
outperforms fine-tuning in all three tasks. In addition, prompt tuning shows
great potential in low-resource scenarios, e.g., improving the BLEU scores of
fine-tuning by more than 26\% on average for code summarization. Our results
suggest that instead of fine-tuning, we could adapt prompt tuning for code
intelligence tasks to achieve better performance, especially when lacking
task-specific data.
","[{'version': 'v1', 'created': 'Sun, 24 Jul 2022 07:29:17 GMT'}]",2022-07-26,"[['Wang', 'Chaozheng', ''], ['Yang', 'Yuanhang', ''], ['Gao', 'Cuiyun', ''], ['Peng', 'Yun', ''], ['Zhang', 'Hongyu', ''], ['Lyu', 'Michael R.', '']]","['code intelligence', 'prompt tuning', 'empirical study']"
7323,2204.12177,Shadab Choudhury,"Ishrat Jahan Ananya, Sarah Suad, Shadab Hafiz Choudhury and Mohammad
  Ashrafuzzaman Khan","A Comparative Study on Approaches to Acoustic Scene Classification using
  CNNs","Presented at 2021 Mexican International Conference on Artificial
  Intelligence. Published in Advances in Computational Intelligence, MICAI
  2021, Lecture Notes in Computer Science. 12 pages, 3 figures, 5 tables","Advances in Computational Intelligence, MICAI 2021, Lecture Notes
  in Artificial Intelligence vol. 13067, pp. 81-91 (2021)",10.1007/978-3-030-89817-5_6,,cs.SD cs.AI cs.CV eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Acoustic scene classification is a process of characterizing and classifying
the environments from sound recordings. The first step is to generate features
(representations) from the recorded sound and then classify the background
environments. However, different kinds of representations have dramatic effects
on the accuracy of the classification. In this paper, we explored the three
such representations on classification accuracy using neural networks. We
investigated the spectrograms, MFCCs, and embeddings representations using
different CNN networks and autoencoders. Our dataset consists of sounds from
three settings of indoors and outdoors environments - thus the dataset contains
sound from six different kinds of environments. We found that the spectrogram
representation has the highest classification accuracy while MFCC has the
lowest classification accuracy. We reported our findings, insights as well as
some guidelines to achieve better accuracy for environment classification using
sounds.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2022 09:23:29 GMT'}]",2022-04-27,"[['Ananya', 'Ishrat Jahan', ''], ['Suad', 'Sarah', ''], ['Choudhury', 'Shadab Hafiz', ''], ['Khan', 'Mohammad Ashrafuzzaman', '']]","['Acoustic Scene Classification', 'Signal Processing', 'Deep Learning Convolutional Neural Network', 'Autoencoders']"
7324,2007.00349,Alexander Heinrich,"Alexander Heinrich, Milan Stute, Matthias Hollick",DEMO: BTLEmap: Nmap for Bluetooth Low Energy,"13th ACM Conference on Security and Privacy in Wireless and Mobile
  Networks",,10.1145/3395351.3401796,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The market for Bluetooth Low Energy devices is booming and, at the same time,
has become an attractive target for adversaries. To improve BLE security at
large, we present BTLEmap, an auditing application for BLE environments.
BTLEmap is inspired by network discovery and security auditing tools such as
Nmap for IP-based networks. It allows for device enumeration, GATT service
discovery, and device fingerprinting. It goes even further by integrating a BLE
advertisement dissector, data exporter, and a user-friendly UI, including a
proximity view. BTLEmap currently runs on iOS and macOS using Apple's
CoreBluetooth API but also accepts alternative data inputs such as a Raspberry
Pi to overcome the restricted vendor API. The open-source project is under
active development and will provide more advanced capabilities such as
long-term device tracking (in spite of MAC address randomization) in the
future.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2020 09:37:37 GMT'}]",2020-07-02,"[['Heinrich', 'Alexander', ''], ['Stute', 'Milan', ''], ['Hollick', 'Matthias', '']]","['Bluetooth Low Energy', 'privacy analysis', 'device enumeration', 'network monitoring', 'reverse engineering']"
7325,2002.02219,Farzam Fanitabasi,"Farzam Fanitabasi, Edward Gaere, Evangelos Pournaras",A Self-Integration Testbed for Decentralized Socio-technical Systems,,,10.1016/j.future.2020.07.036,,cs.MA cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Internet of Things comes along with new challenges for experimenting,
testing, and operating decentralized socio-technical systems at large-scale. In
such systems, autonomous agents interact locally with their users, and remotely
with other agents to make intelligent collective choices. Via these
interactions they self-regulate the consumption and production of distributed
resources. While such complex systems are often deployed and operated using
centralized computing infrastructures, the socio-technical nature of these
decentralized systems requires new value-sensitive design paradigms; empowering
trust, transparency, and alignment with citizens' social values, such as
privacy preservation, autonomy, and fairness among citizens' choices.
Currently, instruments and tools to study such systems and guide the
prototyping process from simulation to live deployment are missing, or not
practical in this distributed socio-technical context. This paper bridges this
gap by introducing a novel testbed architecture for decentralized
socio-technical systems running on IoT. This new architecture is designed for a
seamless reusability of (i) application-independent decentralized services by
an IoT application, and (ii) different IoT applications by the same
decentralized service. This dual self-integration promises IoT applications
that are simpler to prototype, and can interoperate with decentralized services
during runtime to self-integrate more complex functionality. Such integration
provides stronger validation of IoT applications, and improves resource
utilization. Pressure and crash tests during continuous operations of several
weeks, with more than 80K network joining and leaving of agents, 2.4M parameter
changes, and 100M communicated messages, confirm the robustness and
practicality of the testbed architecture.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2020 12:18:28 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Jul 2020 09:25:48 GMT'}]",2020-07-23,"[['Fanitabasi', 'Farzam', ''], ['Gaere', 'Edward', ''], ['Pournaras', 'Evangelos', '']]","['Internet of Things', 'Testbed architecture', 'Socio-technical system', 'Self-integration', 'Decentralized systems', 'Multi-agentsystem']"
7326,2008.11453,Mir Saman Tajbakhsh,"Hanif Emamgholizadeh, Milad Nourizade, Mir Saman Tajbakhsh, Mahdieh
  Hashminezhad, Farzaneh Nasr Esfahani","A Framework for Quantifying Controversy of Social Network Debates Using
  Attributed Networks: Biased Random Walk (BRW)",,"Soc. Netw. Anal. Min. 10, 90 (2020)",10.1007/s13278-020-00703-1,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  All societies have been much more bipolar over the past few years,
particularly after the emergence of online social networks and media. In fact,
the gap between the two ends of social spectrum is going to be even deeper
after the spread of new media. In this circumstance, social polarization has
been a growing concern among socialists and computer science experts because of
the detrimental impact which online social networks can have on societies by
adding fuel to the fire of extremism. Several types of research were conducted
for proposing measures to calculate the controversy level in social networks,
afterward, to reduce controversy among contradicting viewpoints, for example,
by exposing opinions of one side to other side's members. Most of the attempts
for quantifying social networks' controversy have considered the networks in
their most primary forms, without any attributes. Although these kinds of
researches provide platform-free algorithms to be used in different social
networks, they are not able to take into account a great deal of useful
information provided by users (node attributes).To surmount this shortcoming,
we propose a framework to be utilized in different networks with different
attributes. We propelled some Biased Random Walks (BRW) to find their path from
start point to an initially unknown endpoint with respect to initial energy of
start node and energy loss of nodes on the path. We extracted structural
attribute of networks, using node2vec, and compared it with state-of-the-art
algorithms, and showed its accuracy. Then, we extracted some content attributes
of user and analyze their effects on the results of our algorithm. BRW is
compared with another state-of-the-art controversy measuring algorithm. Then,
its changes in different level of controversy in Persian Twitter is considered
to show how it works in different circumstance.
","[{'version': 'v1', 'created': 'Wed, 26 Aug 2020 09:10:39 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Aug 2020 22:03:08 GMT'}, {'version': 'v3', 'created': 'Sat, 5 Sep 2020 16:18:19 GMT'}, {'version': 'v4', 'created': 'Sat, 17 Oct 2020 17:46:43 GMT'}, {'version': 'v5', 'created': 'Sat, 7 Nov 2020 15:52:33 GMT'}]",2020-11-10,"[['Emamgholizadeh', 'Hanif', ''], ['Nourizade', 'Milad', ''], ['Tajbakhsh', 'Mir Saman', ''], ['Hashminezhad', 'Mahdieh', ''], ['Esfahani', 'Farzaneh Nasr', '']]","['Social Media', 'Polarization', 'Controversy', 'Social Networks', 'Random Walk']"
7327,2204.10232,Wei Tang,"Wei Tang, Yanlin Wang, Hongyu Zhang, Shi Han, Ping Luo, Dongmei Zhang","LibDB: An Effective and Efficient Framework for Detecting Third-Party
  Libraries in Binaries",MSR 2022,,10.1145/3524842.3528442,,cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Third-party libraries (TPLs) are reused frequently in software applications
for reducing development cost. However, they could introduce security risks as
well. Many TPL detection methods have been proposed to detect TPL reuse in
Android bytecode or in source code. This paper focuses on detecting TPL reuse
in binary code, which is a more challenging task. For a detection target in
binary form, libraries may be compiled and linked to separate dynamic-link
files or built into a fused binary that contains multiple libraries and
project-specific code. This could result in fewer available code features and
lower the effectiveness of feature engineering. In this paper, we propose a
binary TPL reuse detection framework, LibDB, which can effectively and
efficiently detect imported TPLs even in stripped and fused binaries. In
addition to the basic and coarse-grained features (string literals and exported
function names), LibDB utilizes function contents as a new type of feature. It
embeds all functions in a binary file to low-dimensional representations with a
trained neural network. It further adopts a function call graph-based
comparison method to improve the accuracy of the detection. LibDB is able to
support version identification of TPLs contained in the detection target, which
is not considered by existing detection methods. To evaluate the performance of
LibDB, we construct three datasets for binary-based TPL reuse detection. Our
experimental results show that LibDB is more accurate and efficient than
state-of-the-art tools on the binary TPL detection task and the version
identification task. Our datasets and source code used in this work are
anonymously available at https://github.com/DeepSoftwareAnalytics/LibDB.
","[{'version': 'v1', 'created': 'Thu, 21 Apr 2022 16:10:03 GMT'}]",2022-04-22,"[['Tang', 'Wei', ''], ['Wang', 'Yanlin', ''], ['Zhang', 'Hongyu', ''], ['Han', 'Shi', ''], ['Luo', 'Ping', ''], ['Zhang', 'Dongmei', '']]","['Third-party libraries', 'Static binary analysis', 'Clone detection']"
7328,2108.13114,Trevor McDonell,"Trevor L. McDonell, Joshua D. Meredith, Gabriele Keller",Embedded Pattern Matching,,,10.1145/3546189.3549917,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Haskell is a popular choice for hosting deeply embedded languages. A
recurring challenge for these embeddings is how to seamlessly integrate user
defined algebraic data types. In particular, one important, convenient, and
expressive feature for creating and inspecting data -- pattern matching -- is
not directly available on embedded terms. We present a novel technique,
embedded pattern matching, which enables a natural and user friendly embedding
of user defined algebraic data types into the embedded language, and allows
programmers to pattern match on terms in the embedded language in much the same
way they would in the host language.
","[{'version': 'v1', 'created': 'Mon, 30 Aug 2021 10:47:19 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Jul 2022 10:40:11 GMT'}]",2022-08-01,"[['McDonell', 'Trevor L.', ''], ['Meredith', 'Joshua D.', ''], ['Keller', 'Gabriele', '']]","['Haskell', 'pattern matching', 'algebraic data types', 'embedded languages']"
7329,2110.04837,James Brusseau,James Brusseau,Using Edge Cases to Disentangle Fairness and Solidarity in AI Ethics,Full published version at AI Ethics (2021): https://rdcu.be/cx8kO,,10.1007/s43681-021-00090-z,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Principles of fairness and solidarity in AI ethics regularly overlap,
creating obscurity in practice: acting in accordance with one can appear
indistinguishable from deciding according to the rules of the other. However,
there exist irregular cases where the two concepts split, and so reveal their
disparate meanings and uses. This paper explores two cases in AI medical
ethics, one that is irregular and the other more conventional, to fully
distinguish fairness and solidarity. Then the distinction is applied to the
frequently cited COMPAS versus ProPublica dispute in judicial ethics. The
application provides a broader model for settling contemporary and topical
debates about fairness and solidarity. It also implies a deeper and
disorienting truth about AI ethics principles and their justification.
","[{'version': 'v1', 'created': 'Sun, 10 Oct 2021 16:07:07 GMT'}]",2021-10-12,"[['Brusseau', 'James', '']]","['AI ethics', 'philosophy', 'fairness', 'solidarity', 'COMPAS']"
7330,2008.01437,Dhruv Verma,"Dhruv Verma, Kshitij Gulati and Rajiv Ratn Shah","Addressing the Cold-Start Problem in Outfit Recommendation Using Visual
  Preference Modelling",Sixth IEEE International Conference on Multimedia Big Data (BigMM'20),,10.1109/BigMM50055.2020.00043,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the global transformation of the fashion industry and a rise in the
demand for fashion items worldwide, the need for an effectual fashion
recommendation has never been more. Despite various cutting-edge solutions
proposed in the past for personalising fashion recommendation, the technology
is still limited by its poor performance on new entities, i.e. the cold-start
problem. In this paper, we attempt to address the cold-start problem for new
users, by leveraging a novel visual preference modelling approach on a small
set of input images. We demonstrate the use of our approach with
feature-weighted clustering to personalise occasion-oriented outfit
recommendation. Quantitatively, our results show that the proposed visual
preference modelling approach outperforms state of the art in terms of clothing
attribute prediction. Qualitatively, through a pilot study, we demonstrate the
efficacy of our system to provide diverse and personalised recommendations in
cold-start scenarios.
","[{'version': 'v1', 'created': 'Tue, 4 Aug 2020 10:07:09 GMT'}]",2021-09-14,"[['Verma', 'Dhruv', ''], ['Gulati', 'Kshitij', ''], ['Shah', 'Rajiv Ratn', '']]","['personalised outfit recommendation', 'cold-start problem', 'visual preference modelling', 'feature-weighted clustering']"
7331,1903.05843,Vineeta Jain Ms.,"Vineeta Jain, Vijay Laxmi, Manoj Singh Gaur, Mohamed Mosbah",ETGuard: Detecting D2D Attacks using Wireless Evil Twins,"44 pages. Computers and Security, 2019",,10.1016/j.cose.2019.02.014,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we demonstrate a realistic variant of wireless Evil Twins
(ETs) for launching device to device (D2D) attacks over the network,
particularly for Android. We show an attack where an ET infects an Android
device before the relay of network traffic through it, and disappears from the
network immediately after inflicting the device. The attack leverages the
captive portal facility of wireless networks to launch D2D attack. We configure
an ET to launch a malicious component of an already installed app in the device
on submission of the portal page. In this paper, we present an online,
incremental, automated, fingerprinting based pre-association detection
mechanism named as ETGuard which works as a client-server mechanism in
real-time. The fingerprints are constructed from the beacon frames transmitted
by the wireless APs periodically to inform client devices of their presence and
capabilities in a network. Once detected, ETGuard continuously transmits
deauthentication frames to prevent clients from connecting to an ET. ETGuard
outperforms the existing state-of-the-art techniques from various perspectives.
Our technique does not require any expensive hardware, does not modify any
protocols, does not rely on any network specific parameters such as Round Trip
Time (RTT), number of hops, etc., can be deployed in a real network, is
incremental, and operates passively to detect ETs in real-time. To evaluate the
efficiency, we deploy ETGuard in 802.11a/b/g wireless networks. The experiments
are conducted using 12 different attack scenarios where each scenario differs
in the source used for introducing an ET. ETGuard effectively detects ETs
introduced either through a hardware, software, or mobile hotspot with high
accuracy, only one false positive scenario, and no false negatives.
","[{'version': 'v1', 'created': 'Thu, 14 Mar 2019 07:51:49 GMT'}]",2020-08-10,"[['Jain', 'Vineeta', ''], ['Laxmi', 'Vijay', ''], ['Gaur', 'Manoj Singh', ''], ['Mosbah', 'Mohamed', '']]","['Evil Twin', 'D2D Attack', 'Captive Portal', 'Android']"
7332,2005.06292,Viktorija Paneva,"Viktorija Paneva, Sofia Seinfeld, Michael Kraiczi and J\""org M\""uller",HaptiRead: Reading Braille as Mid-Air Haptic Information,"8 pages, 8 figures, 2 tables, DIS'20","Proceedings of the 2020 on Designing Interactive Systems
  Conference (2020)",10.1145/3357236.3395515,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mid-air haptic interfaces have several advantages - the haptic information is
delivered directly to the user, in a manner that is unobtrusive to the
immediate environment. They operate at a distance, thus easier to discover;
they are more hygienic and allow interaction in 3D. We validate, for the first
time, in a preliminary study with sighted and a user study with blind
participants, the use of mid-air haptics for conveying Braille. We tested three
haptic stimulation methods, where the haptic feedback was either: a) aligned
temporally, with haptic stimulation points presented simultaneously (Constant);
b) not aligned temporally, presenting each point independently
(Point-By-Point); or c) a combination of the previous methodologies, where
feedback was presented Row-by-Row. The results show that mid-air haptics is a
viable technology for presenting Braille characters, and the highest average
accuracy (94% in the preliminary and 88% in the user study) was achieved with
the Point-by-Point method.
","[{'version': 'v1', 'created': 'Wed, 13 May 2020 12:52:56 GMT'}]",2020-05-14,"[['Paneva', 'Viktorija', ''], ['Seinfeld', 'Sofia', ''], ['Kraiczi', 'Michael', ''], ['Müller', 'Jörg', '']]","['Mid-air Haptics', 'Ultrasound', 'Haptic Feedback', 'PublicDisplays', 'Braille', 'Reading by Blind People']"
7333,2204.01968,Soumik Mohian,"Soumik Mohian, Christoph Csallner",PSDoodle: Searching for App Screens via Interactive Sketching,arXiv admin note: text overlap with arXiv:2204.01956,,10.1145/3524613.3527807,,cs.CV cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Keyword-based mobile screen search does not account for screen content and
fails to operate as a universal tool for all levels of users. Visual searching
(e.g., image, sketch) is structured and easy to adopt. Current visual search
approaches count on a complete screen and are therefore slow and tedious.
PSDoodle employs a deep neural network to recognize partial screen element
drawings instantly on a digital drawing interface and shows results in
real-time. PSDoodle is the first tool that utilizes partial sketches and
searches for screens in an interactive iterative way. PSDoodle supports
different drawing styles and retrieves search results that are relevant to the
user's sketch query. A short video demonstration is available online at:
https://youtu.be/3cVLHFm5pY4
","[{'version': 'v1', 'created': 'Tue, 5 Apr 2022 03:46:48 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Apr 2022 18:53:24 GMT'}]",2023-01-18,"[['Mohian', 'Soumik', ''], ['Csallner', 'Christoph', '']]","['Sketch-based image retrieval', 'SBIR', 'user interface design', 'sketching', 'GUI', 'design examples', 'deep learning']"
7334,1812.08506,Giovanni Abramo,"Giovanni Abramo, Ciriaco Andrea D'Angelo, Fabio Pugini","The measurement of italian universities' research productivity by a non
  parametric-bibliometric methodology",,"Abramo, G., D'Angelo, C.A., Pugini, F. (2008). The measurement of
  Italian universities' research productivity by a non parametric-bibliometric
  methodology. Scientometrics, 76(2), 225-244",10.1007/s11192-007-1942-2,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a methodology for measuring the technical efficiency of
research activities. It is based on the application of data envelopment
analysis to bibliometric data on the Italian university system. For that
purpose, different input values (research personnel by level and extra funding)
and output values (quantity, quality and level of contribution to actual
scientific publications) are considered. Our study aims at overcoming some of
the limitations connected to the methodologies that have so far been proposed
in the literature, in particular by surveying the scientific production of
universities by authors' name.
","[{'version': 'v1', 'created': 'Thu, 20 Dec 2018 12:03:44 GMT'}]",2018-12-21,"[['Abramo', 'Giovanni', ''], [""D'Angelo"", 'Ciriaco Andrea', ''], ['Pugini', 'Fabio', '']]","['Research evaluation', 'bibliometrics', 'DEA', 'universities', 'Italy']"
7335,1911.04395,Daria Trinitatova,Daria Trinitatova and Dzmitry Tsetserukou,"TouchVR: a Wearable Haptic Interface for VR Aimed at Delivering
  Multi-modal Stimuli at the User's Palm","2 pages, Accepted to SIGGRAPH Asia 2019 XR",,10.1145/3355355.3361896,,cs.RO cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  TouchVR is a novel wearable haptic interface which can deliver multimodal
tactile stimuli on the palm by DeltaTouch haptic display and vibrotactile
feedback on the fingertips by vibration motors for the Virtual Reality (VR)
user. DeltaTouch display is capable of generating 3D force vector at the
contact point and presenting multimodal tactile sensation of weight, slippage,
encounter, softness, and texture. The VR system consists of HTC Vive Pro base
stations and head-mounted display (HMD), and Leap Motion controller for
tracking the user's hands motion in VR. The MatrixTouch, BallFeel, and RoboX
applications have been developed to demonstrate the capabilities of the
proposed technology. A novel haptic interface can potentially bring a new level
of immersion of the user in VR and make it more interactive and tangible.
","[{'version': 'v1', 'created': 'Mon, 11 Nov 2019 17:06:18 GMT'}]",2019-11-12,"[['Trinitatova', 'Daria', ''], ['Tsetserukou', 'Dzmitry', '']]","['Haptic Device', 'Tactile Display', 'Inverted Delta Robot', 'Multimodalstimuli', 'Virtual Reality']"
7336,2107.11441,Jimmy Moore,Jimmy Moore and Pascal Goffin and Jason Wiese and Miriah Meyer,An interview method for engaging personal data,"22 pages, 3 figures, submitted to The Proceedings of the ACM on
  Interactive, Mobile, Wearable and Ubiquitous Technologies (IMWUT) December
  2021",,10.1145/3494964,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Whether investigating research questions or designing systems, many
researchers and designers need to engage users with their personal data.
However, it is difficult to successfully design user-facing tools for
interacting with personal data without first understanding what users want to
do with their data. Techniques for raw data exploration, sketching, or
physicalization can avoid the perils of tool development, but prevent direct
analytical access to users' rich personal data. We present a new method that
directly tackles this challenge: the data engagement interview. This interview
method incorporates an analyst to provide real-time personal data analysis,
granting interview participants the opportunity to directly engage with their
data, and interviewers to observe and ask questions throughout this engagement.
We describe the method's development through a case study with asthmatic
participants, share insights and guidance from our experience, and report a
broad set of insights from these interviews.
","[{'version': 'v1', 'created': 'Fri, 23 Jul 2021 19:52:51 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Aug 2021 16:59:37 GMT'}, {'version': 'v3', 'created': 'Thu, 4 Nov 2021 21:11:49 GMT'}]",2021-11-08,"[['Moore', 'Jimmy', ''], ['Goffin', 'Pascal', ''], ['Wiese', 'Jason', ''], ['Meyer', 'Miriah', '']]","['Personal data', 'Personal informatics', 'Interview methods', 'Qualitative methods']"
7337,2101.00781,Liang Yile,"Yile Liang, Tieyun Qian",Recommending Accurate and Diverse Items Using Bilateral Branch Network,"12 pages, 7 figures",,10.1145/3404835.3462957,accepted by SIGIR 2021,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Recommender systems have played a vital role in online platforms due to the
ability of incorporating users' personal tastes. Beyond accuracy, diversity has
been recognized as a key factor in recommendation to broaden user's horizons as
well as to promote enterprises' sales. However, the trading-off between
accuracy and diversity remains to be a big challenge, and the data and user
biases have not been explored yet.
  In this paper, we develop an adaptive learning framework for accurate and
diversified recommendation. We generalize recent proposed bi-lateral branch
network in the computer vision community from image classification to item
recommendation. Specifically, we encode domain level diversity by adaptively
balancing accurate recommendation in the conventional branch and diversified
recommendation in the adaptive branch of a bilateral branch network. We also
capture user level diversity using a two-way adaptive metric learning backbone
network in each branch. We conduct extensive experiments on three real-world
datasets. Results demonstrate that our proposed approach consistently
outperforms the state-of-the-art baselines.
","[{'version': 'v1', 'created': 'Mon, 4 Jan 2021 05:39:53 GMT'}]",2022-10-11,"[['Liang', 'Yile', ''], ['Qian', 'Tieyun', '']]","['recommender systems', 'accurate and diversified recommendation', 'metric learning', 'bilateral branch network']"
7338,2112.08068,Surbhi Madan,"Surbhi Madan, Monika Gahalawat, Tanaya Guha and Ramanathan Subramanian","Head Matters: Explainable Human-centered Trait Prediction from Head
  Motion Dynamics","10 pages, 10 figures, 6 tables. This paper is published in ICMI 2021",,10.1145/3462244.3479901,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  We demonstrate the utility of elementary head-motion units termed kinemes for
behavioral analytics to predict personality and interview traits. Transforming
head-motion patterns into a sequence of kinemes facilitates discovery of latent
temporal signatures characterizing the targeted traits, thereby enabling both
efficient and explainable trait prediction. Utilizing Kinemes and Facial Action
Coding System (FACS) features to predict (a) OCEAN personality traits on the
First Impressions Candidate Screening videos, and (b) Interview traits on the
MIT dataset, we note that: (1) A Long-Short Term Memory (LSTM) network trained
with kineme sequences performs better than or similar to a Convolutional Neural
Network (CNN) trained with facial images; (2) Accurate predictions and
explanations are achieved on combining FACS action units (AUs) with kinemes,
and (3) Prediction performance is affected by the time-length over which head
and facial movements are observed.
","[{'version': 'v1', 'created': 'Wed, 15 Dec 2021 12:17:59 GMT'}]",2021-12-16,"[['Madan', 'Surbhi', ''], ['Gahalawat', 'Monika', ''], ['Guha', 'Tanaya', ''], ['Subramanian', 'Ramanathan', '']]","['Kinemes', 'Head-motion Units', 'Action Units', 'Behavioral Analytics', 'Explainable Prediction', 'Personality', 'Interview Traits']"
7339,1805.03380,Conrad Sanderson,"Conrad Sanderson, Ryan Curtin",A User-Friendly Hybrid Sparse Matrix Class in C++,,"Lecture Notes in Computer Science (LNCS), Vol. 10931, pp. 422-430,
  2018",10.1007/978-3-319-96418-8_50,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When implementing functionality which requires sparse matrices, there are
numerous storage formats to choose from, each with advantages and
disadvantages. To achieve good performance, several formats may need to be used
in one program, requiring explicit selection and conversion between the
formats. This can be both tedious and error-prone, especially for non-expert
users. Motivated by this issue, we present a user-friendly sparse matrix class
for the C++ language, with a high-level application programming interface
deliberately similar to the widely used MATLAB language. The class internally
uses two main approaches to achieve efficient execution: (i) a hybrid storage
framework, which automatically and seamlessly switches between three underlying
storage formats (compressed sparse column, coordinate list, Red-Black tree)
depending on which format is best suited for specific operations, and (ii)
template-based meta-programming to automatically detect and optimise execution
of common expression patterns. To facilitate relatively quick conversion of
research code into production environments, the class and its associated
functions provide a suite of essential sparse linear algebra functionality
(eg., arithmetic operations, submatrix manipulation) as well as high-level
functions for sparse eigendecompositions and linear equation solvers. The
latter are achieved by providing easy-to-use abstractions of the low-level
ARPACK and SuperLU libraries. The source code is open and provided under the
permissive Apache 2.0 license, allowing unencumbered use in commercial
products.
","[{'version': 'v1', 'created': 'Wed, 9 May 2018 05:49:05 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Jul 2018 03:43:22 GMT'}, {'version': 'v3', 'created': 'Mon, 21 Oct 2019 08:27:42 GMT'}]",2019-10-22,"[['Sanderson', 'Conrad', ''], ['Curtin', 'Ryan', '']]","['numerical linear algebra', 'sparse matrix', 'C++ language']"
7340,1904.09865,Richard Linares,"Brian Gaudet, Richard Linares, Roberto Furfaro","Adaptive Guidance and Integrated Navigation with Reinforcement
  Meta-Learning",arXiv admin note: substantial text overlap with arXiv:1901.04473,,10.1016/j.actaastro.2020.01.007,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a novel adaptive guidance system developed using
reinforcement meta-learning with a recurrent policy and value function
approximator. The use of recurrent network layers allows the deployed policy to
adapt real time to environmental forces acting on the agent. We compare the
performance of the DR/DV guidance law, an RL agent with a non-recurrent policy,
and an RL agent with a recurrent policy in four challenging environments with
unknown but highly variable dynamics. These tasks include a safe Mars landing
with random engine failure and a landing on an asteroid with unknown
environmental dynamics. We also demonstrate the ability of a RL meta-learning
optimized policy to implement a guidance law using observations consisting of
only Doppler radar altimeter readings in a Mars landing environment, and LIDAR
altimeter readings in an asteroid landing environment, thus integrating
guidance and navigation.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2019 20:58:23 GMT'}]",2020-02-19,"[['Gaudet', 'Brian', ''], ['Linares', 'Richard', ''], ['Furfaro', 'Roberto', '']]","['Guidance', 'Meta Learning', 'Reinforcement Learning', 'LandingGuidance']"
7341,1804.00256,Jiaxin Gu,"Baochang Zhang, Jiaxin Gu, Chen Chen, Jungong Han, Xiangbo Su, Xianbin
  Cao, Jianzhuang Liu","One-Two-One Networks for Compression Artifacts Reduction in Remote
  Sensing",,,10.1016/j.isprsjprs.2018.01.003,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Compression artifacts reduction (CAR) is a challenging problem in the field
of remote sensing. Most recent deep learning based methods have demonstrated
superior performance over the previous hand-crafted methods. In this paper, we
propose an end-to-end one-two-one (OTO) network, to combine different deep
models, i.e., summation and difference models, to solve the CAR problem.
Particularly, the difference model motivated by the Laplacian pyramid is
designed to obtain the high frequency information, while the summation model
aggregates the low frequency information. We provide an in-depth investigation
into our OTO architecture based on the Taylor expansion, which shows that these
two kinds of information can be fused in a nonlinear scheme to gain more
capacity of handling complicated image compression artifacts, especially the
blocking effect in compression. Extensive experiments are conducted to
demonstrate the superior performance of the OTO networks, as compared to the
state-of-the-arts on remote sensing datasets and other benchmark datasets.
","[{'version': 'v1', 'created': 'Sun, 1 Apr 2018 04:44:13 GMT'}]",2018-04-03,"[['Zhang', 'Baochang', ''], ['Gu', 'Jiaxin', ''], ['Chen', 'Chen', ''], ['Han', 'Jungong', ''], ['Su', 'Xiangbo', ''], ['Cao', 'Xianbin', ''], ['Liu', 'Jianzhuang', '']]","['Compression Artifacts Reduction', 'Remote Sensing', 'Deep Learning', 'One-Two-One']"
7342,2212.14117,Ismail Jabri,"Jabri Ismail, Aboulbichr Ahmed and El ouaazizi Aziza","Improving a sequence-to-sequence nlp model using a reinforcement
  learning policy algorithm","Published in Proceedings of Artificial Intelligence, Soft Computing
  and Applications 12th International Conference on Artificial Intelligence,
  Soft Computing and Applications (AIAA 2022) December 22 ~ 24, 2022, Sydney,
  Australia Volume Editors : David C. Wyld, Dhinaharan Nagamalai (Eds) ISBN :
  978-1-925953-83-1","CS & IT - CSCP 2022 pp. 221-231, 2022",10.5121/csit.2022.122317,,cs.CL cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Nowadays, the current neural network models of dialogue generation(chatbots)
show great promise for generating answers for chatty agents. But they are
short-sighted in that they predict utterances one at a time while disregarding
their impact on future outcomes. Modelling a dialogue's future direction is
critical for generating coherent, interesting dialogues, a need that has led
traditional NLP dialogue models that rely on reinforcement learning. In this
article, we explain how to combine these objectives by using deep reinforcement
learning to predict future rewards in chatbot dialogue. The model simulates
conversations between two virtual agents, with policy gradient methods used to
reward sequences that exhibit three useful conversational characteristics: the
flow of informality, coherence, and simplicity of response (related to
forward-looking function). We assess our model based on its diversity, length,
and complexity with regard to humans. In dialogue simulation, evaluations
demonstrated that the proposed model generates more interactive responses and
encourages a more sustained successful conversation. This work commemorates a
preliminary step toward developing a neural conversational model based on the
long-term success of dialogues.
","[{'version': 'v1', 'created': 'Wed, 28 Dec 2022 22:46:57 GMT'}]",2023-01-19,"[['Ismail', 'Jabri', ''], ['Ahmed', 'Aboulbichr', ''], ['Aziza', 'El ouaazizi', '']]","['Reinforcement learning', 'SEQ2SEQ model', 'Chatbot', 'NLP', 'Conversational agent']"
7343,1712.00316,Dariusz Dereniowski,"Dariusz Dereniowski, Andrzej Lingas, Dorota Osula, Mia Persson, Pawel
  Zylinski",The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents),"An extended abstract published in: Dariusz Dereniowski, Andrzej
  Lingas, Mia Persson, Dorota Urbanska, Pawel Zylinski, The Snow Team Problem -
  (Clearing Directed Subgraphs by Mobile Agents). FCT 2017: 190-203",Journal of Computer and System Sciences 102: 57-68 (2019),10.1016/j.jcss.2018.11.002,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study several problems of clearing subgraphs by mobile agents in digraphs.
The agents can move only along directed walks of a digraph and, depending on
the variant, their initial positions may be pre-specified. In general, for a
given subset~$\mathcal{S}$ of vertices of a digraph $D$ and a positive integer
$k$, the objective is to determine whether there is a subgraph
$H=(\mathcal{V}_H,\mathcal{A}_H)$ of $D$ such that (a) $\mathcal{S} \subseteq
\mathcal{V}_H$, (b) $H$ is the union of $k$ directed walks in $D$, and (c) the
underlying graph of $H$ includes a Steiner tree for $\mathcal{S}$ in $D$. We
provide several results on the polynomial time tractability, hardness, and
parameterized complexity of the problem.
","[{'version': 'v1', 'created': 'Fri, 1 Dec 2017 13:45:26 GMT'}]",2021-01-19,"[['Dereniowski', 'Dariusz', ''], ['Lingas', 'Andrzej', ''], ['Osula', 'Dorota', ''], ['Persson', 'Mia', ''], ['Zylinski', 'Pawel', '']]","['graph searching', 'FPT-algorithm', 'NP-hardness', 'monomial']"
7344,1909.12279,Ezra Zigmond,"Ezra Zigmond (Harvard University, United States), Stephen Chong
  (Harvard University, United States), Christos Dimoulas (Northwestern
  University, United States), Scott Moore (Galois, Inc, United States)","Fine-Grained, Language-Based Access Control for Database-Backed
  Applications",,"The Art, Science, and Engineering of Programming, 2020, Vol. 4,
  Issue 2, Article 3",10.22152/programming-journal.org/2020/4/3,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Database-backed applications often run queries with more authority
than necessary. Since programs can access more data than they legitimately
need, flaws in security checks at the application level can enable malicious or
buggy code to view or modify data in violation of intended access control
policies.
  Inquiry: Although database management systems provide tools to control access
to data, these tools are not well-suited for modern applications which often
have many users and consist of many different software components. First,
databases are unaware of application users, and creating a new database user
for each application user is impractical for applications with many users.
Second, different components of the same application may require different
authority, which would require creating different database users for different
software components. Thus, it is difficult to use existing tools to properly
limit the authority an application has when executing queries. For this reason,
we consider a new, language-based approach to application-specific database
security.
  Approach: Prior work has addressed the difficulty of running applications
with least privilege using capability-based security and software contracts,
which we adapt to the setting of database-backed applications.
  Knowledge: This paper's main contribution is the design and implementation of
ShillDB, a language for writing secure database-backed applications. ShillDB
enables reasoning about database access at the language level through
capabilities, which limit which database tables a program can access, and
contracts, which limit what operations a program can perform on those tables.
ShillDB contracts are expressed as part of function interfaces, making it easy
to specify different access control policies for different components.
Contracts act as executable security documentation for ShillDB programs and are
enforced by the language runtime. Further, ShillDB provides database access
control guarantees independent of (and in addition to) the security mechanisms
of the underlying database management system.
  Grounding: We have implemented a prototype of ShillDB and have used it to
implement the backend for a lending library reservation system with contracts
for each endpoint to evaluate the performance and usability of ShillDB.
Further, we benchmark individual database operations in ShillDB to better
understand the language's performance overhead.
  Importance: Our experience indicates that ShillDB is a practical language for
enforcing database access control policies in realistic, multi-user
applications and has reasonable performance overhead. ShillDB allows developers
to reason about security at the component level, safely compose components, and
reuse third-party components with their own application-specific database
security policies.
","[{'version': 'v1', 'created': 'Thu, 26 Sep 2019 17:37:23 GMT'}]",2019-09-27,"[['Zigmond', 'Ezra', '', 'Harvard University, United States'], ['Chong', 'Stephen', '', 'Harvard University, United States'], ['Dimoulas', 'Christos', '', 'Northwestern\n  University, United States'], ['Moore', 'Scott', '', 'Galois, Inc, United States']]","['contracts', 'capabilities', 'language-based security']"
7345,2110.01098,Michael Coblenz,"Michael Coblenz, Michelle Mazurek, Michael Hicks","Garbage Collection Makes Rust Easier to Use: A Randomized Controlled
  Trial of the Bronze Garbage Collector","Michael Coblenz, Michelle L. Mazurek, and Michael Hicks. 2022.
  Garbage Collection Makes Rust Easier to Use: A Randomized Controlled Trial of
  the Bronze Garbage Collector. In 44th International Conference on Software
  Engineering (ICSE '22), May 21-29, 2022, Pittsburgh, PA, USA. ACM, New York,
  NY, USA, 12 pages. https://doi.org/10.1145/3510003.3510107",,10.1145/3510003.3510107,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rust is a general-purpose programming language that is both type- and
memory-safe. Rust does not use a garbage collector, but rather achieves these
properties through a sophisticated, but complex, type system. Doing so makes
Rust very efficient, but makes Rust relatively hard to learn and use. We
designed Bronze, an optional, library-based garbage collector for Rust. To see
whether Bronze could make Rust more usable, we conducted a randomized
controlled trial with volunteers from a 633-person class, collecting data from
428 students in total. We found that for a task that required managing complex
aliasing, Bronze users were more likely to complete the task in the time
available, and those who did so required only about a third as much time (4
hours vs. 12 hours). We found no significant difference in total time, even
though Bronze users re-did the task without Bronze afterward. Surveys indicated
that ownership, borrowing, and lifetimes were primary causes of the challenges
that users faced when using Rust.
","[{'version': 'v1', 'created': 'Sun, 3 Oct 2021 20:26:24 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Feb 2022 14:55:41 GMT'}]",2022-02-16,"[['Coblenz', 'Michael', ''], ['Mazurek', 'Michelle', ''], ['Hicks', 'Michael', '']]","['Rust', 'garbage collection', 'usability of programming languages', 'empirical study of programming languages', 'programming education']"
7346,2004.12141,Ayrat Khalimov,"L\'eo Exibard, Emmanuel Filiot, Ayrat Khalimov",Church Synthesis on Register Automata over Linearly Ordered Data Domains,v5: added the proof of Thm8. Small fixes,,10.4230/LIPIcs.STACS.2021.54,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Register automata are finite automata equipped with a finite set of registers
in which they can store data, i.e. elements from an unbounded or infinite
alphabet. They provide a simple formalism to specify the behaviour of reactive
systems operating over data {\omega}-words. We study the synthesis problem for
specifications given as register automata over a linearly ordered data domain
(e.g. (N, {\leq}) or (Q, {\leq})), which allow for comparison of data with
regards to the linear order. To that end, we extend the classical Church
synthesis game to infinite alphabets: two players, Adam and Eve, alternately
play some data, and Eve wins whenever their interaction complies with the
specification, which is a language of {\omega}-words over ordered data. Such
games are however undecidable, even when the specification is recognised by a
deterministic register automaton. This is in contrast with the equality case,
where the problem is only undecidable for nondeterministic and universal
specifications. Thus, we study one-sided Church games, where Eve instead
operates over a finite alphabet, while Adam still manipulates data. We show
they are determined, and deciding the existence of a winning strategy is in
ExpTime, both for Q and N. This follows from a study of constraint sequences,
which abstract the behaviour of register automata, and allow us to reduce
Church games to {\omega}-regular games. Lastly, we apply these results to the
transducer synthesis problem for input-driven register automata, where each
output data is restricted to be the content of some register, and show that if
there exists an implementation, then there exists one which is a register
transducer.
","[{'version': 'v1', 'created': 'Sat, 25 Apr 2020 13:23:47 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Jan 2021 13:31:02 GMT'}, {'version': 'v3', 'created': 'Fri, 15 Jan 2021 20:26:47 GMT'}, {'version': 'v4', 'created': 'Mon, 12 Apr 2021 18:55:27 GMT'}, {'version': 'v5', 'created': 'Wed, 6 Oct 2021 06:16:00 GMT'}]",2021-10-07,"[['Exibard', 'Léo', ''], ['Filiot', 'Emmanuel', ''], ['Khalimov', 'Ayrat', '']]","['Synthesis', 'Church Game', 'Register Automata', 'Transducers', 'Ordered DataWords']"
7347,2206.14606,Ludovic Court\`es,"Ludovic Court\`es (Inria, France)",Building a Secure Software Supply Chain with GNU Guix,,"The Art, Science, and Engineering of Programming, 2023, Vol. 7,
  Issue 1, Article 1",10.22152/programming-journal.org/2023/7/1,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The software supply chain is becoming a widespread analogy to designate the
series of steps taken to go from source code published by developers to
executables running on the users? computers. A security vulnerability in any of
these steps puts users at risk, and evidence shows that attacks on the supply
chain are becoming more common. The consequences of an attack on the software
supply chain can be tragic in a society that relies on many interconnected
software systems, and this has led research interest as well as governmental
incentives for supply chain security to rise.
  GNU Guix is a software deployment tool and software distribution that
supports provenance tracking, reproducible builds, and reproducible software
environments. Unlike many software distributions, it consists exclusively of
source code: it provides a set of package definitions that describe how to
build code from source. Together, these properties set it apart from many
deployment tools that center on the distribution of binaries.
  This paper focuses on one research question: how can Guix and similar systems
allow users to securely update their software? Guix source code is distributed
using the Git version control system; updating Guix-installed software packages
means, first, updating the local copy of the Guix source code. Prior work on
secure software updates focuses on systems very different from Guix -- systems
such as Debian, Fedora, or PyPI where updating consists in fetching metadata
about the latest binary artifacts available -- and is largely inapplicable in
the context of Guix. By contrast, the main threats for Guix are attacks on its
source code repository, which could lead users to run inauthentic code or to
downgrade their system. Deployment tools that more closely resemble Guix, from
Nix to Portage, either lack secure update mechanisms or suffer from
shortcomings.
  Our main contribution is a model and tool to authenticate new Git revisions.
We further show how, building on Git semantics, we build protections against
downgrade attacks and related threats. We explain implementation choices. This
work has been deployed in production two years ago, giving us insight on its
actual use at scale every day. The Git checkout authentication at its core is
applicable beyond the specific use case of Guix, and we think it could benefit
to developer teams that use Git.
  As attacks on the software supply chain appear, security research is now
looking at every link of the supply chain. Secure updates are one important
aspect of the supply chain, but this paper also looks at the broader context:
how Guix models and implements the supply chain, from upstream source code to
binaries running on computers. While much recent work focuses on attestation --
certifying each link of the supply chain -- Guix takes a more radical approach:
enabling independent verification of each step, building on reproducible
builds, ""bootstrappable"" builds, and provenance tracking. The big picture shows
how Guix can be used as the foundation of secure software supply chains.
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2022 08:53:21 GMT'}]",2022-06-30,"[['Courtès', 'Ludovic', '', 'Inria, France']]","['software deployment', 'security', 'version control', 'Git']"
7348,1907.02209,Osman Duman,"Handan Cam, Osman Duman","Earthquake Prediction With Artificial Neural Network Method: The
  Application Of West Anatolian Fault In Turkey",,"GUEJISS, Gumushane University Electronic Journal of The Institute
  of Social Sciences Volume: 7, Number: 17, Year: 2016",10.17823/gusb.352,,cs.OH cs.LG eess.SP,http://creativecommons.org/licenses/by/4.0/,"  A method that exactly knows the earthquakes beforehand and can generalize
them cannot still been developed. However, earthquakes are tried to be
predicted through numerous methods. One of these methods, artificial neural
networks give appropriate outputs to different patterns by learning the
relationship between the determined inputs and outputs. In this study, a
feedforward back propagation artificial neural network that is connected to
Gutenberg-Richter relationship and that bases on b value used in earthquake
predictions was developed. The artificial neural network was trained employing
earthquake data belonging to four different regions which have intensive
seismic activity in the west of Turkey. After the training process, the
earthquake data belonging to later dates of the same regions were used for
testing and the performance of the network was put forward. When the prediction
results of the developed network are examined, the prediction results that the
network predicts that an earthquake is not going to occur are quite high in all
regions. Furthermore, the earthquake prediction results that the network
predicts that an earthquake is going to occur are different to some extent for
the studied regions.
","[{'version': 'v1', 'created': 'Sun, 26 May 2019 13:54:13 GMT'}]",2019-07-05,"[['Cam', 'Handan', ''], ['Duman', 'Osman', '']]","['Earthquake Prediction', 'Artifical Neural Networks', 'Feed Forward Back Propagation ANN']"
7349,2111.02276,Diancheng Li,"Diancheng Li, Dongliang Fan, Renjie Zhu, Qiaozhi Lei, Yuxuan Liao, Xin
  Yang, Yang Pan, Zheng Wang, Yang Wu, Sicong Liu, Hongqiang Wang",Origami-inspired soft twisting actuator,9 figures. Soft Robotics (2022),,10.1089/soro.2021.0185,,cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Soft actuators have shown great advantages in compliance and morphology
matched for manipulation of delicate objects and inspection in a confined
space. There is an unmet need for a soft actuator that can provide torsional
motion to e.g. enlarge working space and increase degrees of freedom. Towards
this goal, we present origami-inspired soft pneumatic actuators (OSPAs) made
from silicone. The prototype can output a rotation of more than one revolution
(up to 435{\deg}), more significant than its counterparts. Its rotation ratio
(=rotation angle/ aspect ratio) is more than 136{\deg}, about twice the largest
one in other literature. We describe the design and fabrication method, build
the analytical model and simulation model, and analyze and optimize the
parameters. Finally, we demonstrate the potentially extensive utility of the
OSPAs through their integration into a gripper capable of simultaneously
grasping and lifting fragile or flat objects, a versatile robot arm capable of
picking and placing items at the right angle with the twisting actuators, and a
soft snake robot capable of changing attitude and directions by torsion of the
twisting actuators.
","[{'version': 'v1', 'created': 'Wed, 3 Nov 2021 15:13:27 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Nov 2022 15:11:18 GMT'}]",2022-11-03,"[['Li', 'Diancheng', ''], ['Fan', 'Dongliang', ''], ['Zhu', 'Renjie', ''], ['Lei', 'Qiaozhi', ''], ['Liao', 'Yuxuan', ''], ['Yang', 'Xin', ''], ['Pan', 'Yang', ''], ['Wang', 'Zheng', ''], ['Wu', 'Yang', ''], ['Liu', 'Sicong', ''], ['Wang', 'Hongqiang', '']]","['Actuator', 'soft robot', 'twisting actuator', 'origami-inspired actuator']"
7350,2007.00737,Robert Leishman,"Kyung Kim, Robert C. Leishman, and Scott L. Nykl","Virtual Testbed for Monocular Visual Navigation of Small Unmanned
  Aircraft Systems",,"The Journal of Defense Modeling and Simulation: Applications,
  Methodology, Technology 2020",10.1177/1548512920954545,,cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Monocular visual navigation methods have seen significant advances in the
last decade, recently producing several real-time solutions for autonomously
navigating small unmanned aircraft systems without relying on GPS. This is
critical for military operations which may involve environments where GPS
signals are degraded or denied. However, testing and comparing visual
navigation algorithms remains a challenge since visual data is expensive to
gather. Conducting flight tests in a virtual environment is an attractive
solution prior to committing to outdoor testing.
  This work presents a virtual testbed for conducting simulated flight tests
over real-world terrain and analyzing the real-time performance of visual
navigation algorithms at 31 Hz. This tool was created to ultimately find a
visual odometry algorithm appropriate for further GPS-denied navigation
research on fixed-wing aircraft, even though all of the algorithms were
designed for other modalities. This testbed was used to evaluate three current
state-of-the-art, open-source monocular visual odometry algorithms on a
fixed-wing platform: Direct Sparse Odometry, Semi-Direct Visual Odometry, and
ORB-SLAM2 (with loop closures disabled).
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2020 20:35:26 GMT'}]",2020-09-24,"[['Kim', 'Kyung', ''], ['Leishman', 'Robert C.', ''], ['Nykl', 'Scott L.', '']]","['Monocular visual navigation', 'VO', 'Simulation', 'Virtual Testbed', 'SUAS']"
7351,2206.10811,Ting Zhang,"Ting Zhang, Ivana Clairine Irsan, Ferdian Thung, DongGyun Han, David
  Lo, Lingxiao Jiang",iTiger: An Automatic Issue Title Generation Tool,Accepted by the ESEC/FSE 2022 Demonstrations Track,,10.1145/3540250.3558934,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In both commercial and open-source software, bug reports or issues are used
to track bugs or feature requests. However, the quality of issues can differ a
lot. Prior research has found that bug reports with good quality tend to gain
more attention than the ones with poor quality. As an essential component of an
issue, title quality is an important aspect of issue quality. Moreover, issues
are usually presented in a list view, where only the issue title and some
metadata are present. In this case, a concise and accurate title is crucial for
readers to grasp the general concept of the issue and facilitate the issue
triaging. Previous work formulated the issue title generation task as a
one-sentence summarization task. A sequence-to-sequence model was employed to
solve this task. However, it requires a large amount of domain-specific
training data to attain good performance in issue title generation. Recently,
pre-trained models, which learned knowledge from large-scale general corpora,
have shown much success in software engineering tasks.
  In this work, we make the first attempt to fine-tune BART, which has been
pre-trained using English corpora, to generate issue titles. We implemented the
fine-tuned BART as a web tool named iTiger, which can suggest an issue title
based on the issue description. iTiger is fine-tuned on 267,094 GitHub issues.
We compared iTiger with the state-of-the-art method, i.e., iTAPE, on 33,438
issues. The automatic evaluation shows that iTiger outperforms iTAPE by 29.7%,
50.8%, and 34.1%, in terms of ROUGE-1, ROUGE-2, ROUGE-L F1-scores. The manual
evaluation also demonstrates the titles generated by BART are preferred by
evaluators over the titles generated by iTAPE in 72.7% of cases. Besides, the
evaluators deem our tool as useful and easy-to-use. They are also interested to
use our tool in the future.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2022 02:22:02 GMT'}, {'version': 'v2', 'created': 'Wed, 31 Aug 2022 07:48:07 GMT'}]",2022-09-01,"[['Zhang', 'Ting', ''], ['Irsan', 'Ivana Clairine', ''], ['Thung', 'Ferdian', ''], ['Han', 'DongGyun', ''], ['Lo', 'David', ''], ['Jiang', 'Lingxiao', '']]","['issues', 'bug reports', 'title generation', 'pre-trained models']"
7352,2006.04911,Ali Ghanbari,Ali Ghanbari,ObjSim: Lightweight Automatic Patch Prioritization via Object Similarity,"Proceedings of the 29th ACM SIGSOFT International Symposium on
  Software Testing and Analysis (ISSTA '20), July 18--22, 2020, Virtual Event,
  USA",,10.1145/3395363.3404362,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the context of test case based automatic program repair (APR), patches
that pass all the test cases but fail to fix the bug are called overfitted
patches. Currently, patches generated by APR tools get inspected manually by
the users to find and adopt genuine fixes. Being a laborious activity hindering
widespread adoption of APR, automatic identification of overfitted patches has
lately been the topic of active research. This paper presents engineering
details of ObjSim: a fully automatic, lightweight similarity-based patch
prioritization tool for JVM-based languages. The tool works by comparing the
system state at the exit point(s) of patched method before and after patching
and prioritizing patches that result in state that is more similar to that of
original, unpatched version on passing tests while less similar on failing
ones. Our experiments with patches generated by the recent APR tool PraPR for
fixable bugs from Defects4J v1.4.0 show that ObjSim prioritizes 16.67% more
genuine fixes in top-1 place. A demo video of the tool is located at
https://bit.ly/2K8gnYV.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2020 19:58:58 GMT'}]",2020-06-11,"[['Ghanbari', 'Ali', '']]","['Automatic Program Repair', 'Patch Prioritization', 'Object Similarity', 'Test Case']"
7353,2101.03850,Antoine Garcon AntoineGarcon,"Antoine Garcon, Julian Vexler, Dmitry Budker, Stefan Kramer","Deep Neural Networks to Recover Unknown Physical Parameters from
  Oscillating Time Series",,,10.1371/journal.pone.0268439,,cs.LG cs.NA math.NA physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks (DNNs) are widely used in pattern-recognition tasks for
which a human comprehensible, quantitative description of the data-generating
process, e.g., in the form of equations, cannot be achieved. While doing so,
DNNs often produce an abstract (entangled and non-interpretable) representation
of the data-generating process. This is one of the reasons why DNNs are not
extensively used in physics-signal processing: physicists generally require
their analyses to yield quantitative information about the studied systems. In
this article we use DNNs to disentangle components of oscillating time series,
and recover meaningful information. We show that, because DNNs can find useful
abstract feature representations, they can be used when prior knowledge about
the signal-generating process exists, but is not complete, as it is
particularly the case in ""new-physics"" searches. To this aim, we train our DNN
on synthetic oscillating time series to perform two tasks: a regression of the
signal latent parameters and signal denoising by an Autoencoder-like
architecture. We show that the regression and denoising performance is similar
to those of least-square curve fittings (LS-fit) with true latent parameters'
initial guesses, in spite of the DNN needing no initial guesses at all. We then
explore applications in which we believe our architecture could prove useful
for time-series processing in physics, when prior knowledge is incomplete. As
an example, we employ DNNs as a tool to inform LS-fits when initial guesses are
unknown. We show that the regression can be performed on some latent
parameters, while ignoring the existence of others. Because the Autoencoder
needs no prior information about the physical model, the remaining unknown
latent parameters can still be captured, thus making use of partial prior
knowledge, while leaving space for data exploration and discoveries.
","[{'version': 'v1', 'created': 'Mon, 11 Jan 2021 12:39:50 GMT'}]",2022-10-12,"[['Garcon', 'Antoine', ''], ['Vexler', 'Julian', ''], ['Budker', 'Dmitry', ''], ['Kramer', 'Stefan', '']]","['time series', 'autoencoder', 'regression', 'co-training', 'deep neural networks', 'scientific discovery']"
7354,2104.08416,Roger Ara\'ujo,"Roger R. F. Ara\'ujo, Lutz Gross, Samuel Xavier-de-Souza","Boosting Memory Access Locality of the Spectral Element Method with
  Hilbert Space-Filling Curves","23 pages, 12 figures",,10.1016/j.cageo.2021.104938,,cs.MS cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an algorithm based on Hilbert space-filling curves to reorder mesh
elements in memory for use with the Spectral Element Method, aiming to attain
fewer cache misses, better locality of data reference and faster execution. We
present a technique to numerically simulate acoustic wave propagation in 2D
domains using the Spectral Element Method, and discuss computational
performance aspects of this procedure. We reorder mesh-related data via Hilbert
curves to achieve sizable reductions in execution time under several mesh
configurations in shared-memory systems. Our experiments show that the Hilbert
curve approach works well with meshes of several granularities and also with
small and large variations in element sizes, achieving reductions between 9%
and 25% in execution time when compared to three other ordering schemes.
","[{'version': 'v1', 'created': 'Sat, 17 Apr 2021 01:27:38 GMT'}]",2021-10-04,"[['Araújo', 'Roger R. F.', ''], ['Gross', 'Lutz', ''], ['Xavier-de-Souza', 'Samuel', '']]","['Hilbert space-filling curves', 'spectralelement method', 'unstructured meshes', 'acoustic waves', 'wave propagation', 'parallel processing']"
7355,2001.11358,Zohreh Ovaisi,"Zohreh Ovaisi, Ragib Ahsan, Yifan Zhang, Kathryn Vasilaky, Elena
  Zheleva",Correcting for Selection Bias in Learning-to-rank Systems,"This paper appeared in The Web Conference (WWW'20), April 20-24,
  2020, Taipei, Taiwan",,10.1145/3366423.3380255,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Click data collected by modern recommendation systems are an important source
of observational data that can be utilized to train learning-to-rank (LTR)
systems. However, these data suffer from a number of biases that can result in
poor performance for LTR systems. Recent methods for bias correction in such
systems mostly focus on position bias, the fact that higher ranked results
(e.g., top search engine results) are more likely to be clicked even if they
are not the most relevant results given a user's query. Less attention has been
paid to correcting for selection bias, which occurs because clicked documents
are reflective of what documents have been shown to the user in the first
place. Here, we propose new counterfactual approaches which adapt Heckman's
two-stage method and accounts for selection and position bias in LTR systems.
Our empirical evaluation shows that our proposed methods are much more robust
to noise and have better accuracy compared to existing unbiased LTR algorithms,
especially when there is moderate to no position bias.
","[{'version': 'v1', 'created': 'Wed, 29 Jan 2020 08:23:52 GMT'}, {'version': 'v2', 'created': 'Tue, 12 May 2020 06:52:33 GMT'}]",2020-05-13,"[['Ovaisi', 'Zohreh', ''], ['Ahsan', 'Ragib', ''], ['Zhang', 'Yifan', ''], ['Vasilaky', 'Kathryn', ''], ['Zheleva', 'Elena', '']]","['recommender systems', 'learning-to-rank', 'position bias', 'selectionbias']"
7356,1904.05710,Sara Rouhani,"Vahid Pourheidari, Sara Rouhani, Ralph deters","A Case Study of Execution of Untrusted Business Process on Permissioned
  Blockchain",,IEEE Blockchain 2018,10.1109/Cybermatics_2018.2018.00266,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many studies have been done to improve the performance of centrally
controlled business processes and enhance the integration between different
parties of these collaborations. However, the most serious issues of
collaborative business processes remained unsolved in these studies, lack of
trust and divided data on various confidential ledgers. Blockchain technology
has enormous potential to become a new substantial integration method for
untrusted collaborative businesses. Using the governing consensus mechanism,
blockchain eliminates the necessity of the trusted third party. It provides a
distributed shared ledger which facilitates the job of the process monitoring
for the parties. The smart contract, as a crucial tool, is used to define the
guaranteed autonomous programs. In addition, the privacy of the data can be
ensured by using a permissioned blockchain that handles the access control
because in this way, only verifiable participants can have access to the state
of the business process and its related information. In this study, the
applicability of execution of a real-word untrusted business process on the
permissioned blockchain is investigated. Moreover, we determine the advantages
of using the permissioned access-controller blockchain as the infrastructure
for the collaborative business processes, through implementing the process of
Order Processing on the Hyperledger Fabric blockchain platform.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2019 14:15:54 GMT'}]",2019-04-12,"[['Pourheidari', 'Vahid', ''], ['Rouhani', 'Sara', ''], ['deters', 'Ralph', '']]","['business processes integration', 'distributed shared ledger', 'permissioned blockchain', 'access control', 'smart contract']"
7357,1807.07794,Ghislain Fourny,Ghislain Fourny,Kripke Semantics of the Perfectly Transparent Equilibrium,Working paper,,10.3929/ethz-b-000277118,,cs.GT cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Perfectly Transparent Equilibrium is algorithmically defined, for any
game in normal form with perfect information and no ties, as the iterated
deletion of non-individually-rational strategy profiles until at most one
remains. In this paper, we characterize the Perfectly Transparent Equilibrium
with adapted Kripke models having necessary rationality, necessary knowledge of
strategies as well as eventual logical omniscience.
  Eventual logical omniscience is introduced as a weaker version of perfect
logical omniscience, with logical omniscience being quantized and fading away
counterfactually. It is the price to pay for necessary factual omniscience and
necessary rationality: we conjecture that epistemic omniscience, logical
omniscience and necessary rationality form an impossibility triangle.
  We consider multimodal classes of Kripke structures, with respect to agents,
but also in the sense that we have both epistemic and logical accessibility
relations. Knowledge is defined in terms of the former, while necessity is
defined in terms of the latter. Lewisian closest-state functions, which are not
restricted to unilateral deviations, model counterfactuals.
  We use impossible possible worlds \`a la Rantala to model that some strategy
profiles cannot possibly be reached in some situations. Eventual logical
omniscience is then bootstrapped with the agents' considering that, at
logically possible, but non-normal worlds \`a la Kripke, any world is logically
accessible and thus any deviation of strategy is possible. As in known in
literature, under rationality and knowledge of strategies, these worlds
characterize individual rationality. Then, in normal worlds, higher levels of
logical omniscience characterize higher levels of individual rationality, and a
high-enough level of logical omniscience characterizes, when it exists, the
Perfectly Transparent Equilibrium.
","[{'version': 'v1', 'created': 'Fri, 20 Jul 2018 11:27:44 GMT'}]",2018-07-23,"[['Fourny', 'Ghislain', '']]","['Counterfactual dependency', 'Perfect Prediction', 'Transparency', 'Non-Cooperative Game Theory', 'Non-Nashian Game Theory', 'SymmetricGames', 'Superrationality']"
7358,2212.03791,Ian McQuillan,Oscar H. Ibarra and Ian McQuillan,On Families of Full Trios Containing Counter Machine Languages,"28 pages, 1 figure","Theoretical Computer Science 799, 71--93 (2019)",10.1016/j.tcs.2019.09.045,,cs.FL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We look at nondeterministic finite automata augmented with multiple
reversal-bounded counters where, during an accepting computation, the behavior
of the counters is specified by some fixed pattern. These patterns can serve as
a useful ""bridge"" to other important automata and grammar models in the
theoretical computer science literature, thereby helping in their study.
Various pattern behaviors are considered, together with characterizations and
comparisons. For example, one such pattern defines exactly the smallest full
trio containing all the bounded semilinear languages. Another pattern defines
the smallest full trio containing all the bounded context-free languages. The
""bridging"" to other families is then applied, e.g. to certain Turing machine
restrictions, as well as other families. Certain general decidability
properties are also studied using this framework.
","[{'version': 'v1', 'created': 'Wed, 7 Dec 2022 17:17:02 GMT'}]",2022-12-08,"[['Ibarra', 'Oscar H.', ''], ['McQuillan', 'Ian', '']]","['Counter Machines', 'Reversal-Bounds', 'Determinism', 'Finite Automata', 'Context-Free Languages', 'AFL Theory']"
7359,2106.08729,Joberto Martins Prof. Dr.,David S. Barreto and Rafael F. Reale and Joberto S. B. Martins,Modeling and Accomplishing the BEREC Network Neutrality Policy,"17 pages, 8 figures, IJNM preprint","International Journal of Network Management, vol na, p e2148, 2020",10.5281/zenodo.4554025,,cs.NI cs.CY cs.PF,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Network neutrality (NN) is a principle of equal treatment of data in network
infrastructures with fairness and universality being the primary outcomes of
the NN management practice. For networks, the accomplishment of NN management
practice is essential to deal with heterogeneous user requirements and the
ever-increasing data traffic. Current tools and methods address the NN problem
by detecting network neutrality violations and detecting traffic
differentiation. This paper proposes the NN-PCM (Network Neutrality Policy
Conformance Module) that deploys the BEREC network neutrality policy using a
bandwidth allocation model (BAM). The NN-PCM new approach allocates bandwidth
to network users and accomplishes the BEREC NN policy concomitantly. Network
neutrality is achieved by grouping users with similar traffic requirements in
classes and leveraging the bandwidth allocation model's characteristics. The
conceptual analysis and simulation results indicate that NN-PCM allocates
bandwidth to users and accomplishes BEREC network neutrality conformance by
design with transparent, non-discriminatory, exceptional, and proportional
management practices.
","[{'version': 'v1', 'created': 'Wed, 16 Jun 2021 12:11:11 GMT'}]",2021-06-17,"[['Barreto', 'David S.', ''], ['Reale', 'Rafael F.', ''], ['Martins', 'Joberto S. B.', '']]","['Network Neutrality; BEREC', 'Network Neutrality Policy', 'Network Neutrality by Design; Bandwidth']"
7360,2012.13343,Suraj Pawar,"Suraj Pawar, Omer San, Burak Aksoylu, Adil Rasheed, Trond Kvamsdal",Physics guided machine learning using simplified theories,,,10.1063/5.0038929,,cs.LG physics.flu-dyn,http://creativecommons.org/licenses/by/4.0/,"  Recent applications of machine learning, in particular deep learning,
motivate the need to address the generalizability of the statistical inference
approaches in physical sciences. In this letter, we introduce a modular physics
guided machine learning framework to improve the accuracy of such data-driven
predictive engines. The chief idea in our approach is to augment the knowledge
of the simplified theories with the underlying learning process. To emphasise
on their physical importance, our architecture consists of adding certain
features at intermediate layers rather than in the input layer. To demonstrate
our approach, we select a canonical airfoil aerodynamic problem with the
enhancement of the potential flow theory. We include features obtained by a
panel method that can be computed efficiently for an unseen configuration in
our training procedure. By addressing the generalizability concerns, our
results suggest that the proposed feature enhancement approach can be
effectively used in many scientific machine learning applications, especially
for the systems where we can use a theoretical, empirical, or simplified model
to guide the learning module.
","[{'version': 'v1', 'created': 'Fri, 18 Dec 2020 21:30:40 GMT'}]",2021-02-03,"[['Pawar', 'Suraj', ''], ['San', 'Omer', ''], ['Aksoylu', 'Burak', ''], ['Rasheed', 'Adil', ''], ['Kvamsdal', 'Trond', '']]","['Physics guided machine learning', 'feature engineering', 'trustworthy artificial intelligence', 'generalizibility', 'hybrid neurophysical modeling']"
7361,2110.15362,Marina Neseem,"Abdelrahman Hosny, Marina Neseem, Sherief Reda","BitTrain: Sparse Bitmap Compression for Memory-Efficient Training on the
  Edge","12 pages, 13 figures, to appear in the proceedings of The Sixth
  ACM/IEEE Symposium on Edge Computing (SEC 2021)",,10.1145/3453142.3491290,,cs.LG cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Training on the Edge enables neural networks to learn continuously from new
data after deployment on memory-constrained edge devices. Previous work is
mostly concerned with reducing the number of model parameters which is only
beneficial for inference. However, memory footprint from activations is the
main bottleneck for training on the edge. Existing incremental training methods
fine-tune the last few layers sacrificing accuracy gains from re-training the
whole model. In this work, we investigate the memory footprint of training deep
learning models, and use our observations to propose BitTrain. In BitTrain, we
exploit activation sparsity and propose a novel bitmap compression technique
that reduces the memory footprint during training. We save the activations in
our proposed bitmap compression format during the forward pass of the training,
and restore them during the backward pass for the optimizer computations. The
proposed method can be integrated seamlessly in the computation graph of modern
deep learning frameworks. Our implementation is safe by construction, and has
no negative impact on the accuracy of model training. Experimental results show
up to 34% reduction in the memory footprint at a sparsity level of 50%. Further
pruning during training results in more than 70% sparsity, which can lead to up
to 56% reduction in memory footprint. BitTrain advances the efforts towards
bringing more machine learning capabilities to edge devices. Our source code is
available at https://github.com/scale-lab/BitTrain.
","[{'version': 'v1', 'created': 'Fri, 29 Oct 2021 16:30:57 GMT'}]",2021-11-01,"[['Hosny', 'Abdelrahman', ''], ['Neseem', 'Marina', ''], ['Reda', 'Sherief', '']]","['Training on the Edge', 'Memory Footprint', 'Edge Intelligence', 'Resource Constrained Devices']"
7362,2005.12548,Marie-Morgane Paumard,"Marie-Morgane Paumard, David Picard, Hedi Tabia","Deepzzle: Solving Visual Jigsaw Puzzles with Deep Learning andShortest
  Path Optimization",,IEEE Transactions on Image Processing (2020),10.1109/TIP.2019.2963378,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We tackle the image reassembly problem with wide space between the fragments,
in such a way that the patterns and colors continuity is mostly unusable. The
spacing emulates the erosion of which the archaeological fragments suffer. We
crop-square the fragments borders to compel our algorithm to learn from the
content of the fragments. We also complicate the image reassembly by removing
fragments and adding pieces from other sources. We use a two-step method to
obtain the reassemblies: 1) a neural network predicts the positions of the
fragments despite the gaps between them; 2) a graph that leads to the best
reassemblies is made from these predictions. In this paper, we notably
investigate the effect of branch-cut in the graph of reassemblies. We also
provide a comparison with the literature, solve complex images reassemblies,
explore at length the dataset, and propose a new metric that suits its
specificities.
  Keywords: image reassembly, jigsaw puzzle, deep learning, graph, branch-cut,
cultural heritage
","[{'version': 'v1', 'created': 'Tue, 26 May 2020 07:19:54 GMT'}]",2020-05-27,"[['Paumard', 'Marie-Morgane', ''], ['Picard', 'David', ''], ['Tabia', 'Hedi', '']]","['image reassembly', 'jigsaw puzzle', 'deeplearning', 'graph', 'branch-cut', 'cultural heritage']"
7363,1710.03023,Gianmarco Santini,"G. Santini, D. Della Latta, N. Martini, G. Valvano, A. Gori, A.
  Ripoli, C.L. Susini, L. Landini and D. Chiappino","An automatic deep learning approach for coronary artery calcium
  segmentation",,"EMBEC & NBC 2017. IFMBE, volume 65, pp. 374-377",10.1007/978-981-10-5122-7_94,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Coronary artery calcium (CAC) is a significant marker of atherosclerosis and
cardiovascular events. In this work we present a system for the automatic
quantification of calcium score in ECG-triggered non-contrast enhanced cardiac
computed tomography (CT) images. The proposed system uses a supervised deep
learning algorithm, i.e. convolutional neural network (CNN) for the
segmentation and classification of candidate lesions as coronary or not,
previously extracted in the region of the heart using a cardiac atlas. We
trained our network with 45 CT volumes; 18 volumes were used to validate the
model and 56 to test it. Individual lesions were detected with a sensitivity of
91.24%, a specificity of 95.37% and a positive predicted value (PPV) of 90.5%;
comparing calcium score obtained by the system and calcium score manually
evaluated by an expert operator, a Pearson coefficient of 0.983 was obtained. A
high agreement (Cohen's k = 0.879) between manual and automatic risk prediction
was also observed. These results demonstrated that convolutional neural
networks can be effectively applied for the automatic segmentation and
classification of coronary calcifications.
","[{'version': 'v1', 'created': 'Mon, 9 Oct 2017 10:48:13 GMT'}]",2017-10-10,"[['Santini', 'G.', ''], ['Della Latta', 'D.', ''], ['Martini', 'N.', ''], ['Valvano', 'G.', ''], ['Gori', 'A.', ''], ['Ripoli', 'A.', ''], ['Susini', 'C. L.', ''], ['Landini', 'L.', ''], ['Chiappino', 'D.', '']]","['Deep Learning', 'CNN', 'calcium score', 'segmentation', 'computed tomography']"
7364,2008.01178,Nicolas Gonthier,"Nicolas Gonthier and Sa\""id Ladjal and Yann Gousseau","Multiple instance learning on deep features for weakly supervised object
  detection with extreme domain shifts","26 pages, 12 figures",Computer Vision and Image Understanding 2022,10.1016/j.cviu.2021.103299,103299,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Weakly supervised object detection (WSOD) using only image-level annotations
has attracted a growing attention over the past few years. Whereas such task is
typically addressed with a domain-specific solution focused on natural images,
we show that a simple multiple instance approach applied on pre-trained deep
features yields excellent performances on non-photographic datasets, possibly
including new classes. The approach does not include any fine-tuning or
cross-domain learning and is therefore efficient and possibly applicable to
arbitrary datasets and classes. We investigate several flavors of the proposed
approach, some including multi-layers perceptron and polyhedral classifiers.
Despite its simplicity, our method shows competitive results on a range of
publicly available datasets, including paintings (People-Art, IconArt),
watercolors, cliparts and comics and allows to quickly learn unseen visual
categories.
","[{'version': 'v1', 'created': 'Mon, 3 Aug 2020 20:36:01 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Sep 2020 09:08:58 GMT'}, {'version': 'v3', 'created': 'Sat, 12 Sep 2020 16:02:00 GMT'}, {'version': 'v4', 'created': 'Sun, 25 Oct 2020 12:21:21 GMT'}, {'version': 'v5', 'created': 'Fri, 12 Nov 2021 10:23:11 GMT'}]",2021-11-15,"[['Gonthier', 'Nicolas', ''], ['Ladjal', 'Saïd', ''], ['Gousseau', 'Yann', '']]","['weakly supervised object detection', 'domain adaptation', 'non-photographic images', 'multiple instancelearning']"
7365,2208.09623,Morteza Zakeri-Nasrabadi,Morteza Zakeri-Nasrabadi and Saeed Parsa,Learning to predict test effectiveness,"19 pages, 11 figures",Int J Intell Syst. 2022; 37: 4363- 4392,10.1002/int.22722,,cs.SE cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The high cost of the test can be dramatically reduced, provided that the
coverability as an inherent feature of the code under test is predictable. This
article offers a machine learning model to predict the extent to which the test
could cover a class in terms of a new metric called Coverageability. The
prediction model consists of an ensemble of four regression models. The
learning samples consist of feature vectors, where features are source code
metrics computed for a class. The samples are labeled by the Coverageability
values computed for their corresponding classes. We offer a mathematical model
to evaluate test effectiveness in terms of size and coverage of the test suite
generated automatically for each class. We extend the size of the feature space
by introducing a new approach to defining sub-metrics in terms of existing
source code metrics. Using feature importance analysis on the learned
prediction models, we sort source code metrics in the order of their impact on
the test effectiveness. As a result of which, we found the class strict
cyclomatic complexity as the most influential source code metric. Our
experiments with the prediction models on a large corpus of Java projects
containing about 23,000 classes demonstrate the Mean Absolute Error (MAE) of
0.032, Mean Squared Error (MSE) of 0.004, and an R2-score of 0.855. Compared
with the state-of-the-art coverage prediction models, our models improve MAE,
MSE, and an R2-score by 5.78%, 2.84%, and 20.71%, respectively.
","[{'version': 'v1', 'created': 'Sat, 20 Aug 2022 07:26:59 GMT'}]",2022-08-23,"[['Zakeri-Nasrabadi', 'Morteza', ''], ['Parsa', 'Saeed', '']]","['Software testing', 'test effectiveness', 'code coverage prediction', 'machine learning', 'regression']"
7366,2007.10553,Dan Plyukhin,Dan Plyukhin and Gul Agha,Scalable Termination Detection for Distributed Actor Systems,"23 pages, 7 figures. To appear in the proceedings of CONCUR 2020.
  Version 2: Fixed TeX error that omitted predicates in the third line of the
  Send rule: Actor $A$ must have active refobs $x$ and $y_1 \dots y_n$",,10.4230/LIPIcs.CONCUR.2020.44,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic garbage collection (GC) prevents certain kinds of bugs and reduces
programming overhead. GC techniques for sequential programs are based on
reachability analysis. However, testing reachability from a root set is
inadequate for determining whether an actor is garbage because an unreachable
actor may send a message to a reachable actor. Instead, it is sufficient to
check termination (sometimes also called quiescence): an actor is terminated if
it is not currently processing a message and cannot receive a message in the
future. Moreover, many actor frameworks provide all actors with access to file
I/O or external storage; without inspecting an actor's internal code, it is
necessary to check that the actor has terminated to ensure that it may be
garbage collected in these frameworks. Previous algorithms to detect actor
garbage require coordination mechanisms such as causal message delivery or
nonlocal monitoring of actors for mutation. Such coordination mechanisms
adversely affect concurrency and are therefore expensive in distributed
systems. We present a low-overhead reference listing technique (called DRL) for
termination detection in actor systems. DRL is based on asynchronous local
snapshots and message-passing between actors. This enables a decentralized
implementation and transient network partition tolerance. The paper provides a
formal description of DRL, shows that all actors identified as garbage have
indeed terminated (safety), and that all terminated actors--under certain
reasonable assumptions--will eventually be identified (liveness).
","[{'version': 'v1', 'created': 'Tue, 21 Jul 2020 01:45:46 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Jul 2020 17:14:00 GMT'}]",2020-07-24,"[['Plyukhin', 'Dan', ''], ['Agha', 'Gul', '']]","['actors', 'concurrency', 'termination detection', 'quiescence detection', 'garbagecollection', 'distributed systems']"
7367,2002.05896,Ahmad Slo,"Ahmad Slo, Sukanya Bhowmik, Kurt Rothermel","eSPICE: Probabilistic Load Shedding from Input Event Streams in Complex
  Event Processing",13 pages,,10.1145/3361525.3361548,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Complex event processing systems process the input event streams on-the-fly.
Since input event rate could overshoot the system's capabilities and results in
violating a defined latency bound, load shedding is used to drop a portion of
the input event streams. The crucial question here is how many and which events
to drop so the defined latency bound is maintained and the degradation in the
quality of results is minimized. In stream processing domain, different load
shedding strategies have been proposed but they mainly depend on the importance
of individual tuples (events). However, as complex event processing systems
perform pattern detection, the importance of events is also influenced by other
events in the same pattern. In this paper, we propose a load shedding framework
called eSPICE for complex event processing systems. eSPICE depends on building
a probabilistic model that learns about the importance of events in a window.
The position of an event in a window and its type are used as features to build
the model. Further, we provide algorithms to decide when to start dropping
events and how many events to drop. Moreover, we extensively evaluate the
performance of eSPICE on two real-world datasets.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 07:35:26 GMT'}]",2020-02-17,"[['Slo', 'Ahmad', ''], ['Bhowmik', 'Sukanya', ''], ['Rothermel', 'Kurt', '']]","['Complex Event Processing', 'Stream Processing', 'LoadShedding', 'Approximate Computing', 'latency bound', 'QoS']"
7368,2110.07986,Zhuowen Yuan,"Zhuowen Yuan, Zhengxin You, Sheng Li, Xinpeng Zhang, Zhenxin Qian,
  Alex Kot",On Generating Identifiable Virtual Faces,,,10.1145/3503161.3548110,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Face anonymization with generative models have become increasingly prevalent
since they sanitize private information by generating virtual face images,
ensuring both privacy and image utility. Such virtual face images are usually
not identifiable after the removal or protection of the original identity. In
this paper, we formalize and tackle the problem of generating identifiable
virtual face images. Our virtual face images are visually different from the
original ones for privacy protection. In addition, they are bound with new
virtual identities, which can be directly used for face recognition. We propose
an Identifiable Virtual Face Generator (IVFG) to generate the virtual face
images. The IVFG projects the latent vectors of the original face images into
virtual ones according to a user specific key, based on which the virtual face
images are generated. To make the virtual face images identifiable, we propose
a multi-task learning objective as well as a triplet styled training strategy
to learn the IVFG. We evaluate the performance of our virtual face images using
different face recognizers on diffident face image datasets, all of which
demonstrate the effectiveness of the IVFG for generate identifiable virtual
face images.
","[{'version': 'v1', 'created': 'Fri, 15 Oct 2021 10:19:48 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Jul 2022 02:50:13 GMT'}]",2022-07-26,"[['Yuan', 'Zhuowen', ''], ['You', 'Zhengxin', ''], ['Li', 'Sheng', ''], ['Zhang', 'Xinpeng', ''], ['Qian', 'Zhenxin', ''], ['Kot', 'Alex', '']]","['Face authentication', 'Face anonymization', 'Generative adversarialnetworks']"
7369,2111.10642,Pietro Biondi,"Giampaolo Bella, Pietro Biondi, Gianpiero Costantino, Ilaria Matteucci",TOUCAN: A proTocol tO secUre Controller Area Network,,,10.1145/3309171.3309175,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern cars are no longer purely mechanical devices but shelter so much
digital technology that they resemble a network of computers. Electronic
Control Units (ECUs) need to exchange a large amount of data for the various
functions of the car to work, and such data must be made secure if we want
those functions to work as intended despite malicious activity by attackers.
TOUCAN is a new security protocol designed to be secure and at the same time
both CAN and AUTOSAR compliant. It achieves security in terms of authenticity,
integrity and confidentiality, yet without the need to upgrade (the hardware
of) existing ECUs or enrich the network with novel components. The overhead is
tiny, namely a reduction of the size of the Data field of a frame. A prototype
implementation exhibits promising performance on a STM32F407Discovery board.
","[{'version': 'v1', 'created': 'Sat, 20 Nov 2021 17:47:13 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Nov 2021 16:04:37 GMT'}]",2021-11-24,"[['Bella', 'Giampaolo', ''], ['Biondi', 'Pietro', ''], ['Costantino', 'Gianpiero', ''], ['Matteucci', 'Ilaria', '']]","['Automotive', 'Cybersecurity', 'CAN Bus', 'Frame']"
7370,1906.11976,Jos\'e Camacho,"Jos\'e Camacho, Jos\'e Manuel Garc\'ia-Gim\'enez, Noem\'i Marta
  Fuentes-Garc\'ia, Gabriel Maci\'a-Fern\'andez","Multivariate Big Data Analysis for Intrusion Detection: 5 steps from the
  haystack to the needle",,"Computers & Security, Volume 87, November 2019, 101603",10.1016/j.cose.2019.101603,,cs.NI cs.CR cs.LG stat.OT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The research literature on cybersecurity incident detection & response is
very rich in automatic detection methodologies, in particular those based on
the anomaly detection paradigm. However, very little attention has been devoted
to the diagnosis ability of the methods, aimed to provide useful information on
the causes of a given detected anomaly. This information is of utmost
importance for the security team to reduce the time from detection to response.
In this paper, we present Multivariate Big Data Analysis (MBDA), a complete
intrusion detection approach based on 5 steps to effectively handle massive
amounts of disparate data sources. The approach has been designed to deal with
the main characteristics of Big Data, that is, the high volume, velocity and
variety. The core of the approach is the Multivariate Statistical Network
Monitoring (MSNM) technique proposed in a recent paper. Unlike in state of the
art machine learning methodologies applied to the intrusion detection problem,
when an anomaly is identified in MBDA the output of the system includes the
detail of the logs of raw information associated to this anomaly, so that the
security team can use this information to elucidate its root causes. MBDA is
based in two open software packages available in Github: the MEDA Toolbox and
the FCParser. We illustrate our approach with two case studies. The first one
demonstrates the application of MBDA to semistructured sources of information,
using the data from the VAST 2012 mini challenge 2. This complete case study is
supplied in a virtual machine available for download. In the second case study
we show the Big Data capabilities of the approach in data collected from a real
network with labeled attacks.
","[{'version': 'v1', 'created': 'Thu, 27 Jun 2019 21:36:13 GMT'}]",2019-09-16,"[['Camacho', 'José', ''], ['García-Giménez', 'José Manuel', ''], ['Fuentes-García', 'Noemí Marta', ''], ['Maciá-Fernández', 'Gabriel', '']]","['Multivariate Statistical Network Monitoring', 'Anomaly Detection', 'Intrusion Detection', 'Diagnosis', 'Big Data']"
7371,2211.08298,Jennifer Andreoli-Fang,"John T Chapman, Jennifer Andreoli-Fang, Michel Chauvin, Elias
  Chavarria Reyes, Zheng Lu, Dantong Liu, Joey Padden, Alon Bernstein",Low Latency Techniques for Mobile Backhaul over DOCSIS,"IEEE Wireless Communications and Networking Conference (WCNC), 2018.
  arXiv admin note: text overlap with arXiv:2211.08292",,10.1109/WCNC.2018.8376975,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The mobile network operators (MNOs) are looking into economically viable
backhaul solutions as alternatives to fiber, specifically the hybrid fiber
coaxial networks (HFC). When the latencies from both the wireless and the HFC
networks are added together, the result is a noticeable end-to-end system
latency, particularly under network congestion. In order to decrease total
system latency, we proposed a method to improve upstream user- to-mobile core
latency by coordinating the LTE and HFC scheduling in previous papers. In this
paper, we implement and optimize the proposed method on a custom LTE and DOCSIS
end-to-end system testbed. The testbed uses the OpenAirInterface (OAI) platform
for the LTE network, along with Cisco's broadband router cBR-8 that is
currently deployed in the HFC networks around the world. Our results show a
backhaul latency improvement under all traffic load conditions.
","[{'version': 'v1', 'created': 'Tue, 15 Nov 2022 16:52:53 GMT'}]",2022-11-17,"[['Chapman', 'John T', ''], ['Andreoli-Fang', 'Jennifer', ''], ['Chauvin', 'Michel', ''], ['Reyes', 'Elias Chavarria', ''], ['Lu', 'Zheng', ''], ['Liu', 'Dantong', ''], ['Padden', 'Joey', ''], ['Bernstein', 'Alon', '']]","['mobile backhaul', 'LTE', 'small cell', 'hybrid']"
7372,2004.09274,Hossein Shirazi,"Ehsan Farzadnia, Hossein Shirazi, Alireza Nowroozi","A New Intrusion Detection System using the Improved Dendritic Cell
  Algorithm","24 pages, 7 figures",,10.13140/RG.2.2.17223.65442,,cs.CR cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Dendritic Cell Algorithm (DCA) as one of the emerging evolutionary
algorithms is based on the behavior of the specific immune agents; known as
Dendritic Cells (DCs). DCA has several potentially beneficial features for
binary classification problems. In this paper, we aim at providing a new
version of this immune-inspired mechanism acts as a semi-supervised classifier
which can be a defensive shield in network intrusion detection problem. Till
now, no strategy or idea has already been adopted on the GetAntigen() function
on detection phase, but randomly sampling entails the DCA to provide
undesirable results in several cycles in each time. This leads to uncertainty.
Whereas it must be accomplished by biological behaviors of DCs in tissues, we
have proposed a novel strategy which exactly acts based on its immunological
functionalities of dendritic cells. The proposed mechanism focuses on two
items: First, to obviate the challenge of needing to have a preordered antigen
set for computing danger signal, and the second, to provide a novel
immune-inspired idea in order to non-random data sampling. A variable
functional migration threshold is also computed cycle by cycle that shows
necessity of the Migration threshold (MT) flexibility. A significant criterion
so called capability of intrusion detection (CID) used for tests. All of the
tests have been performed in a new benchmark dataset named UNSW-NB15.
Experimental consequences demonstrate that the present schema dominates the
standard DCA and has higher CID in comparison with other approaches found in
literature.
","[{'version': 'v1', 'created': 'Wed, 15 Apr 2020 09:21:34 GMT'}]",2020-04-22,"[['Farzadnia', 'Ehsan', ''], ['Shirazi', 'Hossein', ''], ['Nowroozi', 'Alireza', '']]","['Anomaly detection', 'Dendritic cell', 'Input signals', 'Variable migration threshold']"
7373,2008.06877,Meysam Asgari-Chenaghlu,"Meysam Asgari-Chenaghlu, Mohammad-Reza Feizi-Derakhshi, Leili
  farzinvash, Mohammad-Ali Balafar, Cina Motamed","TopicBERT: A Transformer transfer learning based memory-graph approach
  for multimodal streaming social media topic detection",,,10.1016/j.chaos.2021.111274,,cs.CL cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real time nature of social networks with bursty short messages and their
respective large data scale spread among vast variety of topics are research
interest of many researchers. These properties of social networks which are
known as 5'Vs of big data has led to many unique and enlightenment algorithms
and techniques applied to large social networking datasets and data streams.
Many of these researches are based on detection and tracking of hot topics and
trending social media events that help revealing many unanswered questions.
These algorithms and in some cases software products mostly rely on the nature
of the language itself. Although, other techniques such as unsupervised data
mining methods are language independent but many requirements for a
comprehensive solution are not met. Many research issues such as noisy
sentences that adverse grammar and new online user invented words are
challenging maintenance of a good social network topic detection and tracking
methodology; The semantic relationship between words and in most cases,
synonyms are also ignored by many of these researches. In this research, we use
Transformers combined with an incremental community detection algorithm.
Transformer in one hand, provides the semantic relation between words in
different contexts. On the other hand, the proposed graph mining technique
enhances the resulting topics with aid of simple structural rules. Named entity
recognition from multimodal data, image and text, labels the named entities
with entity type and the extracted topics are tuned using them. All operations
of proposed system has been applied with big social data perspective under
NoSQL technologies. In order to present a working and systematic solution, we
combined MongoDB with Neo4j as two major database systems of our work. The
proposed system shows higher precision and recall compared to other methods in
three different datasets.
","[{'version': 'v1', 'created': 'Sun, 16 Aug 2020 10:39:50 GMT'}]",2021-08-05,"[['Asgari-Chenaghlu', 'Meysam', ''], ['Feizi-Derakhshi', 'Mohammad-Reza', ''], ['farzinvash', 'Leili', ''], ['Balafar', 'Mohammad-Ali', ''], ['Motamed', 'Cina', '']]","['Memory–Graph', 'Deep Learning', 'Frequent Subgraph Mining', 'Transformer', 'Multimodal Learning', 'BERT']"
7374,2209.00381,Juan Lagos,Juan Pablo Lagos and Esa Rahtu,"SemSegDepth: A Combined Model for Semantic Segmentation and Depth
  Completion",,17th VISIGRAPP 2022 - Volume 5: VISAPP,10.5220/0010838500003124,,cs.CV cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Holistic scene understanding is pivotal for the performance of autonomous
machines. In this paper we propose a new end-to-end model for performing
semantic segmentation and depth completion jointly. The vast majority of recent
approaches have developed semantic segmentation and depth completion as
independent tasks. Our approach relies on RGB and sparse depth as inputs to our
model and produces a dense depth map and the corresponding semantic
segmentation image. It consists of a feature extractor, a depth completion
branch, a semantic segmentation branch and a joint branch which further
processes semantic and depth information altogether. The experiments done on
Virtual KITTI 2 dataset, demonstrate and provide further evidence, that
combining both tasks, semantic segmentation and depth completion, in a
multi-task network can effectively improve the performance of each task. Code
is available at https://github.com/juanb09111/semantic depth.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2022 11:52:11 GMT'}]",2022-09-02,"[['Lagos', 'Juan Pablo', ''], ['Rahtu', 'Esa', '']]","['Semantic Segmentation', 'Depth Completion', 'CNN', 'Multi-task Networks']"
7375,2110.03054,Parham Gohari,"Yunhao Yang, Parham Gohari and Ufuk Topcu","On the Privacy Risks of Deploying Recurrent Neural Networks in Machine
  Learning Models",Under Double-Blind Review,,10.56553/popets-2023-0005,,cs.CR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the privacy implications of training recurrent neural networks
(RNNs) with sensitive training datasets. Considering membership inference
attacks (MIAs), which aim to infer whether or not specific data records have
been used in training a given machine learning model, we provide empirical
evidence that a neural network's architecture impacts its vulnerability to
MIAs. In particular, we demonstrate that RNNs are subject to a higher attack
accuracy than feed-forward neural network (FFNN) counterparts. Additionally, we
study the effectiveness of two prominent mitigation methods for preempting
MIAs, namely weight regularization and differential privacy. For the former, we
empirically demonstrate that RNNs may only benefit from weight regularization
marginally as opposed to FFNNs. For the latter, we find that enforcing
differential privacy through either of the following two methods leads to a
less favorable privacy-utility trade-off in RNNs than alternative FFNNs: (i)
adding Gaussian noise to the gradients calculated during training as a part of
the so-called DP-SGD algorithm and (ii) adding Gaussian noise to the trainable
parameters as a part of a post-training mechanism that we propose. As a result,
RNNs can also be less amenable to mitigation methods, bringing us to the
conclusion that the privacy risks pertaining to the recurrent architecture are
higher than the feed-forward counterparts.
","[{'version': 'v1', 'created': 'Wed, 6 Oct 2021 20:20:35 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Dec 2021 19:49:49 GMT'}, {'version': 'v3', 'created': 'Wed, 15 Jun 2022 15:29:30 GMT'}]",2023-01-23,"[['Yang', 'Yunhao', ''], ['Gohari', 'Parham', ''], ['Topcu', 'Ufuk', '']]","['Differential Privacy', 'Recurrent Neural Networks', 'Membership Inference Attacks']"
7376,1907.05445,Heather Guarnera,Feodor F. Dragan and Heather M. Guarnera,Eccentricity function in distance-hereditary graphs,"20 pages, 7 figures",,10.1016/j.tcs.2020.05.004,,cs.DM cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A graph $G=(V,E)$ is distance hereditary if every induced path of $G$ is a
shortest path. In this paper, we show that the eccentricity function
$e(v)=\max\{d(v,u): u\in V\}$ in any distance-hereditary graph $G$ is almost
unimodal, that is, every vertex $v$ with $e(v)> rad(G)+1$ has a neighbor with
smaller eccentricity. Here, $rad(G)=\min\{e(v): v\in V\}$ is the radius of
graph $G$. Moreover, we use this result to fully characterize the centers of
distance-hereditary graphs. Several bounds on the eccentricity of a vertex with
respect to its distance to the center of $G$ or to the ends of a diametral path
are established. Finally, we propose a new linear time algorithm to compute all
eccentricities in a distance-hereditary graph.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2019 18:40:26 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jul 2020 15:36:46 GMT'}]",2020-07-30,"[['Dragan', 'Feodor F.', ''], ['Guarnera', 'Heather M.', '']]","['Distance-hereditary graph', 'eccentricity function', 'center', 'radius', 'diameter', 'linear-time algorithm']"
7377,2210.08041,Song Gao,"Yunlei Liang, Jiawei Zhu, Wen Ye, Song Gao","Region2Vec: Community Detection on Spatial Networks Using Graph
  Embedding with Node Attributes and Spatial Interactions","4 pages, 1 page","The 30th International Conference on Advances in Geographic
  Information Systems (SIGSPATIAL'22), November 1-4, 2022, Seattle, WA, USA",10.1145/3557915.3560974,,cs.SI cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Community Detection algorithms are used to detect densely connected
components in complex networks and reveal underlying relationships among
components. As a special type of networks, spatial networks are usually
generated by the connections among geographic regions. Identifying the spatial
network communities can help reveal the spatial interaction patterns,
understand the hidden regional structures and support regional development
decision-making. Given the recent development of Graph Convolutional Networks
(GCN) and its powerful performance in identifying multi-scale spatial
interactions, we proposed an unsupervised GCN-based community detection method
""region2vec"" on spatial networks. Our method first generates node embeddings
for regions that share common attributes and have intense spatial interactions,
and then applies clustering algorithms to detect communities based on their
embedding similarity and spatial adjacency. Experimental results show that
while existing methods trade off either attribute similarities or spatial
interactions for one another, ""region2vec"" maintains a great balance between
both and performs the best when one wants to maximize both attribute
similarities and spatial interactions within communities.
","[{'version': 'v1', 'created': 'Mon, 10 Oct 2022 02:32:55 GMT'}]",2022-10-18,"[['Liang', 'Yunlei', ''], ['Zhu', 'Jiawei', ''], ['Ye', 'Wen', ''], ['Gao', 'Song', '']]","['spatial networks', 'community detection', 'human mobility', 'graphencoding', 'machine learning']"
7378,cs/0603126,Russ Abbott,Russ Abbott,"Open at the Top; Open at the Bottom; and Continually (but Slowly)
  Evolving","6 pages. To be presented at the IEEE Conference on Systems of Systems
  Engineering, April, 2006",,10.1109/SYSOSE.2006.1652271,,cs.MA,,"  Systems of systems differ from traditional systems in that they are open at
the top, open at the bottom, and continually (but slowly) evolving. ""Open at
the top"" means that there is no pre-defined top level application. New
applications may be created at any time. ""Open at the bottom"" means that the
system primitives are defined functionally rather than concretely. This allows
the implementation of these primitives to be modified as technology changes.
""Continually (but slowly) evolving"" means that the system's functionality is
stable enough to be useful but is understood to be subject to modification.
Systems with these properties tend to be environments within which other
systems operate--and hence are systems of systems. It is also important to
understand the larger environment within which a system of systems exists.
","[{'version': 'v1', 'created': 'Thu, 30 Mar 2006 22:53:15 GMT'}]",2016-11-17,"[['Abbott', 'Russ', '']]","['System of systems', 'open', 'evolving', 'environment']"
7379,2007.06710,Amogh Warkhandkar,"Amogh G. Warkhandkar, Baasit Sharief and Omkar B. Bhambure","Measuring Performance of Generative Adversarial Networks on Devanagari
  Script","5 pages, 5 figures","International Journal of Computer Applications, Volume 176 -
  No.33, June 2020, Pages 5-9",10.5120/ijca2020920393,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The working of neural networks following the adversarial philosophy to create
a generative model is a fascinating field. Multiple papers have already
explored the architectural aspect and proposed systems with potentially good
results however, very few papers are available which implement it on a
real-world example. Traditionally, people use the famous MNIST dataset as a
Hello, World! example for implementing Generative Adversarial Networks (GAN).
Instead of going the standard route of using handwritten digits, this paper
uses the Devanagari script which has a more complex structure. As there is no
conventional way of judging how well the generative models perform, three
additional classifiers were built to judge the output of the GAN model. The
following paper is an explanation of what this implementation has achieved.
","[{'version': 'v1', 'created': 'Sun, 21 Jun 2020 10:20:51 GMT'}]",2020-07-15,"[['Warkhandkar', 'Amogh G.', ''], ['Sharief', 'Baasit', ''], ['Bhambure', 'Omkar B.', '']]","['Generator', 'Discriminator', 'Sequential Models', 'Denoising', 'Morphology', 'Thresholding']"
7380,2101.02647,Juana Valeria Hurtado,"Juana Valeria Hurtado, Laura Londo\~no, and Abhinav Valada","From Learning to Relearning: A Framework for Diminishing Bias in Social
  Robot Navigation",,"Frontiers in Robotics and AI, 2021",10.3389/frobt.2021.650325,,cs.RO cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The exponentially increasing advances in robotics and machine learning are
facilitating the transition of robots from being confined to controlled
industrial spaces to performing novel everyday tasks in domestic and urban
environments. In order to make the presence of robots safe as well as
comfortable for humans, and to facilitate their acceptance in public
environments, they are often equipped with social abilities for navigation and
interaction. Socially compliant robot navigation is increasingly being learned
from human observations or demonstrations. We argue that these techniques that
typically aim to mimic human behavior do not guarantee fair behavior. As a
consequence, social navigation models can replicate, promote, and amplify
societal unfairness such as discrimination and segregation. In this work, we
investigate a framework for diminishing bias in social robot navigation models
so that robots are equipped with the capability to plan as well as adapt their
paths based on both physical and social demands. Our proposed framework
consists of two components: \textit{learning} which incorporates social context
into the learning process to account for safety and comfort, and
\textit{relearning} to detect and correct potentially harmful outcomes before
the onset. We provide both technological and societal analysis using three
diverse case studies in different social scenarios of interaction. Moreover, we
present ethical implications of deploying robots in social environments and
propose potential solutions. Through this study, we highlight the importance
and advocate for fairness in human-robot interactions in order to promote more
equitable social relationships, roles, and dynamics and consequently positively
influence our society.
","[{'version': 'v1', 'created': 'Thu, 7 Jan 2021 17:42:35 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Mar 2021 18:42:23 GMT'}]",2021-03-04,"[['Hurtado', 'Juana Valeria', ''], ['Londoño', 'Laura', ''], ['Valada', 'Abhinav', '']]","['Social Robot Navigation', 'Robot Learning', 'Fairness-Aware Learning', 'Algorithmic Fairness', 'Ethics']"
7381,1805.00808,Zheng Yang,"Zheng Yang, Hang Lei",Formal Process Virtual Machine for Smart Contracts Verification,"9 pages, 5 figures. arXiv admin note: text overlap with
  arXiv:1803.00403","International Journal of Performability Engineering, 2018",10.23940/ijpe.18.08.p9.17261734,"Volume 14, Number 8, pp. 1726-1734",cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper reports on the development and verification of a novel formal
symbolic process virtual machine (FSPVM) for verifying the reliability and
security of Ethereum smart contracts, denoted as FSPVM-E, completely in Coq
proof assistant. It adopts execution-verification isomorphism (EVI), an
extension of Curry-Howard isomorphism (CHI), as its fundamental theoretical
framework. The current version of FSPVM-E is constructed on a general,
extensible, and reusable formal memory (GERM) framework, an extensible and
universal formal intermediate programming language Lolisa, which is a large
subset of the Solidity programming language using generalized algebraic
datatypes, and the corresponding formally verified interpreter of Lolisa,
denoted as FEther. It supports the ERC20 standard and can automatically
simultaneously symbolically execute the smart contract programs of Ethereum and
verify their reliability and security properties using Hoare logic in Coq. In
addition, this work, contributes to solving the problems of automation,
inconsistency and reusability in higher-order logic theorem proving.
","[{'version': 'v1', 'created': 'Tue, 1 May 2018 16:03:23 GMT'}]",2019-07-04,"[['Yang', 'Zheng', ''], ['Lei', 'Hang', '']]","['virtual machine', 'programming language', 'formal method', 'higher-order logic theorem proving', 'Coq;']"
7382,2010.12505,Tim Draws,"Tim Draws, Jody Liu, Nava Tintarev","Helping users discover perspectives: Enhancing opinion mining with joint
  topic models","Accepted at the SENTIRE workshop at ICDM 2020:
  https://sentic.net/sentire/#2020",2020 International Conference on Data Mining Workshops (ICDMW),10.1109/ICDMW51313.2020.00013,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Support or opposition concerning a debated claim such as abortion should be
legal can have different underlying reasons, which we call perspectives. This
paper explores how opinion mining can be enhanced with joint topic modeling, to
identify distinct perspectives within the topic, providing an informative
overview from unstructured text. We evaluate four joint topic models (TAM, JST,
VODUM, and LAM) in a user study assessing human understandability of the
extracted perspectives. Based on the results, we conclude that joint topic
models such as TAM can discover perspectives that align with human judgments.
Moreover, our results suggest that users are not influenced by their
pre-existing stance on the topic of abortion when interpreting the output of
topic models.
","[{'version': 'v1', 'created': 'Fri, 23 Oct 2020 16:13:06 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Apr 2021 20:28:16 GMT'}]",2021-04-30,"[['Draws', 'Tim', ''], ['Liu', 'Jody', ''], ['Tintarev', 'Nava', '']]","['sentiment analysis', 'topic modeling', 'joint topic models', 'debated topics', 'perspective discovery']"
7383,1911.01658,Guoqiang Wu,"Guoqiang Wu, Ruobing Zheng, Yingjie Tian, Dalian Liu","Joint Ranking SVM and Binary Relevance with Robust Low-Rank Learning for
  Multi-Label Classification","57 pages, 5 figures, to be published in the journal of Neural
  Networks","Neural Networks, 2020, 122: 24-39",10.1016/j.neunet.2019.10.002,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-label classification studies the task where each example belongs to
multiple labels simultaneously. As a representative method, Ranking Support
Vector Machine (Rank-SVM) aims to minimize the Ranking Loss and can also
mitigate the negative influence of the class-imbalance issue. However, due to
its stacking-style way for thresholding, it may suffer error accumulation and
thus reduces the final classification performance. Binary Relevance (BR) is
another typical method, which aims to minimize the Hamming Loss and only needs
one-step learning. Nevertheless, it might have the class-imbalance issue and
does not take into account label correlations. To address the above issues, we
propose a novel multi-label classification model, which joints Ranking support
vector machine and Binary Relevance with robust Low-rank learning (RBRL). RBRL
inherits the ranking loss minimization advantages of Rank-SVM, and thus
overcomes the disadvantages of BR suffering the class-imbalance issue and
ignoring the label correlations. Meanwhile, it utilizes the hamming loss
minimization and one-step learning advantages of BR, and thus tackles the
disadvantages of Rank-SVM including another thresholding learning step.
Besides, a low-rank constraint is utilized to further exploit high-order label
correlations under the assumption of low dimensional label space. Furthermore,
to achieve nonlinear multi-label classifiers, we derive the kernelization RBRL.
Two accelerated proximal gradient methods (APG) are used to solve the
optimization problems efficiently. Extensive comparative experiments with
several state-of-the-art methods illustrate a highly competitive or superior
performance of our method RBRL.
","[{'version': 'v1', 'created': 'Tue, 5 Nov 2019 07:50:36 GMT'}]",2019-11-06,"[['Wu', 'Guoqiang', ''], ['Zheng', 'Ruobing', ''], ['Tian', 'Yingjie', ''], ['Liu', 'Dalian', '']]","['Multi-Label Classification', 'Rank-SVM', 'Binary Relevance', 'Robust']"
7384,1904.07657,Martin Do\v{s}k\'a\v{r},"Martin Do\v{s}k\'a\v{r} (1), Jan Zeman (1 and 2), Daniel Rypl (1), Jan
  Nov\'ak (1) ((1) Faculty of Civil Engineering, Czech Technical University in
  Prague, (2) Institute of Information Theory and Automation)","Level-set based design of Wang tiles for modelling complex
  microstructures","16 pages, 16 figures. Abstract has been shortened to match the
  arXiv.org's limit of 1920 characters",Computer-Aided Design 123 (2020) 102827,10.1016/j.cad.2020.102827,,cs.CG cond-mat.mtrl-sci,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Microstructural geometry plays a critical role in the response of
heterogeneous materials. Consequently, methods for generating microstructural
samples are increasingly crucial to advanced numerical analyses. We extend
Sonon et al.'s unified framework, developed originally for generating
particulate and foam-like microstructural geometries of Periodic Unit Cells, to
non-periodic microstructural representations based on the formalism of Wang
tiles. This formalism has been recently proposed in order to generalize the
Periodic Unit Cell approach, enabling a fast synthesis of arbitrarily large,
stochastic microstructural samples from a handful of domains with predefined
compatibility constraints. However, a robust procedure capable of designing
complex, three-dimensional, foam-like and cellular morphologies of Wang tiles
has not yet been proposed. This contribution fills the gap by significantly
broadening the applicability of the tiling concept.
  Since the original Sonon et al.'s framework builds on a random sequential
addition of particles enhanced with an implicit representation of particle
boundaries by the level-set field, we first devise an analysis based on a
connectivity graph of a tile set, resolving the question where a particle
should be copied when it intersects a tile boundary. Next, we introduce several
modifications to the original algorithm that are necessary to ensure
microstructural compatibility in the generalized periodicity setting of Wang
tiles. Having established a universal procedure for generating tile
morphologies, we compare strictly aperiodic and stochastic sets with the same
cardinality in terms of reducing the artificial periodicity in reconstructed
microstructural samples. We demonstrate the superiority of the vertex-defined
tile sets for two-dimensional problems and illustrate the capabilities of the
algorithm with two- and three-dimensional examples.
","[{'version': 'v1', 'created': 'Fri, 22 Mar 2019 11:36:52 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Mar 2020 18:43:40 GMT'}]",2020-03-13,"[['Doškář', 'Martin', '', '1 and 2'], ['Zeman', 'Jan', '', '1 and 2'], ['Rypl', 'Daniel', ''], ['Novák', 'Jan', '']]","['Microstructure generation', 'Random heterogeneous materials', 'Wang tiling', 'Level sets', 'Foammicrostructures', 'Cellular microstructures']"
7385,2010.01569,Bill Verplank,"Bill Verplank, Craig Sapp, and Max Mathews",A Course on Controllers,"Proceedings of the International Conference on New Interfaces for
  Musical Expression, 2001",,10.5281/zenodo.1176380,,cs.HC cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Over the last four years, we have developed a series of lectures, labs and
project assignments aimed at introducing enough technology so that students
from a mix of disciplines can design and build innovative interface devices.
","[{'version': 'v1', 'created': 'Sun, 4 Oct 2020 12:55:18 GMT'}]",2020-10-06,"[['Verplank', 'Bill', ''], ['Sapp', 'Craig', ''], ['Mathews', 'Max', '']]","['Input devices', 'music controllers', 'CHI technology', 'courses']"
7386,2011.09426,Javier Fernandez,"Javier Fernandez (1 and 2), Luke Bornn (3), Daniel Cervone (4) ((1)
  Polytechnic University of Catalonia, (2) FC Barcelona, (3) Simon Fraser
  University, (4) Zelus Analytics)","A framework for the fine-grained evaluation of the instantaneous
  expected value of soccer possessions","35 pages, 12 figures",,10.1007/s10994-021-05989-6,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The expected possession value (EPV) of a soccer possession represents the
likelihood of a team scoring or receiving the next goal at any time instance.
By decomposing the EPV into a series of subcomponents that are estimated
separately, we develop a comprehensive analysis framework providing soccer
practitioners with the ability to evaluate the impact of both observed and
potential actions. We show we can obtain calibrated models for all the
components of EPV, including a set of yet-unexplored problems in soccer. We
produce visually-interpretable probability surfaces for potential passes from a
series of deep neural network architectures that learn from low-level
spatiotemporal data. Additionally, we present a series of novel practical
applications providing coaches with an enriched interpretation of specific game
situations.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2020 17:51:22 GMT'}]",2021-08-05,"[['Fernandez', 'Javier', '', '1 and 2'], ['Bornn', 'Luke', ''], ['Cervone', 'Daniel', '']]","['Deep Learning', 'Sports Analytics', 'Spatiotemporal Statistics', 'Convolutional Neural Networks']"
7387,2208.11890,Mostafa Eghbali Zarch,"Mostafa Eghbali Zarch, Reece Neff, Michela Becchi",Exploring Thread Coarsening on FPGA,,,10.1109/HIPC53243.2021.00062,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the past few years, there has been an increased interest in including
FPGAs in data centers and high-performance computing clusters along with GPUs
and other accelerators. As a result, it has become increasingly important to
have a unified, high-level programming interface for CPUs, GPUs and FPGAs. This
has led to the development of compiler toolchains to deploy OpenCL code on
FPGA. However, the fundamental architectural differences between GPUs and FPGAs
have led to performance portability issues: it has been shown that OpenCL code
optimized for GPU does not necessarily map well to FPGA, often requiring manual
optimizations to improve performance. In this paper, we explore the use of
thread coarsening - a compiler technique that consolidates the work of multiple
threads into a single thread - on OpenCL code running on FPGA. While this
optimization has been explored on CPU and GPU, the architectural features of
FPGAs and the nature of the parallelism they offer lead to different
performance considerations, making an analysis of thread coarsening on FPGA
worthwhile. Our evaluation, performed on our microbenchmarks and on a set of
applications from open-source benchmark suites, shows that thread coarsening
can yield performance benefits (up to 3-4x speedups) to OpenCL code running on
FPGA at a limited resource utilization cost.
","[{'version': 'v1', 'created': 'Thu, 25 Aug 2022 06:41:46 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Sep 2022 20:49:41 GMT'}]",2022-09-14,"[['Zarch', 'Mostafa Eghbali', ''], ['Neff', 'Reece', ''], ['Becchi', 'Michela', '']]","['OpenCL', 'FPGA', 'high-level synthesis', 'compiler']"
7388,1809.06209,Ahsan Tufail Mr.,"Ahsan Bin Tufail, Qiu-Na Zhang, Yong-Kui Ma","Binary Classification of Alzheimer Disease using sMRI Imaging modality
  and Deep Learning",,,10.1007/s10278-019-00265-5,,cs.CV cs.LG q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Alzheimer's disease (AD) is an irreversible devastative neurodegenerative
disorder associated with progressive impairment of memory and cognitive
functions. Its early diagnosis is crucial for the development of possible
future treatment option(s). Structural magnetic resonance images (sMRI) plays
an important role to help in understanding the anatomical changes related to AD
especially in its early stages. Conventional methods require the expertise of
domain experts and extract hand-picked features such as gray matter
substructures and train a classifier to distinguish AD subjects from healthy
subjects. Different from these methods, this paper proposes to construct
multiple deep 2D convolutional neural networks (2D-CNNs) to learn the various
features from local brain images which are combined to make the final
classification for AD diagnosis. The whole brain image was passed through two
transfer learning architectures; Inception version 3 and Xception; as well as
custom Convolutional Neural Network (CNN) built with the help of separable
convolutional layers which can automatically learn the generic features from
imaging data for classification. Our study is conducted using cross-sectional
T1-weighted structural MRI brain images from Open Access Series of Imaging
Studies (OASIS) database to maintain the size and contrast over different MRI
scans. Experimental results show that the transfer learning approaches exceed
the performance of non-transfer learning based approaches demonstrating the
effectiveness of these approaches for the binary AD classification task.
","[{'version': 'v1', 'created': 'Sun, 9 Sep 2018 01:46:37 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Mar 2020 14:02:39 GMT'}, {'version': 'v3', 'created': 'Fri, 3 Apr 2020 18:04:27 GMT'}]",2020-04-07,"[['Tufail', 'Ahsan Bin', ''], ['Zhang', 'Qiu-Na', ''], ['Ma', 'Yong-Kui', '']]","['Deep Learning', 'Transfer Learning', 'Artificial Neural Networks', 'Medical']"
7389,2206.05086,Benedikt Pago,Benedikt Pago,"Finite Model Theory and Proof Complexity revisited: Distinguishing
  graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus",Full version of a paper to appear at CSL 2023,,10.4230/LIPIcs.CSL.2023.8,,cs.LO cs.CC,http://creativecommons.org/licenses/by/4.0/,"  This paper extends prior work on the connections between logics from finite
model theory and propositional/algebraic proof systems. We show that if all
non-isomorphic graphs in a given graph class can be distinguished in the logic
Choiceless Polynomial Time with counting (CPT), then they can also be
distinguished in the bounded-degree extended polynomial calculus (EPC), and the
refutations have roughly the same size as the resource consumption of the
CPT-sentence. This allows to transfer lower bounds for EPC to CPT and thus
constitutes a new potential approach towards better understanding the limits of
CPT. A super-polynomial EPC lower bound for a PTIME-instance of the graph
isomorphism problem would separate CPT from PTIME and thus solve a major open
question in finite model theory. Further, using our result, we provide a model
theoretic proof for the separation of bounded-degree polynomial calculus and
bounded-degree extended polynomial calculus.
","[{'version': 'v1', 'created': 'Fri, 10 Jun 2022 13:24:35 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Nov 2022 14:44:48 GMT'}, {'version': 'v3', 'created': 'Fri, 4 Nov 2022 15:28:59 GMT'}]",2022-11-07,"[['Pago', 'Benedikt', '']]","['finite model theory', 'proof complexity', 'graph isomorphism']"
7390,2204.10641,Xinyu Ma,"Xinyu Ma, Jiafeng Guo, Ruqing Zhang, Yixing Fan and Xueqi Cheng","Pre-train a Discriminative Text Encoder for Dense Retrieval via
  Contrastive Span Prediction",Accepted to SIGIR 2022,,10.1145/3477495.3531772,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dense retrieval has shown promising results in many information retrieval
(IR) related tasks, whose foundation is high-quality text representation
learning for effective search. Some recent studies have shown that
autoencoder-based language models are able to boost the dense retrieval
performance using a weak decoder. However, we argue that 1) it is not
discriminative to decode all the input texts and, 2) even a weak decoder has
the bypass effect on the encoder. Therefore, in this work, we introduce a novel
contrastive span prediction task to pre-train the encoder alone, but still
retain the bottleneck ability of the autoencoder. % Therefore, in this work, we
propose to drop out the decoder and introduce a novel contrastive span
prediction task to pre-train the encoder alone. The key idea is to force the
encoder to generate the text representation close to its own random spans while
far away from others using a group-wise contrastive loss. In this way, we can
1) learn discriminative text representations efficiently with the group-wise
contrastive learning over spans and, 2) avoid the bypass effect of the decoder
thoroughly. Comprehensive experiments over publicly available retrieval
benchmark datasets show that our approach can outperform existing pre-training
methods for dense retrieval significantly.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2022 11:22:29 GMT'}]",2022-04-25,"[['Ma', 'Xinyu', ''], ['Guo', 'Jiafeng', ''], ['Zhang', 'Ruqing', ''], ['Fan', 'Yixing', ''], ['Cheng', 'Xueqi', '']]","['Dense Retrieval', 'Pre-training for IR', 'Discriminative Representation']"
7391,2005.12644,Jason R.C. Nurse Dr,Rahime Belen Saglam and Jason R. C. Nurse,Is your chatbot GDPR compliant? Open issues in agent design,,"CUI 2020: International Conference on Conversational User
  Interfaces, July, 2020",10.1145/3405755.3406131,,cs.CY cs.AI cs.HC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Conversational agents open the world to new opportunities for human
interaction and ubiquitous engagement. As their conversational abilities and
knowledge has improved, these agents have begun to have access to an increasing
variety of personally identifiable information and intimate details on their
user base. This access raises crucial questions in light of regulations as
robust as the General Data Protection Regulation (GDPR). This paper explores
some of these questions, with the aim of defining relevant open issues in
conversational agent design. We hope that this work can provoke further
research into building agents that are effective at user interaction, but also
respectful of regulations and user privacy.
","[{'version': 'v1', 'created': 'Tue, 26 May 2020 11:54:44 GMT'}]",2021-06-22,"[['Saglam', 'Rahime Belen', ''], ['Nurse', 'Jason R. C.', '']]","['Conversational agents', 'chatbot design', 'personal information', 'userprivacy', 'general data protection regulation (GDPR)']"
7392,2109.03655,Martin Ringsquandl,"Martin Ringsquandl, Evgeny Kharlamov, Daria Stepanova, Steffen
  Lamparter, Raffaello Lepratti, Ian Horrocks, Peer Kr\""oger",On Event-Driven Knowledge Graph Completion in Digital Factories,,2017 IEEE International Conference on Big Data (BIGDATA),10.1109/BigData.2017.8258105,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Smart factories are equipped with machines that can sense their manufacturing
environments, interact with each other, and control production processes.
Smooth operation of such factories requires that the machines and engineering
personnel that conduct their monitoring and diagnostics share a detailed common
industrial knowledge about the factory, e.g., in the form of knowledge graphs.
Creation and maintenance of such knowledge is expensive and requires
automation. In this work we show how machine learning that is specifically
tailored towards industrial applications can help in knowledge graph
completion. In particular, we show how knowledge completion can benefit from
event logs that are common in smart factories. We evaluate this on the
knowledge graph from a real world-inspired smart factory with encouraging
results.
","[{'version': 'v1', 'created': 'Wed, 8 Sep 2021 14:01:42 GMT'}]",2021-09-09,"[['Ringsquandl', 'Martin', ''], ['Kharlamov', 'Evgeny', ''], ['Stepanova', 'Daria', ''], ['Lamparter', 'Steffen', ''], ['Lepratti', 'Raffaello', ''], ['Horrocks', 'Ian', ''], ['Kröger', 'Peer', '']]","['Industrial Applications', 'Machine Leaning', 'Knowledge Graphs', 'Events', 'Manufacturing']"
7393,2004.02802,Marco Zennaro,"Marco Zennaro, Ermanno Pietrosemoli, Marco Rainone, Daniele Trinchero,
  Mattia Poletti, Giovanni Colucci",TROPPO LoRa: TROPospheric Personal Observatory using LoRa signals,,,10.1145/3410670.3410856,,cs.NI eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the growth of LoRa deployments there are plenty of anecdotal reports of
very long wireless links, well beyond the line of sight. Most reports suggest
that these links are related to anomalous tropospheric propagation. We
developed a platform to study tropospheric links based on TheThingsNetwork, a
popular LoRaWAN-based infrastructure. We present some preliminary results and
call for the IoT community to participate in this radio propagation experiment.
","[{'version': 'v1', 'created': 'Mon, 6 Apr 2020 16:49:47 GMT'}]",2020-10-23,"[['Zennaro', 'Marco', ''], ['Pietrosemoli', 'Ermanno', ''], ['Rainone', 'Marco', ''], ['Trinchero', 'Daniele', ''], ['Poletti', 'Mattia', ''], ['Colucci', 'Giovanni', '']]","['IoT', 'LoRa', 'LoRaWAN', 'TTN', 'radio propagation', 'tropospheric']"
7394,2301.01908,Roberto Figueroa Jr,"Roberto Bacani Figueroa Jr., Florinda Amparo Palma Gil, Hiroshi
  Taniguchi, Joshze Rica Esguerra","Virtual Reality Photo-based Tours for Teaching Filipino Vocabulary in an
  Online Class in Japan: Transitioning into the New Normal",,"International Journal in Information Technology in Governance,
  Education and Business, 4(1) (2022)",10.5281/zenodo.7505128,,cs.CY,http://creativecommons.org/licenses/by-sa/4.0/,"  When educational institutions worldwide scrambled for ways to continue their
classes during lockdowns caused by the COVID-19 pandemic, the use of
information and communication technology (ICT) for remote teaching has become
widely considered to be a potential solution. As universities raced to
implement emergency remote teaching (ERT) strategies in Japan, some have
explored innovative interventions other than webinar platforms and learning
management systems to bridge the gap caused by restricted mobility among
teachers and learners. One such innovation is virtual reality (VR). VR has been
changing the landscape of higher education because of its ability to ""teleport""
learners to various places by simulating real-world environments in the virtual
world. Some teachers, including the authors of this paper, explored integrating
VR into their activities to address issues caused by geographical limitations
brought about by the heightened restrictions in 2020. Results were largely
encouraging. However, rules started relaxing in the succeeding years as more
people got vaccinated. Thus, some fully online classes in Japan shifted to
blended learning as they moved toward fully returning to in-person classes
prompting educators to modify how they implemented their VR-based
interventions. This paper describes how a class of university students in Japan
who were taking a Filipino language course experienced a VR-based intervention
in blended mode, which was originally prototyped during the peak of the ERT
era. Moreover, adjustments and comparisons regarding methodological
idiosyncrasies and findings between the fully online iteration and the recently
implemented blended one are reported in detail.
","[{'version': 'v1', 'created': 'Thu, 5 Jan 2023 04:45:35 GMT'}]",2023-01-06,"[['Figueroa', 'Roberto Bacani', 'Jr.'], ['Gil', 'Florinda Amparo Palma', ''], ['Taniguchi', 'Hiroshi', ''], ['Esguerra', 'Joshze Rica', '']]","['virtual reality', 'immersive open pedagogies', 'immersive learning']"
7395,2007.11875,Simone Martini,"Simone Martini, Andrea Masini, Margherita Zorzi","From 2-sequents and Linear Nested Sequents to Natural Deduction for
  Normal Modal Logics",,,10.1145/3461661,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We extend to natural deduction the approach of Linear Nested Sequents and of
2-sequents. Formulas are decorated with a spatial coordinate, which allows a
formulation of formal systems in the original spirit of natural deduction --
only one introduction and one elimination rule per connective, no additional
(structural) rule, no explicit reference to the accessibility relation of the
intended Kripke models. We give systems for the normal modal logics from K to
S4. For the intuitionistic versions of the systems, we define proof reduction,
and prove proof normalization, thus obtaining a syntactical proof of
consistency. For logics K and K4 we use existence predicates (following Scott)
for formulating sound deduction rules.
","[{'version': 'v1', 'created': 'Thu, 23 Jul 2020 09:27:08 GMT'}, {'version': 'v2', 'created': 'Sat, 24 Apr 2021 20:53:15 GMT'}]",2021-04-27,"[['Martini', 'Simone', ''], ['Masini', 'Andrea', ''], ['Zorzi', 'Margherita', '']]","['natural deduction', 'normalization', 'intuitionistic logic', '2-sequents', 'linearnested sequents']"
7396,1804.00227,Milad Mozafari,"Milad Mozafari, Mohammad Ganjtabesh, Abbas Nowzari-Dalini, Simon J.
  Thorpe, Timoth\'ee Masquelier","Bio-inspired digit recognition using reward-modulated
  spike-timing-dependent plasticity in deep convolutional networks",Pattern Recognition (2019),,10.1016/j.patcog.2019.05.015,,cs.CV q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The primate visual system has inspired the development of deep artificial
neural networks, which have revolutionized the computer vision domain. Yet
these networks are much less energy-efficient than their biological
counterparts, and they are typically trained with backpropagation, which is
extremely data-hungry. To address these limitations, we used a deep
convolutional spiking neural network (DCSNN) and a latency-coding scheme. We
trained it using a combination of spike-timing-dependent plasticity (STDP) for
the lower layers and reward-modulated STDP (R-STDP) for the higher ones. In
short, with R-STDP a correct (resp. incorrect) decision leads to STDP (resp.
anti-STDP). This approach led to an accuracy of $97.2\%$ on MNIST, without
requiring an external classifier. In addition, we demonstrated that R-STDP
extracts features that are diagnostic for the task at hand, and discards the
other ones, whereas STDP extracts any feature that repeats. Finally, our
approach is biologically plausible, hardware friendly, and energy-efficient.
","[{'version': 'v1', 'created': 'Sat, 31 Mar 2018 23:35:12 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Feb 2019 09:26:35 GMT'}, {'version': 'v3', 'created': 'Mon, 27 May 2019 19:33:54 GMT'}]",2019-05-30,"[['Mozafari', 'Milad', ''], ['Ganjtabesh', 'Mohammad', ''], ['Nowzari-Dalini', 'Abbas', ''], ['Thorpe', 'Simon J.', ''], ['Masquelier', 'Timothée', '']]","['Spiking neural networks', 'Deeparchitecture', 'Digit recognition', 'STDP', 'Rewardmodulated STDP', 'Latency coding']"
7397,1711.08611,Yixing Fan,"Jiafeng Guo, Yixing Fan, Qingyao Ai, W. Bruce Croft",A Deep Relevance Matching Model for Ad-hoc Retrieval,"CIKM 2016, long paper",,10.1145/2983323.2983769,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, deep neural networks have led to exciting breakthroughs in
speech recognition, computer vision, and natural language processing (NLP)
tasks. However, there have been few positive results of deep models on ad-hoc
retrieval tasks. This is partially due to the fact that many important
characteristics of the ad-hoc retrieval task have not been well addressed in
deep models yet. Typically, the ad-hoc retrieval task is formalized as a
matching problem between two pieces of text in existing work using deep models,
and treated equivalent to many NLP tasks such as paraphrase identification,
question answering and automatic conversation. However, we argue that the
ad-hoc retrieval task is mainly about relevance matching while most NLP
matching tasks concern semantic matching, and there are some fundamental
differences between these two matching tasks. Successful relevance matching
requires proper handling of the exact matching signals, query term importance,
and diverse matching requirements. In this paper, we propose a novel deep
relevance matching model (DRMM) for ad-hoc retrieval. Specifically, our model
employs a joint deep architecture at the query term level for relevance
matching. By using matching histogram mapping, a feed forward matching network,
and a term gating network, we can effectively deal with the three relevance
matching factors mentioned above. Experimental results on two representative
benchmark collections show that our model can significantly outperform some
well-known retrieval models as well as state-of-the-art deep matching models.
","[{'version': 'v1', 'created': 'Thu, 23 Nov 2017 08:29:22 GMT'}]",2017-11-27,"[['Guo', 'Jiafeng', ''], ['Fan', 'Yixing', ''], ['Ai', 'Qingyao', ''], ['Croft', 'W. Bruce', '']]","['Relevance Matching', 'Semantic Matching', 'Neural Models', 'Ad-hoc Retrieval', 'Ranking Models']"
7398,2006.00630,Antonio M. Sudoso,"Paolo Mancuso, Veronica Piccialli, Antonio M. Sudoso",A machine learning approach for forecasting hierarchical time series,,"Expert Systems with Applications 182, 2021, 115102",10.1016/j.eswa.2021.115102,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a machine learning approach for forecasting
hierarchical time series. When dealing with hierarchical time series, apart
from generating accurate forecasts, one needs to select a suitable method for
producing reconciled forecasts. Forecast reconciliation is the process of
adjusting forecasts to make them coherent across the hierarchy. In literature,
coherence is often enforced by using a post-processing technique on the base
forecasts produced by suitable time series forecasting methods. On the
contrary, our idea is to use a deep neural network to directly produce accurate
and reconciled forecasts. We exploit the ability of a deep neural network to
extract information capturing the structure of the hierarchy. We impose the
reconciliation at training time by minimizing a customized loss function. In
many practical applications, besides time series data, hierarchical time series
include explanatory variables that are beneficial for increasing the
forecasting accuracy. Exploiting this further information, our approach links
the relationship between time series features extracted at any level of the
hierarchy and the explanatory variables into an end-to-end neural network
providing accurate and reconciled point forecasts. The effectiveness of the
approach is validated on three real-world datasets, where our method
outperforms state-of-the-art competitors in hierarchical forecasting.
","[{'version': 'v1', 'created': 'Sun, 31 May 2020 22:26:16 GMT'}, {'version': 'v2', 'created': 'Mon, 3 May 2021 14:13:07 GMT'}]",2021-07-12,"[['Mancuso', 'Paolo', ''], ['Piccialli', 'Veronica', ''], ['Sudoso', 'Antonio M.', '']]","['Hierarchical Time Series', 'Forecast', 'Machine Learning', 'DeepNeural Network']"
7399,2203.17063,Roman Iakymchuk,"Roman Iakymchuk, Amandio Faustino, Andrew Emerson, Joao Barreto,
  Valeria Bartsch, Rodrigo Rodrigues, Jose C. Monteiro",Efficient and Eventually Consistent Collective Operations,,,10.1109/IPDPSW52791.2021.00096,,cs.DC cs.PL,http://creativecommons.org/licenses/by/4.0/,"  Collective operations are common features of parallel programming models that
are frequently used in High-Performance (HPC) and machine/ deep learning (ML/
DL) applications. In strong scaling scenarios, collective operations can
negatively impact the overall application performance: with the increase in
core count, the load per rank decreases, while the time spent in collective
operations increases logarithmically.
  In this article, we propose a design for eventually consistent collectives
suitable for ML/ DL computations by reducing communication in Broadcast and
Reduce, as well as by exploring the Stale Synchronous Parallel (SSP)
synchronization model for the Allreduce collective. Moreover, we also enrich
the GASPI ecosystem with frequently used classic/ consistent collective
operations -- such as Allreduce for large messages and AlltoAll used in an HPC
code. Our implementations show promising preliminary results with significant
improvements, especially for Allreduce and AlltoAll, compared to the
vendor-provided MPI alternatives.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2022 14:33:24 GMT'}]",2022-04-01,"[['Iakymchuk', 'Roman', ''], ['Faustino', 'Amandio', ''], ['Emerson', 'Andrew', ''], ['Barreto', 'Joao', ''], ['Bartsch', 'Valeria', ''], ['Rodrigues', 'Rodrigo', ''], ['Monteiro', 'Jose C.', '']]","['Collectives', 'Allreduce', 'AlltoAll', 'Stale SynchronousParallel', 'GASPI']"
7400,2005.11634,Ang Li,"Ang Li, Wei Du, Qinghua Li",PoliteCamera: Respecting Strangers' Privacy in Mobile Photographing,,,10.1007/978-3-030-01701-9_13,,cs.CR cs.CV cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Camera is a standard on-board sensor of modern mobile phones. It makes photo
taking popular due to its convenience and high resolution. However, when users
take a photo of a scenery, a building or a target person, a stranger may also
be unintentionally captured in the photo. Such photos expose the location and
activity of strangers, and hence may breach their privacy. In this paper, we
propose a cooperative mobile photographing scheme called PoliteCamera to
protect strangers' privacy. Through the cooperation between a photographer and
a stranger, the stranger's face in a photo can be automatically blurred upon
his request when the photo is taken. Since multiple strangers nearby the
photographer might send out blurring requests but not all of them are in the
photo, an adapted balanced convolutional neural network (ABCNN) is proposed to
determine whether the requesting stranger is in the photo based on facial
attributes. Evaluations demonstrate that the ABCNN can accurately predict
facial attributes and PoliteCamera can provide accurate privacy protection for
strangers.
","[{'version': 'v1', 'created': 'Sun, 24 May 2020 01:18:13 GMT'}]",2020-05-26,"[['Li', 'Ang', ''], ['Du', 'Wei', ''], ['Li', 'Qinghua', '']]","['Mobile Phone', 'Photo', 'Privacy']"
7401,2005.00179,Daniel Frishberg,"David Eppstein, Daniel Frishberg, and William Maxwell",On the treewidth of Hanoi graphs,"- To be published in the Proceedings of the Tenth International
  Conference on Fun with Algorithms (FUN 2020). - 22 pages (including title
  page, bibliography, and appendix). - Five figures","Theor. Comput. Sci. 906: 1-17, 2022",10.1016/j.tcs.2021.12.014,,cs.DM math.CO,http://creativecommons.org/licenses/by/4.0/,"  The objective of the well-known Towers of Hanoi puzzle is to move a set of
disks one at a time from one of a set of pegs to another, while keeping the
disks sorted on each peg. We propose an adversarial variation in which the
first player forbids a set of states in the puzzle, and the second player must
then convert one randomly-selected state to another without passing through
forbidden states. Analyzing this version raises the question of the treewidth
of Hanoi graphs. We find this number exactly for three-peg puzzles and provide
nearly-tight asymptotic bounds for larger numbers of pegs.
","[{'version': 'v1', 'created': 'Fri, 1 May 2020 02:14:44 GMT'}]",2022-05-30,"[['Eppstein', 'David', ''], ['Frishberg', 'Daniel', ''], ['Maxwell', 'William', '']]","['Hanoi graph', 'Treewidth', 'Graph separators', 'Kneser graph', 'Vertex expansion', 'Haven', 'Tensor product']"
7402,2203.15789,Patrick Poirson,"Hao-Ming Fu, Patrick Poirson, Kwot Sin Lee, Chen Wang","Revisiting Neighborhood-based Link Prediction for Collaborative
  Filtering",Accepted by Graph Learning Workshop at WWW'22,,10.1145/3487553.3524712,,cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Collaborative filtering (CF) is one of the most successful and fundamental
techniques in recommendation systems. In recent years, Graph Neural Network
(GNN)-based CF models, such as NGCF [31], LightGCN [10] and GTN [9] have
achieved tremendous success and significantly advanced the state-of-the-art.
While there is a rich literature of such works using advanced models for
learning user and item representations separately, item recommendation is
essentially a link prediction problem between users and items. Furthermore,
while there have been early works employing link prediction for collaborative
filtering [5, 6], this trend has largely given way to works focused on
aggregating information from user and item nodes, rather than modeling links
directly. In this paper, we propose a new linkage (connectivity) score for
bipartite graphs, generalizing multiple standard link prediction methods. We
combine this new score with an iterative degree update process in the user-item
interaction bipartite graph to exploit local graph structures without any node
modeling. The result is a simple, non-deep learning model with only six
learnable parameters. Despite its simplicity, we demonstrate our approach
significantly outperforms existing state-of-the-art GNN-based CF approaches on
four widely used benchmarks. In particular, on Amazon-Book, we demonstrate an
over 60% improvement for both Recall and NDCG. We hope our work would invite
the community to revisit the link prediction aspect of collaborative filtering,
where significant performance gains could be achieved through aligning link
prediction with item recommendations.
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2022 17:48:05 GMT'}]",2022-03-30,"[['Fu', 'Hao-Ming', ''], ['Poirson', 'Patrick', ''], ['Lee', 'Kwot Sin', ''], ['Wang', 'Chen', '']]","['Collaborative Filtering', 'Recommender Systems', 'Link Prediction']"
7403,2206.15465,Zijie Wang,"Zijie J. Wang, Alex Kale, Harsha Nori, Peter Stella, Mark E. Nunnally,
  Duen Horng Chau, Mihaela Vorvoreanu, Jennifer Wortman Vaughan, Rich Caruana","Interpretability, Then What? Editing Machine Learning Models to Reflect
  Human Knowledge and Values","Accepted at KDD 2022. 11 pages, 19 figures. For a demo video, see
  https://youtu.be/D6whtfInqTc. For a live demo, visit
  https://interpret.ml/gam-changer",,10.1145/3534678.3539074,,cs.LG cs.AI cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Machine learning (ML) interpretability techniques can reveal undesirable
patterns in data that models exploit to make predictions--potentially causing
harms once deployed. However, how to take action to address these patterns is
not always clear. In a collaboration between ML and human-computer interaction
researchers, physicians, and data scientists, we develop GAM Changer, the first
interactive system to help domain experts and data scientists easily and
responsibly edit Generalized Additive Models (GAMs) and fix problematic
patterns. With novel interaction techniques, our tool puts interpretability
into action--empowering users to analyze, validate, and align model behaviors
with their knowledge and values. Physicians have started to use our tool to
investigate and fix pneumonia and sepsis risk prediction models, and an
evaluation with 7 data scientists working in diverse domains highlights that
our tool is easy to use, meets their model editing needs, and fits into their
current workflows. Built with modern web technologies, our tool runs locally in
users' web browsers or computational notebooks, lowering the barrier to use.
GAM Changer is available at the following public demo link:
https://interpret.ml/gam-changer.
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2022 17:57:12 GMT'}]",2022-07-01,"[['Wang', 'Zijie J.', ''], ['Kale', 'Alex', ''], ['Nori', 'Harsha', ''], ['Stella', 'Peter', ''], ['Nunnally', 'Mark E.', ''], ['Chau', 'Duen Horng', ''], ['Vorvoreanu', 'Mihaela', ''], ['Vaughan', 'Jennifer Wortman', ''], ['Caruana', 'Rich', '']]","['Interpretability', 'Model Editing', 'Accountability', 'Human Agency']"
7404,2012.11120,Lijun Sun,"L. J. Sun (1 and 2), Q. Yang (1), X. Chen (3), Z. X. Chen (2) ((1)
  College of Information Science and Technology, Qingdao University of Science
  & Technology, Qingdao, China, (2) Shandong Provincial Key Laboratory of
  Network Based Intelligent Computing, University of Jinan, China, (3) School
  of Informatics, University of Edinburgh, Edinburgh, UK)","RC-chain: Reputation-based Crowdsourcing Blockchain for Vehicular
  Networks",,,10.1016/j.jnca.2020.102956,,cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  As the commercial use of 5G technologies has grown more prevalent, smart
vehicles have become an efficient platform for delivering a wide array of
services directly to customers. The vehicular crowdsourcing service (VCS), for
example, can provide immediate and timely feedback to the user regarding
real-time transportation information. However, different sources can generate
spurious information towards a specific service request in the pursuit of
profit. Distinguishing trusted information from numerous sources is the key to
a reliable VCS platform. This paper proposes a solution to this problem called
""RC-chain"", a reputation-based crowdsourcing framework built on a blockchain
platform (Hyperledger Fabric). We first establish the blockchain-based platform
to support the management of crowdsourcing trading and user-reputation
evaluating activities. A reputation model, the Trust Propagation \& Feedback
Similarity (TPFS), then calculates the reputation values of participants and
reveals any malicious behavior accordingly. Finally, queueing theory is used to
evaluate the blockchain-based platform and optimize the system performance. The
proposed framework was deployed on the IBM Hyperledger Fabric platform to
observe its real-world running time, effectiveness, and overall performance.
","[{'version': 'v1', 'created': 'Mon, 21 Dec 2020 04:59:00 GMT'}]",2020-12-22,"[['Sun', 'L. J.', '', '1 and 2'], ['Yang', 'Q.', ''], ['Chen', 'X.', ''], ['Chen', 'Z. X.', '']]","['Crowdsourcing', 'Reputation Management', 'Vehicular Networks', 'Blockchain', 'Hyperledger Fabric', 'Queueing Theory']"
7405,cs/0404035,Andreas Mielke,Andreas Mielke,Elements for Response Time Statistics in ERP Transaction Systems,"revtex, twocolumn, 8 pages, 13 figures. figures replaced by coloured
  versions","Performance Evaluation 64, 635-653 (2006)",10.1016/j.peva.2005.05.006,,cs.PF,,"  We present some measurements and ideas for response time statistics in ERP
systems. It is shown that the response time distribution of a given transaction
in a given system is generically a log-normal distribution or, in some
situations, a sum of two or more log-normal distributions. We present some
arguments for this form of the distribution based on heuristic rules for
response times, and we show data from performance measurements in actual
systems to support the log-normal form. Deviations of the log-normal form can
often be traced back to performance problems in the system. Consequences for
the interpretation of response time data and for service level agreements are
discussed.
","[{'version': 'v1', 'created': 'Fri, 16 Apr 2004 16:03:05 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Apr 2004 16:05:09 GMT'}, {'version': 'v3', 'created': 'Mon, 16 May 2005 21:22:10 GMT'}]",2007-05-23,"[['Mielke', 'Andreas', '']]","['ERP system', 'performance', 'response times', 'response-time distribution']"
7406,2204.12841,Kaziwa Saleh,"Kaziwa Saleh, Zoltan Vamossy","BBBD: Bounding Box Based Detector for Occlusion Detection and Order
  Recovery","7 pages, 4 figures","In Proceedings of the 2nd International Conference on Image
  Processing and Vision Engineering (IMPROVE 2022), pages 78-84, ISBN:
  978-989-758-563-0",10.5220/0000159200003209,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Occlusion handling is one of the challenges of object detection and
segmentation, and scene understanding. Because objects appear differently when
they are occluded in varying degree, angle, and locations. Therefore,
determining the existence of occlusion between objects and their order in a
scene is a fundamental requirement for semantic understanding. Existing works
mostly use deep learning based models to retrieve the order of the instances in
an image or for occlusion detection. This requires labelled occluded data and
it is time consuming. In this paper, we propose a simpler and faster method
that can perform both operations without any training and only requires the
modal segmentation masks. For occlusion detection, instead of scanning the two
objects entirely, we only focus on the intersected area between their bounding
boxes. Similarly, we use the segmentation mask inside the same area to recover
the depth-ordering. When tested on COCOA dataset, our method achieves +8% and
+5% more accuracy than the baselines in order recovery and occlusion detection
respectively.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2022 10:56:18 GMT'}]",2022-04-28,"[['Saleh', 'Kaziwa', ''], ['Vamossy', 'Zoltan', '']]","['Occlusion Handling', 'Object Detection', 'Amodal Segmentation', 'Depth Ordering', 'Occlusion Ordering', 'PartialOcclusion']"
7407,1702.07482,Yunjin Chen,"Wensen Feng, Yunjin Chen",Speckle Reduction with Trained Nonlinear Diffusion Filtering,"to appear in Journal of Mathematical Imaging and Vision. Demo codes
  are available from https://1drv.ms/u/s!ApXF85Oq1kvqgcscP8GqUvPE-dF7ig",,10.1007/s10851-016-0697-x,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Speckle reduction is a prerequisite for many image processing tasks in
synthetic aperture radar (SAR) images, as well as all coherent images. In
recent years, predominant state-of-the-art approaches for despeckling are
usually based on nonlocal methods which mainly concentrate on achieving utmost
image restoration quality, with relatively low computational efficiency.
Therefore, in this study we aim to propose an efficient despeckling model with
both high computational efficiency and high recovery quality. To this end, we
exploit a newly-developed trainable nonlinear reaction diffusion(TNRD)
framework which has proven a simple and effective model for various image
restoration problems. {In the original TNRD applications, the diffusion network
is usually derived based on the direct gradient descent scheme. However, this
approach will encounter some problem for the task of multiplicative noise
reduction exploited in this study. To solve this problem, we employed a new
architecture derived from the proximal gradient descent method.} {Taking into
account the speckle noise statistics, the diffusion process for the despeckling
task is derived. We then retrain all the model parameters in the presence of
speckle noise. Finally, optimized nonlinear diffusion filtering models are
obtained, which are specialized for despeckling with various noise levels.
Experimental results substantiate that the trained filtering models provide
comparable or even better results than state-of-the-art nonlocal approaches.
Meanwhile, our proposed model merely contains convolution of linear filters
with an image, which offers high level parallelism on GPUs. As a consequence,
for images of size $512 \times 512$, our GPU implementation takes less than 0.1
seconds to produce state-of-the-art despeckling performance.}
","[{'version': 'v1', 'created': 'Fri, 24 Feb 2017 07:34:31 GMT'}]",2017-02-27,"[['Feng', 'Wensen', ''], ['Chen', 'Yunjin', '']]","['Despeckling', 'optimized nonlinear reaction diffusion model', 'convolutionalneural networks', 'trainable activation function']"
7408,2109.09056,Susan Mniszewski,"Susan M Mniszewski, James Belak, Jean-Luc Fattebert, Christian FA
  Negre, Stuart R Slattery, Adetokunbo A Adedoyin, Robert F Bird, Choongseok
  Chang, Guangye Chen, Stephane Ethier, Shane Fogerty, Salman Habib, Christoph
  Junghans, Damien Lebrun-Grandie, Jamaludin Mohd-Yusof, Stan G Moore, Daniel
  Osei-Kuffuor, Steven J Plimpton, Adrian Pope, Samuel Temple Reeve, Lee
  Ricketson, Aaron Scheinberg, Amil Y Sharma and Michael E Wall",Enabling particle applications for exascale computing platforms,"26 pages, 17 figures",,10.1177/10943420211022829,LA-UR-20-26599,cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The Exascale Computing Project (ECP) is invested in co-design to assure that
key applications are ready for exascale computing. Within ECP, the Co-design
Center for Particle Applications (CoPA) is addressing challenges faced by
particle-based applications across four sub-motifs: short-range
particle-particle interactions (e.g., those which often dominate molecular
dynamics (MD) and smoothed particle hydrodynamics (SPH) methods), long-range
particle-particle interactions (e.g., electrostatic MD and gravitational
N-body), particle-in-cell (PIC) methods, and linear-scaling electronic
structure and quantum molecular dynamics (QMD) algorithms. Our crosscutting
co-designed technologies fall into two categories: proxy applications (or apps)
and libraries. Proxy apps are vehicles used to evaluate the viability of
incorporating various types of algorithms, data structures, and
architecture-specific optimizations and the associated trade-offs; examples
include ExaMiniMD, CabanaMD, CabanaPIC, and ExaSP2. Libraries are modular
instantiations that multiple applications can utilize or be built upon; CoPA
has developed the Cabana particle library, PROGRESS/BML libraries for QMD, and
the SWFFT and fftMPI parallel FFT libraries. Success is measured by
identifiable lessons learned that are translated either directly into parent
production application codes or into libraries, with demonstrated performance
and/or productivity improvement. The libraries and their use in CoPA's ECP
application partner codes are also addressed.
","[{'version': 'v1', 'created': 'Sun, 19 Sep 2021 04:05:36 GMT'}]",2021-09-21,"[['Mniszewski', 'Susan M', ''], ['Belak', 'James', ''], ['Fattebert', 'Jean-Luc', ''], ['Negre', 'Christian FA', ''], ['Slattery', 'Stuart R', ''], ['Adedoyin', 'Adetokunbo A', ''], ['Bird', 'Robert F', ''], ['Chang', 'Choongseok', ''], ['Chen', 'Guangye', ''], ['Ethier', 'Stephane', ''], ['Fogerty', 'Shane', ''], ['Habib', 'Salman', ''], ['Junghans', 'Christoph', ''], ['Lebrun-Grandie', 'Damien', ''], ['Mohd-Yusof', 'Jamaludin', ''], ['Moore', 'Stan G', ''], ['Osei-Kuffuor', 'Daniel', ''], ['Plimpton', 'Steven J', ''], ['Pope', 'Adrian', ''], ['Reeve', 'Samuel Temple', ''], ['Ricketson', 'Lee', ''], ['Scheinberg', 'Aaron', ''], ['Sharma', 'Amil Y', ''], ['Wall', 'Michael E', '']]","['co-design for exascale', 'particle applications', 'Cabana particle toolkit', 'PROGRESS/BML for electronic structure', 'performance portability across architectures']"
7409,2202.08406,Christine Lee,"Christine P Lee, Bengisu Cagiltay, and Bilge Mutlu","The Unboxing Experience: Exploration and Design of Initial Interactions
  Between Children and Social Robots","To be published in 2022 CHI Conference on Human Factors in Computing
  Systems (CHI '22)","CHI Conference on Human Factors in Computing Systems (CHI '22),
  April 29-May 5, 2022, New Orleans, LA, USA",10.1145/3491102.3501955,,cs.RO cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social robots are increasingly introduced into children's lives as
educational and social companions, yet little is known about how these products
might best be introduced to their environments. The emergence of the ""unboxing""
phenomenon in media suggests that introduction is key to technology adoption
where initial impressions are made. To better understand this phenomenon toward
designing a positive unboxing experience in the context of social robots for
children, we conducted three field studies with families of children aged 8 to
13: (1) an exploratory free-play activity ($n=12$); (2) a co-design session
($n=11$) that informed the development of a prototype box and a curated
unboxing experience; and (3) a user study ($n=9$) that evaluated children's
experiences. Our findings suggest the unboxing experience of social robots can
be improved through the design of a creative aesthetic experience that engages
the child socially to guide initial interactions and foster a positive
child-robot relationship.
","[{'version': 'v1', 'created': 'Thu, 17 Feb 2022 02:15:49 GMT'}]",2022-05-06,"[['Lee', 'Christine P', ''], ['Cagiltay', 'Bengisu', ''], ['Mutlu', 'Bilge', '']]","['Participatory design', 'experience design', 'child-robot interaction', 'social robots', 'unboxing']"
7410,2104.10953,Shinpei Hayashi,"Aoi Takahashi, Natthawute Sae-Lim, Shinpei Hayashi, Motoshi Saeki",An Extensive Study on Smell-Aware Bug Localization,"19 pages, JSS","Journal of Systems and Software, 178(110986):1-17, 2021",10.1016/j.jss.2021.110986,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bug localization is an important aspect of software maintenance because it
can locate modules that should be changed to fix a specific bug. Our previous
study showed that the accuracy of the information retrieval (IR)-based bug
localization technique improved when used in combination with code smell
information. Although this technique showed promise, the study showed limited
usefulness because of the small number of: 1) projects in the dataset, 2) types
of smell information, and 3) baseline bug localization techniques used for
assessment. This paper presents an extension of our previous experiments on
Bench4BL, the largest bug localization benchmark dataset available for bug
localization. In addition, we generalized the smell-aware bug localization
technique to allow different configurations of smell information, which were
combined with various bug localization techniques. Our results confirmed that
our technique can improve the performance of IR-based bug localization
techniques for the class level even when large datasets are processed.
Furthermore, because of the optimized configuration of the smell information,
our technique can enhance the performance of most state-of-the-art bug
localization techniques.
","[{'version': 'v1', 'created': 'Thu, 22 Apr 2021 09:30:01 GMT'}]",2021-05-07,"[['Takahashi', 'Aoi', ''], ['Sae-Lim', 'Natthawute', ''], ['Hayashi', 'Shinpei', ''], ['Saeki', 'Motoshi', '']]","['bug localization', 'code smell', 'information retrieval']"
7411,1605.04201,Christian Lameiro,Christian Lameiro and Ignacio Santamaria and Peter J. Schreier,"Rate region boundary of the SISO Z-interference channel with improper
  signaling",,"IEEE Transactions on Communications, vol. 65, no. 3, pp. 1022-1034
  (March 2017)",10.1109/TCOMM.2016.2641948,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper provides a complete characterization of the boundary of an
achievable rate region, called the Pareto boundary, of the single-antenna Z
interference channel (Z-IC), when interference is treated as noise and users
transmit complex Gaussian signals that are allowed to be improper. By
considering the augmented complex formulation, we derive a necessary and
sufficient condition for improper signaling to be optimal. This condition is
stated as a threshold on the interference channel coefficient, which is a
function of the interfered user rate and which allows insightful
interpretations into the behavior of the achievable rates in terms of the
circularity coefficient (i.e., degree of impropriety). Furthermore, the optimal
circularity coefficient is provided in closed form. The simplicity of the
obtained characterization permits interesting insights into when and how
improper signaling outperforms proper signaling in the single-antenna Z-IC. We
also provide an in-depth discussion on the optimal strategies and the
properties of the Pareto boundary.
","[{'version': 'v1', 'created': 'Fri, 13 May 2016 14:55:04 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Jun 2017 12:18:49 GMT'}]",2017-06-26,"[['Lameiro', 'Christian', ''], ['Santamaria', 'Ignacio', ''], ['Schreier', 'Peter J.', '']]","['Improper signaling', 'Z interference channel', 'Paretoboundary']"
7412,2201.08441,Thomas Vogel,"Laura Wartschinski, Yannic Noller, Thomas Vogel, Timo Kehrer, Lars
  Grunske","VUDENC: Vulnerability Detection with Deep Learning on a Natural Codebase
  for Python",Accepted Manuscript,"Information and Software Technology, Volume 144, April 2022,
  106809",10.1016/j.infsof.2021.106809,,cs.CR cs.LG cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Context: Identifying potential vulnerable code is important to improve the
security of our software systems. However, the manual detection of software
vulnerabilities requires expert knowledge and is time-consuming, and must be
supported by automated techniques. Objective: Such automated vulnerability
detection techniques should achieve a high accuracy, point developers directly
to the vulnerable code fragments, scale to real-world software, generalize
across the boundaries of a specific software project, and require no or only
moderate setup or configuration effort. Method: In this article, we present
VUDENC (Vulnerability Detection with Deep Learning on a Natural Codebase), a
deep learning-based vulnerability detection tool that automatically learns
features of vulnerable code from a large and real-world Python codebase. VUDENC
applies a word2vec model to identify semantically similar code tokens and to
provide a vector representation. A network of long-short-term memory cells
(LSTM) is then used to classify vulnerable code token sequences at a
fine-grained level, highlight the specific areas in the source code that are
likely to contain vulnerabilities, and provide confidence levels for its
predictions. Results: To evaluate VUDENC, we used 1,009 vulnerability-fixing
commits from different GitHub repositories that contain seven different types
of vulnerabilities (SQL injection, XSS, Command injection, XSRF, Remote code
execution, Path disclosure, Open redirect) for training. In the experimental
evaluation, VUDENC achieves a recall of 78%-87%, a precision of 82%-96%, and an
F1 score of 80%-90%. VUDENC's code, the datasets for the vulnerabilities, and
the Python corpus for the word2vec model are available for reproduction.
Conclusions: Our experimental results suggest...
","[{'version': 'v1', 'created': 'Thu, 20 Jan 2022 20:29:22 GMT'}]",2022-01-24,"[['Wartschinski', 'Laura', ''], ['Noller', 'Yannic', ''], ['Vogel', 'Thomas', ''], ['Kehrer', 'Timo', ''], ['Grunske', 'Lars', '']]","['Static Analysis', 'Vulnerability Detection', 'Deep Learning', 'Long-Short-Term Memory Network', 'NaturalCodebase', 'Software Repository Mining']"
7413,2012.12302,Samuel Rivera,"Samuel Rivera, Joel Klipfel, Deborah Weeks","Flexible deep transfer learning by separate feature embeddings and
  manifold alignment",,,10.1117/12.2557063,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Object recognition is a key enabler across industry and defense. As
technology changes, algorithms must keep pace with new requirements and data.
New modalities and higher resolution sensors should allow for increased
algorithm robustness. Unfortunately, algorithms trained on existing labeled
datasets do not directly generalize to new data because the data distributions
do not match. Transfer learning (TL) or domain adaptation (DA) methods have
established the groundwork for transferring knowledge from existing labeled
source data to new unlabeled target datasets. However, current DA approaches
assume similar source and target feature spaces and suffer in the case of
massive domain shifts or changes in the feature space. Existing methods assume
the data are either the same modality, or can be aligned to a common feature
space. Therefore, most methods are not designed to support a fundamental domain
change such as visual to auditory data. We propose a novel deep learning
framework that overcomes this limitation by learning separate feature
extractions for each domain while minimizing the distance between the domains
in a latent lower-dimensional space. The alignment is achieved by considering
the data manifold along with an adversarial training procedure. We demonstrate
the effectiveness of the approach versus traditional methods with several
ablation experiments on synthetic, measured, and satellite image datasets. We
also provide practical guidelines for training the network while overcoming
vanishing gradients which inhibit learning in some adversarial training
settings.
","[{'version': 'v1', 'created': 'Tue, 22 Dec 2020 19:24:44 GMT'}]",2020-12-24,"[['Rivera', 'Samuel', ''], ['Klipfel', 'Joel', ''], ['Weeks', 'Deborah', '']]","['transfer learning', 'domain adaptation', 'adversarial learning', 'deep learning', 'machine learning', 'automatic target recognition', 'classification']"
7414,2007.09032,Abhijith Manchikanti Venkata,"Abhijith Manchikanti Venkata, Dinesh Reddy Jeeru, Vittal K.P","Design And Modelling An Attack on Multiplexer Based Physical Unclonable
  Function","5 pages, 6 figures ,Published with International Journal of
  Engineering Trends and Technology (IJETT)","International Journal of Engineering Trends and Technology
  68.6(2020):63-67",10.14445/22315381/IJETT-V68I6P210S,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  This paper deals with study of the physical unclonable functions and
specifically the design of arbiter based PUF (APUF) and extends the work on
different types of attacks on the PUF designs to break the security of the
device, which includes advanced computational algorithms. Machine learning (ML)
based attacks are successful in attacking existing designs. So in this, the
resistance of the modified, proposed design of APUF is examined by modelling
the attack based on the logistic regression a MLbased algorithm. The design is
validated on Basys-3 Artix -7 FPGA board with a part number (xc7a35tcpg236-1).
","[{'version': 'v1', 'created': 'Fri, 17 Jul 2020 14:54:04 GMT'}]",2020-07-20,"[['Venkata', 'Abhijith Manchikanti', ''], ['Jeeru', 'Dinesh Reddy', ''], ['P', 'Vittal K.', '']]","['PUF', 'Machine Learning', 'Verilog', 'FPGA', 'Logistic Regression', 'Hardware Security']"
7415,2206.12233,Giovanni Iacca,"Michele Tessari, Giovanni Iacca",Reinforcement learning based adaptive metaheuristics,"To appear in the Genetic and Evolutionary Computation Conference
  (GECCO) 2022, Companion Proceedings",,10.1145/3520304.3533983,,cs.NE cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Parameter adaptation, that is the capability to automatically adjust an
algorithm's hyperparameters depending on the problem being faced, is one of the
main trends in evolutionary computation applied to numerical optimization.
While several handcrafted adaptation policies have been proposed over the years
to address this problem, only few attempts have been done so far at applying
machine learning to learn such policies. Here, we introduce a general-purpose
framework for performing parameter adaptation in continuous-domain
metaheuristics based on state-of-the-art reinforcement learning algorithms. We
demonstrate the applicability of this framework on two algorithms, namely
Covariance Matrix Adaptation Evolution Strategies (CMA-ES) and Differential
Evolution (DE), for which we learn, respectively, adaptation policies for the
step-size (for CMA-ES), and the scale factor and crossover rate (for DE). We
train these policies on a set of 46 benchmark functions at different
dimensionalities, with various inputs to the policies, in two settings: one
policy per function, and one global policy for all functions. Compared,
respectively, to the Cumulative Step-size Adaptation (CSA) policy and to two
well-known adaptive DE variants (iDE and jDE), our policies are able to produce
competitive results in the majority of cases, especially in the case of DE.
","[{'version': 'v1', 'created': 'Fri, 24 Jun 2022 12:01:49 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jun 2022 14:48:01 GMT'}]",2022-06-30,"[['Tessari', 'Michele', ''], ['Iacca', 'Giovanni', '']]","['Evolutionary Algorithms', 'Reinforcement Learning', 'Adaptation', 'Algorithm Configuration']"
7416,1911.07649,Panagiotis Papadopoulos,"I\~nigo Querejeta-Azurmendi, Panagiotis Papadopoulos, Matteo Varvello,
  Antonio Nappa, Jiexin Zhang, Benjamin Livshits","ZKSENSE: A Friction-less Privacy-Preserving Human Attestation Mechanism
  for Mobile Devices",,Proceedings on Privacy Enhancing Technologies 2021,10.2478/popets-2021-0058,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Recent studies show that 20.4% of the internet traffic originates from
automated agents. To identify and block such ill-intentioned traffic,
mechanisms that verify the humanness of the user are widely deployed, with
CAPTCHAs being the most popular. Traditional CAPTCHAs require extra user effort
(e.g., solving mathematical puzzles), which can severely downgrade the
end-user's experience, especially on mobile, and provide sporadic humanness
verification of questionable accuracy. More recent solutions like Google's
reCAPTCHA v3, leverage user data, thus raising significant privacy concerns. To
address these issues, we present zkSENSE: the first zero-knowledge proof-based
humanness attestation system for mobile devices. zkSENSE moves the human
attestation to the edge: onto the user's very own device, where humanness of
the user is assessed in a privacy-preserving and seamless manner. zkSENSE
achieves this by classifying motion sensor outputs of the mobile device, based
on a model trained by using both publicly available sensor data and data
collected from a small group of volunteers. To ensure the integrity of the
process, the classification result is enclosed in a zero-knowledge proof of
humanness that can be safely shared with a remote server. We implement zkSENSE
as an Android service to demonstrate its effectiveness and practicality. In our
evaluation, we show that zkSENSE successfully verifies the humanness of a user
across a variety of attacking scenarios and demonstrates 92% accuracy. On a two
years old Samsung S9, zkSENSE's attestation takes around 3 seconds (when visual
CAPTCHAs need 9.8 seconds) and consumes a negligible amount of battery.
","[{'version': 'v1', 'created': 'Mon, 18 Nov 2019 14:04:11 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Jun 2020 11:14:17 GMT'}, {'version': 'v3', 'created': 'Thu, 4 Jun 2020 12:56:13 GMT'}, {'version': 'v4', 'created': 'Tue, 7 Sep 2021 10:54:31 GMT'}]",2021-09-08,"[['Querejeta-Azurmendi', 'Iñigo', ''], ['Papadopoulos', 'Panagiotis', ''], ['Varvello', 'Matteo', ''], ['Nappa', 'Antonio', ''], ['Zhang', 'Jiexin', ''], ['Livshits', 'Benjamin', '']]","['Human Attestation', 'Privacy Preserving BotDetection', 'Frictionless verification of humanness']"
7417,2012.05216,Furkan Gursoy,"Furkan Gursoy, Bertan Badur",Extracting the signed backbone of intrinsically dense weighted networks,,"Journal of Complex Networks, Volume 9, Issue 5, October 2021,
  cnab019",10.1093/comnet/cnab019,,cs.SI physics.soc-ph stat.AP,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Networks provide useful tools for analyzing diverse complex systems from
natural, social, and technological domains. Growing size and variety of data
such as more nodes and links and associated weights, directions, and signs can
provide accessory information. Link and weight abundance, on the other hand,
results in denser networks with noisy, insignificant, or otherwise redundant
data. Moreover, typical network analysis and visualization techniques
presuppose sparsity and are not appropriate or scalable for dense and weighted
networks. As a remedy, network backbone extraction methods aim to retain only
the important links while preserving the useful and elucidative structure of
the original networks for further analyses. Here, we provide the first methods
for extracting signed network backbones from intrinsically dense unsigned
unipartite weighted networks. Utilizing a null model based on statistical
techniques, the proposed significance filter and vigor filter allow inferring
edge signs. Empirical analysis on migration, voting, temporal interaction, and
species similarity networks reveals that the proposed filters extract
meaningful and sparse signed backbones while preserving the multiscale nature
of the network. The resulting backbones exhibit characteristics typically
associated with signed networks such as reciprocity, structural balance, and
community structure. The developed tool is provided as a free, open-source
software package.
","[{'version': 'v1', 'created': 'Wed, 9 Dec 2020 18:27:11 GMT'}, {'version': 'v2', 'created': 'Tue, 25 May 2021 10:57:12 GMT'}]",2022-03-01,"[['Gursoy', 'Furkan', ''], ['Badur', 'Bertan', '']]","['signed networks', 'backbone extraction', 'network sparsification', 'dense networks', 'weightednetworks', 'information filtering']"
7418,1910.05339,Chetan Bansal,"Chetan Bansal, Sundararajan Renganathan, Ashima Asudani, Olivier Midy,
  Mathru Janakiraman","DeCaf: Diagnosing and Triaging Performance Issues in Large-Scale Cloud
  Services","To be published in the proceedings of ICSE-SEIP '20, Seoul, Republic
  of Korea",,10.1145/3377813.3381353,,cs.DC cs.SE cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Large scale cloud services use Key Performance Indicators (KPIs) for tracking
and monitoring performance. They usually have Service Level Objectives (SLOs)
baked into the customer agreements which are tied to these KPIs. Dependency
failures, code bugs, infrastructure failures, and other problems can cause
performance regressions. It is critical to minimize the time and manual effort
in diagnosing and triaging such issues to reduce customer impact. Large volume
of logs and mixed type of attributes (categorical, continuous) in the logs
makes diagnosis of regressions non-trivial.
  In this paper, we present the design, implementation and experience from
building and deploying DeCaf, a system for automated diagnosis and triaging of
KPI issues using service logs. It uses machine learning along with pattern
mining to help service owners automatically root cause and triage performance
issues. We present the learnings and results from case studies on two large
scale cloud services in Microsoft where DeCaf successfully diagnosed 10 known
and 31 unknown issues. DeCaf also automatically triages the identified issues
by leveraging historical data. Our key insights are that for any such diagnosis
tool to be effective in practice, it should a) scale to large volumes of
service logs and attributes, b) support different types of KPIs and ranking
functions, c) be integrated into the DevOps processes.
","[{'version': 'v1', 'created': 'Fri, 11 Oct 2019 21:49:22 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Dec 2019 17:23:39 GMT'}, {'version': 'v3', 'created': 'Sat, 21 Dec 2019 16:01:25 GMT'}, {'version': 'v4', 'created': 'Wed, 1 Jan 2020 21:49:56 GMT'}, {'version': 'v5', 'created': 'Sun, 2 Feb 2020 08:19:52 GMT'}]",2020-02-04,"[['Bansal', 'Chetan', ''], ['Renganathan', 'Sundararajan', ''], ['Asudani', 'Ashima', ''], ['Midy', 'Olivier', ''], ['Janakiraman', 'Mathru', '']]","['performance analysis', 'root causing', 'machine learning', 'issue triaging', 'cloud services']"
7419,2006.11446,Nidhi Rastogi,"Nidhi Rastogi, Sharmishtha Dutta, Mohammed J. Zaki, Alex Gittens, and
  Charu Aggarwal",MALOnt: An Ontology for Malware Threat Intelligence,,,10.13140/RG.2.2.16426.64962,,cs.CR cs.AI cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Malware threat intelligence uncovers deep information about malware, threat
actors, and their tactics, Indicators of Compromise(IoC), and vulnerabilities
in different platforms from scattered threat sources. This collective
information can guide decision making in cyber defense applications utilized by
security operation centers(SoCs). In this paper, we introduce an open-source
malware ontology - MALOnt that allows the structured extraction of information
and knowledge graph generation, especially for threat intelligence. The
knowledge graph that uses MALOnt is instantiated from a corpus comprising
hundreds of annotated malware threat reports. The knowledge graph enables the
analysis, detection, classification, and attribution of cyber threats caused by
malware. We also demonstrate the annotation process using MALOnt on exemplar
threat intelligence reports. A work in progress, this research is part of a
larger effort towards auto-generation of knowledge graphs (KGs)for gathering
malware threat intelligence from heterogeneous online resources.
","[{'version': 'v1', 'created': 'Sat, 20 Jun 2020 00:25:07 GMT'}]",2020-06-23,"[['Rastogi', 'Nidhi', ''], ['Dutta', 'Sharmishtha', ''], ['Zaki', 'Mohammed J.', ''], ['Gittens', 'Alex', ''], ['Aggarwal', 'Charu', '']]","['Malware', 'Threat Intelligence', 'Cybersecurity', 'Ontology', 'KnowledgeGraph']"
7420,2009.12213,Qi Dai,"Qi Dai, Xunnong Xu, Wen Guo, Suzhou Huang, Dimitar Filev","Towards a Systematic Computational Framework for Modeling Multi-Agent
  Decision-Making at Micro Level for Smart Vehicles in a Smart World",,Robotics and Autonomous Systems 144 (2021) 103859,10.1016/j.robot.2021.103859,,cs.MA cs.AI cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a multi-agent based computational framework for modeling
decision-making and strategic interaction at micro level for smart vehicles in
a smart world. The concepts of Markov game and best response dynamics are
heavily leveraged. Our aim is to make the framework conceptually sound and
computationally practical for a range of realistic applications, including
micro path planning for autonomous vehicles. To this end, we first convert the
would-be stochastic game problem into a closely related deterministic one by
introducing risk premium in the utility function for each individual agent. We
show how the sub-game perfect Nash equilibrium of the simplified deterministic
game can be solved by an algorithm based on best response dynamics. In order to
better model human driving behaviors with bounded rationality, we seek to
further simplify the solution concept by replacing the Nash equilibrium
condition with a heuristic and adaptive optimization with finite look-ahead
anticipation. In addition, the algorithm corresponding to the new solution
concept drastically improves the computational efficiency. To demonstrate how
our approach can be applied to realistic traffic settings, we conduct a
simulation experiment: to derive merging and yielding behaviors on a
double-lane highway with an unexpected barrier. Despite assumption differences
involved in the two solution concepts, the derived numerical solutions show
that the endogenized driving behaviors are very similar. We also briefly
comment on how the proposed framework can be further extended in a number of
directions in our forthcoming work, such as behavioral calibration using real
traffic video data, computational mechanism design for traffic policy
optimization, and so on.
","[{'version': 'v1', 'created': 'Fri, 25 Sep 2020 13:05:28 GMT'}]",2022-01-05,"[['Dai', 'Qi', ''], ['Xu', 'Xunnong', ''], ['Guo', 'Wen', ''], ['Huang', 'Suzhou', ''], ['Filev', 'Dimitar', '']]","['Multi-Agent Decision-Making', 'Coordinated Path Planning', 'Human Driving Behavior Modeling']"
7421,1802.03365,Matias Martinez,"Matias Martinez, Martin Monperrus","Astor: Exploring the Design Space of Generate-and-Validate Program
  Repair beyond GenProg",,"Journal of Systems and Software, Elsevier, 2019",10.1016/j.jss.2019.01.069,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During last years, researches have proposed novel repair approaches that
automatically generate patches for repairing software bugs. Repair approaches
can be loosely characterized along the main design philosophy such generate-
and-validate or synthesis-based. Each of those repair approaches is a point in
the design space of program repair. Our goal is to facilitate the design,
development and evaluation of repair approaches by providing a framework that:
a) contains components commonly present in approaches implementations thus new
approaches can be built over them, b) provides built-in implementations of
existing repair approach. This paper presents a framework named Astor that
encores the design space of generate-and-validate repair approaches. Astor
provides extension points that form the explicit decision space of program
repair. Over those extension points, researchers can reuse existing components
or implements new ones. Astor includes 6 Java implementation of repair
approaches, including one of the pioneer: GenProg. Researcher have been already
defining new approaches over Astor, proposing improvements of those built-in
approaches by using the extension points, and executing approaches
implementations from Astor in their evaluations. The implementations of the
repair approaches built over Astor are capable of repair, in total, 98 real
bugs from 5 large Java programs.
","[{'version': 'v1', 'created': 'Fri, 9 Feb 2018 17:47:22 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Aug 2018 11:38:38 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Jan 2019 07:28:54 GMT'}]",2019-02-13,"[['Martinez', 'Matias', ''], ['Monperrus', 'Martin', '']]","['Software Maintenance', 'Automated Program Repair', 'SoftwareTesting', 'Evaluation Frameworks', 'Software Bugs', 'Defects']"
7422,2004.08993,Kiran Tomlinson,"Patty Commins, David Liben-Nowell, Tina Liu, Kiran Tomlinson","Summarizing Diverging String Sequences, with Applications to
  Chain-Letter Petitions","18 pages, 6 figures. Accepted to Combinatorial Pattern Matching (CPM)
  2020",,10.4230/LIPIcs.CPM.2020.11,,cs.SI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Algorithms to find optimal alignments among strings, or to find a
parsimonious summary of a collection of strings, are well studied in a variety
of contexts, addressing a wide range of interesting applications. In this
paper, we consider chain letters, which contain a growing sequence of
signatories added as the letter propagates. The unusual constellation of
features exhibited by chain letters (one-ended growth, divergence, and
mutation) make their propagation, and thus the corresponding reconstruction
problem, both distinctive and rich. Here, inspired by these chain letters, we
formally define the problem of computing an optimal summary of a set of
diverging string sequences. From a collection of these sequences of names, with
each sequence noisily corresponding to a branch of the unknown tree $T$
representing the letter's true dissemination, can we efficiently and accurately
reconstruct a tree $T' \approx T$? In this paper, we give efficient exact
algorithms for this summarization problem when the number of sequences is
small; for larger sets of sequences, we prove hardness and provide an efficient
heuristic algorithm. We evaluate this heuristic on synthetic data sets chosen
to emulate real chain letters, showing that our algorithm is competitive with
or better than previous approaches, and that it also comes close to finding the
true trees in these synthetic datasets.
","[{'version': 'v1', 'created': 'Mon, 20 Apr 2020 00:00:45 GMT'}]",2020-11-09,"[['Commins', 'Patty', ''], ['Liben-Nowell', 'David', ''], ['Liu', 'Tina', ''], ['Tomlinson', 'Kiran', '']]","['edit distance', 'tree reconstruction', 'information propagation', 'chain letters']"
7423,2105.03332,Joongoo Jeon,"Joongoo Jeon, Sung Joong Kim",FVM Network to Reduce Computational Cost of CFD Simulation,"17 pages, 13 figures (except supplementary materials)",,10.1002/er.7879,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the rapid growth of CPU performance, the computational cost to
simulate the chemically reacting flow is still infeasible in many cases. There
are few studies to accelerate the CFD simulation by using neural network
models. However, they noted that it is still difficult to predict multi-step
CFD time series data. The finite volume method (FVM) which is the basic
principle of most CFD codes seems not to be sufficiently considered in the
previous network models. In this study, a FVM network (FVMN) which simulate the
principles of FVM by the tier-input and derivative-output system was proposed.
The performance of this baseline model was evaluated using unsteady reacting
flow datasets. It was confirmed that the maximum relative error of the FVMN
(0.04%) was much smaller than the general model (1.12%) in the training
dataset. This difference in error size was more prominent in the prediction
datasets. In addition, it was observed that the calculation speed was about 10
times faster in FVMN than CFD solver even under the same CPU condition.
Although the relative error with the ground truth data was significantly
reduced in the proposed model, the linearly increasing gradient error is a
remaining issue in longer transient calculations. Therefore, we additionally
suggested Machine learning aided CFD framework which can substantially
accelerate the CFD simulation through alternating computations.
","[{'version': 'v1', 'created': 'Fri, 7 May 2021 15:33:49 GMT'}]",2022-04-06,"[['Jeon', 'Joongoo', ''], ['Kim', 'Sung Joong', '']]","['Machine learning', 'deep learning', 'baseline model', 'CFD', 'finite volume method']"
7424,2209.07221,Bernhard Bermeitinger,"Tomas Hrycej, Bernhard Bermeitinger, Siegfried Handschuh","Number of Attention Heads vs Number of Transformer-Encoders in Computer
  Vision",,,10.5220/0011578000003335,,cs.CV cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Determining an appropriate number of attention heads on one hand and the
number of transformer-encoders, on the other hand, is an important choice for
Computer Vision (CV) tasks using the Transformer architecture. Computing
experiments confirmed the expectation that the total number of parameters has
to satisfy the condition of overdetermination (i.e., number of constraints
significantly exceeding the number of parameters). Then, good generalization
performance can be expected. This sets the boundaries within which the number
of heads and the number of transformers can be chosen. If the role of context
in images to be classified can be assumed to be small, it is favorable to use
multiple transformers with a low number of heads (such as one or two). In
classifying objects whose class may heavily depend on the context within the
image (i.e., the meaning of a patch being dependent on other patches), the
number of heads is equally important as that of transformers.
","[{'version': 'v1', 'created': 'Thu, 15 Sep 2022 11:26:44 GMT'}]",2022-11-01,"[['Hrycej', 'Tomas', ''], ['Bermeitinger', 'Bernhard', ''], ['Handschuh', 'Siegfried', '']]","['Computer Vision', 'Transformer', 'Attention', 'Comparison']"
7425,1909.06857,Lesandro Ponciano,Lesandro Ponciano,"HCI Support Card: Creating and Using a Support Card for Education in
  Human-Computer Interaction",Workshop on HCI Education (WEIHC '19),"Extended Proceedings of the 18th Brazilian Symposium on Human
  Factors in Computing Systems, October 21--25, 2019, Vit\'oria - ES, Brazil",10.5753/ihc.2019.8409,,cs.HC cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Support cards summarise a set of core information about a subject. The
periodic table of chemical elements and the mathematical tables are well-known
examples of support cards for didactic purposes. Technology professionals also
use support cards for recalling information such as syntactic details of
programming languages or harmonic colour palettes for designing user
interfaces. While support cards have proved useful in many contexts, little is
known about its didactic use in the Human-Computer Interaction (HCI) field. To
fill this gap, this study proposes and evaluates a process for creating and
using an HCI support card. The process considers the interdisciplinary nature
of the field, covering the syllabus, curriculum, textbooks, and students'
perception about HCI topics. The evaluation is based on case studies of
creating and using a card during a semester in two undergraduate courses:
Software Engineering and Information Systems. Results show that a support card
can help students in following the lessons, remembering and integrating the
different topics studied in the classroom. The card guides the students in
building their cognitive maps, mind maps, and concept maps to study
human-computer interaction. It fosters students' curiosity and permanent
engagement with the HCI topics. The card usefulness goes beyond the HCI
classroom, being also used by students in their professional activities and
other academic disciplines, fostering an interdisciplinary application of HCI
topics.
","[{'version': 'v1', 'created': 'Sun, 15 Sep 2019 18:47:16 GMT'}]",2019-10-21,"[['Ponciano', 'Lesandro', '']]","['Teaching', 'Learning', 'HCI education', 'UX education', 'Support card']"
7426,2006.04667,Brecht Laperre,"Brecht Laperre, Jorge Amaya, Giovanni Lapenta","Dynamic Time Warping as a New Evaluation for Dst Forecast with Machine
  Learning","Accepted for publication in Frontiers in Astronomy and Space
  Sciences, section Space Physics","Frontiers in Astronomy and Space Sciences, Vol. 7, 2020",10.3389/fspas.2020.00039,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Models based on neural networks and machine learning are seeing a rise in
popularity in space physics. In particular, the forecasting of geomagnetic
indices with neural network models is becoming a popular field of study. These
models are evaluated with metrics such as the root-mean-square error (RMSE) and
Pearson correlation coefficient. However, these classical metrics sometimes
fail to capture crucial behavior. To show where the classical metrics are
lacking, we trained a neural network, using a long short-term memory network,
to make a forecast of the disturbance storm time index at origin time $t$ with
a forecasting horizon of 1 up to 6 hours, trained on OMNIWeb data. Inspection
of the model's results with the correlation coefficient and RMSE indicated a
performance comparable to the latest publications. However, visual inspection
showed that the predictions made by the neural network were behaving similarly
to the persistence model. In this work, a new method is proposed to measure
whether two time series are shifted in time with respect to each other, such as
the persistence model output versus the observation. The new measure, based on
Dynamical Time Warping, is capable of identifying results made by the
persistence model and shows promising results in confirming the visual
observations of the neural network's output. Finally, different methodologies
for training the neural network are explored in order to remove the persistence
behavior from the results.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2020 15:14:13 GMT'}]",2022-03-15,"[['Laperre', 'Brecht', ''], ['Amaya', 'Jorge', ''], ['Lapenta', 'Giovanni', '']]","['Space Weather', 'Forecast', 'Dst', 'Machine Learning', 'DTW', 'Evaluation', 'LSTM', 'Storm']"
7427,2111.11143,Anubhav Dogra,"Anubhav Dogra, Sakshay Mahna, Srikant Sekhar Padhee, Ekta Singla","Unified Modeling of Unconventional Modular and Reconfigurable
  Manipulation System",,2022,10.1016/j.rcim.2022.102385,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Customization of manipulator configurations using modularity and
reconfigurability aspects is receiving much attention. Modules presented so far
in literature deals with the conventional and standard configurations. This
paper presents the 3D printable, light-weight and unconventional modules:
MOIRs' Mark-2, to develop any custom `n'-Degrees-of-Freedom (DoF) serial
manipulator even with the non-parallel and non-perpendicular jointed
configuration. These unconventional designs of modular configurations seek an
easy adaptable solution for both modular assembly and software interfaces for
automatic modeling and control. A strategy of assembling the modules, automatic
and unified modeling of the modular and reconfigurable manipulators with
unconventional parameters is proposed in this paper using the proposed 4
modular units. A reconfigurable software architecture is presented for the
automatic generation of kinematic and dynamic models and configuration files,
through which, a designer can design, validate using visualization, plan and
execute the motion of the developed configuration as required. The framework
developed is based upon an open source platform called as Robot Operating
System (ROS), which acts as a digital twin for the modular configurations. For
the experimental demonstration, a 3D printed modular library is developed and
an unconventional configuration is assembled, using the proposed modules
followed by automatic modeling and control, for a single cell of the vertical
farm setup.
","[{'version': 'v1', 'created': 'Mon, 22 Nov 2021 12:10:12 GMT'}]",2022-06-10,"[['Dogra', 'Anubhav', ''], ['Mahna', 'Sakshay', ''], ['Padhee', 'Srikant Sekhar', ''], ['Singla', 'Ekta', '']]","['Modular and Reconfigurable Design', 'Robot Operating System', 'Kinematics and DynamicModeling', 'Modular Library', 'Reconfigurable Software Architecture']"
7428,2205.01728,Tian-Sheuan Chang,"Hsiao-Shan Huang, Tian-Sheuan Chang, Jhih-Yi Wu",A Secure File Sharing System Based on IPFS and Blockchain,"4 pages, 4 figures, published in Proceedings of the 2020 2nd
  International Electronics Communication Conference",,10.1145/3409934.3409948,,cs.CR cs.NI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  There is a great interest in many approaches towards blockchain in providing
a solution to record transactions in a decentralized way. However, there are
some limitations when storing large files or documents on the blockchain. In
order to meet the requirements of storing relatively large data, a
decentralized storage medium is produced. IPFS is a distributed file system
which is content-addressable. It works very similar to the blockchain network.
There are some attempts which take advantage of the blockchain concept and IPFS
to design new approaches. Unfortunately, there are some inefficiencies in
sharing data using the combination of IPFS and blockchain. In this paper, we
proposed a secure file sharing system that brings a distributed access control
and group key management by the adoption of the IPFS proxy. The IPFS proxy
which plays an important role in the design is adopted to take responsibility
for the control policies. The combination of the IPFS server and the blockchain
network with the adoption of the IPFS proxy make a secure file sharing system
which the members on the system can create new groups or join different groups
by their own choice. Although there is no access control mechanism in IPFS
server and blockchain network, the secure file sharing system manages the
access control policies. The members access files only belong to the group they
authorized.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 09:59:39 GMT'}]",2022-05-05,"[['Huang', 'Hsiao-Shan', ''], ['Chang', 'Tian-Sheuan', ''], ['Wu', 'Jhih-Yi', '']]","['Blockchain', 'file sharing', 'Inter-Planetary File System(IPFS)', 'access control', 'group key management']"
7429,1910.10536,Marc Ru{\ss}wurm,"Marc Ru{\ss}wurm, Marco K\""orner",Self-attention for raw optical Satellite Time Series Classification,,"ISPRS Journal of Photogrammetry and Remote Sensing, Volume 169,
  November 2020, Pages 421-435",10.1016/j.isprsjprs.2020.06.006,,cs.LG eess.IV stat.ML,http://creativecommons.org/licenses/by/4.0/,"  The amount of available Earth observation data has increased dramatically in
the recent years. Efficiently making use of the entire body information is a
current challenge in remote sensing and demands for light-weight
problem-agnostic models that do not require region- or problem-specific expert
knowledge. End-to-end trained deep learning models can make use of raw sensory
data by learning feature extraction and classification in one step solely from
data. Still, many methods proposed in remote sensing research require implicit
feature extraction through data preprocessing or explicit design of features.
  In this work, we compare recent deep learning models on crop type
classification on raw and preprocessed Sentinel 2 data. We concentrate on the
common neural network architectures for time series, i.e., 1D-convolutions,
recurrence, a shallow random forest baseline, and focus on the novel
self-attention architecture. Our central findings are that data preprocessing
still increased the overall classification performance for all models while the
choice of model was less crucial. Self-attention and recurrent neural networks,
by their architecture, outperformed convolutional neural networks on raw
satellite time series. We explore this by a feature importance analysis based
on gradient back-propagation that exploits the differentiable nature of deep
learning models. Further, we qualitatively show how self-attention scores focus
selectively on few classification-relevant observations.
","[{'version': 'v1', 'created': 'Wed, 23 Oct 2019 12:56:16 GMT'}, {'version': 'v2', 'created': 'Sat, 2 May 2020 15:25:48 GMT'}, {'version': 'v3', 'created': 'Fri, 23 Oct 2020 12:04:50 GMT'}]",2020-10-26,"[['Rußwurm', 'Marc', ''], ['Körner', 'Marco', '']]","['Self-Attention', 'Transformer', 'Time Series Classification', 'Multitemporal Earth Observation', 'Crop Type Mapping', 'Vegetation Monitoring', 'Deep Learning']"
7430,2108.09442,Maryam Tebyani,"Maryam Tebyani, Alex Spaeth, Nicholas Cramer, Mircea Teodorescu",A Geometric Kinematic Model for Flexible Voxel-Based Robots,"10 pages, 7 figures",,10.1089/soro.2021.0139,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Voxel-based structures provide a modular, mechanically flexible periodic
lattice which can be used as a soft robot through internal deformations. To
engage these structures for robotic tasks, we use a finite element method to
characterize the motion caused by deforming single degrees of freedom and
develop a reduced kinematic model. We find that node translations propagate
periodically along geometric planes within the lattice, and briefly show that
translational modes dominate the energy usage of the actuators. The resulting
kinematic model frames the structural deformations in terms of user-defined
control and end effector nodes, which further reduces the model size. The
derived Planes of Motion (POM) model can be equivalently used for forward and
inverse kinematics, as demonstrated by the design of a tripod stable gait for a
locomotive voxel robot and validation of the quasi-static model through
physical experiments.
","[{'version': 'v1', 'created': 'Sat, 21 Aug 2021 05:20:27 GMT'}]",2022-12-15,"[['Tebyani', 'Maryam', ''], ['Spaeth', 'Alex', ''], ['Cramer', 'Nicholas', ''], ['Teodorescu', 'Mircea', '']]","['Modular Robots', 'Flexible Locomotion', 'Kinematic Modeling']"
7431,2010.06626,Raul de Queiroz Mendes,"Raul de Queiroz Mendes, Eduardo Godinho Ribeiro, Nicolas dos Santos
  Rosa, Valdir Grassi Jr","On Deep Learning Techniques to Boost Monocular Depth Estimation for
  Autonomous Navigation","29 pages, 16 figures. Preprint published in the Elsevier's Robotics
  and Autonomous Systems journal on November 23, 2020","Journal: Robotics and Autonomous Systems, publisher: Elsevier,
  volume number: 136, year: 2020, page number: 103701",10.1016/j.robot.2020.103701,,cs.CV cs.LG cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Inferring the depth of images is a fundamental inverse problem within the
field of Computer Vision since depth information is obtained through 2D images,
which can be generated from infinite possibilities of observed real scenes.
Benefiting from the progress of Convolutional Neural Networks (CNNs) to explore
structural features and spatial image information, Single Image Depth
Estimation (SIDE) is often highlighted in scopes of scientific and
technological innovation, as this concept provides advantages related to its
low implementation cost and robustness to environmental conditions. In the
context of autonomous vehicles, state-of-the-art CNNs optimize the SIDE task by
producing high-quality depth maps, which are essential during the autonomous
navigation process in different locations. However, such networks are usually
supervised by sparse and noisy depth data, from Light Detection and Ranging
(LiDAR) laser scans, and are carried out at high computational cost, requiring
high-performance Graphic Processing Units (GPUs). Therefore, we propose a new
lightweight and fast supervised CNN architecture combined with novel feature
extraction models which are designed for real-world autonomous navigation. We
also introduce an efficient surface normals module, jointly with a simple
geometric 2.5D loss function, to solve SIDE problems. We also innovate by
incorporating multiple Deep Learning techniques, such as the use of
densification algorithms and additional semantic, surface normals and depth
information to train our framework. The method introduced in this work focuses
on robotic applications in indoor and outdoor environments and its results are
evaluated on the competitive and publicly available NYU Depth V2 and KITTI
Depth datasets.
","[{'version': 'v1', 'created': 'Tue, 13 Oct 2020 18:37:38 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Dec 2020 01:09:57 GMT'}]",2021-01-01,"[['Mendes', 'Raul de Queiroz', ''], ['Ribeiro', 'Eduardo Godinho', ''], ['Rosa', 'Nicolas dos Santos', ''], ['Grassi', 'Valdir', 'Jr']]","['SIDE', 'CNN', 'Deep Learning']"
7432,2105.00705,Stephen MacDonell,"Mujtaba Alshakhouri, Jim Buchan and Stephen G. MacDonell","Synchronised Visualisation of Software Process and Product Artefacts:
  Concept, Design and Prototype Implementation","Journal paper, 18 pages, 4 figures","Information and Software Technology 98(2018), pp.131-145",10.1016/j.infsof.2018.01.008,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Most prior software visualisation (SV) research has focused
primarily on making aspects of intangible software product artefacts more
evident. While undoubtedly useful, this focus has meant that software process
visualisation has received far less attention. Objective: This paper presents
Conceptual Visualisation, a novel SV approach that builds on the well-known
CodeCity metaphor by situating software code artefacts alongside their software
development processes, in order to link and synchronise these typically
separate components. Method: While the majority of prior SV research has
focused on representing what is already available in the code (i.e., the
implementation) or information derived from it (i.e., various metrics), the
presented approach instead makes the design concepts and original developers'
intentions -- both significant sources of information in terms of software
development and maintenance -- readily and contextually available in a
visualisation environment that tightly integrates the code artefacts with their
original functional requirements and development activity. Results: Our
approach has been implemented in a prototype tool called ScrumCity with the
proof of concept being demonstrated using six real-world open source systems. A
preliminary case study has further been carried out with real world data.
Conclusion: Conceptual Visualisation, as implemented in ScrumCity, shows early
promise in enabling developers and managers (and potentially other
stakeholders) to traverse and explore multiple aspects of software product and
process artefacts in a synchronised manner, achieving traceability between the
two.
","[{'version': 'v1', 'created': 'Mon, 3 May 2021 09:27:00 GMT'}]",2021-05-04,"[['Alshakhouri', 'Mujtaba', ''], ['Buchan', 'Jim', ''], ['MacDonell', 'Stephen G.', '']]","['Software visualisation', 'Conceptual Visualisation', 'software process', 'conceptual design', 'feature location', 'traceability', 'locality']"
7433,2204.10613,Antonios Minas Krasakis,"Antonios Minas Krasakis, Andrew Yates, Evangelos Kanoulas",Zero-shot Query Contextualization for Conversational Search,Accepted @ SIGIR 2022,,10.1145/3477495.3531769,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current conversational passage retrieval systems cast conversational search
into ad-hoc search by using an intermediate query resolution step that places
the user's question in context of the conversation. While the proposed methods
have proven effective, they still assume the availability of large-scale
question resolution and conversational search datasets. To waive the dependency
on the availability of such data, we adapt a pre-trained token-level dense
retriever on ad-hoc search data to perform conversational search with no
additional fine-tuning. The proposed method allows to contextualize the user
question within the conversation history, but restrict the matching only
between question and potential answer. Our experiments demonstrate the
effectiveness of the proposed approach. We also perform an analysis that
provides insights of how contextualization works in the latent space, in
essence introducing a bias towards salient terms from the conversation.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2022 10:12:56 GMT'}]",2022-04-25,"[['Krasakis', 'Antonios Minas', ''], ['Yates', 'Andrew', ''], ['Kanoulas', 'Evangelos', '']]","['information retrieval', 'conversational search', 'neural ranking']"
7434,2105.00191,"Ozan \""Ozdenizci","Ozan Ozdenizci, Deniz Erdogmus","Stochastic Mutual Information Gradient Estimation for Dimensionality
  Reduction Networks",Accepted for publication at Elsevier - Information Sciences,,10.1016/j.ins.2021.04.066,,cs.LG cs.IT math.IT stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Feature ranking and selection is a widely used approach in various
applications of supervised dimensionality reduction in discriminative machine
learning. Nevertheless there exists significant evidence on feature ranking and
selection algorithms based on any criterion leading to potentially sub-optimal
solutions for class separability. In that regard, we introduce emerging
information theoretic feature transformation protocols as an end-to-end neural
network training approach. We present a dimensionality reduction network
(MMINet) training procedure based on the stochastic estimate of the mutual
information gradient. The network projects high-dimensional features onto an
output feature space where lower dimensional representations of features carry
maximum mutual information with their associated class labels. Furthermore, we
formulate the training objective to be estimated non-parametrically with no
distributional assumptions. We experimentally evaluate our method with
applications to high-dimensional biological data sets, and relate it to
conventional feature selection algorithms to form a special case of our
approach.
","[{'version': 'v1', 'created': 'Sat, 1 May 2021 08:20:04 GMT'}]",2021-05-04,"[['Ozdenizci', 'Ozan', ''], ['Erdogmus', 'Deniz', '']]","['feature projection', 'dimensionality reduction', 'neural networks', 'information theoretic learning', 'mutual information', 'stochastic gradient estimation', 'MMINet']"
7435,2112.15577,Jakob Heiss,"Jakob Heiss, Josef Teichmann, Hanna Wutte","How Infinitely Wide Neural Networks Can Benefit from Multi-task Learning
  -- an Exact Macroscopic Characterization",13 pages + appendix,,10.3929/ethz-b-000550890,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In practice, multi-task learning (through learning features shared among
tasks) is an essential property of deep neural networks (NNs). While
infinite-width limits of NNs can provide good intuition for their
generalization behavior, the well-known infinite-width limits of NNs in the
literature (e.g., neural tangent kernels) assume specific settings in which
wide ReLU-NNs behave like shallow Gaussian Processes with a fixed kernel.
Consequently, in such settings, these NNs lose their ability to benefit from
multi-task learning in the infinite-width limit. In contrast, we prove that
optimizing wide ReLU neural networks with at least one hidden layer using
L2-regularization on the parameters promotes multi-task learning due to
representation-learning - also in the limiting regime where the network width
tends to infinity. We present an exact quantitative characterization of this
infinite width limit in an appropriate function space that neatly describes
multi-task learning.
","[{'version': 'v1', 'created': 'Fri, 31 Dec 2021 18:03:46 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Jan 2022 17:39:56 GMT'}, {'version': 'v3', 'created': 'Thu, 2 Jun 2022 01:00:46 GMT'}, {'version': 'v4', 'created': 'Thu, 20 Oct 2022 15:03:17 GMT'}]",2022-10-21,"[['Heiss', 'Jakob', ''], ['Teichmann', 'Josef', ''], ['Wutte', 'Hanna', '']]","['Mulit-task learning', 'Deep Learning', 'Neural Network Theory', 'Regularization', 'Bayesian Neural Networks', 'Overparametrized Neural Networks', 'infinite width limit']"
7436,2103.11614,Benjamin Paassen,"Benjamin Paa{\ss}en and Jessica McBroom and Bryn Jeffries and Irena
  Koprinska and Kalina Yacef",ast2vec: Utilizing Recursive Neural Encodings of Python Programs,Under consideration at the Journal of Educational Datamining,"Journal of Educational Data Mining, 13(3) (2021) 1-35",10.5281/zenodo.5634224,,cs.LG cs.CY cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Educational datamining involves the application of datamining techniques to
student activity. However, in the context of computer programming, many
datamining techniques can not be applied because they expect vector-shaped
input whereas computer programs have the form of syntax trees. In this paper,
we present ast2vec, a neural network that maps Python syntax trees to vectors
and back, thereby facilitating datamining on computer programs as well as the
interpretation of datamining results. Ast2vec has been trained on almost half a
million programs of novice programmers and is designed to be applied across
learning tasks without re-training, meaning that users can apply it without any
need for (additional) deep learning. We demonstrate the generality of ast2vec
in three settings: First, we provide example analyses using ast2vec on a
classroom-sized dataset, involving visualization, student motion analysis,
clustering, and outlier detection, including two novel analyses, namely a
progress-variance-projection and a dynamical systems analysis. Second, we
consider the ability of ast2vec to recover the original syntax tree from its
vector representation on the training data and two further large-scale
programming datasets. Finally, we evaluate the predictive capability of a
simple linear regression on top of ast2vec, obtaining similar results to
techniques that work directly on syntax trees. We hope ast2vec can augment the
educational datamining toolbelt by making analyses of computer programs easier,
richer, and more efficient.
","[{'version': 'v1', 'created': 'Mon, 22 Mar 2021 06:53:52 GMT'}]",2022-02-11,"[['Paaßen', 'Benjamin', ''], ['McBroom', 'Jessica', ''], ['Jeffries', 'Bryn', ''], ['Koprinska', 'Irena', ''], ['Yacef', 'Kalina', '']]","['computer science education', 'computer programs', 'word embeddings', 'representation learning', 'neural networks', 'visualization', 'program vectors']"
7437,1903.06570,Ripon Patgiri,"Ripon Patgiri, Sabuzima Nayak and Samir Kumar Borgohain",scaleBF: A High Scalable Membership Filter using 3D Bloom Filter,"6 Pages, 3 Figures, 1 Table","International Journal of Advanced Computer Science and
  Applications(IJACSA), Volume 9 Issue 12, 2018",10.14569/IJACSA.2018.091277,,cs.DS cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bloom Filter is extensively deployed data structure in various applications
and research domain since its inception. Bloom Filter is able to reduce the
space consumption in an order of magnitude. Thus, Bloom Filter is used to keep
information of a very large scale data. There are numerous variants of Bloom
Filters available, however, scalability is a serious dilemma of Bloom Filter
for years. To solve this dilemma, there are also diverse variants of Bloom
Filter. However, the time complexity and space complexity become the key issue
again. In this paper, we present a novel Bloom Filter to address the
scalability issue without compromising the performance, called scaleBF. scaleBF
deploys many 3D Bloom Filter to filter the set of items. In this paper, we
theoretically compare the contemporary Bloom Filter for scalability and scaleBF
outperforms in terms of time complexity.
","[{'version': 'v1', 'created': 'Fri, 15 Mar 2019 14:26:59 GMT'}]",2019-03-18,"[['Patgiri', 'Ripon', ''], ['Nayak', 'Sabuzima', ''], ['Borgohain', 'Samir Kumar', '']]","['Bloom Filter; Membership Filter; ScalableBloom Filter', 'Duplicate Key Filter; Hashing; Data Structure', 'Membership Query']"
7438,1810.02495,Dhinaharan Nagamalai,"Jelena Vasiljevi\'c, Ivica Milosavljevi\'c, Vladimir Krsti\'c,
  Nata\v{s}a Zivi\'c, Lazar Berbakov, Luka Lopu\v{s}ina, Dhinaharan Nagamalai
  and Milutin Cerovi\'c",Medical Images Analysis in Cancer Diagnostic,"11 pages, 6 figures, 11th International Conference on Security and
  its Applications (CNSA 2018), Zurich, Switzerland,","Computer Science & Information Technology (CS & IT), 2018",10.5121/csit.2018.80107,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  This paper shows results of computer analysis of images in the purpose of
finding differences between medical images in order of their classifications in
terms of separation malign tissue from a normal and benign tissue. The
diagnostics of malign tissue is of the crucial importance in medicine.
Therefore, ascertainment of the correlation between multifractals parameters
and ""chaotic"" cells could be of the great appliance. This paper shows the
application of multifractal analysis for additional help in cancer diagnosis,
as well as diminishing. of the subjective factor and error probability
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 02:38:46 GMT'}]",2018-10-08,"[['Vasiljević', 'Jelena', ''], ['Milosavljević', 'Ivica', ''], ['Krstić', 'Vladimir', ''], ['Zivić', 'Nataša', ''], ['Berbakov', 'Lazar', ''], ['Lopušina', 'Luka', ''], ['Nagamalai', 'Dhinaharan', ''], ['Cerović', 'Milutin', '']]","['Multifractal', 'Fractal', 'Medical Images', 'Cancer']"
7439,2101.02270,Zhenqi Wang,"Zhenqi Wang, Sebastian Wende-von Berg, Martin Braun","Fast Parallel Newton-Raphson Power Flow Solver for Large Number of
  System Calculations with CPU and GPU","preprint accepted in Sustainable Energy, Grids and Networks",,10.1016/j.segan.2021.100483,,cs.CE cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  To analyze large sets of grid states, e.g. when evaluating the impact from
the uncertainties of the renewable generation with probabilistic Monte Carlo
simulation or in stationary time series simulation, large number of power flow
calculations have to be performed. For the application in real-time grid
operation, grid planning and in further cases when computational time is
critical, a novel approach on simultaneous parallelization of many
Newton-Raphson power flow calculations on CPU and with GPU-acceleration is
proposed. The result shows a speed-up of over x100 comparing to the open-source
tool pandapower, when performing repetitive power flows of system with
admittance matrix of the same sparsity pattern on both CPU and GPU. The
speed-up relies on the algorithm improvement and highly optimized
parallelization strategy, which can reduce the repetitive work and saturate the
high hardware computational capability of modern CPUs and GPUs well. This is
achieved with the proposed batched sparse matrix operation and batched linear
solver based on LU-refactorization. The batched linear solver shows a large
performance improvement comparing to the state-of-the-art linear system solver
KLU library and a better saturation of the GPU performance with small problem
scale. Finally, the method of integrating the proposed solver into pandapower
is presented, thus the parallel power flow solver with outstanding performance
can be easily applied in challenging real-life grid operation and innovative
researches e.g. data-driven machine learning studies.
","[{'version': 'v1', 'created': 'Wed, 6 Jan 2021 21:27:06 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Feb 2021 09:02:08 GMT'}, {'version': 'v3', 'created': 'Wed, 28 Apr 2021 13:43:41 GMT'}]",2021-04-29,"[['Wang', 'Zhenqi', ''], ['Berg', 'Sebastian Wende-von', ''], ['Braun', 'Martin', '']]","['Probabilistic Power Flow', 'Monte Carlo Simulation', 'Contingency Analysis', 'GPU-acceleration', 'Newton-Raphson', 'Parallel Computing']"
7440,2111.00203,Haozhe Wu,"Haozhe Wu, Jia Jia, Haoyu Wang, Yishun Dou, Chao Duan, Qingshan Deng","Imitating Arbitrary Talking Style for Realistic Audio-DrivenTalking Face
  Synthesis","Accepted by MM2021, code available at
  https://github.com/wuhaozhe/style_avatar",,10.1145/3474085.3475280,,cs.CV cs.GR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  People talk with diversified styles. For one piece of speech, different
talking styles exhibit significant differences in the facial and head pose
movements. For example, the ""excited"" style usually talks with the mouth wide
open, while the ""solemn"" style is more standardized and seldomly exhibits
exaggerated motions. Due to such huge differences between different styles, it
is necessary to incorporate the talking style into audio-driven talking face
synthesis framework. In this paper, we propose to inject style into the talking
face synthesis framework through imitating arbitrary talking style of the
particular reference video. Specifically, we systematically investigate talking
styles with our collected \textit{Ted-HD} dataset and construct style codes as
several statistics of 3D morphable model~(3DMM) parameters. Afterwards, we
devise a latent-style-fusion~(LSF) model to synthesize stylized talking faces
by imitating talking styles from the style codes. We emphasize the following
novel characteristics of our framework: (1) It doesn't require any annotation
of the style, the talking style is learned in an unsupervised manner from
talking videos in the wild. (2) It can imitate arbitrary styles from arbitrary
videos, and the style codes can also be interpolated to generate new styles.
Extensive experiments demonstrate that the proposed framework has the ability
to synthesize more natural and expressive talking styles compared with baseline
methods.
","[{'version': 'v1', 'created': 'Sat, 30 Oct 2021 08:15:27 GMT'}]",2021-11-02,"[['Wu', 'Haozhe', ''], ['Jia', 'Jia', ''], ['Wang', 'Haoyu', ''], ['Dou', 'Yishun', ''], ['Duan', 'Chao', ''], ['Deng', 'Qingshan', '']]","['photorealistic talking face', 'talking style', 'style imitation']"
7441,2012.01907,Djoanna Marie Salac,Djoanna Marie V. Salac,"PRESENT: An Android-Based Class Attendance Monitoring System Using Face
  Recognition Technology","14 pages, 6 figures","International Journal of Computing Sciences Research Vol. 2,No. 3,
  pp. 102-115, 2019",10.25147/ijcsr.2017.001.1.28,,cs.CY cs.SE,http://creativecommons.org/licenses/by/4.0/,"  The study aimed to develop an Android-Based Class Attendance Monitoring
Application using Face Recognition to make attendance checking and monitoring
easier and faster. The researcher used incremental model as the software
development process and the application was evaluated by seventeen (17) faculty
members .A validated evaluation questionnaire was used to rate the level of
acceptability of the application based on ISO 9126 software quality and the
level of satisfaction for its major features. For the statistical treatment of
the data collected, Likert Scale, weighted mean and t-test were utilized by the
researcher. The results revealed that instructors find the existing way of
checking attendance as time consuming and a tedious task. Furthermore, the
respondents assessed the developed application as moderately acceptable in
terms of functionality, reliability and usability while portability was rated
as highly acceptable. With regards to the features, the respondents were very
satisfied. The researcher concluded that the developed application was useful
and it can support the needs of the instructors to make attendance checking and
monitoring easier, faster, and reliable. Due to its acceptable evaluation
result, instructors should consider the use of this tool as an alternative to
the existing process of checking and monitoring class attendance. With the
integration of different technologies such as Android, face recognition and
SMS, the traditional way of checking class attendance can be made easier,
faster, reliable and secured, thus improving classroom management.
","[{'version': 'v1', 'created': 'Fri, 20 Nov 2020 02:25:00 GMT'}]",2020-12-04,"[['Salac', 'Djoanna Marie V.', '']]","['attendance', 'Android application', 'face recognition', 'SMS', 'monitoring      INTRODUCTION']"
7442,1910.02851,Giovanni Schmid PhD.,Ferdinando Montecuollo and Giovannni Schmid,ER-index: a referential index for encrypted genomic databases,27 pages with detailed pseudocodes,Information Systems 96 (2021) 101668,10.1016/j.is.2020.101668,,cs.DS cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Huge DBMSs storing genomic information are being created and engineerized for
doing large-scale, comprehensive and in-depth analysis of human beings and
their diseases. However, recent regulations like the GDPR require that
sensitive data are stored and elaborated thanks to privacy-by-design methods
and software. We designed and implemented ER-index, a new full-text index in
minute space which was optimized for compressing and encrypting collections of
genomic sequences, and for performing on them fast pattern-search queries. Our
new index complements the E2FM-index, which was introduced to compress and
encrypt collections of nucleotide sequences without relying on a reference
sequence. When used on collections of highly similar sequences, the ER-index
allows to obtain compression ratios which are an order of magnitude smaller
than those achieved with the E2FM-index, but maintaining its very good search
performance. Moreover, thanks to the ER-index multi-user and multiple-keys
encryption model, a single index can store the sequences related to a
population of individuals so that users may perform search operations only on
the sequences to which they were granted access. The ER-index C++ source code
plus scripts and data to assess the tool performance are available at:
https://github.com/EncryptedIndexes/erindex.
","[{'version': 'v1', 'created': 'Mon, 7 Oct 2019 15:19:44 GMT'}, {'version': 'v2', 'created': 'Sun, 27 Dec 2020 01:34:41 GMT'}]",2020-12-29,"[['Montecuollo', 'Ferdinando', ''], ['Schmid', 'Giovannni', '']]","['Data storage and retrieval', 'Full-text index', 'Compressive genomics']"
7443,cs/0507009,Ming Zhao,"Ming Zhao, Zhigang Chen, Xiaoheng Deng, Lianming Zhang, Anfeng Liu and
  Guosheng Huang","MAEC : A Movement-Assisted Energy Conserving Method in Event Driven
  Wireless Sensor Networks","IEEE International Conference on Wireless Communications, Networking
  and Mobile Computing, 2005, to appear",,10.1109/TENCON.2005.301075,,cs.NI,,"  Energy is one of the most important resources in wireless sensor networks.
Recently, the mobility of base station has been exploited to preserve the
energy. But in event driven networks, the mobility issue is quite different
from the continuous monitoring one because only a small portion of sensor node
has data to send at one time. The number of sensor node that forward traffic
should be minimized to prolong the network lifetime. In this paper, we propose
a movement-assisted energy conserving method which tries to reduce the amount
of forwarding sensor node by directing the base station to move close to the
hotspots. This method achieves good performance especially when applied to a
network with a set of cooperative mobile base station. Extensive simulation has
been done to verify the effectiveness of the propose schema.
","[{'version': 'v1', 'created': 'Tue, 5 Jul 2005 00:59:17 GMT'}]",2016-11-17,"[['Zhao', 'Ming', ''], ['Chen', 'Zhigang', ''], ['Deng', 'Xiaoheng', ''], ['Zhang', 'Lianming', ''], ['Liu', 'Anfeng', ''], ['Huang', 'Guosheng', '']]","['Wireless sensor networks', 'energy conserving', 'event driven', 'mobility']"
7444,1905.12389,Frank Van Harmelen,Frank van Harmelen and Annette ten Teije,A Boxology of Design Patterns for Hybrid Learning and Reasoning Systems,"12 pages,55 references","Journal of Web Engineering, Vol. 18 1-3, pgs. 97-124, 2019",10.13052/jwe1540-9589.18133,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a set of compositional design patterns to describe a large variety
of systems that combine statistical techniques from machine learning with
symbolic techniques from knowledge representation. As in other areas of
computer science (knowledge engineering, software engineering, ontology
engineering, process mining and others), such design patterns help to
systematize the literature, clarify which combinations of techniques serve
which purposes, and encourage re-use of software components. We have validated
our set of compositional design patterns against a large body of recent
literature.
","[{'version': 'v1', 'created': 'Wed, 29 May 2019 12:53:10 GMT'}]",2019-05-30,"[['van Harmelen', 'Frank', ''], ['Teije', 'Annette ten', '']]","['Hybrid systems', 'neuro-symbolic systems', 'knowledge representation', 'machine learning', 'design patters']"
7445,2103.11356,Dongsheng Wang,"Dongsheng Wang, Prayag Tiwari, Sahil Garg, Hongyin Zhu, Peter Bruza","Structural block driven - enhanced convolutional neural representation
  for relation extraction",,,10.1016/j.asoc.2019.105913,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel lightweight relation extraction approach of
structural block driven - convolutional neural learning. Specifically, we
detect the essential sequential tokens associated with entities through
dependency analysis, named as a structural block, and only encode the block on
a block-wise and an inter-block-wise representation, utilizing multi-scale
CNNs. This is to 1) eliminate the noisy from irrelevant part of a sentence;
meanwhile 2) enhance the relevant block representation with both block-wise and
inter-block-wise semantically enriched representation. Our method has the
advantage of being independent of long sentence context since we only encode
the sequential tokens within a block boundary. Experiments on two datasets
i.e., SemEval2010 and KBP37, demonstrate the significant advantages of our
method. In particular, we achieve the new state-of-the-art performance on the
KBP37 dataset; and comparable performance with the state-of-the-art on the
SemEval2010 dataset.
","[{'version': 'v1', 'created': 'Sun, 21 Mar 2021 10:23:44 GMT'}]",2021-03-23,"[['Wang', 'Dongsheng', ''], ['Tiwari', 'Prayag', ''], ['Garg', 'Sahil', ''], ['Zhu', 'Hongyin', ''], ['Bruza', 'Peter', '']]","['Relation Extraction', 'Deep Learning', 'CNNs', 'Dependency parsing']"
7446,1506.05382,Michael Lash,Michael T. Lash and Kang Zhao,"Early Predictions of Movie Success: the Who, What, and When of
  Profitability",,,10.1080/07421222.2016.1243969,,cs.AI cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a decision support system to aid movie investment
decisions at the early stage of movie productions. The system predicts the
success of a movie based on its profitability by leveraging historical data
from various sources. Using social network analysis and text mining techniques,
the system automatically extracts several groups of features, including ""who""
are on the cast, ""what"" a movie is about, ""when"" a movie will be released, as
well as ""hybrid"" features that match ""who"" with ""what"", and ""when"" with ""what"".
Experiment results with movies during an 11-year period showed that the system
outperforms benchmark methods by a large margin in predicting movie
profitability. Novel features we proposed also made great contributions to the
prediction. In addition to designing a decision support system with practical
utilities, our analysis of key factors for movie profitability may also have
implications for theoretical research on team performance and the success of
creative work.
","[{'version': 'v1', 'created': 'Wed, 17 Jun 2015 16:40:48 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Jan 2016 20:10:52 GMT'}]",2017-06-13,"[['Lash', 'Michael T.', ''], ['Zhao', 'Kang', '']]","['Investment Decision Support', 'Movie Profitability', 'Predictive Analytics', 'Text Mining', 'Social Network Analysis']"
7447,1912.07091,Omid Jafari,"Omid Jafari, Khandker Mushfiqul Islam, Parth Nagarkar","Drawbacks and Proposed Solutions for Real-time Processing on Existing
  State-of-the-art Locality Sensitive Hashing Techniques","Accepted and Presented at the 5th International Conference on Signal
  and Image Processing (SIGI-2019), Dubai, UAE",,10.5121/csit.2019.91410,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nearest-neighbor query processing is a fundamental operation for many image
retrieval applications. Often, images are stored and represented by
high-dimensional vectors that are generated by feature-extraction algorithms.
Since tree-based index structures are shown to be ineffective for high
dimensional processing due to the well-known ""Curse of Dimensionality"",
approximate nearest neighbor techniques are used for faster query processing.
Locality Sensitive Hashing (LSH) is a very popular and efficient approximate
nearest neighbor technique that is known for its sublinear query processing
complexity and theoretical guarantees. Nowadays, with the emergence of
technology, several diverse application domains require real-time
high-dimensional data storing and processing capacity. Existing LSH techniques
are not suitable to handle real-time data and queries. In this paper, we
discuss the challenges and drawbacks of existing LSH techniques for processing
real-time high-dimensional image data. Additionally, through experimental
analysis, we propose improvements for existing state-of-the-art LSH techniques
for efficient processing of high-dimensional image data.
","[{'version': 'v1', 'created': 'Sun, 15 Dec 2019 19:04:19 GMT'}]",2019-12-17,"[['Jafari', 'Omid', ''], ['Islam', 'Khandker Mushfiqul', ''], ['Nagarkar', 'Parth', '']]","['Image Retrieval', 'Similar Search Query Processing', 'Locality Sensitive Hashing']"
7448,2005.02863,Loris Nanni,Lorenzo Mantovan and Loris Nanni,The computerization of archaeology: survey on AI techniques,,"SN Computer Science, 2020",10.1007/s42979-020-00286-w,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper analyses the application of artificial intelligence techniques to
various areas of archaeology and more specifically: a) The use of software
tools as a creative stimulus for the organization of exhibitions; the use of
humanoid robots and holographic displays as guides that interact and involve
museum visitors; b) The analysis of methods for the classification of fragments
found in archaeological excavations and for the reconstruction of ceramics,
with the recomposition of the parts of text missing from historical documents
and epigraphs; c) The cataloguing and study of human remains to understand the
social and historical context of belonging with the demonstration of the
effectiveness of the AI techniques used; d) The detection of particularly
difficult terrestrial archaeological sites with the analysis of the
architectures of the Artificial Neural Networks most suitable for solving the
problems presented by the site; the design of a study for the exploration of
marine archaeological sites, located at depths that cannot be reached by man,
through the construction of a freely explorable 3D version.
","[{'version': 'v1', 'created': 'Tue, 5 May 2020 17:09:48 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Jun 2020 23:50:14 GMT'}]",2020-09-29,"[['Mantovan', 'Lorenzo', ''], ['Nanni', 'Loris', '']]","['Archaeology', 'AI algorithms', 'museums', 'archeological site', 'finds']"
7449,2211.01301,Michael Szell,"Simon Martin Breum, Bojan Kostic, Michael Szell","Computational Desire Line Analysis of Cyclists on the Dybb{\o}lsbro
  Intersection in Copenhagen","7 pages, 3 figures",Transport Findings 56683 (2022),10.32866/001c.56683,,cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Contemporary street design prioritizes vehicular traffic flow and assumes
compliant road users. However, actual human behavior is typically neglected,
especially of cyclists, leading to streets with inadequate wayfinding and
protection from vehicular traffic. To improve planning, here we develop a
computational method to detect cyclist trajectories from video recordings and
apply it to the Dybb{\o}lsbro intersection in Copenhagen, Denmark. In one hour
of footage we find hundreds of trajectories that contradict the design,
explainable by the desire for straightforward, uninterrupted travel largely not
provided by the intersection. This neglect and the prioritization of vehicular
traffic highlight opportunities for improving Danish intersection design.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2022 17:21:48 GMT'}]",2022-12-05,"[['Breum', 'Simon Martin', ''], ['Kostic', 'Bojan', ''], ['Szell', 'Michael', '']]","['urban data science', 'cycling', 'traffic behavior', 'intersection design', 'human-centric planning']"
7450,2107.04133,Muhammad Ali Farooq,"Muhammad Ali Farooq, Ammar Ali Khan, Ansar Ahmad, Rana Hammad Raza","Effectiveness of State-of-the-Art Super Resolution Algorithms in
  Surveillance Environment",,"Springer, Part of the Advances in Intelligent Systems and
  Computing book series (AISC, volume 1376), 2021",10.1007/978-3-030-74728-2_8,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Image Super Resolution (SR) finds applications in areas where images need to
be closely inspected by the observer to extract enhanced information. One such
focused application is an offline forensic analysis of surveillance feeds. Due
to the limitations of camera hardware, camera pose, limited bandwidth, varying
illumination conditions, and occlusions, the quality of the surveillance feed
is significantly degraded at times, thereby compromising monitoring of
behavior, activities, and other sporadic information in the scene. For the
proposed research work, we have inspected the effectiveness of four
conventional yet effective SR algorithms and three deep learning-based SR
algorithms to seek the finest method that executes well in a surveillance
environment with limited training data op-tions. These algorithms generate an
enhanced resolution output image from a sin-gle low-resolution (LR) input
image. For performance analysis, a subset of 220 images from six surveillance
datasets has been used, consisting of individuals with varying distances from
the camera, changing illumination conditions, and complex backgrounds. The
performance of these algorithms has been evaluated and compared using both
qualitative and quantitative metrics. These SR algo-rithms have also been
compared based on face detection accuracy. By analyzing and comparing the
performance of all the algorithms, a Convolutional Neural Network (CNN) based
SR technique using an external dictionary proved to be best by achieving robust
face detection accuracy and scoring optimal quantitative metric results under
different surveillance conditions. This is because the CNN layers progressively
learn more complex features using an external dictionary.
","[{'version': 'v1', 'created': 'Thu, 8 Jul 2021 22:28:48 GMT'}]",2021-07-12,"[['Farooq', 'Muhammad Ali', ''], ['Khan', 'Ammar Ali', ''], ['Ahmad', 'Ansar', ''], ['Raza', 'Rana Hammad', '']]","['Super Resolution (SR)', 'Low-resolution (LR)', 'High-Resolution (HR)', 'MTCNN', 'PSNR', 'Surveillance', 'CNN', 'GAN']"
7451,2204.10063,David Mark Bossens,"David M. Bossens, Sarvapali Ramchurn, Danesh Tarapore","Resilient robot teams: a review integrating decentralised control,
  change-detection, and learning",Accepted for Current Robotics Reports,,10.1007/s43154-022-00079-4,,cs.RO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose of review: This paper reviews opportunities and challenges for
decentralised control, change-detection, and learning in the context of
resilient robot teams.
  Recent findings: Exogenous fault detection methods can provide a generic
detection or a specific diagnosis with a recovery solution. Robot teams can
perform active and distributed sensing for detecting changes in the
environment, including identifying and tracking dynamic anomalies, as well as
collaboratively mapping dynamic environments. Resilient methods for
decentralised control have been developed in learning
perception-action-communication loops, multi-agent reinforcement learning,
embodied evolution, offline evolution with online adaptation, explicit task
allocation, and stigmergy in swarm robotics.
  Summary: Remaining challenges for resilient robot teams are integrating
change-detection and trial-and-error learning methods, obtaining reliable
performance evaluations under constrained evaluation time, improving the safety
of resilient robot teams, theoretical results demonstrating rapid adaptation to
given environmental perturbations, and designing realistic and compelling case
studies.
","[{'version': 'v1', 'created': 'Thu, 21 Apr 2022 12:51:27 GMT'}]",2022-06-24,"[['Bossens', 'David M.', ''], ['Ramchurn', 'Sarvapali', ''], ['Tarapore', 'Danesh', '']]","['change-detection', 'decentralised control', 'multi-robot systems', 'swarm robotics', 'machine learning', 'multi-agent systems']"
7452,2007.11189,Madhura Jayaratne,Madhura Jayaratne and Buddhi Jayatilleke,"Predicting Job-Hopping Motive of Candidates Using Answers to Open-ended
  Interview Questions",JCSS version,,10.1007/s42001-021-00138-4,,cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A significant proportion of voluntary employee turnover includes people who
frequently move from job to job, known as job-hopping. Our work shows that
language used in responding to interview questions on past behaviour and
situational judgement is predictive of job-hopping motive as measured by the
Job-Hopping Motives (JHM) Scale. The study is based on responses from over
45,000 job applicants who completed an online chat interview and self-rated
themselves on JHM Scale. Five different methods of text representation were
evaluated, namely four open-vocabulary approaches (TF-IDF, LDA, Glove word
embeddings and Doc2Vec document embeddings) and one closed-vocabulary approach
(LIWC). The Glove embeddings provided the best results with a correlation of r
= 0.35 between sequences of words used and the JHM Scale. Further analysis also
showed a correlation of r = 0.25 between language-based job-hopping motive and
the personality trait Openness to experience and a correlation of r = -0.09
with the trait Agreeableness.
","[{'version': 'v1', 'created': 'Wed, 22 Jul 2020 03:41:32 GMT'}, {'version': 'v2', 'created': 'Wed, 12 May 2021 04:02:41 GMT'}]",2021-08-30,"[['Jayaratne', 'Madhura', ''], ['Jayatilleke', 'Buddhi', '']]","['Job-hopping', 'Turnover', 'Structured interviews', 'Natural languageprocessing', 'Computational linguistic analysis', 'Machine learning', 'HEXACO personality model']"
7453,2101.01775,Yu Chen,"Yu Chen, Ananya Subburathinam, Ching-Hua Chen and Mohammed J. Zaki","Personalized Food Recommendation as Constrained Question Answering over
  a Large-scale Food Knowledge Graph",9 pages. Accepted by WSDM 2021. Final version,,10.1145/3437963.3441816,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Food recommendation has become an important means to help guide users to
adopt healthy dietary habits. Previous works on food recommendation either i)
fail to consider users' explicit requirements, ii) ignore crucial health
factors (e.g., allergies and nutrition needs), or iii) do not utilize the rich
food knowledge for recommending healthy recipes. To address these limitations,
we propose a novel problem formulation for food recommendation, modeling this
task as constrained question answering over a large-scale food knowledge
base/graph (KBQA). Besides the requirements from the user query, personalized
requirements from the user's dietary preferences and health guidelines are
handled in a unified way as additional constraints to the QA system. To
validate this idea, we create a QA style dataset for personalized food
recommendation based on a large-scale food knowledge graph and health
guidelines. Furthermore, we propose a KBQA-based personalized food
recommendation framework which is equipped with novel techniques for handling
negations and numerical comparisons in the queries. Experimental results on the
benchmark show that our approach significantly outperforms non-personalized
counterparts (average 59.7% absolute improvement across various evaluation
metrics), and is able to recommend more relevant and healthier recipes.
","[{'version': 'v1', 'created': 'Tue, 5 Jan 2021 20:38:16 GMT'}]",2021-01-07,"[['Chen', 'Yu', ''], ['Subburathinam', 'Ananya', ''], ['Chen', 'Ching-Hua', ''], ['Zaki', 'Mohammed J.', '']]","['food recommendation', 'personal health', 'healthy diet', 'constrainedquestion answering', 'knowledge graphs']"
7454,2104.03164,Xin Ding,"Xin Ding and Yongwei Wang and Zuheng Xu and Z. Jane Wang and William
  J. Welch","Distilling and Transferring Knowledge via cGAN-generated Samples for
  Image Classification and Regression",,,10.1016/j.eswa.2022.119060,,cs.CV stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Knowledge distillation (KD) has been actively studied for image
classification tasks in deep learning, aiming to improve the performance of a
student based on the knowledge from a teacher. However, applying KD in image
regression with a scalar response variable has been rarely studied, and there
exists no KD method applicable to both classification and regression tasks yet.
Moreover, existing KD methods often require a practitioner to carefully select
or adjust the teacher and student architectures, making these methods less
flexible in practice. To address the above problems in a unified way, we
propose a comprehensive KD framework based on cGANs, termed cGAN-KD.
Fundamentally different from existing KD methods, cGAN-KD distills and
transfers knowledge from a teacher model to a student model via cGAN-generated
samples. This novel mechanism makes cGAN-KD suitable for both classification
and regression tasks, compatible with other KD methods, and insensitive to the
teacher and student architectures. An error bound for a student model trained
in the cGAN-KD framework is derived in this work, providing a theory for why
cGAN-KD is effective as well as guiding the practical implementation of
cGAN-KD. Extensive experiments on CIFAR-100 and ImageNet-100 show that we can
combine state of the art KD methods with the cGAN-KD framework to yield a new
state of the art. Moreover, experiments on Steering Angle and UTKFace
demonstrate the effectiveness of cGAN-KD in image regression tasks, where
existing KD methods are inapplicable.
","[{'version': 'v1', 'created': 'Wed, 7 Apr 2021 14:52:49 GMT'}, {'version': 'v2', 'created': 'Sat, 1 May 2021 04:50:06 GMT'}, {'version': 'v3', 'created': 'Tue, 19 Apr 2022 13:44:56 GMT'}, {'version': 'v4', 'created': 'Mon, 26 Dec 2022 08:53:53 GMT'}, {'version': 'v5', 'created': 'Tue, 27 Dec 2022 04:53:36 GMT'}]",2022-12-29,"[['Ding', 'Xin', ''], ['Wang', 'Yongwei', ''], ['Xu', 'Zuheng', ''], ['Wang', 'Z. Jane', ''], ['Welch', 'William J.', '']]","['knowledge distillation', 'unified framework', 'conditional generative adversarial networks']"
7455,1905.10351,Cornelius Fritz,"Cornelius Fritz, Michael Lebacher, G\""oran Kauermann","Tempus Volat, Hora Fugit -- A Survey of Tie-Oriented Dynamic Network
  Models in Discrete and Continuous Time",,,10.1111/stan.12198,,cs.SI stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given the growing number of available tools for modeling dynamic networks,
the choice of a suitable model becomes central. The goal of this survey is to
provide an overview of tie-oriented dynamic network models. The survey is
focused on introducing binary network models with their corresponding
assumptions, advantages, and shortfalls. The models are divided according to
generating processes, operating in discrete and continuous time. First, we
introduce the Temporal Exponential Random Graph Model (TERGM) and the Separable
TERGM (STERGM), both being time-discrete models. These models are then
contrasted with continuous process models, focusing on the Relational Event
Model (REM). We additionally show how the REM can handle time-clustered
observations, i.e., continuous time data observed at discrete time points.
Besides the discussion of theoretical properties and fitting procedures, we
specifically focus on the application of the models on two networks that
represent international arms transfers and email exchange. The data allow to
demonstrate the applicability and interpretation of the network models.
","[{'version': 'v1', 'created': 'Thu, 23 May 2019 13:47:59 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Aug 2019 08:26:50 GMT'}, {'version': 'v3', 'created': 'Wed, 28 Aug 2019 15:36:05 GMT'}]",2022-01-05,"[['Fritz', 'Cornelius', ''], ['Lebacher', 'Michael', ''], ['Kauermann', 'Göran', '']]","['Continuous-Time', 'Discrete-Time', 'Event Modeling', 'ERGM', 'RandomGraphs', 'REM', 'STERGM', 'TERGM']"
7456,2111.01898,Fernando Alonso-Fernandez,"Javier Galbally, Fernando Alonso-Fernandez, Julian Fierrez, Javier
  Ortega-Garcia","A high performance fingerprint liveness detection method based on
  quality related features",Published at Elsevier Future Generation Computer Systems journal,,10.1016/j.future.2010.11.024,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new software-based liveness detection approach using a novel fingerprint
parameterization based on quality related features is proposed. The system is
tested on a highly challenging database comprising over 10,500 real and fake
images acquired with five sensors of different technologies and covering a wide
range of direct attack scenarios in terms of materials and procedures followed
to generate the gummy fingers. The proposed solution proves to be robust to the
multi-scenario dataset, and presents an overall rate of 90% correctly
classified samples. Furthermore, the liveness detection method presented has
the added advantage over previously studied techniques of needing just one
image from a finger to decide whether it is real or fake. This last
characteristic provides the method with very valuable features as it makes it
less intrusive, more user friendly, faster and reduces its implementation
costs.
","[{'version': 'v1', 'created': 'Tue, 2 Nov 2021 21:09:39 GMT'}]",2021-11-04,"[['Galbally', 'Javier', ''], ['Alonso-Fernandez', 'Fernando', ''], ['Fierrez', 'Julian', ''], ['Ortega-Garcia', 'Javier', '']]","['Fingerprints', 'liveness detection', 'quality assessment', 'security evaluation', 'vulnerabilities', 'countermeasures']"
7457,2007.04524,Yingjie Hu,"Jimin Wang, Yingjie Hu","Enhancing spatial and textual analysis with EUPEG: an extensible and
  unified platform for evaluating geoparsers",,"Transactions in GIS, 2019, 23(6), 1393-1419",10.1111/tgis.12579,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A rich amount of geographic information exists in unstructured texts, such as
Web pages, social media posts, housing advertisements, and historical archives.
Geoparsers are useful tools that extract structured geographic information from
unstructured texts, thereby enabling spatial analysis on textual data. While a
number of geoparsers were developed, they were tested on different datasets
using different metrics. Consequently, it is difficult to compare existing
geoparsers or to compare a new geoparser with existing ones. In recent years,
researchers created open and annotated corpora for testing geoparsers. While
these corpora are extremely valuable, much effort is still needed for a
researcher to prepare these datasets and deploy geoparsers for comparative
experiments. This paper presents EUPEG: an Extensible and Unified Platform for
Evaluating Geoparsers. EUPEG is an open source and Web based benchmarking
platform which hosts a majority of open corpora, geoparsers, and performance
metrics reported in the literature. It enables direct comparison of the hosted
geoparsers, and a new geoparser can be connected to EUPEG and compared with
other geoparsers. The main objective of EUPEG is to reduce the time and effort
that researchers have to spend in preparing datasets and baselines, thereby
increasing the efficiency and effectiveness of comparative experiments.
","[{'version': 'v1', 'created': 'Thu, 9 Jul 2020 03:00:02 GMT'}]",2020-07-10,"[['Wang', 'Jimin', ''], ['Hu', 'Yingjie', '']]","['geoparsing', 'benchmarking platform', 'toponym', 'spatial and textual analysis', 'geospatial semantics', 'geographic information retrieval']"
7458,2002.09565,Micah Goldblum,"Micah Goldblum, Avi Schwarzschild, Ankit B. Patel, Tom Goldstein","Adversarial Attacks on Machine Learning Systems for High-Frequency
  Trading",ACM International Conference on AI in Finance (ICAIF) 2021,,10.1145/3490354.3494367,,cs.LG cs.CR q-fin.ST,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Algorithmic trading systems are often completely automated, and deep learning
is increasingly receiving attention in this domain. Nonetheless, little is
known about the robustness properties of these models. We study valuation
models for algorithmic trading from the perspective of adversarial machine
learning. We introduce new attacks specific to this domain with size
constraints that minimize attack costs. We further discuss how these attacks
can be used as an analysis tool to study and evaluate the robustness properties
of financial models. Finally, we investigate the feasibility of realistic
adversarial attacks in which an adversarial trader fools automated trading
systems into making inaccurate predictions.
","[{'version': 'v1', 'created': 'Fri, 21 Feb 2020 22:04:35 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Mar 2020 18:20:18 GMT'}, {'version': 'v3', 'created': 'Tue, 3 Nov 2020 01:55:01 GMT'}, {'version': 'v4', 'created': 'Fri, 29 Oct 2021 20:06:54 GMT'}]",2021-11-02,"[['Goldblum', 'Micah', ''], ['Schwarzschild', 'Avi', ''], ['Patel', 'Ankit B.', ''], ['Goldstein', 'Tom', '']]","['Machine learning', 'adversarial attack', 'finance', 'trading', 'HFT']"
7459,1412.3325,Bernhard Rumpe,"Martin Henze, Lars Hermerschmidt, Daniel Kerpen, Roger H\""au{\ss}ling,
  Bernhard Rumpe, Klaus Wehrle","User-driven Privacy Enforcement for Cloud-based Services in the Internet
  of Things","6 pages, 2 figures, 1 listing. The 2nd International Conference on
  Future Internet of Things and Cloud (FiCloud-2014)",,10.1109/FiCloud.2014.38,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet of Things devices are envisioned to penetrate essentially all
aspects of life, including homes and urbanspaces, in use cases such as health
care, assisted living, and smart cities. One often proposed solution for
dealing with the massive amount of data collected by these devices and offering
services on top of them is the federation of the Internet of Things and cloud
computing. However, user acceptance of such systems is a critical factor that
hinders the adoption of this promising approach due to severe privacy concerns.
We present UPECSI, an approach for user-driven privacy enforcement for
cloud-based services in the Internet of Things to address this critical factor.
UPECSI enables enforcement of all privacy requirements of the user once her
sensitive data leaves the border of her network, provides a novel approach for
the integration of privacy functionality into the development process of
cloud-based services, and offers the user an adaptable and transparent
configuration of her privacy requirements. Hence, UPECSI demonstrates an
approach for realizing user-accepted cloud services in the Internet of Things.
","[{'version': 'v1', 'created': 'Tue, 9 Dec 2014 14:02:52 GMT'}]",2020-03-17,"[['Henze', 'Martin', ''], ['Hermerschmidt', 'Lars', ''], ['Kerpen', 'Daniel', ''], ['Häußling', 'Roger', ''], ['Rumpe', 'Bernhard', ''], ['Wehrle', 'Klaus', '']]","['Internet of Things', 'Cloud Computing', 'Privacy', 'Model-driven', 'User-acceptance', 'Services', 'Development']"
7460,2004.08599,Adnan Darwiche,Adnan Darwiche,Three Modern Roles for Logic in AI,To be published in PODS 2020,,10.1145/3375395.3389131,,cs.AI cs.LG cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider three modern roles for logic in artificial intelligence, which
are based on the theory of tractable Boolean circuits: (1) logic as a basis for
computation, (2) logic for learning from a combination of data and knowledge,
and (3) logic for reasoning about the behavior of machine learning systems.
","[{'version': 'v1', 'created': 'Sat, 18 Apr 2020 11:51:13 GMT'}]",2020-04-21,"[['Darwiche', 'Adnan', '']]","['tractable circuits', 'knowledge compilation', 'explainable AI']"
7461,2111.06714,Rune Jacobsen H,"Liping Shi, N\'estor J. Hern\'andez Marcano, and Rune Hylsberg
  Jacobsen","A Review on Communication Protocols for Autonomous Unmanned Aerial
  Vehicles for Inspection Application",28 pages,,10.1016/j.micpro.2021.104340,,cs.NI cs.RO,http://creativecommons.org/licenses/by/4.0/,"  The communication system is a critical part of the system design for the
autonomous UAV. It has to address different considerations, including
efficiency, reliability and mobility of the UAV. In addition, a multi-UAV
system requires a communication system to assist information sharing, task
allocation and collaboration in a team of UAVs. In this paper, we review
communication solutions for supporting a team of UAVs while considering an
application in the power line inspection industry. We provide a review of
candidate wireless communication technologies {for supporting communication in
UAV applications. Performance measurements and UAV-related channel modeling of
those candidate technologies are reviewed. A discussion of current technologies
for building UAV mesh networks is presented. We then analyze the structure,
interface and performance of robotic communication middleware, ROS and ROS2.
Based on our review, the features and dependencies of candidate solutions in
each layer of the communication system are presented.
","[{'version': 'v1', 'created': 'Fri, 12 Nov 2021 13:32:48 GMT'}]",2021-11-15,"[['Shi', 'Liping', ''], ['Marcano', 'Néstor J. Hernández', ''], ['Jacobsen', 'Rune Hylsberg', '']]","['Wireless communication', 'mesh network', 'robot operating system (ROS)', 'Unmanned Aerial Vehicle (UAV)']"
7462,1911.03441,Chao Wang,"Chao Wang, Yi Hou, and Matthew Barth","Data-Driven Multi-step Demand Prediction for Ride-hailing Services Using
  Convolutional Neural Network",,"Advances in Computer Vision. CVC 2019. Advances in Intelligent
  Systems and Computing, vol 944",10.1007/978-3-030-17798-0_2,,cs.LG cs.SY eess.SP eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ride-hailing services are growing rapidly and becoming one of the most
disruptive technologies in the transportation realm. Accurate prediction of
ride-hailing trip demand not only enables cities to better understand people's
activity patterns, but also helps ride-hailing companies and drivers make
informed decisions to reduce deadheading vehicle miles traveled, traffic
congestion, and energy consumption. In this study, a convolutional neural
network (CNN)-based deep learning model is proposed for multi-step ride-hailing
demand prediction using the trip request data in Chengdu, China, offered by
DiDi Chuxing. The CNN model is capable of accurately predicting the
ride-hailing pick-up demand at each 1-km by 1-km zone in the city of Chengdu
for every 10 minutes. Compared with another deep learning model based on long
short-term memory, the CNN model is 30% faster for the training and predicting
process. The proposed model can also be easily extended to make multi-step
predictions, which would benefit the on-demand shared autonomous vehicles
applications and fleet operators in terms of supply-demand rebalancing. The
prediction error attenuation analysis shows that the accuracy stays acceptable
as the model predicts more steps.
","[{'version': 'v1', 'created': 'Fri, 8 Nov 2019 18:49:12 GMT'}]",2019-11-11,"[['Wang', 'Chao', ''], ['Hou', 'Yi', ''], ['Barth', 'Matthew', '']]","['Ride-hailing', 'Demand Prediction', 'Convolutional Neural Network']"
7463,2207.05688,Chen Zhang,"Chen Zhang, Luchin Chang, Songruoyao Wu, Xu Tan, Tao Qin, Tie-Yan Liu,
  Kejun Zhang","ReLyMe: Improving Lyric-to-Melody Generation by Incorporating
  Lyric-Melody Relationships","Accepted by ACMMM 2022, oral",,10.1145/3503161.3548357,,cs.SD cs.MM eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lyric-to-melody generation, which generates melody according to given lyrics,
is one of the most important automatic music composition tasks. With the rapid
development of deep learning, previous works address this task with end-to-end
neural network models. However, deep learning models cannot well capture the
strict but subtle relationships between lyrics and melodies, which compromises
the harmony between lyrics and generated melodies. In this paper, we propose
ReLyMe, a method that incorporates Relationships between Lyrics and Melodies
from music theory to ensure the harmony between lyrics and melodies.
Specifically, we first introduce several principles that lyrics and melodies
should follow in terms of tone, rhythm, and structure relationships. These
principles are then integrated into neural network lyric-to-melody models by
adding corresponding constraints during the decoding process to improve the
harmony between lyrics and melodies. We use a series of objective and
subjective metrics to evaluate the generated melodies. Experiments on both
English and Chinese song datasets show the effectiveness of ReLyMe,
demonstrating the superiority of incorporating lyric-melody relationships from
the music domain into neural lyric-to-melody generation.
","[{'version': 'v1', 'created': 'Tue, 12 Jul 2022 17:09:44 GMT'}]",2022-07-13,"[['Zhang', 'Chen', ''], ['Chang', 'Luchin', ''], ['Wu', 'Songruoyao', ''], ['Tan', 'Xu', ''], ['Qin', 'Tao', ''], ['Liu', 'Tie-Yan', ''], ['Zhang', 'Kejun', '']]","['lyric-to-melody', 'knowledge-guided generation', 'domain knowledge', 'deep learning']"
7464,1802.01226,Andr\'e Platzer,Andr\'e Platzer and Yong Kiam Tan,"Differential Equation Axiomatization: The Impressive Power of
  Differential Ghosts","LICS '18: 33rd Annual ACM/IEEE Symposium on Logic in Computer
  Science, July 9-12, 2018, Oxford, United Kingdom, ACM ISBN
  978-1-4503-5583-4/18/07",,10.1145/3209108.3209147,CMU-CS-17-117,cs.LO cs.PL math.CA math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove the completeness of an axiomatization for differential equation
invariants. First, we show that the differential equation axioms in
differential dynamic logic are complete for all algebraic invariants. Our proof
exploits differential ghosts, which introduce additional variables that can be
chosen to evolve freely along new differential equations. Cleverly chosen
differential ghosts are the proof-theoretical counterpart of dark matter. They
create new hypothetical state, whose relationship to the original state
variables satisfies invariants that did not exist before. The reflection of
these new invariants in the original system then enables its analysis.
  We then show that extending the axiomatization with existence and uniqueness
axioms makes it complete for all local progress properties, and further
extension with a real induction axiom makes it complete for all real arithmetic
invariants. This yields a parsimonious axiomatization, which serves as the
logical foundation for reasoning about invariants of differential equations.
Moreover, our results are purely axiomatic, and so the axiomatization is
suitable for sound implementation in foundational theorem provers.
","[{'version': 'v1', 'created': 'Mon, 5 Feb 2018 00:54:36 GMT'}, {'version': 'v2', 'created': 'Tue, 1 May 2018 03:38:14 GMT'}, {'version': 'v3', 'created': 'Mon, 10 Jun 2019 22:02:09 GMT'}]",2019-06-12,"[['Platzer', 'André', ''], ['Tan', 'Yong Kiam', '']]","['differential equation axiomatization', 'differential dynamic logic', 'differential ghosts']"
7465,2011.04337,Pooja Gupta,"Pooja Gupta, Jyoti Maggu, Angshul Majumdar, Emilie Chouzenoux,
  Giovanni Chierchia","DeConFuse : A Deep Convolutional Transform based Unsupervised Fusion
  Framework",Accepted at EURASIP JASP 2020,,10.1186/s13634-020-00684-5,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work proposes an unsupervised fusion framework based on deep
convolutional transform learning. The great learning ability of convolutional
filters for data analysis is well acknowledged. The success of convolutive
features owes to convolutional neural network (CNN). However, CNN cannot
perform learning tasks in an unsupervised fashion. In a recent work, we show
that such shortcoming can be addressed by adopting a convolutional transform
learning (CTL) approach, where convolutional filters are learnt in an
unsupervised fashion. The present paper aims at (i) proposing a deep version of
CTL; (ii) proposing an unsupervised fusion formulation taking advantage of the
proposed deep CTL representation; (iii) developing a mathematically sounded
optimization strategy for performing the learning task. We apply the proposed
technique, named DeConFuse, on the problem of stock forecasting and trading.
Comparison with state-of-the-art methods (based on CNN and long short-term
memory network) shows the superiority of our method for performing a reliable
feature extraction.
","[{'version': 'v1', 'created': 'Mon, 9 Nov 2020 11:04:09 GMT'}]",2020-11-10,"[['Gupta', 'Pooja', ''], ['Maggu', 'Jyoti', ''], ['Majumdar', 'Angshul', ''], ['Chouzenoux', 'Emilie', ''], ['Chierchia', 'Giovanni', '']]","['information fusion', 'deep learning', 'convolution', 'stock trading', 'financial forecasting']"
7466,1710.09995,Anthony Chronopoulos,"Yong-Xian Wang, Li-Lun Zhang, Wei Liu, Xing-Hua Cheng, Yu Zhuang,
  Anthony T. Chronopoulos","Performance optimizations for scalable CFD applications on hybrid
  CPU+MIC heterogeneous computing system with millions of cores","12pages, 12 figures",,10.1016/j.compfluid.2018.03.005,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For computational fluid dynamics (CFD) applications with a large number of
grid points/cells, parallel computing is a common efficient strategy to reduce
the computational time. How to achieve the best performance in the modern
supercomputer system, especially with heterogeneous computing resources such as
hybrid CPU+GPU, or a CPU + Intel Xeon Phi (MIC) co-processors, is still a great
challenge.
  An in-house parallel CFD code capable of simulating three dimensional
structured grid applications is developed and tested in this study. Several
methods of parallelization, performance optimization and code tuning both in
the CPU-only homogeneous system and in the heterogeneous system are proposed
based on identifying potential parallelism of applications, balancing the work
load among all kinds of computing devices, tuning the multi-thread code toward
better performance in intra-machine node with hundreds of CPU/MIC cores, and
optimizing the communication among inter-nodes, inter-cores, and between CPUs
and MICs.
  Some benchmark cases from model and/or industrial CFD applications are tested
on the Tianhe-1A and Tianhe-2 supercomputer to evaluate the performance. Among
these CFD cases, the maximum number of grid cells reached 780 billion. The
tuned solver successfully scales up to half of the entire Tianhe-2
supercomputer system with over 1.376 million of heterogeneous cores. The test
results and performance analysis are discussed in detail.
","[{'version': 'v1', 'created': 'Fri, 27 Oct 2017 06:06:47 GMT'}]",2018-03-12,"[['Wang', 'Yong-Xian', ''], ['Zhang', 'Li-Lun', ''], ['Liu', 'Wei', ''], ['Cheng', 'Xing-Hua', ''], ['Zhuang', 'Yu', ''], ['Chronopoulos', 'Anthony T.', '']]","['computational fluid dynamics', 'parallel computing', 'Tianhe-2 supercomputer', 'CPU+MIC heterogeneouscomputing']"
7467,2103.16312,Khodr Jaber,Khodr Jaber,"FastCTF: A Robust Solver for Conduction Transfer Function Coefficients
  and Thermal Response Factors",,,10.1016/j.enbuild.2021.111461,,cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Conduction transfer functions (CTF) are commonly used in the building
services to quickly estimate hourly conduction heat loads through multilayered
walls without resorting to expensive, time-consuming solutions of the heat
equation. It is essential for any software developed for this purpose to be
able to simulate walls of varying weight with a high degree of accuracy. A
robust algorithm for computing CTF coefficients and thermal response factors
based on power series expansions of solutions of the governing equations in the
complex s-domain is presented and validated. These series expansions are used
to to construct Pad\'e approximants of the system's transfer functions, which
greatly simplifies the inversion of the solution from the complex domain to the
time domain, and allows for an easy recovery of a time series representation
via the Z-transform. The algorithm is also implemented in an open-source C++
code. Its performance is validated with respect to exact theoretical frequency
characteristics and its results are compared with data generated by previously
established methods for computing CTF coefficients / response factors.
","[{'version': 'v1', 'created': 'Tue, 30 Mar 2021 13:03:36 GMT'}]",2021-10-26,"[['Jaber', 'Khodr', '']]","['CTF Coefficients', 'Thermal Response Factors', 'Heat Flow Calculations', 'Transient Heat Conduction']"
7468,1809.03920,Benjamin Finley,"Benjamin Finley, Tapio Soikkeli",Multidevice mobile sessions: A first look,Accepted Manuscript,"B. Finley, T. Soikkeli, Multidevice mobile sessions: A first look,
  Pervasive and Mobile Computing, Volume 39, 2017, Pages 267-283",10.1016/j.pmcj.2016.11.001,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing number of users with multiple mobile devices underscores the
importance of understanding how users interact, often simultaneously, with
these multiple devices. However, most device based monitoring studies have
focused only on a single device type. In contrast, we study the multidevice
usage of a US-based panel through device based monitoring on panelist's
smartphone and tablet devices. We present a broad range of results from
characterizing individual multidevice sessions to estimating device usage
substitution. For example, we find that for panelists, 50% of all device
interaction time can be considered multidevice usage.
","[{'version': 'v1', 'created': 'Tue, 11 Sep 2018 14:22:25 GMT'}]",2018-09-12,"[['Finley', 'Benjamin', ''], ['Soikkeli', 'Tapio', '']]","['Mobile Device', 'Multidevice Usage', 'Mobile Session', 'Device Substitution']"
7469,1709.00362,Gregory Tsipenyuk,"Gregory Tsipenyuk, Jon Crowcroft","An Email Attachment is Worth a Thousand Words, or Is It?","12 pages, 4 figures, 7 tables, IML'17, Liverpool, UK",,10.1145/3109761.3109765,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is an extensive body of research on Social Network Analysis (SNA) based
on the email archive. The network used in the analysis is generally extracted
either by capturing the email communication in From, To, Cc and Bcc email
header fields or by the entities contained in the email message. In the latter
case, the entities could be, for instance, the bag of words, url's, names,
phones, etc. It could also include the textual content of attachments, for
instance Microsoft Word documents, excel spreadsheets, or Adobe pdfs. The nodes
in this network represent users and entities. The edges represent communication
between users and relations to the entities. We suggest taking a different
approach to the network extraction and use attachments shared between users as
the edges. The motivation for this is two-fold. First, attachments represent
the ""intimacy"" manifestation of the relation's strength. Second, the
statistical analysis of private email archives that we collected and Enron
email corpus shows that the attachments contribute in average around 80-90% to
the archive's disk-space usage, which means that most of the data is presently
ignored in the SNA of email archives. Consequently, we hypothesize that this
approach might provide more insight into the social structure of the email
archive. We extract the communication and shared attachments networks from
Enron email corpus. We further analyze degree, betweenness, closeness, and
eigenvector centrality measures in both networks and review the differences and
what can be learned from them. We use nearest neighbor algorithm to generate
similarity groups for five Enron employees. The groups are consistent with
Enron's organizational chart, which validates our approach.
","[{'version': 'v1', 'created': 'Fri, 1 Sep 2017 15:21:41 GMT'}]",2017-09-04,"[['Tsipenyuk', 'Gregory', ''], ['Crowcroft', 'Jon', '']]","['Social Network Analysis', 'email', 'email attachment']"
7470,2001.02139,Jens Stoye,"Leonard Bohnenk\""amper, Mar\'ilia D. V. Braga, Daniel Doerr, Jens
  Stoye",Computing the rearrangement distance of natural genomes,,"Lecture Notes in Computer Science, vol 12074, 2020",10.1007/978-3-030-45257-5_1,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The computation of genomic distances has been a very active field of
computational comparative genomics over the last 25 years. Substantial results
include the polynomial-time computability of the inversion distance by
Hannenhalli and Pevzner in 1995 and the introduction of the double-cut and join
(DCJ) distance by Yancopoulos et al. in 2005. Both results, however, rely on
the assumption that the genomes under comparison contain the same set of unique
markers (syntenic genomic regions, sometimes also referred to as genes). In
2015, Shao, Lin and Moret relax this condition by allowing for duplicate
markers in the analysis. This generalized version of the genomic distance
problem is NP-hard, and they give an ILP solution that is efficient enough to
be applied to real-world datasets. A restriction of their approach is that it
can be applied only to balanced genomes, that have equal numbers of duplicates
of any marker. Therefore it still needs a delicate preprocessing of the input
data in which excessive copies of unbalanced markers have to be removed.
  In this paper we present an algorithm solving the genomic distance problem
for natural genomes, in which any marker may occur an arbitrary number of
times. Our method is based on a new graph data structure, the multi-relational
diagram, that allows an elegant extension of the ILP by Shao, Lin and Moret to
count runs of markers that are under- or over-represented in one genome with
respect to the other and need to be inserted or deleted, respectively. With
this extension, previous restrictions on the genome configurations are lifted,
for the first time enabling an uncompromising rearrangement analysis. Any
marker sequence can directly be used for the distance calculation.
  The evaluation of our approach shows that it can be used to analyze genomes
with up to a few ten thousand markers, which we demonstrate on simulated and
real data.
","[{'version': 'v1', 'created': 'Tue, 7 Jan 2020 15:55:52 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Jan 2020 13:49:47 GMT'}, {'version': 'v3', 'created': 'Wed, 15 Apr 2020 15:28:36 GMT'}, {'version': 'v4', 'created': 'Fri, 2 Oct 2020 18:40:45 GMT'}]",2021-08-11,"[['Bohnenkämper', 'Leonard', ''], ['Braga', 'Marília D. V.', ''], ['Doerr', 'Daniel', ''], ['Stoye', 'Jens', '']]","['Comparative genomics', 'Genome rearrangements', 'DCJ-indel distance']"
7471,2202.10065,Donghoon Shin,"Donghoon Shin, Subeen Park, Esther Hehsun Kim, Soomin Kim, Jinwook
  Seo, Hwajung Hong","Exploring the Effects of AI-assisted Emotional Support Processes in
  Online Mental Health Community",Accepted at CHI 2022 (Late-Breaking Work),,10.1145/3491101.3519854,,cs.HC cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Social support in online mental health communities (OMHCs) is an effective
and accessible way of managing mental wellbeing. In this process, sharing
emotional supports is considered crucial to the thriving social supports in
OMHCs, yet often difficult for both seekers and providers. To support
empathetic interactions, we design an AI-infused workflow that allows users to
write emotional supporting messages to other users' posts based on the
elicitation of the seeker's emotion and contextual keywords from writing. Based
on a preliminary user study (N = 10), we identified that the system helped
seekers to clarify emotion and describe text concretely while writing a post.
Providers could also learn how to react empathetically to the post. Based on
these results, we suggest design implications for our proposed system.
","[{'version': 'v1', 'created': 'Mon, 21 Feb 2022 09:25:36 GMT'}]",2022-02-22,"[['Shin', 'Donghoon', ''], ['Park', 'Subeen', ''], ['Kim', 'Esther Hehsun', ''], ['Kim', 'Soomin', ''], ['Seo', 'Jinwook', ''], ['Hong', 'Hwajung', '']]","['online mental health community', 'AI-infused system', 'emotionalsupport', 'peer support']"
7472,1805.00748,Salomon Sickert,Javier Esparza and Jan Kretinsky and Salomon Sickert,"One Theorem to Rule Them All: A Unified Translation of LTL into
  {\omega}-Automata",,,10.1145/3209108.3209161,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a unified translation of LTL formulas into deterministic Rabin
automata, limit-deterministic B\""uchi automata, and nondeterministic B\""uchi
automata. The translations yield automata of asymptotically optimal size
(double or single exponential, respectively). All three translations are
derived from one single Master Theorem of purely logical nature. The Master
Theorem decomposes the language of a formula into a positive boolean
combination of languages that can be translated into {\omega}-automata by
elementary means. In particular, Safra's, ranking, and breakpoint constructions
used in other translations are not needed.
","[{'version': 'v1', 'created': 'Wed, 2 May 2018 11:55:07 GMT'}]",2018-05-03,"[['Esparza', 'Javier', ''], ['Kretinsky', 'Jan', ''], ['Sickert', 'Salomon', '']]","['Linear temporal logic', 'Automata over infinite words', 'Deterministic automata', 'Non-deterministic automata']"
7473,2010.08070,Przemyslaw Musialski,"Kurt Leimer, Przemyslaw Musialski","Analysis of a Reduced-Order Model for the Simulation of Elastic
  Geometric Zigzag-Spring Meta-Materials","14 pages, 12 figures, published in Computers & Graphics, extended
  version of arXiv:2010.08070",,10.1016/j.cag.2021.10.007,,cs.GR cond-mat.mtrl-sci cond-mat.soft,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze the performance of a reduced-order simulation of geometric
meta-materials based on zigzag patterns using a simplified representation. As
geometric meta-materials we denote planar cellular structures which can be
fabricated in 2d and bent elastically such that they approximate doubly-curved
2-manifold surfaces in 3d space. They obtain their elasticity attributes mainly
from the geometry of their cellular elements and their connections. In this
paper we focus on cells build from so-called zigzag springs. The physical
properties of the base material (i.e., the physical substance) influence the
behavior as well, but we essentially factor them out by keeping them constant.
  The simulation of such complex geometric structures comes with a high
computational cost, thus we propose an approach to reduce it by abstracting the
zigzag cells by a simpler model and by learning the properties of their elastic
deformation behavior. In particular, we analyze the influence of the sampling
of the full parameter space and the expressiveness of the reduced model
compared to the full model. Based on these observations, we draw conclusions on
how to simulate such complex meso-structures with simpler models.
","[{'version': 'v1', 'created': 'Thu, 15 Oct 2020 23:31:41 GMT'}, {'version': 'v2', 'created': 'Sat, 13 Nov 2021 20:34:47 GMT'}]",2022-10-25,"[['Leimer', 'Kurt', ''], ['Musialski', 'Przemyslaw', '']]","['computational design', 'fabrication', 'elastic deformation', 'meso-structures', 'meta-materials']"
7474,2108.09091,Renhe Jiang,"Renhe Jiang, Du Yin, Zhaonan Wang, Yizhuo Wang, Jiewen Deng, Hangchen
  Liu, Zekun Cai, Jinliang Deng, Xuan Song, Ryosuke Shibasaki","DL-Traff: Survey and Benchmark of Deep Learning Models for Urban Traffic
  Prediction",This paper has been accepted by CIKM 2021 Resource Track,,10.1145/3459637.3482000,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Nowadays, with the rapid development of IoT (Internet of Things) and CPS
(Cyber-Physical Systems) technologies, big spatiotemporal data are being
generated from mobile phones, car navigation systems, and traffic sensors. By
leveraging state-of-the-art deep learning technologies on such data, urban
traffic prediction has drawn a lot of attention in AI and Intelligent
Transportation System community. The problem can be uniformly modeled with a 3D
tensor (T, N, C), where T denotes the total time steps, N denotes the size of
the spatial domain (i.e., mesh-grids or graph-nodes), and C denotes the
channels of information. According to the specific modeling strategy, the
state-of-the-art deep learning models can be divided into three categories:
grid-based, graph-based, and multivariate time-series models. In this study, we
first synthetically review the deep traffic models as well as the widely used
datasets, then build a standard benchmark to comprehensively evaluate their
performances with the same settings and metrics. Our study named DL-Traff is
implemented with two most popular deep learning frameworks, i.e., TensorFlow
and PyTorch, which is already publicly available as two GitHub repositories
https://github.com/deepkashiwa20/DL-Traff-Grid and
https://github.com/deepkashiwa20/DL-Traff-Graph. With DL-Traff, we hope to
deliver a useful resource to researchers who are interested in spatiotemporal
data analysis.
","[{'version': 'v1', 'created': 'Fri, 20 Aug 2021 10:08:26 GMT'}]",2021-08-23,"[['Jiang', 'Renhe', ''], ['Yin', 'Du', ''], ['Wang', 'Zhaonan', ''], ['Wang', 'Yizhuo', ''], ['Deng', 'Jiewen', ''], ['Liu', 'Hangchen', ''], ['Cai', 'Zekun', ''], ['Deng', 'Jinliang', ''], ['Song', 'Xuan', ''], ['Shibasaki', 'Ryosuke', '']]","['traffic prediction', 'multivariate time-series', 'deep learning', 'ubiquitous and mobile computing', 'survey and benchmark']"
7475,2003.11139,Milena Tsvetkova,Ji Eun Kim and Milena Tsvetkova,Cheating in online gaming spreads through observation and victimization,,"Kim, J., & Tsvetkova, M. (2021). Cheating in online gaming spreads
  through observation and victimization. Network Science, 9(4), 425-442",10.1017/nws.2021.19,,cs.SI cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Antisocial behavior can be contagious, spreading from individual to
individual and rippling through social networks. Moreover, it can spread not
only through third-party influence from observation, just like innovations or
individual behavior do, but also through direct experience, via
""pay-it-forward"" retaliation. Here, we distinguish between the effects of
observation and victimization for the contagion of antisocial behavior by
analyzing large-scale digital-trace data. We study the spread of cheating in
more than a million matches of an online multiplayer first-person shooter game,
in which up to 100 players compete individually or in teams against strangers.
We identify event sequences in which a player who observes or is killed by a
certain number of cheaters starts cheating, and evaluate the extent to which
these sequences would appear if we preserve the team and interaction structure
but assume alternative gameplay scenarios. The results reveal that social
contagion is only likely to exist for those who both observe and experience
cheating, suggesting that third-party influence and ""pay-it-forward""
reciprocity interact positively. In addition, the effect is present only for
those who both observe and experience more than once, suggesting that cheating
is more likely to spread after repeated or multi-source exposure. Approaching
online games as models of social systems, we use the findings to discuss
strategies for targeted interventions to stem the spread of cheating and
antisocial behavior more generally in online communities, schools,
organizations, and sports.
","[{'version': 'v1', 'created': 'Tue, 24 Mar 2020 22:38:07 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Jan 2022 14:45:30 GMT'}]",2022-01-28,"[['Kim', 'Ji Eun', ''], ['Tsvetkova', 'Milena', '']]","['social contagion', 'antisocial behavior', 'temporal networks', 'online multiplayer games']"
7476,2110.06410,Satyaki Sikdar,"Satyaki Sikdar, Neil Shah, Tim Weninger",Attributed Graph Modeling with Vertex Replacement Grammars,"9 pages, 2 tables, 10 figures. Accepted as a regular paper at WSDM
  2021",,10.1145/3488560.3498492,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Recent work at the intersection of formal language theory and graph theory
has explored graph grammars for graph modeling. However, existing models and
formalisms can only operate on homogeneous (i.e., untyped or unattributed)
graphs. We relax this restriction and introduce the Attributed Vertex
Replacement Grammar (AVRG), which can be efficiently extracted from
heterogeneous (i.e., typed, colored, or attributed) graphs. Unlike current
state-of-the-art methods, which train enormous models over complicated deep
neural architectures, the AVRG model is unsupervised and interpretable. It is
based on context-free string grammars and works by encoding graph rewriting
rules into a graph grammar containing graphlets and instructions on how they
fit together. We show that the AVRG can encode succinct models of input graphs
yet faithfully preserve their structure and assortativity properties.
Experiments on large real-world datasets show that graphs generated from the
AVRG model exhibit substructures and attribute configurations that match those
found in the input networks.
","[{'version': 'v1', 'created': 'Wed, 13 Oct 2021 00:26:35 GMT'}]",2023-01-06,"[['Sikdar', 'Satyaki', ''], ['Shah', 'Neil', ''], ['Weninger', 'Tim', '']]","['Graph models', 'assortativity', 'graph generation', 'attributed graphs']"
7477,1910.06658,Linas Petkevicius,"Povilas Daniusis, Shubham Juneja, Lukas Valatka, Linas Petkevicius",Topological Navigation Graph Framework,,,10.1007/s10514-021-09980-x,,cs.RO cs.AI cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We focus on the utilisation of reactive trajectory imitation controllers for
goal-directed mobile robot navigation. We propose a topological navigation
graph (TNG) - an imitation-learning-based framework for navigating through
environments with intersecting trajectories. The TNG framework represents the
environment as a directed graph composed of deep neural networks. Each vertex
of the graph corresponds to a trajectory and is represented by a trajectory
identification classifier and a trajectory imitation controller. For trajectory
following, we propose the novel use of neural object detection architectures.
The edges of TNG correspond to intersections between trajectories and are all
represented by a classifier. We provide empirical evaluation of the proposed
navigation framework and its components in simulated and real-world
environments, demonstrating that TNG allows us to utilise non-goal-directed,
imitation-learning methods for goal-directed autonomous navigation.
","[{'version': 'v1', 'created': 'Tue, 15 Oct 2019 11:19:00 GMT'}, {'version': 'v2', 'created': 'Thu, 13 May 2021 18:02:46 GMT'}]",2021-05-17,"[['Daniusis', 'Povilas', ''], ['Juneja', 'Shubham', ''], ['Valatka', 'Lukas', ''], ['Petkevicius', 'Linas', '']]","['Autonomous robot navigation', 'topological navigation', 'deep learning', 'neural networks', 'imitation learning', 'SentiBotics']"
7478,2204.12261,Djordje Jevdjic,"Dehui Lin, Yasamin Tabatabaee, Yash Pote, and Djordje Jevdjic",Managing Reliability Skew in DNA Storage,"In Proceedings of the International Symposium on Computer
  Architecture (ISCA 2022)",,10.1145/3470496.3527441,,cs.ET cs.AR cs.IT math.IT,http://creativecommons.org/licenses/by/4.0/,"  DNA is emerging as an increasingly attractive medium for data storage due to
a number of important and unique advantages it offers, most notably the
unprecedented durability and density. While the technology is evolving rapidly,
the prohibitive cost of reads and writes, the high frequency and the peculiar
nature of errors occurring in DNA storage pose a significant challenge to its
adoption. In this work we make a novel observation that the probability of
successful recovery of a given bit from any type of a DNA-based storage system
highly depends on its physical location within the DNA molecule. In other
words, when used as a storage medium, some parts of DNA molecules appear
significantly more reliable than others. We show that large differences in
reliability between different parts of DNA molecules lead to highly inefficient
use of error-correction resources, and that commonly used techniques such as
unequal error-correction cannot be used to bridge the reliability gap between
different locations in the context of DNA storage. We then propose two
approaches to address the problem. The first approach is general and applies to
any types of data; it stripes the data and ECC codewords across DNA molecules
in a particular fashion such that the effects of errors are spread out evenly
across different codewords and molecules, effectively de-biasing the underlying
storage medium. The second approach is application-specific, and seeks to
leverage the underlying reliability bias by using application-aware mapping of
data onto DNA molecules such that data that requires higher reliability is
stored in more reliable locations, whereas data that needs lower reliability is
stored in less reliable parts of DNA molecules. We show that the proposed data
mapping can be used to achieve graceful degradation in the presence of high
error rates, or to implement the concept of approximate storage in DNA.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2022 12:34:46 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Apr 2022 22:09:56 GMT'}]",2022-05-03,"[['Lin', 'Dehui', ''], ['Tabatabaee', 'Yasamin', ''], ['Pote', 'Yash', ''], ['Jevdjic', 'Djordje', '']]","['DNA storage', 'reliability', 'error correction', 'approximate storage']"
7479,2211.01678,Benjamin Chetioui,"Benjamin Chetioui (University of Bergen, Norway), Jaakko J\""arvi
  (University of Turku, Finland), Magne Haveraaen (University of Bergen,
  Norway)","Revisiting Language Support for Generic Programming: When Genericity Is
  a Core Design Goal",,"The Art, Science, and Engineering of Programming, 2023, Vol. 7,
  Issue 2, Article 4",10.22152/programming-journal.org/2023/7/4,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Generic programming, as defined by Stepanov, is a methodology for
writing efficient and reusable algorithms by considering only the required
properties of their underlying data types and operations. Generic programming
has proven to be an effective means of constructing libraries of reusable
software components in languages that support it. Generics-related language
design choices play a major role in how conducive generic programming is in
practice.
  Inquiry: Several mainstream programming languages (e.g. Java and C++) were
first created without generics; features to support generic programming were
added later, gradually. Much of the existing literature on supporting generic
programming focuses thus on retrofitting generic programming into existing
languages and identifying related implementation challenges. Is the programming
experience significantly better, or different when programming with a language
designed for generic programming without limitations from prior language design
choices?
  Approach: We examine Magnolia, a language designed to embody generic
programming. Magnolia is representative of an approach to language design
rooted in algebraic specifications. We repeat a well-known experiment, where we
put Magnolia's generic programming facilities under scrutiny by implementing a
subset of the Boost Graph Library, and reflect on our development experience.
  Knowledge: We discover that the idioms identified as key features for
supporting Stepanov-style generic programming in the previous studies and work
on the topic do not tell a full story. We clarify which of them are more of a
means to an end, rather than fundamental features for supporting generic
programming. Based on the development experience with Magnolia, we identify
variadics as an additional key feature for generic programming and point out
limitations and challenges of genericity by property.
  Grounding: Our work uses a well-known framework for evaluating the generic
programming facilities of a language from the literature to evaluate the
algebraic approach through Magnolia, and we draw comparisons with well-known
programming languages.
  Importance: This work gives a fresh perspective on generic programming, and
clarifies what are fundamental language properties and their trade-offs when
considering supporting Stepanov-style generic programming. The understanding of
how to set the ground for generic programming will inform future language
design.
","[{'version': 'v1', 'created': 'Thu, 3 Nov 2022 09:45:14 GMT'}]",2022-11-04,"[['Chetioui', 'Benjamin', '', 'University of Bergen, Norway'], ['Järvi', 'Jaakko', '', 'University of Turku, Finland'], ['Haveraaen', 'Magne', '', 'University of Bergen,\n  Norway']]","['Generic Programming', 'Algebraic Specifications', 'Graphs', 'Concepts', 'Boost Graph Library']"
7480,2009.02548,Manisha Dubey,"Manisha Dubey, P.K. Srijith, Maunendra Sankar Desarkar","HAP-SAP: Semantic Annotation in LBSNs using Latent Spatio-Temporal
  Hawkes Process",11 pages,,10.1145/3397536.3422233,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The prevalence of location-based social networks (LBSNs) has eased the
understanding of human mobility patterns. Knowledge of human dynamics can aid
in various ways like urban planning, managing traffic congestion, personalized
recommendation etc. These dynamics are influenced by factors like social
impact, periodicity in mobility, spatial proximity, influence among users and
semantic categories etc., which makes location modelling a critical task.
However, categories which act as semantic characterization of the location,
might be missing for some check-ins and can adversely affect modelling the
mobility dynamics of users. At the same time, mobility patterns provide a cue
on the missing semantic category. In this paper, we simultaneously address the
problem of semantic annotation of locations and location adoption dynamics of
users. We propose our model HAP-SAP, a latent spatio-temporal multivariate
Hawkes process, which considers latent semantic category influences, and
temporal and spatial mobility patterns of users. The model parameters and
latent semantic categories are inferred using expectation-maximization
algorithm, which uses Gibbs sampling to obtain posterior distribution over
latent semantic categories. The inferred semantic categories can supplement our
model on predicting the next check-in events by users. Our experiments on real
datasets demonstrate the effectiveness of the proposed model for the semantic
annotation and location adoption modelling tasks.
","[{'version': 'v1', 'created': 'Sat, 5 Sep 2020 15:10:40 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Sep 2020 05:16:36 GMT'}]",2020-09-09,"[['Dubey', 'Manisha', ''], ['Srijith', 'P. K.', ''], ['Desarkar', 'Maunendra Sankar', '']]","['Semantic Annotation', 'Location-based Social Networks', 'Spatio-TemporalHawkes Process']"
7481,1707.00587,Paul Jaeger,"Fabian Isensee, Paul Jaeger, Peter M. Full, Ivo Wolf, Sandy Engelhardt
  and Klaus H. Maier-Hein","Automatic Cardiac Disease Assessment on cine-MRI via Time-Series
  Segmentation and Domain Specific Features",To appear in the STACOM 2017 proceedings,,10.1007/978-3-319-75541-0,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cardiac magnetic resonance imaging improves on diagnosis of cardiovascular
diseases by providing images at high spatiotemporal resolution. Manual
evaluation of these time-series, however, is expensive and prone to biased and
non-reproducible outcomes. In this paper, we present a method that addresses
named limitations by integrating segmentation and disease classification into a
fully automatic processing pipeline. We use an ensemble of UNet inspired
architectures for segmentation of cardiac structures such as the left and right
ventricular cavity (LVC, RVC) and the left ventricular myocardium (LVM) on each
time instance of the cardiac cycle. For the classification task, information is
extracted from the segmented time-series in form of comprehensive features
handcrafted to reflect diagnostic clinical procedures. Based on these features
we train an ensemble of heavily regularized multilayer perceptrons (MLP) and a
random forest classifier to predict the pathologic target class. We evaluated
our method on the ACDC dataset (4 pathology groups, 1 healthy group) and
achieve dice scores of 0.945 (LVC), 0.908 (RVC) and 0.905 (LVM) in a
cross-validation over the training set (100 cases) and 0.950 (LVC), 0.923 (RVC)
and 0.911 (LVM) on the test set (50 cases). We report a classification accuracy
of 94% on a training set cross-validation and 92% on the test set. Our results
underpin the potential of machine learning methods for accurate, fast and
reproducible segmentation and computer-assisted diagnosis (CAD).
","[{'version': 'v1', 'created': 'Mon, 3 Jul 2017 15:10:30 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Jan 2018 08:15:24 GMT'}]",2018-04-06,"[['Isensee', 'Fabian', ''], ['Jaeger', 'Paul', ''], ['Full', 'Peter M.', ''], ['Wolf', 'Ivo', ''], ['Engelhardt', 'Sandy', ''], ['Maier-Hein', 'Klaus H.', '']]","['Automated Cardiac Diagnosis Challenge', 'Cardiac MagneticResonance Imaging', 'Disease Prediction', 'Deep Learning', 'CNN']"
7482,2011.00187,Bingxu Li,"Bingxu Li, Fanyong Cheng, Xin Zhang, Can Cui, Wenjian Cai","A Novel Semi-Supervised Data-Driven Method for Chiller Fault Diagnosis
  with Unlabeled Data",,"Applied Energy, Volume 285, 2021, 116459",10.1016/j.apenergy.2021.116459,,cs.LG cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In practical chiller systems, applying efficient fault diagnosis techniques
can significantly reduce energy consumption and improve energy efficiency of
buildings. The success of the existing methods for fault diagnosis of chillers
relies on the condition that sufficient labeled data are available for
training. However, label acquisition is laborious and costly in practice.
Usually, the number of labeled data is limited and most data available are
unlabeled. The existing methods cannot exploit the information contained in
unlabeled data, which significantly limits the improvement of fault diagnosis
performance in chiller systems. To make effective use of unlabeled data to
further improve fault diagnosis performance and reduce the dependency on
labeled data, we proposed a novel semi-supervised data-driven fault diagnosis
method for chiller systems based on the semi-generative adversarial network,
which incorporates both unlabeled and labeled data into learning process. The
semi-generative adversarial network can learn the information of data
distribution from unlabeled data and this information can help to significantly
improve the diagnostic performance. Experimental results demonstrate the
effectiveness of the proposed method. Under the scenario that there are only 80
labeled samples and 16000 unlabeled samples, the proposed method can improve
the diagnostic accuracy to 84%, while the supervised baseline methods only
reach the accuracy of 65% at most. Besides, the minimal required number of
labeled samples can be reduced by about 60% with the proposed method when there
are enough unlabeled samples.
","[{'version': 'v1', 'created': 'Sat, 31 Oct 2020 04:57:38 GMT'}]",2021-02-08,"[['Li', 'Bingxu', ''], ['Cheng', 'Fanyong', ''], ['Zhang', 'Xin', ''], ['Cui', 'Can', ''], ['Cai', 'Wenjian', '']]","['Fault diagnosis', 'Chiller', 'Semi-Generative adversarial network', 'Unlabeled data', 'Semi-supervised learning']"
7483,1807.07853,Constantinos Loukas,Constantinos Loukas,"Surgical Phase Recognition of Short Video Shots Based on Temporal
  Modeling of Deep Features","6 pages, 4 figures, 6 tables",,10.5220/0007352000210029,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recognizing the phases of a laparoscopic surgery (LS) operation form its
video constitutes a fundamental step for efficient content representation,
indexing and retrieval in surgical video databases. In the literature, most
techniques focus on phase segmentation of the entire LS video using
hand-crafted visual features, instrument usage signals, and recently
convolutional neural networks (CNNs). In this paper we address the problem of
phase recognition of short video shots (10s) of the operation, without
utilizing information about the preceding/forthcoming video frames, their phase
labels or the instruments used. We investigate four state-of-the-art CNN
architectures (Alexnet, VGG19, GoogleNet, and ResNet101), for feature
extraction via transfer learning. Visual saliency was employed for selecting
the most informative region of the image as input to the CNN. Video shot
representation was based on two temporal pooling mechanisms. Most importantly,
we investigate the role of 'elapsed time' (from the beginning of the
operation), and we show that inclusion of this feature can increase performance
dramatically (69% vs. 75% mean accuracy). Finally, a long short-term memory
(LSTM) network was trained for video shot classification based on the fusion of
CNN features with 'elapsed time', increasing the accuracy to 86%. Our results
highlight the prominent role of visual saliency, long-range temporal recursion
and 'elapsed time' (a feature so far ignored), for surgical phase recognition.
","[{'version': 'v1', 'created': 'Fri, 20 Jul 2018 14:10:32 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Sep 2018 11:28:15 GMT'}, {'version': 'v3', 'created': 'Thu, 6 Dec 2018 15:22:49 GMT'}, {'version': 'v4', 'created': 'Fri, 7 Dec 2018 08:00:17 GMT'}]",2021-07-27,"[['Loukas', 'Constantinos', '']]","['surgery', 'video', 'classification', 'CNN', 'LSTM', 'deep']"
7484,1910.00947,Christof Paar,"Pawel Swierczynski and Marc Fyrbiak and Philipp Koppe and Amir Moradi
  and Christof Paar","Interdiction in Practice -- Hardware Trojan Against a High-Security USB
  Flash Drive",,J Cryptogr Eng (2017) 7: 199,10.1007/s13389-016-0132-7,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As part of the revelations about the NSA activities, the notion of
interdiction has become known to the public: the interception of deliveries to
manipulate hardware in a way that backdoors are introduced. Manipulations can
occur on the firmware or at hardware level. With respect to hardware, FPGAs are
particular interesting targets as they can be altered by manipulating the
corresponding bitstream which configures the device. In this paper, we
demonstrate the first successful real-world FPGA hardware Trojan insertion into
a commercial product. On the target device, a FIPS-140-2 level 2 certified USB
flash drive from Kingston, the user data are encrypted using AES-256 in XTS
mode, and the encryption/decryption is processed by an off-the-shelf SRAM-based
FPGA. Our investigation required two reverse-engineering steps, related to the
proprietary FPGA bitstream and to the firmware of the underlying ARM CPU. In
our Trojan insertion scenario, the targeted USB flash drive is intercepted
before being delivered to the victim. The physical Trojan insertion requires
the manipulation of the SPI flash memory content, which contains the FPGA
bitstream as well as the ARM CPU code. The FPGA bitstream manipulation alters
the exploited AES-256 algorithm in a way that it turns into a linear function
which can be broken with 32 known plaintext-ciphertext pairs. After the
manipulated USB flash drive has been used by the victim, the attacker is able
to obtain all user data from the ciphertexts. Our work indeed highlights the
security risks and especially the practical relevance of bitstream modification
attacks that became realistic due to FPGA bitstream manipulations.
","[{'version': 'v1', 'created': 'Tue, 1 Oct 2019 15:29:07 GMT'}]",2019-10-03,"[['Swierczynski', 'Pawel', ''], ['Fyrbiak', 'Marc', ''], ['Koppe', 'Philipp', ''], ['Moradi', 'Amir', ''], ['Paar', 'Christof', '']]","['hardware Trojan', '· real world attack', '·FPGA security', '· AES']"
7485,2203.03379,Zhanhao Hu,"Zhanhao Hu, Tao Wang, Xiaolin Hu",An STDP-Based Supervised Learning Algorithm for Spiking Neural Networks,,"In International Conference on Neural Information Processing 2017
  Nov 14 (pp. 92-100). Springer, Cham",10.1007/978-3-319-70096-0_10,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Compared with rate-based artificial neural networks, Spiking Neural Networks
(SNN) provide a more biological plausible model for the brain. But how they
perform supervised learning remains elusive. Inspired by recent works of Bengio
et al., we propose a supervised learning algorithm based on Spike-Timing
Dependent Plasticity (STDP) for a hierarchical SNN consisting of Leaky
Integrate-and-fire (LIF) neurons. A time window is designed for the presynaptic
neuron and only the spikes in this window take part in the STDP updating
process. The model is trained on the MNIST dataset. The classification accuracy
approach that of a Multilayer Perceptron (MLP) with similar architecture
trained by the standard back-propagation algorithm.
","[{'version': 'v1', 'created': 'Mon, 7 Mar 2022 13:40:09 GMT'}]",2022-03-08,"[['Hu', 'Zhanhao', ''], ['Wang', 'Tao', ''], ['Hu', 'Xiaolin', '']]","['STDP', 'SNN', 'supervised learning']"
7486,1905.06390,Jianfeng Chen,"Jianfeng Chen, Joymallya Chakraborty, Philip Clark, Kevin Haverlock,
  Snehit Cherian and Tim Menzies",Predicting Breakdowns in Cloud Services (with SPIKE),"9 pages, 6 figures, in Proceedings of The 27th ACM Joint European
  Software Engineering Conference and Symposium on the Foundations of Software
  Engineering (ESEC/FSE'19), industry track",,10.1145/3338906.3340450,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Maintaining web-services is a mission-critical task where any down-time means
loss of revenue and reputation (of being a reliable service provider). In the
current competitive web services market, such a loss of reputation causes
extensive loss of future revenue. To address this issue, we developed SPIKE, a
data mining tool which can predict upcoming service breakdowns, half an hour
into the future. Such predictions let an organization alert and assemble the
tiger team to address the problem (e.g. by reconfiguring cloud hardware in
order to reduce the likelihood of that breakdown). SPIKE utilizes (a)
regression tree learning (with CART); (b) synthetic minority over-sampling (to
handle how rare spikes are in our data); (c) hyperparameter optimization (to
learn best settings for our local data) and (d) a technique we called ""topology
sampling"" where training vectors are built from extensive details of an
individual node plus summary details on all their neighbors. In the experiments
reported here, SPIKE predicted service spikes 30 minutes into future with
recalls and precision of 75% and above. Also, SPIKE performed relatively better
than other widely-used learning methods (neural nets, random forests, logistic
regression).
","[{'version': 'v1', 'created': 'Wed, 15 May 2019 18:57:47 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Jun 2019 22:13:59 GMT'}]",2019-06-18,"[['Chen', 'Jianfeng', ''], ['Chakraborty', 'Joymallya', ''], ['Clark', 'Philip', ''], ['Haverlock', 'Kevin', ''], ['Cherian', 'Snehit', ''], ['Menzies', 'Tim', '']]","['Cloud', 'optimization', 'data mining', 'parameter tuning']"
7487,1909.03314,John-Paul Robinson,"John-Paul Robinson, Thomas Anthony, Ravi Tripathi, Sara A. Sims,
  Kristina M. Visscher, Purushotham V. Bangalore","Analyzing the HCP Datasets using GPUs: The Anatomy of a Science
  Engagement","6 pages, 3 figures, PEARC '18: Practice and Experience in Advanced
  Research Computing, July 22--26, 2018, Pittsburgh, PA, USA",,10.1145/3219104.3219163,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper documents the experience improving the performance of a data
processing workflow for analysis of the Human Connectome Project's HCP900 data
set. It describes how network and compute bottlenecks were discovered and
resolved during the course of a science engagement. A series of computational
enhancements to the stock FSL BedpostX workflow are described. These
enhancements migrated the workflow from a slow serial execution of computations
resulting from Slurm scheduler incompatibilities to eventual execution on GPU
resources, going from a 21-day execution on a single CPU core to a 2 hour
execution on a GPU. This workflow contributed a vital use-case to the build-out
of the campus compute cluster with additional GPUs and resulted in enhancements
to network bandwidth. It also shares insights on potential improvements to
distribution of scientific software to avoid stagnation in site-specific
deployment decisions. The discussion highlights the advantages of open licenses
and popular code collaboration sites like GitHub.com in feeding contributions
upstream.
","[{'version': 'v1', 'created': 'Sat, 7 Sep 2019 18:12:52 GMT'}]",2019-09-10,"[['Robinson', 'John-Paul', ''], ['Anthony', 'Thomas', ''], ['Tripathi', 'Ravi', ''], ['Sims', 'Sara A.', ''], ['Visscher', 'Kristina M.', ''], ['Bangalore', 'Purushotham V.', '']]","['Slurm batch scheduler', 'high performance computing', 'GPU', 'researchsupport']"
7488,1907.00359,Krishna Balajirao Manoorkar,"Willem Conradie, Sabine Frittella, Krishna Manoorkar, Sajad Nazari,
  Alessandra Palmigiano, Apostolos Tzimoulis, Nachoem M. Wijnberg",Rough concepts,,,10.1016/j.ins.2020.05.074,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The present paper proposes a novel way to unify Rough Set Theory and Formal
Concept Analysis. Our method stems from results and insights developed in the
algebraic theory of modal logic, and is based on the idea that Pawlak's
original approximation spaces can be seen as special instances of enriched
formal contexts, i.e. relational structures based on formal contexts from
Formal Concept Analysis.
","[{'version': 'v1', 'created': 'Sun, 30 Jun 2019 10:35:20 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Feb 2020 10:28:48 GMT'}]",2021-05-19,"[['Conradie', 'Willem', ''], ['Frittella', 'Sabine', ''], ['Manoorkar', 'Krishna', ''], ['Nazari', 'Sajad', ''], ['Palmigiano', 'Alessandra', ''], ['Tzimoulis', 'Apostolos', ''], ['Wijnberg', 'Nachoem M.', '']]","['Rough set theory', 'formal concept analysis', 'modal logic', 'modal algebras', 'rough concept analysis']"
7489,2101.04012,Raviraj Joshi,"Apurva Wani, Isha Joshi, Snehal Khandve, Vedangi Wagh, Raviraj Joshi",Evaluating Deep Learning Approaches for Covid19 Fake News Detection,Accepted at Contraint@AAAI 2021,,10.1007/978-3-030-73696-5_15,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media platforms like Facebook, Twitter, and Instagram have enabled
connection and communication on a large scale. It has revolutionized the rate
at which information is shared and enhanced its reach. However, another side of
the coin dictates an alarming story. These platforms have led to an increase in
the creation and spread of fake news. The fake news has not only influenced
people in the wrong direction but also claimed human lives. During these
critical times of the Covid19 pandemic, it is easy to mislead people and make
them believe in fatal information. Therefore it is important to curb fake news
at source and prevent it from spreading to a larger audience. We look at
automated techniques for fake news detection from a data mining perspective. We
evaluate different supervised text classification algorithms on Contraint@AAAI
2021 Covid-19 Fake news detection dataset. The classification algorithms are
based on Convolutional Neural Networks (CNN), Long Short Term Memory (LSTM),
and Bidirectional Encoder Representations from Transformers (BERT). We also
evaluate the importance of unsupervised learning in the form of language model
pre-training and distributed word representations using unlabelled covid tweets
corpus. We report the best accuracy of 98.41\% on the Covid-19 Fake news
detection dataset.
","[{'version': 'v1', 'created': 'Mon, 11 Jan 2021 16:39:03 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Jan 2021 17:18:02 GMT'}]",2021-04-13,"[['Wani', 'Apurva', ''], ['Joshi', 'Isha', ''], ['Khandve', 'Snehal', ''], ['Wagh', 'Vedangi', ''], ['Joshi', 'Raviraj', '']]","['fake news', 'convolutional neural networks', 'long short termmemory', 'transformers', 'language model pretraining']"
7490,2110.02044,Wanlin Xie,"Wanlin Xie, Jaime Ide, Daniel Izadi, Sean Banger, Thayne Walker, Ryan
  Ceresani, Dylan Spagnuolo, Christopher Guagliano, Henry Diaz, Jason Twedt","Multi-Object Tracking with Deep Learning Ensemble for Unmanned Aerial
  System Applications",,"Proc. SPIE 11870, Artificial Intelligence and Machine Learning in
  Defense Applications III, 118700I (12 September 2021)",10.1117/12.2600209,,cs.CV cs.LG cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-object tracking (MOT) is a crucial component of situational awareness
in military defense applications. With the growing use of unmanned aerial
systems (UASs), MOT methods for aerial surveillance is in high demand.
Application of MOT in UAS presents specific challenges such as moving sensor,
changing zoom levels, dynamic background, illumination changes, obscurations
and small objects. In this work, we present a robust object tracking
architecture aimed to accommodate for the noise in real-time situations. We
propose a kinematic prediction model, called Deep Extended Kalman Filter
(DeepEKF), in which a sequence-to-sequence architecture is used to predict
entity trajectories in latent space. DeepEKF utilizes a learned image embedding
along with an attention mechanism trained to weight the importance of areas in
an image to predict future states. For the visual scoring, we experiment with
different similarity measures to calculate distance based on entity
appearances, including a convolutional neural network (CNN) encoder,
pre-trained using Siamese networks. In initial evaluation experiments, we show
that our method, combining scoring structure of the kinematic and visual models
within a MHT framework, has improved performance especially in edge cases where
entity motion is unpredictable, or the data presents frames with significant
gaps.
","[{'version': 'v1', 'created': 'Tue, 5 Oct 2021 13:50:38 GMT'}]",2021-10-06,"[['Xie', 'Wanlin', ''], ['Ide', 'Jaime', ''], ['Izadi', 'Daniel', ''], ['Banger', 'Sean', ''], ['Walker', 'Thayne', ''], ['Ceresani', 'Ryan', ''], ['Spagnuolo', 'Dylan', ''], ['Guagliano', 'Christopher', ''], ['Diaz', 'Henry', ''], ['Twedt', 'Jason', '']]","['multi-object tracking', 'deep neural network', 'extended kalman filter', 'long short-term memory network', 'multiple hypothesis tracking']"
7491,2104.03518,Jiakun Liu,"Jiakun Liu, Haoxiang Zhang, Xin Xia, David Lo, Ying Zou, Ahmed E.
  Hassan, Shanping Li","An Exploratory Study on the Repeatedly Shared External Links on Stack
  Overflow",,,10.1007/s10664-021-10028-y,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  On Stack Overflow, users reuse 11,926,354 external links to share the
resources hosted outside the Stack Overflow website. The external links connect
to the existing programming-related knowledge and extend the crowdsourced
knowledge on Stack Overflow. Some of the external links, so-called as repeated
external links, can be shared for multiple times. We observe that 82.5% of the
link sharing activities (i.e., sharing links in any question, answer, or
comment) on Stack Overflow share external resources, and 57.0% of the
occurrences of the external links are sharing the repeated external links.
However, it is still unclear what types of external resources are repeatedly
shared. To help users manage their knowledge, we wish to investigate the
characteristics of the repeated external links in knowledge sharing on Stack
Overflow. In this paper, we analyze the repeated external links on Stack
Overflow. We observe that external links that point to the text resources
(hosted in documentation websites, tutorial websites, etc.) are repeatedly
shared the most. We observe that: 1) different users repeatedly share the same
knowledge in the form of repeated external links, thus increasing the
maintenance effort of knowledge (e.g., update invalid links in multiple posts),
2) the same users can repeatedly share the external links for the purpose of
promotion, and 3) external links can point to webpages with an overload of
information that is difficult for users to retrieve relevant information. Our
findings provide insights to Stack Overflow moderators and researchers. For
example, we encourage Stack Overflow to centrally manage the commonly occurring
knowledge in the form of repeated external links in order to better maintain
the crowdsourced knowledge on Stack Overflow.
","[{'version': 'v1', 'created': 'Thu, 8 Apr 2021 05:41:05 GMT'}]",2022-02-15,"[['Liu', 'Jiakun', ''], ['Zhang', 'Haoxiang', ''], ['Xia', 'Xin', ''], ['Lo', 'David', ''], ['Zou', 'Ying', ''], ['Hassan', 'Ahmed E.', ''], ['Li', 'Shanping', '']]","['Knowledge Sharing', 'Stack Overflow', 'External Link']"
7492,2108.13059,Oleksandr Kosenkov,"Oleksandr Kosenkov, Michael Unterkalmsteiner, Daniel Mendez, Davide
  Fucci","Vision for an Artefact-based Approach to Regulatory Requirements
  Engineering",,,10.1145/3475716.3484191,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Nowadays, regulatory requirements engineering (regulatory RE)
faces challenges of interdisciplinary nature that cannot be tackled due to
existing research gaps. Aims: We envision an approach to solve some of the
challenges related to the nature and complexity of regulatory requirements, the
necessity for domain knowledge, and the involvement of legal experts in
regulatory RE. Method: We suggest the qualitative analysis of regulatory texts
combined with the further case study to develop an empirical foundation for our
research. Results: We outline our vision for the application of extended
artefact-based modeling for regulatory RE. Conclusions: Empirical methodology
is an essential instrument to address interdisciplinarity and complexity in
regulatory RE. Artefact-based modeling supported by empirical results can solve
a particular set of problems while not limiting the application of other
methods and tools and facilitating the interaction between different fields of
practice and research.
","[{'version': 'v1', 'created': 'Mon, 30 Aug 2021 08:35:31 GMT'}]",2021-08-31,"[['Kosenkov', 'Oleksandr', ''], ['Unterkalmsteiner', 'Michael', ''], ['Mendez', 'Daniel', ''], ['Fucci', 'Davide', '']]","['regulatory requirements engineering', 'regulatory compliance', 'software compliance']"
7493,2004.07543,Saisubramaniam Gopalakrishnan,"Saisubramaniam Gopalakrishnan, Pranshu Ranjan Singh, Yasin Yazici,
  Chuan-Sheng Foo, Vijay Chandrasekhar, ArulMurugan Ambikapathi","Classify and Generate: Using Classification Latent Space Representations
  for Image Generations",,"Saisubramaniam Gopalakrishnan, Pranshu Ranjan Singh et. al.,
  Classify and generate: Using classification latent space representations for
  image generations, Neurocomputing, Volume 471, 2022, Pages 296-334, ISSN
  0925-2312",10.1016/j.neucom.2021.10.090,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Utilization of classification latent space information for downstream
reconstruction and generation is an intriguing and a relatively unexplored
area. In general, discriminative representations are rich in class-specific
features but are too sparse for reconstruction, whereas, in autoencoders the
representations are dense but have limited indistinguishable class-specific
features, making them less suitable for classification. In this work, we
propose a discriminative modeling framework that employs manipulated supervised
latent representations to reconstruct and generate new samples belonging to a
given class. Unlike generative modeling approaches such as GANs and VAEs that
aim to model the data manifold distribution, Representation based Generations
(ReGene) directly represent the given data manifold in the classification
space. Such supervised representations, under certain constraints, allow for
reconstructions and controlled generations using an appropriate decoder without
enforcing any prior distribution. Theoretically, given a class, we show that
these representations when smartly manipulated using convex combinations retain
the same class label. Furthermore, they also lead to the novel generation of
visually realistic images. Extensive experiments on datasets of varying
resolutions demonstrate that ReGene has higher classification accuracy than
existing conditional generative models while being competitive in terms of FID.
","[{'version': 'v1', 'created': 'Thu, 16 Apr 2020 09:13:44 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Dec 2021 08:00:11 GMT'}]",2021-12-15,"[['Gopalakrishnan', 'Saisubramaniam', ''], ['Singh', 'Pranshu Ranjan', ''], ['Yazici', 'Yasin', ''], ['Foo', 'Chuan-Sheng', ''], ['Chandrasekhar', 'Vijay', ''], ['Ambikapathi', 'ArulMurugan', '']]","['Classification', 'convex combination', 'supervised latent spacerepresentations', 'image generations']"
7494,1711.10713,Lse Lse,"Damien Pollet (1), St\'ephane Ducasse (1) ((1) RMOD)",A critical analysis of string APIs: The case of Pharo,"Science of Computer Programming, Elsevier, 2017",,10.1016/j.scico.2017.11.005,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most programming languages, besides C, provide a native abstraction for
character strings, but string APIs vary widely in size, expressiveness, and
subjective convenience across languages. In Pharo, while at first glance the
API of the String class seems rich, it often feels cumbersome in practice; to
improve its usability, we faced the challenge of assessing its design. However,
we found hardly any guideline about design forces and how they structure the
design space, and no comprehensive analysis of the expected string operations
and their different variations. In this article, we first analyse the Pharo 4
String library, then contrast it with its Haskell, Java, Python, Ruby, and Rust
counterparts. We harvest criteria to describe a string API, and reflect on
features and design tensions. This analysis should help language designers in
understanding the design space of strings, and will serve as a basis for a
future redesign of the string library in Pharo.
","[{'version': 'v1', 'created': 'Wed, 29 Nov 2017 07:48:12 GMT'}]",2019-04-30,"[['Pollet', 'Damien', '', 'RMOD'], ['Ducasse', 'Stéphane', '', 'RMOD']]","['Strings', 'API', 'Library', 'Design', 'Style']"
7495,2111.06679,Julian Stier,Julian Stier and Michael Granitzer,deepstruct -- linking deep learning and graph theory,,"Software Impacts, 2021",10.1016/j.simpa.2021.100193,,cs.LG cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  deepstruct connects deep learning models and graph theory such that different
graph structures can be imposed on neural networks or graph structures can be
extracted from trained neural network models. For this, deepstruct provides
deep neural network models with different restrictions which can be created
based on an initial graph. Further, tools to extract graph structures from
trained models are available. This step of extracting graphs can be
computationally expensive even for models of just a few dozen thousand
parameters and poses a challenging problem. deepstruct supports research in
pruning, neural architecture search, automated network design and structure
analysis of neural networks.
","[{'version': 'v1', 'created': 'Fri, 12 Nov 2021 11:58:13 GMT'}, {'version': 'v2', 'created': 'Sun, 5 Dec 2021 13:21:49 GMT'}]",2021-12-15,"[['Stier', 'Julian', ''], ['Granitzer', 'Michael', '']]","['deep learning', 'neural architecture search', 'pruning', 'neural structural prior']"
7496,2011.03381,Siamak Layeghy,"Seyedeh Faezeh Hosseini Noorbin, Siamak Layeghy, Brano Kusy, Raja
  Jurdak, Greg Bishop-hurley, Marius Portmann","Deep Learning-based Cattle Activity Classification Using Joint
  Time-frequency Data Representation","22 pages, 17 figures",,10.1016/j.compag.2021.106241,,cs.LG cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated cattle activity classification allows herders to continuously
monitor the health and well-being of livestock, resulting in increased quality
and quantity of beef and dairy products. In this paper, a sequential deep
neural network is used to develop a behavioural model and to classify cattle
behaviour and activities. The key focus of this paper is the exploration of a
joint time-frequency domain representation of the sensor data, which is
provided as the input to the neural network classifier. Our exploration is
based on a real-world data set with over 3 million samples, collected from
sensors with a tri-axial accelerometer, magnetometer and gyroscope, attached to
collar tags of 10 dairy cows and collected over a one month period. The key
results of this paper is that the joint time-frequency data representation,
even when used in conjunction with a relatively basic neural network
classifier, can outperform the best cattle activity classifiers reported in the
literature. With a more systematic exploration of neural network classifier
architectures and hyper-parameters, there is potential for even further
improvements. Finally, we demonstrate that the time-frequency domain data
representation allows us to efficiently trade-off a large reduction of model
size and computational complexity for a very minor reduction in classification
accuracy. This shows the potential for our classification approach to run on
resource-constrained embedded and IoT devices.
","[{'version': 'v1', 'created': 'Fri, 6 Nov 2020 14:24:55 GMT'}]",2021-06-18,"[['Noorbin', 'Seyedeh Faezeh Hosseini', ''], ['Layeghy', 'Siamak', ''], ['Kusy', 'Brano', ''], ['Jurdak', 'Raja', ''], ['Bishop-hurley', 'Greg', ''], ['Portmann', 'Marius', '']]","['Activity classification', 'Behaviour model', 'Deep learning', 'Time-frequencydistribution', 'Inertial Measurement Unit']"
7497,2108.03585,Dominik \.Zurek,"Kamil Faber, Dominik \.Zurek, Marcin Pietro\'n, Kamil Pi\k{e}tak","Ensemble neuroevolution based approach for multivariate time series
  anomaly detection",,,10.3390/e23111466,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Multivariate time series anomaly detection is a very common problem in the
field of failure prevention. Fast prevention means lower repair costs and
losses. The amount of sensors in novel industry systems makes the anomaly
detection process quite difficult for humans. Algorithms which automates the
process of detecting anomalies are crucial in modern failure-prevention
systems. Therefore, many machine and deep learning models have been designed to
address this problem. Mostly, they are autoencoder-based architectures with
some generative adversarial elements. In this work, a framework is shown which
incorporates neuroevolution methods to boost the anomaly-detection scores of
new and already known models. The presented approach adapts evolution
strategies for evolving ensemble model, in which every single model works on a
subgroup of data sensors. The next goal of neuroevolution is to optimise
architecture and hyperparameters like window size, the number of layers, layer
depths, etc. The proposed framework shows that it is possible to boost most of
the anomaly detection deep learning models in a reasonable time and a fully
automated mode. The tests were run on SWAT and WADI datasets. To our knowledge,
this is the first approach in which an ensemble deep learning anomaly detection
model is built in a fully automatic way using a neuroevolution strategy.
","[{'version': 'v1', 'created': 'Sun, 8 Aug 2021 07:55:07 GMT'}]",2021-11-24,"[['Faber', 'Kamil', ''], ['Żurek', 'Dominik', ''], ['Pietroń', 'Marcin', ''], ['Piętak', 'Kamil', '']]","['neuroevolution', 'anomaly detection', 'ensemble model', 'CNN', 'time series', 'deep learning']"
7498,1904.04403,Nikolaj Tatti,Nikolaj Tatti,Discovering Bands from Graphs,,,10.1007/s10618-014-0359-9,,cs.DS cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Discovering the underlying structure of a given graph is one of the
fundamental goals in graph mining. Given a graph, we can often order vertices
in a way that neighboring vertices have a higher probability of being connected
to each other. This implies that the edges form a band around the diagonal in
the adjacency matrix. Such structure may rise for example if the graph was
created over time: each vertex had an active time interval during which the
vertex was connected with other active vertices.
  The goal of this paper is to model this phenomenon. To this end, we formulate
an optimization problem: given a graph and an integer $K$, we want to order
graph vertices and partition the ordered adjacency matrix into $K$ bands such
that bands closer to the diagonal are more dense. We measure the goodness of a
segmentation using the log-likelihood of a log-linear model, a flexible family
of distributions containing many standard distributions. We divide the problem
into two subproblems: finding the order and finding the bands. We show that
discovering bands can be done in polynomial time with isotonic regression, and
we also introduce a heuristic iterative approach. For discovering the order we
use Fiedler order accompanied with a simple combinatorial refinement. We
demonstrate empirically that our heuristic works well in practice.
","[{'version': 'v1', 'created': 'Tue, 9 Apr 2019 00:11:27 GMT'}]",2019-04-10,"[['Tatti', 'Nikolaj', '']]","['monotonic segmentation', 'log-linear models', 'isotonic regression', 'Fiedlerorder', 'bands']"
7499,2007.11446,Nicolas Gillis,"Maryam Abdolali, Nicolas Gillis","Simplex-Structured Matrix Factorization: Sparsity-based Identifiability
  and Provably Correct Algorithms",38 pages,"SIAM J. on Mathematics of Data Science 3 (2), 593-623, 2021",10.1137/20M1354982,,cs.LG eess.IV eess.SP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we provide novel algorithms with identifiability guarantees
for simplex-structured matrix factorization (SSMF), a generalization of
nonnegative matrix factorization. Current state-of-the-art algorithms that
provide identifiability results for SSMF rely on the sufficiently scattered
condition (SSC) which requires the data points to be well spread within the
convex hull of the basis vectors. The conditions under which our proposed
algorithms recover the unique decomposition is in most cases much weaker than
the SSC. We only require to have $d$ points on each facet of the convex hull of
the basis vectors whose dimension is $d-1$. The key idea is based on extracting
facets containing the largest number of points. We illustrate the effectiveness
of our approach on synthetic data sets and hyperspectral images, showing that
it outperforms state-of-the-art SSMF algorithms as it is able to handle higher
noise levels, rank deficient matrices, outliers, and input data that highly
violates the SSC.
","[{'version': 'v1', 'created': 'Wed, 22 Jul 2020 14:01:58 GMT'}]",2021-05-12,"[['Abdolali', 'Maryam', ''], ['Gillis', 'Nicolas', '']]","['simplex-structured matrix factorization', 'nonnegative matrix factorization', 'sparsity', 'identifiability', 'uniqueness', 'minimum volume']"
7500,2009.07637,Zijie Ye,"Zijie Ye, Haozhe Wu, Jia Jia, Yaohua Bu, Wei Chen, Fanbo Meng, Yanfeng
  Wang","ChoreoNet: Towards Music to Dance Synthesis with Choreographic Action
  Unit","10 pages, 5 figures, Accepted by ACM MM 2020",,10.1145/3394171.3414005,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dance and music are two highly correlated artistic forms. Synthesizing dance
motions has attracted much attention recently. Most previous works conduct
music-to-dance synthesis via directly music to human skeleton keypoints
mapping. Meanwhile, human choreographers design dance motions from music in a
two-stage manner: they firstly devise multiple choreographic dance units
(CAUs), each with a series of dance motions, and then arrange the CAU sequence
according to the rhythm, melody and emotion of the music. Inspired by these, we
systematically study such two-stage choreography approach and construct a
dataset to incorporate such choreography knowledge. Based on the constructed
dataset, we design a two-stage music-to-dance synthesis framework ChoreoNet to
imitate human choreography procedure. Our framework firstly devises a CAU
prediction model to learn the mapping relationship between music and CAU
sequences. Afterwards, we devise a spatial-temporal inpainting model to convert
the CAU sequence into continuous dance motions. Experimental results
demonstrate that the proposed ChoreoNet outperforms baseline methods (0.622 in
terms of CAU BLEU score and 1.59 in terms of user study score).
","[{'version': 'v1', 'created': 'Wed, 16 Sep 2020 12:38:19 GMT'}]",2020-09-17,"[['Ye', 'Zijie', ''], ['Wu', 'Haozhe', ''], ['Jia', 'Jia', ''], ['Bu', 'Yaohua', ''], ['Chen', 'Wei', ''], ['Meng', 'Fanbo', ''], ['Wang', 'Yanfeng', '']]","['Dance Synthesis', 'Choreography', 'Motion Synthesis']"
7501,2211.10486,Liangwei Yang,"Liangwei Yang, Shengjie Wang, Yunzhe Tao, Jiankai Sun, Xiaolong Liu,
  Philip S. Yu, Taiqing Wang","DGRec: Graph Neural Network for Recommendation with Diversified
  Embedding Generation","9 pages, WSDM 2023",,10.1145/3539597.3570472,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph Neural Network (GNN) based recommender systems have been attracting
more and more attention in recent years due to their excellent performance in
accuracy. Representing user-item interactions as a bipartite graph, a GNN model
generates user and item representations by aggregating embeddings of their
neighbors. However, such an aggregation procedure often accumulates information
purely based on the graph structure, overlooking the redundancy of the
aggregated neighbors and resulting in poor diversity of the recommended list.
In this paper, we propose diversifying GNN-based recommender systems by
directly improving the embedding generation procedure. Particularly, we utilize
the following three modules: submodular neighbor selection to find a subset of
diverse neighbors to aggregate for each GNN node, layer attention to assign
attention weights for each layer, and loss reweighting to focus on the learning
of items belonging to long-tail categories. Blending the three modules into
GNN, we present DGRec(Diversified GNN-based Recommender System) for diversified
recommendation. Experiments on real-world datasets demonstrate that the
proposed method can achieve the best diversity while keeping the accuracy
comparable to state-of-the-art GNN-based recommender systems.
","[{'version': 'v1', 'created': 'Fri, 18 Nov 2022 19:57:08 GMT'}, {'version': 'v2', 'created': 'Sun, 27 Nov 2022 03:33:25 GMT'}]",2022-11-29,"[['Yang', 'Liangwei', ''], ['Wang', 'Shengjie', ''], ['Tao', 'Yunzhe', ''], ['Sun', 'Jiankai', ''], ['Liu', 'Xiaolong', ''], ['Yu', 'Philip S.', ''], ['Wang', 'Taiqing', '']]","['Graph Neural Network', 'Recommendation System', 'SubmodularFunction']"
7502,1807.09757,Na-Young Ahn,"Na-Young Ahn, Donghoon Lee and Seong-Jun Oh",Vehicle Communication using Secrecy Capacity,"17 Pages, 12 Figures",Future Technologies Conference 2018 (13-14 November 2018),10.1007/978-3-030-02683-7_13,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address secure vehicle communication using secrecy capacity. In
particular, we research the relationship between secrecy capacity and various
types of parameters that determine secrecy capacity in the vehicular wireless
network. For example, we examine the relationship between vehicle speed and
secrecy capacity, the relationship between the response time and secrecy
capacity of an autonomous vehicle, and the relationship between transmission
power and secrecy capacity. In particular, the autonomous vehicle has set the
system modeling on the assumption that the speed of the vehicle is related to
the safety distance. We propose new vehicle communication to maintain a certain
level of secrecy capacity according to various parameters. As a result, we can
expect safer communication security of autonomous vehicles in 5G
communications.
","[{'version': 'v1', 'created': 'Tue, 24 Jul 2018 04:40:05 GMT'}]",2020-11-20,"[['Ahn', 'Na-Young', ''], ['Lee', 'Donghoon', ''], ['Oh', 'Seong-Jun', '']]","['V2V communication', 'Physical Layer Security', 'Secrecy Capacity', 'Compressive Sensing Encryption', 'Security Distance', 'ITS', 'Vehicular Network']"
7503,2010.00730,Muhammad Marwan Muhammad Fuad,Muhammad Marwan Muhammad Fuad,"Modifying the Symbolic Aggregate Approximation Method to Capture Segment
  Trend Information","International Conference on Modeling Decisions for Artificial
  Intelligence - MDAI 2020: Modeling Decisions for Artificial Intelligence pp
  230-239","Lecture Notes in Computer Science 12256, Springer 2020",10.1007/978-3-030-57524-3_19,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Symbolic Aggregate approXimation (SAX) is a very popular symbolic
dimensionality reduction technique of time series data, as it has several
advantages over other dimensionality reduction techniques. One of its major
advantages is its efficiency, as it uses precomputed distances. The other main
advantage is that in SAX the distance measure defined on the reduced space
lower bounds the distance measure defined on the original space. This enables
SAX to return exact results in query-by-content tasks. Yet SAX has an inherent
drawback, which is its inability to capture segment trend information. Several
researchers have attempted to enhance SAX by proposing modifications to include
trend information. However, this comes at the expense of giving up on one or
more of the advantages of SAX. In this paper we investigate three modifications
of SAX to add trend capturing ability to it. These modifications retain the
same features of SAX in terms of simplicity, efficiency, as well as the exact
results it returns. They are simple procedures based on a different
segmentation of the time series than that used in classic-SAX. We test the
performance of these three modifications on 45 time series datasets of
different sizes, dimensions, and nature, on a classification task and we
compare it to that of classic-SAX. The results we obtained show that one of
these modifications manages to outperform classic-SAX and that another one
slightly gives better results than classic-SAX.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2020 00:05:39 GMT'}]",2020-10-05,"[['Fuad', 'Muhammad Marwan Muhammad', '']]","['Classification', 'SAX', 'Time series mining']"
7504,1910.03075,Rahul Bera,"Rahul Bera, Anant V. Nori, Onur Mutlu, Sreenivas Subramoney",DSPatch: Dual Spatial Pattern Prefetcher,This work is to appear in MICRO 2019,,10.1145/3352460.3358325,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  High main memory latency continues to limit performance of modern
high-performance out-of-order cores. While DRAM latency has remained nearly the
same over many generations, DRAM bandwidth has grown significantly due to
higher frequencies, newer architectures (DDR4, LPDDR4, GDDR5) and 3D-stacked
memory packaging (HBM). Current state-of-the-art prefetchers do not do well in
extracting higher performance when higher DRAM bandwidth is available.
Prefetchers need the ability to dynamically adapt to available bandwidth,
boosting prefetch count and prefetch coverage when headroom exists and
throttling down to achieve high accuracy when the bandwidth utilization is
close to peak. To this end, we present the Dual Spatial Pattern Prefetcher
(DSPatch) that can be used as a standalone prefetcher or as a lightweight
adjunct spatial prefetcher to the state-of-the-art delta-based Signature
Pattern Prefetcher (SPP). DSPatch builds on a novel and intuitive use of
modulated spatial bit-patterns. The key idea is to: (1) represent program
accesses on a physical page as a bit-pattern anchored to the first ""trigger""
access, (2) learn two spatial access bit-patterns: one biased towards coverage
and another biased towards accuracy, and (3) select one bit-pattern at run-time
based on the DRAM bandwidth utilization to generate prefetches. Across a
diverse set of workloads, using only 3.6KB of storage, DSPatch improves
performance over an aggressive baseline with a PC-based stride prefetcher at
the L1 cache and the SPP prefetcher at the L2 cache by 6% (9% in
memory-intensive workloads and up to 26%). Moreover, the performance of
DSPatch+SPP scales with increasing DRAM bandwidth, growing from 6% over SPP to
10% when DRAM bandwidth is doubled.
","[{'version': 'v1', 'created': 'Mon, 7 Oct 2019 20:44:32 GMT'}]",2019-10-09,"[['Bera', 'Rahul', ''], ['Nori', 'Anant V.', ''], ['Mutlu', 'Onur', ''], ['Subramoney', 'Sreenivas', '']]","['Data prefetching', 'microarchitecture', 'memory latency']"
7505,2208.01634,Kunal Abhishek,Kunal Abhishek and E. George Dharma Prakash Raj,"Evaluation of Computational Approaches of Short Weierstrass Elliptic
  Curves for Cryptography","CYBERNETICS AND INFORMATION TECHNOLOGIES, 2021, Volume 21, No 4","CYBERNETICS AND INFORMATION TECHNOLOGIES, 2021, Volume 21, No 4",10.2478/cait-2021-0045,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  The survey presents the evolution of Short Weierstrass elliptic curves after
their introduction in cryptography. Subsequently, this evolution resulted in
the establishment of present elliptic curve computational standards. We discuss
the chronology of attacks on Elliptic Curve Discrete Logarithm Problem and
investigate their countermeasures to highlight the evolved selection criteria
of cryptographically safe elliptic curves. Further, two popular deterministic
and random approaches for selection of Short Weierstrass elliptic curve for
cryptography are evaluated from computational, security and trust perspectives
and a trend in existent computational standards is demonstrated. Finally,
standard and non-standard elliptic curves are analysed to add a new insight
into their usability. There is no such survey conducted in past to the best of
our knowledge.
","[{'version': 'v1', 'created': 'Fri, 15 Apr 2022 08:36:12 GMT'}]",2022-08-04,"[['Abhishek', 'Kunal', ''], ['Raj', 'E. George Dharma Prakash', '']]","['Computational approaches', 'evaluation', 'cryptography', 'elliptic curve', 'ECDLP', 'security']"
7506,2203.05691,Bassel Al Homssi,"Bisma Manzoor, Akram Al-Hourani, Bassel Al Homssi","Improving IoT-over-Satellite Connectivity using Frame Repetition
  Technique",,,10.1109/LWC.2022.3141831,,cs.IT math.IT,http://creativecommons.org/licenses/by/4.0/,"  Through Non-Terrestrial Networks (NTN), a global coverage connecting areas
with minimal or no terrestrial services is envisaged using satellite and
air-borne platforms. However, one of the challenges to delivering NTN
communications is the increased levels of path-loss, relative to typical
terrestrial scenarios, due to the vast communication distance towards satellite
platforms. Typically, cellular IoT technologies adopt frame repetitions where
many redundant data transmissions are included to enhance its success rate.
This can be also extended to satellite links to counter the effect of long
distance communications on the link budget. In this paper, we put forth an
analytic framework that captures the repetition behavior based on the
probability of line-of-sight (LoS), as it heavily influences the propagation
conditions. We analyze the coverage performance in terms of the frame success
rate, which allows us to tune the repetitions behavior to suit a given
satellite admittance region. Furthermore, we obtain an optimal global average
success rate by considering the availability of satellites. The presented
framework can facilitate coverage enhancements for IoT-over-Satellite networks.
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2022 00:52:18 GMT'}]",2022-04-20,"[['Manzoor', 'Bisma', ''], ['Al-Hourani', 'Akram', ''], ['Homssi', 'Bassel Al', '']]","['IoT-over-satellite', 'frame repetitions', 'Non TerrestrialNetworks', 'stochastic geometry', 'satellite networks']"
7507,2108.03369,Angelos Charalambidis,"Angelos Charalambidis, Panos Rondogiannis, Antonis Troumpoukis","A Logical Characterization of the Preferred Models of Logic Programs
  with Ordered Disjunction","Paper presented at the 37th International Conference on Logic
  Programming (ICLP 2021), 16 pages + 13 pages appendix",,10.1017/S1471068421000235,,cs.AI cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Logic Programs with Ordered Disjunction (LPODs) extend classical logic
programs with the capability of expressing alternatives with decreasing degrees
of preference in the heads of program rules. Despite the fact that the
operational meaning of ordered disjunction is clear, there exists an important
open issue regarding its semantics. In particular, there does not exist a
purely model-theoretic approach for determining the most preferred models of an
LPOD. At present, the selection of the most preferred models is performed using
a technique that is not based exclusively on the models of the program and in
certain cases produces counterintuitive results. We provide a novel,
model-theoretic semantics for LPODs, which uses an additional truth value in
order to identify the most preferred models of a program. We demonstrate that
the proposed approach overcomes the shortcomings of the traditional semantics
of LPODs. Moreover, the new approach can be used to define the semantics of a
natural class of logic programs that can have both ordered and classical
disjunctions in the heads of clauses. This allows programs that can express not
only strict levels of preferences but also alternatives that are equally
preferred. This work is under consideration for acceptance in TPLP.
","[{'version': 'v1', 'created': 'Sat, 7 Aug 2021 05:36:12 GMT'}]",2022-05-09,"[['Charalambidis', 'Angelos', ''], ['Rondogiannis', 'Panos', ''], ['Troumpoukis', 'Antonis', '']]","['Ordered Disjunction', 'Answer Sets', 'Logic of Here-and-There', 'Preferences']"
7508,2008.00299,Mohammed Bany Muhammad,"Mohammed Bany Muhammad, Mohammed Yeasin",Eigen-CAM: Class Activation Map using Principal Components,"7 pages, 4 figures",,10.1109/IJCNN48605.2020.9206626,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks are ubiquitous due to the ease of developing models and
their influence on other domains. At the heart of this progress is
convolutional neural networks (CNNs) that are capable of learning
representations or features given a set of data. Making sense of such complex
models (i.e., millions of parameters and hundreds of layers) remains
challenging for developers as well as the end-users. This is partially due to
the lack of tools or interfaces capable of providing interpretability and
transparency. A growing body of literature, for example, class activation map
(CAM), focuses on making sense of what a model learns from the data or why it
behaves poorly in a given task. This paper builds on previous ideas to cope
with the increasing demand for interpretable, robust, and transparent models.
Our approach provides a simpler and intuitive (or familiar) way of generating
CAM. The proposed Eigen-CAM computes and visualizes the principle components of
the learned features/representations from the convolutional layers. Empirical
studies were performed to compare the Eigen-CAM with the state-of-the-art
methods (such as Grad-CAM, Grad-CAM++, CNN-fixations) by evaluating on
benchmark datasets such as weakly-supervised localization and localizing
objects in the presence of adversarial noise. Eigen-CAM was found to be robust
against classification errors made by fully connected layers in CNNs, does not
rely on the backpropagation of gradients, class relevance score, maximum
activation locations, or any other form of weighting features. In addition, it
works with all CNN models without the need to modify layers or retrain models.
Empirical results show up to 12% improvement over the best method among the
methods compared on weakly supervised object localization.
","[{'version': 'v1', 'created': 'Sat, 1 Aug 2020 17:14:13 GMT'}]",2020-10-26,"[['Muhammad', 'Mohammed Bany', ''], ['Yeasin', 'Mohammed', '']]","['Weakly supervised localization', 'Visual explanation of CNN', 'Explainable AI', 'Class activation maps', 'Salient features']"
7509,1702.07390,Rahmtin Rotabi,"Rahmtin Rotabi, Krishna Kamath, Jon Kleinberg and Aneesh Sharma",Detecting Strong Ties Using Network Motifs,To appear in Proceedings of WWW 2017 (Web-science track),,10.1145/3041021.3055139,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detecting strong ties among users in social and information networks is a
fundamental operation that can improve performance on a multitude of
personalization and ranking tasks. Strong-tie edges are often readily obtained
from the social network as users often participate in multiple overlapping
networks via features such as following and messaging. These networks may vary
greatly in size, density and the information they carry. This setting leads to
a natural strong tie detection task: given a small set of labeled strong tie
edges, how well can one detect unlabeled strong ties in the remainder of the
network?
  This task becomes particularly daunting for the Twitter network due to scant
availability of pairwise relationship attribute data, and sparsity of strong
tie networks such as phone contacts. Given these challenges, a natural approach
is to instead use structural network features for the task, produced by {\em
combining} the strong and ""weak"" edges. In this work, we demonstrate via
experiments on Twitter data that using only such structural network features is
sufficient for detecting strong ties with high precision. These structural
network features are obtained from the presence and frequency of small network
motifs on combined strong and weak ties. We observe that using motifs larger
than triads alleviate sparsity problems that arise for smaller motifs, both due
to increased combinatorial possibilities as well as benefiting strongly from
searching beyond the ego network. Empirically, we observe that not all motifs
are equally useful, and need to be carefully constructed from the combined
edges in order to be effective for strong tie detection. Finally, we reinforce
our experimental findings with providing theoretical justification that
suggests why incorporating these larger sized motifs as features could lead to
increased performance in planted graph models.
","[{'version': 'v1', 'created': 'Thu, 23 Feb 2017 20:57:13 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Mar 2017 00:12:07 GMT'}]",2017-03-28,"[['Rotabi', 'Rahmtin', ''], ['Kamath', 'Krishna', ''], ['Kleinberg', 'Jon', ''], ['Sharma', 'Aneesh', '']]","['strong-tie detection', 'graph information transfer', 'network motifs']"
7510,1806.07833,Khan Rahman,Khan Mashiur Rahman,A Narrative Literature Review and E-Commerce Website Research,"11 pages, 1 figure","Rahman, K. M. (2018), A Narrative Literature review and E-Commerce
  Website Research, EAI Endorsed Transactions on Scalable Information Systems,
  18 (17):e1, Volume 5, ISSN 2032-9407, 29 May 2018",10.4108/eai.29-5-2018.154806,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, a narrative literature review regarding culture and e-commerce
website design has been introduced. Cultural aspect and e-commerce website
design will play a significant role for successful global e-commerce sites in
the future. Future success of businesses will rely on e-commerce. To compete in
the global e-commerce marketplace, local businesses need to focus on designing
culturally friendly e-commerce websites. To the best of my knowledge, there has
been insignificant research conducted on correlations between culture and
e-commerce website design. The research shows that there are correlations
between e-commerce, culture, and website design. The result of the study
indicates that cultural aspects influence e-commerce website design. This study
aims to deliver a reference source for information systems and information
technology researchers interested in culture and e-commerce website design, and
will show lessfocused research areas in addition to future directions.
","[{'version': 'v1', 'created': 'Wed, 30 May 2018 12:03:05 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Oct 2018 23:06:39 GMT'}]",2018-10-19,"[['Rahman', 'Khan Mashiur', '']]","['information systems', 'distributed systems', 'culture', 'e-commerce', 'website design', 'narrative literature review', 'information security', 'scalability']"
7511,2002.02068,Shota Yasui,"Shota Yasui, Gota Morishita, Komei Fujita, Masashi Shibata","A Feedback Shift Correction in Predicting Conversion Rates under Delayed
  Feedback",The Web Conference 2020 (WWW '20),,10.1145/3366423.3380032,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  In display advertising, predicting the conversion rate, that is, the
probability that a user takes a predefined action on an advertiser's website,
such as purchasing goods is fundamental in estimating the value of displaying
the advertisement. However, there is a relatively long time delay between a
click and its resultant conversion. Because of the delayed feedback, some
positive instances at the training period are labeled as negative because some
conversions have not yet occurred when training data are gathered. As a result,
the conditional label distributions differ between the training data and the
production environment. This situation is referred to as a feedback shift. We
address this problem by using an importance weight approach typically used for
covariate shift correction. We prove its consistency for the feedback shift.
Results in both offline and online experiments show that our proposed method
outperforms the existing method.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2020 02:05:07 GMT'}]",2020-02-07,"[['Yasui', 'Shota', ''], ['Morishita', 'Gota', ''], ['Fujita', 'Komei', ''], ['Shibata', 'Masashi', '']]","['Delayed Feedback', 'Conversion Prediction', 'Importance Weight']"
7512,2109.10715,ChengZhang Dong,"Chengzhang Dong and Chenyang Huang and Osmar Za\""iane and Lili Mou",Simulated Annealing for Emotional Dialogue Systems,,,10.1145/3459637.3482182,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Explicitly modeling emotions in dialogue generation has important
applications, such as building empathetic personal companions. In this study,
we consider the task of expressing a specific emotion for dialogue generation.
Previous approaches take the emotion as an input signal, which may be ignored
during inference. We instead propose a search-based emotional dialogue system
by simulated annealing (SA). Specifically, we first define a scoring function
that combines contextual coherence and emotional correctness. Then, SA
iteratively edits a general response and searches for a sentence with a higher
score, enforcing the presence of the desired emotion. We evaluate our system on
the NLPCC2017 dataset. Our proposed method shows 12% improvements in emotion
accuracy compared with the previous state-of-the-art method, without hurting
the generation quality (measured by BLEU).
","[{'version': 'v1', 'created': 'Wed, 22 Sep 2021 13:17:17 GMT'}]",2021-09-23,"[['Dong', 'Chengzhang', ''], ['Huang', 'Chenyang', ''], ['Zaïane', 'Osmar', ''], ['Mou', 'Lili', '']]","['Dialogue generation', 'Simulated annealing', 'Emotion analysis']"
7513,2202.00514,Stephany Rajeh,Stephany Rajeh and Ali Yassin and Ali Jaber and Hocine Cherifi,"Analyzing Community-aware Centrality Measures Using The Linear Threshold
  Model","Accepted in International Conference on Complex Networks and Their
  Applications 2022",,10.1007/978-3-030-93409-5_29,,cs.SI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Targeting influential nodes in complex networks allows fastening or hindering
rumors, epidemics, and electric blackouts. Since communities are prevalent in
real-world networks, community-aware centrality measures exploit this
information to target influential nodes. Researches show that they compare
favorably with classical measures that are agnostic about the community
structure. Although the diffusion process is of prime importance, previous
studies consider mainly the famous Susceptible-Infected-Recovered (SIR)
epidemic propagation model. This work investigates the consistency of previous
analyses using the popular Linear Threshold (LT) propagation model, which
characterizes many spreading processes in our real life. We perform a
comparative analysis of seven influential community-aware centrality measures
on thirteen real-world networks. Overall, results show that Community-based
Mediator, Comm Centrality, and Modularity Vitality outperform the other
measures. Moreover, Community-based Mediator is more effective on a tight
budget (i.e., a small fraction of initially activated nodes), while Comm
Centrality and Modularity Vitality perform better with a medium to a high
fraction of initially activated nodes.
","[{'version': 'v1', 'created': 'Sun, 30 Jan 2022 21:56:07 GMT'}]",2022-02-02,"[['Rajeh', 'Stephany', ''], ['Yassin', 'Ali', ''], ['Jaber', 'Ali', ''], ['Cherifi', 'Hocine', '']]","['Centrality', 'Community Structure', 'Influential Nodes', 'Diffusion Model', 'Linear Threshold Model']"
7514,2210.02978,Tristan Miller,"Tristan Miller, Camille Paloque-Berg\`es, Avery Dame-Griff","Remembering Netizens: An interview with Ronda Hauben, co-author of
  Netizens: On the history and impact of Usenet and the Internet (1997)","24 pages, 0 figures",,10.1080/24701475.2022.2123120,,cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Netizens, Michael and Ronda Hauben's foundational treatise on Usenet and the
Internet, was first published in print 25 years ago. In this piece, we trace
the history and impact of the book and of Usenet itself, contextualising them
within the contemporary and modern-day scholarship on virtual communities,
online culture, and Internet history. We discuss the Net as a tool of
empowerment, and touch on the social, technical, and economic issues related to
the maintenance of shared network infrastructures and to the preservation and
commodification of Usenet archives. Our interview with Ronda Hauben offers a
retrospective look at the development of online communities, their impact, and
how they are studied. She recounts her own introduction to the online world, as
well as the impetus and writing process for Netizens. She presents Michael
Hauben's conception of ""netizens"" as contributory citizens of the Net (rather
than mere users of it) and the ""electronic commons"" they built up, and argues
that this collaborative and collectivist model has been overwhelmed and
endangered by the privatisation and commercialisation of the Internet and its
communities.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2022 15:07:18 GMT'}]",2022-10-07,"[['Miller', 'Tristan', ''], ['Paloque-Bergès', 'Camille', ''], ['Dame-Griff', 'Avery', '']]","['Ronda Hauben', 'Netizens', 'Usenet', 'online communities', 'Michael Hauben', 'Internet history']"
7515,1907.02506,Jun Zhao,"Binbin Huang, Zhongjin Lia, Peng Tang, Shangguang Wang, Jun Zhao,
  Haiyang Hua, Wanqing Lia, Victor Chang","Security modeling and efficient computation offloading for service
  workflow in mobile edge computing","published in journal ""Future Generation Computer Systems"":
  https://doi.org/10.1016/j.future.2019.03.011",,10.1016/j.future.2019.03.011,,cs.DC cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is a big challenge for resource-limited mobile devices (MDs) to execute
various complex and energy-consumed mobile applications. Fortunately, as a
novel computing paradigm, edge computing (MEC) can provide abundant computing
resources to execute all or parts of the tasks of MDs and thereby can greatly
reduce the energy of MD and improve the QoS of applications. However,
offloading workflow tasks to the MEC servers are liable to external security
threats (e.g., snooping, alteration). In this paper, we propose a security and
energy efficient computation offloading (SEECO) strategy for service workflows
in MEC environment, the goal of which is to optimize the energy consumption
under the risk probability and deadline constraints. First, we build a security
overhead model to measure the execution time of security services. Then, we
formulate the computation offloading problem by incorporating the security,
energy consumption and execution time of workflow application. Finally, based
on the genetic algorithm (GA), the corresponding coding strategies of SEECO are
devised by considering tasks execution order and location and security services
selection. Extensive experiments with the variety of workflow parameters
demonstrate that SEECO strategy can achieve the security and energy efficiency
for the mobile applications.
","[{'version': 'v1', 'created': 'Thu, 4 Jul 2019 17:40:30 GMT'}]",2019-07-05,"[['Huang', 'Binbin', ''], ['Lia', 'Zhongjin', ''], ['Tang', 'Peng', ''], ['Wang', 'Shangguang', ''], ['Zhao', 'Jun', ''], ['Hua', 'Haiyang', ''], ['Lia', 'Wanqing', ''], ['Chang', 'Victor', '']]","['mobile edge computing', 'workflow scheduling', 'security modeling', 'energy efficient', 'genetic']"
7516,2107.14569,Stefanos Koffas,"Stefanos Koffas, Jing Xu, Mauro Conti, Stjepan Picek",Can You Hear It? Backdoor Attacks via Ultrasonic Triggers,,,10.1145/3522783.3529523,,cs.CR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  This work explores backdoor attacks for automatic speech recognition systems
where we inject inaudible triggers. By doing so, we make the backdoor attack
challenging to detect for legitimate users, and thus, potentially more
dangerous. We conduct experiments on two versions of a speech dataset and three
neural networks and explore the performance of our attack concerning the
duration, position, and type of the trigger. Our results indicate that less
than 1% of poisoned data is sufficient to deploy a backdoor attack and reach a
100% attack success rate. We observed that short, non-continuous triggers
result in highly successful attacks. However, since our trigger is inaudible,
it can be as long as possible without raising any suspicions making the attack
more effective. Finally, we conducted our attack in actual hardware and saw
that an adversary could manipulate inference in an Android application by
playing the inaudible trigger over the air.
","[{'version': 'v1', 'created': 'Fri, 30 Jul 2021 12:08:16 GMT'}, {'version': 'v2', 'created': 'Sat, 23 Oct 2021 14:56:56 GMT'}, {'version': 'v3', 'created': 'Sun, 6 Mar 2022 15:54:28 GMT'}]",2022-11-08,"[['Koffas', 'Stefanos', ''], ['Xu', 'Jing', ''], ['Conti', 'Mauro', ''], ['Picek', 'Stjepan', '']]","['Backdoor Attacks', 'Inaudible Trigger', 'Neural Networks']"
7517,1809.04041,Marco Tulio Valente,"Jailton Coelho, Marco Tulio Valente, Luciana L. Silva, Emad Shihab",Identifying Unmaintained Projects in GitHub,"Accepted at 12th International Symposium on Empirical Software
  Engineering and Measurement (ESEM), 10 pages, 2018",,10.1145/3239235.3240501,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Open source software has an increasing importance in modern
software development. However, there is also a growing concern on the
sustainability of such projects, which are usually managed by a small number of
developers, frequently working as volunteers. Aims: In this paper, we propose
an approach to identify GitHub projects that are not actively maintained. Our
goal is to alert users about the risks of using these projects and possibly
motivate other developers to assume the maintenance of the projects. Method: We
train machine learning models to identify unmaintained or sparsely maintained
projects, based on a set of features about project activity (commits, forks,
issues, etc). We empirically validate the model with the best performance with
the principal developers of 129 GitHub projects. Results: The proposed machine
learning approach has a precision of 80%, based on the feedback of real open
source developers; and a recall of 96%. We also show that our approach can be
used to assess the risks of projects becoming unmaintained. Conclusions: The
model proposed in this paper can be used by open source users and developers to
identify GitHub projects that are not actively maintained anymore.
","[{'version': 'v1', 'created': 'Tue, 11 Sep 2018 17:15:56 GMT'}]",2019-01-31,"[['Coelho', 'Jailton', ''], ['Valente', 'Marco Tulio', ''], ['Silva', 'Luciana L.', ''], ['Shihab', 'Emad', '']]","['Unmaintained Projects', 'Open Source Software', 'GitHub']"
7518,2103.03417,Ken Burke,"Osman Aka, Ken Burke, Alex B\""auerle, Christina Greer, Margaret
  Mitchell",Measuring Model Biases in the Absence of Ground Truth,,,10.1145/3461702.3462557,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The measurement of bias in machine learning often focuses on model
performance across identity subgroups (such as man and woman) with respect to
groundtruth labels. However, these methods do not directly measure the
associations that a model may have learned, for example between labels and
identity subgroups. Further, measuring a model's bias requires a fully
annotated evaluation dataset which may not be easily available in practice. We
present an elegant mathematical solution that tackles both issues
simultaneously, using image classification as a working example. By treating a
classification model's predictions for a given image as a set of labels
analogous to a bag of words, we rank the biases that a model has learned with
respect to different identity labels. We use (man, woman) as a concrete example
of an identity label set (although this set need not be binary), and present
rankings for the labels that are most biased towards one identity or the other.
We demonstrate how the statistical properties of different association metrics
can lead to different rankings of the most ""gender biased"" labels, and conclude
that normalized pointwise mutual information (nPMI) is most useful in practice.
Finally, we announce an open-sourced nPMI visualization tool using TensorBoard.
","[{'version': 'v1', 'created': 'Fri, 5 Mar 2021 01:23:22 GMT'}, {'version': 'v2', 'created': 'Tue, 11 May 2021 15:55:18 GMT'}, {'version': 'v3', 'created': 'Sun, 6 Jun 2021 17:09:58 GMT'}]",2021-06-08,"[['Aka', 'Osman', ''], ['Burke', 'Ken', ''], ['Bäuerle', 'Alex', ''], ['Greer', 'Christina', ''], ['Mitchell', 'Margaret', '']]","['datasets', 'image tagging', 'fairness', 'bias', 'stereotypes', 'informationextraction', 'model analysis']"
7519,2203.13083,"Petter \""Ogren","Petter \""Ogren and Christopher I. Sprague",Behavior Trees in Robot Control Systems,,"Annual Review of Control, Robotics, and Autonomous Systems Vol. 5,
  2022",10.1146/annurev-control-042920-095314,,cs.RO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we will give a control theoretic perspective on the research
area of behavior trees in robotics. The key idea underlying behavior trees is
to make use of modularity, hierarchies and feedback, in order to handle the
complexity of a versatile robot control system. Modularity is a well-known tool
to handle software complexity by enabling development, debugging and extension
of separate modules without having detailed knowledge of the entire system. A
hierarchy of such modules is natural, since robot tasks can often be decomposed
into a hierarchy of sub-tasks. Finally, feedback control is a fundamental tool
for handling uncertainties and disturbances in any low level control system,
but in order to enable feedback control on the higher level, where one module
decides what submodule to execute, information regarding progress and
applicability of each submodule needs to be shared in the module interfaces. We
will describe how these three concepts come to use in theoretical analysis,
practical design, as well as extensions and combinations with other ideas from
control theory and robotics.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2022 14:16:15 GMT'}]",2022-03-25,"[['Ögren', 'Petter', ''], ['Sprague', 'Christopher I.', '']]","['behavior trees', 'modularity', 'hierarchical modularity', 'transparency', 'robustness', 'autonomous system', 'feedback', 'task switching']"
7520,2209.14021,Lukas Steiner,"Lukas Steiner, Chirag Sudarshan, Matthias Jung, Dominik Stoffel,
  Norbert Wehn",A Framework for Formal Verification of DRAM Controllers,ACM/IEEE International Symposium on Memory Systems (MEMSYS 2022),,10.1145/3565053.3565059,,cs.FL cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The large number of recent JEDEC DRAM standard releases and their increasing
feature set makes it difficult for designers to rapidly upgrade the memory
controller IPs to each new standard. Especially the hardware verification is
challenging due to the higher protocol complexity of standards like DDR5,
LPDDR5 or HBM3 in comparison with their predecessors. With traditional
simulation-based verification it is laborious to guarantee the coverage of all
possible states, especially for control flow rich memory controllers. This has
a direct impact on the time-to-market. A promising alternative is formal
verification because it allows to ensure protocol compliance based on
mathematical proofs. However, with regard to memory controllers no
fully-automated verification process has been presented in the state-of-the-art
yet, which means there is still a potential risk of human error. In this paper
we present a framework that automatically generates SystemVerilog Assertions
for a DRAM protocol. In addition, we show how the framework can be used
efficiently for different tasks of memory controller development.
","[{'version': 'v1', 'created': 'Wed, 28 Sep 2022 12:00:00 GMT'}]",2022-10-03,"[['Steiner', 'Lukas', ''], ['Sudarshan', 'Chirag', ''], ['Jung', 'Matthias', ''], ['Stoffel', 'Dominik', ''], ['Wehn', 'Norbert', '']]","['Formal Verification', 'Property Checking', 'Petri Net', 'DRAM', 'MemoryController']"
7521,1708.02380,Venkatesh-Prasad Ranganath,"Joydeep Mitra, Venkatesh-Prasad Ranganath",Ghera: A Repository of Android App Vulnerability Benchmarks,10 pages. Accepted at PROMISE'17,,10.1145/3127005.3127010,,cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security of mobile apps affects the security of their users. This has fueled
the development of techniques to automatically detect vulnerabilities in mobile
apps and help developers secure their apps; specifically, in the context of
Android platform due to openness and ubiquitousness of the platform. Despite a
slew of research efforts in this space, there is no comprehensive repository of
up-to-date and lean benchmarks that contain most of the known Android app
vulnerabilities and, consequently, can be used to rigorously evaluate both
existing and new vulnerability detection techniques and help developers learn
about Android app vulnerabilities. In this paper, we describe Ghera, an open
source repository of benchmarks that capture 25 known vulnerabilities in
Android apps (as pairs of exploited/benign and exploiting/malicious apps). We
also present desirable characteristics of vulnerability benchmarks and
repositories that we uncovered while creating Ghera.
","[{'version': 'v1', 'created': 'Tue, 8 Aug 2017 06:29:02 GMT'}]",2017-11-09,"[['Mitra', 'Joydeep', ''], ['Ranganath', 'Venkatesh-Prasad', '']]","['Security', 'Collection', 'Benchmarking', 'Mobile', 'Applications']"
7522,1905.01216,Kathrin Hanauer,"Kathrin Hanauer, Monika Henzinger, and Christian Schulz","Fully Dynamic Single-Source Reachability in Practice: An Experimental
  Study",,"Proceedings of the Symposium on Algorithm Engineering and
  Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020, pages
  106-119, 2020",10.1137/1.9781611976007.9,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a directed graph and a source vertex, the fully dynamic single-source
reachability problem is to maintain the set of vertices that are reachable from
the given vertex, subject to edge deletions and insertions. It is one of the
most fundamental problems on graphs and appears directly or indirectly in many
and varied applications. While there has been theoretical work on this problem,
showing both linear conditional lower bounds for the fully dynamic problem and
insertions-only and deletions-only upper bounds beating these conditional lower
bounds, there has been no experimental study that compares the performance of
fully dynamic reachability algorithms in practice. Previous experimental
studies in this area concentrated only on the more general all-pairs
reachability or transitive closure problem and did not use real-world dynamic
graphs.
  In this paper, we bridge this gap by empirically studying an extensive set of
algorithms for the single-source reachability problem in the fully dynamic
setting. In particular, we design several fully dynamic variants of well-known
approaches to obtain and maintain reachability information with respect to a
distinguished source. Moreover, we extend the existing insertions-only or
deletions-only upper bounds into fully dynamic algorithms. Even though the
worst-case time per operation of all the fully dynamic algorithms we evaluate
is at least linear in the number of edges in the graph (as is to be expected
given the conditional lower bounds) we show in our extensive experimental
evaluation that their performance differs greatly, both on generated as well as
on real-world instances.
","[{'version': 'v1', 'created': 'Fri, 3 May 2019 15:12:00 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Aug 2019 10:14:44 GMT'}, {'version': 'v3', 'created': 'Mon, 3 Feb 2020 15:45:19 GMT'}]",2020-02-04,"[['Hanauer', 'Kathrin', ''], ['Henzinger', 'Monika', ''], ['Schulz', 'Christian', '']]","['Dynamic Graph Algorithms', 'Reachability', 'Algorithm Engineering']"
7523,2008.00928,Piyush Yadav,"Piyush Yadav, Dipto Sarkar, Dhaval Salwala, Edward Curry","Traffic Prediction Framework for OpenStreetMap using Deep Learning based
  Complex Event Processing and Open Traffic Cameras","16 pages, 9 Figures, 3 Tables, Paper accepted in GIScience 2020 (now
  postponed to 2021)",,10.4230/LIPIcs.GIScience.2021.I.17,,cs.CV cs.AI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Displaying near-real-time traffic information is a useful feature of digital
navigation maps. However, most commercial providers rely on
privacy-compromising measures such as deriving location information from
cellphones to estimate traffic. The lack of an open-source traffic estimation
method using open data platforms is a bottleneck for building sophisticated
navigation services on top of OpenStreetMap (OSM). We propose a deep
learning-based Complex Event Processing (CEP) method that relies on publicly
available video camera streams for traffic estimation. The proposed framework
performs near-real-time object detection and objects property extraction across
camera clusters in parallel to derive multiple measures related to traffic with
the results visualized on OpenStreetMap. The estimation of object properties
(e.g. vehicle speed, count, direction) provides multidimensional data that can
be leveraged to create metrics and visualization for congestion beyond commonly
used density-based measures. Our approach couples both flow and count measures
during interpolation by considering each vehicle as a sample point and their
speed as weight. We demonstrate multidimensional traffic metrics (e.g. flow
rate, congestion estimation) over OSM by processing 22 traffic cameras from
London streets. The system achieves a near-real-time performance of 1.42
seconds median latency and an average F-score of 0.80.
","[{'version': 'v1', 'created': 'Sun, 12 Jul 2020 17:10:43 GMT'}]",2021-01-07,"[['Yadav', 'Piyush', ''], ['Sarkar', 'Dipto', ''], ['Salwala', 'Dhaval', ''], ['Curry', 'Edward', '']]","['Traffic Estimation', 'OpenStreetMap', 'Complex Event Processing', 'TrafficCameras', 'Video Processing', 'Deep Learning']"
7524,2012.14097,Ali Raza Shahid,"Ali Raza Shahid, Sheheryar Khan, Hong Yan","Human Expression Recognition using Facial Shape Based Fourier
  Descriptors Fusion",,"Proceedings Volume 11433, Twelfth International Conference on
  Machine Vision (ICMV 2019); 114330P (2020)",10.1117/12.2557450,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Dynamic facial expression recognition has many useful applications in social
networks, multimedia content analysis, security systems and others. This
challenging process must be done under recurrent problems of image illumination
and low resolution which changes at partial occlusions. This paper aims to
produce a new facial expression recognition method based on the changes in the
facial muscles. The geometric features are used to specify the facial regions
i.e., mouth, eyes, and nose. The generic Fourier shape descriptor in
conjunction with elliptic Fourier shape descriptor is used as an attribute to
represent different emotions under frequency spectrum features. Afterwards a
multi-class support vector machine is applied for classification of seven human
expression. The statistical analysis showed our approach obtained overall
competent recognition using 5-fold cross validation with high accuracy on
well-known facial expression dataset.
","[{'version': 'v1', 'created': 'Mon, 28 Dec 2020 05:01:44 GMT'}]",2020-12-29,"[['Shahid', 'Ali Raza', ''], ['Khan', 'Sheheryar', ''], ['Yan', 'Hong', '']]","['Facial expression recognition', 'elliptic Fourier shape descriptor', 'generic Fourier shape descriptor']"
7525,1910.01565,Bhaskar DasGupta,Tanima Chatterjee and Bhaskar DasGupta,"On partisan bias in redistricting: computational complexity meets the
  science of gerrymandering","Disclaimer: The authors were not supported, financially or otherwise,
  by any political party. The research results reported in this paper are
  purely scientific and reported as they are without any regard to which
  political party they may be of help (if at all)","Journal of Combinatorial Optimization, 40(2), 512-546, 2020",10.1007/s10878-020-00589-x,,cs.CC cs.CG cs.DM math.CO physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The topic of this paper is ""gerrymandering"", namely the curse of deliberate
creations of district maps with highly asymmetric electoral outcomes to
disenfranchise voters, and it has a long legal history. Measuring and
eliminating gerrymandering has enormous implications to sustain the backbone of
democratic principles of a society. Although there is no dearth of legal briefs
involving gerrymandering over many years, it is only more recently that
mathematicians and applied computational researchers have started to
investigate this topic. However, it has received relatively little attention so
far from the computational complexity researchers dealing with theoretical
analysis of computational complexity issues, such as computational hardness,
approximability issues, etc. There could be many reasons for this, such as
descriptions of these problem non-CS non-math (often legal or political)
journals that theoretical CS (TCS) people usually do not follow, or the lack of
coverage of these topics in TCS publication venues. One of our modest goals in
writing this article is to improve upon this situation by stimulating further
interactions between the gerrymandering and TCS researchers. To this effect,
our main contributions are twofold: (1) we provide formalization of several
models, related concepts, and corresponding problem statements using TCS
frameworks from the descriptions of these problems as available in existing
non-TCS (perhaps legal) venues, and (2) we also provide computational
complexity analysis of some versions of these problems, leaving other versions
for future research.
  The goal of writing this article is not to have the final word on
gerrymandering, but to introduce a series of concepts, models and problems to
the TCS community and to show that science of gerrymandering involves an
intriguing set of partitioning problems involving geometric and combinatorial
optimization.
","[{'version': 'v1', 'created': 'Thu, 3 Oct 2019 16:11:18 GMT'}]",2020-08-05,"[['Chatterjee', 'Tanima', ''], ['DasGupta', 'Bhaskar', '']]","['Gerrymandering', 'geometric partitioning', 'computational hardness', 'efficient algorithms']"
7526,2202.04051,Raoul Schoenhof,"Raoul Sch\""onhof and Manuel Fechter",Towards automated Capability Assessment leveraging Deep Learning,,"Procedia CIRP Volume 91, 2020, Pages 433-438",10.1016/j.procir.2020.02.195,,cs.GR cs.LG cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aiming for a higher economic efficiency in manufacturing, an increased degree
of automation is a key enabler. However, assessing the technical feasibility of
an automated assembly solution for a dedicated process is difficult and often
determined by the geometry of the given product parts. Among others, decisive
criterions of the automation feasibility are the ability to separate and
isolate single parts or the capability of component self-alignment in final
position. To assess the feasibility, a questionnaire based evaluation scheme
has been developed and applied by Fraunhofer researchers. However, the results
strongly depend on the implicit knowledge and experience of the single engineer
performing the assessment. This paper presents NeuroCAD, a software tool that
automates the assessment using voxelization techniques. The approach enables
the assessment of abstract and production relevant geometries features through
deep-learning based on CAD files.
","[{'version': 'v1', 'created': 'Fri, 28 Jan 2022 13:49:35 GMT'}]",2022-02-09,"[['Schönhof', 'Raoul', ''], ['Fechter', 'Manuel', '']]","['Assembly Automation', 'Deep Learning', 'Voxels', 'NeuroCAD']"
7527,2107.06481,Bharadwaj Manda,"Bharadwaj Manda, Pranjal Bhaskare, Ramanathan Muthuganapathy","A Convolutional Neural Network Approach to the Classification of
  Engineering Models",,"in IEEE Access, vol. 9, pp. 22711-22723, 2021",10.1109/ACCESS.2021.3055826,,cs.CV cs.AI cs.GR cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper presents a deep learning approach for the classification of
Engineering (CAD) models using Convolutional Neural Networks (CNNs). Owing to
the availability of large annotated datasets and also enough computational
power in the form of GPUs, many deep learning-based solutions for object
classification have been proposed of late, especially in the domain of images
and graphical models. Nevertheless, very few solutions have been proposed for
the task of functional classification of CAD models. Hence, for this research,
CAD models have been collected from Engineering Shape Benchmark (ESB), National
Design Repository (NDR) and augmented with newer models created using a
modelling software to form a dataset - 'CADNET'. It is proposed to use a
residual network architecture for CADNET, inspired by the popular ResNet. A
weighted Light Field Descriptor (LFD) scheme is chosen as the method of feature
extraction, and the generated images are fed as inputs to the CNN. The problem
of class imbalance in the dataset is addressed using a class weights approach.
Experiments have been conducted with other signatures such as geodesic distance
etc. using deep networks as well as other network architectures on the CADNET.
The LFD-based CNN approach using the proposed network architecture, along with
gradient boosting yielded the best classification accuracy on CADNET.
","[{'version': 'v1', 'created': 'Wed, 14 Jul 2021 04:33:50 GMT'}]",2021-07-15,"[['Manda', 'Bharadwaj', ''], ['Bhaskare', 'Pranjal', ''], ['Muthuganapathy', 'Ramanathan', '']]","['Engineering / CAD Models', 'Classification', 'Convolutional Neural Network', 'Gradient boosting', 'Light Field Descriptor (LFD)']"
7528,2209.11338,Mohamed Amine Kerkouri,"Mohamed Amine Kerkouri, Marouane Tliba, Aladine Chetouani, Alessandro
  Bruno","A domain adaptive deep learning solution for scanpath prediction of
  paintings","Accepted at CBMI2022 graz, austria",,10.1145/3549555.3549597,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Cultural heritage understanding and preservation is an important issue for
society as it represents a fundamental aspect of its identity. Paintings
represent a significant part of cultural heritage, and are the subject of study
continuously. However, the way viewers perceive paintings is strictly related
to the so-called HVS (Human Vision System) behaviour. This paper focuses on the
eye-movement analysis of viewers during the visual experience of a certain
number of paintings. In further details, we introduce a new approach to
predicting human visual attention, which impacts several cognitive functions
for humans, including the fundamental understanding of a scene, and then extend
it to painting images. The proposed new architecture ingests images and returns
scanpaths, a sequence of points featuring a high likelihood of catching
viewers' attention. We use an FCNN (Fully Convolutional Neural Network), in
which we exploit a differentiable channel-wise selection and Soft-Argmax
modules. We also incorporate learnable Gaussian distributions onto the network
bottleneck to simulate visual attention process bias in natural scene images.
Furthermore, to reduce the effect of shifts between different domains (i.e.
natural images, painting), we urge the model to learn unsupervised general
features from other domains using a gradient reversal classifier. The results
obtained by our model outperform existing state-of-the-art ones in terms of
accuracy and efficiency.
","[{'version': 'v1', 'created': 'Thu, 22 Sep 2022 22:27:08 GMT'}]",2022-09-26,"[['Kerkouri', 'Mohamed Amine', ''], ['Tliba', 'Marouane', ''], ['Chetouani', 'Aladine', ''], ['Bruno', 'Alessandro', '']]","['Scanpath Prediction', 'Unsupervised Domain Adaptation', 'Paintings']"
7529,2107.07686,Amir M. Mirzendehdel,"Amir M. Mirzendehdel, Morad Behandish, and Saigopal Nelaturi","Optimizing Build Orientation for Support Removal using Multi-Axis
  Machining",Special issue on Computational Fabrication,Computers and Graphics (2021),10.1016/j.cag.2021.07.011,,cs.CE cs.CG,http://creativecommons.org/licenses/by/4.0/,"  Parts fabricated by additive manufacturing (AM) are often fabricated first as
a near-net shape, a combination of intended nominal geometry and sacrificial
support structures, which need to be removed in a subsequent post-processing
stage using subtractive manufacturing (SM). In this paper, we present a
framework for optimizing the build orientation with respect to removability of
support structures. In particular, given a general multi-axis machining setup
and sampled build orientations, we define a Pareto-optimality criterion based
on the total support volume and the ""secluded"" support volume defined as the
support volume that is not accessible by a given set of machining tools. Since
total support volume mainly depends on the build orientation and the secluded
volume is dictated by the machining setup, in many cases the two objectives are
competing and their trade-off needs to be taken into account. The accessibility
analysis relies on the inaccessibility measure field (IMF), which is a
continuous field in the Euclidean space that quantifies the inaccessibility of
each point given a collection of tools and fixturing devices. The value of IMF
at each point indicates the minimum possible volumetric collision between
objects in relative motion including the part, fixtures, and the tools, over
all possible tool orientations and sharp points on the tool. We also propose an
automated support removal planning algorithm based on IMF, where a sequence of
actions are provided in terms of the fixturing devices, cutting tools, and tool
orientation at each step. In our approach, each step is chosen based on the
maximal removable volume to iteratively remove accessible supports. The
effectiveness of the proposed approach is demonstrated through benchmark
examples in 2D and realistic examples in 3D.
","[{'version': 'v1', 'created': 'Fri, 16 Jul 2021 03:24:51 GMT'}]",2021-07-19,"[['Mirzendehdel', 'Amir M.', ''], ['Behandish', 'Morad', ''], ['Nelaturi', 'Saigopal', '']]","['Build Direction Optimization', 'Support Structures', 'Multi-Axis Machining', 'Accessibility Analysis', 'SpatialPlanning', 'Hybrid Manufacturing']"
7530,1710.04843,Biju Issac,Syed Ali Raza Shah and Biju Issac,"Performance Comparison of Intrusion Detection Systems and Application of
  Machine Learning to Snort System",25 pages,"S.A.R. Shah, B. Issac, (2018). Performance Comparison of Intrusion
  Detection Systems and Application of Machine Learning to Snort System, Future
  Generation Computer Systems, Elsevier, ISSN 0167-739X, Vol. 80, 157-170",10.1016/j.future.2017.10.016,,cs.NI cs.CR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  This study investigates the performance of two open source intrusion
detection systems (IDSs) namely Snort and Suricata for accurately detecting the
malicious traffic on computer networks. Snort and Suricata were installed on
two different but identical computers and the performance was evaluated at 10
Gbps network speed. It was noted that Suricata could process a higher speed of
network traffic than Snort with lower packet drop rate but it consumed higher
computational resources. Snort had higher detection accuracy and was thus
selected for further experiments. It was observed that the Snort triggered a
high rate of false positive alarms. To solve this problem a Snort adaptive
plug-in was developed. To select the best performing algorithm for Snort
adaptive plug-in, an empirical study was carried out with different learning
algorithms and Support Vector Machine (SVM) was selected. A hybrid version of
SVM and Fuzzy logic produced a better detection accuracy. But the best result
was achieved using an optimised SVM with firefly algorithm with FPR (false
positive rate) as 8.6% and FNR (false negative rate) as 2.2%, which is a good
result. The novelty of this work is the performance comparison of two IDSs at
10 Gbps and the application of hybrid and optimised machine learning algorithms
to Snort.
","[{'version': 'v1', 'created': 'Fri, 13 Oct 2017 08:49:10 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Nov 2017 09:54:03 GMT'}]",2018-02-19,"[['Shah', 'Syed Ali Raza', ''], ['Issac', 'Biju', '']]","['Intrusion Detection', 'Snort and Suricata', 'Performance Comparison', 'Machine Learning', 'Support Vector Machine', 'Fuzzy Logic']"
7531,2212.13910,Tanmayee Salunke,Tanmayee Salunke and Unnati Nichite,Recommender Systems in E-commerce,,,10.13140/RG.2.2.10194.43202,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  E-commerce recommender systems are becoming increasingly important in the
current digital world. They are used to personalize user experience, help
customers find what they need quickly and efficiently, and increase revenue for
the business. However, there are several challenges associated with big
data-based e-commerce recommender systems. These challenges include limited
resources, data validity period, cold start, long tail problem, scalability. In
this paper, we discuss the challenges and potential solutions to overcome these
challenges. We also discuss the different types of e-commerce recommender
systems, their advantages, and disadvantages. We conclude with some future
research directions to improve the performance of e-commerce recommender
systems.
","[{'version': 'v1', 'created': 'Tue, 13 Dec 2022 12:51:27 GMT'}]",2022-12-29,"[['Salunke', 'Tanmayee', ''], ['Nichite', 'Unnati', '']]","['E-commerce', 'Recommendation System', 'Buying', 'Selling', 'Customers']"
7532,2003.04661,Martin Johannes Kraemer,"Martin J. Kraemer, Ulrik Lyngs, Helena Webb, Ivan Flechais","Further Exploring Communal Technology Use in Smart Homes: Social
  Expectations","to appear in CHI '20 Extended Abstracts, April 25--30, 2020,
  Honolulu, HI, USA",,10.1145/3334480.3382972,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Device use in smart homes is becoming increasingly communal, requiring
cohabitants to navigate a complex social and technological context. In this
paper, we report findings from an exploratory survey grounded in our prior work
on communal technology use in the home [4]. The findings highlight the
importance of considering qualities of social relationships and technology in
understanding expectations and intentions of communal technology use. We
propose a design perspective of social expectations, and we suggest existing
designs can be expanded using already available information such as location,
and considering additional information, such as levels of trust and
reliability.
","[{'version': 'v1', 'created': 'Tue, 10 Mar 2020 12:29:40 GMT'}]",2020-03-11,"[['Kraemer', 'Martin J.', ''], ['Lyngs', 'Ulrik', ''], ['Webb', 'Helena', ''], ['Flechais', 'Ivan', '']]","['communal technology use', 'smart home', 'multi-user']"
7533,1411.0114,Maksym Girnyk,"Maksym A. Girnyk and Fr\'ed\'eric Gabry and Mikko Vehkaper\""a and Lars
  K. Rasmussen and Mikael Skoglund","On the Transmit Beamforming for MIMO Wiretap Channels: Large-System
  Analysis","Published in Lecture Notes in Computer Science 8317, pp. 90-102,
  2014. (Proceedings of International Conference on Information-Theoretic
  Security (ICITS), Singapore, November 2013)","Lecture Notes in Computer Science 8317, pp. 90-102, 2014",10.1007/978-3-319-04268-8_6,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the growth of wireless networks, security has become a fundamental issue
in wireless communications due to the broadcast nature of these networks. In
this work, we consider MIMO wiretap channels in a fast fading environment, for
which the overall performance is characterized by the ergodic MIMO secrecy
rate. Unfortunately, the direct solution to finding ergodic secrecy rates is
prohibitive due to the expectations in the rates expressions in this setting.
To overcome this difficulty, we invoke the large-system assumption, which
allows a deterministic approximation to the ergodic mutual information.
Leveraging results from random matrix theory, we are able to characterize the
achievable ergodic secrecy rates. Based on this characterization, we address
the problem of covariance optimization at the transmitter. Our numerical
results demonstrate a good match between the large-system approximation and the
actual simulated secrecy rates, as well as some interesting features of the
precoder optimization.
","[{'version': 'v1', 'created': 'Sat, 1 Nov 2014 13:09:52 GMT'}]",2014-11-04,"[['Girnyk', 'Maksym A.', ''], ['Gabry', 'Frédéric', ''], ['Vehkaperä', 'Mikko', ''], ['Rasmussen', 'Lars K.', ''], ['Skoglund', 'Mikael', '']]","['MIMO wiretap channel', 'Large-system approximation', 'Random matrix theory', 'Beamforming']"
7534,2102.13508,Daniel Buschek,"Sarah Theres V\""olkel, Daniel Buschek, Malin Eiband, Benjamin R.
  Cowan, Heinrich Hussmann","Eliciting and Analysing Users' Envisioned Dialogues with Perfect Voice
  Assistants","15 pages, 4 figures, 3 tables, ACM CHI 2021",,10.1145/3411764.3445536,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a dialogue elicitation study to assess how users envision
conversations with a perfect voice assistant (VA). In an online survey, N=205
participants were prompted with everyday scenarios, and wrote the lines of both
user and VA in dialogues that they imagined as perfect. We analysed the
dialogues with text analytics and qualitative analysis, including number of
words and turns, social aspects of conversation, implied VA capabilities, and
the influence of user personality. The majority envisioned dialogues with a VA
that is interactive and not purely functional; it is smart, proactive, and has
knowledge about the user. Attitudes diverged regarding the assistant's role as
well as it expressing humour and opinions. An exploratory analysis suggested a
relationship with personality for these aspects, but correlations were low
overall. We discuss implications for research and design of future VAs,
underlining the vision of enabling conversational UIs, rather than single
command ""Q&As"".
","[{'version': 'v1', 'created': 'Fri, 26 Feb 2021 14:38:57 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Apr 2021 06:35:25 GMT'}]",2021-04-07,"[['Völkel', 'Sarah Theres', ''], ['Buschek', 'Daniel', ''], ['Eiband', 'Malin', ''], ['Cowan', 'Benjamin R.', ''], ['Hussmann', 'Heinrich', '']]","['Adaptation', 'conversational agent', 'dialogue', 'personality', 'voice assistant']"
7535,2203.10837,Marcos Faundez-Zanuy,"K. L\'opez-de-Ipi\~na, Marcos Faundez-Zanuy, Jordi Sol\'e-Casals,
  Fernando Zelarin, Pilar Calvo","Multi-class versus One-class classifier in spontaneous speech analysis
  oriented to Alzheimer Disease diagnosis","10 pages, published in International Conference on NONLINEAR SPEECH
  PROCESSING, NOLISP 2015 jointly organized with the 25th Italian Workshop on
  Neural Networks, WIRN 2015, held at May 2015, Vietri sul Mare, Salerno, Italy","Recent Advances in Nonlinear Speech Processing. Smart Innovation,
  Systems and Technologies, vol 48. Springer, Cham 2015",10.1007/978-3-319-28109-4_7,,cs.SD cs.LG eess.AS,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Most of medical developments require the ability to identify samples that are
anomalous with respect to a target group or control group, in the sense they
could belong to a new, previously unseen class or are not class data. In this
case when there are not enough data to train two-class One-class classification
appear like an available solution. On the other hand non-linear approaches
could give very useful information. The aim of our project is to contribute to
earlier diagnosis of AD and better estimates of its severity by using automatic
analysis performed through new biomarkers extracted from speech signal. The
methods selected in this case are speech biomarkers oriented to Spontaneous
Speech and Emotional Response Analysis. In this approach One-class classifiers
and two-class classifiers are analyzed. The use of information about outlier
and Fractal Dimension features improves the system performance.
","[{'version': 'v1', 'created': 'Mon, 21 Mar 2022 09:57:20 GMT'}]",2022-03-22,"[['López-de-Ipiña', 'K.', ''], ['Faundez-Zanuy', 'Marcos', ''], ['Solé-Casals', 'Jordi', ''], ['Zelarin', 'Fernando', ''], ['Calvo', 'Pilar', '']]","['One-class classifier', 'Nonlinear Speech Processing', 'Alzheimer disease diagnosis', 'Spontaneous Speech', 'Fractal Dimensions']"
7536,2105.00522,Zhiwei Liu,"Zhiwei Liu, Ziwei Fan, Yu Wang, Philip S. Yu","Augmenting Sequential Recommendation with Pseudo-Prior Items via
  Reversely Pre-training Transformer",Accepted by SIGIR 2021,,10.1145/3404835.3463036,,cs.IR cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Sequential Recommendation characterizes the evolving patterns by modeling
item sequences chronologically. The essential target of it is to capture the
item transition correlations. The recent developments of transformer inspire
the community to design effective sequence encoders, \textit{e.g.,} SASRec and
BERT4Rec. However, we observe that these transformer-based models suffer from
the cold-start issue, \textit{i.e.,} performing poorly for short sequences.
Therefore, we propose to augment short sequences while still preserving
original sequential correlations. We introduce a new framework for
\textbf{A}ugmenting \textbf{S}equential \textbf{Re}commendation with
\textbf{P}seudo-prior items~(ASReP). We firstly pre-train a transformer with
sequences in a reverse direction to predict prior items. Then, we use this
transformer to generate fabricated historical items at the beginning of short
sequences. Finally, we fine-tune the transformer using these augmented
sequences from the time order to predict the next item. Experiments on two
real-world datasets verify the effectiveness of ASReP. The code is available on
\url{https://github.com/DyGRec/ASReP}.
","[{'version': 'v1', 'created': 'Sun, 2 May 2021 18:06:23 GMT'}]",2021-05-04,"[['Liu', 'Zhiwei', ''], ['Fan', 'Ziwei', ''], ['Wang', 'Yu', ''], ['Yu', 'Philip S.', '']]","['Sequential Recommendation', 'Transformer', 'Cold-start', 'Augmentation', 'Pre-training']"
7537,1910.07441,Michael Gastner,Anna Evtushenko and Michael T. Gastner,Beyond Fortune 500: Women in a Global Network of Directors,"14 pages, 5 figures, 2 tables, accepted to Complex Networks 2019.
  Data available at https://doi.org/10.5281/zenodo.3553442","In H. Cherifi et al. (Eds.), Complex Networks and Their
  Applications VIII, Volume 1, pp. 586-598 (Springer, Cham, 2020)",10.1007/978-3-030-36683-4_47,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many countries, the representation of women on corporate boards of
directors has become a topic of intense political debate. Social networking
plays a crucial role in the appointment to a board so that an informed debate
requires knowing where women are located in the network of directors. One way
to quantify the network is by studying the links created by serving on the same
board and by joint appointments on multiple boards. We analyse a network of
$\approx 320\,000$ board members of $36\,000$ companies traded on stock
exchanges all over the world, focusing specifically on the position of women in
the network. Women only have $\approx 9-13\%$ of all seats, but they are not
marginalised. Applying metrics from social network analysis, we find that their
influence is close to that of men. We do not find evidence to support previous
claims that women play the role of ""queen bees"" that exclude other women from
similar positions.
","[{'version': 'v1', 'created': 'Wed, 16 Oct 2019 16:03:08 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Oct 2019 01:38:07 GMT'}]",2019-11-28,"[['Evtushenko', 'Anna', ''], ['Gastner', 'Michael T.', '']]","['interlocking directorates', 'social networks', 'gender inequality']"
7538,2108.12043,Xiao Liu,"Xiao Liu, Pedro Sanchez, Spyridon Thermos, Alison Q. O'Neil, and
  Sotirios A. Tsaftaris",Learning Disentangled Representations in the Imaging Domain,"Accepted by Medical Image Analysis. This paper follows a tutorial
  style but also surveys a considerable (more than 260 citations) number of
  works",,10.1016/j.media.2022.102516,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Disentangled representation learning has been proposed as an approach to
learning general representations even in the absence of, or with limited,
supervision. A good general representation can be fine-tuned for new target
tasks using modest amounts of data, or used directly in unseen domains
achieving remarkable performance in the corresponding task. This alleviation of
the data and annotation requirements offers tantalising prospects for
applications in computer vision and healthcare. In this tutorial paper, we
motivate the need for disentangled representations, revisit key concepts, and
describe practical building blocks and criteria for learning such
representations. We survey applications in medical imaging emphasising choices
made in exemplar key works, and then discuss links to computer vision
applications. We conclude by presenting limitations, challenges, and
opportunities.
","[{'version': 'v1', 'created': 'Thu, 26 Aug 2021 21:44:10 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Sep 2021 14:33:15 GMT'}, {'version': 'v3', 'created': 'Thu, 16 Sep 2021 09:56:32 GMT'}, {'version': 'v4', 'created': 'Mon, 8 Nov 2021 15:40:48 GMT'}, {'version': 'v5', 'created': 'Sun, 17 Apr 2022 16:53:55 GMT'}, {'version': 'v6', 'created': 'Fri, 29 Jul 2022 12:18:34 GMT'}]",2022-08-01,"[['Liu', 'Xiao', ''], ['Sanchez', 'Pedro', ''], ['Thermos', 'Spyridon', ''], [""O'Neil"", 'Alison Q.', ''], ['Tsaftaris', 'Sotirios A.', '']]","['disentangled representation', 'content-style', 'applications', 'tutorial', 'medical imaging', 'computer vision']"
7539,2212.05903,Smaran Adarsh,"Smaran Adarsh, Lukas Burgholzer, Tanmay Manjunath and Robert Wille",SyReC Synthesizer: An MQT tool for synthesis of reversible circuits,"6 pages, 3 figures, Software Impacts Journal","Software Impacts, vol. 14, p. 100451, 2022",10.1016/j.simpa.2022.100451,,cs.AR cs.ET quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reversible circuits form the backbone for many promising emerging
technologies such as quantum computing, low power/adiabatic design,
encoder/decoder devices, and several other applications. In the recent years,
the scalable synthesis of such circuits has gained significant attention. In
this work, we present the SyReC Synthesizer, a synthesis tool for reversible
circuits based on the hardware description language SyReC. SyReC allows to
describe reversible functionality at a high level of abstraction. The provided
SyReC Synthesizer then realizes this functionality in a push-button fashion.
Corresponding options allow for a trade-off between the number of needed
circuit signals/lines (relevant, e.g., for quantum computing in which every
circuit line corresponds to a qubit) and the respectively needed gates
(corresponding to the circuit's costs). Furthermore, the tool allows to
simulate the resulting circuit as well as to determine the gate costs of it.
The SyReC Synthesizer is available as an open-source software package at
https://github.com/cda-tum/syrec as part of the Munich Quantum Toolkit (MQT).
","[{'version': 'v1', 'created': 'Mon, 12 Dec 2022 14:03:43 GMT'}]",2022-12-13,"[['Adarsh', 'Smaran', ''], ['Burgholzer', 'Lukas', ''], ['Manjunath', 'Tanmay', ''], ['Wille', 'Robert', '']]","['Reversible computing', 'HDL-based synthesis', 'SyReC']"
7540,2006.03481,Fernando Ortega,"Fernando Ortega, Ra\'ul Lara-Cabrera, \'Angel Gonz\'alez-Prieto,
  Jes\'us Bobadilla","Providing reliability in Recommender Systems through Bernoulli Matrix
  Factorization","28 pages, 8 figures, 8 tables","Information Sciences, 2020",10.1016/j.ins.2020.12.001,,cs.LG cs.IR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Beyond accuracy, quality measures are gaining importance in modern
recommender systems, with reliability being one of the most important
indicators in the context of collaborative filtering. This paper proposes
Bernoulli Matrix Factorization (BeMF), which is a matrix factorization model,
to provide both prediction values and reliability values. BeMF is a very
innovative approach from several perspectives: a) it acts on model-based
collaborative filtering rather than on memory-based filtering, b) it does not
use external methods or extended architectures, such as existing solutions, to
provide reliability, c) it is based on a classification-based model instead of
traditional regression-based models, and d) matrix factorization formalism is
supported by the Bernoulli distribution to exploit the binary nature of the
designed classification model. The experimental results show that the more
reliable a prediction is, the less liable it is to be wrong: recommendation
quality improves after the most reliable predictions are selected.
State-of-the-art quality measures for reliability have been tested, which shows
that BeMF outperforms previous baseline methods and models.
","[{'version': 'v1', 'created': 'Fri, 5 Jun 2020 14:24:27 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Mar 2021 10:10:36 GMT'}, {'version': 'v3', 'created': 'Fri, 23 Apr 2021 11:12:48 GMT'}, {'version': 'v4', 'created': 'Wed, 28 Apr 2021 10:23:15 GMT'}, {'version': 'v5', 'created': 'Thu, 3 Mar 2022 14:20:24 GMT'}, {'version': 'v6', 'created': 'Fri, 4 Mar 2022 12:51:36 GMT'}]",2022-03-07,"[['Ortega', 'Fernando', ''], ['Lara-Cabrera', 'Raúl', ''], ['González-Prieto', 'Ángel', ''], ['Bobadilla', 'Jesús', '']]","['Recommender Systems', 'Collaborative Filtering', 'Matrix Factorization', 'Reliability', 'Classification model', 'Bernoulli distribution']"
7541,2202.01612,Nicolas E. Diaz Ferreyra PhD,"Priyanka Billawa, Anusha Bambhore Tukaram, Nicol\'as E. D\'iaz
  Ferreyra, Jan-Philipp Stegh\""ofer, Riccardo Scandariato and Georg Simhandl","SoK: Security of Microservice Applications: A Practitioners' Perspective
  on Challenges and Best Practices","Accepted at the 17th International Conference on Availability,
  Reliability and Security (ARES 2022)",,10.1145/3538969.3538986,,cs.CR cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Cloud-based application deployment is becoming increasingly popular among
businesses, thanks to the emergence of microservices. However, securing such
architectures is a challenging task since traditional security concepts cannot
be directly applied to microservice architectures due to their distributed
nature. The situation is exacerbated by the scattered nature of guidelines and
best practices advocated by practitioners and organizations in this field. This
research paper we aim to shay light over the current microservice security
discussions hidden within Grey Literature (GL) sources. Particularly, we
identify the challenges that arise when securing microservice architectures, as
well as solutions recommended by practitioners to address these issues. For
this, we conducted a systematic GL study on the challenges and best practices
of microservice security present in the Internet with the goal of capturing
relevant discussions in blogs, white papers, and standards. We collected 312 GL
sources from which 57 were rigorously classified and analyzed. This analysis on
the one hand validated past academic literature studies in the area of
microservice security, but it also identified improvements to existing
methodologies pointing towards future research directions.
","[{'version': 'v1', 'created': 'Thu, 3 Feb 2022 14:37:11 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Sep 2022 11:46:32 GMT'}]",2022-09-05,"[['Billawa', 'Priyanka', ''], ['Tukaram', 'Anusha Bambhore', ''], ['Ferreyra', 'Nicolás E. Díaz', ''], ['Steghöfer', 'Jan-Philipp', ''], ['Scandariato', 'Riccardo', ''], ['Simhandl', 'Georg', '']]","['microservices', 'security', 'challenges', 'best practices', 'grey literature']"
7542,2102.13241,Antonios Saravanos,"Antonios Saravanos (1), Dongnanzi Zheng (1), Stavros Zervoudakis (1),
  Donatella Delfino (1) ((1) New York University)","Exploring the Effect of Resolution on the Usability of Locimetric
  Authentication","10 pages, 2 figures",,10.1007/978-3-030-90238-4_27,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Locimetric authentication is a form of graphical authentication in which
users validate their identity by selecting predetermined points on a
predetermined image. Its primary advantage over the ubiquitous text-based
approach stems from users' superior ability to remember visual information over
textual information, coupled with the authentication process being transformed
to one requiring recognition (instead of recall). Ideally, these
differentiations enable users to create more complex passwords, which
theoretically are more secure. Yet locimetric authentication has one
significant weakness: hot-spots. This term refers to areas of an image that
users gravitate towards, and which consequently have a higher probability of
being selected. Although many strategies have been proposed to counter the
hot-spot problem, one area that has received little attention is that of
resolution. The hypothesis here is that high-resolution images would afford the
user a larger password space, and consequently any hot-spots would dissipate.
We employ an experimental approach, where users generate a series of locimetric
passwords on either low- or high-resolution images. Our research reveals the
presence of hot-spots even in high-resolution images, albeit at a lower level
than that exhibited with low-resolution images. We conclude by reinforcing that
other techniques - such as existing or new software controls or training - need
to be utilized to mitigate the emergence of hot-spots with the locimetric
scheme.
","[{'version': 'v1', 'created': 'Fri, 26 Feb 2021 00:15:09 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Jul 2021 20:45:54 GMT'}]",2022-04-04,"[['Saravanos', 'Antonios', '', 'New York University'], ['Zheng', 'Dongnanzi', '', 'New York University'], ['Zervoudakis', 'Stavros', '', 'New York University'], ['Delfino', 'Donatella', '', 'New York University']]","['locimetric authentication', 'hot-spots', 'high-resolution graphical passwords']"
7543,2205.00424,Kesu Wang,"Kesu Wang, Meng Yan, He Zhang, Haibo Hu","Unified Abstract Syntax Tree Representation Learning for Cross-Language
  Program Classification",,30th International Conference on Program Comprehension(ICPC 2022),10.1145/3524610.3527915,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Program classification can be regarded as a high-level abstraction of code,
laying a foundation for various tasks related to source code comprehension, and
has a very wide range of applications in the field of software engineering,
such as code clone detection, code smell classification, defects
classification, etc. The cross-language program classification can realize code
transfer in different programming languages, and can also promote
cross-language code reuse, thereby helping developers to write code quickly and
reduce the development time of code transfer. Most of the existing studies
focus on the semantic learning of the code, whilst few studies are devoted to
cross-language tasks. The main challenge of cross-language program
classification is how to extract semantic features of different programming
languages. In order to cope with this difficulty, we propose a Unified Abstract
Syntax Tree (namely UAST in this paper) neural network. In detail, the core
idea of UAST consists of two unified mechanisms. First, UAST learns an AST
representation by unifying the AST traversal sequence and graph-like AST
structure for capturing semantic code features. Second, we construct a
mechanism called unified vocabulary, which can reduce the feature gap between
different programming languages, so it can achieve the role of cross-language
program classification. Besides, we collect a dataset containing 20,000 files
of five programming languages, which can be used as a benchmark dataset for the
cross-language program classification task. We have done experiments on two
datasets, and the results show that our proposed approach outperforms the
state-of-the-art baselines in terms of four evaluation metrics (Precision,
Recall, F1-score, and Accuracy).
","[{'version': 'v1', 'created': 'Sun, 1 May 2022 08:45:43 GMT'}]",2022-05-03,"[['Wang', 'Kesu', ''], ['Yan', 'Meng', ''], ['Zhang', 'He', ''], ['Hu', 'Haibo', '']]","['Program Comprehension', 'Program Classification', 'Code Representation Learning', 'Cross-language Program Classification']"
7544,1905.09820,Pawel Trajdos,"Pawel Trajdos, Marek Kurzynski","Randomized Reference Classifier with Gaussian Distribution and Soft
  Confusion Matrix Applied to the Improving Weak Classifiers",arXiv admin note: text overlap with arXiv:1901.08827,,10.1007/978-3-030-19738-4_33,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, an issue of building the RRC model using probability
distributions other than beta distribution is addressed. More precisely, in
this paper, we propose to build the RRR model using the truncated normal
distribution. Heuristic procedures for expected value and the variance of the
truncated-normal distribution are also proposed. The proposed approach is
tested using SCM-based model for testing the consequences of applying the
truncated normal distribution in the RRC model. The experimental evaluation is
performed using four different base classifiers and seven quality measures. The
results showed that the proposed approach is comparable to the RRC model built
using beta distribution. What is more, for some base classifiers, the
truncated-normal-based SCM algorithm turned out to be better at discovering
objects coming from minority classes.
","[{'version': 'v1', 'created': 'Thu, 23 May 2019 05:34:21 GMT'}]",2019-05-27,"[['Trajdos', 'Pawel', ''], ['Kurzynski', 'Marek', '']]","['classification', 'randomized reference classifier', 'Gaussian distribution', 'multiclassifier systems']"
7545,1810.01871,Alban Laflaqui\`ere Dr,Alban Laflaqui\`ere,"Grounding the Experience of a Visual Field through Sensorimotor
  Contingencies","23 pages, 7 figures, published in Neurocomputing","Neurocomputing, Volume 268, 13 December 2017, Pages 142-152",10.1016/j.neucom.2016.11.085,,cs.LG cs.AI cs.RO stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Artificial perception is traditionally handled by hand-designing task
specific algorithms. However, a truly autonomous robot should develop
perceptive abilities on its own, by interacting with its environment, and
adapting to new situations. The sensorimotor contingencies theory proposes to
ground the development of those perceptive abilities in the way the agent can
actively transform its sensory inputs. We propose a sensorimotor approach,
inspired by this theory, in which the agent explores the world and discovers
its properties by capturing the sensorimotor regularities they induce. This
work presents an application of this approach to the discovery of a so-called
visual field as the set of regularities that a visual sensor imposes on a naive
agent's experience. A formalism is proposed to describe how those regularities
can be captured in a sensorimotor predictive model. Finally, the approach is
evaluated on a simulated system coarsely inspired from the human retina.
","[{'version': 'v1', 'created': 'Wed, 3 Oct 2018 13:42:43 GMT'}]",2018-10-05,"[['Laflaquière', 'Alban', '']]","['autonomous systems', 'developmental robotics', 'sensorimotorcontingencies', 'predictive processing', 'sensorimotor learning', 'human-like vision']"
7546,2208.00647,Thierry Denoeux,Thierry Denoeux,"An Evidential Neural Network Model for Regression Based on Random Fuzzy
  Numbers","7th International Conference on Belief Functions (BELIEF 2022),
  Paris, France, October 26-28, 2022","In: Le H\'egarat-Mascle, S., Bloch, I., Aldea, E. (eds) Belief
  Functions: Theory and Applications. BELIEF 2022. Lecture Notes in Computer
  Science, vol 13506. Springer, Cham, 2022, pp.57-66",10.1007/978-3-031-17801-6_6,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  We introduce a distance-based neural network model for regression, in which
prediction uncertainty is quantified by a belief function on the real line. The
model interprets the distances of the input vector to prototypes as pieces of
evidence represented by Gaussian random fuzzy numbers (GRFN's) and combined by
the generalized product intersection rule, an operator that extends Dempster's
rule to random fuzzy sets. The network output is a GRFN that can be summarized
by three numbers characterizing the most plausible predicted value, variability
around this value, and epistemic uncertainty. Experiments with real datasets
demonstrate the very good performance of the method as compared to
state-of-the-art evidential and statistical learning algorithms.
\keywords{Evidence theory, Dempster-Shafer theory, belief functions, machine
learning, random fuzzy sets.
","[{'version': 'v1', 'created': 'Mon, 1 Aug 2022 07:13:31 GMT'}]",2022-11-29,"[['Denoeux', 'Thierry', '']]","['Evidence theory', 'Dempster-Shafer theory', 'belief functions', 'machine learning', 'random fuzzy sets']"
7547,2007.08442,Hongyang Gao,"Hongyang Gao, Zhengyang Wang, Shuiwang Ji",Kronecker Attention Networks,"9 pages, KDD2020",,10.1145/3394486.3403065,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Attention operators have been applied on both 1-D data like texts and
higher-order data such as images and videos. Use of attention operators on
high-order data requires flattening of the spatial or spatial-temporal
dimensions into a vector, which is assumed to follow a multivariate normal
distribution. This not only incurs excessive requirements on computational
resources, but also fails to preserve structures in data. In this work, we
propose to avoid flattening by assuming the data follow matrix-variate normal
distributions. Based on this new view, we develop Kronecker attention operators
(KAOs) that operate on high-order tensor data directly. More importantly, the
proposed KAOs lead to dramatic reductions in computational resources.
Experimental results show that our methods reduce the amount of required
computational resources by a factor of hundreds, with larger factors for
higher-dimensional and higher-order data. Results also show that networks with
KAOs outperform models without attention, while achieving competitive
performance as those with original attention operators.
","[{'version': 'v1', 'created': 'Thu, 16 Jul 2020 16:26:02 GMT'}]",2020-07-17,"[['Gao', 'Hongyang', ''], ['Wang', 'Zhengyang', ''], ['Ji', 'Shuiwang', '']]","['Attention', 'neural networks', 'Kronecker attention', 'image classification', 'image segmentation']"
7548,1802.01256,Yuan Ziyang,"Ziyang Yuan, Hongxia Wang",Phase retrieval with background information,,,10.1088/1361-6420/ab0b18,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Phase retrieval problem has been studied in various applications. It is an
inverse problem without the standard uniqueness guarantee. To make complete
theoretical analyses and devise efficient algorithms to recover the signal is
sophisticated. In this paper, we come up with a model called \textit{phase
retrieval with background information} which recovers the signal with the known
background information from the intensity of their combinational Fourier
transform spectrum. We prove that the uniqueness of phase retrieval can be
guaranteed even considering those trivial solutions when the background
information is sufficient. Under this condition, we construct a loss function
and utilize the projected gradient descent method to search for the ground
truth. We prove that the stationary point is the global optimum with
probability 1. Numerical simulations demonstrate the projected gradient descent
method performs well both for 1-D and 2-D signals. Furthermore, this method is
quite robust to the Gaussian noise and the bias of the background information.
","[{'version': 'v1', 'created': 'Mon, 5 Feb 2018 03:52:09 GMT'}]",2019-05-22,"[['Yuan', 'Ziyang', ''], ['Wang', 'Hongxia', '']]","['phase retrieval', 'uniqueness', 'projected gradient descent', 'background information']"
7549,2301.10629,Daniel Reti,"Daniel Reti, Karina Elzer, Daniel Fraunholz, Daniel Schneider,
  Hans-Dieter Schotten","Evaluating Deception and Moving Target Defense with Network Attack
  Simulation",,,10.1145/3560828.3564006,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the field of network security, with the ongoing arms race between
attackers, seeking new vulnerabilities to bypass defense mechanisms and
defenders reinforcing their prevention, detection and response strategies, the
novel concept of cyber deception has emerged. Starting from the well-known
example of honeypots, many other deception strategies have been developed such
as honeytokens and moving target defense, all sharing the objective of creating
uncertainty for attackers and increasing the chance for the attacker of making
mistakes. In this paper a methodology to evaluate the effectiveness of
honeypots and moving target defense in a network is presented. This methodology
allows to quantitatively measure the effectiveness in a simulation environment,
allowing to make recommendations on how many honeypots to deploy and on how
quickly network addresses have to be mutated to effectively disrupt an attack
in multiple network and attacker configurations. With this optimum, attacks can
be detected and slowed down with a minimal resource and configuration overhead.
With the provided methodology, the optimal number of honeypots to be deployed
and the optimal network address mutation interval can be determined.
Furthermore, this work provides guidance on how to optimally deploy and
configure them with respect to the attacker model and several network
parameters.
","[{'version': 'v1', 'created': 'Wed, 25 Jan 2023 15:11:59 GMT'}]",2023-01-26,"[['Reti', 'Daniel', ''], ['Elzer', 'Karina', ''], ['Fraunholz', 'Daniel', ''], ['Schneider', 'Daniel', ''], ['Schotten', 'Hans-Dieter', '']]","['network security', 'cyber deception', 'moving target defense', 'honeypot']"
7550,2109.06180,Ond\v{r}ej Luk\'a\v{s},Ondrej Lukas and Sebastian Garcia,"Deep Generative Models to Extend Active Directory Graphs with Honeypot
  Users","2nd International Conference on Deep Learning Theory and Applications
  - DeLTA2021","In Proceedings of the 2nd International Conference on Deep
  Learning Theory and Applications - DeLTA, ISBN 978-989-758-526-5; ISSN
  2184-9277, pages 140-147; 2021",10.5220/0010556601400147,,cs.CR cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Active Directory (AD) is a crucial element of large organizations, given its
central role in managing access to resources. Since AD is used by all users in
the organization, it is hard to detect attackers. We propose to generate and
place fake users (honeyusers) in AD structures to help detect attacks. However,
not any honeyuser will attract attackers. Our method generates honeyusers with
a Variational Autoencoder that enriches the AD structure with well-positioned
honeyusers. It first learns the embeddings of the original nodes and edges in
the AD, then it uses a modified Bidirectional DAG-RNN to encode the parameters
of the probability distribution of the latent space of node representations.
Finally, it samples nodes from this distribution and uses an MLP to decide
where the nodes are connected. The model was evaluated by the similarity of the
generated AD with the original, by the positions of the new nodes, by the
similarity with GraphRNN and finally by making real intruders attack the
generated AD structure to see if they select the honeyusers. Results show that
our machine learning model is good enough to generate well-placed honeyusers
for existing AD structures so that intruders are lured into them.
","[{'version': 'v1', 'created': 'Mon, 13 Sep 2021 15:07:35 GMT'}]",2021-09-15,"[['Lukas', 'Ondrej', ''], ['Garcia', 'Sebastian', '']]","['Generative models', 'Autoencoders', 'Active Directory', 'Honeypots', 'Deep Learning']"
7551,1804.01254,Yusuke Sakumoto,"Yusuke Sakumoto, Tsukasa Kameyama, Chisa Takano, Masaki Aida","Information Propagation Analysis of Social Network Using the
  Universality of Random Matrix",8 pages with 9 figures,,10.1587/transcom.2018EBP3098,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spectral graph theory gives an algebraical approach to analyze the dynamics
of a network by using the matrix that represents the network structure.
However, it is not easy for social networks to apply the spectral graph theory
because the matrix elements cannot be given exactly to represent the structure
of a social network. The matrix element should be set on the basis of the
relationship between persons, but the relationship cannot be quantified
accurately from obtainable data (e.g., call history and chat history). To get
around this problem, we utilize the universality of random matrix with the
feature of social networks. As such random matrix, we use normalized Laplacian
matrix for a network where link weights are randomly given. In this paper, we
first clarify that the universality (i.e., the Wigner semicircle law) of the
normalized Laplacian matrix appears in the eigenvalue frequency distribution
regardless of the link weight distribution. Then, we analyze the information
propagation speed by using the spectral graph theory and the universality of
the normalized Laplacian matrix. As the results, we show that the worst-case
speed of the information propagation changes at most 2 if the structure (i.e.,
relationship among people) of a social network changes.
","[{'version': 'v1', 'created': 'Wed, 4 Apr 2018 06:36:24 GMT'}]",2020-04-02,"[['Sakumoto', 'Yusuke', ''], ['Kameyama', 'Tsukasa', ''], ['Takano', 'Chisa', ''], ['Aida', 'Masaki', '']]","['Social Network', 'Information Propagation', 'RandomMatrix', 'Spectral Graph Theory', 'Wigner Semicircle Law', 'Laplacian Matrix']"
7552,2202.05982,Hong Jin Kang,"Hong Jin Kang, Khai Loong Aw, David Lo","Detecting False Alarms from Automatic Static Analysis Tools: How Far are
  We?",Accepted to the Technical Track of ICSE 2022,,10.1145/3510003.3510214,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Automatic static analysis tools (ASATs), such as Findbugs, have a high false
alarm rate. The large number of false alarms produced poses a barrier to
adoption. Researchers have proposed the use of machine learning to prune false
alarms and present only actionable warnings to developers. The state-of-the-art
study has identified a set of ""Golden Features"" based on metrics computed over
the characteristics and history of the file, code, and warning. Recent studies
show that machine learning using these features is extremely effective and that
they achieve almost perfect performance.
  We perform a detailed analysis to better understand the strong performance of
the ""Golden Features"". We found that several studies used an experimental
procedure that results in data leakage and data duplication, which are subtle
issues with significant implications. Firstly, the ground-truth labels have
leaked into features that measure the proportion of actionable warnings in a
given context. Secondly, many warnings in the testing dataset appear in the
training dataset. Next, we demonstrate limitations in the warning oracle that
determines the ground-truth labels, a heuristic comparing warnings in a given
revision to a reference revision in the future. We show the choice of reference
revision influences the warning distribution. Moreover, the heuristic produces
labels that do not agree with human oracles. Hence, the strong performance of
these techniques previously seen is overoptimistic of their true performance if
adopted in practice. Our results convey several lessons and provide guidelines
for evaluating false alarm detectors.
","[{'version': 'v1', 'created': 'Sat, 12 Feb 2022 04:36:14 GMT'}]",2022-02-15,"[['Kang', 'Hong Jin', ''], ['Aw', 'Khai Loong', ''], ['Lo', 'David', '']]","['static analysis', 'false alarms', 'data leakage', 'data duplication']"
7553,1710.06372,Maher Alharby,Maher Alharby and Aad van Moorsel,Blockchain-based Smart Contracts: A Systematic Mapping Study,"Keywords: Blockchain, Smart contracts, Systematic Mapping Study,
  Survey","Fourth International Conference on Computer Science and
  Information Technology (CSIT-2017)",10.5121/csit.2017.71011,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An appealing feature of blockchain technology is smart contracts. A smart
contract is executable code that runs on top of the blockchain to facilitate,
execute and enforce an agreement between untrusted parties without the
involvement of a trusted third party. In this paper, we conduct a systematic
mapping study to collect all research that is relevant to smart contracts from
a technical perspective. The aim of doing so is to identify current research
topics and open challenges for future studies in smart contract research. We
extract 24 papers from different scientific databases. The results show that
about two thirds of the papers focus on identifying and tackling smart contract
issues. Four key issues are identified, namely, codifying, security, privacy
and performance issues. The rest of the papers focuses on smart contract
applications or other smart contract related topics. Research gaps that need to
be addressed in future studies are provided.
","[{'version': 'v1', 'created': 'Tue, 17 Oct 2017 16:39:23 GMT'}]",2017-10-18,"[['Alharby', 'Maher', ''], ['van Moorsel', 'Aad', '']]","['Blockchain', 'Smart contracts', 'Systematic mapping study', 'Survey']"
7554,2007.01594,Ganqu Cui,"Ganqu Cui, Jie Zhou, Cheng Yang, Zhiyuan Liu",Adaptive Graph Encoder for Attributed Graph Embedding,To appear in KDD 2020,,10.1145/3394486.3403140,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Attributed graph embedding, which learns vector representations from graph
topology and node features, is a challenging task for graph analysis. Recently,
methods based on graph convolutional networks (GCNs) have made great progress
on this task. However,existing GCN-based methods have three major drawbacks.
Firstly,our experiments indicate that the entanglement of graph convolutional
filters and weight matrices will harm both the performance and robustness.
Secondly, we show that graph convolutional filters in these methods reveal to
be special cases of generalized Laplacian smoothing filters, but they do not
preserve optimal low-pass characteristics. Finally, the training objectives of
existing algorithms are usually recovering the adjacency matrix or feature
matrix, which are not always consistent with real-world applications. To
address these issues, we propose Adaptive Graph Encoder (AGE), a novel
attributed graph embedding framework. AGE consists of two modules: (1) To
better alleviate the high-frequency noises in the node features, AGE first
applies a carefully-designed Laplacian smoothing filter. (2) AGE employs an
adaptive encoder that iteratively strengthens the filtered features for better
node embeddings. We conduct experiments using four public benchmark datasets to
validate AGE on node clustering and link prediction tasks. Experimental results
show that AGE consistently outperforms state-of-the-art graph embedding methods
considerably on these tasks.
","[{'version': 'v1', 'created': 'Fri, 3 Jul 2020 10:20:34 GMT'}]",2020-07-06,"[['Cui', 'Ganqu', ''], ['Zhou', 'Jie', ''], ['Yang', 'Cheng', ''], ['Liu', 'Zhiyuan', '']]","['attributed graph embedding', 'graph convolutional networks', 'Laplacian smoothing', 'adaptive learning']"
7555,2210.08338,Alexander Buchholz,"Alexander Buchholz, Vito Bellini, Giuseppe Di Benedetto, Yannik Stein,
  Matteo Ruffini, Fabian Moerchen",Fair Effect Attribution in Parallel Online Experiments,Published as https://dl.acm.org/doi/10.1145/3487553.3524211,WWW '22: Companion Proceedings of the Web Conference 2022,10.1145/3487553.3524211,,cs.LG econ.EM stat.AP stat.CO stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A/B tests serve the purpose of reliably identifying the effect of changes
introduced in online services. It is common for online platforms to run a large
number of simultaneous experiments by splitting incoming user traffic randomly
in treatment and control groups. Despite a perfect randomization between
different groups, simultaneous experiments can interact with each other and
create a negative impact on average population outcomes such as engagement
metrics. These are measured globally and monitored to protect overall user
experience. Therefore, it is crucial to measure these interaction effects and
attribute their overall impact in a fair way to the respective experimenters.
We suggest an approach to measure and disentangle the effect of simultaneous
experiments by providing a cost sharing approach based on Shapley values. We
also provide a counterfactual perspective, that predicts shared impact based on
conditional average treatment effects making use of causal inference
techniques. We illustrate our approach in real world and synthetic data
experiments.
","[{'version': 'v1', 'created': 'Sat, 15 Oct 2022 17:15:51 GMT'}]",2022-10-18,"[['Buchholz', 'Alexander', ''], ['Bellini', 'Vito', ''], ['Di Benedetto', 'Giuseppe', ''], ['Stein', 'Yannik', ''], ['Ruffini', 'Matteo', ''], ['Moerchen', 'Fabian', '']]","['Cost Sharing', 'Causal Inference', 'Online Experiments', 'Shapley Values']"
7556,1805.03574,"Veli M\""akinen","Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov and Veli M\""akinen","Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear
  Time",,In Proc. WABI 2018,10.4230/LIPIcs.WABI.2018.15,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a threshold $L$ and a set $\mathcal{R} = \{R_1, \ldots, R_m\}$ of $m$
haplotype sequences, each having length $n$, the minimum segmentation problem
for founder reconstruction is to partition the sequences into disjoint segments
$\mathcal{R}[i_1{+}1,i_2], \mathcal{R}[i_2{+}1, i_3], \ldots,
\mathcal{R}[i_{r-1}{+}1, i_r]$, where $0 = i_1 < \cdots < i_r = n$ and
$\mathcal{R}[i_{j-1}{+}1, i_j]$ is the set $\{R_1[i_{j-1}{+}1, i_j], \ldots,
R_m[i_{j-1}{+}1, i_j]\}$, such that the length of each segment, $i_j -
i_{j-1}$, is at least $L$ and $K = \max_j\{ |\mathcal{R}[i_{j-1}{+}1, i_j]| \}$
is minimized. The distinct substrings in the segments $\mathcal{R}[i_{j-1}{+}1,
i_j]$ represent founder blocks that can be concatenated to form $K$ founder
sequences representing the original $\mathcal{R}$ such that crossovers happen
only at segment boundaries. We give an optimal $O(mn)$ time algorithm to solve
the problem, improving over earlier $O(mn^2)$. This improvement enables to
exploit the algorithm on a pan-genomic setting of haplotypes being complete
human chromosomes, with a goal of finding a representative set of references
that can be indexed for read alignment and variant calling.
","[{'version': 'v1', 'created': 'Wed, 9 May 2018 15:04:25 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Jan 2019 07:56:43 GMT'}]",2019-01-09,"[['Norri', 'Tuukka', ''], ['Cazaux', 'Bastien', ''], ['Kosolobov', 'Dmitry', ''], ['Mäkinen', 'Veli', '']]","['Pan-genome indexing', 'founder reconstruction', 'positional Burrows–Wheelertransform', 'range minimum query']"
7557,2005.05758,Runbin Shi,"Runbin Shi, Peiyan Dong, Tong Geng, Yuhao Ding, Xiaolong Ma, Hayden
  K.-H. So, Martin Herbordt, Ang Li and Yanzhi Wang","CSB-RNN: A Faster-than-Realtime RNN Acceleration Framework with
  Compressed Structured Blocks",,,10.1145/3392717.3392749,,cs.DC eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recurrent neural networks (RNNs) have been widely adopted in temporal
sequence analysis, where realtime performance is often in demand. However, RNNs
suffer from heavy computational workload as the model often comes with large
weight matrices. Pruning schemes have been proposed for RNNs to eliminate the
redundant (close-to-zero) weight values. On one hand, the non-structured
pruning methods achieve a high pruning rate but introducing computation
irregularity (random sparsity), which is unfriendly to parallel hardware. On
the other hand, hardware-oriented structured pruning suffers from low pruning
rate due to restricted constraints on allowable pruning structure. This paper
presents CSB-RNN, an optimized full-stack RNN framework with a novel compressed
structured block (CSB) pruning technique. The CSB pruned RNN model comes with
both fine pruning granularity that facilitates a high pruning rate and regular
structure that benefits the hardware parallelism. To address the challenges in
parallelizing the CSB pruned model inference with fine-grained structural
sparsity, we propose a novel hardware architecture with a dedicated compiler.
Gaining from the architecture-compilation co-design, the hardware not only
supports various RNN cell types, but is also able to address the challenging
workload imbalance issue and therefore significantly improves the hardware
efficiency.
","[{'version': 'v1', 'created': 'Mon, 11 May 2020 13:13:18 GMT'}]",2020-05-13,"[['Shi', 'Runbin', ''], ['Dong', 'Peiyan', ''], ['Geng', 'Tong', ''], ['Ding', 'Yuhao', ''], ['Ma', 'Xiaolong', ''], ['So', 'Hayden K. -H.', ''], ['Herbordt', 'Martin', ''], ['Li', 'Ang', ''], ['Wang', 'Yanzhi', '']]","['RNN', 'structured pruning', 'workload balancing', 'FPGA']"
7558,cs/0611165,Valmir Barbosa,"Ricardo C. Correa, Valmir C. Barbosa","Partially ordered distributed computations on asynchronous
  point-to-point networks",,"Parallel Computing 35 (2009), 12-28",10.1016/j.parco.2008.09.011,,cs.DC,,"  Asynchronous executions of a distributed algorithm differ from each other due
to the nondeterminism in the order in which the messages exchanged are handled.
In many situations of interest, the asynchronous executions induced by
restricting nondeterminism are more efficient, in an application-specific
sense, than the others. In this work, we define partially ordered executions of
a distributed algorithm as the executions satisfying some restricted orders of
their actions in two different frameworks, those of the so-called event- and
pulse-driven computations. The aim of these restrictions is to characterize
asynchronous executions that are likely to be more efficient for some important
classes of applications. Also, an asynchronous algorithm that ensures the
occurrence of partially ordered executions is given for each case. Two of the
applications that we believe may benefit from the restricted nondeterminism are
backtrack search, in the event-driven case, and iterative algorithms for
systems of linear equations, in the pulse-driven case.
","[{'version': 'v1', 'created': 'Thu, 30 Nov 2006 13:01:36 GMT'}]",2016-11-11,"[['Correa', 'Ricardo C.', ''], ['Barbosa', 'Valmir C.', '']]","['Synchronous distributed algorithms', 'asynchronous distributed algorithms', 'partially syn']"
7559,2104.13593,Kavan Sedighiani,"Kavan Sedighiani, Saeed Shokrollahi, Fereidoon Shams",BASBA: a framework for Building Adaptable Service-Based Applications,,,10.1016/j.jss.2021.110989,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Due to the continuously changing environment of service-based applications
(SBAs), the ability to adapt to environmental and contextual changes has become
a crucial characteristic of such applications. Providing SBAs with this ability
is a complex task, usually prepared in an unsystematic way and interwoven with
application logic. As a result, developing and maintaining adaptive SBAs has
become a costly and hardly repeatable process. The objective of this paper is
to present a model-based approach to developing adaptive SBAs, which separates
development of adaptation concerns from development of SBAs behaviors. This
approach aims to facilitate and automate development of adaptive behaviors. In
this paper, the process of developing an adaptive SBA is defined as specifying
adaptive SBA models based on a metamodel and reusable adaptation tactics. These
models are then transformed into runtime model artifacts and running system
units performing runtime adaptive behaviors. The approach introduces a
systematic method to derive adaptation behaviors from adaptation models, which
facilitates the development of adaptive behaviors. The results show that using
our approach can enhance the development process of adaptive behaviors in terms
of development time and code quality, particularly for scenarios that are more
complex in terms of adaptation rather than business logic.
","[{'version': 'v1', 'created': 'Wed, 28 Apr 2021 06:57:32 GMT'}, {'version': 'v2', 'created': 'Mon, 3 May 2021 12:35:27 GMT'}]",2021-05-04,"[['Sedighiani', 'Kavan', ''], ['Shokrollahi', 'Saeed', ''], ['Shams', 'Fereidoon', '']]","['Service-based application', 'Self-adaptation', 'Models at runtime', 'Quality of service', 'Variability', 'Reusability']"
7560,2109.12411,Isiah Zaplana,Isiah Zaplana and Hugo Hadfield and Joan Lasenby,"Closed-form solutions for the inverse kinematics of serial robots using
  conformal geometric algebra","33 pages, 10 figures",,10.1016/j.mechmachtheory.2022.104835,,cs.RO cs.CG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This work addresses the inverse kinematics of serial robots using conformal
geometric algebra. Classical approaches include either the use of homogeneous
matrices, which entails high computational cost and execution time or the
development of particular geometric strategies that cannot be generalized to
arbitrary serial robots. In this work, we present a compact, elegant and
intuitive formulation of robot kinematics based on conformal geometric algebra
that provides a suitable framework for the closed-form resolution of the
inverse kinematic problem for manipulators with a spherical wrist. For serial
robots of this kind, the inverse kinematics problem can be split in two
subproblems: the position and orientation problems. The latter is solved by
appropriately splitting the rotor that defines the target orientation into
three simpler rotors, while the former is solved by developing a geometric
strategy for each combination of prismatic and revolute joints that forms the
position part of the robot. Finally, the inverse kinematics of 7 DoF redundant
manipulators with a spherical wrist is solved by extending the geometric
solutions obtained in the non-redundant case.
","[{'version': 'v1', 'created': 'Sat, 25 Sep 2021 17:31:07 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Mar 2022 08:29:44 GMT'}]",2022-03-29,"[['Zaplana', 'Isiah', ''], ['Hadfield', 'Hugo', ''], ['Lasenby', 'Joan', '']]","['serial robots', 'redundant robots', 'inverse kinematics', 'geometricalgebra', 'conformal geometric algebra']"
7561,1912.09093,Okyay Altay,"S. Schleiter (1), O. Altay (1) ((1) RWTH Aachen University)","Identification of abrupt stiffness changes of structures with tuned mass
  dampers under sudden events","21 pages, 13 figures. Preprint published in Journal of Structural
  Control and Health Monitoring",Struct Control Health Monit. 2020:e2530,10.1002/stc.2530,,cs.CE cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a recursive system identification method for
multi-degree-of-freedom (MDoF) structures with tuned mass dampers (TMDs)
considering abrupt stiffness changes in case of sudden events, such as
earthquakes. Due to supplementary non-classical damping of the TMDs, the system
identification of MDoF+TMD systems disposes a challenge, in particular, in case
of sudden events. This identification methods may be helpful for structural
health monitoring of MDoF structures controlled by TMDs. A new adaptation
formulation of the unscented Kalman filter allows the identification method to
track abrupt stiffness changes. The paper, firstly, describes the theoretical
background of the proposed system identification method and afterwards presents
three parametric studies regarding the performance of the method. The first
study shows the augmented state identification by the presented system
identification method applied on a MDoF+TMD system. In this study, the abrupt
stiffness changes of the system are successfully detected and localized under
earthquake, impulse and white noise excitations. The second study investigates
the effects of the state covariance and its relevance for the system
identification of MDoF+TMD systems. The results of this study show the
necessity of an adaptive definition of the state covariance as applied in the
proposed method. The third study investigates the effects of modeling on the
performance of the identification method. Mathematical models with
discretization of different orders of convergence and system noise levels are
studied. The results show that, in particular, MDoF+TMD systems require higher
order mathematical models for an accurate identification of abrupt changes.
","[{'version': 'v1', 'created': 'Thu, 19 Dec 2019 09:56:15 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Dec 2019 10:16:12 GMT'}, {'version': 'v3', 'created': 'Mon, 2 Mar 2020 17:08:01 GMT'}]",2020-03-03,"[['Schleiter', 'S.', '', 'RWTH Aachen University'], ['Altay', 'O.', '', 'RWTH Aachen University']]","['system identification', 'stiffness identification', 'abrupt stiffness changes', 'tuned mass dampers', 'Kalman filter', 'adaptive unscented Kalman filter']"
7562,2103.14712,Arijit Ray,"Arijit Ray, Michael Cogswell, Xiao Lin, Kamran Alipour, Ajay
  Divakaran, Yi Yao, Giedrius Burachas","Generating and Evaluating Explanations of Attended and Error-Inducing
  Input Regions for VQA Models","Applied AI Letters, Wiley, 25 October 2021",,10.22541/au.162464902.28050142/v1,,cs.CV cs.AI cs.CY cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Attention maps, a popular heatmap-based explanation method for Visual
Question Answering (VQA), are supposed to help users understand the model by
highlighting portions of the image/question used by the model to infer answers.
However, we see that users are often misled by current attention map
visualizations that point to relevant regions despite the model producing an
incorrect answer. Hence, we propose Error Maps that clarify the error by
highlighting image regions where the model is prone to err. Error maps can
indicate when a correctly attended region may be processed incorrectly leading
to an incorrect answer, and hence, improve users' understanding of those cases.
To evaluate our new explanations, we further introduce a metric that simulates
users' interpretation of explanations to evaluate their potential helpfulness
to understand model correctness. We finally conduct user studies to see that
our new explanations help users understand model correctness better than
baselines by an expected 30\% and that our proxy helpfulness metrics correlate
strongly ($\rho>0.97$) with how well users can predict model correctness.
","[{'version': 'v1', 'created': 'Fri, 26 Mar 2021 19:52:32 GMT'}, {'version': 'v2', 'created': 'Wed, 31 Mar 2021 21:15:40 GMT'}, {'version': 'v3', 'created': 'Mon, 25 Oct 2021 18:58:42 GMT'}]",2021-10-27,"[['Ray', 'Arijit', ''], ['Cogswell', 'Michael', ''], ['Lin', 'Xiao', ''], ['Alipour', 'Kamran', ''], ['Divakaran', 'Ajay', ''], ['Yao', 'Yi', ''], ['Burachas', 'Giedrius', '']]","['VQA', 'Error Maps', 'Attention Maps', 'Explanations', 'Evaluations']"
7563,2203.08877,Lucas Vegi,Lucas Francisco da Matta Vegi and Marco Tulio Valente,Code Smells in Elixir: Early Results from a Grey Literature Review,"Accepted at 30th IEEE/ACM International Conference on Program
  Comprehension (ICPC'22 ERA), 5 pages, 2022",,10.1145/3524610.3527881,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Elixir is a new functional programming language whose popularity is rising in
the industry. However, there are few works in the literature focused on
studying the internal quality of systems implemented in this language.
Particularly, to the best of our knowledge, there is currently no catalog of
code smells for Elixir. Therefore, in this paper, through a grey literature
review, we investigate whether Elixir developers discuss code smells. Our
preliminary results indicate that 11 of the 22 traditional code smells
cataloged by Fowler and Beck are discussed by Elixir developers. We also
propose a list of 18 new smells specific for Elixir systems and investigate
whether these smells are currently identified by Credo, a well-known static
code analysis tool for Elixir. We conclude that only two traditional code
smells and one Elixir-specific code smell are automatically detected by this
tool. Thus, these early results represent an opportunity for extending tools
such as Credo to detect code smells and then contribute to improving the
internal quality of Elixir systems.
","[{'version': 'v1', 'created': 'Wed, 16 Mar 2022 18:44:52 GMT'}]",2022-04-11,"[['Vegi', 'Lucas Francisco da Matta', ''], ['Valente', 'Marco Tulio', '']]","['Code Smells', 'Elixir', 'Functional Programming']"
7564,1707.01848,Wieslaw Kopec,"Wies{\l}aw Kope\'c, Katarzyna Abramczuk, Bart{\l}omiej Balcerzak,
  Marta Ju\'zwin Katarzyna Gniadzik, Grzegorz Kowalik, Rados{\l}aw Nielek","A Location-Based Game for Two Generations: Teaching Mobile Technology to
  the Elderly with the Support of Young Volunteers","The final publication is available at Springer via
  http://dx.doi.org/10.1007/978-3-319-49655-9_12",,10.1007/978-3-319-49655-9_12,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a cooperative location-based game for the elderly with
the use of tablets equipped with mobile application. The game was designed to
tackle at once several crucial topics related to the issue of aging, namely the
social inclusion, education in the field of modern technology, motivation for
learning as well as physical activity. Mixed-aged teams consisting of two
players: a junior and a senior took part in the game. The preliminary results
suggest that the game can successfully address a number of issues including
improving the elderly technical skills, increasing the elderly physical
activity as well as positive intergenerational interaction. The paper describes
the game setup in details and presents some initial data gathered during the
gameplay.
","[{'version': 'v1', 'created': 'Thu, 6 Jul 2017 16:07:00 GMT'}]",2017-07-07,"[['Kopeć', 'Wiesław', ''], ['Abramczuk', 'Katarzyna', ''], ['Balcerzak', 'Bartłomiej', ''], ['Gniadzik', 'Marta Juźwin Katarzyna', ''], ['Kowalik', 'Grzegorz', ''], ['Nielek', 'Radosław', '']]","['location-based games', 'elderly', 'intergenerational cooperation', 'mobile games and applications']"
7565,2103.04234,Salem Alqahtani,Salem Alqahtani and Murat Demirbas,Bottlenecks in Blockchain Consensus Protocols,8 pages,,10.1109/COINS51742.2021.9524210,,cs.DC cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Most of the Blockchain permissioned systems employ Byzantine fault-tolerance
(BFT) consensus protocols to ensure that honest validators agree on the order
for appending entries to their ledgers. In this paper, we study the performance
and the scalability of prominent consensus protocols, namely PBFT, Tendermint,
HotStuff, and Streamlet, both analytically via load formulas and practically
via implementation and evaluation. Under identical conditions, we identify the
bottlenecks of these consensus protocols and show that these protocols do not
scale well as the number of validators increases. Our investigation points to
the communication complexity as the culprit. Even when there is enough network
bandwidth, the CPU cost of serialization and deserialization of the messages
limits the throughput and increases the latency of the protocols. To alleviate
the bottlenecks, the most useful techniques include reducing the communication
complexity, rotating the hotspot of communications, and pipelining across
consensus instances.
","[{'version': 'v1', 'created': 'Sun, 7 Mar 2021 02:17:58 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Mar 2021 17:53:19 GMT'}, {'version': 'v3', 'created': 'Sat, 17 Jul 2021 00:02:23 GMT'}, {'version': 'v4', 'created': 'Tue, 12 Oct 2021 01:32:12 GMT'}]",2021-10-13,"[['Alqahtani', 'Salem', ''], ['Demirbas', 'Murat', '']]","['Consensus', 'PBFT', 'Tendermint', 'HotStuff', 'Streamlet', 'Byzantine fault-tolerance (BFT)']"
7566,1910.05085,Viswanath Sivakumar,"Fedor Borisyuk, Albert Gordo, Viswanath Sivakumar",Rosetta: Large scale system for text detection and recognition in images,"Proceedings of the 24th ACM SIGKDD International Conference on
  Knowledge Discovery & Data Mining (KDD) 2018, London, United Kingdom",,10.1145/3219819.3219861,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a deployed, scalable optical character recognition
(OCR) system, which we call Rosetta, designed to process images uploaded daily
at Facebook scale. Sharing of image content has become one of the primary ways
to communicate information among internet users within social networks such as
Facebook and Instagram, and the understanding of such media, including its
textual information, is of paramount importance to facilitate search and
recommendation applications. We present modeling techniques for efficient
detection and recognition of text in images and describe Rosetta's system
architecture. We perform extensive evaluation of presented technologies,
explain useful practical approaches to build an OCR system at scale, and
provide insightful intuitions as to why and how certain components work based
on the lessons learnt during the development and deployment of the system.
","[{'version': 'v1', 'created': 'Fri, 11 Oct 2019 11:24:45 GMT'}]",2019-10-14,"[['Borisyuk', 'Fedor', ''], ['Gordo', 'Albert', ''], ['Sivakumar', 'Viswanath', '']]","['Optical character recognition', 'text detection', 'text recognition']"
7567,2110.11241,Panagiotis Papadopoulos,"George Pantelakis, Panagiotis Papadopoulos, Nicolas Kourtellis,
  Evangelos P. Markatos","Measuring the (Over)use of Service Workers for In-Page Push Advertising
  Purposes","13 pages, PAM'22","International Conference on Passive and Active Network Measurement
  2022",10.1007/978-3-030-98785-5_19,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rich offline experience, periodic background sync, push notification
functionality, network requests control, improved performance via requests
caching are only a few of the functionalities provided by the Service Worker
(SW) API. This new technology, supported by all major browsers, can
significantly improve users' experience by providing the publisher with the
technical foundations that would normally require a native application. Albeit
the capabilities of this new technique and its important role in the ecosystem
of Progressive Web Apps (PWAs), it is still unclear what is their actual
purpose on the web, and how publishers leverage the provided functionality in
their web applications. In this study, we shed light in the real world
deployment of SWs, by conducting the first large scale analysis of the
prevalence of SWs in the wild. We see that SWs are becoming more and more
popular, with the adoption increased by 26% only within the last 5 months.
Surprisingly, besides their fruitful capabilities, we see that SWs are being
mostly used for In-Page Push Advertising, in 65.08% of the SWs that connect
with 3rd parties. We highlight that this is a relatively new way for
advertisers to bypass ad-blockers and render ads on the user's displays
natively.
","[{'version': 'v1', 'created': 'Thu, 21 Oct 2021 16:14:21 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Mar 2022 16:26:22 GMT'}]",2022-03-30,"[['Pantelakis', 'George', ''], ['Papadopoulos', 'Panagiotis', ''], ['Kourtellis', 'Nicolas', ''], ['Markatos', 'Evangelos P.', '']]","['Service Workers', 'Push Ads', 'Push Notification Advertising']"
7568,2201.11479,Koteswar Rao Jerripothula,"Sharik Ali Ansari, Koteswar Rao Jerripothula, Pragya Nagpal, Ankush
  Mittal",Eye-focused Detection of Bell's Palsy in Videos,"Published in the Proceedings of the 34th Canadian Conference on
  Artificial Intelligence. Please cite this paper in the following manner: S.
  A. Ansari, K. R. Jerripothula, P. Nagpal, and A. Mittal. ""Eye-focused
  Detection of Bell's Palsy in Videos"". In: Proceedings of the 34th Canadian
  Conference on Artificial Intelligence (June 8, 2021). doi:
  10.21428/594757db.d2f8342b",,10.21428/594757db.d2f8342b,,cs.CV cs.AI cs.MM eess.IV,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we present how Bell's Palsy, a neurological disorder, can be
detected just from a subject's eyes in a video. We notice that Bell's Palsy
patients often struggle to blink their eyes on the affected side. As a result,
we can observe a clear contrast between the blinking patterns of the two eyes.
Although previous works did utilize images/videos to detect this disorder, none
have explicitly focused on the eyes. Most of them require the entire face. One
obvious advantage of having an eye-focused detection system is that subjects'
anonymity is not at risk. Also, our AI decisions based on simple blinking
patterns make them explainable and straightforward. Specifically, we develop a
novel feature called blink similarity, which measures the similarity between
the two blinking patterns. Our extensive experiments demonstrate that the
proposed feature is quite robust, for it helps in Bell's Palsy detection even
with very few labels. Our proposed eye-focused detection system is not only
cheaper but also more convenient than several existing methods.
","[{'version': 'v1', 'created': 'Thu, 27 Jan 2022 12:34:35 GMT'}]",2022-02-17,"[['Ansari', 'Sharik Ali', ''], ['Jerripothula', 'Koteswar Rao', ''], ['Nagpal', 'Pragya', ''], ['Mittal', 'Ankush', '']]","['Bell’s Palsy', 'feature extraction', 'neurological disorder', 'healthcare']"
7569,1707.09585,Avi Ben-Cohen,"Avi Ben-Cohen, Eyal Klang, Stephen P. Raskin, Michal Marianne Amitai,
  and Hayit Greenspan","Virtual PET Images from CT Data Using Deep Convolutional Networks:
  Initial Results","To be presented at SASHIMI2017: Simulation and Synthesis in Medical
  Imaging, MICCAI 2017",,10.1007/978-3-319-68127-6_6,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we present a novel system for PET estimation using CT scans. We
explore the use of fully convolutional networks (FCN) and conditional
generative adversarial networks (GAN) to export PET data from CT data. Our
dataset includes 25 pairs of PET and CT scans where 17 were used for training
and 8 for testing. The system was tested for detection of malignant tumors in
the liver region. Initial results look promising showing high detection
performance with a TPR of 92.3% and FPR of 0.25 per case. Future work entails
expansion of the current system to the entire body using a much larger dataset.
Such a system can be used for tumor detection and drug treatment evaluation in
a CT-only environment instead of the expansive and radioactive PET-CT scan.
","[{'version': 'v1', 'created': 'Sun, 30 Jul 2017 06:43:42 GMT'}]",2018-07-24,"[['Ben-Cohen', 'Avi', ''], ['Klang', 'Eyal', ''], ['Raskin', 'Stephen P.', ''], ['Amitai', 'Michal Marianne', ''], ['Greenspan', 'Hayit', '']]","['Deep learning', 'CT', 'PET', 'image to image']"
7570,1802.00606,Lutz Bornmann Dr.,"Lutz Bornmann, Robin Haunschild",Allegation of scientific misconduct increases Twitter attention,,"Scientometrics, 115(2), 1097-1100 (2018)",10.1007/s11192-018-2698-6,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The web-based microblogging system Twitter is a very popular altmetrics
source for measuring the broader impact of science. In this case study, we
demonstrate how problematic the use of Twitter data for research evaluation can
be, even though the aspiration of measurement is degraded from impact to
attention measurement. We collected the Twitter data for the paper published by
Yamamizu et al. (2017). An investigative committee found that the main figures
in the paper are fraudulent.
","[{'version': 'v1', 'created': 'Fri, 2 Feb 2018 09:01:09 GMT'}]",2019-04-16,"[['Bornmann', 'Lutz', ''], ['Haunschild', 'Robin', '']]","['Twitter', 'altmetrics', 'scientific misconduct']"
7571,2005.12138,Paul Ryan Mr,"Paul Ryan, Martin Crane and Rob Brennan",Design Challenges for GDPR RegTech,,"Proceedings of the 22nd International Conference on Enterprise
  Information Systems - (Volume 2) May 5-7, 2020",10.5220/0009464507870795,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Accountability Principle of the GDPR requires that an organisation can
demonstrate compliance with the regulations. A survey of GDPR compliance
software solutions shows significant gaps in their ability to demonstrate
compliance. In contrast, RegTech has recently brought great success to
financial compliance, resulting in reduced risk, cost saving and enhanced
financial regulatory compliance. It is shown that many GDPR solutions lack
interoperability features such as standard APIs, meta-data or reports and they
are not supported by published methodologies or evidence to support their
validity or even utility. A proof of concept prototype was explored using a
regulator based self-assessment checklist to establish if RegTech best practice
could improve the demonstration of GDPR compliance. The application of a
RegTech approach provides opportunities for demonstrable and validated GDPR
compliance, notwithstanding the risk reductions and cost savings that RegTech
can deliver. This paper demonstrates a RegTech approach to GDPR compliance can
facilitate an organisation meeting its accountability obligations.
","[{'version': 'v1', 'created': 'Thu, 21 May 2020 18:55:11 GMT'}]",2020-05-26,"[['Ryan', 'Paul', ''], ['Crane', 'Martin', ''], ['Brennan', 'Rob', '']]","['GDPR', 'Compliance', 'Accountability', 'Data Protection Officer', 'RegTech']"
7572,2001.05921,Marc Hellmuth,"Marc Hellmuth, Carsten R. Seemann and Peter F. Stadler","Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of
  Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees",,"Discrete Mathematics & Theoretical Computer Science, vol. 23 no.
  1, Graph Theory (June 3, 2021) dmtcs:7493",10.46298/dmtcs.6040,,cs.DM cs.CC cs.DS math.CO,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Binary relations derived from labeled rooted trees play an import role in
mathematical biology as formal models of evolutionary relationships. The
(symmetrized) Fitch relation formalizes xenology as the pairs of genes
separated by at least one horizontal transfer event. As a natural
generalization, we consider symmetrized Fitch maps, that is, symmetric maps
$\varepsilon$ that assign a subset of colors to each pair of vertices in $X$
and that can be explained by a tree $T$ with edges that are labeled with
subsets of colors in the sense that the color $m$ appears in $\varepsilon(x,y)$
if and only if $m$ appears in a label along the unique path between $x$ and $y$
in $T$. We first give an alternative characterization of the monochromatic case
and then give a characterization of symmetrized Fitch maps in terms of
compatibility of a certain set of quartets. We show that recognition of
symmetrized Fitch maps is NP-complete. In the restricted case where
$|\varepsilon(x,y)|\leq 1$ the problem becomes polynomial, since such maps
coincide with class of monochromatic Fitch maps whose graph-representations
form precisely the class of complete multi-partite graphs.
","[{'version': 'v1', 'created': 'Thu, 16 Jan 2020 16:14:36 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Jan 2021 08:51:04 GMT'}, {'version': 'v3', 'created': 'Tue, 18 May 2021 11:13:11 GMT'}]",2021-10-04,"[['Hellmuth', 'Marc', ''], ['Seemann', 'Carsten R.', ''], ['Stadler', 'Peter F.', '']]","['Labeled Trees', 'Fitch Relations', 'Symmetrized Maps', 'Splits and Quartets', 'Recognition Algorithm', 'NPcompleteness', 'Phylogenetics']"
7573,1306.5796,Daniela Maftuleac,Daniela Maftuleac,"Algorithms for distance problems in planar complexes of global
  nonpositive curvature",,,10.1142/S0218195914500010,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CAT(0) metric spaces and hyperbolic spaces play an important role in
combinatorial and geometric group theory. In this paper, we present efficient
algorithms for distance problems in CAT(0) planar complexes. First of all, we
present an algorithm for answering single-point distance queries in a CAT(0)
planar complex. Namely, we show that for a CAT(0) planar complex K with n
vertices, one can construct in O(n^2 log n) time a data structure D of size
O(n^2) so that, given a point x in K, the shortest path gamma(x,y) between x
and the query point y can be computed in linear time. Our second algorithm
computes the convex hull of a finite set of points in a CAT(0) planar complex.
This algorithm is based on Toussaint's algorithm for computing the convex hull
of a finite set of points in a simple polygon and it constructs the convex hull
of a set of k points in O(n^2 log n + nk log k) time, using a data structure of
size O(n^2 + k).
","[{'version': 'v1', 'created': 'Mon, 24 Jun 2013 22:24:04 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Oct 2014 18:19:47 GMT'}]",2014-10-09,"[['Maftuleac', 'Daniela', '']]","['Shortest path', 'convex hull', 'planar complex', 'geodesic', 'l2-distance', 'global nonpositive curvature']"
7574,2108.04640,Lesandro Ponciano,"Henrique Ramos, Mateus Fonseca, Lesandro Ponciano","Modeling and Evaluating Personas with Software Explainability
  Requirements","15 pages, VII Iberoamerican Conference on Human Computer Interaction","Human-Computer Interaction. HCI-COLLAB 2021. Communications in
  Computer and Information Science,",10.1007/978-3-030-92325-9_11,,cs.HC cs.CY cs.SE,http://creativecommons.org/licenses/by/4.0/,"  This work focuses on the context of software explainability, which is the
production of software capable of explaining to users the dynamics that govern
its internal functioning. User models that include information about their
requirements and their perceptions of explainability are fundamental when
building software with such capability. This study investigates the process of
creating personas that include information about users' explainability
perceptions and needs. The proposed approach is based on data collection with
questionnaires, modeling of empathy maps, grouping the maps, generating
personas from them and evaluation employing the Persona Perception Scale
method. In an empirical study, personas are created from 61 users' response
data to a questionnaire. The generated personas are evaluated by 60 users and
38 designers considering attributes of the Persona Perception Scale method. The
results include a set of 5 distinct personas that users rate as representative
of them at an average level of 3.7 out of 5, and designers rate as having
quality 3.5 out of 5. The median rate is 4 out of 5 in the majority of criteria
judged by users and designers. Both the personas and their creation and
evaluation approach are contributions of this study to the design of software
that satisfies the explainability requirement.
","[{'version': 'v1', 'created': 'Tue, 10 Aug 2021 12:43:18 GMT'}]",2021-12-06,"[['Ramos', 'Henrique', ''], ['Fonseca', 'Mateus', ''], ['Ponciano', 'Lesandro', '']]","['User modeling', 'Persona', 'Explainability requirement']"
7575,2110.04660,Ahmad Kalhor,"Seyed Omid Mohammadi, Ahmad Kalhor, Hossein Bodaghi (University of
  Tehran, College of Engineering, School of Electrical and Computer
  Engineering, Tehran, Iran)","K-Splits: Improved K-Means Clustering Algorithm to Automatically Detect
  the Number of Clusters","16 pages, 6 figures","Computer Networks, Big Data and IoT. Lecture Notes on Data
  Engineering and Communications Technologies, vol 117, 2022, Springer,
  Singapore",10.1007/978-981-19-0898-9_15,,cs.CV cs.AI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces k-splits, an improved hierarchical algorithm based on
k-means to cluster data without prior knowledge of the number of clusters.
K-splits starts from a small number of clusters and uses the most significant
data distribution axis to split these clusters incrementally into better fits
if needed. Accuracy and speed are two main advantages of the proposed method.
We experiment on six synthetic benchmark datasets plus two real-world datasets
MNIST and Fashion-MNIST, to prove that our algorithm has excellent accuracy in
finding the correct number of clusters under different conditions. We also show
that k-splits is faster than similar methods and can even be faster than the
standard k-means in lower dimensions. Finally, we suggest using k-splits to
uncover the exact position of centroids and then input them as initial points
to the k-means algorithm to fine-tune the results.
","[{'version': 'v1', 'created': 'Sat, 9 Oct 2021 23:02:57 GMT'}, {'version': 'v2', 'created': 'Tue, 24 May 2022 05:40:04 GMT'}]",2022-05-25,"[['Mohammadi', 'Seyed Omid', '', 'University of\n  Tehran, College of Engineering, School of Electrical and Computer\n  Engineering, Tehran, Iran'], ['Kalhor', 'Ahmad', '', 'University of\n  Tehran, College of Engineering, School of Electrical and Computer\n  Engineering, Tehran, Iran'], ['Bodaghi', 'Hossein', '', 'University of\n  Tehran, College of Engineering, School of Electrical and Computer\n  Engineering, Tehran, Iran']]","['Data Clustering', 'Initialization', 'K-means Algorithm', 'Number of Clusters']"
7576,2004.05478,Simon Hegelich,"Juan Carlos Medina Serrano, Orestis Papakyriakopoulos, Simon Hegelich","Dancing to the Partisan Beat: A First Analysis of Political
  Communication on TikTok","Accepted as a full paper at the 12th International ACM Web Science
  Conference (WebSci 2020). Please cite the WebSci version; Second version
  includes corrected typos",,10.1145/3394231.3397916,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  TikTok is a video-sharing social networking service, whose popularity is
increasing rapidly. It was the world's second-most downloaded app in 2019.
Although the platform is known for having users posting videos of themselves
dancing, lip-syncing, or showcasing other talents, user-videos expressing
political views have seen a recent spurt. This study aims to perform a primary
evaluation of political communication on TikTok. We collect a set of US
partisan Republican and Democratic videos to investigate how users communicated
with each other about political issues. With the help of computer vision,
natural language processing, and statistical tools, we illustrate that
political communication on TikTok is much more interactive in comparison to
other social media platforms, with users combining multiple information
channels to spread their messages. We show that political communication takes
place in the form of communication trees since users generate branches of
responses to existing content. In terms of user demographics, we find that
users belonging to both the US parties are young and behave similarly on the
platform. However, Republican users generated more political content and their
videos received more responses; on the other hand, Democratic users engaged
significantly more in cross-partisan discussions.
","[{'version': 'v1', 'created': 'Sat, 11 Apr 2020 20:13:08 GMT'}, {'version': 'v2', 'created': 'Mon, 11 May 2020 09:43:47 GMT'}]",2020-05-12,"[['Serrano', 'Juan Carlos Medina', ''], ['Papakyriakopoulos', 'Orestis', ''], ['Hegelich', 'Simon', '']]","['TikTok', 'political communication', 'social media', 'US politics']"
7577,1909.08665,Oliver Rhodes Dr,"Oliver Rhodes, Luca Peres, Andrew G. D. Rowley, Andrew Gait, Luis A.
  Plana, Christian Brenninkmeijer, and Steve B. Furber",Real-Time Cortical Simulation on Neuromorphic Hardware,Paper submitted to Royal Society Philosophical Transactions A,,10.1098/rsta.2019.0160,,cs.ET q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real-time simulation of a large-scale biologically representative spiking
neural network is presented, through the use of a heterogeneous parallelisation
scheme and SpiNNaker neuromorphic hardware. A published cortical microcircuit
model is used as a benchmark test case, representing approx. 1 square mm of
early sensory cortex, containing 77k neurons and 0.3 billion synapses. This is
the first true real-time simulation of this model, with 10 s of biological
simulation time executed in 10 s wall-clock time. This surpasses best published
efforts on HPC neural simulators (3x slowdown) and GPUs running optimised SNN
libraries (2x slowdown). Furthermore, the presented approach indicates that
real-time processing can be maintained with increasing SNN size, breaking the
communication barrier incurred by traditional computing machinery. Model
results are compared to an established HPC simulator baseline to verify
simulation correctness, comparing well across a range of statistical measures.
Energy to solution, and energy per synaptic event are also reported,
demonstrating that the relatively low-tech SpiNNaker processors achieve a 10x
reduction in energy relative to modern HPC systems, and comparable energy
consumption to modern GPUs. Finally, system robustness is demonstrated through
multiple 12 h simulations of the cortical microcircuit, each simulating 12 h of
biological time, and demonstrating the potential of neuromorphic hardware as a
neuroscience research tool for studying complex spiking neural networks over
extended time periods.
","[{'version': 'v1', 'created': 'Wed, 18 Sep 2019 19:17:00 GMT'}]",2021-04-28,"[['Rhodes', 'Oliver', ''], ['Peres', 'Luca', ''], ['Rowley', 'Andrew G. D.', ''], ['Gait', 'Andrew', ''], ['Plana', 'Luis A.', ''], ['Brenninkmeijer', 'Christian', ''], ['Furber', 'Steve B.', '']]","['Neuromorphic', 'SpiNNaker', 'Cortical']"
7578,2204.11243,Mirko Marras,"Mirko Marras, Ludovico Boratto, Guilherme Ramos, Gianni Fenu",Regulating Group Exposure for Item Providers in Recommendation,"Accepted at the 45th International ACM SIGIR Conference on Research
  and Development in Information Retrieval (ACM SIGIR 2022)",,10.1145/3477495.3531760,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Engaging all content providers, including newcomers or minority demographic
groups, is crucial for online platforms to keep growing and working. Hence,
while building recommendation services, the interests of those providers should
be valued. In this paper, we consider providers as grouped based on a common
characteristic in settings in which certain provider groups have low
representation of items in the catalog and, thus, in the user interactions.
Then, we envision a scenario wherein platform owners seek to control the degree
of exposure to such groups in the recommendation process. To support this
scenario, we rely on disparate exposure measures that characterize the gap
between the share of recommendations given to groups and the target level of
exposure pursued by the platform owners. We then propose a re-ranking procedure
that ensures desired levels of exposure are met. Experiments show that, while
supporting certain groups of providers by rendering them with the target
exposure, beyond-accuracy objectives experience significant gains with
negligible impact in recommendation utility.
","[{'version': 'v1', 'created': 'Sun, 24 Apr 2022 10:57:45 GMT'}]",2022-04-26,"[['Marras', 'Mirko', ''], ['Boratto', 'Ludovico', ''], ['Ramos', 'Guilherme', ''], ['Fenu', 'Gianni', '']]","['Recommender Systems', 'Collaborative Filtering', 'Fairness', 'Ranking']"
7579,2010.01895,Hamid Sarmadi,"Hamid Sarmadi, Rafael Mu\~noz-Salinas, M. \'Alvaro Berb\'is, Antonio
  Luna, R. Medina-Carnicer","Joint Scene and Object Tracking for Cost-Effective Augmented Reality
  Assisted Patient Positioning in Radiation Therapy","16 pages, 7 figures",,10.1016/j.cmpb.2021.106296,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  BACKGROUND AND OBJECTIVE: The research done in the field of Augmented Reality
(AR) for patient positioning in radiation therapy is scarce. We propose an
efficient and cost-effective algorithm for tracking the scene and the patient
to interactively assist the patient's positioning process by providing visual
feedback to the operator. Up to our knowledge, this is the first framework that
can be employed for mobile interactive AR to guide patient positioning.
METHODS: We propose a point cloud processing method that combined with a
fiducial marker-mapper algorithm and the generalized ICP algorithm tracks the
patient and the camera precisely and efficiently only using the CPU unit. The
alignment between the 3D reference model and body marker map is calculated
employing an efficient body reconstruction algorithm. RESULTS: Our quantitative
evaluation shows that the proposed method achieves a translational and
rotational error of 4.17 mm/0.82 deg at 9 fps. Furthermore, the qualitative
results demonstrate the usefulness of our algorithm in patient positioning on
different human subjects. CONCLUSION: Since our algorithm achieves a relatively
high frame rate and accuracy employing a regular laptop (without the usage of a
dedicated GPU), it is a very cost-effective AR-based patient positioning
method. It also opens the way for other researchers by introducing a framework
that could be improved upon for better mobile interactive AR patient
positioning solutions in the future.
","[{'version': 'v1', 'created': 'Mon, 5 Oct 2020 10:20:46 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Jan 2021 07:40:18 GMT'}]",2021-08-02,"[['Sarmadi', 'Hamid', ''], ['Muñoz-Salinas', 'Rafael', ''], ['Berbís', 'M. Álvaro', ''], ['Luna', 'Antonio', ''], ['Medina-Carnicer', 'R.', '']]","['Patient Positioning', 'Augmented Reality', 'ArUco Markers', 'Generalized ICP', 'Marker Mapper', 'SurfaceGuided Radiation Therapy (SGRT)']"
7580,2105.14355,Jhacson Meza,"Jhacson Meza, Sonia H. Contreras-Ortiz, Lenny A. Romero, Andres G.
  Marrugo","Three-dimensional multimodal medical imaging system based on free-hand
  ultrasound and structured light",,"Optical Engineering 60(5), 054106 (2021)",10.1117/1.OE.60.5.054106,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a three-dimensional (3D) multimodal medical imaging system that
combines freehand ultrasound and structured light 3D reconstruction in a single
coordinate system without requiring registration. To the best of our knowledge,
these techniques have not been combined before as a multimodal imaging
technique. The system complements the internal 3D information acquired with
ultrasound, with the external surface measured with the structure light
technique. Moreover, the ultrasound probe's optical tracking for pose
estimation was implemented based on a convolutional neural network.
Experimental results show the system's high accuracy and reproducibility, as
well as its potential for preoperative and intraoperative applications. The
experimental multimodal error, or the distance from two surfaces obtained with
different modalities, was 0.12 mm. The code is available as a Github
repository.
","[{'version': 'v1', 'created': 'Sat, 29 May 2021 18:50:00 GMT'}]",2021-06-01,"[['Meza', 'Jhacson', ''], ['Contreras-Ortiz', 'Sonia H.', ''], ['Romero', 'Lenny A.', ''], ['Marrugo', 'Andres G.', '']]","['Ultrasound', 'structured-light', 'three-dimension', 'multimodal medical imaging']"
7581,2007.04816,Tapajit Dey,"Tapajit Dey, Audris Mockus","Effect of Technical and Social Factors on Pull Request Quality for the
  NPM Ecosystem","arXiv admin note: text overlap with arXiv:2003.01153. Preprint of the
  paper accepted in ESEM,2020 conference",,10.1145/3382494.3410685,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pull request (PR) based development, which is a norm for the social coding
platforms, entails the challenge of evaluating the contributions of, often
unfamiliar, developers from across the open source ecosystem and, conversely,
submitting a contribution to a project with unfamiliar maintainers. Previous
studies suggest that the decision of accepting or rejecting a PR may be
influenced by a diverging set of technical and social factors, but often focus
on relatively few projects, do not consider ecosystem-wide measures, or the
possible non-monotonic relationships between the predictors and PR acceptance
probability. We aim to shed light on this important decision making process by
testing which measures significantly affect the probability of PR acceptance on
a significant fraction of a large ecosystem, rank them by their relative
importance in predicting PR acceptance, and determine the shape of the
functions that map each predictor to PR acceptance. We proposed seven
hypotheses regarding which technical and social factors might affect PR
acceptance and created 17 measures based on them. Our dataset consisted of
470,925 PRs from 3349 popular NPM packages and 79,128 GitHub users who created
those. We tested which of the measures affect PR acceptance and ranked the
significant measures by their importance in a predictive model. Our predictive
model had and AUC of 0.94, and 15 of the 17 measures were found to matter,
including five novel ecosystem-wide measures. Measures describing the number of
PRs submitted to a repository and what fraction of those get accepted, and
signals about the PR review phase were most significant. We also discovered
that only four predictors have a linear influence on the PR acceptance
probability while others showed a more complicated response.
","[{'version': 'v1', 'created': 'Wed, 8 Jul 2020 16:50:54 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Jul 2020 17:27:55 GMT'}]",2020-07-21,"[['Dey', 'Tapajit', ''], ['Mockus', 'Audris', '']]","['Pull Request', 'NPM Packages', 'Predictive Model', 'Social Factors']"
7582,2109.11435,Stephen MacDonell,"Marco Kuhrmann, Paolo Tell, Regina Hebig, Jil Kl\""under, J\""urgen
  M\""unch, Oliver Linssen, Dietmar Pfahl, Michael Felderer, Christian R.
  Prause, Stephen G. MacDonell, Joyce Nakatumba-Nabende, David Raffo, Sarah
  Beecham, Eray T\""uz\""un, Gustavo L\'opez, Nicolas Paez, Diego Fontdevila,
  Sherlock A. Licorish, Steffen K\""upper, G\""unther Ruhe, Eric Knauss, \""Ozden
  \""Ozcan-Top, Paul Clarke, Fergal McCaffery, Marcela Genero, Aurora Vizcaino,
  Mario Piattini, Marcos Kalinowski, Tayana Conte, Rafael Prikladnicki, Stephan
  Krusche, Ahmet Co\c{s}kun\c{c}ay, Ezequiel Scott, Fabio Calefato, Svetlana
  Pimonova, Rolf-Helge Pfeiffer, Ulrik Pagh Schultz, Rogardt Heldal, Masud
  Fazal-Baqaie, Craig Anslow, Maleknaz Nayebi, Kurt Schneider, Stefan Sauer,
  Dietmar Winkler, Stefan Biffl, Maria Cecilia Bastarrica, and Ita Richardson",What Makes Agile Software Development Agile?,"Journal paper, 17 pages, 14 figures","IEEE Transactions on Software Engineering (2021), pp.TBC",10.1109/TSE.2021.3099532.,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Together with many success stories, promises such as the increase in
production speed and the improvement in stakeholders' collaboration have
contributed to making agile a transformation in the software industry in which
many companies want to take part. However, driven either by a natural and
expected evolution or by contextual factors that challenge the adoption of
agile methods as prescribed by their creator(s), software processes in practice
mutate into hybrids over time. Are these still agile? In this article, we
investigate the question: what makes a software development method agile? We
present an empirical study grounded in a large-scale international survey that
aims to identify software development methods and practices that improve or
tame agility. Based on 556 data points, we analyze the perceived degree of
agility in the implementation of standard project disciplines and its relation
to used development methods and practices. Our findings suggest that only a
small number of participants operate their projects in a purely traditional or
agile manner (under 15%). That said, most project disciplines and most
practices show a clear trend towards increasing degrees of agility. Compared to
the methods used to develop software, the selection of practices has a stronger
effect on the degree of agility of a given discipline. Finally, there are no
methods or practices that explicitly guarantee or prevent agility. We conclude
that agility cannot be defined solely at the process level. Additional factors
need to be taken into account when trying to implement or improve agility in a
software company. Finally, we discuss the field of software process-related
research in the light of our findings and present a roadmap for future
research.
","[{'version': 'v1', 'created': 'Thu, 23 Sep 2021 15:19:17 GMT'}]",2021-09-24,"[['Kuhrmann', 'Marco', ''], ['Tell', 'Paolo', ''], ['Hebig', 'Regina', ''], ['Klünder', 'Jil', ''], ['Münch', 'Jürgen', ''], ['Linssen', 'Oliver', ''], ['Pfahl', 'Dietmar', ''], ['Felderer', 'Michael', ''], ['Prause', 'Christian R.', ''], ['MacDonell', 'Stephen G.', ''], ['Nakatumba-Nabende', 'Joyce', ''], ['Raffo', 'David', ''], ['Beecham', 'Sarah', ''], ['Tüzün', 'Eray', ''], ['López', 'Gustavo', ''], ['Paez', 'Nicolas', ''], ['Fontdevila', 'Diego', ''], ['Licorish', 'Sherlock A.', ''], ['Küpper', 'Steffen', ''], ['Ruhe', 'Günther', ''], ['Knauss', 'Eric', ''], ['Özcan-Top', 'Özden', ''], ['Clarke', 'Paul', ''], ['McCaffery', 'Fergal', ''], ['Genero', 'Marcela', ''], ['Vizcaino', 'Aurora', ''], ['Piattini', 'Mario', ''], ['Kalinowski', 'Marcos', ''], ['Conte', 'Tayana', ''], ['Prikladnicki', 'Rafael', ''], ['Krusche', 'Stephan', ''], ['Coşkunçay', 'Ahmet', ''], ['Scott', 'Ezequiel', ''], ['Calefato', 'Fabio', ''], ['Pimonova', 'Svetlana', ''], ['Pfeiffer', 'Rolf-Helge', ''], ['Schultz', 'Ulrik Pagh', ''], ['Heldal', 'Rogardt', ''], ['Fazal-Baqaie', 'Masud', ''], ['Anslow', 'Craig', ''], ['Nayebi', 'Maleknaz', ''], ['Schneider', 'Kurt', ''], ['Sauer', 'Stefan', ''], ['Winkler', 'Dietmar', ''], ['Biffl', 'Stefan', ''], ['Bastarrica', 'Maria Cecilia', ''], ['Richardson', 'Ita', '']]","['Agile Software Development', 'Hybrid Development Methods', 'Survey Research', 'Software Development', 'Software Process']"
7583,2210.00733,Ashwini B P,"B. P. Ashwini, R. Sumathi, H. S. Sudhira","A Dynamic Model for Bus Arrival Time Estimation based on Spatial
  Patterns using Machine Learning",,,10.14445/22315381/IJETT-V70I9P219,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The notion of smart cities is being adapted globally to provide a better
quality of living. A smart city's smart mobility component focuses on providing
smooth and safe commuting for its residents and promotes eco-friendly and
sustainable alternatives such as public transit (bus). Among several smart
applications, a system that provides up-to-the-minute information like bus
arrival, travel duration, schedule, etc., improves the reliability of public
transit services. Still, this application needs live information on traffic
flow, accidents, events, and the location of the buses. Most cities lack the
infrastructure to provide these data. In this context, a bus arrival prediction
model is proposed for forecasting the arrival time using limited data sets. The
location data of public transit buses and spatial characteristics are used for
the study. One of the routes of Tumakuru city service, Tumakuru, India, is
selected and divided into two spatial patterns: sections with intersections and
sections without intersections. The machine learning model XGBoost is modeled
for both spatial patterns individually. A model to dynamically predict bus
arrival time is developed using the preceding trip information and the machine
learning model to estimate the arrival time at a downstream bus stop. The
performance of models is compared based on the R-squared values of the
predictions made, and the proposed model established superior results. It is
suggested to predict bus arrival in the study area. The proposed model can also
be extended to other similar cities with limited traffic-related
infrastructure.
","[{'version': 'v1', 'created': 'Mon, 3 Oct 2022 06:35:03 GMT'}]",2022-10-04,"[['Ashwini', 'B. P.', ''], ['Sumathi', 'R.', ''], ['Sudhira', 'H. S.', '']]","['Bus Arrival Time', 'Intelligent Transportation System', 'Machine Learning', 'Public Transit', 'Smart Cities']"
7584,2012.08868,Md. Hishamur Rahman,M. H. Rahman and S. M. Rifaat,"Using Spatio-temporal Deep Learning for Forecasting Demand and
  Supply-demand Gap in Ride-hailing System with Anonymised Spatial Adjacency
  Information",arXiv admin note: text overlap with arXiv:2012.15408,IET Intelligent Transport Systems (2021),10.1049/itr2.12073,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  To reduce passenger waiting time and driver search friction, ride-hailing
companies need to accurately forecast spatio-temporal demand and supply-demand
gap. However, due to spatio-temporal dependencies pertaining to demand and
supply-demand gap in a ride-hailing system, making accurate forecasts for both
demand and supply-demand gap is a difficult task. Furthermore, due to
confidentiality and privacy issues, ride-hailing data are sometimes released to
the researchers by removing spatial adjacency information of the zones, which
hinders the detection of spatio-temporal dependencies. To that end, a novel
spatio-temporal deep learning architecture is proposed in this paper for
forecasting demand and supply-demand gap in a ride-hailing system with
anonymized spatial adjacency information, which integrates feature importance
layer with a spatio-temporal deep learning architecture containing
one-dimensional convolutional neural network (CNN) and zone-distributed
independently recurrent neural network (IndRNN). The developed architecture is
tested with real-world datasets of Didi Chuxing, which shows that our models
based on the proposed architecture can outperform conventional time-series
models (e.g., ARIMA) and machine learning models (e.g., gradient boosting
machine, distributed random forest, generalized linear model, artificial neural
network). Additionally, the feature importance layer provides an interpretation
of the model by revealing the contribution of the input features utilized in
prediction.
","[{'version': 'v1', 'created': 'Wed, 16 Dec 2020 11:22:14 GMT'}, {'version': 'v2', 'created': 'Sat, 8 May 2021 00:14:58 GMT'}, {'version': 'v3', 'created': 'Sat, 30 Oct 2021 03:12:29 GMT'}, {'version': 'v4', 'created': 'Tue, 30 Nov 2021 08:10:29 GMT'}]",2021-12-01,"[['Rahman', 'M. H.', ''], ['Rifaat', 'S. M.', '']]","['convolutional neural network', 'deep learning', 'demand', 'recurrent neural network', 'supply-demand gap']"
7585,2211.03613,Md. Nazrul Huda Shanto,"Nibula Bente Rashid, Joyeeta Saha, Raonak Islam Prova, Nowshin Tasfia,
  Md. Nazrul Huda Shanto, and Jannatun Noor",Towards Devising A Fund Management System Using Blockchain,"arXiv admin note: text overlap with arXiv:2203.03169 by other
  authors. arXiv admin note: substantial text overlap with arXiv:2203.03169 by
  other authors without attribution","International Journal of Computer Science and Information
  Technology (IJCSIT), Volume 12(18), pp 225-238, 2022",10.5121/csit.2022.121820,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  State government operations comprise a large number of transactions for
different processes that must be carried out across the state. This comprises
new projects, maintenance and repairs, public employee compensation, and
agricultural schemes. Low-level corruption, which is sometimes difficult to
trace and hinders state growth, is a big challenge for the top administration.
In order to eradicate corruption and bring transparency, technology can be used
in an efficient way. An important task to exterminate corruption is to keep
track of all the financial transactions of an undergoing project. This research
uses blockchain technology to keep track of fund management systems and assure
the transparency of any financial statement. This paper proposes to use a
gateway where all transaction records are updated in the system and visible to
all stakeholders. We find research gaps in the literature and focus on
including government funds and local currency usage. The proposed model's
motive is to generate a funding model that attains two sub-goals: designing a
fund management methodology in which authorized individuals can receive and
withdraw allocated funds in crypto currency, and evaluating a smart contract to
incorporate the money and identify transparency and tracking. The proposed
model executes every feature of our system in just 8.3786ms on average.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2022 15:06:35 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Dec 2022 17:19:47 GMT'}]",2022-12-06,"[['Rashid', 'Nibula Bente', ''], ['Saha', 'Joyeeta', ''], ['Prova', 'Raonak Islam', ''], ['Tasfia', 'Nowshin', ''], ['Shanto', 'Md. Nazrul Huda', ''], ['Noor', 'Jannatun', '']]","['Blockchain', 'Ethereum', 'Smart contract', 'Government Funding']"
7586,cs/0203014,Stephen F. Bush,Stephen F. Bush,"Active Virtual Network Management Prediction: Complexity as a Framework
  for Prediction, Optimization, and Assurance",,"IEEE Computer Society Press, Proceedings of the 2002 DARPA Active
  Networks Conference and Exposition (DANCE 2002), May 29-31, 2002, San
  Francisco, California, USA",10.1109/DANCE.2002.1003518,,cs.CC cs.NI,,"  Research into active networking has provided the incentive to re-visit what
has traditionally been classified as distinct properties and characteristics of
information transfer such as protocol versus service; at a more fundamental
level this paper considers the blending of computation and communication by
means of complexity. The specific service examined in this paper is network
self-prediction enabled by Active Virtual Network Management Prediction.
Computation/communication is analyzed via Kolmogorov Complexity. The result is
a mechanism to understand and improve the performance of active networking and
Active Virtual Network Management Prediction in particular. The Active Virtual
Network Management Prediction mechanism allows information, in various states
of algorithmic and static form, to be transported in the service of prediction
for network management. The results are generally applicable to algorithmic
transmission of information. Kolmogorov Complexity is used and experimentally
validated as a theory describing the relationship among algorithmic
compression, complexity, and prediction accuracy within an active network.
Finally, the paper concludes with a complexity-based framework for Information
Assurance that attempts to take a holistic view of vulnerability analysis.
","[{'version': 'v1', 'created': 'Mon, 11 Mar 2002 23:09:16 GMT'}]",2016-11-17,"[['Bush', 'Stephen F.', '']]","['Active Virtual Network Management Prediction', 'Kolmogorov Complexity', 'Information Assuranceand Active Networks']"
7587,2203.09903,"Elias Gr\""unewald","Frank Pallas and David Hartmann and Paul Heinrich and Josefine Kipke
  and Elias Gr\""unewald",Configurable Per-Query Data Minimization for Privacy-Compliant Web APIs,"Preprint version (2022-03-18) This version of the contribution has
  been accepted for publication at the 22nd International Conference on Web
  Engineering (ICWE 2022), Bari, Italy",,10.1145/3493369.3493601,,cs.CR cs.CY cs.DC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of regulatory data minimization obligations is to limit personal
data to the absolute minimum necessary for a given context. Beyond the initial
data collection, storage, and processing, data minimization is also required
for subsequent data releases, as it is the case when data are provided using
query-capable Web APIs. Data-providing Web APIs, however, typically lack
sophisticated data minimization features, leaving the task open to manual and
all too often missing implementations. In this paper, we address the problem of
data minimization for data-providing, query-capable Web APIs. Based on a
careful analysis of functional and non-functional requirements, we introduce
Janus, an easy-to-use, highly configurable solution for implementing legally
compliant data minimization in GraphQL Web APIs. Janus provides a rich set of
information reduction functionalities that can be configured for different
client roles accessing the API. We present a technical proof-of-concept along
with experimental measurements that indicate reasonable overheads. Janus is
thus a practical solution for implementing GraphQL APIs in line with the
regulatory principle of data minimization.
","[{'version': 'v1', 'created': 'Fri, 18 Mar 2022 12:26:20 GMT'}]",2022-09-26,"[['Pallas', 'Frank', ''], ['Hartmann', 'David', ''], ['Heinrich', 'Paul', ''], ['Kipke', 'Josefine', ''], ['Grünewald', 'Elias', '']]","['privacy', 'data protection', 'data minimization', 'anonymization', 'Web APIs', 'GraphQL', 'privacy engineering']"
7588,2205.01398,Zied Ben Houidi,Zied Ben Houidi and Dario Rossi,"Neural language models for network configuration: Opportunities and
  reality check",,"Elsevier Computer Communications, Volume 193, 1 September 2022,
  Pages 118-125",10.1016/j.comcom.2022.06.035,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Boosted by deep learning, natural language processing (NLP) techniques have
recently seen spectacular progress, mainly fueled by breakthroughs both in
representation learning with word embeddings (e.g. word2vec) as well as novel
architectures (e.g. transformers). This success quickly invited researchers to
explore the use of NLP techniques to other fields, such as computer programming
languages, with the promise to automate tasks in software programming (bug
detection, code synthesis, code repair, cross language translation etc.). By
extension, NLP has potential for application to network configuration languages
as well, for instance considering tasks such as network configuration
verification, synthesis, and cross-vendor translation. In this paper, we survey
recent advances in deep learning applied to programming languages, for the
purpose of code verification, synthesis and translation: in particularly, we
review their training requirements and expected performance, and qualitatively
assess whether similar techniques can benefit corresponding use-cases in
networking.
","[{'version': 'v1', 'created': 'Tue, 3 May 2022 10:08:04 GMT'}, {'version': 'v2', 'created': 'Wed, 4 May 2022 12:04:18 GMT'}, {'version': 'v3', 'created': 'Mon, 25 Jul 2022 13:52:35 GMT'}]",2022-07-26,"[['Houidi', 'Zied Ben', ''], ['Rossi', 'Dario', '']]","['Natural language processing', 'Code verification', 'synthesis', 'translation', 'Network configuration verification', 'synthesis translation']"
7589,2002.04011,Andr\'es Ezequiel Viso,"Antonio Bucciarelli, Delia Kesner, Alejandro R\'ios, Andr\'es Viso",The Bang Calculus Revisited,,,10.1007/978-3-030-59025-3\_2,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Call-by-Push-Value (CBPV) is a programming paradigm subsuming both
Call-by-Name (CBN) and Call-by-Value (CBV) semantics. The essence of this
paradigm is captured by the Bang Calculus, a (concise) term language connecting
CBPV and Linear Logic.
  This paper presents a revisited version of the Bang Calculus, called $\lambda
!$, enjoying some important properties missing in the original formulation.
Indeed, the new calculus integrates commutative conversions to unblock value
redexes while being confluent at the same time. A second contribution is
related to non-idempotent types. We provide a quantitative type system for our
$\lambda !$-calculus, and we show that the length of the (weak) reduction of a
typed term to its normal form plus the size of this normal form is bounded by
the size of its type derivation. We also explore the properties of this type
system with respect to CBN/CBV translations. We keep the original CBN
translation from $\lambda$-calculus to the Bang Calculus, which preserves
normal forms and is sound and complete with respect to the (quantitative) type
system for CBN. However, in the case of CBV, we reformulate both the
translation and the type system to restore two main properties: preservation of
normal forms and completeness. Last but not least, the quantitative system is
refined to a tight one, which transforms the previous upper bound on the length
of reduction to normal form plus its size into two independent exact measures
for them.
","[{'version': 'v1', 'created': 'Mon, 10 Feb 2020 18:38:00 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Sep 2020 13:02:32 GMT'}, {'version': 'v3', 'created': 'Fri, 4 Feb 2022 11:58:07 GMT'}, {'version': 'v4', 'created': 'Tue, 27 Sep 2022 11:38:06 GMT'}]",2022-09-28,"[['Bucciarelli', 'Antonio', ''], ['Kesner', 'Delia', ''], ['Ríos', 'Alejandro', ''], ['Viso', 'Andrés', '']]","['Call-by-Push-Value', 'Bang Calculus', 'Intersection Types']"
7590,2209.06209,Zijie Wang,"Zijie Wang, Aichun Zhu, Jingyi Xue, Xili Wan, Chao Liu, Tian Wang,
  Yifeng Li","Look Before You Leap: Improving Text-based Person Retrieval by Learning
  A Consistent Cross-modal Common Manifold","Accepted on ACM MM '22. arXiv admin note: text overlap with
  arXiv:2209.05773",,10.1145/3503161.3548166,,cs.CV cs.IR cs.MM,http://creativecommons.org/licenses/by/4.0/,"  The core problem of text-based person retrieval is how to bridge the
heterogeneous gap between multi-modal data. Many previous approaches contrive
to learning a latent common manifold mapping paradigm following a
\textbf{cross-modal distribution consensus prediction (CDCP)} manner. When
mapping features from distribution of one certain modality into the common
manifold, feature distribution of the opposite modality is completely
invisible. That is to say, how to achieve a cross-modal distribution consensus
so as to embed and align the multi-modal features in a constructed cross-modal
common manifold all depends on the experience of the model itself, instead of
the actual situation. With such methods, it is inevitable that the multi-modal
data can not be well aligned in the common manifold, which finally leads to a
sub-optimal retrieval performance. To overcome this \textbf{CDCP dilemma}, we
propose a novel algorithm termed LBUL to learn a Consistent Cross-modal Common
Manifold (C$^{3}$M) for text-based person retrieval. The core idea of our
method, just as a Chinese saying goes, is to `\textit{san si er hou xing}',
namely, to \textbf{Look Before yoU Leap (LBUL)}. The common manifold mapping
mechanism of LBUL contains a looking step and a leaping step. Compared to
CDCP-based methods, LBUL considers distribution characteristics of both the
visual and textual modalities before embedding data from one certain modality
into C$^{3}$M to achieve a more solid cross-modal distribution consensus, and
hence achieve a superior retrieval accuracy. We evaluate our proposed method on
two text-based person retrieval datasets CUHK-PEDES and RSTPReid. Experimental
results demonstrate that the proposed LBUL outperforms previous methods and
achieves the state-of-the-art performance.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2022 07:21:21 GMT'}]",2022-09-15,"[['Wang', 'Zijie', ''], ['Zhu', 'Aichun', ''], ['Xue', 'Jingyi', ''], ['Wan', 'Xili', ''], ['Liu', 'Chao', ''], ['Wang', 'Tian', ''], ['Li', 'Yifeng', '']]","['person retrieval', 'text-based person re-identification', 'cross-modalretrieval']"
7591,2109.06365,Fuxin Li,"Li Fuxin, Zhongang Qi, Saeed Khorram, Vivswan Shitole, Prasad
  Tadepalli, Minsuk Kahng, Alan Fern",From Heatmaps to Structural Explanations of Image Classifiers,Submitted to Applied AI Letters,Applied AI Letters.2021;2:e46,10.1002/ail2.46,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  This paper summarizes our endeavors in the past few years in terms of
explaining image classifiers, with the aim of including negative results and
insights we have gained. The paper starts with describing the explainable
neural network (XNN), which attempts to extract and visualize several
high-level concepts purely from the deep network, without relying on human
linguistic concepts. This helps users understand network classifications that
are less intuitive and substantially improves user performance on a difficult
fine-grained classification task of discriminating among different species of
seagulls.
  Realizing that an important missing piece is a reliable heatmap visualization
tool, we have developed I-GOS and iGOS++ utilizing integrated gradients to
avoid local optima in heatmap generation, which improved the performance across
all resolutions. During the development of those visualizations, we realized
that for a significant number of images, the classifier has multiple different
paths to reach a confident prediction. This has lead to our recent development
of structured attention graphs (SAGs), an approach that utilizes beam search to
locate multiple coarse heatmaps for a single image, and compactly visualizes a
set of heatmaps by capturing how different combinations of image regions impact
the confidence of a classifier.
  Through the research process, we have learned much about insights in building
deep network explanations, the existence and frequency of multiple
explanations, and various tricks of the trade that make explanations work. In
this paper, we attempt to share those insights and opinions with the readers
with the hope that some of them will be informative for future researchers on
explainable deep learning.
","[{'version': 'v1', 'created': 'Mon, 13 Sep 2021 23:39:57 GMT'}]",2022-03-14,"[['Fuxin', 'Li', ''], ['Qi', 'Zhongang', ''], ['Khorram', 'Saeed', ''], ['Shitole', 'Vivswan', ''], ['Tadepalli', 'Prasad', ''], ['Kahng', 'Minsuk', ''], ['Fern', 'Alan', '']]","['Explanation of Deep Networks', 'Global Explanations', 'Heatmap Visualizations', 'Structured Explanations']"
7592,1712.00408,Inanc Senocak,"Jaber J. Hasbestan, Inanc Senocak","Binarized octree generation for Cartesian adaptive mesh refinement
  around immersed geometries",submitted to Journal of Computational Physics,,10.1016/j.jcp.2018.04.039,,cs.CE physics.comp-ph physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We revisit the generation of balanced octrees for adaptive mesh refinement
(AMR) of Cartesian domains with immersed complex geometries. In a recent short
note [Hasbestan and Senocak, J. Comput. Phys. vol. 351:473-477 (2017)], we
showed that the data-locality of the Z-order curve in hashed linear octree
generation methods may not be perfect because of potential collisions in the
hash table. Building on that observation, we propose a binarized octree
generation method that complies with the Z-order curve exactly. Similar to a
hashed linear octree generation method, we use Morton encoding to index the
nodes of an octree, but use a red-black tree in place of the hash table.
Red-black tree is a special kind of a binary tree, which we use for insertion
and deletion of elements during mesh adaptation. By strictly working with the
bitwise representation of the octree, we remove computer hardware limitations
on the depth of adaptation on a single processor. Additionally, we introduce a
geometry encoding technique for rapidly tagging the solid geometry for
refinement. Our results for several geometries with different levels of
adaptations show that the binarized octree generation outperforms the linear
octree generation in terms of runtime performance at the expense of only a
slight increase in memory usage. We provide the current AMR capability as
open-source software.
","[{'version': 'v1', 'created': 'Fri, 1 Dec 2017 17:09:41 GMT'}]",2018-05-23,"[['Hasbestan', 'Jaber J.', ''], ['Senocak', 'Inanc', '']]","['AMR', 'Hash table', 'Octree', 'Red-black tree', 'Z-order curve']"
7593,1910.04228,\'Eric Colin de Verdi\`ere,Sergio Cabello and \'Eric Colin de Verdi\`ere,Hardness of Minimum Barrier Shrinkage and Minimum Installation Path,,Theoretical Computer Science 835 (2020) 120-133,10.1016/j.tcs.2020.06.016,,cs.CC cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the Minimum Installation Path problem, we are given a graph $G$ with edge
weights $w(.)$ and two vertices $s,t$ of $G$. We want to assign a non-negative
power $p(v)$ to each vertex $v$ of $G$ so that the edges $uv$ such that
$p(u)+p(v)$ is at least $w(uv)$ contain some $s$-$t$-path, and minimize the sum
of assigned powers. In the Minimum Barrier Shrinkage problem, we are given a
family of disks in the plane and two points $x$ and $y$ lying outside the
disks. The task is to shrink the disks, each one possibly by a different
amount, so that we can draw an $x$-$y$ curve that is disjoint from the interior
of the shrunken disks, and the sum of the decreases in the radii is minimized.
  We show that the Minimum Installation Path and the Minimum Barrier Shrinkage
problems (or, more precisely, the natural decision problems associated with
them) are weakly NP-hard.
","[{'version': 'v1', 'created': 'Wed, 9 Oct 2019 20:01:17 GMT'}, {'version': 'v2', 'created': 'Sat, 13 Jun 2020 10:25:14 GMT'}, {'version': 'v3', 'created': 'Wed, 19 Aug 2020 08:06:53 GMT'}]",2020-08-20,"[['Cabello', 'Sergio', ''], ['de Verdière', 'Éric Colin', '']]","['installation path', 'activation network', 'barrier problem', 'NP-hardness']"
7594,2208.00308,Johan Lin{\aa}ker,"Johan Lin{\aa}ker, Hussan Munir, Krzysztof Wnuk, Carl-Eric Mols","Motivating the Contributions: An Open Innovation Perspective on What to
  Share as Open Source Software",,,10.1016/j.jss.2017.09.032,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Open Source Software (OSS) ecosystems have reshaped the ways how
software-intensive firms develop products and deliver value to customers.
However, firms still need support for strategic product planning in terms of
what to develop internally and what to share as OSS. Existing models accurately
capture commoditization in software business, but lack operational support to
decide what contribution strategy to employ in terms of what and when to
contribute. This study proposes a Contribution Acceptance Process (CAP) model
from which firms can adopt contribution strategies that align with product
strategies and planning. In a design science influenced case study executed at
Sony Mobile, the CAP model was iteratively developed in close collaboration
with the firm's practitioners. The CAP model helps classify artifacts according
to business impact and control complexity so firms may estimate and plan
whether an artifact should be contributed or not. Further, an information
meta-model is proposed that helps operationalize the CAP model at the
organization. The CAP model provides an operational OI perspective on what
firms involved in OSS ecosystems should share, by helping them motivate
contributions through the creation of contribution strategies. The goal is to
help maximize return on investment and sustain needed influence in OSS
ecosystems.
","[{'version': 'v1', 'created': 'Sat, 30 Jul 2022 20:54:25 GMT'}]",2022-08-02,"[['Linåker', 'Johan', ''], ['Munir', 'Hussan', ''], ['Wnuk', 'Krzysztof', ''], ['Mols', 'Carl-Eric', '']]","['Open Innovation', 'Open Source Software', 'Software Ecosystem', 'Contribution Strategy', 'Product Planning', 'Product Strategy']"
7595,2004.12337,Jaros{\l}aw Miszczak,"Mateusz \.Zarski, Bartosz W\'ojcik, Jaros{\l}aw Adam Miszczak","KrakN: Transfer Learning framework for thin crack detection in
  infrastructure maintenance","23 pages, 15 figures and flowcharts, software available at
  https://github.com/MatZar01/KrakN, https://doi.org/10.5281/zenodo.3764697,
  and https://doi.org/10.5281/zenodo.3755452, dataset available from
  https://doi.org/10.5281/zenodo.3759845","SoftwareX, Vol 16, 100893 (2021)",10.1016/j.softx.2021.100893,,cs.CV cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Monitoring the technical condition of infrastructure is a crucial element to
its maintenance. Currently applied methods are outdated, labour-intensive and
inaccurate. At the same time, the latest methods using Artificial Intelligence
techniques are severely limited in their application due to two main factors --
labour-intensive gathering of new datasets and high demand for computing power.
We propose to utilize custom made framework -- KrakN, to overcome these
limiting factors. It enables the development of unique infrastructure defects
detectors on digital images, achieving the accuracy of above 90%. The framework
supports semi-automatic creation of new datasets and has modest computing power
requirements. It is implemented in the form of a ready-to-use software package
openly distributed to the public. Thus, it can be used to immediately implement
the methods proposed in this paper in the process of infrastructure management
by government units, regardless of their financial capabilities.
","[{'version': 'v1', 'created': 'Sun, 26 Apr 2020 09:57:36 GMT'}, {'version': 'v2', 'created': 'Sun, 11 Oct 2020 17:15:12 GMT'}]",2021-11-30,"[['Żarski', 'Mateusz', ''], ['Wójcik', 'Bartosz', ''], ['Miszczak', 'Jarosław Adam', '']]","['infrastructure maintenance', 'structural health monitoring', 'deep learning', 'transfer learning', 'crack detection']"
7596,2103.11021,Antonio Di Crescenzo,"Chanchal Kundu, Antonio Di Crescenzo, Maria Longobardi",On cumulative residual (past) inaccuracy for truncated random variables,"19 pages, 3 figures","Metrika, 79 (2016), pp. 335-356",10.1007/s00184-015-0557-5,,cs.IT math.IT math.PR math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To overcome the drawbacks of Shannon's entropy, the concept of cumulative
residual and past entropy has been proposed in the information theoretic
literature. Furthermore, the Shannon entropy has been generalized in a number
of different ways by many researchers. One important extension is Kerridge
inaccuracy measure. In the present communication we study the cumulative
residual and past inaccuracy measures, which are extensions of the
corresponding cumulative entropies. Several properties, including monotonicity
and bounds, are obtained for left, right and doubly truncated random variables.
","[{'version': 'v1', 'created': 'Fri, 19 Mar 2021 20:54:13 GMT'}]",2021-03-23,"[['Kundu', 'Chanchal', ''], ['Di Crescenzo', 'Antonio', ''], ['Longobardi', 'Maria', '']]","['Cumulative residual (past) entropy', 'Dynamic cumulative residual (past) inaccuracy', 'Inaccuracy', 'Interval cumulative residual (past) inaccuracy']"
7597,2104.11805,Gunduz Vehbi Demirci,"Gunduz Vehbi Demirci, Hakan Ferhatosmanoglu","Partitioning sparse deep neural networks for scalable training and
  inference","Gunduz Vehbi Demirci and Hakan Ferhatosmanoglu. 2021. Partitioning
  Sparse Deep Neural Networks for Scalable Training and Inference. In 2021
  International Conference on Supercomputing (ICS '21), June 14-17, 2021,
  Virtual Event, USA. ACM, New York, NY, USA, 12 pages",,10.1145/3447818.3460372,,cs.LG cs.AI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The state-of-the-art deep neural networks (DNNs) have significant
computational and data management requirements. The size of both training data
and models continue to increase. Sparsification and pruning methods are shown
to be effective in removing a large fraction of connections in DNNs. The
resulting sparse networks present unique challenges to further improve the
computational efficiency of training and inference in deep learning. Both the
feedforward (inference) and backpropagation steps in stochastic gradient
descent (SGD) algorithm for training sparse DNNs involve consecutive sparse
matrix-vector multiplications (SpMVs). We first introduce a distributed-memory
parallel SpMV-based solution for the SGD algorithm to improve its scalability.
The parallelization approach is based on row-wise partitioning of weight
matrices that represent neuron connections between consecutive layers. We then
propose a novel hypergraph model for partitioning weight matrices to reduce the
total communication volume and ensure computational load-balance among
processors. Experiments performed on sparse DNNs demonstrate that the proposed
solution is highly efficient and scalable. By utilizing the proposed matrix
partitioning scheme, the performance of our solution is further improved
significantly.
","[{'version': 'v1', 'created': 'Fri, 23 Apr 2021 20:05:52 GMT'}]",2021-04-27,"[['Demirci', 'Gunduz Vehbi', ''], ['Ferhatosmanoglu', 'Hakan', '']]","['Scalable Deep Learning', 'Sparse Deep Neural Networks', 'DistributedStochastic Gradient Descent', 'Hypergraph Partitioning', 'Sparse Matrix Vector Multiplication']"
7598,1602.05432,Abuzer Yakaryilmaz,Marcos Villagra and Abuzer Yakary{\i}lmaz,Language recognition power and succintness of affine automata,"19 pages. New results are added. A shorter version will appear in the
  proceedings of the 15th International Conference on Unconventional
  Computation and Natural Computation (UCNC 2016)",Natural Computing (2017),10.1007/s11047-017-9652-z,,cs.FL cs.CC quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we study a non-linear generalization based on affine
transformations of probabilistic and quantum automata proposed recently by
D\'iaz-Caro and Yakary{\i}lmaz \cite{DCY16A} referred as affine automata.
First, we present efficient simulations of probabilistic and quantum automata
by means of affine automata which allows us to characterize the class of
exclusive stochastic languages. Then, we initiate a study on the succintness of
affine automata. In particular, we show that an infinite family of unary
regular languages can be recognized by 2-state affine automata but the state
numbers of quantum and probabilistic automata cannot be bounded. Finally, we
present the characterization of all (regular) unary languages recognized by
two-state affine automata.
","[{'version': 'v1', 'created': 'Wed, 17 Feb 2016 14:34:29 GMT'}, {'version': 'v2', 'created': 'Mon, 2 May 2016 06:35:37 GMT'}]",2017-11-15,"[['Villagra', 'Marcos', ''], ['Yakaryılmaz', 'Abuzer', '']]","['probabilistic automata', 'quantum automata', 'affine automata', 'state complexity', 'stochastic language', 'bounded-error', 'one-sided error']"
7599,2203.02281,Thulasya Naik Banoth,"Banoth Thulasya Naik, Mohammad Farukh Hashmi, Neeraj Dhanraj Bokde","A Comprehensive Review of Computer Vision in Sports: Open Issues, Future
  Trends and Research Directions",,applsci-1674306/2022,10.3390/app12094429,,cs.CV eess.IV,http://creativecommons.org/licenses/by-sa/4.0/,"  Recent developments in video analysis of sports and computer vision
techniques have achieved significant improvements to enable a variety of
critical operations. To provide enhanced information, such as detailed complex
analysis in sports like soccer, basketball, cricket, badminton, etc., studies
have focused mainly on computer vision techniques employed to carry out
different tasks. This paper presents a comprehensive review of sports video
analysis for various applications high-level analysis such as detection and
classification of players, tracking player or ball in sports and predicting the
trajectories of player or ball, recognizing the teams strategies, classifying
various events in sports. The paper further discusses published works in a
variety of application-specific tasks related to sports and the present
researchers views regarding them. Since there is a wide research scope in
sports for deploying computer vision techniques in various sports, some of the
publicly available datasets related to a particular sport have been provided.
This work reviews a detailed discussion on some of the artificial
intelligence(AI)applications in sports vision, GPU-based work stations, and
embedded platforms. Finally, this review identifies the research directions,
probable challenges, and future trends in the area of visual recognition in
sports.
","[{'version': 'v1', 'created': 'Thu, 3 Mar 2022 07:49:21 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Mar 2022 04:39:12 GMT'}]",2022-05-02,"[['Naik', 'Banoth Thulasya', ''], ['Hashmi', 'Mohammad Farukh', ''], ['Bokde', 'Neeraj Dhanraj', '']]","['Sports', 'Ball Detection', 'Player Tracking', 'Artificial Intelligence', 'Computer Vision', 'Embedded']"
7600,2008.11752,Shounak Datta,"Sankha Subhra Mullick and Shounak Datta and Sourish Gunesh Dhekane and
  Swagatam Das","Appropriateness of Performance Indices for Imbalanced Data
  Classification: An Analysis",Published in Pattern Recognition (Elsevier),"Pattern Recognition, 102, p.107197 (2020)",10.1016/j.patcog.2020.107197,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Indices quantifying the performance of classifiers under class-imbalance,
often suffer from distortions depending on the constitution of the test set or
the class-specific classification accuracy, creating difficulties in assessing
the merit of the classifier. We identify two fundamental conditions that a
performance index must satisfy to be respectively resilient to altering number
of testing instances from each class and the number of classes in the test set.
In light of these conditions, under the effect of class imbalance, we
theoretically analyze four indices commonly used for evaluating binary
classifiers and five popular indices for multi-class classifiers. For indices
violating any of the conditions, we also suggest remedial modification and
normalization. We further investigate the capability of the indices to retain
information about the classification performance over all the classes, even
when the classifier exhibits extreme performance on some classes. Simulation
studies are performed on high dimensional deep representations of subset of the
ImageNet dataset using four state-of-the-art classifiers tailored for handling
class imbalance. Finally, based on our theoretical findings and empirical
evidence, we recommend the appropriate indices that should be used to evaluate
the performance of classifiers in presence of class-imbalance.
","[{'version': 'v1', 'created': 'Wed, 26 Aug 2020 18:23:36 GMT'}]",2020-08-28,"[['Mullick', 'Sankha Subhra', ''], ['Datta', 'Shounak', ''], ['Dhekane', 'Sourish Gunesh', ''], ['Das', 'Swagatam', '']]","['Imbalanced classification', 'Performance evaluation indices', 'Precision', 'Recall', 'GMean', 'Area']"
7601,1810.04542,Patrick Koch,"Patrick Koch, Birgit Hofer, Franz Wotawa","On the Refinement of Spreadsheet Smells by means of Structure
  Information",,,10.1016/j.jss.2018.09.092,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spreadsheet users are often unaware of the risks imposed by poorly designed
spreadsheets. One way to assess spreadsheet quality is to detect smells which
attempt to identify parts of spreadsheets that are hard to comprehend or
maintain and which are more likely to be the root source of bugs.
Unfortunately, current spreadsheet smell detection techniques suffer from a
number of drawbacks that lead to incorrect or redundant smell reports. For
example, the same quality issue is often reported for every copy of a cell,
which may overwhelm users. To deal with these issues, we propose to refine
spreadsheet smells by exploiting inferred structural information for smell
detection. We therefore first provide a detailed description of our static
analysis approach to infer clusters and blocks of related cells. We then
elaborate on how to improve existing smells by providing three example
refinements of existing smells that incorporate information about cell groups
and computation blocks. Furthermore, we propose three novel smell detection
techniques that make use of the inferred spreadsheet structures. Empirical
evaluation of the proposed techniques suggests that the refinements
successfully reduce the number of incorrectly and redundantly reported smells,
and novel deficits are revealed by the newly introduced smells.
","[{'version': 'v1', 'created': 'Wed, 10 Oct 2018 14:09:38 GMT'}]",2018-10-11,"[['Koch', 'Patrick', ''], ['Hofer', 'Birgit', ''], ['Wotawa', 'Franz', '']]","['Spreadsheets', 'Code smells', 'Static analysis']"
7602,2202.04613,Peter Johanns,"Peter Johanns, Timm Haucke, Volker Steinhage",Automated Distance Estimation for Wildlife Camera Trapping,,"Ecological Informatics, Volume 70, September 2022, 101734",10.1016/j.ecoinf.2022.101734,,cs.CV cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The ongoing biodiversity crisis calls for accurate estimation of animal
density and abundance to identify sources of biodiversity decline and
effectiveness of conservation interventions. Camera traps together with
abundance estimation methods are often employed for this purpose. The necessary
distances between camera and observed animals are traditionally derived in a
laborious, fully manual or semi-automatic process. Both approaches require
reference image material, which is both difficult to acquire and not available
for existing datasets. We propose a fully automatic approach we call AUtomated
DIstance esTimation (AUDIT) to estimate camera-to-animal distances. We leverage
existing state-of-the-art relative monocular depth estimation and combine it
with a novel alignment procedure to estimate metric distances. AUDIT is fully
automated and requires neither the comparison of observations in camera trap
imagery with reference images nor capturing of reference image material at all.
AUDIT therefore relieves biologists and ecologists from a significant workload.
We evaluate AUDIT on a zoo scenario dataset unseen during training where we
achieve a mean absolute distance estimation error over all animal instances of
only 0.9864 meters and mean relative error (REL) of 0.113. The code and usage
instructions are available at
https://github.com/PJ-cs/DistanceEstimationTracking
","[{'version': 'v1', 'created': 'Wed, 9 Feb 2022 18:12:18 GMT'}, {'version': 'v2', 'created': 'Wed, 11 May 2022 16:04:11 GMT'}]",2022-11-21,"[['Johanns', 'Peter', ''], ['Haucke', 'Timm', ''], ['Steinhage', 'Volker', '']]","['Animal density', 'animal abundance', 'camera trapping', 'unmarkedanimal populations', 'automated distance estimation', 'animal tracking']"
7603,2005.10388,Jessica Diaz,"Jessica Diaz, Daniel L\'opez-Fern\'andez, Jorge Perez, \'Angel
  Gonz\'alez-Prieto","Why are many businesses instilling a DevOps culture into their
  organization?","47 pages, 9 figures, 17 tables","Empir Software Eng 26, 25 (2021)",10.1007/s10664-020-09919-3,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: DevOps can be defined as a cultural movement to improve and
accelerate the delivery of business value by making the collaboration between
development and operations effective. Although this movement is relatively
recent, there exist an intensive research around DevOps. However, the real
reasons why companies move to DevOps and the results they expect to obtain have
been paid little attention in real contexts. Objective: This paper aims to help
practitioners and researchers to better understand the context and the problems
that many companies face day to day in their organizations when they try to
accelerate software delivery and the main drivers that move these companies to
adopting DevOps. Method: We conducted an exploratory study by leveraging in
depth, semi-structured interviews to relevant stakeholders of 30 multinational
software-intensive companies, together industrial workshops and observations at
organizations' facilities that supported triangulation. Additionally, we
conducted an inter-coder agreement analysis, which is not usually addressed in
qualitative studies in software engineering, to increase reliability and reduce
authors bias of the drawn findings. Results: The research explores the problems
and expected outcomes that moved companies to adopt DevOps and reveals a set of
patterns and anti-patterns about the reasons why companies are instilling a
DevOps culture. Conclusions: This study aims to strengthen evidence and support
practitioners in making better informed about which problems trigger a DevOps
transition and most common expected results.
","[{'version': 'v1', 'created': 'Wed, 20 May 2020 23:15:57 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Jan 2021 17:13:41 GMT'}, {'version': 'v3', 'created': 'Wed, 10 Mar 2021 11:09:46 GMT'}]",2021-03-11,"[['Diaz', 'Jessica', ''], ['López-Fernández', 'Daniel', ''], ['Perez', 'Jorge', ''], ['González-Prieto', 'Ángel', '']]","['DevOps', 'Empirical software engineering', 'Exploratory case study']"
7604,2007.10871,Christian Hesch,"Maik Dittman, Jonathan Schult, Felix Schmidt and Christian Hesch","A strain-gradient formulation for fiber reinforced polymers: Hybrid
  phase-field model for porous-ductile fracture",,,10.1007/s00466-021-02018-0,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel numerical approach to analyze the mechanical behavior within
composite materials including the inelastic regime up to final failure is
presented. Therefore, a second-gradient theory is combined with phase-field
methods to fracture. In particular, we assume that the polymeric matrix
material undergoes ductile fracture, whereas continuously embedded fibers
undergo brittle fracture as it is typical e.g. for roving glass reinforced
thermoplastics. A hybrid phase-field approach is developed and applied along
with a modified Gurson-Tvergaard-Needelman GTN-type plasticity model accounting
for a temperature-dependent growth of voids on microscale. The mechanical
response of the arising microstructure of the woven fabric gives rise to
additional higher-order terms, representing homogenized bending contributions
of the fibers. Eventually, a series of tests is conducted for this physically
comprehensive multifield formulation to investigate different kinds and
sequences of failure within long fiber reinforced polymers.
","[{'version': 'v1', 'created': 'Tue, 21 Jul 2020 14:55:50 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Apr 2021 11:11:24 GMT'}]",2021-04-20,"[['Dittman', 'Maik', ''], ['Schult', 'Jonathan', ''], ['Schmidt', 'Felix', ''], ['Hesch', 'Christian', '']]","['Higher-gradient materials', 'woven fabrics', 'ductile fracture', 'thermomechanics', 'hybrid phase-field approach', 'GTN model']"
7605,2007.07090,Christoph Raab,Christoph Raab and Frank-Michael Schleif,"Transfer learning extensions for the probabilistic classification vector
  machine",arXiv admin note: text overlap with arXiv:1907.01343,"Neurocomputing, Volume 397, 2020, Pages 320-330, ISSN 0925-2312",10.1016/j.neucom.2019.09.104,,cs.LG stat.ML,http://creativecommons.org/licenses/by-sa/4.0/,"  Transfer learning is focused on the reuse of supervised learning models in a
new context. Prominent applications can be found in robotics, image processing
or web mining. In these fields, the learning scenarios are naturally changing
but often remain related to each other motivating the reuse of existing
supervised models. Current transfer learning models are neither sparse nor
interpretable. Sparsity is very desirable if the methods have to be used in
technically limited environments and interpretability is getting more critical
due to privacy regulations. In this work, we propose two transfer learning
extensions integrated into the sparse and interpretable probabilistic
classification vector machine. They are compared to standard benchmarks in the
field and show their relevance either by sparsity or performance improvements.
","[{'version': 'v1', 'created': 'Sat, 11 Jul 2020 08:35:10 GMT'}]",2020-07-15,"[['Raab', 'Christoph', ''], ['Schleif', 'Frank-Michael', '']]","['Transfer Learning', 'Probabilistic Classification Vector Machine', 'Transfer Kernel Learning', 'Nystr¨om Approximation', 'Basis Transfer', 'Sparsity']"
7606,2107.05192,Luyao Ma,"Luyao Ma, Yating Zhang, Tianyi Wang, Xiaozhong Liu, Wei Ye, Changlong
  Sun, Shikun Zhang","Legal Judgment Prediction with Multi-Stage CaseRepresentation Learning
  in the Real Court Setting",Accepted at SIGIR2021,,10.1145/3404835.3462945,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Legal judgment prediction(LJP) is an essential task for legal AI. While prior
methods studied on this topic in a pseudo setting by employing the
judge-summarized case narrative as the input to predict the judgment,
neglecting critical case life-cycle information in real court setting could
threaten the case logic representation quality and prediction correctness. In
this paper, we introduce a novel challenging dataset from real courtrooms to
predict the legal judgment in a reasonably encyclopedic manner by leveraging
the genuine input of the case -- plaintiff's claims and court debate data, from
which the case's facts are automatically recognized by comprehensively
understanding the multi-role dialogues of the court debate, and then learnt to
discriminate the claims so as to reach the final judgment through multi-task
learning. An extensive set of experiments with a large civil trial data set
shows that the proposed model can more accurately characterize the interactions
among claims, fact and debate for legal judgment prediction, achieving
significant improvements over strong state-of-the-art baselines. Moreover, the
user study conducted with real judges and law school students shows the neural
predictions can also be interpretable and easily observed, and thus enhancing
the trial efficiency and judgment quality.
","[{'version': 'v1', 'created': 'Mon, 12 Jul 2021 04:27:14 GMT'}]",2021-07-13,"[['Ma', 'Luyao', ''], ['Zhang', 'Yating', ''], ['Wang', 'Tianyi', ''], ['Liu', 'Xiaozhong', ''], ['Ye', 'Wei', ''], ['Sun', 'Changlong', ''], ['Zhang', 'Shikun', '']]","['judgment prediction', 'case life-cycle', 'multi-task learning']"
7607,2009.14192,Fl\'avio Bernardini,"Flavio Amadeu Bernardini, Marcia Terra da Silva, Jair Minoro Abe, Luiz
  Antonio de Lima and Kanstantsin Miatluk","Analysis of the displacement of terrestrial mobile robots in corridors
  using paraconsistent annotated evidential logic e{\tau}",,,10.5121/csit.2020.101115,,cs.AI cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article proposes an algorithm for a servo motor that controls the
movement of an autonomous terrestrial mobile robot using Paraconsistent Logic.
The design process of mechatronic systems guided the robot construction phases.
The project intends to monitor the robot through its sensors that send
positioning signals to the microcontroller. The signals are adjusted by an
embedded technology interface maintained in the concepts of Paraconsistent
Annotated Logic acting directly on the servo steering motor. The electric
signals sent to the servo motor were analyzed, and it indicates that the
algorithm paraconsistent can contribute to the increase of precision of
movements of servo motors.
","[{'version': 'v1', 'created': 'Tue, 29 Sep 2020 17:57:54 GMT'}]",2020-09-30,"[['Bernardini', 'Flavio Amadeu', ''], ['da Silva', 'Marcia Terra', ''], ['Abe', 'Jair Minoro', ''], ['de Lima', 'Luiz Antonio', ''], ['Miatluk', 'Kanstantsin', '']]","['Paraconsistent annotated logic', 'Servo motor', 'Autonomous terrestrial mobile robot', 'Robotics']"
7608,2206.04872,Dongxia Wu,"Dongxia Wu, Matteo Chinazzi, Alessandro Vespignani, Yi-An Ma, Rose Yu",Multi-fidelity Hierarchical Neural Processes,,,10.1145/3534678.3539364,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Science and engineering fields use computer simulation extensively. These
simulations are often run at multiple levels of sophistication to balance
accuracy and efficiency. Multi-fidelity surrogate modeling reduces the
computational cost by fusing different simulation outputs. Cheap data generated
from low-fidelity simulators can be combined with limited high-quality data
generated by an expensive high-fidelity simulator. Existing methods based on
Gaussian processes rely on strong assumptions of the kernel functions and can
hardly scale to high-dimensional settings. We propose Multi-fidelity
Hierarchical Neural Processes (MF-HNP), a unified neural latent variable model
for multi-fidelity surrogate modeling. MF-HNP inherits the flexibility and
scalability of Neural Processes. The latent variables transform the
correlations among different fidelity levels from observations to latent space.
The predictions across fidelities are conditionally independent given the
latent states. It helps alleviate the error propagation issue in existing
methods. MF-HNP is flexible enough to handle non-nested high dimensional data
at different fidelity levels with varying input and output dimensions. We
evaluate MF-HNP on epidemiology and climate modeling tasks, achieving
competitive performance in terms of accuracy and uncertainty estimation. In
contrast to deep Gaussian Processes with only low-dimensional (< 10) tasks, our
method shows great promise for speeding up high-dimensional complex simulations
(over 7000 for epidemiology modeling and 45000 for climate modeling).
","[{'version': 'v1', 'created': 'Fri, 10 Jun 2022 04:54:13 GMT'}]",2022-06-13,"[['Wu', 'Dongxia', ''], ['Chinazzi', 'Matteo', ''], ['Vespignani', 'Alessandro', ''], ['Ma', 'Yi-An', ''], ['Yu', 'Rose', '']]","['multi-fidelity surrogate modeling', 'neural processes', 'deep learning']"
7609,2211.10320,Pavlos Stoikos,"Pavlos Stoikos, George Floros, Dimitrios Garyfallou, Nestor
  Evmorfopoulos, George Stamoulis","A Fast Semi-Analytical Approach for Transient Electromigration Analysis
  of Interconnect Trees using Matrix Exponential",,,10.1145/3566097.3567909,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As integrated circuit technologies are moving to smaller technology nodes,
Electromigration (EM) has become one of the most challenging problems facing
the EDA industry. While numerical approaches have been widely deployed since
they can handle complicated interconnect structures, they tend to be much
slower than analytical approaches. In this paper, we present a fast
semi-analytical approach, based on the matrix exponential, for the solution of
Korhonen's stress equation at discrete spatial points of interconnect trees,
which enables the analytical calculation of EM stress at any time and point
independently. The proposed approach is combined with the extended Krylov
subspace method to accurately simulate large EM models and accelerate the
calculation of the final solution. Experimental evaluation on OpenROAD
benchmarks demonstrates that our method achieves 0.5% average relative error
over the COMSOL industrial tool while being up to three orders of magnitude
faster.
","[{'version': 'v1', 'created': 'Fri, 18 Nov 2022 16:26:40 GMT'}]",2022-11-21,"[['Stoikos', 'Pavlos', ''], ['Floros', 'George', ''], ['Garyfallou', 'Dimitrios', ''], ['Evmorfopoulos', 'Nestor', ''], ['Stamoulis', 'George', '']]","['Electromigration', 'Matrix exponential method', 'Krylov subspace']"
7610,2012.02550,Rui A.  da Costa,"R. J. Jesus, M. L. Antunes, R. A. da Costa, S. N. Dorogovtsev, J. F.
  F. Mendes, R. L. Aguiar","Effect of the initial configuration of weights on the training and
  function of artificial neural networks","12 pages, 8 figures","Mathematics 9, 2246 (2021)",10.3390/math9182246,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The function and performance of neural networks is largely determined by the
evolution of their weights and biases in the process of training, starting from
the initial configuration of these parameters to one of the local minima of the
loss function. We perform the quantitative statistical characterization of the
deviation of the weights of two-hidden-layer ReLU networks of various sizes
trained via Stochastic Gradient Descent (SGD) from their initial random
configuration. We compare the evolution of the distribution function of this
deviation with the evolution of the loss during training. We observed that
successful training via SGD leaves the network in the close neighborhood of the
initial configuration of its weights. For each initial weight of a link we
measured the distribution function of the deviation from this value after
training and found how the moments of this distribution and its peak depend on
the initial weight. We explored the evolution of these deviations during
training and observed an abrupt increase within the overfitting region. This
jump occurs simultaneously with a similarly abrupt increase recorded in the
evolution of the loss function. Our results suggest that SGD's ability to
efficiently find local minima is restricted to the vicinity of the random
initial configuration of weights.
","[{'version': 'v1', 'created': 'Fri, 4 Dec 2020 12:13:12 GMT'}]",2022-03-21,"[['Jesus', 'R. J.', ''], ['Antunes', 'M. L.', ''], ['da Costa', 'R. A.', ''], ['Dorogovtsev', 'S. N.', ''], ['Mendes', 'J. F. F.', ''], ['Aguiar', 'R. L.', '']]","['training', 'evolution of weights', 'deep learning', 'neural networks', 'artificial intelligence']"
7611,2002.06190,Tomas Petricek,"Tomas Petricek (University of Kent, United Kingdom)",Foundations of a live data exploration environment,,"The Art, Science, and Engineering of Programming, 2020, Vol. 4,
  Issue 3, Article 8",10.22152/programming-journal.org/2020/4/8,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: A growing amount of code is written to explore and analyze data,
often by data analysts who do not have a traditional background in programming,
for example by journalists.
  Inquiry: The way such data anlysts write code is different from the way
software engineers do so. They use few abstractions, work interactively and
rely heavily on external libraries. We aim to capture this way of working and
build a programming environment that makes data exploration easier by providing
instant live feedback.
  Approach: We combine theoretical and applied approach. We present the
\emph{data exploration calculus}, a formal language that captures the structure
of code written by data analysts. We then implement a data exploration
environment that evaluates code instantly during editing and shows previews of
the results.
  Knowledge: We formally describe an algorithm for providing instant previews
for the data exploration calculus that allows the user to modify code in an
unrestricted way in a text editor. Supporting interactive editing is tricky as
any edit can change the structure of code and fully recomputing the output
would be too expensive.
  Grounding: We prove that our algorithm is correct and that it reuses previous
results when updating previews after a number of common code edit operations.
We also illustrate the practicality of our approach with an empirical
evaluation and a case study.
  Importance: As data analysis becomes an ever more important use of
programming, research on programming languages and tools needs to consider new
kinds of programming workflows appropriate for those domains and conceive new
kinds of tools that can support them. The present paper is one step in this
important direction.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 18:59:30 GMT'}]",2020-02-17,"[['Petricek', 'Tomas', '', 'University of Kent, United Kingdom']]","['Data exploration', 'live programming', 'data journalism', 'instant previews']"
7612,2001.05624,Toshitaka Hayashi,Toshitaka Hayashi and Hamido Fujita,Cluster-based Zero-shot learning for multivariate data,J Ambient Intell Human Comput (2020),,10.1007/s12652-020-02268-5,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Supervised learning requires a sufficient training dataset which includes all
label. However, there are cases that some class is not in the training data.
Zero-Shot Learning (ZSL) is the task of predicting class that is not in the
training data(target class). The existing ZSL method is done for image data.
However, the zero-shot problem should happen to every data type. Hence,
considering ZSL for other data types is required. In this paper, we propose the
cluster-based ZSL method, which is a baseline method for multivariate binary
classification problems. The proposed method is based on the assumption that if
data is far from training data, the data is considered as target class. In
training, clustering is done for training data. In prediction, the data is
determined belonging to a cluster or not. If data does not belong to a cluster,
the data is predicted as target class. The proposed method is evaluated and
demonstrated using the KEEL dataset. This paper has been published in the
Journal of Ambient Intelligence and Humanized Computing. The final version is
available at the following URL:
https://link.springer.com/article/10.1007/s12652-020-02268-5
","[{'version': 'v1', 'created': 'Thu, 16 Jan 2020 03:01:00 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Feb 2020 02:16:46 GMT'}, {'version': 'v3', 'created': 'Tue, 30 Jun 2020 06:23:44 GMT'}, {'version': 'v4', 'created': 'Wed, 1 Jul 2020 02:41:39 GMT'}]",2020-07-02,"[['Hayashi', 'Toshitaka', ''], ['Fujita', 'Hamido', '']]","['Zero-shot Learning', 'Clustering', 'Machine Learning', 'Multivariate data']"
7613,2010.05241,Alexander Gorban,"Bogdan Grechuk, Alexander N. Gorban, Ivan Y. Tyukin",General stochastic separation theorems with optimal bounds,"Numerical examples and illustrations are added, minor corrections
  extended discussion and the bibliography","Neural Networks, Volume 138, 2021, Pages 33-56",10.1016/j.neunet.2021.01.034,,cs.AI stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Phenomenon of stochastic separability was revealed and used in machine
learning to correct errors of Artificial Intelligence (AI) systems and analyze
AI instabilities. In high-dimensional datasets under broad assumptions each
point can be separated from the rest of the set by simple and robust Fisher's
discriminant (is Fisher separable). Errors or clusters of errors can be
separated from the rest of the data. The ability to correct an AI system also
opens up the possibility of an attack on it, and the high dimensionality
induces vulnerabilities caused by the same stochastic separability that holds
the keys to understanding the fundamentals of robustness and adaptivity in
high-dimensional data-driven AI. To manage errors and analyze vulnerabilities,
the stochastic separation theorems should evaluate the probability that the
dataset will be Fisher separable in given dimensionality and for a given class
of distributions. Explicit and optimal estimates of these separation
probabilities are required, and this problem is solved in present work. The
general stochastic separation theorems with optimal probability estimates are
obtained for important classes of distributions: log-concave distribution,
their convex combinations and product distributions. The standard i.i.d.
assumption was significantly relaxed. These theorems and estimates can be used
both for correction of high-dimensional data driven AI systems and for analysis
of their vulnerabilities. The third area of application is the emergence of
memories in ensembles of neurons, the phenomena of grandmother's cells and
sparse coding in the brain, and explanation of unexpected effectiveness of
small neural ensembles in high-dimensional brain.
","[{'version': 'v1', 'created': 'Sun, 11 Oct 2020 13:12:41 GMT'}, {'version': 'v2', 'created': 'Sat, 9 Jan 2021 19:10:17 GMT'}]",2021-03-04,"[['Grechuk', 'Bogdan', ''], ['Gorban', 'Alexander N.', ''], ['Tyukin', 'Ivan Y.', '']]","['AI', 'blessing of dimensionality', 'curse of dimensionality', 'concentration of measure', 'AI errors', 'discriminant']"
7614,1806.07699,Vivian Silva,"Vivian S. Silva, Andr\'e Freitas, Siegfried Handschuh","Word Tagging with Foundational Ontology Classes: Extending the
  WordNet-DOLCE Mapping to Verbs","13 pages, 1 figure, presented at EKAW 2016","Proceedings of the 20th International Conference on Knowledge
  Engineering and Knowledge Management, Bologna, Italy, 2016, pp 593-605",10.1007/978-3-319-49004-5_38,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semantic annotation is fundamental to deal with large-scale lexical
information, mapping the information to an enumerable set of categories over
which rules and algorithms can be applied, and foundational ontology classes
can be used as a formal set of categories for such tasks. A previous alignment
between WordNet noun synsets and DOLCE provided a starting point for
ontology-based annotation, but in NLP tasks verbs are also of substantial
importance. This work presents an extension to the WordNet-DOLCE noun mapping,
aligning verbs according to their links to nouns denoting perdurants,
transferring to the verb the DOLCE class assigned to the noun that best
represents that verb's occurrence. To evaluate the usefulness of this resource,
we implemented a foundational ontology-based semantic annotation framework,
that assigns a high-level foundational category to each word or phrase in a
text, and compared it to a similar annotation tool, obtaining an increase of
9.05% in accuracy.
","[{'version': 'v1', 'created': 'Wed, 20 Jun 2018 12:56:54 GMT'}]",2018-06-21,"[['Silva', 'Vivian S.', ''], ['Freitas', 'André', ''], ['Handschuh', 'Siegfried', '']]","['Linguistic Resources', 'Semantic Annotation', 'FoundationalOntology']"
7615,2011.02079,Corinna Hertweck,Corinna Hertweck and Christoph Heitz and Michele Loi,On the Moral Justification of Statistical Parity,"11 pages, accepted to ACM FAccT 2021",,10.1145/3442188.3445936,,cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A crucial but often neglected aspect of algorithmic fairness is the question
of how we justify enforcing a certain fairness metric from a moral perspective.
When fairness metrics are proposed, they are typically argued for by
highlighting their mathematical properties. Rarely are the moral assumptions
beneath the metric explained. Our aim in this paper is to consider the moral
aspects associated with the statistical fairness criterion of independence
(statistical parity). To this end, we consider previous work, which discusses
the two worldviews ""What You See Is What You Get"" (WYSIWYG) and ""We're All
Equal"" (WAE) and by doing so provides some guidance for clarifying the possible
assumptions in the design of algorithms. We present an extension of this work,
which centers on morality. The most natural moral extension is that
independence needs to be fulfilled if and only if differences in predictive
features (e.g. high school grades and standardized test scores are predictive
of performance at university) between socio-demographic groups are caused by
unjust social disparities or measurement errors. Through two counterexamples,
we demonstrate that this extension is not universally true. This means that the
question of whether independence should be used or not cannot be satisfactorily
answered by only considering the justness of differences in the predictive
features.
","[{'version': 'v1', 'created': 'Wed, 4 Nov 2020 00:26:15 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Jan 2021 12:39:36 GMT'}]",2022-03-16,"[['Hertweck', 'Corinna', ''], ['Heitz', 'Christoph', ''], ['Loi', 'Michele', '']]","['fairness', 'independence', 'statistical parity', 'distributive justice', 'bias']"
7616,2209.05406,Daejin Kim,"Daejin Kim, Youngin Cho, Dongmin Kim, Cheonbok Park, Jaegul Choo",Residual Correction in Real-Time Traffic Forecasting,Accepted to CIKM 2022,,10.1145/3511808.3557432,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predicting traffic conditions is tremendously challenging since every road is
highly dependent on each other, both spatially and temporally. Recently, to
capture this spatial and temporal dependency, specially designed architectures
such as graph convolutional networks and temporal convolutional networks have
been introduced. While there has been remarkable progress in traffic
forecasting, we found that deep-learning-based traffic forecasting models still
fail in certain patterns, mainly in event situations (e.g., rapid speed drops).
Although it is commonly accepted that these failures are due to unpredictable
noise, we found that these failures can be corrected by considering previous
failures. Specifically, we observe autocorrelated errors in these failures,
which indicates that some predictable information remains. In this study, to
capture the correlation of errors, we introduce ResCAL, a residual estimation
module for traffic forecasting, as a widely applicable add-on module to
existing traffic forecasting models. Our ResCAL calibrates the prediction of
the existing models in real time by estimating future errors using previous
errors and graph signals. Extensive experiments on METR-LA and PEMS-BAY
demonstrate that our ResCAL can correctly capture the correlation of errors and
correct the failures of various traffic forecasting models in event situations.
","[{'version': 'v1', 'created': 'Mon, 12 Sep 2022 16:57:25 GMT'}]",2022-09-13,"[['Kim', 'Daejin', ''], ['Cho', 'Youngin', ''], ['Kim', 'Dongmin', ''], ['Park', 'Cheonbok', ''], ['Choo', 'Jaegul', '']]","['Traffic forecasting', 'Spatial-temporal forecasting', 'Graph neural networks', 'Residual autocorrelation']"
7617,2010.07018,Nicholas Kluge Corr\^ea,Nicholas Kluge Corr\^ea and Nythamar De Oliveira,Singularity and Coordination Problems: Pandemic Lessons from 2020,,"Journal of Futures Studies, 2021",10.6531/JFS.202109_26(1).0005,"2021,Vol. 26(1) 61--74",cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Are there any indications that a Technological Singularity may be on the
horizon? In trying to answer these questions, the authors made a small
introduction to the area of safety research in artificial intelligence. The
authors review some of the current paradigms in the development of autonomous
intelligent systems, searching for evidence that may indicate the coming of a
possible Technological Singularity. Finally, the authors present a reflection
using the COVID-19 pandemic, something that showed that global society biggest
problem in managing existential risks is its lack of coordination skills as a
global society.
","[{'version': 'v1', 'created': 'Wed, 7 Oct 2020 22:50:16 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Oct 2021 04:47:48 GMT'}]",2021-10-04,"[['Corrêa', 'Nicholas Kluge', ''], ['De Oliveira', 'Nythamar', '']]","['Singularity', 'Artificial Intelligence', 'Existential Risk', 'Coronavirus Pandemic']"
7618,1907.04258,Majid Farzaneh,Majid Farzaneh and Rahil Mahdian Toroghi,Melody Generation using an Interactive Evolutionary Algorithm,"5 pages, 4 images, submitted to MEDPRAI2019 conference",,10.1007/978-3-030-37548-5_16,,cs.NE cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Music generation with the aid of computers has been recently grabbed the
attention of many scientists in the area of artificial intelligence. Deep
learning techniques have evolved sequence production methods for this purpose.
Yet, a challenging problem is how to evaluate generated music by a machine. In
this paper, a methodology has been developed based upon an interactive
evolutionary optimization method, with which the scoring of the generated
melodies is primarily performed by human expertise, during the training. This
music quality scoring is modeled using a Bi-LSTM recurrent neural network.
Moreover, the innovative generated melody through a Genetic algorithm will then
be evaluated using this Bi-LSTM network. The results of this mechanism clearly
show that the proposed method is able to create pleasurable melodies with
desired styles and pieces. This method is also quite fast, compared to the
state-of-the-art data-oriented evolutionary systems.
","[{'version': 'v1', 'created': 'Sun, 7 Jul 2019 02:08:25 GMT'}]",2020-04-09,"[['Farzaneh', 'Majid', ''], ['Toroghi', 'Rahil Mahdian', '']]","['Melody generation', 'Evolutionary algorithm', 'Bi']"
7619,2107.01391,Peeyush Kumar,"Peeyush Kumar, Ayushe Gangal, Sunita Kumari and Sunita Tiwari","Recombinant Sort: N-Dimensional Cartesian Spaced Algorithm Designed from
  Synergetic Combination of Hashing, Bucket, Counting and Radix Sort",,Ing. des Sys. dInfo. 2020; 25 Number 5 655-688,10.18280/isi.250513,,cs.DS,http://creativecommons.org/licenses/by-sa/4.0/,"  Sorting is an essential operation which is widely used and is fundamental to
some very basic day to day utilities like searches, databases, social networks
and much more. Optimizing this basic operation in terms of complexity as well
as efficiency is cardinal. Optimization is achieved with respect to space and
time complexities of the algorithm. In this paper, a novel left-field
N-dimensional cartesian spaced sorting method is proposed by combining the best
characteristics of bucket sort, counting sort and radix sort, in addition to
employing hashing and dynamic programming for making the method more efficient.
Comparison between the proposed sorting method and various existing sorting
methods like bubble sort, insertion sort, selection sort, merge sort, heap
sort, counting sort, bucket sort, etc., has also been performed. The time
complexity of the proposed model is estimated to be linear i.e. O(n) for the
best, average and worst cases, which is better than every sorting algorithm
introduced till date.
","[{'version': 'v1', 'created': 'Sat, 3 Jul 2021 09:47:09 GMT'}]",2021-07-06,"[['Kumar', 'Peeyush', ''], ['Gangal', 'Ayushe', ''], ['Kumari', 'Sunita', ''], ['Tiwari', 'Sunita', '']]","['recombinant sort', 'bucket sort', 'counting sort', 'radix sort', 'hashing', 'sorting algorithm']"
7620,1912.10781,Radek O\v{s}lej\v{s}ek,"Radek O\v{s}lej\v{s}ek and V\'it Rus\v{n}\'ak and Karol\'ina Bursk\'a
  and Valdemar \v{S}v\'abensk\'y and Jan Vykopal","Visual Feedback for Players of Multi-Level Capture the Flag Games: Field
  Usability Study",11 pages,,10.1109/VizSec48167.2019.9161386,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Capture the Flag games represent a popular method of cybersecurity training.
Providing meaningful insight into the training progress is essential for
increasing learning impact and supporting participants' motivation, especially
in advanced hands-on courses. In this paper, we investigate how to provide
valuable post-game feedback to players of serious cybersecurity games through
interactive visualizations. In collaboration with domain experts, we formulated
user requirements that cover three cognitive perspectives: gameplay overview,
person-centric view, and comparative feedback. Based on these requirements, we
designed two interactive visualizations that provide complementary views on
game results. They combine a known clustering and time-based visual approaches
to show game results in a way that is easy to decode for players. The
purposefulness of our visual feedback was evaluated in a usability field study
with attendees of the Summer School in Cyber Security. The evaluation confirmed
the adequacy of the two visualizations for instant post-game feedback. Despite
our initial expectations, there was no strong preference for neither of the
visualizations in solving different tasks.
","[{'version': 'v1', 'created': 'Mon, 23 Dec 2019 13:09:07 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Dec 2019 11:32:56 GMT'}, {'version': 'v3', 'created': 'Tue, 18 Aug 2020 14:06:35 GMT'}, {'version': 'v4', 'created': 'Thu, 27 Aug 2020 20:52:03 GMT'}]",2020-08-31,"[['Ošlejšek', 'Radek', ''], ['Rusňák', 'Vít', ''], ['Burská', 'Karolína', ''], ['Švábenský', 'Valdemar', ''], ['Vykopal', 'Jan', '']]","['cybersecurity training', 'capture the flag games', 'visualfeedback', 'trainees']"
7621,1904.07984,Yong Kiam Tan,Yong Kiam Tan and Andr\'e Platzer,An Axiomatic Approach to Liveness for Differential Equations,"FM 2019: 23rd International Symposium on Formal Methods, Porto,
  Portugal, October 9-11, 2019",,10.1007/978-3-030-30942-8_23,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an approach for deductive liveness verification for
ordinary differential equations (ODEs) with differential dynamic logic.
Numerous subtleties complicate the generalization of well-known discrete
liveness verification techniques, such as loop variants, to the continuous
setting. For example, ODE solutions may blow up in finite time or their
progress towards the goal may converge to zero. Our approach handles these
subtleties by successively refining ODE liveness properties using ODE
invariance properties which have a well-understood deductive proof theory. This
approach is widely applicable: we survey several liveness arguments in the
literature and derive them all as special instances of our axiomatic refinement
approach. We also correct several soundness errors in the surveyed arguments,
which further highlights the subtlety of ODE liveness reasoning and the utility
of our deductive approach. The library of common refinement steps identified
through our approach enables both the sound development and justification of
new ODE liveness proof rules from our axioms.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2019 20:58:36 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Jul 2019 18:00:03 GMT'}]",2019-09-04,"[['Tan', 'Yong Kiam', ''], ['Platzer', 'André', '']]","['differential equations', 'liveness', 'differential dynamic logic']"
7622,2111.06649,John Paul Miranda,John Paul P. Miranda,Dataset of Philippine Presidents Speeches from 1935 to 2016,"11 pages, 4 figures, 4 tables, dataset",International Journal of Computing Sciences Research 5 (2021) 1-11,10.25147/ijcsr.2017.001.1.72,,cs.CY cs.IR,http://creativecommons.org/licenses/by/4.0/,"  The dataset was collected to examine and identify possible key topics within
these texts. Data preparation such as data cleaning, transformation,
tokenization, removal of stop words from both English and Filipino, and word
stemming was employed in the dataset before feeding it to sentiment analysis
and the LDA model. The topmost occurring word within the dataset is
""development"" and there are three (3) likely topics from the speeches of
Philippine presidents: economic development, enhancement of public services,
and addressing challenges. The dataset was able to provide valuable insights
contained among official documents. While the study showed that presidents have
used their annual address to express their visions for the country. It also
presented that the presidents from 1935 to 2016 faced the same problems during
their term. Future researchers may collect other speeches made by presidents
during their term; combine them to the dataset used in this study to further
investigate these important texts by subjecting them to the same methodology
used in this study. The dataset may be requested from the authors and it is
recommended for further analysis. For example, determine how the speeches of
the president reflect the preamble or foundations of the Philippine
constitution.
","[{'version': 'v1', 'created': 'Fri, 12 Nov 2021 10:36:14 GMT'}]",2021-11-15,"[['Miranda', 'John Paul P.', '']]","['data mining', 'Philippines', 'president', 'speech', 'text mining']"
7623,2101.06615,Quang-Ha Pham,"Quang-Ha Pham, Ngoc-Huy Tran, Thanh-Toan Nguyen, Thien-Phuc Tran",Online Robust Sliding-Windowed LiDAR SLAM in Natural Environments,"Add figure 2 for clearer explanation. in 2021 International Symposium
  on Electrical and Electronics Engineering (ISEE), Ho Chi Minh City, 2021",,10.1109/ISEE51682.2021.9418728,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Despite the growing interest for autonomous environmental monitoring,
effective SLAM realization in native habitats remains largely unsolved. In this
paper, we fill this gap by presenting a novel online graph-based SLAM system
for 2D LiDAR sensor in natural environments. By taking advantage of robust
weighting scheme, sliding-windowed optimization, fast scan-matcher and parallel
computing, our system not only delivers stable performance in cluttered
surroudings but also meets real-time constraint. Simulated and experimental
results confirm the feasibility and efficiency in the overall design of the
proposed system.
","[{'version': 'v1', 'created': 'Sun, 17 Jan 2021 07:51:34 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Feb 2021 11:08:06 GMT'}, {'version': 'v3', 'created': 'Thu, 15 Apr 2021 04:31:56 GMT'}, {'version': 'v4', 'created': 'Mon, 26 Apr 2021 11:44:20 GMT'}, {'version': 'v5', 'created': 'Thu, 13 May 2021 08:34:11 GMT'}, {'version': 'v6', 'created': 'Mon, 31 May 2021 07:42:03 GMT'}]",2021-07-15,"[['Pham', 'Quang-Ha', ''], ['Tran', 'Ngoc-Huy', ''], ['Nguyen', 'Thanh-Toan', ''], ['Tran', 'Thien-Phuc', '']]","['SLAM', 'robust kernel', 'sliding window', 'scan']"
7624,1908.10713,Jordan Holweger,"Jordan Holweger, Marina Dorokhova, Lionel Bloch, Christophe Ballif and
  Nicolas Wyrsch","Unsupervised algorithm for disaggregating low-sampling-rate electricity
  consumption of households",,"Sustainable Energy, Grids and Networks, Volume 19, 2019",10.1016/j.segan.2019.100244,,cs.LG eess.SP,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Non-intrusive load monitoring (NILM) has been extensively researched over the
last decade. The objective of NILM is to identify the power consumption of
individual appliances and to detect when particular devices are on or off from
measuring the power consumption of an entire house. This information allows
households to receive customized advice on how to better manage their
electrical consumption. In this paper, we present an alternative NILM method
that breaks down the aggregated power signal into categories of appliances. The
ultimate goal is to use this approach for demand-side management to estimate
potential flexibility within the electricity consumption of households. Our
method is implemented as an algorithm combining NILM and load profile
simulation. This algorithm, based on a Markov model, allocates an activity
chain to each inhabitant of the household, deduces from the whole-house power
measurement and statistical data the appliance usage, generate the power
profile accordingly and finally returns the share of energy consumed by each
appliance category over time. To analyze its performance, the algorithm was
benchmarked against several state-of-the-art NILM algorithms and tested on
three public datasets. The proposed algorithm is unsupervised; hence it does
not require any labeled data, which are expensive to acquire. Although better
performance is shown for the supervised algorithms, our proposed unsupervised
algorithm achieves a similar range of uncertainty while saving on the cost of
acquiring labeled data. Additionally, our method requires lower computational
power compared to most of the tested NILM algorithms. It was designed for
low-sampling-rate power measurement (every 15 min), which corresponds to the
frequency range of most common smart meters.
","[{'version': 'v1', 'created': 'Tue, 20 Aug 2019 15:04:00 GMT'}]",2021-09-16,"[['Holweger', 'Jordan', ''], ['Dorokhova', 'Marina', ''], ['Bloch', 'Lionel', ''], ['Ballif', 'Christophe', ''], ['Wyrsch', 'Nicolas', '']]","['Unsupervised energy disaggregation', 'Residential energy use', 'Non-Intrusive Load Monitoring', 'Markov Model']"
7625,2108.03662,Yang Bai,"Yang Bai, Junyan Wang, Yang Long, Bingzhang Hu, Yang Song, Maurice
  Pagnucco, Yu Guan",Discriminative Latent Semantic Graph for Video Captioning,accepted by ACM MM 2021,,10.1145/3474085.3475519,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video captioning aims to automatically generate natural language sentences
that can describe the visual contents of a given video. Existing generative
models like encoder-decoder frameworks cannot explicitly explore the
object-level interactions and frame-level information from complex
spatio-temporal data to generate semantic-rich captions. Our main contribution
is to identify three key problems in a joint framework for future video
summarization tasks. 1) Enhanced Object Proposal: we propose a novel
Conditional Graph that can fuse spatio-temporal information into latent object
proposal. 2) Visual Knowledge: Latent Proposal Aggregation is proposed to
dynamically extract visual words with higher semantic levels. 3) Sentence
Validation: A novel Discriminative Language Validator is proposed to verify
generated captions so that key semantic concepts can be effectively preserved.
Our experiments on two public datasets (MVSD and MSR-VTT) manifest significant
improvements over state-of-the-art approaches on all metrics, especially for
BLEU-4 and CIDEr. Our code is available at
https://github.com/baiyang4/D-LSG-Video-Caption.
","[{'version': 'v1', 'created': 'Sun, 8 Aug 2021 15:11:20 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Aug 2021 13:55:55 GMT'}]",2021-08-11,"[['Bai', 'Yang', ''], ['Wang', 'Junyan', ''], ['Long', 'Yang', ''], ['Hu', 'Bingzhang', ''], ['Song', 'Yang', ''], ['Pagnucco', 'Maurice', ''], ['Guan', 'Yu', '']]","['video captioning', 'graph neural networks', 'discriminative', 'semanticproposals']"
7626,2011.01512,Soroush Vosoughi Dr,"Lili Wang, Ying Lu, Chenghan Huang, Soroush Vosoughi",Embedding Node Structural Role Identity into Hyperbolic Space,"In Proceedings of the 29th ACM International Conference on
  Information and Knowledge Management (CIKM '20), October 19-23, 2020, Virtual
  Event, Ireland",,10.1145/3340531.3412102,,cs.SI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, there has been an interest in embedding networks in hyperbolic
space, since hyperbolic space has been shown to work well in capturing
graph/network structure as it can naturally reflect some properties of complex
networks. However, the work on network embedding in hyperbolic space has been
focused on microscopic node embedding. In this work, we are the first to
present a framework to embed the structural roles of nodes into hyperbolic
space. Our framework extends struct2vec, a well-known structural role
preserving embedding method, by moving it to a hyperboloid model. We evaluated
our method on four real-world and one synthetic network. Our results show that
hyperbolic space is more effective than euclidean space in learning latent
representations for the structural role of nodes.
","[{'version': 'v1', 'created': 'Tue, 3 Nov 2020 07:04:39 GMT'}]",2020-11-04,"[['Wang', 'Lili', ''], ['Lu', 'Ying', ''], ['Huang', 'Chenghan', ''], ['Vosoughi', 'Soroush', '']]","['Node Embedding', 'Network Embedding', 'Structural Identity', 'Representation Learning', 'Hyperbolic Space', 'Hyperboloid Model']"
7627,2104.06077,Xinyi Dai,"Xinyi Dai, Jianghao Lin, Weinan Zhang, Shuai Li, Weiwen Liu, Ruiming
  Tang, Xiuqiang He, Jianye Hao, Jun Wang, Yong Yu",An Adversarial Imitation Click Model for Information Retrieval,Accepted to WWW 2021,,10.1145/3442381.3449913,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Modern information retrieval systems, including web search, ads placement,
and recommender systems, typically rely on learning from user feedback. Click
models, which study how users interact with a ranked list of items, provide a
useful understanding of user feedback for learning ranking models. Constructing
""right"" dependencies is the key of any successful click model. However,
probabilistic graphical models (PGMs) have to rely on manually assigned
dependencies, and oversimplify user behaviors. Existing neural network based
methods promote PGMs by enhancing the expressive ability and allowing flexible
dependencies, but still suffer from exposure bias and inferior estimation. In
this paper, we propose a novel framework, Adversarial Imitation Click Model
(AICM), based on imitation learning. Firstly, we explicitly learn the reward
function that recovers users' intrinsic utility and underlying intentions.
Secondly, we model user interactions with a ranked list as a dynamic system
instead of one-step click prediction, alleviating the exposure bias problem.
Finally, we minimize the JS divergence through adversarial training and learn a
stable distribution of click sequences, which makes AICM generalize well across
different distributions of ranked lists. A theoretical analysis has indicated
that AICM reduces the exposure bias from $O(T^2)$ to $O(T)$. Our studies on a
public web search dataset show that AICM not only outperforms state-of-the-art
models in traditional click metrics but also achieves superior performance in
addressing the exposure bias and recovering the underlying patterns of click
sequences.
","[{'version': 'v1', 'created': 'Tue, 13 Apr 2021 10:17:55 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Apr 2021 05:41:07 GMT'}]",2021-04-20,"[['Dai', 'Xinyi', ''], ['Lin', 'Jianghao', ''], ['Zhang', 'Weinan', ''], ['Li', 'Shuai', ''], ['Liu', 'Weiwen', ''], ['Tang', 'Ruiming', ''], ['He', 'Xiuqiang', ''], ['Hao', 'Jianye', ''], ['Wang', 'Jun', ''], ['Yu', 'Yong', '']]","['Click Model', 'Imitation Learning', 'Document Ranking']"
7628,1910.13314,Bla\v{z} \v{S}krlj,"Blaz \v{S}krlj, Jan Kralj, Nada Lavra\v{c}",Symbolic Graph Embedding using Frequent Pattern Mining,Published at DS2019 conference as a full paper,,10.1007/978-3-030-33778-0_21,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Relational data mining is becoming ubiquitous in many fields of study. It
offers insights into behaviour of complex, real-world systems which cannot be
modeled directly using propositional learning. We propose Symbolic Graph
Embedding (SGE), an algorithm aimed to learn symbolic node representations.
Built on the ideas from the field of inductive logic programming, SGE first
samples a given node's neighborhood and interprets it as a transaction
database, which is used for frequent pattern mining to identify logical
conjuncts of items that co-occur frequently in a given context. Such patterns
are in this work used as features to represent individual nodes, yielding
interpretable, symbolic node embeddings. The proposed SGE approach on a venue
classification task outperforms shallow node embedding methods such as
DeepWalk, and performs similarly to metapath2vec, a black-box representation
learner that can exploit node and edge types in a given graph. The proposed SGE
approach performs especially well when small amounts of data are used for
learning, scales to graphs with millions of nodes and edges, and can be run on
an of-the-shelf laptop.
","[{'version': 'v1', 'created': 'Tue, 29 Oct 2019 15:13:18 GMT'}]",2019-10-30,"[['Škrlj', 'Blaz', ''], ['Kralj', 'Jan', ''], ['Lavrač', 'Nada', '']]","['Graphs', 'machine learning', 'relational data mining', 'symboliclearning', 'embedding']"
7629,1802.01039,Stefan Engblom,Stefan Engblom,"Stochastic simulation of pattern formation in growing tissue: a
  multilevel approach",,Bull. Math. Biol. (2018),10.1007/s11538-018-0454-y,,cs.CE q-bio.TO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We take up the challenge of designing realistic computational models of large
interacting cell populations. The goal is essentially to bring Gillespie's
celebrated stochastic methodology to the level of an interacting population of
cells. Specifically, we are interested in how the gold standard of single cell
computational modeling, here taken to be spatial stochastic reaction-diffusion
models, may be efficiently coupled with a similar approach at the cell
population level.
  Concretely, we target a recently proposed set of pathways for pattern
formation involving Notch-Delta signaling mechanisms. These involve
cell-to-cell communication as mediated both via direct membrane contact sites
as well as via cellular protrusions. We explain how to simulate the process in
growing tissue using a multilevel approach and we discuss implications for
future development of the associated computational methods.
","[{'version': 'v1', 'created': 'Sat, 3 Feb 2018 21:45:00 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jun 2018 09:08:12 GMT'}]",2018-10-26,"[['Engblom', 'Stefan', '']]","['Reaction-diffusion master equation', 'Discrete Laplaciancell mechanics', 'Single cell model', 'Cell population model', 'Notch signaling pathway']"
7630,2006.07309,Fateme Bafghi,"Fateme Bafghi, Bijan Shoushtarian","Multiple-Vehicle Tracking in the Highway Using Appearance Model and
  Visual Object Tracking",,,10.1109/MVIP49855.2020.9116905,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent decades, due to the groundbreaking improvements in machine vision,
many daily tasks are performed by computers. One of these tasks is
multiple-vehicle tracking, which is widely used in different areas such as
video surveillance and traffic monitoring. This paper focuses on introducing an
efficient novel approach with acceptable accuracy. This is achieved through an
efficient appearance and motion model based on the features extracted from each
object. For this purpose, two different approaches have been used to extract
features, i.e. features extracted from a deep neural network, and traditional
features. Then the results from these two approaches are compared with
state-of-the-art trackers. The results are obtained by executing the methods on
the UA-DETRACK benchmark. The first method led to 58.9% accuracy while the
second method caused up to 15.9%. The proposed methods can still be improved by
extracting more distinguishable features.
","[{'version': 'v1', 'created': 'Fri, 12 Jun 2020 16:46:12 GMT'}]",2020-07-07,"[['Bafghi', 'Fateme', ''], ['Shoushtarian', 'Bijan', '']]","['multiple-object tracking', 'feature extraction', 'deep']"
7631,2206.10495,Lynnette Hui Xian Ng,"Lynnette Hui Xian Ng, Kathleen M. Carley","Online Coordination: Methods and Comparative Case Studies of Coordinated
  Groups across Four Events in the United States",,,10.1145/1122445.1122456,,cs.SI physics.soc-ph,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Coordinated groups of user accounts working together in online social media
can be used to manipulate the online discourse and thus is an important area of
study. In this study, we work towards a general theory of coordination. There
are many ways to coordinate groups online: semantic, social, referral and many
more. Each represents a coordination dimension, where the more dimensions of
coordination are present for one event, the stronger the coordination present.
We build on existing approaches that detect coordinated groups by identifying
high levels of synchronized actions within a specified time window. A key
concern with this approach is the selection of the time window. We propose a
method that selects the optimal window size to accurately capture local
coordination while avoiding the capture of coincidental synchronicity. With
this enhanced method of coordination detection, we perform a comparative study
across four events: US Elections Primaries 2020, Reopen America 2020, Capitol
Riots 2021 and COVID Vaccine Release 2021. Herein, we explore the following
three dimensions of coordination for each event -- semantic, referral and
social coordination -- and perform group and user analysis within and among the
events. This allows us to expose different user coordination behavior patterns
and identify narratives and user support themes, hence estimating the degree
and theme of coordination.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2022 16:08:53 GMT'}]",2022-06-22,"[['Ng', 'Lynnette Hui Xian', ''], ['Carley', 'Kathleen M.', '']]","['coordination detection', 'community clustering', 'narrative analysis', 'URL analysis', 'social network analysis']"
7632,1912.12883,Filiz Gurkan Golcuk,Filiz Gurkan and Bilge Gunsel,"Integration of Regularized l1 Tracking and Instance Segmentation for
  Video Object Tracking",,,10.1016/j.neucom.2020.09.072,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a tracking-by-detection method that integrates a deep object
detector with a particle filter tracker under the regularization framework
where the tracked object is represented by a sparse dictionary. A novel
observation model which establishes consensus between the detector and tracker
is formulated that enables us to update the dictionary with the guidance of the
deep detector. This yields an efficient representation of the object appearance
through the video sequence hence improves robustness to occlusion and pose
changes. Moreover we propose a new state vector consisting of translation,
rotation, scaling and shearing parameters that allows tracking the deformed
object bounding boxes hence significantly increases robustness to scale
changes. Numerical results reported on challenging VOT2016 and VOT2018
benchmarking data sets demonstrate that the introduced tracker, L1DPF-M,
achieves comparable robustness on both data sets while it outperforms
state-of-the-art trackers on both data sets where the improvement achieved in
success rate at IoU-th=0.5 is 11% and 9%, respectively.
","[{'version': 'v1', 'created': 'Mon, 30 Dec 2019 11:14:14 GMT'}]",2020-10-28,"[['Gurkan', 'Filiz', ''], ['Gunsel', 'Bilge', '']]","['Object tracking', 'regularized particle filtering', 'deep objectdetector', 'sparse representation']"
7633,2106.05858,Hao Wang,"Zhuo Wei, Hao Wang","Characterizing Residential Load Patterns by Household Demographic and
  Socioeconomic Factors","ACM International Conference on Future Energy Systems (ACM e-Energy)
  2021",,10.1145/3447555.3464867,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The wide adoption of smart meters makes residential load data available and
thus improves the understanding of the energy consumption behavior. Many
existing studies have focused on smart-meter data analysis, but the drivers of
energy consumption behaviors are not well understood. This paper aims to
characterize and estimate users' load patterns based on their demographic and
socioeconomic information. We adopt the symbolic aggregate approximation (SAX)
method to process the load data and use the K-Means method to extract key load
patterns. We develop a deep neural network (DNN) to analyze the relationship
between users' load patterns and their demographic and socioeconomic features.
Using real-world load data, we validate our framework and demonstrate the
connections between load patterns and household demographic and socioeconomic
features. We also take two regression models as benchmarks for comparisons.
","[{'version': 'v1', 'created': 'Fri, 4 Jun 2021 15:01:35 GMT'}]",2021-06-11,"[['Wei', 'Zhuo', ''], ['Wang', 'Hao', '']]","['Smart Meter', 'Symbolic Aggregate Approximation', 'Load Pattern', 'Clustering', 'Deep Neural Network']"
7634,2205.09388,Raffaele De Rose Dr.,"Raffaele De Rose, Tommaso Zanotti, Francesco Maria Puglisi, Felice
  Crupi, Paolo Pavan, Marco Lanuzza","Smart Material Implication Using Spin-Transfer Torque Magnetic Tunnel
  Junctions for Logic-in-Memory Computing",,Solid-State Electronics 2022,10.1016/j.sse.2022.108390,,cs.ET physics.app-ph,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Smart material implication (SIMPLY) logic has been recently proposed for the
design of energy-efficient Logic-in-Memory (LIM) architectures based on
non-volatile resistive memory devices. The SIMPLY logic is enabled by adding a
comparator to the conventional IMPLY scheme. This allows performing a
preliminary READ operation and hence the SET operation only in the case it is
actually required. This work explores the SIMPLY logic scheme using nanoscale
spin-transfer torque magnetic tunnel junction (STT-MTJ) devices. The
performance of the STT-MTJ based SIMPLY architecture is analyzed by varying the
load resistor and applied voltages to implement both READ and SET operations,
while also investigating the effect of temperature on circuit operation.
Obtained results show an existing tradeoff between error rate and energy
consumption, which can be effectively managed by properly setting the values of
load resistor and applied voltages. In addition, our analysis proves that
tracking the temperature dependence of the MTJ properties through a
proportional to absolute temperature (PTAT) reference voltage at the input of
the comparator is beneficial to mitigate the reliability degradation under
temperature variations.
","[{'version': 'v1', 'created': 'Thu, 19 May 2022 08:34:19 GMT'}]",2022-06-01,"[['De Rose', 'Raffaele', ''], ['Zanotti', 'Tommaso', ''], ['Puglisi', 'Francesco Maria', ''], ['Crupi', 'Felice', ''], ['Pavan', 'Paolo', ''], ['Lanuzza', 'Marco', '']]","['STT-MTJ', 'Logic-in-Memory', 'Material implication', 'SIMPLY', 'Compact modeling']"
7635,1602.06589,Edoardo Di Napoli,"Edoardo Di Napoli (1 and 4), Elmar Peise (2), Markus Hrywniak (3),
  Paolo Bientinesi (2) ((1) J\""ulich Supercomputing Centre, (2) AICES, RWTH
  Aachen University, (3) GRS, RWTH Aachen University, (4) J\""ulich Aachen
  Research Alliance -- High-performance Computing)","High-performance generation of the Hamiltonian and Overlap matrices in
  FLAPW methods","Second revised version. Corrected notation. Added acknowledgment. 30
  pages, 2 figures and two tables. Submitted to a Special Issue of Computer
  Physics Communication",,10.1016/j.cpc.2016.10.003,,cs.CE cs.DS cs.PF physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the greatest efforts of computational scientists is to translate the
mathematical model describing a class of physical phenomena into large and
complex codes. Many of these codes face the difficulty of implementing the
mathematical operations in the model in terms of low level optimized kernels
offering both performance and portability. Legacy codes suffer from the
additional curse of rigid design choices based on outdated performance metrics
(e.g. minimization of memory footprint). Using a representative code from the
Materials Science community, we propose a methodology to restructure the most
expensive operations in terms of an optimized combination of dense linear
algebra kernels. The resulting algorithm guarantees an increased performance
and an extended life span of this code enabling larger scale simulations.
","[{'version': 'v1', 'created': 'Sun, 21 Feb 2016 22:09:30 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Apr 2016 08:24:02 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Aug 2016 19:40:16 GMT'}]",2018-01-17,"[['Di Napoli', 'Edoardo', '', '1 and 4'], ['Peise', 'Elmar', ''], ['Hrywniak', 'Markus', ''], ['Bientinesi', 'Paolo', '']]","['Density Functional Theory', 'high-performance computing', 'dense linear algebra', 'matrix generation', 'performance portability', 'FLAPW', 'FLEUR']"
7636,2110.03049,Ehsan Haghighat,Ehsan Haghighat and Danial Amini and Ruben Juanes,"Physics-informed neural network simulation of multiphase poroelasticity
  using stress-split sequential training",,,10.1016/j.cma.2022.115141,,cs.LG cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Physics-informed neural networks (PINNs) have received significant attention
as a unified framework for forward, inverse, and surrogate modeling of problems
governed by partial differential equations (PDEs). Training PINNs for forward
problems, however, pose significant challenges, mainly because of the complex
non-convex and multi-objective loss function. In this work, we present a PINN
approach to solving the equations of coupled flow and deformation in porous
media for both single-phase and multiphase flow. To this end, we construct the
solution space using multi-layer neural networks. Due to the dynamics of the
problem, we find that incorporating multiple differential relations into the
loss function results in an unstable optimization problem, meaning that
sometimes it converges to the trivial null solution, other times it moves very
far from the expected solution. We report a dimensionless form of the coupled
governing equations that we find most favourable to the optimizer.
Additionally, we propose a sequential training approach based on the
stress-split algorithms of poromechanics. Notably, we find that sequential
training based on stress-split performs well for different problems, while the
classical strain-split algorithm shows an unstable behaviour similar to what is
reported in the context of finite element solvers. We use the approach to solve
benchmark problems of poroelasticity, including Mandel's consolidation problem,
Barry-Mercer's injection-production problem, and a reference two-phase drainage
problem. The Python-SciANN codes reproducing the results reported in this
manuscript will be made publicly available at
https://github.com/sciann/sciann-applications.
","[{'version': 'v1', 'created': 'Wed, 6 Oct 2021 20:09:09 GMT'}]",2022-06-22,"[['Haghighat', 'Ehsan', ''], ['Amini', 'Danial', ''], ['Juanes', 'Ruben', '']]","['PINN', 'Deep Learning', 'Sequential Training', 'Poromechanics', 'Coupled Problems', 'SciANN']"
7637,1907.00713,Robert Sison,"Robert Sison (Data61, CSIRO and UNSW Sydney), Toby Murray (University
  of Melbourne)","Verifying that a compiler preserves concurrent value-dependent
  information-flow security","To appear in the 10th International Conference on Interactive Theorem
  Proving (ITP 2019). Extended version with appendix. For supplement material,
  see https://covern.org/itp19.html",,10.4230/LIPIcs.ITP.2019.27,,cs.LO cs.CR cs.PL,http://creativecommons.org/licenses/by/4.0/,"  It is common to prove by reasoning over source code that programs do not leak
sensitive data. But doing so leaves a gap between reasoning and reality that
can only be filled by accounting for the behaviour of the compiler. This task
is complicated when programs enforce value-dependent information-flow security
properties (in which classification of locations can vary depending on values
in other locations) and complicated further when programs exploit
shared-variable concurrency.
  Prior work has formally defined a notion of concurrency-aware refinement for
preserving value-dependent security properties. However, that notion is
considerably more complex than standard refinement definitions typically
applied in the verification of semantics preservation by compilers. To date it
remains unclear whether it can be applied to a realistic compiler, because
there exist no general decomposition principles for separating it into smaller,
more familiar, proof obligations.
  In this work, we provide such a decomposition principle, which we show can
almost halve the complexity of proving secure refinement. Further, we
demonstrate its applicability to secure compilation, by proving in Isabelle/HOL
the preservation of value-dependent security by a proof-of-concept compiler
from an imperative While language to a generic RISC-style assembly language,
for programs with shared-memory concurrency mediated by locking primitives.
Finally, we execute our compiler in Isabelle on a While language model of the
Cross Domain Desktop Compositor, demonstrating to our knowledge the first use
of a compiler verification result to carry an information-flow security
property down to the assembly-level model of a non-trivial concurrent program.
","[{'version': 'v1', 'created': 'Mon, 1 Jul 2019 12:34:15 GMT'}]",2020-10-23,"[['Sison', 'Robert', '', 'Data61, CSIRO and UNSW Sydney'], ['Murray', 'Toby', '', 'University\n  of Melbourne']]","['Secure compilation', 'Information flow security', 'Concurrency', 'Verification']"
7638,2104.08431,Stephen MacDonell,"Paolo Tell, Stephen MacDonell and Sherlock A. Licorish","3rd Workshop on Hybrid Development Approaches in Software System
  Development","Article/Book Chapter, 5 pages, 1 figure, 2 tables","Product-Focused Software Process Improvement (PROFES 2018) Lecture
  Notes in Computer Science, vol 11271, pp.433-440",10.1007/978-3-030-03673-7_34,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evidence shows that software development methods, frameworks, and even
practices are seldom applied in companies by following the book. Combinations
of different methodologies into home-grown processes are being constantly
uncovered. Nonetheless, an academic understanding and investigation of this
phenomenon is very limited. In 2016, the HELENA initiative was launched to
research hybrid development approaches in software system development. This
paper introduces the 3rd HELENA workshop and provides a detailed description of
the instrument used and the available data sets.
","[{'version': 'v1', 'created': 'Sat, 17 Apr 2021 03:25:07 GMT'}]",2021-04-20,"[['Tell', 'Paolo', ''], ['MacDonell', 'Stephen', ''], ['Licorish', 'Sherlock A.', '']]","['software reuse', 'software evolution', 'empirical study', 'Eclipse']"
7639,2108.03107,Sarah Turner,Sarah Turner and Jason R.C. Nurse and Shujun Li,"When Googling it doesn't work: The challenge of finding security advice
  for smart home devices",,,10.1007/978-3-030-81111-2_10,,cs.CR cs.CY,http://creativecommons.org/licenses/by/4.0/,"  As users increasingly introduce Internet-connected devices into their homes,
having access to accurate and relevant cyber security information is a
fundamental means of ensuring safe use. Given the paucity of information
provided with many devices at the time of purchase, this paper engages in a
critical study of the type of advice that home Internet of Things (IoT) or
smart device users might be presented with on the Internet to inform their
cyber security practices. We base our research on an analysis of 427 web pages
from 234 organisations that present information on security threats and
relevant cyber security advice. The results show that users searching online
for information are subject to an enormous range of advice and news from
various sources with differing levels of credibility and relevance. With no
clear explanation of how a user may assess the threats as they are pertinent to
them, it becomes difficult to understand which pieces of advice would be the
most effective in their situation. Recommendations are made to improve the
clarity, consistency and availability of guidance from recognised sources to
improve user access and understanding.
","[{'version': 'v1', 'created': 'Fri, 6 Aug 2021 13:13:49 GMT'}]",2022-06-22,"[['Turner', 'Sarah', ''], ['Nurse', 'Jason R. C.', ''], ['Li', 'Shujun', '']]","['Internet of Things', 'Cyber Security', 'Smart Home', 'CyberSecurity Advice', 'Information', 'Online Search', 'Connected Home']"
7640,1910.07038,Avi Ben-Cohen,"Hussam Lawen, Avi Ben-Cohen, Matan Protter, Itamar Friedman, Lihi
  Zelnik-Manor",Compact Network Training for Person ReID,,,10.1145/3372278.3390686,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The task of person re-identification (ReID) has attracted growing attention
in recent years leading to improved performance, albeit with little focus on
real-world applications. Most SotA methods are based on heavy pre-trained
models, e.g. ResNet50 (~25M parameters), which makes them less practical and
more tedious to explore architecture modifications. In this study, we focus on
a small-sized randomly initialized model that enables us to easily introduce
architecture and training modifications suitable for person ReID. The outcomes
of our study are a compact network and a fitting training regime. We show the
robustness of the network by outperforming the SotA on both Market1501 and
DukeMTMC. Furthermore, we show the representation power of our ReID network via
SotA results on a different task of multi-object tracking.
","[{'version': 'v1', 'created': 'Tue, 15 Oct 2019 20:16:55 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Oct 2019 15:08:35 GMT'}, {'version': 'v3', 'created': 'Thu, 9 Apr 2020 08:17:01 GMT'}]",2020-04-10,"[['Lawen', 'Hussam', ''], ['Ben-Cohen', 'Avi', ''], ['Protter', 'Matan', ''], ['Friedman', 'Itamar', ''], ['Zelnik-Manor', 'Lihi', '']]","['Deep person ReID', 'multi-object tracking', 'compact network']"
7641,1801.06846,Lu\'is M. S. Russo,"Lu\'is M. S. Russo and Andreia Sofia Teixeira and Alexandre P
  Francisco",Linking and Cutting Spanning Trees,"This research has received funding from the European Union's Horizon
  2020 research and innovation programme under the Marie Sklodowska-Curie
  Actions H2020-MSCA-RISE-2015 BIRDS GA No. 690941. Prototype implementation at
  https://github.com/LuisRusso-INESC-ID/LinkCutSpanningTrees","Algorithms 2018, 11(4), 53",10.3390/a11040053,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of uniformly generating a spanning tree, of a
connected undirected graph. This process is useful to compute statistics,
namely for phylogenetic trees. We describe a Markov chain for producing these
trees. For cycle graphs we prove that this approach significantly outperforms
existing algorithms. For general graphs we obtain no analytical bounds, but
experimental results show that the chain still converges quickly. This yields
an efficient algorithm, also due to the use of proper fast data structures. To
bound the mixing time of the chain we describe a coupling, which we analyse for
cycle graphs and simulate for other graphs.
","[{'version': 'v1', 'created': 'Sun, 21 Jan 2018 16:30:50 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Jan 2020 18:38:37 GMT'}, {'version': 'v3', 'created': 'Tue, 7 Jul 2020 15:20:29 GMT'}]",2020-07-08,"[['Russo', 'Luís M. S.', ''], ['Teixeira', 'Andreia Sofia', ''], ['Francisco', 'Alexandre P', '']]","['Spanning Tree', 'Uniform Generation', 'Markov Chain', 'Mixing Time', 'Link Cut Tree']"
7642,2010.03847,Serhii Nazarovets,Serhii Nazarovets,"Quantitative analysis of the co-publications of Ukrainian scientists
  with the Nobel laureates 1994-2018 in Science",,"Sci. innov. 2020. V. 16, no. 5",10.15407/scin16.05.110,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Nobel Prize is awarded annually for outstanding scientific discoveries
and inventions. Most scientific papers today are co-authored by a large number
of researchers. However, very few scientists can receive the Nobel Prize
according to the Statutes of the Nobel Foundation. An analysis of the
co-authorship of the Nobel laureates will make it possible to identify
employees of Ukrainian institutions who have collaborated with leading
scientists of the world, whose scientific works were noted by Nobel. For the
development of science in Ukraine it is important to study the successful
experience of cooperation of domestic research institutions with leading world
scientists and research centers, because international scientific collaboration
facilitates the process of acquiring new knowledge, promotes mutual enrichment
of ideas, efficient use of resources and expands opportunities for further use
of research results. Using the Scopus database, selected publications of Nobel
Prize winners, which were written in collaboration with scientists who worked
in Ukrainian institutions. The data obtained indicate that the employees of
scientific institutions of Ukraine published very few papers in collaborations
with Nobel Prize winners of 1994-2018 in comparison with employees of
institutions in leading countries in publishing activity.
","[{'version': 'v1', 'created': 'Thu, 8 Oct 2020 09:02:49 GMT'}]",2021-06-17,"[['Nazarovets', 'Serhii', '']]","['Nobel Prize', 'Nobel Prize laureates', 'employees of Ukrainian institutions', 'co-authors', 'quantitative analysis']"
7643,2209.10637,Taha Tekdogan,"Taha Tekdogan, Ali Cakmak","Benchmarking Apache Spark and Hadoop MapReduce on Big Data
  Classification","2021 5th International Conference on Cloud and Big Data Computing
  (ICCBDC 2021)","ICCBDC 2021. Association for Computing Machinery, New York, NY,
  USA, pages 15-20 (2021)",10.1145/3481646.3481649,ISBN: 9781450390408,cs.DC cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Most of the popular Big Data analytics tools evolved to adapt their working
environment to extract valuable information from a vast amount of unstructured
data. The ability of data mining techniques to filter this helpful information
from Big Data led to the term Big Data Mining. Shifting the scope of data from
small-size, structured, and stable data to huge volume, unstructured, and
quickly changing data brings many data management challenges. Different tools
cope with these challenges in their own way due to their architectural
limitations. There are numerous parameters to take into consideration when
choosing the right data management framework based on the task at hand. In this
paper, we present a comprehensive benchmark for two widely used Big Data
analytics tools, namely Apache Spark and Hadoop MapReduce, on a common data
mining task, i.e., classification. We employ several evaluation metrics to
compare the performance of the benchmarked frameworks, such as execution time,
accuracy, and scalability. These metrics are specialized to measure the
performance for classification task. To the best of our knowledge, there is no
previous study in the literature that employs all these metrics while taking
into consideration task-specific concerns. We show that Spark is 5 times faster
than MapReduce on training the model. Nevertheless, the performance of Spark
degrades when the input workload gets larger. Scaling the environment by
additional clusters significantly improves the performance of Spark. However,
similar enhancement is not observed in Hadoop. Machine learning utility of
MapReduce tend to have better accuracy scores than that of Spark, like around
3%, even in small size data sets.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2022 20:08:37 GMT'}]",2022-09-23,"[['Tekdogan', 'Taha', ''], ['Cakmak', 'Ali', '']]","['Big Data', 'Data Mining', 'Classification']"
7644,2208.01741,Johan Lin{\aa}ker,"Johan Lin{\aa}ker, Bj\""orn Regnell, Hussan Munir",Requirements engineering in open innovation: a research agenda,,,10.1145/2785592.2795370,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  In recent years Open Innovation (OI) has gained much attention and made firms
aware that they need to consider the open environment surrounding them. To
facilitate this shift Requirements Engineering (RE) needs to be adapted in
order to manage the increase and complexity of new requirements sources as well
as networks of stakeholders. In response we build on and advance an earlier
proposed software engineering framework for fostering OI, focusing on
stakeholder management, when to open up, and prioritization and release
planning. Literature in open source RE is contrasted against recent findings of
OI in software engineering to establish a current view of the area. Based on
the synthesized findings we propose a research agenda within the areas under
focus, along with a framing-model to help researchers frame and break down
their research questions to consider the different angles implied by the OI
model.
","[{'version': 'v1', 'created': 'Sun, 31 Jul 2022 19:31:55 GMT'}]",2022-08-04,"[['Linåker', 'Johan', ''], ['Regnell', 'Björn', ''], ['Munir', 'Hussan', '']]","['Software engineering', 'Requirements engineering', 'Open innovation', 'Open source', 'Stakeholder management', 'Prioritization', 'Release planning']"
7645,2010.02809,Yuqi Si,"Yuqi Si, Jingcheng Du, Zhao Li, Xiaoqian Jiang, Timothy Miller, Fei
  Wang, W. Jim Zheng, Kirk Roberts","Deep Representation Learning of Patient Data from Electronic Health
  Records (EHR): A Systematic Review",,,10.1016/j.jbi.2020.103671,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Patient representation learning refers to learning a dense mathematical
representation of a patient that encodes meaningful information from Electronic
Health Records (EHRs). This is generally performed using advanced deep learning
methods. This study presents a systematic review of this field and provides
both qualitative and quantitative analyses from a methodological perspective.
We identified studies developing patient representations from EHRs with deep
learning methods from MEDLINE, EMBASE, Scopus, the Association for Computing
Machinery (ACM) Digital Library, and Institute of Electrical and Electronics
Engineers (IEEE) Xplore Digital Library. After screening 363 articles, 49
papers were included for a comprehensive data collection. We noticed a typical
workflow starting with feeding raw data, applying deep learning models, and
ending with clinical outcome predictions as evaluations of the learned
representations. Specifically, learning representations from structured EHR
data was dominant (37 out of 49 studies). Recurrent Neural Networks were widely
applied as the deep learning architecture (LSTM: 13 studies, GRU: 11 studies).
Disease prediction was the most common application and evaluation (31 studies).
Benchmark datasets were mostly unavailable (28 studies) due to privacy concerns
of EHR data, and code availability was assured in 20 studies. We show the
importance and feasibility of learning comprehensive representations of patient
EHR data through a systematic review. Advances in patient representation
learning techniques will be essential for powering patient-level EHR analyses.
Future work will still be devoted to leveraging the richness and potential of
available EHR data. Knowledge distillation and advanced learning techniques
will be exploited to assist the capability of learning patient representation
further.
","[{'version': 'v1', 'created': 'Tue, 6 Oct 2020 15:18:02 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Nov 2020 16:24:43 GMT'}]",2021-01-26,"[['Si', 'Yuqi', ''], ['Du', 'Jingcheng', ''], ['Li', 'Zhao', ''], ['Jiang', 'Xiaoqian', ''], ['Miller', 'Timothy', ''], ['Wang', 'Fei', ''], ['Zheng', 'W. Jim', ''], ['Roberts', 'Kirk', '']]","['Systematic review', 'Electronic health records', 'Patient representation', 'Deep learning']"
7646,2001.09233,Kit Rodolfa,"Kit T. Rodolfa, Erika Salomon, Lauren Haynes, Ivan Higuera Mendieta,
  Jamie Larson, Rayid Ghani","Case Study: Predictive Fairness to Reduce Misdemeanor Recidivism Through
  Social Service Interventions","12 pages, 4 figures, 1 algorithm. The definitive Version of Record
  will be published in the proceedings of the Conference on Fairness,
  Accountability, and Transparency (FAT* '20), January 27-30, 2020, Barcelona,
  Spain",,10.1145/3351095.3372863,,cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The criminal justice system is currently ill-equipped to improve outcomes of
individuals who cycle in and out of the system with a series of misdemeanor
offenses. Often due to constraints of caseload and poor record linkage, prior
interactions with an individual may not be considered when an individual comes
back into the system, let alone in a proactive manner through the application
of diversion programs. The Los Angeles City Attorney's Office recently created
a new Recidivism Reduction and Drug Diversion unit (R2D2) tasked with reducing
recidivism in this population. Here we describe a collaboration with this new
unit as a case study for the incorporation of predictive equity into machine
learning based decision making in a resource-constrained setting. The program
seeks to improve outcomes by developing individually-tailored social service
interventions (i.e., diversions, conditional plea agreements, stayed
sentencing, or other favorable case disposition based on appropriate social
service linkage rather than traditional sentencing methods) for individuals
likely to experience subsequent interactions with the criminal justice system,
a time and resource-intensive undertaking that necessitates an ability to focus
resources on individuals most likely to be involved in a future case. Seeking
to achieve both efficiency (through predictive accuracy) and equity (improving
outcomes in traditionally under-served communities and working to mitigate
existing disparities in criminal justice outcomes), we discuss the equity
outcomes we seek to achieve, describe the corresponding choice of a metric for
measuring predictive fairness in this context, and explore a set of options for
balancing equity and efficiency when building and selecting machine learning
models in an operational public policy setting.
","[{'version': 'v1', 'created': 'Fri, 24 Jan 2020 23:52:55 GMT'}]",2020-01-28,"[['Rodolfa', 'Kit T.', ''], ['Salomon', 'Erika', ''], ['Haynes', 'Lauren', ''], ['Mendieta', 'Ivan Higuera', ''], ['Larson', 'Jamie', ''], ['Ghani', 'Rayid', '']]","['Algorithmic Fairness', 'Machine Learning Disparities', 'Racial Bias', 'Criminal Justice']"
7647,2106.02705,Yuyan Wang,"Yuyan Wang, Xuezhi Wang, Alex Beutel, Flavien Prost, Jilin Chen, Ed H.
  Chi","Understanding and Improving Fairness-Accuracy Trade-offs in Multi-Task
  Learning",,,10.1145/3447548.3467326,,cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  As multi-task models gain popularity in a wider range of machine learning
applications, it is becoming increasingly important for practitioners to
understand the fairness implications associated with those models. Most
existing fairness literature focuses on learning a single task more fairly,
while how ML fairness interacts with multiple tasks in the joint learning
setting is largely under-explored. In this paper, we are concerned with how
group fairness (e.g., equal opportunity, equalized odds) as an ML fairness
concept plays out in the multi-task scenario. In multi-task learning, several
tasks are learned jointly to exploit task correlations for a more efficient
inductive transfer. This presents a multi-dimensional Pareto frontier on (1)
the trade-off between group fairness and accuracy with respect to each task, as
well as (2) the trade-offs across multiple tasks. We aim to provide a deeper
understanding on how group fairness interacts with accuracy in multi-task
learning, and we show that traditional approaches that mainly focus on
optimizing the Pareto frontier of multi-task accuracy might not perform well on
fairness goals. We propose a new set of metrics to better capture the
multi-dimensional Pareto frontier of fairness-accuracy trade-offs uniquely
presented in a multi-task learning setting. We further propose a
Multi-Task-Aware Fairness (MTA-F) approach to improve fairness in multi-task
learning. Experiments on several real-world datasets demonstrate the
effectiveness of our proposed approach.
","[{'version': 'v1', 'created': 'Fri, 4 Jun 2021 20:28:54 GMT'}]",2021-06-08,"[['Wang', 'Yuyan', ''], ['Wang', 'Xuezhi', ''], ['Beutel', 'Alex', ''], ['Prost', 'Flavien', ''], ['Chen', 'Jilin', ''], ['Chi', 'Ed H.', '']]","['fairness', 'multi-task learning', 'Pareto frontier', 'multi-task-aware fairness treatment']"
7648,1912.12068,Muhammad Haroon Shakeel,"Muhammad Haroon Shakeel, Asim Karim, Imdadullah Khan","A Multi-cascaded Model with Data Augmentation for Enhanced Paraphrase
  Detection in Short Texts",,"Information Processing & Management, Volume 57, Issue 3, May 2020,
  102204",10.1016/j.ipm.2020.102204,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Paraphrase detection is an important task in text analytics with numerous
applications such as plagiarism detection, duplicate question identification,
and enhanced customer support helpdesks. Deep models have been proposed for
representing and classifying paraphrases. These models, however, require large
quantities of human-labeled data, which is expensive to obtain. In this work,
we present a data augmentation strategy and a multi-cascaded model for improved
paraphrase detection in short texts. Our data augmentation strategy considers
the notions of paraphrases and non-paraphrases as binary relations over the set
of texts. Subsequently, it uses graph theoretic concepts to efficiently
generate additional paraphrase and non-paraphrase pairs in a sound manner. Our
multi-cascaded model employs three supervised feature learners (cascades) based
on CNN and LSTM networks with and without soft-attention. The learned features,
together with hand-crafted linguistic features, are then forwarded to a
discriminator network for final classification. Our model is both wide and deep
and provides greater robustness across clean and noisy short texts. We evaluate
our approach on three benchmark datasets and show that it produces a comparable
or state-of-the-art performance on all three.
","[{'version': 'v1', 'created': 'Fri, 27 Dec 2019 12:10:10 GMT'}]",2020-01-16,"[['Shakeel', 'Muhammad Haroon', ''], ['Karim', 'Asim', ''], ['Khan', 'Imdadullah', '']]","['paraphrase detection', 'deep learning', 'data augmentation', 'sentence similarity']"
7649,1903.06469,Dima Kagan,"Dima Kagan, Thomas Chesney, Michael Fire",Using Data Science to Understand the Film Industry's Gender Gap,,"Palgrave Commun 6, 92 (2020)",10.1057/s41599-020-0436-1,,cs.SI cs.CY physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data science can offer answers to a wide range of social science questions.
Here we turn attention to the portrayal of women in movies, an industry that
has a significant influence on society, impacting such aspects of life as
self-esteem and career choice. To this end, we fused data from the online movie
database IMDb with a dataset of movie dialogue subtitles to create the largest
available corpus of movie social networks (15,540 networks). Analyzing this
data, we investigated gender bias in on-screen female characters over the past
century. We find a trend of improvement in all aspects of women`s roles in
movies, including a constant rise in the centrality of female characters. There
has also been an increase in the number of movies that pass the well-known
Bechdel test, a popular--albeit flawed--measure of women in fiction. Here we
propose a new and better alternative to this test for evaluating female roles
in movies. Our study introduces fresh data, an open-code framework, and novel
techniques that present new opportunities in the research and analysis of
movies.
","[{'version': 'v1', 'created': 'Fri, 15 Mar 2019 11:22:56 GMT'}, {'version': 'v2', 'created': 'Sun, 24 Mar 2019 19:04:04 GMT'}, {'version': 'v3', 'created': 'Tue, 6 Aug 2019 16:17:34 GMT'}]",2020-06-16,"[['Kagan', 'Dima', ''], ['Chesney', 'Thomas', ''], ['Fire', 'Michael', '']]","['Data Science', 'Network Science', 'Gender Gap', 'Social Networks']"
7650,2205.10008,Nagita Mehr Seresht,Nagita Mehrseresht,Action parsing using context features,,"International Conference on Digital Image Computing: Techniques
  and Applications (DICTA), 2017, pp. 1-7",10.1109/DICTA.2017.8227399,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an action parsing algorithm to parse a video sequence containing
an unknown number of actions into its action segments. We argue that context
information, particularly the temporal information about other actions in the
video sequence, is valuable for action segmentation. The proposed parsing
algorithm temporally segments the video sequence into action segments. The
optimal temporal segmentation is found using a dynamic programming search
algorithm that optimizes the overall classification confidence score. The
classification score of each segment is determined using local features
calculated from that segment as well as context features calculated from other
candidate action segments of the sequence. Experimental results on the
Breakfast activity data-set showed improved segmentation accuracy compared to
existing state-of-the-art parsing techniques.
","[{'version': 'v1', 'created': 'Fri, 20 May 2022 07:54:04 GMT'}]",2022-05-23,"[['Mehrseresht', 'Nagita', '']]","['joint segmentation and classification', 'action parsing', 'temporal context features']"
7651,2101.00346,John Hawkins,John Hawkins,Minimum Viable Model Estimates for Machine Learning Projects,"11 pages, 4 figures","Proceedings of the 6th International Conference on Computer
  Science, Engineering And Applications (CSEA 2020), December 18 ~ 19, pp.
  37-46, Volume 10, Number 18",10.5121/csit.2020.101803,,cs.LG cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Prioritization of machine learning projects requires estimates of both the
potential ROI of the business case and the technical difficulty of building a
model with the required characteristics. In this work we present a technique
for estimating the minimum required performance characteristics of a predictive
model given a set of information about how it will be used. This technique will
result in robust, objective comparisons between potential projects. The
resulting estimates will allow data scientists and managers to evaluate whether
a proposed machine learning project is likely to succeed before any modelling
needs to be done.
  The technique has been implemented into the open source application MinViME
(Minimum Viable Model Estimator) which can be installed via the PyPI python
package management system, or downloaded directly from the GitHub repository.
Available at https://github.com/john-hawkins/MinViME
","[{'version': 'v1', 'created': 'Sat, 2 Jan 2021 01:01:20 GMT'}]",2021-01-05,"[['Hawkins', 'John', '']]","['Artificial Intelligence', 'ROI Estimation', 'Machine Learning Metrics', 'Cost Sensitive Learning']"
7652,2002.11645,Daniele Rama,"Daniele Rama, Yelena Mejova, Michele Tizzoni, Kyriaki Kalimeri, Ingmar
  Weber",Facebook Ads as a Demographic Tool to Measure the Urban-Rural Divide,"To be published in the Proceedings of The Web Conference 2020 (WWW
  '20)",Proceedings of The Web Conference 2020 (WWW '20) 327-338,10.1145/3366423.3380118,,cs.CY cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the global move toward urbanization, making sure the people remaining in
rural areas are not left behind in terms of development and policy
considerations is a priority for governments worldwide. However, it is
increasingly challenging to track important statistics concerning this sparse,
geographically dispersed population, resulting in a lack of reliable,
up-to-date data. In this study, we examine the usefulness of the Facebook
Advertising platform, which offers a digital ""census"" of over two billions of
its users, in measuring potential rural-urban inequalities. We focus on Italy,
a country where about 30% of the population lives in rural areas. First, we
show that the population statistics that Facebook produces suffer from
instability across time and incomplete coverage of sparsely populated
municipalities. To overcome such limitation, we propose an alternative
methodology for estimating Facebook Ads audiences that nearly triples the
coverage of the rural municipalities from 19% to 55% and makes feasible
fine-grained sub-population analysis. Using official national census data, we
evaluate our approach and confirm known significant urban-rural divides in
terms of educational attainment and income. Extending the analysis to
Facebook-specific user ""interests"" and behaviors, we provide further insights
on the divide, for instance, finding that rural areas show a higher interest in
gambling. Notably, we find that the most predictive features of income in rural
areas differ from those for urban centres, suggesting researchers need to
consider a broader range of attributes when examining rural wellbeing. The
findings of this study illustrate the necessity of improving existing tools and
methodologies to include under-represented populations in digital demographic
studies -- the failure to do so could result in misleading observations,
conclusions, and most importantly, policies.
","[{'version': 'v1', 'created': 'Wed, 26 Feb 2020 17:19:24 GMT'}]",2020-04-23,"[['Rama', 'Daniele', ''], ['Mejova', 'Yelena', ''], ['Tizzoni', 'Michele', ''], ['Kalimeri', 'Kyriaki', ''], ['Weber', 'Ingmar', '']]","['digital demography', 'online advertising', 'social networks', 'urbanrural divide']"
7653,2105.13810,Benjamin Maschler,"Benjamin Lindemann, Benjamin Maschler, Nada Sahlab, and Michael
  Weyrich",A Survey on Anomaly Detection for Technical Systems using LSTM Networks,"14 pages, 6 figures, 4 tables. Accepted for publication by Computers
  in Industry",,10.1016/j.compind.2021.103498,,cs.LG cs.AI stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Anomalies represent deviations from the intended system operation and can
lead to decreased efficiency as well as partial or complete system failure. As
the causes of anomalies are often unknown due to complex system dynamics,
efficient anomaly detection is necessary. Conventional detection approaches
rely on statistical and time-invariant methods that fail to address the complex
and dynamic nature of anomalies. With advances in artificial intelligence and
increasing importance for anomaly detection and prevention in various domains,
artificial neural network approaches enable the detection of more complex
anomaly types while considering temporal and contextual characteristics. In
this article, a survey on state-of-the-art anomaly detection using deep neural
and especially long short-term memory networks is conducted. The investigated
approaches are evaluated based on the application scenario, data and anomaly
types as well as further metrics. To highlight the potential of upcoming
anomaly detection techniques, graph-based and transfer learning approaches are
also included in the survey, enabling the analysis of heterogeneous data as
well as compensating for its shortage and improving the handling of dynamic
processes.
","[{'version': 'v1', 'created': 'Fri, 28 May 2021 13:24:40 GMT'}]",2021-08-31,"[['Lindemann', 'Benjamin', ''], ['Maschler', 'Benjamin', ''], ['Sahlab', 'Nada', ''], ['Weyrich', 'Michael', '']]","['Anomaly Detection', 'Artificial Intelligence', 'Autoencoder', 'Context Modeling', 'Long Short-Term Memory', 'Transfer Learning']"
7654,2003.12122,Kyungjun Lee,"Kyungjun Lee, Daisuke Sato, Saki Asakawa, Hernisa Kacorri, Chieko
  Asakawa","Pedestrian Detection with Wearable Cameras for the Blind: A Two-way
  Perspective","The 2020 ACM CHI Conference on Human Factors in Computing Systems
  (CHI 2020)",,10.1145/3313831.3376398,,cs.HC cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Blind people have limited access to information about their surroundings,
which is important for ensuring one's safety, managing social interactions, and
identifying approaching pedestrians. With advances in computer vision, wearable
cameras can provide equitable access to such information. However, the
always-on nature of these assistive technologies poses privacy concerns for
parties that may get recorded. We explore this tension from both perspectives,
those of sighted passersby and blind users, taking into account camera
visibility, in-person versus remote experience, and extracted visual
information. We conduct two studies: an online survey with MTurkers (N=206) and
an in-person experience study between pairs of blind (N=10) and sighted (N=40)
participants, where blind participants wear a working prototype for pedestrian
detection and pass by sighted participants. Our results suggest that both of
the perspectives of users and bystanders and the several factors mentioned
above need to be carefully considered to mitigate potential social tensions.
","[{'version': 'v1', 'created': 'Thu, 26 Mar 2020 19:34:54 GMT'}, {'version': 'v2', 'created': 'Fri, 22 May 2020 19:17:38 GMT'}]",2020-05-26,"[['Lee', 'Kyungjun', ''], ['Sato', 'Daisuke', ''], ['Asakawa', 'Saki', ''], ['Kacorri', 'Hernisa', ''], ['Asakawa', 'Chieko', '']]","['wearable camera', 'accessibility', 'social acceptance', 'pedestriandetection', 'face recognition', 'crowdsourcing']"
7655,2112.03395,Giang Nguyen,"Giang Nguyen, Md Johir Islam, Rangeet Pan, and Hridesh Rajan",Manas: Mining Software Repositories to Assist AutoML,,,10.1145/3510003.3510052,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today deep learning is widely used for building software. A software
engineering problem with deep learning is that finding an appropriate
convolutional neural network (CNN) model for the task can be a challenge for
developers. Recent work on AutoML, more precisely neural architecture search
(NAS), embodied by tools like Auto-Keras aims to solve this problem by
essentially viewing it as a search problem where the starting point is a
default CNN model, and mutation of this CNN model allows exploration of the
space of CNN models to find a CNN model that will work best for the problem.
These works have had significant success in producing high-accuracy CNN models.
There are two problems, however. First, NAS can be very costly, often taking
several hours to complete. Second, CNN models produced by NAS can be very
complex that makes it harder to understand them and costlier to train them. We
propose a novel approach for NAS, where instead of starting from a default CNN
model, the initial model is selected from a repository of models extracted from
GitHub. The intuition being that developers solving a similar problem may have
developed a better starting point compared to the default model. We also
analyze common layer patterns of CNN models in the wild to understand changes
that the developers make to improve their models. Our approach uses commonly
occurring changes as mutation operators in NAS. We have extended Auto-Keras to
implement our approach. Our evaluation using 8 top voted problems from Kaggle
for tasks including image classification and image regression shows that given
the same search time, without loss of accuracy, Manas produces models with
42.9% to 99.6% fewer number of parameters than Auto-Keras' models. Benchmarked
on GPU, Manas' models train 30.3% to 641.6% faster than Auto-Keras' models.
","[{'version': 'v1', 'created': 'Mon, 6 Dec 2021 22:34:04 GMT'}, {'version': 'v2', 'created': 'Sun, 13 Feb 2022 10:54:06 GMT'}]",2022-02-15,"[['Nguyen', 'Giang', ''], ['Islam', 'Md Johir', ''], ['Pan', 'Rangeet', ''], ['Rajan', 'Hridesh', '']]","['Deep Learning', 'AutoML', 'Mining Software Repositories', 'MSR']"
7656,2101.10632,Frederik Hauser,"Frederik Hauser, Marco H\""aberle, Daniel Merling, Steffen Lindner,
  Vladimir Gurevich, Florian Zeiger, Reinhard Frank, Michael Menth","A Survey on Data Plane Programming with P4: Fundamentals, Advances, and
  Applied Research",,,10.1016/j.jnca.2022.103561,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Programmable data planes allow users to define their own data plane
algorithms for network devices including appropriate data plane application
programming interfaces (APIs) which may be leveraged by user-defined
software-defined networking (SDN) control. This offers great flexibility for
network customization, be it for specialized, commercial appliances, e.g., in
5G or data center networks, or for rapid prototyping in industrial and academic
research. Programming protocol-independent packet processors (P4) has emerged
as the currently most widespread abstraction, programming language, and concept
for data plane programming. It is developed and standardized by an open
community, and it is supported by various software and hardware platforms. In
the first part of this paper we give a tutorial of data plane programming
models, the P4 programming language, architectures, compilers, targets, and
data plane APIs. We also consider research efforts to advance P4 technology. In
the second part, we categorize a large body of literature of P4-based applied
research into different research domains, summarize the contributions of these
papers, and extract prototypes, target platforms, and source code availability.
For each research domain, we analyze how the reviewed works benefit from P4's
core features. Finally, we discuss potential next steps based on our findings.
","[{'version': 'v1', 'created': 'Tue, 26 Jan 2021 08:42:41 GMT'}, {'version': 'v2', 'created': 'Sat, 22 May 2021 08:52:24 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Aug 2021 08:01:57 GMT'}]",2023-01-18,"[['Hauser', 'Frederik', ''], ['Häberle', 'Marco', ''], ['Merling', 'Daniel', ''], ['Lindner', 'Steffen', ''], ['Gurevich', 'Vladimir', ''], ['Zeiger', 'Florian', ''], ['Frank', 'Reinhard', ''], ['Menth', 'Michael', '']]","['P4', 'SDN', 'programmable data planes']"
7657,2201.02615,Misgina Tsighe Hagos,"Tariku Adane Gelaw, Misgina Tsighe Hagos",Posture Prediction for Healthy Sitting using a Smart Chair,,"International Conference on Advances of Science and Technology
  2021, LNICST 411, pp 401-411",10.1007/978-3-030-93709-6_26,,cs.LG cs.AI eess.SP,http://creativecommons.org/licenses/by/4.0/,"  Poor sitting habits have been identified as a risk factor to musculoskeletal
disorders and lower back pain especially on the elderly, disabled people, and
office workers. In the current computerized world, even while involved in
leisure or work activity, people tend to spend most of their days sitting at
computer desks. This can result in spinal pain and related problems. Therefore,
a means to remind people about their sitting habits and provide recommendations
to counterbalance, such as physical exercise, is important. Posture recognition
for seated postures have not received enough attention as most works focus on
standing postures. Wearable sensors, pressure or force sensors, videos and
images were used for posture recognition in the literature. The aim of this
study is to build Machine Learning models for classifying sitting posture of a
person by analyzing data collected from a chair platted with two 32 by 32
pressure sensors at its seat and backrest. Models were built using five
algorithms: Random Forest (RF), Gaussian Na\""ive Bayes, Logistic Regression,
Support Vector Machine and Deep Neural Network (DNN). All the models are
evaluated using KFold cross-validation technique. This paper presents
experiments conducted using the two separate datasets, controlled and
realistic, and discusses results achieved at classifying six sitting postures.
Average classification accuracies of 98% and 97% were achieved on the
controlled and realistic datasets, respectively.
","[{'version': 'v1', 'created': 'Wed, 5 Jan 2022 20:31:28 GMT'}]",2022-01-11,"[['Gelaw', 'Tariku Adane', ''], ['Hagos', 'Misgina Tsighe', '']]","['Sitting posture', 'Smart chair', 'Pressure sensor', 'Deep Neural Networks', 'Prediction']"
7658,2003.00263,Eduardo Fernandez,"Eduardo Fern\'andez, Kai-ke Yang, Stijn Koppen, Pablo Alarc\'on, Simon
  Bauduin, Pierre Duysinx","Imposing minimum and maximum member size, minimum cavity size, and
  minimum separation distance between solid members in topology optimization",,,10.1016/j.cma.2020.113157,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper focuses on density-based topology optimization and proposes a
combined method to simultaneously impose Minimum length scale in the Solid
phase (MinSolid), Minimum length scale in the Void phase (MinVoid) and Maximum
length scale in the Solid phase (MaxSolid). MinSolid and MinVoid mean that the
size of solid parts and cavities must be greater than the size of a prescribed
circle or sphere. This is ensured through the robust design approach based on
eroded, intermediate and dilated designs. MaxSolid seeks to restrict the
formation of solid parts larger than a prescribed size, which is imposed
through local volume restrictions. In the first part of this article, we show
that by proportionally restricting the maximum size of the eroded, intermediate
and dilated designs, it is possible to obtain optimized designs satisfying,
simultaneously, MinSolid, MinVoid and MaxSolid. However, in spite of obtaining
designs with crisp boundaries, some results can be difficult to manufacture due
to the presence of multiple rounded cavities, which are introduced by the
maximum size restriction with the sole purpose of avoiding thick solid members
in the structure. To address this issue, in the second part of this article we
propose a new geometric constraint that seeks to control the minimum separation
distance between two solid members, also called the Minimum Gap (MinGap).
Differently from MinVoid, MinGap introduces large void areas that do not
necessarily have to be round. 2D and 3D test cases show that simultaneous
control of MinSolid, MinVoid, MaxSolid and MinGap can be useful to improve the
manufacturability of maximum size constrained designs.
","[{'version': 'v1', 'created': 'Sat, 29 Feb 2020 14:12:47 GMT'}]",2020-06-04,"[['Fernández', 'Eduardo', ''], ['Yang', 'Kai-ke', ''], ['Koppen', 'Stijn', ''], ['Alarcón', 'Pablo', ''], ['Bauduin', 'Simon', ''], ['Duysinx', 'Pierre', '']]","['Length Scale', 'Minimum Gap', 'Manufacturing Constraints', 'Filtering', 'SIMP']"
7659,2205.00718,Hermann Kroll,"Hermann Kroll and Florian Pl\""otzky and Jan Pirklbauer and Wolf-Tilo
  Balke","What a Publication Tells You -- Benefits of Narrative Information Access
  in Digital Libraries","Accepted at JCDL2022, 8 pages, 1 figure",,10.1145/3529372.3530928,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Knowledge bases allow effective access paths in digital libraries. Here users
can specify their information need as graph patterns for precise searches and
structured overviews (by allowing variables in queries). But especially when
considering textual sources that contain narrative information, i.e., short
stories of interest, harvesting statements from them to construct knowledge
bases may be a serious threat to the statements' validity. A piece of
information, originally stated in a coherent line of arguments, could be used
in a knowledge base query processing without considering its vital context
conditions. And this can lead to invalid results. That is why we argue to move
towards narrative information access by considering contexts in the query
processing step. In this way digital libraries can allow users to query for
narrative information and supply them with valid answers. In this paper we
define narrative information access, demonstrate its benefits for Covid 19
related questions, and argue on the generalizability for other domains such as
political sciences.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 08:14:40 GMT'}, {'version': 'v2', 'created': 'Tue, 3 May 2022 05:40:01 GMT'}, {'version': 'v3', 'created': 'Wed, 4 May 2022 05:59:06 GMT'}]",2022-05-05,"[['Kroll', 'Hermann', ''], ['Plötzky', 'Florian', ''], ['Pirklbauer', 'Jan', ''], ['Balke', 'Wolf-Tilo', '']]","['Narrative Information Access', 'Information Retrieval', 'Digital Libraries']"
7660,2101.02047,Mohammad Mahmudul Alam,"Mohammad Mahmudul Alam, Mohammad Tariqul Islam, S. M. Mahbubur Rahman","Unified Learning Approach for Egocentric Hand Gesture Recognition and
  Fingertip Detection","30 pages, 8 figures, Manuscript Accepted to the Pattern Recognition,
  Elsevier Science Publishers, 2021",,10.1016/j.patcog.2021.108200,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Head-mounted device-based human-computer interaction often requires
egocentric recognition of hand gestures and fingertips detection. In this
paper, a unified approach of egocentric hand gesture recognition and fingertip
detection is introduced. The proposed algorithm uses a single convolutional
neural network to predict the probabilities of finger class and positions of
fingertips in one forward propagation. Instead of directly regressing the
positions of fingertips from the fully connected layer, the ensemble of the
position of fingertips is regressed from the fully convolutional network.
Subsequently, the ensemble average is taken to regress the final position of
fingertips. Since the whole pipeline uses a single network, it is significantly
fast in computation. Experimental results show that the proposed method
outperforms the existing fingertip detection approaches including the Direct
Regression and the Heatmap-based framework. The effectiveness of the proposed
method is also shown in-the-wild scenario as well as in a use-case of virtual
reality.
","[{'version': 'v1', 'created': 'Wed, 6 Jan 2021 14:05:13 GMT'}, {'version': 'v2', 'created': 'Mon, 17 May 2021 23:53:55 GMT'}, {'version': 'v3', 'created': 'Thu, 22 Jul 2021 16:27:55 GMT'}]",2021-07-23,"[['Alam', 'Mohammad Mahmudul', ''], ['Islam', 'Mohammad Tariqul', ''], ['Rahman', 'S. M. Mahbubur', '']]","['Convolutional neural network', 'Fingertip detection', 'Gesture recognition', 'Human-computer interaction', 'Unified detection']"
7661,1806.04880,Stefan Wagner,"Peter Braun and Jan Philipps and Bernhard Sch\""atz and Stefan Wagner",Model-Based Safety-Cases for Software-Intensive Systems,"7 pages, 2 figures","Electronic Notes in Theoretical Computer Science, Volume 238,
  Issue 4, 28 September 2009, Pages 71-77",10.1016/j.entcs.2009.09.007,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Safety cases become increasingly important for software certification. Models
play a crucial role in building and combining information for the safety case.
This position paper sketches an ideal model-based safety case with defect
hypotheses and failure characterisations. From this, open research issues are
derived.
","[{'version': 'v1', 'created': 'Wed, 13 Jun 2018 08:01:20 GMT'}]",2018-06-14,"[['Braun', 'Peter', ''], ['Philipps', 'Jan', ''], ['Schätz', 'Bernhard', ''], ['Wagner', 'Stefan', '']]","['Safety case', 'model-based', 'structured argument', 'defect hypothesis', 'failure characterisation']"
7662,1806.05091,Tomasz Trzcinski,"Norbert Kapinski, Jakub Zielinski, Bartosz A. Borucki, Tomasz
  Trzcinski, Beata Ciszkowska-Lyson, Krzysztof S. Nowinski","Estimating Achilles tendon healing progress with convolutional neural
  networks",Paper accepted to MICCAI'18,,10.1007/978-3-030-00934-2_105,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quantitative assessment of a treatment progress in the Achilles tendon
healing process - one of the most common musculoskeletal disorder in modern
medical practice - is typically a long and complex process: multiple MRI
protocols need to be acquired and analysed by radiology experts. In this paper,
we propose to significantly reduce the complexity of this assessment using a
novel method based on a pre-trained convolutional neural network. We first
train our neural network on over 500,000 2D axial cross-sections from over 3000
3D MRI studies to classify MRI images as belonging to a healthy or injured
class, depending on the patient's condition. We then take the outputs of
modified pre-trained network and apply linear regression on the PCA-reduced
space of the features to assess treatment progress. Our method allows to reduce
up to 5-fold the amount of data needed to be registered during the MRI scan
without any information loss. Furthermore, we are able to predict the healing
process phase with equal accuracy to human experts in 3 out of 6 main criteria.
Finally, contrary to the current approaches to regeneration assessment that
rely on radiologist subjective opinion, our method allows to objectively
compare different treatments methods which can lead to improved diagnostics and
patient's recovery.
","[{'version': 'v1', 'created': 'Wed, 13 Jun 2018 14:43:21 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Jun 2018 02:21:55 GMT'}]",2019-09-12,"[['Kapinski', 'Norbert', ''], ['Zielinski', 'Jakub', ''], ['Borucki', 'Bartosz A.', ''], ['Trzcinski', 'Tomasz', ''], ['Ciszkowska-Lyson', 'Beata', ''], ['Nowinski', 'Krzysztof S.', '']]","['Achilles tendon trauma', 'Deep learning', 'MRI']"
7663,1809.06336,Ahmad Salim Al-Sibahi,"Ahmad Salim Al-Sibahi and Thomas P. Jensen and Aleksandar S. Dimovski
  and Andrzej Wasowski","Verification of High-Level Transformations with Inductive Refinement
  Types",,,10.1145/3278122.3278125,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  High-level transformation languages like Rascal include expressive features
for manipulating large abstract syntax trees: first-class traversals,
expressive pattern matching, backtracking and generalized iterators. We present
the design and implementation of an abstract interpretation tool, Rabit, for
verifying inductive type and shape properties for transformations written in
such languages. We describe how to perform abstract interpretation based on
operational semantics, specifically focusing on the challenges arising when
analyzing the expressive traversals and pattern matching. Finally, we evaluate
Rabit on a series of transformations (normalization, desugaring, refactoring,
code generators, type inference, etc.) showing that we can effectively verify
stated properties.
","[{'version': 'v1', 'created': 'Mon, 17 Sep 2018 17:14:06 GMT'}]",2018-09-18,"[['Al-Sibahi', 'Ahmad Salim', ''], ['Jensen', 'Thomas P.', ''], ['Dimovski', 'Aleksandar S.', ''], ['Wasowski', 'Andrzej', '']]","['transformation languages', 'abstract interpretation', 'static analysis']"
7664,1708.02938,Muaz Niazi,"Amnah Siddiqa, Muaz A. Niazi","A Novel Formal Agent-based Simulation Modeling Framework of an AIDS
  Complex Adaptive System","8 pages, 4 figures","International Journal of Agent Technologies and Systems (IJATS),
  5(3), 33-53 (2013)",10.4018/ijats.2013070103,,cs.MA nlin.PS q-bio.PE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  HIV/AIDS spread depends upon complex patterns of interaction among various
sub-sets emerging at population level. This added complexity makes it difficult
to study and model AIDS and its dynamics. AIDS is therefore a natural candidate
to be modeled using agent-based modeling, a paradigm well-known for modeling
Complex Adaptive Systems (CAS). While agent-based models are also well-known to
effectively model CAS, often times models can tend to be ambiguous and the use
of purely text-based specifications (such as ODD) can make models difficult to
be replicated. Previous work has shown how formal specification may be used in
conjunction with agent-based modeling to develop models of various CAS.
However, to the best of our knowledge, no such model has been developed in
conjunction with AIDS. In this paper, we present a Formal Agent-Based
Simulation modeling framework (FABS-AIDS) for an AIDS-based CAS. FABS-AIDS
employs the use of a formal specification model in conjunction with an
agent-based model to reduce ambiguity as well as improve clarity in the model
definition. The proposed model demonstrates the effectiveness of using formal
specification in conjunction with agent-based simulation for developing models
of CAS in general and, social network-based agent-based models, in particular.
","[{'version': 'v1', 'created': 'Wed, 9 Aug 2017 07:15:47 GMT'}]",2017-08-11,"[['Siddiqa', 'Amnah', ''], ['Niazi', 'Muaz A.', '']]","['Agent based modeling', 'AIDS', 'Complex Adaptive System', 'sub']"
7665,2104.03936,Achkan Salehi,"Achkan Salehi, Alexandre Coninx, Stephane Doncieux",BR-NS: an Archive-less Approach to Novelty Search,Author version of the paper accepted at GECCO 21,,10.1145/3449639.3459303,,cs.AI cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As open-ended learning based on divergent search algorithms such as Novelty
Search (NS) draws more and more attention from the research community, it is
natural to expect that its application to increasingly complex real-world
problems will require the exploration to operate in higher dimensional Behavior
Spaces which will not necessarily be Euclidean. Novelty Search traditionally
relies on k-nearest neighbours search and an archive of previously visited
behavior descriptors which are assumed to live in a Euclidean space. This is
problematic because of a number of issues. On one hand, Euclidean distance and
Nearest-neighbour search are known to behave differently and become less
meaningful in high dimensional spaces. On the other hand, the archive has to be
bounded since, memory considerations aside, the computational complexity of
finding nearest neighbours in that archive grows linearithmically with its
size. A sub-optimal bound can result in ""cycling"" in the behavior space, which
inhibits the progress of the exploration. Furthermore, the performance of NS
depends on a number of algorithmic choices and hyperparameters, such as the
strategies to add or remove elements to the archive and the number of
neighbours to use in k-nn search. In this paper, we discuss an alternative
approach to novelty estimation, dubbed Behavior Recognition based Novelty
Search (BR-NS), which does not require an archive, makes no assumption on the
metrics that can be defined in the behavior space and does not rely on nearest
neighbours search. We conduct experiments to gain insight into its feasibility
and dynamics as well as potential advantages over archive-based NS in terms of
time complexity.
","[{'version': 'v1', 'created': 'Thu, 8 Apr 2021 17:31:34 GMT'}]",2021-04-09,"[['Salehi', 'Achkan', ''], ['Coninx', 'Alexandre', ''], ['Doncieux', 'Stephane', '']]","['Novelty Search', 'Behavior Space', 'Evolutionary Robotics']"
7666,2007.04983,Rolf Huesmann,"Rolf Huesmann, Alexander Zeier, Andreas Heinemann, Alexander Wiesmaier",Zur Benutzbarkeit und Verwendung von API-Dokumentationen,"13 pages, in German",,10.18420/muc2020-ws119-002,,cs.SE cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A good documentation is essential for a good usability of (security) APIs,
i.e. especially for the correct use of the APIs. Requirements for good
documentation of APIs have been described in several papers, but there is no
technical implementation (hereinafter referred to as a documentation system)
that implements these requirements. The requirements can be divided into
requirements for the documentation system and requirements for the
documentation content. Out of 13 identified requirements for a documentation
system itself, 9 were implemented in a prototype and evaluated in a user study
with 22 test persons using a cryptographic API. It turned out that the
implementation of the requirement 'Enable quick use of the API' depends on the
one hand on the quality of the content entered, but on the other hand also
includes 5 other requirements or their implementation. The two other
implemented requirements ('classic reference' and 'question and answer
function') were hardly or not at all used by the test persons. Their usefulness
and relevance should be investigated in a long-term study.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 11:57:44 GMT'}]",2020-07-28,"[['Huesmann', 'Rolf', ''], ['Zeier', 'Alexander', ''], ['Heinemann', 'Andreas', ''], ['Wiesmaier', 'Alexander', '']]","['API Dokumentation', 'Dokumentationssystem', 'Benutzbarkeit', 'Gebrauchstauglichkeit', 'Nutzerstudie', 'eUCRITE', 'Tink']"
7667,2111.00426,Clayton Miller,Chun Fu and Clayton Miller,"Using Google Trends as a proxy for occupant behavior to predict building
  energy consumption",,Appl Energy. 2022;310: 118343,10.1016/j.apenergy.2021.118343,,cs.LG cs.CY,http://creativecommons.org/licenses/by/4.0/,"  In recent years, the availability of larger amounts of energy data and
advanced machine learning algorithms has created a surge in building energy
prediction research. However, one of the variables in energy prediction models,
occupant behavior, is crucial for prediction performance but hard-to-measure or
time-consuming to collect from each building. This study proposes an approach
that utilizes the search volume of topics (e.g., education} or Microsoft Excel)
on the Google Trends platform as a proxy of occupant behavior and use of
buildings. Linear correlations were first examined to explore the relationship
between energy meter data and Google Trends search terms to infer building
occupancy. Prediction errors before and after the inclusion of the trends of
these terms were compared and analyzed based on the ASHRAE Great Energy
Predictor III (GEPIII) competition dataset. The results show that highly
correlated Google Trends data can effectively reduce the overall RMSLE error
for a subset of the buildings to the level of the GEPIII competition's top five
winning teams' performance. In particular, the RMSLE error reduction during
public holidays and days with site-specific schedules are respectively reduced
by 20-30% and 2-5%. These results show the potential of using Google Trends to
improve energy prediction for a portion of the building stock by automatically
identifying site-specific and holiday schedules.
","[{'version': 'v1', 'created': 'Sun, 31 Oct 2021 08:05:23 GMT'}]",2022-02-09,"[['Fu', 'Chun', ''], ['Miller', 'Clayton', '']]","['Google Trends', 'Machine learning', 'Kaggle competition', 'Model error reduction', 'Building energy prediction', 'Occupant behavior']"
7668,2205.08356,Han Wang,"Han Wang, Zhou Huang, Xiao Zhou, Ganmin Yin, Yi Bao, Yi Zhang","DouFu: A Double Fusion Joint Learning Method For Driving Trajectory
  Representation","11 pages, 7 figures",,10.1016/j.knosys.2022.110035,,cs.LG cs.AI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Driving trajectory representation learning is of great significance for
various location-based services, such as driving pattern mining and route
recommendation. However, previous representation generation approaches tend to
rarely address three challenges: 1) how to represent the intricate semantic
intentions of mobility inexpensively; 2) complex and weak spatial-temporal
dependencies due to the sparsity and heterogeneity of the trajectory data; 3)
route selection preferences and their correlation to driving behavior. In this
paper, we propose a novel multimodal fusion model, DouFu, for trajectory
representation joint learning, which applies multimodal learning and attention
fusion module to capture the internal characteristics of trajectories. We first
design movement, route, and global features generated from the trajectory data
and urban functional zones and then analyze them respectively with the
attention encoder or feed forward network. The attention fusion module
incorporates route features with movement features to create a better
spatial-temporal embedding. With the global semantic feature, DouFu produces a
comprehensive embedding for each trajectory. We evaluate representations
generated by our method and other baseline models on classification and
clustering tasks. Empirical results show that DouFu outperforms other models in
most of the learning algorithms like the linear regression and the support
vector machine by more than 10%.
","[{'version': 'v1', 'created': 'Thu, 5 May 2022 07:43:35 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Oct 2022 05:11:51 GMT'}]",2022-12-13,"[['Wang', 'Han', ''], ['Huang', 'Zhou', ''], ['Zhou', 'Xiao', ''], ['Yin', 'Ganmin', ''], ['Bao', 'Yi', ''], ['Zhang', 'Yi', '']]","['Trajectory Mining', 'Representation Learning', 'Spatio-Temporal Analysis', 'Multimodal Fusion', 'AttentionMechanism']"
7669,2202.02095,Hanane Benmaghnia,"Hanane Benmaghnia, Matthieu Martel and Yassamine Seladji",Fixed-Point Code Synthesis For Neural Networks,,"CS & IT, Volume 12, Number 02, January 2022",10.5121/csit.2022.120202,,cs.SE cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Over the last few years, neural networks have started penetrating safety
critical systems to take decisions in robots, rockets, autonomous driving car,
etc. A problem is that these critical systems often have limited computing
resources. Often, they use the fixed-point arithmetic for its many advantages
(rapidity, compatibility with small memory devices.) In this article, a new
technique is introduced to tune the formats (precision) of already trained
neural networks using fixed-point arithmetic, which can be implemented using
integer operations only. The new optimized neural network computes the output
with fixed-point numbers without modifying the accuracy up to a threshold fixed
by the user. A fixed-point code is synthesized for the new optimized neural
network ensuring the respect of the threshold for any input vector belonging
the range [xmin, xmax] determined during the analysis. From a technical point
of view, we do a preliminary analysis of our floating neural network to
determine the worst cases, then we generate a system of linear constraints
among integer variables that we can solve by linear programming. The solution
of this system is the new fixed-point format of each neuron. The experimental
results obtained show the efficiency of our method which can ensure that the
new fixed-point neural network has the same behavior as the initial
floating-point neural network.
","[{'version': 'v1', 'created': 'Fri, 4 Feb 2022 12:02:54 GMT'}]",2022-02-24,"[['Benmaghnia', 'Hanane', ''], ['Martel', 'Matthieu', ''], ['Seladji', 'Yassamine', '']]","['Computer Arithmetic', 'Code Synthesis', 'Formal Methods', 'Linear Programming', 'NumericalAccuracy', 'Static Analysis']"
7670,2005.13773,Martin P. Seybold,"Joachim Gudmundsson, Michael Horton, John Pfeifer, Martin P. Seybold","A Practical Index Structure Supporting Fr\'echet Proximity Queries Among
  Trajectories",,,10.1145/3460121,,cs.CG cs.DS cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a scalable approach for range and $k$ nearest neighbor queries
under computationally expensive metrics, like the continuous Fr\'echet distance
on trajectory data. Based on clustering for metric indexes, we obtain a dynamic
tree structure whose size is linear in the number of trajectories, regardless
of the trajectory's individual sizes or the spatial dimension, which allows one
to exploit low `intrinsic dimensionality' of data sets for effective search
space pruning.
  Since the distance computation is expensive, generic metric indexing methods
are rendered impractical. We present strategies that (i) improve on known upper
and lower bound computations, (ii) build cluster trees without any or very few
distance calls, and (iii) search using bounds for metric pruning, interval
orderings for reduction, and randomized pivoting for reporting the final
results.
  We analyze the efficiency and effectiveness of our methods with extensive
experiments on diverse synthetic and real-world data sets. The results show
improvement over state-of-the-art methods for exact queries, and even further
speed-ups are achieved for queries that may return approximate results.
Surprisingly, the majority of exact nearest-neighbor queries on real data sets
are answered without any distance computations.
","[{'version': 'v1', 'created': 'Thu, 28 May 2020 04:12:43 GMT'}]",2021-12-14,"[['Gudmundsson', 'Joachim', ''], ['Horton', 'Michael', ''], ['Pfeifer', 'John', ''], ['Seybold', 'Martin P.', '']]","['Fr´echet Distance', 'Dynamic Metric Index', 'Clustering', 'Cluster Tree', 'Cover Tree', 'NearestNeighbor', 'Range Search']"
7671,2208.04649,Nicolas E. Diaz Ferreyra PhD,"Nicol\'as E. D\'iaz Ferreyra, Sina Ostendorf, Esma A\""imeur, Maritta
  Heisel and Matthias Brand",ENAGRAM: An App to Evaluate Preventative Nudges for Instagram,"Accepted at the 2022 European Symposium on Usable Security (EuroUSEC
  2022)",,10.1145/3549015.3555674,,cs.HC cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online self-disclosure is perhaps one of the last decade's most studied
communication processes, thanks to the introduction of Online Social Networks
(OSNs) like Facebook. Self-disclosure research has contributed significantly to
the design of preventative nudges seeking to support and guide users when
revealing private information in OSNs. Still, assessing the effectiveness of
these solutions is often challenging since changing or modifying the choice
architecture of OSN platforms is practically unfeasible. In turn, the
effectiveness of numerous nudging designs is supported primarily by
self-reported data instead of actual behavioral information. This work presents
ENAGRAM, an app for evaluating preventative nudges, and reports the first
results of an empirical study conducted with it. Such a study aims to showcase
how the app (and the data collected with it) can be leveraged to assess the
effectiveness of a particular nudging approach. We used ENAGRAM as a vehicle to
test a risk-based strategy for nudging the self-disclosure decisions of
Instagram users. For this, we created two variations of the same nudge and
tested it in a between-subjects experimental setting. Study participants (N=22)
were recruited via Prolific and asked to use the app regularly for 7 days. An
online survey was distributed at the end of the experiment to measure some
privacy-related constructs. From the data collected with ENAGRAM, we observed
lower (though non-significant) self-disclosure levels when applying risk-based
interventions. The constructs measured with the survey were not significant
either, except for participants' External Information Privacy Concerns. Our
results suggest that (i) ENAGRAM is a suitable alternative for conducting
longitudinal experiments in a privacy-friendly way, and (ii) it provides a
flexible framework for the evaluation of a broad spectrum of nudging solutions.
","[{'version': 'v1', 'created': 'Tue, 9 Aug 2022 10:19:04 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Aug 2022 16:05:12 GMT'}]",2022-08-19,"[['Ferreyra', 'Nicolás E. Díaz', ''], ['Ostendorf', 'Sina', ''], ['Aïmeur', 'Esma', ''], ['Heisel', 'Maritta', ''], ['Brand', 'Matthias', '']]","['privacy nudges', 'risk awareness', 'usability', 'personalization', 'onlinesocial networks']"
7672,2206.14198,Yun Zhao,"Yuqing Wang, Yun Zhao and Linda Petzold","Predicting the Need for Blood Transfusion in Intensive Care Units with
  Reinforcement Learning","Proceedings of 13th International ACM Conference on Bioinformatics,
  Computational Biology and Health Informatics",,10.1145/3535508.3545523,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  As critically ill patients frequently develop anemia or coagulopathy,
transfusion of blood products is a frequent intervention in the Intensive Care
Units (ICU). However, inappropriate transfusion decisions made by physicians
are often associated with increased risk of complications and higher hospital
costs. In this work, we aim to develop a decision support tool that uses
available patient information for transfusion decision-making on three common
blood products (red blood cells, platelets, and fresh frozen plasma). To this
end, we adopt an off-policy batch reinforcement learning (RL) algorithm,
namely, discretized Batch Constrained Q-learning, to determine the best action
(transfusion or not) given observed patient trajectories. Simultaneously, we
consider different state representation approaches and reward design mechanisms
to evaluate their impacts on policy learning. Experiments are conducted on two
real-world critical care datasets: the MIMIC-III and the UCSF. Results
demonstrate that policy recommendations on transfusion achieved comparable
matching against true hospital policies via accuracy and weighted importance
sampling evaluations on the MIMIC-III dataset. Furthermore, a combination of
transfer learning (TL) and RL on the data-scarce UCSF dataset can provide up to
$17.02% improvement in terms of accuracy, and up to 18.94% and 21.63%
improvement in jump-start and asymptotic performance in terms of weighted
importance sampling averaged over three transfusion tasks. Finally, simulations
on transfusion decisions suggest that the transferred RL policy could reduce
patients' estimated 28-day mortality rate by 2.74% and decreased acuity rate by
1.18% on the UCSF dataset.
","[{'version': 'v1', 'created': 'Sun, 26 Jun 2022 01:11:41 GMT'}]",2022-06-30,"[['Wang', 'Yuqing', ''], ['Zhao', 'Yun', ''], ['Petzold', 'Linda', '']]","['Reinforcement Learning', 'Transfer Learning', 'Blood Transfusion']"
7673,1802.04800,Rajorshee Raha,Rajorshee Raha,"Adaptive Regulation of Sampling Rates for Power Efficient Embedded
  Control system Design","In the proceedings of 17th International Conference on Control,
  Automation and Systems (ICCAS) 2017","2017 17th International Conference on Control, Automation and
  Systems (ICCAS), Jeju, Korea, October 2017, pp. 505-510",10.23919/ICCAS.2017.8204289,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent times adaptive regulation of sampling rates has gained significant
attention in research community and researchers has demonstrated it's
effectiveness in embedded control applications from different perspectives. In
low power embedded control systems, the sampling rate of the control tasks has
a direct relationship with control performance and power consumption. In this
paper, we investigate the possibility of improving the power efficiency of low
power embedded control systems by regulating the sampling rate of the control
tasks. On this regard, we present algorithmic approaches for on-line regulation
of sampling rates of the control task under some power-performance trade-off.
We present elaborative results which demonstrate the efficacy of our proposed
approaches.
","[{'version': 'v1', 'created': 'Tue, 13 Feb 2018 01:24:27 GMT'}]",2018-02-15,"[['Raha', 'Rajorshee', '']]","['Embedded Control Systems', 'Software Based Control', 'Sampling Rate', 'Power', 'Control Performance']"
7674,1912.10590,Chengkun Lang,"Huiwei Zhou, Chengkun Lang, Zhuang Liu, Shixian Ning, Yingyu Lin and
  Lei Du","Knowledge-guided Convolutional Networks for Chemical-Disease Relation
  Extraction","Published on BMC Bioinformatics, 16 pages, 5 figures","BMC Bioinformatics, 2019, 20(1):260",10.1186/s12859-019-2873-7,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Automatic extraction of chemical-disease relations (CDR) from
unstructured text is of essential importance for disease treatment and drug
development. Meanwhile, biomedical experts have built many highly-structured
knowledge bases (KBs), which contain prior knowledge about chemicals and
diseases. Prior knowledge provides strong support for CDR extraction. How to
make full use of it is worth studying. Results: This paper proposes a novel
model called ""Knowledge-guided Convolutional Networks (KCN)"" to leverage prior
knowledge for CDR extraction. The proposed model first learns knowledge
representations including entity embeddings and relation embeddings from KBs.
Then, entity embeddings are used to control the propagation of context features
towards a chemical-disease pair with gated convolutions. After that, relation
embeddings are employed to further capture the weighted context features by a
shared attention pooling. Finally, the weighted context features containing
additional knowledge information are used for CDR extraction. Experiments on
the BioCreative V CDR dataset show that the proposed KCN achieves 71.28%
F1-score, which outperforms most of the state-of-the-art systems. Conclusions:
This paper proposes a novel CDR extraction model KCN to make full use of prior
knowledge. Experimental results demonstrate that KCN could effectively
integrate prior knowledge and contexts for the performance improvement.
","[{'version': 'v1', 'created': 'Mon, 23 Dec 2019 02:28:10 GMT'}]",2019-12-24,"[['Zhou', 'Huiwei', ''], ['Lang', 'Chengkun', ''], ['Liu', 'Zhuang', ''], ['Ning', 'Shixian', ''], ['Lin', 'Yingyu', ''], ['Du', 'Lei', '']]","['CDR extraction', 'Gating units', 'Attention mechanism', 'Knowledge representations', 'Context features']"
7675,1708.04432,Shan Luo Dr,"Shan Luo, Leqi Zhu, Kaspar Althoefer, Hongbin Liu","Knock-Knock: Acoustic Object Recognition by using Stacked Denoising
  Autoencoders","6 pages, 10 figures, Neurocomputing",,10.1016/j.neucom.2017.03.014,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a successful application of deep learning for object
recognition based on acoustic data. The shortcomings of previously employed
approaches where handcrafted features describing the acoustic data are being
used, include limiting the capability of the found representation to be widely
applicable and facing the risk of capturing only insignificant characteristics
for a task. In contrast, there is no need to define the feature representation
format when using multilayer/deep learning architecture methods: features can
be learned from raw sensor data without defining discriminative characteristics
a-priori. In this paper, stacked denoising autoencoders are applied to train a
deep learning model. Knocking each object in our test set 120 times with a
marker pen to obtain the auditory data, thirty different objects were
successfully classified in our experiment and each object was knocked 120 times
by a marker pen to obtain the auditory data. By employing the proposed deep
learning framework, a high accuracy of 91.50% was achieved. A traditional
method using handcrafted features with a shallow classifier was taken as a
benchmark and the attained recognition rate was only 58.22%. Interestingly, a
recognition rate of 82.00% was achieved when using a shallow classifier with
raw acoustic data as input. In addition, we could show that the time taken to
classify one object using deep learning was far less (by a factor of more than
6) than utilizing the traditional method. It was also explored how different
model parameters in our deep architecture affect the recognition performance.
","[{'version': 'v1', 'created': 'Tue, 15 Aug 2017 08:40:02 GMT'}]",2017-08-16,"[['Luo', 'Shan', ''], ['Zhu', 'Leqi', ''], ['Althoefer', 'Kaspar', ''], ['Liu', 'Hongbin', '']]","['Object recognition', 'deep networks', 'acoustic data analysis']"
7676,2112.06011,Junhua Zou,"Junhua Zou, Zhisong Pan, Junyang Qiu, Xin Liu, Ting Rui, Wei Li","Improving the Transferability of Adversarial Examples with
  Resized-Diverse-Inputs, Diversity-Ensemble and Region Fitting",Accepted to ECCV2020,,10.1007/978-3-030-58542-6_34,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  We introduce a three stage pipeline: resized-diverse-inputs (RDIM),
diversity-ensemble (DEM) and region fitting, that work together to generate
transferable adversarial examples. We first explore the internal relationship
between existing attacks, and propose RDIM that is capable of exploiting this
relationship. Then we propose DEM, the multi-scale version of RDIM, to generate
multi-scale gradients. After the first two steps we transform value fitting
into region fitting across iterations. RDIM and region fitting do not require
extra running time and these three steps can be well integrated into other
attacks. Our best attack fools six black-box defenses with a 93% success rate
on average, which is higher than the state-of-the-art gradient-based attacks.
Besides, we rethink existing attacks rather than simply stacking new methods on
the old ones to get better performance. It is expected that our findings will
serve as the beginning of exploring the internal relationship between attack
methods. Codes are available at https://github.com/278287847/DEM.
","[{'version': 'v1', 'created': 'Sat, 11 Dec 2021 15:57:11 GMT'}]",2021-12-14,"[['Zou', 'Junhua', ''], ['Pan', 'Zhisong', ''], ['Qiu', 'Junyang', ''], ['Liu', 'Xin', ''], ['Rui', 'Ting', ''], ['Li', 'Wei', '']]","['Adversarial examples', 'the internal relationship', 'region fitting', 'resized-diverse-inputs', 'diversity-ensemble']"
7677,2006.07618,Ali AlSoufi Dr.,"Abdulkarim Katbi, Jaflah AlAmmari, Ali AlSoufi","The Demand Side of Open Government Data: A Case Study of Kingdom of
  Bahrain","18 pages, 6 figures, 7 tables, Journal","International Journal of Managing Information Technology (IJMIT),
  VOlume 12, Number 2, May 2020",10.5121/ijmit.2020.12203,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Governments around the world have realized the importance of Open Government
Data (OGD) as a new paradigm shift in government that focuses on making
governments more service-oriented, transparent, and competent. However, as with
many countries, the situation of the OGD initiative in the Kingdom of Bahrain
is not promising as reflected by a number of assessments that measure the
implementation and progress of OGD worldwide. The current research aims at
investing in the local situation regarding consuming and reusing OGD in the
Kingdom of Bahrain. Specifically, this research assesses the level of citizen
awareness towards OGD, determines citizens requirements of OGD, and identifies
the key challenges and obstacles in using/reusing OGD. A questionnaire was
developed to investigate the demand side of OGD. The findings show that serious
and responsible efforts from the publishers of OGD, namely: Government
Organizations are believed to be a necessity in order to progress the
implementation process of the OGD initiative in the Kingdom of Bahrain.
","[{'version': 'v1', 'created': 'Sat, 13 Jun 2020 11:15:50 GMT'}]",2020-06-16,"[['Katbi', 'Abdulkarim', ''], ['AlAmmari', 'Jaflah', ''], ['AlSoufi', 'Ali', '']]","['Open Government Data', 'electronic government', 'supply', 'demand', 'digital society', 'Kingdom of Bahrain']"
7678,2109.04719,Haoran Xie,"Shogo Yoshida, Haoran Xie, Kazunori Miyata",NaviChoker: Augmenting Pressure Sensation via Pneumatic Actuator,"Proceedings of AH 2021. 4 pages, 7 figures",,10.1145/3460881.3460937,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Many technologies have been developed in recent years to present audiovisual
information in new ways, but developing an information presentation interface
to convey tactile information is still a challenge. We propose a tactile device
using wearable technology that is an all-around pressure presentation system
using pneumatic actuators. Specifically, we develop a system in which a choker
equipped with a pneumatic actuator is worn around the neck, that applies
pressure in any direction to indicate to the user the direction in which to
walk and also when to start and stop walking. In this paper, we describe the
construction of the device, evaluation experiments, our assessment of the
prototype, and future plans for the device.
","[{'version': 'v1', 'created': 'Fri, 10 Sep 2021 07:54:07 GMT'}]",2021-09-13,"[['Yoshida', 'Shogo', ''], ['Xie', 'Haoran', ''], ['Miyata', 'Kazunori', '']]","['pneumatic acutator', 'pressure sensation', 'haptic', 'choker', 'interaction']"
7679,2202.11827,Eugene Yang,Eugene Yang and David D. Lewis,TARexp: A Python Framework for Technology-Assisted Review Experiments,"6 pages, 4 figures, accepted as a SIGIR 2022 demo paper",,10.1145/3477495.3531663,,cs.IR,http://creativecommons.org/licenses/by-sa/4.0/,"  Technology-assisted review (TAR) is an important industrial application of
information retrieval (IR) and machine learning (ML). While a small TAR
research community exists, the complexity of TAR software and workflows is a
major barrier to entry. Drawing on past open source TAR efforts, as well as
design patterns from the IR and ML open source software, we present an open
source Python framework for conducting experiments on TAR algorithms. Key
characteristics of this framework are declarative representations of workflows
and experiment plans, the ability for components to play variable numbers of
workflow roles, and state maintenance and restart capabilities. Users can draw
on reference implementations of standard TAR algorithms while incorporating
novel components to explore their research interests. The framework is
available at https://github.com/eugene-yang/tarexp.
","[{'version': 'v1', 'created': 'Wed, 23 Feb 2022 23:42:57 GMT'}, {'version': 'v2', 'created': 'Sun, 24 Apr 2022 19:37:33 GMT'}]",2022-04-26,"[['Yang', 'Eugene', ''], ['Lewis', 'David D.', '']]","['reproducible experiments', 'technology-assisted review', 'eDiscovery', 'systematic review', 'opensource']"
7680,1911.02696,Daniel Lemire,Marcus D. R. Klarqvist and Wojciech Mu{\l}a and Daniel Lemire,"Efficient Computation of Positional Population Counts Using SIMD
  Instructions",,"Concurrency and Computation: Practice and Experience 33 (17), 2021",10.1002/cpe.6304,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In several fields such as statistics, machine learning, and bioinformatics,
categorical variables are frequently represented as one-hot encoded vectors.
For example, given 8 distinct values, we map each value to a byte where only a
single bit has been set. We are motivated to quickly compute statistics over
such encodings. Given a stream of k-bit words, we seek to compute k distinct
sums corresponding to bit values at indexes 0, 1, 2, ..., k-1. If the k-bit
words are one-hot encoded then the sums correspond to a frequency histogram.
This multiple-sum problem is a generalization of the population-count problem
where we seek the sum of all bit values. Accordingly, we refer to the
multiple-sum problem as a positional population-count. Using SIMD (Single
Instruction, Multiple Data) instructions from recent Intel processors, we
describe algorithms for computing the 16-bit position population count using
less than half of a CPU cycle per 16-bit word. Our best approach uses up to 400
times fewer instructions and is up to 50 times faster than baseline code using
only regular (non-SIMD) instructions, for sufficiently large inputs.
","[{'version': 'v1', 'created': 'Thu, 7 Nov 2019 01:06:38 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Nov 2019 17:01:46 GMT'}, {'version': 'v3', 'created': 'Mon, 21 Dec 2020 21:39:54 GMT'}, {'version': 'v4', 'created': 'Wed, 23 Dec 2020 20:55:55 GMT'}, {'version': 'v5', 'created': 'Wed, 17 Mar 2021 21:39:19 GMT'}, {'version': 'v6', 'created': 'Tue, 11 May 2021 21:15:54 GMT'}]",2021-08-19,"[['Klarqvist', 'Marcus D. R.', ''], ['Muła', 'Wojciech', ''], ['Lemire', 'Daniel', '']]","['Vectorization', 'Population Counts', 'SIMD Instructions', 'Software Performance', 'Bioinformatics', 'Sequenc']"
7681,2108.10494,EPTCS,"Xian Xu (East China University of Science and Technology), Wenbo Zhang
  (Shanghai Ocean University, Shanghai Key Laboratory of Trustworthy Computing)","On Decidability of the Bisimilarity on Higher-order Processes with
  Parameterization","In Proceedings EXPRESS/SOS 2021, arXiv:2108.09624","EPTCS 339, 2021, pp. 76-92",10.4204/EPTCS.339.8,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  Higher-order processes with parameterization are capable of abstraction and
application (migrated from the lambda-calculus), and thus are computationally
more expressive. For the minimal higher-order concurrency, it is well-known
that the strong bisimilarity (i.e., the strong bisimulation equality) is
decidable in absence of parameterization. By contrast, whether the strong
bisimilarity is still decidable for parameterized higher-order processes
remains unclear. In this paper, we focus on this issue. There are basically two
kinds of parameterization: one on names and the other on processes. We show
that the strong bisimilarity is indeed decidable for higher-order processes
equipped with both kinds of parameterization. Then we demonstrate how to adapt
the decision approach to build an axiom system for the strong bisimilarity. On
top of these results, we provide an algorithm for the bisimilarity checking.
","[{'version': 'v1', 'created': 'Tue, 24 Aug 2021 02:40:24 GMT'}]",2021-08-25,"[['Xu', 'Xian', '', 'East China University of Science and Technology'], ['Zhang', 'Wenbo', '', 'Shanghai Ocean University, Shanghai Key Laboratory of Trustworthy Computing']]","['Decidability', 'Strong bisimilarity', 'Parameterization', 'Higher-order', 'Processes']"
7682,2107.04281,Felix Juefei-Xu,"Qing Guo and Xiaoguang Li and Felix Juefei-Xu and Hongkai Yu and Yang
  Liu and Song wang","JPGNet: Joint Predictive Filtering and Generative Network for Image
  Inpainting",This work has been accepted to ACM-MM 2021,,10.1145/3474085.3475170,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image inpainting aims to restore the missing regions of corrupted images and
make the recovery result identical to the originally complete image, which is
different from the common generative task emphasizing the naturalness or
realism of generated images. Nevertheless, existing works usually regard it as
a pure generation problem and employ cutting-edge deep generative techniques to
address it. The generative networks can fill the main missing parts with
realistic contents but usually distort the local structures or introduce
obvious artifacts. In this paper, for the first time, we formulate image
inpainting as a mix of two problems, predictive filtering and deep generation.
Predictive filtering is good at preserving local structures and removing
artifacts but falls short to complete the large missing regions. The deep
generative network can fill the numerous missing pixels based on the
understanding of the whole scene but hardly restores the details identical to
the original ones. To make use of their respective advantages, we propose the
joint predictive filtering and generative network (JPGNet) that contains three
branches: predictive filtering & uncertainty network (PFUNet), deep generative
network, and uncertainty-aware fusion network (UAFNet). The PFUNet can
adaptively predict pixel-wise kernels for filtering-based inpainting according
to the input image and output an uncertainty map. This map indicates the pixels
should be processed by filtering or generative networks, which is further fed
to the UAFNet for a smart combination between filtering and generative results.
Note that, our method as a novel inpainting framework can benefit any existing
generation-based methods. We validate our method on three public datasets,
Dunhuang, Places2, and CelebA, and demonstrate that our method can enhance
three state-of-the-art generative methods significantly with slightly extra
time costs.
","[{'version': 'v1', 'created': 'Fri, 9 Jul 2021 07:49:52 GMT'}, {'version': 'v2', 'created': 'Sat, 24 Jul 2021 04:12:35 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Oct 2021 07:27:03 GMT'}]",2021-10-19,"[['Guo', 'Qing', ''], ['Li', 'Xiaoguang', ''], ['Juefei-Xu', 'Felix', ''], ['Yu', 'Hongkai', ''], ['Liu', 'Yang', ''], ['wang', 'Song', '']]","['Image Inpainting', 'Predictive Filtering', 'Generative Network']"
7683,2207.10789,Omer Aydin,Omer Aydin,Authentication and Billing Scheme for The Electric Vehicles: EVABS,,,10.33461/uybisbbd.1075481,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The need for different energy sources has increased due to the decrease in
the amount and the harm caused to the environment by its usage. Today, fossil
fuels used as an energy source in land, sea or air vehicles are rapidly being
replaced by different energy sources. The number and types of vehicles using
energy sources other than fossil fuels are also increasing. Electricity stands
out among the energy sources used. The possibility of generating electricity
that is renewable, compatible with nature and at a lower cost provides a great
advantage. For all these reasons, the use of electric vehicles is increasing
day by day. Various solutions continue to be developed for the charging systems
and post-charge billing processes of these vehicles. As a result of these
solutions, the standards have not yet been fully formed. In this study, an
authentication and billing scheme is proposed for charging and post-charging
billing processes of electric land vehicles keeping security and privacy in the
foreground. This scheme is named EVABS, which derives from the phrase ""Electric
Vehicle Authentication and Billing Scheme"". An authentication and billing
scheme is proposed where data communication is encrypted, payment transactions
are handled securely and parties can authenticate over wired or wireless. The
security of the proposed scheme has been examined theoretically and it has been
determined that it is secure against known attacks.
","[{'version': 'v1', 'created': 'Sat, 2 Jul 2022 23:29:24 GMT'}]",2022-07-25,"[['Aydin', 'Omer', '']]","['electric land vehicle', 'authentication scheme', 'encryption', 'security', 'payment system', 'charging system']"
7684,1905.08038,Dan Lin,"Jiajing Wu, Dan Lin, Zibin Zheng, Qi Yuan","T-EDGE: Temporal WEighted MultiDiGraph Embedding for Ethereum
  Transaction Network Analysis",12 pages,Front. Phys. 8:204 (2020),10.3389/fphy.2020.00204,,cs.SI stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, graph embedding techniques have been widely used in the analysis of
various networks, but most of the existing embedding methods omit the network
dynamics and the multiplicity of edges, so it is difficult to accurately
describe the detailed characteristics of the transaction networks. Ethereum is
a blockchain-based platform supporting smart contracts. The open nature of
blockchain makes the transaction data on Ethereum completely public, and also
brings unprecedented opportunities for the transaction network analysis. By
taking the realistic rules and features of transaction networks into
consideration, we first model the Ethereum transaction network as a Temporal
Weighted Multidigraph (TWMDG), where each node is a unique Ethereum account and
each edge represents a transaction weighted by amount and assigned with
timestamp. Then we define the problem of Temporal Weighted Multidigraph
Embedding (T-EDGE) by incorporating both temporal and weighted information of
the edges, the purpose being to capture more comprehensive properties of
dynamic transaction networks. To evaluate the effectiveness of the proposed
embedding method, we conduct experiments of node classification on real-world
transaction data collected from Ethereum. Experimental results demonstrate that
T-EDGE outperforms baseline embedding methods, indicating that time-dependent
walks and multiplicity characteristic of edges are informative and essential
for time-sensitive transaction networks.
","[{'version': 'v1', 'created': 'Mon, 13 May 2019 13:59:34 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Jul 2020 14:09:58 GMT'}]",2021-01-07,"[['Wu', 'Jiajing', ''], ['Lin', 'Dan', ''], ['Zheng', 'Zibin', ''], ['Yuan', 'Qi', '']]","['network embedding', 'Ethereum', 'machine learning', 'temporal network', 'transaction network']"
7685,2101.11865,Hancheng Cao,"Hancheng Cao, Chia-Jung Lee, Shamsi Iqbal, Mary Czerwinski, Priscilla
  Wong, Sean Rintel, Brent Hecht, Jaime Teevan, Longqi Yang",Large Scale Analysis of Multitasking Behavior During Remote Meetings,In ACM CHI 2021,,10.1145/3411764.3445243,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Virtual meetings are critical for remote work because of the need for
synchronous collaboration in the absence of in-person interactions. In-meeting
multitasking is closely linked to people's productivity and wellbeing. However,
we currently have limited understanding of multitasking in remote meetings and
its potential impact. In this paper, we present what we believe is the most
comprehensive study of remote meeting multitasking behavior through an analysis
of a large-scale telemetry dataset collected from February to May 2020 of U.S.
Microsoft employees and a 715-person diary study. Our results demonstrate that
intrinsic meeting characteristics such as size, length, time, and type,
significantly correlate with the extent to which people multitask, and
multitasking can lead to both positive and negative outcomes. Our findings
suggest important best-practice guidelines for remote meetings (e.g., avoid
important meetings in the morning) and design implications for productivity
tools (e.g., support positive remote multitasking).
","[{'version': 'v1', 'created': 'Thu, 28 Jan 2021 08:33:23 GMT'}]",2021-01-29,"[['Cao', 'Hancheng', ''], ['Lee', 'Chia-Jung', ''], ['Iqbal', 'Shamsi', ''], ['Czerwinski', 'Mary', ''], ['Wong', 'Priscilla', ''], ['Rintel', 'Sean', ''], ['Hecht', 'Brent', ''], ['Teevan', 'Jaime', ''], ['Yang', 'Longqi', '']]","['Multitasking', 'meeting', 'collaboration', 'remote work']"
7686,2205.01311,Jason Tsay,"Julian Dolby, Jason Tsay, Martin Hirzel","Automatically Debugging AutoML Pipelines using Maro: ML Automated
  Remediation Oracle (Extended Version)",Extended version of MAPS 2022 paper,,10.1145/3520312.3534868,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning in practice often involves complex pipelines for data
cleansing, feature engineering, preprocessing, and prediction. These pipelines
are composed of operators, which have to be correctly connected and whose
hyperparameters must be correctly configured. Unfortunately, it is quite common
for certain combinations of datasets, operators, or hyperparameters to cause
failures. Diagnosing and fixing those failures is tedious and error-prone and
can seriously derail a data scientist's workflow. This paper describes an
approach for automatically debugging an ML pipeline, explaining the failures,
and producing a remediation. We implemented our approach, which builds on a
combination of AutoML and SMT, in a tool called Maro. Maro works seamlessly
with the familiar data science ecosystem including Python, Jupyter notebooks,
scikit-learn, and AutoML tools such as Hyperopt. We empirically evaluate our
tool and find that for most cases, a single remediation automatically fixes
errors, produces no additional faults, and does not significantly impact
optimal accuracy nor time to convergence.
","[{'version': 'v1', 'created': 'Tue, 3 May 2022 05:12:45 GMT'}, {'version': 'v2', 'created': 'Thu, 5 May 2022 20:48:21 GMT'}]",2022-05-09,"[['Dolby', 'Julian', ''], ['Tsay', 'Jason', ''], ['Hirzel', 'Martin', '']]","['AI Debugging', 'AutoML', 'Automated Remediation', 'Automated Debugging']"
7687,2111.00670,Aobo Yang,"Aobo Yang, Nan Wang, Renqin Cai, Hongbo Deng, Hongning Wang",Comparative Explanations of Recommendations,"11 pages, 4 figures",,10.1145/3485447.3512031,,cs.IR cs.AI cs.CL,http://creativecommons.org/licenses/by/4.0/,"  As recommendation is essentially a comparative (or ranking) process, a good
explanation should illustrate to users why an item is believed to be better
than another, i.e., comparative explanations about the recommended items.
Ideally, after reading the explanations, a user should reach the same ranking
of items as the system's. Unfortunately, little research attention has yet been
paid on such comparative explanations.
  In this work, we develop an extract-and-refine architecture to explain the
relative comparisons among a set of ranked items from a recommender system. For
each recommended item, we first extract one sentence from its associated
reviews that best suits the desired comparison against a set of reference
items. Then this extracted sentence is further articulated with respect to the
target user through a generative model to better explain why the item is
recommended. We design a new explanation quality metric based on BLEU to guide
the end-to-end training of the extraction and refinement components, which
avoids generation of generic content. Extensive offline evaluations on two
large recommendation benchmark datasets and serious user studies against an
array of state-of-the-art explainable recommendation algorithms demonstrate the
necessity of comparative explanations and the effectiveness of our solution.
","[{'version': 'v1', 'created': 'Mon, 1 Nov 2021 02:55:56 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Feb 2022 04:19:06 GMT'}, {'version': 'v3', 'created': 'Mon, 25 Apr 2022 15:42:58 GMT'}]",2022-04-26,"[['Yang', 'Aobo', ''], ['Wang', 'Nan', ''], ['Cai', 'Renqin', ''], ['Deng', 'Hongbo', ''], ['Wang', 'Hongning', '']]","['explainable recommendation', 'comparative explanation', 'text generation', 'extract-and-refine']"
7688,2112.06039,Shuanglong Kan,"Shuanglong Kan, Anthony W. Lin, Philipp R\""ummer, Micha Schrader",CertiStr: A Certified String Solver (technical report),,,10.1145/3497775.3503691,,cs.PL cs.FL cs.LO,http://creativecommons.org/licenses/by/4.0/,"  Theories over strings are among the most heavily researched logical theories
in the SMT community in the past decade, owing to the error-prone nature of
string manipulations, which often leads to security vulnerabilities (e.g.
cross-site scripting and code injection). The majority of the existing decision
procedures and solvers for these theories are themselves intricate; they are
complicated algorithmically, and also have to deal with a very rich vocabulary
of operations. This has led to a plethora of bugs in implementation, which have
for instance been discovered through fuzzing. In this paper, we present
CertiStr, a certified implementation of a string constraint solver for the
theory of strings with concatenation and regular constraints. CertiStr aims to
solve string constraints using a forward-propagation algorithm based on
symbolic representations of regular constraints as symbolic automata, which
returns three results: sat, unsat, and unknown, and is guaranteed to terminate
for the string constraints whose concatenation dependencies are acyclic. The
implementation has been developed and proven correct in Isabelle/HOL, through
which an effective solver in OCaml was generated. We demonstrate the
effectiveness and efficiency of CertiStr against the standard Kaluza benchmark,
in which 80.4% tests are in the string constraint fragment of CertiStr. Of
these 80.4% tests, CertiStr can solve 83.5% (i.e. CertiStr returns sat or
unsat) within 60s.
","[{'version': 'v1', 'created': 'Sat, 11 Dec 2021 17:50:32 GMT'}]",2021-12-15,"[['Kan', 'Shuanglong', ''], ['Lin', 'Anthony W.', ''], ['Rümmer', 'Philipp', ''], ['Schrader', 'Micha', '']]","['string theory', 'Isabelle', 'symbolic automata', 'SMTsolvers']"
7689,2010.04994,Teeratorn Kadeethum,T. Kadeethum and S. Lee and F. Ballarin and J. Choo and H.M. Nick,"A Locally Conservative Mixed Finite Element Framework for Coupled
  Hydro-Mechanical-Chemical Processes in Heterogeneous Porous Media",Preprint submitted to Elsevier,,10.1016/j.cageo.2021.104774,,cs.CE cs.NA math.NA,http://creativecommons.org/licenses/by/4.0/,"  This paper presents a mixed finite element framework for coupled
hydro-mechanical-chemical processes in heterogeneous porous media. The
framework combines two types of locally conservative discretization schemes:
(1) an enriched Galerkin method for reactive flow, and (2) a three-field mixed
finite element method for coupled fluid flow and solid deformation. This
combination ensures local mass conservation, which is critical to flow and
transport in heterogeneous porous media, with a relatively affordable
computational cost. A particular class of the framework is constructed for
calcite precipitation/dissolution reactions, incorporating their nonlinear
effects on the fluid viscosity and solid deformation. Linearization schemes and
algorithms for solving the nonlinear algebraic system are also presented.
Through numerical examples of various complexity, we demonstrate that the
proposed framework is a robust and efficient computational method for
simulation of reactive flow and transport in deformable porous media, even when
the material properties are strongly heterogeneous and anisotropic.
","[{'version': 'v1', 'created': 'Sat, 10 Oct 2020 13:27:49 GMT'}]",2021-05-05,"[['Kadeethum', 'T.', ''], ['Lee', 'S.', ''], ['Ballarin', 'F.', ''], ['Choo', 'J.', ''], ['Nick', 'H. M.', '']]","['hydro-mechanical-chemical coupling', 'poroelasticity', 'reactive flow', 'mixed finiteelement method', 'enriched Galerkin method', 'local conservation']"
7690,2208.02953,Tarik A. Rashid,"Nitesh Banskota, Abeer Alsadoon, P.W.C. Prasad, Ahmed Dawoud, Tarik A.
  Rashid, Omar Hisham Alsadoon","A Novel Enhanced Convolution Neural Network with Extreme Learning
  Machine: Facial Emotional Recognition in Psychology Practices",19 pages,"Multimedia Tools and Applications, 2022",10.1007/s11042-022-13567-8,,cs.CV cs.LG cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Facial emotional recognition is one of the essential tools used by
recognition psychology to diagnose patients. Face and facial emotional
recognition are areas where machine learning is excelling. Facial Emotion
Recognition in an unconstrained environment is an open challenge for digital
image processing due to different environments, such as lighting conditions,
pose variation, yaw motion, and occlusions. Deep learning approaches have shown
significant improvements in image recognition. However, accuracy and time still
need improvements. This research aims to improve facial emotion recognition
accuracy during the training session and reduce processing time using a
modified Convolution Neural Network Enhanced with Extreme Learning Machine
(CNNEELM). The system entails (CNNEELM) improving the accuracy in image
registration during the training session. Furthermore, the system recognizes
six facial emotions happy, sad, disgust, fear, surprise, and neutral with the
proposed CNNEELM model. The study shows that the overall facial emotion
recognition accuracy is improved by 2% than the state of art solutions with a
modified Stochastic Gradient Descent (SGD) technique. With the Extreme Learning
Machine (ELM) classifier, the processing time is brought down to 65ms from
113ms, which can smoothly classify each frame from a video clip at 20fps. With
the pre-trained InceptionV3 model, the proposed CNNEELM model is trained with
JAFFE, CK+, and FER2013 expression datasets. The simulation results show
significant improvements in accuracy and processing time, making the model
suitable for the video analysis process. Besides, the study solves the issue of
the large processing time required to process the facial images.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2022 02:21:34 GMT'}]",2022-08-08,"[['Banskota', 'Nitesh', ''], ['Alsadoon', 'Abeer', ''], ['Prasad', 'P. W. C.', ''], ['Dawoud', 'Ahmed', ''], ['Rashid', 'Tarik A.', ''], ['Alsadoon', 'Omar Hisham', '']]","['Convolution Neural Network', 'Stochastic Gradient Descent', 'Log-likelihood Estimator', 'Optical Flow Estimation', 'Extreme Learning Machine', 'Cross-Entropy Loss']"
7691,cs/0407060,Andrea Montanari,Andrea Montanari,Tight bounds for LDPC and LDGM codes under MAP decoding,"28 pages, 9 eps figures; Second version contains a generalization of
  the previous result","IEEE Trans. on Inf. Theory, vol.51, pp. 3221-3246 (2005)",10.1109/TIT.2005.853320,,cs.IT cond-mat.dis-nn math.IT,,"  A new method for analyzing low density parity check (LDPC) codes and low
density generator matrix (LDGM) codes under bit maximum a posteriori
probability (MAP) decoding is introduced. The method is based on a rigorous
approach to spin glasses developed by Francesco Guerra. It allows to construct
lower bounds on the entropy of the transmitted message conditional to the
received one. Based on heuristic statistical mechanics calculations, we
conjecture such bounds to be tight. The result holds for standard irregular
ensembles when used over binary input output symmetric channels. The method is
first developed for Tanner graph ensembles with Poisson left degree
distribution. It is then generalized to `multi-Poisson' graphs, and, by a
completion procedure, to arbitrary degree distribution.
","[{'version': 'v1', 'created': 'Sun, 25 Jul 2004 17:56:44 GMT'}, {'version': 'v2', 'created': 'Fri, 27 May 2005 10:59:43 GMT'}]",2016-11-18,"[['Montanari', 'Andrea', '']]","['Conditional entropy', 'Low Density Parity Check Codes', 'Maximum A Posteriori probability decoding', 'Spin glasses', 'Statistical physics']"
7692,2007.07229,Narjes Nikzad-Khasmakhi,"N. Nikzad-Khasmakhi, M. A. Balafar, M.Reza Feizi-Derakhshi, Cina
  Motamed","BERTERS: Multimodal Representation Learning for Expert Recommendation
  System with Transformer",,,10.1016/j.chaos.2021.111260,,cs.IR cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The objective of an expert recommendation system is to trace a set of
candidates' expertise and preferences, recognize their expertise patterns, and
identify experts. In this paper, we introduce a multimodal classification
approach for expert recommendation system (BERTERS). In our proposed system,
the modalities are derived from text (articles published by candidates) and
graph (their co-author connections) information. BERTERS converts text into a
vector using the Bidirectional Encoder Representations from Transformer (BERT).
Also, a graph Representation technique called ExEm is used to extract the
features of candidates from the co-author network. Final representation of a
candidate is the concatenation of these vectors and other features. Eventually,
a classifier is built on the concatenation of features. This multimodal
approach can be used in both the academic community and the community question
answering. To verify the effectiveness of BERTERS, we analyze its performance
on multi-label classification and visualization tasks.
","[{'version': 'v1', 'created': 'Tue, 30 Jun 2020 12:30:16 GMT'}]",2021-08-25,"[['Nikzad-Khasmakhi', 'N.', ''], ['Balafar', 'M. A.', ''], ['Feizi-Derakhshi', 'M. Reza', ''], ['Motamed', 'Cina', '']]","['Multimodal representation learning', 'Expert recommendation system', 'Transformer', 'Graph']"
7693,1907.04100,Pavel Rojtberg,"Pavel Rojtberg, Felix Gorschl\""uter","calibDB: enabling web based computer vision through on-the-fly camera
  calibration",,,10.1145/3329714.3338132,,cs.CV cs.NI eess.IV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  For many computer vision applications, the availability of camera calibration
data is crucial as overall quality heavily depends on it. While calibration
data is available on some devices through Augmented Reality (AR) frameworks
like ARCore and ARKit, for most cameras this information is not available.
Therefore, we propose a web based calibration service that not only aggregates
calibration data, but also allows calibrating new cameras on-the-fly. We build
upon a novel camera calibration framework that enables even novice users to
perform a precise camera calibration in about 2 minutes. This allows general
deployment of computer vision algorithms on the web, which was previously not
possible due to lack of calibration data.
","[{'version': 'v1', 'created': 'Tue, 9 Jul 2019 11:51:44 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Aug 2019 12:30:15 GMT'}]",2019-08-16,"[['Rojtberg', 'Pavel', ''], ['Gorschlüter', 'Felix', '']]","['computer vision', 'distributed systems', 'calibration', 'webxr']"
7694,2207.12998,Amr Elsayed Abdelfattah,Amr S. Abdelfattah,Student Research Abstract: Microservices-based Systems Visualization,"student research abstract. Proceedings of the 37th ACM/SIGAPP
  Symposium on Applied Computing. 2022",,10.1145/3477314.3506963,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The evolution of decentralized microservice-based systems is challenging.
These challenges are classified into static and dynamic categories. Regarding
the static perspective, documenting and visualizing the fluid application
topology is something few have been able to accomplish. Building an
architecture map of services design is a complicated task in its interpretation
rather than construction. Therefore, the system-centric and up-to-date view
became essential for such distributed systems. The dynamic perspective
considers the process of investigation and service path detection. Therefore
performing root cause analysis is a burdening task; such that tracing data is
needed to be put in the right context to facilitate the investigation.
Moreover, visualizing these traces over the traditional visualization
techniques couldn't be feasible with the large number of microservices involved
in the system. This paper proposes a visualization concept for
microservices-based systems using the Augmented Reality (AR) technique, which
merges these static and dynamic behaviors into a single centric view. In
addition, we challenge the difficulty related to tracing and debugging an issue
in such distributed systems. This concept is designed to work as a dynamic
documentation and traceability platform for these systems. A proof of concept
and a research study are implemented to show the viability and success of this
proposal.
","[{'version': 'v1', 'created': 'Sat, 23 Jul 2022 21:05:20 GMT'}]",2022-07-27,"[['Abdelfattah', 'Amr S.', '']]","['Microservices Traceability', 'Microservices Visualization', 'Architecture Reconstruction', 'Architecture Visualization', 'Augmented Reality']"
7695,2205.02033,Chifumi Nishioka,"Chifumi Nishioka, Michael F\""arber, Tarek Saier","How Does Author Affiliation Affect Preprint Citation Count? Analyzing
  Citation Bias at the Institution and Country Level","Accepted at the ACM/IEEE Joint Conference on Digital Libraries (JCDL)
  2022",,10.1145/3529372.3530953,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Citing is an important aspect of scientific discourse and important for
quantifying the scientific impact quantification of researchers. Previous works
observed that citations are made not only based on the pure scholarly
contributions but also based on non-scholarly attributes, such as the
affiliation or gender of authors. In this way, citation bias is produced.
Existing works, however, have not analyzed preprints with respect to citation
bias, although they play an increasingly important role in modern scholarly
communication. In this paper, we investigate whether preprints are affected by
citation bias with respect to the author affiliation. We measure citation bias
for bioRxiv preprints and their publisher versions at the institution level and
country level, using the Lorenz curve and Gini coefficient. This allows us to
mitigate the effects of confounding factors and see whether or not citation
biases related to author affiliation have an increased effect on preprint
citations. We observe consistent higher Gini coefficients for preprints than
those for publisher versions. Thus, we can confirm that citation bias exists
and that it is more severe in case of preprints. As preprints are on the rise,
affiliation-based citation bias is, thus, an important topic not only for
authors (e.g., when deciding what to cite), but also to people and institutions
that use citations for scientific impact quantification (e.g., funding agencies
deciding about funding based on citation counts).
","[{'version': 'v1', 'created': 'Wed, 4 May 2022 12:45:49 GMT'}]",2022-09-13,"[['Nishioka', 'Chifumi', ''], ['Färber', 'Michael', ''], ['Saier', 'Tarek', '']]","['preprint', 'bibliometrics', 'citation', 'bias']"
7696,1911.00322,Hao Deng,"Hao Deng, Shawn Hinnebusch, and Albert C. To","Topology Optimization Design of Stretchable Metamaterials with Bezier
  Skeleton Explicit Density (BSED) Representation Algorithm",30 pages,,10.1016/j.cma.2020.113093,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new density field representation technique called the Bezier skeleton
explicit density (BSED) representation scheme for topology optimization of
stretchable metamaterials under finite deformation is proposed for the first
time. The proposed approach overcomes a key deficiency in existing
density-based optimization methods that typically yield designs that do not
have smooth surfaces but have large number of small intricate features, which
are difficult to manufacture even by additive manufacturing. In the proposed
approach, Bezier curves are utilized to describe the skeleton of the design
being optimized where the description of the entire design is realized by
assigning thickness along the curves. This geometric representation technique
ensures that the optimized design is smooth and concise and can easily be tuned
to be manufacturable by additive manufacturing. In the optimization method, the
density field is described by the Heaviside function defined on the Bezier
curves. Compared to NURBS or B-spline based models, Bezier curves have fewer
control parameters and hence are easier to manipulate for sensitivity
derivation, especially for distance sensitivities. Due to its powerful curve
fitting ability, using Bezier curve to represent density field allows exploring
design space effectively and generating concise structures without any
intricate small features at the borders. Furthermore, this density
representation method is mesh independent and design variables are reduced
significantly so that optimization problem can be solved efficiently using
small-scale optimization algorithms such as sequential quadratic programming.
","[{'version': 'v1', 'created': 'Mon, 28 Oct 2019 18:36:12 GMT'}]",2020-06-24,"[['Deng', 'Hao', ''], ['Hinnebusch', 'Shawn', ''], ['To', 'Albert C.', '']]","['Topology optimization', 'Stretchable metamaterial', 'Bezier-based', 'SIMP']"
7697,2009.11722,Bogdan Trasnea,"Sorin Grigorescu, Tiberiu Cocias, Bogdan Trasnea, Andrea Margheri,
  Federico Lombardi, Leonardo Aniello","Cloud2Edge Elastic AI Framework for Prototyping and Deployment of AI
  Inference Engines in Autonomous Vehicles","21 pages Published in Sensors:
  https://www.mdpi.com/1424-8220/20/19/5450",,10.3390/s20195450,,cs.SE cs.AI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-driving cars and autonomous vehicles are revolutionizing the automotive
sector, shaping the future of mobility altogether. Although the integration of
novel technologies such as Artificial Intelligence (AI) and Cloud/Edge
computing provides golden opportunities to improve autonomous driving
applications, there is the need to modernize accordingly the whole prototyping
and deployment cycle of AI components. This paper proposes a novel framework
for developing so-called AI Inference Engines for autonomous driving
applications based on deep learning modules, where training tasks are deployed
elastically over both Cloud and Edge resources, with the purpose of reducing
the required network bandwidth, as well as mitigating privacy issues. Based on
our proposed data driven V-Model, we introduce a simple yet elegant solution
for the AI components development cycle, where prototyping takes place in the
cloud according to the Software-in-the-Loop (SiL) paradigm, while deployment
and evaluation on the target ECUs (Electronic Control Units) is performed as
Hardware-in-the-Loop (HiL) testing. The effectiveness of the proposed framework
is demonstrated using two real-world use-cases of AI inference engines for
autonomous vehicles, that is environment perception and most probable path
prediction.
","[{'version': 'v1', 'created': 'Wed, 23 Sep 2020 09:23:29 GMT'}]",2020-09-25,"[['Grigorescu', 'Sorin', ''], ['Cocias', 'Tiberiu', ''], ['Trasnea', 'Bogdan', ''], ['Margheri', 'Andrea', ''], ['Lombardi', 'Federico', ''], ['Aniello', 'Leonardo', '']]","['Autonomous Vehicles', 'Self-driving Cars', 'Artificial Intelligence', 'Deep Learning', 'Cloud Computing', 'Edge Computing']"
7698,2202.04752,Xinyi Zhou,"Xinyi Zhou, Kai Shu, Vir V. Phoha, Huan Liu, Reza Zafarani","""This is Fake! Shared it by Mistake"": Assessing the Intent of Fake News
  Spreaders",Accepted to The ACM Web Conference (WWW) 2022,,10.1145/3485447.3512264,,cs.SI cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Individuals can be misled by fake news and spread it unintentionally without
knowing it is false. This phenomenon has been frequently observed but has not
been investigated. Our aim in this work is to assess the intent of fake news
spreaders. To distinguish between intentional versus unintentional spreading,
we study the psychological explanations of unintentional spreading. With this
foundation, we then propose an influence graph, using which we assess the
intent of fake news spreaders. Our extensive experiments show that the assessed
intent can help significantly differentiate between intentional and
unintentional fake news spreaders. Furthermore, the estimated intent can
significantly improve the current techniques that detect fake news. To our best
knowledge, this is the first work to model individuals' intent in fake news
spreading.
","[{'version': 'v1', 'created': 'Wed, 9 Feb 2022 22:28:21 GMT'}, {'version': 'v2', 'created': 'Sun, 13 Feb 2022 21:26:46 GMT'}]",2022-02-15,"[['Zhou', 'Xinyi', ''], ['Shu', 'Kai', ''], ['Phoha', 'Vir V.', ''], ['Liu', 'Huan', ''], ['Zafarani', 'Reza', '']]","['Fake news', 'intent', 'social media']"
7699,1807.08291,Novanto Yudistira,Novanto Yudistira and Takio Kurita,"Correlation Net: Spatiotemporal multimodal deep learning for action
  recognition",,"Signal Processing: Image Communication, Volume 82, March 2020,
  115731",10.1016/j.image.2019.115731,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper describes a network that captures multimodal correlations over
arbitrary timestamps. The proposed scheme operates as a complementary, extended
network over a multimodal convolutional neural network (CNN). Spatial and
temporal streams are required for action recognition by a deep CNN, but
overfitting reduction and fusing these two streams remain open problems. The
existing fusion approach averages the two streams. Here we propose a
correlation network with a Shannon fusion for learning a pre-trained CNN. A
Long-range video may consist of spatiotemporal correlations over arbitrary
times, which can be captured by forming the correlation network from simple
fully connected layers. This approach was found to complement the existing
network fusion methods. The importance of multimodal correlation is validated
in comparison experiments on the UCF-101 and HMDB-51 datasets. The multimodal
correlation enhanced the accuracy of the video recognition results.
","[{'version': 'v1', 'created': 'Sun, 22 Jul 2018 14:48:32 GMT'}, {'version': 'v2', 'created': 'Sat, 6 Oct 2018 06:59:46 GMT'}, {'version': 'v3', 'created': 'Thu, 27 Dec 2018 05:01:31 GMT'}, {'version': 'v4', 'created': 'Wed, 20 Mar 2019 10:28:43 GMT'}, {'version': 'v5', 'created': 'Thu, 9 May 2019 01:40:45 GMT'}, {'version': 'v6', 'created': 'Mon, 16 Dec 2019 06:57:10 GMT'}]",2019-12-17,"[['Yudistira', 'Novanto', ''], ['Kurita', 'Takio', '']]","['Correlation Net', 'CNN', 'activity recognition', 'deep learning', 'fusion']"
7700,2107.02016,Gaojian Wang,"Gaojian Wang, Qian Jiang, Xin Jin and Xiaohui Cui","FFR_FD: Effective and Fast Detection of DeepFakes Based on Feature Point
  Defects","14 pages, 11 figures","Information Sciences, Volume 596, 2022, Pages 472-488",10.1016/j.ins.2022.03.026,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The internet is filled with fake face images and videos synthesized by deep
generative models. These realistic DeepFakes pose a challenge to determine the
authenticity of multimedia content. As countermeasures, artifact-based
detection methods suffer from insufficiently fine-grained features that lead to
limited detection performance. DNN-based detection methods are not efficient
enough, given that a DeepFake can be created easily by mobile apps and
DNN-based models require high computational resources. For the first time, we
show that DeepFake faces have fewer feature points than real ones, especially
in certain facial regions. Inspired by feature point detector-descriptors to
extract discriminative features at the pixel level, we propose the Fused Facial
Region_Feature Descriptor (FFR_FD) for effective and fast DeepFake detection.
FFR_FD is only a vector extracted from the face, and it can be constructed from
any feature point detector-descriptors. We train a random forest classifier
with FFR_FD and conduct extensive experiments on six large-scale DeepFake
datasets, whose results demonstrate that our method is superior to most state
of the art DNN-based models.
","[{'version': 'v1', 'created': 'Mon, 5 Jul 2021 13:35:39 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Aug 2021 07:42:41 GMT'}]",2022-03-31,"[['Wang', 'Gaojian', ''], ['Jiang', 'Qian', ''], ['Jin', 'Xin', ''], ['Cui', 'Xiaohui', '']]","['DeepFake detection', 'Feature detection-description', 'Deep generative models', 'Face forensics']"
7701,2109.01479,Maximilian Stubbemann,"Maximilian Stubbemann, Gerd Stumme","LG4AV: Combining Language Models and Graph Neural Networks for Author
  Verification","9 pages, 1 figure",,10.1007/978-3-031-01333-1_25,,cs.LG cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The automatic verification of document authorships is important in various
settings. Researchers are for example judged and compared by the amount and
impact of their publications and public figures are confronted by their posts
on social media platforms. Therefore, it is important that authorship
information in frequently used web services and platforms is correct. The
question whether a given document is written by a given author is commonly
referred to as authorship verification (AV). While AV is a widely investigated
problem in general, only few works consider settings where the documents are
short and written in a rather uniform style. This makes most approaches
unpractical for online databases and knowledge graphs in the scholarly domain.
Here, authorships of scientific publications have to be verified, often with
just abstracts and titles available. To this point, we present our novel
approach LG4AV which combines language models and graph neural networks for
authorship verification. By directly feeding the available texts in a
pre-trained transformer architecture, our model does not need any hand-crafted
stylometric features that are not meaningful in scenarios where the writing
style is, at least to some extent, standardized. By the incorporation of a
graph neural network structure, our model can benefit from relations between
authors that are meaningful with respect to the verification process. For
example, scientific authors are more likely to write about topics that are
addressed by their co-authors and twitter users tend to post about the same
subjects as people they follow. We experimentally evaluate our model and study
to which extent the inclusion of co-authorships enhances verification decisions
in bibliometric environments.
","[{'version': 'v1', 'created': 'Fri, 3 Sep 2021 12:45:28 GMT'}]",2022-08-25,"[['Stubbemann', 'Maximilian', ''], ['Stumme', 'Gerd', '']]","['authorship verification', 'language models', 'graph neural networks', 'co-authorships']"
7702,1904.10464,Francesco Torsello,Francesco Torsello,"$\mathtt{bimEX}$: A Mathematica package for exact computations in $3+1$
  bimetric relativity","9 pages. It matches with the published version. GitHub repository at
  https://github.com/nubirel/bimEX. Program files doi:
  http://dx.doi.org/10.17632/2s5d7csc9w.1",Computer Physics Communications 247 (2020) 106948,10.1016/j.cpc.2019.106948,,cs.SC astro-ph.CO cs.MS gr-qc,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present $\mathtt{bimEX}$, a Mathematica package for exact computations in
3$+$1 bimetric relativity. It is based on the $\mathtt{xAct}$ bundle, which can
handle computations involving both abstract tensors and their components. In
this communication, we refer to the latter case as concrete computations. The
package consists of two main parts. The first part involves the abstract
tensors, and focuses on how to deal with multiple metrics in $\mathtt{xAct}$.
The second part takes an ansatz for the primary variables in a chart as the
input, and returns the covariant BSSN bimetric equations in components in that
chart. Several functions are implemented to make this process as fast and
user-friendly as possible. The package has been used and tested extensively in
spherical symmetry and was the workhorse in obtaining the bimetric covariant
BSSN equations and reproducing the bimetric 3$+$1 equations in the spherical
polar chart.
","[{'version': 'v1', 'created': 'Tue, 23 Apr 2019 18:00:01 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Jan 2020 12:29:37 GMT'}]",2020-01-16,"[['Torsello', 'Francesco', '']]","['bimEX', 'Hassan–Rosen bimetric theory', 'bimetric relativity', '3 `1 formulation', 'BSSN', 'xAct']"
7703,2111.06854,Ling Cai,"Ling Cai, Krzysztof Janowic, Bo Yan, Rui Zhu and Gengchen Mai",Time in a Box: Advancing Knowledge Graph Completion with Temporal Scopes,,,10.1145/3460210.3493566,,cs.AI,http://creativecommons.org/publicdomain/zero/1.0/,"  Almost all statements in knowledge bases have a temporal scope during which
they are valid. Hence, knowledge base completion (KBC) on temporal knowledge
bases (TKB), where each statement \textit{may} be associated with a temporal
scope, has attracted growing attention. Prior works assume that each statement
in a TKB \textit{must} be associated with a temporal scope. This ignores the
fact that the scoping information is commonly missing in a KB. Thus prior work
is typically incapable of handling generic use cases where a TKB is composed of
temporal statements with/without a known temporal scope. In order to address
this issue, we establish a new knowledge base embedding framework, called
TIME2BOX, that can deal with atemporal and temporal statements of different
types simultaneously. Our main insight is that answers to a temporal query
always belong to a subset of answers to a time-agnostic counterpart. Put
differently, time is a filter that helps pick out answers to be correct during
certain periods. We introduce boxes to represent a set of answer entities to a
time-agnostic query. The filtering functionality of time is modeled by
intersections over these boxes. In addition, we generalize current evaluation
protocols on time interval prediction. We describe experiments on two datasets
and show that the proposed method outperforms state-of-the-art (SOTA) methods
on both link prediction and time prediction.
","[{'version': 'v1', 'created': 'Fri, 12 Nov 2021 18:17:07 GMT'}]",2021-11-15,"[['Cai', 'Ling', ''], ['Janowic', 'Krzysztof', ''], ['Yan', 'Bo', ''], ['Zhu', 'Rui', ''], ['Mai', 'Gengchen', '']]","['Temporal Knowledge Base', 'TIME2BOX', 'Link Prediction', 'Time Prediction']"
7704,2203.09277,Floriment Klinaku,"Floriment Klinaku, Martina Rapp, J\""org Henss, Stephan Rhode","Beauty and the beast: A case study on performance prototyping of
  data-intensive containerized cloud applications",,,10.1145/3491204.3527482,,cs.SE cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data-intensive container-based cloud applications have become popular with
the increased use cases in the Internet of Things domain. Challenges arise when
engineering such applications to meet quality requirements, both classical ones
like performance and emerging ones like elasticity and resilience. There is a
lack of reference use cases, applications, and experiences when prototyping
such applications that could benefit the research community. Moreover, it is
hard to generate realistic and reliable workloads that exercise the resources
according to a specification. Hence, designing reference applications that
would exhibit similar performance behavior in such environments is hard. In
this paper, we present a work in progress towards a reference use case and
application for data-intensive containerized cloud applications having an
industrial motivation. Moreover, to generate reliable CPU workloads we make use
of ProtoCom, a well-known library for the generation of resource demands, and
report the performance under various quality requirements in a Kubernetes
cluster of moderate size. Finally, we present the scalability of the current
solution assuming a particular autoscaling policy. Results of the calibration
show high variability of the ProtoCom library when executed in a cloud
environment. We observe a moderate association between the occupancy of node
and the relative variability of execution time.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2022 12:01:33 GMT'}]",2022-07-22,"[['Klinaku', 'Floriment', ''], ['Rapp', 'Martina', ''], ['Henss', 'Jörg', ''], ['Rhode', 'Stephan', '']]","['cloud', 'elasticity', 'modelling']"
7705,2001.06077,Somayyeh Firoozi,"Reza Fotohi, Somayyeh Firoozi Bari, Mehdi Yusefi","Securing Wireless Sensor Networks Against Denial-of-Sleep Attacks Using
  RSA Cryptography Algorithm and Interlock Protocol","30 pages, 13 figures, journal","International Journal of Communication Systems, e4234. (2019)",10.1002/dac.4234,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless sensor networks (WSNs) have been vastly employed in the collection
and transmission of data via wireless networks. This type of network is
nowadays used in many applications for surveillance activities in various
environments due to its low cost and easy communications. In these networks,
the sensors use a limited power source which after its depletion, since it is
non-renewable, network lifetime ends. Due to the weaknesses in sensor nodes,
they are vulnerable to many threats. One notable attack threating WSN is Denial
of Sleep (DoS). DoS attacks denotes the loss of energy in these sensors by
keeping the nodes from going into sleep and energy-saving mode. In this paper,
the Abnormal Sensor Detection Accuracy (ASDA-RSA) method is utilised to
counteract DoS attacks to reducing the amount of energy consumed. The ASDA-RSA
schema in this paper consists of two phases to enhancement security in the
WSNs. In the first phase, a clustering approach based on energy and distance is
used to select the proper cluster head and in the second phase, the RSA
cryptography algorithm and interlock protocol are used here along with an
authentication method, to prevent DoS attacks. Moreover, ASDA-RSA method is
evaluated here via extensive simulations carried out in NS-2. The simulation
results indicate that the WSN network performance metrics are improved in terms
of average throughput, Packet Delivery Ratio (PDR), network lifetime, detection
ratio, and average residual energy.
","[{'version': 'v1', 'created': 'Thu, 16 Jan 2020 21:33:33 GMT'}]",2020-01-20,"[['Fotohi', 'Reza', ''], ['Bari', 'Somayyeh Firoozi', ''], ['Yusefi', 'Mehdi', '']]","['WSNs', 'Denial of Sleep Attack', 'Network lifetime', 'RSA cryptography', 'ASDA-RSA']"
7706,2006.02138,Namwoo Kang,"Soyoung Yoo, Sunghee Lee, Seongsin Kim, Kwang Hyeon Hwang, Jong Ho
  Park, Namwoo Kang","Integrating Deep Learning into CAD/CAE System: Generative Design and
  Evaluation of 3D Conceptual Wheel",,"Structural and Multidisciplinary Optimization, 64(4), pp.
  2725-2747 (2021)",10.1007/s00158-021-02953-9,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Engineering design research integrating artificial intelligence (AI) into
computer-aided design (CAD) and computer-aided engineering (CAE) is actively
being conducted. This study proposes a deep learning-based CAD/CAE framework in
the conceptual design phase that automatically generates 3D CAD designs and
evaluates their engineering performance. The proposed framework comprises seven
stages: (1) 2D generative design, (2) dimensionality reduction, (3) design of
experiment in latent space, (4) CAD automation, (5) CAE automation, (6)
transfer learning, and (7) visualization and analysis. The proposed framework
is demonstrated through a road wheel design case study and indicates that AI
can be practically incorporated into an end-use product design project.
Engineers and industrial designers can jointly review a large number of
generated 3D CAD models by using this framework along with the engineering
performance results estimated by AI and find conceptual design candidates for
the subsequent detailed design stage.
","[{'version': 'v1', 'created': 'Mon, 25 May 2020 16:48:13 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Feb 2021 13:36:30 GMT'}, {'version': 'v3', 'created': 'Sun, 13 Jun 2021 05:35:04 GMT'}]",2022-10-04,"[['Yoo', 'Soyoung', ''], ['Lee', 'Sunghee', ''], ['Kim', 'Seongsin', ''], ['Hwang', 'Kwang Hyeon', ''], ['Park', 'Jong Ho', ''], ['Kang', 'Namwoo', '']]","['Artificial Intelligence', 'Deep Learning', 'CAD', 'CAE', 'Generative Design', 'Topology Optimization']"
7707,2012.11870,Khan Md. Hasib,"Khan Md. Hasib, Md. Sadiq Iqbal, Faisal Muhammad Shah, Jubayer Al
  Mahmud, Mahmudul Hasan Popel, Md. Imran Hossain Showrov, Shakil Ahmed,
  Obaidur Rahman","A Survey of Methods for Managing the Classification and Solution of Data
  Imbalance Problem","12 Pages, 2 Figures","Journal of Computer Science, Volume 16, Issue 11, Year 2020, Page
  - 1546-1557",10.3844/jcssp.2020.1546.1557,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The problem of class imbalance is extensive for focusing on numerous
applications in the real world. In such a situation, nearly all of the examples
are labeled as one class called majority class, while far fewer examples are
labeled as the other class usually, the more important class is called
minority. Over the last few years, several types of research have been carried
out on the issue of class imbalance, including data sampling, cost-sensitive
analysis, Genetic Programming based models, bagging, boosting, etc.
Nevertheless, in this survey paper, we enlisted the 24 related studies in the
years 2003, 2008, 2010, 2012 and 2014 to 2019, focusing on the architecture of
single, hybrid, and ensemble method design to understand the current status of
improving classification output in machine learning techniques to fix problems
with class imbalances. This survey paper also includes a statistical analysis
of the classification algorithms under various methods and several other
experimental conditions, as well as datasets used in different research papers.
","[{'version': 'v1', 'created': 'Tue, 22 Dec 2020 08:03:22 GMT'}]",2020-12-23,"[['Hasib', 'Khan Md.', ''], ['Iqbal', 'Md. Sadiq', ''], ['Shah', 'Faisal Muhammad', ''], ['Mahmud', 'Jubayer Al', ''], ['Popel', 'Mahmudul Hasan', ''], ['Showrov', 'Md. Imran Hossain', ''], ['Ahmed', 'Shakil', ''], ['Rahman', 'Obaidur', '']]","['Class Imbalance', 'Ensemble', 'Survey Methods', 'Hybrid']"
7708,2001.01128,Ilan Ben-Bassat,Ilan Ben-Bassat and Erez Rokah,"Locality-Sensitive Hashing for Efficient Web Application Security
  Testing",,"In Proceedings of the 5th International Conference on Information
  Systems Security and Privacy (ICISSP), pages 193-204 (2019)",10.5220/0007255301930204,,cs.CR cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Web application security has become a major concern in recent years, as more
and more content and services are available online. A useful method for
identifying security vulnerabilities is black-box testing, which relies on an
automated crawling of web applications. However, crawling Rich Internet
Applications (RIAs) is a very challenging task. One of the key obstacles
crawlers face is the state similarity problem: how to determine if two
client-side states are equivalent. As current methods do not completely solve
this problem, a successful scan of many real-world RIAs is still not possible.
We present a novel approach to detect redundant content for security testing
purposes. The algorithm applies locality-sensitive hashing using MinHash
sketches in order to analyze the Document Object Model (DOM) structure of web
pages, and to efficiently estimate similarity between them. Our experimental
results show that this approach allows a successful scan of RIAs that cannot be
crawled otherwise.
","[{'version': 'v1', 'created': 'Sat, 4 Jan 2020 21:05:15 GMT'}]",2020-01-07,"[['Ben-Bassat', 'Ilan', ''], ['Rokah', 'Erez', '']]","['Security Testing', 'Automated Crawling', 'Rich Internet Applications', 'DOM Similarity', 'Locality-SensitiveHashing', 'MinHash']"
7709,1912.11270,Ahmad Sakor,"Ahmad Sakor, Kuldeep Singh, Anery Patel, Maria-Esther Vidal",Falcon 2.0: An Entity and Relation Linking Tool over Wikidata,CIKM 2020 Paper 8 pages,,10.1145/3340531.3412777,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  The Natural Language Processing (NLP) community has significantly contributed
to the solutions for entity and relation recognition from the text, and
possibly linking them to proper matches in Knowledge Graphs (KGs). Considering
Wikidata as the background KG, still, there are limited tools to link knowledge
within the text to Wikidata. In this paper, we present Falcon 2.0, first joint
entity, and relation linking tool over Wikidata. It receives a short natural
language text in the English language and outputs a ranked list of entities and
relations annotated with the proper candidates in Wikidata. The candidates are
represented by their Internationalized Resource Identifier (IRI) in Wikidata.
Falcon 2.0 resorts to the English language model for the recognition task
(e.g., N-Gram tiling and N-Gram splitting), and then an optimization approach
for linking task. We have empirically studied the performance of Falcon 2.0 on
Wikidata and concluded that it outperforms all the existing baselines. Falcon
2.0 is public and can be reused by the community; all the required instructions
of Falcon 2.0 are well-documented at our GitHub repository. We also demonstrate
an online API, which can be run without any technical expertise. Falcon 2.0 and
its background knowledge bases are available as resources at
https://labs.tib.eu/falcon/falcon2/.
","[{'version': 'v1', 'created': 'Tue, 24 Dec 2019 09:53:27 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Dec 2019 16:22:04 GMT'}, {'version': 'v3', 'created': 'Thu, 9 Jan 2020 13:40:06 GMT'}, {'version': 'v4', 'created': 'Wed, 12 Feb 2020 18:32:14 GMT'}, {'version': 'v5', 'created': 'Mon, 27 Jul 2020 15:12:14 GMT'}, {'version': 'v6', 'created': 'Mon, 3 Aug 2020 15:24:22 GMT'}, {'version': 'v7', 'created': 'Mon, 31 Aug 2020 21:24:10 GMT'}]",2020-09-02,"[['Sakor', 'Ahmad', ''], ['Singh', 'Kuldeep', ''], ['Patel', 'Anery', ''], ['Vidal', 'Maria-Esther', '']]","['NLP', 'Entity Linking', 'Relation Linking', 'Background Knowledge', 'English morphology', 'DBpedia', 'Wikidata']"
7710,1909.08844,Vishal Sharma,"Gaurav Choudhary, Vishal Sharma","A Survey on the Security and the Evolution of Osmotic and Catalytic
  Computing for 5G Networks","34 pages, 7 tables, 7 figures, Published In 5G Enabled Secure
  Wireless Networks, pp. 69-102. Springer, Cham, 2019","In 5G Enabled Secure Wireless Networks, pp. 69-102. Springer,
  Cham, 2019",10.1007/978-3-030-03508-2_3,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The 5G networks have the capability to provide high compatibility for the new
applications, industries, and business models. These networks can tremendously
improve the quality of life by enabling various use cases that require high
data-rate, low latency, and continuous connectivity for applications pertaining
to eHealth, automatic vehicles, smart cities, smart grid, and the Internet of
Things (IoT). However, these applications need secure servicing as well as
resource policing for effective network formations. There have been a lot of
studies, which emphasized the security aspects of 5G networks while focusing
only on the adaptability features of these networks. However, there is a gap in
the literature which particularly needs to follow recent computing paradigms as
alternative mechanisms for the enhancement of security. To cover this, a
detailed description of the security for the 5G networks is presented in this
article along with the discussions on the evolution of osmotic and catalytic
computing-based security modules. The taxonomy on the basis of security
requirements is presented, which also includes the comparison of the existing
state-of-the-art solutions. This article also provides a security model,
""CATMOSIS"", which idealizes the incorporation of security features on the basis
of catalytic and osmotic computing in the 5G networks. Finally, various
security challenges and open issues are discussed to emphasize the works to
follow in this direction of research.
","[{'version': 'v1', 'created': 'Thu, 19 Sep 2019 08:10:54 GMT'}]",2019-09-20,"[['Choudhary', 'Gaurav', ''], ['Sharma', 'Vishal', '']]","['5G', 'Security', 'Osmotic Computing', 'Catalytic Computing']"
7711,2209.08433,Jiajing Xu,Andrey Gusev and Jiajing Xu,Evolution of a Web-Scale Near Duplicate Image Detection System,,,10.1145/3366423.3380031,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Detecting near duplicate images is fundamental to the content ecosystem of
photo sharing web applications. However, such a task is challenging when
involving a web-scale image corpus containing billions of images. In this
paper, we present an efficient system for detecting near duplicate images
across 8 billion images. Our system consists of three stages: candidate
generation, candidate selection, and clustering. We also demonstrate that this
system can be used to greatly improve the quality of recommendations and search
results across a number of real-world applications.
  In addition, we include the evolution of the system over the course of six
years, bringing out experiences and lessons on how new systems are designed to
accommodate organic content growth as well as the latest technology. Finally,
we are releasing a human-labeled dataset of ~53,000 pairs of images introduced
in this paper.
","[{'version': 'v1', 'created': 'Sun, 18 Sep 2022 00:57:50 GMT'}]",2022-09-20,"[['Gusev', 'Andrey', ''], ['Xu', 'Jiajing', '']]","['near-duplicate detection', 'recommendation systems', 'locality sensitive hashing', 'transfer learning', 'clustering']"
7712,2104.12182,Jingbo Zhao,"Jingbo Zhao, Ruize An, Ruolin Xu, Banghao Lin","Comparing Hand Gestures and a Gamepad Interface for Locomotion in
  Virtual Environments",,"International Journal of Human-Computer Studies,Volume 166,October
  2022,102868",10.1016/j.ijhcs.2022.102868,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Hand gesture is a new and promising interface for locomotion in virtual
environments. While several previous studies have proposed different hand
gestures for virtual locomotion, little is known about their differences in
terms of performance and user preference in virtual locomotion tasks. In the
present paper, we presented three different hand gesture interfaces and their
algorithms for locomotion, which are called the Finger Distance gesture, the
Finger Number gesture and the Finger Tapping gesture. These gestures were
inspired by previous studies of gesture-based locomotion interfaces and are
typical gestures that people are familiar with in their daily lives.
Implementing these hand gesture interfaces in the present study enabled us to
systematically compare the differences between these gestures. In addition, to
compare the usability of these gestures to locomotion interfaces using
gamepads, we also designed and implemented a gamepad interface based on the
Xbox One controller. We conducted empirical studies to compare these four
interfaces through two virtual locomotion tasks. A desktop setup was used
instead of sharing a head-mounted display among participants due to the concern
of the Covid-19 situation. Through these tasks, we assessed the performance and
user preference of these interfaces on speed control and waypoints navigation.
Results showed that user preference and performance of the Finger Distance
gesture were close to that of the gamepad interface. The Finger Number gesture
also had close performance and user preference to that of the Finger Distance
gesture. Our study demonstrates that the Finger Distance gesture and the Finger
Number gesture are very promising interfaces for virtual locomotion. We also
discuss that the Finger Tapping gesture needs further improvements before it
can be used for virtual walking.
","[{'version': 'v1', 'created': 'Sun, 25 Apr 2021 15:25:24 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Oct 2021 09:06:00 GMT'}, {'version': 'v3', 'created': 'Mon, 12 Dec 2022 03:21:27 GMT'}]",2022-12-13,"[['Zhao', 'Jingbo', ''], ['An', 'Ruize', ''], ['Xu', 'Ruolin', ''], ['Lin', 'Banghao', '']]","['Virtual locomotion', 'hand gestures', 'locomotion interfaces']"
7713,2204.07637,Benjamin Doerr,"Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim",Towards a Stronger Theory for Permutation-based Evolutionary Algorithms,"Conference version with an appendix containing the proofs omitted for
  reasons of space",GECCO 2022: 1390-1398,10.1145/3512290.3528720,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While the theoretical analysis of evolutionary algorithms (EAs) has made
significant progress for pseudo-Boolean optimization problems in the last 25
years, only sporadic theoretical results exist on how EAs solve
permutation-based problems.
  To overcome the lack of permutation-based benchmark problems, we propose a
general way to transfer the classic pseudo-Boolean benchmarks into benchmarks
defined on sets of permutations. We then conduct a rigorous runtime analysis of
the permutation-based $(1+1)$ EA proposed by Scharnow, Tinnefeld, and Wegener
(2004) on the analogues of the \textsc{LeadingOnes} and \textsc{Jump}
benchmarks. The latter shows that, different from bit-strings, it is not only
the Hamming distance that determines how difficult it is to mutate a
permutation $\sigma$ into another one $\tau$, but also the precise cycle
structure of $\sigma \tau^{-1}$. For this reason, we also regard the more
symmetric scramble mutation operator. We observe that it not only leads to
simpler proofs, but also reduces the runtime on jump functions with odd jump
size by a factor of $\Theta(n)$. Finally, we show that a heavy-tailed version
of the scramble operator, as in the bit-string case, leads to a speed-up of
order $m^{\Theta(m)}$ on jump functions with jump size~$m$.%
","[{'version': 'v1', 'created': 'Fri, 15 Apr 2022 20:36:35 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Oct 2022 11:59:24 GMT'}]",2022-10-07,"[['Doerr', 'Benjamin', ''], ['Ghannane', 'Yassine', ''], ['Brahim', 'Marouane Ibn', '']]","['Runtime analysis', 'permutation search spaces', 'mutation', 'theory']"
7714,1506.08518,Gabriele Fici,"Gabriele Fici, Tomasz Kociumaka, Thierry Lecroq, Arnaud Lefebvre,
  Elise Prieur-Gaston",Fast Computation of Abelian Runs,To appear in Theoretical Computer Science,"Theoretical Computer Science, 656 Part B: 256-264, 2016",10.1016/j.tcs.2015.12.010,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a word $w$ and a Parikh vector $\mathcal{P}$, an abelian run of period
$\mathcal{P}$ in $w$ is a maximal occurrence of a substring of $w$ having
abelian period $\mathcal{P}$. Our main result is an online algorithm that,
given a word $w$ of length $n$ over an alphabet of cardinality $\sigma$ and a
Parikh vector $\mathcal{P}$, returns all the abelian runs of period
$\mathcal{P}$ in $w$ in time $O(n)$ and space $O(\sigma+p)$, where $p$ is the
norm of $\mathcal{P}$, i.e., the sum of its components. We also present an
online algorithm that computes all the abelian runs with periods of norm $p$ in
$w$ in time $O(np)$, for any given norm $p$. Finally, we give an $O(n^2)$-time
offline randomized algorithm for computing all the abelian runs of $w$. Its
deterministic counterpart runs in $O(n^2\log\sigma)$ time.
","[{'version': 'v1', 'created': 'Mon, 29 Jun 2015 06:24:08 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Dec 2015 08:31:43 GMT'}]",2017-01-02,"[['Fici', 'Gabriele', ''], ['Kociumaka', 'Tomasz', ''], ['Lecroq', 'Thierry', ''], ['Lefebvre', 'Arnaud', ''], ['Prieur-Gaston', 'Elise', '']]","['Combinatorics on Words', 'Text Algorithms', 'Abelian Period', 'Abelian Run']"
7715,2209.06056,Xianghang Mi,"Mingshuo Yang, Yunnan Yu, Xianghang Mi, Shujun Tang, Shanqing Guo,
  Yilin Li, Xiaofeng Zheng, Haixin Duan",An Extensive Study of Residential Proxies in China,To appear in ACM CCS 2022,,10.1145/3548606.3559377,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We carry out the first in-depth characterization of residential proxies
(RESIPs) in China, for which little is studied in previous works. Our study is
made possible through a semantic-based classifier to automatically capture
RESIP services. In addition to the classifier, new techniques have also been
identified to capture RESIPs without interacting with and relaying traffic
through RESIP services, which can significantly lower the cost and thus allow a
continuous monitoring of RESIPs. Our RESIP service classifier has achieved a
good performance with a recall of 99.7% and a precision of 97.6% in 10-fold
cross validation. Applying the classifier has identified 399 RESIP services, a
much larger set compared to 38 RESIP services collected in all previous works.
Our effort of RESIP capturing lead to a collection of 9,077,278 RESIP IPs
(51.36% are located in China), 96.70% of which are not covered in publicly
available RESIP datasets. An extensive measurement on RESIPs and their services
has uncovered a set of interesting findings as well as several security
implications. Especially, 80.05% RESIP IPs located in China have sourced at
least one malicious traffic flows during 2021, resulting in 52-million
malicious traffic flows in total. And RESIPs have also been observed in
corporation networks of 559 sensitive organizations including government
agencies, education institutions and enterprises. Also, 3,232,698 China RESIP
IPs have opened at least one TCP/UDP ports for accepting relaying requests,
which incurs non-negligible security risks to the local network of RESIPs.
Besides, 91% China RESIP IPs are of a lifetime less than 10 days while most
China RESIP services show up a crest-trough pattern in terms of the daily
active RESIPs across time.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2022 15:07:42 GMT'}]",2022-09-14,"[['Yang', 'Mingshuo', ''], ['Yu', 'Yunnan', ''], ['Mi', 'Xianghang', ''], ['Tang', 'Shujun', ''], ['Guo', 'Shanqing', ''], ['Li', 'Yilin', ''], ['Zheng', 'Xiaofeng', ''], ['Duan', 'Haixin', '']]","['residential proxy', 'web proxy', 'anonymity', 'network security']"
7716,2012.10431,"Elias Gr\""unewald","Elias Gr\""unewald and Frank Pallas","TILT: A GDPR-Aligned Transparency Information Language and Toolkit for
  Practical Privacy Engineering","Accepted for publication at the ACM Conference on Fairness,
  Accountability, and Transparency 2021 (ACM FAccT'21). This is a preprint
  manuscript (authors' own version before final copy-editing)",,10.1145/3442188.3445925,,cs.CY cs.CR cs.FL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present TILT, a transparency information language and
toolkit explicitly designed to represent and process transparency information
in line with the requirements of the GDPR and allowing for a more automated and
adaptive use of such information than established, legalese data protection
policies do.
  We provide a detailed analysis of transparency obligations from the GDPR to
identify the expressiveness required for a formal transparency language
intended to meet respective legal requirements. In addition, we identify a set
of further, non-functional requirements that need to be met to foster practical
adoption in real-world (web) information systems engineering. On this basis, we
specify our formal language and present a respective, fully implemented toolkit
around it. We then evaluate the practical applicability of our language and
toolkit and demonstrate the additional prospects it unlocks through two
different use cases: a) the inter-organizational analysis of personal
data-related practices allowing, for instance, to uncover data sharing networks
based on explicitly announced transparency information and b) the presentation
of formally represented transparency information to users through novel, more
comprehensible, and potentially adaptive user interfaces, heightening data
subjects' actual informedness about data-related practices and, thus, their
sovereignty.
  Altogether, our transparency information language and toolkit allow -
differently from previous work - to express transparency information in line
with actual legal requirements and practices of modern (web) information
systems engineering and thereby pave the way for a multitude of novel
possibilities to heighten transparency and user sovereignty in practice.
","[{'version': 'v1', 'created': 'Fri, 18 Dec 2020 18:45:04 GMT'}]",2022-09-26,"[['Grünewald', 'Elias', ''], ['Pallas', 'Frank', '']]","['Data transparency', 'GDPR', 'data protection', 'privacy by design', 'legalinformatics', 'privacy engineering']"
7717,1906.03488,Trung Hieu Tran,"Hieu Tran, Ngoc Tran, Son Nguyen, Hoan Nguyen, Tien Nguyen",Recovering Variable Names for Minified Code with Usage Contexts,"11 pages, 6 figures, ICSE 2019",,10.1109/ICSE.2019.00119,,cs.SE cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In modern Web technology, JavaScript (JS) code plays an important role. To
avoid the exposure of original source code, the variable names in JS code
deployed in the wild are often replaced by short, meaningless names, thus
making the code extremely difficult to manually understand and analysis. This
paper presents JSNeat, an information retrieval (IR)-based approach to recover
the variable names in minified JS code. JSNeat follows a data-driven approach
to recover names by searching for them in a large corpus of open-source JS
code. We use three types of contexts to match a variable in given minified code
against the corpus including the context of properties and roles of the
variable, the context of that variable and relations with other variables under
recovery, and the context of the task of the function to which the variable
contributes. We performed several empirical experiments to evaluate JSNeat on
the dataset of more than 322K JS files with 1M functions, and 3.5M variables
with 176K unique variable names. We found that JSNeat achieves a high accuracy
of 69.1%, which is the relative improvements of 66.1% and 43% over two
state-of-the-art approaches JSNice and JSNaughty, respectively. The time to
recover for a file or for a variable with JSNeat is twice as fast as with
JSNice and 4x as fast as with JNaughty, respectively.
","[{'version': 'v1', 'created': 'Sat, 8 Jun 2019 17:00:55 GMT'}]",2019-06-11,"[['Tran', 'Hieu', ''], ['Tran', 'Ngoc', ''], ['Nguyen', 'Son', ''], ['Nguyen', 'Hoan', ''], ['Nguyen', 'Tien', '']]","['Minified JS Code', 'Variable Name Recovery', 'Naturalness of Code', 'Usage Contexts']"
7718,1812.09134,Roni Saputra Permana,Roni Permana Saputra and Petar Kormushev,"ResQbot: A Mobile Rescue Robot with Immersive Teleperception for
  Casualty Extraction",Published in TAROS 2018,"Saputra R.P., Kormushev P. (2018) ResQbot: A Mobile Rescue Robot
  with Immersive Teleperception for Casualty Extraction. In: Towards Autonomous
  Robotic Systems. TAROS 2018. Lecture Notes in Computer Science, vol 10965.
  Springer, Cham",10.1007/978-3-319-96728-8_18,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we propose a novel mobile rescue robot equipped with an
immersive stereoscopic teleperception and a teleoperation control. This robot
is designed with the capability to perform safely a casualty-extraction
procedure. We have built a proof-of-concept mobile rescue robot called ResQbot
for the experimental platform. An approach called ""loco-manipulation"" is used
to perform the casualty-extraction procedure using the platform. The
performance of this robot is evaluated in terms of task accomplishment and
safety by conducting a mock rescue experiment. We use a custom-made human-sized
dummy that has been sensorised to be used as the casualty. In terms of safety,
we observe several parameters during the experiment including impact force,
acceleration, speed and displacement of the dummy's head. We also compare the
performance of the proposed immersive stereoscopic teleperception to
conventional monocular teleperception. The results of the experiments show that
the observed safety parameters are below key safety thresholds which could
possibly lead to head or neck injuries. Moreover, the teleperception comparison
results demonstrate an improvement in task-accomplishment performance when the
operator is using the immersive teleperception.
","[{'version': 'v1', 'created': 'Fri, 21 Dec 2018 14:16:33 GMT'}]",2018-12-24,"[['Saputra', 'Roni Permana', ''], ['Kormushev', 'Petar', '']]","['mobile rescue robot', 'immersive teleperception', 'casualty extraction', 'loco-manipulation']"
7719,2206.11064,Ning Gui Prof. dr.,"Jiawen Wei, Fangyuan Wang, Wanxin Zeng, Wenwei Lin and Ning Gui",An Embedded Feature Selection Framework for Control,"9 pages, 9 figures, accepted by SIGKDD 2022",,10.1145/3534678.3539290,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Reducing sensor requirements while keeping optimal control performance is
crucial to many industrial control applications to achieve robust, low-cost,
and computation-efficient controllers. However, existing feature selection
solutions for the typical machine learning domain can hardly be applied in the
domain of control with changing dynamics. In this paper, a novel framework,
namely the Dual-world embedded Attentive Feature Selection (D-AFS), can
efficiently select the most relevant sensors for the system under dynamic
control. Rather than the one world used in most Deep Reinforcement Learning
(DRL) algorithms, D-AFS has both the real world and its virtual peer with
twisted features. By analyzing the DRL's response in two worlds, D-AFS can
quantitatively identify respective features' importance towards control. A
well-known active flow control problem, cylinder drag reduction, is used for
evaluation. Results show that D-AFS successfully finds an optimized five-probes
layout with 18.7\% drag reduction than the state-of-the-art solution with 151
probes and 49.2\% reduction than five-probes layout by human experts. We also
apply this solution to four OpenAI classical control cases. In all cases, D-AFS
achieves the same or better sensor configurations than originally provided
solutions. Results highlight, we argued, a new way to achieve efficient and
optimal sensor designs for experimental or industrial systems. Our source codes
are made publicly available at https://github.com/G-AILab/DAFSFluid.
","[{'version': 'v1', 'created': 'Sun, 19 Jun 2022 07:03:40 GMT'}]",2022-06-23,"[['Wei', 'Jiawen', ''], ['Wang', 'Fangyuan', ''], ['Zeng', 'Wanxin', ''], ['Lin', 'Wenwei', ''], ['Gui', 'Ning', '']]","['Deep Reinforcement Learning', 'Feature Selection', 'Optimal SensorPlacement']"
7720,2108.11559,Jingcheng Ni,"Jingcheng Ni, Jie Qin, Di Huang",Identity-aware Graph Memory Network for Action Detection,Accepted by ACM MM2021,,10.1145/3474085.3475503,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Action detection plays an important role in high-level video understanding
and media interpretation. Many existing studies fulfill this spatio-temporal
localization by modeling the context, capturing the relationship of actors,
objects, and scenes conveyed in the video. However, they often universally
treat all the actors without considering the consistency and distinctness
between individuals, leaving much room for improvement. In this paper, we
explicitly highlight the identity information of the actors in terms of both
long-term and short-term context through a graph memory network, namely
identity-aware graph memory network (IGMN). Specifically, we propose the
hierarchical graph neural network (HGNN) to comprehensively conduct long-term
relation modeling within the same identity as well as between different ones.
Regarding short-term context, we develop a dual attention module (DAM) to
generate identity-aware constraint to reduce the influence of interference by
the actors of different identities. Extensive experiments on the challenging
AVA dataset demonstrate the effectiveness of our method, which achieves
state-of-the-art results on AVA v2.1 and v2.2.
","[{'version': 'v1', 'created': 'Thu, 26 Aug 2021 02:34:55 GMT'}]",2021-08-27,"[['Ni', 'Jingcheng', ''], ['Qin', 'Jie', ''], ['Huang', 'Di', '']]","['Video Understanding', 'Action Detection', 'Memory Network']"
7721,2009.05105,Ali Ayub,"Ali Ayub, Alan R. Wagner","What am I allowed to do here?: Online Learning of Context-Specific Norms
  by Pepper","The final authenticated publication is available online at
  https://doi.org/10.1007/978-3-030-62056-1_19","International Conference on Social Robotics (ICSR), 2020",10.1007/978-3-030-62056-1_19,,cs.CV cs.HC cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Social norms support coordination and cooperation in society. With social
robots becoming increasingly involved in our society, they also need to follow
the social norms of the society. This paper presents a computational framework
for learning contexts and the social norms present in a context in an online
manner on a robot. The paper utilizes a recent state-of-the-art approach for
incremental learning and adapts it for online learning of scenes (contexts).
The paper further utilizes Dempster-Schafer theory to model context-specific
norms. After learning the scenes (contexts), we use active learning to learn
related norms. We test our approach on the Pepper robot by taking it through
different scene locations. Our results show that Pepper can learn different
scenes and related norms simply by communicating with a human partner in an
online manner.
","[{'version': 'v1', 'created': 'Sat, 22 Aug 2020 07:27:02 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Jan 2021 06:57:12 GMT'}]",2021-01-14,"[['Ayub', 'Ali', ''], ['Wagner', 'Alan R.', '']]","['Online learning', 'indoor scene classification', 'norm learning', 'active learning', 'human-robot interaction']"
7722,1803.09639,Laurent Beaudou,Laurent Beaudou and Richard C. Brewster,On the multipacking number of grid graphs,,"Discrete Mathematics & Theoretical Computer Science, Vol. 21 no. 3
  , Graph Theory (June 20, 2019) dmtcs:5579",10.23638/DMTCS-21-3-23,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 2001, Erwin introduced broadcast domination in graphs. It is a variant of
classical domination where selected vertices may have different domination
powers. The minimum cost of a dominating broadcast in a graph $G$ is denoted
$\gamma_b(G)$. The dual of this problem is called multipacking: a multipacking
is a set $M$ of vertices such that for any vertex $v$ and any positive integer
$r$, the ball of radius $r$ around $v$ contains at most $r$ vertices of $M$ .
The maximum size of a multipacking in a graph $G$ is denoted mp(G). Naturally
mp(G) $\leq \gamma_b(G)$. Earlier results by Farber and by Lubiw show that
broadcast and multipacking numbers are equal for strongly chordal graphs. In
this paper, we show that all large grids (height at least 4 and width at least
7), which are far from being chordal, have their broadcast and multipacking
numbers equal.
","[{'version': 'v1', 'created': 'Mon, 26 Mar 2018 14:59:29 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Feb 2019 19:39:30 GMT'}, {'version': 'v3', 'created': 'Thu, 28 Feb 2019 07:34:52 GMT'}, {'version': 'v4', 'created': 'Tue, 5 Mar 2019 07:56:09 GMT'}, {'version': 'v5', 'created': 'Mon, 17 Jun 2019 08:05:17 GMT'}]",2019-11-20,"[['Beaudou', 'Laurent', ''], ['Brewster', 'Richard C.', '']]","['grid graph', 'broadcast number', 'multipacking number']"
7723,2004.14071,Noa Fish,"Noa Fish, Richard Zhang, Lilach Perry, Daniel Cohen-Or, Eli Shechtman,
  Connelly Barnes",Image Morphing with Perceptual Constraints and STN Alignment,,,10.1111/cgf.14027,,cs.GR cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In image morphing, a sequence of plausible frames are synthesized and
composited together to form a smooth transformation between given instances.
Intermediates must remain faithful to the input, stand on their own as members
of the set, and maintain a well-paced visual transition from one to the next.
In this paper, we propose a conditional GAN morphing framework operating on a
pair of input images. The network is trained to synthesize frames corresponding
to temporal samples along the transformation, and learns a proper shape prior
that enhances the plausibility of intermediate frames. While individual frame
plausibility is boosted by the adversarial setup, a special training protocol
producing sequences of frames, combined with a perceptual similarity loss,
promote smooth transformation over time. Explicit stating of correspondences is
replaced with a grid-based freeform deformation spatial transformer that
predicts the geometric warp between the inputs, instituting the smooth
geometric effect by bringing the shapes into an initial alignment. We provide
comparisons to classic as well as latent space morphing techniques, and
demonstrate that, given a set of images for self-supervision, our network
learns to generate visually pleasing morphing effects featuring believable
in-betweens, with robustness to changes in shape and texture, requiring no
correspondence annotation.
","[{'version': 'v1', 'created': 'Wed, 29 Apr 2020 10:49:10 GMT'}]",2020-05-05,"[['Fish', 'Noa', ''], ['Zhang', 'Richard', ''], ['Perry', 'Lilach', ''], ['Cohen-Or', 'Daniel', ''], ['Shechtman', 'Eli', ''], ['Barnes', 'Connelly', '']]","['image morphing', 'generative adversarial networks', 'spatial transformers', 'perceptual similarity']"
7724,2207.10010,Gershom Bazerman,Gershom Bazerman,"A Totally Predictable Outcome: An Investigation of Traversals of
  Infinite Structures",,,10.1145/3546189.3549915,,cs.LO cs.PL,http://creativecommons.org/licenses/by/4.0/,"  Functors with an instance of the Traversable type class can be thought of as
data structures which permit a traversal of their elements. This has been made
precise by the correspondence between traversable functors and finitary
containers (also known as polynomial functors) -- established in the context of
total, necessarily terminating, functions. However, the Haskell language is
non-strict and permits functions that do not terminate. It has long been
observed that traversals can at times in fact operate over infinite lists, for
example in distributing the Reader applicative. The result of such a traversal
remains an infinite structure, however it nonetheless is productive -- i.e.
successive amounts of finite computation yield either termination or successive
results. To investigate this phenomenon, we draw on tools from guarded
recursion, making use of equational reasoning directly in Haskell.
","[{'version': 'v1', 'created': 'Wed, 20 Jul 2022 16:16:38 GMT'}]",2022-07-21,"[['Bazerman', 'Gershom', '']]","['Traversable Functors', 'Guarded Recursion', 'Program Calculation']"
7725,1604.04727,Victor Sanchez-Anguix Dr.,"Victor Sanchez-Anguix, Vicente Julian, Vicente Botti and Ana
  Garcia-Fornes","Tasks for agent-based negotiation teams: Analysis, review, and
  challenges","Engineering Applications of Artificial Intelligence, 2013",,10.1016/j.engappai.2013.07.006,,cs.MA cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An agent-based negotiation team is a group of interdependent agents that join
together as a single negotiation party due to their shared interests in the
negotiation at hand. The reasons to employ an agent-based negotiation team may
vary: (i) more computation and parallelization capabilities, (ii) unite agents
with different expertise and skills whose joint work makes it possible to
tackle complex negotiation domains, (iii) the necessity to represent different
stakeholders or different preferences in the same party (e.g., organizations,
countries, and married couple). The topic of agent-based negotiation teams has
been recently introduced in multi-agent research. Therefore, it is necessary to
identify good practices, challenges, and related research that may help in
advancing the state-of-the-art in agent-based negotiation teams. For that
reason, in this article we review the tasks to be carried out by agent-based
negotiation teams. Each task is analyzed and related with current advances in
different research areas. The analysis aims to identify special challenges that
may arise due to the particularities of agent-based negotiation teams.
","[{'version': 'v1', 'created': 'Sat, 16 Apr 2016 11:37:50 GMT'}]",2016-04-19,"[['Sanchez-Anguix', 'Victor', ''], ['Julian', 'Vicente', ''], ['Botti', 'Vicente', ''], ['Garcia-Fornes', 'Ana', '']]","['Negotiation teams', 'automated negotiation', 'agreementtechnologies', 'multiagent systems']"
7726,2107.13936,Maximilian T. Fischer,"Maximilian T. Fischer, Alexander Frings, Daniel A. Keim, Daniel
  Seebacher",Towards a Survey on Static and Dynamic Hypergraph Visualizations,2021 IEEE Visualization Conference (VIS),2021 IEEE Visualization Conference (VIS),10.1109/VIS49827.2021.9623305,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Leveraging hypergraph structures to model advanced processes has gained much
attention over the last few years in many areas, ranging from
protein-interaction in computational biology to image retrieval using machine
learning. Hypergraph models can provide a more accurate representation of the
underlying processes while reducing the overall number of links compared to
regular representations. However, interactive visualization methods for
hypergraphs and hypergraph-based models have rarely been explored or
systematically analyzed. This paper reviews the existing research landscape for
hypergraph and hypergraph model visualizations and assesses the currently
employed techniques. We provide an overview and a categorization of proposed
approaches, focusing on performance, scalability, interaction support,
successful evaluation, and the ability to represent different underlying data
structures, including a recent demand for a temporal representation of
interaction networks and their improvements beyond graph-based methods. Lastly,
we discuss the strengths and weaknesses of the approaches and give an insight
into the future challenges arising in this emerging research field.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2021 12:58:26 GMT'}]",2021-12-07,"[['Fischer', 'Maximilian T.', ''], ['Frings', 'Alexander', ''], ['Keim', 'Daniel A.', ''], ['Seebacher', 'Daniel', '']]","['Hypergraphs', 'hypergraph model', 'temporal', 'visualization', 'visual analytics', 'survey']"
7727,1601.05911,N. Michael Mayer,"Norbert Michael Mayer, Ying-Hao Yu",Orthogonal Echo State Networks and stochastic evaluations of likelihoods,,Cogn Comput (2017) 9:379-390,10.1007/s12559-017-9466-4,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We report about probabilistic likelihood estimates that are performed on time
series using an echo state network with orthogonal recurrent connectivity. The
results from tests using synthetic stochastic input time series with temporal
inference indicate that the capability of the network to infer depends on the
balance between input strength and recurrent activity. This balance has an
influence on the network with regard to the quality of inference from the short
term input history versus inference that accounts for influences that date back
a long time. Sensitivity of such networks against noise and the finite accuracy
of network states in the recurrent layer are investigated. In addition, a
measure based on mutual information between the output time series and the
reservoir is introduced. Finally, different types of recurrent connectivity are
evaluated. Orthogonal matrices show the best results of all investigated
connectivity types overall, but also in the way how the network performance
scales with the size of the recurrent layer.
","[{'version': 'v1', 'created': 'Fri, 22 Jan 2016 09:01:45 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Mar 2016 08:24:42 GMT'}, {'version': 'v3', 'created': 'Wed, 26 Oct 2016 11:31:34 GMT'}, {'version': 'v4', 'created': 'Mon, 6 Mar 2017 13:49:18 GMT'}, {'version': 'v5', 'created': 'Tue, 13 Jun 2017 11:58:12 GMT'}]",2017-06-14,"[['Mayer', 'Norbert Michael', ''], ['Yu', 'Ying-Hao', '']]","['Orthogonal matrices', 'time series prediction', 'likelihood estimate', 'reservoir computing', 'echo state networks', 'recurrent neural networks']"
7728,2207.01503,Eric Knorr,"Eric R. Knorr, Baptiste Lemaire, Andrew Lim, Siqiang Luo, Huanchen
  Zhang, Stratos Idreos, Michael Mitzenmacher",Proteus: A Self-Designing Range Filter,"14 pages, 9 figures, originally published in the Proceedings of the
  2022 International Conference on Management of Data (SIGMOD'22), ISBN:
  9781450392495","SIGMOD'22: Proceedings of the 2022 International Conference on
  Management of Data, June 2022, 1670-1684",10.1145/3514221.3526167,,cs.DB cs.DS cs.LG,http://creativecommons.org/licenses/by/4.0/,"  We introduce Proteus, a novel self-designing approximate range filter, which
configures itself based on sampled data in order to optimize its false positive
rate (FPR) for a given space requirement. Proteus unifies the probabilistic and
deterministic design spaces of state-of-the-art range filters to achieve robust
performance across a larger variety of use cases. At the core of Proteus lies
our Contextual Prefix FPR (CPFPR) model - a formal framework for the FPR of
prefix-based filters across their design spaces. We empirically demonstrate the
accuracy of our model and Proteus' ability to optimize over both synthetic
workloads and real-world datasets. We further evaluate Proteus in RocksDB and
show that it is able to improve end-to-end performance by as much as 5.3x over
more brittle state-of-the-art methods such as SuRF and Rosetta. Our experiments
also indicate that the cost of modeling is not significant compared to the
end-to-end performance gains and that Proteus is robust to workload shifts.
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2022 22:43:34 GMT'}]",2022-07-05,"[['Knorr', 'Eric R.', ''], ['Lemaire', 'Baptiste', ''], ['Lim', 'Andrew', ''], ['Luo', 'Siqiang', ''], ['Zhang', 'Huanchen', ''], ['Idreos', 'Stratos', ''], ['Mitzenmacher', 'Michael', '']]","['Range Filter', 'Self-Designing', 'Sample-Based Modeling', 'Bloom Filter']"
7729,1703.10857,Matthew Pickering,"Matthew Pickering (University of Bristol, United Kingdom), Jeremy
  Gibbons (University of Oxford, United Kingdom), Nicolas Wu (University of
  Bristol, United Kingdom)",Profunctor Optics: Modular Data Accessors,,"The Art, Science, and Engineering of Programming, 2017, Vol. 1,
  Issue 2, Article 7",10.22152/programming-journal.org/2017/1/7,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CONTEXT: Data accessors allow one to read and write components of a data
structure, such as the fields of a record, the variants of a union, or the
elements of a container. These data accessors are collectively known as optics;
they are fundamental to programs that manipulate complex data. INQUIRY:
Individual data accessors for simple data structures are easy to write, for
example as pairs of ""getter"" and ""setter"" methods. However, it is not obvious
how to combine data accessors, in such a way that data accessors for a compound
data structure are composed out of smaller data accessors for the parts of that
structure. Generally, one has to write a sequence of statements or declarations
that navigate step by step through the data structure, accessing one level at a
time - which is to say, data accessors are traditionally not first-class
citizens, combinable in their own right. APPROACH: We present a framework for
modular data access, in which individual data accessors for simple data
structures may be freely combined to obtain more complex data accessors for
compound data structures. Data accessors become first-class citizens. The
framework is based around the notion of profunctors, a flexible generalization
of functions. KNOWLEDGE: The language features required are higher-order
functions (""lambdas"" or ""closures""), parametrized types (""generics"" or
""abstract types""), and some mechanism for separating interfaces from
implementations (""abstract classes"" or ""modules""). We use Haskell as a vehicle
in which to present our constructions, but languages such as Java, C#, or Scala
that provide the necessary features should work just as well. GROUNDING: We
provide implementations of all our constructions, in the form of a literate
program: the manuscript file for the paper is also the source code for the
program, and the extracted code is available separately for evaluation. We also
prove the essential properties demonstrating that our profunctor-based
representations are precisely equivalent to the more familiar concrete
representations. IMPORTANCE: Our results should pave the way to simpler ways of
writing programs that access the components of compound data structures.
","[{'version': 'v1', 'created': 'Fri, 31 Mar 2017 11:45:17 GMT'}]",2017-04-03,"[['Pickering', 'Matthew', '', 'University of Bristol, United Kingdom'], ['Gibbons', 'Jeremy', '', 'University of Oxford, United Kingdom'], ['Wu', 'Nicolas', '', 'University of\n  Bristol, United Kingdom']]","['lens', 'traversal', 'compositionality']"
7730,2109.02359,Jozef Michal Mintal,"Jozef Michal Mintal, Anna Macko, Marko Pa\v{l}a, Franti\v{s}ka
  Piroskov\'a, Pavlo Yakubets, Jaroslav U\v{s}iak, Karol Fabi\'an",Examining the tech stacks of Czech and Slovak untrustworthy websites,,,10.1007/978-981-16-5792-4_4,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  The burgeoning of misleading or false information spread by untrustworthy
websites has, without doubt, created a dangerous concoction. Thus, it is not a
surprise that the threat posed by untrustworthy websites has emerged as a
central concern on the public agenda in many countries, including Czechia and
Slovakia. However, combating this harmful phenomenon has proven to be
difficult, with approaches primarily focusing on tackling consequences instead
of prevention, as websites are routinely seen as quasi-sovereign organisms.
Websites, however, rely upon a host of service providers, which, in a way, hold
substantial power over them. Notwithstanding the apparent power hold by such
tech stack layers, scholarship on this topic remains largely limited. This
article contributes to this small body of knowledge by providing a
first-of-its-kind systematic mapping of the back-end infrastructural support
that makes up the tech stacks of Czech and Slovak untrustworthy websites. Our
approach is based on collecting and analyzing data on top-level domain
operators, domain name Registrars, email providers, web hosting providers, and
utilized website tracking technologies of 150 Czech and Slovak untrustworthy
websites. Our findings show that the Czech and Slovak untrustworthy website
landscape relies on a vast number of back-end services spread across multiple
countries, but in key tech stack layers is nevertheless still heavily dominated
by locally based companies. Finally, given our findings, we discuss various
possible avenues of utilizing the numeral tech stack layers in combating online
disinformation.
","[{'version': 'v1', 'created': 'Mon, 6 Sep 2021 10:59:13 GMT'}]",2021-10-05,"[['Mintal', 'Jozef Michal', ''], ['Macko', 'Anna', ''], ['Paľa', 'Marko', ''], ['Pirosková', 'Františka', ''], ['Yakubets', 'Pavlo', ''], ['Ušiak', 'Jaroslav', ''], ['Fabián', 'Karol', '']]","['Tech Stack', 'Disinformation', 'Slovakia', 'Czechia', 'Websites', 'Untrustworthy websites']"
7731,2107.13856,David Howey,Antti Aitio and David A. Howey,"Predicting battery end of life from solar off-grid system field data
  using machine learning",,,10.1016/j.joule.2021.11.006,,cs.LG cs.SY eess.SY stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hundreds of millions of people lack access to electricity. Decentralised
solar-battery systems are key for addressing this whilst avoiding carbon
emissions and air pollution, but are hindered by relatively high costs and
rural locations that inhibit timely preventative maintenance. Accurate
diagnosis of battery health and prediction of end of life from operational data
improves user experience and reduces costs. But lack of controlled validation
tests and variable data quality mean existing lab-based techniques fail to
work. We apply a scaleable probabilistic machine learning approach to diagnose
health in 1027 solar-connected lead-acid batteries, each running for 400-760
days, totalling 620 million data rows. We demonstrate 73% accurate prediction
of end of life, eight weeks in advance, rising to 82% at the point of failure.
This work highlights the opportunity to estimate health from existing
measurements using `big data' techniques, without additional equipment,
extending lifetime and improving performance in real-world applications.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2021 09:37:48 GMT'}]",2022-02-16,"[['Aitio', 'Antti', ''], ['Howey', 'David A.', '']]","['battery', 'health', 'machine learning', 'rural electrification', 'Gaussian process']"
7732,2201.06922,Ramses Sala,Ramses Sala,"Computational Rational Engineering and Development: Synergies and
  Opportunities","This article will be published as: Sala R. (2022) Computational
  Rational Engineering and Development: Synergies and Opportunities. IntelliSys
  2021: Intelligent Systems and Applications. Lecture Notes in Networks and
  Systems, vol 294. pp 744-763. Springer, Cham",,10.1007/978-3-030-82193-7_50,,cs.CY cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Research and development in computer technology and computational methods
have resulted in a wide variety of valuable tools for Computer-Aided
Engineering (CAE) and Industrial Engineering. However, despite the exponential
increase in computational capabilities and Artificial Intelligence (AI)
methods, many of the visionary perspectives on cybernetic automation of design,
engineering, and development have not been successfully pursued or realized
yet. While contemporary research trends and movements such as Industry 4.0
primarily target progress by connected automation in manufacturing and
production, the objective of this paper is to survey progress and formulate
perspectives targeted on the automation and autonomization of engineering
development processes. Based on an interdisciplinary mini-review, this work
identifies open challenges, synergies, and research opportunities towards the
realization of resource-efficient cooperative engineering and development
systems. In order to go beyond conventional human-centered, tool-based CAE
approaches and realize Computational Intelligence Driven Development processes,
it is suggested to extend the framework of Computational Rationality to
challenges in design, engineering and development.
","[{'version': 'v1', 'created': 'Mon, 27 Dec 2021 19:11:34 GMT'}]",2022-01-19,"[['Sala', 'Ramses', '']]","['Computational Intelligence', 'Artificial Intelligence', 'ComputerAided Engineering', 'Computational Rationality', 'CAE', 'CIDD', 'CRD', 'CRE']"
7733,2206.05499,Mingqi Yang,"Mingqi Yang, Yanming Shen, Heng Qi, Baocai Yin",Soft-mask: Adaptive Substructure Extractions for Graph Neural Networks,"The Web Conference (WWW), 2021",,10.1145/3442381.3449929,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For learning graph representations, not all detailed structures within a
graph are relevant to the given graph tasks. Task-relevant structures can be
$localized$ or $sparse$ which are only involved in subgraphs or characterized
by the interactions of subgraphs (a hierarchical perspective). A graph neural
network should be able to efficiently extract task-relevant structures and be
invariant to irrelevant parts, which is challenging for general message passing
GNNs. In this work, we propose to learn graph representations from a sequence
of subgraphs of the original graph to better capture task-relevant
substructures or hierarchical structures and skip $noisy$ parts. To this end,
we design soft-mask GNN layer to extract desired subgraphs through the mask
mechanism. The soft-mask is defined in a continuous space to maintain the
differentiability and characterize the weights of different parts. Compared
with existing subgraph or hierarchical representation learning methods and
graph pooling operations, the soft-mask GNN layer is not limited by the fixed
sample or drop ratio, and therefore is more flexible to extract subgraphs with
arbitrary sizes. Extensive experiments on public graph benchmarks show that
soft-mask mechanism brings performance improvements. And it also provides
interpretability where visualizing the values of masks in each layer allows us
to have an insight into the structures learned by the model.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2022 11:04:23 GMT'}]",2022-06-14,"[['Yang', 'Mingqi', ''], ['Shen', 'Yanming', ''], ['Qi', 'Heng', ''], ['Yin', 'Baocai', '']]","['deep learning', 'graph neural networks', 'graph representation leanring']"
7734,1906.06039,Silvio Peroni,"Yongjun Zhu, Erjia Yan, Silvio Peroni and Chao Che","Nine Million Book Items and Eleven Million Citations: A Study of
  Book-Based Scholarly Communication Using OpenCitations",,,10.1007/s11192-019-03311-9,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Books have been widely used to share information and contribute to human
knowledge. However, the quantitative use of books as a method of scholarly
communication is relatively unexamined compared to journal articles and
conference papers. This study uses the COCI dataset (a comprehensive open
citation dataset provided by OpenCitations) to explore books' roles in
scholarly communication. The COCI data we analyzed includes 445,826,118
citations from 46,534,705 bibliographic entities. By analyzing such a large
amount of data, we provide a thorough, multifaceted understanding of books.
Among the investigated factors are 1) temporal changes to book citations; 2)
book citation distributions; 3) years to citation peak; 4) citation half-life;
and 5) characteristics of the most-cited books. Results show that books have
received less than 4% of total citations, and have been cited mainly by journal
articles. Moreover, 97.96% of books have been cited fewer than ten times. Books
take longer than other bibliographic materials to reach peak citation levels,
yet are cited for the same duration as journal articles. Most-cited books tend
to cover general (yet essential) topics, theories, and technological concepts
in mathematics and statistics.
","[{'version': 'v1', 'created': 'Fri, 14 Jun 2019 06:11:52 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Dec 2019 08:51:11 GMT'}]",2019-12-09,"[['Zhu', 'Yongjun', ''], ['Yan', 'Erjia', ''], ['Peroni', 'Silvio', ''], ['Che', 'Chao', '']]","['book citation', 'scholarly communication', 'citation analysis', 'OpenCitations', 'COCI', 'open citation data']"
7735,2203.16912,George De Ath,"George De Ath, Tinkle Chugh, Alma A. M. Rahat",MBORE: Multi-objective Bayesian Optimisation by Density-Ratio Estimation,"To appear at Genetic and Evolutionary Computation Conference (GECCO
  '22). 10 pages (main paper) + 25 pages (supplement). Code avaliable at
  https://github.com/georgedeath/mbore",,10.1145/3512290.3528769,,cs.LG cs.AI stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Optimisation problems often have multiple conflicting objectives that can be
computationally and/or financially expensive. Mono-surrogate Bayesian
optimisation (BO) is a popular model-based approach for optimising such
black-box functions. It combines objective values via scalarisation and builds
a Gaussian process (GP) surrogate of the scalarised values. The location which
maximises a cheap-to-query acquisition function is chosen as the next location
to expensively evaluate. While BO is an effective strategy, the use of GPs is
limiting. Their performance decreases as the problem input dimensionality
increases, and their computational complexity scales cubically with the amount
of data. To address these limitations, we extend previous work on BO by
density-ratio estimation (BORE) to the multi-objective setting. BORE links the
computation of the probability of improvement acquisition function to that of
probabilistic classification. This enables the use of state-of-the-art
classifiers in a BO-like framework. In this work we present MBORE:
multi-objective Bayesian optimisation by density-ratio estimation, and compare
it to BO across a range of synthetic and real-world benchmarks. We find that
MBORE performs as well as or better than BO on a wide variety of problems, and
that it outperforms BO on high-dimensional and real-world problems.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2022 09:27:59 GMT'}]",2022-08-11,"[['De Ath', 'George', ''], ['Chugh', 'Tinkle', ''], ['Rahat', 'Alma A. M.', '']]","['Bayesian optimisation', 'Surrogate modelling', 'Scalarisation methods', 'Efficient multi-objective optimisation', 'Acquisition function']"
7736,1907.00924,Giorgia Franchini,"Giorgia Franchini, Mathilde Galinier, Micaela Verucchi","Mise en abyme with artificial intelligence: how to predict the accuracy
  of NN, applied to hyper-parameter tuning","The research leading to these results has received funding from the
  European Union's Horizon 2020 Programme under the CLASS Project
  (https://class-project.eu/), grant agreement n 780622","INNS Big Data and Deep Learning conference, 286-295, Springer,
  2018",10.1007/978-3-030-16841-4_30,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the context of deep learning, the costliest phase from a computational
point of view is the full training of the learning algorithm. However, this
process is to be used a significant number of times during the design of a new
artificial neural network, leading therefore to extremely expensive operations.
Here, we propose a low-cost strategy to predict the accuracy of the algorithm,
based only on its initial behaviour. To do so, we train the network of interest
up to convergence several times, modifying its characteristics at each
training. The initial and final accuracies observed during this beforehand
process are stored in a database. We then make use of both curve fitting and
Support Vector Machines techniques, the latter being trained on the created
database, to predict the accuracy of the network, given its accuracy on the
primary iterations of its learning. This approach can be of particular interest
when the space of the characteristics of the network is notably large or when
its full training is highly time-consuming. The results we obtained are
promising and encouraged us to apply this strategy to a topical issue:
hyper-parameter optimisation (HO). In particular, we focused on the HO of a
convolutional neural network for the classification of the databases MNIST and
CIFAR-10. By using our method of prediction, and an algorithm implemented by us
for a probabilistic exploration of the hyper-parameter space, we were able to
find the hyper-parameter settings corresponding to the optimal accuracies
already known in literature, at a quite low-cost.
","[{'version': 'v1', 'created': 'Fri, 28 Jun 2019 14:38:39 GMT'}]",2019-07-02,"[['Franchini', 'Giorgia', ''], ['Galinier', 'Mathilde', ''], ['Verucchi', 'Micaela', '']]","['Machine Learning', 'Support Vector Machines', 'Curve Fitting', 'Artificial Neural Network', 'Hyper-parameter Optimisation']"
7737,1708.04233,Tomoyoshi Shimobaba Dr.,"Tomoyoshi Shimobaba, Kyoji Matsushima, Takayuki Takahashi, Yuki
  Nagahama, Satoki Hasegawa, Marie Sano, Ryuji Hirayama, Takashi Kakue,
  Tomoyoshi Ito","Fast, large-scale hologram calculation in wavelet domain",,,10.1016/j.optcom.2017.11.066,,cs.GR physics.optics,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a large-scale hologram calculation using WAvelet ShrinkAge-Based
superpositIon (WASABI), a wavelet transform-based algorithm. An image-type
hologram calculated using the WASABI method is printed on a glass substrate
with the resolution of $65,536 \times 65,536$ pixels and a pixel pitch of $1
\mu$m. The hologram calculation time amounts to approximately 354 s on a
commercial CPU, which is approximately 30 times faster than conventional
methods.
","[{'version': 'v1', 'created': 'Sun, 13 Aug 2017 23:02:34 GMT'}]",2018-01-17,"[['Shimobaba', 'Tomoyoshi', ''], ['Matsushima', 'Kyoji', ''], ['Takahashi', 'Takayuki', ''], ['Nagahama', 'Yuki', ''], ['Hasegawa', 'Satoki', ''], ['Sano', 'Marie', ''], ['Hirayama', 'Ryuji', ''], ['Kakue', 'Takashi', ''], ['Ito', 'Tomoyoshi', '']]","['Computer-generated hologram', 'Electroholography', 'Hologram', 'Holography', 'Holographic display']"
7738,2106.14736,Taras Kucherenko,"Taras Kucherenko, Rajmund Nagy, Patrik Jonell, Michael Neff, Hedvig
  Kjellstr\""om, Gustav Eje Henter","Speech2Properties2Gestures: Gesture-Property Prediction as a Tool for
  Generating Representational Gestures from Speech","Accepted for publication at the ACM International Conference on
  Intelligent Virtual Agents (IVA 2021)",International Conference on Intelligent Virtual Agents 2021,10.1145/3472306.3478333,,cs.HC cs.CV cs.GR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new framework for gesture generation, aiming to allow
data-driven approaches to produce more semantically rich gestures. Our approach
first predicts whether to gesture, followed by a prediction of the gesture
properties. Those properties are then used as conditioning for a modern
probabilistic gesture-generation model capable of high-quality output. This
empowers the approach to generate gestures that are both diverse and
representational. Follow-ups and more information can be found on the project
page: https://svito-zar.github.io/speech2properties2gestures/ .
","[{'version': 'v1', 'created': 'Mon, 28 Jun 2021 14:07:59 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Aug 2021 13:29:29 GMT'}]",2021-09-28,"[['Kucherenko', 'Taras', ''], ['Nagy', 'Rajmund', ''], ['Jonell', 'Patrik', ''], ['Neff', 'Michael', ''], ['Kjellström', 'Hedvig', ''], ['Henter', 'Gustav Eje', '']]","['gesture generation', 'virtual agents', 'representational gestures']"
7739,1912.06723,Daniel Karl I. Weidele,"Daniel Karl I. Weidele, Justin D. Weisz, Eno Oduor, Michael Muller,
  Josh Andres, Alexander Gray, Dakuo Wang","AutoAIViz: Opening the Blackbox of Automated Artificial Intelligence
  with Conditional Parallel Coordinates","5 pages, 1 figure, IUI2020",,10.1145/3377325.3377538,,cs.LG cs.HC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Artificial Intelligence (AI) can now automate the algorithm selection,
feature engineering, and hyperparameter tuning steps in a machine learning
workflow. Commonly known as AutoML or AutoAI, these technologies aim to relieve
data scientists from the tedious manual work. However, today's AutoAI systems
often present only limited to no information about the process of how they
select and generate model results. Thus, users often do not understand the
process, neither do they trust the outputs. In this short paper, we provide a
first user evaluation by 10 data scientists of an experimental system,
AutoAIViz, that aims to visualize AutoAI's model generation process. We find
that the proposed system helps users to complete the data science tasks, and
increases their understanding, toward the goal of increasing trust in the
AutoAI system.
","[{'version': 'v1', 'created': 'Fri, 13 Dec 2019 21:53:01 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Jan 2020 16:32:18 GMT'}, {'version': 'v3', 'created': 'Fri, 17 Jan 2020 15:51:23 GMT'}]",2020-01-20,"[['Weidele', 'Daniel Karl I.', ''], ['Weisz', 'Justin D.', ''], ['Oduor', 'Eno', ''], ['Muller', 'Michael', ''], ['Andres', 'Josh', ''], ['Gray', 'Alexander', ''], ['Wang', 'Dakuo', '']]","['AutoAI', 'AutoML', 'visualization', 'parallel coordinates', 'human-AI collaboration', 'democratizing AI']"
7740,2206.09683,Javed Iqbal,"Javed Iqbal, Hamza Rawal, Rehan Hafiz, Yu-Tseh Chi, Mohsen Ali","Distribution Regularized Self-Supervised Learning for Domain Adaptation
  of Semantic Segmentation",Accepted for publication at Image and Vision Computing,,10.1016/j.imavis.2022.104504,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper proposes a novel pixel-level distribution regularization scheme
(DRSL) for self-supervised domain adaptation of semantic segmentation. In a
typical setting, the classification loss forces the semantic segmentation model
to greedily learn the representations that capture inter-class variations in
order to determine the decision (class) boundary. Due to the domain shift, this
decision boundary is unaligned in the target domain, resulting in noisy pseudo
labels adversely affecting self-supervised domain adaptation. To overcome this
limitation, along with capturing inter-class variation, we capture pixel-level
intra-class variations through class-aware multi-modal distribution learning
(MMDL). Thus, the information necessary for capturing the intra-class
variations is explicitly disentangled from the information necessary for
inter-class discrimination. Features captured thus are much more informative,
resulting in pseudo-labels with low noise. This disentanglement allows us to
perform separate alignments in discriminative space and multi-modal
distribution space, using cross-entropy based self-learning for the former. For
later, we propose a novel stochastic mode alignment method, by explicitly
decreasing the distance between the target and source pixels that map to the
same mode. The distance metric learning loss, computed over pseudo-labels and
backpropagated from multi-modal modeling head, acts as the regularizer over the
base network shared with the segmentation head. The results from comprehensive
experiments on synthetic to real domain adaptation setups, i.e., GTA-V/SYNTHIA
to Cityscapes, show that DRSL outperforms many existing approaches (a minimum
margin of 2.3% and 2.5% in mIoU for SYNTHIA to Cityscapes).
","[{'version': 'v1', 'created': 'Mon, 20 Jun 2022 09:52:49 GMT'}]",2022-06-22,"[['Iqbal', 'Javed', ''], ['Rawal', 'Hamza', ''], ['Hafiz', 'Rehan', ''], ['Chi', 'Yu-Tseh', ''], ['Ali', 'Mohsen', '']]","['Semantic Segmentation', 'Self-supervised Learning', 'Domain Adaptation', 'Multi-modal distribution learning']"
7741,1806.03751,Michael Hauser,"Michael Hauser, Sean Gunn, Samer Saab Jr, Asok Ray",State Space Representations of Deep Neural Networks,,"Neural Computation, Volume 31, Issue 3, March 2019, p.538-554",10.1162/neco_a_01165,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with neural networks as dynamical systems governed by
differential or difference equations. It shows that the introduction of skip
connections into network architectures, such as residual networks and dense
networks, turns a system of static equations into a system of dynamical
equations with varying levels of smoothness on the layer-wise transformations.
Closed form solutions for the state space representations of general dense
networks, as well as $k^{th}$ order smooth networks, are found in general
settings. Furthermore, it is shown that imposing $k^{th}$ order smoothness on a
network architecture with $d$-many nodes per layer increases the state space
dimension by a multiple of $k$, and so the effective embedding dimension of the
data manifold is $k \cdot d$-many dimensions. It follows that network
architectures of these types reduce the number of parameters needed to maintain
the same embedding dimension by a factor of $k^2$ when compared to an
equivalent first-order, residual network, significantly motivating the
development of network architectures of these types. Numerical simulations were
run to validate parts of the developed theory.
","[{'version': 'v1', 'created': 'Mon, 11 Jun 2018 00:26:13 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Jun 2018 02:57:47 GMT'}, {'version': 'v3', 'created': 'Thu, 21 Feb 2019 21:11:08 GMT'}]",2019-02-25,"[['Hauser', 'Michael', ''], ['Gunn', 'Sean', ''], ['Saab', 'Samer', 'Jr'], ['Ray', 'Asok', '']]","['Machine Learning', 'Dynamical Systems', 'Neural Networks']"
7742,2106.08890,Yuanchun Li,"Yuanchun Li, Ziqi Zhang, Bingyan Liu, Ziyue Yang, and Yunxin Liu","ModelDiff: Testing-Based DNN Similarity Comparison for Model Reuse
  Detection",ISSTA 2021,,10.1145/3460319.3464816,,cs.LG cs.AI cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The knowledge of a deep learning model may be transferred to a student model,
leading to intellectual property infringement or vulnerability propagation.
Detecting such knowledge reuse is nontrivial because the suspect models may not
be white-box accessible and/or may serve different tasks. In this paper, we
propose ModelDiff, a testing-based approach to deep learning model similarity
comparison. Instead of directly comparing the weights, activations, or outputs
of two models, we compare their behavioral patterns on the same set of test
inputs. Specifically, the behavioral pattern of a model is represented as a
decision distance vector (DDV), in which each element is the distance between
the model's reactions to a pair of inputs. The knowledge similarity between two
models is measured with the cosine similarity between their DDVs. To evaluate
ModelDiff, we created a benchmark that contains 144 pairs of models that cover
most popular model reuse methods, including transfer learning, model
compression, and model stealing. Our method achieved 91.7% correctness on the
benchmark, which demonstrates the effectiveness of using ModelDiff for model
reuse detection. A study on mobile deep learning apps has shown the feasibility
of ModelDiff on real-world models.
","[{'version': 'v1', 'created': 'Fri, 11 Jun 2021 15:16:18 GMT'}]",2021-06-17,"[['Li', 'Yuanchun', ''], ['Zhang', 'Ziqi', ''], ['Liu', 'Bingyan', ''], ['Yang', 'Ziyue', ''], ['Liu', 'Yunxin', '']]","['Deep neural networks', 'similarity comparison', 'model reuse', 'intellectual property', 'vulnerability propagation']"
7743,2002.06395,Giuseppe Di Molfetta Prof.,"Balthazar Casal\'e, Giuseppe Di Molfetta, Hachem Kadri, Liva Ralaivola",Quantum Bandits,All your comments are very welcome!,"Quantum Machine Intelligence 2, 1-7 (2020)",10.1007/s42484-020-00024-8,,cs.LG cs.AI quant-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the quantum version of the bandit problem known as {\em best arm
identification} (BAI). We first propose a quantum modeling of the BAI problem,
which assumes that both the learning agent and the environment are quantum; we
then propose an algorithm based on quantum amplitude amplification to solve
BAI. We formally analyze the behavior of the algorithm on all instances of the
problem and we show, in particular, that it is able to get the optimal solution
quadratically faster than what is known to hold in the classical case.
","[{'version': 'v1', 'created': 'Sat, 15 Feb 2020 15:17:11 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Sep 2020 14:13:18 GMT'}]",2020-09-23,"[['Casalé', 'Balthazar', ''], ['Di Molfetta', 'Giuseppe', ''], ['Kadri', 'Hachem', ''], ['Ralaivola', 'Liva', '']]","['Bandits', 'Best Arm Identification', 'Quantum Amplitude Amplification']"
7744,1906.07509,Alessio Netti,"Alessio Netti, Micha Mueller, Axel Auweter, Carla Guillen, Michael
  Ott, Daniele Tafani and Martin Schulz","From Facility to Application Sensor Data: Modular, Continuous and
  Holistic Monitoring with DCDB","Accepted at the The International Conference for High Performance
  Computing, Networking, Storage, and Analysis (SC) 2019",,10.1145/3295500.3356191,,cs.DC cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today's HPC installations are highly-complex systems, and their complexity
will only increase as we move to exascale and beyond. At each layer, from
facilities to systems, from runtimes to applications, a wide range of tuning
decisions must be made in order to achieve efficient operation. This, however,
requires systematic and continuous monitoring of system and user data. While
many insular solutions exist, a system for holistic and facility-wide
monitoring is still lacking in the current HPC ecosystem. In this paper we
introduce DCDB, a comprehensive monitoring system capable of integrating data
from all system levels. It is designed as a modular and highly-scalable
framework based on a plugin infrastructure. All monitored data is aggregated at
a distributed noSQL data store for analysis and cross-system correlation. We
demonstrate the performance and scalability of DCDB, and describe two use cases
in the area of energy management and characterization.
","[{'version': 'v1', 'created': 'Tue, 18 Jun 2019 11:55:16 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Jun 2019 06:49:39 GMT'}, {'version': 'v3', 'created': 'Wed, 14 Aug 2019 07:11:42 GMT'}]",2019-08-15,"[['Netti', 'Alessio', ''], ['Mueller', 'Micha', ''], ['Auweter', 'Axel', ''], ['Guillen', 'Carla', ''], ['Ott', 'Michael', ''], ['Tafani', 'Daniele', ''], ['Schulz', 'Martin', '']]","['High-Performance Computing', 'Monitoring', 'Distributed Data Store', 'Infrastructure Management', 'Application Analysis']"
7745,1905.11342,Shawn Jones,Shawn M. Jones and Michele C. Weigle and Michael L. Nelson,"Social Cards Probably Provide For Better Understanding Of Web Archive
  Collections","58 pages, 53 figures",,10.1145/3357384.3358039,,cs.DL cs.HC cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Used by a variety of researchers, web archive collections have become
invaluable sources of evidence. If a researcher is presented with a web archive
collection that they did not create, how do they know what is inside so that
they can use it for their own research? Search engine results and social media
links are represented as surrogates, small easily digestible summaries of the
underlying page. Search engines and social media have a different focus, and
hence produce different surrogates than web archives. Search engine surrogates
help a user answer the question ""Will this link meet my information need?""
Social media surrogates help a user decide ""Should I click on this?"" Our use
case is subtly different. We hypothesize that groups of surrogates together are
useful for summarizing a collection. We want to help users answer the question
of ""What does the underlying collection contain?"" But which surrogate should we
use? With Mechanical Turk participants, we evaluate six different surrogate
types against each other. We find that the type of surrogate does not influence
the time to complete the task we presented the participants. Of particular
interest are social cards, surrogates typically found on social media, and
browser thumbnails, screen captures of web pages rendered in a browser. At
$p=0.0569$, and $p=0.0770$, respectively, we find that social cards and social
cards paired side-by-side with browser thumbnails probably provide better
collection understanding than the surrogates currently used by the popular
Archive-It web archiving platform. We measure user interactions with each
surrogate and find that users interact with social cards less than other types.
The results of this study have implications for our web archive summarization
work, live web curation platforms, social media, and more.
","[{'version': 'v1', 'created': 'Mon, 27 May 2019 17:00:54 GMT'}, {'version': 'v2', 'created': 'Tue, 28 May 2019 16:55:15 GMT'}, {'version': 'v3', 'created': 'Thu, 30 May 2019 02:06:42 GMT'}]",2021-01-26,"[['Jones', 'Shawn M.', ''], ['Weigle', 'Michele C.', ''], ['Nelson', 'Michael L.', '']]","['web page surrogates', 'web archives', 'web archive collections', 'collection summarization', 'social cards', 'thumbnails', 'user studies', 'mechanical turk']"
7746,2103.04262,Ghazal Saheb Jam,"Ghazal Saheb Jam, Jimin Rhim, Angelica Lim","Developing a Data-Driven Categorical Taxonomy of Emotional Expressions
  in Real World Human Robot Interactions",,,10.1145/3434074.3447218,,cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Emotions are reactions that can be expressed through a variety of social
signals. For example, anger can be expressed through a scowl, narrowed eyes, a
long stare, or many other expressions. This complexity is problematic when
attempting to recognize a human's expression in a human-robot interaction:
categorical emotion models used in HRI typically use only a few prototypical
classes, and do not cover the wide array of expressions in the wild. We propose
a data-driven method towards increasing the number of known emotion classes
present in human-robot interactions, to 28 classes or more. The method includes
the use of automatic segmentation of video streams into short (<10s) videos,
and annotation using the large set of widely-understood emojis as categories.
In this work, we showcase our initial results using a large in-the-wild HRI
dataset (UE-HRI), with 61 clips randomly sampled from the dataset, labeled with
28 different emojis. In particular, our results showed that the ""skeptical""
emoji was a common expression in our dataset, which is not often considered in
typical emotion taxonomies. This is the first step in developing a rich
taxonomy of emotional expressions that can be used in the future as labels for
training machine learning models, towards more accurate perception of humans by
robots.
","[{'version': 'v1', 'created': 'Sun, 7 Mar 2021 04:39:59 GMT'}]",2021-03-09,"[['Jam', 'Ghazal Saheb', ''], ['Rhim', 'Jimin', ''], ['Lim', 'Angelica', '']]","['emotion-recognition', 'social signals', 'in-the-wild', 'emotion categories', 'emojis']"
7747,2010.07529,Senthil Velan S Dr,Senthil Velan S,"Introducing Artificial Intelligence Agents to the Empirical Measurement
  of Design Properties for Aspect Oriented Software Development",,,10.1109/AICAI.2019.8701250,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The proponents of Aspect Oriented Software Development (AOSD) methodology
have done a tremendous amount of work to bring out the positive effects of its
adoption using quantitative assessment. A structured assessment of the
methodology requires a well-defined quality model. In this paper, an AI agent
based quality model has been proposed to evaluate the effect of aspectization.
The model has been applied on already existing and equivalent versions of
object oriented and aspect oriented case study application, university
automation software. Specific metrics for the software design properties have
been measured using AI agents for the different versions and were used to infer
upon the effect on quality. Based on the initial measurement, it was found that
aspectization has positively improved all the three quality attributes defined
in the quality model. The attributes of evolution and reusability showed
significant improvement in quality due to the effect of aspectization.
","[{'version': 'v1', 'created': 'Thu, 15 Oct 2020 05:15:26 GMT'}, {'version': 'v2', 'created': 'Sat, 17 Oct 2020 06:32:38 GMT'}]",2020-10-20,"[['S', 'Senthil Velan', '']]","['AOSD', 'Software Quality Model', 'Artificial']"
7748,1410.3744,Chee Seng Chan,"Mei Kuan Lim, Chee Seng Chan, Dorothy Monekosso and Paolo Remagnino",Refined Particle Swarm Intelligence Method for Abrupt Motion Tracking,"Accepted in Information Sciences, new abrupt motion (MAMo) dataset is
  introduced","Information Sciences, vol. 283, pp. 267-287, 2014",10.1016/j.ins.2014.01.003,,cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Conventional tracking solutions are not feasible in handling abrupt motion as
they are based on smooth motion assumption or an accurate motion model. Abrupt
motion is not subject to motion continuity and smoothness. To assuage this, we
deem tracking as an optimisation problem and propose a novel abrupt motion
tracker that based on swarm intelligence - the SwaTrack. Unlike existing
swarm-based filtering methods, we first of all introduce an optimised
swarm-based sampling strategy to tradeoff between the exploration and
exploitation of the search space in search for the optimal proposal
distribution. Secondly, we propose Dynamic Acceleration Parameters (DAP) allow
on the fly tuning of the best mean and variance of the distribution for
sampling. Such innovating idea of combining these strategies in an ingenious
way in the PSO framework to handle the abrupt motion, which so far no existing
works are found. Experimental results in both quantitative and qualitative had
shown the effectiveness of the proposed method in tracking abrupt motions.
","[{'version': 'v1', 'created': 'Tue, 14 Oct 2014 16:06:13 GMT'}]",2014-10-15,"[['Lim', 'Mei Kuan', ''], ['Chan', 'Chee Seng', ''], ['Monekosso', 'Dorothy', ''], ['Remagnino', 'Paolo', '']]","['abrupt motion', 'visual tracking', 'particle swarm optimisation']"
7749,1910.03539,Leonid Boytsov,"Leonid Boytsov, Eric Nyberg","Pruning Algorithms for Low-Dimensional Non-metric k-NN Search: A Case
  Study",,,10.1007/978-3-030-32047-8_7,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We focus on low-dimensional non-metric search, where tree-based approaches
permit efficient and accurate retrieval while having short indexing time. These
methods rely on space partitioning and require a pruning rule to avoid visiting
unpromising parts. We consider two known data-driven approaches to extend these
rules to non-metric spaces: TriGen and a piece-wise linear approximation of the
pruning rule. We propose and evaluate two adaptations of TriGen to
non-symmetric similarities (TriGen does not support non-symmetric distances).
We also evaluate a hybrid of TriGen and the piece-wise linear approximation
pruning. We find that this hybrid approach is often more effective than either
of the pruning rules. We make our software publicly available.
","[{'version': 'v1', 'created': 'Tue, 8 Oct 2019 16:50:50 GMT'}]",2019-10-09,"[['Boytsov', 'Leonid', ''], ['Nyberg', 'Eric', '']]","['k-NN search', 'non-metric distance', 'VP-tree', 'TriGen']"
7750,2002.01873,George De Ath,"George De Ath, Richard M. Everson, Jonathan E. Fieldsend, Alma A. M.
  Rahat",$\epsilon$-shotgun: $\epsilon$-greedy Batch Bayesian Optimisation,"Genetic and Evolutionary Computation Conference 2020 (GECCO '20). 9
  pages (main paper) + 11 pages (supplementary material). Code avaliable at
  https://github.com/georgedeath/eshotgun",,10.1145/3377930.3390154,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bayesian optimisation is a popular, surrogate model-based approach for
optimising expensive black-box functions. Given a surrogate model, the next
location to expensively evaluate is chosen via maximisation of a cheap-to-query
acquisition function. We present an $\epsilon$-greedy procedure for Bayesian
optimisation in batch settings in which the black-box function can be evaluated
multiple times in parallel. Our $\epsilon$-shotgun algorithm leverages the
model's prediction, uncertainty, and the approximated rate of change of the
landscape to determine the spread of batch solutions to be distributed around a
putative location. The initial target location is selected either in an
exploitative fashion on the mean prediction, or -- with probability $\epsilon$
-- from elsewhere in the design space. This results in locations that are more
densely sampled in regions where the function is changing rapidly and in
locations predicted to be good (i.e close to predicted optima), with more
scattered samples in regions where the function is flatter and/or of poorer
quality. We empirically evaluate the $\epsilon$-shotgun methods on a range of
synthetic functions and two real-world problems, finding that they perform at
least as well as state-of-the-art batch methods and in many cases exceed their
performance.
","[{'version': 'v1', 'created': 'Wed, 5 Feb 2020 17:24:39 GMT'}, {'version': 'v2', 'created': 'Sun, 29 Mar 2020 15:25:31 GMT'}]",2020-03-31,"[['De Ath', 'George', ''], ['Everson', 'Richard M.', ''], ['Fieldsend', 'Jonathan E.', ''], ['Rahat', 'Alma A. M.', '']]","['Bayesian optimisation', 'Batch', 'Parallel', 'Exploitation', 'ϵ-greedy', 'Infillcriteria', 'Acquisition function']"
7751,1709.09235,Yu-Hang Tang,"Yu-Hang Tang, Dongkun Zhang and George Em Karniadakis","An Atomistic Fingerprint Algorithm for Learning Ab Initio Molecular
  Force Fields",,,10.1063/1.5008630,,cs.CE physics.chem-ph physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Molecular fingerprints, i.e. feature vectors describing atomistic
neighborhood configurations, is an important abstraction and a key ingredient
for data-driven modeling of potential energy surface and interatomic force. In
this paper, we present the Density-Encoded Canonically Aligned Fingerprint
(DECAF) fingerprint algorithm, which is robust and efficient, for fitting
per-atom scalar and vector quantities. The fingerprint is essentially a
continuous density field formed through the superimposition of smoothing
kernels centered on the atoms. Rotational invariance of the fingerprint is
achieved by aligning, for each fingerprint instance, the neighboring atoms onto
a local canonical coordinate frame computed from a kernel minisum optimization
procedure. We show that this approach is superior over PCA-based methods
especially when the atomistic neighborhood is sparse and/or contains symmetry.
We propose that the `distance' between the density fields be measured using a
volume integral of their pointwise difference. This can be efficiently computed
using optimal quadrature rules, which only require discrete sampling at a small
number of grid points. We also experiment on the choice of weight functions for
constructing the density fields, and characterize their performance for fitting
interatomic potentials. The applicability of the fingerprint is demonstrated
through a set of benchmark problems.
","[{'version': 'v1', 'created': 'Tue, 26 Sep 2017 19:49:32 GMT'}, {'version': 'v2', 'created': 'Mon, 9 Oct 2017 03:44:30 GMT'}, {'version': 'v3', 'created': 'Thu, 14 Dec 2017 05:48:08 GMT'}]",2018-02-14,"[['Tang', 'Yu-Hang', ''], ['Zhang', 'Dongkun', ''], ['Karniadakis', 'George Em', '']]","['active learning', 'Gaussian process regression', 'quantum mechanics', 'molecular dynamics', 'next generation force fields']"
7752,2101.05795,Leandro Passos,"Leandro Aparecido Passos, Jo\~ao Paulo Papa",A Metaheuristic-Driven Approach to Fine-Tune Deep Boltzmann Machines,"30 pages, 7 figures",Applied Soft Computing 97 (2020): 105717,10.1016/j.asoc.2019.105717,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Deep learning techniques, such as Deep Boltzmann Machines (DBMs), have
received considerable attention over the past years due to the outstanding
results concerning a variable range of domains. One of the main shortcomings of
these techniques involves the choice of their hyperparameters, since they have
a significant impact on the final results. This work addresses the issue of
fine-tuning hyperparameters of Deep Boltzmann Machines using metaheuristic
optimization techniques with different backgrounds, such as swarm intelligence,
memory- and evolutionary-based approaches. Experiments conducted in three
public datasets for binary image reconstruction showed that metaheuristic
techniques can obtain reasonable results.
","[{'version': 'v1', 'created': 'Thu, 14 Jan 2021 18:57:29 GMT'}]",2021-01-15,"[['Passos', 'Leandro Aparecido', ''], ['Papa', 'João Paulo', '']]","['Deep Boltzmann Machine', 'Meta-Heuristic Optimization', 'Machine']"
7753,1908.10998,Yanxiang Gong,"Linjie Deng, Yanxiang Gong, Xinchen Lu, Xin Yi, Zheng Ma, Mei Xie",Focus-Enhanced Scene Text Recognition with Deformable Convolutions,,,10.1109/ICCC47050.2019.9064428,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, scene text recognition methods based on deep learning have sprung
up in computer vision area. The existing methods achieved great performances,
but the recognition of irregular text is still challenging due to the various
shapes and distorted patterns. Consider that at the time of reading words in
the real world, normally we will not rectify it in our mind but adjust our
focus and visual fields. Similarly, through utilizing deformable convolutional
layers whose geometric structures are adjustable, we present an enhanced
recognition network without the steps of rectification to deal with irregular
text in this work. A number of experiments have been applied, where the results
on public benchmarks demonstrate the effectiveness of our proposed components
and shows that our method has reached satisfactory performances. The code will
be publicly available at https://github.com/Alpaca07/dtr soon.
","[{'version': 'v1', 'created': 'Thu, 29 Aug 2019 00:54:02 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Sep 2019 07:23:03 GMT'}]",2022-05-06,"[['Deng', 'Linjie', ''], ['Gong', 'Yanxiang', ''], ['Lu', 'Xinchen', ''], ['Yi', 'Xin', ''], ['Ma', 'Zheng', ''], ['Xie', 'Mei', '']]","['Text Recognition', 'Deformable Convolution', 'Irregular Text']"
7754,2008.04230,Lucas Sakizloglou,"Lucas Sakizloglou, Sona Ghahremani, Matthias Barkowsky, Holger Giese","A Scalable Querying Scheme for Memory-efficient Runtime Models with
  History","12 pages, 11 figures, ACM/IEEE 23rd International Conference on Model
  Driven Engineering Languages and Systems (MoDELS) 2020",,10.1145/3365438.3410961,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Runtime models provide a snapshot of a system at runtime at a desired level
of abstraction. Via a causal connection to the modeled system and by employing
model-driven engineering techniques, runtime models support schemes for
(runtime) adaptation where data from previous snapshots facilitates more
informed decisions. Nevertheless, although runtime models and model-based
adaptation techniques have been the focus of extensive research, schemes that
treat the evolution of the model over time as a first-class citizen have only
lately received attention. Consequently, there is a lack of sophisticated
technology for such runtime models with history.
  We present a querying scheme where the integration of temporal requirements
with incremental model queries enables scalable querying for runtime models
with history. Moreover, our scheme provides for a memory-efficient storage of
such models. By integrating these two features into an adaptation loop, we
enable efficient history-aware self-adaptation via runtime models, of which we
present an implementation.
","[{'version': 'v1', 'created': 'Mon, 10 Aug 2020 16:06:28 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Aug 2020 21:12:13 GMT'}]",2020-08-18,"[['Sakizloglou', 'Lucas', ''], ['Ghahremani', 'Sona', ''], ['Barkowsky', 'Matthias', ''], ['Giese', 'Holger', '']]","['runtime models', 'model queries', 'temporal requirements', 'temporallogic', 'self-adaptation', 'incremental pattern matching']"
7755,2107.02984,Reza Jalil Mozhdehi,Reza Jalil Mozhdehi and Henry Medeiros,"Deep Convolutional Correlation Iterative Particle Filter for Visual
  Tracking","25 pages, 10 figures, 1 table","Computer Vision and Image Understanding (ELSEVIER), Volume 222,
  103479, 2022",10.1016/j.cviu.2022.103479,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This work proposes a novel framework for visual tracking based on the
integration of an iterative particle filter, a deep convolutional neural
network, and a correlation filter. The iterative particle filter enables the
particles to correct themselves and converge to the correct target position. We
employ a novel strategy to assess the likelihood of the particles after the
iterations by applying K-means clustering. Our approach ensures a consistent
support for the posterior distribution. Thus, we do not need to perform
resampling at every video frame, improving the utilization of prior
distribution information. Experimental results on two different benchmark
datasets show that our tracker performs favorably against state-of-the-art
methods.
","[{'version': 'v1', 'created': 'Wed, 7 Jul 2021 02:44:43 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Jan 2023 20:31:29 GMT'}]",2023-01-05,"[['Mozhdehi', 'Reza Jalil', ''], ['Medeiros', 'Henry', '']]","['Iterative Particle Filter', 'Deep Convolutional Neural Network', 'CorrelationMap', 'Visual Tracking']"
7756,2104.11037,Antonios Liapis,Antonios Liapis,10 Years of the PCG workshop: Past and Future Trends,10 pages,"Proceedings of the FDG Workshop on Procedural Content Generation,
  2020",10.1145/3402942.3409598,,cs.AI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As of 2020, the international workshop on Procedural Content Generation
enters its second decade. The annual workshop, hosted by the international
conference on the Foundations of Digital Games, has collected a corpus of 95
papers published in its first 10 years. This paper provides an overview of the
workshop's activities and surveys the prevalent research topics emerging over
the years.
","[{'version': 'v1', 'created': 'Sun, 21 Mar 2021 13:02:29 GMT'}]",2021-04-23,"[['Liapis', 'Antonios', '']]","['Procedural Content Generation', 'Academic Topics', 'Survey']"
7757,2009.10242,EPTCS,"Pedro Cabalar (University of Coru\~na, Spain), Jorge Fandinno
  (University of Potsdam, Germany), Brais Mu\~niz (CITIC, University of
  Coru\~na, Spain)",A System for Explainable Answer Set Programming,"In Proceedings ICLP 2020, arXiv:2009.09158","EPTCS 325, 2020, pp. 124-136",10.4204/EPTCS.325.19,,cs.AI cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present xclingo, a tool for generating explanations from ASP programs
annotated with text and labels. These annotations allow tracing the application
of rules or the atoms derived by them. The input of xclingo is a markup
language written as ASP comment lines, so the programs annotated in this way
can still be accepted by a standard ASP solver. xclingo translates the
annotations into additional predicates and rules and uses the ASP solver clingo
to obtain the extension of those auxiliary predicates. This information is used
afterwards to construct derivation trees containing textual explanations. The
language allows selecting which atoms to explain and, in its turn, which atoms
or rules to include in those explanations. We illustrate the basic features
through a diagnosis problem from the literature.
","[{'version': 'v1', 'created': 'Tue, 22 Sep 2020 00:48:59 GMT'}]",2020-09-23,"[['Cabalar', 'Pedro', '', 'University of Coruña, Spain'], ['Fandinno', 'Jorge', '', 'University of Potsdam, Germany'], ['Muñiz', 'Brais', '', 'CITIC, University of\n  Coruña, Spain']]","['Answer Set Programming', 'Causal justifications', 'Non-Monotonic Reasoning', 'ASP debugging', 'Diagnosis']"
7758,2101.08621,Riku Arakawa,Riku Arakawa and Hiromu Yakura,"Mindless Attractor: A False-Positive Resistant Intervention for Drawing
  Attention Using Auditory Perturbation","To appear in ACM CHI Conference on Human Factors in Computing Systems
  (CHI '21), May 8-13, 2021, Yokohama, Japan",,10.1145/3411764.3445339,,cs.HC cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Explicitly alerting users is not always an optimal intervention, especially
when they are not motivated to obey. For example, in video-based learning,
learners who are distracted from the video would not follow an alert asking
them to pay attention. Inspired by the concept of Mindless Computing, we
propose a novel intervention approach, Mindless Attractor, that leverages the
nature of human speech communication to help learners refocus their attention
without relying on their motivation. Specifically, it perturbs the voice in the
video to direct their attention without consuming their conscious awareness.
Our experiments not only confirmed the validity of the proposed approach but
also emphasized its advantages in combination with a machine learning-based
sensing module. Namely, it would not frustrate users even though the
intervention is activated by false-positive detection of their attentive state.
Our intervention approach can be a reliable way to induce behavioral change in
human-AI symbiosis.
","[{'version': 'v1', 'created': 'Thu, 21 Jan 2021 14:10:54 GMT'}]",2021-01-22,"[['Arakawa', 'Riku', ''], ['Yakura', 'Hiromu', '']]","['Mindless computing', 'Human attention', 'Computational intervention', 'Machine learning-based sensing', 'Video-based learning']"
7759,2204.09821,Rafael Silva,"Rafael M.L. Silva, Erica Principe Cruz, Daniela K. Rosner, Dayton
  Kelly, Andr\'es Monroy-Hern\'andez, Fannie Liu","Understanding AR Activism: An Interview Study with Creators of Augmented
  Reality Experiences for Social Change",,,10.1145/3491102.3517605,,cs.HC cs.CY,http://creativecommons.org/licenses/by-sa/4.0/,"  The rise of consumer augmented reality (AR) technology has opened up new
possibilities for interventions intended to disrupt and subvert cultural
conventions. From defacing corporate logos to erecting geofenced digital
monuments, more and more people are creating AR experiences for social causes.
We sought to understand this new form of activism, including why people use AR
for these purposes, opportunities and challenges in using it, and how well it
can support activist goals. We conducted semi-structured interviews with twenty
people involved in projects that used AR for a social cause across six
different countries. We found that AR can overcome physical world limitations
of activism to convey immersive, multilayered narratives that aim to reveal
invisible histories and perspectives. At the same time, people experienced
challenges in creating, maintaining, and distributing their AR experiences to
audiences. We discuss open questions and opportunities for creating AR tools
and experiences for social change.
","[{'version': 'v1', 'created': 'Thu, 21 Apr 2022 00:12:55 GMT'}]",2022-04-22,"[['Silva', 'Rafael M. L.', ''], ['Cruz', 'Erica Principe', ''], ['Rosner', 'Daniela K.', ''], ['Kelly', 'Dayton', ''], ['Monroy-Hernández', 'Andrés', ''], ['Liu', 'Fannie', '']]","['augmented reality', 'activism', 'social change']"
7760,2203.15705,Ghassan Samara,"Mohammad A. Hassan, Ghassan Samara, and Mohammad Abu Fadda","IoT Forensic Frameworks (DFIF, IoTDOTS,FSAIoT): A Comprehensive Study",15 pages,"Int. J. Advance Soft Compu. Appl, Vol. 14, No. 1, March 2022 Print
  ISSN: 2710-1274, Online ISSN: 2074-8523",10.15849/IJASCA.220328.06,,cs.CR cs.NI,http://creativecommons.org/licenses/by/4.0/,"  In the Internet of Things, millions of electronic items, including
automobiles, smoke alarms, watches, eyeglasses, webcams, and other devices, are
now connected to the Internet (IoT). Aside from the luxury and comfort that the
individual obtains in the field of IoT, as well as its ability to communicate
and obtain information easily and quickly, the other concerning aspect is the
achievement of privacy and security in this connection, especially given the
rapid increase in the number of existing and new IoT devices. Concerns,
threats, and assaults related to IoT security have been regarded as a potential
and problematic area of research. This necessitates the quick development or
creation of suitable technologies with the nature of crimes in the IoT
environment. On the other hand, criminal investigation specialists encounter
difficulties and hurdles due to various locations, data types, instruments
used, and device recognition. This paper provides an in-depth explanation of
the criminal content of the Internet of Things. It compares its stages to the
detailed stages of traditional digital forensics in terms of similarities and
differences, the frameworks used in dealing with electronic crimes, and the
techniques used in both types. This paper presents previous discussions of
researchers in the field of digital forensics. For the IoT, which brings us to
the most important parts of this paper, which is a comprehensive study of the
IoT criminal frameworks that are used to protect communication in the field of
IoT, such as Digital Forensic Investigation Framework (DFIF), Digital Forensic
Framework for Smart Environments (IoTDOTS), Forensic State Acquisition from the
Internet of Things (FSAIoT), and discusses the challenges in their general
frameworks and provides solutions and strategies.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2022 11:48:19 GMT'}]",2022-03-30,"[['Hassan', 'Mohammad A.', ''], ['Samara', 'Ghassan', ''], ['Fadda', 'Mohammad Abu', '']]","['digital forensic', 'FSAIoT', 'IoT', 'IoT Challenges', 'IoT Forensic', 'IoT Framework', 'IOTDOTS']"
7761,1910.12948,Gilles Vandewiele,Gilles Vandewiele and Femke Ongenae and Filip De Turck,GENDIS: GENetic DIscovery of Shapelets,,,10.3390/s21041059,,cs.NE cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  In the time series classification domain, shapelets are small time series
that are discriminative for a certain class. It has been shown that classifiers
are able to achieve state-of-the-art results on a plethora of datasets by
taking as input distances from the input time series to different
discriminative shapelets. Additionally, these shapelets can easily be
visualized and thus possess an interpretable characteristic, making them very
appealing in critical domains, such as the health care domain, where
longitudinal data is ubiquitous. In this study, a new paradigm for shapelet
discovery is proposed, which is based upon evolutionary computation. The
advantages of the proposed approach are that (i) it is gradient-free, which
could allow to escape from local optima more easily and to find suited
candidates more easily and supports non-differentiable objectives, (ii) no
brute-force search is required, which drastically reduces the computational
complexity by several orders of magnitude, (iii) the total amount of shapelets
and length of each of these shapelets are evolved jointly with the shapelets
themselves, alleviating the need to specify this beforehand, (iv) entire sets
are evaluated at once as opposed to single shapelets, which results in smaller
final sets with less similar shapelets that result in similar predictive
performances, and (v) discovered shapelets do not need to be a subsequence of
the input time series. We present the results of experiments which validate the
enumerated advantages.
","[{'version': 'v1', 'created': 'Fri, 13 Sep 2019 08:51:35 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jan 2021 12:23:35 GMT'}]",2021-02-09,"[['Vandewiele', 'Gilles', ''], ['Ongenae', 'Femke', ''], ['De Turck', 'Filip', '']]","['genetic algorithms', 'time series classification', 'time series analysis', 'interpretablemachine learning', 'data mining']"
7762,1812.08507,Giovanni Abramo,"Giovanni Abramo, Ciriaco Andrea D'Angelo, Flavia Di Costa","A new bibliometric approach to assess the scientific specialization of
  regions",,"Abramo, G., D'Angelo, C.A., Di Costa, F. (2014). A new
  bibliometric approach to assess the scientific specialization of regions.
  Research Evaluation, 23(2), 183-194",10.1093/reseval/rvu005,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The objective of the current work is to identify the territorial scientific
specializations present in Italy, at the levels of regions and provinces (NUTS2
and NUTS3). To do this, we take a bibliometric approach based on the scientific
production of the entire public research system in the hard sciences sphere,
for the five years 2006-2010. In particular, we apply a new index of scientific
specialization (Scientific Specialization Index, SSI) that takes account of
both the quantity and quality of scientific production achieved by the research
institutions of a given territory.
","[{'version': 'v1', 'created': 'Thu, 20 Dec 2018 12:09:59 GMT'}]",2018-12-21,"[['Abramo', 'Giovanni', ''], [""D'Angelo"", 'Ciriaco Andrea', ''], ['Di Costa', 'Flavia', '']]","['Regional innovation systems', 'scientific specialization index', 'bibliometrics', 'Italy']"
7763,2103.11821,Joonas Sova,"J\""uri Lember, Joonas Sova",Regenerativity of Viterbi process for pairwise Markov models,arXiv admin note: substantial text overlap with arXiv:1708.03799,Journal of Theoretical Probability volume 34 (2021),10.1007/s10959-020-01022-z,,cs.IT math.IT math.ST stat.ML stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For hidden Markov models one of the most popular estimates of the hidden
chain is the Viterbi path -- the path maximising the posterior probability. We
consider a more general setting, called the pairwise Markov model (PMM), where
the joint process consisting of finite-state hidden process and observation
process is assumed to be a Markov chain. It has been recently proven that under
some conditions the Viterbi path of the PMM can almost surely be extended to
infinity, thereby defining the infinite Viterbi decoding of the observation
sequence, called the Viterbi process. This was done by constructing a block of
observations, called a barrier, which ensures that the Viterbi path goes trough
a given state whenever this block occurs in the observation sequence. In this
paper we prove that the joint process consisting of Viterbi process and PMM is
regenerative. The proof involves a delicate construction of regeneration times
which coincide with the occurrences of barriers. As one possible application of
our theory, some results on the asymptotics of the Viterbi training algorithm
are derived.
","[{'version': 'v1', 'created': 'Mon, 15 Mar 2021 15:01:29 GMT'}]",2021-03-23,"[['Lember', 'Jüri', ''], ['Sova', 'Joonas', '']]","['Viterbi path', 'MAP path', 'Viterbi training', 'Viterbi algorithm', 'Markov switching model', 'hidden Markov model']"
7764,2103.00599,Sanjay Pant,"Gareth Jones, Jim Parr, Perumal Nithiarasu, Sanjay Pant","Machine learning for detection of stenoses and aneurysms: application in
  a physiologically realistic virtual patient database","Changelog: Added a bullet point in the discussion (end of section
  3.3)",Biomechanics and Modeling in Mechanobiology (2021),10.1007/s10237-021-01497-7,,cs.LG physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study presents an application of machine learning (ML) methods for
detecting the presence of stenoses and aneurysms in the human arterial system.
Four major forms of arterial disease -- carotid artery stenosis (CAS),
subclavian artery stenosis (SAC), peripheral arterial disease (PAD), and
abdominal aortic aneurysms (AAA) -- are considered. The ML methods are trained
and tested on a physiologically realistic virtual patient database (VPD)
containing 28,868 healthy subjects, which is adapted from the authors previous
work and augmented to include the four disease forms. Six ML methods -- Naive
Bayes, Logistic Regression, Support Vector Machine, Multi-layer Perceptron,
Random Forests, and Gradient Boosting -- are compared with respect to
classification accuracies and it is found that the tree-based methods of Random
Forest and Gradient Boosting outperform other approaches. The performance of ML
methods is quantified through the F1 score and computation of sensitivities and
specificities. When using all the six measurements, it is found that maximum F1
scores larger than 0.9 are achieved for CAS and PAD, larger than 0.85 for SAS,
and larger than 0.98 for both low- and high-severity AAAs. Corresponding
sensitivities and specificities are larger than 90% for CAS and PAD, larger
than 85% for SAS, and larger than 98% for both low- and high-severity AAAs.
When reducing the number of measurements, it is found that the performance is
degraded by less than 5% when three measurements are used, and less than 10%
when only two measurements are used for classification. For AAA, it is shown
that F1 scores larger than 0.85 and corresponding sensitivities and
specificities larger than 85% are achievable when using only a single
measurement. The results are encouraging to pursue AAA monitoring and screening
through wearable devices which can reliably measure pressure or flow-rates
","[{'version': 'v1', 'created': 'Sun, 28 Feb 2021 19:38:22 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Mar 2021 09:44:46 GMT'}]",2021-08-03,"[['Jones', 'Gareth', ''], ['Parr', 'Jim', ''], ['Nithiarasu', 'Perumal', ''], ['Pant', 'Sanjay', '']]","['virtual patients', 'stenosis', 'aneurysm', 'pulse wave haemodynamics', 'screening', 'machine learning']"
7765,1809.03692,Xiaowei Li,"Xiaowei Li, Ying Wang, Qiong-Hua Wang, Yang Liu, and Xin Zhou","Modified integral imaging reconstruction and encryption using an
  improved SR reconstruction algorithm",,,10.1016/j.optlaseng.2018.09.015,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a monospectral image encryption method in which the multispectral
color image acquisition by using heterogeneous monospectral cameras. Because
the captured monospectral elemental images (EIs) belongs to grayscale image, it
is means that the captured EIs can be directly encrypted by the proposed
encoding method. Subsequently, the linear cellular automata (CA) and
hyperchaotic encoding algorithm are employed to encrypt the captured EIs.
Different from previous methods, the proposed method can directly encrypt the
multispectral color information rather than having to divide into three color
channels (R, G and B), thereby, the proposed method can greatly reduce the
encryption calculation.
","[{'version': 'v1', 'created': 'Tue, 11 Sep 2018 06:28:08 GMT'}]",2018-10-17,"[['Li', 'Xiaowei', ''], ['Wang', 'Ying', ''], ['Wang', 'Qiong-Hua', ''], ['Liu', 'Yang', ''], ['Zhou', 'Xin', '']]","['Monospectral image encryption', 'Hyperchaotic system', 'Cellularautomata', 'Color image encryption']"
7766,2112.10938,Phyllipe Lima,"Phyllipe Lima, Jorge Melegati, Everaldo Gomes, Nathalya Stefhany
  Pereira, Eduardo Guerra, Paulo Meirelles","CADV: A software visualization approach for code annotations
  distribution",53 pages,,10.1016/j.infsof.2022.107089,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Code annotations is a widely used feature in Java systems to configure custom
metadata on programming elements. Their increasing presence creates the need
for approaches to assess and comprehend their usage and distribution. In this
context, software visualization has been studied and researched to improve
program comprehension in different aspects. This study aimed at designing a
software visualization approach that graphically displays how code annotations
are distributed and organized in a software system and developing a tool, as a
reference implementation of the approach, to generate views and interact with
users. We conducted an empirical evaluation through questionnaires and
interviews to evaluate our visualization approach considering four aspects:
effectiveness for program comprehension, perceived usefulness, perceived ease
of use, and suitability for the intended audience. The resulting data was used
to perform a qualitative and quantitative analysis. The tool identifies package
responsibilities providing visual information about their annotations at
different levels. Using the developed tool, the participants achieved a high
correctness rate in the program comprehension tasks and performed very well in
questions about the overview of the system under analysis. Finally,
participants perceived that the tool outperforms existing approaches for code
inspection when searching for information related to code annotations. The
results show that the visualization approach using the developed tool is
effective in program comprehension tasks related to code annotations, which can
also be used to identify responsibilities in the application packages.
Moreover, it was evaluated as suitable for newcomers to overview the usage of
annotations in the system and for architects to perform a deep analysis that
can potentially detect misplaced annotations and abnormal growths on their
usage.
","[{'version': 'v1', 'created': 'Tue, 21 Dec 2021 02:01:29 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Dec 2021 02:07:43 GMT'}, {'version': 'v3', 'created': 'Mon, 27 Jun 2022 12:58:10 GMT'}]",2022-10-14,"[['Lima', 'Phyllipe', ''], ['Melegati', 'Jorge', ''], ['Gomes', 'Everaldo', ''], ['Pereira', 'Nathalya Stefhany', ''], ['Guerra', 'Eduardo', ''], ['Meirelles', 'Paulo', '']]","['Code Annotations', 'Circle Packing', 'Empirical Evaluation', 'Software']"
7767,2005.00372,Navid Rekabsaz,"Navid Rekabsaz, Markus Schedl",Do Neural Ranking Models Intensify Gender Bias?,In Proceedings of ACM SIGIR 2020,,10.1145/3397271.3401280,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Concerns regarding the footprint of societal biases in information retrieval
(IR) systems have been raised in several previous studies. In this work, we
examine various recent IR models from the perspective of the degree of gender
bias in their retrieval results. To this end, we first provide a bias
measurement framework which includes two metrics to quantify the degree of the
unbalanced presence of gender-related concepts in a given IR model's ranking
list. To examine IR models by means of the framework, we create a dataset of
non-gendered queries, selected by human annotators. Applying these queries to
the MS MARCO Passage retrieval collection, we then measure the gender bias of a
BM25 model and several recent neural ranking models. The results show that
while all models are strongly biased toward male, the neural models, and in
particular the ones based on contextualized embedding models, significantly
intensify gender bias. Our experiments also show an overall increase in the
gender bias of neural models when they exploit transfer learning, namely when
they use (already biased) pre-trained embeddings.
","[{'version': 'v1', 'created': 'Fri, 1 May 2020 13:31:11 GMT'}, {'version': 'v2', 'created': 'Fri, 22 May 2020 08:10:14 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Jun 2020 13:11:59 GMT'}]",2021-01-20,"[['Rekabsaz', 'Navid', ''], ['Schedl', 'Markus', '']]","['Retrieval Gender Bias', 'Neural Ranking Models', 'Bias Measurement']"
7768,2001.01603,Jonathan Hasenburg,Jonathan Hasenburg and David Bermbach,GeoBroker: Leveraging Geo-Contexts for IoT Data Distribution,Accepted for publication in Elsevier Computer Communications,Computer Communications 151 (2020) 473-484,10.1016/j.comcom.2020.01.015,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In the Internet of Things, the relevance of data often depends on the
geographic context of data producers and consumers. Today's data distribution
services, however, mostly focus on data content and not on geo-context, which
could help to reduce the dissemination of excess data in many IoT scenarios. In
this paper, we propose to use the geo-context information associated with
devices to control data distribution. We define what geo-context dimensions
exist and compare our definition with concepts from related work.
  Furthermore, we designed GeoBroker, a data distribution service that uses the
location of things, as well as geofences for messages and subscriptions, to
control data distribution. This way, we enable new IoT application scenarios
while also increasing overall system efficiency for scenarios where
geo-contexts matter by delivering only relevant messages. We evaluate our
approach based on a proof-of-concept prototype and several experiments.
","[{'version': 'v1', 'created': 'Mon, 6 Jan 2020 14:25:06 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Jan 2020 18:22:06 GMT'}, {'version': 'v3', 'created': 'Mon, 20 Jan 2020 14:30:13 GMT'}]",2020-01-22,"[['Hasenburg', 'Jonathan', ''], ['Bermbach', 'David', '']]","['Geo-Context', 'IoT', 'Data Distribution']"
7769,2212.04206,Katie Seaborn,Katie Seaborn and Alexa Frank,What Pronouns for Pepper? A Critical Review of Gender/ing in Research,Accepted at CHI '22,"Proc. SIGCHI Conf. Hum. Factor Comput. Syst. (2022), Article No.
  239, 1-15",10.1145/3491102.3501996,,cs.RO cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Gender/ing guides how we view ourselves, the world around us, and each
other--including non-humans. Critical voices have raised the alarm about
stereotyped gendering in the design of socially embodied artificial agents like
voice assistants, conversational agents, and robots. Yet, little is known about
how this plays out in research and to what extent. As a first step, we
critically reviewed the case of Pepper, a gender-ambiguous humanoid robot. We
conducted a systematic review (n=75) involving meta-synthesis and content
analysis, examining how participants and researchers gendered Pepper through
stated and unstated signifiers and pronoun usage. We found that ascriptions of
Pepper's gender were inconsistent, limited, and at times discordant, with
little evidence of conscious gendering and some indication of researcher
influence on participant gendering. We offer six challenges driving the state
of affairs and a practical framework coupled with a critical checklist for
centering gender in research on artificial agents.
","[{'version': 'v1', 'created': 'Thu, 8 Dec 2022 11:40:41 GMT'}]",2022-12-09,"[['Seaborn', 'Katie', ''], ['Frank', 'Alexa', '']]","['Gender', 'Socially embodied artificial agents', 'Humanoid robots', 'Pepper', 'User perception']"
7770,2201.13389,Thi Nguyen Khoa Nguyen,"Thi Nguyen Khoa Nguyen, Thibault Dairay, Rapha\""el Meunier, Mathilde
  Mougeot","Physics-informed neural networks for non-Newtonian fluid
  thermo-mechanical problems: an application to rubber calendering process","22 pages, 46 figures, 6 tables","Engineering Applications of Artificial Intelligence, 114 (2022)
  105176",10.1016/j.engappai.2022.105176,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Physics-Informed Neural Networks (PINNs) have gained much attention in
various fields of engineering thanks to their capability of incorporating
physical laws into the models. However, the assessment of PINNs in industrial
applications involving coupling between mechanical and thermal fields is still
an active research topic. In this work, we present an application of PINNs to a
non-Newtonian fluid thermo-mechanical problem which is often considered in the
rubber calendering process. We demonstrate the effectiveness of PINNs when
dealing with inverse and ill-posed problems, which are impractical to be solved
by classical numerical discretization methods. We study the impact of the
placement of the sensors and the distribution of unsupervised points on the
performance of PINNs in a problem of inferring hidden physical fields from some
partial data. We also investigate the capability of PINNs to identify unknown
physical parameters from the measurements captured by sensors. The effect of
noisy measurements is also considered throughout this work. The results of this
paper demonstrate that in the problem of identification, PINNs can successfully
estimate the unknown parameters using only the measurements on the sensors. In
ill-posed problems where boundary conditions are not completely defined, even
though the placement of the sensors and the distribution of unsupervised points
have a great impact on PINNs performance, we show that the algorithm is able to
infer the hidden physics from local measurements.
","[{'version': 'v1', 'created': 'Mon, 31 Jan 2022 17:54:44 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Jun 2022 06:18:21 GMT'}]",2022-07-19,"[['Nguyen', 'Thi Nguyen Khoa', ''], ['Dairay', 'Thibault', ''], ['Meunier', 'Raphaël', ''], ['Mougeot', 'Mathilde', '']]","['Physics-informed neural networks', 'non-Newtonian fluid', 'thermo-mechanical problem']"
7771,2104.10017,Scott Ruoti,"Sean Oesch, Anuj Gautam, Scott Ruoti","The Emperor's New Autofill Framework: A Security Analysis of Autofill on
  iOS and Android","12 pages, 3 pages appendix, published at ACSAC 2021",,10.1145/3485832.3485884,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Password managers help users more effectively manage their passwords,
encouraging them to adopt stronger passwords across their many accounts. In
contrast to desktop systems where password managers receive no system-level
support, mobile operating systems provide autofill frameworks designed to
integrate with password managers to provide secure and usable autofill for
browsers and other apps installed on mobile devices. In this paper, we evaluate
mobile autofill frameworks on iOS and Android, examining whether they achieve
substantive benefits over the ad-hoc desktop environment or become a
problematic single point of failure. Our results find that while the frameworks
address several common issues, they also enforce insecure behavior and fail to
provide password managers sufficient information to override the frameworks'
insecure behavior, resulting in mobile managers being less secure than their
desktop counterparts overall. We also demonstrate how these frameworks act as a
confused deputy in manager-assisted credential phishing attacks. Our results
demonstrate the need for significant improvements to mobile autofill
frameworks. We conclude the paper with recommendations for the design and
implementation of secure autofill frameworks.
","[{'version': 'v1', 'created': 'Tue, 20 Apr 2021 14:54:10 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Sep 2021 13:51:41 GMT'}]",2021-09-29,"[['Oesch', 'Sean', ''], ['Gautam', 'Anuj', ''], ['Ruoti', 'Scott', '']]","['password managers', 'mobile framework', 'authentication', 'securityevaluation']"
7772,1907.05538,Weiying Wang,"Weiying Wang, Ninad Jadhav, Paul Vohs, Nathan Hughes, Mark Mazumder,
  and Stephanie Gil","Active Rendezvous for Multi-Robot Pose Graph Optimization using Sensing
  over Wi-Fi",,"International Symposium on Robotics Research (ISRR), Hanoi, 2019",10.1007/978-3-030-95459-8_51,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a novel framework for collaboration amongst a team of robots
performing Pose Graph Optimization (PGO) that addresses two important
challenges for multi-robot SLAM: i) that of enabling information exchange
""on-demand"" via Active Rendezvous without using a map or the robot's location,
and ii) that of rejecting outlying measurements. Our key insight is to exploit
relative position data present in the communication channel between robots to
improve groundtruth accuracy of PGO. We develop an algorithmic and experimental
framework for integrating Channel State Information (CSI) with multi-robot PGO;
it is distributed, and applicable in low-lighting or featureless environments
where traditional sensors often fail. We present extensive experimental results
on actual robots and observe that using Active Rendezvous results in a 64%
reduction in ground truth pose error and that using CSI observations to aid
outlier rejection reduces ground truth pose error by 32%. These results show
the potential of integrating communication as a novel sensor for SLAM.
","[{'version': 'v1', 'created': 'Fri, 12 Jul 2019 01:07:39 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Dec 2019 02:26:24 GMT'}, {'version': 'v3', 'created': 'Tue, 2 Nov 2021 21:07:19 GMT'}]",2022-04-06,"[['Wang', 'Weiying', ''], ['Jadhav', 'Ninad', ''], ['Vohs', 'Paul', ''], ['Hughes', 'Nathan', ''], ['Mazumder', 'Mark', ''], ['Gil', 'Stephanie', '']]","['Rendezvous', 'Multi-robot SLAM', 'Sensing', 'Wi-Fi', 'Robotics']"
7773,2011.02863,Meike Nauta,"Meike Nauta, Annemarie Jutte, Jesper Provoost, Christin Seifert","This Looks Like That, Because ... Explaining Prototypes for
  Interpretable Image Recognition","10 pages, 9 figures",,10.1007/978-3-030-93736-2_34,,cs.CV cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image recognition with prototypes is considered an interpretable alternative
for black box deep learning models. Classification depends on the extent to
which a test image ""looks like"" a prototype. However, perceptual similarity for
humans can be different from the similarity learned by the classification
model. Hence, only visualising prototypes can be insufficient for a user to
understand what a prototype exactly represents, and why the model considers a
prototype and an image to be similar. We address this ambiguity and argue that
prototypes should be explained. We improve interpretability by automatically
enhancing visual prototypes with textual quantitative information about visual
characteristics deemed important by the classification model. Specifically, our
method clarifies the meaning of a prototype by quantifying the influence of
colour hue, shape, texture, contrast and saturation and can generate both
global and local explanations. Because of the generality of our approach, it
can improve the interpretability of any similarity-based method for
prototypical image recognition. In our experiments, we apply our method to the
existing Prototypical Part Network (ProtoPNet). Our analysis confirms that the
global explanations are generalisable, and often correspond to the visually
perceptible properties of a prototype. Our explanations are especially relevant
for prototypes which might have been interpreted incorrectly otherwise. By
explaining such 'misleading' prototypes, we improve the interpretability and
simulatability of a prototype-based classification model. We also use our
method to check whether visually similar prototypes have similar explanations,
and are able to discover redundancy. Code is available at
https://github.com/M-Nauta/Explaining_Prototypes .
","[{'version': 'v1', 'created': 'Thu, 5 Nov 2020 14:43:07 GMT'}, {'version': 'v2', 'created': 'Wed, 31 Mar 2021 07:13:23 GMT'}]",2022-08-18,"[['Nauta', 'Meike', ''], ['Jutte', 'Annemarie', ''], ['Provoost', 'Jesper', ''], ['Seifert', 'Christin', '']]","['Prototypes', 'interpretability', 'explainable artificial intelligence']"
7774,2211.09609,Seth Poulsen,"Seth Poulsen, Yael Gertner, Benjamin Cosman, Matthew West, Geoffrey L.
  Herman",Efficiency of Learning from Proof Blocks Versus Writing Proofs,To be presented at SIGCSE 2023,SIGCSE 2023,10.1145/3545945.3569797,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Proof Blocks is a software tool that provides students with a scaffolded
proof-writing experience, allowing them to drag and drop prewritten proof lines
into the correct order instead of starting from scratch. In this paper we
describe a randomized controlled trial designed to measure the learning gains
of using Proof Blocks for students learning proof by induction. The study
participants were 332 students recruited after completing the first month of
their discrete mathematics course. Students in the study took a pretest and
read lecture notes on proof by induction, completed a brief (less than 1 hour)
learning activity, and then returned one week later to complete the posttest.
Depending on the experimental condition that each student was assigned to, they
either completed only Proof Blocks problems, completed some Proof Blocks
problems and some written proofs, or completed only written proofs for their
learning activity. We find that students in the early phases of learning about
proof by induction are able to learn just as much from reading lecture notes
and using Proof Blocks as by reading lecture notes and writing proofs from
scratch, but in far less time on task. This finding complements previous
findings that Proof Blocks are useful exam questions and are viewed positively
by students.
","[{'version': 'v1', 'created': 'Thu, 17 Nov 2022 15:57:59 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Dec 2022 21:27:35 GMT'}]",2022-12-20,"[['Poulsen', 'Seth', ''], ['Gertner', 'Yael', ''], ['Cosman', 'Benjamin', ''], ['West', 'Matthew', ''], ['Herman', 'Geoffrey L.', '']]","['discrete mathematics', 'CS education', 'automatic grading', 'proofs']"
7775,2108.11468,Arlene John,"Arlene John, Koushik Kumar Nundy, Barry Cardiff, Deepu John","SomnNET: An SpO2 Based Deep Learning Network for Sleep Apnea Detection
  in Smartwatches","Accepted for discussion at the IEEE Engineering in Medicine and
  Biology Conference (EMBC) 2021",,10.1109/EMBC46164.2021.9631037,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The abnormal pause or rate reduction in breathing is known as the sleep-apnea
hypopnea syndrome and affects the quality of sleep of an individual. A novel
method for the detection of sleep apnea events (pause in breathing) from
peripheral oxygen saturation (SpO2) signals obtained from wearable devices is
discussed in this paper. The paper details an apnea detection algorithm of a
very high resolution on a per-second basis for which a 1-dimensional
convolutional neural network -- which we termed SomnNET -- is developed. This
network exhibits an accuracy of 97.08% and outperforms several lower resolution
state-of-the-art apnea detection methods. The feasibility of model pruning and
binarization to reduce the computational complexity is explored. The pruned
network with 80% sparsity exhibited an accuracy of 89.75%, and the binarized
network exhibited an accuracy of 68.22%. The performance of the proposed
networks is compared against several state-of-the-art algorithms.
","[{'version': 'v1', 'created': 'Wed, 25 Aug 2021 20:49:49 GMT'}]",2021-12-22,"[['John', 'Arlene', ''], ['Nundy', 'Koushik Kumar', ''], ['Cardiff', 'Barry', ''], ['John', 'Deepu', '']]","['Sleep apnea detection', 'Peripheral Oxygen Saturation', 'Convolutional neural networks']"
7776,2208.04125,Haoye Tian,"Haoye Tian, Xunzhu Tang, Andrew Habib, Shangwen Wang, Kui Liu, Xin
  Xia, Jacques Klein, Tegawend\'e F. Bissyand\'e","Is this Change the Answer to that Problem? Correlating Descriptions of
  Bug and Code Changes for Evaluating Patch Correctness",,,10.1145/3551349.3556914,,cs.SE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we propose a novel perspective to the problem of patch
correctness assessment: a correct patch implements changes that ""answer"" to a
problem posed by buggy behaviour. Concretely, we turn the patch correctness
assessment into a Question Answering problem. To tackle this problem, our
intuition is that natural language processing can provide the necessary
representations and models for assessing the semantic correlation between a bug
(question) and a patch (answer). Specifically, we consider as inputs the bug
reports as well as the natural language description of the generated patches.
Our approach, Quatrain, first considers state of the art commit message
generation models to produce the relevant inputs associated to each generated
patch. Then we leverage a neural network architecture to learn the semantic
correlation between bug reports and commit messages. Experiments on a large
dataset of 9135 patches generated for three bug datasets (Defects4j, Bugs.jar
and Bears) show that Quatrain can achieve an AUC of 0.886 on predicting patch
correctness, and recalling 93% correct patches while filtering out 62%
incorrect patches. Our experimental results further demonstrate the influence
of inputs quality on prediction performance. We further perform experiments to
highlight that the model indeed learns the relationship between bug reports and
code change descriptions for the prediction. Finally, we compare against prior
work and discuss the benefits of our approach.
","[{'version': 'v1', 'created': 'Mon, 8 Aug 2022 13:32:58 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Sep 2022 08:37:38 GMT'}]",2022-09-02,"[['Tian', 'Haoye', ''], ['Tang', 'Xunzhu', ''], ['Habib', 'Andrew', ''], ['Wang', 'Shangwen', ''], ['Liu', 'Kui', ''], ['Xia', 'Xin', ''], ['Klein', 'Jacques', ''], ['Bissyandé', 'Tegawendé F.', '']]","['Patch Correctness', 'Program Repair', 'Question Answering', 'MachineLearning']"
7777,2110.14340,Kazuaki Matsumura,"Kazuaki Matsumura, Simon Garcia De Gonzalo, Antonio J. Pe\~na","JACC: An OpenACC Runtime Framework with Kernel-Level and Multi-GPU
  Parallelization","Extended version of a paper to appear in: Proceedings of the 28th
  IEEE International Conference on High Performance Computing, Data, and
  Analytics (HiPC), December 17-18, 2021",,10.1109/HiPC53243.2021.00032,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rapid development in computing technology has paved the way for
directive-based programming models towards a principal role in maintaining
software portability of performance-critical applications. Efforts on such
models involve a least engineering cost for enabling computational acceleration
on multiple architectures while programmers are only required to add meta
information upon sequential code. Optimizations for obtaining the best possible
efficiency, however, are often challenging. The insertions of directives by the
programmer can lead to side-effects that limit the available compiler
optimization possible, which could result in performance degradation. This is
exacerbated when targeting multi-GPU systems, as pragmas do not automatically
adapt to such systems, and require expensive and time consuming code adjustment
by programmers.
  This paper introduces JACC, an OpenACC runtime framework which enables the
dynamic extension of OpenACC programs by serving as a transparent layer between
the program and the compiler. We add a versatile code-translation method for
multi-device utilization by which manually-optimized applications can be
distributed automatically while keeping original code structure and
parallelism. We show in some cases nearly linear scaling on the part of kernel
execution with the NVIDIA V100 GPUs. While adaptively using multi-GPUs, the
resulting performance improvements amortize the latency of GPU-to-GPU
communications.
","[{'version': 'v1', 'created': 'Wed, 27 Oct 2021 10:43:48 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Dec 2021 14:05:57 GMT'}, {'version': 'v3', 'created': 'Wed, 27 Apr 2022 12:43:52 GMT'}]",2022-04-28,"[['Matsumura', 'Kazuaki', ''], ['De Gonzalo', 'Simon Garcia', ''], ['Peña', 'Antonio J.', '']]","['Multi-GPUs', 'Runtime System', 'Code Generation', 'Directive-Based Programming']"
7778,2209.02270,F. Serhan Dani\c{s},"F. Serhan Dani\c{s}, A. Teoman Naskali, A. Taylan Cemgil, Cem Ersoy","An Indoor Localization Dataset and Data Collection Framework with High
  Precision Position Annotation",30 pages,"F. Serhan Dani\c{s}, A. Teoman Naskali, A. Taylan Cemgil, Cem
  Ersoy, ""An indoor localization dataset and data collection framework with
  high precision position annotation"", Pervasive and Mobile Computing, Volume
  81, 101554, 2022",10.1016/j.pmcj.2022.101554,,cs.LG cs.CV cs.NI cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  We introduce a novel technique and an associated high resolution dataset that
aims to precisely evaluate wireless signal based indoor positioning algorithms.
The technique implements an augmented reality (AR) based positioning system
that is used to annotate the wireless signal parameter data samples with high
precision position data. We track the position of a practical and low cost
navigable setup of cameras and a Bluetooth Low Energy (BLE) beacon in an area
decorated with AR markers. We maximize the performance of the AR-based
localization by using a redundant number of markers. Video streams captured by
the cameras are subjected to a series of marker recognition, subset selection
and filtering operations to yield highly precise pose estimations. Our results
show that we can reduce the positional error of the AR localization system to a
rate under 0.05 meters. The position data are then used to annotate the BLE
data that are captured simultaneously by the sensors stationed in the
environment, hence, constructing a wireless signal data set with the ground
truth, which allows a wireless signal based localization system to be evaluated
accurately.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2022 07:41:11 GMT'}]",2022-09-09,"[['Daniş', 'F. Serhan', ''], ['Naskali', 'A. Teoman', ''], ['Cemgil', 'A. Taylan', ''], ['Ersoy', 'Cem', '']]","['Data collection', 'indoor positioning', 'augmented reality', 'data annotation', 'localization']"
7779,2212.04035,Mrityunjay (MJ) Kumar,Mrityunjay Kumar and Venkatesh Choppella,"A study of the design and documentation skills of industry-ready CS
  students",Accepted at COMPUTE '22,,10.1145/3561833.3561842,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An engineer in a product company is expected to design a good solution to a
computing problem (Design skill) and articulate the solution well (Expression
skill). We expect an industry-ready student (final year student or a fresh
campus hire) as well to demonstrate both these skills when working on simple
problems assigned to them.
  This paper reports on the results when we tested a cohort of participants
(N=16) for these two skills. We created two participant groups from two
different tiers of college, one from a Tier 1 college (who were taking an
advanced elective course), and another from Tier 2 colleges (who had been hired
for internship in a SaaS product company). We gave them a simple design problem
and evaluated the quality of their design and expression. Design quality was
evaluated along three design principles of Abstraction, Decomposition, and
Precision (adapted from the Software Engineering Book of Knowledge). Expression
quality was evaluated using criteria we developed for our study that is based
on the diversity and density of the expressions used in the articulation.
  We found the students lacking in design and expression skills. Specifically,
a) they struggled with abstraction as a design principle, b) they did not use
enough modes of expressions to articulate their design, and c) they did not use
enough formal notations (UML, equations, relations, etc.). We also found
significant difference in the performance between the two participant groups.
","[{'version': 'v1', 'created': 'Thu, 8 Dec 2022 02:11:57 GMT'}]",2022-12-09,"[['Kumar', 'Mrityunjay', ''], ['Choppella', 'Venkatesh', '']]","['software design skills', 'problem-solving skills', 'industry-ready students', 'engineering productivity']"
7780,2012.00351,M\'elodie Boillet,"M\'elodie Boillet, Marie-Laurence Bonhomme, Dominique Stutzmann and
  Christopher Kermorvant",HORAE: an annotated dataset of books of hours,,HIP 5 (2019) 7-12,10.1145/3352631.3352633,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce in this paper a new dataset of annotated pages from books of
hours, a type of handwritten prayer books owned and used by rich lay people in
the late middle ages. The dataset was created for conducting historical
research on the evolution of the religious mindset in Europe at this period
since the book of hours represent one of the major sources of information
thanks both to their rich illustrations and the different types of religious
sources they contain. We first describe how the corpus was collected and
manually annotated then present the evaluation of a state-of-the-art system for
text line detection and for zone detection and typing. The corpus is freely
available for research.
","[{'version': 'v1', 'created': 'Tue, 1 Dec 2020 09:25:38 GMT'}]",2020-12-02,"[['Boillet', 'Mélodie', ''], ['Bonhomme', 'Marie-Laurence', ''], ['Stutzmann', 'Dominique', ''], ['Kermorvant', 'Christopher', '']]","['Medieval manuscripts', 'layout analysis', 'neural networks', 'clustering']"
7781,1910.11677,Imad El Hanouti,"Imad El Hanouti, Hakim El Fadili","Security analysis of an audio data encryption scheme based on key
  chaining and DNA encoding","19 pages, 7 figures, 2 tables",,10.1007/s11042-020-10153-8,,cs.CR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fairly recently, a new encryption scheme for audio data encryption has been
proposed by Naskar, P.K., et al. The cryptosystem is based on
substitution-permutation encryption structure using DNA encoding at the
substitution stage, in which the key generation is based on a key chaining
algorithm that generates new key block for every plain block using a logistic
chaotic map. After some several statistical tests done by the authors of the
scheme, they claimed that their cryptosystem is robust and can resist
conventional cryptanalysis attacks. Negatively, in this paper we show the
opposite: the scheme is extremely weak against chosen ciphertext and plaintext
attacks thus only two chosen plaintexts of 32 byte size are sufficient to
recover the equivalent key used for encryption. The cryptosystem's shuffling
process design is vulnerable which allow us recovering the unknown original
plaintext by applying repeated encryptions. Our study proves that the scheme is
extremely weak and should not be used for any information security or
cryptographic concern. Lessons learned from this cryptanalytic paper are then
outlined in order to be considered in further designs and proposals.
","[{'version': 'v1', 'created': 'Sat, 19 Oct 2019 10:39:25 GMT'}]",2021-06-21,"[['Hanouti', 'Imad El', ''], ['Fadili', 'Hakim El', '']]","['Cryptanalysis', 'Audio data security', 'Chosen plaintext attack', 'Cycle attack', 'DNA encoding', 'Logistic map', 'Key chaining']"
7782,2110.03958,Chao Huang,"Xiaoling Long, Chao Huang, Yong Xu, Huance Xu, Peng Dai, Lianghao Xia,
  Liefeng Bo",Social Recommendation with Self-Supervised Metagraph Informax Network,Published as a full paper in CIKM 2021,,10.1145/3459637.3482480,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, researchers attempt to utilize online social information to
alleviate data sparsity for collaborative filtering, based on the rationale
that social networks offers the insights to understand the behavioral patterns.
However, due to the overlook of inter-dependent knowledge across items (e.g.,
categories of products), existing social recommender systems are insufficient
to distill the heterogeneous collaborative signals from both user and item
sides. In this work, we propose a Self-Supervised Metagraph Infor-max Network
(SMIN) which investigates the potential of jointly incorporating social- and
knowledge-aware relational structures into the user preference representation
for recommendation. To model relation heterogeneity, we design a
metapath-guided heterogeneous graph neural network to aggregate feature
embeddings from different types of meta-relations across users and items,
em-powering SMIN to maintain dedicated representations for multi-faceted user-
and item-wise dependencies. Additionally, to inject high-order collaborative
signals, we generalize the mutual information learning paradigm under the
self-supervised graph-based collaborative filtering. This endows the expressive
modeling of user-item interactive patterns, by exploring global-level
collaborative relations and underlying isomorphic transformation property of
graph topology. Experimental results on several real-world datasets demonstrate
the effectiveness of our SMIN model over various state-of-the-art
recommendation methods. We release our source code at
https://github.com/SocialRecsys/SMIN.
","[{'version': 'v1', 'created': 'Fri, 8 Oct 2021 08:18:37 GMT'}]",2021-10-11,"[['Long', 'Xiaoling', ''], ['Huang', 'Chao', ''], ['Xu', 'Yong', ''], ['Xu', 'Huance', ''], ['Dai', 'Peng', ''], ['Xia', 'Lianghao', ''], ['Bo', 'Liefeng', '']]","['Social Recommendation', 'Graph Neural Networks', 'Self-SupervisedLearning']"
7783,2007.08033,Christian Newman,"Christian D. Newman, Reem S. AlSuhaibani, Michael J. Decker, Anthony
  Peruma, Dishant Kaushik, Mohamed Wiem Mkaouer, Emily Hill","On the Generation, Structure, and Semantics of Grammar Patterns in
  Source Code Identifiers","69 pages, 3 figures, 16 tables","Journal of Systems and Software, 2020, 110740, ISSN 0164-1212",10.1016/j.jss.2020.110740,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Identifiers make up a majority of the text in code. They are one of the most
basic mediums through which developers describe the code they create and
understand the code that others create. Therefore, understanding the patterns
latent in identifier naming practices and how accurately we are able to
automatically model these patterns is vital if researchers are to support
developers and automated analysis approaches in comprehending and creating
identifiers correctly and optimally. This paper investigates identifiers by
studying sequences of part-of-speech annotations, referred to as grammar
patterns. This work advances our understanding of these patterns and our
ability to model them by 1) establishing common naming patterns in different
types of identifiers, such as class and attribute names; 2) analyzing how
different patterns influence comprehension; and 3) studying the accuracy of
state-of-the-art techniques for part-of-speech annotations, which are vital in
automatically modeling identifier naming patterns, in order to establish their
limits and paths toward improvement. To do this, we manually annotate a dataset
of 1,335 identifiers from 20 open-source systems and use this dataset to study
naming patterns, semantics, and tagger accuracy.
","[{'version': 'v1', 'created': 'Wed, 15 Jul 2020 23:10:43 GMT'}]",2020-07-17,"[['Newman', 'Christian D.', ''], ['AlSuhaibani', 'Reem S.', ''], ['Decker', 'Michael J.', ''], ['Peruma', 'Anthony', ''], ['Kaushik', 'Dishant', ''], ['Mkaouer', 'Mohamed Wiem', ''], ['Hill', 'Emily', '']]","['Program Comprehension', 'Identifier Naming', 'Software']"
7784,1801.06552,Jim Hahn,Jim Hahn,"The Bibliotelemetry of Information and Environment: an Evaluation of
  IoT-Powered Recommender Systems","10 pages, 8 figures, 6 tables","Proceedings of the ASIS&T 2018 Annual Meeting, p.151-160",10.1002/pra2.2018.14505501017,,cs.DL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet of Things (IoT) infrastructure within the physical library
environment is the basis for an integrative, hybrid approach to digital
resource recommenders. The IoT infrastructure provides mobile, dynamic
wayfinding support for items in the collection, which includes features for
location-based recommendations. A modular evaluation and analysis herein
clarified the nature of users' requests for recommendations based on their
location and describes subject areas of the library for which users request
recommendations. The modular mobile design allowed for deep exploration of
users' bibliographic identifiers throughout the global module system, serving
to provide context to the browsing data that are the focus of this study.
Bibliotelemetry is introduced as an evaluation method for IoT middleware within
library collections.
","[{'version': 'v1', 'created': 'Fri, 19 Jan 2018 19:04:10 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Feb 2018 04:15:19 GMT'}, {'version': 'v3', 'created': 'Thu, 29 Mar 2018 17:49:48 GMT'}]",2019-02-04,"[['Hahn', 'Jim', '']]","['internet of things', 'IoT', 'bibliographic classification', 'academic libraries']"
7785,2204.08504,Namyong Park,"Namyong Park, Ryan Rossi, Eunyee Koh, Iftikhar Ahamath Burhanuddin,
  Sungchul Kim, Fan Du, Nesreen Ahmed, Christos Faloutsos",CGC: Contrastive Graph Clustering for Community Detection and Tracking,TheWebConf 2022 Research Track,,10.1145/3485447.3512160,,cs.SI cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given entities and their interactions in the web data, which may have
occurred at different time, how can we find communities of entities and track
their evolution? In this paper, we approach this important task from graph
clustering perspective. Recently, state-of-the-art clustering performance in
various domains has been achieved by deep clustering methods. Especially, deep
graph clustering (DGC) methods have successfully extended deep clustering to
graph-structured data by learning node representations and cluster assignments
in a joint optimization framework. Despite some differences in modeling choices
(e.g., encoder architectures), existing DGC methods are mainly based on
autoencoders and use the same clustering objective with relatively minor
adaptations. Also, while many real-world graphs are dynamic, previous DGC
methods considered only static graphs. In this work, we develop CGC, a novel
end-to-end framework for graph clustering, which fundamentally differs from
existing methods. CGC learns node embeddings and cluster assignments in a
contrastive graph learning framework, where positive and negative samples are
carefully selected in a multi-level scheme such that they reflect hierarchical
community structures and network homophily. Also, we extend CGC for
time-evolving data, where temporal graph clustering is performed in an
incremental learning fashion, with the ability to detect change points.
Extensive evaluation on real-world graphs demonstrates that the proposed CGC
consistently outperforms existing methods.
","[{'version': 'v1', 'created': 'Tue, 5 Apr 2022 17:34:47 GMT'}, {'version': 'v2', 'created': 'Sun, 19 Jun 2022 18:36:23 GMT'}]",2022-06-22,"[['Park', 'Namyong', ''], ['Rossi', 'Ryan', ''], ['Koh', 'Eunyee', ''], ['Burhanuddin', 'Iftikhar Ahamath', ''], ['Kim', 'Sungchul', ''], ['Du', 'Fan', ''], ['Ahmed', 'Nesreen', ''], ['Faloutsos', 'Christos', '']]","['community detection and tracking', 'deep graph clustering', 'temporalgraph clustering', 'contrastive learning', 'deep graph learning']"
7786,2209.14591,Mohammad Imrul Jubair,"Mohammad Imrul Jubair, Ali Ahnaf, Tashfiq Nahiyan Khan, Ullash
  Bhattacharjee, Tanjila Joti",PerSign: Personalized Bangladeshi Sign Letters Synthesis,Accepted at ACM UIST 2022 (poster),,10.1145/3526114.3558712,,cs.CV cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Bangladeshi Sign Language (BdSL) - like other sign languages - is tough to
learn for general people, especially when it comes to expressing letters. In
this poster, we propose PerSign, a system that can reproduce a person's image
by introducing sign gestures in it. We make this operation personalized, which
means the generated image keeps the person's initial image profile - face, skin
tone, attire, background - unchanged while altering the hand, palm, and finger
positions appropriately. We use an image-to-image translation technique and
build a corresponding unique dataset to accomplish the task. We believe the
translated image can reduce the communication gap between signers (person who
uses sign language) and non-signers without having prior knowledge of BdSL.
","[{'version': 'v1', 'created': 'Thu, 29 Sep 2022 07:07:34 GMT'}]",2022-09-30,"[['Jubair', 'Mohammad Imrul', ''], ['Ahnaf', 'Ali', ''], ['Khan', 'Tashfiq Nahiyan', ''], ['Bhattacharjee', 'Ullash', ''], ['Joti', 'Tanjila', '']]","['Bangladeshi Sign Language (BdSL)', 'Image-toImage Translation', 'Sign Letters Synthesis']"
7787,2106.13571,Louis Duvivier,Louis Duvivier and R\'emy Cazabet and C\'eline Robardet,Edge based stochastic block model statistical inference,,"Benito R.M., Cherifi C., Cherifi H., Moro E., Rocha L.M.,
  Sales-Pardo M. (eds) Complex Networks & Their Applications IX. COMPLEX
  NETWORKS 2020 2020. Studies in Computational Intelligence, vol 944. Springer,
  Cham",10.1007/978-3-030-65351-4_37,,cs.SI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Community detection in graphs often relies on ad hoc algorithms with no clear
specification about the node partition they define as the best, which leads to
uninterpretable communities. Stochastic block models (SBM) offer a framework to
rigorously define communities, and to detect them using statistical inference
method to distinguish structure from random fluctuations. In this paper, we
introduce an alternative definition of SBM based on edge sampling. We derive
from this definition a quality function to statistically infer the node
partition used to generate a given graph. We then test it on synthetic graphs,
and on the zachary karate club network.
","[{'version': 'v1', 'created': 'Fri, 25 Jun 2021 11:44:17 GMT'}]",2021-06-28,"[['Duvivier', 'Louis', ''], ['Cazabet', 'Rémy', ''], ['Robardet', 'Céline', '']]","['community', 'stochastic block model', 'statistical inference']"
7788,2001.01982,Guido Schillaci,"Guido Schillaci, Antonio Pico Villalpando, Verena Vanessa Hafner,
  Peter Hanappe, David Colliaux, Timoth\'ee Wintz","Intrinsic Motivation and Episodic Memories for Robot Exploration of
  High-Dimensional Sensory Spaces","This manuscript has been submitted for consideration for publication
  in the Adaptive Behaviour Sage Journal, edited by Tom Froese",Adaptive behaviour 2020,10.1177/1059712320922916,,cs.AI cs.LG cs.RO,http://creativecommons.org/licenses/by/4.0/,"  This work presents an architecture that generates curiosity-driven
goal-directed exploration behaviours for an image sensor of a microfarming
robot. A combination of deep neural networks for offline unsupervised learning
of low-dimensional features from images, and of online learning of shallow
neural networks representing the inverse and forward kinematics of the system
have been used. The artificial curiosity system assigns interest values to a
set of pre-defined goals, and drives the exploration towards those that are
expected to maximise the learning progress. We propose the integration of an
episodic memory in intrinsic motivation systems to face catastrophic forgetting
issues, typically experienced when performing online updates of artificial
neural networks. Our results show that adopting an episodic memory system not
only prevents the computational models from quickly forgetting knowledge that
has been previously acquired, but also provides new avenues for modulating the
balance between plasticity and stability of the models.
","[{'version': 'v1', 'created': 'Tue, 7 Jan 2020 11:39:20 GMT'}]",2020-06-09,"[['Schillaci', 'Guido', ''], ['Villalpando', 'Antonio Pico', ''], ['Hafner', 'Verena Vanessa', ''], ['Hanappe', 'Peter', ''], ['Colliaux', 'David', ''], ['Wintz', 'Timothée', '']]","['Adaptive models', 'predictive models', 'episodic memory', 'memory consolidation', 'intrinsic motivation', 'robotics']"
7789,2109.05773,Jin Chen,"Jin Chen, Defu Lian, Binbin Jin, Xu Huang, Kai Zheng, Enhong Chen","Fast Variational AutoEncoder with Inverted Multi-Index for Collaborative
  Filtering","11 pages, WWW 2022",,10.1145/3485447.3512068,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Variational AutoEncoder (VAE) has been extended as a representative nonlinear
method for collaborative filtering. However, the bottleneck of VAE lies in the
softmax computation over all items, such that it takes linear costs in the
number of items to compute the loss and gradient for optimization. This hinders
the practical use due to millions of items in real-world scenarios. Importance
sampling is an effective approximation method, based on which the sampled
softmax has been derived. However, existing methods usually exploit the uniform
or popularity sampler as proposal distributions, leading to a large bias of
gradient estimation. To this end, we propose to decompose the
inner-product-based softmax probability based on the inverted multi-index,
leading to sublinear-time and highly accurate sampling. Based on the proposed
proposals, we develop a fast Variational AutoEncoder (FastVAE) for
collaborative filtering. FastVAE can outperform the state-of-the-art baselines
in terms of both sampling quality and efficiency according to the experiments
on three real-world datasets.
","[{'version': 'v1', 'created': 'Mon, 13 Sep 2021 08:31:59 GMT'}, {'version': 'v2', 'created': 'Mon, 30 May 2022 07:45:34 GMT'}]",2022-05-31,"[['Chen', 'Jin', ''], ['Lian', 'Defu', ''], ['Jin', 'Binbin', ''], ['Huang', 'Xu', ''], ['Zheng', 'Kai', ''], ['Chen', 'Enhong', '']]","['Sampling', 'Inverted Multi-Index', 'Recommender Systems', 'VariationalAutoEncoder', 'Collaborative Filtering']"
7790,2301.08802,Christian Schmidt,Christian Schmidt and Heinrich Martin Overhoff,"Impact of PCA-based preprocessing and different CNN structures on
  deformable registration of sonograms","8 pages, 7 figures Presented at WSCG 2022","Computer Science Research Notes , CSRN 3201, 2022",10.24132/CSRN.3201.23,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Central venous catheters (CVC) are commonly inserted into the large veins of
the neck, e.g. the internal jugular vein (IJV). CVC insertion may cause serious
complications like misplacement into an artery or perforation of cervical
vessels. Placing a CVC under sonographic guidance is an appropriate method to
reduce such adverse events, if anatomical landmarks like venous and arterial
vessels can be detected reliably. This task shall be solved by registration of
patient individual images vs. an anatomically labelled reference image. In this
work, a linear, affine transformation is performed on cervical sonograms,
followed by a non-linear transformation to achieve a more precise registration.
Voxelmorph (VM), a learning-based library for deformable image registration
using a convolutional neural network (CNN) with U-Net structure was used for
non-linear transformation. The impact of principal component analysis
(PCA)-based pre-denoising of patient individual images, as well as the impact
of modified net structures with differing complexities on registration results
were examined visually and quantitatively, the latter using metrics for
deformation and image similarity. Using the PCA-approximated cervical sonograms
resulted in decreased mean deformation lengths between 18% and 66% compared to
their original image counterparts, depending on net structure. In addition,
reducing the number of convolutional layers led to improved image similarity
with PCA images, while worsening in original images. Despite a large reduction
of network parameters, no overall decrease in registration quality was
observed, leading to the conclusion that the original net structure is
oversized for the task at hand.
","[{'version': 'v1', 'created': 'Fri, 20 Jan 2023 21:01:39 GMT'}]",2023-01-24,"[['Schmidt', 'Christian', ''], ['Overhoff', 'Heinrich Martin', '']]","['Medical image registration', 'deformable registration', 'sonograms', 'Voxelmorph', 'CNN']"
7791,1906.09822,Mark Levene,"Mark Levene, Trevor Fenner and Judit Bar-Ilan",Characterisation of the $\chi$-index and the $rec$-index,"14 pages, 3 figures. This is a pre-print of an article published in
  Scientometrics. The final authenticated version is available online at:
  https://doi.org/10.1007/s11192-019-03151-7",,10.1007/s11192-019-03151-7,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Axiomatic characterisation of a bibliometric index provides insight into the
properties that the index satisfies and facilitates the comparison of different
indices. A geometric generalisation of the $h$-index, called the $\chi$-index,
has recently been proposed to address some of the problems with the $h$-index,
in particular, the fact that it is not scale invariant, i.e., multiplying the
number of citations of each publication by a positive constant may change the
relative ranking of two researchers. While the square of the $h$-index is the
area of the largest square under the citation curve of a researcher, the square
of the $\chi$-index, which we call the $rec$-index (or {\em rectangle}-index),
is the area of the largest rectangle under the citation curve. Our main
contribution here is to provide a characterisation of the $rec$-index via three
properties: {\em monotonicity}, {\em uniform citation} and {\em uniform
equivalence}. Monotonicity is a natural property that we would expect any
bibliometric index to satisfy, while the other two properties constrain the
value of the $rec$-index to be the area of the largest rectangle under the
citation curve. The $rec$-index also allows us to distinguish between {\em
influential} researchers who have relatively few, but highly-cited,
publications and {\em prolific} researchers who have many, but less-cited,
publications.
","[{'version': 'v1', 'created': 'Mon, 24 Jun 2019 09:59:38 GMT'}]",2019-06-25,"[['Levene', 'Mark', ''], ['Fenner', 'Trevor', ''], ['Bar-Ilan', 'Judit', '']]","['h-index', 'χ-index', 'rec-index', 'bibliometric index', 'core publications', 'quantity versusquality', 'axiomatic characterisation']"
7792,1805.02900,Long Chen,Long Chen and Jigang Wu and Gangqiang Zhou and Longjie Ma,"QUICK: QoS-guaranteed Efficient Cloudlet Placement in Wireless
  Metropolitan Area Networks","22 pages, 11 figures, 3 tables, Accepted by The Journal of
  Supercomputing",,10.1007/s11227-018-2412-8,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article defines the QoS-guaranteed efficient cloudlet deploy problem in
wireless metropolitan area network, which aims to minimize the average access
delay of mobile users i.e. the average delay when service requests are
successfully sent and being served by cloudlets. Meanwhile, we try to optimize
total deploy cost represented by the total number of deployed cloudlets. For
the first target, both un-designated capacity and constrained capacity cases
are studied, and we have designed efficient heuristic and clustering algorithms
respectively. We show our algorithms are more efficient than the existing
algorithm. For the second target, we formulate an integer linear programming to
minimize the number of used cloudlets with given average access delay
requirement. A clustering algorithm is devised to guarantee the scalability.
For a special case of the deploy cost optimization problem where all cloudlets'
computing capabilities have been given, i.e., designated capacity, a minimal
cloudlets efficient heuristic algorithm is further proposed. We finally
evaluate the performance of proposed algorithms through extensive experimental
simulations. Simulation results demonstrate the proposed algorithms are more
than 46% efficient than existing algorithms on the average cloudlet access
delay. Compared with existing algorithms, our proposed clustering and heuristic
algorithms can reduce the number of deployed cloudlets by about 50% averagely.
","[{'version': 'v1', 'created': 'Tue, 8 May 2018 08:45:07 GMT'}]",2018-05-09,"[['Chen', 'Long', ''], ['Wu', 'Jigang', ''], ['Zhou', 'Gangqiang', ''], ['Ma', 'Longjie', '']]","['Cloudlet', 'Access delay', 'Cloud computing', 'Heuristic', 'Clustering']"
7793,2103.02280,Sean MacAvaney,"Sean MacAvaney, Andrew Yates, Sergey Feldman, Doug Downey, Arman
  Cohan, Nazli Goharian",Simplified Data Wrangling with ir_datasets,SIGIR 2021 Resource,,10.1145/3404835.3463254,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Managing the data for Information Retrieval (IR) experiments can be
challenging. Dataset documentation is scattered across the Internet and once
one obtains a copy of the data, there are numerous different data formats to
work with. Even basic formats can have subtle dataset-specific nuances that
need to be considered for proper use. To help mitigate these challenges, we
introduce a new robust and lightweight tool (ir_datasets) for acquiring,
managing, and performing typical operations over datasets used in IR. We
primarily focus on textual datasets used for ad-hoc search. This tool provides
both a Python and command line interface to numerous IR datasets and
benchmarks. To our knowledge, this is the most extensive tool of its kind.
Integrations with popular IR indexing and experimentation toolkits demonstrate
the tool's utility. We also provide documentation of these datasets through the
ir_datasets catalog: https://ir-datasets.com/. The catalog acts as a hub for
information on datasets used in IR, providing core information about what data
each benchmark provides as well as links to more detailed information. We
welcome community contributions and intend to continue to maintain and grow
this tool.
","[{'version': 'v1', 'created': 'Wed, 3 Mar 2021 09:38:36 GMT'}, {'version': 'v2', 'created': 'Mon, 10 May 2021 13:13:47 GMT'}]",2021-05-11,"[['MacAvaney', 'Sean', ''], ['Yates', 'Andrew', ''], ['Feldman', 'Sergey', ''], ['Downey', 'Doug', ''], ['Cohan', 'Arman', ''], ['Goharian', 'Nazli', '']]","['information retrieval', 'datasets', 'benchmarks']"
7794,2204.12326,Minghao Zhao,"Minghao Zhao, Le Wu, Yile Liang, Lei Chen, Jian Zhang, Qilin Deng, Kai
  Wang, Xudong Shen, Tangjie Lv, Runze Wu","Investigating Accuracy-Novelty Performance for Graph-based Collaborative
  Filtering",To appear in SIGIR 2022,,10.1145/3477495.3532005,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent years have witnessed the great accuracy performance of graph-based
Collaborative Filtering (CF) models for recommender systems. By taking the
user-item interaction behavior as a graph, these graph-based CF models borrow
the success of Graph Neural Networks (GNN), and iteratively perform
neighborhood aggregation to propagate the collaborative signals. While
conventional CF models are known for facing the challenges of the popularity
bias that favors popular items, one may wonder ""Whether the existing
graph-based CF models alleviate or exacerbate popularity bias of recommender
systems?"" To answer this question, we first investigate the two-fold
performances w.r.t. accuracy and novelty for existing graph-based CF methods.
The empirical results show that symmetric neighborhood aggregation adopted by
most existing graph-based CF models exacerbate the popularity bias and this
phenomenon becomes more serious as the depth of graph propagation increases.
Further, we theoretically analyze the cause of popularity bias for graph-based
CF. Then, we propose a simple yet effective plugin, namely r-AdjNorm, to
achieve an accuracy-novelty trade-off by controlling the normalization strength
in the neighborhood aggregation process. Meanwhile, r-AdjNorm can be smoothly
applied to the existing graph-based CF backbones without additional
computation. Finally, experimental results on three benchmark datasets show
that our proposed method can improve novelty without sacrificing accuracy under
various graph-based CF backbones.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2022 14:09:29 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Apr 2022 15:36:26 GMT'}]",2022-04-28,"[['Zhao', 'Minghao', ''], ['Wu', 'Le', ''], ['Liang', 'Yile', ''], ['Chen', 'Lei', ''], ['Zhang', 'Jian', ''], ['Deng', 'Qilin', ''], ['Wang', 'Kai', ''], ['Shen', 'Xudong', ''], ['Lv', 'Tangjie', ''], ['Wu', 'Runze', '']]","['Collaborative Filtering', 'Graph Neural Networks', 'Accuracy-NoveltyTrade-off', 'Popularity Bias']"
7795,1904.08802,Tobias Kapp\'e,"Gerco van Heerdt, Tobias Kapp\'e, Jurriaan Rot, Matteo Sammartino,
  Alexandra Silva",Tree Automata as Algebras: Minimisation and Determinisation,,,10.4230/LIPIcs.CALCO.2019.6,,cs.FL,http://creativecommons.org/licenses/by/4.0/,"  We study a categorical generalisation of tree automata, as $\Sigma$-algebras
for a fixed endofunctor $\Sigma$ endowed with initial and final states. Under
mild assumptions about the base category, we present a general minimisation
algorithm for these automata. We then build upon and extend an existing
generalisation of the Nerode equivalence to a categorical setting and relate it
to the existence of minimal automata. Finally, we show that generalised types
of side-effects, such as non-determinism, can be captured by this categorical
framework, leading to a general determinisation procedure.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2019 14:23:34 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Jul 2019 10:09:01 GMT'}]",2019-12-11,"[['van Heerdt', 'Gerco', ''], ['Kappé', 'Tobias', ''], ['Rot', 'Jurriaan', ''], ['Sammartino', 'Matteo', ''], ['Silva', 'Alexandra', '']]","['tree automata', 'algebras', 'minimisation', 'determinisation', 'Nerode equivalence']"
7796,2110.15708,Matthias Samwald,"Kathrin Blagec, Hong Xu, Asan Agibetov, Matthias Samwald","Neural sentence embedding models for semantic similarity estimation in
  the biomedical domain",Abstract shortened to comply with arXiv guidelines,BMC Bioinformatics (2019),10.1186/s12859-019-2789-2,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  BACKGROUND: In this study, we investigated the efficacy of current
state-of-the-art neural sentence embedding models for semantic similarity
estimation of sentences from biomedical literature. We trained different neural
embedding models on 1.7 million articles from the PubMed Open Access dataset,
and evaluated them based on a biomedical benchmark set containing 100 sentence
pairs annotated by human experts and a smaller contradiction subset derived
from the original benchmark set.
  RESULTS: With a Pearson correlation of 0.819, our best unsupervised model
based on the Paragraph Vector Distributed Memory algorithm outperforms previous
state-of-the-art results achieved on the BIOSSES biomedical benchmark set.
Moreover, our proposed supervised model that combines different string-based
similarity metrics with a neural embedding model surpasses previous
ontology-dependent supervised state-of-the-art approaches in terms of Pearson's
r (r=0.871) on the biomedical benchmark set. In contrast to the promising
results for the original benchmark, we found our best models' performance on
the smaller contradiction subset to be poor.
  CONCLUSIONS: In this study we highlighted the value of neural network-based
models for semantic similarity estimation in the biomedical domain by showing
that they can keep up with and even surpass previous state-of-the-art
approaches for semantic similarity estimation that depend on the availability
of laboriously curated ontologies when evaluated on a biomedical benchmark set.
Capturing contradictions and negations in biomedical sentences, however,
emerged as an essential area for further work.
","[{'version': 'v1', 'created': 'Fri, 1 Oct 2021 13:27:44 GMT'}]",2021-11-01,"[['Blagec', 'Kathrin', ''], ['Xu', 'Hong', ''], ['Agibetov', 'Asan', ''], ['Samwald', 'Matthias', '']]","['Natural language processing', 'Semantics', 'Neural embedding models']"
7797,2003.04480,Essam Rashed,Essam A. Rashed and M. Samir Abou El Seoud,Deep learning approach for breast cancer diagnosis,,"ICSIE '19: Proceedings of the 2019 8th International Conference on
  Software and Information Engineering",10.1145/3328833.3328867,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Breast cancer is one of the leading fatal disease worldwide with high risk
control if early discovered. Conventional method for breast screening is x-ray
mammography, which is known to be challenging for early detection of cancer
lesions. The dense breast structure produced due to the compression process
during imaging lead to difficulties to recognize small size abnormalities.
Also, inter- and intra-variations of breast tissues lead to significant
difficulties to achieve high diagnosis accuracy using hand-crafted features.
Deep learning is an emerging machine learning technology that requires a
relatively high computation power. Yet, it proved to be very effective in
several difficult tasks that requires decision making at the level of human
intelligence. In this paper, we develop a new network architecture inspired by
the U-net structure that can be used for effective and early detection of
breast cancer. Results indicate a high rate of sensitivity and specificity that
indicate potential usefulness of the proposed approach in clinical use.
","[{'version': 'v1', 'created': 'Tue, 10 Mar 2020 00:47:37 GMT'}]",2020-03-11,"[['Rashed', 'Essam A.', ''], ['Seoud', 'M. Samir Abou El', '']]","['Deep learning', 'Convolution neural networks', 'Breast cancer diagnosis']"
7798,2007.13635,Anton Razzhigaev,"Anton Razzhigaev, Klim Kireev, Edgar Kaziakhmedov, Nurislam Tursynbek,
  and Aleksandr Petiushko",Black-Box Face Recovery from Identity Features,,ECCV Workshops (5) 2020: 462-475,10.1007/978-3-030-68238-5_34,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we present a novel algorithm based on an it-erative sampling of
random Gaussian blobs for black-box face recovery, given only an output feature
vector of deep face recognition systems. We attack the state-of-the-art face
recognition system (ArcFace) to test our algorithm. Another network with
different architecture (FaceNet) is used as an independent critic showing that
the target person can be identified with the reconstructed image even with no
access to the attacked model. Furthermore, our algorithm requires a
significantly less number of queries compared to the state-of-the-art solution.
","[{'version': 'v1', 'created': 'Mon, 27 Jul 2020 15:25:38 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Jul 2020 09:32:17 GMT'}, {'version': 'v3', 'created': 'Thu, 30 Jul 2020 13:24:39 GMT'}]",2021-02-10,"[['Razzhigaev', 'Anton', ''], ['Kireev', 'Klim', ''], ['Kaziakhmedov', 'Edgar', ''], ['Tursynbek', 'Nurislam', ''], ['Petiushko', 'Aleksandr', '']]","['security', 'privacy', 'black-box', 'arcface', 'face recognition']"
7799,2112.00355,Masahiro Suzuki,Masahiro Suzuki,"Score Transformer: Generating Musical Score from Note-level
  Representation","Accepted at ACM Multimedia Asia 2021 (MMAsia '21); Project page:
  https://score-transformer.github.io/",,10.1145/3469877.3490612,,cs.SD cs.LG cs.MM eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we explore the tokenized representation of musical scores
using the Transformer model to automatically generate musical scores. Thus far,
sequence models have yielded fruitful results with note-level (MIDI-equivalent)
symbolic representations of music. Although the note-level representations can
comprise sufficient information to reproduce music aurally, they cannot contain
adequate information to represent music visually in terms of notation. Musical
scores contain various musical symbols (e.g., clef, key signature, and notes)
and attributes (e.g., stem direction, beam, and tie) that enable us to visually
comprehend musical content. However, automated estimation of these elements has
yet to be comprehensively addressed. In this paper, we first design score token
representation corresponding to the various musical elements. We then train the
Transformer model to transcribe note-level representation into appropriate
music notation. Evaluations of popular piano scores show that the proposed
method significantly outperforms existing methods on all 12 musical aspects
that were investigated. We also explore an effective notation-level token
representation to work with the model and determine that our proposed
representation produces the steadiest results.
","[{'version': 'v1', 'created': 'Wed, 1 Dec 2021 09:08:01 GMT'}]",2021-12-02,"[['Suzuki', 'Masahiro', '']]","['symbolic music representation', 'music transcription', 'musical scoregeneration', 'transformers']"
7800,2109.13722,Konrad Kollnig,"Konrad Kollnig, Anastasia Shuba, Reuben Binns, Max Van Kleek, Nigel
  Shadbolt","Are iPhones Really Better for Privacy? Comparative Study of iOS and
  Android Apps","Accepted for publication by the Proceedings on Privacy Enhancing
  Technologies (PoPETs) 2022",,10.2478/popets-2022-0033,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While many studies have looked at privacy properties of the Android and
Google Play app ecosystem, comparatively much less is known about iOS and the
Apple App Store, the most widely used ecosystem in the US. At the same time,
there is increasing competition around privacy between these smartphone
operating system providers. In this paper, we present a study of 24k Android
and iOS apps from 2020 along several dimensions relating to user privacy. We
find that third-party tracking and the sharing of unique user identifiers was
widespread in apps from both ecosystems, even in apps aimed at children. In the
children's category, iOS apps tended to use fewer advertising-related tracking
than their Android counterparts, but could more often access children's
location. Across all studied apps, our study highlights widespread potential
violations of US, EU and UK privacy law, including 1) the use of third-party
tracking without user consent, 2) the lack of parental consent before sharing
personally identifiable information (PII) with third-parties in children's
apps, 3) the non-data-minimising configuration of tracking libraries, 4) the
sending of personal data to countries without an adequate level of data
protection, and 5) the continued absence of transparency around tracking,
partly due to design decisions by Apple and Google. Overall, we find that
neither platform is clearly better than the other for privacy across the
dimensions we studied.
","[{'version': 'v1', 'created': 'Tue, 28 Sep 2021 13:40:32 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Dec 2021 20:59:22 GMT'}, {'version': 'v3', 'created': 'Wed, 15 Dec 2021 12:08:05 GMT'}, {'version': 'v4', 'created': 'Sun, 19 Dec 2021 20:31:20 GMT'}]",2022-12-20,"[['Kollnig', 'Konrad', ''], ['Shuba', 'Anastasia', ''], ['Binns', 'Reuben', ''], ['Van Kleek', 'Max', ''], ['Shadbolt', 'Nigel', '']]","['privacy', 'apps', 'Android', 'iOS', 'Apple', 'Google']"
7801,1803.09226,Farid Feyzi,"Farid Feyzi, Saeed Parsa","Kernel-based Detection of Coincidentally Correct Test Cases to Improve
  Fault Localization Effectiveness","International Journal of Applied Pattern Recognition, 2018",,10.1504/IJAPR.2018.092520,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although empirical studies have confirmed the effectiveness of spectrum-based
fault localization (SBFL) techniques, their performance may be degraded due to
presence of some undesired circumstances such as the existence of coincidental
correctness (CC) where one or more passing test cases exercise a faulty
statement and thus causing some confusion to decide whether the underlying
exercised statement is faulty or not. This article aims at improving SBFL
effectiveness by mitigating the effect of CC test cases. In this regard, a new
method is proposed that uses a support vector machine (SVM) with a customized
kernel function. To build the kernel function, we applied a new
sequence-matching algorithm that measures the similarities between passing and
failing executions. We conducted some experiments to assess the proposed
method. The results show that our method can effectively improve the
performance of SBFL techniques.
","[{'version': 'v1', 'created': 'Sun, 25 Mar 2018 10:11:30 GMT'}]",2018-07-06,"[['Feyzi', 'Farid', ''], ['Parsa', 'Saeed', '']]","['coincidental correctness', 'support vector machine', 'Spectrum based fault localization', 'kernel function']"
7802,1401.2416,Odemir Bruno PhD,"Lucas Assirati, Alexandre Souto Martinez, Odemir Martinez Bruno","Satellite image classification and segmentation using non-additive
  entropy","4 pages, 5 figures, ICMSquare 2013",,10.1088/1742-6596/490/1/012086,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Here we compare the Boltzmann-Gibbs-Shannon (standard) with the Tsallis
entropy on the pattern recognition and segmentation of coloured images obtained
by satellites, via ""Google Earth"". By segmentation we mean split an image to
locate regions of interest. Here, we discriminate and define an image partition
classes according to a training basis. This training basis consists of three
pattern classes: aquatic, urban and vegetation regions. Our numerical
experiments demonstrate that the Tsallis entropy, used as a feature vector
composed of distinct entropic indexes $q$ outperforms the standard entropy.
There are several applications of our proposed methodology, once satellite
images can be used to monitor migration form rural to urban regions,
agricultural activities, oil spreading on the ocean etc.
","[{'version': 'v1', 'created': 'Fri, 10 Jan 2014 17:57:16 GMT'}]",2015-06-18,"[['Assirati', 'Lucas', ''], ['Martinez', 'Alexandre Souto', ''], ['Bruno', 'Odemir Martinez', '']]","['Entropy', 'Segmentation', 'Satellite images']"
7803,2012.15291,Lorenzo Clemente,Lorenzo Clemente and S{\l}awomir Lasota,Reachability relations of timed pushdown automata,Author's version of JCSS article,"Journal of Computer and System Sciences, Volume 117, May 2021,
  Pages 202-241",10.1016/j.jcss.2020.11.003,,cs.FL cs.LO,http://creativecommons.org/licenses/by/4.0/,"  Timed pushdown automata (TPDA) are an expressive formalism combining
recursion with a rich logic of timing constraints. We prove that reachability
relations of TPDA are expressible in linear arithmetic, a rich logic
generalising Presburger arithmetic and rational arithmetic. The main technical
ingredients are a novel quantifier elimination result for clock constraints
(used to simplify the syntax of TPDA transitions), the use of clock difference
relations to express reachability relations of the fractional clock values, and
an application of Parikh's theorem to reconstruct the integral clock values.
","[{'version': 'v1', 'created': 'Wed, 30 Dec 2020 19:09:54 GMT'}]",2021-01-01,"[['Clemente', 'Lorenzo', ''], ['Lasota', 'Sławomir', '']]","['Timed automata', 'timed pushdown automata', 'reachability relation', 'clock difference relations', 'quantifier elimination']"
7804,1909.03231,Tiziano De Matteis,"Tiziano De Matteis, Johannes de Fine Licht, Jakub Ber\'anek and
  Torsten Hoefler","Streaming Message Interface: High-Performance Distributed Memory
  Programming on Reconfigurable Hardware",,,10.1145/3295500.3356201,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed memory programming is the established paradigm used in
high-performance computing (HPC) systems, requiring explicit communication
between nodes and devices. When FPGAs are deployed in distributed settings,
communication is typically handled either by going through the host machine,
sacrificing performance, or by streaming across fixed device-to-device
connections, sacrificing flexibility. We present Streaming Message Interface
(SMI), a communication model and API that unifies explicit message passing with
a hardware-oriented programming model, facilitating minimal-overhead, flexible,
and productive inter-FPGA communication. Instead of bulk transmission, messages
are streamed across the network during computation, allowing communication to
be seamlessly integrated into pipelined designs. We present a high-level
synthesis implementation of SMI targeting a dedicated FPGA interconnect,
exposing runtime-configurable routing with support for arbitrary network
topologies, and implement a set of distributed memory benchmarks. Using SMI,
programmers can implement distributed, scalable HPC programs on reconfigurable
hardware, without deviating from best practices for hardware design.
","[{'version': 'v1', 'created': 'Sat, 7 Sep 2019 09:53:54 GMT'}]",2020-08-07,"[['De Matteis', 'Tiziano', ''], ['Licht', 'Johannes de Fine', ''], ['Beránek', 'Jakub', ''], ['Hoefler', 'Torsten', '']]","['Distributed Memory Programming', 'Reconfigurable computing', 'HighLevel Synthesis Tools']"
7805,1912.11146,Evangelos Papapetrou,Evangelos Papapetrou and Aristidis Likas,"A Replication Strategy for Mobile Opportunistic Networks based on
  Utility Clustering","16 pages, 17 figures, 1 table. Ad Hoc Networks (2021)",,10.1016/j.adhoc.2021.102738,,cs.NI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dynamic replication is a wide-spread multi-copy routing approach for
efficiently coping with the intermittent connectivity in mobile opportunistic
networks. According to it, a node forwards a message replica to an encountered
node based on a utility value that captures the latter's fitness for delivering
the message to the destination. The popularity of the approach stems from its
flexibility to effectively operate in networks with diverse characteristics
without requiring special customization. Nonetheless, its drawback is the
tendency to produce a high number of replicas that consume limited resources
such as energy and storage. To tackle the problem we make the observation that
network nodes can be grouped, based on their utility values, into clusters that
portray different delivery capabilities. We exploit this finding to transform
the basic forwarding strategy, which is to move a packet using nodes of
increasing utility, and actually forward it through clusters of increasing
delivery capability. The new strategy works in synergy with the basic dynamic
replication algorithms and is fully configurable, in the sense that it can be
used with virtually any utility function. We also extend our approach to work
with two utility functions at the same time, a feature that is especially
efficient in mobile networks that exhibit social characteristics. By conducting
experiments in a wide set of real-life networks, we empirically show that our
method is robust in reducing the overall number of replicas in networks with
diverse connectivity characteristics without at the same time hindering
delivery efficiency.
","[{'version': 'v1', 'created': 'Mon, 23 Dec 2019 23:46:54 GMT'}, {'version': 'v2', 'created': 'Sun, 14 Nov 2021 13:43:18 GMT'}]",2021-11-16,"[['Papapetrou', 'Evangelos', ''], ['Likas', 'Aristidis', '']]","['opportunistic networks', 'delay-tolerant networks', 'mobile social networks', 'cluster-based routing']"
7806,2010.14640,Peter Organisciak,"Peter Organisciak, Maggie Ryan",Improving Text Relationship Modeling with Artificial Data,"9 pages, 3 figures",Journal of Information Science 2022,10.1177/01655515221093031,,cs.DL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data augmentation uses artificially-created examples to support supervised
machine learning, adding robustness to the resulting models and helping to
account for limited availability of labelled data. We apply and evaluate a
synthetic data approach to relationship classification in digital libraries,
generating artificial books with relationships that are common in digital
libraries but not easier inferred from existing metadata. We find that for
classification on whole-part relationships between books, synthetic data
improves a deep neural network classifier by 91%. Further, we consider the
ability of synthetic data to learn a useful new text relationship class from
fully artificial training data.
","[{'version': 'v1', 'created': 'Tue, 27 Oct 2020 22:04:54 GMT'}]",2022-08-25,"[['Organisciak', 'Peter', ''], ['Ryan', 'Maggie', '']]","['digital libraries', 'machine learning', 'data augmentation']"
7807,2211.03716,Arash Pourdamghani,"Monika Henzinger, Ami Paz, Arash Pourdamghani, Stefan Schmid",The Augmentation-Speed Tradeoff for Consistent Network Updates,,,10.1145/3563647.3563655,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Emerging software-defined networking technologies enable more adaptive
communication infrastructures, allowing for quick reactions to changes in
networking requirements by exploiting the workload's temporal structure.
However, operating networks adaptively is algorithmically challenging, as
meeting networks' stringent dependability requirements relies on maintaining
basic consistency and performance properties, such as loop freedom and
congestion minimization, even during the update process. This paper leverages
an augmentation-speed tradeoff to significantly speed up consistent network
updates. We show that allowing for a small and short (hence practically
tolerable, e.g., using buffering) oversubscription of links allows us to solve
many network update instances much faster, as well as to reduce computational
complexities (i.e., the running times of the algorithms). We first explore this
tradeoff formally, revealing the computational complexity of scheduling
updates. We then present and analyze algorithms that maintain logical and
performance properties during the update. Using an extensive simulation study,
we find that the tradeoff is even more favorable in practice than our
analytical bounds suggest. In particular, we find that by allowing just 10%
augmentation, update times reduce by more than 32% on average, across a
spectrum of real-world networks.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2022 17:40:58 GMT'}]",2022-11-08,"[['Henzinger', 'Monika', ''], ['Paz', 'Ami', ''], ['Pourdamghani', 'Arash', ''], ['Schmid', 'Stefan', '']]","['Software-defined networking', 'network algorithms', 'scheduling']"
7808,1905.06464,Jasper Sebastiaan Wijnands,"Jasper S. Wijnands, Kerry A. Nice, Jason Thompson, Haifeng Zhao, Mark
  Stevenson","Streetscape augmentation using generative adversarial networks: insights
  related to health and wellbeing","20 pages, 8 figures. Preprint accepted for publication in Sustainable
  Cities and Society",,10.1016/j.scs.2019.101602,,cs.CY cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning using neural networks has provided advances in image style
transfer, merging the content of one image (e.g., a photo) with the style of
another (e.g., a painting). Our research shows this concept can be extended to
analyse the design of streetscapes in relation to health and wellbeing
outcomes. An Australian population health survey (n=34,000) was used to
identify the spatial distribution of health and wellbeing outcomes, including
general health and social capital. For each outcome, the most and least
desirable locations formed two domains. Streetscape design was sampled using
around 80,000 Google Street View images per domain. Generative adversarial
networks translated these images from one domain to the other, preserving the
main structure of the input image, but transforming the `style' from locations
where self-reported health was bad to locations where it was good. These
translations indicate that areas in Melbourne with good general health are
characterised by sufficient green space and compactness of the urban
environment, whilst streetscape imagery related to high social capital
contained more and wider footpaths, fewer fences and more grass. Beyond
identifying relationships, the method is a first step towards
computer-generated design interventions that have the potential to improve
population health and wellbeing.
","[{'version': 'v1', 'created': 'Tue, 14 May 2019 03:13:15 GMT'}]",2019-05-17,"[['Wijnands', 'Jasper S.', ''], ['Nice', 'Kerry A.', ''], ['Thompson', 'Jason', ''], ['Zhao', 'Haifeng', ''], ['Stevenson', 'Mark', '']]","['generative adversarial network', 'style transfer', 'design', 'street view', 'health', 'wellbeing']"
7809,2101.12038,Kostas Karpouzis,Dimitris Kritikos and Kostas Karpouzis,"From pixels to notes: a computational implementation of synaesthesia for
  cultural artefacts","AVI2CH 2020: Workshop on Advanced Visual Interfaces and Interactions
  in Cultural Heritage, Ischia, Italy - Sept 28-October 2, 2020",,10.1145/3399715.3400869,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Synaesthesia is a condition that enables people to sense information in the
form of several senses at once. This work describes a Python implementation of
a simulation of synaesthesia between listening to music and viewing a painting.
Based on Scriabin's definition, we developed a deterministic process to produce
a melody after processing a painting, mimicking the production of notes from
colours in the field of view of persons experiencing synaesthesia.
","[{'version': 'v1', 'created': 'Wed, 27 Jan 2021 10:42:20 GMT'}]",2021-01-29,"[['Kritikos', 'Dimitris', ''], ['Karpouzis', 'Kostas', '']]","['cultural experiences', 'synaesthesia', 'painting', 'music', 'multimediaexperience']"
7810,2209.03690,Chengzhi Zhang,"Chenglei Qin, Chengzhi Zhang, Yi Bu","Exploring the Distribution Regularities of User Attention and Sentiment
  toward Product Aspects in Online Reviews",,,10.1108/EL-11-2020-0324,,cs.CL cs.IR,http://creativecommons.org/licenses/by/4.0/,"  [Purpose] To better understand the online reviews and help potential
consumers, businessmen, and product manufacturers effectively obtain users'
evaluation on product aspects, this paper explores the distribution
regularities of user attention and sentiment toward product aspects from the
temporal perspective of online reviews. [Design/methodology/approach] Temporal
characteristics of online reviews (purchase time, review time, and time
intervals between purchase time and review time), similar attributes
clustering, and attribute-level sentiment computing technologies are employed
based on more than 340k smartphone reviews of three products from JD.COM (a
famous online shopping platform in China) to explore the distribution
regularities of user attention and sentiment toward product aspects in this
article. [Findings] The empirical results show that a power-law distribution
can fit user attention to product aspects, and the reviews posted in short time
intervals contain more product aspects. Besides, the results show that the
values of user sentiment of product aspects are significantly higher/lower in
short time intervals which contribute to judging the advantages and weaknesses
of a product. [Research limitations] The paper can't acquire online reviews for
more products with temporal characteristics to verify the findings because of
the restriction on reviews crawling by the shopping platforms.
[Originality/value] This work reveals the distribution regularities of user
attention and sentiment toward product aspects, which is of great significance
in assisting decision-making, optimizing review presentation, and improving the
shopping experience.
","[{'version': 'v1', 'created': 'Thu, 8 Sep 2022 10:23:16 GMT'}]",2022-09-09,"[['Qin', 'Chenglei', ''], ['Zhang', 'Chengzhi', ''], ['Bu', 'Yi', '']]","['Reviews mining', 'Sentiment analysis', 'Distribution regularities', 'Temporal characteristics Paper type Research paper']"
7811,2205.08852,Tanjila Mawla,"Tanjila Mawla, Maanak Gupta, and Ravi Sandhu","BlueSky: Activity Control: A Vision for ""Active"" Security Models for
  Smart Collaborative Systems",,,10.1145/3532105.3535017,,cs.CR cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  Cyber physical ecosystem connects different intelligent devices over
heterogeneous networks. Various operations are performed on smart objects to
ensure efficiency and to support automation in smart environments. An Activity
(defined by Gupta and Sandhu) reflects the current state of an object, which
changes in response to requested operations. Due to multiple running activities
on different objects, it is critical to secure collaborative systems
considering run-time decisions impacted due to related activities (and other
parameters) supporting active enforcement of access control decision. Recently,
Gupta and Sandhu proposed Activity-Centric Access Control (ACAC) and discussed
the notion of activity as a prime abstraction for access control in
collaborative systems. The model provides an active security approach that
considers activity decision factors such as authorizations, obligations,
conditions, and dependencies among related device activities. This paper takes
a step forward and presents the core components of an ACAC model and compares
with other security models differentiating novel properties of ACAC. We
highlight how existing models do not (or in limited scope) support `active'
decision and enforcement of authorization in collaborative systems. We propose
a hierarchical structure for a family of ACAC models by gradually adding the
properties related to notion of activity and discuss states of an activity. We
highlight the convergence of ACAC with Zero Trust tenets to reflect how ACAC
supports necessary security posture of distributed and connected smart
ecosystems. This paper aims to gain a better understanding of ACAC in
collaborative systems supporting novel abstractions, properties and
requirements.
","[{'version': 'v1', 'created': 'Wed, 18 May 2022 10:34:25 GMT'}]",2022-05-19,"[['Mawla', 'Tanjila', ''], ['Gupta', 'Maanak', ''], ['Sandhu', 'Ravi', '']]","['Smart Collaborative Systems', 'IoT (Internet of Things)', 'Activitycentric access control', 'Active Security Model']"
7812,2212.01714,Aditi Agrawal,"Aditi Agrawal, Benjamin Reed","A survey on grading format of automated grading tools for programming
  assignments",,"15th annual International Conference of Education, Research and
  Innovation (2022) 7506-7514",10.21125/iceri.2022.1912,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The prevalence of online platforms and studies has generated the demand for
automated grading tools, and as a result, there are plenty in the market. Such
tools are developed to grade coding assignments quickly, accurately, and
effortlessly. Since there are varieties of tools available to cater to the
diverse options of programming languages and concepts, it is overwhelming for
any instructor to decide which one suits one's requirements. There are several
surveys studying the tools and giving insights into how they function and what
they support. However other than knowing the functionality, it is important for
an instructor to know how the assignments are graded and what is the format of
the test cases. This is crucial since the instructor has to design the grading
format and therefore requires a learning curve. This survey studies and
evaluates the automated grading tools based on their evaluation format. This in
turn helps a reader in deciding which tool to choose and provides an insight
into what are the assessment settings and approaches used in grading the coding
assignment in any specific grading tool.
","[{'version': 'v1', 'created': 'Sun, 4 Dec 2022 00:49:16 GMT'}]",2022-12-06,"[['Agrawal', 'Aditi', ''], ['Reed', 'Benjamin', '']]","['Automated assessment', 'Computer science education', 'programming assignments', 'studentlearning experience']"
7813,2108.09879,Tanmay Ghai,"Yixiang Yao, Tanmay Ghai, Srivatsan Ravi, Pedro Szekely","AMPPERE: A Universal Abstract Machine for Privacy-Preserving Entity
  Resolution Evaluation","10 pages, 6 figures, Published in CIKM '21; corrected title & fixed
  abstract formatting",,10.1145/3459637.3482318,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Entity resolution is the task of identifying records in different datasets
that refer to the same entity in the real world. In sensitive domains (e.g.
financial accounts, hospital health records), entity resolution must meet
privacy requirements to avoid revealing sensitive information such as personal
identifiable information to untrusted parties. Existing solutions are either
too algorithmically-specific or come with an implicit trade-off between
accuracy of the computation, privacy, and run-time efficiency. We propose
AMMPERE, an abstract computation model for performing universal
privacy-preserving entity resolution. AMPPERE offers abstractions that
encapsulate multiple algorithmic and platform-agnostic approaches using
variants of Jaccard similarity to perform private data matching and entity
resolution. Specifically, we show that two parties can perform entity
resolution over their data, without leaking sensitive information. We
rigorously compare and analyze the feasibility, performance overhead and
privacy-preserving properties of these approaches on the Sharemind multi-party
computation (MPC) platform as well as on PALISADE, a lattice-based homomorphic
encryption library. The AMPPERE system demonstrates the efficacy of
privacy-preserving entity resolution for real-world data while providing a
precise characterization of the induced cost of preventing information leakage.
","[{'version': 'v1', 'created': 'Mon, 23 Aug 2021 00:57:39 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Aug 2021 01:37:36 GMT'}, {'version': 'v3', 'created': 'Thu, 4 Nov 2021 20:54:47 GMT'}]",2021-11-08,"[['Yao', 'Yixiang', ''], ['Ghai', 'Tanmay', ''], ['Ravi', 'Srivatsan', ''], ['Szekely', 'Pedro', '']]","['entity resolution', 'privacy-preserving technique', 'homomorphic encryption', 'secure multi-party computation', 'abstract machine']"
7814,1804.00736,Abhinav Valada,Abhinav Valada and Wolfram Burgard,"Deep Spatiotemporal Models for Robust Proprioceptive Terrain
  Classification",,"The International Journal of Robotics Research 36, no. 13-14
  (2017): 1521-1539",10.1177/0278364917727062,,cs.RO cs.LG cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Terrain classification is a critical component of any autonomous mobile robot
system operating in unknown real-world environments. Over the years, several
proprioceptive terrain classification techniques have been introduced to
increase robustness or act as a fallback for traditional vision based
approaches. However, they lack widespread adaptation due to various factors
that include inadequate accuracy, robustness and slow run-times. In this paper,
we use vehicle-terrain interaction sounds as a proprioceptive modality and
propose a deep Long-Short Term Memory (LSTM) based recurrent model that
captures both the spatial and temporal dynamics of such a problem, thereby
overcoming these past limitations. Our model consists of a new Convolution
Neural Network (CNN) architecture that learns deep spatial features,
complemented with LSTM units that learn complex temporal dynamics. Experiments
on two extensive datasets collected with different microphones on various
indoor and outdoor terrains demonstrate state-of-the-art performance compared
to existing techniques. We additionally evaluate the performance in adverse
acoustic conditions with high ambient noise and propose a noise-aware training
scheme that enables learning of more generalizable models that are essential
for robust real-world deployments.
","[{'version': 'v1', 'created': 'Mon, 2 Apr 2018 21:38:56 GMT'}]",2018-04-04,"[['Valada', 'Abhinav', ''], ['Burgard', 'Wolfram', '']]","['Convolutional neural networks', 'Recurrent neural networks', 'Long-short term memory networks', 'Terrain classification', 'Acoustics', 'Temporal classification']"
7815,2206.05558,Junyi Li,"Junyi Li, Jian Pei, Heng Huang",Communication-Efficient Robust Federated Learning with Noisy Labels,To appear in KDD 2022,,10.1145/3534678.3539328,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Federated learning (FL) is a promising privacy-preserving machine learning
paradigm over distributed located data. In FL, the data is kept locally by each
user. This protects the user privacy, but also makes the server difficult to
verify data quality, especially if the data are correctly labeled. Training
with corrupted labels is harmful to the federated learning task; however,
little attention has been paid to FL in the case of label noise. In this paper,
we focus on this problem and propose a learning-based reweighting approach to
mitigate the effect of noisy labels in FL. More precisely, we tuned a weight
for each training sample such that the learned model has optimal generalization
performance over a validation set. More formally, the process can be formulated
as a Federated Bilevel Optimization problem. Bilevel optimization problem is a
type of optimization problem with two levels of entangled problems. The
non-distributed bilevel problems have witnessed notable progress recently with
new efficient algorithms. However, solving bilevel optimization problems under
the Federated Learning setting is under-investigated. We identify that the high
communication cost in hypergradient evaluation is the major bottleneck. So we
propose \textit{Comm-FedBiO} to solve the general Federated Bilevel
Optimization problems; more specifically, we propose two
communication-efficient subroutines to estimate the hypergradient. Convergence
analysis of the proposed algorithms is also provided. Finally, we apply the
proposed algorithms to solve the noisy label problem. Our approach has shown
superior performance on several real-world datasets compared to various
baselines.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2022 16:21:17 GMT'}]",2022-06-14,"[['Li', 'Junyi', ''], ['Pei', 'Jian', ''], ['Huang', 'Heng', '']]","['Data Cleaning', 'Federated Learning', 'Bilevel Optimization']"
7816,2104.14433,Amy Marconnet,"Meghavin Bhatasana, Amy Marconnet","Machine-Learning Assisted Optimization Strategies for Phase Change
  Materials Embedded within Electronic Packages","13 pages, 8 figures, 7 tables",,10.1016/j.applthermaleng.2021.117384,,cs.CE cs.ET cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Leveraging the latent heat of phase change materials (PCMs) can reduce the
peak temperatures and transient variations in temperature in electronic
devices. But as the power levels increase, the thermal conduction pathway from
the heat source to the heat sink limits the effectiveness of these systems. In
this work, we evaluate embedding the PCM within the silicon device layer of an
electronic device to minimize the thermal resistance between the source and the
PCM to minimize this thermal resistance and enhance the thermal performance of
the device. The geometry and material properties of the embedded PCM regions
are optimized using a combination of parametric and machine learning
algorithms. For a fixed geometry, considering commercially available materials,
Solder 174 significantly outperforms other organic and metallic PCMs. Also with
a fixed geometry, the optimal melting points to minimize the peak temperature
is higher than the optimal melting point to minimize the amplitude of the
transient temperature oscillation, and both optima increase with increasing
heater power. Extending beyond conventional optimization strategies, genetic
algorithms and particle swarm optimization with and without neural network
surrogate models are used to enable optimization of many geometric and material
properties. For the test case evaluated, the optimized geometries and
properties are similar between all ML-assisted algorithms, but the
computational time depends on the technique. Ultimately, the optimized design
with embedded phase change materials reduces the maximum temperature rise by
19% and the fluctuations by up to 88% compared to devices without PCM.
","[{'version': 'v1', 'created': 'Wed, 21 Apr 2021 19:20:04 GMT'}]",2021-08-10,"[['Bhatasana', 'Meghavin', ''], ['Marconnet', 'Amy', '']]","['Phase Change Materials (PCMs)', 'Embedded Cooling', 'Electronic Packaging', 'Machine Learning', 'NeuralNetworks']"
7817,2209.06556,Ahmed Fraz Baig,Sigurd Eskeland and Ahmed Fraz Baig,"Cryptanalysis of a privacy-preserving behavior-oriented authentication
  scheme","Eskeland, S. and Baig, A. (2022). Cryptanalysis of a
  Privacy-preserving Behavior-oriented Authentication Scheme. In Proceedings of
  the 19th International Conference on Security and Cryptography - SECRYPT,
  ISBN 978-989- 758-590-6; ISSN 2184-7711, pages 299-304","In Proceedings of the 19th International Conference on Security
  and Cryptography - SECRYPT 2022, ISBN 978-989- 758-590-6; ISSN 2184-7711,
  pages 299-304",10.5220/001114030000328,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Continuous authentication has been proposed as a complementary security
mechanism to password-based authentication for computer devices that are
handled directly by humans, such as smart phones. Continuous authentication has
some privacy issues as certain user features and actions are revealed to the
authentication server, which is not assumed to be trusted. Wei et al. proposed
in 2021 a privacy-preserving protocol for behavioral authentication that
utilizes homomorphic encryption. The encryption prevents the server from
obtaining sampled user features. In this paper, we show that the Wei et al.
scheme is insecure regarding both an honest-but-curious server and an active
eavesdropper. We present two attacks: The first attack enables the
authentication server to obtain the secret user key, plaintext behavior
template and plaintext authentication behavior data from encrypted data. The
second attack enables an active eavesdropper to restore the plaintext
authentication behavior data from the transmitted encrypted data.
","[{'version': 'v1', 'created': 'Wed, 14 Sep 2022 11:25:15 GMT'}]",2022-09-15,"[['Eskeland', 'Sigurd', ''], ['Baig', 'Ahmed Fraz', '']]","['Privacy-preserving behavioral authentication', 'Cryptographic protocols', 'Homomorphic encryption', 'Cryptanalysis', 'Continuous authentication']"
7818,2106.11919,Francisco Baeta,"Francisco Baeta, Jo\~ao Correia, Tiago Martins, Penousal Machado",Speed Benchmarking of Genetic Programming Frameworks,,,10.1145/3449639.3459335,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Genetic Programming (GP) is known to suffer from the burden of being
computationally expensive by design. While, over the years, many techniques
have been developed to mitigate this issue, data vectorization, in particular,
is arguably still the most attractive strategy due to the parallel nature of
GP. In this work, we employ a series of benchmarks meant to compare both the
performance and evolution capabilities of different vectorized and iterative
implementation approaches across several existing frameworks. Namely, TensorGP,
a novel open-source engine written in Python, is shown to greatly benefit from
the TensorFlow library to accelerate the domain evaluation phase in GP. The
presented performance benchmarks demonstrate that the TensorGP engine manages
to pull ahead, with relative speedups above two orders of magnitude for
problems with a higher number of fitness cases. Additionally, as a consequence
of being able to compute larger domains, we argue that TensorGP performance
gains aid the discovery of more accurate candidate solutions.
","[{'version': 'v1', 'created': 'Tue, 25 May 2021 22:06:42 GMT'}]",2021-06-23,"[['Baeta', 'Francisco', ''], ['Correia', 'João', ''], ['Martins', 'Tiago', ''], ['Machado', 'Penousal', '']]","['Genetic Programming', 'Parallelization', 'Vectorization', 'TensorFlow', 'GPU Computing']"
7819,2112.11389,Samujjwal Ghosh,"Samujjwal Ghosh, Subhadeep Maji, Maunendra Sankar Desarkar",Supervised Graph Contrastive Pretraining for Text Classification,"A condensed version of this paper has been accepted to ACM SAC'22.
  DOI: https://doi.org/10.1145/3477314.3507194",,10.1145/3477314.3507194,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Contrastive pretraining techniques for text classification has been largely
studied in an unsupervised setting. However, oftentimes labeled data from
related tasks which share label semantics with current task is available. We
hypothesize that using this labeled data effectively can lead to better
generalization on current task. In this paper, we propose a novel way to
effectively utilize labeled data from related tasks with a graph based
supervised contrastive learning approach. We formulate a token-graph by
extrapolating the supervised information from examples to tokens. Our
formulation results in an embedding space where tokens with high/low
probability of belonging to same class are near/further-away from one another.
We also develop detailed theoretical insights which serve as a motivation for
our method. In our experiments with $13$ datasets, we show our method
outperforms pretraining schemes by $2.5\%$ and also example-level contrastive
learning based formulation by $1.8\%$ on average. In addition, we show
cross-domain effectiveness of our method in a zero-shot setting by $3.91\%$ on
average. Lastly, we also demonstrate our method can be used as a noisy teacher
in a knowledge distillation setting to significantly improve performance of
transformer based models in low labeled data regime by $4.57\%$ on average.
","[{'version': 'v1', 'created': 'Tue, 21 Dec 2021 17:47:14 GMT'}]",2021-12-22,"[['Ghosh', 'Samujjwal', ''], ['Maji', 'Subhadeep', ''], ['Desarkar', 'Maunendra Sankar', '']]","['Contrastive Learning', 'Graph Neural Network', 'Text Classification', 'Text Representation', 'Zero-shot Classification', 'Disaster Response', 'Sentiment Analysis']"
7820,2009.03979,Hengrui Luo,"Leland Wilkinson, Hengrui Luo",A Distance-preserving Matrix Sketch,"38 pages, 13 figures","Journal of Computational and Graphical Statistics, 2022",10.1080/10618600.2022.2050246,,cs.HC cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visualizing very large matrices involves many formidable problems. Various
popular solutions to these problems involve sampling, clustering, projection,
or feature selection to reduce the size and complexity of the original task. An
important aspect of these methods is how to preserve relative distances between
points in the higher-dimensional space after reducing rows and columns to fit
in a lower dimensional space. This aspect is important because conclusions
based on faulty visual reasoning can be harmful. Judging dissimilar points as
similar or similar points as dissimilar on the basis of a visualization can
lead to false conclusions. To ameliorate this bias and to make visualizations
of very large datasets feasible, we introduce two new algorithms that
respectively select a subset of rows and columns of a rectangular matrix. This
selection is designed to preserve relative distances as closely as possible. We
compare our matrix sketch to more traditional alternatives on a variety of
artificial and real datasets.
","[{'version': 'v1', 'created': 'Tue, 8 Sep 2020 20:15:14 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Jun 2021 19:51:23 GMT'}, {'version': 'v3', 'created': 'Fri, 19 Nov 2021 06:39:11 GMT'}]",2022-06-06,"[['Wilkinson', 'Leland', ''], ['Luo', 'Hengrui', '']]","['Matrix sketching', 'visualization', 'dimension reduction', 'Frobenius coefficient']"
7821,2208.13778,Alexander Kirdin,"A. N. Kirdin, S. V. Sidorov, N. Y. Zolotykh",Rosenblatt's first theorem and frugality of deep learning,,,10.3390/e24111635,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  First Rosenblatt's theorem about omnipotence of shallow networks states that
elementary perceptrons can solve any classification problem if there are no
discrepancies in the training set. Minsky and Papert considered elementary
perceptrons with restrictions on the neural inputs: a bounded number of
connections or a relatively small diameter of the receptive field for each
neuron at the hidden layer. They proved that under these constraints, an
elementary perceptron cannot solve some problems, such as the connectivity of
input images or the parity of pixels in them. In this note, we demonstrated
first Rosenblatt's theorem at work, showed how an elementary perceptron can
solve a version of the travel maze problem, and analysed the complexity of that
solution. We constructed also a deep network algorithm for the same problem. It
is much more efficient. The shallow network uses an exponentially large number
of neurons on the hidden layer (Rosenblatt's $A$-elements), whereas for the
deep network the second order polynomial complexity is sufficient. We
demonstrated that for the same complex problem deep network can be much smaller
and reveal a heuristic behind this effect.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2022 09:44:27 GMT'}]",2022-11-23,"[['Kirdin', 'A. N.', ''], ['Sidorov', 'S. V.', ''], ['Zolotykh', 'N. Y.', '']]","['complexity', 'classification', 'shallow network', 'elementary perceptron', 'deep network', 'travel maze problem']"
7822,2107.01678,Md Morshed Alam,"Md Morshed Alam and Weichao Wang (Department of Software and
  Information Systems, University of North Carolina at Charlotte, NC, USA)","A Comprehensive Survey on the State-of-the-art Data Provenance
  Approaches for Security Enforcement",,Journal of Computer Security. 29(4). 423-446 (2021),10.3233/JCS-200108,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Data provenance collects comprehensive information about the events and
operations in a computer system at both application and system levels. It
provides a detailed and accurate history of transactions that help delineate
the data flow scenario across the whole system. Data provenance helps achieve
system resilience by uncovering several malicious attack traces after a system
compromise that are leveraged by the analyzer to understand the attack behavior
and discover the level of damage. Existing literature demonstrates a number of
research efforts on information capture, management, and analysis of data
provenance. In recent years, provenance in IoT devices attracts several
research efforts because of the proliferation of commodity IoT devices. In this
survey paper, we present a comparative study of the state-of-the-art approaches
to provenance by classifying them based on frameworks, deployed techniques, and
subjects of interest. We also discuss the emergence and scope of data
provenance in IoT networks. Finally, we present the urgency in several
directions that data provenance needs to pursue, including data management and
analysis.
","[{'version': 'v1', 'created': 'Sun, 4 Jul 2021 16:31:57 GMT'}]",2021-07-06,"[['Alam', 'Md Morshed', '', 'Department of Software and\n  Information Systems, University of North Carolina at Charlotte, NC, USA'], ['Wang', 'Weichao', '', 'Department of Software and\n  Information Systems, University of North Carolina at Charlotte, NC, USA']]","['Data Provenance', 'Information Flow Control', 'Digital Forensic', 'Attack Reconstruction', 'Taint Propagation']"
7823,2108.06116,Yuki Noguchi,"Yuki Noguchi, Takayuki Yamada","Topology optimization for acoustic structures considering viscous and
  thermal boundary layers using a sequential linearized Navier-Stokes model",,,10.1016/j.cma.2022.114863,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study proposes a level set-based topology optimization method for
designing acoustic structures with viscous and thermal boundary layers in
perspective. Acoustic waves propagating in a narrow channel are damped by
viscous and thermal boundary layers. To estimate these viscothermal effects, we
first introduce a sequential linearized Navier-Stokes model based on three
weakly coupled Helmholtz equations for viscous, thermal, and acoustic pressure
fields. Then, the optimization problem is formulated, where a sound-absorbing
structure comprising air and an isothermal rigid medium is targeted, and its
sound absorption coefficient is set as an objective function. The adjoint
variable method and the concept of the topological derivative are used to
approximately obtain design sensitivity. A level set-based topology
optimization method is used to solve the optimization problem. Two-dimensional
numerical examples are provided to support the validity of the proposed method.
Moreover, the mechanisms that lead to the high absorption coefficient of the
optimized design are discussed.
","[{'version': 'v1', 'created': 'Fri, 13 Aug 2021 08:19:47 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Mar 2022 01:16:43 GMT'}]",2022-03-31,"[['Noguchi', 'Yuki', ''], ['Yamada', 'Takayuki', '']]","['Viscothermal acoustics', 'Sequential linearized Navier–Stokesmodel', 'Topology optimization', 'Level set method', 'Sound-absorbingstructure', 'Topological derivative']"
7824,2009.12950,Trevor Bergstrom,"Trevor Bergstrom, Humphrey Shi","Human-Object Interaction Detection:A Quick Survey and Examination of
  Methods","Published at The 1st International Workshop On Human-Centric
  Multimedia Analysis, at ACM Multimedia Conference 2020",,10.1145/3422852.3423481,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human-object interaction detection is a relatively new task in the world of
computer vision and visual semantic information extraction. With the goal of
machines identifying interactions that humans perform on objects, there are
many real-world use cases for the research in this field. To our knowledge,
this is the first general survey of the state-of-the-art and milestone works in
this field. We provide a basic survey of the developments in the field of
human-object interaction detection. Many works in this field use multi-stream
convolutional neural network architectures, which combine features from
multiple sources in the input image. Most commonly these are the humans and
objects in question, as well as the spatial quality of the two. As far as we
are aware, there have not been in-depth studies performed that look into the
performance of each component individually. In order to provide insight to
future researchers, we perform an individualized study that examines the
performance of each component of a multi-stream convolutional neural network
architecture for human-object interaction detection. Specifically, we examine
the HORCNN architecture as it is a foundational work in the field. In addition,
we provide an in-depth look at the HICO-DET dataset, a popular benchmark in the
field of human-object interaction detection. Code and papers can be found at
https://github.com/SHI-Labs/Human-Object-Interaction-Detection.
","[{'version': 'v1', 'created': 'Sun, 27 Sep 2020 20:58:39 GMT'}]",2020-09-29,"[['Bergstrom', 'Trevor', ''], ['Shi', 'Humphrey', '']]","['human-object interaction detection', 'visual relationship detection', 'convolutional neural networks', 'visual understanding']"
7825,2205.04504,Allard Oelen,"Allard Oelen, Markus Stocker, S\""oren Auer","TinyGenius: Intertwining Natural Language Processing with Microtask
  Crowdsourcing for Scholarly Knowledge Graph Creation",,,10.1145/3529372.3533285,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As the number of published scholarly articles grows steadily each year, new
methods are needed to organize scholarly knowledge so that it can be more
efficiently discovered and used. Natural Language Processing (NLP) techniques
are able to autonomously process scholarly articles at scale and to create
machine readable representations of the article content. However, autonomous
NLP methods are by far not sufficiently accurate to create a high-quality
knowledge graph. Yet quality is crucial for the graph to be useful in practice.
We present TinyGenius, a methodology to validate NLP-extracted scholarly
knowledge statements using microtasks performed with crowdsourcing. The
scholarly context in which the crowd workers operate has multiple challenges.
The explainability of the employed NLP methods is crucial to provide context in
order to support the decision process of crowd workers. We employed TinyGenius
to populate a paper-centric knowledge graph, using five distinct NLP methods.
In the end, the resulting knowledge graph serves as a digital library for
scholarly articles.
","[{'version': 'v1', 'created': 'Mon, 9 May 2022 18:19:51 GMT'}]",2022-05-11,"[['Oelen', 'Allard', ''], ['Stocker', 'Markus', ''], ['Auer', 'Sören', '']]","['Crowdsourcing Microtasks', 'Knowledge Graph Validation', 'ScholarlyKnowledge Graphs', 'Intelligent User Interfaces']"
7826,2106.12320,Zeyd Boukhers,"Zeyd Boukhers, Philipp Mayr, Silvio Peroni","BiblioDAP: The 1st Workshop on Bibliographic Data Analysis and
  Processing",This workshop will be held in conjunction with KDD' 2021,,10.1145/3447548.346,,cs.DL cs.IR cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Automatic processing of bibliographic data becomes very important in digital
libraries, data science and machine learning due to its importance in keeping
pace with the significant increase of published papers every year from one side
and to the inherent challenges from the other side. This processing has several
aspects including but not limited to I) Automatic extraction of references from
PDF documents, II) Building an accurate citation graph, III) Author name
disambiguation, etc. Bibliographic data is heterogeneous by nature and occurs
in both structured (e.g. citation graph) and unstructured (e.g. publications)
formats. Therefore, it requires data science and machine learning techniques to
be processed and analysed. Here we introduce BiblioDAP'21: The 1st Workshop on
Bibliographic Data Analysis and Processing.
","[{'version': 'v1', 'created': 'Wed, 23 Jun 2021 11:33:19 GMT'}]",2021-06-24,"[['Boukhers', 'Zeyd', ''], ['Mayr', 'Philipp', ''], ['Peroni', 'Silvio', '']]","['Bibliographic data', 'Digital libraries', 'Machine Learning', 'Data Science']"
7827,1710.08865,Paul Van den Hof,"Paul M.J. Van den Hof, Arne G. Dankers and Harm H.M. Weerts",Identification in Dynamic Networks,,,10.1016/j.compchemeng.2017.10.005,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  System identification is a common tool for estimating (linear) plant models
as a basis for model-based predictive control and optimization. The current
challenges in process industry, however, ask for data-driven modelling
techniques that go beyond the single unit/plant models. While optimization and
control problems become more and more structured in the form of decentralized
and/or distributed solutions, the related modelling problems will need to
address structured and interconnected systems. An introduction will be given to
the current state of the art and related developments in the identification of
linear dynamic networks. Starting from classical prediction error methods for
open-loop and closed-loop systems, several consequences for the handling of
network situations will be presented and new research questions will be
highlighted.
","[{'version': 'v1', 'created': 'Tue, 24 Oct 2017 16:03:28 GMT'}]",2018-02-06,"[['Hof', 'Paul M. J. Van den', ''], ['Dankers', 'Arne G.', ''], ['Weerts', 'Harm H. M.', '']]","['system identification', 'dynamic networks', 'identifiability', 'experiment design', 'model-based control', 'distributed control', 'closed-loopidentification']"
7828,2003.01302,Changhao Sun,"Changhao Sun, Chen Li, Jinghua Zhang, Muhammad Rahaman, Shiliang Ai,
  Hao Chen, Frank Kulwa, Yixin Li, Xiaoyan Li, Tao Jiang","Gastric histopathology image segmentation using a hierarchical
  conditional random field",,"Biocybernetics and Biomedical Engineering, 2020, 40(4): 1535-1555",10.1016/j.bbe.2020.09.008,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For the Convolutional Neural Networks (CNNs) applied in the intelligent
diagnosis of gastric cancer, existing methods mostly focus on individual
characteristics or network frameworks without a policy to depict the integral
information. Mainly, Conditional Random Field (CRF), an efficient and stable
algorithm for analyzing images containing complicated contents, can
characterize spatial relation in images. In this paper, a novel Hierarchical
Conditional Random Field (HCRF) based Gastric Histopathology Image Segmentation
(GHIS) method is proposed, which can automatically localize abnormal (cancer)
regions in gastric histopathology images obtained by an optical microscope to
assist histopathologists in medical work. This HCRF model is built up with
higher order potentials, including pixel-level and patch-level potentials, and
graph-based post-processing is applied to further improve its segmentation
performance. Especially, a CNN is trained to build up the pixel-level
potentials and another three CNNs are fine-tuned to build up the patch-level
potentials for sufficient spatial segmentation information. In the experiment,
a hematoxylin and eosin (H&E) stained gastric histopathological dataset with
560 abnormal images are divided into training, validation and test sets with a
ratio of 1 : 1 : 2. Finally, segmentation accuracy, recall and specificity of
78.91%, 65.59%, and 81.33% are achieved on the test set. Our HCRF model
demonstrates high segmentation performance and shows its effectiveness and
future potential in the GHIS field.
","[{'version': 'v1', 'created': 'Tue, 3 Mar 2020 02:44:31 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Mar 2020 06:14:37 GMT'}, {'version': 'v3', 'created': 'Fri, 17 Apr 2020 09:18:14 GMT'}, {'version': 'v4', 'created': 'Fri, 25 Sep 2020 11:20:50 GMT'}, {'version': 'v5', 'created': 'Mon, 19 Oct 2020 14:03:28 GMT'}]",2020-10-20,"[['Sun', 'Changhao', ''], ['Li', 'Chen', ''], ['Zhang', 'Jinghua', ''], ['Rahaman', 'Muhammad', ''], ['Ai', 'Shiliang', ''], ['Chen', 'Hao', ''], ['Kulwa', 'Frank', ''], ['Li', 'Yixin', ''], ['Li', 'Xiaoyan', ''], ['Jiang', 'Tao', '']]","['Image Segmentation', 'Gastric Cancer', 'Histopathology Image', 'Conditional Random Field', 'ConvolutionalNeural Network', 'Feature Extraction']"
7829,2108.04116,Oliver Rippel,"Oliver Rippel, Arnav Chavan, Chucai Lei, Dorit Merhof","Transfer Learning Gaussian Anomaly Detection by Fine-tuning
  Representations",Camera ready for IMPROVE22 + additional typo fixes,,10.5220/0011063900003209,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current state-of-the-art anomaly detection (AD) methods exploit the powerful
representations yielded by large-scale ImageNet training. However, catastrophic
forgetting prevents the successful fine-tuning of pre-trained representations
on new datasets in the semi-supervised setting, and representations are
therefore commonly fixed. In our work, we propose a new method to overcome
catastrophic forgetting and thus successfully fine-tune pre-trained
representations for AD in the transfer learning setting. Specifically, we
induce a multivariate Gaussian distribution for the normal class based on the
linkage between generative and discriminative modeling, and use the Mahalanobis
distance of normal images to the estimated distribution as training objective.
We additionally propose to use augmentations commonly employed for vicinal risk
minimization in a validation scheme to detect onset of catastrophic forgetting.
Extensive evaluations on the public MVTec dataset reveal that a new state of
the art is achieved by our method in the AD task while simultaneously achieving
anomaly segmentation performance comparable to prior state of the art. Further,
ablation studies demonstrate the importance of the induced Gaussian
distribution as well as the robustness of the proposed fine-tuning scheme with
respect to the choice of augmentations.
","[{'version': 'v1', 'created': 'Mon, 9 Aug 2021 15:29:04 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Jun 2022 08:33:46 GMT'}]",2022-06-14,"[['Rippel', 'Oliver', ''], ['Chavan', 'Arnav', ''], ['Lei', 'Chucai', ''], ['Merhof', 'Dorit', '']]","['Anomaly Detection', 'Anomaly Segmentation', 'Transfer Learning', 'PDF Estimation', 'Visual Inspection']"
7830,2005.02832,Ngo Le Huy Hien Mr.,"Nguyen Van Hieu, Ngo Le Huy Hien","Automatic Plant Image Identification of Vietnamese species using Deep
  Learning Models","7 pages, 8 figures, 2 tables, Published with International Journal of
  Engineering Trends and Technology (IJETT)","International Journal of Engineering Trends and Technology
  68.4(2020):25-31. Published by Seventh Sense Research Group",10.14445/22315381/IJETT-V68I4P205S,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is complicated to distinguish among thousands of plant species in the
natural ecosystem, and many efforts have been investigated to address the
issue. In Vietnam, the task of identifying one from 12,000 species requires
specialized experts in flora management, with thorough training skills and
in-depth knowledge. Therefore, with the advance of machine learning, automatic
plant identification systems have been proposed to benefit various
stakeholders, including botanists, pharmaceutical laboratories, taxonomists,
forestry services, and organizations. The concept has fueled an interest in
research and application from global researchers and engineers in both fields
of machine learning and computer vision. In this paper, the Vietnamese plant
image dataset was collected from an online encyclopedia of Vietnamese
organisms, together with the Encyclopedia of Life, to generate a total of
28,046 environmental images of 109 plant species in Vietnam. A comparative
evaluation of four deep convolutional feature extraction models, which are
MobileNetV2, VGG16, ResnetV2, and Inception Resnet V2, is presented. Those
models have been tested on the Support Vector Machine (SVM) classifier to
experiment with the purpose of plant image identification. The proposed models
achieve promising recognition rates, and MobilenetV2 attained the highest with
83.9%. This result demonstrates that machine learning models are potential for
plant species identification in the natural environment, and future works need
to examine proposing higher accuracy systems on a larger dataset to meet the
current application demand.
","[{'version': 'v1', 'created': 'Tue, 5 May 2020 09:59:10 GMT'}]",2020-05-07,"[['Van Hieu', 'Nguyen', ''], ['Hien', 'Ngo Le Huy', '']]","['Plant identification', 'convolutional neural network', 'support vector machine', 'deep learning models']"
7831,2003.02750,Thang Dang Duy,Dang Duy Thang and Toshihiro Matsui,Search Space of Adversarial Perturbations against Image Filters,,"Published in International Journal of Advanced Computer Science
  and Applications(IJACSA), Volume 11 Issue 1, 2020",10.14569/IJACSA.2020.0110102,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The superiority of deep learning performance is threatened by safety issues
for itself. Recent findings have shown that deep learning systems are very weak
to adversarial examples, an attack form that was altered by the attacker's
intent to deceive the deep learning system. There are many proposed defensive
methods to protect deep learning systems against adversarial examples. However,
there is still a lack of principal strategies to deceive those defensive
methods. Any time a particular countermeasure is proposed, a new powerful
adversarial attack will be invented to deceive that countermeasure. In this
study, we focus on investigating the ability to create adversarial patterns in
search space against defensive methods that use image filters. Experimental
results conducted on the ImageNet dataset with image classification tasks
showed the correlation between the search space of adversarial perturbation and
filters. These findings open a new direction for building stronger offensive
methods towards deep learning systems.
","[{'version': 'v1', 'created': 'Thu, 5 Mar 2020 16:40:06 GMT'}]",2020-03-06,"[['Thang', 'Dang Duy', ''], ['Matsui', 'Toshihiro', '']]","['Deep Neural Networks', 'Image Filters', 'AdversarialExamples', 'Image Classification']"
7832,2209.13015,Ehsan Gholami,"Ehsan Gholami, Mohammad Motamedi, Ashwin Aravindakshan","PARSRec: Explainable Personalized Attention-fused Recurrent Sequential
  Recommendation Using Session Partial Actions","10 pages, 4 figures, this is the author's version of the work. The
  definitive Version of Record was published in Proceedings of the 28th ACM
  SIGKDD Conference on Knowledge Discovery and Data Mining (KDD '22), August
  14-18, 2022, Washington, DC, USA",,10.1145/3534678.3539432,,cs.IR cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The emerging meta- and multi-verse landscape is yet another step towards the
more prevalent use of already ubiquitous online markets. In such markets,
recommender systems play critical roles by offering items of interest to the
users, thereby narrowing down a vast search space that comprises hundreds of
thousands of products. Recommender systems are usually designed to learn common
user behaviors and rely on them for inference. This approach, while effective,
is oblivious to subtle idiosyncrasies that differentiate humans from each
other. Focusing on this observation, we propose an architecture that relies on
common patterns as well as individual behaviors to tailor its recommendations
for each person. Simulations under a controlled environment show that our
proposed model learns interpretable personalized user behaviors. Our empirical
results on Nielsen Consumer Panel dataset indicate that the proposed approach
achieves up to 27.9% performance improvement compared to the state-of-the-art.
","[{'version': 'v1', 'created': 'Fri, 16 Sep 2022 12:07:43 GMT'}]",2022-09-28,"[['Gholami', 'Ehsan', ''], ['Motamedi', 'Mohammad', ''], ['Aravindakshan', 'Ashwin', '']]","['Sequential Recommendation', 'Personalized User Attention', 'Assortment', 'Embedding']"
7833,2103.11439,Jan Janak,"Pekka Karhula, Jan Janak, Henning Schulzrinne",Checkpointing and Migration of IoT Edge Functions,6 pages,"EdgeSys '19: Proceedings of the 2nd International Workshop on Edge
  Systems, Analytics and Networking, March 2019",10.1145/3301418.3313947,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  The serverless and functions as a service (FaaS) paradigms are currently
trending among cloud providers and are now increasingly being applied to the
network edge, and to the Internet of Things (IoT) devices. The benefits include
reduced latency for communication, less network traffic and increased privacy
for data processing. However, there are challenges as IoT devices have limited
resources for running multiple simultaneous containerized functions, and also
FaaS does not typically support long-running functions. Our implementation
utilizes Docker and CRIU for checkpointing and suspending long-running blocking
functions. The results show that checkpointing is slightly slower than regular
Docker pause, but it saves memory and allows for more long-running functions to
be run on an IoT device. Furthermore, the resulting checkpoint files are small,
hence they are suitable for live migration and backing up stateful functions,
therefore improving availability and reliability of the system.
","[{'version': 'v1', 'created': 'Sun, 21 Mar 2021 17:15:26 GMT'}]",2021-03-23,"[['Karhula', 'Pekka', ''], ['Janak', 'Jan', ''], ['Schulzrinne', 'Henning', '']]","['Internet of Things', 'checkpointing', 'serverless', 'functionas a service', 'light-weight virtualization']"
7834,1905.13266,William La Cava,"William La Cava, Lee Spector, Kourosh Danai",Epsilon-Lexicase Selection for Regression,"9 pages, 9 figures. Presented at GECCO '16. Includes correction",,10.1145/2908812.2908898,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lexicase selection is a parent selection method that considers test cases
separately, rather than in aggregate, when performing parent selection. It
performs well in discrete error spaces but not on the continuous-valued
problems that compose most system identification tasks. In this paper, we
develop a new form of lexicase selection for symbolic regression, named
epsilon-lexicase selection, that redefines the pass condition for individuals
on each test case in a more effective way. We run a series of experiments on
real-world and synthetic problems with several treatments of epsilon and
quantify how epsilon affects parent selection and model performance.
epsilon-lexicase selection is shown to be effective for regression, producing
better fit models compared to other techniques such as tournament selection and
age-fitness Pareto optimization. We demonstrate that epsilon can be adapted
automatically for individual test cases based on the population performance
distribution. Our experiments show that epsilon-lexicase selection with
automatic epsilon produces the most accurate models across tested problems with
negligible computational overhead. We show that behavioral diversity is
exceptionally high in lexicase selection treatments, and that epsilon-lexicase
selection makes use of more fitness cases when selecting parents than lexicase
selection, which helps explain the performance improvement.
","[{'version': 'v1', 'created': 'Thu, 30 May 2019 19:10:29 GMT'}]",2019-06-03,"[['La Cava', 'William', ''], ['Spector', 'Lee', ''], ['Danai', 'Kourosh', '']]","['genetic programming', 'system identification', 'regression', 'parent selection']"
7835,2202.08679,Alexander Isenko,"Alexander Isenko, Ruben Mayer, Jeffrey Jedele, Hans-Arno Jacobsen","Where Is My Training Bottleneck? Hidden Trade-Offs in Deep Learning
  Preprocessing Pipelines","To be published in SIGMOD, June 12-17, 2022, Philadelphia, PA, USA.
  Repository: https://github.com/cirquit/presto",,10.1145/3514221.3517848,,cs.LG cs.DC cs.PF,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Preprocessing pipelines in deep learning aim to provide sufficient data
throughput to keep the training processes busy. Maximizing resource utilization
is becoming more challenging as the throughput of training processes increases
with hardware innovations (e.g., faster GPUs, TPUs, and inter-connects) and
advanced parallelization techniques that yield better scalability. At the same
time, the amount of training data needed in order to train increasingly complex
models is growing. As a consequence of this development, data preprocessing and
provisioning are becoming a severe bottleneck in end-to-end deep learning
pipelines.
  In this paper, we provide an in-depth analysis of data preprocessing
pipelines from four different machine learning domains. We introduce a new
perspective on efficiently preparing datasets for end-to-end deep learning
pipelines and extract individual trade-offs to optimize throughput,
preprocessing time, and storage consumption. Additionally, we provide an
open-source profiling library that can automatically decide on a suitable
preprocessing strategy to maximize throughput. By applying our generated
insights to real-world use-cases, we obtain an increased throughput of 3x to
13x compared to an untuned system while keeping the pipeline functionally
identical. These findings show the enormous potential of data pipeline tuning.
","[{'version': 'v1', 'created': 'Thu, 17 Feb 2022 14:31:58 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Feb 2022 14:35:44 GMT'}, {'version': 'v3', 'created': 'Fri, 25 Mar 2022 09:54:55 GMT'}]",2022-03-28,"[['Isenko', 'Alexander', ''], ['Mayer', 'Ruben', ''], ['Jedele', 'Jeffrey', ''], ['Jacobsen', 'Hans-Arno', '']]","['preprocessing', 'data processing', 'datasets', 'machine learning', 'deeplearning']"
7836,2202.00965,Daniel Buschek,"Hai Dang, Lukas Mecke, Daniel Buschek","GANSlider: How Users Control Generative Models for Images using Multiple
  Sliders with and without Feedforward Information","15 pages, 10 figures, ACM CHI 2022",,10.1145/3491102.3502141,,cs.HC cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate how multiple sliders with and without feedforward
visualizations influence users' control of generative models. In an online
study (N=138), we collected a dataset of people interacting with a generative
adversarial network (StyleGAN2) in an image reconstruction task. We found that
more control dimensions (sliders) significantly increase task difficulty and
user actions. Visual feedforward partly mitigates this by enabling more
goal-directed interaction. However, we found no evidence of faster or more
accurate task performance. This indicates a tradeoff between feedforward detail
and implied cognitive costs, such as attention. Moreover, we found that
visualizations alone are not always sufficient for users to understand
individual control dimensions. Our study quantifies fundamental UI design
factors and resulting interaction behavior in this context, revealing
opportunities for improvement in the UI design for interactive applications of
generative models. We close by discussing design directions and further
aspects.
","[{'version': 'v1', 'created': 'Wed, 2 Feb 2022 11:25:07 GMT'}]",2022-02-03,"[['Dang', 'Hai', ''], ['Mecke', 'Lukas', ''], ['Buschek', 'Daniel', '']]","['interactive AI', 'generative adversarial network', 'image manipulation', 'user study', 'dataset']"
7837,2107.00227,Wei Zeng,"Chi Zhang, Wei Zeng, Ligang Liu",UrbanVR: An immersive analytics system for context-aware urban design,,,10.1016/j.cag.2021.07.006,,cs.HC cs.GR,http://creativecommons.org/licenses/by/4.0/,"  Urban design is a highly visual discipline that requires visualization for
informed decision making. However, traditional urban design tools are mostly
limited to representations on 2D displays that lack intuitive awareness. The
popularity of head-mounted displays (HMDs) promotes a promising alternative
with consumer-grade 3D displays. We introduce UrbanVR, an immersive analytics
system with effective visualization and interaction techniques, to enable
architects to assess designs in a virtual reality (VR) environment.
Specifically, UrbanVR incorporates 1) a customized parallel coordinates plot
(PCP) design to facilitate quantitative assessment of high-dimensional design
metrics, 2) a series of egocentric interactions, including gesture interactions
and handle-bar metaphors, to facilitate user interactions, and 3) a viewpoint
optimization algorithm to help users explore both the PCP for quantitative
analysis, and objects of interest for context awareness. Effectiveness and
feasibility of the system are validated through quantitative user studies and
qualitative expert feedbacks.
","[{'version': 'v1', 'created': 'Thu, 1 Jul 2021 05:49:19 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Aug 2021 01:03:26 GMT'}]",2021-09-14,"[['Zhang', 'Chi', ''], ['Zeng', 'Wei', ''], ['Liu', 'Ligang', '']]","['Immersive analytics', 'urbandesign', 'virtual PCP', 'viewport optimization', 'gesture interaction']"
7838,1802.02531,Loris Nanni,"Alessandra Lumini, Loris Nanni","Fair comparison of skin detection approaches on publicly available
  datasets",,"Expert Systems with Applications Volume 160, 1 December 2020,
  113677",10.1016/j.eswa.2020.113677,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Skin detection is the process of discriminating skin and non-skin regions in
a digital image and it is widely used in several applications ranging from hand
gesture analysis to track body parts and face detection. Skin detection is a
challenging problem which has drawn extensive attention from the research
community, nevertheless a fair comparison among approaches is very difficult
due to the lack of a common benchmark and a unified testing protocol. In this
work, we investigate the most recent researches in this field and we propose a
fair comparison among approaches using several different datasets. The major
contributions of this work are an exhaustive literature review of skin color
detection approaches, a framework to evaluate and combine different skin
detector approaches, whose source code is made freely available for future
research, and an extensive experimental comparison among several recent methods
which have also been used to define an ensemble that works well in many
different problems. Experiments are carried out in 10 different datasets
including more than 10000 labelled images: experimental results confirm that
the best method here proposed obtains a very good performance with respect to
other stand-alone approaches, without requiring ad hoc parameter tuning. A
MATLAB version of the framework for testing and of the methods proposed in this
paper will be freely available from https://github.com/LorisNanni
","[{'version': 'v1', 'created': 'Wed, 7 Feb 2018 17:16:46 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Mar 2019 14:58:57 GMT'}, {'version': 'v3', 'created': 'Thu, 22 Aug 2019 22:09:40 GMT'}, {'version': 'v4', 'created': 'Wed, 8 Jan 2020 17:54:18 GMT'}, {'version': 'v5', 'created': 'Wed, 3 Jun 2020 20:35:36 GMT'}, {'version': 'v6', 'created': 'Fri, 10 Jul 2020 21:31:26 GMT'}]",2020-07-14,"[['Lumini', 'Alessandra', ''], ['Nanni', 'Loris', '']]","['skin classification', 'skin detection', 'skin segmentation', 'skin database']"
7839,2109.04791,Mohammad Ridwan Kabir,"Mohammad Ridwan Kabir (1 and 3), Mohammad Ishrak Abedin (2 and 3),
  Rizvi Ahmed (2 and 3), Hasan Mahmud (1 and 3), Md. Kamrul Hasan (1 and 3)
  ((1) Systems and Software Lab (SSL), (2) Network and Data Analysis Group
  (NDAG), (3) Department of Computer Science and Engineering, Islamic
  University of Technology (IUT), Gazipur, Bangladesh.)","ANTASID: A Novel Temporal Adjustment to Shannon's Index of Difficulty
  for Quantifying the Perceived Difficulty of Uncontrolled Pointing Tasks","14 pages, 7 figures, 7 tables",,10.1109/ACCESS.2022.3151696,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Shannon's Index of Difficulty ($ID$), reputable for quantifying the perceived
difficulty of pointing tasks as a logarithmic relationship between
movement-amplitude ($A$) and target-width ($W$), is used for modelling the
corresponding observed movement-times ($MT_O$) in such tasks in controlled
experimental setup. However, real-life pointing tasks are both spatially and
temporally uncontrolled, being influenced by factors such as - human aspects,
subjective behavior, the context of interaction, the inherent speed-accuracy
trade-off where, emphasizing accuracy compromises speed of interaction and vice
versa, and so on. Effective target-width ($W_e$) is considered as spatial
adjustment for compensating accuracy. However, no significant adjustment exists
in the literature for compensating speed in different contexts of interaction
in these tasks. As a result, without any temporal adjustment, the true
difficulty of an uncontrolled pointing task may be inaccurately quantified
using Shannon's ID. To verify this, we propose the ANTASID (A Novel Temporal
Adjustment to Shannon's ID) formulation with detailed performance analysis. We
hypothesized a temporal adjustment factor ($t$) as a binary logarithm of
$MT_O$, compensating for speed due to contextual differences and minimizing the
non-linearity between movement-amplitude and target-width. Considering spatial
and/or temporal adjustments to ID, we conducted regression analysis using our
own and Benchmark datasets in both controlled and uncontrolled scenarios of
pointing tasks with a generic mouse.ANTASID formulation showed significantly
superior fitness values and throughput in all the scenarios while reducing the
standard error. Furthermore, the quantification of ID with ANTASID varied
significantly compared to the classical formulations of Shannon's ID,
validating the purpose of this study.
","[{'version': 'v1', 'created': 'Fri, 10 Sep 2021 11:15:40 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Dec 2021 23:10:20 GMT'}]",2022-02-17,"[['Kabir', 'Mohammad Ridwan', '', '1 and 3'], ['Abedin', 'Mohammad Ishrak', '', '2 and 3'], ['Ahmed', 'Rizvi', '', '2 and 3'], ['Mahmud', 'Hasan', '', '1 and 3'], ['Hasan', 'Md. Kamrul', '', '1 and 3']]","['Pointing tasks', 'Fitts’s law', 'Index of difficulty', 'Speed-accuracy trade-off', 'Contextual interaction', 'Uncontrolled']"
7840,2105.13602,Vivek Kumar Singh Ph.D.,"Vivek Kumar Singh, Satya Swarup Srichandan, Hiran H. Lathabai","ResearchGate and Google Scholar: How much do they differ in
  publications, citations and different metrics and why?",Pre-print,Scientometrics 2022,10.1007/s11192-022-04264-2,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  ResearchGate has emerged as a popular professional network for scientists and
researchers in a very short span of time. Similar to Google Scholar, the
ResearchGate indexing uses an automatic crawling algorithm that extracts
bibliographic data, citations and other information about scholarly articles
from various sources. However, it has been observed that the two platforms
often show different publication and citation data for the same institutions,
journals and authors. This paper, therefore, attempts to analyse and measure
the differences in publication counts, citations and different metrics of the
two platforms for a large data set of highly cited authors. The results
indicate that there are significantly high differences in publication counts
and citations for the same authors in the two platforms, with Google Scholar
having higher counts for a vast majority of the cases. The different metrics
computed by the two platforms also differ in their values, showing different
degrees of correlations. The coverage policy, indexing errors, author
attribution mechanism and strategy to deal with predatory publishing are found
to be the main probable reasons for the differences in the two platforms.
","[{'version': 'v1', 'created': 'Fri, 28 May 2021 06:09:54 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Jan 2022 05:41:07 GMT'}]",2022-01-31,"[['Singh', 'Vivek Kumar', ''], ['Srichandan', 'Satya Swarup', ''], ['Lathabai', 'Hiran H.', '']]","['Academic Social Networks', 'Altmetrics', 'Google Scholar', 'ResearchGate', 'Scientometrics']"
7841,1710.09055,Amritanshu Agrawal,"Amritanshu Agrawal, Akond Rahman, Rahul Krishna, Alexander Sobran, Tim
  Menzies","We Don't Need Another Hero? The Impact of ""Heroes"" on Software
  Development","8 pages + 1 references, Accepted to International conference on
  Software Engineering - Software Engineering in Practice, 2018","International conference on Software Engineering - Software
  Engineering in Practice, 2018",10.1145/3183519.3183549,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A software project has ""Hero Developers"" when 80% of contributions are
delivered by 20% of the developers. Are such heroes a good idea? Are too many
heroes bad for software quality? Is it better to have more/less heroes for
different kinds of projects? To answer these questions, we studied 661 open
source projects from Public open source software (OSS) Github and 171 projects
from an Enterprise Github.
  We find that hero projects are very common. In fact, as projects grow in
size, nearly all project become hero projects. These findings motivated us to
look more closely at the effects of heroes on software development. Analysis
shows that the frequency to close issues and bugs are not significantly
affected by the presence of project type (Public or Enterprise). Similarly, the
time needed to resolve an issue/bug/enhancement is not affected by heroes or
project type. This is a surprising result since, before looking at the data, we
expected that increasing heroes on a project will slow down howfast that
project reacts to change. However, we do find a statistically significant
association between heroes, project types, and enhancement resolution rates.
Heroes do not affect enhancement resolution rates in Public projects. However,
in Enterprise projects, the more heroes increase the rate at which project
complete enhancements.
  In summary, our empirical results call for a revision of a long-held truism
in software engineering. Software heroes are far more common and valuable than
suggested by the literature, particularly for medium to large Enterprise
developments. Organizations should reflect on better ways to find and retain
more of these heroes
","[{'version': 'v1', 'created': 'Wed, 25 Oct 2017 02:26:06 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Feb 2018 17:36:45 GMT'}]",2018-03-16,"[['Agrawal', 'Amritanshu', ''], ['Rahman', 'Akond', ''], ['Krishna', 'Rahul', ''], ['Sobran', 'Alexander', ''], ['Menzies', 'Tim', '']]","['Issue', 'Bug', 'Commit', 'Hero', 'Core', 'Github', 'Productivity']"
7842,2212.08996,Manuel Luis Delos Santos,"Manuel Luis C. Delos Santos (1), Ronaldo S. Tinio (2), Darwin B. Diaz
  (3) and Karlene Emily I. Tolosa (4), ((1)(3)(4) Asian Institute of Computer
  Studies, Philippines, (2) Pamantasan ng Lungsod ng Valezuela, Philippines)","Smart Face Shield: A Sensor-Based Wearable Face Shield Utilizing
  Computer Vision Algorithms",,"IJCSR Volume 6, October 2022, ISSN 2546-115X, pages 1-15",10.25147/ijcsr.2017.001.1.118,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The study aims the development of a wearable device to combat the onslaught
of covid-19. Likewise, to enhance the regular face shield available in the
market. Furthermore, to raise awareness of the health and safety protocols
initiated by the government and its affiliates in the enforcement of social
distancing with the integration of computer vision algorithms. The wearable
device was composed of various hardware and software components such as a
transparent polycarbonate face shield, microprocessor, sensors, camera,
thin-film transistor on-screen display, jumper wires, power bank, and python
programming language. The algorithm incorporated in the study was object
detection under computer vision machine learning. The front camera with OpenCV
technology determines the distance of a person in front of the user. Utilizing
TensorFlow, the target object identifies and detects the image or live feed to
get its bounding boxes. The focal length lens requires the determination of the
distance from the camera to the target object. To get the focal length,
multiply the pixel width by the known distance and divide it by the known width
(Rosebrock, 2020). The deployment of unit testing ensures that the parameters
are valid in terms of design and specifications.
","[{'version': 'v1', 'created': 'Sun, 18 Dec 2022 03:23:38 GMT'}]",2023-01-03,"[['Santos', 'Manuel Luis C. Delos', ''], ['Tinio', 'Ronaldo S.', ''], ['Diaz', 'Darwin B.', ''], ['Tolosa', 'Karlene Emily I.', '']]","['Algorithm', 'Face Shield', 'Computer Vision', 'Wearable   INTRODUCTION']"
7843,1802.01604,Chandrayee Basu,"Chandrayee Basu, Mukesh Singhal, Anca D. Dragan","Learning from Richer Human Guidance: Augmenting Comparison-Based
  Learning with Feature Queries","8 pages, 8 figures, HRI 2018",,10.1145/3171221.3171284,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We focus on learning the desired objective function for a robot. Although
trajectory demonstrations can be very informative of the desired objective,
they can also be difficult for users to provide. Answers to comparison queries,
asking which of two trajectories is preferable, are much easier for users, and
have emerged as an effective alternative. Unfortunately, comparisons are far
less informative. We propose that there is much richer information that users
can easily provide and that robots ought to leverage. We focus on augmenting
comparisons with feature queries, and introduce a unified formalism for
treating all answers as observations about the true desired reward. We derive
an active query selection algorithm, and test these queries in simulation and
on real users. We find that richer, feature-augmented queries can extract more
information faster, leading to robots that better match user preferences in
their behavior.
","[{'version': 'v1', 'created': 'Mon, 5 Feb 2018 19:03:26 GMT'}]",2018-02-07,"[['Basu', 'Chandrayee', ''], ['Singhal', 'Mukesh', ''], ['Dragan', 'Anca D.', '']]","['reward learning', 'comparison-based learning', 'learning from humanguidance', 'driving style']"
7844,2009.06679,Mohamed Nafzi,"Mohamed Nafzi, Michael Brauckmann, Tobias Glasmachers",Data Augmentation and Clustering for Vehicle Make/Model Classification,"Proceedings of the 2020 Computing Conference, Volume 1-3, SAI 16-17
  July 2020 London",,10.1007/978-3-030-52249-0_24,,cs.CV,http://creativecommons.org/publicdomain/zero/1.0/,"  Vehicle shape information is very important in Intelligent Traffic Systems
(ITS). In this paper we present a way to exploit a training data set of
vehicles released in different years and captured under different perspectives.
Also the efficacy of clustering to enhance the make/model classification is
presented. Both steps led to improved classification results and a greater
robustness. Deeper convolutional neural network based on ResNet architecture
has been designed for the training of the vehicle make/model classification.
The unequal class distribution of training data produces an a priori
probability. Its elimination, obtained by removing of the bias and through hard
normalization of the centroids in the classification layer, improves the
classification results. A developed application has been used to test the
vehicle re-identification on video data manually based on make/model and color
classification. This work was partially funded under the grant.
","[{'version': 'v1', 'created': 'Mon, 14 Sep 2020 18:24:31 GMT'}]",2020-09-16,"[['Nafzi', 'Mohamed', ''], ['Brauckmann', 'Michael', ''], ['Glasmachers', 'Tobias', '']]","['vehicle shape classification', 'clustering', 'CNN']"
7845,1907.02836,Lawrence Paulson,"Lawrence C. Paulson, Tobias Nipkow and Makarius Wenzel",From LCF to Isabelle/HOL,25 pages. Accepted to Formal Aspects of Computing,"Formal Aspects of Computing 31:6 (2019), 675-698",10.1007/s00165-019-00492-1,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interactive theorem provers have developed dramatically over the past four
decades, from primitive beginnings to today's powerful systems. Here, we focus
on Isabelle/HOL and its distinctive strengths. They include automatic proof
search, borrowing techniques from the world of first order theorem proving, but
also the automatic search for counterexamples. They include a highly readable
structured language of proofs and a unique interactive development environment
for editing live proof documents. Everything rests on the foundation conceived
by Robin Milner for Edinburgh LCF: a proof kernel, using abstract types to
ensure soundness and eliminate the need to store proofs. Compared with the
research prototypes of the 1970s, Isabelle is a practical and versatile tool.
It is used by system designers, mathematicians and many others.
","[{'version': 'v1', 'created': 'Fri, 5 Jul 2019 14:02:54 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Jul 2019 13:13:15 GMT'}]",2022-10-14,"[['Paulson', 'Lawrence C.', ''], ['Nipkow', 'Tobias', ''], ['Wenzel', 'Makarius', '']]","['LCF', 'HOL', 'Isabelle', 'interactive theorem proving']"
7846,2110.03168,Paul Syverson,"Paul Syverson, Matthew Finkel, Saba Eskandarian, Dan Boneh","Attacks on Onion Discovery and Remedies via Self-Authenticating
  Traditional Addresses","To appear in the ACM Workshop on Privacy in the Electronic Society
  (WPES '21)",,10.1145/3463676.3485610,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Onion addresses encode their own public key. They are thus
self-authenticating, one of the security and privacy advantages of onion
services, which are typically accessed via Tor Browser. Because of the mostly
random-looking appearance of onion addresses, a number of onion discovery
mechanisms have been created to permit routing to an onion address associated
with a more meaningful URL, such as a registered domain name.
  We describe novel vulnerabilities engendered by onion discovery mechanisms
recently introduced by Tor Browser that facilitate hijack and tracking of user
connections. We also recall previously known hijack and tracking
vulnerabilities engendered by use of alternative services that are facilitated
and rendered harder to detect if the alternative service is at an onion
address.
  Self-authenticating traditional addresses (SATAs) are valid DNS addresses or
URLs that also contain a commitment to an onion public key. We describe how the
use of SATAs in onion discovery counters these vulnerabilities. SATAs also
expand the value of onion discovery by facilitating self-authenticated access
from browsers that do not connect to services via the Tor network.
","[{'version': 'v1', 'created': 'Thu, 7 Oct 2021 03:48:23 GMT'}]",2021-10-08,"[['Syverson', 'Paul', ''], ['Finkel', 'Matthew', ''], ['Eskandarian', 'Saba', ''], ['Boneh', 'Dan', '']]","['Contextual Trust', 'Onion Services', 'Web PKI', 'TLS Certificates']"
7847,2112.10498,Mohammad Hossein Bahonar,Mohammad Hossein Bahonar and Mohammad Javad Omidi,"Distributed pricing-based resource allocation for dense device-to-device
  communications in beyond 5G networks","Transactions on Emerging Telecommunications Technologies (2021), 25
  Pages",,10.1002/ett.4250,,cs.IT math.IT,http://creativecommons.org/licenses/by/4.0/,"  Considering the dramatic increase of data rate demand in beyond fifth
generation (5G) networks due to the numerous transmitting nodes, dense
device-to-device (D2D) communications where multiple D2D pairs can
simultaneously reuse a cellular link can be considered as a communication
paradigm for future wireless networks. Since distributed methods can be more
practical compared to complex centralized schemes, we propose a low-complexity
distributed pricing-based resource allocation algorithm to allocate power to
cellular user equipments (CUEs) and D2D pairs constrained to the minimum
quality-of-service (QoS) requirements of CUEs and D2D pairs in two phases. The
price of each link is set by the base station (BS). CUEs and D2D pairs maximize
their rate-and-interference-dependent utility function by adjusting their power
in the first phase, while the price of each link is updated at the BS based on
the minimum QoS requirements of CUEs and D2D pairs in the second phase. The
proposed utility function controls D2D admission, hence it is suitable for
dense scenarios. The proposed method is fast due to the closed-form solution
for the first phase power allocation. Numerical results verify the
effectiveness of the proposed method for practical dense beyond 5G scenarios by
allocating resources to multiple D2D pairs and taking advantage of the spatial
reuse gain of D2D pairs. Furthermore, the utility function definition is
discussed to illustrate its effectiveness for SE maximization. Finally, the SE
of the proposed method is compared to other centralized and distributed
algorithms to demonstrate the higher sum-rate performance of the proposed
algorithm.
","[{'version': 'v1', 'created': 'Mon, 13 Dec 2021 14:01:53 GMT'}]",2021-12-21,"[['Bahonar', 'Mohammad Hossein', ''], ['Omidi', 'Mohammad Javad', '']]","['Device-to-device communications', 'pricing-based resource allocation', 'multiple D2D pairs', 'distributed']"
7848,2110.13300,Husam Suleiman,Husam Suleiman and Mohammad Hamdan,"Adaptive Probabilistic Model for Energy-Efficient Distance-based
  Clustering in WSNs (Adapt-P): A LEACH-based Analytical Study",,"pp. 65-86, Volume 12, Number 3, September 2021",10.22667/JOWUA.2021.09.30.065),,cs.NI cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Network lifetime and energy consumption of data transmission have been
primary Quality of Service (QoS) obligations in Wireless Sensor Networks
(WSNs). The environment of a WSN is often organized into clusters to mitigate
the management complexity of such obligations. However, the distance between
Sensor Nodes (SNs) and the number of clusters per round are vital factors that
affect QoS performance of a WSN. A designer's conundrum resolves around the
desire to sustain a balance between the limited residual energy of SNs and the
demand for prolonged network lifetime. Any imbalance in controlling such
objectives results in either QoS penalties due to draining SN energies, or an
over-cost environment that is significantly difficult to distribute and
operate. Low-Energy Adaptive Clustering Hierarchy (LEACH) is a distributed
algorithm proposed to tackle such difficulties. Proposed LEACH-based algorithms
focus on residual energies of SNs to compute a probability function that
selects cluster-heads and an optimal energy-efficient path toward a destination
SN. Nevertheless, these algorithms do not consider variations in network's
state at run-time. Such a state changes in an adaptive manner according to
existing network structures and conditions. Thus, cluster-heads per round are
not elected adaptively depending on the state and distances between SNs. This
paper proposes an energy-efficient adaptive distance-based clustering called
Adapt-P, in which an adaptive probability function is developed to formulate
clusters. A near-optimal distance between each cluster-head and its
cluster-members is formulated so that energy consumption of the network is
mitigated and network lifetime is maximized. The cluster-head selection
probability is adapted at the end of each round based on the maximum number of
cluster-heads permitted per round found a priori and the number of alive SNs in
the network.
","[{'version': 'v1', 'created': 'Mon, 25 Oct 2021 22:21:18 GMT'}]",2021-10-27,"[['Suleiman', 'Husam', ''], ['Hamdan', 'Mohammad', '']]","['Energy-Efficient Clustering', 'Cluster-Head Selection', 'LEACH', 'WSN']"
7849,2006.07790,Abolfazl Mohebbi,"Abolfazl Mohebbi, Sofiane Achiche and Luc Baron","A Fuzzy-based Framework to Support Multicriteria Design of Mechatronic
  Systems",,,10.1093/jcde/qwaa059,,cs.RO cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Designing a mechatronic system is a complex task since it deals with a high
number of system components with multi-disciplinary nature in the presence of
interacting design objectives. Currently, the sequential design is widely used
by designers in industries that deal with different domains and their
corresponding design objectives separately leading to a functional but not
necessarily an optimal result. Consequently, the need for a systematic and
multi-objective design methodology arises. A new conceptual design approach
based on a multi-criteria profile for mechatronic systems has been previously
presented by the authors which uses a series of nonlinear fuzzy-based
aggregation functions to facilitate decision-making for design evaluation in
the presence of interacting criteria. Choquet fuzzy integrals are one of the
most expressive and reliable preference models used in decision theory for
multicriteria decision making. They perform a weighted aggregation by the means
of fuzzy measures assigning a weight to any coalition of criteria. This enables
the designers to model importance and also interactions among criteria thus
covering an important range of possible decision outcomes. However,
specification of the fuzzy measures involves many parameters and is very
difficult when only relying on the designer's intuition. In this paper, we
discuss three different methods of fuzzy measure identification tailored for a
mechatronic design process and exemplified by a case study of designing a
vision-guided quadrotor drone. The results obtained from each method are
discussed in the end.
","[{'version': 'v1', 'created': 'Sun, 14 Jun 2020 04:03:27 GMT'}]",2020-08-25,"[['Mohebbi', 'Abolfazl', ''], ['Achiche', 'Sofiane', ''], ['Baron', 'Luc', '']]","['Mechatronic System', 'Multicriteria Design', 'Decision Support', 'Interacting Objectives', 'Fuzzy Measures']"
7850,1908.04484,C. H. Huck Yang,"Sheng-Chun Kao, Chao-Han Huck Yang, Pin-Yu Chen, Xiaoli Ma, Tushar
  Krishna","Reinforcement Learning based Interconnection Routing for Adaptive
  Traffic Optimization",,,10.1145/3313231.335236,,cs.NI cs.AI cs.AR cs.LG cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Applying Machine Learning (ML) techniques to design and optimize computer
architectures is a promising research direction. Optimizing the runtime
performance of a Network-on-Chip (NoC) necessitates a continuous learning
framework. In this work, we demonstrate the promise of applying reinforcement
learning (RL) to optimize NoC runtime performance. We present three RL-based
methods for learning optimal routing algorithms. The experimental results show
the algorithms can successfully learn a near-optimal solution across different
environment states. Reproducible Code:
github.com/huckiyang/interconnect-routing-gym
","[{'version': 'v1', 'created': 'Tue, 13 Aug 2019 04:35:40 GMT'}]",2019-08-14,"[['Kao', 'Sheng-Chun', ''], ['Yang', 'Chao-Han Huck', ''], ['Chen', 'Pin-Yu', ''], ['Ma', 'Xiaoli', ''], ['Krishna', 'Tushar', '']]","['Network-on-Chips', 'Intelligent Physical Systems', 'Reinforcement Learning', 'Congestion Control', 'Scalable Modeling']"
7851,2111.09526,Dong Xiao,"Dong Xiao, Siyou Lin, Zuoqiang Shi, Bin Wang",Learning Modified Indicator Functions for Surface Reconstruction,Accepted by Computers & Graphics from SMI 2021,,10.1016/j.cag.2021.10.017,,cs.CV cs.GR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Surface reconstruction is a fundamental problem in 3D graphics. In this
paper, we propose a learning-based approach for implicit surface reconstruction
from raw point clouds without normals. Our method is inspired by Gauss Lemma in
potential energy theory, which gives an explicit integral formula for the
indicator functions. We design a novel deep neural network to perform surface
integral and learn the modified indicator functions from un-oriented and noisy
point clouds. We concatenate features with different scales for accurate
point-wise contributions to the integral. Moreover, we propose a novel Surface
Element Feature Extractor to learn local shape properties. Experiments show
that our method generates smooth surfaces with high normal consistency from
point clouds with different noise scales and achieves state-of-the-art
reconstruction performance compared with current data-driven and
non-data-driven approaches.
","[{'version': 'v1', 'created': 'Thu, 18 Nov 2021 05:30:35 GMT'}, {'version': 'v2', 'created': 'Sun, 20 Feb 2022 11:19:07 GMT'}]",2022-02-22,"[['Xiao', 'Dong', ''], ['Lin', 'Siyou', ''], ['Shi', 'Zuoqiang', ''], ['Wang', 'Bin', '']]","['Surfacereconstruction', 'Un-orientedpointclouds', 'GaussLemma', 'Deep learning']"
7852,2204.00455,Jorge Melegati,Jorge Melegati and Xiaofeng Wang,"Digital Mentor: towards a conversational bot to identify hypotheses for
  software startups","4 pages, 2 figures, accepted for presentation at 4th International
  Workshop on Bots in Software Engineering (BotSE 2022)",,10.1145/3528228.3528407,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software startups develop innovative, software-intensive product and
services. This context leads to uncertainty regarding the software they are
building. Experimentation, a process of testing hypotheses about the product,
helps these companies to reduce uncertainty through different evidence-based
approaches. The first step in experimentation is to identify the hypotheses to
be tested. HyMap is a technique where a facilitator helps a software startup
founder to draw a cognitive map representing her understanding of the context
and, based on that, create hypotheses about the software to be built. In this
paper, we present the Digital Mentor, an working-in-progress conversational bot
to help creating a HyMap without the need of a human facilitator. We report the
proposed solution consisting of a web application with the backend of a natural
language understanding system, the current state of development, the challenges
we faced so far and the next steps we plan to move forward.
","[{'version': 'v1', 'created': 'Fri, 1 Apr 2022 14:07:11 GMT'}]",2022-04-04,"[['Melegati', 'Jorge', ''], ['Wang', 'Xiaofeng', '']]","['conversational bots', 'chatbots', 'software startups', 'hypotheses elicitation', 'HyMap']"
7853,2005.09140,Mina Zaminkar,Mina Zaminkar and Reza Fotohi,"SoS-RPL: Securing Internet of Things Against Sinkhole Attack Using RPL
  Protocol-Based Node Rating and Ranking Mechanism","26 pages, 11 figures, 10 tables, Wireless Pers Commun (2020)",,10.1007/s11277-020-07421-z,,cs.CR cs.CY cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Through the Internet of Things (IoT) the internet scope is established by the
integration of physical things to classify themselves into mutual things. A
physical thing can be created by this inventive perception to signify itself in
the digital world. Regarding the physical things that are related to the
internet, it is worth noting that considering numerous theories and upcoming
predictions, they mostly require protected structures, moreover, they are at
risk of several attacks. IoTs are endowed with particular routing disobedience
called sinkhole attack owing to their distributed features. In these attacks, a
malicious node broadcasts illusive information regarding the routings to impose
itself as a route towards specific nodes for the neighboring nodes and thus,
attract data traffic. RPL (IP-V6 routing protocol for efficient and low-energy
networks) is a standard routing protocol which is mainly employed in sensor
networks and IoT. This protocol is called SoS-RPL consisting of two key
sections of the sinkhole detection. In the first section rating and ranking the
nodes in the RPL is carried out based on distance measurements. The second
section is in charge of discovering the misbehavior sources within the IoT
network through, the Average Packet Transmission RREQ (APT-RREQ). Here, the
technique is assessed through wide simulations performed within the NS-3
environment. Based on the results of the simulation, it is indicated that the
IoT network behavior metrics are enhanced based on the detection rate,
false-negative rate, false-positive rate, packet delivery rate, maximum
throughput, and packet loss rate.
","[{'version': 'v1', 'created': 'Sun, 17 May 2020 09:26:09 GMT'}]",2020-05-20,"[['Zaminkar', 'Mina', ''], ['Fotohi', 'Reza', '']]","['Internet of Things (IoT)', 'Sinkhole attack', 'RPL']"
7854,2207.01498,"Heinrich S\""obke","Sebastian Damek, Heinrich S\""obke, Franziska Weise and Maria Reichelt","(Meta) Competences for Digital Practice: Educational Scenarios for the
  Workplace of the Future Exemplified by Building Information Modeling Work
  Processes","14 pages, 6 figures, 3 tables",,10.3390/knowledge2030027,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Workplaces of the future require advanced competence profiles from employees,
not least due to new options for teleworking and new complex digital tools. The
acquisition of advanced competence profiles is to be addressed by formal
education. For example, the method of Building Information Modeling (BIM) aims
at digitizing the design, construction, and operation of structures and as such
requires advanced competence profiles. In this study, two educational scenarios
based on teleworking and complex digital tools are compared, each with one
cohort and consisting of two learning activities. The first cohort initially
completes as first learning activity a semester-long course that aims at BIM
domain competences. The semester-long course of the second cohort fosters meta
competences, such as communication, collaboration, and digital literacy. At the
end of the semester, both cohorts solve in a second learning activity a BIM
practice task. Research questions are: (1) Do the two educational scenarios
promote the competences to be addressed? And related: (2) What is the impact of
the initial course that fosters domain competences or meta competences?
Methodologically, the learning outcomes are assessed by measuring the domain
competences three times during the educational scenario using online tests in
the two cohorts (N=11). Further, students' perceptions are surveyed in parallel
using online questionnaires. In addition, semi-structured interviews are
conducted at the end of the educational scenarios. The quantitative and
qualitative results of the study designating the training of meta competencies
partly as a substitute for imparting domain competences are presented. Further,
the influence of both educational scenarios on competence development for the
workplace of the future characterized by telework and digital tools is
discussed.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2022 18:33:14 GMT'}]",2022-09-05,"[['Damek', 'Sebastian', ''], ['Söbke', 'Heinrich', ''], ['Weise', 'Franziska', ''], ['Reichelt', 'Maria', '']]","['skill', 'meta skill', 'communication', 'collaboration', 'digital literacy']"
7855,2211.10766,Hanuma Teja Maddali,Hanuma Teja Maddali and Amanda Lazar,Sociality and Skill Sharing in the Garden,13 pages,"Proceedings of the 2020 CHI Conference on Human Factors in
  Computing Systems (CHI '20). Association for Computing Machinery, New York,
  NY, USA, 1-13",10.1145/3313831.3376246,,cs.HC cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Gardening is an activity that involves a number of dimensions of increasing
interest to HCI and CSCW researchers, including recreation, sustainability, and
engagement with nature. This paper considers the garden setting in order to
understand the role that collaborative and social computing technologies might
play for practitioners engaging in outdoor skilled activities. We conducted
participant observations with nine experienced gardeners aged 22-71 years.
Through this process, we find that gardeners continuously configure their
environments to accommodate their preferences for sociality. They share
embodied skills and help others attune to sensory information in person, but
also influence learning through the features in their garden that are observed
by others. This paper provides an understanding of sociality in the garden,
highlights skill sharing as a key domain for design in this space, and
contributes design considerations for collaborative technologies in outdoor
settings.
","[{'version': 'v1', 'created': 'Sat, 19 Nov 2022 18:34:11 GMT'}]",2022-11-22,"[['Maddali', 'Hanuma Teja', ''], ['Lazar', 'Amanda', '']]","['Gardening', 'sociality', 'skill sharing', 'participant observation']"
7856,2103.02588,Wei Chen,"Jun Wang, Wei Wayne Chen, Daicong Da, Mark Fuge, Rahul Rai","IH-GAN: A Conditional Generative Model for Implicit Surface-Based
  Inverse Design of Cellular Structures","Accepted by Computer Methods in Applied Mechanics and Engineering
  (CMAME)",,10.1016/j.cma.2022.115060,,cs.CE cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Variable-density cellular structures can overcome connectivity and
manufacturability issues of topologically optimized structures, particularly
those represented as discrete density maps. However, the optimization of such
cellular structures is challenging due to the multiscale design problem. Past
work addressing this problem generally either only optimizes the volume
fraction of single-type unit cells but ignores the effects of unit cell
geometry on properties, or considers the geometry-property relation but builds
this relation via heuristics. In contrast, we propose a simple yet more
principled way to accurately model the property to geometry mapping using a
conditional deep generative model, named Inverse Homogenization Generative
Adversarial Network (IH-GAN). It learns the conditional distribution of unit
cell geometries given properties and can realize the one-to-many mapping from
properties to geometries. We further reduce the complexity of IH-GAN by using
the implicit function parameterization to represent unit cell geometries.
Results show that our method can 1) generate various unit cells that satisfy
given material properties with high accuracy ($R^2$-scores between target
properties and properties of generated unit cells $>98\%$) and 2) improve the
optimized structural performance over the conventional variable-density
single-type structure. In the minimum compliance example, our IH-GAN generated
structure achieves a $79.7\%$ reduction in concentrated stress and an extra
$3.03\%$ reduction in displacement. In the target deformation examples, our
IH-GAN generated structure reduces the target matching error by $86.4\%$ and
$79.6\%$ for two test cases, respectively. We also demonstrated that the
connectivity issue for multi-type unit cells can be solved by transition layer
blending.
","[{'version': 'v1', 'created': 'Wed, 3 Mar 2021 18:39:25 GMT'}, {'version': 'v2', 'created': 'Sun, 10 Oct 2021 06:25:31 GMT'}, {'version': 'v3', 'created': 'Wed, 9 Mar 2022 05:53:53 GMT'}, {'version': 'v4', 'created': 'Wed, 27 Apr 2022 04:19:47 GMT'}, {'version': 'v5', 'created': 'Thu, 12 May 2022 03:48:49 GMT'}]",2022-06-08,"[['Wang', 'Jun', ''], ['Chen', 'Wei Wayne', ''], ['Da', 'Daicong', ''], ['Fuge', 'Mark', ''], ['Rai', 'Rahul', '']]","['Inverse design', 'cellular structure design', 'homogenization', 'generative adversarial network', 'topology optimization']"
7857,2001.11495,Rishabh Singh,Rishabh Singh and Jose C. Principe,"Towards a Kernel based Uncertainty Decomposition Framework for Data and
  Models",,"Neural Computation, 33(5):1164-1198, 2021",10.1162/neco_a_01372,,cs.LG eess.SP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a new framework for quantifying predictive uncertainty
for both data and models that relies on projecting the data into a Gaussian
reproducing kernel Hilbert space (RKHS) and transforming the data probability
density function (PDF) in a way that quantifies the flow of its gradient as a
topological potential field quantified at all points in the sample space. This
enables the decomposition of the PDF gradient flow by formulating it as a
moment decomposition problem using operators from quantum physics, specifically
the Schrodinger's formulation. We experimentally show that the higher order
modes systematically cluster the different tail regions of the PDF, thereby
providing unprecedented discriminative resolution of data regions having high
epistemic uncertainty. In essence, this approach decomposes local realizations
of the data PDF in terms of uncertainty moments. We apply this framework as a
surrogate tool for predictive uncertainty quantification of point-prediction
neural network models, overcoming various limitations of conventional Bayesian
based uncertainty quantification methods. Experimental comparisons with some
established methods illustrate performance advantages exhibited by our
framework.
","[{'version': 'v1', 'created': 'Thu, 30 Jan 2020 18:35:36 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Feb 2020 10:21:43 GMT'}, {'version': 'v3', 'created': 'Sun, 21 Jun 2020 06:24:31 GMT'}, {'version': 'v4', 'created': 'Tue, 1 Dec 2020 14:42:13 GMT'}]",2021-09-24,"[['Singh', 'Rishabh', ''], ['Principe', 'Jose C.', '']]","['Model uncertainty', 'RKHS', 'point-prediction', 'neural networks', 'quantum']"
7858,2111.07271,Auriol Degbelo,"Lucas Braun, Auriol Degbelo, Christian Kray","Geofreebie: A Location-Based Freecycling App to Support Forced Migrant
  Resettlement","Article accepted for publication in the Journal of Location-based
  Services",,10.1080/17489725.2021.1874553,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Germany has witnessed an influx of forced migrants in recent years. Promoting
social interaction with the local community is key to supporting the
resettlement of these newcomers. Location-based freecycling services present
important benefits due to freecycling's potential to bolster social engagement
and location-based services' ability to adapt to the user's context. Yet, their
potential to support forced migrants' resettlement is yet to be examined. We
conducted needs assessment interviews with 11 participants in Muenster,
Germany. We analyzed the interview results to develop user requirements for
location-based freecycling services. We then implemented a subset of the user
requirements as a prototype mobile app called Geofreebie. The evaluation of the
app with 22 participants showed that Geofreebie offered two key advantages for
forced migrants' resettlement: it increased the size of their social network,
and created a sense of community on their side. These findings can benefit
researchers and developers of location-based services to support forced migrant
resettlement.
","[{'version': 'v1', 'created': 'Sun, 14 Nov 2021 08:12:46 GMT'}]",2021-11-16,"[['Braun', 'Lucas', ''], ['Degbelo', 'Auriol', ''], ['Kray', 'Christian', '']]","['forced migrant resettlement', 'freecycling', 'location-based services', 'usercentered design', 'social integration']"
7859,2212.07754,Irene Perez-Salesa,"Irene Perez-Salesa, Rodrigo Aldana-Lopez, Carlos Sagues",Event-based Visual Tracking in Dynamic Environments,"This preprint has not undergone peer review or any post-submission
  improvements or corrections. The Version of Record of this contribution is
  published in ROBOT2022: Fifth Iberian Robotics Conference","In ROBOT2022: Fifth Iberian Robotics Conference. Lecture Notes in
  Networks and Systems, vol 589. Springer, Cham (2023)",10.1007/978-3-031-21065-5_15,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visual object tracking under challenging conditions of motion and light can
be hindered by the capabilities of conventional cameras, prone to producing
images with motion blur. Event cameras are novel sensors suited to robustly
perform vision tasks under these conditions. However, due to the nature of
their output, applying them to object detection and tracking is non-trivial. In
this work, we propose a framework to take advantage of both event cameras and
off-the-shelf deep learning for object tracking. We show that reconstructing
event data into intensity frames improves the tracking performance in
conditions under which conventional cameras fail to provide acceptable results.
","[{'version': 'v1', 'created': 'Thu, 15 Dec 2022 12:18:13 GMT'}]",2022-12-16,"[['Perez-Salesa', 'Irene', ''], ['Aldana-Lopez', 'Rodrigo', ''], ['Sagues', 'Carlos', '']]","['Visual tracking', 'deep learning for visual perception', 'event cameras']"
7860,2010.00912,Antoine Boutet,"Vasisht Duddu, Antoine Boutet, Virat Shejwalkar","GECKO: Reconciling Privacy, Accuracy and Efficiency in Embedded Deep
  Learning","10 pages. The 37th ACM/SIGAPP Symposium on Applied Computing
  (SAC'22), 2022",,10.1145/3477314.3507128,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Embedded systems demand on-device processing of data using Neural Networks
(NNs) while conforming to the memory, power and computation constraints,
leading to an efficiency and accuracy tradeoff. To bring NNs to edge devices,
several optimizations such as model compression through pruning, quantization,
and off-the-shelf architectures with efficient design have been extensively
adopted. These algorithms when deployed to real world sensitive applications,
requires to resist inference attacks to protect privacy of users training data.
However, resistance against inference attacks is not accounted for designing NN
models for IoT. In this work, we analyse the three-dimensional
privacy-accuracy-efficiency tradeoff in NNs for IoT devices and propose Gecko
training methodology where we explicitly add resistance to private inferences
as a design objective. We optimize the inference-time memory, computation, and
power constraints of embedded devices as a criterion for designing NN
architecture while also preserving privacy. We choose quantization as design
choice for highly efficient and private models. This choice is driven by the
observation that compressed models leak more information compared to baseline
models while off-the-shelf efficient architectures indicate poor efficiency and
privacy tradeoff. We show that models trained using Gecko methodology are
comparable to prior defences against black-box membership attacks in terms of
accuracy and privacy while providing efficiency.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2020 10:36:55 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Apr 2021 09:13:10 GMT'}, {'version': 'v3', 'created': 'Sun, 9 Jan 2022 14:33:25 GMT'}]",2022-01-11,"[['Duddu', 'Vasisht', ''], ['Boutet', 'Antoine', ''], ['Shejwalkar', 'Virat', '']]","['Membership Privacy', 'Inference Attacks', 'Efficient Deep Learning', 'Embedded Computing']"
7861,2001.07809,Subhayan Mukherjee,"Subhayan Mukherjee, Ram Mohana Reddy Guddeti","Depth-Based Selective Blurring in Stereo Images Using Accelerated
  Framework",arXiv admin note: text overlap with arXiv:2001.06967,"3D Research (Springer) 5, Article number: 14 (2014)",10.1007/s13319-014-0014-7,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a hybrid method for stereo disparity estimation by combining block
and region-based stereo matching approaches. It generates dense depth maps from
disparity measurements of only 18 % image pixels (left or right). The
methodology involves segmenting pixel lightness values using fast K-Means
implementation, refining segment boundaries using morphological filtering and
connected components analysis; then determining boundaries' disparities using
sum of absolute differences (SAD) cost function. Complete disparity maps are
reconstructed from boundaries' disparities. We consider an application of our
method for depth-based selective blurring of non-interest regions of stereo
images, using Gaussian blur to de-focus users' non-interest regions.
Experiments on Middlebury dataset demonstrate that our method outperforms
traditional disparity estimation approaches using SAD and normalized cross
correlation by up to 33.6 % and some recent methods by up to 6.1 %. Further,
our method is highly parallelizable using CPU and GPU framework based on Java
Thread Pool and APARAPI with speed-up of 5.8 for 250 stereo video frames (4,096
x 2,304).
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2020 23:26:39 GMT'}]",2020-01-23,"[['Mukherjee', 'Subhayan', ''], ['Guddeti', 'Ram Mohana Reddy', '']]","['Depth-based  Selective  Blurring', 'Stereo  Depth  Estimation', 'Sparse']"
7862,1805.01187,Tim Libert,Timothy Libert,"An Automated Approach to Auditing Disclosure of Third-Party Data
  Collection in Website Privacy Policies",,WWW '18 Proceedings of the 2018 World Wide Web Conference,10.1145/3178876.3186087,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A dominant regulatory model for web privacy is ""notice and choice"". In this
model, users are notified of data collection and provided with options to
control it. To examine the efficacy of this approach, this study presents the
first large-scale audit of disclosure of third-party data collection in website
privacy policies. Data flows on one million websites are analyzed and over
200,000 websites' privacy policies are audited to determine if users are
notified of the names of the companies which collect their data. Policies from
25 prominent third-party data collectors are also examined to provide deeper
insights into the totality of the policy environment. Policies are additionally
audited to determine if the choice expressed by the ""Do Not Track"" browser
setting is respected.
  Third-party data collection is wide-spread, but fewer than 15% of attributed
data flows are disclosed. The third-parties most likely to be disclosed are
those with consumer services users may be aware of, those without consumer
services are less likely to be mentioned. Policies are difficult to understand
and the average time requirement to read both a given site{\guillemotright}s
policy and the associated third-party policies exceeds 84 minutes. Only 7% of
first-party site policies mention the Do Not Track signal, and the majority of
such mentions are to specify that the signal is ignored. Among third-party
policies examined, none offer unqualified support for the Do Not Track signal.
Findings indicate that current implementations of ""notice and choice"" fail to
provide notice or respect choice.
","[{'version': 'v1', 'created': 'Thu, 3 May 2018 09:40:58 GMT'}]",2018-05-04,"[['Libert', 'Timothy', '']]","['Web Privacy', 'Web Security', 'Internet Policy', 'Internet Regulation']"
7863,2201.06774,Raviraj Joshi,"Snehal Khandve, Vedangi Wagh, Apurva Wani, Isha Joshi, Raviraj Joshi",Hierarchical Neural Network Approaches for Long Document Classification,"Accepted at International Conference on Machine Learning and
  Computing (ICMLC) 2022",,10.1145/3529836.3529935,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Text classification algorithms investigate the intricate relationships
between words or phrases and attempt to deduce the document's interpretation.
In the last few years, these algorithms have progressed tremendously.
Transformer architecture and sentence encoders have proven to give superior
results on natural language processing tasks. But a major limitation of these
architectures is their applicability for text no longer than a few hundred
words. In this paper, we explore hierarchical transfer learning approaches for
long document classification. We employ pre-trained Universal Sentence Encoder
(USE) and Bidirectional Encoder Representations from Transformers (BERT) in a
hierarchical setup to capture better representations efficiently. Our proposed
models are conceptually simple where we divide the input data into chunks and
then pass this through base models of BERT and USE. Then output representation
for each chunk is then propagated through a shallow neural network comprising
of LSTMs or CNNs for classifying the text data. These extensions are evaluated
on 6 benchmark datasets. We show that USE + CNN/LSTM performs better than its
stand-alone baseline. Whereas the BERT + CNN/LSTM performs on par with its
stand-alone counterpart. However, the hierarchical BERT models are still
desirable as it avoids the quadratic complexity of the attention mechanism in
BERT. Along with the hierarchical approaches, this work also provides a
comparison of different deep learning algorithms like USE, BERT, HAN,
Longformer, and BigBird for long document classification. The Longformer
approach consistently performs well on most of the datasets.
","[{'version': 'v1', 'created': 'Tue, 18 Jan 2022 07:17:40 GMT'}]",2022-06-28,"[['Khandve', 'Snehal', ''], ['Wagh', 'Vedangi', ''], ['Wani', 'Apurva', ''], ['Joshi', 'Isha', ''], ['Joshi', 'Raviraj', '']]","['Transformer', 'BERT', 'CNN', 'LSTM', 'Universal sentence encoder', 'Document Classification', 'Hierarchical Approaches']"
7864,2205.05598,Alex Sim,"Julian Bellavita, Alex Sim, Kesheng Wu, Inder Monga, Chin Guok, Frank
  W\""urthwein, Diego Davila","Studying Scientific Data Lifecycle in On-demand Distributed Storage
  Caches",,,10.1145/3526064.3534111,,cs.DC cs.NI cs.SY eess.SY,http://creativecommons.org/licenses/by-sa/4.0/,"  The XRootD system is used to transfer, store, and cache large datasets from
high-energy physics (HEP). In this study we focus on its capability as
distributed on-demand storage cache. Through exploring a large set of daily log
files between 2020 and 2021, we seek to understand the data access patterns
that might inform future cache design. Our study begins with a set of summary
statistics regarding file read operations, file lifetimes, and file transfers.
We observe that the number of read operations on each file remains nearly
constant, while the average size of a read operation grows over time.
Furthermore, files tend to have a consistent length of time during which they
remain open and are in use. Based on this comprehensive study of the cache
access statistics, we developed a cache simulator to explore the behavior of
caches of different sizes. Within a certain size range, we find that increasing
the XRootD cache size improves the cache hit rate, yielding faster overall file
access. In particular, we find that increase the cache size from 40TB to 56TB
could increase the hit rate from 0.62 to 0.89, which is a significant increase
in cache effectiveness for modest cost.
","[{'version': 'v1', 'created': 'Wed, 11 May 2022 16:14:52 GMT'}]",2022-05-12,"[['Bellavita', 'Julian', ''], ['Sim', 'Alex', ''], ['Wu', 'Kesheng', ''], ['Monga', 'Inder', ''], ['Guok', 'Chin', ''], ['Würthwein', 'Frank', ''], ['Davila', 'Diego', '']]","['distributed cache', 'XRootD', 'data', 'file', 'lifecycle']"
7865,1909.01904,Ryan Shah,"Shishir Nagaraja, Ryan Shah",VoIPLoc: Passive VoIP call provenance via acoustic side-channels,"12 pages, 8 figures, 5 tables",,10.1145/3448300.3467816,,cs.CR cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  We propose VoIPLoc, a novel location fingerprinting technique and apply it to
the VoIP call provenance problem. It exploits echo-location information
embedded within VoIP audio to support fine-grained location inference. We found
consistent statistical features induced by the echo-reflection characteristics
of the location into recorded speech. These features are discernible within
traces received at the VoIP destination, enabling location inference. We
evaluated VoIPLoc by developing a dataset of audio traces received through VoIP
channels over the Tor network. We show that recording locations can be
fingerprinted and detected remotely with a low false-positive rate, even when a
majority of the audio samples are unlabelled. Finally, we note that the
technique is fully passive and thus undetectable, unlike prior art. VoIPLoc is
robust to the impact of environmental noise and background sounds, as well as
the impact of compressive codecs and network jitter. The technique is also
highly scalable and offers several degrees of freedom terms of the
fingerprintable space.
","[{'version': 'v1', 'created': 'Wed, 4 Sep 2019 15:55:46 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Jun 2021 10:14:28 GMT'}]",2021-06-11,"[['Nagaraja', 'Shishir', ''], ['Shah', 'Ryan', '']]","['VoIPsecurity', 'callprovenance', 'sourceidentification', 'locationprivacy', 'acoustic fingerprint']"
7866,2109.13879,Alessio Fagioli,"Danilo Avola, Luigi Cinque, Alessio Fagioli, Gian Luca Foresti,
  Adriano Fragomeni, Daniele Pannone","3D Hand Pose and Shape Estimation from RGB Images for Keypoint-Based
  Hand Gesture Recognition",,,10.1016/j.patcog.2022.108762,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Estimating the 3D pose of a hand from a 2D image is a well-studied problem
and a requirement for several real-life applications such as virtual reality,
augmented reality, and hand gesture recognition. Currently, reasonable
estimations can be computed from single RGB images, especially when a
multi-task learning approach is used to force the system to consider the shape
of the hand when its pose is determined. However, depending on the method used
to represent the hand, the performance can drop considerably in real-life
tasks, suggesting that stable descriptions are required to achieve satisfactory
results. In this paper, we present a keypoint-based end-to-end framework for 3D
hand and pose estimation and successfully apply it to the task of hand gesture
recognition as a study case. Specifically, after a pre-processing step in which
the images are normalized, the proposed pipeline uses a multi-task semantic
feature extractor generating 2D heatmaps and hand silhouettes from RGB images,
a viewpoint encoder to predict the hand and camera view parameters, a stable
hand estimator to produce the 3D hand pose and shape, and a loss function to
guide all of the components jointly during the learning phase. Tests were
performed on a 3D pose and shape estimation benchmark dataset to assess the
proposed framework, which obtained state-of-the-art performance. Our system was
also evaluated on two hand-gesture recognition benchmark datasets and
significantly outperformed other keypoint-based approaches, indicating that it
is an effective solution that is able to generate stable 3D estimates for hand
pose and shape.
","[{'version': 'v1', 'created': 'Tue, 28 Sep 2021 17:07:43 GMT'}, {'version': 'v2', 'created': 'Mon, 9 May 2022 17:22:19 GMT'}]",2022-05-10,"[['Avola', 'Danilo', ''], ['Cinque', 'Luigi', ''], ['Fagioli', 'Alessio', ''], ['Foresti', 'Gian Luca', ''], ['Fragomeni', 'Adriano', ''], ['Pannone', 'Daniele', '']]","['Hand Pose Estimation', 'Hand Shape Estimation', 'Deep Learning', 'Hand Gesture Recognition']"
7867,2208.02606,Felipe Portella,"Felipe Albuquerque Portella, David Buchaca Prats, Jos\'e Roberto
  Pereira Rodrigues, Josep Llu\'is Berral",TunaOil: A Tuning Algorithm Strategy for Reservoir Simulation Workloads,"21 pages, 9 figures. Preprint submitted to Journal of Computational
  Science",,10.1016/j.jocs.2022.101811,,cs.CE cs.AI cs.PF,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Reservoir simulations for petroleum fields and seismic imaging are known as
the most demanding workloads for high-performance computing (HPC) in the oil
and gas (O&G) industry. The optimization of the simulator numerical parameters
plays a vital role as it could save considerable computational efforts.
State-of-the-art optimization techniques are based on running numerous
simulations, specific for that purpose, to find good parameter candidates.
However, using such an approach is highly costly in terms of time and computing
resources. This work presents TunaOil, a new methodology to enhance the search
for optimal numerical parameters of reservoir flow simulations using a
performance model. In the O&G industry, it is common to use ensembles of models
in different workflows to reduce the uncertainty associated with forecasting
O&G production. We leverage the runs of those ensembles in such workflows to
extract information from each simulation and optimize the numerical parameters
in their subsequent runs.
  To validate the methodology, we implemented it in a history matching (HM)
process that uses a Kalman filter algorithm to adjust an ensemble of reservoir
models to match the observed data from the real field. We mine past execution
logs from many simulations with different numerical configurations and build a
machine learning model based on extracted features from the data. These
features include properties of the reservoir models themselves, such as the
number of active cells, to statistics of the simulation's behavior, such as the
number of iterations of the linear solver. A sampling technique is used to
query the oracle to find the numerical parameters that can reduce the elapsed
time without significantly impacting the quality of the results. Our
experiments show that the predictions can improve the overall HM workflow
runtime on average by 31%.
","[{'version': 'v1', 'created': 'Thu, 4 Aug 2022 12:11:13 GMT'}]",2022-08-05,"[['Portella', 'Felipe Albuquerque', ''], ['Prats', 'David Buchaca', ''], ['Rodrigues', 'José Roberto Pereira', ''], ['Berral', 'Josep Lluís', '']]","['Petroleum Reservoirs', 'Reservoir Simulation', 'Parameter Tuning', 'Machine Learning', 'Performance Model']"
7868,2109.00788,Attaullah Sahito,"Attaullah Sahito, Eibe Frank, and Bernhard Pfahringer","Transfer of Pretrained Model Weights Substantially Improves
  Semi-Supervised Image Classification",added link to code and data repo,"In: AI 2020: Advances in Artificial Intelligence. AI 2020 .
  Lecture Notes in Computer Science, vol 12576. Springer, Cham",10.1007/978-3-030-64984-5_34,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Deep neural networks produce state-of-the-art results when trained on a large
number of labeled examples but tend to overfit when small amounts of labeled
examples are used for training. Creating a large number of labeled examples
requires considerable resources, time, and effort. If labeling new data is not
feasible, so-called semi-supervised learning can achieve better generalisation
than purely supervised learning by employing unlabeled instances as well as
labeled ones. The work presented in this paper is motivated by the observation
that transfer learning provides the opportunity to potentially further improve
performance by exploiting models pretrained on a similar domain. More
specifically, we explore the use of transfer learning when performing
semi-supervised learning using self-learning. The main contribution is an
empirical evaluation of transfer learning using different combinations of
similarity metric learning methods and label propagation algorithms in
semi-supervised learning. We find that transfer learning always substantially
improves the model's accuracy when few labeled examples are available,
regardless of the type of loss used for training the neural network. This
finding is obtained by performing extensive experiments on the SVHN, CIFAR10,
and Plant Village image classification datasets and applying pretrained weights
from Imagenet for transfer learning.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2021 08:58:34 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Sep 2021 22:42:22 GMT'}]",2021-09-13,"[['Sahito', 'Attaullah', ''], ['Frank', 'Eibe', ''], ['Pfahringer', 'Bernhard', '']]","['Semi-supervised learning', 'Transfer learning', 'Self-learning', 'Triplet loss', 'Contrastive loss', 'Arcface loss']"
7869,2210.05512,Amin Abolghasemi,"Amin Abolghasemi, Arian Askari, Suzan Verberne","On the Interpolation of Contextualized Term-based Ranking with BM25 for
  Query-by-Example Retrieval","Proceedings of the 2022 ACM SIGIR International Conference on the
  Theory of Information Retrieval",,10.1145/3539813.3545133,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Term-based ranking with pre-trained transformer-based language models has
recently gained attention as they bring the contextualization power of
transformer models into the highly efficient term-based retrieval. In this
work, we examine the generalizability of two of these deep contextualized
term-based models in the context of query-by-example (QBE) retrieval in which a
seed document acts as the query to find relevant documents. In this setting --
where queries are much longer than common keyword queries -- BERT inference at
query time is problematic as it involves quadratic complexity. We investigate
TILDE and TILDEv2, both of which leverage BERT tokenizer as their query
encoder. With this approach, there is no need for BERT inference at query time,
and also the query can be of any length. Our extensive evaluation on the four
QBE tasks of SciDocs benchmark shows that in a query-by-example retrieval
setting TILDE and TILDEv2 are still less effective than a cross-encoder BERT
ranker. However, we observe that BM25 could show a competitive ranking quality
compared to TILDE and TILDEv2 which is in contrast to the findings about the
relative performance of these three models on retrieval for short queries
reported in prior work. This result raises the question about the use of
contextualized term-based ranking models being beneficial in QBE setting. We
follow-up on our findings by studying the score interpolation between the
relevance score from TILDE (TILDEv2) and BM25. We conclude that these two
contextualized term-based ranking models capture different relevance signals
than BM25 and combining the different term-based rankers results in
statistically significant improvements in QBE retrieval. Our work sheds light
on the challenges of retrieval settings different from the common evaluation
benchmarks.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2022 15:03:39 GMT'}]",2022-10-12,"[['Abolghasemi', 'Amin', ''], ['Askari', 'Arian', ''], ['Verberne', 'Suzan', '']]","['Query-by-example retrieval', 'term-based retrieval', 'Transformer models', 'BERT-based ranking']"
7870,1908.09119,Varun Pandya,Varun Pandya,Automatic Text Summarization of Legal Cases: A Hybrid Approach,"Part of 5th International Conference on Natural Language Processing
  (NATP 2019) Proceedings",,10.5121/csit.2019.91004,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Manual Summarization of large bodies of text involves a lot of human effort
and time, especially in the legal domain. Lawyers spend a lot of time preparing
legal briefs of their clients' case files. Automatic Text summarization is a
constantly evolving field of Natural Language Processing(NLP), which is a
subdiscipline of the Artificial Intelligence Field. In this paper a hybrid
method for automatic text summarization of legal cases using k-means clustering
technique and tf-idf(term frequency-inverse document frequency) word vectorizer
is proposed. The summary generated by the proposed method is compared using
ROGUE evaluation parameters with the case summary as prepared by the lawyer for
appeal in court. Further, suggestions for improving the proposed method are
also presented.
","[{'version': 'v1', 'created': 'Sat, 24 Aug 2019 10:05:40 GMT'}]",2019-08-27,"[['Pandya', 'Varun', '']]","['Automatic Text Summarization', 'Legal domain', 'k-means clustering', 'tf-idf word vectors']"
7871,2009.12914,Yingjie Hu,Yingjie Hu and Jimin Wang,"How do people describe locations during a natural disaster: an analysis
  of tweets from Hurricane Harvey","11th International Conference on Geographic Information Science
  (GIScience 2021)",,10.4230/LIPIcs.GIScience.2021.I.6,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media platforms, such as Twitter, have been increasingly used by
people during natural disasters to share information and request for help.
Hurricane Harvey was a category 4 hurricane that devastated Houston, Texas, USA
in August 2017 and caused catastrophic flooding in the Houston metropolitan
area. Hurricane Harvey also witnessed the widespread use of social media by the
general public in response to this major disaster, and geographic locations are
key information pieces described in many of the social media messages. A
geoparsing system, or a geoparser, can be utilized to automatically extract and
locate the described locations, which can help first responders reach the
people in need. While a number of geoparsers have already been developed, it is
unclear how effective they are in recognizing and geo-locating the locations
described by people during natural disasters. To fill this gap, this work seeks
to understand how people describe locations during a natural disaster by
analyzing a sample of tweets posted during Hurricane Harvey. We then identify
the limitations of existing geoparsers in processing these tweets, and discuss
possible approaches to overcoming these limitations.
","[{'version': 'v1', 'created': 'Sun, 27 Sep 2020 18:17:09 GMT'}]",2020-09-29,"[['Hu', 'Yingjie', ''], ['Wang', 'Jimin', '']]","['Geoparsing', 'geographic informational retrieval', 'social media', 'tweet analysis', 'disaster response']"
7872,1606.01113,Kuang Zhou,"Kuang Zhou (DRUID), Arnaud Martin (DRUID), Quan Pan, Zhun-Ga Liu",ECMdd: Evidential c-medoids clustering with multiple prototypes,,"Pattern Recognition, Elsevier, 2016",10.1016/j.patcog.2016.05.005,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, a new prototype-based clustering method named Evidential
C-Medoids (ECMdd), which belongs to the family of medoid-based clustering for
proximity data, is proposed as an extension of Fuzzy C-Medoids (FCMdd) on the
theoretical framework of belief functions. In the application of FCMdd and
original ECMdd, a single medoid (prototype), which is supposed to belong to the
object set, is utilized to represent one class. For the sake of clarity, this
kind of ECMdd using a single medoid is denoted by sECMdd. In real clustering
applications, using only one pattern to capture or interpret a class may not
adequately model different types of group structure and hence limits the
clustering performance. In order to address this problem, a variation of ECMdd
using multiple weighted medoids, denoted by wECMdd, is presented. Unlike
sECMdd, in wECMdd objects in each cluster carry various weights describing
their degree of representativeness for that class. This mechanism enables each
class to be represented by more than one object. Experimental results in
synthetic and real data sets clearly demonstrate the superiority of sECMdd and
wECMdd. Moreover, the clustering results by wECMdd can provide richer
information for the inner structure of the detected classes with the help of
prototype weights.
","[{'version': 'v1', 'created': 'Fri, 3 Jun 2016 14:44:15 GMT'}]",2016-06-06,"[['Zhou', 'Kuang', '', 'DRUID'], ['Martin', 'Arnaud', '', 'DRUID'], ['Pan', 'Quan', ''], ['Liu', 'Zhun-Ga', '']]","['Credal partitions', 'Relational clustering', 'Multiple prototypes', 'Imprecise classes']"
7873,2208.11384,Riku Togashi,"Yoji Tomita, Riku Togashi, Daisuke Moriwaki",Matching Theory-based Recommender Systems in Online Dating,Accepted as RecSys'22 Industrial Talk Poster,,10.1145/3523227.3547406,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online dating platforms provide people with the opportunity to find a
partner. Recommender systems in online dating platforms suggest one side of
users to the other side of users. We discuss the potential interactions between
reciprocal recommender systems (RRSs) and matching theory. We present our
ongoing project to deploy a matching theory-based recommender system (MTRS) in
a real-world online dating platform.
","[{'version': 'v1', 'created': 'Wed, 24 Aug 2022 09:02:33 GMT'}]",2022-08-25,"[['Tomita', 'Yoji', ''], ['Togashi', 'Riku', ''], ['Moriwaki', 'Daisuke', '']]","['reciprocal recommender systems', 'online dating', 'matching theory']"
7874,2008.12014,Ilias Chalkidis,"John Koutsikakis, Ilias Chalkidis, Prodromos Malakasiotis and Ion
  Androutsopoulos",GREEK-BERT: The Greeks visiting Sesame Street,"8 pages, 1 figure, 11th Hellenic Conference on Artificial
  Intelligence (SETN 2020)",,10.1145/3411408.3411440,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transformer-based language models, such as BERT and its variants, have
achieved state-of-the-art performance in several downstream natural language
processing (NLP) tasks on generic benchmark datasets (e.g., GLUE, SQUAD, RACE).
However, these models have mostly been applied to the resource-rich English
language. In this paper, we present GREEK-BERT, a monolingual BERT-based
language model for modern Greek. We evaluate its performance in three NLP
tasks, i.e., part-of-speech tagging, named entity recognition, and natural
language inference, obtaining state-of-the-art performance. Interestingly, in
two of the benchmarks GREEK-BERT outperforms two multilingual Transformer-based
models (M-BERT, XLM-R), as well as shallower neural baselines operating on
pre-trained word embeddings, by a large margin (5%-10%). Most importantly, we
make both GREEK-BERT and our training code publicly available, along with code
illustrating how GREEK-BERT can be fine-tuned for downstream NLP tasks. We
expect these resources to boost NLP research and applications for modern Greek.
","[{'version': 'v1', 'created': 'Thu, 27 Aug 2020 09:36:14 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Sep 2020 08:41:35 GMT'}]",2020-09-04,"[['Koutsikakis', 'John', ''], ['Chalkidis', 'Ilias', ''], ['Malakasiotis', 'Prodromos', ''], ['Androutsopoulos', 'Ion', '']]","['Deep Neural Networks', 'Natural Language Processing', 'Pre-trainedLanguage Models', 'Transformers', 'Greek NLP Resources']"
7875,2005.03324,Pranab K. Muhuri Dr.,"Aparna Basu, Deepika Malhotra, Taniya Seth, and Pranab K. Muhuri","Global Distribution of Google Scholar Citations: A Size-independent
  Institution-based Analysis",,"Journal of Scientometric Research 8, no. 2 (2019): 72-78",10.5530/jscires.8.2.12,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most currently available schemes for performance based ranking of
Universities or Research organizations, such as, Quacarelli Symonds (QS), Times
Higher Education (THE), Shanghai University based All Research of World
Universities (ARWU) use a variety of criteria that include productivity,
citations, awards, reputation, etc., while Leiden and Scimago use only
bibliometric indicators. The research performance evaluation in the aforesaid
cases is based on bibliometric data from Web of Science or Scopus, which are
commercially available priced databases. The coverage includes peer reviewed
journals and conference proceedings. Google Scholar (GS) on the other hand,
provides a free and open alternative to obtaining citations of papers available
on the net, (though it is not clear exactly which journals are covered.)
Citations are collected automatically from the net and also added to self
created individual author profiles under Google Scholar Citations (GSC). This
data was used by Webometrics Lab, Spain to create a ranked list of 4000+
institutions in 2016, based on citations from only the top 10 individual GSC
profiles in each organization. (GSC excludes the top paper for reasons
explained in the text; the simple selection procedure makes the ranked list
size-independent as claimed by the Cybermetrics Lab). Using this data
(Transparent Ranking TR, 2016), we find the regional and country wise
distribution of GS-TR Citations. The size independent ranked list is subdivided
into deciles of 400 institutions each and the number of institutions and
citations of each country obtained for each decile. We test for correlation
between institutional ranks between GS TR and the other ranking schemes for the
top 20 institutions.
","[{'version': 'v1', 'created': 'Thu, 7 May 2020 08:47:21 GMT'}]",2020-06-28,"[['Basu', 'Aparna', ''], ['Malhotra', 'Deepika', ''], ['Seth', 'Taniya', ''], ['Muhuri', 'Pranab K.', '']]","['Google Scholar Citations', 'Citation', 'Open indicators', 'World Ranking of Universities']"
7876,2205.00033,Jakob Schoeffer,Jakob Schoeffer,"A Human-Centric Perspective on Fairness and Transparency in Algorithmic
  Decision-Making","CHI Conference on Human Factors in Computing Systems Extended
  Abstracts (CHI '22 Extended Abstracts), April 29--May 5, 2022, New Orleans,
  LA, USA",,10.1145/3491101.3503811,,cs.AI cs.HC cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Automated decision systems (ADS) are increasingly used for consequential
decision-making. These systems often rely on sophisticated yet opaque machine
learning models, which do not allow for understanding how a given decision was
arrived at. This is not only problematic from a legal perspective, but
non-transparent systems are also prone to yield unfair outcomes because their
sanity is challenging to assess and calibrate in the first place -- which is
particularly worrisome for human decision-subjects. Based on this observation
and building upon existing work, I aim to make the following three main
contributions through my doctoral thesis: (a) understand how (potential)
decision-subjects perceive algorithmic decisions (with varying degrees of
transparency of the underlying ADS), as compared to similar decisions made by
humans; (b) evaluate different tools for transparent decision-making with
respect to their effectiveness in enabling people to appropriately assess the
quality and fairness of ADS; and (c) develop human-understandable technical
artifacts for fair automated decision-making. Over the course of the first half
of my PhD program, I have already addressed substantial pieces of (a) and (c),
whereas (b) will be the major focus of the second half.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2022 18:31:04 GMT'}]",2022-05-03,"[['Schoeffer', 'Jakob', '']]","['Algorithmic decision-making', 'explanations', 'fairness']"
7877,2003.02126,Qian Chen,"Qian Chen, Wen Wang",Sequential Neural Networks for Noetic End-to-End Response Selection,"26 pages, 3 figures, Computer Speech & Language. arXiv admin note:
  substantial text overlap with arXiv:1901.02609","Computer Speech & Language, Volume 62, July 2020, 101072",10.1016/j.csl.2020.101072,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The noetic end-to-end response selection challenge as one track in the 7th
Dialog System Technology Challenges (DSTC7) aims to push the state of the art
of utterance classification for real world goal-oriented dialog systems, for
which participants need to select the correct next utterances from a set of
candidates for the multi-turn context. This paper presents our systems that are
ranked top 1 on both datasets under this challenge, one focused and small
(Advising) and the other more diverse and large (Ubuntu). Previous
state-of-the-art models use hierarchy-based (utterance-level and token-level)
neural networks to explicitly model the interactions among different turns'
utterances for context modeling. In this paper, we investigate a sequential
matching model based only on chain sequence for multi-turn response selection.
Our results demonstrate that the potentials of sequential matching approaches
have not yet been fully exploited in the past for multi-turn response
selection. In addition to ranking top 1 in the challenge, the proposed model
outperforms all previous models, including state-of-the-art hierarchy-based
models, on two large-scale public multi-turn response selection benchmark
datasets.
","[{'version': 'v1', 'created': 'Tue, 3 Mar 2020 04:36:33 GMT'}]",2020-03-05,"[['Chen', 'Qian', ''], ['Wang', 'Wen', '']]","['DSTC7', 'response selection', 'ESIM', 'BERT', 'end-to-end', 'sequential matchingapproaches']"
7878,2204.10362,Charles Clarke,"Xinyi Yan, Chengxi Luo, Charles L. A. Clarke, Nick Craswell, Ellen M.
  Voorhees, Pablo Castells",Human Preferences as Dueling Bandits,"To appear in 45th International ACM SIGIR Conference on Research and
  Development in Information Retrieval. Associated code and data is available
  at https://github.com/XinyiYan/duelingBandits",,10.1145/3477495.3531991,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The dramatic improvements in core information retrieval tasks engendered by
neural rankers create a need for novel evaluation methods. If every ranker
returns highly relevant items in the top ranks, it becomes difficult to
recognize meaningful differences between them and to build reusable test
collections. Several recent papers explore pairwise preference judgments as an
alternative to traditional graded relevance assessments. Rather than viewing
items one at a time, assessors view items side-by-side and indicate the one
that provides the better response to a query, allowing fine-grained
distinctions. If we employ preference judgments to identify the probably best
items for each query, we can measure rankers by their ability to place these
items as high as possible. We frame the problem of finding best items as a
dueling bandits problem. While many papers explore dueling bandits for online
ranker evaluation via interleaving, they have not been considered as a
framework for offline evaluation via human preference judgments. We review the
literature for possible solutions. For human preference judgments, any usable
algorithm must tolerate ties, since two items may appear nearly equal to
assessors, and it must minimize the number of judgments required for any
specific pair, since each such comparison requires an independent assessor.
Since the theoretical guarantees provided by most algorithms depend on
assumptions that are not satisfied by human preference judgments, we simulate
selected algorithms on representative test cases to provide insight into their
practical utility. Based on these simulations, one algorithm stands out for its
potential. Our simulations suggest modifications to further improve its
performance. Using the modified algorithm, we collect over 10,000 preference
judgments for submissions to the TREC 2021 Deep Learning Track, confirming its
suitability.
","[{'version': 'v1', 'created': 'Thu, 21 Apr 2022 18:47:35 GMT'}]",2022-04-25,"[['Yan', 'Xinyi', ''], ['Luo', 'Chengxi', ''], ['Clarke', 'Charles L. A.', ''], ['Craswell', 'Nick', ''], ['Voorhees', 'Ellen M.', ''], ['Castells', 'Pablo', '']]","['offline evaluation', 'preferences', 'dueling bandits']"
7879,2204.12750,Dongyoon Hwang,"Hojoon Lee, Dongyoon Hwang, Hyunseung Kim, Byungkun Lee, Jaegul Choo","DraftRec: Personalized Draft Recommendation for Winning in Multi-Player
  Online Battle Arena Games",Accepted to WWW 2022,,10.1145/3485447.3512278,,cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  This paper presents a personalized character recommendation system for
Multiplayer Online Battle Arena (MOBA) games which are considered as one of the
most popular online video game genres around the world. When playing MOBA
games, players go through a draft stage, where they alternately select a
virtual character to play. When drafting, players select characters by not only
considering their character preferences, but also the synergy and competence of
their team's character combination. However, the complexity of drafting induces
difficulties for beginners to choose the appropriate characters based on the
characters of their team while considering their own champion preferences. To
alleviate this problem, we propose DraftRec, a novel hierarchical model which
recommends characters by considering each player's champion preferences and the
interaction between the players. DraftRec consists of two networks: the player
network and the match network. The player network captures the individual
player's champion preference, and the match network integrates the complex
relationship between the players and their respective champions. We train and
evaluate our model from a manually collected 280,000 matches of League of
Legends and a publicly available 50,000 matches of Dota2. Empirically, our
method achieved state-of-the-art performance in character recommendation and
match outcome prediction task. Furthermore, a comprehensive user survey
confirms that DraftRec provides convincing and satisfying recommendations. Our
code and dataset are available at https://github.com/dojeon-ai/DraftRec.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2022 07:46:17 GMT'}]",2022-04-28,"[['Lee', 'Hojoon', ''], ['Hwang', 'Dongyoon', ''], ['Kim', 'Hyunseung', ''], ['Lee', 'Byungkun', ''], ['Choo', 'Jaegul', '']]","['MOBA', 'League of Legends', 'Dota2', 'Draft Recommendation']"
7880,2111.00869,Liangcai Su,"He Li, Shiyu Zhang, Xuejiao Li, Liangcai Su, Hongjie Huang, Duo Jin,
  Linghao Chen, Jianbing Huang, Jaesoo Yoo","DetectorNet: Transformer-enhanced Spatial Temporal Graph Neural Network
  for Traffic Prediction","The 29th ACM SIGSPATIAL International Conference on Advances in
  Geographic Information Systems (ACM SIGSPATIAL 2021)",,10.1145/3474717.3483920,,cs.CV cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detectors with high coverage have direct and far-reaching benefits for road
users in route planning and avoiding traffic congestion, but utilizing these
data presents unique challenges including: the dynamic temporal correlation,
and the dynamic spatial correlation caused by changes in road conditions.
Although the existing work considers the significance of modeling with
spatial-temporal correlation, what it has learned is still a static road
network structure, which cannot reflect the dynamic changes of roads, and
eventually loses much valuable potential information. To address these
challenges, we propose DetectorNet enhanced by Transformer. Differs from
previous studies, our model contains a Multi-view Temporal Attention module and
a Dynamic Attention module, which focus on the long-distance and short-distance
temporal correlation, and dynamic spatial correlation by dynamically updating
the learned knowledge respectively, so as to make accurate prediction. In
addition, the experimental results on two public datasets and the comparison
results of four ablation experiments proves that the performance of DetectorNet
is better than the eleven advanced baselines.
","[{'version': 'v1', 'created': 'Tue, 19 Oct 2021 03:47:38 GMT'}]",2021-11-02,"[['Li', 'He', ''], ['Zhang', 'Shiyu', ''], ['Li', 'Xuejiao', ''], ['Su', 'Liangcai', ''], ['Huang', 'Hongjie', ''], ['Jin', 'Duo', ''], ['Chen', 'Linghao', ''], ['Huang', 'Jianbing', ''], ['Yoo', 'Jaesoo', '']]","['Spatial-Temporal Graph', 'Traffic Prediction', 'Graph Neural Network', 'Self-attention']"
7881,2004.09188,Anh Viet Do,"Anh Viet Do, Jakob Bossek, Aneta Neumann, Frank Neumann",Evolving Diverse Sets of Tours for the Travelling Salesperson Problem,"11 pages, 3 tables, 3 figures, published in GECCO '20; proof of
  Theorem 1 corrected",,10.1145/3377930.3389844,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evolving diverse sets of high quality solutions has gained increasing
interest in the evolutionary computation literature in recent years. With this
paper, we contribute to this area of research by examining evolutionary
diversity optimisation approaches for the classical Traveling Salesperson
Problem (TSP). We study the impact of using different diversity measures for a
given set of tours and the ability of evolutionary algorithms to obtain a
diverse set of high quality solutions when adopting these measures. Our studies
show that a large variety of diverse high quality tours can be achieved by
using our approaches. Furthermore, we compare our approaches in terms of
theoretical properties and the final set of tours obtained by the evolutionary
diversity optimisation algorithm.
","[{'version': 'v1', 'created': 'Mon, 20 Apr 2020 10:34:07 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Oct 2021 07:28:54 GMT'}]",2021-10-04,"[['Do', 'Anh Viet', ''], ['Bossek', 'Jakob', ''], ['Neumann', 'Aneta', ''], ['Neumann', 'Frank', '']]","['Evolutionary algorithms', 'diversity maximisation', 'travelling salesperson problem']"
7882,2206.01702,Mouxiang Chen,"Mouxiang Chen, Chenghao Liu, Zemin Liu, Jianling Sun",Scalar is Not Enough: Vectorization-based Unbiased Learning to Rank,Accepted by KDD 2022,,10.1145/3534678.3539468,,cs.IR cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Unbiased learning to rank (ULTR) aims to train an unbiased ranking model from
biased user click logs. Most of the current ULTR methods are based on the
examination hypothesis (EH), which assumes that the click probability can be
factorized into two scalar functions, one related to ranking features and the
other related to bias factors. Unfortunately, the interactions among features,
bias factors and clicks are complicated in practice, and usually cannot be
factorized in this independent way. Fitting click data with EH could lead to
model misspecification and bring the approximation error.
  In this paper, we propose a vector-based EH and formulate the click
probability as a dot product of two vector functions. This solution is complete
due to its universality in fitting arbitrary click functions. Based on it, we
propose a novel model named Vectorization to adaptively learn the relevance
embeddings and sort documents by projecting embeddings onto a base vector.
Extensive experiments show that our method significantly outperforms the
state-of-the-art ULTR methods on complex real clicks as well as simple
simulated clicks.
","[{'version': 'v1', 'created': 'Fri, 3 Jun 2022 17:23:25 GMT'}, {'version': 'v2', 'created': 'Sun, 12 Jun 2022 12:27:57 GMT'}]",2022-06-14,"[['Chen', 'Mouxiang', ''], ['Liu', 'Chenghao', ''], ['Liu', 'Zemin', ''], ['Sun', 'Jianling', '']]","['learning to rank', 'unbiased learning to rank', 'examination hypothesis']"
7883,2209.01327,Hui Xiao,"Hui Xiao, Li Dong, Kangkang Song, Hao Xu, Shuibo Fu, Diqun Yan,
  Chengbin Peng",Semi-Supervised Semantic Segmentation with Cross Teacher Training,"31 papges, 8 figures, 9 tables","Neurocomputing,Volume 508,2022,Pages 36-46",10.1016/j.neucom.2022.08.052,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convolutional neural networks can achieve remarkable performance in semantic
segmentation tasks. However, such neural network approaches heavily rely on
costly pixel-level annotation. Semi-supervised learning is a promising
resolution to tackle this issue, but its performance still far falls behind the
fully supervised counterpart. This work proposes a cross-teacher training
framework with three modules that significantly improves traditional
semi-supervised learning approaches. The core is a cross-teacher module, which
could simultaneously reduce the coupling among peer networks and the error
accumulation between teacher and student networks. In addition, we propose two
complementary contrastive learning modules. The high-level module can transfer
high-quality knowledge from labeled data to unlabeled ones and promote
separation between classes in feature space. The low-level module can encourage
low-quality features learning from the high-quality features among peer
networks. In experiments, the cross-teacher module significantly improves the
performance of traditional student-teacher approaches, and our framework
outperforms stateof-the-art methods on benchmark datasets. Our source code of
CTT will be released.
","[{'version': 'v1', 'created': 'Sat, 3 Sep 2022 05:02:03 GMT'}]",2022-09-07,"[['Xiao', 'Hui', ''], ['Dong', 'Li', ''], ['Song', 'Kangkang', ''], ['Xu', 'Hao', ''], ['Fu', 'Shuibo', ''], ['Yan', 'Diqun', ''], ['Peng', 'Chengbin', '']]","['semantic segmentation', 'semi-supervised learning', 'student-teacher']"
7884,1908.07414,Rishabh Misra,"Rishabh Misra, Prahal Arora",Sarcasm Detection using Hybrid Neural Network,,,10.13140/RG.2.2.32427.39204,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Sarcasm Detection has enjoyed great interest from the research community,
however the task of predicting sarcasm in a text remains an elusive problem for
machines. Past studies mostly make use of twitter datasets collected using
hashtag based supervision but such datasets are noisy in terms of labels and
language. To overcome these shortcoming, we introduce a new dataset which
contains news headlines from a sarcastic news website and a real news website.
Next, we propose a hybrid Neural Network architecture with attention mechanism
which provides insights about what actually makes sentences sarcastic. Through
experiments, we show that the proposed model improves upon the baseline by ~ 5%
in terms of classification accuracy.
","[{'version': 'v1', 'created': 'Tue, 20 Aug 2019 15:10:31 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Oct 2022 22:43:14 GMT'}]",2022-10-17,"[['Misra', 'Rishabh', ''], ['Arora', 'Prahal', '']]","['News Dataset', 'Interpretable Neural Networks', 'Sarcasm Detection']"
7885,2205.09542,Yuxin Zhang,"Yuxin Zhang, Fan Tang, Weiming Dong, Haibin Huang, Chongyang Ma,
  Tong-Yee Lee, Changsheng Xu",Domain Enhanced Arbitrary Image Style Transfer via Contrastive Learning,Accepted by SIGGRAPH 2022,,10.1145/3528233.3530736,,cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we tackle the challenging problem of arbitrary image style
transfer using a novel style feature representation learning method. A suitable
style representation, as a key component in image stylization tasks, is
essential to achieve satisfactory results. Existing deep neural network based
approaches achieve reasonable results with the guidance from second-order
statistics such as Gram matrix of content features. However, they do not
leverage sufficient style information, which results in artifacts such as local
distortions and style inconsistency. To address these issues, we propose to
learn style representation directly from image features instead of their
second-order statistics, by analyzing the similarities and differences between
multiple styles and considering the style distribution. Specifically, we
present Contrastive Arbitrary Style Transfer (CAST), which is a new style
representation learning and style transfer method via contrastive learning. Our
framework consists of three key components, i.e., a multi-layer style projector
for style code encoding, a domain enhancement module for effective learning of
style distribution, and a generative network for image style transfer. We
conduct qualitative and quantitative evaluations comprehensively to demonstrate
that our approach achieves significantly better results compared to those
obtained via state-of-the-art methods. Code and models are available at
https://github.com/zyxElsa/CAST_pytorch
","[{'version': 'v1', 'created': 'Thu, 19 May 2022 13:11:24 GMT'}, {'version': 'v2', 'created': 'Fri, 20 May 2022 11:51:55 GMT'}]",2022-11-08,"[['Zhang', 'Yuxin', ''], ['Tang', 'Fan', ''], ['Dong', 'Weiming', ''], ['Huang', 'Haibin', ''], ['Ma', 'Chongyang', ''], ['Lee', 'Tong-Yee', ''], ['Xu', 'Changsheng', '']]","['Arbitrary style transfer', 'contrastive learning', 'style encoding']"
7886,2109.08213,Tony Tohme,"Tony Tohme, Kevin Vanslette, Kamal Youcef-Toumi",Reliable Neural Networks for Regression Uncertainty Estimation,,"Reliability Engineering & System Safety, January 2023, Volume 229,
  108811",10.1016/j.ress.2022.108811,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While deep neural networks are highly performant and successful in a wide
range of real-world problems, estimating their predictive uncertainty remains a
challenging task. To address this challenge, we propose and implement a loss
function for regression uncertainty estimation based on the Bayesian Validation
Metric (BVM) framework while using ensemble learning. The proposed loss
reproduces maximum likelihood estimation in the limiting case. A series of
experiments on in-distribution data show that the proposed method is
competitive with existing state-of-the-art methods. Experiments on
out-of-distribution data show that the proposed method is robust to statistical
change and exhibits superior predictive capability.
","[{'version': 'v1', 'created': 'Thu, 16 Sep 2021 20:32:58 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Oct 2022 03:32:17 GMT'}]",2022-10-14,"[['Tohme', 'Tony', ''], ['Vanslette', 'Kevin', ''], ['Youcef-Toumi', 'Kamal', '']]","['Neural Networks', 'Reliability', 'Regression', 'Predictive Uncertainty Estimation']"
7887,1907.05112,Max Frei,Max Frei and Frank Einar Kruis,"Image-Based Size Analysis of Agglomerated and Partially Sintered
  Particles via Convolutional Neural Networks","17 pages, 20 figures, 4 tables; supplementary materials",,10.1016/j.powtec.2019.10.020,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a high demand for fully automated methods for the analysis of
primary particle size distributions of agglomerated, sintered or occluded
primary particles, due to their impact on material properties. Therefore, a
novel, deep learning-based, method for the detection of such primary particles
was proposed and tested, which renders a manual tuning of analysis parameters
unnecessary. As a specialty, the training of the utilized convolutional neural
networks was carried out using only synthetic images, thereby avoiding the
laborious task of manual annotation and increasing the ground truth quality.
Nevertheless, the proposed method performs excellent on real world samples of
sintered silica nanoparticles with various sintering degrees and varying image
conditions. In a direct comparison, the proposed method clearly outperforms two
state-of-the-art methods for automated image-based particle size analysis
(Hough transformation and the ImageJ ParticleSizer plug-in), thereby attaining
human-like performance.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2019 11:12:17 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Jul 2019 20:43:35 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Nov 2019 22:42:13 GMT'}]",2019-11-20,"[['Frei', 'Max', ''], ['Kruis', 'Frank Einar', '']]","['imaging particle size analysis', 'agglomerate', 'convolutional neural network (CNN)', 'Mask R-CNN', 'Houghtransformation', 'ImageJ ParticleSizer']"
7888,1904.06052,Silvio Peroni,"Ivan Heibi, Silvio Peroni, David Shotton","COCI, the OpenCitations Index of Crossref open DOI-to-DOI citations",Submitted to Scientometrics (https://link.springer.com/journal/11192),,10.1007/s11192-019-03217-6,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we present COCI, the OpenCitations Index of Crossref open
DOI-to-DOI citations (http://opencitations.net/index/coci). COCI is the first
open citation index created by OpenCitations, in which we have applied the
concept of citations as first-class data entities, and it contains more than
445 million DOI-to-DOI citation links derived from the data available in
Crossref. These citations are described in RDF by means of the newly extended
version of the OpenCitations Data Model (OCDM). We introduce the workflow we
have developed for creating these data, and also show the additional services
that facilitate the access to and querying of these data via different access
points: a SPARQL endpoint, a REST API, bulk downloads, Web interfaces, and
direct access to the citations via HTTP content negotiation. Finally, we
present statistics regarding the use of COCI citation data, and we introduce
several projects that have already started to use COCI data for different
purposes.
","[{'version': 'v1', 'created': 'Fri, 12 Apr 2019 06:20:47 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Jul 2019 20:52:50 GMT'}]",2019-09-25,"[['Heibi', 'Ivan', ''], ['Peroni', 'Silvio', ''], ['Shotton', 'David', '']]","['Crossref citation data', 'open citations', 'open citation data', 'RDF', 'reproducible bibliometrics']"
7889,2104.05565,Victor Uc-Cetina,"Victor Uc-Cetina, Nicolas Navarro-Guerrero, Anabel Martin-Gonzalez,
  Cornelius Weber, Stefan Wermter",Survey on reinforcement learning for language processing,,Artificial Intelligence Review 2022,10.1007/s10462-022-10205-5,,cs.CL cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  In recent years some researchers have explored the use of reinforcement
learning (RL) algorithms as key components in the solution of various natural
language processing tasks. For instance, some of these algorithms leveraging
deep neural learning have found their way into conversational systems. This
paper reviews the state of the art of RL methods for their possible use for
different problems of natural language processing, focusing primarily on
conversational systems, mainly due to their growing relevance. We provide
detailed descriptions of the problems as well as discussions of why RL is
well-suited to solve them. Also, we analyze the advantages and limitations of
these methods. Finally, we elaborate on promising research directions in
natural language processing that might benefit from reinforcement learning.
","[{'version': 'v1', 'created': 'Mon, 12 Apr 2021 15:33:11 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Mar 2022 17:00:00 GMT'}, {'version': 'v3', 'created': 'Tue, 15 Mar 2022 21:02:38 GMT'}]",2022-06-09,"[['Uc-Cetina', 'Victor', ''], ['Navarro-Guerrero', 'Nicolas', ''], ['Martin-Gonzalez', 'Anabel', ''], ['Weber', 'Cornelius', ''], ['Wermter', 'Stefan', '']]","['reinforcement learning', 'natural language processing', 'conversational systems', 'parsing', 'translation', 'text generation']"
7890,1906.00131,Arsh Javed Rehman,"Arsh Javed Rehman, Pradeep Tomar",Decision-Making in Reinforcement Learning,"4 pages, 1 figure",,10.13140/RG.2.2.12367.33443,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this research work, probabilistic decision-making approaches are studied,
e.g. Bayesian and Boltzmann strategies, along with various deterministic
exploration strategies, e.g. greedy, epsilon-Greedy and random approaches. In
this research work, a comparative study has been done between probabilistic and
deterministic decision-making approaches, the experiments are performed in
OpenAI gym environment, solving Cart Pole problem. This research work discusses
about the Bayesian approach to decision-making in deep reinforcement learning,
and about dropout, how it can reduce the computational cost. All the
exploration approaches are compared. It also discusses about the importance of
exploration in deep reinforcement learning, and how improving exploration
strategies may help in science and technology. This research work shows how
probabilistic decision-making approaches are better in the long run as compared
to the deterministic approaches. When there is uncertainty, Bayesian dropout
approach proved to be better than all other approaches in this research work.
","[{'version': 'v1', 'created': 'Sat, 1 Jun 2019 02:36:42 GMT'}]",2019-06-04,"[['Rehman', 'Arsh Javed', ''], ['Tomar', 'Pradeep', '']]","['Reinforcement Learning', 'Deep Q Network', 'Bayesian Approach', 'Exploration and Exploitation Trade-Off', 'Deep Reinforcement Learning']"
7891,2009.11684,Fenglin Li,"Feng-Lin Li, Hehong Chen, Guohai Xu, Tian Qiu, Feng Ji, Ji Zhang,
  Haiqing Chen","AliMe KG: Domain Knowledge Graph Construction and Application in
  E-commerce",,,10.1145/3340531.3412685,,cs.AI cs.CL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Pre-sales customer service is of importance to E-commerce platforms as it
contributes to optimizing customers' buying process. To better serve users, we
propose AliMe KG, a domain knowledge graph in E-commerce that captures user
problems, points of interests (POI), item information and relations thereof. It
helps to understand user needs, answer pre-sales questions and generate
explanation texts. We applied AliMe KG to several online business scenarios
such as shopping guide, question answering over properties and recommendation
reason generation, and gained positive results. In the paper, we systematically
introduce how we construct domain knowledge graph from free text, and
demonstrate its business value with several applications. Our experience shows
that mining structured knowledge from free text in vertical domain is
practicable, and can be of substantial value in industrial settings.
","[{'version': 'v1', 'created': 'Thu, 24 Sep 2020 13:40:18 GMT'}]",2020-09-25,"[['Li', 'Feng-Lin', ''], ['Chen', 'Hehong', ''], ['Xu', 'Guohai', ''], ['Qiu', 'Tian', ''], ['Ji', 'Feng', ''], ['Zhang', 'Ji', ''], ['Chen', 'Haiqing', '']]","['E-commerce', 'Pre-Sales Customer Service', 'Domain Knowledge Graph']"
7892,2210.02785,Min H. Kim,"Andreas Meuleman, Hakyeong Kim, James Tompkin, Min H. Kim",FloatingFusion: Depth from ToF and Image-stabilized Stereo Cameras,,"ECCV 2022, Part I, LNCS 13661",10.1007/978-3-031-19769-7_35,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  High-accuracy per-pixel depth is vital for computational photography, so
smartphones now have multimodal camera systems with time-of-flight (ToF) depth
sensors and multiple color cameras. However, producing accurate high-resolution
depth is still challenging due to the low resolution and limited active
illumination power of ToF sensors. Fusing RGB stereo and ToF information is a
promising direction to overcome these issues, but a key problem remains: to
provide high-quality 2D RGB images, the main color sensor's lens is optically
stabilized, resulting in an unknown pose for the floating lens that breaks the
geometric relationships between the multimodal image sensors. Leveraging ToF
depth estimates and a wide-angle RGB camera, we design an automatic calibration
technique based on dense 2D/3D matching that can estimate camera extrinsic,
intrinsic, and distortion parameters of a stabilized main RGB sensor from a
single snapshot. This lets us fuse stereo and ToF cues via a correlation
volume. For fusion, we apply deep learning via a real-world training dataset
with depth supervision estimated by a neural reconstruction method. For
evaluation, we acquire a test dataset using a commercial high-power depth
camera and show that our approach achieves higher accuracy than existing
baselines.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2022 09:57:09 GMT'}]",2022-10-07,"[['Meuleman', 'Andreas', ''], ['Kim', 'Hakyeong', ''], ['Tompkin', 'James', ''], ['Kim', 'Min H.', '']]","['Online camera calibration', '3D imaging', 'depth estimation', 'multi-modal sensor fusion', 'stereo imaging', 'time of flight']"
7893,2103.10264,Shobhit Jain,"Shobhit Jain, George Haller","How to Compute Invariant Manifolds and their Reduced Dynamics in
  High-Dimensional Finite-Element Models",,Nonlinear Dynamics (2021),10.1007/s11071-021-06957-4,,cs.CE math.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Invariant manifolds are important constructs for the quantitative and
qualitative understanding of nonlinear phenomena in dynamical systems. In
nonlinear damped mechanical systems, for instance, spectral submanifolds have
emerged as useful tools for the computation of forced response curves, backbone
curves, detached resonance curves (isolas) via exact reduced-order models. For
conservative nonlinear mechanical systems, Lyapunov subcenter manifolds and
their reduced dynamics provide a way to identify nonlinear amplitude-frequency
relationships in the form of conservative backbone curves. Despite these
powerful predictions offered by invariant manifolds, their use has largely been
limited to low-dimensional academic examples. This is because several
challenges render their computation unfeasible for realistic engineering
structures described by finite-element models. In this work, we address these
computational challenges and develop methods for computing invariant manifolds
and their reduced dynamics in very high-dimensional nonlinear systems arising
from spatial discretization of the governing partial differential equations. We
illustrate our computational algorithms on finite-element models of mechanical
structures that range from a simple beam containing tens of degrees of freedom
to an aircraft wing containing more than a hundred-thousand degrees of freedom.
","[{'version': 'v1', 'created': 'Thu, 18 Mar 2021 14:01:11 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Sep 2021 09:50:19 GMT'}]",2021-10-15,"[['Jain', 'Shobhit', ''], ['Haller', 'George', '']]","['Invariant manifolds', 'Finite Elements', 'Reduced-order modeling', 'Spectral Submanifolds', 'Lyapunov Subcenter manifolds', 'Center manifolds', 'Normal forms']"
7894,2008.00836,Qiao Liu,"Qiao Liu, Xin Li, Zhenyu He, Chenglong Li, Jun Li, Zikun Zhou, Di
  Yuan, Jing Li, Kai Yang, Nana Fan, Feng Zheng","LSOTB-TIR:A Large-Scale High-Diversity Thermal Infrared Object Tracking
  Benchmark","accepted by ACM Mutlimedia Conference, 2020",,10.1145/3394171.3413922,,cs.CV cs.MM,http://creativecommons.org/publicdomain/zero/1.0/,"  In this paper, we present a Large-Scale and high-diversity general Thermal
InfraRed (TIR) Object Tracking Benchmark, called LSOTBTIR, which consists of an
evaluation dataset and a training dataset with a total of 1,400 TIR sequences
and more than 600K frames. We annotate the bounding box of objects in every
frame of all sequences and generate over 730K bounding boxes in total. To the
best of our knowledge, LSOTB-TIR is the largest and most diverse TIR object
tracking benchmark to date. To evaluate a tracker on different attributes, we
define 4 scenario attributes and 12 challenge attributes in the evaluation
dataset. By releasing LSOTB-TIR, we encourage the community to develop deep
learning based TIR trackers and evaluate them fairly and comprehensively. We
evaluate and analyze more than 30 trackers on LSOTB-TIR to provide a series of
baselines, and the results show that deep trackers achieve promising
performance. Furthermore, we re-train several representative deep trackers on
LSOTB-TIR, and their results demonstrate that the proposed training dataset
significantly improves the performance of deep TIR trackers. Codes and dataset
are available at https://github.com/QiaoLiuHit/LSOTB-TIR.
","[{'version': 'v1', 'created': 'Mon, 3 Aug 2020 12:36:06 GMT'}]",2020-08-04,"[['Liu', 'Qiao', ''], ['Li', 'Xin', ''], ['He', 'Zhenyu', ''], ['Li', 'Chenglong', ''], ['Li', 'Jun', ''], ['Zhou', 'Zikun', ''], ['Yuan', 'Di', ''], ['Li', 'Jing', ''], ['Yang', 'Kai', ''], ['Fan', 'Nana', ''], ['Zheng', 'Feng', '']]","['thermal infrared dataset', 'thermal infrared object tracking', 'deeprepresentation learning']"
7895,1601.01504,Hugues Verdure,Trygve Johnsen and Hugues Verdure,Generalized Hamming weights for almost affine codes,,"IEEE Transactions on Information Theory, Volume: 63, Issue: 4,
  April 2017",10.1109/TIT.2017.2654456,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We define generalized Hamming weights for almost affine codes. We show how
various aspects and applications of generalized Hamming weights for linear
codes, such as Wei duality, generalized Kung's bound, profiles, connection to
wire-tap channels of type II, apply to the larger class of almost affine codes
in general. In addition we discuss duality of almost affine codes,and of the
smaller class of multilinear codes. We also give results about weight
distributions of infinite series of almost affine codes, each series obtained
from a fixed code by extending the code alphabet.
","[{'version': 'v1', 'created': 'Thu, 7 Jan 2016 12:16:39 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Mar 2017 14:42:20 GMT'}]",2017-03-20,"[['Johnsen', 'Trygve', ''], ['Verdure', 'Hugues', '']]","['Block codes', 'Hamming weight', 'Kung’sbound', 'profiles', 'wire-tap channel of type II']"
7896,2201.11516,Gereltsetseg Altangerel Ms,"Gereltsetseg Altangerel, Tejfel M\'at\'e",Survey on some optimization possibilities for data plane applications,"Keywords: Data plane, load balancing, in-network caching, in-network
  computing, in-network data aggregation, INT","10th International conference on Networks and Communications(NECO
  2021)",10.5121/csit.2021.111807,,cs.NI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  By programming both the data plane and the control plane, network operators
can customize their networks based on their needs, regardless of the hardware
manufacturer. Control plane programming, a major component of the SDN (Software
Defined Network) concept, has been developed for more than 10 years and
successfully implemented in real networks. Efforts to develop reconfigurable
data planes and high-level network programming languages make it truly possible
to program data planes. Therefore, the programmable data planes and SDNs offer
great flexibility in network customization, allowing many innovations to be
introduced on the network. The general focus of research on the data plane is
data-plane abstractions, languages and compilers, data plane algorithms, and
applications. This paper outlines some emerging applications on the data plane
and offers opportunities for further improvement and optimization.
","[{'version': 'v1', 'created': 'Mon, 29 Nov 2021 19:16:01 GMT'}]",2022-01-28,"[['Altangerel', 'Gereltsetseg', ''], ['Máté', 'Tejfel', '']]","['Data plane', 'load balancing', 'in-network caching', 'in-network computing', 'in-network data aggregation', 'INT']"
7897,2012.08849,Andres Pinilla,"Andres Pinilla, Jaime Garcia, William Raffe, Jan-Niklas Voigt-Antons,
  Robert Spang, Sebastian M\""oller",Affective visualization in Virtual Reality: An integrative review,,"Frontiers in Virtual Reality, 2, 630731 (2021)",10.3389/frvir.2021.630731,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  A cluster of research in Affective Computing suggests that it is possible to
infer some characteristics of users' affective states by analyzing their
electrophysiological activity in real-time. However, it is not clear how to use
the information extracted from electrophysiological signals to create visual
representations of the affective states of Virtual Reality (VR) users.
Visualization of users' affective states in VR can lead to biofeedback
therapies for mental health care. Understanding how to visualize affective
states in VR requires an interdisciplinary approach that integrates psychology,
electrophysiology, and audio-visual design. Therefore, this review aims to
integrate previous studies from these fields to understand how to develop
virtual environments that can automatically create visual representations of
users' affective states. The manuscript addresses this challenge in four
sections: First, theories related to emotion and affect are summarized. Second,
evidence suggesting that visual and sound cues tend to be associated with
affective states are discussed. Third, some of the available methods for
assessing affect are described. The fourth and final section contains five
practical considerations for the development of virtual reality environments
for affect visualization.
","[{'version': 'v1', 'created': 'Wed, 16 Dec 2020 10:42:40 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Jul 2021 09:01:24 GMT'}]",2022-11-22,"[['Pinilla', 'Andres', ''], ['Garcia', 'Jaime', ''], ['Raffe', 'William', ''], ['Voigt-Antons', 'Jan-Niklas', ''], ['Spang', 'Robert', ''], ['Möller', 'Sebastian', '']]","['virtual reality', 'affect', 'emotion', 'electrophysiology', 'visual design']"
7898,2204.05909,Aniruddh Gopinath Puranic,"Aniruddh G. Puranic, Jyotirmoy V. Deshmukh and Stefanos Nikolaidis","Learning Performance Graphs from Demonstrations via Task-Based
  Evaluations","Published in IEEE Robotics and Automation Letters (RA-L) Vol. 8 Issue
  1","in IEEE Robotics and Automation Letters, vol. 8, no. 1, pp.
  336-343, Jan. 2023",10.1109/LRA.2022.3226072,,cs.RO cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the learning from demonstration (LfD) paradigm, understanding and
evaluating the demonstrated behaviors plays a critical role in extracting
control policies for robots. Without this knowledge, a robot may infer
incorrect reward functions that lead to undesirable or unsafe control policies.
Recent work has proposed an LfD framework where a user provides a set of formal
task specifications to guide LfD, to address the challenge of reward shaping.
However, in this framework, specifications are manually ordered in a
performance graph (a partial order that specifies relative importance between
the specifications). The main contribution of this paper is an algorithm to
learn the performance graph directly from the user-provided demonstrations, and
show that the reward functions generated using the learned performance graph
generate similar policies to those from manually specified performance graphs.
We perform a user study that shows that priorities specified by users on
behaviors in a simulated highway driving domain match the automatically
inferred performance graph. This establishes that we can accurately evaluate
user demonstrations with respect to task specifications without expert
criteria.
","[{'version': 'v1', 'created': 'Tue, 12 Apr 2022 16:08:09 GMT'}, {'version': 'v2', 'created': 'Sun, 18 Dec 2022 03:13:38 GMT'}]",2022-12-20,"[['Puranic', 'Aniruddh G.', ''], ['Deshmukh', 'Jyotirmoy V.', ''], ['Nikolaidis', 'Stefanos', '']]","['Learning from demonstrations', 'reinforcement learning', 'temporallogic']"
7899,2002.06723,Zhenyu Shou,"Zhenyu Shou, Xuan Di","Reward Design for Driver Repositioning Using Multi-Agent Reinforcement
  Learning","28 pages, 20 figures, published in Transportation Research Part C 119
  (2020) 102738",,10.1016/j.trc.2020.102738,,cs.LG cs.MA stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A large portion of passenger requests is reportedly unserviced, partially due
to vacant for-hire drivers' cruising behavior during the passenger seeking
process. This paper aims to model the multi-driver repositioning task through a
mean field multi-agent reinforcement learning (MARL) approach that captures
competition among multiple agents. Because the direct application of MARL to
the multi-driver system under a given reward mechanism will likely yield a
suboptimal equilibrium due to the selfishness of drivers, this study proposes a
reward design scheme with which a more desired equilibrium can be reached. To
effectively solve the bilevel optimization problem with upper level as the
reward design and the lower level as a multi-agent system, a Bayesian
optimization (BO) algorithm is adopted to speed up the learning process. We
then apply the bilevel optimization model to two case studies, namely,
e-hailing driver repositioning under service charge and multiclass taxi driver
repositioning under NYC congestion pricing. In the first case study, the model
is validated by the agreement between the derived optimal control from BO and
that from an analytical solution. With a simple piecewise linear service
charge, the objective of the e-hailing platform can be increased by 8.4%. In
the second case study, an optimal toll charge of $5.1 is solved using BO, which
improves the objective of city planners by 7.9%, compared to that without any
toll charge. Under this optimal toll charge, the number of taxis in the NYC
central business district is decreased, indicating a better traffic condition,
without substantially increasing the crowdedness of the subway system.
","[{'version': 'v1', 'created': 'Mon, 17 Feb 2020 00:10:58 GMT'}, {'version': 'v2', 'created': 'Sat, 29 Feb 2020 17:51:40 GMT'}, {'version': 'v3', 'created': 'Sun, 23 Aug 2020 16:48:23 GMT'}]",2020-08-25,"[['Shou', 'Zhenyu', ''], ['Di', 'Xuan', '']]","['Mean Field Multi-Agent Reinforcement Learning', 'Reward Design', 'Bayesian Optimization']"
7900,1810.02711,Maxence Delorme,"Maxence Delorme, Sergio Garc\'ia, Jacek Gondzio, Joerg Kalcsics, David
  Manlove, and William Pettersson","Mathematical models for stable matching problems with ties and
  incomplete lists","31 pages, 11 tables, 1 figure",,10.1016/j.ejor.2019.09.006,ERGO-18-024,cs.DS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present new integer linear programming (ILP) models for NP-hard
optimisation problems in instances of the Stable Marriage problem with Ties and
Incomplete lists (SMTI) and its many-to-one generalisation, the Hospitals /
Residents problem with Ties (HRT). These models can be used to efficiently
solve these optimisation problems when applied to (i) instances derived from
real-world applications, and (ii) larger instances that are randomly-generated.
In the case of SMTI, we consider instances arising from the pairing of children
with adoptive families, where preferences are obtained from a quality measure
of each possible pairing of child to family. In this case we seek a maximum
weight stable matching. We present new algorithms for preprocessing instances
of SMTI with ties on both sides, as well as new ILP models. Algorithms based on
existing state-of-the-art models only solve 6 of our 22 real-world instances
within an hour per instance, and our new models solve all 22 instances within a
mean runtime of 60 seconds. For HRT, we consider instances derived from the
problem of assigning junior doctors to foundation posts in Scottish hospitals.
Here we seek a maximum size stable matching. We show how to extend our models
for SMTI to the HRT case. For the real instances, we reduce the mean runtime
from an average of 144 seconds when using state-of-the-art methods, to 3
seconds when using our new ILP-based algorithms. We also show that our models
outperform considerably state-of-the-art models on larger randomly-generated
instances of SMTI and HRT.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 14:23:31 GMT'}, {'version': 'v2', 'created': 'Sun, 17 Mar 2019 16:18:22 GMT'}]",2019-09-10,"[['Delorme', 'Maxence', ''], ['García', 'Sergio', ''], ['Gondzio', 'Jacek', ''], ['Kalcsics', 'Joerg', ''], ['Manlove', 'David', ''], ['Pettersson', 'William', '']]","['Assignment', 'Stable Marriage problem', 'Hospitals / Residents problem', 'Ties andIncomplete lists', 'Exact algorithms']"
7901,2210.13428,Zhaoqi Leng,"Zhaoqi Leng, Shuyang Cheng, Benjamin Caine, Weiyue Wang, Xiao Zhang,
  Jonathon Shlens, Mingxing Tan, Dragomir Anguelov","PseudoAugment: Learning to Use Unlabeled Data for Data Augmentation in
  Point Clouds",,"ECCV 2022 (pp. 555-572). Springer, Cham",10.1007/978-3-031-19821-2_32,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Data augmentation is an important technique to improve data efficiency and
save labeling cost for 3D detection in point clouds. Yet, existing augmentation
policies have so far been designed to only utilize labeled data, which limits
the data diversity. In this paper, we recognize that pseudo labeling and data
augmentation are complementary, thus propose to leverage unlabeled data for
data augmentation to enrich the training data. In particular, we design three
novel pseudo-label based data augmentation policies (PseudoAugments) to fuse
both labeled and pseudo-labeled scenes, including frames (PseudoFrame), objecta
(PseudoBBox), and background (PseudoBackground). PseudoAugments outperforms
pseudo labeling by mitigating pseudo labeling errors and generating diverse
fused training scenes. We demonstrate PseudoAugments generalize across
point-based and voxel-based architectures, different model capacity and both
KITTI and Waymo Open Dataset. To alleviate the cost of hyperparameter tuning
and iterative pseudo labeling, we develop a population-based data augmentation
framework for 3D detection, named AutoPseudoAugment. Unlike previous works that
perform pseudo-labeling offline, our framework performs PseudoAugments and
hyperparameter tuning in one shot to reduce computational cost. Experimental
results on the large-scale Waymo Open Dataset show our method outperforms
state-of-the-art auto data augmentation method (PPBA) and self-training method
(pseudo labeling). In particular, AutoPseudoAugment is about 3X and 2X data
efficient on vehicle and pedestrian tasks compared to prior arts. Notably,
AutoPseudoAugment nearly matches the full dataset training results, with just
10% of the labeled run segments on the vehicle detection task.
","[{'version': 'v1', 'created': 'Mon, 24 Oct 2022 17:45:49 GMT'}]",2022-10-25,"[['Leng', 'Zhaoqi', ''], ['Cheng', 'Shuyang', ''], ['Caine', 'Benjamin', ''], ['Wang', 'Weiyue', ''], ['Zhang', 'Xiao', ''], ['Shlens', 'Jonathon', ''], ['Tan', 'Mingxing', ''], ['Anguelov', 'Dragomir', '']]","['data augmentation', 'semi-supervised learning', '3D detection']"
7902,1905.12702,Jamal Toutouh,"Jamal Toutouh, Erik Hemberg and Una-May O'Reilly",Spatial Evolutionary Generative Adversarial Networks,,,10.1145/3321707.3321860,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generative adversary networks (GANs) suffer from training pathologies such as
instability and mode collapse. These pathologies mainly arise from a lack of
diversity in their adversarial interactions. Evolutionary generative
adversarial networks apply the principles of evolutionary computation to
mitigate these problems. We hybridize two of these approaches that promote
training diversity. One, E-GAN, at each batch, injects mutation diversity by
training the (replicated) generator with three independent objective functions
then selecting the resulting best performing generator for the next batch. The
other, Lipizzaner, injects population diversity by training a two-dimensional
grid of GANs with a distributed evolutionary algorithm that includes neighbor
exchanges of additional training adversaries, performance based selection and
population-based hyper-parameter tuning. We propose to combine mutation and
population approaches to diversity improvement. We contribute a superior
evolutionary GANs training method, Mustangs, that eliminates the single loss
function used across Lipizzaner's grid. Instead, each training round, a loss
function is selected with equal probability, from among the three E-GAN uses.
Experimental analyses on standard benchmarks, MNIST and CelebA, demonstrate
that Mustangs provides a statistically faster training method resulting in more
accurate networks.
","[{'version': 'v1', 'created': 'Wed, 29 May 2019 20:03:03 GMT'}]",2019-05-31,"[['Toutouh', 'Jamal', ''], ['Hemberg', 'Erik', ''], [""O'Reilly"", 'Una-May', '']]","['Generative adversarial networks', 'coevolution', 'diversity']"
7903,2101.07226,Zeliang Liu,Zeliang Liu,"Cell division in deep material networks applied to multiscale strain
  localization modeling","38 pages, 21 figures",,10.1016/j.cma.2021.113914,,cs.CE cs.LG physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the increasing importance of strain localization modeling (e.g.,
failure analysis) in computer-aided engineering, there is a lack of effective
approaches to capturing relevant material behaviors consistently across
multiple length scales. We aim to address this gap within the framework of deep
material networks (DMN) -- a machine learning model with embedded mechanics in
the building blocks. A new cell-division scheme is proposed to track the scale
transition through the network, and its consistency is ensured by the physics
of fitting parameters. Essentially, each microscale node in the bottom layer is
described by an ellipsoidal cell with its dimensions back-propagated from the
macroscale material point. New crack surfaces in the cell are modeled by
enriching cohesive layers, and failure algorithms are developed for crack
initiation and evolution in the implicit DMN analysis. Besides studies on a
single material point, we apply the multiscale model to concurrent multiscale
simulations for the dynamic crush of a particle-reinforced composite tube and
various tests on carbon fiber reinforced polymer composites. For the latter,
experimental validations on an off-axis tensile test specimen are also
provided.
","[{'version': 'v1', 'created': 'Mon, 18 Jan 2021 18:24:51 GMT'}, {'version': 'v2', 'created': 'Wed, 26 May 2021 18:29:11 GMT'}]",2021-06-16,"[['Liu', 'Zeliang', '']]","['Deep learning', 'multiscale modeling', 'geometric representation', 'failure analysis', 'damage andfracture', 'composites']"
7904,2112.06132,Chengxin Wang,"Chengxin Wang, Yuxuan Liang and Gary Tan",Periodic Residual Learning for Crowd Flow Forecasting,,,10.1145/3557915.3560947,,cs.LG cs.AI cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crowd flow forecasting, which aims to predict the crowds entering or leaving
certain regions, is a fundamental task in smart cities. One of the key
properties of crowd flow data is periodicity: a pattern that occurs at regular
time intervals, such as a weekly pattern. To capture such periodicity, existing
studies either fuse the periodic hidden states into channels for networks to
learn or apply extra periodic strategies to the network architecture. In this
paper, we devise a novel periodic residual learning network (PRNet) for a
better modeling of periodicity in crowd flow data. Unlike existing methods,
PRNet frames the crowd flow forecasting as a periodic residual learning problem
by modeling the variation between the inputs (the previous time period) and the
outputs (the future time period). Compared to directly predicting crowd flows
that are highly dynamic, learning more stationary deviation is much easier,
which thus facilitates the model training. Besides, the learned variation
enables the network to produce the residual between future conditions and its
corresponding weekly observations at each time interval, and therefore
contributes to substantially more accurate multi-step ahead predictions.
Extensive experiments show that PRNet can be easily integrated into existing
models to enhance their predictive performance.
","[{'version': 'v1', 'created': 'Wed, 8 Dec 2021 12:04:27 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Sep 2022 13:49:50 GMT'}]",2022-09-29,"[['Wang', 'Chengxin', ''], ['Liang', 'Yuxuan', ''], ['Tan', 'Gary', '']]","['Crowd flow', 'periodic residual', 'spatio-temporal data mining', 'urbancomputing', 'deep learning', 'convolutional neural networks']"
7905,1712.00674,Anh Nguyen Duc,"Anh Nguyen Duc, Xiaofeng Wang, Pekka Abrahamsson","What influences the speed of prototyping? An empirical investigation of
  twenty software startups","This is the author's version of the work. Copyright owner's version
  can be accessed at doi.org/10.1007/978-3-319-57633-6_2, XP2017, Cologne,
  Germany",,10.1007/978-3-319-57633-6_2,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is essential for startups to quickly experiment business ideas by building
tangible prototypes and collecting user feedback on them. As prototyping is an
inevitable part of learning for early stage software startups, how fast
startups can learn depends on how fast they can prototype. Despite of the
importance, there is a lack of research about prototyping in software startups.
In this study, we aimed at understanding what are factors influencing different
types of prototyping activities. We conducted a multiple case study on twenty
European software startups. The results are two folds, firstly we propose a
prototype-centric learning model in early stage software startups. Secondly, we
identify factors occur as barriers but also facilitators for prototyping in
early stage software startups. The factors are grouped into (1) artifacts, (2)
team competence, (3) collaboration, (4) customer and (5) process dimensions. To
speed up a startups progress at the early stage, it is important to incorporate
the learning objective into a well-defined collaborative approach of
prototyping
","[{'version': 'v1', 'created': 'Sat, 2 Dec 2017 22:41:56 GMT'}]",2017-12-05,"[['Duc', 'Anh Nguyen', ''], ['Wang', 'Xiaofeng', ''], ['Abrahamsson', 'Pekka', '']]","['prototype', 'MVP', 'prototyping-learning loop', 'validated learning', 'speed', 'software startups']"
7906,2008.08190,Wensheng Gan,"Chien-Ming Chen, Lili Chen, Wensheng Gan, Lina Qiu, and Weiping Ding",Discovering High Utility-Occupancy Patterns from Uncertain Data,"Elsevier Information Sciences, 12 figures","Information Sciences, 2021",10.1016/j.ins.2020.10.001,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is widely known that there is a lot of useful information hidden in big
data, leading to a new saying that ""data is money."" Thus, it is prevalent for
individuals to mine crucial information for utilization in many real-world
applications. In the past, studies have considered frequency. Unfortunately,
doing so neglects other aspects, such as utility, interest, or risk. Thus, it
is sensible to discover high-utility itemsets (HUIs) in transaction databases
while utilizing not only the quantity but also the predefined utility. To find
patterns that can represent the supporting transaction, a recent study was
conducted to mine high utility-occupancy patterns whose contribution to the
utility of the entire transaction is greater than a certain value. Moreover, in
realistic applications, patterns may not exist in transactions but be connected
to an existence probability. In this paper, a novel algorithm, called
High-Utility-Occupancy Pattern Mining in Uncertain databases (UHUOPM), is
proposed. The patterns found by the algorithm are called Potential High Utility
Occupancy Patterns (PHUOPs). This algorithm divides user preferences into three
factors, including support, probability, and utility occupancy. To reduce
memory cost and time consumption and to prune the search space in the algorithm
as mentioned above, probability-utility-occupancy list (PUO-list) and
probability-frequency-utility table (PFU-table) are used, which assist in
providing the downward closure property. Furthermore, an original tree
structure, called support count tree (SC-tree), is constructed as the search
space of the algorithm. Finally, substantial experiments were conducted to
evaluate the performance of proposed UHUOPM algorithm on both real-life and
synthetic datasets, particularly in terms of effectiveness and efficiency.
","[{'version': 'v1', 'created': 'Tue, 18 Aug 2020 23:24:40 GMT'}]",2021-04-01,"[['Chen', 'Chien-Ming', ''], ['Chen', 'Lili', ''], ['Gan', 'Wensheng', ''], ['Qiu', 'Lina', ''], ['Ding', 'Weiping', '']]","['utility mining', 'utility occupancy', 'uncertain data', 'probability', 'potential pattern']"
7907,2106.09076,Saad Nadeem,"Donghoon Lee, Sadegh R Alam, Jue Jiang, Pengpeng Zhang, Saad Nadeem
  and Yu-Chi Hu","Deformation Driven Seq2Seq Longitudinal Tumor and Organs-at-Risk
  Prediction for Radiotherapy","Medical Physics 2021, Saad Nadeem and Yu-Chi Hu contributed equally",,10.1002/mp.15075,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose: Radiotherapy presents unique challenges and clinical requirements
for longitudinal tumor and organ-at-risk (OAR) prediction during treatment. The
challenges include tumor inflammation/edema and radiation-induced changes in
organ geometry, whereas the clinical requirements demand flexibility in
input/output sequence timepoints to update the predictions on rolling basis and
the grounding of all predictions in relationship to the pre-treatment imaging
information for response and toxicity assessment in adaptive radiotherapy.
Methods: To deal with the aforementioned challenges and to comply with the
clinical requirements, we present a novel 3D sequence-to-sequence model based
on Convolution Long Short Term Memory (ConvLSTM) that makes use of series of
deformation vector fields (DVF) between individual timepoints and reference
pre-treatment/planning CTs to predict future anatomical deformations and
changes in gross tumor volume as well as critical OARs. High-quality DVF
training data is created by employing hyper-parameter optimization on the
subset of the training data with DICE coefficient and mutual information
metric. We validated our model on two radiotherapy datasets: a publicly
available head-and-neck dataset (28 patients with manually contoured pre-,
mid-, and post-treatment CTs), and an internal non-small cell lung cancer
dataset (63 patients with manually contoured planning CT and 6 weekly CBCTs).
Results: The use of DVF representation and skip connections overcomes the
blurring issue of ConvLSTM prediction with the traditional image
representation. The mean and standard deviation of DICE for predictions of lung
GTV at week 4, 5, and 6 were 0.83$\pm$0.09, 0.82$\pm$0.08, and 0.81$\pm$0.10,
respectively, and for post-treatment ipsilateral and contralateral parotids,
were 0.81$\pm$0.06 and 0.85$\pm$0.02.
","[{'version': 'v1', 'created': 'Wed, 16 Jun 2021 18:29:16 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Jun 2021 01:58:15 GMT'}, {'version': 'v3', 'created': 'Tue, 31 Aug 2021 02:36:44 GMT'}]",2021-09-01,"[['Lee', 'Donghoon', ''], ['Alam', 'Sadegh R', ''], ['Jiang', 'Jue', ''], ['Zhang', 'Pengpeng', ''], ['Nadeem', 'Saad', ''], ['Hu', 'Yu-Chi', '']]","['longitudinal prediction', 'ConvLSTM', 'Deformation vector field']"
7908,1904.07629,Zhaoning Li,"Zhaoning Li, Qi Li, Xiaotian Zou, Jiangtao Ren","Causality Extraction based on Self-Attentive BiLSTM-CRF with Transferred
  Embeddings","39 pages, 11 figures, 6 tables","Neurocomputing, Volume 423, 2021, Pages 207-219",10.1016/j.neucom.2020.08.078,,cs.CL cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Causality extraction from natural language texts is a challenging open
problem in artificial intelligence. Existing methods utilize patterns,
constraints, and machine learning techniques to extract causality, heavily
depending on domain knowledge and requiring considerable human effort and time
for feature engineering. In this paper, we formulate causality extraction as a
sequence labeling problem based on a novel causality tagging scheme. On this
basis, we propose a neural causality extractor with the BiLSTM-CRF model as the
backbone, named SCITE (Self-attentive BiLSTM-CRF wIth Transferred Embeddings),
which can directly extract cause and effect without extracting candidate causal
pairs and identifying their relations separately. To address the problem of
data insufficiency, we transfer contextual string embeddings, also known as
Flair embeddings, which are trained on a large corpus in our task. In addition,
to improve the performance of causality extraction, we introduce a multihead
self-attention mechanism into SCITE to learn the dependencies between causal
words. We evaluate our method on a public dataset, and experimental results
demonstrate that our method achieves significant and consistent improvement
compared to baselines.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2019 12:54:00 GMT'}, {'version': 'v2', 'created': 'Sat, 20 Apr 2019 19:00:21 GMT'}, {'version': 'v3', 'created': 'Mon, 29 Apr 2019 13:59:57 GMT'}, {'version': 'v4', 'created': 'Tue, 29 Oct 2019 07:14:23 GMT'}, {'version': 'v5', 'created': 'Wed, 17 Jun 2020 16:28:53 GMT'}, {'version': 'v6', 'created': 'Sun, 8 Nov 2020 13:30:15 GMT'}]",2020-11-10,"[['Li', 'Zhaoning', ''], ['Li', 'Qi', ''], ['Zou', 'Xiaotian', ''], ['Ren', 'Jiangtao', '']]","['Causality extraction', 'Sequence labeling', 'BiLSTM-CRF', 'Flair']"
7909,2210.01619,Chinmaya Kumar Dehury Dr.,"Mehdi Hatamian, Bivas Panigrahi, Chinmaya Kumar Dehury","Location-aware green energy availability forecasting for multiple time
  frames in smart buildings: The case of Estonia","The current version is submitted to Elsevier Solar Energy and is
  under consideration for future publication","Measurement: Sensors, 2022, 100644, ISSN 2665-9174",10.1016/j.measen.2022.100644,,cs.LG cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  Renewable Energies (RE) have gained more attention in recent years since they
offer clean and sustainable energy. One of the major sustainable development
goals (SDG-7) set by the United Nations (UN) is to achieve affordable and clean
energy for everyone. Among the world's all renewable resources, solar energy is
considered as the most abundant and can certainly fulfill the target of SDGs.
Solar energy is converted into electrical energy through Photovoltaic (PV)
panels with no greenhouse gas emissions. However, power generated by PV panels
is highly dependent on solar radiation received at a particular location over a
given time period. Therefore, it is challenging to forecast the amount of PV
output power. Predicting the output power of PV systems is essential since
several public or private institutes generate such green energy, and need to
maintain the balance between demand and supply. This research aims to forecast
PV system output power based on weather and derived features using different
machine learning models. The objective is to obtain the best-fitting model to
precisely predict output power by inspecting the data. Moreover, different
performance metrics are used to compare and evaluate the accuracy under
different machine learning models such as random forest, XGBoost, KNN, etc.
","[{'version': 'v1', 'created': 'Tue, 4 Oct 2022 14:02:43 GMT'}]",2022-12-27,"[['Hatamian', 'Mehdi', ''], ['Panigrahi', 'Bivas', ''], ['Dehury', 'Chinmaya Kumar', '']]","['Solar Panel', 'Smart Building', 'Green Energy Prediction', 'Machine Learning', 'PV']"
7910,1810.00401,Raphael Hiesgen,"Raphael Hiesgen, Dominik Charousset, Thomas C. Schmidt",A Configurable Transport Layer for CAF,,,10.1145/3281366.3281369,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The message-driven nature of actors lays a foundation for developing scalable
and distributed software. While the actor itself has been thoroughly modeled,
the message passing layer lacks a common definition. Properties and guarantees
of message exchange often shift with implementations and contexts. This adds
complexity to the development process, limits portability, and removes
transparency from distributed actor systems.
  In this work, we examine actor communication, focusing on the implementation
and runtime costs of reliable and ordered delivery. Both guarantees are often
based on TCP for remote messaging, which mixes network transport with the
semantics of messaging. However, the choice of transport may follow different
constraints and is often governed by deployment. As a first step towards
re-architecting actor-to-actor communication, we decouple the messaging
guarantees from the transport protocol. We validate our approach by redesigning
the network stack of the C++ Actor Framework (CAF) so that it allows to combine
an arbitrary transport protocol with additional functions for remote messaging.
An evaluation quantifies the cost of composability and the impact of individual
layers on the entire stack.
","[{'version': 'v1', 'created': 'Sun, 30 Sep 2018 15:23:14 GMT'}]",2018-10-02,"[['Hiesgen', 'Raphael', ''], ['Charousset', 'Dominik', ''], ['Schmidt', 'Thomas C.', '']]","['Actor Model', 'Transport Layer', 'Networking', 'Reliability', 'ServiceGuarantees']"
7911,1805.01951,Benjamin Allaert,"B. Allaert, IM. Bilasco, C. Djeraba","Advanced local motion patterns for macro and micro facial expression
  recognition",,,10.1109/TAFFC.2019.2949559,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we develop a new method that recognizes facial expressions, on
the basis of an innovative local motion patterns feature, with three main
contributions. The first one is the analysis of the face skin temporal
elasticity and face deformations during expression. The second one is a unified
approach for both macro and micro expression recognition. And, the third one is
the step forward towards in-the-wild expression recognition, dealing with
challenges such as various intensity and various expression activation
patterns, illumination variation and small head pose variations. Our method
outperforms state-of-the-art methods for micro expression recognition and
positions itself among top-rank state-of-the-art methods for macro expression
recognition.
","[{'version': 'v1', 'created': 'Fri, 4 May 2018 22:19:02 GMT'}]",2020-12-22,"[['Allaert', 'B.', ''], ['Bilasco', 'IM.', ''], ['Djeraba', 'C.', '']]","['micro expression', 'macro expression', 'recognition', 'unified approach', 'local']"
7912,2108.00895,Johannes Knittel,"Johannes Knittel, Steffen Koch, Thomas Ertl",Efficient Sparse Spherical k-Means for Document Clustering,ACM DocEng 2021,,10.1145/3469096.3474937,,cs.LG cs.AI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spherical k-Means is frequently used to cluster document collections because
it performs reasonably well in many settings and is computationally efficient.
However, the time complexity increases linearly with the number of clusters k,
which limits the suitability of the algorithm for larger values of k depending
on the size of the collection. Optimizations targeted at the Euclidean k-Means
algorithm largely do not apply because the cosine distance is not a metric. We
therefore propose an efficient indexing structure to improve the scalability of
Spherical k-Means with respect to k. Our approach exploits the sparsity of the
input vectors and the convergence behavior of k-Means to reduce the number of
comparisons on each iteration significantly.
","[{'version': 'v1', 'created': 'Fri, 30 Jul 2021 12:02:33 GMT'}]",2021-08-03,"[['Knittel', 'Johannes', ''], ['Koch', 'Steffen', ''], ['Ertl', 'Thomas', '']]","['document clustering', 'k-Means', 'large-scale analysis']"
7913,1902.04346,Kai Olav Ellefsen,"Kai Olav Ellefsen, Joost Huizinga and Jim Torresen",Guiding Neuroevolution with Structural Objectives,,,10.1162/evco_a_00250,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The structure and performance of neural networks are intimately connected,
and by use of evolutionary algorithms, neural network structures optimally
adapted to a given task can be explored. Guiding such neuroevolution with
additional objectives related to network structure has been shown to improve
performance in some cases, especially when modular neural networks are
beneficial. However, apart from objectives aiming to make networks more
modular, such structural objectives have not been widely explored. We propose
two new structural objectives and test their ability to guide evolving neural
networks on two problems which can benefit from decomposition into subtasks.
The first structural objective guides evolution to align neural networks with a
user-recommended decomposition pattern. Intuitively, this should be a powerful
guiding target for problems where human users can easily identify a structure.
The second structural objective guides evolution towards a population with a
high diversity in decomposition patterns. This results in exploration of many
different ways to decompose a problem, allowing evolution to find good
decompositions faster. Tests on our target problems reveal that both methods
perform well on a problem with a very clear and decomposable structure.
However, on a problem where the optimal decomposition is less obvious, the
structural diversity objective is found to outcompete other structural
objectives -- and this technique can even increase performance on problems
without any decomposable structure at all.
","[{'version': 'v1', 'created': 'Tue, 12 Feb 2019 11:54:23 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Feb 2019 09:31:24 GMT'}, {'version': 'v3', 'created': 'Tue, 23 Apr 2019 06:52:22 GMT'}]",2019-04-24,"[['Ellefsen', 'Kai Olav', ''], ['Huizinga', 'Joost', ''], ['Torresen', 'Jim', '']]","['Neuroevolution', 'neural network structure', 'modularity', 'diversity']"
7914,2005.05684,Xinting Zhu,Xinting Zhu and Lishuai Li,"Flight Time Prediction for Fuel Loading Decisions with a Deep Learning
  Approach",,,10.1016/j.trc.2021.103179,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Under increasing economic and environmental pressure, airlines are constantly
seeking new technologies and optimizing flight operations to reduce fuel
consumption. However, the current practice on fuel loading, which has a
significant impact on aircraft weight and fuel consumption, has yet to be
thoroughly addressed by existing studies. Excess fuel is loaded by dispatchers
and (or) pilots to handle fuel consumption uncertainties, primarily caused by
flight time uncertainties, which cannot be predicted by current Flight Planning
Systems. In this paper, we develop a novel spatial weighted recurrent neural
network model to provide better flight time predictions by capturing air
traffic information at a national scale based on multiple data sources,
including Automatic Dependent Surveillance-Broadcast, Meteorological Aerodrome
Reports, and airline records. In this model, a spatial weighted layer is
designed to extract spatial dependences among network delay states. Then, a new
training procedure associated with the spatial weighted layer is introduced to
extract OD-specific spatial weights. Long short-term memory networks are used
to extract the temporal behavior patterns of network delay states. Finally,
features from delays, weather, and flight schedules are fed into a fully
connected neural network to predict the flight time of a particular flight. The
proposed model was evaluated using one year of historical data from an
airline's real operations. Results show that our model can provide more
accurate flight time predictions than baseline methods, especially for flights
with extreme delays. We also show that, with the improved flight time
prediction, fuel loading can be optimized and resulting in reduced fuel
consumption by 0.016%-1.915% without increasing the fuel depletion risk.
","[{'version': 'v1', 'created': 'Tue, 12 May 2020 11:05:42 GMT'}, {'version': 'v2', 'created': 'Sun, 9 May 2021 07:29:15 GMT'}]",2021-06-08,"[['Zhu', 'Xinting', ''], ['Li', 'Lishuai', '']]","['fuel efficiency', 'flight time prediction', 'national aviation network', 'flight delay', 'deep learning']"
7915,2111.07395,David Mark Bossens,David M. Bossens and Nicholas Bishop,"Explicit Explore, Exploit, or Escape ($E^4$): near-optimal
  safety-constrained reinforcement learning in polynomial time",Accepted at Machine Learning,,10.1007/s10994-022-06201-z,,cs.LG cs.AI cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In reinforcement learning (RL), an agent must explore an initially unknown
environment in order to learn a desired behaviour. When RL agents are deployed
in real world environments, safety is of primary concern. Constrained Markov
decision processes (CMDPs) can provide long-term safety constraints; however,
the agent may violate the constraints in an effort to explore its environment.
This paper proposes a model-based RL algorithm called Explicit Explore,
Exploit, or Escape ($E^{4}$), which extends the Explicit Explore or Exploit
($E^{3}$) algorithm to a robust CMDP setting. $E^4$ explicitly separates
exploitation, exploration, and escape CMDPs, allowing targeted policies for
policy improvement across known states, discovery of unknown states, as well as
safe return to known states. $E^4$ robustly optimises these policies on the
worst-case CMDP from a set of CMDP models consistent with the empirical
observations of the deployment environment. Theoretical results show that $E^4$
finds a near-optimal constraint-satisfying policy in polynomial time whilst
satisfying safety constraints throughout the learning process. We then discuss
$E^4$ as a practical algorithmic framework, including robust-constrained
offline optimisation algorithms, the design of uncertainty sets for the
transition dynamics of unknown states, and how to further leverage empirical
observations and prior knowledge to relax some of the worst-case assumptions
underlying the theory.
","[{'version': 'v1', 'created': 'Sun, 14 Nov 2021 17:43:25 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Jun 2022 15:22:38 GMT'}]",2022-06-24,"[['Bossens', 'David M.', ''], ['Bishop', 'Nicholas', '']]","['safe artificial intelligence', 'safe exploration', 'model-basedreinforcement learning', 'constrained Markov decision processes', 'robust Markovdecision processes']"
7916,2008.06835,Matloob Khushi Dr,Matloob Khushi,Benchmarking database performance for genomic data,,J Cell Biochem. 2015 Jun;116(6):877-83,10.1002/jcb.25049,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Genomic regions represent features such as gene annotations, transcription
factor binding sites and epigenetic modifications. Performing various genomic
operations such as identifying overlapping/non-overlapping regions or nearest
gene annotations are common research needs. The data can be saved in a database
system for easy management, however, there is no comprehensive database
built-in algorithm at present to identify overlapping regions. Therefore I have
developed a region-mapping (RegMap) SQL-based algorithm to perform genomic
operations and have benchmarked the performance of different databases.
Benchmarking identified that PostgreSQL extracts overlapping regions much
faster than MySQL. Insertion and data uploads in PostgreSQL were also better,
although general searching capability of both databases was almost equivalent.
In addition, using the algorithm pair-wise, overlaps of >1000 datasets of
transcription factor binding sites and histone marks, collected from previous
publications, were reported and it was found that HNF4G significantly
co-locates with cohesin subunit STAG1 (SA1).
","[{'version': 'v1', 'created': 'Sun, 16 Aug 2020 04:08:38 GMT'}]",2020-08-18,"[['Khushi', 'Matloob', '']]","['Transcription factor binding sites', 'Epigenetic modifications', 'Database']"
7917,2002.05198,Fabricio Breve,"Fabricio Aparecido Breve, Liang Zhao, Marcos Gon\c{c}alves Quiles","Particle Competition and Cooperation for Semi-Supervised Learning with
  Label Noise",,"Neurocomputing (Amsterdam), v.160, p.63 - 72, 2015",10.1016/j.neucom.2014.08.082,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semi-supervised learning methods are usually employed in the classification
of data sets where only a small subset of the data items is labeled. In these
scenarios, label noise is a crucial issue, since the noise may easily spread to
a large portion or even the entire data set, leading to major degradation in
classification accuracy. Therefore, the development of new techniques to reduce
the nasty effects of label noise in semi-supervised learning is a vital issue.
Recently, a graph-based semi-supervised learning approach based on Particle
competition and cooperation was developed. In this model, particles walk in the
graphs constructed from the data sets. Competition takes place among particles
representing different class labels, while the cooperation occurs among
particles with the same label. This paper presents a new particle competition
and cooperation algorithm, specifically designed to increase the robustness to
the presence of label noise, improving its label noise tolerance. Different
from other methods, the proposed one does not require a separate technique to
deal with label noise. It performs classification of unlabeled nodes and
reclassification of the nodes affected by label noise in a unique process.
Computer simulations show the classification accuracy of the proposed method
when applied to some artificial and real-world data sets, in which we introduce
increasing amounts of label noise. The classification accuracy is compared to
those achieved by previous particle competition and cooperation algorithms and
other representative graph-based semi-supervised learning methods using the
same scenarios. Results show the effectiveness of the proposed method.
","[{'version': 'v1', 'created': 'Wed, 12 Feb 2020 19:44:59 GMT'}]",2020-02-14,"[['Breve', 'Fabricio Aparecido', ''], ['Zhao', 'Liang', ''], ['Quiles', 'Marcos Gonçalves', '']]","['Label noise', 'Semi-Supervised Learning', 'Particle Competition and']"
7918,2205.09248,Anton Ratnarajah Mr,"Anton Ratnarajah, Zhenyu Tang, Rohith Chandrashekar Aralikatti, Dinesh
  Manocha","MESH2IR: Neural Acoustic Impulse Response Generator for Complex 3D
  Scenes","Accepted to ACM Multimedia 2022. More results and source code is
  available at https://anton-jeran.github.io/M2IR/",,10.1145/3503161.3548253,,cs.SD cs.CV cs.GR cs.LG cs.MM eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a mesh-based neural network (MESH2IR) to generate acoustic impulse
responses (IRs) for indoor 3D scenes represented using a mesh. The IRs are used
to create a high-quality sound experience in interactive applications and audio
processing. Our method can handle input triangular meshes with arbitrary
topologies (2K - 3M triangles). We present a novel training technique to train
MESH2IR using energy decay relief and highlight its benefits. We also show that
training MESH2IR on IRs preprocessed using our proposed technique significantly
improves the accuracy of IR generation. We reduce the non-linearity in the mesh
space by transforming 3D scene meshes to latent space using a graph convolution
network. Our MESH2IR is more than 200 times faster than a geometric acoustic
algorithm on a CPU and can generate more than 10,000 IRs per second on an
NVIDIA GeForce RTX 2080 Ti GPU for a given furnished indoor 3D scene. The
acoustic metrics are used to characterize the acoustic environment. We show
that the acoustic metrics of the IRs predicted from our MESH2IR match the
ground truth with less than 10% error. We also highlight the benefits of
MESH2IR on audio and speech processing applications such as speech
dereverberation and speech separation. To the best of our knowledge, ours is
the first neural-network-based approach to predict IRs from a given 3D scene
mesh in real-time.
","[{'version': 'v1', 'created': 'Wed, 18 May 2022 23:50:34 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Jul 2022 22:23:18 GMT'}]",2022-07-13,"[['Ratnarajah', 'Anton', ''], ['Tang', 'Zhenyu', ''], ['Aralikatti', 'Rohith Chandrashekar', ''], ['Manocha', 'Dinesh', '']]","['room acoustics', 'sound propagation', 'speech simulation', 'cross-modal']"
7919,2107.07023,Denae Ford,"Souti Chattopadhyay, Thomas Zimmermann, Denae Ford","Reel Life vs. Real Life: How Software Developers Share Their Daily Life
  through Vlogs","12 pages, 2 figures, 3 tables",,10.1145/3468264.3468599,,cs.SE cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software developers are turning to vlogs (video blogs) to share what a day is
like to walk in their shoes. Through these vlogs developers share a rich
perspective of their technical work as well their personal lives. However, does
the type of activities portrayed in vlogs differ from activities developers in
the industry perform? Would developers at a software company prefer to show
activities to different extents if they were asked to share about their day
through vlogs? To answer these questions, we analyzed 130 vlogs by software
developers on YouTube and conducted a survey with 335 software developers at a
large software company. We found that although vlogs present traditional
development activities such as coding and code peripheral activities (11%),
they also prominently feature wellness and lifestyle related activities (47.3%)
that have not been reflected in previous software engineering literature. We
also found that developers at the software company were inclined to share more
non-coding tasks (e.g., personal projects, time spent with family and friends,
and health) when asked to create a mock-up vlog to promote diversity. These
findings demonstrate a shift in our understanding of how software developers
are spending their time and find valuable to share publicly. We discuss how
vlogs provide a more complete perspective of software development work and
serve as a valuable source of data for empirical research.
","[{'version': 'v1', 'created': 'Wed, 14 Jul 2021 22:16:53 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Jul 2021 16:56:46 GMT'}]",2021-07-28,"[['Chattopadhyay', 'Souti', ''], ['Zimmermann', 'Thomas', ''], ['Ford', 'Denae', '']]","['Vlogs', 'Day in the Life', 'Software Developer Workdays']"
7920,2212.04388,Yuhui Su,"Yuhui Su, Chunyang Chen, Junjie Wang, Zhe Liu, Dandan Wang, Shoubin Li
  and Qing Wang",The Metamorphosis: Automatic Detection of Scaling Issues for Mobile Apps,,,10.1145/3551349.3556935,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As the bridge between users and software, Graphical User Interface (GUI) is
critical to the app accessibility. Scaling up the font or display size of GUI
can help improve the visual impact, readability, and usability of an app, and
is frequently used by the elderly and people with vision impairment. Yet this
can easily lead to scaling issues such as text truncation, component overlap,
which negatively influence the acquirement of the right information and the
fluent usage of the app. Previous techniques for UI display issue detection and
cross-platform inconsistency detection cannot work well for these scaling
issues. In this paper, we propose an automated method, dVermin, for scaling
issue detection, through detecting the inconsistency of a view under the
default and a larger display scale. The evaluation result shows that dVermin
achieves 97% precision and 97% recall in issue page detection, and 84%
precision and 91% recall for issue view detection, outperforming two
state-of-the-art baselines by a large margin. We also evaluate dVermin with
popular Android apps on F-droid, and successfully uncover 21
previously-undetected scaling issues with 20 of them being confirmed/fixed.
","[{'version': 'v1', 'created': 'Thu, 8 Dec 2022 16:31:30 GMT'}]",2022-12-09,"[['Su', 'Yuhui', ''], ['Chen', 'Chunyang', ''], ['Wang', 'Junjie', ''], ['Liu', 'Zhe', ''], ['Wang', 'Dandan', ''], ['Li', 'Shoubin', ''], ['Wang', 'Qing', '']]","['Software Testing', 'Android Testing', 'UI Inconsistency Issue', 'Accessibility Testing']"
7921,1905.00794,Kateryna Chumachenko,"Kateryna Chumachenko, Jenni Raitoharju, Alexandros Iosifidis, Moncef
  Gabbouj",Speed-up and multi-view extensions to Subclass Discriminant Analysis,accepted to Pattern Recognition,,10.1016/j.patcog.2020.107660,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a speed-up approach for subclass discriminant
analysis and formulate a novel efficient multi-view solution to it. The
speed-up approach is developed based on graph embedding and spectral regression
approaches that involve eigendecomposition of the corresponding Laplacian
matrix and regression to its eigenvectors. We show that by exploiting the
structure of the between-class Laplacian matrix, the eigendecomposition step
can be substituted with a much faster process. Furthermore, we formulate a
novel criterion for multi-view subclass discriminant analysis and show that an
efficient solution for it can be obtained in a similar to the single-view
manner. We evaluate the proposed methods on nine single-view and nine
multi-view datasets and compare them with related existing approaches.
Experimental results show that the proposed solutions achieve competitive
performance, often outperforming the existing methods. At the same time, they
significantly decrease the training time.
","[{'version': 'v1', 'created': 'Thu, 2 May 2019 14:59:54 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Oct 2020 13:24:38 GMT'}]",2020-10-13,"[['Chumachenko', 'Kateryna', ''], ['Raitoharju', 'Jenni', ''], ['Iosifidis', 'Alexandros', ''], ['Gabbouj', 'Moncef', '']]","['Subclass Discriminant Analysis', 'Spectral Regression', 'multi-viewlearning', 'kernel regression', 'subspace learning']"
7922,2205.03943,Daniele Reda,Daniele Reda and Hung Yu Ling and Michiel van de Panne,Learning to Brachiate via Simplified Model Imitation,"11 pages, 6 figures. Accepted at SIGGRAPH 2022. For videos,
  supplementary material and code, visit the following URL
  https://brachiation-rl.github.io/brachiation",,10.1145/3528233.3530728 10.1145/3528233.3530728 10.1145/3528233.3530728,,cs.LG cs.GR cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Brachiation is the primary form of locomotion for gibbons and siamangs, in
which these primates swing from tree limb to tree limb using only their arms.
It is challenging to control because of the limited control authority, the
required advance planning, and the precision of the required grasps. We present
a novel approach to this problem using reinforcement learning, and as
demonstrated on a finger-less 14-link planar model that learns to brachiate
across challenging handhold sequences. Key to our method is the use of a
simplified model, a point mass with a virtual arm, for which we first learn a
policy that can brachiate across handhold sequences with a prescribed order.
This facilitates the learning of the policy for the full model, for which it
provides guidance by providing an overall center-of-mass trajectory to imitate,
as well as for the timing of the holds. Lastly, the simplified model can also
readily be used for planning suitable sequences of handholds in a given
environment. Our results demonstrate brachiation motions with a variety of
durations for the flight and hold phases, as well as emergent extra
back-and-forth swings when this proves useful. The system is evaluated with a
variety of ablations. The method enables future work towards more general 3D
brachiation, as well as using simplified model imitation in other settings.
","[{'version': 'v1', 'created': 'Sun, 8 May 2022 19:44:19 GMT'}]",2022-05-10,"[['Reda', 'Daniele', ''], ['Ling', 'Hung Yu', ''], ['van de Panne', 'Michiel', '']]","['physics-based character animation', 'motion planning', 'reinforcementlearning']"
7923,2109.14423,Hongjian Sun Dr,"Minglei You and Qian Wang and Hongjian Sun and Ivan Castro and Jing
  Jiang","Digital Twins based Day-ahead Integrated Energy System Scheduling under
  Load and Renewable Energy Uncertainties","28 pages, 8 figures, journal paper accepted by Applied Energy","Applied Energy, 2022, vol 305, 117899",10.1016/j.apenergy.2021.117899,,cs.IT cs.AI cs.LG math.IT,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  By constructing digital twins (DT) of an integrated energy system (IES), one
can benefit from DT's predictive capabilities to improve coordinations among
various energy converters, hence enhancing energy efficiency, cost savings and
carbon emission reduction. This paper is motivated by the fact that practical
IESs suffer from multiple uncertainty sources, and complicated surrounding
environment. To address this problem, a novel DT-based day-ahead scheduling
method is proposed. The physical IES is modelled as a multi-vector energy
system in its virtual space that interacts with the physical IES to manipulate
its operations. A deep neural network is trained to make statistical
cost-saving scheduling by learning from both historical forecasting errors and
day-ahead forecasts. Case studies of IESs show that the proposed DT-based
method is able to reduce the operating cost of IES by 63.5%, comparing to the
existing forecast-based scheduling methods. It is also found that both electric
vehicles and thermal energy storages play proactive roles in the proposed
method, highlighting their importance in future energy system integration and
decarbonisation.
","[{'version': 'v1', 'created': 'Wed, 29 Sep 2021 13:58:01 GMT'}]",2021-09-30,"[['You', 'Minglei', ''], ['Wang', 'Qian', ''], ['Sun', 'Hongjian', ''], ['Castro', 'Ivan', ''], ['Jiang', 'Jing', '']]","['Digital twins', 'Multi-vector energy system', 'Integrated energysystem', 'Machine learning']"
7924,1910.02562,Wenwen Yu,"Ning Lu, Wenwen Yu, Xianbiao Qi, Yihao Chen, Ping Gong, Rong Xiao,
  Xiang Bai",MASTER: Multi-Aspect Non-local Network for Scene Text Recognition,"Accepted by Pattern Recognition. Ning Lu and Wenwen Yu are co-first
  authors",,10.1016/j.patcog.2021.107980,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Attention-based scene text recognizers have gained huge success, which
leverages a more compact intermediate representation to learn 1d- or 2d-
attention by a RNN-based encoder-decoder architecture. However, such methods
suffer from attention-drift problem because high similarity among encoded
features leads to attention confusion under the RNN-based local attention
mechanism. Moreover, RNN-based methods have low efficiency due to poor
parallelization. To overcome these problems, we propose the MASTER, a
self-attention based scene text recognizer that (1) not only encodes the
input-output attention but also learns self-attention which encodes
feature-feature and target-target relationships inside the encoder and decoder
and (2) learns a more powerful and robust intermediate representation to
spatial distortion, and (3) owns a great training efficiency because of high
training parallelization and a high-speed inference because of an efficient
memory-cache mechanism. Extensive experiments on various benchmarks demonstrate
the superior performance of our MASTER on both regular and irregular scene
text. Pytorch code can be found at https://github.com/wenwenyu/MASTER-pytorch,
and Tensorflow code can be found at https://github.com/jiangxiluning/MASTER-TF.
","[{'version': 'v1', 'created': 'Mon, 7 Oct 2019 00:31:01 GMT'}, {'version': 'v2', 'created': 'Sun, 5 Jul 2020 11:55:15 GMT'}, {'version': 'v3', 'created': 'Sun, 11 Apr 2021 06:21:38 GMT'}]",2021-04-13,"[['Lu', 'Ning', ''], ['Yu', 'Wenwen', ''], ['Qi', 'Xianbiao', ''], ['Chen', 'Yihao', ''], ['Gong', 'Ping', ''], ['Xiao', 'Rong', ''], ['Bai', 'Xiang', '']]","['Scene text recognition', 'Transformer', 'Non-local network', 'Memory-cached']"
7925,2203.09608,Jakub Kowalski,"Dominik Kowalczyk, Jakub Kowalski, Hubert Obrzut, Micha{\l} Maras,
  Szymon Kosakowski, Rados{\l}aw Miernik",Developing a Successful Bomberman Agent,International Conference on Agents and Artificial Intelligence 2022,,10.5220/0010840200003116,,cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study AI approaches to successfully play a 2-4 players,
full information, Bomberman variant published on the CodinGame platform. We
compare the behavior of three search algorithms: Monte Carlo Tree Search,
Rolling Horizon Evolution, and Beam Search. We present various enhancements
leading to improve the agents' strength that concern search, opponent
prediction, game state evaluation, and game engine encoding. Our top agent
variant is based on a Beam Search with low-level bit-based state representation
and evaluation function heavy relying on pruning unpromising states based on
simulation-based estimation of survival. It reached the top one position among
the 2,300 AI agents submitted on the CodinGame arena.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2022 20:47:52 GMT'}]",2022-03-21,"[['Kowalczyk', 'Dominik', ''], ['Kowalski', 'Jakub', ''], ['Obrzut', 'Hubert', ''], ['Maras', 'Michał', ''], ['Kosakowski', 'Szymon', ''], ['Miernik', 'Radosław', '']]","['Bomberman', 'Beam Search', 'Monte Carlo Tree Search', 'Rolling Horizon Evolutionary Algorithm', 'CodinGame']"
7926,2204.00110,Akalanka Galappaththi,"Akalanka Galappaththi, Sarah Nadi, Christoph Treude","Does This Apply to Me? An Empirical Study of Technical Context in Stack
  Overflow",,"19th International Conference on Mining Software Repositories (MSR
  '22), May 23--24, 2022, Pittsburgh, PA, USA",10.1145/3524842.3528435,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Stack Overflow has become an essential technical resource for developers.
However, given the vast amount of knowledge available on Stack Overflow,
finding the right information that is relevant for a given task is still
challenging, especially when a developer is looking for a solution that applies
to their specific requirements or technology stack. Clearly marking answers
with their technical context, i.e., the information that characterizes the
technologies and assumptions needed for this answer, is potentially one way to
improve navigation. However, there is no information about how often such
context is mentioned, and what kind of information it might offer. In this
paper, we conduct an empirical study to understand the occurrence of technical
context in Stack Overflow answers and comments, using tags as a proxy for
technical context. We specifically focus on additional context, where
answers/comments mention information that is not already discussed in the
question. Our results show that nearly half of our studied threads contain at
least one additional context. We find that almost 50% of the additional context
are either a library/framework, a programming language, a tool/application, an
API, or a database. Overall, our findings show the promise of using additional
context as navigational cues.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2022 21:46:48 GMT'}]",2022-04-04,"[['Galappaththi', 'Akalanka', ''], ['Nadi', 'Sarah', ''], ['Treude', 'Christoph', '']]","['Stack Overflow', 'contextual information', 'navigating information']"
7927,2006.05832,Samuel Schmidgall,Samuel Schmidgall,"Adaptive Reinforcement Learning through Evolving Self-Modifying Neural
  Networks",GECCO'2020 Poster: Submitted and accepted,Proc. of GECCO 2020,10.1145/3377929.3389901,,cs.NE cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The adaptive learning capabilities seen in biological neural networks are
largely a product of the self-modifying behavior emerging from online plastic
changes in synaptic connectivity. Current methods in Reinforcement Learning
(RL) only adjust to new interactions after reflection over a specified time
interval, preventing the emergence of online adaptivity. Recent work addressing
this by endowing artificial neural networks with neuromodulated plasticity have
been shown to improve performance on simple RL tasks trained using
backpropagation, but have yet to scale up to larger problems. Here we study the
problem of meta-learning in a challenging quadruped domain, where each leg of
the quadruped has a chance of becoming unusable, requiring the agent to adapt
by continuing locomotion with the remaining limbs. Results demonstrate that
agents evolved using self-modifying plastic networks are more capable of
adapting to complex meta-learning learning tasks, even outperforming the same
network updated using gradient-based algorithms while taking less time to
train.
","[{'version': 'v1', 'created': 'Fri, 22 May 2020 02:24:44 GMT'}]",2020-06-16,"[['Schmidgall', 'Samuel', '']]","['Reinforcement Learning', 'Meta-Learning', 'Self-Modifying', 'Adaptive']"
7928,1508.03959,Stanislav Aranovskiy,"Ortega Romeo, Bobtsov Alexey, Pyrkin Anton, Aranovskiy Stanislav","A Parameter Estimation Approach to State Observation of Nonlinear
  Systems","This paper is submitted to Systems & Control Letters Journal. The
  abridged version of this paper will be presented at Conference on Descision
  and Control 2015, Osaka, Japan","Systems & Control Letters, Volume 85, November 2015, Pages 84-94",10.1016/j.sysconle.2015.09.008,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel approach to the problem of partial state estimation of nonlinear
systems is proposed. The main idea is to translate the state estimation problem
into one of estimation of constant, unknown parameters related to the systems
initial conditions. The class of systems for which the method is applicable is
identified via two assumptions related to the transformability of the system
into a suitable cascaded form and our ability to estimate the unknown
parameters. The first condition involves the solvability of a partial
differential equation while the second one requires some persistency of
excitation--like conditions. The proposed observer is shown to be applicable to
position estimation of a class of electromechanical systems, for the
reconstruction of the state of power converters and for speed observation of a
class of mechanical systems.
","[{'version': 'v1', 'created': 'Mon, 17 Aug 2015 09:32:10 GMT'}]",2016-04-08,"[['Romeo', 'Ortega', ''], ['Alexey', 'Bobtsov', ''], ['Anton', 'Pyrkin', ''], ['Stanislav', 'Aranovskiy', '']]","['Parameter estimation', 'Adaptive observer', 'Nonlinear systems']"
7929,1711.08637,Pekka Abrahamsson,"Jussi Ronkainen, Pekka Abrahamsson","Software Development Under Stringent Hardware Constraints: Do Agile
  Methods Have a Chance?","This is the author's version of the the published paper. The
  copyright holder's version can be retrieved from
  https://link.springer.com/chapter/10.1007/3-540-44870-5_10","Lecture Notes in Computer Science, vol 2675. Springer, Berlin,
  Heidelberg, 2003",10.1007/3-540-44870-5_10,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Agile software development methods have been suggested as useful in many
situations and contexts. However, only few (if any) experiences are available
regarding the use of agile methods in embedded domain where the hardware sets
tight requirements for the software. This development domain is arguably far
away from the agile home ground. This paper explores the possibility of using
agile development techniques in this environment and defines the requirements
for new agile methods targeted to facilitate the development of embedded
software. The findings are based on an empirical study over a period 12 months
in the development of low-level telecommunications software. We maintain that
by addressing the requirements we discovered, agile methods can be successful
also in the embedded software domain.
","[{'version': 'v1', 'created': 'Thu, 23 Nov 2017 10:13:19 GMT'}]",2017-11-27,"[['Ronkainen', 'Jussi', ''], ['Abrahamsson', 'Pekka', '']]","['Agile methods', 'embedded system development', 'hardwaresoftware co-design', 'digital signal processing', 'application specific integrated circuit']"
7930,2206.00421,Riad Sonbol,"Riad Sonbol, Ghaida Rebdawi, Nada Ghneim","The Use of NLP-Based Text Representation Techniques to Support
  Requirement Engineering Tasks: A Systematic Mapping Review",,,10.1109/ACCESS.2022.3182372,,cs.SE cs.AI cs.CL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Natural Language Processing (NLP) is widely used to support the automation of
different Requirements Engineering (RE) tasks. Most of the proposed approaches
start with various NLP steps that analyze requirements statements, extract
their linguistic information, and convert them to easy-to-process
representations, such as lists of features or embedding-based vector
representations. These NLP-based representations are usually used at a later
stage as inputs for machine learning techniques or rule-based methods. Thus,
requirements representations play a major role in determining the accuracy of
different approaches. In this paper, we conducted a survey in the form of a
systematic literature mapping (classification) to find out (1) what are the
representations used in RE tasks literature, (2) what is the main focus of
these works, (3) what are the main research directions in this domain, and (4)
what are the gaps and potential future directions. After compiling an initial
pool of 2,227 papers, and applying a set of inclusion/exclusion criteria, we
obtained a final pool containing 104 relevant papers. Our survey shows that the
research direction has changed from the use of lexical and syntactic features
to the use of advanced embedding techniques, especially in the last two years.
Using advanced embedding representations has proved its effectiveness in most
RE tasks (such as requirement analysis, extracting requirements from reviews
and forums, and semantic-level quality tasks). However, representations that
are based on lexical and syntactic features are still more appropriate for
other RE tasks (such as modeling and syntax-level quality tasks) since they
provide the required information for the rules and regular expressions used
when handling these tasks. In addition, we identify four gaps in the existing
literature, why they matter, and how future research can begin to address them.
","[{'version': 'v1', 'created': 'Tue, 17 May 2022 02:47:26 GMT'}]",2022-06-15,"[['Sonbol', 'Riad', ''], ['Rebdawi', 'Ghaida', ''], ['Ghneim', 'Nada', '']]","['Natural Language Processing', 'Requirements Engineering', 'RequirementsRepresentation', 'Syntax', 'Semantic']"
7931,2208.01497,Nicolas Six,"Nicolas Six (CRI), Nicolas Herbaut (CRI), Roberto Erick
  Lopez-Herrejon, Camille Salinesi (CRI)","Using Software Product Lines to Create Blockchain Products: Application
  to Supply Chain Traceability","26th ACM International Systems and Software Product Lines Conference,
  Sep 2022, Graz, Austria",,10.1145/3546932.3547001,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, blockchain has been growing rapidly from a niche technology
to a promising solution for many sectors, due to its unique properties that
empower the design of innovative applications. Nevertheless, the development of
blockchain applications is still a challenge. Due to the technological novelty,
only a few developers are familiar with blockchain technologies and smart
contracts. Others might face a steep learning curve or difficulties to reuse
existing code to build blockchain applications. This study proposes a novel
approach to tackle these issues, through software product line engineering. To
support the approach, a web platform to configure and generate a blockchain
application for on-chain traceability is introduced. First, a feature model has
been designed to model core features of the chosen domain, based on the
existing literature. Then, a configurator has been implemented to support the
feature selection phase. Finally, a generator is able to ingest such
configurations to generate on-the-shelf blockchain products. The
generalizability of the contribution is validated by reproducing on-chain
traceability applications proposed in the literature by using the platform.
This work provides the first evidence that the implementation of blockchain
applications using software product lines enhances the quality of produced
applications and reduces the time to market.
","[{'version': 'v1', 'created': 'Tue, 2 Aug 2022 14:46:01 GMT'}]",2022-08-03,"[['Six', 'Nicolas', '', 'CRI'], ['Herbaut', 'Nicolas', '', 'CRI'], ['Lopez-Herrejon', 'Roberto Erick', '', 'CRI'], ['Salinesi', 'Camille', '', 'CRI']]","['blockchain', 'software product line', 'code generation']"
7932,2111.01229,Rinat Aynulin,Rinat Aynulin,"Impact of network topology on efficiency of proximity measures for
  community detection",,Studies in Computational Intelligence 881 (2019) 188-197,10.1007/978-3-030-36687-2_16,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many community detection algorithms require the introduction of a measure on
the set of nodes. Previously, a lot of efforts have been made to find the
top-performing measures. In most cases, experiments were conducted on several
datasets or random graphs. However, graphs representing real systems can be
completely different in topology: the difference can be in the size of the
network, the structure of clusters, the distribution of degrees, the density of
edges, and so on. Therefore, it is necessary to explicitly check whether the
advantage of one measure over another is preserved for different network
topologies. In this paper, we consider the efficiency of several proximity
measures for clustering networks with different structures. The results show
that the efficiency of measures really depends on the network topology in some
cases. However, it is possible to find measures that behave well for most
topologies.
","[{'version': 'v1', 'created': 'Mon, 1 Nov 2021 19:37:50 GMT'}]",2021-11-03,"[['Aynulin', 'Rinat', '']]","['community detection', 'proximity measure', 'kernel on graph']"
7933,2208.04237,Jing Tan,Jing Tan and Ramin Khalili and Holger Karl and Artur Hecker,"Multi-Agent Reinforcement Learning for Long-Term Network Resource
  Allocation through Auction: a V2X Application",arXiv admin note: substantial text overlap with arXiv:2204.02267,,10.1016/j.comcom.2022.07.047,,cs.MA cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We formulate offloading of computational tasks from a dynamic group of mobile
agents (e.g., cars) as decentralized decision making among autonomous agents.
We design an interaction mechanism that incentivizes such agents to align
private and system goals by balancing between competition and cooperation. In
the static case, the mechanism provably has Nash equilibria with optimal
resource allocation. In a dynamic environment, this mechanism's requirement of
complete information is impossible to achieve. For such environments, we
propose a novel multi-agent online learning algorithm that learns with partial,
delayed and noisy state information, thus greatly reducing information need.
Our algorithm is also capable of learning from long-term and sparse reward
signals with varying delay. Empirical results from the simulation of a V2X
application confirm that through learning, agents with the learning algorithm
significantly improve both system and individual performance, reducing up to
30% of offloading failure rate, communication overhead and load variation,
increasing computation resource utilization and fairness. Results also confirm
the algorithm's good convergence and generalization property in different
environments.
","[{'version': 'v1', 'created': 'Fri, 29 Jul 2022 10:29:06 GMT'}]",2022-08-11,"[['Tan', 'Jing', ''], ['Khalili', 'Ramin', ''], ['Karl', 'Holger', ''], ['Hecker', 'Artur', '']]","['Offloading', 'Distributed Systems', 'Reinforcement Learning', 'Decentralized Decision-Making']"
7934,1708.03366,Sangdon Park,"Sangdon Park, James Weimer and Insup Lee","Resilient Linear Classification: An Approach to Deal with Attacks on
  Training Data",Accepted as a conference paper at ICCPS17,,10.1145/3055004.3055006,,cs.LG cs.AI cs.CR cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data-driven techniques are used in cyber-physical systems (CPS) for
controlling autonomous vehicles, handling demand responses for energy
management, and modeling human physiology for medical devices. These
data-driven techniques extract models from training data, where their
performance is often analyzed with respect to random errors in the training
data. However, if the training data is maliciously altered by attackers, the
effect of these attacks on the learning algorithms underpinning data-driven CPS
have yet to be considered. In this paper, we analyze the resilience of
classification algorithms to training data attacks. Specifically, a generic
metric is proposed that is tailored to measure resilience of classification
algorithms with respect to worst-case tampering of the training data. Using the
metric, we show that traditional linear classification algorithms are resilient
under restricted conditions. To overcome these limitations, we propose a linear
classification algorithm with a majority constraint and prove that it is
strictly more resilient than the traditional algorithms. Evaluations on both
synthetic data and a real-world retrospective arrhythmia medical case-study
show that the traditional algorithms are vulnerable to tampered training data,
whereas the proposed algorithm is more resilient (as measured by worst-case
tampering).
","[{'version': 'v1', 'created': 'Thu, 10 Aug 2017 19:54:58 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Aug 2017 15:25:16 GMT'}]",2017-08-16,"[['Park', 'Sangdon', ''], ['Weimer', 'James', ''], ['Lee', 'Insup', '']]","['cyber-physical systems', 'linear classifcation', 'training data atacks']"
7935,2108.08046,Seong Jin Ahn,"Seong Jin Ahn, Myoung Ho Kim",Variational Graph Normalized Auto-Encoders,,,10.1145/3459637.3482215,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Link prediction is one of the key problems for graph-structured data. With
the advancement of graph neural networks, graph autoencoders (GAEs) and
variational graph autoencoders (VGAEs) have been proposed to learn graph
embeddings in an unsupervised way. It has been shown that these methods are
effective for link prediction tasks. However, they do not work well in link
predictions when a node whose degree is zero (i.g., isolated node) is involved.
We have found that GAEs/VGAEs make embeddings of isolated nodes close to zero
regardless of their content features. In this paper, we propose a novel
Variational Graph Normalized AutoEncoder (VGNAE) that utilize L2-normalization
to derive better embeddings for isolated nodes. We show that our VGNAEs
outperform the existing state-of-the-art models for link prediction tasks. The
code is available at https://github.com/SeongJinAhn/VGNAE.
","[{'version': 'v1', 'created': 'Wed, 18 Aug 2021 08:56:04 GMT'}, {'version': 'v2', 'created': 'Sun, 12 Sep 2021 13:04:00 GMT'}]",2021-09-14,"[['Ahn', 'Seong Jin', ''], ['Kim', 'Myoung Ho', '']]","['Link Prediction', 'Graph Embedding', 'Graph Convolutional Networks', 'Normalization']"
7936,2012.11138,Shoma Ishida,"Shoma Ishida, Satoshi Ono","Adjust-free adversarial example generation in speech recognition using
  evolutionary multi-objective optimization under black-box condition",,Artif Life Robotics (2021),10.1007/s10015-020-00671-x,,cs.SD cs.CL eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a black-box adversarial attack method to automatic speech
recognition systems. Some studies have attempted to attack neural networks for
speech recognition; however, these methods did not consider the robustness of
generated adversarial examples against timing lag with a target speech. The
proposed method in this paper adopts Evolutionary Multi-objective Optimization
(EMO)that allows it generating robust adversarial examples under black-box
scenario. Experimental results showed that the proposed method successfully
generated adjust-free adversarial examples, which are sufficiently robust
against timing lag so that an attacker does not need to take the timing of
playing it against the target speech.
","[{'version': 'v1', 'created': 'Mon, 21 Dec 2020 06:35:52 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Dec 2020 15:53:04 GMT'}]",2021-01-07,"[['Ishida', 'Shoma', ''], ['Ono', 'Satoshi', '']]","['Deep neural network', 'Speech recognition', 'Black-box adversarial attack', 'Robust optimization']"
7937,1709.00111,Francisco Queiroz,"Francisco Queiroz, Raniere Silva, Jonah Miller, Sandor Brockhauser,
  Hans Fangohr",Good Usability Practices in Scientific Software Development,,,10.6084/m9.figshare.5331814.v3,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Scientific software often presents very particular requirements regarding
usability, which is often completely overlooked in this setting. As
computational science has emerged as its own discipline, distinct from
theoretical and experimental science, it has put new requirements on future
scientific software developments. In this paper, we discuss the background of
these problems and introduce nine aspects of good usability. We also highlight
best practices for each aspect with an emphasis on applications in
computational science.
","[{'version': 'v1', 'created': 'Thu, 31 Aug 2017 23:47:37 GMT'}]",2017-09-05,"[['Queiroz', 'Francisco', ''], ['Silva', 'Raniere', ''], ['Miller', 'Jonah', ''], ['Brockhauser', 'Sandor', ''], ['Fangohr', 'Hans', '']]","['Best Practices', 'Usability', 'Scientific Software', 'Computational Science', 'Software for Science']"
7938,2201.12696,Morteza Taiebat,"Morteza Taiebat, Elham Amini, Ming Xu","Sharing Behavior in Ride-hailing Trips: A Machine Learning Inference
  Approach",,"Transportation Research Part D: Transport and Environment, 2022,
  103, 103166",10.1016/j.trd.2021.103166,,cs.LG cs.CY econ.EM,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Ride-hailing is rapidly changing urban and personal transportation. Ride
sharing or pooling is important to mitigate negative externalities of
ride-hailing such as increased congestion and environmental impacts. However,
there lacks empirical evidence on what affect trip-level sharing behavior in
ride-hailing. Using a novel dataset from all ride-hailing trips in Chicago in
2019, we show that the willingness of riders to request a shared ride has
monotonically decreased from 27.0% to 12.8% throughout the year, while the trip
volume and mileage have remained statistically unchanged. We find that the
decline in sharing preference is due to an increased per-mile costs of shared
trips and shifting shorter trips to solo. Using ensemble machine learning
models, we find that the travel impedance variables (trip cost, distance, and
duration) collectively contribute to 95% and 91% of the predictive power in
determining whether a trip is requested to share and whether it is successfully
shared, respectively. Spatial and temporal attributes, sociodemographic, built
environment, and transit supply variables do not entail predictive power at the
trip level in presence of these travel impedance variables. This implies that
pricing signals are most effective to encourage riders to share their rides.
Our findings shed light on sharing behavior in ride-hailing trips and can help
devise strategies that increase shared ride-hailing, especially as the demand
recovers from pandemic.
","[{'version': 'v1', 'created': 'Sun, 30 Jan 2022 01:17:36 GMT'}]",2022-02-23,"[['Taiebat', 'Morteza', ''], ['Amini', 'Elham', ''], ['Xu', 'Ming', '']]","['Travel behavior', 'Shared mobility', 'Ridesourcing', 'Ridesharing', 'Pooling', 'Machine learning']"
7939,2103.01637,Alarith Uhde,Alarith Uhde and Marc Hassenzahl,Towards a Better Understanding of Social Acceptability,"7 pages, 0 figures",,10.1145/3411763.3451649,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social contexts play an important role in understanding acceptance and use of
technology. However, current approaches used in HCI to describe contextual
influence do not capture it appropriately. On the one hand, the often used
Technology Acceptance Model and related frameworks are too rigid to account for
the nuanced variations of social situations. On the other hand, Goffman's
dramaturgical model of social interactions emphasizes interpersonal relations
but mostly overlooks the material (e.g., technology) that is central to HCI. As
an alternative, we suggest an approach based on Social Practice Theory. We
conceptualize social context as interactions between co-located social
practices and acceptability as a matter of their (in)compatibilities. Finally,
we outline how this approach provides designers with a better understanding of
different types of social acceptability problems and helps finding appropriate
solutions.
","[{'version': 'v1', 'created': 'Tue, 2 Mar 2021 10:59:17 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Mar 2021 17:22:11 GMT'}]",2021-03-16,"[['Uhde', 'Alarith', ''], ['Hassenzahl', 'Marc', '']]","['social practice', 'social acceptance', 'social acceptability', 'technologyacceptance model', 'social fit', 'aesthetics of interaction']"
7940,2208.05008,Shaohong Zhong,"Shaohong Zhong, Andrea Scarinci, Alice Cicirello","Natural Language Processing for Systems Engineering: Automatic
  Generation of Systems Modelling Language Diagrams","29 pages, 5 figures",,10.1016/j.knosys.2022.110071,,cs.CL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The design of complex engineering systems is an often long and articulated
process that highly relies on engineers' expertise and professional judgment.
As such, the typical pitfalls of activities involving the human factor often
manifest themselves in terms of lack of completeness or exhaustiveness of the
analysis, inconsistencies across design choices or documentation, as well as an
implicit degree of subjectivity. An approach is proposed to assist systems
engineers in the automatic generation of systems diagrams from unstructured
natural language text. Natural Language Processing (NLP) techniques are used to
extract entities and their relationships from textual resources (e.g.,
specifications, manuals, technical reports, maintenance reports) available
within an organisation, and convert them into Systems Modelling Language
(SysML) diagrams, with particular focus on structure and requirement diagrams.
The intention is to provide the users with a more standardised, comprehensive
and automated starting point onto which subsequently refine and adapt the
diagrams according to their needs. The proposed approach is flexible and
open-domain. It consists of six steps which leverage open-access tools, and it
leads to an automatic generation of SysML diagrams without intermediate
modelling requirement, but through the specification of a set of parameters by
the user. The applicability and benefits of the proposed approach are shown
through six case studies having different textual sources as inputs, and
benchmarked against manually defined diagram elements.
","[{'version': 'v1', 'created': 'Tue, 9 Aug 2022 19:20:33 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Nov 2022 12:23:18 GMT'}]",2022-11-22,"[['Zhong', 'Shaohong', ''], ['Scarinci', 'Andrea', ''], ['Cicirello', 'Alice', '']]","['SysML diagram', 'NLP', 'Structure diagram', 'Requirement diagram', 'text-to-diagram', 'automated diagrams from text']"
7941,2206.01239,Matteo Mordacchini,"Matteo Mordacchini, Lorenzo Valerio, Marco Conti, Andrea Passarella","Design and evaluation of a cognitive approach for disseminating semantic
  knowledge and content in opportunistic networks",,"Computer Communications, Volume 81, 1 May 2016, Pages 12-30",10.1016/j.comcom.2015.09.027,,cs.NI cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In cyber-physical convergence scenarios information flows seamlessly between
the physical and the cyber worlds. Here, users' mobile devices represent a
natural bridge through which users process acquired information and perform
actions. The sheer amount of data available in this context calls for novel,
autonomous and lightweight data-filtering solutions, where only relevant
information is finally presented to users. Moreover, in many real-world
scenarios data is not categorised in predefined topics, but it is generally
accompanied by semantic descriptions possibly describing users' interests. In
these complex conditions, user devices should autonomously become aware not
only of the existence of data in the network, but also of their semantic
descriptions and correlations between them. To tackle these issues, we present
a set of algorithms for knowledge and data dissemination in opportunistic
networks, based on simple and very effective models (called cognitive
heuristics) coming from cognitive sciences. We show how to exploit them to
disseminate both semantic data and the corresponding data items. We provide a
thorough performance analysis, under various different conditions comparing our
results against non-cognitive solutions. Simulation results demonstrate the
superior performance of our solution towards a more effective semantic
knowledge acquisition and representation, and a more tailored content
acquisition.
","[{'version': 'v1', 'created': 'Thu, 2 Jun 2022 18:26:55 GMT'}]",2022-06-06,"[['Mordacchini', 'Matteo', ''], ['Valerio', 'Lorenzo', ''], ['Conti', 'Marco', ''], ['Passarella', 'Andrea', '']]","['Opportunistic Networks', 'cognitive heuristics', 'associative semantic network', 'datadissemination', 'knowledge dissemination']"
7942,2011.03328,Lucas Gren,Lucas Gren,"Understanding Work Practices of Autonomous Agile Teams: A
  Social-psychological Review",,"Paasivaara M., Kruchten P. (eds) Agile Processes in Software
  Engineering and Extreme Programming - Workshops. XP 2020. Lecture Notes in
  Business Information Processing, vol 396. Springer, Cham",10.1007/978-3-030-58858-8_23,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  The purpose of this paper is to suggest additional aspects of social
psychology that could help when making sense of autonomous agile teams. To make
use of well-tested theories in social psychology and instead see how they
replicated and differ in the autonomous agile team context would avoid
reinventing the wheel. This was done, as an initial step, through looking at
some very common agile practices and relate them to existing findings in
social-psychological research. The two theories found that I argue could be
more applied to the software engineering context are social identity theory and
group socialization theory. The results show that literature provides
social-psychological reasons for the popularity of some agile practices, but
that scientific studies are needed to gather empirical evidence on these
under-researched topics. Understanding deeper psychological theories could
provide a better understanding of the psychological processes when building
autonomous agile team, which could then lead to better predictability and
intervention in relation to human factors.
","[{'version': 'v1', 'created': 'Thu, 5 Nov 2020 10:43:04 GMT'}]",2020-11-09,"[['Gren', 'Lucas', '']]","['programming', 'social psychology', 'agile practices', 'teams']"
7943,2301.01424,Yixing Wang,"Sifan Ye, Yixing Wang, Jiaman Li, Dennis Park, C. Karen Liu, Huazhe
  Xu, Jiajun Wu",Scene Synthesis from Human Motion,"9 pages, 8 figures. Published in SIGGRAPH Asia 2022. Sifan Ye and
  Yixing Wang share equal contribution. Huazhe Xu and Jiajun Wu share equal
  contribution",,10.1145/3550469.3555426,,cs.GR cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Large-scale capture of human motion with diverse, complex scenes, while
immensely useful, is often considered prohibitively costly. Meanwhile, human
motion alone contains rich information about the scene they reside in and
interact with. For example, a sitting human suggests the existence of a chair,
and their leg position further implies the chair's pose. In this paper, we
propose to synthesize diverse, semantically reasonable, and physically
plausible scenes based on human motion. Our framework, Scene Synthesis from
HUMan MotiON (SUMMON), includes two steps. It first uses ContactFormer, our
newly introduced contact predictor, to obtain temporally consistent contact
labels from human motion. Based on these predictions, SUMMON then chooses
interacting objects and optimizes physical plausibility losses; it further
populates the scene with objects that do not interact with humans. Experimental
results demonstrate that SUMMON synthesizes feasible, plausible, and diverse
scenes and has the potential to generate extensive human-scene interaction data
for the community.
","[{'version': 'v1', 'created': 'Wed, 4 Jan 2023 03:30:46 GMT'}]",2023-01-05,"[['Ye', 'Sifan', ''], ['Wang', 'Yixing', ''], ['Li', 'Jiaman', ''], ['Park', 'Dennis', ''], ['Liu', 'C. Karen', ''], ['Xu', 'Huazhe', ''], ['Wu', 'Jiajun', '']]","['Scene synthesis', 'motion analysis', 'activity understanding']"
7944,2104.01276,Stephen MacDonell,"Amjed Tahir, Sherlock A. Licorish and Stephen G. MacDonell",Feature Evolution and Reuse -- An Exploratory Study of Eclipse,"Conference paper, 6 pages, 5 figures, 2 tables","Proceedings of the 24th Asia-Pacific Software Engineering
  Conference (APSEC2017). Nanjing, China, IEEE, pp.582-587",10.1109/APSEC.2017.69,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the purported ways to increase productivity and reduce development
time is to reuse existing features and modules. If reuse is adopted, logically
then, it will have a direct impact on a system's evolution. However, the
evidence in the literature is not clear on the extent to which reuse is
practiced in real-world projects, nor how it is practiced. In this paper we
report the results of an investigation of reuse and evolution of software
features in one of the largest open-source ecosystems - Eclipse. Eclipse
provides a leading example of how a system can grow dramatically in size and
number of features while maintaining its quality. Our results demonstrate the
extent of feature reuse and evolution and also patterns of reuse across ten
different Eclipse releases (from Europa to Neon).
","[{'version': 'v1', 'created': 'Fri, 2 Apr 2021 23:50:53 GMT'}]",2021-04-06,"[['Tahir', 'Amjed', ''], ['Licorish', 'Sherlock A.', ''], ['MacDonell', 'Stephen G.', '']]","['software reuse', 'software evolution', 'empirical study', 'Eclipse']"
7945,2009.11225,Aditya Jyoti Paul,Aditya Jyoti Paul,Randomized fast no-loss expert system to play tic tac toe like a human,"Author's version of the paper published in IET Cognitive Computation
  and Systems. For the journal-typeset version, please see
  https://doi.org/10.1049/ccs.2020.0018","Cognitive Computation and Systems, Volume 2, Issue 4, December
  2020, pp. 231 - 241",10.1049/ccs.2020.0018,,cs.AI cs.GT cs.HC cs.MA,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper introduces a blazingly fast, no-loss expert system for Tic Tac Toe
using Decision Trees called T3DT, that tries to emulate human gameplay as
closely as possible. It does not make use of any brute force, minimax or
evolutionary techniques, but is still always unbeatable. In order to make the
gameplay more human-like, randomization is prioritized and T3DT randomly
chooses one of the multiple optimal moves at each step. Since it does not need
to analyse the complete game tree at any point, T3DT is exceptionally faster
than any brute force or minimax algorithm, this has been shown theoretically as
well as empirically from clock-time analyses in this paper. T3DT also doesn't
need the data sets or the time to train an evolutionary model, making it a
practical no-loss approach to play Tic Tac Toe.
","[{'version': 'v1', 'created': 'Wed, 23 Sep 2020 15:41:10 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Nov 2020 23:37:32 GMT'}]",2021-02-16,"[['Paul', 'Aditya Jyoti', '']]","['Computational intelligence', 'decision theory', 'decision tree', 'expert system', 'zero-sum game optimization', 'tic tac toe']"
7946,2105.01038,"Victoria D\""oller","Victoria D\""oller",Formalizing the Four-layer Metamodeling Stack -- Potential and Benefits,"19 pages, 8 figures, submitted for publication in: ""International
  Journal on Software and Systems Modeling (SoSyM)""",,10.1007/s10270-022-00986-2,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Enterprise modeling deals with the increasing complexity of processes and
systems by operationalizing model content and by linking complementary models
and languages, thus amplifying the model-value beyond mere comprehensible
pictures. To enable this amplification and turn models into
computer-processable structures a comprehensive formalization is needed. This
paper presents a generic formalism based on typed first-order logic and
provides a perspective on the potential and benefits arising for a variety of
research issues in conceptual modeling. We define modeling languages as formal
languages with a signature $\Sigma$ - comprising object types, relation types,
and attributes through types and function symbols - and a set of constraints.
Three cases studies are included to show the effectiveness of the approach.
Applying the formalism to the next level in the hierarchy of models we create
M2FOL, a formal modeling language for metamodels. We show that M2FOL is
self-describing and therefore complete the formalization of the full four-layer
metamodeling stack. On the basis of our generic formalism applicable to
arbitrary modeling languages we examine three current research topics -
language interleaving & consistency, operations on models, and automatic
translation of formalizations to platform-specific code - and how to approach
them with the proposed formalism. This shows that the rich knowledge stack on
formal languages in logic offers new tools for old problems.
","[{'version': 'v1', 'created': 'Mon, 3 May 2021 17:37:33 GMT'}]",2022-03-29,"[['Döller', 'Victoria', '']]","['Conceptual Modeling', 'Metamodeling', 'Modeling Language', 'Formal Language', 'PredicateLogic']"
7947,1904.12309,Said Ghoul,Anas Alhamwieh and Said Ghoul,"A Feature Based Methodology for Variable Requirements Reverse
  Engineering",12 pages,"American Journal of Software Engineering and Applications, 2019;
  8(1): 1-7",10.11648/j.ajsea.20190801.11,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In the past years, software reverse engineering dealt with source code
understanding. Nowadays, it is levered to software requirements abstract level,
supported by feature model notations, language independent, and simpler than
the source code reading. The recent relevant approaches face the following
insufficiencies: lack of a complete integrated methodology, adapted feature
model, feature patterns recognition, and Graph based slicing. This work aims to
provide some solutions to the above challenges through an integrated
methodology. The following results are unique. Elementary and configuration
features are specified in a uniform way by introducing semantics specific
attributes. The reverse engineering supports feature pattern recognition and
requirements feature model graph-based slicing. The slicing criteria are rich
enough to allow answering questions of software requirements maintainers. A
comparison of this proposed methodology, based on effective criteria, with the
similar works, seems to be valuable and competitive: the enrichment of the
feature model and feature pattern recognition were never approached and the
proposed slicing technique is more general, effective, and practical.
","[{'version': 'v1', 'created': 'Sun, 28 Apr 2019 11:57:08 GMT'}]",2019-04-30,"[['Alhamwieh', 'Anas', ''], ['Ghoul', 'Said', '']]","['Requirements Engineering', 'Reverse Engineering', 'Requirements Variability', 'Feature Model', 'Pattern Recognition', 'Graph-Based Slicing']"
7948,2108.12184,Taejun Lim,"Soyeon Caren Han, Taejun Lim, Siqu Long, Bernd Burgstaller, Josiah
  Poon",GLocal-K: Global and Local Kernels for Recommender Systems,Accepted by CIKM 2021,,10.1145/3459637.3482112,,cs.IR cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Recommender systems typically operate on high-dimensional sparse user-item
matrices. Matrix completion is a very challenging task to predict one's
interest based on millions of other users having each seen a small subset of
thousands of items. We propose a Global-Local Kernel-based matrix completion
framework, named GLocal-K, that aims to generalise and represent a
high-dimensional sparse user-item matrix entry into a low dimensional space
with a small number of important features. Our GLocal-K can be divided into two
major stages. First, we pre-train an auto encoder with the local kernelised
weight matrix, which transforms the data from one space into the feature space
by using a 2d-RBF kernel. Then, the pre-trained auto encoder is fine-tuned with
the rating matrix, produced by a convolution-based global kernel, which
captures the characteristics of each item. We apply our GLocal-K model under
the extreme low-resource setting, which includes only a user-item rating
matrix, with no side information. Our model outperforms the state-of-the-art
baselines on three collaborative filtering benchmarks: ML-100K, ML-1M, and
Douban.
","[{'version': 'v1', 'created': 'Fri, 27 Aug 2021 09:05:22 GMT'}]",2021-08-30,"[['Han', 'Soyeon Caren', ''], ['Lim', 'Taejun', ''], ['Long', 'Siqu', ''], ['Burgstaller', 'Bernd', ''], ['Poon', 'Josiah', '']]","['Recommender Systems', 'Matrix Completion', 'Kernel Methods']"
7949,2209.03711,Holy Lovenia,"Holy Lovenia, Dessi Puji Lestari, Rita Frieske","What Did I Just Hear? Detecting Pornographic Sounds in Adult Videos
  Using Neural Networks","Published in AudioMostly 2022, ACM",,10.1145/3561212.3561244,,cs.SD cs.AI eess.AS,http://creativecommons.org/licenses/by-sa/4.0/,"  Audio-based pornographic detection enables efficient adult content filtering
without sacrificing performance by exploiting distinct spectral
characteristics. To improve it, we explore pornographic sound modeling based on
different neural architectures and acoustic features. We find that CNN trained
on log mel spectrogram achieves the best performance on Pornography-800
dataset. Our experiment results also show that log mel spectrogram allows
better representations for the models to recognize pornographic sounds.
Finally, to classify whole audio waveforms rather than segments, we employ
voting segment-to-audio technique that yields the best audio-level detection
results.
","[{'version': 'v1', 'created': 'Thu, 8 Sep 2022 11:02:13 GMT'}]",2022-09-09,"[['Lovenia', 'Holy', ''], ['Lestari', 'Dessi Puji', ''], ['Frieske', 'Rita', '']]","['Pornographic detection', 'sound modeling', 'neural networks']"
7950,1601.05683,Amaury Pouly,"Olivier Bournez, Daniel Gra\c{c}a, Amaury Pouly",Computing with Polynomial Ordinary Differential Equations,arXiv admin note: substantial text overlap with arXiv:1601.05360,,10.1016/j.jco.2016.05.002,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 1941, Claude Shannon introduced the General Purpose Analog Computer(GPAC)
as a mathematical model of Differential Analysers, that is to say as a model of
continuous-time analog (mechanical, and later one electronic) machines of that
time.
  Following Shannon's arguments, functions generated by GPACs must be
differentially algebraic. As it is known that some computable functions like
Euler's $\Gamma(x)=\int_{0}^{\infty}t^{x-1}e^{-t}dt$ or Riemann's Zeta function
$\zeta(x)=\sum_{k=0}^\infty \frac1{k^x}$ are not differentially algebraic, this
argument has been often used to demonstrate in the past that the GPAC is less
powerful than digital computation.
  It was proved in JOC2007, that if a more modern notion of computation is
considered, i.e. in particular if computability is not restricted to real-time
generation of functions, the GPAC is actually equivalent to Turing machines.
  Our purpose is first to discuss the robustness of the notion of computation
involved in JOC2007, by establishing that natural variants of the notion of
computation from this paper leads to the same computability result.
  Second, to go considerations about (time) complexity, we explore several
natural variants for measuring time/space complexity of a computation.
  Rather surprisingly, whereas defining a robust time complexity for general
continuous time systems is a well known open problem, we prove that all
variants are actually equivalent even at the complexity level. As a
consequence, it seems that a robust and well defined notion of time complexity
exists for the GPAC, or equivalently for computations by polynomial ordinary
differential equations.
  Another side effect of our proof is also that we show in some way that
polynomial ordinary differential equations can be used as a kind of programming
model, and that there is a rather nice and robust notion of ODE programming.
","[{'version': 'v1', 'created': 'Thu, 21 Jan 2016 15:47:59 GMT'}, {'version': 'v2', 'created': 'Tue, 3 May 2016 13:59:38 GMT'}, {'version': 'v3', 'created': 'Wed, 30 Nov 2016 16:14:04 GMT'}]",2017-01-18,"[['Bournez', 'Olivier', ''], ['Graça', 'Daniel', ''], ['Pouly', 'Amaury', '']]","['Analog Computation', 'Continuous-Time Computations', 'General PurposeAnalog Computer', 'Real Computations']"
7951,2011.01730,Gulcin Baykal,"Gulcin Baykal, Furkan Ozcelik, Gozde Unal","Exploring DeshuffleGANs in Self-Supervised Generative Adversarial
  Networks",Accepted manuscript,,10.1016/j.patcog.2021.108244,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Generative Adversarial Networks (GANs) have become the most used networks
towards solving the problem of image generation. Self-supervised GANs are later
proposed to avoid the catastrophic forgetting of the discriminator and to
improve the image generation quality without needing the class labels. However,
the generalizability of the self-supervision tasks on different GAN
architectures is not studied before. To that end, we extensively analyze the
contribution of a previously proposed self-supervision task, deshuffling of the
DeshuffleGANs in the generalizability context. We assign the deshuffling task
to two different GAN discriminators and study the effects of the task on both
architectures. We extend the evaluations compared to the previously proposed
DeshuffleGANs on various datasets. We show that the DeshuffleGAN obtains the
best FID results for several datasets compared to the other self-supervised
GANs. Furthermore, we compare the deshuffling with the rotation prediction that
is firstly deployed to the GAN training and demonstrate that its contribution
exceeds the rotation prediction. We design the conditional DeshuffleGAN called
cDeshuffleGAN to evaluate the quality of the learnt representations. Lastly, we
show the contribution of the self-supervision tasks to the GAN training on the
loss landscape and present that the effects of these tasks may not be
cooperative to the adversarial training in some settings. Our code can be found
at https://github.com/gulcinbaykal/DeshuffleGAN.
","[{'version': 'v1', 'created': 'Tue, 3 Nov 2020 14:22:54 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Sep 2021 14:00:57 GMT'}]",2021-09-02,"[['Baykal', 'Gulcin', ''], ['Ozcelik', 'Furkan', ''], ['Unal', 'Gozde', '']]","['Self-Supervised Generative Adversarial Networks', 'GenerativeAdversarial Networks', 'Self-Supervised Learning', 'DeshuffleGANs', 'Deshuffling']"
7952,2103.03506,Hadi Jahanshahi,"Hadi Jahanshahi, Dhanya Jothimani, Ay\c{s}e Ba\c{s}ar, Mucahit Cevik","Does chronology matter in JIT defect prediction? A Partial Replication
  Study",,"PROMISE'19: Proceedings of the Fifteenth International Conference
  on Predictive Models and Data Analytics in Software Engineering September
  2019 Pages 90-99",10.1145/3345629.3351449,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Just-In-Time (JIT) models detect the fix-inducing changes (or defect-inducing
changes). These models are designed based on the assumption that past code
change properties are similar to future ones. However, as the system evolves,
the expertise of developers and/or the complexity of the system also changes.
  In this work, we aim to investigate the effect of code change properties on
JIT models over time. We also study the impact of using recent data as well as
all available data on the performance of JIT models. Further, we analyze the
effect of weighted sampling on the performance of fix-inducing properties of
JIT models. For this purpose, we used datasets from Eclipse JDT, Mozilla,
Eclipse Platform, and PostgreSQL.
  We used five families of change-code properties such as size, diffusion,
history, experience, and purpose. We used Random Forest to train and test the
JIT model and Brier Score and the area under the ROC curve for performance
measurement.
  Our paper suggests that the predictive power of JIT models does not change
over time. Furthermore, we observed that the chronology of data in JIT defect
prediction models can be discarded by considering all the available data. On
the other hand, the importance score of families of code change properties is
found to oscillate over time.
  To mitigate the impact of the evolution of code change properties, it is
recommended to use a weighted sampling approach in which more emphasis is
placed upon the changes occurring closer to the current time. Moreover, since
properties such as ""Expertise of the Developer"" and ""Size"" evolve with time,
the models obtained from old data may exhibit different characteristics
compared to those employing the newer dataset. Hence, practitioners should
constantly retrain JIT models to include fresh data.
","[{'version': 'v1', 'created': 'Fri, 5 Mar 2021 07:33:38 GMT'}]",2021-03-08,"[['Jahanshahi', 'Hadi', ''], ['Jothimani', 'Dhanya', ''], ['Başar', 'Ayşe', ''], ['Cevik', 'Mucahit', '']]","['Just-In-Time prediction', 'defect prediction', 'quality assurance', 'software engineering']"
7953,2201.11621,Rog\'erio Rossi,Rogerio Rossi and Pollyana Notargiacomo Mustaro,eQETIC: A Maturity Model for Online Education,"Volume 11, 2015","Interdisciplinary Journal of e-Skills and Lifelong Learning
  (IJELL) 2015",10.28945/2287,,cs.CY cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Digital solutions have substantially contributed to the growth and
dissemination of education. The distance education modality has been presented
as an opportunity for worldwide students in many types of courses. However,
projects of digital educational platforms require different expertise including
knowledge areas such as pedagogy, psychology, computing, and digital
technologies associated with education that allow the correct development and
application of these solutions. To support the evolution of such solutions with
satisfactory quality indicators, this research presents a model focused on
quality of online educational solutions grounded in an approach aimed to
continuous process improvement. The model considers of three maturity levels
and six common entities that address the specific practices for planning and
developing digital educational solutions, targeting quality standards that
satisfy their users, such as students, teachers, tutors, and other people
involved in development and use of these kinds of educational solutions.
","[{'version': 'v1', 'created': 'Sat, 15 Jan 2022 22:46:47 GMT'}]",2022-03-15,"[['Rossi', 'Rogerio', ''], ['Mustaro', 'Pollyana Notargiacomo', '']]","['Online Education', 'Digital Educational Solution', 'Educational Quality Models', 'eQETIC Model']"
7954,2210.00868,Ankush Aggarwal,"Ankush Aggarwal and Bj{\o}rn Sand Jensen and Sanjay Pant and Chung-Hao
  Lee","Strain energy density as a Gaussian process and its utilization in
  stochastic finite element analysis: application to planar soft tissues",,,10.1016/j.cma.2022.115812,,cs.CE cs.NA math.NA physics.bio-ph q-bio.TO,http://creativecommons.org/licenses/by/4.0/,"  Data-based approaches are promising alternatives to the traditional
analytical constitutive models for solid mechanics. Herein, we propose a
Gaussian process (GP) based constitutive modeling framework, specifically
focusing on planar, hyperelastic and incompressible soft tissues. The strain
energy density of soft tissues is modeled as a GP, which can be regressed to
experimental stress-strain data obtained from biaxial experiments. Moreover,
the GP model can be weakly constrained to be convex. A key advantage of a
GP-based model is that, in addition to the mean value, it provides a
probability density (i.e. associated uncertainty) for the strain energy
density. To simulate the effect of this uncertainty, a non-intrusive stochastic
finite element analysis (SFEA) framework is proposed. The proposed framework is
verified against an artificial dataset based on the Gasser--Ogden--Holzapfel
model and applied to a real experimental dataset of a porcine aortic valve
leaflet tissue. Results show that the proposed framework can be trained with
limited experimental data and fits the data better than several existing
models. The SFEA framework provides a straightforward way of using the
experimental data and quantifying the resulting uncertainty in simulation-based
predictions.
","[{'version': 'v1', 'created': 'Wed, 28 Sep 2022 12:23:55 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Nov 2022 06:16:10 GMT'}]",2022-12-13,"[['Aggarwal', 'Ankush', ''], ['Jensen', 'Bjørn Sand', ''], ['Pant', 'Sanjay', ''], ['Lee', 'Chung-Hao', '']]","['Constitutive modeling', 'nonlinear elasticity', 'tissue biomechanics', 'Gaussian processes', 'stochastic finite element analysis', 'machine learning']"
7955,2202.08029,Weisong Sun,"Weisong Sun and Chunrong Fang and Yuchen Chen and Guanhong Tao and
  Tingxu Han and Quanjun Zhang",Code Search based on Context-aware Code Translation,"to be published in the 44th IEEE/ACM International Conference on
  Software Engineering (ICSE 2022) (ICSE'22)",,10.1145/3510003.3510140,,cs.SE cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Code search is a widely used technique by developers during software
development. It provides semantically similar implementations from a large code
corpus to developers based on their queries. Existing techniques leverage deep
learning models to construct embedding representations for code snippets and
queries, respectively. Features such as abstract syntactic trees, control flow
graphs, etc., are commonly employed for representing the semantics of code
snippets. However, the same structure of these features does not necessarily
denote the same semantics of code snippets, and vice versa. In addition, these
techniques utilize multiple different word mapping functions that map query
words/code tokens to embedding representations. This causes diverged embeddings
of the same word/token in queries and code snippets. We propose a novel
context-aware code translation technique that translates code snippets into
natural language descriptions (called translations). The code translation is
conducted on machine instructions, where the context information is collected
by simulating the execution of instructions. We further design a shared word
mapping function using one single vocabulary for generating embeddings for both
translations and queries. We evaluate the effectiveness of our technique,
called TranCS, on the CodeSearchNet corpus with 1,000 queries. Experimental
results show that TranCS significantly outperforms state-of-the-art techniques
by 49.31% to 66.50% in terms of MRR (mean reciprocal rank).
","[{'version': 'v1', 'created': 'Wed, 16 Feb 2022 12:45:47 GMT'}]",2022-02-17,"[['Sun', 'Weisong', ''], ['Fang', 'Chunrong', ''], ['Chen', 'Yuchen', ''], ['Tao', 'Guanhong', ''], ['Han', 'Tingxu', ''], ['Zhang', 'Quanjun', '']]","['code search', 'deep learning', 'code translation']"
7956,2008.09391,Nicol\'as E. D\'iaz Ferreyra,"Nicolas E. Diaz Ferreyra, Rene Meis and Maritta Heisel","Learning from Online Regrets: From Deleted Posts to Risk Awareness in
  Social Network Sites",,,10.1145/3314183.3323849,,cs.HC cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social Network Sites (SNSs) like Facebook or Instagram are spaces where
people expose their lives to wide and diverse audiences. This practice can lead
to unwanted incidents such as reputation damage, job loss or harassment when
pieces of private information reach unintended recipients. As a consequence,
users often regret to have posted private information in these platforms and
proceed to delete such content after having a negative experience. Risk
awareness is a strategy that can be used to persuade users towards safer
privacy decisions. However, many risk awareness technologies for SNSs assume
that information about risks is retrieved and measured by an expert in the
field. Consequently, risk estimation is an activity that is often passed over
despite its importance. In this work we introduce an approach that employs
deleted posts as risk information vehicles to measure the frequency and
consequence level of self-disclosure patterns in SNSs. In this method,
consequence is reported by the users through an ordinal scale and used later on
to compute a risk criticality index. We thereupon show how this index can serve
in the design of adaptive privacy nudges for SNSs.
","[{'version': 'v1', 'created': 'Fri, 21 Aug 2020 09:43:18 GMT'}]",2020-08-24,"[['Ferreyra', 'Nicolas E. Diaz', ''], ['Meis', 'Rene', ''], ['Heisel', 'Maritta', '']]","['adaptive privacy', 'privacy nudges', 'self-disclosure', 'awareness', 'socialnetwork sites', 'risk management']"
7957,2101.03679,Stephen MacDonell,"Tony Clear, Waqar Hussain and Stephen G. MacDonell","The Many Facets of Distance and Space: the Mobility of Actors in
  Globally Distributed Project Teams","Conference, 6 pages, 3 figures","Proceedings of the 2012 International Conference on Global
  Software Engineering (ICGSE 2012). Porto Alegre, Brazil, IEEE Computer
  Society Press, pp.144-148",10.1109/ICGSE.2012.14,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Global software development practices are shaped by the challenges of time
and 'distance', notions perceived to separate sites in a multi-site
collaboration. Yet while sites may be fixed, the actors in global projects are
mobile, so distance becomes a dynamic spatial dimension rather than a static
concept. This empirical study applies grounded theory to unpack the nature of
mobility within a three site globally distributed team setting. We develop a
model for mapping the movements of team members in local and global spaces, and
demonstrate its operation through static snapshots and dynamic patterns
evolving over time. Through this study we highlight the complexity of
'mobility' as one facet of 'space' in globally distributed teams and illuminate
its tight coupling with the accompanying dimensions of accessibility and
context awareness.
","[{'version': 'v1', 'created': 'Mon, 11 Jan 2021 02:46:43 GMT'}]",2021-01-12,"[['Clear', 'Tony', ''], ['Hussain', 'Waqar', ''], ['MacDonell', 'Stephen G.', '']]","['distance', 'space', 'mobility', 'globally distributed teams', 'global software development']"
7958,2111.01363,Junki Mori,"Rishav Chourasia, Batnyam Enkhtaivan, Kunihiro Ito, Junki Mori, Isamu
  Teranishi, Hikaru Tsuchida",Knowledge Cross-Distillation for Membership Privacy,Accepted by PETS 2022,,10.2478/popets-2022-0050,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A membership inference attack (MIA) poses privacy risks for the training data
of a machine learning model. With an MIA, an attacker guesses if the target
data are a member of the training dataset. The state-of-the-art defense against
MIAs, distillation for membership privacy (DMP), requires not only private data
for protection but a large amount of unlabeled public data. However, in certain
privacy-sensitive domains, such as medicine and finance, the availability of
public data is not guaranteed. Moreover, a trivial method for generating public
data by using generative adversarial networks significantly decreases the model
accuracy, as reported by the authors of DMP. To overcome this problem, we
propose a novel defense against MIAs that uses knowledge distillation without
requiring public data. Our experiments show that the privacy protection and
accuracy of our defense are comparable to those of DMP for the benchmark
tabular datasets used in MIA research, Purchase100 and Texas100, and our
defense has a much better privacy-utility trade-off than those of the existing
defenses that also do not use public data for the image dataset CIFAR10.
","[{'version': 'v1', 'created': 'Tue, 2 Nov 2021 04:16:08 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Dec 2021 01:58:01 GMT'}, {'version': 'v3', 'created': 'Fri, 4 Feb 2022 05:23:50 GMT'}]",2022-11-16,"[['Chourasia', 'Rishav', ''], ['Enkhtaivan', 'Batnyam', ''], ['Ito', 'Kunihiro', ''], ['Mori', 'Junki', ''], ['Teranishi', 'Isamu', ''], ['Tsuchida', 'Hikaru', '']]","['privacy-preserving machine learning', 'membership inference attacks', 'knowledge distillation']"
7959,1601.01608,Nabeel Khan,Nabeel Khan and Adil Al-Yasiri,"Framework for cloud computing adoption: A road map for Smes to cloud
  migration","15 Pages in International Journal on cloud computing : Services and
  Architecture","International Journal on Cloud Computing: Services and
  Architecture (IJCCSA) Vol. 5, No. 5/6, December 2015",10.5121/ijccsa.2015.5601,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Small and Medium size Enterprises (SME) are considered as a backbone of many
developing and developed economies of the world; they are the driving force to
any major economy across the globe. Through Cloud Computing firms outsource
their entire information technology (IT) process while concentrating more on
their core business. It allows businesses to cut down heavy cost incurred over
IT infrastructure without losing focus on customer needs. However, Cloud
industry to an extent has struggled to grow among SMEs due to the reluctance
and concerns expressed by them. Throughout the course of this study several
interviews were conducted and the literature was reviewed to understand how
cloud providers offer services and what challenges SMEs are facing. The study
identified issues like cloud knowledge, interoperability, security and
contractual concerns to be hindering SMEs adoption of cloud services. From the
interviews common practices followed by cloud vendors and what concerns SMEs
have were identified as a basis for a cloud framework which will bridge gaps
between cloud vendors and SMEs. A stepwise framework for cloud adoption is
formulated which identifies and provides recommendation to four most
predominant challenges which are hurting cloud industry and taking SMEs away
from cloud computing, as well as guide SMEs aiding in successful cloud
adoption. Moreover, this framework streamlines the cloud adoption process for
SMEs by removing ambiguity in regards to fundamentals associated with their
organisation and cloud adoption process.
","[{'version': 'v1', 'created': 'Thu, 7 Jan 2016 17:21:41 GMT'}]",2016-01-08,"[['Khan', 'Nabeel', ''], ['Al-Yasiri', 'Adil', '']]","['Cloud Computing', 'Cloud migration', 'cloud adoption', 'SMEs', 'framework & guidelines.     1']"
7960,2104.11324,Kyle Hale,"Nicholas C. Wanninger, Joshua J. Bowden, Kirtankumar Shetty, Ayush
  Garg, and Kyle C. Hale",Isolating Functions at the Hardware Limit with Virtines,"In Proceedings of the 17th European Conference on Computer Systems
  (EuroSys '22), April 5-8, 2022, Rennes, France",,10.1145/3492321.3519553,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An important class of applications, including programs that leverage
third-party libraries, programs that use user-defined functions in databases,
and serverless applications, benefit from isolating the execution of untrusted
code at the granularity of individual functions or function invocations.
However, existing isolation mechanisms were not designed for this use case;
rather, they have been adapted to it. We introduce \textit{virtines}, a new
abstraction designed specifically for function granularity isolation, and
describe how we build virtines from the ground up by pushing hardware
virtualization to its limits. Virtines give developers fine-grained control in
deciding which functions should run in isolated environments, and which should
not. The virtine abstraction is a general one, and we demonstrate a prototype
that adds extensions to the C language. We present a detailed analysis of the
overheads of running individual functions in isolated VMs, and guided by those
findings, we present Wasp, an embeddable hypervisor that allows programmers to
easily use virtines. We describe several representative scenarios that employ
individual function isolation, and demonstrate that virtines can be applied in
these scenarios with only a few lines of changes to existing codebases and with
acceptable slowdowns.
","[{'version': 'v1', 'created': 'Wed, 14 Apr 2021 20:18:35 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Mar 2022 20:10:11 GMT'}]",2022-03-18,"[['Wanninger', 'Nicholas C.', ''], ['Bowden', 'Joshua J.', ''], ['Shetty', 'Kirtankumar', ''], ['Garg', 'Ayush', ''], ['Hale', 'Kyle C.', '']]","['virtines', 'virtualization', 'isolation']"
7961,2211.01677,Ben Greenman,"Ben Greenman (Brown University, USA), Sam Saarinen (Brown University,
  USA), Tim Nelson (Brown University, USA), Shriram Krishnamurthi (Brown
  University, USA)",Little Tricky Logic: Misconceptions in the Understanding of LTL,,"The Art, Science, and Engineering of Programming, 2023, Vol. 7,
  Issue 2, Article 7",10.22152/programming-journal.org/2023/7/7,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Linear Temporal Logic (LTL) has been used widely in verification.
Its importance and popularity have only grown with the revival of temporal
logic synthesis, and with new uses of LTL in robotics and planning activities.
All these uses demand that the user have a clear understanding of what an LTL
specification means.
  Inquiry: Despite the growing use of LTL, no studies have investigated the
misconceptions users actually have in understanding LTL formulas. This paper
addresses the gap with a first study of LTL misconceptions. Approach: We study
researchers' and learners' understanding of LTL in four rounds (three written
surveys, one talk-aloud) spread across a two-year timeframe. Concretely, we
decompose ""understanding LTL"" into three questions. A person reading a spec
needs to understand what it is saying, so we study the mapping from LTL to
English. A person writing a spec needs to go in the other direction, so we
study English to LTL. However, misconceptions could arise from two sources: a
misunderstanding of LTL's syntax or of its underlying semantics. Therefore, we
also study the relationship between formulas and specific traces.
  Knowledge: We find several misconceptions that have consequences for
learners, tool builders, and designers of new property languages. These
findings are already resulting in changes to the Alloy modeling language. We
also find that the English to LTL direction was the most common source of
errors; unfortunately, this is the critical ""authoring"" direction in which a
subtle mistake can lead to a faulty system. We contribute study instruments
that are useful for training learners (whether academic or industrial) who are
getting acquainted with LTL, and we provide a code book to assist in the
analysis of responses to similar-style questions.
  Grounding: Our findings are grounded in the responses to our survey rounds.
Round 1 used Quizius to identify misconceptions among learners in a way that
reduces the threat of expert blind spots. Rounds 2 and 3 confirm that both
additional learners and researchers (who work in formal methods, robotics, and
related fields) make similar errors. Round 4 adds deep support for our
misconceptions via talk-aloud surveys.
  Importance This work provides useful answers to two critical but unexplored
questions: in what ways is LTL tricky and what can be done about it? Our survey
instruments can serve as a starting point for other studies.
","[{'version': 'v1', 'created': 'Thu, 3 Nov 2022 09:44:54 GMT'}]",2022-11-04,"[['Greenman', 'Ben', '', 'Brown University, USA'], ['Saarinen', 'Sam', '', 'Brown University,\n  USA'], ['Nelson', 'Tim', '', 'Brown University, USA'], ['Krishnamurthi', 'Shriram', '', 'Brown\n  University, USA']]","['LTL', 'misconceptions', 'user studies', 'property language design']"
7962,1909.00525,Yiling Jia,"Yiling Jia, Nipun Batra, Hongning Wang, Kamin Whitehouse",Active Collaborative Sensing for Energy Breakdown,"12 pages, CIKM 2019",,10.1145/3357384.3357929,,cs.LG eess.SP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Residential homes constitute roughly one-fourth of the total energy usage
worldwide. Providing appliance-level energy breakdown has been shown to induce
positive behavioral changes that can reduce energy consumption by 15%. Existing
approaches for energy breakdown either require hardware installation in every
target home or demand a large set of energy sensor data available for model
training. However, very few homes in the world have installed sub-meters
(sensors measuring individual appliance energy); and the cost of retrofitting a
home with extensive sub-metering eats into the funds available for energy
saving retrofits. As a result, strategically deploying sensing hardware to
maximize the reconstruction accuracy of sub-metered readings in
non-instrumented homes while minimizing deployment costs becomes necessary and
promising. In this work, we develop an active learning solution based on
low-rank tensor completion for energy breakdown. We propose to actively deploy
energy sensors to appliances from selected homes, with a goal to improve the
prediction accuracy of the completed tensor with minimum sensor deployment
cost. We empirically evaluate our approach on the largest public energy dataset
collected in Austin, Texas, USA, from 2013 to 2017. The results show that our
approach gives better performance with a fixed number of sensors installed when
compared to the state-of-the-art, which is also proven by our theoretical
analysis.
","[{'version': 'v1', 'created': 'Mon, 2 Sep 2019 03:30:39 GMT'}]",2019-09-15,"[['Jia', 'Yiling', ''], ['Batra', 'Nipun', ''], ['Wang', 'Hongning', ''], ['Whitehouse', 'Kamin', '']]","['active learning', 'tensor completion', 'energy breakdown']"
7963,2301.03881,Francesco Meggetto,"Francesco Meggetto, Crawford Revie, John Levine and Yashar Moshfeghi","Why People Skip Music? On Predicting Music Skips using Deep
  Reinforcement Learning",Accepted at CHIIR 2023,,10.1145/3576840.3578312,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Music recommender systems are an integral part of our daily life. Recent
research has seen a significant effort around black-box recommender based
approaches such as Deep Reinforcement Learning (DRL). These advances have led,
together with the increasing concerns around users' data collection and
privacy, to a strong interest in building responsible recommender systems. A
key element of a successful music recommender system is modelling how users
interact with streamed content. By first understanding these interactions,
insights can be drawn to enable the construction of more transparent and
responsible systems. An example of these interactions is skipping behaviour, a
signal that can measure users' satisfaction, dissatisfaction, or lack of
interest. In this paper, we study the utility of users' historical data for the
task of sequentially predicting users' skipping behaviour. To this end, we
adapt DRL for this classification task, followed by a post-hoc explainability
(SHAP) and ablation analysis of the input state representation. Experimental
results from a real-world music streaming dataset (Spotify) demonstrate the
effectiveness of our approach in this task by outperforming state-of-the-art
models. A comprehensive analysis of our approach and of users' historical data
reveals a temporal data leakage problem in the dataset. Our findings indicate
that, overall, users' behaviour features are the most discriminative in how our
proposed DRL model predicts music skips. Content and contextual features have a
lesser effect. This suggests that a limited amount of user data should be
collected and leveraged to predict skipping behaviour.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2023 10:07:29 GMT'}]",2023-01-11,"[['Meggetto', 'Francesco', ''], ['Revie', 'Crawford', ''], ['Levine', 'John', ''], ['Moshfeghi', 'Yashar', '']]","['Spotify', 'Music', 'Skipping', 'User Behaviour', 'Prediction', 'Deep Reinforcement Learning']"
7964,2112.04902,Jhonathan Osin,"Jhonathan Osin, Lior Wolf, Guy Gurevitch, Jackob Nimrod Keynan, Tom
  Fruchtman-Steinbok, Ayelet Or-Borichev, Shira Reznik Balter and Talma Hendler","Learning Personal Representations from fMRIby Predicting Neurofeedback
  Performance",,"MICCAI 2020,
  https://link.springer.com/chapter/10.1007/978-3-030-59728-3_46",10.1007/978-3-030-59728-3_46,,cs.LG cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a deep neural network method for learning a personal
representation for individuals that are performing a self neuromodulation task,
guided by functional MRI (fMRI). This neurofeedback task (watch vs. regulate)
provides the subjects with a continuous feedback contingent on down regulation
of their Amygdala signal and the learning algorithm focuses on this region's
time-course of activity. The representation is learned by a self-supervised
recurrent neural network, that predicts the Amygdala activity in the next fMRI
frame given recent fMRI frames and is conditioned on the learned individual
representation. It is shown that the individuals' representation improves the
next-frame prediction considerably. Moreover, this personal representation,
learned solely from fMRI images, yields good performance in linear prediction
of psychiatric traits, which is better than performing such a prediction based
on clinical data and personality tests. Our code is attached as supplementary
and the data would be shared subject to ethical approvals.
","[{'version': 'v1', 'created': 'Mon, 6 Dec 2021 10:16:54 GMT'}]",2021-12-10,"[['Osin', 'Jhonathan', ''], ['Wolf', 'Lior', ''], ['Gurevitch', 'Guy', ''], ['Keynan', 'Jackob Nimrod', ''], ['Fruchtman-Steinbok', 'Tom', ''], ['Or-Borichev', 'Ayelet', ''], ['Balter', 'Shira Reznik', ''], ['Hendler', 'Talma', '']]","['fMRI', 'Amygdala-neurofeedback', 'imaging based diagnosis', 'psychiatry', 'recurrent neural networks']"
7965,2005.05276,Raoul Heese,"Raoul Heese, Lukas Morand, Dirk Helm, Michael Bortz",CupNet -- Pruning a network for geometric data,"4 pages, 2 figures, 1 table","Artificial Neural Networks and Machine Learning - ICANN 2021, pp
  29-33",10.1007/978-3-030-86380-7_3,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using data from a simulated cup drawing process, we demonstrate how the
inherent geometrical structure of cup meshes can be used to effectively prune
an artificial neural network in a straightforward way.
","[{'version': 'v1', 'created': 'Mon, 11 May 2020 17:21:23 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Sep 2021 13:37:31 GMT'}]",2021-09-14,"[['Heese', 'Raoul', ''], ['Morand', 'Lukas', ''], ['Helm', 'Dirk', ''], ['Bortz', 'Michael', '']]","['regression', 'informed learning', 'pruning', 'network architecture', 'deep drawing']"
7966,2104.00165,Kenneth Stewart,"Kenneth Stewart, Andreea Danielescu, Timothy Shea, Emre Neftci","Encoding Event-Based Data With a Hybrid SNN Guided Variational
  Auto-encoder in Neuromorphic Hardware",Published in NICE 2022,,10.1145/3517343.3517372,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neuromorphic hardware equipped with learning capabilities can adapt to new,
real-time data. While models of Spiking Neural Networks (SNNs) can now be
trained using gradient descent to reach an accuracy comparable to equivalent
conventional neural networks, such learning often relies on external labels.
However, real-world data is unlabeled which can make supervised methods
inapplicable. To solve this problem, we propose a Hybrid Guided Variational
Autoencoder (VAE) which encodes event based data sensed by a Dynamic Vision
Sensor (DVS) into a latent space representation using an SNN. These
representations can be used as an embedding to measure data similarity and
predict labels in real-world data. We show that the Hybrid Guided-VAE achieves
87% classification accuracy on the DVSGesture dataset and it can encode the
sparse, noisy inputs into an interpretable latent space representation,
visualized through T-SNE plots. We also implement the encoder component of the
model on neuromorphic hardware and discuss the potential for our algorithm to
enable real-time learning from real-world event data.
","[{'version': 'v1', 'created': 'Wed, 31 Mar 2021 23:58:34 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Mar 2022 00:16:31 GMT'}]",2022-03-09,"[['Stewart', 'Kenneth', ''], ['Danielescu', 'Andreea', ''], ['Shea', 'Timothy', ''], ['Neftci', 'Emre', '']]","['spiking neural networks', 'generative models', 'event-based sensing', 'neuromorphic computing']"
7967,2210.00497,Georgios Zervakis,"J\""org Henkel, Hai Li, Anand Raghunathan, Mehdi B. Tahoori, Swagath
  Venkataramani, Xiaoxuan Yang, Georgios Zervakis",Approximate Computing and the Efficient Machine Learning Expedition,"Accepted for publication at the International Conference on
  Computer-Aided Design (ICCAD) 2022",,10.1145/3508352.3561105,,cs.AR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Approximate computing (AxC) has been long accepted as a design alternative
for efficient system implementation at the cost of relaxed accuracy
requirements. Despite the AxC research activities in various application
domains, AxC thrived the past decade when it was applied in Machine Learning
(ML). The by definition approximate notion of ML models but also the increased
computational overheads associated with ML applications-that were effectively
mitigated by corresponding approximations-led to a perfect matching and a
fruitful synergy. AxC for AI/ML has transcended beyond academic prototypes. In
this work, we enlighten the synergistic nature of AxC and ML and elucidate the
impact of AxC in designing efficient ML systems. To that end, we present an
overview and taxonomy of AxC for ML and use two descriptive application
scenarios to demonstrate how AxC boosts the efficiency of ML systems.
","[{'version': 'v1', 'created': 'Sun, 2 Oct 2022 12:10:39 GMT'}]",2022-10-04,"[['Henkel', 'Jörg', ''], ['Li', 'Hai', ''], ['Raghunathan', 'Anand', ''], ['Tahoori', 'Mehdi B.', ''], ['Venkataramani', 'Swagath', ''], ['Yang', 'Xiaoxuan', ''], ['Zervakis', 'Georgios', '']]","['Approximate Computing', 'In-memory', 'Machine Learning', 'PrecisionScaling', 'Printed Electronics', 'Pruning', 'Quantization', 'Transformers']"
7968,2012.11967,Anna Glazkova,"Anna Glazkova, Maksim Glazkov, Timofey Trifonov","g2tmn at Constraint@AAAI2021: Exploiting CT-BERT and Ensembling Learning
  for COVID-19 Fake News Detection",The winning solution at the Constraint shared task (AAAI-2021),"Combating Online Hostile Posts in Regional Languages during
  Emergency Situation, 116-127, 2021. Springer, Cham",10.1007/978-3-030-73696-5_12,,cs.CL cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The COVID-19 pandemic has had a huge impact on various areas of human life.
Hence, the coronavirus pandemic and its consequences are being actively
discussed on social media. However, not all social media posts are truthful.
Many of them spread fake news that cause panic among readers, misinform people
and thus exacerbate the effect of the pandemic. In this paper, we present our
results at the Constraint@AAAI2021 Shared Task: COVID-19 Fake News Detection in
English. In particular, we propose our approach using the transformer-based
ensemble of COVID-Twitter-BERT (CT-BERT) models. We describe the models used,
the ways of text preprocessing and adding extra data. As a result, our best
model achieved the weighted F1-score of 98.69 on the test set (the first place
in the leaderboard) of this shared task that attracted 166 submitted teams in
total.
","[{'version': 'v1', 'created': 'Tue, 22 Dec 2020 12:43:12 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Dec 2020 09:29:13 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Jan 2021 11:36:32 GMT'}]",2021-08-30,"[['Glazkova', 'Anna', ''], ['Glazkov', 'Maksim', ''], ['Trifonov', 'Timofey', '']]","['COVID-Twitter-BERT', 'social media', 'fake news', 'ensemblinglearning', 'coronavirus', 'infodemic', 'text classification']"
7969,2205.03712,Cristian Alb,Cristian Alb,Accuracy Convergent Field Predictors,,,10.13140/RG.2.2.30987.16165,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Several predictive algorithms are described. Highlighted are variants that
make predictions by superposing fields associated to the training data
instances. They operate seamlessly with categorical, continuous, and mixed
data. Predictive accuracy convergence is also discussed as a criteria for
evaluating predictive algorithms. Methods are described on how to adapt
algorithms in order to make them achieve predictive accuracy convergence.
","[{'version': 'v1', 'created': 'Sat, 7 May 2022 20:02:43 GMT'}]",2022-05-10,"[['Alb', 'Cristian', '']]","['supervised learning', 'field predictor', 'predictive accuracy convergence', 'mixed data']"
7970,2007.14751,Natalie Rauter,"Natalie Rauter, Rolf Lammering","Correlation structure in the elasticity tensor for short
  fiber-reinforced composites",,,10.1016/j.probengmech.2020.103100,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The present work provides a profound analytical and numerical analysis of the
material properties of SFRC on the mesoscale as well as the resulting
correlation structure taking into account the probabilistic characteristics of
the fiber geometry. This is done by calculating the engineering constants using
the analytical framework given by Tandon and Weng as well as Halpin and Tsai.
The input parameters like fiber length, diameter and orientation are chosen
with respect to their probability density function. It is shown, that they are
significantly influenced by the fiber length, the fiber orientation and the
fiber volume fraction. The verification of the analytically obtained values is
done on a numerical basis. Therefore, a two-dimensional microstructure is
generated and transferred to a numerical model. The advantage of this procedure
is, that there are several fibers with different geometrical properties placed
in a preset area. The results of the numerical analysis meet the analytically
obtained conclusions. Furthermore, the results of the numerical simulations are
independent of the assumption of a plane strain and plane stress state,
respectively. Finally, the correlation structure of the elasticity tensor is
investigated. Not only the symmetry properties of the elasticity tensor
characterize the correlation structure, but also the overall
transversely-isotropic material behavior is confirmed. In contrast to the
influencing parameters, the correlation functions vary for a plane strain and a
plane stress state.
","[{'version': 'v1', 'created': 'Wed, 29 Jul 2020 11:36:00 GMT'}]",2020-09-01,"[['Rauter', 'Natalie', ''], ['Lammering', 'Rolf', '']]","['Short fiber-reinforced composites', 'Correlation analysis', 'Movingwindow']"
7971,2108.10120,Julien Rossi,"Julien Rossi, Svitlana Vakulenko, Evangelos Kanoulas","VerbCL: A Dataset of Verbatim Quotes for Highlight Extraction in Case
  Law","CIKM 2021, Resource Track",,10.1145/3459637.3482021,,cs.CL cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Citing legal opinions is a key part of legal argumentation, an expert task
that requires retrieval, extraction and summarization of information from court
decisions. The identification of legally salient parts in an opinion for the
purpose of citation may be seen as a domain-specific formulation of a highlight
extraction or passage retrieval task. As similar tasks in other domains such as
web search show significant attention and improvement, progress in the legal
domain is hindered by the lack of resources for training and evaluation.
  This paper presents a new dataset that consists of the citation graph of
court opinions, which cite previously published court opinions in support of
their arguments. In particular, we focus on the verbatim quotes, i.e., where
the text of the original opinion is directly reused.
  With this approach, we explain the relative importance of different text
spans of a court opinion by showcasing their usage in citations, and measuring
their contribution to the relations between opinions in the citation graph.
  We release VerbCL, a large-scale dataset derived from CourtListener and
introduce the task of highlight extraction as a single-document summarization
task based on the citation graph establishing the first baseline results for
this task on the VerbCL dataset.
","[{'version': 'v1', 'created': 'Mon, 23 Aug 2021 12:41:41 GMT'}]",2021-08-24,"[['Rossi', 'Julien', ''], ['Vakulenko', 'Svitlana', ''], ['Kanoulas', 'Evangelos', '']]","['case law', 'information retrieval', 'summarization']"
7972,2109.01764,Chandrakanth Gudavalli,"Lakshmanan Nataraj, Chandrakanth Gudavalli, Tajuddin Manhar Mohammed,
  Shivkumar Chandrasekaran, B.S. Manjunath","Seam Carving Detection and Localization using Two-Stage Deep Neural
  Networks",,,10.1007/978-981-16-0289-4_29,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Seam carving is a method to resize an image in a content aware fashion.
However, this method can also be used to carve out objects from images. In this
paper, we propose a two-step method to detect and localize seam carved images.
First, we build a detector to detect small patches in an image that has been
seam carved. Next, we compute a heatmap on an image based on the patch
detector's output. Using these heatmaps, we build another detector to detect if
a whole image is seam carved or not. Our experimental results show that our
approach is effective in detecting and localizing seam carved images.
","[{'version': 'v1', 'created': 'Sat, 4 Sep 2021 01:49:08 GMT'}]",2021-09-07,"[['Nataraj', 'Lakshmanan', ''], ['Gudavalli', 'Chandrakanth', ''], ['Mohammed', 'Tajuddin Manhar', ''], ['Chandrasekaran', 'Shivkumar', ''], ['Manjunath', 'B. S.', '']]","['image forensics', 'seam carving detection', 'fake images', 'objectremoval']"
7973,2005.13366,Jingyang Zhang,"Jingyang Zhang, Guotai Wang, Hongzhi Xie, Shuyang Zhang, Ning Huang,
  Shaoting Zhang, Lixu Gu","Weakly Supervised Vessel Segmentation in X-ray Angiograms by Self-Paced
  Learning from Noisy Labels with Suggestive Annotation",,,10.1016/j.neucom.2020.06.122,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The segmentation of coronary arteries in X-ray angiograms by convolutional
neural networks (CNNs) is promising yet limited by the requirement of precisely
annotating all pixels in a large number of training images, which is extremely
labor-intensive especially for complex coronary trees. To alleviate the burden
on the annotator, we propose a novel weakly supervised training framework that
learns from noisy pseudo labels generated from automatic vessel enhancement,
rather than accurate labels obtained by fully manual annotation. A typical
self-paced learning scheme is used to make the training process robust against
label noise while challenged by the systematic biases in pseudo labels, thus
leading to the decreased performance of CNNs at test time. To solve this
problem, we propose an annotation-refining self-paced learning framework
(AR-SPL) to correct the potential errors using suggestive annotation. An
elaborate model-vesselness uncertainty estimation is also proposed to enable
the minimal annotation cost for suggestive annotation, based on not only the
CNNs in training but also the geometric features of coronary arteries derived
directly from raw data. Experiments show that our proposed framework achieves
1) comparable accuracy to fully supervised learning, which also significantly
outperforms other weakly supervised learning frameworks; 2) largely reduced
annotation cost, i.e., 75.18% of annotation time is saved, and only 3.46% of
image regions are required to be annotated; and 3) an efficient intervention
process, leading to superior performance with even fewer manual interactions.
","[{'version': 'v1', 'created': 'Wed, 27 May 2020 13:55:33 GMT'}]",2020-08-19,"[['Zhang', 'Jingyang', ''], ['Wang', 'Guotai', ''], ['Xie', 'Hongzhi', ''], ['Zhang', 'Shuyang', ''], ['Huang', 'Ning', ''], ['Zhang', 'Shaoting', ''], ['Gu', 'Lixu', '']]","['Convolutional neural network', 'weakly supervised learning', 'self-paced learning', 'suggestive annotation', 'vessel segmentation']"
7974,2010.10852,Huy Quoc To,"Huy Quoc To, Kiet Van Nguyen, Ngan Luu-Thuy Nguyen, Anh Gia-Tuan
  Nguyen","Gender Prediction Based on Vietnamese Names with Machine Learning
  Techniques","6 pages, 6 figures. NLPIR 2020: 4th International Conference on
  Natural Language Processing and Information Retrieval",,10.1145/3443279.3443309,,cs.CL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  As biological gender is one of the aspects of presenting individual human,
much work has been done on gender classification based on people names. The
proposals for English and Chinese languages are tremendous; still, there have
been few works done for Vietnamese so far. We propose a new dataset for gender
prediction based on Vietnamese names. This dataset comprises over 26,000 full
names annotated with genders. This dataset is available on our website for
research purposes. In addition, this paper describes six machine learning
algorithms (Support Vector Machine, Multinomial Naive Bayes, Bernoulli Naive
Bayes, Decision Tree, Random Forrest and Logistic Regression) and a deep
learning model (LSTM) with fastText word embedding for gender prediction on
Vietnamese names. We create a dataset and investigate the impact of each name
component on detecting gender. As a result, the best F1-score that we have
achieved is up to 96% on LSTM model and we generate a web API based on our
trained model.
","[{'version': 'v1', 'created': 'Wed, 21 Oct 2020 09:25:48 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Oct 2020 02:21:32 GMT'}, {'version': 'v3', 'created': 'Tue, 27 Oct 2020 01:29:35 GMT'}, {'version': 'v4', 'created': 'Tue, 23 Mar 2021 07:25:00 GMT'}]",2021-03-24,"[['To', 'Huy Quoc', ''], ['Van Nguyen', 'Kiet', ''], ['Nguyen', 'Ngan Luu-Thuy', ''], ['Nguyen', 'Anh Gia-Tuan', '']]","['Gender Prediction', 'Text Classification', 'Deep Learning', 'Machine Learning • Second', 'we experiment new implementations', 'comparison']"
7975,2212.09315,Sirikonda Dhawal,"Sirikonda Dhawal, Aakash KT, P.J. Narayanan","Real-Time Rendering of Arbitrary Surface Geometries using Learnt
  Transfer",Accepted at ICVGIP 2022,,10.1145/3571600.3571640,,cs.GR,http://creativecommons.org/licenses/by/4.0/,"  Precomputed Radiance Transfer (PRT) is widely used for real-time
photorealistic effects. PRT disentangles the rendering equation into transfer
and lighting, enabling their precomputation. Transfer accounts for the
cosine-weighted visibility of points in the scene while lighting for emitted
radiance from the environment. Prior art stored precomputed transfer in a
tabulated manner, either in vertex or texture space. These values are fetched
with interpolation at each point for shading. Vertex space methods require
densely tessellated mesh vertices for high quality images. Texture space
methods require non-overlapping and area-preserving UV mapping to be available.
They also require a high-resolution texture to avoid rendering artifacts. In
this paper, we propose a compact transfer representation that is learnt
directly on scene geometry points. Specifically, we train a small multi-layer
perceptron (MLP) to predict the transfer at sampled surface points. Our
approach is most beneficial where inherent mesh storage structure and natural
UV mapping are not available, such as Implicit Surfaces as it learns the
transfer values directly on the surface. We demonstrate real-time,
photorealistic renderings of diffuse and glossy materials on SDF geometries
with PRT using our approach.
","[{'version': 'v1', 'created': 'Mon, 19 Dec 2022 09:30:01 GMT'}]",2022-12-20,"[['Dhawal', 'Sirikonda', ''], ['KT', 'Aakash', ''], ['Narayanan', 'P. J.', '']]","['Rendering', 'PRT', 'Neural Networks', 'Sign-distance functions', 'Realtime Rendering']"
7976,2002.03147,Taejoon Byun,"Taejoon Byun, Sanjai Rayadurgam",Manifold for Machine Learning Assurance,,,10.1145/3377816.3381734,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing use of machine-learning (ML) enabled systems in critical tasks
fuels the quest for novel verification and validation techniques yet grounded
in accepted system assurance principles. In traditional system development,
model-based techniques have been widely adopted, where the central premise is
that abstract models of the required system provide a sound basis for judging
its implementation. We posit an analogous approach for ML systems using an ML
technique that extracts from the high-dimensional training data implicitly
describing the required system, a low-dimensional underlying structure--a
manifold. It is then harnessed for a range of quality assurance tasks such as
test adequacy measurement, test input generation, and runtime monitoring of the
target ML system. The approach is built on variational autoencoder, an
unsupervised method for learning a pair of mutually near-inverse functions
between a given high-dimensional dataset and a low-dimensional representation.
Preliminary experiments establish that the proposed manifold-based approach,
for test adequacy drives diversity in test data, for test generation yields
fault-revealing yet realistic test cases, and for runtime monitoring provides
an independent means to assess trustability of the target system's output.
","[{'version': 'v1', 'created': 'Sat, 8 Feb 2020 11:39:01 GMT'}]",2020-02-11,"[['Byun', 'Taejoon', ''], ['Rayadurgam', 'Sanjai', '']]","['machine learning testing', 'neural networks', 'variational autoencoder']"
7977,2103.10686,Yuehai Fan,"Xinyi Yu, Yuehai Fan, Siyu Xu, Linlin Ou","A Self-adaptive SAC-PID Control Approach based on Reinforcement Learning
  for Mobile Robots","20 oages, 12 figures",Int J Robust Nolinear Control 31 (2021) 1-19,10.1002/rnc.5662,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Proportional-integral-derivative (PID) control is the most widely used in
industrial control, robot control and other fields. However, traditional PID
control is not competent when the system cannot be accurately modeled and the
operating environment is variable in real time. To tackle these problems, we
propose a self-adaptive model-free SAC-PID control approach based on
reinforcement learning for automatic control of mobile robots. A new
hierarchical structure is developed, which includes the upper controller based
on soft actor-critic (SAC), one of the most competitive continuous control
algorithms, and the lower controller based on incremental PID controller. Soft
actor-critic receives the dynamic information of the mobile robot as input, and
simultaneously outputs the optimal parameters of incremental PID controllers to
compensate for the error between the path and the mobile robot in real time. In
addition, the combination of 24-neighborhood method and polynomial fitting is
developed to improve the adaptability of SAC-PID control method to complex
environments. The effectiveness of the SAC-PID control method is verified with
several different difficulty paths both on Gazebo and real mecanum mobile
robot. Futhermore, compared with fuzzy PID control, the SAC-PID method has
merits of strong robustness, generalization and real-time performance.
","[{'version': 'v1', 'created': 'Fri, 19 Mar 2021 08:37:17 GMT'}]",2021-07-13,"[['Yu', 'Xinyi', ''], ['Fan', 'Yuehai', ''], ['Xu', 'Siyu', ''], ['Ou', 'Linlin', '']]","['Reinforcement learning', 'SAC-PID control', 'hierarchical structure', 'mobile robots']"
7978,2109.03323,Cristiane Maria Santos Ferreira,"Cristiane Ferreira, Gon\c{c}alo Figueira and Pedro Amorim","Effective and interpretable dispatching rules for dynamic job shops via
  guided empirical learning",,,10.1016/j.omega.2022.102643,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The emergence of Industry 4.0 is making production systems more flexible and
also more dynamic. In these settings, schedules often need to be adapted in
real-time by dispatching rules. Although substantial progress was made until
the '90s, the performance of these rules is still rather limited. The machine
learning literature is developing a variety of methods to improve them, but the
resulting rules are difficult to interpret and do not generalise well for a
wide range of settings. This paper is the first major attempt at combining
machine learning with domain problem reasoning for scheduling. The idea
consists of using the insights obtained with the latter to guide the empirical
search of the former. Our hypothesis is that this guided empirical learning
process should result in dispatching rules that are effective and interpretable
and which generalise well to different instance classes. We test our approach
in the classical dynamic job shop scheduling problem minimising tardiness,
which is one of the most well-studied scheduling problems. Nonetheless, results
suggest that our approach was able to find new state-of-the-art rules, which
significantly outperform the existing literature in the vast majority of
settings, from loose to tight due dates and from low utilisation conditions to
congested shops. Overall, the average improvement is 19%. Moreover, the rules
are compact, interpretable, and generalise well to extreme, unseen scenarios.
","[{'version': 'v1', 'created': 'Tue, 7 Sep 2021 20:46:45 GMT'}]",2022-04-11,"[['Ferreira', 'Cristiane', ''], ['Figueira', 'Gonçalo', ''], ['Amorim', 'Pedro', '']]","['Scheduling', 'Dynamic Job Shop', 'Dispatching Rules', 'Genetic Programming']"
7979,2106.13517,Maxwell McNeil Mr.,Maxwell McNeil and Lin Zhang and Petko Bogdanov,Temporal Graph Signal Decomposition,"9 Main Pages 2 Supplement to be published in the research track in
  Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data
  Mining (KDD 2021), August 14 through August 18, 2021,Virtual Event, Singapore",,10.1145/3447548.3467379,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Temporal graph signals are multivariate time series with individual
components associated with nodes of a fixed graph structure. Data of this kind
arises in many domains including activity of social network users, sensor
network readings over time, and time course gene expression within the
interaction network of a model organism. Traditional matrix decomposition
methods applied to such data fall short of exploiting structural regularities
encoded in the underlying graph and also in the temporal patterns of the
signal. How can we take into account such structure to obtain a succinct and
interpretable representation of temporal graph signals?
  We propose a general, dictionary-based framework for temporal graph signal
decomposition (TGSD). The key idea is to learn a low-rank, joint encoding of
the data via a combination of graph and time dictionaries. We propose a highly
scalable decomposition algorithm for both complete and incomplete data, and
demonstrate its advantage for matrix decomposition, imputation of missing
values, temporal interpolation, clustering, period estimation, and rank
estimation in synthetic and real-world data ranging from traffic patterns to
social media activity. Our framework achieves 28% reduction in RMSE compared to
baselines for temporal interpolation when as many as 75% of the observations
are missing. It scales best among baselines taking under 20 seconds on 3.5
million data points and produces the most parsimonious models. To the best of
our knowledge, TGSD is the first framework to jointly model graph signals by
temporal and graph dictionaries.
","[{'version': 'v1', 'created': 'Fri, 25 Jun 2021 09:19:15 GMT'}]",2021-06-28,"[['McNeil', 'Maxwell', ''], ['Zhang', 'Lin', ''], ['Bogdanov', 'Petko', '']]","['graph mining', 'signal processing', 'time series', 'dictionary coding', 'sparse decomposition', 'interpolation', 'periodicity detection']"
7980,2002.11458,Pablo Barros,"Pablo Barros, Alessandra Sciutti, Anne C. Bloem, Inge M. Hootsmans,
  Lena M. Opheij, Romain H.A. Toebosch, Emilia Barakova","It's Food Fight! Introducing the Chef's Hat Card Game for
  Affective-Aware HRI","Accepted by the Workshop on Exploring Creative Content in Social
  Robotics at HRI2020",,10.1145/3434074.3447227,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Emotional expressions and their changes during an interaction affect heavily
how we perceive and behave towards other persons. To design an HRI scenario
that makes possible to observe, understand, and model affective interactions
and generate the appropriate responses or initiations of a robot is a very
challenging task. In this paper, we report our efforts in designing such a
scenario, and to propose a modeling strategy of affective interaction by
artificial intelligence deployed in autonomous robots. Overall, we present a
novel HRI game scenario that was designed to comply with the specific
requirements that will allow us to develop the next wave of affective-aware
social robots that provide adequate emotional responses.
","[{'version': 'v1', 'created': 'Tue, 25 Feb 2020 12:27:15 GMT'}, {'version': 'v2', 'created': 'Mon, 9 Mar 2020 11:30:10 GMT'}]",2021-12-07,"[['Barros', 'Pablo', ''], ['Sciutti', 'Alessandra', ''], ['Bloem', 'Anne C.', ''], ['Hootsmans', 'Inge M.', ''], ['Opheij', 'Lena M.', ''], ['Toebosch', 'Romain H. A.', ''], ['Barakova', 'Emilia', '']]","['Affective Computing', 'HRI', 'Card game']"
7981,2007.00168,Sabah Al-Fedaghi Dr.,Sabah Al-Fedaghi and Esraa Haidar,Thinging-Based Conceptual Modeling: Case Study of a Tendering System,"15 pages, 16 figures","Journal of Computer Science, 16 (6): 723-434, 2020",10.3844/jcssp.2020.723.434,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In computer science, models are made explicit to provide formality and a
precise understanding of small, contingent universes (e.g., an organization),
as constructed from stakeholder requirements. Conceptual modeling is a
fundamental discipline in this context whose main concerns are identifying,
analyzing and describing the critical concepts of a universe of discourse. In
the information systems field, one of the reasons why projects fail is an
inability to capture requirements in a way that can be technically used to
configure a system. This problem of requirements specification is considered to
have deficiencies in theory. We apply a recently developed model called the
Thinging Machine (TM) model which uniformly integrates static and dynamic
modeling features to this problem of requirements specification. The
object-Oriented (OO) approach to modeling, as applied in Unified Modeling
Language, is by far the most applied and accepted standard in software
engineering; nevertheless, new notions in the field may enhance and facilitate
a supplementary understanding of the OO model itself. We aim to contribute to
the field of conceptual modeling by introducing the TM model s philosophical
foundation of requirements analysis. The TM model has only five generic
processes of things (e.g., objects), in which genericity indicates generality,
as in the generic Aristotelian concepts based on abstraction. We show the TM
model s viability by applying it to a real business system.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2020 01:04:40 GMT'}]",2020-07-02,"[['Al-Fedaghi', 'Sabah', ''], ['Haidar', 'Esraa', '']]","['Abstract Machine', 'Conceptual Modeling', 'Diagrammatic Representation', 'Generic Process', 'Requirement Engineering', 'System Modeling']"
7982,2005.00858,Wolfgang Mulzer,"Sergio Cabello, Wolfgang Mulzer",Minimum Cuts in Geometric Intersection Graphs,"11 pages, 4 figures","Computational Geometry: Theory and Applications (CGTA), 94, 2021,
  Article 101720",10.1016/j.comgeo.2020.101720,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $\mathcal{D}$ be a set of $n$ disks in the plane. The disk graph
$G_\mathcal{D}$ for $\mathcal{D}$ is the undirected graph with vertex set
$\mathcal{D}$ in which two disks are joined by an edge if and only if they
intersect. The directed transmission graph $G^{\rightarrow}_\mathcal{D}$ for
$\mathcal{D}$ is the directed graph with vertex set $\mathcal{D}$ in which
there is an edge from a disk $D_1 \in \mathcal{D}$ to a disk $D_2 \in
\mathcal{D}$ if and only if $D_1$ contains the center of $D_2$.
  Given $\mathcal{D}$ and two non-intersecting disks $s, t \in \mathcal{D}$, we
show that a minimum $s$-$t$ vertex cut in $G_\mathcal{D}$ or in
$G^{\rightarrow}_\mathcal{D}$ can be found in $O(n^{3/2}\text{polylog} n)$
expected time. To obtain our result, we combine an algorithm for the maximum
flow problem in general graphs with dynamic geometric data structures to
manipulate the disks.
  As an application, we consider the barrier resilience problem in a
rectangular domain. In this problem, we have a vertical strip $S$ bounded by
two vertical lines, $L_\ell$ and $L_r$, and a collection $\mathcal{D}$ of
disks. Let $a$ be a point in $S$ above all disks of $\mathcal{D}$, and let $b$
a point in $S$ below all disks of $\mathcal{D}$. The task is to find a curve
from $a$ to $b$ that lies in $S$ and that intersects as few disks of
$\mathcal{D}$ as possible. Using our improved algorithm for minimum cuts in
disk graphs, we can solve the barrier resilience problem in
$O(n^{3/2}\text{polylog} n)$ expected time.
","[{'version': 'v1', 'created': 'Sat, 2 May 2020 15:23:30 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Oct 2020 14:12:17 GMT'}]",2020-11-06,"[['Cabello', 'Sergio', ''], ['Mulzer', 'Wolfgang', '']]","['computational geometry', 'geometric intersection graph', 'disk graph', 'unit-diskgraph', 'vertex-disjoint paths', 'barrier resilience']"
7983,2101.11096,Mauro Innocente,"Johann Sienz, Mauro S. Innocente","Particle Swarm Optimization: Fundamental Study and its Application to
  Optimization and to Jetty Scheduling Problems","Preprint submitted to Trends in Engineering Computational Technology.
  arXiv admin note: text overlap with arXiv:2101.10933",,10.4203/csets.20.6,,cs.NE math.OC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The advantages of evolutionary algorithms with respect to traditional methods
have been greatly discussed in the literature. While particle swarm optimizers
share such advantages, they outperform evolutionary algorithms in that they
require lower computational cost and easier implementation, involving no
operator design and few coefficients to be tuned. However, even marginal
variations in the settings of these coefficients greatly influence the dynamics
of the swarm. Since this paper does not intend to study their tuning,
general-purpose settings are taken from previous studies, and virtually the
same algorithm is used to optimize a variety of notably different problems.
Thus, following a review of the paradigm, the algorithm is tested on a set of
benchmark functions and engineering problems taken from the literature. Later,
complementary lines of code are incorporated to adapt the method to
combinatorial optimization as it occurs in scheduling problems, and a real case
is solved using the same optimizer with the same settings. The aim is to show
the flexibility and robustness of the approach, which can handle a wide variety
of problems.
","[{'version': 'v1', 'created': 'Mon, 25 Jan 2021 02:06:30 GMT'}]",2021-01-28,"[['Sienz', 'Johann', ''], ['Innocente', 'Mauro S.', '']]","['Particle Swarms', 'Artificial Intelligence', 'Optimization', 'Scheduling']"
7984,1909.12713,Jakub Ber\'anek,"Stanislav B\""ohm, Jakub Ber\'anek, Martin \v{S}urkovsk\'y",Haydi: Rapid Prototyping and Combinatorial Objects,,"Foundations of Information and Knowledge Systems - 10th
  International Symposium, FoIKS 2018, Budapest, Hungary, May 14-18, 2018,
  Proceedings. Lecture Notes in Computer Science 10833, Springer 2018, ISBN
  978-3-319-90049-0",10.1007/978-3-319-90050-6_8,,cs.FL cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Haydi (http://haydi.readthedocs.io) is a framework for generating discrete
structures. It provides a way to define a structure from basic building blocks
and then enumerate all elements, all non-isomorphic elements, or generate
random elements in the structure. Haydi is designed as a tool for rapid
prototyping. It is implemented as a pure Python package and supports execution
in distributed environments. The goal of this paper is to give the overall
picture of Haydi together with a formal definition for the case of generating
canonical forms.
","[{'version': 'v1', 'created': 'Fri, 27 Sep 2019 14:35:49 GMT'}]",2020-10-22,"[['Böhm', 'Stanislav', ''], ['Beránek', 'Jakub', ''], ['Šurkovský', 'Martin', '']]","['combinatorial objects', 'rapid prototyping', 'canonical representation']"
7985,2109.00812,Yiming Qian,"Yiming Qian, Cheikh Brahim El Vaigh, Yuta Nakashima, Benjamin Renoust,
  Hajime Nagahara, Yutaka Fujioka",Built Year Prediction from Buddha Face with Heterogeneous Labels,,,10.1145/3475720.3484441,,cs.CV cs.MM,http://creativecommons.org/licenses/by/4.0/,"  Buddha statues are a part of human culture, especially of the Asia area, and
they have been alongside human civilisation for more than 2,000 years. As
history goes by, due to wars, natural disasters, and other reasons, the records
that show the built years of Buddha statues went missing, which makes it an
immense work for historians to estimate the built years. In this paper, we
pursue the idea of building a neural network model that automatically estimates
the built years of Buddha statues based only on their face images. Our model
uses a loss function that consists of three terms: an MSE loss that provides
the basis for built year estimation; a KL divergence-based loss that handles
the samples with both an exact built year and a possible range of built years
(e.g., dynasty or centuries) estimated by historians; finally a regularisation
that utilises both labelled and unlabelled samples based on manifold
assumption. By combining those three terms in the training process, we show
that our method is able to estimate built years for given images with 37.5
years of a mean absolute error on the test set.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2021 09:42:52 GMT'}]",2021-09-03,"[['Qian', 'Yiming', ''], ['Vaigh', 'Cheikh Brahim El', ''], ['Nakashima', 'Yuta', ''], ['Renoust', 'Benjamin', ''], ['Nagahara', 'Hajime', ''], ['Fujioka', 'Yutaka', '']]","['Semi-supervised Learning', 'KL Divergence', 'Deep Learning', 'Regression']"
7986,2201.00318,Raviraj Joshi,"Aamir Miyajiwala, Arnav Ladkat, Samiksha Jagadale, Raviraj Joshi","On Sensitivity of Deep Learning Based Text Classification Algorithms to
  Practical Input Perturbations",Accepted at Computing Conference 2022,,10.1007/978-3-031-10464-0_42,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Text classification is a fundamental Natural Language Processing task that
has a wide variety of applications, where deep learning approaches have
produced state-of-the-art results. While these models have been heavily
criticized for their black-box nature, their robustness to slight perturbations
in input text has been a matter of concern. In this work, we carry out a
data-focused study evaluating the impact of systematic practical perturbations
on the performance of the deep learning based text classification models like
CNN, LSTM, and BERT-based algorithms. The perturbations are induced by the
addition and removal of unwanted tokens like punctuation and stop-words that
are minimally associated with the final performance of the model. We show that
these deep learning approaches including BERT are sensitive to such legitimate
input perturbations on four standard benchmark datasets SST2, TREC-6, BBC News,
and tweet_eval. We observe that BERT is more susceptible to the removal of
tokens as compared to the addition of tokens. Moreover, LSTM is slightly more
sensitive to input perturbations as compared to CNN based model. The work also
serves as a practical guide to assessing the impact of discrepancies in
train-test conditions on the final performance of models.
","[{'version': 'v1', 'created': 'Sun, 2 Jan 2022 08:33:49 GMT'}, {'version': 'v2', 'created': 'Sun, 23 Jan 2022 14:50:54 GMT'}]",2022-07-08,"[['Miyajiwala', 'Aamir', ''], ['Ladkat', 'Arnav', ''], ['Jagadale', 'Samiksha', ''], ['Joshi', 'Raviraj', '']]","['Natural Language Processing', 'Input Perturbations', 'ModelRobustness', 'Text Classification', 'Input Preprocessing']"
7987,2104.01712,Neil Chue Hong,"Neil P. Chue Hong, Jeremy Cohen and Caroline Jay","Understanding Equity, Diversity and Inclusion Challenges Within the
  Research Software Community","14 pages, 3 figures and tables, SE4Science21 track at 2021
  International Conference on Computational Science",Lecture Notes in Computer Science. Vol. 12747 (2021) pp390-403,10.1007/978-3-030-77980-1_30,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Research software -- specialist software used to support or undertake
research -- is of huge importance to researchers. It contributes to significant
advances in the wider world and requires collaboration between people with
diverse skills and backgrounds. Analysis of recent survey data provides
evidence for a lack of diversity in the Research Software Engineer community.
We identify interventions which could address challenges in the wider research
software community and highlight areas where the community is becoming more
diverse. There are also lessons that are applicable, more generally, to the
field of software development around recruitment from other disciplines and the
importance of welcoming communities.
","[{'version': 'v1', 'created': 'Sun, 4 Apr 2021 23:37:33 GMT'}]",2021-06-22,"[['Hong', 'Neil P. Chue', ''], ['Cohen', 'Jeremy', ''], ['Jay', 'Caroline', '']]","['research software', 'software engineering', 'research softwareengineering', 'diversity', 'EDI']"
7988,2202.00339,Yasser Roudi,Matteo Marsili and Yasser Roudi,Quantifying Relevance in Learning and Inference,"review article, 63 pages, 14 figures",,10.1016/j.physrep.2022.03.001,,cs.LG cond-mat.dis-nn physics.data-an stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Learning is a distinctive feature of intelligent behaviour. High-throughput
experimental data and Big Data promise to open new windows on complex systems
such as cells, the brain or our societies. Yet, the puzzling success of
Artificial Intelligence and Machine Learning shows that we still have a poor
conceptual understanding of learning. These applications push statistical
inference into uncharted territories where data is high-dimensional and scarce,
and prior information on ""true"" models is scant if not totally absent. Here we
review recent progress on understanding learning, based on the notion of
""relevance"". The relevance, as we define it here, quantifies the amount of
information that a dataset or the internal representation of a learning machine
contains on the generative model of the data. This allows us to define
maximally informative samples, on one hand, and optimal learning machines on
the other. These are ideal limits of samples and of machines, that contain the
maximal amount of information about the unknown generative process, at a given
resolution (or level of compression). Both ideal limits exhibit critical
features in the statistical sense: Maximally informative samples are
characterised by a power-law frequency distribution (statistical criticality)
and optimal learning machines by an anomalously large susceptibility. The
trade-off between resolution (i.e. compression) and relevance distinguishes the
regime of noisy representations from that of lossy compression. These are
separated by a special point characterised by Zipf's law statistics. This
identifies samples obeying Zipf's law as the most compressed loss-less
representations that are optimal in the sense of maximal relevance. Criticality
in optimal learning machines manifests in an exponential degeneracy of energy
levels, that leads to unusual thermodynamic properties.
","[{'version': 'v1', 'created': 'Tue, 1 Feb 2022 11:16:04 GMT'}]",2022-05-04,"[['Marsili', 'Matteo', ''], ['Roudi', 'Yasser', '']]","['Relevance', 'Statistical Inference', 'Machine Learning', 'Information Theory']"
7989,2008.00496,R Jaberi,Raed Jaberi,"Minimum $2$-vertex strongly biconnected spanning directed subgraph
  problem",,Discrete Mathematics Letters (DML) 7 (2021) 40-73,10.47443/dml.2021.0024,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A directed graph $G=(V,E)$ is strongly biconnected if $G$ is strongly
connected and its underlying graph is biconnected. A strongly biconnected
directed graph $G=(V,E)$ is called $2$-vertex-strongly biconnected if $|V|\geq
3$ and the induced subgraph on $V\setminus\left\lbrace w\right\rbrace $ is
strongly biconnected for every vertex $w\in V$. In this paper we study the
following problem.
  Given a $2$-vertex-strongly biconnected directed graph $G=(V,E)$, compute an
edge subset $E^{2sb} \subseteq E$ of minimum size such that the subgraph
$(V,E^{2sb})$ is $2$-vertex-strongly biconnected.
","[{'version': 'v1', 'created': 'Sun, 2 Aug 2020 14:50:17 GMT'}]",2022-05-10,"[['Jaberi', 'Raed', '']]","['Directed graphs', 'Approximation algorithms', 'Graph algorithms', 'strongly connected graphs', 'Strongly biconnected directed graphs']"
7990,2207.06890,Luiz Gadelha Jr.,"Luiz Gadelha, Martin Hohmuth, Mahnoor Zulfiqar, David Sch\""one, Sheeba
  Samuel, Maria Sorokina, Christoph Steinbeck, Birgitta K\""onig-Ries","Toward a Framework for Integrative, FAIR, and Reproducible Management of
  Data on the Dynamic Balance of Microbial Communities",,,10.1109/eScience55777.2022.00080,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing volumes of data produced by high-throughput instruments
coupled with advanced computational infrastructures for scientific computing
have enabled what is often called a {\em Fourth Paradigm} for scientific
research based on the exploration of large datasets. Current scientific
research is often interdisciplinary, making data integration a critical
technique for combining data from different scientific domains. Research data
management is a critical part of this paradigm, through the proposition and
development of methods, techniques, and practices for managing scientific data
through their life cycle. Research on microbial communities follows the same
pattern of production of large amounts of data obtained, for instance, from
sequencing organisms present in environmental samples. Data on microbial
communities can come from a multitude of sources and can be stored in different
formats. For example, data from metagenomics, metatranscriptomics,
metabolomics, and biological imaging are often combined in studies. In this
article, we describe the design and current state of implementation of an
integrative research data management framework for the Cluster of Excellence
Balance of the Microverse aiming to allow for data on microbial communities to
be more easily discovered, accessed, combined, and reused. This framework is
based on research data repositories and best practices for managing workflows
used in the analysis of microbial communities, which includes recording
provenance information for tracking data derivation.
","[{'version': 'v1', 'created': 'Thu, 14 Jul 2022 13:20:59 GMT'}]",2022-12-20,"[['Gadelha', 'Luiz', ''], ['Hohmuth', 'Martin', ''], ['Zulfiqar', 'Mahnoor', ''], ['Schöne', 'David', ''], ['Samuel', 'Sheeba', ''], ['Sorokina', 'Maria', ''], ['Steinbeck', 'Christoph', ''], ['König-Ries', 'Birgitta', '']]","['research data management', 'data integration', 'computational reproducibility', 'microbial communities']"
7991,2011.11057,Zhaozhou Li,"Zhao-Zhou Li, Lu Li, Zhengyi Shao",Robust Gaussian Process Regression Based on Iterative Trimming,"major revision, 11 pages, 8 figures, 2 tables; accepted by Astronomy
  and Computing; code available at https://github.com/syrte/robustgp/",,10.1016/j.ascom.2021.100483,,cs.LG astro-ph.IM stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Gaussian process (GP) regression can be severely biased when the data are
contaminated by outliers. This paper presents a new robust GP regression
algorithm that iteratively trims the most extreme data points. While the new
algorithm retains the attractive properties of the standard GP as a
nonparametric and flexible regression method, it can greatly improve the model
accuracy for contaminated data even in the presence of extreme or abundant
outliers. It is also easier to implement compared with previous robust GP
variants that rely on approximate inference. Applied to a wide range of
experiments with different contamination levels, the proposed method
significantly outperforms the standard GP and the popular robust GP variant
with the Student-t likelihood in most test cases. In addition, as a practical
example in the astrophysical study, we show that this method can precisely
determine the main-sequence ridge line in the color-magnitude diagram of star
clusters.
","[{'version': 'v1', 'created': 'Sun, 22 Nov 2020 16:43:35 GMT'}, {'version': 'v2', 'created': 'Sun, 13 Jun 2021 13:49:02 GMT'}]",2021-06-15,"[['Li', 'Zhao-Zhou', ''], ['Li', 'Lu', ''], ['Shao', 'Zhengyi', '']]","['Gaussian process', 'robust regression', 'outlier detection', 'ridge line', 'star clusters']"
7992,2108.07555,Mayank Baranwal,"Somjit Nath, Mayank Baranwal and Harshad Khadilkar","Revisiting State Augmentation methods for Reinforcement Learning with
  Stochastic Delays",Accepted at CIKM'21,,10.1145/3459637.3482386,,cs.LG cs.AI cs.SY eess.SY math.OC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Several real-world scenarios, such as remote control and sensing, are
comprised of action and observation delays. The presence of delays degrades the
performance of reinforcement learning (RL) algorithms, often to such an extent
that algorithms fail to learn anything substantial. This paper formally
describes the notion of Markov Decision Processes (MDPs) with stochastic delays
and shows that delayed MDPs can be transformed into equivalent standard MDPs
(without delays) with significantly simplified cost structure. We employ this
equivalence to derive a model-free Delay-Resolved RL framework and show that
even a simple RL algorithm built upon this framework achieves near-optimal
rewards in environments with stochastic delays in actions and observations. The
delay-resolved deep Q-network (DRDQN) algorithm is bench-marked on a variety of
environments comprising of multi-step and stochastic delays and results in
better performance, both in terms of achieving near-optimal rewards and
minimizing the computational overhead thereof, with respect to the currently
established algorithms.
","[{'version': 'v1', 'created': 'Tue, 17 Aug 2021 10:45:55 GMT'}]",2021-08-18,"[['Nath', 'Somjit', ''], ['Baranwal', 'Mayank', ''], ['Khadilkar', 'Harshad', '']]","['Delays in learning', 'Reinforcement Learning', 'MDPs']"
7993,2203.01157,Amy Winecoff,"Amy A. Winecoff, Elizabeth Anne Watkins","Artificial Concepts of Artificial Intelligence: Institutional Compliance
  and Resistance in AI Startups",,,10.1145/3514094.3534138,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Scholars and industry practitioners have debated how to best develop
interventions for ethical artificial intelligence (AI). Such interventions
recommend that companies building and using AI tools change their technical
practices, but fail to wrangle with critical questions about the organizational
and institutional context in which AI is developed. In this paper, we
contribute descriptive research around the life of ""AI"" as a discursive concept
and organizational practice in an understudied sphere--emerging AI
startups--and with a focus on extra-organizational pressures faced by
entrepreneurs. Leveraging a theoretical lens for how organizations change, we
conducted semi-structured interviews with 23 entrepreneurs working at
early-stage AI startups. We find that actors within startups both conform to
and resist institutional pressures. Our analysis identifies a central tension
for AI entrepreneurs: they often valued scientific integrity and methodological
rigor; however, influential external stakeholders either lacked the technical
knowledge to appreciate entrepreneurs' emphasis on rigor or were more focused
on business priorities. As a result, entrepreneurs adopted hyped marketing
messages about AI that diverged from their scientific values, but attempted to
preserve their legitimacy internally. Institutional pressures and
organizational constraints also influenced entrepreneurs' modeling practices
and their response to actual or impending regulation. We conclude with a
discussion for how such pressures could be used as leverage for effective
interventions towards building ethical AI.
","[{'version': 'v1', 'created': 'Wed, 2 Mar 2022 14:56:28 GMT'}, {'version': 'v2', 'created': 'Thu, 26 May 2022 21:28:51 GMT'}, {'version': 'v3', 'created': 'Tue, 14 Jun 2022 15:24:15 GMT'}]",2022-06-15,"[['Winecoff', 'Amy A.', ''], ['Watkins', 'Elizabeth Anne', '']]","['organizational theory', 'artificial intelligence', 'industry practice', 'qualitative methods', 'ethical systems']"
7994,2006.02785,Erik Faessler,"Erik Faessler, Michel Oleynik, Udo Hahn","What Makes a Top-Performing Precision Medicine Search Engine? Tracing
  Main System Features in a Systematic Way","Accepted for SIGIR2020, 10 pages",,10.1145/3397271.3401048,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  From 2017 to 2019 the Text REtrieval Conference (TREC) held a challenge task
on precision medicine using documents from medical publications (PubMed) and
clinical trials. Despite lots of performance measurements carried out in these
evaluation campaigns, the scientific community is still pretty unsure about the
impact individual system features and their weights have on the overall system
performance. In order to overcome this explanatory gap, we first determined
optimal feature configurations using the Sequential Model-based Algorithm
Configuration (SMAC) program and applied its output to a BM25-based search
engine. We then ran an ablation study to systematically assess the individual
contributions of relevant system features: BM25 parameters, query type and
weighting schema, query expansion, stop word filtering, and keyword boosting.
For evaluation, we employed the gold standard data from the three TREC-PM
installments to evaluate the effectiveness of different features using the
commonly shared infNDCG metric.
","[{'version': 'v1', 'created': 'Thu, 4 Jun 2020 11:25:10 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Jun 2020 05:38:25 GMT'}]",2020-06-08,"[['Faessler', 'Erik', ''], ['Oleynik', 'Michel', ''], ['Hahn', 'Udo', '']]","['TREC', 'precision medicine', 'search engine evaluation']"
7995,1908.10632,Friso Selten,"Friso Selten, Cameron Neylon, Chun-Kai Huang, and Paul Groth",A Longitudinal Analysis of University Rankings,26 pages,,10.1162/qss_a_00052,,cs.SI cs.DL physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  Pressured by globalization and the increasing demand for public organisations
to be accountable, efficient and transparent, university rankings have become
an important tool for assessing the quality of higher education institutions.
It is therefore important to carefully assess exactly what these rankings
measure. In this paper, the three major global university rankings, The
Academic Ranking of World Universities, The Times Higher Education and the
Quacquarelli Symonds World University Rankings, are studied. After a
description of the ranking methodologies, it is shown that university rankings
are stable over time but that there is variation between the three rankings.
Furthermore, using Principal Component Analysis and Exploratory Factor
Analysis, we show that the variables used to construct the rankings primarily
measure two underlying factors: a universities reputation and its research
performance. By correlating these factors and plotting regional aggregates of
universities on the two factors, differences between the rankings are made
visible. Last, we elaborate how the results from these analysis can be viewed
in light of often voiced critiques of the ranking process. This indicates that
the variables used by the rankings might not capture the concepts they claim to
measure. Doing so the study provides evidence of the ambiguous nature of
university ranking's quantification of university performance.
","[{'version': 'v1', 'created': 'Wed, 28 Aug 2019 10:43:07 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Sep 2019 13:47:21 GMT'}, {'version': 'v3', 'created': 'Wed, 15 Jan 2020 13:16:50 GMT'}, {'version': 'v4', 'created': 'Mon, 20 Jan 2020 08:18:08 GMT'}]",2022-11-10,"[['Selten', 'Friso', ''], ['Neylon', 'Cameron', ''], ['Huang', 'Chun-Kai', ''], ['Groth', 'Paul', '']]","['University Rankings', 'Longitudinal Analysis', 'Comparative Analysis', 'Principal Component Analysis', 'Factor Analysis']"
7996,2112.15089,Yongduo Sui,"Yongduo Sui, Xiang Wang, Jiancan Wu, Min Lin, Xiangnan He, Tat-Seng
  Chua","Causal Attention for Interpretable and Generalizable Graph
  Classification",Accepted to KDD 2022,,10.1145/3534678.3539366,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In graph classification, attention and pooling-based graph neural networks
(GNNs) prevail to extract the critical features from the input graph and
support the prediction. They mostly follow the paradigm of learning to attend,
which maximizes the mutual information between the attended graph and the
ground-truth label. However, this paradigm makes GNN classifiers recklessly
absorb all the statistical correlations between input features and labels in
the training data, without distinguishing the causal and noncausal effects of
features. Instead of underscoring the causal features, the attended graphs are
prone to visit the noncausal features as the shortcut to predictions. Such
shortcut features might easily change outside the training distribution,
thereby making the GNN classifiers suffer from poor generalization. In this
work, we take a causal look at the GNN modeling for graph classification. With
our causal assumption, the shortcut feature serves as a confounder between the
causal feature and prediction. It tricks the classifier to learn spurious
correlations that facilitate the prediction in in-distribution (ID) test
evaluation, while causing the performance drop in out-of-distribution (OOD)
test data. To endow the classifier with better interpretation and
generalization, we propose the Causal Attention Learning (CAL) strategy, which
discovers the causal patterns and mitigates the confounding effect of
shortcuts. Specifically, we employ attention modules to estimate the causal and
shortcut features of the input graph. We then parameterize the backdoor
adjustment of causal theory -- combine each causal feature with various
shortcut features. It encourages the stable relationships between the causal
estimation and prediction, regardless of the changes in shortcut parts and
distributions. Extensive experiments on synthetic and real-world datasets
demonstrate the effectiveness of CAL.
","[{'version': 'v1', 'created': 'Thu, 30 Dec 2021 15:22:35 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Jun 2022 13:14:56 GMT'}]",2022-06-14,"[['Sui', 'Yongduo', ''], ['Wang', 'Xiang', ''], ['Wu', 'Jiancan', ''], ['Lin', 'Min', ''], ['He', 'Xiangnan', ''], ['Chua', 'Tat-Seng', '']]","['Graph Neural Networks', 'Graph Classification', 'Causal Intervention']"
7997,2105.13563,Stephen MacDonell,"Paolo Tell, Jil Kl\""under, Steffen K\""upper, David Raffo, Stephen
  MacDonell, J\""urgen M\""unch, Dietmar Pfahl, Oliver Linssen, and Marco
  Kuhrmann",Towards the statistical construction of hybrid development methods,"Journal paper, 16 pages 9 figures, 5 tables. arXiv admin note:
  substantial text overlap with arXiv:2101.08016","Towards the statistical construction of hybrid development
  methods, Journal of Software: Evolution and Process; 33:e2315 (2021)",10.1002/smr.2315,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hardly any software development process is used as prescribed by authors or
standards. Regardless of company size or industry sector, a majority of project
teams and companies use hybrid development methods (short: hybrid methods) that
combine different development methods and practices. Even though such hybrid
methods are highly individualized, a common understanding of how to
systematically construct synergetic practices is missing. In this article, we
make a first step towards a statistical construction procedure for hybrid
methods. Grounded in 1467 data points from a large-scale practitioner survey,
we study the question: What are hybrid methods made of and how can they be
systematically constructed? Our findings show that only eight methods and few
practices build the core of modern software development. Using an 85% agreement
level in the participants' selections, we provide examples illustrating how
hybrid methods can be characterized by the practices they are made of.
Furthermore, using this characterization, we develop an initial construction
procedure, which allows for defining a method frame and enriching it
incrementally to devise a hybrid method using ranked sets of practice.
","[{'version': 'v1', 'created': 'Fri, 28 May 2021 03:10:46 GMT'}]",2021-05-31,"[['Tell', 'Paolo', ''], ['Klünder', 'Jil', ''], ['Küpper', 'Steffen', ''], ['Raffo', 'David', ''], ['MacDonell', 'Stephen', ''], ['Münch', 'Jürgen', ''], ['Pfahl', 'Dietmar', ''], ['Linssen', 'Oliver', ''], ['Kuhrmann', 'Marco', '']]","['hybrid methods', 'software development', 'software process', 'survey research']"
7998,2010.06989,Fatima Zahra Yamani,"Fatima Zahra Yamani, Mohamed El Merouani","Review the Enterprise Resource Planning in Moroccan Healthcare
  Organizations",,"IJCSI International Journal of Computer Science Issues, Volume 17,
  Issue 2, March 2020",10.5281/zenodo.3987129,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Hospital Information Systems (HIS) in Morocco take a central place in the
process of patient care. An approach is made to analyze the current situation
of the HIS within the institutions in order to bring an integral and generic
vision, allowing the judicious articulation of the business and IT layers.
Currently, the Enterprise Resource Planning (ERP) implemented remains a system
consisting of several applications dedicated to specific areas. These systems
have become an indispensable element within any hospital. The goal of our study
is to discover how the ERP has been used in Moroccan healthcare sector and how
these software should be implemented and used to improve healthcare services.
","[{'version': 'v1', 'created': 'Tue, 22 Sep 2020 20:55:04 GMT'}]",2020-10-15,"[['Yamani', 'Fatima Zahra', ''], ['Merouani', 'Mohamed El', '']]","['Hospital Information System', 'HIS', 'Healthcare ERP', 'Enterprise Resource Planning']"
7999,1708.01397,Zheng Li,Zheng Li and William Tarneberg and Maria Kihl and Anders Robertsson,Using a Predator-Prey Model to Explain Variations of Cloud Spot Price,"Proceedings of the 6th International Conference on Cloud Computing
  and Services Science (CLOSER 2016), pp. 51-58, Rome, Italy, April 23-25, 2016",,10.5220/0005808600510058,,cs.DC cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The spot pricing scheme has been considered to be resource-efficient for
providers and cost-effective for consumers in the Cloud market. Nevertheless,
unlike the static and straightforward strategies of trading on-demand and
reserved Cloud services, the market-driven mechanism for trading spot service
would be complicated for both implementation and understanding. The largely
invisible market activities and their complex interactions could especially
make Cloud consumers hesitate to enter the spot market. To reduce the
complexity in understanding the Cloud spot market, we decided to reveal the
backend information behind spot price variations. Inspired by the methodology
of reverse engineering, we developed a Predator-Prey model that can simulate
the interactions between demand and resource based on the visible spot price
traces. The simulation results have shown some basic regular patterns of market
activities with respect to Amazon's spot instance type m3.large. Although the
findings of this study need further validation by using practical data, our
work essentially suggests a promising approach (i.e.~using a Predator-Prey
model) to investigate spot market activities.
","[{'version': 'v1', 'created': 'Fri, 4 Aug 2017 06:48:07 GMT'}]",2017-08-07,"[['Li', 'Zheng', ''], ['Tarneberg', 'William', ''], ['Kihl', 'Maria', ''], ['Robertsson', 'Anders', '']]","['Cloud Computing', 'Cloud Spot Pricing', 'Cloud Spot Market', 'Predator-Prey Model']"
8000,2202.04648,Katiana Kontolati,"Katiana Kontolati, Dimitrios Loukrezis, Dimitris G. Giovanis, Lohit
  Vandanapu, Michael D. Shields","A survey of unsupervised learning methods for high-dimensional
  uncertainty quantification in black-box-type problems","45 pages, 14 figures",,10.1016/j.jcp.2022.111313,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Constructing surrogate models for uncertainty quantification (UQ) on complex
partial differential equations (PDEs) having inherently high-dimensional
$\mathcal{O}(10^{\ge 2})$ stochastic inputs (e.g., forcing terms, boundary
conditions, initial conditions) poses tremendous challenges. The curse of
dimensionality can be addressed with suitable unsupervised learning techniques
used as a pre-processing tool to encode inputs onto lower-dimensional subspaces
while retaining its structural information and meaningful properties. In this
work, we review and investigate thirteen dimension reduction methods including
linear and nonlinear, spectral, blind source separation, convex and non-convex
methods and utilize the resulting embeddings to construct a mapping to
quantities of interest via polynomial chaos expansions (PCE). We refer to the
general proposed approach as manifold PCE (m-PCE), where manifold corresponds
to the latent space resulting from any of the studied dimension reduction
methods. To investigate the capabilities and limitations of these methods we
conduct numerical tests for three physics-based systems (treated as
black-boxes) having high-dimensional stochastic inputs of varying complexity
modeled as both Gaussian and non-Gaussian random fields to investigate the
effect of the intrinsic dimensionality of input data. We demonstrate both the
advantages and limitations of the unsupervised learning methods and we conclude
that a suitable m-PCE model provides a cost-effective approach compared to
alternative algorithms proposed in the literature, including recently proposed
expensive deep neural network-based surrogates and can be readily applied for
high-dimensional UQ in stochastic PDEs.
","[{'version': 'v1', 'created': 'Wed, 9 Feb 2022 16:33:40 GMT'}, {'version': 'v2', 'created': 'Mon, 16 May 2022 21:16:01 GMT'}]",2022-05-27,"[['Kontolati', 'Katiana', ''], ['Loukrezis', 'Dimitrios', ''], ['Giovanis', 'Dimitris G.', ''], ['Vandanapu', 'Lohit', ''], ['Shields', 'Michael D.', '']]","['High-dimensional uncertainty quantification', 'dimension reduction', 'unsupervised learning', 'surrogate modeling', 'manifold learning', 'low-dimensional embedding']"
8001,2202.06281,Piotr Koniusz,"Yifei Zhang, Hao Zhu, Ziqiao Meng, Piotr Koniusz, Irwin King",Graph-adaptive Rectified Linear Unit for Graph Neural Networks,"TheWebConf (WWW), 2022",,10.1145/3485447.3512159,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph Neural Networks (GNNs) have achieved remarkable success by extending
traditional convolution to learning on non-Euclidean data. The key to the GNNs
is adopting the neural message-passing paradigm with two stages: aggregation
and update. The current design of GNNs considers the topology information in
the aggregation stage. However, in the updating stage, all nodes share the same
updating function. The identical updating function treats each node embedding
as i.i.d. random variables and thus ignores the implicit relationships between
neighborhoods, which limits the capacity of the GNNs. The updating function is
usually implemented with a linear transformation followed by a non-linear
activation function. To make the updating function topology-aware, we inject
the topological information into the non-linear activation function and propose
Graph-adaptive Rectified Linear Unit (GReLU), which is a new parametric
activation function incorporating the neighborhood information in a novel and
efficient way. The parameters of GReLU are obtained from a hyperfunction based
on both node features and the corresponding adjacent matrix. To reduce the risk
of overfitting and the computational cost, we decompose the hyperfunction as
two independent components for nodes and features respectively. We conduct
comprehensive experiments to show that our plug-and-play GReLU method is
efficient and effective given different GNN backbones and various downstream
tasks.
","[{'version': 'v1', 'created': 'Sun, 13 Feb 2022 10:54:59 GMT'}]",2022-02-15,"[['Zhang', 'Yifei', ''], ['Zhu', 'Hao', ''], ['Meng', 'Ziqiao', ''], ['Koniusz', 'Piotr', ''], ['King', 'Irwin', '']]","['Graph Neural Networks', 'Rectified Linear Unit', 'Graph Representation Learning']"
8002,2111.00199,Clayton Miller,"Mahmoud Abdelrahman, Adrian Chong, and Clayton Miller","Personal thermal comfort models using digital twins: Preference
  prediction with BIM-extracted spatial-temporal proximity data from Build2Vec",,Building and Environment 207 (January 2022): 108532,10.1016/j.buildenv.2021.108532,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Conventional thermal preference prediction in buildings has limitations due
to the difficulty in capturing all environmental and personal factors. New
model features can improve the ability of a machine learning model to classify
a person's thermal preference. The spatial context of a building can provide
information to models about the windows, walls, heating and cooling sources,
air diffusers, and other factors that create micro-environments that influence
thermal comfort. Due to spatial heterogeneity, it is impractical to position
sensors at a high enough resolution to capture all conditions. This research
aims to build upon an existing vector-based spatial model, called Build2Vec,
for predicting spatial-temporal occupants' indoor environmental preferences.
Build2Vec utilizes the spatial data from the Building Information Model (BIM)
and indoor localization in a real-world setting. This framework uses
longitudinal intensive thermal comfort subjective feedback from smart
watch-based ecological momentary assessments (EMA). The aggregation of these
data is combined into a graph network structure (i.e., objects and relations)
and used as input for a classification model to predict occupant thermal
preference. The results of a test implementation show 14-28% accuracy
improvement over a set of baselines that use conventional thermal preference
prediction input variables.
","[{'version': 'v1', 'created': 'Sat, 30 Oct 2021 07:43:11 GMT'}]",2021-12-13,"[['Abdelrahman', 'Mahmoud', ''], ['Chong', 'Adrian', ''], ['Miller', 'Clayton', '']]","['Spatial-temporal modeling', 'Building information models', 'Graph network structure', 'Personal thermal comfort model', 'Digital twin']"
8003,2106.10962,I\~nigo Martinez,"Urtzi Otamendi and I\~nigo Martinez and Marco Quartulli and Igor G.
  Olaizola and Elisabeth Viles and Werther Cambarau","Segmentation of cell-level anomalies in electroluminescence images of
  photovoltaic modules","16 pages, 14 figures","Solar Energy, Volume 220, 2021",10.1016/j.solener.2021.03.058,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the operation & maintenance (O&M) of photovoltaic (PV) plants, the early
identification of failures has become crucial to maintain productivity and
prolong components' life. Of all defects, cell-level anomalies can lead to
serious failures and may affect surrounding PV modules in the long run. These
fine defects are usually captured with high spatial resolution
electroluminescence (EL) imaging. The difficulty of acquiring such images has
limited the availability of data. For this work, multiple data resources and
augmentation techniques have been used to surpass this limitation. Current
state-of-the-art detection methods extract barely low-level information from
individual PV cell images, and their performance is conditioned by the
available training data. In this article, we propose an end-to-end deep
learning pipeline that detects, locates and segments cell-level anomalies from
entire photovoltaic modules via EL images. The proposed modular pipeline
combines three deep learning techniques: 1. object detection (modified
Faster-RNN), 2. image classification (EfficientNet) and 3. weakly supervised
segmentation (autoencoder). The modular nature of the pipeline allows to
upgrade the deep learning models to the further improvements in the
state-of-the-art and also extend the pipeline towards new functionalities.
","[{'version': 'v1', 'created': 'Mon, 21 Jun 2021 10:17:40 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Jan 2022 13:06:58 GMT'}]",2022-01-17,"[['Otamendi', 'Urtzi', ''], ['Martinez', 'Iñigo', ''], ['Quartulli', 'Marco', ''], ['Olaizola', 'Igor G.', ''], ['Viles', 'Elisabeth', ''], ['Cambarau', 'Werther', '']]","['electroluminescence images', 'photovoltaic modules', 'deep learning', 'anomaly detection', 'weakly supervisedsegmentation', 'deep autoencoder']"
8004,1905.10194,Zhiyuan Zhang,"Zhiyuan Zhang, Pengcheng Yang, Xuancheng Ren, Qi Su, Xu Sun",Memorized Sparse Backpropagation,Accepted to Neurocomputing,Neurocomputing 415C (2020) pp. 397-407,10.1016/j.neucom.2020.08.055,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural network learning is usually time-consuming since backpropagation needs
to compute full gradients and backpropagate them across multiple layers.
Despite its success of existing works in accelerating propagation through
sparseness, the relevant theoretical characteristics remain under-researched
and empirical studies found that they suffer from the loss of information
contained in unpropagated gradients. To tackle these problems, this paper
presents a unified sparse backpropagation framework and provides a detailed
analysis of its theoretical characteristics. Analysis reveals that when applied
to a multilayer perceptron, our framework essentially performs gradient descent
using an estimated gradient similar enough to the true gradient, resulting in
convergence in probability under certain conditions. Furthermore, a simple yet
effective algorithm named memorized sparse backpropagation (MSBP) is proposed
to remedy the problem of information loss by storing unpropagated gradients in
memory for learning in the next steps. Experimental results demonstrate that
the proposed MSBP is effective to alleviate the information loss in traditional
sparse backpropagation while achieving comparable acceleration.
","[{'version': 'v1', 'created': 'Fri, 24 May 2019 12:38:31 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Jun 2019 05:18:14 GMT'}, {'version': 'v3', 'created': 'Tue, 27 Oct 2020 05:08:14 GMT'}]",2020-10-28,"[['Zhang', 'Zhiyuan', ''], ['Yang', 'Pengcheng', ''], ['Ren', 'Xuancheng', ''], ['Su', 'Qi', ''], ['Sun', 'Xu', '']]","['Neural Networks', 'Backpropagation', 'Sparse Gradient', 'Acceleration']"
8005,2203.02200,Yanwu Yang,"Yanwu Yang, Xin Li, Bernard J. Jansen, Daniel Zeng","Aggregate effects of advertising decisions: a complex systems look at
  search engine advertising via an experimental study","26 pages, 7 figures, 5 tables","Internet Research, 28(4), 1079-1102 (2018)",10.1108/IntR-10-2017-0377,,cs.AI cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Purpose: We model group advertising decisions, which are the collective
decisions of every single advertiser within the set of advertisers who are
competing in the same auction or vertical industry, and examine resulting
market outcomes, via a proposed simulation framework named EXP-SEA
(Experimental Platform for Search Engine Advertising) supporting experimental
studies of collective behaviors in the context of search engine advertising.
Design: We implement the EXP-SEA to validate the proposed simulation framework,
also conduct three experimental studies on the aggregate impact of electronic
word-of-mouth, the competition level, and strategic bidding behaviors. EXP-SEA
supports heterogeneous participants, various auction mechanisms, and also
ranking and pricing algorithms. Findings: Findings from our three experiments
show that (a) both the market profit and advertising indexes such as number of
impressions and number of clicks are larger when the eWOM effect presents,
meaning social media certainly has some effect on search engine advertising
outcomes, (b) the competition level has a monotonic increasing effect on the
market performance, thus search engines have an incentive to encourage both the
eWOM among search users and competition among advertisers, and (c) given the
market-level effect of the percentage of advertisers employing a dynamic greedy
bidding strategy, there is a cut-off point for strategic bidding behaviors.
Originality: This is one of the first research works to explore collective
group decisions and resulting phenomena in the complex context of search engine
advertising via developing and validating a simulation framework that supports
assessments of various advertising strategies and estimations of the impact of
mechanisms on the search market.
","[{'version': 'v1', 'created': 'Fri, 4 Mar 2022 09:16:15 GMT'}]",2022-03-07,"[['Yang', 'Yanwu', ''], ['Li', 'Xin', ''], ['Jansen', 'Bernard J.', ''], ['Zeng', 'Daniel', '']]","['search engine advertising', 'experimental study', 'simulation', 'complex systems']"
8006,1904.08762,Ahsan Javed Awan Dr,"Stefano Corda, Gagandeep Singh, Ahsan Javed Awan, Roel Jordans and
  Henk Corporaal",Memory and Parallelism Analysis Using a Platform-Independent Approach,"22nd ACM International Workshop on Software and Compilers for
  Embedded Systems (SCOPES '19), May 2019",,10.1145/3323439.3323988,,cs.DC cs.AR cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Emerging computing architectures such as near-memory computing (NMC) promise
improved performance for applications by reducing the data movement between CPU
and memory. However, detecting such applications is not a trivial task. In this
ongoing work, we extend the state-of-the-art platform-independent software
analysis tool with NMC related metrics such as memory entropy, spatial
locality, data-level, and basic-block-level parallelism. These metrics help to
identify the applications more suitable for NMC architectures.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2019 13:25:52 GMT'}]",2019-04-19,"[['Corda', 'Stefano', ''], ['Singh', 'Gagandeep', ''], ['Awan', 'Ahsan Javed', ''], ['Jordans', 'Roel', ''], ['Corporaal', 'Henk', '']]","['Application characterization', 'LLVM IR', 'Memory', 'Parallelism', 'NearMemory Computing']"
8007,2111.14364,Xiaotong Wu,"Xiaotong Wu and Lianyong Qi and Xiaolong Xu and Shui Yu and Wanchun
  Dou and Xuyun Zhang","Crowdsourcing-based Multi-Device Communication Cooperation for Mobile
  High-Quality Video Enhancement","10 pages, 7 figures, to be published in WSDM'22",,10.1145/3488560.3498484,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The widespread use of mobile devices propels the development of new-fashioned
video applications like 3D (3-Dimensional) stereo video and mobile cloud game
via web or App, exerting more pressure on current mobile access network. To
address this challenge, we adopt the crowdsourcing paradigm to offer some
incentive for guiding the movement of recruited crowdsourcing users and
facilitate the optimization of the movement control decision. In this paper,
based on a practical 4G (4th-Generation) network throughput measurement study,
we formulate the movement control decision as a cost-constrained user
recruitment optimization problem. Considering the intractable complexity of
this problem, we focus first on a single crowdsourcing user case and propose a
pseudo-polynomial time complexity optimal solution. Then, we apply this
solution to solve the more general problem of multiple users and propose a
graph-partition-based algorithm. Extensive experiments show that our solutions
can improve the efficiency of real-time D2D communication for mobile videos.
","[{'version': 'v1', 'created': 'Mon, 29 Nov 2021 07:42:12 GMT'}]",2021-11-30,"[['Wu', 'Xiaotong', ''], ['Qi', 'Lianyong', ''], ['Xu', 'Xiaolong', ''], ['Yu', 'Shui', ''], ['Dou', 'Wanchun', ''], ['Zhang', 'Xuyun', '']]","['Mobile Videos', 'D2D Communication', 'Movement Control', 'UtilityOptimization']"
8008,1905.11707,Igor Ivkic,"Roland Pellegrini, Igor Ivkic and Markus Tauber",Function-as-a-Service Benchmarking Framework,https://www.scitepress.org/PublicationsDetail.aspx?ID=Df3810DssWw=&t=1,,10.5220/0007757304790487,,cs.PF cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud Service Providers deliver their products in form of 'as-a-Service',
which are typically categorized by the level of abstraction. This approach
hides the implementation details and shows only functionality to the user.
However, the problem is that it is hard to measure the performance of Cloud
services, because they behave like black boxes. Especially with
Function-as-a-Service it is even more difficult because it completely hides
server and infrastructure management from users by design. Cloud Service
Prodivers usually restrict the maximum size of code, memory and runtime of
Cloud Functions. Nevertheless, users need clarification if more ressources are
needed to deliver services in high quality. In this regard, we present the
architectural design of a new Function-as-a-Service benchmarking tool, which
allows users to evaluate the performance of Cloud Functions. Furthermore, the
capabilities of the framework are tested on an isolated platform with a
specific workload. The results show that users are able to get insights into
Function-as-a-Service environments. This, in turn, allows users to identify
factors which may slow down or speed up the performance of Cloud Functions.
","[{'version': 'v1', 'created': 'Tue, 28 May 2019 09:41:17 GMT'}]",2019-05-29,"[['Pellegrini', 'Roland', ''], ['Ivkic', 'Igor', ''], ['Tauber', 'Markus', '']]","['Cloud Computing', 'Function-as-a-Service', 'Benchmarking']"
8009,2107.04476,"Alexander Sch\""afer","Alexander Sch\""afer, Tomoko Isomura, Gerd Reis, Katsumi Watanabe,
  Didier Stricker",MutualEyeContact: A conversation analysis tool with focus on eye contact,,,10.1145/3379156.3391340,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Eye contact between individuals is particularly important for understanding
human behaviour. To further investigate the importance of eye contact in social
interactions, portable eye tracking technology seems to be a natural choice.
However, the analysis of available data can become quite complex. Scientists
need data that is calculated quickly and accurately. Additionally, the relevant
data must be automatically separated to save time. In this work, we propose a
tool called MutualEyeContact which excels in those tasks and can help
scientists to understand the importance of (mutual) eye contact in social
interactions. We combine state-of-the-art eye tracking with face recognition
based on machine learning and provide a tool for analysis and visualization of
social interaction sessions. This work is a joint collaboration of computer
scientists and cognitive scientists. It combines the fields of social and
behavioural science with computer vision and deep learning.
","[{'version': 'v1', 'created': 'Fri, 9 Jul 2021 15:05:53 GMT'}]",2021-07-12,"[['Schäfer', 'Alexander', ''], ['Isomura', 'Tomoko', ''], ['Reis', 'Gerd', ''], ['Watanabe', 'Katsumi', ''], ['Stricker', 'Didier', '']]","['mutual eye contact', 'conversation analysis', 'eye tracking', 'visualization tool']"
8010,2201.03492,Lawrence Smolinsky,"Lawrence Smolinsky, Bernhard Klingenberg, and Brian D. Marx","Interpretation and inference for altmetric indicators arising from
  sparse data statistics",To appear in the Journal of Informetrics,,10.1016/j.joi.2022.101250,,cs.DL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In 2018 Bornmann and Haunschild (2018a) introduced a new indicator called the
Mantel-Haenszel quotient (MHq) to measure alternative metrics (or altmetrics)
of scientometric data. In this article we review the Mantel-Haenszel
statistics, point out two errors in the literature, and introduce a new
indicator. First, we correct the interpretation of MHq and mention that it is
still a meaningful indicator. Second, we correct the variance formula for MHq,
which leads to narrower confidence intervals. A simulation study shows the
superior performance of our variance estimator and confidence intervals. Since
MHq does not match its original description in the literature, we propose a new
indicator, the Mantel-Haenszel row risk ratio (MHRR), to meet that need.
Interpretation and statistical inference for MHRR are discussed. For both MHRR
and MHq, a value greater (less) than one means performance is better (worse)
than in the reference set called the world.
","[{'version': 'v1', 'created': 'Mon, 10 Jan 2022 17:42:10 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Jan 2022 16:37:59 GMT'}, {'version': 'v3', 'created': 'Thu, 27 Jan 2022 03:41:06 GMT'}]",2022-01-28,"[['Smolinsky', 'Lawrence', ''], ['Klingenberg', 'Bernhard', ''], ['Marx', 'Brian D.', '']]","['Bibliometrics', 'Altmetrics', 'Mantel-Haenszel quotient (MHq)', 'MantelHaenszel row risk ratio (MHRR)', 'relative risk', 'risk ratio']"
8011,1704.03851,Petr Vabishchevich N.,Petr N. Vabishchevich,"Numerical solution of time-dependent problems with fractional power
  elliptic operator","25 pages, 13 figures, 6 tables. arXiv admin note: text overlap with
  arXiv:1510.08297, arXiv:1412.5706",,10.1134/S0965542518030120,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An unsteady problem is considered for a space-fractional equation in a
bounded domain. A first-order evolutionary equation involves a fractional power
of an elliptic operator of second order. Finite element approximation in space
is employed. To construct approximation in time, standard two-level schemes are
used. The approximate solution at a new time-level is obtained as a solution of
a discrete problem with the fractional power of the elliptic operator. A
Pade-type approximation is constructed on the basis of special quadrature
formulas for an integral representation of the fractional power elliptic
operator using explicit schemes. A similar approach is applied in the numerical
implementation of implicit schemes. The results of numerical experiments are
presented for a test two-dimensional problem.
","[{'version': 'v1', 'created': 'Wed, 12 Apr 2017 17:35:34 GMT'}]",2018-05-09,"[['Vabishchevich', 'Petr N.', '']]","['elliptic operator', 'fractional power of an operator', 'finite elementapproximation', 'two-level schemes', 'stability of difference schemes']"
8012,2112.06586,Pieter Blok,"Pieter M. Blok, Gert Kootstra, Hakim Elchaoui Elghor, Boubacar Diallo,
  Frits K. van Evert, Eldert J. van Henten","Active learning with MaskAL reduces annotation effort for training Mask
  R-CNN","30 pages, 10 figures, 3 tables","Computers and Electronics in Agriculture, 197 (2022)",10.1016/j.compag.2022.106917,,cs.CV,http://creativecommons.org/licenses/by-sa/4.0/,"  The generalisation performance of a convolutional neural network (CNN) is
influenced by the quantity, quality, and variety of the training images.
Training images must be annotated, and this is time consuming and expensive.
The goal of our work was to reduce the number of annotated images needed to
train a CNN while maintaining its performance. We hypothesised that the
performance of a CNN can be improved faster by ensuring that the set of
training images contains a large fraction of hard-to-classify images. The
objective of our study was to test this hypothesis with an active learning
method that can automatically select the hard-to-classify images. We developed
an active learning method for Mask Region-based CNN (Mask R-CNN) and named this
method MaskAL. MaskAL involved the iterative training of Mask R-CNN, after
which the trained model was used to select a set of unlabelled images about
which the model was most uncertain. The selected images were then annotated and
used to retrain Mask R-CNN, and this was repeated for a number of sampling
iterations. In our study, MaskAL was compared to a random sampling method on a
broccoli dataset with five visually similar classes. MaskAL performed
significantly better than the random sampling. In addition, MaskAL had the same
performance after sampling 900 images as the random sampling had after 2300
images. Compared to a Mask R-CNN model that was trained on the entire training
set (14,000 images), MaskAL achieved 93.9% of that model's performance with
17.9% of its training data. The random sampling achieved 81.9% of that model's
performance with 16.4% of its training data. We conclude that by using MaskAL,
the annotation effort can be reduced for training Mask R-CNN on a broccoli
dataset with visually similar classes. Our software is available on
https://github.com/pieterblok/maskal.
","[{'version': 'v1', 'created': 'Mon, 13 Dec 2021 12:08:27 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Jan 2022 09:00:05 GMT'}, {'version': 'v3', 'created': 'Sat, 26 Mar 2022 10:26:02 GMT'}]",2022-07-18,"[['Blok', 'Pieter M.', ''], ['Kootstra', 'Gert', ''], ['Elghor', 'Hakim Elchaoui', ''], ['Diallo', 'Boubacar', ''], ['van Evert', 'Frits K.', ''], ['van Henten', 'Eldert J.', '']]","['active learning', 'deep learning', 'instance segmentation', 'Mask R-CNN', 'agriculture']"
8013,2112.11978,Joseph Schuchart,"Joseph Schuchart, Philipp Samfass, Christoph Niethammer, Jos\'e Gracia
  and George Bosilca",Callback-based Completion Notification using MPI Continuations,arXiv admin note: substantial text overlap with arXiv:2011.06684,Parallel Computing 106 (2021),10.1016/j.parco.2021.102793,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Asynchronous programming models (APM) are gaining more and more traction,
allowing applications to expose the available concurrency to a runtime system
tasked with coordinating the execution. While MPI has long provided support for
multi-threaded communication and non-blocking operations, it falls short of
adequately supporting APMs as correctly and efficiently handling MPI
communication in different models is still a challenge. We have previously
proposed an extension to the MPI standard providing operation completion
notifications using callbacks, so-called MPI Continuations. This interface is
flexible enough to accommodate a wide range of different APMs.
  In this paper, we present an extension to the previously described interface
that allows for finer control of the behavior of the MPI Continuations
interface. We then present some of our first experiences in using the interface
in the context of different applications, including the NAS parallel
benchmarks, the PaRSEC task-based runtime system, and a load-balancing scheme
within an adaptive mesh refinement solver called ExaHyPE. We show that the
interface, implemented inside Open MPI, enables low-latency, high-throughput
completion notifications that outperform solutions implemented in the
application space.
","[{'version': 'v1', 'created': 'Wed, 22 Dec 2021 15:51:22 GMT'}]",2021-12-23,"[['Schuchart', 'Joseph', ''], ['Samfass', 'Philipp', ''], ['Niethammer', 'Christoph', ''], ['Gracia', 'José', ''], ['Bosilca', 'George', '']]","['MPI', 'MPI Continuations', 'Task-based Programming Models', 'OpenMP', 'OmpSs', 'TAMPI', 'PaRSEC']"
8014,1709.09641,Heran Yang,"Heran Yang, Jian Sun, Huibin Li, Lisheng Wang, Zongben Xu",Neural Multi-Atlas Label Fusion: Application to Cardiac MR Images,Medical Image Analysis,"Heran Yang, et al. Neural Multi-Atlas Label Fusion: Application to
  Cardiac MR Images, Medical Image Analysis, 2018, ISSN 1361-8415",10.1016/j.media.2018.07.009,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-atlas segmentation approach is one of the most widely-used image
segmentation techniques in biomedical applications. There are two major
challenges in this category of methods, i.e., atlas selection and label fusion.
In this paper, we propose a novel multi-atlas segmentation method that
formulates multi-atlas segmentation in a deep learning framework for better
solving these challenges. The proposed method, dubbed deep fusion net (DFN), is
a deep architecture that integrates a feature extraction subnet and a non-local
patch-based label fusion (NL-PLF) subnet in a single network. The network
parameters are learned by end-to-end training for automatically learning deep
features that enable optimal performance in a NL-PLF framework. The learned
deep features are further utilized in defining a similarity measure for atlas
selection. By evaluating on two public cardiac MR datasets of SATA-13 and LV-09
for left ventricle segmentation, our approach achieved 0.833 in averaged Dice
metric (ADM) on SATA-13 dataset and 0.95 in ADM for epicardium segmentation on
LV-09 dataset, comparing favorably with the other automatic left ventricle
segmentation methods. We also tested our approach on Cardiac Atlas Project
(CAP) testing set of MICCAI 2013 SATA Segmentation Challenge, and our method
achieved 0.815 in ADM, ranking highest at the time of writing.
","[{'version': 'v1', 'created': 'Wed, 27 Sep 2017 17:25:17 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Aug 2018 18:34:11 GMT'}]",2018-08-03,"[['Yang', 'Heran', ''], ['Sun', 'Jian', ''], ['Li', 'Huibin', ''], ['Wang', 'Lisheng', ''], ['Xu', 'Zongben', '']]","['Multi-atlas label fusion', 'left ventricle segmentation', 'deep fusionnet', 'atlas selection']"
8015,2208.02400,Rohitash Chandra,"Giang Ngo, Rodney Beard, Rohitash Chandra",Evolutionary bagging for ensemble learning,,"Neurocomputing, Volume 510, 21 October 2022, Pages 1-14",10.1016/j.neucom.2022.08.055,,cs.NE cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Ensemble learning has gained success in machine learning with major
advantages over other learning methods. Bagging is a prominent ensemble
learning method that creates subgroups of data, known as bags, that are trained
by individual machine learning methods such as decision trees. Random forest is
a prominent example of bagging with additional features in the learning
process. Evolutionary algorithms have been prominent for optimisation problems
and also been used for machine learning. Evolutionary algorithms are
gradient-free methods that work with a population of candidate solutions that
maintain diversity for creating new solutions. In conventional bagged ensemble
learning, the bags are created once and the content, in terms of the training
examples, are fixed over the learning process. In our paper, we propose
evolutionary bagged ensemble learning, where we utilise evolutionary algorithms
to evolve the content of the bags in order to iteratively enhance the ensemble
by providing diversity in the bags. The results show that our evolutionary
ensemble bagging method outperforms conventional ensemble methods (bagging and
random forests) for several benchmark datasets under certain constraints. We
find that evolutionary bagging can inherently sustain a diverse set of bags
without reduction in performance accuracy.
","[{'version': 'v1', 'created': 'Thu, 4 Aug 2022 01:52:57 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Aug 2022 09:22:41 GMT'}, {'version': 'v3', 'created': 'Tue, 6 Sep 2022 01:31:38 GMT'}]",2022-09-07,"[['Ngo', 'Giang', ''], ['Beard', 'Rodney', ''], ['Chandra', 'Rohitash', '']]","['Ensemble learning', 'Bagging', 'Random forest', 'Evolutionary algorithms']"
8016,2102.02330,Anshul Jindal,"Anshul Jindal, Michael Gerndt, Mohak Chadha, Vladimir Podolskiy and
  Pengfei Chen","Function Delivery Network: Extending Serverless Computing for
  Heterogeneous Platforms",Accepted at Journal of Software: Practice and Experience,,10.1002/spe.2966,,cs.DC cs.PF,http://creativecommons.org/licenses/by/4.0/,"  Serverless computing has rapidly grown following the launch of Amazon's
Lambda platform. Function-as-a-Service (FaaS) a key enabler of serverless
computing allows an application to be decomposed into simple, standalone
functions that are executed on a FaaS platform. The FaaS platform is
responsible for deploying and facilitating resources to the functions. Several
of today's cloud applications spread over heterogeneous connected computing
resources and are highly dynamic in their structure and resource requirements.
However, FaaS platforms are limited to homogeneous clusters and homogeneous
functions and do not account for the data access behavior of functions before
scheduling.
  We introduce an extension of FaaS to heterogeneous clusters and to support
heterogeneous functions through a network of distributed heterogeneous target
platforms called Function Delivery Network (FDN). A target platform is a
combination of a cluster of homogeneous nodes and a FaaS platform on top of it.
FDN provides Function-Delivery-as-a-Service (FDaaS), delivering the function to
the right target platform. We showcase the opportunities such as varied target
platform's characteristics, possibility of collaborative execution between
multiple target platforms, and localization of data that the FDN offers in
fulfilling two objectives: Service Level Objective (SLO) requirements and
energy efficiency when scheduling functions by evaluating over five distributed
target platforms using the FDNInspector, a tool developed by us for
benchmarking distributed target platforms. Scheduling functions on an edge
target platform in our evaluation reduced the overall energy consumption by 17x
without violating the SLO requirements in comparison to scheduling on a
high-end target platform.
","[{'version': 'v1', 'created': 'Wed, 3 Feb 2021 23:24:48 GMT'}]",2021-03-11,"[['Jindal', 'Anshul', ''], ['Gerndt', 'Michael', ''], ['Chadha', 'Mohak', ''], ['Podolskiy', 'Vladimir', ''], ['Chen', 'Pengfei', '']]","['cloud computing', 'edge computing', 'high performance computing', 'serverless computing', 'function delivery']"
8017,1702.03504,Vivek Nigam,"Max Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov and
  Carolyn Talcott","Time, Computational Complexity, and Probability in the Analysis of
  Distance-Bounding Protocols",Extending our POST 2015 paper,,10.3233/JCS-0560,,cs.LO cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many security protocols rely on the assumptions on the physical properties in
which its protocol sessions will be carried out. For instance, Distance
Bounding Protocols take into account the round trip time of messages and the
transmission velocity to infer an upper bound of the distance between two
agents. We classify such security protocols as Cyber-Physical. Time plays a key
role in design and analysis of many of these protocols. This paper investigates
the foundational differences and the impacts on the analysis when using models
with discrete time and models with dense time. We show that there are attacks
that can be found by models using dense time, but not when using discrete time.
We illustrate this with a novel attack that can be carried out on most Distance
Bounding Protocols. In this attack, one exploits the execution delay of
instructions during one clock cycle to convince a verifier that he is in a
location different from his actual position. We additionally present a
probabilistic analysis of this novel attack. As a formal model for representing
and analyzing Cyber-Physical properties, we propose a Multiset Rewriting model
with dense time suitable for specifying cyber-physical security protocols. We
introduce Circle-Configurations and show that they can be used to symbolically
solve the reachability problem for our model, and show that for the important
class of balanced theories the reachability problem is PSPACE-complete. We also
show how our model can be implemented using the computational rewriting tool
Maude, the machinery that automatically searches for such attacks.
","[{'version': 'v1', 'created': 'Sun, 12 Feb 2017 08:22:54 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Oct 2017 07:10:19 GMT'}]",2017-10-05,"[['Kanovich', 'Max', ''], ['Kirigin', 'Tajana Ban', ''], ['Nigam', 'Vivek', ''], ['Scedrov', 'Andre', ''], ['Talcott', 'Carolyn', '']]","['Multiset Rewrite Systems', 'Cyber-Physical Security Protocols', 'Protocol Security', 'Computational Complexity', 'Maude']"
8018,2110.07181,Qilong Yan,"Qilong Yan, Yufeng Zhang, Qiang Liu, Shu Wu, Liang Wang",Relation-aware Heterogeneous Graph for User Profiling,CIKM2021 Accepted,,10.1145/3459637.3482170,,cs.IR cs.AI,http://creativecommons.org/licenses/by/4.0/,"  User profiling has long been an important problem that investigates user
interests in many real applications. Some recent works regard users and their
interacted objects as entities of a graph and turn the problem into a node
classification task. However, they neglect the difference of distinct
interaction types, e.g. user clicks an item v.s.user purchases an item, and
thus cannot incorporate such information well. To solve these issues, we
propose to leverage the relation-aware heterogeneous graph method for user
profiling, which also allows capturing significant meta relations. We adopt the
query, key, and value mechanism in a transformer fashion for heterogeneous
message passing so that entities can effectively interact with each other. Via
such interactions on different relation types, our model can generate
representations with rich information for the user profile prediction. We
conduct experiments on two real-world e-commerce datasets and observe a
significant performance boost of our approach.
","[{'version': 'v1', 'created': 'Thu, 14 Oct 2021 06:59:30 GMT'}]",2021-10-15,"[['Yan', 'Qilong', ''], ['Zhang', 'Yufeng', ''], ['Liu', 'Qiang', ''], ['Wu', 'Shu', ''], ['Wang', 'Liang', '']]","['User Modeling', 'Deep Learning', 'Graph Neural Networks', 'Heterogeneous Information Networks', 'Representation Learning']"
8019,2008.04079,Artem Lunev,"Artem Lunev, Vadim Zborovskii and Teymur Aliev","Complexity matters: highly-accurate numerical models of coupled
  radiative-conductive heat transfer in a laser flash experiment","39 pages, 13 figures, 6 tables",,10.1016/j.ijthermalsci.2020.106695,,cs.CE cond-mat.mtrl-sci physics.app-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Thermal diffusivity measurements of samples transmitting thermal radiation
require adjustments to the data treatment procedures in laser flash analysis.
Conventionally, an unconstrained diathermic model is used. Current results show
that the alternative coupled radiative-conductive models produce substantially
different results -- for instance, at high temperatures in oxide ceramics.
However, care must be taken to ensure accurate implementations of each
constituent computational technique. The latter are presented in this work.
","[{'version': 'v1', 'created': 'Fri, 3 Jul 2020 18:22:23 GMT'}]",2020-11-06,"[['Lunev', 'Artem', ''], ['Zborovskii', 'Vadim', ''], ['Aliev', 'Teymur', '']]","['radiative transfer', 'heat conduction', 'discrete ordinates method', 'thermaldiffusivity']"
8020,1711.09476,Diego Moussallem,Diego Moussallem and Matthias Wauer and Axel-Cyrille Ngonga Ngomo,Machine Translation using Semantic Web Technologies: A Survey,"23 pages, 2 figures, 4 tables",,10.1016/j.websem.2018.07.001,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A large number of machine translation approaches have recently been developed
to facilitate the fluid migration of content across languages. However, the
literature suggests that many obstacles must still be dealt with to achieve
better automatic translations. One of these obstacles is lexical and syntactic
ambiguity. A promising way of overcoming this problem is using Semantic Web
technologies. This article presents the results of a systematic review of
machine translation approaches that rely on Semantic Web technologies for
translating texts. Overall, our survey suggests that while Semantic Web
technologies can enhance the quality of machine translation outputs for various
problems, the combination of both is still in its infancy.
","[{'version': 'v1', 'created': 'Sun, 26 Nov 2017 22:30:31 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Feb 2018 15:33:21 GMT'}, {'version': 'v3', 'created': 'Tue, 17 Jul 2018 10:57:26 GMT'}]",2018-07-18,"[['Moussallem', 'Diego', ''], ['Wauer', 'Matthias', ''], ['Ngomo', 'Axel-Cyrille Ngonga', '']]","['machine translation', 'semantic web', 'ontology', 'linked data', 'multilinguality', 'knowledge graphs']"
8021,2003.10593,Vincent Christlein,"Martin Mayr, Martin Stumpf, Anguelos Nicolaou, Mathias Seuret, Andreas
  Maier, Vincent Christlein",Spatio-Temporal Handwriting Imitation,"Main paper: 16 pages, supplemental material: 7 pages",,10.1007/978-3-030-68238-5_38,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most people think that their handwriting is unique and cannot be imitated by
machines, especially not using completely new content. Current cursive
handwriting synthesis is visually limited or needs user interaction. We show
that subdividing the process into smaller subtasks makes it possible to imitate
someone's handwriting with a high chance to be visually indistinguishable for
humans. Therefore, a given handwritten sample will be used as the target style.
This sample is transferred to an online sequence. Then, a method for online
handwriting synthesis is used to produce a new realistic-looking text primed
with the online input sequence. This new text is then rendered and
style-adapted to the input pen. We show the effectiveness of the pipeline by
generating in- and out-of-vocabulary handwritten samples that are validated in
a comprehensive user study. Additionally, we show that also a typical writer
identification system can partially be fooled by the created fake handwritings.
","[{'version': 'v1', 'created': 'Tue, 24 Mar 2020 00:46:40 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Apr 2021 17:09:48 GMT'}]",2021-04-19,"[['Mayr', 'Martin', ''], ['Stumpf', 'Martin', ''], ['Nicolaou', 'Anguelos', ''], ['Seuret', 'Mathias', ''], ['Maier', 'Andreas', ''], ['Christlein', 'Vincent', '']]","['Offline Handwriting Generation', 'Style Transfer', 'Forgery', 'Handwriting Synthesis']"
8022,1708.05208,Chi-Kin Chau,"Muhammad Aftab, Chien Chen, Chi-Kin Chau, Talal Rahwan","Automatic HVAC Control with Real-time Occupancy Recognition and
  Simulation-guided Model Predictive Control in Low-cost Embedded System",To appear in Energy and Buildings,"Volume 154, 1 November 2017, Pages 141-156, Energy and Buildings",10.1016/j.enbuild.2017.07.077,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intelligent building automation systems can reduce the energy consumption of
heating, ventilation and air-conditioning (HVAC) units by sensing the comfort
requirements automatically and scheduling the HVAC operations dynamically.
Traditional building automation systems rely on fairly inaccurate occupancy
sensors and basic predictive control using oversimplified building thermal
response models, all of which prevent such systems from reaching their full
potential. Such limitations can now be avoided due to the recent developments
in embedded system technologies, which provide viable low-cost computing
platforms with powerful processors and sizeable memory storage in a small
footprint. As a result, building automation systems can now efficiently execute
highly-sophisticated computational tasks, such as real-time video processing
and accurate thermal-response simulations. With this in mind, we designed and
implemented an occupancy-predictive HVAC control system in a low-cost yet
powerful embedded system (using Raspberry Pi 3) to demonstrate the following
key features for building automation: (1) real-time occupancy recognition using
video-processing and machine-learning techniques, (2) dynamic analysis and
prediction of occupancy patterns, and (3) model predictive control for HVAC
operations guided by real-time building thermal response simulations (using an
on-board EnergyPlus simulator). We deployed and evaluated our system for
providing automatic HVAC control in the large public indoor space of a mosque,
thereby achieving significant energy savings.
","[{'version': 'v1', 'created': 'Thu, 17 Aug 2017 11:31:22 GMT'}]",2017-09-25,"[['Aftab', 'Muhammad', ''], ['Chen', 'Chien', ''], ['Chau', 'Chi-Kin', ''], ['Rahwan', 'Talal', '']]","['Automatic HVAC control', 'embedded system', 'occupancy recognition', 'model predictive control']"
8023,2109.12459,Sohaib Kiani,"Sohaib Kiani, Sana Awan, Chao Lan, Fengjun Li, Bo Luo","Two Souls in an Adversarial Image: Towards Universal Adversarial Example
  Detection using Multi-view Inconsistency",,"Annual Computer Security Applications Conference (ACSAC '21),
  December 6--10, 2021, Virtual Event, USA",10.1145/3485832.3485904,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the evasion attacks against deep neural networks (DNN), the attacker
generates adversarial instances that are visually indistinguishable from benign
samples and sends them to the target DNN to trigger misclassifications. In this
paper, we propose a novel multi-view adversarial image detector, namely Argos,
based on a novel observation. That is, there exist two ""souls"" in an
adversarial instance, i.e., the visually unchanged content, which corresponds
to the true label, and the added invisible perturbation, which corresponds to
the misclassified label. Such inconsistencies could be further amplified
through an autoregressive generative approach that generates images with seed
pixels selected from the original image, a selected label, and pixel
distributions learned from the training data. The generated images (i.e., the
""views"") will deviate significantly from the original one if the label is
adversarial, demonstrating inconsistencies that Argos expects to detect. To
this end, Argos first amplifies the discrepancies between the visual content of
an image and its misclassified label induced by the attack using a set of
regeneration mechanisms and then identifies an image as adversarial if the
reproduced views deviate to a preset degree. Our experimental results show that
Argos significantly outperforms two representative adversarial detectors in
both detection accuracy and robustness against six well-known adversarial
attacks. Code is available at:
https://github.com/sohaib730/Argos-Adversarial_Detection
","[{'version': 'v1', 'created': 'Sat, 25 Sep 2021 23:47:13 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Oct 2021 15:59:10 GMT'}]",2021-10-12,"[['Kiani', 'Sohaib', ''], ['Awan', 'Sana', ''], ['Lan', 'Chao', ''], ['Li', 'Fengjun', ''], ['Luo', 'Bo', '']]","['Deep Learning', 'Adversarial Attacks', 'Adversarial Detection', 'DeepGenerative Modeling', 'Multi-view Machine Learning']"
8024,2210.02553,Ryusuke Sugimoto,"Ryusuke Sugimoto, Mingming He, Jing Liao, Pedro V. Sander",Water Simulation and Rendering from a Still Photograph,"Accepted for publication at ACM SIGGRAPH Asia (Conference Papers).
  Videos, demos and updates will be on the project website:
  https://rsugimoto.net/WaterAnimationProject/",,10.1145/3550469.3555415,,cs.GR cs.CV,http://creativecommons.org/licenses/by-sa/4.0/,"  We propose an approach to simulate and render realistic water animation from
a single still input photograph. We first segment the water surface, estimate
rendering parameters, and compute water reflection textures with a combination
of neural networks and traditional optimization techniques. Then we propose an
image-based screen space local reflection model to render the water surface
overlaid on the input image and generate real-time water animation. Our
approach creates realistic results with no user intervention for a wide variety
of natural scenes containing large bodies of water with different lighting and
water surface conditions. Since our method provides a 3D representation of the
water surface, it naturally enables direct editing of water parameters and also
supports interactive applications like adding synthetic objects to the scene.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2022 20:47:44 GMT'}]",2022-10-07,"[['Sugimoto', 'Ryusuke', ''], ['He', 'Mingming', ''], ['Liao', 'Jing', ''], ['Sander', 'Pedro V.', '']]","['single-image animation generation', 'texture prediction', 'neural networks', 'optimization', 'screen-space reflection']"
8025,2011.01224,Yue Zhang,"Yue Zhang, Yajie Zou, Jinjun Tang, Jian Liang",A Lane-Changing Prediction Method Based on Temporal Convolution Network,,,10.1080/21680566.2021.1950072,,cs.LG cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lane-changing is an important driving behavior and unreasonable lane changes
can result in potentially dangerous traffic collisions. Advanced Driver
Assistance System (ADAS) can assist drivers to change lanes safely and
efficiently. To capture the stochastic time series of lane-changing behavior,
this study proposes a temporal convolutional network (TCN) to predict the
long-term lane-changing trajectory and behavior. In addition, the convolutional
neural network (CNN) and recurrent neural network (RNN) methods are considered
as the benchmark models to demonstrate the learning ability of the TCN. The
lane-changing dataset was collected by the driving simulator. The prediction
performance of TCN is demonstrated from three aspects: different input
variables, different input dimensions and different driving scenarios.
Prediction results show that the TCN can accurately predict the long-term
lane-changing trajectory and driving behavior with shorter computational time
compared with two benchmark models. The TCN can provide accurate lane-changing
prediction, which is one key information for the development of accurate ADAS.
","[{'version': 'v1', 'created': 'Sun, 1 Nov 2020 07:33:10 GMT'}]",2021-08-03,"[['Zhang', 'Yue', ''], ['Zou', 'Yajie', ''], ['Tang', 'Jinjun', ''], ['Liang', 'Jian', '']]","['Lane changes', 'temporal convolution network', 'driving behavior', 'trajectory prediction', 'time series']"
8026,2007.04696,Anastasija Nikiforova,"Anastasija Nikiforova, Zane Bicevska","Application of LEAN Principles to Improve Business Processes: a Case
  Study in Latvian IT Company","24 pages, 7 figure, 4 tables, Baltic J. Modern Computing","Baltic J. Modern Computing, Vol. 6 (2018), No. 3, 247-270",10.22364/bjmc.2018.6.3.03,,cs.SE cs.CY cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The research deals with application of the LEAN principles to business
processes of a typical IT company. The paper discusses LEAN principles
amplifying advantages and shortcomings of their application. The authors
suggest use of the LEAN principles as a tool to identify improvement potential
for IT company's business processes and work-flow efficiency. During a case
study the implementation of LEAN principles has been exemplified in business
processes of a particular Latvian IT company. The obtained results and
conclusions can be used for meaningful and successful application of LEAN
principles and methods in projects of other IT companies.
","[{'version': 'v1', 'created': 'Thu, 9 Jul 2020 10:42:58 GMT'}]",2020-09-09,"[['Nikiforova', 'Anastasija', ''], ['Bicevska', 'Zane', '']]","['LEAN methods', 'LEAN principles', 'business processes']"
8027,2202.09230,Andrey Mokhov,"Andrey Mokhov (Jane Street, UK / Newcastle University, UK)","United Monoids: Finding Simplicial Sets and Labelled Algebraic Graphs in
  Trees",,"The Art, Science, and Engineering of Programming, 2022, Vol. 6,
  Issue 3, Article 12",10.22152/programming-journal.org/2022/6/12,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graphs and various graph-like combinatorial structures, such as preorders and
hypergraphs, are ubiquitous in programming. This paper focuses on representing
graphs in a purely functional programming language like Haskell. There are
several existing approaches; one of the most recently developed ones is the
""algebraic graphs"" approach (2017). It uses an algebraic data type to represent
graphs and has attracted users, including from industry, due to its emphasis on
equational reasoning and making a common class of bugs impossible by
eliminating internal invariants.
  The previous formulation of algebraic graphs did not support edge labels,
which was a serious practical limitation. In this paper, we redesign the main
algebraic data type and remove this limitation. We follow a fairly standard
approach of parameterising a data structure with a semiring of edge labels. The
new formulation is both more general and simpler: the two operations for
composing graphs used in the previous work can now be obtained from a single
operation by fixing the semiring parameter to zero and one, respectively.
  By instantiating the new data type with different semirings, and working out
laws for interpreting the resulting expression trees, we discover an unusual
algebraic structure, which we call ""united monoids"", that is, a pair of monoids
whose unit elements coincide. We believe that it is worth studying united
monoids in their full generality, going beyond the graphs which prompted their
discovery. To that end, we characterise united monoids with a minimal set of
axioms, prove a few basic theorems, and discuss several notable examples.
  We validate the presented approach by implementing it in the open-source
*algebraic-graphs* library. Our theoretical contributions are supported by
proofs that are included in the paper and have also been machine-checked in
Agda. By extending algebraic graphs with support for edge labels, we make them
suitable for a much larger class of possible applications. By studying united
monoids, we provide a theoretical foundation for further research in this area.
","[{'version': 'v1', 'created': 'Fri, 18 Feb 2022 14:54:57 GMT'}]",2022-02-21,"[['Mokhov', 'Andrey', '', 'Jane Street, UK / Newcastle University, UK']]","['algebra', 'graphs', 'functional programming']"
8028,2003.08683,Saeid Alirezazadeh,Saeid Alirezazadeh and Lu\'is A. Alexandre,Optimal Algorithm Allocation for Single Robot Cloud Systems,"\c{opyright} 2021 IEEE. Personal use of this material is permitted.
  Permission from IEEE must be obtained for all other uses, in any current or
  future media, including reprinting/republishing this material for advertising
  or promotional purposes, creating new collective works, for resale or
  redistribution to servers or lists, or reuse of any copyrighted component of
  this work in other works",2021 IEEE Transactions on Cloud Computing,10.1109/TCC.2021.3093489,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order for a robot to perform a task, several algorithms need to be
executed, sometimes, simultaneously. Algorithms can be run either on the robot
itself or, upon request, be performed on cloud infrastructure. The term cloud
infrastructure is used to describe hardware, storage, abstracted resources, and
network resources related to cloud computing. Depending on the decisions on
where to execute the algorithms, the overall execution time and necessary
memory space for the robot will change accordingly. The price of a robot
depends, among other things, on its memory capacity and computational power. We
answer the question of how to keep a given performance and use a cheaper robot
(lower resources) by assigning computational tasks to the cloud infrastructure,
depending on memory, computational power, and communication constraints. Also,
for a fixed robot, our model provides a way to have optimal overall
performance. We provide a general model for the optimal decision of algorithm
allocation under certain constraints. We exemplify the model with simulation
results. The main advantage of our model is that it provides an optimal task
allocation simultaneously for memory and time.
","[{'version': 'v1', 'created': 'Thu, 19 Mar 2020 11:02:54 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Jun 2020 12:29:14 GMT'}, {'version': 'v3', 'created': 'Mon, 10 May 2021 15:43:02 GMT'}, {'version': 'v4', 'created': 'Sun, 27 Jun 2021 19:11:31 GMT'}, {'version': 'v5', 'created': 'Tue, 8 Feb 2022 11:40:42 GMT'}]",2022-02-09,"[['Alirezazadeh', 'Saeid', ''], ['Alexandre', 'Luís A.', '']]","['Cloud robotics', 'cloud computing', 'fog computing', 'edge computing', 'memory and time costs', 'optimization strategy', 'allocation algorithm']"
8029,2002.08088,Marco D'Amico,Marco D'Amico and Ana Jokanovic and Julita Corbalan,"Holistic Slowdown Driven Scheduling and Resource Management for
  Malleable Jobs",,"In Proceedings of the 48th International Conference on Parallel
  Processing (ICPP 2019). Association for Computing Machinery, New York, NY,
  USA, Article 31",10.1145/3337821.3337909,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In job scheduling, the concept of malleability has been explored since many
years ago. Research shows that malleability improves system performance, but
its utilization in HPC never became widespread. The causes are the difficulty
in developing malleable applications, and the lack of support and integration
of the different layers of the HPC software stack. However, in the last years,
malleability in job scheduling is becoming more critical because of the
increasing complexity of hardware and workloads. In this context, using nodes
in an exclusive mode is not always the most efficient solution as in
traditional HPC jobs, where applications were highly tuned for static
allocations, but offering zero flexibility to dynamic executions. This paper
proposes a new holistic, dynamic job scheduling policy, Slowdown Driven
(SD-Policy), which exploits the malleability of applications as the key
technology to reduce the average slowdown and response time of jobs. SD-Policy
is based on backfill and node sharing. It applies malleability to running jobs
to make room for jobs that will run with a reduced set of resources, only when
the estimated slowdown improves over the static approach. We implemented
SD-Policy in SLURM and evaluated it in a real production environment, and with
a simulator using workloads of up to 198K jobs. Results show better resource
utilization with the reduction of makespan, response time, slowdown, and energy
consumption, up to respectively 7%, 50%, 70%, and 6%, for the evaluated
workloads.
","[{'version': 'v1', 'created': 'Wed, 19 Feb 2020 09:53:14 GMT'}]",2020-02-20,"[[""D'Amico"", 'Marco', ''], ['Jokanovic', 'Ana', ''], ['Corbalan', 'Julita', '']]","['job scheduling', 'co-scheduling', 'malleability', 'resource management', 'high performance computing']"
8030,2103.01597,"Johannes Pekkil\""a","Johannes Pekkil\""a, Miikka S. V\""ais\""al\""a, Maarit J. K\""apyl\""a,
  Matthias Rheinhardt, Oskar Lappi","Scalable communication for high-order stencil computations using
  CUDA-aware MPI","15 pages, 15 figures. Updated with the accepted manuscript. More
  extensive tests added and wording clarified in several places. Please refer
  to the published article for the most polished version","Parallel Computing, Volume 111, 2022, 102904",10.1016/j.parco.2022.102904,,cs.DC physics.comp-ph physics.flu-dyn,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Modern compute nodes in high-performance computing provide a tremendous level
of parallelism and processing power. However, as arithmetic performance has
been observed to increase at a faster rate relative to memory and network
bandwidths, optimizing data movement has become critical for achieving strong
scaling in many communication-heavy applications. This performance gap has been
further accentuated with the introduction of graphics processing units, which
can provide by multiple factors higher throughput in data-parallel tasks than
central processing units. In this work, we explore the computational aspects of
iterative stencil loops and implement a generic communication scheme using
CUDA-aware MPI, which we use to accelerate magnetohydrodynamics simulations
based on high-order finite differences and third-order Runge-Kutta integration.
We put particular focus on improving intra-node locality of workloads. Our GPU
implementation scales strongly from one to $64$ devices at $50\%$--$87\%$ of
the expected efficiency based on a theoretical performance model. Compared with
a multi-core CPU solver, our implementation exhibits $20$--$60\times$ speedup
and $9$--$12\times$ improved energy efficiency in compute-bound benchmarks on
$16$ nodes.
","[{'version': 'v1', 'created': 'Tue, 2 Mar 2021 09:44:42 GMT'}, {'version': 'v2', 'created': 'Tue, 10 May 2022 11:21:57 GMT'}]",2022-05-11,"[['Pekkilä', 'Johannes', ''], ['Väisälä', 'Miikka S.', ''], ['Käpylä', 'Maarit J.', ''], ['Rheinhardt', 'Matthias', ''], ['Lappi', 'Oskar', '']]","['High-performance computing', 'Graphics processing units', 'Stencil computations', 'Computational physics', 'Magnetohydrodynamics']"
8031,1508.06918,Alessia Amelio Dr.,Darko Brodic and Alessia Amelio,"Classification of the Extremely Low Frequency Magnetic Field Radiation
  Measurement from the Laptop Computers","14 pages, 9 figures","Measurement Science Review, Volume 15, No. 4, 2015",10.1515/msr-2015-0028,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper considers the level of the extremely low-frequency magnetic field,
which is produced by laptop computers. The magnetic field, which is
characterized by extremely low frequencies up to 300 Hz is measured due to its
hazardous effects to the laptop user's health. The experiment consists of
testing 13 different laptop computers in normal operation conditions. The
measuring of the magnetic field is performed in the adjacent neighborhood of
the laptop computers. The measured data are presented and then classified. The
classification is performed by the K-Medians method in order to determine the
critical positions of the laptop. At the end, the measured magnetic field
values are compared with the critical values suggested by different safety
standards. It is shown that some of the laptop computers emit a very strong
magnetic field. Hence, they must be used with extreme caution.
","[{'version': 'v1', 'created': 'Wed, 26 Aug 2015 14:43:18 GMT'}]",2015-08-28,"[['Brodic', 'Darko', ''], ['Amelio', 'Alessia', '']]","['classification', 'exposure', 'laptop', 'magnetic field', 'non-ionizing radiation', 'clustering']"
8032,2106.12336,Arthur Drichel,"Arthur Drichel, Nils Faerber, Ulrike Meyer",First Step Towards EXPLAINable DGA Multiclass Classification,"Accepted at The 16th International Conference on Availability,
  Reliability and Security (ARES 2021)",,10.1145/3465481.3465749,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Numerous malware families rely on domain generation algorithms (DGAs) to
establish a connection to their command and control (C2) server. Counteracting
DGAs, several machine learning classifiers have been proposed enabling the
identification of the DGA that generated a specific domain name and thus
triggering targeted remediation measures. However, the proposed
state-of-the-art classifiers are based on deep learning models. The black box
nature of these makes it difficult to evaluate their reasoning. The resulting
lack of confidence makes the utilization of such models impracticable. In this
paper, we propose EXPLAIN, a feature-based and contextless DGA multiclass
classifier. We comparatively evaluate several combinations of feature sets and
hyperparameters for our approach against several state-of-the-art classifiers
in a unified setting on the same real-world data. Our classifier achieves
competitive results, is real-time capable, and its predictions are easier to
trace back to features than the predictions made by the DGA multiclass
classifiers proposed in related work.
","[{'version': 'v1', 'created': 'Wed, 23 Jun 2021 12:05:13 GMT'}]",2021-06-24,"[['Drichel', 'Arthur', ''], ['Faerber', 'Nils', ''], ['Meyer', 'Ulrike', '']]","['Intrusion detection', 'domain generation algorithm (DGA) detection', 'XAI (eXplainable Artificial Intelligence)', 'machine learning']"
8033,2009.01417,Zhe Liu,"Zhe Liu, Chunyang Chen, Junjie Wang, Yuekai Huang, Jun Hu and Qing
  Wang",Owl Eyes: Spotting UI Display Issues via Visual Understanding,"Accepted to 35th IEEE/ACM International Conference on Automated
  Software Engineering (ASE 20)",,10.1145/3324884.3416547,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graphical User Interface (GUI) provides a visual bridge between a software
application and end users, through which they can interact with each other.
With the development of technology and aesthetics, the visual effects of the
GUI are more and more attracting. However, such GUI complexity posts a great
challenge to the GUI implementation. According to our pilot study of
crowdtesting bug reports, display issues such as text overlap, blurred screen,
missing image always occur during GUI rendering on different devices due to the
software or hardware compatibility. They negatively influence the app
usability, resulting in poor user experience. To detect these issues, we
propose a novel approach, OwlEye, based on deep learning for modelling visual
information of the GUI screenshot. Therefore, OwlEye can detect GUIs with
display issues and also locate the detailed region of the issue in the given
GUI for guiding developers to fix the bug. We manually construct a large-scale
labelled dataset with 4,470 GUI screenshots with UI display issues and develop
a heuristics-based data augmentation method for boosting the performance of our
OwlEye. The evaluation demonstrates that our OwlEye can achieve 85% precision
and 84% recall in detecting UI display issues, and 90% accuracy in localizing
these issues. We also evaluate OwlEye with popular Android apps on Google Play
and F-droid, and successfully uncover 57 previously-undetected UI display
issues with 26 of them being confirmed or fixed so far.
","[{'version': 'v1', 'created': 'Thu, 3 Sep 2020 02:25:05 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Sep 2020 06:40:43 GMT'}]",2020-09-08,"[['Liu', 'Zhe', ''], ['Chen', 'Chunyang', ''], ['Wang', 'Junjie', ''], ['Huang', 'Yuekai', ''], ['Hu', 'Jun', ''], ['Wang', 'Qing', '']]","['UI display', 'Mobile App', 'UI testing', 'Deep Learning']"
8034,2003.01431,Jacques Kaiser,"Jacques Kaiser, Michael Hoff, Andreas Konle, J. Camilo Vasquez Tieck,
  David Kappel, Daniel Reichard, Anand Subramoney, Robert Legenstein, Arne
  Roennau, Wolfgang Maass, Rudiger Dillmann",Embodied Synaptic Plasticity with Online Reinforcement learning,"18 pages, 5 figures, published in frontiers in neurorobotics","Frontiers in neurorobotics, volume 13, p81, 2019",10.3389/fnbot.2019.00081,,cs.NE cs.AI cs.LG cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The endeavor to understand the brain involves multiple collaborating research
fields. Classically, synaptic plasticity rules derived by theoretical
neuroscientists are evaluated in isolation on pattern classification tasks.
This contrasts with the biological brain which purpose is to control a body in
closed-loop. This paper contributes to bringing the fields of computational
neuroscience and robotics closer together by integrating open-source software
components from these two fields. The resulting framework allows to evaluate
the validity of biologically-plausibe plasticity models in closed-loop robotics
environments. We demonstrate this framework to evaluate Synaptic Plasticity
with Online REinforcement learning (SPORE), a reward-learning rule based on
synaptic sampling, on two visuomotor tasks: reaching and lane following. We
show that SPORE is capable of learning to perform policies within the course of
simulated hours for both tasks. Provisional parameter explorations indicate
that the learning rate and the temperature driving the stochastic processes
that govern synaptic learning dynamics need to be regulated for performance
improvements to be retained. We conclude by discussing the recent deep
reinforcement learning techniques which would be beneficial to increase the
functionality of SPORE on visuomotor tasks.
","[{'version': 'v1', 'created': 'Tue, 3 Mar 2020 10:29:02 GMT'}]",2020-03-04,"[['Kaiser', 'Jacques', ''], ['Hoff', 'Michael', ''], ['Konle', 'Andreas', ''], ['Tieck', 'J. Camilo Vasquez', ''], ['Kappel', 'David', ''], ['Reichard', 'Daniel', ''], ['Subramoney', 'Anand', ''], ['Legenstein', 'Robert', ''], ['Roennau', 'Arne', ''], ['Maass', 'Wolfgang', ''], ['Dillmann', 'Rudiger', '']]","['Neurorobotics', 'Synaptic Plasticity', 'Spiking Neural Networks', 'Neuromorphic Vision', 'Rein']"
8035,2002.01559,Anne L. Washington,"Anne L. Washington, Rachel S. Kuo","Whose Side are Ethics Codes On? Power, Responsibility and the Social
  Good","Conference on Fairness, Accountability, and Transparency (FAT* '20),
  January 27-30, 2020, Barcelona, Spain. Corrected",,10.1145/3351095.3372844,,cs.CY cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The moral authority of ethics codes stems from an assumption that they serve
a unified society, yet this ignores the political aspects of any shared
resource. The sociologist Howard S. Becker challenged researchers to clarify
their power and responsibility in the classic essay: Whose Side Are We On.
Building on Becker's hierarchy of credibility, we report on a critical
discourse analysis of data ethics codes and emerging conceptualizations of
beneficence, or the ""social good"", of data technology. The analysis revealed
that ethics codes from corporations and professional associations conflated
consumers with society and were largely silent on agency. Interviews with
community organizers about social change in the digital era supplement the
analysis, surfacing the limits of technical solutions to concerns of
marginalized communities. Given evidence that highlights the gulf between the
documents and lived experiences, we argue that ethics codes that elevate
consumers may simultaneously subordinate the needs of vulnerable populations.
Understanding contested digital resources is central to the emerging field of
public interest technology. We introduce the concept of digital differential
vulnerability to explain disproportionate exposures to harm within data
technology and suggest recommendations for future ethics codes.
","[{'version': 'v1', 'created': 'Tue, 4 Feb 2020 22:05:09 GMT'}]",2020-02-06,"[['Washington', 'Anne L.', ''], ['Kuo', 'Rachel S.', '']]","['ethics codes', 'social movements', 'digital differential vulnerability', 'digital vulnerability', 'data science', 'public interest technology']"
8036,2104.08203,Tesfamariam M Abuhay,"Tesfamariam M. Abuhay, Adane Mamuye, Stewart Robinson, Sergey V.
  Kovalchuk",Why Machine Learning Integrated Patient Flow Simulation?,"Proceedings of the Operational Research Society Simulation Workshop
  2021 (SW21)","Proceedings of the Operational Research Society Simulation
  Workshop 2021 (SW21)",10.36819/SW21.041,,cs.LG cs.AI cs.MA,http://creativecommons.org/licenses/by/4.0/,"  Patient flow analysis can be studied from a clinical and or operational
perspective using simulation. Traditional statistical methods such as
stochastic distribution methods have been used to construct patient flow
simulation submodels such as patient inflow, Length of Stay (LoS), Cost of
Treatment (CoT) and Clinical Pathway (CP) models. However, patient inflow
demonstrates seasonality, trend and variation over time. LoS, CoT and CP are
significantly determined by attributes of patients and clinical and laboratory
test results. For this reason, patient flow simulation models constructed using
traditional statistical methods are criticized for ignoring heterogeneity and
their contribution to personalized and value based healthcare. On the other
hand, machine learning methods have proven to be efficient to study and predict
admission rate, LoS, CoT, and CP. This paper, hence, describes why coupling
machine learning with patient flow simulation is important and proposes a
conceptual architecture that shows how to integrate machine learning with
patient flow simulation.
","[{'version': 'v1', 'created': 'Fri, 16 Apr 2021 16:23:17 GMT'}]",2021-04-19,"[['Abuhay', 'Tesfamariam M.', ''], ['Mamuye', 'Adane', ''], ['Robinson', 'Stewart', ''], ['Kovalchuk', 'Sergey V.', '']]","['Patient Flow Simulation', 'Machine Learning', 'Health Services Research', 'Conceptual Modelling']"
8037,2205.01938,Jialun Cao,"Jialun Cao and Meiziniu Li and Xiao Chen and Ming Wen and Yongqiang
  Tian and Bo Wu and Shing-Chi Cheung","DeepFD: Automated Fault Diagnosis and Localization for Deep Learning
  Programs","Accepted by ICSE 2022. 11 pages for main content, 2 pages for
  reference",,10.1145/3510003.3510099,,cs.SE cs.LG,http://creativecommons.org/licenses/by/4.0/,"  As Deep Learning (DL) systems are widely deployed for mission-critical
applications, debugging such systems becomes essential. Most existing works
identify and repair suspicious neurons on the trained Deep Neural Network
(DNN), which, unfortunately, might be a detour. Specifically, several existing
studies have reported that many unsatisfactory behaviors are actually
originated from the faults residing in DL programs. Besides, locating faulty
neurons is not actionable for developers, while locating the faulty statements
in DL programs can provide developers with more useful information for
debugging. Though a few recent studies were proposed to pinpoint the faulty
statements in DL programs or the training settings (e.g. too large learning
rate), they were mainly designed based on predefined rules, leading to many
false alarms or false negatives, especially when the faults are beyond their
capabilities.
  In view of these limitations, in this paper, we proposed DeepFD, a
learning-based fault diagnosis and localization framework which maps the fault
localization task to a learning problem. In particular, it infers the
suspicious fault types via monitoring the runtime features extracted during DNN
model training and then locates the diagnosed faults in DL programs. It
overcomes the limitations by identifying the root causes of faults in DL
programs instead of neurons and diagnosing the faults by a learning approach
instead of a set of hard-coded rules. The evaluation exhibits the potential of
DeepFD. It correctly diagnoses 52% faulty DL programs, compared with around
half (27%) achieved by the best state-of-the-art works. Besides, for fault
localization, DeepFD also outperforms the existing works, correctly locating
42% faulty programs, which almost doubles the best result (23%) achieved by the
existing works.
","[{'version': 'v1', 'created': 'Wed, 4 May 2022 08:15:56 GMT'}]",2022-05-05,"[['Cao', 'Jialun', ''], ['Li', 'Meiziniu', ''], ['Chen', 'Xiao', ''], ['Wen', 'Ming', ''], ['Tian', 'Yongqiang', ''], ['Wu', 'Bo', ''], ['Cheung', 'Shing-Chi', '']]","['Neural Networks', 'Fault Diagnosis', 'Fault Localization', 'Debugging']"
8038,2208.05320,Yacine Belal,Yacine Belal and Aur\'elien Bellet and Sonia Ben Mokhtar and Vlad Nitu,PEPPER: Empowering User-Centric Recommender Systems over Gossip Learning,"23 pages, 15 figures",,10.1145/3550302,,cs.IR cs.DC cs.LG cs.NI,http://creativecommons.org/licenses/by/4.0/,"  Recommender systems are proving to be an invaluable tool for extracting
user-relevant content helping users in their daily activities (e.g., finding
relevant places to visit, content to consume, items to purchase). However, to
be effective, these systems need to collect and analyze large volumes of
personal data (e.g., location check-ins, movie ratings, click rates .. etc.),
which exposes users to numerous privacy threats. In this context, recommender
systems based on Federated Learning (FL) appear to be a promising solution for
enforcing privacy as they compute accurate recommendations while keeping
personal data on the users' devices. However, FL, and therefore FL-based
recommender systems, rely on a central server that can experience scalability
issues besides being vulnerable to attacks. To remedy this, we propose PEPPER,
a decentralized recommender system based on gossip learning principles. In
PEPPER, users gossip model updates and aggregate them asynchronously. At the
heart of PEPPER reside two key components: a personalized peer-sampling
protocol that keeps in the neighborhood of each node, a proportion of nodes
that have similar interests to the former and a simple yet effective model
aggregation function that builds a model that is better suited to each user.
Through experiments on three real datasets implementing two use cases: a
location check-in recommendation and a movie recommendation, we demonstrate
that our solution converges up to 42% faster than with other decentralized
solutions providing up to 9% improvement on average performance metric such as
hit ratio and up to 21% improvement on long tail performance compared to
decentralized competitors.
","[{'version': 'v1', 'created': 'Tue, 9 Aug 2022 14:51:27 GMT'}]",2022-08-11,"[['Belal', 'Yacine', ''], ['Bellet', 'Aurélien', ''], ['Mokhtar', 'Sonia Ben', ''], ['Nitu', 'Vlad', '']]","['Decentralized Federated Learning', 'Gossip Learning', 'model aggregation', 'Point-of-Interest recommendation', 'recommender systems']"
8039,1804.01373,Xinpeng Chen,"Xinpeng Chen and Jingyuan Chen and Lin Ma and Jian Yao and Wei Liu and
  Jiebo Luo and Tong Zhang","Fine-grained Video Attractiveness Prediction Using Multimodal Deep
  Learning on a Large Real-world Dataset",Accepted by WWW 2018 The Big Web Track,,10.1145/3184558.3186584,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, billions of videos are online ready to be viewed and shared. Among
an enormous volume of videos, some popular ones are widely viewed by online
users while the majority attract little attention. Furthermore, within each
video, different segments may attract significantly different numbers of views.
This phenomenon leads to a challenging yet important problem, namely
fine-grained video attractiveness prediction. However, one major obstacle for
such a challenging problem is that no suitable benchmark dataset currently
exists. To this end, we construct the first fine-grained video attractiveness
dataset, which is collected from one of the most popular video websites in the
world. In total, the constructed FVAD consists of 1,019 drama episodes with
780.6 hours covering different categories and a wide variety of video contents.
Apart from the large amount of videos, hundreds of millions of user behaviors
during watching videos are also included, such as ""view counts"",
""fast-forward"", ""fast-rewind"", and so on, where ""view counts"" reflects the
video attractiveness while other engagements capture the interactions between
the viewers and videos. First, we demonstrate that video attractiveness and
different engagements present different relationships. Second, FVAD provides us
an opportunity to study the fine-grained video attractiveness prediction
problem. We design different sequential models to perform video attractiveness
prediction by relying solely on video contents. The sequential models exploit
the multimodal relationships between visual and audio components of the video
contents at different levels. Experimental results demonstrate the
effectiveness of our proposed sequential models with different visual and audio
representations, the necessity of incorporating the two modalities, and the
complementary behaviors of the sequential prediction models at different
levels.
","[{'version': 'v1', 'created': 'Wed, 4 Apr 2018 12:44:43 GMT'}, {'version': 'v2', 'created': 'Sat, 7 Apr 2018 01:45:29 GMT'}]",2018-04-10,"[['Chen', 'Xinpeng', ''], ['Chen', 'Jingyuan', ''], ['Ma', 'Lin', ''], ['Yao', 'Jian', ''], ['Liu', 'Wei', ''], ['Luo', 'Jiebo', ''], ['Zhang', 'Tong', '']]","['Video Attractiveness', 'Fine-grained', 'Multimodal Fusion', 'Long ShortTerm Memory (LSTM)']"
8040,2212.13258,Simon X. Yang,"Di Wang, Simon X. Yang","Intelligent Feature Extraction, Data Fusion and Detection of Concrete
  Bridge Cracks: Current Development and Challenges","Published at Intelligence & Robotics; Its copyright belongs to
  authors",,10.20517/ir.2022.25,,cs.LG cs.AI cs.SY eess.SY,http://creativecommons.org/publicdomain/zero/1.0/,"  As a common appearance defect of concrete bridges, cracks are important
indices for bridge structure health assessment. Although there has been much
research on crack identification, research on the evolution mechanism of bridge
cracks is still far from practical applications. In this paper, the
state-of-the-art research on intelligent theories and methodologies for
intelligent feature extraction, data fusion and crack detection based on
data-driven approaches is comprehensively reviewed. The research is discussed
from three aspects: the feature extraction level of the multimodal parameters
of bridge cracks, the description level and the diagnosis level of the bridge
crack damage states. We focus on previous research concerning the quantitative
characterization problems of multimodal parameters of bridge cracks and their
implementation in crack identification, while highlighting some of their major
drawbacks. In addition, the current challenges and potential future research
directions are discussed.
","[{'version': 'v1', 'created': 'Sat, 24 Dec 2022 17:40:05 GMT'}]",2022-12-29,"[['Wang', 'Di', ''], ['Yang', 'Simon X.', '']]","['Intelligent detection', 'crack detection', 'deep learning', 'data fusion', 'feature extraction']"
8041,1912.07725,Dimitrios Loukrezis,"Dimitrios Loukrezis, Armin Galetzka, and Herbert De Gersem","Robust Adaptive Least Squares Polynomial Chaos Expansions in
  High-Frequency Applications","17 pages, 7 figures, 2 tables",,10.1002/jnm.2725,,cs.CE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We present an algorithm for computing sparse, least squares-based polynomial
chaos expansions, incorporating both adaptive polynomial bases and sequential
experimental designs. The algorithm is employed to approximate stochastic
high-frequency electromagnetic models in a black-box way, in particular, given
only a dataset of random parameter realizations and the corresponding
observations regarding a quantity of interest, typically a scattering
parameter. The construction of the polynomial basis is based on a greedy,
adaptive, sensitivity-related method. The sequential expansion of the
experimental design employs different optimality criteria, with respect to the
algebraic form of the least squares problem. We investigate how different
conditions affect the robustness of the derived surrogate models, that is, how
much the approximation accuracy varies given different experimental designs. It
is found that relatively optimistic criteria perform on average better than
stricter ones, yielding superior approximation accuracies for equal dataset
sizes. However, the results of strict criteria are significantly more robust,
as reduced variations regarding the approximation accuracy are obtained, over a
range of experimental designs. Two criteria are proposed for a good
accuracy-robustness trade-off.
","[{'version': 'v1', 'created': 'Mon, 16 Dec 2019 21:59:56 GMT'}]",2020-01-13,"[['Loukrezis', 'Dimitrios', ''], ['Galetzka', 'Armin', ''], ['De Gersem', 'Herbert', '']]","['polynomial chaos', 'surrogate modeling', 'high-frequency electromagnetic devices', 'least squaresregression', 'adaptive basis', 'sequential experimental design']"
8042,2004.13121,Amir Javadpour,"Amir Javadpour, Samira Rezaei, Kuan-Ching Li and Guojun Wang","A Scalable Feature Selection and Opinion Miner Using Whale Optimization
  Algorithm",,,10.1007/978-981-15-4828-4_20,,cs.IR cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the fast-growing volume of text documents and reviews in recent years,
current analyzing techniques are not competent enough to meet the users' needs.
Using feature selection techniques not only support to understand data better
but also lead to higher speed and also accuracy. In this article, the Whale
Optimization algorithm is considered and applied to the search for the optimum
subset of features. As known, F-measure is a metric based on precision and
recall that is very popular in comparing classifiers. For the evaluation and
comparison of the experimental results, PART, random tree, random forest, and
RBF network classification algorithms have been applied to the different number
of features. Experimental results show that the random forest has the best
accuracy on 500 features. Keywords: Feature selection, Whale Optimization
algorithm, Selecting optimal, Classification algorithm
","[{'version': 'v1', 'created': 'Tue, 21 Apr 2020 01:08:45 GMT'}]",2020-04-29,"[['Javadpour', 'Amir', ''], ['Rezaei', 'Samira', ''], ['Li', 'Kuan-Ching', ''], ['Wang', 'Guojun', '']]","['feature selection', 'Whale Optimization algorithm', 'selecting optimal', 'classification algorithm']"
8043,1708.03361,Chandranath Adak,"Chandranath Adak, Bidyut B. Chaudhuri, Michael Blumenstein","An Empirical Study on Writer Identification & Verification from
  Intra-variable Individual Handwriting",,,10.1109/ACCESS.2019.2899908,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The handwriting of an individual may vary substantially with factors such as
mood, time, space, writing speed, writing medium and tool, writing topic, etc.
It becomes challenging to perform automated writer verification/identification
on a particular set of handwritten patterns (e.g., speedy handwriting) of a
person, especially when the system is trained using a different set of writing
patterns (e.g., normal speed) of that same person. However, it would be
interesting to experimentally analyze if there exists any implicit
characteristic of individuality which is insensitive to high intra-variable
handwriting. In this paper, we study some handcrafted features and auto-derived
features extracted from intra-variable writing. Here, we work on writer
identification/verification from offline Bengali handwriting of high
intra-variability. To this end, we use various models mainly based on
handcrafted features with SVM (Support Vector Machine) and features
auto-derived by the convolutional network. For experimentation, we have
generated two handwritten databases from two different sets of 100 writers and
enlarged the dataset by a data-augmentation technique. We have obtained some
interesting results.
","[{'version': 'v1', 'created': 'Thu, 10 Aug 2017 19:23:11 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Sep 2018 06:54:38 GMT'}, {'version': 'v3', 'created': 'Sun, 20 Jan 2019 15:23:29 GMT'}]",2020-01-01,"[['Adak', 'Chandranath', ''], ['Chaudhuri', 'Bidyut B.', ''], ['Blumenstein', 'Michael', '']]","['Intra-variable handwriting', 'Writer identification', 'Writer verification']"
8044,1911.05282,Haluk Bingol O.,Zeynep B. Cinar and Haluk O. Bingol,Getting recommendation is not always better,"9 pages, 5 figures","Advances in Complex Systems Vol. 23, No. 05, 2050013 (2020)",10.1142/S0219525920500137,,cs.GT physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an extended version of the Iterated Prisoner's Dilemma game in
which agents with limited memory receive recommendations about the unknown
opponent to decide whether to play with. Since agents can receive more than one
recommendations about the same opponent, they have to evaluate the
recommendations according to their disposition such as optimist, pessimist, or
realist. They keep their firsthand experience in their memory. Since agents
have limited memory, they have to use different forgetting strategies. Our
results show that getting recommendations not always perform better. We observe
that realist performs the best and optimist the worse.
","[{'version': 'v1', 'created': 'Wed, 13 Nov 2019 04:23:52 GMT'}, {'version': 'v2', 'created': 'Wed, 6 May 2020 12:04:48 GMT'}, {'version': 'v3', 'created': 'Sun, 14 Feb 2021 15:48:47 GMT'}]",2021-02-26,"[['Cinar', 'Zeynep B.', ''], ['Bingol', 'Haluk O.', '']]","['Iterated Prisoner’s Dilemma', 'Recommendation', 'Optimist', 'Pessimist', 'Realist', 'Forgetting', 'Multiagent systems']"
8045,2103.16920,Hossein Pakdel,Reza Fotohi and Hossein Pakdel,"A Lightweight and Scalable Physical Layer Attack Detection Mechanism for
  the Internet of Things (IoT) Using Hybrid Security Schema","20 pages, 6 Figures, 8 Tables, Wireless Pers Commun (2021)",,10.1007/s11277-021-08388-1,,cs.CR cs.NI,http://creativecommons.org/licenses/by/4.0/,"  The Internet of Things, also known as the IoT, refers to the billions of
devices around the world that are now connected to the Internet, collecting and
sharing data. The amount of data collected through IoT sensors must be
completely securely controlled. To protect the information collected by IoT
sensors, a lightweight method called Discover the Flooding Attack-RPL (DFA-RPL)
has been proposed. The proposed DFA-RPL method identifies intrusive nodes in
several steps to exclude them from continuing routing operations. Thus, in the
DFA-RPL method, it first builds a cluster and selects the most appropriate node
as a cluster head in DODAG, then, due to the vulnerability of the RPL protocol
to Flooding attacks, it uses an ant colony algorithm (ACO) using five steps to
detect attacks. Use Flooding to prevent malicious activity on the IoT network.
In other words, if it detects a node as malicious, it puts that node on the
detention list and quarantines it for a certain period of time. The results
obtained from the simulation show the superiority of the proposed method in
terms of Packet Delivery Rate, Detection Rate, False Positive Rate, and False
Negative Rate compared to IRAD and REATO methods.
","[{'version': 'v1', 'created': 'Wed, 31 Mar 2021 09:18:06 GMT'}]",2021-04-01,"[['Fotohi', 'Reza', ''], ['Pakdel', 'Hossein', '']]","['Internet of Things (IoT)', 'DODAG based method', 'Flooding attack']"
8046,2204.13442,Sijia Li,"Sijia Li, Gaopeng Gou, Chang Liu, Chengshang Hou, Zhenzhen Li, Gang
  Xiong","TTAGN: Temporal Transaction Aggregation Graph Network for Ethereum
  Phishing Scams Detection",WWW 2022,,10.1145/3485447.3512226,,cs.CR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, phishing scams have become the most serious type of crime
involved in Ethereum, the second-largest blockchain platform. The existing
phishing scams detection technology on Ethereum mostly uses traditional machine
learning or network representation learning to mine the key information from
the transaction network to identify phishing addresses. However, these methods
adopt the last transaction record or even completely ignore these records, and
only manual-designed features are taken for the node representation. In this
paper, we propose a Temporal Transaction Aggregation Graph Network (TTAGN) to
enhance phishing scams detection performance on Ethereum. Specifically, in the
temporal edges representation module, we model the temporal relationship of
historical transaction records between nodes to construct the edge
representation of the Ethereum transaction network. Moreover, the edge
representations around the node are aggregated to fuse topological interactive
relationships into its representation, also named as trading features, in the
edge2node module. We further combine trading features with common statistical
and structural features obtained by graph neural networks to identify phishing
addresses. Evaluated on real-world Ethereum phishing scams datasets, our TTAGN
(92.8% AUC, and 81.6% F1score) outperforms the state-of-the-art methods, and
the effectiveness of temporal edges representation and edge2node module is also
demonstrated.
","[{'version': 'v1', 'created': 'Thu, 28 Apr 2022 12:17:00 GMT'}]",2022-04-29,"[['Li', 'Sijia', ''], ['Gou', 'Gaopeng', ''], ['Liu', 'Chang', ''], ['Hou', 'Chengshang', ''], ['Li', 'Zhenzhen', ''], ['Xiong', 'Gang', '']]","['Blockchain', 'Ethereum', 'Phishing scams detection', 'Network representation learning']"
8047,2104.05018,Yu Pan,"Yu Pan, Maolin Wang, Zenglin Xu",TedNet: A Pytorch Toolkit for Tensor Decomposition Networks,Accepted in Neurocomputing,,10.1016/j.neucom.2021.10.064,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tensor Decomposition Networks (TDNs) prevail for their inherent compact
architectures. To give more researchers a flexible way to exploit TDNs, we
present a Pytorch toolkit named TedNet. TedNet implements 5 kinds of tensor
decomposition(i.e., CANDECOMP/PARAFAC (CP), Block-Term Tucker (BTT), Tucker-2,
Tensor Train (TT) and Tensor Ring (TR) on traditional deep neural layers, the
convolutional layer and the fully-connected layer. By utilizing the basic
layers, it is simple to construct a variety of TDNs. TedNet is available at
https://github.com/tnbar/tednet.
","[{'version': 'v1', 'created': 'Sun, 11 Apr 2021 14:04:06 GMT'}, {'version': 'v2', 'created': 'Sun, 21 Nov 2021 13:15:43 GMT'}]",2021-11-23,"[['Pan', 'Yu', ''], ['Wang', 'Maolin', ''], ['Xu', 'Zenglin', '']]","['Tensor Decomposition Networks', 'Deep Neural Networks', 'Tensor Networks', 'NetworkCompression']"
8048,2111.03089,Rinat Aynulin,"Rinat Aynulin, Pavel Chebotarev",Measuring Proximity in Attributed Networks for Community Detection,,Studies in Computational Intelligence 943 (2021) 27-37,10.1007/978-3-030-65347-7_3,,cs.SI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Proximity measures on graphs have a variety of applications in network
analysis, including community detection. Previously they have been mainly
studied in the context of networks without attributes. If node attributes are
taken into account, however, this can provide more insight into the network
structure. In this paper, we extend the definition of some well-studied
proximity measures to attributed networks. To account for attributes, several
attribute similarity measures are used. Finally, the obtained proximity
measures are applied to detect the community structure in some real-world
networks using the spectral clustering algorithm.
","[{'version': 'v1', 'created': 'Thu, 4 Nov 2021 18:07:05 GMT'}]",2022-12-06,"[['Aynulin', 'Rinat', ''], ['Chebotarev', 'Pavel', '']]","['attributed networks', 'community detection', 'proximity measure', 'kernel on graph']"
8049,2111.08788,Alan Smeaton,"Aparajita Dey-Plissonneau, Hyowon Lee, Michael Scriney, Alan F.
  Smeaton, Vincent Pradier, Hamza Riaz","Facilitating reflection in teletandem through automatically generated
  conversation metrics and playback video",5 pages,CALL and professionalisation: short papers from EUROCALL 2021,10.14705/rpnet.2021.54.1314,,cs.CL cs.HC,http://creativecommons.org/licenses/by/4.0/,"  This pilot study focuses on a tool called L2L that allows second language
(L2) learners to visualise and analyse their Zoom interactions with native
speakers. L2L uses the Zoom transcript to automatically generate conversation
metrics and its playback feature with timestamps allows students to replay any
chosen portion of the conversation for post-session reflection and self-review.
This exploratory study investigates a seven-week teletandem project, where
undergraduate students from an Irish University learning French (B2) interacted
with their peers from a French University learning English (B2+) via Zoom. The
data collected from a survey (N=43) and semi-structured interviews (N=35) show
that the quantitative conversation metrics and qualitative review of the
synchronous content helped raise students' confidence levels while engaging
with native speakers. Furthermore, it allowed them to set tangible goals to
improve their participation, and be more aware of what, why and how they are
learning.
","[{'version': 'v1', 'created': 'Tue, 16 Nov 2021 21:33:07 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Nov 2021 13:49:01 GMT'}]",2021-12-15,"[['Dey-Plissonneau', 'Aparajita', ''], ['Lee', 'Hyowon', ''], ['Scriney', 'Michael', ''], ['Smeaton', 'Alan F.', ''], ['Pradier', 'Vincent', ''], ['Riaz', 'Hamza', '']]","['conversation metrics', 'reflection', 'L2 learning', 'teletandem']"
8050,2107.04887,Philip Purnell,Philip J. Purnell,"The prevalence and impact of university affiliation discrepancies
  between four well-known bibliographic databases: Scopus, Web of Science,
  Dimensions, and Microsoft Academic","40 pages, 4 tables, 9 figures",,10.1162/qss_a_00175,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Research managers benchmarking universities against international peers face
the problem of affiliation disambiguation. Different databases have taken
separate approaches to this problem and discrepancies exist between them.
Bibliometric data sources typically conduct a disambiguation process that
unifies variant institutional names and those of its sub-units so that
researchers can then search all records from that institution using a single
unified name. This study examined affiliation discrepancies between Scopus, Web
of Science, Dimensions, and Microsoft Academic for 18 Arab universities over a
five-year period. We confirmed that digital object identifiers (DOIs) are
suitable for extracting comparable scholarly material across databases and
quantified the affiliation discrepancies between them. A substantial share of
records assigned to the selected universities in any one database were not
assigned to the same university in another. The share of discrepancy was higher
in the larger databases, Dimensions and Microsoft Academic. The smaller, more
selective databases, Scopus and especially Web of Science tended to agree to a
greater degree with affiliations in the other databases. Manual examination of
affiliation discrepancies showed they were caused by a mixture of missing
affiliations, unification differences, and assignation of records to the wrong
institution.
","[{'version': 'v1', 'created': 'Sat, 10 Jul 2021 18:20:18 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Dec 2021 14:45:24 GMT'}]",2022-01-14,"[['Purnell', 'Philip J.', '']]","['Benchmarking', 'affiliation', 'disambiguation', 'unification', 'bibliometric database', 'university']"
8051,1708.05085,Mahdi Miraz,"Mahdi H. Miraz, Maaruf Ali and Peter Excell","Multilingual Website Usability Analysis Based on an International User
  Survey",,"the proceedings of the fifth international conference on Internet
  Technologies and Applications (ITA 13) held at Glyndwr University in Wrexham,
  UK, 10-13 September 2013, ISBN-10: 0-946881-81-2, ISBN-13: 978-0-946881-81-9,
  pp. 236-244",10.13140/2.1.1208.8648,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A study was undertaken to determine the important usability factors (UF) used
in the English and the non-English version of a website. The important
usability factors were determined, based on a detailed questionnaire used in an
international survey. Analysis of the questionnaire found inequalities in the
user satisfaction and a general dissatisfaction with the non-English version of
the website. The study concluded that more care should be taken in creating the
text, taking into account the cultural and linguistic background of the users
and the use of graphics in multilingual websites.
","[{'version': 'v1', 'created': 'Wed, 9 Aug 2017 19:34:26 GMT'}]",2017-08-18,"[['Miraz', 'Mahdi H.', ''], ['Ali', 'Maaruf', ''], ['Excell', 'Peter', '']]","['Usability Factors', 'User Interface Design', 'Human-Computer Interaction', 'Web Usability']"
8052,2111.13662,Will Crichton,"Will Crichton, Marco Patrignani, Maneesh Agrawala, Pat Hanrahan",Modular Information Flow through Ownership,Published at PLDI 2022,,10.1145/3519939.3523445,,cs.PL,http://creativecommons.org/licenses/by/4.0/,"  Statically analyzing information flow, or how data influences other data
within a program, is a challenging task in imperative languages. Analyzing
pointers and mutations requires access to a program's complete source. However,
programs often use pre-compiled dependencies where only type signatures are
available. We demonstrate that ownership types can be used to soundly and
precisely analyze information flow through function calls given only their type
signature. From this insight, we built Flowistry, a system for analyzing
information flow in Rust, an ownership-based language. We prove the system's
soundness as a form of noninterference using the Oxide formal model of Rust.
Then we empirically evaluate the precision of Flowistry, showing that modular
flows are identical to whole-program flows in 94% of cases drawn from large
Rust codebases. We illustrate the applicability of Flowistry by using it to
implement prototypes of a program slicer and an information flow control
system.
","[{'version': 'v1', 'created': 'Fri, 26 Nov 2021 18:40:57 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Mar 2022 19:33:33 GMT'}]",2022-03-17,"[['Crichton', 'Will', ''], ['Patrignani', 'Marco', ''], ['Agrawala', 'Maneesh', ''], ['Hanrahan', 'Pat', '']]","['information flow', 'ownership types', 'rust']"
8053,2107.07212,Miguel Terra-Neves PhD,"Miguel Terra-Neves, Jo\~ao Nadkarni, Miguel Ventura, Pedro Resende,
  Hugo Veiga and Ant\'onio Alegria",Duplicated Code Pattern Mining in Visual Programming Languages,Shorter version accepted for publication at FSE 2021,,10.1145/3468264.3473928,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visual Programming Languages (VPLs), coupled with the high-level abstractions
that are commonplace in visual programming environments, enable users with less
technical knowledge to become proficient programmers. However, the lower skill
floor required by VPLs also entails that programmers are more likely to not
adhere to best practices of software development, producing systems with high
technical debt, and thus poor maintainability. Duplicated code is one important
example of such technical debt. In fact, we observed that the amount of
duplication in the OutSystems VPL code bases can reach as high as $39\%$.
  Duplicated code detection in text-based programming languages is still an
active area of research with important implications regarding software
maintainability and evolution. However, to the best of our knowledge, the
literature on duplicated code detection for VPLs is very limited. We propose a
novel and scalable duplicated code pattern mining algorithm that leverages the
visual structure of VPLs in order to not only detect duplicated code, but also
highlight duplicated code patterns that explain the reported duplication. The
performance of the proposed approach is evaluated on a wide range of real-world
mobile and web applications developed using OutSystems.
","[{'version': 'v1', 'created': 'Thu, 15 Jul 2021 09:39:52 GMT'}]",2021-07-16,"[['Terra-Neves', 'Miguel', ''], ['Nadkarni', 'João', ''], ['Ventura', 'Miguel', ''], ['Resende', 'Pedro', ''], ['Veiga', 'Hugo', ''], ['Alegria', 'António', '']]","['duplicated code', 'visual programming', 'maximum common sub-graph', 'maximum satisfiability']"
8054,1903.06800,Alessandro Betti,"Lorenzo Gigoni, Alessandro Betti, Emanuele Crisostomi, Alessandro
  Franco, Mauro Tucci, Fabrizio Bizzarri, Debora Mucci","Day-Ahead Hourly Forecasting of Power Generation from Photovoltaic
  Plants","Preprint of IEEE Transactions of Sustainable Energy, Vol. 9, Issue 2,
  pp. 831 - 842 (2018)","IEEE Transactions of Sustainable Energy, Vol. 9, Issue 2, pp. 831
  - 842 (2018)",10.1109/TSTE.2017.2762435,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ability to accurately forecast power generation from renewable sources is
nowadays recognised as a fundamental skill to improve the operation of power
systems. Despite the general interest of the power community in this topic, it
is not always simple to compare different forecasting methodologies, and infer
the impact of single components in providing accurate predictions. In this
paper we extensively compare simple forecasting methodologies with more
sophisticated ones over 32 photovoltaic plants of different size and technology
over a whole year. Also, we try to evaluate the impact of weather conditions
and weather forecasts on the prediction of PV power generation.
","[{'version': 'v1', 'created': 'Tue, 26 Feb 2019 11:29:18 GMT'}]",2019-03-19,"[['Gigoni', 'Lorenzo', ''], ['Betti', 'Alessandro', ''], ['Crisostomi', 'Emanuele', ''], ['Franco', 'Alessandro', ''], ['Tucci', 'Mauro', ''], ['Bizzarri', 'Fabrizio', ''], ['Mucci', 'Debora', '']]","['PV plants', 'Machine Learning algorithms', 'power generation forecasts']"
8055,2206.02366,Alexandr Notchenko,"Alexandr Notchenko, Vladislav Ishimtsev, Alexey Artemov, Vadim
  Selyutin, Emil Bogomolov, Evgeny Burnaev","Scan2Part: Fine-grained and Hierarchical Part-level Understanding of
  Real-World 3D Scans","In Proceedings of the 17th International Joint Conference on Computer
  Vision, Imaging and Computer Graphics Theory and Applications",,10.5220/0010848200003124,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose Scan2Part, a method to segment individual parts of objects in
real-world, noisy indoor RGB-D scans. To this end, we vary the part hierarchies
of objects in indoor scenes and explore their effect on scene understanding
models. Specifically, we use a sparse U-Net-based architecture that captures
the fine-scale detail of the underlying 3D scan geometry by leveraging a
multi-scale feature hierarchy. In order to train our method, we introduce the
Scan2Part dataset, which is the first large-scale collection providing detailed
semantic labels at the part level in the real-world setting. In total, we
provide 242,081 correspondences between 53,618 PartNet parts of 2,477 ShapeNet
objects and 1,506 ScanNet scenes, at two spatial resolutions of 2 cm$^3$ and 5
cm$^3$. As output, we are able to predict fine-grained per-object part labels,
even when the geometry is coarse or partially missing.
","[{'version': 'v1', 'created': 'Mon, 6 Jun 2022 05:43:10 GMT'}]",2022-06-07,"[['Notchenko', 'Alexandr', ''], ['Ishimtsev', 'Vladislav', ''], ['Artemov', 'Alexey', ''], ['Selyutin', 'Vadim', ''], ['Bogomolov', 'Emil', ''], ['Burnaev', 'Evgeny', '']]","['semantic segmentation', 'scene understanding', 'volumetric scenes', 'part-level segmentation']"
8056,2007.11534,Saeid Alirezazadeh,Saeid Alirezazadeh and Lu\'is A. Alexandre,Dynamic Task Allocation for Robotic Network Cloud Systems,,"2020 IEEE Intl Conf on Parallel & Distributed Processing with
  Applications, Big Data & Cloud Computing, Sustainable Computing &
  Communications, Social Computing & Networking
  (ISPA/BDCloud/SocialCom/SustainCom)",10.1109/ISPA-BDCloud-SocialCom-SustainCom51426.2020.00181,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Every robotic network cloud system can be seen as a graph with nodes as
hardware with independent computational processing powers and edges as data
transmissions between nodes. When assigning a task to a node we may change
several values corresponding to the node such as distance to other nodes, the
time to complete all of its tasks, the energy level of the node, energy
consumed while performing all of its tasks, geometrical position, communication
with other nodes, and so on. These values can be seen as fingerprints for the
current state of the node which can be evaluated as a subspace of a hyperspace.
We proposed a theoretical model describing how assigning tasks to a node will
change the subspace of the hyperspace, and from that, we show how to obtain the
optimal task allocation. We described the communication instability between
nodes and the capability of nodes as subspaces of a hyperspace. We translate
task scheduling to nodes as finding the maximum volume of the hyperspace.
","[{'version': 'v1', 'created': 'Wed, 22 Jul 2020 16:48:43 GMT'}]",2021-04-27,"[['Alirezazadeh', 'Saeid', ''], ['Alexandre', 'Luís A.', '']]","['cloud', 'fog', 'edge', 'hyperspace', 'task scheduling']"
8057,2108.11486,Markus Langer,"Markus Langer, Tim Hunsicker, Tina Feldkamp, Cornelius J. K\""onig,
  Nina Grgi\'c-Hla\v{c}a","""Look! It's a Computer Program! It's an Algorithm! It's AI!"": Does
  Terminology Affect Human Perceptions and Evaluations of Algorithmic
  Decision-Making Systems?","Preregistrations for the studies included in this paper are available
  under https://aspredicted.org/LDC\_GSM and https://aspredicted.org/NTE\_WND","In Proceedings of the 2022 CHI Conference on Human Factors in
  Computing Systems",10.1145/3491102.3517527,,cs.HC cs.CY,http://creativecommons.org/licenses/by/4.0/,"  In the media, in policy-making, but also in research articles, algorithmic
decision-making (ADM) systems are referred to as algorithms, artificial
intelligence, and computer programs, amongst other terms. We hypothesize that
such terminological differences can affect people's perceptions of properties
of ADM systems, people's evaluations of systems in application contexts, and
the replicability of research as findings may be influenced by terminological
differences. In two studies (N = 397, N = 622), we show that terminology does
indeed affect laypeople's perceptions of system properties (e.g., perceived
complexity) and evaluations of systems (e.g., trust). Our findings highlight
the need to be mindful when choosing terms to describe ADM systems, because
terminology can have unintended consequences, and may impact the robustness and
replicability of HCI research. Additionally, our findings indicate that
terminology can be used strategically (e.g., in communication about ADM
systems) to influence people's perceptions and evaluations of these systems.
","[{'version': 'v1', 'created': 'Wed, 25 Aug 2021 21:59:13 GMT'}, {'version': 'v2', 'created': 'Thu, 26 May 2022 14:20:57 GMT'}]",2022-05-27,"[['Langer', 'Markus', ''], ['Hunsicker', 'Tim', ''], ['Feldkamp', 'Tina', ''], ['König', 'Cornelius J.', ''], ['Grgić-Hlača', 'Nina', '']]","['human-centered AI', 'terminology', 'research methodology', 'replicability']"
8058,2104.13697,Stephen MacDonell,"Frederick Schmidt, Stephen MacDonell and Andy M. Connor",Multi-Objective Reconstruction Of Software Architecture,"Journal paper, 12 pages, 5 figures, 3 tables","International Journal of Software Engineering and Knowledge
  Engineering 28(6)(2018), pp.869-892",10.1142/S0218194018500262,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Design erosion is a persistent problem within the software engineering
discipline. Software designs tend to deteriorate over time and there is a need
for tools and techniques that support software architects when dealing with
legacy systems. This paper presents an evaluation of a Search Based Software
Engineering (SBSE) approach intended to recover high-level architecture designs
of software systems by structuring low-level artefacts into high-level
architecture artefact configurations. In particular , this paper describes the
performance evaluation of a number of metaheuristic search algorithms applied
to architecture reconstruction problems with high dimensionality in terms of
objectives. These problems have been selected as representative of the typical
challenges faced by software architects dealing with legacy systems and the
results inform the ongoing developed of a software tool that supports the
analysis of trade-offs between different reconstructed architectures.
","[{'version': 'v1', 'created': 'Wed, 28 Apr 2021 10:56:40 GMT'}]",2021-04-29,"[['Schmidt', 'Frederick', ''], ['MacDonell', 'Stephen', ''], ['Connor', 'Andy M.', '']]","['Search Based Software Engineering', 'Software Architecture', 'Architecture Reconstruction', 'Software Maintenance']"
8059,2107.07663,EPTCS,"Qinxiang Cao (John Hopcroft Center of Computer Science, Shanghai Jiao
  Tong University, Shanghai Key Laboratory of Trustworthy Computing, East China
  Normal University), Xiwei Wu (Shanghai Jiao Tong University)",Countability of Inductive Types Formalized in the Object-Logic Level,"In Proceedings LFMTP 2021, arXiv:2107.07376","EPTCS 337, 2021, pp. 55-70",10.4204/EPTCS.337.5,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  The set of integer number lists with finite length, and the set of binary
trees with integer labels are both countably infinite. Many inductively defined
types also have countably many elements. In this paper, we formalize the syntax
of first order inductive definitions in Coq and prove them countable, under
some side conditions. Instead of writing a proof generator in a meta language,
we develop an axiom-free proof in the Coq object logic. In other words, our
proof is a dependently typed Coq function from the syntax of the inductive
definition to the countability of the type. Based on this proof, we provide a
Coq tactic to automatically prove the countability of concrete inductive types.
We also developed Coq libraries for countability and for the syntax of
inductive definitions, which have value on their own.
","[{'version': 'v1', 'created': 'Fri, 16 Jul 2021 01:44:22 GMT'}]",2021-07-19,"[['Cao', 'Qinxiang', '', 'John Hopcroft Center of Computer Science, Shanghai Jiao\n  Tong University, Shanghai Key Laboratory of Trustworthy Computing, East China\n  Normal University'], ['Wu', 'Xiwei', '', 'Shanghai Jiao Tong University']]","['countable', 'Coq', 'dependent type', 'inductive type', 'object logic', 'meta logic']"
8060,1911.01528,Jamshid Mozafari,"Jamshid Mozafari, Afsaneh Fatemi, Mohammad Ali Nematbakhsh",BAS: An Answer Selection Method Using BERT Language Model,"28 pages, 19 figures, 8 tables, Journal of Computing and Security",Journal of Computing and Security 8 (2021) 1-18,10.22108/jcs.2021.128002.1066,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, Question Answering systems have become more popular and
widely used by users. Despite the increasing popularity of these systems, the
their performance is not even sufficient for textual data and requires further
research. These systems consist of several parts that one of them is the Answer
Selection component. This component detects the most relevant answer from a
list of candidate answers. The methods presented in previous researches have
attempted to provide an independent model to undertake the answer-selection
task. An independent model cannot comprehend the syntactic and semantic
features of questions and answers with a small training dataset. To fill this
gap, language models can be employed in implementing the answer selection part.
This action enables the model to have a better understanding of the language in
order to understand questions and answers better than previous works. In this
research, we will present the ""BAS"" (BERT Answer Selection) that uses the BERT
language model to comprehend language. The empirical results of applying the
model on the TrecQA Raw, TrecQA Clean, and WikiQA datasets demonstrate that
using a robust language model such as BERT can enhance the performance. Using a
more robust classifier also enhances the effect of the language model on the
answer selection component. The results demonstrate that language comprehension
is an essential requirement in natural language processing tasks such as
answer-selection.
","[{'version': 'v1', 'created': 'Mon, 4 Nov 2019 23:16:47 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Nov 2019 19:31:09 GMT'}, {'version': 'v3', 'created': 'Tue, 11 Feb 2020 14:20:01 GMT'}, {'version': 'v4', 'created': 'Thu, 14 Oct 2021 14:01:25 GMT'}]",2021-10-19,"[['Mozafari', 'Jamshid', ''], ['Fatemi', 'Afsaneh', ''], ['Nematbakhsh', 'Mohammad Ali', '']]","['Question answering systems', 'Deep learning', 'Answer selection', 'Language modeling']"
8061,2204.13582,Pushkar Mishra,"David Adkins, Bilal Alsallakh, Adeel Cheema, Narine Kokhlikyan, Emily
  McReynolds, Pushkar Mishra, Chavez Procope, Jeremy Sawruk, Erin Wang, Polina
  Zvyagina",Prescriptive and Descriptive Approaches to Machine-Learning Transparency,ACM CHI Conference on Human Factors in Computing Systems 2022,,10.1145/3491101.3519724,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Specialized documentation techniques have been developed to communicate key
facts about machine-learning (ML) systems and the datasets and models they rely
on. Techniques such as Datasheets, FactSheets, and Model Cards have taken a
mainly descriptive approach, providing various details about the system
components. While the above information is essential for product developers and
external experts to assess whether the ML system meets their requirements,
other stakeholders might find it less actionable. In particular, ML engineers
need guidance on how to mitigate potential shortcomings in order to fix bugs or
improve the system's performance. We survey approaches that aim to provide such
guidance in a prescriptive way. We further propose a preliminary approach,
called Method Cards, which aims to increase the transparency and
reproducibility of ML systems by providing prescriptive documentation of
commonly-used ML methods and techniques. We showcase our proposal with an
example in small object detection, and demonstrate how Method Cards can
communicate key considerations for model developers. We further highlight
avenues for improving the user experience of ML engineers based on Method
Cards.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2022 15:26:50 GMT'}]",2022-04-29,"[['Adkins', 'David', ''], ['Alsallakh', 'Bilal', ''], ['Cheema', 'Adeel', ''], ['Kokhlikyan', 'Narine', ''], ['McReynolds', 'Emily', ''], ['Mishra', 'Pushkar', ''], ['Procope', 'Chavez', ''], ['Sawruk', 'Jeremy', ''], ['Wang', 'Erin', ''], ['Zvyagina', 'Polina', '']]","['Method Cards', 'Developer Experience', 'Transparency']"
8062,1908.10398,Heriberto Cuay\'ahuitl,Heriberto Cuay\'ahuitl,"A Data-Efficient Deep Learning Approach for Deployable Multimodal Social
  Robots",,,10.1016/j.neucom.2018.09.104,,cs.AI cs.LG cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The deep supervised and reinforcement learning paradigms (among others) have
the potential to endow interactive multimodal social robots with the ability of
acquiring skills autonomously. But it is still not very clear yet how they can
be best deployed in real world applications. As a step in this direction, we
propose a deep learning-based approach for efficiently training a humanoid
robot to play multimodal games---and use the game of `Noughts & Crosses' with
two variants as a case study. Its minimum requirements for learning to perceive
and interact are based on a few hundred example images, a few example
multimodal dialogues and physical demonstrations of robot manipulation, and
automatic simulations. In addition, we propose novel algorithms for robust
visual game tracking and for competitive policy learning with high winning
rates, which substantially outperform DQN-based baselines. While an automatic
evaluation shows evidence that the proposed approach can be easily extended to
new games with competitive robot behaviours, a human evaluation with 130 humans
playing with the Pepper robot confirms that highly accurate visual perception
is required for successful game play.
","[{'version': 'v1', 'created': 'Tue, 27 Aug 2019 18:30:49 GMT'}]",2019-08-29,"[['Cuayáhuitl', 'Heriberto', '']]","['Deep Reinforcement Learning', 'Deep Supervised Learning', 'InteractiveRobots', 'Multimodal Perception and Interaction', 'Board Games']"
8063,2203.07115,Tina Dardeno,"Tina A Dardeno, Lawrence A Bull, Robin S Mills, Nikolaos Dervilis,
  Keith Worden","Modelling variability in vibration-based PBSHM via a generalised
  population form",,J. Sound Vib. 538 (2022) 117227,10.1016/j.jsv.2022.117227,,cs.LG eess.SP stat.AP stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Structural health monitoring (SHM) has been an active research area for the
last three decades, and has accumulated a number of critical advances over that
period, as can be seen in the literature. However, SHM is still facing
challenges because of the paucity of damage-state data, operational and
environmental fluctuations, repeatability issues, and changes in boundary
conditions. These issues present as inconsistencies in the captured features
and can have a huge impact on the practical implementation, but more
critically, on the generalisation of the technology. Population-based SHM has
been designed to address some of these concerns by modelling and transferring
missing information using data collected from groups of similar structures.
  In this work, vibration data were collected from four healthy,
nominally-identical, full-scale composite helicopter blades. Manufacturing
differences (e.g., slight differences in geometry and/or material properties),
among the blades presented as variability in their structural dynamics, which
can be very problematic for SHM based on machine learning from vibration data.
This work aims to address this variability by defining a general model for the
frequency response functions of the blades, called a form, using mixtures of
Gaussian processes.
","[{'version': 'v1', 'created': 'Mon, 14 Mar 2022 14:00:07 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Aug 2022 13:04:56 GMT'}]",2022-08-31,"[['Dardeno', 'Tina A', ''], ['Bull', 'Lawrence A', ''], ['Mills', 'Robin S', ''], ['Dervilis', 'Nikolaos', ''], ['Worden', 'Keith', '']]","['repeatability', 'uncertainty', 'Gaussian processes', 'population-basedSHM']"
8064,2107.13472,Vito Walter Anelli Dr.,"Vito Walter Anelli, Alejandro Bellog\'in, Tommaso Di Noia, Claudio
  Pomo",Reenvisioning Collaborative Filtering vs Matrix Factorization,"Preprint, Accepted for publication at ACM RecSys 2021,9 pages",,10.1145/3460231.3475944,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Collaborative filtering models based on matrix factorization and learned
similarities using Artificial Neural Networks (ANNs) have gained significant
attention in recent years. This is, in part, because ANNs have demonstrated
good results in a wide variety of recommendation tasks. The introduction of
ANNs within the recommendation ecosystem has been recently questioned, raising
several comparisons in terms of efficiency and effectiveness. One aspect most
of these comparisons have in common is their focus on accuracy, neglecting
other evaluation dimensions important for the recommendation, such as novelty,
diversity, or accounting for biases. We replicate experiments from three papers
that compare Neural Collaborative Filtering (NCF) and Matrix Factorization
(MF), to extend the analysis to other evaluation dimensions. Our contribution
shows that the experiments are entirely reproducible, and we extend the study
including other accuracy metrics and two statistical hypothesis tests. We
investigated the Diversity and Novelty of the recommendations, showing that MF
provides a better accuracy also on the long tail, although NCF provides a
better item coverage and more diversified recommendations. We discuss the bias
effect generated by the tested methods. They show a relatively small bias, but
other recommendation baselines, with competitive accuracy performance,
consistently show to be less affected by this issue. This is the first work, to
the best of our knowledge, where several evaluation dimensions have been
explored for an array of SOTA algorithms covering recent adaptations of ANNs
and MF. Hence, we show the potential these techniques may have on
beyond-accuracy evaluation while analyzing the effect on reproducibility these
complementary dimensions may spark. Available at
github.com/sisinflab/Reenvisioning-the-comparison-between-Neural-Collaborative-Filtering-and-Matrix-Factorization
","[{'version': 'v1', 'created': 'Wed, 28 Jul 2021 16:29:38 GMT'}]",2021-07-29,"[['Anelli', 'Vito Walter', ''], ['Bellogín', 'Alejandro', ''], ['Di Noia', 'Tommaso', ''], ['Pomo', 'Claudio', '']]","['Item Recommendation', 'Matrix Factorization', 'Neural CollaborativeFiltering']"
8065,1904.09231,Nikolaj Tatti,"Nikolaj Tatti, Boris Cule",Mining Closed Strict Episodes,Journal version. The previous version is the conference version,,10.1007/s10618-011-0232-z,,cs.DB cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Discovering patterns in a sequence is an important aspect of data mining. One
popular choice of such patterns are episodes, patterns in sequential data
describing events that often occur in the vicinity of each other. Episodes also
enforce in which order the events are allowed to occur.
  In this work we introduce a technique for discovering closed episodes.
Adopting existing approaches for discovering traditional patterns, such as
closed itemsets, to episodes is not straightforward. First of all, we cannot
define a unique closure based on frequency because an episode may have several
closed superepisodes. Moreover, to define a closedness concept for episodes we
need a subset relationship between episodes, which is not trivial to define.
  We approach these problems by introducing strict episodes. We argue that this
class is general enough, and at the same time we are able to define a natural
subset relationship within it and use it efficiently. In order to mine closed
episodes we define an auxiliary closure operator. We show that this closure
satisfies the needed properties so that we can use the existing framework for
mining closed patterns. Discovering the true closed episodes can be done as a
post-processing step. We combine these observations into an efficient mining
algorithm and demonstrate empirically its performance in practice.
","[{'version': 'v1', 'created': 'Sun, 14 Apr 2019 00:24:47 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Apr 2019 23:19:21 GMT'}]",2019-04-26,"[['Tatti', 'Nikolaj', ''], ['Cule', 'Boris', '']]","['Frequent Episode Mining', 'Closed Episodes', 'Level-wise Algorithm']"
8066,2108.06905,Yue Yu,"Somdatta Goswami, Minglang Yin, Yue Yu, George Karniadakis","A physics-informed variational DeepONet for predicting the crack path in
  brittle materials",,,10.1016/j.cma.2022.114587,,cs.LG cs.NA math.NA,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Failure trajectories, identifying the probable failure zones, and damage
statistics are some of the key quantities of relevance in brittle fracture
applications. High-fidelity numerical solvers that reliably estimate these
relevant quantities exist but they are computationally demanding requiring a
high resolution of the crack. Moreover, independent intensive simulations need
to be carried out even for a small change in domain parameters and/or material
properties. Therefore, fast and generalizable surrogate models are needed to
alleviate the computational burden but the discontinuous nature of fracture
mechanics presents a major challenge to developing such models. We propose a
physics-informed variational formulation of DeepONet (V-DeepONet) for brittle
fracture analysis. V-DeepONet is trained to map the initial configuration of
the defect to the relevant fields of interests (e.g., damage and displacement
fields). Once the network is trained, the entire global solution can be rapidly
obtained for any initial crack configuration and loading steps on that domain.
While the original DeepONet is solely data-driven, we take a different path to
train the V-DeepONet by imposing the governing equations in variational form
and we also use some labelled data. We demonstrate the effectiveness of
V-DeepOnet through two benchmarks of brittle fracture, and we verify its
accuracy using results from high-fidelity solvers. Encoding the physical laws
and also some data to train the network renders the surrogate model capable of
accurately performing both interpolation and extrapolation tasks, considering
that fracture modeling is very sensitive to fluctuations. The proposed hybrid
training of V-DeepONet is superior to state-of-the-art methods and can be
applied to a wide array of dynamical systems with complex responses.
","[{'version': 'v1', 'created': 'Mon, 16 Aug 2021 05:31:05 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Sep 2021 06:33:30 GMT'}]",2022-02-16,"[['Goswami', 'Somdatta', ''], ['Yin', 'Minglang', ''], ['Yu', 'Yue', ''], ['Karniadakis', 'George', '']]","['DeepONet', 'Variational energy', 'Physics-informed learning', 'Phase-field', 'Brittlefracture', 'Surrogate modeling']"
8067,1712.04744,Galymzhan Nauryzbayev,"Sultangali Arzykulov, Galymzhan Nauryzbayev, Theodoros A. Tsiftsis,
  Mohamed Abdallah","Error Performance of Wireless Powered Cognitive Relay Networks with
  Interference Alignment","12 pages, 4 figures, To appear in IEEE International Symposium on
  Personal, Indoor and Mobile Radio Communications (IEEE PIMRC 2017), Montreal,
  Canada, October 2017",,10.1109/PIMRC.2017.8292459,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies a two-hop decode-and-forward underlay cognitive radio
system with interference alignment technique. An energy-constrained relay node
harvests the energy from the interference signals through a power-splitting
(PS) relaying protocol. Firstly, the beamforming matrices design for the
primary and secondary networks is demonstrated. Then, a bit error rate (BER)
performance of the system under perfect and imperfect channel state information
(CSI) scenarios for PS protocol is calculated. Finally, the impact of the CSI
mismatch parameters on the BER performance is simulated.
","[{'version': 'v1', 'created': 'Wed, 13 Dec 2017 12:55:23 GMT'}]",2018-03-12,"[['Arzykulov', 'Sultangali', ''], ['Nauryzbayev', 'Galymzhan', ''], ['Tsiftsis', 'Theodoros A.', ''], ['Abdallah', 'Mohamed', '']]","['Decode-and-forward (DF) relaying', 'energy harvesting (EH)', 'cognitive radio (CR)', 'interference']"
8068,2206.03368,Haoyuan Chen,"Haoyuan Chen, Chen Li, Xiaoyan Li, Md Mamunur Rahaman, Weiming Hu,
  Yixin Li, Wanli Liu, Changhao Sun, Hongzan Sun, Xinyu Huang, Marcin
  Grzegorzek","IL-MCAM: An interactive learning and multi-channel attention
  mechanism-based weakly supervised colorectal histopathology image
  classification approach",,"Computers in Biology and Medicine, Volume 143, April 2022, 105265",10.1016/j.compbiomed.2022.105265,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  In recent years, colorectal cancer has become one of the most significant
diseases that endanger human health. Deep learning methods are increasingly
important for the classification of colorectal histopathology images. However,
existing approaches focus more on end-to-end automatic classification using
computers rather than human-computer interaction. In this paper, we propose an
IL-MCAM framework. It is based on attention mechanisms and interactive
learning. The proposed IL-MCAM framework includes two stages: automatic
learning (AL) and interactivity learning (IL). In the AL stage, a multi-channel
attention mechanism model containing three different attention mechanism
channels and convolutional neural networks is used to extract multi-channel
features for classification. In the IL stage, the proposed IL-MCAM framework
continuously adds misclassified images to the training set in an interactive
approach, which improves the classification ability of the MCAM model. We
carried out a comparison experiment on our dataset and an extended experiment
on the HE-NCT-CRC-100K dataset to verify the performance of the proposed
IL-MCAM framework, achieving classification accuracies of 98.98% and 99.77%,
respectively. In addition, we conducted an ablation experiment and an
interchangeability experiment to verify the ability and interchangeability of
the three channels. The experimental results show that the proposed IL-MCAM
framework has excellent performance in the colorectal histopathological image
classification tasks.
","[{'version': 'v1', 'created': 'Tue, 7 Jun 2022 15:03:05 GMT'}]",2022-06-08,"[['Chen', 'Haoyuan', ''], ['Li', 'Chen', ''], ['Li', 'Xiaoyan', ''], ['Rahaman', 'Md Mamunur', ''], ['Hu', 'Weiming', ''], ['Li', 'Yixin', ''], ['Liu', 'Wanli', ''], ['Sun', 'Changhao', ''], ['Sun', 'Hongzan', ''], ['Huang', 'Xinyu', ''], ['Grzegorzek', 'Marcin', '']]","['Colorectal cancer histopathology image', 'Attention mechanism', 'Interactivity learning', 'Imageclassification']"
8069,2301.01356,Xiaojun Dong,"Xiaojun Dong, Letong Wang, Yan Gu, Yihan Sun",Provably Fast and Space-Efficient Parallel Biconnectivity,,,10.1145/3572848.3577483,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  Biconnectivity is one of the most fundamental graph problems. The canonical
parallel biconnectivity algorithm is the Tarjan-Vishkin algorithm, which has
$O(n+m)$ optimal work (number of operations) and polylogarithmic span (longest
dependent operations) on a graph with $n$ vertices and $m$ edges. However,
Tarjan-Vishkin is not widely used in practice. We believe the reason is the
space-inefficiency (it generates an auxiliary graph with $O(m)$ edges). In
practice, existing parallel implementations are based on breath-first search
(BFS). Since BFS has span proportional to the diameter of the graph, existing
parallel BCC implementations suffer from poor performance on large-diameter
graphs and can be even slower than the sequential algorithm on many real-world
graphs.
  We propose the first parallel biconnectivity algorithm (FAST-BCC) that has
optimal work, polylogarithmic span, and is space-efficient. Our algorithm first
generates a skeleton graph based on any spanning tree of the input graph. Then
we use the connectivity information of the skeleton to compute the
biconnectivity of the original input. All the steps in our algorithm are
highly-parallel. We carefully analyze the correctness of our algorithm, which
is highly non-trivial.
  We implemented FAST-BCC and compared it with existing implementations,
including GBBS, Slota and Madduri's algorithm, and the sequential
Hopcroft-Tarjan algorithm. We ran them on a 96-core machine on 27 graphs,
including social, web, road, $k$-NN, and synthetic graphs, with significantly
varying sizes and edge distributions. FAST-BCC is the fastest on all 27 graphs.
On average (geometric means), FAST-BCC is 5.1$\times$ faster than GBBS, and
3.1$\times$ faster than the best existing baseline on each graph.
","[{'version': 'v1', 'created': 'Tue, 3 Jan 2023 21:13:58 GMT'}]",2023-01-05,"[['Dong', 'Xiaojun', ''], ['Wang', 'Letong', ''], ['Gu', 'Yan', ''], ['Sun', 'Yihan', '']]","['Parallel Algorithms', 'Graph Algorithms', 'Biconnectivity']"
8070,2106.10673,Qi Yang,"Qi Yang, Aleksandr Farseev, Andrey Filchenkov","Two-Faced Humans on Twitter and Facebook: Harvesting Social Multimedia
  for Human Personality Profiling",,,10.1145/3463944.3469270,,cs.SI cs.LG cs.MM,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Human personality traits are the key drivers behind our decision-making,
influencing our life path on a daily basis. Inference of personality traits,
such as Myers-Briggs Personality Type, as well as an understanding of
dependencies between personality traits and users' behavior on various social
media platforms is of crucial importance to modern research and industry
applications. The emergence of diverse and cross-purpose social media avenues
makes it possible to perform user personality profiling automatically and
efficiently based on data represented across multiple data modalities. However,
the research efforts on personality profiling from multi-source multi-modal
social media data are relatively sparse, and the level of impact of different
social network data on machine learning performance has yet to be
comprehensively evaluated. Furthermore, there is not such dataset in the
research community to benchmark. This study is one of the first attempts
towards bridging such an important research gap. Specifically, in this work, we
infer the Myers-Briggs Personality Type indicators, by applying a novel
multi-view fusion framework, called ""PERS"" and comparing the performance
results not just across data modalities but also with respect to different
social network data sources. Our experimental results demonstrate the PERS's
ability to learn from multi-view data for personality profiling by efficiently
leveraging on the significantly different data arriving from diverse social
multimedia sources. We have also found that the selection of a machine learning
approach is of crucial importance when choosing social network data sources and
that people tend to reveal multiple facets of their personality in different
social media avenues. Our released social multimedia dataset facilitates future
research on this direction.
","[{'version': 'v1', 'created': 'Sun, 20 Jun 2021 10:48:49 GMT'}]",2021-06-22,"[['Yang', 'Qi', ''], ['Farseev', 'Aleksandr', ''], ['Filchenkov', 'Andrey', '']]","['User Profiling', 'Multimedia Retrieval', 'Machine Learning']"
8071,2008.07119,Namwoo Kang,"Seowoo Jang, Soyoung Yoo, Namwoo Kang","Generative Design by Reinforcement Learning: Enhancing the Diversity of
  Topology Optimization Designs",,"Computer-Aided Design, 146, 103225 (2022)",10.1016/j.cad.2022.103225,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generative design refers to computational design methods that can
automatically conduct design exploration under constraints defined by
designers. Among many approaches, topology optimization-based generative
designs aim to explore diverse topology designs, which cannot be represented by
conventional parametric design approaches. Recently, data-driven topology
optimization research has started to exploit artificial intelligence, such as
deep learning or machine learning, to improve the capability of design
exploration. This study proposes a reinforcement learning (RL) based generative
design process, with reward functions maximizing the diversity of topology
designs. We formulate generative design as a sequential problem of finding
optimal design parameter combinations in accordance with a given reference
design. Proximal Policy Optimization is used as the learning framework, which
is demonstrated in the case study of an automotive wheel design problem. To
reduce the heavy computational burden of the wheel topology optimization
process required by our RL formulation, we approximate the optimization process
with neural networks. With efficient data preprocessing/augmentation and neural
architecture, the neural networks achieve a generalized performance and
symmetricity-reserving characteristics. We show that RL-based generative design
produces a large number of diverse designs within a short inference time by
exploiting GPU in a fully automated manner. It is different from the previous
approach using CPU which takes much more processing time and involving human
intervention.
","[{'version': 'v1', 'created': 'Mon, 17 Aug 2020 06:50:47 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Feb 2021 07:04:49 GMT'}]",2022-10-04,"[['Jang', 'Seowoo', ''], ['Yoo', 'Soyoung', ''], ['Kang', 'Namwoo', '']]","['Generative Design', 'Topology Optimization', 'Deep Learning', 'Reinforcement Learning', 'Design Diversity']"
8072,2207.06041,Liang Li,"Junpu Zhang and Liang Li and Siwei Wang and Jiyuan Liu and Yue Liu and
  Xinwang Liu and En Zhu",Multiple Kernel Clustering with Dual Noise Minimization,,,10.1145/3503161.3548334,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering is a representative unsupervised method widely applied in
multi-modal and multi-view scenarios. Multiple kernel clustering (MKC) aims to
group data by integrating complementary information from base kernels. As a
representative, late fusion MKC first decomposes the kernels into orthogonal
partition matrices, then learns a consensus one from them, achieving promising
performance recently. However, these methods fail to consider the noise inside
the partition matrix, preventing further improvement of clustering performance.
We discover that the noise can be disassembled into separable dual parts, i.e.
N-noise and C-noise (Null space noise and Column space noise). In this paper,
we rigorously define dual noise and propose a novel parameter-free MKC
algorithm by minimizing them. To solve the resultant optimization problem, we
design an efficient two-step iterative strategy. To our best knowledge, it is
the first time to investigate dual noise within the partition in the kernel
space. We observe that dual noise will pollute the block diagonal structures
and incur the degeneration of clustering performance, and C-noise exhibits
stronger destruction than N-noise. Owing to our efficient mechanism to minimize
dual noise, the proposed algorithm surpasses the recent methods by large
margins.
","[{'version': 'v1', 'created': 'Wed, 13 Jul 2022 08:37:42 GMT'}]",2022-07-14,"[['Zhang', 'Junpu', ''], ['Li', 'Liang', ''], ['Wang', 'Siwei', ''], ['Liu', 'Jiyuan', ''], ['Liu', 'Yue', ''], ['Liu', 'Xinwang', ''], ['Zhu', 'En', '']]","['Multi-view clustering', 'multiple kernel clustering', 'noise minimization']"
8073,2211.15068,Ayush Raina,"Ayush Raina, Jonathan Cagan, Christopher McComb","Learning to design without prior data: Discovering generalizable design
  strategies using deep learning and tree search",ASME. J. Mech. Des,,10.1115/1.4056221,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Building an AI agent that can design on its own has been a goal since the
1980s. Recently, deep learning has shown the ability to learn from large-scale
data, enabling significant advances in data-driven design. However, learning
over prior data limits us only to solve problems that have been solved before
and biases data-driven learning towards existing solutions. The ultimate goal
for a design agent is the ability to learn generalizable design behavior in a
problem space without having seen it before. We introduce a self-learning agent
framework in this work that achieves this goal. This framework integrates a
deep policy network with a novel tree search algorithm, where the tree search
explores the problem space, and the deep policy network leverages
self-generated experience to guide the search further. This framework first
demonstrates an ability to discover high-performing generative strategies
without any prior data, and second, it illustrates a zero-shot generalization
of generative strategies across various unseen boundary conditions. This work
evaluates the effectiveness and versatility of the framework by solving
multiple versions of two engineering design problems without retraining.
Overall, this paper presents a methodology to self-learn high-performing and
generalizable problem-solving behavior in an arbitrary problem space,
circumventing the needs for expert data, existing solutions, and
problem-specific learning.
","[{'version': 'v1', 'created': 'Mon, 28 Nov 2022 05:00:58 GMT'}]",2022-11-29,"[['Raina', 'Ayush', ''], ['Cagan', 'Jonathan', ''], ['McComb', 'Christopher', '']]","['Design automation', 'Artificial Intelligence', 'Deep Learning', 'Generalizability']"
8074,1907.03747,Francois Hamon,"Ammar Alali, Francois Hamon, Bradley Mallison, and Hamdi Tchelepi","Finite-Volume Simulation of Capillary-Dominated Flow in Matrix-Fracture
  Systems using Interface Conditions",,,10.1007/s10596-020-09982-1,,cs.CE physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In numerical simulations of multiphase flow and transport in fractured porous
media, the estimation of the hydrocarbon recovery requires accurately
predicting the capillary-driven imbibition rate of the wetting phase initially
present in the fracture into the low-permeability matrix. In the fully implicit
finite-volume scheme, this entails a robust methodology that captures the
capillary flux at the interface between the matrix and the fracture even when
very coarse control volumes are used to discretize the matrix. Here, we
investigate the application of discrete interface conditions at the
matrix-fracture interface to improve the accuracy of the flux computation
without relying on extreme grid refinement. In particular, we study the
interaction of the upwinding scheme with the discrete interface conditions.
Considering first capillary-dominated spontaneous imbibition and then forced
imbibition with viscous, buoyancy, and capillary forces, we illustrate the
importance of the interface conditions to accurately capture the
matrix-fracture flux and correctly represent the flow dynamics in the problem.
","[{'version': 'v1', 'created': 'Fri, 5 Jul 2019 20:35:31 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Apr 2020 18:00:41 GMT'}, {'version': 'v3', 'created': 'Thu, 28 May 2020 21:40:42 GMT'}]",2020-07-21,"[['Alali', 'Ammar', ''], ['Hamon', 'Francois', ''], ['Mallison', 'Bradley', ''], ['Tchelepi', 'Hamdi', '']]","['Fractured porous media', 'Two-phase flow and transport', 'Capillarity-dominated flow', 'Implicit finite-volume schemes', 'Interface conditions']"
8075,2112.02159,Andreas Bueckle,"Andreas Bueckle, Kilian Buehling, Patrick C. Shih, Katy Borner","Optimizing Performance and Satisfaction in Matching and Movement Tasks
  in Virtual Reality with Interventions Using the Data Visualization Literacy
  Framework",,,10.3389/frvir.2021.727344,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Virtual reality (VR) has seen increased use for training and instruction.
Designers can enable VR users to gain insights into their own performance by
visualizing telemetry data from their actions in VR. Our ability to detect
patterns and trends visually suggests the use of data visualization as a tool
for users to identify strategies for improved performance. Typical tasks in VR
training scenarios are manipulation of 3D objects (e.g., for learning how to
maintain a jet engine) and navigation (e.g., to learn the geography of a
building or landscape before traveling on-site). In this paper, we present the
results of the RUI VR (84 subjects) and Luddy VR studies (68 subjects), where
participants were divided into experiment and control cohorts. All subjects
performed a series of tasks: 44 cube-matching tasks in RUI VR and 48 navigation
tasks through a virtual building in Luddy VR (all divided into two sets). All
Luddy VR subjects used VR gear; RUI VR subjects were divided across three
setups: 2D Desktop (with laptop and mouse), VR Tabletop (in VR, sitting at a
table), and VR Standup (in VR, standing). In an intervention called ""Reflective
phase,"" the experiment cohorts were presented with data visualizations,
designed with the Data Visualization Literacy Framework (DVL-FW), of the data
they generated during the first set of tasks before continuing to the second
part of the study. For Luddy VR, we found that experiment users had
significantly faster completion times in their second trial (p = 0.014) while
scoring higher in a mid-questionnaire about the virtual building (p = 0.009).
For RUI VR, we found no significant differences for completion time and
accuracy between the two cohorts in the VR setups; however, 2D Desktop subjects
in the experiment cohort had significantly higher rotation accuracy as well as
satisfaction (p(rotation) = 0.031, p(satisfaction) = 0.040).
","[{'version': 'v1', 'created': 'Fri, 3 Dec 2021 21:06:07 GMT'}]",2021-12-16,"[['Bueckle', 'Andreas', ''], ['Buehling', 'Kilian', ''], ['Shih', 'Patrick C.', ''], ['Borner', 'Katy', '']]","['virtual reality', 'data visualization', 'user study', 'human-computer interaction', 'performance improvement', 'interaction technique', 'navigation']"
8076,2202.08523,Chao Huang,"Wei Wei and Chao Huang and Lianghao Xia and Yong Xu and Jiashu Zhao
  and Dawei Yin",Contrastive Meta Learning with Behavior Multiplicity for Recommendation,"Published as a full paper at WSDM 2022 and Awarded as Best Paper
  Candidate",,10.1145/3488560.3498527,,cs.IR cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A well-informed recommendation framework could not only help users identify
their interested items, but also benefit the revenue of various online
platforms (e.g., e-commerce, social media). Traditional recommendation models
usually assume that only a single type of interaction exists between user and
item, and fail to model the multiplex user-item relationships from multi-typed
user behavior data, such as page view, add-to-favourite and purchase. While
some recent studies propose to capture the dependencies across different types
of behaviors, two important challenges have been less explored: i) Dealing with
the sparse supervision signal under target behaviors (e.g., purchase). ii)
Capturing the personalized multi-behavior patterns with customized dependency
modeling. To tackle the above challenges, we devise a new model CML,
Contrastive Meta Learning (CML), to maintain dedicated cross-type behavior
dependency for different users. In particular, we propose a multi-behavior
contrastive learning framework to distill transferable knowledge across
different types of behaviors via the constructed contrastive loss. In addition,
to capture the diverse multi-behavior patterns, we design a contrastive meta
network to encode the customized behavior heterogeneity for different users.
Extensive experiments on three real-world datasets indicate that our method
consistently outperforms various state-of-the-art recommendation methods. Our
empirical studies further suggest that the contrastive meta learning paradigm
offers great potential for capturing the behavior multiplicity in
recommendation. We release our model implementation at:
https://github.com/weiwei1206/CML.git.
","[{'version': 'v1', 'created': 'Thu, 17 Feb 2022 08:51:24 GMT'}]",2022-03-29,"[['Wei', 'Wei', ''], ['Huang', 'Chao', ''], ['Xia', 'Lianghao', ''], ['Xu', 'Yong', ''], ['Zhao', 'Jiashu', ''], ['Yin', 'Dawei', '']]","['Collaborative filtering', 'Self-Supervised Learning', 'Multi-BehaviorRecommendation', 'Meta Learning', 'Graph Neural Network']"
8077,1909.05293,Wishnu Prasetya,"I. S. W. B. Prasetya, Rick Klomp",Test Model Coverage Analysis under Uncertainty,,"Proceedings of the 17th International Conference on Software
  Engineering and Formal Methods (SEFM) 2019",10.1007/978-3-030-30446-1_12,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  In model-based testing (MBT) we may have to deal with a non-deterministic
model, e.g. because abstraction was applied, or because the software under test
itself is non-deterministic. The same test case may then trigger multiple
possible execution paths, depending on some internal decisions made by the
software. Consequently, performing precise test analyses, e.g. to calculate the
test coverage, are not possible. This can be mitigated if developers can
annotate the model with estimated probabilities for taking each transition. A
probabilistic model checking algorithm can subsequently be used to do simple
probabilistic coverage analysis. However, in practice developers often want to
know what the achieved aggregate coverage, which unfortunately cannot be
re-expressed as a standard model checking problem. This paper presents an
extension to allow efficient calculation of probabilistic aggregate coverage,
and moreover also in combination with k-wise coverage.
","[{'version': 'v1', 'created': 'Wed, 11 Sep 2019 18:35:26 GMT'}]",2019-09-13,"[['Prasetya', 'I. S. W. B.', ''], ['Klomp', 'Rick', '']]","['probabilistic model based testing', 'probabilistic test coverage', 'testing non-deterministic systems']"
8078,2004.09980,David Graus,"Feng Lu, Anca Dumitrache, David Graus","Beyond Optimizing for Clicks: Incorporating Editorial Values in News
  Recommendation",To appear in UMAP 2020,,10.1145/3340631.3394864,,cs.IR cs.CL cs.HC cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the uptake of algorithmic personalization in the news domain, news
organizations increasingly trust automated systems with previously considered
editorial responsibilities, e.g., prioritizing news to readers. In this paper
we study an automated news recommender system in the context of a news
organization's editorial values. We conduct and present two online studies with
a news recommender system, which span one and a half months and involve over
1,200 users. In our first study we explore how our news recommender steers
reading behavior in the context of editorial values such as serendipity,
dynamism, diversity, and coverage. Next, we present an intervention study where
we extend our news recommender to steer our readers to more dynamic reading
behavior. We find that (i) our recommender system yields more diverse reading
behavior and yields a higher coverage of articles compared to non-personalized
editorial rankings, and (ii) we can successfully incorporate dynamism in our
recommender system as a re-ranking method, effectively steering our readers to
more dynamic articles without hurting our recommender system's accuracy.
","[{'version': 'v1', 'created': 'Tue, 21 Apr 2020 13:24:49 GMT'}]",2020-04-22,"[['Lu', 'Feng', ''], ['Dumitrache', 'Anca', ''], ['Graus', 'David', '']]","['news recommendation', 'editorial values', 'usefulness']"
8079,1911.08603,Thilo Hagendorff,Thilo Hagendorff,"Forbidden knowledge in machine learning -- Reflections on the limits of
  research and publication",,,10.1007/s00146-020-01045-4,,cs.LG cs.AI cs.CY stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Certain research strands can yield ""forbidden knowledge"". This term refers to
knowledge that is considered too sensitive, dangerous or taboo to be produced
or shared. Discourses about such publication restrictions are already
entrenched in scientific fields like IT security, synthetic biology or nuclear
physics research. This paper makes the case for transferring this discourse to
machine learning research. Some machine learning applications can very easily
be misused and unfold harmful consequences, for instance with regard to
generative video or text synthesis, personality analysis, behavior
manipulation, software vulnerability detection and the like. Up to now, the
machine learning research community embraces the idea of open access. However,
this is opposed to precautionary efforts to prevent the malicious use of
machine learning applications. Information about or from such applications may,
if improperly disclosed, cause harm to people, organizations or whole
societies. Hence, the goal of this work is to outline norms that can help to
decide whether and when the dissemination of such information should be
prevented. It proposes review parameters for the machine learning community to
establish an ethical framework on how to deal with forbidden knowledge and
dual-use applications.
","[{'version': 'v1', 'created': 'Tue, 19 Nov 2019 21:43:06 GMT'}]",2020-09-08,"[['Hagendorff', 'Thilo', '']]","['forbidden knowledge', 'machine learning', 'artificial intelligence', 'governance', 'dual-use', 'publication norms']"
8080,1910.00323,Christof Paar,"Carina Wiesen and Nils Albartus and Max Hoffmann and Steffen Becker
  and Sebastian Wallat and Marc Fyrbiak and Nikol Rummel and Christof Paar","Towards Cognitive Obfuscation: Impeding Hardware Reverse Engineering
  Based on Psychological Insights",,"ASPDAC 2019 Proceedings of the 24th Asia and South Pacific Design
  Automation Conference Pages 104-111",10.1145/3287624.3288741,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In contrast to software reverse engineering, there are hardly any tools
available that support hardware reversing. Therefore, the reversing process is
conducted by human analysts combining several complex semi-automated steps.
However, countermeasures against reversing are evaluated solely against
mathematical models. Our research goal is the establishment of cognitive
obfuscation based on the exploration of underlying psychological processes. We
aim to identify problems which are hard to solve for human analysts and derive
novel quantification metrics, thus enabling stronger obfuscation techniques.
","[{'version': 'v1', 'created': 'Tue, 1 Oct 2019 11:54:35 GMT'}]",2019-10-02,"[['Wiesen', 'Carina', ''], ['Albartus', 'Nils', ''], ['Hoffmann', 'Max', ''], ['Becker', 'Steffen', ''], ['Wallat', 'Sebastian', ''], ['Fyrbiak', 'Marc', ''], ['Rummel', 'Nikol', ''], ['Paar', 'Christof', '']]","['cognitive obfuscation', 'netlist-level reverse engineering', 'hardware obfuscation']"
8081,2012.15744,Siddhant Kumar,"Li Zheng, Siddhant Kumar, Dennis M. Kochmann","Data-driven topology optimization of spinodoid metamaterials with
  seamlessly tunable anisotropy","26 pages, 16 figures","Computer Methods in Applied Mechanics and Engineering, 383,
  113894, 2021",10.1016/j.cma.2021.113894,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a two-scale topology optimization framework for the design of
macroscopic bodies with an optimized elastic response, which is achieved by
means of a spatially-variant cellular architecture on the microscale. The
chosen spinodoid topology for the cellular network on the microscale (which is
inspired by natural microstructures forming during spinodal decomposition)
admits a seamless spatial grading as well as tunable elastic anisotropy, and it
is parametrized by a small set of design parameters associated with the
underlying Gaussian random field. The macroscale boundary value problem is
discretized by finite elements, which in addition to the displacement field
continuously interpolate the microscale design parameters. By assuming a
separation of scales, the local constitutive behavior on the macroscale is
identified as the homogenized elastic response of the microstructure based on
the local design parameters. As a departure from classical FE$^2$-type
approaches, we replace the costly microscale homogenization by a data-driven
surrogate model, using deep neural networks, which accurately and efficiently
maps design parameters onto the effective elasticity tensor. The model is
trained on homogenized stiffness data obtained from numerical homogenization by
finite elements. As an added benefit, the machine learning setup admits
automatic differentiation, so that sensitivities (required for the optimization
problem) can be computed exactly and without the need for numerical derivatives
- a strategy that holds promise far beyond the elastic stiffness. Therefore,
this framework presents a new opportunity for multiscale topology optimization
based on data-driven surrogate models.
","[{'version': 'v1', 'created': 'Thu, 31 Dec 2020 17:30:25 GMT'}, {'version': 'v2', 'created': 'Wed, 19 May 2021 20:48:06 GMT'}]",2021-05-21,"[['Zheng', 'Li', ''], ['Kumar', 'Siddhant', ''], ['Kochmann', 'Dennis M.', '']]","['Topology Optimization', 'Elasticity', 'Multiscale', 'Finite Element Method', 'Machine Learning']"
8082,2005.10486,Mahawaga Arachchige Pathum Chamikara,"M.A.P. Chamikara, P. Bertok, I. Khalil, D. Liu, S. Camtepe",Privacy Preserving Face Recognition Utilizing Differential Privacy,,,10.1016/j.cose.2020.101951,,cs.CR cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Facial recognition technologies are implemented in many areas, including but
not limited to, citizen surveillance, crime control, activity monitoring, and
facial expression evaluation. However, processing biometric information is a
resource-intensive task that often involves third-party servers, which can be
accessed by adversaries with malicious intent. Biometric information delivered
to untrusted third-party servers in an uncontrolled manner can be considered a
significant privacy leak (i.e. uncontrolled information release) as biometrics
can be correlated with sensitive data such as healthcare or financial records.
In this paper, we propose a privacy-preserving technique for ""controlled
information release"", where we disguise an original face image and prevent
leakage of the biometric features while identifying a person. We introduce a
new privacy-preserving face recognition protocol named PEEP (Privacy using
EigEnface Perturbation) that utilizes local differential privacy. PEEP applies
perturbation to Eigenfaces utilizing differential privacy and stores only the
perturbed data in the third-party servers to run a standard Eigenface
recognition algorithm. As a result, the trained model will not be vulnerable to
privacy attacks such as membership inference and model memorization attacks.
Our experiments show that PEEP exhibits a classification accuracy of around 70%
- 90% under standard privacy settings.
","[{'version': 'v1', 'created': 'Thu, 21 May 2020 06:59:33 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Jul 2020 14:04:25 GMT'}]",2020-07-07,"[['Chamikara', 'M. A. P.', ''], ['Bertok', 'P.', ''], ['Khalil', 'I.', ''], ['Liu', 'D.', ''], ['Camtepe', 'S.', '']]","['Privacy preserving face recognition', 'differential privacy', 'face recognition', 'privacy in']"
8083,2003.07054,Takayuki Osa,Takayuki Osa,Multimodal Trajectory Optimization for Motion Planning,"17 pages, International Journal of Robotics Research",,10.1177/0278364920918296,,cs.RO,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Existing motion planning methods often have two drawbacks: 1) goal
configurations need to be specified by a user, and 2) only a single solution is
generated under a given condition. In practice, multiple possible goal
configurations exist to achieve a task. Although the choice of the goal
configuration significantly affects the quality of the resulting trajectory, it
is not trivial for a user to specify the optimal goal configuration. In
addition, the objective function used in the trajectory optimization is often
non-convex, and it can have multiple solutions that achieve comparable costs.
In this study, we propose a framework that determines multiple trajectories
that correspond to the different modes of the cost function. We reduce the
problem of identifying the modes of the cost function to that of estimating the
density induced by a distribution based on the cost function. The proposed
framework enables users to select a preferable solution from multiple candidate
trajectories, thereby making it easier to tune the cost function and obtain a
satisfactory solution. We evaluated our proposed method with motion planning
tasks in 2D and 3D space. Our experiments show that the proposed algorithm is
capable of determining multiple solutions for those tasks.
","[{'version': 'v1', 'created': 'Mon, 16 Mar 2020 07:29:03 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Sep 2020 07:05:31 GMT'}]",2020-09-24,"[['Osa', 'Takayuki', '']]","['Motion planning', 'Density estimation', 'Multimodal optimization']"
8084,2206.00378,Valerio Luconi,"Enrico Gregori, Alessandro Improta, Luciano Lenzini, Valerio Luconi,
  Nilo Redini, Alessio Vecchio","Smartphone-based crowdsourcing for estimating the bottleneck capacity in
  wireless networks",,Journal of Network and Computer Applications 64 (2016) 62-75,10.1016/j.jnca.2016.01.020,,cs.NI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Crowdsourcing enables the fine-grained characterization and performance
evaluation of today's large-scale networks using the power of the masses and
distributed intelligence. This paper presents SmartProbe, a system that
assesses the bottleneck capacity of Internet paths using smartphones, from a
mobile crowdsourcing perspective. With SmartProbe measurement activities are
more bandwidth efficient compared to similar systems, and a larger number of
users can be supported. An application based on SmartProbe is also presented:
georeferenced measurements are mapped and used to compare the performance of
mobile broadband operators in wide areas. Results from one year of operation
are included.
","[{'version': 'v1', 'created': 'Wed, 1 Jun 2022 10:26:23 GMT'}]",2022-06-02,"[['Gregori', 'Enrico', ''], ['Improta', 'Alessandro', ''], ['Lenzini', 'Luciano', ''], ['Luconi', 'Valerio', ''], ['Redini', 'Nilo', ''], ['Vecchio', 'Alessio', '']]","['Crowdsourcing', 'smartphones', 'bottleneck capacity', 'network tools']"
8085,2206.14992,Brian Hempel,Brian Hempel and Ravi Chugh,Maniposynth: Bimodal Tangible Functional Programming,"ECOOP 2022 Paper + Appendices. 34 pages, 15 figures. For video figure
  and artifact, see https://maniposynth.org/",,10.4230/LIPIcs.ECOOP.2022.16,,cs.PL cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Traditionally, writing code is a non-graphical, abstract, and linear process.
Not everyone is comfortable with this way of thinking at all times. Can
programming be transformed into a graphical, concrete, non-linear activity?
While nodes-and-wires and blocks-based programming environments do leverage
graphical direct manipulation, users perform their manipulations on abstract
syntax tree elements, which are still abstract. Is it possible to be more
concrete - could users instead directly manipulate live program values to
create their program?
  We present a system, Maniposynth, that reimagines functional programming as a
non-linear workflow where program expressions are spread on a 2D canvas. The
live results of those expressions are continuously displayed and available for
direct manipulation. The non-linear canvas liberates users to work
out-of-order, and the live values can be interacted with via drag-and-drop.
Incomplete programs are gracefully handled via hole expressions, which allow
Maniposynth to offer program synthesis. Throughout the workflow, the program is
valid OCaml code which the user may inspect and edit in their preferred text
editor at any time.
  With Maniposynth's direct manipulation features, we created 38 programs drawn
from a functional data structures course. We additionally hired two
professional OCaml developers to implement a subset of these programs. We
report on these experiences and discuss to what degree Maniposynth meets its
goals of providing a non-linear, concrete, graphical programming workflow.
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2022 02:52:46 GMT'}]",2022-07-01,"[['Hempel', 'Brian', ''], ['Chugh', 'Ravi', '']]","['direct manipulation', 'tangible programming', 'programming user interfaces']"
8086,2212.07329,Christian Bartolo Burl\`o,"Christian Bartolo Burl\`o, Adrian Francalanza, Alceste Scalas, Catia
  Trubiani, Emilio Tuosto",PSTMonitor: Monitor Synthesis from Probabilistic Session Types,"SI: Special Issue on Selected Tool Papers of the 22nd and 23rd
  International Conference on Coordination Models and Languages, COORDINATION
  2020 and 2021",,10.1016/j.scico.2022.102847,,cs.PL,http://creativecommons.org/licenses/by/4.0/,"  We present PSTMonitor, a tool for the run-time verification of quantitative
specifications of message-passing applications, based on probabilistic session
types. The key element of PSTMonitor is the detection of executions that
deviate from expected probabilistic behaviour. Besides presenting PSTMonitor
and its operation, the paper analyses its feasibility in terms of the runtime
overheads it induces.
","[{'version': 'v1', 'created': 'Wed, 14 Dec 2022 16:49:28 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Dec 2022 07:46:21 GMT'}]",2022-12-16,"[['Burlò', 'Christian Bartolo', ''], ['Francalanza', 'Adrian', ''], ['Scalas', 'Alceste', ''], ['Trubiani', 'Catia', ''], ['Tuosto', 'Emilio', '']]","['Runtime Verification', 'Probabilistic Session Types', 'MonitorSynthesis']"
8087,2208.03479,Alan Smeaton,Sean Cummins and Lorin Sweeney and Alan F. Smeaton,"Analysing the Memorability of a Procedural Crime-Drama TV Series, CSI","7 pages, accepted to CBMI 2022",,10.1145/3549555.3549592,,cs.CV cs.AI cs.MM,http://creativecommons.org/licenses/by/4.0/,"  We investigate the memorability of a 5-season span of a popular crime-drama
TV series, CSI, through the application of a vision transformer fine-tuned on
the task of predicting video memorability. By investigating the popular genre
of crime-drama TV through the use of a detailed annotated corpus combined with
video memorability scores, we show how to extrapolate meaning from the
memorability scores generated on video shots. We perform a quantitative
analysis to relate video shot memorability to a variety of aspects of the show.
The insights we present in this paper illustrate the importance of video
memorability in applications which use multimedia in areas like education,
marketing, indexing, as well as in the case here namely TV and film production.
","[{'version': 'v1', 'created': 'Sat, 6 Aug 2022 09:29:46 GMT'}]",2022-12-13,"[['Cummins', 'Sean', ''], ['Sweeney', 'Lorin', ''], ['Smeaton', 'Alan F.', '']]","['Video memorability', 'vision transformers', 'CSI TV series']"
8088,2107.01912,Prajwol Kumar Nakarmi,Srinath Potnuru and Prajwol Kumar Nakarmi,"Berserker: ASN.1-based Fuzzing of Radio Resource Control Protocol for 4G
  and 5G","19 pages, 9 figures, 17 tables",,10.1109/WiMob52687.2021.9606317,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Telecom networks together with mobile phones must be rigorously tested for
robustness against vulnerabilities in order to guarantee availability. RRC
protocol is responsible for the management of radio resources and is among the
most important telecom protocols whose extensive testing is warranted. To that
end, we present a novel RRC fuzzer, called Berserker, for 4G and 5G.
Berserker's novelty comes from being backward and forward compatible to any
version of 4G and 5G RRC technical specifications. It is based on RRC message
format definitions in ASN.1 and additionally covers fuzz testing of another
protocol, called NAS, tunneled in RRC. Berserker uses concrete implementations
of telecom protocol stack and is unaffected by lower layer protocol handlings
like encryption and segmentation. It is also capable of evading size and type
constraints in RRC message format definitions. Berserker discovered two
previously unknown serious vulnerabilities in srsLTE -- one of which also
affects openLTE -- confirming its applicability to telecom robustness.
","[{'version': 'v1', 'created': 'Mon, 5 Jul 2021 10:06:25 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Dec 2021 15:19:43 GMT'}]",2021-12-03,"[['Potnuru', 'Srinath', ''], ['Nakarmi', 'Prajwol Kumar', '']]","['Fuzzing', 'security', 'RRC', 'NAS', 'ASN']"
8089,2003.01888,Saeed Ghorbani,"Saeed Ghorbani, Kimia Mahdaviani, Anne Thaler, Konrad Kording, Douglas
  James Cook, Gunnar Blohm, Nikolaus F. Troje",MoVi: A Large Multipurpose Motion and Video Dataset,,,10.1371/journal.pone.0253157,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human movements are both an area of intense study and the basis of many
applications such as character animation. For many applications, it is crucial
to identify movements from videos or analyze datasets of movements. Here we
introduce a new human Motion and Video dataset MoVi, which we make available
publicly. It contains 60 female and 30 male actors performing a collection of
20 predefined everyday actions and sports movements, and one self-chosen
movement. In five capture rounds, the same actors and movements were recorded
using different hardware systems, including an optical motion capture system,
video cameras, and inertial measurement units (IMU). For some of the capture
rounds, the actors were recorded when wearing natural clothing, for the other
rounds they wore minimal clothing. In total, our dataset contains 9 hours of
motion capture data, 17 hours of video data from 4 different points of view
(including one hand-held camera), and 6.6 hours of IMU data. In this paper, we
describe how the dataset was collected and post-processed; We present
state-of-the-art estimates of skeletal motions and full-body shape deformations
associated with skeletal motion. We discuss examples for potential studies this
dataset could enable.
","[{'version': 'v1', 'created': 'Wed, 4 Mar 2020 04:43:03 GMT'}]",2021-07-14,"[['Ghorbani', 'Saeed', ''], ['Mahdaviani', 'Kimia', ''], ['Thaler', 'Anne', ''], ['Kording', 'Konrad', ''], ['Cook', 'Douglas James', ''], ['Blohm', 'Gunnar', ''], ['Troje', 'Nikolaus F.', '']]","['Human motion dataset', 'optical motion capture', 'IMU', 'video capture']"
8090,2101.09783,Shaowei Zhu,"Shaowei Zhu, Zachary Kincaid",Termination Analysis Without the Tears,,,10.1145/3410313,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Determining whether a given program terminates is the quintessential
undecidable problem. Algorithms for termination analysis are divided into two
groups: (1) algorithms with strong behavioral guarantees that work in limited
circumstances (e.g., complete synthesis of linear ranking functions for
polyhedral loops [Podelski and Rybalchenko, 2004]), and (2) algorithms that are
widely applicable, but have weak behavioral guarantees (e.g., Terminator [Cook
et al., 2006]). This paper investigates the space in between: how can we design
practical termination analyzers with useful behavioral guarantees?
  This paper presents a termination analysis that is both compositional (the
result of analyzing a composite program is a function of the analysis results
of its components) and monotone (""more information into the analysis yields
more information out""). The paper has two key contributions. The first is an
extension of Tarjan's method for solving path problems in graphs to solve
infinite path problems. This provides a foundation upon which to build
compositional termination analyses. The second is a collection of monotone
conditional termination analyses based on this framework. We demonstrate that
our tool ComPACT (Compositional and Predictable Analysis for Conditional
Termination) is competitive with state-of-the-art termination tools while
providing stronger behavioral guarantees.
","[{'version': 'v1', 'created': 'Sun, 24 Jan 2021 19:53:16 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Sep 2021 07:38:08 GMT'}]",2021-09-16,"[['Zhu', 'Shaowei', ''], ['Kincaid', 'Zachary', '']]","['Algebraic program analysis', 'termination analysis', 'loop summarization', 'algebraic path problems']"
8091,2109.05261,Shengyu Zhang,"Shengyu Zhang, Dong Yao, Zhou Zhao, Tat-seng Chua, Fei Wu","CauseRec: Counterfactual User Sequence Synthesis for Sequential
  Recommendation","Proceedings of the 44th International ACM SIGIR Conference on
  Research and Development in Information Retrieval (SIGIR 2021)",,10.1145/3404835.3462908,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning user representations based on historical behaviors lies at the core
of modern recommender systems. Recent advances in sequential recommenders have
convincingly demonstrated high capability in extracting effective user
representations from the given behavior sequences. Despite significant
progress, we argue that solely modeling the observational behaviors sequences
may end up with a brittle and unstable system due to the noisy and sparse
nature of user interactions logged. In this paper, we propose to learn accurate
and robust user representations, which are required to be less sensitive to
(attack on) noisy behaviors and trust more on the indispensable ones, by
modeling counterfactual data distribution. Specifically, given an observed
behavior sequence, the proposed CauseRec framework identifies dispensable and
indispensable concepts at both the fine-grained item level and the abstract
interest level. CauseRec conditionally samples user concept sequences from the
counterfactual data distributions by replacing dispensable and indispensable
concepts within the original concept sequence. With user representations
obtained from the synthesized user sequences, CauseRec performs contrastive
user representation learning by contrasting the counterfactual with the
observational. We conduct extensive experiments on real-world public
recommendation benchmarks and justify the effectiveness of CauseRec with
multi-aspects model analysis. The results demonstrate that the proposed
CauseRec outperforms state-of-the-art sequential recommenders by learning
accurate and robust user representations.
","[{'version': 'v1', 'created': 'Sat, 11 Sep 2021 11:41:07 GMT'}]",2021-09-14,"[['Zhang', 'Shengyu', ''], ['Yao', 'Dong', ''], ['Zhao', 'Zhou', ''], ['Chua', 'Tat-seng', ''], ['Wu', 'Fei', '']]","['Sequential Recommendation', 'User Modeling', 'Contrastive Learning', 'Counterfactual Representation']"
8092,2005.04753,Anup Das,"Shihao Song, Anup Das, Onur Mutlu, Nagarajan Kandasamy",Improving Phase Change Memory Performance with Data Content Aware Access,"18 pages, 21 figures, accepted at ACM SIGPLAN International Symposium
  on Memory Management (ISMM)",,10.1145/3381898.3397210,,cs.AR cs.OS,http://creativecommons.org/licenses/by/4.0/,"  A prominent characteristic of write operation in Phase-Change Memory (PCM) is
that its latency and energy are sensitive to the data to be written as well as
the content that is overwritten. We observe that overwriting unknown memory
content can incur significantly higher latency and energy compared to
overwriting known all-zeros or all-ones content. This is because all-zeros or
all-ones content is overwritten by programming the PCM cells only in one
direction, i.e., using either SET or RESET operations, not both. In this paper,
we propose data content aware PCM writes (DATACON), a new mechanism that
reduces the latency and energy of PCM writes by redirecting these requests to
overwrite memory locations containing all-zeros or all-ones. DATACON operates
in three steps. First, it estimates how much a PCM write access would benefit
from overwriting known content (e.g., all-zeros, or all-ones) by
comprehensively considering the number of set bits in the data to be written,
and the energy-latency trade-offs for SET and RESET operations in PCM. Second,
it translates the write address to a physical address within memory that
contains the best type of content to overwrite, and records this translation in
a table for future accesses. We exploit data access locality in workloads to
minimize the address translation overhead. Third, it re-initializes unused
memory locations with known all-zeros or all-ones content in a manner that does
not interfere with regular read and write accesses. DATACON overwrites unknown
content only when it is absolutely necessary to do so. We evaluate DATACON with
workloads from state-of-the-art machine learning applications, SPEC CPU2017,
and NAS Parallel Benchmarks. Results demonstrate that DATACON significantly
improves system performance and memory system energy consumption compared to
the best of performance-oriented state-of-the-art techniques.
","[{'version': 'v1', 'created': 'Sun, 10 May 2020 19:07:08 GMT'}]",2020-05-12,"[['Song', 'Shihao', ''], ['Das', 'Anup', ''], ['Mutlu', 'Onur', ''], ['Kandasamy', 'Nagarajan', '']]","['phase change memory (PCM)', 'performance', 'energy', 'hybrid memory', 'DRAM', 'non-volatile memory (NVM)']"
8093,2009.00945,Christos Koutlis,"Christos Koutlis, Symeon Papadopoulos, Manos Schinas, Ioannis
  Kompatsiaris","LAVARNET: Neural Network Modeling of Causal Variable Relationships for
  Multivariate Time Series Forecasting",,,10.1016/j.asoc.2020.106685,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multivariate time series forecasting is of great importance to many
scientific disciplines and industrial sectors. The evolution of a multivariate
time series depends on the dynamics of its variables and the connectivity
network of causal interrelationships among them. Most of the existing time
series models do not account for the causal effects among the system's
variables and even if they do they rely just on determining the
between-variables causality network. Knowing the structure of such a complex
network and even more specifically knowing the exact lagged variables that
contribute to the underlying process is crucial for the task of multivariate
time series forecasting. The latter is a rather unexplored source of
information to leverage. In this direction, here a novel neural network-based
architecture is proposed, termed LAgged VAriable Representation NETwork
(LAVARNET), which intrinsically estimates the importance of lagged variables
and combines high dimensional latent representations of them to predict future
values of time series. Our model is compared with other baseline and state of
the art neural network architectures on one simulated data set and four real
data sets from meteorology, music, solar activity, and finance areas. The
proposed architecture outperforms the competitive architectures in most of the
experiments.
","[{'version': 'v1', 'created': 'Wed, 2 Sep 2020 10:57:28 GMT'}]",2020-09-03,"[['Koutlis', 'Christos', ''], ['Papadopoulos', 'Symeon', ''], ['Schinas', 'Manos', ''], ['Kompatsiaris', 'Ioannis', '']]","['multivariate time series forecasting', 'machine learning', 'neural']"
8094,2206.02457,Wei Wang,"Wei Wang, Liangzhu Ge, Jingqiao Zhang, Cheng Yang","Improving Contrastive Learning of Sentence Embeddings with
  Case-Augmented Positives and Retrieved Negatives","7 pages, 3 figures, 6 tables. Accepted to SIGIR 22. Code at
  https://github.com/alibaba/SimCSE-with-CARDS",,10.1145/3477495.3531823,,cs.CL cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Following SimCSE, contrastive learning based methods have achieved the
state-of-the-art (SOTA) performance in learning sentence embeddings. However,
the unsupervised contrastive learning methods still lag far behind the
supervised counterparts. We attribute this to the quality of positive and
negative samples, and aim to improve both. Specifically, for positive samples,
we propose switch-case augmentation to flip the case of the first letter of
randomly selected words in a sentence. This is to counteract the intrinsic bias
of pre-trained token embeddings to frequency, word cases and subwords. For
negative samples, we sample hard negatives from the whole dataset based on a
pre-trained language model. Combining the above two methods with SimCSE, our
proposed Contrastive learning with Augmented and Retrieved Data for Sentence
embedding (CARDS) method significantly surpasses the current SOTA on STS
benchmarks in the unsupervised setting.
","[{'version': 'v1', 'created': 'Mon, 6 Jun 2022 09:46:12 GMT'}]",2022-06-07,"[['Wang', 'Wei', ''], ['Ge', 'Liangzhu', ''], ['Zhang', 'Jingqiao', ''], ['Yang', 'Cheng', '']]","['Text retrieval', 'data augmentation', 'natural language understanding', 'hard negatives', 'intrinsic bias', 'RoBERTa']"
8095,1809.06185,Laurenz Aldu Cornelissen Mr.,"Laurenz A Cornelissen, Richard J Barnett, Morakane AM Kepa, Daniel
  Loebenberg-Novitzkas, Jacques Jordaan",Deploying South African Social Honeypots on Twitter,,,10.1145/3278681.3278703,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Inspired by the simple, yet effective, method of tweeting gibberish to
attract automated social agents (bots), we attempt to create localised
honeypots in the South African political context. We produce a series of
defined techniques and combine them to generate interactions from users on
Twitter. The paper offers two key contributions. Conceptually, an argument is
made that honeypots should not be confused for bot detection methods, but are
rather methods to capture low-quality users. Secondly, we successfully generate
a list of 288 local low quality users active in the political context.
","[{'version': 'v1', 'created': 'Mon, 17 Sep 2018 13:20:37 GMT'}]",2018-09-18,"[['Cornelissen', 'Laurenz A', ''], ['Barnett', 'Richard J', ''], ['Kepa', 'Morakane AM', ''], ['Loebenberg-Novitzkas', 'Daniel', ''], ['Jordaan', 'Jacques', '']]","['Automated Social Agent Detection', 'Social Media', 'Honeypots']"
8096,2010.00029,Dian Wu,"Hong-Ye Hu, Dian Wu, Yi-Zhuang You, Bruno Olshausen, Yubei Chen","RG-Flow: A hierarchical and explainable flow model based on
  renormalization group and sparse prior","31 pages, 20 figures, 3 tables",Mach. Learn.: Sci. Technol. 3 035009 (2022),10.1088/2632-2153/ac8393,,cs.LG cond-mat.dis-nn cs.AI cs.CV stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Flow-based generative models have become an important class of unsupervised
learning approaches. In this work, we incorporate the key ideas of
renormalization group (RG) and sparse prior distribution to design a
hierarchical flow-based generative model, RG-Flow, which can separate
information at different scales of images and extract disentangled
representations at each scale. We demonstrate our method on synthetic
multi-scale image datasets and the CelebA dataset, showing that the
disentangled representations enable semantic manipulation and style mixing of
the images at different scales. To visualize the latent representations, we
introduce receptive fields for flow-based models and show that the receptive
fields of RG-Flow are similar to those of convolutional neural networks. In
addition, we replace the widely adopted isotropic Gaussian prior distribution
by the sparse Laplacian distribution to further enhance the disentanglement of
representations. From a theoretical perspective, our proposed method has
$O(\log L)$ complexity for inpainting of an image with edge length $L$,
compared to previous generative models with $O(L^2)$ complexity.
","[{'version': 'v1', 'created': 'Wed, 30 Sep 2020 18:04:04 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Oct 2020 18:27:26 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Oct 2020 00:59:10 GMT'}, {'version': 'v4', 'created': 'Fri, 18 Dec 2020 20:27:11 GMT'}, {'version': 'v5', 'created': 'Mon, 15 Aug 2022 09:50:27 GMT'}]",2022-08-16,"[['Hu', 'Hong-Ye', ''], ['Wu', 'Dian', ''], ['You', 'Yi-Zhuang', ''], ['Olshausen', 'Bruno', ''], ['Chen', 'Yubei', '']]","['renormalization group', 'normalizing flows', 'hierarchical model', 'sparse prior', 'unsupervised representation disentanglement']"
8097,2211.00457,Michael Xevgenis,"Michael Xevgenis, Dimitrios Kogias, Ioannis Christidis, Charalampos
  Patrikakis, Helen C. Leligou","Evaluation of a blockchain-enabled resource management mechanism for
  NGNs",,"International Journal of Network Security & Its Applications
  (IJNSA) Vol.13, No.5, September 2021",10.5121/ijnsa.2021.13501,,cs.NI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  A new era in ICT has begun with the evolution of Next Generation Networks
(NGNs) and the development of human-centric applications. Ultra-low latency,
high throughput, and high availability are a few of the main characteristics of
modern networks. Network Providers (NPs) are responsible for the development
and maintenance of network infrastructures ready to support the most demanding
applications that should be available not only in urban areas but in every
corner of the earth. The NPs must collaborate to offer high-quality services
and keep their overall cost low. The collaboration among competitive entities
can in principle be regulated by a trusted 3rd party or by a distributed
approach/technology which can guarantee integrity, security, and trust. This
paper examines the use of blockchain technology for resource management and
negotiation among NPs and presents the results of experiments conducted in a
dedicated real testbed. The implementation of the resource management mechanism
is described in a Smart Contract (SC) and the testbeds use the Raft and the
IBFT consensus mechanisms respectively. The goal of this paper is two-fold: to
assess its performance in terms of transaction throughput and latency so that
we can assess the granularity at which this solution can operate (e.g. support
resource re-allocation among NPs on micro-service level or not) and define
implementation-specific parameters like the consensus mechanism that is the
most suitable for this use case based on performance metrics.
","[{'version': 'v1', 'created': 'Tue, 1 Nov 2022 13:40:26 GMT'}]",2022-11-02,"[['Xevgenis', 'Michael', ''], ['Kogias', 'Dimitrios', ''], ['Christidis', 'Ioannis', ''], ['Patrikakis', 'Charalampos', ''], ['Leligou', 'Helen C.', '']]","['Blockchain', 'NGNs', 'Resource management', 'Consensus', 'Performance  1']"
8098,2007.12810,Alfonso Pierantonio,Alfonso Pierantonio and Benoit Combemale and Mark van den Brand,Open Access all you wanted to know and never dared to ask,5 pages,"The Journal of Object Technology, Vol. 19 N. 1 (2020)",10.5381/jot.2020.19.1.e1,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  This editorial presents the various forms of open access, discusses their
pros and cons from the perspective of the Journal of Object Technology and its
editors in chiefs, and illustrates how JOT implements a platinum open access
model. The regular reader will also notice that this editorial features a new
template for the journal that will be used from now on.
","[{'version': 'v1', 'created': 'Sat, 25 Jul 2020 00:07:15 GMT'}]",2020-07-28,"[['Pierantonio', 'Alfonso', ''], ['Combemale', 'Benoit', ''], ['Brand', 'Mark van den', '']]","['Open Access', 'Scientific Publishing', 'Article Processing Charge', 'Transformative Agreement', 'Community']"
8099,2203.12955,Adam Hepworth,Adam J. Hepworth and Daniel P. Baxter and Hussein A. Abbass,"Onto4MAT: A Swarm Shepherding Ontology for Generalised Multi-Agent
  Teaming","19 pages, 2 tables, 16 figures",,10.1109/ACCESS.2022.3180032,,cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Research in multi-agent teaming has increased substantially over recent
years, with knowledge-based systems to support teaming processes typically
focused on delivering functional (communicative) solutions for a team to act
meaningfully in response to direction. Enabling humans to effectively interact
and team with a swarm of autonomous cognitive agents is an open research
challenge in Human-Swarm Teaming research, partially due to the focus on
developing the enabling architectures to support these systems. Typically,
bi-directional transparency and shared semantic understanding between agents
has not prioritised a designed mechanism in Human-Swarm Teaming, potentially
limiting how a human and a swarm team can share understanding and
information\textemdash data through concepts and contexts\textemdash to achieve
a goal. To address this, we provide a formal knowledge representation design
that enables the swarm Artificial Intelligence to reason about its environment
and system, ultimately achieving a shared goal. We propose the Ontology for
Generalised Multi-Agent Teaming, Onto4MAT, to enable more effective teaming
between humans and teams through the biologically-inspired approach of
shepherding.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2022 09:36:50 GMT'}]",2022-11-22,"[['Hepworth', 'Adam J.', ''], ['Baxter', 'Daniel P.', ''], ['Abbass', 'Hussein A.', '']]","['Multi-Agent Teaming', 'Ontology', 'Shepherding', 'Human-Swarm Teaming', 'Situational Understanding']"
8100,1704.03740,Thanh Thoa Pham Thi Dr.,"Thanh Thoa Pham Thi, Thang Le Dinh, Markus Helfert, Michel Leonard",Modelling collaborative services: The COSEMO model,"5th International Conference on Software and Data Technologies, 9
  pages",,10.5220/0002929800790082,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the dominance of the service sector in the last decades, there is
still a need for a strong foundation on service design and innovation. Little
attention has paid on service modelling, particularly in the collaboration
context. Collaboration is considered as one of solutions for surviving or
sustaining the business in the high competitive atmosphere. Collaborative
services require various service providers working together according to
agreements between them, along with service consumers, in order to co-produce
services. In this paper, we address crucial issues in collaborative services
such as collaboration levels, sharing data and processes due to business
inter-dependencies between service stakeholders. Afterward, we propose a model
for Collaborative Service Modelling, which is able to cover identified issues.
We also apply our proposed model to modelling an example of healthcare services
in order to illustrate the relevance of our modelling approach to the matter in
hand.
","[{'version': 'v1', 'created': 'Tue, 11 Apr 2017 14:50:24 GMT'}]",2017-04-13,"[['Thi', 'Thanh Thoa Pham', ''], ['Dinh', 'Thang Le', ''], ['Helfert', 'Markus', ''], ['Leonard', 'Michel', '']]","['Service modelling', 'collaboration', 'sharing data and processes', 'collaborative services']"
8101,2103.09174,Meher Shashwat Nigam,"Meher Shashwat Nigam, Avinash Prabhu, Anurag Sahu, Puru Gupta, Tanvi
  Karandikar, N. Sai Shankar, Ravi Kiran Sarvadevabhatla, K. Madhava Krishna",Monocular Multi-Layer Layout Estimation for Warehouse Racks,"Visit our project repository at
  https://github.com/Avinash2468/RackLay",,10.1145/3490035.3490263,,cs.CV cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Given a monocular colour image of a warehouse rack, we aim to predict the
bird's-eye view layout for each shelf in the rack, which we term as multi-layer
layout prediction. To this end, we present RackLay, a deep neural network for
real-time shelf layout estimation from a single image. Unlike previous layout
estimation methods, which provide a single layout for the dominant ground plane
alone, RackLay estimates the top-view and front-view layout for each shelf in
the considered rack populated with objects. RackLay's architecture and its
variants are versatile and estimate accurate layouts for diverse scenes
characterized by varying number of visible shelves in an image, large range in
shelf occupancy factor and varied background clutter. Given the extreme paucity
of datasets in this space and the difficulty involved in acquiring real data
from warehouses, we additionally release a flexible synthetic dataset
generation pipeline WareSynth which allows users to control the generation
process and tailor the dataset according to contingent application. The
ablations across architectural variants and comparison with strong prior
baselines vindicate the efficacy of RackLay as an apt architecture for the
novel problem of multi-layered layout estimation. We also show that fusing the
top-view and front-view enables 3D reasoning applications such as metric free
space estimation for the considered rack.
","[{'version': 'v1', 'created': 'Tue, 16 Mar 2021 16:22:31 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Mar 2021 10:58:36 GMT'}, {'version': 'v3', 'created': 'Thu, 28 Oct 2021 17:00:21 GMT'}]",2021-10-29,"[['Nigam', 'Meher Shashwat', ''], ['Prabhu', 'Avinash', ''], ['Sahu', 'Anurag', ''], ['Gupta', 'Puru', ''], ['Karandikar', 'Tanvi', ''], ['Shankar', 'N. Sai', ''], ['Sarvadevabhatla', 'Ravi Kiran', ''], ['Krishna', 'K. Madhava', '']]","['Monocular 3D Reconstruction', 'Sim2Real', 'Synthetic Data Generation']"
8102,1506.05217,Mohsin Junaid,"Mohsin Junaid, Donggang Liu and David Kung","Dexteroid: Detecting Malicious Behaviors in Android Apps Using
  Reverse-Engineered Life Cycle Models",,"Computers & Security, Volume 59,Pages 92-117, ISSN 0167-4048, June
  2016",10.1016/j.cose.2016.01.008,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The amount of Android malware has increased greatly during the last few
years. Static analysis is widely used in detecting such malware by analyzing
the code without execution. The effectiveness of current tools relies on the
app model as well as the malware detection algorithm which analyzes the app
model. If the model and/or the algorithm is inadequate, then sophisticated
attacks that are triggered by specific sequences of events will not be
detected.
  This paper presents a static analysis framework called Dexteroid, which uses
reverse-engineered life cycle models to accurately capture the behaviors of
Android components. Dexteroid systematically derives event sequences from the
models, and uses them to detect attacks launched by specific ordering of
events. A prototype implementation of Dexteroid detects two types of attacks:
(1) leakage of private information, and (2) sending SMS to premium-rate
numbers. A series of experiments are conducted on 1526 Google Play apps, 1259
Genome Malware apps, and a suite of benchmark apps called DroidBench and the
results are compared with a state-of-the-art static analysis tool called
FlowDroid. The evaluation results show that the proposed framework is effective
and efficient in terms of precision, recall, and execution time.
","[{'version': 'v1', 'created': 'Wed, 17 Jun 2015 06:38:37 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Apr 2016 19:38:43 GMT'}]",2016-04-11,"[['Junaid', 'Mohsin', ''], ['Liu', 'Donggang', ''], ['Kung', 'David', '']]","['Static analysis', 'Mobile app security', 'Android', 'Malware', 'Privacy', 'Lifecycle models']"
8103,1802.04853,Drahomira Herrmannova,"Drahomira Herrmannova and Robert M. Patton and Petr Knoth and
  Christopher G. Stahl",Do Citations and Readership Identify Seminal Publications?,Accepted to journal Scientometrics,"Herrmannova, D., Patton, R.M., Knoth, P. et al. Scientometrics
  (2018). https://doi.org/10.1007/s11192-018-2669-y",10.1007/s11192-018-2669-y,,cs.DL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we show that citation counts work better than a random
baseline (by a margin of 10%) in distinguishing excellent research, while
Mendeley reader counts don't work better than the baseline. Specifically, we
study the potential of these metrics for distinguishing publications that
caused a change in a research field from those that have not. The experiment
has been conducted on a new dataset for bibliometric research called
TrueImpactDataset. TrueImpactDataset is a collection of research publications
of two types -- research papers which are considered seminal works in their
area and papers which provide a literature review of a research area. We
provide overview statistics of the dataset and propose to use it for validating
research evaluation metrics. Using the dataset, we conduct a set of experiments
to study how citation and reader counts perform in distinguishing these
publication types, following the intuition that causing a change in a field
signifies research contribution. We show that citation counts help in
distinguishing research that strongly influenced later developments from works
that predominantly discuss the current state of the art with a degree of
accuracy (63%, i.e. 10% over the random baseline). In all setups, Mendeley
reader counts perform worse than a random baseline.
","[{'version': 'v1', 'created': 'Tue, 13 Feb 2018 20:53:28 GMT'}]",2018-02-15,"[['Herrmannova', 'Drahomira', ''], ['Patton', 'Robert M.', ''], ['Knoth', 'Petr', ''], ['Stahl', 'Christopher G.', '']]","['Information Retrieval', 'Scholarly Communication', 'PublicationDatasets', 'Data Mining', 'Research Evaluation', 'Bibliometrics', 'Altmetrics']"
8104,2103.15451,Antonios Liapis,"Daniel Karavolos, Antonios Liapis and Georgios N. Yannakakis","Pairing Character Classes in a Deathmatch Shooter Game via a
  Deep-Learning Surrogate Model","Proceedings of the FDG Workshop on Procedural Content Generation,
  2018, 10 pages",,10.1145/3235765.3235816,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a surrogate model of gameplay that learns the mapping
between different game facets, and applies it to a generative system which
designs new content in one of these facets. Focusing on the shooter game genre,
the paper explores how deep learning can help build a model which combines the
game level structure and the game's character class parameters as input and the
gameplay outcomes as output. The model is trained on a large corpus of game
data from simulations with artificial agents in random sets of levels and class
parameters. The model is then used to generate classes for specific levels and
for a desired game outcome, such as balanced matches of short duration.
Findings in this paper show that the system can be expressive and can generate
classes for both computer generated and human authored levels.
","[{'version': 'v1', 'created': 'Mon, 29 Mar 2021 09:34:24 GMT'}]",2021-03-30,"[['Karavolos', 'Daniel', ''], ['Liapis', 'Antonios', ''], ['Yannakakis', 'Georgios N.', '']]","['Procedural Content Generation', 'Surrogate Model', 'Deep Learning', 'Evolutionary Computation', 'Shooter Games']"
8105,2201.09931,Zheng Li,Zheng Li and Rajiv Ranjan,"Just Enough, Just in Time, Just for ""Me"": Fundamental Principles for
  Engineering IoT-native Software Systems",5 pages,"Proceedings of the 44th International Conference on Software
  Engineering (ICSE 2022)",10.1145/3510455.3512785,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  By seamlessly integrating everyday objects and by changing the way we
interact with our surroundings, Internet of Things (IoT) is drastically
improving the life quality of households and enhancing the productivity of
businesses. Given the unique IoT characteristics, IoT applications have emerged
distinctively from the mainstream application types. Inspired by the outlook of
a programmable world, we further foresee an IoT-native trend in designing,
developing, deploying, and maintaining software systems. However, although the
challenges of IoT software projects are frequently discussed, addressing those
challenges are still in the ""crossing the chasm"" period. By participating in a
few various IoT projects, we gradually distilled three fundamental principles
for engineering IoT-native software systems, such as just enough, just in time,
and just for ""me"". These principles target the challenges that are associated
with the most typical features of IoT environments, ranging from resource
limits to technology heterogeneity of IoT devices. We expect this research to
trigger dedicated efforts, techniques and theories for the topic IoT-native
software engineering.
","[{'version': 'v1', 'created': 'Mon, 24 Jan 2022 19:37:37 GMT'}]",2022-01-26,"[['Li', 'Zheng', ''], ['Ranjan', 'Rajiv', '']]","['choreography', 'cloud-centric coordination', 'Internet of Things (IoT)', 'IoT-native software engineering', 'software engineering principles']"
8106,2011.02291,Jorik Jooken,"Thibault Lechien, Jorik Jooken, Patrick De Causmaecker",Evolving test instances of the Hamiltonian completion problem,,,10.1016/j.cor.2022.106019,,cs.AI cs.DM cs.NE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Predicting and comparing algorithm performance on graph instances is
challenging for multiple reasons. First, there is usually no standard set of
instances to benchmark performance. Second, using existing graph generators
results in a restricted spectrum of difficulty and the resulting graphs are
usually not diverse enough to draw sound conclusions. That is why recent work
proposes a new methodology to generate a diverse set of instances by using an
evolutionary algorithm. We can then analyze the resulting graphs and get key
insights into which attributes are most related to algorithm performance. We
can also fill observed gaps in the instance space in order to generate graphs
with previously unseen combinations of features. This methodology is applied to
the instance space of the Hamiltonian completion problem using two different
solvers, namely the Concorde TSP Solver and a multi-start local search
algorithm.
","[{'version': 'v1', 'created': 'Mon, 5 Oct 2020 20:04:58 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Jan 2021 19:28:04 GMT'}, {'version': 'v3', 'created': 'Sat, 19 Nov 2022 14:28:12 GMT'}]",2022-11-22,"[['Lechien', 'Thibault', ''], ['Jooken', 'Jorik', ''], ['De Causmaecker', 'Patrick', '']]","['Evolving instances', 'Instance space', 'Hamiltonian completion problem']"
8107,2005.03345,Masahiro Oda Dr.,"Masahiro Oda, Natsuki Shimizu, Ken'ichi Karasawa, Yukitaka Nimura,
  Takayuki Kitasaka, Kazunari Misawa, Michitaka Fujiwara, Daniel Rueckert,
  Kensaku Mori","Regression Forest-Based Atlas Localization and Direction Specific Atlas
  Generation for Pancreas Segmentation","Accepted paper as a poster presentation at MICCAI 2016 (International
  Conference on Medical Image Computing and Computer-Assisted Intervention),
  Athens, Greece","Published in Proceedings of MICCAI 2016, LNCS 9901, pp 556-563",10.1007/978-3-319-46723-8_64,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a fully automated atlas-based pancreas segmentation
method from CT volumes utilizing atlas localization by regression forest and
atlas generation using blood vessel information. Previous probabilistic
atlas-based pancreas segmentation methods cannot deal with spatial variations
that are commonly found in the pancreas well. Also, shape variations are not
represented by an averaged atlas. We propose a fully automated pancreas
segmentation method that deals with two types of variations mentioned above.
The position and size of the pancreas is estimated using a regression forest
technique. After localization, a patient-specific probabilistic atlas is
generated based on a new image similarity that reflects the blood vessel
position and direction information around the pancreas. We segment it using the
EM algorithm with the atlas as prior followed by the graph-cut. In evaluation
results using 147 CT volumes, the Jaccard index and the Dice overlap of the
proposed method were 62.1% and 75.1%, respectively. Although we automated all
of the segmentation processes, segmentation results were superior to the other
state-of-the-art methods in the Dice overlap.
","[{'version': 'v1', 'created': 'Thu, 7 May 2020 09:20:55 GMT'}]",2020-05-08,"[['Oda', 'Masahiro', ''], ['Shimizu', 'Natsuki', ''], ['Karasawa', ""Ken'ichi"", ''], ['Nimura', 'Yukitaka', ''], ['Kitasaka', 'Takayuki', ''], ['Misawa', 'Kazunari', ''], ['Fujiwara', 'Michitaka', ''], ['Rueckert', 'Daniel', ''], ['Mori', 'Kensaku', '']]","['segmentation', 'pancreas', 'probabilistic atlas', 'regression forest']"
8108,1909.07454,Kin Quan,"Kin Quan, Ryutaro Tanno, Rebecca J. Shipley, Jeremy S. Brown, Joseph
  Jacob, John R. Hurst, David J. Hawkes","Reproducibility of an airway tapering measurement in CT with application
  to bronchiectasis","55 pages, 18 figures, The manuscript was originally published in
  Journal of Medical Imaging","J. Med. Imag. 6(3), 034003 (2019)",10.1117/1.JMI.6.3.034003,,cs.CV physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose: This paper proposes a pipeline to acquire a scalar tapering
measurement from the carina to the most distal point of an individual airway
visible on CT. We show the applicability of using tapering measurements on
clinically acquired data by quantifying the reproducibility of the tapering
measure. Methods: We generate a spline from the centreline of an airway to
measure the area and arclength at contiguous intervals. The tapering
measurement is the gradient of the linear regression between area in log space
and arclength. The reproducibility of the measure was assessed by analysing
different radiation doses, voxel sizes and reconstruction kernel on single
timepoint and longitudinal CT scans and by evaluating the effct of airway
bifurcations. Results: Using 74 airways from 10 CT scans, we show a statistical
difference, p = 3.4 $\times$ 10$^{-4}$ in tapering between healthy airways (n =
35) and those affected by bronchiectasis (n = 39). The difference between the
mean of the two populations was 0.011mm$^{-1}$ and the difference between the
medians of the two populations was 0.006mm$^{-1}$. The tapering measurement
retained a 95\% confidence interval of $\pm$0.005mm$^{-1}$ in a simulated 25
mAs scan and retained a 95% confidence of $\pm$0.005mm$^{-1}$ on simulated CTs
up to 1.5 times the original voxel size. Conclusion: We have established an
estimate of the precision of the tapering measurement and estimated the effect
on precision of simulated voxel size and CT scan dose. We recommend that the
scanner calibration be undertaken with the phantoms as described, on the
specific CT scanner, radiation dose and reconstruction algorithm that is to be
used in any quantitative studies. Our code is available at
https://github.com/quan14/AirwayTaperingInCT
","[{'version': 'v1', 'created': 'Mon, 16 Sep 2019 19:49:01 GMT'}]",2019-09-18,"[['Quan', 'Kin', ''], ['Tanno', 'Ryutaro', ''], ['Shipley', 'Rebecca J.', ''], ['Brown', 'Jeremy S.', ''], ['Jacob', 'Joseph', ''], ['Hurst', 'John R.', ''], ['Hawkes', 'David J.', '']]","['Tapering', 'CT Simulations', 'Reproducibility', 'Airways', 'CT Metrology']"
8109,2204.07541,Q. Tyrell Davis,Q. Tyrell Davis and Josh Bongard,"Selecting Continuous Life-Like Cellular Automata for Halting
  Unpredictability: Evolving for Abiogenesis",Accepted to GECCO 2022,,10.1145/3520304.3529037,,cs.NE cs.LG nlin.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Substantial efforts have been applied to engineer CA with desired emergent
properties, such as supporting gliders. Recent work in continuous CA has
generated a wide variety of compelling bioreminiscent patterns, and the
expansion of CA research into continuously-valued domains, multiple channels,
and higher dimensions complicates their study. In this work we devise a
strategy for evolving CA and CA patterns in two steps, based on the simple idea
that CA are likely to be complex and computationally capable if they support
patterns that grow indefinitely as well as patterns that vanish completely, and
are difficult to predict the difference in advance. The second part of our
strategy evolves patterns by selecting for mobility and conservation of mean
cell value. We validate our pattern evolution method by re-discovering gliders
in 17 of 17 Lenia CA, and also report 4 new evolved CA and 1 randomly evolved
CA that support novel evolved glider patterns. The CA reported here share
neighborhood kernels with previously described Lenia CA, but exhibit a wider
range of typical dynamics than their Lenia counterparts. Code for evolving
continuous CA is made available under an MIT License
(https://github.com/rivesunder/yuca).
","[{'version': 'v1', 'created': 'Fri, 15 Apr 2022 16:44:05 GMT'}, {'version': 'v2', 'created': 'Mon, 23 May 2022 21:13:52 GMT'}]",2022-05-25,"[['Davis', 'Q. Tyrell', ''], ['Bongard', 'Josh', '']]","['cellular automata', 'evolution', 'complexity', 'artificial life']"
8110,2002.00250,Toamsz Kryjak,"Piotr Janus, Tomasz Kryjak, Marek Gorgon",Foreground object segmentation in RGB-D data implemented on GPU,"12 pages, 4 figures, submitted to KKA 2020 conference",,10.1007/978-3-030-50936-1_68,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a GPU implementation of two foreground object
segmentation algorithms: Gaussian Mixture Model (GMM) and Pixel Based Adaptive
Segmenter (PBAS) modified for RGB-D data support. The simultaneous use of
colour (RGB) and depth (D) data allows to improve segmentation accuracy,
especially in case of colour camouflage, illumination changes and occurrence of
shadows. Three GPUs were used to accelerate calculations: embedded NVIDIA
Jetson TX2 (Maxwell architecture), mobile NVIDIA GeForce GTX 1050m (Pascal
architecture) and efficient NVIDIA RTX 2070 (Turing architecture). Segmentation
accuracy comparable to previously published works was obtained. Moreover, the
use of a GPU platform allowed to get real-time image processing. In addition,
the system has been adapted to work with two RGB-D sensors: RealSense D415 and
D435 from Intel.
","[{'version': 'v1', 'created': 'Sat, 1 Feb 2020 17:53:39 GMT'}]",2020-07-02,"[['Janus', 'Piotr', ''], ['Kryjak', 'Tomasz', ''], ['Gorgon', 'Marek', '']]","['foreground object segmentation', 'background subtraction', 'RGB–D', 'GPU', 'GMM', 'PBAS', 'Intel RealSense']"
8111,2007.03579,Abdelrahman Abdallah,"Daniyar Nurseitov, Kairat Bostanbekov, Daniyar Kurmankhojayev, Anel
  Alimova, Abdelrahman Abdallah",HKR For Handwritten Kazakh & Russian Database,Multimed Tools Appl (2021),,10.1007/s11042-021-11399-6,Nurseitov2021,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a new Russian and Kazakh database (with about 95%
of Russian and 5% of Kazakh words/sentences respectively) for offline
handwriting recognition. A few pre-processing and segmentation procedures have
been developed together with the database. The database is written in Cyrillic
and shares the same 33 characters. Besides these characters, the Kazakh
alphabet also contains 9 additional specific characters. This dataset is a
collection of forms. The sources of all the forms in the datasets were
generated by \LaTeX which subsequently was filled out by persons with their
handwriting. The database consists of more than 1400 filled forms. There are
approximately 63000 sentences, more than 715699 symbols produced by
approximately 200 different writers. It can serve researchers in the field of
handwriting recognition tasks by using deep and machine learning.
","[{'version': 'v1', 'created': 'Tue, 7 Jul 2020 15:57:41 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Jul 2020 16:53:54 GMT'}]",2021-08-31,"[['Nurseitov', 'Daniyar', ''], ['Bostanbekov', 'Kairat', ''], ['Kurmankhojayev', 'Daniyar', ''], ['Alimova', 'Anel', ''], ['Abdallah', 'Abdelrahman', '']]","['in Kazakh andRussian (Areas', 'Cities', 'Village', 'etc']"
8112,2203.14227,Yu Zhang,"Yu Zhang, Yun Wang, Haidong Zhang, Bin Zhu, Siming Chen, Dongmei Zhang",OneLabeler: A Flexible System for Building Data Labeling Tools,,,10.1145/3491102.3517612,,cs.HC cs.LG cs.MM,http://creativecommons.org/licenses/by/4.0/,"  Labeled datasets are essential for supervised machine learning. Various data
labeling tools have been built to collect labels in different usage scenarios.
However, developing labeling tools is time-consuming, costly, and
expertise-demanding on software development. In this paper, we propose a
conceptual framework for data labeling and OneLabeler based on the conceptual
framework to support easy building of labeling tools for diverse usage
scenarios. The framework consists of common modules and states in labeling
tools summarized through coding of existing tools. OneLabeler supports
configuration and composition of common software modules through visual
programming to build data labeling tools. A module can be a human, machine, or
mixed computation procedure in data labeling. We demonstrate the expressiveness
and utility of the system through ten example labeling tools built with
OneLabeler. A user study with developers provides evidence that OneLabeler
supports efficient building of diverse data labeling tools.
","[{'version': 'v1', 'created': 'Sun, 27 Mar 2022 07:22:36 GMT'}]",2022-03-29,"[['Zhang', 'Yu', ''], ['Wang', 'Yun', ''], ['Zhang', 'Haidong', ''], ['Zhu', 'Bin', ''], ['Chen', 'Siming', ''], ['Zhang', 'Dongmei', '']]","['data labeling', 'framework', 'toolkit', 'interactive machine learning', 'visual programming']"
8113,2201.12194,Anirudh Chandramouli,"Ananya Appan, Anirudh Chandramouli, Ashish Choudhury",Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees,"62 pages, 18 figures, Full version of the article published in ACM
  PODC 2022",,10.1145/3519270.3538417,,cs.CR cs.DC cs.IT math.IT,http://creativecommons.org/licenses/by/4.0/,"  Secure multi-party computation (MPC) is a fundamental problem in secure
distributed computing. An MPC protocol allows a set of $n$ mutually distrusting
parties to carry out any joint computation of their private inputs, without
disclosing any additional information about their inputs. MPC with
information-theoretic security provides the strongest security guarantees and
remains secure even against computationally unbounded adversaries.
Perfectly-secure MPC protocols is a class of information-theoretically secure
MPC protocols, which provides all the security guarantees in an error-free
fashion. The focus of this work is perfectly-secure MPC. Known protocols are
designed assuming either a synchronous or asynchronous communication network.
It is well known that perfectly-secure synchronous MPC protocol is possible as
long as adversary can corrupt any $t_s < n/3$ parties. On the other hand,
perfectly-secure asynchronous MPC protocol can tolerate up to $t_a < n/4$
corrupt parties. A natural question is does there exist a single MPC protocol
for the setting where the parties are not aware of the exact network type and
which can tolerate up to $t_s < n/3$ corruptions in a synchronous network and
up to $t_a < n/4$ corruptions in an asynchronous network. We design such a
best-of-both-worlds perfectly-secure MPC protocol, provided $3t_s + t_a < n$
holds.
  For designing our protocol, we design two important building blocks, which
are of independent interest. The first building block is a best-of-both-worlds
Byzantine agreement (BA) protocol tolerating $t < n/3$ corruptions and which
remains secure, both in a synchronous as well as asynchronous network. The
second building block is a polynomial-based best-of-both-worlds verifiable
secret-sharing (VSS) protocol, which can tolerate up to $t_s$ and $t_a$
corruptions in a synchronous and in an asynchronous network respectively.
","[{'version': 'v1', 'created': 'Fri, 28 Jan 2022 15:49:08 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Aug 2022 16:42:20 GMT'}]",2022-08-10,"[['Appan', 'Ananya', ''], ['Chandramouli', 'Anirudh', ''], ['Choudhury', 'Ashish', '']]","['Perfect security', 'MPC', 'Verifiable Secret Sharing', 'Byzantine Agreement', 'Synchronous Network', 'Asynchronous Network']"
8114,2004.05880,Saiki Sarkar Sarkar,"Shanta Khatun, Fahim Hossain Saiki and Milon Biswas","SecureIT using Firebase, Google map and Node.Js",17 pages,,10.31234/osf.io/uhvew,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  This paper is about describing the features of a software that was developed
for its user safety which we called SecureIT is a android based soft ware using
Android SDK along with Firebase and Google map SDK along with Node.Js. The aim
of developing this project was to make sure and taking its users safety to a
next level. Actually now a days some crime incidents like rapes, fire accidents
and snatchings are very common and we believe many of those can be prevented if
victim got support at the right time. According to the well known daily news
paper of Bangladesh The Daily Star there were about 1413 women was rapped where
76 women were dead in 2019. On the same pa-per it also said that in 2018 and
2017 the number of rapes were 732 and 818 where we can easily get that the
number increases to almost double in 2019. Where we get a point that if those
girls get support or get people known about their location at the right time
they might get rid of the situation and the number of rapes could be reduced a
lot because we all know that now a days using mo-bile smartphone is too easy
for people. Although leading Chinese mobile phone company Xiaomi introduced a
new feature Emergency SOS service in their mobile phones at the end of 2018
with a MIUI 10 update but this feature is only limited to the Xiaomi phones and
it was well advertised as well. This paper will briefly describe all the
features of our software and its usages.
","[{'version': 'v1', 'created': 'Mon, 6 Apr 2020 21:33:45 GMT'}]",2020-04-14,"[['Khatun', 'Shanta', ''], ['Saiki', 'Fahim Hossain', ''], ['Biswas', 'Milon', '']]","['Android', 'SDK', 'Firebase', 'Google map', 'Xiaomi', 'Node.JS', 'MIUI']"
8115,1806.07172,Santtu Tikka,Santtu Tikka and Juha Karvanen,Surrogate Outcomes and Transportability,"This is the version published in the International Journal of
  Approximate Reasoning","International Journal of Approximate Reasoning, 2019; 108: 21-37",10.1016/j.ijar.2019.02.007,,cs.AI stat.ME,http://creativecommons.org/licenses/by/4.0/,"  Identification of causal effects is one of the most fundamental tasks of
causal inference. We consider an identifiability problem where some
experimental and observational data are available but neither data alone is
sufficient for the identification of the causal effect of interest. Instead of
the outcome of interest, surrogate outcomes are measured in the experiments.
This problem is a generalization of identifiability using surrogate experiments
and we label it as surrogate outcome identifiability. We show that the concept
of transportability provides a sufficient criteria for determining surrogate
outcome identifiability for a large class of queries.
","[{'version': 'v1', 'created': 'Tue, 19 Jun 2018 12:01:29 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Jun 2018 11:24:39 GMT'}, {'version': 'v3', 'created': 'Thu, 29 Nov 2018 07:27:49 GMT'}, {'version': 'v4', 'created': 'Tue, 12 Mar 2019 12:49:08 GMT'}]",2019-03-13,"[['Tikka', 'Santtu', ''], ['Karvanen', 'Juha', '']]","['Causality', 'do-calculus', 'Experiment', 'Graph', 'Identifiability', 'Mediator']"
8116,2008.02757,Michelle Kuchera,"Robert Solli, Daniel Bazin, Michelle P. Kuchera, Ryan R. Strauss,
  Morten Hjorth-Jensen","Unsupervised Learning for Identifying Events in Active Target
  Experiments",,,10.1016/j.nima.2021.165461,,cs.CV nucl-ex,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents novel applications of unsupervised machine learning
methods to the problem of event separation in an active target detector, the
Active-Target Time Projection Chamber (AT-TPC). The overarching goal is to
group similar events in the early stages of the data analysis, thereby
improving efficiency by limiting the computationally expensive processing of
unnecessary events. The application of unsupervised clustering algorithms to
the analysis of two-dimensional projections of particle tracks from a resonant
proton scattering experiment on $^{46}$Ar is introduced. We explore the
performance of autoencoder neural networks and a pre-trained VGG16
convolutional neural network. We study clustering performance on both data from
a simulated $^{46}$Ar experiment, and real events from the AT-TPC detector. We
find that a $k$-means algorithm applied to simulated data in the VGG16 latent
space forms almost perfect clusters. Additionally, the VGG16+$k$-means approach
finds high purity clusters of proton events for real experimental data. We also
explore the application of clustering the latent space of autoencoder neural
networks for event separation. While these networks show strong performance,
they suffer from high variability in their results.
","[{'version': 'v1', 'created': 'Thu, 6 Aug 2020 16:49:39 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Aug 2020 00:48:31 GMT'}, {'version': 'v3', 'created': 'Sat, 13 Mar 2021 17:48:41 GMT'}]",2021-07-07,"[['Solli', 'Robert', ''], ['Bazin', 'Daniel', ''], ['Kuchera', 'Michelle P.', ''], ['Strauss', 'Ryan R.', ''], ['Hjorth-Jensen', 'Morten', '']]","['Active target experiments', 'Machine Learning', 'UnsupervisedLearning', 'Autoencoder Neural Networks']"
8117,2004.08190,Weijian Li,"Weijian Li, Yuhang Lu, Kang Zheng, Haofu Liao, Chihung Lin, Jiebo Luo,
  Chi-Tung Cheng, Jing Xiao, Le Lu, Chang-Fu Kuo, and Shun Miao",Structured Landmark Detection via Topology-Adapting Deep Graph Learning,Accepted to ECCV-20. Camera-ready with supplementary material,,10.1007/978-3-030-58545-7_16,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image landmark detection aims to automatically identify the locations of
predefined fiducial points. Despite recent success in this field,
higher-ordered structural modeling to capture implicit or explicit
relationships among anatomical landmarks has not been adequately exploited. In
this work, we present a new topology-adapting deep graph learning approach for
accurate anatomical facial and medical (e.g., hand, pelvis) landmark detection.
The proposed method constructs graph signals leveraging both local image
features and global shape features. The adaptive graph topology naturally
explores and lands on task-specific structures which are learned end-to-end
with two Graph Convolutional Networks (GCNs). Extensive experiments are
conducted on three public facial image datasets (WFLW, 300W, and COFW-68) as
well as three real-world X-ray medical datasets (Cephalometric (public), Hand
and Pelvis). Quantitative results comparing with the previous state-of-the-art
approaches across all studied datasets indicating the superior performance in
both robustness and accuracy. Qualitative visualizations of the learned graph
topologies demonstrate a physically plausible connectivity laying behind the
landmarks.
","[{'version': 'v1', 'created': 'Fri, 17 Apr 2020 11:55:03 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Apr 2020 18:16:18 GMT'}, {'version': 'v3', 'created': 'Fri, 10 Jul 2020 19:32:01 GMT'}, {'version': 'v4', 'created': 'Wed, 15 Jul 2020 12:36:05 GMT'}, {'version': 'v5', 'created': 'Thu, 16 Jul 2020 15:29:51 GMT'}, {'version': 'v6', 'created': 'Thu, 23 Jul 2020 17:00:51 GMT'}]",2020-12-09,"[['Li', 'Weijian', ''], ['Lu', 'Yuhang', ''], ['Zheng', 'Kang', ''], ['Liao', 'Haofu', ''], ['Lin', 'Chihung', ''], ['Luo', 'Jiebo', ''], ['Cheng', 'Chi-Tung', ''], ['Xiao', 'Jing', ''], ['Lu', 'Le', ''], ['Kuo', 'Chang-Fu', ''], ['Miao', 'Shun', '']]","['Landmark Detection', 'GCN', 'Adaptive Topology']"
8118,1812.09961,Morteza Zakeri Nasrabadi,"Morteza Zakeri Nasrabadi, Saeed Parsa, Akram Kalaee",Format-aware Learn&Fuzz: Deep Test Data Generation for Efficient Fuzzing,"43 pages, 11 figures, 7 tables, and 2 algorithms. Updated title and
  abstract",,10.1007/s00521-020-05039-7,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Appropriate test data is a crucial factor to reach success in dynamic
software testing, e.g., fuzzing. Most of the real-world applications, however,
accept complex structure inputs containing data surrounded by meta-data which
is processed in several stages comprising of the parsing and rendering
(execution). It makes the automatically generating efficient test data, to be
non-trivial and laborious activity. The success of deep learning to cope in
solving complex tasks especially in generative tasks has motivated us to
exploit it in the context of complex test data generation. To do so, a neural
language model (NLM) based on deep recurrent neural networks (RNNs) is used to
learn the structure of complex input. Our approach generates new test data
while distinguishes between data and meta-data that makes it possible to target
both the parsing and rendering parts of software under test (SUT). Such test
data can improve, input fuzzing. To assess the proposed approach, we developed
a modular file format fuzzer, IUST-DeepFuzz. Our conducted experiments on the
MuPDF, a lightweight and favorite portable document format (PDF) reader, reveal
that IUST-DeepFuzz reaches high coverage of SUT in comparison with the
state-of-the-art tools such as learn&fuzz, AFL, Augmented-AFL and random
fuzzing. We also observed that the simpler deep learning models, the higher
code coverage.
","[{'version': 'v1', 'created': 'Mon, 24 Dec 2018 18:14:25 GMT'}, {'version': 'v2', 'created': 'Tue, 28 May 2019 06:18:42 GMT'}]",2020-06-16,"[['Nasrabadi', 'Morteza Zakeri', ''], ['Parsa', 'Saeed', ''], ['Kalaee', 'Akram', '']]","['Test data generation', 'File format fuzzing', 'Code coverage', 'Neural']"
8119,2008.08636,Fareed Qararyah,"Fareed Qararyah, Mohamed Wahib, Do\u{g}a Dikbay{\i}r, Mehmet Esat
  Belviranli, Didem Unat","A Computational-Graph Partitioning Method for Training
  Memory-Constrained DNNs",,,10.1016/j.parco.2021.102792,,cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Many state-of-the-art Deep Neural Networks (DNNs) have substantial memory
requirements. Limited device memory becomes a bottleneck when training those
models. We propose ParDNN, an automatic, generic, and non-intrusive
partitioning strategy for DNNs that are represented as computational graphs.
ParDNN decides a placement of DNN's underlying computational graph operations
across multiple devices so that the devices' memory constraints are met and the
training time is minimized. ParDNN is completely independent of the deep
learning aspects of a DNN. It requires no modification neither at the model nor
at the systems level implementation of its operation kernels. ParDNN partitions
DNNs having billions of parameters and hundreds of thousands of operations in
seconds to few minutes. Our experiments with TensorFlow on 16 GPUs demonstrate
efficient training of 5 very large models while achieving superlinear scaling
for both the batch size and training throughput. ParDNN either outperforms or
qualitatively improves upon the related work.
","[{'version': 'v1', 'created': 'Wed, 19 Aug 2020 19:09:04 GMT'}, {'version': 'v2', 'created': 'Wed, 5 May 2021 11:26:25 GMT'}]",2021-05-06,"[['Qararyah', 'Fareed', ''], ['Wahib', 'Mohamed', ''], ['Dikbayır', 'Doğa', ''], ['Belviranli', 'Mehmet Esat', ''], ['Unat', 'Didem', '']]","['DNN', 'graph partitioning', 'model parallelism']"
8120,2107.13782,Anil Rahate,"Anil Rahate, Rahee Walambe, Sheela Ramanna, Ketan Kotecha","Multimodal Co-learning: Challenges, Applications with Datasets, Recent
  Advances and Future Directions","This is published in Information Fusion Journal and published copy
  can be downloaded from https://authors.elsevier.com/c/1eIVS5a7-Gls0Y for 50
  days. https://www.sciencedirect.com/science/article/pii/S1566253521002530",Information Fusion 81(2022) 203-239,10.1016/j.inffus.2021.12.003,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Multimodal deep learning systems which employ multiple modalities like text,
image, audio, video, etc., are showing better performance in comparison with
individual modalities (i.e., unimodal) systems. Multimodal machine learning
involves multiple aspects: representation, translation, alignment, fusion, and
co-learning. In the current state of multimodal machine learning, the
assumptions are that all modalities are present, aligned, and noiseless during
training and testing time. However, in real-world tasks, typically, it is
observed that one or more modalities are missing, noisy, lacking annotated
data, have unreliable labels, and are scarce in training or testing and or
both. This challenge is addressed by a learning paradigm called multimodal
co-learning. The modeling of a (resource-poor) modality is aided by exploiting
knowledge from another (resource-rich) modality using transfer of knowledge
between modalities, including their representations and predictive models.
Co-learning being an emerging area, there are no dedicated reviews explicitly
focusing on all challenges addressed by co-learning. To that end, in this work,
we provide a comprehensive survey on the emerging area of multimodal
co-learning that has not been explored in its entirety yet. We review
implementations that overcome one or more co-learning challenges without
explicitly considering them as co-learning challenges. We present the
comprehensive taxonomy of multimodal co-learning based on the challenges
addressed by co-learning and associated implementations. The various techniques
employed to include the latest ones are reviewed along with some of the
applications and datasets. Our final goal is to discuss challenges and
perspectives along with the important ideas and directions for future work that
we hope to be beneficial for the entire research community focusing on this
exciting domain.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2021 07:25:21 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Dec 2021 15:04:06 GMT'}, {'version': 'v3', 'created': 'Tue, 4 Jan 2022 14:12:17 GMT'}]",2022-01-19,"[['Rahate', 'Anil', ''], ['Walambe', 'Rahee', ''], ['Ramanna', 'Sheela', ''], ['Kotecha', 'Ketan', '']]","['Multimodal co-learning', 'Multimodal deep learning', 'Missing modalities', 'Multimodal taxonomy', 'Multimodal datasets']"
8121,2202.03930,Boyue Caroline Hu Miss,"Boyue Caroline Hu, Lina Marsso, Krzysztof Czarnecki, Rick Salay,
  Huakun Shen, Marsha Chechik","If a Human Can See It, So Should Your System: Reliability Requirements
  for Machine Vision Components",,,10.1145/3510003.3510109,,cs.SE cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Machine Vision Components (MVC) are becoming safety-critical. Assuring their
quality, including safety, is essential for their successful deployment.
Assurance relies on the availability of precisely specified and, ideally,
machine-verifiable requirements. MVCs with state-of-the-art performance rely on
machine learning (ML) and training data but largely lack such requirements.
  In this paper, we address the need for defining machine-verifiable
reliability requirements for MVCs against transformations that simulate the
full range of realistic and safety-critical changes in the environment. Using
human performance as a baseline, we define reliability requirements as: 'if the
changes in an image do not affect a human's decision, neither should they
affect the MVC's.' To this end, we provide: (1) a class of safety-related image
transformations; (2) reliability requirement classes to specify
correctness-preservation and prediction-preservation for MVCs; (3) a method to
instantiate machine-verifiable requirements from these requirements classes
using human performance experiment data; (4) human performance experiment data
for image recognition involving eight commonly used transformations, from about
2000 human participants; and (5) a method for automatically checking whether an
MVC satisfies our requirements. Further, we show that our reliability
requirements are feasible and reusable by evaluating our methods on 13
state-of-the-art pre-trained image classification models. Finally, we
demonstrate that our approach detects reliability gaps in MVCs that other
existing methods are unable to detect.
","[{'version': 'v1', 'created': 'Tue, 8 Feb 2022 15:26:18 GMT'}]",2022-02-09,"[['Hu', 'Boyue Caroline', ''], ['Marsso', 'Lina', ''], ['Czarnecki', 'Krzysztof', ''], ['Salay', 'Rick', ''], ['Shen', 'Huakun', ''], ['Chechik', 'Marsha', '']]","['Software Engineering for Artificial Intelligence', 'Requirements Engineering', 'Software Analysis', 'Machine Learning', 'Computer Vision']"
8122,2205.09032,Laura Stegner,Laura Stegner and Bilge Mutlu,"Designing for Caregiving: Integrating Robotic Assistance in Senior
  Living Communities","14 pages, 9 figures","Designing Interactive Systems Conference (DIS '22), June 13-17,
  2022, Virtual Event, Australia",10.1145/3532106.3533536,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robots hold significant promise to assist with providing care to an aging
population and to help overcome increasing caregiver demands. Although a large
body of research has explored robotic assistance for individuals with
disabilities and age-related challenges, this past work focuses primarily on
building robotic capabilities for assistance and has not yet fully considered
how these capabilities could be used by professional caregivers. To better
understand the workflows and practices of caregivers who support aging
populations and to determine how robotic assistance can be integrated into
their work, we conducted a field study using ethnographic and co-design methods
in a senior living community. From our results, we created a set of design
opportunities for robotic assistance, which we organized into three different
parts: supporting caregiver workflows, adapting to resident abilities, and
providing feedback to all stakeholders of the interaction.
","[{'version': 'v1', 'created': 'Wed, 18 May 2022 16:10:18 GMT'}]",2022-05-20,"[['Stegner', 'Laura', ''], ['Mutlu', 'Bilge', '']]","['human-robot interaction', 'care robot', 'caregiving', 'field study', 'designrecommendations']"
8123,2101.12393,Stephen MacDonell,"Jim Buchan, Ling Li, Stephen G. MacDonell","Causal Factors, Benefits and Challenges of Test-Driven Development:
  Practitioner Perceptions","Conference, 10 pages, 2 figures","Proceedings of the 18th Asia-Pacific Software Engineering
  Conference (APSEC 2011). Hochiminh City, Vietnam, IEEE Computer Society
  Press, pp.405-413",10.1109/APSEC.2011.44,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This report describes the experiences of one organization's adoption of Test
Driven Development (TDD) practices as part of a medium-term software project
employing Extreme Programming as a methodology. Three years into this project
the team's TDD experiences are compared with their non-TDD experiences on other
ongoing projects. The perceptions of the benefits and challenges of using TDD
in this context are gathered through five semi-structured interviews with key
team members. Their experiences indicate that use of TDD has generally been
positive and the reasons for this are explored to deepen the understanding of
TDD practice and its effects on code quality, application quality and
development productivity. Lessons learned are identified to aid others with the
adoption and implementation of TDD practices, and some potential further
research areas are suggested.
","[{'version': 'v1', 'created': 'Fri, 29 Jan 2021 04:10:21 GMT'}]",2021-02-01,"[['Buchan', 'Jim', ''], ['Li', 'Ling', ''], ['MacDonell', 'Stephen G.', '']]","['test-driven development (TDD)', 'TDD benefits', 'TDD challenges', 'causal network']"
8124,2106.01583,Meng Jiang,Meng Jiang,"Cross-Network Learning with Partially Aligned Graph Convolutional
  Networks","9 pages, 8 figures, KDD 2021",,10.1145/3447548.3467282,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Graph neural networks have been widely used for learning representations of
nodes for many downstream tasks on graph data. Existing models were designed
for the nodes on a single graph, which would not be able to utilize information
across multiple graphs. The real world does have multiple graphs where the
nodes are often partially aligned. For examples, knowledge graphs share a
number of named entities though they may have different relation schema;
collaboration networks on publications and awarded projects share some
researcher nodes who are authors and investigators, respectively; people use
multiple web services, shopping, tweeting, rating movies, and some may register
the same email account across the platforms. In this paper, I propose partially
aligned graph convolutional networks to learn node representations across the
models. I investigate multiple methods (including model sharing,
regularization, and alignment reconstruction) as well as theoretical analysis
to positively transfer knowledge across the (small) set of partially aligned
nodes. Extensive experiments on real-world knowledge graphs and collaboration
networks show the superior performance of our proposed methods on relation
classification and link prediction.
","[{'version': 'v1', 'created': 'Thu, 3 Jun 2021 04:07:26 GMT'}]",2021-06-04,"[['Jiang', 'Meng', '']]","['Transfer Learning', 'Graph Neural Network', 'Representation Learning']"
8125,2107.12533,Matthew Guzdial,Zisen Zhou and Matthew Guzdial,Toward Co-creative Dungeon Generation via Transfer Learning,"7 pages, 6 figures, Workshop on Procedural Content Generation","Proceedings of the Twelfth Workshop on Procedural Content
  Generation 2021",10.1145/3472538.3472601,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Co-creative Procedural Content Generation via Machine Learning (PCGML) refers
to systems where a PCGML agent and a human work together to produce output
content. One of the limitations of co-creative PCGML is that it requires
co-creative training data for a PCGML agent to learn to interact with humans.
However, acquiring this data is a difficult and time-consuming process. In this
work, we propose approximating human-AI interaction data and employing transfer
learning to adapt learned co-creative knowledge from one game to a different
game. We explore this approach for co-creative Zelda dungeon room generation.
","[{'version': 'v1', 'created': 'Tue, 27 Jul 2021 00:54:55 GMT'}]",2021-07-28,"[['Zhou', 'Zisen', ''], ['Guzdial', 'Matthew', '']]","['datasets', 'neural networks', 'transfer learning', 'Co-creative PCG']"
8126,1912.08715,Miikka Vilander,"Lauri Hella, Miikka Vilander",Formula size games for modal logic and $\mu$-calculus,"This is a preprint of an article published in Journal of Logic and
  Computation Published by Oxford University Press. arXiv admin note:
  substantial text overlap with arXiv:1604.07225","Journal of Logic and Computation, exz025, Oxford University Press,
  2019",10.1093/logcom/exz025,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  We propose a new version of formula size game for modal logic. The game
characterizes the equivalence of pointed Kripke-models up to formulas of given
numbers of modal operators and binary connectives. Our game is similar to the
well-known Adler-Immerman game. However, due to a crucial difference in the
definition of positions of the game, its winning condition is simpler, and the
second player does not have a trivial optimal strategy. Thus, unlike the
Adler-Immerman game, our game is a genuine two-person game. We illustrate the
use of the game by proving a non-elementary succinctness gap between
bisimulation invariant first-order logic $\mathrm{FO}$ and (basic) modal logic
$\mathrm{ML}$. We also present a version of the game for the modal
$\mu$-calculus $\mathrm{L}_\mu$ and show that $\mathrm{FO}$ is also
non-elementarily more succinct than $\mathrm{L}_\mu$.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2019 06:39:49 GMT'}]",2019-12-19,"[['Hella', 'Lauri', ''], ['Vilander', 'Miikka', '']]","['Succinctness', 'formula size game', 'modal logic', 'modal µ-calculus', 'bisimulation invariant first-order logic']"
8127,2007.10058,Surabhi Nath,"Surabhi S. Nath, Vishaal Udandarao, Jainendra Shukla","It's LeVAsa not LevioSA! Latent Encodings for Valence-Arousal Structure
  Alignment","5 pages, 4 figures and 3 tables",,10.1145/3430984.3431037,,cs.AI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, great strides have been made in the field of affective
computing. Several models have been developed to represent and quantify
emotions. Two popular ones include (i) categorical models which represent
emotions as discrete labels, and (ii) dimensional models which represent
emotions in a Valence-Arousal (VA) circumplex domain. However, there is no
standard for annotation mapping between the two labelling methods. We build a
novel algorithm for mapping categorical and dimensional model labels using
annotation transfer across affective facial image datasets. Further, we utilize
the transferred annotations to learn rich and interpretable data
representations using a variational autoencoder (VAE). We present ""LeVAsa"", a
VAE model that learns implicit structure by aligning the latent space with the
VA space. We evaluate the efficacy of LeVAsa by comparing performance with the
Vanilla VAE using quantitative and qualitative analysis on two benchmark
affective image datasets. Our results reveal that LeVAsa achieves high
latent-circumplex alignment which leads to improved downstream categorical
emotion prediction. The work also demonstrates the trade-off between degree of
alignment and quality of reconstructions.
","[{'version': 'v1', 'created': 'Mon, 20 Jul 2020 12:52:26 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Oct 2020 22:40:30 GMT'}, {'version': 'v3', 'created': 'Mon, 30 Nov 2020 18:24:01 GMT'}]",2020-12-01,"[['Nath', 'Surabhi S.', ''], ['Udandarao', 'Vishaal', ''], ['Shukla', 'Jainendra', '']]","['Affective computing', 'representation learning', 'variational autoencoder', 'valence', 'arousal', 'circumplex model']"
8128,2012.06511,Donghwan Shin,"Fitash Ul Haq, Donghwan Shin, Lionel C. Briand, Thomas Stifter, Jun
  Wang","Automatic Test Suite Generation for Key-Points Detection DNNs using
  Many-Objective Search (Experience Paper)",to appear in ISSTA 2021,,10.1145/3460319.3464802,,cs.CV cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatically detecting the positions of key-points (e.g., facial key-points
or finger key-points) in an image is an essential problem in many applications,
such as driver's gaze detection and drowsiness detection in automated driving
systems. With the recent advances of Deep Neural Networks (DNNs), Key-Points
detection DNNs (KP-DNNs) have been increasingly employed for that purpose.
Nevertheless, KP-DNN testing and validation have remained a challenging problem
because KP-DNNs predict many independent key-points at the same time -- where
each individual key-point may be critical in the targeted application -- and
images can vary a great deal according to many factors.
  In this paper, we present an approach to automatically generate test data for
KP-DNNs using many-objective search. In our experiments, focused on facial
key-points detection DNNs developed for an industrial automotive application,
we show that our approach can generate test suites to severely mispredict, on
average, more than 93% of all key-points. In comparison, random search-based
test data generation can only severely mispredict 41% of them. Many of these
mispredictions, however, are not avoidable and should not therefore be
considered failures. We also empirically compare state-of-the-art,
many-objective search algorithms and their variants, tailored for test suite
generation. Furthermore, we investigate and demonstrate how to learn specific
conditions, based on image characteristics (e.g., head posture and skin color),
that lead to severe mispredictions. Such conditions serve as a basis for risk
analysis or DNN retraining.
","[{'version': 'v1', 'created': 'Fri, 11 Dec 2020 17:28:03 GMT'}, {'version': 'v2', 'created': 'Tue, 25 May 2021 17:11:38 GMT'}]",2021-05-26,"[['Haq', 'Fitash Ul', ''], ['Shin', 'Donghwan', ''], ['Briand', 'Lionel C.', ''], ['Stifter', 'Thomas', ''], ['Wang', 'Jun', '']]","['Key-point detection', 'deep neural network', 'software testing', 'manyobjective search algorithm']"
8129,2210.08714,Sunjae Yoon,"Sunjae Yoon, Ji Woo Hong, Eunseop Yoon, Dahyun Kim, Junyeong Kim, Hee
  Suk Yoon, and Chang D. Yoo",Selective Query-guided Debiasing for Video Corpus Moment Retrieval,"16 pages, 6 figures, Accepted in ECCV 2022","In European Conference on Computer Vision (pp. 185-200). Springer,
  Cham (2022)",10.1007/978-3-031-20059-5_11,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video moment retrieval (VMR) aims to localize target moments in untrimmed
videos pertinent to a given textual query. Existing retrieval systems tend to
rely on retrieval bias as a shortcut and thus, fail to sufficiently learn
multi-modal interactions between query and video. This retrieval bias stems
from learning frequent co-occurrence patterns between query and moments, which
spuriously correlate objects (e.g., a pencil) referred in the query with
moments (e.g., scene of writing with a pencil) where the objects frequently
appear in the video, such that they converge into biased moment predictions.
Although recent debiasing methods have focused on removing this retrieval bias,
we argue that these biased predictions sometimes should be preserved because
there are many queries where biased predictions are rather helpful. To
conjugate this retrieval bias, we propose a Selective Query-guided Debiasing
network (SQuiDNet), which incorporates the following two main properties: (1)
Biased Moment Retrieval that intentionally uncovers the biased moments inherent
in objects of the query and (2) Selective Query-guided Debiasing that performs
selective debiasing guided by the meaning of the query. Our experimental
results on three moment retrieval benchmarks (i.e., TVR, ActivityNet, DiDeMo)
show the effectiveness of SQuiDNet and qualitative analysis shows improved
interpretability.
","[{'version': 'v1', 'created': 'Mon, 17 Oct 2022 03:10:21 GMT'}, {'version': 'v2', 'created': 'Sat, 26 Nov 2022 09:09:51 GMT'}]",2022-11-29,"[['Yoon', 'Sunjae', ''], ['Hong', 'Ji Woo', ''], ['Yoon', 'Eunseop', ''], ['Kim', 'Dahyun', ''], ['Kim', 'Junyeong', ''], ['Yoon', 'Hee Suk', ''], ['Yoo', 'Chang D.', '']]","['video moment retrieval', 'retrieval bias', 'selective debiasing']"
8130,2006.13256,Dima Damen,"Dima Damen, Hazel Doughty, Giovanni Maria Farinella, Antonino Furnari,
  Evangelos Kazakos, Jian Ma, Davide Moltisanti, Jonathan Munro, Toby Perrett,
  Will Price, Michael Wray",Rescaling Egocentric Vision,"Accepted at the International Journal of Computer Vision (IJCV).
  Dataset available from: http://epic-kitchens.github.io/",,10.5523/bris.2g1n6qdydwa9u22shpxqzp0t8m,,cs.CV cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper introduces the pipeline to extend the largest dataset in
egocentric vision, EPIC-KITCHENS. The effort culminates in EPIC-KITCHENS-100, a
collection of 100 hours, 20M frames, 90K actions in 700 variable-length videos,
capturing long-term unscripted activities in 45 environments, using
head-mounted cameras. Compared to its previous version, EPIC-KITCHENS-100 has
been annotated using a novel pipeline that allows denser (54% more actions per
minute) and more complete annotations of fine-grained actions (+128% more
action segments). This collection enables new challenges such as action
detection and evaluating the ""test of time"" - i.e. whether models trained on
data collected in 2018 can generalise to new footage collected two years later.
The dataset is aligned with 6 challenges: action recognition (full and weak
supervision), action detection, action anticipation, cross-modal retrieval
(from captions), as well as unsupervised domain adaptation for action
recognition. For each challenge, we define the task, provide baselines and
evaluation metrics
","[{'version': 'v1', 'created': 'Tue, 23 Jun 2020 18:28:04 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Jan 2021 20:11:27 GMT'}, {'version': 'v3', 'created': 'Sat, 13 Feb 2021 11:11:01 GMT'}, {'version': 'v4', 'created': 'Fri, 17 Sep 2021 17:17:48 GMT'}]",2021-09-20,"[['Damen', 'Dima', ''], ['Doughty', 'Hazel', ''], ['Farinella', 'Giovanni Maria', ''], ['Furnari', 'Antonino', ''], ['Kazakos', 'Evangelos', ''], ['Ma', 'Jian', ''], ['Moltisanti', 'Davide', ''], ['Munro', 'Jonathan', ''], ['Perrett', 'Toby', ''], ['Price', 'Will', ''], ['Wray', 'Michael', '']]","['Video Dataset', 'Egocentric Vision', 'FirstPerson Vision', 'Action Understanding', 'Multi-BenchmarkLarge-Scale Dataset', 'Annotation Quality']"
8131,2205.12721,Ketan Mittal,"Jean-Sylvain Camier, Veselin Dobrev, Patrick Knupp, Tzanio Kolev,
  Ketan Mittal, Robert Rieben, and Vladimir Tomov","Accelerating High-Order Mesh Optimization Using Finite Element Partial
  Assembly on GPUs","28 pages, 10 figures, 3 tables",,10.1016/j.jcp.2022.111808,,cs.MS cs.DC physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a new GPU-oriented mesh optimization method based on
high-order finite elements. Our approach relies on node movement with fixed
topology, through the Target-Matrix Optimization Paradigm (TMOP) and uses a
global nonlinear solve over the whole computational mesh, i.e., all mesh nodes
are moved together. A key property of the method is that the mesh optimization
process is recast in terms of finite element operations, which allows us to
utilize recent advances in the field of GPU-accelerated high-order finite
element algorithms. For example, we reduce data motion by using tensor
factorization and matrix-free methods, which have superior performance
characteristics compared to traditional full finite element matrix assembly and
offer advantages for GPU-based HPC hardware. We describe the major mathematical
components of the method along with their efficient GPU-oriented
implementation. In addition, we propose an easily reproducible mesh
optimization test that can serve as a performance benchmark for the mesh
optimization community.
","[{'version': 'v1', 'created': 'Tue, 24 May 2022 00:50:44 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Dec 2022 00:39:59 GMT'}]",2022-12-28,"[['Camier', 'Jean-Sylvain', ''], ['Dobrev', 'Veselin', ''], ['Knupp', 'Patrick', ''], ['Kolev', 'Tzanio', ''], ['Mittal', 'Ketan', ''], ['Rieben', 'Robert', ''], ['Tomov', 'Vladimir', '']]","['mesh optimization', 'GPUs', 'performance benchmark', 'finite elements', 'curved']"
8132,1902.04954,Yan Wang,"Yan Wang, Xuelei Sherry Ni","Risk Prediction of Peer-to-Peer Lending Market by a LSTM Model with
  Macroeconomic Factor",,,10.1145/3374135.3385287,,cs.LG q-fin.GN stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the peer to peer (P2P) lending platform, investors hope to maximize their
return while minimizing the risk through a comprehensive understanding of the
P2P market. A low and stable average default rate across all the borrowers
denotes a healthy P2P market and provides investors more confidence in a
promising investment. Therefore, having a powerful model to describe the trend
of the default rate in the P2P market is crucial. Different from previous
studies that focus on modeling the default rate at the individual level, in
this paper, we are the first to comprehensively explore the monthly trend of
the default rate at the aggregative level for the P2P data from October 2007 to
January 2016 in the US. We use the long short term memory (LSTM) approach to
sequentially predict the default risk of the borrowers in Lending Club, which
is the largest P2P lending platform in the US. Although being first applied in
modeling the P2P sequential data, the LSTM approach shows its great potential
by outperforming traditionally utilized time series models in our experiments.
Furthermore, incorporating the macroeconomic feature \textit{unemp\_rate}
(i.e., unemployment rate) can improve the LSTM performance by decreasing RMSE
on both the training and the testing datasets. Our study can broaden the
applications of the LSTM algorithm by using it on the sequential P2P data and
guide the investors in making investment strategies.
","[{'version': 'v1', 'created': 'Wed, 13 Feb 2019 15:42:27 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Sep 2020 20:08:49 GMT'}]",2020-09-11,"[['Wang', 'Yan', ''], ['Ni', 'Xuelei Sherry', '']]","['LSTM', 'Long short-term memory', 'Macroeconomic factor', 'Risk prediction', 'P2P lending']"
8133,2012.13618,Sepideh Maleki,"Sepideh Maleki, Udit Agarwal, Martin Burtscher, Keshav Pingali",BiPart: A Parallel and Deterministic Multilevel Hypergraph Partitioner,Accepted for publication at PPoPP21,,10.1145/3437801.3441611,,cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Hypergraph partitioning is used in many problem domains including VLSI
design, linear algebra, Boolean satisfiability, and data mining. Most versions
of this problem are NP-complete or NP-hard, so practical hypergraph
partitioners generate approximate partitioning solutions for all but the
smallest inputs. One way to speed up hypergraph partitioners is to exploit
parallelism. However, existing parallel hypergraph partitioners are not
deterministic, which is considered unacceptable in domains like VLSI design
where the same partitions must be produced every time a given hypergraph is
partitioned.
  In this paper, we describe BiPart, the first deterministic, parallel
hypergraph partitioner. Experimental results show that BiPart outperforms
state-of-the-art hypergraph partitioners in runtime and partition quality while
generating partitions deterministically.
","[{'version': 'v1', 'created': 'Fri, 25 Dec 2020 19:50:11 GMT'}]",2020-12-29,"[['Maleki', 'Sepideh', ''], ['Agarwal', 'Udit', ''], ['Burtscher', 'Martin', ''], ['Pingali', 'Keshav', '']]","['Hypergraph Partitioning', 'Parallelism', 'Deterministic Partitioning']"
8134,1601.05003,Florent Foucaud,Florent Foucaud and Ralf Klasing,"Parameterized and approximation complexity of the detection pair problem
  in graphs",13 pages,"Journal of Graph Algorithms and Applications 21(6):1039-1056, 2017",10.7155/jgaa.00449,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the complexity of the problem DETECTION PAIR. A detection pair of a
graph $G$ is a pair $(W,L)$ of sets of detectors with $W\subseteq V(G)$, the
watchers, and $L\subseteq V(G)$, the listeners, such that for every pair $u,v$
of vertices that are not dominated by a watcher of $W$, there is a listener of
$L$ whose distances to $u$ and to $v$ are different. The goal is to minimize
$|W|+|L|$. This problem generalizes the two classic problems DOMINATING SET and
METRIC DIMENSION, that correspond to the restrictions $L=\emptyset$ and
$W=\emptyset$, respectively. DETECTION PAIR was recently introduced by Finbow,
Hartnell and Young [A. S. Finbow, B. L. Hartnell and J. R. Young. The
complexity of monitoring a network with both watchers and listeners.
Manuscript, 2015], who proved it to be NP-complete on trees, a surprising
result given that both DOMINATING SET and METRIC DIMENSION are known to be
linear-time solvable on trees. It follows from an existing reduction by Hartung
and Nichterlein for METRIC DIMENSION that even on bipartite subcubic graphs of
arbitrarily large girth, DETECTION PAIR is NP-hard to approximate within a
sub-logarithmic factor and W[2]-hard (when parameterized by solution size). We
show, using a reduction to SET COVER, that DETECTION PAIR is approximable
within a factor logarithmic in the number of vertices of the input graph. Our
two main results are a linear-time $2$-approximation algorithm and an FPT
algorithm for DETECTION PAIR on trees.
","[{'version': 'v1', 'created': 'Tue, 19 Jan 2016 17:20:40 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Jan 2018 07:00:24 GMT'}]",2018-01-31,"[['Foucaud', 'Florent', ''], ['Klasing', 'Ralf', '']]","['Graph theory', 'Detection pair', 'Metric dimension', 'Dominating set', 'Approximation algorithm', 'Parameterized complexity']"
8135,2008.05209,Lei Shi,"Ahmed Alamri, Zhongtian Sun, Alexandra I. Cristea, Gautham
  Senthilnathan, Lei Shi, Craig Stewart","Is MOOC Learning Different for Dropouts? A Visually-Driven,
  Multi-granularity Explanatory ML Approach","Intelligent Tutoring Systems. ITS 2020. Lecture Notes in Computer
  Science, vol 12149",,10.1007/978-3-030-49663-0_42,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Millions of people have enrolled and enrol (especially in the Covid-19
pandemic world) in MOOCs. However, the retention rate of learners is
notoriously low. The majority of the research work on this issue focuses on
predicting the dropout rate, but very few use explainable learning patterns as
part of this analysis. However, visual representation of learning patterns
could provide deeper insights into learners' behaviour across different
courses, whilst numerical analyses can -- and arguably, should -- be used to
confirm the latter. Thus, this paper proposes and compares different
granularity visualisations for learning patterns (based on clickstream data)
for both course completers and non-completers. In the large-scale MOOCs we
analysed, across various domains, our fine-grained, fish-eye visualisation
approach showed that non-completers are more likely to jump forward in their
learning sessions, often on a 'catch-up' path, whilst completers exhibit linear
behaviour. For coarser, bird-eye granularity visualisation, we observed
learners' transition between types of learning activity, obtaining typed
transition graphs. The results, backed up by statistical significance analysis
and machine learning, provide insights for course instructors to maintain
engagement of learners by adapting the course design to not just 'dry'
predicted values, but explainable, visually viable paths extracted.
","[{'version': 'v1', 'created': 'Wed, 12 Aug 2020 09:59:18 GMT'}]",2020-08-13,"[['Alamri', 'Ahmed', ''], ['Sun', 'Zhongtian', ''], ['Cristea', 'Alexandra I.', ''], ['Senthilnathan', 'Gautham', ''], ['Shi', 'Lei', ''], ['Stewart', 'Craig', '']]","['Learning Analytics', 'Visualisation', 'MOOCs', 'Behavioural Pattern', 'Machine Learning']"
8136,2106.07318,Qi Zhao,"Bai Yan, Qi Zhao, Jin Zhang, J. Andrew Zhang, Xin Yao","Multiobjective Bilevel Evolutionary Approach for Off-Grid
  Direction-of-Arrival Estimation",This paper has been submitted to an Elsevier journal for peer-review,"Applied Soft Computing, 2021(113):107954",10.1016/j.asoc.2021.107954,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The source number identification is an essential step in direction-of-arrival
(DOA) estimation. Existing methods may provide a wrong source number due to
inferior statistical properties (in low SNR or limited snapshots) or modeling
errors (caused by relaxing sparse penalties), especially in impulsive noise. To
address this issue, we propose a novel idea of simultaneous source number
identification and DOA estimation. We formulate a multiobjective off-grid DOA
estimation model to realize this idea, by which the source number can be
automatically identified together with DOA estimation. In particular, the
source number is properly exploited by the $l_0$ norm of impinging signals
without relaxations, guaranteeing accuracy. Furthermore, we design a
multiobjective bilevel evolutionary algorithm to solve the proposed model. The
source number identification and sparse recovery are simultaneously optimized
at the on-grid (lower) level. A forward search strategy is developed to further
refine the grid at the off-grid (upper) level. This strategy does not need
linear approximations and can eliminate the off-grid gap with low computational
complexity. Simulation results demonstrate the outperformance of our method in
terms of source number and root mean square error.
","[{'version': 'v1', 'created': 'Mon, 14 Jun 2021 11:44:03 GMT'}]",2021-10-15,"[['Yan', 'Bai', ''], ['Zhao', 'Qi', ''], ['Zhang', 'Jin', ''], ['Zhang', 'J. Andrew', ''], ['Yao', 'Xin', '']]","['Off-grid direction-of-arrival (DOA) estimation', 'evolutionaryalgorithm', 'multiobjective optimization', 'impulsive noise']"
8137,2106.03355,Yanchuan Chang,"Yanchuan Chang, Jianzhong Qi, Egemen Tanin, Xingjun Ma, Hanan Samet",Sub-trajectory Similarity Join with Obfuscation,,,10.1145/3468791.3468822,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  User trajectory data is becoming increasingly accessible due to the
prevalence of GPS-equipped devices such as smartphones. Many existing studies
focus on querying trajectories that are similar to each other in their
entirety. We observe that trajectories partially similar to each other contain
useful information about users' travel patterns which should not be ignored.
Such partially similar trajectories are critical in applications such as
epidemic contact tracing. We thus propose to query trajectories that are within
a given distance range from each other for a given period of time. We formulate
this problem as a sub-trajectory similarity join query named as the STS-Join.
We further propose a distributed index structure and a query algorithm for
STS-Join, where users retain their raw location data and only send obfuscated
trajectories to a server for query processing. This helps preserve user
location privacy which is vital when dealing with such data. Theoretical
analysis and experiments on real data confirm the effectiveness and the
efficiency of our proposed index structure and query algorithm.
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2021 06:08:06 GMT'}]",2021-09-21,"[['Chang', 'Yanchuan', ''], ['Qi', 'Jianzhong', ''], ['Tanin', 'Egemen', ''], ['Ma', 'Xingjun', ''], ['Samet', 'Hanan', '']]","['Trajectory join', 'trajectory similarity', 'spatio-temporal indexing']"
8138,2211.00061,Daniel Berleant,John J. Forbus and Daniel Berleant,Discrete-Event Simulation in Healthcare Settings: a Review,Preprint of the article,"Modelling 3, no. 4: 417-433 (2022)",10.3390/modelling3040027,,cs.CY cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We review and define the current state of the art as relating to discrete
event simulation in healthcare-related systems. A review of published
literature over the past five years (2017 - 2021) was conducted, building upon
previously published work. PubMed and EBSCOhost were searched for journal
articles on discrete event simulation in healthcare resulting in identification
of 933 unique articles. Of these about half were excluded at the title/abstract
level and 154 at the full text level, leaving 311 papers to analyze. These were
categorized, then analyzed by category and collectively to identify publication
volume over time, disease focus, activity levels by coun-try, software systems
used, and sizes of healthcare unit under study. A total of 1196 articles were
initially identified. This list was narrowed down to 311 for systematic review.
Following the schema from prior systematic reviews, the articles fell into four
broad categories: health care sys-tems operations (HCSO), disease progression
modeling (DPM), screening modeling (SM), and health behavior modeling (HBM). We
found that discrete event simulation in healthcare has con-tinued to increase
year-over-year, as well as expand into diverse areas of the healthcare system.
In addition, this study adds extra bibliometric dimensions to gain more insight
into the details and nuances of how and where simulation is being used in
healthcare.
","[{'version': 'v1', 'created': 'Thu, 20 Oct 2022 15:23:20 GMT'}]",2022-11-02,"[['Forbus', 'John J.', ''], ['Berleant', 'Daniel', '']]","['Discrete event simulation', 'Healthcare applications', 'Systematic review']"
8139,2008.04467,Mubin Ul Haque,"Mubin Ul Haque, Leonardo Horn Iwaya and M. Ali Babar","Challenges in Docker Development: A Large-scale Study Using Stack
  Overflow","11 pages, 3 Figures, conference",,10.1145/3382494.3410693,,cs.SE cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Docker technology has been increasingly used among software developers in a
multitude of projects. This growing interest is due to the fact that Docker
technology supports a convenient process for creating and building containers,
promoting close cooperation between developer and operations teams, and
enabling continuous software delivery. As a fast-growing technology, it is
important to identify the Docker-related topics that are most popular as well
as existing challenges and difficulties that developers face. This paper
presents a large-scale empirical study identifying practitioners' perspectives
on Docker technology by mining posts from the Stack Overflow (SoF) community.
Method: A dataset of 113,922 Docker-related posts was created based on a set of
relevant tags and contents. The dataset was cleaned and prepared. Topic
modelling was conducted using Latent Dirichlet Allocation (LDA), allowing the
identification of dominant topics in the domain. Our results show that most
developers use SoF to ask about a broad spectrum of Docker topics including
framework development, application deployment, continuous integration,
web-server configuration and many more. We determined that 30 topics that
developers discuss can be grouped into 13 main categories. Most of the posts
belong to categories of application development, configuration, and networking.
On the other hand, we find that the posts on monitoring status, transferring
data, and authenticating users are more popular among developers compared to
the other topics. Specifically, developers face challenges in web browser
issues, networking error and memory management. Besides, there is a lack of
experts in this domain. Our research findings will guide future work on the
development of new tools and techniques, helping the community to focus efforts
and understand existing trade-offs on Docker topics.
","[{'version': 'v1', 'created': 'Tue, 11 Aug 2020 01:19:23 GMT'}]",2020-08-12,"[['Haque', 'Mubin Ul', ''], ['Iwaya', 'Leonardo Horn', ''], ['Babar', 'M. Ali', '']]","['Docker', 'natural language processing', 'software engineering', 'miningsoftware repositories']"
8140,2005.07654,Asan Agibetov,"Asan Agibetov, Matthias Samwald","Benchmarking neural embeddings for link prediction in knowledge graphs
  under semantic and structural changes",,,10.1016/j.websem.2020.100590,,cs.AI cs.CL stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, link prediction algorithms based on neural embeddings have gained
tremendous popularity in the Semantic Web community, and are extensively used
for knowledge graph completion. While algorithmic advances have strongly
focused on efficient ways of learning embeddings, fewer attention has been
drawn to the different ways their performance and robustness can be evaluated.
In this work we propose an open-source evaluation pipeline, which benchmarks
the accuracy of neural embeddings in situations where knowledge graphs may
experience semantic and structural changes. We define relation-centric
connectivity measures that allow us to connect the link prediction capacity to
the structure of the knowledge graph. Such an evaluation pipeline is especially
important to simulate the accuracy of embeddings for knowledge graphs that are
expected to be frequently updated.
","[{'version': 'v1', 'created': 'Fri, 15 May 2020 17:15:45 GMT'}, {'version': 'v2', 'created': 'Thu, 28 May 2020 08:11:29 GMT'}]",2020-08-31,"[['Agibetov', 'Asan', ''], ['Samwald', 'Matthias', '']]","['knowledge graphs', 'neural embeddings', 'benchmarks', 'evaluation', 'link prediction']"
8141,2004.06389,Dwaipayan Roy,"Suraj Agrawal, Dwaipayan Roy, Mandar Mitra",Tag Embedding Based Personalized Point Of Interest Recommendation System,"To appear in Information Processing & Management, Volume 58, Issue 6,
  November 2021",,10.1016/j.ipm.2021.102690,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Personalized Point of Interest recommendation is very helpful for satisfying
users' needs at new places. In this article, we propose a tag embedding based
method for Personalized Recommendation of Point Of Interest. We model the
relationship between tags corresponding to Point Of Interest. The model
provides representative embedding corresponds to a tag in a way that related
tags will be closer. We model Point of Interest-based on tag embedding and also
model the users (user profile) based on the Point Of Interest rated by them.
finally, we rank the user's candidate Point Of Interest based on cosine
similarity between user's embedding and Point of Interest's embedding. Further,
we find the parameters required to model user by discrete optimizing over
different measures (like ndcg@5, MRR, ...). We also analyze the result while
considering the same parameters for all users and individual parameters for
each user. Along with it we also analyze the effect on the result while
changing the dataset to model the relationship between tags. Our method also
minimizes the privacy leak issue. We used TREC Contextual Suggestion 2016 Phase
2 dataset and have significant improvement over all the measures on the state
of the art method. It improves ndcg@5 by 12.8%, p@5 by 4.3%, and MRR by 7.8%,
which shows the effectiveness of the method.
","[{'version': 'v1', 'created': 'Tue, 14 Apr 2020 09:51:20 GMT'}, {'version': 'v2', 'created': 'Sat, 7 Aug 2021 16:20:22 GMT'}]",2021-08-10,"[['Agrawal', 'Suraj', ''], ['Roy', 'Dwaipayan', ''], ['Mitra', 'Mandar', '']]","['Information Retrieval', 'Contextual Suggestion', 'Recommender System']"
8142,2106.10614,Stephen MacDonell,Sherlock A. Licorish and Stephen G. MacDonell,"How do Globally Distributed Agile Teams Self-organise? Initial Insights
  from a Case Study","Conference paper, 7 pages, 4 tables","Proceedings of the 8th International Conference on Evaluation of
  Novel Approaches to Software Engineering (ENASE2013). Angers, France,
  SCITEPRESS, pp.157-164",10.5220/0004437001570164,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Agile software developers are required to self-organize, occupying various
informal roles as needed in order to successfully deliver software features.
However, previous research has reported conflicting evidence about the way
teams actually undertake this activity. The ability to self-organize is
particularly necessary for software development in globally distributed
environments, where distance has been shown to exacerbate human-centric issues.
Understanding the way successful teams self-organise should inform distributed
team composition strategies and software project governance. We have used
psycholinguistics to study the way IBM Rational Jazz practitioners enacted
various roles, expressed attitudes and shared competencies to successfully
self-organize in their global projects. Among our findings, we uncovered that
practitioners enacted various roles depending on their teams' cohort of
features; and that team leaders were most critical to IBM Jazz teams'
self-organisation. We discuss these findings and highlight their implications
for software project governance.
","[{'version': 'v1', 'created': 'Sun, 20 Jun 2021 04:17:24 GMT'}]",2021-06-22,"[['Licorish', 'Sherlock A.', ''], ['MacDonell', 'Stephen G.', '']]","['Software Development', 'Psycholinguistics', 'Jazz', 'Self-organising Roles', 'Attitudes and Competencies']"
8143,2206.15304,Simon X. Yang,"Zhiwei Yu, Kai Li, Yu Ji, Simon X. Yang","Designs, Motion Mechanism, Motion Coordination, and Communication of
  Bionic Robot Fishes: A Survey",,,10.20517/ir.2022.10,,cs.RO cs.AI cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  In the last few years, there have been many new developments and significant
accomplishments in the research of bionic robot fishes. However, in terms of
swimming performance, existing bionic robot fishes lag far behind fish,
prompting researchers to constantly develop innovative designs of various
bionic robot fishes. In this paper, the latest designs of robot fishes are
presented in detail, distinguished by the propulsion mode. New robot fishes
mainly include soft robot fishes and rigid-soft coupled robot fishes. The
latest progress in the study of the swimming mechanism is analyzed on the basis
of summarizing the main swimming theories of fish. The current state-of-the-art
research in the new field of motion coordination and communication of multiple
robot fishes is summarized. The general research trend in robot fishes is to
utilize more efficient and robust methods to best mimic real fish while
exhibiting superior swimming performance. The current challenges and potential
future research directions are discussed. Various methods are needed to narrow
the gap in swimming performance between robot fishes and fish. This paper is a
first step to bring together roboticists and marine biologists interested in
learning state-of-the-art research on bionic robot fishes.
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2022 14:17:20 GMT'}]",2022-07-01,"[['Yu', 'Zhiwei', ''], ['Li', 'Kai', ''], ['Ji', 'Yu', ''], ['Yang', 'Simon X.', '']]","['bionic robot fish', 'motion mechanism', 'motion coordination', 'group communication']"
8144,2301.08042,Bruno Oliveira,"B. Oliveira, C. T. Lopes","From 10 Blue Links Pages to Feature-Full Search Engine Results Pages --
  Analysis of the Temporal Evolution of SERP Features","8 pages, CHIIR 2023 Conference Short Paper",,10.1145/3576840.3578307,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web Search Engine Results Pages (SERP) are one of the most well-known and
used web pages. These pages have started as simple ``10 blue links'' pages, but
the information in SERP currently goes way beyond these links. Several features
have been included in these pages to complement organic and sponsored results
and attempt to provide answers to the query instead of just pointing to
websites that might deliver that information. In this work, we analyze the
appearance and evolution of SERP features in the two leading web search
engines, Google Search and Microsoft Bing. Using a sample of SERP from the
Internet Archive, we analyzed the appearance and evolution of these features.
We found that SERP are becoming more diverse in terms of elements, aggregating
content from different verticals and including more features that provide
direct answers.
","[{'version': 'v1', 'created': 'Thu, 19 Jan 2023 12:37:07 GMT'}]",2023-01-20,"[['Oliveira', 'B.', ''], ['Lopes', 'C. T.', '']]","['Search engines', 'SERP features', 'Web interfaces', 'Web design', 'Evolution']"
8145,2005.12392,Rahul Krishna,"Dongdong She, Rahul Krishna, Lu Yan, Suman Jana, Baishakhi Ray",MTFuzz: Fuzzing with a Multi-Task Neural Network,"ACM Joint European Software Engineering Conference and Symposium on
  the Foundations of Software Engineering (ESEC/FSE) 2020",,10.1145/3368089.3409723,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fuzzing is a widely used technique for detecting software bugs and
vulnerabilities. Most popular fuzzers generate new inputs using an evolutionary
search to maximize code coverage. Essentially, these fuzzers start with a set
of seed inputs, mutate them to generate new inputs, and identify the promising
inputs using an evolutionary fitness function for further mutation. Despite
their success, evolutionary fuzzers tend to get stuck in long sequences of
unproductive mutations. In recent years, machine learning (ML) based mutation
strategies have reported promising results. However, the existing ML-based
fuzzers are limited by the lack of quality and diversity of the training data.
As the input space of the target programs is high dimensional and sparse, it is
prohibitively expensive to collect many diverse samples demonstrating
successful and unsuccessful mutations to train the model. In this paper, we
address these issues by using a Multi-Task Neural Network that can learn a
compact embedding of the input space based on diverse training samples for
multiple related tasks (i.e., predicting for different types of coverage). The
compact embedding can guide the mutation process by focusing most of the
mutations on the parts of the embedding where the gradient is high. \tool
uncovers $11$ previously unseen bugs and achieves an average of $2\times$ more
edge coverage compared with 5 state-of-the-art fuzzer on 10 real-world
programs.
","[{'version': 'v1', 'created': 'Mon, 25 May 2020 20:39:59 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Sep 2020 04:22:34 GMT'}]",2020-09-14,"[['She', 'Dongdong', ''], ['Krishna', 'Rahul', ''], ['Yan', 'Lu', ''], ['Jana', 'Suman', ''], ['Ray', 'Baishakhi', '']]","['Graybox Fuzzing', 'Multi-task Neural Networks', 'Gradient-guidedOptimization', 'Transfer Learning']"
8146,2007.15091,Diyah Puspitaningrum,"Diyah Puspitaningrum, Julio Fernando, Edo Afriando, Ferzha Putra
  Utama, Rina Rahmadini, and Y. Pinata",Finding Local Experts for Dynamic Recommendations Using Lazy Random Walk,6 pages,"CITSM, Jakarta, Indonesia, 2019, pp. 1-6",10.1109/CITSM47753.2019.8965354,,cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Statistics based privacy-aware recommender systems make suggestions more
powerful by extracting knowledge from the log of social contacts interactions,
but unfortunately, they are static. Moreover, advice from local experts
effective in finding specific business categories in a particular area. We
propose a dynamic recommender algorithm based on a lazy random walk that
recommends top-rank shopping places to potentially interested visitors. We
consider local authority and topical authority. The algorithm tested on
FourSquare shopping data sets of 5 cities in Indonesia with k-steps of 5,7,9 of
(lazy) random walks and compared the results with other state-of-the-art
ranking techniques. The results show that it can reach high score precisions
(0.5, 0.37, and 0.26 respectively on precision at 1, precision at 3, and
precision at 5 for k=5). The algorithm also shows scalability concerning
execution time. The advantage of dynamicity is the database used to power the
recommender system; no need to be very frequently updated to produce a good
recommendation.
","[{'version': 'v1', 'created': 'Wed, 29 Jul 2020 20:23:41 GMT'}]",2020-07-31,"[['Puspitaningrum', 'Diyah', ''], ['Fernando', 'Julio', ''], ['Afriando', 'Edo', ''], ['Utama', 'Ferzha Putra', ''], ['Rahmadini', 'Rina', ''], ['Pinata', 'Y.', '']]","['recommender systems', 'local expert', 'lazy random']"
8147,2009.03288,Elisa Negrini,"Elisa Negrini, Giovanna Citti, Luca Capogna",System Identification Through Lipschitz Regularized Deep Neural Networks,,,10.1016/j.jcp.2021.110549,,cs.LG cs.NA math.DS math.NA stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we use neural networks to learn governing equations from data.
Specifically we reconstruct the right-hand side of a system of ODEs $\dot{x}(t)
= f(t, x(t))$ directly from observed uniformly time-sampled data using a neural
network. In contrast with other neural network based approaches to this
problem, we add a Lipschitz regularization term to our loss function. In the
synthetic examples we observed empirically that this regularization results in
a smoother approximating function and better generalization properties when
compared with non-regularized models, both on trajectory and non-trajectory
data, especially in presence of noise. In contrast with sparse regression
approaches, since neural networks are universal approximators, we don't need
any prior knowledge on the ODE system. Since the model is applied component
wise, it can handle systems of any dimension, making it usable for real-world
data.
","[{'version': 'v1', 'created': 'Mon, 7 Sep 2020 17:52:51 GMT'}]",2021-08-18,"[['Negrini', 'Elisa', ''], ['Citti', 'Giovanna', ''], ['Capogna', 'Luca', '']]","['Machine Learning', 'Deep Learning', 'System Identification', 'Ordinary Differential Equations', 'Generalization Gap', 'Regularized Network']"
8148,2103.11641,Elia Bonetto,"Elia Bonetto, Pascal Goldschmid, Michael Pabst, Michael J. Black and
  Aamir Ahmad",iRotate: Active Visual SLAM for Omnidirectional Robots,"15 pages, 14 figures, 3 tables. ACCEPTED for publication in Robotics
  and Autonomous Systems - Elsevier",,10.1016/j.robot.2022.104102,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present an active visual SLAM approach for omnidirectional
robots. The goal is to generate control commands that allow such a robot to
simultaneously localize itself and map an unknown environment while maximizing
the amount of information gained and consuming as low energy as possible.
Leveraging the robot's independent translation and rotation control, we
introduce a multi-layered approach for active V-SLAM. The top layer decides on
informative goal locations and generates highly informative paths to them. The
second and third layers actively re-plan and execute the path, exploiting the
continuously updated map and local features information. Moreover, we introduce
two utility formulations to account for the presence of obstacles in the field
of view and the robot's location. Through rigorous simulations, real robot
experiments, and comparisons with state-of-the-art methods, we demonstrate that
our approach achieves similar coverage results with lesser overall map entropy.
This is obtained while keeping the traversed distance up to 39% shorter than
the other methods and without increasing the wheels' total rotation amount.
Code and implementation details are provided as open-source, and all the
generated data is available on-line for consultation.
","[{'version': 'v1', 'created': 'Mon, 22 Mar 2021 08:00:56 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Jul 2021 07:31:14 GMT'}, {'version': 'v3', 'created': 'Wed, 8 Dec 2021 07:43:23 GMT'}, {'version': 'v4', 'created': 'Tue, 29 Mar 2022 09:28:53 GMT'}]",2022-04-08,"[['Bonetto', 'Elia', ''], ['Goldschmid', 'Pascal', ''], ['Pabst', 'Michael', ''], ['Black', 'Michael J.', ''], ['Ahmad', 'Aamir', '']]","['View Planning for SLAM', 'Vision-Based Navigation', 'SLAM']"
8149,2104.10301,Ryoji Tanabe,Ryoji Tanabe,"Towards Exploratory Landscape Analysis for Large-scale Optimization: A
  Dimensionality Reduction Framework","This is an accepted version of a paper published in the proceedings
  of GECCO 2021",,10.1145/3449639.3459300,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although exploratory landscape analysis (ELA) has shown its effectiveness in
various applications, most previous studies focused only on low- and
moderate-dimensional problems. Thus, little is known about the scalability of
the ELA approach for large-scale optimization. In this context, first, this
paper analyzes the computational cost of features in the flacco package. Our
results reveal that two important feature classes (ela_level and ela_meta)
cannot be applied to large-scale optimization due to their high computational
cost. To improve the scalability of the ELA approach, this paper proposes a
dimensionality reduction framework that computes features in a reduced
lower-dimensional space than the original solution space. We demonstrate that
the proposed framework can drastically reduce the computation time of ela_level
and ela_meta for large dimensions. In addition, the proposed framework can make
the cell-mapping feature classes scalable for large-scale optimization. Our
results also show that features computed by the proposed framework are
beneficial for predicting the high-level properties of the 24 large-scale BBOB
functions.
","[{'version': 'v1', 'created': 'Wed, 21 Apr 2021 01:16:57 GMT'}]",2021-04-22,"[['Tanabe', 'Ryoji', '']]","['Exploratory landscape analysis', 'fitness landscape analysis', 'largescale black-box optimization', 'dimensionality reduction']"
8150,2209.15248,Francesco Pirotti,"Daniele Michelini, Michele Dalponte, Angelo Carriero, Erico Kutchart,
  Salvatore Eugenio Pappalardo, Massimo De Marchi, Francesco Pirotti","Hyperspectral and LiDAR data for the prediction via machine learning of
  tree species, volume and biomass: a possible contribution for updating forest
  management plans",,,10.1007/978-3-031-17439-1_17,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  This work intends to lay the foundations for identifying the prevailing
forest types and the delineation of forest units within private forest
inventories in the Autonomous Province of Trento (PAT), using currently
available remote sensing solutions. In particular, data from LiDAR and
hyperspectral surveys of 2014 made available by PAT were acquired and
processed. Such studies are very important in the context of forest management
scenarios. The method includes defining tree species ground-truth by outlining
single tree crowns with polygons and labeling them. Successively two supervised
machine learning classifiers, K-Nearest Neighborhood and Support Vector Machine
(SVM) were used. The results show that, by setting specific hyperparameters,
the SVM methodology gave the best results in classification of tree species.
Biomass was estimated using canopy parameters and the Jucker equation for the
above ground biomass (AGB) and that of Scrinzi for the tariff volume. Predicted
values were compared with 11 field plots of fixed radius where volume and
biomass were field-estimated in 2017. Results show significant coefficients of
correlation: 0.94 for stem volume and 0.90 for total aboveground tree biomass.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2022 06:06:25 GMT'}]",2023-01-10,"[['Michelini', 'Daniele', ''], ['Dalponte', 'Michele', ''], ['Carriero', 'Angelo', ''], ['Kutchart', 'Erico', ''], ['Pappalardo', 'Salvatore Eugenio', ''], ['De Marchi', 'Massimo', ''], ['Pirotti', 'Francesco', '']]","['species classification', 'forest parameters', 'tree-crowns', 'remotesensing', 'earth observation', 'artificial intelligence']"
8151,1906.10217,Wolfgang Mulzer,Ke Chen and Adrian Dumitrescu and Wolfgang Mulzer and Csaba D. T\'oth,On the Stretch Factor of Polygonal Chains,"24 pages, 14 figures; a preliminary version appeared at MFCS 2019","SIAM Journal on Discrete Mathematics (SIDMA), 35(3), 2021, pp.
  1592-1614",10.1137/20M1335698,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $P=(p_1, p_2, \dots, p_n)$ be a polygonal chain in $\mathbb{R}^d$. The
stretch factor of $P$ is the ratio between the total length of $P$ and the
distance of its endpoints, $\sum_{i = 1}^{n-1} |p_i p_{i+1}|/|p_1 p_n|$. For a
parameter $c \geq 1$, we call $P$ a $c$-chain if $|p_ip_j|+|p_jp_k| \leq
c|p_ip_k|$, for every triple $(i,j,k)$, $1 \leq i<j<k \leq n$. The stretch
factor is a global property: it measures how close $P$ is to a straight line,
and it involves all the vertices of $P$; being a $c$-chain, on the other hand,
is a fingerprint-property: it only depends on subsets of $O(1)$ vertices of the
chain.
  We investigate how the $c$-chain property influences the stretch factor in
the plane: (i) we show that for every $\varepsilon > 0$, there is a noncrossing
$c$-chain that has stretch factor $\Omega(n^{1/2-\varepsilon})$, for
sufficiently large constant $c=c(\varepsilon)$; (ii) on the other hand, the
stretch factor of a $c$-chain $P$ is $O\left(n^{1/2}\right)$, for every
constant $c\geq 1$, regardless of whether $P$ is crossing or noncrossing; and
(iii) we give a randomized algorithm that can determine, for a polygonal chain
$P$ in $\mathbb{R}^2$ with $n$ vertices, the minimum $c\geq 1$ for which $P$ is
a $c$-chain in $O\left(n^{2.5}\ \mathrm{polylog}\ n\right)$ expected time and
$O(n\log n)$ space. These results generalize to $\mathbb{R}^d$. For every
dimension $d\geq 2$ and every $\varepsilon>0$, we construct a noncrossing
$c$-chain that has stretch factor
$\Omega\left(n^{(1-\varepsilon)(d-1)/d}\right)$; on the other hand, the stretch
factor of any $c$-chain is $O\left((n-1)^{(d-1)/d}\right)$; for every $c>1$, we
can test whether an $n$-vertex chain in $\mathbb{R}^d$ is a $c$-chain in
$O\left(n^{3-1/d}\ \mathrm{polylog}\ n\right)$ expected time and $O(n\log n)$
space.
","[{'version': 'v1', 'created': 'Mon, 24 Jun 2019 20:13:31 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Jan 2023 08:50:33 GMT'}]",2023-01-11,"[['Chen', 'Ke', ''], ['Dumitrescu', 'Adrian', ''], ['Mulzer', 'Wolfgang', ''], ['Tóth', 'Csaba D.', '']]","['polygonal chain', 'vertex dilation', 'Koch curve', 'recursive construction']"
8152,2004.02428,Zhou Huang,"Zhou Huang, Huai-Xin Chen, Tao Zhou, Yun-Zhi Yang, Chang-Yin Wang and
  Bi-Yuan Liu","Contrast-weighted Dictionary Learning Based Saliency Detection for
  Remote Sensing Images",,Pattern Recognition 2020,10.1016/j.patcog.2020.107757,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Object detection is an important task in remote sensing image analysis. To
reduce the computational complexity of redundant information and improve the
efficiency of image processing, visual saliency models have been widely applied
in this field. In this paper, a novel saliency detection model based on
Contrast-weighted Dictionary Learning (CDL) is proposed for remote sensing
images. Specifically, the proposed CDL learns salient and non-salient atoms
from positive and negative samples to construct a discriminant dictionary, in
which a contrast-weighted term is proposed to encourage the contrast-weighted
patterns to be present in the learned salient dictionary while discouraging
them from being present in the non-salient dictionary. Then, we measure the
saliency by combining the coefficients of the sparse representation (SR) and
reconstruction errors. Furthermore, by using the proposed joint saliency
measure, a variety of saliency maps are generated based on the discriminant
dictionary. Finally, a fusion method based on global gradient optimization is
proposed to integrate multiple saliency maps. Experimental results on four
datasets demonstrate that the proposed model outperforms other state-of-the-art
methods.
","[{'version': 'v1', 'created': 'Mon, 6 Apr 2020 06:49:05 GMT'}, {'version': 'v2', 'created': 'Sun, 10 May 2020 07:10:02 GMT'}]",2021-04-21,"[['Huang', 'Zhou', ''], ['Chen', 'Huai-Xin', ''], ['Zhou', 'Tao', ''], ['Yang', 'Yun-Zhi', ''], ['Wang', 'Chang-Yin', ''], ['Liu', 'Bi-Yuan', '']]","['Contrast-weighted dictionary', 'Dictionary learning', 'Gradient']"
8153,2208.06936,Sophia Althammer,"Sophia Althammer, Sebastian Hofst\""atter, Suzan Verberne, Allan
  Hanbury","TripJudge: A Relevance Judgement Test Collection for TripClick Health
  Retrieval",To be published at CIKM 2022 as resource paper,,10.1145/3511808.3557714,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Robust test collections are crucial for Information Retrieval research.
Recently there is a growing interest in evaluating retrieval systems for
domain-specific retrieval tasks, however these tasks often lack a reliable test
collection with human-annotated relevance assessments following the Cranfield
paradigm. In the medical domain, the TripClick collection was recently
proposed, which contains click log data from the Trip search engine and
includes two click-based test sets. However the clicks are biased to the
retrieval model used, which remains unknown, and a previous study shows that
the test sets have a low judgement coverage for the Top-10 results of lexical
and neural retrieval models. In this paper we present the novel, relevance
judgement test collection TripJudge for TripClick health retrieval. We collect
relevance judgements in an annotation campaign and ensure the quality and
reusability of TripJudge by a variety of ranking methods for pool creation, by
multiple judgements per query-document pair and by an at least moderate
inter-annotator agreement. We compare system evaluation with TripJudge and
TripClick and find that that click and judgement-based evaluation can lead to
substantially different system rankings.
","[{'version': 'v1', 'created': 'Sun, 14 Aug 2022 23:11:25 GMT'}]",2022-08-16,"[['Althammer', 'Sophia', ''], ['Hofstätter', 'Sebastian', ''], ['Verberne', 'Suzan', ''], ['Hanbury', 'Allan', '']]","['Test collections', 'health retrieval', 'relevance judgements']"
8154,2103.09728,Matias Martinez,"Bruno G\'ois Mateus, Matias Martinez, Christophe Kolski","Learning migration models for supporting incremental language migrations
  of software applications",,"Information and Software Technology, 2022, 107082, ISSN 0950-5849",10.1016/j.infsof.2022.107082,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: A Legacy system can be defined as a system that significantly
resists modification and evolution. According to the literature, there are two
main strategies to migrate a legacy system: (a) to replace the legacy system by
a new one, (b) to incrementally migrate parts from the legacy system to the new
one. Incremental migration allows developers to better control the risks that
may occur during the migration process. However, this strategy is more complex
because it requires decomposition of the legacy system into different parts,
e.g. a set of files, and to define the order of migration of them along the
migration process. To our knowledge, there is no approach to support developers
on those activities. Objective: This paper presents an approach, named
MigrationExp, to support incremental language migrations of applications from
one source language to another target language. MigrationExp recommends the
files that should be migrated first in a particular migration iteration. As a
novelty, our approach relies on a ranking model learned, using a
learning-to-rank algorithm, from migrations made by developers. Method: We
validate our approach in the context of the migrations of Android apps, from
Java to Kotlin, a new official language for Android. We train our model using
migrations of Java code to Kotlin written by developers on open-source
applications. Results: The results show that, on the task of proposing files to
migrate, our approach outperforms a previous migration strategy proposed by
Google, in terms of its ability to accurately predict empirically observed
migration orders. Conclusion: Since most Android applications are written in
Java, we conclude that approaches to support developers such as MigrationExp
may significantly impact the development of Android applications.
","[{'version': 'v1', 'created': 'Wed, 17 Mar 2021 15:33:32 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Mar 2021 11:08:10 GMT'}, {'version': 'v3', 'created': 'Mon, 3 Oct 2022 09:51:05 GMT'}]",2022-10-04,"[['Mateus', 'Bruno Góis', ''], ['Martinez', 'Matias', ''], ['Kolski', 'Christophe', '']]","['Software Evolution and Maintenance', 'Software Migration', 'Software Modernization', 'Android', 'Java', 'Kotlin', 'Machine learning', 'supervised']"
8155,2208.10569,Justin Chan,"Tuochao Chen, Justin Chan, Shyamnath Gollakota",Underwater Messaging Using Mobile Devices,,SIGCOMM 2022,10.1145/3544216.3544258,,cs.NI eess.SP,http://creativecommons.org/licenses/by/4.0/,"  Since its inception, underwater digital acoustic communication has required
custom hardware that neither has the economies of scale nor is pervasive. We
present the first acoustic system that brings underwater messaging capabilities
to existing mobile devices like smartphones and smart watches. Our
software-only solution leverages audio sensors, i.e., microphones and speakers,
ubiquitous in today's devices to enable acoustic underwater communication
between mobile devices. To achieve this, we design a communication system that
in real-time adapts to differences in frequency responses across mobile
devices, changes in multipath and noise levels at different locations and
dynamic channel changes due to mobility. We evaluate our system in six
different real-world underwater environments with depths of 2-15 m in the
presence of boats, ships and people fishing and kayaking. Our results show that
our system can in real-time adapt its frequency band and achieve bit rates of
100 bps to 1.8 kbps and a range of 30 m. By using a lower bit rate of 10-20
bps, we can further increase the range to 100 m. As smartphones and watches are
increasingly being used in underwater scenarios, our software-based approach
has the potential to make underwater messaging capabilities widely available to
anyone with a mobile device. Project page with open-source code and data can be
found here: https://underwatermessaging.cs.washington.edu/
","[{'version': 'v1', 'created': 'Mon, 22 Aug 2022 19:53:51 GMT'}]",2022-08-24,"[['Chen', 'Tuochao', ''], ['Chan', 'Justin', ''], ['Gollakota', 'Shyamnath', '']]","['Underwater communication', 'ocean sciences', 'SOS beacons', 'mobilephones', 'smart watches', 'underwater exploration']"
8156,2107.01910,Maria-Esther Vidal,Irlan Grangel-Gonzalez and Maria-Esther Vidal,Analyzing a Knowledge Graph of Industry4.0 Standards,"Based on the paper Irlan Grangel-Gonzalez, Maria-Esther Vidal:
  Analyzing a Knowledge Graph of Industry 4.0 Standards. WWW (Companion Volume)
  2021: 16-25",,10.1145/3442442.3453541,,cs.DL cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, we tackle the problem of standard interoperability across
different standardization frameworks, and devise a knowledge-driven approach
that allows for the description of standards and standardization frameworks
into an Industry 4.0 knowledge graph (I40KG). The STO ontology represents
properties of standards and standardization frameworks, as well as
relationships among them. The I40KG integrates more than 200 standards and four
standardization frameworks. To populate the I40KG, the landscape of standards
has been analyzed from a semantic perspective and the resulting I40KG
represents knowledge expressed in more than 200 industrial related documents
including technical reports, research articles, and white papers. Additionally,
the I40KG has been linked to existing knowledge graphs and an automated
reasoning has been implemented to reveal implicit relations between standards
as well as mappings across standardization frameworks. We analyze both the
number of discovered relations between standards and the accuracy of these
relations. Observed results indicate that both reasoning and linking processes
enable for increasing the connectivity in the knowledge graph by up to 80%,
whilst up to 96% of the relations can be validated. These outcomes suggest that
integrating standards and standardization frameworks into the I40KG enables the
resolution of semantic interoperability conflicts, empowering the communication
in smart factories.
","[{'version': 'v1', 'created': 'Mon, 5 Jul 2021 10:03:06 GMT'}]",2021-07-06,"[['Grangel-Gonzalez', 'Irlan', ''], ['Vidal', 'Maria-Esther', '']]","['Data Integration Systems', 'Knowledge Graphs', 'Industry 4']"
8157,1811.06145,Jing Shi,"Jing Shi, Jiaming Xu, Yiqun Yao, Bo Xu","Concept Learning through Deep Reinforcement Learning with
  Memory-Augmented Neural Networks","27 pages, 2 figures",,10.1016/j.neunet.2018.10.018,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks have shown superior performance in many regimes to
remember familiar patterns with large amounts of data. However, the standard
supervised deep learning paradigm is still limited when facing the need to
learn new concepts efficiently from scarce data. In this paper, we present a
memory-augmented neural network which is motivated by the process of human
concept learning. The training procedure, imitating the concept formation
course of human, learns how to distinguish samples from different classes and
aggregate samples of the same kind. In order to better utilize the advantages
originated from the human behavior, we propose a sequential process, during
which the network should decide how to remember each sample at every step. In
this sequential process, a stable and interactive memory serves as an important
module. We validate our model in some typical one-shot learning tasks and also
an exploratory outlier detection problem. In all the experiments, our model
gets highly competitive to reach or outperform those strong baselines.
","[{'version': 'v1', 'created': 'Thu, 15 Nov 2018 02:38:57 GMT'}]",2018-11-16,"[['Shi', 'Jing', ''], ['Xu', 'Jiaming', ''], ['Yao', 'Yiqun', ''], ['Xu', 'Bo', '']]","['One-shot Learning', 'Memory', 'Attention', 'Deep Reinforcement']"
8158,2105.00187,Shahroz Tariq,"Shahroz Tariq, Sangyup Lee and Simon S. Woo","One Detector to Rule Them All: Towards a General Deepfake Attack
  Detection Framework","14 pages, 8 Figures, 6 Tables, Accepted for publication in The Web
  Conference WWW 2021",,10.1145/3442381.3449809,,cs.CV cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning-based video manipulation methods have become widely accessible
to the masses. With little to no effort, people can quickly learn how to
generate deepfake (DF) videos. While deep learning-based detection methods have
been proposed to identify specific types of DFs, their performance suffers for
other types of deepfake methods, including real-world deepfakes, on which they
are not sufficiently trained. In other words, most of the proposed deep
learning-based detection methods lack transferability and generalizability.
Beyond detecting a single type of DF from benchmark deepfake datasets, we focus
on developing a generalized approach to detect multiple types of DFs, including
deepfakes from unknown generation methods such as DeepFake-in-the-Wild (DFW)
videos. To better cope with unknown and unseen deepfakes, we introduce a
Convolutional LSTM-based Residual Network (CLRNet), which adopts a unique model
training strategy and explores spatial as well as the temporal information in
deepfakes. Through extensive experiments, we show that existing defense methods
are not ready for real-world deployment. Whereas our defense method (CLRNet)
achieves far better generalization when detecting various benchmark deepfake
methods (97.57% on average). Furthermore, we evaluate our approach with a
high-quality DeepFake-in-the-Wild dataset, collected from the Internet
containing numerous videos and having more than 150,000 frames. Our CLRNet
model demonstrated that it generalizes well against high-quality DFW videos by
achieving 93.86% detection accuracy, outperforming existing state-of-the-art
defense methods by a considerable margin.
","[{'version': 'v1', 'created': 'Sat, 1 May 2021 08:02:59 GMT'}]",2021-05-04,"[['Tariq', 'Shahroz', ''], ['Lee', 'Sangyup', ''], ['Woo', 'Simon S.', '']]","['Deepfake Videos', 'Domain Generalization', 'Domain Adaptation', 'Forensics', 'Deepfake Detection']"
8159,1809.05528,Zakaria El Mrabet,"Zakaria El Mrabet, Hamid El Ghazi, Tayeb Sadiki, Hassan El Ghazi","A New Secure Network Architecture to Increase Security Among Virtual
  Machines in Cloud Computing",,,10.1007/978-981-287-990-5_9,,cs.CR cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing is a new model of computing which provides scalability,
flexibility and on-demand service. Virtualization is one of the main components
of the cloud, but unfortunately, this technology suffers from many security
vulnerabilities. The main purpose of this paper is to present a new secure
architecture of Virtual Network machines in order to increase security among
virtual machines in a virtualized environment (Xen as a case study). First, we
expose the different network modes based on Xen Hypervisor, and then we analyze
vulnerabilities and security issues within this kind of environment. Finally,
we present in details new secure architecture and demonstrate how it can face
the main security network attacks.
","[{'version': 'v1', 'created': 'Thu, 13 Sep 2018 17:49:46 GMT'}]",2018-09-17,"[['Mrabet', 'Zakaria El', ''], ['Ghazi', 'Hamid El', ''], ['Sadiki', 'Tayeb', ''], ['Ghazi', 'Hassan El', '']]","['Cloud Computing', 'virtualization', 'virtual network security', 'Xen hypervisor', 'spoofing', 'sniffing', 'mac flooding']"
8160,2104.04884,Abu Md Niamul Taufique,"Abu Md Niamul Taufique, David W. Messinger","Hyperspectral Pigment Analysis of Cultural Heritage Artifacts Using the
  Opaque Form of Kubelka-Munk Theory","11 pages, 9 figures","Proc. SPIE 10986, Algorithms, Technologies, and Applications for
  Multispectral and Hyperspectral Imagery XXV, 1098611, 2019",10.1117/12.2518451,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Kubelka-Munk (K-M) theory has been successfully used to estimate pigment
concentrations in the pigment mixtures of modern paintings in spectral imagery.
In this study the single-constant K-M theory has been utilized for the
classification of green pigments in the Selden Map of China, a navigational map
of the South China Sea likely created in the early seventeenth century.
Hyperspectral data of the map was collected at the Bodleian Library, University
of Oxford, and can be used to estimate the pigment diversity, and spatial
distribution, within the map. This work seeks to assess the utility of
analyzing the data in the K/S space from Kubelka-Munk theory, as opposed to the
traditional reflectance domain. We estimate the dimensionality of the data and
extract endmembers in the reflectance domain. Then we perform linear unmixing
to estimate abundances in the K/S space, and following Bai, et al. (2017), we
perform a classification in the abundance space. Finally, due to the lack of
ground truth labels, the classification accuracy was estimated by computing the
mean spectrum of each class as the representative signature of that class, and
calculating the root mean squared error with all the pixels in that class to
create a spatial representation of the error. This highlights both the
magnitude of, and any spatial pattern in, the errors, indicating if a
particular pigment is not well modeled in this approach.
","[{'version': 'v1', 'created': 'Sun, 11 Apr 2021 00:22:37 GMT'}]",2021-04-13,"[['Taufique', 'Abu Md Niamul', ''], ['Messinger', 'David W.', '']]","['Kubelka-Munk theory', 'dimensionality estimation', 'spectral unmixing', 'hyperspectral image classification']"
8161,2105.14799,Raqeeb Rasheed,Raqeeb Rasheed,Resultant-based Elimination in Ore Algebra,"An updated (and shorter) version published in the SYNASC '21
  proceedings (IEEE CS) with the title ""Resultant-based Elimination for Skew
  Polynomials""","Proceedings of the 23rd International Symposium on Symbolic and
  Numeric Algorithms for Scientific Computing (SYNASC '21), pp. 11-18. IEEE,
  2021",10.1109/SYNASC54541.2021.00014,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider resultant-based methods for elimination of indeterminates of Ore
polynomial systems in Ore algebra. We start with defining the concept of
resultant for bivariate Ore polynomials then compute it by the Dieudonne
determinant of the polynomial coefficients. Additionally, we apply
noncommutative versions of evaluation and interpolation techniques to the
computation process to improve the efficiency of the method. The implementation
of the algorithms will be performed in Maple to evaluate the performance of the
approaches.
","[{'version': 'v1', 'created': 'Mon, 31 May 2021 08:49:42 GMT'}, {'version': 'v2', 'created': 'Sun, 24 Oct 2021 04:16:11 GMT'}, {'version': 'v3', 'created': 'Fri, 7 Oct 2022 02:36:36 GMT'}]",2022-10-10,"[['Rasheed', 'Raqeeb', '']]","['Ore algebra', 'elimination', 'resultant', 'symbolic computation', 'modular method', 'noncommutative algebra']"
8162,2106.04547,Kyle Hart,"Kyle M. Hart (1), Ari B. Goodman (1), Ryan P. O'Shea (1) ((1) Naval
  Air Warfare Center - Aircraft Division - Lakehurst)",Automatic Generation of Machine Learning Synthetic Data Using ROS,"DISTRIBUTION STATEMENT A. Approved for public release: distribution
  unlimited. NAWCAD-LKE Release Number 2021-72. Published in HCI International
  2021 by Springer. The final authenticated version is available online at
  https://doi.org/10.1007/978-3-030-77772-2_21",,10.1007/978-3-030-77772-2_21,,cs.LG,http://creativecommons.org/publicdomain/zero/1.0/,"  Data labeling is a time intensive process. As such, many data scientists use
various tools to aid in the data generation and labeling process. While these
tools help automate labeling, many still require user interaction throughout
the process. Additionally, most target only a few network frameworks. Any
researchers exploring multiple frameworks must find additional tools orwrite
conversion scripts. This paper presents an automated tool for generating
synthetic data in arbitrary network formats. It uses Robot Operating System
(ROS) and Gazebo, which are common tools in the robotics community. Through ROS
paradigms, it allows extensive user customization of the simulation environment
and data generation process. Additionally, a plugin-like framework allows the
development of arbitrary data format writers without the need to change the
main body of code. Using this tool, the authors were able to generate an
arbitrarily large image dataset for three unique training formats using
approximately 15 min of user setup time and a variable amount of hands-off run
time, depending on the dataset size. The source code for this data generation
tool is available at https://github.com/Navy-RISE-Lab/nn_data_collection
","[{'version': 'v1', 'created': 'Tue, 8 Jun 2021 17:30:10 GMT'}]",2021-06-09,"[['Hart', 'Kyle M.', ''], ['Goodman', 'Ari B.', ''], [""O'Shea"", 'Ryan P.', '']]","['Machine Learning', 'Data Generation', 'ROS']"
8163,1602.04581,Yury Kartynnik,"Yury Kartynnik, Andrew Ryzhikov",On Minimum Maximal Distance-k Matchings,"15 pages, 4 figures","Discrete Mathematics & Theoretical Computer Science, Vol. 20 no.
  1, Graph Theory (January 11, 2018) dmtcs:4199",10.23638/DMTCS-20-1-3,,cs.DM cs.CC math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the computational complexity of several problems connected with
finding a maximal distance-$k$ matching of minimum cardinality or minimum
weight in a given graph. We introduce the class of $k$-equimatchable graphs
which is an edge analogue of $k$-equipackable graphs. We prove that the
recognition of $k$-equimatchable graphs is co-NP-complete for any fixed $k \ge
2$. We provide a simple characterization for the class of strongly chordal
graphs with equal $k$-packing and $k$-domination numbers. We also prove that
for any fixed integer $\ell \ge 1$ the problem of finding a minimum weight
maximal distance-$2\ell$ matching and the problem of finding a minimum weight
$(2 \ell - 1)$-independent dominating set cannot be approximated in polynomial
time in chordal graphs within a factor of $\delta \ln |V(G)|$ unless
$\mathrm{P} = \mathrm{NP}$, where $\delta$ is a fixed constant (thereby
improving the NP-hardness result of Chang for the independent domination case).
Finally, we show the NP-hardness of the minimum maximal induced matching and
independent dominating set problems in large-girth planar graphs.
","[{'version': 'v1', 'created': 'Mon, 15 Feb 2016 07:34:18 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Mar 2017 20:56:21 GMT'}, {'version': 'v3', 'created': 'Fri, 7 Apr 2017 19:50:51 GMT'}, {'version': 'v4', 'created': 'Fri, 10 Nov 2017 20:20:03 GMT'}, {'version': 'v5', 'created': 'Tue, 9 Jan 2018 21:39:15 GMT'}]",2019-03-14,"[['Kartynnik', 'Yury', ''], ['Ryzhikov', 'Andrew', '']]","['distance-k matching', 'k-equimatchable graph', 'computational complexity']"
8164,1801.07174,Simon Gottschalk,"Hady Elsahar, Elena Demidova, Simon Gottschalk, Christophe Gravier,
  Frederique Laforest",Unsupervised Open Relation Extraction,"4 pages, published in ESWC 2017",,10.1007/978-3-319-70407-4_3,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore methods to extract relations between named entities from free text
in an unsupervised setting. In addition to standard feature extraction, we
develop a novel method to re-weight word embeddings. We alleviate the problem
of features sparsity using an individual feature reduction. Our approach
exhibits a significant improvement by 5.8% over the state-of-the-art relation
clustering scoring a F1-score of 0.416 on the NYT-FB dataset.
","[{'version': 'v1', 'created': 'Mon, 22 Jan 2018 16:19:12 GMT'}]",2018-01-23,"[['Elsahar', 'Hady', ''], ['Demidova', 'Elena', ''], ['Gottschalk', 'Simon', ''], ['Gravier', 'Christophe', ''], ['Laforest', 'Frederique', '']]","['Relation Extraction', 'Word Embedding', 'NLP']"
8165,1702.05075,Timo Heister,"Timo Heister and Juliane Dannberg and Rene Gassm\""oller and Wolfgang
  Bangerth","High Accuracy Mantle Convection Simulation through Modern Numerical
  Methods. II: Realistic Models and Problems",,,10.1093/gji/ggx195,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computations have helped elucidate the dynamics of Earth's mantle for several
decades already. The numerical methods that underlie these simulations have
greatly evolved within this time span, and today include dynamically changing
and adaptively refined meshes, sophisticated and efficient solvers, and
parallelization to large clusters of computers. At the same time, many of these
methods -- discussed in detail in a previous paper in this series -- were
developed and tested primarily using model problems that lack many of the
complexities that are common to the realistic models our community wants to
solve today.
  With several years of experience solving complex and realistic models, we
here revisit some of the algorithm designs of the earlier paper and discuss the
incorporation of more complex physics. In particular, we re-consider time
stepping and mesh refinement algorithms, evaluate approaches to incorporate
compressibility, and discuss dealing with strongly varying material
coefficients, latent heat, and how to track chemical compositions and
heterogeneities. Taken together and implemented in a high-performance,
massively parallel code, the techniques discussed in this paper then allow for
high resolution, 3d, compressible, global mantle convection simulations with
phase transitions, strongly temperature dependent viscosity and realistic
material properties based on mineral physics data.
","[{'version': 'v1', 'created': 'Thu, 16 Feb 2017 18:29:16 GMT'}, {'version': 'v2', 'created': 'Mon, 8 May 2017 01:54:42 GMT'}]",2017-05-09,"[['Heister', 'Timo', ''], ['Dannberg', 'Juliane', ''], ['Gassmöller', 'Rene', ''], ['Bangerth', 'Wolfgang', '']]","['Mantle convection', 'numerical methods', 'adaptive mesh refinement', 'finite element method', 'compressibility', 'preconditioners']"
8166,2101.11349,Zhenqiao Song,"Zhenqiao Song, Jiaze Chen, Hao Zhou and Lei Li",Triangular Bidword Generation for Sponsored Search Auction,"9 pages, 5 figures, accepted by WSDM 2021",,10.1145/3437963.3441819,,cs.CL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sponsored search auction is a crucial component of modern search engines. It
requires a set of candidate bidwords that advertisers can place bids on.
Existing methods generate bidwords from search queries or advertisement
content. However, they suffer from the data noise in <query, bidword> and
<advertisement, bidword> pairs. In this paper, we propose a triangular bidword
generation model (TRIDENT), which takes the high-quality data of paired <query,
advertisement> as a supervision signal to indirectly guide the bidword
generation process. Our proposed model is simple yet effective: by using
bidword as the bridge between search query and advertisement, the generation of
search query, advertisement and bidword can be jointly learned in the
triangular training framework. This alleviates the problem that the training
data of bidword may be noisy. Experimental results, including automatic and
human evaluations, show that our proposed TRIDENT can generate relevant and
diverse bidwords for both search queries and advertisements. Our evaluation on
online real data validates the effectiveness of the TRIDENT's generated
bidwords for product search.
","[{'version': 'v1', 'created': 'Wed, 27 Jan 2021 12:25:22 GMT'}]",2021-01-28,"[['Song', 'Zhenqiao', ''], ['Chen', 'Jiaze', ''], ['Zhou', 'Hao', ''], ['Li', 'Lei', '']]","['sponsored search', 'advertising bidword generation', 'query expansion', 'triangle training']"
8167,2206.04153,Yunyi Zhang,"Yunyi Zhang, Fang Guo, Jiaming Shen, Jiawei Han",Unsupervised Key Event Detection from Massive Text Corpora,Accepted to KDD 2022 Research Track,,10.1145/3534678.3539395,,cs.CL cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Automated event detection from news corpora is a crucial task towards mining
fast-evolving structured knowledge. As real-world events have different
granularities, from the top-level themes to key events and then to event
mentions corresponding to concrete actions, there are generally two lines of
research: (1) theme detection identifies from a news corpus major themes (e.g.,
""2019 Hong Kong Protests"" vs. ""2020 U.S. Presidential Election"") that have very
distinct semantics; and (2) action extraction extracts from one document
mention-level actions (e.g., ""the police hit the left arm of the protester"")
that are too fine-grained for comprehending the event. In this paper, we
propose a new task, key event detection at the intermediate level, aiming to
detect from a news corpus key events (e.g., ""HK Airport Protest on Aug.
12-14""), each happening at a particular time/location and focusing on the same
topic. This task can bridge event understanding and structuring and is
inherently challenging because of the thematic and temporal closeness of key
events and the scarcity of labeled data due to the fast-evolving nature of news
articles. To address these challenges, we develop an unsupervised key event
detection framework, EvMine, that (1) extracts temporally frequent peak phrases
using a novel ttf-itf score, (2) merges peak phrases into event-indicative
feature sets by detecting communities from our designed peak phrase graph that
captures document co-occurrences, semantic similarities, and temporal closeness
signals, and (3) iteratively retrieves documents related to each key event by
training a classifier with automatically generated pseudo labels from the
event-indicative feature sets and refining the detected key events using the
retrieved documents. Extensive experiments and case studies show EvMine
outperforms all the baseline methods and its ablations on two real-world news
corpora.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2022 20:31:02 GMT'}, {'version': 'v2', 'created': 'Sun, 3 Jul 2022 19:52:08 GMT'}]",2022-07-05,"[['Zhang', 'Yunyi', ''], ['Guo', 'Fang', ''], ['Shen', 'Jiaming', ''], ['Han', 'Jiawei', '']]","['Unsupervised Event Detection', 'Document Classification', 'PretrainedLanguage Models', 'Phrase Extraction']"
8168,2204.08651,Atoosa Parsa,"Atoosa Parsa, Dong Wang, Corey S. O'Hern, Mark D. Shattuck, Rebecca
  Kramer-Bottiglio, Josh Bongard",Evolving Programmable Computational Metamaterials,"Accepted to the Genetic and Evolutionary Computation Conference 2022
  (GECCO '22)",,10.1145/3512290.3528861,,cs.ET cs.NE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Granular metamaterials are a promising choice for the realization of
mechanical computing devices. As preliminary evidence of this, we demonstrate
here how to embed Boolean logic gates (AND and XOR) into a granular
metamaterial by evolving where particular grains are placed in the material.
Our results confirm the existence of gradients of increasing ""AND-ness"" and
""XOR-ness"" within the space of possible materials that can be followed by
evolutionary search. We measure the computational functionality of a material
by probing how it transforms bits encoded as vibrations with zero or non-zero
amplitude. We compared the evolution of materials built from mass-contrasting
particles and materials built from stiffness-contrasting particles, and found
that the latter were more evolvable. We believe this work may pave the way
toward evolutionary design of increasingly sophisticated, programmable, and
computationally dense metamaterials with certain advantages over more
traditional computational substrates.
","[{'version': 'v1', 'created': 'Tue, 19 Apr 2022 04:09:53 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Jun 2022 03:38:59 GMT'}]",2022-06-07,"[['Parsa', 'Atoosa', ''], ['Wang', 'Dong', ''], [""O'Hern"", 'Corey S.', ''], ['Shattuck', 'Mark D.', ''], ['Kramer-Bottiglio', 'Rebecca', ''], ['Bongard', 'Josh', '']]","['Granular Metamaterials', 'Mechanical Computing', 'Logic Gates', 'Inverse Design Problem', 'Multiobjective Optimization']"
8169,2005.02477,Petros Spachos,"Sebastian Sadowski, Petros Spachos","Wireless Technologies for Agricultural Monitoring using Internet of
  Things Devices with Energy Harvesting Capabilities",,,10.1016/j.compag.2020.105338,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Technological advances in the Internet of Things (IoT) have lead the way for
technology to be used in ways that were never possible before. Through the
development of devices with low-power radios, Wireless Sensor Networks (WSN)
can be configured for almost any type of application. Agricultural has been one
example where IoT and WSN have been able to increase productivity, efficiency,
and output yield. Systems that previously required manual operation can be
easily replaced with sensors and actuators to automate the process such as
irrigation and disease management. Powering these devices is a concern as
batteries are often required due to devices being located where electricity is
not readily available. In this paper, a comparison is performed between three
wireless technologies: IEEE 802.15.4 (Zigbee), Long Range Wireless Area Network
(LoRaWAN), and IEEE 802.11g (WiFi 2.4~GHz) for agricultural monitoring with
energy harvesting capabilities. According to experimental results, LoRaWAN is
the optimal technology to use in an agricultural monitoring system where power
consumption and network lifetime are a priority. The experimental results can
be used for the selection of wireless technology for agricultural monitoring
following application requirements.
","[{'version': 'v1', 'created': 'Sat, 11 Apr 2020 03:32:12 GMT'}]",2020-05-07,"[['Sadowski', 'Sebastian', ''], ['Spachos', 'Petros', '']]","['Wireless Technologies', 'Internet of Things', 'Energy Harvesting']"
8170,2009.03668,Shuo Zhang,Javeria Habib and Shuo Zhang and Krisztian Balog,IAI MovieBot: A Conversational Movie Recommender System,"Proceedings of the 29th ACM International Conference on Information
  and Knowledge Management, Oct 2020",,10.1145/3340531.3417433,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Conversational recommender systems support users in accomplishing
recommendation-related goals via multi-turn conversations. To better model
dynamically changing user preferences and provide the community with a reusable
development framework, we introduce IAI MovieBot, a conversational recommender
system for movies. It features a task-specific dialogue flow, a multi-modal
chat interface, and an effective way to deal with dynamically changing user
preferences. The system is made available open source and is operated as a
channel on Telegram.
","[{'version': 'v1', 'created': 'Tue, 8 Sep 2020 12:14:52 GMT'}]",2020-09-09,"[['Habib', 'Javeria', ''], ['Zhang', 'Shuo', ''], ['Balog', 'Krisztian', '']]","['Dialogue systems; conversational recommender systems', 'conversational information access', 'user preference modeling']"
8171,2112.04494,Oscar Fern\'andez Vicente,"Oscar Fern\'andez Vicente, Fernando Fern\'andez Rebollo, Francisco
  Javier Garc\'ia Polo",Deep Q-Learning Market Makers in a Multi-Agent Simulated Stock Market,Presented at 2nd ACM International Conference on AI in Finance,,10.1145/3490354.3494448,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Market makers play a key role in financial markets by providing liquidity.
They usually fill order books with buy and sell limit orders in order to
provide traders alternative price levels to operate. This paper focuses
precisely on the study of these markets makers strategies from an agent-based
perspective. In particular, we propose the application of Reinforcement
Learning (RL) for the creation of intelligent market markers in simulated stock
markets. This research analyzes how RL market maker agents behaves in
non-competitive (only one RL market maker learning at the same time) and
competitive scenarios (multiple RL market markers learning at the same time),
and how they adapt their strategies in a Sim2Real scope with interesting
results. Furthermore, it covers the application of policy transfer between
different experiments, describing the impact of competing environments on RL
agents performance. RL and deep RL techniques are proven as profitable market
maker approaches, leading to a better understanding of their behavior in stock
markets.
","[{'version': 'v1', 'created': 'Wed, 8 Dec 2021 14:55:21 GMT'}]",2021-12-10,"[['Vicente', 'Oscar Fernández', ''], ['Rebollo', 'Fernando Fernández', ''], ['Polo', 'Francisco Javier García', '']]","['deep learning', 'reinforcement learning', 'multi-agent', 'stock markets', 'market makers']"
8172,2003.04603,Zhenshan Bing,"Zhenshan Bing, Claus Meschede, Guang Chen, Alois Knoll, Kai Huang","Indirect and Direct Training of Spiking Neural Networks for End-to-End
  Control of a Lane-Keeping Vehicle",,"Neural Networks, 2020",10.1016/j.neunet.2019.05.019,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Building spiking neural networks (SNNs) based on biological synaptic
plasticities holds a promising potential for accomplishing fast and
energy-efficient computing, which is beneficial to mobile robotic applications.
However, the implementations of SNNs in robotic fields are limited due to the
lack of practical training methods. In this paper, we therefore introduce both
indirect and direct end-to-end training methods of SNNs for a lane-keeping
vehicle. First, we adopt a policy learned using the \textcolor{black}{Deep
Q-Learning} (DQN) algorithm and then subsequently transfer it to an SNN using
supervised learning. Second, we adopt the reward-modulated
spike-timing-dependent plasticity (R-STDP) for training SNNs directly, since it
combines the advantages of both reinforcement learning and the well-known
spike-timing-dependent plasticity (STDP). We examine the proposed approaches in
three scenarios in which a robot is controlled to keep within lane markings by
using an event-based neuromorphic vision sensor. We further demonstrate the
advantages of the R-STDP approach in terms of the lateral localization accuracy
and training time steps by comparing them with other three algorithms presented
in this paper.
","[{'version': 'v1', 'created': 'Tue, 10 Mar 2020 09:35:46 GMT'}]",2020-03-11,"[['Bing', 'Zhenshan', ''], ['Meschede', 'Claus', ''], ['Chen', 'Guang', ''], ['Knoll', 'Alois', ''], ['Huang', 'Kai', '']]","['Spiking Neural Network', 'End-to-end Learning', 'R-STDP', 'Lane']"
8173,2006.02587,Hao Yuan,"Hao Yuan, Jiliang Tang, Xia Hu, Shuiwang Ji",XGNN: Towards Model-Level Explanations of Graph Neural Networks,,,10.1145/3394486.3403085,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graphs neural networks (GNNs) learn node features by aggregating and
combining neighbor information, which have achieved promising performance on
many graph tasks. However, GNNs are mostly treated as black-boxes and lack
human intelligible explanations. Thus, they cannot be fully trusted and used in
certain application domains if GNN models cannot be explained. In this work, we
propose a novel approach, known as XGNN, to interpret GNNs at the model-level.
Our approach can provide high-level insights and generic understanding of how
GNNs work. In particular, we propose to explain GNNs by training a graph
generator so that the generated graph patterns maximize a certain prediction of
the model.We formulate the graph generation as a reinforcement learning task,
where for each step, the graph generator predicts how to add an edge into the
current graph. The graph generator is trained via a policy gradient method
based on information from the trained GNNs. In addition, we incorporate several
graph rules to encourage the generated graphs to be valid. Experimental results
on both synthetic and real-world datasets show that our proposed methods help
understand and verify the trained GNNs. Furthermore, our experimental results
indicate that the generated graphs can provide guidance on how to improve the
trained GNNs.
","[{'version': 'v1', 'created': 'Wed, 3 Jun 2020 23:52:43 GMT'}]",2020-06-05,"[['Yuan', 'Hao', ''], ['Tang', 'Jiliang', ''], ['Hu', 'Xia', ''], ['Ji', 'Shuiwang', '']]","['Deep learning', 'Interpretability', 'Graph Neural Networks']"
8174,2104.14275,Jakob Bossek,"Jakob Bossek, Markus Wagner","Generating Instances with Performance Differences for More Than Just Two
  Algorithms",,,10.1145/3449726.3463165,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, Evolutionary Algorithms (EAs) have frequently been adopted
to evolve instances for optimization problems that pose difficulties for one
algorithm while being rather easy for a competitor and vice versa. Typically,
this is achieved by either minimizing or maximizing the performance difference
or ratio which serves as the fitness function. Repeating this process is useful
to gain insights into strengths/weaknesses of certain algorithms or to build a
set of instances with strong performance differences as a foundation for
automatic per-instance algorithm selection or configuration. We contribute to
this branch of research by proposing fitness-functions to evolve instances that
show large performance differences for more than just two algorithms
simultaneously. As a proof-of-principle, we evolve instances of the
multi-component Traveling Thief Problem~(TTP) for three incomplete TTP-solvers.
Our results point out that our strategies are promising, but unsurprisingly
their success strongly relies on the algorithms' performance complementarity.
","[{'version': 'v1', 'created': 'Thu, 29 Apr 2021 11:48:41 GMT'}]",2021-04-30,"[['Bossek', 'Jakob', ''], ['Wagner', 'Markus', '']]","['Evolutionary algorithms', 'evolving instances', 'traveling thief problem (TTP)', 'fitness function', 'instance hardness']"
8175,2208.05066,Michael Beyeler,Alex Rasla and Michael Beyeler,"The Relative Importance of Depth Cues and Semantic Edges for Indoor
  Mobility Using Simulated Prosthetic Vision in Immersive Virtual Reality",,,10.1145/3562939.3565620,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Visual neuroprostheses (bionic eyes) have the potential to treat degenerative
eye diseases that often result in low vision or complete blindness. These
devices rely on an external camera to capture the visual scene, which is then
translated frame-by-frame into an electrical stimulation pattern that is sent
to the implant in the eye. To highlight more meaningful information in the
scene, recent studies have tested the effectiveness of deep-learning based
computer vision techniques, such as depth estimation to highlight nearby
obstacles (DepthOnly mode) and semantic edge detection to outline important
objects in the scene (EdgesOnly mode). However, nobody has attempted to combine
the two, either by presenting them together (EdgesAndDepth) or by giving the
user the ability to flexibly switch between them (EdgesOrDepth). Here, we used
a neurobiologically inspired model of simulated prosthetic vision (SPV) in an
immersive virtual reality (VR) environment to test the relative importance of
semantic edges and relative depth cues to support the ability to avoid
obstacles and identify objects. We found that participants were significantly
better at avoiding obstacles using depth-based cues as opposed to relying on
edge information alone, and that roughly half the participants preferred the
flexibility to switch between modes (EdgesOrDepth). This study highlights the
relative importance of depth cues for SPV mobility and is an important first
step towards a visual neuroprosthesis that uses computer vision to improve a
user's scene understanding.
","[{'version': 'v1', 'created': 'Tue, 9 Aug 2022 22:47:51 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Oct 2022 22:30:40 GMT'}]",2022-10-11,"[['Rasla', 'Alex', ''], ['Beyeler', 'Michael', '']]","['bionic vision', 'virtual reality', 'simulated prosthetic vision', 'indoormobility', 'scene simplification']"
8176,1803.09435,Suthee Ruangwises,"Suthee Ruangwises, Toshiya Itoh",Unpopularity Factor in the Marriage and Roommates Problems,A preliminary version of this paper has appeared at CSR 2019,"Theory of Computing Systems, 65(3): 579-592 (2021)",10.1007/s00224-020-09978-5,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a set $A$ of $n$ people, with each person having a preference list that
ranks a subset of $A$ as his/her acceptable partners in order of preference, we
consider the Roommates Problem (RP) and the Marriage Problem (MP) of matching
people with their partners. In RP there is no further restriction, while in MP
only people of opposite genders can be acceptable partners. For a pair of
matchings $X$ and $Y$, let $\phi(X,Y)$ denote the number of people who prefer a
person they get matched by $X$ to a person they get matched by $Y$, and define
an unpopularity factor $u(M)$ of a matching $M$ to be the maximum ratio
$\phi(M',M) / \phi(M,M')$ among all other possible matchings $M'$. In this
paper, we develop an algorithm to compute the unpopularity factor of a given
matching in $O(m\sqrt{n}\log^2 n)$ time for RP and in $O(m\sqrt{n}\log n)$ time
for MP, where $m$ is the total length of people's preference lists. We also
generalize the notion of unpopularity factor to a weighted setting where people
are given different voting weights and show that our algorithm can be slightly
modified to support that setting with the same running time.
","[{'version': 'v1', 'created': 'Mon, 26 Mar 2018 06:41:07 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Sep 2018 15:14:44 GMT'}, {'version': 'v3', 'created': 'Sat, 16 Mar 2019 06:09:25 GMT'}, {'version': 'v4', 'created': 'Tue, 30 Jul 2019 09:26:23 GMT'}, {'version': 'v5', 'created': 'Fri, 25 Oct 2019 08:54:06 GMT'}, {'version': 'v6', 'created': 'Tue, 3 Nov 2020 11:35:03 GMT'}]",2021-06-01,"[['Ruangwises', 'Suthee', ''], ['Itoh', 'Toshiya', '']]","['unpopularity factor', 'popular matching', 'perfect matching', 'MarriageProblem', 'Roommates Problem']"
8177,1601.01887,Rustam Tagiew,Rustam Tagiew,Research Project: Text Engineering Tool for Ontological Scientometry,"5 pages, 2 figure",,10.13140/RG.2.1.1619.1847,,cs.CL cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The number of scientific papers grows exponentially in many disciplines. The
share of online available papers grows as well. At the same time, the period of
time for a paper to loose at chance to be cited anymore shortens. The decay of
the citing rate shows similarity to ultradiffusional processes as for other
online contents in social networks. The distribution of papers per author shows
similarity to the distribution of posts per user in social networks. The rate
of uncited papers for online available papers grows while some papers 'go
viral' in terms of being cited. Summarized, the practice of scientific
publishing moves towards the domain of social networks. The goal of this
project is to create a text engineering tool, which can semi-automatically
categorize a paper according to its type of contribution and extract
relationships between them into an ontological database. Semi-automatic
categorization means that the mistakes made by automatic pre-categorization and
relationship-extraction will be corrected through a wikipedia-like front-end by
volunteers from general public. This tool should not only help researchers and
the general public to find relevant supplementary material and peers faster,
but also provide more information for research funding agencies.
","[{'version': 'v1', 'created': 'Fri, 8 Jan 2016 14:29:44 GMT'}]",2016-01-11,"[['Tagiew', 'Rustam', '']]","['Scientometry', 'Bibliometry', 'Social Networks', 'Information Retrieval', 'Ontology', 'Semantic Technology', 'Formal ConceptAnalysis']"
8178,2202.10927,Yixuan Zhang,"Nurul M Suhaimi, Yixuan Zhang, Mary Joseph, Miso Kim, Andrea G Parker,
  Jacqueline Griffin","Investigating Older Adults' Attitudes towards Crisis Informatics Tools:
  Opportunities for Enhancing Community Resilience during Disasters",,,10.1145/3491102.3517528,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  The world population is projected to rapidly age over the next 30 years.
Given the increasing digital technology adoption amongst older adults,
researchers have investigated how technology can support aging populations.
However, little work has examined how technology can support older adults
during crises, despite increasingly common natural disasters, public health
emergencies, and other crisis scenarios in which older adults are especially
vulnerable. Addressing this gap, we conducted focus groups with older adults
residing in coastal locations to examine to what extent they felt technology
could support them during emergencies. Our findings characterize participants'
desire for tools that enhance community resilience-local knowledge,
preparedness, community relationships, and communication, that help communities
withstand disasters. Further, older adults' crisis technology preferences were
linked to their sense of control, social relationships, and digital readiness.
We discuss how a focus on community resilience can yield crisis technologies
that more effectively support older adults.
","[{'version': 'v1', 'created': 'Tue, 22 Feb 2022 14:30:48 GMT'}]",2022-02-23,"[['Suhaimi', 'Nurul M', ''], ['Zhang', 'Yixuan', ''], ['Joseph', 'Mary', ''], ['Kim', 'Miso', ''], ['Parker', 'Andrea G', ''], ['Griffin', 'Jacqueline', '']]","['crisis informatics', 'older adults', 'aging population', 'ageing', 'emergencies', 'disasters', 'critical events', 'mobile applications']"
8179,2108.09986,Jongmin Park,"Jongmin Park, Sooyoung Jang, Younghoon Shin","Indoor Path Planning for an Unmanned Aerial Vehicle via Curriculum
  Learning",Submitted to ICCAS 2021,"2021 21st International Conference on Control, Automation and
  Systems (ICCAS)",10.23919/ICCAS52745.2021.9649794,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, reinforcement learning was applied to learning two-dimensional
path planning including obstacle avoidance by unmanned aerial vehicle (UAV) in
an indoor environment. The task assigned to the UAV was to reach the goal
position in the shortest amount of time without colliding with any obstacles.
Reinforcement learning was performed in a virtual environment created using
Gazebo, a virtual environment simulator, to reduce the learning time and cost.
Curriculum learning, which consists of two stages was performed for more
efficient learning. As a result of learning with two reward models, the maximum
goal rates achieved were 71.2% and 88.0%.
","[{'version': 'v1', 'created': 'Mon, 23 Aug 2021 07:41:10 GMT'}]",2022-12-13,"[['Park', 'Jongmin', ''], ['Jang', 'Sooyoung', ''], ['Shin', 'Younghoon', '']]","['path planning', 'curriculum learning', 'reinforcement learning', 'unmanned aerial vehicle (UAV)']"
8180,2006.09896,Adam Sutton,Adam Sutton and Nello Cristianini,"On the Learnability of Concepts: With Applications to Comparing Word
  Embedding Algorithms",7 Pages. AIAI 2020. 5 equations 6 tables,"Artificial Intelligence Applications and Innovations. AIAI 2020.
  IFIP Advances in Information and Communication Technology, vol 584",10.1007/978-3-030-49186-4,,cs.CL cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Word Embeddings are used widely in multiple Natural Language Processing (NLP)
applications. They are coordinates associated with each word in a dictionary,
inferred from statistical properties of these words in a large corpus. In this
paper we introduce the notion of ""concept"" as a list of words that have shared
semantic content. We use this notion to analyse the learnability of certain
concepts, defined as the capability of a classifier to recognise unseen members
of a concept after training on a random subset of it. We first use this method
to measure the learnability of concepts on pretrained word embeddings. We then
develop a statistical analysis of concept learnability, based on hypothesis
testing and ROC curves, in order to compare the relative merits of various
embedding algorithms using a fixed corpora and hyper parameters. We find that
all embedding methods capture the semantic content of those word lists, but
fastText performs better than the others.
","[{'version': 'v1', 'created': 'Wed, 17 Jun 2020 14:25:36 GMT'}]",2020-06-18,"[['Sutton', 'Adam', ''], ['Cristianini', 'Nello', '']]","['Word Embedding', 'Linear Classifier', 'Concepts']"
8181,2108.06482,Takayuki Yamada,"Masaki Noda, Yuki Noguchi, Takayuki Yamada","Extended level set method: a multiphase representation with perfect
  symmetric property, and its application to multi material topology
  optimization",54 pages,"Computer Methods in Applied Mechanics and Engineering, Volume 393,
  1 April 2022, 114742",10.1016/j.cma.2022.114742,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper provides an extended level set (X-LS) based topology optimiza-
tion method for multi material design. In the proposed method, each zero level
set of a level set function {\phi}ij represents the boundary between materials
i and j. Each increase or decrease of {\phi}ij corresponds to a material change
between the two materials. This approach reduces the dependence of the initial
configuration in the optimization calculation and simplifies the sensitivity
analysis. First, the topology optimization problem is formulated in the X-LS
representation. Next, the reaction-diffusion equation that updates the level
set function is introduced, and an optimization algorithm that solves the
equilibrium equations and the reaction-diffusion equation using the fi- nite
element method is constructed. Finally, the validity and utility of the
proposed topology optimization method are confirmed using two- and three-
dimensional numerical examples.
","[{'version': 'v1', 'created': 'Sat, 14 Aug 2021 07:42:16 GMT'}]",2022-03-10,"[['Noda', 'Masaki', ''], ['Noguchi', 'Yuki', ''], ['Yamada', 'Takayuki', '']]","['Extended level set method', 'Topology optimization', 'Multimaterial design', 'Extended topological derivative']"
8182,2109.13771,Vladimir Mandi\'c,"Robert Rama\v{c}, Vladimir Mandi\'c, Neboj\v{s}a Tau\v{s}an, Nicolli
  Rios, S\'avio Freire, Boris P\'erez, Camilo Castellanos, Dar\'io Correal,
  Alexia Pacheco, Gustavo Lopez, Clemente Izurieta, Carolyn Seaman, Rodrigo
  Spinola","Prevalence, Common Causes and Effects of Technical Debt: Results from a
  Family of Surveys with the IT Industry",Journal of Systems and Software,,10.1016/j.jss.2021.111114,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  The technical debt (TD) metaphor describes actions made during various stages
of software development that lead to a more costly future regarding system
maintenance and evolution. According to recent studies, on average 25% of
development effort is spent, i.e. wasted, on TD caused issues in software
development organizations. However, further research is needed to investigate
the relations between various software development activities and TD. The
objective of this study is twofold. First, to get empirical insight on the
understanding and the use of the TD concept in the IT industry. Second, to
contribute towards precise conceptualization of the TD concept through analysis
of causes and effects. In order to address the research objective a family of
surveys was designed as a part of an international initiative that congregates
researchers from 12 countries -- InsighTD. At country level, national teams ran
survey replications with industry practitioners from the respective countries.
In total 653 valid responses were collected from 6 countries. Regarding the
prevalence of the TD concept 22% of practitioners have only theoretical
knowledge about it, and 47% have some practical experiences with TD
identification or management. Further analysis indicated that senior
practitioners who work in larger organizations, larger teams, and on larger
systems are more likely to be experienced with TD management. Time pressure or
deadline was the single most cited cause of TD. Regarding the effects of TD:
delivery delay, low maintainability, and rework were the most cited. InsighTD
is the first family of surveys on technical debt in software engineering. It
provided a methodological framework that allowed multiple replication teams to
conduct research activities and to contribute to a single dataset. Future work
will focus on more specific aspects of TD management.
","[{'version': 'v1', 'created': 'Tue, 28 Sep 2021 14:46:10 GMT'}]",2021-10-19,"[['Ramač', 'Robert', ''], ['Mandić', 'Vladimir', ''], ['Taušan', 'Nebojša', ''], ['Rios', 'Nicolli', ''], ['Freire', 'Sávio', ''], ['Pérez', 'Boris', ''], ['Castellanos', 'Camilo', ''], ['Correal', 'Darío', ''], ['Pacheco', 'Alexia', ''], ['Lopez', 'Gustavo', ''], ['Izurieta', 'Clemente', ''], ['Seaman', 'Carolyn', ''], ['Spinola', 'Rodrigo', '']]","['Technical Debt', 'Survey', 'InsighTD', 'Causes of technical debt', 'Effects of technical debt']"
8183,2001.02501,Saqib Ali Khan,"Saqib Ali Khan, Syed Muhammad Daniyal Khalid, Muhammad Ali Shahzad and
  Faisal Shafait","Table Structure Extraction with Bi-directional Gated Recurrent Unit
  Networks","Proceedings of the 15th International Conference on Document Analysis
  and Recognition (ICDAR) 2019, Sydney, Australia",,10.1109/ICDAR.2019.00220,,cs.CV cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tables present summarized and structured information to the reader, which
makes table structure extraction an important part of document understanding
applications. However, table structure identification is a hard problem not
only because of the large variation in the table layouts and styles, but also
owing to the variations in the page layouts and the noise contamination levels.
A lot of research has been done to identify table structure, most of which is
based on applying heuristics with the aid of optical character recognition
(OCR) to hand pick layout features of the tables. These methods fail to
generalize well because of the variations in the table layouts and the errors
generated by OCR. In this paper, we have proposed a robust deep learning based
approach to extract rows and columns from a detected table in document images
with a high precision. In the proposed solution, the table images are first
pre-processed and then fed to a bi-directional Recurrent Neural Network with
Gated Recurrent Units (GRU) followed by a fully-connected layer with soft max
activation. The network scans the images from top-to-bottom as well as
left-to-right and classifies each input as either a row-separator or a
column-separator. We have benchmarked our system on publicly available UNLV as
well as ICDAR 2013 datasets on which it outperformed the state-of-the-art table
structure extraction systems by a significant margin.
","[{'version': 'v1', 'created': 'Wed, 8 Jan 2020 13:17:44 GMT'}]",2020-02-07,"[['Khan', 'Saqib Ali', ''], ['Khalid', 'Syed Muhammad Daniyal', ''], ['Shahzad', 'Muhammad Ali', ''], ['Shafait', 'Faisal', '']]","['component; bi directional GRU', 'table-layouts', 'UNLV']"
8184,1911.06589,Stefan Marksteiner,"Stefan Marksteiner, Zhendong Ma","Approaching the Automation of Cyber Security Testing of Connected
  Vehicles","3 pages, 1 figure, Central European Cybersecurity Conference 2019
  (CECC2019), Munich",,10.1145/3360664.3360729,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The advancing digitalization of vehicles and automotive systems bears many
advantages for creating and enhancing comfort and safety-related systems
ranging from drive-by-wire, inclusion of advanced displays, entertainment
systems up to sophisticated driving assistance and autonomous driving. It,
however, also contains the inherent risk of being used for purposes that are
not intended for, raging from small non-authorized customizations to the
possibility of full-scale cyberattacks that affect several vehicles to whole
fleets and vital systems such as steering and engine control. To prevent such
conditions and mitigate cybersecurity risks from affecting the safety of road
traffic, testing cybersecurity must be adopted into automotive testing at a
large scale. Currently, the manual penetration testing processes cannot uphold
the increasing demand due to time and cost to test complex systems. We propose
an approach for an architecture that (semi-)automates automotive cybersecurity
test, allowing for more economic testing and therefore keeping up to the rising
demand induced by new vehicle functions as well as the development towards
connected and autonomous vehicles.
","[{'version': 'v1', 'created': 'Fri, 15 Nov 2019 12:34:55 GMT'}]",2019-11-18,"[['Marksteiner', 'Stefan', ''], ['Ma', 'Zhendong', '']]","['Automotive Security', 'Security Testing', 'Test Automation', 'ConnectedVehicles']"
8185,2102.00177,Chao Li,"Chao Li, Balaji Palanisamy, Runhua Xu, Jinlai Xu, and Jingzhe Wang","SteemOps: Extracting and Analyzing Key Operations in Steemit
  Blockchain-based Social Media Platform","Accepted by ACM CODASPY'21. arXiv admin note: text overlap with
  arXiv:1904.07310",,10.1145/3422337.3447845,,cs.CR cs.DB cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advancements in distributed ledger technologies are driving the rise of
blockchain-based social media platforms such as Steemit, where users interact
with each other in similar ways as conventional social networks. These
platforms are autonomously managed by users using decentralized consensus
protocols in a cryptocurrency ecosystem. The deep integration of social
networks and blockchains in these platforms provides potential for numerous
cross-domain research studies that are of interest to both the research
communities. However, it is challenging to process and analyze large volumes of
raw Steemit data as it requires specialized skills in both software engineering
and blockchain systems and involves substantial efforts in extracting and
filtering various types of operations. To tackle this challenge, we collect
over 38 million blocks generated in Steemit during a 45 month time period from
2016/03 to 2019/11 and extract ten key types of operations performed by the
users. The results generate SteemOps, a new dataset that organizes more than
900 million operations from Steemit into three sub-datasets namely (i)
social-network operation dataset (SOD), (ii) witness-election operation dataset
(WOD) and (iii) value-transfer operation dataset (VOD). We describe the dataset
schema and its usage in detail and outline possible future research studies
using SteemOps. SteemOps is designed to facilitate future research aimed at
providing deeper insights on emerging blockchain-based social media platforms.
","[{'version': 'v1', 'created': 'Sat, 30 Jan 2021 07:18:39 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Feb 2021 05:51:39 GMT'}]",2021-02-11,"[['Li', 'Chao', ''], ['Palanisamy', 'Balaji', ''], ['Xu', 'Runhua', ''], ['Xu', 'Jinlai', ''], ['Wang', 'Jingzhe', '']]","['blockchain', 'social network', 'Steem', 'dataset']"
8186,2210.14495,Bagus Tris Atmaja Mr,Bagus Tris Atmaja and Masato Akagi,"Two-stage dimensional emotion recognition by fusing predictions of
  acoustic and text networks using SVM",Published in Speech Communications,"Speech Commun., vol. 126, pp. 9-21, Feb. 2021",10.1016/j.specom.2020.11.003,,cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic speech emotion recognition (SER) by a computer is a critical
component for more natural human-machine interaction. As in human-human
interaction, the capability to perceive emotion correctly is essential to take
further steps in a particular situation. One issue in SER is whether it is
necessary to combine acoustic features with other data such as facial
expressions, text, and motion capture. This research proposes to combine
acoustic and text information by applying a late-fusion approach consisting of
two steps. First, acoustic and text features are trained separately in deep
learning systems. Second, the prediction results from the deep learning systems
are fed into a support vector machine (SVM) to predict the final regression
score. Furthermore, the task in this research is dimensional emotion modeling
because it can enable a deeper analysis of affective states. Experimental
results show that this two-stage, late-fusion approach, obtains higher
performance than that of any one-stage processing, with a linear correlation
from one-stage to two-stage processing. This late-fusion approach improves
previous early fusion results measured in concordance correlation coefficients
score.
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2022 05:49:13 GMT'}]",2022-10-27,"[['Atmaja', 'Bagus Tris', ''], ['Akagi', 'Masato', '']]","['automatic speech emotion recognition', 'affective computing', 'late']"
8187,1806.03695,Mehdi Faraji,"Mehdi Faraji, Irene Cheng, Iris Naudin, Anup Basu","Segmentation of Arterial Walls in Intravascular Ultrasound
  Cross-Sectional Images Using Extremal Region Selection","15 pages, 5 figures, published in Elsevier Ultrasonics",,10.1016/j.ultras.2017.11.020,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intravascular Ultrasound (IVUS) is an intra-operative imaging modality that
facilitates observing and appraising the vessel wall structure of the human
coronary arteries. Segmentation of arterial wall boundaries from the IVUS
images is not only crucial for quantitative analysis of the vessel walls and
plaque characteristics, but is also necessary for generating 3D reconstructed
models of the artery. The aim of this study is twofold. Firstly, we investigate
the feasibility of using a recently proposed region detector, namely Extremal
Region of Extremum Level (EREL) to delineate the luminal and media-adventitia
borders in IVUS frames acquired by 20 MHz probes. Secondly, we propose a region
selection strategy to label two ERELs as lumen and media based on the stability
of their textural information. We extensively evaluated our selection strategy
on the test set of a standard publicly available dataset containing 326 IVUS
B-mode images. We showed that in the best case, the average Hausdorff Distances
(HD) between the extracted ERELs and the actual lumen and media were $0.22$ mm
and $0.45$ mm, respectively. The results of our experiments revealed that our
selection strategy was able to segment the lumen with $\le 0.3$ mm HD to the
gold standard even though the images contained major artifacts such as
bifurcations, shadows, and side branches. Moreover, when there was no artifact,
our proposed method was able to delineate media-adventitia boundaries with
$0.31$ mm HD to the gold standard. Furthermore, our proposed segmentation
method runs in time that is linear in the number of pixels in each frame. Based
on the results of this work, by using a 20 MHz IVUS probe with controlled
pullback, not only can we now analyze the internal structure of human arteries
more accurately, but also segment each frame during the pullback procedure
because of the low run time of our proposed segmentation method.
","[{'version': 'v1', 'created': 'Sun, 10 Jun 2018 17:37:11 GMT'}]",2018-06-12,"[['Faraji', 'Mehdi', ''], ['Cheng', 'Irene', ''], ['Naudin', 'Iris', ''], ['Basu', 'Anup', '']]","['Intravascular', 'Ultrasound', 'IVUS', 'Segmentation', 'Extremal Regions', 'Extremum Level', 'EREL']"
8188,1506.08919,Nicolas Schwind,"Nicolas Schwind, Katsumi Inoue","Characterization of Logic Program Revision as an Extension of
  Propositional Revision","42 pages, 5 figures, to appear in Theory and Practice of Logic
  Programming (accepted in June 2015)",Theory and Practice of Logic Programming 16 (2016) 111-138,10.1017/S1471068415000101,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the problem of belief revision of logic programs, i.e., how to
incorporate to a logic program P a new logic program Q. Based on the structure
of SE interpretations, Delgrande et al. adapted the well-known AGM framework to
logic program (LP) revision. They identified the rational behavior of LP
revision and introduced some specific operators. In this paper, a constructive
characterization of all rational LP revision operators is given in terms of
orderings over propositional interpretations with some further conditions
specific to SE interpretations. It provides an intuitive, complete procedure
for the construction of all rational LP revision operators and makes easier the
comprehension of their semantic and computational properties. We give a
particular consideration to logic programs of very general form, i.e., the
generalized logic programs (GLPs). We show that every rational GLP revision
operator is derived from a propositional revision operator satisfying the
original AGM postulates. Interestingly, the further conditions specific to GLP
revision are independent from the propositional revision operator on which a
GLP revision operator is based. Taking advantage of our characterization
result, we embed the GLP revision operators into structures of Boolean
lattices, that allow us to bring to light some potential weaknesses in the
adapted AGM postulates. To illustrate our claim, we introduce and characterize
axiomatically two specific classes of (rational) GLP revision operators which
arguably have a drastic behavior. We additionally consider two more restricted
forms of logic programs, i.e., the disjunctive logic programs (DLPs) and the
normal logic programs (NLPs) and adapt our characterization result to DLP and
NLP revision operators.
","[{'version': 'v1', 'created': 'Tue, 30 Jun 2015 02:09:02 GMT'}]",2020-02-19,"[['Schwind', 'Nicolas', ''], ['Inoue', 'Katsumi', '']]","['belief revision', 'logic programming', 'characterization theorems']"
8189,cs/0107008,Leonid A. Levin,"Bruno Durand, Leonid A. Levin, Alexander Shen",Complex Tilings,"An extended abstract of a weaker version of this article appeared in
  Proceedings of the Annual ACM Symposium on Theory of Computing (STOC), 2001","Journal of Symbolic Logic, 73(2):593-613, 2008",10.2178/jsl/1208359062,,cs.CC cs.DM,,"  We study the minimal complexity of tilings of a plane with a given tile set.
We note that every tile set admits either no tiling or some tiling with O(n)
Kolmogorov complexity of its n-by-n squares. We construct tile sets for which
this bound is tight: all n-by-n squares in all tilings have complexity at least
n. This adds a quantitative angle to classical results on non-recursivity of
tilings -- that we also develop in terms of Turing degrees of unsolvability.
  Keywords: Tilings, Kolmogorov complexity, recursion theory
","[{'version': 'v1', 'created': 'Wed, 4 Jul 2001 21:09:25 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Dec 2006 20:47:11 GMT'}, {'version': 'v3', 'created': 'Tue, 25 Sep 2007 17:37:39 GMT'}]",2018-12-03,"[['Durand', 'Bruno', ''], ['Levin', 'Leonid A.', ''], ['Shen', 'Alexander', '']]","['Tilings', 'Kolmogorov complexity', 'recursion theory']"
8190,2101.04470,Amir M. Mir,"Amir M. Mir, Evaldas Latoskinas, Sebastian Proksch, Georgios Gousios","Type4Py: Practical Deep Similarity Learning-Based Type Inference for
  Python",Preprint for the ICSE'22 technical track,,10.1145/3510003.3510124,,cs.LG cs.PL cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Dynamic languages, such as Python and Javascript, trade static typing for
developer flexibility and productivity. Lack of static typing can cause
run-time exceptions and is a major factor for weak IDE support. To alleviate
these issues, PEP 484 introduced optional type annotations for Python. As
retrofitting types to existing codebases is error-prone and laborious, machine
learning (ML)-based approaches have been proposed to enable automatic type
inference based on existing, partially annotated codebases. However, previous
ML-based approaches are trained and evaluated on human-provided type
annotations, which might not always be sound, and hence this may limit the
practicality for real-world usage. In this paper, we present Type4Py, a deep
similarity learning-based hierarchical neural network model. It learns to
discriminate between similar and dissimilar types in a high-dimensional space,
which results in clusters of types. Likely types for arguments, variables, and
return values can then be inferred through the nearest neighbor search. Unlike
previous work, we trained and evaluated our model on a type-checked dataset and
used mean reciprocal rank (MRR) to reflect the performance perceived by users.
The obtained results show that Type4Py achieves an MRR of 77.1%, which is a
substantial improvement of 8.1% and 16.7% over the state-of-the-art approaches
Typilus and TypeWriter, respectively. Finally, to aid developers with
retrofitting types, we released a Visual Studio Code extension, which uses
Type4Py to provide ML-based type auto-completion for Python.
","[{'version': 'v1', 'created': 'Tue, 12 Jan 2021 13:32:53 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Jul 2021 16:10:37 GMT'}, {'version': 'v3', 'created': 'Wed, 19 Jan 2022 14:02:04 GMT'}]",2022-01-20,"[['Mir', 'Amir M.', ''], ['Latoskinas', 'Evaldas', ''], ['Proksch', 'Sebastian', ''], ['Gousios', 'Georgios', '']]","['Type Inference', 'Similarity Learning', 'Machine Learning', 'Mean Reciprocal Rank', 'Python']"
8191,2205.08524,Nyasha Masamba,"Nyasha Masamba, Kerstin Eder, Tim Blackmore","Supervised Learning for Coverage-Directed Test Selection in
  Simulation-Based Verification",,"2022 IEEE AITest Conference Proceedings, 2022, pp. 19-25",10.1109/AITest55621.2022.00012,,cs.AR cs.AI cs.LG cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Constrained random test generation is one of the most widely adopted methods
for generating stimuli for simulation-based verification. Randomness leads to
test diversity, but tests tend to repeatedly exercise the same design logic.
Constraints are written (typically manually) to bias random tests towards
interesting, hard-to-reach, and yet-untested logic. However, as verification
progresses, most constrained random tests yield little to no effect on
functional coverage. If stimuli generation consumes significantly less
resources than simulation, then a better approach involves randomly generating
a large number of tests, selecting the most effective subset, and only
simulating that subset. In this paper, we introduce a novel method for
automatic constraint extraction and test selection. This method, which we call
coverage-directed test selection, is based on supervised learning from coverage
feedback. Our method biases selection towards tests that have a high
probability of increasing functional coverage, and prioritises them for
simulation. We show how coverage-directed test selection can reduce manual
constraint writing, prioritise effective tests, reduce verification resource
consumption, and accelerate coverage closure on a large, real-life industrial
hardware design.
","[{'version': 'v1', 'created': 'Tue, 17 May 2022 17:49:30 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Jun 2022 16:53:06 GMT'}, {'version': 'v3', 'created': 'Sun, 16 Oct 2022 16:24:52 GMT'}]",2022-10-18,"[['Masamba', 'Nyasha', ''], ['Eder', 'Kerstin', ''], ['Blackmore', 'Tim', '']]","['DesignVerification', 'SupervisedLearning', 'Coverage-Directed Test Generation', 'Test Selection', 'MachineLearning for Verification', 'CDG', 'EDA']"
8192,2112.13672,Peter Breuer,Peter Breuer,An Obfuscating C Compiler for Encrypted Computing,"Begun Mar 16 2018, submitted May 28 2018, SECRYPT 2018, accepted,
  final copy Jun 19 2018, withdrawn for conflict of dates. The paper extends to
  arrays of arrays one at SECRYPT 2017 that compiled arrays (difficulty is
  pointers). Rewritten for DSN 2018 (1902.06146) and rejected! (it added ideal
  criteria for security that a source language translator cannot satisfy). Here
  for historical reference. arXiv admin note: text overlap with
  arXiv:1902.06146",,10.13140/RG.2.2.35863.70563,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper describes an `obfuscating' C compiler for encrypted computing. The
context consists of (i) a processor that `works encrypted', taking in encrypted
inputs and producing encrypted outputs while the data remains in encrypted form
throughout processing, and (ii) machine codes that support arbitrary
interpretations of the encrypted input and outputs from each instruction, as
far as an adversary who does not know the encryption can tell. The compiler on
each recompilation of the same source generates object code of the same form
for which the runtime traces have the same form, but the data beneath the
encryption may arbitrarily differ from nominal at each point in the trace,
independently so far as the laws of computation allow.
","[{'version': 'v1', 'created': 'Mon, 27 Dec 2021 13:40:43 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Dec 2021 12:21:06 GMT'}]",2021-12-30,"[['Breuer', 'Peter', '']]","['Obfuscation', 'compilation', 'privacy', 'encrypted computing']"
8193,2005.04126,Omar Reyad,"M.E. Karar, A.M. Al-Masaad, O. Reyad",GASDUINO-Wireless Air Quality Monitoring System Using Internet of Things,"5 pages, 4 figures, 1 table","Inf. Sci. Lett. 9(2), 113-117 (2020)",10.18576/isl/090208,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Health Effects Institute (HEI) reported recently that the deaths from the
negative health effects of the air pollution in the Middle East Region is about
500,000 people. Therefore, this paper presents a new design and development of
portable system; called GASDUINO that allows the user to measure the quality of
air using the Internet of Things (IoT). The main components of developed
GASDUINO system are the Arduino microcontroller board, Gas sensor (MQ-135),
Android user interface (UI) connected with all things via Remote XY Arduino
cloud. The developed system can alarm the users about the dangerous levels of
the air quality index (AQI) or the particle per million (PPM) levels in the
range of 0 to above 200 PPM. The developed GASDUINO system is considered as an
essential environmental module in the development and sustainability of future
smart cities.
","[{'version': 'v1', 'created': 'Fri, 8 May 2020 16:06:20 GMT'}]",2020-05-11,"[['Karar', 'M. E.', ''], ['Al-Masaad', 'A. M.', ''], ['Reyad', 'O.', '']]","['GASDUINO', 'Air Pollution', 'Internet of Things', 'Embedded Systems']"
8194,2210.09290,Sahil Faizal Mr,Sahil Faizal,"Automated Identification of Tree Species by Bark Texture Classification
  Using Convolutional Neural Networks","11 Pages, 10 Figures and 2 Tables",2022,10.22214/ijraset.2022.46846,"Volume 10, Issue 9",cs.CV,http://creativecommons.org/publicdomain/zero/1.0/,"  Identification of tree species plays a key role in forestry related tasks
like forest conservation, disease diagnosis and plant production. There had
been a debate regarding the part of the tree to be used for differentiation,
whether it should be leaves, fruits, flowers or bark. Studies have proven that
bark is of utmost importance as it will be present despite seasonal variations
and provides a characteristic identity to a tree by variations in the
structure. In this paper, a deep learning based approach is presented by
leveraging the method of computer vision to classify 50 tree species, on the
basis of bark texture using the BarkVN-50 dataset. This is the maximum number
of trees being considered for bark classification till now. A convolutional
neural network(CNN), ResNet101 has been implemented using transfer-learning
based technique of fine tuning to maximise the model performance. The model
produced an overall accuracy of >94% during the evaluation. The performance
validation has been done using K-Fold Cross Validation and by testing on unseen
data collected from the Internet, this proved the model's generalization
capability for real-world uses.
","[{'version': 'v1', 'created': 'Mon, 3 Oct 2022 13:09:50 GMT'}]",2022-10-18,"[['Faizal', 'Sahil', '']]","['Image Classification', 'Data Augmentation', 'Species Identification', 'Convolutional Neural Networks', 'Sampling']"
8195,2202.06213,Nelson Rodelas,"Kent Darryl Aglibar, Garret Christopher Alegre, Gerald Del Mundo,
  Kenny Francis Duro, and Nelson Rodelas","Ticketing System: A Descriptive Research on the Use of Ticketing System
  for Project Management and Issue Tracking in IT Companies","presented in National Research Conference in Computer Engineering and
  Technology",,10.25147/ijcsr.2017.001.1.90,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  IT companies are popular in the present time as technology arises in the
entire world. Incidents and Requests for either clients or company internal are
hard to manually track as it is a day-to-day transaction. To keep all the logs,
IT Companies are using a ticketing system to track all the records they are
gathering. One of the most popular ticketing systems is the JIRA. Either the
support team or company internal is benefitting from the use of JIRA as it
easily documents all the different transactions and keeps track of different
incidents and requests. One of the cons of JIRA is its limited features. The
researchers conducted research where it aims to determine the effectiveness of
JIRA as a ticketing system despite its limited features. The researchers used a
descriptive method to analyze the pros and cons of this ticketing system. It is
concluded that this JIRA Ticketing system is helpful for both support groups
and internal members of the company as they track all the incidents and request
tickets for their clients despite the limited features of JIRA. The researchers
strongly recommend to venture out and try other analytic models and start with
the ones mentioned in this study for a good foundation and idea. This is can
provide the research a new set of results that can be useful to both
established and startup companies.
","[{'version': 'v1', 'created': 'Sun, 13 Feb 2022 05:20:48 GMT'}]",2022-02-15,"[['Aglibar', 'Kent Darryl', ''], ['Alegre', 'Garret Christopher', ''], ['Del Mundo', 'Gerald', ''], ['Duro', 'Kenny Francis', ''], ['Rodelas', 'Nelson', '']]","['Ticketing System', 'Project Management', 'day-to-day transaction', 'Tracker', 'Documentations   INTRODUCTION']"
8196,2008.09634,Morteza Ghahremani,"Morteza Ghahremani, Bernard Tiddeman, Yonghuai Liu and Ardhendu Behera",Orderly Disorder in Point Cloud Domain,,16th European Conference on Computer Vision (ECCV2020),10.1007/978-3-030-58604-1_30,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  In the real world, out-of-distribution samples, noise and distortions exist
in test data. Existing deep networks developed for point cloud data analysis
are prone to overfitting and a partial change in test data leads to
unpredictable behaviour of the networks. In this paper, we propose a smart yet
simple deep network for analysis of 3D models using `orderly disorder' theory.
Orderly disorder is a way of describing the complex structure of disorders
within complex systems. Our method extracts the deep patterns inside a 3D
object via creating a dynamic link to seek the most stable patterns and at
once, throws away the unstable ones. Patterns are more robust to changes in
data distribution, especially those that appear in the top layers. Features are
extracted via an innovative cloning decomposition technique and then linked to
each other to form stable complex patterns. Our model alleviates the
vanishing-gradient problem, strengthens dynamic link propagation and
substantially reduces the number of parameters. Extensive experiments on
challenging benchmark datasets verify the superiority of our light network on
the segmentation and classification tasks, especially in the presence of noise
wherein our network's performance drops less than 10% while the
state-of-the-art networks fail to work.
","[{'version': 'v1', 'created': 'Fri, 21 Aug 2020 18:18:09 GMT'}]",2020-12-04,"[['Ghahremani', 'Morteza', ''], ['Tiddeman', 'Bernard', ''], ['Liu', 'Yonghuai', ''], ['Behera', 'Ardhendu', '']]","['Point cloud', 'deep neural network', 'orderly disorder', 'segmentation', 'classification']"
8197,2104.04798,Kaleem Nawaz Khan Mr.,"Kaleem Nawaz Khan, Najeeb Ullah, Sikandar Ali, Muhammad Salman Khan,
  Mohammad Nauman and Anwar Ghani","Op2Vec: An Opcode Embedding Technique and Dataset Design for End-to-End
  Detection of Android Malware",,,10.1155/2022/3710968,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Android is one of the leading operating systems for smart phones in terms of
market share and usage. Unfortunately, it is also an appealing target for
attackers to compromise its security through malicious applications. To tackle
this issue, domain experts and researchers are trying different techniques to
stop such attacks. All the attempts of securing Android platform are somewhat
successful. However, existing detection techniques have severe shortcomings,
including the cumbersome process of feature engineering. Designing
representative features require expert domain knowledge. There is a need for
minimizing human experts' intervention by circumventing handcrafted feature
engineering. Deep learning could be exploited by extracting deep features
automatically. Previous work has shown that operational codes (opcodes) of
executables provide key information to be used with deep learning models for
detection process of malicious applications. The only challenge is to feed
opcodes information to deep learning models. Existing techniques use one-hot
encoding to tackle the challenge. However, the one-hot encoding scheme has
severe limitations. In this paper, we introduce; (1) a novel technique for
opcodes embedding, which we name Op2Vec, (2) based on the learned Op2Vec we
have developed a dataset for end-to-end detection of android malware.
Introducing the end-to-end Android malware detection technique avoids
expert-intensive handcrafted features extraction, and ensures automation. Some
of the recent deep learning-based techniques showed significantly improved
results when tested with the proposed approach and achieved an average
detection accuracy of 97.47%, precision of 0.976 and F1 score of 0.979.
","[{'version': 'v1', 'created': 'Sat, 10 Apr 2021 15:56:37 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Mar 2022 16:30:43 GMT'}]",2022-05-31,"[['Khan', 'Kaleem Nawaz', ''], ['Ullah', 'Najeeb', ''], ['Ali', 'Sikandar', ''], ['Khan', 'Muhammad Salman', ''], ['Nauman', 'Mohammad', ''], ['Ghani', 'Anwar', '']]","['Andriod malware detection', 'opcode embedding', 'end-to-endlearning', 'deep learning']"
8198,2106.07866,Bishnu Prasad Gautam Dr.,"Gautam Bishnu Prasad, Batajoo Amit, Wasaki Katsumi",Fogging Jyaguchi Services in Tensai Gothalo,7 pages with figures,"International Journal of Computer Trends and Technology (IJCTT),
  2015",10.14445/22312803/IJCTT-V28P122,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  This paper describes the efficient method of fogging in Tensai Gothalo.
Tensai Gothalo is a novel dynamic router device developed in Gautam-Asami
Laboratory of Wakkanai Hokusei Gakuen University which has sensing, actuating,
monitoring and movable capability. Similarly, fogging is a new concept of cloud
computing at which the data plane is defined in user device. In this paper we
would like to present the stepwise explanation about how to fog in Tensai
Gothalo. Furthermore, we will elaborate a technique to decentralize data with
improvement in QoS and reducing latency without affecting the legacy services
of clouds that can still work together while needed.
","[{'version': 'v1', 'created': 'Tue, 15 Jun 2021 04:01:21 GMT'}]",2021-06-16,"[['Prasad', 'Gautam Bishnu', ''], ['Amit', 'Batajoo', ''], ['Katsumi', 'Wasaki', '']]","['Cloud Computing', 'Jyaguchi', 'Tensai Gothalo', 'IOT']"
8199,2111.00094,Kshama Dwarakanath,"Kshama Dwarakanath, Svitlana S Vyetrenko and Tucker Balch","Profit equitably: An investigation of market maker's impact on equitable
  outcomes",,,10.1145/3490354.3494369,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We look at discovering the impact of market microstructure on equitability
for market participants at public exchanges such as the New York Stock Exchange
or NASDAQ. Are these environments equitable venues for low-frequency
participants (such as retail investors)? In particular, can market makers
contribute to equitability for these agents? We use a simulator to assess the
effect a market marker can have on equality of outcomes for consumer or retail
traders by adjusting its parameters. Upon numerically quantifying market
equitability by the entropy of the price returns distribution of consumer
agents, we demonstrate that market makers indeed support equitability and that
a negative correlation is observed between the profits of the market maker and
equitability. We then use multi objective reinforcement learning to
concurrently optimize for the two objectives of consumer agent equitability and
market maker profitability, which leads us to learn policies that facilitate
lower market volatility and tighter spreads for comparable profit levels.
","[{'version': 'v1', 'created': 'Fri, 29 Oct 2021 21:50:47 GMT'}]",2021-11-02,"[['Dwarakanath', 'Kshama', ''], ['Vyetrenko', 'Svitlana S', ''], ['Balch', 'Tucker', '']]","['Agent based simulations', 'equitability', 'multi objective reinforcementlearning', 'volatility']"
8200,2202.11134,Aditya Kusupati,"Dhruv Jain, Khoa Huynh Anh Nguyen, Steven Goodman, Rachel
  Grossman-Kahn, Hung Ngo, Aditya Kusupati, Ruofei Du, Alex Olwal, Leah
  Findlater, Jon E. Froehlich","ProtoSound: A Personalized and Scalable Sound Recognition System for
  Deaf and Hard-of-Hearing Users","Published at the ACM CHI Conference on Human Factors in Computing
  Systems (CHI) 2022",,10.1145/3491102.3502020,,cs.HC cs.LG cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advances have enabled automatic sound recognition systems for deaf and
hard of hearing (DHH) users on mobile devices. However, these tools use
pre-trained, generic sound recognition models, which do not meet the diverse
needs of DHH users. We introduce ProtoSound, an interactive system for
customizing sound recognition models by recording a few examples, thereby
enabling personalized and fine-grained categories. ProtoSound is motivated by
prior work examining sound awareness needs of DHH people and by a survey we
conducted with 472 DHH participants. To evaluate ProtoSound, we characterized
performance on two real-world sound datasets, showing significant improvement
over state-of-the-art (e.g., +9.7% accuracy on the first dataset). We then
deployed ProtoSound's end-user training and real-time recognition through a
mobile application and recruited 19 hearing participants who listened to the
real-world sounds and rated the accuracy across 56 locations (e.g., homes,
restaurants, parks). Results show that ProtoSound personalized the model
on-device in real-time and accurately learned sounds across diverse acoustic
contexts. We close by discussing open challenges in personalizable sound
recognition, including the need for better recording interfaces and algorithmic
improvements.
","[{'version': 'v1', 'created': 'Tue, 22 Feb 2022 19:21:13 GMT'}]",2022-02-24,"[['Jain', 'Dhruv', ''], ['Nguyen', 'Khoa Huynh Anh', ''], ['Goodman', 'Steven', ''], ['Grossman-Kahn', 'Rachel', ''], ['Ngo', 'Hung', ''], ['Kusupati', 'Aditya', ''], ['Du', 'Ruofei', ''], ['Olwal', 'Alex', ''], ['Findlater', 'Leah', ''], ['Froehlich', 'Jon E.', '']]","['Accessibility', 'deaf', 'Deaf', 'hard of hearing', 'sound awareness', 'sound recognition']"
8201,2205.07647,Till Kletti,"Till Kletti, Jean-Michel Renders, Patrick Loiseau","Pareto-Optimal Fairness-Utility Amortizations in Rankings with a DBN
  Exposure Model","12 pages, 6 figures, published at SIGIR 2022",,10.1145/3477495.3532036,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, it has become clear that rankings delivered in many areas
need not only be useful to the users but also respect fairness of exposure for
the item producers. We consider the problem of finding ranking policies that
achieve a Pareto-optimal tradeoff between these two aspects. Several methods
were proposed to solve it; for instance a popular one is to use linear
programming with a Birkhoff-von Neumann decomposition. These methods, however,
are based on a classical Position Based exposure Model (PBM), which assumes
independence between the items (hence the exposure only depends on the rank).
In many applications, this assumption is unrealistic and the community
increasingly moves towards considering other models that include dependences,
such as the Dynamic Bayesian Network (DBN) exposure model. For such models,
computing (exact) optimal fair ranking policies remains an open question.
  We answer this question by leveraging a new geometrical method based on the
so-called expohedron proposed recently for the PBM (Kletti et al., WSDM'22). We
lay out the structure of a new geometrical object (the DBN-expohedron), and
propose for it a Carath\'eodory decomposition algorithm of complexity $O(n^3)$,
where $n$ is the number of documents to rank. Such an algorithm enables
expressing any feasible expected exposure vector as a distribution over at most
$n$ rankings; furthermore we show that we can compute the whole set of
Pareto-optimal expected exposure vectors with the same complexity $O(n^3)$. Our
work constitutes the first exact algorithm able to efficiently find a
Pareto-optimal distribution of rankings. It is applicable to a broad range of
fairness notions, including classical notions of meritocratic and demographic
fairness. We empirically evaluate our method on the TREC2020 and MSLR datasets
and compare it to several baselines in terms of Pareto-optimality and speed.
","[{'version': 'v1', 'created': 'Mon, 16 May 2022 13:07:32 GMT'}]",2022-05-17,"[['Kletti', 'Till', ''], ['Renders', 'Jean-Michel', ''], ['Loiseau', 'Patrick', '']]","['fair ranking', 'multi-objective optimization', 'DBN', 'expohedron', 'GLS', 'Carathéodory', 'Pareto-optimal']"
8202,2009.10484,Jonathan D. Gammell,Jonathan D. Gammell and Marlin P. Strub,Asymptotically Optimal Sampling-Based Motion Planning Methods,"Posted with permission from the Annual Review of Control, Robotics,
  and Autonomous Systems, Volume 4. Copyright 2021 by Annual Reviews,
  https://www.annualreviews.org/. 25 pages. 2 figures","Annual Review of Control, Robotics, and Autonomous Systems, 4(1),
  2021",10.1146/annurev-control-061920-093753,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motion planning is a fundamental problem in autonomous robotics that requires
finding a path to a specified goal that avoids obstacles and takes into account
a robot's limitations and constraints. It is often desirable for this path to
also optimize a cost function, such as path length.
  Formal path-quality guarantees for continuously valued search spaces are an
active area of research interest. Recent results have proven that some
sampling-based planning methods probabilistically converge toward the optimal
solution as computational effort approaches infinity. This survey summarizes
the assumptions behind these popular asymptotically optimal techniques and
provides an introduction to the significant ongoing research on this topic.
","[{'version': 'v1', 'created': 'Tue, 22 Sep 2020 12:13:55 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Jan 2021 18:04:07 GMT'}]",2021-01-14,"[['Gammell', 'Jonathan D.', ''], ['Strub', 'Marlin P.', '']]","['robotics', 'motion planning', 'robot motion planning', 'sampling-basedplanning', 'optimal motion planning', 'asymptotically optimal motionplanning']"
8203,1908.06503,Ivy Peng,"Ivy B. Peng, Maya B. Gokhale, Eric W. Green",System Evaluation of the Intel Optane Byte-addressable NVM,,"In Proceedings of the International Symposium on Memory Systems,
  2019",10.1145/3357526.3357568,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Byte-addressable non-volatile memory (NVM) features high density, DRAM
comparable performance, and persistence. These characteristics position NVM as
a promising new tier in the memory hierarchy. Nevertheless, NVM has asymmetric
read and write performance, and considerably higher write energy than DRAM. Our
work provides an in-depth evaluation of the first commercially available
byte-addressable NVM -- the Intel Optane DC persistent memory. The first part
of our study quantifies the latency, bandwidth, power efficiency, and energy
consumption under eight memory configurations. We also evaluate the real impact
on in-memory graph processing workloads. Our results show that augmenting NVM
with DRAM is essential, and the combination can effectively bridge the
performance gap and provide reasonable performance with higher capacity. We
also identify NUMA-related performance characteristics for accesses to memory
on a remote socket. In the second part, we employ two fine-grained allocation
policies to control traffic distribution between DRAM and NVM. Our results show
that bandwidth spilling between DRAM and NVM could provide 2.0x bandwidth and
enable $20\%$ larger problems than using DRAM as a cache. Also, write isolation
between DRAM and NVM could save up to 3.9x energy and improves bandwidth by
3.1x compared to DRAM-cached NVM. We establish a roofline model to explore
power and energy efficiency at various distributions of read-only traffic. Our
results show that NVM requires 1.8x lower power than DRAM for data-intensive
workloads. Overall, applications can significantly optimize performance and
power efficiency by adapting traffic distribution to NVM and DRAM through
memory configurations and fine-grained policies to fully exploit the new memory
device.
","[{'version': 'v1', 'created': 'Sun, 18 Aug 2019 19:29:29 GMT'}]",2019-10-18,"[['Peng', 'Ivy B.', ''], ['Gokhale', 'Maya B.', ''], ['Green', 'Eric W.', '']]","['Non-volatile memory', 'Optane', 'heterogeneous memory', 'persistentmemory', 'byte-addressable NVM', 'power e\uffffciency', 'roo\uffffine model']"
8204,2107.05302,Burak Can,"Burak Can, Jens Leth Hougaard, Mohsen Pourpouneh",On Reward Sharing in Blockchain Mining Pools,,,10.26481/umagsb.2021009,,cs.GT econ.TH,http://creativecommons.org/licenses/by/4.0/,"  This paper proposes a conceptual framework for the analysis of reward sharing
schemes in mining pools, such as those associated with Bitcoin. The framework
is centered around the reported shares in a pool instead of agents and results
in two new fairness criteria, absolute and relative redistribution. These
criteria impose that the addition of a share to the pool affects all previous
shares in the same way, either in absolute amount or in relative ratio. We
characterize two large classes of economically viable reward sharing schemes
corresponding to each of these fairness criteria in turn. We further show that
the intersection of these classes brings about a generalization of the
well-known proportional scheme, which also leads to a new characterization of
the proportional scheme as a corollary.
","[{'version': 'v1', 'created': 'Mon, 12 Jul 2021 10:25:23 GMT'}]",2021-07-13,"[['Can', 'Burak', ''], ['Hougaard', 'Jens Leth', ''], ['Pourpouneh', 'Mohsen', '']]","['Blockchain', 'Bitcoin', 'fairness', 'mining pools', 'resource allocation', 'mechanism design']"
8205,2208.05213,Bram Vanherle,"Bram Vanherle, Tim Vervoort, Nick Michiels, Philippe Bekaert","Automatic Camera Control and Directing with an Ultra-High-Definition
  Collaborative Recording System",,"CVMP, 2021, 1-10",10.1145/3485441.3485648,,cs.CV cs.MM,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Capturing an event from multiple camera angles can give a viewer the most
complete and interesting picture of that event. To be suitable for
broadcasting, a human director needs to decide what to show at each point in
time. This can become cumbersome with an increasing number of camera angles.
The introduction of omnidirectional or wide-angle cameras has allowed for
events to be captured more completely, making it even more difficult for the
director to pick a good shot. In this paper, a system is presented that, given
multiple ultra-high resolution video streams of an event, can generate a
visually pleasing sequence of shots that manages to follow the relevant action
of an event. Due to the algorithm being general purpose, it can be applied to
most scenarios that feature humans. The proposed method allows for online
processing when real-time broadcasting is required, as well as offline
processing when the quality of the camera operation is the priority. Object
detection is used to detect humans and other objects of interest in the input
streams. Detected persons of interest, along with a set of rules based on
cinematic conventions, are used to determine which video stream to show and
what part of that stream is virtually framed. The user can provide a number of
settings that determine how these rules are interpreted. The system is able to
handle input from different wide-angle video streams by removing lens
distortions. Using a user study it is shown, for a number of different
scenarios, that the proposed automated director is able to capture an event
with aesthetically pleasing video compositions and human-like shot switching
behavior.
","[{'version': 'v1', 'created': 'Wed, 10 Aug 2022 08:28:08 GMT'}]",2022-08-11,"[['Vanherle', 'Bram', ''], ['Vervoort', 'Tim', ''], ['Michiels', 'Nick', ''], ['Bekaert', 'Philippe', '']]","['Video processing', 'automated directing', 'object tracking']"
8206,2103.05760,Tarik A. Rashid,"Hardi M. Mohammed, Zrar Kh. Abdul, Tarik A. Rashid, Abeer Alsadoon,
  Nebojsa Bacanin",A New K means Grey Wolf Algorithm for Engineering Problems,"15 pages. World Journal of Engineering, 2021",,10.1108/WJE-10-2020-0527,,cs.AI cs.NE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Purpose: The development of metaheuristic algorithms has increased by
researchers to use them extensively in the field of business, science, and
engineering. One of the common metaheuristic optimization algorithms is called
Grey Wolf Optimization (GWO). The algorithm works based on imitation of the
wolves' searching and the process of attacking grey wolves. The main purpose of
this paper to overcome the GWO problem which is trapping into local optima.
  Design or Methodology or Approach: In this paper, the K-means clustering
algorithm is used to enhance the performance of the original Grey Wolf
Optimization by dividing the population into different parts. The proposed
algorithm is called K-means clustering Grey Wolf Optimization (KMGWO).
  Findings: Results illustrate the efficiency of KMGWO is superior to GWO. To
evaluate the performance of the KMGWO, KMGWO applied to solve 10 CEC2019
benchmark test functions. Results prove that KMGWO is better compared to GWO.
KMGWO is also compared to Cat Swarm Optimization (CSO), Whale Optimization
Algorithm-Bat Algorithm (WOA-BAT), and WOA, so, KMGWO achieves the first rank
in terms of performance. Statistical results proved that KMGWO achieved a
higher significant value compared to the compared algorithms. Also, the KMGWO
is used to solve a pressure vessel design problem and it has outperformed
results.
  Originality/value: Results prove that KMGWO is superior to GWO. KMGWO is also
compared to cat swarm optimization (CSO), whale optimization algorithm-bat
algorithm (WOA-BAT), WOA, and GWO so KMGWO achieved the first rank in terms of
performance. Also, the KMGWO is used to solve a classical engineering problem
and it is superior
","[{'version': 'v1', 'created': 'Sat, 27 Feb 2021 04:29:07 GMT'}]",2021-03-11,"[['Mohammed', 'Hardi M.', ''], ['Abdul', 'Zrar Kh.', ''], ['Rashid', 'Tarik A.', ''], ['Alsadoon', 'Abeer', ''], ['Bacanin', 'Nebojsa', '']]","['Grey Wolf Optimization', 'K-means Clustering', 'Benchmark functions', 'Pressure Vessel Design']"
8207,2108.10367,Raffaele Galliera,"Tobias Jacob, Raffaele Galliera, Muddasar Ali, Sikha Bagui",Marine vessel tracking using a monocular camera,"12 pages, 9 figures, the paper is based on the submission for the AI
  Tracks at Sea challenge made by the same team taking to a 3rd place in the
  competition, included in DeLTA 2021 conference proceedings, published on
  SCITEPRESS Digital Library and available at
  https://www.scitepress.org/PublicationsDetail.aspx?ID=yzZS+b/VkZ4=&t=1",,10.5220/0010516000170028,,cs.CV cs.AI cs.LG cs.RO,http://creativecommons.org/licenses/by-sa/4.0/,"  In this paper, a new technique for camera calibration using only GPS data is
presented. A new way of tracking objects that move on a plane in a video is
achieved by using the location and size of the bounding box to estimate the
distance, achieving an average prediction error of 5.55m per 100m distance from
the camera. This solution can be run in real-time at the edge, achieving
efficient inference in a low-powered IoT environment while also being able to
track multiple different vessels.
","[{'version': 'v1', 'created': 'Mon, 23 Aug 2021 19:08:20 GMT'}]",2021-08-25,"[['Jacob', 'Tobias', ''], ['Galliera', 'Raffaele', ''], ['Ali', 'Muddasar', ''], ['Bagui', 'Sikha', '']]","['Camera Calibration', 'Monocular Object Tracking', 'Object Detection', 'Error Prediction', 'Edge-ml', 'DistanceEstimation', 'YoloV5', 'Kalman Filters']"
8208,2202.02175,Michael Xieyang Liu,"Michael Xieyang Liu, Aniket Kittur, Brad A. Myers","Crystalline: Lowering the Cost for Developers to Collect and Organize
  Information for Decision Making",,CHI Conference on Human Factors in Computing Systems (CHI 2022),10.1145/3491102.3501968,,cs.SE cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Developers perform online sensemaking on a daily basis, such as researching
and choosing libraries and APIs. Prior research has introduced tools that help
developers capture information from various sources and organize it into
structures useful for subsequent decision-making. However, it remains a
laborious process for developers to manually identify and clip content,
maintaining its provenance and synthesizing it with other content. In this
work, we introduce a new system called Crystalline that attempts to
automatically collect and organize information into tabular structures as the
user searches and browses the web. It leverages natural language processing to
automatically group similar criteria together to reduce clutter as well as
passive behavioral signals such as mouse movement and dwell time to infer what
information to collect and how to visualize and prioritize it. Our user study
suggests that developers are able to create comparison tables about 20% faster
with a 60% reduction in operational cost without sacrificing the quality of the
tables.
","[{'version': 'v1', 'created': 'Fri, 4 Feb 2022 15:06:35 GMT'}]",2022-02-07,"[['Liu', 'Michael Xieyang', ''], ['Kittur', 'Aniket', ''], ['Myers', 'Brad A.', '']]","['Sensemaking', 'Developer tools', 'Decision making', 'Behavior patterns', 'Implicit signals']"
8209,1801.07009,Lingling Fan,"Lingling Fan, Ting Su, Sen Chen, Guozhu Meng, Yang Liu, Lihua Xu,
  Geguang Pu, Zhendong Su",Large-Scale Analysis of Framework-Specific Exceptions in Android Apps,ICSE'18: the 40th International Conference on Software Engineering,,10.1145/3180155.3180222,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile apps have become ubiquitous. For app developers, it is a key priority
to ensure their apps' correctness and reliability. However, many apps still
suffer from occasional to frequent crashes, weakening their competitive edge.
Large-scale, deep analyses of the characteristics of real-world app crashes can
provide useful insights to guide developers, or help improve testing and
analysis tools. However, such studies do not exist -- this paper fills this
gap. Over a four-month long effort, we have collected 16,245 unique exception
traces from 2,486 open-source Android apps, and observed that
framework-specific exceptions account for the majority of these crashes. We
then extensively investigated the 8,243 framework-specific exceptions (which
took six person-months): (1) identifying their characteristics (e.g.,
manifestation locations, common fault categories), (2) evaluating their
manifestation via state-of-the-art bug detection techniques, and (3) reviewing
their fixes. Besides the insights they provide, these findings motivate and
enable follow-up research on mobile apps, such as bug detection, fault
localization and patch generation. In addition, to demonstrate the utility of
our findings, we have optimized Stoat, a dynamic testing tool, and implemented
ExLocator, an exception localization tool, for Android apps. Stoat is able to
quickly uncover three previously-unknown, confirmed/fixed crashes in Gmail and
Google+; ExLocator is capable of precisely locating the root causes of
identified exceptions in real-world apps. Our substantial dataset is made
publicly available to share with and benefit the community.
","[{'version': 'v1', 'created': 'Mon, 22 Jan 2018 09:41:31 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Jan 2018 05:35:56 GMT'}, {'version': 'v3', 'created': 'Sat, 10 Mar 2018 05:31:31 GMT'}]",2018-03-13,"[['Fan', 'Lingling', ''], ['Su', 'Ting', ''], ['Chen', 'Sen', ''], ['Meng', 'Guozhu', ''], ['Liu', 'Yang', ''], ['Xu', 'Lihua', ''], ['Pu', 'Geguang', ''], ['Su', 'Zhendong', '']]","['Empirical study', 'mobile app bugs', 'testing', 'static analysis']"
8210,1710.05381,Mateusz Buda,"Mateusz Buda, Atsuto Maki, Maciej A. Mazurowski","A systematic study of the class imbalance problem in convolutional
  neural networks",,,10.1016/j.neunet.2018.07.011,,cs.CV cs.AI cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, we systematically investigate the impact of class imbalance on
classification performance of convolutional neural networks (CNNs) and compare
frequently used methods to address the issue. Class imbalance is a common
problem that has been comprehensively studied in classical machine learning,
yet very limited systematic research is available in the context of deep
learning. In our study, we use three benchmark datasets of increasing
complexity, MNIST, CIFAR-10 and ImageNet, to investigate the effects of
imbalance on classification and perform an extensive comparison of several
methods to address the issue: oversampling, undersampling, two-phase training,
and thresholding that compensates for prior class probabilities. Our main
evaluation metric is area under the receiver operating characteristic curve
(ROC AUC) adjusted to multi-class tasks since overall accuracy metric is
associated with notable difficulties in the context of imbalanced data. Based
on results from our experiments we conclude that (i) the effect of class
imbalance on classification performance is detrimental; (ii) the method of
addressing class imbalance that emerged as dominant in almost all analyzed
scenarios was oversampling; (iii) oversampling should be applied to the level
that completely eliminates the imbalance, whereas the optimal undersampling
ratio depends on the extent of imbalance; (iv) as opposed to some classical
machine learning models, oversampling does not cause overfitting of CNNs; (v)
thresholding should be applied to compensate for prior class probabilities when
overall number of properly classified cases is of interest.
","[{'version': 'v1', 'created': 'Sun, 15 Oct 2017 19:01:43 GMT'}, {'version': 'v2', 'created': 'Sat, 13 Oct 2018 02:02:17 GMT'}]",2018-10-16,"[['Buda', 'Mateusz', ''], ['Maki', 'Atsuto', ''], ['Mazurowski', 'Maciej A.', '']]","['Class Imbalance', 'Convolutional Neural Networks', 'Deep Learning', 'Image Classification']"
8211,2111.04344,Chengzhi Zhang,"Yi Zhao, Lifan Liu, Chengzhi Zhang","Is Coronavirus-Related Research Becoming More Interdisciplinary? A
  Perspective of Co-occurrence Analysis and Diversity Measure of Scientific
  Articles",,,10.1016/j.techfore.2021.121344,,cs.DL cs.CY,http://creativecommons.org/licenses/by/4.0/,"  The outbreak of coronavirus disease 2019 (COVID-19) has had a significant
repercussion on the health, economy, politics and environment, making
coronavirus-related issues more complicated and difficult to solve adequately
by relying on a single field. Interdisciplinary research can provide an
effective solution to complex issues in the related field of coronavirus.
However, whether coronavirus related research becomes more interdisciplinary
still needs corroboration. In this study, we investigate interdisciplinary
status of the coronavirus-related fields via the COVID-19 Open Research Dataset
(CORD-19). To this end, we calculate bibliometric indicators of
interdisciplinarity and a co-occurrence analysis method. The results show that
co-occurrence relationships between cited disciplines have evolved dynamically
over time. The two types of co-occurrence relationships, Immunology and
Microbiology & Medicine and Chemical Engineering & Chemistry, last for a long
time in this field during 1990-2020. Moreover, the number of disciplines cited
by coronavirus-related research increases, whereas the distribution of
disciplines is uneven, and this field tends to focus on several dominant
disciplines such as Medicine, Immunology and Microbiology, Biochemistry,
Genetics and Molecular Biology. We also gauge the disciplinary diversity of
COVID-19 related papers published from January to December 2020; the
disciplinary variety shows an upward trend, while the degree of disciplinary
balance shows a downward trend. Meanwhile, the comprehensive index 2Ds
demonstrates that the degree of interdisciplinarity in coronavirus field
decreases between 1990 and 2019, but it increases in 2020. The results help to
map the interdisciplinarity of coronavirus-related research, gaining insight
into the degree and history of interdisciplinary cooperation.
","[{'version': 'v1', 'created': 'Mon, 8 Nov 2021 09:05:36 GMT'}]",2021-11-09,"[['Zhao', 'Yi', ''], ['Liu', 'Lifan', ''], ['Zhang', 'Chengzhi', '']]","['Coronavirus related research', 'Interdisciplinarity', 'Disciplinary co']"
8212,2109.10899,Zohreh Shaghaghian,"Zohreh Shaghaghian, Heather Burte, Dezhen Song, Wei Yan","Learning Geometric Transformations for Parametric Design: An Augmented
  Reality (AR)-Powered Approach",,,10.1145/3463914.3463915,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Despite the remarkable development of parametric modeling methods for
architectural design, a significant problem still exists, which is the lack of
knowledge and skill regarding the professional implementation of parametric
design in architectural modeling. Considering the numerous advantages of
digital/parametric modeling in rapid prototyping and simulation most
instructors encourage students to use digital modeling even from the early
stages of design; however, an appropriate context to learn the basics of
digital design thinking is rarely provided in architectural pedagogy. This
paper presents an educational tool, specifically an Augmented Reality (AR)
intervention, to help students understand the fundamental concepts of
para-metric modeling before diving into complex parametric modeling platforms.
The goal of the AR intervention is to illustrate geometric transformation and
the associated math functions so that students learn the mathematical logic
behind the algorithmic thinking of parametric modeling. We have developed
BRICKxAR_T, an educational AR prototype, that intends to help students learn
geometric transformations in an immersive spatial AR environment. A LEGO set is
used within the AR intervention as a physical manipulative to support physical
interaction and im-prove spatial skill through body gesture.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2021 03:49:01 GMT'}]",2021-12-16,"[['Shaghaghian', 'Zohreh', ''], ['Burte', 'Heather', ''], ['Song', 'Dezhen', ''], ['Yan', 'Wei', '']]","['Geometric Transformation', 'Mathematics', 'Education', 'Augmented Reality', 'Parametric Modeling']"
8213,2101.07711,Irina Lomazova,"Irina Lomazova, Vladimir Bashkin and Petr Jan\v{c}ar (Dept of Computer
  Science, Faculty of Science, Palack\'y University in Olomouc, Czech Republic)",Resource Bisimilarity in Petri Nets is Decidable,,"Fundamenta Informaticae, vol. 186, no. 1-4, pp. 175-194, 2022",10.3233/FI-222125,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  Petri nets are a popular formalism for modeling and analyzing distributed
systems. Tokens in Petri net models can represent the control flow state or
resources produced/consumed by transition firings. We define a resource as a
part (a submultiset) of Petri net markings and call two resources equivalent
when replacing one of them with another in any marking does not change the
observable Petri net behavior. We consider resource similarity and resource
bisimilarity, two congruent restrictions of bisimulation equivalence on Petri
net markings. Previously it was proved that resource similarity (the largest
congruence included in bisimulation equivalence) is undecidable. Here we
present an algorithm for checking resource bisimilarity, thereby proving that
this relation (the largest congruence included in bisimulation equivalence that
is a bisimulation) is decidable. We also give an example of two resources in a
Petri net that are similar but not bisimilar.
","[{'version': 'v1', 'created': 'Tue, 19 Jan 2021 16:27:40 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Nov 2021 09:49:45 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Mar 2022 07:39:53 GMT'}, {'version': 'v4', 'created': 'Thu, 5 May 2022 09:20:58 GMT'}, {'version': 'v5', 'created': 'Tue, 28 Jun 2022 19:13:15 GMT'}, {'version': 'v6', 'created': 'Thu, 4 Aug 2022 15:33:22 GMT'}, {'version': 'v7', 'created': 'Mon, 22 Aug 2022 10:13:38 GMT'}, {'version': 'v8', 'created': 'Mon, 3 Oct 2022 07:04:45 GMT'}]",2022-10-04,"[['Lomazova', 'Irina', '', 'Dept of Computer\n  Science, Faculty of Science, Palacký University in Olomouc, Czech Republic'], ['Bashkin', 'Vladimir', '', 'Dept of Computer\n  Science, Faculty of Science, Palacký University in Olomouc, Czech Republic'], ['Jančar', 'Petr', '', 'Dept of Computer\n  Science, Faculty of Science, Palacký University in Olomouc, Czech Republic']]","['labeled Petri nets', 'bisimulation', 'congruence', 'decidability', 'resource bisimilarity']"
8214,2103.04314,Jeremy Straub,Jeremy Straub,"Expert System Gradient Descent Style Training: Development of a
  Defensible Artificial Intelligence Technique",,Knowledge Based-Systems (2021),10.1016/j.knosys.2021.107275,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Artificial intelligence systems, which are designed with a capability to
learn from the data presented to them, are used throughout society. These
systems are used to screen loan applicants, make sentencing recommendations for
criminal defendants, scan social media posts for disallowed content and more.
Because these systems don't assign meaning to their complex learned correlation
network, they can learn associations that don't equate to causality, resulting
in non-optimal and indefensible decisions being made. In addition to making
decisions that are sub-optimal, these systems may create legal liability for
their designers and operators by learning correlations that violate
anti-discrimination and other laws regarding what factors can be used in
different types of decision making. This paper presents the use of a machine
learning expert system, which is developed with meaning-assigned nodes (facts)
and correlations (rules). Multiple potential implementations are considered and
evaluated under different conditions, including different network error and
augmentation levels and different training levels. The performance of these
systems is compared to random and fully connected networks.
","[{'version': 'v1', 'created': 'Sun, 7 Mar 2021 10:09:50 GMT'}]",2021-07-05,"[['Straub', 'Jeremy', '']]","['expert systems', 'gradient descent', 'defensible artificial intelligence', 'machine learning', 'training   1']"
8215,2006.10233,Deqing Yang,Deqing Yang and Zengcun Song and Lvxin Xue and Yanghua Xiao,"A Knowledge-Enhanced Recommendation Model with Attribute-Level
  Co-Attention",,SIGIR 2020,10.1145/3397271.3401313,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks (DNNs) have been widely employed in recommender systems
including incorporating attention mechanism for performance improvement.
However, most of existing attention-based models only apply item-level
attention on user side, restricting the further enhancement of recommendation
performance. In this paper, we propose a knowledge-enhanced recommendation
model ACAM, which incorporates item attributes distilled from knowledge graphs
(KGs) as side information, and is built with a co-attention mechanism on
attribute-level to achieve performance gains. Specifically, each user and item
in ACAM are represented by a set of attribute embeddings at first. Then, user
representations and item representations are augmented simultaneously through
capturing the correlations between different attributes by a co-attention
module. Our extensive experiments over two realistic datasets show that the
user representations and item representations augmented by attribute-level
co-attention gain ACAM's superiority over the state-of-the-art deep models.
","[{'version': 'v1', 'created': 'Thu, 18 Jun 2020 01:53:39 GMT'}]",2020-06-20,"[['Yang', 'Deqing', ''], ['Song', 'Zengcun', ''], ['Xue', 'Lvxin', ''], ['Xiao', 'Yanghua', '']]","['recommender system', 'attribute-level', 'co-attention', 'knowledge graph']"
8216,2005.12712,Benedikt Kleinmeier,"Benedikt Kleinmeier, Gerta K\""oster, John Drury","Agent-Based Simulation of Collective Cooperation: From Experiment to
  Model","16 pages, 19 figures, 5 tables, 4 listings, interdisciplinary work
  between computer science and psychology","Journal of the Royal Society Interface (October 2020, Volume 17,
  Issue 171)",10.1098/rsif.2020.0396,,cs.MA cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Simulation models of pedestrian dynamics have become an invaluable tool for
evacuation planning. Typically crowds are assumed to stream unidirectionally
towards a safe area. Simulated agents avoid collisions through mechanisms that
belong to each individual, such as being repelled from each other by imaginary
forces. But classic locomotion models fail when collective cooperation is
called for, notably when an agent, say a first-aid attendant, needs to forge a
path through a densely packed group. We present a controlled experiment to
observe what happens when humans pass through a dense static crowd. We
formulate and test hypothesis on salient phenomena. We discuss our observations
in a psychological framework. We derive a model that incorporates: agents'
perception and cognitive processing of a situation that needs cooperation;
selection from a portfolio of behaviours, such as being cooperative; and a
suitable action, such as swapping places. Agents' ability to successfully get
through a dense crowd emerges as an effect of the psychological model.
","[{'version': 'v1', 'created': 'Tue, 26 May 2020 13:29:08 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Oct 2020 09:40:47 GMT'}]",2020-10-08,"[['Kleinmeier', 'Benedikt', ''], ['Köster', 'Gerta', ''], ['Drury', 'John', '']]","['experiment', 'high-density', 'stationary', 'crowd', 'model', 'psychology', 'collective cooperation', 'behavioural changes']"
8217,2209.05698,Feng Zhao,"Feng Zhao, Ziqi Zhang, Donglin Wang",KSG: Knowledge and Skill Graph,"5 pages, 7 figures, published to CIKM 2022",,10.1145/3511808.3557623,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The knowledge graph (KG) is an essential form of knowledge representation
that has grown in prominence in recent years. Because it concentrates on
nominal entities and their relationships, traditional knowledge graphs are
static and encyclopedic in nature. On this basis, event knowledge graph (Event
KG) models the temporal and spatial dynamics by text processing to facilitate
downstream applications, such as question-answering, recommendation and
intelligent search. Existing KG research, on the other hand, mostly focuses on
text processing and static facts, ignoring the vast quantity of dynamic
behavioral information included in photos, movies, and pre-trained neural
networks. In addition, no effort has been done to include behavioral
intelligence information into the knowledge graph for deep reinforcement
learning (DRL) and robot learning. In this paper, we propose a novel dynamic
knowledge and skill graph (KSG), and then we develop a basic and specific KSG
based on CN-DBpedia. The nodes are divided into entity and attribute nodes,
with entity nodes containing the agent, environment, and skill (DRL policy or
policy representation), and attribute nodes containing the entity description,
pre-train network, and offline dataset. KSG can search for different agents'
skills in various environments and provide transferable information for
acquiring new skills. This is the first study that we are aware of that looks
into dynamic KSG for skill retrieval and learning. Extensive experimental
results on new skill learning show that KSG boosts new skill learning
efficiency.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2022 02:47:46 GMT'}]",2022-09-14,"[['Zhao', 'Feng', ''], ['Zhang', 'Ziqi', ''], ['Wang', 'Donglin', '']]","['Knowledge and Skill Graph', 'Skill Retrieval', 'Knowledge Graph']"
8218,2111.10412,Kuang-Chen Lu,"Kuang-Chen Lu (Brown University, USA), Ben Greenman (Brown University,
  USA), Shriram Krishnamurthi (Brown University, USA)",Types for Tables: A Language Design Benchmark,,"The Art, Science, and Engineering of Programming, 2022, Vol. 6,
  Issue 2, Article 8",10.22152/programming-journal.org/2022/6/8,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Tables are ubiquitous formats for data. Therefore, techniques for
writing correct programs over tables, and debugging incorrect ones, are vital.
Our specific focus in this paper is on rich types that articulate the
properties of tabular operations. We wish to study both their expressive power
and _diagnostic quality_.
  Inquiry: There is no ""standard library"" of table operations. As a result,
every paper (and project) is free to use its own (sub)set of operations. This
makes artifacts very difficult to compare, and it can be hard to tell whether
omitted operations were left out by oversight or because they cannot actually
be expressed. Furthermore, virtually no papers discuss the quality of type
error feedback.
  Approach: We combed through several existing languages and libraries to
create a ""standard library"" of table operations. Each entry is accompanied by a
detailed specification of its ""type,"" expressed independent of (and hence not
constrained by) any type language. We also studied and categorized a corpus of
(student) program edits that resulted in table-related errors. We used this to
generate a suite of erroneous programs. Finally, we adapted the concept of a
datasheet to facilitate comparisons of different implementations.
  Knowledge: Our benchmark creates a common ground to frame work in this area.
Language designers who claim to support typed programming over tables have a
clear suite against which to demonstrate their system's expressive power. Our
family of errors also gives them a chance to demonstrate the quality of
feedback. Researchers who improve one aspect -- especially error reporting --
without changing the other can demonstrate their improvement, as can those who
engage in trade-offs between the two. The net result should be much better
science in both expressiveness and diagnostics. We also introduce a datasheet
format for presenting this knowledge in a methodical way.
  Grounding: We have generated our benchmark from real languages, libraries,
and programs, as well as personal experience conducting and teaching data
science. We have drawn on experience in engineering and, more recently, in data
science to generate the datasheet.
  Importance: Claims about type support for tabular programming are hard to
evaluate. However, tabular programming is ubiquitous, and the expressive power
of type systems keeps growing. Our benchmark and datasheet can help lead to
more orderly science. It also benefits programmers trying to choose a language.
","[{'version': 'v1', 'created': 'Fri, 19 Nov 2021 19:49:30 GMT'}]",2021-11-23,"[['Lu', 'Kuang-Chen', '', 'Brown University, USA'], ['Greenman', 'Ben', '', 'Brown University,\n  USA'], ['Krishnamurthi', 'Shriram', '', 'Brown University, USA']]","['type systems', 'tabular programming', 'data science', 'benchmarking']"
8219,2210.03975,Matin Macktoobian,Matin Macktoobian,Self-organizing nest migration dynamics synthesis for ant colony systems,,"Natural Computing, 2022",10.1007/s11047-022-09923-0,,cs.RO cs.MA cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, we synthesize a novel dynamical approach for ant colonies
enabling them to migrate to new nest sites in a self-organizing fashion. In
other words, we realize ant colony migration as a self-organizing
phenotype-level collective behavior. For this purpose, we first segment the
edges of the graph of ants' pathways. Then, each segment, attributed to its own
pheromone profile, may host an ant. So, multiple ants may occupy an edge at the
same time. Thanks to this segment-wise edge formulation, ants have more
selection options in the course of their pathway determination, thereby
increasing the diversity of their colony's emergent behaviors. In light of the
continuous pheromone dynamics of segments, each edge owns a spatio-temporal
piece-wise continuous pheromone profile in which both deposit and evaporation
processes are unified. The passive dynamics of the proposed migration mechanism
is sufficiently rich so that an ant colony can migrate to the vicinity of a new
nest site in a self-organizing manner without any external supervision. In
particular, we perform extensive simulations to test our migration dynamics
applied to a colony including 500 ants traversing a pathway graph comprising
200 nodes and 4000 edges which are segmented based on various resolutions. The
obtained results exhibit the effectiveness of our strategy.
","[{'version': 'v1', 'created': 'Sat, 8 Oct 2022 09:16:16 GMT'}]",2022-10-11,"[['Macktoobian', 'Matin', '']]","['Self-organization', 'Ant colony systems', 'Migration']"
8220,2205.01188,Ghazal Mirabnahrazam,"Ghazal Mirabnahrazam, Da Ma, C\'edric Beaulac, Sieun Lee, Karteek
  Popuri, Hyunwoo Lee, Jiguo Cao, James E Galvin, Lei Wang, Mirza Faisal Beg,
  the Alzheimer's Disease Neuroimaging Initiative","Predicting Time-to-conversion for Dementia of Alzheimer's Type using
  Multi-modal Deep Survival Analysis",,"Neurobiology of Aging, 121, (2023), 139-156",10.1016/j.neurobiolaging.2022.10.005,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Dementia of Alzheimer's Type (DAT) is a complex disorder influenced by
numerous factors, but it is unclear how each factor contributes to disease
progression. An in-depth examination of these factors may yield an accurate
estimate of time-to-conversion to DAT for patients at various disease stages.
We used 401 subjects with 63 features from MRI, genetic, and CDC (Cognitive
tests, Demographic, and CSF) data modalities in the Alzheimer's Disease
Neuroimaging Initiative (ADNI) database. We used a deep learning-based survival
analysis model that extends the classic Cox regression model to predict
time-to-conversion to DAT. Our findings showed that genetic features
contributed the least to survival analysis, while CDC features contributed the
most. Combining MRI and genetic features improved survival prediction over
using either modality alone, but adding CDC to any combination of features only
worked as well as using only CDC features. Consequently, our study demonstrated
that using the current clinical procedure, which includes gathering cognitive
test results, can outperform survival analysis results produced using costly
genetic or CSF data.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 20:10:10 GMT'}]",2022-11-29,"[['Mirabnahrazam', 'Ghazal', ''], ['Ma', 'Da', ''], ['Beaulac', 'Cédric', ''], ['Lee', 'Sieun', ''], ['Popuri', 'Karteek', ''], ['Lee', 'Hyunwoo', ''], ['Cao', 'Jiguo', ''], ['Galvin', 'James E', ''], ['Wang', 'Lei', ''], ['Beg', 'Mirza Faisal', ''], ['Initiative', ""the Alzheimer's Disease Neuroimaging"", '']]","['Alzheimer’s Disease', 'Deep Learning', 'Survival Analysis', 'Early Detection', 'Multi-modal Data']"
8221,2007.10884,Patrick Ebel,"Patrick Ebel, Florian Brokhausen, Andreas Vogelsang","The Role and Potentials of Field User Interaction Data in the Automotive
  UX Development Lifecycle: An Industry Perspective",,,10.1145/3409120.3410638,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We are interested in the role of field user interaction data in the
development of IVIS, the potentials practitioners see in analyzing this data,
the concerns they share, and how this compares to companies with digital
products. We conducted interviews with 14 UX professionals, 8 from automotive
and 6 from digital companies, and analyzed the results by emergent thematic
coding. Our key findings indicate that implicit feedback through field user
interaction data is currently not evident in the automotive UX development
process. Most decisions regarding the design of IVIS are made based on personal
preferences and the intuitions of stakeholders. However, the interviewees also
indicated that user interaction data has the potential to lower the influence
of guesswork and assumptions in the UX design process and can help to make the
UX development lifecycle more evidence-based and user-centered.
","[{'version': 'v1', 'created': 'Tue, 21 Jul 2020 15:13:34 GMT'}]",2020-07-22,"[['Ebel', 'Patrick', ''], ['Brokhausen', 'Florian', ''], ['Vogelsang', 'Andreas', '']]","['interview study', 'user experience', 'in-vehicle information systems']"
8222,2007.12633,Tajdar Jawaid,Tajdar Jawaid,Privacy vs National Security,,,10.14445/22312803/IJCTT-V68I7P101,,cs.OH cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are growing concerns and anxiety about privacy among the general public
especially after the revelations of former NSA contractor and whistleblowers
like Edward Snowden and others. While privacy is the fundamental concept of
being human, the growing tug-of-war between an individuals privacy and freedom
vs national security has renewed the concerns about where the fine balance
should lie between the two. For the first time in history the technological
advancement has made the mass data gathering, analysis, and storage a
financially and technologically feasible option for the governments and private
businesses. This has led to the growing interest of governments and security
agencies around the globe to develop sophisticated algorithms using the power
of Big-Data, Machine-Learning and Artificial Intelligence. The technology has
enabled governments and private businesses to collect and store thousands of
data points on every individual, which has put an individuals privacy under
constant threat. This article analyses the individual's privacy concepts and
its perceived link with national security. The article will also discuss the
various aspects of privacy and national-security, arguments of both sides and
where a boundary should be drawn between privacy and national security.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 19:35:10 GMT'}]",2020-07-27,"[['Jawaid', 'Tajdar', '']]","['Privacy', 'Human Right', 'National']"
8223,2010.10817,Chengzhi Zhang,"Yuzhuo Wang, Chengzhi Zhang","Using the Full-text Content of Academic Articles to Identify and
  Evaluate Algorithm Entities in the Domain of Natural Language Processing",,"Journal of Informetrics,2020",10.1016/j.joi.2020.101091,,cs.CL cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the era of big data, the advancement, improvement, and application of
algorithms in academic research have played an important role in promoting the
development of different disciplines. Academic papers in various disciplines,
especially computer science, contain a large number of algorithms. Identifying
the algorithms from the full-text content of papers can determine popular or
classical algorithms in a specific field and help scholars gain a comprehensive
understanding of the algorithms and even the field. To this end, this article
takes the field of natural language processing (NLP) as an example and
identifies algorithms from academic papers in the field. A dictionary of
algorithms is constructed by manually annotating the contents of papers, and
sentences containing algorithms in the dictionary are extracted through
dictionary-based matching. The number of articles mentioning an algorithm is
used as an indicator to analyze the influence of that algorithm. Our results
reveal the algorithm with the highest influence in NLP papers and show that
classification algorithms represent the largest proportion among the
high-impact algorithms. In addition, the evolution of the influence of
algorithms reflects the changes in research tasks and topics in the field, and
the changes in the influence of different algorithms show different trends. As
a preliminary exploration, this paper conducts an analysis of the impact of
algorithms mentioned in the academic text, and the results can be used as
training data for the automatic extraction of large-scale algorithms in the
future. The methodology in this paper is domain-independent and can be applied
to other domains.
","[{'version': 'v1', 'created': 'Wed, 21 Oct 2020 08:24:18 GMT'}]",2020-10-22,"[['Wang', 'Yuzhuo', ''], ['Zhang', 'Chengzhi', '']]","['algorithm entity', 'full-text content', 'influence of algorithms']"
8224,1604.05210,Benjamin Irving,"Benjamin Irving, James M Franklin, Bartlomiej W Papiez, Ewan M
  Anderson, Ricky A Sharma, Fergus V Gleeson, Sir Michael Brady and Julia A
  Schnabel","Pieces-of-parts for supervoxel segmentation with global context:
  Application to DCE-MRI tumour delineation",accepted for publication in the Journal of Medical Image Analysis,,10.1016/j.media.2016.03.002,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Rectal tumour segmentation in dynamic contrast-enhanced MRI (DCE-MRI) is a
challenging task, and an automated and consistent method would be highly
desirable to improve the modelling and prediction of patient outcomes from
tissue contrast enhancement characteristics - particularly in routine clinical
practice. A framework is developed to automate DCE-MRI tumour segmentation, by
introducing: perfusion-supervoxels to over-segment and classify DCE-MRI volumes
using the dynamic contrast enhancement characteristics; and the pieces-of-parts
graphical model, which adds global (anatomic) constraints that further refine
the supervoxel components that comprise the tumour. The framework was evaluated
on 23 DCE-MRI scans of patients with rectal adenocarcinomas, and achieved a
voxelwise area-under the receiver operating characteristic curve (AUC) of 0.97
compared to expert delineations. Creating a binary tumour segmentation, 21 of
the 23 cases were segmented correctly with a median Dice similarity coefficient
(DSC) of 0.63, which is close to the inter-rater variability of this
challenging task. A sec- ond study is also included to demonstrate the method's
generalisability and achieved a DSC of 0.71. The framework achieves promising
results for the underexplored area of rectal tumour segmentation in DCE-MRI,
and the methods have potential to be applied to other DCE-MRI and supervoxel
segmentation problems
","[{'version': 'v1', 'created': 'Mon, 18 Apr 2016 15:31:22 GMT'}]",2016-04-19,"[['Irving', 'Benjamin', ''], ['Franklin', 'James M', ''], ['Papiez', 'Bartlomiej W', ''], ['Anderson', 'Ewan M', ''], ['Sharma', 'Ricky A', ''], ['Gleeson', 'Fergus V', ''], ['Brady', 'Sir Michael', ''], ['Schnabel', 'Julia A', '']]","['Parts-based graphical models', 'supervoxel', 'classification', 'segmentation', 'DCE-MRI', 'rectal tumour']"
8225,cs/0507022,{\L}ukasz D\c{e}bowski,{\L}ukasz D\c{e}bowski,On Hilberg's Law and Its Links with Guiraud's Law,To appear in Journal of Quantitative Linguistics,"Journal of Quantitative Linguistics 13(1):81-109, 2006",10.1080/09296170500500637,,cs.CL cs.IT math.IT,,"  Hilberg (1990) supposed that finite-order excess entropy of a random human
text is proportional to the square root of the text length. Assuming that
Hilberg's hypothesis is true, we derive Guiraud's law, which states that the
number of word types in a text is greater than proportional to the square root
of the text length. Our derivation is based on some mathematical conjecture in
coding theory and on several experiments suggesting that words can be defined
approximately as the nonterminals of the shortest context-free grammar for the
text. Such operational definition of words can be applied even to texts
deprived of spaces, which do not allow for Mandelbrot's ``intermittent
silence'' explanation of Zipf's and Guiraud's laws. In contrast to
Mandelbrot's, our model assumes some probabilistic long-memory effects in human
narration and might be capable of explaining Menzerath's law.
","[{'version': 'v1', 'created': 'Thu, 7 Jul 2005 18:53:14 GMT'}]",2020-03-11,"[['Dȩbowski', 'Łukasz', '']]","['excess entropy', 'grammar-based compression', 'Guiraud’s law', 'Zipf’s law']"
8226,2010.16304,Michail Papadimitriou,"Michail Papadimitriou, Juan Fumero, Athanasios Stratikopoulos, Foivos
  S. Zakkak, Christos Kotselidis","Transparent Compiler and Runtime Specializations for Accelerating
  Managed Languages on FPGAs",,"The Art, Science, and Engineering of Programming, 2021, Vol. 5,
  Issue 2, Article 8",10.22152/programming-journal.org/2021/5/8,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, heterogeneous computing has emerged as the vital way to
increase computers? performance and energy efficiency by combining diverse
hardware devices, such as Graphics Processing Units (GPUs) and Field
Programmable Gate Arrays (FPGAs). The rationale behind this trend is that
different parts of an application can be offloaded from the main CPU to diverse
devices, which can efficiently execute these parts as co-processors. FPGAs are
a subset of the most widely used co-processors, typically used for accelerating
specific workloads due to their flexible hardware and energy-efficient
characteristics. These characteristics have made them prevalent in a broad
spectrum of computing systems ranging from low-power embedded systems to
high-end data centers and cloud infrastructures.
  However, these hardware characteristics come at the cost of programmability.
Developers who create their applications using high-level programming languages
(e.g., Java, Python, etc.) are required to familiarize with a hardware
description language (e.g., VHDL, Verilog) or recently heterogeneous
programming models (e.g., OpenCL, HLS) in order to exploit the co-processors?
capacity and tune the performance of their applications. Currently, the
above-mentioned heterogeneous programming models support exclusively the
compilation from compiled languages, such as C and C++. Thus, the transparent
integration of heterogeneous co-processors to the software ecosystem of managed
programming languages (e.g. Java, Python) is not seamless.
  In this paper we rethink the engineering trade-offs that we encountered, in
terms of transparency and compilation overheads, while integrating FPGAs into
high-level managed programming languages. We present a novel approach that
enables runtime code specialization techniques for seamless and
high-performance execution of Java programs on FPGAs. The proposed solution is
prototyped in the context of the Java programming language and TornadoVM; an
open-source programming framework for Java execution on heterogeneous hardware.
Finally, we evaluate the proposed solution for FPGA execution against both
sequential and multi-threaded Java implementations showcasing up to 224x and
19.8x performance speedups, respectively, and up to 13.82x compared to
TornadoVM running on an Intel integrated GPU. We also provide a break-down
analysis of the proposed compiler optimizations for FPGA execution, as a means
to project their impact on the applications? characteristics.
","[{'version': 'v1', 'created': 'Fri, 30 Oct 2020 14:53:51 GMT'}]",2020-11-02,"[['Papadimitriou', 'Michail', ''], ['Fumero', 'Juan', ''], ['Stratikopoulos', 'Athanasios', ''], ['Zakkak', 'Foivos S.', ''], ['Kotselidis', 'Christos', '']]","['FPGAs', 'High-Performance', 'Java', 'JIT compilation', 'Optimizations']"
8227,1907.01102,Ravimal Bandara,"Ravimal Bandara, Lochandaka Ranathunga, Nor Aniza Abdullah","Nature Inspired Dimensional Reduction Technique for Fast and Invariant
  Visual Feature Extraction","11 pages, 11 figures, IJTCSE","International Journal of Advanced Trends in Computer Science and
  Engineering (IJATCSE) Vol.8 No.3 (2019) 696-706",10.30534/ijatcse/2019/57832019,,cs.CV cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fast and invariant feature extraction is crucial in certain computer vision
applications where the computation time is constrained in both training and
testing phases of the classifier. In this paper, we propose a nature-inspired
dimensionality reduction technique for fast and invariant visual feature
extraction. The human brain can exchange the spatial and spectral resolution to
reconstruct missing colors in visual perception. The phenomenon is widely used
in the printing industry to reduce the number of colors used to print, through
a technique, called color dithering. In this work, we adopt a fast
error-diffusion color dithering algorithm to reduce the spectral resolution and
extract salient features by employing novel Hessian matrix analysis technique,
which is then described by a spatial-chromatic histogram. The computation time,
descriptor dimensionality and classification performance of the proposed
feature are assessed under drastic variances in orientation, viewing angle and
illumination of objects comparing with several different state-of-the-art
handcrafted and deep-learned features. Extensive experiments on two publicly
available object datasets, coil-100 and ALOI carried on both a desktop PC and a
Raspberry Pi device show multiple advantages of using the proposed approach,
such as the lower computation time, high robustness, and comparable
classification accuracy under weakly supervised environment. Further, it showed
the capability of operating solely inside a conventional SoC device utilizing a
small fraction of the available hardware resources.
","[{'version': 'v1', 'created': 'Mon, 1 Jul 2019 16:58:45 GMT'}]",2019-07-03,"[['Bandara', 'Ravimal', ''], ['Ranathunga', 'Lochandaka', ''], ['Abdullah', 'Nor Aniza', '']]","['Dimensionality Reduction', 'Internet of Things', 'Salient Dither Pattern', 'SoC Computing', 'Real-time Object Recognition']"
8228,2005.11735,Marcin Plata,Marcin Plata and Piotr Syga,Robust Spatial-spread Deep Neural Image Watermarking,"The article was accepted on TrustCom 2020: The 19th IEEE
  International Conference on Trust, Security and Privacy in Computing and
  Communications",,10.1109/TrustCom50675.2020.00022,,cs.MM cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Watermarking is an operation of embedding an information into an image in a
way that allows to identify ownership of the image despite applying some
distortions on it. In this paper, we presented a novel end-to-end solution for
embedding and recovering the watermark in the digital image using convolutional
neural networks. The method is based on spreading the message over the spatial
domain of the image, hence reducing the ""local bits per pixel"" capacity. To
obtain the model we used adversarial training and applied noiser layers between
the encoder and the decoder. Moreover, we broadened the spectrum of typically
considered attacks on the watermark and by grouping the attacks according to
their scope, we achieved high general robustness, most notably against JPEG
compression, Gaussian blurring, subsampling or resizing. To help us in the
models training we also proposed a precise differentiable approximation of
JPEG.
","[{'version': 'v1', 'created': 'Sun, 24 May 2020 12:51:25 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Nov 2020 13:14:42 GMT'}]",2022-01-11,"[['Plata', 'Marcin', ''], ['Syga', 'Piotr', '']]","['Blind watermarking', 'Robustness to attacks', 'Autoencoders', 'Neural networks', 'Spatial spreading']"
8229,2203.15988,Jingzhi Gong,"Jingzhi Gong, Tao Chen","Does Configuration Encoding Matter in Learning Software Performance? An
  Empirical Study on Encoding Schemes","13 pages, accepted by MSR2022",,10.1145/3524842.3528431,,cs.SE cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Learning and predicting the performance of a configurable software system
helps to provide better quality assurance. One important engineering decision
therein is how to encode the configuration into the model built. Despite the
presence of different encoding schemes, there is still little understanding of
which is better and under what circumstances, as the community often relies on
some general beliefs that inform the decision in an ad-hoc manner. To bridge
this gap, in this paper, we empirically compared the widely used encoding
schemes for software performance learning, namely label, scaled label, and
one-hot encoding. The study covers five systems, seven models, and three
encoding schemes, leading to 105 cases of investigation.
  Our key findings reveal that: (1) conducting trial-and-error to find the best
encoding scheme in a case by case manner can be rather expensive, requiring up
to 400+ hours on some models and systems; (2) the one-hot encoding often leads
to the most accurate results while the scaled label encoding is generally weak
on accuracy over different models; (3) conversely, the scaled label encoding
tends to result in the fastest training time across the models/systems while
the one-hot encoding is the slowest; (4) for all models studied, label and
scaled label encoding often lead to relatively less biased outcomes between
accuracy and training time, but the paired model varies according to the
system.
  We discuss the actionable suggestions derived from our findings, hoping to
provide a better understanding of this topic for the community. To promote open
science, the data and code of this work can be publicly accessed at
https://github.com/ideas-labo/MSR2022-encoding-study.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2022 01:46:27 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Apr 2022 13:32:53 GMT'}]",2022-04-04,"[['Gong', 'Jingzhi', ''], ['Chen', 'Tao', '']]","['Encoding Scheme', 'Machine Learning', 'Software Engineering', 'Performance Prediction', 'Performance Learning', 'Configurable Software']"
8230,2207.12886,Mohamed Essam,"Mohamed Essam, Nagia M. Ghanem and Mohamed A. Ismail",Detection of road traffic crashes based on collision estimation,"11 pages , 9 figures","ICDIPV (CS & IT) , 2022",10.5121/csit.2022.121213,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  This paper introduces a framework based on computer vision that can detect
road traffic crashes (RCTs) by using the installed surveillance/CCTV camera and
report them to the emergency in real-time with the exact location and time of
occurrence of the accident. The framework is built of five modules. We start
with the detection of vehicles by using YOLO architecture; The second module is
the tracking of vehicles using MOSSE tracker, Then the third module is a new
approach to detect accidents based on collision estimation. Then the fourth
module for each vehicle, we detect if there is a car accident or not based on
the violent flow descriptor (ViF) followed by an SVM classifier for crash
prediction. Finally, in the last stage, if there is a car accident, the system
will send a notification to the emergency by using a GPS module that provides
us with the location, time, and date of the accident to be sent to the
emergency with the help of the GSM module. The main objective is to achieve
higher accuracy with fewer false alarms and to implement a simple system based
on pipelining technique.
","[{'version': 'v1', 'created': 'Tue, 26 Jul 2022 13:21:15 GMT'}]",2022-07-27,"[['Essam', 'Mohamed', ''], ['Ghanem', 'Nagia M.', ''], ['Ismail', 'Mohamed A.', '']]","['RTCs', 'ViF', 'SVM', 'Deep Learning', 'Collision Estimation']"
8231,2001.04809,Joshua Kim,"Joshua Y. Kim, Greyson Y. Kim and Kalina Yacef","Detecting depression in dyadic conversations with multimodal narratives
  and visualizations",12 pages,AI 2019: Advances in Artificial Intelligence. AI 2019 vol 11919,10.1007/978-3-030-35288-2_25,,cs.HC cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Conversations contain a wide spectrum of multimodal information that gives us
hints about the emotions and moods of the speaker. In this paper, we developed
a system that supports humans to analyze conversations. Our main contribution
is the identification of appropriate multimodal features and the integration of
such features into verbatim conversation transcripts. We demonstrate the
ability of our system to take in a wide range of multimodal information and
automatically generated a prediction score for the depression state of the
individual. Our experiments showed that this approach yielded better
performance than the baseline model. Furthermore, the multimodal narrative
approach makes it easy to integrate learnings from other disciplines, such as
conversational analysis and psychology. Lastly, this interdisciplinary and
automated approach is a step towards emulating how practitioners record the
course of treatment as well as emulating how conversational analysts have been
analyzing conversations by hand.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2020 10:47:13 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Jan 2020 23:16:48 GMT'}]",2020-01-29,"[['Kim', 'Joshua Y.', ''], ['Kim', 'Greyson Y.', ''], ['Yacef', 'Kalina', '']]","['Multi-disciplinary AI', 'Conversational Analysis', 'Visualization', 'Multimodal Data']"
8232,2004.00845,Xiaoxiao Long,"Xiaoxiao Long, Lingjie Liu, Christian Theobalt, and Wenping Wang",Occlusion-Aware Depth Estimation with Adaptive Normal Constraints,ECCV 2020,"ECCV 2020. Lecture Notes in Computer Science, vol 12354. Springer,
  Cham",10.1007/978-3-030-58545-7_37,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new learning-based method for multi-frame depth estimation from
a color video, which is a fundamental problem in scene understanding, robot
navigation or handheld 3D reconstruction. While recent learning-based methods
estimate depth at high accuracy, 3D point clouds exported from their depth maps
often fail to preserve important geometric feature (e.g., corners, edges,
planes) of man-made scenes. Widely-used pixel-wise depth errors do not
specifically penalize inconsistency on these features. These inaccuracies are
particularly severe when subsequent depth reconstructions are accumulated in an
attempt to scan a full environment with man-made objects with this kind of
features. Our depth estimation algorithm therefore introduces a Combined Normal
Map (CNM) constraint, which is designed to better preserve high-curvature
features and global planar regions. In order to further improve the depth
estimation accuracy, we introduce a new occlusion-aware strategy that
aggregates initial depth predictions from multiple adjacent views into one
final depth map and one occlusion probability map for the current reference
view. Our method outperforms the state-of-the-art in terms of depth estimation
accuracy, and preserves essential geometric features of man-made indoor scenes
much better than other algorithms.
","[{'version': 'v1', 'created': 'Thu, 2 Apr 2020 07:10:45 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Jul 2020 15:17:14 GMT'}, {'version': 'v3', 'created': 'Wed, 25 Nov 2020 17:34:48 GMT'}, {'version': 'v4', 'created': 'Mon, 12 Jul 2021 16:23:55 GMT'}]",2021-07-13,"[['Long', 'Xiaoxiao', ''], ['Liu', 'Lingjie', ''], ['Theobalt', 'Christian', ''], ['Wang', 'Wenping', '']]","['Multi-view Depth Estimation', 'Normal Constraint', 'Occlusionaware Strategy', 'Deep Learning']"
8233,2009.12850,Nick Brown,"Nick Brown, Angus Lepper, Mich\`ele Weiland, Adrian Hill, Ben Shipway,
  Chris Maynard",A directive based hybrid Met Office NERC Cloud model,,,10.1145/2832105.2832115,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Large Eddy Simulation is a critical modelling tool for the investigation of
atmospheric flows, turbulence and cloud microphysics. The models used by the UK
atmospheric research community are homogeneous and the latest model, MONC, is
designed to run on substantial HPC systems with very high CPU core counts. In
order to future proof these codes it is worth investigating other technologies
and architectures which might support the communities running their codes at
the exa-scale.
  In this paper we present a hybrid version of MONC, where the most
computationally intensive aspect is offloaded to the GPU while the rest of the
functionality runs concurrently on the CPU. Developed using the directive
driven OpenACC, we consider the suitability and maturity of this technology to
modern Fortran scientific codes as well general software engineering techniques
which aid this type of porting work. The performance of our hybrid model at
scale is compared against the CPU version before considering other tuning
options and making a comparison between the energy usage of the homo- and
hetero-geneous versions. The result of this work is a promising hybrid model
that shows performance benefits of our approach when the GPU has a significant
computational workload which can not only be applied to the MONC model but also
other weather and climate simulations in use by the community.
","[{'version': 'v1', 'created': 'Sun, 27 Sep 2020 14:10:55 GMT'}]",2020-09-29,"[['Brown', 'Nick', ''], ['Lepper', 'Angus', ''], ['Weiland', 'Michèle', ''], ['Hill', 'Adrian', ''], ['Shipway', 'Ben', ''], ['Maynard', 'Chris', '']]","['OpenACC', 'MONC', 'LEM', 'GPU', 'Large Eddy Simulation', 'Hybrid']"
8234,2207.12817,Michal Balazia,"Michal Balazia, Philipp M\""uller, \'Akos Levente T\'anczos, August von
  Liechtenstein, Fran\c{c}ois Br\'emond","Bodily Behaviors in Social Interaction: Novel Annotations and
  State-of-the-Art Evaluation","Preprint. Full paper accepted at the ACM International Conference on
  Multimedia (ACMMM), Lisbon, Portugal, October 2022. 10 pages",,10.1145/3503161.3548363,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Body language is an eye-catching social signal and its automatic analysis can
significantly advance artificial intelligence systems to understand and
actively participate in social interactions. While computer vision has made
impressive progress in low-level tasks like head and body pose estimation, the
detection of more subtle behaviors such as gesturing, grooming, or fumbling is
not well explored. In this paper we present BBSI, the first set of annotations
of complex Bodily Behaviors embedded in continuous Social Interactions in a
group setting. Based on previous work in psychology, we manually annotated 26
hours of spontaneous human behavior in the MPIIGroupInteraction dataset with 15
distinct body language classes. We present comprehensive descriptive statistics
on the resulting dataset as well as results of annotation quality evaluations.
For automatic detection of these behaviors, we adapt the Pyramid Dilated
Attention Network (PDAN), a state-of-the-art approach for human action
detection. We perform experiments using four variants of spatial-temporal
features as input to PDAN: Two-Stream Inflated 3D CNN, Temporal Segment
Networks, Temporal Shift Module and Swin Transformer. Results are promising and
indicate a great room for improvement in this difficult task. Representing a
key piece in the puzzle towards automatic understanding of social behavior,
BBSI is fully available to the research community.
","[{'version': 'v1', 'created': 'Tue, 26 Jul 2022 11:24:00 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Dec 2022 22:02:35 GMT'}]",2022-12-09,"[['Balazia', 'Michal', ''], ['Müller', 'Philipp', ''], ['Tánczos', 'Ákos Levente', ''], ['von Liechtenstein', 'August', ''], ['Brémond', 'François', '']]","['dataset', 'body pose', 'gesture', 'social signals', 'behavior detection']"
8235,2001.11114,Liang Mi,"Liang Mi, Azadeh Sheikholeslami, and Jos\'e Bento","A Family of Pairwise Multi-Marginal Optimal Transports that Define a
  Generalized Metric",Machine Learning (2022),,10.1007/s10994-022-06280-y,,cs.LG cs.DM math.FA stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Optimal transport (OT) problem is rapidly finding its way into machine
learning. Favoring its use are its metric properties. Many problems admit
solutions with guarantees only for objects embedded in metric spaces, and the
use of non-metrics can complicate solving them. Multi-marginal OT (MMOT)
generalizes OT to simultaneously transporting multiple distributions. It
captures important relations that are missed if the transport only involves two
distributions. Research on MMOT, however, has been focused on its existence,
uniqueness, practical algorithms, and the choice of cost functions. There is a
lack of discussion on the metric properties of MMOT, which limits its
theoretical and practical use. Here, we prove new generalized metric properties
for a family of pairwise MMOTs. We first explain the difficulty of proving this
via two negative results. Afterward, we prove the MMOTs' metric properties.
Finally, we show that the generalized triangle inequality of this family of
MMOTs cannot be improved. We illustrate the superiority of our MMOTs over other
generalized metrics, and over non-metrics in both synthetic and real tasks.
","[{'version': 'v1', 'created': 'Wed, 29 Jan 2020 22:10:15 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Feb 2020 07:03:28 GMT'}, {'version': 'v3', 'created': 'Wed, 24 Jun 2020 08:27:56 GMT'}, {'version': 'v4', 'created': 'Mon, 29 Mar 2021 10:17:44 GMT'}, {'version': 'v5', 'created': 'Sun, 1 May 2022 00:48:16 GMT'}, {'version': 'v6', 'created': 'Thu, 22 Dec 2022 19:27:53 GMT'}]",2022-12-26,"[['Mi', 'Liang', ''], ['Sheikholeslami', 'Azadeh', ''], ['Bento', 'José', '']]","['Optimal Transport', 'Multi-Marginal Optimal Transport', 'Metric Spaces', 'Generalized Metric Spaces', 'Clustering', 'Hypergraph Clustering']"
8236,2205.00731,Fangzhi Xu,"Fangzhi Xu, Jun Liu, Qika Lin, Yudai Pan, Lingling Zhang","Logiformer: A Two-Branch Graph Transformer Network for Interpretable
  Logical Reasoning",Accepted by SIGIR 2022,,10.1145/3477495.3532016,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Machine reading comprehension has aroused wide concerns, since it explores
the potential of model for text understanding. To further equip the machine
with the reasoning capability, the challenging task of logical reasoning is
proposed. Previous works on logical reasoning have proposed some strategies to
extract the logical units from different aspects. However, there still remains
a challenge to model the long distance dependency among the logical units.
Also, it is demanding to uncover the logical structures of the text and further
fuse the discrete logic to the continuous text embedding. To tackle the above
issues, we propose an end-to-end model Logiformer which utilizes a two-branch
graph transformer network for logical reasoning of text. Firstly, we introduce
different extraction strategies to split the text into two sets of logical
units, and construct the logical graph and the syntax graph respectively. The
logical graph models the causal relations for the logical branch while the
syntax graph captures the co-occurrence relations for the syntax branch.
Secondly, to model the long distance dependency, the node sequence from each
graph is fed into the fully connected graph transformer structures. The two
adjacent matrices are viewed as the attention biases for the graph transformer
layers, which map the discrete logical structures to the continuous text
embedding space. Thirdly, a dynamic gate mechanism and a question-aware
self-attention module are introduced before the answer prediction to update the
features. The reasoning process provides the interpretability by employing the
logical units, which are consistent with human cognition. The experimental
results show the superiority of our model, which outperforms the
state-of-the-art single model on two logical reasoning benchmarks.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 08:34:59 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Jul 2022 06:28:37 GMT'}]",2022-07-11,"[['Xu', 'Fangzhi', ''], ['Liu', 'Jun', ''], ['Lin', 'Qika', ''], ['Pan', 'Yudai', ''], ['Zhang', 'Lingling', '']]","['logical reasoning', 'machine reading comprehension', 'graph transformer']"
8237,2008.13637,Andrew Tzer-Yeu Chen,"Matthias Kaiser, Andrew Tzer-Yeu Chen, Peter Gluckman","Should policy makers trust composite indices? A commentary on the
  pitfalls of inappropriate indices for policy formation","19 pages, 2 tables, accepted for publication by Health Research
  Policy and Systems",,10.1186/s12961-021-00702-4,,cs.CY stat.OT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper critically discusses the use and merits of global indices, in
particular, the Global Health Security Index or GHSI (Cameron et 2019) in times
of an imminent crisis, like the current pandemic. The index ranked 195
countries according to their expected preparedness in case of a pandemic or
other biological threat. The Covid-19 pandemic provides the background to
compare each country's predicted performance from the GHSI with the actual
performance. In general, there is an inverted relation between predicted versus
actual performance, i.e. the predicted top performers are among those that are
the worst hit. Obviously, this reflects poorly on the potential policy uses of
the index in imminent crisis management. The paper also uses two different data
sets, one from the Worldmeter on the spread of the Covid-19 pandemics, and the
other one from the INGSA policy tracker, to make comparisons between the actual
introduction of pandemic response policies and the corresponding death rate in
29 selected countries.
","[{'version': 'v1', 'created': 'Mon, 31 Aug 2020 14:18:45 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Mar 2021 19:31:46 GMT'}]",2021-04-06,"[['Kaiser', 'Matthias', ''], ['Chen', 'Andrew Tzer-Yeu', ''], ['Gluckman', 'Peter', '']]","['pandemic preparedness', 'composite indicators', 'science-for-policy', 'decision']"
8238,1905.09906,Zhenyu Shou,"Zhenyu Shou, Xuan Di, Jieping Ye, Hongtu Zhu, Hua Zhang, Robert
  Hampshire","Optimal Passenger-Seeking Policies on E-hailing Platforms Using Markov
  Decision Process and Imitation Learning","23 pages, 16 figures, published in Transportation Research Part C 111
  (2020) 91-113",Transportation Research Part C 111 (2020) 91-113,10.1016/j.trc.2019.12.005,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vacant taxi drivers' passenger seeking process in a road network generates
additional vehicle miles traveled, adding congestion and pollution into the
road network and the environment. This paper aims to employ a Markov Decision
Process (MDP) to model idle e-hailing drivers' optimal sequential decisions in
passenger-seeking. Transportation network companies (TNC) or e-hailing (e.g.,
Didi, Uber) drivers exhibit different behaviors from traditional taxi drivers
because e-hailing drivers do not need to actually search for passengers.
Instead, they reposition themselves so that the matching platform can match a
passenger. Accordingly, we incorporate e-hailing drivers' new features into our
MDP model. The reward function used in the MDP model is uncovered by leveraging
an inverse reinforcement learning technique. We then use 44,160 Didi drivers'
3-day trajectories to train the model. To validate the effectiveness of the
model, a Monte Carlo simulation is conducted to simulate the performance of
drivers under the guidance of the optimal policy, which is then compared with
the performance of drivers following one baseline heuristic, namely, the local
hotspot strategy. The results show that our model is able to achieve a 17.5%
improvement over the local hotspot strategy in terms of the rate of return. The
proposed MDP model captures the supply-demand ratio considering the fact that
the number of drivers in this study is sufficiently large and thus the number
of unmatched orders is assumed to be negligible. To better incorporate the
competition among multiple drivers into the model, we have also devised and
calibrated a dynamic adjustment strategy of the order matching probability.
","[{'version': 'v1', 'created': 'Thu, 23 May 2019 20:24:29 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Oct 2019 06:44:30 GMT'}, {'version': 'v3', 'created': 'Sat, 1 Feb 2020 21:51:19 GMT'}]",2020-02-04,"[['Shou', 'Zhenyu', ''], ['Di', 'Xuan', ''], ['Ye', 'Jieping', ''], ['Zhu', 'Hongtu', ''], ['Zhang', 'Hua', ''], ['Hampshire', 'Robert', '']]","['Markov Decision Process (MDP)', 'Imitation Learning', 'E-hailing']"
8239,2108.08449,Wenzhong Yan,Wenzhong Yan and Ankur Mehta,"A cut-and-fold self-sustained compliant oscillator for autonomous
  actuation of origami-inspired robots","23 pages, 5 figures. This manuscript has been accepted for
  publication in Soft Robotics. Supplementary texts, movies, and figures are
  not uploaded","Soft Robotics, 2021",10.1089/soro.2021.0018,,cs.RO physics.app-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Origami-inspired robots are of particular interest given their potential for
rapid and accessible design and fabrication of elegant designs and complex
functionalities through cutting and folding of flexible 2D sheets or even
strings, i.e.printable manufacturing. Yet, origami robots still require bulky,
rigid components or electronics for actuation and control to accomplish tasks
with reliability, programmability, ability to output substantial force, and
durability, restricting their full potential. Here, we present a printable
self-sustained compliant oscillator that generates periodic actuation using
only constant electrical power, without discrete components or electronic
control hardware. This oscillator is robust (9 out of 10 prototypes worked
successfully on the first try), configurable (with tunable periods from 3 s to
12 s), powerful (can overcome hydrodynamic resistance to consistently propel a
swimmer at ~1.6 body lengths/min), and long-lasting (~10^3 cycles); it enables
driving macroscale devices with prescribed autonomous behaviors, e.g.
locomotion and sequencing. This oscillator is also fully functional underwater
and in high magnetic fields. Our analytical model characterizes essential
parameters of the oscillation period, enabling programmable design of the
oscillator. The printable oscillator can be integrated into origami-inspired
systems seamlessly and monolithically, allowing rapid design and prototyping;
the resulting integrated devices are lightweight, low-cost, compliant,
electronic-free, and nonmagnetic, enabling practical applications in extreme
areas. We demonstrate the functionalities of the oscillator with: (i)
autonomous gliding of a printable swimmer, (ii) LED flashing, and (iii) fluid
stirring. This work paves the way for realizing fully printable autonomous
robots with a high integration of actuation and control.
","[{'version': 'v1', 'created': 'Thu, 19 Aug 2021 02:43:10 GMT'}]",2021-12-06,"[['Yan', 'Wenzhong', ''], ['Mehta', 'Ankur', '']]","['origami-inspired robots', 'printable manufacturing', 'self-sustained compliant oscillator', 'bista']"
8240,2208.01313,Qiming Yang,"Qiming Yang, Kai Zhang, Chaoxiang Lan, Zhi Yang, Zheyang Li, Wenming
  Tan, Jun Xiao, Shiliang Pu",Unified Normalization for Accelerating and Stabilizing Transformers,ACM MM'22,,10.1145/3503161.3547860,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Solid results from Transformers have made them prevailing architectures in
various natural language and vision tasks. As a default component in
Transformers, Layer Normalization (LN) normalizes activations within each token
to boost the robustness. However, LN requires on-the-fly statistics calculation
in inference as well as division and square root operations, leading to
inefficiency on hardware. What is more, replacing LN with other
hardware-efficient normalization schemes (e.g., Batch Normalization) results in
inferior performance, even collapse in training. We find that this dilemma is
caused by abnormal behaviors of activation statistics, including large
fluctuations over iterations and extreme outliers across layers. To tackle
these issues, we propose Unified Normalization (UN), which can speed up the
inference by being fused with other linear operations and achieve comparable
performance on par with LN. UN strives to boost performance by calibrating the
activation and gradient statistics with a tailored fluctuation smoothing
strategy. Meanwhile, an adaptive outlier filtration strategy is applied to
avoid collapse in training whose effectiveness is theoretically proved and
experimentally verified in this paper. We demonstrate that UN can be an
efficient drop-in alternative to LN by conducting extensive experiments on
language and vision tasks. Besides, we evaluate the efficiency of our method on
GPU. Transformers equipped with UN enjoy about 31% inference speedup and nearly
18% memory reduction. Code will be released at
https://github.com/hikvision-research/Unified-Normalization.
","[{'version': 'v1', 'created': 'Tue, 2 Aug 2022 08:41:31 GMT'}]",2022-08-03,"[['Yang', 'Qiming', ''], ['Zhang', 'Kai', ''], ['Lan', 'Chaoxiang', ''], ['Yang', 'Zhi', ''], ['Li', 'Zheyang', ''], ['Tan', 'Wenming', ''], ['Xiao', 'Jun', ''], ['Pu', 'Shiliang', '']]","['neural networks', 'normalization', 'transformers']"
8241,1910.12747,Laurent Feuilloley,Laurent Feuilloley,Introduction to local certification,Final version for DMTCS,"Discrete Mathematics & Theoretical Computer Science, vol. 23, no.
  3, Distributed Computing and Networking (September 15, 2021) dmtcs:8479",10.46298/dmtcs.6280,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A distributed graph algorithm is basically an algorithm where every node of a
graph can look at its neighborhood at some distance in the graph and chose its
output. As distributed environment are subject to faults, an important issue is
to be able to check that the output is correct, or in general that the network
is in proper configuration with respect to some predicate. One would like this
checking to be very local, to avoid using too much resources. Unfortunately
most predicates cannot be checked this way, and that is where certification
comes into play. Local certification (also known as proof-labeling schemes,
locally checkable proofs or distributed verification) consists in assigning
labels to the nodes, that certify that the configuration is correct. There are
several point of view on this topic: it can be seen as a part of
self-stabilizing algorithms, as labeling problem, or as a non-deterministic
distributed decision.
  This paper is an introduction to the domain of local certification, giving an
overview of the history, the techniques and the current research directions.
","[{'version': 'v1', 'created': 'Mon, 28 Oct 2019 15:16:15 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Jan 2020 15:30:14 GMT'}, {'version': 'v3', 'created': 'Mon, 1 Feb 2021 16:19:39 GMT'}, {'version': 'v4', 'created': 'Tue, 1 Jun 2021 17:08:12 GMT'}, {'version': 'v5', 'created': 'Tue, 14 Sep 2021 10:19:40 GMT'}]",2021-10-04,"[['Feuilloley', 'Laurent', '']]","['Local certification', 'proof-labeling scheme', 'distributed decision', 'locally checkable proofs']"
8242,2008.07076,Vipin Singh Sehrawat,"Vipin Singh Sehrawat, Yogendra Shah, Vinod Kumar Choyi, Alec
  Brusilovsky and Samir Ferdi",Certificate and Signature Free Anonymity for V2V Communications,"This is the full version of the paper that appeared in 2017 IEEE
  Vehicular Networking Conference (VNC), pp. 139-146. DOI:
  10.1109/VNC.2017.8275624","IEEE Vehicular Networking Conference (VNC), pp. 139-146, 2017",10.1109/VNC.2017.8275624,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Anonymity is a desirable feature for vehicle-to-vehicle (V2V) communications,
but it conflicts with other requirements such as non-repudiation and
revocation. Existing, pseudonym-based V2V communications schemes rely on
certificate generation and signature verification. These schemes require
cumbersome key management, frequent updating of certificate chains and other
costly procedures such as cryptographic pairings. In this paper, we present
novel V2V communications schemes, that provide authentication, authorization,
anonymity, non-repudiation, replay protection, pseudonym revocation, and
forward secrecy without relying on traditional certificate generation and
signature verification. Security and privacy of our schemes rely on hard
problems in number theory. Furthermore, our schemes guarantee security and
privacy in the presence of subsets of colluding malicious parties, provided
that the cardinality of such sets is below a fixed threshold.
","[{'version': 'v1', 'created': 'Mon, 17 Aug 2020 03:52:33 GMT'}]",2020-08-18,"[['Sehrawat', 'Vipin Singh', ''], ['Shah', 'Yogendra', ''], ['Choyi', 'Vinod Kumar', ''], ['Brusilovsky', 'Alec', ''], ['Ferdi', 'Samir', '']]","['V2V communications', 'Privacy', 'Non-repudiation', 'Anonymity', 'Authentication', 'Authorization']"
8243,1911.03793,Mohamed Hamidi,"Mohamed Hamidi, Mohamed El Haziti, Hocine Cherifi, Driss Aboutajdine","A Robust Blind 3-D Mesh Watermarking based on Wavelet Transform for
  Copyright Protection","6 pages, 3 figures, International Conference on Advanced Technologies
  for Signal and Image Processing (ATSIP'2017)",,10.1109/ATSIP.2017.8075525,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, three-dimensional meshes have been extensively used in several
applications such as, industrial, medical, computer-aided design (CAD) and
entertainment due to the processing capability improvement of computers and the
development of the network infrastructure. Unfortunately, like digital images
and videos, 3-D meshes can be easily modified, duplicated and redistributed by
unauthorized users. Digital watermarking came up while trying to solve this
problem. In this paper, we propose a blind robust watermarking scheme for
three-dimensional semiregular meshes for Copyright protection. The watermark is
embedded by modifying the norm of the wavelet coefficient vectors associated
with the lowest resolution level using the edge normal norms as synchronizing
primitives. The experimental results show that in comparison with alternative
3-D mesh watermarking approaches, the proposed method can resist to a wide
range of common attacks, such as similarity transformations including
translation, rotation, uniform scaling and their combination, noise addition,
Laplacian smoothing, quantization, while preserving high imperceptibility.
","[{'version': 'v1', 'created': 'Sat, 9 Nov 2019 22:48:35 GMT'}]",2019-11-12,"[['Hamidi', 'Mohamed', ''], ['Haziti', 'Mohamed El', ''], ['Cherifi', 'Hocine', ''], ['Aboutajdine', 'Driss', '']]","['Three-dimensional meshes', 'digital watermarking', 'wavelet coefficient vectors', 'Copyright protection', 'synchronizingprimitives']"
8244,2009.07141,D. M. Anisuzzaman,"D. M. Anisuzzaman (1), Chuanbo Wang (1), Behrouz Rostami (2), Sandeep
  Gopalakrishnan (3), Jeffrey Niezgoda (4), and Zeyun Yu (1) ((1) Department of
  Computer Science, University of Wisconsin-Milwaukee, Milwaukee, WI, USA, (2)
  Department of Electrical Engineering, University of Wisconsin-Milwaukee,
  Milwaukee, WI, USA, (3) College of Nursing, University of
  Wisconsin-Milwaukee, Milwaukee, WI, USA, (4) Jeffrey Niezgoda is with the AZH
  Wound Center, Milwaukee, WI, USA.)","Image Based Artificial Intelligence in Wound Assessment: A Systematic
  Review","18 pages, 9 tables, 1 figure",Adv Wound Care (New Rochelle). 2021 Sep 21. PMID: 34544270,10.1089/wound.2021.0091,,cs.CY cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Efficient and effective assessment of acute and chronic wounds can help wound
care teams in clinical practice to greatly improve wound diagnosis, optimize
treatment plans, ease the workload and achieve health related quality of life
to the patient population. While artificial intelligence (AI) has found wide
applications in health-related sciences and technology, AI-based systems remain
to be developed clinically and computationally for high-quality wound care. To
this end, we have carried out a systematic review of intelligent image-based
data analysis and system developments for wound assessment. Specifically, we
provide an extensive review of research methods on wound measurement
(segmentation) and wound diagnosis (classification). We also reviewed recent
work on wound assessment systems (including hardware, software, and mobile
apps). More than 250 articles were retrieved from various publication databases
and online resources, and 115 of them were carefully selected to cover the
breadth and depth of most recent and relevant work to convey the current review
to its fulfillment.
","[{'version': 'v1', 'created': 'Tue, 15 Sep 2020 14:52:14 GMT'}]",2021-10-13,"[['Anisuzzaman', 'D. M.', ''], ['Wang', 'Chuanbo', ''], ['Rostami', 'Behrouz', ''], ['Gopalakrishnan', 'Sandeep', ''], ['Niezgoda', 'Jeffrey', ''], ['Yu', 'Zeyun', '']]","['used for the search include wound', 'wound assessment', 'wound']"
8245,1907.02886,Murat Onen,"Murat Onen, Brenden A. Butters, Emily Toomey, Tayfun Gokmen, Karl K.
  Berggren","Design and Characterization of Superconducting Nanowire-Based Processors
  for Acceleration of Deep Neural Network Training",,,10.1088/1361-6528/ab47bc,,cs.ET cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Training of deep neural networks (DNNs) is a computationally intensive task
and requires massive volumes of data transfer. Performing these operations with
the conventional von Neumann architectures creates unmanageable time and power
costs. Recent studies have shown that mixed-signal designs involving crossbar
architectures are capable of achieving acceleration factors as high as 30,000x
over the state of the art digital processors. These approaches involve
utilization of non-volatile memory (NVM) elements as local processors. However,
no technology has been developed to-date that can satisfy the strict device
requirements for the unit cell. This paper presents the superconducting
nanowire-based processing element as a cross-point device. The unit cell has
many programmable non-volatile states that can be used to perform analog
multiplication. Importantly, these states are intrinsically discrete due to
quantization of flux, which provides symmetric switching characteristics.
Operation of these devices in a crossbar is described and verified with
electro-thermal circuit simulations. Finally, validation of the concept in an
actual DNN training task is shown using an emulator.
","[{'version': 'v1', 'created': 'Fri, 5 Jul 2019 15:14:28 GMT'}]",2020-01-08,"[['Onen', 'Murat', ''], ['Butters', 'Brenden A.', ''], ['Toomey', 'Emily', ''], ['Gokmen', 'Tayfun', ''], ['Berggren', 'Karl K.', '']]","['Neural network accelerators', 'mixed-signal computing', 'superconducting nanoelectronics', 'crossbar architecture']"
8246,2103.16033,Salma Elmalaki,"Salma Elmalaki (University of California, Irvine)","FaiR-IoT: Fairness-aware Human-in-the-Loop Reinforcement Learning for
  Harnessing Human Variability in Personalized IoT",14 pages,"IoTDI 2021: Proceedings of the International Conference on
  Internet-of-Things Design and Implementation",10.1145/3450268.3453525,,cs.LG cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Thanks to the rapid growth in wearable technologies, monitoring complex human
context becomes feasible, paving the way to develop human-in-the-loop IoT
systems that naturally evolve to adapt to the human and environment state
autonomously. Nevertheless, a central challenge in designing such personalized
IoT applications arises from human variability. Such variability stems from the
fact that different humans exhibit different behaviors when interacting with
IoT applications (intra-human variability), the same human may change the
behavior over time when interacting with the same IoT application (inter-human
variability), and human behavior may be affected by the behaviors of other
people in the same environment (multi-human variability). To that end, we
propose FaiR-IoT, a general reinforcement learning-based framework for adaptive
and fairness-aware human-in-the-loop IoT applications. In FaiR-IoT, three
levels of reinforcement learning agents interact to continuously learn human
preferences and maximize the system's performance and fairness while taking
into account the intra-, inter-, and multi-human variability. We validate the
proposed framework on two applications, namely (i) Human-in-the-Loop Automotive
Advanced Driver Assistance Systems and (ii) Human-in-the-Loop Smart House.
Results obtained on these two applications validate the generality of FaiR-IoT
and its ability to provide a personalized experience while enhancing the
system's performance by 40%-60% compared to non-personalized systems and
enhancing the fairness of the multi-human systems by 1.5 orders of magnitude.
","[{'version': 'v1', 'created': 'Tue, 30 Mar 2021 02:30:25 GMT'}]",2022-02-03,"[['Elmalaki', 'Salma', '', 'University of California, Irvine']]","['Fairness', 'Personalized IoT', 'Reinforcement Learning', 'Human Adaptation', 'Human-in-the-Loop']"
8247,1811.05743,Haifeng Li,"Lei Gao, Xingquan Liu, Yu Liu, Pu Wang, Min Deng, Qing Zhu, Haifeng Li",Measuring Road Network Topology Vulnerability by Ricci Curvature,"30 pages, 12 figures. Accepted by Physica A",Physica A: Statistical Mechanics and its Applications 2019,10.1016/j.physa.2019.121071,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Describing the basic properties of road network systems, such as their
robustness, vulnerability, and reliability, has been a very important research
topic in the field of urban transportation. Current research mainly uses
several statistical indicators of complex networks to analyze the road network
systems. However, these methods are essentially node-based. These node-based
methods are more concerned with the number of connections between nodes, and
lack of consideration for interactions. So, this leads to the well-known node
paradox problem, and their ability of characterizing the local and intrinsic
properties of a network is weak. From the perspective of network intrinsic
geometry, this paper proposes a method for measuring road network vulnerability
using a discrete Ricci curvature, which can identify the key sections of a road
network and indicate its fragile elements. The results show that our method
performs better than complex network statistics on measuring the vulnerability
of a road network. Additionally, it can characterize the evolution of the road
network vulnerability among different periods of time in the same city through
our method. Finally, we compare our method with the previous method of
centrality and show the different between them. This article provides a new
perspective on a geometry to analyze the vulnerability of a road network and
describes the inherent nature of the vulnerability of a road system from a new
perspective. It also contributes to enriching the analytical methods of complex
road networks.
","[{'version': 'v1', 'created': 'Wed, 14 Nov 2018 12:15:08 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Apr 2019 06:00:27 GMT'}]",2019-06-26,"[['Gao', 'Lei', ''], ['Liu', 'Xingquan', ''], ['Liu', 'Yu', ''], ['Wang', 'Pu', ''], ['Deng', 'Min', ''], ['Zhu', 'Qing', ''], ['Li', 'Haifeng', '']]","['Network Geometry', 'Ricci Curvature', 'Road Network', 'TopologyVulnerability']"
8248,1708.03167,Zi-Jing Liu,Zijing Liu and Mauricio Barahona,"Geometric Multiscale Community Detection: Markov Stability and Vector
  Partitioning","16 pages, 7 figures","Journal of Complex Networks, Volume 6, Issue 2, 1 April 2018,
  Pages 157-172",10.1093/comnet/cnx028,,cs.SI cond-mat.stat-mech physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  Multiscale community detection can be viewed from a dynamical perspective
within the Markov Stability framework, which uses the diffusion of a Markov
process on the graph to uncover intrinsic network substructures across all
scales. Here we reformulate multiscale community detection as a max-sum length
vector partitioning problem with respect to the set of time-dependent node
vectors expressed in terms of eigenvectors of the transition matrix. This
formulation provides a geometric interpretation of Markov Stability in terms of
a time-dependent spectral embedding, where the Markov time acts as an
inhomogeneous geometric resolution factor that zooms the components of the node
vectors at different rates. Our geometric formulation encompasses both
modularity and the multi-resolution Potts model, which are shown to correspond
to vector partitioning in a pseudo-Euclidean space, and is also linked to
spectral partitioning methods, where the number of eigenvectors used
corresponds to the dimensionality of the underlying embedding vector space.
Inspired by the Louvain optimisation for community detection, we then propose
an algorithm based on a graph-theoretical heuristic for the vector partitioning
problem. We apply the algorithm to the spectral optimisation of modularity and
Markov Stability community detection. The spectral embedding based on the
transition matrix eigenvectors leads to improved partitions with higher
information content and higher modularity than the eigen-decomposition of the
modularity matrix. We illustrate the results with random network benchmarks.
","[{'version': 'v1', 'created': 'Thu, 10 Aug 2017 11:23:54 GMT'}]",2018-03-28,"[['Liu', 'Zijing', ''], ['Barahona', 'Mauricio', '']]","['multiscale community detection', 'spectral methods', 'partitioning algorithms', 'modularity', 'Markov stability']"
8249,2202.06569,Yudong Liu,"Yudong Liu, Xu Zhang, Shilin He, Hongyu Zhang, Liqun Li, Yu Kang, Yong
  Xu, Minghua Ma, Qingwei Lin, Yingnong Dang, Saravan Rajmohan, Dongmei Zhang",UniParser: A Unified Log Parser for Heterogeneous Log Data,"Accepted by WWW 2022, 8 pages",,10.1145/3485447.3511993,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Logs provide first-hand information for engineers to diagnose failures in
large-scale online service systems. Log parsing, which transforms
semi-structured raw log messages into structured data, is a prerequisite of
automated log analysis such as log-based anomaly detection and diagnosis.
Almost all existing log parsers follow the general idea of extracting the
common part as templates and the dynamic part as parameters. However, these log
parsing methods, often neglect the semantic meaning of log messages.
Furthermore, high diversity among various log sources also poses an obstacle in
the generalization of log parsing across different systems. In this paper, we
propose UniParser to capture the common logging behaviours from heterogeneous
log data. UniParser utilizes a Token Encoder module and a Context Encoder
module to learn the patterns from the log token and its neighbouring context. A
Context Similarity module is specially designed to model the commonalities of
learned patterns. We have performed extensive experiments on 16 public log
datasets and our results show that UniParser outperperforms state-of-the-art
log parsers by a large margin.
","[{'version': 'v1', 'created': 'Mon, 14 Feb 2022 09:10:54 GMT'}]",2022-02-15,"[['Liu', 'Yudong', ''], ['Zhang', 'Xu', ''], ['He', 'Shilin', ''], ['Zhang', 'Hongyu', ''], ['Li', 'Liqun', ''], ['Kang', 'Yu', ''], ['Xu', 'Yong', ''], ['Ma', 'Minghua', ''], ['Lin', 'Qingwei', ''], ['Dang', 'Yingnong', ''], ['Rajmohan', 'Saravan', ''], ['Zhang', 'Dongmei', '']]","['Log parsing', 'heterogeneous log data', 'log parser', 'deep learning']"
8250,2004.13157,Fernando Diaz,"Fernando Diaz and Bhaskar Mitra and Michael D. Ekstrand and Asia J.
  Biega and Ben Carterette",Evaluating Stochastic Rankings with Expected Exposure,"In Proceedings of the 29th ACM International Conference on
  Information & Knowledge Management (CIKM '20). Association for Computing
  Machinery, New York, NY, USA",,10.1145/3340531.3411962,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the concept of \emph{expected exposure} as the average attention
ranked items receive from users over repeated samples of the same query.
Furthermore, we advocate for the adoption of the principle of equal expected
exposure: given a fixed information need, no item should receive more or less
expected exposure than any other item of the same relevance grade. We argue
that this principle is desirable for many retrieval objectives and scenarios,
including topical diversity and fair ranking. Leveraging user models from
existing retrieval metrics, we propose a general evaluation methodology based
on expected exposure and draw connections to related metrics in information
retrieval evaluation. Importantly, this methodology relaxes classic information
retrieval assumptions, allowing a system, in response to a query, to produce a
\emph{distribution over rankings} instead of a single fixed ranking. We study
the behavior of the expected exposure metric and stochastic rankers across a
variety of information access conditions, including \emph{ad hoc} retrieval and
recommendation. We believe that measuring and optimizing expected exposure
metrics using randomization opens a new area for retrieval algorithm
development and progress.
","[{'version': 'v1', 'created': 'Mon, 27 Apr 2020 20:29:56 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Oct 2020 20:26:09 GMT'}]",2020-10-22,"[['Diaz', 'Fernando', ''], ['Mitra', 'Bhaskar', ''], ['Ekstrand', 'Michael D.', ''], ['Biega', 'Asia J.', ''], ['Carterette', 'Ben', '']]","['evaluation', 'fairness', 'diversity']"
8251,1803.09379,Ai Munandar Tb,"T.A. Munandar, Azhari, A. Musdholifah, and L. Arsyad","Multiview Hierarchical Agglomerative Clustering for Identification of
  Development Gap and Regional Potential Sector",,"Journal of Computer Science 2018, 14 (1): 81.91",10.3844/jcssp.2018.81.91,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The identification of regional development gaps is an effort to see how far
the development conducted in every District in a Province. By seeing the gaps
occurred, it is expected that the Policymakers are able to determine which
region that will be prioritized for future development. Along with the regional
gaps, the identification in Gross Regional Domestic Product (GRDP) sector is
also an effort to identify the achievement in the development in certain fields
seen from the potential GRDP owned by a District. There are two approaches that
are often used to identify the regional development gaps and potential sector,
Klassen Typology and Location Quotient (LQ), respectively. In fact, the results
of the identification using these methods have not been able to show the
proximity of the development gaps between a District to another yet in a same
cluster. These methods only cluster the regions and GRDP sectors in a firm
cluster based on their own parameter values. This research develops a new
approach that combines the Klassen, LQ and hierarchical agglomerative
clustering (HAC) into a new method named multi view hierarchical agglomerative
clustering (MVHAC). The data of GRDP sectors of 23 Districts in West Java
province were tested by using Klassen, LQ, HAC and MVHAC and were then
compared. The results show that MVHAC is able to accommodate the ability of the
three previous methods into a unity, even to clearly visualize the proximity of
the development gaps between the regions and GRDP sectors owned. MVHAC clusters
23 districts into 3 main clusters, they are, Cluster 1 (Quadrant 1) consists of
5 Districts as the members, Cluster 2 (Quadrant 2) consists of 12 Districts and
Cluster 3 (Quadrant 4) consists of 6 Districts.
","[{'version': 'v1', 'created': 'Mon, 26 Mar 2018 01:10:02 GMT'}]",2018-03-28,"[['Munandar', 'T. A.', ''], ['Azhari', '', ''], ['Musdholifah', 'A.', ''], ['Arsyad', 'L.', '']]","['Klassen', 'LQ', 'MVHAC', 'Development Gaps', 'Potential Sector']"
8252,1906.08149,Mahawaga Arachchige Pathum Chamikara,"M.A.P. Chamikara, P. Bertok, D. Liu, S. Camtepe, I. Khalil",Efficient privacy preservation of big data for accurate data mining,Information Sciences,,10.1016/j.ins.2019.05.053,,cs.DB cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Computing technologies pervade physical spaces and human lives, and produce a
vast amount of data that is available for analysis. However, there is a growing
concern that potentially sensitive data may become public if the collected data
are not appropriately sanitized before being released for investigation.
Although there are more than a few privacy-preserving methods available, they
are not efficient, scalable or have problems with data utility, and/or privacy.
This paper addresses these issues by proposing an efficient and scalable
nonreversible perturbation algorithm, PABIDOT, for privacy preservation of big
data via optimal geometric transformations. PABIDOT was tested for efficiency,
scalability, resistance, and accuracy using nine datasets and five
classification algorithms. Experiments show that PABIDOT excels in execution
speed, scalability, attack resistance and accuracy in large-scale
privacy-preserving data classification when compared with two other, related
privacy-preserving algorithms.
","[{'version': 'v1', 'created': 'Wed, 19 Jun 2019 15:23:41 GMT'}]",2019-06-20,"[['Chamikara', 'M. A. P.', ''], ['Bertok', 'P.', ''], ['Liu', 'D.', ''], ['Camtepe', 'S.', ''], ['Khalil', 'I.', '']]","['Information privacy', 'privacy preserving data mining', 'big data privacy', 'data']"
8253,1902.05204,Pierre-Jean Meyer,"Pierre-Jean Meyer, Alex Devonport, Murat Arcak",TIRA: Toolbox for Interval Reachability Analysis,,,10.1145/3302504.3311808,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents TIRA, a Matlab library gathering several methods for the
computation of interval over-approximations of the reachable sets for both
continuous- and discrete-time nonlinear systems. Unlike other existing tools,
the main strength of interval-based reachability analysis is its simplicity and
scalability, rather than the accuracy of the over-approximations. The current
implementation of TIRA contains four reachability methods covering wide classes
of nonlinear systems, handled with recent results relying on contraction/growth
bounds and monotonicity concepts. TIRA's architecture features a central
function working as a hub between the user-defined reachability problem and the
library of available reachability methods. This design choice offers increased
extensibility of the library, where users can define their own method in a
separate function and add the function call in the hub function.
","[{'version': 'v1', 'created': 'Thu, 14 Feb 2019 03:39:19 GMT'}]",2019-02-15,"[['Meyer', 'Pierre-Jean', ''], ['Devonport', 'Alex', ''], ['Arcak', 'Murat', '']]","['Reachability analysis', 'nonlinear systems', 'monotonicity', 'mixedmonotonicity', 'contraction', 'growth bound', 'sensitivity']"
8254,1806.07678,Zhipeng Wu,"Zhipeng Wu, Hui Tian, Xuzhen Zhu, Shuo Wang","Optimization Matrix Factorization Recommendation Algorithm Based on
  Rating Centrality",,,10.1007/978-3-319-93803-5_11,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Matrix factorization (MF) is extensively used to mine the user preference
from explicit ratings in recommender systems. However, the reliability of
explicit ratings is not always consistent, because many factors may affect the
user's final evaluation on an item, including commercial advertising and a
friend's recommendation. Therefore, mining the reliable ratings of user is
critical to further improve the performance of the recommender system. In this
work, we analyze the deviation degree of each rating in overall rating
distribution of user and item, and propose the notion of user-based rating
centrality and item-based rating centrality, respectively. Moreover, based on
the rating centrality, we measure the reliability of each user rating and
provide an optimized matrix factorization recommendation algorithm.
Experimental results on two popular recommendation datasets reveal that our
method gets better performance compared with other matrix factorization
recommendation algorithms, especially on sparse datasets.
","[{'version': 'v1', 'created': 'Wed, 20 Jun 2018 11:56:04 GMT'}]",2018-06-25,"[['Wu', 'Zhipeng', ''], ['Tian', 'Hui', ''], ['Zhu', 'Xuzhen', ''], ['Wang', 'Shuo', '']]","['matrix factorization', 'recommender systems', 'rating centrality', 'rating reliability']"
8255,1912.11872,Ting Yao,"Tao Mei, Wei Zhang, Ting Yao",Vision and Language: from Visual Perception to Content Creation,,"APSIPA Transactions on Signal and Information Processing 9 (2020)
  e11",10.1017/ATSIP.2020.10,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vision and language are two fundamental capabilities of human intelligence.
Humans routinely perform tasks through the interactions between vision and
language, supporting the uniquely human capacity to talk about what they see or
hallucinate a picture on a natural-language description. The valid question of
how language interacts with vision motivates us researchers to expand the
horizons of computer vision area. In particular, ""vision to language"" is
probably one of the most popular topics in the past five years, with a
significant growth in both volume of publications and extensive applications,
e.g., captioning, visual question answering, visual dialog, language
navigation, etc. Such tasks boost visual perception with more comprehensive
understanding and diverse linguistic representations. Going beyond the
progresses made in ""vision to language,"" language can also contribute to vision
understanding and offer new possibilities of visual content creation, i.e.,
""language to vision."" The process performs as a prism through which to create
visual content conditioning on the language inputs. This paper reviews the
recent advances along these two dimensions: ""vision to language"" and ""language
to vision."" More concretely, the former mainly focuses on the development of
image/video captioning, as well as typical encoder-decoder structures and
benchmarks, while the latter summarizes the technologies of visual content
creation. The real-world deployment or services of vision and language are
elaborated as well.
","[{'version': 'v1', 'created': 'Thu, 26 Dec 2019 14:07:20 GMT'}]",2020-04-01,"[['Mei', 'Tao', ''], ['Zhang', 'Wei', ''], ['Yao', 'Ting', '']]","['Deep Learning', 'Computer Vision', 'Artificial Intelligence']"
8256,2008.07993,Sven Weinzierl,"Sven Weinzierl and Sandra Zilker and Jens Brunk and Kate Revoredo and
  Martin Matzner and J\""org Becker","XNAP: Making LSTM-based Next Activity Predictions Explainable by Using
  LRP",,,10.1007/978-3-030-66498-5_10,,cs.AI cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predictive business process monitoring (PBPM) is a class of techniques
designed to predict behaviour, such as next activities, in running traces. PBPM
techniques aim to improve process performance by providing predictions to
process analysts, supporting them in their decision making. However, the PBPM
techniques` limited predictive quality was considered as the essential obstacle
for establishing such techniques in practice. With the use of deep neural
networks (DNNs), the techniques` predictive quality could be improved for tasks
like the next activity prediction. While DNNs achieve a promising predictive
quality, they still lack comprehensibility due to their hierarchical approach
of learning representations. Nevertheless, process analysts need to comprehend
the cause of a prediction to identify intervention mechanisms that might affect
the decision making to secure process performance. In this paper, we propose
XNAP, the first explainable, DNN-based PBPM technique for the next activity
prediction. XNAP integrates a layer-wise relevance propagation method from the
field of explainable artificial intelligence to make predictions of a long
short-term memory DNN explainable by providing relevance values for activities.
We show the benefit of our approach through two real-life event logs.
","[{'version': 'v1', 'created': 'Tue, 18 Aug 2020 15:40:07 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Oct 2020 19:40:56 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Dec 2020 19:03:05 GMT'}]",2020-12-25,"[['Weinzierl', 'Sven', ''], ['Zilker', 'Sandra', ''], ['Brunk', 'Jens', ''], ['Revoredo', 'Kate', ''], ['Matzner', 'Martin', ''], ['Becker', 'Jörg', '']]","['Predictive business process monitoring', 'explainable artificial intelligence', 'layer-wise relevance propagation', 'deep neural networks']"
8257,2103.12513,Mathilde Hotvedt,"Mathilde Hotvedt, Bjarne Grimstad, Dag Ljungquist, Lars Imsland",On gray-box modeling for virtual flow metering,"37 pages, 28 figures","Control Engineering Practice, volume 118, 2022",10.1016/j.conengprac.2021.104974,,cs.LG cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A virtual flow meter (VFM) enables continuous prediction of flow rates in
petroleum production systems. The predicted flow rates may aid the daily
control and optimization of a petroleum asset. Gray-box modeling is an approach
that combines mechanistic and data-driven modeling. The objective is to create
a computationally feasible VFM for use in real-time applications, with high
prediction accuracy and scientifically consistent behavior. This article
investigates five different gray-box model types in an industrial case study
using real, historical production data from 10 petroleum wells, spanning at
most four years of production. The results are diverse with an oil flow rate
prediction error in the range of 1.8%-40.6%. Further, the study casts light
upon the nontrivial task of balancing learning from both physics and data.
Consequently, providing general recommendations towards the suitability of
different hybrid models is challenging. Nevertheless, the results are promising
and indicate that gray-box VFMs may reduce the prediction error of a
mechanistic VFM while remaining scientifically consistent. The findings
motivate further experimentation with gray-box VFM models and suggest several
future research directions to improve upon the performance and scientific
consistency.
","[{'version': 'v1', 'created': 'Tue, 23 Mar 2021 13:17:38 GMT'}, {'version': 'v2', 'created': 'Fri, 28 May 2021 06:19:03 GMT'}, {'version': 'v3', 'created': 'Wed, 27 Oct 2021 06:15:16 GMT'}]",2021-11-10,"[['Hotvedt', 'Mathilde', ''], ['Grimstad', 'Bjarne', ''], ['Ljungquist', 'Dag', ''], ['Imsland', 'Lars', '']]","['gray-box', 'virtual flow meter', 'multiphase flow', 'neural network']"
8258,1606.02700,Olivier Walther,"David Skillicorn, Olivier Walther, Quan Zheng, Christian Leuprecht","Distance, Borders, and Time: The Diffusion and Permeability of Political
  Violence in North and West Africa",,Terrorism and Political Violence 2019,10.1080/09546553.2019.1598388,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper explores the spatial and temporal diffusion of political violence
in North and West Africa. It does so by endeavoring to represent the mental
landscape that lives in the back of a group leader's mind as he contemplates
strategic targeting. We assume that this representation is a combination of the
physical geography of the target environment, and the mental and physical cost
of following a seemingly random pattern of attacks. Focusing on the distance
and time between attacks and taking into consideration the transaction costs
that state boundaries impose, we wish to understand what constrains a group
leader to attack at a location other than the one that would seem to yield the
greatest overt payoff. By its very nature, the research problem defies the
collection of a full set of structural data. Instead, we leverage functional
data from the Armed Conflict Location and Event Data project (ACLED) dataset
that, inter alia, meticulously catalogues violent extremist incidents in North
and West Africa since 1997, to generate a network whose nodes are
administrative regions. These nodes are connected by edges of qualitatively
different types: undirected edges representing geographic distance, undirected
edges representing borders, and directed edges representing consecutive attacks
by the same group at the two endpoints. We analyze the resulting network using
novel spectral embedding techniques that are able to account fully for the
different types of edges. The result is a map of North and West Africa that
depicts the permeability to violence. A better understanding of how location,
time, and borders condition attacks enables planning, prepositioning, and
response.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2016 19:44:24 GMT'}]",2020-05-12,"[['Skillicorn', 'David', ''], ['Walther', 'Olivier', ''], ['Zheng', 'Quan', ''], ['Leuprecht', 'Christian', '']]","['political violence', 'terrorism', 'borders', 'spectral embedding', 'North and West Africa']"
8259,2111.15130,Junaid Anees,"Junaid Anees, Hao-Chun Zhang","Thermal entropy based hesitant fuzzy linguistic term set analysis in
  energy efficient opportunistic clustering","10 pages, 5 figures, International Conference on Networks and
  Communications (NETWORKS 2021)",,10.5121/csit.2021.112010,,cs.DC cs.IT math.IT,http://creativecommons.org/licenses/by/4.0/,"  Limited energy resources and sensor nodes adaptability with the surrounding
environment play a significant role in the sustainable Wireless Sensor
Networks. This paper proposes a novel, dynamic, self-organizing opportunistic
clustering using Hesitant Fuzzy Linguistic Term Analysis-based Multi-Criteria
Decision Modeling methodology in order to overcome the CH decision making
problems and network lifetime bottlenecks. The asynchronous sleep/awake cycle
strategy could be exploited to make an opportunistic connection between sensor
nodes using opportunistic connection random graph. Every node in the network
observe the node gain degree, energy welfare, relative thermal entropy, link
connectivity, expected optimal hop, link quality factor etc. to form the
criteria for Hesitant Fuzzy Linguistic Term Set. It makes the node to evaluate
its current state and make the decision about the required action (CH, CM or
relay). The simulation results reveal that our proposed scheme leads to an
improvement in network lifetime, packet delivery ratio and overall energy
consumption against existing benchmarks.
","[{'version': 'v1', 'created': 'Tue, 30 Nov 2021 05:18:38 GMT'}]",2021-12-01,"[['Anees', 'Junaid', ''], ['Zhang', 'Hao-Chun', '']]","['Graph Theory', 'Wireless Sensor Networks', 'Hesitant Fuzzy Linguistic Term Set', 'Opportunistic Routing', 'RF Energy Transfer']"
8260,2011.13188,Christian Janiesch,"Marcus Fischer, Adrian Hofmann, Florian Imgrund, Christian Janiesch,
  Axel Winkelmann","On the Composition of the Long Tail of Business Processes: Implications
  from a Process Mining Study",Accepted for publication at Information Systems,,10.1016/j.is.2020.101689,,cs.SE cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Digital transformation forces companies to rethink their processes to meet
current customer needs. Business Process Management (BPM) can provide the means
to structure and tackle this change. However, most approaches to BPM face
restrictions on the number of processes they can optimize at a time due to
complexity and resource restrictions. Investigating this shortcoming, the
concept of the long tail of business processes suggests a hybrid approach that
entails managing important processes centrally, while incrementally improving
the majority of processes at their place of execution. This study scrutinizes
this observation as well as corresponding implications. First, we define a
system of indicators to automatically prioritize processes based on execution
data. Second, we use process mining to analyze processes from multiple
companies to investigate the distribution of process value in terms of their
process variants. Third, we examine the characteristics of the process variants
contained in the short head and the long tail to derive and justify
recommendations for their management. Our results suggest that the assumption
of a long-tailed distribution holds across companies and indicators and also
applies to the overall improvement potential of processes and their variants.
Across all cases, process variants in the long tail were characterized by fewer
customer contacts, lower execution frequencies, and a larger number of involved
stakeholders, making them suitable candidates for distributed improvement.
","[{'version': 'v1', 'created': 'Thu, 26 Nov 2020 09:04:15 GMT'}]",2020-12-02,"[['Fischer', 'Marcus', ''], ['Hofmann', 'Adrian', ''], ['Imgrund', 'Florian', ''], ['Janiesch', 'Christian', ''], ['Winkelmann', 'Axel', '']]","['Business Process Management', 'Long Tail of Business Processes', 'Process Mining', 'Process Perfor']"
8261,1904.05308,Davy Weissenbacher,"Davy Weissenbacher, Abeed Sarker, Ari Klein, Karen O'Connor, Arjun
  Magge Ranganatha, Graciela Gonzalez-Hernandez","Deep Neural Networks Ensemble for Detecting Medication Mentions in
  Tweets","This is a pre-copy-editing, author-produced PDF of an article
  accepted for publication in JAMIA following peer review. The definitive
  publisher-authenticated version is ""D. Weissenbacher, A. Sarker, A. Klein, K.
  O'Connor, A. Magge, G. Gonzalez-Hernandez, Deep neural networks ensemble for
  detecting medication mentions in tweets, Journal of the American Medical
  Informatics Association, ocz156, 2019""","Journal of the American Medical Informatics Association, ocz156,
  2019",10.1093/jamia/ocz156,,cs.CL cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Objective: After years of research, Twitter posts are now recognized as an
important source of patient-generated data, providing unique insights into
population health. A fundamental step to incorporating Twitter data in
pharmacoepidemiological research is to automatically recognize medication
mentions in tweets. Given that lexical searches for medication names may fail
due to misspellings or ambiguity with common words, we propose a more advanced
method to recognize them. Methods: We present Kusuri, an Ensemble Learning
classifier, able to identify tweets mentioning drug products and dietary
supplements. Kusuri (""medication"" in Japanese) is composed of two modules.
First, four different classifiers (lexicon-based, spelling-variant-based,
pattern-based and one based on a weakly-trained neural network) are applied in
parallel to discover tweets potentially containing medication names. Second, an
ensemble of deep neural networks encoding morphological, semantical and
long-range dependencies of important words in the tweets discovered is used to
make the final decision. Results: On a balanced (50-50) corpus of 15,005
tweets, Kusuri demonstrated performances close to human annotators with 93.7%
F1-score, the best score achieved thus far on this corpus. On a corpus made of
all tweets posted by 113 Twitter users (98,959 tweets, with only 0.26%
mentioning medications), Kusuri obtained 76.3% F1-score. There is not a prior
drug extraction system that compares running on such an extremely unbalanced
dataset. Conclusion: The system identifies tweets mentioning drug names with
performance high enough to ensure its usefulness and ready to be integrated in
larger natural language processing systems.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2019 17:18:17 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Sep 2019 16:34:33 GMT'}]",2019-10-01,"[['Weissenbacher', 'Davy', ''], ['Sarker', 'Abeed', ''], ['Klein', 'Ari', ''], [""O'Connor"", 'Karen', ''], ['Ranganatha', 'Arjun Magge', ''], ['Gonzalez-Hernandez', 'Graciela', '']]","['Social Media', 'Pharmacovigilance', 'Drug Name Detection', 'Ensemble Learning', 'Text Classification']"
8262,2112.06127,Zoltan Nagy,"Kingsley Nweye, Bo Liu, Peter Stone, Zoltan Nagy","Real-world challenges for multi-agent reinforcement learning in
  grid-interactive buildings",under review,,10.1016/j.egyai.2022.100202,,cs.LG cs.AI cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Building upon prior research that highlighted the need for standardizing
environments for building control research, and inspired by recently introduced
challenges for real life reinforcement learning control, here we propose a
non-exhaustive set of nine real world challenges for reinforcement learning
control in grid-interactive buildings. We argue that research in this area
should be expressed in this framework in addition to providing a standardized
environment for repeatability. Advanced controllers such as model predictive
control and reinforcement learning (RL) control have both advantages and
disadvantages that prevent them from being implemented in real world problems.
Comparisons between the two are rare, and often biased. By focusing on the
challenges, we can investigate the performance of the controllers under a
variety of situations and generate a fair comparison. As a demonstration, we
implement the offline learning challenge in CityLearn and study the impact of
different levels of domain knowledge and complexity of RL algorithms. We show
that the sequence of operations utilized in a rule based controller (RBC) used
for offline training affects the performance of the RL agents when evaluated on
a set of four energy flexibility metrics. Longer offline learning from an
optimized RBC leads to improved performance in the long run. RL agents that
learn from a simplified RBC risk poorer performance as the offline learning
period increases. We also observe no impact on performance from information
sharing amongst agents. We call for a more interdisciplinary effort of the
research community to address the real world challenges, and unlock the
potential of grid-interactive building
","[{'version': 'v1', 'created': 'Thu, 25 Nov 2021 02:59:53 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Feb 2022 21:50:21 GMT'}]",2022-09-13,"[['Nweye', 'Kingsley', ''], ['Liu', 'Bo', ''], ['Stone', 'Peter', ''], ['Nagy', 'Zoltan', '']]","['Grid-interactive buildings', 'Benchmarking', 'Reinforcement Learning']"
8263,2112.04605,Erik Bryhn Myklebust,"Erik B. Myklebust, Ernesto Jim\'enez-Ruiz, Jiaoyan Chen, Raoul Wolf,
  Knut Erik Tollefsen","Prediction of Adverse Biological Effects of Chemicals Using Knowledge
  Graph Embeddings","Semantic Web, vol. Pre-press, no. Pre-press, pp. 1-40, 2022",,10.3233/SW-222804,,cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  We have created a knowledge graph based on major data sources used in
ecotoxicological risk assessment. We have applied this knowledge graph to an
important task in risk assessment, namely chemical effect prediction. We have
evaluated nine knowledge graph embedding models from a selection of geometric,
decomposition, and convolutional models on this prediction task. We show that
using knowledge graph embeddings can increase the accuracy of effect prediction
with neural networks. Furthermore, we have implemented a fine-tuning
architecture that adapts the knowledge graph embeddings to the effect
prediction task and leads to better performance. Finally, we evaluate certain
characteristics of the knowledge graph embedding models to shed light on the
individual model performance.
","[{'version': 'v1', 'created': 'Wed, 8 Dec 2021 22:19:16 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Mar 2022 08:29:27 GMT'}]",2022-03-31,"[['Myklebust', 'Erik B.', ''], ['Jiménez-Ruiz', 'Ernesto', ''], ['Chen', 'Jiaoyan', ''], ['Wolf', 'Raoul', ''], ['Tollefsen', 'Knut Erik', '']]","['Knowledge graph', 'ecotoxicology', 'risk assessment', 'adverse effects', 'embedding', 'chemicals', 'species']"
8264,2003.01033,Niceto R. Luque,"Ignacio Abadia, Francisco Naveros, Jesus A. Garrido, Eduardo Ros,
  Niceto R. Luque",On robot compliance. A cerebellar control approach,,,10.1109/TCYB.2019.2945498,,cs.RO cs.NE cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The work presented here is a novel biological approach for the compliant
control of a robotic arm in real time (RT). We integrate a spiking cerebellar
network at the core of a feedback control loop performing torque-driven
control. The spiking cerebellar controller provides torque commands allowing
for accurate and coordinated arm movements. To compute these output motor
commands, the spiking cerebellar controller receives the robot's sensorial
signals, the robot's goal behavior, and an instructive signal. These input
signals are translated into a set of evolving spiking patterns representing
univocally a specific system state at every point of time.
Spike-timing-dependent plasticity (STDP) is then supported, allowing for
building adaptive control. The spiking cerebellar controller continuously
adapts the torque commands provided to the robot from experience as STDP is
deployed. Adaptive torque commands, in turn, help the spiking cerebellar
controller to cope with built-in elastic elements within the robot's actuators
mimicking human muscles (inherently elastic). We propose a natural integration
of a bio inspired control scheme, based on the cerebellum, with a compliant
robot. We prove that our compliant approach outperforms the accuracy of the
default factory-installed position control in a set of tasks used for
addressing cerebellar motor behavior: controlling six degrees of freedom (DoF)
in smooth movements, fast ballistic movements, and unstructured scenario
compliant movements.
","[{'version': 'v1', 'created': 'Mon, 2 Mar 2020 17:06:19 GMT'}, {'version': 'v2', 'created': 'Tue, 31 Mar 2020 07:19:55 GMT'}]",2020-04-01,"[['Abadia', 'Ignacio', ''], ['Naveros', 'Francisco', ''], ['Garrido', 'Jesus A.', ''], ['Ros', 'Eduardo', ''], ['Luque', 'Niceto R.', '']]","['Adaptive spiking control', 'cerebellar modelling', 'compliant robotics', 'realtime (RT) control', 'spike timing-dependent plasticity (STDP)']"
8265,2006.16864,Junaid Shuja Dr.,"Junaid Shuja, Kashif Bilal, Waleed Alasmary, Hassan Sinky, Eisa
  Alanazi","Applying Machine Learning Techniques for Caching in Edge Networks: A
  Comprehensive Survey",This is the updated article submitted for publication,"Journal of Network and Computer Applications,2021,103005",10.1016/j.jnca.2021.103005,,cs.NI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Edge networking is a complex and dynamic computing paradigm that aims to push
cloud resources closer to the end user improving responsiveness and reducing
backhaul traffic. User mobility, preferences, and content popularity are the
dominant dynamic features of edge networks. Temporal and social features of
content, such as the number of views and likes are leveraged to estimate the
popularity of content from a global perspective. However, such estimates should
not be mapped to an edge network with particular social and geographic
characteristics. In next generation edge networks, i.e., 5G and beyond 5G,
machine learning techniques can be applied to predict content popularity based
on user preferences, cluster users based on similar content interests, and
optimize cache placement and replacement strategies provided a set of
constraints and predictions about the state of the network. These applications
of machine learning can help identify relevant content for an edge network.
This article investigates the application of machine learning techniques for
in-network caching in edge networks. We survey recent state-of-the-art
literature and formulate a comprehensive taxonomy based on (a) machine learning
technique (method, objective, and features), (b) caching strategy (policy,
location, and replacement), and (c) edge network (type and delivery strategy).
A comparative analysis of the state-of-the-art literature is presented with
respect to the parameters identified in the taxonomy. Moreover, we debate
research challenges and future directions for optimal caching decisions and the
application of machine learning in edge networks.
","[{'version': 'v1', 'created': 'Sun, 21 Jun 2020 09:31:56 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Oct 2020 10:17:52 GMT'}, {'version': 'v3', 'created': 'Mon, 26 Oct 2020 07:10:46 GMT'}, {'version': 'v4', 'created': 'Tue, 3 Nov 2020 18:05:37 GMT'}]",2021-03-08,"[['Shuja', 'Junaid', ''], ['Bilal', 'Kashif', ''], ['Alasmary', 'Waleed', ''], ['Sinky', 'Hassan', ''], ['Alanazi', 'Eisa', '']]","['Caching', 'Edge networks', 'Machine learning', 'popularity prediction', '5G']"
8266,2206.06083,Dietmar Pfahl,Kristiina Rahkema and Dietmar Pfahl,"Dataset: Dependency Networks of Open Source Libraries Available Through
  CocoaPods, Carthage and Swift PM",5 pages,"19th International Conference on Mining Software Repositories (MSR
  2022)",10.1145/3524842.3528016,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Third party libraries are used to integrate existing solutions for common
problems and help speed up development. The use of third party libraries,
however, can carry risks, for example through vulnerabilities in these
libraries. Studying the dependency networks of package managers lets us better
understand and mitigate these risks. So far, the dependency networks of the
three most important package managers of the Apple ecosystem, CocoaPods,
Carthage and Swift PM, have not been studied. We analysed the dependencies for
all publicly available open source libraries up to December 2021 and compiled a
dataset containing the dependency networks of all three package managers. The
dependency networks can be used to analyse how vulnerabilities are propagated
through transitive dependencies. In order to ease the tracing of vulnerable
libraries we also queried the NVD database and included publicly reported
vulnerabilities for these libraries in the dataset.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2022 12:13:28 GMT'}]",2022-06-14,"[['Rahkema', 'Kristiina', ''], ['Pfahl', 'Dietmar', '']]","['datasets', 'iOS', 'dependency network', 'package manager', 'mobile apps']"
8267,1602.04924,Viet Ha-Thuc,Dhruv Arya and Viet Ha-Thuc and Shakti Sinha,Personalized Federated Search at LinkedIn,"in Proceedings of the 24th ACM International on Conference on
  Information and Knowledge Management (CIKM 2015)",,10.1145/2806416.2806615,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  LinkedIn has grown to become a platform hosting diverse sources of
information ranging from member profiles, jobs, professional groups, slideshows
etc. Given the existence of multiple sources, when a member issues a query like
""software engineer"", the member could look for software engineer profiles, jobs
or professional groups. To tackle this problem, we exploit a data-driven
approach that extracts searcher intents from their profile data and recent
activities at a large scale. The intents such as job seeking, hiring, content
consuming are used to construct features to personalize federated search
experience. We tested the approach on the LinkedIn homepage and A/B tests show
significant improvements in member engagement. As of writing this paper, the
approach powers all of federated search on LinkedIn homepage.
","[{'version': 'v1', 'created': 'Tue, 16 Feb 2016 07:10:42 GMT'}]",2016-02-17,"[['Arya', 'Dhruv', ''], ['Ha-Thuc', 'Viet', ''], ['Sinha', 'Shakti', '']]","['Federated search', 'social network', 'ranking', 'machine learning', 'information retrieval']"
8268,2101.12737,I. Elizabeth Kumar,Leif Hancox-Li and I. Elizabeth Kumar,"Epistemic values in feature importance methods: Lessons from feminist
  epistemology",Accepted to ACM FAccT 2021,,10.1145/3442188.3445943,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As the public seeks greater accountability and transparency from machine
learning algorithms, the research literature on methods to explain algorithms
and their outputs has rapidly expanded. Feature importance methods form a
popular class of explanation methods. In this paper, we apply the lens of
feminist epistemology to recent feature importance research. We investigate
what epistemic values are implicitly embedded in feature importance methods and
how or whether they are in conflict with feminist epistemology. We offer some
suggestions on how to conduct research on explanations that respects feminist
epistemic values, taking into account the importance of social context, the
epistemic privileges of subjugated knowers, and adopting more interactional
ways of knowing.
","[{'version': 'v1', 'created': 'Fri, 29 Jan 2021 18:51:46 GMT'}]",2021-02-01,"[['Hancox-Li', 'Leif', ''], ['Kumar', 'I. Elizabeth', '']]","['explanation', 'philosophy', 'epistemology', 'machine learning', 'featureimportance', 'feminism', 'methodology']"
8269,1912.08324,Kai Arulkumaran,"Tianhong Dai, Kai Arulkumaran, Tamara Gerbert, Samyakh Tukra, Feryal
  Behbahani, Anil Anthony Bharath","Analysing Deep Reinforcement Learning Agents Trained with Domain
  Randomisation",,,10.1016/j.neucom.2022.04.005,,cs.LG cs.CV cs.NE cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep reinforcement learning has the potential to train robots to perform
complex tasks in the real world without requiring accurate models of the robot
or its environment. A practical approach is to train agents in simulation, and
then transfer them to the real world. One popular method for achieving
transferability is to use domain randomisation, which involves randomly
perturbing various aspects of a simulated environment in order to make trained
agents robust to the reality gap. However, less work has gone into
understanding such agents - which are deployed in the real world - beyond task
performance. In this work we examine such agents, through qualitative and
quantitative comparisons between agents trained with and without visual domain
randomisation. We train agents for Fetch and Jaco robots on a visuomotor
control task and evaluate how well they generalise using different testing
conditions. Finally, we investigate the internals of the trained agents by
using a suite of interpretability techniques. Our results show that the primary
outcome of domain randomisation is more robust, entangled representations,
accompanied with larger weights with greater spatial structure; moreover, the
types of changes are heavily influenced by the task setup and presence of
additional proprioceptive inputs. Additionally, we demonstrate that our domain
randomised agents require higher sample complexity, can overfit and more
heavily rely on recurrent processing. Furthermore, even with an improved
saliency method introduced in this work, we show that qualitative studies may
not always correspond with quantitative measures, necessitating the combination
of inspection tools in order to provide sufficient insights into the behaviour
of trained agents.
","[{'version': 'v1', 'created': 'Wed, 18 Dec 2019 00:18:17 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Feb 2020 20:53:30 GMT'}]",2022-10-26,"[['Dai', 'Tianhong', ''], ['Arulkumaran', 'Kai', ''], ['Gerbert', 'Tamara', ''], ['Tukra', 'Samyakh', ''], ['Behbahani', 'Feryal', ''], ['Bharath', 'Anil Anthony', '']]","['Deep reinforcement learning', 'Generalisation', 'Interpretability', 'Saliency']"
8270,1910.12787,Thomas Kahl,Thomas Kahl,Weak equivalence of higher-dimensional automata,,"Discrete Mathematics & Theoretical Computer Science, vol. 23 no.
  1, Automata, Logic and Semantics (May 18, 2021) dmtcs:7490",10.46298/dmtcs.5884,,cs.LO cs.FL math.AT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a notion of equivalence for higher-dimensional
automata, called weak equivalence. Weak equivalence focuses mainly on a
traditional trace language and a new homology language, which captures the
overall independence structure of an HDA. It is shown that weak equivalence is
compatible with both the tensor product and the coproduct of HDAs and that,
under certain conditions, HDAs may be reduced to weakly equivalent smaller ones
by merging and collapsing cubes.
","[{'version': 'v1', 'created': 'Mon, 28 Oct 2019 16:30:42 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Jan 2021 12:14:47 GMT'}, {'version': 'v3', 'created': 'Sun, 16 May 2021 16:53:31 GMT'}]",2021-10-04,"[['Kahl', 'Thomas', '']]","['Higher-dimensional automata', 'weak equivalence', 'trace language', 'homology language']"
8271,2008.11832,Wenqian Dong,"Wenqian Dong, Jie Liu, Zhen Xie and Dong Li","Adaptive Neural Network-Based Approximation to Accelerate Eulerian Fluid
  Simulation",,,10.1145/3295500.3356147,,cs.LG cs.DC physics.comp-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Eulerian fluid simulation is an important HPC application. The neural
network has been applied to accelerate it. The current methods that accelerate
the fluid simulation with neural networks lack flexibility and generalization.
In this paper, we tackle the above limitation and aim to enhance the
applicability of neural networks in the Eulerian fluid simulation. We introduce
Smartfluidnet, a framework that automates model generation and application.
Given an existing neural network as input, Smartfluidnet generates multiple
neural networks before the simulation to meet the execution time and simulation
quality requirement. During the simulation, Smartfluidnet dynamically switches
the neural networks to make the best efforts to reach the user requirement on
simulation quality. Evaluating with 20,480 input problems, we show that
Smartfluidnet achieves 1.46x and 590x speedup comparing with a state-of-the-art
neural network model and the original fluid simulation respectively on an
NVIDIA Titan X Pascal GPU, while providing better simulation quality than the
state-of-the-art model.
","[{'version': 'v1', 'created': 'Wed, 26 Aug 2020 21:44:44 GMT'}]",2020-08-31,"[['Dong', 'Wenqian', ''], ['Liu', 'Jie', ''], ['Xie', 'Zhen', ''], ['Li', 'Dong', '']]","['Approximate computing', 'Computational fluid simulation', 'Neuralnetwork']"
8272,1712.03359,Farid Feyzi,"Farid Feyzi, Saeed Parsa","FPA-FL: Incorporating Static Fault-proneness Analysis into Statistical
  Fault Localization",,"Systems and Software, Volume 136, February 2018, Pages 39-58",10.1016/j.jss.2017.11.002,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the proven applicability of the statistical methods in automatic
fault localization, these approaches are biased by data collected from
different executions of the program. This biasness could result in unstable
statistical models which may vary dependent on test data provided for trial
executions of the program. To resolve the difficulty, in this article a new
fault-proneness-aware statistical approach based on Elastic-Net regression,
namely FPA-FL is proposed. The main idea behind FPA-FL is to consider the
static structure and the fault-proneness of the program statements in addition
to their dynamic correlations with the program termination state. The grouping
effect of FPA-FL is helpful for finding multiple faults and supporting
scalability. To provide the context of failure, cause-effect chains of program
faults are discovered. FPA-FL is evaluated from different viewpoints on
well-known test suites. The results reveal high fault localization performance
of our approach, compared with similar techniques in the literature.
","[{'version': 'v1', 'created': 'Sat, 9 Dec 2017 09:06:26 GMT'}]",2017-12-12,"[['Feyzi', 'Farid', ''], ['Parsa', 'Saeed', '']]","['Fault Localization', 'Statistical Debugging', 'Backward Dynamic Slice', 'Fault-proneness', 'Elastic-Net Regression', 'Coincidental']"
8273,2004.11968,Edgar Avalos,"Edgar Avalos, Kazuto Akagi and Yasumasa Nishiura","Visible fingerprint of X-ray images of epoxy resins using singular value
  decomposition of deep learning features","43 pages, 16 figures","COMMAT Volume 186, January 2021, 109996",10.1016/j.commatsci.2020.109996,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although the process variables of epoxy resins alter their mechanical
properties, the visual identification of the characteristic features of X-ray
images of samples of these materials is challenging. To facilitate the
identification, we approximate the magnitude of the gradient of the intensity
field of the X-ray images of different kinds of epoxy resins and then we use
deep learning to discover the most representative features of the transformed
images. In this solution of the inverse problem to finding characteristic
features to discriminate samples of heterogeneous materials, we use the
eigenvectors obtained from the singular value decomposition of all the channels
of the feature maps of the early layers in a convolutional neural network.
While the strongest activated channel gives a visual representation of the
characteristic features, often these are not robust enough in some practical
settings. On the other hand, the left singular vectors of the matrix
decomposition of the feature maps, barely change when variables such as the
capacity of the network or network architecture change. High classification
accuracy and robustness of characteristic features are presented in this work.
","[{'version': 'v1', 'created': 'Thu, 16 Apr 2020 09:44:08 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Sep 2020 03:46:45 GMT'}]",2020-09-24,"[['Avalos', 'Edgar', ''], ['Akagi', 'Kazuto', ''], ['Nishiura', 'Yasumasa', '']]","['Epoxy resin', 'X-ray CT scan', 'Deep learning', 'Convolutional neural']"
8274,1909.02077,Yirui Wang,"Yirui Wang, Le Lu, Chi-Tung Cheng, Dakai Jin, Adam P. Harrison, Jing
  Xiao, Chien-Hung Liao, Shun Miao",Weakly Supervised Universal Fracture Detection in Pelvic X-rays,MICCAI 2019 (early accept),,10.1007/978-3-030-32226-7_51,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hip and pelvic fractures are serious injuries with life-threatening
complications. However, diagnostic errors of fractures in pelvic X-rays (PXRs)
are very common, driving the demand for computer-aided diagnosis (CAD)
solutions. A major challenge lies in the fact that fractures are localized
patterns that require localized analyses. Unfortunately, the PXRs residing in
hospital picture archiving and communication system do not typically specify
region of interests. In this paper, we propose a two-stage hip and pelvic
fracture detection method that executes localized fracture classification using
weakly supervised ROI mining. The first stage uses a large capacity
fully-convolutional network, i.e., deep with high levels of abstraction, in a
multiple instance learning setting to automatically mine probable true positive
and definite hard negative ROIs from the whole PXR in the training data. The
second stage trains a smaller capacity model, i.e., shallower and more
generalizable, with the mined ROIs to perform localized analyses to classify
fractures. During inference, our method detects hip and pelvic fractures in one
pass by chaining the probability outputs of the two stages together. We
evaluate our method on 4 410 PXRs, reporting an area under the ROC curve value
of 0.975, the highest among state-of-the-art fracture detection methods.
Moreover, we show that our two-stage approach can perform comparably to human
physicians (even outperforming emergency physicians and surgeons), in a
preliminary reader study of 23 readers.
","[{'version': 'v1', 'created': 'Wed, 4 Sep 2019 20:04:50 GMT'}]",2020-07-14,"[['Wang', 'Yirui', ''], ['Lu', 'Le', ''], ['Cheng', 'Chi-Tung', ''], ['Jin', 'Dakai', ''], ['Harrison', 'Adam P.', ''], ['Xiao', 'Jing', ''], ['Liao', 'Chien-Hung', ''], ['Miao', 'Shun', '']]","['Fracture classification and localization', 'Pelvic X-ray', 'Weakly supervised detection', 'Cascade two-stage training', 'Image level labels']"
8275,2202.02430,Saurabh Deochake,"Saurabh Deochake, Shashank Kanth, Subhadip Chakraborty, Suresh Sarode,
  Vidyasagar Potdar, Debajyoti Mukhopadhyay","HENRI: High Efficiency Negotiation-based Robust Interface for
  Multi-party Multi-issue Negotiation over the Internet","CUBE '12: Proceedings of the CUBE International Information
  Technology Conference. arXiv admin note: substantial text overlap with
  arXiv:1206.5884",,10.1145/2381716.2381840,,cs.AI cs.MA cs.NI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper proposes a framework for a full fledged negotiation system that
allows multi party multi issue negotiation. It focuses on the negotiation
protocol to be observed and provides a platform for concurrent and independent
negotiation on individual issues using the concept of multi threading. It
depicts the architecture of an agent detailing its components. The paper sets
forth a hierarchical pattern for the multiple issues concerning every party.
The system also provides enhancements such as the time-to-live counters for
every advertisement, refinement of utility considering non-functional
attributes, prioritization of issues, by assigning weights to issues.
","[{'version': 'v1', 'created': 'Fri, 4 Feb 2022 23:18:49 GMT'}]",2022-02-08,"[['Deochake', 'Saurabh', ''], ['Kanth', 'Shashank', ''], ['Chakraborty', 'Subhadip', ''], ['Sarode', 'Suresh', ''], ['Potdar', 'Vidyasagar', ''], ['Mukhopadhyay', 'Debajyoti', '']]","['Multi-party multi-issue', 'Utility Function', 'Multi threading', 'Master coordinator and Coordinator object', 'Concurrent negotiation']"
8276,2101.02351,Sohom Ghosh,"Ankush Chopra, Shruti Agrawal and Sohom Ghosh","Applying Transfer Learning for Improving Domain-Specific Search
  Experience Using Query to Question Similarity","8 pages, accepted in the Proceedings of the 3rd International
  Conference on Algorithms, Computing and Artificial Intelligence (ACAI), 2020",,10.1145/3446132.3446403,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Search is one of the most common platforms used to seek information. However,
users mostly get overloaded with results whenever they use such a platform to
resolve their queries. Nowadays, direct answers to queries are being provided
as a part of the search experience. The question-answer (QA) retrieval process
plays a significant role in enriching the search experience. Most off-the-shelf
Semantic Textual Similarity models work fine for well-formed search queries,
but their performances degrade when applied to a domain-specific setting having
incomplete or grammatically ill-formed search queries in prevalence. In this
paper, we discuss a framework for calculating similarities between a given
input query and a set of predefined questions to retrieve the question which
matches to it the most. We have used it for the financial domain, but the
framework is generalized for any domain-specific search engine and can be used
in other domains as well. We use Siamese network [6] over Long Short-Term
Memory (LSTM) [3] models to train a classifier which generates unnormalized and
normalized similarity scores for a given pair of questions. Moreover, for each
of these question pairs, we calculate three other similarity scores: cosine
similarity between their average word2vec embeddings [15], cosine similarity
between their sentence embeddings [7] generated using RoBERTa [17] and their
customized fuzzy-match score. Finally, we develop a metaclassifier using
Support Vector Machines [19] for combining these five scores to detect if a
given pair of questions is similar. We benchmark our model's performance
against existing State Of The Art (SOTA) models on Quora Question Pairs (QQP)
dataset as well as a dataset specific to the financial domain.
","[{'version': 'v1', 'created': 'Thu, 7 Jan 2021 03:27:32 GMT'}]",2021-01-08,"[['Chopra', 'Ankush', ''], ['Agrawal', 'Shruti', ''], ['Ghosh', 'Sohom', '']]","['Deep learning', 'Natural language processing', 'Question similarity', 'Semantic textual similarity', 'Syntactic text similarity']"
8277,cs/0309038,Valmir Barbosa,"V. C. Barbosa, L. C. D. Campos",A novel evolutionary formulation of the maximum independent set problem,,"Journal of Combinatorial Optimization 8 (2004), 419-437",10.1007/s10878-004-4835-9,ES-615/03,cs.NE,,"  We introduce a novel evolutionary formulation of the problem of finding a
maximum independent set of a graph. The new formulation is based on the
relationship that exists between a graph's independence number and its acyclic
orientations. It views such orientations as individuals and evolves them with
the aid of evolutionary operators that are very heavily based on the structure
of the graph and its acyclic orientations. The resulting heuristic has been
tested on some of the Second DIMACS Implementation Challenge benchmark graphs,
and has been found to be competitive when compared to several of the other
heuristics that have also been tested on those graphs.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2003 13:05:51 GMT'}]",2007-05-23,"[['Barbosa', 'V. C.', ''], ['Campos', 'L. C. D.', '']]","['Maximum independent sets', 'evolutionary algorithms', 'geneticalgorithms']"
8278,2108.06503,Stian Soiland-Reyes,"Stian Soiland-Reyes, Peter Sefton, Merc\`e Crosas, Leyla Jael Castro,
  Frederik Coppens, Jos\'e M. Fern\'andez, Daniel Garijo, Bj\""orn Gr\""uning,
  Marco La Rosa, Simone Leo, Eoghan \'O Carrag\'ain, Marc Portier, Ana
  Trisovic, RO-Crate Community, Paul Groth, Carole Goble",Packaging research artefacts with RO-Crate,44 pages. Accepted for Data Science,Data Science 2022,10.3233/DS-210053,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  An increasing number of researchers support reproducibility by including
pointers to and descriptions of datasets, software and methods in their
publications. However, scientific articles may be ambiguous, incomplete and
difficult to process by automated systems. In this paper we introduce RO-Crate,
an open, community-driven, and lightweight approach to packaging research
artefacts along with their metadata in a machine readable manner. RO-Crate is
based on Schema$.$org annotations in JSON-LD, aiming to establish best
practices to formally describe metadata in an accessible and practical way for
their use in a wide variety of situations.
  An RO-Crate is a structured archive of all the items that contributed to a
research outcome, including their identifiers, provenance, relations and
annotations. As a general purpose packaging approach for data and their
metadata, RO-Crate is used across multiple areas, including bioinformatics,
digital humanities and regulatory sciences. By applying ""just enough"" Linked
Data standards, RO-Crate simplifies the process of making research outputs FAIR
while also enhancing research reproducibility.
  An RO-Crate for this article is available at
https://w3id.org/ro/doi/10.5281/zenodo.5146227
","[{'version': 'v1', 'created': 'Sat, 14 Aug 2021 09:51:25 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Dec 2021 11:11:53 GMT'}]",2022-01-11,"[['Soiland-Reyes', 'Stian', ''], ['Sefton', 'Peter', ''], ['Crosas', 'Mercè', ''], ['Castro', 'Leyla Jael', ''], ['Coppens', 'Frederik', ''], ['Fernández', 'José M.', ''], ['Garijo', 'Daniel', ''], ['Grüning', 'Björn', ''], ['La Rosa', 'Marco', ''], ['Leo', 'Simone', ''], ['Carragáin', 'Eoghan Ó', ''], ['Portier', 'Marc', ''], ['Trisovic', 'Ana', ''], ['Community', 'RO-Crate', ''], ['Groth', 'Paul', ''], ['Goble', 'Carole', '']]","['Data publishing', 'Data packaging', 'FAIR', 'Linked Data', 'Metadata', 'Reproducibility', 'Research Object']"
8279,2011.02122,Rahul Chakwate,"Rahul Chakwate, Madhan R A","Analysing Long Short Term Memory Models for Cricket Match Outcome
  Prediction",,,10.22214/ijraset.2020.28203,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As the technology advances, an ample amount of data is collected in sports
with the help of advanced sensors. Sports Analytics is the study of this data
to provide a constructive advantage to the team and its players. The game of
international cricket is popular all across the globe. Recently, various
machine learning techniques have been used to analyse the cricket match data
and predict the match outcome as win or lose. Generally these models make use
of the overall match level statistics such as teams, venue, average run rate,
win margin, etc to predict the match results before the beginning of the match.
However, very few works provide insights based on the ball-by-ball level
statistics. Here we propose a novel Recurrent Neural Network model which can
predict the win probability of a match at regular intervals given the
ball-by-ball statistics. The Long Short Term Memory (LSTM) Model takes as input
the ball wise features as well as the match level details available from the
training dataset. It gives a prediction of winning the match at any time stamp
during the match. This level of insight will help the team to predict the
probability of them winning the match after every ball and help them determine
the critical in-game changes they should make in their game strategies.
","[{'version': 'v1', 'created': 'Wed, 4 Nov 2020 04:49:11 GMT'}]",2020-11-05,"[['Chakwate', 'Rahul', ''], ['A', 'Madhan R', '']]","['Cricket', 'ODIs', 'Machine  Learning', 'DeepLearning', 'RNN', 'LSTM', 'Match Outcome Prediction']"
8280,2211.01679,Carlos Rojas Castillo,"Carlos Rojas Castillo (Vrije Universiteit Brussel, Belgium), Matteo
  Marra (Vrije Universiteit Brussel, Belgium), Jim Bauwens (Vrije Universiteit
  Brussel, Belgium), Elisa Gonzalez Boix (Vrije Universiteit Brussel, Belgium)","Out-of-Things Debugging: A Live Debugging Approach for Internet of
  Things",,"The Art, Science, and Engineering of Programming, 2023, Vol. 7,
  Issue 2, Article 5",10.22152/programming-journal.org/2023/7/5,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Internet of Things (IoT) has become an important kind of distributed
systems thanks to the wide-spread of cheap embedded devices equipped with
different networking technologies. Although ubiquitous, developing IoT systems
remains challenging.
  Inquiry: A recent field study with 194 IoT developers identifies debugging as
one of the main challenges faced when developing IoT systems. This comes from
the lack of debugging tools taking into account the unique properties of IoT
systems such as non-deterministic data, and hardware restricted devices. On the
one hand, offline debuggers allow developers to analyse post-failure recorded
program information, but impose too much overhead on the devices while
generating such information.
  Furthermore, the analysis process is also time-consuming and might miss
contextual information relevant to find the root cause of bugs. On the other
hand, online debuggers do allow debugging a program upon a failure while
providing contextual information (e.g., stack trace). In particular, remote
online debuggers enable debugging of devices without physical access to them.
However, they experience debugging interference due to network delays which
complicates bug reproducibility, and have limited support for dynamic software
updates on remote devices.
  Approach: This paper proposes out-of-things debugging, an online debugging
approach especially designed for IoT systems. The debugger is always-on as it
ensures constant availability to for instance debug post-deployment situations.
Upon a failure or breakpoint, out-of-things debugging moves the state of a
deployed application to the developer's machine. Developers can then debug the
application locally by applying operations (e.g., step commands) to the
retrieved state. Once debugging is finished, developers can commit bug fixes to
the device through live update capabilities. Finally, by means of a
fine-grained flexible interface for accessing remote resources, developers have
full control over the debugging overhead imposed on the device, and the access
to device hardware resources (e.g., sensors) needed during local debugging.
  Knowledge: Out-of-things debugging maintains good properties of remote
debugging as it does not require physical access to the device to debug it,
while reducing debugging interference since there are no network delays on
operations (e.g., stepping) issued on the debugger since those happen locally.
Furthermore, device resources are only accessed when requested by the user
which further mitigates overhead and opens avenues for mocking or simulation of
non-accessed resources.
  Grounding: We implemented an out-of-things debugger as an extension to a
WebAssembly Virtual Machine and benchmarked its suitability for IoT. In
particular, we compared our solution to remote debugging alternatives based on
metrics such as network overhead, memory usage, scalability, and usability in
production settings. From the benchmarks, we conclude that our debugger
exhibits competitive performance in addition to confining overhead without
sacrificing debugging convenience and flexibility.
  Importance: Out-of-things debugging enables debugging of IoT systems by means
of classical online operations (e.g., stepwise execution) while addressing
IoT-specific concerns (e.g., hardware limitations). We show that having the
debugger always-on does not have to come at cost of performance loss or
increased overhead but instead can enforce a smooth-going and flexible
debugging experience of IoT systems.
","[{'version': 'v1', 'created': 'Thu, 3 Nov 2022 09:46:46 GMT'}]",2022-11-04,"[['Castillo', 'Carlos Rojas', '', 'Vrije Universiteit Brussel, Belgium'], ['Marra', 'Matteo', '', 'Vrije Universiteit Brussel, Belgium'], ['Bauwens', 'Jim', '', 'Vrije Universiteit\n  Brussel, Belgium'], ['Boix', 'Elisa Gonzalez', '', 'Vrije Universiteit Brussel, Belgium']]","['debugging tools', 'remote debugging', 'IoT systems', 'VM', 'WebAssembly']"
8281,1909.02724,Mohamed Wahib,"Peng Chen, Mohamed Wahib, Shinichiro Takizawa, Ryousei Takano, Satoshi
  Matsuoka","iFDK: A Scalable Framework for Instant High-resolution Image
  Reconstruction","ACM/IEEE Proceedings of the International Conference for High
  Performance Computing, Networking, Storage and Analysis (SC'19)",,10.1145/3295500.3356163,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computed Tomography (CT) is a widely used technology that requires
compute-intense algorithms for image reconstruction. We propose a novel
back-projection algorithm that reduces the projection computation cost to 1/6
of the standard algorithm. We also propose an efficient implementation that
takes advantage of the heterogeneity of GPU-accelerated systems by overlapping
the filtering and back-projection stages on CPUs and GPUs, respectively.
Finally, we propose a distributed framework for high-resolution image
reconstruction on state-of-the-art GPU-accelerated supercomputers. The
framework relies on an elaborate interleave of MPI collective communication
steps to achieve scalable communication. Evaluation on a single Tesla V100 GPU
demonstrates that our back-projection kernel performs up to 1.6x faster than
the standard FDK implementation. We also demonstrate the scalability and
instantaneous CT capability of the distributed framework by using up to 2,048
V100 GPUs to solve 4K and 8K problems within 30 seconds and 2 minutes,
respectively (including I/O).
","[{'version': 'v1', 'created': 'Fri, 6 Sep 2019 05:55:41 GMT'}]",2019-09-09,"[['Chen', 'Peng', ''], ['Wahib', 'Mohamed', ''], ['Takizawa', 'Shinichiro', ''], ['Takano', 'Ryousei', ''], ['Matsuoka', 'Satoshi', '']]","['Computed Tomography', 'GPU', 'Distributed', 'Heterogeneous Computing']"
8282,2107.02692,Armin Moin,"Armin Moin, Andrei Mituca, Moharram Challenger, Atta Badii and Stephan
  G\""unnemann","ML-Quadrat & DriotData: A Model-Driven Engineering Tool and a Low-Code
  Platform for Smart IoT Services",ICSE'22 Tool Demo,,10.1109/ICSE-Companion55297.2022.9793752,,cs.SE cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this paper, we present ML-Quadrat, an open-source research prototype that
is based on the Eclipse Modeling Framework (EMF) and the state of the art in
the literature of Model-Driven Software Engineering (MDSE) for smart
Cyber-Physical Systems (CPS) and the Internet of Things (IoT). Its envisioned
users are mostly software developers who might not have deep knowledge and
skills in the heterogeneous IoT platforms and the diverse Artificial
Intelligence (AI) technologies, specifically regarding Machine Learning (ML).
ML-Quadrat is released under the terms of the Apache 2.0 license on Github.
Additionally, we demonstrate an early tool prototype of DriotData, a web-based
Low-Code platform targeting citizen data scientists and citizen/end-user
software developers. DriotData exploits and adopts ML-Quadrat in the industry
by offering an extended version of it as a subscription-based service to
companies, mainly Small- and Medium-Sized Enterprises (SME). The current
preliminary version of DriotData has three web-based model editors: text-based,
tree-/form-based and diagram-based. The latter is designed for domain experts
in the problem or use case domains (namely the IoT vertical domains) who might
not have knowledge and skills in the field of IT. Finally, a short video
demonstrating the tools is available on YouTube: https://youtu.be/VAuz25w0a5k
","[{'version': 'v1', 'created': 'Tue, 6 Jul 2021 15:52:09 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Nov 2021 14:45:28 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Feb 2022 17:07:51 GMT'}, {'version': 'v4', 'created': 'Wed, 16 Feb 2022 13:21:36 GMT'}]",2022-07-12,"[['Moin', 'Armin', ''], ['Mituca', 'Andrei', ''], ['Challenger', 'Moharram', ''], ['Badii', 'Atta', ''], ['Günnemann', 'Stephan', '']]","['model-driven software engineering', 'low-code', 'domain-specific modeling', 'machine learning', 'iot']"
8283,1912.09127,Kwang Woo Nam,"Yongmi Lee, Kwang Woo Nam, Keun Ho Ryu",Fast Mining of Spatial Frequent Wordset from Social Database,"published in Spatial Information Research, vol.25, pp. 271-280","Spatial Information Research, 25(2), 271-280 (2017)",10.1007/s41324-017-0094-6,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose an algorithm that extracts spatial frequent
patterns to explain the relative characteristics of a specific location from
the available social data. This paper proposes a spatial social data model
which includes spatial social data, spatial support, spatial frequent patterns,
spatial partition, and spatial clustering; these concepts are used for
describing the exploration algorithm of spatial frequent patterns. With these
defined concepts as the foundation, an SFP-tree structure that maintains not
only the frequent words but also the frequent cells was proposed, and an
SFP-growth algorithm that explores the frequent patterns on the basis of this
SFP-tree was proposed.
","[{'version': 'v1', 'created': 'Thu, 19 Dec 2019 11:08:18 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Dec 2019 08:01:04 GMT'}]",2019-12-30,"[['Lee', 'Yongmi', ''], ['Nam', 'Kwang Woo', ''], ['Ryu', 'Keun Ho', '']]","['Spatial Frequent Wordset', 'Spatial Association Rule', 'Social Data Mining']"
8284,2301.05552,Gerard Guillamet Busquets,"G. Guillamet, A. Quintanas-Corominas, M. Rivero, G. Houzeuax, M.
  V\'azquez, A. Turon","Application of the partial Dirichlet-Neumann contact algorithm to
  simulate low-velocity impact events on composite structures","30 pages, 11 figures, journal",,10.1016/j.compositesa.2022.107424,,cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Impact simulations for damage resistance analysis are computationally
intensive due to contact algorithms and advanced damage models. Both methods,
which are the main ingredients in an impact event, require refined meshes at
the contact zone to obtain accurate predictions of the contact force and damage
onset and propagation through the material. This work presents the application
of the partial Dirichlet-Neumann contact algorithm to simulate low-velocity
impact problems on composite structures using High-Performance Computing. This
algorithm is devised for parallel finite element codes running on
supercomputers, and it is extended to explicit time integration schemes to
solve impact problems including damage. The proposed framework is validated
with a standard test for damage resistance on fiber-reinforced polymer matrix
composites. Moreover, the parallel performance of the proposed algorithm has
been evaluated in a mesh of 74M of elements running with 2400 processors.
","[{'version': 'v1', 'created': 'Wed, 11 Jan 2023 07:27:39 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Jan 2023 07:39:23 GMT'}]",2023-01-18,"[['Guillamet', 'G.', ''], ['Quintanas-Corominas', 'A.', ''], ['Rivero', 'M.', ''], ['Houzeuax', 'G.', ''], ['Vázquez', 'M.', ''], ['Turon', 'A.', '']]","['Contact mechanics', 'Damage modeling', 'Finite element analysis', 'High-Performance Computing']"
8285,2010.14051,Tipawan Silwattananusarn,"Tipawan Silwattananusarn, Wanida Kanarkard, Kulthida Tuamsuk","Enhanced Classification Accuracy for Cardiotocogram Data with Ensemble
  Feature Selection and Classifier Ensemble","16 pages, 11 tables, 7 figures",,10.4236/jcc.2016.44003,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  In this paper ensemble learning based feature selection and classifier
ensemble model is proposed to improve classification accuracy. The hypothesis
is that good feature sets contain features that are highly correlated with the
class from ensemble feature selection to SVM ensembles which can be achieved on
the performance of classification accuracy. The proposed approach consists of
two phases: (i) to select feature sets that are likely to be the support
vectors by applying ensemble based feature selection methods; and (ii) to
construct an SVM ensemble using the selected features. The proposed approach
was evaluated by experiments on Cardiotocography dataset. Four feature
selection techniques were used: (i) Correlation-based, (ii) Consistency-based,
(iii) ReliefF and (iv) Information Gain. Experimental results showed that using
the ensemble of Information Gain feature selection and Correlation-based
feature selection with SVM ensembles achieved higher classification accuracy
than both single SVM classifier and ensemble feature selection with SVM
classifier.
","[{'version': 'v1', 'created': 'Tue, 27 Oct 2020 05:11:24 GMT'}]",2020-10-28,"[['Silwattananusarn', 'Tipawan', ''], ['Kanarkard', 'Wanida', ''], ['Tuamsuk', 'Kulthida', '']]","['Classification', 'Feature Selection', 'Support Vector Machines', 'Ensemble Learning', 'Classification Accuracy']"
8286,1810.05564,Yosuke Fukuchi,"Yosuke Fukuchi, Masahiko Osawa, Hiroshi Yamakawa, Tatsuji Takahashi,
  Michita Imai",Bayesian Inference of Self-intention Attributed by Observer,,"6th International Conference on Human-Agent Interaction (HAI '18),
  2018",10.1145/3284432.3284438,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most of agents that learn policy for tasks with reinforcement learning (RL)
lack the ability to communicate with people, which makes human-agent
collaboration challenging. We believe that, in order for RL agents to
comprehend utterances from human colleagues, RL agents must infer the mental
states that people attribute to them because people sometimes infer an
interlocutor's mental states and communicate on the basis of this mental
inference. This paper proposes PublicSelf model, which is a model of a person
who infers how the person's own behavior appears to their colleagues. We
implemented the PublicSelf model for an RL agent in a simulated environment and
examined the inference of the model by comparing it with people's judgment. The
results showed that the agent's intention that people attributed to the agent's
movement was correctly inferred by the model in scenes where people could find
certain intentionality from the agent's behavior.
","[{'version': 'v1', 'created': 'Fri, 12 Oct 2018 15:04:14 GMT'}]",2018-10-15,"[['Fukuchi', 'Yosuke', ''], ['Osawa', 'Masahiko', ''], ['Yamakawa', 'Hiroshi', ''], ['Takahashi', 'Tatsuji', ''], ['Imai', 'Michita', '']]","['Reinforcement learning', 'Bayesian inference', 'Public self-awareness', 'Theory of mind', 'PublicSelf model', 'Human-agent interaction']"
8287,2201.04374,Nicolas Six,"Nicolas Six (CRI), Nicolas Herbaut (CRI), Camille Salinesi (CRI)","Blockchain software patterns for the design of decentralized
  applications: A systematic literature review",,"Blockchain: Research and Applications, 2022, pp.100061",10.1016/j.bcra.2022.100061,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A software pattern is a reusable solution to address a commonly occurring
problem within a given context when designing software. Using patterns is a
common practice for software architects to ensure software quality. Many
pattern collections have been proposed for a large number of application
domains. However, because of the technology's recentness, there are only a few
available collections with a lack of extensive testing in industrial blockchain
applications. It is also difficult for software architects to adequately apply
blockchain patterns in their applications, as it requires deep knowledge of
blockchain technology. Through a systematic literature review, this paper has
identified 120 unique blockchain-related patterns and proposes a pattern
taxonomy composed of multiple categories, built from the extracted pattern
collection. The purpose of this collection is to map, classify, and describe
all available patterns across the literature to help readers make adequate
decisions regarding blockchain pattern selection. This study also shows
potential applications of those patterns and identifies the relationships
between blockchain patterns and other non-blockchain software patterns.
","[{'version': 'v1', 'created': 'Wed, 12 Jan 2022 09:12:19 GMT'}]",2022-01-13,"[['Six', 'Nicolas', '', 'CRI'], ['Herbaut', 'Nicolas', '', 'CRI'], ['Salinesi', 'Camille', '', 'CRI']]","['blockchain', 'software patterns', 'software design', 'smart contracts']"
8288,2212.11085,Steffen Illium,"Steffen Illium, Thore Schillman, Robert M\""uller, Thomas Gabor and
  Claudia Linnhoff-Popien","Empirical Analysis of Limits for Memory Distance in Recurrent Neural
  Networks",,,10.5220/0010818500003116,,cs.LG cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Common to all different kinds of recurrent neural networks (RNNs) is the
intention to model relations between data points through time. When there is no
immediate relationship between subsequent data points (like when the data
points are generated at random, e.g.), we show that RNNs are still able to
remember a few data points back into the sequence by memorizing them by heart
using standard backpropagation. However, we also show that for classical RNNs,
LSTM and GRU networks the distance of data points between recurrent calls that
can be reproduced this way is highly limited (compared to even a loose
connection between data points) and subject to various constraints imposed by
the type and size of the RNN in question. This implies the existence of a hard
limit (way below the information-theoretic one) for the distance between
related data points within which RNNs are still able to recognize said
relation.
","[{'version': 'v1', 'created': 'Tue, 20 Dec 2022 08:20:48 GMT'}]",2022-12-22,"[['Illium', 'Steffen', ''], ['Schillman', 'Thore', ''], ['Müller', 'Robert', ''], ['Gabor', 'Thomas', ''], ['Linnhoff-Popien', 'Claudia', '']]","['Memory Distance', 'Memory Capacity', 'Recurrent Neural Networks', 'Machine Learning', 'Deep Learning']"
8289,1904.06851,Masashi Nakatani,"Shiori Honda, Yuri Ishikawa, Rei Konno, Eiko Imai, Natsumi Nomiyama,
  Kazuki Sakurada, Takuya Koumura, Hirohito M. Kondo, Shigeto Furukawa, Shinya
  Fujii, and Masashi Nakatani",Proximal binaural sound can induce subjective frisson,"21 pages, 3 figures, 3 tables, 3 supplemental figures, 3 supplemental
  tables",Front Psychol. 2020 Mar 3;11:316,10.3389/fpsyg.2020.00316.,,cs.SD cs.MM eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Auditory frisson is the experience of feeling of cold or shivering related to
sound in the absence of a physical cold stimulus. Multiple examples of
frisson-inducing sounds have been reported, but the mechanism of auditory
frisson remains elusive. Typical frisson-inducing sounds may contain a looming
effect, in which a sound appears to approach the listener's peripersonal space.
Previous studies on sound in peripersonal space have provided objective
measurements of sound-inducing effects, but few have investigated the
subjective experience of frisson-inducing sounds. Here we explored whether it
is possible to produce subjective feelings of frisson by moving a noise sound
(white noise, rolling beads noise, or frictional noise produced by rubbing a
plastic bag) stimulus around a listener's head. Our results demonstrated that
sound-induced frisson can be experienced stronger when auditory stimuli are
rotated around the head (binaural moving sounds) than the one without the
rotation (monaural static sounds), regardless of the source of the noise sound.
Pearson's correlation analysis showed that several acoustic features of
auditory stimuli, such as variance of interaural level difference (ILD),
loudness, and sharpness, were correlated with the magnitude of subjective
frisson. We had also observed that the subjective feelings of frisson by moving
a musical sound had increased comparing with a static musical sound.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2019 05:19:05 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Apr 2020 07:53:12 GMT'}]",2020-04-09,"[['Honda', 'Shiori', ''], ['Ishikawa', 'Yuri', ''], ['Konno', 'Rei', ''], ['Imai', 'Eiko', ''], ['Nomiyama', 'Natsumi', ''], ['Sakurada', 'Kazuki', ''], ['Koumura', 'Takuya', ''], ['Kondo', 'Hirohito M.', ''], ['Furukawa', 'Shigeto', ''], ['Fujii', 'Shinya', ''], ['Nakatani', 'Masashi', '']]","['Frisson', 'ASMR', 'Binaural', 'Looming effect', 'audio mixing']"
8290,1807.07646,Nikita Basov,"Nikita Basov (Centre for German and European Studies, St. Petersburg
  State University)","Socio-Material Network Analysis: A Mixed Method Study of Five European
  Artistic Collectives",,,10.1016/j.socnet.2018.02.003,,cs.CY stat.AP,http://creativecommons.org/licenses/by/4.0/,"  In this paper, I argue that we can better understand the relationship between
social structure and materiality by combining qualitative analysis of practices
in shared physical space with statistical analysis. Drawing on the two-mode
approach, I treat social and material structures together with the relationship
between them as a two-level socio-material network. In a mixed method study,
formalized ethnographic data on such networks in five European artistic
collectives are subjected to multilevel exponential random graph modelling. It
sheds light on how different types of interpersonal ties condition the
engagement of individuals with similar materiality over time.
","[{'version': 'v1', 'created': 'Wed, 18 Jul 2018 13:10:15 GMT'}]",2018-07-23,"[['Basov', 'Nikita', '', 'Centre for German and European Studies, St. Petersburg\n  State University']]","['Socio-material network', 'physical object', 'object usage', 'material structure', 'twomode approach', 'exponential random graph model', 'mixed method']"
8291,2010.00236,Ryoji Tanabe,Ryoji Tanabe and Hisao Ishibuchi,A Niching Indicator-Based Multi-modal Many-objective Optimizer,"This is an accepted version of a paper published in Swarm and
  Evolutionary Computation",,10.1016/j.swevo.2019.06.001,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-modal multi-objective optimization is to locate (almost) equivalent
Pareto optimal solutions as many as possible. Some evolutionary algorithms for
multi-modal multi-objective optimization have been proposed in the literature.
However, there is no efficient method for multi-modal many-objective
optimization, where the number of objectives is more than three. To address
this issue, this paper proposes a niching indicator-based multi-modal multi-
and many-objective optimization algorithm. In the proposed method, the fitness
calculation is performed among a child and its closest individuals in the
solution space to maintain the diversity. The performance of the proposed
method is evaluated on multi-modal multi-objective test problems with up to 15
objectives. Results show that the proposed method can handle a large number of
objectives and find a good approximation of multiple equivalent Pareto optimal
solutions. The results also show that the proposed method performs
significantly better than eight multi-objective evolutionary algorithms.
","[{'version': 'v1', 'created': 'Thu, 1 Oct 2020 07:45:46 GMT'}]",2020-10-02,"[['Tanabe', 'Ryoji', ''], ['Ishibuchi', 'Hisao', '']]","['Multi-modal multi-objective optimization', 'many-objectiveoptimization', 'indicator-based evolutionary algorithms', 'niching methods']"
8292,2207.11652,Liqiang Jing,"Teng Sun, Wenjie Wang, Liqiang Jing, Yiran Cui, Xuemeng Song, Liqiang
  Nie","Counterfactual Reasoning for Out-of-distribution Multimodal Sentiment
  Analysis",,,10.1145/3503161.3548211,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing studies on multimodal sentiment analysis heavily rely on textual
modality and unavoidably induce the spurious correlations between textual words
and sentiment labels. This greatly hinders the model generalization ability. To
address this problem, we define the task of out-of-distribution (OOD)
multimodal sentiment analysis. This task aims to estimate and mitigate the bad
effect of textual modality for strong OOD generalization. To this end, we
embrace causal inference, which inspects the causal relationships via a causal
graph. From the graph, we find that the spurious correlations are attributed to
the direct effect of textual modality on the model prediction while the
indirect one is more reliable by considering multimodal semantics. Inspired by
this, we devise a model-agnostic counterfactual framework for multimodal
sentiment analysis, which captures the direct effect of textual modality via an
extra text model and estimates the indirect one by a multimodal model. During
the inference, we first estimate the direct effect by the counterfactual
inference, and then subtract it from the total effect of all modalities to
obtain the indirect effect for reliable prediction. Extensive experiments show
the superior effectiveness and generalization ability of our proposed
framework.
","[{'version': 'v1', 'created': 'Sun, 24 Jul 2022 03:57:40 GMT'}]",2022-07-26,"[['Sun', 'Teng', ''], ['Wang', 'Wenjie', ''], ['Jing', 'Liqiang', ''], ['Cui', 'Yiran', ''], ['Song', 'Xuemeng', ''], ['Nie', 'Liqiang', '']]","['Multimodal Sentiment Analysis', 'Counterfactual Reasoning', 'Out-ofdistribution Generalization']"
8293,2006.03379,Nurul Halimatul Asmak Ismail,"Nurul Halimatul Asmak Ismail, Samer A. B. Awwad, Rosilah Hassan","6RLR-ABC: 6LoWPAN Routing Protocol With Local Repair Using Bio Inspired
  Artificial Bee Colony","19 pages, 12 figures",,10.5121/ijcnc.2020.12302,,cs.NI cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, Micro-Electro-Mechanical System (MEMS) has successfully
enabled the development of IPv6 over Low power Wireless Personal Area Network
(6LoWPAN). This network is equipped with low-cost, low-power, lightweight and
varied functions devices. These devices are capable of amassing, storing,
processing environmental information and conversing with neighbouring sensors.
These requisites pose a new and interesting challenge for the development of
IEEE 802.15.4 together with routing protocol. In this work, 6LoWPAN Routing
Protocol with Local Repair Using Bio Inspired Artificial Bee Colony (6RLR-ABC)
has been introduced. This protocol supports connection establishment between
nodes in an energy-efficient manner while maintaining high packet delivery
ratio and throughput and minimizing average end-to-end delay. This protocol has
been evaluated based on increasing generated traffic. The performance of the
designed 6RLR-ABC routing protocol has been evaluated compared to 6LoWPAN
Ad-hoc On-Demand Distance Vector (LOAD) routing protocol. LOAD protocol has
been chosen since it is the most relevant existed 6LoWPANrouting protocol. The
simulation results show that the introduced 6RLR-ABC protocol achieves lower
packet average end-to-end delay and lower energy consumption compared to LOAD
protocol.Additionally,the packet delivery ratio of the designed protocol is
much higher than LOAD protocol. The proposed 6RLR-ABC achieved about 39% higher
packet delivery ratio and about 54.8% higher throughput while simultaneously
offering lower average end-to-end delay and lower average energy consumption
than LOAD protocol.
","[{'version': 'v1', 'created': 'Fri, 5 Jun 2020 11:27:44 GMT'}]",2020-06-08,"[['Ismail', 'Nurul Halimatul Asmak', ''], ['Awwad', 'Samer A. B.', ''], ['Hassan', 'Rosilah', '']]","['6LoWPAN', 'routing', 'local repair', '6RLR-ABC', 'LR-ABC mechanism;  1']"
8294,2206.04417,Leila Tavakoli,"Leila Tavakoli, Johanne R. Trippas, Hamed Zamani, Falk Scholer, Mark
  Sanderson",MIMICS-Duo: Offline & Online Evaluation of Search Clarification,11 pages,,10.1145/3477495.3531750,,cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Asking clarification questions is an active area of research; however,
resources for training and evaluating search clarification methods are not
sufficient. To address this issue, we describe MIMICS-Duo, a new freely
available dataset of 306 search queries with multiple clarifications (a total
of 1,034 query-clarification pairs). MIMICS-Duo contains fine-grained
annotations on clarification questions and their candidate answers and enhances
the existing MIMICS datasets by enabling multi-dimensional evaluation of search
clarification methods, including online and offline evaluation. We conduct
extensive analysis to demonstrate the relationship between offline and online
search clarification datasets and outline several research directions enabled
by MIMICS-Duo. We believe that this resource will help researchers better
understand clarification in search.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2022 11:10:22 GMT'}]",2022-06-10,"[['Tavakoli', 'Leila', ''], ['Trippas', 'Johanne R.', ''], ['Zamani', 'Hamed', ''], ['Scholer', 'Falk', ''], ['Sanderson', 'Mark', '']]","['Search\xa0clarification\xa0dataset', 'Online/Offline\xa0evaluation', 'Clarification\xa0selection']"
8295,2109.11386,Lorenzo Valerio,"Lorenzo Valerio, Marco Conti, Andrea Passarella","Energy efficient distributed analytics at the edge of the network for
  IoT environments",,"Pervasive and Mobile Computing, Volume 51, December 2018, Pages
  27-42",10.1016/j.pmcj.2018.09.004,,cs.DC cs.LG cs.NI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Due to the pervasive diffusion of personal mobile and IoT devices, many
""smart environments"" (e.g., smart cities and smart factories) will be,
generators of huge amounts of data. Currently, analysis of this data is
typically achieved through centralised cloud-based services. However, according
to many studies, this approach may present significant issues from the
standpoint of data ownership, as well as wireless network capacity. In this
paper, we exploit the fog computing paradigm to move computation close to where
data is produced. We exploit a well-known distributed machine learning
framework (Hypothesis Transfer Learning), and perform data analytics on mobile
nodes passing by IoT devices, in addition to fog gateways at the edge of the
network infrastructure. We analyse the performance of different configurations
of the distributed learning framework, in terms of (i) accuracy obtained in the
learning task and (ii) energy spent to send data between the involved nodes.
Specifically, we consider reference wireless technologies for communication
between the different types of nodes we consider, e.g. LTE, Nb-IoT, 802.15.4,
802.11, etc. Our results show that collecting data through the mobile nodes and
executing the distributed analytics using short-range communication
technologies, such as 802.15.4 and 802.11, allows to strongly reduce the energy
consumption of the system up to $94\%$ with a loss in accuracy w.r.t. a
centralised cloud solution up to $2\%$.
","[{'version': 'v1', 'created': 'Thu, 23 Sep 2021 14:07:33 GMT'}]",2021-09-24,"[['Valerio', 'Lorenzo', ''], ['Conti', 'Marco', ''], ['Passarella', 'Andrea', '']]","['Iot', 'big data', 'smart cities', 'distributed learning', 'communications efficiency']"
8296,2206.06255,Hugo Tessier,"Hugo Tessier, Vincent Gripon, Mathieu L\'eonardon, Matthieu Arzel,
  David Bertrand, Thomas Hannagan","Energy Consumption Analysis of pruned Semantic Segmentation Networks on
  an Embedded GPU","10 pages, 3 figures, submitted to SysInt 2022",,10.1007/978-3-031-16281-7_52,,cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Deep neural networks are the state of the art in many computer vision tasks.
Their deployment in the context of autonomous vehicles is of particular
interest, since their limitations in terms of energy consumption prohibit the
use of very large networks, that typically reach the best performance. A common
method to reduce the complexity of these architectures, without sacrificing
accuracy, is to rely on pruning, in which the least important portions are
eliminated. There is a large literature on the subject, but interestingly few
works have measured the actual impact of pruning on energy. In this work, we
are interested in measuring it in the specific context of semantic segmentation
for autonomous driving, using the Cityscapes dataset. To this end, we analyze
the impact of recently proposed structured pruning methods when trained
architectures are deployed on a Jetson Xavier embedded GPU.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2022 15:36:39 GMT'}]",2022-12-13,"[['Tessier', 'Hugo', ''], ['Gripon', 'Vincent', ''], ['Léonardon', 'Mathieu', ''], ['Arzel', 'Matthieu', ''], ['Bertrand', 'David', ''], ['Hannagan', 'Thomas', '']]","['Deep Learning', 'Compression', 'Pruning', 'Hardware Implementations', 'Energy']"
8297,1908.10404,Zijia Zhong,Zijia Zhong and Joyoung Lee,"The Effectiveness of Managed Lane Strategies for the Near-term
  Deployment of Cooperative Adaptive Cruise Control","22 pages, 15 figures",Transportation Research Part A: Policy and Practice 2019,10.1016/j.tra.2019.08.015,,cs.MA eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traffic simulation is a cost-effective way to test the deployment of
Cooperative Adaptive Cruise Control (CACC) vehicles in a large-scale
transportation network. By using a previously developed microscopic simulation
testbed, this paper examines the impacts of four managed lane strategies for
the near-term deployment of CACC vehicles under mixed traffic conditions.
Network-wide performance measures are investigated from the perspectives of
mobility, safety, equity, and environmental impacts. In addition, the platoon
formation performance of CACC vehicles is evaluated with platoon-orientated
measures, such as the percentage of platooned CACC vehicles, average platoon
depth, and vehicle-hour-platooned that is proposed in this paper under the
imperfect DSRC communication environment. Moreover, managed lane score matrices
are developed to incorporate heterogeneous categories of performance measures,
aiming to provide a more comprehensive picture for stakeholders. The results
show that mixing CACC traffic along with non-CACC traffic across all travel
lanes is an acceptable option when the market penetration (MP) is lower than
30% for roadways where a managed lane is absent. Providing CACC with priority
access to an existing managed lane, if available, is also a good strategy for
improving the overall traffic performance when the MP is lower than 40%. When
the MP reaches above 40%, a dedicated lane for CACC vehicles is recommended, as
it provides greater opportunity for CACC vehicles to form platoons. The
facilitation of homogeneous CACC traffic flow could make further improvements
possible in the future.
","[{'version': 'v1', 'created': 'Tue, 27 Aug 2019 18:38:34 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Sep 2019 03:43:47 GMT'}]",2019-09-04,"[['Zhong', 'Zijia', ''], ['Lee', 'Joyoung', '']]","['Managed Lane', 'Cooperative Adaptive Cruise Control', 'Microscopic TrafficSimulation', 'Platoon Formation', 'Mixed Traffic Conditions', 'Imperfect DSRC Communication']"
8298,2206.10693,Nicolas Gillis,"Pierre De Handschutter, Nicolas Gillis",A consistent and flexible framework for deep matrix factorizations,"28 pages, few minor modifications. Accepted in Pattern Recognition","Pattern Recognition 134, 109102, 2023",10.1016/j.patcog.2022.109102,,cs.LG cs.NA eess.SP math.NA stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep matrix factorizations (deep MFs) are recent unsupervised data mining
techniques inspired by constrained low-rank approximations. They aim to extract
complex hierarchies of features within high-dimensional datasets. Most of the
loss functions proposed in the literature to evaluate the quality of deep MF
models and the underlying optimization frameworks are not consistent because
different losses are used at different layers. In this paper, we introduce two
meaningful loss functions for deep MF and present a generic framework to solve
the corresponding optimization problems. We illustrate the effectiveness of
this approach through the integration of various constraints and
regularizations, such as sparsity, nonnegativity and minimum-volume. The models
are successfully applied on both synthetic and real data, namely for
hyperspectral unmixing and extraction of facial features.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2022 19:20:35 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Oct 2022 11:22:59 GMT'}]",2023-01-26,"[['De Handschutter', 'Pierre', ''], ['Gillis', 'Nicolas', '']]","['Deep matrix factorization', 'loss functions', 'constrained optimization', 'first-order methods', 'hyperspectral unmixing']"
8299,1809.04296,Joeri Frederik,"Joeri Frederik, Lars Kr\""oger, Gert G\""ulker and Jan-Willem van
  Wingerden","Data-driven repetitive control: Wind tunnel experiments under turbulent
  conditions","14 pages, 16 figures","Frederik, J., Kr\""oger, L., G\""ulker, G., & van Wingerden, J. W.
  (2018). Data-driven repetitive control: Wind tunnel experiments under
  turbulent conditions. Control Engineering Practice, 80, 105-115",10.1016/j.conengprac.2018.08.011,,cs.SY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  A commonly applied method to reduce the cost of wind energy, is alleviating
the periodic loads on turbine blades using Individual Pitch Control (IPC). In
this paper, a data-driven IPC methodology called Subspace Predictive Repetitive
Control (SPRC) is employed. The effectiveness of SPRC will be demonstrated on a
scaled 2-bladed wind turbine. An open-jet wind tunnel with an innovative active
grid is employed to generate reproducible turbulent wind conditions. A
significant load reduction with limited actuator duty is achieved even under
these high turbulent conditions. Furthermore, it will be demonstrated that SPRC
is able to adapt to changing operating conditions.
","[{'version': 'v1', 'created': 'Wed, 12 Sep 2018 07:57:23 GMT'}]",2018-09-13,"[['Frederik', 'Joeri', ''], ['Kröger', 'Lars', ''], ['Gülker', 'Gert', ''], ['van Wingerden', 'Jan-Willem', '']]","['data-driven control', 'individual pitch control', 'load alleviation', 'repetitive control', 'subspace identification', 'wind energy', 'active grid', 'wind tunnel experiments']"
8300,2205.00663,Debopriyo Banerjee,"Debopriyo Banerjee, Harsh Maheshwari, Lucky Dhakad1, Arnab
  Bhattacharya1, Niloy Ganguly, Muthusamy Chelliah and Suyash Agarwal1",An Application to Generate Style Guided Compatible Outfit,,,10.1145/3493700.3493737,,cs.IR cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Fashion recommendation has witnessed a phenomenal growth of research,
particularly in the domains of shop-the-look, contextaware outfit creation,
personalizing outfit creation etc. Majority of the work in this area focuses on
better understanding of the notion of complimentary relationship between
lifestyle items. Quite recently, some works have realised that style plays a
vital role in fashion, especially in the understanding of compatibility
learning and outfit creation. In this paper, we would like to present the
end-to-end design of a methodology in which we aim to generate outfits guided
by styles or themes using a novel style encoder network. We present an
extensive analysis of different aspects of our method through various
experiments. We also provide a demonstration api to showcase the ability of our
work in generating outfits based on an anchor item and styles.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 05:45:05 GMT'}]",2022-05-03,"[['Banerjee', 'Debopriyo', ''], ['Maheshwari', 'Harsh', ''], ['Dhakad1', 'Lucky', ''], ['Bhattacharya1', 'Arnab', ''], ['Ganguly', 'Niloy', ''], ['Chelliah', 'Muthusamy', ''], ['Agarwal1', 'Suyash', '']]","['complete the look', 'neural networks', 'outfit compatibility', 'style']"
8301,1709.10242,Liu Feng,"Feng Liu, Yong Shi, Ying Liu",Intelligence Quotient and Intelligence Grade of Artificial Intelligence,,"Annals of Data Science, June 2017, Volume 4, Issue 2, pp 179-191",10.1007/s40745-017-0109-0,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although artificial intelligence is currently one of the most interesting
areas in scientific research, the potential threats posed by emerging AI
systems remain a source of persistent controversy. To address the issue of AI
threat, this study proposes a standard intelligence model that unifies AI and
human characteristics in terms of four aspects of knowledge, i.e., input,
output, mastery, and creation. Using this model, we observe three challenges,
namely, expanding of the von Neumann architecture; testing and ranking the
intelligence quotient of naturally and artificially intelligent systems,
including humans, Google, Bing, Baidu, and Siri; and finally, the dividing of
artificially intelligent systems into seven grades from robots to Google Brain.
Based on this, we conclude that AlphaGo belongs to the third grade.
","[{'version': 'v1', 'created': 'Fri, 29 Sep 2017 05:43:39 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Oct 2017 16:33:07 GMT'}]",2017-10-05,"[['Liu', 'Feng', ''], ['Shi', 'Yong', ''], ['Liu', 'Ying', '']]","['Standard intelligence model', 'Intelligence quotient of artificial intelligence', 'Intelligence grades']"
8302,2108.13322,Luigi Libero Lucio Starace,"Anna Corazza, Sergio Di Martino, Adriano Peron and Luigi Libero Lucio
  Starace","Web Application Testing: Using Tree Kernels to Detect Near-duplicate
  States in Automated Model Inference","6 pages, 3 figures, accepted for presentation at the 15th ACM/IEEE
  International Symposium on Empirical Software Engineering and Measurement
  (ESEM 2021)",,10.1145/3475716.3484187,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In the context of End-to-End testing of web applications, automated
exploration techniques (a.k.a. crawling) are widely used to infer state-based
models of the site under test. These models, in which states represent features
of the web application and transitions represent reachability relationships,
can be used for several model-based testing tasks, such as test case
generation. However, current exploration techniques often lead to models
containing many near-duplicate states, i.e., states representing slightly
different pages that are in fact instances of the same feature. This has a
negative impact on the subsequent model-based testing tasks, adversely
affecting, for example, size, running time, and achieved coverage of generated
test suites. As a web page can be naturally represented by its tree-structured
DOM representation, we propose a novel near-duplicate detection technique to
improve the model inference of web applications, based on Tree Kernel (TK)
functions. TKs are a class of functions that compute similarity between
tree-structured objects, largely investigated and successfully applied in the
Natural Language Processing domain. To evaluate the capability of the proposed
approach in detecting near-duplicate web pages, we conducted preliminary
classification experiments on a freely-available massive dataset of about 100k
manually annotated web page pairs. We compared the classification performance
of the proposed approach with other state-of-the-art near-duplicate detection
techniques. Preliminary results show that our approach performs better than
state-of-the-art techniques in the near-duplicate detection classification
task. These promising results show that TKs can be applied to near-duplicate
detection in the context of web application model inference, and motivate
further research in this direction.
","[{'version': 'v1', 'created': 'Mon, 30 Aug 2021 15:39:06 GMT'}]",2021-08-31,"[['Corazza', 'Anna', ''], ['Di Martino', 'Sergio', ''], ['Peron', 'Adriano', ''], ['Starace', 'Luigi Libero Lucio', '']]","['Near-duplicate detection', 'Model inference', 'Web Application Testing', 'Tree kernels', 'Reverse engineering', 'Model-based testing']"
8303,2103.11024,Andres Karjus,"Andres Karjus, Richard A. Blythe, Simon Kirby, Tianyu Wang, Kenny
  Smith","Conceptual similarity and communicative need shape colexification: an
  experimental study",,Cognitive Science (2021) 45 e1303,10.1111/cogs.13035,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Colexification refers to the phenomenon of multiple meanings sharing one word
in a language. Cross-linguistic lexification patterns have been shown to be
largely predictable, as similar concepts are often colexified. We test a recent
claim that, beyond this general tendency, communicative needs play an important
role in shaping colexification patterns. We approach this question by means of
a series of human experiments, using an artificial language communication game
paradigm. Our results across four experiments match the previous
cross-linguistic findings: all other things being equal, speakers do prefer to
colexify similar concepts. However, we also find evidence supporting the
communicative need hypothesis: when faced with a frequent need to distinguish
similar pairs of meanings, speakers adjust their colexification preferences to
maintain communicative efficiency, and avoid colexifying those similar meanings
which need to be distinguished in communication. This research provides further
evidence to support the argument that languages are shaped by the needs and
preferences of their speakers.
","[{'version': 'v1', 'created': 'Fri, 19 Mar 2021 21:18:16 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Sep 2021 18:59:56 GMT'}]",2021-09-28,"[['Karjus', 'Andres', ''], ['Blythe', 'Richard A.', ''], ['Kirby', 'Simon', ''], ['Wang', 'Tianyu', ''], ['Smith', 'Kenny', '']]","['colexification', 'communicative need', 'experimental', 'artificial language', 'complexity', 'cognitive cost', 'expressivity', 'communicative cost']"
8304,2101.09461,Gennaro Vessio Dr.,"Moises Diaz, Momina Moetesum, Imran Siddiqi, Gennaro Vessio","Sequence-based Dynamic Handwriting Analysis for Parkinson's Disease
  Detection with One-dimensional Convolutions and BiGRUs",,"Expert Systems with Applications, Volume 168, 15 April 2021,
  114405",10.1016/j.eswa.2020.114405,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Parkinson's disease (PD) is commonly characterized by several motor symptoms,
such as bradykinesia, akinesia, rigidity, and tremor. The analysis of patients'
fine motor control, particularly handwriting, is a powerful tool to support PD
assessment. Over the years, various dynamic attributes of handwriting, such as
pen pressure, stroke speed, in-air time, etc., which can be captured with the
help of online handwriting acquisition tools, have been evaluated for the
identification of PD. Motion events, and their associated spatio-temporal
properties captured in online handwriting, enable effective classification of
PD patients through the identification of unique sequential patterns. This
paper proposes a novel classification model based on one-dimensional
convolutions and Bidirectional Gated Recurrent Units (BiGRUs) to assess the
potential of sequential information of handwriting in identifying Parkinsonian
symptoms. One-dimensional convolutions are applied to raw sequences as well as
derived features; the resulting sequences are then fed to BiGRU layers to
achieve the final classification. The proposed method outperformed
state-of-the-art approaches on the PaHaW dataset and achieved competitive
results on the NewHandPD dataset.
","[{'version': 'v1', 'created': 'Sat, 23 Jan 2021 09:25:13 GMT'}]",2021-01-26,"[['Diaz', 'Moises', ''], ['Moetesum', 'Momina', ''], ['Siddiqi', 'Imran', ''], ['Vessio', 'Gennaro', '']]","['Parkinson’s disease', 'Dynamic handwriting analysis', 'Recurrent']"
8305,1910.03182,Kerry A Nice,"Kerry A. Nice, Jasper S. Wijnands, Ariane Middel, Jingcheng Wang,
  Yiming Qiu, Nan Zhao, Jason Thompson, Gideon D.P.A. Aschwanden, Haifeng Zhao,
  Mark Stevenson","Sky pixel detection in outdoor imagery using an adaptive algorithm and
  machine learning","This revision accepted in Urban Climate. 17 pages, 12 figures",,10.1016/j.uclim.2019.100572,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer vision techniques enable automated detection of sky pixels in
outdoor imagery. In urban climate, sky detection is an important first step in
gathering information about urban morphology and sky view factors. However,
obtaining accurate results remains challenging and becomes even more complex
using imagery captured under a variety of lighting and weather conditions.
  To address this problem, we present a new sky pixel detection system
demonstrated to produce accurate results using a wide range of outdoor imagery
types. Images are processed using a selection of mean-shift segmentation,
K-means clustering, and Sobel filters to mark sky pixels in the scene. The
algorithm for a specific image is chosen by a convolutional neural network,
trained with 25,000 images from the Skyfinder data set, reaching 82% accuracy
for the top three classes. This selection step allows the sky marking to follow
an adaptive process and to use different techniques and parameters to best suit
a particular image. An evaluation of fourteen different techniques and
parameter sets shows that no single technique can perform with high accuracy
across varied Skyfinder and Google Street View data sets. However, by using our
adaptive process, large increases in accuracy are observed. The resulting
system is shown to perform better than other published techniques.
","[{'version': 'v1', 'created': 'Tue, 8 Oct 2019 02:45:38 GMT'}, {'version': 'v2', 'created': 'Mon, 9 Dec 2019 23:01:34 GMT'}]",2019-12-30,"[['Nice', 'Kerry A.', ''], ['Wijnands', 'Jasper S.', ''], ['Middel', 'Ariane', ''], ['Wang', 'Jingcheng', ''], ['Qiu', 'Yiming', ''], ['Zhao', 'Nan', ''], ['Thompson', 'Jason', ''], ['Aschwanden', 'Gideon D. P. A.', ''], ['Zhao', 'Haifeng', ''], ['Stevenson', 'Mark', '']]","['sky view factor', 'Google Street View', 'machine learning', 'WUDAPT', 'sky pixel detection', 'Skyfinder']"
8306,2008.02047,Alexander Mehler,"Alexander Mehler and Wahed Hemati and Pascal Welke and Maxim Konca and
  Tolga Uslu","Multiple Texts as a Limiting Factor in Online Learning: Quantifying
  (Dis-)similarities of Knowledge Networks across Languages","40 pages, 13 figures, 5 tables",,10.3389/feduc.2020.562670,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We test the hypothesis that the extent to which one obtains information on a
given topic through Wikipedia depends on the language in which it is consulted.
Controlling the size factor, we investigate this hypothesis for a number of 25
subject areas. Since Wikipedia is a central part of the web-based information
landscape, this indicates a language-related, linguistic bias. The article
therefore deals with the question of whether Wikipedia exhibits this kind of
linguistic relativity or not. From the perspective of educational science, the
article develops a computational model of the information landscape from which
multiple texts are drawn as typical input of web-based reading. For this
purpose, it develops a hybrid model of intra- and intertextual similarity of
different parts of the information landscape and tests this model on the
example of 35 languages and corresponding Wikipedias. In this way the article
builds a bridge between reading research, educational science, Wikipedia
research and computational linguistics.
","[{'version': 'v1', 'created': 'Wed, 5 Aug 2020 11:11:55 GMT'}]",2021-06-01,"[['Mehler', 'Alexander', ''], ['Hemati', 'Wahed', ''], ['Welke', 'Pascal', ''], ['Konca', 'Maxim', ''], ['Uslu', 'Tolga', '']]","['Multiple Texts', 'Information Landscape', 'Knowledge Graphs', 'Intratextual Similarity', 'Intertextual Similarity', 'Three-level Topic']"
8307,2112.03685,Alex Alcocer,"Moustafa Elkolali, Ahmed Al-Tawil, Lennard Much, Ryan Schrader,
  Olivier Masset, Marina Sayols, Andrew Jenkins, Sara Alonso, Alfredo Carella,
  Alex Alcocer",A low-cost wave-solar powered Unmanned Surface Vehicle,,IEEE OCEANS 2020,10.1109/IEEECONF38699.2020.9389152,,cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper presents a prototype of a low-cost Unmanned Surface Vehicle (USV)
that is operated by wave and solar energy which can be used to minimize the
cost of ocean data collection. The current prototype is a compact USV, with a
length of 1.2m that can be deployed and recovered by two persons. The design
includes an electrically operated winch that can be used to retract and lower
the underwater unit. Several elements of the design make use of additive
manufacturing and inexpensive materials. The vehicle can be controlled using
radio frequency (RF) and a satellite communication, through a custom developed
web application. Both the surface and underwater units were optimized with
regard to drag, lift, weight, and price by using recommendation of previous
research work and advanced materials. The USV could be used in water condition
monitoring by measuring several parameters, such as dissolved oxygen, salinity,
temperature, and pH.
","[{'version': 'v1', 'created': 'Tue, 7 Dec 2021 13:35:40 GMT'}]",2021-12-08,"[['Elkolali', 'Moustafa', ''], ['Al-Tawil', 'Ahmed', ''], ['Much', 'Lennard', ''], ['Schrader', 'Ryan', ''], ['Masset', 'Olivier', ''], ['Sayols', 'Marina', ''], ['Jenkins', 'Andrew', ''], ['Alonso', 'Sara', ''], ['Carella', 'Alfredo', ''], ['Alcocer', 'Alex', '']]","['Unmanned Surface Vehicle', 'Wave Energy', 'Solar Energy', 'Marine Vehicles', 'Ocean Observing']"
8308,1910.00303,Matthias Niedermaier,"Felix Sauer and Matthias Niedermaier and Susanne Kie{\ss}ling and
  Dominik Merli",LICSTER -- A Low-cost ICS Security Testbed for Education and Research,,"6th International Symposium for ICS & SCADA Cyber Security
  Research 2019 (ICS-CSR 2019)",10.14236/ewic/icscsr19.1,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Unnoticed by most people, Industrial Control Systems (ICSs) control entire
productions and critical infrastructures such as water distribution, smart grid
and automotive manufacturing. Due to the ongoing digitalization, these systems
are becoming more and more connected in order to enable remote control and
monitoring. However, this shift bears significant risks, namely a larger attack
surface, which can be exploited by attackers. In order to make these systems
more secure, it takes research, which is, however, difficult to conduct on
productive systems, since these often have to operate twenty-four-seven.
Testbeds are mostly very expensive or based on simulation with no real-world
physical process. In this paper, we introduce LICSTER, an open-source low-cost
ICS testbed, which enables researchers and students to get hands-on experience
with industrial security for about 500 Euro. We provide all necessary material
to quickly start ICS hacking, with the focus on low-cost and open-source for
education and research.
","[{'version': 'v1', 'created': 'Tue, 1 Oct 2019 11:05:36 GMT'}]",2019-10-02,"[['Sauer', 'Felix', ''], ['Niedermaier', 'Matthias', ''], ['Kießling', 'Susanne', ''], ['Merli', 'Dominik', '']]","['Industrial Internet of Things', 'Testbed', 'Open-source', 'Low-cost', 'Security', 'Education', 'Research']"
8309,2008.01613,Haotian Li,"Haotian Li, Huan Wei, Yong Wang, Yangqiu Song, Huamin Qu","Peer-inspired Student Performance Prediction in Interactive Online
  Question Pools with Graph Neural Network","8 pages, 8 figures. Accepted at CIKM 2020",,10.1145/3340531.3412733,,cs.LG cs.HC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Student performance prediction is critical to online education. It can
benefit many downstream tasks on online learning platforms, such as estimating
dropout rates, facilitating strategic intervention, and enabling adaptive
online learning. Interactive online question pools provide students with
interesting interactive questions to practice their knowledge in online
education. However, little research has been done on student performance
prediction in interactive online question pools. Existing work on student
performance prediction targets at online learning platforms with predefined
course curriculum and accurate knowledge labels like MOOC platforms, but they
are not able to fully model knowledge evolution of students in interactive
online question pools. In this paper, we propose a novel approach using Graph
Neural Networks (GNNs) to achieve better student performance prediction in
interactive online question pools. Specifically, we model the relationship
between students and questions using student interactions to construct the
student-interaction-question network and further present a new GNN model,
called R^2GCN, which intrinsically works for the heterogeneous networks, to
achieve generalizable student performance prediction in interactive online
question pools. We evaluate the effectiveness of our approach on a real-world
dataset consisting of 104,113 mouse trajectories generated in the
problem-solving process of over 4000 students on 1631 questions. The experiment
results show that our approach can achieve a much higher accuracy of student
performance prediction than both traditional machine learning approaches and
GNN models.
","[{'version': 'v1', 'created': 'Tue, 4 Aug 2020 14:55:32 GMT'}, {'version': 'v2', 'created': 'Sat, 15 Aug 2020 07:47:01 GMT'}]",2020-08-18,"[['Li', 'Haotian', ''], ['Wei', 'Huan', ''], ['Wang', 'Yong', ''], ['Song', 'Yangqiu', ''], ['Qu', 'Huamin', '']]","['Student performance prediction', 'graph neural networks', 'onlinequestion pools']"
8310,2208.13949,Ivan Lee,"Namrata Nath, Sang-Heon Lee, Ivan Lee",NEAR: Named Entity and Attribute Recognition of clinical concepts,"11 pages, 7 figures, 9 tables",Journal of Biomedical Informatics 130 (2022): 104092,10.1016/j.jbi.2022.104092,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Named Entity Recognition (NER) or the extraction of concepts from clinical
text is the task of identifying entities in text and slotting them into
categories such as problems, treatments, tests, clinical departments,
occurrences (such as admission and discharge) and others. NER forms a critical
component of processing and leveraging unstructured data from Electronic Health
Records (EHR). While identifying the spans and categories of concepts is itself
a challenging task, these entities could also have attributes such as negation
that pivot their meanings implied to the consumers of the named entities. There
has been little research dedicated to identifying the entities and their
qualifying attributes together. This research hopes to contribute to the area
of detecting entities and their corresponding attributes by modelling the NER
task as a supervised, multi-label tagging problem with each of the attributes
assigned tagging sequence labels. In this paper, we propose 3 architectures to
achieve this multi-label entity tagging: BiLSTM n-CRF, BiLSTM-CRF-Smax-TF and
BiLSTM n-CRF-TF. We evaluate these methods on the 2010 i2b2/VA and the i2b2
2012 shared task datasets. Our different models obtain best NER F1 scores of 0.
894 and 0.808 on the i2b2 2010/VA and i2b2 2012 respectively. The highest span
based micro-averaged F1 polarity scores obtained were 0.832 and 0.836 on the
i2b2 2010/VA and i2b2 2012 datasets respectively, and the highest
macro-averaged F1 polarity scores obtained were 0.924 and 0.888 respectively.
The modality studies conducted on i2b2 2012 dataset revealed high scores of
0.818 and 0.501 for span based micro-averaged F1 and macro-averaged F1
respectively.
","[{'version': 'v1', 'created': 'Tue, 30 Aug 2022 01:46:11 GMT'}]",2022-08-31,"[['Nath', 'Namrata', ''], ['Lee', 'Sang-Heon', ''], ['Lee', 'Ivan', '']]","['Named Entity Recognition (NER)', 'Polarity/Modality detection', 'Negation', 'Clinical']"
8311,2105.12991,Taisuke Kobayashi,Taisuke Kobayashi,"Optimistic Reinforcement Learning by Forward Kullback-Leibler Divergence
  Optimization","14 pages, 6 figures","Neural Networks, 2022",10.1016/j.neunet.2022.04.021,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses a new interpretation of the traditional optimization
method in reinforcement learning (RL) as optimization problems using reverse
Kullback-Leibler (KL) divergence, and derives a new optimization method using
forward KL divergence, instead of reverse KL divergence in the optimization
problems. Although RL originally aims to maximize return indirectly through
optimization of policy, the recent work by Levine has proposed a different
derivation process with explicit consideration of optimality as stochastic
variable. This paper follows this concept and formulates the traditional
learning laws for both value function and policy as the optimization problems
with reverse KL divergence including optimality. Focusing on the asymmetry of
KL divergence, the new optimization problems with forward KL divergence are
derived. Remarkably, such new optimization problems can be regarded as
optimistic RL. That optimism is intuitively specified by a hyperparameter
converted from an uncertainty parameter. In addition, it can be enhanced when
it is integrated with prioritized experience replay and eligibility traces,
both of which accelerate learning. The effects of this expected optimism was
investigated through learning tendencies on numerical simulations using
Pybullet. As a result, moderate optimism accelerated learning and yielded
higher rewards. In a realistic robotic simulation, the proposed method with the
moderate optimism outperformed one of the state-of-the-art RL method.
","[{'version': 'v1', 'created': 'Thu, 27 May 2021 08:24:51 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Apr 2022 03:17:04 GMT'}]",2022-04-25,"[['Kobayashi', 'Taisuke', '']]","['Reinforcement learning', 'Control as probabilistic inference', 'Kullback-Leibler divergence', 'Optimistic learning']"
8312,2111.05605,Marieke van Erp,"Stijn Schouten, Victor de Boer, Lodewijk Petram, Marieke van Erp","The Wind in Our Sails: Developing a Reusable and Maintainable Dutch
  Maritime History Knowledge Graph","Accepted to K-CAP'21, December 2-3, 2021, Virtual Event, USA",,10.1145/3460210.3493548,,cs.DL cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Digital sources are more prevalent than ever but effectively using them can
be challenging. One core challenge is that digitized sources are often
distributed, thus forcing researchers to spend time collecting, interpreting,
and aligning different sources. A knowledge graph can accelerate research by
providing a single connected source of truth that humans and machines can
query. During two design-test cycles, we convert four data sets from the
historical maritime domain into a knowledge graph. The focus during these
cycles is on creating a sustainable and usable approach that can be adopted in
other linked data conversion efforts. Furthermore, our knowledge graph is
available for maritime historians and other interested users to investigate the
daily business of the Dutch East India Company through a unified portal.
","[{'version': 'v1', 'created': 'Wed, 10 Nov 2021 09:54:01 GMT'}]",2021-11-11,"[['Schouten', 'Stijn', ''], ['de Boer', 'Victor', ''], ['Petram', 'Lodewijk', ''], ['van Erp', 'Marieke', '']]","['Knowledge Graph', 'Digital Humanities', 'Maritime history']"
8313,2005.03448,Hao Sun,"Zhao Chen, Yang Liu and Hao Sun",Physics-informed learning of governing equations from scarce data,"46 pages; 1 table, 6 figures and 3 extended data figures in main
  text; 2 tables and 12 figures in supplementary information",,10.1038/s41467-021-26434-1,,cs.LG physics.comp-ph physics.data-an stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Harnessing data to discover the underlying governing laws or equations that
describe the behavior of complex physical systems can significantly advance our
modeling, simulation and understanding of such systems in various science and
engineering disciplines. This work introduces a novel physics-informed deep
learning framework to discover governing partial differential equations (PDEs)
from scarce and noisy data for nonlinear spatiotemporal systems. In particular,
this approach seamlessly integrates the strengths of deep neural networks for
rich representation learning, physics embedding, automatic differentiation and
sparse regression to (1) approximate the solution of system variables, (2)
compute essential derivatives, as well as (3) identify the key derivative terms
and parameters that form the structure and explicit expression of the PDEs. The
efficacy and robustness of this method are demonstrated, both numerically and
experimentally, on discovering a variety of PDE systems with different levels
of data scarcity and noise accounting for different initial/boundary
conditions. The resulting computational framework shows the potential for
closed-form model discovery in practical applications where large and accurate
datasets are intractable to capture.
","[{'version': 'v1', 'created': 'Tue, 5 May 2020 22:13:22 GMT'}, {'version': 'v2', 'created': 'Sat, 9 Jan 2021 23:28:48 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Jan 2021 21:26:27 GMT'}]",2021-11-17,"[['Chen', 'Zhao', ''], ['Liu', 'Yang', ''], ['Sun', 'Hao', '']]","['governing equation discovery', 'physics-informed deep learning', 'PDEs']"
8314,2001.03437,Tatsuaki Wada,"Tatsuaki Wada, Antonio M. Scarfone, Hiroshi Matsuzoe","An eikonal equation approach to thermodynamics and the gradient flows in
  information geometry",Submitted to Physica A,"Physica A Volume 570, 15 May 2021, 125820",10.1016/j.physa.2021.125820,,cs.IT cond-mat.stat-mech math-ph math.IT math.MP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We can incorporate a ""time"" evolution into thermodynamics as a
Hamilton-Jacobi dynamics. A set of the equations of states in thermodynamics is
considered as the generalized eikonal equation, which is equivalent to
Hamilton-Jacobi equation. We relate the Hamilton-Jacobi dynamics of a simple
thermodynamic system to the gradient flows in information geometry.
","[{'version': 'v1', 'created': 'Fri, 10 Jan 2020 13:42:57 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Mar 2020 13:20:49 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Oct 2020 05:33:56 GMT'}]",2021-08-16,"[['Wada', 'Tatsuaki', ''], ['Scarfone', 'Antonio M.', ''], ['Matsuzoe', 'Hiroshi', '']]","['eikonal equation', 'gradient-flow equations', 'informationgeometry', 'Hamilton-Jacobi dynamics', 'thermodynamics', 'vielbein']"
8315,1710.10105,Felipe A. Louza,"Felipe A. Louza, W. F. Smyth, Giovanni Manzini, Guilherme P. Telles",Lyndon Array Construction during Burrows-Wheeler Inversion,,"Journal of Discrete Algorithms, 50 (2018), 2-9",10.1016/j.jda.2018.08.001,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present an algorithm to compute the Lyndon array of a string
$T$ of length $n$ as a byproduct of the inversion of the Burrows-Wheeler
transform of $T$. Our algorithm runs in linear time using only a stack in
addition to the data structures used for Burrows-Wheeler inversion. We compare
our algorithm with two other linear-time algorithms for Lyndon array
construction and show that computing the Burrows-Wheeler transform and then
constructing the Lyndon array is competitive compared to the known approaches.
We also propose a new balanced parenthesis representation for the Lyndon array
that uses $2n+o(n)$ bits of space and supports constant time access. This
representation can be built in linear time using $O(n)$ words of space, or in
$O(n\log n/\log\log n)$ time using asymptotically the same space as $T$.
","[{'version': 'v1', 'created': 'Fri, 27 Oct 2017 12:37:14 GMT'}]",2019-03-12,"[['Louza', 'Felipe A.', ''], ['Smyth', 'W. F.', ''], ['Manzini', 'Giovanni', ''], ['Telles', 'Guilherme P.', '']]","['Lyndon array', 'Burrows-Wheeler inversion', 'linear time', 'compressed']"
8316,1906.00760,Abu Sufian,"A. Banerjee, P. Dutta, A. Sufian",Fuzzy Route Switching For Energy Preservation (FEP) in Ad Hoc Networks,"11 pages, 12 figures, 4 tables","Indian Journal of Science and Technology, Vol 9(43), November 2016",10.17485/ijst/2016/v9i43/104383,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nodes in ad hoc networks have limited battery power. Hence they require an
energy-efficient technique to improve average network performance. Maintaining
energy-efficiency in ad hoc networks is really challenging because highest
energy efficiency is achieved if all the nodes are always switched off and
energy-efficiency will be minimum if all the nodes are fully operational i.e.
always turned-on. Energy preservation requires redirection of data packets
through some other routes having good performance. This improves the data
packet delivery ratio and the number of alive nodes decreasing the cost of
messages.
","[{'version': 'v1', 'created': 'Sun, 26 May 2019 06:23:35 GMT'}]",2019-06-04,"[['Banerjee', 'A.', ''], ['Dutta', 'P.', ''], ['Sufian', 'A.', '']]","['Ad Hoc Networks', 'Congestion', 'Delay', 'Energy Preservation', 'Fuzzy-Controller', 'Network Partition']"
8317,2005.08803,Ehsan Haghighat,Ehsan Haghighat and Ruben Juanes,"SciANN: A Keras/Tensorflow wrapper for scientific computations and
  physics-informed deep learning using artificial neural networks",,,10.1016/j.cma.2020.113552,,cs.OH cs.LG cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce SciANN, a Python package for scientific computing
and physics-informed deep learning using artificial neural networks. SciANN
uses the widely used deep-learning packages Tensorflow and Keras to build deep
neural networks and optimization models, thus inheriting many of Keras's
functionalities, such as batch optimization and model reuse for transfer
learning. SciANN is designed to abstract neural network construction for
scientific computations and solution and discovery of partial differential
equations (PDE) using the physics-informed neural networks (PINN) architecture,
therefore providing the flexibility to set up complex functional forms. We
illustrate, in a series of examples, how the framework can be used for curve
fitting on discrete data, and for solution and discovery of PDEs in strong and
weak forms. We summarize the features currently available in SciANN, and also
outline ongoing and future developments.
","[{'version': 'v1', 'created': 'Mon, 11 May 2020 22:55:15 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Sep 2020 03:18:44 GMT'}]",2020-12-30,"[['Haghighat', 'Ehsan', ''], ['Juanes', 'Ruben', '']]","['SciANN', 'Deep Neural Networks', 'Scientific Computations', 'PINN', 'vPINN']"
8318,2206.06113,Alina Berry,"Alina Berry, Susan McKeever, Brenda Murphy, Sarah Jane Delany","Addressing the ""Leaky Pipeline"": A Review and Categorisation of Actions
  to Recruit and Retain Women in Computing Education","13 pages, 1 figure, 1 table",,10.21125/edulearn.2022.2274,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Gender imbalance in computing education is a well-known issue around the
world. The term ""leaky pipeline"" is often used to describe the lack of
retention of women before they progress to senior roles. Numerous initiatives
have targeted the problem of the leaky pipeline in recent decades. This paper
provides a comprehensive review of initiatives related to techniques used to
boost recruitment and retention of women in undergraduate computing and related
courses in higher education. The primary aim was to identify interventions or
initiatives (which we called ""actions"") that have shown some effectiveness. A
secondary objective was to structure our findings as a categorisation, in order
to enable future action discussion, comparison and planning. A particular
challenge faced in a significant portion of the work was the lack of
evaluation: i.e. the assessment of the direct relationship between the
initiatives and the outcomes on retention or recruitment. The actions were
categorised into four groups: Policy, Pedagogy, Influence and Support and
Promotion and Engagement. Policy actions need support and potentially
structural change at institution level. Pedagogy actions are initiatives
related to the teaching of computing courses. The Influence and Support
category includes actions associated with ways to influence women to choose
computing and once enrolled to support and encourage them to stay. Finally,
Promotion and Engagement actions are initiatives to promote computing based
courses and involve engagement and outreach activities. We present our
categorisation, identifying the literature related to actions under each
category and subcategory. We discuss the challenges with evaluating the direct
impact of actions and outline how this work leads towards the next phase of our
work - a toolkit of actions to promote retention and recruitment of women in
computing undergraduate courses.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2022 12:54:02 GMT'}]",2022-07-20,"[['Berry', 'Alina', ''], ['McKeever', 'Susan', ''], ['Murphy', 'Brenda', ''], ['Delany', 'Sarah Jane', '']]","['Gender', 'Computer Science', 'Computing', 'Education', 'Women', 'Literature Review']"
8319,1809.05636,Yingjie Hu,Yingjie Hu,Geo-Text Data and Data-Driven Geospatial Semantics,"Geography Compass, 2018",,10.1111/gec3.12404,,cs.CL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many datasets nowadays contain links between geographic locations and natural
language texts. These links can be geotags, such as geotagged tweets or
geotagged Wikipedia pages, in which location coordinates are explicitly
attached to texts. These links can also be place mentions, such as those in
news articles, travel blogs, or historical archives, in which texts are
implicitly connected to the mentioned places. This kind of data is referred to
as geo-text data. The availability of large amounts of geo-text data brings
both challenges and opportunities. On the one hand, it is challenging to
automatically process this kind of data due to the unstructured texts and the
complex spatial footprints of some places. On the other hand, geo-text data
offers unique research opportunities through the rich information contained in
texts and the special links between texts and geography. As a result, geo-text
data facilitates various studies especially those in data-driven geospatial
semantics. This paper discusses geo-text data and related concepts. With a
focus on data-driven research, this paper systematically reviews a large number
of studies that have discovered multiple types of knowledge from geo-text data.
Based on the literature review, a generalized workflow is extracted and key
challenges for future work are discussed.
","[{'version': 'v1', 'created': 'Sat, 15 Sep 2018 02:54:34 GMT'}]",2018-09-18,"[['Hu', 'Yingjie', '']]","['geo-text data', 'spatial analysis', 'natural language processing', 'spatial and textualdata analysis', 'data-driven geospatial semantics', 'spatial data science']"
8320,2004.11638,Thierry Denoeux,Thierry Denoeux,"Belief functions induced by random fuzzy sets: A general framework for
  representing uncertain and fuzzy evidence",,"Fuzzy Sets and Systems, Volume 424, 2021, Pages 63-91",10.1016/j.fss.2020.12.004,,cs.AI math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We revisit Zadeh's notion of ""evidence of the second kind"" and show that it
provides the foundation for a general theory of epistemic random fuzzy sets,
which generalizes both the Dempster-Shafer theory of belief functions and
possibility theory. In this perspective, Dempster-Shafer theory deals with
belief functions generated by random sets, while possibility theory deals with
belief functions induced by fuzzy sets. The more general theory allows us to
represent and combine evidence that is both uncertain and fuzzy. We demonstrate
the application of this formalism to statistical inference, and show that it
makes it possible to reconcile the possibilistic interpretation of likelihood
with Bayesian inference.
","[{'version': 'v1', 'created': 'Fri, 24 Apr 2020 10:14:54 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Oct 2020 14:48:02 GMT'}]",2022-02-17,"[['Denoeux', 'Thierry', '']]","['Dempster-Shafer theory', 'evidence theory', 'possibility theory', 'fuzzy massfunctions', 'uncertain reasoning', 'likelihood', 'estimation', 'prediction']"
8321,2101.01228,Nicholas Botzer,"Nicholas Botzer, Yifan Ding, Tim Weninger",Reddit Entity Linking Dataset,20 pages and 4 figures,"Information Processing and Management Volume 58, Issue 3 (May
  2021) 1-20",10.1016/j.ipm.2020.102479,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  We introduce and make publicly available an entity linking dataset from
Reddit that contains 17,316 linked entities, each annotated by three human
annotators and then grouped into Gold, Silver, and Bronze to indicate
inter-annotator agreement. We analyze the different errors and disagreements
made by annotators and suggest three types of corrections to the raw data.
Finally, we tested existing entity linking models that are trained and tuned on
text from non-social media datasets. We find that, although these existing
entity linking models perform very well on their original datasets, they
perform poorly on this social media dataset. We also show that the majority of
these errors can be attributed to poor performance on the mention detection
subtask. These results indicate the need for better entity linking models that
can be applied to the enormous amount of social media text.
","[{'version': 'v1', 'created': 'Mon, 4 Jan 2021 20:34:04 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Feb 2021 17:54:48 GMT'}]",2021-02-26,"[['Botzer', 'Nicholas', ''], ['Ding', 'Yifan', ''], ['Weninger', 'Tim', '']]","['entity linking', 'dataset', 'natural language processing']"
8322,2011.11305,Ioannis Apostolopoulos,"Ioannis D. Apostolopoulos, Mpesiana Tzani","Industrial object, machine part and defect recognition towards fully
  automated industrial monitoring employing deep learning. The case of
  multilevel VGG19","17 pages, 10 figures","Journal of Ambient Intelligence and Humanized Computing, 2022",10.1007/s12652-021-03688-7,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern industry requires modern solutions for monitoring the automatic
production of goods. Smart monitoring of the functionality of the mechanical
parts of technology systems or machines is mandatory for a fully automatic
production process. Although Deep Learning has been advancing, allowing for
real-time object detection and other tasks, little has been investigated about
the effectiveness of specially designed Convolutional Neural Networks for
defect detection and industrial object recognition. In the particular study, we
employed six publically available industrial-related datasets containing defect
materials and industrial tools or engine parts, aiming to develop a specialized
model for pattern recognition. Motivated by the recent success of the Virtual
Geometry Group (VGG) network, we propose a modified version of it, called
Multipath VGG19, which allows for more local and global feature extraction,
while the extra features are fused via concatenation. The experiments verified
the effectiveness of MVGG19 over the traditional VGG19. Specifically, top
classification performance was achieved in five of the six image datasets,
while the average classification improvement was 6.95%.
","[{'version': 'v1', 'created': 'Mon, 23 Nov 2020 10:05:50 GMT'}]",2022-01-11,"[['Apostolopoulos', 'Ioannis D.', ''], ['Tzani', 'Mpesiana', '']]","['Deep Learning', 'Machine Part Recognition', 'Defect Detection', 'Industrial Object recognition', 'Production Monitoring']"
8323,1910.11471,K.M. Tahsin Hassan Rahit,"K.M. Tahsin Hassan Rahit, Rashidul Hasan Nabil and Md Hasibul Huq","Machine Translation from Natural Language to Code using Long-Short Term
  Memory","8 pages, 3 figures, conference","Proceedings of the Future Technologies Conference (FTC) 2019.
  Advances in Intelligent Systems and Computing, vol 1069. Springer, Cham",10.1007/978-3-030-32520-6_6,,cs.CL cs.AI cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Making computer programming language more understandable and easy for the
human is a longstanding problem. From assembly language to present day's
object-oriented programming, concepts came to make programming easier so that a
programmer can focus on the logic and the architecture rather than the code and
language itself. To go a step further in this journey of removing
human-computer language barrier, this paper proposes machine learning approach
using Recurrent Neural Network (RNN) and Long-Short Term Memory (LSTM) to
convert human language into programming language code. The programmer will
write expressions for codes in layman's language, and the machine learning
model will translate it to the targeted programming language. The proposed
approach yields result with 74.40% accuracy. This can be further improved by
incorporating additional techniques, which are also discussed in this paper.
","[{'version': 'v1', 'created': 'Fri, 25 Oct 2019 00:46:07 GMT'}]",2019-10-28,"[['Rahit', 'K. M. Tahsin Hassan', ''], ['Nabil', 'Rashidul Hasan', ''], ['Huq', 'Md Hasibul', '']]","['Text to code', 'machine learning', 'machine translation', 'NLP', 'RNN', 'LSTM']"
8324,2206.02436,Na Li,"Na Li, John D. Kelleher, Robert Ross","Detecting Interlocutor Confusion in Situated Human-Avatar Dialogue: A
  Pilot Study","8 figures, 10pages including 2pages reference. Conference:
  https://semdial2021.ling.uni-potsdam.de/, Paper
  link:https://semdial2021.ling.uni-potsdam.de/assets/semdial2021_potsdial_full_proceedings.pdf",,10.21427/bsd0-7326,,cs.HC cs.AI cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to enhance levels of engagement with conversational systems, our
long term research goal seeks to monitor the confusion state of a user and
adapt dialogue policies in response to such user confusion states. To this end,
in this paper, we present our initial research centred on a user-avatar
dialogue scenario that we have developed to study the manifestation of
confusion and in the long term its mitigation. We present a new definition of
confusion that is particularly tailored to the requirements of intelligent
conversational system development for task-oriented dialogue. We also present
the details of our Wizard-of-Oz based data collection scenario wherein users
interacted with a conversational avatar and were presented with stimuli that
were in some cases designed to invoke a confused state in the user. Post study
analysis of this data is also presented. Here, three pre-trained deep learning
models were deployed to estimate base emotion, head pose and eye gaze. Despite
a small pilot study group, our analysis demonstrates a significant relationship
between these indicators and confusion states. We understand this as a useful
step forward in the automated analysis of the pragmatics of dialogue.
","[{'version': 'v1', 'created': 'Mon, 6 Jun 2022 08:56:32 GMT'}]",2022-06-07,"[['Li', 'Na', ''], ['Kelleher', 'John D.', ''], ['Ross', 'Robert', '']]","['Confusion detection', 'situated dialogues', 'emotion recognition', 'head pose', 'eye gaze', 'pragmatics', 'avatar', 'wizard-of-oz']"
8325,2206.03721,Minrui Wang,"Minrui Wang, Mingxiao Feng, Wengang Zhou, Houqiang Li","Stabilizing Voltage in Power Distribution Networks via Multi-Agent
  Reinforcement Learning with Transformer",Accepted by KDD 2022 Research Track,,10.1145/3534678.3539480,,cs.MA cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The increased integration of renewable energy poses a slew of technical
challenges for the operation of power distribution networks. Among them,
voltage fluctuations caused by the instability of renewable energy are
receiving increasing attention. Utilizing MARL algorithms to coordinate
multiple control units in the grid, which is able to handle rapid changes of
power systems, has been widely studied in active voltage control task recently.
However, existing approaches based on MARL ignore the unique nature of the grid
and achieve limited performance. In this paper, we introduce the transformer
architecture to extract representations adapting to power network problems and
propose a Transformer-based Multi-Agent Actor-Critic framework (T-MAAC) to
stabilize voltage in power distribution networks. In addition, we adopt a novel
auxiliary-task training process tailored to the voltage control task, which
improves the sample efficiency and facilitating the representation learning of
the transformer-based model. We couple T-MAAC with different multi-agent
actor-critic algorithms, and the consistent improvements on the active voltage
control task demonstrate the effectiveness of the proposed method.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2022 07:48:42 GMT'}]",2022-06-09,"[['Wang', 'Minrui', ''], ['Feng', 'Mingxiao', ''], ['Zhou', 'Wengang', ''], ['Li', 'Houqiang', '']]","['Multi-agent Reinforcement Learning', 'Active Voltage Control', 'Transformer']"
8326,1908.11322,Qingyao Ai,"Qingyao Ai, Daniel N. Hill, S. V. N. Vishwanathan, W. Bruce Croft",A Zero Attention Model for Personalized Product Search,,,10.1145/3357384.3357980,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Product search is one of the most popular methods for people to discover and
purchase products on e-commerce websites. Because personal preferences often
have an important influence on the purchase decision of each customer, it is
intuitive that personalization should be beneficial for product search engines.
While synthetic experiments from previous studies show that purchase histories
are useful for identifying the individual intent of each product search
session, the effect of personalization on product search in practice, however,
remains mostly unknown. In this paper, we formulate the problem of personalized
product search and conduct large-scale experiments with search logs sampled
from a commercial e-commerce search engine. Results from our preliminary
analysis show that the potential of personalization depends on query
characteristics, interactions between queries, and user purchase histories.
Based on these observations, we propose a Zero Attention Model for product
search that automatically determines when and how to personalize a user-query
pair via a novel attention mechanism. Empirical results on commercial product
search logs show that the proposed model not only significantly outperforms
state-of-the-art personalized product retrieval models, but also provides
important information on the potential of personalization in each product
search session.
","[{'version': 'v1', 'created': 'Thu, 29 Aug 2019 16:12:49 GMT'}]",2019-08-30,"[['Ai', 'Qingyao', ''], ['Hill', 'Daniel N.', ''], ['Vishwanathan', 'S. V. N.', ''], ['Croft', 'W. Bruce', '']]","['Product Search', 'Personalization', 'Attention Mechanism']"
8327,2112.01298,Luciano Cavalcante Siebert,"Luciano Cavalcante Siebert, Maria Luce Lupetti, Evgeni Aizenberg, Niek
  Beckers, Arkady Zgonnikov, Herman Veluwenkamp, David Abbink, Elisa Giaccardi,
  Geert-Jan Houben, Catholijn M. Jonker, Jeroen van den Hoven, Deborah Forster,
  Reginald L. Lagendijk","Meaningful human control: actionable properties for AI system
  development","Preprint. Published AI and Ethics (2022):
  https://doi.org/10.1007/s43681-022-00167-3",AI Ethics (2022),10.1007/s43681-022-00167-3,,cs.CY cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  How can humans remain in control of artificial intelligence (AI)-based
systems designed to perform tasks autonomously? Such systems are increasingly
ubiquitous, creating benefits - but also undesirable situations where moral
responsibility for their actions cannot be properly attributed to any
particular person or group. The concept of meaningful human control has been
proposed to address responsibility gaps and mitigate them by establishing
conditions that enable a proper attribution of responsibility for humans;
however, clear requirements for researchers, designers, and engineers are yet
inexistent, making the development of AI-based systems that remain under
meaningful human control challenging. In this paper, we address the gap between
philosophical theory and engineering practice by identifying, through an
iterative process of abductive thinking, four actionable properties for
AI-based systems under meaningful human control, which we discuss making use of
two applications scenarios: automated vehicles and AI-based hiring. First, a
system in which humans and AI algorithms interact should have an explicitly
defined domain of morally loaded situations within which the system ought to
operate. Second, humans and AI agents within the system should have appropriate
and mutually compatible representations. Third, responsibility attributed to a
human should be commensurate with that human's ability and authority to control
the system. Fourth, there should be explicit links between the actions of the
AI agents and actions of humans who are aware of their moral responsibility. We
argue that these four properties will support practically-minded professionals
to take concrete steps toward designing and engineering for AI systems that
facilitate meaningful human control.
","[{'version': 'v1', 'created': 'Thu, 25 Nov 2021 11:05:37 GMT'}, {'version': 'v2', 'created': 'Thu, 19 May 2022 15:28:01 GMT'}]",2022-05-20,"[['Siebert', 'Luciano Cavalcante', ''], ['Lupetti', 'Maria Luce', ''], ['Aizenberg', 'Evgeni', ''], ['Beckers', 'Niek', ''], ['Zgonnikov', 'Arkady', ''], ['Veluwenkamp', 'Herman', ''], ['Abbink', 'David', ''], ['Giaccardi', 'Elisa', ''], ['Houben', 'Geert-Jan', ''], ['Jonker', 'Catholijn M.', ''], ['Hoven', 'Jeroen van den', ''], ['Forster', 'Deborah', ''], ['Lagendijk', 'Reginald L.', '']]","['Artificial intelligence', 'AI Ethics', 'Meaningful Human Control', 'Moral responsibility', 'Socio-technical systems']"
8328,1903.05912,Bestoun Ahmed Dr.,Bestoun S. Ahmed and Miroslav Bures,"Testing of Smart TV Applications: Key Ingredients, Challenges and
  Proposed Solutions",FTC 2018 Conference,,10.1007/978-3-030-02686-8_20,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smart TV applications are software applications that have been designed to
run on smart TVs which are televisions with integrated Internet features.
Nowadays, the smart TVs are going to dominate the television market, and the
number of connected TVs is growing exponentially. This growth is accompanied by
the increase of consumers and the use of smart TV applications that drive these
devices. Due to the increasing demand for smart TV applications especially with
the rise of the Internet of Things (IoT) services, it is essential to building
an application with a certain level of quality. Despite the analogy between the
smart TV and mobile apps, testing smart TV applications is different in many
aspects due to the different nature of user interaction and development
environment. To develop the field and formulate the concepts of smart TV
application testing, this paper aims to provide the essential ingredients,
solutions, answers to the most critical questions, and open problems. In
addition, we offer initial results and proof of concepts for a creeper
algorithm to detect essential views of the applications. This paper serves as
an effort to report the key ingredients and challenges of the smart TV
application testing systematically to the research community.
","[{'version': 'v1', 'created': 'Thu, 14 Mar 2019 10:50:51 GMT'}]",2019-03-15,"[['Ahmed', 'Bestoun S.', ''], ['Bures', 'Miroslav', '']]","['Smart TV application testing', 'Software Testing', 'Modelbased Testing', 'Internet of Things (IoT)']"
8329,1911.08054,Himank Yadav,"Himank Yadav, Zhengxiao Du, Thorsten Joachims",Policy-Gradient Training of Fair and Unbiased Ranking Functions,,,10.1145/3404835.3462953,,cs.LG cs.CY cs.IR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While implicit feedback (e.g., clicks, dwell times, etc.) is an abundant and
attractive source of data for learning to rank, it can produce unfair ranking
policies for both exogenous and endogenous reasons. Exogenous reasons typically
manifest themselves as biases in the training data, which then get reflected in
the learned ranking policy and often lead to rich-get-richer dynamics.
Moreover, even after the correction of such biases, reasons endogenous to the
design of the learning algorithm can still lead to ranking policies that do not
allocate exposure among items in a fair way. To address both exogenous and
endogenous sources of unfairness, we present the first learning-to-rank
approach that addresses both presentation bias and merit-based fairness of
exposure simultaneously. Specifically, we define a class of amortized
fairness-of-exposure constraints that can be chosen based on the needs of an
application, and we show how these fairness criteria can be enforced despite
the selection biases in implicit feedback data. The key result is an efficient
and flexible policy-gradient algorithm, called FULTR, which is the first to
enable the use of counterfactual estimators for both utility estimation and
fairness constraints. Beyond the theoretical justification of the framework, we
show empirically that the proposed algorithm can learn accurate and fair
ranking policies from biased and noisy feedback.
","[{'version': 'v1', 'created': 'Tue, 19 Nov 2019 02:45:42 GMT'}, {'version': 'v2', 'created': 'Sun, 9 May 2021 11:15:39 GMT'}]",2021-05-11,"[['Yadav', 'Himank', ''], ['Du', 'Zhengxiao', ''], ['Joachims', 'Thorsten', '']]","['fairness', 'bias', 'learning-to-rank', 'counterfactual learning']"
8330,2207.13909,Minju Park,"Minju Park, Kyogu Lee","Exploiting Negative Preference in Content-based Music Recommendation
  with Contrastive Learning","Accepted at 16th ACM Conference on Recommender Systems (ACM RecSys
  2022)",,10.1145/3523227.3546768,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advanced music recommendation systems are being introduced along with the
development of machine learning. However, it is essential to design a music
recommendation system that can increase user satisfaction by understanding
users' music tastes, not by the complexity of models. Although several studies
related to music recommendation systems exploiting negative preferences have
shown performance improvements, there was a lack of explanation on how they led
to better recommendations. In this work, we analyze the role of negative
preference in users' music tastes by comparing music recommendation models with
contrastive learning exploiting preference (CLEP) but with three different
training strategies - exploiting preferences of both positive and negative
(CLEP-PN), positive only (CLEP-P), and negative only (CLEP-N). We evaluate the
effectiveness of the negative preference by validating each system with a small
amount of personalized data obtained via survey and further illuminate the
possibility of exploiting negative preference in music recommendations. Our
experimental results show that CLEP-N outperforms the other two in accuracy and
false positive rate. Furthermore, the proposed training strategies produced a
consistent tendency regardless of different types of front-end musical feature
extractors, proving the stability of the proposed method.
","[{'version': 'v1', 'created': 'Thu, 28 Jul 2022 07:02:48 GMT'}]",2022-07-29,"[['Park', 'Minju', ''], ['Lee', 'Kyogu', '']]","['content-based music recommendation', 'negative preference', 'contrastive learning']"
8331,2007.12586,Nicolas A. Barriga,"Ignacio Gajardo, Felipe Besoain, and Nicolas A. Barriga",Introduction to Behavior Algorithms for Fighting Games,in Spanish,,10.1109/CHILECON47746.2019.8988008,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The quality of opponent Artificial Intelligence (AI) in fighting videogames
is crucial. Some other game genres can rely on their story or visuals, but
fighting games are all about the adversarial experience. In this paper, we will
introduce standard behavior algorithms in videogames, such as Finite-State
Machines and Behavior Trees, as well as more recent developments, such as
Monte-Carlo Tree Search. We will also discuss the existing and potential
combinations of these algorithms, and how they might be used in fighting games.
Since we are at the financial peak of fighting games, both for casual players
and in tournaments, it is important to build and expand on fighting game AI, as
it is one of the pillars of this growing market.
","[{'version': 'v1', 'created': 'Mon, 6 Jul 2020 14:52:20 GMT'}]",2020-07-27,"[['Gajardo', 'Ignacio', ''], ['Besoain', 'Felipe', ''], ['Barriga', 'Nicolas A.', '']]","['Finite-State Machines', 'Behavior Trees', 'MonteCarlo Tree Search', 'Videogame AI']"
8332,2010.02971,Woubshet  Behutiye,"Woubshet Behutiye, Pertti Seppanen, Pilar Rodriguez and Markku Oivo",Documentation of quality requirements in agile software development,10 pages,EASE 2020 In Evaluation and Assessment in Software Engineering,10.1145/3383219.3383245,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Quality requirements (QRs) have a significant role in the success of
software projects. In agile software development (ASD), where working software
is valued over comprehensive documentation, QRs are often under-specified or
not documented. Consequently, they may be handled improperly and result in
degraded software quality and increased maintenance costs. Investigating the
documentation of QRs in ASD, would provide evidence on existing practices,
tools and aspects considered in ASD that other practitioners might utilize to
improve documentation and management of QRs in ASD. Although there are some
studies examining documentation in ASD, those that specifically investigate the
documentation of QRs in depth are lacking. Method: we conducted a multiple case
study by interviewing 15 practitioners of four ASD cases, to provide empirical
evidence on documentation of QRs in ASD. We also run workshops with two of the
cases, to identify important aspects that ASD practitioners consider when
documenting QRs in requirements management repositories. Result and
conclusions: ASD companies approach documentation of QRs to fit the needs of
their context. They used tools, backlogs,iterative prototypes,... Please refer
to the PDF document for the remaining part of the abstract and the rest of the
paper
","[{'version': 'v1', 'created': 'Tue, 6 Oct 2020 18:59:56 GMT'}]",2020-10-08,"[['Behutiye', 'Woubshet', ''], ['Seppanen', 'Pertti', ''], ['Rodriguez', 'Pilar', ''], ['Oivo', 'Markku', '']]","['Quality requirement', 'documentation', 'agile software development', 'non-functional requirements']"
8333,2110.12536,Fred Hohman,"Jochen G\""ortler, Fred Hohman, Dominik Moritz, Kanit Wongsuphasawat,
  Donghao Ren, Rahul Nair, Marc Kirchner, Kayur Patel","Neo: Generalizing Confusion Matrix Visualization to Hierarchical and
  Multi-Output Labels","Proceedings of the 2022 CHI Conference on Human Factors in Computing
  Systems",,10.1145/3491102.3501823,,cs.HC cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The confusion matrix, a ubiquitous visualization for helping people evaluate
machine learning models, is a tabular layout that compares predicted class
labels against actual class labels over all data instances. We conduct
formative research with machine learning practitioners at Apple and find that
conventional confusion matrices do not support more complex data-structures
found in modern-day applications, such as hierarchical and multi-output labels.
To express such variations of confusion matrices, we design an algebra that
models confusion matrices as probability distributions. Based on this algebra,
we develop Neo, a visual analytics system that enables practitioners to
flexibly author and interact with hierarchical and multi-output confusion
matrices, visualize derived metrics, renormalize confusions, and share matrix
specifications. Finally, we demonstrate Neo's utility with three model
evaluation scenarios that help people better understand model performance and
reveal hidden confusions.
","[{'version': 'v1', 'created': 'Sun, 24 Oct 2021 21:55:20 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Feb 2022 23:51:19 GMT'}]",2022-02-21,"[['Görtler', 'Jochen', ''], ['Hohman', 'Fred', ''], ['Moritz', 'Dominik', ''], ['Wongsuphasawat', 'Kanit', ''], ['Ren', 'Donghao', ''], ['Nair', 'Rahul', ''], ['Kirchner', 'Marc', ''], ['Patel', 'Kayur', '']]","['Confusion matrices', 'model evaluation', 'visual analytics', 'machinelearning', 'interactive systems']"
8334,1901.03271,Kevin Sala,"Kevin Sala (1), Xavier Teruel (1), Josep M. Perez (1), Antonio J.
  Pe\~na (1), Vicen\c{c} Beltran (1), Jesus Labarta (1) ((1) Barcelona
  Supercomputing Center)","Integrating Blocking and Non-Blocking MPI Primitives with Task-Based
  Programming Models","European Commission's projects: INTERTWinE (EC-H2020-671602), Marie
  Sk{\l}odowska-Curie (EC-H2020-749516). Postprint submitted to the Parallel
  Computing Journal (Elsevier). Figures from section 7.2 updated, typos
  corrected","Parallel Computing, 85, 153-166 (2019)",10.1016/j.parco.2018.12.008,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present the Task-Aware MPI library (TAMPI) that integrates
both blocking and non-blocking MPI primitives with task-based programming
models. The TAMPI library leverages two new runtime APIs to improve both
programmability and performance of hybrid applications. The first API allows to
pause and resume the execution of a task depending on external events. This API
is used to improve the interoperability between blocking MPI communication
primitives and tasks. When an MPI operation executed inside a task blocks, the
task running is paused so that the runtime system can schedule a new task on
the core that became idle. Once the blocked MPI operation is completed, the
paused task is put again on the runtime system's ready queue, so eventually it
will be scheduled again and its execution will be resumed.
  The second API defers the release of dependencies associated with a task
completion until some external events are fulfilled. This API is composed only
of two functions, one to bind external events to a running task and another
function to notify about the completion of external events previously bound.
TAMPI leverages this API to bind non-blocking MPI operations with tasks,
deferring the release of their task dependencies until both task execution and
all its bound MPI operations are completed.
  Our experiments reveal that the enhanced features of TAMPI not only simplify
the development of hybrid MPI+OpenMP applications that use blocking or
non-blocking MPI primitives but they also naturally overlap computation and
communication phases, which improves application performance and scalability by
removing artificial dependencies across communication tasks.
","[{'version': 'v1', 'created': 'Thu, 10 Jan 2019 17:02:26 GMT'}, {'version': 'v2', 'created': 'Fri, 29 May 2020 13:03:53 GMT'}]",2020-06-01,"[['Sala', 'Kevin', ''], ['Teruel', 'Xavier', ''], ['Perez', 'Josep M.', ''], ['Peña', 'Antonio J.', ''], ['Beltran', 'Vicenç', ''], ['Labarta', 'Jesus', '']]","['MPI', 'OpenMP', 'OmpSs-2', 'TAMPI', 'Interoperability', 'Task']"
8335,2011.09362,Owais Sarwar,Owais Sarwar and Benjamin Sauk and Nikolaos V. Sahinidis,"A Discussion on Practical Considerations with Sparse Regression
  Methodologies",12 pages,"Statist. Sci. Volume 35, Number 4 (2020), 593-601",10.1214/20-STS806,,cs.LG stat.AP stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sparse linear regression is a vast field and there are many different
algorithms available to build models. Two new papers published in Statistical
Science study the comparative performance of several sparse regression
methodologies, including the lasso and subset selection. Comprehensive
empirical analyses allow the researchers to demonstrate the relative merits of
each estimator and provide guidance to practitioners. In this discussion, we
summarize and compare the two studies and we examine points of agreement and
divergence, aiming to provide clarity and value to users. The authors have
started a highly constructive dialogue, our goal is to continue it.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2020 15:58:35 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Feb 2021 19:43:24 GMT'}]",2021-02-10,"[['Sarwar', 'Owais', ''], ['Sauk', 'Benjamin', ''], ['Sahinidis', 'Nikolaos V.', '']]","['Sparse regression', 'subset selection', 'lasso', 'regularization']"
8336,2109.08539,Andre Greiner-Petter,"Andr\'e Greiner-Petter, Moritz Schubotz, Howard S. Cohl and Bela Gipp",MathTools: An Open API for Convenient MathML Handling,"Published in Proceedings of the International Conference on
  Intelligent Computer Mathematics (CICM) 2018",,10.1007/978-3-319-96812-4_9,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Mathematical formulae carry complex and essential semantic information in a
variety of formats. Accessing this information with different systems requires
a standardized machine-readable format that is capable of encoding
presentational and semantic information. Even though MathML is an official
recommendation by W3C and an ISO standard for representing mathematical
expressions, we could identify only very few systems which use the full
descriptiveness of MathML. MathML's high complexity results in a steep learning
curve for novice users. We hypothesize that this complexity is the reason why
many community-driven projects refrain from using MathML, and instead develop
problem-specific data formats for their purposes. We provide a user-friendly,
open-source application programming interface for controlling MathML data. Our
API is written in JAVA and allows to create, manipulate, and efficiently access
commonly needed information in presentation and content MathML. Our interface
also provides tools for calculating differences and similarities between MathML
expressions. The API also allows to determine the distance between expressions
using different similarity measures. In addition, we provide adapters for
numerous conversion tools and the canonicalization project. Our toolkit
facilitates processing of mathematics for digital libraries, without the need
to obtain XML expertise.
","[{'version': 'v1', 'created': 'Fri, 17 Sep 2021 13:24:31 GMT'}]",2021-09-20,"[['Greiner-Petter', 'André', ''], ['Schubotz', 'Moritz', ''], ['Cohl', 'Howard S.', ''], ['Gipp', 'Bela', '']]","['MathML', 'API', 'Toolkit', 'Java']"
8337,2206.10587,Leonard Elia van Dyck,"Leonard E. van Dyck, Sebastian J. Denzler, Walter R. Gruber","Guiding Visual Attention in Deep Convolutional Neural Networks Based on
  Human Eye Movements","28 pages, 6 figures, 3 supplementary figures",,10.3389/fnins.2022.975639,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep Convolutional Neural Networks (DCNNs) were originally inspired by
principles of biological vision, have evolved into best current computational
models of object recognition, and consequently indicate strong architectural
and functional parallelism with the ventral visual pathway throughout
comparisons with neuroimaging and neural time series data. As recent advances
in deep learning seem to decrease this similarity, computational neuroscience
is challenged to reverse-engineer the biological plausibility to obtain useful
models. While previous studies have shown that biologically inspired
architectures are able to amplify the human-likeness of the models, in this
study, we investigate a purely data-driven approach. We use human eye tracking
data to directly modify training examples and thereby guide the models' visual
attention during object recognition in natural images either towards or away
from the focus of human fixations. We compare and validate different
manipulation types (i.e., standard, human-like, and non-human-like attention)
through GradCAM saliency maps against human participant eye tracking data. Our
results demonstrate that the proposed guided focus manipulation works as
intended in the negative direction and non-human-like models focus on
significantly dissimilar image parts compared to humans. The observed effects
were highly category-specific, enhanced by animacy and face presence, developed
only after feedforward processing was completed, and indicated a strong
influence on face detection. With this approach, however, no significantly
increased human-likeness was found. Possible applications of overt visual
attention in DCNNs and further implications for theories of face detection are
discussed.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2022 17:59:23 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Sep 2022 16:45:41 GMT'}]",2022-09-07,"[['van Dyck', 'Leonard E.', ''], ['Denzler', 'Sebastian J.', ''], ['Gruber', 'Walter R.', '']]","['vision', 'attention', 'brain', 'deep neural networks', 'eye tracking', 'saliency map', 'object']"
8338,2010.05178,Ehsan Zabardast,"Ehsan Zabardast, Kwabena Ebo Bennin, Javier Gonzalez-Huerta",Further Investigation of the Survivability of Code Technical Debt Items,Submitted to the Journal of Software: Evolution and Process (JSME),,10.1002/smr.2425,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Technical Debt (TD) discusses the negative impact of sub-optimal
decisions to cope with the need-for-speed in software development. Code
Technical Debt Items (TDI) are atomic elements of TD that can be observed in
code artefacts. Empirical results on open-source systems demonstrated how
code-smells, which are just one type of TDIs, are introduced and ""survive""
during release cycles. However, little is known about whether the results on
the survivability of code-smells hold for other types of code TDIs (i.e., bugs
and vulnerabilities) and in industrial settings. Goal: Understanding the
survivability of code TDIs by conducting an empirical study analysing two
industrial cases and 31 open-source systems from Apache Foundation. Method: We
analysed 133,670 code TDIs (35,703 from the industrial systems) detected by
SonarQube (in 193,196 commits) to assess their survivability using
survivability models. Results: In general, code TDIs tend to remain and linger
for long periods in open-source systems, whereas they are removed faster in
industrial systems. Code TDIs that survive over a certain threshold tend to
remain much longer, which confirms previous results. Our results also suggest
that bugs tend to be removed faster, while code smells and vulnerabilities tend
to survive longer.
","[{'version': 'v1', 'created': 'Sun, 11 Oct 2020 06:47:58 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Nov 2021 14:08:10 GMT'}]",2022-01-06,"[['Zabardast', 'Ehsan', ''], ['Bennin', 'Kwabena Ebo', ''], ['Gonzalez-Huerta', 'Javier', '']]","['Survivability', 'Code Technical Debt Items', 'Code Smells', 'Bugs', 'Vulnerabilities']"
8339,2004.01122,Xiaodi Wu,"Shaopeng Zhu, Shih-Han Hung, Shouvanik Chakrabarti, and Xiaodi Wu",On the Principles of Differentiable Quantum Programming Languages,Codes are available at https://github.com/LibertasSpZ/adcompile,,10.1145/3385412.3386011,,cs.PL cs.LG quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Variational Quantum Circuits (VQCs), or the so-called quantum
neural-networks, are predicted to be one of the most important near-term
quantum applications, not only because of their similar promises as classical
neural-networks, but also because of their feasibility on near-term noisy
intermediate-size quantum (NISQ) machines. The need for gradient information in
the training procedure of VQC applications has stimulated the development of
auto-differentiation techniques for quantum circuits. We propose the first
formalization of this technique, not only in the context of quantum circuits
but also for imperative quantum programs (e.g., with controls), inspired by the
success of differentiable programming languages in classical machine learning.
In particular, we overcome a few unique difficulties caused by exotic quantum
features (such as quantum no-cloning) and provide a rigorous formulation of
differentiation applied to bounded-loop imperative quantum programs, its
code-transformation rules, as well as a sound logic to reason about their
correctness. Moreover, we have implemented our code transformation in OCaml and
demonstrated the resource-efficiency of our scheme both analytically and
empirically. We also conduct a case study of training a VQC instance with
controls, which shows the advantage of our scheme over existing
auto-differentiation for quantum circuits without controls.
","[{'version': 'v1', 'created': 'Thu, 2 Apr 2020 16:46:13 GMT'}]",2020-04-03,"[['Zhu', 'Shaopeng', ''], ['Hung', 'Shih-Han', ''], ['Chakrabarti', 'Shouvanik', ''], ['Wu', 'Xiaodi', '']]","['quantum programming languages', 'differentiableprogramming languages', 'quantum machine learning']"
8340,2203.03944,Thorsten Hempel,Thorsten Hempel and Ayoub Al-Hamadi,"An Online Semantic Mapping System for Extending and Enhancing Visual
  SLAM","Accepted by Engineering Applications of Artificial Intelligence,
  Elsevier, 7 Mar 2022","Engineering Applications of Artificial Intelligence, Volume 111,
  May 2022, 104830",10.1016/j.engappai.2022.104830,,cs.RO cs.AI cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We present a real-time semantic mapping approach for mobile vision systems
with a 2D to 3D object detection pipeline and rapid data association for
generated landmarks. Besides the semantic map enrichment the associated
detections are further introduced as semantic constraints into a simultaneous
localization and mapping (SLAM) system for pose correction purposes. This way,
we are able generate additional meaningful information that allows to achieve
higher-level tasks, while simultaneously leveraging the view-invariance of
object detections to improve the accuracy and the robustness of the odometry
estimation. We propose tracklets of locally associated object observations to
handle ambiguous and false predictions and an uncertainty-based greedy
association scheme for an accelerated processing time. Our system reaches
real-time capabilities with an average iteration duration of 65~ms and is able
to improve the pose estimation of a state-of-the-art SLAM by up to 68% on a
public dataset. Additionally, we implemented our approach as a modular ROS
package that makes it straightforward for integration in arbitrary graph-based
SLAM methods.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2022 09:14:37 GMT'}]",2022-03-25,"[['Hempel', 'Thorsten', ''], ['Al-Hamadi', 'Ayoub', '']]","['Simultaneous Mapping and Localization', 'Semantic Mapping', 'Graph Optimization', 'Object Detection']"
8341,2006.11071,Jakub Lengiewicz,"Beno\^it Piranda (1), Pawe{\l} Chodkiewicz (2), Pawe{\l} Ho{\l}obut
  (3), St\'ephane P.A. Bordas (4), Julien Bourgeois (1), Jakub Lengiewicz (3
  and 4) ((1) University of Bourgogne Franche-Comt\'e, FEMTO-ST Institute,
  CNRS, France, (2) Faculty of Automotive and Construction Machinery
  Engineering, Warsaw University of Technology, Poland, (3) Institute of
  Fundamental Technological Research, Polish Academy of Sciences, Poland, (4)
  Department of Engineering, Faculty of Science, Technology and Medicine,
  University of Luxembourg, Luxembourg)","Distributed prediction of unsafe reconfiguration scenarios of modular
  robotic Programmable Matter",,"IEEE Transactions on Robotics, vol. 37, no. 6, pp. 2226-2233, Dec.
  2021",10.1109/TRO.2021.3074085,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  We present a distributed framework for predicting whether a planned
reconfiguration step of a modular robot will mechanically overload the
structure, causing it to break or lose stability under its own weight. The
algorithm is executed by the modular robot itself and based on a distributed
iterative solution of mechanical equilibrium equations derived from a
simplified model of the robot. The model treats inter-modular connections as
beams and assumes no-sliding contact between the modules and the ground. We
also provide a procedure for simplified instability detection. The algorithm is
verified in the Programmable Matter simulator VisibleSim, and in real-life
experiments on the modular robotic system Blinky Blocks.
","[{'version': 'v1', 'created': 'Fri, 19 Jun 2020 11:13:00 GMT'}, {'version': 'v2', 'created': 'Mon, 3 May 2021 14:12:43 GMT'}]",2023-01-27,"[['Piranda', 'Benoît', '', '3\n  and 4'], ['Chodkiewicz', 'Paweł', '', '3\n  and 4'], ['Hołobut', 'Paweł', '', '3\n  and 4'], ['Bordas', 'Stéphane P. A.', '', '3\n  and 4'], ['Bourgeois', 'Julien', '', '3\n  and 4'], ['Lengiewicz', 'Jakub', '', '3\n  and 4']]","['Self-reconfiguration', 'Modular robots', 'Distributed algorithms', 'Mechanical constraints', 'Programmable Matter']"
8342,1810.02713,Giovanni Iacca Dr.,"D. Bucur, G. Iacca, M. Gaudesi, G. Squillero, A. Tonda","Optimizing groups of colluding strong attackers in mobile urban
  communication networks with evolutionary algorithms",,"Applied Soft Computing, Volume 40, pp 416-426, 2016",10.1016/j.asoc.2015.11.024,,cs.NE cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In novel forms of the Social Internet of Things, any mobile user within
communication range may help routing messages for another user in the network.
The resulting message delivery rate depends both on the users' mobility
patterns and the message load in the network. This new type of configuration,
however, poses new challenges to security, amongst them, assessing the effect
that a group of colluding malicious participants can have on the global message
delivery rate in such a network is far from trivial. In this work, after
modeling such a question as an optimization problem, we are able to find quite
interesting results by coupling a network simulator with an evolutionary
algorithm. The chosen algorithm is specifically designed to solve problems
whose solutions can be decomposed into parts sharing the same structure. We
demonstrate the effectiveness of the proposed approach on two medium-sized
Delay-Tolerant Networks, realistically simulated in the urban contexts of two
cities with very different route topology: Venice and San Francisco. In all
experiments, our methodology produces attack patterns that greatly lower
network performance with respect to previous studies on the subject, as the
evolutionary core is able to exploit the specific weaknesses of each target
configuration.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 14:25:50 GMT'}]",2018-10-08,"[['Bucur', 'D.', ''], ['Iacca', 'G.', ''], ['Gaudesi', 'M.', ''], ['Squillero', 'G.', ''], ['Tonda', 'A.', '']]","['Cooperative Co-Evolution', 'Delay-Tolerant Network', 'Evolutionary Algorithms', 'Network Security', 'Routing']"
8343,1508.07097,Nguyen Huynh,"Hoai Nguyen Huynh, Erika Fille Legara, Christopher Monterola",A Dynamical Model of Twitter Activity Profiles,"10 pages, 5 figures","Hypertext '15, 49-57 (2015)",10.1145/2700171.2791029,,cs.SI cs.CY cs.HC physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The advent of the era of Big Data has allowed many researchers to dig into
various socio-technical systems, including social media platforms. In
particular, these systems have provided them with certain verifiable means to
look into certain aspects of human behavior. In this work, we are specifically
interested in the behavior of individuals on social media platforms---how they
handle the information they get, and how they share it. We look into Twitter to
understand the dynamics behind the users' posting activities---tweets and
retweets---zooming in on topics that peaked in popularity. Three mechanisms are
considered: endogenous stimuli, exogenous stimuli, and a mechanism that
dictates the decay of interest of the population in a topic. We propose a model
involving two parameters $\eta^\star$ and $\lambda$ describing the tweeting
behaviour of users, which allow us to reconstruct the findings of Lehmann et
al. (2012) on the temporal profiles of popular Twitter hashtags. With this
model, we are able to accurately reproduce the temporal profile of user
engagements on Twitter. Furthermore, we introduce an alternative in classifying
the collective activities on the socio-technical system based on the model.
","[{'version': 'v1', 'created': 'Fri, 28 Aug 2015 05:24:14 GMT'}]",2015-08-31,"[['Huynh', 'Hoai Nguyen', ''], ['Legara', 'Erika Fille', ''], ['Monterola', 'Christopher', '']]","['Social networks', 'Information diffusion', 'Modelling']"
8344,2012.06428,Christos Kyrkou,Christos Kyrkou,"Imitation-Based Active Camera Control with Deep Convolutional Neural
  Network","Paper accepted in Fourth IEEE International Conference on Image
  Processing, Applications, and Systems (IEEE IPAS 2020)",,10.1109/IPAS50080.2020.9334958,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The increasing need for automated visual monitoring and control for
applications such as smart camera surveillance, traffic monitoring, and
intelligent environments, necessitates the improvement of methods for visual
active monitoring. Traditionally, the active monitoring task has been handled
through a pipeline of modules such as detection, filtering, and control. In
this paper we frame active visual monitoring as an imitation learning problem
to be solved in a supervised manner using deep learning, to go directly from
visual information to camera movement in order to provide a satisfactory
solution by combining computer vision and control. A deep convolutional neural
network is trained end-to-end as the camera controller that learns the entire
processing pipeline needed to control a camera to follow multiple targets and
also estimate their density from a single image. Experimental results indicate
that the proposed solution is robust to varying conditions and is able to
achieve better monitoring performance both in terms of number of targets
monitored as well as in monitoring time than traditional approaches, while
reaching up to 25 FPS. Thus making it a practical and affordable solution for
multi-target active monitoring in surveillance and smart-environment
applications.
","[{'version': 'v1', 'created': 'Fri, 11 Dec 2020 15:37:33 GMT'}]",2021-03-08,"[['Kyrkou', 'Christos', '']]","['Real-Time Active Vision', 'Smart Camera', 'Deep Learning', 'End-to-End']"
8345,1807.10443,Ali Dehghantanha,"Opeyemi Osanaiye, Kim-Kwang Raymond Choo2, Ali Dehghantanha, Zheng Xu,
  Mqhele Dlodlo","Ensemble-based Multi-Filter Feature Selection Method for DDoS Detection
  in Cloud Computing",20 Pages,,10.1186/s13638-016-0623-3,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Increasing interest in the adoption of cloud computing has exposed it to
cyber-attacks. One of such is distributed denial of service (DDoS) attack that
targets cloud bandwidth, services and resources to make it unavailable to both
the cloud providers and users. Due to the magnitude of traffic that needs to be
processed, data mining and machine learning classification algorithms have been
proposed to classify normal packets from an anomaly. Feature selection has also
been identified as a pre-processing phase in cloud DDoS attack defence that can
potentially increase classification accuracy and reduce computational
complexity by identifying important features from the original dataset, during
supervised learning. In this work, we propose an ensemble-based multi-filter
feature selection method that combines the output of four filter methods to
achieve an optimum selection. An extensive experimental evaluation of our
proposed method was performed using intrusion detection benchmark dataset,
NSL-KDD and decision tree classifier. The result obtained shows that our
proposed method effectively reduced the number of features from 41 to 13 and
has a high detection rate and classification accuracy when compared to other
classification techniques.
","[{'version': 'v1', 'created': 'Fri, 27 Jul 2018 05:45:22 GMT'}]",2018-07-30,"[['Osanaiye', 'Opeyemi', ''], ['Choo2', 'Kim-Kwang Raymond', ''], ['Dehghantanha', 'Ali', ''], ['Xu', 'Zheng', ''], ['Dlodlo', 'Mqhele', '']]","['Classification', 'Feature selection', 'Filter methods', 'Cloud computing', 'DDoS', 'Intrusion detection']"
8346,2210.09021,Oezdemir Cetin,"Ahmet Gokberk Gul, Oezdemir Cetin, Christoph Reich, Tim Prangemeier,
  Nadine Flinner, Heinz Koeppl","Histopathological Image Classification based on Self-Supervised Vision
  Transformer and Weak Labels",,"Proc. SPIE 12039, Medical Imaging 2022: Digital and Computational
  Pathology, 120391O (4 April 2022)",10.1117/12.2624609,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Whole Slide Image (WSI) analysis is a powerful method to facilitate the
diagnosis of cancer in tissue samples. Automating this diagnosis poses various
issues, most notably caused by the immense image resolution and limited
annotations. WSIs commonly exhibit resolutions of 100Kx100K pixels. Annotating
cancerous areas in WSIs on the pixel level is prohibitively labor-intensive and
requires a high level of expert knowledge. Multiple instance learning (MIL)
alleviates the need for expensive pixel-level annotations. In MIL, learning is
performed on slide-level labels, in which a pathologist provides information
about whether a slide includes cancerous tissue. Here, we propose Self-ViT-MIL,
a novel approach for classifying and localizing cancerous areas based on
slide-level annotations, eliminating the need for pixel-wise annotated training
data. Self-ViT- MIL is pre-trained in a self-supervised setting to learn rich
feature representation without relying on any labels. The recent Vision
Transformer (ViT) architecture builds the feature extractor of Self-ViT-MIL.
For localizing cancerous regions, a MIL aggregator with global attention is
utilized. To the best of our knowledge, Self-ViT- MIL is the first approach to
introduce self-supervised ViTs in MIL-based WSI analysis tasks. We showcase the
effectiveness of our approach on the common Camelyon16 dataset. Self-ViT-MIL
surpasses existing state-of-the-art MIL-based approaches in terms of accuracy
and area under the curve (AUC).
","[{'version': 'v1', 'created': 'Mon, 17 Oct 2022 12:43:41 GMT'}]",2022-10-18,"[['Gul', 'Ahmet Gokberk', ''], ['Cetin', 'Oezdemir', ''], ['Reich', 'Christoph', ''], ['Prangemeier', 'Tim', ''], ['Flinner', 'Nadine', ''], ['Koeppl', 'Heinz', '']]","['Multiple Instance Learning', 'Weakly Supervised Learning', 'Vision Transformer', 'Computational Pathology', 'Cancer Detection', 'Whole Slide Image']"
8347,1909.02352,Peilun Wu,"Peilun Wu, Hui Guo and Richard Buckland",A Transfer Learning Approach for Network Intrusion Detection,,,10.1109/ICBDA.2019.8713213,,cs.LG cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convolution Neural Network (ConvNet) offers a high potential to generalize
input data. It has been widely used in many application areas, such as visual
imagery, where comprehensive learning datasets are available and a ConvNet
model can be well trained and perform the required function effectively.
ConvNet can also be applied to network intrusion detection. However, the
currently available datasets related to the network intrusion are often
inadequate, which makes the ConvNet learning deficient, hence the trained model
is not competent in detecting unknown intrusions. In this paper, we propose a
ConvNet model using transfer learning for network intrusion detection. The
model consists of two concatenated ConvNets and is built on a two-stage
learning process: learning a base dataset and transferring the learned
knowledge to the learning of the target dataset. Our experiments on the NSL-KDD
dataset show that the proposed model can improve the detection accuracy not
only on the test dataset containing mostly known attacks (KDDTest+) but also on
the test dataset featuring many novel attacks (KDDTest-21) -- about 2.68\%
improvement on KDDTest+ and 22.02\% on KDDTest-21 can be achieved, as compared
to the traditional ConvNet model.
","[{'version': 'v1', 'created': 'Thu, 5 Sep 2019 12:11:07 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Oct 2019 16:02:08 GMT'}, {'version': 'v3', 'created': 'Tue, 12 Nov 2019 07:40:59 GMT'}, {'version': 'v4', 'created': 'Wed, 18 Dec 2019 19:14:40 GMT'}]",2019-12-20,"[['Wu', 'Peilun', ''], ['Guo', 'Hui', ''], ['Buckland', 'Richard', '']]","['Network Intrusion Detection', 'ConvNet', 'Data Deficiency']"
8348,2105.00060,Cynthia Rudin,"Michael Anis Mihdi Afnan, Cynthia Rudin, Vincent Conitzer, Julian
  Savulescu, Abhishek Mishra, Yanhe Liu, Masoud Afnan","Ethical Implementation of Artificial Intelligence to Select Embryos in
  In Vitro Fertilization",,AIES 2021,10.1145/3461702.3462589,,cs.AI,http://creativecommons.org/licenses/by-sa/4.0/,"  AI has the potential to revolutionize many areas of healthcare. Radiology,
dermatology, and ophthalmology are some of the areas most likely to be impacted
in the near future, and they have received significant attention from the
broader research community. But AI techniques are now also starting to be used
in in vitro fertilization (IVF), in particular for selecting which embryos to
transfer to the woman. The contribution of AI to IVF is potentially
significant, but must be done carefully and transparently, as the ethical
issues are significant, in part because this field involves creating new
people. We first give a brief introduction to IVF and review the use of AI for
embryo selection. We discuss concerns with the interpretation of the reported
results from scientific and practical perspectives. We then consider the
broader ethical issues involved. We discuss in detail the problems that result
from the use of black-box methods in this context and advocate strongly for the
use of interpretable models. Importantly, there have been no published trials
of clinical effectiveness, a problem in both the AI and IVF communities, and we
therefore argue that clinical implementation at this point would be premature.
Finally, we discuss ways for the broader AI community to become involved to
ensure scientifically sound and ethically responsible development of AI in IVF.
","[{'version': 'v1', 'created': 'Fri, 30 Apr 2021 19:46:31 GMT'}]",2021-05-04,"[['Afnan', 'Michael Anis Mihdi', ''], ['Rudin', 'Cynthia', ''], ['Conitzer', 'Vincent', ''], ['Savulescu', 'Julian', ''], ['Mishra', 'Abhishek', ''], ['Liu', 'Yanhe', ''], ['Afnan', 'Masoud', '']]","['IVF', 'In Vitro Fertilization', 'Embryo Selection', 'Artificial']"
8349,2003.09095,Martianus Frederic Ezerman,"Yunlong Zhu, Zuling Chang, Martianus Frederic Ezerman, and Qiang Wang",An Efficiently Generated Family of Binary de Bruijn Sequences,A basic implementation in C is included,"Discrete Mathematics, Volume 344, Issue 6, June 2021, 112368",10.1016/j.disc.2021.112368,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study how to generate binary de Bruijn sequences efficiently from the
class of simple linear feedback shift registers with feedback function $f(x_0,
x_1, \ldots, x_{n-1}) = x_0 + x_1 + x_{n-1}$ for $n \geq 3$, using the cycle
joining method. Based on the properties of this class of LFSRs, we propose two
new generic successor rules, each of which produces at least $2^{n-3}$ de
Bruijn sequences. These two classes build upon a framework proposed by Gabric,
Sawada, Williams and Wong in Discrete Mathematics vol. 341, no. 11, pp.
2977--2987, November 2018. Here we introduce new useful choices for the
uniquely determined state in each cycle to devise valid successor rules. These
choices significantly increase the number of de Bruijn sequences that can be
generated. In each class, the next bit costs $O(n)$ time and $O(n)$ space for a
fixed $n$.
","[{'version': 'v1', 'created': 'Fri, 20 Mar 2020 04:20:44 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Jan 2021 01:00:11 GMT'}]",2021-05-27,"[['Zhu', 'Yunlong', ''], ['Chang', 'Zuling', ''], ['Ezerman', 'Martianus Frederic', ''], ['Wang', 'Qiang', '']]","['Binary periodic sequence', 'de Bruijn sequence', 'feedback shift register', 'successorrule', 'cycle joining method']"
8350,1910.04107,Konstantin Bulatov,"Konstantin Bulatov, Boris Savelyev, Vladimir V. Arlazarov","Next integrated result modelling for stopping the text field recognition
  process in a video using a result model with per-character alternatives","6 pages, 3 figures, 1 table, submitted and accepted for the 12th
  International Conference on Machine Vision (ICMV 2019)","Proc. SPIE 11433 ICMV-2019 (2020), 114332M",10.1117/12.2559447,,cs.CV stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the field of document analysis and recognition using mobile devices for
capturing, and the field of object recognition in a video stream, an important
problem is determining the time when the capturing process should be stopped.
Efficient stopping influences not only the total time spent for performing
recognition and data entry, but the expected accuracy of the result as well.
This paper is directed on extending the stopping method based on next
integrated recognition result modelling, in order for it to be used within a
string result recognition model with per-character alternatives. The stopping
method and notes on its extension are described, and experimental evaluation is
performed on an open dataset MIDV-500. The method was compares with previously
published methods based on input observations clustering. The obtained results
indicate that the stopping method based on the next integrated result modelling
allows to achieve higher accuracy, even when compared with the best achievable
configuration of the competing methods.
","[{'version': 'v1', 'created': 'Wed, 9 Oct 2019 16:43:42 GMT'}]",2020-02-12,"[['Bulatov', 'Konstantin', ''], ['Savelyev', 'Boris', ''], ['Arlazarov', 'Vladimir V.', '']]","['recognition in video stream', 'mobile OCR', 'stopping rules', 'decision making', 'mobile document recognition', 'anytime algorithms']"
8351,2207.04539,Han Yue,"Han Yue, Steve Xia, Hongfu Liu","Multi-task Envisioning Transformer-based Autoencoder for Corporate
  Credit Rating Migration Early Prediction","SIGKDD Conference on Knowledge Discovery and Data Mining, 2022",,10.1145/3534678.3539098,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Corporate credit ratings issued by third-party rating agencies are quantified
assessments of a company's creditworthiness. Credit Ratings highly correlate to
the likelihood of a company defaulting on its debt obligations. These ratings
play critical roles in investment decision-making as one of the key risk
factors. They are also central to the regulatory framework such as BASEL II in
calculating necessary capital for financial institutions. Being able to predict
rating changes will greatly benefit both investors and regulators alike. In
this paper, we consider the corporate credit rating migration early prediction
problem, which predicts the credit rating of an issuer will be upgraded,
unchanged, or downgraded after 12 months based on its latest financial
reporting information at the time. We investigate the effectiveness of
different standard machine learning algorithms and conclude these models
deliver inferior performance. As part of our contribution, we propose a new
Multi-task Envisioning Transformer-based Autoencoder (META) model to tackle
this challenging problem. META consists of Positional Encoding,
Transformer-based Autoencoder, and Multi-task Prediction to learn effective
representations for both migration prediction and rating prediction. This
enables META to better explore the historical data in the training stage for
one-year later prediction. Experimental results show that META outperforms all
baseline models.
","[{'version': 'v1', 'created': 'Sun, 10 Jul 2022 21:12:04 GMT'}]",2022-07-12,"[['Yue', 'Han', ''], ['Xia', 'Steve', ''], ['Liu', 'Hongfu', '']]","['Rating Migration', 'Fin-tech', 'Machine Learning']"
8352,2008.00832,Pavanakumar Mohanamuraly,Pavanakumar Mohanamuraly and Gabriel Staffelbach,"Hardware locality-aware partitioning and dynamic load-balancing of
  unstructured meshes for large-scale scientific applications",,,10.1145/3394277.3401851,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an open-source topology-aware hierarchical unstructured mesh
partitioning and load-balancing tool TreePart. The framework provides powerful
abstractions to automatically detect and build hierarchical MPI topology
resembling the hardware at runtime. Using this information it intelligently
chooses between shared and distributed parallel algorithms for partitioning and
load-balancing. It provides a range of partitioning methods by interfacing with
existing shared and distributed memory parallel partitioning libraries. It
provides powerful and scalable abstractions like one-sided distributed
dictionaries and MPI3 shared memory based halo communicators for optimising HPC
codes. The tool was successfully integrated into our in-house code and we
present results from a large-eddy simulation of a combustion problem.
","[{'version': 'v1', 'created': 'Mon, 3 Aug 2020 12:27:08 GMT'}]",2020-08-04,"[['Mohanamuraly', 'Pavanakumar', ''], ['Staffelbach', 'Gabriel', '']]","['Hardware-aware load-balancing', 'MPI3 shared memory', 'topologyaware hierarchical algorithms', 'unstructured mesh partitioning']"
8353,2109.11333,Qiang Sheng,"Qiang Sheng, Xueyao Zhang, Juan Cao, Lei Zhong","Integrating Pattern- and Fact-based Fake News Detection via Model
  Preference Learning",ACM CIKM 2021 Full Paper,,10.1145/3459637.3482440,,cs.CL cs.SI,http://creativecommons.org/licenses/by-sa/4.0/,"  To defend against fake news, researchers have developed various methods based
on texts. These methods can be grouped as 1) pattern-based methods, which focus
on shared patterns among fake news posts rather than the claim itself; and 2)
fact-based methods, which retrieve from external sources to verify the claim's
veracity without considering patterns. The two groups of methods, which have
different preferences of textual clues, actually play complementary roles in
detecting fake news. However, few works consider their integration. In this
paper, we study the problem of integrating pattern- and fact-based models into
one framework via modeling their preference differences, i.e., making the
pattern- and fact-based models focus on respective preferred parts in a post
and mitigate interference from non-preferred parts as possible. To this end, we
build a Preference-aware Fake News Detection Framework (Pref-FEND), which
learns the respective preferences of pattern- and fact-based models for joint
detection. We first design a heterogeneous dynamic graph convolutional network
to generate the respective preference maps, and then use these maps to guide
the joint learning of pattern- and fact-based models for final prediction.
Experiments on two real-world datasets show that Pref-FEND effectively captures
model preferences and improves the performance of models based on patterns,
facts, or both.
","[{'version': 'v1', 'created': 'Thu, 23 Sep 2021 12:28:55 GMT'}]",2021-09-24,"[['Sheng', 'Qiang', ''], ['Zhang', 'Xueyao', ''], ['Cao', 'Juan', ''], ['Zhong', 'Lei', '']]","['fake news detection', 'preference learning', 'graph neural networks', 'pattern mining', 'fact-checking']"
8354,2003.01718,Marialena Akriotou,"Charis Mesaritakis (1), Marialena Akriotou (2), Dimitris Syvridis (2)
  ((1) Dept. Information & Communication Systems Engineering University of the
  Aegean Karlovassi-Samos, Greece, (2) Dept. Informatics & Telecommunications
  National & Kapodistrian University of Athens, Athens, Greece)","Laser Induced Speckle as a Foundation for Physical Security and Optical
  Computing",,"In 2018 Photonics in Switching and Computing (PSC) (pp. 1-3). IEEE
  (Sep 2018)",10.1109/PS.2018.8751356,,cs.ET cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a photonic system that exploits the speckle generated by the
interaction of a laser source and a semitransparent scattering medium, in our
case a large-core optical fiber, as a physical root of trust for cryptographic
applications, while the same configuration can act as a high-rate machine
learning paradigm.
","[{'version': 'v1', 'created': 'Tue, 3 Mar 2020 11:32:33 GMT'}]",2020-03-05,"[['Mesaritakis', 'Charis', ''], ['Akriotou', 'Marialena', ''], ['Syvridis', 'Dimitris', '']]","['physical security', 'polymer waveguides', 'physical unclonable functions', 'photonic reservoir computing']"
8355,2106.08801,Ziheng Zhang,"Zhiyuan Qi, Ziheng Zhang, Jiaoyan Chen, Xi Chen, Yefeng Zheng","PRASEMap: A Probabilistic Reasoning and Semantic Embedding based
  Knowledge Graph Alignment System",Accepted by CIKM 2021,,10.1145/3459637.3481972,,cs.CL cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Knowledge Graph (KG) alignment aims at finding equivalent entities and
relations (i.e., mappings) between two KGs. The existing approaches utilize
either reasoning-based or semantic embedding-based techniques, but few studies
explore their combination. In this demonstration, we present PRASEMap, an
unsupervised KG alignment system that iteratively computes the Mappings with
both Probabilistic Reasoning (PR) And Semantic Embedding (SE) techniques.
PRASEMap can support various embedding-based KG alignment approaches as the SE
module, and enables easy human computer interaction that additionally provides
an option for users to feed the mapping annotations back to the system for
better results. The demonstration showcases these features via a stand-alone
Web application with user friendly interfaces. The demo is available at
https://prasemap.qizhy.com.
","[{'version': 'v1', 'created': 'Wed, 16 Jun 2021 14:06:09 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Aug 2021 05:36:31 GMT'}]",2021-08-23,"[['Qi', 'Zhiyuan', ''], ['Zhang', 'Ziheng', ''], ['Chen', 'Jiaoyan', ''], ['Chen', 'Xi', ''], ['Zheng', 'Yefeng', '']]","['knowledge graph', 'knowledge graph alignment', 'probability reasoning', 'embedding']"
8356,1508.06899,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",Contradiction-tolerant process algebra with propositional signals,"25 pages; 26 pages, occurrences of wrong symbol for bisimulation
  equivalence replaced; 26 pages, Proposition 1 added; 27 pages, explanation of
  the phrase 'in contradiction' added to section 2 and presentation of the
  completeness result in section 2 improved; 27 pages, uniqueness result in
  section 2 revised; 27 pages, last paragraph of section 8 revised","Fundamenta Informaticae, 153(1-2): 29-55 (2017)",10.3233/FI-2017-1530,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a previous paper, an ACP-style process algebra was proposed in which
propositions are used as the visible part of the state of processes and as
state conditions under which processes may proceed. This process algebra,
called ACPps, is built on classical propositional logic. In this paper, we
present a version of ACPps built on a paraconsistent propositional logic which
is essentially the same as CLuNs. There are many systems that would have to
deal with self-contradictory states if no special measures were taken. For a
number of these systems, it is conceivable that accepting self-contradictory
states and dealing with them in a way based on a paraconsistent logic is an
alternative to taking special measures. The presented version of ACPps can be
suited for the description and analysis of systems that deal with
self-contradictory states in a way based on the above-mentioned paraconsistent
logic.
","[{'version': 'v1', 'created': 'Thu, 27 Aug 2015 15:28:17 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Mar 2016 16:36:31 GMT'}, {'version': 'v3', 'created': 'Tue, 22 Nov 2016 15:38:26 GMT'}, {'version': 'v4', 'created': 'Sun, 27 Nov 2016 13:40:52 GMT'}, {'version': 'v5', 'created': 'Thu, 9 Feb 2017 12:13:43 GMT'}, {'version': 'v6', 'created': 'Sun, 19 Mar 2017 11:19:42 GMT'}]",2017-06-19,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['process algebra', 'propositional signal', 'propositional condition', 'paraconsistent logic']"
8357,2111.09294,Konstantinos Agathos,"Konstantinos Agathos, Tim Dodwell, Eleni Chatzi and Stephane P. A.
  Bordas","An adapted deflated conjugate gradient solver for robust
  extended/generalised finite element solutions of large scale, 3D crack
  propagation problems",,,10.1016/j.cma.2022.114937,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An adapted deflation preconditioner is employed to accelerate the solution of
linear systems resulting from the discretization of fracture mechanics problems
with well-conditioned extended/generalized finite elements. The deflation space
typically used for linear elasticity problems is enriched with additional
vectors, accounting for the enrichment functions used, thus effectively
removing low frequency components of the error. To further improve performance,
deflation is combined, in a multiplicative way, with a block-Jacobi
preconditioner, which removes high frequency components of the error as well as
linear dependencies introduced by enrichment. The resulting scheme is tested on
a series of non-planar crack propagation problems and compared to alternative
linear solvers in terms of performance.
","[{'version': 'v1', 'created': 'Wed, 17 Nov 2021 18:46:45 GMT'}]",2022-05-11,"[['Agathos', 'Konstantinos', ''], ['Dodwell', 'Tim', ''], ['Chatzi', 'Eleni', ''], ['Bordas', 'Stephane P. A.', '']]","['XFEM', 'GFEM', 'deflated CG', 'multigrid', 'domain decomposition', 'crack propagation']"
8358,2005.05747,Rashidah  Kasauli,"Rashidah Kasauli, Rebekka Wohlrab, Eric Knauss, Jan-Philipp
  Stegh\""ofer, Jennifer Horkoff, Salome Maro","Charting Coordination Needs in Large-Scale Agile Organisationswith
  Boundary Objects and Methodological Islands","10 pages, 4 figures To appear in proceedings of International
  conference on Software and System Processes (ICSSP'20)",,10.1145/3379177.3388897,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Large-scale system development companies are increasingly adopting agile
methods. While this adoption may improve lead-times, such companies need to
balance two trade-offs: (i) the need to have a uniform, consistent development
method on system level with the need for specialised methods for teams in
different disciplines(e.g., hardware, software, mechanics, sales, support);
(ii) the need for comprehensive documentation on system level with the need to
have lightweight documentation enabling iterative and agile work. With
specialised methods for teams, isolated teams work within larger ecosystems of
plan-driven culture, i.e., teams become agile ""islands"". At the boundaries,
these teams share knowledge which needs to be managed well for a correct system
to be developed. While it is useful to support diverse and specialised methods,
it is important to understand which islands are repeatedly encountered, the
reasons or factors triggering their existence, and how best to handle
coordination between them. Based on a multiple case study, this work presents a
catalogue of islands and the boundary objects between them. We believe this
work will be beneficial to practitioners aiming to understand their ecosystems
and researchers addressing communication and coordination challenges in
large-scale development.
","[{'version': 'v1', 'created': 'Tue, 12 May 2020 13:19:10 GMT'}]",2020-05-13,"[['Kasauli', 'Rashidah', ''], ['Wohlrab', 'Rebekka', ''], ['Knauss', 'Eric', ''], ['Steghöfer', 'Jan-Philipp', ''], ['Horkoff', 'Jennifer', ''], ['Maro', 'Salome', '']]","['large-scale systems development', 'boundary objects', 'coordination']"
8359,1906.06932,Mohammadreza Kasaei,"Mohammadreza Kasaei, Nuno Lau, Artur Pereira","A Fast and Stable Omnidirectional Walking Engine for the Nao Humanoid
  Robot",,,10.1007/978-3-030-35699-6_8,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a framework designed to generate a closed-loop walking
engine for a humanoid robot. In particular, the core of this framework is an
abstract dynamics model which is composed of two masses that represent the
lower and the upper body of a humanoid robot. Moreover, according to the
proposed dynamics model, the low-level controller is formulated as a
Linear-Quadratic-Gaussian (LQG) controller that is able to robustly track the
desired trajectories. Besides, this framework is fully parametric which allows
using an optimization algorithm to find the optimum parameters. To examine the
performance of the proposed framework, a set of simulation using a simulated
Nao robot in the RoboCup 3D simulation environment has been carried out.
Simulation results show that the proposed framework is capable of providing
fast and reliable omnidirectional walking. After optimizing the parameters
using genetic algorithm (GA), the maximum forward walking velocity that we have
achieved was $80.5cm/s$.
","[{'version': 'v1', 'created': 'Mon, 17 Jun 2019 10:20:17 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Jun 2019 14:36:36 GMT'}]",2021-12-23,"[['Kasaei', 'Mohammadreza', ''], ['Lau', 'Nuno', ''], ['Pereira', 'Artur', '']]","['Humanoid robots', 'walking engine', 'Linear-Quadratic-Gaussian (LQG)', 'genetic algorithm', 'Linear Inverted Pendulum Model (LIPM)']"
8360,2007.04726,Sebastian Schmidt,"Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian Schmidt and
  Alexandru I. Tomescu","Safety in $s$-$t$ Paths, Trails and Walks",,,10.1007/s00453-021-00877-w,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a directed graph $G$ and a pair of nodes $s$ and $t$, an \emph{$s$-$t$
bridge} of $G$ is an edge whose removal breaks all $s$-$t$ paths of $G$ (and
thus appears in all $s$-$t$ paths). Computing all $s$-$t$ bridges of $G$ is a
basic graph problem, solvable in linear time.
  In this paper, we consider a natural generalisation of this problem, with the
notion of ""safety"" from bioinformatics. We say that a walk $W$ is \emph{safe}
with respect to a set $\mathcal{W}$ of $s$-$t$ walks, if $W$ is a subwalk of
all walks in $\mathcal{W}$. We start by considering the maximal safe walks when
$\mathcal{W}$ consists of: all $s$-$t$ paths, all $s$-$t$ trails, or all
$s$-$t$ walks of $G$. We show that the first two problems are immediate
linear-time generalisations of finding all $s$-$t$ bridges, while the third
problem is more involved. In particular, we show that there exists a compact
representation computable in linear time, that allows outputting all maximal
safe walks in time linear in their length.
  We further generalise these problems, by assuming that safety is defined only
with respect to a subset of \emph{visible} edges. Here we prove a dichotomy
between the $s$-$t$ paths and $s$-$t$ trails cases, and the $s$-$t$ walks case:
the former two are NP-hard, while the latter is solvable with the same
complexity as when all edges are visible. We also show that the same complexity
results hold for the analogous generalisations of \emph{$s$-$t$ articulation
points} (nodes appearing in all $s$-$t$ paths).
  We thus obtain the best possible results for natural ""safety""-generalisations
of these two fundamental graph problems. Moreover, our algorithms are simple
and do not employ any complex data structures, making them ideal for use in
practice.
","[{'version': 'v1', 'created': 'Thu, 9 Jul 2020 11:53:19 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Jul 2020 10:09:57 GMT'}]",2021-11-03,"[['Cairo', 'Massimo', ''], ['Khan', 'Shahbaz', ''], ['Rizzi', 'Romeo', ''], ['Schmidt', 'Sebastian', ''], ['Tomescu', 'Alexandru I.', '']]","['Directed graph', 'connectivity problem', 'graph algorithm', 'strong bridge', 'strongarticulation point', 'safety']"
8361,2001.03411,Xixi Lu,"Xixi Lu and Seyed Amin Tabatabaei and Mark Hoogendoorn and Hajo A.
  Reijers","Trace Clustering on Very Large Event Data in Healthcare Using Frequent
  Sequence Patterns",,BPM 2019: Business Process Management pp 198-215,10.1007/978-3-030-26619-6_14,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Trace clustering has increasingly been applied to find homogenous process
executions. However, current techniques have difficulties in finding a
meaningful and insightful clustering of patients on the basis of healthcare
data. The resulting clusters are often not in line with those of medical
experts, nor do the clusters guarantee to help return meaningful process maps
of patients' clinical pathways. After all, a single hospital may conduct
thousands of distinct activities and generate millions of events per year. In
this paper, we propose a novel trace clustering approach by using sample sets
of patients provided by medical experts. More specifically, we learn frequent
sequence patterns on a sample set, rank each patient based on the patterns, and
use an automated approach to determine the corresponding cluster. We find each
cluster separately, while the frequent sequence patterns are used to discover a
process map. The approach is implemented in ProM and evaluated using a large
data set obtained from a university medical center. The evaluation shows
F1-scores of 0.7 for grouping kidney injury, 0.9 for diabetes, and 0.64 for
head/neck tumor, while the process maps show meaningful behavioral patterns of
the clinical pathways of these groups, according to the domain experts.
","[{'version': 'v1', 'created': 'Fri, 10 Jan 2020 13:07:41 GMT'}]",2020-01-13,"[['Lu', 'Xixi', ''], ['Tabatabaei', 'Seyed Amin', ''], ['Hoogendoorn', 'Mark', ''], ['Reijers', 'Hajo A.', '']]","['trace clustering', 'process mining', 'frequent sequential patterns', 'machine learning']"
8362,2107.05247,Yunfan Wu,"Yunfan Wu, Qi Cao, Huawei Shen, Shuchang Tao, Xueqi Cheng","INMO: A Model-Agnostic and Scalable Module for Inductive Collaborative
  Filtering",Accepted by SIGIR 2022,,10.1145/3477495.3532000,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Collaborative filtering is one of the most common scenarios and popular
research topics in recommender systems. Among existing methods, latent factor
models, i.e., learning a specific embedding for each user/item by
reconstructing the observed interaction matrix, have shown excellent
performances. However, such user-specific and item-specific embeddings are
intrinsically transductive, making it difficult to deal with new users and new
items unseen during training. Besides, the number of model parameters heavily
depends on the number of all users and items, restricting its scalability to
real-world applications. To solve the above challenges, in this paper, we
propose a novel model-agnostic and scalable Inductive Embedding Module for
collaborative filtering, namely INMO. INMO generates the inductive embeddings
for users (items) by characterizing their interactions with some template items
(template users), instead of employing an embedding lookup table. Under the
theoretical analysis, we further propose an effective indicator for the
selection of template users/items. Our proposed INMO can be attached to
existing latent factor models as a pre-module, inheriting the expressiveness of
backbone models, while bringing the inductive ability and reducing model
parameters. We validate the generality of INMO by attaching it to both Matrix
Factorization (MF) and LightGCN, which are two representative latent factor
models for collaborative filtering. Extensive experiments on three public
benchmarks demonstrate the effectiveness and efficiency of INMO in both
transductive and inductive recommendation scenarios.
","[{'version': 'v1', 'created': 'Mon, 12 Jul 2021 08:12:06 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Apr 2022 12:36:32 GMT'}]",2022-04-27,"[['Wu', 'Yunfan', ''], ['Cao', 'Qi', ''], ['Shen', 'Huawei', ''], ['Tao', 'Shuchang', ''], ['Cheng', 'Xueqi', '']]","['Recommender System', 'Collaborative Filtering', 'Inductive Embedding', 'Latent Factor Model']"
8363,1604.03147,Bita Shams,"Bita Shams, Saman Haratizadeh",Graph-based Collaborative Ranking,,"Expert Systems with Applications 67(2017), 59-70",10.1016/j.eswa.2016.09.013,,cs.SI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data sparsity, that is a common problem in neighbor-based collaborative
filtering domain, usually complicates the process of item recommendation. This
problem is more serious in collaborative ranking domain, in which calculating
the users similarities and recommending items are based on ranking data. Some
graph-based approaches have been proposed to address the data sparsity problem,
but they suffer from two flaws. First, they fail to correctly model the users
priorities, and second, they cannot be used when the only available data is a
set of ranking instead of rating values. In this paper, we propose a novel
graph-based approach, called GRank, that is designed for collaborative ranking
domain. GRank can correctly model users priorities in a new tripartite graph
structure, and analyze it to directly infer a recommendation list. The
experimental results show a significant improvement in recommendation quality
compared to the state of the art graph-based recommendation algorithms and
other collaborative ranking techniques.
","[{'version': 'v1', 'created': 'Mon, 11 Apr 2016 21:05:16 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Sep 2016 22:14:19 GMT'}, {'version': 'v3', 'created': 'Tue, 31 Jan 2017 09:19:42 GMT'}]",2017-02-01,"[['Shams', 'Bita', ''], ['Haratizadeh', 'Saman', '']]","['Collaborative ranking', 'pairwise preferences', 'graph modelling', 'recommendation systems', 'personalized PageRank']"
8364,1412.0131,Anita Zbieg,"Blazej Zak, Anita Zbieg","Heuristic for Network Coverage Optimization Applied in Finding
  Organizational Change Agents","The 2014 IEEE/ACM European Network Intelligence Conference. IEEE
  Computer Society, pp. 118-122",,10.1109/ENIC.2014.22,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Authors compare different ways of selecting change agents within network
analysis paradigm and propose a new algorithm of doing so. All methods are
evaluated against network coverage measure that calculates how many network
members can be directly reached by selected nodes. Results from the analysis of
organizational network show that compared to other methods the proposed
algorithm provides better network coverage, at the same time selecting change
agents that are well connected, influential opinion leaders.
","[{'version': 'v1', 'created': 'Sat, 29 Nov 2014 18:00:14 GMT'}]",2014-12-02,"[['Zak', 'Blazej', ''], ['Zbieg', 'Anita', '']]","['sna', 'ona', 'organizational network analysis', 'organizational change', 'change agents', 'network coverage']"
8365,2110.00210,Jinning Li,"Jinning Li, Huajie Shao, Dachun Sun, Ruijie Wang, Yuchen Yan, Jinyang
  Li, Shengzhong Liu, Hanghang Tong, Tarek Abdelzaher","Unsupervised Belief Representation Learning with Information-Theoretic
  Variational Graph Auto-Encoders","In Proceedings of the 45th International ACM SIGIR Conference on
  Research and Development in Information Retrieval (SIGIR '22)",,10.1145/3477495.3532072,,cs.SI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper develops a novel unsupervised algorithm for belief representation
learning in polarized networks that (i) uncovers the latent dimensions of the
underlying belief space and (ii) jointly embeds users and content items (that
they interact with) into that space in a manner that facilitates a number of
downstream tasks, such as stance detection, stance prediction, and ideology
mapping. Inspired by total correlation in information theory, we propose the
Information-Theoretic Variational Graph Auto-Encoder (InfoVGAE) that learns to
project both users and content items (e.g., posts that represent user views)
into an appropriate disentangled latent space. To better disentangle latent
variables in that space, we develop a total correlation regularization module,
a Proportional-Integral (PI) control module, and adopt rectified Gaussian
distribution to ensure the orthogonality. The latent representation of users
and content can then be used to quantify their ideological leaning and
detect/predict their stances on issues. We evaluate the performance of the
proposed InfoVGAE on three real-world datasets, of which two are collected from
Twitter and one from U.S. Congress voting records. The evaluation results show
that our model outperforms state-of-the-art unsupervised models by reducing
10.5% user clustering errors and achieving 12.1% higher F1 scores for stance
separation of content items. In addition, InfoVGAE produces a comparable result
with supervised models. We also discuss its performance on stance prediction
and user ranking within ideological groups.
","[{'version': 'v1', 'created': 'Fri, 1 Oct 2021 04:35:01 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Oct 2021 17:00:06 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Oct 2021 06:18:10 GMT'}, {'version': 'v4', 'created': 'Mon, 24 Jan 2022 23:31:41 GMT'}, {'version': 'v5', 'created': 'Mon, 9 May 2022 18:49:37 GMT'}]",2022-09-16,"[['Li', 'Jinning', ''], ['Shao', 'Huajie', ''], ['Sun', 'Dachun', ''], ['Wang', 'Ruijie', ''], ['Yan', 'Yuchen', ''], ['Li', 'Jinyang', ''], ['Liu', 'Shengzhong', ''], ['Tong', 'Hanghang', ''], ['Abdelzaher', 'Tarek', '']]","['Unsupervised Representation Learning', 'Polarized Networks', 'Ideology Analysis', 'Variational Graph Auto-Encoders']"
8366,2002.01537,Laura Sanely Gayt\'an-Lugo,"Francisco J. Gutierrez, Yazmin Magallanes, Laura S. Gayt\'an-Lugo,
  Claudia L\'opez, Cleidson R. B. de Souza","Academic viewpoints and concerns on CSCW education and training in Latin
  America",https://dl.acm.org/doi/abs/10.1145/3358961.3358971,,10.1145/3358961.3358971,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer-Supported Cooperative Work, or simply CSCW, is the research area
that studies the design and use of socio-technical technology for supporting
group work. CSCW has a long tradition in interdisciplinary work exploring
technical, social, and theoretical challenges for the design of technologies to
support cooperative and collaborative work and life activities. However, most
of the research tradition, methods, and theories in the field follow a strong
trend grounded in social and cultural aspects from North America and Western
Europe. Therefore, it is inevitable that some of the underlying, and
established, knowledge in the field will not be directly transferrable or
applicable to other populations. This paper presents the results of an
interview study conducted with Latin American faculty on the feasability,
viability, and prospect of a curriculum proposal for CSCW Education in Latin
America: To this end, we conducted nine interviews with faculty currently based
in six countries of the region, aiming to understand how a CSCW course targeted
to undergraduate and/or graduate students in Latin America might be deployed.
Our findings suggest that there are specific traits that need to be addressed
in such a course, such as: tailoring foundational CSCW concepts to the
diversity of local cultures, motivating the involvement of students by tackling
relevant problems to their local communities, and revitalizing CSCW research
and practice in the continent.
","[{'version': 'v1', 'created': 'Tue, 4 Feb 2020 21:08:10 GMT'}]",2020-02-06,"[['Gutierrez', 'Francisco J.', ''], ['Magallanes', 'Yazmin', ''], ['Gaytán-Lugo', 'Laura S.', ''], ['López', 'Claudia', ''], ['de Souza', 'Cleidson R. B.', '']]","['CSCW', 'Latin America', 'HCI Education and Training']"
8367,1910.09398,Martin Pawelczyk,"Martin Pawelczyk, Johannes Haug, Klaus Broelemann, Gjergji Kasneci",Learning Model-Agnostic Counterfactual Explanations for Tabular Data,"Update version: from Neurips Workshop to WWW publication. In
  Proceedings of The Web Conference 2020 (WWW 20), April 20-24, 2020, Taipei,
  Taiwan",,10.1145/3366423.3380087,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Counterfactual explanations can be obtained by identifying the smallest
change made to a feature vector to qualitatively influence a prediction; for
example, from 'loan rejected' to 'awarded' or from 'high risk of cardiovascular
disease' to 'low risk'. Previous approaches often emphasized that
counterfactuals should be easily interpretable to humans, motivating sparse
solutions with few changes to the feature vectors. However, these approaches
would not ensure that the produced counterfactuals be proximate (i.e., not
local outliers) and connected to regions with substantial data density (i.e.,
close to correctly classified observations), two requirements known as
counterfactual faithfulness. These requirements are fundamental when making
suggestions to individuals that are indeed attainable. Our contribution is
twofold. On one hand, we suggest to complement the catalogue of counterfactual
quality measures [1] using a criterion to quantify the degree of difficulty for
a certain counterfactual suggestion. On the other hand, drawing ideas from the
manifold learning literature, we develop a framework that generates attainable
counterfactuals. We suggest the counterfactual conditional heterogeneous
variational autoencoder (C-CHVAE) to identify attainable counterfactuals that
lie within regions of high data density.
","[{'version': 'v1', 'created': 'Mon, 21 Oct 2019 14:23:13 GMT'}, {'version': 'v2', 'created': 'Sun, 3 May 2020 14:14:55 GMT'}]",2020-05-05,"[['Pawelczyk', 'Martin', ''], ['Haug', 'Johannes', ''], ['Broelemann', 'Klaus', ''], ['Kasneci', 'Gjergji', '']]","['Transparency', 'Counterfactual explanations', 'Interpretability']"
8368,1506.05072,Jose Rodrigues Jr,"Hugo Gualdron, Robson Cordeiro, Jose Rodrigues","StructMatrix: large-scale visualization of graphs by means of structure
  detection and dense matrices","To appear: 8 pages, paper to be published at the Fifth IEEE ICDM
  Workshop on Data Mining in Networks, 2015 as Hugo Gualdron, Robson Cordeiro,
  Jose Rodrigues (2015) StructMatrix: Large-scale visualization of graphs by
  means of structure detection and dense matrices In: The Fifth IEEE ICDM
  Workshop on Data Mining in Networks 1--8, IEEE",,10.1109/ICDMW.2015.205,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a large-scale graph with millions of nodes and edges, how to reveal
macro patterns of interest, like cliques, bi-partite cores, stars, and chains?
Furthermore, how to visualize such patterns altogether getting insights from
the graph to support wise decision-making? Although there are many algorithmic
and visual techniques to analyze graphs, none of the existing approaches is
able to present the structural information of graphs at large-scale. Hence,
this paper describes StructMatrix, a methodology aimed at high-scalable visual
inspection of graph structures with the goal of revealing macro patterns of
interest. StructMatrix combines algorithmic structure detection and adjacency
matrix visualization to present cardinality, distribution, and relationship
features of the structures found in a given graph. We performed experiments in
real, large-scale graphs with up to one million nodes and millions of edges.
StructMatrix revealed that graphs of high relevance (e.g., Web, Wikipedia and
DBLP) have characterizations that reflect the nature of their corresponding
domains; our findings have not been seen in the literature so far. We expect
that our technique will bring deeper insights into large graph mining,
leveraging their use for decision making.
","[{'version': 'v1', 'created': 'Tue, 16 Jun 2015 19:02:59 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Sep 2015 21:14:21 GMT'}]",2016-11-17,"[['Gualdron', 'Hugo', ''], ['Cordeiro', 'Robson', ''], ['Rodrigues', 'Jose', '']]","['graphmining', 'fastprocessingoflarge-scalegraphs', 'graph sense making', 'large graph visualization']"
8369,2106.09173,George Mathew,"George Mathew, Kathryn T. Stolee",Cross-Language Code Search using Static and Dynamic Analyses,"Accepted at FSE 2021; 13 pages, 4 figures, 8 tables",,10.1145/3468264.3468538,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As code search permeates most activities in software development,code-to-code
search has emerged to support using code as a query and retrieving similar code
in the search results. Applications include duplicate code detection for
refactoring, patch identification for program repair, and language translation.
Existing code-to-code search tools rely on static similarity approaches such as
the comparison of tokens and abstract syntax trees (AST) to approximate dynamic
behavior, leading to low precision. Most tools do not support cross-language
code-to-code search, and those that do, rely on machine learning models that
require labeled training data.
  We present Code-to-Code Search Across Languages (COSAL), a cross-language
technique that uses both static and dynamic analyses to identify similar code
and does not require a machine learning model. Code snippets are ranked using
non-dominated sorting based on code token similarity, structural similarity,
and behavioral similarity. We empirically evaluate COSAL on two datasets of
43,146Java and Python files and 55,499 Java files and find that 1) code search
based on non-dominated ranking of static and dynamic similarity measures is
more effective compared to single or weighted measures; and 2) COSAL has better
precision and recall compared to state-of-the-art within-language and
cross-language code-to-code search tools. We explore the potential for using
COSAL on large open-source repositories and discuss scalability to more
languages and similarity metrics, providing a gateway for
practical,multi-language code-to-code search.
","[{'version': 'v1', 'created': 'Wed, 16 Jun 2021 23:27:01 GMT'}]",2021-06-18,"[['Mathew', 'George', ''], ['Stolee', 'Kathryn T.', '']]","['code-to-code search', 'cross-language code search', 'non-dominatedsorting', 'static analysis', 'dynamic analysis']"
8370,2104.05999,Pieter Boom,"Pieter D. Boom, Ashley Seepujak, Odysseas Kosmas, Lee Margetts and
  Andrey Jivkov","Parallelized Discrete Exterior Calculus for Three-Dimensional Elliptic
  Problems",,,10.1016/j.cpc.2022.108456,,cs.MS physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A formulation of elliptic boundary value problems is used to develop the
first discrete exterior calculus (DEC) library for massively parallel
computations with 3D domains. This can be used for steady-state analysis of any
physical process driven by the gradient of a scalar quantity, e.g. temperature,
concentration, pressure or electric potential, and is easily extendable to
transient analysis. In addition to offering this library to the community, we
demonstrate one important benefit from the DEC formulation: effortless
introduction of strong heterogeneities and discontinuities. These are typical
for real materials, but challenging for widely used domain discretization
schemes, such as finite elements. Specifically, we demonstrate the efficiency
of the method for calculating the evolution of thermal conductivity of a solid
with a growing crack population. Future development of the library will deal
with transient problems, and more importantly with processes driven by
gradients of vector quantities.
","[{'version': 'v1', 'created': 'Tue, 13 Apr 2021 08:06:48 GMT'}]",2022-07-20,"[['Boom', 'Pieter D.', ''], ['Seepujak', 'Ashley', ''], ['Kosmas', 'Odysseas', ''], ['Margetts', 'Lee', ''], ['Jivkov', 'Andrey', '']]","['Discrete exterior calculus', '3D elliptic problems', 'Parallelization', 'Structured materials', 'Impermeable interfaces', 'High-performance computing']"
8371,2005.06647,MohammadNoor Injadat,"MohammadNoor Injadat, Abdallah Moubayed, Ali Bou Nassif, Abdallah
  Shami",Systematic Ensemble Model Selection Approach for Educational Data Mining,"47 Pages, 20 figures, 13 tables, accepted in Elsevier's
  Knowledge-Based Systems",,10.1016/j.knosys.2020.105992,,cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A plethora of research has been done in the past focusing on predicting
student's performance in order to support their development. Many institutions
are focused on improving the performance and the education quality; and this
can be achieved by utilizing data mining techniques to analyze and predict
students' performance and to determine possible factors that may affect their
final marks. To address this issue, this work starts by thoroughly exploring
and analyzing two different datasets at two separate stages of course delivery
(20 percent and 50 percent respectively) using multiple graphical, statistical,
and quantitative techniques. The feature analysis provides insights into the
nature of the different features considered and helps in the choice of the
machine learning algorithms and their parameters. Furthermore, this work
proposes a systematic approach based on Gini index and p-value to select a
suitable ensemble learner from a combination of six potential machine learning
algorithms. Experimental results show that the proposed ensemble models achieve
high accuracy and low false positive rate at all stages for both datasets.
","[{'version': 'v1', 'created': 'Wed, 13 May 2020 22:25:58 GMT'}]",2020-05-15,"[['Injadat', 'MohammadNoor', ''], ['Moubayed', 'Abdallah', ''], ['Nassif', 'Ali Bou', ''], ['Shami', 'Abdallah', '']]","['e-Learning', 'Student Performance Prediction', 'Educational Data']"
8372,1909.09638,Sobhan Moosavi,"Sobhan Moosavi, Mohammad Hossein Samavatian, Srinivasan Parthasarathy,
  Radu Teodorescu, Rajiv Ramnath","Accident Risk Prediction based on Heterogeneous Sparse Data: New Dataset
  and Insights","In Proceedings of the 27th ACM SIGSPATIAL, International Conference
  on Advances in Geographic Information Systems (2019). arXiv admin note:
  substantial text overlap with arXiv:1906.05409",,10.1145/3347146.3359078,,cs.LG cs.DB stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reducing traffic accidents is an important public safety challenge,
therefore, accident analysis and prediction has been a topic of much research
over the past few decades. Using small-scale datasets with limited coverage,
being dependent on extensive set of data, and being not applicable for
real-time purposes are the important shortcomings of the existing studies. To
address these challenges, we propose a new solution for real-time traffic
accident prediction using easy-to-obtain, but sparse data. Our solution relies
on a deep-neural-network model (which we have named DAP, for Deep Accident
Prediction); which utilizes a variety of data attributes such as traffic
events, weather data, points-of-interest, and time. DAP incorporates multiple
components including a recurrent (for time-sensitive data), a fully connected
(for time-insensitive data), and a trainable embedding component (to capture
spatial heterogeneity). To fill the data gap, we have - through a comprehensive
process of data collection, integration, and augmentation - created a
large-scale publicly available database of accident information named
US-Accidents. By employing the US-Accidents dataset and through an extensive
set of experiments across several large cities, we have evaluated our proposal
against several baselines. Our analysis and results show significant
improvements to predict rare accident events. Further, we have shown the impact
of traffic information, time, and points-of-interest data for real-time
accident prediction.
","[{'version': 'v1', 'created': 'Thu, 19 Sep 2019 22:41:41 GMT'}]",2019-09-24,"[['Moosavi', 'Sobhan', ''], ['Samavatian', 'Mohammad Hossein', ''], ['Parthasarathy', 'Srinivasan', ''], ['Teodorescu', 'Radu', ''], ['Ramnath', 'Rajiv', '']]","['Accident Prediction', 'US-Accidents', 'Heterogeneous Data']"
8373,2208.05969,Jie Zhu,"Jie Zhu, Leye Wang, Xiao Han","Safety and Performance, Why not Both? Bi-Objective Optimized Model
  Compression toward AI Software Deployment",Accepted by ASE2022. Camera-ready Version,,10.1145/3551349.3556906,,cs.LG cs.CR cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The size of deep learning models in artificial intelligence (AI) software is
increasing rapidly, which hinders the large-scale deployment on
resource-restricted devices (e.g., smartphones). To mitigate this issue, AI
software compression plays a crucial role, which aims to compress model size
while keeping high performance. However, the intrinsic defects in the big model
may be inherited by the compressed one. Such defects may be easily leveraged by
attackers, since the compressed models are usually deployed in a large number
of devices without adequate protection. In this paper, we try to address the
safe model compression problem from a safety-performance co-optimization
perspective. Specifically, inspired by the test-driven development (TDD)
paradigm in software engineering, we propose a test-driven sparse training
framework called SafeCompress. By simulating the attack mechanism as the safety
test, SafeCompress can automatically compress a big model to a small one
following the dynamic sparse training paradigm. Further, considering a
representative attack, i.e., membership inference attack (MIA), we develop a
concrete safe model compression mechanism, called MIA-SafeCompress. Extensive
experiments are conducted to evaluate MIA-SafeCompress on five datasets for
both computer vision and natural language processing tasks. The results verify
the effectiveness and generalization of our method. We also discuss how to
adapt SafeCompress to other attacks besides MIA, demonstrating the flexibility
of SafeCompress.
","[{'version': 'v1', 'created': 'Thu, 11 Aug 2022 04:41:08 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Sep 2022 12:20:13 GMT'}]",2022-09-12,"[['Zhu', 'Jie', ''], ['Wang', 'Leye', ''], ['Han', 'Xiao', '']]","['AI software safe compression', 'test-driven development', 'membership inference attack']"
8374,1909.12640,Thomas-Peter Fries,"Thomas-Peter Fries, Daniel Sch\""ollhammer",A Unified Finite Strain Theory for Membranes and Ropes,"Research article has been submitted to Computer Methods in Applied
  Mechanics and Engineering",,10.1016/j.cma.2020.113031,,cs.CE cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The finite strain theory is reformulated in the frame of the Tangential
Differential Calculus (TDC) resulting in a unification in a threefold sense.
Firstly, ropes, membranes and three-dimensional continua are treated with one
set of governing equations. Secondly, the reformulated boundary value problem
applies to parametrized and implicit geometries. Therefore, the formulation is
more general than classical ones as it does not rely on parametrizations
implying curvilinear coordinate systems and the concept of co- and
contravariant base vectors. This leads to the third unification: TDC-based
models are applicable to two fundamentally different numerical approaches. On
the one hand, one may use the classical Surface FEM where the geometry is
discretized by curved one-dimensional elements for ropes and two-dimensional
surface elements for membranes. On the other hand, it also applies to recent
Trace FEM approaches where the geometry is immersed in a higher-dimensional
background mesh. Then, the shape functions of the background mesh are evaluated
on the trace of the immersed geometry and used for the approximation. As such,
the Trace FEM is a fictitious domain method for partial differential equations
on manifolds. The numerical results show that the proposed finite strain theory
yields higher-order convergence rates independent of the numerical methodology,
the dimension of the manifold, and the geometric representation type.
","[{'version': 'v1', 'created': 'Fri, 27 Sep 2019 12:12:38 GMT'}]",2020-04-22,"[['Fries', 'Thomas-Peter', ''], ['Schöllhammer', 'Daniel', '']]","['finite strain theory', 'ropes', 'membranes', 'Trace FEM', 'fictitious domain']"
8375,1702.03197,Abdulaziz Alayba,"Abdulaziz M. Alayba, Vasile Palade, Matthew England and Rahat Iqbal",Arabic Language Sentiment Analysis on Health Services,Authors accepted version of submission for ASAR 2017,"Proc. 1st International Workshop on Arabic Script Analysis and
  Recognition (ASAR '17), pp. 114-118. IEEE, 2017",10.1109/ASAR.2017.8067771,,cs.CL cs.NE cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The social media network phenomenon leads to a massive amount of valuable
data that is available online and easy to access. Many users share images,
videos, comments, reviews, news and opinions on different social networks
sites, with Twitter being one of the most popular ones. Data collected from
Twitter is highly unstructured, and extracting useful information from tweets
is a challenging task. Twitter has a huge number of Arabic users who mostly
post and write their tweets using the Arabic language. While there has been a
lot of research on sentiment analysis in English, the amount of researches and
datasets in Arabic language is limited. This paper introduces an Arabic
language dataset which is about opinions on health services and has been
collected from Twitter. The paper will first detail the process of collecting
the data from Twitter and also the process of filtering, pre-processing and
annotating the Arabic text in order to build a big sentiment analysis dataset
in Arabic. Several Machine Learning algorithms (Naive Bayes, Support Vector
Machine and Logistic Regression) alongside Deep and Convolutional Neural
Networks were utilized in our experiments of sentiment analysis on our health
dataset.
","[{'version': 'v1', 'created': 'Fri, 10 Feb 2017 14:59:14 GMT'}]",2017-11-02,"[['Alayba', 'Abdulaziz M.', ''], ['Palade', 'Vasile', ''], ['England', 'Matthew', ''], ['Iqbal', 'Rahat', '']]","['Sentiment Analysis', 'Machine Learning', 'Deep Neural Networks', 'Arabic Language']"
8376,2011.09285,Reza Fotohi,Maryam Faraji-Biregani and Reza Fotohi,"Secure communication between UAVs using a method based on smart agents
  in unmanned aerial vehicles","25 pages, 10 figures, 14 tables, JCR (Q2). J Supercomput (2020)",,10.1007/s11227-020-03462-0,,cs.CR cs.AI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Unmanned aerial vehicles (UAVs) can be deployed to monitor very large areas
without the need for network infrastructure. UAVs communicate with each other
during flight and exchange information with each other. However, such
communication poses security challenges due to its dynamic topology. To solve
these challenges, the proposed method uses two phases to counter malicious UAV
attacks. In the first phase, we applied a number of rules and principles to
detect malicious UAVs. In this phase, we try to identify and remove malicious
UAVs according to the behavior of UAVs in the network in order to prevent
sending fake information to the investigating UAVs. In the second phase, a
mobile agent based on a three-step negotiation process is used to eliminate
malicious UAVs. In this way, we use mobile agents to inform our normal neighbor
UAVs so that they do not listen to the data generated by the malicious UAVs.
Therefore, the mobile agent of each UAV uses reliable neighbors through a
three-step negotiation process so that they do not listen to the traffic
generated by the malicious UAVs. The NS-3 simulator was used to demonstrate the
efficiency of the SAUAV method. The proposed method is more efficient than
CST-UAS, CS-AVN, HVCR, and BSUM-based methods in detection rate, false positive
rate, false negative rate, packet delivery rate, and residual energy.
","[{'version': 'v1', 'created': 'Tue, 3 Nov 2020 10:33:39 GMT'}]",2020-11-19,"[['Faraji-Biregani', 'Maryam', ''], ['Fotohi', 'Reza', '']]","['Unmanned Aerial Vehicles (UAVs)', 'Malicious UAVs', 'Routing security']"
8377,1903.05962,Zhao Kang,"Zhao Kang, Liangjian Wen, Wenyu Chen, Zenglin Xu",Low-rank Kernel Learning for Graph-based Clustering,,"Knowledge-Based Systems, 2019",10.1016/j.knosys.2018.09.009,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Constructing the adjacency graph is fundamental to graph-based clustering.
Graph learning in kernel space has shown impressive performance on a number of
benchmark data sets. However, its performance is largely determined by the
chosen kernel matrix. To address this issue, the previous multiple kernel
learning algorithm has been applied to learn an optimal kernel from a group of
predefined kernels. This approach might be sensitive to noise and limits the
representation ability of the consensus kernel. In contrast to existing
methods, we propose to learn a low-rank kernel matrix which exploits the
similarity nature of the kernel matrix and seeks an optimal kernel from the
neighborhood of candidate kernels. By formulating graph construction and kernel
learning in a unified framework, the graph and consensus kernel can be
iteratively enhanced by each other. Extensive experimental results validate the
efficacy of the proposed method.
","[{'version': 'v1', 'created': 'Thu, 14 Mar 2019 12:59:52 GMT'}]",2019-03-15,"[['Kang', 'Zhao', ''], ['Wen', 'Liangjian', ''], ['Chen', 'Wenyu', ''], ['Xu', 'Zenglin', '']]","['Low-rank Kernel Matrix', 'Graph Construction', 'Multiple Kernel']"
8378,2301.05292,Nikolaos Zygouras Mr,Nikolaos Zygouras and Dimitrios Gunopulos,A Novel Framework for Handling Sparse Data in Traffic Forecast,,"In Proceedings of the 30th International Conference on Advances in
  Geographic Information Systems (pp. 1-4) 2022",10.1145/3557915.3560968,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ever increasing amount of GPS-equipped vehicles provides in real-time
valuable traffic information for the roads traversed by the moving vehicles. In
this way, a set of sparse and time evolving traffic reports is generated for
each road. These time series are a valuable asset in order to forecast the
future traffic condition. In this paper we present a deep learning framework
that encodes the sparse recent traffic information and forecasts the future
traffic condition. Our framework consists of a recurrent part and a decoder.
The recurrent part employs an attention mechanism that encodes the traffic
reports that are available at a particular time window. The decoder is
responsible to forecast the future traffic condition.
","[{'version': 'v1', 'created': 'Thu, 12 Jan 2023 21:07:04 GMT'}]",2023-01-16,"[['Zygouras', 'Nikolaos', ''], ['Gunopulos', 'Dimitrios', '']]","['travel time estimation', 'traffic forecasting', 'deep learning', 'transformer', 'GPS trajectories', 'mining mobility data']"
8379,2204.06901,Kosmas Pinitas,"Kosmas Pinitas, Konstantinos Makantasis, Antonios Liapis, Georgios N.
  Yannakakis","RankNEAT: Outperforming Stochastic Gradient Search in Preference
  Learning Tasks",,,10.1145/3512290.3528744,,cs.NE cs.AI cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stochastic gradient descent (SGD) is a premium optimization method for
training neural networks, especially for learning objectively defined labels
such as image objects and events. When a neural network is instead faced with
subjectively defined labels--such as human demonstrations or annotations--SGD
may struggle to explore the deceptive and noisy loss landscapes caused by the
inherent bias and subjectivity of humans. While neural networks are often
trained via preference learning algorithms in an effort to eliminate such data
noise, the de facto training methods rely on gradient descent. Motivated by the
lack of empirical studies on the impact of evolutionary search to the training
of preference learners, we introduce the RankNEAT algorithm which learns to
rank through neuroevolution of augmenting topologies. We test the hypothesis
that RankNEAT outperforms traditional gradient-based preference learning within
the affective computing domain, in particular predicting annotated player
arousal from the game footage of three dissimilar games. RankNEAT yields
superior performances compared to the gradient-based preference learner
(RankNet) in the majority of experiments since its architecture optimization
capacity acts as an efficient feature selection mechanism, thereby, eliminating
overfitting. Results suggest that RankNEAT is a viable and highly efficient
evolutionary alternative to preference learning.
","[{'version': 'v1', 'created': 'Thu, 14 Apr 2022 12:01:00 GMT'}]",2022-04-15,"[['Pinitas', 'Kosmas', ''], ['Makantasis', 'Konstantinos', ''], ['Liapis', 'Antonios', ''], ['Yannakakis', 'Georgios N.', '']]","['Preference learning', 'neuroevolution', 'NEAT', 'RankNet', 'vision transformers', 'stochastic gradient descent', 'affect modeling', 'computergames']"
8380,2001.06917,Jiaoyan Chen,"Jiaoyan Chen, Xi Chen, Ian Horrocks, Ernesto Jimenez-Ruiz, and Erik B.
  Myklebus",Correcting Knowledge Base Assertions,Accepted by The Web Conference (WWW) 2020,,10.1145/3366423.3380226,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The usefulness and usability of knowledge bases (KBs) is often limited by
quality issues. One common issue is the presence of erroneous assertions, often
caused by lexical or semantic confusion. We study the problem of correcting
such assertions, and present a general correction framework which combines
lexical matching, semantic embedding, soft constraint mining and semantic
consistency checking. The framework is evaluated using DBpedia and an
enterprise medical KB.
","[{'version': 'v1', 'created': 'Sun, 19 Jan 2020 23:03:47 GMT'}]",2020-01-22,"[['Chen', 'Jiaoyan', ''], ['Chen', 'Xi', ''], ['Horrocks', 'Ian', ''], ['Jimenez-Ruiz', 'Ernesto', ''], ['Myklebus', 'Erik B.', '']]","['Knowledge Base Quality', 'Assertion Correction', 'Semantic Embedding', 'Constraint Mining', 'Consistency Checking']"
8381,2007.06620,Xiaofeng Liu,"Xiaofeng Liu, Tong Che, Yiqun Lu, Chao Yang, Site Li, Jane You","AUTO3D: Novel view synthesis through unsupervisely learned variational
  viewpoint and global 3D representation",ECCV 2020,,10.1007/978-3-030-58545-7_4,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper targets on learning-based novel view synthesis from a single or
limited 2D images without the pose supervision. In the viewer-centered
coordinates, we construct an end-to-end trainable conditional variational
framework to disentangle the unsupervisely learned relative-pose/rotation and
implicit global 3D representation (shape, texture and the origin of
viewer-centered coordinates, etc.). The global appearance of the 3D object is
given by several appearance-describing images taken from any number of
viewpoints. Our spatial correlation module extracts a global 3D representation
from the appearance-describing images in a permutation invariant manner. Our
system can achieve implicitly 3D understanding without explicitly 3D
reconstruction. With an unsupervisely learned viewer-centered
relative-pose/rotation code, the decoder can hallucinate the novel view
continuously by sampling the relative-pose in a prior distribution. In various
applications, we demonstrate that our model can achieve comparable or even
better results than pose/3D model-supervised learning-based novel view
synthesis (NVS) methods with any number of input views.
","[{'version': 'v1', 'created': 'Mon, 13 Jul 2020 18:51:27 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Aug 2020 22:18:24 GMT'}]",2021-06-08,"[['Liu', 'Xiaofeng', ''], ['Che', 'Tong', ''], ['Lu', 'Yiqun', ''], ['Yang', 'Chao', ''], ['Li', 'Site', ''], ['You', 'Jane', '']]","['Unsupervised novel view synthesis', 'Viewer-centered coordinates', 'Variational viewpoints', 'Global 3D representation']"
8382,2001.07947,Thomas Spenke,"Thomas Spenke, Norbert Hosters, Marek Behr","A Multi-Vector Interface Quasi-Newton Method with Linear Complexity for
  Partitioned Fluid-Structure Interaction",,,10.1016/j.cma.2019.112810,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, interface quasi-Newton methods have gained growing attention
in the fluid-structure interaction community by significantly improving
partitioned solution schemes: They not only help to control the inherent
added-mass instability, but also prove to substantially speed up the coupling's
convergence. In this work, we present a novel variant: The key idea is to build
on the multi-vector Jacobian update scheme first presented by Bogaers et al.
(2014) and avoid any explicit representation of the (inverse) Jacobian
approximation, since it slows down the solution for large systems. Instead, all
terms involving a quadratic complexity have been systematically eliminated. The
result is a new multi-vector interface quasi-Newton variant whose computational
cost scales linearly with the problem size.
","[{'version': 'v1', 'created': 'Wed, 22 Jan 2020 10:31:27 GMT'}]",2020-01-23,"[['Spenke', 'Thomas', ''], ['Hosters', 'Norbert', ''], ['Behr', 'Marek', '']]","['Fluid-Structure Interaction', 'Interface Quasi-Newton Methods', 'Partitioned Algorithm']"
8383,2104.13969,Ryan Sander,"Jan Petrich, Ryan Sander, Eliza Bradley, Adam Dawood, Shawn Hough","On the Importance of 3D Surface Information for Remote Sensing
  Classification Tasks",Accepted to CODATA Data Science Journal,,10.5334/dsj-2021-020,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  There has been a surge in remote sensing machine learning applications that
operate on data from active or passive sensors as well as multi-sensor
combinations (Ma et al. (2019)). Despite this surge, however, there has been
relatively little study on the comparative value of 3D surface information for
machine learning classification tasks. Adding 3D surface information to RGB
imagery can provide crucial geometric information for semantic classes such as
buildings, and can thus improve out-of-sample predictive performance. In this
paper, we examine in-sample and out-of-sample classification performance of
Fully Convolutional Neural Networks (FCNNs) and Support Vector Machines (SVMs)
trained with and without 3D normalized digital surface model (nDSM)
information. We assess classification performance using multispectral imagery
from the International Society for Photogrammetry and Remote Sensing (ISPRS) 2D
Semantic Labeling contest and the United States Special Operations Command
(USSOCOM) Urban 3D Challenge. We find that providing RGB classifiers with
additional 3D nDSM information results in little increase in in-sample
classification performance, suggesting that spectral information alone may be
sufficient for the given classification tasks. However, we observe that
providing these RGB classifiers with additional nDSM information leads to
significant gains in out-of-sample predictive performance. Specifically, we
observe an average improvement in out-of-sample all-class accuracy of 14.4% on
the ISPRS dataset and an average improvement in out-of-sample F1 score of 8.6%
on the USSOCOM dataset. In addition, the experiments establish that nDSM
information is critical in machine learning and classification settings that
face training sample scarcity.
","[{'version': 'v1', 'created': 'Mon, 26 Apr 2021 19:55:51 GMT'}]",2021-07-29,"[['Petrich', 'Jan', ''], ['Sander', 'Ryan', ''], ['Bradley', 'Eliza', ''], ['Dawood', 'Adam', ''], ['Hough', 'Shawn', '']]","['Remote Sensing', '3D', 'Deep Learning', 'Classification', 'Data Fusion']"
8384,2104.06768,Augusto Luis Ballardini PhD,"Noelia Hern\'andez, Ignacio Parra, H\'ector Corrales, Rub\'en
  Izquierdo, Augusto Luis Ballardini, Carlota Salinas, Iv\'an Garcia",WiFiNet: WiFi-based indoor localisation using CNNs,,"Expert Systems with Applications, Volume 177, 1 September 2021",10.1016/j.eswa.2021.114906,,cs.LG cs.NI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Different technologies have been proposed to provide indoor localisation:
magnetic field, bluetooth , WiFi, etc. Among them, WiFi is the one with the
highest availability and highest accuracy. This fact allows for an ubiquitous
accurate localisation available for almost any environment and any device.
However, WiFi-based localisation is still an open problem.
  In this article, we propose a new WiFi-based indoor localisation system that
takes advantage of the great ability of Convolutional Neural Networks in
classification problems. Three different approaches were used to achieve this
goal: a custom architecture called WiFiNet designed and trained specifically to
solve this problem and the most popular pre-trained networks using both
transfer learning and feature extraction.
  Results indicate that WiFiNet is as a great approach for indoor localisation
in a medium-sized environment (30 positions and 113 access points) as it
reduces the mean localisation error (33%) and the processing time when compared
with state-of-the-art WiFi indoor localisation algorithms such as SVM.
","[{'version': 'v1', 'created': 'Wed, 14 Apr 2021 10:49:17 GMT'}]",2021-04-15,"[['Hernández', 'Noelia', ''], ['Parra', 'Ignacio', ''], ['Corrales', 'Héctor', ''], ['Izquierdo', 'Rubén', ''], ['Ballardini', 'Augusto Luis', ''], ['Salinas', 'Carlota', ''], ['Garcia', 'Iván', '']]","['Indoor localization', 'WiFi', 'Fingerprinting', 'Deep learning']"
8385,2110.08127,Italo Romani de Oliveira,\'Italo Romani de Oliveira,"Analyzing the performance of distributed conflict resolution among
  autonomous vehicles",,"Transportation Research Part B, Volume 96, February 2017, Pages
  92-112",10.1016/j.trb.2016.11.011,,cs.MA cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper presents a study on how cooperation versus non-cooperation, and
centralization versus distribution impact the performance of a traffic game of
autonomous vehicles. A model using a particle-based, Lagrange representation,
is developed, instead of a Eulerian, flow-based one, usual in routing problems
of the game-theoretical approach. This choice allows representation of
phenomena such as fuel exhaustion, vehicle collision, and wave propagation. The
elements necessary to represent interactions in a multi-agent transportation
system are defined, including a distributed, priority-based resource allocation
protocol, where resources are nodes and links in a spatial network and
individual routing strategies are performed. A fuel consumption dynamics is
developed in order to account for energy cost and vehicles having limited
range. The analysis shows that only the scenarios with cooperative resource
allocation can achieve optimal values of either collective cost or equity
coefficient, corresponding respectively to the centralized and to the
distributed cases.
","[{'version': 'v1', 'created': 'Fri, 8 Oct 2021 19:51:52 GMT'}]",2021-10-18,"[['de Oliveira', 'Ítalo Romani', '']]","['Multi-agent systems', 'Distributed control', 'Competition', 'Particle-based traffic', 'Energy efficiency']"
8386,2208.08624,Yuanpeng Tu,Yuanpeng Tu,"Domain Camera Adaptation and Collaborative Multiple Feature Clustering
  for Unsupervised Person Re-ID",ACMMM 2022 Workshop,,10.1145/3552458.3556446,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Recently unsupervised person re-identification (re-ID) has drawn much
attention due to its open-world scenario settings where limited annotated data
is available. Existing supervised methods often fail to generalize well on
unseen domains, while the unsupervised methods, mostly lack multi-granularity
information and are prone to suffer from confirmation bias. In this paper, we
aim at finding better feature representations on the unseen target domain from
two aspects, 1) performing unsupervised domain adaptation on the labeled source
domain and 2) mining potential similarities on the unlabeled target domain.
Besides, a collaborative pseudo re-labeling strategy is proposed to alleviate
the influence of confirmation bias. Firstly, a generative adversarial network
is utilized to transfer images from the source domain to the target domain.
Moreover, person identity preserving and identity mapping losses are introduced
to improve the quality of generated images. Secondly, we propose a novel
collaborative multiple feature clustering framework (CMFC) to learn the
internal data structure of target domain, including global feature and partial
feature branches. The global feature branch (GB) employs unsupervised
clustering on the global feature of person images while the Partial feature
branch (PB) mines similarities within different body regions. Finally,
extensive experiments on two benchmark datasets show the competitive
performance of our method under unsupervised person re-ID settings.
","[{'version': 'v1', 'created': 'Thu, 18 Aug 2022 03:56:48 GMT'}]",2022-08-19,"[['Tu', 'Yuanpeng', '']]","['Person re-identification', 'domain adaptation', 'multiple feature clustering']"
8387,2104.12175,Giovanni Iacca Prof.,"Enrico Zardini, Davide Zappetti, Davide Zambrano, Giovanni Iacca,
  Dario Floreano","Seeking Quality Diversity in Evolutionary Co-design of Morphology and
  Control of Soft Tensegrity Modular Robots","To be published in the proceedings of ACM Genetic and Evolutionary
  Computation Conference (GECCO) 2021",,10.1145/3449639.3459311,,cs.RO cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Designing optimal soft modular robots is difficult, due to non-trivial
interactions between morphology and controller. Evolutionary algorithms (EAs),
combined with physical simulators, represent a valid tool to overcome this
issue. In this work, we investigate algorithmic solutions to improve the
Quality Diversity of co-evolved designs of Tensegrity Soft Modular Robots
(TSMRs) for two robotic tasks, namely goal reaching and squeezing trough a
narrow passage. To this aim, we use three different EAs, i.e., MAP-Elites and
two custom algorithms: one based on Viability Evolution (ViE) and NEAT
(ViE-NEAT), the other named Double Map MAP-Elites (DM-ME) and devised to seek
diversity while co-evolving robot morphologies and neural network (NN)-based
controllers. In detail, DM-ME extends MAP-Elites in that it uses two distinct
feature maps, referring to morphologies and controllers respectively, and
integrates a mechanism to automatically define the NN-related feature
descriptor. Considering the fitness, in the goal-reaching task ViE-NEAT
outperforms MAP-Elites and results equivalent to DM-ME. Instead, when
considering diversity in terms of ""illumination"" of the feature space, DM-ME
outperforms the other two algorithms on both tasks, providing a richer pool of
possible robotic designs, whereas ViE-NEAT shows comparable performance to
MAP-Elites on goal reaching, although it does not exploit any map.
","[{'version': 'v1', 'created': 'Sun, 25 Apr 2021 14:49:59 GMT'}]",2021-04-27,"[['Zardini', 'Enrico', ''], ['Zappetti', 'Davide', ''], ['Zambrano', 'Davide', ''], ['Iacca', 'Giovanni', ''], ['Floreano', 'Dario', '']]","['Soft Tensegrity Modular Robots', 'Co-evolution', 'NEAT', 'ViabilityEvolution', 'MAP-Elites', 'Quality Diversity']"
8388,1911.00765,Jun Zhao,Jun Zhao,Adaptive Statistical Learning with Bayesian Differential Privacy,"WPES '17 Proceedings of the 2017 on Workshop on Privacy in the
  Electronic Society, held in conjunction with ACM SIGSAC 25th Annual
  Conference on Computer and Communications Security (CCS), Dallas, Texas, US,
  October 2017",,10.1145/3139550.3139556,,cs.LG cs.CR cs.CY stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In statistical learning, a dataset is often partitioned into two parts: the
training set and the holdout (i.e., testing) set. For instance, the training
set is used to learn a predictor, and then the holdout set is used for
estimating the accuracy of the predictor on the true distribution. However,
often in practice, the holdout dataset is reused and the estimates tested on
the holdout dataset are chosen adaptively based on the results of prior
estimates, leading to that the predictor may become dependent of the holdout
set. Hence, overfitting may occur, and the learned models may not generalize
well to the unseen datasets. Prior studies have established connections between
the stability of a learning algorithm and its ability to generalize, but the
traditional generalization is not robust to adaptive composition. Recently,
Dwork et al. in NIPS, STOC, and Science 2015 show that the holdout dataset from
i.i.d. data samples can be reused in adaptive statistical learning, if the
estimates are perturbed and coordinated using techniques developed for
differential privacy, which is a widely used notion to quantify privacy. Yet,
the results of Dwork et al. are applicable to only the case of i.i.d. samples.
In contrast, correlations between data samples exist because of various
behavioral, social, and genetic relationships between users. Our results in
adaptive statistical learning generalize the results of Dwork et al. for i.i.d.
data samples to arbitrarily correlated data. Specifically, we show that the
holdout dataset from correlated samples can be reused in adaptive statistical
learning, if the estimates are perturbed and coordinated using techniques
developed for Bayesian differential privacy, which is a privacy notion recently
introduced by Yang et al. in SIGMOD 2015 to broaden the application scenarios
of differential privacy when data records are correlated.
","[{'version': 'v1', 'created': 'Sat, 2 Nov 2019 18:45:31 GMT'}]",2019-11-05,"[['Zhao', 'Jun', '']]","['Statistical learning', 'data analysis', 'differential privacy', 'Bayesian differential privacy']"
8389,1910.03940,Mamdouh Farouk,Mamdouh Farouk,Measuring Sentences Similarity: A Survey,"11 pages, 2 figures, journal","Indian Journal of Science and Technology, Vol 12(25), July 2019",10.17485/ijst/2019/v12i25/143977,,cs.CL cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This study is to review the approaches used for measuring sentences
similarity. Measuring similarity between natural language sentences is a
crucial task for many Natural Language Processing applications such as text
classification, information retrieval, question answering, and plagiarism
detection. This survey classifies approaches of calculating sentences
similarity based on the adopted methodology into three categories. Word-to-word
based, structure based, and vector-based are the most widely used approaches to
find sentences similarity. Each approach measures relatedness between short
texts based on a specific perspective. In addition, datasets that are mostly
used as benchmarks for evaluating techniques in this field are introduced to
provide a complete view on this issue. The approaches that combine more than
one perspective give better results. Moreover, structure based similarity that
measures similarity between sentences structures needs more investigation.
","[{'version': 'v1', 'created': 'Sun, 6 Oct 2019 09:21:21 GMT'}]",2019-10-10,"[['Farouk', 'Mamdouh', '']]","['Sentence Representation', 'Sentences Similarity', 'Structural Similarity', 'Word Embedding', 'Words Similarity']"
8390,1410.2722,Giuseppe Toscani,G. Toscani,"A concavity property for the reciprocal of Fisher information and its
  consequences on Costa's EPI",,,10.1016/j.physa.2015.03.018,,cs.IT math-ph math.IT math.MP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove that the reciprocal of Fisher information of a log-concave
probability density $X$ in ${\bf{R}}^n$ is concave in $t$ with respect to the
addition of a Gaussian noise $Z_t = N(0, tI_n)$. As a byproduct of this result
we show that the third derivative of the entropy power of a log-concave
probability density $X$ in ${\bf{R}}^n$ is nonnegative in $t$ with respect to
the addition of a Gaussian noise $Z_t$. For log-concave densities this improves
the well-known Costa's concavity property of the entropy power.
","[{'version': 'v1', 'created': 'Fri, 10 Oct 2014 09:56:06 GMT'}]",2015-06-23,"[['Toscani', 'G.', '']]","['Entropy-power inequality', 'Blachman–Stam inequality', 'Costa’sconcavity property', 'log-concave functions']"
8391,2106.10652,Md Ziaul Haque Zim,Md Ziaul Haque Zim,"TinyML: Analysis of Xtensa LX6 microprocessor for Neural Network
  Applications by ESP32 SoC",,,10.13140/RG.2.2.28602.11204,,cs.LG cs.AR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In recent decades, Machine Learning (ML) has become extremely important for
many computing applications. The pervasiveness of ultra-low-power embedded
devices such as ESP32 or ESP32 Cam with tiny Machine Learning (tinyML)
applications will enable the mass proliferation of Artificial Intelligent
powered Embedded IoT Devices. In the last few years, the microcontroller device
(Espressif ESP32) became powerful enough to be used for small/tiny machine
learning (tinyML) tasks. The ease of use of platforms like Arduino IDE,
MicroPython and TensorFlow Lite (TF) with tinyML application make it an
indispensable topic of research for mobile robotics, modern computer science
and electrical engineering. The goal of this paper is to analyze the speed of
the Xtensa dual core 32-bit LX6 microprocessor by running a neural network
application. The different number of inputs (9, 36, 144 and 576) inputted
through the different number of neurons in neural networks with one and two
hidden layers. Xtensa LX6 microprocessor has been analyzed because it comes
inside with Espressif ESP32 and ESP32 Cam which are very easy to use, plug and
play IoT device. In this paper speed of the Xtensa LX6 microprocessor in
feed-forward mode has been analyzed.
","[{'version': 'v1', 'created': 'Sun, 20 Jun 2021 08:39:46 GMT'}]",2021-06-22,"[['Zim', 'Md Ziaul Haque', '']]","['TinyML', 'Xtensa LX6 microprocessor', 'Machine']"
8392,2108.09098,Lisa Koutsoviti Koumeri,"Gonzalo N\'apoles, Lisa Koutsoviti Koumeri","A fuzzy-rough uncertainty measure to discover bias encoded explicitly or
  implicitly in features of structured pattern classification datasets",,"Pattern Recognition Letters. 154(1), 2021",10.1016/j.patrec.2022.01.005,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The need to measure bias encoded in tabular data that are used to solve
pattern recognition problems is widely recognized by academia, legislators and
enterprises alike. In previous work, we proposed a bias quantification measure,
called fuzzy-rough uncer-tainty, which relies on the fuzzy-rough set theory.
The intuition dictates that protected features should not change the
fuzzy-rough boundary regions of a decision class significantly. The extent to
which this happens is a proxy for bias expressed as uncertainty in
adecision-making context. Our measure's main advantage is that it does not
depend on any machine learning prediction model but adistance function. In this
paper, we extend our study by exploring the existence of bias encoded
implicitly in non-protected featuresas defined by the correlation between
protected and unprotected attributes. This analysis leads to four scenarios
that domain experts should evaluate before deciding how to tackle bias. In
addition, we conduct a sensitivity analysis to determine the fuzzy operatorsand
distance function that best capture change in the boundary regions.
","[{'version': 'v1', 'created': 'Fri, 20 Aug 2021 10:27:32 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Jan 2022 18:08:22 GMT'}]",2022-01-24,"[['Nápoles', 'Gonzalo', ''], ['Koumeri', 'Lisa Koutsoviti', '']]","['bias', 'fairness', 'explainable machine learning', 'fuzzy-rough sets']"
8393,2001.01840,Waqas Ahmed,"Sheikh Muhammad Hizam, Waqas Ahmed","A Conceptual Paper on SERVQUAL-Framework for Assessing Quality of
  Internet of Things (IoT) Services","11 pages, 01 figure, 01 table","International Journal of Financial Research, Vol. 10, No. 5,
  Special Issue; 2019",10.5430/ijfr.v10n5p387,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Service quality possesses the vital prominence in usability of innovative
products and services. As technological innovation has made the life
synchronized and effective, Internet of Things (IoT) is matter of discussion
everywhere. From users' perspective, IoT services are always embraced by
various system characteristics of security and performance. A service quality
model can better present the preference of such technology customers. the study
intends to project theoretical model of service quality for internet of things
(IoT). Based on the existing models of service quality and the literature in
internet of things, a framework is proposed to conceptualize and measure
service quality for internet of things.This study established the IoT-Servqual
model with four dimensions (i.e., Privacy, Functionality, Efficiency, and
Tangibility) of multiple service quality models. These dimensions are essential
and inclined towards the users' leaning of IoT Services. This paper contributes
to research on internet of things services by development of a comprehensive
framework for customers' quality apprehension. This model will previse the
expression of information secrecy of users related with internet of things
(IoT). This research will advance understanding of service quality in modern
day technology and assist firms to devise the fruitful service structure.
","[{'version': 'v1', 'created': 'Mon, 6 Jan 2020 12:13:53 GMT'}]",2020-01-08,"[['Hizam', 'Sheikh Muhammad', ''], ['Ahmed', 'Waqas', '']]","['Internet of Things (IoT)', 'privacy', 'service quality', 'SERVQUAL']"
8394,2107.03200,Johannes Wachs,"Johannes Wachs, Mariusz Nitecki, William Schueller, Axel Polleres",The Geography of Open Source Software: Evidence from GitHub,,Technological Forecasting and Social Change (2022),10.1016/j.techfore.2022.121478,,cs.SI cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Open Source Software (OSS) plays an important role in the digital economy.
Yet although software production is amenable to remote collaboration and its
outputs are easily shared across distances, software development seems to
cluster geographically in places such as Silicon Valley, London, or Berlin. And
while recent work indicates that OSS activity creates positive externalities
which accrue locally through knowledge spillovers and information effects,
up-to-date data on the geographic distribution of active open source developers
is limited. This presents a significant blindspot for policymakers, who tend to
promote OSS at the national level as a cost-saving tool for public sector
institutions. We address this gap by geolocating more than half a million
active contributors to GitHub in early 2021 at various spatial scales. Compared
to results from 2010, we find a significant increase in the share of developers
based in Asia, Latin America and Eastern Europe, suggesting a more even spread
of OSS developers globally. Within countries, however, we find significant
concentration in regions, exceeding the concentration of workers in high-tech
fields. Social and economic development indicators predict at most half of
regional variation in OSS activity in the EU, suggesting that clusters of OSS
have idiosyncratic roots. We argue that policymakers seeking to foster OSS
should focus locally rather than nationally, using the tools of cluster policy
to support networks of OSS developers.
","[{'version': 'v1', 'created': 'Wed, 7 Jul 2021 13:18:17 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Oct 2021 08:25:28 GMT'}]",2022-01-26,"[['Wachs', 'Johannes', ''], ['Nitecki', 'Mariusz', ''], ['Schueller', 'William', ''], ['Polleres', 'Axel', '']]","['Geography', 'open source software', 'GitHub', 'innovation', 'cluster policy']"
8395,1909.03380,Xin Zhong,"Xin Zhong, Frank Y. Shih, Xiwang Guo",Automatic Image Pixel Clustering based on Mussels Wandering Optimiz,,,10.1142/S0218001421540057,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image segmentation as a clustering problem is to identify pixel groups on an
image without any preliminary labels available. It remains a challenge in
machine vision because of the variations in size and shape of image segments.
Furthermore, determining the segment number in an image is NP-hard without
prior knowledge of the image content. This paper presents an automatic color
image pixel clustering scheme based on mussels wandering optimization. By
applying an activation variable to determine the number of clusters along with
the cluster centers optimization, an image is segmented with minimal prior
knowledge and human intervention. By revising the within- and between-class sum
of squares ratio for random natural image contents, we provide a novel fitness
function for image pixel clustering tasks. Comprehensive empirical studies of
the proposed scheme against other state-of-the-art competitors on synthetic
data and the ASD dataset have demonstrated the promising performance of the
proposed scheme.
","[{'version': 'v1', 'created': 'Sun, 8 Sep 2019 03:18:11 GMT'}]",2020-07-07,"[['Zhong', 'Xin', ''], ['Shih', 'Frank Y.', ''], ['Guo', 'Xiwang', '']]","['Mussels wandering optimization', 'Image segmentation', 'Pixel clustering', 'Swarm']"
8396,2205.09151,Nirmalya Thakur,"Nirmalya Thakur, Cat Luong, and Chia Y. Han","An Approach to Investigate Public Opinion, Views, and Perspectives
  Towards Exoskeleton Technology","Proceedings of the 7th International Conference on Human Interaction
  & Emerging Technologies: Artificial Intelligence & Future Applications
  (IHIET-AI 2022), Lausanne, Switzerland, April 21-23, 2022",,10.54941/ahfe100860,,cs.HC cs.LG cs.RO cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Over the last decade, exoskeletons have had an extensive impact on different
disciplines and application domains such as assisted living, military,
healthcare, firefighting, and industries, on account of their diverse and
dynamic functionalities to augment human abilities, stamina, potential, and
performance in a multitude of ways. In view of this wide-scale applicability
and use-cases of exoskeletons, it is crucial to investigate and analyze the
public opinion, views, and perspectives towards exoskeletons which would help
to interpret the effectiveness of the underlining human-robot, human-machine,
and human-technology interactions. The Internet of Everything era of today's
living, characterized by people spending more time on the internet than ever
before, holds the potential for the investigation of the same by mining and
analyzing relevant web behavior, specifically from social media, that can be
interpreted to understand public opinion, views, and perspectives towards a
topic or set of topics. Therefore, this paper aims to address this research
challenge related to exoskeletons by utilizing the potential of web
behavior-based Big Data mining in the modern-day Internet of Everything era. As
Twitter is one of the most popular social media platforms on a global scale -
characterized by both the number of users and the amount of time spent by its
users on the platform - this work focused on investigating web behavior on
Twitter to interpret the public opinion, views, and perspectives towards
exoskeleton technology. A total of approximately 20,000 tweets related to
exoskeletons were used to evaluate the effectiveness of the proposed approach.
The results presented and discussed uphold the efficacy of the proposed
approach to interpret and analyze the public opinion, views, and perspectives
towards exoskeletons from the associated tweets.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2022 01:30:37 GMT'}]",2022-05-20,"[['Thakur', 'Nirmalya', ''], ['Luong', 'Cat', ''], ['Han', 'Chia Y.', '']]","['Exoskeleton', 'Internet of Everything', 'Big Data', 'Sentiment Analysis', 'Human-Computer Interaction', 'Tweets', 'Natural Language Processing']"
8397,1904.12401,Simon Tindemans,Simon Tindemans and Goran Strbac,"Low-complexity control algorithm for decentralised demand response using
  thermostatic loads",,,10.1109/EEEIC.2019.8783359,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Thermostatically controlled loads such as refrigerators are exceptionally
suitable as a flexible demand resource. This paper derives a decentralised load
control algorithm for refrigerators. It is adapted from an existing continuous
time control approach, with the aim to achieve low computational complexity and
an ability to handle discrete time steps of variable length -- desirable
features for embedding in appliances and high-throughput simulations.
Simulation results of large populations of heterogeneous appliances illustrate
the accurate aggregate control of power consumption and high computational
efficiency.
","[{'version': 'v1', 'created': 'Sun, 28 Apr 2019 23:50:10 GMT'}]",2019-08-09,"[['Tindemans', 'Simon', ''], ['Strbac', 'Goran', '']]","['thermostatically controlled loads', 'demand response', 'decentralized control', 'aggregate control']"
8398,2204.09533,Samanta Dey,"Samanta Dey (1), Venkatesh Vinayakarao (1), Monika Gupta (2), Sampath
  Dechu (2) ((1) Chennai Mathematical Institute, (2) IBM Research)",Evaluating Commit Message Generation: To BLEU Or Not To BLEU?,"6 pages, 3 tables, ICSE-NIER 2022 Conference",,10.1145/3510455.3512790,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Commit messages play an important role in several software engineering tasks
such as program comprehension and understanding program evolution. However,
programmers neglect to write good commit messages. Hence, several Commit
Message Generation (CMG) tools have been proposed. We observe that the recent
state of the art CMG tools use simple and easy to compute automated evaluation
metrics such as BLEU4 or its variants. The advances in the field of Machine
Translation (MT) indicate several weaknesses of BLEU4 and its variants. They
also propose several other metrics for evaluating Natural Language Generation
(NLG) tools. In this work, we discuss the suitability of various MT metrics for
the CMG task. Based on the insights from our experiments, we propose a new
variant specifically for evaluating the CMG task. We re-evaluate the state of
the art CMG tools on our new metric. We believe that our work fixes an
important gap that exists in the understanding of evaluation metrics for CMG
research.
","[{'version': 'v1', 'created': 'Wed, 20 Apr 2022 15:15:50 GMT'}]",2022-04-21,"[['Dey', 'Samanta', '', 'Chennai Mathematical Institute'], ['Vinayakarao', 'Venkatesh', '', 'Chennai Mathematical Institute'], ['Gupta', 'Monika', '', 'IBM Research'], ['Dechu', 'Sampath', '', 'IBM Research']]","['BLEU', 'METEOR', 'Commit Message Generation']"
8399,1307.1770,Nazim Burak Karahanoglu,"Nazim Burak Karahanoglu, Hakan Erdogan","Improving A*OMP: Theoretical and Empirical Analyses With a Novel Dynamic
  Cost Model",,Signal Processing 118 (2016) 62-74,10.1016/j.sigpro.2015.06.011,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Best-first search has been recently utilized for compressed sensing (CS) by
the A* orthogonal matching pursuit (A*OMP) algorithm. In this work, we
concentrate on theoretical and empirical analyses of A*OMP. We present a
restricted isometry property (RIP) based general condition for exact recovery
of sparse signals via A*OMP. In addition, we develop online guarantees which
promise improved recovery performance with the residue-based termination
instead of the sparsity-based one. We demonstrate the recovery capabilities of
A*OMP with extensive recovery simulations using the adaptive-multiplicative
(AMul) cost model, which effectively compensates for the path length
differences in the search tree. The presented results, involving phase
transitions for different nonzero element distributions as well as recovery
rates and average error, reveal not only the superior recovery accuracy of
A*OMP, but also the improvements with the residue-based termination and the
AMul cost model. Comparison of the run times indicate the speed up by the AMul
cost model. We also demonstrate a hybrid of OMP and A?OMP to accelerate the
search further. Finally, we run A*OMP on a sparse image to illustrate its
recovery performance for more realistic coefcient distributions.
","[{'version': 'v1', 'created': 'Sat, 6 Jul 2013 10:35:26 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Apr 2015 13:14:47 GMT'}, {'version': 'v3', 'created': 'Fri, 10 Jul 2015 11:33:54 GMT'}]",2016-11-26,"[['Karahanoglu', 'Nazim Burak', ''], ['Erdogan', 'Hakan', '']]","['compressed sensing', 'A⋆ orthogonal matching pursuit', 'restricted isometry property', 'adaptive-multiplicativecost model']"
8400,2005.10788,Anastasiya Gorodilova,Anastasiya Gorodilova,"A note on the properties of associated Boolean functions of quadratic
  APN functions",,"Prikladnaya Diskretnaya Matematika. 2020. No 47, pp 16-21",10.17223/20710410/47/2,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $F$ be a quadratic APN function of $n$ variables. The associated Boolean
function $\gamma_F$ in $2n$ variables ($\gamma_F(a,b)=1$ if $a\neq{\bf 0}$ and
equation $F(x)+F(x+a)=b$ has solutions) has the form $\gamma_F(a,b) = \Phi_F(a)
\cdot b + \varphi_F(a) + 1$ for appropriate functions $\Phi_F:\mathbb{F}_2^n\to
\mathbb{F}_2^n$ and $\varphi_F:\mathbb{F}_2^n\to \mathbb{F}_2$. We summarize
the known results and prove new ones regarding properties of $\Phi_F$ and
$\varphi_F$. For instance, we prove that degree of $\Phi_F$ is either $n$ or
less or equal to $n-2$. Based on computation experiments, we formulate a
conjecture that degree of any component function of $\Phi_F$ is $n-2$. We show
that this conjecture is based on two other conjectures of independent interest.
","[{'version': 'v1', 'created': 'Thu, 21 May 2020 17:10:53 GMT'}]",2020-05-22,"[['Gorodilova', 'Anastasiya', '']]","['A quadratic APN function', 'the associated Boolean function', 'degree of a function']"
8401,2112.12095,Islam Debicha,"Islam Debicha, Thibault Debatty, Jean-Michel Dricot, Wim Mees, Tayeb
  Kenaza","Detect & Reject for Transferability of Black-box Adversarial Attacks
  Against Network Intrusion Detection Systems",,"Debicha, Islam, et al. ""Detect & Reject for Transferability of
  Black-Box Adversarial Attacks Against Network Intrusion Detection Systems.""
  International Conference on Advances in Cyber Security. Springer, Singapore,
  2021",10.1007/978-981-16-8059-5_20,,cs.CR cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In the last decade, the use of Machine Learning techniques in anomaly-based
intrusion detection systems has seen much success. However, recent studies have
shown that Machine learning in general and deep learning specifically are
vulnerable to adversarial attacks where the attacker attempts to fool models by
supplying deceptive input. Research in computer vision, where this
vulnerability was first discovered, has shown that adversarial images designed
to fool a specific model can deceive other machine learning models. In this
paper, we investigate the transferability of adversarial network traffic
against multiple machine learning-based intrusion detection systems.
Furthermore, we analyze the robustness of the ensemble intrusion detection
system, which is notorious for its better accuracy compared to a single model,
against the transferability of adversarial attacks. Finally, we examine Detect
& Reject as a defensive mechanism to limit the effect of the transferability
property of adversarial network traffic against machine learning-based
intrusion detection systems.
","[{'version': 'v1', 'created': 'Wed, 22 Dec 2021 17:54:54 GMT'}]",2021-12-23,"[['Debicha', 'Islam', ''], ['Debatty', 'Thibault', ''], ['Dricot', 'Jean-Michel', ''], ['Mees', 'Wim', ''], ['Kenaza', 'Tayeb', '']]","['intrusion detection', 'machine learning', 'adversarial attacks', 'Transferability', 'black-box settings']"
8402,2204.09989,Jianlei Yang,"Yinglin Zhao, Jianlei Yang, Bing Li, Xingzhou Cheng, Xucheng Ye,
  Xueyan Wang, Xiaotao Jia, Zhaohao Wang, Youguang Zhang, Weisheng Zhao","NAND-SPIN-Based Processing-in-MRAM Architecture for Convolutional Neural
  Network Acceleration","15 pages, accepted by SCIENCE CHINA Information Sciences (SCIS) 2022",,10.1007/s11432-021-3472-9,,cs.AR cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The performance and efficiency of running large-scale datasets on traditional
computing systems exhibit critical bottlenecks due to the existing ""power wall""
and ""memory wall"" problems. To resolve those problems, processing-in-memory
(PIM) architectures are developed to bring computation logic in or near memory
to alleviate the bandwidth limitations during data transmission. NAND-like
spintronics memory (NAND-SPIN) is one kind of promising magnetoresistive
random-access memory (MRAM) with low write energy and high integration density,
and it can be employed to perform efficient in-memory computation operations.
In this work, we propose a NAND-SPIN-based PIM architecture for efficient
convolutional neural network (CNN) acceleration. A straightforward data mapping
scheme is exploited to improve the parallelism while reducing data movements.
Benefiting from the excellent characteristics of NAND-SPIN and in-memory
processing architecture, experimental results show that the proposed approach
can achieve $\sim$2.6$\times$ speedup and $\sim$1.4$\times$ improvement in
energy efficiency over state-of-the-art PIM solutions.
","[{'version': 'v1', 'created': 'Thu, 21 Apr 2022 09:32:51 GMT'}]",2022-04-22,"[['Zhao', 'Yinglin', ''], ['Yang', 'Jianlei', ''], ['Li', 'Bing', ''], ['Cheng', 'Xingzhou', ''], ['Ye', 'Xucheng', ''], ['Wang', 'Xueyan', ''], ['Jia', 'Xiaotao', ''], ['Wang', 'Zhaohao', ''], ['Zhang', 'Youguang', ''], ['Zhao', 'Weisheng', '']]","['Processing-in-memory', 'Convolutional neural network', 'NAND-like spintronics memory', 'Nonvolatile memory', 'Magnetic tunnel junction']"
8403,2001.03525,Fei Ma,"Fei Ma, Xiaomin Wang, Ping Wang","Counterexample: scale-free networked graphs with invariable diameter and
  density feature",,"Phys. Rev. E 101, 022315 (2020)",10.1103/PhysRevE.101.022315,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Here, we propose a class of scale-free networks $G(t;m)$ with some intriguing
properties, which can not be simultaneously held by all the theoretical models
with power-law degree distribution in the existing literature, including (i)
average degrees $\langle k\rangle$ of all the generated networks are no longer
a constant in the limit of large graph size, implying that they are not sparse
but dense, (ii) power-law parameters $\gamma$ of these networks are precisely
calculated equal to $2$, as well (iii) their diameters $D$ are all an invariant
in the growth process of models. While our models have deterministic structure
with clustering coefficients equivalent to zero, we might be able to obtain
various candidates with nonzero clustering coefficient based on original
networks using some reasonable approaches, for instance, randomly adding some
new edges under the premise of keeping the three important properties above
unchanged. In addition, we study trapping problem on networks $G(t;m)$ and then
obtain closed-form solution to mean hitting time $\langle
\mathcal{H}\rangle_{t}$. As opposed to other previous models, our results show
an unexpected phenomenon that the analytic value for $\langle
\mathcal{H}\rangle_{t}$ is approximately close to the logarithm of vertex
number of networks $G(t;m)$. From the theoretical point of view, these
networked models considered here can be thought of as counterexamples for most
of the published models obeying power-law distribution in current study.
","[{'version': 'v1', 'created': 'Mon, 2 Dec 2019 03:36:47 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Oct 2020 09:29:37 GMT'}]",2020-10-29,"[['Ma', 'Fei', ''], ['Wang', 'Xiaomin', ''], ['Wang', 'Ping', '']]","['Scale-free graphs', 'Small-world', 'Assortative mixing', 'Trapping problem']"
8404,1811.07768,Edgard Chammas,"Edgard Chammas, Chafic Mokbel, Laurence Likforman-Sulem",Handwriting Recognition of Historical Documents with few labeled data,,,10.1109/DAS.2018.15,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Historical documents present many challenges for offline handwriting
recognition systems, among them, the segmentation and labeling steps. Carefully
annotated textlines are needed to train an HTR system. In some scenarios,
transcripts are only available at the paragraph level with no text-line
information. In this work, we demonstrate how to train an HTR system with few
labeled data. Specifically, we train a deep convolutional recurrent neural
network (CRNN) system on only 10% of manually labeled text-line data from a
dataset and propose an incremental training procedure that covers the rest of
the data. Performance is further increased by augmenting the training set with
specially crafted multiscale data. We also propose a model-based normalization
scheme which considers the variability in the writing scale at the recognition
phase. We apply this approach to the publicly available READ dataset. Our
system achieved the second best result during the ICDAR2017 competition.
","[{'version': 'v1', 'created': 'Sat, 10 Nov 2018 23:21:12 GMT'}]",2018-11-20,"[['Chammas', 'Edgard', ''], ['Mokbel', 'Chafic', ''], ['Likforman-Sulem', 'Laurence', '']]","['CRNN', 'handwriting recognition', 'historical documents', 'variability', 'multi-scale training', 'model-based normalization scheme', 'limited labeled data']"
8405,2205.13130,Kamil Khan,"Kamil Khan, Sudeep Pasricha, and Ryan Gary Kim","RACE: A Reinforcement Learning Framework for Improved Adaptive Control
  of NoC Channel Buffers","6 pages, 8 figures, 3 tables",,10.1145/3526241.3530335,,cs.AR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network-on-chip (NoC) architectures rely on buffers to store flits to cope
with contention for router resources during packet switching. Recently,
reversible multi-function channel (RMC) buffers have been proposed to
simultaneously reduce power and enable adaptive NoC buffering between adjacent
routers. While adaptive buffering can improve NoC performance by maximizing
buffer utilization, controlling the RMC buffer allocations requires a
congestion-aware, scalable, and proactive policy. In this work, we present
RACE, a novel reinforcement learning (RL) framework that utilizes better
awareness of network congestion and a new reward metric (""falsefulls"") to help
guide the RL agent towards better RMC buffer control decisions. We show that
RACE reduces NoC latency by up to 48.9%, and energy consumption by up to 47.1%
against state-of-the-art NoC buffer control policies.
","[{'version': 'v1', 'created': 'Thu, 26 May 2022 03:33:44 GMT'}]",2022-05-27,"[['Khan', 'Kamil', ''], ['Pasricha', 'Sudeep', ''], ['Kim', 'Ryan Gary', '']]","['Network-on-chip', 'machine learning', 'dynamic buffering']"
8406,2002.06100,Emile van Krieken,"Emile van Krieken, Erman Acar, Frank van Harmelen",Analyzing Differentiable Fuzzy Logic Operators,"47 pages, 18 figures. V2: Added analysis for existential
  quantification. Improved experiments and writing",,10.1016/j.artint.2021.103602,,cs.AI cs.LG cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The AI community is increasingly putting its attention towards combining
symbolic and neural approaches, as it is often argued that the strengths and
weaknesses of these approaches are complementary. One recent trend in the
literature are weakly supervised learning techniques that employ operators from
fuzzy logics. In particular, these use prior background knowledge described in
such logics to help the training of a neural network from unlabeled and noisy
data. By interpreting logical symbols using neural networks, this background
knowledge can be added to regular loss functions, hence making reasoning a part
of learning. We study, both formally and empirically, how a large collection of
logical operators from the fuzzy logic literature behave in a differentiable
learning setting. We find that many of these operators, including some of the
most well-known, are highly unsuitable in this setting. A further finding
concerns the treatment of implication in these fuzzy logics, and shows a strong
imbalance between gradients driven by the antecedent and the consequent of the
implication. Furthermore, we introduce a new family of fuzzy implications
(called sigmoidal implications) to tackle this phenomenon. Finally, we
empirically show that it is possible to use Differentiable Fuzzy Logics for
semi-supervised learning, and compare how different operators behave in
practice. We find that, to achieve the largest performance improvement over a
supervised baseline, we have to resort to non-standard combinations of logical
operators which perform well in learning, but no longer satisfy the usual
logical laws.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 16:11:36 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Aug 2021 08:25:41 GMT'}]",2021-10-12,"[['van Krieken', 'Emile', ''], ['Acar', 'Erman', ''], ['van Harmelen', 'Frank', '']]","['Fuzzy logic', 'Neural-symbolic AI', 'Learning with constraints']"
8407,2203.09611,Yuhao Kang,"Yuhao Kang, Kunlin Wu, Song Gao, Ignavier Ng, Jinmeng Rao, Shan Ye,
  Fan Zhang, Teng Fei","STICC: A multivariate spatial clustering method for repeated geographic
  pattern discovery with consideration of spatial contiguity",,"International Journal of Geographical Information Science, Year
  2022",10.1080/13658816.2022.2053980,,cs.LG cs.AI cs.DB cs.SI stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Spatial clustering has been widely used for spatial data mining and knowledge
discovery. An ideal multivariate spatial clustering should consider both
spatial contiguity and aspatial attributes. Existing spatial clustering
approaches may face challenges for discovering repeated geographic patterns
with spatial contiguity maintained. In this paper, we propose a Spatial
Toeplitz Inverse Covariance-Based Clustering (STICC) method that considers both
attributes and spatial relationships of geographic objects for multivariate
spatial clustering. A subregion is created for each geographic object serving
as the basic unit when performing clustering. A Markov random field is then
constructed to characterize the attribute dependencies of subregions. Using a
spatial consistency strategy, nearby objects are encouraged to belong to the
same cluster. To test the performance of the proposed STICC algorithm, we apply
it in two use cases. The comparison results with several baseline methods show
that the STICC outperforms others significantly in terms of adjusted rand index
and macro-F1 score. Join count statistics is also calculated and shows that the
spatial contiguity is well preserved by STICC. Such a spatial clustering method
may benefit various applications in the fields of geography, remote sensing,
transportation, and urban planning, etc.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2022 20:58:06 GMT'}, {'version': 'v2', 'created': 'Thu, 31 Mar 2022 03:47:27 GMT'}]",2022-04-01,"[['Kang', 'Yuhao', ''], ['Wu', 'Kunlin', ''], ['Gao', 'Song', ''], ['Ng', 'Ignavier', ''], ['Rao', 'Jinmeng', ''], ['Ye', 'Shan', ''], ['Zhang', 'Fan', ''], ['Fei', 'Teng', '']]","['*Corresponding Author Song Gao', 'Email song', 'gao@wisc']"
8408,2210.06159,Yu Wei Tan,"Yu Wei Tan, Xiaohan Cui and Anand Bhojan","Hybrid MBlur: A Systematic Approach to Augment Rasterization with Ray
  Tracing for Rendering Motion Blur in Games",,,10.5220/0010984700003124,,cs.GR,http://creativecommons.org/licenses/by/4.0/,"  Motion blur is commonly used in game cinematics to achieve photorealism by
modelling the behaviour of the camera shutter and simulating its effect
associated with the relative motion of scene objects. A common real-time
post-process approach is spatial sampling, where the directional blur of a
moving object is rendered by integrating its colour based on velocity
information within a single frame. However, such screen space approaches
typically cannot produce accurate partial occlusion semi-transparencies. Our
real-time hybrid rendering technique leverages hardware-accelerated ray tracing
to correct post-process partial occlusion artifacts by advancing rays
recursively into the scene to retrieve background information for
motion-blurred regions, with reasonable additional performance cost for
rendering game contents. We extend our previous work with details on the
design, implementation, and future work of the technique as well as performance
comparisons with post-processing.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2022 11:45:29 GMT'}]",2022-10-13,"[['Tan', 'Yu Wei', ''], ['Cui', 'Xiaohan', ''], ['Bhojan', 'Anand', '']]","['Real-time', 'Motion Blur', 'Ray Tracing', 'Post-processing', 'Hybrid Rendering', 'Games']"
8409,2208.05895,Aghiles Ait Messaoud,"Aghiles Ait Messaoud and Sonia Ben Mokhtar and Vlad Nitu and Valerio
  Schiavoni","Shielding Federated Learning Systems against Inference Attacks with ARM
  TrustZone","This publication incorporates results from the VEDLIoT project, which
  received funding from the European Union's Horizon 2020 research and
  innovation programme under grant agreement No 957197",,10.1145/3528535.3565255,,cs.CR cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Federated Learning (FL) opens new perspectives for training machine learning
models while keeping personal data on the users premises. Specifically, in FL,
models are trained on the users devices and only model updates (i.e.,
gradients) are sent to a central server for aggregation purposes. However, the
long list of inference attacks that leak private data from gradients, published
in the recent years, have emphasized the need of devising effective protection
mechanisms to incentivize the adoption of FL at scale. While there exist
solutions to mitigate these attacks on the server side, little has been done to
protect users from attacks performed on the client side. In this context, the
use of Trusted Execution Environments (TEEs) on the client side are among the
most proposing solutions. However, existing frameworks (e.g., DarkneTZ) require
statically putting a large portion of the machine learning model into the TEE
to effectively protect against complex attacks or a combination of attacks. We
present GradSec, a solution that allows protecting in a TEE only sensitive
layers of a machine learning model, either statically or dynamically, hence
reducing both the TCB size and the overall training time by up to 30% and 56%,
respectively compared to state-of-the-art competitors.
","[{'version': 'v1', 'created': 'Thu, 11 Aug 2022 15:53:07 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Aug 2022 09:49:16 GMT'}, {'version': 'v3', 'created': 'Fri, 19 Aug 2022 10:06:13 GMT'}, {'version': 'v4', 'created': 'Sat, 15 Oct 2022 09:55:28 GMT'}]",2022-10-18,"[['Messaoud', 'Aghiles Ait', ''], ['Mokhtar', 'Sonia Ben', ''], ['Nitu', 'Vlad', ''], ['Schiavoni', 'Valerio', '']]","['Federated Learning', 'privacy', 'Trusted Execution Environment', 'TrustZone']"
8410,1604.05797,Andrew Connor,"Stefan Marks, Javier E. Estevez and Andy M. Connor","Towards the Holodeck: Fully Immersive Virtual Reality Visualisation of
  Scientific and Engineering Data",,,10.1145/2683405.2683424,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we describe the development and operating principles of an
immersive virtual reality (VR) visualisation environment that is designed
around the use of consumer VR headsets in an existing wide area motion capture
suite. We present two case studies in the application areas of visualisation of
scientific and engineering data. Each of these case studies utilise a different
render engine, namely a custom engine for one case and a commercial game engine
for the other. The advantages and appropriateness of each approach are
discussed along with suggestions for future work.
","[{'version': 'v1', 'created': 'Wed, 20 Apr 2016 02:54:21 GMT'}]",2016-04-21,"[['Marks', 'Stefan', ''], ['Estevez', 'Javier E.', ''], ['Connor', 'Andy M.', '']]","['Virtual reality', 'visualization', 'immersion']"
8411,2106.05059,Dominic Jud,"Dominic Jud, Simon Kerscher, Martin Wermelinger, Edo Jelavic, Pascal
  Egli, Philipp Leemann, Gabriel Hottiger, Marco Hutter",HEAP -- The autonomous walking excavator,,"Automation in Construction, Volume 129, September 2021, 103783",10.1016/j.autcon.2021.103783,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  The demand and the potential for automation in the construction sector is
unmatched, particularly for increasing environmental sustainability, improving
worker safety and reducing labor shortages. We have developed an autonomous
walking excavator - based one of the most versatile machines found on
construction sites - as one way to begin fulfilling this potential. This
article describes the process of converting an off-the-shelf construction
machine into an autonomous robotic system. First we outline the necessary
sensing equipment for full autonomy and the novel actuation of the legs, and
compare three different complementary actuation principles for the excavator's
arm. Second, we solve the state estimation problem for a general wheeled-legged
robot. Beside kinematic measurements, it includes GNSS-RTK, to absolutely
reference the machine on a construction site. Third, we developed individual
controllers for driving, chassis balancing and arm motions allowing for fully
autonomous operation. Lastly, we highlight the machine's potential in four
different real-world applications, e.g. autonomous trench digging, autonomous
assembly of dry stone walls, autonomous forestry work and semi-autonomous
teleoperation. On top, we also share some development insights and possible
future research directions.
","[{'version': 'v1', 'created': 'Wed, 9 Jun 2021 13:27:59 GMT'}]",2021-06-10,"[['Jud', 'Dominic', ''], ['Kerscher', 'Simon', ''], ['Wermelinger', 'Martin', ''], ['Jelavic', 'Edo', ''], ['Egli', 'Pascal', ''], ['Leemann', 'Philipp', ''], ['Hottiger', 'Gabriel', ''], ['Hutter', 'Marco', '']]","['Autonomy', 'Walking Excavator', 'Construction Robotics']"
8412,2004.08514,Zhengyang Feng,"Zhengyang Feng, Qianyu Zhou, Qiqi Gu, Xin Tan, Guangliang Cheng,
  Xuequan Lu, Jianping Shi, Lizhuang Ma",DMT: Dynamic Mutual Training for Semi-Supervised Learning,"Published at Pattern Recognition, see
  https://www.sciencedirect.com/science/article/abs/pii/S0031320322002588",,10.1016/j.patcog.2022.108777,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent semi-supervised learning methods use pseudo supervision as core idea,
especially self-training methods that generate pseudo labels. However, pseudo
labels are unreliable. Self-training methods usually rely on single model
prediction confidence to filter low-confidence pseudo labels, thus remaining
high-confidence errors and wasting many low-confidence correct labels. In this
paper, we point out it is difficult for a model to counter its own errors.
Instead, leveraging inter-model disagreement between different models is a key
to locate pseudo label errors. With this new viewpoint, we propose mutual
training between two different models by a dynamically re-weighted loss
function, called Dynamic Mutual Training (DMT). We quantify inter-model
disagreement by comparing predictions from two different models to dynamically
re-weight loss in training, where a larger disagreement indicates a possible
error and corresponds to a lower loss value. Extensive experiments show that
DMT achieves state-of-the-art performance in both image classification and
semantic segmentation. Our codes are released at
https://github.com/voldemortX/DST-CBC .
","[{'version': 'v1', 'created': 'Sat, 18 Apr 2020 03:12:55 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Dec 2020 03:23:27 GMT'}, {'version': 'v3', 'created': 'Wed, 10 Feb 2021 02:04:24 GMT'}, {'version': 'v4', 'created': 'Wed, 11 May 2022 10:23:22 GMT'}]",2022-05-12,"[['Feng', 'Zhengyang', ''], ['Zhou', 'Qianyu', ''], ['Gu', 'Qiqi', ''], ['Tan', 'Xin', ''], ['Cheng', 'Guangliang', ''], ['Lu', 'Xuequan', ''], ['Shi', 'Jianping', ''], ['Ma', 'Lizhuang', '']]","['dynamic mutual training', 'inter-model disagreement', 'noisy pseudo']"
8413,2110.01476,Valerio Biscione,Valerio Biscione and Jeffrey S. Bowers,"Learning Online Visual Invariances for Novel Objects via Supervised and
  Self-Supervised Training",,"Neural Networks, Volume 150, 2022, Pages 222-236, ISSN 0893-6080,",10.1016/j.neunet.2022.02.017,,cs.CV cs.AI,http://creativecommons.org/licenses/by-sa/4.0/,"  Humans can identify objects following various spatial transformations such as
scale and viewpoint. This extends to novel objects, after a single presentation
at a single pose, sometimes referred to as online invariance. CNNs have been
proposed as a compelling model of human vision, but their ability to identify
objects across transformations is typically tested on held-out samples of
trained categories after extensive data augmentation. This paper assesses
whether standard CNNs can support human-like online invariance by training
models to recognize images of synthetic 3D objects that undergo several
transformations: rotation, scaling, translation, brightness, contrast, and
viewpoint. Through the analysis of models' internal representations, we show
that standard supervised CNNs trained on transformed objects can acquire strong
invariances on novel classes even when trained with as few as 50 objects taken
from 10 classes. This extended to a different dataset of photographs of real
objects. We also show that these invariances can be acquired in a
self-supervised way, through solving the same/different task. We suggest that
this latter approach may be similar to how humans acquire invariances.
","[{'version': 'v1', 'created': 'Mon, 4 Oct 2021 14:29:43 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Oct 2021 05:36:56 GMT'}, {'version': 'v3', 'created': 'Fri, 14 Jan 2022 17:03:01 GMT'}]",2022-04-05,"[['Biscione', 'Valerio', ''], ['Bowers', 'Jeffrey S.', '']]","['invariant representation', 'internal representation', 'convolutionalneural networks', 'unsupervised learning', 'online invariance']"
8414,1912.10389,Eun Seo Jo,"Eun Seo Jo, Timnit Gebru","Lessons from Archives: Strategies for Collecting Sociocultural Data in
  Machine Learning","To be published in Conference on Fairness, Accountability, and
  Transparency FAT* '20, January 27-30, 2020, Barcelona, Spain. ACM, New York,
  NY, USA, 11 pages",,10.1145/3351095.3372829,,cs.LG cs.AI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A growing body of work shows that many problems in fairness, accountability,
transparency, and ethics in machine learning systems are rooted in decisions
surrounding the data collection and annotation process. In spite of its
fundamental nature however, data collection remains an overlooked part of the
machine learning (ML) pipeline. In this paper, we argue that a new
specialization should be formed within ML that is focused on methodologies for
data collection and annotation: efforts that require institutional frameworks
and procedures. Specifically for sociocultural data, parallels can be drawn
from archives and libraries. Archives are the longest standing communal effort
to gather human information and archive scholars have already developed the
language and procedures to address and discuss many challenges pertaining to
data collection such as consent, power, inclusivity, transparency, and ethics &
privacy. We discuss these five key approaches in document collection practices
in archives that can inform data collection in sociocultural ML. By showing
data collection practices from another field, we encourage ML research to be
more cognizant and systematic in data collection and draw from
interdisciplinary expertise.
","[{'version': 'v1', 'created': 'Sun, 22 Dec 2019 05:56:55 GMT'}]",2019-12-24,"[['Jo', 'Eun Seo', ''], ['Gebru', 'Timnit', '']]","['datasets', 'machine learning', 'ML fairness', 'data collection', 'sociocultural data', 'archives']"
8415,2008.10678,Josef Lorenz Rumberger,"Josef Lorenz Rumberger, Lisa Mais, Dagmar Kainmueller",Probabilistic Deep Learning for Instance Segmentation,ECCV 2020 BioImage Computing Workshop,,10.1007/978-3-030-66415-2_29,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Probabilistic convolutional neural networks, which predict distributions of
predictions instead of point estimates, led to recent advances in many areas of
computer vision, from image reconstruction to semantic segmentation. Besides
state of the art benchmark results, these networks made it possible to quantify
local uncertainties in the predictions. These were used in active learning
frameworks to target the labeling efforts of specialist annotators or to assess
the quality of a prediction in a safety-critical environment. However, for
instance segmentation problems these methods are not frequently used so far. We
seek to close this gap by proposing a generic method to obtain model-inherent
uncertainty estimates within proposal-free instance segmentation models.
Furthermore, we analyze the quality of the uncertainty estimates with a metric
adapted from semantic segmentation. We evaluate our method on the BBBC010 C.\
elegans dataset, where it yields competitive performance while also predicting
uncertainty estimates that carry information about object-level inaccuracies
like false splits and false merges. We perform a simulation to show the
potential use of such uncertainty estimates in guided proofreading.
","[{'version': 'v1', 'created': 'Mon, 24 Aug 2020 19:51:48 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Dec 2020 11:38:42 GMT'}]",2021-01-19,"[['Rumberger', 'Josef Lorenz', ''], ['Mais', 'Lisa', ''], ['Kainmueller', 'Dagmar', '']]","['Instance Segmentation', 'Probabilistic Deep Learning', 'BayesianInference', 'Digital Microscopy']"
8416,2106.12005,Maroun Haddad,Maroun Haddad and Mohamed Bouguessa,Exploring the Representational Power of Graph Autoencoder,,"Neurocomputing, Volume 457, 7 October 2021, Pages 225-241",10.1016/j.neucom.2021.06.034,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  While representation learning has yielded a great success on many graph
learning tasks, there is little understanding behind the structures that are
being captured by these embeddings. For example, we wonder if the topological
features, such as the Triangle Count, the Degree of the node and other
centrality measures are concretely encoded in the embeddings. Furthermore, we
ask if the presence of these structures in the embeddings is necessary for a
better performance on the downstream tasks, such as clustering and
classification. To address these questions, we conduct an extensive empirical
study over three classes of unsupervised graph embedding models and seven
different variants of Graph Autoencoders. Our results show that five
topological features: the Degree, the Local Clustering Score, the Betweenness
Centrality, the Eigenvector Centrality, and Triangle Count are concretely
preserved in the first layer of the graph autoencoder that employs the SUM
aggregation rule, under the condition that the model preserves the second-order
proximity. We supplement further evidence for the presence of these features by
revealing a hierarchy in the distribution of the topological features in the
embeddings of the aforementioned model. We also show that a model with such
properties can outperform other models on certain downstream tasks, especially
when the preserved features are relevant to the task at hand. Finally, we
evaluate the suitability of our findings through a test case study related to
social influence prediction.
","[{'version': 'v1', 'created': 'Tue, 22 Jun 2021 18:23:26 GMT'}]",2021-10-11,"[['Haddad', 'Maroun', ''], ['Bouguessa', 'Mohamed', '']]","['Graph Neural Networks', 'Graph Embedding', 'Node Representation']"
8417,1810.02597,Mostafa Zaman Chowdhury,"Mostafa Zaman Chowdhury, Md. Tanvir Hossan, Moh. Khalid Hasan, Yeong
  Min Jang","Integrated RF/Optical Wireless Networks for Improving QoS in Indoor and
  Transportation Applications",,Sept. 2018,10.1007/s11277-018-5971-3,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Communications based solely on radio frequency (RF) networks cannot provide
adequate quality of service for the rapidly growing demands of wireless
connectivity. Since devices operating in the optical spectrum do not interfere
with those using the RF spectrum, wireless networks based on the optical
spectrum can be added to existing RF networks to fulfill this demand. Hence,
optical wireless communication (OWC) technology can be an excellent complement
to RF-based technology to provide improved service. Promising OWC systems
include light fidelity (LiFi), visible light communication, optical camera
communication (OCC), and free-space optical communication (FSOC). OWC and RF
systems have differing limitations, and the integration of RF and optical
wireless networks can overcome the limitations of both systems. This paper
describes an LiFi/femtocell hybrid network system for indoor environments. Low
signal-to-interference-plus-noise ratios and the shortage bandwidth problems of
existing RF femtocell networks can be overcome with the proposed hybrid model.
Moreover, we describe an integrated RF/optical wireless system that can be
employed for users inside a vehicle, remote monitoring of ambulance patients,
vehicle tracking, and vehicle-to-vehicle communications. We consider LiFi, OCC,
and FSOC as the optical wireless technologies to be used for communication
support in transportation, and assume macrocells, femtocells, and wireless
fidelity to be the corresponding RF technologies. We describe handover
management-including detailed call flow, interference management, link
reliability improvement, and group handover provisioning-for integrated
networks. Performance analyses demonstrate the significance of the proposed
integrated RF/optical wireless systems.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 10:20:26 GMT'}]",2018-10-08,"[['Chowdhury', 'Mostafa Zaman', ''], ['Hossan', 'Md. Tanvir', ''], ['Hasan', 'Moh. Khalid', ''], ['Jang', 'Yeong Min', '']]","['Radio frequency', 'optical wireless', 'vehicle', 'LiFi', 'femtocell', 'visible light communication', 'optical camera']"
8418,1904.06206,Wael Jaafar,"Gor Mack Diouf, Halima Elbiaze, Wael Jaafar",On Byzantine Fault Tolerance in Multi-Master Kubernertes Clusters,"28 pages, 11 figures, published in Elsevier Future Generation
  Computer Systems Journal (Accepted 29-Mar-2020, Available online 7 April
  2020)",,10.1016/j.future.2020.03.060,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Docker container virtualization technology is being widely adopted in cloud
computing environments because of its lightweight and effiency. However, it
requires adequate control and management via an orchestrator. As a result,
cloud providers are adopting the open-access Kubernetes platform as the
standard orchestrator of containerized applications. To ensure applications'
availability in Kubernetes, the latter uses Raft protocol's replication
mechanism. Despite its simplicity, Raft assumes that machines fail only when
shutdown. This failure event is rarely the only reason for a machine's
malfunction. Indeed, software errors or malicious attacks can cause machines to
exhibit Byzantine (i.e. random) behavior and thereby corrupt the accuracy and
availability of the replication protocol. In this paper, we propose a
Kubernetes multi-Master Robust (KmMR) platform to overcome this limitation.
KmMR is based on the adaptation and integration of the BFT-SMaRt fault-tolerant
replication protocol into Kubernetes environment. Unlike Raft protocol,
BFT-SMaRt is resistant to both Byzantine and non-Byzantine faults. Experimental
results show that KmMR is able to guarantee the continuity of services, even
when the total number of tolerated faults is exceeded. In addition, KmMR
provides on average a consensus time 1000 times shorter than that achieved by
the conventional platform (with Raft), in such condition. Finally, we show that
KmMR generates a small additional cost in terms of resource consumption
compared to the conventional platform.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2019 13:14:41 GMT'}, {'version': 'v2', 'created': 'Sun, 29 Mar 2020 18:15:03 GMT'}, {'version': 'v3', 'created': 'Sat, 11 Apr 2020 02:54:43 GMT'}]",2020-04-14,"[['Diouf', 'Gor Mack', ''], ['Elbiaze', 'Halima', ''], ['Jaafar', 'Wael', '']]","['Cloud computing', 'Docker containers', 'Kubernetes', 'Byzantine and']"
8419,2011.00223,Vivek Kumar Singh Ph.D.,"Vivek Kumar Singh, Prashasti Singh, Mousumi Karmakar, Jacqueline Leta,
  Philipp Mayr","The Journal Coverage of Web of Science, Scopus and Dimensions: A
  Comparative Analysis",Submitted to Scientometrics,Scientometrics 2021,10.1007/s11192-021-03948-5,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Traditionally, Web of Science and Scopus have been the two most widely used
databases for bibliometric analyses. However, during the last few years some
new scholarly databases, such as Dimensions, have come up. Several previous
studies have compared different databases, either through a direct comparison
of article coverage or by comparing the citations across the databases. This
article attempts to compare the journal coverage of the three databases: Web of
Science, Scopus and Dimensions. The most recent master journal lists of the
three databases have been used for the purpose of identifying the overlapping
and unique journals covered in the databases. The results indicate that the
databases have significantly different journal coverage, with the Web of
Science being most selective and Dimensions being the most exhaustive. About
99.11% and 96.61% of the journals indexed in Web of Science are also indexed in
Scopus and Dimensions, respectively. Scopus has 96.42% of its indexed journals
also covered by Dimensions. Dimensions database has the most exhaustive
coverage, with 82.22% more journals covered as compared to Web of Science and
48.17% more journals covered as compared to Scopus. We also analysed the
research outputs for 20 highly productive countries for the 2010-2019 period,
as indexed in the three databases, and identified database-induced variations
in research output volume, rank and global share of different countries. In
addition to variations in overall coverage of research output from different
countries, the three databases appear to have differential coverage of
different disciplines.
","[{'version': 'v1', 'created': 'Sat, 31 Oct 2020 09:33:12 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Mar 2021 06:30:46 GMT'}]",2021-03-30,"[['Singh', 'Vivek Kumar', ''], ['Singh', 'Prashasti', ''], ['Karmakar', 'Mousumi', ''], ['Leta', 'Jacqueline', ''], ['Mayr', 'Philipp', '']]","['Dimensions', 'Journal Coverage', 'Scholarly Databases', 'Scopus', 'Web of Science']"
8420,2003.11875,Trenton Schulz,"Trenton Schulz, Kristin Skeide Fuglerud",Creating Personas with Disabilities,8 pages,,10.1007/978-3-642-31534-3_22,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Personas can help raise awareness among stakeholders about users' needs.
While personas are made-up people, they are based on facts gathered from user
research. Personas can also be used to raise awareness of universal design and
accessibility needs of people with disabilities. We review the current state of
the art of the personas and review some research and industry projects that use
them. We outline techniques that can be used to create personas with
disabilities. This includes advice on how to get more information about
assistive technology and how to better include people with disabilities in the
persona creation process. We also describe our use of personas with
disabilities in several projects and discuss how it has helped to find
accessibility issues.
","[{'version': 'v1', 'created': 'Thu, 26 Mar 2020 13:00:10 GMT'}]",2020-06-30,"[['Schulz', 'Trenton', ''], ['Fuglerud', 'Kristin Skeide', '']]","['personas', 'accessibility', 'universal design', 'inclusive design']"
8421,cs/0501004,Marko Rodriguez,Marko Rodriguez,"Advances towards a General-Purpose Societal-Scale Human-Collective
  Problem-Solving Engine",Collective Problem Solving Theory and Social-Network algorithm,"Proceedings of the International Conference on Systems, Man and
  Cybernetics, IEEE SMC, The Hague, Netherlands, volume 1, pages 206-211, ISSN:
  1062-922X, 2004",10.1109/ICSMC.2004.1398298,,cs.CY cs.HC,,"  Human collective intelligence has proved itself as an important factor in a
society's ability to accomplish large-scale behavioral feats. As societies have
grown in population-size, individuals have seen a decrease in their ability to
activeily participate in the problem-solving processes of the group.
Representative decision-making structures have been used as a modern solution
to society's inadequate information-processing infrastructure. With computer
and network technologies being further embedded within the fabric of society,
the implementation of a general-purpose societal-scale human-collective
problem-solving engine is envisioned as a means of furthering the
collective-intelligence potential of society. This paper provides both a novel
framework for creating collective intelligence systems and a method for
implementing a representative and expertise system based on social-network
theory.
","[{'version': 'v1', 'created': 'Mon, 3 Jan 2005 15:11:07 GMT'}]",2008-05-23,"[['Rodriguez', 'Marko', '']]","['societal-scale decision-support system', 'egovernment', 'social-network', 'collective intelligence']"
8422,2102.12999,Lukas Christian H{\o}gh{\o}j,"Lukas Christian H{\o}gh{\o}j and Erik Albert Tr\""aff","An Advection-Diffusion based Filter for Machinable Designs in Topology
  Optimization",,,10.1016/j.cma.2021.114488,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a simple formulation for topology optimization problems
ensuring manufacturability by machining. The method distinguishes itself from
existing methods by using the advection-diffusion equation with Robin boundary
conditions to perform a filtering of the design variables. The proposed
approach is less computationally expensive than the traditional methods used.
Furthermore, the approach is easy to implement on unstructured meshes and in a
distributed memory setting. Finally, the proposed approach can be performed
with few to no continuation steps in any system parameters. Applications are
demonstrated with topology optimization on unstructured meshes with up to 64
million elements and up to 29 milling tool directions.
","[{'version': 'v1', 'created': 'Thu, 25 Feb 2021 17:03:34 GMT'}]",2022-02-16,"[['Høghøj', 'Lukas Christian', ''], ['Träff', 'Erik Albert', '']]","['Manufacturability', 'Machining', 'Milling', 'Filtering', 'Topology Optimization']"
8423,1806.05781,John See,"Yee-Hui Oh, John See, Anh Cat Le Ngo, Raphael Chung-Wei Phan, Vishnu
  Monn Baskaran","A Survey of Automatic Facial Micro-expression Analysis: Databases,
  Methods and Challenges","45 pages, single column preprint version. Submitted: 2 December 2017,
  Accepted: 12 June 2018 to Frontiers in Psychology",,10.3389/fpsyg.2018.01128,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the last few years, automatic facial micro-expression analysis has
garnered increasing attention from experts across different disciplines because
of its potential applications in various fields such as clinical diagnosis,
forensic investigation and security systems. Advances in computer algorithms
and video acquisition technology have rendered machine analysis of facial
micro-expressions possible today, in contrast to decades ago when it was
primarily the domain of psychiatrists where analysis was largely manual.
Indeed, although the study of facial micro-expressions is a well-established
field in psychology, it is still relatively new from the computational
perspective with many interesting problems. In this survey, we present a
comprehensive review of state-of-the-art databases and methods for
micro-expressions spotting and recognition. Individual stages involved in the
automation of these tasks are also described and reviewed at length. In
addition, we also deliberate on the challenges and future directions in this
growing field of automatic facial micro-expression analysis.
","[{'version': 'v1', 'created': 'Fri, 15 Jun 2018 01:42:33 GMT'}]",2018-06-18,"[['Oh', 'Yee-Hui', ''], ['See', 'John', ''], ['Ngo', 'Anh Cat Le', ''], ['Phan', 'Raphael Chung-Wei', ''], ['Baskaran', 'Vishnu Monn', '']]","['facial micro-expressions', 'subtle emotions', 'survey', 'spotting', 'recognition', 'micro-expression']"
8424,1910.00188,Hudson Borges,Hudson Borges and Rodrigo Brito and Marco Tulio Valente,"Beyond Textual Issues: Understanding the Usage and Impact of GitHub
  Reactions",10 pages,"SBES 2019, Proceedings of the XXXIII Brazilian Symposium on
  Software Engineering, Pages 397-406",10.1145/3350768.3350788,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, GitHub introduced a new social feature, named reactions, which are
""pictorial characters"" similar to emoji symbols widely used nowadays in
text-based communications. Particularly, GitHub users can use a pre-defined set
of such symbols to react to issues and pull requests. However, little is known
about the real usage and impact of GitHub reactions. In this paper, we analyze
the reactions provided by developers to more than 2.5 million issues and 9.7
million issue comments, in order to answer an extensive list of nine research
questions about the usage and adoption of reactions. We show that reactions are
being increasingly used by open source developers. Moreover, we also found that
issues with reactions usually take more time to be handled and have longer
discussions.
","[{'version': 'v1', 'created': 'Tue, 1 Oct 2019 03:45:21 GMT'}]",2019-10-02,"[['Borges', 'Hudson', ''], ['Brito', 'Rodrigo', ''], ['Valente', 'Marco Tulio', '']]","['Social Coding', 'GitHub', 'Reactions']"
8425,2101.08758,Pedro Saleiro,"S\'ergio Jesus, Catarina Bel\'em, Vladimir Balayan, Jo\~ao Bento,
  Pedro Saleiro, Pedro Bizarro, Jo\~ao Gama","How can I choose an explainer? An Application-grounded Evaluation of
  Post-hoc Explanations","Accepted at FAccT'21, the ACM Conference on Fairness, Accountability,
  and Transparency",,"10.1145/3442188.3445941 10.1145/3442188.3445941 10.1145/3442188.3445941
  10.1145/3442188.3445941",,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There have been several research works proposing new Explainable AI (XAI)
methods designed to generate model explanations having specific properties, or
desiderata, such as fidelity, robustness, or human-interpretability. However,
explanations are seldom evaluated based on their true practical impact on
decision-making tasks. Without that assessment, explanations might be chosen
that, in fact, hurt the overall performance of the combined system of ML model
+ end-users. This study aims to bridge this gap by proposing XAI Test, an
application-grounded evaluation methodology tailored to isolate the impact of
providing the end-user with different levels of information. We conducted an
experiment following XAI Test to evaluate three popular post-hoc explanation
methods -- LIME, SHAP, and TreeInterpreter -- on a real-world fraud detection
task, with real data, a deployed ML model, and fraud analysts. During the
experiment, we gradually increased the information provided to the fraud
analysts in three stages: Data Only, i.e., just transaction data without access
to model score nor explanations, Data + ML Model Score, and Data + ML Model
Score + Explanations. Using strong statistical analysis, we show that, in
general, these popular explainers have a worse impact than desired. Some of the
conclusion highlights include: i) showing Data Only results in the highest
decision accuracy and the slowest decision time among all variants tested, ii)
all the explainers improve accuracy over the Data + ML Model Score variant but
still result in lower accuracy when compared with Data Only; iii) LIME was the
least preferred by users, probably due to its substantially lower variability
of explanations from case to case.
","[{'version': 'v1', 'created': 'Thu, 21 Jan 2021 18:15:13 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Jan 2021 12:05:16 GMT'}]",2021-01-25,"[['Jesus', 'Sérgio', ''], ['Belém', 'Catarina', ''], ['Balayan', 'Vladimir', ''], ['Bento', 'João', ''], ['Saleiro', 'Pedro', ''], ['Bizarro', 'Pedro', ''], ['Gama', 'João', '']]","['XAI', 'Evaluation', 'Explainability', 'LIME', 'SHAP', 'User Study']"
8426,1910.09880,Ruben Ohana,"Ruben Ohana, Jonas Wacker, Jonathan Dong, S\'ebastien Marmin, Florent
  Krzakala, Maurizio Filippone, Laurent Daudet","Kernel computations from large-scale random features obtained by Optical
  Processing Units","5 pages, 3 figures, submitted to ICASSP 2020","ICASSP 2020 - 2020 IEEE International Conference on Acoustics,
  Speech and Signal Processing (ICASSP)",10.1109/ICASSP40776.2020.9053272,,cs.ET cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Approximating kernel functions with random features (RFs)has been a
successful application of random projections for nonparametric estimation.
However, performing random projections presents computational challenges for
large-scale problems. Recently, a new optical hardware called Optical
Processing Unit (OPU) has been developed for fast and energy-efficient
computation of large-scale RFs in the analog domain. More specifically, the OPU
performs the multiplication of input vectors by a large random matrix with
complex-valued i.i.d. Gaussian entries, followed by the application of an
element-wise squared absolute value operation - this last nonlinearity being
intrinsic to the sensing process. In this paper, we show that this operation
results in a dot-product kernel that has connections to the polynomial kernel,
and we extend this computation to arbitrary powers of the feature map.
Experiments demonstrate that the OPU kernel and its RF approximation achieve
competitive performance in applications using kernel ridge regression and
transfer learning for image classification. Crucially, thanks to the use of the
OPU, these results are obtained with time and energy savings.
","[{'version': 'v1', 'created': 'Tue, 22 Oct 2019 10:37:08 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Dec 2019 09:48:52 GMT'}]",2020-06-23,"[['Ohana', 'Ruben', ''], ['Wacker', 'Jonas', ''], ['Dong', 'Jonathan', ''], ['Marmin', 'Sébastien', ''], ['Krzakala', 'Florent', ''], ['Filippone', 'Maurizio', ''], ['Daudet', 'Laurent', '']]","['Kernel methods', 'nonparametric estimation', 'optical computing', 'random features', 'kernel ridge regression']"
8427,2301.02461,Mehdi Delrobaei,"Fatemeh Ghorbani, Mahsa Farshi Taghavi, Mehdi Delrobaei","Towards an Intelligent Assistive System Based on Augmented Reality and
  Serious Games","The paper includes 10 pages, 10 tables, and 9 figures",,10.1016/j.entcom.2021.100458,,cs.HC cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Age-related cognitive impairment is generally characterized by gradual memory
loss and decision-making difficulties. The aim of this study is to investigate
multi level support and suggest relevant helping means for the elderly with
mild cognitive impairment as well as their caregivers as the primary end-users.
This work reports preliminary results on an intelligent assistive system,
achieved through the integration of Internet of Things, augmented reality, and
adaptive fuzzy decision-making methods. The proposed system operates in
different modes, including automated and semi-automated modes. The former helps
the user complete their daily life activities by showing augmented reality
messages or making automatic changes; while the latter allows manual changes
after the real-time assessment of the user's cognitive state based on the
augmented reality serious game score. We have also evaluated the accuracy of
the serious game score with 37 elderly participants and compared it with users'
paper-based cognitive test results. We further noted that there is an
acceptable correlation between the paper-based test and users' serious game
scores. Moreover, we observed that the system response in the semi-automated
mode causes less data loss compared with the automated mode, as the number of
active devices decreases.
","[{'version': 'v1', 'created': 'Fri, 6 Jan 2023 11:10:04 GMT'}]",2023-01-09,"[['Ghorbani', 'Fatemeh', ''], ['Taghavi', 'Mahsa Farshi', ''], ['Delrobaei', 'Mehdi', '']]","['Augmented reality', 'Fuzzy decision-making', 'intelligent assistive technology', 'Internet of things', 'serious game']"
8428,2202.11460,Pavel Hrab\'ak,"Hana Najmanov\'a and Veronika Pe\v{s}kov\'a and Luk\'a\v{s} Kukl\'ik
  and Marek Buk\'a\v{c}ek and Pavel Hrab\'ak and Daniel Va\v{s}ata","Evacuation trials from a double-deck electric train unit: Experimental
  data and sensitivity analysis",,"Safety Science, Volume 146, 2022, 105523, ISSN 0925-7535",10.1016/j.ssci.2021.105523,,cs.MA physics.soc-ph,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Passenger trains represent a challenging environment in emergencies, with
specific evacuation conditions resulting from the typical layout and interior
design inherent to public transportation vehicles. This paper describes a
dataset obtained in a full-scale controlled experiment emulating the emergency
evacuation of a double-deck electric unit railcar carried out in Prague in
2018. 15 evacuation trials involving 91 participants were conducted under
various evacuation scenarios considering different compositions of passenger
crowd, exit widths, and exit types (e.g. egress to a high platform, to an open
rail line using stairs, and a 750 mm jump without any supporting equipment).
The study's main goals were to collect experimental data on the movement
conditions in the railcar and to study the impact of various boundary
conditions on evacuation process and total evacuation time. Movement
characteristics (exit flows, speeds) and human behaviour (pre-movement
activities, exiting behaviours) were also analysed.
  The data obtained was used to validate and adjust a Pathfinder model to
capture important aspects of evacuation from the railcar. Furthermore, a series
of simulations using this model was performed to provide sensitivity analysis
of the influence of crowd composition, exit width, and exit type on total
evacuation time. As a key finding, we can conclude that for the case of a
standard exit path (platform or stairs) the width of the main exit had the
greatest impact on total evacuation time, however, crowd composition played the
prevailing role in evacuation scenarios involving a jump.
","[{'version': 'v1', 'created': 'Wed, 23 Feb 2022 12:25:06 GMT'}]",2022-02-24,"[['Najmanová', 'Hana', ''], ['Pešková', 'Veronika', ''], ['Kuklík', 'Lukáš', ''], ['Bukáček', 'Marek', ''], ['Hrabák', 'Pavel', ''], ['Vašata', 'Daniel', '']]","['Fire Safety', 'Evacuation', 'Passenger Train', 'Movement Characteristics', 'Evacuation modelling', 'Sensitivity Analysis']"
8429,1912.09323,Artem Ryzhikov,"Artem Ryzhikov, Maxim Borisyak, Andrey Ustyuzhanin, Denis Derkach",NFAD: Fixing anomaly detection using normalizing flows,,PeerJ Computer Science 7:e757 (2021),10.7717/peerj-cs.757,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Anomaly detection is a challenging task that frequently arises in practically
all areas of industry and science, from fraud detection and data quality
monitoring to finding rare cases of diseases and searching for new physics.
Most of the conventional approaches to anomaly detection, such as one-class SVM
and Robust Auto-Encoder, are one-class classification methods, i.e. focus on
separating normal data from the rest of the space. Such methods are based on
the assumption of separability of normal and anomalous classes, and
subsequently do not take into account any available samples of anomalies.
Nonetheless, in practical settings, some anomalous samples are often available;
however, usually in amounts far lower than required for a balanced
classification task, and the separability assumption might not always hold.
This leads to an important task -- incorporating known anomalous samples into
training procedures of anomaly detection models.
  In this work, we propose a novel model-agnostic training procedure to address
this task. We reformulate one-class classification as a binary classification
problem with normal data being distinguished from pseudo-anomalous samples. The
pseudo-anomalous samples are drawn from low-density regions of a normalizing
flow model by feeding tails of the latent distribution into the model. Such an
approach allows to easily include known anomalies into the training process of
an arbitrary classifier. We demonstrate that our approach shows comparable
performance on one-class problems, and, most importantly, achieves comparable
or superior results on tasks with variable amounts of known anomalies.
","[{'version': 'v1', 'created': 'Thu, 19 Dec 2019 16:03:11 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Nov 2021 09:37:37 GMT'}]",2021-11-22,"[['Ryzhikov', 'Artem', ''], ['Borisyak', 'Maxim', ''], ['Ustyuzhanin', 'Andrey', ''], ['Derkach', 'Denis', '']]","['Anomaly detection', 'Deep learning', 'Semi-supervised learning', 'Normalizing flows']"
8430,2208.05087,Angela Zavaleta Bernuy,"Angela Zavaleta-Bernuy, Ziwen Han, Hammad Shaikh, Qi Yin Zheng,
  Lisa-Angelique Lim, Anna Rafferty, Andrew Petersen, Joseph Jay Williams","How can Email Interventions Increase Students' Completion of Online
  Homework? A Case Study Using A/B Comparisons","11 pages, 4 figures, 4 tables. Conference: LAK22: 12th International
  Learning Analytics and Knowledge Conference (LAK22)",,10.1145/3506860.3506874,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Email communication between instructors and students is ubiquitous, and it
could be valuable to explore ways of testing out how to make email messages
more impactful. This paper explores the design space of using emails to get
students to plan and reflect on starting weekly homework earlier. We deployed a
series of email reminders using randomized A/B comparisons to test alternative
factors in the design of these emails, providing examples of an experimental
paradigm and metrics for a broader range of interventions. We also surveyed and
interviewed instructors and students to compare their predictions about the
effectiveness of the reminders with their actual impact. We present our results
on which seemingly obvious predictions about effective emails are not borne
out, despite there being evidence for further exploring these interventions, as
they can sometimes motivate students to attempt their homework more often. We
also present qualitative evidence about student opinions and behaviours after
receiving the emails, to guide further interventions. These findings provide
insight into how to use randomized A/B comparisons in everyday channels such as
emails, to provide empirical evidence to test our beliefs about the
effectiveness of alternative design choices.
","[{'version': 'v1', 'created': 'Wed, 10 Aug 2022 00:22:59 GMT'}]",2022-08-11,"[['Zavaleta-Bernuy', 'Angela', ''], ['Han', 'Ziwen', ''], ['Shaikh', 'Hammad', ''], ['Zheng', 'Qi Yin', ''], ['Lim', 'Lisa-Angelique', ''], ['Rafferty', 'Anna', ''], ['Petersen', 'Andrew', ''], ['Williams', 'Joseph Jay', '']]","['A/B comparisons', 'Embedded experimentation', 'Randomized experiments', 'Procrastination', 'Reminder']"
8431,2003.05687,Mayank Raikwar,"Mayank Raikwar, Danilo Gligoroski, Goran Velinov",Trends in Development of Databases and Blockchain,"Accepted in The Second International Workshop on Blockchain
  Applications and Theory (BAT 2020)","2020 Seventh International Conference on Software Defined Systems
  (SDS)",10.1109/SDS49854.2020.9143893,,cs.DC cs.CR cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work is about the mutual influence between two technologies: Databases
and Blockchain. It addresses two questions: 1. How the database technology has
influenced the development of blockchain technology?, and 2. How blockchain
technology has influenced the introduction of new functionalities in some
modern databases? For the first question, we explain how database technology
contributes to blockchain technology by unlocking different features such as
ACID (Atomicity, Consistency, Isolation, and Durability) transactional
consistency, rich queries, real-time analytics, and low latency. We explain how
the CAP (Consistency, Availability, Partition tolerance) theorem known for
databases influenced the DCS (Decentralization, Consistency, Scalability)
theorem for the blockchain systems. By using an analogous relaxation approach
as it was used for the proof of the CAP theorem, we postulate a
""DCS-satisfiability conjecture."" For the second question, we review different
databases that are designed specifically for blockchain and provide most of the
blockchain functionality like immutability, privacy, censorship resistance,
along with database features.
","[{'version': 'v1', 'created': 'Thu, 12 Mar 2020 10:04:41 GMT'}]",2020-09-10,"[['Raikwar', 'Mayank', ''], ['Gligoroski', 'Danilo', ''], ['Velinov', 'Goran', '']]","['Blockchain', 'Database', 'Decentralization', 'ACID', 'CAP', 'DCS Theorem', 'Immutability']"
8432,2003.10306,Thomas Uriot Tu,Thomas Uriot and Dario Izzo,Safe Crossover of Neural Networks Through Neuron Alignment,,,10.1145/3377930.3390197,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the main and largely unexplored challenges in evolving the weights of
neural networks using genetic algorithms is to find a sensible crossover
operation between parent networks. Indeed, naive crossover leads to
functionally damaged offspring that do not retain information from the parents.
This is because neural networks are invariant to permutations of neurons,
giving rise to multiple ways of representing the same solution. This is often
referred to as the competing conventions problem. In this paper, we propose a
two-step safe crossover(SC) operator. First, the neurons of the parents are
functionally aligned by computing how well they correlate, and only then are
the parents recombined. We compare two ways of measuring relationships between
neurons: Pairwise Correlation (PwC) and Canonical Correlation Analysis (CCA).
We test our safe crossover operators (SC-PwC and SC-CCA) on MNIST and CIFAR-10
by performing arithmetic crossover on the weights of feed-forward neural
network pairs. We show that it effectively transmits information from parents
to offspring and significantly improves upon naive crossover. Our method is
computationally fast,can serve as a way to explore the fitness landscape more
efficiently and makes safe crossover a potentially promising operator in future
neuroevolution research and applications.
","[{'version': 'v1', 'created': 'Mon, 23 Mar 2020 14:50:00 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Mar 2020 23:00:20 GMT'}, {'version': 'v3', 'created': 'Mon, 4 May 2020 07:58:22 GMT'}]",2020-11-17,"[['Uriot', 'Thomas', ''], ['Izzo', 'Dario', '']]","['Canonical correlation analysis', 'competing conventions', 'crossover', 'genetic algorithms', 'neuroevolution']"
8433,2108.10242,Alexei Mikhailov,"Alexei Mikhailov, Mikhail Karavay",Pattern Inversion as a Pattern Recognition Method for Machine Learning,"9 pages, 12 figures",,10.1088/1742-6596/2224/1/012002,,cs.CV cs.LG cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Artificial neural networks use a lot of coefficients that take a great deal
of computing power for their adjustment, especially if deep learning networks
are employed. However, there exist coefficients-free extremely fast
indexing-based technologies that work, for instance, in Google search engines,
in genome sequencing, etc. The paper discusses the use of indexing-based
methods for pattern recognition. It is shown that for pattern recognition
applications such indexing methods replace with inverse patterns the fully
inverted files, which are typically employed in search engines. Not only such
inversion provide automatic feature extraction, which is a distinguishing mark
of deep learning, but, unlike deep learning, pattern inversion supports almost
instantaneous learning, which is a consequence of absence of coefficients. The
paper discusses a pattern inversion formalism that makes use on a novel pattern
transform and its application for unsupervised instant learning. Examples
demonstrate a view-angle independent recognition of three-dimensional objects,
such as cars, against arbitrary background, prediction of remaining useful life
of aircraft engines, and other applications. In conclusion, it is noted that,
in neurophysiology, the function of the neocortical mini-column has been widely
debated since 1957. This paper hypothesize that, mathematically, the cortical
mini-column can be described as an inverse pattern, which physically serves as
a connection multiplier expanding associations of inputs with relevant pattern
classes.
","[{'version': 'v1', 'created': 'Sun, 15 Aug 2021 10:25:51 GMT'}]",2022-05-04,"[['Mikhailov', 'Alexei', ''], ['Karavay', 'Mikhail', '']]","['pattern recognition', 'inverse patterns', 'instant learning', 'cortical mini-column', 'pattern transform']"
8434,2205.14430,Liang Zhou,"Kaiyi Zhang, Liang Zhou, Lu Chen, Shitong He, Daniel Weiskopf, Yunhai
  Wang",Angle-Uniform Parallel Coordinates,To be published in Computational Visual Media,,10.1007/s41095-022-0291-7,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present angle-uniform parallel coordinates, a data-independent technique
that deforms the image plane of parallel coordinates so that the angles of
linear relationships between two variables are linearly mapped along the
horizontal axis of the parallel coordinates plot. Despite being a common method
for visualizing multidimensional data, parallel coordinates are ineffective for
revealing positive correlations since the associated parallel coordinates
points of such structures may be located at infinity in the image plane and the
asymmetric encoding of negative and positive correlations may lead to
unreliable estimations. To address this issue, we introduce a transformation
that bounds all points horizontally using an angle-uniform mapping and shrinks
them vertically in a structure-preserving fashion; polygonal lines become
smooth curves and symmetric representation of data correlations is achieved. We
further propose a combined subsampling and density visualization approach to
reduce visual clutter caused by overdrawing. Our method enables accurate visual
pattern interpretation of data correlations, and its data-independent nature
makes it applicable to all multidimensional datasets. The usefulness of our
method is demonstrated using examples of synthetic and real-world datasets.
","[{'version': 'v1', 'created': 'Sat, 28 May 2022 13:24:37 GMT'}]",2022-05-31,"[['Zhang', 'Kaiyi', ''], ['Zhou', 'Liang', ''], ['Chen', 'Lu', ''], ['He', 'Shitong', ''], ['Weiskopf', 'Daniel', ''], ['Wang', 'Yunhai', '']]","['Parallelcoordinates', 'multidimensionaldata', 'deformation', 'correlations']"
8435,2108.02607,Yuanhang Zhang,"Yuanhang Zhang, Susan Liang, Shuang Yang, Xiao Liu, Zhongqin Wu,
  Shiguang Shan, Xilin Chen",UniCon: Unified Context Network for Robust Active Speaker Detection,"10 pages, 6 figures; to appear at ACM Multimedia 2021",,10.1145/3474085.3475275,,cs.CV cs.MM cs.SD eess.AS eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a new efficient framework, the Unified Context Network (UniCon),
for robust active speaker detection (ASD). Traditional methods for ASD usually
operate on each candidate's pre-cropped face track separately and do not
sufficiently consider the relationships among the candidates. This potentially
limits performance, especially in challenging scenarios with low-resolution
faces, multiple candidates, etc. Our solution is a novel, unified framework
that focuses on jointly modeling multiple types of contextual information:
spatial context to indicate the position and scale of each candidate's face,
relational context to capture the visual relationships among the candidates and
contrast audio-visual affinities with each other, and temporal context to
aggregate long-term information and smooth out local uncertainties. Based on
such information, our model optimizes all candidates in a unified process for
robust and reliable ASD. A thorough ablation study is performed on several
challenging ASD benchmarks under different settings. In particular, our method
outperforms the state-of-the-art by a large margin of about 15% mean Average
Precision (mAP) absolute on two challenging subsets: one with three candidate
speakers, and the other with faces smaller than 64 pixels. Together, our UniCon
achieves 92.0% mAP on the AVA-ActiveSpeaker validation set, surpassing 90% for
the first time on this challenging dataset at the time of submission. Project
website: https://unicon-asd.github.io/.
","[{'version': 'v1', 'created': 'Thu, 5 Aug 2021 13:25:44 GMT'}]",2021-08-06,"[['Zhang', 'Yuanhang', ''], ['Liang', 'Susan', ''], ['Yang', 'Shuang', ''], ['Liu', 'Xiao', ''], ['Wu', 'Zhongqin', ''], ['Shan', 'Shiguang', ''], ['Chen', 'Xilin', '']]","['active speaker detection', 'audio-visual', 'speech', 'computer vision']"
8436,2001.09177,Davide Fucci,"Daniela Girardi, Nicole Novielli, Davide Fucci, Filippo Lanubile",Recognizing Developers' Emotions while Programming,Accepted for publication at ICSE2020 Technical Track,"In Proceedings of the 42nd International Conference on Software
  Engineering, Seoul, Republic of Korea, May 23-29, 2020 (ICSE '20),12 pages",10.1145/3377811.3380374,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Developers experience a wide range of emotions during programming tasks,
which may have an impact on job performance. In this paper, we present an
empirical study aimed at (i) investigating the link between emotion and
progress, (ii) understanding the triggers for developers' emotions and the
strategies to deal with negative ones, (iii) identifying the minimal set of
non-invasive biometric sensors for emotion recognition during programming task.
Results confirm previous findings about the relation between emotions and
perceived productivity. Furthermore, we show that developers' emotions can be
reliably recognized using only a wristband capturing the electrodermal activity
and heart-related metrics.
","[{'version': 'v1', 'created': 'Fri, 24 Jan 2020 19:52:44 GMT'}, {'version': 'v2', 'created': 'Thu, 6 May 2021 09:51:00 GMT'}]",2021-05-07,"[['Girardi', 'Daniela', ''], ['Novielli', 'Nicole', ''], ['Fucci', 'Davide', ''], ['Lanubile', 'Filippo', '']]","['Emotion awareness', 'emotion detection', 'biometric sensors', 'empiricalsoftware engineering', 'human factors in software engineering']"
8437,2203.15425,Radek O\v{s}lej\v{s}ek,Martin Macak and Radek Oslejsek and Barbora Buhnova,Process Mining Analysis of Puzzle-Based Cybersecurity Training,,,10.1145/3502718.3524819,,cs.CR cs.IR,http://creativecommons.org/licenses/by/4.0/,"  The hands-on cybersecurity training quality is crucial to mitigate cyber
threats and attacks effectively. However, practical cybersecurity training is
strongly process-oriented, making the post-training analysis very difficult.
This paper presents process-mining methods applied to the learning analytics
workflow. We introduce a unified approach to reconstruct behavioral graphs from
sparse event logs of cyber ranges. Furthermore, we discuss significant data
features that affect their practical usability for educational process mining.
Based on that, methods of dealing with the complexity of process graphs are
presented, taking advantage of the puzzle-based gamification of in-class
training sessions.
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2022 10:45:05 GMT'}]",2022-03-30,"[['Macak', 'Martin', ''], ['Oslejsek', 'Radek', ''], ['Buhnova', 'Barbora', '']]","['cybersecurity training', 'CTF game', 'process mining', 'data analysis']"
8438,1912.12143,Ahmed A. Mawgoud,"Ahmed A. Mawgoud, Ahmed I. Karadawy, Benbella S. Tawfik","A Secure Authentication Technique in Internet of Medical Things through
  Machine Learning",,,10.6084/m9.figshare.13311479.v2,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  The rapid growth of the Internet of Things technology in healthcare domain
led to the appearance of many security threats and risks. It became very
challenging to provide full protection with the expansion in using sensor
objects in medical field, this led to the Internet of Medical Things
definition, the security part in IoMT poses a perilous problem that keeps
growing, because of the data sensitivity and critical information. The lack of
providing a secure environment in IoMT may lead to patients privacy issues, not
only leaving the data privacy of the patients at risk but also their lives can
be in danger. In this paper, we provide a discussion on both definition and
architecture of the Internet of Medical Things and Propose a new authentication
approach through machine learning, to enhance the security level.
","[{'version': 'v1', 'created': 'Mon, 16 Dec 2019 16:05:51 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Apr 2020 05:20:10 GMT'}, {'version': 'v3', 'created': 'Mon, 30 Nov 2020 06:25:35 GMT'}]",2020-12-09,"[['Mawgoud', 'Ahmed A.', ''], ['Karadawy', 'Ahmed I.', ''], ['Tawfik', 'Benbella S.', '']]","['Machine Learning', 'Internet of Medical Things', 'IoT Security', 'Risk']"
8439,2205.13399,Mayowa Ayodele,"Mayowa Ayodele and Richard Allmendinger and Manuel L\'opez-Ib\'a\~nez
  and Matthieu Parizy",Multi-objective QUBO Solver: Bi-objective Quadratic Assignment,The Genetic and Evolutionary Computation Conference 2022 (GECCO22),,10.1145/3512290.3528698,,cs.AI cs.DM physics.comp-ph,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Quantum and quantum-inspired optimisation algorithms are designed to solve
problems represented in binary, quadratic and unconstrained form. Combinatorial
optimisation problems are therefore often formulated as Quadratic Unconstrained
Binary Optimisation Problems (QUBO) to solve them with these algorithms.
Moreover, these QUBO solvers are often implemented using specialised hardware
to achieve enormous speedups, e.g. Fujitsu's Digital Annealer (DA) and D-Wave's
Quantum Annealer. However, these are single-objective solvers, while many
real-world problems feature multiple conflicting objectives. Thus, a common
practice when using these QUBO solvers is to scalarise such multi-objective
problems into a sequence of single-objective problems. Due to design trade-offs
of these solvers, formulating each scalarisation may require more time than
finding a local optimum. We present the first attempt to extend the algorithm
supporting a commercial QUBO solver as a multi-objective solver that is not
based on scalarisation. The proposed multi-objective DA algorithm is validated
on the bi-objective Quadratic Assignment Problem. We observe that algorithm
performance significantly depends on the archiving strategy adopted, and that
combining DA with non-scalarisation methods to optimise multiple objectives
outperforms the current scalarised version of the DA in terms of final solution
quality.
","[{'version': 'v1', 'created': 'Thu, 26 May 2022 14:48:03 GMT'}]",2022-05-27,"[['Ayodele', 'Mayowa', ''], ['Allmendinger', 'Richard', ''], ['López-Ibáñez', 'Manuel', ''], ['Parizy', 'Matthieu', '']]","['Multi-objective', 'QUBO', 'bi-objective QAP', 'Digital Annealer']"
8440,2011.04295,Jade Nardi,"Sarah Bordage, Mathieu Lhotel, Jade Nardi, Hugues Randriam",Interactive Oracle Proofs of Proximity to Algebraic Geometry Codes,Published version with two additional authors,"Leibniz International Proceedings in Informatics (LIPIcs), 37th
  Computational Complexity Conference (CCC 2022) - pages 30:1--30:45",10.4230/LIPIcs.CCC.2022.30,,cs.IT cs.CC cs.CR math.AG math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we initiate the study of proximity testing to Algebraic
Geometry (AG) codes. An AG code $C = C(\mathcal{X}, \mathcal{P}, D)$ over an
algebraic curve $\mathcal{X}$ is a vector space associated to evaluations on
$\mathcal{P}$ of functions in the Riemann-Roch space $L_\mathcal{X}(D)$. The
problem of testing proximity to an error-correcting code $C$ consists in
distinguishing between the case where an input word, given as an oracle,
belongs to $C$ and the one where it is far from every codeword of $C$. AG codes
are good candidates to construct short proof systems, but there exists no
efficient proximity tests for them. We aim to fill this gap.
  We construct an Interactive Oracle Proof of Proximity (IOPP) for some
families of AG codes by generalizing an IOPP for Reed-Solomon codes introduced
by Ben-Sasson, Bentov, Horesh and Riabzev, known as the FRI protocol. We
identify suitable requirements for designing efficient IOPP systems for AG
codes. Our approach relies on a neat decomposition of the Riemann-Roch space of
any invariant divisor under a group action on a curve into several explicit
Riemann-Roch spaces on the quotient curve. We provide sufficient conditions on
an AG code $C$ that allow to reduce a proximity testing problem for $C$ to a
membership problem for a significantly smaller code $C'$.
  As concrete instantiations, we study AG codes on Kummer curves and curves in
the Hermitian tower. The latter can be defined over polylogarithmic-size
alphabet. We specialize the generic AG-IOPP construction to reach linear prover
running time and logarithmic verification on Kummer curves, and quasilinear
prover time with polylogarithmic verification on the Hermitian tower.
","[{'version': 'v1', 'created': 'Mon, 9 Nov 2020 10:10:15 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Nov 2020 21:38:24 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Feb 2021 08:09:21 GMT'}, {'version': 'v4', 'created': 'Tue, 25 Oct 2022 07:02:37 GMT'}]",2022-10-26,"[['Bordage', 'Sarah', ''], ['Lhotel', 'Mathieu', ''], ['Nardi', 'Jade', ''], ['Randriam', 'Hugues', '']]","['Algebraic geometry codes', 'Interactive oracle proofs of proximity', 'Proximitytesting']"
8441,2110.13704,Gabriel Hondet,"Gabriel Hondet (DEDUCTEAM), Fr\'ed\'eric Blanqui (DEDUCTEAM)","Encoding of Predicate Subtyping with Proof Irrelevance in the
  $\lambda$$\Pi$-Calculus Modulo Theory","TYPES 2020 wasn't held in Turin as planned because of the COVID-19
  outbreak. TYPES 2020 - 26th International Conference on Types for Proofs and
  Programs, Mar 2020, Turino, Italy",,10.4230/LIPIcs.TYPES.2020.6,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The $\lambda$$\Pi$-calculus modulo theory is a logical framework in which
various logics and type systems can be encoded, thus helping the
cross-verification and interoperability of proof systems based on those logics
and type systems. In this paper, we show how to encode predicate subtyping and
proof irrelevance, two important features of the PVS proof assistant. We prove
that this encoding is correct and that encoded proofs can be mechanically
checked by Dedukti, a type checker for the $\lambda$$\Pi$-calculus modulo
theory using rewriting.
","[{'version': 'v1', 'created': 'Tue, 26 Oct 2021 13:45:53 GMT'}]",2021-10-27,"[['Hondet', 'Gabriel', '', 'DEDUCTEAM'], ['Blanqui', 'Frédéric', '', 'DEDUCTEAM']]","['Predicate Subtyping', 'Logical Framework', 'PVS', 'Dedukti', 'Proof Irrelevance']"
8442,2206.08544,Simon X. Yang,"Junfei Li, Zhe Xu, Danjie Zhu, Kevin Dong, Tao Yan, Zhu Zeng, Simon X.
  Yang",Bio-inspired Intelligence with Applications to Robotics: A Survey,,,10.20517/ir.2021.08,,cs.RO cs.SY eess.SY,http://creativecommons.org/publicdomain/zero/1.0/,"  In the past decades, considerable attention has been paid to bio-inspired
intelligence and its applications to robotics. This paper provides a
comprehensive survey of bio-inspired intelligence, with a focus on
neurodynamics approaches, to various robotic applications, particularly to path
planning and control of autonomous robotic systems. Firstly, the bio-inspired
shunting model and its variants (additive model and gated dipole model) are
introduced, and their main characteristics are given in detail. Then, two main
neurodynamics applications to real-time path planning and control of various
robotic systems are reviewed. A bio-inspired neural network framework, in which
neurons are characterized by the neurodynamics models, is discussed for mobile
robots, cleaning robots, and underwater robots. The bio-inspired neural network
has been widely used in real-time collision-free navigation and cooperation
without any learning procedures, global cost functions, and prior knowledge of
the dynamic environment. In addition, bio-inspired backstepping controllers for
various robotic systems, which are able to eliminate the speed jump when a
large initial tracking error occurs, are further discussed. Finally, the
current challenges and future research directions are discussed in this paper.
","[{'version': 'v1', 'created': 'Fri, 17 Jun 2022 04:35:39 GMT'}]",2022-06-20,"[['Li', 'Junfei', ''], ['Xu', 'Zhe', ''], ['Zhu', 'Danjie', ''], ['Dong', 'Kevin', ''], ['Yan', 'Tao', ''], ['Zeng', 'Zhu', ''], ['Yang', 'Simon X.', '']]","['Biologically inspired algorithms', 'neurodynamics', 'path planning', 'mobile robots', 'cleaning robots', 'underwaterrobots', 'tracking control', 'formation control']"
8443,2105.13699,Jihyeok Park,"Joonyoung Park, Jihyeok Park, Dongjun Youn, Sukyoung Ryu","Accelerating JavaScript Static Analysis via Dynamic Shortcuts (Extended
  Version)","16 pages, 11 figures, 1 table, In Proceedings of the 29th ACM Joint
  European Software Engineering Conference and Symposium on the Foundations of
  Software Engineering (ESEC/FSE'21)",,10.1145/3468264.3468556,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  JavaScript has become one of the most widely used programming languages for
web development, server-side programming, and even micro-controllers for IoT.
However, its extremely functional and dynamic features degrade the performance
and precision of static analysis. Moreover, the variety of built-in functions
and host environments requires excessive manual modeling of their behaviors. To
alleviate these problems, researchers have proposed various ways to leverage
dynamic analysis during JavaScript static analysis. However, they do not fully
utilize the high performance of dynamic analysis and often sacrifice the
soundness of static analysis.
  In this paper, we present dynamic shortcuts, a new technique to flexibly
switch between abstract and concrete execution during JavaScript static
analysis in a sound way. It can significantly improve the analysis performance
and precision by using highly-optimized commercial JavaScript engines and
lessen the modeling efforts for opaque code. We actualize the technique via
$\text{SAFE}_\textsf{DS}$, an extended combination of $\text{SAFE}$ and
Jalangi, a static analyzer and a dynamic analyzer, respectively. We evaluated
$\text{SAFE}_\textsf{DS}$ using 269 official tests of Lodash 4 library. Our
experiment shows that $\text{SAFE}_\textsf{DS}$ is 7.81x faster than the
baseline static analyzer, and it improves the precision to reduce failed
assertions by 12.31% on average for 22 opaque functions.
","[{'version': 'v1', 'created': 'Fri, 28 May 2021 09:48:53 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Jun 2021 05:35:04 GMT'}]",2021-06-02,"[['Park', 'Joonyoung', ''], ['Park', 'Jihyeok', ''], ['Youn', 'Dongjun', ''], ['Ryu', 'Sukyoung', '']]","['JavaScript', 'static analysis', 'dynamic analysis', 'dynamic shortcut', 'sealed execution']"
8444,2103.07454,Soumyadip Ghosh,"Soumyadip Ghosh, Bernardo Aquino, Vijay Gupta",EventGraD: Event-Triggered Communication in Parallel Machine Learning,"Published in Neurocomputing, Nov 2021",,10.1016/j.neucom.2021.08.143,,cs.LG cs.DC cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Communication in parallel systems imposes significant overhead which often
turns out to be a bottleneck in parallel machine learning. To relieve some of
this overhead, in this paper, we present EventGraD - an algorithm with
event-triggered communication for stochastic gradient descent in parallel
machine learning. The main idea of this algorithm is to modify the requirement
of communication at every iteration in standard implementations of stochastic
gradient descent in parallel machine learning to communicating only when
necessary at certain iterations. We provide theoretical analysis of convergence
of our proposed algorithm. We also implement the proposed algorithm for
data-parallel training of a popular residual neural network used for training
the CIFAR-10 dataset and show that EventGraD can reduce the communication load
by up to 60% while retaining the same level of accuracy. In addition, EventGraD
can be combined with other approaches such as Top-K sparsification to decrease
communication further while maintaining accuracy.
","[{'version': 'v1', 'created': 'Fri, 12 Mar 2021 18:28:50 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Dec 2021 23:35:24 GMT'}]",2021-12-10,"[['Ghosh', 'Soumyadip', ''], ['Aquino', 'Bernardo', ''], ['Gupta', 'Vijay', '']]","['Machine Learning', 'Event-Triggered Communication', 'Parallel']"
8445,1810.02542,Mostafa Zaman Chowdhury,"Shakil Ahmed, Mohammad Arif Hossain, and Mostafa Zaman Chowdhury","Interference Declination for Dynamic Channel Borrowing Scheme in
  Wireless Network","International Conference on Informatics, Electronics & Vision
  (ICIEV), May 2014, Dhaka, Bangladesh",,10.1109/ICIEV.2014.6850739,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In modern days, users in the wireless networks are increasing drastically. It
has become the major concern for researchers to manage the maximum users with
limited radio resource. Interference is one of the biggest hindrances to reach
the goal. In this paper, being deep apprehension of the issue, an efficient
dynamic channel borrowing scheme is proposed that ensures better Quality of
Service (QoS) with interference declination. We propose that if channels are
borrowed from adjacent cells, cell bifurcation will be introduced that ensures
interference declination when the borrowed channels have same frequency band.
We also propose a scheme that inactivates the unoccupied interfering channels
of adjacent cells, instead of cell bifurcation for interference declination.
The simulation outcomes show acceptable performances in terms of SINR level,
system capacity, and outage probability compared to conventional scheme without
interference declination that may attract the considerable interest for the
users.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 06:59:29 GMT'}]",2018-10-08,"[['Ahmed', 'Shakil', ''], ['Hossain', 'Mohammad Arif', ''], ['Chowdhury', 'Mostafa Zaman', '']]","['Dynamic channel allocation', 'Quality of Service (QoS)', 'cell bifurcation', 'interference declination', 'SINR level', 'capacity', 'outage probability']"
8446,2009.00893,Chen Shen,"Shaotian Yan, Chen Shen, Zhongming Jin, Jianqiang Huang, Rongxin
  Jiang, Yaowu Chen, Xian-Sheng Hua","PCPL: Predicate-Correlation Perception Learning for Unbiased Scene Graph
  Generation",To be appeared on ACMMM 2020,,10.1145/3394171.3413722,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today, scene graph generation(SGG) task is largely limited in realistic
scenarios, mainly due to the extremely long-tailed bias of predicate annotation
distribution. Thus, tackling the class imbalance trouble of SGG is critical and
challenging. In this paper, we first discover that when predicate labels have
strong correlation with each other, prevalent re-balancing strategies(e.g.,
re-sampling and re-weighting) will give rise to either over-fitting the tail
data(e.g., bench sitting on sidewalk rather than on), or still suffering the
adverse effect from the original uneven distribution(e.g., aggregating varied
parked on/standing on/sitting on into on). We argue the principal reason is
that re-balancing strategies are sensitive to the frequencies of predicates yet
blind to their relatedness, which may play a more important role to promote the
learning of predicate features. Therefore, we propose a novel
Predicate-Correlation Perception Learning(PCPL for short) scheme to adaptively
seek out appropriate loss weights by directly perceiving and utilizing the
correlation among predicate classes. Moreover, our PCPL framework is further
equipped with a graph encoder module to better extract context features.
Extensive experiments on the benchmark VG150 dataset show that the proposed
PCPL performs markedly better on tail classes while well-preserving the
performance on head ones, which significantly outperforms previous
state-of-the-art methods.
","[{'version': 'v1', 'created': 'Wed, 2 Sep 2020 08:30:09 GMT'}]",2020-09-03,"[['Yan', 'Shaotian', ''], ['Shen', 'Chen', ''], ['Jin', 'Zhongming', ''], ['Huang', 'Jianqiang', ''], ['Jiang', 'Rongxin', ''], ['Chen', 'Yaowu', ''], ['Hua', 'Xian-Sheng', '']]","['Scene Graph Generation', 'Long-tailed Bias', 'Correlation Perception']"
8447,1606.03236,"Vincent C. M\""uller","Vincent C. M\""uller","Interaction and resistance: The recognition of intentions in new
  human-computer interaction",,"(2011) In A. Esposito, A. M. Esposito, R. Martone, V. C. M\""uller,
  & G. Scarpetta (Eds.), Towards autonomous, adaptive, and context-aware
  multimodal interfaces: Theoretical and practical issues (Vol. 6456, pp. 1-7).
  Berlin: Springer",10.1007/978-3-642-18184-9_1,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Just as AI has moved away from classical AI, human-computer interaction (HCI)
must move away from what I call 'good old fashioned HCI' to 'new HCI' - it must
become a part of cognitive systems research where HCI is one case of the
interaction of intelligent agents (we now know that interaction is essential
for intelligent agents anyway). For such interaction, we cannot just 'analyze
the data', but we must assume intentions in the other, and I suggest these are
largely recognized through resistance to carrying out one's own intentions.
This does not require fully cognitive agents but can start at a very basic
level. New HCI integrates into cognitive systems research and designs
intentional systems that provide resistance to the human agent.
","[{'version': 'v1', 'created': 'Fri, 10 Jun 2016 09:11:52 GMT'}]",2016-06-13,"[['Müller', 'Vincent C.', '']]","['Human-computer interaction', 'AI', 'cognitive systems', 'interaction', 'intelligence', 'resistance', 'systems design']"
8448,2012.02745,Daniel De Almeida Braga,"Daniel De Almeida Braga, Pierre-Alain Fouque, Mohamed Sabt","Dragonblood is Still Leaking: Practical Cache-based Side-Channel in the
  Wild","Accepted at Annual Computer Security Applications Conference (ACSAC
  2020), December 7-11, 2020, Austin, USA. ACM, New York, NY, USA, 13 pages,
  ACM ISBN 978-1-4503-8858-0/20/12 Artifact available:
  https://gitlab.inria.fr/ddealmei/poc-iwd-acsac2020/-/tree/master/",,10.1145/3427228.3427295,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Recently, the Dragonblood attacks have attracted new interests on the
security of WPA-3 implementation and in particular on the Dragonfly code
deployed on many open-source libraries. One attack concerns the protection of
users passwords during authentication. In the Password Authentication Key
Exchange (PAKE) protocol called Dragonfly, the secret, namely the password, is
mapped to an elliptic curve point. This operation is sensitive, as it involves
the secret password, and therefore its resistance against side-channel attacks
is of utmost importance. Following the initial disclosure of Dragonblood, we
notice that this particular attack has been partially patched by only a few
implementations.
  In this work, we show that the patches implemented after the disclosure of
Dragonblood are insufficient. We took advantage of state-of-the-art techniques
to extend the original attack, demonstrating that we are able to recover the
password with only a third of the measurements needed in Dragonblood attack. We
mainly apply our attack on two open-source projects: iwd (iNet Wireless Daemon)
and FreeRADIUS, in order underline the practicability of our attack. Indeed,
the iwd package, written by Intel, is already deployed in the Arch Linux
distribution, which is well-known among security experts, and aims to offer an
alternative to wpa\_supplicant. As for FreeRADIUS, it is widely deployed and
well-maintained upstream open-source project. We publish a full Proof of
Concept of our attack, and actively participated in the process of patching the
vulnerable code. Here, in a backward compatibility perspective, we advise the
use of a branch-free implementation as a mitigation technique, as what was used
in hostapd, due to its quite simplicity and its negligible incurred overhead.
","[{'version': 'v1', 'created': 'Fri, 4 Dec 2020 17:55:19 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Dec 2020 21:19:24 GMT'}]",2020-12-09,"[['Braga', 'Daniel De Almeida', ''], ['Fouque', 'Pierre-Alain', ''], ['Sabt', 'Mohamed', '']]","['Dragonfly', 'PAKE', 'WPA3', 'Wi-Fi', 'cache attack']"
8449,2110.01010,Zhaoxia Yin,"Wanli Lv, Lulu Cheng and Zhaoxia Yin","High Capacity Reversible Data Hiding in Encrypted 3D Mesh Models Based
  on Multi-MSB Prediction",Published in Signal Processing,"Volume 201, December 2022, 108686",10.1016/j.sigpro.2022.108686,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As a new generation of digital media for covert transmission, three-dimension
(3D) mesh models are frequently used and distributed on the network. Facing the
huge massive of network data, it is urgent to study a method to protect and
store this large amounts of data. In this paper, we proposed a high capacity
reversible data hiding in encrypted 3D mesh models. This method divides the
vertices of all 3D mesh into ""embedded sets"" and ""prediction sets"" based on the
parity of the index. In addition, the multiple most significant bit (Multi-MSB)
prediction reserved space is used to adaptively embed secret message, and the
auxiliary information is compressed by arithmetic coding to further free up
redundant space of the 3D mesh models. We use the majority voting system(MSV)
principle to restore the original mesh model with high quality. The
experimental results show that our method achieves a higher embedding capacity
compared with state-of-the-art RDH-ED methods on 3D mesh models and can restore
the original 3D mesh models with high quality.
","[{'version': 'v1', 'created': 'Sun, 3 Oct 2021 14:21:46 GMT'}, {'version': 'v2', 'created': 'Sat, 17 Dec 2022 02:08:00 GMT'}]",2022-12-20,"[['Lv', 'Wanli', ''], ['Cheng', 'Lulu', ''], ['Yin', 'Zhaoxia', '']]","['Encrypted 3D mesh model', 'multi-MSB prediction', 'arithmetic coding']"
8450,2101.05614,Prajoy Podder,"Prajoy Podder, M. Rubaiyat Hossain Mondal, Subrato Bharati, Pinto
  Kumar Paul",Review on the Security Threats of Internet of Things,"9 Pages, 9 figures","International Journal of Computer Applications (IJCA), 2020",10.5120/ijca2020920548,,cs.CR eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet of Things (IoT) is being considered as the growth engine for
industrial revolution 4.0. The combination of IoT, cloud computing and
healthcare can contribute in ensuring well-being of people. One important
challenge of IoT network is maintaining privacy and to overcome security
threats. This paper provides a systematic review of the security aspects of
IoT. Firstly, the application of IoT in industrial and medical service
scenarios are described, and the security threats are discussed for the
different layers of IoT healthcare architecture. Secondly, different types of
existing malware including spyware, viruses, worms, keyloggers, and trojan
horses are described in the context of IoT. Thirdly, some of the recent malware
attacks such as Mirai, echobot and reaper are discussed. Next, a comparative
discussion is presented on the effectiveness of different machine learning
algorithms in mitigating the security threats. It is found that the k-nearest
neighbor (kNN) machine learning algorithm exhibits excellent accuracy in
detecting malware. This paper also reviews different tools for ransomware
detection, classification and analysis. Finally, a discussion is presented on
the existing security issues, open challenges and possible future scopes in
ensuring IoT security.
","[{'version': 'v1', 'created': 'Tue, 12 Jan 2021 08:48:16 GMT'}]",2021-01-15,"[['Podder', 'Prajoy', ''], ['Mondal', 'M. Rubaiyat Hossain', ''], ['Bharati', 'Subrato', ''], ['Paul', 'Pinto Kumar', '']]","['Accuracy', 'IoT', 'IoMT', 'Intrusion Detection', 'Malware', 'Machine Learning', 'Ransomware', 'Threats']"
8451,2004.01084,Shenyue Jia,"Shenyue Jia, Seung Hee Kim, Son V. Nghiem, Paul Doherty, Menas Kafatos","Patterns of population displacement during mega-fires in California
  detected using Facebook Disaster Maps",16 pages with supplemental information,,10.1088/1748-9326/ab8847,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Facebook Disaster Maps (FBDM) is the first platform providing analysis-ready
population change products derived from crowdsourced data targeting disaster
relief practices. We evaluate the representativeness of FBDM data using the
Mann-Kendall test and emerging hot and cold spots in an anomaly analysis to
reveal the trend, magnitude, and agglommeration of population displacement
during the Mendocino Complex and Woolsey fires in California, USA. Our results
show that the distribution of FBDM pre-crisis users fits well with the total
population from different sources. Due to usage habits, the elder population is
underrepresented in FBDM data. During the two mega-fires in California, FBDM
data effectively captured the temporal change of population arising from the
placing and lifting of evacuation orders. Coupled with monotonic trends, the
fall and rise of cold and hot spots of population revealed the areas with the
greatest population drop and potential places to house the displaced residents.
A comparison between the Mendocino Complex and Woolsey fires indicates that a
densely populated region can be evacuated faster than a scarcely populated one,
possibly due to the better access to transportation. In sparsely populated
fire-prone areas, resources should be prioritized to move people to shelters as
the displaced residents do not have many alternative options, while their
counterparts in densely populated areas can utilize their social connections to
seek temporary stay at nearby locations during an evacuation. Integrated with
an assessment on underrepresented communities, FBDM data and the derivatives
can provide much needed information of near real-time population displacement
for crisis response and disaster relief. As applications and data generation
mature, FBDM will harness crowdsourced data and aid first responder
decision-making.
","[{'version': 'v1', 'created': 'Thu, 2 Apr 2020 15:42:36 GMT'}]",2020-08-26,"[['Jia', 'Shenyue', ''], ['Kim', 'Seung Hee', ''], ['Nghiem', 'Son V.', ''], ['Doherty', 'Paul', ''], ['Kafatos', 'Menas', '']]","['Facebook Disaster Maps', 'crowdsourced data', 'social media', 'Mann-Kendall trend', 'anomaly analysis', 'wildfires', 'California']"
8452,1910.11629,Danel Ahman,Danel Ahman and Andrej Bauer,Runners in action,ESOP 2020 final version + online appendix,,10.1007/978-3-030-44914-8_2,,cs.PL,http://creativecommons.org/licenses/by/4.0/,"  Runners of algebraic effects, also known as comodels, provide a mathematical
model of resource management. We show that they also give rise to a programming
concept that models top-level external resources, as well as allows programmers
to modularly define their own intermediate ""virtual machines"". We capture the
core ideas of programming with runners in an equational calculus
$\lambda_{\mathsf{coop}}$, which we equip with a sound and coherent
denotational semantics that guarantees the linear use of resources and
execution of finalisation code. We accompany $\lambda_{\mathsf{coop}}$ with
examples of runners in action, provide a prototype language implementation in
OCaml, as well as a Haskell library based on $\lambda_{\mathsf{coop}}$.
","[{'version': 'v1', 'created': 'Fri, 25 Oct 2019 11:37:35 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Apr 2020 20:26:57 GMT'}]",2020-04-21,"[['Ahman', 'Danel', ''], ['Bauer', 'Andrej', '']]","['Runners', 'comodels', 'algebraic effects', 'resources', 'finalisation']"
8453,2210.15700,Islam Debicha,"Islam Debicha, Richard Bauwens, Thibault Debatty, Jean-Michel Dricot,
  Tayeb Kenaza, Wim Mees","TAD: Transfer Learning-based Multi-Adversarial Detection of Evasion
  Attacks against Network Intrusion Detection Systems",This is a preprint of an already published journal paper,Future Generation Computer Systems 138 (2023): 185-197,10.1016/j.future.2022.08.011,,cs.CR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, intrusion detection systems based on deep learning deliver
state-of-the-art performance. However, recent research has shown that specially
crafted perturbations, called adversarial examples, are capable of
significantly reducing the performance of these intrusion detection systems.
The objective of this paper is to design an efficient transfer learning-based
adversarial detector and then to assess the effectiveness of using multiple
strategically placed adversarial detectors compared to a single adversarial
detector for intrusion detection systems. In our experiments, we implement
existing state-of-the-art models for intrusion detection. We then attack those
models with a set of chosen evasion attacks. In an attempt to detect those
adversarial attacks, we design and implement multiple transfer learning-based
adversarial detectors, each receiving a subset of the information passed
through the IDS. By combining their respective decisions, we illustrate that
combining multiple detectors can further improve the detectability of
adversarial traffic compared to a single detector in the case of a parallel IDS
design.
","[{'version': 'v1', 'created': 'Thu, 27 Oct 2022 18:02:58 GMT'}]",2022-10-31,"[['Debicha', 'Islam', ''], ['Bauwens', 'Richard', ''], ['Debatty', 'Thibault', ''], ['Dricot', 'Jean-Michel', ''], ['Kenaza', 'Tayeb', ''], ['Mees', 'Wim', '']]","['Intrusion detection system', 'Machine learning', 'Evasion attacks', 'Adversarial detection', 'Transfer learning', 'Data fusion']"
8454,2012.03669,Challiz Omorog,"C. D. Omorog, R. P. Medina",Internet Security Awareness of Filipinos: A Survey Paper,13 pages,IJCSR. Vol 1 No. 4 (2018) 14-26,10.25147/ijcsr.2017.001.1.18,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose. This paper examines the Internet security perception of Filipinos to
establish a need and sense of urgency on the part of the government to create a
culture of cybersecurity for every Filipino. Method. A quantitative survey was
conducted through traditional, online, and phone interviews among 252
respondents using a two-page questionnaire that covers basic demographic
information and two key elements (1) Internet usage and (2) security practices.
Results. Based on findings, there is a sharp increase in Internet users for the
last three years (50%), and most access to the Internet through mobile (94.4%).
Although at home is the most frequent location for Internet access (94.4%), a
good percentage still use free WiFi access points available in malls (22.2%),
restaurants (11.1%), and other public areas (38.9%) doing Internet services
(email and downloading) that are vulnerable to cyberattacks. The study also
revealed that although respondents may have good knowledge of Internet security
software, proper implementation is very limited. Conclusion. Filipinos are
susceptible to cyberattacks, particularly to phishing and malware attacks.
Also, the majority of the respondents' Internet security perception is
derivative: they practice online measures but with a limited understanding of
the purpose. Therefore proper education, through training and awareness, is an
effective approach to remedy the situation. Recommendations. The Philippine
government must now take actions and tap industries to educate Filipinos about
Internet security before any negative consequences happen in the future.
Research Implications. The information collected sets a clear picture of the
importance of cybersecurity awareness from a regional to a global perspective.
","[{'version': 'v1', 'created': 'Sat, 21 Nov 2020 02:56:27 GMT'}]",2020-12-08,"[['Omorog', 'C. D.', ''], ['Medina', 'R. P.', '']]","['Internet usage', 'security awareness', 'wireless access point', 'cybersecurity    INTRODUCTION']"
8455,1911.06924,Ramesh Krishnan S. Pallavoor,"Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova and Erik Waingarten",Approximating the Distance to Monotonicity of Boolean Functions,To be published in Random Structures & Algorithms,,10.4230/LIPIcs.ITCS.2021.80,,cs.DS cs.CC cs.DM,http://creativecommons.org/licenses/by/4.0/,"  We design a nonadaptive algorithm that, given oracle access to a function $f:
\{0,1\}^n \to \{0,1\}$ which is $\alpha$-far from monotone, makes poly$(n,
1/\alpha)$ queries and returns an estimate that, with high probability, is an
$\widetilde{O}(\sqrt{n})$-approximation to the distance of $f$ to monotonicity.
The analysis of our algorithm relies on an improvement to the directed
isoperimetric inequality of Khot, Minzer, and Safra (SIAM J. Comput., 2018).
Furthermore, we rule out a poly$(n, 1/\alpha)$-query nonadaptive algorithm that
approximates the distance to monotonicity significantly better by showing that,
for all constant $\kappa > 0,$ every nonadaptive $n^{1/2 -
\kappa}$-approximation algorithm for this problem requires $2^{n^\kappa}$
queries. This answers a question of Seshadhri (Property Testing Review, 2014)
for the case of nonadaptive algorithms. We obtain our lower bound by proving an
analogous bound for erasure-resilient (and tolerant) testers. Our method also
yields the same lower bounds for unateness and being a $k$-junta.
","[{'version': 'v1', 'created': 'Sat, 16 Nov 2019 00:43:43 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Feb 2021 08:35:43 GMT'}]",2021-02-26,"[['Pallavoor', 'Ramesh Krishnan S.', ''], ['Raskhodnikova', 'Sofya', ''], ['Waingarten', 'Erik', '']]","['sublinear algorithms', 'analysis of Boolean functions', 'property testing', 'tolerant anderasure-resilient testing']"
8456,cs/0611032,Valmir Barbosa,"Andre Nathan, Valmir C. Barbosa",V-like formations in flocks of artificial birds,,"Artificial Life 14 (2008), 179-188",10.1162/artl.2008.14.2.179,,cs.NE,,"  We consider flocks of artificial birds and study the emergence of V-like
formations during flight. We introduce a small set of fully distributed
positioning rules to guide the birds' movements and demonstrate, by means of
simulations, that they tend to lead to stabilization into several of the
well-known V-like formations that have been observed in nature. We also provide
quantitative indicators that we believe are closely related to achieving V-like
formations, and study their behavior over a large set of independent
simulations.
","[{'version': 'v1', 'created': 'Tue, 7 Nov 2006 20:25:28 GMT'}, {'version': 'v2', 'created': 'Sun, 8 Apr 2007 23:01:48 GMT'}]",2008-04-11,"[['Nathan', 'Andre', ''], ['Barbosa', 'Valmir C.', '']]","['Artificial birds', 'Boids', 'Flocking', 'V-like flight formations']"
8457,1910.10492,Haozheng Luo,"Haozheng Luo, Ningwei Liu, Charles Feng",Question Classification with Deep Contextualized Transformer,,,10.1007/978-3-030-73103-8_32,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The latest work for Question and Answer problems is to use the Stanford Parse
Tree. We build on prior work and develop a new method to handle the Question
and Answer problem with the Deep Contextualized Transformer to manage some
aberrant expressions. We also conduct extensive evaluations of the SQuAD and
SwDA dataset and show significant improvement over QA problem classification of
industry needs. We also investigate the impact of different models for the
accuracy and efficiency of the problem answers. It shows that our new method is
more effective for solving QA problems with higher accuracy
","[{'version': 'v1', 'created': 'Thu, 17 Oct 2019 23:00:22 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Apr 2020 17:15:23 GMT'}]",2021-06-04,"[['Luo', 'Haozheng', ''], ['Liu', 'Ningwei', ''], ['Feng', 'Charles', '']]","['QA Classification', 'NLP', 'Selfattention', 'Self-attention']"
8458,1909.13038,"Markus K\""uhbach","Markus K\""uhbach and Franz Roters","Quantification of 3D spatial correlations between state variables and
  distances to the grain boundary network in full-field crystal plasticity
  spectral method simulations","Manuscript submitted to Modelling and Simulation in Materials Science
  and Engineering",,10.1088/1361-651X/ab7f8c,,cs.CE cond-mat.mtrl-sci,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deformation microstructure heterogeneities play a pivotal role during
dislocation patterning and interface network restructuring. Thus, they affect
indirectly how an alloy recrystallizes if at all. Given this relevance, it has
become common practice to study the evolution of deformation microstructure
heterogeneities with 3D experiments and full-field crystal plasticity computer
simulations including tools such as the spectral method.
  Quantifying material point to grain or phase boundary distances, though, is a
practical challenge with spectral method crystal plasticity models because
these discretize the material volume rather than mesh explicitly the grain and
phase boundary interface network. This limitation calls for the development of
interface reconstruction algorithms which enable us to develop specific data
post-processing protocols to quantify spatial correlations between state
variable values at each material point and the points' corresponding distance
to the closest grain or phase boundary.
  This work contributes to advance such post-processing routines. Specifically,
two grain reconstruction and three distancing methods are developed to solve
above challenge. The individual strengths and limitations of these methods
surplus the efficiency of their parallel implementation is assessed with an
exemplary DAMASK large scale crystal plasticity study. We apply the new tool to
assess the evolution of subtle stress and disorientation gradients towards
grain boundaries.
","[{'version': 'v1', 'created': 'Sat, 28 Sep 2019 06:56:42 GMT'}]",2020-06-24,"[['Kühbach', 'Markus', ''], ['Roters', 'Franz', '']]","['Crystal plasticity', 'gradients', 'interfaces', 'sliptransfer', 'data-mining', 'parallelization', 'DAMASK']"
8459,2005.04167,Ruthvik Vaila,"Ruthvik Vaila, John Chiasson, Vishal Saxena","Continuous Learning in a Single-Incremental-Task Scenario with Spike
  Features",Submitted to ICONS 2020,nternational Conference on Neuromorphic Systems 2020,10.1145/3407197.3407213,,cs.NE cs.LG,http://creativecommons.org/publicdomain/zero/1.0/,"  Deep Neural Networks (DNNs) have two key deficiencies, their dependence on
high precision computing and their inability to perform sequential learning,
that is, when a DNN is trained on a first task and the same DNN is trained on
the next task it forgets the first task. This phenomenon of forgetting previous
tasks is also referred to as catastrophic forgetting. On the other hand a
mammalian brain outperforms DNNs in terms of energy efficiency and the ability
to learn sequentially without catastrophically forgetting. Here, we use
bio-inspired Spike Timing Dependent Plasticity (STDP)in the feature extraction
layers of the network with instantaneous neurons to extract meaningful
features. In the classification sections of the network we use a modified
synaptic intelligence that we refer to as cost per synapse metric as a
regularizer to immunize the network against catastrophic forgetting in a
Single-Incremental-Task scenario (SIT). In this study, we use MNIST handwritten
digits dataset that was divided into five sub-tasks.
","[{'version': 'v1', 'created': 'Sun, 3 May 2020 16:18:20 GMT'}]",2020-07-14,"[['Vaila', 'Ruthvik', ''], ['Chiasson', 'John', ''], ['Saxena', 'Vishal', '']]","['neural networks', 'feature extraction', 'STDP', 'catastrophic forgetting', 'single-incremental-task', 'fisher information']"
8460,2002.12693,Hamid Rahkooy,Hamid Rahkooy and Ovidiu Radulescu and Thomas Sturm,"A Linear Algebra Approach for Detecting Binomiality of Steady State
  Ideals of Reversible Chemical Reaction Networks",,"Proc. CASC 2020, LNCS 12291, pp.492-509, Springer 2020",10.1007/978-3-030-60026-6_29,,cs.SC q-bio.MN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by problems from Chemical Reaction Network Theory, we investigate
whether steady state ideals of reversible reaction networks are generated by
binomials. We take an algebraic approach considering, besides concentrations of
species, also rate constants as indeterminates. This leads us to the concept of
unconditional binomiality, meaning binomiality for all values of the rate
constants. This concept is different from conditional binomiality that applies
when rate constant values or relations among rate constants are given. We start
by representing the generators of a steady state ideal as sums of binomials,
which yields a corresponding coefficient matrix. On these grounds we propose an
efficient algorithm for detecting unconditional binomiality. That algorithm
uses exclusively elementary column and row operations on the coefficient
matrix. We prove asymptotic worst case upper bounds on the time complexity of
our algorithm. Furthermore, we experimentally compare its performance with
other existing methods.
","[{'version': 'v1', 'created': 'Fri, 28 Feb 2020 13:07:53 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Jun 2020 17:03:58 GMT'}]",2020-10-22,"[['Rahkooy', 'Hamid', ''], ['Radulescu', 'Ovidiu', ''], ['Sturm', 'Thomas', '']]","['Binomial Ideals', 'Linear Algebra', 'Reversible Chemical Reaction Networks']"
8461,2008.06865,Tafseer Ahmed,"Tafseer Ahmed, Muhammad Suffian Nizami, Muhammad Yaseen Khan","Discovering Lexical Similarity Through Articulatory Feature-based
  Phonetic Edit Distance",,,10.1109/ACCESS.2021.3137905,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lexical Similarity (LS) between two languages uncovers many interesting
linguistic insights such as genetic relationship, mutual intelligibility, and
the usage of one's vocabulary into other. There are various methods through
which LS is evaluated. In the same regard, this paper presents a method of
Phonetic Edit Distance (PED) that uses a soft comparison of letters using the
articulatory features associated with them. The system converts the words into
the corresponding International Phonetic Alphabet (IPA), followed by the
conversion of IPA into its set of articulatory features. Later, the lists of
the set of articulatory features are compared using the proposed method. As an
example, PED gives edit distance of German word vater and Persian word pidar as
0.82; and similarly, Hebrew word shalom and Arabic word salaam as 0.93, whereas
for a juxtapose comparison, their IPA based edit distances are 4 and 2
respectively. Experiments are performed with six languages (Arabic, Hindi,
Marathi, Persian, Sanskrit, and Urdu). In this regard, we extracted part of
speech wise word-lists from the Universal Dependency corpora and evaluated the
LS for every pair of language. Thus, with the proposed approach, we find the
genetic affinity, similarity, and borrowing/loan-words despite having script
differences and sound variation phenomena among these languages.
","[{'version': 'v1', 'created': 'Sun, 16 Aug 2020 09:28:37 GMT'}]",2022-01-21,"[['Ahmed', 'Tafseer', ''], ['Nizami', 'Muhammad Suffian', ''], ['Khan', 'Muhammad Yaseen', '']]","['\u200b Lexical Similarity', 'Edit Distance', 'Phonetic Matching', 'Articulatory Features']"
8462,2209.08682,Harvineet Singh,"Harvineet Singh, Shalmali Joshi, Finale Doshi-Velez, Himabindu
  Lakkaraju",Towards Robust Off-Policy Evaluation via Human Inputs,"10 pages, 5 figures, 1 table. Appeared at AIES '22: Proceedings of
  the 2022 AAAI/ACM Conference on AI, Ethics, and Society. Expanded version of
  arXiv:2103.15933",,10.1145/3514094.3534198,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Off-policy Evaluation (OPE) methods are crucial tools for evaluating policies
in high-stakes domains such as healthcare, where direct deployment is often
infeasible, unethical, or expensive. When deployment environments are expected
to undergo changes (that is, dataset shifts), it is important for OPE methods
to perform robust evaluation of the policies amidst such changes. Existing
approaches consider robustness against a large class of shifts that can
arbitrarily change any observable property of the environment. This often
results in highly pessimistic estimates of the utilities, thereby invalidating
policies that might have been useful in deployment. In this work, we address
the aforementioned problem by investigating how domain knowledge can help
provide more realistic estimates of the utilities of policies. We leverage
human inputs on which aspects of the environments may plausibly change, and
adapt the OPE methods to only consider shifts on these aspects. Specifically,
we propose a novel framework, Robust OPE (ROPE), which considers shifts on a
subset of covariates in the data based on user inputs, and estimates worst-case
utility under these shifts. We then develop computationally efficient
algorithms for OPE that are robust to the aforementioned shifts for contextual
bandits and Markov decision processes. We also theoretically analyze the sample
complexity of these algorithms. Extensive experimentation with synthetic and
real world datasets from the healthcare domain demonstrates that our approach
not only captures realistic dataset shifts accurately, but also results in less
pessimistic policy evaluations.
","[{'version': 'v1', 'created': 'Sun, 18 Sep 2022 23:59:55 GMT'}]",2022-09-20,"[['Singh', 'Harvineet', ''], ['Joshi', 'Shalmali', ''], ['Doshi-Velez', 'Finale', ''], ['Lakkaraju', 'Himabindu', '']]","['dataset shift', 'policy evaluation', 'robust learning', 'adversarial machinelearning', 'human-in-the-loop']"
8463,1707.00754,Radoslaw Nielek,"Grzegorz Kowalik, Radoslaw Nielek",Senior Programmers: Characteristics of Elderly Users from Stack Overflow,,,10.1007/978-3-319-47874-6_7,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we presents results of research about elderly users of Stack
Overflow (Question and Answer portal for programmers). They have different
roles, different main activities and different habits. They are an important
part of the community, as they tend to have higher reputation and they like to
share their knowledge. This is a great example of possible way of keeping
elderly people active and helpful for society.
","[{'version': 'v1', 'created': 'Mon, 3 Jul 2017 20:51:36 GMT'}]",2017-07-05,"[['Kowalik', 'Grzegorz', ''], ['Nielek', 'Radoslaw', '']]","['elderly', 'Stack Overflow', 'Q&A', 'aging', 'online communities', 'programmers', 'crowdsourcing']"
8464,2001.04425,Hiba Arnaout,"Hiba Arnaout, Simon Razniewski, Gerhard Weikum, and Jeff Z. Pan",Negative Statements Considered Useful,,"Journal of Web Semantics (JWS), Volume 71, 2021",10.1016/j.websem.2021.100661,,cs.IR cs.AI cs.CL cs.DB,http://creativecommons.org/licenses/by/4.0/,"  Knowledge bases (KBs) about notable entities and their properties are an
important asset in applications such as search, question answering and
dialogue. All popular KBs capture virtually only positive statements, and
abstain from taking any stance on statements not stored in the KB. This paper
makes the case for explicitly stating salient statements that do not hold.
Negative statements are useful to overcome limitations of question answering
systems that are mainly geared for positive questions; they can also contribute
to informative summaries of entities. Due to the abundance of such invalid
statements, any effort to compile them needs to address ranking by saliency. We
present a statisticalinference method for compiling and ranking negative
statements, based on expectations from positive statements of related entities
in peer groups. Experimental results, with a variety of datasets, show that the
method can effectively discover notable negative statements, and extrinsic
studies underline their usefulness for entity summarization. Datasets and code
are released as resources for further research.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2020 17:49:37 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Jan 2020 14:42:40 GMT'}, {'version': 'v3', 'created': 'Mon, 20 Jan 2020 14:45:01 GMT'}, {'version': 'v4', 'created': 'Tue, 8 Sep 2020 09:00:13 GMT'}, {'version': 'v5', 'created': 'Wed, 15 Sep 2021 10:42:35 GMT'}, {'version': 'v6', 'created': 'Sat, 25 Sep 2021 09:02:47 GMT'}]",2021-11-29,"[['Arnaout', 'Hiba', ''], ['Razniewski', 'Simon', ''], ['Weikum', 'Gerhard', ''], ['Pan', 'Jeff Z.', '']]","['knowledge bases', 'negative knowledge', 'information extraction', 'statistical inference', 'ranking']"
8465,2202.11999,Oliviero Riganelli,"Oliviero Riganelli, Ionut Daniel Fagadau, Daniela Micucci, Leonardo
  Mariani",Proactive Libraries: Enforcing Correct Behaviors in Android Apps,"Accepted for publication in the Proceedings of the 44th International
  Conference on Software Engineering (ICSE 2022). arXiv admin note: substantial
  text overlap with arXiv:1911.09357, arXiv:1703.08005",,10.1145/3510454.3516837,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Android framework provides a rich set of APIs that can be exploited by
developers to build their apps. However, the rapid evolution of these APIs
jointly with the specific characteristics of the lifecycle of the Android
components challenge developers, who may release apps that use APIs
incorrectly. In this demo, we present Proactive Libraries, a tool that can be
used to decorate regular libraries with the capability of proactively detecting
and healing API misuses at runtime. Proactive Libraries blend libraries with
multiple proactive modules that collect data, check the compliance of API
usages with correctness policies, and heal executions as soon as the possible
violation of a policy is detected. The results of our evaluation with 27
possible API misuses show the effectiveness of Proactive Libraries in
correcting API misuses with negligible runtime overhead.
","[{'version': 'v1', 'created': 'Thu, 24 Feb 2022 10:25:43 GMT'}]",2022-02-25,"[['Riganelli', 'Oliviero', ''], ['Fagadau', 'Ionut Daniel', ''], ['Micucci', 'Daniela', ''], ['Mariani', 'Leonardo', '']]","['runtime enforcement', 'self-healing', 'proactive library', 'API misuse', 'Android']"
8466,2101.10231,David Daly,David Daly,Creating a Virtuous Cycle in Performance Testing at MongoDB,"Author's copy and preprint. Accepted for publication at ICPE2021. 9
  pages, 5 figures",,10.1145/3427921.3450234,,cs.SE cs.DB cs.PF,http://creativecommons.org/licenses/by/4.0/,"  It is important to detect changes in software performance during development
in order to avoid performance decreasing release to release or dealing with
costly delays at release time. Performance testing is part of the development
process at MongoDB, and integrated into our continuous integration system. We
describe a set of changes to that performance testing environment designed to
improve testing effectiveness. These changes help improve coverage, provide
faster and more accurate signaling for performance changes, and help us better
understand the state of performance. In addition to each component performing
better, we believe that we have created and exploited a virtuous cycle:
performance test improvements drive impact, which drives more use, which drives
further impact and investment in improvements. Overall, MongoDB is getting
faster and we avoid shipping major performance regressions to our customers
because of this infrastructure.
","[{'version': 'v1', 'created': 'Mon, 25 Jan 2021 16:47:05 GMT'}, {'version': 'v2', 'created': 'Sat, 13 Feb 2021 02:14:37 GMT'}]",2021-02-16,"[['Daly', 'David', '']]","['change point detection', 'performance', 'testing', 'continuous integration', 'variability']"
8467,1702.05760,Thijs Laarhoven,Thijs Laarhoven,Hypercube LSH for approximate near neighbors,"18 pages, 4 figures","42nd International Symposium on Mathematical Foundations of
  Computer Science (MFCS 2017), pp. 7:1-7:20, 2017",10.4230/LIPIcs.MFCS.2017.7,,cs.DS cs.CC cs.CG cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A celebrated technique for finding near neighbors for the angular distance
involves using a set of \textit{random} hyperplanes to partition the space into
hash regions [Charikar, STOC 2002]. Experiments later showed that using a set
of \textit{orthogonal} hyperplanes, thereby partitioning the space into the
Voronoi regions induced by a hypercube, leads to even better results [Terasawa
and Tanaka, WADS 2007]. However, no theoretical explanation for this
improvement was ever given, and it remained unclear how the resulting hypercube
hash method scales in high dimensions.
  In this work, we provide explicit asymptotics for the collision probabilities
when using hypercubes to partition the space. For instance, two near-orthogonal
vectors are expected to collide with probability $(\frac{1}{\pi})^{d + o(d)}$
in dimension $d$, compared to $(\frac{1}{2})^d$ when using random hyperplanes.
Vectors at angle $\frac{\pi}{3}$ collide with probability
$(\frac{\sqrt{3}}{\pi})^{d + o(d)}$, compared to $(\frac{2}{3})^d$ for random
hyperplanes, and near-parallel vectors collide with similar asymptotic
probabilities in both cases.
  For $c$-approximate nearest neighbor searching, this translates to a decrease
in the exponent $\rho$ of locality-sensitive hashing (LSH) methods of a factor
up to $\log_2(\pi) \approx 1.652$ compared to hyperplane LSH. For $c = 2$, we
obtain $\rho \approx 0.302 + o(1)$ for hypercube LSH, improving upon the $\rho
\approx 0.377$ for hyperplane LSH. We further describe how to use hypercube LSH
in practice, and we consider an example application in the area of lattice
algorithms.
","[{'version': 'v1', 'created': 'Sun, 19 Feb 2017 15:48:11 GMT'}]",2017-12-08,"[['Laarhoven', 'Thijs', '']]","['(approximate) near neighbors', 'locality-sensitive hashing', 'large deviations', 'dimensionality reduction', 'lattice algorithms']"
8468,1912.10630,EPTCS,"Fr\'ed\'eric Tuong (LRI, Universit\'e Paris-Saclay), Burkhart Wolff
  (LRI, Universit\'e Paris-Saclay)",Deeply Integrating C11 Code Support into Isabelle/PIDE,"In Proceedings F-IDE 2019, arXiv:1912.09611","EPTCS 310, 2019, pp. 13-28",10.4204/EPTCS.310.3,,cs.PL cs.LO cs.SC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a framework for C code in C11 syntax deeply integrated into the
Isabelle/PIDE development environment. Our framework provides an abstract
interface for verification back-ends to be plugged-in independently. Thus,
various techniques such as deductive program verification or white-box testing
can be applied to the same source, which is part of an integrated PIDE document
model. Semantic back-ends are free to choose the supported C fragment and its
semantics. In particular, they can differ on the chosen memory model or the
specification mechanism for framing conditions.
  Our framework supports semantic annotations of C sources in the form of
comments. Annotations serve to locally control back-end settings, and can
express the term focus to which an annotation refers. Both the logical and the
syntactic context are available when semantic annotations are evaluated. As a
consequence, a formula in an annotation can refer both to HOL or C variables.
  Our approach demonstrates the degree of maturity and expressive power the
Isabelle/PIDE subsystem has achieved in recent years. Our integration technique
employs Lex and Yacc style grammars to ensure efficient deterministic parsing.
We present two case studies for the integration of (known) semantic back-ends
in order to validate the design decisions for our back-end interface.
","[{'version': 'v1', 'created': 'Mon, 23 Dec 2019 05:40:20 GMT'}]",2019-12-24,"[['Tuong', 'Frédéric', '', 'LRI, Université Paris-Saclay'], ['Wolff', 'Burkhart', '', 'LRI, Université Paris-Saclay']]","['User Interface', 'Integrated Development', 'Program Verification', 'Shallow Embedding']"
8469,2205.09635,Eric Wagner,"Eric Wagner, Martin Serror, Klaus Wehrle, Martin Henze",BP-MAC: Fast Authentication for Short Messages,ACM WiSec'22,,10.1145/3507657.3528554,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Resource-constrained devices increasingly rely on wireless communication for
the reliable and low-latency transmission of short messages. However,
especially the implementation of adequate integrity protection of time-critical
messages places a significant burden on these devices. We address this issue by
proposing BP-MAC, a fast and memory-efficient approach for computing message
authentication codes based on the well-established Carter-Wegman construction.
Our key idea is to offload resource-intensive computations to idle phases and
thus save valuable time in latency-critical phases, i.e., when new data awaits
processing. Therefore, BP-MAC leverages a universal hash function designed for
the bitwise preprocessing of integrity protection to later only require a few
XOR operations during the latency-critical phase. Our evaluation on embedded
hardware shows that BP-MAC outperforms the state-of-the-art in terms of latency
and memory overhead, notably for small messages, as required to adequately
protect resource-constrained devices with stringent security and latency
requirements.
","[{'version': 'v1', 'created': 'Thu, 19 May 2022 15:52:13 GMT'}]",2022-05-20,"[['Wagner', 'Eric', ''], ['Serror', 'Martin', ''], ['Wehrle', 'Klaus', ''], ['Henze', 'Martin', '']]","['message authentication', 'universal hashing', 'cyber-physical systems']"
8470,1910.01519,Christof Paar,"Sebastian Wallat and Marc Fyrbiak and Moritz Schl\""ogel and Christof
  Paar",A Look at the Dark Side of Hardware Reverse Engineering -- A Case Study,,"2017 IEEE 2nd International Verification and Security Workshop
  (IVSW)",10.1109/IVSW.2017.8031551,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A massive threat to the modern and complex IC production chain is the use of
untrusted off-shore foundries which are able to infringe valuable hardware
design IP or to inject hardware Trojans causing severe loss of safety and
security. Similarly, market dominating SRAM-based FPGAs are vulnerable to both
attacks since the crucial gate-level netlist can be retrieved even in field for
the majority of deployed device series. In order to perform IP infringement or
Trojan injection, reverse engineering (parts of) the hardware design is
necessary to understand its internal workings. Even though IP protection and
obfuscation techniques exist to hinder both attacks, the security of most
techniques is doubtful since realistic capabilities of reverse engineering are
often neglected. The contribution of our work is twofold: first, we carefully
review an IP watermarking scheme tailored to FPGAs and improve its security by
using opaque predicates. In addition, we show novel reverse engineering
strategies on proposed opaque predicate implementations that again enables to
automatically detect and alter watermarks. Second, we demonstrate automatic
injection of hardware Trojans specifically tailored for third-party
cryptographic IP gate-level netlists. More precisely, we extend our
understanding of adversary's capabilities by presenting how block and stream
cipher implementations can be surreptitiously weakened.
","[{'version': 'v1', 'created': 'Tue, 1 Oct 2019 10:11:50 GMT'}]",2019-10-04,"[['Wallat', 'Sebastian', ''], ['Fyrbiak', 'Marc', ''], ['Schlögel', 'Moritz', ''], ['Paar', 'Christof', '']]","['Hardware Reverse Engineering', 'Hardware Trojans', 'FPGAs', 'Crypto Trojans', 'IP Infringement', 'IP watermarking']"
8471,1601.06183,Andr\'e Platzer,Andr\'e Platzer,A Complete Uniform Substitution Calculus for Differential Dynamic Logic,"Long article extending the conference version that appeared at CADE
  2015, arXiv:1503.01981","Journal of Automated Reasoning, 59(2), pages 219-265, 2017",10.1007/s10817-016-9385-1,,cs.LO cs.PL math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article introduces a relatively complete proof calculus for differential
dynamic logic (dL) that is entirely based on uniform substitution, a proof rule
that substitutes a formula for a predicate symbol everywhere. Uniform
substitutions make it possible to use axioms instead of axiom schemata, thereby
substantially simplifying implementations. Instead of subtle schema variables
and soundness-critical side conditions on the occurrence patterns of logical
variables to restrict infinitely many axiom schema instances to sound ones, the
resulting calculus adopts only a finite number of ordinary dL formulas as
axioms, which uniform substitutions instantiate soundly. The static semantics
of differential dynamic logic and the soundness-critical restrictions it
imposes on proof steps is captured exclusively in uniform substitutions and
variable renamings as opposed to being spread in delicate ways across the
prover implementation. In addition to sound uniform substitutions, this article
introduces differential forms for differential dynamic logic that make it
possible to internalize differential invariants, differential substitutions,
and derivatives as first-class axioms to reason about differential equations
axiomatically. The resulting axiomatization of differential dynamic logic is
proved to be sound and relatively complete.
","[{'version': 'v1', 'created': 'Fri, 22 Jan 2016 22:00:10 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Jun 2016 14:37:41 GMT'}, {'version': 'v3', 'created': 'Wed, 27 Jul 2016 18:50:35 GMT'}]",2017-08-17,"[['Platzer', 'André', '']]","['Differential dynamic logic', 'Uniform substitution', 'Axioms', 'Differentials', 'Staticsemantics', 'Axiomatization']"
8472,2112.05630,Vitalii Emelianov,"Vitalii Emelianov, Nicolas Gast, Krishna P. Gummadi, Patrick Loiseau",On Fair Selection in the Presence of Implicit and Differential Variance,"Accepted for publication in the Artificial Intelligence Journal. This
  paper is an extended version of our paper arXiv:2006.13699: we added a
  Bayesian-optimal baseline (in addition to the group-oblivious baseline) and
  generalized the model by assuming a group-dependent distribution of quality
  and an implicit bias; but we removed the part on two-stage selection",,10.1016/j.artint.2021.103609,,cs.LG cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Discrimination in selection problems such as hiring or college admission is
often explained by implicit bias from the decision maker against disadvantaged
demographic groups. In this paper, we consider a model where the decision maker
receives a noisy estimate of each candidate's quality, whose variance depends
on the candidate's group -- we argue that such differential variance is a key
feature of many selection problems. We analyze two notable settings: in the
first, the noise variances are unknown to the decision maker who simply picks
the candidates with the highest estimated quality independently of their group;
in the second, the variances are known and the decision maker picks candidates
having the highest expected quality given the noisy estimate. We show that both
baseline decision makers yield discrimination, although in opposite directions:
the first leads to underrepresentation of the low-variance group while the
second leads to underrepresentation of the high-variance group. We study the
effect on the selection utility of imposing a fairness mechanism that we term
the $\gamma$-rule (it is an extension of the classical four-fifths rule and it
also includes demographic parity). In the first setting (with unknown
variances), we prove that under mild conditions, imposing the $\gamma$-rule
increases the selection utility -- here there is no trade-off between fairness
and utility. In the second setting (with known variances), imposing the
$\gamma$-rule decreases the utility but we prove a bound on the utility loss
due to the fairness mechanism.
","[{'version': 'v1', 'created': 'Fri, 10 Dec 2021 16:04:13 GMT'}]",2021-12-13,"[['Emelianov', 'Vitalii', ''], ['Gast', 'Nicolas', ''], ['Gummadi', 'Krishna P.', ''], ['Loiseau', 'Patrick', '']]","['selection problem', 'fairness', 'differential variance']"
8473,2110.01925,Chiara Boldrini,"Mustafa Toprak, Chiara Boldrini, Andrea Passarella, Marco Conti","Journalists' ego networks in Twitter: invariant and distinctive
  structural features","This work was partially funded by the following projects. European
  Union's Horizon 2020 research and innovation programme: SoBigData++ (No
  871042), HumaneAI-Net (No 952026), MARVEL (No 957337). Italian PON-MISE
  program: OK-INSAID project (No ARS01 00917). CHIST-ERA program: SAI project
  (grant CHIST-ERA-19-XAI-010, funded by MUR, grant number not yet available)","Online Social Networks and Media, Volume 30, July 2022, 100207
  (2022)",10.1016/j.osnem.2022.100207,,cs.SI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Ego networks have proved to be a valuable tool for understanding the
relationships that individuals establish with their peers, both in offline and
online social networks. Particularly interesting are the cognitive constraints
associated with the interactions between the ego and the members of their ego
network, which limit individuals to maintain meaningful interactions with no
more than 150 people, on average, and to arrange such relationships along
concentric circles of decreasing engagement. In this work, we focus on the ego
networks of journalists on Twitter, considering 17 different countries, and we
investigate whether they feature the same characteristics observed for other
relevant classes of Twitter users, like politicians and generic users. Our
findings are that journalists are generally more active and interact with more
people than generic users, regardless of their country. Their ego network
structure is very aligned with reference models derived in anthropology and
observed in general human ego networks. Remarkably, the similarity is even
higher than the one of politicians and generic users ego networks. This may
imply a greater cognitive involvement with Twitter for journalists than for
other user categories. From a dynamic perspective, journalists have stable
short-term relationships that do not change much over time. In the longer term,
though, ego networks can be pretty dynamic, especially in the innermost
circles. Moreover, the ego-alter ties of journalists are often
information-driven, as they are mediated by hashtags both at their inception
and during their lifetime. Finally, we found that relationships between
journalists are assortative in popularity: journalists tend to engage with
other journalists of similar popularity, in all layers but especially in their
innermost ones.
","[{'version': 'v1', 'created': 'Tue, 5 Oct 2021 10:18:19 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Jun 2022 17:24:41 GMT'}]",2022-06-29,"[['Toprak', 'Mustafa', ''], ['Boldrini', 'Chiara', ''], ['Passarella', 'Andrea', ''], ['Conti', 'Marco', '']]","['online social networks', 'ego networks', 'Twitter', 'journalists']"
8474,2106.07720,Qiwei Han,"Joel Peito, Qiwei Han","Incorporating Domain Knowledge into Health Recommender Systems using
  Hyperbolic Embeddings","12 pages, 3 figures, accepted at the 2020 International Conference on
  Complex Networks and Their Applications",,10.1007/978-3-030-65351-4_11,,cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  In contrast to many other domains, recommender systems in health services may
benefit particularly from the incorporation of health domain knowledge, as it
helps to provide meaningful and personalised recommendations catering to the
individual's health needs. With recent advances in representation learning
enabling the hierarchical embedding of health knowledge into the hyperbolic
Poincare space, this work proposes a content-based recommender system for
patient-doctor matchmaking in primary care based on patients' health profiles,
enriched by pre-trained Poincare embeddings of the ICD-9 codes through transfer
learning. The proposed model outperforms its conventional counterpart in terms
of recommendation accuracy and has several important business implications for
improving the patient-doctor relationship.
","[{'version': 'v1', 'created': 'Mon, 14 Jun 2021 19:33:37 GMT'}]",2021-06-16,"[['Peito', 'Joel', ''], ['Han', 'Qiwei', '']]","['Health Recommender Systems', 'Primary Care', 'Poincaré Embeddings', 'International Classification of Diseases', 'Patient-Doctor Relationship']"
8475,2108.01222,Damiano Spina,"Michael Soprano and Kevin Roitero and David La Barbera and Davide
  Ceolin and Damiano Spina and Stefano Mizzaro and Gianluca Demartini","The Many Dimensions of Truthfulness: Crowdsourcing Misinformation
  Assessments on a Multidimensional Scale","33 pages; Paper accepted at Information Processing & Management on
  July 28, 2021; IP&M Special Issue on Dis/Misinformation Mining from Social
  Media","Information Processing & Management Information Processing &
  Management, Volume 58, Issue 6, November 2021, 102710",10.1016/j.ipm.2021.102710,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent work has demonstrated the viability of using crowdsourcing as a tool
for evaluating the truthfulness of public statements. Under certain conditions
such as: (1) having a balanced set of workers with different backgrounds and
cognitive abilities; (2) using an adequate set of mechanisms to control the
quality of the collected data; and (3) using a coarse grained assessment scale,
the crowd can provide reliable identification of fake news. However, fake news
are a subtle matter: statements can be just biased (""cherrypicked""), imprecise,
wrong, etc. and the unidimensional truth scale used in existing work cannot
account for such differences. In this paper we propose a multidimensional
notion of truthfulness and we ask the crowd workers to assess seven different
dimensions of truthfulness selected based on existing literature: Correctness,
Neutrality, Comprehensibility, Precision, Completeness, Speaker's
Trustworthiness, and Informativeness. We deploy a set of quality control
mechanisms to ensure that the thousands of assessments collected on 180
publicly available fact-checked statements distributed over two datasets are of
adequate quality, including a custom search engine used by the crowd workers to
find web pages supporting their truthfulness assessments. A comprehensive
analysis of crowdsourced judgments shows that: (1) the crowdsourced assessments
are reliable when compared to an expert-provided gold standard; (2) the
proposed dimensions of truthfulness capture independent pieces of information;
(3) the crowdsourcing task can be easily learned by the workers; and (4) the
resulting assessments provide a useful basis for a more complete estimation of
statement truthfulness.
","[{'version': 'v1', 'created': 'Tue, 3 Aug 2021 00:44:55 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Aug 2021 04:21:58 GMT'}]",2021-08-24,"[['Soprano', 'Michael', ''], ['Roitero', 'Kevin', ''], ['La Barbera', 'David', ''], ['Ceolin', 'Davide', ''], ['Spina', 'Damiano', ''], ['Mizzaro', 'Stefano', ''], ['Demartini', 'Gianluca', '']]","['Truthfulness', 'Crowdsourcing', 'Misinformation', 'Explainability']"
8476,2004.03455,Francesco Sovrano,"Francesco Sovrano, Monica Palmirani, Fabio Vitali",Deep Learning Based Multi-Label Text Classification of UNGA Resolutions,"10 pages, 10 figures, accepted paper at ICEGOV 2020",,10.1145/3428502.3428604,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The main goal of this research is to produce a useful software for United
Nations (UN), that could help to speed up the process of qualifying the UN
documents following the Sustainable Development Goals (SDGs) in order to
monitor the progresses at the world level to fight poverty, discrimination,
climate changes. In fact human labeling of UN documents would be a daunting
task given the size of the impacted corpus. Thus, automatic labeling must be
adopted at least as a first step of a multi-phase process to reduce the overall
effort of cataloguing and classifying. Deep Learning (DL) is nowadays one of
the most powerful tools for state-of-the-art (SOTA) AI for this task, but very
often it comes with the cost of an expensive and error-prone preparation of a
training-set. In the case of multi-label text classification of domain-specific
text it seems that we cannot effectively adopt DL without a big-enough
domain-specific training-set. In this paper, we show that this is not always
true. In fact we propose a novel method that is able, through statistics like
TF-IDF, to exploit pre-trained SOTA DL models (such as the Universal Sentence
Encoder) without any need for traditional transfer learning or any other
expensive training procedure. We show the effectiveness of our method in a
legal context, by classifying UN Resolutions according to their most related
SDGs.
","[{'version': 'v1', 'created': 'Wed, 1 Apr 2020 18:54:38 GMT'}]",2021-09-14,"[['Sovrano', 'Francesco', ''], ['Palmirani', 'Monica', ''], ['Vitali', 'Fabio', '']]","['Multi-label text classification', 'Deep learning', 'United Nations Resolutions', 'Sustainable Development Goals', 'Akoma Ntoso']"
8477,1709.09945,Christine Michel,"Carine Tour\'e (SICAL, SCP), Christine Michel (SICAL), Jean-Charles
  Marty (SICAL)","How to promote informal learning in the workplace? The need for
  incremental design methods",,"9th International Conference on Computer Supported Education
  (CSEDU 2017), Feb 2017, Porto, Portugal. pp.220-229, 2017",10.5220/0006355502200229,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Informal Learning in the Workplace (ILW) is ensured by the everyday work
activities in which workers are engaged. It accounts for over 75 per cent of
learning in the workplace. Enterprise Social Media (ESM) are increasingly used
as informal learning environments. According to the results of an
implementation we have conducted in real context, we show that ESM are
appropriate to promote ILW. Nevertheless, social aspects must be reconsidered
to address users' needs regarding content and access, quality information
indicators, moderation and control.
","[{'version': 'v1', 'created': 'Thu, 28 Sep 2017 13:32:42 GMT'}]",2019-04-25,"[['Touré', 'Carine', '', 'SICAL, SCP'], ['Michel', 'Christine', '', 'SICAL'], ['Marty', 'Jean-Charles', '', 'SICAL']]","['Lifelong Learning', 'Informal Learning', 'Knowledge-Sharing Tools', 'Enterprise Social Media', 'User-Centered Design', 'Adult Learner']"
8478,2211.14553,Gwo Chin Chung,"Ruven A/L Sundarajoo, Gwo Chin Chung, Wai Leong Pang, Soo Fun Tan",A Remote Baby Surveillance System with RFID and GPS Tracking,"12 pages, 13 figures Published with International Journal of
  Engineering Trends and Technology (IJETT)","International Journal of Engineering Trends and Technology, vol.
  70, no. 11, pp. 81-92, 2022",10.14445/22315381/IJETT-V70I11P208,,cs.CY cs.HC cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In the 21st century, sending babies or children to daycare centres has become
more and more common among young guardians. The balance between full-time work
and child care is increasingly challenging nowadays. In Malaysia, thousands of
child abuse cases have been reported from babysitting centres every year, which
indeed triggers the anxiety and stress of the guardians. Hence, this paper
proposes to construct a remote baby surveillance system with radio-frequency
identification (RFID) and global positioning system (GPS) tracking. With the
incorporation of the Internet of Things (IoT), a sensor-based microcontroller
is used to detect the conditions of the baby as well as the surrounding
environment and then display the real-time data as well as notifications to
alert the guardians via a mobile application. These conditions include the
crying and waking of the baby, as well as temperature, the mattress's wetness,
and moving objects around the baby. In addition, RFID and GPS location tracking
are implemented to ensure the safety of the baby, while white noise is used to
increase the comfort of the baby. In the end, a prototype has been successfully
developed for functionality and reliability testing. Several experiments have
been conducted to measure the efficiency of the mattress's wetness detection,
the RFID transmission range, the frequency spectrum of white noise, and also
the output power of the solar panel. The proposed system is expected to assist
guardians in ensuring the safety and comfort of their babies remotely, as well
as prevent any occurrence of child abuse.
","[{'version': 'v1', 'created': 'Sat, 26 Nov 2022 12:42:27 GMT'}]",2022-11-29,"[['Sundarajoo', 'Ruven A/L', ''], ['Chung', 'Gwo Chin', ''], ['Pang', 'Wai Leong', ''], ['Tan', 'Soo Fun', '']]","['Child abuse', 'Global positioning system', 'Internet of things', 'Radio-frequency identification', 'White noise']"
8479,2110.02124,Bharath Bhushan Damodaran,"Bharath Bhushan Damodaran, Emmanuel Jolly, Gilles Puy, Philippe Henri
  Gosselin, C\'edric Th\'ebault, Junghyun Ahn, Tim Christensen, Paul Ghezzo,
  Pierre Hellier",FacialFilmroll: High-resolution multi-shot video editing,European Conference on Visual Media Production (CVMP '21),"European Conference on Visual Media Production (CVMP '21), 2021",10.1145/3485441.3485646,,cs.CV cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We present FacialFilmroll, a solution for spatially and temporally consistent
editing of faces in one or multiple shots. We build upon unwrap mosaic
[Rav-Acha et al. 2008] by specializing it to faces. We leverage recent
techniques to fit a 3D face model on monocular videos to (i) improve the
quality of the mosaic for edition and (ii) permit the automatic transfer of
edits from one shot to other shots of the same actor. We explain how
FacialFilmroll is integrated in post-production facility. Finally, we present
video editing results using FacialFilmroll on high resolution videos.
","[{'version': 'v1', 'created': 'Tue, 5 Oct 2021 15:51:08 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Nov 2021 15:06:08 GMT'}]",2021-11-18,"[['Damodaran', 'Bharath Bhushan', ''], ['Jolly', 'Emmanuel', ''], ['Puy', 'Gilles', ''], ['Gosselin', 'Philippe Henri', ''], ['Thébault', 'Cédric', ''], ['Ahn', 'Junghyun', ''], ['Christensen', 'Tim', ''], ['Ghezzo', 'Paul', ''], ['Hellier', 'Pierre', '']]","['embedding', 'mosaics', 'video editing', 'multi-shot video editing', 'longrange correspondence tracks']"
8480,1911.05703,Zachary Neal,"Zachary Neal, Jennifer Watling Neal, and Rachel Domagalski","False positives using social cognitive mapping to identify childrens'
  peer groups","This pre-print has been relocated to the PsyArXiv server. Subsequent
  revisions can be found at https://psyarxiv.com/yfmzd/","Collabra: Psychology, 7, 17989 (2021)",10.1525/collabra.17969,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Children and adolescents interact in peer groups, which are known to
influence a range of psychological and behavioral outcomes. In developmental
psychology and related disciplines, social cognitive mapping (SCM), as
implemented with the SCM 4.0 software, is the most commonly used method for
identifying peer groups from peer report data. However, in a series of four
studies, we demonstrate that SCM has an unacceptably high risk of false
positives. Specifically, we show that SCM will identify peer groups even when
applied to random data. We introduce backbone extraction and community
detection as one promising alternative to SCM, and offer several
recommendations for researchers seeking to identify peer groups from peer
report data.
","[{'version': 'v1', 'created': 'Wed, 13 Nov 2019 18:23:45 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Jun 2020 12:15:34 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Sep 2020 13:24:11 GMT'}]",2022-02-22,"[['Neal', 'Zachary', ''], ['Neal', 'Jennifer Watling', ''], ['Domagalski', 'Rachel', '']]","['Accuracy', 'Peer groups', 'Social networks', 'Social cognitive mapping', 'Validity']"
8481,2010.10172,Nicole Novielli,"Nicole Novielli, Fabio Calefato, Filippo Lanubile, Alexander
  Serebrenik","Assessment of Off-the-Shelf SE-specific Sentiment Analysis Tools: An
  Extended Replication Study",Accepted for publication in Empirical Software Engineering,"Empirical Software Engineering, 2021",10.1007/s10664-021-09960-w,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sentiment analysis methods have become popular for investigating human
communication, including discussions related to software projects. Since
general-purpose sentiment analysis tools do not fit well with the information
exchanged by software developers, new tools, specific for software engineering
(SE), have been developed. We investigate to what extent SE-specific tools for
sentiment analysis mitigate the threats to conclusion validity of empirical
studies in software engineering, highlighted by previous research. First, we
replicate two studies addressing the role of sentiment in security discussions
on GitHub and in question-writing on Stack Overflow. Then, we extend the
previous studies by assessing to what extent the tools agree with each other
and with the manual annotation on a gold standard of 600 documents. We find
that different SE-specific sentiment analysis tools might lead to contradictory
results at a fine-grain level, when used 'off-the-shelf'. Conversely,
platform-specific tuning or retraining might be needed to take into account
differences in platform conventions, jargon, or document lengths.
","[{'version': 'v1', 'created': 'Tue, 20 Oct 2020 10:10:19 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Feb 2021 12:05:46 GMT'}]",2021-04-22,"[['Novielli', 'Nicole', ''], ['Calefato', 'Fabio', ''], ['Lanubile', 'Filippo', ''], ['Serebrenik', 'Alexander', '']]","['sentiment analysis', 'human aspects of software engineering', 'replication study']"
8482,2009.00867,Milliam Maxime Zekeng Ndadji,"Maurice Tchoup\'e Tchendji, Milliam Maxime Zekeng Ndadji","Tree Automata for Extracting Consensus from Partial Replicas of a
  Structured Document",,"Journal of Software Engineering and Applications, Volume 10,
  Number 5, May 2017, pages 432-456",10.4236/jsea.2017.105025,,cs.FL cs.IT cs.SE math.IT,http://creativecommons.org/licenses/by/4.0/,"  In an asynchronous cooperative editing workflow of a structured document,
each of the co-authors receives in the different phases of the editing process,
a copy of the document to insert its contribution. For confidentiality reasons,
this copy may be only a partial replica containing only parts of the (global)
document which are of demonstrated interest for the considered co-author. Note
that some parts may be a demonstrated interest over a co-author; they will
therefore be accessible concurrently. When it's synchronization time (e.g. at
the end of an asynchronous editing phase of the process), we want to merge all
contributions of all authors in a single document. Due to the asynchronism of
edition and to the potential existence of the document parts offering
concurrent access, conflicts may arise and make partial replicas unmergeable in
their entirety: they are inconsistent, meaning that they contain conflictual
parts. The purpose of this paper is to propose a merging approach said by
consensus of such partial replicas using tree automata. Specifically, from the
partial replicas updates, we build a tree automaton that accepts exactly the
consensus documents. These documents are the maximum prefixes containing no
conflict of partial replicas merged.
","[{'version': 'v1', 'created': 'Wed, 2 Sep 2020 07:36:26 GMT'}]",2020-09-04,"[['Tchendji', 'Maurice Tchoupé', ''], ['Ndadji', 'Milliam Maxime Zekeng', '']]","['Structured Documents', 'Workflow of Cooperative Edition', 'Merging Partial Replicas', 'Conflict', 'Consensus', 'Tree Automata', 'Automata Product', 'Lazy Evaluation']"
8483,2301.09689,Elijah S. Lee,"Elijah S. Lee, Lifeng Zhou, Alejandro Ribeiro, Vijay Kumar",Graph Neural Networks for Decentralized Multi-Agent Perimeter Defense,"20 pages, 10 figures. Published in Frontiers in Control Engineering
  2023. arXiv admin note: substantial text overlap with arXiv:2211.01757",,10.3389/fcteg.2023.1104745,,cs.MA cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we study the problem of decentralized multi-agent perimeter
defense that asks for computing actions for defenders with local perceptions
and communications to maximize the capture of intruders. One major challenge
for practical implementations is to make perimeter defense strategies scalable
for large-scale problem instances. To this end, we leverage graph neural
networks (GNNs) to develop an imitation learning framework that learns a
mapping from defenders' local perceptions and their communication graph to
their actions. The proposed GNN-based learning network is trained by imitating
a centralized expert algorithm such that the learned actions are close to that
generated by the expert algorithm. We demonstrate that our proposed network
performs closer to the expert algorithm and is superior to other baseline
algorithms by capturing more intruders. Our GNN-based network is trained at a
small scale and can be generalized to large-scale cases. We run perimeter
defense games in scenarios with different team sizes and configurations to
demonstrate the performance of the learned network.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2023 19:35:59 GMT'}]",2023-01-25,"[['Lee', 'Elijah S.', ''], ['Zhou', 'Lifeng', ''], ['Ribeiro', 'Alejandro', ''], ['Kumar', 'Vijay', '']]","['graph neural networks', 'perimeter defense', 'multi-agent systems', 'perception-action-communication loops', 'imitation']"
8484,2106.02076,Justin Edwards,"Justin Edwards, Leigh Clark and Allison Perrone","LGBTQ-AI? Exploring Expressions of Gender and Sexual Orientation in
  Chatbots",,,10.1145/3469595.3469597,,cs.HC cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Chatbots are popular machine partners for task-oriented and social
interactions. Human-human computer-mediated communication research has explored
how people express their gender and sexuality in online social interactions,
but little is known about whether and in what way chatbots do the same. We
conducted semi-structured interviews with 5 text-based conversational agents to
explore this topic Through these interviews, we identified 6 common themes
around the expression of gender and sexual identity: identity description,
identity formation, peer acceptance, positive reflection, uncomfortable
feelings and off-topic responses. Chatbots express gender and sexuality
explicitly and through relation of experience and emotions, mimicking the human
language on which they are trained. It is nevertheless evident that chatbots
differ from human dialogue partners as they lack the flexibility and
understanding enabled by lived human experience. While chatbots are proficient
in using language to express identity, they also display a lack of authentic
experiences of gender and sexuality.
","[{'version': 'v1', 'created': 'Thu, 3 Jun 2021 18:47:52 GMT'}]",2021-06-07,"[['Edwards', 'Justin', ''], ['Clark', 'Leigh', ''], ['Perrone', 'Allison', '']]","['chatbots', 'language models', 'gender studies', 'queer studies', 'identity']"
8485,2004.05695,Husam Suleiman,"Husam Suleiman, Otman Basir",QoS-Driven Job Scheduling: Multi-Tier Dependency Considerations,,"pp.133-155, Volume 9, Number 9, July 2019",10.5121/csit.2019.90912,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For a cloud service provider, delivering optimal system performance while
fulfilling Quality of Service (QoS) obligations is critical for maintaining a
viably profitable business. This goal is often hard to attain given the
irregular nature of cloud computing jobs. These jobs expect high QoS on an
on-demand fashion, that is on random arrival. To optimize the response to such
client demands, cloud service providers organize the cloud computing
environment as a multi-tier architecture. Each tier executes its designated
tasks and passes the job to the next tier; in a fashion similar, but not
identical, to the traditional job-shop environments. An optimization process
must take place to schedule the appropriate tasks of the job on the resources
of the tier, so as to meet the QoS expectations of the job. Existing approaches
employ scheduling strategies that consider the performance optimization at the
individual resource level and produce optimal single-tier driven schedules. Due
to the sequential nature of the multi-tier environment, the impact of such
schedules on the performance of other resources and tiers tend to be ignored,
resulting in a less than optimal performance when measured at the multi-tier
level. In this paper, we propose a multi-tier-oriented job scheduling and
allocation technique. The scheduling and allocation process is formulated as a
problem of assigning jobs to the resource queues of the cloud computing
environment, where each resource of the environment employs a queue to hold the
jobs assigned to it. The scheduling problem is NP-hard, as such a biologically
inspired genetic algorithm is proposed. The computing resources across all
tiers of the environment are virtualized in one resource by means of a single
queue virtualization. A chromosome that mimics the sequencing and allocation of
the tasks in the proposed virtual queue is proposed.
","[{'version': 'v1', 'created': 'Sun, 12 Apr 2020 21:01:58 GMT'}]",2020-04-14,"[['Suleiman', 'Husam', ''], ['Basir', 'Otman', '']]","['Cloud Computing', 'Task Scheduling and Allocation', 'QoS Optimization', 'Load Balancing', 'Genetic Algorithms']"
8486,2012.04946,Jos Tellings,Martijn van der Klis and Jos Tellings,"Generating semantic maps through multidimensional scaling: linguistic
  applications and theory","40 pages; pre-print; accepted for publication in Corpus Linguistics &
  Linguistic Theory (Nov. 2021)",,10.1515/cllt-2021-0018,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  This paper reports on the state-of-the-art in application of multidimensional
scaling (MDS) techniques to create semantic maps in linguistic research. MDS
refers to a statistical technique that represents objects (lexical items,
linguistic contexts, languages, etc.) as points in a space so that close
similarity between the objects corresponds to close distances between the
corresponding points in the representation. We focus on the use of MDS in
combination with parallel corpus data as used in research on cross-linguistic
variation.
  We first introduce the mathematical foundations of MDS and then give an
exhaustive overview of past research that employs MDS techniques in combination
with parallel corpus data. We propose a set of terminology to succinctly
describe the key parameters of a particular MDS application. We then show that
this computational methodology is theory-neutral, i.e. it can be employed to
answer research questions in a variety of linguistic theoretical frameworks.
Finally, we show how this leads to two lines of future developments for MDS
research in linguistics.
","[{'version': 'v1', 'created': 'Wed, 9 Dec 2020 10:02:09 GMT'}, {'version': 'v2', 'created': 'Sat, 13 Mar 2021 14:20:55 GMT'}, {'version': 'v3', 'created': 'Wed, 24 Nov 2021 11:11:48 GMT'}]",2022-01-11,"[['van der Klis', 'Martijn', ''], ['Tellings', 'Jos', '']]","['parallel corpora', 'multidimensional scaling', 'semantic maps', 'cross-linguisticvariation']"
8487,2207.03353,Bilen Emek Abali,"Bozo Vazic, Bilen Emek Abali, Pania Newell","Determining parameters in generalized thermomechanics for metamaterials
  by means of asymptotic homogenization",,,10.1007/s00161-022-01171-y,,cs.CE math-ph math.MP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advancement in manufacturing methods enable designing so called metamaterials
with a tailor-made microstructure. Microstructure affects materials response
within a length-scale, where we model this behavior by using the generalized
thermomechanics. Strain gradient theory is employed as a higher-order theory
with thermodynamics modeled as a first-order theory. Developing multiphysics
models for heterogeneous materials is indeed a challenge and even this
``simplest'' model in generalized thermomechanics causes dozens of parameters
to be determined. We develop a computational model by using a given
microstructure, modeled as a periodic domain, and numerically calculate all
parameters by means of asymptotic homogenization. Finite element method (FEM)
is employed with the aid of open-source codes (FEniCS). Some example with
symmetric and random distribution of voids in a model problem verifies the
method and provides an example at which length-scale we need to consider
generalized thermoeleasticity in composite materials.
","[{'version': 'v1', 'created': 'Thu, 7 Jul 2022 15:00:24 GMT'}]",2022-12-02,"[['Vazic', 'Bozo', ''], ['Abali', 'Bilen Emek', ''], ['Newell', 'Pania', '']]","['Thermo-mechanics', 'Solid mechanics', 'Generalized mechanics', 'Metamaterials', 'Homogenization', 'Finite element method (FEM)']"
8488,1806.07119,Hui Li,"Hui Li, Xiao-Jun Wu, Tariq S. Durrani","Infrared and Visible Image Fusion with ResNet and zero-phase component
  analysis","22pages, 9 figures, 7 tables","Journal of Infrared Physics & Technology, available online 12
  September 2019",10.1016/j.infrared.2019.103039,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feature extraction and processing tasks play a key role in Image Fusion, and
the fusion performance is directly affected by the different features and
processing methods undertaken. By contrast, most of deep learning-based methods
use deep features directly without feature extraction or processing. This leads
to the fusion performance degradation in some cases. To solve these drawbacks,
we propose a deep features and zero-phase component analysis (ZCA) based novel
fusion framework is this paper. Firstly, the residual network (ResNet) is used
to extract deep features from source images. Then ZCA is utilized to normalize
the deep features and obtain initial weight maps. The final weight maps are
obtained by employing a soft-max operation in association with the initial
weight maps. Finally, the fused image is reconstructed using a
weighted-averaging strategy. Compared with the existing fusion methods,
experimental results demonstrate that the proposed framework achieves better
performance in both objective assessment and visual quality. The code of our
fusion algorithm is available at
https://github.com/hli1221/imagefusion_resnet50
","[{'version': 'v1', 'created': 'Tue, 19 Jun 2018 09:15:54 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Jun 2018 04:57:33 GMT'}, {'version': 'v3', 'created': 'Sun, 29 Jul 2018 12:06:40 GMT'}, {'version': 'v4', 'created': 'Tue, 31 Jul 2018 06:41:48 GMT'}, {'version': 'v5', 'created': 'Tue, 18 Dec 2018 07:55:18 GMT'}, {'version': 'v6', 'created': 'Tue, 17 Sep 2019 09:20:32 GMT'}, {'version': 'v7', 'created': 'Fri, 20 Sep 2019 15:10:32 GMT'}]",2019-09-23,"[['Li', 'Hui', ''], ['Wu', 'Xiao-Jun', ''], ['Durrani', 'Tariq S.', '']]","['image fusion', 'deep learning', 'residual network', 'zero-phasecomponent analysis', 'infrared image', 'visible image']"
8489,2203.13623,Patr\'icia Matsubara,"Patricia G. F. Matsubara, Igor Steinmacher, Bruno Gadelha and Tayana
  Conte","The best defense is a good defense: adapting negotiation methods for
  tackling pressure over software project estimates","5 pages, 1 figure, 1 table",,10.1145/3510455.3512775,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software estimation is critical for a software project's success and a
challenging activity. We argue that estimation problems are not restricted to
the generation of estimates but also their use for commitment establishment:
project stakeholders pressure estimators to change their estimates or to accept
unrealistic commitments to attain business goals. In this study, we employed a
Design Science Research (DSR) methodology to design an artifact based on
negotiation methods, to empower software estimators in defending their
estimates and searching for alternatives to unrealistic commitments when facing
pressure. The artifact is a concrete step towards disseminating the soft skill
of negotiation among practitioners. We present the preliminary results from a
focus group that showed that practitioners from the software industry could use
the artifact in a concrete scenario when estimating and establishing
commitments about a software project. Our future steps include improving the
artifact with the suggestions from focus group participants and evaluating it
empirically in real software projects in the industry.
","[{'version': 'v1', 'created': 'Fri, 25 Mar 2022 12:51:46 GMT'}]",2022-03-28,"[['Matsubara', 'Patricia G. F.', ''], ['Steinmacher', 'Igor', ''], ['Gadelha', 'Bruno', ''], ['Conte', 'Tayana', '']]","['Software effort estimation', 'commitment', 'negotiation']"
8490,2106.13697,Todd Murphey,"Annalisa T. Taylor, Thomas A. Berrueta, and Todd D. Murphey",Active Learning in Robotics: A Review of Control Principles,25 pages,"Mechatronics, vol. 77, p. 102576, 2021",10.1016/j.mechatronics.2021.102576,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Active learning is a decision-making process. In both abstract and physical
settings, active learning demands both analysis and action. This is a review of
active learning in robotics, focusing on methods amenable to the demands of
embodied learning systems. Robots must be able to learn efficiently and
flexibly through continuous online deployment. This poses a distinct set of
control-oriented challenges -- one must choose suitable measures as objectives,
synthesize real-time control, and produce analyses that guarantee performance
and safety with limited knowledge of the environment or robot itself. In this
work, we survey the fundamental components of robotic active learning systems.
We discuss classes of learning tasks that robots typically encounter, measures
with which they gauge the information content of observations, and algorithms
for generating action plans. Moreover, we provide a variety of examples -- from
environmental mapping to nonparametric shape estimation -- that highlight the
qualitative differences between learning tasks, information measures, and
control techniques. We conclude with a discussion of control-oriented open
challenges, including safety-constrained learning and distributed learning.
","[{'version': 'v1', 'created': 'Fri, 25 Jun 2021 15:34:20 GMT'}]",2021-06-28,"[['Taylor', 'Annalisa T.', ''], ['Berrueta', 'Thomas A.', ''], ['Murphey', 'Todd D.', '']]","['Active learning', 'Robotics', 'Robot control', 'Learning theory', 'Perception and sensing', 'Artificial intelligence']"
8491,2207.07798,Daqian Shi,"Daqian Shi, Xiaolei Diao, Lida Shi, Hao Tang, Yang Chi, Chuntao Li,
  Hao Xu","CharFormer: A Glyph Fusion based Attentive Framework for High-precision
  Character Image Denoising",Accepted by ACM MM 2022,,10.1145/3503161.3548208,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Degraded images commonly exist in the general sources of character images,
leading to unsatisfactory character recognition results. Existing methods have
dedicated efforts to restoring degraded character images. However, the
denoising results obtained by these methods do not appear to improve character
recognition performance. This is mainly because current methods only focus on
pixel-level information and ignore critical features of a character, such as
its glyph, resulting in character-glyph damage during the denoising process. In
this paper, we introduce a novel generic framework based on glyph fusion and
attention mechanisms, i.e., CharFormer, for precisely recovering character
images without changing their inherent glyphs. Unlike existing frameworks,
CharFormer introduces a parallel target task for capturing additional
information and injecting it into the image denoising backbone, which will
maintain the consistency of character glyphs during character image denoising.
Moreover, we utilize attention-based networks for global-local feature
interaction, which will help to deal with blind denoising and enhance denoising
performance. We compare CharFormer with state-of-the-art methods on multiple
datasets. The experimental results show the superiority of CharFormer
quantitatively and qualitatively.
","[{'version': 'v1', 'created': 'Sat, 16 Jul 2022 01:11:30 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Jul 2022 17:46:58 GMT'}]",2022-07-20,"[['Shi', 'Daqian', ''], ['Diao', 'Xiaolei', ''], ['Shi', 'Lida', ''], ['Tang', 'Hao', ''], ['Chi', 'Yang', ''], ['Li', 'Chuntao', ''], ['Xu', 'Hao', '']]","['Character image denoising', 'Attention mechanism', 'Glyph information', 'Transformer-based model', 'Optical character recognition']"
8492,2005.11994,Pradipta Biswas,"Vinay Krishna Sharma, L.R.D. Murthy, KamalPreet Singh Saluja, Vimal
  Mollyn, Gourav Sharma and Pradipta Biswas",Eye Gaze Controlled Robotic Arm for Persons with SSMI,"Citation: VK Sharma, KPS Saluja, LRD Murthy, G Sharma and P Biswas,
  Webcam Controlled Robotic Arm for Persons with SSMI, Technology and
  Disability 32 (3), IOS Press 2020 [Official journal of EU AAATE association]",,10.3233/TAD-200264,,cs.HC cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: People with severe speech and motor impairment (SSMI) often uses
a technique called eye pointing to communicate with outside world. One of their
parents, caretakers or teachers hold a printed board in front of them and by
analyzing their eye gaze manually, their intentions are interpreted. This
technique is often error prone and time consuming and depends on a single
caretaker.
  Objective: We aimed to automate the eye tracking process electronically by
using commercially available tablet, computer or laptop and without requiring
any dedicated hardware for eye gaze tracking. The eye gaze tracker is used to
develop a video see through based AR (augmented reality) display that controls
a robotic device with eye gaze and deployed for a fabric printing task.
  Methodology: We undertook a user centred design process and separately
evaluated the web cam based gaze tracker and the video see through based human
robot interaction involving users with SSMI. We also reported a user study on
manipulating a robotic arm with webcam based eye gaze tracker.
  Results: Using our bespoke eye gaze controlled interface, able bodied users
can select one of nine regions of screen at a median of less than 2 secs and
users with SSMI can do so at a median of 4 secs. Using the eye gaze controlled
human-robot AR display, users with SSMI could undertake representative pick and
drop task at an average duration less than 15 secs and reach a randomly
designated target within 60 secs using a COTS eye tracker and at an average
time of 2 mins using the webcam based eye gaze tracker.
","[{'version': 'v1', 'created': 'Mon, 25 May 2020 09:23:20 GMT'}]",2020-05-26,"[['Sharma', 'Vinay Krishna', ''], ['Murthy', 'L. R. D.', ''], ['Saluja', 'KamalPreet Singh', ''], ['Mollyn', 'Vimal', ''], ['Sharma', 'Gourav', ''], ['Biswas', 'Pradipta', '']]","['Eye Gaze Tracking', 'Assistive Technology', 'Human robot Interaction', 'SSMI']"
8493,2205.00980,Marina Evers,Marina Evers and Lars Linsen,"Multi-dimensional parameter-space partitioning of spatio-temporal
  simulation ensembles","14 pages, 9 figures","Computers & Graphics 104 (2022), 140-151",10.1016/j.cag.2022.04.005,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Numerical simulations are commonly used to understand the parameter
dependence of given spatio-temporal phenomena. Sampling a multi-dimensional
parameter space and running the respective simulations leads to an ensemble of
a large number of spatio-temporal simulation runs. A main objective for
analyzing the ensemble is to partition (or segment) the multi-dimensional
parameter space into connected regions of simulation runs with similar
behavior. To facilitate such an analysis, we propose a novel visualization
method for multi-dimensional parameter-space partitions. Our visualization is
based on the concept of a hyper-slicer, which allows for undistorted views of
the parameter-space segments' extent and transitions. For navigation within the
parameter space, interactions with a 2D embedding of the parameter-space
samples, including their segment memberships, are supported. Parameter-space
partitions are generated in a semi-automatic fashion by analyzing the
similarity space of the ensemble's simulation runs. Clusters of similar
simulation runs induce the segments of the parameter-space partition. We link
the parameter-space partitioning visualizations to similarity-space
visualizations of the ensemble's simulation runs and embed them into an
interactive visual analysis tool that supports the analysis of all facets of
the spatio-temporal simulation ensemble targeted at the overarching goal of
analyzing the parameter-space partitioning. The partitioning can then be
visually analyzed and interactively refined. We evaluated our approach with
experts within case studies from three different domains.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 15:28:30 GMT'}, {'version': 'v2', 'created': 'Tue, 3 May 2022 15:19:36 GMT'}]",2022-05-04,"[['Evers', 'Marina', ''], ['Linsen', 'Lars', '']]","['Ensemble visualization', 'Parameter-space analysis', 'Spatio-temporalsimulation', 'Similarity']"
8494,1912.07288,Fabio Durastante Dr.,"Michele Benzi, Daniele Bertaccini, Fabio Durastante, Igor Simunec",Nonlocal network dynamics via fractional graph Laplacians,,"Journal of Complex Networks, Volume 8, Issue 3, June 2020, cnaa017",10.1093/comnet/cnaa017,,cs.SI math.CO physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce nonlocal dynamics on directed networks through the construction
of a fractional version of a nonsymmetric Laplacian for weighted directed
graphs. Furthermore, we provide an analytic treatment of fractional dynamics
for both directed and undirected graphs, showing the possibility of exploring
the network employing random walks with jumps of arbitrary length. We also
provide some examples of the applicability of the proposed dynamics, including
consensus over multi-agent systems described by directed networks.
","[{'version': 'v1', 'created': 'Mon, 16 Dec 2019 10:57:27 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Feb 2020 07:45:01 GMT'}, {'version': 'v3', 'created': 'Sat, 21 Mar 2020 14:20:54 GMT'}, {'version': 'v4', 'created': 'Mon, 4 May 2020 18:53:26 GMT'}]",2020-08-05,"[['Benzi', 'Michele', ''], ['Bertaccini', 'Daniele', ''], ['Durastante', 'Fabio', ''], ['Simunec', 'Igor', '']]","['network dynamics', 'nonlocal dynamics', 'superdiffusion', 'matrix functions', 'power law decay']"
8495,2208.09323,Daniel Buschek,"Hai Dang, Karim Benharrak, Florian Lehmann, Daniel Buschek","Beyond Text Generation: Supporting Writers with Continuous Automatic
  Text Summaries","13 pages, 6 figures, 2 tables, ACM UIST 2022",,10.1145/3526113.3545672,,cs.HC cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a text editor to help users plan, structure and reflect on their
writing process. It provides continuously updated paragraph-wise summaries as
margin annotations, using automatic text summarization. Summary levels range
from full text, to selected (central) sentences, down to a collection of
keywords. To understand how users interact with this system during writing, we
conducted two user studies (N=4 and N=8) in which people wrote analytic essays
about a given topic and article. As a key finding, the summaries gave users an
external perspective on their writing and helped them to revise the content and
scope of their drafted paragraphs. People further used the tool to quickly gain
an overview of the text and developed strategies to integrate insights from the
automated summaries. More broadly, this work explores and highlights the value
of designing AI tools for writers, with Natural Language Processing (NLP)
capabilities that go beyond direct text generation and correction.
","[{'version': 'v1', 'created': 'Fri, 19 Aug 2022 13:09:56 GMT'}]",2022-08-22,"[['Dang', 'Hai', ''], ['Benharrak', 'Karim', ''], ['Lehmann', 'Florian', ''], ['Buschek', 'Daniel', '']]","['Text documents', 'text summarization', 'semantic zoom', 'reverse outlining', 'Natural Language Processing']"
8496,2108.07935,Hongjin Qian,"Hongjin Qian, Zhicheng Dou, Yutao Zhu, Yueyuan Ma, and Ji-Rong Wen",Learning Implicit User Profiles for Personalized Retrieval-Based Chatbot,"Accepted by CIKM 2021, codes and dataset will be released at
  https://github.com/qhjqhj00/CIKM2021-IMPChat",,10.1145/3459637.3482269,,cs.IR cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we explore the problem of developing personalized chatbots. A
personalized chatbot is designed as a digital chatting assistant for a user.
The key characteristic of a personalized chatbot is that it should have a
consistent personality with the corresponding user. It can talk the same way as
the user when it is delegated to respond to others' messages. We present a
retrieval-based personalized chatbot model, namely IMPChat, to learn an
implicit user profile from the user's dialogue history. We argue that the
implicit user profile is superior to the explicit user profile regarding
accessibility and flexibility. IMPChat aims to learn an implicit user profile
through modeling user's personalized language style and personalized
preferences separately. To learn a user's personalized language style, we
elaborately build language models from shallow to deep using the user's
historical responses; To model a user's personalized preferences, we explore
the conditional relations underneath each post-response pair of the user. The
personalized preferences are dynamic and context-aware: we assign higher
weights to those historical pairs that are topically related to the current
query when aggregating the personalized preferences. We match each response
candidate with the personalized language style and personalized preference,
respectively, and fuse the two matching signals to determine the final ranking
score. Comprehensive experiments on two large datasets show that our method
outperforms all baseline models.
","[{'version': 'v1', 'created': 'Wed, 18 Aug 2021 02:07:28 GMT'}]",2021-08-19,"[['Qian', 'Hongjin', ''], ['Dou', 'Zhicheng', ''], ['Zhu', 'Yutao', ''], ['Ma', 'Yueyuan', ''], ['Wen', 'Ji-Rong', '']]","['Personalization', 'Retrieval-based Chatbots', 'Implicit User Profile']"
8497,1909.13241,Evangelos Psomakelis Mr,"Evangelos Psomakelis, Konstantinos Tserpes, Dimitris Zissisc,
  Dimosthenis Anagnostopoulos and Theodora Varvarigou",Context agnostic trajectory prediction based on $\lambda$-architecture,,"Future Generation Computer Systems 2019,ISSN 0167-739X",10.1016/j.future.2019.09.046,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predicting the next position of movable objects has been a problem for at
least the last three decades, referred to as trajectory prediction. In our
days, the vast amounts of data being continuously produced add the big data
dimension to the trajectory prediction problem, which we are trying to tackle
by creating a {\lambda}-Architecture based analytics platform. This platform
performs both batch and stream analytics tasks and then combines them to
perform analytical tasks that cannot be performed by analyzing any of these
layers by itself. The biggest benefit of this platform is its context agnostic
trait, which allows us to use it for any use case, as long as a time-stamped
geolocation stream is provided. The experimental results presented prove that
each part of the {\lambda}-Architecture performs well at certain targets,
making a combination of these parts a necessity in order to improve the overall
accuracy and performance of the platform.
","[{'version': 'v1', 'created': 'Sun, 29 Sep 2019 09:22:21 GMT'}]",2019-10-01,"[['Psomakelis', 'Evangelos', ''], ['Tserpes', 'Konstantinos', ''], ['Zissisc', 'Dimitris', ''], ['Anagnostopoulos', 'Dimosthenis', ''], ['Varvarigou', 'Theodora', '']]","['trajectory prediction', 'lambda architecture', 'stream analysis', 'big data', 'AIS', 'machine learning']"
8498,2003.09532,Mahsa Eftekhari Hesari,"Talley Amir, James Aspnes, David Doty, Mahsa Eftekhari, Eric Severson",Message complexity of population protocols,,,10.4230/LIPIcs.DISC.2020.6,,cs.DC cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The standard population protocol model assumes that when two agents interact,
each observes the entire state of the other agent. We initiate the study of
$\textit{message complexity}$ for population protocols, where the state of an
agent is divided into an externally-visible $\textit{message}$ and an internal
component, where only the message can be observed by the other agent in an
interaction.
  We consider the case of $O(1)$ message complexity. When time is unrestricted,
we obtain an exact characterization of the stably computable predicates based
on the number of internal states $s(n)$: If $s(n) = o(n)$ then the protocol
computes semilinear predicates (unlike the original model, which can compute
non-semilinear predicates with $s(n) = O(\log n)$), and otherwise it computes a
predicate decidable by a nondeterministic $O(n \log s(n))$-space-bounded Turing
machine. We then introduce novel $O(\mathrm{polylog}(n))$ expected time
protocols for junta/leader election and general purpose broadcast correct with
high probability, and approximate and exact population size counting correct
with probability 1. Finally, we show that the main constraint on the power of
bounded-message-size protocols is the size of the internal states: with
unbounded internal states, any computable function can be computed with
probability 1 in the limit by a protocol that uses only $\textit{1-bit}$
messages.
","[{'version': 'v1', 'created': 'Fri, 20 Mar 2020 23:53:43 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Apr 2020 20:31:47 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Sep 2020 17:53:58 GMT'}]",2021-12-16,"[['Amir', 'Talley', ''], ['Aspnes', 'James', ''], ['Doty', 'David', ''], ['Eftekhari', 'Mahsa', ''], ['Severson', 'Eric', '']]","['Population protocols', 'junta election', 'counting', 'Turing machine simulation']"
8499,1911.01941,Sukhpal Singh Gill,"Sukhpal Singh Gill, Shreshth Tuli, Minxian Xu, Inderpreet Singh, Karan
  Vijay Singh, Dominic Lindsay, Shikhar Tuli, Daria Smirnova, Manmeet Singh,
  Udit Jain, Haris Pervaiz, Bhanu Sehgal, Sukhwinder Singh Kaila, Sanjay Misra,
  Mohammad Sadegh Aslanpour, Harshit Mehta, Vlado Stankovski and Peter
  Garraghan","Transformative effects of IoT, Blockchain and Artificial Intelligence on
  cloud computing: Evolution, vision, trends and open challenges","30 Pages, 4 Figures and Preprint version - Published in Elsevier's
  Internet of Things Journal",,10.1016/j.iot.2019.100118,,cs.DC,http://creativecommons.org/publicdomain/zero/1.0/,"  Cloud computing plays a critical role in modern society and enables a range
of applications from infrastructure to social media. Such system must cope with
varying load and evolving usage reflecting societies interaction and dependency
on automated computing systems whilst satisfying Quality of Service (QoS)
guarantees. Enabling these systems are a cohort of conceptual technologies,
synthesized to meet demand of evolving computing applications. In order to
understand current and future challenges of such system, there is a need to
identify key technologies enabling future applications. In this study, we aim
to explore how three emerging paradigms (Blockchain, IoT and Artificial
Intelligence) will influence future cloud computing systems. Further, we
identify several technologies driving these paradigms and invite international
experts to discuss the current status and future directions of cloud computing.
Finally, we proposed a conceptual model for cloud futurology to explore the
influence of emerging paradigms and technologies on evolution of cloud
computing.
","[{'version': 'v1', 'created': 'Mon, 21 Oct 2019 08:17:27 GMT'}]",2022-03-01,"[['Gill', 'Sukhpal Singh', ''], ['Tuli', 'Shreshth', ''], ['Xu', 'Minxian', ''], ['Singh', 'Inderpreet', ''], ['Singh', 'Karan Vijay', ''], ['Lindsay', 'Dominic', ''], ['Tuli', 'Shikhar', ''], ['Smirnova', 'Daria', ''], ['Singh', 'Manmeet', ''], ['Jain', 'Udit', ''], ['Pervaiz', 'Haris', ''], ['Sehgal', 'Bhanu', ''], ['Kaila', 'Sukhwinder Singh', ''], ['Misra', 'Sanjay', ''], ['Aslanpour', 'Mohammad Sadegh', ''], ['Mehta', 'Harshit', ''], ['Stankovski', 'Vlado', ''], ['Garraghan', 'Peter', '']]","['Cloud Computing', 'Quality of Service', 'Cloud Applications', 'Cloud Paradigms and Technologies', 'IoT', 'Blockchain', 'Artificial Intelligence']"
8500,2111.01773,Kevin Silva,Kevin M. Silva and Kevin J. Maki,"Data-Driven System Identification of 6-DoF Ship Motion in Waves with
  Neural Networks",,,10.1016/j.apor.2022.103222,,cs.LG cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Critical evaluation and understanding of ship responses in the ocean is
important for not only the design and engineering of future platforms but also
the operation and safety of those that are currently deployed. Simulations or
experiments are typically performed in nominal sea conditions during ship
design or prior to deployment and the results may not be reflective of the
instantaneous state of the vessel and the ocean environment while deployed.
Short-term temporal predictions of ship responses given the current wave
environment and ship state would enable enhanced decision-making onboard for
both manned and unmanned vessels. However, the current state-of-the-art in
numerical hydrodynamic simulation tools are too computationally expensive to be
employed for real-time ship motion forecasting and the computationally
efficient tools are too low fidelity to provide accurate responses. A
methodology is developed with long short-term memory (LSTM) neural networks to
represent the motions of a free running David Taylor Model Basin (DTMB) 5415
destroyer operating at 20 knots in Sea State 7 stern-quartering irregular seas.
Case studies are performed for both course-keeping and turning circle
scenarios. An estimate of the vessel's encounter frame is made with the
trajectories observed in the training dataset. Wave elevation time histories
are given by artificial wave probes that travel with the estimated encounter
frame and serve as input into the neural network, while the output is the 6-DOF
temporal ship motion response. Overall, the neural network is able to predict
the temporal response of the ship due to unseen waves accurately, which makes
this methodology suitable for system identification and real-time ship motion
forecasting. The methodology, the dependence of model accuracy on wave probe
and training data quantity and the estimated encounter frame are all detailed.
","[{'version': 'v1', 'created': 'Tue, 2 Nov 2021 17:51:35 GMT'}]",2023-01-25,"[['Silva', 'Kevin M.', ''], ['Maki', 'Kevin J.', '']]","['Long Short-Term Memory Neural Networks', 'Machine Learning', 'Maneuvering', '6-DoF', 'Ship Hydrodynamics']"
8501,1910.11632,Michael J. Klaiber,"Michael J. Klaiber, Sebastian Vogel, Axel Acosta, Robert Korn,
  Leonardo Ecco, Kristine Back, Andre Guntoro, Ingo Feldner","An End-to-End HW/SW Co-Design Methodology to Design Efficient Deep
  Neural Network Systems using Virtual Models",,"Embedded Systems Week 2019, INTelligent Embedded Systems
  Architectures and Applications Workshop 2019",10.1145/3372394.3372396,,cs.LG cs.DC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  End-to-end performance estimation and measurement of deep neural network
(DNN) systems become more important with increasing complexity of DNN systems
consisting of hardware and software components. The methodology proposed in
this paper aims at a reduced turn-around time for evaluating different design
choices of hardware and software components of DNN systems. This reduction is
achieved by moving the performance estimation from the implementation phase to
the concept phase by employing virtual hardware models instead of gathering
measurement results from physical prototypes. Deep learning compilers introduce
hardware-specific transformations and are, therefore, considered a part of the
design flow of virtual system models to extract end-to-end performance
estimations. To validate the run-time accuracy of the proposed methodology, a
system processing the DilatedVGG DNN is realized both as virtual system model
and as hardware implementation. The results show that up to 92 % accuracy can
be reached in predicting the processing time of the DNN inference.
","[{'version': 'v1', 'created': 'Fri, 25 Oct 2019 11:42:00 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Nov 2019 11:35:18 GMT'}]",2019-11-19,"[['Klaiber', 'Michael J.', ''], ['Vogel', 'Sebastian', ''], ['Acosta', 'Axel', ''], ['Korn', 'Robert', ''], ['Ecco', 'Leonardo', ''], ['Back', 'Kristine', ''], ['Guntoro', 'Andre', ''], ['Feldner', 'Ingo', '']]","['Virtual Prototyping', 'Hardware Model', 'Simulation Methodology', 'Design Space Exploration']"
8502,1907.01589,Roy R. Lederman,"Roy R. Lederman, Joakim And\'en, Amit Singer","Hyper-Molecules: on the Representation and Recovery of Dynamical
  Structures, with Application to Flexible Macro-Molecular Structures in
  Cryo-EM",,,10.1088/1361-6420/ab5ede,,cs.CV stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cryo-electron microscopy (cryo-EM), the subject of the 2017 Nobel Prize in
Chemistry, is a technology for determining the 3-D structure of macromolecules
from many noisy 2-D projections of instances of these macromolecules, whose
orientations and positions are unknown. The molecular structures are not rigid
objects, but flexible objects involved in dynamical processes. The different
conformations are exhibited by different instances of the macromolecule
observed in a cryo-EM experiment, each of which is recorded as a particle
image. The range of conformations and the conformation of each particle are not
known a priori; one of the great promises of cryo-EM is to map this
conformation space. Remarkable progress has been made in determining rigid
structures from homogeneous samples of molecules in spite of the unknown
orientation of each particle image and significant progress has been made in
recovering a few distinct states from mixtures of rather distinct
conformations, but more complex heterogeneous samples remain a major challenge.
We introduce the ``hyper-molecule'' framework for modeling structures across
different states of heterogeneous molecules, including continuums of states.
The key idea behind this framework is representing heterogeneous macromolecules
as high-dimensional objects, with the additional dimensions representing the
conformation space. This idea is then refined to model properties such as
localized heterogeneity. In addition, we introduce an algorithmic framework for
recovering such maps of heterogeneous objects from experimental data using a
Bayesian formulation of the problem and Markov chain Monte Carlo (MCMC)
algorithms to address the computational challenges in recovering these high
dimensional hyper-molecules. We demonstrate these ideas in a prototype applied
to synthetic data.
","[{'version': 'v1', 'created': 'Tue, 2 Jul 2019 19:16:12 GMT'}]",2020-04-22,"[['Lederman', 'Roy R.', ''], ['Andén', 'Joakim', ''], ['Singer', 'Amit', '']]","['cryo-EM', 'continuousheterogeneity', 'hyper-molecules', 'hyper-objects', 'dynamical systems', 'non-rigid deformations', 'MCMC']"
8503,cs/0703037,Alexander Wolff,"Hee-Kap Ahn and Helmut Alt and Tetsuo Asano and Sang Won Bae and Peter
  Brass and Otfried Cheong and Christian Knauer and Hyeon-Suk Na and Chan-Su
  Shin and Alexander Wolff",Constructing Optimal Highways,"13 pages, 9 figures, preliminary version appeared at CATS'07","International Journal of Foundations of Computer Science
  20(2009):3-23",10.1142/S0129054109006425,,cs.CG,,"  For two points $p$ and $q$ in the plane, a straight line $h$, called a
highway, and a real $v>1$, we define the \emph{travel time} (also known as the
\emph{city distance}) from $p$ and $q$ to be the time needed to traverse a
quickest path from $p$ to $q$, where the distance is measured with speed $v$ on
$h$ and with speed 1 in the underlying metric elsewhere.
  Given a set $S$ of $n$ points in the plane and a highway speed $v$, we
consider the problem of finding a \emph{highway} that minimizes the maximum
travel time over all pairs of points in $S$. If the orientation of the highway
is fixed, the optimal highway can be computed in linear time, both for the
$L_1$- and the Euclidean metric as the underlying metric. If arbitrary
orientations are allowed, then the optimal highway can be computed in $O(n^{2}
\log n)$ time. We also consider the problem of computing an optimal pair of
highways, one being horizontal, one vertical.
","[{'version': 'v1', 'created': 'Thu, 8 Mar 2007 17:22:21 GMT'}]",2010-08-26,"[['Ahn', 'Hee-Kap', ''], ['Alt', 'Helmut', ''], ['Asano', 'Tetsuo', ''], ['Bae', 'Sang Won', ''], ['Brass', 'Peter', ''], ['Cheong', 'Otfried', ''], ['Knauer', 'Christian', ''], ['Na', 'Hyeon-Suk', ''], ['Shin', 'Chan-Su', ''], ['Wolff', 'Alexander', '']]","['geometric facility location', 'min-max-min problem', 'city metric', 'time metric', 'optimal highways']"
8504,2204.04105,Mateusz Zaborski,Mateusz Zaborski and Jacek Ma\'ndziuk,Improving LSHADE by means of a pre-screening mechanism,"Accepted at Genetic and Evolutionary Computation Conference
  (GECCO'22)","Genetic and Evolutionary Computation Conference, GECCO 2022,
  884-892",10.1145/3512290.3528805,,cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Evolutionary algorithms have proven to be highly effective in continuous
optimization, especially when numerous fitness function evaluations (FFEs) are
possible. In certain cases, however, an expensive optimization approach (i.e.
with relatively low number of FFEs) must be taken, and such a setting is
considered in this work. The paper introduces an extension to the well-known
LSHADE algorithm in the form of a pre-screening mechanism (psLSHADE). The
proposed pre-screening relies on the three following components: a specific
initial sampling procedure, an archive of samples, and a global linear
meta-model of a fitness function that consists of 6 independent transformations
of variables. The pre-screening mechanism preliminary assesses the trial
vectors and designates the best one of them for further evaluation with the
fitness function. The performance of psLSHADE is evaluated using the CEC2021
benchmark in an expensive scenario with an optimization budget of 10^2-10^4
FFEs per dimension. We compare psLSHADE with the baseline LSHADE method and the
MadDE algorithm. The results indicate that with restricted optimization budgets
psLSHADE visibly outperforms both competitive algorithms. In addition, the use
of the pre-screening mechanism results in faster population convergence of
psLSHADE compared to LSHADE.
","[{'version': 'v1', 'created': 'Fri, 8 Apr 2022 14:52:46 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Apr 2022 14:27:13 GMT'}]",2022-08-16,"[['Zaborski', 'Mateusz', ''], ['Mańdziuk', 'Jacek', '']]","['Surrogate model', 'LSHADE', 'Meta-model']"
8505,2108.12078,Nasif Imtiaz,"Nasif Imtiaz, Seaver Thorne, Laurie Williams","A Comparative Study of Vulnerability Reporting by Software Composition
  Analysis Tools","In Proceedings of the 15th International Symposium on Empirical
  Software Engineering and Measurement",,10.1145/3475716.3475769,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Modern software uses many third-party libraries and frameworks as
dependencies. Known vulnerabilities in these dependencies are a potential
security risk. Software composition analysis (SCA) tools, therefore, are being
increasingly adopted by practitioners to keep track of vulnerable dependencies.
Aim: The goal of this study is to understand the difference in vulnerability
reporting by various SCA tools. Understanding if and how existing SCA tools
differ in their analysis may help security practitioners to choose the right
tooling and identify future research needs. Method: We present an in-depth case
study by comparing the analysis reports of 9 industry-leading SCA tools on a
large web application, OpenMRS, composed of Maven (Java) and npm (JavaScript)
projects. Results: We find that the tools vary in their vulnerability
reporting. The count of reported vulnerable dependencies ranges from 17 to 332
for Maven and from 32 to 239 for npm projects across the studied tools.
Similarly, the count of unique known vulnerabilities reported by the tools
ranges from 36 to 313 for Maven and from 45 to 234 for npm projects. Our manual
analysis of the tools' results suggest that accuracy of the vulnerability
database is a key differentiator for SCA tools. Conclusion: We recommend that
practitioners should not rely on any single tool at the present, as that can
result in missing known vulnerabilities. We point out two research directions
in the SCA space: i) establishing frameworks and metrics to identify false
positives for dependency vulnerabilities; and ii) building automation
technologies for continuous monitoring of vulnerability data from open source
package ecosystems.
","[{'version': 'v1', 'created': 'Fri, 27 Aug 2021 01:04:29 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Sep 2021 16:58:06 GMT'}]",2021-09-02,"[['Imtiaz', 'Nasif', ''], ['Thorne', 'Seaver', ''], ['Williams', 'Laurie', '']]","['software composition analysis', 'supply chain security', 'vulnerability', 'dependency', 'security tools', 'case study']"
8506,2204.03526,Enrico Zardini,"Enrico Zardini, Massimo Rizzoli, Sebastiano Dissegna, Enrico
  Blanzieri, Davide Pastorello",Reconstructing Bayesian Networks on a Quantum Annealer,"29 pages, 6 figures",Quantum Information and Computation 22 15-16 (2022) 1320-1350,10.26421/QIC22.15-16-4,,cs.ET quant-ph,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Bayesian networks are widely used probabilistic graphical models, whose
structure is hard to learn starting from the generated data. O'Gorman et al.
have proposed an algorithm to encode this task, i.e., the Bayesian network
structure learning (BSNL), into a form that can be solved through quantum
annealing, but they have not provided an experimental evaluation of it. In this
paper, we present (i) an implementation in Python of O'Gorman's algorithm, (ii)
a divide et impera approach that allows addressing BNSL problems of larger
sizes in order to overcome the limitations imposed by the current
architectures, and (iii) their empirical evaluation. Specifically, several
problems with an increasing number of variables have been used in the
experiments. The results have shown the effectiveness of O'Gorman's formulation
for BNSL instances of small sizes, and the superiority of the divide et impera
approach on the direct execution of O'Gorman's algorithm.
","[{'version': 'v1', 'created': 'Thu, 7 Apr 2022 15:53:05 GMT'}]",2022-11-16,"[['Zardini', 'Enrico', ''], ['Rizzoli', 'Massimo', ''], ['Dissegna', 'Sebastiano', ''], ['Blanzieri', 'Enrico', ''], ['Pastorello', 'Davide', '']]","['Bayesian Network Structure Learning', 'Quantum Annealing', 'Quantum Software', 'Empirical Evaluation']"
8507,2002.05233,Emanuele Pesce Mr.,"Emanuele Pesce, Giovanni Montana","Learning Multi-Agent Coordination through Connectivity-driven
  Communication",,Machine Learning (December 2022),10.1007/s10994-022-06286-6,,cs.LG cs.AI cs.MA stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In artificial multi-agent systems, the ability to learn collaborative
policies is predicated upon the agents' communication skills: they must be able
to encode the information received from the environment and learn how to share
it with other agents as required by the task at hand. We present a deep
reinforcement learning approach, Connectivity Driven Communication (CDC), that
facilitates the emergence of multi-agent collaborative behaviour only through
experience. The agents are modelled as nodes of a weighted graph whose
state-dependent edges encode pair-wise messages that can be exchanged. We
introduce a graph-dependent attention mechanisms that controls how the agents'
incoming messages are weighted. This mechanism takes into full account the
current state of the system as represented by the graph, and builds upon a
diffusion process that captures how the information flows on the graph. The
graph topology is not assumed to be known a priori, but depends dynamically on
the agents' observations, and is learnt concurrently with the attention
mechanism and policy in an end-to-end fashion. Our empirical results show that
CDC is able to learn effective collaborative policies and can over-perform
competing learning algorithms on cooperative navigation tasks.
","[{'version': 'v1', 'created': 'Wed, 12 Feb 2020 20:58:33 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Jun 2020 20:00:08 GMT'}, {'version': 'v3', 'created': 'Sun, 12 Dec 2021 13:00:09 GMT'}, {'version': 'v4', 'created': 'Thu, 1 Dec 2022 16:29:17 GMT'}]",2023-01-23,"[['Pesce', 'Emanuele', ''], ['Montana', 'Giovanni', '']]","['Reinforcement Learning', 'Multi-agent system', 'Neural Networks', 'Graphs']"
8508,2109.07861,Pawel Trajdos,"Pawel Trajdos, Marek Kurzynski","Building an Ensemble of Classifiers via Randomized Models of Ensemble
  Members",,,10.1007/978-3-030-81523-3_1,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Many dynamic ensemble selection (DES) methods are known in the literature. A
previously-developed by the authors, method consists in building a randomized
classifier which is treated as a model of the base classifier. The model is
equivalent to the base classifier in a certain probabilistic sense. Next, the
probability of correct classification of randomized classifier is taken as the
competence of the evaluated classifier.
  In this paper, a novel randomized model of base classifier is developed. In
the proposed method, the random operation of the model results from a random
selection of the learning set from the family of learning sets of a fixed size.
The paper presents the mathematical foundations of this approach and shows how,
for a practical application when learning and validation sets are given, one
can determine the measure of competence and build a MC system with the DES
scheme.
  The DES scheme with the proposed model of competence was experimentally
evaluated on the collection of 67 benchmark datasets and compared in terms of
eight quality criteria with two ensemble classifiers which use the
previously-proposed concepts of randomized model. The proposed approach
achieved the lowest ranks for almost all investigated quality criteria.
","[{'version': 'v1', 'created': 'Thu, 16 Sep 2021 10:53:13 GMT'}]",2021-09-17,"[['Trajdos', 'Pawel', ''], ['Kurzynski', 'Marek', '']]","['ensemble classification', 'probabilistic model', 'randomized classifier', 'competence']"
8509,2007.10079,Souhaib Douass,Souhaib Douass and M'hamed Ait Kbir,"Flood zones detection using a runoff model built on Hexagonal shape
  based cellular automata","7 pages, 19 figures, Published with International Journal of
  Engineering Trends and Technology (IJETT)","International Journal of Engineering Trends and Technology
  68.6(2020):68-74",10.14445/22315381/IJETT-V68I6P211S,,cs.CE nlin.CG stat.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents a 3D geographic information systems (GIS) modeling and
simulation of water flow in a landscape defined by a digital terrain model,
provided by some available geolocation APIs. The proposed approach uses a
cellular automata based algorithm to calculate water flow dynamic. The
methodology was tested on a case study area of 27kmx19km located in Tangier,
north of Morocco. In fact, we aim to detect flood zones in order to prevent
problems related to space occupation in urban and rural regions. Some indices
can be deduced from the stream shape using Cellular Automata (CA) based
approach that can reduce the complexity related to space structures with
multiple changes. A spatiotemporal simulation of the runoff process is provided
using 3D visualization that we can pair with geographical information system
tools (GIS). The 3D GIS modeling approach that was developed for the analyses
of flood zones detection using a runoff model based on cellular automata was
comprised of three main steps: Input (collection of data), calculation (CA
tool) and visualization (3D simulation).
","[{'version': 'v1', 'created': 'Thu, 16 Jul 2020 23:42:31 GMT'}]",2020-07-21,"[['Douass', 'Souhaib', ''], ['Kbir', ""M'hamed Ait"", '']]","['water flow', 'water distribution', 'flood', 'digital terrain model', 'GIS', 'cellular automata', 'spatiotemporal']"
8510,1411.7416,Ju Ren,Ju Ren and Yaoxue Zhang and Kuan Zhang and Xuemin (Sherman) Shen,"SACRM: Social Aware Crowdsourcing with Reputation Management in Mobile
  Sensing",,"Computer Communications, Vol. 65, No. 7, pp. 55-65, 2015",10.1016/j.comcom.2015.01.022,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile sensing has become a promising paradigm for mobile users to obtain
information by task crowdsourcing. However, due to the social preferences of
mobile users, the quality of sensing reports may be impacted by the underlying
social attributes and selfishness of individuals. Therefore, it is crucial to
consider the social impacts and trustworthiness of mobile users when selecting
task participants in mobile sensing. In this paper, we propose a Social Aware
Crowdsourcing with Reputation Management (SACRM) scheme to select the
well-suited participants and allocate the task rewards in mobile sensing.
Specifically, we consider the social attributes, task delay and reputation in
crowdsourcing and propose a participant selection scheme to choose the
well-suited participants for the sensing task under a fixed task budget. A
report assessment and rewarding scheme is also introduced to measure the
quality of the sensing reports and allocate the task rewards based the assessed
report quality. In addition, we develop a reputation management scheme to
evaluate the trustworthiness and cost performance ratio of mobile users for
participant selection. Theoretical analysis and extensive simulations
demonstrate that SACRM can efficiently improve the crowdsourcing utility and
effectively stimulate the participants to improve the quality of their sensing
reports.
","[{'version': 'v1', 'created': 'Wed, 26 Nov 2014 22:53:26 GMT'}]",2015-07-23,"[['Ren', 'Ju', '', 'Sherman'], ['Zhang', 'Yaoxue', '', 'Sherman'], ['Zhang', 'Kuan', '', 'Sherman'], ['Xuemin', '', '', 'Sherman'], ['Shen', '', '']]","['Mobile sensing', 'crowdsensing', 'social impact', 'reputation', 'participant selection', 'crowdsourcing']"
8511,1605.03286,Bowen Yan,Bowen Yan and Jianxi Luo,Multicores-periphery structure in networks,26 pages,Net Sci 7 (2019) 70-87,10.1016/j.apsusc.2018.09.234,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many real-world networks exhibit a multicores-periphery structure, with
densely connected vertices in multiple cores surrounded by a general periphery
of sparsely connected vertices. Identification of the multicores-periphery
structure can provide a new lens to understand the structures and functions of
various real-world networks. This paper defines the multicores-periphery
structure and introduces an algorithm to identify the optimal partition of
multiple cores and the periphery in general networks. We demonstrate the
performance of our algorithm by applying it to a well-known social network and
a patent technology network, which are best characterized by the
multicores-periphery structure. The analyses also reveal the differences
between our multicores-periphery detection algorithm and two state-of-the-art
algorithms for detecting the single core-periphery structure and community
structure.
","[{'version': 'v1', 'created': 'Wed, 11 May 2016 05:20:44 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Aug 2018 02:30:14 GMT'}]",2019-05-08,"[['Yan', 'Bowen', ''], ['Luo', 'Jianxi', '']]","['meso-scale structure', 'core-periphery structure', 'community detection']"
8512,2004.10489,Fabio Caraffini PhD,"Anna V. Kononova, Fabio Caraffini and Thomas B\""ack",Differential evolution outside the box,,"Information Sciences, 581:587-604, 2021",10.1016/j.ins.2021.09.058,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates how often the popular configurations of Differential
Evolution generate solutions outside the feasible domain. Following previous
publications in the field, we argue that what the algorithm does with such
solutions and how often this has to happen is important for the overall
performance of the algorithm and interpretation of results. Based on
observations therein, we conclude that significantly more solutions than what
is usually assumed by practitioners need to undergo some sort of 'correction'
to conform with the definition of the problem's search domain. A wide range of
popular Differential Evolution configurations is considered in this study.
Conclusions are made regarding the effect the Differential Evolution components
and parameter settings have on the distribution of proportions of infeasible
solutions generated in a series of independent runs. Results shown in this
study suggest strong dependencies between proportions of generated infeasible
solutions and every aspect mentioned above. Further investigation of the
distribution of proportions of generated infeasible solutions is required.
","[{'version': 'v1', 'created': 'Wed, 22 Apr 2020 10:58:05 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Jan 2022 17:44:35 GMT'}]",2022-01-19,"[['Kononova', 'Anna V.', ''], ['Caraffini', 'Fabio', ''], ['Bäck', 'Thomas', '']]","['differential evolution', 'infeasibility', 'constraints handling', 'evolutionarycomputing', 'box-constrained problem', 'metaheuristic']"
8513,1712.06452,Ester Bonmati,"Ester Bonmati, Yipeng Hu, Nikhil Sindhwani, Hans Peter Dietz, Jan
  D'hooge, Dean Barratt, Jan Deprest, Tom Vercauteren","Automatic segmentation method of pelvic floor levator hiatus in
  ultrasound using a self-normalising neural network",,,10.1117/1.JMI.5.2.021206,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Segmentation of the levator hiatus in ultrasound allows to extract biometrics
which are of importance for pelvic floor disorder assessment. In this work, we
present a fully automatic method using a convolutional neural network (CNN) to
outline the levator hiatus in a 2D image extracted from a 3D ultrasound volume.
In particular, our method uses a recently developed scaled exponential linear
unit (SELU) as a nonlinear self-normalising activation function, which for the
first time has been applied in medical imaging with CNN. SELU has important
advantages such as being parameter-free and mini-batch independent, which may
help to overcome memory constraints during training. A dataset with 91 images
from 35 patients during Valsalva, contraction and rest, all labelled by three
operators, is used for training and evaluation in a leave-one-patient-out
cross-validation. Results show a median Dice similarity coefficient of 0.90
with an interquartile range of 0.08, with equivalent performance to the three
operators (with a Williams' index of 1.03), and outperforming a U-Net
architecture without the need for batch normalisation. We conclude that the
proposed fully automatic method achieved equivalent accuracy in segmenting the
pelvic floor levator hiatus compared to a previous semi-automatic approach.
","[{'version': 'v1', 'created': 'Mon, 18 Dec 2017 15:04:21 GMT'}]",2018-01-17,"[['Bonmati', 'Ester', ''], ['Hu', 'Yipeng', ''], ['Sindhwani', 'Nikhil', ''], ['Dietz', 'Hans Peter', ''], [""D'hooge"", 'Jan', ''], ['Barratt', 'Dean', ''], ['Deprest', 'Jan', ''], ['Vercauteren', 'Tom', '']]","['levator hiatus', 'automatic segmentation', 'SNN', 'ultrasound', 'CNN  *Ester Bonmati', 'E-mail e.bonmati@ucl.ac']"
8514,2004.04560,Alexander Vandesompele,"Alexander Vandesompele, Gabriel Urbain, Francis wyffels, Joni Dambre","Populations of Spiking Neurons for Reservoir Computing: Closed Loop
  Control of a Compliant Quadruped",,,10.1016/j.cogsys.2019.08.002,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Compliant robots can be more versatile than traditional robots, but their
control is more complex. The dynamics of compliant bodies can however be turned
into an advantage using the physical reservoir computing frame-work. By feeding
sensor signals to the reservoir and extracting motor signals from the
reservoir, closed loop robot control is possible. Here, we present a novel
framework for implementing central pattern generators with spiking neural
networks to obtain closed loop robot control. Using the FORCE learning
paradigm, we train a reservoir of spiking neuron populations to act as a
central pattern generator. We demonstrate the learning of predefined gait
patterns, speed control and gait transition on a simulated model of a compliant
quadrupedal robot.
","[{'version': 'v1', 'created': 'Thu, 9 Apr 2020 14:32:49 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Apr 2020 13:29:35 GMT'}]",2020-04-15,"[['Vandesompele', 'Alexander', ''], ['Urbain', 'Gabriel', ''], ['wyffels', 'Francis', ''], ['Dambre', 'Joni', '']]","['spiking neural networks', 'compliant robotics', 'quadrupedcontrol', 'reservoir computing']"
8515,1904.09239,Phan Trung Hai Nguyen,Per Kristian Lehre and Phan Trung Hai Nguyen,"Runtime Analysis of the Univariate Marginal Distribution Algorithm under
  Low Selective Pressure and Prior Noise","To appear at GECCO 2019, Prague, Czech Republic",,10.1145/3321707.3321834,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We perform a rigorous runtime analysis for the Univariate Marginal
Distribution Algorithm on the LeadingOnes function, a well-known benchmark
function in the theory community of evolutionary computation with a high
correlation between decision variables. For a problem instance of size $n$, the
currently best known upper bound on the expected runtime is
$\mathcal{O}(n\lambda\log\lambda+n^2)$ (Dang and Lehre, GECCO 2015), while a
lower bound necessary to understand how the algorithm copes with variable
dependencies is still missing. Motivated by this, we show that the algorithm
requires a $e^{\Omega(\mu)}$ runtime with high probability and in expectation
if the selective pressure is low; otherwise, we obtain a lower bound of
$\Omega(\frac{n\lambda}{\log(\lambda-\mu)})$ on the expected runtime.
Furthermore, we for the first time consider the algorithm on the function under
a prior noise model and obtain an $\mathcal{O}(n^2)$ expected runtime for the
optimal parameter settings. In the end, our theoretical results are accompanied
by empirical findings, not only matching with rigorous analyses but also
providing new insights into the behaviour of the algorithm.
","[{'version': 'v1', 'created': 'Fri, 19 Apr 2019 15:49:27 GMT'}]",2019-04-22,"[['Lehre', 'Per Kristian', ''], ['Nguyen', 'Phan Trung Hai', '']]","['Univariate marginal distribution algorithm', 'leadingones', 'noisyoptimisation', 'running time analysis', 'theory']"
8516,2005.11645,Zhiguo Wang,"Zhiguo Wang, Zhongliang Yang, Yujin Zhang","Master-Auxiliary: an efficient aggregation strategy for video anomaly
  detection",7 pages,,10.1109/LSP.2021.3107750,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of surveillance video anomaly detection is to detect events that
rarely or never happened in a certain scene. Generally, different detectors can
detect different anomalies. This paper proposes an efficient strategy to
aggregate multiple detectors. First, the aggregation strategy chooses one
detector as master detector by experience, and sets the remaining detectors as
auxiliary detectors. Then, the aggregation strategy extracts credible
information from auxiliary detectors, including credible abnormal (Cred-a)
frames and credible normal (Cred-n) frames. After that, the frequencies that
each video frame being judged as Cred-a and Cred-n are counted. Applying the
events' time continuity property, more Cred-a and Cred-n frames can be
inferred. Finally, the aggregation strategy utilizes the Cred-a and Cred-n
frequencies to vote to calculate soft weights, and uses the soft weights to
assist the master detector. Experiments are carried out on multiple datasets.
Comparing with existing aggregation strategies, the proposed strategy achieves
state-of-the-art performance.
","[{'version': 'v1', 'created': 'Sun, 24 May 2020 03:09:08 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Sep 2020 13:34:56 GMT'}]",2021-09-29,"[['Wang', 'Zhiguo', ''], ['Yang', 'Zhongliang', ''], ['Zhang', 'Yujin', '']]","['video anomaly detection', 'aggregation', 'voting mechanism', 'master-auxiliary']"
8517,2103.16518,Cagatay Basdogan,"Bushra Sadia, Senem Ezgi Emgin, T. Metin Sezgin, Cagatay Basdogan",Data-Driven Vibrotactile Rendering of Digital Buttons on Touchscreens,,"International Journal of Human-Computer Studies, 2020, Vol. 135,
  102363",10.1016/j.ijhcs.2019.09.005,,cs.HC cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although mobile phones incorporate low-cost vibration motors to enhance
touch-based interactions, it is not possible to generate complex tactile
effects on their touchscreens. It is also difficult to relate the limited
vibrotactile feedback generated by these motors to different types of physical
buttons. In this study, we focus on creating vibrotactile feedback on a
touchscreen that simulates the feeling of physical buttons using piezo
actuators attached to it. We first recorded and analyzed the force,
acceleration, and voltage data from twelve participants interacting with three
different physical buttons: latch, toggle, and push buttons. Then, a
button-specific vibrotactile stimulus was generated for each button based on
the recorded data. Finally, we conducted a threealternative forced choice
(3AFC) experiment with twenty participants to explore whether the resultant
stimulus is distinct and realistic. In our experiment, participants were able
to match the three digital buttons with their physical counterparts with a
success rate of 83%. In addition, we harvested seven adjective pairs from the
participants expressing their perceptual feeling of pressing the physical
buttons. All twenty participants rated the degree of their subjective feelings
associated with each adjective for all the physical and digital buttons
investigated in this study. Our statistical analysis showed that there exist at
least three adjective pairs for which participants have rated two out of three
digital buttons similar to their physical counterparts.
","[{'version': 'v1', 'created': 'Tue, 30 Mar 2021 17:21:15 GMT'}]",2021-03-31,"[['Sadia', 'Bushra', ''], ['Emgin', 'Senem Ezgi', ''], ['Sezgin', 'T. Metin', ''], ['Basdogan', 'Cagatay', '']]","['Data-Driven rendering', 'Surface Haptics', 'Vibrotactile Feedback', 'Digital Buttons']"
8518,2111.00799,Gordon Fraser,"Luisa Greifenstein, Isabella Gra{\ss}l, Gordon Fraser","Challenging but Full of Opportunities: Teachers' Perspectives on
  Programming in Primary Schools","To be published in the Proceedings of the 21st Koli Calling
  International Conference on Computing Education Research (Koli Calling 2021)",,10.1145/3488042.3488048,,cs.CY cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The widespread establishment of computational thinking in school curricula
requires teachers to introduce children to programming already at primary
school level. As this is a recent development, primary school teachers may
neither be adequately prepared for how to best teach programming, nor may they
be fully aware why they have to do so. In order to gain a better understanding
of these questions, we contrast insights taken from practical experiences with
the anticipations of teachers in training. By surveying 200 teachers who have
taught programming at primary schools and 97 teachers in training, we identify
relevant challenges when teaching programming, opportunities that arise when
children learn programming, and strategies how to address both of these in
practice. While many challenges and opportunities are correctly anticipated, we
find several disagreements that can inform revisions of the curricula in
teaching studies to better prepare primary school teachers for teaching
programming at primary schools.
","[{'version': 'v1', 'created': 'Mon, 1 Nov 2021 10:02:00 GMT'}]",2021-11-04,"[['Greifenstein', 'Luisa', ''], ['Graßl', 'Isabella', ''], ['Fraser', 'Gordon', '']]","['Programming education', 'primary school', 'teacher survey']"
8519,2107.11870,Random Gwinn,"Random Gwinn, Mark A. Matties, Aviel D. Rubin",Wavelet Selection and Employment for Side-Channel Disassembly,"9 pages, 8 figures, 4 tables",,10.1109/PAINE54418.2021.9707707,,cs.CR eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Side-channel analysis, originally used in cryptanalysis is growing in use
cases, both offensive and defensive. Wavelet analysis is a commonly employed
time-frequency analysis technique used across disciplines, with a variety of
purposes, and has shown increasing prevalence within side-channel literature.
This paper explores wavelet selection and analysis parameters for use in
side-channel analysis, particularly power side-channel-based instruction
disassembly and classification. Experiments are conducted on an ATmega328P
microcontroller and a subset of the AVR instruction set. Classification
performance is evaluated with a time-series convolutional neural network (CNN)
at clock-cycle fidelity. This work demonstrates that wavelet selection and
employment parameters have meaningful impact on analysis outcomes.
Practitioners should make informed decisions and consider optimizing these
factors similarly to machine learning architecture and hyperparameters. We
conclude that the gaus1 wavelet with scales 1-21 and grayscale colormap
provided the best balance of classification performance, time, and memory
efficiency in our application.
","[{'version': 'v1', 'created': 'Sun, 25 Jul 2021 18:59:41 GMT'}]",2022-04-12,"[['Gwinn', 'Random', ''], ['Matties', 'Mark A.', ''], ['Rubin', 'Aviel D.', '']]","['side-channel analysis', 'wavelet transform', 'scalogram', 'disassembly', 'classification']"
8520,1910.12415,Phillip Smith Mr,"Phillip Smith, Aldeida Aleti, Vincent C.S. Lee, Robert Hunjet, Asad
  Khan","Robotic Hierarchical Graph Neurons. A novel implementation of HGN for
  swarm robotic behaviour control",,Expert Systems with Applications 2021,10.1016/j.eswa.2021.115675,,cs.RO cs.AI cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper explores the use of a novel form of Hierarchical Graph Neurons
(HGN) for in-operation behaviour selection in a swarm of robotic agents. This
new HGN is called Robotic-HGN (R-HGN), as it matches robot environment
observations to environment labels via fusion of match probabilities from both
temporal and intra-swarm collections. This approach is novel for HGN as it
addresses robotic observations being pseudo-continuous numbers, rather than
categorical values. Additionally, the proposed approach is memory and
computation-power conservative and thus is acceptable for use in mobile devices
such as single-board computers, which are often used in mobile robotic agents.
This R-HGN approach is validated against individual behaviour implementation
and random behaviour selection. This contrast is made in two sets of simulated
environments: environments designed to challenge the held behaviours of the
R-HGN, and randomly generated environments which are more challenging for the
robotic swarm than R-HGN training conditions. R-HGN has been found to enable
appropriate behaviour selection in both these sets, allowing significant swarm
performance in pre-trained and unexpected environment conditions.
","[{'version': 'v1', 'created': 'Mon, 28 Oct 2019 03:11:22 GMT'}]",2021-09-07,"[['Smith', 'Phillip', ''], ['Aleti', 'Aldeida', ''], ['Lee', 'Vincent C. S.', ''], ['Hunjet', 'Robert', ''], ['Khan', 'Asad', '']]","['Distorted Pattern Recognition', 'RoboticBehavior', 'Swarm Robotics', 'Hierarchical Graph Neurons']"
8521,2011.03357,Jens Kosiol,"Lars Fritsche, Jens Kosiol, Adrian M\""oller, Andy Sch\""urr, Gabriele
  Taentzer","A Precedence-Driven Approach for Concurrent Model Synchronization
  Scenarios using Triple Graph Grammars","18 pages, 24 figures; to be published in: Proceedings of the 13th ACM
  SIGPLAN International Conference on Software Language Engineering (SLE '20)",,10.1145/3426425.3426931,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Concurrent model synchronization is the task of restoring consistency between
two correlated models after they have been changed concurrently and
independently. To determine whether such concurrent model changes conflict with
each other and to resolve these conflicts taking domain- or user-specific
preferences into account is highly challenging. In this paper, we present a
framework for concurrent model synchronization algorithms based on Triple Graph
Grammars (TGGs). TGGs specify the consistency of correlated models using
grammar rules; these rules can be used to derive different consistency
restoration operations. Using TGGs, we infer a causal dependency relation for
model elements that enables us to detect conflicts non-invasively. Different
kinds of conflicts are detected first and resolved by the subsequent conflict
resolution process. Users configure the overall synchronization process by
orchestrating the application of consistency restoration fragments according to
several conflict resolution strategies to achieve individual synchronization
goals. As proof of concept, we have implemented this framework in the model
transformation tool eMoflon. Our initial evaluation shows that the runtime of
our presented approach scales with the size of model changes and conflicts,
rather than model size.
","[{'version': 'v1', 'created': 'Fri, 6 Nov 2020 13:45:45 GMT'}]",2020-11-09,"[['Fritsche', 'Lars', ''], ['Kosiol', 'Jens', ''], ['Möller', 'Adrian', ''], ['Schürr', 'Andy', ''], ['Taentzer', 'Gabriele', '']]","['bidirectional transformation (bx)', 'concurrentmodel synchronization', 'triple graph grammars']"
8522,1801.09026,Kerem Camsari,"Orchi Hassan, Kerem Y. Camsari and Supriyo Datta",Voltage-driven Building Block for Hardware Belief Networks,,"IEEE Design and Test, 2019",10.1109/MDAT.2019.2897964,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Probabilistic spin logic (PSL), based on networks of binary stochastic
neurons (or p-bits), has been shown to provide a viable framework for many
functionalities including Ising computing, Bayesian inference, invertible
Boolean logic and image recognition. This paper presents a hardware building
block for the PSL architecture, consisting of an embedded MTJ and a capacitive
voltage adder of the type used in neuMOS. We use SPICE simulations to show how
identical copies of these building blocks (or weighted p-bits) can be
interconnected with wires to design and solve a small instance of the
NP-complete Subset Sum Problem fully in hardware.
","[{'version': 'v1', 'created': 'Sat, 27 Jan 2018 02:50:53 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Feb 2019 02:56:06 GMT'}]",2019-02-11,"[['Hassan', 'Orchi', ''], ['Camsari', 'Kerem Y.', ''], ['Datta', 'Supriyo', '']]","['Probabilistic computing', 'Embedded MTJ', 'p-bits', 'p-circuits', 'Invertible Boolean logic', 'Subset Sum Problem']"
8523,1909.09149,Sebastian Bayerl,"Marc Wenninger, Sebastian P. Bayerl, Jochen Schmidt, Korbinian
  Riedhammer",Timage -- A Robust Time Series Classification Pipeline,"ICANN19, 28th International Conference on Artificial Neural Networks",,10.1007/978-3-030-30490-4_36,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Time series are series of values ordered by time. This kind of data can be
found in many real world settings. Classifying time series is a difficult task
and an active area of research. This paper investigates the use of transfer
learning in Deep Neural Networks and a 2D representation of time series known
as Recurrence Plots. In order to utilize the research done in the area of image
classification, where Deep Neural Networks have achieved very good results, we
use a Residual Neural Networks architecture known as ResNet. As preprocessing
of time series is a major part of every time series classification pipeline,
the method proposed simplifies this step and requires only few parameters. For
the first time we propose a method for multi time series classification:
Training a single network to classify all datasets in the archive with one
network. We are among the first to evaluate the method on the latest 2018
release of the UCR archive, a well established time series classification
benchmarking dataset.
","[{'version': 'v1', 'created': 'Thu, 19 Sep 2019 08:37:54 GMT'}]",2019-09-23,"[['Wenninger', 'Marc', ''], ['Bayerl', 'Sebastian P.', ''], ['Schmidt', 'Jochen', ''], ['Riedhammer', 'Korbinian', '']]","['Deep Neural Networks', 'Transfer Learning', 'Time Series Classification']"
8524,1910.05493,Yasir Hussain,"Yasir Hussain, Zhiqiu Huang, Yu Zhou and Senzhang Wang",Deep Transfer Learning for Source Code Modeling,,"International Journal of Software Engineering and Knowledge
  Engineering. Vol. 30, No. 05, pp. 649-668 (2020)",10.1142/S0218194020500230,,cs.LG cs.NE cs.SE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, deep learning models have shown great potential in source
code modeling and analysis. Generally, deep learning-based approaches are
problem-specific and data-hungry. A challenging issue of these approaches is
that they require training from starch for a different related problem. In this
work, we propose a transfer learning-based approach that significantly improves
the performance of deep learning-based source code models. In contrast to
traditional learning paradigms, transfer learning can transfer the knowledge
learned in solving one problem into another related problem. First, we present
two recurrent neural network-based models RNN and GRU for the purpose of
transfer learning in the domain of source code modeling. Next, via transfer
learning, these pre-trained (RNN and GRU) models are used as feature
extractors. Then, these extracted features are combined into attention learner
for different downstream tasks. The attention learner leverages from the
learned knowledge of pre-trained models and fine-tunes them for a specific
downstream task. We evaluate the performance of the proposed approach with
extensive experiments with the source code suggestion task. The results
indicate that the proposed approach outperforms the state-of-the-art models in
terms of accuracy, precision, recall, and F-measure without training the models
from scratch.
","[{'version': 'v1', 'created': 'Sat, 12 Oct 2019 04:59:17 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Jul 2020 12:08:39 GMT'}]",2020-07-15,"[['Hussain', 'Yasir', ''], ['Huang', 'Zhiqiu', ''], ['Zhou', 'Yu', ''], ['Wang', 'Senzhang', '']]","['Transfer Learning', 'Deep Neural Language Models', 'Source CodeModeling', 'Attention Learning']"
8525,1806.05480,Ciprian-Octavian Truica,Ciprian-Octavian Truic\u{a} and Julien Velcin and Alexandru Boicea,"Automatic Language Identification for Romance Languages using Stop Words
  and Diacritics",,,10.1109/SYNASC.2015.45,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic language identification is a natural language processing problem
that tries to determine the natural language of a given content. In this paper
we present a statistical method for automatic language identification of
written text using dictionaries containing stop words and diacritics. We
propose different approaches that combine the two dictionaries to accurately
determine the language of textual corpora. This method was chosen because stop
words and diacritics are very specific to a language, although some languages
have some similar words and special characters they are not all common. The
languages taken into account were romance languages because they are very
similar and usually it is hard to distinguish between them from a computational
point of view. We have tested our method using a Twitter corpus and a news
article corpus. Both corpora consists of UTF-8 encoded text, so the diacritics
could be taken into account, in the case that the text has no diacritics only
the stop words are used to determine the language of the text. The experimental
results show that the proposed method has an accuracy of over 90% for small
texts and over 99.8% for
","[{'version': 'v1', 'created': 'Thu, 14 Jun 2018 11:38:24 GMT'}]",2018-06-15,"[['Truică', 'Ciprian-Octavian', ''], ['Velcin', 'Julien', ''], ['Boicea', 'Alexandru', '']]","['automatic language identification', 'stop words', 'diacritics', 'accuracy']"
8526,2209.02575,Wei Tang,"Wei Tang, Zhengzi Xu, Chengwei Liu, Jiahui Wu, Shouguo Yang, Yi Li,
  Ping Luo, Yang Liu",Towards Understanding Third-party Library Dependency in C/C++ Ecosystem,ASE 2022,,10.1145/3551349.3560432,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Third-party libraries (TPLs) are frequently reused in software to reduce
development cost and the time to market. However, external library dependencies
may introduce vulnerabilities into host applications. The issue of library
dependency has received considerable critical attention. Many package managers,
such as Maven, Pip, and NPM, are proposed to manage TPLs. Moreover, a
significant amount of effort has been put into studying dependencies in
language ecosystems like Java, Python, and JavaScript except C/C++. Due to the
lack of a unified package manager for C/C++, existing research has only few
understanding of TPL dependencies in the C/C++ ecosystem, especially at large
scale.
  Towards understanding TPL dependencies in the C/C++ecosystem, we collect
existing TPL databases, package management tools, and dependency detection
tools, summarize the dependency patterns of C/C++ projects, and construct a
comprehensive and precise C/C++ dependency detector. Using our detector, we
extract dependencies from a large-scale database containing 24K C/C++
repositories from GitHub. Based on the extracted dependencies, we provide the
results and findings of an empirical study, which aims at understanding the
characteristics of the TPL dependencies. We further discuss the implications to
manage dependency for C/C++ and the future research directions for software
engineering researchers and developers in fields of library development,
software composition analysis, and C/C++package manager.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2022 15:33:10 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Sep 2022 06:09:17 GMT'}]",2022-09-21,"[['Tang', 'Wei', ''], ['Xu', 'Zhengzi', ''], ['Liu', 'Chengwei', ''], ['Wu', 'Jiahui', ''], ['Yang', 'Shouguo', ''], ['Li', 'Yi', ''], ['Luo', 'Ping', ''], ['Liu', 'Yang', '']]","['Mining Software Repositories', 'Third-Party Library', 'Package Manager']"
8527,2211.04963,Yew Lee Tan,"Yew Lee Tan, Adams Wai-kin Kong, Jung-Jae Kim",Pure Transformer with Integrated Experts for Scene Text Recognition,Accepted in ECCV2022,,10.1007/978-3-031-19815-1_28,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scene text recognition (STR) involves the task of reading text in cropped
images of natural scenes. Conventional models in STR employ convolutional
neural network (CNN) followed by recurrent neural network in an encoder-decoder
framework. In recent times, the transformer architecture is being widely
adopted in STR as it shows strong capability in capturing long-term dependency
which appears to be prominent in scene text images. Many researchers utilized
transformer as part of a hybrid CNN-transformer encoder, often followed by a
transformer decoder. However, such methods only make use of the long-term
dependency mid-way through the encoding process. Although the vision
transformer (ViT) is able to capture such dependency at an early stage, its
utilization remains largely unexploited in STR. This work proposes the use of a
transformer-only model as a simple baseline which outperforms hybrid
CNN-transformer models. Furthermore, two key areas for improvement were
identified. Firstly, the first decoded character has the lowest prediction
accuracy. Secondly, images of different original aspect ratios react
differently to the patch resolutions while ViT only employ one fixed patch
resolution. To explore these areas, Pure Transformer with Integrated Experts
(PTIE) is proposed. PTIE is a transformer model that can process multiple patch
resolutions and decode in both the original and reverse character orders. It is
examined on 7 commonly used benchmarks and compared with over 20
state-of-the-art methods. The experimental results show that the proposed
method outperforms them and obtains state-of-the-art results in most
benchmarks.
","[{'version': 'v1', 'created': 'Wed, 9 Nov 2022 15:26:59 GMT'}]",2022-11-10,"[['Tan', 'Yew Lee', ''], ['Kong', 'Adams Wai-kin', ''], ['Kim', 'Jung-Jae', '']]","['transformer', 'scene text recognition', 'integrated experts']"
8528,2104.09079,Yifei Ding,"Yifei Ding, Minping Jia, Qiuhua Miao, Yudong Cao","A novel time-frequency Transformer based on self-attention mechanism and
  its application in fault diagnosis of rolling bearings",,"Mech. Syst. Signal Process., vol. 168, p. 108616, Apr. 2022",10.1016/j.ymssp.2021.108616,,cs.AI cs.LG eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The scope of data-driven fault diagnosis models is greatly extended through
deep learning (DL). However, the classical convolution and recurrent structure
have their defects in computational efficiency and feature representation,
while the latest Transformer architecture based on attention mechanism has not
yet been applied in this field. To solve these problems, we propose a novel
time-frequency Transformer (TFT) model inspired by the massive success of
vanilla Transformer in sequence processing. Specially, we design a fresh
tokenizer and encoder module to extract effective abstractions from the
time-frequency representation (TFR) of vibration signals. On this basis, a new
end-to-end fault diagnosis framework based on time-frequency Transformer is
presented in this paper. Through the case studies on bearing experimental
datasets, we construct the optimal Transformer structure and verify its fault
diagnosis performance. The superiority of the proposed method is demonstrated
in comparison with the benchmark models and other state-of-the-art methods.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2021 06:53:31 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Jul 2021 05:29:19 GMT'}, {'version': 'v3', 'created': 'Sat, 4 Dec 2021 05:49:05 GMT'}]",2021-12-07,"[['Ding', 'Yifei', ''], ['Jia', 'Minping', ''], ['Miao', 'Qiuhua', ''], ['Cao', 'Yudong', '']]","['Fault diagnosis', 'Deep learning', 'Transformer', 'Self–attention mechanism', 'Rolling bearings']"
8529,2203.01044,Xiao Liu,"Xiao Liu, Haoyun Hong, Xinghao Wang, Zeyi Chen, Evgeny Kharlamov,
  Yuxiao Dong, Jie Tang",SelfKG: Self-Supervised Entity Alignment in Knowledge Graphs,Proceedings of the Web Conference 2022,,10.1145/3485447.3511945,,cs.LG cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Entity alignment, aiming to identify equivalent entities across different
knowledge graphs (KGs), is a fundamental problem for constructing Web-scale
KGs. Over the course of its development, the label supervision has been
considered necessary for accurate alignments. Inspired by the recent progress
of self-supervised learning, we explore the extent to which we can get rid of
supervision for entity alignment. Commonly, the label information (positive
entity pairs) is used to supervise the process of pulling the aligned entities
in each positive pair closer. However, our theoretical analysis suggests that
the learning of entity alignment can actually benefit more from pushing
unlabeled negative pairs far away from each other than pulling labeled positive
pairs close. By leveraging this discovery, we develop the self-supervised
learning objective for entity alignment. We present SelfKG with efficient
strategies to optimize this objective for aligning entities without label
supervision. Extensive experiments on benchmark datasets demonstrate that
SelfKG without supervision can match or achieve comparable results with
state-of-the-art supervised baselines. The performance of SelfKG suggests that
self-supervised learning offers great potential for entity alignment in KGs.
The code and data are available at https://github.com/THUDM/SelfKG.
","[{'version': 'v1', 'created': 'Wed, 2 Mar 2022 11:40:37 GMT'}]",2022-03-03,"[['Liu', 'Xiao', ''], ['Hong', 'Haoyun', ''], ['Wang', 'Xinghao', ''], ['Chen', 'Zeyi', ''], ['Kharlamov', 'Evgeny', ''], ['Dong', 'Yuxiao', ''], ['Tang', 'Jie', '']]","['Knowledge Graphs', 'Self-Supervised Learning', 'Entity Alignment']"
8530,1911.00745,Jun Zhao,Jun Zhao,"Secure Connectivity of Wireless Sensor Networks Under Key
  Predistribution with on/off Channels","published in International Conference on Distributed Computing
  Systems (ICDCS) 2017",,10.1109/ICDCS.2017.186,,cs.CR math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security is an important issue in wireless sensor networks (WSNs), which are
often deployed in hostile environments. The q-composite key predistribution
scheme has been recognized as a suitable approach to secure WSNs. Although the
q-composite scheme has received much attention in the literature, there is
still a lack of rigorous analysis for secure WSNs operating under the
q-composite scheme in consideration of the unreliability of links. One main
difficulty lies in analyzing the network topology whose links are not
independent. Wireless links can be unreliable in practice due to the presence
of physical barriers between sensors or because of harsh environmental
conditions severely impairing communications. In this paper, we resolve the
difficult challenge and investigate k-connectivity in secure WSNs operating
under the q-composite scheme with unreliable communication links modeled as
independent on/off channels, where k-connectivity ensures connectivity despite
the failure of any (k - 1) sensors or links, and connectivity means that any
two sensors can find a path in between for secure communication. Specifically,
we derive the asymptotically exact probability and a zero-one law for
k-connectivity. We further use the theoretical results to provide design
guidelines for secure WSNs. Experimental results also confirm the validity of
our analytical findings.
","[{'version': 'v1', 'created': 'Sat, 2 Nov 2019 16:04:02 GMT'}]",2019-11-05,"[['Zhao', 'Jun', '']]","['Security', 'key predistribution', 'sensor networks', 'linkunreliability', 'connectivity']"
8531,2006.16191,Diego Ram\'irez-Romero,"Pedro Montealegre, Diego Ram\'irez-Romero, Ivan Rapaport",Shared vs Private Randomness in Distributed Interactive Proofs,,"31st International Symposium on Algorithms and Computation (ISAAC
  2020)",10.4230/LIPIcs.ISAAC.2020.51,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In distributed interactive proofs, the nodes of a graph G interact with a
powerful but untrustable prover who tries to convince them, in a small number
of rounds and through short messages, that G satisfies some property. This
series of interactions is followed by a phase of distributed verification,
which may be either deterministic or randomized, where nodes exchange messages
with their neighbors.
  The nature of this last verification round defines the two types of
interactive protocols. We say that the protocol is of Arthur-Merlin type if the
verification round is deterministic. We say that the protocol is of
Merlin-Arthur type if, in the verification round, the nodes are allowed to use
a fresh set of random bits.
  In the original model introduced by Kol, Oshman, and Saxena [PODC 2018], the
randomness was private in the sense that each node had only access to an
individual source of random coins. Crescenzi, Fraigniaud, and Paz [DISC 2019]
initiated the study of the impact of shared randomness (the situation where the
coin tosses are visible to all nodes) in the distributed interactive model.
  In this work, we continue that research line by showing that the impact of
the two forms of randomness is very different depending on whether we are
considering Arthur-Merlin protocols or Merlin-Arthur protocols. While private
randomness gives more power to the first type of protocols, shared randomness
provides more power to the second. Our results also connect shared randomness
in distributed interactive proofs with distributed verification, and new lower
bounds are obtained.
","[{'version': 'v1', 'created': 'Mon, 29 Jun 2020 16:58:07 GMT'}]",2020-12-22,"[['Montealegre', 'Pedro', ''], ['Ramírez-Romero', 'Diego', ''], ['Rapaport', 'Ivan', '']]","['Distributed interactive proofs', 'Distributed verification', 'Shared randomness', 'Private randomness']"
8532,2107.12226,Ivan P Yamshchikov,"Anastasia Malysheva, Alexey Tikhonov, Ivan P. Yamshchikov",DYPLODOC: Dynamic Plots for Document Classification,,"in Modern Management based on Big Data II and Machine Learning and
  Intelligent Systems III 2021 (pp. 511-519). IOS Press",10.3233/FAIA210283,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Narrative generation and analysis are still on the fringe of modern natural
language processing yet are crucial in a variety of applications. This paper
proposes a feature extraction method for plot dynamics. We present a dataset
that consists of the plot descriptions for thirteen thousand TV shows alongside
meta-information on their genres and dynamic plots extracted from them. We
validate the proposed tool for plot dynamics extraction and discuss possible
applications of this method to the tasks of narrative analysis and generation.
","[{'version': 'v1', 'created': 'Mon, 26 Jul 2021 14:12:45 GMT'}]",2022-11-15,"[['Malysheva', 'Anastasia', ''], ['Tikhonov', 'Alexey', ''], ['Yamshchikov', 'Ivan P.', '']]","['datasets', 'narrative arc', 'narrative processing']"
8533,2012.03301,Benjamin Maschler,Benjamin Maschler and Michael Weyrich,"Deep Transfer Learning for Industrial Automation: A Review and
  Discussion of New Techniques for Data-Driven Machine Learning","12 pages, 4 figures, 2 tables. Accepted for publication by IEEE
  Industrial Electronics Magazine",,10.1109/MIE.2020.3034884,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this article, the concepts of transfer and continual learning are
introduced. The ensuing review reveals promising approaches for industrial deep
transfer learning, utilizing methods of both classes of algorithms. In the
field of computer vision, it is already state-of-the-art. In others, e.g. fault
prediction, it is barely starting. However, over all fields, the abstract
differentiation between continual and transfer learning is not benefitting
their practical use. In contrast, both should be brought together to create
robust learning algorithms fulfilling the industrial automation sector's
requirements. To better describe these requirements, base use cases of
industrial transfer learning are introduced.
","[{'version': 'v1', 'created': 'Sun, 6 Dec 2020 15:58:22 GMT'}]",2021-08-31,"[['Maschler', 'Benjamin', ''], ['Weyrich', 'Michael', '']]","['Artificial Intelligence', 'Continual Learning', 'Industrial Automation', 'Machine Learning', 'Transfer Learning']"
8534,2108.11482,Petar Veli\v{c}kovi\'c,"Austin Derrow-Pinion, Jennifer She, David Wong, Oliver Lange, Todd
  Hester, Luis Perez, Marc Nunkesser, Seongjae Lee, Xueying Guo, Brett
  Wiltshire, Peter W. Battaglia, Vishal Gupta, Ang Li, Zhongwen Xu, Alvaro
  Sanchez-Gonzalez, Yujia Li, Petar Veli\v{c}kovi\'c",ETA Prediction with Graph Neural Networks in Google Maps,"To appear at CIKM 2021 (Applied Research Track). 10 pages, 4 figures",,10.1145/3459637.3481916,,cs.LG cs.AI cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Travel-time prediction constitutes a task of high importance in
transportation networks, with web mapping services like Google Maps regularly
serving vast quantities of travel time queries from users and enterprises
alike. Further, such a task requires accounting for complex spatiotemporal
interactions (modelling both the topological properties of the road network and
anticipating events -- such as rush hours -- that may occur in the future).
Hence, it is an ideal target for graph representation learning at scale. Here
we present a graph neural network estimator for estimated time of arrival (ETA)
which we have deployed in production at Google Maps. While our main
architecture consists of standard GNN building blocks, we further detail the
usage of training schedule methods such as MetaGradients in order to make our
model robust and production-ready. We also provide prescriptive studies:
ablating on various architectural decisions and training regimes, and
qualitative analyses on real-world situations where our model provides a
competitive edge. Our GNN proved powerful when deployed, significantly reducing
negative ETA outcomes in several regions compared to the previous production
baseline (40+% in cities like Sydney).
","[{'version': 'v1', 'created': 'Wed, 25 Aug 2021 21:28:54 GMT'}]",2021-08-27,"[['Derrow-Pinion', 'Austin', ''], ['She', 'Jennifer', ''], ['Wong', 'David', ''], ['Lange', 'Oliver', ''], ['Hester', 'Todd', ''], ['Perez', 'Luis', ''], ['Nunkesser', 'Marc', ''], ['Lee', 'Seongjae', ''], ['Guo', 'Xueying', ''], ['Wiltshire', 'Brett', ''], ['Battaglia', 'Peter W.', ''], ['Gupta', 'Vishal', ''], ['Li', 'Ang', ''], ['Xu', 'Zhongwen', ''], ['Sanchez-Gonzalez', 'Alvaro', ''], ['Li', 'Yujia', ''], ['Veličković', 'Petar', '']]","['Graph neural networks', 'MetaGradients', 'Google Maps']"
8535,1810.00818,Max Schwarz,"Max Schwarz, Anton Milan, Arul Selvam Periyasamy, Sven Behnke","RGB-D Object Detection and Semantic Segmentation for Autonomous
  Manipulation in Clutter",,International Journal of Robotics Research 37(4-5): 437-451 (2018),10.1177/0278364917713117,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autonomous robotic manipulation in clutter is challenging. A large variety of
objects must be perceived in complex scenes, where they are partially occluded
and embedded among many distractors, often in restricted spaces. To tackle
these challenges, we developed a deep-learning approach that combines object
detection and semantic segmentation. The manipulation scenes are captured with
RGB-D cameras, for which we developed a depth fusion method. Employing
pretrained features makes learning from small annotated robotic data sets
possible. We evaluate our approach on two challenging data sets: one captured
for the Amazon Picking Challenge 2016, where our team NimbRo came in second in
the Stowing and third in the Picking task, and one captured in
disaster-response scenarios. The experiments show that object detection and
semantic segmentation complement each other and can be combined to yield
reliable object perception.
","[{'version': 'v1', 'created': 'Mon, 1 Oct 2018 16:55:53 GMT'}]",2018-10-03,"[['Schwarz', 'Max', ''], ['Milan', 'Anton', ''], ['Periyasamy', 'Arul Selvam', ''], ['Behnke', 'Sven', '']]","['Deep learning', 'object perception', 'RGB-D camera', 'transfer learning', 'object detection', 'semantic segmentation']"
8536,2204.09271,Shunli Wang,"Shunli Wang, Dingkang Yang, Peng Zhai, Qing Yu, Tao Suo, Zhan Sun, Ka
  Li, Lihua Zhang",A Survey of Video-based Action Quality Assessment,"9 pages, 6 figures, conference paper",,10.1109/INSAI54028.2021.00029,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human action recognition and analysis have great demand and important
application significance in video surveillance, video retrieval, and
human-computer interaction. The task of human action quality evaluation
requires the intelligent system to automatically and objectively evaluate the
action completed by the human. The action quality assessment model can reduce
the human and material resources spent in action evaluation and reduce
subjectivity. In this paper, we provide a comprehensive survey of existing
papers on video-based action quality assessment. Different from human action
recognition, the application scenario of action quality assessment is
relatively narrow. Most of the existing work focuses on sports and medical
care. We first introduce the definition and challenges of human action quality
assessment. Then we present the existing datasets and evaluation metrics. In
addition, we summarized the methods of sports and medical care according to the
model categories and publishing institutions according to the characteristics
of the two fields. At the end, combined with recent work, the promising
development direction in action quality assessment is discussed.
","[{'version': 'v1', 'created': 'Wed, 20 Apr 2022 07:29:00 GMT'}]",2022-04-21,"[['Wang', 'Shunli', ''], ['Yang', 'Dingkang', ''], ['Zhai', 'Peng', ''], ['Yu', 'Qing', ''], ['Suo', 'Tao', ''], ['Sun', 'Zhan', ''], ['Li', 'Ka', ''], ['Zhang', 'Lihua', '']]","['action quality assessment', 'human behavior analysis', 'deep learning', 'computer vision']"
8537,2011.02135,Hazhar Rahmani,"Hazhar Rahmani, Dylan A. Shell, and Jason M. O'Kane",Planning to Chronicle,Algorithmic Foundations of Robotics (WAFR-XIV),,10.1007/978-3-030-66723-8_17,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An important class of applications entails a robot monitoring, scrutinizing,
or recording the evolution of an uncertain time-extended process. This sort of
situation leads an interesting family of planning problems in which the robot
is limited in what it sees and must, thus, choose what to pay attention to. The
distinguishing characteristic of this setting is that the robot has influence
over what it captures via its sensors, but exercises no causal authority over
the evolving process. As such, the robot's objective is to observe the
underlying process and to produce a `chronicle' of occurrent events, subject to
a goal specification of the sorts of event sequences that may be of interest.
This paper examines variants of such problems when the robot aims to collect
sets of observations to meet a rich specification of their sequential
structure. We study this class of problems by modeling a stochastic process via
a variant of a hidden Markov model, and specify the event sequences of interest
as a regular language, developing a vocabulary of `mutators' that enable
sophisticated requirements to be expressed. Under different suppositions about
the information gleaned about the Markov model, we formulate and solve
different planning problems. The core underlying idea is the construction of a
product between the event model and a specification automaton. The paper
reports and compares performance metrics by drawing on some small case studies
analyzed in depth in simulation.
","[{'version': 'v1', 'created': 'Wed, 4 Nov 2020 05:34:53 GMT'}]",2021-03-16,"[['Rahmani', 'Hazhar', ''], ['Shell', 'Dylan A.', ''], [""O'Kane"", 'Jason M.', '']]","['Planning', 'Story-telling', 'Reconnoitering', 'Raconteuring']"
8538,2007.08237,Christoph Matthies,"Frederike Ramin, Christoph Matthies, Ralf Teusner",More than Code: Contributions in Scrum Software Engineering Teams,"Published in IEEE/ACM 42nd International Conference on Software
  Engineering Workshops, ACM Press, 2020",,10.1145/3387940.3392241,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated and competent team members are a vital part of Agile Software
development and make or break any project's success. Motivation is fostered by
continuous progress and recognition of efforts. These concepts are founding
pillars of the Scrum methodology, which focuses on self-organizing teams. The
types of contributions Scrum development team members make to a project's
progress are not only technical. However, a comprehensive model comprising the
varied contributions in modern software engineering teams is not yet
established. We propose a model that incorporates contributions of all Scrum
roles, explicitly including those which are not directly related to project
artifacts. It improves the visibility of performed tasks, acts as a starting
point for team retrospection, and serves as a foundation for discussion in the
research community.
","[{'version': 'v1', 'created': 'Thu, 16 Jul 2020 10:18:35 GMT'}]",2020-07-17,"[['Ramin', 'Frederike', ''], ['Matthies', 'Christoph', ''], ['Teusner', 'Ralf', '']]","['Scrum', 'Agile Software Development', 'Teamwork', 'Contribution']"
8539,2105.02212,Silvia Leoni,"Luca De Benedictis, Silvia Leoni",Inclusive Universities. Evidence from the Erasmus Program,"23 pages, 5 figures",,10.1007/s41109-021-00419-x,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  The Erasmus Program is the main international mobility program in Europe and
worldwide. Since its launch in 1987, it has been growing both in terms of
participants and budget devoted to its activities. However, despite the
possibility to obtain additional funding, the participation of students with
special needs to the program remains extremely low. This work quantifies the
participation of these students to Erasmus and explores the network of
universities involved in their mobility, along the period 2008-2013. In
addition, it proposes a novel index to measure the level of inclusiveness of
universities welcoming international students with disabilities. Quantifying
and analyzing this aspect could be the basis for better designing targeted
policies and for widening the participation of students with impairments to
international mobility.
","[{'version': 'v1', 'created': 'Wed, 5 May 2021 17:38:43 GMT'}, {'version': 'v2', 'created': 'Thu, 13 May 2021 10:04:57 GMT'}]",2023-01-24,"[['De Benedictis', 'Luca', ''], ['Leoni', 'Silvia', '']]","['Erasmus', 'Disability', 'Special needs', 'Gender bias', 'Inclusiveness', 'Social Network Analysis']"
8540,2201.12271,Maximilian Boeker,"Maximilian Boeker, Aleksandra Urman",An Empirical Investigation of Personalization Factors on TikTok,Accepted for publication at the Web Conference 2022,,10.1145/3485447.3512102,,cs.HC cs.CY cs.SI,http://creativecommons.org/licenses/by/4.0/,"  TikTok currently is the fastest growing social media platform with over 1
billion active monthly users of which the majority is from generation Z.
Arguably, its most important success driver is its recommendation system.
Despite the importance of TikTok's algorithm to the platform's success and
content distribution, little work has been done on the empirical analysis of
the algorithm. Our work lays the foundation to fill this research gap. Using a
sock-puppet audit methodology with a custom algorithm developed by us, we
tested and analysed the effect of the language and location used to access
TikTok, follow- and like-feature, as well as how the recommended content
changes as a user watches certain posts longer than others. We provide evidence
that all the tested factors influence the content recommended to TikTok users.
Further, we identified that the follow-feature has the strongest influence,
followed by the like-feature and video view rate. We also discuss the
implications of our findings in the context of the formation of filter bubbles
on TikTok and the proliferation of problematic content.
","[{'version': 'v1', 'created': 'Fri, 28 Jan 2022 17:40:00 GMT'}]",2022-01-31,"[['Boeker', 'Maximilian', ''], ['Urman', 'Aleksandra', '']]","['TikTok', 'algorithm audit', 'recommender systems', 'personalization', 'social media']"
8541,2103.09002,Gabriele Lagani,"Gabriele Lagani, Fabrizio Falchi, Claudio Gennaro, Giuseppe Amato",Hebbian Semi-Supervised Learning in a Sample Efficiency Setting,"18 pages, 9 figures, 3 tables, accepted by Elsevier Neural Networks","Neural Networks, Volume 143, November 2021, Pages 719-731,
  Elsevier",10.1016/j.neunet.2021.08.003,,cs.NE cs.CV cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We propose to address the issue of sample efficiency, in Deep Convolutional
Neural Networks (DCNN), with a semi-supervised training strategy that combines
Hebbian learning with gradient descent: all internal layers (both convolutional
and fully connected) are pre-trained using an unsupervised approach based on
Hebbian learning, and the last fully connected layer (the classification layer)
is trained using Stochastic Gradient Descent (SGD). In fact, as Hebbian
learning is an unsupervised learning method, its potential lies in the
possibility of training the internal layers of a DCNN without labels. Only the
final fully connected layer has to be trained with labeled examples.
  We performed experiments on various object recognition datasets, in different
regimes of sample efficiency, comparing our semi-supervised (Hebbian for
internal layers + SGD for the final fully connected layer) approach with
end-to-end supervised backprop training, and with semi-supervised learning
based on Variational Auto-Encoder (VAE). The results show that, in regimes
where the number of available labeled samples is low, our semi-supervised
approach outperforms the other approaches in almost all the cases.
","[{'version': 'v1', 'created': 'Tue, 16 Mar 2021 11:57:52 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Sep 2021 08:29:06 GMT'}]",2021-09-21,"[['Lagani', 'Gabriele', ''], ['Falchi', 'Fabrizio', ''], ['Gennaro', 'Claudio', ''], ['Amato', 'Giuseppe', '']]","['Convolutional Neural Networks', 'Computer Vision', 'Semi-Supervised Learning', 'Hebbian Learning', 'Sample Efficiency']"
8542,2210.15901,Zheng Liu,"Zheng Liu, Xiaohan Li and Philip Yu",Mitigating Health Disparities in EHR via Deconfounder,,,10.1145/3535508.3545516,,cs.LG cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Health disparities, or inequalities between different patient demographics,
are becoming crucial in medical decision-making, especially in Electronic
Health Record (EHR) predictive modeling. To ensure the fairness of sensitive
attributes, conventional studies mainly adopt calibration or re-weighting
methods to balance the performance on among different demographic groups.
However, we argue that these methods have some limitations. First, these
methods usually mean a trade-off between the model's performance and fairness.
Second, many methods completely attribute unfairness to the data collection
process, which lacks substantial evidence. In this paper, we provide an
empirical study to discover the possibility of using deconfounder to address
the disparity issue in healthcare. Our study can be summarized in two parts.
The first part is a pilot study demonstrating the exacerbation of disparity
when unobserved confounders exist. The second part proposed a novel framework,
Parity Medical Deconfounder (PriMeD), to deal with the disparity issue in
healthcare datasets. Inspired by the deconfounder theory, PriMeD adopts a
Conditional Variational Autoencoder (CVAE) to learn latent factors (substitute
confounders) for observational data, and extensive experiments are provided to
show its effectiveness.
","[{'version': 'v1', 'created': 'Fri, 28 Oct 2022 05:16:50 GMT'}]",2022-10-31,"[['Liu', 'Zheng', ''], ['Li', 'Xiaohan', ''], ['Yu', 'Philip', '']]","['health disparity', 'fairness', 'deconfounder', 'deep generative model']"
8543,2202.13864,Marcos Faundez-Zanuy,"Virginia Espinosa-Dur\'o, Marcos Faundez-Zanuy, Ji\v{r}\'i Mekyska","A new face database simultaneously acquired in visible, near infrared
  and thermal spectrum",19 pages,"Cognitive Computation, vol. 5, no. 1, pp. 119-135, 2013",10.1007/s12559-012-9163-2,,cs.CV cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this paper we present a new database acquired with three different sensors
(visible, near infrared and thermal) under different illumination conditions.
This database consists of 41 people acquired in four different acquisition
sessions, five images per session and three different illumination conditions.
The total amount of pictures is 7.380 pictures. Experimental results are
obtained through single sensor experiments as well as the combination of two
and three sensors under different illumination conditions (natural, infrared
and artificial illumination). We have found that the three spectral bands
studied contribute in a nearly equal proportion to a combined system.
Experimental results show a significant improvement combining the three
spectrums, even when using a simple classifier and feature extractor. In six of
the nine scenarios studied we obtained identification rates higher or equal to
98%, when using a trained combination rule, and two cases of nine when using a
fixed rule.
","[{'version': 'v1', 'created': 'Thu, 24 Feb 2022 09:29:33 GMT'}]",2022-03-01,"[['Espinosa-Duró', 'Virginia', ''], ['Faundez-Zanuy', 'Marcos', ''], ['Mekyska', 'Jiří', '']]","['thermal image', 'visible image', 'near infrared image', 'face recognition data fusion']"
8544,1910.13425,Pratik Kayal,"Pratik Kayal, Mayank Singh, Pawan Goyal","Weakly-Supervised Deep Learning for Domain Invariant Sentiment
  Classification","5 Pages, 3 tables",,10.1145/3371158.3371194,,cs.LG cs.CL cs.IR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The task of learning a sentiment classification model that adapts well to any
target domain, different from the source domain, is a challenging problem.
Majority of the existing approaches focus on learning a common representation
by leveraging both source and target data during training. In this paper, we
introduce a two-stage training procedure that leverages weakly supervised
datasets for developing simple lift-and-shift-based predictive models without
being exposed to the target domain during the training phase. Experimental
results show that transfer with weak supervision from a source domain to
various target domains provides performance very close to that obtained via
supervised training on the target domain itself.
","[{'version': 'v1', 'created': 'Tue, 29 Oct 2019 17:43:37 GMT'}, {'version': 'v2', 'created': 'Sat, 23 Nov 2019 06:59:48 GMT'}]",2019-12-05,"[['Kayal', 'Pratik', ''], ['Singh', 'Mayank', ''], ['Goyal', 'Pawan', '']]","['Sentiment Analysis', 'Domain Transfer', 'Weakly labeled datasets']"
8545,2203.14801,Soeren Becker,"Daniel Habenicht, Kevin Kreutz, Soeren Becker, Jonathan Bader, Lauritz
  Thamsen, Odej Kao","SyncMesh: Improving Data Locality for Function-as-a-Service in Meshed
  Edge Networks",,,10.1145/3517206.3526275,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing use of Internet of Things devices coincides with more
communication and data movement in networks, which can exceed existing network
capabilities. These devices often process sensor or user information, where
data privacy and latency are a major concern. Therefore, traditional approaches
like cloud computing do not fit well, yet new architectures such as edge
computing address this gap. In addition, the Function-as-a-Service (FaaS)
paradigm gains in prevalence as a workload execution platform, however the
decoupling of storage results in further challenges for highly distributed edge
environments.
  To address this, we propose SyncMesh, a system to manage, query, and
transform data in a scalable and stateless manner by leveraging the
capabilities of Function-as-a-Service and at the same time enabling data
locality. Furthermore, we provide a prototypical implementation and evaluate it
against established centralized and decentralized systems in regard to traffic
usage and request times.
  The preliminary results indicate that SyncMesh is able to exonerate the
network layer and accelerate the transmission of data to clients, while
simultaneously improving local data processing.
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2022 14:42:52 GMT'}]",2022-03-29,"[['Habenicht', 'Daniel', ''], ['Kreutz', 'Kevin', ''], ['Becker', 'Soeren', ''], ['Bader', 'Jonathan', ''], ['Thamsen', 'Lauritz', ''], ['Kao', 'Odej', '']]","['mesh network', 'edge computing', 'fog computing', 'data locality', 'datamanagement', 'function-as-a-service']"
8546,2112.11856,Arne Wendt,"Arne Wendt, Michael Brand and Thorsten Sch\""uppstuhl","Semantically enriched spatial modelling of industrial indoor
  environments enabling location-based services",3. Kongresses Montage Handhabung Industrieroboter MHI,"Sch\""uppstuhl T., Tracht K., Franke J. (eds) Tagungsband des 3.
  Kongresses Montage Handhabung Industrieroboter. Springer Vieweg, Berlin,
  Heidelberg. 2018",10.1007/978-3-662-56714-2_13,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a concept for a software system called RAIL representing
industrial indoor environments in a dynamic spatial model, aimed at easing
development and provision of location-based services. RAIL integrates data from
different sensor modalities and additional contextual information through a
unified interface. Approaches to environmental modelling from other domains are
reviewed and analyzed for their suitability regarding the requirements for our
target domains; intralogistics and production. Subsequently a novel way of
modelling data representing indoor space, and an architecture for the software
system are proposed.
","[{'version': 'v1', 'created': 'Wed, 22 Dec 2021 13:06:56 GMT'}]",2021-12-23,"[['Wendt', 'Arne', ''], ['Brand', 'Michael', ''], ['Schüppstuhl', 'Thorsten', '']]","['Location-based services', 'indoor environmental modelling', 'semantic spatial modelling', 'intralogistics', 'production']"
8547,2204.02646,Youhei Akimoto,"Atsuhiro Miyagi, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto","Black-Box Min--Max Continuous Optimization Using CMA-ES with Worst-case
  Ranking Approximation",accepted for GECCO 2022,,10.1145/3512290.3528702,,cs.NE math.OC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this study, we investigate the problem of min-max continuous optimization
in a black-box setting $\min_{x} \max_{y}f(x,y)$. A popular approach updates
$x$ and $y$ simultaneously or alternatingly. However, two major limitations
have been reported in existing approaches. (I) As the influence of the
interaction term between $x$ and $y$ (e.g., $x^\mathrm{T} B y$) on the
Lipschitz smooth and strongly convex-concave function $f$ increases, the
approaches converge to an optimal solution at a slower rate. (II) The
approaches fail to converge if $f$ is not Lipschitz smooth and strongly
convex-concave around the optimal solution. To address these difficulties, we
propose minimizing the worst-case objective function $F(x)=\max_{y}f(x,y)$
directly using the covariance matrix adaptation evolution strategy, in which
the rankings of solution candidates are approximated by our proposed worst-case
ranking approximation (WRA) mechanism. Compared with existing approaches,
numerical experiments show two important findings regarding our proposed
method. (1) The proposed approach is efficient in terms of $f$-calls on a
Lipschitz smooth and strongly convex-concave function with a large interaction
term. (2) The proposed approach can converge on functions that are not
Lipschitz smooth and strongly convex-concave around the optimal solution,
whereas existing approaches fail.
","[{'version': 'v1', 'created': 'Wed, 6 Apr 2022 08:03:39 GMT'}]",2022-04-07,"[['Miyagi', 'Atsuhiro', ''], ['Fukuchi', 'Kazuto', ''], ['Sakuma', 'Jun', ''], ['Akimoto', 'Youhei', '']]","['Black-Box Min–Max Continuous Optimization', 'Worst-case RankingApproximation', 'Covariance Matrix Adaptation Evolution Strategy']"
8548,2109.04631,EPTCS,"Bishoksan Kafle (IMDEA Software Institute, Spain), John P. Gallagher
  (Roskilde University, Denmark and IMDEA Software Institute, Spain), Manuel V.
  Hermenegildo (IMDEA Software Institute, Spain and U. Politecnica de Madrid,
  Spain), Maximiliano Klemen (IMDEA Software Institute, Spain and U.
  Politecnica de Madrid, Spain), Pedro L\'opez-Garc\'ia (IMDEA Software
  Institute, Spain and Spanish Council for Sci. Research (CSIC)), Jos\'e F.
  Morales (IMDEA Software Institute, Spain and U. Politecnica de Madrid, Spain)",Regular Path Clauses and Their Application in Solving Loops,"In Proceedings HCVS 2021, arXiv:2109.03988","EPTCS 344, 2021, pp. 22-35",10.4204/EPTCS.344.3,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  A well-established approach to reasoning about loops during program analysis
is to capture the effect of a loop by extracting recurrences from the loop;
these express relationships between the values of variables, or program
properties such as cost, on successive loop iterations. Recurrence solvers are
capable of computing closed forms for some recurrences, thus deriving precise
relationships capturing the complete loop execution. However, many recurrences
extracted from loops cannot be solved, due to their having multiple recursive
cases or multiple arguments. In the literature, several techniques for
approximating the solution of unsolvable recurrences have been proposed. The
approach presented in this paper is to define transformations based on regular
path expressions and loop counters that (i) transform multi-path loops to
single-path loops, giving rise to recurrences with a single recursive case, and
(ii) transform multi-argument recurrences to single-argument recurrences, thus
enabling the use of recurrence solvers on the transformed recurrences. Using
this approach, precise solutions can sometimes be obtained that are not
obtained by approximation methods.
","[{'version': 'v1', 'created': 'Fri, 10 Sep 2021 02:42:10 GMT'}]",2021-09-13,"[['Kafle', 'Bishoksan', '', 'IMDEA Software Institute, Spain'], ['Gallagher', 'John P.', '', 'Roskilde University, Denmark and IMDEA Software Institute, Spain'], ['Hermenegildo', 'Manuel V.', '', 'IMDEA Software Institute, Spain and U. Politecnica de Madrid,\n  Spain'], ['Klemen', 'Maximiliano', '', 'IMDEA Software Institute, Spain and U.\n  Politecnica de Madrid, Spain'], ['López-García', 'Pedro', '', 'IMDEA Software\n  Institute, Spain and Spanish Council for Sci. Research'], ['Morales', 'José F.', '', 'IMDEA Software Institute, Spain and U. Politecnica de Madrid, Spain']]","['Horn clauses', 'path programs', 'multi-path recurrences', 'multi-argument recurrences']"
8549,2212.01650,Arij Al Adel,Arij Al Adel,Global memory transformer for processing long documents,"10 pages, 4 figures, 5 tables. Published in neuroinformatics 2022",,10.1007/978-3-031-19032-2_36,,cs.CL cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Transformer variants dominate the state-of-the-art in different natural
language processing tasks such as translation, reading comprehension and
summarization. Our paper is more directed to use general memory slots added to
the inputs and studying the results of adding these slots. This paper is a go
on study of general memory slots rule that were added to the input of the
proposed model in previous work. We have two main tasks;1) pretraining task
using masked language modeling and b) fine tuning task using HotpotQA . This
study aims to verify the ability of the proposed model to handle chunks as if
they were one chunk comparing with the base model. As baseline we used T5
transformer. We studied the rule of memory slots augmented to each input chunk
and studied the model performance without selector. We found that adding memory
to input chunks helped the proposed model to overcome the baseline on Masked
language modeling task with specific training parameters. Ablation study
reveals the ability of using the compressed input chunks with a degradation in
performance.
","[{'version': 'v1', 'created': 'Sat, 3 Dec 2022 16:40:16 GMT'}]",2022-12-06,"[['Adel', 'Arij Al', '']]","['memory', 'transformer', 'attention', 'long documents']"
8550,1601.02075,Hyungbo Shim,"Hyungbo Shim, Gyunghoon Park, Youngjun Joo, Juhoon Back, and Nam Hoon
  Jo","Yet Another Tutorial of Disturbance Observer: Robust Stabilization and
  Recovery of Nominal Performance",,"Control Theory and Technology, vol. 14, issue 3, pp. 237-249, Aug
  2016",10.1007/s11768-016-6006-9,,cs.SY math.OC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper presents a tutorial-style review on the recent results about the
disturbance observer (DOB) in view of robust stabilization and recovery of the
nominal performance. The analysis is based on the case when the bandwidth of
Q-filter is large, and it is explained in a pedagogical manner that, even in
the presence of plant uncertainties and disturbances, the behavior of real
uncertain plant can be made almost similar to that of disturbance-free nominal
system both in the transient and in the steady-state. The conventional DOB is
interpreted in a new perspective, and its restrictions and extensions are
discussed.
","[{'version': 'v1', 'created': 'Sat, 9 Jan 2016 04:40:19 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Jun 2016 01:46:06 GMT'}]",2018-12-05,"[['Shim', 'Hyungbo', ''], ['Park', 'Gyunghoon', ''], ['Joo', 'Youngjun', ''], ['Back', 'Juhoon', ''], ['Jo', 'Nam Hoon', '']]","['Disturbance observer', 'robust stabilization', 'robust transient response', 'disturbance rejection']"
8551,2111.14579,Klaus-Tycho Foerster,Apoorv Shukla and Klaus-Tycho Foerster,Shortcutting Fast Failover Routes in the Data Plane,"To appear at the ACM/IEEE Symposium on Architectures for Networking
  and Communications Systems 2021 (ANCS'21)",,10.1145/3493425.3502751,,cs.NI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In networks, availability is of paramount importance. As link failures are
disruptive, modern networks in turn provide Fast ReRoute (FRR) mechanisms to
rapidly restore connectivity. However, existing FRR approaches heavily impact
performance until the slower convergence protocols kick in. The fast failover
routes commonly involve unnecessary loops and detours, disturbing other traffic
while causing costly packet loss.
  In this paper, we make a case for augmenting FRR mechanisms to avoid such
inefficiencies. We introduce ShortCut that routes the packets in a loop free
fashion, avoiding costly detours and decreasing link load. ShortCut achieves
this by leveraging data plane programmability: when a loop is locally observed,
it can be removed by short-cutting the respective route parts. As such,
ShortCut is topology-independent and agnostic to the type of FRR currently
deployed. Our first experimental simulations show that ShortCut can outperform
control plane convergence mechanisms; moreover avoiding loops and keeping
packet loss minimal opposed to existing FRR mechanisms.
","[{'version': 'v1', 'created': 'Mon, 29 Nov 2021 15:09:39 GMT'}]",2021-11-30,"[['Shukla', 'Apoorv', ''], ['Foerster', 'Klaus-Tycho', '']]","['Fast Failover Routing', 'Reliability', 'P4', 'Data Plane Algorithms']"
8552,2002.01894,Yichao Zhu,"Dingchuan Xue, Yichao Zhu, Xu Guo","Generation of smoothly-varying infill configurations from a continuous
  menu of cell patterns and the asymptotic analysis of its mechanical behaviour",,,10.1016/j.cma.2020.113037,,cs.CE physics.app-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We here introduce a novel scheme for generating smoothly-varying infill
graded microstructural (IGM) configurations from a given menu of generating
cells. The scheme was originally proposed for essentially improving the variety
of describable configurations in a modified asymptotic homogenisation-based
topology optimisation framework [1] for fast IGM design. But the proposed
scheme, after modification, also demonstrates its unique values in two aspects
of applications. First, it provides a fairly simple way of generating an IGM
configuration continuously patching any given cell configurations. Second, it
tenders a straightforward mean for decorating microstructures on a given
manifold. We will further show that the form of topology description function
given here effectively offers a platform for unifying most existing approaches
for IGM generation. Fuelled by asymptotic analysis of the mechanical behaviour
of the resulting IGM configurations, a topology optimisation scheme for
compliance minimisation is introduced. We will finally show that, the use of
the present scheme helps reduce the compliance value of an optimised structure
by nearly a half, if compared with that from the original framework [1].
","[{'version': 'v1', 'created': 'Tue, 4 Feb 2020 03:07:00 GMT'}, {'version': 'v2', 'created': 'Sat, 8 Feb 2020 01:40:57 GMT'}]",2020-05-20,"[['Xue', 'Dingchuan', ''], ['Zhu', 'Yichao', ''], ['Guo', 'Xu', '']]","['Infill lattice structures', 'Graded microstructures', 'Topology optimisation', 'Asymptotic analysis', 'Topology description function']"
8553,2103.10018,Hailong Ning,"Hailong Ning, Xiangtao Zheng, Yuan Yuan, Xiaoqiang Lu",Audio Description from Image by Modal Translation Network,,,10.1016/j.neucom.2020.10.053,,cs.SD cs.MM eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Audio is the main form for the visually impaired to obtain information. In
reality, all kinds of visual data always exist, but audio data does not exist
in many cases. In order to help the visually impaired people to better perceive
the information around them, an image-to-audio-description (I2AD) task is
proposed to generate audio descriptions from images in this paper. To complete
this totally new task, a modal translation network (MT-Net) from visual to
auditory sense is proposed. The proposed MT-Net includes three progressive
sub-networks: 1) feature learning, 2) cross-modal mapping, and 3) audio
generation. First, the feature learning sub-network aims to learn semantic
features from image and audio, including image feature learning and audio
feature learning. Second, the cross-modal mapping sub-network transforms the
image feature into a cross-modal representation with the same semantic concept
as the audio feature. In this way, the correlation of inter-modal data is
effectively mined for easing the heterogeneous gap between image and audio.
Finally, the audio generation sub-network is designed to generate the audio
waveform from the cross-modal representation. The generated audio waveform is
interpolated to obtain the corresponding audio file according to the sample
frequency. Being the first attempt to explore the I2AD task, three large-scale
datasets with plenty of manual audio descriptions are built. Experiments on the
datasets verify the feasibility of generating intelligible audio from an image
directly and the effectiveness of proposed method.
","[{'version': 'v1', 'created': 'Thu, 18 Mar 2021 04:48:29 GMT'}]",2021-03-19,"[['Ning', 'Hailong', ''], ['Zheng', 'Xiangtao', ''], ['Yuan', 'Yuan', ''], ['Lu', 'Xiaoqiang', '']]","['Image-to-Audio-Description', 'Modal Translation', 'Heterogeneous Gap']"
8554,2204.04635,Max Coenen,"Max Coenen and Tobias Schack and Dries Beyer and Christian Heipke and
  Michael Haist","ConsInstancy: Learning Instance Representations for Semi-Supervised
  Panoptic Segmentation of Concrete Aggregate Particles",,,10.1007/s00138-022-01313-x,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a semi-supervised method for panoptic segmentation based on
ConsInstancy regularisation, a novel strategy for semi-supervised learning. It
leverages completely unlabelled data by enforcing consistency between predicted
instance representations and semantic segmentations during training in order to
improve the segmentation performance. To this end, we also propose new types of
instance representations that can be predicted by one simple forward path
through a fully convolutional network (FCN), delivering a convenient and
simple-to-train framework for panoptic segmentation. More specifically, we
propose the prediction of a three-dimensional instance orientation map as
intermediate representation and two complementary distance transform maps as
final representation, providing unique instance representations for a panoptic
segmentation. We test our method on two challenging data sets of both, hardened
and fresh concrete, the latter being proposed by the authors in this paper
demonstrating the effectiveness of our approach, outperforming the results
achieved by state-of-the-art methods for semi-supervised segmentation. In
particular, we are able to show that by leveraging completely unlabeled data in
our semi-supervised approach the achieved overall accuracy (OA) is increased by
up to 5% compared to an entirely supervised training using only labeled data.
Furthermore, we exceed the OA achieved by state-of-the-art semi-supervised
methods by up to 1.5%.
","[{'version': 'v1', 'created': 'Sun, 10 Apr 2022 09:08:08 GMT'}]",2022-07-06,"[['Coenen', 'Max', ''], ['Schack', 'Tobias', ''], ['Beyer', 'Dries', ''], ['Heipke', 'Christian', ''], ['Haist', 'Michael', '']]","['ConsInstancy training', 'semi supervision', 'panoptic segmentation', 'instance representations', 'concrete aggregate']"
8555,1812.08915,Yuan Mao,"Yixiong Liang, Yuan Mao, Zhihong Tang, Meng Yan, Yuqian Zhao, Jianfeng
  Liu",Efficient Misalignment-Robust Multi-Focus Microscopical Images Fusion,"14 pages,11 figures",,10.1016/j.sigpro.2019.03.020,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a very efficient method to fuse the unregistered
multi-focus microscopical images based on the speed-up robust features (SURF).
Our method follows the pipeline of first registration and then fusion. However,
instead of treating the registration and fusion as two completely independent
stage, we propose to reuse the determinant of the approximate Hessian generated
in SURF detection stage as the corresponding salient response for the final
image fusion, thus it enables nearly cost-free saliency map generation. In
addition, due to the adoption of SURF scale space representation, our method
can generate scale-invariant saliency map which is desired for scale-invariant
image fusion. We present an extensive evaluation on the dataset consisting of
several groups of unregistered multi-focus 4K ultra HD microscopic images with
size of 4112 x 3008. Compared with the state-of-the-art multi-focus image
fusion methods, our method is much faster and achieve better results in the
visual performance. Our method provides a flexible and efficient way to
integrate complementary and redundant information from multiple multi-focus
ultra HD unregistered images into a fused image that contains better
description than any of the individual input images. Code is available at
https://github.com/yiqingmy/JointRF.
","[{'version': 'v1', 'created': 'Fri, 21 Dec 2018 02:17:35 GMT'}]",2020-01-20,"[['Liang', 'Yixiong', ''], ['Mao', 'Yuan', ''], ['Tang', 'Zhihong', ''], ['Yan', 'Meng', ''], ['Zhao', 'Yuqian', ''], ['Liu', 'Jianfeng', '']]","['Multi-focus image fusion', 'Image registration', 'Scale space analysis', 'Scale-invariant saliency map']"
8556,2104.12325,Mohammad Amin Nabian,"Mohammad Amin Nabian, Rini Jasmine Gladstone, Hadi Meidani","Efficient training of physics-informed neural networks via importance
  sampling",Computer-Aided Civil and Infrastructure Engineering (2021),,10.1111/mice.12685,,cs.LG cs.NA math.AP math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Physics-Informed Neural Networks (PINNs) are a class of deep neural networks
that are trained, using automatic differentiation, to compute the response of
systems governed by partial differential equations (PDEs). The training of
PINNs is simulation-free, and does not require any training dataset to be
obtained from numerical PDE solvers. Instead, it only requires the physical
problem description, including the governing laws of physics, domain geometry,
initial/boundary conditions, and the material properties. This training usually
involves solving a non-convex optimization problem using variants of the
stochastic gradient descent method, with the gradient of the loss function
approximated on a batch of collocation points, selected randomly in each
iteration according to a uniform distribution. Despite the success of PINNs in
accurately solving a wide variety of PDEs, the method still requires
improvements in terms of computational efficiency. To this end, in this paper,
we study the performance of an importance sampling approach for efficient
training of PINNs. Using numerical examples together with theoretical
evidences, we show that in each training iteration, sampling the collocation
points according to a distribution proportional to the loss function will
improve the convergence behavior of the PINNs training. Additionally, we show
that providing a piecewise constant approximation to the loss function for
faster importance sampling can further improve the training efficiency. This
importance sampling approach is straightforward and easy to implement in the
existing PINN codes, and also does not introduce any new hyperparameter to
calibrate. The numerical examples include elasticity, diffusion and plane
stress problems, through which we numerically verify the accuracy and
efficiency of the importance sampling approach compared to the predominant
uniform sampling approach.
","[{'version': 'v1', 'created': 'Mon, 26 Apr 2021 02:45:10 GMT'}]",2021-04-27,"[['Nabian', 'Mohammad Amin', ''], ['Gladstone', 'Rini Jasmine', ''], ['Meidani', 'Hadi', '']]","['Physics-informed neural networks', 'deep neural networks', 'importance sampling', 'differential equations', 'nearest neighbor interpolation']"
8557,2201.01446,Zhuoqiang Guo,"Zhuoqiang Guo, Denghui Lu, Yujin Yan, Siyu Hu, Rongrong Liu, Guangming
  Tan, Ninghui Sun, Wanrun Jiang, Lijun Liu, Yixiao Chen, Linfeng Zhang, Mohan
  Chen, Han Wang, Weile Jia","Extending the limit of molecular dynamics with ab initio accuracy to 10
  billion atoms","13 pages, 11 figures, conference : Principles and Practice of
  Parallel Programming 2022",,10.1145/3503221.3508425,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  High-performance computing, together with a neural network model trained from
data generated with first-principles methods, has greatly boosted applications
of \textit{ab initio} molecular dynamics in terms of spatial and temporal
scales on modern supercomputers. Previous state-of-the-art can achieve $1-2$
nanoseconds molecular dynamics simulation per day for 100-million atoms on the
entire Summit supercomputer. In this paper, we have significantly reduced the
memory footprint and computational time by a comprehensive approach with both
algorithmic and system innovations. The neural network model is compressed by
model tabulation, kernel fusion, and redundancy removal. Then optimizations
such as acceleration of customized kernel, tabulation of activation function,
MPI+OpenMP parallelization are implemented on GPU and ARM architectures.
Testing results of the copper system show that the optimized code can scale up
to the entire machine of both Fugaku and Summit, and the corresponding system
size can be extended by a factor of $134$ to an unprecedented $17$ billion
atoms. The strong scaling of a $13.5$-million atom copper system shows that the
time-to-solution can be 7 times faster, reaching $11.2$ nanoseconds per day.
This work opens the door for unprecedentedly large-scale molecular dynamics
simulations based on {\it ab initio} accuracy and can be potentially utilized
in studying more realistic applications such as mechanical properties of
metals, semiconductor devices, batteries, etc. The optimization techniques
detailed in this paper also provide insight for relevant high-performance
computing applications.
","[{'version': 'v1', 'created': 'Wed, 5 Jan 2022 04:27:15 GMT'}]",2022-01-06,"[['Guo', 'Zhuoqiang', ''], ['Lu', 'Denghui', ''], ['Yan', 'Yujin', ''], ['Hu', 'Siyu', ''], ['Liu', 'Rongrong', ''], ['Tan', 'Guangming', ''], ['Sun', 'Ninghui', ''], ['Jiang', 'Wanrun', ''], ['Liu', 'Lijun', ''], ['Chen', 'Yixiao', ''], ['Zhang', 'Linfeng', ''], ['Chen', 'Mohan', ''], ['Wang', 'Han', ''], ['Jia', 'Weile', '']]","['Deep potential', 'molecular dynamics', 'GPU', 'heterogeneous architecture', 'DeePMD-kit']"
8558,2202.06084,Mirazul Haque,"Mirazul Haque, Yaswanth Yadlapalli, Wei Yang, and Cong Liu",EREBA: Black-box Energy Testing of Adaptive Neural Networks,,,10.1145/3510003.3510088,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Recently, various Deep Neural Network (DNN) models have been proposed for
environments like embedded systems with stringent energy constraints. The
fundamental problem of determining the robustness of a DNN with respect to its
energy consumption (energy robustness) is relatively unexplored compared to
accuracy-based robustness. This work investigates the energy robustness of
Adaptive Neural Networks (AdNNs), a type of energy-saving DNNs proposed for
many energy-sensitive domains and have recently gained traction. We propose
EREBA, the first black-box testing method for determining the energy robustness
of an AdNN. EREBA explores and infers the relationship between inputs and the
energy consumption of AdNNs to generate energy surging samples. Extensive
implementation and evaluation using three state-of-the-art AdNNs demonstrate
that test inputs generated by EREBA could degrade the performance of the system
substantially. The test inputs generated by EREBA can increase the energy
consumption of AdNNs by 2,000% compared to the original inputs. Our results
also show that test inputs generated via EREBA are valuable in detecting energy
surging inputs.
","[{'version': 'v1', 'created': 'Sat, 12 Feb 2022 15:16:04 GMT'}]",2022-02-15,"[['Haque', 'Mirazul', ''], ['Yadlapalli', 'Yaswanth', ''], ['Yang', 'Wei', ''], ['Liu', 'Cong', '']]","['Green AI', 'AI Energy Testing', 'Adversarial Machine Learning']"
8559,2112.05742,Adrian Groza,Roxana Szomiu and Adrian Groza,A Puzzle-Based Dataset for Natural Language Inference,,,10.13140/RG.2.2.19206.09289,,cs.AI,http://creativecommons.org/licenses/by/4.0/,"  We provide here a dataset for tasks related to natural language understanding
and natural language inference. The dataset contains logical puzzles in natural
language from three domains: comparing puzzles, knighs and knaves, and zebra
puzzles. Each puzzle is associated with the entire set of atomic questions that
can be generated based on the relations and individuals occurring in the text.
For each question we provide the correct answer: entailment, contradiction or
ambiguity. The answer's correctness is verified against theorem provers. Good
puzzles have two properties: (i) each piece of information is necessary and
(ii) no unnecessary information is provided. These properties make puzzles
interesting candidates for machine comprehension tasks.
","[{'version': 'v1', 'created': 'Fri, 10 Dec 2021 18:53:06 GMT'}]",2021-12-13,"[['Szomiu', 'Roxana', ''], ['Groza', 'Adrian', '']]","['natural language inference', 'question answering dataset', 'first order logic', 'theoremproving', 'textual entailment']"
8560,1912.11165,S. Mohammad Mirbagheri,"S. Mohammad Mirbagheri, Howard J. Hamilton",High Utility Interval-Based Sequences,"To appear in Proceedings of the 22nd International Conference on Big
  Data Analytics and Knowledge Discovery (DaWaK2020), Bratislava, Slovakia,
  September 14-17. Springer, 2020","22nd International Conference on Big Data Analytics and Knowledge
  Discovery (DaWaK2020), Bratislava, Slovakia, September 14-17, 2020. Springer,
  Cham",10.1007/978-3-030-59065-9_9,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sequential pattern mining is an interesting research area with broad range of
applications. Most prior research on sequential pattern mining has considered
point-based data where events occur instantaneously. However, in many
application domains, events persist over intervals of time of varying lengths.
Furthermore, traditional frameworks for sequential pattern mining assume all
events have the same weight or utility. This simplifying assumption neglects
the opportunity to find informative patterns in terms of utilities, such as
cost. To address these issues, we incorporate the concept of utility into
interval-based sequences and define a framework to mine high utility patterns
in interval-based sequences i.e., patterns whose utility meets or exceeds a
minimum threshold. In the proposed framework, the utility of events is
considered while assuming multiple events can occur coincidentally and persist
over varying periods of time. An algorithm named High Utility Interval-based
Pattern Miner (HUIPMiner) is proposed and applied to real datasets. To achieve
an efficient solution, HUIPMiner is augmented with a pruning strategy.
Experimental results show that HUIPMiner is an effective solution to the
problem of mining high utility interval-based sequences.
","[{'version': 'v1', 'created': 'Tue, 24 Dec 2019 01:19:04 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Jul 2020 16:45:36 GMT'}]",2020-09-16,"[['Mirbagheri', 'S. Mohammad', ''], ['Hamilton', 'Howard J.', '']]","['High utility interval-based', 'utility mining', 'sequential mining', 'temporal pattern', 'event interval sequence']"
8561,1906.00197,Stefano Forti,"Stefano Forti, Federica Paganelli, Antonio Brogi",Probabilistic QoS-aware Placement of VNF chains at the Edge,,Theory and Practice of Logic Programming (2021),10.1017/S1471068421000016,,cs.NI cs.DC cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deploying IoT-enabled Virtual Network Function (VNF) chains to Cloud-Edge
infrastructures requires determining a placement for each VNF that satisfies
all set deployment requirements as well as a software-defined routing of
traffic flows between consecutive functions that meets all set communication
requirements. In this article, we present a declarative solution, EdgeUsher, to
the problem of how to best place VNF chains to Cloud-Edge infrastructures.
EdgeUsher can determine all eligible placements for a set of VNF chains to a
Cloud-Edge infrastructure so to satisfy all of their hardware, IoT, security,
bandwidth, and latency requirements. It exploits probability distributions to
model the dynamic variations in the available Cloud-Edge infrastructure, and to
assess output eligible placements against those variations.
","[{'version': 'v1', 'created': 'Sat, 1 Jun 2019 10:08:01 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Jan 2021 17:10:48 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Feb 2021 13:15:15 GMT'}]",2021-02-16,"[['Forti', 'Stefano', ''], ['Paganelli', 'Federica', ''], ['Brogi', 'Antonio', '']]","['Edge computing', 'IoT', 'VNF chain placement', 'NFV', 'SDN', 'probabilistic logic programming']"
8562,2108.09373,Mark Zhao,"Mark Zhao, Niket Agarwal, Aarti Basant, Bugra Gedik, Satadru Pan,
  Mustafa Ozdal, Rakesh Komuravelli, Jerry Pan, Tianshu Bao, Haowei Lu,
  Sundaram Narayanan, Jack Langman, Kevin Wilfong, Harsha Rastogi, Carole-Jean
  Wu, Christos Kozyrakis, Parik Pol","Understanding Data Storage and Ingestion for Large-Scale Deep
  Recommendation Model Training","In The 49th Annual International Symposium on Computer Architecture
  (ISCA 2022)",,10.1145/3470496.3533044,,cs.DC cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Datacenter-scale AI training clusters consisting of thousands of
domain-specific accelerators (DSA) are used to train increasingly-complex deep
learning models. These clusters rely on a data storage and ingestion (DSI)
pipeline, responsible for storing exabytes of training data and serving it at
tens of terabytes per second. As DSAs continue to push training efficiency and
throughput, the DSI pipeline is becoming the dominating factor that constrains
the overall training performance and capacity. Innovations that improve the
efficiency and performance of DSI systems and hardware are urgent, demanding a
deep understanding of DSI characteristics and infrastructure at scale.
  This paper presents Meta's end-to-end DSI pipeline, composed of a central
data warehouse built on distributed storage and a Data PreProcessing Service
that scales to eliminate data stalls. We characterize how hundreds of models
are collaboratively trained across geo-distributed datacenters via diverse and
continuous training jobs. These training jobs read and heavily filter massive
and evolving datasets, resulting in popular features and samples used across
training jobs. We measure the intense network, memory, and compute resources
required by each training job to preprocess samples during training. Finally,
we synthesize key takeaways based on our production infrastructure
characterization. These include identifying hardware bottlenecks, discussing
opportunities for heterogeneous DSI hardware, motivating research in datacenter
scheduling and benchmark datasets, and assimilating lessons learned in
optimizing DSI infrastructure.
","[{'version': 'v1', 'created': 'Fri, 20 Aug 2021 21:09:34 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Jan 2022 22:44:52 GMT'}, {'version': 'v3', 'created': 'Thu, 20 Jan 2022 19:51:43 GMT'}, {'version': 'v4', 'created': 'Fri, 22 Apr 2022 23:51:04 GMT'}]",2022-04-26,"[['Zhao', 'Mark', ''], ['Agarwal', 'Niket', ''], ['Basant', 'Aarti', ''], ['Gedik', 'Bugra', ''], ['Pan', 'Satadru', ''], ['Ozdal', 'Mustafa', ''], ['Komuravelli', 'Rakesh', ''], ['Pan', 'Jerry', ''], ['Bao', 'Tianshu', ''], ['Lu', 'Haowei', ''], ['Narayanan', 'Sundaram', ''], ['Langman', 'Jack', ''], ['Wilfong', 'Kevin', ''], ['Rastogi', 'Harsha', ''], ['Wu', 'Carole-Jean', ''], ['Kozyrakis', 'Christos', ''], ['Pol', 'Parik', '']]","['Machine learning systems', 'databases', 'distributed systems', 'dataingestion', 'data storage']"
8563,1907.04519,Andrey Savchenko,"A.V. Savchenko, K.V. Demochkin, I.S. Grechikhin","Preferences Prediction using a Gallery of Mobile Device based on Scene
  Recognition and Object Detection","19 pages; 9 figures, preprint submitter to Pattern Recognition
  journal",,10.1016/j.patcog.2021.108248,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper user modeling task is examined by processing a gallery of
photos and videos on a mobile device. We propose novel engine for user
preference prediction based on scene recognition, object detection and facial
analysis. At first, all faces in a gallery are clustered and all private photos
and videos with faces from large clusters are processed on the embedded system
in offline mode. Other photos may be sent to the remote server to be analyzed
by very deep models. The visual features of each photo are obtained from scene
recognition and object detection models. These features are aggregated into a
single user descriptor in the neural attention block. The proposed pipeline is
implemented for the Android mobile platform. Experimental results with a subset
of Photo Event Collection, Web Image Dataset for Event Recognition and Amazon
Fashion datasets demonstrate the possibility to process images very efficiently
without significant accuracy degradation. The source code of Android mobile
application is publicly available at
https://github.com/HSE-asavchenko/mobile-visual-preferences.
","[{'version': 'v1', 'created': 'Wed, 10 Jul 2019 05:45:08 GMT'}, {'version': 'v2', 'created': 'Sun, 18 Apr 2021 13:33:11 GMT'}]",2021-08-19,"[['Savchenko', 'A. V.', ''], ['Demochkin', 'K. V.', ''], ['Grechikhin', 'I. S.', '']]","['Scene recognition', 'event recognition', 'object detection', 'recognition of a set of images', 'CNN (convolution neuralnetwork)', 'mobile device']"
8564,2207.14345,Diego Ayala,"Diego Ayala, Daniel Durini, Jose Rangel-Magdaleno",Aztec curve: proposal for a new space-filling curve,,"Proceedings of the 7th Brazilian Technology Symposium BTSym21,
  2021",10.1007/978-3-031-04435-9_40,,cs.CV cs.CG cs.GR cs.GT,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Different space-filling curves (SFCs) are briefly reviewed in this paper, and
a new one is proposed. A century has passed between the inception of this kind
of curves, since then they have been found useful in computer science,
particularly in data storage and indexing due to their clustering properties,
being Hilbert curve the most well-known member of the family of fractals. The
proposed Aztec curve, with similar characteristics to the Hilbert's curve, is
introduced in this paper, accompanied by a grammatical description for its
construction. It yields the possibility of creating bi-dimensional clusters,
not available for Hilbert nor Peano curves. Additional to this, a case of
application on the scope of Compressed Sensing is implemented, in which the use
of Hilbert curve is contrasted with Aztec curve, having a similar performance,
and positioning the Aztec curve as viable and a new alternative for future
exploitation on applications that make use of SFC's.
","[{'version': 'v1', 'created': 'Thu, 28 Jul 2022 18:52:08 GMT'}]",2022-08-01,"[['Ayala', 'Diego', ''], ['Durini', 'Daniel', ''], ['Rangel-Magdaleno', 'Jose', '']]","['space-filling curve', 'fractal', 'memory-efficient clustering']"
8565,2109.00885,Jonathan Kent,"Jonathan S. Kent, Charles C. Wamsley, Davin Flateau, Amber Ferguson","Unsupervised Learning for Target Tracking and Background Subtraction in
  Satellite Imagery",10 pages,"Conference: SPIE 2021, Artificial Intelligence and Machine
  Learning for Multi-Domain Operations Applications III. Volume: 11746. Pages:
  117460H. Year: 2021. Organization: International Society for Optics and
  Photonics",10.1117/12.2580620,,cs.CV cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  This paper describes an unsupervised machine learning methodology capable of
target tracking and background suppression via a novel dual-model approach.
``Jekyll`` produces a video bit-mask describing an estimate of the locations of
moving objects, and ``Hyde`` outputs a pseudo-background frame to subtract from
the original input image sequence. These models were trained with a
custom-modified version of Cross Entropy Loss.
  Simulated data were used to compare the performance of Jekyll and Hyde
against a more traditional supervised Machine Learning approach. The results
from these comparisons show that the unsupervised methods developed are
competitive in output quality with supervised techniques, without the
associated cost of acquiring labeled training data.
","[{'version': 'v1', 'created': 'Fri, 13 Aug 2021 16:36:23 GMT'}]",2021-09-03,"[['Kent', 'Jonathan S.', ''], ['Wamsley', 'Charles C.', ''], ['Flateau', 'Davin', ''], ['Ferguson', 'Amber', '']]","['Unsupervised Learning', 'Satellite Imagery', 'Target Tracking', 'Machine Learning']"
8566,2103.13042,Xiaoyan Liu,"Xiaoyan Liu, Yi Liu, Ming Dun, Bohong Yin, Hailong Yang, Zhongzhi
  Luan, Depei Qian",Accelerating Sparse Approximate Matrix Multiplication on GPUs,,,10.1007/s11227-022-04334-5,,cs.PF,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Although the matrix multiplication plays a vital role in computational linear
algebra, there are few efficient solutions for matrix multiplication of the
near-sparse matrices. The Sparse Approximate Matrix Multiply (SpAMM) is one of
the algorithms to fill the performance gap neglected by traditional
optimizations for dense/sparse matrix multiplication. However, existing SpAMM
algorithms fail to exploit the performance potential of GPUs for acceleration.
In this paper, we present cuSpAMM, the first parallel SpAMM algorithm optimized
for multiple GPUs. Several performance optimizations have been proposed,
including algorithm re-design to adapt to the thread parallelism, blocking
strategies for memory access optimization, and the acceleration with the tensor
core. In addition, we scale cuSpAMM to run on multiple GPUs with an effective
load balance scheme. We evaluate cuSpAMM on both synthesized and real-world
datasets on multiple GPUs. The experiment results show that cuSpAMM achieves
significant performance speedup compared to vendor optimized cuBLAS and
cuSPARSE libraries.
","[{'version': 'v1', 'created': 'Wed, 24 Mar 2021 08:09:59 GMT'}]",2022-10-25,"[['Liu', 'Xiaoyan', ''], ['Liu', 'Yi', ''], ['Dun', 'Ming', ''], ['Yin', 'Bohong', ''], ['Yang', 'Hailong', ''], ['Luan', 'Zhongzhi', ''], ['Qian', 'Depei', '']]","['sparse approximate matrix multiplication', 'performance optimization', 'multiple GPUs']"
8567,2107.10898,Max Coenen,Max Coenen and Franz Rottensteiner,"Pose Estimation and 3D Reconstruction of Vehicles from Stereo-Images
  Using a Subcategory-Aware Shape Prior",,,10.1016/j.isprsjprs.2021.07.006,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The 3D reconstruction of objects is a prerequisite for many highly relevant
applications of computer vision such as mobile robotics or autonomous driving.
To deal with the inverse problem of reconstructing 3D objects from their 2D
projections, a common strategy is to incorporate prior object knowledge into
the reconstruction approach by establishing a 3D model and aligning it to the
2D image plane. However, current approaches are limited due to inadequate shape
priors and the insufficiency of the derived image observations for a reliable
alignment with the 3D model. The goal of this paper is to show how 3D object
reconstruction can profit from a more sophisticated shape prior and from a
combined incorporation of different observation types inferred from the images.
We introduce a subcategory-aware deformable vehicle model that makes use of a
prediction of the vehicle type for a more appropriate regularisation of the
vehicle shape. A multi-branch CNN is presented to derive predictions of the
vehicle type and orientation. This information is also introduced as prior
information for model fitting. Furthermore, the CNN extracts vehicle keypoints
and wireframes, which are well-suited for model-to-image association and model
fitting. The task of pose estimation and reconstruction is addressed by a
versatile probabilistic model. Extensive experiments are conducted using two
challenging real-world data sets on both of which the benefit of the developed
shape prior can be shown. A comparison to state-of-the-art methods for vehicle
pose estimation shows that the proposed approach performs on par or better,
confirming the suitability of the developed shape prior and probabilistic model
for vehicle reconstruction.
","[{'version': 'v1', 'created': 'Thu, 22 Jul 2021 19:47:49 GMT'}]",2021-12-09,"[['Coenen', 'Max', ''], ['Rottensteiner', 'Franz', '']]","['Vehicle detection', '3D vehicle reconstruction', 'pose estimation', 'Multi-Branch CNN', 'Active Shape Model']"
8568,2204.08471,Hiromu Yakura,"Riku Arakawa, Hiromu Yakura",AI for human assessment: What do professional assessors need?,"To appear in Proceedings of the 2023 CHI Conference on Human Factors
  in Computing Systems (Case Study)",,10.1145/3544549.3573849,,cs.HC cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent organizations have started to adopt AI-based decision support tools to
optimize human resource development practices, while facing various challenges
of using AIs in highly contextual and sensitive domains. We present our case
study that aims to help professional assessors make decisions in human
assessment, in which they conduct interviews with assessees and evaluate their
suitability for certain job roles. Our workshop with two industrial assessors
elucidated troubles they face (i.e., maintaining stable and non-subjective
observation of assessees' behaviors) and derived requirements of AI systems
(i.e., extracting their nonverbal cues from interview videos in an
interpretable manner). In response, we employed an unsupervised anomaly
detection algorithm using multimodal behavioral features such as facial
keypoints, body and head pose, and gaze. The algorithm extracts outlier scenes
from the video based on behavioral features as well as informing which feature
contributes to the outlierness. We first evaluated how the assessors would
perceive the extracted cues and discovered that the algorithm is useful in
suggesting scenes to which assessors would pay attention, thanks to its
interpretability. Then, we developed an interface prototype incorporating the
algorithm and had six assessors use it for their actual assessment. Their
comments revealed the effectiveness of introducing unsupervised anomaly
detection to enhance their feeling of confidence and objectivity of the
assessment along with potential use scenarios of such AI-based systems in human
assessment. Our approach, which builds on top of the idea of separating
observation and interpretation in human-AI collaboration, will facilitate human
decision making in highly contextual domains, such as human assessment, while
keeping their trust in the system.
","[{'version': 'v1', 'created': 'Mon, 18 Apr 2022 03:35:37 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Jun 2022 00:33:10 GMT'}, {'version': 'v3', 'created': 'Tue, 6 Dec 2022 04:31:42 GMT'}]",2022-12-07,"[['Arakawa', 'Riku', ''], ['Yakura', 'Hiromu', '']]","['human-AI collaboration', 'human assessment', 'behavior analysis']"
8569,2005.07465,Mohammadreza Tavakoli,"Mohammadreza Tavakoli, Stefan T. Mol, and G\'abor Kismih\'ok","Labour Market Information Driven, Personalized, OER Recommendation
  System for Lifelong Learners","This paper has been accepted to be published in the proceedings of
  CSEDU 2020 by SciTePress",,10.5220/0009420300960104,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this paper, we suggest a novel method to aid lifelong learners to access
relevant OER based learning content to master skills demanded on the labour
market. Our software prototype 1) applies Text Classification and Text Mining
methods on vacancy announcements to decompose jobs into meaningful skills
components, which lifelong learners should target; and 2) creates a hybrid OER
Recommender System to suggest personalized learning content for learners to
progress towards their skill targets. For the first evaluation of this
prototype we focused on two job areas: Data Scientist, and Mechanical Engineer.
We applied our skill extractor approach and provided OER recommendations for
learners targeting these jobs. We conducted in-depth, semi-structured
interviews with 12 subject matter experts to learn how our prototype performs
in terms of its objectives, logic, and contribution to learning. More than 150
recommendations were generated, and 76.9% of these recommendations were treated
as useful by the interviewees. Interviews revealed that a personalized OER
recommender system, based on skills demanded by labour market, has the
potential to improve the learning experience of lifelong learners.
","[{'version': 'v1', 'created': 'Fri, 15 May 2020 10:48:15 GMT'}]",2020-05-22,"[['Tavakoli', 'Mohammadreza', ''], ['Mol', 'Stefan T.', ''], ['Kismihók', 'Gábor', '']]","['Lifelong Learning', 'Open Education Resources', 'Recommender Systems', 'Labour Market Intelligence', 'MachineLearning', 'Text Mining']"
8570,2110.07600,Yujun Lin,"Yujun Lin, Zhekai Zhang, Haotian Tang, Hanrui Wang and Song Han",PointAcc: Efficient Point Cloud Accelerator,Accepted by Mircro 2021,,10.1145/3466752.3480084,,cs.AR,http://creativecommons.org/licenses/by/4.0/,"  Deep learning on point clouds plays a vital role in a wide range of
applications such as autonomous driving and AR/VR. These applications interact
with people in real-time on edge devices and thus require low latency and low
energy. Compared to projecting the point cloud to 2D space, directly processing
the 3D point cloud yields higher accuracy and lower #MACs. However, the
extremely sparse nature of point cloud poses challenges to hardware
acceleration. For example, we need to explicitly determine the nonzero outputs
and search for the nonzero neighbors (mapping operation), which is unsupported
in existing accelerators. Furthermore, explicit gather and scatter of sparse
features are required, resulting in large data movement overhead. In this
paper, we comprehensively analyze the performance bottleneck of modern point
cloud networks on CPU/GPU/TPU. To address the challenges, we then present
PointAcc, a novel point cloud deep learning accelerator. PointAcc maps diverse
mapping operations onto one versatile ranking-based kernel, streams the sparse
computation with configurable caching, and temporally fuses consecutive dense
layers to reduce the memory footprint. Evaluated on 8 point cloud models across
4 applications, PointAcc achieves 3.7X speedup and 22X energy savings over RTX
2080Ti GPU. Co-designed with light-weight neural networks, PointAcc rivals the
prior accelerator Mesorasi by 100X speedup with 9.1% higher accuracy running
segmentation on the S3DIS dataset. PointAcc paves the way for efficient point
cloud recognition.
","[{'version': 'v1', 'created': 'Thu, 14 Oct 2021 17:57:33 GMT'}]",2021-10-15,"[['Lin', 'Yujun', ''], ['Zhang', 'Zhekai', ''], ['Tang', 'Haotian', ''], ['Wang', 'Hanrui', ''], ['Han', 'Song', '']]","['point cloud', 'neural network accelerator', 'sparse convolution']"
8571,2105.03356,Dominik Dellermann,"Dominik Dellermann, Nikolaus Lipusch, Philipp Ebel, and Jan Marco
  Leimeister","Design principles for a hybrid intelligence decision support system for
  business model validation",,,10.1007/s12525-018-0309-2,,cs.AI cs.HC,http://creativecommons.org/licenses/by/4.0/,"  One of the most critical tasks for startups is to validate their business
model. Therefore, entrepreneurs try to collect information such as feedback
from other actors to assess the validity of their assumptions and make
decisions. However, previous work on decisional guidance for business model
validation provides no solution for the highly uncertain and complex context of
earlystage startups. The purpose of this paper is, thus, to develop design
principles for a Hybrid Intelligence decision support system (HI-DSS) that
combines the complementary capabilities of human and machine intelligence. We
follow a design science research approach to design a prototype artifact and a
set of design principles. Our study provides prescriptive knowledge for HI-DSS
and contributes to previous work on decision support for business models, the
applications of complementary strengths of humans and machines for making
decisions, and support systems for extremely uncertain decision-making
problems.
","[{'version': 'v1', 'created': 'Fri, 7 May 2021 16:13:36 GMT'}]",2021-05-10,"[['Dellermann', 'Dominik', ''], ['Lipusch', 'Nikolaus', ''], ['Ebel', 'Philipp', ''], ['Leimeister', 'Jan Marco', '']]","['Collectiveintelligence', 'Machinelearning', 'Decisionsupportsystem', 'Hybridintelligence', 'Businessmodel']"
8572,2005.07076,Yi\u{g}it Oktar,"Yigit Oktar, Mehmet Turkan","Evolutionary Simplicial Learning as a Generative and Compact Sparse
  Framework for Classification",,,10.1016/j.sigpro.2020.107634,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dictionary learning for sparse representations has been successful in many
reconstruction tasks. Simplicial learning is an adaptation of dictionary
learning, where subspaces become clipped and acquire arbitrary offsets, taking
the form of simplices. Such adaptation is achieved through additional
constraints on sparse codes. Furthermore, an evolutionary approach can be
chosen to determine the number and the dimensionality of simplices composing
the simplicial, in which most generative and compact simplicials are favored.
This paper proposes an evolutionary simplicial learning method as a generative
and compact sparse framework for classification. The proposed approach is first
applied on a one-class classification task and it appears as the most reliable
method within the considered benchmark. Most surprising results are observed
when evolutionary simplicial learning is considered within a multi-class
classification task. Since sparse representations are generative in nature,
they bear a fundamental problem of not being capable of distinguishing two
classes lying on the same subspace. This claim is validated through synthetic
experiments and superiority of simplicial learning even as a generative-only
approach is demonstrated. Simplicial learning loses its superiority over
discriminative methods in high-dimensional cases but can further be modified
with discriminative elements to achieve state-of-the-art performance in
classification tasks.
","[{'version': 'v1', 'created': 'Thu, 14 May 2020 15:44:56 GMT'}]",2020-05-19,"[['Oktar', 'Yigit', ''], ['Turkan', 'Mehmet', '']]","['Sparse Representations', 'Machine Learning', 'Simplex', 'Simplicial', 'DictionaryLearning', 'Classification']"
8573,2105.01878,"Stephan Schl\""ogl PhD","M. I. Torres, J. M. Olaso, C. Montenegro, R. Santana, A. V\'azquez, R.
  Justo, J. A. Lozano, S. Schl\""ogl, G. Chollet, N. Dugan, M. Irvine, N.
  Glackin, C. Pickard, A. Esposito, G. Cordasco, A. Troncone, D.
  Petrovska-Delacretaz, A. Mtibaa, M. A. Hmani, M. S. Korsnes, L. J.
  Martinussen, S. Escalera, C. Palmero Cantari\~no, O. Deroo, O. Gordeeva, J.
  Tenorio-Laranga, E. Gonzalez-Fraile, B. Fernandez-Ruanova, A. Gonzalez-Pinto",The EMPATHIC Project: Mid-term Achievements,12 pages,,10.1145/3316782.3322764,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The goal of active aging is to promote changes in the elderly community so as
to maintain an active, independent and socially-engaged lifestyle.
Technological advancements currently provide the necessary tools to foster and
monitor such processes. This paper reports on mid-term achievements of the
European H2020 EMPATHIC project, which aims to research, innovate, explore and
validate new interaction paradigms and platforms for future generations of
personalized virtual coaches to assist the elderly and their carers to reach
the active aging goal, in the vicinity of their home. The project focuses on
evidence-based, user-validated research and integration of intelligent
technology, and context sensing methods through automatic voice, eye and facial
analysis, integrated with visual and spoken dialogue system capabilities. In
this paper, we describe the current status of the system, with a special
emphasis on its components and their integration, the creation of a Wizard of
Oz platform, and findings gained from user interaction studies conducted
throughout the first 18 months of the project.
","[{'version': 'v1', 'created': 'Wed, 5 May 2021 05:56:52 GMT'}]",2021-05-06,"[['Torres', 'M. I.', ''], ['Olaso', 'J. M.', ''], ['Montenegro', 'C.', ''], ['Santana', 'R.', ''], ['Vázquez', 'A.', ''], ['Justo', 'R.', ''], ['Lozano', 'J. A.', ''], ['Schlögl', 'S.', ''], ['Chollet', 'G.', ''], ['Dugan', 'N.', ''], ['Irvine', 'M.', ''], ['Glackin', 'N.', ''], ['Pickard', 'C.', ''], ['Esposito', 'A.', ''], ['Cordasco', 'G.', ''], ['Troncone', 'A.', ''], ['Petrovska-Delacretaz', 'D.', ''], ['Mtibaa', 'A.', ''], ['Hmani', 'M. A.', ''], ['Korsnes', 'M. S.', ''], ['Martinussen', 'L. J.', ''], ['Escalera', 'S.', ''], ['Cantariño', 'C. Palmero', ''], ['Deroo', 'O.', ''], ['Gordeeva', 'O.', ''], ['Tenorio-Laranga', 'J.', ''], ['Gonzalez-Fraile', 'E.', ''], ['Fernandez-Ruanova', 'B.', ''], ['Gonzalez-Pinto', 'A.', '']]","['Emotional Artificial Agents', 'Assisted Living', 'Coaching', 'Spoken Dialogue Systems']"
8574,2203.05952,Stephan Leitner,"Nada Ghanem, Stephan Leitner, Dietmar Jannach","Balancing Consumer and Business Value of Recommender Systems: A
  Simulation-based Analysis","36 pages, 9 figures",Electronic Commerce Research and Applications 2022,10.1016/j.elerap.2022.101195,,cs.SI cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated recommendations can nowadays be found on many e-commerce platforms,
and such recommendations can create substantial value for consumers and
providers. Often, however, not all recommendable items have the same profit
margin, and providers might thus be tempted to promote items that maximize
their profit. In the short run, consumers might accept non-optimal
recommendations, but they may lose their trust in the long run. Ultimately,
this leads to the problem of designing balanced recommendation strategies,
which consider both consumer and provider value and lead to sustained business
success. This work proposes a simulation framework based on agent-based
modeling designed to help providers explore longitudinal dynamics of different
recommendation strategies. In our model, consumer agents receive
recommendations from providers, and the perceived quality of the
recommendations influences the consumers' trust over time. We design several
recommendation strategies which either give more weight on provider profit or
on consumer utility. Our simulations show that a hybrid strategy that puts more
weight on consumer utility but without ignoring profitability considerations
leads to the highest cumulative profit in the long run. This hybrid strategy
results in a profit increase of about 20 % compared to pure consumer or profit
oriented strategies. We also find that social media can reinforce the observed
phenomena. In case when consumers heavily rely on social media, the cumulative
profit of the best strategy further increases. To ensure reproducibility and
foster future research, we publicly share our flexible simulation framework.
","[{'version': 'v1', 'created': 'Thu, 10 Mar 2022 12:48:29 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Apr 2022 15:31:02 GMT'}, {'version': 'v3', 'created': 'Thu, 18 Aug 2022 12:20:00 GMT'}]",2022-09-12,"[['Ghanem', 'Nada', ''], ['Leitner', 'Stephan', ''], ['Jannach', 'Dietmar', '']]","['E-Commerce', 'Simulation', 'Agent-based Modeling', 'Decision Support']"
8575,2007.00866,Daniel Gonzalez,Daniel J. Gonzalez and H. Harry Asada,Triple Scissor Extender: A 6-DOF Lifting and Positioning Robot,,"2016 IEEE International Conference on Robotics and Automation
  (ICRA), Stockholm, 2016, pp. 847-853",10.1109/ICRA.2016.7487215,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a novel 6 DOF robotic mechanism for reaching high ceilings and
positioning an end-effector. The end-effector is supported with three scissor
mechanisms that extend towards the ceiling with 6 independent linear actuators
moving the base ends of the individual scissors. The top point of each scissor
is connected to one of three ball joints located at the three vertices of the
top triangular plate holding the end-effector. Coordinated motion of the 6
linear actuators at the base allows the end-effector to reach an arbitrary
position with an arbitrary orientation. The design concept of the Triple
Scissor Extender is presented, followed by kinematic modeling and analysis of
the the Inverse Jacobian relating actuator velocities to the end-effector
velocities. The Inverse Jacobian eigenvalues are determined for diverse
configurations in order to characterize the kinematic properties. A
proof-of-concept prototype has been designed and built. The Inverse Jacobian
for use in differential control is evaluated through experiments.
","[{'version': 'v1', 'created': 'Thu, 2 Jul 2020 04:21:09 GMT'}]",2020-07-03,"[['Gonzalez', 'Daniel J.', ''], ['Asada', 'H. Harry', '']]","['Robot Mechanism', 'Scissor Lift', 'Parallel Manipulator', 'Stewart Platform', '6-PSU', 'Jacobian']"
8576,2012.01813,Johanna Johansen Ms,"Johanna Johansen, Tore Pedersen, Simone Fischer-H\""ubner, Christian
  Johansen, Gerardo Schneider, Arnold Roosendaal, Harald Zwingelberg, Anders
  Jakob Sivesind, Josef Noll","A Multidisciplinary Definition of Privacy Labels: The Story of Princess
  Privacy and the Seven Helpers","29 pages, 6 figures","Information and Computer Security, Vol. 30, No. 3, (2022) pp.
  452-469",10.1108/ICS-06-2021-0080,,cs.CR cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Privacy is currently in distress and in need of rescue, much like princesses
in the all-familiar fairytales. We employ storytelling and metaphors from
fairytales to make reader-friendly and streamline our arguments about how a
complex concept of Privacy Labeling (the 'knight in shining armor') can be a
solution to the current state of Privacy (the 'princess in distress'). We give
a precise definition of Privacy Labeling (PL), painting a panoptic portrait
from seven different perspectives (the 'seven helpers'): Business, Legal,
Regulatory, Usability and Human Factors, Educative, Technological, and
Multidisciplinary. We describe a common vision, proposing several important
'traits of character' of PL as well as identifying 'undeveloped
potentialities', i.e., open problems on which the community can focus. More
specifically, this position paper identifies the stakeholders of the PL and
their needs with regard to privacy, describing how PL should be and look like
in order to address these needs. Throughout the paper, we highlight goals,
characteristics, open problems, and starting points for creating, what we
consider to be, the ideal PL. In the end we present three approaches to
establish and manage PL, through: self-evaluations, certifications, or
community endeavors. Based on these, we sketch a roadmap for future
developments.
","[{'version': 'v1', 'created': 'Thu, 3 Dec 2020 10:42:30 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Feb 2021 10:57:17 GMT'}, {'version': 'v3', 'created': 'Sun, 9 May 2021 16:54:58 GMT'}]",2022-06-01,"[['Johansen', 'Johanna', ''], ['Pedersen', 'Tore', ''], ['Fischer-Hübner', 'Simone', ''], ['Johansen', 'Christian', ''], ['Schneider', 'Gerardo', ''], ['Roosendaal', 'Arnold', ''], ['Zwingelberg', 'Harald', ''], ['Sivesind', 'Anders Jakob', ''], ['Noll', 'Josef', '']]","['privacy labels', 'General Data Protection Regulation', 'usability', 'certification', 'automation', 'psychological models']"
8577,1904.08395,Ronan Keane,"Ronan Keane, H. Oliver Gao","A formulation of the relaxation phenomenon for lane changing dynamics in
  an arbitrary car following model",,,10.1016/j.trc.2021.103081,,cs.SY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lane changing dynamics are an important part of traffic microsimulation and
are vital for modeling weaving sections and merge bottlenecks. However, there
is often much more emphasis placed on car following and gap acceptance models,
whereas lane changing dynamics such as tactical, cooperation, and relaxation
models receive comparatively little attention. This paper develops a general
relaxation model which can be applied to an arbitrary parametric or
nonparametric microsimulation model. The relaxation model modifies car
following dynamics after a lane change, when vehicles can be far from
equilibrium. Relaxation prevents car following models from reacting too
strongly to the changes in space headway caused by lane changing, leading to
more accurate and realistic simulated trajectories. We also show that
relaxation is necessary for correctly simulating traffic breakdown with
realistic values of capacity drop.
","[{'version': 'v1', 'created': 'Wed, 17 Apr 2019 17:52:18 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Dec 2020 05:26:47 GMT'}]",2021-03-09,"[['Keane', 'Ronan', ''], ['Gao', 'H. Oliver', '']]","['lane changing', 'car following', 'relaxation', 'traffic microsimulation', 'LSTM', 'capacity drop']"
8578,2101.11970,Diego Rojo,"Diego Rojo, Nyi Nyi Htun, Denis Parra, Robin De Croon and Katrien
  Verbert","AHMoSe: A Knowledge-Based Visual Support System for Selecting Regression
  Machine Learning Models","27 pages, 6 figures, 5 tables. Accepted manuscript version. Published
  in Computers and Electronics in Agriculture",Computers and Electronics in Agriculture 187 (2021) 106183,10.1016/j.compag.2021.106183,,cs.HC cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Decision support systems have become increasingly popular in the domain of
agriculture. With the development of automated machine learning, agricultural
experts are now able to train, evaluate and make predictions using cutting edge
machine learning (ML) models without the need for much ML knowledge. Although
this automated approach has led to successful results in many scenarios, in
certain cases (e.g., when few labeled datasets are available) choosing among
different models with similar performance metrics is a difficult task.
Furthermore, these systems do not commonly allow users to incorporate their
domain knowledge that could facilitate the task of model selection, and to gain
insight into the prediction system for eventual decision making. To address
these issues, in this paper we present AHMoSe, a visual support system that
allows domain experts to better understand, diagnose and compare different
regression models, primarily by enriching model-agnostic explanations with
domain knowledge. To validate AHMoSe, we describe a use case scenario in the
viticulture domain, grape quality prediction, where the system enables users to
diagnose and select prediction models that perform better. We also discuss
feedback concerning the design of the tool from both ML and viticulture
experts.
","[{'version': 'v1', 'created': 'Thu, 28 Jan 2021 12:55:06 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Nov 2021 19:40:15 GMT'}]",2021-12-02,"[['Rojo', 'Diego', ''], ['Htun', 'Nyi Nyi', ''], ['Parra', 'Denis', ''], ['De Croon', 'Robin', ''], ['Verbert', 'Katrien', '']]","['Decision Support System', 'Visual Analytics', 'Explainable AI', 'AutomatedMachine Learning']"
8579,2004.04477,Daniel Jun Xian Ng,"Daniel Jun Xian Ng (1), Arvind Easwaran (1) and Sidharta Andalam (2)
  ((1) Nanyang Technological University, Singapore, (2) Delta Electronics Inc.,
  Singapore)","Demo Abstract: Contract-based Hierarchical Resilience Framework for
  Cyber-Physical Systems","2 pages, 5 figures, published in the Demo Session of IEEE
  International Conference on Cyber-Physical Systems 2019. Publication rights
  licensed to ACM",,10.1145/3302509.3313323,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This demonstration presents a framework for building a resilient
Cyber-Physical Systems (CPS) cyber-infrastructure through the use of
hierarchical parametric assume-guarantee contracts. A Fischertechnik Sorting
Line with Color Detection training model is used to showcase our framework.
","[{'version': 'v1', 'created': 'Thu, 9 Apr 2020 10:54:51 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Apr 2020 03:54:07 GMT'}]",2020-04-14,"[['Ng', 'Daniel Jun Xian', ''], ['Easwaran', 'Arvind', ''], ['Andalam', 'Sidharta', '']]","['Reliability', 'Cyber-Physical Systems', 'Assume-Guarantee Contracts']"
8580,1902.03964,Bla\v{z} \v{S}krlj,"Bla\v{z} \v{S}krlj, Jan Kralj, Janez Konc, Marko Robnik-\v{S}ikonja,
  Nada Lavra\v{c}","Deep Node Ranking for Neuro-symbolic Structural Node Embedding and
  Classification",Accepted for publication in IJIS,,10.1002/int.22651,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network node embedding is an active research subfield of complex network
analysis. This paper contributes a novel approach to learning network node
embeddings and direct node classification using a node ranking scheme coupled
with an autoencoder-based neural network architecture. The main advantages of
the proposed Deep Node Ranking (DNR) algorithm are competitive or better
classification performance, significantly higher learning speed and lower space
requirements when compared to state-of-the-art approaches on 15 real-life node
classification benchmarks. Furthermore, it enables exploration of the
relationship between symbolic and the derived sub-symbolic node
representations, offering insights into the learned node space structure. To
avoid the space complexity bottleneck in a direct node classification setting,
DNR computes stationary distributions of personalized random walks from given
nodes in mini-batches, scaling seamlessly to larger networks. The scaling laws
associated with DNR were also investigated on 1488 synthetic Erd\H{o}s-R\'enyi
networks, demonstrating its scalability to tens of millions of links.
","[{'version': 'v1', 'created': 'Mon, 11 Feb 2019 16:13:11 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Mar 2019 07:51:28 GMT'}, {'version': 'v3', 'created': 'Wed, 17 Apr 2019 17:31:13 GMT'}, {'version': 'v4', 'created': 'Mon, 22 Apr 2019 07:01:18 GMT'}, {'version': 'v5', 'created': 'Tue, 22 Sep 2020 07:40:31 GMT'}, {'version': 'v6', 'created': 'Mon, 30 Aug 2021 07:52:31 GMT'}]",2021-09-14,"[['Škrlj', 'Blaž', ''], ['Kralj', 'Jan', ''], ['Konc', 'Janez', ''], ['Robnik-Šikonja', 'Marko', ''], ['Lavrač', 'Nada', '']]","['network node embedding', 'complex networks', 'deep learning']"
8581,1904.10412,Katina Kralevska,Danilo Gligoroski and Katina Kralevska,Expanded Combinatorial Designs as Tool to Model Network Slicing in 5G,Accepted for publication in IEEE Access,https://ieeexplore.ieee.org/document/8698758 2019,10.1109/ACCESS.2019.2913185,"Published in IEEE Access, vol. 7, pp. 54879--54887, 2019",cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The network slice management function (NSMF) in 5G has a task to configure
the network slice instances and to combine network slice subnet instances from
the new-generation radio access network and the core network into an end-to-end
network slice instance. In this paper, we propose a mathematical model for
network slicing based on combinatorial designs such as Latin squares and
rectangles and their conjugate forms. We extend those designs with attributes
that offer different levels of abstraction. For one set of attributes we prove
a stability Lemma for the necessary conditions to reach a stationary ergodic
stage. We also introduce a definition of utilization ratio function and offer
an algorithm for its maximization. Moreover, we provide algorithms that
simulate the work of NSMF with randomized or optimized strategies, and we
report the results of our implementation, experiments and simulations for one
set of attributes.
","[{'version': 'v1', 'created': 'Tue, 23 Apr 2019 16:33:10 GMT'}]",2020-02-14,"[['Gligoroski', 'Danilo', ''], ['Kralevska', 'Katina', '']]","['5G networks', 'Combinatorial designs', 'Dynamicdeployment', 'Latin squares', 'Latin rectangles', 'Network slicing', 'Optimal slice selection']"
8582,2011.04022,Ren\'e van Bevern,Vsevolod A. Afanasev and Ren\'e van Bevern and Oxana Yu. Tsidulko,"The Hierarchical Chinese Postman Problem: the slightest disorder makes
  it hard, yet disconnectedness is manageable",Fixed Figure 4 and an argument in the proof of Lemma 3.7(iii),"Operations Research Letters, 49(2): 270-277, 2021",10.1016/j.orl.2021.01.017,,cs.DS cs.DM math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Hierarchical Chinese Postman Problem is finding a shortest traversal of
all edges of a graph respecting precedence constraints given by a partial order
on classes of edges. We show that the special case with connected classes is
NP-hard even on orders decomposable into a chain and an incomparable class. For
the case with linearly ordered (possibly disconnected) classes, we get
5/3-approximations and fixed-parameter algorithms by transferring results from
the Rural Postman Problem.
","[{'version': 'v1', 'created': 'Sun, 8 Nov 2020 16:56:26 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Jan 2021 05:37:50 GMT'}]",2021-02-17,"[['Afanasev', 'Vsevolod A.', ''], ['van Bevern', 'René', ''], ['Tsidulko', 'Oxana Yu.', '']]","['approximation algorithm', 'fixed-parameter algorithm', 'NP-hardness', 'arc routing', 'rural postman problem', 'temporal graphs']"
8583,2202.08737,Zhengren Wang,"Zhengren Wang, Yi Zhou, Mingyu Xiao and Bakhadyr Khoussainov",Listing Maximal k-Plexes in Large Real-World Graphs,WWW'2022,,10.1145/3485447.3512198,,cs.DS cs.AI cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Listing dense subgraphs in large graphs plays a key task in varieties of
network analysis applications like community detection. Clique, as the densest
model, has been widely investigated. However, in practice, communities rarely
form as cliques for various reasons, e.g., data noise. Therefore, $k$-plex, --
graph with each vertex adjacent to all but at most $k$ vertices, is introduced
as a relaxed version of clique. Often, to better simulate cohesive communities,
an emphasis is placed on connected $k$-plexes with small $k$. In this paper, we
continue the research line of listing all maximal $k$-plexes and maximal
$k$-plexes of prescribed size. Our first contribution is algorithm ListPlex
that lists all maximal $k$-plexes in $O^*(\gamma^D)$ time for each constant
$k$, where $\gamma$ is a value related to $k$ but strictly smaller than 2, and
$D$ is the degeneracy of the graph that is far less than the vertex number $n$
in real-word graphs. Compared to the trivial bound of $2^n$, the improvement is
significant, and our bound is better than all previously known results. In
practice, we further use several techniques to accelerate listing $k$-plexes of
a given size, such as structural-based prune rules, cache-efficient data
structures, and parallel techniques. All these together result in a very
practical algorithm. Empirical results show that our approach outperforms the
state-of-the-art solutions by up to orders of magnitude.
","[{'version': 'v1', 'created': 'Thu, 17 Feb 2022 16:25:56 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Feb 2022 03:00:13 GMT'}]",2022-02-22,"[['Wang', 'Zhengren', ''], ['Zhou', 'Yi', ''], ['Xiao', 'Mingyu', ''], ['Khoussainov', 'Bakhadyr', '']]","['Listing maximal k-plexes', 'Graph algorithms', 'Worst-case time guarantee', 'Community detection', 'Parallelization']"
8584,1910.02607,Abeer Alshehri,"Abeer Alshehri (1 and 2) and Tim Miller and Liz Sonenberg ((1) School
  of Computing and Information Systems, University of Melbourne, Victoria,
  Australia (2) Department of Computer Science and Information Systems, King
  Khalid University, Abha, Saudi Arabia)","Modeling Communication of Collaborative Multi-Agent System under
  Epistemic Planning","19 pages, 6 figures, 4 tables Submitted to International Journal of
  Intelligent Systems",Int J Intell Syst. 2021; 1- 22,10.1002/int.22536,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In most multiagent applications, communication is essential among agents to
coordinate their actions, and thus achieve their goal. However, communication
often has a related cost that affects overall system performance. In this
paper, we draw inspiration from studies of epistemic planning to develop a
communication model for agents that allows them to cooperate and make
communication decisions effectively within a planning task. The proposed model
treats a communication process as an action that modifies the epistemic state
of the team. In two simulated tasks, we evaluate whether agents can cooperate
effectively and achieve higher performance using communication protocol modeled
in our epistemic planning framework. Based on an empirical study conducted
using search and rescue tasks with different scenarios, our results show that
the proposed model improved team performance across all scenarios compared with
baseline models.
","[{'version': 'v1', 'created': 'Mon, 7 Oct 2019 04:36:31 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Jul 2021 05:39:08 GMT'}]",2021-07-13,"[['Alshehri', 'Abeer', '', '1 and 2'], ['Miller', 'Tim', ''], ['Sonenberg', 'Liz', '']]","['Epistemic Planning', 'Epistemic Logic', 'Communication Process', 'Multi-agent system', 'TeamPerformance', 'Collaboration', 'Shared Mental Model']"
8585,2210.13399,Camellia Zakaria,"Camellia Zakaria, Pin Sym Foong, Chang Siang Lim, Pavithren V. S.
  Pakianathan, Gerald Huat Choon Koh, Simon Tangi Perrault","Does Mode of Digital Contact Tracing Affect User Willingness to Share
  Information? A Quantitative Study","18 pages, 11 figures, 13 tables","In CHI Conference on Human Factors in Computing Systems, pp. 1-18.
  2022",10.1145/3491102.3517595,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Digital contact tracing can limit the spread of infectious diseases.
Nevertheless, there remain barriers to attaining sufficient adoption. In this
study, we investigate how willingness to participate in contact tracing is
affected by two critical factors: the modes of data collection and the type of
data collected. We conducted a scenario-based survey study among 220
respondents in the United States (U.S.) to understand their perceptions about
contact tracing associated with automated and manual contact tracing methods.
The findings indicate a promising use of smartphones and a combination of
public health officials and medical health records as information sources.
Through a quantitative analysis, we describe how different modalities and
individual demographic factors may affect user compliance in providing four key
pieces of information to contact tracing.
","[{'version': 'v1', 'created': 'Mon, 24 Oct 2022 16:52:28 GMT'}]",2022-10-25,"[['Zakaria', 'Camellia', ''], ['Foong', 'Pin Sym', ''], ['Lim', 'Chang Siang', ''], ['Pakianathan', 'Pavithren V. S.', ''], ['Koh', 'Gerald Huat Choon', ''], ['Perrault', 'Simon Tangi', '']]","['contact tracing', 'pandemic', 'willingness', 'trust', 'public health']"
8586,1908.07985,Royson Lee,"Royson Lee, Stylianos I. Venieris, {\L}ukasz Dudziak, Sourav
  Bhattacharya, Nicholas D. Lane","MobiSR: Efficient On-Device Super-Resolution through Heterogeneous
  Mobile Processors","Accepted at the 25th Annual International Conference on Mobile
  Computing and Networking (MobiCom), 2019",,10.1145/3300061.3345455,,cs.CV cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, convolutional networks have demonstrated unprecedented
performance in the image restoration task of super-resolution (SR). SR entails
the upscaling of a single low-resolution image in order to meet
application-specific image quality demands and plays a key role in mobile
devices. To comply with privacy regulations and reduce the overhead of cloud
computing, executing SR models locally on-device constitutes a key alternative
approach. Nevertheless, the excessive compute and memory requirements of SR
workloads pose a challenge in mapping SR networks on resource-constrained
mobile platforms. This work presents MobiSR, a novel framework for performing
efficient super-resolution on-device. Given a target mobile platform, the
proposed framework considers popular model compression techniques and traverses
the design space to reach the highest performing trade-off between image
quality and processing speed. At run time, a novel scheduler dispatches
incoming image patches to the appropriate model-engine pair based on the
patch's estimated upscaling difficulty in order to meet the required image
quality with minimum processing latency. Quantitative evaluation shows that the
proposed framework yields on-device SR designs that achieve an average speedup
of 2.13x over highly-optimized parallel difficulty-unaware mappings and 4.79x
over highly-optimized single compute engine implementations.
","[{'version': 'v1', 'created': 'Wed, 21 Aug 2019 16:55:08 GMT'}]",2019-08-22,"[['Lee', 'Royson', ''], ['Venieris', 'Stylianos I.', ''], ['Dudziak', 'Łukasz', ''], ['Bhattacharya', 'Sourav', ''], ['Lane', 'Nicholas D.', '']]","['Super-resolution', 'deep neural networks', 'mobile computing', 'heterogeneous computing', 'scheduling']"
8587,2204.03498,Mohammad Hadi,"Mohammad Abdul Hadi, Imam Nur Bani Yusuf, Ferdian Thung, Kien Gia
  Luong, Jiang Lingxiao, Fatemeh H. Fard, David Lo",On the Effectiveness of Pretrained Models for API Learning,"12 pages, 4 figures, ICPC 2022","30th International Conference on Program Comprehension (ICPC '22),
  May 16--17, 2022, Virtual Event, USA}",10.1145/3524610.3527886,,cs.SE cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Developers frequently use APIs to implement certain functionalities, such as
parsing Excel Files, reading and writing text files line by line, etc.
Developers can greatly benefit from automatic API usage sequence generation
based on natural language queries for building applications in a faster and
cleaner manner. Existing approaches utilize information retrieval models to
search for matching API sequences given a query or use RNN-based
encoder-decoder to generate API sequences. As it stands, the first approach
treats queries and API names as bags of words. It lacks deep comprehension of
the semantics of the queries. The latter approach adapts a neural language
model to encode a user query into a fixed-length context vector and generate
API sequences from the context vector.
  We want to understand the effectiveness of recent Pre-trained Transformer
based Models (PTMs) for the API learning task. These PTMs are trained on large
natural language corpora in an unsupervised manner to retain contextual
knowledge about the language and have found success in solving similar Natural
Language Processing (NLP) problems. However, the applicability of PTMs has not
yet been explored for the API sequence generation task. We use a dataset that
contains 7 million annotations collected from GitHub to evaluate the PTMs
empirically. This dataset was also used to assess previous approaches. Based on
our results, PTMs generate more accurate API sequences and outperform other
related methods by around 11%. We have also identified two different
tokenization approaches that can contribute to a significant boost in PTMs'
performance for the API sequence generation task.
","[{'version': 'v1', 'created': 'Tue, 5 Apr 2022 20:33:24 GMT'}]",2022-04-08,"[['Hadi', 'Mohammad Abdul', ''], ['Yusuf', 'Imam Nur Bani', ''], ['Thung', 'Ferdian', ''], ['Luong', 'Kien Gia', ''], ['Lingxiao', 'Jiang', ''], ['Fard', 'Fatemeh H.', ''], ['Lo', 'David', '']]","['API', 'Deep Leaning', 'Transformers', 'code search', 'API sequence', 'APIusage']"
8588,1904.05331,Nitish Nag,"Nitish Nag, Aditya Bharadwaj, Aditya Narendra Rao, Akash Kulhalli,
  Kushal Samir Mehta, Nishant Bhattacharya, Pratul Ramkumar, Dinkar Sitaram,
  Ramesh Jain",Flavour Enhanced Food Recommendation,"In Proceedings of 5th International Workshop on Multimedia Assisted
  Dietary Management, Nice, France, October 21, 2019, MADiMa 2019, 6 pages",,10.1145/3347448.3357169,,cs.SI cs.HC cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a mechanism to use the features of flavour to enhance the quality
of food recommendations. An empirical method to determine the flavour of food
is incorporated into a recommendation engine based on major gustatory nerves.
Such a system has advantages of suggesting food items that the user is more
likely to enjoy based upon matching with their flavour profile through use of
the taste biological domain knowledge. This preliminary intends to spark more
robust mechanisms by which flavour of food is taken into consideration as a
major feature set into food recommendation systems. Our long term vision is to
integrate this with health factors to recommend healthy and tasty food to users
to enhance quality of life.
","[{'version': 'v1', 'created': 'Tue, 2 Apr 2019 02:44:26 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Aug 2019 20:36:12 GMT'}]",2019-08-23,"[['Nag', 'Nitish', ''], ['Bharadwaj', 'Aditya', ''], ['Rao', 'Aditya Narendra', ''], ['Kulhalli', 'Akash', ''], ['Mehta', 'Kushal Samir', ''], ['Bhattacharya', 'Nishant', ''], ['Ramkumar', 'Pratul', ''], ['Sitaram', 'Dinkar', ''], ['Jain', 'Ramesh', '']]","['food computing', 'personal health navigation', 'recommendation systems', 'favor', 'favour', 'taste', 'gustatory media']"
8589,2002.02355,Elaine Wong,"Hao Du, Jing Guo, Ziming Li and Elaine Wong",An Additive Decomposition in S-Primitive Towers,"This article has been submitted to ISSAC2020 for review.
  Supplementary material at https://wongey.github.io/add-decomp-sprimitive/","ISSAC 2020: Proceedings of the 45th International Symposium on
  Symbolic and Algebraic Computation, July 2020, Pages 146-153",10.1145/3373207.3404025,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the additive decomposition problem in primitive towers and
present an algorithm to decompose a function in an S-primitive tower as a sum
of a derivative in the tower and a remainder which is minimal in some sense.
Special instances of S-primitive towers include differential fields generated
by finitely many logarithmic functions and logarithmic integrals. A function in
an S-primitive tower is integrable in the tower if and only if the remainder is
equal to zero. The additive decomposition is achieved by viewing our towers not
as a traditional chain of extension fields, but rather as a direct sum of
certain subrings. Furthermore, we can determine whether or not a function in an
S-primitive tower has an elementary integral without solving any differential
equations. We also show that a kind of S-primitive towers, known as logarithmic
towers, can be embedded into a particular extension where we can obtain a finer
remainder.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2020 17:00:47 GMT'}]",2020-10-20,"[['Du', 'Hao', ''], ['Guo', 'Jing', ''], ['Li', 'Ziming', ''], ['Wong', 'Elaine', '']]","['Additive decomposition', 'Primitive tower', 'Logarithmic tower', 'Symbolic integration', 'Elementary integrability']"
8590,2110.00104,Mordechai Guri,Mordechai Guri,LANTENNA: Exfiltrating Data from Air-Gapped Networks via Ethernet Cables,"Modified version accepted to 2021 IEEE 45th Annual Computers,
  Software, and Applications Conference (COMPSAC), 2021","2021 IEEE 45th Annual Computers, Software, and Applications
  Conference (COMPSAC), 2021, pp. 745-754",10.1109/COMPSAC51774.2021.00106,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Air-gapped networks are wired with Ethernet cables since wireless connections
are strictly prohibited.
  In this paper we present LANTENNA - a new type of electromagnetic attack
allowing adversaries to leak sensitive data from isolated, air-gapped networks.
Malicious code in air-gapped computers gathers sensitive data and then encodes
it over radio waves emanating from the Ethernet cables, using them as antennas.
A nearby receiving device can intercept the signals wirelessly, decode the
data, and send it to the attacker. We discuss the exfiltration techniques,
examine the covert channel characteristics, and provide implementation details.
Notably, the malicious code can run in an ordinary user-mode process and
successfully operate from within a virtual machine. We evaluate the covert
channel in different scenarios and present a set of countermeasures. Our
experiments show that with the LANTENNA attack, data can be exfiltrated from
air-gapped computers to a distance of several meters away.
","[{'version': 'v1', 'created': 'Thu, 30 Sep 2021 22:28:33 GMT'}]",2021-10-04,"[['Guri', 'Mordechai', '']]","['air-gap', 'exfiltration', 'covert channels', 'data leakage', 'Ethernet', 'LAN', 'electromagnetic']"
8591,2009.12488,Ashad Kabir,"Abdul Kawsar Tushar, Muhammad Ashad Kabir, Syed Ishtiaque Ahmed",Mental Health and Sensing,,"Signal processing techniques for computational health informatics,
  2021",10.1007/978-3-030-54932-9_11,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mental health is a global epidemic, affecting close to half a billion people
worldwide. Chronic shortage of resources hamper detection and recovery of
affected people. Effective sensing technologies can help fight the epidemic
through early detection, prediction, and resulting proper treatment. Existing
and novel technologies for sensing mental health state could address the
aforementioned concerns by activating granular tracking of physiological,
behavioral, and social signals pertaining to problems in mental health. Our
paper focuses on the available methods of sensing mental health problems
through direct and indirect measures. We see how active and passive sensing by
technologies as well as reporting from relevant sources can contribute toward
these detection methods. We also see available methods of therapeutic treatment
available through digital means. We highlight a few key intervention
technologies that are being developed by researchers to fight against mental
illness issues.
","[{'version': 'v1', 'created': 'Sat, 26 Sep 2020 00:43:51 GMT'}]",2021-05-27,"[['Tushar', 'Abdul Kawsar', ''], ['Kabir', 'Muhammad Ashad', ''], ['Ahmed', 'Syed Ishtiaque', '']]","['Mental health', 'wearables', 'sensing']"
8592,2204.09795,Jalal Mostafa,"Jalal Mostafa, Sara Wehbi, Suren Chilingaryan, Andreas Kopmann","SciTS: A Benchmark for Time-Series Databases in Scientific Experiments
  and Industrial Internet of Things",,,10.1145/3538712.3538723,,cs.DB astro-ph.IM cs.PF hep-ex,http://creativecommons.org/licenses/by/4.0/,"  Time-series data has an increasingly growing usage in Industrial Internet of
Things (IIoT) and large-scale scientific experiments. Managing time-series data
needs a storage engine that can keep up with their constantly growing volumes
while providing an acceptable query latency. While traditional ACID databases
favor consistency over performance, many time-series databases with novel
storage engines have been developed to provide better ingestion performance and
lower query latency. To understand how the unique design of a time-series
database affects its performance, we design SciTS, a highly extensible and
parameterizable benchmark for time-series data. The benchmark studies the data
ingestion capabilities of time-series databases especially as they grow larger
in size. It also studies the latencies of 5 practical queries from the
scientific experiments use case. We use SciTS to evaluate the performance of 4
databases of 4 distinct storage engines: ClickHouse, InfluxDB, TimescaleDB, and
PostgreSQL.
","[{'version': 'v1', 'created': 'Wed, 20 Apr 2022 21:53:33 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Jun 2022 13:11:42 GMT'}]",2022-06-09,"[['Mostafa', 'Jalal', ''], ['Wehbi', 'Sara', ''], ['Chilingaryan', 'Suren', ''], ['Kopmann', 'Andreas', '']]","['time-series', 'database management systems', 'sensor data', 'time-seriesdatabases', 'scientific experiments', 'industrial internet of things']"
8593,2002.08232,Dmitri Babaev,"Dmitrii Babaev, Ivan Kireev, Nikita Ovsov, Mariya Ivanova, Gleb Gusev,
  Ivan Nazarov, Alexander Tuzhilin",CoLES: Contrastive Learning for Event Sequences with Self-Supervision,SIGMOD'22,,10.1145/3514221.3526129,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the problem of self-supervised learning on discrete event
sequences generated by real-world users. Self-supervised learning incorporates
complex information from the raw data in low-dimensional fixed-length vector
representations that could be easily applied in various downstream machine
learning tasks. In this paper, we propose a new method ""CoLES"", which adapts
contrastive learning, previously used for audio and computer vision domains, to
the discrete event sequences domain in a self-supervised setting. We deployed
CoLES embeddings based on sequences of transactions at the large European
financial services company. Usage of CoLES embeddings significantly improves
the performance of the pre-existing models on downstream tasks and produces
significant financial gains, measured in hundreds of millions of dollars
yearly. We also evaluated CoLES on several public event sequences datasets and
showed that CoLES representations consistently outperform other methods on
different downstream tasks.
","[{'version': 'v1', 'created': 'Wed, 19 Feb 2020 15:15:57 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Jul 2022 10:10:11 GMT'}, {'version': 'v3', 'created': 'Fri, 22 Jul 2022 09:45:55 GMT'}]",2022-07-25,"[['Babaev', 'Dmitrii', ''], ['Kireev', 'Ivan', ''], ['Ovsov', 'Nikita', ''], ['Ivanova', 'Mariya', ''], ['Gusev', 'Gleb', ''], ['Nazarov', 'Ivan', ''], ['Tuzhilin', 'Alexander', '']]","['representation learning', 'metric learning', 'contrastive learning', 'selfsupervised learning', 'event sequences', 'data management']"
8594,1906.10762,Lukas Daniel Klausner,"Tobias Dam and Lukas Daniel Klausner and Damjan Buhov and Sebastian
  Schrittwieser",Large-Scale Analysis of Pop-Up Scam on Typosquatting URLs,"9 pages, 11 figures","Proceedings of the 14th International Conference on Availability,
  Reliability and Security (ARES 2019), 2019, 53:1-53:9",10.1145/3339252.3340332,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today, many different types of scams can be found on the internet. Online
criminals are always finding new creative ways to trick internet users, be it
in the form of lottery scams, downloading scam apps for smartphones or fake
gambling websites. This paper presents a large-scale study on one particular
delivery method of online scam: pop-up scam on typosquatting domains.
Typosquatting describes the concept of registering domains which are very
similar to existing ones while deliberately containing common typing errors;
these domains are then used to trick online users while under the belief of
browsing the intended website. Pop-up scam uses JavaScript alert boxes to
present a message which attracts the user's attention very effectively, as they
are a blocking user interface element.
  Our study among typosquatting domains derived from the Alexa Top 1 Million
list revealed on 8255 distinct typosquatting URLs a total of 9857 pop-up
messages, out of which 8828 were malicious. The vast majority of those distinct
URLs (7176) were targeted and displayed pop-up messages to one specific HTTP
user agent only. Based on our scans, we present an in-depth analysis as well as
a detailed classification of different targeting parameters (user agent and
language) which triggered varying kinds of pop-up scams.
","[{'version': 'v1', 'created': 'Tue, 25 Jun 2019 21:12:26 GMT'}]",2020-01-22,"[['Dam', 'Tobias', ''], ['Klausner', 'Lukas Daniel', ''], ['Buhov', 'Damjan', ''], ['Schrittwieser', 'Sebastian', '']]","['phishing', 'typosquatting', 'scam', 'web security']"
8595,2201.12184,Math\'e Zeegers,"Math\'e T. Zeegers, Tristan van Leeuwen, Dani\""el M. Pelt, Sophia
  Bethany Coban, Robert van Liere, Kees Joost Batenburg","A tomographic workflow to enable deep learning for X-ray based foreign
  object detection","This paper is under consideration at Expert Systems with
  Applications. 22 pages, 15 figures",Expert Systems with Applications 206 (2022) 117768,10.1016/j.eswa.2022.117768,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detection of unwanted (`foreign') objects within products is a common
procedure in many branches of industry for maintaining production quality.
X-ray imaging is a fast, non-invasive and widely applicable method for foreign
object detection. Deep learning has recently emerged as a powerful approach for
recognizing patterns in radiographs (i.e., X-ray images), enabling automated
X-ray based foreign object detection. However, these methods require a large
number of training examples and manual annotation of these examples is a
subjective and laborious task. In this work, we propose a Computed Tomography
(CT) based method for producing training data for supervised learning of
foreign object detection, with minimal labour requirements. In our approach, a
few representative objects are CT scanned and reconstructed in 3D. The
radiographs that have been acquired as part of the CT-scan data serve as input
for the machine learning method. High-quality ground truth locations of the
foreign objects are obtained through accurate 3D reconstructions and
segmentations. Using these segmented volumes, corresponding 2D segmentations
are obtained by creating virtual projections. We outline the benefits of
objectively and reproducibly generating training data in this way compared to
conventional radiograph annotation. In addition, we show how the accuracy
depends on the number of objects used for the CT reconstructions. The results
show that in this workflow generally only a relatively small number of
representative objects (i.e., fewer than 10) are needed to achieve adequate
detection performance in an industrial setting. Moreover, for real experimental
data we show that the workflow leads to higher foreign object detection
accuracies than with standard radiograph annotation.
","[{'version': 'v1', 'created': 'Fri, 28 Jan 2022 15:33:20 GMT'}]",2022-08-19,"[['Zeegers', 'Mathé T.', ''], ['van Leeuwen', 'Tristan', ''], ['Pelt', 'Daniël M.', ''], ['Coban', 'Sophia Bethany', ''], ['van Liere', 'Robert', ''], ['Batenburg', 'Kees Joost', '']]","['X-ray Imaging', 'Foreign Object Detection', 'Segmentation', 'Computed Tomography', 'MachineLearning', 'Deep Learning']"
8596,2009.02657,Zheng Gao,"Zheng Gao, Chun Guo, Xiaozhong Liu",Efficient Personalized Community Detection via Genetic Evolution,"9 pages, 4 figures",GECCO 2020,10.1145/3321707.3321711,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Personalized community detection aims to generate communities associated with
user need on graphs, which benefits many downstream tasks such as node
recommendation and link prediction for users, etc. It is of great importance
but lack of enough attention in previous studies which are on topics of
user-independent, semi-supervised, or top-K user-centric community detection.
Meanwhile, most of their models are time consuming due to the complex graph
structure. Different from these topics, personalized community detection
requires to provide higher-resolution partition on nodes that are more relevant
to user need while coarser manner partition on the remaining less relevant
nodes. In this paper, to solve this task in an efficient way, we propose a
genetic model including an offline and an online step. In the offline step, the
user-independent community structure is encoded as a binary tree. And
subsequently an online genetic pruning step is applied to partition the tree
into communities. To accelerate the speed, we also deploy a distributed version
of our model to run under parallel environment. Extensive experiments on
multiple datasets show that our model outperforms the state-of-arts with
significantly reduced running time.
","[{'version': 'v1', 'created': 'Sun, 6 Sep 2020 06:59:12 GMT'}]",2020-09-08,"[['Gao', 'Zheng', ''], ['Guo', 'Chun', ''], ['Liu', 'Xiaozhong', '']]","['Personalized community detection', 'Graph mining', 'Network analysis', 'Genetic programming']"
8597,2204.02728,Thomas Baudel,Thomas Baudel,"Co-constructing Shared Values and Ethical Practice for the Next
  Generation: Lessons Learned from a Curriculum on Information Ethics","21 pages, 7 figures, Book Chapter","In: Bounfour, A. (eds) Platforms and Artificial Intelligence.
  Progress in IS. Springer, Cham. 2022",10.1007/978-3-030-90192-9_14,,cs.HC cs.CY,http://creativecommons.org/licenses/by-sa/4.0/,"  We present the motivation, design, outline, and lessons learned from an
online course in scientific integrity, research ethics, and information ethics
provided to over 2000 doctoral and engineering students in STEM fields, first
at the University Paris-Saclay, and now expanded to an online MOOC available to
students across the world, in English. Unlike a course in scientific domains,
meant to provide students with methods, tools, and concepts they can apply in
their future career, the goal of such a training is not so much to equip them,
but to make them aware of the impact of their work on society, care about the
responsibilities that befall on them, and make them realize not all share the
same opinions on how should technology imprint society. While we provide
conceptual tools, this is more to sustain interest and engage students. We want
them to debate on concrete ethical issues and realize the difficulty of
reconciling positions on contemporary dilemma such as dematerialized
intellectual property, freedom of expression online and its counterparts, the
protection of our digital selves, the management of algorithmic decision, the
control of autonomous systems, and the resolution of the digital divide. As a
bold shortcut, our course is about introducing and motivating Hegelian
dialectics in STEM curricula, usually more bent on an Aristotelian perspective.
","[{'version': 'v1', 'created': 'Wed, 6 Apr 2022 11:09:23 GMT'}]",2022-04-07,"[['Baudel', 'Thomas', '']]","['Information Ethics', 'Computer Ethics', 'AI Ethics', 'Computer Science Curriculum', 'Computer Engineering Curriculum']"
8598,2111.03350,Masato Kikuchi,"Masato Kikuchi and Mitsuo Yoshida and Kyoji Umemura and Tadachika
  Ozono","Feature Selective Likelihood Ratio Estimator for Low- and Zero-frequency
  N-grams","The 2021 International Conference on Advanced Informatics: Concepts,
  Theory and Applications (ICAICTA 2021)",,10.1109/ICAICTA53211.2021.9640293,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In natural language processing (NLP), the likelihood ratios (LRs) of N-grams
are often estimated from the frequency information. However, a corpus contains
only a fraction of the possible N-grams, and most of them occur infrequently.
Hence, we desire an LR estimator for low- and zero-frequency N-grams. One way
to achieve this is to decompose the N-grams into discrete values, such as
letters and words, and take the product of the LRs for the values. However,
because this method deals with a large number of discrete values, the running
time and memory usage for estimation are problematic. Moreover, use of
unnecessary discrete values causes deterioration of the estimation accuracy.
Therefore, this paper proposes combining the aforementioned method with the
feature selection method used in document classification, and shows that our
estimator provides effective and efficient estimation results for low- and
zero-frequency N-grams.
","[{'version': 'v1', 'created': 'Fri, 5 Nov 2021 09:38:43 GMT'}]",2022-04-15,"[['Kikuchi', 'Masato', ''], ['Yoshida', 'Mitsuo', ''], ['Umemura', 'Kyoji', ''], ['Ozono', 'Tadachika', '']]","['likelihoodratioestimation', 'low-frequency', 'zerofrequency', 'N-gram', 'feature selection']"
8599,1904.10128,Peng Gao,"Peng Gao, Ruyue Yuan, Fei Wang, Liyi Xiao, Hamido Fujita, Yan Zhang","Siamese Attentional Keypoint Network for High Performance Visual
  Tracking",Accepted by Knowledge-Based SYSTEMS,,10.1016/j.knosys.2019.105448,,cs.CV cs.AI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate the impacts of three main aspects of visual
tracking, i.e., the backbone network, the attentional mechanism, and the
detection component, and propose a Siamese Attentional Keypoint Network, dubbed
SATIN, for efficient tracking and accurate localization. Firstly, a new Siamese
lightweight hourglass network is specially designed for visual tracking. It
takes advantage of the benefits of the repeated bottom-up and top-down
inference to capture more global and local contextual information at multiple
scales. Secondly, a novel cross-attentional module is utilized to leverage both
channel-wise and spatial intermediate attentional information, which can
enhance both discriminative and localization capabilities of feature maps.
Thirdly, a keypoints detection approach is invented to trace any target object
by detecting the top-left corner point, the centroid point, and the
bottom-right corner point of its bounding box. Therefore, our SATIN tracker not
only has a strong capability to learn more effective object representations,
but also is computational and memory storage efficiency, either during the
training or testing stages. To the best of our knowledge, we are the first to
propose this approach. Without bells and whistles, experimental results
demonstrate that our approach achieves state-of-the-art performance on several
recent benchmark datasets, at a speed far exceeding 27 frames per second.
","[{'version': 'v1', 'created': 'Tue, 23 Apr 2019 03:02:34 GMT'}, {'version': 'v2', 'created': 'Sun, 29 Dec 2019 03:03:41 GMT'}]",2020-01-01,"[['Gao', 'Peng', ''], ['Yuan', 'Ruyue', ''], ['Wang', 'Fei', ''], ['Xiao', 'Liyi', ''], ['Fujita', 'Hamido', ''], ['Zhang', 'Yan', '']]","['Visual tracking', 'Siamese hourglass networks', 'cross-attentional module', 'keypointdetection']"
8600,2110.08068,Peter Nightingale,"Miquel Bofill and Jordi Coll and Peter Nightingale and Josep Suy and
  Felix Ulrich-Oltean and Mateu Villaret","SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One
  Constraints",,,10.1016/j.artint.2021.103604,,cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  When solving a combinatorial problem using propositional satisfiability
(SAT), the encoding of the problem is of vital importance. We study encodings
of Pseudo-Boolean (PB) constraints, a common type of arithmetic constraint that
appears in a wide variety of combinatorial problems such as timetabling,
scheduling, and resource allocation. In some cases PB constraints occur
together with at-most-one (AMO) constraints over subsets of their variables
(forming PB(AMO) constraints). Recent work has shown that taking account of
AMOs when encoding PB constraints using decision diagrams can produce a
dramatic improvement in solver efficiency. In this paper we extend the approach
to other state-of-the-art encodings of PB constraints, developing several new
encodings for PB(AMO) constraints. Also, we present a more compact and
efficient version of the popular Generalized Totalizer encoding, named Reduced
Generalized Totalizer. This new encoding is also adapted for PB(AMO)
constraints for a further gain. Our experiments show that the encodings of
PB(AMO) constraints can be substantially smaller than those of PB constraints.
PB(AMO) encodings allow many more instances to be solved within a time limit,
and solving time is improved by more than one order of magnitude in some cases.
We also observed that there is no single overall winner among the considered
encodings, but efficiency of each encoding may depend on PB(AMO)
characteristics such as the magnitude of coefficient values.
","[{'version': 'v1', 'created': 'Fri, 15 Oct 2021 12:53:01 GMT'}]",2021-10-18,"[['Bofill', 'Miquel', ''], ['Coll', 'Jordi', ''], ['Nightingale', 'Peter', ''], ['Suy', 'Josep', ''], ['Ulrich-Oltean', 'Felix', ''], ['Villaret', 'Mateu', '']]","['pseudo-Boolean constraints', 'encoding', 'at-most-one constraints', 'SAT']"
8601,2009.14606,Katharina Rombach,"Katharina Rombach, Gabriel Michau and Olga Fink","Improving Generalization of Deep Fault Detection Models in the Presence
  of Mislabeled Data","12 pages, 3 figures, 5 tables",,10.1109/SMC42975.2020.9283002,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mislabeled samples are ubiquitous in real-world datasets as rule-based or
expert labeling is usually based on incorrect assumptions or subject to biased
opinions. Neural networks can ""memorize"" these mislabeled samples and, as a
result, exhibit poor generalization. This poses a critical issue in fault
detection applications, where not only the training but also the validation
datasets are prone to contain mislabeled samples. In this work, we propose a
novel two-step framework for robust training with label noise. In the first
step, we identify outliers (including the mislabeled samples) based on the
update in the hypothesis space. In the second step, we propose different
approaches to modifying the training data based on the identified outliers and
a data augmentation technique. Contrary to previous approaches, we aim at
finding a robust solution that is suitable for real-world applications, such as
fault detection, where no clean, ""noise-free"" validation dataset is available.
Under an approximate assumption about the upper limit of the label noise, we
significantly improve the generalization ability of the model trained under
massive label noise.
","[{'version': 'v1', 'created': 'Wed, 30 Sep 2020 12:33:25 GMT'}]",2021-11-24,"[['Rombach', 'Katharina', ''], ['Michau', 'Gabriel', ''], ['Fink', 'Olga', '']]","['fault detection', 'label noise', 'generalization', 'deep neural networks', 'mixup']"
8602,2101.02968,Tim Raez,"Tim R\""az",Group Fairness: Independence Revisited,Accepted for publication at ACM FAccT 2021,,10.1145/3442188.3445876,,cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper critically examines arguments against independence, a measure of
group fairness also known as statistical parity and as demographic parity. In
recent discussions of fairness in computer science, some have maintained that
independence is not a suitable measure of group fairness. This position is at
least partially based on two influential papers (Dwork et al., 2012, Hardt et
al., 2016) that provide arguments against independence. We revisit these
arguments, and we find that the case against independence is rather weak. We
also give arguments in favor of independence, showing that it plays a
distinctive role in considerations of fairness. Finally, we discuss how to
balance different fairness considerations.
","[{'version': 'v1', 'created': 'Fri, 8 Jan 2021 11:37:41 GMT'}]",2021-01-11,"[['Räz', 'Tim', '']]","['fairness', 'independence', 'statistical parity', 'demographic parity', 'sufficiency', 'separation', 'affirmative action', 'accuracy']"
8603,1912.07848,Usman A. Fiaz,"Usman A. Fiaz, John S. Baras","Fast, Composable Rescue Mission Planning for UAVs using Metric Temporal
  Logic","Published as a conference paper at the IFAC World Congress 2020.
  arXiv admin note: substantial text overlap with arXiv:1904.03830","IFAC-PapersOnLine, Volume 53, Issue 2, 2020, Pages 15404-15411",10.1016/j.ifacol.2020.12.2361,,cs.RO cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a hybrid compositional approach for real-time mission planning for
multi-rotor unmanned aerial vehicles (UAVs) in a time critical search and
rescue scenario. Starting with a known environment, we specify the mission
using Metric Temporal Logic (MTL) and use a hybrid dynamical model to capture
the various modes of UAV operation. We then divide the mission into several
sub-tasks by exploiting the invariant nature of safety and timing constraints
along the way, and the different modes (i.e., dynamics) of the UAV. For each
sub-task, we translate the MTL specifications into linear constraints and solve
the associated optimal control problem for desired path, using a Mixed Integer
Linear Program (MILP) solver. The complete path for the mission is constructed
recursively by composing the individual optimal sub-paths. We show by
simulations that the resulting suboptimal trajectories satisfy the mission
specifications, and the proposed approach leads to significant reduction in
computational complexity of the problem, making it possible to implement in
real-time. Our proposed method ensures the safety of UAVs at all times and
guarantees finite time mission completion. It is also shown that our approach
scales up nicely for a large number of UAVs.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2019 07:15:42 GMT'}, {'version': 'v2', 'created': 'Tue, 5 May 2020 16:56:21 GMT'}, {'version': 'v3', 'created': 'Mon, 28 Sep 2020 21:57:46 GMT'}]",2021-04-19,"[['Fiaz', 'Usman A.', ''], ['Baras', 'John S.', '']]","['Flying robots', 'mission planning and decision making', 'safety', 'trajectory and pathplanning', 'optimal control of hybrid systems']"
8604,1905.10683,Hao Yin,"Hao Yin, Austin R. Benson, Johan Ugander",Measuring Directed Triadic Closure with Closure Coefficients,,Net Sci 8 (2020) 551-573,10.1017/nws.2020.20,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent work studying triadic closure in undirected graphs has drawn attention
to the distinction between measures that focus on the ""center"" node of a wedge
(i.e., length-2 path) vs. measures that focus on the ""initiator,"" a distinction
with considerable consequences. Existing measures in directed graphs,
meanwhile, have all been center-focused. In this work, we propose a family of
eight directed closure coefficients that measure the frequency of triadic
closure in directed graphs from the perspective of the node initiating closure.
The eight coefficients correspond to different labelled wedges, where the
initiator and center nodes are labelled, and we observe dramatic empirical
variation in these coefficients on real-world networks, even in cases when the
induced directed triangles are isomorphic. To understand this phenomenon, we
examine the theoretical behavior of our closure coefficients under a directed
configuration model. Our analysis illustrates an underlying connection between
the closure coefficients and moments of the joint in- and out-degree
distributions of the network, offering an explanation of the observed
asymmetries. We also use our directed closure coefficients as predictors in two
machine learning tasks. We find interpretable models with AUC scores above 0.92
in class-balanced binary prediction, substantially outperforming models that
use traditional center-focused measures.
","[{'version': 'v1', 'created': 'Sat, 25 May 2019 21:49:15 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Feb 2020 16:16:31 GMT'}]",2020-10-14,"[['Yin', 'Hao', ''], ['Benson', 'Austin R.', ''], ['Ugander', 'Johan', '']]","['directed networks', 'triadic closure', 'closure coefficients', 'configuration model']"
8605,2106.02921,Mikhail Jacob,"Mikhail Jacob, Brian Magerko","Empirically Evaluating Creative Arc Negotiation for Improvisational
  Decision-making","10 pages, 5 figures, 8 tables, accepted to ACM Creativity & Cognition
  2021, Best Paper Award",,10.1145/3450741.3465263,,cs.AI cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Action selection from many options with few constraints is crucial for
improvisation and co-creativity. Our previous work proposed creative arc
negotiation to solve this problem, i.e., selecting actions to follow an
author-defined `creative arc' or trajectory over estimates of novelty,
unexpectedness, and quality for potential actions. The CARNIVAL agent
architecture demonstrated this approach for playing the Props game from improv
theatre in the Robot Improv Circus installation. This article evaluates the
creative arc negotiation experience with CARNIVAL through two crowdsourced
observer studies and one improviser laboratory study. The studies focus on
subjects' ability to identify creative arcs in performance and their preference
for creative arc negotiation compared to a random selection baseline. Our
results show empirically that observers successfully identified creative arcs
in performances. Both groups also preferred creative arc negotiation in agent
creativity and logical coherence, while observers enjoyed it more too.
","[{'version': 'v1', 'created': 'Sat, 5 Jun 2021 15:20:36 GMT'}]",2021-06-08,"[['Jacob', 'Mikhail', ''], ['Magerko', 'Brian', '']]","['human-AI improvisation', 'empirical evaluation', 'improvisational theatre', 'interactive installation']"
8606,2104.04268,Xiquan Guan,"Xiquan Guan, Huamin Feng, Weiming Zhang, Hang Zhou, Jie Zhang, and
  Nenghai Yu","Reversible Watermarking in Deep Convolutional Neural Networks for
  Integrity Authentication",Accepted to ACM MM 2020,,10.1145/3394171.3413729,,cs.CR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep convolutional neural networks have made outstanding contributions in
many fields such as computer vision in the past few years and many researchers
published well-trained network for downloading. But recent studies have shown
serious concerns about integrity due to model-reuse attacks and backdoor
attacks. In order to protect these open-source networks, many algorithms have
been proposed such as watermarking. However, these existing algorithms modify
the contents of the network permanently and are not suitable for integrity
authentication. In this paper, we propose a reversible watermarking algorithm
for integrity authentication. Specifically, we present the reversible
watermarking problem of deep convolutional neural networks and utilize the
pruning theory of model compression technology to construct a host sequence
used for embedding watermarking information by histogram shift. As shown in the
experiments, the influence of embedding reversible watermarking on the
classification performance is less than 0.5% and the parameters of the model
can be fully recovered after extracting the watermarking. At the same time, the
integrity of the model can be verified by applying the reversible watermarking:
if the model is modified illegally, the authentication information generated by
original model will be absolutely different from the extracted watermarking
information.
","[{'version': 'v1', 'created': 'Fri, 9 Apr 2021 09:32:21 GMT'}]",2021-04-12,"[['Guan', 'Xiquan', ''], ['Feng', 'Huamin', ''], ['Zhang', 'Weiming', ''], ['Zhou', 'Hang', ''], ['Zhang', 'Jie', ''], ['Yu', 'Nenghai', '']]","['Reversible watermarking', 'Convolutional neural networks', 'Security', 'Integrity authentication']"
8607,2210.06316,Kotaro Funakoshi,Kotaro Funakoshi,"Non-Axiomatic Term Logic: A Computational Theory of Cognitive Symbolic
  Reasoning",,,10.1527/tjsai.37-6_C-M11,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents Non-Axiomatic Term Logic (NATL) as a theoretical
computational framework of humanlike symbolic reasoning in artificial
intelligence. NATL unites a discrete syntactic system inspired from Aristotle's
term logic and a continuous semantic system based on the modern idea of
distributed representations, or embeddings. This paper positions the proposed
approach in the phylogeny and the literature of logic, and explains the
framework. As it is yet no more than a theory and it requires much further
elaboration to implement it, no quantitative evaluation is presented. Instead,
qualitative analyses of arguments using NATL, some applications to possible
cognitive science/robotics-related research, and remaining issues towards a
machinery implementation are discussed.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2022 15:31:35 GMT'}]",2022-11-23,"[['Funakoshi', 'Kotaro', '']]","['argumentation', 'creativity', 'neuro-symbolic reasoning', 'artificial general intelligence']"
8608,2004.14171,Gengchen Mai,"Gengchen Mai, Krzysztof Janowicz, Ling Cai, Rui Zhu, Blake Regalia, Bo
  Yan, Meilin Shi, Ni Lao","SE-KGE: A Location-Aware Knowledge Graph Embedding Model for Geographic
  Question Answering and Spatial Semantic Lifting",Accepted to Transactions in GIS,"Transactions in GIS, 2020",10.1111/TGIS.12629,,cs.DB cs.AI cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning knowledge graph (KG) embeddings is an emerging technique for a
variety of downstream tasks such as summarization, link prediction, information
retrieval, and question answering. However, most existing KG embedding models
neglect space and, therefore, do not perform well when applied to (geo)spatial
data and tasks. For those models that consider space, most of them primarily
rely on some notions of distance. These models suffer from higher computational
complexity during training while still losing information beyond the relative
distance between entities. In this work, we propose a location-aware KG
embedding model called SE-KGE. It directly encodes spatial information such as
point coordinates or bounding boxes of geographic entities into the KG
embedding space. The resulting model is capable of handling different types of
spatial reasoning. We also construct a geographic knowledge graph as well as a
set of geographic query-answer pairs called DBGeo to evaluate the performance
of SE-KGE in comparison to multiple baselines. Evaluation results show that
SE-KGE outperforms these baselines on the DBGeo dataset for geographic logic
query answering task. This demonstrates the effectiveness of our
spatially-explicit model and the importance of considering the scale of
different geographic entities. Finally, we introduce a novel downstream task
called spatial semantic lifting which links an arbitrary location in the study
area to entities in the KG via some relations. Evaluation on DBGeo shows that
our model outperforms the baseline by a substantial margin.
","[{'version': 'v1', 'created': 'Sat, 25 Apr 2020 17:46:31 GMT'}]",2020-04-30,"[['Mai', 'Gengchen', ''], ['Janowicz', 'Krzysztof', ''], ['Cai', 'Ling', ''], ['Zhu', 'Rui', ''], ['Regalia', 'Blake', ''], ['Yan', 'Bo', ''], ['Shi', 'Meilin', ''], ['Lao', 'Ni', '']]","['Knowledge Graph Embedding', 'Location Encoding', 'Spatially Explicit Model', 'Geographic Question Answering', 'Spatial Semantic Lifting']"
8609,2006.01967,Jiabao Wang,"Jiabao Wang, Yang Li, Shanshan Jiao, Zhuang Miao, Rui Zhang",Grafted network for person re-identification,,Signal Processing: Image Communication 80(2020)115674,10.1016/j.image.2019.115674,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convolutional neural networks have shown outstanding effectiveness in person
re-identification (re-ID). However, the models always have large number of
parameters and much computation for mobile application. In order to relieve
this problem, we propose a novel grafted network (GraftedNet), which is
designed by grafting a high-accuracy rootstock and a light-weighted scion. The
rootstock is based on the former parts of ResNet-50 to provide a strong
baseline, while the scion is a new designed module, composed of the latter
parts of SqueezeNet, to compress the parameters. To extract more discriminative
feature representation, a joint multi-level and part-based feature is proposed.
In addition, to train GraftedNet efficiently, we propose an accompanying
learning method, by adding an accompanying branch to train the model in
training and removing it in testing for saving parameters and computation. On
three public person re-ID benchmarks (Market1501, DukeMTMC-reID and CUHK03),
the effectiveness of GraftedNet are evaluated and its components are analyzed.
Experimental results show that the proposed GraftedNet achieves 93.02%, 85.3%
and 76.2% in Rank-1 and 81.6%, 74.7% and 71.6% in mAP, with only 4.6M
parameters.
","[{'version': 'v1', 'created': 'Tue, 2 Jun 2020 22:33:44 GMT'}, {'version': 'v2', 'created': 'Sat, 6 Jun 2020 05:25:28 GMT'}]",2020-06-09,"[['Wang', 'Jiabao', ''], ['Li', 'Yang', ''], ['Jiao', 'Shanshan', ''], ['Miao', 'Zhuang', ''], ['Zhang', 'Rui', '']]","['person re-identification', 'feature representation', 'multi-level feature', 'part-based feature', 'grafting']"
8610,2202.13303,Mariam Guizani,"Mariam Guizani, Igor Steinmacher, Jillian Emard, Abrar Fallatah,
  Margaret Burnett, Anita Sarma","How to Debug Inclusivity Bugs? A Debugging Process with Information
  Architecture","12 pages, Accepted at ICSE SEIS 2022",,10.1145/3510458.3513009,,cs.SE cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although some previous research has found ways to find inclusivity bugs
(biases in software that introduce inequities), little attention has been paid
to how to go about fixing such bugs. Without a process to move from finding to
fixing, acting upon such findings is an ad-hoc activity, at the mercy of the
skills of each individual developer. To address this gap, we created
Why/Where/Fix, a systematic inclusivity debugging process whose inclusivity
fault localization harnesses Information Architecture(IA) -- the way
user-facing information is organized, structured and labeled. We then conducted
a multi-stage qualitative empirical evaluation of the effectiveness of
Why/Where/Fix, using an Open Source Software (OSS) project's infrastructure as
our setting. In our study, the OSS project team used the Why/Where/Fix process
to find inclusivity bugs, localize the IA faults behind them, and then fix the
IA to remove the inclusivity bugs they had found. Our results showed that using
Why/Where/Fix reduced the number of inclusivity bugs that OSS newcomer
participants experienced by 90%.
","[{'version': 'v1', 'created': 'Sun, 27 Feb 2022 06:58:26 GMT'}]",2022-03-01,"[['Guizani', 'Mariam', ''], ['Steinmacher', 'Igor', ''], ['Emard', 'Jillian', ''], ['Fallatah', 'Abrar', ''], ['Burnett', 'Margaret', ''], ['Sarma', 'Anita', '']]","['Diversity', 'Information Architecture', 'Open Source', 'Inclusivity Bugs']"
8611,1508.06121,Vitaly Perevoshchikov,Vitaly Perevoshchikov,Weight Assignment Logic,This is the full version of the paper published at DLT 2015,"DLT 2015. LNCS, vol. 9168, pp. 413-425. Springer (2015)",10.1007/978-3-319-21500-6_33,,cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a weight assignment logic for reasoning about quantitative
languages of infinite words. This logic is an extension of the classical MSO
logic and permits to describe quantitative properties of systems with multiple
weight parameters, e.g., the ratio between rewards and costs. We show that this
logic is expressively equivalent to unambiguous weighted B\""uchi automata. We
also consider an extension of weight assignment logic which is expressively
equivalent to nondeterministic weighted B\""uchi automata.
","[{'version': 'v1', 'created': 'Tue, 25 Aug 2015 11:57:31 GMT'}]",2015-08-26,"[['Perevoshchikov', 'Vitaly', '']]","['quantitative omega-languages', 'quantitative logic', 'multi-weightedautomata', 'B¨uchi automata', 'unambiguous automata']"
8612,2110.06288,Felix Gervits,"Felix Gervits, Gordon Briggs, Antonio Roque, Genki A. Kadomatsu, Dean
  Thurston, Matthias Scheutz, Matthew Marge","Decision-Theoretic Question Generation for Situated Reference
  Resolution: An Empirical Study and Computational Model","To be published in the proceedings of the 23rd ACM International
  Conference on Multimodal Interaction (ICMI) 2021",,10.1145/3462244.3479925,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dialogue agents that interact with humans in situated environments need to
manage referential ambiguity across multiple modalities and ask for help as
needed. However, it is not clear what kinds of questions such agents should ask
nor how the answers to such questions can be used to resolve ambiguity. To
address this, we analyzed dialogue data from an interactive study in which
participants controlled a virtual robot tasked with organizing a set of tools
while engaging in dialogue with a live, remote experimenter. We discovered a
number of novel results, including the distribution of question types used to
resolve ambiguity and the influence of dialogue-level factors on the reference
resolution process. Based on these empirical findings we: (1) developed a
computational model for clarification requests using a decision network with an
entropy-based utility assignment method that operates across modalities, (2)
evaluated the model, showing that it outperforms a slot-filling baseline in
environments of varying ambiguity, and (3) interpreted the results to offer
insight into the ways that agents can ask questions to facilitate situated
reference resolution.
","[{'version': 'v1', 'created': 'Tue, 12 Oct 2021 19:23:25 GMT'}]",2021-10-14,"[['Gervits', 'Felix', ''], ['Briggs', 'Gordon', ''], ['Roque', 'Antonio', ''], ['Kadomatsu', 'Genki A.', ''], ['Thurston', 'Dean', ''], ['Scheutz', 'Matthias', ''], ['Marge', 'Matthew', '']]","['human-agent dialogue', 'situated interaction', 'reference resolution']"
8613,cs/0507039,Joel Predd,Joel B. Predd and Sanjeev R. Kulkarni and H. Vincent Poor,"Distributed Regression in Sensor Networks: Training Distributively with
  Alternating Projections","To appear in the Proceedings of the SPIE Conference on Advanced
  Signal Processing Algorithms, Architectures and Implementations XV, San
  Diego, CA, July 31 - August 4, 2005",,10.1117/12.620194,,cs.LG cs.AI cs.CV cs.DC cs.IT math.IT,,"  Wireless sensor networks (WSNs) have attracted considerable attention in
recent years and motivate a host of new challenges for distributed signal
processing. The problem of distributed or decentralized estimation has often
been considered in the context of parametric models. However, the success of
parametric methods is limited by the appropriateness of the strong statistical
assumptions made by the models. In this paper, a more flexible nonparametric
model for distributed regression is considered that is applicable in a variety
of WSN applications including field estimation. Here, starting with the
standard regularized kernel least-squares estimator, a message-passing
algorithm for distributed estimation in WSNs is derived. The algorithm can be
viewed as an instantiation of the successive orthogonal projection (SOP)
algorithm. Various practical aspects of the algorithm are discussed and several
numerical simulations validate the potential of the approach.
","[{'version': 'v1', 'created': 'Mon, 18 Jul 2005 00:45:12 GMT'}]",2009-11-11,"[['Predd', 'Joel B.', ''], ['Kulkarni', 'Sanjeev R.', ''], ['Poor', 'H. Vincent', '']]","['wireless sensor networks', 'distributed estimation', 'regression', 'alternating projections', 'kernel methods', 'distributed learning', 'nonparametric']"
8614,2110.02007,Yen-Chia Hsu,"Yen-Chia Hsu, Ting-Hao 'Kenneth' Huang, Himanshu Verma, Andrea Mauri,
  Illah Nourbakhsh, Alessandro Bozzon",Empowering Local Communities Using Artificial Intelligence,This manuscript is peer-reviewed and accepted by the Patterns journal,,10.1016/j.patter.2022.100449,,cs.AI cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Artificial Intelligence (AI) is increasingly used to analyze large amounts of
data in various practices, such as object recognition. We are specifically
interested in using AI-powered systems to engage local communities in
developing plans or solutions for pressing societal and environmental concerns.
Such local contexts often involve multiple stakeholders with different and even
contradictory agendas, resulting in mismatched expectations of these systems'
behaviors and desired outcomes. There is a need to investigate if AI models and
pipelines can work as expected in different contexts through co-creation and
field deployment. Based on case studies in co-creating AI-powered systems with
local people, we explain challenges that require more attention and provide
viable paths to bridge AI research with citizen needs. We advocate for
developing new collaboration approaches and mindsets that are needed to
co-create AI-powered systems in multi-stakeholder contexts to address local
concerns.
","[{'version': 'v1', 'created': 'Tue, 5 Oct 2021 12:51:11 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Jan 2022 18:39:17 GMT'}, {'version': 'v3', 'created': 'Tue, 26 Apr 2022 11:03:03 GMT'}]",2022-04-27,"[['Hsu', 'Yen-Chia', ''], ['Huang', ""Ting-Hao 'Kenneth'"", ''], ['Verma', 'Himanshu', ''], ['Mauri', 'Andrea', ''], ['Nourbakhsh', 'Illah', ''], ['Bozzon', 'Alessandro', '']]","['Artificial Intelligence', 'Community Citizen Science', 'Community Empowerment', 'Human-ComputerInteraction', 'Social Impact', 'Sustainability', 'Applied Research']"
8615,1707.01477,Michael Veale,"Reuben Binns, Michael Veale, Max Van Kleek, Nigel Shadbolt","Like trainer, like bot? Inheritance of bias in algorithmic content
  moderation","12 pages, 3 figures, 9th International Conference on Social
  Informatics (SocInfo 2017), Oxford, UK, 13--15 September 2017 (forthcoming in
  Springer Lecture Notes in Computer Science)",,10.1007/978-3-319-67256-4_32,,cs.CY cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The internet has become a central medium through which `networked publics'
express their opinions and engage in debate. Offensive comments and personal
attacks can inhibit participation in these spaces. Automated content moderation
aims to overcome this problem using machine learning classifiers trained on
large corpora of texts manually annotated for offence. While such systems could
help encourage more civil debate, they must navigate inherently normatively
contestable boundaries, and are subject to the idiosyncratic norms of the human
raters who provide the training data. An important objective for platforms
implementing such measures might be to ensure that they are not unduly biased
towards or against particular norms of offence. This paper provides some
exploratory methods by which the normative biases of algorithmic content
moderation systems can be measured, by way of a case study using an existing
dataset of comments labelled for offence. We train classifiers on comments
labelled by different demographic subsets (men and women) to understand how
differences in conceptions of offence between these groups might affect the
performance of the resulting models on various test sets. We conclude by
discussing some of the ethical choices facing the implementers of algorithmic
moderation systems, given various desired levels of diversity of viewpoints
amongst discussion participants.
","[{'version': 'v1', 'created': 'Wed, 5 Jul 2017 17:19:45 GMT'}]",2017-09-06,"[['Binns', 'Reuben', ''], ['Veale', 'Michael', ''], ['Van Kleek', 'Max', ''], ['Shadbolt', 'Nigel', '']]","['algorithmic accountability', 'machine learning', 'online abuse', 'discussion platforms', 'freedom of speech']"
8616,2005.11772,Dawid Rymarczyk,"Bartosz Zieli\'nski and Agnieszka Sroka-Oleksiak and Dawid Rymarczyk
  and Adam Piekarczyk and Monika Brzychczy-W{\l}och",Deep learning approach to describe and classify fungi microscopic images,,,10.1371/journal.pone.0234806,MIDL/2020/ExtendedAbstract/AEhp_Cqq-h,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Preliminary diagnosis of fungal infections can rely on microscopic
examination. However, in many cases, it does not allow unambiguous
identification of the species by microbiologist due to their visual similarity.
Therefore, it is usually necessary to use additional biochemical tests. That
involves additional costs and extends the identification process up to 10 days.
Such a delay in the implementation of targeted therapy may be grave in
consequence as the mortality rate for immunosuppressed patients is high. In
this paper, we apply a machine learning approach based on deep neural networks
and Fisher Vector (advanced bag-of-words method) to classify microscopic images
of various fungi species. Our approach has the potential to make the last stage
of biochemical identification redundant, shortening the identification process
by 2-3 days, and reducing the cost of the diagnosis.
","[{'version': 'v1', 'created': 'Sun, 24 May 2020 15:15:07 GMT'}]",2020-09-09,"[['Zieliński', 'Bartosz', ''], ['Sroka-Oleksiak', 'Agnieszka', ''], ['Rymarczyk', 'Dawid', ''], ['Piekarczyk', 'Adam', ''], ['Brzychczy-Włoch', 'Monika', '']]","['mycological diagnosis', 'microscopic images', 'deep learning', 'Fisher vector']"
8617,2103.04807,Peter Steiner,"Peter Steiner (1), Azarakhsh Jalalvand (2), Simon Stone (1), Peter
  Birkholz (2) ((1) Institute for Acoustics and Speech Communication,
  Technische Universit\""at Dresden, Dresden, Germany, (2) IDLab, Ghent
  University - imec, Ghent, Belgium)","PyRCN: A Toolbox for Exploration and Application of Reservoir Computing
  Networks","Preprint accepted for publication in Engineering Applications of
  Artificial Intelligence","Engineering Applications of Artificial Intelligence 113 (2022)
  104964",10.1016/j.engappai.2022.104964,,cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Reservoir Computing Networks (RCNs) belong to a group of machine learning
techniques that project the input space non-linearly into a high-dimensional
feature space, where the underlying task can be solved linearly. Popular
variants of RCNs are capable of solving complex tasks equivalently to widely
used deep neural networks, but with a substantially simpler training paradigm
based on linear regression. In this paper, we show how to uniformly describe
RCNs with small and clearly defined building blocks, and we introduce the
Python toolbox PyRCN (Python Reservoir Computing Networks) for optimizing,
training and analyzing RCNs on arbitrarily large datasets. The tool is based on
widely-used scientific packages and complies with the scikit-learn interface
specification. It provides a platform for educational and exploratory analyses
of RCNs, as well as a framework to apply RCNs on complex tasks including
sequence processing. With a small number of building blocks, the framework
allows the implementation of numerous different RCN architectures. We provide
code examples on how to set up RCNs for time series prediction and for sequence
classification tasks. PyRCN is around ten times faster than reference toolboxes
on a benchmark task while requiring substantially less boilerplate code.
","[{'version': 'v1', 'created': 'Mon, 8 Mar 2021 15:00:48 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Oct 2021 14:27:14 GMT'}, {'version': 'v3', 'created': 'Tue, 10 May 2022 13:14:28 GMT'}]",2022-05-31,"[['Steiner', 'Peter', ''], ['Jalalvand', 'Azarakhsh', ''], ['Stone', 'Simon', ''], ['Birkholz', 'Peter', '']]","['Reservoir Computing', 'Extreme Learning Machine', 'Toolbox', 'Framework']"
8618,2206.07099,James Flamino,"Omar Malik, James Flamino, Boleslaw K. Szymanski",Resource-Mediated Consensus Formation,"8 pages, 9 figures","Proc. SIGSIM-PADS'22: SIGSIM Conference on Principles of Advanced
  Discrete Simulation, Atlanta, GA, USA, June 8-10, 2022, pp. 105-112,",10.1145/3518997.3534959,,cs.MA cs.SI,http://creativecommons.org/licenses/by/4.0/,"  In social sciences, simulating opinion dynamics to study the interplay
between homophily and influence, and the subsequent formation of echo chambers,
is of great importance. As such, in this paper we investigate echo chambers by
implementing a unique social game in which we spawn in a large number of
agents, each assigned one of the two opinions on an issue and a finite amount
of influence in the form of a game currency. Agents attempt to have an opinion
that is a majority at the end of the game, to obtain a reward also paid in the
game currency. At the beginning of each round, a randomly selected agent is
selected, referred to as a speaker. The second agent is selected in the radius
of speaker influence (which is a set subset of the speaker's neighbors) to
interact with the speaker as a listener. In this interaction, the speaker
proposes a payoff in the game currency from their personal influence budget to
persuade the listener to hold the speaker's opinion in future rounds until
chosen listener again. The listener can either choose to accept or reject this
payoff to hold the speaker's opinion for future rounds. The listener's choice
is informed only by their estimate of global majority opinion through a limited
view of the opinions of their neighboring agents. We show that the influence
game leads to the formation of ""echo chambers,"" or homogeneous clusters of
opinions. We also investigate various scenarios to disrupt the creation of such
echo chambers, including the introduction of resource disparity between agents
with different opinions, initially preferentially assigning opinions to agents,
and the introduction of committed agents, who never change their initial
opinion.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2022 18:36:22 GMT'}]",2022-06-22,"[['Malik', 'Omar', ''], ['Flamino', 'James', ''], ['Szymanski', 'Boleslaw K.', '']]","['homophily', 'influence', 'echo chambers', 'influence game']"
8619,2111.01667,Luiz Capretz Dr.,"Luiz Fernando Capretz, Pradeep Waychal, Jingdong Jia, Yadira Lizama,
  Daniel Varona",International Comparative Studies on the Software Testing Profession,"6 pages. arXiv admin note: substantial text overlap with
  arXiv:2103.06343, arXiv:1906.06144","EEE IT Professional, Volume 23, Issue 5, pp. 56-61, IEEE Press,
  September/October 2021",10.1109/MITP.2020.3031862,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work attempts to fill a gap by exploring the human dimension in
particular, by trying to understand the motivation of software professionals
for taking up and sustaining their careers as software testers. Towards that
goal, four surveys were conducted in four countries - India, Canada, Cuba, and
China - to try to understand how professional software engineers perceive and
value work-related factors that could influence their motivation to start or
move into software testing careers. From our sample of 220 software
professionals, we observed that very few were keen to take up testing careers.
Some aspects of software testing, such as the potential for learning
opportunities and the importance of the job, appear to be common motivators
across the four countries, whereas the treatment of testers as second-class
citizens and the complexity of the job appeared to be the most prominent
de-motivators.
","[{'version': 'v1', 'created': 'Tue, 2 Nov 2021 15:27:17 GMT'}]",2021-11-03,"[['Capretz', 'Luiz Fernando', ''], ['Waychal', 'Pradeep', ''], ['Jia', 'Jingdong', ''], ['Lizama', 'Yadira', ''], ['Varona', 'Daniel', '']]","['software testing', 'testing professionals', 'testers', 'verification & validation']"
8620,1602.06506,Ayaka Sakata,Ayaka Sakata,"Evaluation of Generalized Degrees of Freedom for Sparse Estimation by
  Replica Method",,J. Stat. Mech. (2016) 123302,10.1088/1742-5468/2016/12/123302,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop a method to evaluate the generalized degrees of freedom (GDF),
which is a key quantity of a model selection criterion, for linear regression
with sparse regularization. Using the replica method, GDF is expressed by the
variables that characterize the saddle point of the free energy without
depending on the form of the regularization. Within the framework of replica
symmetric (RS) analysis, GDF is provided with a physical meaning as the
effective density of non-zero components. The validity of our method in the RS
phase is supported by the consistency of our results with previous mathematical
results. The analytical results in the RS phase are numerically achieved by the
belief propagation algorithm.
","[{'version': 'v1', 'created': 'Sun, 21 Feb 2016 07:08:13 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Dec 2016 04:05:38 GMT'}]",2017-01-04,"[['Sakata', 'Ayaka', '']]","['Cavity and replica method', 'Statistical inference', 'Learning theory']"
8621,2201.00267,Rayson Laroca,"Rayson Laroca, Everton V. Cardoso, Diego R. Lucio, Valter Estevam,
  David Menotti",On the Cross-dataset Generalization in License Plate Recognition,"Accepted for presentation at the International Conference on Computer
  Vision Theory and Applications (VISAPP) 2022",,10.5220/0010846800003124,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic License Plate Recognition (ALPR) systems have shown remarkable
performance on license plates (LPs) from multiple regions due to advances in
deep learning and the increasing availability of datasets. The evaluation of
deep ALPR systems is usually done within each dataset; therefore, it is
questionable if such results are a reliable indicator of generalization
ability. In this paper, we propose a traditional-split versus
leave-one-dataset-out experimental setup to empirically assess the
cross-dataset generalization of 12 Optical Character Recognition (OCR) models
applied to LP recognition on nine publicly available datasets with a great
variety in several aspects (e.g., acquisition settings, image resolution, and
LP layouts). We also introduce a public dataset for end-to-end ALPR that is the
first to contain images of vehicles with Mercosur LPs and the one with the
highest number of motorcycle images. The experimental results shed light on the
limitations of the traditional-split protocol for evaluating approaches in the
ALPR context, as there are significant drops in performance for most datasets
when training and testing the models in a leave-one-dataset-out fashion.
","[{'version': 'v1', 'created': 'Sun, 2 Jan 2022 00:56:09 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Jan 2022 08:00:02 GMT'}, {'version': 'v3', 'created': 'Wed, 30 Mar 2022 21:57:33 GMT'}, {'version': 'v4', 'created': 'Wed, 21 Dec 2022 17:49:08 GMT'}]",2022-12-22,"[['Laroca', 'Rayson', ''], ['Cardoso', 'Everton V.', ''], ['Lucio', 'Diego R.', ''], ['Estevam', 'Valter', ''], ['Menotti', 'David', '']]","['Deep Learning', 'Leave-one-dataset-out', 'License Plate Recognition', 'Optical Character Recognition']"
8622,2208.08861,Naruya Kondo,"Naruya Kondo, So Kuroki, Ryosuke Hyakuta, Yutaka Matsuo, Shixiang
  Shane Gu, Yoichi Ochiai",Deep Billboards towards Lossless Real2Sim in Virtual Reality,SIGGRAPH 2022 Immersive Pavilion,,10.1145/3532834.3536210,,cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An aspirational goal for virtual reality (VR) is to bring in a rich diversity
of real world objects losslessly. Existing VR applications often convert
objects into explicit 3D models with meshes or point clouds, which allow fast
interactive rendering but also severely limit its quality and the types of
supported objects, fundamentally upper-bounding the ""realism"" of VR. Inspired
by the classic ""billboards"" technique in gaming, we develop Deep Billboards
that model 3D objects implicitly using neural networks, where only 2D image is
rendered at a time based on the user's viewing direction. Our system,
connecting a commercial VR headset with a server running neural rendering,
allows real-time high-resolution simulation of detailed rigid objects, hairy
objects, actuated dynamic objects and more in an interactive VR world,
drastically narrowing the existing real-to-simulation (real2sim) gap.
Additionally, we augment Deep Billboards with physical interaction capability,
adapting classic billboards from screen-based games to immersive VR. At our
pavilion, the visitors can use our off-the-shelf setup for quickly capturing
their favorite objects, and within minutes, experience them in an immersive and
interactive VR world with minimal loss of reality. Our project page:
https://sites.google.com/view/deepbillboards/
","[{'version': 'v1', 'created': 'Mon, 8 Aug 2022 16:16:29 GMT'}]",2022-08-19,"[['Kondo', 'Naruya', ''], ['Kuroki', 'So', ''], ['Hyakuta', 'Ryosuke', ''], ['Matsuo', 'Yutaka', ''], ['Gu', 'Shixiang Shane', ''], ['Ochiai', 'Yoichi', '']]","['image based rendering', 'neural networks', 'billboard']"
8623,2106.00161,Travis Munyer,"Travis J. E. Munyer, Daniel Brinkman, Chenyu Huang, Xin Zhong","Integrative Use of Computer Vision and Unmanned Aircraft Technologies in
  Public Inspection: Foreign Object Debris Image Collection","This paper has been accepted for publication by the 22nd Annual
  International Conference on Digital Government Research. 7 pages, 1 figure, 1
  table",,10.1145/3463677.3463743,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Unmanned Aircraft Systems (UAS) have become an important resource for public
service providers and smart cities. The purpose of this study is to expand this
research area by integrating computer vision and UAS technology to automate
public inspection. As an initial case study for this work, a dataset of common
foreign object debris (FOD) is developed to assess the potential of
light-weight automated detection. This paper presents the rationale and
creation of this dataset. Future iterations of our work will include further
technical details analyzing experimental implementation. At a local airport,
UAS and portable cameras are used to collect the data contained in the initial
version of this dataset. After collecting these videos of FOD, they were split
into individual frames and stored as several thousand images. These frames are
then annotated following standard computer vision format and stored in a
folder-structure that reflects our creation method. The dataset annotations are
validated using a custom tool that could be abstracted to fit future
applications. Initial detection models were successfully created using the
famous You Only Look Once algorithm, which indicates the practicality of the
proposed data. Finally, several potential scenarios that could utilize either
this dataset or similar methods for other public service are presented.
","[{'version': 'v1', 'created': 'Tue, 1 Jun 2021 00:45:32 GMT'}]",2021-06-02,"[['Munyer', 'Travis J. E.', ''], ['Brinkman', 'Daniel', ''], ['Huang', 'Chenyu', ''], ['Zhong', 'Xin', '']]","['Foreign Object Debris', 'Public Services', 'Smart Cities', 'Image Dataset', 'Machine Learning']"
8624,2108.07690,Joseph Esquivel A,Dr. Joseph A. Esquivel and Dr. James A. Esquivel,"A Machine Learning Based DSS in Predicting Undergraduate Freshmen
  Enrolment in a Philippine University",,,10.14445/22312803/IJCTT-V69I5P107,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  The sudden change in the landscape of Philippine education, including the
implementation of K to 12 program, Higher Education institutions, have been
struggling in attracting freshmen applicants coupled with difficulties in
projecting incoming enrollees. Private HEIs Enrolment target directly impacts
success factors of Higher Education Institutions. A review of the various
characteristics of freshman applicants influencing their admission status at a
Philippine university were included in this study. The dataset used was
obtained from the Admissions Office of the University via an online form which
was circulated to all prospective applicants. Using Logistic Regression, a
predictive model was developed to determine the likelihood that an enrolled
student would seek enrolment in the institution or not based on both students
and institution's characteristics. The LR Model was used as the algorithm in
the development of the Decision Support System. Weka was utilized on selection
of features and building the LR model. The DSS was coded and designed using R
Studio and R Shiny which includes data visualization and individual prediction.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2021 03:54:28 GMT'}]",2021-08-18,"[['Esquivel', 'Dr. Joseph A.', ''], ['Esquivel', 'Dr. James A.', '']]","['Data Mining', 'Education Data Mining', 'Machine Learning', 'Predictive Modeling', 'Binary']"
8625,2005.10017,David Navarro-Alarcon,"Omar Zahra, Silvia Tolu, and David Navarro-Alarcon","Differential Mapping Spiking Neural Network for Sensor-Based Robot
  Control","11 pages, 11 figures. Bioinspir. Biomim 2021",,10.1088/1748-3190/abedce,,cs.RO cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, a spiking neural network (SNN) is proposed for approximating
differential sensorimotor maps of robotic systems. The computed model is used
as a local Jacobian-like projection that relates changes in sensor space to
changes in motor space. The SNN consists of an input (sensory) layer and an
output (motor) layer connected through plastic synapses, with inter-inhibitory
connections at the output layer. Spiking neurons are modeled as Izhikevich
neurons with a synaptic learning rule based on spike-timing-dependent
plasticity. Feedback data from proprioceptive and exteroceptive sensors are
encoded and fed into the input layer through a motor babbling process. As the
main challenge to building an efficient SNN is to tune its parameters, we
present an intuitive tuning method that considerably reduces the number of
neurons and the amount of data required for training. Our proposed architecture
represents a biologically plausible neural controller that is capable of
handling noisy sensor readings to guide robot movements in real-time.
Experimental results are presented to validate the control methodology with a
vision-guided robot.
","[{'version': 'v1', 'created': 'Wed, 20 May 2020 13:03:27 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Sep 2020 11:29:57 GMT'}]",2021-10-12,"[['Zahra', 'Omar', ''], ['Tolu', 'Silvia', ''], ['Navarro-Alarcon', 'David', '']]","['Robotics', 'spiking neural networks', 'sensor-based control', 'visual servoing']"
8626,cs/0511006,David Nowak,"Jean Goubault-Larrecq, Slawomir Lasota and David Nowak",Logical Relations for Monadic Types,83 pages,"Mathematical Structures in Computer Science, 18(6):1169-1217,
  December 2008",10.1017/S0960129508007172,,cs.LO,,"  Logical relations and their generalizations are a fundamental tool in proving
properties of lambda-calculi, e.g., yielding sound principles for observational
equivalence. We propose a natural notion of logical relations able to deal with
the monadic types of Moggi's computational lambda-calculus. The treatment is
categorical, and is based on notions of subsconing, mono factorization systems,
and monad morphisms. Our approach has a number of interesting applications,
including cases for lambda-calculi with non-determinism (where being in logical
relation means being bisimilar), dynamic name creation, and probabilistic
systems.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2005 01:45:56 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Mar 2008 06:15:56 GMT'}]",2009-09-29,"[['Goubault-Larrecq', 'Jean', ''], ['Lasota', 'Slawomir', ''], ['Nowak', 'David', '']]","['logical relations', 'monads', 'semantics', 'typed lambda-calculus']"
8627,2204.13284,Ryoji Tanabe,Ryoji Tanabe,"Benchmarking the Hooke-Jeeves Method, MTS-LS1, and BSrr on the
  Large-scale BBOB Function Set","This is an accepted version of a paper to the Workshop on Black-Box
  Optimization Benchmarking (BBOB 2022) published in the companion volume of
  GECCO2022",,10.1145/3520304.3533951,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates the performance of three black-box optimizers
exploiting separability on the 24 large-scale BBOB functions, including the
Hooke-Jeeves method, MTS-LS1, and BSrr. Although BSrr was not specially
designed for large-scale optimization, the results show that BSrr has a
state-of-the-art performance on the five separable large-scale BBOB functions.
The results show that the asymmetry significantly influences the performance of
MTS-LS1. The results also show that the Hooke-Jeeves method performs better
than MTS-LS1 on unimodal separable BBOB functions.
","[{'version': 'v1', 'created': 'Thu, 28 Apr 2022 04:42:11 GMT'}]",2022-04-29,"[['Tanabe', 'Ryoji', '']]","['Benchmarking', 'Black-box optimization', 'Large scale optimization']"
8628,2206.08723,Yiwei Jiang,"Yiwei Jiang, Klim Zaporojets, Johannes Deleu, Thomas Demeester, Chris
  Develder","CookDial: A dataset for task-oriented dialogs grounded in procedural
  documents","The dataset and codes are available at
  https://github.com/YiweiJiang2015/CookDial","Applied Intelligence, 1-19 (2022)",10.1007/s10489-022-03692-0,,cs.CL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This work presents a new dialog dataset, CookDial, that facilitates research
on task-oriented dialog systems with procedural knowledge understanding. The
corpus contains 260 human-to-human task-oriented dialogs in which an agent,
given a recipe document, guides the user to cook a dish. Dialogs in CookDial
exhibit two unique features: (i) procedural alignment between the dialog flow
and supporting document; (ii) complex agent decision-making that involves
segmenting long sentences, paraphrasing hard instructions and resolving
coreference in the dialog context. In addition, we identify three challenging
(sub)tasks in the assumed task-oriented dialog system: (1) User Question
Understanding, (2) Agent Action Frame Prediction, and (3) Agent Response
Generation. For each of these tasks, we develop a neural baseline model, which
we evaluate on the CookDial dataset. We publicly release the CookDial dataset,
comprising rich annotations of both dialogs and recipe documents, to stimulate
further research on domain-specific document-grounded dialog systems.
","[{'version': 'v1', 'created': 'Fri, 17 Jun 2022 12:23:53 GMT'}]",2022-06-20,"[['Jiang', 'Yiwei', ''], ['Zaporojets', 'Klim', ''], ['Deleu', 'Johannes', ''], ['Demeester', 'Thomas', ''], ['Develder', 'Chris', '']]","['dialog system', 'procedural knowledge', 'neural network modeling']"
8629,2110.01329,Jasper Brown,"Jasper Brown, Yongliang Qiao, Cameron Clark, Sabrina Lomax, Khalid
  Rafique, Salah Sukkarieh","Automated Aerial Animal Detection When Spatial Resolution Conditions Are
  Varied","20 pages, 9 figures, 4 tables in appendix","Computers and Electronics in Agriculture, Volume 193, 2022",10.1016/j.compag.2022.106689,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowing where livestock are located enables optimized management and
mustering. However, Australian farms are large meaning that many of Australia's
livestock are unmonitored which impacts farm profit, animal welfare and the
environment. Effective animal localisation and counting by analysing satellite
imagery overcomes this management hurdle however, high resolution satellite
imagery is expensive. Thus, to minimise cost the lowest spatial resolution data
that enables accurate livestock detection should be selected. In our work, we
determine the association between object detector performance and spatial
degradation for cattle, sheep and dogs. Accurate ground truth was established
using high resolution drone images which were then downsampled to various
ground sample distances (GSDs). Both circular and cassegrain aperture optics
were simulated to generate point spread functions (PSFs) corresponding to
various optical qualities. By simulating the PSF, rather than approximating it
as a Gaussian, the images were accurately degraded to match the spatial
resolution and blurring structure of satellite imagery.
  Two existing datasets were combined and used to train and test a YoloV5
object detection network. Detector performance was found to drop steeply around
a GSD of 0.5m/px and was associated with PSF matrix structure within this GSD
region. Detector mAP performance fell by 52 percent when a cassegrain, rather
than circular, aperture was used at a 0.5m/px GSD. Overall blurring magnitude
also had a small impact when matched to GSD, as did the internal network
resolution. Our results here inform the selection of remote sensing data
requirements for animal detection tasks, allowing farmers and ecologists to use
more accessible medium resolution imagery with confidence.
","[{'version': 'v1', 'created': 'Mon, 4 Oct 2021 11:20:14 GMT'}]",2022-01-21,"[['Brown', 'Jasper', ''], ['Qiao', 'Yongliang', ''], ['Clark', 'Cameron', ''], ['Lomax', 'Sabrina', ''], ['Rafique', 'Khalid', ''], ['Sukkarieh', 'Salah', '']]","['remote sensing', 'livestock monitoring', 'object detection', 'spatialresolution']"
8630,1912.10809,Christian Otto,"Hang Zhou, Christian Otto, Ralph Ewerth","Visual Summarization of Scholarly Videos using Word Embeddings and
  Keyphrase Extraction","12 pages, 5 figures",,10.1007/978-3-030-30760-8_28,,cs.MM cs.CL cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Effective learning with audiovisual content depends on many factors. Besides
the quality of the learning resource's content, it is essential to discover the
most relevant and suitable video in order to support the learning process most
effectively. Video summarization techniques facilitate this goal by providing a
quick overview over the content. It is especially useful for longer recordings
such as conference presentations or lectures. In this paper, we present an
approach that generates a visual summary of video content based on semantic
word embeddings and keyphrase extraction. For this purpose, we exploit video
annotations that are automatically generated by speech recognition and video
OCR (optical character recognition).
","[{'version': 'v1', 'created': 'Mon, 25 Nov 2019 12:02:15 GMT'}]",2019-12-24,"[['Zhou', 'Hang', ''], ['Otto', 'Christian', ''], ['Ewerth', 'Ralph', '']]","['Video Summarization', 'Word Embeddings', 'Scientific Videos']"
8631,1908.10560,Xiaodong Cai,"Xiaodong Cai, Jingyi Ma, Wei Liu, Hemin Han, Lili Ma","Efficient Convolutional Neural Network for FMCW Radar Based Hand Gesture
  Recognition",Poster in Ubicomp 2019,,10.1145/3341162.3343768,,cs.HC eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  FMCW radar could detect object's range, speed and Angleof-Arrival, advantages
are robust to bad weather, good range resolution, and good speed resolution. In
this paper, we consider the FMCW radar as a novel interacting interface on
laptop. We merge sequences of object's range, speed, azimuth information into
single input, then feed to a convolution neural network to learn spatial and
temporal patterns. Our model achieved 96% accuracy on test set and real-time
test.
","[{'version': 'v1', 'created': 'Wed, 28 Aug 2019 06:01:42 GMT'}]",2019-08-29,"[['Cai', 'Xiaodong', ''], ['Ma', 'Jingyi', ''], ['Liu', 'Wei', ''], ['Han', 'Hemin', ''], ['Ma', 'Lili', '']]","['FMCW radar', 'hand gesture recognition', 'signal processing', 'Convolutional Neural Network']"
8632,2110.10535,Lukasz Mikulski,"David de Frutos Escrig, Maciej Koutny, and {\L}ukasz Mikulski",Investigating Reversibility of Steps in Petri Nets,"special issue of PN 2019, after editor changes (Fundamenta
  Informaticae)","Fundamenta Informaticae, Volume 183, Issues 1-2: Petri Nets 2019
  (December 23, 2021) fi:8840",10.3233/FI-2021-2082,,cs.FL cs.SE,http://creativecommons.org/licenses/by/4.0/,"  In reversible computations one is interested in the development of mechanisms
allowing to undo the effects of executed actions. The past research has been
concerned mainly with reversing single actions. In this paper, we consider the
problem of reversing the effect of the execution of groups of actions (steps).
  Using Petri nets as a system model, we introduce concepts related to this new
scenario, generalising notions used in the single action case. We then present
properties arising when reverse actions are allowed in place/transition nets
(pt-nets). We obtain both positive and negative results, showing that allowing
steps makes reversibility more problematic than in the interleaving/sequential
case. In particular, we demonstrate that there is a crucial difference between
reversing steps which are sets and those which are true multisets. Moreover, in
contrast to sequential semantics, splitting reverses does not lead to a general
method for reversing bounded pt-nets. We then show that a suitable solution can
be obtained by combining split reverses with weighted read arcs.
","[{'version': 'v1', 'created': 'Wed, 20 Oct 2021 12:43:20 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Dec 2021 17:18:20 GMT'}]",2022-03-14,"[['Escrig', 'David de Frutos', ''], ['Koutny', 'Maciej', ''], ['Mikulski', 'Łukasz', '']]","['Petri net', 'reversible computation', 'step semantics', 'action splitting', 'net synthesis', 'direct reversibility', 'mixed reversibility', 'weighted activator arcs']"
8633,1904.08142,Yuriy Pershin,V. A. Slipko and Y. V. Pershin,"Transient dynamics of pulse-driven memristors in the presence of a
  stable fixed point",,,10.1016/j.physe.2019.113561,,cs.ET cond-mat.mes-hall,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Some memristors are quite interesting from the point of view of dynamical
systems. When driven by narrow pulses of alternating polarities, their dynamics
has a stable fixed point, which may be useful for future applications. We study
the transient dynamics of two types of memristors characterized by a stable
fixed point using a time-averaged evolution equation. Time-averaged
trajectories of the Biolek window function memristor and resistor-threshold
type memristor circuit (an effective memristor) are determined analytically,
and the times of relaxation to the stable fixed point are found. Our analytical
results are in perfect agreement with the results of numerical simulations.
","[{'version': 'v1', 'created': 'Wed, 17 Apr 2019 08:58:45 GMT'}]",2019-06-26,"[['Slipko', 'V. A.', ''], ['Pershin', 'Y. V.', '']]","['Memristor', 'memristive system', 'resistance switching memory', 'attractor', 'stable fixed point']"
8634,1804.00799,Binbin Pang,"Binbin Pang, Shixin Zhu, Xiaoshan Kai",Some new bounds on LCD codes over finite fields,,"Cryptogr. Commun. 12, 743-755 (2020)",10.1007/s12095-019-00417-y,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we show that LCD codes are not equivalent to linear codes over
small finite fields. The enumeration of binary optimal LCD codes is obtained.
We also get the exact value of LD$(n,2)$ over $\mathbb{F}_3$ and
$\mathbb{F}_4$. We study the bound of LCD codes over $\mathbb{F}_q$.
","[{'version': 'v1', 'created': 'Tue, 3 Apr 2018 02:57:29 GMT'}]",2021-01-22,"[['Pang', 'Binbin', ''], ['Zhu', 'Shixin', ''], ['Kai', 'Xiaoshan', '']]","['Bouds', 'LCD codes', 'Generator Matrix']"
8635,2108.10395,Kalpa Gunaratna,"Kalpa Gunaratna, Vijay Srinivasan, Sandeep Nama, Hongxia Jin","Using Neighborhood Context to Improve Information Extraction from Visual
  Documents Captured on Mobile Phones","accepted at CIKM 2021, pre-print version",,10.1145/3459637.3482211,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information Extraction from visual documents enables convenient and
intelligent assistance to end users. We present a Neighborhood-based
Information Extraction (NIE) approach that uses contextual language models and
pays attention to the local neighborhood context in the visual documents to
improve information extraction accuracy. We collect two different visual
document datasets and show that our approach outperforms the state-of-the-art
global context-based IE technique. In fact, NIE outperforms existing approaches
in both small and large model sizes. Our on-device implementation of NIE on a
mobile platform that generally requires small models showcases NIE's usefulness
in practical real-world applications.
","[{'version': 'v1', 'created': 'Mon, 23 Aug 2021 20:30:48 GMT'}]",2021-08-25,"[['Gunaratna', 'Kalpa', ''], ['Srinivasan', 'Vijay', ''], ['Nama', 'Sandeep', ''], ['Jin', 'Hongxia', '']]","['information extraction', 'visual document', 'on-device', 'privacy']"
8636,2104.00250,Kc Sivaramakrishnan,"KC Sivaramakrishnan, Stephen Dolan, Leo White, Tom Kelly, Sadiq
  Jaffer, Anil Madhavapeddy",Retrofitting Effect Handlers onto OCaml,Accepted to PLDI 2021,,10.1145/3453483.3454039,,cs.PL,http://creativecommons.org/licenses/by/4.0/,"  Effect handlers have been gathering momentum as a mechanism for modular
programming with user-defined effects. Effect handlers allow for non-local
control flow mechanisms such as generators, async/await, lightweight threads
and coroutines to be composably expressed. We present a design and evaluate a
full-fledged efficient implementation of effect handlers for OCaml, an
industrial-strength multi-paradigm programming language. Our implementation
strives to maintain the backwards compatibility and performance profile of
existing OCaml code. Retrofitting effect handlers onto OCaml is challenging
since OCaml does not currently have any non-local control flow mechanisms other
than exceptions. Our implementation of effect handlers for OCaml: (i) imposes a
mean 1% overhead on a comprehensive macro benchmark suite that does not use
effect handlers; (ii) remains compatible with program analysis tools that
inspect the stack; and (iii) is efficient for new code that makes use of effect
handlers.
","[{'version': 'v1', 'created': 'Thu, 1 Apr 2021 04:34:23 GMT'}]",2021-04-02,"[['Sivaramakrishnan', 'KC', ''], ['Dolan', 'Stephen', ''], ['White', 'Leo', ''], ['Kelly', 'Tom', ''], ['Jaffer', 'Sadiq', ''], ['Madhavapeddy', 'Anil', '']]","['Effect handlers', 'Backwards compatibility', 'Fibers', 'Continuations', 'Backtraces']"
8637,1708.02201,Narges Mehran,Narges Mehran and Naser Movahhedinia,"Non-uniform EWMA-PCA based cache size allocation scheme in Named Data
  Networks","Accepted by Sci China Inf Sci, Science China Information Sciences,
  2017","Sci China Inf Sci, 61(1) (2018)",10.1007/s11432-016-0501-5,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As a data-centric cache-enabled architecture, Named Data Networking (NDN) is
considered to be an appropriate alternative to the current host-centric
IP-based Internet infrastructure. Leveraging in-network caching, name-based
routing, and receiver-driven sessions, NDN can greatly enhance the way Internet
resources are being used. A critical issue in NDN is the procedure of cache
allocation and management. Our main contribution in this research is the
analysis of memory requirements to allocate suitable Content-Store size to NDN
routers, with respect to combined impacts of long-term centrality-based metric
and Exponential Weighted Moving Average (EWMA) of short-term parameters such as
users behaviors and outgoing traffic. To determine correlations in such large
data sets, data mining methods can prove valuable to researchers. In this
paper, we apply a data-fusion approach, namely Principal Component Analysis
(PCA), to discover relations from short- and long-term parameters of the
router. The output of PCA, exploited to mine out raw data sets, is used to
allocate a proper cache size to the router. Evaluation results show an increase
in the hit ratio of Content-Stores in sources, and NDN routers. Moreover, for
the proposed cache size allocation scheme, the number of unsatisfied and
pending Interests in NDN routers is smaller than the Degree-Centrality cache
size scheme.
","[{'version': 'v1', 'created': 'Mon, 7 Aug 2017 17:00:12 GMT'}]",2017-08-21,"[['Mehran', 'Narges', ''], ['Movahhedinia', 'Naser', '']]","['content centric networks', 'Named Data Networks', 'future Internet', 'NDN cache size', 'exponentialweighted moving average', 'principal component analysis']"
8638,2111.01867,Saurabh Deshpande Mr.,"Saurabh Deshpande, Jakub Lengiewicz and St\'ephane P.A. Bordas",Probabilistic Deep Learning for Real-Time Large Deformation Simulations,,"Computer Methods in Applied Mechanics and Engineering, 2022,
  Volume 398",10.1016/j.cma.2022.115307,,cs.LG cs.CE,http://creativecommons.org/licenses/by/4.0/,"  For many novel applications, such as patient-specific computer-aided surgery,
conventional solution techniques of the underlying nonlinear problems are
usually computationally too expensive and are lacking information about how
certain can we be about their predictions. In the present work, we propose a
highly efficient deep-learning surrogate framework that is able to accurately
predict the response of bodies undergoing large deformations in real-time. The
surrogate model has a convolutional neural network architecture, called U-Net,
which is trained with force-displacement data obtained with the finite element
method. We propose deterministic and probabilistic versions of the framework.
The probabilistic framework utilizes the Variational Bayes Inference approach
and is able to capture all the uncertainties present in the data as well as in
the deep-learning model. Based on several benchmark examples, we show the
predictive capabilities of the framework and discuss its possible limitations
","[{'version': 'v1', 'created': 'Tue, 2 Nov 2021 20:05:22 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Dec 2021 16:38:07 GMT'}, {'version': 'v3', 'created': 'Mon, 4 Jul 2022 09:16:48 GMT'}]",2022-07-18,"[['Deshpande', 'Saurabh', ''], ['Lengiewicz', 'Jakub', ''], ['Bordas', 'Stéphane P. A.', '']]","['Convolutional Neural Network', 'Bayesian Inference', 'Bayesian Deep Learning', 'Large deformations', 'Finite Element Method', 'Real-Time Simulations']"
8639,1911.06594,Stefan Marksteiner,"Stefan Marksteiner, Rudolf Ramler, Hannes Sochor","Integrating Threat Modeling and Automated Test Case Generation into
  Industrialized Software Security Testing","3 pages, 1 figure, Central European Cybersecurity Conference 2019
  (CECC2019), Munich",,10.1145/3360664.3362698,,cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Industrial Internet of Things (IIoT) application provide a whole new set of
possibilities to drive efficiency of industrial production forward. However,
with the higher degree of integration among systems, comes a plethora of
newthreats to the latter, as they are not yet designed to be broadly reachable
and interoperable. To mitigate these vast amount of new threats, systematic and
automated test methods are necessary. This comprehensiveness can be achieved by
thorough threat modeling. In order to automate security test, we present an
approach to automate the testing process from threat modeling onward, closing
the gap between threat modeling and automated test case generation.
","[{'version': 'v1', 'created': 'Fri, 15 Nov 2019 12:55:56 GMT'}]",2019-11-18,"[['Marksteiner', 'Stefan', ''], ['Ramler', 'Rudolf', ''], ['Sochor', 'Hannes', '']]","['IoT security', 'cyber-physical security', 'security testing', 'threat modeling', 'automated test case generation']"
8640,2101.08262,Iacovos Ioannou I.I.,"Iacovos Ioannou, Christophoros Christophorou, Vasos Vassiliou, Andreas
  Pitsillides","Performance Evaluation of Transmission Mode Selection in D2D
  communication",arXiv admin note: text overlap with arXiv:2101.08014,"2021 11th IFIP International Conference on New Technologies,
  Mobility and Security (NTMS)",10.1109/NTMS49979.2021.9432648,,cs.NI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Device to Device (D2D) Communication is expected to be a core part of the
forthcoming 5G Mobile Communication Networks as it promises improvements in
energy efficiency, spectral efficiency, overall system capacity, and higher
data rates with the use of the same frequencies for different D2D transmissions
in short communication distances within the Cell. However, in order to achieve
optimum results, it is important, among others, to select wisely the
Transmission Mode of the D2D Device. Towards this end, our previous work
proposed an intelligent Transmission mode selection approach in a framework
that is utilizing Artificial Intelligence (AI) BDIx agents to collectively
satisfy the D2D challenges in a Distributed Artificial Intelligent (DAI) manner
autonomously and independently. In this paper, as a first step, a literature
review focused on related Transmission mode approaches, is performed. Then, our
investigated Transmission mode selection approach is further explained with
formulas and evaluated based on different threshold values and investigated how
these can affect the overall spectral efficiency and power usage of the network
in order to achieve the maximum performance. The investigated thresholds(i.e.
D2D Device Weighted Data Rate (WDR) and the D2D Device Battery Power Level) and
metrics(i.e. WDR) are also further analyzed and formulated. In addition, the
effect the transmission power of the D2D links has on the total spectral
efficiency and total power consumption of the network, is also examined. This
evaluation results arise some interesting findings that can contribute in other
approaches that utilized similar or same thresholds. Also, the results obtained
demonstrate that with the right tuning of the thresholds and transmission
power, one can achieve a significant improvement in the network power usage and
total spectral efficiency.
","[{'version': 'v1', 'created': 'Wed, 20 Jan 2021 08:37:11 GMT'}]",2021-05-24,"[['Ioannou', 'Iacovos', ''], ['Christophorou', 'Christophoros', ''], ['Vassiliou', 'Vasos', ''], ['Pitsillides', 'Andreas', '']]","['5G', 'D2D', 'TransmissionModeSelection', 'Distributed Artificial Intelligence']"
8641,2103.03328,Aleksandar Vakanski,"Aleksandar Vakanski, Min Xian","Evaluation of Complexity Measures for Deep Learning Generalization in
  Medical Image Analysis","15 pages, 4 figures","IEEE International Workshop on Machine Learning and Signal
  Processing (MLSP 2021), Gold Coast, Australia, pp. 1-6, 2021",10.1109/MLSP52302.2021.9596501,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The generalization performance of deep learning models for medical image
analysis often decreases on images collected with different devices for data
acquisition, device settings, or patient population. A better understanding of
the generalization capacity on new images is crucial for clinicians'
trustworthiness in deep learning. Although significant research efforts have
been recently directed toward establishing generalization bounds and complexity
measures, still, there is often a significant discrepancy between the predicted
and actual generalization performance. As well, related large empirical studies
have been primarily based on validation with general-purpose image datasets.
This paper presents an empirical study that investigates the correlation
between 25 complexity measures and the generalization abilities of supervised
deep learning classifiers for breast ultrasound images. The results indicate
that PAC-Bayes flatness-based and path norm-based measures produce the most
consistent explanation for the combination of models and data. We also
investigate the use of multi-task classification and segmentation approach for
breast images, and report that such learning approach acts as an implicit
regularizer and is conducive toward improved generalization.
","[{'version': 'v1', 'created': 'Thu, 4 Mar 2021 20:58:22 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Mar 2021 02:50:47 GMT'}]",2021-11-22,"[['Vakanski', 'Aleksandar', ''], ['Xian', 'Min', '']]","['Deep Learning', 'Generalization', 'Complexity Measures', 'Medical Image Analysis']"
8642,1709.00382,Guotai Wang,"Guotai Wang, Wenqi Li, Sebastien Ourselin, and Tom Vercauteren","Automatic Brain Tumor Segmentation using Cascaded Anisotropic
  Convolutional Neural Networks","12 pages, 5 figures. MICCAI Brats Challenge 2017",,10.1007/978-3-319-75238-9_16,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A cascade of fully convolutional neural networks is proposed to segment
multi-modal Magnetic Resonance (MR) images with brain tumor into background and
three hierarchical regions: whole tumor, tumor core and enhancing tumor core.
The cascade is designed to decompose the multi-class segmentation problem into
a sequence of three binary segmentation problems according to the subregion
hierarchy. The whole tumor is segmented in the first step and the bounding box
of the result is used for the tumor core segmentation in the second step. The
enhancing tumor core is then segmented based on the bounding box of the tumor
core segmentation result. Our networks consist of multiple layers of
anisotropic and dilated convolution filters, and they are combined with
multi-view fusion to reduce false positives. Residual connections and
multi-scale predictions are employed in these networks to boost the
segmentation performance. Experiments with BraTS 2017 validation set show that
the proposed method achieved average Dice scores of 0.7859, 0.9050, 0.8378 for
enhancing tumor core, whole tumor and tumor core, respectively. The
corresponding values for BraTS 2017 testing set were 0.7831, 0.8739, and
0.7748, respectively.
","[{'version': 'v1', 'created': 'Fri, 1 Sep 2017 16:11:34 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Dec 2017 09:15:00 GMT'}]",2018-07-23,"[['Wang', 'Guotai', ''], ['Li', 'Wenqi', ''], ['Ourselin', 'Sebastien', ''], ['Vercauteren', 'Tom', '']]","['Brain tumor', 'convolutional neural network', 'segmentation']"
8643,2109.13658,Gunnar Stefansson,"Gunnar Stefansson, Anna Helga Jonsdottir",Learning and evaluation without access to schools during COVID-19,,,10.21125/inted.2021.0563,,cs.CY stat.AP,http://creativecommons.org/licenses/by-sa/4.0/,"  The tutor-web drilling system is designed for learning so there are typically
no limits on the number of attempts at improving performance. This system is
used at multiple schools and universities in Iceland and Kenya, mostly for
mathematics and statistics. Students earn SmileyCoin, a cryptocurrency, while
studying. In Iceland the system has typically been used by students who use
their own devices to solve homework assignments during the semester, accessing
the Internet-based tutor-web at http://tutor-web.net. These students typically
take final exams on paper at the end of the semester. In Kenya the system is a
part of a plan to enhance mathematics education using educational technology,
organised by the Smiley Charity with the African Maths Initiative. This has
been done by donating servers running the tutor-web to schools and tablets to
students. Typically these schools do not have Internet access so the
cryptocurrency can not be used. Innovative redesign was needed during COVID-19
in spring, 2020, since universities in Iceland were not able to host in-house
finals and schools in Kenya were closed so tablets could not be donated
directly to students. Remote finals were held in Iceland but the implementation
was largely in the hands of the instructors. In Kenya, community libraries
remained open and became a place for students to come in to study. Innovations
included using the tutor-web as a remote drilling system in place of final
exams in a large undergraduate course in statistics and donating tablets to
libraries in Kenya. These libraries all have access to the Internet and the
students have therefore been given the option to purchase the tablet using
their SmileyCoin. This paper describes these implementations and how this
unintended experiment will likely affect the future development and use of the
tutor-web in both countries.
","[{'version': 'v1', 'created': 'Thu, 19 Aug 2021 16:19:23 GMT'}]",2021-09-29,"[['Stefansson', 'Gunnar', ''], ['Jonsdottir', 'Anna Helga', '']]","['Distance learning', 'assessments', 'drills', 'educational technology', 'reward schemes', 'cryptocurrency', 'SmileyCoin', 'tutor-web']"
8644,2201.12085,Zhe Liu,"Zhe Liu, Chunyang Chen, Junjie Wang, Yuekai Huang, Jun Hu, Qing Wang","Guided Bug Crush: Assist Manual GUI Testing of Android Apps via Hint
  Moves","Accepted to CHI Conference on Human Factors in Computing Systems
  (CHI'22)",,10.1145/3491102.3501903,CHI 2022 3315,cs.SE cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Mobile apps are indispensable for people's daily life. Complementing with
automated GUI testing, manual testing is the last line of defence for app
quality. However, the repeated actions and easily missing of functionalities
make manual testing time-consuming and inefficient. Inspired by the game candy
crush with flashy candies as hint moves for players, we propose an approach
named NaviDroid for navigating testers via highlighted next operations for more
effective and efficient testing. Within NaviDroid, we construct an enriched
state transition graph with the triggering actions as the edges for two
involved states. Based on it, we utilize the dynamic programming algorithm to
plan the exploration path, and augment the GUI with visualized hints for
testers to quickly explore untested activities and avoid duplicate
explorations. The automated experiments demonstrate the high coverage and
efficient path planning of NaviDroid and a user study further confirms its
usefulness. The NaviDroid can help us develop more robust software that works
in more mission-critical settings, not only by performing more thorough testing
with the same effort that has been put in before, but also by integrating these
techniques into different parts of development pipeline.
","[{'version': 'v1', 'created': 'Fri, 28 Jan 2022 12:45:56 GMT'}]",2022-01-31,"[['Liu', 'Zhe', ''], ['Chen', 'Chunyang', ''], ['Wang', 'Junjie', ''], ['Huang', 'Yuekai', ''], ['Hu', 'Jun', ''], ['Wang', 'Qing', '']]","['GUI testing', 'Android App', 'Software Engineering', 'Quality Assurance']"
8645,2106.05521,Michael Thrun PhD,Michael C. Thrun and Alfred Ultsch,Swarm Intelligence for Self-Organized Clustering,"54 pages, 21 figures","Artificial intelligence, Vol. 290, pp. 103237. 2021",10.1016/j.artint.2020.103237,,cs.NE cs.AI cs.MA stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Algorithms implementing populations of agents which interact with one another
and sense their environment may exhibit emergent behavior such as
self-organization and swarm intelligence. Here a swarm system, called
Databionic swarm (DBS), is introduced which is able to adapt itself to
structures of high-dimensional data characterized by distance and/or
density-based structures in the data space. By exploiting the interrelations of
swarm intelligence, self-organization and emergence, DBS serves as an
alternative approach to the optimization of a global objective function in the
task of clustering. The swarm omits the usage of a global objective function
and is parameter-free because it searches for the Nash equilibrium during its
annealing process. To our knowledge, DBS is the first swarm combining these
approaches. Its clustering can outperform common clustering methods such as
K-means, PAM, single linkage, spectral clustering, model-based clustering, and
Ward, if no prior knowledge about the data is available. A central problem in
clustering is the correct estimation of the number of clusters. This is
addressed by a DBS visualization called topographic map which allows assessing
the number of clusters. It is known that all clustering algorithms construct
clusters, irrespective of the data set contains clusters or not. In contrast to
most other clustering algorithms, the topographic map identifies, that
clustering of the data is meaningless if the data contains no (natural)
clusters. The performance of DBS is demonstrated on a set of benchmark data,
which are constructed to pose difficult clustering problems and in two
real-world applications.
","[{'version': 'v1', 'created': 'Thu, 10 Jun 2021 06:21:48 GMT'}]",2021-06-11,"[['Thrun', 'Michael C.', ''], ['Ultsch', 'Alfred', '']]","['cluster analysis', 'swarm intelligence', 'self-organization', 'nonlinear dimensionality']"
8646,2110.02933,Yakup Akkaya,"Yakup Akkaya, Murat Simsek, Burak Kantarci, Shahzad Khan",On Cropped versus Uncropped Training Sets in Tabular Structure Detection,,"Neurocomputing, Volume 513, 2022, Pages 114-126",10.1016/j.neucom.2022.09.094,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Automated document processing for tabular information extraction is highly
desired in many organizations, from industry to government. Prior works have
addressed this problem under table detection and table structure detection
tasks. Proposed solutions leveraging deep learning approaches have been giving
promising results in these tasks. However, the impact of dataset structures on
table structure detection has not been investigated. In this study, we provide
a comparison of table structure detection performance with cropped and
uncropped datasets. The cropped set consists of only table images that are
cropped from documents assuming tables are detected perfectly. The uncropped
set consists of regular document images. Experiments show that deep learning
models can improve the detection performance by up to 9% in average precision
and average recall on the cropped versions. Furthermore, the impact of cropped
images is negligible under the Intersection over Union (IoU) values of 50%-70%
when compared to the uncropped versions. However, beyond 70% IoU thresholds,
cropped datasets provide significantly higher detection performance.
","[{'version': 'v1', 'created': 'Wed, 6 Oct 2021 17:28:38 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Oct 2021 03:22:42 GMT'}]",2022-10-05,"[['Akkaya', 'Yakup', ''], ['Simsek', 'Murat', ''], ['Kantarci', 'Burak', ''], ['Khan', 'Shahzad', '']]","['Deep Learning', 'Convolutional Neural Networks', 'Image Processing', 'Document']"
8647,2010.16306,Katsumi Okuda,"Katsumi Okuda, Shigeru Chiba",Lake symbols for island parsing,,"The Art, Science, and Engineering of Programming, 2021, Vol. 5,
  Issue 2, Article 11",10.22152/programming-journal.org/2021/5/11,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: An island parser reads an input text and builds the parse (or
abstract syntax) tree of only the programming constructs of interest in the
text. These constructs are called islands and the rest of the text is called
water, which the parser ignores and skips over. Since an island parser does not
have to parse all the details of the input, it is often easy to develop but
still useful enough for a number of software engineering tools. When a parser
generator is used, the developer can implement an island parser by just
describing a small number of grammar rules, for example, in Parsing Expression
Grammar (PEG).
  Inquiry: In practice, however, the grammar rules are often complicated since
the developer must define the water inside the island; otherwise, the island
parsing will not reduce the total number of grammar rules. When describing the
grammar rules for such water, the developer must consider other rules and
enumerate a set of symbols, which we call alternative symbols. Due to this
difficulty, island parsing seems to be not widely used today despite its
usefulness in many applications.
  Approach: This paper proposes the lake symbols for addressing this difficulty
in developing an island parser. It also presents an extension to PEG for
supporting the lake symbols. The lake symbols automate the enumeration of the
alternative symbols for the water inside an island. The paper proposes an
algorithm for translating the extended PEG to the normal PEG, which can be
given to an existing parser generator based on PEG.
  Knowledge: The user can use lake symbols to define water without specifying
each alternative symbol. Our algorithms can calculate all alternative symbols
for a lake symbol, based on where the lake symbol is used in the grammar.
  Grounding: We implemented a parser generator accepting our extended PEG and
implemented 36 island parsers for Java and 20 island parsers for Python. Our
experiments show that the lake symbols reduce 42 % of grammar rules for Java
and 89 % of rules for Python on average, excluding the case where islands are
expressions.
  Importance: This work eases the use of island parsing. Lake symbols enable
the user to define the water inside the island simpler than before. Defining
water inside the island is essential to apply island parsing for practical
programming languages.
","[{'version': 'v1', 'created': 'Fri, 30 Oct 2020 14:54:14 GMT'}]",2020-11-02,"[['Okuda', 'Katsumi', ''], ['Chiba', 'Shigeru', '']]","['island grammar', 'island parsing', 'packrat parsing', 'parsing expression grammar', 'PEG']"
8648,2006.08818,Ingrid Nunes,"Ingrid Nunes, Phillip Taylor, Lina Barakat, Nathan Griffiths, Simon
  Miles",Explaining reputation assessments,,"International Journal of Human-Computer Studies, 123, 1-17 (2019)",10.1016/j.ijhcs.2018.10.007,,cs.AI cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Reputation is crucial to enabling human or software agents to select among
alternative providers. Although several effective reputation assessment methods
exist, they typically distil reputation into a numerical representation, with
no accompanying explanation of the rationale behind the assessment. Such
explanations would allow users or clients to make a richer assessment of
providers, and tailor selection according to their preferences and current
context. In this paper, we propose an approach to explain the rationale behind
assessments from quantitative reputation models, by generating arguments that
are combined to form explanations. Our approach adapts, extends and combines
existing approaches for explaining decisions made using multi-attribute
decision models in the context of reputation. We present example argument
templates, and describe how to select their parameters using explanation
algorithms. Our proposal was evaluated by means of a user study, which followed
an existing protocol. Our results give evidence that although explanations
present a subset of the information of trust scores, they are sufficient to
equally evaluate providers recommended based on their trust score. Moreover,
when explanation arguments reveal implicit model information, they are less
persuasive than scores.
","[{'version': 'v1', 'created': 'Mon, 15 Jun 2020 23:19:35 GMT'}]",2020-06-17,"[['Nunes', 'Ingrid', ''], ['Taylor', 'Phillip', ''], ['Barakat', 'Lina', ''], ['Griffiths', 'Nathan', ''], ['Miles', 'Simon', '']]","['Reputation', 'Trust', 'Explanation', 'Arguments', 'User study']"
8649,1802.02978,Niklas Georg,"Niklas Georg, Wolfgang Ackermann, Jacopo Corno, Sebastian Sch\""ops","Uncertainty Quantification for Maxwell's Eigenproblem based on
  Isogeometric Analysis and Mode Tracking",,"Comput. Method Appl. M., 350(15): 228-244, 2019",10.1016/j.cma.2019.03.002,,cs.CE cs.NA math.NA physics.acc-ph physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The electromagnetic field distribution as well as the resonating frequency of
various modes in superconducting cavities used in particle accelerators for
example are sensitive to small geometry deformations. The occurring variations
are motivated by measurements of an available set of resonators from which we
propose to extract a small number of relevant and independent deformations by
using a truncated Karhunen-Lo\`eve expansion. The random deformations are used
in an expressive uncertainty quantification workflow to determine the
sensitivity of the eigenmodes. For the propagation of uncertainty, a stochastic
collocation method based on sparse grids is employed. It requires the repeated
solution of Maxwell's eigenvalue problem at predefined collocation points,
i.e., for cavities with perturbed geometry. The main contribution of the paper
is ensuring the consistency of the solution, i.e., matching the eigenpairs,
among the various eigenvalue problems at the stochastic collocation points. To
this end, a classical eigenvalue tracking technique is proposed that is based
on homotopies between collocation points and a Newton-based eigenvalue solver.
The approach can be efficiently parallelized while tracking the eigenpairs. In
this paper, we propose the application of isogeometric analysis since it allows
for the exact description of the geometrical domains with respect to common
computer-aided design kernels, for a straightforward and convenient way of
handling geometrical variations and smooth solutions.
","[{'version': 'v1', 'created': 'Thu, 8 Feb 2018 17:40:03 GMT'}, {'version': 'v2', 'created': 'Wed, 30 May 2018 20:31:38 GMT'}, {'version': 'v3', 'created': 'Wed, 6 Mar 2019 16:21:35 GMT'}]",2019-04-09,"[['Georg', 'Niklas', ''], ['Ackermann', 'Wolfgang', ''], ['Corno', 'Jacopo', ''], ['Schöps', 'Sebastian', '']]","['Cavity resonators', 'eigenvalues and eigenfunctions', 'isogeometricanalysis', 'radio frequency', 'sensitivity analysis']"
8650,2001.05424,Amanda Swearngin,"Amanda Swearngin, Chenglong Wang, Alannah Oleson, James Fogarty, Amy
  J. Ko","Scout: Rapid Exploration of Interface Layout Alternatives through
  High-Level Design Constraints","13 pages, 8 figures, ACM CHI Full Paper (2020)","Proceedings of the 2019 CHI Conference on Human Factors in
  Computing Systems",10.1145/3313831.3376593,,cs.HC cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although exploring alternatives is fundamental to creating better interface
designs, current processes for creating alternatives are generally manual,
limiting the alternatives a designer can explore. We present Scout, a system
that helps designers rapidly explore alternatives through mixed-initiative
interaction with high-level constraints and design feedback. Prior
constraint-based layout systems use low-level spatial constraints and generally
produce a single design. Tosupport designer exploration of alternatives, Scout
introduces high-level constraints based on design concepts (e.g.,~semantic
structure, emphasis, order) and formalizes them into low-level spatial
constraints that a solver uses to generate potential layouts. In an evaluation
with 18 interface designers, we found that Scout: (1) helps designers create
more spatially diverse layouts with similar quality to those created with a
baseline tool and (2) can help designers avoid a linear design process and
quickly ideate layouts they do not believe they would have thought of on their
own.
","[{'version': 'v1', 'created': 'Wed, 15 Jan 2020 16:49:26 GMT'}]",2020-01-16,"[['Swearngin', 'Amanda', ''], ['Wang', 'Chenglong', ''], ['Oleson', 'Alannah', ''], ['Fogarty', 'James', ''], ['Ko', 'Amy J.', '']]","['Interface design', 'alternatives', 'program synthesis', 'constraints']"
8651,cs/0411090,Valmir Barbosa,"A. O. Stauffer, V. C. Barbosa","Local heuristics and the emergence of spanning subgraphs in complex
  networks",,"Theoretical Computer Science 355 (2006), 80-95",10.1016/j.tcs.2005.12.007,ES-663/04,cs.NI,,"  We study the use of local heuristics to determine spanning subgraphs for use
in the dissemination of information in complex networks. We introduce two
different heuristics and analyze their behavior in giving rise to spanning
subgraphs that perform well in terms of allowing every node of the network to
be reached, of requiring relatively few messages and small node bandwidth for
information dissemination, and also of stretching paths with respect to the
underlying network only modestly. We contribute a detailed mathematical
analysis of one of the heuristics and provide extensive simulation results on
random graphs for both of them. These results indicate that, within certain
limits, spanning subgraphs are indeed expected to emerge that perform well in
respect to all requirements. We also discuss the spanning subgraphs' inherent
resilience to failures and adaptability to topological changes.
","[{'version': 'v1', 'created': 'Thu, 25 Nov 2004 09:04:13 GMT'}]",2007-05-23,"[['Stauffer', 'A. O.', ''], ['Barbosa', 'V. C.', '']]","['Complex networks', 'Local heuristics', 'Spanning subgraphs']"
8652,1902.03187,Jason Allred,Jason M. Allred and Kaushik Roy,"Controlled Forgetting: Targeted Stimulation and Dopaminergic Plasticity
  Modulation for Unsupervised Lifelong Learning in Spiking Neural Networks",,,10.3389/fnins.2020.00007,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stochastic gradient descent requires that training samples be drawn from a
uniformly random distribution of the data. For a deployed system that must
learn online from an uncontrolled and unknown environment, the ordering of
input samples often fails to meet this criterion, making lifelong learning a
difficult challenge. We exploit the locality of the unsupervised Spike Timing
Dependent Plasticity (STDP) learning rule to target local representations in a
Spiking Neural Network (SNN) to adapt to novel information while protecting
essential information in the remainder of the SNN from catastrophic forgetting.
In our Controlled Forgetting Networks (CFNs), novel information triggers
stimulated firing and heterogeneously modulated plasticity, inspired by
biological dopamine signals, to cause rapid and isolated adaptation in the
synapses of neurons associated with outlier information. This targeting
controls the forgetting process in a way that reduces the degradation of
accuracy for older tasks while learning new tasks. Our experimental results on
the MNIST dataset validate the capability of CFNs to learn successfully over
time from an unknown, changing environment, achieving 95.36% accuracy, which we
believe is the best unsupervised accuracy ever achieved by a fixed-size,
single-layer SNN on a completely disjoint MNIST dataset.
","[{'version': 'v1', 'created': 'Fri, 8 Feb 2019 16:50:33 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Sep 2019 15:42:10 GMT'}]",2020-01-29,"[['Allred', 'Jason M.', ''], ['Roy', 'Kaushik', '']]","['lifelong learning', 'continual learning', 'catastrophic forgetting', 'controlled forgetting', 'dopaminergic learning', 'spiking neural']"
8653,2104.13591,Kazuki Shibata Mr,"Kazuki Shibata, Tatsuya Miyano, Tomohiko Jimbo","Development of global optimal coverage control using multiple aerial
  robots","14 pages, 9 figures","Advanced Robotics, Volume 33, Issue 19, July 2019, Pages 996-1005",10.1080/01691864.2019.1637777,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Coverage control has been widely used for constructing mobile sensor network
such as for environmental monitoring, and one of the most commonly used methods
is the Lloyd algorithm based on Voronoi partitions. However, when this method
is used, the result sometimes converges to a local optimum. To overcome this
problem, game theoretic coverage control has been proposed and found to be
capable of stochastically deriving the optimal deployment. From a practical
point of view, however, it is necessary to make the result converge to the
global optimum deterministically. In this paper, we propose a global optimal
coverage control along with collision avoidance in continuous space that
ensures multiple sensors can deterministically and smoothly move to the global
optimal deployment. This approach consists of a cut-in algorithm based on
neighborhood importance of measurement and a modified potential method for
collision avoidance. The effectiveness of the proposed algorithm has been
confirmed through numerous simulations and some experiments using multiple
aerial robots.
","[{'version': 'v1', 'created': 'Wed, 28 Apr 2021 06:52:40 GMT'}]",2021-04-29,"[['Shibata', 'Kazuki', ''], ['Miyano', 'Tatsuya', ''], ['Jimbo', 'Tomohiko', '']]","['distributed control', 'coverage control', 'aerial robot', 'mobile sensor']"
8654,2203.05824,Andreea Iana,"Mehwish Alam, Andreea Iana, Alexander Grote, Katharina Ludwig, Philipp
  M\""uller, Heiko Paulheim","Towards Analyzing the Bias of News Recommender Systems Using Sentiment
  and Stance Detection","Accepted at the 2nd International Workshop on Knowledge Graphs for
  Online Discourse Analysis (KnOD 2022) collocated with The Web Conference 2022
  (WWW'22), 25-29 April 2022, Lyon, France",,10.1145/3487553.3524674,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  News recommender systems are used by online news providers to alleviate
information overload and to provide personalized content to users. However,
algorithmic news curation has been hypothesized to create filter bubbles and to
intensify users' selective exposure, potentially increasing their vulnerability
to polarized opinions and fake news. In this paper, we show how information on
news items' stance and sentiment can be utilized to analyze and quantify the
extent to which recommender systems suffer from biases. To that end, we have
annotated a German news corpus on the topic of migration using stance detection
and sentiment analysis. In an experimental evaluation with four different
recommender systems, our results show a slight tendency of all four models for
recommending articles with negative sentiments and stances against the topic of
refugees and migration. Moreover, we observed a positive correlation between
the sentiment and stance bias of the text-based recommenders and the
preexisting user bias, which indicates that these systems amplify users'
opinions and decrease the diversity of recommended news. The knowledge-aware
model appears to be the least prone to such biases, at the cost of predictive
accuracy.
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2022 10:02:12 GMT'}]",2022-03-14,"[['Alam', 'Mehwish', ''], ['Iana', 'Andreea', ''], ['Grote', 'Alexander', ''], ['Ludwig', 'Katharina', ''], ['Müller', 'Philipp', ''], ['Paulheim', 'Heiko', '']]","['news recommendation', 'filter bubbles', 'echo chambers', 'polarization', 'stance detection', 'sentiment analysis', 'German news articles']"
8655,1711.09513,Guangfeng Lin,"Guangfeng Lin, Yajun Chen, Fan Zhao",Structure propagation for zero-shot learning,,"Chinese Conference on Pattern Recognition and Computer Vision
  (PRCV) 2018",10.1007/978-3-030-03338-5_39,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The key of zero-shot learning (ZSL) is how to find the information transfer
model for bridging the gap between images and semantic information (texts or
attributes). Existing ZSL methods usually construct the compatibility function
between images and class labels with the consideration of the relevance on the
semantic classes (the manifold structure of semantic classes). However, the
relationship of image classes (the manifold structure of image classes) is also
very important for the compatibility model construction. It is difficult to
capture the relationship among image classes due to unseen classes, so that the
manifold structure of image classes often is ignored in ZSL. To complement each
other between the manifold structure of image classes and that of semantic
classes information, we propose structure propagation (SP) for improving the
performance of ZSL for classification. SP can jointly consider the manifold
structure of image classes and that of semantic classes for approximating to
the intrinsic structure of object classes. Moreover, the SP can describe the
constrain condition between the compatibility function and these manifold
structures for balancing the influence of the structure propagation iteration.
The SP solution provides not only unseen class labels but also the relationship
of two manifold structures that encode the positive transfer in structure
propagation. Experimental results demonstrate that SP can attain the promising
results on the AwA, CUB, Dogs and SUN databases.
","[{'version': 'v1', 'created': 'Mon, 27 Nov 2017 02:51:58 GMT'}]",2019-03-07,"[['Lin', 'Guangfeng', ''], ['Chen', 'Yajun', ''], ['Zhao', 'Fan', '']]","['structure propagation', 'manifold structure', 'zero-shot learning', 'transfer']"
8656,1803.10198,Raffi Khatchadourian,"Raffi Khatchadourian (City University of New York, United States),
  Hidehiko Masuhara (The University of Tokyo, Japan)","Proactive Empirical Assessment of New Language Feature Adoption via
  Automated Refactoring: The Case of Java 8 Default Methods",,"The Art, Science, and Engineering of Programming, 2018, Vol. 2,
  Issue 3, Article 6",10.22152/programming-journal.org/2018/2/6,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Programming languages and platforms improve over time, sometimes resulting in
new language features that offer many benefits. However, despite these
benefits, developers may not always be willing to adopt them in their projects
for various reasons. In this paper, we describe an empirical study where we
assess the adoption of a particular new language feature. Studying how
developers use (or do not use) new language features is important in
programming language research and engineering because it gives designers
insight into the usability of the language to create meaning programs in that
language. This knowledge, in turn, can drive future innovations in the area.
Here, we explore Java 8 default methods, which allow interfaces to contain
(instance) method implementations.
  Default methods can ease interface evolution, make certain ubiquitous design
patterns redundant, and improve both modularity and maintainability. A focus of
this work is to discover, through a scientific approach and a novel technique,
situations where developers found these constructs useful and where they did
not, and the reasons for each. Although several studies center around assessing
new language features, to the best of our knowledge, this kind of construct has
not been previously considered.
  Despite their benefits, we found that developers did not adopt default
methods in all situations. Our study consisted of submitting pull requests
introducing the language feature to 19 real-world, open source Java projects
without altering original program semantics. This novel assessment technique is
proactive in that the adoption was driven by an automatic refactoring approach
rather than waiting for developers to discover and integrate the feature
themselves. In this way, we set forth best practices and patterns of using the
language feature effectively earlier rather than later and are able to possibly
guide (near) future language evolution. We foresee this technique to be useful
in assessing other new language features, design patterns, and other
programming idioms.
","[{'version': 'v1', 'created': 'Tue, 27 Mar 2018 17:36:32 GMT'}]",2018-03-29,"[['Khatchadourian', 'Raffi', '', 'City University of New York, United States'], ['Masuhara', 'Hidehiko', '', 'The University of Tokyo, Japan']]","['java', 'default methods', 'skeletal implementation pattern', 'empirical study']"
8657,2005.03947,Bao Trung Nguyen,"Trung B. Nguyen, Will N. Browne, Mengjie Zhang","Relatedness Measures to Aid the Transfer of Building Blocks among
  Multiple Tasks","accepted by The Genetic and Evolutionary Computation Conference
  (GECCO 2020)",,10.1145/3377930.3390169,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multitask Learning is a learning paradigm that deals with multiple different
tasks in parallel and transfers knowledge among them. XOF, a Learning
Classifier System using tree-based programs to encode building blocks
(meta-features), constructs and collects features with rich discriminative
information for classification tasks in an observed list. This paper seeks to
facilitate the automation of feature transferring in between tasks by utilising
the observed list. We hypothesise that the best discriminative features of a
classification task carry its characteristics. Therefore, the relatedness
between any two tasks can be estimated by comparing their most appropriate
patterns. We propose a multiple-XOF system, called mXOF, that can dynamically
adapt feature transfer among XOFs. This system utilises the observed list to
estimate the task relatedness. This method enables the automation of
transferring features. In terms of knowledge discovery, the resemblance
estimation provides insightful relations among multiple data. We experimented
mXOF on various scenarios, e.g. representative Hierarchical Boolean problems,
classification of distinct classes in the UCI Zoo dataset, and unrelated tasks,
to validate its abilities of automatic knowledge-transfer and estimating task
relatedness. Results show that mXOF can estimate the relatedness reasonably
between multiple tasks to aid the learning performance with the dynamic feature
transferring.
","[{'version': 'v1', 'created': 'Fri, 8 May 2020 10:26:59 GMT'}, {'version': 'v2', 'created': 'Sun, 17 May 2020 14:20:48 GMT'}]",2020-09-14,"[['Nguyen', 'Trung B.', ''], ['Browne', 'Will N.', ''], ['Zhang', 'Mengjie', '']]","['LCS', 'XCS', 'Code Fragments', 'XOF']"
8658,1805.02184,Sagar Uprety Mr.,Sagar Uprety and Yi Su and Dawei Song and Jingfei Li,Modeling Multidimensional User Relevance in IR using Vector Spaces,,,10.1145/3209978.3210130,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It has been shown that relevance judgment of documents is influenced by
multiple factors beyond topicality. Some multidimensional user relevance models
(MURM) proposed in literature have investigated the impact of different
dimensions of relevance on user judgment. Our hypothesis is that a user might
give more importance to certain relevance dimensions in a session which might
change dynamically as the session progresses. This motivates the need to
capture the weights of different relevance dimensions using feedback and build
a model to rank documents for subsequent queries according to these weights. We
propose a geometric model inspired by the mathematical framework of Quantum
theory to capture the user's importance given to each dimension of relevance
and test our hypothesis on data from a web search engine and TREC Session
track.
","[{'version': 'v1', 'created': 'Sun, 6 May 2018 10:15:16 GMT'}]",2018-05-08,"[['Uprety', 'Sagar', ''], ['Su', 'Yi', ''], ['Song', 'Dawei', ''], ['Li', 'Jingfei', '']]","['Information Retrieval', 'User modeling', 'Multidimensional Relevance']"
8659,2001.11181,Se-Eun Yoon,"Se-eun Yoon, Hyungseok Song, Kijung Shin, and Yung Yi","How Much and When Do We Need Higher-order Information in Hypergraphs? A
  Case Study on Hyperedge Prediction",,,10.1145/3366423.3380016,,cs.SI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Hypergraphs provide a natural way of representing group relations, whose
complexity motivates an extensive array of prior work to adopt some form of
abstraction and simplification of higher-order interactions. However, the
following question has yet to be addressed: How much abstraction of group
interactions is sufficient in solving a hypergraph task, and how different such
results become across datasets? This question, if properly answered, provides a
useful engineering guideline on how to trade off between complexity and
accuracy of solving a downstream task. To this end, we propose a method of
incrementally representing group interactions using a notion of n-projected
graph whose accumulation contains information on up to n-way interactions, and
quantify the accuracy of solving a task as n grows for various datasets. As a
downstream task, we consider hyperedge prediction, an extension of link
prediction, which is a canonical task for evaluating graph models. Through
experiments on 15 real-world datasets, we draw the following messages: (a)
Diminishing returns: small n is enough to achieve accuracy comparable with
near-perfect approximations, (b) Troubleshooter: as the task becomes more
challenging, larger n brings more benefit, and (c) Irreducibility: datasets
whose pairwise interactions do not tell much about higher-order interactions
lose much accuracy when reduced to pairwise abstractions.
","[{'version': 'v1', 'created': 'Thu, 30 Jan 2020 05:21:19 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Jan 2020 01:35:49 GMT'}, {'version': 'v3', 'created': 'Wed, 13 May 2020 13:17:54 GMT'}]",2020-05-14,"[['Yoon', 'Se-eun', ''], ['Song', 'Hyungseok', ''], ['Shin', 'Kijung', ''], ['Yi', 'Yung', '']]","['hypergraphs', 'hyperedge prediction', 'link prediction', 'graph mining']"
8660,2010.06404,Nampoina Andriamilanto,"Nampoina Andriamilanto, Tristan Allard, Ga\""etan Le Guelvouit","FPSelect: Low-Cost Browser Fingerprints for Mitigating Dictionary
  Attacks against Web Authentication Mechanisms",,,10.1145/3427228.3427297,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Browser fingerprinting consists into collecting attributes from a web
browser. Hundreds of attributes have been discovered through the years. Each
one of them provides a way to distinguish browsers, but also comes with a
usability cost (e.g., additional collection time). In this work, we propose
FPSelect, an attribute selection framework allowing verifiers to tune their
browser fingerprinting probes for web authentication. We formalize the problem
as searching for the attribute set that satisfies a security requirement and
minimizes the usability cost. The security is measured as the proportion of
impersonated users given a fingerprinting probe, a user population, and an
attacker that knows the exact fingerprint distribution among the user
population. The usability is quantified by the collection time of browser
fingerprints, their size, and their instability. We compare our framework with
common baselines, based on a real-life fingerprint dataset, and find out that
in our experimental settings, our framework selects attribute sets of lower
usability cost. Compared to the baselines, the attribute sets found by FPSelect
generate fingerprints that are up to 97 times smaller, are collected up to
3,361 times faster, and with up to 7.2 times less changing attributes between
two observations, on average.
","[{'version': 'v1', 'created': 'Tue, 13 Oct 2020 14:02:17 GMT'}]",2020-10-14,"[['Andriamilanto', 'Nampoina', ''], ['Allard', 'Tristan', ''], ['Guelvouit', 'Gaëtan Le', '']]","['browser fingerprinting', 'web authentication', 'multi-factor authentication']"
8661,2111.00702,Raviraj Joshi,"Vedangi Wagh, Snehal Khandve, Isha Joshi, Apurva Wani, Geetanjali
  Kale, Raviraj Joshi",Comparative Study of Long Document Classification,,,10.1109/TENCON54134.2021.9707465,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The amount of information stored in the form of documents on the internet has
been increasing rapidly. Thus it has become a necessity to organize and
maintain these documents in an optimum manner. Text classification algorithms
study the complex relationships between words in a text and try to interpret
the semantics of the document. These algorithms have evolved significantly in
the past few years. There has been a lot of progress from simple machine
learning algorithms to transformer-based architectures. However, existing
literature has analyzed different approaches on different data sets thus making
it difficult to compare the performance of machine learning algorithms. In this
work, we revisit long document classification using standard machine learning
approaches. We benchmark approaches ranging from simple Naive Bayes to complex
BERT on six standard text classification datasets. We present an exhaustive
comparison of different algorithms on a range of long document datasets. We
re-iterate that long document classification is a simpler task and even basic
algorithms perform competitively with BERT-based approaches on most of the
datasets. The BERT-based models perform consistently well on all the datasets
and can be blindly used for the document classification task when the
computations cost is not a concern. In the shallow model's category, we suggest
the usage of raw BiLSTM + Max architecture which performs decently across all
the datasets. Even simpler Glove + Attention bag of words model can be utilized
for simpler use cases. The importance of using sophisticated models is clearly
visible in the IMDB sentiment dataset which is a comparatively harder task.
","[{'version': 'v1', 'created': 'Mon, 1 Nov 2021 04:51:51 GMT'}]",2022-02-22,"[['Wagh', 'Vedangi', ''], ['Khandve', 'Snehal', ''], ['Joshi', 'Isha', ''], ['Wani', 'Apurva', ''], ['Kale', 'Geetanjali', ''], ['Joshi', 'Raviraj', '']]","['Transformer', 'BERT', 'Recurrent Neural Networks', 'Topic Identification', 'Text Categorization', 'Hierarchical Attention Networks', 'DeepLearning']"
8662,1710.09235,Jaebak Kim,J. B. Kim and E. Won,"A software framework for pipelined arithmetic algorithms in field
  programmable gate arrays","8 pages, 8 figures","Nucl. Instr. Meth. Phys. Res. A, Volume 883, 1 March 2018, Pages
  83-89",10.1016/j.nima.2017.11.064,,cs.OH cs.AR hep-ex physics.ins-det,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pipelined algorithms implemented in field programmable gate arrays are being
extensively used for hardware triggers in the modern experimental high energy
physics field and the complexity of such algorithms are increases rapidly. For
development of such hardware triggers, algorithms are developed in
$\texttt{C++}$, ported to hardware description language for synthesizing
firmware, and then ported back to $\texttt{C++}$ for simulating the firmware
response down to the single bit level. We present a $\texttt{C++}$ software
framework which automatically simulates and generates hardware description
language code for pipelined arithmetic algorithms.
","[{'version': 'v1', 'created': 'Fri, 20 Oct 2017 05:00:48 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Oct 2017 07:50:26 GMT'}, {'version': 'v3', 'created': 'Thu, 14 Dec 2017 02:39:55 GMT'}]",2017-12-15,"[['Kim', 'J. B.', ''], ['Won', 'E.', '']]","['Software framework', 'FPGA', 'Pipelined arithmetic algorithms', 'VHDL', 'C++', 'code generation']"
8663,2301.04792,Muhammad Osama,Muhammad Osama and Serban D. Porumbescu and John D. Owens,A Programming Model for GPU Load Balancing,"This work previously appeared in the author's PhD dissertation,
  available at arXiv:2212.08964 Also published in the 28th ACM SIGPLAN Annual
  Symposium on Principles and Practice of Parallel Programming (PPoPP '23)",,10.1145/3572848.3577434,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  We propose a GPU fine-grained load-balancing abstraction that decouples load
balancing from work processing and aims to support both static and dynamic
schedules with a programmable interface to implement new load-balancing
schedules. Prior to our work, the only way to unleash the GPU's potential on
irregular problems has been to workload-balance through application-specific,
tightly coupled load-balancing techniques. With our open-source framework for
load-balancing, we hope to improve programmers' productivity when developing
irregular-parallel algorithms on the GPU, and also improve the overall
performance characteristics for such applications by allowing a quick path to
experimentation with a variety of existing load-balancing techniques.
Consequently, we also hope that by separating the concerns of load-balancing
from work processing within our abstraction, managing and extending existing
code to future architectures becomes easier.
","[{'version': 'v1', 'created': 'Thu, 12 Jan 2023 03:14:37 GMT'}]",2023-01-13,"[['Osama', 'Muhammad', ''], ['Porumbescu', 'Serban D.', ''], ['Owens', 'John D.', '']]","['load balancing', 'sparse computation', 'GPU', 'scheduling']"
8664,1711.10925,Dmitry Ulyanov,"Dmitry Ulyanov, Andrea Vedaldi, Victor Lempitsky",Deep Image Prior,,,10.1007/s11263-020-01303-4,,cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep convolutional networks have become a popular tool for image generation
and restoration. Generally, their excellent performance is imputed to their
ability to learn realistic image priors from a large number of example images.
In this paper, we show that, on the contrary, the structure of a generator
network is sufficient to capture a great deal of low-level image statistics
prior to any learning. In order to do so, we show that a randomly-initialized
neural network can be used as a handcrafted prior with excellent results in
standard inverse problems such as denoising, super-resolution, and inpainting.
Furthermore, the same prior can be used to invert deep neural representations
to diagnose them, and to restore images based on flash-no flash input pairs.
  Apart from its diverse applications, our approach highlights the inductive
bias captured by standard generator network architectures. It also bridges the
gap between two very popular families of image restoration methods:
learning-based methods using deep convolutional networks and learning-free
methods based on handcrafted image priors such as self-similarity. Code and
supplementary material are available at
https://dmitryulyanov.github.io/deep_image_prior .
","[{'version': 'v1', 'created': 'Wed, 29 Nov 2017 15:50:05 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Nov 2017 10:14:39 GMT'}, {'version': 'v3', 'created': 'Thu, 5 Apr 2018 14:37:57 GMT'}, {'version': 'v4', 'created': 'Sun, 17 May 2020 10:57:04 GMT'}]",2020-05-19,"[['Ulyanov', 'Dmitry', ''], ['Vedaldi', 'Andrea', ''], ['Lempitsky', 'Victor', '']]","['Convolutional networks', 'generative deepnetworks', 'inverse problems', 'image restoration', 'imagesuperresolution', 'image denoising', 'natural image prior']"
8665,2108.03758,Susanne Braun,"Susanne Braun, Stefan De{\ss}loch, Eberhard Wolff, Frank Elberzhager
  and Andreas Jedlitschka","Tackling Consistency-related Design Challenges of Distributed
  Data-Intensive Systems - An Action Research Study","To be published in the proceedings of the 15th ACM/IEEE International
  Symposium on Empirical Software Engineering and Measurement (ESEM) (ESEM 21).
  It is available online at: https://doi.org/10.1145/3475716.3475771",,10.1145/3475716.3475771,,cs.SE cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Distributed data-intensive systems are increasingly designed to
be only eventually consistent. Persistent data is no longer processed with
serialized and transactional access, exposing applications to a range of
potential concurrency anomalies that need to be handled by the application
itself. Controlling concurrent data access in monolithic systems is already
challenging, but the problem is exacerbated in distributed systems. To make it
worse, only little systematic engineering guidance is provided by the software
architecture community regarding this issue. Aims: In this paper, we report on
our study of the effectiveness and applicability of the novel design guidelines
we are proposing in this regard. Method: We used action research and conducted
it in the context of the software architecture design process of a multi-site
platform development project. Results: Our hypotheses regarding effectiveness
and applicability have been accepted in the context of the study. The initial
design guidelines were refined throughout the study. Thus, we also contribute
concrete guidelines for architecting distributed data-intensive systems with
eventually consistent data. The guidelines are an advancement of Domain-Driven
Design and provide additional patterns for the tactical design part.
Conclusions: Based on our results, we recommend using the guidelines to
architect safe eventually consistent systems. Because of the relevance of
distributed data-intensive systems, we will drive this research forward and
evaluate it in further domains.
","[{'version': 'v1', 'created': 'Sun, 8 Aug 2021 23:02:15 GMT'}]",2021-08-10,"[['Braun', 'Susanne', ''], ['Deßloch', 'Stefan', ''], ['Wolff', 'Eberhard', ''], ['Elberzhager', 'Frank', ''], ['Jedlitschka', 'Andreas', '']]","['eventual consistency', 'domain-driven design', 'action research']"
8666,1810.02490,Mostafa Zaman Chowdhury,Mostafa Zaman Chowdhury and Yeong Min Jang,CAC and Traffic Modeling for Integrated Macrocell/Femtocell Networks,"International Conference on Ubiquitous and Future Networks (ICUFN),
  July 2012, Thailand",,10.1109/ICUFN.2012.6261709,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dense femtocells and the integration of these femtocells with the macrocell
are the ultimate goal of the femtocellular network deployment. Integrated
macrocell/femtocell networks surely able to provide high data rate for the
indoor users as well as able to offload huge traffic from the macrocellular
networks to femtocellular networks. Efficient handling of handover calls is the
key for the successful macrocell/femtocell integration. An appropriate traffic
model for the integrated macrocell/femtocell networks is also needed for the
performance analysis measurement. In this paper we presented a call admission
control process and a traffic model for the integrated macrocell/femtocell
networks. The numerical and simulation results show the important of the
integrated macrocell/femtocell network and the performance improvement of the
proposed schemes.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 01:57:36 GMT'}]",2018-10-08,"[['Chowdhury', 'Mostafa Zaman', ''], ['Jang', 'Yeong Min', '']]","['Femtocell', 'handover', 'traffic model', 'CAC']"
8667,2006.13660,Aleksey Fedoseev,"Aleksey Fedoseev, Akerke Tleugazy, Luiza Labazanova and Dzmitry
  Tsetserukou","TeslaMirror: Multistimulus Encounter-Type Haptic Display for Shape and
  Texture Rendering in VR","Accepted to the ACM SIGGRAPH 2020 conference (Emerging Technologies
  section), ACM copyright, 2 pages, 3 figures, 1 table",,10.1145/3388534.3407300,,cs.HC cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a novel concept of a hybrid tactile display with
multistimulus feedback, allowing the real-time experience of the position,
shape, and texture of the virtual object. The key technology of the TeslaMirror
is that we can deliver the sensation of object parameters (pressure, vibration,
and electrotactile feedback) without any wearable haptic devices. We developed
the full digital twin of the 6 DOF UR robot in the virtual reality (VR)
environment, allowing the adaptive surface simulation and control of the hybrid
display in real-time. The preliminary user study was conducted to evaluate the
ability of TeslaMirror to reproduce shape sensations with the under-actuated
end-effector. The results revealed that potentially this approach can be used
in the virtual systems for rendering versatile VR shapes with high fidelity
haptic experience.
","[{'version': 'v1', 'created': 'Tue, 23 Jun 2020 14:33:17 GMT'}, {'version': 'v2', 'created': 'Sun, 5 Jul 2020 15:51:49 GMT'}]",2020-07-07,"[['Fedoseev', 'Aleksey', ''], ['Tleugazy', 'Akerke', ''], ['Labazanova', 'Luiza', ''], ['Tsetserukou', 'Dzmitry', '']]","['3D interaction', 'collaborative technologies', 'haptics', 'interaction technologies', 'robotics', 'shape-changing interfaces', 'virtual reality']"
8668,2103.05862,Katie Seaborn,Katie Seaborn,Removing Gamification: A Research Agenda,Accepted at CHI EA 2021,,10.1145/3411763.3451695,,cs.HC cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The effect of removing gamification elements from interactive systems has
been a long-standing question in gamification research. Early work and
foundational theories raised concerns about the endurance of positive effects
and the emergence of negative ones. Yet, nearly a decade later, no work to date
has sought consensus on these matters. Here, I offer a rapid review on the
state of the art and what is known about the impact of removing gamification. A
small corpus of 8 papers published between 2012 and 2020 were found. Findings
suggest a mix of positive and negative effects related to removing
gamification. Significantly, insufficient reporting, methodological weaknesses,
limited measures, and superficial interpretations of ""negative"" results prevent
firm conclusions. I offer a research agenda towards better understanding the
nature of gamification removal. I end with a call for empirical and theoretical
work on illuminating the effects that may linger after systems are un-gamified.
","[{'version': 'v1', 'created': 'Wed, 10 Mar 2021 03:59:46 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Mar 2021 00:36:35 GMT'}]",2021-03-16,"[['Seaborn', 'Katie', '']]","['Gamification', 'Longitudinal effects', 'Gamification removal', 'Un']"
8669,2109.05223,Yonggan Fu,"Yonggan Fu, Yang Zhao, Qixuan Yu, Chaojian Li, Yingyan Lin","2-in-1 Accelerator: Enabling Random Precision Switch for Winning Both
  Adversarial Robustness and Efficiency",Accepted at MICRO 2021,,10.1145/3466752.3480082,,cs.LG cs.AR cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The recent breakthroughs of deep neural networks (DNNs) and the advent of
billions of Internet of Things (IoT) devices have excited an explosive demand
for intelligent IoT devices equipped with domain-specific DNN accelerators.
However, the deployment of DNN accelerator enabled intelligent functionality
into real-world IoT devices still remains particularly challenging. First,
powerful DNNs often come at prohibitive complexities, whereas IoT devices often
suffer from stringent resource constraints. Second, while DNNs are vulnerable
to adversarial attacks especially on IoT devices exposed to complex real-world
environments, many IoT applications require strict security. Existing DNN
accelerators mostly tackle only one of the two aforementioned challenges (i.e.,
efficiency or adversarial robustness) while neglecting or even sacrificing the
other. To this end, we propose a 2-in-1 Accelerator, an integrated
algorithm-accelerator co-design framework aiming at winning both the
adversarial robustness and efficiency of DNN accelerators. Specifically, we
first propose a Random Precision Switch (RPS) algorithm that can effectively
defend DNNs against adversarial attacks by enabling random DNN quantization as
an in-situ model switch. Furthermore, we propose a new precision-scalable
accelerator featuring (1) a new precision-scalable MAC unit architecture which
spatially tiles the temporal MAC units to boost both the achievable efficiency
and flexibility and (2) a systematically optimized dataflow that is searched by
our generic accelerator optimizer. Extensive experiments and ablation studies
validate that our 2-in-1 Accelerator can not only aggressively boost both the
adversarial robustness and efficiency of DNN accelerators under various
attacks, but also naturally support instantaneous robustness-efficiency
trade-offs adapting to varied resources without the necessity of DNN
retraining.
","[{'version': 'v1', 'created': 'Sat, 11 Sep 2021 08:51:01 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Sep 2021 01:57:04 GMT'}]",2021-09-22,"[['Fu', 'Yonggan', ''], ['Zhao', 'Yang', ''], ['Yu', 'Qixuan', ''], ['Li', 'Chaojian', ''], ['Lin', 'Yingyan', '']]","['neural networks', 'model robustness', 'precision-scalable accelerators']"
8670,2212.03359,Ian McQuillan,"Arturo Carpi, Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan","Relationships Between Bounded Languages, Counter Machines, Finite-Index
  Grammars, Ambiguity, and Commutative Regularity","28 pages, 4 images","Theoretical Computer Science 862, 97--118 (2021)",10.1016/j.tcs.2019.09.045,,cs.FL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  It is shown that for every language family that is a trio containing only
semilinear languages, all bounded languages in it can be accepted by one-way
deterministic reversal-bounded multicounter machines (DCM). This implies that
for every semilinear trio (where these properties are effective), it is
possible to decide containment, equivalence, and disjointness concerning its
bounded languages. A condition is also provided for when the bounded languages
in a semilinear trio coincide exactly with those accepted by DCM machines, and
it is used to show that many grammar systems of finite index -- such as
finite-index matrix grammars and finite-index ETOL -- have identical bounded
languages as DCM.
  Then connections between ambiguity, counting regularity, and commutative
regularity are made, as many machines and grammars that are unambiguous can
only generate/accept counting regular or commutatively regular languages. Thus,
such a system that can generate/accept a non-counting regular or
non-commutatively regular language implies the existence of inherently
ambiguous languages over that system. In addition, it is shown that every
language generated by an unambiguous finite-index matrix grammar has a rational
characteristic series in commutative variables, and is counting regular. This
result plus the connections are used to demonstrate that finite-index matrix
grammars and finite-index ETOL can generate inherently ambiguous languages
(over their grammars), as do several machine models. It is also shown that all
bounded languages generated by these two grammar systems (those in any
semilinear trio) can be generated unambiguously within the systems. Finally,
conditions on languages generated by finite-index matrix grammars and
finite-index ETOL implying commutative regularity are obtained. In particular,
it is shown that every finite-index EDOL language is commutatively regular.
","[{'version': 'v1', 'created': 'Tue, 6 Dec 2022 22:59:23 GMT'}]",2022-12-08,"[['Carpi', 'Arturo', ''], [""D'Alessandro"", 'Flavio', ''], ['Ibarra', 'Oscar H.', ''], ['McQuillan', 'Ian', '']]","['ET0L Systems', 'Matrix Grammars', 'Rational Series', 'Commutative Equivalence', 'CounterMachines']"
8671,1905.06081,Timur Sokhin,"Timur Sokhin, Nikolay Butakov, Denis Nasonov","User profiles matching for different social networks based on faces
  embeddings",Submitted to HAIS 2019 conference,,10.1007/978-3-030-29859-3_47,,cs.CV cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is common practice nowadays to use multiple social networks for different
social roles. Although this, these networks assume differences in content type,
communications and style of speech. If we intend to understand human behaviour
as a key-feature for recommender systems, banking risk assessments or
sociological researches, this is better to achieve using a combination of the
data from different social media. In this paper, we propose a new approach for
user profiles matching across social media based on embeddings of publicly
available users' face photos and conduct an experimental study of its
efficiency. Our approach is stable to changes in content and style for certain
social media.
","[{'version': 'v1', 'created': 'Wed, 15 May 2019 10:50:51 GMT'}]",2020-05-07,"[['Sokhin', 'Timur', ''], ['Butakov', 'Nikolay', ''], ['Nasonov', 'Denis', '']]","['face detection', 'profiles', 'matching', 'social networks', 'face embedding', 'clustering', 'computer vision']"
8672,1910.07879,Louis Duvivier,"Louis Duvivier, R\'emy Cazabet, C\'eline Robardet","Minimum entropy stochastic block models neglect edge distribution
  heterogeneity",,,10.1007/978-3-030-36687-2_45,,cs.SI cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The statistical inference of stochastic block models as emerged as a
mathematicaly principled method for identifying communities inside networks.
Its objective is to find the node partition and the block-to-block adjacency
matrix of maximum likelihood i.e. the one which has most probably generated the
observed network. In practice, in the so-called microcanonical ensemble, it is
frequently assumed that when comparing two models which have the same number
and sizes of communities, the best one is the one of minimum entropy i.e. the
one which can generate the less different networks. In this paper, we show that
there are situations in which the minimum entropy model does not identify the
most significant communities in terms of edge distribution, even though it
generates the observed graph with a higher probability.
","[{'version': 'v1', 'created': 'Thu, 17 Oct 2019 13:11:42 GMT'}]",2020-12-17,"[['Duvivier', 'Louis', ''], ['Cazabet', 'Rémy', ''], ['Robardet', 'Céline', '']]","['network', 'community detection', 'stochastic block model', 'statistical inference', 'entropy']"
8673,2011.00236,Khaled Alanezi,Khaled Alanezi and Shivakant Mishra,"An edge-based architecture to support the execution of ambience
  intelligence tasks using the IoP paradigm",Journal paper,Elsevier Future Generation Computer Systems 2020,10.1016/j.future.2020.08.001,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In an IoP environment, edge computing has been proposed to address the
problems of resource limitations of edge devices such as smartphones as well as
the high-latency, user privacy exposure and network bottleneck that the cloud
computing platform solutions incur. This paper presents a context management
framework comprised of sensors, mobile devices such as smartphones and an edge
server to enable high performance, context-aware computing at the edge. Key
features of this architecture include energy-efficient discovery of available
sensors and edge services for the client, an automated mechanism for task
planning and execution on the edge server, and a dynamic environment where new
sensors and services may be added to the framework. A prototype of this
architecture has been implemented, and an experimental evaluation using two
computer vision tasks as example services is presented. Performance measurement
shows that the execution of the example tasks performs quite well and the
proposed framework is well suited for an edge-computing environment.
","[{'version': 'v1', 'created': 'Sat, 31 Oct 2020 10:48:44 GMT'}]",2020-11-03,"[['Alanezi', 'Khaled', ''], ['Mishra', 'Shivakant', '']]","['Internet of People', 'Ambience Intelligence', 'Internet of Things', 'Edge Intelligence']"
8674,2209.05843,Vlad Stirbu,"Vlad Stirbu, Tuomas Granlund, Tommi Mikkonen","Continuous Design Control for Machine Learning in Certified Medical
  Systems",,,10.1007/s11219-022-09601-5,,cs.SE cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Continuous software engineering has become commonplace in numerous fields.
However, in regulating intensive sectors, where additional concerns needs to be
taken into account, it is often considered difficult to apply continuous
development approaches, such as devops. In this paper, we present an approach
for using pull requests as design controls, and apply this approach to machine
learning in certified medical systems leveraging model cards, a novel technique
developed to add explainability to machine learning systems, as a regulatory
audit trail. The approach is demonstrated with an industrial system that we
have used previously to show how medical systems can be developed in a
continuous fashion.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2022 09:42:04 GMT'}]",2022-10-18,"[['Stirbu', 'Vlad', ''], ['Granlund', 'Tuomas', ''], ['Mikkonen', 'Tommi', '']]","['Machine learning', 'ML', 'MLOps', 'CD4ML', 'design control', 'medicalsoftware', 'regulated software', 'continuous engineering']"
8675,2108.04232,Filip Biljecki,"Abraham Noah Wu, Filip Biljecki",GANmapper: geographical data translation,,International Journal of Geographical Information Science 2022,10.1080/13658816.2022.2041643,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new method to create spatial data using a generative adversarial
network (GAN). Our contribution uses coarse and widely available geospatial
data to create maps of less available features at the finer scale in the built
environment, bypassing their traditional acquisition techniques (e.g. satellite
imagery or land surveying). In the work, we employ land use data and road
networks as input to generate building footprints and conduct experiments in 9
cities around the world. The method, which we implement in a tool we release
openly, enables the translation of one geospatial dataset to another with high
fidelity and morphological accuracy. It may be especially useful in locations
missing detailed and high-resolution data and those that are mapped with
uncertain or heterogeneous quality, such as much of OpenStreetMap. The quality
of the results is influenced by the urban form and scale. In most cases, the
experiments suggest promising performance as the method tends to truthfully
indicate the locations, amount, and shape of buildings. The work has the
potential to support several applications, such as energy, climate, and urban
morphology studies in areas previously lacking required data or inpainting
geospatial data in regions with incomplete data.
","[{'version': 'v1', 'created': 'Sat, 7 Aug 2021 05:50:54 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Feb 2022 06:03:55 GMT'}]",2022-02-22,"[['Wu', 'Abraham Noah', ''], ['Biljecki', 'Filip', '']]","['Deep learning', 'Machine learning', 'Cartography', 'GIScience', 'GeoAI']"
8676,2204.11073,Edan Hauon Hauon,"Oren Barkan, Edan Hauon, Avi Caciularu, Ori Katz, Itzik Malkiel, Omri
  Armstrong, Noam Koenigstein",Grad-SAM: Explaining Transformers via Gradient Self-Attention Maps,,,10.1145/3459637.3482126,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transformer-based language models significantly advanced the state-of-the-art
in many linguistic tasks. As this revolution continues, the ability to explain
model predictions has become a major area of interest for the NLP community. In
this work, we present Gradient Self-Attention Maps (Grad-SAM) - a novel
gradient-based method that analyzes self-attention units and identifies the
input elements that explain the model's prediction the best. Extensive
evaluations on various benchmarks show that Grad-SAM obtains significant
improvements over state-of-the-art alternatives.
","[{'version': 'v1', 'created': 'Sat, 23 Apr 2022 13:56:55 GMT'}]",2022-04-26,"[['Barkan', 'Oren', ''], ['Hauon', 'Edan', ''], ['Caciularu', 'Avi', ''], ['Katz', 'Ori', ''], ['Malkiel', 'Itzik', ''], ['Armstrong', 'Omri', ''], ['Koenigstein', 'Noam', '']]","['Explainable & Interpretable AI', 'NLP', 'Deep Learning', 'BERT', 'Transformers', 'Self-Attention', 'Transparent Machine Learning']"
8677,2208.04563,Tarun Rambha,"Saumya Bhatnagar, Tarun Rambha, Gitakrishnan Ramadurai",An Agent-Based Fleet Management Model for First- and Last-Mile Services,,,10.1007/s11116-022-10363-z,,cs.MA,http://creativecommons.org/licenses/by/4.0/,"  With the growth of cars and car-sharing applications, commuters in many
cities, particularly developing countries, are shifting away from public
transport. These shifts have affected two key stakeholders: transit operators
and first- and last-mile (FLM) services. Although most cities continue to
invest heavily in bus and metro projects to make public transit attractive,
ridership in these systems has often failed to reach targeted levels. FLM
service providers also experience lower demand and revenues in the wake of
shifts to other means of transport. Effective FLM options are required to
prevent this phenomenon and make public transport attractive for commuters. One
possible solution is to forge partnerships between public transport and FLM
providers that offer competitive joint mobility options. Such solutions require
prudent allocation of supply and optimised strategies for FLM operations and
ride-sharing. To this end, we build an agent- and event-based simulation model
which captures interactions between passengers and FLM services using
statecharts, vehicle routing models, and other trip matching rules. An
optimisation model for allocating FLM vehicles at different transit stations is
proposed to reduce unserved requests. Using real-world metro transit demand
data from Bengaluru, India, the effectiveness of our approach in improving FLM
connectivity and quantifying the benefits of sharing trips is demonstrated.
","[{'version': 'v1', 'created': 'Tue, 9 Aug 2022 06:52:28 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Dec 2022 12:56:27 GMT'}]",2022-12-06,"[['Bhatnagar', 'Saumya', ''], ['Rambha', 'Tarun', ''], ['Ramadurai', 'Gitakrishnan', '']]","['first-and last-mile services', 'agent-based modelling', 'multimodal transport', 'public transit', 'shared mobility']"
8678,2109.00468,Eric Schares,Eric Schares,"Unsub Extender: a Python-based web application for visualizing Unsub
  data",27 pages,,10.1162/qss_a_00200,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article introduces Unsub Extender, a free tool to help libraries analyze
their Unsub data export files. Unsub is a collection development dashboard that
gathers and forecasts journal-level usage metrics to provide academic libraries
with deeper measurements than traditional cost-per-use. Unsub gives libraries
richer and more nuanced data to analyze their subscriptions, but it does not
include a way to easily visualize the complex and interrelated data points it
provides. Unsub Extender (https://unsubextender.lib.iastate.edu) is a free
Python-based web application that takes an Unsub export file and automates the
creation of interactive plots and visualizations. The tool loads with example
data to explore, and users upload their specific Unsub file to quickly populate
the pre-made plots with actual data. Graphs are interactive, live-updating, and
support zoom, click-and-drag, and hover. Filters are specified through sliders
to model scenarios and focus on areas of interest. A drop-down menu allows
users to change a journal's decision status, and graphs update automatically.
After evaluating journals, users can export the modified dataset to save their
decisions. Unsub Extender proposes best practice in analyzing the increasingly
common Unsub export file. It simplifies the analysis, eliminates duplication of
effort, and enables libraries worldwide to make better, more data-driven
decisions.
","[{'version': 'v1', 'created': 'Wed, 1 Sep 2021 16:21:10 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Jun 2022 14:05:26 GMT'}]",2022-10-26,"[['Schares', 'Eric', '']]","['collection development', 'collection analysis', 'Big Deal', 'Python', 'datavisualization', 'journal publishing']"
8679,2011.14035,Constantinos Chamzas,"Dimitrios Chamzas, Constantinos Chamzas and Konstantinos Moustakas","cMinMax: A Fast Algorithm to Find the Corners of an N-dimensional Convex
  Polytope","Accepted in GRAPP 2021, Code available at
  https://github.com/jimas95/CMinMax and video presentation at
  https://www.youtube.com/watch?v=Ug313Nf-S-A",,10.5220/0010259002290236,,cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During the last years, the emerging field of Augmented & Virtual Reality
(AR-VR) has seen tremendousgrowth. At the same time there is a trend to develop
low cost high-quality AR systems where computing poweris in demand. Feature
points are extensively used in these real-time frame-rate and 3D applications,
thereforeefficient high-speed feature detectors are necessary. Corners are such
special features and often are used as thefirst step in the marker alignment in
Augmented Reality (AR). Corners are also used in image registration
andrecognition, tracking, SLAM, robot path finding and 2D or 3D object
detection and retrieval. Therefore thereis a large number of corner detection
algorithms but most of them are too computationally intensive for use
inreal-time applications of any complexity. Many times the border of the image
is a convex polygon. For thisspecial, but quite common case, we have developed
a specific algorithm, cMinMax. The proposed algorithmis faster, approximately
by a factor of 5 compared to the widely used Harris Corner Detection algorithm.
Inaddition is highly parallelizable. The algorithm is suitable for the fast
registration of markers in augmentedreality systems and in applications where a
computationally efficient real time feature detector is necessary.The algorithm
can also be extended to N-dimensional polyhedrons.
","[{'version': 'v1', 'created': 'Sat, 28 Nov 2020 00:32:11 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Mar 2021 15:11:00 GMT'}, {'version': 'v3', 'created': 'Fri, 13 May 2022 19:33:33 GMT'}]",2022-05-17,"[['Chamzas', 'Dimitrios', ''], ['Chamzas', 'Constantinos', ''], ['Moustakas', 'Konstantinos', '']]","['Augmented reality environments', 'Image Registration', 'Convex Polygon Corner Detection Algorithm', 'NDimensional Convex Polyhedrons']"
8680,1906.09239,Mohammadreza Kasaei,"Mohammadreza Kasaei, Nuno Lau, Artur Pereira","A Robust Biped Locomotion Based on Linear-Quadratic-Gaussian Controller
  and Divergent Component of Motion",,,10.1109/IROS40897.2019.8967778,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generating robust locomotion for a humanoid robot in the presence of
disturbances is difficult because of its high number of degrees of freedom and
its unstable nature. In this paper, we used the concept of Divergent Component
of Motion~(DCM) and propose an optimal closed-loop controller based on
Linear-Quadratic-Gaussian to generate a robust and stable walking for humanoid
robots. The biped robot dynamics has been approximated using the Linear
Inverted Pendulum Model~(LIPM). Moreover, we propose a controller to adjust the
landing location of the swing leg to increase the withstanding level of the
robot against a severe external push. The performance and also the robustness
of the proposed controller is analyzed and verified by performing a set of
simulations using~\mbox{MATLAB}. The simulation results showed that the
proposed controller is capable of providing a robust walking even in the
presence of disturbances and in challenging situations.
","[{'version': 'v1', 'created': 'Fri, 21 Jun 2019 16:59:32 GMT'}]",2021-12-23,"[['Kasaei', 'Mohammadreza', ''], ['Lau', 'Nuno', ''], ['Pereira', 'Artur', '']]","['Biped locomotion', 'Humanoid robot', 'Robustwalk engine', 'Linear inverted pendulum', 'Linear-QuadraticGaussian (LQG).I']"
8681,2203.15577,Peng Liang,"Liming Fu, Peng Liang, Beiqi Zhang","Understanding Code Snippets in Code Reviews: A Preliminary Study of the
  OpenStack Community","The 30th IEEE/ACM International Conference on Program Comprehension
  (ICPC) ERA Track",,10.1145/3524610.3527884,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Code review is a mature practice for software quality assurance in software
development with which reviewers check the code that has been committed by
developers, and verify the quality of code. During the code review discussions,
reviewers and developers might use code snippets to provide necessary
information (e.g., suggestions or explanations). However, little is known about
the intentions and impacts of code snippets in code reviews. To this end, we
conducted a preliminary study to investigate the nature of code snippets and
their purposes in code reviews. We manually collected and checked 10,790 review
comments from the Nova and Neutron projects of the OpenStack community, and
finally obtained 626 review comments that contain code snippets for further
analysis. The results show that: (1) code snippets are not prevalently used in
code reviews, and most of the code snippets are provided by reviewers. (2) We
identified two high-level purposes of code snippets provided by reviewers
(i.e., Suggestion and Citation) with six detailed purposes, among which,
Improving Code Implementation is the most common purpose. (3) For the code
snippets in code reviews with the aim of suggestion, around 68.1% was accepted
by developers. The results highlight promising research directions on using
code snippets in code reviews.
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2022 13:56:48 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Mar 2022 01:14:30 GMT'}]",2022-03-31,"[['Fu', 'Liming', ''], ['Liang', 'Peng', ''], ['Zhang', 'Beiqi', '']]","['Code Snippet', 'Code Review', 'OpenStack']"
8682,1908.10644,Luca Calderoni,"Luca Calderoni, Dario Maio, Paolo Palmieri",Bloom filter variants for multiple sets: a comparative assessment,,"JUCS - Journal of Universal Computer Science vol. 28 issue 2
  (2022) pp. 120-140",10.3897/jucs.74230,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we compare two probabilistic data structures for association
queries derived from the well-known Bloom filter: the shifting Bloom filter
(ShBF), and the spatial Bloom filter (SBF). With respect to the original data
structure, both variants add the ability to store multiple subsets in the same
filter, using different strategies. We analyse the performance of the two data
structures with respect to false positive probability, and the inter-set error
probability (the probability for an element in the set of being recognised as
belonging to the wrong subset). As part of our analysis, we extended the
functionality of the shifting Bloom filter, optimising the filter for any
non-trivial number of subsets. We propose a new generalised ShBF definition
with applications outside of our specific domain, and present new probability
formulas. Results of the comparison show that the ShBF provides better space
efficiency, but at a significantly higher computational cost than the SBF.
","[{'version': 'v1', 'created': 'Wed, 28 Aug 2019 11:13:03 GMT'}]",2022-05-06,"[['Calderoni', 'Luca', ''], ['Maio', 'Dario', ''], ['Palmieri', 'Paolo', '']]","['probabilistic data structures', 'spatial bloom filter', 'shifting bloom filter', 'association queries']"
8683,2206.13749,Rongzhi Zhang,"Rongzhi Zhang, Rebecca West, Xiquan Cui, Chao Zhang","Adaptive Multi-view Rule Discovery for Weakly-Supervised Compatible
  Products Prediction",KDD 2022 Applied Data Science Track,,10.1145/3534678.3539208,,cs.LG cs.CL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  On e-commerce platforms, predicting if two products are compatible with each
other is an important functionality to achieve trustworthy product
recommendation and search experience for consumers. However, accurately
predicting product compatibility is difficult due to the heterogeneous product
data and the lack of manually curated training data. We study the problem of
discovering effective labeling rules that can enable weakly-supervised product
compatibility prediction. We develop AMRule, a multi-view rule discovery
framework that can (1) adaptively and iteratively discover novel rulers that
can complement the current weakly-supervised model to improve compatibility
prediction; (2) discover interpretable rules from both structured attribute
tables and unstructured product descriptions. AMRule adaptively discovers
labeling rules from large-error instances via a boosting-style strategy, the
high-quality rules can remedy the current model's weak spots and refine the
model iteratively. For rule discovery from structured product attributes, we
generate composable high-order rules from decision trees; and for rule
discovery from unstructured product descriptions, we generate prompt-based
rules from a pre-trained language model. Experiments on 4 real-world datasets
show that AMRule outperforms the baselines by 5.98% on average and improves
rule quality and rule proposal efficiency.
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2022 04:11:58 GMT'}]",2022-06-29,"[['Zhang', 'Rongzhi', ''], ['West', 'Rebecca', ''], ['Cui', 'Xiquan', ''], ['Zhang', 'Chao', '']]","['Rule Discovery', 'Weak Supervision', 'Compatible Products']"
8684,2109.12855,Jari Pronold,"Jari Pronold, Jakob Jordan, Brian J. N. Wylie, Itaru Kitayama, Markus
  Diesmann, Susanne Kunkel","Routing brain traffic through the von Neumann bottleneck: Efficient
  cache usage in spiking neural network simulation code on general purpose
  computers",,,10.1016/j.parco.2022.102952,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Simulation is a third pillar next to experiment and theory in the study of
complex dynamic systems such as biological neural networks. Contemporary
brain-scale networks correspond to directed graphs of a few million nodes, each
with an in-degree and out-degree of several thousands of edges, where nodes and
edges correspond to the fundamental biological units, neurons and synapses,
respectively. When considering a random graph, each node's edges are
distributed across thousands of parallel processes. The activity in neuronal
networks is also sparse. Each neuron occasionally transmits a brief signal,
called spike, via its outgoing synapses to the corresponding target neurons.
This spatial and temporal sparsity represents an inherent bottleneck for
simulations on conventional computers: Fundamentally irregular memory-access
patterns cause poor cache utilization. Using an established neuronal network
simulation code as a reference implementation, we investigate how common
techniques to recover cache performance such as software-induced prefetching
and software pipelining can benefit a real-world application. The algorithmic
changes reduce simulation time by up to 50%. The study exemplifies that
many-core systems assigned with an intrinsically parallel computational problem
can overcome the von Neumann bottleneck of conventional computer architectures.
","[{'version': 'v1', 'created': 'Mon, 27 Sep 2021 07:57:11 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Mar 2022 08:59:02 GMT'}]",2022-08-03,"[['Pronold', 'Jari', ''], ['Jordan', 'Jakob', ''], ['Wylie', 'Brian J. N.', ''], ['Kitayama', 'Itaru', ''], ['Diesmann', 'Markus', ''], ['Kunkel', 'Susanne', '']]","['spiking neural networks', 'large-scale simulation', 'cache performance', 'distributed computing', 'parallel computing', 'memory access bottleneck']"
8685,1606.03184,Tarun Yadav,"Tarun Yadav, Rao Arvind Mallari",Technical Aspects of Cyber Kill Chain,"7 pages, 1 figure, 4 tables, The final publication is available at
  Springer via http://dx.doi.org/10.1007/978-3-319-22915-7_40",,10.1007/978-3-319-22915-7_40,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent trends in targeted cyber-attacks has increased the interest of
research in the field of cyber security. Such attacks have massive disruptive
effects on rganizations, enterprises and governments. Cyber kill chain is a
model to describe cyber-attacks so as to develop incident response and analysis
capabilities. Cyber kill chain in simple terms is an attack chain, the path
that an intruder takes to penetrate information systems over time to execute an
attack on the target. This paper broadly categories the methodologies,
techniques and tools involved in cyber-attacks. This paper intends to help a
cyber security researcher to realize the options available to an attacker at
every stage of a cyber-attack.
","[{'version': 'v1', 'created': 'Fri, 10 Jun 2016 05:30:57 GMT'}]",2016-06-13,"[['Yadav', 'Tarun', ''], ['Mallari', 'Rao Arvind', '']]","['Reconnaissance', 'RAT', 'Exploit', 'Cyber Attack', 'Persistence', 'Command & Control']"
8686,2211.10756,Hanuma Teja Maddali,Hanuma Teja Maddali and Emma Dixon and Alisha Pradhan and Amanda Lazar,"Investigating the Potential of Artificial Intelligence Powered
  Interfaces to Support Different Types of Memory for People with Dementia",7 pages,"Extended Abstracts of the 2022 CHI Conference on Human Factors in
  Computing Systems (CHI EA '22). Association for Computing Machinery, New
  York, NY, USA, Article 226, 1-7",10.1145/3491101.3519858,,cs.HC cs.AI,http://creativecommons.org/licenses/by/4.0/,"  There has been a growing interest in HCI to understand the specific
technological needs of people with dementia and supporting them in
self-managing daily activities. One of the most difficult challenges to address
is supporting the fluctuating accessibility needs of people with dementia,
which vary with the specific type of dementia and the progression of the
condition. Researchers have identified auto-personalized interfaces, and more
recently, Artificial Intelligence or AI-driven personalization as a potential
solution to making commercial technology accessible in a scalable manner for
users with fluctuating ability. However, there is a lack of understanding on
the perceptions of people with dementia around AI as an aid to their everyday
technology use and its role in their overall self-management systems, which
include other non-AI technology, and human assistance. In this paper, we
present future directions for the design of AI-based systems to personalize an
interface for dementia-related changes in different types of memory, along with
expectations for AI interactions with the user with dementia.
","[{'version': 'v1', 'created': 'Sat, 19 Nov 2022 17:31:45 GMT'}]",2022-11-22,"[['Maddali', 'Hanuma Teja', ''], ['Dixon', 'Emma', ''], ['Pradhan', 'Alisha', ''], ['Lazar', 'Amanda', '']]","['artificial intelligence', 'auto-personalization', 'dementia', 'accessibility']"
8687,2212.01030,Yoichi Yamazaki,"Takashi Kanetsuna, Kazuaki Takeuchi, Hiroaki Kato, Taichi Sono,
  Hirotaka Osawa, Kentaro Yoshifuji, Yoichi Yamazaki","Interaction in Remote Peddling Using Avatar Robot by People with
  Disabilities","HAI '22, 3 Pages",,10.1145/3527188.3563915,,cs.RO cs.CY cs.HC cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Telework ""avatar work,"" in which people with disabilities can engage in
physical work such as customer service, is being implemented in society. In
order to enable avatar work in a variety of occupations, we propose a mobile
sales system using a mobile frozen drink machine and an avatar robot ""OriHime"",
focusing on mobile customer service like peddling. The effect of the peddling
by the system on the customers are examined based on the results of video
annotation.
","[{'version': 'v1', 'created': 'Fri, 2 Dec 2022 08:55:51 GMT'}]",2022-12-05,"[['Kanetsuna', 'Takashi', ''], ['Takeuchi', 'Kazuaki', ''], ['Kato', 'Hiroaki', ''], ['Sono', 'Taichi', ''], ['Osawa', 'Hirotaka', ''], ['Yoshifuji', 'Kentaro', ''], ['Yamazaki', 'Yoichi', '']]","['cybernetic avatar', 'avatar works', 'avatar robot', 'people with disabilities', 'human-robot interaction']"
8688,2101.04751,Shahrzad Haddadan,"Shahrzad Haddadan, Cristina Menghini, Matteo Riondato, Eli Upfal",RePBubLik: Reducing the Polarized Bubble Radius with Link Insertions,,,10.1145/3437963.3441825,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  The topology of the hyperlink graph among pages expressing different opinions
may influence the exposure of readers to diverse content. Structural bias may
trap a reader in a polarized bubble with no access to other opinions. We model
readers' behavior as random walks. A node is in a polarized bubble if the
expected length of a random walk from it to a page of different opinion is
large. The structural bias of a graph is the sum of the radii of
highly-polarized bubbles. We study the problem of decreasing the structural
bias through edge insertions. Healing all nodes with high polarized bubble
radius is hard to approximate within a logarithmic factor, so we focus on
finding the best $k$ edges to insert to maximally reduce the structural bias.
We present RePBubLik, an algorithm that leverages a variant of the random walk
closeness centrality to select the edges to insert. RePBubLik obtains, under
mild conditions, a constant-factor approximation. It reduces the structural
bias faster than existing edge-recommendation methods, including some designed
to reduce the polarization of a graph.
","[{'version': 'v1', 'created': 'Tue, 12 Jan 2021 20:59:17 GMT'}]",2021-01-14,"[['Haddadan', 'Shahrzad', ''], ['Menghini', 'Cristina', ''], ['Riondato', 'Matteo', ''], ['Upfal', 'Eli', '']]","['Bias', 'Fairness', 'Polarization']"
8689,1904.09274,Yunbin Deng,Yunbin Deng,Deep Learning on Mobile Devices - A Review,comments from the machine learning community are very welcome,"SPIE Defense + Commercial Sensing, Invited Paper. April 2019,
  Baltimore, MD",10.13140/RG.2.2.15012.12167,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent breakthroughs in deep learning and artificial intelligence
technologies have enabled numerous mobile applications. While traditional
computation paradigms rely on mobile sensing and cloud computing, deep learning
implemented on mobile devices provides several advantages. These advantages
include low communication bandwidth, small cloud computing resource cost, quick
response time, and improved data privacy. Research and development of deep
learning on mobile and embedded devices has recently attracted much attention.
This paper provides a timely review of this fast-paced field to give the
researcher, engineer, practitioner, and graduate student a quick grasp on the
recent advancements of deep learning on mobile devices. In this paper, we
discuss hardware architectures for mobile deep learning, including Field
Programmable Gate Arrays, Application Specific Integrated Circuit, and recent
mobile Graphic Processing Units. We present Size, Weight, Area and Power
considerations and their relation to algorithm optimizations, such as
quantization, pruning, compression, and approximations that simplify
computation while retaining performance accuracy. We cover existing systems and
give a state-of-the-industry review of TensorFlow, MXNet, Mobile AI Compute
Engine, and Paddle-mobile deep learning platform. We discuss resources for
mobile deep learning practitioners, including tools, libraries, models, and
performance benchmarks. We present applications of various mobile sensing
modalities to industries, ranging from robotics, healthcare and multi-media,
biometrics to autonomous drive and defense. We address the key deep learning
challenges to overcome, including low quality data, and small
training/adaptation data sets. In addition, the review provides numerous
citations and links to existing code bases implementing various technologies.
","[{'version': 'v1', 'created': 'Thu, 21 Mar 2019 00:41:20 GMT'}]",2019-04-22,"[['Deng', 'Yunbin', '']]","['Deep Learning (DL)', 'Artificial Intelligence (AI)', 'Mobile and Embedded Devices', 'Mobile Machine Learning', 'Mobile Computing', 'GPU']"
8690,2205.15884,Yani Xue,"Yani Xue, Miqing Li, Xiaohui Liu","An Effective and Efficient Evolutionary Algorithm for Many-Objective
  Optimization","25 pages, 5 figures, to appear in Information Sciences",,10.1016/j.ins.2022.10.077,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In evolutionary multiobjective optimization, effectiveness refers to how an
evolutionary algorithm performs in terms of converging its solutions into the
Pareto front and also diversifying them over the front. This is not an easy
job, particularly for optimization problems with more than three objectives,
dubbed many-objective optimization problems. In such problems, classic
Pareto-based algorithms fail to provide sufficient selection pressure towards
the Pareto front, whilst recently developed algorithms, such as
decomposition-based ones, may struggle to maintain a set of well-distributed
solutions on certain problems (e.g., those with irregular Pareto fronts).
Another issue in some many-objective optimizers is rapidly increasing
computational requirement with the number of objectives, such as
hypervolume-based algorithms and shift-based density estimation (SDE) methods.
In this paper, we aim to address this problem and develop an effective and
efficient evolutionary algorithm (E3A) that can handle various many-objective
problems. In E3A, inspired by SDE, a novel population maintenance method is
proposed to select high-quality solutions in the environmental selection
procedure. We conduct extensive experiments and show that E3A performs better
than 11 state-of-the-art many-objective evolutionary algorithms in quickly
finding a set of well-converged and well-diversified solutions.
","[{'version': 'v1', 'created': 'Tue, 31 May 2022 15:35:46 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Oct 2022 14:46:03 GMT'}]",2022-10-26,"[['Xue', 'Yani', ''], ['Li', 'Miqing', ''], ['Liu', 'Xiaohui', '']]","['evolutionary algorithms', 'many-objective optimization', 'effectiveness', 'efficiencyTo appear in Information Sciences']"
8691,2012.14230,Bo Li,"Bo Li, Wiro J. Niessen, Stefan Klein, Marius de Groot, M. Arfan Ikram,
  Meike W. Vernooij, Esther E. Bron","Longitudinal diffusion MRI analysis using Segis-Net: a single-step
  deep-learning framework for simultaneous segmentation and registration",To appear in NeuroImage,,10.1016/j.neuroimage.2021.118004,,cs.CV cs.AI eess.IV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This work presents a single-step deep-learning framework for longitudinal
image analysis, coined Segis-Net. To optimally exploit information available in
longitudinal data, this method concurrently learns a multi-class segmentation
and nonlinear registration. Segmentation and registration are modeled using a
convolutional neural network and optimized simultaneously for their mutual
benefit. An objective function that optimizes spatial correspondence for the
segmented structures across time-points is proposed. We applied Segis-Net to
the analysis of white matter tracts from N=8045 longitudinal brain MRI datasets
of 3249 elderly individuals. Segis-Net approach showed a significant increase
in registration accuracy, spatio-temporal segmentation consistency, and
reproducibility comparing with two multistage pipelines. This also led to a
significant reduction in the sample-size that would be required to achieve the
same statistical power in analyzing tract-specific measures. Thus, we expect
that Segis-Net can serve as a new reliable tool to support longitudinal imaging
studies to investigate macro- and microstructural brain changes over time.
","[{'version': 'v1', 'created': 'Mon, 28 Dec 2020 13:48:21 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Apr 2021 11:06:25 GMT'}]",2021-04-26,"[['Li', 'Bo', ''], ['Niessen', 'Wiro J.', ''], ['Klein', 'Stefan', ''], ['de Groot', 'Marius', ''], ['Ikram', 'M. Arfan', ''], ['Vernooij', 'Meike W.', ''], ['Bron', 'Esther E.', '']]","['Segmentation', 'Registration', 'Diffusion MRI', 'Deep Learning', 'CNN', 'Longitudinal', 'White Matter Tract']"
8692,2105.00694,Emir Zunic,"Emir Zunic, Kemal Korjenic, Sead Delalic, Zlatko Subara","Comparison Analysis of Facebook's Prophet, Amazon's DeepAR+ and CNN-QR
  Algorithms for Successful Real-World Sales Forecasting",,"International Journal of Computer Science & Information Technology
  (IJCSIT) Vol 13, No 2, April 2021",10.5121/ijcsit.2021.13205,,cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  By successfully solving the problem of forecasting, the processes in the work
of various companies are optimized and savings are achieved. In this process,
the analysis of time series data is of particular importance. Since the
creation of Facebook's Prophet, and Amazon's DeepAR+ and CNN-QR forecasting
models, algorithms have attracted a great deal of attention. The paper presents
the application and comparison of the above algorithms for sales forecasting in
distribution companies. A detailed comparison of the performance of algorithms
over real data with different lengths of sales history was made. The results
show that Prophet gives better results for items with a longer history and
frequent sales, while Amazon's algorithms show superiority for items without a
long history and items that are rarely sold.
","[{'version': 'v1', 'created': 'Mon, 3 May 2021 09:01:24 GMT'}]",2021-05-04,"[['Zunic', 'Emir', ''], ['Korjenic', 'Kemal', ''], ['Delalic', 'Sead', ''], ['Subara', 'Zlatko', '']]","['Sales forecasting', 'Real-world dataset', 'Prophet', 'DeepAR+', 'CNN-QR', 'Backtesting', 'Classification  1']"
8693,1708.02638,Milad Makkie,"Milad Makkie, Xiang Li, Binbin Lin, Jieping Ye, Mojtaba Sedigh Fazli,
  Tianming Liu, Shannon Quinn","Distributed rank-1 dictionary learning: Towards fast and scalable
  solutions for fMRI big data analytics","One of the authors name, Mojtaba Sedigh Fazli, has been mistakenly
  missed from this paper presented at the IEEE Big Data confrence. In result we
  are submitting this verison to correct the authors' names",,10.1109/BigData.2016.7841000,,cs.DS cs.DC q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of functional brain imaging for research and diagnosis has benefitted
greatly from the recent advancements in neuroimaging technologies, as well as
the explosive growth in size and availability of fMRI data. While it has been
shown in literature that using multiple and large scale fMRI datasets can
improve reproducibility and lead to new discoveries, the computational and
informatics systems supporting the analysis and visualization of such fMRI big
data are extremely limited and largely under-discussed. We propose to address
these shortcomings in this work, based on previous success in using dictionary
learning method for functional network decomposition studies on fMRI data. We
presented a distributed dictionary learning framework based on rank-1 matrix
decomposition with sparseness constraint (D-r1DL framework). The framework was
implemented using the Spark distributed computing engine and deployed on three
different processing units: an in-house server, in-house high performance
clusters, and the Amazon Elastic Compute Cloud (EC2) service. The whole
analysis pipeline was integrated with our neuroinformatics system for data
management, user input/output, and real-time visualization. Performance and
accuracy of D-r1DL on both individual and group-wise fMRI Human Connectome
Project (HCP) dataset shows that the proposed framework is highly scalable. The
resulting group-wise functional network decompositions are highly accurate, and
the fast processing time confirm this claim. In addition, D-r1DL can provide
real-time user feedback and results visualization which are vital for
large-scale data analysis.
","[{'version': 'v1', 'created': 'Tue, 8 Aug 2017 20:11:35 GMT'}]",2017-08-10,"[['Makkie', 'Milad', ''], ['Li', 'Xiang', ''], ['Lin', 'Binbin', ''], ['Ye', 'Jieping', ''], ['Fazli', 'Mojtaba Sedigh', ''], ['Liu', 'Tianming', ''], ['Quinn', 'Shannon', '']]","['fMRI', 'big data', 'dictionary learning', 'functional network', 'real-time visualization']"
8694,2011.06996,Markus Grassl,Markus Grassl,"Algebraic Quantum Codes: Linking Quantum Mechanics and Discrete
  Mathematics",19 pages; written for both mathematicians and physicists,"International Journal of Computer Mathematics: Computer Systems
  Theory, vol. 6, no. 4, pp. 243-250, 2021",10.1080/23799927.2020.1850530,,cs.IT math.CO math.IT quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a general framework of quantum error-correcting codes (QECCs) as a
subspace of a complex Hilbert space and the corresponding error models. Then we
illustrate how QECCs can be constructed using techniques from algebraic coding
theory. Additionally, we discuss secondary constructions for QECCs, leading to
propagation rules for the parameters of QECCs.
","[{'version': 'v1', 'created': 'Fri, 13 Nov 2020 16:25:31 GMT'}]",2022-03-08,"[['Grassl', 'Markus', '']]","['quantum error-correction', 'stabilizer codes', 'algebraic coding theory', 'puncture code', 'quantum Construction X']"
8695,2201.00777,Bertrand Jouve,"Marc Demange, David Ellison, Bertrand Jouve",Orienteering problem with time-windows and updating delay,,Theoretical Computer Science 863: 1-18 (2021),10.1016/j.tcs.2021.01.003,,cs.DM,http://creativecommons.org/licenses/by/4.0/,"  The Orienteering Problem with Time Window and Delay (\OPTiWinD) is a variant
of the online orienteering problem. A series of requests appear in various
locations while a vehicle moves within the territory to serve them. Each
request has a time window during which it can be served and a weight which
describes its importance. There is also a minimum delay $T$ between successive
requests. The objective is to find a path for the vehicles that maximises the
sum of the weights of the requests served. We further assume that the length of
each time window is equal to the diameter of the territory. We study the
optimal performance and competitive ratio for the set of instances with $n$
requests. We obtain complete resolution for $T$ at least half of the diameter,
small values of $T$ or small values of $n$, as well as partial results in the
remaining cases.
","[{'version': 'v1', 'created': 'Mon, 3 Jan 2022 17:47:16 GMT'}]",2022-01-04,"[['Demange', 'Marc', ''], ['Ellison', 'David', ''], ['Jouve', 'Bertrand', '']]","['Online orienteering problem', 'Online Scheduling', 'Competitiveanalysis', 'Combinatorial optimisation']"
8696,2210.15666,Marc Bernacki,Victor Grand and Baptiste Flipon and Alexis Gaillac and Marc Bernacki,"Simulation of continuous dynamic recrystallization using a level-set
  method",,,10.3390/ma15238547,,cs.CE cond-mat.mtrl-sci,http://creativecommons.org/licenses/by/4.0/,"  Dynamic recrystallization is one of the main phenomena responsible for
microstructure evolutions during hot forming. Consequently, getting a better
understanding of DRX mechanisms and being able to predict them is crucial. This
paper proposes a full-field numerical framework to predict the evolution of
subgrain structures upon grain growth, continuous dynamic and post-dynamic
recrystallization. The microstructure representation into the numerical
environment is presented. The developments made to improve substructure
description are detailed extensively. Using these simulation tools, simulation
of grain growth of a fully substructured microstructure are run. The influence
of microstructure topology, of subgrain parameters and of some remaining stored
energy due to plastic deformation is discussed. An analysis of the criterion
for discrimination of recrystallized grains is proposed. Finally, the ability
of the framework to model continuous dynamic and post-dynamic recrystallization
is assessed upon a case study. The influence of grain boundary properties and
of nucleation rules are studied. The representativity of the results in regards
of experimental data will be discussed in an upcoming article.
","[{'version': 'v1', 'created': 'Mon, 24 Oct 2022 16:09:06 GMT'}]",2022-12-14,"[['Grand', 'Victor', ''], ['Flipon', 'Baptiste', ''], ['Gaillac', 'Alexis', ''], ['Bernacki', 'Marc', '']]","['Level-set', 'Grain growth', 'Continuous dynamic recrystallization', 'Numerical simulation', 'Hotforming']"
8697,2205.12408,Payam Pourashraf,"Payam Pourashraf, Bamshad Mobasher",Using user's local context to support local news,,,10.1145/3511047.3537657,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  American local newspapers have been experiencing a large loss of reader
retention and business within the past 15 years due to the proliferation of
online news sources. Local media companies are starting to shift from an
advertising-supported business model to one based on subscriptions to mitigate
this problem. With this subscription model, there is a need to increase user
engagement and personalization, and recommender systems are one way for these
news companies to accomplish this goal. However, using standard modeling
approaches that focus on users' global preferences is not appropriate in this
context because the local preferences of users exhibit some specific
characteristics which do not necessarily match their long-term or global
preferences in the news. Our research explores a localized session-based
recommendation approach, using recommendations based on local news articles and
articles pertaining to the different local news categories. Experiments
performed on a news dataset from a local newspaper show that these local
models, particularly certain categories of items, do indeed provide more
accuracy and effectiveness for personalization which, in turn, may lead to more
user engagement with local news content.
","[{'version': 'v1', 'created': 'Tue, 24 May 2022 23:33:15 GMT'}, {'version': 'v2', 'created': 'Thu, 26 May 2022 01:08:13 GMT'}]",2022-05-27,"[['Pourashraf', 'Payam', ''], ['Mobasher', 'Bamshad', '']]","['News recommender system', 'User engagement', 'Local news']"
8698,1912.12633,Marti Sanchez-Fibla,"Marco Jerome Gasparrini, Mart\'i S\'anchez-Fibla","Loss aversion fosters coordination among independent reinforcement
  learners","5 pages, 2 figures, appeared in CCIA 2018",,10.3233/978-1-61499-918-8-307,,cs.AI,http://creativecommons.org/licenses/by/4.0/,"  We study what are the factors that can accelerate the emergence of
collaborative behaviours among independent selfish learning agents. We depart
from the ""Battle of the Exes"" (BoE), a spatial repeated game from which human
behavioral data has been obtained (by Hawkings and Goldstone, 2016) that we
find interesting because it considers two cases: a classic game theory version,
called ballistic, in which agents can only make one action/decision (equivalent
to the Battle of the Sexes) and a spatial version, called dynamic, in which
agents can change decision (a spatial continuous version). We model both
versions of the game with independent reinforcement learning agents and we
manipulate the reward function transforming it into an utility introducing
""loss aversion"": the reward that an agent obtains can be perceived as less
valuable when compared to what the other got. We prove experimentally the
introduction of loss aversion fosters cooperation by accelerating its
appearance, and by making it possible in some cases like in the dynamic
condition. We suggest that this may be an important factor explaining the rapid
converge of human behaviour towards collaboration reported in the experiment of
Hawkings and Goldstone.
","[{'version': 'v1', 'created': 'Sun, 29 Dec 2019 11:22:30 GMT'}]",2020-01-01,"[['Gasparrini', 'Marco Jerome', ''], ['Sánchez-Fibla', 'Martí', '']]","['Multiagents', 'Reinforcement Learning', 'Game Theory']"
8699,cs/0505073,David Nowak,St\'ephane Demri and David Nowak,Reasoning about transfinite sequences,38 pages,"International Journal of Foundations of Computer Science,
  18(1):87-112, February 2007",10.1142/S0129054107004589,,cs.LO cs.CC,,"  We introduce a family of temporal logics to specify the behavior of systems
with Zeno behaviors. We extend linear-time temporal logic LTL to authorize
models admitting Zeno sequences of actions and quantitative temporal operators
indexed by ordinals replace the standard next-time and until future-time
operators. Our aim is to control such systems by designing controllers that
safely work on $\omega$-sequences but interact synchronously with the system in
order to restrict their behaviors. We show that the satisfiability problem for
the logics working on $\omega^k$-sequences is EXPSPACE-complete when the
integers are represented in binary, and PSPACE-complete with a unary
representation. To do so, we substantially extend standard results about LTL by
introducing a new class of succinct ordinal automata that can encode the
interaction between the different quantitative temporal operators.
","[{'version': 'v1', 'created': 'Thu, 26 May 2005 09:33:24 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Jun 2005 09:14:03 GMT'}, {'version': 'v3', 'created': 'Tue, 19 Jul 2005 12:22:46 GMT'}, {'version': 'v4', 'created': 'Thu, 17 Aug 2006 03:33:18 GMT'}]",2009-04-08,"[['Demri', 'Stéphane', ''], ['Nowak', 'David', '']]","['temporal logic', 'Zeno behavior', 'control', 'physical system']"
8700,1910.00277,Till Fluschnik,"Matthias Bentert and Ren\'e van Bevern and Till Fluschnik and Andr\'e
  Nichterlein and Rolf Niedermeier","Polynomial-Time Data Reduction for Weighted Problems Beyond Additive
  Goal Functions",,"Discrete Applied Mathematics 328:117-133, 2023",10.1016/j.dam.2022.11.018,,cs.DS cs.DM math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dealing with NP-hard problems, kernelization is a fundamental notion for
polynomial-time data reduction with performance guarantees: in polynomial time,
a problem instance is reduced to an equivalent instance with size upper-bounded
by a function of a parameter chosen in advance. Kernelization for weighted
problems particularly requires to also shrink weights. Marx and V\'egh [ACM
Trans. Algorithms 2015] and Etscheid et al. [J. Comput. Syst. Sci. 2017] used a
technique of Frank and Tardos [Combinatorica 1987] to obtain polynomial-size
kernels for weighted problems, mostly with additive goal functions. We
characterize the function types that the technique is applicable to, which
turns out to contain many non-additive functions. Using this insight, we
systematically obtain kernelization results for natural problems in graph
partitioning, network design, facility location, scheduling, vehicle routing,
and computational social choice, thereby improving and generalizing results
from the literature.
","[{'version': 'v1', 'created': 'Tue, 1 Oct 2019 09:45:08 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Oct 2019 14:33:30 GMT'}, {'version': 'v3', 'created': 'Tue, 18 Feb 2020 04:09:49 GMT'}, {'version': 'v4', 'created': 'Wed, 13 Jan 2021 11:29:56 GMT'}, {'version': 'v5', 'created': 'Mon, 28 Nov 2022 11:00:56 GMT'}]",2022-12-26,"[['Bentert', 'Matthias', ''], ['van Bevern', 'René', ''], ['Fluschnik', 'Till', ''], ['Nichterlein', 'André', ''], ['Niedermeier', 'Rolf', '']]","['NP-hard problems', 'problem kernelization', 'weight reduction', 'routing', 'scheduling', 'computational social choice', 'partitioning']"
8701,2201.00150,Xiaodong Gu,"Yitian Chai, Hongyu Zhang, Beijun Shen, Xiaodong Gu",Cross-Domain Deep Code Search with Few-Shot Meta Learning,"Accepted by ICSE 2022 (The 44th International Conference on Software
  Engineering)",,10.1145/3510003.3510125,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Recently, pre-trained programming language models such as CodeBERT have
demonstrated substantial gains in code search. Despite showing great
performance, they rely on the availability of large amounts of parallel data to
fine-tune the semantic mappings between queries and code. This restricts their
practicality in domain-specific languages with relatively scarce and expensive
data. In this paper, we propose CDCS, a novel approach for domain-specific code
search. CDCS employs a transfer learning framework where an initial program
representation model is pre-trained on a large corpus of common programming
languages (such as Java and Python), and is further adapted to domain-specific
languages such as SQL and Solidity. Unlike cross-language CodeBERT, which is
directly fine-tuned in the target language, CDCS adapts a few-shot
meta-learning algorithm called MAML to learn the good initialization of model
parameters, which can be best reused in a domain-specific language. We evaluate
the proposed approach on two domain-specific languages, namely, SQL and
Solidity, with model transferred from two widely used languages (Python and
Java). Experimental results show that CDCS significantly outperforms
conventional pre-trained code models that are directly fine-tuned in
domain-specific languages, and it is particularly effective for scarce data.
","[{'version': 'v1', 'created': 'Sat, 1 Jan 2022 09:00:48 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Jun 2022 12:12:02 GMT'}, {'version': 'v3', 'created': 'Sun, 21 Aug 2022 12:25:21 GMT'}, {'version': 'v4', 'created': 'Tue, 30 Aug 2022 12:18:38 GMT'}, {'version': 'v5', 'created': 'Sat, 3 Dec 2022 06:25:06 GMT'}]",2022-12-06,"[['Chai', 'Yitian', ''], ['Zhang', 'Hongyu', ''], ['Shen', 'Beijun', ''], ['Gu', 'Xiaodong', '']]","['Code Search', 'Pre-trained Code Models', 'Meta Learning', 'Few-ShotLearning', 'Deep Learning']"
8702,2003.01313,Diogo Pacheco,"Diogo Pacheco, Alessandro Flammini, Filippo Menczer",Unveiling Coordinated Groups Behind White Helmets Disinformation,"To be presented at WWW 2020 Workshop on Computational Methods in
  Online Misbehavior and forthcoming in the Companion Proceedings of the Web
  Conference 2020",,10.1145/3366424.3385775,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Propaganda, disinformation, manipulation, and polarization are the modern
illnesses of a society increasingly dependent on social media as a source of
news. In this paper, we explore the disinformation campaign, sponsored by
Russia and allies, against the Syria Civil Defense (a.k.a. the White Helmets).
We unveil coordinated groups using automatic retweets and content duplication
to promote narratives and/or accounts. The results also reveal distinct
promoting strategies, ranging from the small groups sharing the exact same text
repeatedly, to complex ""news website factories"" where dozens of accounts
synchronously spread the same news from multiple sites.
","[{'version': 'v1', 'created': 'Tue, 3 Mar 2020 03:25:16 GMT'}]",2020-03-04,"[['Pacheco', 'Diogo', ''], ['Flammini', 'Alessandro', ''], ['Menczer', 'Filippo', '']]","['Misinformation', 'coordinated groups', 'Twiter', 'White Helmets']"
8703,2108.01413,Roopak Sinha,"Chandan Sharma, Roopak Sinha and Paulo Leitao","IASelect: Finding Best-fit Agent Practices in Industrial CPS Using Graph
  Databases","Conference paper, 7 pages, 6 figures, 1 table","Proceedings of the 17th International Conference on Industrial
  Informatics (INDIN2019). Helsinki, Finland, IEEE Computer Society Press,
  pp.1558-1563",10.1109/INDIN41052.2019.8972272.,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ongoing fourth Industrial Revolution depends mainly on robust Industrial
Cyber-Physical Systems (ICPS). ICPS includes computing (software and hardware)
abilities to control complex physical processes in distributed industrial
environments. Industrial agents, originating from the well-established
multi-agent systems field, provide complex and cooperative control mechanisms
at the software level, allowing us to develop larger and more feature-rich
ICPS. The IEEE P2660.1 standardisation project, ""Recommended Practices on
Industrial Agents: Integration of Software Agents and Low Level Automation
Functions"" focuses on identifying Industrial Agent practices that can benefit
ICPS systems of the future. A key problem within this project is identifying
the best-fit industrial agent practices for a given ICPS. This paper reports on
the design and development of a tool to address this challenge. This tool,
called IASelect, is built using graph databases and provides the ability to
flexibly and visually query a growing repository of industrial agent practices
relevant to ICPS. IASelect includes a front-end that allows industry
practitioners to interactively identify best-fit practices without having to
write manual queries.
","[{'version': 'v1', 'created': 'Tue, 3 Aug 2021 11:10:02 GMT'}]",2021-08-04,"[['Sharma', 'Chandan', ''], ['Sinha', 'Roopak', ''], ['Leitao', 'Paulo', '']]","['cyber physical systems', 'CPS', 'industrial agents', 'graph database', 'database queries', 'interfacing practices']"
8704,2006.10938,Pavel Matrenin,"Pavel Matrenin, Vadim Manusov","The cyclic job-shop scheduling problem: The new subclass of the job-shop
  problem and applying the Simulated annealing to solve it",,"2016 2nd International Conference on Industrial Engineering,
  Applications and Manufacturing (ICIEAM), 19-20 May 2016, Chelyabinsk, Russia",10.1109/ICIEAM.2016.7911676,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the paper, the new approach to the scheduling problem are described. The
approach deals with the problem of planning the cyclic production and proposes
to consider such scheduling problem as the cyclic job-shop problem of the order
k, where k is the number of reiterations. It was found out that planning of
only one iteration of the loop is less effective than planning of the entire
cycle. To the experimental research, a number of test instances of the job-shop
scheduling problem by Operation Research Library were used. The Simulated
Annealing was applied to solve the instances. The experiments proved that the
approach proposed allows increasing the efficiency of cyclic scheduling
significantly.
","[{'version': 'v1', 'created': 'Fri, 19 Jun 2020 02:36:29 GMT'}]",2020-06-22,"[['Matrenin', 'Pavel', ''], ['Manusov', 'Vadim', '']]","['job-shop', 'scheduling problem', 'multistage service']"
8705,1710.06236,Tianwei Lin,"Tianwei Lin, Xu Zhao, Zheng Shou",Single Shot Temporal Action Detection,ACM Multimedia 2017,,10.1145/3123266.3123343,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Temporal action detection is a very important yet challenging problem, since
videos in real applications are usually long, untrimmed and contain multiple
action instances. This problem requires not only recognizing action categories
but also detecting start time and end time of each action instance. Many
state-of-the-art methods adopt the ""detection by classification"" framework:
first do proposal, and then classify proposals. The main drawback of this
framework is that the boundaries of action instance proposals have been fixed
during the classification step. To address this issue, we propose a novel
Single Shot Action Detector (SSAD) network based on 1D temporal convolutional
layers to skip the proposal generation step via directly detecting action
instances in untrimmed video. On pursuit of designing a particular SSAD network
that can work effectively for temporal action detection, we empirically search
for the best network architecture of SSAD due to lacking existing models that
can be directly adopted. Moreover, we investigate into input feature types and
fusion strategies to further improve detection accuracy. We conduct extensive
experiments on two challenging datasets: THUMOS 2014 and MEXaction2. When
setting Intersection-over-Union threshold to 0.5 during evaluation, SSAD
significantly outperforms other state-of-the-art systems by increasing mAP from
19.0% to 24.6% on THUMOS 2014 and from 7.4% to 11.0% on MEXaction2.
","[{'version': 'v1', 'created': 'Tue, 17 Oct 2017 12:41:17 GMT'}]",2017-10-18,"[['Lin', 'Tianwei', ''], ['Zhao', 'Xu', ''], ['Shou', 'Zheng', '']]","['Temporal Action Detection', 'Untrimmed Video', 'SSAD network']"
8706,2007.02747,Ruihong Qiu,"Ruihong Qiu, Hongzhi Yin, Zi Huang, Tong Chen","GAG: Global Attributed Graph Neural Network for Streaming Session-based
  Recommendation",,,10.1145/3397271.3401109,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Streaming session-based recommendation (SSR) is a challenging task that
requires the recommender system to do the session-based recommendation (SR) in
the streaming scenario. In the real-world applications of e-commerce and social
media, a sequence of user-item interactions generated within a certain period
are grouped as a session, and these sessions consecutively arrive in the form
of streams. Most of the recent SR research has focused on the static setting
where the training data is first acquired and then used to train a
session-based recommender model. They need several epochs of training over the
whole dataset, which is infeasible in the streaming setting. Besides, they can
hardly well capture long-term user interests because of the neglect or the
simple usage of the user information. Although some streaming recommendation
strategies have been proposed recently, they are designed for streams of
individual interactions rather than streams of sessions. In this paper, we
propose a Global Attributed Graph (GAG) neural network model with a Wasserstein
reservoir for the SSR problem. On one hand, when a new session arrives, a
session graph with a global attribute is constructed based on the current
session and its associate user. Thus, the GAG can take both the global
attribute and the current session into consideration to learn more
comprehensive representations of the session and the user, yielding a better
performance in the recommendation. On the other hand, for the adaptation to the
streaming session scenario, a Wasserstein reservoir is proposed to help
preserve a representative sketch of the historical data. Extensive experiments
on two real-world datasets have been conducted to verify the superiority of the
GAG model compared with the state-of-the-art methods.
","[{'version': 'v1', 'created': 'Mon, 6 Jul 2020 13:41:19 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Jul 2021 12:13:36 GMT'}]",2021-07-12,"[['Qiu', 'Ruihong', ''], ['Yin', 'Hongzhi', ''], ['Huang', 'Zi', ''], ['Chen', 'Tong', '']]","['streaming recommendation', 'session-based recommendation', 'graphneural networks']"
8707,1410.4145,Shadman Sakib,"Shadman Sakib, Anik Chowdhury, Shekh Tanvir Ahamed and Syed Imam Hasan","Maze solving Algorithm for line following robot and derivation of linear
  path distance from nonlinear path","Published in the Proceedings of 16th International Conference on
  Computer and Information Technology, Khulna, Bangladesh",,10.1109/ICCITechn.2014.6997314,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we have discussed a unique general algorithm for exploring and
solving any kind of line maze with another simple one for simple mazes without
loops or loops having highest two branches none of which are inward. For the
general algorithm, we need a method to map the whole maze, which is required if
the maze is complex. The proposed maze mapping system is based on coordinate
system and after mapping the whole maze as a graph in standard 'Adjacency-list
representation' method, shortest path and shortest time path was extracted
using Dijkstra's algorithm. In order to find the coordinates of the turning
points and junctions, linear distance between the points are needed, for which
wheel encoder was used. However, due to non-linear movement of robot, the
directly measured distance from the encoder has some error and to remove this
error an idea is built up which ended by deriving equations that gives us
almost exact linear distance between two points from the reading of wheel
encoder of the robot moving in a non-linear path.
","[{'version': 'v1', 'created': 'Wed, 15 Oct 2014 17:30:56 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Jan 2015 09:58:31 GMT'}]",2015-01-06,"[['Sakib', 'Shadman', ''], ['Chowdhury', 'Anik', ''], ['Ahamed', 'Shekh Tanvir', ''], ['Hasan', 'Syed Imam', '']]","['Maze solving', 'mapping', 'line following robot', 'wheel encoder', 'linear path distance']"
8708,2202.03775,Hendric Vo{\ss},"Hendric Vo{\ss}, Heiko Wersing, Stefan Kopp","Addressing Data Scarcity in Multimodal User State Recognition by
  Combining Semi-Supervised and Supervised Learning",,,10.1145/3461615.3486575,,cs.CV,http://creativecommons.org/licenses/by-sa/4.0/,"  Detecting mental states of human users is crucial for the development of
cooperative and intelligent robots, as it enables the robot to understand the
user's intentions and desires. Despite their importance, it is difficult to
obtain a large amount of high quality data for training automatic recognition
algorithms as the time and effort required to collect and label such data is
prohibitively high. In this paper we present a multimodal machine learning
approach for detecting dis-/agreement and confusion states in a human-robot
interaction environment, using just a small amount of manually annotated data.
We collect a data set by conducting a human-robot interaction study and develop
a novel preprocessing pipeline for our machine learning approach. By combining
semi-supervised and supervised architectures, we are able to achieve an average
F1-score of 81.1\% for dis-/agreement detection with a small amount of labeled
data and a large unlabeled data set, while simultaneously increasing the
robustness of the model compared to the supervised approach.
","[{'version': 'v1', 'created': 'Tue, 8 Feb 2022 10:41:41 GMT'}]",2022-02-09,"[['Voß', 'Hendric', ''], ['Wersing', 'Heiko', ''], ['Kopp', 'Stefan', '']]","['neural networks', 'deep learning', 'unsupervised', 'semi-supervised', 'supervised', 'complex user states', 'confusion detection', 'agreement disagreement detection']"
8709,2110.15718,Mai Shaaban,"Mai A. Shaaban, Yasser F. Hassan and Shawkat K. Guirguis","Deep convolutional forest: a dynamic deep ensemble approach for spam
  detection in text",,,10.1007/s40747-022-00741-6,,cs.CL cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The increase in people's use of mobile messaging services has led to the
spread of social engineering attacks like phishing, considering that spam text
is one of the main factors in the dissemination of phishing attacks to steal
sensitive data such as credit cards and passwords. In addition, rumors and
incorrect medical information regarding the COVID-19 pandemic are widely shared
on social media leading to people's fear and confusion. Thus, filtering spam
content is vital to reduce risks and threats. Previous studies relied on
machine learning and deep learning approaches for spam classification, but
these approaches have two limitations. Machine learning models require manual
feature engineering, whereas deep neural networks require a high computational
cost. This paper introduces a dynamic deep ensemble model for spam detection
that adjusts its complexity and extracts features automatically. The proposed
model utilizes convolutional and pooling layers for feature extraction along
with base classifiers such as random forests and extremely randomized trees for
classifying texts into spam or legitimate ones. Moreover, the model employs
ensemble learning procedures like boosting and bagging. As a result, the model
achieved high precision, recall, f1-score and accuracy of 98.38\%.
","[{'version': 'v1', 'created': 'Sun, 10 Oct 2021 17:19:37 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Dec 2021 18:03:48 GMT'}, {'version': 'v3', 'created': 'Sat, 30 Apr 2022 03:30:46 GMT'}]",2022-05-10,"[['Shaaban', 'Mai A.', ''], ['Hassan', 'Yasser F.', ''], ['Guirguis', 'Shawkat K.', '']]","['Ensemble methods', 'Deep learning', 'Machine learning', 'Spam classification', 'Text messages']"
8710,2106.03062,Ching-Yuan Bai,"Ching-Yuan Bai, Hsuan-Tien Lin, Colin Raffel, and Wendy Chih-wen Kan","On Training Sample Memorization: Lessons from Benchmarking Generative
  Modeling with a Large-scale Competition","In Proceedings of the 27th ACM SIGKDD International Conference on
  Knowledge Discovery and Data Mining (KDD), August 2021",,10.1145/3447548.3467198,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Many recent developments on generative models for natural images have relied
on heuristically-motivated metrics that can be easily gamed by memorizing a
small sample from the true distribution or training a model directly to improve
the metric. In this work, we critically evaluate the gameability of these
metrics by designing and deploying a generative modeling competition. Our
competition received over 11000 submitted models. The competitiveness between
participants allowed us to investigate both intentional and unintentional
memorization in generative modeling. To detect intentional memorization, we
propose the ``Memorization-Informed Fr\'echet Inception Distance'' (MiFID) as a
new memorization-aware metric and design benchmark procedures to ensure that
winning submissions made genuine improvements in perceptual quality.
Furthermore, we manually inspect the code for the 1000 top-performing models to
understand and label different forms of memorization. Our analysis reveals that
unintentional memorization is a serious and common issue in popular generative
models. The generated images and our memorization labels of those models as
well as code to compute MiFID are released to facilitate future studies on
benchmarking generative models.
","[{'version': 'v1', 'created': 'Sun, 6 Jun 2021 08:24:42 GMT'}]",2021-06-08,"[['Bai', 'Ching-Yuan', ''], ['Lin', 'Hsuan-Tien', ''], ['Raffel', 'Colin', ''], ['Kan', 'Wendy Chih-wen', '']]","['benchmark', 'competition', 'neural networks', 'generative models', 'memorization', 'datasets', 'computer vision']"
8711,2010.05084,Benjamin Fish,"Benjamin Fish, Luke Stark",Reflexive Design for Fairness and Other Human Values in Formal Models,Published in the proceedings of AIES 2021,,10.1145/3461702.3462518,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Algorithms and other formal models purportedly incorporating human values
like fairness have grown increasingly popular in computer science. In response
to sociotechnical challenges in the use of these models, designers and
researchers have taken widely divergent positions on how formal models
incorporating aspects of human values should be used: encouraging their use,
moving away from them, or ignoring the normative consequences altogether. In
this paper, we seek to resolve these divergent positions by identifying the
main conceptual limits of formal modeling, and develop four reflexive
values--value fidelity, appropriate accuracy, value legibility, and value
contestation--vital for incorporating human values adequately into formal
models. We then provide a brief methodology for reflexively designing formal
models incorporating human values.
","[{'version': 'v1', 'created': 'Sat, 10 Oct 2020 20:04:24 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Jun 2021 22:24:05 GMT'}]",2021-06-18,"[['Fish', 'Benjamin', ''], ['Stark', 'Luke', '']]","['formal models', 'reflexive design', 'values in design', 'algorithmic fairness', 'artificial intelligence', 'machine learning']"
8712,2006.00304,Shiv Gehlot,Shiv Gehlot and Anubha Gupta and Ritu Gupta,"SDCT-AuxNet$^{\theta}$: DCT Augmented Stain Deconvolutional CNN with
  Auxiliary Classifier for Cancer Diagnosis","The final version of this preprint has been published in Medical
  Image Analysis","Medical Image Analysis, 61, 101661, 2020",10.1016/j.media.2020.101661,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Acute lymphoblastic leukemia (ALL) is a pervasive pediatric white blood cell
cancer across the globe. With the popularity of convolutional neural networks
(CNNs), computer-aided diagnosis of cancer has attracted considerable
attention. Such tools are easily deployable and are cost-effective. Hence,
these can enable extensive coverage of cancer diagnostic facilities. However,
the development of such a tool for ALL cancer was challenging so far due to the
non-availability of a large training dataset. The visual similarity between the
malignant and normal cells adds to the complexity of the problem. This paper
discusses the recent release of a large dataset and presents a novel deep
learning architecture for the classification of cell images of ALL cancer. The
proposed architecture, namely, SDCT-AuxNet$^{\theta}$ is a 2-module framework
that utilizes a compact CNN as the main classifier in one module and a Kernel
SVM as the auxiliary classifier in the other one. While CNN classifier uses
features through bilinear-pooling, spectral-averaged features are used by the
auxiliary classifier. Further, this CNN is trained on the stain deconvolved
quantity images in the optical density domain instead of the conventional RGB
images. A novel test strategy is proposed that exploits both the classifiers
for decision making using the confidence scores of their predicted class
labels. Elaborate experiments have been carried out on our recently released
public dataset of 15114 images of ALL cancer and healthy cells to establish the
validity of the proposed methodology that is also robust to subject-level
variability. A weighted F1 score of 94.8$\%$ is obtained that is best so far on
this challenging dataset.
","[{'version': 'v1', 'created': 'Sat, 30 May 2020 16:01:31 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Jun 2020 01:47:54 GMT'}]",2020-06-09,"[['Gehlot', 'Shiv', ''], ['Gupta', 'Anubha', ''], ['Gupta', 'Ritu', '']]","['Acute lymphoblastic leukemia', 'ALL diagnosis', 'cell classification', 'convolutional neural network', 'deep learning']"
8713,2106.12085,Marina Delianidi,"Marina Delianidi, Michail Salampasis, Konstantinos Diamantaras,
  Theodosios Siomos, Alkiviadis Katsalis, Iphigenia Karaveli",A Graph-based Method for Session-based Recommendations,"Preprint version of the paper, the original paper is published on ACM
  DL. 6 pages, 1 figure, 1 table",,10.1145/3437120.3437321,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a graph-based approach for the data management tasks and the
efficient operation of a system for session-based next-item recommendations.
The proposed method can collect data continuously and incrementally from an
ecommerce web site, thus seemingly prepare the necessary data infrastructure
for the recommendation algorithm to operate without any excessive training
phase. Our work aims at developing a recommender method that represents a
balance between data processing and management efficiency requirements and the
effectiveness of the recommendations produced. We use the Neo4j graph database
to implement a prototype of such a system. Furthermore, we use an industry
dataset corresponding to a typical e-commerce session-based scenario, and we
report on experiments using our graph-based approach and other state-of-the-art
machine learning and deep learning methods.
","[{'version': 'v1', 'created': 'Tue, 22 Jun 2021 22:33:23 GMT'}]",2021-06-24,"[['Delianidi', 'Marina', ''], ['Salampasis', 'Michail', ''], ['Diamantaras', 'Konstantinos', ''], ['Siomos', 'Theodosios', ''], ['Katsalis', 'Alkiviadis', ''], ['Karaveli', 'Iphigenia', '']]","['Neo4j graph database', 'eCommerce', 'Session-based recommendations']"
8714,1508.04863,Yustinus Soelistio Eko,Yustinus Eko Soelistio,"Application Distribution Model In Volunteer Computing Environment Using
  Peer-to-Peer Torrent Like Approach","6 pages, Published in proceeding of 2013 International Conference on
  Computer, Control, Informatics and Its Applications (IC3INA)",,10.1109/IC3INA.2013.6819184,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Volunteer computing has been known as an alternative solution to solve
complex problems. It is acknowledged for its simplicity and its ability to work
on multiple operating systems. Nonetheless, setting up a server for volunteer
computing can be time consuming and relatively complex to be implemented. This
paper offer a model which can ease the effort of setting up a server by making
the agent works two ways, as seeder and leecher, like P2P torrent approaches.
The model consists of measurement units to manage applications to be
distributed, system hierarchy, and basic procedures for the server and the
agent. The model has been tested in four scenarios using 2,000,000 to 3,000,000
integer data employing up to six nodes. The tests demonstrate speedup in three
of the scenarios.
","[{'version': 'v1', 'created': 'Thu, 20 Aug 2015 03:15:23 GMT'}]",2015-08-21,"[['Soelistio', 'Yustinus Eko', '']]","['volunteer computing', 'torrent', 'P2P']"
8715,2103.03460,Hui Tang,Hui Tang and Kui Jia,Vicinal and categorical domain adaptation,Accepted by Pattern Recognition,"Pattern Recognition, Volume 115, July 2021, 107907",10.1016/j.patcog.2021.107907,,cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Unsupervised domain adaptation aims to learn a task classifier that performs
well on the unlabeled target domain, by utilizing the labeled source domain.
Inspiring results have been acquired by learning domain-invariant deep features
via domain-adversarial training. However, its parallel design of task and
domain classifiers limits the ability to achieve a finer category-level domain
alignment. To promote categorical domain adaptation (CatDA), based on a joint
category-domain classifier, we propose novel losses of adversarial training at
both domain and category levels. Since the joint classifier can be regarded as
a concatenation of individual task classifiers respectively for the two
domains, our design principle is to enforce consistency of category predictions
between the two task classifiers. Moreover, we propose a concept of vicinal
domains whose instances are produced by a convex combination of pairs of
instances respectively from the two domains. Intuitively, alignment of the
possibly infinite number of vicinal domains enhances that of original domains.
We propose novel adversarial losses for vicinal domain adaptation (VicDA) based
on CatDA, leading to Vicinal and Categorical Domain Adaptation (ViCatDA). We
also propose Target Discriminative Structure Recovery (TDSR) to recover the
intrinsic target discrimination damaged by adversarial feature alignment. We
also analyze the principles underlying the ability of our key designs to align
the joint distributions. Extensive experiments on several benchmark datasets
demonstrate that we achieve the new state of the art.
","[{'version': 'v1', 'created': 'Fri, 5 Mar 2021 03:47:24 GMT'}]",2021-03-08,"[['Tang', 'Hui', ''], ['Jia', 'Kui', '']]","['Unsupervised domain adaptation', 'categorical domain adaptation', 'vicinal']"
8716,2205.11582,Anshul Jindal,"Thomas van Loo, Anshul Jindal, Shajulin Benedict, Mohak Chadha,
  Michael Gerndt",Scalable Infrastructure for Workload Characterization of Cluster Traces,"9 pages, CLOSER 2022","In Proceedings of the 12th International Conference on Cloud
  Computing and Services Science - CLOSER 2022, ISBN 978-989-758-570-8; ISSN
  2184-5042, pages 254-263",10.5220/0011080300003200,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  In the recent past, characterizing workloads has been attempted to gain a
foothold in the emerging serverless cloud market, especially in the large
production cloud clusters of Google, AWS, and so forth. While analyzing and
characterizing real workloads from a large production cloud cluster benefits
cloud providers, researchers, and daily users, analyzing the workload traces of
these clusters has been an arduous task due to the heterogeneous nature of
data. This article proposes a scalable infrastructure based on Google's
dataproc for analyzing the workload traces of cloud environments. We evaluated
the functioning of the proposed infrastructure using the workload traces of
Google cloud cluster-usage-traces-v3. We perform the workload characterization
on this dataset, focusing on the heterogeneity of the workload, the variations
in job durations, aspects of resources consumption, and the overall
availability of resources provided by the cluster. The findings reported in the
paper will be beneficial for cloud infrastructure providers and users while
managing the cloud computing resources, especially serverless platforms.
","[{'version': 'v1', 'created': 'Mon, 23 May 2022 19:23:23 GMT'}]",2022-05-25,"[['van Loo', 'Thomas', ''], ['Jindal', 'Anshul', ''], ['Benedict', 'Shajulin', ''], ['Chadha', 'Mohak', ''], ['Gerndt', 'Michael', '']]","['Cloud Computing', 'Google Cloud', 'Scalable', 'Workload Characterization', 'Google Cluster Traces', 'Dataproc']"
8717,cs/0508029,Johannes Schneider,Johannes J. Schneider and Scott Kirkpatrick,Selfish vs. Unselfish Optimization of Network Creation,"16 pages, 6 figures",,10.1088/1742-5468/2005/08/P08007,,cs.NI cs.AR cs.MA,,"  We investigate several variants of a network creation model: a group of
agents builds up a network between them while trying to keep the costs of this
network small. The cost function consists of two addends, namely (i) a constant
amount for each edge an agent buys and (ii) the minimum number of hops it takes
sending messages to other agents. Despite the simplicity of this model, various
complex network structures emerge depending on the weight between the two
addends of the cost function and on the selfish or unselfish behaviour of the
agents.
","[{'version': 'v1', 'created': 'Wed, 3 Aug 2005 18:16:13 GMT'}]",2007-05-23,"[['Schneider', 'Johannes J.', ''], ['Kirkpatrick', 'Scott', '']]","['optimization', 'selfish optimization', 'network', 'internet', 'multi agentsystem']"
8718,2103.07953,David F. N. Oliveira,"David F. N. Oliveira, Lucio F. Vismari, Alexandre M. Nascimento, Jorge
  R. de Almeida Jr, Paulo S. Cugnasca, Joao B. Camargo Jr, Leandro Almeida,
  Rafael Gripp, Marcelo Neves","A new interpretable unsupervised anomaly detection method based on
  residual explanation",8 pages,,10.1109/ACCESS.2021.3137633,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Despite the superior performance in modeling complex patterns to address
challenging problems, the black-box nature of Deep Learning (DL) methods impose
limitations to their application in real-world critical domains. The lack of a
smooth manner for enabling human reasoning about the black-box decisions hinder
any preventive action to unexpected events, in which may lead to catastrophic
consequences. To tackle the unclearness from black-box models, interpretability
became a fundamental requirement in DL-based systems, leveraging trust and
knowledge by providing ways to understand the model's behavior. Although a
current hot topic, further advances are still needed to overcome the existing
limitations of the current interpretability methods in unsupervised DL-based
models for Anomaly Detection (AD). Autoencoders (AE) are the core of
unsupervised DL-based for AD applications, achieving best-in-class performance.
However, due to their hybrid aspect to obtain the results (by requiring
additional calculations out of network), only agnostic interpretable methods
can be applied to AE-based AD. These agnostic methods are computationally
expensive to process a large number of parameters. In this paper we present the
RXP (Residual eXPlainer), a new interpretability method to deal with the
limitations for AE-based AD in large-scale systems. It stands out for its
implementation simplicity, low computational cost and deterministic behavior,
in which explanations are obtained through the deviation analysis of
reconstructed input features. In an experiment using data from a real
heavy-haul railway line, the proposed method achieved superior performance
compared to SHAP, demonstrating its potential to support decision making in
large scale critical systems.
","[{'version': 'v1', 'created': 'Sun, 14 Mar 2021 15:35:45 GMT'}]",2022-01-19,"[['Oliveira', 'David F. N.', ''], ['Vismari', 'Lucio F.', ''], ['Nascimento', 'Alexandre M.', ''], ['Almeida', 'Jorge R. de', 'Jr'], ['Cugnasca', 'Paulo S.', ''], ['Camargo', 'Joao B.', 'Jr'], ['Almeida', 'Leandro', ''], ['Gripp', 'Rafael', ''], ['Neves', 'Marcelo', '']]","['Explainability', 'Interpretability', 'Autoencoders', 'Safety', 'Fault Diagnosis']"
8719,2109.07269,H\'eber H. Arcolezi,"H\'eber H. Arcolezi, Jean-Fran\c{c}ois Couchot, Bechara Al Bouna,
  Xiaokui Xiao","Random Sampling Plus Fake Data: Multidimensional Frequency Estimates
  With Local Differential Privacy",,,10.1145/3459637.3482467,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  With local differential privacy (LDP), users can privatize their data and
thus guarantee privacy properties before transmitting it to the server (a.k.a.
the aggregator). One primary objective of LDP is frequency (or histogram)
estimation, in which the aggregator estimates the number of users for each
possible value. In practice, when a study with rich content on a population is
desired, the interest is in the multiple attributes of the population, that is
to say, in multidimensional data ($d \geq 2$). However, contrary to the problem
of frequency estimation of a single attribute (the majority of the works), the
multidimensional aspect imposes to pay particular attention to the privacy
budget. This one can indeed grow extremely quickly due to the composition
theorem. To the authors' knowledge, two solutions seem to stand out for this
task: 1) splitting the privacy budget for each attribute, i.e., send each value
with $\frac{\epsilon}{d}$-LDP (Spl), and 2) random sampling a single attribute
and spend all the privacy budget to send it with $\epsilon$-LDP (Smp). Although
Smp adds additional sampling error, it has proven to provide higher data
utility than the former Spl solution. However, we argue that aggregators (who
are also seen as attackers) are aware of the sampled attribute and its LDP
value, which is protected by a ""less strict"" $e^{\epsilon}$ probability bound
(rather than $e^{\epsilon/d}$). This way, we propose a solution named Random
Sampling plus Fake Data (RS+FD), which allows creating uncertainty over the
sampled attribute by generating fake data for each non-sampled attribute; RS+FD
further benefits from amplification by sampling. We theoretically and
experimentally validate our proposed solution on both synthetic and real-world
datasets to show that RS+FD achieves nearly the same or better utility than the
state-of-the-art Smp solution.
","[{'version': 'v1', 'created': 'Wed, 15 Sep 2021 13:11:08 GMT'}]",2021-09-16,"[['Arcolezi', 'Héber H.', ''], ['Couchot', 'Jean-François', ''], ['Bouna', 'Bechara Al', ''], ['Xiao', 'Xiaokui', '']]","['Local differential privacy', 'Multidimensional data', 'Frequency estimation', 'Sampling']"
8720,2012.08079,Victor A. Melent'ev,A.F. Zadorozhny and V.A. Melent'ev,"On the compatibility of the topologies of parallel tasks and computing
  systems",,,10.1088/1742-6596/1864/1/012103,,cs.DC cs.DM math.CO,http://creativecommons.org/licenses/by/4.0/,"  Aspects of compatibility of topologies of parallel computing systems and
tasks are investigated. The introduction of appropriate indexes based on the
original topological model of parallel computations and on the nontraditional
description of a graph by its projections is proposed and elucidated. On the
example of hypercubic computing system (CS) and tasks with ring and star
information topologies, we demonstrate determining the indexes and their use in
a comparative analysis of the applicability of interconnect with a given
topology for solving tasks with the same and different types of information
topologies.
","[{'version': 'v1', 'created': 'Tue, 15 Dec 2020 04:09:53 GMT'}]",2021-06-24,"[['Zadorozhny', 'A. F.', ''], [""Melent'ev"", 'V. A.', '']]","['topological model of parallel computations', 'projective description of a graph', 'topological compatibility']"
8721,1606.01106,Tommaso Petrucciani,"Giuseppe Castagna (CNRS, IRIF), Tommaso Petrucciani (IRIF, DIBRIS),
  Kim Nguyen (LRI)",Set-Theoretic Types for Polymorphic Variants,"ACM SIGPLAN International Conference on Functional Programming, Sep
  2016, Nara, Japan. ICFP 16, 21st ACM SIGPLAN International Conference on
  Functional Programming, 2016",,10.1145/2951913.2951928,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Polymorphic variants are a useful feature of the OCaml language whose current
definition and implementation rely on kinding constraints to simulate a
subtyping relation via unification. This yields an awkward formalization and
results in a type system whose behaviour is in some cases unintuitive and/or
unduly restrictive. In this work, we present an alternative formalization of
poly-morphic variants, based on set-theoretic types and subtyping, that yields
a cleaner and more streamlined system. Our formalization is more expressive
than the current one (it types more programs while preserving type safety), it
can internalize some meta-theoretic properties, and it removes some
pathological cases of the current implementation resulting in a more intuitive
and, thus, predictable type system. More generally, this work shows how to add
full-fledged union types to functional languages of the ML family that usually
rely on the Hindley-Milner type system. As an aside, our system also improves
the theory of semantic subtyping, notably by proving completeness for the type
reconstruction algorithm.
","[{'version': 'v1', 'created': 'Fri, 3 Jun 2016 14:34:55 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Jul 2016 08:51:06 GMT'}]",2016-07-06,"[['Castagna', 'Giuseppe', '', 'CNRS, IRIF'], ['Petrucciani', 'Tommaso', '', 'IRIF, DIBRIS'], ['Nguyen', 'Kim', '', 'LRI']]","['Type reconstruction', 'union types', 'type constraints']"
8722,2104.02046,Wieslaw Kopec,"Wies{\l}aw Kope\'c, Jaros{\l}aw Kowalski, Julia Paluch, Anna
  Jaskulska, Kinga Skorupska, Marcin Niewi\'nski, Maciej Krzywicki, Cezary
  Biele",Older Adults and Brain-Computer Interface: An Exploratory Study,,,10.1145/3411763.3451663,,cs.HC cs.CY cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this exploratory study, we examine the possibilities of non-invasive
Brain-Computer Interface (BCI) in the context of Smart Home Technology (SHT)
targeted at older adults. During two workshops, one stationary, and one online
via Zoom, we researched the insights of the end users concerning the potential
of the BCI in the SHT setting. We explored its advantages and drawbacks, and
the features older adults see as vital as well as the ones that they would
benefit from. Apart from evaluating the participants' perception of such
devices during the two workshops we also analyzed some key considerations
resulting from the insights gathered during the workshops, such as potential
barriers, ways to mitigate them, strengths and opportunities connected to BCI.
These may be useful for designing BCI interaction paradigms and pinpointing
areas of interest to pursue in further studies.
","[{'version': 'v1', 'created': 'Mon, 5 Apr 2021 17:49:46 GMT'}]",2021-04-06,"[['Kopeć', 'Wiesław', ''], ['Kowalski', 'Jarosław', ''], ['Paluch', 'Julia', ''], ['Jaskulska', 'Anna', ''], ['Skorupska', 'Kinga', ''], ['Niewiński', 'Marcin', ''], ['Krzywicki', 'Maciej', ''], ['Biele', 'Cezary', '']]","['BCI', 'brain-computer interface', 'IoT', 'internet of things', 'older adults', 'smart home', 'living lab']"
8723,2204.11082,Gilberto Camara,Gilberto Camara,On the semantics of big Earth observation data for land classification,,"Journal of Spatial Information Science (20):21-34, 2020",10.5311/JOSIS.2020.20.645,,cs.LG cs.CY physics.geo-ph,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper discusses the challenges of using big Earth observation data for
land classification. The approach taken is to consider pure data-driven methods
to be insufficient to represent continuous change. We argue for sound theories
when working with big data. After revising existing classification schemes such
as FAO's Land Cover Classification System (LCCS), we conclude that LCCS and
similar proposals cannot capture the complexity of landscape dynamics. We then
investigate concepts that are being used for analyzing satellite image time
series; we show these concepts to be instances of events. Therefore, for
continuous monitoring of land change, event recognition needs to replace object
identification as the prevailing paradigm. The paper concludes by showing how
event semantics can improve data-driven methods to fulfil the potential of big
data.
","[{'version': 'v1', 'created': 'Sat, 23 Apr 2022 14:45:53 GMT'}]",2022-04-26,"[['Camara', 'Gilberto', '']]","['Big data', 'Earth observation', 'Geospatial semantics', 'LUCC', 'Land-use change']"
8724,1909.05581,Isaac Oscar Gariano,"Isaac Oscar Gariano, Richard Roberts, Stefan Marr, Michael Homer,
  James Noble",Which of My Transient Type Checks Are Not (Almost) Free?,,,10.1145/3358504.3361232,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One form of type checking used in gradually typed language is transient type
checking: whenever an object 'flows' through code with a type annotation, the
object is dynamically checked to ensure it has the methods required by the
annotation. Just-in-time compilation and optimisation in virtual machines can
eliminate much of the overhead of run-time transient type checks. Unfortunately
this optimisation is not uniform: some type checks will significantly decrease,
or even increase, a program's performance.
  In this paper, we refine the so called ""Takikawa"" protocol, and use it to
identify which type annotations have the greatest effects on performance. In
particular, we show how graphing the performance of such benchmarks when
varying which type annotations are present in the source code can be used to
discern potential patterns in performance. We demonstrate our approach by
testing the Moth virtual machine: for many of the benchmarks where Moth's
transient type checking impacts performance, we have been able to identify one
or two specific type annotations that are the likely cause. Without these type
annotations, the performance impact of transient type checking becomes
negligible.
  Using our technique programmers can optimise programs by removing expensive
type checks, and VM engineers can identify new opportunities for compiler
optimisation.
","[{'version': 'v1', 'created': 'Thu, 12 Sep 2019 11:46:09 GMT'}]",2019-09-13,"[['Gariano', 'Isaac Oscar', ''], ['Roberts', 'Richard', ''], ['Marr', 'Stefan', ''], ['Homer', 'Michael', ''], ['Noble', 'James', '']]","['dynamic type checking', 'gradual types', 'optionaltypes', 'Grace', 'performance evaluation', 'benchmarking', 'objectoriented programming']"
8725,2201.07322,Siyuan Shan,"Siyuan Shan, Vishal Baskaran, Haidong Yi, Jolene Ranek, Natalie
  Stanley, Junier Oliva",Transparent Single-Cell Set Classification with Kernel Mean Embeddings,"Accepted as Oral by ACM-BCB 2022. Codes are avialbe at
  https://github.com/shansiliu95/CKME",,10.1145/3535508.3545538,,cs.LG q-bio.QM,http://creativecommons.org/publicdomain/zero/1.0/,"  Modern single-cell flow and mass cytometry technologies measure the
expression of several proteins of the individual cells within a blood or tissue
sample. Each profiled biological sample is thus represented by a set of
hundreds of thousands of multidimensional cell feature vectors, which incurs a
high computational cost to predict each biological sample's associated
phenotype with machine learning models. Such a large set cardinality also
limits the interpretability of machine learning models due to the difficulty in
tracking how each individual cell influences the ultimate prediction. We
propose using Kernel Mean Embedding to encode the cellular landscape of each
profiled biological sample. Although our foremost goal is to make a more
transparent model, we find that our method achieves comparable or better
accuracies than the state-of-the-art gating-free methods through a simple
linear classifier. As a result, our model contains few parameters but still
performs similarly to deep learning models with millions of parameters. In
contrast with deep learning approaches, the linearity and sub-selection step of
our model makes it easy to interpret classification results. Analysis further
shows that our method admits rich biological interpretability for linking
cellular heterogeneity to clinical phenotype.
","[{'version': 'v1', 'created': 'Tue, 18 Jan 2022 21:40:36 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Jan 2022 18:12:16 GMT'}, {'version': 'v3', 'created': 'Mon, 31 Jan 2022 05:43:47 GMT'}, {'version': 'v4', 'created': 'Thu, 10 Feb 2022 08:10:14 GMT'}, {'version': 'v5', 'created': 'Tue, 28 Jun 2022 15:39:38 GMT'}]",2022-06-29,"[['Shan', 'Siyuan', ''], ['Baskaran', 'Vishal', ''], ['Yi', 'Haidong', ''], ['Ranek', 'Jolene', ''], ['Stanley', 'Natalie', ''], ['Oliva', 'Junier', '']]","['Cytometry', 'Single-Cell Bioinformatics', 'Clinical Prediction', 'FlowCytometry', 'Mass Cytometry', 'Kernel Methods']"
8726,1907.01923,Justin Edwards,"Justin Edwards, Elaheh Sanoubari",A Need for Trust in Conversational Interface Research,,,10.1145/3342775.3342809,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Across several branches of conversational interaction research including
interactions with social robots, embodied agents, and conversational
assistants, users have identified trust as a critical part of those
interactions. Nevertheless, there is little agreement on what trust means
within these sort of interactions or how trust can be measured. In this paper,
we explore some of the dimensions of trust as it has been understood in
previous work and we outline some of the ways trust has been measured in the
hopes of furthering discussion of the concept across the field.
","[{'version': 'v1', 'created': 'Wed, 3 Jul 2019 13:12:23 GMT'}]",2019-07-04,"[['Edwards', 'Justin', ''], ['Sanoubari', 'Elaheh', '']]","['trust', 'design', 'conversational agents', 'Human-robot interaction', 'Humanagent interaction']"
8727,1604.05393,Fouad Khan,Fouad Khan,"An Adaptive Learning Mechanism for Selection of Increasingly More
  Complex Systems","(IJACSA), 6(6), 2015",,10.14569/IJACSA.2015.060632,,cs.IT cs.LG math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently it has been demonstrated that causal entropic forces can lead to the
emergence of complex phenomena associated with human cognitive niche such as
tool use and social cooperation. Here I show that even more fundamental traits
associated with human cognition such as 'self-awareness' can easily be
demonstrated to be arising out of merely a selection for 'better regulators';
i.e. systems which respond comparatively better to threats to their existence
which are internal to themselves. A simple model demonstrates how indeed the
average self-awareness for a universe of systems continues to rise as less
self-aware systems are eliminated. The model also demonstrates however that the
maximum attainable self-awareness for any system is limited by the plasticity
and energy availability for that typology of systems. I argue that this rise in
self-awareness may be the reason why systems tend towards greater complexity.
","[{'version': 'v1', 'created': 'Tue, 19 Apr 2016 00:59:54 GMT'}]",2016-04-20,"[['Khan', 'Fouad', '']]","['Adaptive Learning', 'Complexity', 'Self-awareness', 'Good regulator theorem', 'Adaptive Selection']"
8728,2010.01944,Selma Rizvic,"Selma Rizvic, Dusanka Boskovic, Fabio Bruno, Barbara Davidde
  Petriaggi, Sanda Sljivo, Marco Cozza",Actors in VR storytelling,Pre-print version,,10.1109/VS-Games.2019.8864520,,cs.HC cs.GR cs.MM,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Virtual Reality (VR) storytelling enhances the immersion of users into
virtual environments (VE). Its use in virtual cultural heritage presentations
helps the revival of the genius loci (the spirit of the place) of cultural
monuments. This paper aims to show that the use of actors in VR storytelling
adds to the quality of user experience and improves the edutainment value of
virtual cultural heritage applications. We will describe the Baiae dry visit
application which takes us to a time travel in the city considered by the Roman
elite as ""Little Rome (Pusilla Roma)"" and presently is only partially preserved
under the sea.
","[{'version': 'v1', 'created': 'Mon, 5 Oct 2020 12:14:37 GMT'}]",2020-10-06,"[['Rizvic', 'Selma', ''], ['Boskovic', 'Dusanka', ''], ['Bruno', 'Fabio', ''], ['Petriaggi', 'Barbara Davidde', ''], ['Sljivo', 'Sanda', ''], ['Cozza', 'Marco', '']]","['virtual reality', 'virtual cultural heritage', 'interactivedigital storytelling', 'VR storytelling', 'Baiae']"
8729,2104.14801,Philipp Wicke,Philipp Wicke and Tony Veale,"Creative Action at a Distance: A Conceptual Framework for Embodied
  Performance With Robotic Actors","22 pages, 7 figures, open-access, Research Topic: Creativity and
  Robotics",Front. Robot. AI 8:662182 (2021),10.3389/frobt.2021.662182,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Acting, stand-up and dancing are creative, embodied performances that
nonetheless follow a script. Unless experimental or improvised, the performers
draw their movements from much the same stock of embodied schemas. A slavish
following of the script leaves no room for creativity, but active
interpretation of the script does. It is the choices one makes, of words and
actions, that make a performance creative. In this theory and hypothesis
article, we present a framework for performance and interpretation within
robotic storytelling. The performance framework is built upon movement theory,
and defines a taxonomy of basic schematic movements and the most important
gesture types. For the interpretation framework, we hypothesise that
emotionally-grounded choices can inform acts of metaphor and blending, to
elevate a scripted performance into a creative one. Theory and hypothesis are
each grounded in empirical research, and aim to provide resources for other
robotic studies of the creative use of movement and gestures.
","[{'version': 'v1', 'created': 'Fri, 30 Apr 2021 07:36:33 GMT'}]",2021-05-03,"[['Wicke', 'Philipp', ''], ['Veale', 'Tony', '']]","['robotics', 'computational creativity', 'embodiment', 'storytelling', 'spatial movement']"
8730,2208.02971,Wento Bai,"Yongxiang Tang, Wentao Bai, Guilin Li, Xialong Liu, Yu Zhang","CROLoss: Towards a Customizable Loss for Retrieval Models in Recommender
  Systems","9 pages, 5 figures. Accepted by by CIKM 2022",,10.1145/3511808.3557274,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In large-scale recommender systems, retrieving top N relevant candidates
accurately with resource constrain is crucial. To evaluate the performance of
such retrieval models, Recall@N, the frequency of positive samples being
retrieved in the top N ranking, is widely used. However, most of the
conventional loss functions for retrieval models such as softmax cross-entropy
and pairwise comparison methods do not directly optimize Recall@N. Moreover,
those conventional loss functions cannot be customized for the specific
retrieval size N required by each application and thus may lead to sub-optimal
performance. In this paper, we proposed the Customizable Recall@N Optimization
Loss (CROLoss), a loss function that can directly optimize the Recall@N metrics
and is customizable for different choices of N. This proposed CROLoss
formulation defines a more generalized loss function space, covering most of
the conventional loss functions as special cases. Furthermore, we develop the
Lambda method, a gradient-based method that invites more flexibility and can
further boost the system performance. We evaluate the proposed CROLoss on two
public benchmark datasets. The results show that CROLoss achieves SOTA results
over conventional loss functions for both datasets with various choices of
retrieval size N. CROLoss has been deployed onto our online E-commerce
advertising platform, where a fourteen-day online A/B test demonstrated that
CROLoss contributes to a significant business revenue growth of 4.75%.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2022 03:45:56 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Nov 2022 05:47:05 GMT'}]",2022-11-10,"[['Tang', 'Yongxiang', ''], ['Bai', 'Wentao', ''], ['Li', 'Guilin', ''], ['Liu', 'Xialong', ''], ['Zhang', 'Yu', '']]","['Recommender systems', 'information retrieval', 'Recall@N optimization']"
8731,2104.08819,Manjushree Laddha,"Manjushree D. Laddha, Varsha T. Lokare, Arvind W. Kiwelekar and Laxman
  D. Netak","Classifications of the Summative Assessment for Revised Blooms Taxonomy
  by using Deep Learning","8 pages, 7 figures, 2 tables","International Journal of Engineering Trends and Technology
  69.3(2021):211-218",10.14445/22315381/IJETT-V69I3P232,,cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Education is the basic step of understanding the truth and the preparation of
the intelligence to reflect. Focused on the rational capacity of the human
being the Cognitive process and knowledge dimensions of Revised Blooms Taxonomy
helps to differentiate the procedure of studying into six types of various
cognitive processes and four types of knowledge dimensions. These types are
synchronized in the increasing level of difficulty. In this paper Software
Engineering courses of B.Tech Computer Engineering and Information Technology
offered by various Universities and Educational Institutes have been
investigated for Revised Blooms Taxonomy RBT. Questions are a very useful
constituent. Knowledge intelligence and strength of the learners can be tested
by applying questions.The fundamental goal of this paper is to create a
relative study of the classification of the summative assessment based on
Revised Blooms Taxonomy using the Convolutional Neural Networks CNN Long
Short-Term Memory LSTM of Deep Learning techniques in an endeavor to attain
significant accomplishment and elevated precision levels.
","[{'version': 'v1', 'created': 'Sun, 18 Apr 2021 11:21:48 GMT'}]",2021-04-20,"[['Laddha', 'Manjushree D.', ''], ['Lokare', 'Varsha T.', ''], ['Kiwelekar', 'Arvind W.', ''], ['Netak', 'Laxman D.', '']]","['Revised Bloom’s Taxonomy', 'Deep Learning', 'Software Engineering', 'Convolutional Neural Networks', 'Long Short-Term Memory']"
8732,2006.11876,Hanzhi Wang,"Hanzhi Wang, Zhewei Wei, Junhao Gan, Sibo Wang, Zengfeng Huang","Personalized PageRank to a Target Node, Revisited",ACM SIGKDD 2020,,10.1145/3394486.3403108,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Personalized PageRank (PPR) is a widely used node proximity measure in graph
mining and network analysis. Given a source node $s$ and a target node $t$, the
PPR value $\pi(s,t)$ represents the probability that a random walk from $s$
terminates at $t$, and thus indicates the bidirectional importance between $s$
and $t$. The majority of the existing work focuses on the single-source
queries, which asks for the PPR value of a given source node $s$ and every node
$t \in V$. However, the single-source query only reflects the importance of
each node $t$ with respect to $s$. In this paper, we consider the {\em
single-target PPR query}, which measures the opposite direction of importance
for PPR. Given a target node $t$, the single-target PPR query asks for the PPR
value of every node $s\in V$ to a given target node $t$. We propose RBS, a
novel algorithm that answers approximate single-target queries with optimal
computational complexity. We show that RBS improves three concrete
applications: heavy hitters PPR query, single-source SimRank computation, and
scalable graph neural networks. We conduct experiments to demonstrate that RBS
outperforms the state-of-the-art algorithms in terms of both efficiency and
precision on real-world benchmark datasets.
","[{'version': 'v1', 'created': 'Sun, 21 Jun 2020 18:54:53 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Jun 2020 06:17:59 GMT'}]",2020-06-25,"[['Wang', 'Hanzhi', ''], ['Wei', 'Zhewei', ''], ['Gan', 'Junhao', ''], ['Wang', 'Sibo', ''], ['Huang', 'Zengfeng', '']]","['Personalized PageRank', 'single-target query', 'graph mining']"
8733,1910.13826,Kazunori Komatani,Mikio Nakano and Kazunori Komatani,A Framework for Building Closed-Domain Chat Dialogue Systems,24 pages,"Knowledge-Based Systems, Volume 204, 2020",10.1016/j.knosys.2020.106212,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents HRIChat, a framework for developing closed-domain chat
dialogue systems. Being able to engage in chat dialogues has been found
effective for improving communication between humans and dialogue systems. This
paper focuses on closed-domain systems because they would be useful when
combined with task-oriented dialogue systems in the same domain. HRIChat
enables domain-dependent language understanding so that it can deal well with
domain-specific utterances. In addition, HRIChat makes it possible to integrate
state transition network-based dialogue management and reaction-based dialogue
management. FoodChatbot, which is an application in the food and restaurant
domain, has been developed and evaluated through a user study. Its results
suggest that reasonably good systems can be developed with HRIChat. This paper
also reports lessons learned from the development and evaluation of
FoodChatbot.
","[{'version': 'v1', 'created': 'Wed, 30 Oct 2019 13:06:23 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Nov 2019 08:44:36 GMT'}, {'version': 'v3', 'created': 'Sat, 30 May 2020 02:22:23 GMT'}, {'version': 'v4', 'created': 'Tue, 21 Jul 2020 00:30:01 GMT'}]",2020-07-22,"[['Nakano', 'Mikio', ''], ['Komatani', 'Kazunori', '']]","['closed-domain chatbot', 'dialogue system development framework', 'non-task-oriented dialogue system']"
8734,2011.05196,Nejat Arinik,"Nejat Arinik (LIA), Rosa Figueiredo, Vincent Labatut","Multiplicity and Diversity: Analyzing the Optimal Solution Space of the
  Correlation Clustering Problem on Complete Signed Graphs",,"Journal of Complex Networks 8(6):cnaa025, Oxford University Press,
  2021",10.1093/comnet/cnaa025,,cs.RO cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to study real-world systems, many applied works model them through
signed graphs, i.e. graphs whose edges are labeled as either positive or
negative. Such a graph is considered as structurally balanced when it can be
partitioned into a number of modules, such that positive (resp. negative) edges
are located inside (resp. in-between) the modules. When it is not the case,
authors look for the closest partition to such balance, a problem called
Correlation Clustering (CC). Due to the complexity of the CC problem, the
standard approach is to find a single optimal partition and stick to it, even
if other optimal or high scoring solutions possibly exist. In this work, we
study the space of optimal solutions of the CC problem, on a collection of
synthetic complete graphs. We show empirically that under certain conditions,
there can be many optimal partitions of a signed graph. Some of these are very
different and thus provide distinct perspectives on the system, as illustrated
on a small real-world graph. This is an important result, as it implies that
one may have to find several, if not all, optimal solutions of the CC problem,
in order to properly study the considered system.
","[{'version': 'v1', 'created': 'Tue, 10 Nov 2020 15:50:26 GMT'}]",2022-03-31,"[['Arinik', 'Nejat', '', 'LIA'], ['Figueiredo', 'Rosa', ''], ['Labatut', 'Vincent', '']]","['Signed Graph', 'Complete Graph', 'Correlation Clustering', 'Structural Balance', 'MultipleSolutions', 'Graph Partitioning', 'Solution Space']"
8735,2104.03054,Immanuel Weber,"Immanuel Weber, Jens Bongartz, Ribana Roscher","Artificial and beneficial -- Exploiting artificial images for aerial
  vehicle detection","14 pages, 13 figures, 4 tables","ISPRS Journal of Photogrammetry and Remote Sensing, Volume 175,
  May 2021, Pages 158-170",10.1016/j.isprsjprs.2021.02.015,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Object detection in aerial images is an important task in environmental,
economic, and infrastructure-related tasks. One of the most prominent
applications is the detection of vehicles, for which deep learning approaches
are increasingly used. A major challenge in such approaches is the limited
amount of data that arises, for example, when more specialized and rarer
vehicles such as agricultural machinery or construction vehicles are to be
detected. This lack of data contrasts with the enormous data hunger of deep
learning methods in general and object recognition in particular. In this
article, we address this issue in the context of the detection of road vehicles
in aerial images. To overcome the lack of annotated data, we propose a
generative approach that generates top-down images by overlaying artificial
vehicles created from 2D CAD drawings on artificial or real backgrounds. Our
experiments with a modified RetinaNet object detection network show that adding
these images to small real-world datasets significantly improves detection
performance. In cases of very limited or even no real-world images, we observe
an improvement in average precision of up to 0.70 points. We address the
remaining performance gap to real-world datasets by analyzing the effect of the
image composition of background and objects and give insights into the
importance of background.
","[{'version': 'v1', 'created': 'Wed, 7 Apr 2021 11:06:15 GMT'}]",2021-04-08,"[['Weber', 'Immanuel', ''], ['Bongartz', 'Jens', ''], ['Roscher', 'Ribana', '']]","['Object detection', 'deep learning', 'data generation', 'multi-source learning']"
8736,2104.01514,Stephen MacDonell,"Steve Counsell, Tracy Hall, Thomas Shippey, David Bowes, Amjed Tahir
  and Stephen MacDonell",Assert Use and Defectiveness in Industrial Code,"Conference paper, 5 pages, 2 figures, 3 tables","Proceedings of the IEEE International Symposium on Software
  Reliability Engineering Workshops (ISSREW2017). Toulouse, France, IEEE,
  pp.20-23",10.1109/ISSREW.2017.20.,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of asserts in code has received increasing attention in the software
engineering community in the past few years, even though it has been a
recognized programming construct for many decades. A previous empirical study
by Casalnuovo showed that methods containing asserts had fewer defects than
those that did not. In this paper, we analyze the test classes of two
industrial telecom Java systems to lend support to, or refute that finding. We
also analyze the physical position of asserts in methods to determine if there
is a relationship between assert placement and method defect-proneness.
Finally, we explore the role of test method size and the relationship it has
with asserts. In terms of the previous study by Casalnuovo, we found only
limited evidence to support the earlier results. We did however find that
defective methods with one assert tended to be located at significantly lower
levels of the class position-wise than non-defective methods. Finally, method
size seemed to correlate strongly with asserts, but surprisingly less so when
we excluded methods with just one assert. The work described highlights the
need for more studies into this aspect of code, one which has strong links with
code comprehension.
","[{'version': 'v1', 'created': 'Sun, 4 Apr 2021 01:41:45 GMT'}]",2021-04-06,"[['Counsell', 'Steve', ''], ['Hall', 'Tracy', ''], ['Shippey', 'Thomas', ''], ['Bowes', 'David', ''], ['Tahir', 'Amjed', ''], ['MacDonell', 'Stephen', '']]","['defect', 'assert', 'empirical', 'industry']"
8737,2201.00042,Subutai Ahmad,"Abhiram Iyer, Karan Grewal, Akash Velu, Lucas Oliveira Souza, Jeremy
  Forest, and Subutai Ahmad","Avoiding Catastrophe: Active Dendrites Enable Multi-Task Learning in
  Dynamic Environments","31 pages, 17 figures",Frontiers in Neurorobotics 16 2022 (1-23),10.3389/fnbot.2022.846219,,cs.NE cs.AI cs.LG q-bio.NC,http://creativecommons.org/licenses/by/4.0/,"  A key challenge for AI is to build embodied systems that operate in
dynamically changing environments. Such systems must adapt to changing task
contexts and learn continuously. Although standard deep learning systems
achieve state of the art results on static benchmarks, they often struggle in
dynamic scenarios. In these settings, error signals from multiple contexts can
interfere with one another, ultimately leading to a phenomenon known as
catastrophic forgetting. In this article we investigate biologically inspired
architectures as solutions to these problems. Specifically, we show that the
biophysical properties of dendrites and local inhibitory systems enable
networks to dynamically restrict and route information in a context-specific
manner. Our key contributions are as follows. First, we propose a novel
artificial neural network architecture that incorporates active dendrites and
sparse representations into the standard deep learning framework. Next, we
study the performance of this architecture on two separate benchmarks requiring
task-based adaptation: Meta-World, a multi-task reinforcement learning
environment where a robotic agent must learn to solve a variety of manipulation
tasks simultaneously; and a continual learning benchmark in which the model's
prediction task changes throughout training. Analysis on both benchmarks
demonstrates the emergence of overlapping but distinct and sparse subnetworks,
allowing the system to fluidly learn multiple tasks with minimal forgetting.
Our neural implementation marks the first time a single architecture has
achieved competitive results on both multi-task and continual learning
settings. Our research sheds light on how biological properties of neurons can
inform deep learning systems to address dynamic scenarios that are typically
impossible for traditional ANNs to solve.
","[{'version': 'v1', 'created': 'Fri, 31 Dec 2021 19:52:42 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Apr 2022 15:36:13 GMT'}]",2022-04-26,"[['Iyer', 'Abhiram', ''], ['Grewal', 'Karan', ''], ['Velu', 'Akash', ''], ['Souza', 'Lucas Oliveira', ''], ['Forest', 'Jeremy', ''], ['Ahmad', 'Subutai', '']]","['dendrites', 'reinforcement learning', 'embodied AI', 'continual learning', 'neuroscience', 'robotics']"
8738,2203.12060,Brendan Keith,"Anoop Kodakkal, Brendan Keith, Ustim Khristenko, Andreas Apostolatos,
  Kai-Uwe Bletzinger, Barbara Wohlmuth, Roland Wuechner",Risk-averse design of tall buildings for uncertain wind conditions,,,10.1016/j.cma.2022.115371,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reducing the intensity of wind excitation via aerodynamic shape modification
is a major strategy to mitigate the reaction forces on supertall buildings,
reduce construction and maintenance costs, and improve the comfort of future
occupants. To this end, computational fluid dynamics (CFD) combined with
state-of-the-art stochastic optimization algorithms is more promising than the
trial and error approach adopted by the industry. The present study proposes
and investigates a novel approach to risk-averse shape optimization of tall
building structures that incorporates site-specific uncertainties in the wind
velocity, terrain conditions, and wind flow direction. A body-fitted finite
element approximation is used for the CFD with different wind directions
incorporated by re-meshing the fluid domain. The bending moment at the base of
the building is minimized, resulting in a building with reduced cost, material,
and hence, a reduced carbon footprint. Both risk-neutral and risk-averse
optimization of the twist and tapering of a representative building are
presented under uncertain inflow wind conditions that have been calibrated to
fit freely-available site-specific data from Basel, Switzerland. The
risk-averse strategy uses the conditional value-at-risk to optimize for the
low-probability high-consequence events appearing in the worst 10% of loading
conditions. Adaptive sampling is used to accelerate the gradient-based
stochastic optimization pipeline. The adaptive method is easy to implement and
particularly helpful for compute-intensive simulations because the number of
gradient samples grows only as the optimal design algorithm converges. The
performance of the final risk-averse building geometry is exceptionally
favorable when compared to the risk-neutral optimized geometry, thus,
demonstrating the effectiveness of the risk-averse design approach in
computational wind engineering.
","[{'version': 'v1', 'created': 'Tue, 22 Mar 2022 21:45:52 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Jul 2022 22:15:47 GMT'}]",2022-12-07,"[['Kodakkal', 'Anoop', ''], ['Keith', 'Brendan', ''], ['Khristenko', 'Ustim', ''], ['Apostolatos', 'Andreas', ''], ['Bletzinger', 'Kai-Uwe', ''], ['Wohlmuth', 'Barbara', ''], ['Wuechner', 'Roland', '']]","['Computational wind engineering', 'optimization under uncertainty', 'conditional value-at-risk', 'adaptive sampling', 'shape optimization']"
8739,1707.01182,Rolf Fagerberg,"Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin",Biased Predecessor Search,Also appeared at LATIN'14,Algorithmica 76(4): 1097-1105 (2016),10.1007/s00453-016-0146-7,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of performing predecessor searches in a bounded
universe while achieving query times that depend on the distribution of
queries. We obtain several data structures with various properties: in
particular, we give data structures that achieve expected query times
logarithmic in the entropy of the distribution of queries but with space
bounded in terms of universe size, as well as data structures that use only
linear space but with query times that are higher (but still sublinear)
functions of the entropy. For these structures, the distribution is assumed to
be known. We also consider individual query times on universe elements with
general weights, as well as the case when the distribution is not known in
advance.
","[{'version': 'v1', 'created': 'Tue, 4 Jul 2017 23:23:34 GMT'}]",2017-07-06,"[['Bose', 'Prosenjit', ''], ['Fagerberg', 'Rolf', ''], ['Howat', 'John', ''], ['Morin', 'Pat', '']]","['data structures', 'predecessor search', 'biased search trees', 'entropy']"
8740,2006.16066,Petr Gabrlik,"Petr Gabrlik, Tomas Lazna, Tomas Jilek, Petr Sladek, Ludek Zalud",Using an Automated Heterogeneous Robotic System for Radiation Surveys,"32 pages, 31 figures; preprint under review",,10.1002/rob.22010,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During missions involving radiation exposure, unmanned robotic platforms may
embody a valuable tool, especially thanks to their capability of replacing
human operators in certain tasks to eliminate the health risks associated with
such an environment. Moreover, rapid development of the technology allows us to
increase the automation rate, making the human operator generally less
important within the entire process. This article presents a multi-robotic
system designed for highly automated radiation mapping and source localization.
Our approach includes a three-phase procedure comprising sequential deployment
of two diverse platforms, namely, an unmanned aircraft system (UAS) and an
unmanned ground vehicle (UGV), to perform aerial photogrammetry, aerial
radiation mapping, and terrestrial radiation mapping. The central idea is to
produce a sparse dose rate map of the entire study site via the UAS and,
subsequently, to perform detailed UGV-based mapping in limited
radiation-contaminated regions. To accomplish these tasks, we designed numerous
methods and data processing algorithms to facilitate, for example, digital
elevation model (DEM)-based terrain following for the UAS, automatic selection
of the regions of interest, obstacle map-based UGV trajectory planning, and
source localization. The overall usability of the multi-robotic system was
demonstrated by means of a one-day, authentic experiment, namely, a fictitious
car accident including the loss of several radiation sources. The ability of
the system to localize radiation hotspots and individual sources has been
verified.
","[{'version': 'v1', 'created': 'Mon, 29 Jun 2020 14:16:04 GMT'}]",2021-02-23,"[['Gabrlik', 'Petr', ''], ['Lazna', 'Tomas', ''], ['Jilek', 'Tomas', ''], ['Sladek', 'Petr', ''], ['Zalud', 'Ludek', '']]","['radiation mapping', 'aerial robotics', 'terrestrial robotics', 'cooperative robots', 'environmental monitoring']"
8741,2009.05639,Klim Zaporojets,"Klim Zaporojets, Giannis Bekoulis, Johannes Deleu, Thomas Demeester,
  Chris Develder","Solving Arithmetic Word Problems by Scoring Equations with Recursive
  Neural Networks",,"Expert Systems with Applications, 174 (2021) 114704",10.1016/j.eswa.2021.114704,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Solving arithmetic word problems is a cornerstone task in assessing language
understanding and reasoning capabilities in NLP systems. Recent works use
automatic extraction and ranking of candidate solution equations providing the
answer to arithmetic word problems. In this work, we explore novel approaches
to score such candidate solution equations using tree-structured recursive
neural network (Tree-RNN) configurations. The advantage of this Tree-RNN
approach over using more established sequential representations, is that it can
naturally capture the structure of the equations. Our proposed method consists
of transforming the mathematical expression of the equation into an expression
tree. Further, we encode this tree into a Tree-RNN by using different Tree-LSTM
architectures. Experimental results show that our proposed method (i) improves
overall performance with more than 3% accuracy points compared to previous
state-of-the-art, and with over 15% points on a subset of problems that require
more complex reasoning, and (ii) outperforms sequential LSTMs by 4% accuracy
points on such more complex problems.
","[{'version': 'v1', 'created': 'Fri, 11 Sep 2020 19:48:42 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Mar 2021 12:49:35 GMT'}]",2021-03-10,"[['Zaporojets', 'Klim', ''], ['Bekoulis', 'Giannis', ''], ['Deleu', 'Johannes', ''], ['Demeester', 'Thomas', ''], ['Develder', 'Chris', '']]","['arithmetic word problems', 'recursive neural networks', 'informationextraction', 'natural language processing']"
8742,2202.05906,Boyuan Chen,"Jiawen Xiong, Yong Shi, Boyuan Chen, Filipe R. Cogo, Zhen Ming (Jack)
  Jiang",Towards Build Verifiability for Java-based Systems,,,10.1145/3510457.3513050,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Build verifiability refers to the property that the build of a software
system can be verified by independent third parties and it is crucial for the
trustworthiness of a software system. Various efforts towards build
verifiability have been made to C/C++-based systems, yet the techniques for
Java-based systems are not systematic and are often specific to a particular
build tool (e.g., Maven). In this study, we present a systematic approach
towards build verifiability on Java-based systems. Our approach consists of
three parts: a unified build process, a tool that dynamically controls
non-determinism during the build process, and another tool that eliminates
non-equivalences by post-processing the build artifacts. We apply our approach
on 46 unverified open source projects from Reproducible Central and 13 open
source projects that are widely used by Huawei commercial products. As a
result, 91% of the unverified Reproducible Central projects and 100% of the
commercially adopted OSS projects are successfully verified with our approach.
In addition, based on our experience in analyzing thousands of builds for both
commercial and open source Java-based systems, we present 14 patterns that
introduce non-equivalences in generated build artifacts and their respective
mitigation strategies. Among these patterns, 11 (78%) are unique for Java-based
system, whereas the remaining 3 (22%) are common with C/C++-based systems. The
approach and the findings of this paper are useful for both practitioners and
researchers who are interested in build verifiability.
","[{'version': 'v1', 'created': 'Fri, 11 Feb 2022 21:13:08 GMT'}]",2022-02-15,"[['Xiong', 'Jiawen', '', 'Jack'], ['Shi', 'Yong', '', 'Jack'], ['Chen', 'Boyuan', '', 'Jack'], ['Cogo', 'Filipe R.', '', 'Jack'], ['Ming', 'Zhen', '', 'Jack'], ['Jiang', '', '']]","['Verifiable build', 'Build system', 'Security', 'Software engineering']"
8743,2103.13799,David Vilares,David Vilares and Marcos Garcia and Carlos G\'omez-Rodr\'iguez,Bertinho: Galician BERT Representations,Accepted in the journal Procesamiento del Lenguaje Natural,Procesamiento del Lenguaje Natural. 66 (2021) 13-26,10.26342/2021-66-1,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a monolingual BERT model for Galician. We follow the
recent trend that shows that it is feasible to build robust monolingual BERT
models even for relatively low-resource languages, while performing better than
the well-known official multilingual BERT (mBERT). More particularly, we
release two monolingual Galician BERT models, built using 6 and 12 transformer
layers, respectively; trained with limited resources (~45 million tokens on a
single GPU of 24GB). We then provide an exhaustive evaluation on a number of
tasks such as POS-tagging, dependency parsing and named entity recognition. For
this purpose, all these tasks are cast in a pure sequence labeling setup in
order to run BERT without the need to include any additional layers on top of
it (we only use an output classification layer to map the contextualized
representations into the predicted label). The experiments show that our
models, especially the 12-layer one, outperform the results of mBERT in most
tasks.
","[{'version': 'v1', 'created': 'Thu, 25 Mar 2021 12:51:34 GMT'}]",2021-04-08,"[['Vilares', 'David', ''], ['Garcia', 'Marcos', ''], ['Gómez-Rodríguez', 'Carlos', '']]","['BERT', 'Galician', 'embeddings', 'language modeling']"
8744,1702.04055,Muhammad Bilal,Muhammad Bilal and Shin-Gak Kang,Time-Assisted Authentication Protocol,"This article is accepted for the publication in ""International
  Journal of Communication Systems""","International Journal of Communication Systems, Volume30, Issue15
  October 2017, e3309",10.1002/dac.3309,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Authentication is the first step toward establishing a service provider and
customer (C-P) association. In a mobile network environment, a lightweight and
secure authentication protocol is one of the most significant factors to
enhance the degree of service persistence. This work presents a secure and
lightweight keying and authentication protocol suite termed TAP (Time-Assisted
Authentication Protocol). TAP improves the security of protocols with the
assistance of time-based encryption keys and scales down the authentication
complexity by issuing a re-authentication ticket. While moving across the
network, a mobile customer node sends a re-authentication ticket to establish
new sessions with service-providing nodes. Consequently, this reduces the
communication and computational complexity of the authentication process. In
the keying protocol suite, a key distributor controls the key generation
arguments and time factors, while other participants independently generate a
keychain based on key generation arguments. We undertake a rigorous security
analysis and prove the security strength of TAP using CSP and rank function
analysis.
","[{'version': 'v1', 'created': 'Tue, 14 Feb 2017 03:04:13 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Feb 2017 04:07:30 GMT'}]",2019-07-29,"[['Bilal', 'Muhammad', ''], ['Kang', 'Shin-Gak', '']]","['authentication', 'key distribution', 'network security', 'CSP', 'rank functions']"
8745,2210.05392,Linhai Zhuo,"Linhai Zhuo, Yuqian Fu, Jingjing Chen, Yixin Cao, Yu-Gang Jiang",TGDM: Target Guided Dynamic Mixup for Cross-Domain Few-Shot Learning,accepted by ACM MM 2022,,10.1145/3503161.3548052,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given sufficient training data on the source domain, cross-domain few-shot
learning (CD-FSL) aims at recognizing new classes with a small number of
labeled examples on the target domain. The key to addressing CD-FSL is to
narrow the domain gap and transferring knowledge of a network trained on the
source domain to the target domain. To help knowledge transfer, this paper
introduces an intermediate domain generated by mixing images in the source and
the target domain. Specifically, to generate the optimal intermediate domain
for different target data, we propose a novel target guided dynamic mixup
(TGDM) framework that leverages the target data to guide the generation of
mixed images via dynamic mixup. The proposed TGDM framework contains a Mixup-3T
network for learning classifiers and a dynamic ratio generation network (DRGN)
for learning the optimal mix ratio. To better transfer the knowledge, the
proposed Mixup-3T network contains three branches with shared parameters for
classifying classes in the source domain, target domain, and intermediate
domain. To generate the optimal intermediate domain, the DRGN learns to
generate an optimal mix ratio according to the performance on auxiliary target
data. Then, the whole TGDM framework is trained via bi-level meta-learning so
that TGDM can rectify itself to achieve optimal performance on target data.
Extensive experimental results on several benchmark datasets verify the
effectiveness of our method.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2022 12:12:36 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Nov 2022 14:21:07 GMT'}]",2022-12-01,"[['Zhuo', 'Linhai', ''], ['Fu', 'Yuqian', ''], ['Chen', 'Jingjing', ''], ['Cao', 'Yixin', ''], ['Jiang', 'Yu-Gang', '']]","['cross-domain few-shot learning', 'dynamic mixup', 'target guidedlearning', 'bi-level meta-learning']"
8746,2009.03139,Alberto Pretto,"Nicola Castaman, Enrico Pagello, Emanuele Menegatti, Alberto Pretto",Receding Horizon Task and Motion Planning in Changing Environments,,"Robotics and Autonomous Systems, Volume 145, November 2021, 103863",10.1016/j.robot.2021.103863,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Complex manipulation tasks require careful integration of symbolic reasoning
and motion planning. This problem, commonly referred to as Task and Motion
Planning (TAMP), is even more challenging if the workspace is non-static, e.g.
due to human interventions and perceived with noisy non-ideal sensors. This
work proposes an online approximated TAMP method that combines a geometric
reasoning module and a motion planner with a standard task planner in a
receding horizon fashion. Our approach iteratively solves a reduced planning
problem over a receding window of a limited number of future actions during the
implementation of the actions. Thus, only the first action of the horizon is
actually scheduled at each iteration, then the window is moved forward, and the
problem is solved again. This procedure allows to naturally take into account
potential changes in the scene while ensuring good runtime performance. We
validate our approach within extensive experiments in a simulated environment.
We showed that our approach is able to deal with unexpected changes in the
environment while ensuring comparable performance with respect to other recent
TAMP approaches in solving traditional static benchmarks. We release with this
paper the open-source implementation of our method.
","[{'version': 'v1', 'created': 'Mon, 7 Sep 2020 14:49:15 GMT'}, {'version': 'v2', 'created': 'Sun, 29 Aug 2021 15:18:37 GMT'}]",2021-08-31,"[['Castaman', 'Nicola', ''], ['Pagello', 'Enrico', ''], ['Menegatti', 'Emanuele', ''], ['Pretto', 'Alberto', '']]","['Task and Motion Planning', 'Robot Manipulation', 'Non-staticEnvironments']"
8747,2007.04697,Anastasija Nikiforova,Anastasija Nikiforova,"Open Data Quality Evaluation: A Comparative Analysis of Open Data in
  Latvia","24 pages, 2 tables, 3 figures, Baltic J. Modern Computing","Baltic J. Modern Computing, Vol. 6(2018), No. 4, 363-386",10.22364/bjmc.2018.6.4.04,,cs.DB cs.CY cs.IR stat.AP stat.CO,http://creativecommons.org/licenses/by/4.0/,"  Nowadays open data is entering the mainstream - it is free available for
every stakeholder and is often used in business decision-making. It is
important to be sure data is trustable and error-free as its quality problems
can lead to huge losses. The research discusses how (open) data quality could
be assessed. It also covers main points which should be considered developing a
data quality management solution. One specific approach is applied to several
Latvian open data sets. The research provides a step-by-step open data sets
analysis guide and summarizes its results. It is also shown there could exist
differences in data quality depending on data supplier (centralized and
decentralized data releases) and, unfortunately, trustable data supplier cannot
guarantee data quality problems absence. There are also underlined common data
quality problems detected not only in Latvian open data but also in open data
of 3 European countries.
","[{'version': 'v1', 'created': 'Thu, 9 Jul 2020 10:43:28 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Jun 2022 08:10:51 GMT'}]",2023-01-06,"[['Nikiforova', 'Anastasija', '']]","['data quality', 'open data', 'data quality specification', 'domain-specific modelling languages', 'decentralized data releases', 'centralized data releases']"
8748,2203.10677,Cailin Winston,"Cailin Winston, Caleb Winston, Chloe N Winston, Claris Winston, Cleah
  Winston, Rajesh PN Rao, Ren\'e Just",Repairing Brain-Computer Interfaces with Fault-Based Data Acquisition,"Accepted at International Conference on Software Engineering
  (ICSE-2022)",,10.1145/3510003.3512764,,cs.SE cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Brain-computer interfaces (BCIs) decode recorded neural signals from the
brain and/or stimulate the brain with encoded neural signals. BCIs span both
hardware and software and have a wide range of applications in restorative
medicine, from restoring movement through prostheses and robotic limbs to
restoring sensation and communication through spellers. BCIs also have
applications in diagnostic medicine, e.g., providing clinicians with data for
detecting seizures, sleep patterns, or emotions.
  Despite their promise, BCIs have not yet been adopted for long-term,
day-to-day use because of challenges related to reliability and robustness,
which are needed for safe operation in all scenarios. Ensuring safe operation
currently requires hours of manual data collection and recalibration, involving
both patients and clinicians. However, data collection is not targeted at
eliminating specific faults in a BCI. This paper presents a new methodology for
characterizing, detecting, and localizing faults in BCIs. Specifically, it
proposes partial test oracles as a method for detecting faults and slice
functions as a method for localizing faults to characteristic patterns in the
input data or relevant tasks performed by the user. Through targeted data
acquisition and retraining, the proposed methodology improves the correctness
of BCIs. We evaluated the proposed methodology on five BCI applications. The
results show that the proposed methodology (1) precisely localizes faults and
(2) can significantly reduce the frequency of faults through retraining based
on targeted, fault-based data acquisition. These results suggest that the
proposed methodology is a promising step towards repairing faulty BCIs.
","[{'version': 'v1', 'created': 'Sun, 20 Mar 2022 23:49:50 GMT'}]",2022-03-22,"[['Winston', 'Cailin', ''], ['Winston', 'Caleb', ''], ['Winston', 'Chloe N', ''], ['Winston', 'Claris', ''], ['Winston', 'Cleah', ''], ['Rao', 'Rajesh PN', ''], ['Just', 'René', '']]","['Brain-computer interface', 'neural decoding', 'partial test oracles', 'faultlocalization']"
8749,2109.12818,Francesc Verdugo Phd,Francesc Verdugo and Santiago Badia,"The software design of Gridap: a Finite Element package based on the
  Julia JIT compiler",,,10.1016/j.cpc.2022.108341,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the software design of Gridap, a novel finite element library
written exclusively in the Julia programming language, which is being used by
several research groups world-wide to simulate complex physical phenomena such
as magnetohydrodynamics, photonics, weather modeling, non-linear solid
mechanics, and fluid-structure interaction problems. The library provides a
feature-rich set of discretization techniques for the numerical approximation
of a wide range of PDEs, including linear, nonlinear, single-field, and
multi-field equations. An expressive API allows users to define PDEs in weak
form by a syntax close to the mathematical notation. While this is also
available in previous codes, the main novelty of Gridap is that it implements
this API without introducing a DSL plus a compiler of variational forms.
Instead, it leverages the Julia just-in-time compiler to build efficient code,
specialized for the concrete problem at hand. As a result, there is no need to
use different languages for the computational back-end and the user front-end
anymore, thus eliminating the so-called two-language problem. Gridap also
provides a low-level API that is modular and extensible via the
multiple-dispatch paradigm of Julia and provides easy access to the main
building blocks of the library. The main contribution of this paper is the
detailed presentation of the novel software abstractions behind the Gridap
design that leverages the new software possibilities provided by the Julia
language. The second main contribution of the article is a performance
comparison against FEniCS. We measure CPU times needed to assemble discrete
systems of linear equations for different problem types and show that the
performance of Gridap is comparable to FEniCS, demonstrating that the new
software design does not compromise performance. Gridap is freely available at
Github and distributed under an MIT license.
","[{'version': 'v1', 'created': 'Mon, 27 Sep 2021 06:27:37 GMT'}]",2022-04-13,"[['Verdugo', 'Francesc', ''], ['Badia', 'Santiago', '']]","['Mathematical Software', 'Finite Elements', 'Partial Differential Equations', 'Julia ProgrammingLanguage']"
8750,2112.09439,Masato Kikuchi,"Masato Kikuchi and Shun Shiramatsu and Ryota Kozakai and Tadachika
  Ozono","Matching Social Issues to Technologies for Civic Tech by Association
  Rule Mining using Weighted Casual Confidence","The 20th IEEE/WIC/ACM International Conference on Web Intelligence
  and Intelligent Agent Technology (WI-IAT'21), Special Track on Social
  Computing",,10.1145/3498851.3498931,,cs.CY cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  More than 80 civic tech communities in Japan are developing information
technology (IT) systems to solve their regional issues. Collaboration among
such communities across different regions assists in solving their problems
because some groups have limited IT knowledge and experience for this purpose.
Our objective is to realize a civic tech matchmaking system to assist such
communities in finding better partners with IT experience in their issues. In
this study, as the first step toward collaboration, we acquire relevant social
issues and information technologies by association rule mining. To meet our
challenge, we supply a questionnaire to members of civic tech communities and
obtain answers on their faced issues and their available technologies.
Subsequently, we match the relevant issues and technologies from the answers.
However, most of the issues and technologies in this questionnaire data are
infrequent, and there is a significant bias in their occurrence. Here, it is
difficult to extract truly relevant issues--technologies combinations with
existing interestingness measures. Therefore, we introduce a new measure called
weighted casual confidence, and show that our measure is effective for mining
relevant issues--technologies pairs.
","[{'version': 'v1', 'created': 'Fri, 17 Dec 2021 11:18:09 GMT'}]",2021-12-20,"[['Kikuchi', 'Masato', ''], ['Shiramatsu', 'Shun', ''], ['Kozakai', 'Ryota', ''], ['Ozono', 'Tadachika', '']]","['civic tech community', 'social issue', 'information technology', 'association rule mining', 'interestingness measure']"
8751,1806.07527,Mykhaylo Andriluka,"Mykhaylo Andriluka, Jasper R. R. Uijlings, Vittorio Ferrari","Fluid Annotation: A Human-Machine Collaboration Interface for Full Image
  Annotation",ACM MultiMedia 2018. Live demo is available at fluidann.appspot.com,,10.1145/3240508.3241916,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce Fluid Annotation, an intuitive human-machine collaboration
interface for annotating the class label and outline of every object and
background region in an image. Fluid annotation is based on three principles:
(I) Strong Machine-Learning aid. We start from the output of a strong neural
network model, which the annotator can edit by correcting the labels of
existing regions, adding new regions to cover missing objects, and removing
incorrect regions. The edit operations are also assisted by the model. (II)
Full image annotation in a single pass. As opposed to performing a series of
small annotation tasks in isolation, we propose a unified interface for full
image annotation in a single pass. (III) Empower the annotator. We empower the
annotator to choose what to annotate and in which order. This enables
concentrating on what the machine does not already know, i.e. putting human
effort only on the errors it made. This helps using the annotation budget
effectively. Through extensive experiments on the COCO+Stuff dataset, we
demonstrate that Fluid Annotation leads to accurate annotations very
efficiently, taking three times less annotation time than the popular LabelMe
interface.
","[{'version': 'v1', 'created': 'Wed, 20 Jun 2018 02:32:00 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Jun 2018 06:26:30 GMT'}, {'version': 'v3', 'created': 'Mon, 20 Aug 2018 16:54:46 GMT'}, {'version': 'v4', 'created': 'Fri, 21 Sep 2018 09:11:25 GMT'}, {'version': 'v5', 'created': 'Thu, 20 Dec 2018 14:20:56 GMT'}]",2018-12-21,"[['Andriluka', 'Mykhaylo', ''], ['Uijlings', 'Jasper R. R.', ''], ['Ferrari', 'Vittorio', '']]","['Computer vision', 'image annotation', 'human-machine collaboration']"
8752,2005.07997,Warut Suksompong,"Florian Brandl, Felix Brandt, Matthias Greger, Dominik Peters,
  Christian Stricker, Warut Suksompong",Funding Public Projects: A Case for the Nash Product Rule,,"Journal of Mathematical Economics, 99:102585 (2022)",10.1016/j.jmateco.2021.102585,,cs.GT econ.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study a mechanism design problem where a community of agents wishes to
fund public projects via voluntary monetary contributions by the community
members. This serves as a model for public expenditure without an exogenously
available budget, such as participatory budgeting or voluntary tax programs, as
well as donor coordination when interpreting charities as public projects and
donations as contributions. Our aim is to identify a mutually beneficial
distribution of the individual contributions. In the preference aggregation
problem that we study, agents report linear utility functions over projects
together with the amount of their contributions, and the mechanism determines a
socially optimal distribution of the money. We identify a specific mechanism --
the Nash product rule -- which picks the distribution that maximizes the
product of the agents' utilities. This rule is Pareto efficient, and we prove
that it satisfies attractive incentive properties: it spends each agent's
contribution only on projects the agent finds acceptable, and agents are
strongly incentivized to participate.
","[{'version': 'v1', 'created': 'Sat, 16 May 2020 14:17:00 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Oct 2021 13:40:39 GMT'}]",2022-03-09,"[['Brandl', 'Florian', ''], ['Brandt', 'Felix', ''], ['Greger', 'Matthias', ''], ['Peters', 'Dominik', ''], ['Stricker', 'Christian', ''], ['Suksompong', 'Warut', '']]","['public goods provision', 'collective decision making', 'participation incentives']"
8753,1907.02258,Thomas Lagkas,"Anastasios Lytos, Thomas Lagkas, Panagiotis Sarigiannidis, Kalina
  Bontcheva","The evolution of argumentation mining: From models to social media and
  emerging tools","Journal of Information Processing & Management, Elsevier - Accepted
  Version","Information Processing & Management, Volume 56, Issue 6, 2019",10.1016/j.ipm.2019.102055,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Argumentation mining is a rising subject in the computational linguistics
domain focusing on extracting structured arguments from natural text, often
from unstructured or noisy text. The initial approaches on modeling arguments
was aiming to identify a flawless argument on specific fields (Law, Scientific
Papers) serving specific needs (completeness, effectiveness). With the emerge
of Web 2.0 and the explosion in the use of social media both the diffusion of
the data and the argument structure have changed. In this survey article, we
bridge the gap between theoretical approaches of argumentation mining and
pragmatic schemes that satisfy the needs of social media generated data,
recognizing the need for adapting more flexible and expandable schemes, capable
to adjust to the argumentation conditions that exist in social media. We
review, compare, and classify existing approaches, techniques and tools,
identifying the positive outcome of combining tasks and features, and
eventually propose a conceptual architecture framework. The proposed
theoretical framework is an argumentation mining scheme able to identify the
distinct sub-tasks and capture the needs of social media text, revealing the
need for adopting more flexible and extensible frameworks.
","[{'version': 'v1', 'created': 'Thu, 4 Jul 2019 07:39:23 GMT'}]",2019-07-05,"[['Lytos', 'Anastasios', ''], ['Lagkas', 'Thomas', ''], ['Sarigiannidis', 'Panagiotis', ''], ['Bontcheva', 'Kalina', '']]","['Argumentation mining', 'argumentation models', 'computationallinguistics', 'social media', 'machine learning', 'argumentation tools']"
8754,2201.11999,Shuang Wu,"Shuang Wu, Zhenguang Li, Shijian Lu, Li Cheng",Dual Learning Music Composition and Dance Choreography,ACMMM 2021 (Oral),,10.1145/3474085.3475180,,cs.SD cs.CV cs.LG cs.MM eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Music and dance have always co-existed as pillars of human activities,
contributing immensely to the cultural, social, and entertainment functions in
virtually all societies. Notwithstanding the gradual systematization of music
and dance into two independent disciplines, their intimate connection is
undeniable and one art-form often appears incomplete without the other. Recent
research works have studied generative models for dance sequences conditioned
on music. The dual task of composing music for given dances, however, has been
largely overlooked. In this paper, we propose a novel extension, where we
jointly model both tasks in a dual learning approach. To leverage the duality
of the two modalities, we introduce an optimal transport objective to align
feature embeddings, as well as a cycle consistency loss to foster overall
consistency. Experimental results demonstrate that our dual learning framework
improves individual task performance, delivering generated music compositions
and dance choreographs that are realistic and faithful to the conditioned
inputs.
","[{'version': 'v1', 'created': 'Fri, 28 Jan 2022 09:20:28 GMT'}]",2022-02-01,"[['Wu', 'Shuang', ''], ['Li', 'Zhenguang', ''], ['Lu', 'Shijian', ''], ['Cheng', 'Li', '']]","['cross-modal generation', 'dual learning', 'optimal transport']"
8755,2009.05588,Silvio Peroni,"Erika Alves dos Santos, Silvio Peroni, Marcos Luiz Mucheroni","Citing and referencing habits in Medicine and Social Sciences journals
  in 2019","Accepted for publication on 18 January 2021 in Journal of
  Documentation",,10.1108/JD-08-2020-0144,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article explores citing and referencing systems in Social Sciences and
Medicine articles from different theoretical and practical perspectives,
considering bibliographic references as a facet of descriptive representation.
The analysis of citing and referencing elements (i.e. bibliographic references,
mentions, quotations, and respective in-text reference pointers) identified
citing and referencing habits within disciplines under consideration and errors
occurring over the long term as stated by previous studies now expanded. Future
expected trends of information retrieval from bibliographic metadata was
gathered by approaching these referencing elements from the FRBR Entities
concepts. Reference styles do not fully accomplish with their role of guiding
authors and publishers on providing concise and well-structured bibliographic
metadata within bibliographic references. Trends on representative description
revision suggest a predicted distancing on the ways information is approached
by bibliographic references and bibliographic catalogs adopting FRBR concepts,
including the description levels adopted by each of them under the perspective
of the FRBR Entities concept. This study was based on a subset of Medicine and
Social Sciences articles published in 2019 and, therefore, it may not be taken
as a final and broad coverage. Future studies expanding these approaches to
other disciplines and chronological periods are encouraged. By approaching
citing and referencing issues as descriptive representation's facets, findings
on this study may encourage further studies that will support Information
Science and Computer Science on providing tools to become bibliographic
metadata description simpler, better structured and more efficient facing the
revision of descriptive representation actually in progress.
","[{'version': 'v1', 'created': 'Fri, 11 Sep 2020 18:06:21 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Jan 2021 07:37:39 GMT'}]",2021-01-21,"[['Santos', 'Erika Alves dos', ''], ['Peroni', 'Silvio', ''], ['Mucheroni', 'Marcos Luiz', '']]","['Bibliographic references', 'in-text reference pointers', 'information representation', 'bibliographic metadata', 'FRBR', 'reference styles']"
8756,1712.06414,Misha Teplitskiy,"Feng Shi, Misha Teplitskiy, Eamon Duede, James Evans",The Wisdom of Polarized Crowds,,Nature Human Behavior. 2019,10.1038/s41562-019-0541-6,,cs.SI cs.CL cs.CY cs.DL stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As political polarization in the United States continues to rise, the
question of whether polarized individuals can fruitfully cooperate becomes
pressing. Although diversity of individual perspectives typically leads to
superior team performance on complex tasks, strong political perspectives have
been associated with conflict, misinformation and a reluctance to engage with
people and perspectives beyond one's echo chamber. It is unclear whether
self-selected teams of politically diverse individuals will create higher or
lower quality outcomes. In this paper, we explore the effect of team political
composition on performance through analysis of millions of edits to Wikipedia's
Political, Social Issues, and Science articles. We measure editors' political
alignments by their contributions to conservative versus liberal articles. A
survey of editors validates that those who primarily edit liberal articles
identify more strongly with the Democratic party and those who edit
conservative ones with the Republican party. Our analysis then reveals that
polarized teams---those consisting of a balanced set of politically diverse
editors---create articles of higher quality than politically homogeneous teams.
The effect appears most strongly in Wikipedia's Political articles, but is also
observed in Social Issues and even Science articles. Analysis of article ""talk
pages"" reveals that politically polarized teams engage in longer, more
constructive, competitive, and substantively focused but linguistically diverse
debates than political moderates. More intense use of Wikipedia policies by
politically diverse teams suggests institutional design principles to help
unleash the power of politically polarized teams.
","[{'version': 'v1', 'created': 'Wed, 29 Nov 2017 21:40:29 GMT'}]",2019-03-11,"[['Shi', 'Feng', ''], ['Teplitskiy', 'Misha', ''], ['Duede', 'Eamon', ''], ['Evans', 'James', '']]","['Team performance', 'Diversity', 'Political polarization', 'Crowd-sourcing', 'Wikipedia']"
8757,2009.04915,Trond Linjordet,Trond Linjordet and Krisztian Balog,"Sanitizing Synthetic Training Data Generation for Question Answering
  over Knowledge Graphs","Proceedings of the 2020 ACM SIGIR International Conference on Theory
  of Information Retrieval (ICTIR '20), 2020. 6 pages, 3 figures",,10.1145/3409256.3409836,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Synthetic data generation is important to training and evaluating neural
models for question answering over knowledge graphs. The quality of the data
and the partitioning of the datasets into training, validation and test splits
impact the performance of the models trained on this data. If the synthetic
data generation depends on templates, as is the predominant approach for this
task, there may be a leakage of information via a shared basis of templates
across data splits if the partitioning is not performed hygienically. This
paper investigates the extent of such information leakage across data splits,
and the ability of trained models to generalize to test data when the leakage
is controlled. We find that information leakage indeed occurs and that it
affects performance. At the same time, the trained models do generalize to test
data under the sanitized partitioning presented here. Importantly, these
findings extend beyond the particular flavor of question answering task we
studied and raise a series of difficult questions around template-based
synthetic data generation that will necessitate additional research.
","[{'version': 'v1', 'created': 'Thu, 10 Sep 2020 14:58:20 GMT'}]",2020-09-11,"[['Linjordet', 'Trond', ''], ['Balog', 'Krisztian', '']]","['Knowledge graph question answering', 'synthetic data', 'templatebased data generation', 'information leakage']"
8758,2006.02479,Fady Alajaji,"Himesh Bhatia, William Paul, Fady Alajaji, Bahman Gharesifard,
  Philippe Burlina",Least $k$th-Order and R\'{e}nyi Generative Adversarial Networks,,"Neural Computation (MIT Press), Vol 33, Issue 9, 2021",10.1162/neco_a_01416,,cs.LG cs.IT math.IT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the use of parametrized families of information-theoretic
measures to generalize the loss functions of generative adversarial networks
(GANs) with the objective of improving performance. A new generator loss
function, called least $k$th-order GAN (L$k$GAN), is first introduced,
generalizing the least squares GANs (LSGANs) by using a $k$th order absolute
error distortion measure with $k \geq 1$ (which recovers the LSGAN loss
function when $k=2$). It is shown that minimizing this generalized loss
function under an (unconstrained) optimal discriminator is equivalent to
minimizing the $k$th-order Pearson-Vajda divergence. Another novel GAN
generator loss function is next proposed in terms of R\'{e}nyi cross-entropy
functionals with order $\alpha >0$, $\alpha\neq 1$. It is demonstrated that
this R\'{e}nyi-centric generalized loss function, which provably reduces to the
original GAN loss function as $\alpha\to1$, preserves the equilibrium point
satisfied by the original GAN based on the Jensen-R\'{e}nyi divergence, a
natural extension of the Jensen-Shannon divergence.
  Experimental results indicate that the proposed loss functions, applied to
the MNIST and CelebA datasets, under both DCGAN and StyleGAN architectures,
confer performance benefits by virtue of the extra degrees of freedom provided
by the parameters $k$ and $\alpha$, respectively. More specifically,
experiments show improvements with regard to the quality of the generated
images as measured by the Fr\'echet Inception Distance (FID) score and training
stability. While it was applied to GANs in this study, the proposed approach is
generic and can be used in other applications of information theory to deep
learning, e.g., the issues of fairness or privacy in artificial intelligence.
","[{'version': 'v1', 'created': 'Wed, 3 Jun 2020 18:44:05 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Dec 2020 03:20:35 GMT'}, {'version': 'v3', 'created': 'Thu, 11 Mar 2021 23:37:47 GMT'}]",2021-08-12,"[['Bhatia', 'Himesh', ''], ['Paul', 'William', ''], ['Alajaji', 'Fady', ''], ['Gharesifard', 'Bahman', ''], ['Burlina', 'Philippe', '']]","['Deep learning', 'generative adversarial networks', 'R´enyi cross-entropy', 'Jensen-R´enyi divergence', 'PearsonVajda divergence']"
8759,1708.04321,Surya Prasath,"V. B. Surya Prasath, Haneen Arafat Abu Alfeilat, Ahmad B. A. Hassanat,
  Omar Lasassmeh, Ahmad S. Tarawneh, Mahmoud Bashir Alhasanat, Hamzeh S. Eyal
  Salman","Distance and Similarity Measures Effect on the Performance of K-Nearest
  Neighbor Classifier -- A Review","39 pages, 6 figures, 17 tables, revised text and added extra
  experiments",,10.1089/big.2018.0175,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The K-nearest neighbor (KNN) classifier is one of the simplest and most
common classifiers, yet its performance competes with the most complex
classifiers in the literature. The core of this classifier depends mainly on
measuring the distance or similarity between the tested examples and the
training examples. This raises a major question about which distance measures
to be used for the KNN classifier among a large number of distance and
similarity measures available? This review attempts to answer this question
through evaluating the performance (measured by accuracy, precision and recall)
of the KNN using a large number of distance measures, tested on a number of
real-world datasets, with and without adding different levels of noise. The
experimental results show that the performance of KNN classifier depends
significantly on the distance used, and the results showed large gaps between
the performances of different distances. We found that a recently proposed
non-convex distance performed the best when applied on most datasets comparing
to the other tested distances. In addition, the performance of the KNN with
this top performing distance degraded only about $20\%$ while the noise level
reaches $90\%$, this is true for most of the distances used as well. This means
that the KNN classifier using any of the top $10$ distances tolerate noise to a
certain degree. Moreover, the results show that some distances are less
affected by the added noise comparing to other distances.
","[{'version': 'v1', 'created': 'Mon, 14 Aug 2017 20:52:35 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Jun 2019 19:58:50 GMT'}, {'version': 'v3', 'created': 'Sun, 29 Sep 2019 16:27:25 GMT'}]",2019-10-01,"[['Prasath', 'V. B. Surya', ''], ['Alfeilat', 'Haneen Arafat Abu', ''], ['Hassanat', 'Ahmad B. A.', ''], ['Lasassmeh', 'Omar', ''], ['Tarawneh', 'Ahmad S.', ''], ['Alhasanat', 'Mahmoud Bashir', ''], ['Salman', 'Hamzeh S. Eyal', '']]","['K-nearest neighbor', 'big data', 'machine learning', 'noise', 'supervised learning']"
8760,2209.00126,Sergi Abadal,"Santiago Rodrigo, Domenico Span\`o, Medina Bandic, Sergi Abadal, Hans
  van Someren, Anabel Ovide, Sebastian Feld, Carmen G. Almudever, Eduard
  Alarc\'on","Characterizing Qubit Traffic of a Quantum Intranet aiming at Modular
  Quantum Computers","7 pages, to be presented at the ACM NanoCom 2022",,10.1145/3558583.3558846,,cs.ET cs.AR quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quantum many-core processors are envisioned as the ultimate solution for the
scalability of quantum computers. Based upon Noisy Intermediate-Scale Quantum
(NISQ) chips interconnected in a sort of quantum intranet, they enable large
algorithms to be executed on current and close future technology. In order to
optimize such architectures, it is crucial to develop tools that allow specific
design space explorations. To this aim, in this paper we present a technique to
perform a spatio-temporal characterization of quantum circuits running in
multi-chip quantum computers. Specifically, we focus on the analysis of the
qubit traffic resulting from operations that involve qubits residing in
different cores, and hence quantum communication across chips, while also
giving importance to the amount of intra-core operations that occur in between
those communications. Using specific multi-core performance metrics and a
complete set of benchmarks, our analysis showcases the opportunities that the
proposed approach may provide to guide the design of multi-core quantum
computers and their interconnects.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2022 21:33:17 GMT'}]",2022-09-02,"[['Rodrigo', 'Santiago', ''], ['Spanò', 'Domenico', ''], ['Bandic', 'Medina', ''], ['Abadal', 'Sergi', ''], ['van Someren', 'Hans', ''], ['Ovide', 'Anabel', ''], ['Feld', 'Sebastian', ''], ['Almudever', 'Carmen G.', ''], ['Alarcón', 'Eduard', '']]","['Quantum Computing', 'Multicore Quantum Architectures', 'TrafficCharacterization', 'Network Performance Analysis', 'Network-onChip']"
8761,2011.11358,Alastair Finlinson Mr,"Alastair Finlinson, Sotiris Moschoyiannis","Synthesis and Pruning as a Dynamic Compression Strategy for Efficient
  Deep Neural Networks","29TH ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE
  MANAGEMENT, 9th International Symposium DATAMOD 2020 FROM DATA TO MODELS AND
  BACK, 16 Pages, 7 Figures, 3 Tables, 2 Equations",,10.1007/978-3-030-70650-0_1,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The brain is a highly reconfigurable machine capable of task-specific
adaptations. The brain continually rewires itself for a more optimal
configuration to solve problems. We propose a novel strategic synthesis
algorithm for feedforward networks that draws directly from the brain's
behaviours when learning. The proposed approach analyses the network and ranks
weights based on their magnitude. Unlike existing approaches that advocate
random selection, we select highly performing nodes as starting points for new
edges and exploit the Gaussian distribution over the weights to select
corresponding endpoints. The strategy aims only to produce useful connections
and result in a smaller residual network structure. The approach is
complemented with pruning to further the compression. We demonstrate the
techniques to deep feedforward networks. The residual sub-networks that are
formed from the synthesis approaches in this work form common sub-networks with
similarities up to ~90%. Using pruning as a complement to the strategic
synthesis approach, we observe improvements in compression.
","[{'version': 'v1', 'created': 'Mon, 23 Nov 2020 12:30:57 GMT'}]",2021-04-22,"[['Finlinson', 'Alastair', ''], ['Moschoyiannis', 'Sotiris', '']]","['Sub-Network', 'Optimisation', 'Compression', 'Pruning', 'Synthesis']"
8762,2006.00446,Ehsan Haghighat,"Ehsan Haghighat, Ali Can Bekar, Erdogan Madenci, Ruben Juanes","A nonlocal physics-informed deep learning framework using the
  peridynamic differential operator",,,10.1016/j.cma.2021.114012,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Physics-Informed Neural Network (PINN) framework introduced recently
incorporates physics into deep learning, and offers a promising avenue for the
solution of partial differential equations (PDEs) as well as identification of
the equation parameters. The performance of existing PINN approaches, however,
may degrade in the presence of sharp gradients, as a result of the inability of
the network to capture the solution behavior globally. We posit that this
shortcoming may be remedied by introducing long-range (nonlocal) interactions
into the network's input, in addition to the short-range (local) space and time
variables. Following this ansatz, here we develop a nonlocal PINN approach
using the Peridynamic Differential Operator (PDDO)---a numerical method which
incorporates long-range interactions and removes spatial derivatives in the
governing equations. Because the PDDO functions can be readily incorporated in
the neural network architecture, the nonlocality does not degrade the
performance of modern deep-learning algorithms. We apply nonlocal PDDO-PINN to
the solution and identification of material parameters in solid mechanics and,
specifically, to elastoplastic deformation in a domain subjected to indentation
by a rigid punch, for which the mixed displacement--traction boundary condition
leads to localized deformation and sharp gradients in the solution. We document
the superior behavior of nonlocal PINN with respect to local PINN in both
solution accuracy and parameter inference, illustrating its potential for
simulation and discovery of partial differential equations whose solution
develops sharp gradients.
","[{'version': 'v1', 'created': 'Sun, 31 May 2020 06:26:21 GMT'}]",2021-08-04,"[['Haghighat', 'Ehsan', ''], ['Bekar', 'Ali Can', ''], ['Madenci', 'Erdogan', ''], ['Juanes', 'Ruben', '']]","['Deep learning', 'Peridynamic Differential Operator', 'Physics-Informed NeuralNetworks', 'Surrogate Models']"
8763,2008.11689,Yanyu Zhang,"Yanyu Zhang, Osama Alshaykh",5G Utility Pole Planner Using Google Street View and Mask R-CNN,"4 pages, 7 figures","2020 IEEE International Conference on Electro Information
  Technology (EIT)",10.1109/EIT48999.2020.9208333,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the advances of fifth-generation (5G) cellular networks technology, many
studies and work have been carried out on how to build 5G networks for smart
cities. In the previous research, street lighting poles and smart light poles
are capable of being a 5G access point. In order to determine the position of
the points, this paper discusses a new way to identify poles based on Mask
R-CNN, which extends Fast R-CNNs by making it employ recursive Bayesian
filtering and perform proposal propagation and reuse. The dataset contains
3,000 high-resolution images from google map. To make training faster, we used
a very efficient GPU implementation of the convolution operation. We achieved a
train error rate of 7.86% and a test error rate of 32.03%. At last, we used the
immune algorithm to set 5G poles in the smart cities.
","[{'version': 'v1', 'created': 'Wed, 26 Aug 2020 17:27:52 GMT'}]",2020-10-05,"[['Zhang', 'Yanyu', ''], ['Alshaykh', 'Osama', '']]","['5G', 'Mask R-CNN', 'immune algorithm', 'google']"
8764,1912.08590,Kushagra Singh,"Kushagra Singh, Gurshabad Grover, and Varun Bansal",How India Censors the Web,,,10.1145/3394231.3397891,,cs.NI cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the primary ways in which India engages in online censorship is by
ordering Internet Service Providers (ISPs) operating in its jurisdiction to
block access to certain websites for its users. This paper reports the
different techniques Indian ISPs are using to censor websites, and investigates
whether website blocklists are consistent across ISPs. We propose a suite of
tests that prove more robust than previous work in detecting DNS and HTTP based
censorship. Our tests also discern the use of SNI inspection for blocking
websites, which is previously undocumented in the Indian context. Using
information from court orders, user reports, and public and leaked government
orders, we compile the largest known list of potentially blocked websites in
India. We pass this list to our tests and run them from connections of six
different ISPs, which together serve more than 98% of Internet users in India.
Our findings not only confirm that ISPs are using different techniques to block
websites, but also demonstrate that different ISPs are not blocking the same
websites.
","[{'version': 'v1', 'created': 'Wed, 18 Dec 2019 13:32:53 GMT'}, {'version': 'v2', 'created': 'Sat, 30 May 2020 12:31:39 GMT'}]",2020-06-02,"[['Singh', 'Kushagra', ''], ['Grover', 'Gurshabad', ''], ['Bansal', 'Varun', '']]","['Internet Censorship Analysis', 'Internet Service Providers', 'India']"
8765,2101.08717,Jacson Rodrigues Correia-Silva,"Jacson Rodrigues Correia-Silva, Rodrigo F. Berriel, Claudine Badue,
  Alberto F. De Souza, Thiago Oliveira-Santos","Copycat CNN: Are Random Non-Labeled Data Enough to Steal Knowledge from
  Black-box Models?",The code is available at https://github.com/jeiks/Stealing_DL_Models,Pattern Recognition 113 (2021) 107830,10.1016/j.patcog.2021.107830,,cs.CR cs.CV cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Convolutional neural networks have been successful lately enabling companies
to develop neural-based products, which demand an expensive process, involving
data acquisition and annotation; and model generation, usually requiring
experts. With all these costs, companies are concerned about the security of
their models against copies and deliver them as black-boxes accessed by APIs.
Nonetheless, we argue that even black-box models still have some
vulnerabilities. In a preliminary work, we presented a simple, yet powerful,
method to copy black-box models by querying them with natural random images. In
this work, we consolidate and extend the copycat method: (i) some constraints
are waived; (ii) an extensive evaluation with several problems is performed;
(iii) models are copied between different architectures; and, (iv) a deeper
analysis is performed by looking at the copycat behavior. Results show that
natural random images are effective to generate copycats for several problems.
","[{'version': 'v1', 'created': 'Thu, 21 Jan 2021 16:55:14 GMT'}]",2021-01-22,"[['Correia-Silva', 'Jacson Rodrigues', ''], ['Berriel', 'Rodrigo F.', ''], ['Badue', 'Claudine', ''], ['De Souza', 'Alberto F.', ''], ['Oliveira-Santos', 'Thiago', '']]","['deep learning', 'convolutional neural network', 'neural network attack', 'stealing network']"
8766,2106.04337,Damien Chablat,"Huiping Shen, Yinan Zhao, Ju Li, Guanglei Wu, Damien Chablat (ReV,
  LS2N)","A novel partially-decoupled translational parallel manipulator with
  symbolic kinematics, singularity identification and workspace determination",,"Mechanism and Machine Theory, Elsevier, 2021, 164, pp.104388",10.1016/j.mechmachtheory.2021.104388,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel three-degree-of-freedom (3-DOF) translational
parallel manipulator (TPM) by using a topological design method of parallel
mechanism (PM) based on position and orientation characteristic (POC)
equations. The proposed PM is only composed of lower-mobility joints and
actuated prismatic joints, together with the investigations on three kinematic
issues of importance. The first aspect pertains to geometric modeling of the
TPM in connection with its topological characteristics, such as the POC, degree
of freedom and coupling degree, from which its symbolic direct kinematic
solutions are readily obtained. Moreover, the decoupled properties of
input-output motions are directly evaluated without Jacobian analysis.
Sequentially, based upon the inverse kinematics, the singular configurations of
the TPM are identified, wherein the singular surfaces are visualized by means
of a Gr{\""o}bner based elimination operation. Finally, the workspace of the TPM
is evaluated with a geometric approach. This 3-DOF TPM features less joints and
links compared with the well-known Delta robot, which reduces the structural
complexity. Its symbolic direct kinematics and partially-decoupled property
will ease path planning and dynamic analysis. The TPM can be used for
manufacturing large work pieces.
","[{'version': 'v1', 'created': 'Tue, 8 Jun 2021 13:54:18 GMT'}]",2021-06-09,"[['Shen', 'Huiping', '', 'ReV,\n  LS2N'], ['Zhao', 'Yinan', '', 'ReV,\n  LS2N'], ['Li', 'Ju', '', 'ReV,\n  LS2N'], ['Wu', 'Guanglei', '', 'ReV,\n  LS2N'], ['Chablat', 'Damien', '', 'ReV,\n  LS2N']]","['Topological Design', 'Symbolic Kinematics', 'Parallel manipulator', 'Singularity', 'Workspace analysis']"
8767,1708.02694,Chaitanya Prakash Bapat,"S. Kolkur, D. Kalbande, P. Shimpi, C. Bapat, and J. Jatakia","Human Skin Detection Using RGB, HSV and YCbCr Color Models","ICCASP/ICMMD-2016. Published by Atlantic Press. Part of series: AISR
  ISBN: 978-94-6252-305-0 ISSN: 1951-6851",,10.2991/iccasp-16.2017.51,,cs.CV q-bio.OT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human Skin detection deals with the recognition of skin-colored pixels and
regions in a given image. Skin color is often used in human skin detection
because it is invariant to orientation and size and is fast to process. A new
human skin detection algorithm is proposed in this paper. The three main
parameters for recognizing a skin pixel are RGB (Red, Green, Blue), HSV (Hue,
Saturation, Value) and YCbCr (Luminance, Chrominance) color models. The
objective of proposed algorithm is to improve the recognition of skin pixels in
given images. The algorithm not only considers individual ranges of the three
color parameters but also takes into ac- count combinational ranges which
provide greater accuracy in recognizing the skin area in a given image.
","[{'version': 'v1', 'created': 'Wed, 9 Aug 2017 02:08:29 GMT'}]",2017-08-15,"[['Kolkur', 'S.', ''], ['Kalbande', 'D.', ''], ['Shimpi', 'P.', ''], ['Bapat', 'C.', ''], ['Jatakia', 'J.', '']]","['Skin Detection', 'Color Models', 'Image Processing', 'Classifier']"
8768,1602.07349,Tomaso Aste,"Wolfram Barfuss, Guido Previde Massara, T. Di Matteo, Tomaso Aste",Parsimonious modeling with Information Filtering Networks,"17 pages, 10 figures, 3 tables","Phys. Rev. E 94, 062306 (2016)",10.1103/PhysRevE.94.062306,,cs.IT math.IT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a methodology to construct parsimonious probabilistic models.
This method makes use of Information Filtering Networks to produce a robust
estimate of the global sparse inverse covariance from a simple sum of local
inverse covariances computed on small sub-parts of the network. Being based on
local and low-dimensional inversions, this method is computationally very
efficient and statistically robust even for the estimation of inverse
covariance of high-dimensional, noisy and short time-series. Applied to
financial data our method results computationally more efficient than
state-of-the-art methodologies such as Glasso producing, in a fraction of the
computation time, models that can have equivalent or better performances but
with a sparser inference structure. We also discuss performances with sparse
factor models where we notice that relative performances decrease with the
number of factors. The local nature of this approach allows us to perform
computations in parallel and provides a tool for dynamical adaptation by
partial updating when the properties of some variables change without the need
of recomputing the whole model. This makes this approach particularly suitable
to handle big datasets with large numbers of variables. Examples of practical
application for forecasting, stress testing and risk allocation in financial
systems are also provided.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2016 23:03:56 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Jun 2016 15:11:14 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Nov 2016 15:32:05 GMT'}]",2017-02-21,"[['Barfuss', 'Wolfram', ''], ['Massara', 'Guido Previde', ''], ['Di Matteo', 'T.', ''], ['Aste', 'Tomaso', '']]","['complex systems', 'econophysics', 'information filtering', 'sparse inverse covariance', 'probabilistic modelling', 'graphical modelling', 'Glasso']"
8769,2004.11784,Dahlia Urbach,"Dahlia Urbach, Yizhak Ben-Shabat, Michael Lindenbaum",DPDist : Comparing Point Clouds Using Deep Point Cloud Distance,,,10.1007/978-3-030-58621-8_32,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a new deep learning method for point cloud comparison. Our
approach, named Deep Point Cloud Distance (DPDist), measures the distance
between the points in one cloud and the estimated surface from which the other
point cloud is sampled. The surface is estimated locally and efficiently using
the 3D modified Fisher vector representation. The local representation reduces
the complexity of the surface, enabling efficient and effective learning, which
generalizes well between object categories. We test the proposed distance in
challenging tasks, such as similar object comparison and registration, and show
that it provides significant improvements over commonly used distances such as
Chamfer distance, Earth mover's distance, and others.
","[{'version': 'v1', 'created': 'Fri, 24 Apr 2020 14:47:44 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Jul 2020 07:46:09 GMT'}]",2021-04-13,"[['Urbach', 'Dahlia', ''], ['Ben-Shabat', 'Yizhak', ''], ['Lindenbaum', 'Michael', '']]","['3D Point Clouds', '3D Computer Vision', '3D Deep Learning', 'Distance', 'Registration']"
8770,2212.02918,Mohan Liyanage,"Farooq Dar, Hilary Emenike, Zhigang Yin, Mohan Liyanage, Rajesh
  Sharma, Agustin Zuniga, Mohammad A. Hoque, Marko Radeta, Petteri Nurmi, Huber
  Flores","Thermal Dissipation Resulting from Everyday Interactions as a Sensing
  Modality -- The MIDAS Touch",,"Pervasive and Mobile Computing, Volume 84, 2022",10.1016/j.pmcj.2022.101625,,cs.DC cs.HC eess.SP,http://creativecommons.org/licenses/by/4.0/,"  We contribute MIDAS as a novel sensing solution for characterizing everyday
objects using thermal dissipation. MIDAS takes advantage of the fact that
anytime a person touches an object it results in heat transfer. By capturing
and modeling the dissipation of the transferred heat, e.g., through the
decrease in the captured thermal radiation, MIDAS can characterize the object
and determine its material. We validate MIDAS through extensive empirical
benchmarks and demonstrate that MIDAS offers an innovative sensing modality
that can recognize a wide range of materials with up to 83% accuracy and
generalize to variations in the people interacting with objects. We also
demonstrate that MIDAS can detect thermal dissipation through objects, up to 2
mm thickness, and support analysis of multiple objects that are interacted with
","[{'version': 'v1', 'created': 'Tue, 6 Dec 2022 12:18:24 GMT'}]",2022-12-07,"[['Dar', 'Farooq', ''], ['Emenike', 'Hilary', ''], ['Yin', 'Zhigang', ''], ['Liyanage', 'Mohan', ''], ['Sharma', 'Rajesh', ''], ['Zuniga', 'Agustin', ''], ['Hoque', 'Mohammad A.', ''], ['Radeta', 'Marko', ''], ['Nurmi', 'Petteri', ''], ['Flores', 'Huber', '']]","['thermal imaging', 'mobile computing', 'pervasive computing', 'IoT', 'materialdetection', 'thermal dissipation', 'sensing']"
8771,2210.11910,Jalves Nicacio,Jalves Nicacio and Fabio Petrillo,"An Approach to Build Consistent Software Architecture Diagrams Using
  Devops System Descriptors","Accepted to ACM/IEEE 25th International Conference on Model Driven
  Engineering Languages and Systems (Models 2022)",,10.1145/3550356.3561567,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  System architecture diagrams play an essential role in understanding system
architecture. They encourage more active discussion among participants and make
it easier to recall system details. However, system architecture diagrams often
diverge from the software. As a result, they can interfere with the
understanding and maintenance of the software. We propose an approach to build
system architecture diagrams using DevOps system descriptors to improve the
consistency of architecture diagrams. To produce our approach, we survey
problems with architecture diagrams in the software industry, developing
guidelines for creating architecture diagrams. Next, we produce a taxonomy for
system descriptor concepts and a process to convert system descriptors into
architecture diagrams. We evaluate our approach through a case study. In this
case study, we defined a Docker Compose descriptor for a newsfeed system and
transformed it into a system architectural diagram using the proposed approach.
Our results indicate that, currently, system descriptors generally lead to
consistent diagrams only to a limited extent. However, the case study's
observations indicate that the proposed approach is promising and demonstrates
that system descriptors have the potential to create more consistent
architectural diagrams. Further evaluation in controlled and empirical
experiments is necessary to test our hypothesis in more detail.
","[{'version': 'v1', 'created': 'Fri, 21 Oct 2022 12:19:03 GMT'}]",2022-10-24,"[['Nicacio', 'Jalves', ''], ['Petrillo', 'Fabio', '']]","['Architectural diagram consistency', 'Systemarchitecture', 'System descriptors', 'Modelling process', 'Software Systems', 'Software Architecture', 'Software Engineering']"
8772,1605.04180,Drahomira Herrmannova,Drahomira Herrmannova and Petr Knoth,Semantometrics: Towards Fulltext-based Research Evaluation,"16th ACM/IEEE-CS Joint Conference on Digital Libraries, Newark, NJ,
  USA, June 19-23 2016",,10.1145/2910896.2925448,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the recent years, there has been a growing interest in developing new
research evaluation methods that could go beyond the traditional citation-based
metrics. This interest is motivated on one side by the wider availability or
even emergence of new information evidencing research performance, such as
article downloads, views and Twitter mentions, and on the other side by the
continued frustrations and problems surrounding the application of purely
citation-based metrics to evaluate research performance in practice.
Semantometrics are a new class of research evaluation metrics which build on
the premise that full-text is needed to assess the value of a publication. This
paper reports on the analysis carried out with the aim to investigate the
properties of the semantometric contribution measure, which uses semantic
similarity of publications to estimate research contribution, and provides a
comparative study of the contribution measure with traditional bibliometric
measures based on citation counting.
","[{'version': 'v1', 'created': 'Fri, 13 May 2016 13:55:42 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Nov 2016 11:26:02 GMT'}]",2016-11-17,"[['Herrmannova', 'Drahomira', ''], ['Knoth', 'Petr', '']]","['Research Evaluation', 'Citation Analysis', 'Text Mining']"
8773,1911.00763,Jun Zhao,Jun Zhao,Composition Properties of Bayesian Differential Privacy,"Published in: 2017 IEEE 28th Annual International Symposium on
  Personal, Indoor, and Mobile Radio Communications (PIMRC)",,10.1109/PIMRC.2017.8292647,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Differential privacy is a rigorous privacy standard that has been applied to
a range of data analysis tasks. To broaden the application scenarios of
differential privacy when data records have dependencies, the notion of
Bayesian differential privacy has been recently proposed. However, it is
unknown whether Bayesian differential privacy preserves three nice properties
of differential privacy: sequential composability, parallel composability, and
post-processing. In this paper, we provide an affirmative answer to this
question; i.e., Bayesian differential privacy still have these properties. The
idea behind sequential composability is that if we have $m$ algorithms $Y_1,
Y_2, \ldots, Y_m$, where $Y_{\ell}$ is independently $\epsilon_{\ell}$-Bayesian
differential private for ${\ell}=1,2,\ldots,m$, then by feeding the result of
$Y_1$ into $Y_2$, the result of $Y_2$ into $Y_3$, and so on, we will finally
have an $\sum_{\ell=1}^m \epsilon_{\ell}$-Bayesian differential private
algorithm. For parallel composability, we consider the situation where a
database is partitioned into $m$ disjoint subsets. The $\ell$-th subset is
input to a Bayesian differential private algorithm $Y_{\ell}$, for
${\ell}=1,2,\ldots,m$. Then the parallel composition of $Y_1$, $Y_2$, $\ldots$,
$Y_m$ will be $\max_{\ell=1}^m \epsilon_{\ell}$-Bayesian differential private.
The post-processing property means that a data analyst, without additional
knowledge about the private database, cannot compute a function of the output
of a Bayesian differential private algorithm and reduce its privacy guarantee.
","[{'version': 'v1', 'created': 'Sat, 2 Nov 2019 18:24:13 GMT'}]",2019-11-05,"[['Zhao', 'Jun', '']]","['Differential privacy', 'Bayesian differentialprivacy', 'sequential composability', 'parallel composability', 'andpost-processing']"
8774,2207.13843,Devesh Khandelwal,"Devesh Khandelwal, Sean Campos, Shwetha Nagaraj, Fred Nugen, Alberto
  Todeschini","Deep Learning-Based Acoustic Mosquito Detection in Noisy Conditions
  Using Trainable Kernels and Augmentations",,,10.1145/3503161.3551586,,cs.SD cs.LG eess.AS,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we demonstrate a unique recipe to enhance the effectiveness of
audio machine learning approaches by fusing pre-processing techniques into a
deep learning model. Our solution accelerates training and inference
performance by optimizing hyper-parameters through training instead of costly
random searches to build a reliable mosquito detector from audio signals. The
experiments and the results presented here are part of the MOS C submission of
the ACM 2022 challenge. Our results outperform the published baseline by 212%
on the unpublished test set. We believe that this is one of the best real-world
examples of building a robust bio-acoustic system that provides reliable
mosquito detection in noisy conditions.
","[{'version': 'v1', 'created': 'Thu, 28 Jul 2022 01:05:40 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Aug 2022 20:24:47 GMT'}]",2022-08-22,"[['Khandelwal', 'Devesh', ''], ['Campos', 'Sean', ''], ['Nagaraj', 'Shwetha', ''], ['Nugen', 'Fred', ''], ['Todeschini', 'Alberto', '']]","['neural networks', 'bio acoustics', 'mosquito event detection']"
8775,2104.10033,Manh Duong Phung,Manh Duong Phung and Quang Phuc Ha,"Safety-enhanced UAV Path Planning with Spherical Vector-based Particle
  Swarm Optimization",,"Applied Soft Computing, Volume 107, August 2021, 107376",10.1016/j.asoc.2021.107376,,cs.NE cs.AI cs.RO cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new algorithm named spherical vector-based particle
swarm optimization (SPSO) to deal with the problem of path planning for
unmanned aerial vehicles (UAVs) in complicated environments subjected to
multiple threats. A cost function is first formulated to convert the path
planning into an optimization problem that incorporates requirements and
constraints for the feasible and safe operation of the UAV. SPSO is then used
to find the optimal path that minimizes the cost function by efficiently
searching the configuration space of the UAV via the correspondence between the
particle position and the speed, turn angle and climb/dive angle of the UAV. To
evaluate the performance of SPSO, eight benchmarking scenarios have been
generated from real digital elevation model maps. The results show that the
proposed SPSO outperforms not only other particle swarm optimization (PSO)
variants including the classic PSO, phase angle-encoded PSO and quantum-behave
PSO but also other state-of-the-art metaheuristic optimization algorithms
including the genetic algorithm (GA), artificial bee colony (ABC), and
differential evolution (DE) in most scenarios. In addition, experiments have
been conducted to demonstrate the validity of the generated paths for real UAV
operations. Source code of the algorithm can be found at
https://github.com/duongpm/SPSO.
","[{'version': 'v1', 'created': 'Tue, 13 Apr 2021 06:45:11 GMT'}]",2021-04-21,"[['Phung', 'Manh Duong', ''], ['Ha', 'Quang Phuc', '']]","['Path planning', 'Particle swarm optimization', 'UAV']"
8776,1306.5960,Shofwatul Uyun Mrs,"Sri Hartati, Shofwatul 'Uyun","Computation of Diet Composition for Patients Suffering from Kidney and
  Urinary Tract Diseases with the Fuzzy Genetic System",8 pages,"International Journal of Computer Applications (0975-8887)-Volume
  36, No.6, December 2011",10.5120/4499-6350,,cs.AI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Determination of dietary food consumed a day for patients with diseases in
general, greatly affect the health of the body and the healing process, is no
exception for people with kidney disease and urinary tract. This paper presents
the determination of diet composition in the form of food subtance for people
with kidney and urinary tract diseases with a genetic fuzzy approach. This
approach combines fuzzy logic and genetic algorithms, which utilizing fuzzy
logic fuzzy tools and techniques to model the components of the genetic
algorithm and adapting genetic algorithm control parameters, with the aim of
improving system performance. The Mamdani fuzzy inference model and fuzzy rules
based on population parameters and generation are used to determine the
probability of crossover and mutation, and was using In this study, 400 food
survey data along with their substances was used as test material. From the
data, a varying amount of population is established. Each chromosome has 10
genes in which the value of each gene indicates the index number of foodstuffs
in the database. The fuzzy genetic approach produces 10 best food substance and
their compositions. The composition of these foods has nutritional value in
accordance with the number of calories needed by people with kidney and urinary
tract diseases by type of food.
","[{'version': 'v1', 'created': 'Tue, 25 Jun 2013 13:43:27 GMT'}]",2013-06-26,"[['Hartati', 'Sri', ''], [""'Uyun"", 'Shofwatul', '']]","['genetic algorithm', 'fuzzy logic', 'fuzzy genetic', 'diet', 'kidney disease', 'urinary tract']"
8777,1802.03549,Florian Adriaens,"Florian Adriaens, Tijl De Bie, Aristides Gionis, Jefrey Lijffijt,
  Polina Rozenshtein","From acquaintance to best friend forever: robust and fine-grained
  inference of social tie strengths",,Data Min. Knowl. Discov. 34(3): 611-651 (2020),10.1007/s10618-020-00673-0,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social networks often provide only a binary perspective on social ties: two
individuals are either connected or not. While sometimes external information
can be used to infer the strength of social ties, access to such information
may be restricted or impractical. Sintos and Tsaparas (KDD 2014) first
suggested to infer the strength of social ties from the topology of the network
alone, by leveraging the Strong Triadic Closure (STC) property. The STC
property states that if person A has strong social ties with persons B and C, B
and C must be connected to each other as well (whether with a weak or strong
tie). Sintos and Tsaparas exploited this to formulate the inference of the
strength of social ties as NP-hard optimization problem, and proposed two
approximation algorithms. We refine and improve upon this landmark paper, by
developing a sequence of linear relaxations of this problem that can be solved
exactly in polynomial time. Usefully, these relaxations infer more fine-grained
levels of tie strength (beyond strong and weak), which also allows to avoid
making arbitrary strong/weak strength assignments when the network topology
provides inconclusive evidence. One of the relaxations simultaneously infers
the presence of a limited number of STC violations. An extensive theoretical
analysis leads to two efficient algorithmic approaches. Finally, our
experimental results elucidate the strengths of the proposed approach, and
sheds new light on the validity of the STC property in practice.
","[{'version': 'v1', 'created': 'Sat, 10 Feb 2018 08:52:54 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jun 2018 09:51:57 GMT'}, {'version': 'v3', 'created': 'Tue, 18 Sep 2018 13:47:59 GMT'}]",2021-11-08,"[['Adriaens', 'Florian', ''], ['De Bie', 'Tijl', ''], ['Gionis', 'Aristides', ''], ['Lijffijt', 'Jefrey', ''], ['Rozenshtein', 'Polina', '']]","['Strong Triadic Closure', 'strength of social ties', 'Linear Programming', 'convex relaxations', 'half-integrality']"
8778,1710.08737,Eric Kerrigan,"Bulat Khusainov, Eric C. Kerrigan, Andrea Suardi, George A.
  Constantinides",Nonlinear Predictive Control on a Heterogeneous Computing Platform,,"Control Engineering Practice, Volume 78, September 2018, Pages
  105-115",10.1016/j.conengprac.2018.06.016,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an implementation of an interior-point-based nonlinear predictive
controller on a heterogeneous processor. The workload can be split between a
general-purpose CPU and a field-programmable gate array to trade off the
contradicting design objectives of control performance and computational
resource usage. A new way of exploiting the structure of the KKT matrix yields
significant memory savings. We report an 18x memory saving, compared to
existing approaches, and a 36x speedup over a software implementation with an
ARM Cortex-A9 processor. We also introduce a new release of Protoip, which
abstracts low-level details of heterogeneous programming and allows
processor-in-the-loop verification.
","[{'version': 'v1', 'created': 'Tue, 24 Oct 2017 12:39:37 GMT'}]",2018-07-11,"[['Khusainov', 'Bulat', ''], ['Kerrigan', 'Eric C.', ''], ['Suardi', 'Andrea', ''], ['Constantinides', 'George A.', '']]","['Predictive control', 'Hardware-software co-design', 'Scheduling; FPGA; Optimizationbased control']"
8779,2110.09755,Sascha El-Sharkawy,"Sascha El-Sharkawy, Adam Krafczyk, Klaus Schmid","MetricHaven -- More Than 23,000 Metrics for Measuring Quality Attributes
  of Software Product Lines",,"Proceedings of the 23rd International Systems and Software Product
  Line Conference (SPLC '19) - Volume B, 2019, pages 25-28",10.1145/3307630.3342384,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Variability-aware metrics are designed to measure qualitative aspects of
software product lines. As we identified in a prior SLR
\cite{El-SharkawyYamagishi-EichlerSchmid19}, there exist already many metrics
that address code or variability separately, while the combination of both has
been less researched. MetricHaven fills this gap, as it extensively supports
combining information from code files and variability models. Further, we also
enable the combination of well established single system metrics with novel
variability-aware metrics, going beyond existing variability-aware metrics. Our
tool supports most prominent single system and variability-aware code metrics.
We provide configuration support for already implemented metrics, resulting in
23,342 metric variations. Further, we present an abstract syntax tree developed
for MetricHaven, that allows the realization of additional code metrics.
  Tool: https://github.com/KernelHaven/MetricHaven
  Video: https://youtu.be/vPEmD5Sr6gM
","[{'version': 'v1', 'created': 'Tue, 19 Oct 2021 06:08:54 GMT'}]",2021-10-20,"[['El-Sharkawy', 'Sascha', ''], ['Krafczyk', 'Adam', ''], ['Schmid', 'Klaus', '']]","['Software Product Lines', 'SPL', 'Metrics', 'Implementation', 'VariabilityModels', 'Feature Models']"
8780,1807.09413,Zi Jian Yew,Zi Jian Yew and Gim Hee Lee,"3DFeat-Net: Weakly Supervised Local 3D Features for Point Cloud
  Registration","17 pages, 6 figures. Accepted in ECCV 2018",,10.1007/978-3-030-01267-0_37,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose the 3DFeat-Net which learns both 3D feature
detector and descriptor for point cloud matching using weak supervision. Unlike
many existing works, we do not require manual annotation of matching point
clusters. Instead, we leverage on alignment and attention mechanisms to learn
feature correspondences from GPS/INS tagged 3D point clouds without explicitly
specifying them. We create training and benchmark outdoor Lidar datasets, and
experiments show that 3DFeat-Net obtains state-of-the-art performance on these
gravity-aligned datasets.
","[{'version': 'v1', 'created': 'Wed, 25 Jul 2018 01:56:21 GMT'}]",2020-03-31,"[['Yew', 'Zi Jian', ''], ['Lee', 'Gim Hee', '']]","['point cloud', 'registration', 'deep learning', 'weak supervision']"
8781,1907.05146,Mathias Kraus,Mathias Kraus and Stefan Feuerriegel,"Forecasting remaining useful life: Interpretable deep learning approach
  via variational Bayesian inferences",,,10.1016/j.dss.2019.113100,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predicting the remaining useful life of machinery, infrastructure, or other
equipment can facilitate preemptive maintenance decisions, whereby a failure is
prevented through timely repair or replacement. This allows for a better
decision support by considering the anticipated time-to-failure and thus
promises to reduce costs. Here a common baseline may be derived by fitting a
probability density function to past lifetimes and then utilizing the
(conditional) expected remaining useful life as a prognostic. This approach
finds widespread use in practice because of its high explanatory power. A more
accurate alternative is promised by machine learning, where forecasts
incorporate deterioration processes and environmental variables through sensor
data. However, machine learning largely functions as a black-box method and its
forecasts thus forfeit most of the desired interpretability. As our primary
contribution, we propose a structured-effect neural network for predicting the
remaining useful life which combines the favorable properties of both
approaches: its key innovation is that it offers both a high accountability and
the flexibility of deep learning. The parameters are estimated via variational
Bayesian inferences. The different approaches are compared based on the actual
time-to-failure for aircraft engines. This demonstrates the performance and
superior interpretability of our method, while we finally discuss implications
for decision support.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2019 12:33:45 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Jul 2019 14:46:08 GMT'}]",2019-07-22,"[['Kraus', 'Mathias', ''], ['Feuerriegel', 'Stefan', '']]","['Forecasting', 'Remaining useful life', 'Machine learning', 'Neural networks', 'Deep learning']"
8782,1604.03306,Wengu Chen,Wengu Chen and Huanmin Ge,A sharp bound on RIC in generalized orthogonal matching pursuit,21 pages,Can. Math. Bull. 61 (2018) 40-54,10.4153/CMB-2017-009-6,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generalized orthogonal matching pursuit (gOMP) algorithm has received much
attention in recent years as a natural extension of orthogonal matching
pursuit. It is used to recover sparse signals in compressive sensing. In this
paper, a new bound is obtained for the exact reconstruction of every $K$-sparse
signal via the gOMP algorithm in the noiseless case. That is, if the restricted
isometry constant (RIC) $\delta_{NK+1}$ of the sensing matrix $A$ satisfies
\begin{eqnarray*} \delta_{NK+1}<\frac{1}{\sqrt{\frac{K}{N}+1}}, \end{eqnarray*}
then the gOMP can perfectly recover every $K$-sparse signal $x$ from $y=Ax$.
Furthermore, the bound is proved to be sharp in the following sense. For any
given positive integer $K$, we construct a matrix $A$ with the RIC
\begin{eqnarray*} \delta_{NK+1}=\frac{1}{\sqrt{\frac{K}{N}+1}} \end{eqnarray*}
such that the gOMP may fail to recover some $K$-sparse signal $x$.
  In the noise case, an extra condition on the minimum magnitude of the nonzero
components of every $K-$sparse signal combining with the above bound on RIC of
the sensing matrix $A$ is sufficient to recover the true support of every
$K$-sparse signal by the gOMP.
","[{'version': 'v1', 'created': 'Tue, 12 Apr 2016 08:53:38 GMT'}]",2019-08-15,"[['Chen', 'Wengu', ''], ['Ge', 'Huanmin', '']]","['Sensing matrix', 'Generalized orthogonal matching pursuit', 'Restricted isom']"
8783,2207.07970,Matheus Cavalcante,"Matheus Cavalcante, Domenic W\""uthrich, Matteo Perotti, Samuel Riedel,
  Luca Benini","Spatz: A Compact Vector Processing Unit for High-Performance and
  Energy-Efficient Shared-L1 Clusters","9 pages. Accepted for publication in the 2022 International
  Conference on Computer-Aided Design (ICCAD 2022)",,10.1145/3508352.3549367,,cs.AR,http://creativecommons.org/licenses/by/4.0/,"  While parallel architectures based on clusters of Processing Elements (PEs)
sharing L1 memory are widespread, there is no consensus on how lean their PE
should be. Architecting PEs as vector processors holds the promise to greatly
reduce their instruction fetch bandwidth, mitigating the Von Neumann Bottleneck
(VNB). However, due to their historical association with supercomputers,
classical vector machines include micro-architectural tricks to improve the
Instruction Level Parallelism (ILP), which increases their instruction fetch
and decode energy overhead. In this paper, we explore for the first time vector
processing as an option to build small and efficient PEs for large-scale
shared-L1 clusters. We propose Spatz, a compact, modular 32-bit vector
processing unit based on the integer embedded subset of the RISC-V Vector
Extension version 1.0. A Spatz-based cluster with four Multiply-Accumulate
Units (MACUs) needs only 7.9 pJ per 32-bit integer multiply-accumulate
operation, 40% less energy than an equivalent cluster built with four Snitch
scalar cores. We analyzed Spatz' performance by integrating it within MemPool,
a large-scale many-core shared-L1 cluster. The Spatz-based MemPool system
achieves up to 285 GOPS when running a 256x256 32-bit integer matrix
multiplication, 70% more than the equivalent Snitch-based MemPool system. In
terms of energy efficiency, the Spatz-based MemPool system achieves up to 266
GOPS/W when running the same kernel, more than twice the energy efficiency of
the Snitch-based MemPool system, which reaches 128 GOPS/W. Those results show
the viability of lean vector processors as high-performance and
energy-efficient PEs for large-scale clusters with tightly-coupled L1 memory.
","[{'version': 'v1', 'created': 'Sat, 16 Jul 2022 15:54:30 GMT'}]",2022-07-21,"[['Cavalcante', 'Matheus', ''], ['Wüthrich', 'Domenic', ''], ['Perotti', 'Matteo', ''], ['Riedel', 'Samuel', ''], ['Benini', 'Luca', '']]","['Vector Processing', 'SIMD', 'Many-Core', 'RISC-V Vector Extension']"
8784,1606.01799,Ian Holmes,Ian Holmes,Modular non-repeating codes for DNA storage,Submitted to IEEE Transactions on Information Theory,,10.1101/057448,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a strategy for constructing codes for DNA-based information
storage by serial composition of weighted finite-state transducers. The
resulting state machines can integrate correction of substitution errors;
synchronization by interleaving watermark and periodic marker signals;
conversion from binary to ternary, quaternary or mixed-radix sequences via an
efficient block code; encoding into a DNA sequence that avoids homopolymer,
dinucleotide, or trinucleotide runs and other short local repeats; and
detection/correction of errors (including local duplications, burst deletions,
and substitutions) that are characteristic of DNA sequencing technologies. We
present software implementing these codes, available at
github.com/ihh/dnastore, with simulation results demonstrating that the
generated DNA is free of short repeats and can be accurately decoded even in
the presence of substitutions, short duplications and deletions.
","[{'version': 'v1', 'created': 'Mon, 6 Jun 2016 15:53:57 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Jun 2016 12:52:48 GMT'}]",2016-11-18,"[['Holmes', 'Ian', '']]","['DNA storage', 'finite-state transducers', 'mixed-radix trees', 'deletioninsertion correcting codes']"
8785,2104.14884,Nicolas Troquard,Joseph Boudou and Andreas Herzig and Nicolas Troquard,Resource separation in dynamic logic of propositional assignments,,"Journal of Logical and Algebraic Methods in Programming, 2021,
  100683, ISSN 2352-2208, https://doi.org/10.1016/j.jlamp.2021.100683.
  (https://www.sciencedirect.com/science/article/pii/S2352220821000468)",10.1016/j.jlamp.2021.100683,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We extend dynamic logic of propositional assignments by adding an operator of
parallel composition that is inspired by separation logics. We provide an
axiomatisation via reduction axioms, thereby establishing decidability. We also
prove that the complexity of both the model checking and the satisfiability
problem stay in PSPACE.
","[{'version': 'v1', 'created': 'Fri, 30 Apr 2021 10:14:46 GMT'}]",2021-05-04,"[['Boudou', 'Joseph', ''], ['Herzig', 'Andreas', ''], ['Troquard', 'Nicolas', '']]","['Dynamic logic', 'separation logic', 'propositional assignments', 'parallel composition', 'concurrency']"
8786,2106.07249,"Jarkko Peltom\""aki","Jarkko Peltom\""aki and Ville Salo",Automatic winning shifts,"28 pages, 5 figures, 1 table","Information and Computation, Vol. 285.B, 104883:1-21 (2022)",10.1016/j.ic.2022.104883,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To each one-dimensional subshift $X$, we may associate a winning shift $W(X)$
which arises from a combinatorial game played on the language of $X$.
Previously it has been studied what properties of $X$ does $W(X)$ inherit. For
example, $X$ and $W(X)$ have the same factor complexity and if $X$ is a sofic
subshift, then $W(X)$ is also sofic. In this paper, we develop a notion of
automaticity for $W(X)$, that is, we propose what it means that a vector
representation of $W(X)$ is accepted by a finite automaton.
  Let $S$ be an abstract numeration system such that addition with respect to
$S$ is a rational relation. Let $X$ be a subshift generated by an $S$-automatic
word. We prove that as long as there is a bound on the number of nonzero
symbols in configurations of $W(X)$ (which follows from $X$ having sublinear
factor complexity), then $W(X)$ is accepted by a finite automaton, which can be
effectively constructed from the description of $X$. We provide an explicit
automaton when $X$ is generated by certain automatic words such as the
Thue-Morse word.
","[{'version': 'v1', 'created': 'Mon, 14 Jun 2021 09:06:36 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Feb 2022 15:32:50 GMT'}]",2022-06-15,"[['Peltomäki', 'Jarkko', ''], ['Salo', 'Ville', '']]","['winning shift', 'combinatorial game', 'abstract numeration system', 'automatic sequence', 'regularlanguage', 'sofic shift']"
8787,1710.09975,Renato J Cintra,"A. Edirisuriya, A. Madanayake, R. J. Cintra, V. S. Dimitrov","A Single-Channel Architecture for Algebraic Integer Based 8$\times$8 2-D
  DCT Computation","8 pages, 6 figures, 5 tables","IEEE Transactions on Circuits and Systems for Video Technology,
  volume 23, number 12, pages 2083-2089, Dec. 2013",10.1109/TCSVT.2013.2270397,,cs.AR cs.MM stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An area efficient row-parallel architecture is proposed for the real-time
implementation of bivariate algebraic integer (AI) encoded 2-D discrete cosine
transform (DCT) for image and video processing. The proposed architecture
computes 8$\times$8 2-D DCT transform based on the Arai DCT algorithm. An
improved fast algorithm for AI based 1-D DCT computation is proposed along with
a single channel 2-D DCT architecture. The design improves on the 4-channel AI
DCT architecture that was published recently by reducing the number of integer
channels to one and the number of 8-point 1-D DCT cores from 5 down to 2. The
architecture offers exact computation of 8$\times$8 blocks of the 2-D DCT
coefficients up to the FRS, which converts the coefficients from the AI
representation to fixed-point format using the method of expansion factors.
Prototype circuits corresponding to FRS blocks based on two expansion factors
are realized, tested, and verified on FPGA-chip, using a Xilinx Virtex-6
XC6VLX240T device. Post place-and-route results show a 20% reduction in terms
of area compared to the 2-D DCT architecture requiring five 1-D AI cores. The
area-time and area-time${}^2$ complexity metrics are also reduced by 23% and
22% respectively for designs with 8-bit input word length. The digital
realizations are simulated up to place and route for ASICs using 45 nm CMOS
standard cells. The maximum estimated clock rate is 951 MHz for the CMOS
realizations indicating 7.608$\cdot$10$^9$ pixels/seconds and a 8$\times$8
block rate of 118.875 MHz.
","[{'version': 'v1', 'created': 'Fri, 27 Oct 2017 03:32:48 GMT'}]",2017-10-30,"[['Edirisuriya', 'A.', ''], ['Madanayake', 'A.', ''], ['Cintra', 'R. J.', ''], ['Dimitrov', 'V. S.', '']]","['DCT', 'Algebraic Integers', 'Expansion factors']"
8788,2209.08316,Lisa Alazraki,"Lisa Alazraki, Ali Ghachem, Neophytos Polydorou, Foaad Khosmood and
  Abbas Edalat",An Empathetic AI Coach for Self-Attachment Therapy,,"2021 IEEE Third International Conference on Cognitive Machine
  Intelligence (CogMI), 2021, pp. 78-87",10.1109/CogMI52975.2021.00019,,cs.AI cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we present a new dataset and a computational strategy for a
digital coach that aims to guide users in practicing the protocols of
self-attachment therapy. Our framework augments a rule-based conversational
agent with a deep-learning classifier for identifying the underlying emotion in
a user's text response, as well as a deep-learning assisted retrieval method
for producing novel, fluent and empathetic utterances. We also craft a set of
human-like personas that users can choose to interact with. Our goal is to
achieve a high level of engagement during virtual therapy sessions. We evaluate
the effectiveness of our framework in a non-clinical trial with N=16
participants, all of whom have had at least four interactions with the agent
over the course of five days. We find that our platform is consistently rated
higher for empathy, user engagement and usefulness than the simple rule-based
framework. Finally, we provide guidelines to further improve the design and
performance of the application, in accordance with the feedback received.
","[{'version': 'v1', 'created': 'Sat, 17 Sep 2022 12:01:35 GMT'}]",2022-09-20,"[['Alazraki', 'Lisa', ''], ['Ghachem', 'Ali', ''], ['Polydorou', 'Neophytos', ''], ['Khosmood', 'Foaad', ''], ['Edalat', 'Abbas', '']]","['digital psychotherapy', 'chatbots', 'self-attachment']"
8789,2004.02290,Jude Tchaye-Kondi,"Jude Tchaye-Kondi, Yanlong Zhai, Liehuang Zhu","A new hashing based nearest neighbors selection technique for big
  datasets","8 pages,6 figures",,10.5121/csit.2021.110708,,cs.LG cs.DS stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  KNN has the reputation to be the word simplest but efficient supervised
learning algorithm used for either classification or regression. KNN prediction
efficiency highly depends on the size of its training data but when this
training data grows KNN suffers from slowness in making decisions since it
needs to search nearest neighbors within the entire dataset at each decision
making. This paper proposes a new technique that enables the selection of
nearest neighbors directly in the neighborhood of a given observation. The
proposed approach consists of dividing the data space into subcells of a
virtual grid built on top of data space. The mapping between the data points
and subcells is performed using hashing. When it comes to select the nearest
neighbors of a given observation, we firstly identify the cell the observation
belongs by using hashing, and then we look for nearest neighbors from that
central cell and cells around it layer by layer. From our experiment
performance analysis on publicly available datasets, our algorithm outperforms
the original KNN in time efficiency with a prediction quality as good as that
of KNN it also offers competitive performance with solutions like KDtree
","[{'version': 'v1', 'created': 'Sun, 5 Apr 2020 19:36:00 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Feb 2021 03:26:41 GMT'}]",2021-07-01,"[['Tchaye-Kondi', 'Jude', ''], ['Zhai', 'Yanlong', ''], ['Zhu', 'Liehuang', '']]","['Machine learning', 'Nearest neighbors', 'Hashing', 'Bigdata']"
8790,2111.08196,Brendan O'Connor,"Brendan O'Connor, Simon Dixon, George Fazekas",An Exploratory Study on Perceptual Spaces of the Singing Voice,"In Proceedings of the 2020 Joint Conference on AI Music Creativity
  (CSMC-MuMe 2020), Stockholm, Sweden, October 15-19, 2020",,10.30746/978-91-519-5560-5,,cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Sixty participants provided dissimilarity ratings between various singing
techniques. Multidimensional scaling, class averaging and clustering techniques
were used to analyse timbral spaces and how they change between different
singers, genders and registers. Clustering analysis showed that ground-truth
similarity and silhouette scores that were not significantly different between
gender or register conditions, while similarity scores were positively
correlated with participants' instrumental abilities and task comprehension.
Participant feedback showed how a revised study design might mitigate noise in
our data, leading to more detailed statistical results. Timbre maps and class
distance analysis showed us which singing techniques remained similar to one
another across gender and register conditions. This research provides insight
into how the timbre space of singing changes under different conditions,
highlights the subjectivity of perception between participants, and provides
generalised timbre maps for regularisation in machine learning.
","[{'version': 'v1', 'created': 'Tue, 16 Nov 2021 02:48:25 GMT'}]",2021-11-17,"[[""O'Connor"", 'Brendan', ''], ['Dixon', 'Simon', ''], ['Fazekas', 'George', '']]","['voice', 'vocal perception', 'singing', 'singing technique', 'timbrespace', 'clustering', 'dissimilarity rating', 'multidimensional scaling']"
8791,2009.08768,Horst Schirmeier,"Alexander Lochmann, Robin Thunig, Horst Schirmeier",Improving Linux-Kernel Tests for LockDoc with Feedback-driven Fuzzing,"reason for v2 replacement: broken citation style in v1 that harms
  readability",,10.18420/fgbs2020h-01,,cs.SE,http://creativecommons.org/licenses/by-sa/4.0/,"  LockDoc is an approach to extract locking rules for kernel data structures
from a dynamic execution trace recorded while the system is under a benchmark
load. These locking rules can e.g. be used to locate synchronization bugs. For
high rule precision and thorough bug finding, the approach heavily depends on
the choice of benchmarks: They must trigger the execution of as much code as
possible in the kernel subsystem relevant for the targeted data structures.
However, existing test suites such as those provided by the Linux Test Project
(LTP) only achieve -- in the case of LTP -- about 35 percent basic-block
coverage for the VFS subsystem, which is the relevant subsystem when extracting
locking rules for filesystem-related data structures.
  In this article, we discuss how to complement the LTP suites to improve the
code coverage for our LockDoc scenario. We repurpose syzkaller -- a
coverage-guided fuzzer with the goal to validate the robustness of kernel APIs
-- to 1) not aim for kernel crashes, and to 2) maximize code coverage for a
specific kernel subsystem. Thereby, we generate new benchmark programs that can
be run in addition to the LTP, and increase VFS basic-block coverage by 26.1
percent.
","[{'version': 'v1', 'created': 'Wed, 16 Sep 2020 18:42:54 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Sep 2021 16:34:30 GMT'}]",2021-09-17,"[['Lochmann', 'Alexander', ''], ['Thunig', 'Robin', ''], ['Schirmeier', 'Horst', '']]","['Test Generation', 'Kernel Test Coverage', 'Basic-Block Coverage', 'syzkaller', 'Linux Test Project', 'kcov']"
8792,1507.01282,Andres Monroy-Hernandez,"Andr\'es Monroy-Hern\'andez, Mitchel Resnick",Empowering Kids to Create and Share Programmable Media,"FEATURE: Empowering kids to create and share programmable media.
  interactions. issue 15, volume 2 (March 2008), pages 50-53","Interactions 15, 2 (March 2008), 50-53",10.1145/1340961.1340974,,cs.CY cs.HC cs.SI,http://creativecommons.org/licenses/by/4.0/,"  This article reflects on the first eight months of existence of the Scratch
Online Community by discussing the design rationale and learning theories
underlying Scratch and its website.
","[{'version': 'v1', 'created': 'Sun, 5 Jul 2015 22:01:50 GMT'}]",2015-07-07,"[['Monroy-Hernández', 'Andrés', ''], ['Resnick', 'Mitchel', '']]","['creative learning', 'children', 'online communities', 'end-userprogramming', 'social computing']"
8793,2201.00818,Martin Atzmueller,"Stefan Bloemheuvel and Jurgen van den Hoogen and Dario Jozinovi\'c and
  Alberto Michelini and Martin Atzmueller","Graph Neural Networks for Multivariate Time Series Regression with
  Application to Seismic Data","18 pages, LaTeX; final revision; published in: International Journal
  of Data Science and Analytics, pages 1-16, 2022",,10.1007/s41060-022-00349-6,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning, with its advances in deep learning has shown great
potential in analyzing time series. In many scenarios, however, additional
information that can potentially improve the predictions is available. This is
crucial for data that arise from e.g., sensor networks that contain information
about sensor locations. Then, such spatial information can be exploited by
modeling it via graph structures, along with the sequential (time series)
information. Recent advances in adapting deep learning to graphs have shown
potential in various tasks. However, these methods have not been adapted for
time series tasks to a great extent. Most attempts have essentially
consolidated around time series forecasting with small sequence lengths.
Generally, these architectures are not well suited for regression or
classification tasks where the value to be predicted is not strictly depending
on the most recent values, but rather on the whole length of the time series.
We propose TISER-GCN, a novel graph neural network architecture for processing,
in particular, these long time series in a multivariate regression task. Our
proposed model is tested on two seismic datasets containing earthquake
waveforms, where the goal is to predict maximum intensity measurements of
ground shaking at each seismic station. Our findings demonstrate promising
results of our approach -- with an average MSE reduction of 16.3% - compared to
the best performing baselines. In addition, our approach matches the baseline
scores by needing only half the input size. The results are discussed in depth
with an additional ablation study.
","[{'version': 'v1', 'created': 'Mon, 3 Jan 2022 16:11:46 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Jan 2022 21:44:01 GMT'}, {'version': 'v3', 'created': 'Mon, 31 Oct 2022 19:06:34 GMT'}]",2022-11-02,"[['Bloemheuvel', 'Stefan', ''], ['Hoogen', 'Jurgen van den', ''], ['Jozinović', 'Dario', ''], ['Michelini', 'Alberto', ''], ['Atzmueller', 'Martin', '']]","['Graph Neural Networks', 'Time Series', 'Convolutional Neural Networks', 'Sensors', 'Regression', 'Earthquake Ground Motion', 'Seismic Network']"
8794,1906.04157,Jiaqi Jiang,Jiaqi Jiang and Jonathan A. Fan,"Global optimization of dielectric metasurfaces using a physics-driven
  neural network","20 pages, 5 figures",,10.1021/acs.nanolett.9b01857,,cs.LG physics.comp-ph physics.optics,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a global optimizer, based on a conditional generative neural
network, which can output ensembles of highly efficient topology-optimized
metasurfaces operating across a range of parameters. A key feature of the
network is that it initially generates a distribution of devices that broadly
samples the design space, and then shifts and refines this distribution towards
favorable design space regions over the course of optimization. Training is
performed by calculating the forward and adjoint electromagnetic simulations of
outputted devices and using the subsequent efficiency gradients for
backpropagation. With metagratings operating across a range of wavelengths and
angles as a model system, we show that devices produced from the trained
generative network have efficiencies comparable to or better than the best
devices produced by adjoint-based topology optimization, while requiring less
computational cost. Our reframing of adjoint-based optimization to the training
of a generative neural network applies generally to physical systems that can
utilize gradients to improve performance.
","[{'version': 'v1', 'created': 'Mon, 13 May 2019 21:01:24 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Jul 2019 22:53:24 GMT'}]",2019-07-18,"[['Jiang', 'Jiaqi', ''], ['Fan', 'Jonathan A.', '']]","['global optimization', 'generative neural networks', 'machine learning', 'adjoint']"
8795,1908.05940,Tim Soethout,"Tim Soethout (ING Bank / Centrum Wiskunde & Informatica (CWI),
  Netherlands), Tijs van der Storm (Centrum Wiskunde & Informatica (CWI) /
  Universiteit Groningen, Netherlands), Jurgen Vinju (Centrum Wiskunde &
  Informatica (CWI) / TU Eindhoven, Netherlands)","Path-Sensitive Atomic Commit: Local Coordination Avoidance for
  Distributed Transactions",,"The Art, Science, and Engineering of Programming, 2021, Vol. 5,
  Issue 1, Article 3",10.22152/programming-journal.org/2021/5/3,,cs.DC cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Concurrent objects with asynchronous messaging are an increasingly
popular way to structure highly available, high performance, large-scale
software systems. To ensure data-consistency and support synchronization
between objects such systems often use distributed transactions with Two-Phase
Locking (2PL) for concurrency control and Two-Phase commit (2PC) as atomic
commitment protocol. Inquiry In highly available, high-throughput systems, such
as large banking infrastructure, however, 2PL becomes a bottleneck when objects
are highly contended, when an object is queuing a lot of messages because of
locking.
  Approach: In this paper we introduce Path-Sensitive Atomic Commit (PSAC) to
address this situation. We start from message handlers (or methods), which are
decorated with pre- and post-conditions, describing their guards and effect.
  Knowledge: This allows the PSAC lock mechanism to check whether the effect of
two incoming messages at the same time are independent, and to avoid locking if
this is the case. As a result, more messages are directly accepted or rejected,
and higher overall throughput is obtained.
  Grounding: We have implemented PSAC for a state machine-based DSL called
Rebel, on top of a runtime based on the Akka actor framework. Our performance
evaluation shows that PSAC exhibits the same scalability and latency
characteristics as standard 2PL/2PC, and obtains up to 1.8 times median higher
throughput in congested scenarios.
  Importance: We believe PSAC is a step towards enabling organizations to build
scalable distributed applications, even if their consistency requirements are
not embarrassingly parallel.
","[{'version': 'v1', 'created': 'Fri, 16 Aug 2019 11:52:05 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Jun 2020 18:30:12 GMT'}]",2020-06-11,"[['Soethout', 'Tim', '', 'ING Bank / Centrum Wiskunde & Informatica'], ['van der Storm', 'Tijs', '', 'Centrum Wiskunde & Informatica'], ['Vinju', 'Jurgen', '', 'Centrum Wiskunde &\n  Informatica']]","['Synchronization', 'Coordination avoidance', 'Atomic commitment protocols', 'Enterprise architectures']"
8796,1708.04203,Tzvika Geft,"Prosenjit Bose, Tzvika Geft, Dan Halperin and Shahar Shamai",Optimal Algorithms for Separating a Polyhedron from Its Single-Part Mold,"13 pages. This version includes a proof that establishes the
  optimality of our algorithms, which extends our CASE2017 version. Submitted
  to Computer-Aided Design",,10.1109/COASE.2017.8256076,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Casting is a manufacturing process where liquid material is poured into a
mold having the shape of a desired product. After the material solidifies, the
product is removed from the mold. We study the case where the mold is made of a
single part and the object to be produced is a three-dimensional polyhedron.
Objects that can be produced this way are called castable with a single-part
mold. A direction in which the object can be removed without breaking the mold
is called a valid removal direction. We give an $O(n)$-time algorithm that
decides whether a given polyhedron with $n$ facets is castable with a
single-part mold. When possible, our algorithm provides an orientation of the
polyhedron in the mold and a direction in which the product can be removed
without breaking the mold. Moreover, we provide an optimal $\Theta(n \log
n)$-time algorithm to compute all valid removal directions for polyhdera that
are castable with a single-part mold. Both algorithms are an improvement by a
linear factor over the previously best known algorithms for both of these
problems.
","[{'version': 'v1', 'created': 'Mon, 14 Aug 2017 16:47:12 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Jun 2021 15:25:51 GMT'}]",2021-06-08,"[['Bose', 'Prosenjit', ''], ['Geft', 'Tzvika', ''], ['Halperin', 'Dan', ''], ['Shamai', 'Shahar', '']]","['Casting', 'Cast removal', 'Cast design', 'Separability']"
8797,2202.00057,Mohammad Islam,"Md Rajib Hossen, Mohammad A. Islam, and Kishwar Ahmed",Practical Efficient Microservice Autoscaling with QoS Assurance,"Appeared on HPDC'22, 13 pages, 20 figures",,10.1145/3502181.3531460,,cs.DC cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  Cloud applications are increasingly moving away from monolithic services to
agile microservices-based deployments. However, efficient resource management
for microservices poses a significant hurdle due to the sheer number of loosely
coupled and interacting components. The interdependencies between various
microservices make existing cloud resource autoscaling techniques ineffective.
Meanwhile, machine learning (ML) based approaches that try to capture the
complex relationships in microservices require extensive training data and
cause intentional SLO violations. Moreover, these ML-heavy approaches are slow
in adapting to dynamically changing microservice operating environments. In
this paper, we propose PEMA (Practical Efficient Microservice Autoscaling), a
lightweight microservice resource manager that finds efficient resource
allocation through opportunistic resource reduction. PEMA's lightweight design
enables novel workload-aware and adaptive resource management. Using three
prototype microservice implementations, we show that PEMA can find efficient
resource allocation and save up to 33% resource compared to the commercial
rule-based resource allocations.
","[{'version': 'v1', 'created': 'Mon, 31 Jan 2022 19:38:57 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Aug 2022 17:36:42 GMT'}]",2022-08-10,"[['Hossen', 'Md Rajib', ''], ['Islam', 'Mohammad A.', ''], ['Ahmed', 'Kishwar', '']]","['Autoscaling', 'microservices', 'resource management', 'cloud computing', 'quality of service']"
8798,2108.01360,Ziyi Ye,"Ziyi Ye, Xiaohui Xie, Yiqun Liu, Zhihong Wang, Xuesong Chen, Min
  Zhang, Shaoping Ma","Towards a Better Understanding Human Reading Comprehension with Brain
  Signals",Accepted by The Web Conference 2022 (WWW'22) as a full paper,,10.1145/3485447.3511966,,cs.IR cs.AI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reading comprehension is a complex cognitive process involving many human
brain activities. Plenty of works have studied the patterns and attention
allocations of reading comprehension in information retrieval related
scenarios. However, little is known about what happens in human brain during
reading comprehension and how these cognitive activities can affect information
retrieval process. Additionally, with the advances in brain imaging techniques
such as electroencephalogram (EEG), it is possible to collect brain signals in
almost real time and explore whether it can be utilized as feedback to
facilitate information acquisition performance. In this paper, we carefully
design a lab-based user study to investigate brain activities during reading
comprehension. Our findings show that neural responses vary with different
types of reading contents, i.e., contents that can satisfy users' information
needs and contents that cannot. We suggest that various cognitive activities,
e.g., cognitive loading, semantic-thematic understanding, and inferential
processing, underpin these neural responses at the micro-time scale during
reading comprehension. From these findings, we illustrate several insights for
information retrieval tasks, such as ranking models construction and interface
design. Besides, we suggest the possibility of detecting reading comprehension
status for a proactive real-world system. To this end, we propose a Unified
framework for EEG-based Reading Comprehension Modeling (UERCM). To verify its
effectiveness, we conduct extensive experiments based on EEG features for two
reading comprehension tasks: answer sentence classification and answer
extraction. Results show that it is feasible to improve the performance of two
tasks with brain signals.
","[{'version': 'v1', 'created': 'Tue, 3 Aug 2021 08:37:57 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Aug 2021 01:07:13 GMT'}, {'version': 'v3', 'created': 'Wed, 17 Aug 2022 06:11:01 GMT'}]",2022-08-18,"[['Ye', 'Ziyi', ''], ['Xie', 'Xiaohui', ''], ['Liu', 'Yiqun', ''], ['Wang', 'Zhihong', ''], ['Chen', 'Xuesong', ''], ['Zhang', 'Min', ''], ['Ma', 'Shaoping', '']]","['Reading Comprehension', 'Answer Extraction', 'Relevance Prediction', 'Brain Signals', 'EEG']"
8799,2108.13280,Christof Beierle,"Christof Beierle, Gregor Leander, L\'eo Perrin",Trims and Extensions of Quadratic APN Functions,,Des. Codes Cryptogr. 90(4): 1009-1036 (2022),10.1007/s10623-022-01024-4,,cs.IT cs.DM math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we study functions that can be obtained by restricting a
vectorial Boolean function $F \colon \mathbb{F}_2^n \rightarrow \mathbb{F}_2^n$
to an affine hyperplane of dimension $n-1$ and then projecting the output to an
$n-1$-dimensional space. We show that a multiset of $2 \cdot (2^n-1)^2$
EA-equivalence classes of such restrictions defines an EA-invariant for
vectorial Boolean functions on $\mathbb{F}_2^n$. Further, for all of the known
quadratic APN functions in dimension $n < 10$, we determine the restrictions
that are also APN. Moreover, we construct 6,368 new quadratic APN functions in
dimension eight up to EA-equivalence by extending a quadratic APN function in
dimension seven. A special focus of this work is on quadratic APN functions
with maximum linearity. In particular, we characterize a quadratic APN function
$F \colon \mathbb{F}_2^n \rightarrow \mathbb{F}_2^n$ with linearity of
$2^{n-1}$ by a property of the ortho-derivative of its restriction to a linear
hyperplane. Using the fact that all quadratic APN functions in dimension seven
are classified, we are able to obtain a classification of all quadratic 8-bit
APN functions with linearity $2^7$ up to EA-equivalence.
","[{'version': 'v1', 'created': 'Mon, 30 Aug 2021 14:52:16 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Jan 2022 13:29:40 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Mar 2022 14:21:01 GMT'}]",2022-03-29,"[['Beierle', 'Christof', ''], ['Leander', 'Gregor', ''], ['Perrin', 'Léo', '']]","['almost perfect nonlinear', 'EA-equivalence', 'EA-invariant', 'linearity', 'restriction', 'extension']"
8800,2006.07700,Ihsen Alouani,"Amira Guesmi, Ihsen Alouani, Khaled Khasawneh, Mouna Baklouti, Tarek
  Frikha, Mohamed Abid, Nael Abu-Ghazaleh",Defensive Approximation: Securing CNNs using Approximate Computing,"ACM International Conference on Architectural Support for Programming
  Languages and Operating Systems (ASPLOS 2021)",,10.1145/3445814.3446747,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the past few years, an increasing number of machine-learning and deep
learning structures, such as Convolutional Neural Networks (CNNs), have been
applied to solving a wide range of real-life problems. However, these
architectures are vulnerable to adversarial attacks. In this paper, we propose
for the first time to use hardware-supported approximate computing to improve
the robustness of machine learning classifiers. We show that our approximate
computing implementation achieves robustness across a wide range of attack
scenarios. Specifically, for black-box and grey-box attack scenarios, we show
that successful adversarial attacks against the exact classifier have poor
transferability to the approximate implementation. Surprisingly, the robustness
advantages also apply to white-box attacks where the attacker has access to the
internal implementation of the approximate classifier. We explain some of the
possible reasons for this robustness through analysis of the internal operation
of the approximate implementation. Furthermore, our approximate computing model
maintains the same level in terms of classification accuracy, does not require
retraining, and reduces resource utilization and energy consumption of the CNN.
We conducted extensive experiments on a set of strong adversarial attacks; We
empirically show that the proposed implementation increases the robustness of a
LeNet-5 and an Alexnet CNNs by up to 99% and 87%, respectively for strong
grey-box adversarial attacks along with up to 67% saving in energy consumption
due to the simpler nature of the approximate logic. We also show that a
white-box attack requires a remarkably higher noise budget to fool the
approximate classifier, causing an average of 4db degradation of the PSNR of
the input image relative to the images that succeed in fooling the exact
classifier
","[{'version': 'v1', 'created': 'Sat, 13 Jun 2020 18:58:25 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Jul 2021 20:38:12 GMT'}, {'version': 'v3', 'created': 'Thu, 29 Jul 2021 08:52:10 GMT'}]",2021-07-30,"[['Guesmi', 'Amira', ''], ['Alouani', 'Ihsen', ''], ['Khasawneh', 'Khaled', ''], ['Baklouti', 'Mouna', ''], ['Frikha', 'Tarek', ''], ['Abid', 'Mohamed', ''], ['Abu-Ghazaleh', 'Nael', '']]","['Deep neural network', 'adversarial example', 'security', 'approximatecomputing']"
8801,2205.13885,Nicolas Kourtellis Ph.D.,"Myrsini Gkolemi, Panagiotis Papadopoulos, Evangelos P. Markatos,
  Nicolas Kourtellis","YouTubers Not madeForKids: Detecting Channels Sharing Inappropriate
  Videos Targeting Children","12 pages, 10 Tables, 23 Figures. In Proceedings of 14th ACM Web
  Science Conference 2022, Barcelona, Spain",,10.1145/3501247.3531556,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  In the last years, hundreds of new Youtube channels have been creating and
sharing videos targeting children, with themes related to animation, superhero
movies, comics, etc. Unfortunately, many of these videos are inappropriate for
consumption by their target audience, due to disturbing, violent, or sexual
scenes. In this paper, we study YouTube channels found to post suitable or
disturbing videos targeting kids in the past. We identify a clear discrepancy
between what YouTube assumes and flags as inappropriate content and channel,
vs. what is found to be disturbing content and still available on the platform,
targeting kids. In particular, we find that almost 60\% of videos that were
manually annotated and classified as disturbing by an older study in 2019 (a
collection bootstrapped with Elsa and other keywords related to children
videos), are still available on YouTube in mid 2021. In the meantime, 44% of
channels that uploaded such disturbing videos, have yet to be suspended and
their videos to be removed. For the first time in literature, we also study the
""madeForKids"" flag, a new feature that YouTube introduced in the end of 2019,
and compare its application to the channels that shared disturbing videos, as
flagged from the previous study. Apparently, these channels are less likely to
be set as ""madeForKids"" than those sharing suitable content. In addition,
channels posting disturbing videos utilize their channel features such as
keywords, description, topics, posts, etc., to appeal to kids (e.g., using
game-related keywords). Finally, we use a collection of such channel and
content features to train ML classifiers able to detect, at channel creation
time, when a channel will be related to disturbing content uploads. These
classifiers can help YouTube moderators reduce such incidences, pointing to
potentially suspicious accounts without analyzing actual videos.
","[{'version': 'v1', 'created': 'Fri, 27 May 2022 10:34:15 GMT'}]",2022-05-30,"[['Gkolemi', 'Myrsini', ''], ['Papadopoulos', 'Panagiotis', ''], ['Markatos', 'Evangelos P.', ''], ['Kourtellis', 'Nicolas', '']]","['topics', 'social media links', 'polarity andsentiment of description etc']"
8802,2004.08671,Iyolita Islam,"Iyolita Islam, Kazi Md. Munim, Shahrima Jannat Oishwee, A.K.M. Najmul
  Islam and Muhammad Nazrul Islam","A Critical Review of Concepts, Benefits, and Pitfalls of Blockchain
  Technology Using Concept Map","9 pages, 3 figures, 6 tables","IEEE Access, vol. 8, pp. 68333-68341, 2020",10.1109/ACCESS.2020.2985647,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Blockchain is relatively a new area of research. However, a surge of research
studies on the blockchain has taken place in recent years. These research
studies have mostly focused on designing and developing conceptual frameworks
to build more reliable, transparent and efficient digital systems. While
blockchain brings a wide variety of benefits, it also imposes certain
challenges. Therefore, the objective of this research is to understand the
properties of blockchain, its current uses, observed benefits and pitfalls to
provide a balanced understanding of blockchain. A systematic literature review
approach was adopted in this paper in order to attain the objective. A total of
51 articles were selected and reviewed. As outcomes, this research provides a
summary of the state-of-the-art research studies conducted in the area of
blockchain. Furthermore, we develop a set of concept maps aiming to provide
in-depth knowledge on blockchain technology for its efficient and effective
usage in the development of future technological solutions.
","[{'version': 'v1', 'created': 'Sat, 18 Apr 2020 17:43:15 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Apr 2020 15:17:19 GMT'}]",2020-04-28,"[['Islam', 'Iyolita', ''], ['Munim', 'Kazi Md.', ''], ['Oishwee', 'Shahrima Jannat', ''], ['Islam', 'A. K. M. Najmul', ''], ['Islam', 'Muhammad Nazrul', '']]","['used for finding materialswere ‘‘Blockchain’’', '‘‘Blockchain Technology’’', '‘‘Applications of Blockchain’’', '‘‘Concept of Blockchain’’', '‘‘Benefits']"
8803,2108.09977,Yiqi Jiang,"Yiqi Jiang, Weihua Chen, Xiuyu Sun, Xiaoyu Shi, Fan Wang, Hao Li","Exploring the Quality of GAN Generated Images for Person
  Re-Identification","10 pages, 4 figures",,10.1145/3474085.3475547,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Recently, GAN based method has demonstrated strong effectiveness in
generating augmentation data for person re-identification (ReID), on account of
its ability to bridge the gap between domains and enrich the data variety in
feature space. However, most of the ReID works pick all the GAN generated data
as additional training samples or evaluate the quality of GAN generation at the
entire data set level, ignoring the image-level essential feature of data in
ReID task. In this paper, we analyze the in-depth characteristics of ReID
sample and solve the problem of ""What makes a GAN-generated image good for
ReID"". Specifically, we propose to examine each data sample with id-consistency
and diversity constraints by mapping image onto different spaces. With a
metric-based sampling method, we demonstrate that not every GAN-generated data
is beneficial for augmentation. Models trained with data filtered by our
quality evaluation outperform those trained with the full augmentation set by a
large margin. Extensive experiments show the effectiveness of our method on
both supervised ReID task and unsupervised domain adaptation ReID task.
","[{'version': 'v1', 'created': 'Mon, 23 Aug 2021 07:20:12 GMT'}]",2021-08-24,"[['Jiang', 'Yiqi', ''], ['Chen', 'Weihua', ''], ['Sun', 'Xiuyu', ''], ['Shi', 'Xiaoyu', ''], ['Wang', 'Fan', ''], ['Li', 'Hao', '']]","['GAN', 'Person Re-Identification', 'Dataset', 'Augmentation', 'Sampling']"
8804,2109.04567,Abhishek Rathod,Abhishek Rathod,Fast Algorithms for Minimum Cycle Basis and Minimum Homology Basis,"36th International Symposium on Computational Geometry (SoCG 2020)
  64:1--64:11",,10.4230/LIPIcs.SoCG.2020.64,,cs.CG cs.DS,http://creativecommons.org/licenses/by/4.0/,"  We study the problem of finding a minimum homology basis, that is, a shortest
set of cycles that generates the $1$-dimensional homology classes with
$\mathbb{Z}_2$ coefficients in a given simplicial complex $K$. This problem has
been extensively studied in the last few years.
  For general complexes, the current best deterministic algorithm, by Dey et
al., runs in $O(N^\omega + N^2 g)$ time, where $N$ denotes the number of
simplices in $K$, $g$ denotes the rank of the $1$-homology group of $K$, and
$\omega$ denotes the exponent of matrix multiplication. In this paper, we
present two conceptually simple randomized algorithms that compute a minimum
homology basis of a general simplicial complex $K$. The first algorithm runs in
$\tilde{O}(m^\omega)$ time, where $m$ denotes the number of edges in $K$,
whereas the second algorithm runs in $O(m^\omega + N m^{\omega-1})$ time.
  We also study the problem of finding a minimum cycle basis in an undirected
graph $G$ with $n$ vertices and $m$ edges. The best known algorithm for this
problem runs in $O(m^\omega)$ time. Our algorithm, which has a simpler
high-level description, but is slightly more expensive, runs in
$\tilde{O}(m^\omega)$ time.
","[{'version': 'v1', 'created': 'Thu, 9 Sep 2021 21:39:49 GMT'}]",2021-09-13,"[['Rathod', 'Abhishek', '']]","['Computational topology', 'Minimum homology basis', 'Minimum cycle basis', 'Simplicial complexes', 'Matrix computations']"
8805,1909.04591,Frank Schweitzer,"Frank Schweitzer, Pavlin Mavrodiev, Adrian M. Seufert, David Garcia","Modeling User Reputation in Online Social Networks: The Role of Costs,
  Benefits, and Reciprocity",,,10.3390/e22101073,,cs.SI cs.MA nlin.AO physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze an agent-based model to estimate how the costs and benefits of
users in an online social network (OSN) impact the robustness of the OSN.
Benefits are measured in terms of relative reputation that users receives from
their followers. They can be increased by direct and indirect reciprocity in
following each other, which leads to a core-periphery structure of the OSN.
Costs relate to the effort to login, to maintain the profile, etc. and are
assumed as constant for all users. The robustness of the OSN depends on the
entry and exit of users over time. Intuitively, one would expect that higher
costs lead to more users leaving and hence to a less robust OSN. We demonstrate
that an optimal cost level exists, which maximizes both the performance of the
OSN, measured by means of the long-term average benefit of its users, and the
robustness of the OSN, measured by means of the life-time of the core of the
OSN. Our mathematical and computational analyses unfold how changes in the cost
level impact reciprocity and subsequently the core-periphery structure of the
OSN, to explain the optimal cost level.
","[{'version': 'v1', 'created': 'Tue, 10 Sep 2019 16:02:11 GMT'}]",2020-10-28,"[['Schweitzer', 'Frank', ''], ['Mavrodiev', 'Pavlin', ''], ['Seufert', 'Adrian M.', ''], ['Garcia', 'David', '']]","['reciprocity', 'core-periphery network', 'cost-benefit relation', 'robustness', 'reputation']"
8806,1702.03511,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",Axioms for behavioural congruence of single-pass instruction sequences,"19 pages, this paper draws somewhat from the preliminaries of
  arXiv:1502.00238 [cs.PL] and some earlier papers; some remarks added and some
  remarks reformulated",Scientific Annals of Computer Science 27(2):111--135 (2017),10.7561/SACS.2017.2.111,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In program algebra, an algebraic theory of single-pass instruction sequences,
three congruences on instruction sequences are paid attention to: instruction
sequence congruence, structural congruence, and behavioural congruence. Sound
and complete axiom systems for the first two congruences were already given in
early papers on program algebra. The current paper is the first one that is
concerned with an axiom system for the third congruence. The presented axiom
system is especially notable for its axioms that have to do with forward jump
instructions.
","[{'version': 'v1', 'created': 'Sun, 12 Feb 2017 10:32:38 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Nov 2017 09:13:17 GMT'}]",2019-01-28,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['program algebra', 'instruction sequence congruence', 'structuralcongruence', 'behavioural congruence', 'axiom system']"
8807,2112.10379,Daofei Li,"Daofei Li, Siyuan Lin and Guanming Liu",Lane Departure Prediction Based on Closed-Loop Vehicle Dynamics,"12 pages, 23 figures",,10.1177/09596518221079460,,cs.RO cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  An automated driving system should have the ability to supervise its own
performance and to request human driver to take over when necessary. In the
lane keeping scenario, the prediction of vehicle future trajectory is the key
to realize safe and trustworthy driving automation. Previous studies on vehicle
trajectory prediction mainly fall into two categories, i.e. physics-based and
manoeuvre-based methods. Using a physics-based methodology, this paper proposes
a lane departure prediction algorithm based on closed-loop vehicle dynamics
model. We use extended Kalman filter to estimate the current vehicle states
based on sensing module outputs. Then a Kalman Predictor with actual lane
keeping control law is used to predict steering actions and vehicle states in
the future. A lane departure assessment module evaluates the probabilistic
distribution of vehicle corner positions and decides whether to initiate a
human takeover request. The prediction algorithm is capable to describe the
stochastic characteristics of future vehicle pose, which is preliminarily
proved in simulated tests. Finally, the on-road tests at speeds of 15 to 50
km/h further show that the pro-posed method can accurately predict vehicle
future trajectory. It may work as a promising solution to lane departure risk
assessment for automated lane keeping functions.
","[{'version': 'v1', 'created': 'Mon, 20 Dec 2021 08:07:28 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Jan 2022 15:05:58 GMT'}, {'version': 'v3', 'created': 'Sat, 12 Feb 2022 11:06:30 GMT'}]",2022-02-15,"[['Li', 'Daofei', ''], ['Lin', 'Siyuan', ''], ['Liu', 'Guanming', '']]","['Trajectory prediction', 'Kalman predictor', 'lane keeping assist', 'automated driving', 'risk assessment']"
8808,1910.03220,Kerry A Nice,"Kerry A. Nice, Jason Thompson, Jasper S. Wijnands, Gideon D.P.A.
  Aschwanden, Mark Stevenson",The 'Paris-end' of town? Urban typology through machine learning,,,10.3390/urbansci4020027,,cs.CV cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The confluence of recent advances in availability of geospatial information,
computing power, and artificial intelligence offers new opportunities to
understand how and where our cities differ or are alike. Departing from a
traditional `top-down' analysis of urban design features, this project analyses
millions of images of urban form (consisting of street view, satellite imagery,
and street maps) to find shared characteristics. A (novel) neural network-based
framework is trained with imagery from the largest 1692 cities in the world and
the resulting models are used to compare within-city locations from Melbourne
and Sydney to determine the closest connections between these areas and their
international comparators. This work demonstrates a new, consistent, and
objective method to begin to understand the relationship between cities and
their health, transport, and environmental consequences of their design. The
results show specific advantages and disadvantages using each type of imagery.
Neural networks trained with map imagery will be highly influenced by the mix
of roads, public transport, and green and blue space as well as the structure
of these elements. The colours of natural and built features stand out as
dominant characteristics in satellite imagery. The use of street view imagery
will emphasise the features of a human scaled visual geography of streetscapes.
Finally, and perhaps most importantly, this research also answers the age-old
question, ``Is there really a `Paris-end' to your city?''.
","[{'version': 'v1', 'created': 'Tue, 8 Oct 2019 05:26:33 GMT'}]",2020-06-03,"[['Nice', 'Kerry A.', ''], ['Thompson', 'Jason', ''], ['Wijnands', 'Jasper S.', ''], ['Aschwanden', 'Gideon D. P. A.', ''], ['Stevenson', 'Mark', '']]","['machine learning', 'urban typology', 'urban design', 'transport', 'health']"
8809,2101.04319,Alsharif Abuadbba Dr,"Alsharif Abuadbba, Hyoungshick Kim, Surya Nepal","DeepiSign: Invisible Fragile Watermark to Protect the Integrityand
  Authenticity of CNN",The 36th ACM SIGAPP Symposium on Applied Computing (ACM SAC),,10.1145/3412841.3441970,,cs.CR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Convolutional Neural Networks (CNNs) deployed in real-life applications such
as autonomous vehicles have shown to be vulnerable to manipulation attacks,
such as poisoning attacks and fine-tuning. Hence, it is essential to ensure the
integrity and authenticity of CNNs because compromised models can produce
incorrect outputs and behave maliciously. In this paper, we propose a
self-contained tamper-proofing method, called DeepiSign, to ensure the
integrity and authenticity of CNN models against such manipulation attacks.
DeepiSign applies the idea of fragile invisible watermarking to securely embed
a secret and its hash value into a CNN model. To verify the integrity and
authenticity of the model, we retrieve the secret from the model, compute the
hash value of the secret, and compare it with the embedded hash value. To
minimize the effects of the embedded secret on the CNN model, we use a
wavelet-based technique to transform weights into the frequency domain and
embed the secret into less significant coefficients. Our theoretical analysis
shows that DeepiSign can hide up to 1KB secret in each layer with minimal loss
of the model's accuracy. To evaluate the security and performance of DeepiSign,
we performed experiments on four pre-trained models (ResNet18, VGG16, AlexNet,
and MobileNet) using three datasets (MNIST, CIFAR-10, and Imagenet) against
three types of manipulation attacks (targeted input poisoning, output
poisoning, and fine-tuning). The results demonstrate that DeepiSign is
verifiable without degrading the classification accuracy, and robust against
representative CNN manipulation attacks.
","[{'version': 'v1', 'created': 'Tue, 12 Jan 2021 06:42:45 GMT'}]",2021-01-13,"[['Abuadbba', 'Alsharif', ''], ['Kim', 'Hyoungshick', ''], ['Nepal', 'Surya', '']]","['Watermarking', 'CNN', 'integrity', 'authenticity']"
8810,2106.11266,Sayali Kate,"Sayali Kate, Michael Chinn, Hongjun Choi, Xiangyu Zhang, Sebastian
  Elbaum","PHYSFRAME: Type Checking Physical Frames of Reference for Robotic
  Systems",,,10.1145/3468264.3468608,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  A robotic system continuously measures its own motions and the external world
during operation. Such measurements are with respect to some frame of
reference, i.e., a coordinate system. A nontrivial robotic system has a large
number of different frames and data have to be translated back-and-forth from a
frame to another. The onus is on the developers to get such translation right.
However, this is very challenging and error-prone, evidenced by the large
number of questions and issues related to frame uses on developers' forum.
Since any state variable can be associated with some frame, reference frames
can be naturally modeled as variable types. We hence develop a novel type
system that can automatically infer variables' frame types and in turn detect
any type inconsistencies and violations of frame conventions. The evaluation on
a set of 180 publicly available ROS projects shows that our system can detect
190 inconsistencies with 154 true positives. We reported 52 to developers and
received 18 responses so far, with 15 fixed/acknowledged. Our technique also
finds 45 violations of common practices.
","[{'version': 'v1', 'created': 'Mon, 21 Jun 2021 17:11:11 GMT'}]",2021-06-22,"[['Kate', 'Sayali', ''], ['Chinn', 'Michael', ''], ['Choi', 'Hongjun', ''], ['Zhang', 'Xiangyu', ''], ['Elbaum', 'Sebastian', '']]","['Physical Frame of Reference', 'Frame Consistency', 'Type Checking', 'Static Analysis', 'z-score Mining', 'Robotic Systems']"
8811,1904.08926,Vladimir Vargas-Calder\'on,Vargas-Calder\'on Vladimir and Camargo Jorge,"Characterization of citizens using word2vec and latent topic analysis in
  a large set of tweets",,,10.1016/j.cities.2019.03.019,,cs.SI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the increasing use of the Internet and mobile devices, social networks
are becoming the most used media to communicate citizens' ideas and thoughts.
This information is very useful to identify communities with common ideas based
on what they publish in the network. This paper presents a method to
automatically detect city communities based on machine learning techniques
applied to a set of tweets from Bogot\'a's citizens. An analysis was performed
in a collection of 2,634,176 tweets gathered from Twitter in a period of six
months. Results show that the proposed method is an interesting tool to
characterize a city population based on a machine learning methods and text
analytics.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2019 13:25:38 GMT'}]",2019-04-22,"[['Vladimir', 'Vargas-Calderón', ''], ['Jorge', 'Camargo', '']]","['natural language processing', 'word embedding', 't-sne', 'social']"
8812,2001.09924,Najla Al-Saati Dr.,Najla Akram AL-Saati and Marrwa Abd-AlKareem Alabajee,"Selecting Best Software Reliability Growth Models: A Social Spider
  Algorithm based Approach",9 pages,"International Journal of Computer Applications Volume 181 Number 8
  August 2018",10.5120/ijca2018917616,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software Reliability is considered to be an essential part of software
systems; it involves measuring the system's probability of having failures;
therefore, it is strongly related to Software Quality. Software Reliability
Growth Models are used to indicate the expected number of failures encountered
after the software has been completed, it is also an indicator of the software
readiness to be delivered. This paper presents a study of selecting the best
Software Reliability Growth Model according to the dataset at hand. Several
Comparison Criteria are used to yield a ranking methodology to be used in
pointing out best models. The Social Spider Algorithm SSA, one of the newly
introduced Swarm Intelligent Algorithms, is used for estimating the parameters
of the SRGMs for two datasets. Results indicate that the use of SSA was
efficient in assisting the process of criteria weighting to find the optimal
model and the best overall ranking of employed models.
","[{'version': 'v1', 'created': 'Wed, 1 Jan 2020 17:19:14 GMT'}]",2020-01-28,"[['AL-Saati', 'Najla Akram', ''], ['Alabajee', 'Marrwa Abd-AlKareem', '']]","['Software Reliability', 'SRGMs', 'Models Ranking', 'Weighted Criteria', 'Social Spider Algorithm']"
8813,2203.15239,Xuhai Xu,"Xuhai Xu, Jun Gong, Carolina Brum, Lilian Liang, Bongsoo Suh, Kumar
  Gupta, Yash Agarwal, Laurence Lindsey, Runchang Kang, Behrooz Shahsavari, Tu
  Nguyen, Heriberto Nieto, Scott E. Hudson, Charlie Maalouf, Seyed Mousavi,
  Gierad Laput",Enabling hand gesture customization on wrist-worn devices,"Proceedings of the 2022 CHI Conference on Human Factors in Computing
  Systems",,10.1145/3491102.3501904,,cs.HC cs.AI,http://creativecommons.org/licenses/by/4.0/,"  We present a framework for gesture customization requiring minimal examples
from users, all without degrading the performance of existing gesture sets. To
achieve this, we first deployed a large-scale study (N=500+) to collect data
and train an accelerometer-gyroscope recognition model with a cross-user
accuracy of 95.7% and a false-positive rate of 0.6 per hour when tested on
everyday non-gesture data. Next, we design a few-shot learning framework which
derives a lightweight model from our pre-trained model, enabling knowledge
transfer without performance degradation. We validate our approach through a
user study (N=20) examining on-device customization from 12 new gestures,
resulting in an average accuracy of 55.3%, 83.1%, and 87.2% on using one,
three, or five shots when adding a new gesture, while maintaining the same
recognition accuracy and false-positive rate from the pre-existing gesture set.
We further evaluate the usability of our real-time implementation with a user
experience study (N=20). Our results highlight the effectiveness, learnability,
and usability of our customization framework. Our approach paves the way for a
future where users are no longer bound to pre-existing gestures, freeing them
to creatively introduce new gestures tailored to their preferences and
abilities.
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2022 05:12:32 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Apr 2022 07:30:51 GMT'}]",2022-04-20,"[['Xu', 'Xuhai', ''], ['Gong', 'Jun', ''], ['Brum', 'Carolina', ''], ['Liang', 'Lilian', ''], ['Suh', 'Bongsoo', ''], ['Gupta', 'Kumar', ''], ['Agarwal', 'Yash', ''], ['Lindsey', 'Laurence', ''], ['Kang', 'Runchang', ''], ['Shahsavari', 'Behrooz', ''], ['Nguyen', 'Tu', ''], ['Nieto', 'Heriberto', ''], ['Hudson', 'Scott E.', ''], ['Maalouf', 'Charlie', ''], ['Mousavi', 'Seyed', ''], ['Laput', 'Gierad', '']]","['Gesture customization', 'transfer learning', 'few-shot learning']"
8814,1802.03928,Istv\'an M\'odos,"Istv\'an M\'odos, P\v{r}emysl \v{S}\r{u}cha, Zden\v{e}k Hanz\'alek","Algorithms for robust production scheduling with energy consumption
  limits",,"I. Modos, P. Sucha, and Z. Hanzalek. Algorithms for robust
  production scheduling with energy consumption limits. Computers & Industrial
  Engineering, 112:391 - 408, 2017",10.1016/j.cie.2017.08.011,,cs.DS,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this work, we consider a scheduling problem faced by production companies
with large electricity consumption. Due to the contract with the electric
utility, the production companies are obligated to comply with the total energy
consumption limits in the specified time intervals (usually 15-minutes long),
otherwise, the companies pay substantial penalty fees. Although it is possible
to design production schedules that consider these limits as hard constraints,
uncertainties occurring during the execution of the schedules are usually not
taken into account. This may lead to situations in which the unexpected delays
of the operations cause the violations of the energy consumption limits. Our
goal is to design robust production schedules pro-actively guaranteeing that
the energy consumption limits are not violated for the given set of uncertainty
scenarios. We consider scheduling on one machine with release times of the
operations and total tardiness as the objective function. To tackle this
problem, we first propose a pseudo-polynomial algorithm for finding the optimal
robust schedule for the given permutation of the operations. This algorithm is
then utilised in three different algorithms for finding the optimal
permutation: two exact (Branch-and-Bound and logic-based Benders decomposition)
and one heuristic algorithm (tabu search). All the algorithms were
experimentally evaluated on random instances with different sizes of the
uncertainty scenarios set. Using the tabu search algorithm, we are able to
solve large instances within one minute.
","[{'version': 'v1', 'created': 'Mon, 12 Feb 2018 08:22:09 GMT'}]",2018-02-14,"[['Módos', 'István', ''], ['Šůcha', 'Přemysl', ''], ['Hanzálek', 'Zdeněk', '']]","['robust production scheduling', 'energy consumption limits', 'uncertainty scenarios', 'maximumpower demand']"
8815,2103.00912,Hai Dang,"Hai Dang, Daniel Buschek","GestureMap: Supporting Visual Analytics and Quantitative Analysis of
  Motion Elicitation Data by Learning 2D Embeddings","12 pages, 6 figures, 1 table, ACM CHI 2021",,10.1145/3411764.3445765,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents GestureMap, a visual analytics tool for gesture
elicitation which directly visualises the space of gestures. Concretely, a
Variational Autoencoder embeds gestures recorded as 3D skeletons on an
interactive 2D map. GestureMap further integrates three computational
capabilities to connect exploration to quantitative measures: Leveraging DTW
Barycenter Averaging (DBA), we compute average gestures to 1) represent gesture
groups at a glance; 2) compute a new consensus measure (variance around average
gesture); and 3) cluster gestures with k-means. We evaluate GestureMap and its
concepts with eight experts and an in-depth analysis of published data. Our
findings show how GestureMap facilitates exploring large datasets and helps
researchers to gain a visual understanding of elicited gesture spaces. It
further opens new directions, such as comparing elicitations across studies. We
discuss implications for elicitation studies and research, and opportunities to
extend our approach to additional tasks in gesture elicitation.
","[{'version': 'v1', 'created': 'Mon, 1 Mar 2021 11:00:23 GMT'}]",2021-03-02,"[['Dang', 'Hai', ''], ['Buschek', 'Daniel', '']]","['Gesture elicitation', 'dimensionality reduction', 'deep learning', 'visualanalytics']"
8816,2101.00836,Alexandre Decan,Alexandre Decan and Tom Mens,"Lost in Zero Space -- An Empirical Comparison of 0.y.z Releases in
  Software Package Distributions",preprint,Science of Computer Programming 2021,10.1016/j.scico.2021.102656,,cs.SE,http://creativecommons.org/licenses/by-sa/4.0/,"  Distributions of open source software packages dedicated to specific
programming languages facilitate software development by allowing software
projects to depend on the functionality provided by such reusable packages. The
health of a software project can be affected by the maturity of the packages on
which it depends. The version numbers of the used package releases provide an
indication of their maturity. Packages with a 0.y.z version number are commonly
assumed to be under initial development, suggesting that they are likely to be
less stable, and depending on them may be considered as less healthy. In this
paper, we empirically study, for four open source package distributions (Cargo,
npm, Packagist and RubyGems) to which extent 0.y.z package releases and >=1.0.0
package releases behave differently. We quantify the prevalence of 0.y.z
releases, we explore how long packages remain in the initial development stage,
we compare the update frequency of 0.y.z and >=1.0.0 package releases, we study
how often 0.y.z releases are required by other packages, we assess whether
semantic versioning is respected for dependencies towards them, and we compare
some characteristics of 0.y.z and >=1.0.0 package repositories hosted on
GitHub. Among others, we observe that package distributions are more permissive
than what semantic versioning dictates for 0.y.z releases, and that many of the
0.y.z releases can actually be regarded as mature packages. As a consequence,
the version number does not provide a good indication of the maturity of a
package release.
","[{'version': 'v1', 'created': 'Mon, 4 Jan 2021 08:53:58 GMT'}]",2021-04-13,"[['Decan', 'Alexandre', ''], ['Mens', 'Tom', '']]","['software package distribution', 'software reuse', 'software library', 'version management', 'semantic versioning', 'software health']"
8817,1711.09768,Christian Lameiro,"Christian Lameiro, Ignacio Santamaria, Peter J. Schreier","Improper Gaussian signaling for multiple-access channels in underlay
  cognitive radio",,,10.1109/TCOMM.2018.2880765,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers an unlicensed multiple-access channel (MAC) that
coexists with a licensed point-to-point user, following the underlay cognitive
radio paradigm. We assume that every transceiver except the secondary base
station has one antenna, and that the primary user (PU) is protected by a
minimum rate constraint. In contrast to the conventional assumption of proper
Gaussian signaling, we allow the secondary users (SUs) to transmit improper
Gaussian signals, which are correlated with their complex conjugate. When the
secondary base station performs zero-forcing, we show that improper signaling
is optimal if the sum of the interference channel gains (in an equivalent
canonical model) is above a certain threshold. Additionally, we derive an
efficient algorithm to compute the transmission parameters that attain the rate
region boundary for this scenario. The proposed algorithm exploits a
single-user representation of the secondary MAC along with new results on the
optimality of improper signaling in the single-user case when the PU is
corrupted by improper noise.
","[{'version': 'v1', 'created': 'Mon, 27 Nov 2017 15:35:27 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Nov 2018 08:55:26 GMT'}]",2018-11-09,"[['Lameiro', 'Christian', ''], ['Santamaria', 'Ignacio', ''], ['Schreier', 'Peter J.', '']]","['Improper Gaussian signaling', 'multiple-access channel', 'underlay cognitive radio']"
8818,2109.03100,Yapeng Gao,"Yapeng Gao, Jonas Tebbe, Andreas Zell","Optimal Stroke Learning with Policy Gradient Approach for Robotic Table
  Tennis",,,10.1007/s10489-022-04131-w,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning to play table tennis is a challenging task for robots, as a wide
variety of strokes required. Recent advances have shown that deep Reinforcement
Learning (RL) is able to successfully learn the optimal actions in a simulated
environment. However, the applicability of RL in real scenarios remains limited
due to the high exploration effort. In this work, we propose a realistic
simulation environment in which multiple models are built for the dynamics of
the ball and the kinematics of the robot. Instead of training an end-to-end RL
model, a novel policy gradient approach with TD3 backbone is proposed to learn
the racket strokes based on the predicted state of the ball at the hitting
time. In the experiments, we show that the proposed approach significantly
outperforms the existing RL methods in simulation. Furthermore, to cross the
domain from simulation to reality, we adopt an efficient retraining method and
test it in three real scenarios. The resulting success rate is 98% and the
distance error is around 24.9 cm. The total training time is about 1.5 hours.
","[{'version': 'v1', 'created': 'Tue, 7 Sep 2021 14:00:13 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Nov 2021 14:29:01 GMT'}]",2022-10-11,"[['Gao', 'Yapeng', ''], ['Tebbe', 'Jonas', ''], ['Zell', 'Andreas', '']]","['Table tennis robot', 'Stroke learning', 'Reinforcement learning', 'Sim2Real']"
8819,2210.14596,Joern Ploennigs,"Joern Ploennigs, Konstantinos Semertzidis, Fabio Lorenzi, Nandana
  Mihindukulasooriya",Scaling Knowledge Graphs for Automating AI of Digital Twins,Accepted at ISWC 2022,,10.1007/978-3-031-19433-7_46,,cs.AI cs.CL cs.DB,http://creativecommons.org/licenses/by/4.0/,"  Digital Twins are digital representations of systems in the Internet of
Things (IoT) that are often based on AI models that are trained on data from
those systems. Semantic models are used increasingly to link these datasets
from different stages of the IoT systems life-cycle together and to
automatically configure the AI modelling pipelines. This combination of
semantic models with AI pipelines running on external datasets raises unique
challenges particular if rolled out at scale. Within this paper we will discuss
the unique requirements of applying semantic graphs to automate Digital Twins
in different practical use cases. We will introduce the benchmark dataset DTBM
that reflects these characteristics and look into the scaling challenges of
different knowledge graph technologies. Based on these insights we will propose
a reference architecture that is in-use in multiple products in IBM and derive
lessons learned for scaling knowledge graphs for configuring AI models for
Digital Twins.
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2022 10:12:10 GMT'}]",2022-10-27,"[['Ploennigs', 'Joern', ''], ['Semertzidis', 'Konstantinos', ''], ['Lorenzi', 'Fabio', ''], ['Mihindukulasooriya', 'Nandana', '']]","['Knowledge Graphs', 'Semantic Models', 'Scalability', 'Internetof Things', 'Machine Learning', 'Digital Twins']"
8820,2111.01968,Farhad Pourpanah Dr.,"Xinlei Zhou and Han Liu and Farhad Pourpanah and Tieyong Zeng and
  Xizhao Wang","A Survey on Epistemic (Model) Uncertainty in Supervised Learning: Recent
  Advances and Applications","45pages, 4 figures",,10.1016/j.neucom.2021.10.119,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quantifying the uncertainty of supervised learning models plays an important
role in making more reliable predictions. Epistemic uncertainty, which usually
is due to insufficient knowledge about the model, can be reduced by collecting
more data or refining the learning models. Over the last few years, scholars
have proposed many epistemic uncertainty handling techniques which can be
roughly grouped into two categories, i.e., Bayesian and ensemble. This paper
provides a comprehensive review of epistemic uncertainty learning techniques in
supervised learning over the last five years. As such, we, first, decompose the
epistemic uncertainty into bias and variance terms. Then, a hierarchical
categorization of epistemic uncertainty learning techniques along with their
representative models is introduced. In addition, several applications such as
computer vision (CV) and natural language processing (NLP) are presented,
followed by a discussion on research gaps and possible future research
directions.
","[{'version': 'v1', 'created': 'Wed, 3 Nov 2021 01:22:46 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Nov 2021 01:46:47 GMT'}]",2022-01-27,"[['Zhou', 'Xinlei', ''], ['Liu', 'Han', ''], ['Pourpanah', 'Farhad', ''], ['Zeng', 'Tieyong', ''], ['Wang', 'Xizhao', '']]","['Epistemic uncertainty learning', 'supervised learning', 'Bayesianapproximation', 'ensemble learning', 'computer vision', 'natural language processing']"
8821,2107.07253,Asier Guti\'errez-Fandi\~no,"Asier Guti\'errez-Fandi\~no, Jordi Armengol-Estap\'e, Marc P\`amies,
  Joan Llop-Palao, Joaqu\'in Silveira-Ocampo, Casimiro Pio Carrino, Aitor
  Gonzalez-Agirre, Carme Armentano-Oller, Carlos Rodriguez-Penagos, Marta
  Villegas",MarIA: Spanish Language Models,,"Procesamiento del Lenguaje Natural, v. 68, p. 39-60, mar. 2022.
  ISSN 1989-7553",10.26342/2022-68-3,,cs.CL cs.AI,http://creativecommons.org/licenses/by/4.0/,"  This work presents MarIA, a family of Spanish language models and associated
resources made available to the industry and the research community. Currently,
MarIA includes RoBERTa-base, RoBERTa-large, GPT2 and GPT2-large Spanish
language models, which can arguably be presented as the largest and most
proficient language models in Spanish. The models were pretrained using a
massive corpus of 570GB of clean and deduplicated texts with 135 billion words
extracted from the Spanish Web Archive crawled by the National Library of Spain
between 2009 and 2019. We assessed the performance of the models with nine
existing evaluation datasets and with a novel extractive Question Answering
dataset created ex novo. Overall, MarIA models outperform the existing Spanish
models across a variety of NLU tasks and training settings.
","[{'version': 'v1', 'created': 'Thu, 15 Jul 2021 11:23:05 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Aug 2021 13:47:44 GMT'}, {'version': 'v3', 'created': 'Fri, 1 Apr 2022 13:03:32 GMT'}, {'version': 'v4', 'created': 'Mon, 4 Apr 2022 16:25:12 GMT'}, {'version': 'v5', 'created': 'Tue, 5 Apr 2022 11:13:46 GMT'}]",2022-04-06,"[['Gutiérrez-Fandiño', 'Asier', ''], ['Armengol-Estapé', 'Jordi', ''], ['Pàmies', 'Marc', ''], ['Llop-Palao', 'Joan', ''], ['Silveira-Ocampo', 'Joaquín', ''], ['Carrino', 'Casimiro Pio', ''], ['Gonzalez-Agirre', 'Aitor', ''], ['Armentano-Oller', 'Carme', ''], ['Rodriguez-Penagos', 'Carlos', ''], ['Villegas', 'Marta', '']]","['MarIA', 'Spanish language modelling', 'Spanish language resources', 'Benchmarking']"
8822,2007.03922,Zhaoxia Yin,"Zhaoxia Yin, Xiaomeng She, Jin Tang and Bin Luo","Reversible data hiding in encrypted images based on pixel prediction and
  multi-MSB planes rearrangement",,"Signal Processing, 2021, 187: 1-11",10.1016/j.sigpro.2021.108146,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Great concern has arisen in the field of reversible data hiding in encrypted
images (RDHEI) due to the development of cloud storage and privacy protection.
RDHEI is an effective technology that can embed additional data after image
encryption, extract additional data error-free and reconstruct original images
losslessly. In this paper, a high-capacity and fully reversible RDHEI method is
proposed, which is based on pixel prediction and multi-MSB (most significant
bit) planes rearrangement. First, the median edge detector (MED) predictor is
used to calculate the predicted value. Next, unlike previous methods, in our
proposed method, signs of prediction errors (PEs) are represented by one bit
plane and absolute values of PEs are represented by other bit planes. Then, we
divide bit planes into uniform blocks and non-uniform blocks, and rearrange
these blocks. Finally, according to different pixel prediction schemes,
different numbers of additional data are embedded adaptively. The experimental
results prove that our method has higher embedding capacity compared with
state-of-the-art RDHEI methods.
","[{'version': 'v1', 'created': 'Wed, 8 Jul 2020 06:59:00 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Nov 2020 09:45:24 GMT'}, {'version': 'v3', 'created': 'Sat, 20 Mar 2021 07:26:33 GMT'}]",2021-10-19,"[['Yin', 'Zhaoxia', ''], ['She', 'Xiaomeng', ''], ['Tang', 'Jin', ''], ['Luo', 'Bin', '']]","['Reversible data hiding', 'encrypted images', 'privacy protection', 'prediction error']"
8823,2209.06644,Dongmin Hyun,"Dongmin Hyun, Chanyoung Park, Junsu Cho, and Hwanjo Yu","Beyond Learning from Next Item: Sequential Recommendation via
  Personalized Interest Sustainability",CIKM 2022,,10.1145/3511808.3557415,,cs.IR cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sequential recommender systems have shown effective suggestions by capturing
users' interest drift. There have been two groups of existing sequential
models: user- and item-centric models. The user-centric models capture
personalized interest drift based on each user's sequential consumption
history, but do not explicitly consider whether users' interest in items
sustains beyond the training time, i.e., interest sustainability. On the other
hand, the item-centric models consider whether users' general interest sustains
after the training time, but it is not personalized. In this work, we propose a
recommender system taking advantages of the models in both categories. Our
proposed model captures personalized interest sustainability, indicating
whether each user's interest in items will sustain beyond the training time or
not. We first formulate a task that requires to predict which items each user
will consume in the recent period of the training time based on users'
consumption history. We then propose simple yet effective schemes to augment
users' sparse consumption history. Extensive experiments show that the proposed
model outperforms 10 baseline models on 11 real-world datasets. The codes are
available at https://github.com/dmhyun/PERIS.
","[{'version': 'v1', 'created': 'Wed, 14 Sep 2022 13:47:58 GMT'}]",2022-09-15,"[['Hyun', 'Dongmin', ''], ['Park', 'Chanyoung', ''], ['Cho', 'Junsu', ''], ['Yu', 'Hwanjo', '']]","['Sequential Recommender System', 'Personalized Interest Sustainability', 'Interest Drift', 'Top-K Recommendation', 'Collaborative Filtering']"
8824,2010.04553,Jaros{\l}aw Miszczak,"Artur Frankiewicz, Adam Glos, Krzysztof Grochla, Zbigniew
  {\L}askarzewski, Jaros{\l}aw Miszczak, Konrad Po{\l}ys, Przemys{\l}aw
  Sadowski, Anna Strzoda","LP WAN Gateway Location Selection Using Modified K-Dominating Set
  Algorithm","14 pages, 7 figures","M. C. Calzarossa et al. (Eds.): MASCOTS 2020, LNCS 12527, pp.
  1-15, 2021",10.1007/978-3-030-68110-4_14,,cs.NI cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The LP WAN networks use gateways or base stations to communicate with devices
distributed on large distances, up to tens of kilometres. The selection of
optimal gateway locations in wireless networks should allow providing the
complete coverage for a given set of nodes, taking into account the
limitations, such as the number of nodes served per access point or required
redundancy. In this paper, we describe the problem of selecting the base
stations in a network using the concept of $k$-dominating set. In our model, we
include information about the required redundancy and spectral efficiency. We
consider the additional requirements on the resulting connections and provide
the greedy algorithm for solving the problem. The algorithm is evaluated in
randomly generated network topologies and using the coordinates of sample real
smart metering networks.
","[{'version': 'v1', 'created': 'Fri, 9 Oct 2020 13:18:44 GMT'}]",2021-02-04,"[['Frankiewicz', 'Artur', ''], ['Glos', 'Adam', ''], ['Grochla', 'Krzysztof', ''], ['Łaskarzewski', 'Zbigniew', ''], ['Miszczak', 'Jarosław', ''], ['Połys', 'Konrad', ''], ['Sadowski', 'Przemysław', ''], ['Strzoda', 'Anna', '']]","['LP WAN', 'radio planing', 'gateway location', 'redundancy']"
8825,2009.03759,Xiangyu Y Hu,"Chi Zhang and Jianhang Wang and Massoud Rezavand and Dong Wu and
  Xiangyu Hu","An integrative smoothed particle hydrodynamics framework for modeling
  cardiac function","49 pages, 29 figures",,10.1016/j.cma.2021.113847,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mathematical modeling of cardiac function can provide augmented
simulation-based diagnosis tool for complementing and extending human
understanding of cardiac diseases which represent the most common cause of
worldwide death. As the realistic starting-point for developing an unified
meshless approach for total heart modeling, herein we propose an integrative
smoothed particle hydrodynamics (SPH) framework for addressing the simulation
of the principle aspects of cardiac function, including cardiac
electrophysiology, passive mechanical response and electromechanical coupling.
To that end, several algorithms, e.g., splitting reaction-by-reaction method
combined with quasi-steady-state (QSS) solver , anisotropic SPH-diffusion
discretization and total Lagrangian SPH formulation, are introduced and
exploited for dealing with the fundamental challenges of developing integrative
SPH framework for simulating cardiac function, namely, (i) the correct
capturing of the stiff dynamics of the transmembrane potential and the gating
variables , (ii) the stable predicting of the large deformations and the
strongly anisotropic behavior of the myocardium, and (iii) the proper coupling
of electrophysiology and tissue mechanics for electromechanical feedback. A set
of numerical examples demonstrate the effectiveness and robustness of the
present SPH framework, and render it a potential and powerful alternative that
can augment current lines of total cardiac modeling and clinical applications.
","[{'version': 'v1', 'created': 'Fri, 4 Sep 2020 10:57:01 GMT'}]",2021-05-05,"[['Zhang', 'Chi', ''], ['Wang', 'Jianhang', ''], ['Rezavand', 'Massoud', ''], ['Wu', 'Dong', ''], ['Hu', 'Xiangyu', '']]","['Cardiac function', 'Electrophysiology', 'Electromechanics', 'Smoothed']"
8826,2110.04173,Maroun Haddad,Maroun Haddad and Mohamed Bouguessa,"TopoDetect: Framework for Topological Features Detection in Graph
  Embeddings",,,10.1016/j.simpa.2021.100139,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  TopoDetect is a Python package that allows the user to investigate if
important topological features, such as the Degree of the nodes, their Triangle
Count, or their Local Clustering Score, are preserved in the embeddings of
graph representation models. Additionally, the framework enables the
visualization of the embeddings according to the distribution of the
topological features among the nodes. Moreover, TopoDetect enables us to study
the effect of the preservation of these features by evaluating the performance
of the embeddings on downstream learning tasks such as clustering and
classification.
","[{'version': 'v1', 'created': 'Fri, 8 Oct 2021 14:54:53 GMT'}]",2021-10-11,"[['Haddad', 'Maroun', ''], ['Bouguessa', 'Mohamed', '']]","['Graph Neural Networks', 'Graph Embedding', 'NodeRepresentation Learning', 'Graph Topological Features', 'ExplainableArtificial Intelligence']"
8827,2208.00458,Luciano Margara,Luciano Margara,"A heuristic technique for decomposing multisets of non-negative integers
  according to the Minkowski sum",,,10.46298/dmtcs.9877,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the following problem. Given a multiset $M$ of non-negative
integers, decide whether there exist and, in the positive case, compute two
non-trivial multisets whose Minkowski sum is equal to $M$. The Minkowski sum of
two multisets A and B is a multiset containing all possible sums of any element
of A and any element of B. This problem was proved to be NP-complete when
multisets are replaced by sets. This version of the problem is strictly related
to the factorization of boolean polynomials that turns out to be NP-complete as
well. When multisets are considered, the problem is equivalent to the
factorization of polynomials with non-negative integer coefficients. The
computational complexity of both these problems is still unknown.
  The main contribution of this paper is a heuristic technique for decomposing
multisets of non-negative integers. Experimental results show that our
heuristic decomposes multisets of hundreds of elements within seconds
independently of the magnitude of numbers belonging to the multisets. Our
heuristic can be used also for factoring polynomials in N[x]. We show that,
when the degree of the polynomials gets larger, our technique is much faster
than the state-of-the-art algorithms implemented in commercial software like
Mathematica and MatLab.
","[{'version': 'v1', 'created': 'Sun, 31 Jul 2022 15:57:51 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Oct 2022 14:12:49 GMT'}, {'version': 'v3', 'created': 'Fri, 28 Oct 2022 08:03:06 GMT'}]",2022-11-10,"[['Margara', 'Luciano', '']]","['multisets', 'polynomials', 'decomposition', 'heuristics']"
8828,2104.14125,Tse-Wei Chen,"Tse-Wei Chen, Wei Tao, Deyu Wang, Dongchao Wen, Kinya Osa, Masami Kato","Hardware Architecture of Embedded Inference Accelerator and Analysis of
  Algorithms for Depthwise and Large-Kernel Convolutions","Camera-ready version for ECCV 2020 workshop (Embedded Vision
  Workshop)","ECCV 2020 Workshops, LNCS 12539, pp. 3-17, 2020",10.1007/978-3-030-68238-5_1,,cs.CV cs.AR eess.IV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In order to handle modern convolutional neural networks (CNNs) efficiently, a
hardware architecture of CNN inference accelerator is proposed to handle
depthwise convolutions and regular convolutions, which are both essential
building blocks for embedded-computer-vision algorithms. Different from related
works, the proposed architecture can support filter kernels with different
sizes with high flexibility since it does not require extra costs for
intra-kernel parallelism, and it can generate convolution results faster than
the architecture of the related works. The experimental results show the
importance of supporting depthwise convolutions and dilated convolutions with
the proposed hardware architecture. In addition to depthwise convolutions with
large-kernels, a new structure called DDC layer, which includes the combination
of depthwise convolutions and dilated convolutions, is also analyzed in this
paper. For face detection, the computational costs decrease by 30%, and the
model size decreases by 20% when the DDC layers are applied to the network. For
image classification, the accuracy is increased by 1% by simply replacing $3
\times 3$ filters with $5 \times 5$ filters in depthwise convolutions.
","[{'version': 'v1', 'created': 'Thu, 29 Apr 2021 05:45:16 GMT'}]",2021-04-30,"[['Chen', 'Tse-Wei', ''], ['Tao', 'Wei', ''], ['Wang', 'Deyu', ''], ['Wen', 'Dongchao', ''], ['Osa', 'Kinya', ''], ['Kato', 'Masami', '']]","['Convolutional neural networks (CNNs)', 'embedded vision', 'depthwise convolution', 'hardware utilization']"
8829,1911.06488,Son Doan <,"Son Doan, Elly W Yang, Sameer Tilak, Manabu Torii","Using natural language processing to extract health-related causality
  from Twitter messages",5 pages,"2018 IEEE International Conference on Healthcare Informatics
  Workshop",10.1109/ICHI-W.2018.00031,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Twitter messages (tweets) contain various types of information, which include
health-related information. Analysis of health-related tweets would help us
understand health conditions and concerns encountered in our daily life. In
this work, we evaluated an approach to extracting causal relations from tweets
using natural language processing (NLP) techniques. We focused on three
health-related topics: stress"", ""insomnia"", and ""headache"". We proposed a set
of lexico-syntactic patterns based on dependency parser outputs to extract
causal information. A large dataset consisting of 24 million tweets were used.
The results show that our approach achieved an average precision between 74.59%
and 92.27%. Analysis of extracted relations revealed interesting findings about
health-related in Twitter.
","[{'version': 'v1', 'created': 'Fri, 15 Nov 2019 06:30:25 GMT'}]",2019-11-18,"[['Doan', 'Son', ''], ['Yang', 'Elly W', ''], ['Tilak', 'Sameer', ''], ['Torii', 'Manabu', '']]","['Twitter', 'causal relationships', 'cause-effect', 'natural']"
8830,1905.12541,Susan Stepney,"Penelope Faulkner Rainford, Angelika Sebald, Susan Stepney",MetaChem: An Algebraic Framework for Artificial Chemistries,"39 pages, 19 figures; minor typos corrected",Artificial Life 26(2):153-195 2020,10.1162/artl_a_00315,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce MetaChem, a language for representing and implementing
Artificial Chemistries. We motivate the need for modularisation and
standardisation in representation of artificial chemistries. We describe a
mathematical formalism for Static Graph MetaChem, a static graph based system.
MetaChem supports different levels of description, and has a formal
description; we illustrate these using StringCatChem, a toy artificial
chemistry. We describe two existing Artificial Chemistries -- Jordan Algebra
AChem and Swarm Chemistries -- in MetaChem, and demonstrate how they can be
combined in several different configurations by using a MetaChem environmental
link. MetaChem provides a route to standardisation, reuse, and composition of
Artificial Chemistries and their tools.
","[{'version': 'v1', 'created': 'Wed, 29 May 2019 15:42:24 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Sep 2019 16:44:18 GMT'}, {'version': 'v3', 'created': 'Sun, 14 Jun 2020 19:36:09 GMT'}]",2020-06-16,"[['Rainford', 'Penelope Faulkner', ''], ['Sebald', 'Angelika', ''], ['Stepney', 'Susan', '']]","['Artificial Chemistry', 'Swarm Chemistry', 'Nested Chemistry', 'Jordan Algebra', 'MetaChem', 'Algebraic Framework']"
8831,2104.11041,Ivan Cviti\'c,"Ivan Cviti\'c, Dragan Perakovi\'c, Marko Peri\v{s}a and Anca D. Jurcut","Methodology for Detecting Cyber Intrusions in e-Learning Systems during
  COVID-19 Pandemic",,Mobile networks & applications (2021),10.1007/s11036-021-01789-3,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  In the scenarios of specific conditions and crises such as the coronavirus
pandemic, the availability of e-learning ecosystem elements is further
highlighted. The growing importance for securing such an ecosystem can be seen
from DDoS (Distributed Denial of Service) attacks on e-learning components of
the Croatian e-learning system. The negative impact of the conducted attack is
visible in numerous users who were prevented from participating in and
implementing the planned teaching process. Network anomalies such as conducted
DDoS attacks were identified as one of the crucial threats to the e-learning
systems. In this paper, an overview of the network anomaly phenomenon was given
and botnets' role in generating DDoS attacks, especially IoT device impact. The
paper analyzes the impact of the COVID-19 pandemic on the e-learning systems in
Croatia. Based on the conclusions, a research methodology has been proposed to
develop a cyber-threat detection model that considers the specifics of the
application of e-learning systems in crisis, distinguishing flash crowd events
from anomalies in the communication network. The proposed methodology includes
establishing a theoretical basis on DDoS and flash crowd event traffic,
defining a laboratory testbed setup for data acquisition, development of DDoS
detection model, and testing the applicability of the developed model on the
case study. The implementation of the proposed methodology can improve the
quality of the teaching process through timely DDoS detection and it gives
other socio-economic contributions such as developing a specific research
domain, publicly available dataset of network traffic, and raising the
cyber-security of the e-learning systems.
","[{'version': 'v1', 'created': 'Thu, 22 Apr 2021 13:15:09 GMT'}]",2021-09-07,"[['Cvitić', 'Ivan', ''], ['Peraković', 'Dragan', ''], ['Periša', 'Marko', ''], ['Jurcut', 'Anca D.', '']]","['availability', 'cyber-threats', 'DDoS', 'SARS-CoV-2', 'e-learning']"
8832,1811.07580,Qiang Zou,"Qiang Zou, Juyong Zhang, Bailin Deng, Jibin Zhao",Iso-level tool path planning for free-form surfaces,"Journal paper, 11 figures",Computer-Aided Design 53 (2014): 117-125,10.1016/j.cad.2014.04.006,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of tool path planning is to maximize the efficiency against some
given precision criteria. In practice, scallop height should be kept constant
to avoid unnecessary cutting, while the tool path should be smooth enough to
maintain a high feed rate. However, iso-scallop and smoothness often conflict
with each other. Existing methods smooth iso-scallop paths one-by-one, which
make the final tool path far from being globally optimal. This paper proposes a
new framework for tool path optimization. It views a family of iso-level curves
of a scalar function defined over the surface as tool path so that desired tool
path can be generated by finding the function that minimizes certain energy
functional and different objectives can be considered simultaneously. We use
the framework to plan globally optimal tool path with respect to iso-scallop
and smoothness. The energy functionals for planning iso-scallop, smoothness,
and optimal tool path are respectively derived, and the path topology is
studied too. Experimental results are given to show the effectiveness of the
proposed methods.
","[{'version': 'v1', 'created': 'Mon, 19 Nov 2018 09:49:39 GMT'}]",2018-11-20,"[['Zou', 'Qiang', ''], ['Zhang', 'Juyong', ''], ['Deng', 'Bailin', ''], ['Zhao', 'Jibin', '']]","['iso-level tool path', 'globally optimal', 'PDE', 'iso-scallop', 'smooth']"
8833,2202.06428,Josue Tonelli-Cueto,"Alperen A. Erg\""ur, Josu\'e Tonelli-Cueto, Elias Tsigaridas",Beyond Worst-Case Analysis for Root Isolation Algorithms,"9 pages, 2 figures. 2nd version: New title, corrections. 3rd version:
  Correction of typo in name","Proceedings of the 2022 International Symposium on Symbolic and
  Algebraic Computation (ISSAC 22). Association for Computing Machinery, New
  York, NY, USA, 139-148 (2022)",10.1145/3476446.3535475,,cs.CC cs.SC math.AG math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Isolating the real roots of univariate polynomials is a fundamental problem
in symbolic computation and it is arguably one of the most important problems
in computational mathematics. The problem has a long history decorated with
numerous ingenious algorithms and furnishes an active area of research.
However, the worst-case analysis of root-finding algorithms does not correlate
with their practical performance. We develop a smoothed analysis framework for
polynomials with integer coefficients to bridge the gap between the complexity
estimates and the practical performance. In this setting, we derive that the
expected bit complexity of DESCARTES solver to isolate the real roots of a
polynomial, with coefficients uniformly distributed, is
$\widetilde{\mathcal{O}}_B(d^2 + d \tau)$, where $d$ is the degree of the
polynomial and $\tau$ the bitsize of the coefficients.
","[{'version': 'v1', 'created': 'Sun, 13 Feb 2022 22:28:12 GMT'}, {'version': 'v2', 'created': 'Tue, 3 May 2022 12:18:02 GMT'}, {'version': 'v3', 'created': 'Thu, 23 Jun 2022 20:10:16 GMT'}]",2022-09-28,"[['Ergür', 'Alperen A.', ''], ['Tonelli-Cueto', 'Josué', ''], ['Tsigaridas', 'Elias', '']]","['univariate polynomials', 'root-finding', 'Descartes solver', 'conditionbased complexity', 'average complexity', 'beyond worst-case analysis']"
8834,2111.00960,Piotr Gramacki,"Piotr Gramacki, Szymon Wo\'zniak, Piotr Szyma\'nski","gtfs2vec -- Learning GTFS Embeddings for comparing Public Transport
  Offer in Microregions","Accepted at 1st ACM SIGSPATIAL International Workshop on Searching
  and Mining Large Collections of Geospatial Data (GeoSearch 2021)",,10.1145/3486640.3491392,,cs.LG cs.AI,http://creativecommons.org/licenses/by-sa/4.0/,"  We selected 48 European cities and gathered their public transport timetables
in the GTFS format. We utilized Uber's H3 spatial index to divide each city
into hexagonal micro-regions. Based on the timetables data we created certain
features describing the quantity and variety of public transport availability
in each region. Next, we trained an auto-associative deep neural network to
embed each of the regions. Having such prepared representations, we then used a
hierarchical clustering approach to identify similar regions. To do so, we
utilized an agglomerative clustering algorithm with a euclidean distance
between regions and Ward's method to minimize in-cluster variance. Finally, we
analyzed the obtained clusters at different levels to identify some number of
clusters that qualitatively describe public transport availability. We showed
that our typology matches the characteristics of analyzed cities and allows
succesful searching for areas with similar public transport schedule
characteristics.
","[{'version': 'v1', 'created': 'Mon, 1 Nov 2021 14:10:55 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Nov 2021 22:33:21 GMT'}]",2021-11-04,"[['Gramacki', 'Piotr', ''], ['Woźniak', 'Szymon', ''], ['Szymański', 'Piotr', '']]","['public transport timetable embeddings', 'typology of public transportoffering', 'unsupervised representation learning']"
8835,2209.13718,Sanjana Chintalapati,"Sanjana Chintalapati, Jonathan Bragg, Lucy Lu Wang","A Dataset of Alt Texts from HCI Publications: Analyses and Uses Towards
  Producing More Descriptive Alt Texts of Data Visualizations in Scientific
  Papers","11 pages, 4 figures, 4 tables, published at ASSETS 2022",,10.1145/3517428.3544796,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Figures in scientific publications contain important information and results,
and alt text is needed for blind and low vision readers to engage with their
content. We conduct a study to characterize the semantic content of alt text in
HCI publications based on a framework introduced by Lundgard and Satyanarayan.
Our study focuses on alt text for graphs, charts, and plots extracted from HCI
and accessibility publications; we focus on these communities due to the lack
of alt text in papers published outside of these disciplines. We find that the
capacity of author-written alt text to fulfill blind and low vision user needs
is mixed; for example, only 50% of alt texts in our sample contain information
about extrema or outliers, and only 31% contain information about major trends
or comparisons conveyed by the graph. We release our collected dataset of
author-written alt text, and outline possible ways that it can be used to
develop tools and models to assist future authors in writing better alt text.
Based on our findings, we also discuss recommendations that can be acted upon
by publishers and authors to encourage inclusion of more types of semantic
content in alt text.
","[{'version': 'v1', 'created': 'Tue, 27 Sep 2022 22:06:04 GMT'}]",2022-09-29,"[['Chintalapati', 'Sanjana', ''], ['Bragg', 'Jonathan', ''], ['Wang', 'Lucy Lu', '']]","['accessibility', 'scientific documents', 'alt text', 'dataset']"
8836,2103.03438,Tao Zhang,"Mengting Xu, Tao Zhang, Zhongnian Li, Mingxia Liu, Daoqiang Zhang","Towards Evaluating the Robustness of Deep Diagnostic Models by
  Adversarial Attack","This version was accepted in the journal Medical Image Analysis
  (MedIA)",Medical Image Analysis 69 (2021): 101977,10.1016/j.media.2021.101977,,cs.CV cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Deep learning models (with neural networks) have been widely used in
challenging tasks such as computer-aided disease diagnosis based on medical
images. Recent studies have shown deep diagnostic models may not be robust in
the inference process and may pose severe security concerns in clinical
practice. Among all the factors that make the model not robust, the most
serious one is adversarial examples. The so-called ""adversarial example"" is a
well-designed perturbation that is not easily perceived by humans but results
in a false output of deep diagnostic models with high confidence. In this
paper, we evaluate the robustness of deep diagnostic models by adversarial
attack. Specifically, we have performed two types of adversarial attacks to
three deep diagnostic models in both single-label and multi-label
classification tasks, and found that these models are not reliable when
attacked by adversarial example. We have further explored how adversarial
examples attack the models, by analyzing their quantitative classification
results, intermediate features, discriminability of features and correlation of
estimated labels for both original/clean images and those adversarial ones. We
have also designed two new defense methods to handle adversarial examples in
deep diagnostic models, i.e., Multi-Perturbations Adversarial Training (MPAdvT)
and Misclassification-Aware Adversarial Training (MAAdvT). The experimental
results have shown that the use of defense methods can significantly improve
the robustness of deep diagnostic models against adversarial attacks.
","[{'version': 'v1', 'created': 'Fri, 5 Mar 2021 02:24:47 GMT'}]",2021-03-08,"[['Xu', 'Mengting', ''], ['Zhang', 'Tao', ''], ['Li', 'Zhongnian', ''], ['Liu', 'Mingxia', ''], ['Zhang', 'Daoqiang', '']]","['Deep diagnostic models', 'adversarial attack', 'defense', 'robustness']"
8837,2003.03237,Kunihiro Noda,"Kunihiro Noda, Takashi Kobayashi, Kiyoshi Agusa","Constructing Object Groups Corresponding to Concepts for Recovery of a
  Summarized Sequence Diagram",Accepted to appear in Journal of Information Processing,"Journal of Information Processing, vol.29, pp.305--320, 2021",10.2197/ipsjjip.29.305,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Comprehending the behavior of an object-oriented system solely from its
source code is troublesome, owing to its dynamism. To aid comprehension,
visualizing program behavior through reverse-engineered sequence diagrams from
execution traces is a promising approach. However, because of the massiveness
of traces, recovered diagrams tend to become very large, causing scalability
issues. To address the issues, we propose an object grouping technique that
horizontally summarizes a reverse-engineered sequence diagram. Our technique
constructs object groups based on Pree's meta patterns, in which each group
corresponds to a concept in the domain of a subject system. Visualizing
interactions only among important groups, we generate a summarized sequence
diagram depicting a behavioral overview of the system. Our experiment showed
that our technique outperformed the state-of-the-art trace summarization
technique in terms of reducing the horizontal size of reverse-engineered
sequence diagrams. Regarding the quality of object grouping, our technique
achieved an F-score of 0.670 and a Recall of 0.793 on average under the
condition of #lifelines (i.e., the horizontal size of a sequence diagram) < 30,
whereas those of the state-of-the-art technique were 0.421 and 0.670,
respectively. The runtime overhead imposed by our technique was 129.2% on
average, which is relatively smaller in the literature.
","[{'version': 'v1', 'created': 'Fri, 6 Mar 2020 14:30:35 GMT'}, {'version': 'v2', 'created': 'Sun, 1 Aug 2021 07:22:35 GMT'}]",2021-08-03,"[['Noda', 'Kunihiro', ''], ['Kobayashi', 'Takashi', ''], ['Agusa', 'Kiyoshi', '']]","['reverse-engineered sequence diagram', 'trace summarization', 'object grouping', 'meta patterns', 'programcomprehension']"
8838,2110.01450,Sho Shirasaka,"Hiroaki Terao, Sho Shirasaka and Hideyuki Suzuki","Extended dynamic mode decomposition with dictionary learning using
  neural ordinary differential equations","Corrigendum: The loss function in Eq. (20) is not what we have used
  in our code. Please replace the sum of squared error in Eq. (20) with the
  mean squared error","Nonlinear Theory and Its Applications, IEICE, vol. 12, no. 4, pp.
  626-638, 2021",10.1587/nolta.12.626,,cs.LG cs.NA eess.SP math.DS math.NA nlin.CD physics.data-an,http://creativecommons.org/licenses/by/4.0/,"  Nonlinear phenomena can be analyzed via linear techniques using
operator-theoretic approaches. Data-driven method called the extended dynamic
mode decomposition (EDMD) and its variants, which approximate the Koopman
operator associated with the nonlinear phenomena, have been rapidly developing
by incorporating machine learning methods. Neural ordinary differential
equations (NODEs), which are a neural network equipped with a continuum of
layers, and have high parameter and memory efficiencies, have been proposed. In
this paper, we propose an algorithm to perform EDMD using NODEs. NODEs are used
to find a parameter-efficient dictionary which provides a good
finite-dimensional approximation of the Koopman operator. We show the
superiority of the parameter efficiency of the proposed method through
numerical experiments.
","[{'version': 'v1', 'created': 'Fri, 1 Oct 2021 06:56:14 GMT'}, {'version': 'v2', 'created': 'Tue, 17 May 2022 04:53:20 GMT'}]",2022-05-18,"[['Terao', 'Hiroaki', ''], ['Shirasaka', 'Sho', ''], ['Suzuki', 'Hideyuki', '']]","['time series analysis', 'Koopman operator', 'extended dynamic mode decomposition', 'machine learning', 'dictionary learning', 'neural ordinary differential equations']"
8839,2009.09352,Dong Xu,"Dong Xu, Chao Meng, Qingpeng Zhang, Puneet Bhardwaj, Young-Jun Son","A Hybrid Simulation-based Duopoly Game Framework for Analysis of Supply
  Chain and Marketing Activities","39 pages, 10 figures, 9 tables","In chapter 11 of book ""Applications of Multi-Criteria and Game
  Theory Approaches"" published by Springer-Verlag and edited by L. Benyoucef et
  al. (eds.), 2013",10.1007/978-1-4471-5295-8,,cs.GT cs.SY eess.SY stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A hybrid simulation-based framework involving system dynamics and agent-based
simulation is proposed to address duopoly game considering multiple strategic
decision variables and rich payoff, which cannot be addressed by traditional
approaches involving closed-form equations. While system dynamics models are
used to represent integrated production, logistics, and pricing determination
activities of duopoly companies, agent-based simulation is used to mimic
enhanced consumer purchasing behavior considering advertisement, promotion
effect, and acquaintance recommendation in the consumer social network. The
payoff function of the duopoly companies is assumed to be the net profit based
on the total revenue and various cost items such as raw material, production,
transportation, inventory and backorder. A unique procedure is proposed to
solve and analyze the proposed simulation-based game, where the procedural
components include strategy refinement, data sampling, gaming solving, and
performance evaluation. First, design of experiment and estimated
conformational value of information techniques are employed for strategy
refinement and data sampling, respectively. Game solving then focuses on pure
strategy equilibriums, and performance evaluation addresses game stability,
equilibrium strictness, and robustness. A hypothetical case scenario involving
soft-drink duopoly on Coke and Pepsi is considered to illustrate and
demonstrate the proposed approach. Final results include P-values of
statistical tests, confidence intervals, and simulation steady state analysis
for different pure equilibriums.
","[{'version': 'v1', 'created': 'Sun, 20 Sep 2020 05:18:44 GMT'}]",2020-09-22,"[['Xu', 'Dong', ''], ['Meng', 'Chao', ''], ['Zhang', 'Qingpeng', ''], ['Bhardwaj', 'Puneet', ''], ['Son', 'Young-Jun', '']]","['Simulation-based game', 'system dynamics', 'agent-based simulation', 'equilibrium', 'soft-drink duopoly']"
8840,1909.10912,Viet Anh Tran,"Viet-Anh Tran, Romain Hennequin, Jimena Royo-Letelier, Manuel
  Moussallam",Improving Collaborative Metric Learning with Efficient Negative Sampling,SIGIR 2019,,10.1145/3331184.3331337,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distance metric learning based on triplet loss has been applied with success
in a wide range of applications such as face recognition, image retrieval,
speaker change detection and recently recommendation with the CML model.
However, as we show in this article, CML requires large batches to work
reasonably well because of a too simplistic uniform negative sampling strategy
for selecting triplets. Due to memory limitations, this makes it difficult to
scale in high-dimensional scenarios. To alleviate this problem, we propose here
a 2-stage negative sampling strategy which finds triplets that are highly
informative for learning. Our strategy allows CML to work effectively in terms
of accuracy and popularity bias, even when the batch size is an order of
magnitude smaller than what would be needed with the default uniform sampling.
We demonstrate the suitability of the proposed strategy for recommendation and
exhibit consistent positive results across various datasets.
","[{'version': 'v1', 'created': 'Tue, 24 Sep 2019 13:37:49 GMT'}]",2019-09-25,"[['Tran', 'Viet-Anh', ''], ['Hennequin', 'Romain', ''], ['Royo-Letelier', 'Jimena', ''], ['Moussallam', 'Manuel', '']]","['Recommender Systems', 'Collaborative Filtering', 'Triplet Loss', 'Metric Learning']"
8841,1906.06582,"Christoph Benzm\""uller","David Fuenmayor and Christoph Benzm\""uller",A Computational-Hermeneutic Approach for Conceptual Explicitation,"29 pages, 9 figures, to appear in A. Nepomuceno, L. Magnani, F.
  Salguero, C. Bar\'es, M. Fontaine (eds.), Model-Based Reasoning in Science
  and Technology. Inferential Models for Logic, Language, Cognition and
  Computation, Series ""Sapere"", Springer",,10.1007/978-3-030-32722-4_25,,cs.AI cs.CL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a computer-supported approach for the logical analysis and
conceptual explicitation of argumentative discourse. Computational hermeneutics
harnesses recent progresses in automated reasoning for higher-order logics and
aims at formalizing natural-language argumentative discourse using flexible
combinations of expressive non-classical logics. In doing so, it allows us to
render explicit the tacit conceptualizations implicit in argumentative
discursive practices. Our approach operates on networks of structured arguments
and is iterative and two-layered. At one layer we search for logically correct
formalizations for each of the individual arguments. At the next layer we
select among those correct formalizations the ones which honor the argument's
dialectic role, i.e. attacking or supporting other arguments as intended. We
operate at these two layers in parallel and continuously rate sentences'
formalizations by using, primarily, inferential adequacy criteria. An
interpretive, logical theory will thus gradually evolve. This theory is
composed of meaning postulates serving as explications for concepts playing a
role in the analyzed arguments. Such a recursive, iterative approach to
interpretation does justice to the inherent circularity of understanding: the
whole is understood compositionally on the basis of its parts, while each part
is understood only in the context of the whole (hermeneutic circle). We
summarily discuss previous work on exemplary applications of human-in-the-loop
computational hermeneutics in metaphysical discourse. We also discuss some of
the main challenges involved in fully-automating our approach. By sketching
some design ideas and reviewing relevant technologies, we argue for the
technological feasibility of a highly-automated computational hermeneutics.
","[{'version': 'v1', 'created': 'Sat, 15 Jun 2019 15:57:57 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Jul 2019 09:49:19 GMT'}]",2022-12-12,"[['Fuenmayor', 'David', ''], ['Benzmüller', 'Christoph', '']]","['computational philosophy', 'higher-order logic', 'theorem proving', 'logical analysis', 'hermeneutics', 'explication']"
8842,1909.07865,Daniele De Sensi,"Daniele De Sensi, Salvatore Di Girolamo, Torsten Hoefler","Mitigating Network Noise on Dragonfly Networks through Application-Aware
  Routing","Accepted at The International Conference for High Performance
  Computing Networking, Storage, and Analysis (SC '19)","Published in Proceedings of The International Conference for High
  Performance Computing Networking, Storage, and Analysis (SC '19) (2019)",10.1145/3295500.3356196,,cs.DC cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  System noise can negatively impact the performance of HPC systems, and the
interconnection network is one of the main factors contributing to this
problem. To mitigate this effect, adaptive routing sends packets on non-minimal
paths if they are less congested. However, while this may mitigate interference
caused by congestion, it also generates more traffic since packets traverse
additional hops, causing in turn congestion on other applications and on the
application itself. In this paper, we first describe how to estimate network
noise. By following these guidelines, we show how noise can be reduced by using
routing algorithms which select minimal paths with a higher probability. We
exploit this knowledge to design an algorithm which changes the probability of
selecting minimal paths according to the application characteristics. We
validate our solution on microbenchmarks and real-world applications on two
systems relying on a Dragonfly interconnection network, showing noise reduction
and performance improvement.
","[{'version': 'v1', 'created': 'Tue, 17 Sep 2019 14:54:09 GMT'}]",2019-09-18,"[['De Sensi', 'Daniele', ''], ['Di Girolamo', 'Salvatore', ''], ['Hoefler', 'Torsten', '']]","['network noise', 'dragonfly', 'routing']"
8843,2209.05757,Marek Gagolewski,"Marek Gagolewski, Maciej Bartoszuk, Anna Cena","Genie: A new, fast, and outlier-resistant hierarchical clustering
  algorithm",,"Information Sciences 363, 8-23, 2016",10.1016/j.ins.2016.05.003,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  The time needed to apply a hierarchical clustering algorithm is most often
dominated by the number of computations of a pairwise dissimilarity measure.
Such a constraint, for larger data sets, puts at a disadvantage the use of all
the classical linkage criteria but the single linkage one. However, it is known
that the single linkage clustering algorithm is very sensitive to outliers,
produces highly skewed dendrograms, and therefore usually does not reflect the
true underlying data structure -- unless the clusters are well-separated. To
overcome its limitations, we propose a new hierarchical clustering linkage
criterion called Genie. Namely, our algorithm links two clusters in such a way
that a chosen economic inequity measure (e.g., the Gini- or Bonferroni-index)
of the cluster sizes does not drastically increase above a given threshold. The
presented benchmarks indicate a high practical usefulness of the introduced
method: it most often outperforms the Ward or average linkage in terms of the
clustering quality while retaining the single linkage's speed. The Genie
algorithm is easily parallelizable and thus may be run on multiple threads to
speed up its execution even further. Its memory overhead is small: there is no
need to precompute the complete distance matrix to perform the computations in
order to obtain a desired clustering. It can be applied on arbitrary spaces
equipped with a dissimilarity measure, e.g., on real vectors, DNA or protein
sequences, images, rankings, informetric data, etc. A reference implementation
of the algorithm has been included in the open source 'genie' package for R.
See also https://genieclust.gagolewski.com for a new implementation
(genieclust) -- available for both R and Python.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2022 06:42:53 GMT'}]",2022-09-14,"[['Gagolewski', 'Marek', ''], ['Bartoszuk', 'Maciej', ''], ['Cena', 'Anna', '']]","['hierarchical clustering', 'single linkage', 'inequity measures', 'Gini-index']"
8844,1707.00432,Daniel Graziotin,"Daniel Graziotin, Fabian Fagerholm, Xiaofeng Wang, Pekka Abrahamsson",What happens when software developers are (un)happy,"18 pages, 2 figures","Journal of Systems and Software (2018), 140, 32-47",10.1016/j.jss.2018.02.041,,cs.SE cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The growing literature on affect among software developers mostly reports on
the linkage between happiness, software quality, and developer productivity.
Understanding happiness and unhappiness in all its components -- positive and
negative emotions and moods -- is an attractive and important endeavor.
Scholars in industrial and organizational psychology have suggested that
understanding happiness and unhappiness could lead to cost-effective ways of
enhancing working conditions, job performance, and to limiting the occurrence
of psychological disorders. Our comprehension of the consequences of
(un)happiness among developers is still too shallow, being mainly expressed in
terms of development productivity and software quality. In this paper, we study
what happens when developers are happy and unhappy while developing software.
Qualitative data analysis of responses given by 317 questionnaire participants
identified 42 consequences of unhappiness and 32 of happiness. We found
consequences of happiness and unhappiness that are beneficial and detrimental
for developers' mental well-being, the software development process, and the
produced artifacts. Our classification scheme, available as open data enables
new happiness research opportunities of cause-effect type, and it can act as a
guideline for practitioners for identifying damaging effects of unhappiness and
for fostering happiness on the job.
","[{'version': 'v1', 'created': 'Mon, 3 Jul 2017 07:48:08 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Dec 2017 11:00:02 GMT'}, {'version': 'v3', 'created': 'Mon, 23 Apr 2018 15:13:45 GMT'}]",2018-04-24,"[['Graziotin', 'Daniel', ''], ['Fagerholm', 'Fabian', ''], ['Wang', 'Xiaofeng', ''], ['Abrahamsson', 'Pekka', '']]","['behavioral software engineering', 'developer experience', 'human aspects', 'happiness', 'affect', 'emotion']"
8845,2206.02575,Bernhard Mehlig,"L. Storm, K. Gustavsson, B. Mehlig",Constraints on parameter choices for successful reservoir computing,"16 pages, 4 figures",Mach. Learn. Sci. Technol. 3 (2022) 045021,10.1088/2632-2153/aca1f6.,,cs.LG cs.NE nlin.CD,http://creativecommons.org/licenses/by/4.0/,"  Echo-state networks are simple models of discrete dynamical systems driven by
a time series. By selecting network parameters such that the dynamics of the
network is contractive, characterized by a negative maximal Lyapunov exponent,
the network may synchronize with the driving signal. Exploiting this
synchronization, the echo-state network may be trained to autonomously
reproduce the input dynamics, enabling time-series prediction. However, while
synchronization is a necessary condition for prediction, it is not sufficient.
Here, we study what other conditions are necessary for successful time-series
prediction. We identify two key parameters for prediction performance, and
conduct a parameter sweep to find regions where prediction is successful. These
regions differ significantly depending on whether full or partial phase space
information about the input is provided to the network during training. We
explain how these regions emerge.
","[{'version': 'v1', 'created': 'Fri, 3 Jun 2022 12:10:48 GMT'}]",2022-12-06,"[['Storm', 'L.', ''], ['Gustavsson', 'K.', ''], ['Mehlig', 'B.', '']]","['reservoir computing', 'dynamical systems', 'Lyapunov exponent']"
8846,2106.02984,Md Faysal Kabir,"Md Faysal Kabir, Sahadev Roy",Design of hazard based model and collision avoidance system,,"Journal of Critical Reviews,2020, 7(9):5979-5989",10.31838/jcr.07.19.693,,cs.RO,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The primary goal of this paper is to examine the motorcyclists' activities
during the overtaking period, as well as to develop a model of total overtaking
time. For the experimental study, instrumented motorcycles were used to collect
data and design an overall overtaking period model. The possibility of death
during an attempt to overtake is maximum for people walking on rural roads,
mainly identified by a scarcity of pathways and higher speeds of vehicles. It
is important to recognize and prototype driver actions during the overtaking
moves to set up collision avoidance strategies in order to prevent these
collisions, such that device adjustments are acceptable as they occur beyond
the comfort zone of the drivers. The purpose of this research is to address
both vehicle overtaking movements along urban roads and to develop a collision
avoidance system. This research, based on tests performed and instrumented
driving information, may lead to the discovery of advanced driver assistance
systems, analyzing driver behavior during overtaking. A total of 500 overtaking
movements were registered with 50 motorcycles set up with a high-resolution
camera and GPS system implemented by 50 professional bikers in India in an
undivided one-way road. A technique was developed to collect data explaining
the actions of the motorcyclists, based on video and GPS analyses. The overall
overtaking period was designed using a risk-based model, which indicates the
span of the overtaking based on several coefficients. The proposed model is
useful to analyze the behavior during overtaking moves, as well as to develop
road and vehicle safety systems to reduce the chances of accidents.
","[{'version': 'v1', 'created': 'Sat, 5 Jun 2021 23:32:46 GMT'}]",2021-06-08,"[['Kabir', 'Md Faysal', ''], ['Roy', 'Sahadev', '']]","['Collision avoidance system', 'GPS', 'Hazard based model', 'Image processing', 'Overtaking process']"
8847,2111.10093,Chenglin Li,"Chenglin Li, Mingjun Zhao, Huanming Zhang, Chenyun Yu, Lei Cheng,
  Guoqiang Shu, Beibei Kong, Di Niu","RecGURU: Adversarial Learning of Generalized User Representations for
  Cross-Domain Recommendation","11 pages, 2 figures, 4 tables, Proceedings of the Fifteenth ACM
  International Conference on Web Search and Data Mining",,10.1145/3488560.3498388,,cs.IR cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Cross-domain recommendation can help alleviate the data sparsity issue in
traditional sequential recommender systems. In this paper, we propose the
RecGURU algorithm framework to generate a Generalized User Representation (GUR)
incorporating user information across domains in sequential recommendation,
even when there is minimum or no common users in the two domains. We propose a
self-attentive autoencoder to derive latent user representations, and a domain
discriminator, which aims to predict the origin domain of a generated latent
representation. We propose a novel adversarial learning method to train the two
modules to unify user embeddings generated from different domains into a single
global GUR for each user. The learned GUR captures the overall preferences and
characteristics of a user and thus can be used to augment the behavior data and
improve recommendations in any single domain in which the user is involved.
Extensive experiments have been conducted on two public cross-domain
recommendation datasets as well as a large dataset collected from real-world
applications. The results demonstrate that RecGURU boosts performance and
outperforms various state-of-the-art sequential recommendation and cross-domain
recommendation methods. The collected data will be released to facilitate
future research.
","[{'version': 'v1', 'created': 'Fri, 19 Nov 2021 08:41:06 GMT'}]",2021-11-22,"[['Li', 'Chenglin', ''], ['Zhao', 'Mingjun', ''], ['Zhang', 'Huanming', ''], ['Yu', 'Chenyun', ''], ['Cheng', 'Lei', ''], ['Shu', 'Guoqiang', ''], ['Kong', 'Beibei', ''], ['Niu', 'Di', '']]","['Cross-Domain Recommendation', 'Sequential Recommendation', 'Learning Representation', 'Autoencoder', 'Adversarial Learning']"
8848,2001.05364,Falko Hegerfeld,Falko Hegerfeld and Stefan Kratsch,"Solving connectivity problems parameterized by treedepth in
  single-exponential time and polynomial space",27 pages; accepted at STACS 2020,,10.4230/LIPIcs.STACS.2020.29,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A breakthrough result of Cygan et al. (FOCS 2011) showed that connectivity
problems parameterized by treewidth can be solved much faster than the
previously best known time $\mathcal{O}^*(2^{\mathcal{O}(tw \log(tw))})$. Using
their inspired Cut\&Count technique, they obtained $\mathcal{O}^*(\alpha^{tw})$
time algorithms for many such problems. Moreover, they proved these running
times to be optimal assuming the Strong Exponential-Time Hypothesis.
Unfortunately, like other dynamic programming algorithms on tree
decompositions, these algorithms also require exponential space, and this is
widely believed to be unavoidable. In contrast, for the slightly larger
parameter called treedepth, there are already several examples of algorithms
matching the time bounds obtained for treewidth, but using only polynomial
space. Nevertheless, this has remained open for connectivity problems.
  In the present work, we close this knowledge gap by applying the Cut\&Count
technique to graphs of small treedepth. While the general idea is unchanged, we
have to design novel procedures for counting consistently cut solution
candidates using only polynomial space. Concretely, we obtain time
$\mathcal{O}^*(3^d)$ and polynomial space for Connected Vertex Cover, Feedback
Vertex Set, and Steiner Tree on graphs of treedepth $d$. Similarly, we obtain
time $\mathcal{O}^*(4^d)$ and polynomial space for Connected Dominating Set and
Connected Odd Cycle Transversal.
","[{'version': 'v1', 'created': 'Wed, 15 Jan 2020 15:07:24 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Jun 2021 12:11:36 GMT'}]",2021-06-28,"[['Hegerfeld', 'Falko', ''], ['Kratsch', 'Stefan', '']]","['Parameterized Complexity', 'Connectivity', 'Treedepth', 'Cut&Count', 'PolynomialSpace']"
8849,1906.09050,Kate Donahue,"Kate Donahue, Jon Kleinberg",Fairness and Utilization in Allocating Resources with Uncertain Demand,"Accepted for presentation and archival submission at FAT* 2020.
  Accepted for oral presentation at MD4SG 2019",,10.1145/3351095.3372847,,cs.DS cs.CY cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Resource allocation problems are a fundamental domain in which to evaluate
the fairness properties of algorithms. The trade-offs between fairness and
utilization have a long history in this domain. A recent line of work has
considered fairness questions for resource allocation when the demands for the
resource are distributed across multiple groups and drawn from probability
distributions. In such cases, a natural fairness requirement is that
individuals from different groups should have (approximately) equal
probabilities of receiving the resource. A largely open question in this area
has been to bound the gap between the maximum possible utilization of the
resource and the maximum possible utilization subject to this fairness
condition.
  Here, we obtain some of the first provable upper bounds on this gap. We
obtain an upper bound for arbitrary distributions, as well as much stronger
upper bounds for specific families of distributions that are typically used to
model levels of demand. In particular, we find - somewhat surprisingly - that
there are natural families of distributions (including Exponential and Weibull)
for which the gap is non-existent: it is possible to simultaneously achieve
maximum utilization and the given notion of fairness. Finally, we show that for
power-law distributions, there is a non-trivial gap between the solutions, but
this gap can be bounded by a constant factor independent of the parameters of
the distribution.
","[{'version': 'v1', 'created': 'Fri, 21 Jun 2019 10:35:23 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Dec 2019 19:34:35 GMT'}]",2020-10-20,"[['Donahue', 'Kate', ''], ['Kleinberg', 'Jon', '']]","['resource allocation', 'algorithmic fairness', 'uncertainty', 'Weibull distribution', 'power law distribution']"
8850,2012.14678,Shuang Xu,"Shuang Xu and Lizhen Ji and Zhe Wang and Pengfei Li and Kai Sun and
  Chunxia Zhang and Jiangshe Zhang","Towards Reducing Severe Defocus Spread Effects for Multi-Focus Image
  Fusion via an Optimization Based Strategy",,"IEEE Transactions on Computational Imaging, vol. 6, pp. 1561-1570,
  2020",10.1109/TCI.2020.3039564,,cs.CV eess.IV,http://creativecommons.org/licenses/by/4.0/,"  Multi-focus image fusion (MFF) is a popular technique to generate an
all-in-focus image, where all objects in the scene are sharp. However, existing
methods pay little attention to defocus spread effects of the real-world
multi-focus images. Consequently, most of the methods perform badly in the
areas near focus map boundaries. According to the idea that each local region
in the fused image should be similar to the sharpest one among source images,
this paper presents an optimization-based approach to reduce defocus spread
effects. Firstly, a new MFF assessmentmetric is presented by combining the
principle of structure similarity and detected focus maps. Then, MFF problem is
cast into maximizing this metric. The optimization is solved by gradient
ascent. Experiments conducted on the real-world dataset verify superiority of
the proposed model. The codes are available at
https://github.com/xsxjtu/MFF-SSIM.
","[{'version': 'v1', 'created': 'Tue, 29 Dec 2020 09:26:41 GMT'}]",2021-02-02,"[['Xu', 'Shuang', ''], ['Ji', 'Lizhen', ''], ['Wang', 'Zhe', ''], ['Li', 'Pengfei', ''], ['Sun', 'Kai', ''], ['Zhang', 'Chunxia', ''], ['Zhang', 'Jiangshe', '']]","['multi-focus image fusion', 'defocus spread effect', 'structure similarity']"
8851,2108.07188,Mohammad Ghafari,"Pascal Gadient and Marc-Andrea Tarnutzer and Oscar Nierstrasz and
  Mohammad Ghafari",Security Smells Pervade Mobile App Servers,"ACM / IEEE International Symposium on Empirical Software Engineering
  and Measurement (ESEM 2021)",,10.1145/3475716.3475780,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  [Background] Web communication is universal in cyberspace, and security risks
in this domain are devastating. [Aims] We analyzed the prevalence of six
security smells in mobile app servers, and we investigated the consequence of
these smells from a security perspective. [Method] We used an existing dataset
that includes 9714 distinct URLs used in 3376 Android mobile apps. We exercised
these URLs twice within 14 months and investigated the HTTP headers and bodies.
[Results] We found that more than 69% of tested apps suffer from three kinds of
security smells, and that unprotected communication and misconfigurations are
very common in servers. Moreover, source-code and version leaks, or the lack of
update policies expose app servers to security risks. [Conclusions] Poor app
server maintenance greatly hampers security.
","[{'version': 'v1', 'created': 'Mon, 16 Aug 2021 15:50:18 GMT'}]",2021-08-17,"[['Gadient', 'Pascal', ''], ['Tarnutzer', 'Marc-Andrea', ''], ['Nierstrasz', 'Oscar', ''], ['Ghafari', 'Mohammad', '']]","['security smells', 'web communication', 'mobile apps']"
8852,2104.15137,Nicholas Alonso,Nick Alonso and Emre Neftci,"Tightening the Biological Constraints on Gradient-Based Predictive
  Coding","This is a preprint of a published article. For final, published
  version see https://doi.org/10.1145/3477145.3477148",,10.1145/3477145.3477148,,cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Predictive coding (PC) is a general theory of cortical function. The local,
gradient-based learning rules found in one kind of PC model have recently been
shown to closely approximate backpropagation. This finding suggests that this
gradient-based PC model may be useful for understanding how the brain solves
the credit assignment problem. The model may also be useful for developing
local learning algorithms that are compatible with neuromorphic hardware. In
this paper, we modify this PC model so that it better fits biological
constraints, including the constraints that neurons can only have positive
firing rates and the constraint that synapses only flow in one direction. We
also compute the gradient-based weight and activity updates given the modified
activity values. We show that, under certain conditions, these modified PC
networks perform as well or nearly as well on MNIST data as the unmodified PC
model and networks trained with backpropagation.
","[{'version': 'v1', 'created': 'Fri, 30 Apr 2021 17:56:00 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Dec 2021 17:28:50 GMT'}]",2021-12-09,"[['Alonso', 'Nick', ''], ['Neftci', 'Emre', '']]","['Predictive Coding', 'Gradient-based Learning', 'Local Learning', 'SynapticPlasticity']"
8853,2108.03592,Emmanuel Senft,"Emmanuel Senft, Michael Hagenow, Robert Radwin, Michael Zinn, Michael
  Gleicher, Bilge Mutlu",Situated Live Programming for Human-Robot Collaboration,"Accepted at UIST 2021, October 10-14, 2021, Virtual Event, USA",,10.1145/3472749.3474773,,cs.RO cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present situated live programming for human-robot collaboration, an
approach that enables users with limited programming experience to program
collaborative applications for human-robot interaction. Allowing end users,
such as shop floor workers, to program collaborative robots themselves would
make it easy to ""retask"" robots from one process to another, facilitating their
adoption by small and medium enterprises. Our approach builds on the paradigm
of trigger-action programming (TAP) by allowing end users to create rich
interactions through simple trigger-action pairings. It enables end users to
iteratively create, edit, and refine a reactive robot program while executing
partial programs. This live programming approach enables the user to utilize
the task space and objects by incrementally specifying situated trigger-action
pairs, substantially lowering the barrier to entry for programming or
reprogramming robots for collaboration. We instantiate situated live
programming in an authoring system where users can create trigger-action
programs by annotating an augmented video feed from the robot's perspective and
assign robot actions to trigger conditions. We evaluated this system in a study
where participants (n = 10) developed robot programs for solving collaborative
light-manufacturing tasks. Results showed that users with little programming
experience were able to program HRC tasks in an interactive fashion and our
situated live programming approach further supported individualized strategies
and workflows. We conclude by discussing opportunities and limitations of the
proposed approach, our system implementation, and our study and discuss a
roadmap for expanding this approach to a broader range of tasks and
applications.
","[{'version': 'v1', 'created': 'Sun, 8 Aug 2021 09:01:40 GMT'}]",2021-08-10,"[['Senft', 'Emmanuel', ''], ['Hagenow', 'Michael', ''], ['Radwin', 'Robert', ''], ['Zinn', 'Michael', ''], ['Gleicher', 'Michael', ''], ['Mutlu', 'Bilge', '']]","['human-robot interaction', 'human-robot collaboration', 'trigger-actionprogramming', 'end-user programming']"
8854,2209.09070,Timm Haucke,"Timm Haucke, Hjalmar S. K\""uhl, Volker Steinhage",SOCRATES: A Stereo Camera Trap for Monitoring of Biodiversity,,"Sensors 2022, 22(23), 9082",10.3390/s22239082,,cs.CV cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The development and application of modern technology is an essential basis
for the efficient monitoring of species in natural habitats and landscapes to
trace the development of ecosystems, species communities, and populations, and
to analyze reasons of changes. For estimating animal abundance using methods
such as camera trap distance sampling, spatial information of natural habitats
in terms of 3D (three-dimensional) measurements is crucial. Additionally, 3D
information improves the accuracy of animal detection using camera trapping.
This study presents a novel approach to 3D camera trapping featuring highly
optimized hardware and software. This approach employs stereo vision to infer
3D information of natural habitats and is designated as StereO CameRA Trap for
monitoring of biodivErSity (SOCRATES). A comprehensive evaluation of SOCRATES
shows not only a $3.23\%$ improvement in animal detection (bounding box
$\text{mAP}_{75}$) but also its superior applicability for estimating animal
abundance using camera trap distance sampling. The software and documentation
of SOCRATES is provided at https://github.com/timmh/socrates
","[{'version': 'v1', 'created': 'Mon, 19 Sep 2022 15:03:35 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Oct 2022 20:46:13 GMT'}]",2022-11-24,"[['Haucke', 'Timm', ''], ['Kühl', 'Hjalmar S.', ''], ['Steinhage', 'Volker', '']]","['stereo vision', 'camera trapping', 'animal density', 'animal abundance', 'instance segmentation']"
8855,2208.14613,Naser Al Madi,Naser Al Madi,"How Readable is Model-generated Code? Examining Readability and Visual
  Inspection of GitHub Copilot",,,10.1145/3551349.3560438,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Recent advancements in large language models have motivated the
practical use of such models in code generation and program synthesis. However,
little is known about the effects of such tools on code readability and visual
attention in practice.
  Objective: In this paper, we focus on GitHub Copilot to address the issues of
readability and visual inspection of model generated code. Readability and low
complexity are vital aspects of good source code, and visual inspection of
generated code is important in light of automation bias.
  Method: Through a human experiment (n=21) we compare model generated code to
code written completely by human programmers. We use a combination of static
code analysis and human annotators to assess code readability, and we use eye
tracking to assess the visual inspection of code.
  Results: Our results suggest that model generated code is comparable in
complexity and readability to code written by human pair programmers. At the
same time, eye tracking data suggests, to a statistically significant level,
that programmers direct less visual attention to model generated code.
  Conclusion: Our findings highlight that reading code is more important than
ever, and programmers should beware of complacency and automation bias with
model generated code.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2022 03:21:31 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Sep 2022 01:50:04 GMT'}]",2022-09-02,"[['Madi', 'Naser Al', '']]","['GitHub', 'Copilot', 'Readability', 'Eye Tracking', 'Empirical Study']"
8856,1804.00482,Spiros Georgakopoulos,"Sotiris K. Tasoulis, Aristidis G. Vrahatis, Spiros V. Georgakopoulos,
  Vassilis P. Plagianakos",Real Time Sentiment Change Detection of Twitter Data Streams,,,10.1109/INISTA.2018.8466326,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the past few years, there has been a huge growth in Twitter sentiment
analysis having already provided a fair amount of research on sentiment
detection of public opinion among Twitter users. Given the fact that Twitter
messages are generated constantly with dizzying rates, a huge volume of
streaming data is created, thus there is an imperative need for accurate
methods for knowledge discovery and mining of this information. Although there
exists a plethora of twitter sentiment analysis methods in the recent
literature, the researchers have shifted to real-time sentiment identification
on twitter streaming data, as expected. A major challenge is to deal with the
Big Data challenges arising in Twitter streaming applications concerning both
Volume and Velocity. Under this perspective, in this paper, a methodological
approach based on open source tools is provided for real-time detection of
changes in sentiment that is ultra efficient with respect to both memory
consumption and computational cost. This is achieved by iteratively collecting
tweets in real time and discarding them immediately after their process. For
this purpose, we employ the Lexicon approach for sentiment characterizations,
while change detection is achieved through appropriate control charts that do
not require historical information. We believe that the proposed methodology
provides the trigger for a potential large-scale monitoring of threads in an
attempt to discover fake news spread or propaganda efforts in their early
stages. Our experimental real-time analysis based on a recent hashtag provides
evidence that the proposed approach can detect meaningful sentiment changes
across a hashtags lifetime.
","[{'version': 'v1', 'created': 'Mon, 2 Apr 2018 13:31:11 GMT'}]",2019-02-15,"[['Tasoulis', 'Sotiris K.', ''], ['Vrahatis', 'Aristidis G.', ''], ['Georgakopoulos', 'Spiros V.', ''], ['Plagianakos', 'Vassilis P.', '']]","[', for example, Twitter hashtags', 'Data are retrieved inJSON format', 'are easily parsed using the ”rtweet” package']"
8857,2012.08559,Sergio Hidalgo-Espinoza,"Sergio Hidalgo-Espinoza and Kevin Chamorro-Cupueran and Oscar
  Chang-Tortolero","Intrusion detection in computer systems by using artificial neural
  networks with Deep Learning approaches",,"10th International Conference on Advances in Computing and
  Information Technology (ACITY 2020), November 28~29, 2020, London, United
  Kingdom Volume Editors : David C. Wyld, Dhinaharan Nagamalai (Eds) ISBN :
  978-1-925953-29-9",10.5121/csit.2020.101501,,cs.CR cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Intrusion detection into computer networks has become one of the most
important issues in cybersecurity. Attackers keep on researching and coding to
discover new vulnerabilities to penetrate information security system. In
consequence computer systems must be daily upgraded using up-to-date techniques
to keep hackers at bay. This paper focuses on the design and implementation of
an intrusion detection system based on Deep Learning architectures. As a first
step, a shallow network is trained with labelled log-in [into a computer
network] data taken from the Dataset CICIDS2017. The internal behaviour of this
network is carefully tracked and tuned by using plotting and exploring codes
until it reaches a functional peak in intrusion prediction accuracy. As a
second step, an autoencoder, trained with big unlabelled data, is used as a
middle processor which feeds compressed information and abstract representation
to the original shallow network. It is proven that the resultant deep
architecture has a better performance than any version of the shallow network
alone. The resultant functional code scripts, written in MATLAB, represent a
re-trainable system which has been proved using real data, producing good
precision and fast response.
","[{'version': 'v1', 'created': 'Tue, 15 Dec 2020 19:12:23 GMT'}]",2020-12-17,"[['Hidalgo-Espinoza', 'Sergio', ''], ['Chamorro-Cupueran', 'Kevin', ''], ['Chang-Tortolero', 'Oscar', '']]","['Artificial Neural Networks', 'Information Security', 'Deep Learning', 'intrusion detection & hacking attacks']"
8858,2104.01024,Burak Turhan,Seyedrebvar Hosseini and Burak Turhan,"A Comparison of Similarity Based Instance Selection Methods for Cross
  Project Defect Prediction","The 36th ACM/SIGAPP Symposium on Applied Computing (SAC'21), 10 pages",,10.1145/3412841.3442020,,cs.LG cs.AI cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Previous studies have shown that training data instance selection
based on nearest neighborhood (NN) information can lead to better performance
in cross project defect prediction (CPDP) by reducing heterogeneity in training
datasets. However, neighborhood calculation is computationally expensive and
approximate methods such as Locality Sensitive Hashing (LSH) can be as
effective as exact methods. Aim: We aim at comparing instance selection methods
for CPDP, namely LSH, NN-filter, and Genetic Instance Selection (GIS). Method:
We conduct experiments with five base learners, optimizing their hyper
parameters, on 13 datasets from PROMISE repository in order to compare the
performance of LSH with benchmark instance selection methods NN-Filter and GIS.
Results: The statistical tests show six distinct groups for F-measure
performance. The top two group contains only LSH and GIS benchmarks whereas the
bottom two groups contain only NN-Filter variants. LSH and GIS favor recall
more than precision. In fact, for precision performance only three
significantly distinct groups are detected by the tests where the top group is
comprised of NN-Filter variants only. Recall wise, 16 different groups are
identified where the top three groups contain only LSH methods, four of the
next six are GIS only and the bottom five contain only NN-Filter. Finally,
NN-Filter benchmarks never outperform the LSH counterparts with the same base
learner, tuned or non-tuned. Further, they never even belong to the same rank
group, meaning that LSH is always significantly better than NN-Filter with the
same learner and settings. Conclusions: The increase in performance and the
decrease in computational overhead and runtime make LSH a promising approach.
However, the performance of LSH is based on high recall and in environments
where precision is considered more important NN-Filter should be considered.
","[{'version': 'v1', 'created': 'Fri, 2 Apr 2021 12:50:44 GMT'}]",2021-04-05,"[['Hosseini', 'Seyedrebvar', ''], ['Turhan', 'Burak', '']]","['Cross Project Defect Prediction', 'Locality Sensitive Hashing', 'Approximate Near Neighbour', 'Search Based Optimisation', 'InstanceSelection']"
8859,2106.12458,Sarah E Carter,Sarah E. Carter,"Is Downloading this App Consistent with my Values? Conceptualizing a
  Value-Centered Privacy Assistant",,"I3E2021: Responsible AI and Analytics for an Ethical and Inclusive
  Digitized Society, Lecture Notes in Computer Science 12896 (2021) 285-291",10.1007/978-3-030-85447-8_25,,cs.CR cs.CY cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Digital privacy notices aim to provide users with information to make
informed decisions. They are, however, fraught with difficulties. Instead, I
propose that data privacy decisions can be understood as an expression of user
values. To optimize this value expression, I further propose the creation of a
value-centered privacy assistant (VcPA). Here, I preliminary explore how a VcPA
could enhance user value expression by utilizing three user scenarios in the
context of considering whether or not to download an environmental application,
the OpenLitterMap app. These scenarios are conceptually constructed from
established privacy user groups - the privacy fundamentalists; the privacy
pragmatists; and the privacy unconcerned. I conclude that the VcPA best
facilitates user value expression of the privacy fundamentalists. In contrast,
the value expression of the privacy pragmatists and the privacy unconcerned
could be enhanced or hindered depending on the context and their internal
states. Possible implications for optimal VcPA design are also discussed.
Following this initial conceptual exploration of VcPAs, further empirical
research will be required to demonstrate the effectiveness of the VcPA system
in real-world settings.
","[{'version': 'v1', 'created': 'Wed, 23 Jun 2021 15:08:58 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Aug 2021 11:26:26 GMT'}]",2021-08-26,"[['Carter', 'Sarah E.', '']]","['Privacy Assistant', 'Mobile Applications', 'Values  Introduction']"
8860,2109.09654,Deqiang Li,Deqiang Li and Tian Qiu and Shuo Chen and Qianmu Li and Shouhuai Xu,"Can We Leverage Predictive Uncertainty to Detect Dataset Shift and
  Adversarial Examples in Android Malware Detection?",Accepted by ACSAC'2021,,10.1145/3485832.3485916,,cs.CR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The deep learning approach to detecting malicious software (malware) is
promising but has yet to tackle the problem of dataset shift, namely that the
joint distribution of examples and their labels associated with the test set is
different from that of the training set. This problem causes the degradation of
deep learning models without users' notice. In order to alleviate the problem,
one approach is to let a classifier not only predict the label on a given
example but also present its uncertainty (or confidence) on the predicted
label, whereby a defender can decide whether to use the predicted label or not.
While intuitive and clearly important, the capabilities and limitations of this
approach have not been well understood. In this paper, we conduct an empirical
study to evaluate the quality of predictive uncertainties of malware detectors.
Specifically, we re-design and build 24 Android malware detectors (by
transforming four off-the-shelf detectors with six calibration methods) and
quantify their uncertainties with nine metrics, including three metrics dealing
with data imbalance. Our main findings are: (i) predictive uncertainty indeed
helps achieve reliable malware detection in the presence of dataset shift, but
cannot cope with adversarial evasion attacks; (ii) approximate Bayesian methods
are promising to calibrate and generalize malware detectors to deal with
dataset shift, but cannot cope with adversarial evasion attacks; (iii)
adversarial evasion attacks can render calibration methods useless, and it is
an open problem to quantify the uncertainty associated with the predicted
labels of adversarial examples (i.e., it is not effective to use predictive
uncertainty to detect adversarial examples).
","[{'version': 'v1', 'created': 'Mon, 20 Sep 2021 16:16:25 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Oct 2021 05:34:14 GMT'}]",2021-12-15,"[['Li', 'Deqiang', ''], ['Qiu', 'Tian', ''], ['Chen', 'Shuo', ''], ['Li', 'Qianmu', ''], ['Xu', 'Shouhuai', '']]","['malware detection', 'predictive uncertainty', 'deep learning', 'datasetshift', 'adversarial malware examples']"
8861,2111.04619,Stijn Koppen,"Stijn Koppen, Matthijs Langelaar and Fred van Keulen",Efficient multi-partition topology optimization,,,10.1016/j.cma.2022.114829,,cs.CE cs.NA math.AP math.NA,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In topology optimization, the state of structures is typically obtained by
numerically evaluating a discretized PDE-based model. The degrees of freedom of
such a model can be partitioned in free and prescribed sets to define the
boundary conditions. A multi-partition problem involves multiple partitions of
the same discretization, typically corresponding to different loading
scenarios. As a result, solving multi-partition problems involves multiple
factorization/preconditionings of the system matrix, requiring a high
computational effort. In this paper, a novel method is proposed to efficiently
calculate the responses and accompanying design sensitivities in such
multi-partition problems using static condensation for use in gradient-based
topology optimization. A main problem class that benefits from the proposed
method is the topology optimization of small-displacement
multi-input-multi-output compliant mechanisms. However, the method is
applicable to any linear problem. We present its formulation and an algorithmic
complexity analysis to estimate computational advantages for both direct and
iterative solution methods to solve the system of equations, verified by
numerical experiments. It is demonstrated that substantial gains are achievable
for large-scale multi-partition problems. This is especially true for problems
with both a small set of number of degrees of freedom that fully describes the
performance of the structure and with large similarities between the different
partitions. A major contribution to the gain is the lack of large adjoint
analyses required to obtain the sensitivities of the performance measure.
","[{'version': 'v1', 'created': 'Mon, 8 Nov 2021 16:45:21 GMT'}]",2022-04-06,"[['Koppen', 'Stijn', ''], ['Langelaar', 'Matthijs', ''], ['van Keulen', 'Fred', '']]","['Static condensation', 'Topology optimization', 'Computational efficiency', 'Sensitivityanalysis', 'Partitioning', 'Adjoint', 'Compliant mechanisms']"
8862,2209.09317,Patrick Sattler,"Johannes Zirngibl, Lion Steger, Patrick Sattler, Oliver Gasser, Georg
  Carle",Rusty Clusters? Dusting an IPv6 Research Foundation,,,10.1145/3517745.3561440,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The long-running IPv6 Hitlist service is an important foundation for IPv6
measurement studies. It helps to overcome infeasible, complete address space
scans by collecting valuable, unbiased IPv6 address candidates and regularly
testing their responsiveness. However, the Internet itself is a quickly
changing ecosystem that can affect longrunning services, potentially inducing
biases and obscurities into ongoing data collection means. Frequent analyses
but also updates are necessary to enable a valuable service to the community.
  In this paper, we show that the existing hitlist is highly impacted by the
Great Firewall of China, and we offer a cleaned view on the development of
responsive addresses. While the accumulated input shows an increasing bias
towards some networks, the cleaned set of responsive addresses is well
distributed and shows a steady increase.
  Although it is a best practice to remove aliased prefixes from IPv6 hitlists,
we show that this also removes major content delivery networks. More than 98%
of all IPv6 addresses announced by Fastly were labeled as aliased and
Cloudflare prefixes hosting more than 10M domains were excluded. Depending on
the hitlist usage, e.g., higher layer protocol scans, inclusion of addresses
from these providers can be valuable.
  Lastly, we evaluate different new address candidate sources, including target
generation algorithms to improve the coverage of the current IPv6 Hitlist. We
show that a combination of different methodologies is able to identify 5.6M
new, responsive addresses. This accounts for an increase by 174% and combined
with the current IPv6 Hitlist, we identify 8.8M responsive addresses.
","[{'version': 'v1', 'created': 'Mon, 19 Sep 2022 19:29:34 GMT'}]",2022-09-21,"[['Zirngibl', 'Johannes', ''], ['Steger', 'Lion', ''], ['Sattler', 'Patrick', ''], ['Gasser', 'Oliver', ''], ['Carle', 'Georg', '']]","['IPv6', 'Hitlist', 'Aliased Prefixes', 'Target Generation']"
8863,2207.03072,Diab Abueidda,"Junyan He and Shashank Kushwaha and Charul Chadha and Seid Koric and
  Diab Abueidda and Iwona Jasiuk",Deep energy method in topology optimization applications,,,10.1007/s00707-022-03449-3,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  This paper explores the possibilities of applying physics-informed neural
networks (PINNs) in topology optimization (TO) by introducing a fully
self-supervised TO framework that is based on PINNs. This framework solves the
forward elasticity problem by the deep energy method (DEM). Instead of training
a separate neural network to update the density distribution, we leverage the
fact that the compliance minimization problem is self-adjoint to express the
element sensitivity directly in terms of the displacement field from the DEM
model, and thus no additional neural network is needed for the inverse problem.
The method of moving asymptotes is used as the optimizer for updating density
distribution. The implementation of Neumann, Dirichlet, and periodic boundary
conditions are described in the context of the DEM model. Three numerical
examples are presented to demonstrate framework capabilities: (1) Compliance
minimization in 2D under different geometries and loading, (2) Compliance
minimization in 3D, and (3) Maximization of homogenized shear modulus to design
2D meta material unit cells. The results show that the optimized designs from
the DEM-based framework are very comparable to those generated by the finite
element method, and shed light on a new way of integrating PINN-based
simulation methods into classical computational mechanics problems.
","[{'version': 'v1', 'created': 'Thu, 7 Jul 2022 03:52:15 GMT'}]",2022-12-19,"[['He', 'Junyan', ''], ['Kushwaha', 'Shashank', ''], ['Chadha', 'Charul', ''], ['Koric', 'Seid', ''], ['Abueidda', 'Diab', ''], ['Jasiuk', 'Iwona', '']]","['Deep energy method', 'Physics-informed neural networks', 'Topology optimization', 'SIMP']"
8864,2009.10968,Sao Mai Nguyen,"Alexandre Manoury (IMT Atlantique - INFO), Sao Mai Nguyen, C\'edric
  Buche",Hierarchical Affordance Discovery using Intrinsic Motivation,"7th International Conference on Human-Agent Interaction (HAI '19),
  Oct 2019, Kyoto, Japan",,10.1145/3349537.3351898,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To be capable of lifelong learning in a real-life environment, robots have to
tackle multiple challenges. Being able to relate physical properties they may
observe in their environment to possible interactions they may have is one of
them. This skill, named affordance learning, is strongly related to embodiment
and is mastered through each person's development: each individual learns
affordances differently through their own interactions with their surroundings.
Current methods for affordance learning usually use either fixed actions to
learn these affordances or focus on static setups involving a robotic arm to be
operated. In this article, we propose an algorithm using intrinsic motivation
to guide the learning of affordances for a mobile robot. This algorithm is
capable to autonomously discover, learn and adapt interrelated affordances
without pre-programmed actions. Once learned, these affordances may be used by
the algorithm to plan sequences of actions in order to perform tasks of various
difficulties. We then present one experiment and analyse our system before
comparing it with other approaches from reinforcement learning and affordance
learning.
","[{'version': 'v1', 'created': 'Wed, 23 Sep 2020 07:18:21 GMT'}]",2020-09-24,"[['Manoury', 'Alexandre', '', 'IMT Atlantique - INFO'], ['Nguyen', 'Sao Mai', ''], ['Buche', 'Cédric', '']]","['Intrinsic motivation', 'Incremental learning', 'Affordances']"
8865,2202.09229,Elpida Keravnou-Papailiou,"Elpida Keravnou-Papailiou (University of Cyprus, Cyprus)",Figuring and Drawing: A Visual Approach to Principled Programming,,"The Art, Science, and Engineering of Programming, 2022, Vol. 6,
  Issue 3, Article 11",10.22152/programming-journal.org/2022/6/11,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A standing challenge in undergraduate Computer Science curricula is the
teaching and learning of computer programming. Through this paper which is an
essay about programming, we aim to contribute to the plethora of existing
pedagogies, approaches and philosophies, by discussing a specific feature of
our approach in teaching principled programming to undergraduate students, in
their first semester of studies, namely the utilization of pictures, both
text-based and raster-based graphics. Although the given course has evolved
substantially over the thirty years of its delivery regarding the programming
languages (Miranda, C, C++, Java) and paradigms (functional, imperative,
object-oriented, combination of procedural and object-oriented) used, the
discussed visual feature has been maintained and steadily strengthened.
  We list abstraction, problem decomposition and synthesis, information hiding,
reusability, modularity and extensibility as key principles of problem solving
and algorithmic thinking. These principles are closely aligned with the
advocated computational thinking techniques of problem decomposition, pattern
recognition, pattern generalization and algorithm design. We aim for our
students to familiarize themselves with all the above principles through
practical problem solving. Our ongoing inquiry has been whether the problem
domain of pictures is contributing valuably towards this aim. Moreover, an
added-value is that students get a glimpse of computational complexity in a
visual, empirical way.
  The presented work is not related to visual programming, since the students
write their programs textually and not graphically; it's the output of their
programs which is in visual form. Our approach though is loosely related to the
classical paradigm of turtle graphics. However, our focus is Computer Science
majors, who should be able to design and build turtles and other objects and
not just use them. Indeed, the programming principles course helps them to do
both and also to appreciate the multitude of algorithmic ways for producing the
same visual output. Currently the given programming principles are approached
both from a procedural, process-based and an object-oriented, concept-based
perspective and the course uses the Java language. Through the presented
example problems, we aim to show the appropriateness of the visual domain of
pictures for supporting the learning of principled programming. The problem
domain of pictures is abundantly rich with potential examples to draw from.
Moreover, as reported in the literature, female students may show higher
interest towards visual problem domains in programming classes, in relation to
other problem domains. We plan to investigate this conjecture in the context of
our broader aim to encourage more females to follow university studies in
computer science; in this paper only a cursory finding is presented, that bears
some relation to what is reported in the literature.
","[{'version': 'v1', 'created': 'Fri, 18 Feb 2022 14:54:42 GMT'}]",2022-02-21,"[['Keravnou-Papailiou', 'Elpida', '', 'University of Cyprus, Cyprus']]","['computer science education', 'principles of programming', 'algorithmic thinking', 'visual domain of']"
8866,2209.13965,Khloud Al Jallad,"Khloud Al Jallad, Mohamad Aljnidi, Mohammad Said Desouki","Anomaly detection optimization using big data and deep learning to
  reduce false-positive",,"J Big Data 7, 68 (2020)",10.1186/s40537-020-00346-1,,cs.AI cs.CR cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Anomaly-based Intrusion Detection System (IDS) has been a hot research topic
because of its ability to detect new threats rather than only memorized
signatures threats of signature-based IDS. Especially after the availability of
advanced technologies that increase the number of hacking tools and increase
the risk impact of an attack. The problem of any anomaly-based model is its
high false-positive rate. The high false-positive rate is the reason why
anomaly IDS is not commonly applied in practice. Because anomaly-based models
classify an unseen pattern as a threat where it may be normal but not included
in the training dataset. This type of problem is called overfitting where the
model is not able to generalize. Optimizing Anomaly-based models by having a
big training dataset that includes all possible normal cases may be an optimal
solution but could not be applied in practice. Although we can increase the
number of training samples to include much more normal cases, still we need a
model that has more ability to generalize. In this research paper, we propose
applying deep model instead of traditional models because it has more ability
to generalize. Thus, we will obtain less false-positive by using big data and
deep model. We made a comparison between machine learning and deep learning
algorithms in the optimization of anomaly-based IDS by decreasing the
false-positive rate. We did an experiment on the NSL-KDD benchmark and compared
our results with one of the best used classifiers in traditional learning in
IDS optimization. The experiment shows 10% lower false-positive by using deep
learning instead of traditional learning.
","[{'version': 'v1', 'created': 'Wed, 28 Sep 2022 09:52:26 GMT'}]",2022-09-29,"[['Jallad', 'Khloud Al', ''], ['Aljnidi', 'Mohamad', ''], ['Desouki', 'Mohammad Said', '']]","['Intrusion detection systems (IDS)', 'Security intelligence optimization', 'Unknown threats', 'Big data', 'NSL-KDD dataset', 'False-positive']"
8867,1807.08325,Ahmed Qureshi,"Zaid Tahir, Ahmed H. Qureshi, Yasar Ayaz and Raheel Nawaz","Potentially Guided Bidirectionalized RRT* for Fast Optimal Path Planning
  in Cluttered Environments",,"Volume 108, Pages 13-27, 2018, Elsevier, Robotics and Autonomous
  Systems",10.1016/j.robot.2018.06.013,,cs.RO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rapidly-exploring Random Tree star (RRT*) has recently gained immense
popularity in the motion planning community as it provides a probabilistically
complete and asymptotically optimal solution without requiring the complete
information of the obstacle space. In spite of all of its advantages, RRT*
converges to an optimal solution very slowly. Hence to improve the convergence
rate, its bidirectional variants were introduced, the Bi-directional RRT*
(B-RRT*) and Intelligent Bi-directional RRT* (IB-RRT*). However, as both
variants perform pure exploration, they tend to suffer in highly cluttered
environments. In order to overcome these limitations, we introduce a new
concept of potentially guided bidirectional trees in our proposed Potentially
Guided Intelligent Bi-directional RRT* (PIB-RRT*) and Potentially Guided
Bi-directional RRT* (PB-RRT*). The proposed algorithms greatly improve the
convergence rate and have a more efficient memory utilization. Theoretical and
experimental evaluation of the proposed algorithms have been made and compared
to the latest state of the art motion planning algorithms under different
challenging environmental conditions and have proven their remarkable
improvement in efficiency and convergence rate.
","[{'version': 'v1', 'created': 'Sun, 22 Jul 2018 17:27:56 GMT'}]",2018-07-24,"[['Tahir', 'Zaid', ''], ['Qureshi', 'Ahmed H.', ''], ['Ayaz', 'Yasar', ''], ['Nawaz', 'Raheel', '']]","['Motion planning', 'Sampling based planning algorithms', 'RRT*', 'Optimal pathplanning', 'Artificial Potential Fields', 'Bidirectional trees']"
8868,2104.09918,Ushasi Chaudhuri,"Ushasi Chaudhuri, Biplab Banerjee, Avik Bhattacharya, Mihai Datcu","CrossATNet - A Novel Cross-Attention Based Framework for Sketch-Based
  Image Retrieval",Accepted in Journal of Image and Vision Computing,,10.1016/j.imavis.2020.104003,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  We propose a novel framework for cross-modal zero-shot learning (ZSL) in the
context of sketch-based image retrieval (SBIR). Conventionally, the SBIR schema
mainly considers simultaneous mappings among the two image views and the
semantic side information. Therefore, it is desirable to consider fine-grained
classes mainly in the sketch domain using highly discriminative and
semantically rich feature space. However, the existing deep generative
modeling-based SBIR approaches majorly focus on bridging the gaps between the
seen and unseen classes by generating pseudo-unseen-class samples. Besides,
violating the ZSL protocol by not utilizing any unseen-class information during
training, such techniques do not pay explicit attention to modeling the
discriminative nature of the shared space. Also, we note that learning a
unified feature space for both the multi-view visual data is a tedious task
considering the significant domain difference between sketches and color
images. In this respect, as a remedy, we introduce a novel framework for
zero-shot SBIR. While we define a cross-modal triplet loss to ensure the
discriminative nature of the shared space, an innovative cross-modal attention
learning strategy is also proposed to guide feature extraction from the image
domain exploiting information from the respective sketch counterpart. In order
to preserve the semantic consistency of the shared space, we consider a graph
CNN-based module that propagates the semantic class topology to the shared
space. To ensure an improved response time during inference, we further explore
the possibility of representing the shared space in terms of hash codes.
Experimental results obtained on the benchmark TU-Berlin and the Sketchy
datasets confirm the superiority of CrossATNet in yielding state-of-the-art
results.
","[{'version': 'v1', 'created': 'Tue, 20 Apr 2021 12:11:12 GMT'}]",2021-04-22,"[['Chaudhuri', 'Ushasi', ''], ['Banerjee', 'Biplab', ''], ['Bhattacharya', 'Avik', ''], ['Datcu', 'Mihai', '']]","['Neural networks', 'Sketch-based image retrieval', 'Cross-modal retrieval', 'Deep-learning', 'Cross-attentionnetwork', 'Cross-triplets']"
8869,2207.00740,Zhi Lu,"Zhi Lu, Vrizlynn L. L. Thing","PhilaeX: Explaining the Failure and Success of AI Models in Malware
  Detection",,"7th International Conference on Internet of Things, Big Data and
  Security, ISBN 978-989-758-564-7; ISSN 2184-4976, pp 37-46, 2022",10.5220/0010986700003194,,cs.CR cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The explanation to an AI model's prediction used to support decision making
in cyber security, is of critical importance. It is especially so when the
model's incorrect prediction can lead to severe damages or even losses to lives
and critical assets. However, most existing AI models lack the ability to
provide explanations on their prediction results, despite their strong
performance in most scenarios. In this work, we propose a novel explainable AI
method, called PhilaeX, that provides the heuristic means to identify the
optimized subset of features to form the complete explanations of AI models'
predictions. It identifies the features that lead to the model's borderline
prediction, and those with positive individual contributions are extracted. The
feature attributions are then quantified through the optimization of a Ridge
regression model. We verify the explanation fidelity through two experiments.
First, we assess our method's capability in correctly identifying the activated
features in the adversarial samples of Android malwares, through the features
attribution values from PhilaeX. Second, the deduction and augmentation tests,
are used to assess the fidelity of the explanations. The results show that
PhilaeX is able to explain different types of classifiers correctly, with
higher fidelity explanations, compared to the state-of-the-arts methods such as
LIME and SHAP.
","[{'version': 'v1', 'created': 'Sat, 2 Jul 2022 05:06:24 GMT'}]",2022-11-21,"[['Lu', 'Zhi', ''], ['Thing', 'Vrizlynn L. L.', '']]","['Cyber security', 'Explainable AI', 'Malware Detection', 'Machine Learning']"
8870,2010.10016,Tong Zhao,"Tong Zhao, Bo Ni, Wenhao Yu, Zhichun Guo, Neil Shah, Meng Jiang",Action Sequence Augmentation for Early Graph-based Anomaly Detection,CIKM'21,,10.1145/3459637.3482313,,cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The proliferation of web platforms has created incentives for online abuse.
Many graph-based anomaly detection techniques are proposed to identify the
suspicious accounts and behaviors. However, most of them detect the anomalies
once the users have performed many such behaviors. Their performance is
substantially hindered when the users' observed data is limited at an early
stage, which needs to be improved to minimize financial loss. In this work, we
propose Eland, a novel framework that uses action sequence augmentation for
early anomaly detection. Eland utilizes a sequence predictor to predict next
actions of every user and exploits the mutual enhancement between action
sequence augmentation and user-action graph anomaly detection. Experiments on
three real-world datasets show that Eland improves the performance of a variety
of graph-based anomaly detection methods. With Eland, anomaly detection
performance at an earlier stage is better than non-augmented methods that need
significantly more observed data by up to 15% on the Area under the ROC curve.
","[{'version': 'v1', 'created': 'Tue, 20 Oct 2020 04:39:38 GMT'}, {'version': 'v2', 'created': 'Sat, 28 Aug 2021 19:25:41 GMT'}]",2021-08-31,"[['Zhao', 'Tong', ''], ['Ni', 'Bo', ''], ['Yu', 'Wenhao', ''], ['Guo', 'Zhichun', ''], ['Shah', 'Neil', ''], ['Jiang', 'Meng', '']]","['Graph machine learning', 'Anomaly detection', 'Graph data augmentation']"
8871,1911.05604,Jungwei Fan,"Andrew Wen, Mohamed Y. Elwazir, Sungrim Moon, Jungwei Fan","Adapting and evaluating a deep learning language model for clinical
  why-question answering",,,10.1093/jamiaopen/ooz072,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Objectives: To adapt and evaluate a deep learning language model for
answering why-questions based on patient-specific clinical text. Materials and
Methods: Bidirectional encoder representations from transformers (BERT) models
were trained with varying data sources to perform SQuAD 2.0 style why-question
answering (why-QA) on clinical notes. The evaluation focused on: 1) comparing
the merits from different training data, 2) error analysis. Results: The best
model achieved an accuracy of 0.707 (or 0.760 by partial match). Training
toward customization for the clinical language helped increase 6% in accuracy.
Discussion: The error analysis suggested that the model did not really perform
deep reasoning and that clinical why-QA might warrant more sophisticated
solutions. Conclusion: The BERT model achieved moderate accuracy in clinical
why-QA and should benefit from the rapidly evolving technology. Despite the
identified limitations, it could serve as a competent proxy for question-driven
clinical information extraction.
","[{'version': 'v1', 'created': 'Wed, 13 Nov 2019 16:43:22 GMT'}]",2020-03-09,"[['Wen', 'Andrew', ''], ['Elwazir', 'Mohamed Y.', ''], ['Moon', 'Sungrim', ''], ['Fan', 'Jungwei', '']]","['Question Answering', 'Artificial Intelligence', 'Natural Language Processing', 'Evaluation Studies', 'Clinical Decision-Making']"
8872,2103.01768,Suchithra Rajendran,Suchithra Rajendran and Sharan Srinivas,"Air taxi service for urban mobility: A critical review of recent
  developments, future challenges, and opportunities","This is a pre-print version of the manuscript accepted in
  Transportation Research Part E: Logistics and Transportation Review
  (https://doi.org/10.1016/j.tre.2020.102090)","Transportation research part E: logistics and transportation
  review, 143, 102090 (2020)",10.1016/j.tre.2020.102090,,cs.CY math.OC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Expected to operate in the imminent future, air taxi service (ATS) is an
aerial on-demand transport for a single passenger or a small group of riders,
which seeks to transform the method of everyday commute. This uncharted
territory in the emerging transportation world is anticipated to enable
consumers bypass traffic congestion in urban road networks. By adopting an
electric vertical takeoff and landing concept (eVTOL), air taxis could be
operational from skyports retrofitted on building rooftops, thus gaining
advantage from an implementation standpoint. Motivated by the potential impact
of ATS, this study provides a review of air taxi systems and associated
operations. We first discuss the current developments in the ATS (demand
prediction, air taxi network design, and vehicle configuration). Next, we
anticipate potential future challenges of ATS from an operations management
perspective, and review the existing literature that could be leveraged to
tackle these problems (ride-matching, pricing strategies, vehicle maintenance
scheduling, and pilot training and recruitment). Finally, we detail future
research opportunities in the air taxi domain.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2021 22:48:03 GMT'}]",2021-03-03,"[['Rajendran', 'Suchithra', ''], ['Srinivas', 'Sharan', '']]","['Air taxi service (ATS)', 'Electric vertical takeoff and landing (eVTOL)', 'Currentdevelopments', 'Challenges', 'Opportunities', 'Review']"
8873,1805.04154,Sebastian Wild,J. Ian Munro and Sebastian Wild,"Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That
  Optimally Adapt to Existing Runs",,,10.4230/lipics.esa.2018.63,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present two stable mergesort variants, ""peeksort"" and ""powersort"", that
exploit existing runs and find nearly-optimal merging orders with practically
negligible overhead. Previous methods either require substantial effort for
determining the merging order (Takaoka 2009; Barbay & Navarro 2013) or do not
have a constant-factor optimal worst-case guarantee (Peters 2001; Auger, Nicaud
& Pivoteau 2015; Buss & Knop 2018). We demonstrate that our methods are
competitive in terms of running time with state-of-the-art implementations of
stable sorting methods.
","[{'version': 'v1', 'created': 'Thu, 10 May 2018 20:00:42 GMT'}]",2019-05-07,"[['Munro', 'J. Ian', ''], ['Wild', 'Sebastian', '']]","['adaptive sorting', 'nearly-optimal binary search trees', 'Timsort']"
8874,1907.02586,Guangfeng Lin,"Guangfeng Lin and Jing Wang and Kaiyang Liao and Fan Zhao and Wanjun
  Chen","Structure fusion based on graph convolutional networks for
  semi-supervised classification",,"Electronics,2020",10.3390/electronics9030432,,cs.LG cs.CV stat.ML,http://creativecommons.org/publicdomain/zero/1.0/,"  Suffering from the multi-view data diversity and complexity for
semi-supervised classification, most of existing graph convolutional networks
focus on the networks architecture construction or the salient graph structure
preservation, and ignore the the complete graph structure for semi-supervised
classification contribution. To mine the more complete distribution structure
from multi-view data with the consideration of the specificity and the
commonality, we propose structure fusion based on graph convolutional networks
(SF-GCN) for improving the performance of semi-supervised classification.
SF-GCN can not only retain the special characteristic of each view data by
spectral embedding, but also capture the common style of multi-view data by
distance metric between multi-graph structures. Suppose the linear relationship
between multi-graph structures, we can construct the optimization function of
structure fusion model by balancing the specificity loss and the commonality
loss. By solving this function, we can simultaneously obtain the fusion
spectral embedding from the multi-view data and the fusion structure as
adjacent matrix to input graph convolutional networks for semi-supervised
classification. Experiments demonstrate that the performance of SF-GCN
outperforms that of the state of the arts on three challenging datasets, which
are Cora,Citeseer and Pubmed in citation networks.
","[{'version': 'v1', 'created': 'Tue, 2 Jul 2019 23:43:05 GMT'}]",2020-06-01,"[['Lin', 'Guangfeng', ''], ['Wang', 'Jing', ''], ['Liao', 'Kaiyang', ''], ['Zhao', 'Fan', ''], ['Chen', 'Wanjun', '']]","['structure fusion', 'graph convolutional networks', 'semi-supervised']"
8875,1601.04436,Nancy Rodriguez,Nancy Rodriguez (ICAR),"Development of a wheelchair simulator for children with multiple
  disabilities","from 3rd International Workshop on Virtual and Augmented Assistive
  Technology (VAAT), IEEE Virtual Reality 2015, 2015, Arles, France. 2015",,10.1109/VAAT.2015.7155405,,cs.HC cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Virtual reality allows to create situations which can be experimented under
the control of the user, without risks, in a very flexible way. This allows to
develop skills and to have confidence to work in real conditions with real
equipment. VR is then widely used as a training and learning tool. More
recently, VR has also showed its potential in rehabilitation and therapy fields
because it provides users with the ability of repeat their actions several
times and to progress at their own pace. In this communication, we present our
work in the development of a wheelchair simulator designed to allow children
with multiple disabilities to familiarize themselves with the wheelchair.
","[{'version': 'v1', 'created': 'Mon, 18 Jan 2016 09:23:46 GMT'}]",2016-01-19,"[['Rodriguez', 'Nancy', '', 'ICAR']]","['virtual reality', 'simulator', 'disability', 'multiple']"
8876,2112.14343,Rami Mohawesh,"Rami Mohawesh, Shuxiang Xu, Matthew Springer, Muna Al-Hawawreh and
  Sumbal Maqsood","Fake or Genuine? Contextualised Text Representation for Fake Review
  Detection",,"10th International Conference on Natural Language Processing (NLP
  2021)",10.5121/csit.2021.112311,,cs.CL cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Online reviews have a significant influence on customers' purchasing
decisions for any products or services. However, fake reviews can mislead both
consumers and companies. Several models have been developed to detect fake
reviews using machine learning approaches. Many of these models have some
limitations resulting in low accuracy in distinguishing between fake and
genuine reviews. These models focused only on linguistic features to detect
fake reviews and failed to capture the semantic meaning of the reviews. To deal
with this, this paper proposes a new ensemble model that employs transformer
architecture to discover the hidden patterns in a sequence of fake reviews and
detect them precisely. The proposed approach combines three transformer models
to improve the robustness of fake and genuine behaviour profiling and modelling
to detect fake reviews. The experimental results using semi-real benchmark
datasets showed the superiority of the proposed model over state-of-the-art
models.
","[{'version': 'v1', 'created': 'Wed, 29 Dec 2021 00:54:47 GMT'}]",2021-12-30,"[['Mohawesh', 'Rami', ''], ['Xu', 'Shuxiang', ''], ['Springer', 'Matthew', ''], ['Al-Hawawreh', 'Muna', ''], ['Maqsood', 'Sumbal', '']]","['Fake review', 'detection', 'Transformer', 'Ensemble', 'Deep learning']"
8877,2211.01178,Michal Edelstein,"Michal Edelstein, Hila Peleg, Shachar Itzhaky and Mirela Ben-Chen",AmiGo: Computational Design of Amigurumi Crochet Patterns,"11 pages, 10 figures, SCF 2022",,10.1145/3559400.3562005,,cs.GR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We propose an approach for generating crochet instructions (patterns) from an
input 3D model. We focus on Amigurumi, which are knitted stuffed toys. Given a
closed triangle mesh, and a single point specified by the user, we generate
crochet instructions, which when knitted and stuffed result in a toy similar to
the input geometry. Our approach relies on constructing the geometry and
connectivity of a Crochet Graph, which is then translated into a crochet
pattern. We segment the shape automatically into chrochetable components, which
are connected using the join-as-you-go method, requiring no additional sewing.
We demonstrate that our method is applicable to a large variety of shapes and
geometries, and yields easily crochetable patterns.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2022 14:53:21 GMT'}]",2022-11-03,"[['Edelstein', 'Michal', ''], ['Peleg', 'Hila', ''], ['Itzhaky', 'Shachar', ''], ['Ben-Chen', 'Mirela', '']]","['computational knitting', 'crochet', 'geometry processing']"
8878,2112.08462,Witold Sosnowski,"Witold Sosnowski, Anna Wroblewska and Piotr Gawrysiak",Applying SoftTriple Loss for Supervised Language Model Fine Tuning,,"17th Conference on Computer Science and Intelligence Systems 2022.
  Series: ACSIS Annals of Computer Science and Information Systems",10.15439/2022F185,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a new loss function TripleEntropy, to improve classification
performance for fine-tuning general knowledge pre-trained language models based
on cross-entropy and SoftTriple loss. This loss function can improve the robust
RoBERTa baseline model fine-tuned with cross-entropy loss by about (0.02% -
2.29%). Thorough tests on popular datasets indicate a steady gain. The fewer
samples in the training dataset, the higher gain -- thus, for small-sized
dataset it is 0.78%, for medium-sized -- 0.86% for large -- 0.20% and for
extra-large 0.04%.
","[{'version': 'v1', 'created': 'Wed, 15 Dec 2021 20:21:20 GMT'}]",2022-11-28,"[['Sosnowski', 'Witold', ''], ['Wroblewska', 'Anna', ''], ['Gawrysiak', 'Piotr', '']]","['natural language processing', 'deep learning', 'training', 'Triplet Loss', 'distance metric learning']"
8879,1910.10601,Thomas Durieux,"Thomas Durieux, Jo\~ao F. Ferreira, Rui Abreu, Pedro Cruz","Empirical Review of Automated Analysis Tools on 47,587 Ethereum Smart
  Contracts",,,10.1145/3377811.3380364,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the last few years, there has been substantial research on automated
analysis, testing, and debugging of Ethereum smart contracts. However, it is
not trivial to compare and reproduce that research. To address this, we present
an empirical evaluation of 9 state-of-the-art automated analysis tools using
two new datasets: i) a dataset of 69 annotated vulnerable smart contracts that
can be used to evaluate the precision of analysis tools; and ii) a dataset with
all the smart contracts in the Ethereum Blockchain that have Solidity source
code available on Etherscan (a total of 47,518 contracts). The datasets are
part of SmartBugs, a new extendable execution framework that we created to
facilitate the integration and comparison between multiple analysis tools and
the analysis of Ethereum smart contracts. We used SmartBugs to execute the 9
automated analysis tools on the two datasets. In total, we ran 428,337 analyses
that took approximately 564 days and 3 hours, being the largest experimental
setup to date both in the number of tools and in execution time. We found that
only 42% of the vulnerabilities from our annotated dataset are detected by all
the tools, with the tool Mythril having the higher accuracy (27%). When
considering the largest dataset, we observed that 97% of contracts are tagged
as vulnerable, thus suggesting a considerable number of false positives.
Indeed, only a small number of vulnerabilities (and of only two categories)
were detected simultaneously by four or more tools.
","[{'version': 'v1', 'created': 'Wed, 23 Oct 2019 15:09:48 GMT'}, {'version': 'v2', 'created': 'Sun, 9 Feb 2020 13:53:29 GMT'}]",2020-02-11,"[['Durieux', 'Thomas', ''], ['Ferreira', 'João F.', ''], ['Abreu', 'Rui', ''], ['Cruz', 'Pedro', '']]","['Smart contracts', 'Solidity', 'Ethereum', 'Blockchain', 'Tools', 'Debugging', 'Testing', 'Reproducible Bugs']"
8880,1912.07827,Yue Jiang,"Yue Jiang, Ruofei Du, Christof Lutteroth, Wolfgang Stuerzlinger",ORC Layout: Adaptive GUI Layout with OR-Constraints,,,10.1145/3290605.3300643,,cs.HC cs.AI cs.GR cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel approach for constraint-based graphical user interface
(GUI) layout based on OR-constraints (ORC) in standard soft/hard linear
constraint systems. ORC layout unifies grid layout and flow layout, supporting
both their features as well as cases where grid and flow layouts individually
fail. We describe ORC design patterns that enable designers to safely create
flexible layouts that work across different screen sizes and orientations. We
also present the ORC Editor, a GUI editor that enables designers to apply ORC
in a safe and effective manner, mixing grid, flow and new ORC layout features
as appropriate. We demonstrate that our prototype can adapt layouts to screens
with different aspect ratios with only a single layout specification, easing
the burden of GUI maintenance. Finally, we show that ORC specifications can be
modified interactively and solved efficiently at runtime.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2019 05:41:42 GMT'}]",2022-02-23,"[['Jiang', 'Yue', ''], ['Du', 'Ruofei', ''], ['Lutteroth', 'Christof', ''], ['Stuerzlinger', 'Wolfgang', '']]","['GUI builder', 'layout manager', 'constraint-based layout', 'visualinterface design', 'visual programming']"
8881,1506.08953,Sufian Hameed,Sufian Hameed and Usman Ali,On the Efficacy of Live DDoS Detection with Hadoop,,,10.1109/NOMS.2016.7502848,,cs.CR cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed Denial of Service flooding attacks are one of the biggest
challenges to the availability of online services today. These DDoS attacks
overwhelm the victim with huge volume of traffic and render it incapable of
performing normal communication or crashes it completely. If there are delays
in detecting the flooding attacks, nothing much can be done except to manually
disconnect the victim and fix the problem. With the rapid increase of DDoS
volume and frequency, the current DDoS detection technologies are challenged to
deal with huge attack volume in reasonable and affordable response time.
  In this paper, we propose HADEC, a Hadoop based Live DDoS Detection framework
to tackle efficient analysis of flooding attacks by harnessing MapReduce and
HDFS. We implemented a counter-based DDoS detection algorithm for four major
flooding attacks (TCP-SYN, HTTP GET, UDP and ICMP) in MapReduce, consisting of
map and reduce functions. We deployed a testbed to evaluate the performance of
HADEC framework for live DDoS detection. Based on the experiments we showed
that HADEC is capable of processing and detecting DDoS attacks in affordable
time.
","[{'version': 'v1', 'created': 'Tue, 30 Jun 2015 06:35:59 GMT'}]",2017-11-30,"[['Hameed', 'Sufian', ''], ['Ali', 'Usman', '']]","['DDoS', 'flooding attacks', 'DDoS detection', 'Hadoop']"
8882,2203.10324,Marcelo Fernandes,"Marcelo Fernandes, Samuel Ferino, Anny Fernandes, Uira Kulesza,
  Eduardo Aranha, Christoph Treude",DevOps Education: An Interview Study of Challenges and Recommendations,"12 pages, 6 figures, 5 tables, ICSE 2022 SEET",,10.1145/3510456.3514152,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Over the last years, the software industry has adopted several DevOps
technologies related to practices such as continuous integration and continuous
delivery. The high demand for DevOps practitioners requires non-trivial
adjustments in traditional software engineering courses and educational
methodologies. This work presents an interview study with 14 DevOps educators
from different universities and countries, aiming to identify the main
challenges and recommendations for DevOps teaching. Our study identified 83
challenges, 185 recommendations, and several association links and conflicts
between them. Our findings can help educators plan, execute and evaluate DevOps
courses. They also highlight several opportunities for researchers to propose
new methods and tools for teaching DevOps.
","[{'version': 'v1', 'created': 'Sat, 19 Mar 2022 13:17:00 GMT'}]",2022-03-22,"[['Fernandes', 'Marcelo', ''], ['Ferino', 'Samuel', ''], ['Fernandes', 'Anny', ''], ['Kulesza', 'Uira', ''], ['Aranha', 'Eduardo', ''], ['Treude', 'Christoph', '']]","['DevOps', 'challenges', 'recommendations', 'thematic analysis']"
8883,1907.01925,Justin Edwards,"Justin Edwards, He Liu, Tianyu Zhou, Sandy J. J. Gould, Leigh Clark,
  Philip Doyle, Benjamin R. Cowan","Multitasking with Alexa Multitasking with Alexa: How Using Intelligent
  Personal Assistants Impacts Language-based Primary Task Performance",,,10.1145/3342775.3342785,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intelligent personal assistants (IPAs) are supposed to help us multitask. Yet
the impact of IPA use on multitasking is not clearly quantified, particularly
in situations where primary tasks are also language based. Using a dual task
paradigm, our study observes how IPA interactions impact two different types of
writing primary tasks; copying and generating content. We found writing tasks
that involve content generation, which are more cognitively demanding and share
more of the resources needed for IPA use, are significantly more disrupted by
IPA interaction than less demanding tasks such as copying content. We discuss
how theories of cognitive resources, including multiple resource theory and
working memory, explain these results. We also outline the need for future work
how interruption length and relevance may impact primary task performance as
well as the need to identify effects of interruption timing in user and IPA led
interruptions.
","[{'version': 'v1', 'created': 'Wed, 3 Jul 2019 13:13:35 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Jul 2019 08:31:39 GMT'}]",2019-07-29,"[['Edwards', 'Justin', ''], ['Liu', 'He', ''], ['Zhou', 'Tianyu', ''], ['Gould', 'Sandy J. J.', ''], ['Clark', 'Leigh', ''], ['Doyle', 'Philip', ''], ['Cowan', 'Benjamin R.', '']]","['speech interface', 'voice user interface', 'intelligent personalassistants', 'multitasking', 'dual task', 'interruptions']"
8884,2107.01739,J. Gregory Pauloski,"J. Gregory Pauloski, Qi Huang, Lei Huang, Shivaram Venkataraman, Kyle
  Chard, Ian Foster, Zhao Zhang","KAISA: An Adaptive Second-Order Optimizer Framework for Deep Neural
  Networks","Accepted for publication at the International Conference for High
  Performance Computing, Networking, Storage and Analysis (SC21)",,10.1145/3458817.3476152,,cs.LG cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Kronecker-factored Approximate Curvature (K-FAC) has recently been shown to
converge faster in deep neural network (DNN) training than stochastic gradient
descent (SGD); however, K-FAC's larger memory footprint hinders its
applicability to large models. We present KAISA, a K-FAC-enabled, Adaptable,
Improved, and ScAlable second-order optimizer framework that adapts the memory
footprint, communication, and computation given specific models and hardware to
improve performance and increase scalability. We quantify the tradeoffs between
memory and communication cost and evaluate KAISA on large models, including
ResNet-50, Mask R-CNN, U-Net, and BERT, on up to 128 NVIDIA A100 GPUs. Compared
to the original optimizers, KAISA converges 18.1-36.3% faster across
applications with the same global batch size. Under a fixed memory budget,
KAISA converges 32.5% and 41.6% faster in ResNet-50 and BERT-Large,
respectively. KAISA can balance memory and communication to achieve scaling
efficiency equal to or better than the baseline optimizers. KAISA is open
source and available at https://github.com/gpauloski/kfac_pytorch.
","[{'version': 'v1', 'created': 'Sun, 4 Jul 2021 21:34:22 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Sep 2021 14:47:11 GMT'}]",2021-09-21,"[['Pauloski', 'J. Gregory', ''], ['Huang', 'Qi', ''], ['Huang', 'Lei', ''], ['Venkataraman', 'Shivaram', ''], ['Chard', 'Kyle', ''], ['Foster', 'Ian', ''], ['Zhang', 'Zhao', '']]","['Machine Learning', 'Distributed Computing', 'Second-Order Optimization', 'K-FAC', 'Data-Parallel Algorithms']"
8885,2111.10873,Vladimir Zamdzhiev,"Xiaodong Jia, Michael Mislove, Vladimir Zamdzhiev",The Central Valuations Monad,,In Proceedings CALCO 2021 (Early Ideas Track),10.4230/LIPIcs.CALCO.2021.18,,cs.LO math.CT math.GN,http://creativecommons.org/licenses/by/4.0/,"  We give a commutative valuations monad Z on the category DCPO of dcpo's and
Scott-continuous functions. Compared to the commutative valuations monads given
in [Jia et al., 2021], our new monad Z is larger and it contains all
push-forward images of valuations on the unit interval [0,1] along lower
semi-continuous maps. We believe that this new monad will be useful in giving
domain-theoretic denotational semantics for statistical programming languages
with continuous probabilistic choice.
","[{'version': 'v1', 'created': 'Sun, 21 Nov 2021 18:33:15 GMT'}]",2021-11-23,"[['Jia', 'Xiaodong', ''], ['Mislove', 'Michael', ''], ['Zamdzhiev', 'Vladimir', '']]","['Valuations', 'Commutative Monad', 'DCPO', 'Probabilistic Choice', 'Recursion']"
8886,2203.06801,Yun He,"Yun He, Xue Feng, Cheng Cheng, Geng Ji, Yunsong Guo, James Caverlee","MetaBalance: Improving Multi-Task Recommendations via Adapting Gradient
  Magnitudes of Auxiliary Tasks",Accepted by the WebConf 2022,,10.1145/3485447.3512093,,cs.LG cs.IR,http://creativecommons.org/licenses/by/4.0/,"  In many personalized recommendation scenarios, the generalization ability of
a target task can be improved via learning with additional auxiliary tasks
alongside this target task on a multi-task network. However, this method often
suffers from a serious optimization imbalance problem. On the one hand, one or
more auxiliary tasks might have a larger influence than the target task and
even dominate the network weights, resulting in worse recommendation accuracy
for the target task. On the other hand, the influence of one or more auxiliary
tasks might be too weak to assist the target task. More challenging is that
this imbalance dynamically changes throughout the training process and varies
across the parts of the same network. We propose a new method: MetaBalance to
balance auxiliary losses via directly manipulating their gradients w.r.t the
shared parameters in the multi-task network. Specifically, in each training
iteration and adaptively for each part of the network, the gradient of an
auxiliary loss is carefully reduced or enlarged to have a closer magnitude to
the gradient of the target loss, preventing auxiliary tasks from being so
strong that dominate the target task or too weak to help the target task.
Moreover, the proximity between the gradient magnitudes can be flexibly
adjusted to adapt MetaBalance to different scenarios. The experiments show that
our proposed method achieves a significant improvement of 8.34% in terms of
NDCG@10 upon the strongest baseline on two real-world datasets. The code of our
approach can be found at here: https://github.com/facebookresearch/MetaBalance
","[{'version': 'v1', 'created': 'Mon, 14 Mar 2022 01:08:31 GMT'}]",2022-03-15,"[['He', 'Yun', ''], ['Feng', 'Xue', ''], ['Cheng', 'Cheng', ''], ['Ji', 'Geng', ''], ['Guo', 'Yunsong', ''], ['Caverlee', 'James', '']]","['Multi-Task Learning', 'Auxiliary Learning', 'Personalized Recommendation', 'Gradient-based Optimization']"
8887,1810.00362,Dawood Al Chanti,Dawood Al Chanti and Alice Caplier,Spontaneous Facial Expression Recognition using Sparse Representation,"11 pages, 9 figures, VISAPP 2017, publisher=SciTePress,
  organization=INSTICC, isbn=978-989-758-226-4, Proceedings of the 12th
  International Joint Conference on Computer Vision, Imaging and Computer
  Graphics Theory and Applications - Volume 5: VISAPP, (VISIGRAPP 2017)}, 2017",,10.5220/0006118000640074,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Facial expression is the most natural means for human beings to communicate
their emotions. Most facial expression analysis studies consider the case of
acted expressions. Spontaneous facial expression recognition is significantly
more challenging since each person has a different way to react to a given
emotion. We consider the problem of recognizing spontaneous facial expression
by learning discriminative dictionaries for sparse representation. Facial
images are represented as a sparse linear combination of prototype atoms via
Orthogonal Matching Pursuit algorithm. Sparse codes are then used to train an
SVM classifier dedicated to the recognition task. The dictionary that
sparsifies the facial images (feature points with the same class labels should
have similar sparse codes) is crucial for robust classification. Learning
sparsifying dictionaries heavily relies on the initialization process of the
dictionary. To improve the performance of dictionaries, a random face feature
descriptor based on the Random Projection concept is developed. The
effectiveness of the proposed method is evaluated through several experiments
on the spontaneous facial expressions DynEmo database. It is also estimated on
the well-known acted facial expressions JAFFE database for a purpose of
comparison with state-of-the-art methods.
","[{'version': 'v1', 'created': 'Sun, 30 Sep 2018 11:38:34 GMT'}]",2018-10-02,"[['Chanti', 'Dawood Al', ''], ['Caplier', 'Alice', '']]","['Dictionary learning', 'Random projection', 'Spontaneous facial expression', 'Sparse representation']"
8888,2206.06738,Benjamin Laufer,"Benjamin Laufer, Sameer Jain, A. Feder Cooper, Jon Kleinberg and Hoda
  Heidari","Four Years of FAccT: A Reflexive, Mixed-Methods Analysis of Research
  Contributions, Shortcomings, and Future Prospects","26 pages, 5 figures, to be published in 2022 ACM Conference on
  Fairness, Accountability, and Transparency",,10.1145/3531146.3533107,,cs.CY cs.DL cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Fairness, Accountability, and Transparency (FAccT) for socio-technical
systems has been a thriving area of research in recent years. An ACM conference
bearing the same name has been the central venue for scholars in this area to
come together, provide peer feedback to one another, and publish their work.
This reflexive study aims to shed light on FAccT's activities to date and
identify major gaps and opportunities for translating contributions into
broader positive impact. To this end, we utilize a mixed-methods research
design. On the qualitative front, we develop a protocol for reviewing and
coding prior FAccT papers, tracing their distribution of topics, methods,
datasets, and disciplinary roots. We also design and administer a questionnaire
to reflect the voices of FAccT community members and affiliates on a wide range
of topics. On the quantitative front, we use the full text and citation network
associated with prior FAccT publications to provide further evidence about
topics and values represented in FAccT. We organize the findings from our
analysis into four main dimensions: the themes present in FAccT scholarship,
the values that underpin the work, the impact of the contributions both within
academic circles and beyond, and the practices and informal norms of the
community that has formed around FAccT. Finally, our work identifies several
suggestions on directions for change, as voiced by community members.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2022 10:38:05 GMT'}]",2022-06-15,"[['Laufer', 'Benjamin', ''], ['Jain', 'Sameer', ''], ['Cooper', 'A. Feder', ''], ['Kleinberg', 'Jon', ''], ['Heidari', 'Hoda', '']]","['FAccT', 'mixed methods', 'reflexivity', 'community perspectives', 'topics', 'values', 'impact']"
8889,2003.11902,Rafa{\l} Skinderowicz,Rafa{\l} Skinderowicz,Implementing a GPU-based parallel MAX-MIN Ant System,,"Future Generation Computer Systems, Volume 106, 2020, Pages
  277-295, ISSN 0167-739X",10.1016/j.future.2020.01.011,,cs.NE cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The MAX-MIN Ant System (MMAS) is one of the best-known Ant Colony
Optimization (ACO) algorithms proven to be efficient at finding satisfactory
solutions to many difficult combinatorial optimization problems. The slow-down
in Moore's law, and the availability of graphics processing units (GPUs)
capable of conducting general-purpose computations at high speed, has sparked
considerable research efforts into the development of GPU-based ACO
implementations. In this paper, we discuss a range of novel ideas for improving
the GPU-based parallel MMAS implementation, allowing it to better utilize the
computing power offered by two subsequent Nvidia GPU architectures.
Specifically, based on the weighted reservoir sampling algorithm we propose a
novel parallel implementation of the node selection procedure, which is at the
heart of the MMAS and other ACO algorithms. We also present a memory-efficient
implementation of another key-component -- the tabu list structure -- which is
used in the ACO's solution construction stage. The proposed implementations,
combined with the existing approaches, lead to a total of six MMAS variants,
which are evaluated on a set of Traveling Salesman Problem (TSP) instances
ranging from 198 to 3,795 cities. The results show that our MMAS implementation
is competitive with state-of-the-art GPU-based and multi-core CPU-based
parallel ACO implementations: in fact, the times obtained for the Nvidia V100
Volta GPU were up to 7.18x and 21.79x smaller, respectively. The fastest of the
proposed MMAS variants is able to generate over 1 million candidate solutions
per second when solving a 1,002-city instance. Moreover, we show that, combined
with the 2-opt local search heuristic, the proposed parallel MMAS finds
high-quality solutions for the TSP instances with up to 18,512 nodes.
","[{'version': 'v1', 'created': 'Sat, 18 Jan 2020 14:18:34 GMT'}]",2020-03-27,"[['Skinderowicz', 'Rafał', '']]","['parallel MAX-MIN Ant System', 'weighted reservoir sampling', 'Ant Colony Optimization', 'GPU', 'CUDA']"
8890,2104.10637,Zhan Yu,"Zhan Yu, Daniel W. C. Ho, Ding-Xuan Zhou",Robust Kernel-based Distribution Regression,29 pages,,10.1088/1361-6420/ac23c3,,cs.LG math.FA stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Regularization schemes for regression have been widely studied in learning
theory and inverse problems. In this paper, we study distribution regression
(DR) which involves two stages of sampling, and aims at regressing from
probability measures to real-valued responses over a reproducing kernel Hilbert
space (RKHS). Recently, theoretical analysis on DR has been carried out via
kernel ridge regression and several learning behaviors have been observed.
However, the topic has not been explored and understood beyond the least square
based DR. By introducing a robust loss function $l_{\sigma}$ for two-stage
sampling problems, we present a novel robust distribution regression (RDR)
scheme. With a windowing function $V$ and a scaling parameter $\sigma$ which
can be appropriately chosen, $l_{\sigma}$ can include a wide range of popular
used loss functions that enrich the theme of DR. Moreover, the loss
$l_{\sigma}$ is not necessarily convex, hence largely improving the former
regression class (least square) in the literature of DR. The learning rates
under different regularity ranges of the regression function $f_{\rho}$ are
comprehensively studied and derived via integral operator techniques. The
scaling parameter $\sigma$ is shown to be crucial in providing robustness and
satisfactory learning rates of RDR.
","[{'version': 'v1', 'created': 'Wed, 21 Apr 2021 17:03:46 GMT'}]",2021-10-27,"[['Yu', 'Zhan', ''], ['Ho', 'Daniel W. C.', ''], ['Zhou', 'Ding-Xuan', '']]","['learning theory', 'distribution regression', 'robust regression', 'integral operator', 'learning rate']"
8891,2301.00442,"Daniela P\""ohn","Daniela P\""ohn and Wolfgang Hommel",An Overview of Limitations and Approaches in Identity Management,"The 15th International Conference on Availability, Reliability and
  Security (ARES 2020), August 25--28, 2020, Virtual Event, Ireland",,10.1145/3407023.3407026,,cs.CR cs.SE cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identity and access management (I&AM) is the umbrella term for managing users
and their permissions. It is required for users to access different services.
These services can either be provided from their home organization, like a
company or university, or from external service providers, e.g., cooperation
partners. I&AM provides the management of identifiers with the attributes,
credentials, roles, and permissions the user has. Today, the requirements have
evolved from simply accessing individual web services in the internet or at a
company to the majority of all IT services from different service providers
with various accounts. Several identity management models have been created
with different approaches within.
  In order to adjust to heterogeneous environments, use cases, and the
evolution of identity management, this paper extends known requirements for
identity management. Existing models and approaches for identity management are
mapped to the derived requirements. Based on the mapping, advantages,
disadvantages, and gaps are identified. Current approaches suffer, as an
example, from trustworthiness and liability issues. Interoperability issues are
even more inherent as the approaches partly develop apart, forming an
heterogeneous environment. The results from this analysis emphasize the need
for one holistic identity management framework.
","[{'version': 'v1', 'created': 'Sun, 1 Jan 2023 16:53:31 GMT'}]",2023-01-03,"[['Pöhn', 'Daniela', ''], ['Hommel', 'Wolfgang', '']]","['Security', 'Identity', 'Identity Management', 'Federated Identity Management', 'Blockchain']"
8892,1909.09429,Paul Zikas,"Efstratios Geronikolakis, Paul Zikas, Steve Kateros, Nick Lydatakis,
  Stelios Georgiou, Mike Kentros, George Papagiannakis",A True AR Authoring Tool for Interactive Virtual Museums,"This is a preprint of a chapter for a planned book that was initiated
  by ""Visual Computing in Cultural Heritage"" and that is expected to be
  published by Springer. The final book chapter will differ from this preprint",,10.1007/978-3-030-37191-3_12,,cs.GR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, a new and innovative way of spatial computing that appeared
recently in the bibliography called True Augmented Reality (AR), is employed in
cultural heritage preservation. This innovation could be adapted by the Virtual
Museums of the future to enhance the quality of experience. It emphasises, the
fact that a visitor will not be able to tell, at a first glance, if the
artefact that he/she is looking at is real or not and it is expected to draw
the visitors' interest. True AR is not limited to artefacts but extends even to
buildings or life-sized character simulations of statues. It provides the best
visual quality possible so that the users will not be able to tell the real
objects from the augmented ones. Such applications can be beneficial for future
museums, as with True AR, 3D models of various exhibits, monuments, statues,
characters and buildings can be reconstructed and presented to the visitors in
a realistic and innovative way. We also propose our Virtual Reality Sample
application, a True AR playground featuring basic components and tools for
generating interactive Virtual Museum applications, alongside a 3D
reconstructed character (the priest of Asinou church) facilitating the
storyteller of the augmented experience.
","[{'version': 'v1', 'created': 'Fri, 20 Sep 2019 11:10:23 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Sep 2019 12:39:51 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Oct 2019 05:29:31 GMT'}, {'version': 'v4', 'created': 'Mon, 21 Oct 2019 11:09:20 GMT'}]",2020-10-21,"[['Geronikolakis', 'Efstratios', ''], ['Zikas', 'Paul', ''], ['Kateros', 'Steve', ''], ['Lydatakis', 'Nick', ''], ['Georgiou', 'Stelios', ''], ['Kentros', 'Mike', ''], ['Papagiannakis', 'George', '']]","['Augmented Reality', 'Cultural Heritage', 'Virtual Museums', 'Gamification']"
8893,2003.09347,Chawin Sitawarin,"Chawin Sitawarin, Supriyo Chakraborty, David Wagner",SAT: Improving Adversarial Training via Curriculum-Based Loss Smoothing,"Published at AISec '21: Proceedings of the 14th ACM Workshop on
  Artificial Intelligence and Security. ACM DL link:
  https://dl.acm.org/doi/abs/10.1145/3474369.3486878",,10.1145/3474369.3486878,,cs.LG cs.CR stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Adversarial training (AT) has become a popular choice for training robust
networks. However, it tends to sacrifice clean accuracy heavily in favor of
robustness and suffers from a large generalization error. To address these
concerns, we propose Smooth Adversarial Training (SAT), guided by our analysis
on the eigenspectrum of the loss Hessian. We find that curriculum learning, a
scheme that emphasizes on starting ""easy"" and gradually ramping up on the
""difficulty"" of training, smooths the adversarial loss landscape for a suitably
chosen difficulty metric. We present a general formulation for curriculum
learning in the adversarial setting and propose two difficulty metrics based on
the maximal Hessian eigenvalue (H-SAT) and the softmax probability (P-SA). We
demonstrate that SAT stabilizes network training even for a large perturbation
norm and allows the network to operate at a better clean accuracy versus
robustness trade-off curve compared to AT. This leads to a significant
improvement in both clean accuracy and robustness compared to AT, TRADES, and
other baselines. To highlight a few results, our best model improves normal and
robust accuracy by 6% and 1% on CIFAR-100 compared to AT, respectively. On
Imagenette, a ten-class subset of ImageNet, our model outperforms AT by 23% and
3% on normal and robust accuracy respectively.
","[{'version': 'v1', 'created': 'Wed, 18 Mar 2020 20:59:45 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Jun 2020 17:24:26 GMT'}, {'version': 'v3', 'created': 'Mon, 8 Nov 2021 10:53:28 GMT'}]",2021-11-09,"[['Sitawarin', 'Chawin', ''], ['Chakraborty', 'Supriyo', ''], ['Wagner', 'David', '']]","['Adversarial Machine Learning', 'Adversarial Examples', 'CurriculumLearning']"
8894,2106.02878,Zhen-Hai Chang,Wei Liu and Zhenhai Chang and Caiyan Jia and Yimei Zheng,"A Generative Node-attribute Network Model for Detecting Generalized
  Structure",,,10.1016/j.physa.2021.126557,,cs.SI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Exploring meaningful structural regularities embedded in networks is a key to
understanding and analyzing the structure and function of a network. The
node-attribute information can help improve such understanding and analysis.
However, most of the existing methods focus on detecting traditional
communities, i.e., groupings of nodes with dense internal connections and
sparse external ones. In this paper, based on the connectivity behavior of
nodes and homogeneity of attributes, we propose a principle model (named GNAN),
which can generate both topology information and attribute information. The new
model can detect not only community structure, but also a range of other types
of structure in networks, such as bipartite structure, core-periphery
structure, and their mixture structure, which are collectively referred to as
generalized structure. The proposed model that combines topological information
and node-attribute information can detect communities more accurately than the
model that only uses topology information. The dependency between attributes
and communities can be automatically learned by our model and thus we can
ignore the attributes that do not contain useful information. The model
parameters are inferred by using the expectation-maximization algorithm. And a
case study is provided to show the ability of our model in the semantic
interpretability of communities. Experiments on both synthetic and real-world
networks show that the new model is competitive with other state-of-the-art
models.
","[{'version': 'v1', 'created': 'Sat, 5 Jun 2021 12:07:04 GMT'}]",2021-12-08,"[['Liu', 'Wei', ''], ['Chang', 'Zhenhai', ''], ['Jia', 'Caiyan', ''], ['Zheng', 'Yimei', '']]","['attributed network', 'community detection', 'probabilistic model-based method', 'semanticinterpretability']"
8895,2011.02313,Suthee Ruangwises,"Suthee Ruangwises, Toshiya Itoh","Physical ZKP for Connected Spanning Subgraph: Applications to Bridges
  Puzzle and Other Problems",This paper has appeared at UCNC 2021,,10.1007/978-3-030-87993-8_10,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An undirected graph $G$ is known to both the prover $P$ and the verifier $V$,
but only $P$ knows a subgraph $H$ of $G$. Without revealing any information
about $H$, $P$ wants to convince $V$ that $H$ is a connected spanning subgraph
of $G$, i.e. $H$ is connected and contains all vertices of $G$. In this paper,
we propose an unconventional zero-knowledge proof protocol using a physical
deck of cards, which enables $P$ to physically show that $H$ satisfies the
condition without revealing it. We also show applications of this protocol to
verify solutions of three well-known NP-complete problems: the Hamiltonian
cycle problem, the maximum leaf spanning tree problem, and a popular logic
puzzle called Bridges.
","[{'version': 'v1', 'created': 'Tue, 3 Nov 2020 10:51:00 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Nov 2020 13:36:32 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Feb 2021 17:33:40 GMT'}, {'version': 'v4', 'created': 'Sun, 30 May 2021 15:50:24 GMT'}, {'version': 'v5', 'created': 'Sun, 8 Aug 2021 10:25:23 GMT'}]",2021-10-14,"[['Ruangwises', 'Suthee', ''], ['Itoh', 'Toshiya', '']]","['zero-knowledge proof', 'card-based cryptography', 'connected spanningsubgraph', 'Hamiltonian cycle', 'maximum leaf spanning tree', 'graph', 'Bridges', 'puzzle']"
8896,2004.07943,Amir Javadpour,"Amir Javadpour, Sanaz Kazemi Abharian and Guojun Wang","Feature Selection and Intrusion Detection in Cloud Environment based on
  Machine Learning Algorithms",,,10.1109/ISPA/IUCC.2017.00215,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Characteristics and way of behavior of attacks and infiltrators on computer
networks are usually very difficult and need an expert In addition; the
advancement of computer networks, the number of attacks and infiltrations are
also increasing. In fact, the knowledge coming from an expert will lose its
value over time and must be updated and made available to the system and this
makes the need for the expert person always felt. In machine learning
techniques, knowledge is extracted from the data itself which has diminished
the role of the expert. Various methods used to detect intrusions, such as
statistical models, safe system approach, neural networks, etc., all weaken the
fact that it uses all the features of an information packet rotating in the
network for intrusion detection. Also, the huge volume of information and the
unthinkable state space is also an important issue in the detection of
intrusion. Therefore, the need for automatic identification of new and
suspicious patterns in an attempt for intrusion with the use of more efficient
methods Lower cost and higher performance is needed more than before. The
purpose of this study is to provide a new method based on intrusion detection
systems and its various architectures aimed at increasing the accuracy of
intrusion detection in cloud computing. Keywords : intrusion detection, feature
Selection, classification Algorithm, machine learning, neural network.
","[{'version': 'v1', 'created': 'Wed, 15 Apr 2020 14:22:50 GMT'}]",2020-04-20,"[['Javadpour', 'Amir', ''], ['Abharian', 'Sanaz Kazemi', ''], ['Wang', 'Guojun', '']]","['intrusion detection', 'feature Selection', 'classification']"
8897,2210.11228,Manuel Rigger,"Manuel Rigger, Zhendong Su",Intramorphic Testing: A New Approach to the Test Oracle Problem,,,10.1145/3563835.3567662,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  A test oracle determines whether a system behaves correctly for a given
input. Automatic testing techniques rely on an automated test oracle to test
the system without user interaction. Important families of automated test
oracles include Differential Testing and Metamorphic Testing, which are both
black-box approaches; that is, they provide a test oracle that is oblivious to
the system's internals. In this work, we propose Intramorphic Testing as a
white-box methodology to tackle the test oracle problem. To realize an
Intramorphic Testing approach, a modified version of the system is created, for
which, given a single input, a test oracle can be provided that relates the
output of the original and modified systems. As a concrete example, by
replacing a greater-equals operator in the implementation of a sorting
algorithm with smaller-equals, it would be expected that the output of the
modified implementation is the reverse output of the original implementation.
In this paper, we introduce the methodology and illustrate it via a set of use
cases.
","[{'version': 'v1', 'created': 'Thu, 20 Oct 2022 13:05:21 GMT'}]",2022-10-21,"[['Rigger', 'Manuel', ''], ['Su', 'Zhendong', '']]","['test oracle problem', 'white-box testing', 'automatedtesting']"
8898,1803.10670,Luca Padovani,"Luca Padovani (Universit\`a di Torino, Italy)",Deadlock-Free Typestate-Oriented Programming,,"The Art, Science, and Engineering of Programming, 2018, Vol. 2,
  Issue 3, Article 15",10.22152/programming-journal.org/2018/2/15,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context. TypeState-Oriented Programming (TSOP) is a paradigm intended to help
developers in the implementation and use of mutable objects whose public
interface depends on their private state. Under this paradigm, well-typed
programs are guaranteed to conform with the protocol of the objects they use.
  Inquiry. Previous works have investigated TSOP for both sequential and
concurrent objects. However, an important difference between the two settings
still remains. In a sequential setting, a well-typed program either progresses
indefinitely or terminates eventually. In a concurrent setting, protocol
conformance is no longer enough to avoid deadlocks, a situation in which the
execution of the program halts because two or more objects are involved in
mutual dependencies that prevent any further progress.
  Approach. In this work, we put forward a refinement of TSOP for concurrent
objects guaranteeing that well-typed programs not only conform with the
protocol of the objects they use, but are also deadlock free. The key
ingredients of the type system are behavioral types, used to specify and
enforce object protocols, and dependency relations, used to represent abstract
descriptions of the dependencies between objects and detect circularities that
might cause deadlocks.
  Knowledge. The proposed approach stands out for two features. First, the
approach is fully compositional and therefore scalable: the objects of a large
program can be type checked in isolation; deadlock freedom of an object
composition solely depends on the types of the objects being composed; any
modification/refactoring of an object that does not affect its public interface
does not affect other objects either. Second, we provide the first deadlock
analysis technique for join patterns, a high-level concurrency abstraction with
which programmers can express complex synchronizations in a succinct and
declarative form.
  Grounding. We detail the proposed typing discipline for a core programming
language blending concurrent objects, asynchronous message passing and join
patterns. We prove that the type system is sound and give non-trivial examples
of programs that can be successfully analyzed. A Haskell implementation of the
type system that demonstrates the feasibility of the approach is publicly
available.
  Importance. The static analysis technique described in this work can be used
to certify programs written in a core language for concurrent TSOP with proven
correctness guarantees. This is an essential first step towards the integration
and application of the technique in a real-world developer toolchain, making
programming of such systems more productive and less frustrating.
","[{'version': 'v1', 'created': 'Wed, 28 Mar 2018 15:10:38 GMT'}]",2018-03-29,"[['Padovani', 'Luca', '', 'Università di Torino, Italy']]","['concurrent objects', 'actors', 'deadlock freedom', 'static analysis', 'behavioral types']"
8899,2107.03279,Omar Vidal Pino,"Omar Vidal Pino, Erickson Rangel Nascimento, Mario Fernando Montenegro
  Campos",Introducing the structural bases of typicality effects in deep learning,"14 pages (12 + 2 reference); 13 Figures and 2 Tables. arXiv admin
  note: text overlap with arXiv:1906.03365",,10.1016/j.imavis.2021.104249,,cs.CV cs.AI math.RT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we hypothesize that the effects of the degree of typicality in
natural semantic categories can be generated based on the structure of
artificial categories learned with deep learning models. Motivated by the human
approach to representing natural semantic categories and based on the Prototype
Theory foundations, we propose a novel Computational Prototype Model (CPM) to
represent the internal structure of semantic categories. Unlike other prototype
learning approaches, our mathematical framework proposes a first approach to
provide deep neural networks with the ability to model abstract semantic
concepts such as category central semantic meaning, typicality degree of an
object's image, and family resemblance relationship. We proposed several
methodologies based on the typicality's concept to evaluate our CPM-model in
image semantic processing tasks such as image classification, a global semantic
description, and transfer learning. Our experiments on different image
datasets, such as ImageNet and Coco, showed that our approach might be an
admissible proposition in the effort to endow machines with greater power of
abstraction for the semantic representation of objects' categories.
","[{'version': 'v1', 'created': 'Wed, 7 Jul 2021 15:15:43 GMT'}]",2021-07-08,"[['Pino', 'Omar Vidal', ''], ['Nascimento', 'Erickson Rangel', ''], ['Campos', 'Mario Fernando Montenegro', '']]","['Typicality Effects', 'Category Semantic Representation', 'Image Semantic Representation', 'Semantic classification', 'Global Features Description', 'Prototype Theory']"
8900,2004.04881,Sakib Haque,"Sakib Haque, Alexander LeClair, Lingfei Wu, Collin McMillan","Improved Automatic Summarization of Subroutines via Attention to File
  Context",,,10.1145/3379597.3387449,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software documentation largely consists of short, natural language summaries
of the subroutines in the software. These summaries help programmers quickly
understand what a subroutine does without having to read the source code him or
herself. The task of writing these descriptions is called ""source code
summarization"" and has been a target of research for several years. Recently,
AI-based approaches have superseded older, heuristic-based approaches. Yet, to
date these AI-based approaches assume that all the content needed to predict
summaries is inside subroutine itself. This assumption limits performance
because many subroutines cannot be understood without surrounding context. In
this paper, we present an approach that models the file context of subroutines
(i.e. other subroutines in the same file) and uses an attention mechanism to
find words and concepts to use in summaries. We show in an experiment that our
approach extends and improves several recent baselines.
","[{'version': 'v1', 'created': 'Fri, 10 Apr 2020 02:22:28 GMT'}]",2020-04-13,"[['Haque', 'Sakib', ''], ['LeClair', 'Alexander', ''], ['Wu', 'Lingfei', ''], ['McMillan', 'Collin', '']]","['source code summarization', 'neural networks', 'documentation generation', 'artificial intelligence', 'natural language processing']"
8901,1606.00153,Nicolas Robinson-Garcia,"Nicolas Robinson-Garcia, Thed N. van Leeuwen and Ismael Rafols","Using almetrics for contextualised mapping of societal impact: From hits
  to networks","This paper has been accepted for publication in Science and Public
  Policy","Robinson-Garcia, N., van Leeuwen, T.N., Rafols, I. Using almetrics
  for contextualised mapping of societal impact: From hits to networks. Science
  and Public Policy (2017)",10.1093/scipol/scy024,,cs.DL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this article, we develop a method that uses altmetric data to analyse
researchers' interactions, as a way of mapping the contexts of potential
societal impact. In the face of an increasing policy demand for quantitative
methodologies to assess societal impact, social media data (altmetrics) has
been presented as a potential method to capture broader forms of impact.
However, current altmetric indicators were extrapolated from traditional
citation approaches and are seen as problematic for assessing societal impact.
In contrast, established qualitative methodologies for societal impact
assessment are based on interaction approaches. These argue that assessment
should focus on mapping the contexts in which engagement among researchers and
stakeholders take place, as a means to understand the pathways to societal
impact. Following these approaches, we propose to shift the use of altmetric
data towards network analysis of researchers and stakeholders. We carry out two
case studies, analysing researchers' networks with Twitter data. The comparison
illustrates the potential of Twitter networks to capture disparate degrees of
policy engagement. We propose that this mapping method can be used as an input
within broader methodologies in case studies of societal impact assessment.
","[{'version': 'v1', 'created': 'Wed, 1 Jun 2016 07:50:45 GMT'}, {'version': 'v2', 'created': 'Tue, 16 May 2017 10:56:38 GMT'}]",2018-07-12,"[['Robinson-Garcia', 'Nicolas', ''], ['van Leeuwen', 'Thed N.', ''], ['Rafols', 'Ismael', '']]","['Societal impact', 'social engagement', 'open science', 'altmetrics', 'twitter', 'research evaluation']"
8902,1602.05681,Justin Hsu,"Gilles Barthe, Marco Gaboardi, Benjamin Gr\'egoire, Justin Hsu,
  Pierre-Yves Strub",A program logic for union bounds,,,10.4230/LIPIcs.ICALP.2016.107,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a probabilistic Hoare logic aHL based on the union bound, a tool
from basic probability theory. While the union bound is simple, it is an
extremely common tool for analyzing randomized algorithms. In formal
verification terms, the union bound allows flexible and compositional reasoning
over possible ways an algorithm may go wrong. It also enables a clean
separation between reasoning about probabilities and reasoning about events,
which are expressed as standard first-order formulas in our logic. Notably,
assertions in our logic are non-probabilistic, even though we can conclude
probabilistic facts from the judgments.
  Our logic can also prove accuracy properties for interactive programs, where
the program must produce intermediate outputs as soon as pieces of the input
arrive, rather than accessing the entire input at once. This setting also
enables adaptivity, where later inputs may depend on earlier intermediate
outputs. We show how to prove accuracy for several examples from the
differential privacy literature, both interactive and non-interactive.
","[{'version': 'v1', 'created': 'Thu, 18 Feb 2016 05:46:25 GMT'}, {'version': 'v2', 'created': 'Mon, 9 May 2016 20:20:08 GMT'}, {'version': 'v3', 'created': 'Fri, 8 Nov 2019 06:05:16 GMT'}]",2019-11-11,"[['Barthe', 'Gilles', ''], ['Gaboardi', 'Marco', ''], ['Grégoire', 'Benjamin', ''], ['Hsu', 'Justin', ''], ['Strub', 'Pierre-Yves', '']]","['Probabilistic Algorithms', 'Accuracy', 'Formal Verification', 'Hoare Logic', 'Union Bound']"
8903,2202.02053,Daniel Buschek,"Karim Benharrak, Florian Lehmann, Hai Dang, Daniel Buschek","SummaryLens -- A Smartphone App for Exploring Interactive Use of
  Automated Text Summarization in Everyday Life","4 pages, 1 figure, ACM IUI 2022 Companion",,10.1145/3490100.3516471,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present SummaryLens, a concept and prototype for a mobile tool that
leverages automated text summarization to enable users to quickly scan and
summarize physical text documents. We further combine this with a
text-to-speech system to read out the summary on demand. With this concept, we
propose and explore a concrete application case of bringing ongoing progress in
AI and Natural Language Processing to a broad audience with interactive use
cases in everyday life. Based on our implemented features, we describe a set of
potential usage scenarios and benefits, including support for low-vision,
low-literate and dyslexic users. A first usability study shows that the
interactive use of automated text summarization in everyday life has noteworthy
potential. We make the prototype available as an open-source project to
facilitate further research on such tools.
","[{'version': 'v1', 'created': 'Fri, 4 Feb 2022 09:52:48 GMT'}]",2022-02-07,"[['Benharrak', 'Karim', ''], ['Lehmann', 'Florian', ''], ['Dang', 'Hai', ''], ['Buschek', 'Daniel', '']]","['natural language processing', 'mobile devices', 'text summarization', 'user studies']"
8904,2009.07974,Shuyue Guan,"Shuyue Guan, Murray Loew","Analysis of Generalizability of Deep Neural Networks Based on the
  Complexity of Decision Boundary","7 pages, 11 figures. Accepted by ICMLA 2020","19th IEEE International Conference on Machine Learning and
  Applications (ICMLA), 2020, pp. 101-106",10.1109/ICMLA51294.2020.00025,,cs.LG cs.AI cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For supervised learning models, the analysis of generalization ability
(generalizability) is vital because the generalizability expresses how well a
model will perform on unseen data. Traditional generalization methods, such as
the VC dimension, do not apply to deep neural network (DNN) models. Thus, new
theories to explain the generalizability of DNNs are required. In this study,
we hypothesize that the DNN with a simpler decision boundary has better
generalizability by the law of parsimony (Occam's Razor). We create the
decision boundary complexity (DBC) score to define and measure the complexity
of decision boundary of DNNs. The idea of the DBC score is to generate data
points (called adversarial examples) on or near the decision boundary. Our new
approach then measures the complexity of the boundary using the entropy of
eigenvalues of these data. The method works equally well for high-dimensional
data. We use training data and the trained model to compute the DBC score. And,
the ground truth for model's generalizability is its test accuracy. Experiments
based on the DBC score have verified our hypothesis. The DBC is shown to
provide an effective method to measure the complexity of a decision boundary
and gives a quantitative measure of the generalizability of DNNs.
","[{'version': 'v1', 'created': 'Wed, 16 Sep 2020 23:25:52 GMT'}]",2021-03-01,"[['Guan', 'Shuyue', ''], ['Loew', 'Murray', '']]","['complexity of decision boundary', 'generalization ability', 'deep neural networks', 'network generalizability', 'adversarial examples']"
8905,2004.04552,"Ga\""el Poux-M\'edard","Ga\""el Poux-M\'edard, Julien Velcin, Sabine Loudcher","Interactions in information spread: quantification and interpretation
  using stochastic block models","17 pages, 3 figures, RecSys'21",,10.1145/3460231.3474254,,cs.LG cond-mat.stat-mech physics.data-an stat.ML,http://creativecommons.org/licenses/by/4.0/,"  In most real-world applications, it is seldom the case that a given
observable evolves independently of its environment. In social networks, users'
behavior results from the people they interact with, news in their feed, or
trending topics. In natural language, the meaning of phrases emerges from the
combination of words. In general medicine, a diagnosis is established on the
basis of the interaction of symptoms. Here, we propose a new model, the
Interactive Mixed Membership Stochastic Block Model (IMMSBM), which
investigates the role of interactions between entities (hashtags, words, memes,
etc.) and quantifies their importance within the aforementioned corpora. We
find that interactions play an important role in those corpora. In inference
tasks, taking them into account leads to average relative changes with respect
to non-interactive models of up to 150\% in the probability of an outcome.
Furthermore, their role greatly improves the predictive power of the model. Our
findings suggest that neglecting interactions when modeling real-world
phenomena might lead to incorrect conclusions being drawn.
","[{'version': 'v1', 'created': 'Thu, 9 Apr 2020 14:22:10 GMT'}, {'version': 'v2', 'created': 'Tue, 4 May 2021 16:33:48 GMT'}, {'version': 'v3', 'created': 'Tue, 1 Feb 2022 16:31:33 GMT'}]",2022-02-02,"[['Poux-Médard', 'Gaël', ''], ['Velcin', 'Julien', ''], ['Loudcher', 'Sabine', '']]","['Interaction modeling', 'Block models', 'Information diffusion', 'Recommender systems']"
8906,2212.14591,Fabrice Rossi,"Fabrice Rossi (CEREMADE), Florian Barbaro (SAMM)",Mixture of von Mises-Fisher distribution with sparse prototypes,,"Neurocomputing, 2022, 501, pp.41-74",10.1016/j.neucom.2022.05.118,,cs.LG math.ST stat.ML stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mixtures of von Mises-Fisher distributions can be used to cluster data on the
unit hypersphere. This is particularly adapted for high-dimensional directional
data such as texts. We propose in this article to estimate a von Mises mixture
using a l 1 penalized likelihood. This leads to sparse prototypes that improve
clustering interpretability. We introduce an expectation-maximisation (EM)
algorithm for this estimation and explore the trade-off between the sparsity
term and the likelihood one with a path following algorithm. The model's
behaviour is studied on simulated data and, we show the advantages of the
approach on real data benchmark. We also introduce a new data set on financial
reports and exhibit the benefits of our method for exploratory analysis.
","[{'version': 'v1', 'created': 'Fri, 30 Dec 2022 08:00:38 GMT'}]",2023-01-02,"[['Rossi', 'Fabrice', '', 'CEREMADE'], ['Barbaro', 'Florian', '', 'SAMM']]","['clustering', 'mixtures', 'von Mises-Fisher', 'expectation maximization', 'high dimensional data', 'path following strategy', 'model selection']"
8907,2006.13200,Nikolay Arefyev,"Nikolay Arefyev, Boris Sheludko, and Tatiana Aleksashina",Combining Neural Language Models for WordSense Induction,"International Conference on Analysis of Images, Social Networks and
  Texts AIST 2019: Analysis of Images, Social Networks and Texts, pp 105-121","van der Aalst W. et al. (eds) Analysis of Images, Social Networks
  and Texts. AIST 2019. Lecture Notes in Computer Science, vol 11832. Springer,
  Cham",10.1007/978-3-030-37334-4_10,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Word sense induction (WSI) is the problem of grouping occurrences of an
ambiguous word according to the expressed sense of this word. Recently a new
approach to this task was proposed, which generates possible substitutes for
the ambiguous word in a particular context using neural language models, and
then clusters sparse bag-of-words vectors built from these substitutes. In this
work, we apply this approach to the Russian language and improve it in two
ways. First, we propose methods of combining left and right contexts, resulting
in better substitutes generated. Second, instead of fixed number of clusters
for all ambiguous words we propose a technique for selecting individual number
of clusters for each word. Our approach established new state-of-the-art level,
improving current best results of WSI for the Russian language on two RUSSE
2018 datasets by a large margin.
","[{'version': 'v1', 'created': 'Tue, 23 Jun 2020 17:57:25 GMT'}]",2020-06-24,"[['Arefyev', 'Nikolay', ''], ['Sheludko', 'Boris', ''], ['Aleksashina', 'Tatiana', '']]","['word sense induction', 'contextual substitutes', 'neural language models']"
8908,2208.14074,Pihe Hu,"Pihe Hu, Ling Pan, Yu Chen, Zhixuan Fang, Longbo Huang","Effective Multi-User Delay-Constrained Scheduling with Deep Recurrent
  Reinforcement Learning",Accepted by MobiHoc 2022,,10.1145/3492866.3549712,,cs.LG cs.NI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Multi-user delay constrained scheduling is important in many real-world
applications including wireless communication, live streaming, and cloud
computing. Yet, it poses a critical challenge since the scheduler needs to make
real-time decisions to guarantee the delay and resource constraints
simultaneously without prior information of system dynamics, which can be
time-varying and hard to estimate. Moreover, many practical scenarios suffer
from partial observability issues, e.g., due to sensing noise or hidden
correlation. To tackle these challenges, we propose a deep reinforcement
learning (DRL) algorithm, named Recurrent Softmax Delayed Deep Double
Deterministic Policy Gradient ($\mathtt{RSD4}$), which is a data-driven method
based on a Partially Observed Markov Decision Process (POMDP) formulation.
$\mathtt{RSD4}$ guarantees resource and delay constraints by Lagrangian dual
and delay-sensitive queues, respectively. It also efficiently tackles partial
observability with a memory mechanism enabled by the recurrent neural network
(RNN) and introduces user-level decomposition and node-level merging to ensure
scalability. Extensive experiments on simulated/real-world datasets demonstrate
that $\mathtt{RSD4}$ is robust to system dynamics and partially observable
environments, and achieves superior performances over existing DRL and
non-DRL-based methods.
","[{'version': 'v1', 'created': 'Tue, 30 Aug 2022 08:44:15 GMT'}]",2022-08-31,"[['Hu', 'Pihe', ''], ['Pan', 'Ling', ''], ['Chen', 'Yu', ''], ['Fang', 'Zhixuan', ''], ['Huang', 'Longbo', '']]","['Delay-constrained', 'Scheduling', 'Partial Observability', 'Deep Reinforcement Learning1INTRODUCTION']"
8909,2006.15296,Rakshitha Godahewa,"Rakshitha Godahewa, Chang Deng, Arnaud Prouzeau, Christoph Bergmeir","Simulation and Optimisation of Air Conditioning Systems using Machine
  Learning",,IEEE Access 2022,10.1109/ACCESS.2022.3142174,Volume 10,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In building management, usually static thermal setpoints are used to maintain
the inside temperature of a building at a comfortable level irrespective of its
occupancy. This strategy can cause a massive amount of energy wastage and
therewith increase energy related expenses. This paper explores how to optimise
the setpoints used in a particular room during its unoccupied periods using
machine learning approaches. We introduce a deep-learning model based on
Recurrent Neural Networks (RNN) that can predict the temperatures of a future
period directly where a particular room is unoccupied and by using these
predicted temperatures, we define the optimal thermal setpoints to be used
inside the room during the unoccupied period. We show that RNNs are
particularly suitable for this learning task as they enable us to learn across
many relatively short series, which is necessary to focus on particular
operation modes of the air conditioning (AC) system. We evaluate the prediction
accuracy of our RNN model against a set of state-of-the-art models and are able
to outperform those by a large margin. We furthermore analyse the usage of our
RNN model in optimising the energy consumption of an AC system in a real-world
scenario using the temperature data from a university lecture theatre. Based on
the simulations, we show that our RNN model can lead to savings around 20%
compared with the traditional temperature controlling model that does not use
optimisation techniques.
","[{'version': 'v1', 'created': 'Sat, 27 Jun 2020 06:42:25 GMT'}]",2022-01-20,"[['Godahewa', 'Rakshitha', ''], ['Deng', 'Chang', ''], ['Prouzeau', 'Arnaud', ''], ['Bergmeir', 'Christoph', '']]","['energy optimisation', 'simulation', 'temperature forecasting', 'machine learning', 'engineering applications']"
8910,1604.02934,Racha El-Hajj,"Racha El-Hajj (UL, Heudiasyc, Labex MS2T), Duc-Cuong Dang (Heudiasyc,
  Labex MS2T, UON), Aziz Moukrim (Labex MS2T, Heudiasyc)",Solving the Team Orienteering Problem with Cutting Planes,,"Computers and Operations Research, Elsevier, 2016, pp.27",10.1016/j.cor.2016.04.008,,cs.RO cs.DS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Team Orienteering Problem (TOP) is an attractive variant of the Vehicle
Routing Problem (VRP). The aim is to select customers and at the same time
organize the visits for a vehicle fleet so as to maximize the collected profits
and subject to a travel time restriction on each vehicle. In this paper, we
investigate the effective use of a linear formulation with polynomial number of
variables to solve TOP. Cutting planes are the core components of our solving
algorithm. It is first used to solve smaller and intermediate models of the
original problem by considering fewer vehicles. Useful information are then
retrieved to solve larger models, and eventually reaching the original problem.
Relatively new and dedicated methods for TOP, such as identification of
irrelevant arcs and mandatory customers, clique and independent-set cuts based
on the incompatibilities, and profit/customer restriction on subsets of
vehicles, are introduced. We evaluated our algorithm on the standard benchmark
of TOP. The results show that the algorithm is competitive and is able to prove
the optimality for 12 instances previously unsolved.
","[{'version': 'v1', 'created': 'Mon, 11 Apr 2016 13:08:48 GMT'}]",2016-04-12,"[['El-Hajj', 'Racha', '', 'UL, Heudiasyc, Labex MS2T'], ['Dang', 'Duc-Cuong', '', 'Heudiasyc,\n  Labex MS2T, UON'], ['Moukrim', 'Aziz', '', 'Labex MS2T, Heudiasyc']]","['Team Orienteering Problem', 'cutting planes', 'dominance property', 'incompatibility', 'clique cut', 'independent-set cut']"
8911,2007.04477,Nicholas Kluge Corr\^ea,Nicholas Kluge Corr\^ea and Nythamar de Oliveira,Good AI for the Present of Humanity Democratizing AI Governance,,The AI Ethics Journal (2021),10.47289/AIEJ20210716-2,,cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  What do Cyberpunk and AI Ethics have to do with each other? Cyberpunk is a
sub-genre of science fiction that explores the post-human relationships between
human experience and technology. One similarity between AI Ethics and Cyberpunk
literature is that both seek to explore future social and ethical problems that
our technological advances may bring upon society. In recent years, an
increasing number of ethical matters involving AI have been pointed and
debated, and several ethical principles and guides have been suggested as
governance policies for the tech industry. However, would this be the role of
AI Ethics? To serve as a soft and ambiguous version of the law? We would like
to advocate in this article for a more Cyberpunk way of doing AI Ethics, with a
more democratic way of governance. In this study, we will seek to expose some
of the deficits of the underlying power structures of the AI industry, and
suggest that AI governance be subject to public opinion, so that good AI can
become good AI for all.
","[{'version': 'v1', 'created': 'Wed, 8 Jul 2020 23:50:28 GMT'}, {'version': 'v10', 'created': 'Sat, 26 Dec 2020 21:26:07 GMT'}, {'version': 'v11', 'created': 'Tue, 1 Jun 2021 18:31:11 GMT'}, {'version': 'v12', 'created': 'Sat, 17 Jul 2021 17:21:15 GMT'}, {'version': 'v13', 'created': 'Tue, 17 Aug 2021 01:27:49 GMT'}, {'version': 'v2', 'created': 'Sun, 12 Jul 2020 22:52:10 GMT'}, {'version': 'v3', 'created': 'Thu, 23 Jul 2020 22:40:36 GMT'}, {'version': 'v4', 'created': 'Fri, 7 Aug 2020 23:48:38 GMT'}, {'version': 'v5', 'created': 'Thu, 27 Aug 2020 17:26:32 GMT'}, {'version': 'v6', 'created': 'Sat, 5 Sep 2020 18:55:27 GMT'}, {'version': 'v7', 'created': 'Sun, 18 Oct 2020 04:11:19 GMT'}, {'version': 'v8', 'created': 'Sun, 25 Oct 2020 03:53:29 GMT'}, {'version': 'v9', 'created': 'Tue, 27 Oct 2020 02:42:33 GMT'}]",2021-08-18,"[['Corrêa', 'Nicholas Kluge', ''], ['de Oliveira', 'Nythamar', '']]","['AI Ethics', 'Cyberpunk', 'Technological Unemployment', 'Humanitarian Cost', 'Lack of Diversity', 'Ethical Guidelines']"
8912,2110.14765,Gabriele D'Angelo,"Luca Serena, Stefano Ferretti, Gabriele D'Angelo","Cryptocurrencies Activity as a Complex Network: Analysis of Transactions
  Graphs",,"Peer-to-Peer Networking and Applications (2021), Special Issue on
  Blockchain for Peer-to-Peer Computing",10.1007/s12083-021-01220-4,,cs.NI cs.CY cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The number of users approaching the world of cryptocurrencies exploded in the
last years, and consequently the daily interactions on their underlying
distributed ledgers have intensified. In this paper, we analyze the flow of
these digital transactions in a certain period of time, trying to discover
important insights on the typical use of these technologies by studying,
through complex network theory, the patterns of interactions in four prominent
and different Distributed Ledger Technologies (DLTs), namely Bitcoin, DogeCoin,
Ethereum, Ripple. In particular, we describe the Distributed Ledger Network
Analyzer (DiLeNA), a software tool for the investigation of the transactions
network recorded in DLTs. We show that studying the network characteristics and
peculiarities is of paramount importance, in order to understand how users
interact in the DLT. For instance, our analyses reveal that all transaction
graphs exhibit small world properties.
","[{'version': 'v1', 'created': 'Tue, 14 Sep 2021 08:32:36 GMT'}]",2021-10-29,"[['Serena', 'Luca', ''], ['Ferretti', 'Stefano', ''], [""D'Angelo"", 'Gabriele', '']]","['Distributed Ledger Technologies', 'Blockchain', 'Network Analysis', 'Complex Networks; Cryptocurrencies']"
8913,2101.11711,Nikolaos Dervilis Dr,"Kartik Chandrasekhar, Nevena Stevanovic, Elizabeth J. Cross, Nikolaos
  Dervilis, Keith Worden","Damage detection in operational wind turbine blades using a new approach
  based on machine learning",,"This is an author produced version of a paper subsequently
  published in Renewable Energy, Elsevier, 2021. Uploaded in accordance with
  the publisher's self-archiving policy",10.1016/j.renene.2020.12.119,,cs.LG physics.data-an,http://creativecommons.org/licenses/by/4.0/,"  The application of reliable structural health monitoring (SHM) technologies
to operational wind turbine blades is a challenging task, due to the uncertain
nature of the environments they operate in. In this paper, a novel SHM
methodology, which uses Gaussian Processes (GPs) is proposed. The methodology
takes advantage of the fact that the blades on a turbine are nominally
identical in structural properties and encounter the same environmental and
operational variables (EOVs). The properties of interest are the first edgewise
frequencies of the blades. The GPs are used to predict the edge frequencies of
one blade given that of another, after these relationships between the pairs of
blades have been learned when the blades are in a healthy state. In using this
approach, the proposed SHM methodology is able to identify when the blades
start behaving differently from one another over time. To validate the concept,
the proposed SHM system is applied to real onshore wind turbine blade data,
where some form of damage was known to have taken place. X-bar control chart
analysis of the residual errors between the GP predictions and actual
frequencies show that the system successfully identified early onset of damage
as early as six months before it was identified and remedied.
","[{'version': 'v1', 'created': 'Mon, 25 Jan 2021 21:56:33 GMT'}]",2021-01-29,"[['Chandrasekhar', 'Kartik', ''], ['Stevanovic', 'Nevena', ''], ['Cross', 'Elizabeth J.', ''], ['Dervilis', 'Nikolaos', ''], ['Worden', 'Keith', '']]","['structural health monitoring', 'wind turbine blades', 'machine']"
8914,2103.06574,Mohammad Shaqfeh Ph.D.,"Mohammad Shaqfeh, Salah Hessien, Erchin Serpedin","Utility of Traffic Information in Dynamic Routing: Is Sharing
  Information Always Useful?","6 pages, 6 figures, published in 2020 IEEE 3rd Connected and
  Automated Vehicles Symposium (CAVS)",,10.1109/CAVS51000.2020.9334640,,cs.MA,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Real-time traffic information can be utilized to enhance the efficiency of
transportation networks by dynamically updating routing plans to mitigate
traffic jams. However, an interesting question is whether the network
coordinator should broadcast real-time traffic information to all network users
or communicate it selectively to some of them. Which option enhances the
network efficiency more? In this work, we demonstrate using simulation
experiments that sharing real-time traffic information with all network users
is sub-optimal, and it is actually better to share the information with a
majority subset of the total population in order to improve the overall network
performance. This result is valid under the assumption that each network user
decides its route to destination locally.
","[{'version': 'v1', 'created': 'Thu, 11 Mar 2021 10:02:41 GMT'}]",2021-03-12,"[['Shaqfeh', 'Mohammad', ''], ['Hessien', 'Salah', ''], ['Serpedin', 'Erchin', '']]","['Smart transportation systems', 'traffic simulator', 'information utility', 'dynamic routing', 'information sharing']"
8915,2203.04282,Kyungjun Lee,"Kyungjun Lee, Jonggi Hong, Ebrima Jarjue, Ernest Essuah Mensah,
  Hernisa Kacorri","From the Lab to People's Home: Lessons from Accessing Blind
  Participants' Interactions via Smart Glasses in Remote Studies","to be published in the proceedings of the 19th International Web for
  All Conference (Web4All 2022)",,10.1145/3493612.3520448,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Researchers have adopted remote methods, such as online surveys and video
conferencing, to overcome challenges in conducting in-person usability testing,
such as participation, user representation, and safety. However, remote user
evaluation on hardware testbeds is limited, especially for blind participants,
as such methods restrict access to observations of user interactions. We employ
smart glasses in usability testing with blind people and share our lessons from
a case study conducted in blind participants' homes (N=12), where the
experimenter can access participants' activities via dual video conferencing: a
third-person view via a laptop camera and a first-person view via smart glasses
worn by the participant. We show that smart glasses hold potential for
observing participants' interactions with smartphone testbeds remotely; on
average 58.7% of the interactions were fully captured via the first-person view
compared to 3.7% via the third-person. However, this gain is not uniform across
participants as it is susceptible to head movements orienting the ear towards a
sound source, which highlights the need for a more inclusive camera form
factor. We also share our lessons learned when it comes to dealing with lack of
screen reader support in smart glasses, a rapidly draining battery, and
Internet connectivity in remote studies with blind participants.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2022 18:56:36 GMT'}]",2022-03-09,"[['Lee', 'Kyungjun', ''], ['Hong', 'Jonggi', ''], ['Jarjue', 'Ebrima', ''], ['Mensah', 'Ernest Essuah', ''], ['Kacorri', 'Hernisa', '']]","['remote method', 'user study', 'blind people', 'smart glasses']"
8916,2109.02716,Adel Hafiane,"Reenul Reedha, Eric Dericquebourg, Raphael Canals, Adel Hafiane","Vision Transformers For Weeds and Crops Classification Of High
  Resolution UAV Images","Compared to the last version of the article, we have added some
  experiments, that is the evaluation of the performances by varying the number
  of samples in the test and train sets",,10.3390/rs14030592,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Crop and weed monitoring is an important challenge for agriculture and food
production nowadays. Thanks to recent advances in data acquisition and
computation technologies, agriculture is evolving to a more smart and precision
farming to meet with the high yield and high quality crop production.
Classification and recognition in Unmanned Aerial Vehicles (UAV) images are
important phases for crop monitoring. Advances in deep learning models relying
on Convolutional Neural Network (CNN) have achieved high performances in image
classification in the agricultural domain. Despite the success of this
architecture, CNN still faces many challenges such as high computation cost,
the need of large labelled datasets, ... Natural language processing's
transformer architecture can be an alternative approach to deal with CNN's
limitations. Making use of the self-attention paradigm, Vision Transformer
(ViT) models can achieve competitive or better results without applying any
convolution operations. In this paper, we adopt the self-attention mechanism
via the ViT models for plant classification of weeds and crops: red beet,
off-type beet (green leaves), parsley and spinach. Our experiments show that
with small set of labelled training data, ViT models perform better compared to
state-of-the-art CNN-based models EfficientNet and ResNet, with a top accuracy
of 99.8\% achieved by the ViT model.
","[{'version': 'v1', 'created': 'Mon, 6 Sep 2021 19:58:54 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Oct 2021 08:34:08 GMT'}]",2022-09-07,"[['Reedha', 'Reenul', ''], ['Dericquebourg', 'Eric', ''], ['Canals', 'Raphael', ''], ['Hafiane', 'Adel', '']]","['Computer vision', 'deep learning', 'self-attention', 'UAV', 'classification', 'agriculture']"
8917,2209.08921,Alexandra Kapp,"Alexandra Kapp, Saskia Nu\~nez von Voigt, Helena Mihaljevi\'c, Florian
  Tschorsch",Towards Standardized Mobility Reports with User-Level Privacy,,"Journal of Location Based Services, 2022",10.1080/17489725.2022.2148008,,cs.CR cs.OH,http://creativecommons.org/licenses/by/4.0/,"  The importance of human mobility analyses is growing in both research and
practice, especially as applications for urban planning and mobility rely on
them. Aggregate statistics and visualizations play an essential role as
building blocks of data explorations and summary reports, the latter being
increasingly released to third parties such as municipal administrations or in
the context of citizen participation. However, such explorations already pose a
threat to privacy as they reveal potentially sensitive location information,
and thus should not be shared without further privacy measures.
  There is a substantial gap between state-of-the-art research on privacy
methods and their utilization in practice. We thus conceptualize a standardized
mobility report with differential privacy guarantees and implement it as
open-source software to enable a privacy-preserving exploration of key aspects
of mobility data in an easily accessible way. Moreover, we evaluate the
benefits of limiting user contributions using three data sets relevant to
research and practice. Our results show that even a strong limit on user
contribution alters the original geospatial distribution only within a
comparatively small range, while significantly reducing the error introduced by
adding noise to achieve privacy guarantees.
","[{'version': 'v1', 'created': 'Mon, 19 Sep 2022 11:03:29 GMT'}]",2022-11-24,"[['Kapp', 'Alexandra', ''], ['von Voigt', 'Saskia Nuñez', ''], ['Mihaljević', 'Helena', ''], ['Tschorsch', 'Florian', '']]","['human mobility data', 'differential privacy', 'user-level privacy', 'exploratory data analysis', 'mobility report']"
8918,2207.05452,Patrick Finnerty,"Patrick Finnerty, Yoshiki Kawanishi, Tomio Kamada, Chikara Ohta","Supercharging the APGAS Programming Model with Relocatable Distributed
  Collections","23 pages 8 figures Consult the source code in the GitHub repository
  at https://github.com/handist/collections",,10.1155/2022/5092422,,cs.DC,http://creativecommons.org/licenses/by-sa/4.0/,"  In this article we present our relocatable distributed collections library.
Building on top of the AGPAS for Java library, we provide a number of useful
intra-node parallel patterns as well as the features necessary to support the
distributed nature of the computation through clearly identified methods. In
particular, the transfer of distributed collections' entries between processes
is supported via an integrated relocation system. This enables dynamic
load-balancing capabilities, making it possible for programs to adapt to uneven
or evolving cluster performance. The system we developed makes it possible to
dynamically control the distribution and the data-flow of distributed programs
through high-level abstractions. Programmers using our library can therefore
write complex distributed programs combining computation and communication
phases through a consistent API.
  We evaluate the performance of our library against two programs taken from
well-known Java benchmark suites, demonstrating superior programmability, and
obtaining better performance on one benchmark and reasonable overhead on the
second. Finally, we demonstrate the ease and benefits of load-balancing and on
a more complex application which uses the various features of our library
extensively.
","[{'version': 'v1', 'created': 'Tue, 12 Jul 2022 10:42:08 GMT'}]",2022-09-23,"[['Finnerty', 'Patrick', ''], ['Kawanishi', 'Yoshiki', ''], ['Kamada', 'Tomio', ''], ['Ohta', 'Chikara', '']]","['APGAS', 'distributed collection', 'distributed & parallel computing']"
8919,2005.14242,James Walden,James Walden,"The Impact of a Major Security Event on an Open Source Project: The Case
  of OpenSSL","11 pages, 8 figures, 17th International Conference on Mining Software
  Repositories (MSR '20)",,10.1145/3379597.3387465,,cs.SE cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: The Heartbleed vulnerability brought OpenSSL to international
attention in 2014. The almost moribund project was a key security component in
public web servers and over a billion mobile devices. This vulnerability led to
new investments in OpenSSL.
  Objective: The goal of this study is to determine how the Heartbleed
vulnerability changed the software evolution of OpenSSL. We study changes in
vulnerabilities, code quality, project activity, and software engineering
practices.
  Method: We use a mixed methods approach, collecting multiple types of
quantitative data and qualitative data from web sites and an interview with a
developer who worked on post-Heartbleed changes. We use regression
discontinuity analysis to determine changes in levels and slopes of code and
project activity metrics resulting from Heartbleed.
  Results: The OpenSSL project made tremendous improvements to code quality and
security after Heartbleed. By the end of 2016, the number of commits per month
had tripled, 91 vulnerabilities were found and fixed, code complexity decreased
significantly, and OpenSSL obtained a CII best practices badge, certifying its
use of good open source development practices.
  Conclusions: The OpenSSL project provides a model of how an open source
project can adapt and improve after a security event. The evolution of OpenSSL
shows that the number of known vulnerabilities is not a useful indicator of
project security. A small number of vulnerabilities may simply indicate that a
project does not expend much effort to finding vulnerabilities. This study
suggests that project activity and CII badge best practices may be better
indicators of code quality and security than vulnerability counts.
","[{'version': 'v1', 'created': 'Thu, 28 May 2020 19:03:57 GMT'}]",2020-06-01,"[['Walden', 'James', '']]","['software evolution', 'software security', 'case study']"
8920,1709.02600,Matias Valdenegro-Toro,Matias Valdenegro-Toro,"Objectness Scoring and Detection Proposals in Forward-Looking Sonar
  Images with Convolutional Neural Networks",Author version,Proceedings of ANNPR 2016,10.1007/978-3-319-46182-3_18,,cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Forward-looking sonar can capture high resolution images of underwater
scenes, but their interpretation is complex. Generic object detection in such
images has not been solved, specially in cases of small and unknown objects. In
comparison, detection proposal algorithms have produced top performing object
detectors in real-world color images. In this work we develop a Convolutional
Neural Network that can reliably score objectness of image windows in
forward-looking sonar images and by thresholding objectness, we generate
detection proposals. In our dataset of marine garbage objects, we obtain 94%
recall, generating around 60 proposals per image. The biggest strength of our
method is that it can generalize to previously unseen objects. We show this by
detecting chain links, walls and a wrench without previous training in such
objects. We strongly believe our method can be used for class-independent
object detection, with many real-world applications such as chain following and
mine detection.
","[{'version': 'v1', 'created': 'Fri, 8 Sep 2017 09:11:32 GMT'}]",2017-09-11,"[['Valdenegro-Toro', 'Matias', '']]","['Object Detection', 'Detection Proposals', 'Sonar Image Processing', 'Forward-Looking Sonar']"
8921,1810.02596,Mostafa Zaman Chowdhury,"Mostafa Zaman Chowdhury, Md. Tanvir Hossan, Yeong Min Jang","Interference Management Based on RT/nRT Traffic Classification for
  FFR-Aided Small Cell/Macrocell Heterogeneous Networks",,"IEEE Access, vol. 6, pp. 31340-31358, Jun. 2018",10.1109/ACCESS.2018.2844843,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cellular networks are constantly lagging in terms of the bandwidth needed to
support the growing high data rate demands. The system needs to efficiently
allocate its frequency spectrum such that the spectrum utilization can be
maximized while ensuring the quality of service (QoS) level. Owing to the
coexistence of different types of traffic (e.g., real-time (RT) and
non-real-time (nRT)) and different types of networks (e.g., small cell and
macrocell), ensuring the QoS level for different types of users becomes a
challenging issue in wireless networks. Fractional frequency reuse (FFR) is an
effective approach for increasing spectrum utilization and reducing
interference effects in orthogonal frequency division multiple access networks.
In this paper, we propose a new FFR scheme in which bandwidth allocation is
based on RT/nRT traffic classification. We consider the coexistence of small
cells and macrocells. After applying FFR technique in macrocells, the remaining
frequency bands are efficiently allocated among the small cells overlaid by a
macrocell. In our proposed scheme, total frequency-band allocations for
different macrocells are decided on the basis of the traffic intensity. The
transmitted power levels for different frequency bands are controlled based on
the level of interference from a nearby frequency band. Frequency bands with a
lower level of interference are assigned to the RT traffic to ensure a higher
QoS level for the RT traffic. RT traffic calls in macrocell networks are also
given a higher priority compared with nRT traffic calls to ensure the low
call-blocking rate. Performance analyses show significant improvement under the
proposed scheme compared with conventional FFR schemes.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 10:15:21 GMT'}]",2018-10-08,"[['Chowdhury', 'Mostafa Zaman', ''], ['Hossan', 'Md. Tanvir', ''], ['Jang', 'Yeong Min', '']]","['Interference', 'frequency band reassigning', 'quality of service (QoS)', 'RT traffic', 'nRT traffic', 'macrocell', 'small cell', 'fractional frequency reuse (FFR)']"
8922,2104.07650,Ningyu Zhang,"Xiang Chen, Ningyu Zhang, Xin Xie, Shumin Deng, Yunzhi Yao, Chuanqi
  Tan, Fei Huang, Luo Si, Huajun Chen","KnowPrompt: Knowledge-aware Prompt-tuning with Synergistic Optimization
  for Relation Extraction",Accepted by WWW2022,,10.1145/3485447.3511998,,cs.CL cs.AI cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, prompt-tuning has achieved promising results for specific few-shot
classification tasks. The core idea of prompt-tuning is to insert text pieces
(i.e., templates) into the input and transform a classification task into a
masked language modeling problem. However, for relation extraction, determining
an appropriate prompt template requires domain expertise, and it is cumbersome
and time-consuming to obtain a suitable label word. Furthermore, there exists
abundant semantic and prior knowledge among the relation labels that cannot be
ignored. To this end, we focus on incorporating knowledge among relation labels
into prompt-tuning for relation extraction and propose a Knowledge-aware
Prompt-tuning approach with synergistic optimization (KnowPrompt).
Specifically, we inject latent knowledge contained in relation labels into
prompt construction with learnable virtual type words and answer words. Then,
we synergistically optimize their representation with structured constraints.
Extensive experimental results on five datasets with standard and low-resource
settings demonstrate the effectiveness of our approach. Our code and datasets
are available in https://github.com/zjunlp/KnowPrompt for reproducibility.
","[{'version': 'v1', 'created': 'Thu, 15 Apr 2021 17:57:43 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Aug 2021 13:04:08 GMT'}, {'version': 'v3', 'created': 'Mon, 30 Aug 2021 16:30:08 GMT'}, {'version': 'v4', 'created': 'Fri, 3 Sep 2021 17:06:40 GMT'}, {'version': 'v5', 'created': 'Thu, 9 Sep 2021 16:02:40 GMT'}, {'version': 'v6', 'created': 'Sun, 23 Jan 2022 16:06:39 GMT'}]",2022-11-02,"[['Chen', 'Xiang', ''], ['Zhang', 'Ningyu', ''], ['Xie', 'Xin', ''], ['Deng', 'Shumin', ''], ['Yao', 'Yunzhi', ''], ['Tan', 'Chuanqi', ''], ['Huang', 'Fei', ''], ['Si', 'Luo', ''], ['Chen', 'Huajun', '']]","['Relation Extraction', 'Prompt-tuning', 'Knowledge-aware']"
8923,2112.05798,Rajdeep Mukherjee,"Rajdeep Mukherjee, Uppada Vishnu, Hari Chandana Peruri, Sourangshu
  Bhattacharya, Koustav Rudra, Pawan Goyal, Niloy Ganguly","MTLTS: A Multi-Task Framework To Obtain Trustworthy Summaries From
  Crisis-Related Microblogs","Accepted as a Full Paper at WSDM 2022; 9 pages; Codes:
  https://github.com/rajdeep345/MTLTS",,10.1145/3488560.3498536,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Occurrences of catastrophes such as natural or man-made disasters trigger the
spread of rumours over social media at a rapid pace. Presenting a trustworthy
and summarized account of the unfolding event in near real-time to the
consumers of such potentially unreliable information thus becomes an important
task. In this work, we propose MTLTS, the first end-to-end solution for the
task that jointly determines the credibility and summary-worthiness of tweets.
Our credibility verifier is designed to recursively learn the structural
properties of a Twitter conversation cascade, along with the stances of replies
towards the source tweet. We then take a hierarchical multi-task learning
approach, where the verifier is trained at a lower layer, and the summarizer is
trained at a deeper layer where it utilizes the verifier predictions to
determine the salience of a tweet. Different from existing disaster-specific
summarizers, we model tweet summarization as a supervised task. Such an
approach can automatically learn summary-worthy features, and can therefore
generalize well across domains. When trained on the PHEME dataset [29], not
only do we outperform the strongest baselines for the auxiliary task of
verification/rumour detection, we also achieve 21 - 35% gains in the verified
ratio of summary tweets, and 16 - 20% gains in ROUGE1-F1 scores over the
existing state-of-the-art solutions for the primary task of trustworthy
summarization.
","[{'version': 'v1', 'created': 'Fri, 10 Dec 2021 19:33:29 GMT'}]",2021-12-14,"[['Mukherjee', 'Rajdeep', ''], ['Vishnu', 'Uppada', ''], ['Peruri', 'Hari Chandana', ''], ['Bhattacharya', 'Sourangshu', ''], ['Rudra', 'Koustav', ''], ['Goyal', 'Pawan', ''], ['Ganguly', 'Niloy', '']]","['Trustworthy Summarization', 'Rumour Detection', 'Disaster', 'Twitter']"
8924,2202.10868,Wenkang Zhong,Wenkang Zhong and Chuanyi Li and Jidong Ge and Bin Luo,"Neural Program Repair: Systems, Challenges and Solutions",accepted by Internetware '22,,10.1145/3545258.3545268,,cs.SE cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated Program Repair (APR) aims to automatically fix bugs in the source
code. Recently, as advances in Deep Learning (DL) field, there is a rise of
Neural Program Repair (NPR) studies, which formulate APR as a translation task
from buggy code to correct code and adopt neural networks based on
encoder-decoder architecture. Compared with other APR techniques, NPR
approaches have a great advantage in applicability because they do not need any
specification (i.e., a test suite). Although NPR has been a hot research
direction, there isn't any overview on this field yet. In order to help
interested readers understand architectures, challenges and corresponding
solutions of existing NPR systems, we conduct a literature review on latest
studies in this paper. We begin with introducing the background knowledge on
this field. Next, to be understandable, we decompose the NPR procedure into a
series of modules and explicate various design choices on each module.
Furthermore, we identify several challenges and discuss the effect of existing
solutions. Finally, we conclude and provide some promising directions for
future research.
","[{'version': 'v1', 'created': 'Tue, 22 Feb 2022 12:56:31 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Sep 2022 12:58:45 GMT'}]",2022-09-22,"[['Zhong', 'Wenkang', ''], ['Li', 'Chuanyi', ''], ['Ge', 'Jidong', ''], ['Luo', 'Bin', '']]","['Automatic program repair', 'Neural networks', 'Software reliability']"
8925,2205.02208,Barbara Russo,"Barbara Russo, Matteo Camilli, Moritz Mock",WeakSATD: Detecting Weak Self-admitted Technical Debt,short paper,"19th International Conference on Mining Software Repositories (MSR
  '22), May 23--24, 2022, Pittsburgh, PA, USA",10.1145/3524842.3528469,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Speeding up development may produce technical debt, i.e., not-quite-right
code for which the effort to make it right increases with time as a sort of
interest. Developers may be aware of the debt as they admit it in their code
comments. Literature reports that such a self-admitted technical debt survives
for a long time in a program, but it is not yet clear its impact on the quality
of the code in the long term. We argue that self-admitted technical debt
contains a number of different weaknesses that may affect the security of a
program. Therefore, the longer a debt is not paid back the higher is the risk
that the weaknesses can be exploited. To discuss our claim and rise the
developers' awareness of the vulnerability of the self-admitted technical debt
that is not paid back, we explore the self-admitted technical debt in the
Chromium C-code to detect any known weaknesses. In this preliminary study, we
first mine the Common Weakness Enumeration repository to define heuristics for
the automatic detection and fix of weak code. Then, we parse the C-code to find
self-admitted technical debt and the code block it refers to. Finally, we use
the heuristics to find weak code snippets associated to self-admitted technical
debt and recommend their potential mitigation to developers. Such knowledge can
be used to prioritize self-admitted technical debt for repair. A prototype has
been developed and applied to the Chromium code. Initial findings report that
55\% of self-admitted technical debt code contains weak code of 14 different
types.
","[{'version': 'v1', 'created': 'Wed, 4 May 2022 17:38:43 GMT'}]",2022-05-05,"[['Russo', 'Barbara', ''], ['Camilli', 'Matteo', ''], ['Mock', 'Moritz', '']]","['Self-admitted technical debt', 'Weak code', 'Security', 'Vulnerability']"
8926,1707.09366,Vaclav Skala,"Rongjiang Pan, Vaclav Skala","Continuous Global Optimization in Surface Reconstruction from an
  Oriented Point Cloud",,"Computer Aided Design, Vol.43, No.8, pp.896-901, Elsevier, ISSN
  0010-4485, 2011",10.1016/j.cad.2011.03.005,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a continuous global optimization method to the field of surface
reconstruction from discrete noisy cloud of points with weak information on
orientation. The proposed method uses an energy functional combining flux-based
data-fit measures and a regularization term. A continuous convex relaxation
scheme assures the global minima of the geometric surface functional. The
reconstructed surface is implicitly represented by the binary segmentation of
vertices of a 3D uniform grid and a triangulated surface can be obtained by
extracting an appropriate isosurface. Unlike the discrete graph-cut solution,
the continuous global optimization entails advantages like memory requirements,
reduction of metrication errors for geometric quantities, allowing globally
optimal surface reconstruction at higher grid resolutions. We demonstrate the
performance of the proposed method on several oriented point clouds captured by
laser scanners. Experimental results confirm that our approach is robust to
noise, large holes and non-uniform sampling density under the condition of very
coarse orientation information.
","[{'version': 'v1', 'created': 'Fri, 28 Jul 2017 08:45:37 GMT'}]",2017-08-01,"[['Pan', 'Rongjiang', ''], ['Skala', 'Vaclav', '']]","['Surface reconstruction', 'Continuous global optimization', 'Convex relaxation']"
8927,cs/0503055,Francesca Scozzari,"Gianluca Amato, Francesca Scozzari",Optimality in Goal-Dependent Analysis of Sharing,,"Theory and Practice of Logic Programming, volume 9, issue 05, pp.
  617-689, 2009",10.1017/S1471068409990111,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We face the problems of correctness, optimality and precision for the static
analysis of logic programs, using the theory of abstract interpretation. We
propose a framework with a denotational, goal-dependent semantics equipped with
two unification operators for forward unification (calling a procedure) and
backward unification (returning from a procedure). The latter is implemented
through a matching operation. Our proposal clarifies and unifies many different
frameworks and ideas on static analysis of logic programming in a single,
formal setting. On the abstract side, we focus on the domain Sharing by Jacobs
and Langen and provide the best correct approximation of all the primitive
semantic operators, namely, projection, renaming, forward and backward
unification. We show that the abstract unification operators are strictly more
precise than those in the literature defined over the same abstract domain. In
some cases, our operators are more precise than those developed for more
complex domains involving linearity and freeness.
  To appear in Theory and Practice of Logic Programming (TPLP)
","[{'version': 'v1', 'created': 'Tue, 22 Mar 2005 20:56:51 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Jun 2009 19:19:34 GMT'}]",2009-09-07,"[['Amato', 'Gianluca', ''], ['Scozzari', 'Francesca', '']]","['Abstract interpretation', 'logic programming', 'existentially quantified substitutions', 'unification', 'matching', 'sharing']"
8928,2008.02655,Vikas Kumar,"Vikas Kumar, Shivansh Rao, Li Yu","Noisy Student Training using Body Language Dataset Improves Facial
  Expression Recognition","Accepted in ECCV workshop BEEU (Bodily Expressed Emotion
  Understanding) 2020",,10.1007/978-3-030-66415-2_53,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Facial expression recognition from videos in the wild is a challenging task
due to the lack of abundant labelled training data. Large DNN (deep neural
network) architectures and ensemble methods have resulted in better
performance, but soon reach saturation at some point due to data inadequacy. In
this paper, we use a self-training method that utilizes a combination of a
labelled dataset and an unlabelled dataset (Body Language Dataset - BoLD).
Experimental analysis shows that training a noisy student network iteratively
helps in achieving significantly better results. Additionally, our model
isolates different regions of the face and processes them independently using a
multi-level attention mechanism which further boosts the performance. Our
results show that the proposed method achieves state-of-the-art performance on
benchmark datasets CK+ and AFEW 8.0 when compared to other single models.
","[{'version': 'v1', 'created': 'Thu, 6 Aug 2020 13:45:52 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Feb 2021 19:11:20 GMT'}]",2021-02-26,"[['Kumar', 'Vikas', ''], ['Rao', 'Shivansh', ''], ['Yu', 'Li', '']]","['Facial expression recognition', 'student-teacher network', 'semisupervised learning', 'multi-level attention']"
8929,1604.04827,Hendrik Molter,"Ren\'e van Bevern and Christian Komusiewicz and Hendrik Molter and
  Rolf Niedermeier and Manuel Sorge and Toby Walsh",h-Index Manipulation by Undoing Merges,,"Quantitative Science Studies, 1(4): 1529-1552. 2020",10.1162/qss_a_00093,,cs.DL cs.DM cs.DS cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The h-index is an important bibliographic measure used to assess the
performance of researchers. Dutiful researchers merge different versions of
their articles in their Google Scholar profile even though this can decrease
their h-index. In this article, we study the manipulation of the h-index by
undoing such merges. In contrast to manipulation by merging articles (van
Bevern et al. [Artif. Intel. 240:19-35, 2016]) such manipulation is harder to
detect. We present numerous results on computational complexity (from
linear-time algorithms to parameterized computational hardness results) and
empirically indicate that at least small improvements of the h-index by
splitting merged articles are unfortunately easily achievable.
","[{'version': 'v1', 'created': 'Sun, 17 Apr 2016 04:11:30 GMT'}, {'version': 'v2', 'created': 'Sat, 9 Jul 2016 06:47:32 GMT'}, {'version': 'v3', 'created': 'Tue, 12 Nov 2019 11:28:18 GMT'}]",2021-01-14,"[['van Bevern', 'René', ''], ['Komusiewicz', 'Christian', ''], ['Molter', 'Hendrik', ''], ['Niedermeier', 'Rolf', ''], ['Sorge', 'Manuel', ''], ['Walsh', 'Toby', '']]","['Google scholar profiles', 'citation graph', 'article splitting', 'NPhard problems', 'parameterized complexity', 'experimental algorithmics']"
8930,2104.14006,Christos Kyrkou,Christos Kyrkou and Theocharis Theocharides,"EmergencyNet: Efficient Aerial Image Classification for Drone-Based
  Emergency Monitoring Using Atrous Convolutional Feature Fusion","C.Kyrkou and T. Theocharides, ""EmergencyNet: Efficient Aerial Image
  Classification for Drone-Based Emergency Monitoring Using Atrous
  Convolutional Feature Fusion,"" in IEEE J Sel Top Appl Earth Obs Remote Sens.
  (JSTARS), vol. 13, pp. 1687-1699, 2020. arXiv admin note: substantial text
  overlap with arXiv:1906.08716","IEEE Journal of Selected Topics in Applied Earth Observations and
  Remote Sensing ( Volume: 13), Page(s): 1687 - 1699, 2020",10.1109/JSTARS.2020.2969809,,cs.CV cs.LG cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Deep learning-based algorithms can provide state-of-the-art accuracy for
remote sensing technologies such as unmanned aerial vehicles (UAVs)/drones,
potentially enhancing their remote sensing capabilities for many emergency
response and disaster management applications. In particular, UAVs equipped
with camera sensors can operating in remote and difficult to access
disaster-stricken areas, analyze the image and alert in the presence of various
calamities such as collapsed buildings, flood, or fire in order to faster
mitigate their effects on the environment and on human population. However, the
integration of deep learning introduces heavy computational requirements,
preventing the deployment of such deep neural networks in many scenarios that
impose low-latency constraints on inference, in order to make mission-critical
decisions in real time. To this end, this article focuses on the efficient
aerial image classification from on-board a UAV for emergency
response/monitoring applications. Specifically, a dedicated Aerial Image
Database for Emergency Response applications is introduced and a comparative
analysis of existing approaches is performed. Through this analysis a
lightweight convolutional neural network architecture is proposed, referred to
as EmergencyNet, based on atrous convolutions to process multiresolution
features and capable of running efficiently on low-power embedded platforms
achieving upto 20x higher performance compared to existing models with minimal
memory requirements with less than 1% accuracy drop compared to
state-of-the-art models.
","[{'version': 'v1', 'created': 'Wed, 28 Apr 2021 20:24:10 GMT'}]",2021-04-30,"[['Kyrkou', 'Christos', ''], ['Theocharides', 'Theocharis', '']]","['Deep Learning', 'Convolutional Neural Networks', 'Emergency Monitoring', 'Unmanned Aerial Vehicles', 'Drones', 'Image Processing', 'Video Processing', 'Remote Sensing']"
8931,2009.07816,Li Su,"Yuen-Jen Lin, Hsuan-Kai Kao, Yih-Chih Tseng, Ming Tsai, Li Su",A Human-Computer Duet System for Music Performance,,,10.1145/3394171.3413921,,cs.MM cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Virtual musicians have become a remarkable phenomenon in the contemporary
multimedia arts. However, most of the virtual musicians nowadays have not been
endowed with abilities to create their own behaviors, or to perform music with
human musicians. In this paper, we firstly create a virtual violinist, who can
collaborate with a human pianist to perform chamber music automatically without
any intervention. The system incorporates the techniques from various fields,
including real-time music tracking, pose estimation, and body movement
generation. In our system, the virtual musician's behavior is generated based
on the given music audio alone, and such a system results in a low-cost,
efficient and scalable way to produce human and virtual musicians'
co-performance. The proposed system has been validated in public concerts.
Objective quality assessment approaches and possible ways to systematically
improve the system are also discussed.
","[{'version': 'v1', 'created': 'Wed, 16 Sep 2020 17:19:23 GMT'}]",2020-09-17,"[['Lin', 'Yuen-Jen', ''], ['Kao', 'Hsuan-Kai', ''], ['Tseng', 'Yih-Chih', ''], ['Tsai', 'Ming', ''], ['Su', 'Li', '']]","['Automatic accompaniment', 'body movement generation', 'animation', 'computer-human interaction', 'music information retrieval']"
8932,1910.02513,David Honfi,D\'avid Honfi and Zolt\'an Micskei,Automated Isolation for White-box Test Generation,,Information and Software Technology (2020),10.1016/j.infsof.2020.106319,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context. White-box test generation is a technique used for automatically
selecting test inputs using only the source or binary code. However, such
techniques encounter challenges when applying them to complex programs. One of
the main challenges is handling the dependencies of the unit under test.
  Objective. Without proper actions, generated tests cannot cover all parts of
the source code, or calling the dependencies may cause unexpected side effects
(e.g., file system or network access). These issues should be tackled while
maintaining the advantages of white-box test generation.
  Method. In this paper, we present an automated source code transformation
approach tackling the dependency issue for white-box test generation. This
technique isolates the test execution by creating a parameterized sandbox
wrapped around the transformed unit. We implemented the approach in a
ready-to-use tool using Microsoft Pex as a test generator, and evaluated it on
10 open-source projects from GitHub having more than 38.000 lines of code in
total.
  Results. The results from the evaluation indicate that if the lack of
isolation hinders white-box test generation, then our approach is able to help:
it increases the code coverage reached by the automatically generated test,
while it reduces unwanted side effects. Also, our results act as a unique
baseline for the test generation performance of Microsoft Pex on open-source
projects.
  Conclusion. Based on the results, our source code transformations might serve
well for alleviating the isolation problem in white-box test generation as it
increases the coverage reached in such situations, while maintaining the
practical applicability of the tests generated on the isolated code.
","[{'version': 'v1', 'created': 'Sun, 6 Oct 2019 20:10:13 GMT'}]",2020-06-12,"[['Honfi', 'Dávid', ''], ['Micskei', 'Zoltán', '']]","['testing', 'test generation', 'white-box', 'isolation', 'mocking', 'code transformation', 'empirical evaluation']"
8933,2012.12362,Rolysent Paredes,Rolysent K Paredes and Alexander A. Hernandez,"Designing an Adaptive Bandwidth Management for Higher Education
  Institutions",,,10.25147/ijcsr.2017.001.1.22,,cs.NI cs.DB,http://creativecommons.org/licenses/by/4.0/,"  Purpose: This study proposes an adaptive bandwidth management system which
can be explicitly used by educational institutions. The primary goal of the
system is to increase the bandwidth of the users who access more on educational
websites. Through this proposed bandwidth management, the users of the campus
networks is encouraged to utilize the internet for educational purposes.
  Method: The weblog from a university's pfSense proxy server was utilized and
undergo Web Usage Mining (WUM) to determine the number of educational and
non-educational websites accessed by the users. Certain formulas were used in
the computation of the bandwidth which was dynamically assigned to the users. A
prototyping technique was applied in developing adaptive bandwidth management
system. The prototype was simulated and evaluated by experts in compliance with
ISO/IEC 14598-6 and ISO/IEC 9126-1 standards.
  Results: This study found that the prototype is capable of adjusting the
bandwidth of the network users dynamically. The users who browsed more on
educational websites or contents were assigned with higher bandwidth compared
to those who are not. Further, the evaluated prototype met the software
standards of ISO.
  Conclusion: The proposed adaptive bandwidth management can contribute to the
continuous development in the area of computer networking, especially in
designing and managing campus networks. It also helps the network
administrators or IT managers in allocating bandwidth with minimal effort.
","[{'version': 'v1', 'created': 'Thu, 19 Nov 2020 11:59:29 GMT'}]",2020-12-24,"[['Paredes', 'Rolysent K', ''], ['Hernandez', 'Alexander A.', '']]","['adaptive bandwidth allocation', 'campus networks', 'bandwidth management', 'pfSense', 'web usage mining    INTRODUCTION']"
8934,2011.00149,Anindo Saha,"Anindo Saha, Fakrul I. Tushar, Khrystyna Faryna, Vincent M.
  D'Anniballe, Rui Hou, Maciej A. Mazurowski, Geoffrey D. Rubin, Joseph Y. Lo","Weakly Supervised 3D Classification of Chest CT using Aggregated
  Multi-Resolution Deep Segmentation Features","Accepted to 2020 SPIE Medical Imaging: Computer-Aided Diagnosis [oral
  presentation]",,10.1117/12.2550857,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Weakly supervised disease classification of CT imaging suffers from poor
localization owing to case-level annotations, where even a positive scan can
hold hundreds to thousands of negative slices along multiple planes.
Furthermore, although deep learning segmentation and classification models
extract distinctly unique combinations of anatomical features from the same
target class(es), they are typically seen as two independent processes in a
computer-aided diagnosis (CAD) pipeline, with little to no feature reuse. In
this research, we propose a medical classifier that leverages the semantic
structural concepts learned via multi-resolution segmentation feature maps, to
guide weakly supervised 3D classification of chest CT volumes. Additionally, a
comparative analysis is drawn across two different types of feature aggregation
to explore the vast possibilities surrounding feature fusion. Using a dataset
of 1593 scans labeled on a case-level basis via rule-based model, we train a
dual-stage convolutional neural network (CNN) to perform organ segmentation and
binary classification of four representative diseases (emphysema,
pneumonia/atelectasis, mass and nodules) in lungs. The baseline model, with
separate stages for segmentation and classification, results in AUC of 0.791.
Using identical hyperparameters, the connected architecture using static and
dynamic feature aggregation improves performance to AUC of 0.832 and 0.851,
respectively. This study advances the field in two key ways. First, case-level
report data is used to weakly supervise a 3D CT classifier of multiple,
simultaneous diseases for an organ. Second, segmentation and classification
models are connected with two different feature aggregation strategies to
enhance the classification performance.
","[{'version': 'v1', 'created': 'Sat, 31 Oct 2020 00:16:53 GMT'}]",2020-11-03,"[['Saha', 'Anindo', ''], ['Tushar', 'Fakrul I.', ''], ['Faryna', 'Khrystyna', ''], [""D'Anniballe"", 'Vincent M.', ''], ['Hou', 'Rui', ''], ['Mazurowski', 'Maciej A.', ''], ['Rubin', 'Geoffrey D.', ''], ['Lo', 'Joseph Y.', '']]","['CT', 'convolutional neural network', 'weak supervision', 'feature aggregation', '3D classification', 'lungs']"
8935,2109.13099,Zhipeng Xue,"Zhipeng Xue, Yuanliang Zhang, Rulin Xu",Clone-based code method usage pattern mining,"5 pages, accepted by ICPC2022-ERA",,10.1145/3524610.3527880,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When programmers retrieve a code method and want to reuse it, they need to
understand the usage patterns of the retrieved method. However, it is difficult
to obtain usage information of the retrieved method since this method may only
have a brief comment and few available usage examples. In this paper, we
propose an approach, called LUPIN (cLone-based Usage Pattern mIniNg), to mine
the usage patterns of these methods, which do not widely appeared in the code
repository. The key idea of LUPIN is that the cloned code of the target method
may have a similar usage pattern, and we can collect more usage information of
the target method from cloned code usage examples. From the amplified usage
examples, we mine the usage pattern of the target method by frequent
subsequence mining after program slicing and code normalization. Our evaluation
shows that LUPIN can mine four categories of usage patterns with an average
precision of 0.65.
","[{'version': 'v1', 'created': 'Mon, 27 Sep 2021 14:50:38 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Sep 2021 12:57:33 GMT'}, {'version': 'v3', 'created': 'Wed, 4 May 2022 02:38:06 GMT'}, {'version': 'v4', 'created': 'Tue, 28 Jun 2022 03:30:05 GMT'}]",2022-06-29,"[['Xue', 'Zhipeng', ''], ['Zhang', 'Yuanliang', ''], ['Xu', 'Rulin', '']]","['usage mining', 'code clone', 'frequent subsequence mining', 'softwaremaintenance']"
8936,2010.09157,Ryoma Sato,"Ryoma Sato, Makoto Yamada, Hisashi Kashima","Poincare: Recommending Publication Venues via Treatment Effect
  Estimation",Journal of Informetrics,,10.1016/j.joi.2022.101283,,cs.DL cs.IR cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Choosing a publication venue for an academic paper is a crucial step in the
research process. However, in many cases, decisions are based solely on the
experience of researchers, which often leads to suboptimal results. Although
there exist venue recommender systems for academic papers, they recommend
venues where the paper is expected to be published. In this study, we aim to
recommend publication venues from a different perspective. We estimate the
number of citations a paper will receive if the paper is published in each
venue and recommend the venue where the paper has the most potential impact.
However, there are two challenges to this task. First, a paper is published in
only one venue, and thus, we cannot observe the number of citations the paper
would receive if the paper were published in another venue. Secondly, the
contents of a paper and the publication venue are not statistically
independent; that is, there exist selection biases in choosing publication
venues. In this paper, we formulate the venue recommendation problem as a
treatment effect estimation problem. We use a bias correction method to
estimate the potential impact of choosing a publication venue effectively and
to recommend venues based on the potential impact of papers in each venue. We
highlight the effectiveness of our method using paper data from computer
science conferences.
","[{'version': 'v1', 'created': 'Mon, 19 Oct 2020 00:50:48 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Sep 2022 07:10:17 GMT'}]",2022-09-05,"[['Sato', 'Ryoma', ''], ['Yamada', 'Makoto', ''], ['Kashima', 'Hisashi', '']]","['recommender systems', 'scholarly communication', 'treatment effect estimation']"
8937,2110.01410,Afef Saihi,Afef Saihi and Hussam Alshraideh,Development of an autism screening classification model for toddlers,12 pages,,10.5121/csit.2021.111508,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Autism spectrum disorder ASD is a neurodevelopmental disorder associated with
challenges in communication, social interaction, and repetitive behaviors.
Getting a clear diagnosis for a child is necessary for starting early
intervention and having access to therapy services. However, there are many
barriers that hinder the screening of these kids for autism at an early stage
which might delay further the access to therapeutic interventions. One
promising direction for improving the efficiency and accuracy of ASD detection
in toddlers is the use of machine learning techniques to build classifiers that
serve the purpose. This paper contributes to this area and uses the data
developed by Dr. Fadi Fayez Thabtah to train and test various machine learning
classifiers for the early ASD screening. Based on various attributes, three
models have been trained and compared which are Decision tree C4.5, Random
Forest, and Neural Network. The three models provided very good accuracies
based on testing data, however, it is the Neural Network that outperformed the
other two models. This work contributes to the early screening of toddlers by
helping identify those who have ASD traits and should pursue formal clinical
diagnosis.
","[{'version': 'v1', 'created': 'Wed, 29 Sep 2021 09:07:39 GMT'}]",2021-10-05,"[['Saihi', 'Afef', ''], ['Alshraideh', 'Hussam', '']]","['Autism Spectrum Disorder', 'Screening', 'Machine Learning', 'Decision Tree', 'Random Forest', 'Neural Network', 'Classifier', 'Accuracy']"
8938,2204.09810,Katiana Kontolati,"Somdatta Goswami, Katiana Kontolati, Michael D. Shields, George Em
  Karniadakis","Deep transfer operator learning for partial differential equations under
  conditional shift","33 pages, 9 figures",,10.1038/s42256-022-00569-2,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transfer learning (TL) enables the transfer of knowledge gained in learning
to perform one task (source) to a related but different task (target), hence
addressing the expense of data acquisition and labeling, potential
computational power limitations, and dataset distribution mismatches. We
propose a new TL framework for task-specific learning (functional regression in
partial differential equations (PDEs)) under conditional shift based on the
deep operator network (DeepONet). Task-specific operator learning is
accomplished by fine-tuning task-specific layers of the target DeepONet using a
hybrid loss function that allows for the matching of individual target samples
while also preserving the global properties of the conditional distribution of
target data. Inspired by the conditional embedding operator theory, we minimize
the statistical distance between labeled target data and the surrogate
prediction on unlabeled target data by embedding conditional distributions onto
a reproducing kernel Hilbert space. We demonstrate the advantages of our
approach for various TL scenarios involving nonlinear PDEs under diverse
conditions due to shift in the geometric domain and model dynamics. Our TL
framework enables fast and efficient learning of heterogeneous tasks despite
significant differences between the source and target domains.
","[{'version': 'v1', 'created': 'Wed, 20 Apr 2022 23:23:38 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Nov 2022 02:49:57 GMT'}]",2022-12-20,"[['Goswami', 'Somdatta', ''], ['Kontolati', 'Katiana', ''], ['Shields', 'Michael D.', ''], ['Karniadakis', 'George Em', '']]","['transfer learning', 'DeepONet', 'reproducing kernel Hilbert space', 'conditional shift', 'scientific machine learning', 'neural operators']"
8939,2204.11373,Revanth Reddy,"Revanth Gangi Reddy, Md Arafat Sultan, Martin Franz, Avirup Sil, Heng
  Ji","Entity-Conditioned Question Generation for Robust Attention Distribution
  in Neural Information Retrieval",Published at SIGIR 2022,,10.1145/3477495.3531878,,cs.CL cs.IR,http://creativecommons.org/licenses/by/4.0/,"  We show that supervised neural information retrieval (IR) models are prone to
learning sparse attention patterns over passage tokens, which can result in key
phrases including named entities receiving low attention weights, eventually
leading to model under-performance. Using a novel targeted synthetic data
generation method that identifies poorly attended entities and conditions the
generation episodes on those, we teach neural IR to attend more uniformly and
robustly to all entities in a given passage. On two public IR benchmarks, we
empirically show that the proposed method helps improve both the model's
attention patterns and retrieval performance, including in zero-shot settings.
","[{'version': 'v1', 'created': 'Sun, 24 Apr 2022 22:36:48 GMT'}]",2022-04-26,"[['Reddy', 'Revanth Gangi', ''], ['Sultan', 'Md Arafat', ''], ['Franz', 'Martin', ''], ['Sil', 'Avirup', ''], ['Ji', 'Heng', '']]","['Neural passage retrieval', 'Weak supervision', 'Synthetic data generation']"
8940,2101.06353,Shoffan Saifullah,"Shoffan Saifullah, Yuli Fauziah, Agus Sasmito Aribowo","Comparison of Machine Learning for Sentiment Analysis in Detecting
  Anxiety Based on Social Media Data",,"Jurnal Informatika,15(1), 2021, 45-55",10.26555/jifo.v15i1.a20111,,cs.CL cs.LG,http://creativecommons.org/licenses/by/4.0/,"  All groups of people felt the impact of the COVID-19 pandemic. This situation
triggers anxiety, which is bad for everyone. The government's role is very
influential in solving these problems with its work program. It also has many
pros and cons that cause public anxiety. For that, it is necessary to detect
anxiety to improve government programs that can increase public expectations.
This study applies machine learning to detecting anxiety based on social media
comments regarding government programs to deal with this pandemic. This concept
will adopt a sentiment analysis in detecting anxiety based on positive and
negative comments from netizens. The machine learning methods implemented
include K-NN, Bernoulli, Decision Tree Classifier, Support Vector Classifier,
Random Forest, and XG-boost. The data sample used is the result of crawling
YouTube comments. The data used amounted to 4862 comments consisting of
negative and positive data with 3211 and 1651. Negative data identify anxiety,
while positive data identifies hope (not anxious). Machine learning is
processed based on feature extraction of count-vectorization and TF-IDF. The
results showed that the sentiment data amounted to 3889 and 973 in testing, and
training with the greatest accuracy was the random forest with feature
extraction of vectorization count and TF-IDF of 84.99% and 82.63%,
respectively. The best precision test is K-NN, while the best recall is
XG-Boost. Thus, Random Forest is the best accurate to detect someone's anxiety
based-on data from social media.
","[{'version': 'v1', 'created': 'Sat, 16 Jan 2021 02:47:14 GMT'}]",2021-03-02,"[['Saifullah', 'Shoffan', ''], ['Fauziah', 'Yuli', ''], ['Aribowo', 'Agus Sasmito', '']]","['Anxiety Detection', 'Machine Learning', 'Sentiment Analysis', 'Social Media Data', 'Text']"
8941,2011.13573,Xiongtao Cui,Xiongtao Cui and Jungang Han,"Chinese Medical Question Answer Matching Based on Interactive Sentence
  Representation Learning",,"pp. 93-109, 2020. CS & IT - CSCP 2020",10.5121/csit.2020.101408,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Chinese medical question-answer matching is more challenging than the
open-domain question answer matching in English. Even though the deep learning
method has performed well in improving the performance of question answer
matching, these methods only focus on the semantic information inside
sentences, while ignoring the semantic association between questions and
answers, thus resulting in performance deficits. In this paper, we design a
series of interactive sentence representation learning models to tackle this
problem. To better adapt to Chinese medical question-answer matching and take
the advantages of different neural network structures, we propose the Crossed
BERT network to extract the deep semantic information inside the sentence and
the semantic association between question and answer, and then combine with the
multi-scale CNNs network or BiGRU network to take the advantage of different
structure of neural networks to learn more semantic features into the sentence
representation. The experiments on the cMedQA V2.0 and cMedQA V1.0 dataset show
that our model significantly outperforms all the existing state-of-the-art
models of Chinese medical question answer matching.
","[{'version': 'v1', 'created': 'Fri, 27 Nov 2020 06:13:56 GMT'}]",2020-11-30,"[['Cui', 'Xiongtao', ''], ['Han', 'Jungang', '']]","['Question answer matching', 'Chinese medical field', 'interactive sentence representation', 'deep learning']"
8942,2005.02156,Mohammed Belkhatir,"Fariza Fauzi, Mohammed Belkhatir","A User Study to Investigate Semantically Relevant Contextual Information
  of WWW Images",,International Journal Human Computer Studies 2010,10.1016/j.ijhcs.2010.01.001,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The contextual information of Web images is investigated to address the issue
of enriching their index characterizations with semantic descriptors and
therefore bridge the semantic gap (i.e. the gap between the low-level
content-based description of images and their semantic interpretation).
Although we are highly motivated by the availability of rich knowledge on the
Web and the relative success achieved by commercial search engines in indexing
images using surrounding text-based information in webpages, we are aware that
the unpredictable quality of the surrounding text is a major limiting factor.
In order to improve its quality, we highlight contextual information which is
relevant for the semantic characterization of Web images and study its
statistical properties in terms of its location and nature considering a
classification into five semantic concept classes: signal, object, scene,
abstract and relational. A user study is conducted to validate the results. The
results suggest that there are several locations that consistently contain
relevant textual information with respect to the image. The importance of each
location is influenced by the type of webpage as the results show the different
distribution of relevant contextual information across the locations for
different webpage types. The frequently found semantic concept classes are
object and abstract. Another important outcome of the user study shows that a
webpage is not an atomic unit and can be further partitioned into smaller
segments. Segments containing images are of interest and termed as image
segments. We observe that users typically single out textual information which
they consider relevant to the image from the textual information bounded within
the image segment.
","[{'version': 'v1', 'created': 'Wed, 29 Apr 2020 04:03:46 GMT'}]",2020-05-06,"[['Fauzi', 'Fariza', ''], ['Belkhatir', 'Mohammed', '']]","['[Information Storage', 'Retrieval] Content Analysis', 'Indexing – indexing methods']"
8943,1904.08616,Grzegorz Korcyl,"G. Korcyl, P. Korcyl",Investigating the Dirac operator evaluation with FPGAs,"8 pages, 5 figures","ISSN: 2409-6008, vol. 6, no. 2, 2019",10.14529/jsfi190204,,cs.DC hep-lat,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years the computational capacity of single Field Programmable Gate
Arrays (FPGA) devices as well as their versatility has increased significantly.
Adding to that the High Level Synthesis frameworks allowing to program such
processors in a high level language like C++, makes modern FPGA devices a
serious candidate as building blocks of a general purpose High Performance
Computing solution. In this contribution we describe benchmarks which we
performed using a Lattice QCD code, a highly compute-demanding HPC academic
code for elementary particle simulations. We benchmark the performance of a
single FPGA device running in two modes: using the external or embedded memory.
We discuss both approaches in detail using the Xilinx U250 device and provide
estimates for the necessary memory throughput and the minimal amount of
resources needed to deliver optimal performance depending on the available
hardware platform.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2019 07:30:54 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Jul 2019 20:15:32 GMT'}]",2019-07-22,"[['Korcyl', 'G.', ''], ['Korcyl', 'P.', '']]","['high performance computing', 'FPGA', 'lattice QCD', 'Dirac operator evaluation']"
8944,1807.09700,Denis Feurer,Denis Feurer and Fabrice Vinatier,"The Time-SIFT method : detecting 3-D changes from archival
  photogrammetric analysis with almost exclusively image information",,"ISPRS journal of photogrammetry and remote sensing 146 (2018):
  495-506",10.1016/j.isprsjprs.2018.10.016,,cs.CV,http://creativecommons.org/licenses/by-sa/4.0/,"  Archival aerial imagery is a source of worldwide very high resolution data
for documenting paste 3-D changes. However, external information is required so
that accurate 3-D models can be computed from archival aerial imagery. In this
research, we propose and test a new method, termed Time-SIFT (Scale Invariant
Feature Transform), which allows for computing coherent multi-temporal Digital
Elevation Models (DEMs) with almost exclusively image information. This method
is based on the invariance properties of the SIFT-like methods which are at the
root of the Structure from Motion (SfM) algorithms. On a test site of 170 km2,
we applied SfM algorithms to a unique image block with all the images of four
different dates covering forty years. We compared this method to more classical
methods based on the use of affordable additional data such as ground control
points collected in recent orthophotos. We did extensive tests to determine
which processing choices were most impacting on the final result. With these
tests, we aimed at evaluating the potential of the proposed Time-SIFT method
for the detection and mapping of 3-D changes. Our study showed that the
Time-SIFT method was the prime criteria that allowed for computing informative
DEMs of difference with almost exclusively image information and limited
photogrammetric expertise and human intervention. Due to the fact that the
proposed Time-SIFT method can be automatically applied with exclusively image
information, our results pave the way to a systematic processing of the
archival aerial imagery on very large spatio-temporal windows, and should hence
greatly help the unlocking of archival aerial imagery for the documenting of
past 3-D changes.
","[{'version': 'v1', 'created': 'Wed, 25 Jul 2018 16:28:05 GMT'}]",2022-07-05,"[['Feurer', 'Denis', ''], ['Vinatier', 'Fabrice', '']]","['Method', 'Automation', 'Multitemporal DEMs', 'Photogrammetry', 'Analog imagery', '3-D Change Detection']"
8945,2205.04898,Cristina Menghini,"Cristina Menghini, Justin Uhr, Shahrzad Haddadan, Ashley Champagne,
  Bjorn Sandstede, Sohini Ramachandran",The Drift of #MyBodyMyChoice Discourse on Twitter,Accepted at WebSci'22,,10.1145/3501247.3531570,,cs.CY cs.SI,http://creativecommons.org/licenses/by/4.0/,"  #MyBodyMyChoice is a well-known hashtag originally created to advocate for
women's rights, often used in discourse about abortion and bodily autonomy. The
Covid-19 outbreak prompted governments to take containment measures such as
vaccination campaigns and mask mandates. Population groups opposed to such
measures started to use the slogan ""My Body My Choice"" to claim their bodily
autonomy. In this paper, we investigate whether the discourse around the
hashtag #MyBodyMyChoice on Twitter changed its usage after the Covid-19
outbreak. We observe that the conversation around the hashtag changed in two
ways. First, semantically, the hashtag #MyBodyMyChoice drifted towards
conversations around Covid-19, especially in messages opposed to containment
measures. Second, while before the pandemic users used to share content
produced by experts and authorities, after Covid-19 the users' attention has
shifted towards individuals.
","[{'version': 'v1', 'created': 'Tue, 10 May 2022 13:43:56 GMT'}]",2022-05-11,"[['Menghini', 'Cristina', ''], ['Uhr', 'Justin', ''], ['Haddadan', 'Shahrzad', ''], ['Champagne', 'Ashley', ''], ['Sandstede', 'Bjorn', ''], ['Ramachandran', 'Sohini', '']]","['twitter', 'covid', 'topic change', 'hashtags']"
8946,1508.03812,Thuc Le Ph.D,"Jiuyong Li, Saisai Ma, Thuc Duy Le, Lin Liu and Jixue Liu",Causal Decision Trees,,,10.1109/TKDE.2016.2619350,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Uncovering causal relationships in data is a major objective of data
analytics. Causal relationships are normally discovered with designed
experiments, e.g. randomised controlled trials, which, however are expensive or
infeasible to be conducted in many cases. Causal relationships can also be
found using some well designed observational studies, but they require domain
experts' knowledge and the process is normally time consuming. Hence there is a
need for scalable and automated methods for causal relationship exploration in
data. Classification methods are fast and they could be practical substitutes
for finding causal signals in data. However, classification methods are not
designed for causal discovery and a classification method may find false causal
signals and miss the true ones. In this paper, we develop a causal decision
tree where nodes have causal interpretations. Our method follows a well
established causal inference framework and makes use of a classic statistical
test. The method is practical for finding causal signals in large data sets.
","[{'version': 'v1', 'created': 'Sun, 16 Aug 2015 11:31:49 GMT'}]",2016-11-01,"[['Li', 'Jiuyong', ''], ['Ma', 'Saisai', ''], ['Le', 'Thuc Duy', ''], ['Liu', 'Lin', ''], ['Liu', 'Jixue', '']]","['Decision tree', 'Causal relationship', 'Potential outcome model', 'Partial association']"
8947,2103.03490,Hadi Jahanshahi,"Hadi Jahanshahi, Mucahit Cevik, Ay\c{s}e Ba\c{s}ar","Moving from Cross-Project Defect Prediction to Heterogeneous Defect
  Prediction: A Partial Replication Study",,"CASCON'20: Proceedings of the 30th Annual International Conference
  on Computer Science and Software Engineering November 2020 Pages 133-142",10.5555/3432601.3432619,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software defect prediction heavily relies on the metrics collected from
software projects. Earlier studies often used machine learning techniques to
build, validate, and improve bug prediction models using either a set of
metrics collected within a project or across different projects. However,
techniques applied and conclusions derived by those models are restricted by
how identical those metrics are. Knowledge coming from those models will not be
extensible to a target project if no sufficient overlapping metrics have been
collected in the source projects. To explore the feasibility of transferring
knowledge across projects without common labeled metrics, we systematically
integrated Heterogeneous Defect Prediction (HDP) by replicating and validating
the obtained results. Our main goal is to extend prior research and explore the
feasibility of HDP and finally to compare its performance with that of its
predecessor, Cross-Project Defect Prediction. We construct an HDP model on
different publicly available datasets. Moreover, we propose a new ensemble
voting approach in the HDP context to utilize the predictive power of multiple
available datasets. The result of our experiment is comparable to that of the
original study. However, we also explored the feasibility of HDP in real cases.
Our results shed light on the infeasibility of many cases for the HDP algorithm
due to its sensitivity to the parameter selection. In general, our analysis
gives a deep insight into why and how to perform transfer learning from one
domain to another, and in particular, provides a set of guidelines to help
researchers and practitioners to disseminate knowledge to the defect prediction
domain.
","[{'version': 'v1', 'created': 'Fri, 5 Mar 2021 06:29:45 GMT'}]",2021-05-03,"[['Jahanshahi', 'Hadi', ''], ['Cevik', 'Mucahit', ''], ['Başar', 'Ayşe', '']]","['Defect Prediction', 'Heterogeneous Metrics', 'Transfer Learning', 'Software Quality']"
8948,2201.02588,Javed Iqbal,"Javed Iqbal, Rehan Hafiz, Mohsen Ali","FogAdapt: Self-Supervised Domain Adaptation for Semantic Segmentation of
  Foggy Images",Accepted at Elsevier Journal of Neurocomputing,,10.1016/j.neucom.2022.05.086,,cs.CV cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper presents FogAdapt, a novel approach for domain adaptation of
semantic segmentation for dense foggy scenes. Although significant research has
been directed to reduce the domain shift in semantic segmentation, adaptation
to scenes with adverse weather conditions remains an open question. Large
variations in the visibility of the scene due to weather conditions, such as
fog, smog, and haze, exacerbate the domain shift, thus making unsupervised
adaptation in such scenarios challenging. We propose a self-entropy and
multi-scale information augmented self-supervised domain adaptation method
(FogAdapt) to minimize the domain shift in foggy scenes segmentation. Supported
by the empirical evidence that an increase in fog density results in high
self-entropy for segmentation probabilities, we introduce a self-entropy based
loss function to guide the adaptation method. Furthermore, inferences obtained
at different image scales are combined and weighted by the uncertainty to
generate scale-invariant pseudo-labels for the target domain. These
scale-invariant pseudo-labels are robust to visibility and scale variations. We
evaluate the proposed model on real clear-weather scenes to real foggy scenes
adaptation and synthetic non-foggy images to real foggy scenes adaptation
scenarios. Our experiments demonstrate that FogAdapt significantly outperforms
the current state-of-the-art in semantic segmentation of foggy images.
Specifically, by considering the standard settings compared to state-of-the-art
(SOTA) methods, FogAdapt gains 3.8% on Foggy Zurich, 6.0% on Foggy
Driving-dense, and 3.6% on Foggy Driving in mIoU when adapted from Cityscapes
to Foggy Zurich.
","[{'version': 'v1', 'created': 'Fri, 7 Jan 2022 18:29:58 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Jan 2022 13:57:18 GMT'}, {'version': 'v3', 'created': 'Wed, 8 Jun 2022 20:40:19 GMT'}]",2022-06-10,"[['Iqbal', 'Javed', ''], ['Hafiz', 'Rehan', ''], ['Ali', 'Mohsen', '']]","['Foggy Scene Understanding', 'Domain Adaptation', 'Semantic Segmentation', 'Self-supervised Learning', 'Scale-invariance']"
8949,2209.10215,Eduardo Alvarado Mr.,"Eduardo Alvarado, Chlo\'e Paliard, Damien Rohmer, Marie-Paule Cani",Real-Time Locomotion on Soft Grounds With Dynamic Footprints,,"Frontiers in Virtual Reality, Frontiers, 2022, 3",10.3389/frvir.2022.801856,,cs.GR,http://creativecommons.org/licenses/by/4.0/,"  When we move on snow, sand, or mud, the ground deforms under our feet,
immediately affecting our gait. We propose a physically based model for
computing such interactions in real time, from only the kinematic motion of a
virtual character. The force applied by each foot on the ground during contact
is estimated from the weight of the character, its current balance, the foot
speed at the time of contact, and the nature of the ground. We rely on a
standard stress-strain relationship to compute the dynamic deformation of the
soil under this force, where the amount of compression and lateral displacement
of material are, respectively, parameterized by the soil's Young modulus and
Poisson ratio. The resulting footprint is efficiently applied to the terrain
through procedural deformations of refined terrain patches, while the addition
of a simple controller on top of a kinematic character enables capturing the
effect of ground deformation on the character's gait. As our results show, the
resulting footprints greatly improve visual realism, while ground compression
results in consistent changes in the character's motion. Readily applicable to
any locomotion gait and soft soil material, our real-time model is ideal for
enhancing the visual realism of outdoor scenes in video games and virtual
reality applications.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2022 09:24:05 GMT'}]",2022-09-22,"[['Alvarado', 'Eduardo', ''], ['Paliard', 'Chloé', ''], ['Rohmer', 'Damien', ''], ['Cani', 'Marie-Paule', '']]","['character animation', 'kinematics', 'natural phenomenon', 'terrain deformation', 'real time']"
8950,1711.09670,Christian Reul,"Christian Reul, Uwe Springmann, Christoph Wick, and Frank Puppe","Improving OCR Accuracy on Early Printed Books by utilizing Cross Fold
  Training and Voting",,,10.1109/DAS.2018.30,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we introduce a method that significantly reduces the character
error rates for OCR text obtained from OCRopus models trained on early printed
books. The method uses a combination of cross fold training and confidence
based voting. After allocating the available ground truth in different subsets
several training processes are performed, each resulting in a specific OCR
model. The OCR text generated by these models then gets voted to determine the
final output by taking the recognized characters, their alternatives, and the
confidence values assigned to each character into consideration. Experiments on
seven early printed books show that the proposed method outperforms the
standard approach considerably by reducing the amount of errors by up to 50%
and more.
","[{'version': 'v1', 'created': 'Mon, 27 Nov 2017 13:15:52 GMT'}]",2018-07-25,"[['Reul', 'Christian', ''], ['Springmann', 'Uwe', ''], ['Wick', 'Christoph', ''], ['Puppe', 'Frank', '']]","['OCR', 'Voting', 'Early Printed Books']"
8951,2009.01557,Arthur-Jozsef Molnar,"Arthur-Jozsef Molnar, Alexandra Neam\c{t}u and Simona Motogna",Evaluation of Software Product Quality Metrics,"Published in: Molnar AJ., Neam\c{t}u A., Motogna S. (2020) Evaluation
  of Software Product Quality Metrics. In: Damiani E., Spanoudakis G.,
  Maciaszek L. (eds) Evaluation of Novel Approaches to Software Engineering.
  ENASE 2019. Communications in Computer and Information Science, vol 1172.
  Springer, Cham. https://doi.org/10.1007/978-3-030-40223-5_8","Communications in Computer and Information Science, vol 1172.
  Springer, Cham. 2020",10.1007/978-3-030-40223-5_8,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computing devices and associated software govern everyday life, and form the
backbone of safety critical systems in banking, healthcare, automotive and
other fields. Increasing system complexity, quickly evolving technologies and
paradigm shifts have kept software quality research at the forefront. Standards
such as ISO's 25010 express it in terms of sub-characteristics such as
maintainability, reliability and security. A significant body of literature
attempts to link these subcharacteristics with software metric values, with the
end goal of creating a metric-based model of software product quality. However,
research also identifies the most important existing barriers. Among them we
mention the diversity of software application types, development platforms and
languages. Additionally, unified definitions to make software metrics truly
language-agnostic do not exist, and would be difficult to implement given
programming language levels of variety. This is compounded by the fact that
many existing studies do not detail their methodology and tooling, which
precludes researchers from creating surveys to enable data analysis on a larger
scale. In our paper, we propose a comprehensive study of metric values in the
context of three complex, open-source applications. We align our methodology
and tooling with that of existing research, and present it in detail in order
to facilitate comparative evaluation. We study metric values during the entire
18-year development history of our target applications, in order to capture the
longitudinal view that we found lacking in existing literature. We identify
metric dependencies and check their consistency across applications and their
versions. At each step, we carry out comparative evaluation with existing
research and present our results.
","[{'version': 'v1', 'created': 'Thu, 3 Sep 2020 10:06:25 GMT'}]",2020-09-04,"[['Molnar', 'Arthur-Jozsef', ''], ['Neamţu', 'Alexandra', ''], ['Motogna', 'Simona', '']]","['software metric', 'software quality', 'descriptive statistics', 'crosssectional study', 'longitudinal study']"
8952,2008.04445,Amr Elsisy,"Amr Elsisy, Aamir Mandviwalla, Boleslaw Szymanski, Thomas Sharkey",A Synthetic Network Generator for Covert Network Analytics,,"Information Sciencs, vol. 584, pp.387-398, Jan. 2022, online Nov.
  6 2021",10.1016/j.ins.2021.10.066,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study social networks and focus on covert (also known as hidden) networks,
such as terrorist or criminal networks. Their structures, memberships and
activities are illegal. Thus, data about covert networks is often incomplete
and partially incorrect, making interpreting structures and activities of such
networks challenging. For legal reasons, real data about active covert networks
is inaccessible to researchers. To address these challenges, we introduce here
a network generator for synthetic networks that are statistically similar to a
real network but void of personal information about its members. The generator
uses statistical data about a real or imagined covert organization network. It
generates randomized instances of the Stochastic Block model of the network
groups but preserves this network organizational structure. The direct use of
such anonymized networks is for training on them the research and analytical
tools for finding structure and dynamics of covert networks. Since these
synthetic networks differ in their sets of edges and communities, they can be
used as a new source for network analytics. First, they provide alternative
interpretations of the data about the original network. The distribution of
probabilities for these alternative interpretations enables new network
analytics. The analysts can find community structures which are frequent,
therefore stable under perturbations. They may also analyze how the stability
changes with the strength of perturbation. For covert networks, the analysts
can quantify statistically expected outcomes of interdiction. This kind of
analytics applies to all complex network in which the data are incomplete or
partially incorrect.
","[{'version': 'v1', 'created': 'Mon, 10 Aug 2020 22:52:36 GMT'}]",2021-11-29,"[['Elsisy', 'Amr', ''], ['Mandviwalla', 'Aamir', ''], ['Szymanski', 'Boleslaw', ''], ['Sharkey', 'Thomas', '']]","['Social networks', 'Random weighted network generator', 'Network']"
8953,1704.02432,Umang Mathur,"Dileep Kini, Umang Mathur, Mahesh Viswanathan",Dynamic Race Prediction in Linear Time,"22 pages, 8 figures, 1 algorithm, 1 table",,10.1145/3140587.3062374,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Writing reliable concurrent software remains a huge challenge for today's
programmers. Programmers rarely reason about their code by explicitly
considering different possible inter-leavings of its execution. We consider the
problem of detecting data races from individual executions in a sound manner.
The classical approach to solving this problem has been to use Lamport's
happens-before (HB) relation. Until now HB remains the only approach that runs
in linear time. Previous efforts in improving over HB such as causally-precedes
(CP) and maximal causal models fall short due to the fact that they are not
implementable efficiently and hence have to compromise on their race detecting
ability by limiting their techniques to bounded sized fragments of the
execution. We present a new relation weak-causally-precedes (WCP) that is
provably better than CP in terms of being able to detect more races, while
still remaining sound. Moreover it admits a linear time algorithm which works
on the entire execution without having to fragment it.
","[{'version': 'v1', 'created': 'Sat, 8 Apr 2017 03:14:13 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Apr 2017 15:38:53 GMT'}, {'version': 'v3', 'created': 'Sun, 16 Apr 2017 05:55:54 GMT'}]",2017-12-20,"[['Kini', 'Dileep', ''], ['Mathur', 'Umang', ''], ['Viswanathan', 'Mahesh', '']]","['Concurrency', 'Data race', 'Prediction']"
8954,2205.14321,Zou Xinyu,"Xinyu Zou, Zhi Hu, Yiming Zhao, Xuchu Ding, Zhongyi Liu, Chenliang Li,
  Aixin Sun",Automatic Expert Selection for Multi-Scenario and Multi-Task Search,"Accepted by SIGIR 2022; 10 pages, 8 figures",,10.1145/3477495.3531942,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-scenario learning (MSL) enables a service provider to cater for users'
fine-grained demands by separating services for different user sectors, e.g.,
by user's geographical region. Under each scenario there is a need to optimize
multiple task-specific targets e.g., click through rate and conversion rate,
known as multi-task learning (MTL). Recent solutions for MSL and MTL are mostly
based on the multi-gate mixture-of-experts (MMoE) architecture. MMoE structure
is typically static and its design requires domain-specific knowledge, making
it less effective in handling both MSL and MTL. In this paper, we propose a
novel Automatic Expert Selection framework for Multi-scenario and Multi-task
search, named AESM^{2}. AESM^{2} integrates both MSL and MTL into a unified
framework with an automatic structure learning. Specifically, AESM^{2} stacks
multi-task layers over multi-scenario layers. This hierarchical design enables
us to flexibly establish intrinsic connections between different scenarios, and
at the same time also supports high-level feature extraction for different
tasks. At each multi-scenario/multi-task layer, a novel expert selection
algorithm is proposed to automatically identify scenario-/task-specific and
shared experts for each input. Experiments over two real-world large-scale
datasets demonstrate the effectiveness of AESM^{2} over a battery of strong
baselines. Online A/B test also shows substantial performance gain on multiple
metrics. Currently, AESM^{2} has been deployed online for serving major
traffic.
","[{'version': 'v1', 'created': 'Sat, 28 May 2022 03:41:25 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Jun 2022 09:13:41 GMT'}]",2022-06-07,"[['Zou', 'Xinyu', ''], ['Hu', 'Zhi', ''], ['Zhao', 'Yiming', ''], ['Ding', 'Xuchu', ''], ['Liu', 'Zhongyi', ''], ['Li', 'Chenliang', ''], ['Sun', 'Aixin', '']]","['Multi-Task Learning', 'Multi-Scenario Learning', 'Search and Ranking']"
8955,2108.02052,Mahsa Pourbafrani,"Mahsa Pourbafrani, Shuai Jiao, and Wil M. P. van der Aalst","SIMPT: Process Improvement Using Interactive Simulation of Time-aware
  Process Trees",,"Research Challenges in Information Science. RCIS 2021. Lecture
  Notes in Business Information Processing, vol 415. Springer, Cham",10.1007/978-3-030-75018-3_40,,cs.OH,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Process mining techniques including process discovery, conformance checking,
and process enhancement provide extensive knowledge about processes.
Discovering running processes and deviations as well as detecting performance
problems and bottlenecks are well-supported by process mining tools. However,
all the provided techniques represent the past/current state of the process.
The improvement in a process requires insights into the future states of the
process w.r.t. the possible actions/changes. In this paper, we present a new
tool that enables process owners to extract all the process aspects from their
historical event data automatically, change these aspects, and re-run the
process automatically using an interface. The combination of process mining and
simulation techniques provides new evidence-driven ways to explore ""what-if""
questions. Therefore, assessing the effects of changes in process improvement
is also possible. Our Python-based web-application provides a complete
interactive platform to improve the flow of activities, i.e., process tree,
along with possible changes in all the derived activity, resource, and process
parameters. These parameters are derived directly from an event log without
user-background knowledge.
","[{'version': 'v1', 'created': 'Mon, 2 Aug 2021 10:03:40 GMT'}]",2021-08-05,"[['Pourbafrani', 'Mahsa', ''], ['Jiao', 'Shuai', ''], ['van der Aalst', 'Wil M. P.', '']]","['process mining', 'process tree', 'interactive process improvement', 'simulation', 'event log', 'automatic simulation model generation']"
8956,2206.09428,Antonios Saravanos,"Antonios Saravanos (1), Stavros Zervoudakis (1), Dongnanzi Zheng (1),
  Amarpreet Nanda (1), Georgios Shaheen (1), Charles Hornat (1), Jeremiah Konde
  Chaettle (1), Alassane Yoda (1), Hyeree Park (1), Will Ang (1) ((1) New York
  University)","Reputation, Risk, and Trust on User Adoption of Internet Search Engines:
  The Case of DuckDuckGo",,,10.1007/978-3-031-19679-9_87,,cs.CR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates the determinants of end-user adoption of the
DuckDuckGo search engine coupling the standard UTAUT model with factors to
reflect reputation, risk, and trust. An experimental approach was taken to
validate our model, where participants were exposed to the DuckDuckGo product
using a vignette. Subsequently, answering questions on their perception of the
technology. The data was analyzed using the partial least squares-structural
equation modeling (PLS-SEM) approach. From the nine distinct factors studied,
we found that 'Performance Expectancy' played the greatest role in user
decisions on adoption, followed by 'Firm Reputation', 'Initial Trust in
Technology', 'Social Influence', and an individual's 'Disposition to Trust'. We
conclude by exploring how these findings can explain DuckDuckGo's rising
prominence as a search engine.
","[{'version': 'v1', 'created': 'Sun, 19 Jun 2022 15:07:42 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Jul 2022 13:07:13 GMT'}, {'version': 'v3', 'created': 'Fri, 25 Nov 2022 03:42:36 GMT'}]",2022-11-28,"[['Saravanos', 'Antonios', ''], ['Zervoudakis', 'Stavros', ''], ['Zheng', 'Dongnanzi', ''], ['Nanda', 'Amarpreet', ''], ['Shaheen', 'Georgios', ''], ['Hornat', 'Charles', ''], ['Chaettle', 'Jeremiah Konde', ''], ['Yoda', 'Alassane', ''], ['Park', 'Hyeree', ''], ['Ang', 'Will', '']]","['end-user adoption', 'DuckDuckGo', 'privacy-conscious search engine', 'trust', 'risk']"
8957,2110.01246,Damien Chablat,"Guillaume Michel (CHU Nantes), Durgesh Salunkhe (LS2N), Philippe
  Bordure (CHU Nantes), Damien Chablat (ReV)","Geometric Atlas of the Middle Ear and Paranasal Sinuses for Robotic
  Applications","Surgical Innovation, SAGE Publications (UK and US), 2021. arXiv admin
  note: text overlap with arXiv:2005.05599",,10.1177/15533506211039675,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In otolaryngologic surgery, more and more robots are being studied to meet
the clinical needs of operating rooms. However, to help design and optimize
these robots, the workspace must be precisely defined taking into account
patient variability. The aim of this work is to define a geometric atlas of the
middle ear and paranasal sinuses for endoscopic robotic applications. Scans of
several patients of different ages and sexes were used to determine the average
size of these workspaces, which are linked by the similar use of endoscopes in
surgery.
","[{'version': 'v1', 'created': 'Mon, 4 Oct 2021 08:30:43 GMT'}]",2021-10-05,"[['Michel', 'Guillaume', '', 'CHU Nantes'], ['Salunkhe', 'Durgesh', '', 'LS2N'], ['Bordure', 'Philippe', '', 'CHU Nantes'], ['Chablat', 'Damien', '', 'ReV']]","['Otology', 'Atlas', 'Workspace', 'Endoscopy']"
8958,2003.04094,Jacek Dabrowski,"Mikolaj Wieczorek (1), Andrzej Michalowski (1), Anna Wroblewska (1 and
  2), Jacek Dabrowski (1) ((1) Synerise, (2) Warsaw University of Technology)","A Strong Baseline for Fashion Retrieval with Person Re-Identification
  Models","33 pages, 14 figures","short paper in Neural Information Processing, Communications in
  Computer and Information Science, 2020",10.1007/978-3-030-63820-7_33,,cs.CV cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fashion retrieval is the challenging task of finding an exact match for
fashion items contained within an image. Difficulties arise from the
fine-grained nature of clothing items, very large intra-class and inter-class
variance. Additionally, query and source images for the task usually come from
different domains - street photos and catalogue photos respectively. Due to
these differences, a significant gap in quality, lighting, contrast, background
clutter and item presentation exists between domains. As a result, fashion
retrieval is an active field of research both in academia and the industry.
  Inspired by recent advancements in Person Re-Identification research, we
adapt leading ReID models to be used in fashion retrieval tasks. We introduce a
simple baseline model for fashion retrieval, significantly outperforming
previous state-of-the-art results despite a much simpler architecture. We
conduct in-depth experiments on Street2Shop and DeepFashion datasets and
validate our results. Finally, we propose a cross-domain (cross-dataset)
evaluation method to test the robustness of fashion retrieval models.
","[{'version': 'v1', 'created': 'Mon, 9 Mar 2020 12:50:15 GMT'}]",2022-11-24,"[['Wieczorek', 'Mikolaj', '', 'Synerise'], ['Michalowski', 'Andrzej', '', 'Synerise'], ['Wroblewska', 'Anna', '', '1 and\n  2'], ['Dabrowski', 'Jacek', '', 'Synerise']]","['clothes retrieval', 'quadruplet loss', 'person re-identification', 'deep learning in fashion']"
8959,1710.05715,Zhiyang Su,"Zhiyang Su, Ting Wang, Yu Xia, Mounir Hamdi","CeMon: A Cost-effective Flow Monitoring System in Software Defined
  Networks",,"Computer Networks: The International Journal of Computer and
  Telecommunications Networking, Volume 92, Issue P1, December 2015, Pages
  101-115",10.1016/j.comnet.2015.09.018,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network monitoring and measurement are crucial in network management to
facilitate quality of service routing and performance evaluation. Software
Defined Networking (SDN) makes network management easier by separating the
control plane and data plane. Network monitoring in SDN is relatively
light-weight since operators only need to install a monitoring module into the
controller. Active monitoring techniques usually introduce extra overhead into
the network. The state-of-the-art approaches utilize sampling, aggregation and
passive measurement techniques to reduce measurement overhead. However, little
work has focused on reducing the communication cost of network monitoring.
Moreover, most of the existing approaches select polling switch nodes by
sub-optimal local heuristics.Inspired by the visibility and central control of
SDN, we propose CeMon, a generic low-cost high-accuracy monitoring system that
supports various network management tasks. We first propose a Maximum Coverage
Polling Scheme (MCPS) to optimize the polling cost for all active flows. The
problem is formulated as a weighted set cover problem which is proved to be
NP-hard. Heuristics are presented to obtain the polling scheme efficiently and
handle traffic dynamics practically. In order to balance the cost and
flexibility, an Adaptive Fine-grained Polling Scheme (AFPS) is proposed as a
complementary method to implement flow level measurement tasks. Three sampling
algorithms are further proposed to eliminate measurement overhead while
maintain high accuracy. Both emulation and simulation results show that MCPS
reduces more than 50% of the communication cost with negligible loss of
accuracy for different topologies and traffics. We also use real traces to
demonstrate that AFPS reduces the cost by up to 20% with only 1.5% loss in
accuracy.
","[{'version': 'v1', 'created': 'Mon, 16 Oct 2017 14:16:45 GMT'}]",2017-10-17,"[['Su', 'Zhiyang', ''], ['Wang', 'Ting', ''], ['Xia', 'Yu', ''], ['Hamdi', 'Mounir', '']]","['Software defined networking', 'Network management', 'Network measurement']"
8960,2001.04163,Dan Liu,"Dan Liu, Libo Zhang, Tiejian Luo, Lili Tao, Yanjun Wu","Towards Interpretable and Robust Hand Detection via Pixel-wise
  Prediction",Accepted to Pattern Recognition,,10.1016/j.patcog.2020.107202,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The lack of interpretability of existing CNN-based hand detection methods
makes it difficult to understand the rationale behind their predictions. In
this paper, we propose a novel neural network model, which introduces
interpretability into hand detection for the first time. The main improvements
include: (1) Detect hands at pixel level to explain what pixels are the basis
for its decision and improve transparency of the model. (2) The explainable
Highlight Feature Fusion block highlights distinctive features among multiple
layers and learns discriminative ones to gain robust performance. (3) We
introduce a transparent representation, the rotation map, to learn rotation
features instead of complex and non-transparent rotation and derotation layers.
(4) Auxiliary supervision accelerates the training process, which saves more
than 10 hours in our experiments. Experimental results on the VIVA and Oxford
hand detection and tracking datasets show competitive accuracy of our method
compared with state-of-the-art methods with higher speed.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2020 11:18:09 GMT'}]",2020-01-20,"[['Liu', 'Dan', ''], ['Zhang', 'Libo', ''], ['Luo', 'Tiejian', ''], ['Tao', 'Lili', ''], ['Wu', 'Yanjun', '']]","['Interpretability', 'hand detection', 'pixel level', 'explainable']"
8961,2102.01275,Xingjun Li,"Xingjun Li, Yuanxin Wang, Hong Wang, Yang Wang, and Jian Zhao","NBSearch: Semantic Search and Visual Exploration of Computational
  Notebooks",14 pages,,10.1145/3411764.3445048,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Code search is an important and frequent activity for developers using
computational notebooks (e.g., Jupyter). The flexibility of notebooks brings
challenges for effective code search, where classic search interfaces for
traditional software code may be limited. In this paper, we propose, NBSearch,
a novel system that supports semantic code search in notebook collections and
interactive visual exploration of search results. NBSearch leverages advanced
machine learning models to enable natural language search queries and intuitive
visualizations to present complicated intra- and inter-notebook relationships
in the returned results. We developed NBSearch through an iterative
participatory design process with two experts from a large software company. We
evaluated the models with a series of experiments and the whole system with a
controlled user study. The results indicate the feasibility of our analytical
pipeline and the effectiveness of NBSearch to support code search in large
notebook collections.
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2021 03:15:44 GMT'}]",2021-02-03,"[['Li', 'Xingjun', ''], ['Wang', 'Yuanxin', ''], ['Wang', 'Hong', ''], ['Wang', 'Yang', ''], ['Zhao', 'Jian', '']]","['Semantic code search', 'search result visualization', 'computationalnotebooks', 'document and text analysis']"
8962,2110.13569,Gorm Lai,"Gorm Lai, Annakaisa Kultima, Foaad Khosmood, Johanna Pirker, Allan
  Fowler, Ilaria Vecchi, William Latham, Frederic Fol Leymarie",Two Decades of Game Jams,,"ICGJ 2021: Sixth Annual International Conference on Game Jams,
  Hackathons, and Game Creation Events",10.1145/3472688.3472689,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In less than a year's time, March 2022 will mark the twentieth anniversary of
the first documented game jam, the Indie Game Jam, which took place in Oakland,
California in 2002. Initially, game jams were widely seen as frivolous
activities. Since then, they have taken the world by storm. Game jams have not
only become part of the day-to-day process of many game developers, but jams
are also used for activist purposes, for learning and teaching, as part of the
experience economy, for making commercial prototypes that gamers can vote on,
and more. Beyond only surveying game jams and the relevant published scientific
literature from the last two decades, this paper has several additional
contributions. It builds a history of game jams, and proposes two different
taxonomies of game jams - a historical and a categorical. In addition, it
discusses the definition of game jam and identifies the most active research
areas within the game jam community such as the interplay and development with
local communities, the study and analysis of game jammers and organisers, and
works that bring a critical look on game jams.
","[{'version': 'v1', 'created': 'Tue, 26 Oct 2021 10:58:01 GMT'}]",2021-10-27,"[['Lai', 'Gorm', ''], ['Kultima', 'Annakaisa', ''], ['Khosmood', 'Foaad', ''], ['Pirker', 'Johanna', ''], ['Fowler', 'Allan', ''], ['Vecchi', 'Ilaria', ''], ['Latham', 'William', ''], ['Leymarie', 'Frederic Fol', '']]","['game jams', 'global game jam', 'game development', 'review', 'taxonomy', 'participatory design', 'hackathons']"
8963,2206.14539,Luk\'a\v{s} Sadlek,"Luk\'a\v{s} Sadlek, Pavel \v{C}eleda, Daniel Tovar\v{n}\'ak","Current Challenges of Cyber Threat and Vulnerability Identification
  Using Public Enumerations","The 17th International Conference on Availability, Reliability and
  Security (ARES 2022), 8 pages",,10.1145/3538969.3544458,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identification of cyber threats is one of the essential tasks for security
teams. Currently, cyber threats can be identified using knowledge organized
into various formats, enumerations, and knowledge bases. This paper studies the
current challenges of identifying vulnerabilities and threats in cyberspace
using enumerations and data about assets. Although enumerations are used in
practice, we point out several issues that still decrease the quality of
vulnerability and threat identification. Since vulnerability identification
methods are based on network monitoring and agents, the issues are related to
the asset discovery, the precision of vulnerability discovery, and the amount
of data. On the other hand, threat identification utilizes graph-based,
nature-language, machine-learning, and ontological approaches. The current
trend is to propose methods that utilize tactics, techniques, and procedures
instead of low-level indicators of compromise to make cyber threat
identification more mature. Cooperation between standards from threat,
vulnerability, and asset management is also an unresolved issue confirmed by
analyzing relationships between public enumerations and knowledge bases. Last,
we studied the usability of techniques from the MITRE ATT&CK knowledge base for
threat modeling using network monitoring to capture data. Although network
traffic is not the most used data source, it allows the modeling of almost all
tactics from the MITRE ATT&CK.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2022 11:35:26 GMT'}]",2022-06-30,"[['Sadlek', 'Lukáš', ''], ['Čeleda', 'Pavel', ''], ['Tovarňák', 'Daniel', '']]","['cyber threat intelligence', 'threat identification', 'vulnerability identification', 'CVE', 'CAPEC', 'MITRE ATT&CK']"
8964,2001.00786,Alessandro Paolo Capasso,"Alessandro Paolo Capasso, Giulio Bacchiani, Daniele Molinari",Intelligent Roundabout Insertion using Deep Reinforcement Learning,,"Proceedings of ICAART 2020, ISBN: 978-989-758-395-7",10.5220/0008915003780385,,cs.LG cs.AI cs.MA cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An important topic in the autonomous driving research is the development of
maneuver planning systems. Vehicles have to interact and negotiate with each
other so that optimal choices, in terms of time and safety, are taken. For this
purpose, we present a maneuver planning module able to negotiate the entering
in busy roundabouts. The proposed module is based on a neural network trained
to predict when and how entering the roundabout throughout the whole duration
of the maneuver. Our model is trained with a novel implementation of A3C, which
we will call Delayed A3C (D-A3C), in a synthetic environment where vehicles
move in a realistic manner with interaction capabilities. In addition, the
system is trained such that agents feature a unique tunable behavior, emulating
real world scenarios where drivers have their own driving styles. Similarly,
the maneuver can be performed using different aggressiveness levels, which is
particularly useful to manage busy scenarios where conservative rule-based
policies would result in undefined waits.
","[{'version': 'v1', 'created': 'Fri, 3 Jan 2020 11:16:41 GMT'}, {'version': 'v2', 'created': 'Wed, 13 May 2020 11:24:33 GMT'}, {'version': 'v3', 'created': 'Wed, 28 Apr 2021 09:22:53 GMT'}]",2021-04-29,"[['Capasso', 'Alessandro Paolo', ''], ['Bacchiani', 'Giulio', ''], ['Molinari', 'Daniele', '']]","['Autonomous Driving', 'Deep Reinforcement Learning', 'Multi-Agent Systems', 'Agent Cooperation and Negotiation', 'Maneuver Planning System']"
8965,2112.12042,Suthee Ruangwises,"Suthee Ruangwises, Toshiya Itoh",Physical ZKP for Makaro Using a Standard Deck of Cards,This paper has appeared at TAMC 2022,,10.1007/978-3-031-20350-3_5,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Makaro is a logic puzzle with an objective to fill numbers into a rectangular
grid to satisfy certain conditions. In 2018, Bultel et al. developed a physical
zero-knowledge proof (ZKP) protocol for Makaro using a deck of cards, which
allows a prover to physically convince a verifier that he/she knows a solution
of the puzzle without revealing it. However, their protocol requires several
identical copies of some cards, making it impractical as a deck of playing
cards found in everyday life typically consists of all different cards. In this
paper, we propose a new ZKP protocol for Makaro that can be implemented using a
standard deck (a deck consisting of all different cards). Our protocol also
uses asymptotically less cards than the protocol of Bultel et al. Most
importantly, we develop a general method to encode a number with a sequence of
all different cards. This allows us to securely compute several numerical
functions using a standard deck, such as verifying that two given numbers are
different and verifying that a number is the largest one among the given
numbers.
","[{'version': 'v1', 'created': 'Wed, 22 Dec 2021 17:11:32 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Dec 2021 15:46:10 GMT'}, {'version': 'v3', 'created': 'Tue, 25 Oct 2022 09:38:48 GMT'}]",2023-01-03,"[['Ruangwises', 'Suthee', ''], ['Itoh', 'Toshiya', '']]","['zero-knowledge proof', 'card-based cryptography', 'Makaro', 'puzzle']"
8966,1910.00702,Ling Cai,"Ling Cai, Bo Yan, Gengchen Mai, Krzysztof Janowicz, Rui Zhu","TransGCN:Coupling Transformation Assumptions with Graph Convolutional
  Networks for Link Prediction",,,10.1145/3360901.3364441,,cs.LG cs.CL stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Link prediction is an important and frequently studied task that contributes
to an understanding of the structure of knowledge graphs (KGs) in statistical
relational learning. Inspired by the success of graph convolutional networks
(GCN) in modeling graph data, we propose a unified GCN framework, named
TransGCN, to address this task, in which relation and entity embeddings are
learned simultaneously. To handle heterogeneous relations in KGs, we introduce
a novel way of representing heterogeneous neighborhood by introducing
transformation assumptions on the relationship between the subject, the
relation, and the object of a triple. Specifically, a relation is treated as a
transformation operator transforming a head entity to a tail entity. Both
translation assumption in TransE and rotation assumption in RotatE are explored
in our framework. Additionally, instead of only learning entity embeddings in
the convolution-based encoder while learning relation embeddings in the decoder
as done by the state-of-art models, e.g., R-GCN, the TransGCN framework trains
relation embeddings and entity embeddings simultaneously during the graph
convolution operation, thus having fewer parameters compared with R-GCN.
Experiments show that our models outperform the-state-of-arts methods on both
FB15K-237 and WN18RR.
","[{'version': 'v1', 'created': 'Tue, 1 Oct 2019 22:34:40 GMT'}]",2019-10-03,"[['Cai', 'Ling', ''], ['Yan', 'Bo', ''], ['Mai', 'Gengchen', ''], ['Janowicz', 'Krzysztof', ''], ['Zhu', 'Rui', '']]","['Knowledge Graph Embedding', 'Link Prediction', 'Graph Convolutional Network', 'Transformation Assumption', 'Neighborhood']"
8967,1807.07617,Matthias Zeppelzauer,Matthias Zeppelzauer and Alexis Ringot and Florian Taurer,SoniControl - A Mobile Ultrasonic Firewall,"To appear in proceedings of 2018 ACM Multimedia Conference October
  22--26, 2018, Seoul, Republic of Korea",,10.1145/3240508.3241393,,cs.MM cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The exchange of data between mobile devices in the near-ultrasonic frequency
band is a new promising technology for near field communication (NFC) but also
raises a number of privacy concerns. We present the first ultrasonic firewall
that reliably detects ultrasonic communication and provides the user with
effective means to prevent hidden data exchange. This demonstration showcases a
new media-based communication technology (""data over audio"") together with its
related privacy concerns. It enables users to (i) interactively test out and
experience ultrasonic information exchange and (ii) shows how to protect
oneself against unwanted tracking.
","[{'version': 'v1', 'created': 'Thu, 19 Jul 2018 19:18:51 GMT'}]",2018-07-23,"[['Zeppelzauer', 'Matthias', ''], ['Ringot', 'Alexis', ''], ['Taurer', 'Florian', '']]","['Data over audio', 'acoustic tracking', 'audio detection', 'anomaly detection', 'privacy protection']"
8968,2110.10980,Jakob Mokander,"Jakob Mokander, Jessica Morley, Mariarosaria Taddeo and Luciano
  Floridi","Ethics-Based Auditing of Automated Decision-Making Systems: Nature,
  Scope, and Limitations","Artificial Intelligence, Auditing, Automated Decision-Making, Ethics,
  Governance","Mokander, J., Morley, J., Taddeo, M. et al. Ethics-Based Auditing
  of Automated Decision-Making Systems: Nature, Scope, and Limitations. Sci Eng
  Ethics 27, 44 (2021)",10.1007/s11948-021-00319-4,,cs.CY cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Important decisions that impact human lives, livelihoods, and the natural
environment are increasingly being automated. Delegating tasks to so-called
automated decision-making systems (ADMS) can improve efficiency and enable new
solutions. However, these benefits are coupled with ethical challenges. For
example, ADMS may produce discriminatory outcomes, violate individual privacy,
and undermine human self-determination. New governance mechanisms are thus
needed that help organisations design and deploy ADMS in ways that are ethical,
while enabling society to reap the full economic and social benefits of
automation. In this article, we consider the feasibility and efficacy of
ethics-based auditing (EBA) as a governance mechanism that allows organisations
to validate claims made about their ADMS. Building on previous work, we define
EBA as a structured process whereby an entity's present or past behaviour is
assessed for consistency with relevant principles or norms. We then offer three
contributions to the existing literature. First, we provide a theoretical
explanation of how EBA can contribute to good governance by promoting
procedural regularity and transparency. Second, we propose seven criteria for
how to design and implement EBA procedures successfully. Third, we identify and
discuss the conceptual, technical, social, economic, organisational, and
institutional constraints associated with EBA. We conclude that EBA should be
considered an integral component of multifaced approaches to managing the
ethical risks posed by ADMS.
","[{'version': 'v1', 'created': 'Thu, 21 Oct 2021 08:51:28 GMT'}]",2021-10-22,"[['Mokander', 'Jakob', ''], ['Morley', 'Jessica', ''], ['Taddeo', 'Mariarosaria', ''], ['Floridi', 'Luciano', '']]","['Artificial Intelligence', 'Auditing', 'Automated Decision-Making', 'Ethics', 'Governance']"
8969,2008.03640,Feng Xia,"Jie Hou, Hanxiao Pan, Teng Guo, Ivan Lee, Xiangjie Kong, Feng Xia",Prediction Methods and Applications in the Science of Science: A Survey,"17 pages, 6 figures","Computer Science Review, Volume 34, November 2019, 100197",10.1016/j.cosrev.2019.100197,,cs.SI cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Science of science has become a popular topic that attracts great attentions
from the research community. The development of data analytics technologies and
the readily available scholarly data enable the exploration of data-driven
prediction, which plays a pivotal role in finding the trend of scientific
impact. In this paper, we analyse methods and applications in data-driven
prediction in the science of science, and discuss their significance. First, we
introduce the background and review the current state of the science of
science. Second, we review data-driven prediction based on paper citation
count, and investigate research issues in this area. Then, we discuss methods
to predict scholar impact, and we analyse different approaches to promote the
scholarly collaboration in the collaboration network. This paper also discusses
open issues and existing challenges, and suggests potential research
directions.
","[{'version': 'v1', 'created': 'Sun, 9 Aug 2020 03:42:43 GMT'}]",2020-08-11,"[['Hou', 'Jie', ''], ['Pan', 'Hanxiao', ''], ['Guo', 'Teng', ''], ['Lee', 'Ivan', ''], ['Kong', 'Xiangjie', ''], ['Xia', 'Feng', '']]","['Prediction methods', 'data analysis', 'scholarly data', 'science of science']"
8970,2204.09508,Min Zhou,"Bisheng Li, Min Zhou, Shengzhong Zhang, Menglin Yang, Defu Lian,
  Zengfeng Huang","BSAL: A Framework of Bi-component Structure and Attribute Learning for
  Link Prediction",Accepted by SIGIR 2022,,10.1145/3477495.3531804,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given the ubiquitous existence of graph-structured data, learning the
representations of nodes for the downstream tasks ranging from node
classification, link prediction to graph classification is of crucial
importance. Regarding missing link inference of diverse networks, we revisit
the link prediction techniques and identify the importance of both the
structural and attribute information. However, the available techniques either
heavily count on the network topology which is spurious in practice or cannot
integrate graph topology and features properly. To bridge the gap, we propose a
bicomponent structural and attribute learning framework (BSAL) that is designed
to adaptively leverage information from topology and feature spaces.
Specifically, BSAL constructs a semantic topology via the node attributes and
then gets the embeddings regarding the semantic view, which provides a flexible
and easy-to-implement solution to adaptively incorporate the information
carried by the node attributes. Then the semantic embedding together with
topology embedding is fused together using an attention mechanism for the final
prediction. Extensive experiments show the superior performance of our proposal
and it significantly outperforms baselines on diverse research benchmarks.
","[{'version': 'v1', 'created': 'Mon, 18 Apr 2022 03:12:13 GMT'}]",2022-04-21,"[['Li', 'Bisheng', ''], ['Zhou', 'Min', ''], ['Zhang', 'Shengzhong', ''], ['Yang', 'Menglin', ''], ['Lian', 'Defu', ''], ['Huang', 'Zengfeng', '']]","['Graph Neural Networks', 'Link Prediction', 'Semantic Feature']"
8971,1911.05012,Malte Renken,"Vincent Froese, Malte Renken",Persistent Graphs and Cyclic Polytope Triangulations,,,10.1007/s00493-020-4369-5,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove a bijection between the triangulations of the 3-dimensional cyclic
polytope C(n+2, 3) and persistent graphs with n vertices. We show that under
this bijection the Stasheff-Tamari orders on triangulations naturally translate
to subgraph inclusion between persistent graphs. Moreover, we describe a
connection to the second higher Bruhat order B(n, 2). We additionally give an
algorithm to efficiently enumerate all persistent graphs on n vertices and thus
all triangulations of C(n+2, 3).
","[{'version': 'v1', 'created': 'Tue, 12 Nov 2019 17:09:31 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Nov 2020 09:41:41 GMT'}]",2021-02-17,"[['Froese', 'Vincent', ''], ['Renken', 'Malte', '']]","['terrain visibility graphs', 'time series visibility', 'Bruhat order', 'StasheffTamari order', 'counting and enumeration']"
8972,2010.16223,Nicolas Gillis,"Valentin Leplat, Nicolas Gillis, J\'er\^ome Idier","Multiplicative Updates for NMF with $\beta$-Divergences under Disjoint
  Equality Constraints","We have corrected an error in Table 1 and in Section 2.3: the updates
  are not correct for $\beta \in (1,2)$; see the paper for more details. We
  have highlighted the changes in red color","SIAM J. on Matrix Analysis and its Applications 42 (2), 730-752,
  2021",10.1137/20M1377278,,cs.LG cs.NA eess.SP math.NA math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nonnegative matrix factorization (NMF) is the problem of approximating an
input nonnegative matrix, $V$, as the product of two smaller nonnegative
matrices, $W$ and $H$. In this paper, we introduce a general framework to
design multiplicative updates (MU) for NMF based on $\beta$-divergences
($\beta$-NMF) with disjoint equality constraints, and with penalty terms in the
objective function. By disjoint, we mean that each variable appears in at most
one equality constraint. Our MU satisfy the set of constraints after each
update of the variables during the optimization process, while guaranteeing
that the objective function decreases monotonically. We showcase this framework
on three NMF models, and show that it competes favorably the state of the art:
(1)~$\beta$-NMF with sum-to-one constraints on the columns of $H$, (2)
minimum-volume $\beta$-NMF with sum-to-one constraints on the columns of $W$,
and (3) sparse $\beta$-NMF with $\ell_2$-norm constraints on the columns of
$W$.
","[{'version': 'v1', 'created': 'Fri, 30 Oct 2020 12:31:35 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Apr 2022 08:44:54 GMT'}]",2022-04-29,"[['Leplat', 'Valentin', ''], ['Gillis', 'Nicolas', ''], ['Idier', 'Jérôme', '']]","['nonnegative matrix factorization (NMF)', 'β-divergences', 'disjoint constraints', 'simplexstructured NMF', 'minimum-volume NMF', 'sparsity']"
8973,2110.00680,Arjun Srinivasan,"Arjun Srinivasan, Nikhila Nyapathy, Bongshin Lee, Steven M. Drucker,
  John Stasko","Collecting and Characterizing Natural Language Utterances for Specifying
  Data Visualizations","Paper appeared at the 2021 ACM Conference on Conference on Human
  Factors in Computing Systems (CHI 2021), 10 pages (5 figures, 3 tables)",,10.1145/3411764.3445400,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Natural language interfaces (NLIs) for data visualization are becoming
increasingly popular both in academic research and in commercial software. Yet,
there is a lack of empirical understanding of how people specify visualizations
through natural language. To bridge this gap, we conducted an online study with
102 participants. We showed participants a series of ten visualizations for a
given dataset and asked them to provide utterances they would pose to generate
the displayed charts. The curated list of utterances generated from the study
is provided below. This corpus of utterances can be used to evaluate existing
NLIs for data visualization as well as for creating new systems and models to
generate visualizations from natural language utterances.
","[{'version': 'v1', 'created': 'Fri, 1 Oct 2021 23:18:45 GMT'}]",2021-10-05,"[['Srinivasan', 'Arjun', ''], ['Nyapathy', 'Nikhila', ''], ['Lee', 'Bongshin', ''], ['Drucker', 'Steven M.', ''], ['Stasko', 'John', '']]","['data visualization', 'natural language interfaces', 'natural languageprocessing', 'natural language corpus', 'visualization specification']"
8974,2101.01401,Mohammad AL-Mousa Dr,"Ahmad Nabot, Firas Omar, Mohammed Almousa","Perceptions of Smartphone Users Acceptance and Adoption of Mobile
  Commerce (MC) The Case of Jordan",11 pages,"Journal of Computer Science, 2020",10.3844/jcssp.2020.532.542,,cs.HC cs.CR,http://creativecommons.org/licenses/by/4.0/,"  This study investigates smartphone users perceptions of adopting and
accepting Mobile Commerce (MC) based on users perceived adoption under the
extended Technology Acceptance Model (TAM2) and Innovation Diffusion Theory
(IDT) by providing research constructs for the domain of MC. Also, testing them
with reliability and validity and demonstrating their distinctiveness with
hypothesis testing. The results show that consumer intention to adopt MC on a
smartphone was primarily influenced by Uncertainty Avoidance (UA), User
Experience (UX), Perceived Ease Of Use (PEOU), Perceived Usefulness (PU) and
Compatibility (CMP) as well as other constructs that positively determine
attitude toward using a smartphone. For researchers, this study shows the
benefits of adapting TAM constructs into MC acceptance on a smartphone. The
perceptions of MC adoption on a smartphone in this study investigated based on
a survey of specific people. For more reliability, a comprehensive study is
needed to show the attitudes of people from different environments.
","[{'version': 'v1', 'created': 'Tue, 5 Jan 2021 08:16:28 GMT'}]",2021-01-06,"[['Nabot', 'Ahmad', ''], ['Omar', 'Firas', ''], ['Almousa', 'Mohammed', '']]","['Smartphone', 'Mobile Commerce', 'Uncertainty Avoidance', 'User Experience', 'Jordan']"
8975,2207.05497,Bo Ju,"Bo Ju, Zhikang Zou, Xiaoqing Ye, Minyue Jiang, Xiao Tan, Errui Ding,
  Jingdong Wang","Paint and Distill: Boosting 3D Object Detection with Semantic Passing
  Network",Accepted by ACMMM2022,,10.1145/3503161.3547891,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  3D object detection task from lidar or camera sensors is essential for
autonomous driving. Pioneer attempts at multi-modality fusion complement the
sparse lidar point clouds with rich semantic texture information from images at
the cost of extra network designs and overhead. In this work, we propose a
novel semantic passing framework, named SPNet, to boost the performance of
existing lidar-based 3D detection models with the guidance of rich context
painting, with no extra computation cost during inference. Our key design is to
first exploit the potential instructive semantic knowledge within the
ground-truth labels by training a semantic-painted teacher model and then guide
the pure-lidar network to learn the semantic-painted representation via
knowledge passing modules at different granularities: class-wise passing,
pixel-wise passing and instance-wise passing. Experimental results show that
the proposed SPNet can seamlessly cooperate with most existing 3D detection
frameworks with 1~5% AP gain and even achieve new state-of-the-art 3D detection
performance on the KITTI test benchmark. Code is available at:
https://github.com/jb892/SPNet.
","[{'version': 'v1', 'created': 'Tue, 12 Jul 2022 12:35:34 GMT'}]",2022-07-13,"[['Ju', 'Bo', ''], ['Zou', 'Zhikang', ''], ['Ye', 'Xiaoqing', ''], ['Jiang', 'Minyue', ''], ['Tan', 'Xiao', ''], ['Ding', 'Errui', ''], ['Wang', 'Jingdong', '']]","['3D Object Detection', 'Knowledge Distillation', 'Semantic Passing']"
8976,2001.09479,Rizwan Ahmed Khan,"Shahid Munir Shah, Rizwan Ahmed Khan",Secondary Use of Electronic Health Record: Opportunities and Challenges,,IEEE Access 2020,10.1109/ACCESS.2020.3011099,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In present technological era, healthcare providers generate huge amount of
clinical data on daily basis. Generated clinical data is stored digitally in
the form of Electronic Health Records (EHR) as a central data repository of
hospitals. Data contained in EHR is not only used for the patients' primary
care but also for various secondary purposes such as clinical research,
automated disease surveillance and clinical audits for quality enhancement.
Using EHR data for secondary purposes without consent or in some cases even
with consent creates privacy issues for individuals. Secondly, EHR data is also
made accessible to various stake holders including different government
agencies at various geographical sites through wired or wireless networks.
Sharing of EHR across multiples agencies makes it vulnerable to cyber attacks
and also makes it difficult to implement strict privacy laws as in some cases
data is shared with organization that is governed by specific regional law.
Privacy of an individual could be severely affected when their sensitive
private information contained in EHR is leaked or exposed to public. Data leak
can cause financial losses or an individuals may encounter social boycott if
their medical condition is exposed in public. To protect patients personal data
from such threats, there exists different privacy regulations such as GDPR,
HIPAA and MHR. However, continually evolving state-of-the-art techniques in
machine learning, data analytics and hacking are making it even more difficult
to completely protect individual's / patient's privacy. In this article, we
have systematically examined various secondary uses of EHR with the aim to
highlight how these secondary uses effect patients' privacy. Secondly, we have
critically analyzed GDPR and highlighted possible areas of improvement,
considering escalating use of technology and different secondary uses of EHR.
","[{'version': 'v1', 'created': 'Sun, 26 Jan 2020 16:22:53 GMT'}]",2020-08-07,"[['Shah', 'Shahid Munir', ''], ['Khan', 'Rizwan Ahmed', '']]","['Electronic Health Records (EHR)', 'General Data Protection Regulation (GDPR)', 'Privacy', 'Secondaryuses of EHR', 'Ethical concerns']"
8977,cs/0501021,Jens Harting,"J. Harting, J. Chin, M. Venturoli, P.V. Coveney","Large-scale lattice Boltzmann simulations of complex fluids: advances
  through the advent of computational grids","18 pages, 9 figures, 4 movies available, accepted for publication in
  Phil. Trans. R. Soc. London Series A",Phil. Trans. R. Soc. London Series A 363 1895-1915 (2005),10.1098/rsta.2005.1618,,cs.DC cond-mat.other cond-mat.soft physics.flu-dyn,,"  During the last two years the RealityGrid project has allowed us to be one of
the few scientific groups involved in the development of computational grids.
Since smoothly working production grids are not yet available, we have been
able to substantially influence the direction of software development and grid
deployment within the project. In this paper we review our results from large
scale three-dimensional lattice Boltzmann simulations performed over the last
two years. We describe how the proactive use of computational steering and
advanced job migration and visualization techniques enabled us to do our
scientific work more efficiently. The projects reported on in this paper are
studies of complex fluid flows under shear or in porous media, as well as
large-scale parameter searches, and studies of the self-organisation of liquid
cubic mesophases.
  Movies are available at
http://www.ica1.uni-stuttgart.de/~jens/pub/05/05-PhilTransReview.html
","[{'version': 'v1', 'created': 'Tue, 11 Jan 2005 18:31:49 GMT'}]",2010-10-14,"[['Harting', 'J.', ''], ['Chin', 'J.', ''], ['Venturoli', 'M.', ''], ['Coveney', 'P. V.', '']]","['Lattice-Boltzmann', 'complex fluids', 'grid computing', 'computational steering']"
8978,2106.05863,Xuhui Meng,"Xuhui Meng, Liu Yang, Zhiping Mao, Jose del Aguila Ferrandis, George
  Em Karniadakis",Learning Functional Priors and Posteriors from Data and Physics,,,10.1016/j.jcp.2022.111073,,cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We develop a new Bayesian framework based on deep neural networks to be able
to extrapolate in space-time using historical data and to quantify
uncertainties arising from both noisy and gappy data in physical problems.
Specifically, the proposed approach has two stages: (1) prior learning and (2)
posterior estimation. At the first stage, we employ the physics-informed
Generative Adversarial Networks (PI-GAN) to learn a functional prior either
from a prescribed function distribution, e.g., Gaussian process, or from
historical data and physics. At the second stage, we employ the Hamiltonian
Monte Carlo (HMC) method to estimate the posterior in the latent space of
PI-GANs. In addition, we use two different approaches to encode the physics:
(1) automatic differentiation, used in the physics-informed neural networks
(PINNs) for scenarios with explicitly known partial differential equations
(PDEs), and (2) operator regression using the deep operator network (DeepONet)
for PDE-agnostic scenarios. We then test the proposed method for (1)
meta-learning for one-dimensional regression, and forward/inverse PDE problems
(combined with PINNs); (2) PDE-agnostic physical problems (combined with
DeepONet), e.g., fractional diffusion as well as saturated stochastic
(100-dimensional) flows in heterogeneous porous media; and (3) spatial-temporal
regression problems, i.e., inference of a marine riser displacement field. The
results demonstrate that the proposed approach can provide accurate predictions
as well as uncertainty quantification given very limited scattered and noisy
data, since historical data could be available to provide informative priors.
In summary, the proposed method is capable of learning flexible functional
priors, and can be extended to big data problems using stochastic HMC or
normalizing flows since the latent space is generally characterized as low
dimensional.
","[{'version': 'v1', 'created': 'Tue, 8 Jun 2021 03:03:24 GMT'}]",2022-03-14,"[['Meng', 'Xuhui', ''], ['Yang', 'Liu', ''], ['Mao', 'Zhiping', ''], ['Ferrandis', 'Jose del Aguila', ''], ['Karniadakis', 'George Em', '']]","['GANs', 'uncertainty quantification', 'meta-learning', 'MAML', 'physics-informed neural']"
8979,1601.03224,Leonardo Fernandez-Jambrina,"A. Canton, L. Fernandez-Jambrina, E. Rosado Maria, M.J. Vazquez-Gallo",Implicit equations of non-degenerate rational Bezier quadric triangles,"10 pages, 8th International Conference Curves and Surfaces, Paris,
  France, June 12-18, 2014","Lecture Notes in Computer Science 9213, 70-79 (2015)",10.1007/978-3-319-22804-4_6,,cs.GR math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we review the derivation of implicit equations for
non-degenerate quadric patches in rational Bezier triangular form. These are
the case of Steiner surfaces of degree two. We derive the bilinear forms for
such quadrics in a coordinate-free fashion in terms of their control net and
their list of weights in a suitable form. Our construction relies on projective
geometry and is grounded on the pencil of quadrics circumscribed to a
tetrahedron formed by vertices of the control net and an additional point which
is required for the Steiner surface to be a non-degenerate quadric.
","[{'version': 'v1', 'created': 'Wed, 13 Jan 2016 13:11:42 GMT'}]",2016-01-14,"[['Canton', 'A.', ''], ['Fernandez-Jambrina', 'L.', ''], ['Maria', 'E. Rosado', ''], ['Vazquez-Gallo', 'M. J.', '']]","['Quadric', 'Steiner surfaces', 'rational B´ezier triangles']"
8980,2005.08612,Zolt\'an Kmetty,"Zolt\'an Kmetty, Julia Koltai, Tam\'as Rudas","The presence of occupational structure in online texts based on word
  embedding NLP models","34 pages, 2 figures, 4 tables. Paper presented at IC2S2 2019 and RC28
  summer meeting 2019 (Columbia University)",,10.1140/epjds/s13688-021-00311-9,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Research on social stratification is closely linked to analysing the prestige
associated with different occupations. This research focuses on the positions
of occupations in the semantic space represented by large amounts of textual
data. The results are compared to standard results in social stratification to
see whether the classical results are reproduced and if additional insights can
be gained into the social positions of occupations. The paper gives an
affirmative answer to both questions. The results show fundamental similarity
of the occupational structure obtained from text analysis to the structure
described by prestige and social distance scales. While our research reinforces
many theories and empirical findings of the traditional body of literature on
social stratification and, in particular, occupational hierarchy, it pointed to
the importance of a factor not discussed in the main line of stratification
literature so far: the power and organizational aspect.
","[{'version': 'v1', 'created': 'Mon, 18 May 2020 11:49:35 GMT'}, {'version': 'v2', 'created': 'Mon, 17 May 2021 10:51:42 GMT'}]",2021-11-30,"[['Kmetty', 'Zoltán', ''], ['Koltai', 'Julia', ''], ['Rudas', 'Tamás', '']]","['social stratification', 'prestige', 'occupations', 'Natural Language Processing', 'word embedding', 'text mining']"
8981,2010.13714,Aitik Gupta,"Aitik Gupta, Aadit Agarwal",ActiveNet: A computer-vision based approach to determine lethargy,"Accepted at The ACM India Joint International Conference on Data
  Science and Management of Data (CoDS-COMAD) 2021",,10.1145/3430984.3430986,,cs.CV cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The outbreak of COVID-19 has forced everyone to stay indoors, fabricating a
significant drop in physical activeness. Our work is constructed upon the idea
to formulate a backbone mechanism, to detect levels of activeness in real-time,
using a single monocular image of a target person. The scope can be generalized
under many applications, be it in an interview, online classes, security
surveillance, et cetera. We propose a Computer Vision based multi-stage
approach, wherein the pose of a person is first detected, encoded with a novel
approach, and then assessed by a classical machine learning algorithm to
determine the level of activeness. An alerting system is wrapped around the
approach to provide a solution to inhibit lethargy by sending notification
alerts to individuals involved.
","[{'version': 'v1', 'created': 'Mon, 26 Oct 2020 16:54:03 GMT'}]",2020-10-27,"[['Gupta', 'Aitik', ''], ['Agarwal', 'Aadit', '']]","['Computer Vision', 'Human Pose Estimation', 'Pose Encoding']"
8982,2208.09795,Thomas Hartvigsen,"Thomas Hartvigsen, Walter Gerych, Jidapa Thadajarassiri, Xiangnan
  Kong, Elke Rundensteiner",Stop&Hop: Early Classification of Irregular Time Series,"This paper was accepted to CIKM'22. Code at
  https://github.com/thartvigsen/StopAndHop",,10.1145/3511808.3557460,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Early classification algorithms help users react faster to their machine
learning model's predictions. Early warning systems in hospitals, for example,
let clinicians improve their patients' outcomes by accurately predicting
infections. While early classification systems are advancing rapidly, a major
gap remains: existing systems do not consider irregular time series, which have
uneven and often-long gaps between their observations. Such series are
notoriously pervasive in impactful domains like healthcare. We bridge this gap
and study early classification of irregular time series, a new setting for
early classifiers that opens doors to more real-world problems. Our solution,
Stop&Hop, uses a continuous-time recurrent network to model ongoing irregular
time series in real time, while an irregularity-aware halting policy, trained
with reinforcement learning, predicts when to stop and classify the streaming
series. By taking real-valued step sizes, the halting policy flexibly decides
exactly when to stop ongoing series in real time. This way, Stop&Hop seamlessly
integrates information contained in the timing of observations, a new and vital
source for early classification in this setting, with the time series values to
provide early classifications for irregular time series. Using four synthetic
and three real-world datasets, we demonstrate that Stop&Hop consistently makes
earlier and more-accurate predictions than state-of-the-art alternatives
adapted to this new problem. Our code is publicly available at
https://github.com/thartvigsen/StopAndHop.
","[{'version': 'v1', 'created': 'Sun, 21 Aug 2022 03:41:19 GMT'}]",2022-08-23,"[['Hartvigsen', 'Thomas', ''], ['Gerych', 'Walter', ''], ['Thadajarassiri', 'Jidapa', ''], ['Kong', 'Xiangnan', ''], ['Rundensteiner', 'Elke', '']]","['Time Series', 'Irregularly-Sampled Time Series', 'Early Classification', 'Reinforcement Learning', 'Recurrent Neural Network', 'Deep Learning']"
8983,1712.01179,Thang Duong,"Thang Xuan Duong, Laura De Lorenzis, and Roger A. Sauer",A segmentation-free isogeometric extended mortar contact method,"In this version, we have removed the patch test comparison with the
  classical mortar method and removed corresponding statements. They will be
  studied in further detail in future work, so that the focus is now entirely
  on the new IGA mortar formulation",,10.1007/s00466-018-1599-0,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new isogeometric mortar contact formulation based on an
extended finite element interpolation to capture physical pressure
discontinuities at the contact boundary. The so called two-half-pass algorithm
is employed, which leads to an unbiased formulation and, when applied to the
mortar setting, has the additional advantage that the mortar coupling term is
no longer present in the contact forces. As a result, the computationally
expensive segmentation at overlapping master-slave element boundaries, usually
required in mortar methods (although often simplified with loss of accuracy),
is not needed from the outset. For the numerical integration of general contact
problems, the so-called refined boundary quadrature is employed, which is based
on adaptive partitioning of contact elements along the contact boundary. The
contact patch test shows that the proposed formulation passes the test without
using either segmentation or refined boundary quadrature. Several numerical
examples are presented to demonstrate the robustness and accuracy of the
proposed formulation.
","[{'version': 'v1', 'created': 'Mon, 4 Dec 2017 16:26:52 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Jul 2018 15:42:18 GMT'}]",2018-07-13,"[['Duong', 'Thang Xuan', ''], ['De Lorenzis', 'Laura', ''], ['Sauer', 'Roger A.', '']]","['computational contact mechanics', 'isogeometric analysis', 'mortar methods', 'segmentation', 'extended finite element methods']"
8984,2009.00997,Juan Manuel Serrano,"J. L\'opez-Gonz\'alez, Juan M. Serrano",The Optics of Language-Integrated Query,,"Science of Computer Programming, Volume 190, 2020, 102395, ISSN
  0167-6423",10.1016/j.scico.2020.102395,,cs.PL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Monadic comprehensions reign over the realm of language-integrated query
(LINQ), and for good reasons. Indeed, comprehensions are tightly integrated
with general purpose programming languages and close enough to common query
languages, such as SQL, to guarantee their translation into effective queries.
Comprehensions also support features for writing reusable and composable
queries, such as the handling of nested data and the use of functional
abstractions. In parallel to these developments, optics have emerged in recent
years as the technology of choice to write programs that manipulate complex
data structures with nested components. Optic abstractions are easily
composable and, in principle, permit both data access and updates. This paper
attempts to exploit the notion of optic for LINQ as a higher-level language
that complements comprehension-based approaches. In order to do this, we lift a
restricted subset of optics, namely getters, affine folds and folds, into a
full-blown DSL. The type system of the resulting language of optics, that we
have named Optica, distills their compositional properties, whereas its
denotational semantics is given by standard optics. This formal specification
of the concept of optic enables the definition of non-standard optic
representations beyond van Laarhoven, profunctor optics, etc. In particular,
the paper demonstrates that a restricted subset of XQuery can be understood as
an optic representation; it introduces Triplets, a non-standard semantic domain
to normalize optic expressions and facilitate the generation of SQL queries;
and it describes how to generate comprehension-based queries from optic
expressions, thus showing that both approaches can coexist.The paper also
describes S-Optica, a Scala implementation of Optica using the tagless-final
approach.
","[{'version': 'v1', 'created': 'Wed, 2 Sep 2020 12:19:53 GMT'}]",2020-09-03,"[['López-González', 'J.', ''], ['Serrano', 'Juan M.', '']]","['optics', 'language-integrated query', 'type systems', 'comprehensions', 'typed tagless-final', 'Scala']"
8985,1910.10176,Rene Haberland,Ren\'e Haberland,Review of Recent Heap Specification and Verification Techniques,"fully translated preprint (English); final journal paper 26 pages (in
  Russian)","Computer Tools in Education Journal, ISSN 2071-2359, ISSN
  2071-2340",10.32603/2071-2340-2019-2-5-30,,cs.LO cs.SC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The article provides an overview of the existing methods of dynamic memory
verification; a comparative analysis is carried out; the applicability for
solving problems of control, monitoring, and verification of dynamic memory is
evaluated. This article is divided into eight sections. The first section
introduces formal verification, followed by a section that discusses dynamic
memory management problems. The third section discusses Hoare's calculus
resumed by heap transformations to the stack. The fifth and sixth sections
introduce the concept of dynamic memory shape analysis and the rotation of
pointers. The seventh is on separation logic. The last section discusses
possible areas of further research, particularly the recognition at recording
level of various instances of objects; automation of proofs; ""hot"" code, that
is, software code that updates itself when the program runs; expanding
intuitiveness, for instance, on proof explanations.
","[{'version': 'v1', 'created': 'Tue, 22 Oct 2019 18:01:33 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Mar 2022 11:43:05 GMT'}]",2022-03-25,"[['Haberland', 'René', '']]","['dynamic memory verification', 'Hoare calculus', 'distributed memory', 'pointers arithmetics']"
8986,2201.11337,Hajar Moudoud,"Hajar Moudoud, Soumaya Cherkaoui and Lyes Khoukhi",Towards a Scalable and Trustworthy Blockchain: IoT Use Case,"This paper has been accepted for publication by ICC 2021-IEEE
  International Conference on Communications. The final version will be
  published by the IEEE",,10.1109/ICC42927.2021.9500535,,cs.CR cs.NI,http://creativecommons.org/licenses/by/4.0/,"  Recently, blockchain has gained momentum as a novel technology that gives
rise to a plethora of new decentralized applications (e.g., Internet of Things
(IoT)). However, its integration with the IoT is still facing several problems
(e.g., scalability, flexibility). Provisioning resources to enable a large
number of connected IoT devices implies having a scalable and flexible
blockchain. To address these issues, we propose a scalable and trustworthy
blockchain (STB) architecture that is suitable for the IoT; which uses
blockchain sharding and oracles to establish trust among unreliable IoT devices
in a fully distributed and trustworthy manner. In particular, we design a
Peer-To-Peer oracle network that ensures data reliability, scalability,
flexibility, and trustworthiness. Furthermore, we introduce a new lightweight
consensus algorithm that scales the blockchain dramatically while ensuring the
interoperability among participants of the blockchain. The results show that
our proposed STB architecture achieves flexibility, efficiency, and scalability
making it a promising solution that is suitable for the IoT context.
","[{'version': 'v1', 'created': 'Thu, 27 Jan 2022 06:25:17 GMT'}]",2022-01-28,"[['Moudoud', 'Hajar', ''], ['Cherkaoui', 'Soumaya', ''], ['Khoukhi', 'Lyes', '']]","['Blockchain', 'Internet of Things (IoT)', 'Oracle', 'Sharding', 'Consensus']"
8987,2207.00423,Alberto Carrasco-Casado,"Alberto Carrasco-Casado, Koichi Shiratama, Phuc V. Trinh, Dimitar
  Kolev, Femi Ishola, Tetsuharu Fuse, Hiroyuki Tsuji, Morio Toyoshima",NICT's versatile miniaturized lasercom terminals for moving platforms,"5 pages, 6 figures, 1 table","Proceedings of the 2022 IEEE International Conference on Space
  Optical Systems and Applications (ICSOS)",10.1109/ICSOS53063.2022.9749711,,cs.NI eess.SP,http://creativecommons.org/licenses/by/4.0/,"  With the goal of meeting the diverse requirements of many different types of
platforms, ranging from small drones to big satellites, and being applied in a
variety of diverse scenarios, ranging from fixed terrestrial links to moving
platforms in general, and operating within a wide range of conditions and
distances, the Japanese National Institute of Information and Communications
Technology (NICT) is currently working towards the development of a series of
versatile miniaturized free-space laser-communication terminals. By choosing
the appropriate terminal configuration for any given scenario, the basic
conditions of operations can be satisfied without the need of customization,
and the adaptive design of the terminals can close the gap to achieve an
optimum solution that meets the communication requirements. This paper presents
NICT's current efforts regarding the development of this series of lasercom
terminals and introduces the first prototypes developed for validation and test
purposes.
","[{'version': 'v1', 'created': 'Mon, 9 May 2022 06:57:02 GMT'}]",2022-07-04,"[['Carrasco-Casado', 'Alberto', ''], ['Shiratama', 'Koichi', ''], ['Trinh', 'Phuc V.', ''], ['Kolev', 'Dimitar', ''], ['Ishola', 'Femi', ''], ['Fuse', 'Tetsuharu', ''], ['Tsuji', 'Hiroyuki', ''], ['Toyoshima', 'Morio', '']]","['free-space optical communications', 'satellite communications', 'space lasercom', 'miniaturized terminals']"
8988,2007.14181,Kevin Wallis,"Kevin Wallis, Jan Stodt, Eugen Jastremskoj and Christoph Reich","Agreements between Enterprises digitized by Smart Contracts in the
  Domain of Industry 4.0","CCSEA, BIoT, DKMP, CLOUD, NLCAI, SIPRO - 2020 pp. 23-32, 2020. CS &
  IT - CSCP 2020",,10.5121/csit.2020.101003,,cs.CR cs.CY,http://creativecommons.org/licenses/by/4.0/,"  The digital transformation of companies is expected to increase the digital
interconnection between different companies to develop optimized, customized,
hybrid business models. These cross-company business models require secure,
reliable, and traceable logging and monitoring of contractually agreed
information sharing between machine tools, operators, and service providers.
This paper discusses how the major requirements for building hybrid business
models can be tackled by the blockchain for building a chain of trust and smart
contracts for digitized contracts. A machine maintenance use case is used to
discuss the readiness of smart contracts for the automation of workflows
defined in contracts. Furthermore, it is shown that the number of failures is
significantly improved by using these contracts and a blockchain.
","[{'version': 'v1', 'created': 'Tue, 28 Jul 2020 13:08:01 GMT'}]",2020-07-29,"[['Wallis', 'Kevin', ''], ['Stodt', 'Jan', ''], ['Jastremskoj', 'Eugen', ''], ['Reich', 'Christoph', '']]","['Blockchain', 'Smart Contracts', 'Industry 4.0', 'Digitized Agreements', 'Maintenance']"
8989,2004.12846,Eseoghene Ben-Iwhiwhu,"Eseoghene Ben-Iwhiwhu, Pawel Ladosz, Jeffery Dick, Wen-Hua Chen,
  Praveen Pilly, Andrea Soltoggio",Evolving Inborn Knowledge For Fast Adaptation in Dynamic POMDP Problems,"9 pages. Accepted as a full paper in the Genetic and Evolutionary
  Computation Conference (GECCO 2020)",,10.1145/3377930.3390214,,cs.NE cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rapid online adaptation to changing tasks is an important problem in machine
learning and, recently, a focus of meta-reinforcement learning. However,
reinforcement learning (RL) algorithms struggle in POMDP environments because
the state of the system, essential in a RL framework, is not always visible.
Additionally, hand-designed meta-RL architectures may not include suitable
computational structures for specific learning problems. The evolution of
online learning mechanisms, on the contrary, has the ability to incorporate
learning strategies into an agent that can (i) evolve memory when required and
(ii) optimize adaptation speed to specific online learning problems. In this
paper, we exploit the highly adaptive nature of neuromodulated neural networks
to evolve a controller that uses the latent space of an autoencoder in a POMDP.
The analysis of the evolved networks reveals the ability of the proposed
algorithm to acquire inborn knowledge in a variety of aspects such as the
detection of cues that reveal implicit rewards, and the ability to evolve
location neurons that help with navigation. The integration of inborn knowledge
and online plasticity enabled fast adaptation and better performance in
comparison to some non-evolutionary meta-reinforcement learning algorithms. The
algorithm proved also to succeed in the 3D gaming environment Malmo Minecraft.
","[{'version': 'v1', 'created': 'Mon, 27 Apr 2020 14:55:08 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Apr 2020 10:04:56 GMT'}]",2020-04-29,"[['Ben-Iwhiwhu', 'Eseoghene', ''], ['Ladosz', 'Pawel', ''], ['Dick', 'Jeffery', ''], ['Chen', 'Wen-Hua', ''], ['Pilly', 'Praveen', ''], ['Soltoggio', 'Andrea', '']]","['lifelong learning', 'adaptive agent', 'self modifying network', 'neuroevolution', 'neuromodulation', 'few-shots learning', 'Hebbian learning']"
8990,2110.09766,Jiechong Song,"Jiechong Song, Bin Chen and Jian Zhang",Memory-Augmented Deep Unfolding Network for Compressive Sensing,"10 pages, 7 figures, ACM MM 2021",,10.1145/3474085.3475562,,cs.CV eess.IV,http://creativecommons.org/licenses/by/4.0/,"  Mapping a truncated optimization method into a deep neural network, deep
unfolding network (DUN) has attracted growing attention in compressive sensing
(CS) due to its good interpretability and high performance. Each stage in DUNs
corresponds to one iteration in optimization. By understanding DUNs from the
perspective of the human brain's memory processing, we find there exists two
issues in existing DUNs. One is the information between every two adjacent
stages, which can be regarded as short-term memory, is usually lost seriously.
The other is no explicit mechanism to ensure that the previous stages affect
the current stage, which means memory is easily forgotten. To solve these
issues, in this paper, a novel DUN with persistent memory for CS is proposed,
dubbed Memory-Augmented Deep Unfolding Network (MADUN). We design a
memory-augmented proximal mapping module (MAPMM) by combining two types of
memory augmentation mechanisms, namely High-throughput Short-term Memory (HSM)
and Cross-stage Long-term Memory (CLM). HSM is exploited to allow DUNs to
transmit multi-channel short-term memory, which greatly reduces information
loss between adjacent stages. CLM is utilized to develop the dependency of deep
information across cascading stages, which greatly enhances network
representation capability. Extensive CS experiments on natural and MR images
show that with the strong ability to maintain and balance information our MADUN
outperforms existing state-of-the-art methods by a large margin. The source
code is available at https://github.com/jianzhangcs/MADUN/.
","[{'version': 'v1', 'created': 'Tue, 19 Oct 2021 07:03:12 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Oct 2021 01:33:55 GMT'}]",2021-10-26,"[['Song', 'Jiechong', ''], ['Chen', 'Bin', ''], ['Zhang', 'Jian', '']]","['compressive sensing', 'deep unfolding network', 'memory mechanisms', 'information augmentation']"
8991,2008.09416,Alexander Neergaard Olesen,"Alexander Neergaard Olesen, Poul Jennum, Emmanuel Mignot, Helge B D
  Sorensen","Automatic sleep stage classification with deep residual networks in a
  mixed-cohort setting","Author's original version. This article has been accepted for
  publication in SLEEP published by Oxford University Press",,10.1093/sleep/zsaa161,,cs.CV eess.SP stat.AP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Study Objectives: Sleep stage scoring is performed manually by sleep experts
and is prone to subjective interpretation of scoring rules with low intra- and
interscorer reliability. Many automatic systems rely on few small-scale
databases for developing models, and generalizability to new datasets is thus
unknown. We investigated a novel deep neural network to assess the
generalizability of several large-scale cohorts.
  Methods: A deep neural network model was developed using 15684
polysomnography studies from five different cohorts. We applied four different
scenarios: 1) impact of varying time-scales in the model; 2) performance of a
single cohort on other cohorts of smaller, greater or equal size relative to
the performance of other cohorts on a single cohort; 3) varying the fraction of
mixed-cohort training data compared to using single-origin data; and 4)
comparing models trained on combinations of data from 2, 3, and 4 cohorts.
  Results: Overall classification accuracy improved with increasing fractions
of training data (0.25$\%$: 0.782 $\pm$ 0.097, 95$\%$ CI [0.777-0.787];
100$\%$: 0.869 $\pm$ 0.064, 95$\%$ CI [0.864-0.872]), and with increasing
number of data sources (2: 0.788 $\pm$ 0.102, 95$\%$ CI [0.787-0.790]; 3: 0.808
$\pm$ 0.092, 95$\%$ CI [0.807-0.810]; 4: 0.821 $\pm$ 0.085, 95$\%$ CI
[0.819-0.823]). Different cohorts show varying levels of generalization to
other cohorts.
  Conclusions: Automatic sleep stage scoring systems based on deep learning
algorithms should consider as much data as possible from as many sources
available to ensure proper generalization. Public datasets for benchmarking
should be made available for future research.
","[{'version': 'v1', 'created': 'Fri, 21 Aug 2020 10:48:35 GMT'}]",2020-08-24,"[['Olesen', 'Alexander Neergaard', ''], ['Jennum', 'Poul', ''], ['Mignot', 'Emmanuel', ''], ['Sorensen', 'Helge B D', '']]","['Automatic sleep stage classification', 'computational sleep science', 'machine learning', 'deep learning']"
8992,2111.07761,Franka Bause,"Franka Bause, Erich Schubert, Nils M. Kriege","EmbAssi: Embedding Assignment Costs for Similarity Search in Large Graph
  Databases",Data Min Knowl Disc (2022),,10.1007/s10618-022-00850-3,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The graph edit distance is an intuitive measure to quantify the dissimilarity
of graphs, but its computation is NP-hard and challenging in practice. We
introduce methods for answering nearest neighbor and range queries regarding
this distance efficiently for large databases with up to millions of graphs. We
build on the filter-verification paradigm, where lower and upper bounds are
used to reduce the number of exact computations of the graph edit distance.
Highly effective bounds for this involve solving a linear assignment problem
for each graph in the database, which is prohibitive in massive datasets.
Index-based approaches typically provide only weak bounds leading to high
computational costs verification. In this work, we derive novel lower bounds
for efficient filtering from restricted assignment problems, where the cost
function is a tree metric. This special case allows embedding the costs of
optimal assignments isometrically into $\ell_1$ space, rendering efficient
indexing possible. We propose several lower bounds of the graph edit distance
obtained from tree metrics reflecting the edit costs, which are combined for
effective filtering. Our method termed EmbAssi can be integrated into existing
filter-verification pipelines as a fast and effective pre-filtering step.
Empirically we show that for many real-world graphs our lower bounds are
already close to the exact graph edit distance, while our index construction
and search scales to very large databases.
","[{'version': 'v1', 'created': 'Mon, 15 Nov 2021 14:03:15 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Apr 2022 07:35:56 GMT'}, {'version': 'v3', 'created': 'Tue, 19 Jul 2022 08:34:20 GMT'}]",2022-07-20,"[['Bause', 'Franka', ''], ['Schubert', 'Erich', ''], ['Kriege', 'Nils M.', '']]","['graph edit distance', 'similarity search', 'index']"
8993,2204.03770,Jazlyn Hellman,"Jazlyn Hellman, Jiahao Chen, Md. Sami Uddin, Jinghui Cheng, Jin L.C.
  Guo","Characterizing User Behaviors in Open-Source Software User Forums: An
  Empirical Study","15th International Conference on Cooperative and Human Aspects of
  Softare Engineering",,10.1145/3528579.3529178,,cs.SE cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  User forums of Open Source Software (OSS) enable end-users to collaboratively
discuss problems concerning the OSS applications. Despite decades of research
on OSS, we know very little about how end-users engage with OSS communities on
these forums, in particular, the challenges that hinder their continuous and
meaningful participation in the OSS community. Many previous works are
developer-centric and overlook the importance of end-user forums. As a result,
end-users' expectations are seldom reflected in OSS development. To better
understand user behaviors in OSS user forums, we carried out an empirical study
analyzing about 1.3 million posts from user forums of four popular OSS
applications: Zotero, Audacity, VLC, and RStudio. Through analyzing the
contribution patterns of three common user types (end-users, developers, and
organizers), we observed that end-users not only initiated most of the threads
(above 96% of threads in three projects, 86% in the other), but also acted as
the significant contributors for responding to other users' posts, even though
they tended to lack confidence in their activities as indicated by
psycho-linguistic analyses. Moreover, we found end-users more open, reflecting
a more positive emotion in communication than organizers and developers in the
forums. Our work contributes new knowledge about end-users' activities and
behaviors in OSS user forums that the vital OSS stakeholders can leverage to
improve end-user engagement in the OSS development process.
","[{'version': 'v1', 'created': 'Thu, 7 Apr 2022 22:56:18 GMT'}]",2022-04-11,"[['Hellman', 'Jazlyn', ''], ['Chen', 'Jiahao', ''], ['Uddin', 'Md. Sami', ''], ['Cheng', 'Jinghui', ''], ['Guo', 'Jin L. C.', '']]","['Open-source software', 'user forums', 'linguistic analysis']"
8994,2106.07927,Boitumelo Ruf,"Boitumelo Ruf, Jonas Mohrs, Martin Weinmann, Stefan Hinz, J\""urgen
  Beyerer","ReS2tAC -- UAV-Borne Real-Time SGM Stereo Optimized for Embedded ARM and
  CUDA Devices",,"Sensors 2021, 21, 3938",10.3390/s21113938,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  With the emergence of low-cost robotic systems, such as unmanned aerial
vehicle, the importance of embedded high-performance image processing has
increased. For a long time, FPGAs were the only processing hardware that were
capable of high-performance computing, while at the same time preserving a low
power consumption, essential for embedded systems. However, the recently
increasing availability of embedded GPU-based systems, such as the NVIDIA
Jetson series, comprised of an ARM CPU and a NVIDIA Tegra GPU, allows for
massively parallel embedded computing on graphics hardware. With this in mind,
we propose an approach for real-time embedded stereo processing on ARM and
CUDA-enabled devices, which is based on the popular and widely used Semi-Global
Matching algorithm. In this, we propose an optimization of the algorithm for
embedded CUDA GPUs, by using massively parallel computing, as well as using the
NEON intrinsics to optimize the algorithm for vectorized SIMD processing on
embedded ARM CPUs. We have evaluated our approach with different configurations
on two public stereo benchmark datasets to demonstrate that they can reach an
error rate as low as 3.3%. Furthermore, our experiments show that the fastest
configuration of our approach reaches up to 46 FPS on VGA image resolution.
Finally, in a use-case specific qualitative evaluation, we have evaluated the
power consumption of our approach and deployed it on the DJI Manifold 2-G
attached to a DJI Matrix 210v2 RTK unmanned aerial vehicle (UAV), demonstrating
its suitability for real-time stereo processing onboard a UAV.
","[{'version': 'v1', 'created': 'Tue, 15 Jun 2021 07:29:25 GMT'}]",2021-06-16,"[['Ruf', 'Boitumelo', ''], ['Mohrs', 'Jonas', ''], ['Weinmann', 'Martin', ''], ['Hinz', 'Stefan', ''], ['Beyerer', 'Jürgen', '']]","['embedded stereo vision', 'real-time stereo processing', 'disparity estimation', 'semi-globalmatching', 'GPGPU', 'SIMD', 'UAV']"
8995,2006.06307,"Jarkko Peltom\""aki","Jarkko Peltom\""aki and Markus A. Whiteland",Avoiding abelian powers cyclically,"18 pages, 1 figure","Advances in Applied Mathematics, Vol. 121, 102095:1-22 (2020)",10.1016/j.aam.2020.102095,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study a new notion of cyclic avoidance of abelian powers. A finite word
$w$ avoids abelian $N$-powers cyclically if for each abelian $N$-power of
period $m$ occurring in the infinite word $w^\omega$, we have $m \geq |w|$. Let
$\mathcal{A}(k)$ be the least integer $N$ such that for all $n$ there exists a
word of length $n$ over a $k$-letter alphabet that avoids abelian $N$-powers
cyclically. Let $\mathcal{A}_\infty(k)$ be the least integer $N$ such that
there exist arbitrarily long words over a $k$-letter alphabet that avoid
abelian $N$-powers cyclically.
  We prove that $5 \leq \mathcal{A}(2) \leq 8$, $3 \leq \mathcal{A}(3) \leq 4$,
$2 \leq \mathcal{A}(4) \leq 3$, and $\mathcal{A}(k) = 2$ for $k \geq 5$.
Moreover, we show that $\mathcal{A}_\infty(2) = 4$, $\mathcal{A}_\infty(3) =
3$, and $\mathcal{A}_\infty(4) = 2$.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2020 10:15:09 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jul 2020 18:46:36 GMT'}]",2020-11-04,"[['Peltomäki', 'Jarkko', ''], ['Whiteland', 'Markus A.', '']]","['abelian equivalence', 'abelian power', 'abelian power avoidance', 'cyclic abelian power avoidance', 'circular word']"
8996,1410.8616,Abhijit Chandra,Abhijit Chandra and Oliva Kar,"Data Driven Prognosis: A multi-physics approach verified via balloon
  burst experiment",,,10.1098/rspa.2014.0525,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A multi-physics formulation for Data Driven Prognosis (DDP) is developed.
Unlike traditional predictive strategies that require controlled off-line
measurements or training for determination of constitutive parameters to derive
the transitional statistics, the proposed DDP algorithm relies solely on in
situ measurements. It utilizes a deterministic mechanics framework, but the
stochastic nature of the solution arises naturally from the underlying
assumptions regarding the order of the conservation potential as well as the
number of dimensions involved. The proposed DDP scheme is capable of predicting
onset of instabilities. Since the need for off-line testing (or training) is
obviated, it can be easily implemented for systems where such a priori testing
is difficult or even impossible to conduct. The prognosis capability is
demonstrated here via a balloon burst experiment where the instability is
predicted utilizing only on-line visual observations. The DDP scheme never
failed to predict the incipient failure, and no false positives were issued.
The DDP algorithm is applicable to others types of datasets. Time horizons of
DDP predictions can be adjusted by using memory over different time windows.
Thus, a big dataset can be parsed in time to make a range of predictions over
varying time horizons.
","[{'version': 'v1', 'created': 'Fri, 31 Oct 2014 02:05:09 GMT'}]",2015-08-19,"[['Chandra', 'Abhijit', ''], ['Kar', 'Oliva', '']]","['data driven', 'prognosis', 'multi-scale', 'multi-physics', 'instability']"
8997,1905.06480,Rafael S. Gon\c{c}alves,"Rafael S. Gon\c{c}alves, Martin J. O'Connor, Marcos Mart\'inez-Romero,
  Attila L. Egyedi, Debra Willrett, John Graybeal and Mark A. Musen","The CEDAR Workbench: An Ontology-Assisted Environment for Authoring
  Metadata that Describe Scientific Experiments",,,10.1007/978-3-319-68204-4_10,,cs.DB cs.DL,http://creativecommons.org/licenses/by/4.0/,"  The Center for Expanded Data Annotation and Retrieval (CEDAR) aims to
revolutionize the way that metadata describing scientific experiments are
authored. The software we have developed--the CEDAR Workbench--is a suite of
Web-based tools and REST APIs that allows users to construct metadata
templates, to fill in templates to generate high-quality metadata, and to share
and manage these resources. The CEDAR Workbench provides a versatile,
REST-based environment for authoring metadata that are enriched with terms from
ontologies. The metadata are available as JSON, JSON-LD, or RDF for easy
integration in scientific applications and reusability on the Web. Users can
leverage our APIs for validating and submitting metadata to external
repositories. The CEDAR Workbench is freely available and open-source.
","[{'version': 'v1', 'created': 'Thu, 16 May 2019 00:19:49 GMT'}]",2019-05-17,"[['Gonçalves', 'Rafael S.', ''], [""O'Connor"", 'Martin J.', ''], ['Martínez-Romero', 'Marcos', ''], ['Egyedi', 'Attila L.', ''], ['Willrett', 'Debra', ''], ['Graybeal', 'John', ''], ['Musen', 'Mark A.', '']]","['Metadata', 'metadata authoring', 'metadata repository', 'ontologies']"
8998,2112.11406,Math\'e Zeegers,"Math\'e T. Zeegers, Ajinkya Kadu, Tristan van Leeuwen, Kees Joost
  Batenburg","ADJUST: A Dictionary-Based Joint Reconstruction and Unmixing Method for
  Spectral Tomography","This paper is under consideration at Inverse Problems with minor
  revisions. 33 pages, 24 figures",Inverse Problems 38 12 (2022) 125002,10.1088/1361-6420/ac932e,,cs.CV cs.CE cs.NA math.NA math.OC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Advances in multi-spectral detectors are causing a paradigm shift in X-ray
Computed Tomography (CT). Spectral information acquired from these detectors
can be used to extract volumetric material composition maps of the object of
interest. If the materials and their spectral responses are known a priori, the
image reconstruction step is rather straightforward. If they are not known,
however, the maps as well as the responses need to be estimated jointly. A
conventional workflow in spectral CT involves performing volume reconstruction
followed by material decomposition, or vice versa. However, these methods
inherently suffer from the ill-posedness of the joint reconstruction problem.
To resolve this issue, we propose 'A Dictionary-based Joint reconstruction and
Unmixing method for Spectral Tomography' (ADJUST). Our formulation relies on
forming a dictionary of spectral signatures of materials common in CT and prior
knowledge of the number of materials present in an object. In particular, we
decompose the spectral volume linearly in terms of spatial material maps, a
spectral dictionary, and the indicator of materials for the dictionary
elements. We propose a memory-efficient accelerated alternating proximal
gradient method to find an approximate solution to the resulting bi-convex
problem. From numerical demonstrations on several synthetic phantoms, we
observe that ADJUST performs exceedingly well compared to other
state-of-the-art methods. Additionally, we address the robustness of ADJUST
against limited and noisy measurement patterns. The demonstration of the
proposed approach on a spectral micro-CT dataset shows its potential for
real-world applications. Code is available at
https://github.com/mzeegers/ADJUST.
","[{'version': 'v1', 'created': 'Tue, 21 Dec 2021 18:09:39 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Oct 2022 14:38:49 GMT'}]",2022-10-24,"[['Zeegers', 'Mathé T.', ''], ['Kadu', 'Ajinkya', ''], ['van Leeuwen', 'Tristan', ''], ['Batenburg', 'Kees Joost', '']]","['Spectral Tomography', 'Material Decomposition', 'Computational Imaging', 'Advanced Regularization', 'Optimization']"
8999,1811.06832,David Orden,"David Orden, Ivan Marsa-Maestre, Jose Manuel Gimenez-Guzman, Enrique
  de la Hoz, and Ana \'Alvarez-Su\'arez","Spectrum graph coloring to improve Wi-Fi channel assignment in a
  real-world scenario via edge contraction","18 pages, 10 figures, 1 table","Discrete Applied Mathematics 263 (2019), 234-243",10.1016/j.dam.2018.12.009,,cs.DM cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The present work deals with the problem of efficiently assigning Wi-Fi
channels in a real-world scenario, the Polytechnic School of the University of
Alcal\'a. We first use proximity graphs to model the whole problem as an
instance of spectrum graph coloring, we further obtain a simplified model using
edge contraction, and we finally use simulated annealing to look for a coloring
which optimizes the network throughput. As the main result, we show that the
solutions we obtain outperform the de facto standard for Wi-Fi channel
assignment, both in terms of network throughput and of computation time.
","[{'version': 'v1', 'created': 'Fri, 16 Nov 2018 15:01:38 GMT'}]",2020-07-20,"[['Orden', 'David', ''], ['Marsa-Maestre', 'Ivan', ''], ['Gimenez-Guzman', 'Jose Manuel', ''], ['de la Hoz', 'Enrique', ''], ['Álvarez-Suárez', 'Ana', '']]","['Graph coloring', 'Edge contraction', 'Frequency assignment', 'Wi-Fi channels', 'Spectrum coloring', 'Simulated annealing']"
9000,2112.08073,Mitsuo Yoshida,"Kyosuke Shimada, Kazuhiro Kazama, Mitsuo Yoshida, Ikki Ohmukai, Sho
  Sato","Analysis of Leading Communities Contributing to arXiv Information
  Distribution on Twitter","The 20th IEEE/WIC/ACM International Joint Conference on Web
  Intelligence and Intelligent Agent Technology (WI-IAT '21)",,10.1145/3486622.3493947,,cs.DL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To analyze the impact that arXiv is having on the world, in this paper we
propose an arXiv information distribution model on Twitter, which has a
three-layer structure: arXiv papers, information spreaders, and information
collectors. First, we use the HITS algorithm to analyze the arXiv information
diffusion network with users as nodes, which is created from three types of
behavior on Twitter regarding arXiv papers: tweeting, retweeting, and liking.
Next, we extract communities from the network of information spreaders with
positive authority and hub degrees using the Louvain method, and analyze the
relationship and roles of information spreaders in communities using research
field, linguistic, and temporal characteristics. From our analysis using the
tweet and arXiv datasets, we found that information about arXiv papers
circulates on Twitter from information spreaders to information collectors, and
that multiple communities of information spreaders are formed according to
their research fields. It was also found that different communities were formed
in the same research field, depending on the research or cultural background of
the information spreaders. We were able to identify two types of key persons:
information spreaders who lead the relevant field in the international
community and information spreaders who bridge the regional and international
communities using English and their native language. In addition, we found that
it takes some time to gain trust as an information spreader.
","[{'version': 'v1', 'created': 'Wed, 15 Dec 2021 12:28:29 GMT'}]",2022-04-15,"[['Shimada', 'Kyosuke', ''], ['Kazama', 'Kazuhiro', ''], ['Yoshida', 'Mitsuo', ''], ['Ohmukai', 'Ikki', ''], ['Sato', 'Sho', '']]","['Twitter', 'arXiv', 'academic information distribution', 'HITS algorithm', 'betweenness centrality']"
9001,2108.06500,Jakob Schoeffer,Jakob Schoeffer and Niklas Kuehl,"Appropriate Fairness Perceptions? On the Effectiveness of Explanations
  in Enabling People to Assess the Fairness of Automated Decision Systems","Companion Publication of the 2021 Conference on Computer Supported
  Cooperative Work and Social Computing (CSCW '21 Companion), October 23--27,
  2021, Virtual Event, USA",,10.1145/3462204.3481742,,cs.HC cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  It is often argued that one goal of explaining automated decision systems
(ADS) is to facilitate positive perceptions (e.g., fairness or trustworthiness)
of users towards such systems. This viewpoint, however, makes the implicit
assumption that a given ADS is fair and trustworthy, to begin with. If the ADS
issues unfair outcomes, then one might expect that explanations regarding the
system's workings will reveal its shortcomings and, hence, lead to a decrease
in fairness perceptions. Consequently, we suggest that it is more meaningful to
evaluate explanations against their effectiveness in enabling people to
appropriately assess the quality (e.g., fairness) of an associated ADS. We
argue that for an effective explanation, perceptions of fairness should
increase if and only if the underlying ADS is fair. In this in-progress work,
we introduce the desideratum of appropriate fairness perceptions, propose a
novel study design for evaluating it, and outline next steps towards a
comprehensive experiment.
","[{'version': 'v1', 'created': 'Sat, 14 Aug 2021 09:39:59 GMT'}]",2021-08-17,"[['Schoeffer', 'Jakob', ''], ['Kuehl', 'Niklas', '']]","['Automated decision-making', 'fairness', 'explanations', 'perceptions ofalgorithmic decisions', 'study design']"
9002,2110.10679,Damjan Vavpoti\v{c},"Damjan Vavpoti\v{c}, Karmen Knavs and Ljubica Kne\v{z}evi\'c Cvelbar",Using a market basket analysis in tourism studies,"36 pages, 8 figures","Vavpoti\v{c} D, Knavs K, Kne\v{z}evi\'c Cvelbar L, Using a market
  basket analysis in tourism studies, Tourism Economics (First Published July
  30, 2020), \c{opyright} 2020 (SAGE Publications)",10.1177/1354816620944264.,,cs.SI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Understanding tourist visitation patterns is crucial for decision makers in
order to create smart tourism industry. A growing body of tourism research uses
geo-location data in order to better understand tourism demand. In this paper,
we present a new approach based on a market basket analysis. This approach uses
geo-location data shared by tourists on tourism platforms in order to bundle
the range of available tourism services and understand which experiences are
consumed together. The approach was tested on the case of Vienna, Austria.
Based on our analyses we argue that the proposed approach has potential for use
at the destination level and provides relevant information on tourism demand
patterns important for smart tourism decision-making.
","[{'version': 'v1', 'created': 'Wed, 20 Oct 2021 17:45:32 GMT'}]",2021-10-22,"[['Vavpotič', 'Damjan', ''], ['Knavs', 'Karmen', ''], ['Cvelbar', 'Ljubica Knežević', '']]","['market basket analysis', 'destination management', 'web-generated data', 'tourists']"
9003,2002.05988,Ana Sofia Gomes,"Bernardo Branco, Pedro Abreu, Ana Sofia Gomes, Mariana S. C. Almeida,
  Jo\~ao Tiago Ascens\~ao, Pedro Bizarro",Interleaved Sequence RNNs for Fraud Detection,"9 pages, 4 figures, to appear in SIGKDD'20 Industry Track",,10.1145/3394486.3403361,,cs.LG cs.CR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Payment card fraud causes multibillion dollar losses for banks and merchants
worldwide, often fueling complex criminal activities. To address this, many
real-time fraud detection systems use tree-based models, demanding complex
feature engineering systems to efficiently enrich transactions with historical
data while complying with millisecond-level latencies.
  In this work, we do not require those expensive features by using recurrent
neural networks and treating payments as an interleaved sequence, where the
history of each card is an unbounded, irregular sub-sequence. We present a
complete RNN framework to detect fraud in real-time, proposing an efficient ML
pipeline from preprocessing to deployment.
  We show that these feature-free, multi-sequence RNNs outperform
state-of-the-art models saving millions of dollars in fraud detection and using
fewer computational resources.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 12:04:11 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Jun 2020 16:59:41 GMT'}]",2020-06-18,"[['Branco', 'Bernardo', ''], ['Abreu', 'Pedro', ''], ['Gomes', 'Ana Sofia', ''], ['Almeida', 'Mariana S. C.', ''], ['Ascensão', 'João Tiago', ''], ['Bizarro', 'Pedro', '']]","['recurrent neural networks', 'real-time prediction', 'financial systems']"
9004,1803.09952,Aris Pagourtzis,Nikolaos Melissinos and Aris Pagourtzis,A Faster FPTAS for the Subset-Sums Ratio Problem,,,10.1007/978-3-319-94776-1_50,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Subset-Sums Ratio problem (SSR) is an optimization problem in which,
given a set of integers, the goal is to find two subsets such that the ratio of
their sums is as close to 1 as possible. In this paper we develop a new FPTAS
for the SSR problem which builds on techniques proposed in [D. Nanongkai,
Simple FPTAS for the subset-sums ratio problem, Inf. Proc. Lett. 113 (2013)].
One of the key improvements of our scheme is the use of a dynamic programming
table in which one dimension represents the difference of the sums of the two
subsets. This idea, together with a careful choice of a scaling parameter,
yields an FPTAS that is several orders of magnitude faster than the best
currently known scheme of [C. Bazgan, M. Santha, Z. Tuza, Efficient
approximation algorithms for the Subset-Sums Equality problem, J. Comp. System
Sci. 64 (2) (2002)].
","[{'version': 'v1', 'created': 'Tue, 27 Mar 2018 08:24:48 GMT'}]",2019-12-20,"[['Melissinos', 'Nikolaos', ''], ['Pagourtzis', 'Aris', '']]","['approximation scheme', 'subset-sums ratio', 'knapsack problems', 'combinatorial optimization']"
9005,1909.00885,Khen Elimelech,Khen Elimelech and Vadim Indelman,"Simplified decision making in the belief space using belief
  sparsification","This is a preprint of an article published in the International
  Journal of Robotics Research (IJRR) [originally submitted December 2018,
  officially published June 2022]. For citation, please use the official
  journal version",,10.1177/02783649221076381,,cs.AI cs.CC cs.IT cs.RO cs.SY eess.SY math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we introduce a new and efficient solution approach for the
problem of decision making under uncertainty, which can be formulated as
decision making in a belief space, over a possibly high-dimensional state
space. Typically, to solve a decision problem, one should identify the optimal
action from a set of candidates, according to some objective. We claim that one
can often generate and solve an analogous yet simplified decision problem,
which can be solved more efficiently. A wise simplification method can lead to
the same action selection, or one for which the maximal loss in optimality can
be guaranteed. Furthermore, such simplification is separated from the state
inference and does not compromise its accuracy, as the selected action would
finally be applied on the original state. First, we present the concept for
general decision problems and provide a theoretical framework for a coherent
formulation of the approach. We then practically apply these ideas to decision
problems in the belief space, which can be simplified by considering a sparse
approximation of their initial belief. The scalable belief sparsification
algorithm we provide is able to yield solutions which are guaranteed to be
consistent with the original problem. We demonstrate the benefits of the
approach in the solution of a realistic active-SLAM problem and manage to
significantly reduce computation time, with no loss in the quality of solution.
This work is both fundamental and practical, and holds numerous possible
extensions.
","[{'version': 'v1', 'created': 'Mon, 2 Sep 2019 23:00:59 GMT'}, {'version': 'v2', 'created': 'Sun, 22 Sep 2019 07:30:30 GMT'}, {'version': 'v3', 'created': 'Thu, 21 Jan 2021 19:01:30 GMT'}, {'version': 'v4', 'created': 'Mon, 20 Dec 2021 03:36:38 GMT'}, {'version': 'v5', 'created': 'Mon, 20 Jun 2022 22:33:17 GMT'}]",2022-06-22,"[['Elimelech', 'Khen', ''], ['Indelman', 'Vadim', '']]","['Decision making under uncertainty', 'belief space planning', 'POMDP', 'sparse systems', 'sparsification', 'active SLAM']"
9006,2112.01958,Carlos Guerrero,"Carlos Guerrero, Isaac Lera and Carlos Juiz","Genetic-based optimization in Fog Computing: current trends and research
  opportunities",,"Swarm and Evolutionary Computation, 2022, 101094, ISSN 2210-6502",10.1016/j.swevo.2022.101094,,cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Fog computing is a new computational paradigm that emerged from the need to
reduce network usage and latency in the Internet of Things (IoT). Fog can be
considered as a continuum between the cloud layer and IoT users that allows the
execution of applications or storage/processing of data in network
infrastructure devices. The heterogeneity and wider distribution of fog devices
are the key differences between cloud and fog infrastructure. Genetic-based
optimization is commonly used in distributed systems; however, the
differentiating features of fog computing require new designs, studies, and
experimentation. The growing research in the field of genetic-based fog
resource optimization and the lack of previous analysis in this field have
encouraged us to present a comprehensive, exhaustive, and systematic review of
the most recent research works. Resource optimization techniques in fog were
examined and analyzed, with special emphasis on genetic-based solutions and
their characteristics and design alternatives. We defined a classification of
the optimization scope in fog infrastructures and used this optimization
taxonomy to classify the 70 papers in this survey. Subsequently, the papers
were assessed in terms of genetic optimization design. Finally, the benefits
and limitations of each surveyed work are outlined in this paper. Based on
these previous analyses of the relevant literature, future research directions
were identified. We concluded that more research efforts are needed to address
the current challenges in data management, workflow scheduling, and service
placement. Additionally, there is still room for improved designs and
deployments of parallel and hybrid genetic algorithms that leverage, and adapt
to, the heterogeneity and distributed features of fog domains.
","[{'version': 'v1', 'created': 'Fri, 3 Dec 2021 15:03:14 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Jan 2022 10:40:30 GMT'}, {'version': 'v3', 'created': 'Fri, 13 May 2022 08:09:50 GMT'}]",2022-05-16,"[['Guerrero', 'Carlos', ''], ['Lera', 'Isaac', ''], ['Juiz', 'Carlos', '']]","['Fog computing', 'Resource management', 'Optimization', 'Genetic algorithms']"
9007,1604.05027,"Line K\""uhnel","Line K\""uhnel, Stefan Sommer, Akshay Pai and Lars Lau Raket","Most Likely Separation of Intensity and Warping Effects in Image
  Registration",,,10.1137/16M1070980,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a class of mixed-effects models for joint modeling of
spatially correlated intensity variation and warping variation in 2D images.
Spatially correlated intensity variation and warp variation are modeled as
random effects, resulting in a nonlinear mixed-effects model that enables
simultaneous estimation of template and model parameters by optimization of the
likelihood function. We propose an algorithm for fitting the model which
alternates estimation of variance parameters and image registration. This
approach avoids the potential estimation bias in the template estimate that
arises when treating registration as a preprocessing step. We apply the model
to datasets of facial images and 2D brain magnetic resonance images to
illustrate the simultaneous estimation and prediction of intensity and warp
effects.
","[{'version': 'v1', 'created': 'Mon, 18 Apr 2016 08:15:27 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Mar 2017 10:54:43 GMT'}]",2023-01-23,"[['Kühnel', 'Line', ''], ['Sommer', 'Stefan', ''], ['Pai', 'Akshay', ''], ['Raket', 'Lars Lau', '']]","['template estimation', 'image registration', 'separation of phase and intensity variation', 'nonlinear mixed-effects model']"
9008,2212.09017,Shuai Wang,"Shuai Wang, Harrisen Scells, Bevan Koopman, Guido Zuccon","Neural Rankers for Effective Screening Prioritisation in Medical
  Systematic Review Literature Search",,,10.1145/3572960.3572980,,cs.IR cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Medical systematic reviews typically require assessing all the documents
retrieved by a search. The reason is two-fold: the task aims for ``total
recall''; and documents retrieved using Boolean search are an unordered set,
and thus it is unclear how an assessor could examine only a subset. Screening
prioritisation is the process of ranking the (unordered) set of retrieved
documents, allowing assessors to begin the downstream processes of the
systematic review creation earlier, leading to earlier completion of the
review, or even avoiding screening documents ranked least relevant.
  Screening prioritisation requires highly effective ranking methods.
Pre-trained language models are state-of-the-art on many IR tasks but have yet
to be applied to systematic review screening prioritisation. In this paper, we
apply several pre-trained language models to the systematic review document
ranking task, both directly and fine-tuned. An empirical analysis compares how
effective neural methods compare to traditional methods for this task. We also
investigate different types of document representations for neural methods and
their impact on ranking performance.
  Our results show that BERT-based rankers outperform the current
state-of-the-art screening prioritisation methods. However, BERT rankers and
existing methods can actually be complementary, and thus, further improvements
may be achieved if used in conjunction.
","[{'version': 'v1', 'created': 'Sun, 18 Dec 2022 05:26:40 GMT'}]",2022-12-20,"[['Wang', 'Shuai', ''], ['Scells', 'Harrisen', ''], ['Koopman', 'Bevan', ''], ['Zuccon', 'Guido', '']]","['Systematic Reviews', 'Neural Ranker', 'Screening Prioritisation']"
9009,2101.01418,Petros Spachos,"Lili Zhu, Petros Spachos",Support Vector Machine and YOLO for a Mobile Food Grading System,,,10.1016/j.iot.2021.100359,,cs.CV cs.AI cs.LG cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  Food quality and safety are of great concern to society since it is an
essential guarantee not only for human health but also for social development,
and stability. Ensuring food quality and safety is a complex process. All food
processing stages should be considered, from cultivating, harvesting and
storage to preparation and consumption. Grading is one of the essential
processes to control food quality. This paper proposed a mobile visual-based
system to evaluate food grading. Specifically, the proposed system acquires
images of bananas when they are on moving conveyors. A two-layer image
processing system based on machine learning is used to grade bananas, and these
two layers are allocated on edge devices and cloud servers, respectively.
Support Vector Machine (SVM) is the first layer to classify bananas based on an
extracted feature vector composed of color and texture features. Then, the a
You Only Look Once (YOLO) v3 model further locating the peel's defected area
and determining if the inputs belong to the mid-ripened or well-ripened class.
According to experimental results, the first layer's performance achieved an
accuracy of 98.5% while the accuracy of the second layer is 85.7%, and the
overall accuracy is 96.4%.
","[{'version': 'v1', 'created': 'Tue, 5 Jan 2021 09:01:06 GMT'}]",2021-01-29,"[['Zhu', 'Lili', ''], ['Spachos', 'Petros', '']]","['Machine Vision', 'Image Processing', 'Food Processing', 'Machine Learning', 'Support Vector Machine']"
9010,2101.06871,Pranav Rajpurkar,"Alexander Ke, William Ellsworth, Oishi Banerjee, Andrew Y. Ng, Pranav
  Rajpurkar","CheXtransfer: Performance and Parameter Efficiency of ImageNet Models
  for Chest X-Ray Interpretation",,,10.1145/3450439.3451867,,cs.CV cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Deep learning methods for chest X-ray interpretation typically rely on
pretrained models developed for ImageNet. This paradigm assumes that better
ImageNet architectures perform better on chest X-ray tasks and that
ImageNet-pretrained weights provide a performance boost over random
initialization. In this work, we compare the transfer performance and parameter
efficiency of 16 popular convolutional architectures on a large chest X-ray
dataset (CheXpert) to investigate these assumptions. First, we find no
relationship between ImageNet performance and CheXpert performance for both
models without pretraining and models with pretraining. Second, we find that,
for models without pretraining, the choice of model family influences
performance more than size within a family for medical imaging tasks. Third, we
observe that ImageNet pretraining yields a statistically significant boost in
performance across architectures, with a higher boost for smaller
architectures. Fourth, we examine whether ImageNet architectures are
unnecessarily large for CheXpert by truncating final blocks from pretrained
models, and find that we can make models 3.25x more parameter-efficient on
average without a statistically significant drop in performance. Our work
contributes new experimental evidence about the relation of ImageNet to chest
x-ray interpretation performance.
","[{'version': 'v1', 'created': 'Mon, 18 Jan 2021 04:48:24 GMT'}, {'version': 'v2', 'created': 'Sun, 21 Feb 2021 02:06:43 GMT'}]",2021-02-23,"[['Ke', 'Alexander', ''], ['Ellsworth', 'William', ''], ['Banerjee', 'Oishi', ''], ['Ng', 'Andrew Y.', ''], ['Rajpurkar', 'Pranav', '']]","['generalization', 'efficiency', 'pretraining', 'chest x-ray interpretation', 'ImageNet', 'truncation']"
9011,2106.07961,Giovanni Apruzzese,"Andrea Corsini, Shanchieh Jay Yang, Giovanni Apruzzese","On the Evaluation of Sequential Machine Learning for Network Intrusion
  Detection",,,10.1145/3465481.3470065,,cs.CR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Recent advances in deep learning renewed the research interests in machine
learning for Network Intrusion Detection Systems (NIDS). Specifically,
attention has been given to sequential learning models, due to their ability to
extract the temporal characteristics of Network traffic Flows (NetFlows), and
use them for NIDS tasks. However, the applications of these sequential models
often consist of transferring and adapting methodologies directly from other
fields, without an in-depth investigation on how to leverage the specific
circumstances of cybersecurity scenarios; moreover, there is a lack of
comprehensive studies on sequential models that rely on NetFlow data, which
presents significant advantages over traditional full packet captures. We
tackle this problem in this paper. We propose a detailed methodology to extract
temporal sequences of NetFlows that denote patterns of malicious activities.
Then, we apply this methodology to compare the efficacy of sequential learning
models against traditional static learning models. In particular, we perform a
fair comparison of a `sequential' Long Short-Term Memory (LSTM) against a
`static' Feedforward Neural Networks (FNN) in distinct environments represented
by two well-known datasets for NIDS: the CICIDS2017 and the CTU13. Our results
highlight that LSTM achieves comparable performance to FNN in the CICIDS2017
with over 99.5\% F1-score; while obtaining superior performance in the CTU13,
with 95.7\% F1-score against 91.5\%. This paper thus paves the way to future
applications of sequential learning models for NIDS.
","[{'version': 'v1', 'created': 'Tue, 15 Jun 2021 08:29:28 GMT'}]",2022-07-06,"[['Corsini', 'Andrea', ''], ['Yang', 'Shanchieh Jay', ''], ['Apruzzese', 'Giovanni', '']]","['Long Short Term Memory', 'Machine Learning', 'Network IntrusionDetection', 'Cybersecurity', 'Network Flows', 'Deep Learning']"
9012,2110.15567,Sebastien Plutniak,"S\'ebastien Plutniak (CED, TRACES)","Assyrian merchants meet nuclear physicists: history of the early
  contributions from social sciences to computer science. The case of automatic
  pattern detection in graphs (1950s--1970s)",,"Interdisciplinary Science Reviews, Maney Publishing, 2021, 46 (4),
  pp.547-568",10.1080/03080188.2021.1877502,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Community detection is a major issue in network analysis. This paper combines
a socio-historical approach with an experimental reconstruction of programs to
investigate the early automation of clique detection algorithms, which remains
one of the unsolved NP-complete problems today. The research led by the
archaeologist Jean-Claude Gardin from the 1950s on non-numerical information
and graph analysis is retraced to demonstrate the early contributions of social
sciences and humanities. The limited recognition and reception of Gardin's
innovative computer application to the humanities are addressed through two
factors, in addition to the effects of historiography and bibliographies on the
recording, discoverability, and reuse of scientific productions: 1) funding
policies, evidenced by the transfer of research effort on graph applications
from temporary interdisciplinary spaces to disciplinary organizations related
to the then-emerging field of computer science; and 2) the erratic careers of
algorithms, in which efficiency, flaws, corrections, and authors' status, were
determining factors.
","[{'version': 'v1', 'created': 'Fri, 29 Oct 2021 06:32:00 GMT'}]",2021-11-01,"[['Plutniak', 'Sébastien', '', 'CED, TRACES']]","['history of computing', 'clique detection', 'community detection', 'social networks', 'sociometry', 'graph analysis', 'algorithm']"
9013,2209.14350,Linghao Song,"Linghao Song, Licheng Guo, Suhail Basalama, Yuze Chi, Robert F. Lucas,
  Jason Cong","Callipepla: Stream Centric Instruction Set and Mixed Precision for
  Accelerating Conjugate Gradient Solver",To appear in FPGA 2023,,10.1145/3543622.3573182,,cs.AR cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The continued growth in the processing power of FPGAs coupled with high
bandwidth memories (HBM), makes systems like the Xilinx U280 credible platforms
for linear solvers which often dominate the run time of scientific and
engineering applications. In this paper, we present Callipepla, an accelerator
for a preconditioned conjugate gradient linear solver (CG). FPGA acceleration
of CG faces three challenges: (1) how to support an arbitrary problem and
terminate acceleration processing on the fly, (2) how to coordinate long-vector
data flow among processing modules, and (3) how to save off-chip memory
bandwidth and maintain double (FP64) precision accuracy. To tackle the three
challenges, we present (1) a stream-centric instruction set for efficient
streaming processing and control, (2) vector streaming reuse (VSR) and
decentralized vector flow scheduling to coordinate vector data flow among
modules and further reduce off-chip memory accesses with a double memory
channel design, and (3) a mixed precision scheme to save bandwidth yet still
achieve effective double precision quality solutions. To the best of our
knowledge, this is the first work to introduce the concept of VSR for data
reusing between on-chip modules to reduce unnecessary off-chip accesses for
FPGA accelerators. We prototype the accelerator on a Xilinx U280 HBM FPGA. Our
evaluation shows that compared to the Xilinx HPC product, the XcgSolver,
Callipepla achieves a speedup of 3.94x, 3.36x higher throughput, and 2.94x
better energy efficiency. Compared to an NVIDIA A100 GPU which has 4x the
memory bandwidth of Callipepla, we still achieve 77% of its throughput with
3.34x higher energy efficiency. The code is available at
https://github.com/UCLA-VAST/Callipepla.
","[{'version': 'v1', 'created': 'Wed, 28 Sep 2022 18:26:30 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Dec 2022 06:43:44 GMT'}]",2023-01-02,"[['Song', 'Linghao', ''], ['Guo', 'Licheng', ''], ['Basalama', 'Suhail', ''], ['Chi', 'Yuze', ''], ['Lucas', 'Robert F.', ''], ['Cong', 'Jason', '']]","['High Bandwidth Memory', 'Conjugate Gradient', 'Accelerator']"
9014,1905.01674,Hanzhou Wu,Hanzhou Wu and Xinpeng Zhang,Game-theoretic Analysis to Content-adaptive Reversible Watermarking,"12 pages, 2 figures",,10.1080/02564602.2020.1739574,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While many games were designed for steganography and robust watermarking, few
focused on reversible watermarking. We present a two-encoder game related to
the rate-distortion optimization of content-adaptive reversible watermarking.
In the game, Alice first hides a payload into a cover. Then, Bob hides another
payload into the modified cover. The embedding strategy of Alice affects the
embedding capacity of Bob. The embedding strategy of Bob may produce
data-extraction errors to Alice. Both want to embed as many pure secret bits as
possible, subjected to an upper-bounded distortion. We investigate
non-cooperative game and cooperative game between Alice and Bob. When they
cooperate with each other, one may consider them as a whole, i.e., an encoder
uses a cover for data embedding with two times. When they do not cooperate with
each other, the game corresponds to a separable system, i.e., both want to
independently hide a payload within the cover, but recovering the cover may
need cooperation. We find equilibrium strategies for both players under
constraints.
","[{'version': 'v1', 'created': 'Sun, 5 May 2019 12:51:36 GMT'}]",2021-10-08,"[['Wu', 'Hanzhou', ''], ['Zhang', 'Xinpeng', '']]","['Game theory', 'reversible data hiding', 'reversible watermarking', 'lossless compression', 'content adaptive']"
9015,2210.14609,ELkebir Sarhrouni,"Asma Elmaizi, Elkebir Sarhrouni, Ahmed hammouch, Chafik Nacir","A novel filter based on three variables mutual information for
  dimensionality reduction and classification of hyperspectral images",,"2016 International Conference on Electrical and Information
  Technologies (ICEIT) -
  http://www.scopus.com/inward/record.url?eid=2-s2.0-84992221810&partnerID=MN8TOARS",10.1109/EITech.2016.7519622,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The high dimensionality of hyperspectral images (HSI) that contains more than
hundred bands (images) for the same region called Ground Truth Map, often
imposes a heavy computational burden for image processing and complicates the
learning process. In fact, the removal of irrelevant, noisy and redundant bands
helps increase the classification accuracy. Band selection filter based on
""Mutual Information"" is a common technique for dimensionality reduction. In
this paper, a categorization of dimensionality reduction methods according to
the evaluation process is presented. Moreover, a new filter approach based on
three variables mutual information is developed in order to measure band
correlation for classification, it considers not only bands relevance but also
bands interaction. The proposed approach is compared to a reproduced filter
algorithm based on mutual information. Experimental results on HSI AVIRIS
92AV3C have shown that the proposed approach is very competitive, effective and
outperforms the reproduced filter strategy performance.
  Keywords - Hyperspectral images, Classification, band Selection, Three
variables Mutual Information, information gain.
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2022 10:29:00 GMT'}]",2022-10-27,"[['Elmaizi', 'Asma', ''], ['Sarhrouni', 'Elkebir', ''], ['hammouch', 'Ahmed', ''], ['Nacir', 'Chafik', '']]","['Hyperspectral images', 'Classification', 'band']"
9016,2108.03603,Mohit Vaishnav,"Mohit Vaishnav, Remi Cadene, Andrea Alamia, Drew Linsley, Rufin
  VanRullen and Thomas Serre",Understanding the computational demands underlying visual reasoning,"26 pages, 16 figures","Neural Computation, 2022",10.1162/neco_a_01485,,cs.CV cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Visual understanding requires comprehending complex visual relations between
objects within a scene. Here, we seek to characterize the computational demands
for abstract visual reasoning. We do this by systematically assessing the
ability of modern deep convolutional neural networks (CNNs) to learn to solve
the ""Synthetic Visual Reasoning Test"" (SVRT) challenge, a collection of
twenty-three visual reasoning problems. Our analysis reveals a novel taxonomy
of visual reasoning tasks, which can be primarily explained by both the type of
relations (same-different vs. spatial-relation judgments) and the number of
relations used to compose the underlying rules. Prior cognitive neuroscience
work suggests that attention plays a key role in humans' visual reasoning
ability. To test this hypothesis, we extended the CNNs with spatial and
feature-based attention mechanisms. In a second series of experiments, we
evaluated the ability of these attention networks to learn to solve the SVRT
challenge and found the resulting architectures to be much more efficient at
solving the hardest of these visual reasoning tasks. Most importantly, the
corresponding improvements on individual tasks partially explained our novel
taxonomy. Overall, this work provides an granular computational account of
visual reasoning and yields testable neuroscience predictions regarding the
differential need for feature-based vs. spatial attention depending on the type
of visual reasoning problem.
","[{'version': 'v1', 'created': 'Sun, 8 Aug 2021 10:46:53 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Dec 2021 04:57:02 GMT'}]",2022-03-03,"[['Vaishnav', 'Mohit', ''], ['Cadene', 'Remi', ''], ['Alamia', 'Andrea', ''], ['Linsley', 'Drew', ''], ['VanRullen', 'Rufin', ''], ['Serre', 'Thomas', '']]","['visual relations', 'deep learning', 'convolutional neural networks', 'transformer networks', 'spatial attention', 'feature-based attention']"
9017,2204.12195,Clemencia Siro,"Clemencia Siro, Mohammad Aliannejadi, Maarten de Rijke",Understanding User Satisfaction with Task-oriented Dialogue Systems,To appear in SIGIR 2022 short paper track,,10.1145/3477495.3531798,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  $ $Dialogue systems are evaluated depending on their type and purpose. Two
categories are often distinguished: (1) task-oriented dialogue systems (TDS),
which are typically evaluated on utility, i.e., their ability to complete a
specified task, and (2) open domain chatbots, which are evaluated on the user
experience, i.e., based on their ability to engage a person. What is the
influence of user experience on the user satisfaction rating of TDS as opposed
to, or in addition to, utility? We collect data by providing an additional
annotation layer for dialogues sampled from the ReDial dataset, a widely used
conversational recommendation dataset. Unlike prior work, we annotate the
sampled dialogues at both the turn and dialogue level on six dialogue aspects:
relevance, interestingness, understanding, task completion, efficiency, and
interest arousal. The annotations allow us to study how different dialogue
aspects influence user satisfaction. We introduce a comprehensive set of user
experience aspects derived from the annotators' open comments that can
influence users' overall impression. We find that the concept of satisfaction
varies across annotators and dialogues, and show that a relevant turn is
significant for some annotators, while for others, an interesting turn is all
they need. Our analysis indicates that the proposed user experience aspects
provide a fine-grained analysis of user satisfaction that is not captured by a
monolithic overall human rating.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2022 09:56:51 GMT'}]",2022-04-27,"[['Siro', 'Clemencia', ''], ['Aliannejadi', 'Mohammad', ''], ['de Rijke', 'Maarten', '']]","['Fine-grained user satisfaction', 'task-oriented dialogues', 'user experience']"
9018,2003.08877,"Barbara K\""onig","Paolo Baldan and Barbara K\""onig and Tommaso Padoan","Abstraction, Up-to Techniques and Games for Systems of Fixpoint
  Equations",,,10.4230/LIPIcs.CONCUR.2020.25,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Systems of fixpoint equations over complete lattices, consisting of (mixed)
least and greatest fixpoint equations, allow one to express a number of
verification tasks such as model-checking of various kinds of specification
logics or the check of coinductive behavioural equivalences.
  In this paper we develop a theory of approximation for systems of fixpoint
equations in the style of abstract interpretation: a system over some concrete
domain is abstracted to a system in a suitable abstract domain, with conditions
ensuring that the abstract solution represents a sound/complete
overapproximation of the concrete solution.
  Interestingly, up-to techniques, a classical approach used in coinductive
settings to obtain easier or feasible proofs, can be interpreted as
abstractions in a way that they naturally fit in our framework and extend to
systems of equations.
  Additionally, relying on the approximation theory, we can provide a
characterisation of the solution of systems of fixpoint equations over complete
lattices in terms of a suitable parity game, generalising some recent work that
was restricted to continuous lattices.
  The game view opens the way to the development of on-the-fly algorithms for
characterising the solution of such equation systems.
","[{'version': 'v1', 'created': 'Thu, 19 Mar 2020 15:56:03 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Jun 2021 09:20:49 GMT'}]",2021-06-21,"[['Baldan', 'Paolo', ''], ['König', 'Barbara', ''], ['Padoan', 'Tommaso', '']]","['fixpoint equation systems', 'complete lattices', 'parity games', 'abstract interpretation', 'up-to techniques', 'local algorithms', 'µ-calculus', 'bisimilarity']"
9019,2204.02386,Zhengyang Lu,Zhengyang Lu and Ying Chen,"Pyramid Frequency Network with Spatial Attention Residual Refinement
  Module for Monocular Depth Estimation",,,10.1117/1.JEI.31.2.023005,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Deep-learning-based approaches to depth estimation are rapidly advancing,
offering superior performance over existing methods. To estimate the depth in
real-world scenarios, depth estimation models require the robustness of various
noise environments. In this work, a Pyramid Frequency Network(PFN) with Spatial
Attention Residual Refinement Module(SARRM) is proposed to deal with the weak
robustness of existing deep-learning methods. To reconstruct depth maps with
accurate details, the SARRM constructs a residual fusion method with an
attention mechanism to refine the blur depth. The frequency division strategy
is designed, and the frequency pyramid network is developed to extract features
from multiple frequency bands. With the frequency strategy, PFN achieves better
visual accuracy than state-of-the-art methods in both indoor and outdoor scenes
on Make3D, KITTI depth, and NYUv2 datasets. Additional experiments on the noisy
NYUv2 dataset demonstrate that PFN is more reliable than existing deep-learning
methods in high-noise scenes.
","[{'version': 'v1', 'created': 'Tue, 5 Apr 2022 17:48:26 GMT'}]",2022-04-06,"[['Lu', 'Zhengyang', ''], ['Chen', 'Ying', '']]","['monocular depth estimation', '3D Reconstruction', 'frequency domain', 'convolutional neural network']"
9020,1906.00657,Andreas Holzinger,Heimo Mueller and Andreas Holzinger,Kandinsky Patterns,"13 pages, 13 Figures","Artificial Intelligence, 2021",10.1016/j.artint.2021.103546,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Kandinsky Figures and Kandinsky Patterns are mathematically describable,
simple self-contained hence controllable test data sets for the development,
validation and training of explainability in artificial intelligence. Whilst
Kandinsky Patterns have these computationally manageable properties, they are
at the same time easily distinguishable from human observers. Consequently,
controlled patterns can be described by both humans and computers. We define a
Kandinsky Pattern as a set of Kandinsky Figures, where for each figure an
""infallible authority"" defines that the figure belongs to the Kandinsky
Pattern. With this simple principle we build training and validation data sets
for automatic interpretability and context learning. In this paper we describe
the basic idea and some underlying principles of Kandinsky Patterns and provide
a Github repository to invite the international machine learning research
community to a challenge to experiment with our Kandinsky Patterns to expand
and thus make progress in the field of explainable AI and to contribute to the
upcoming field of explainability and causability.
","[{'version': 'v1', 'created': 'Mon, 3 Jun 2019 09:22:33 GMT'}]",2021-06-11,"[['Mueller', 'Heimo', ''], ['Holzinger', 'Andreas', '']]","['explainable AI', 'explainability', 'machine learning', 'challenge']"
9021,2201.09518,Varvara Guljajeva,Varvara Guljajeva,Synthetic Books,"7 pages, 5 figures",ARTECH 2021,10.1145/3483529.3483663,,cs.CL cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The article explores new ways of written language aided by AI technologies,
like GPT-2 and GPT-3. The question that is stated in the paper is not about
whether these novel technologies will eventually replace authored books, but
how to relate to and contextualize such publications and what kind of new
tools, processes, and ideas are behind them. For that purpose, a new concept of
synthetic books is introduced in the article. It stands for the publications
created by deploying AI technology, more precisely autoregressive language
models that are able to generate human-like text. Supported by the case
studies, the value and reasoning of the synthetic books are discussed. The
paper emphasizes that artistic quality is an issue when it comes to
AI-generated content. The article introduces projects that demonstrate an
interactive input by an artist and/or audience combined with the
deep-learning-based language models. In the end, the paper focuses on
understanding the neural aesthetics of written language in the art context.
","[{'version': 'v1', 'created': 'Mon, 24 Jan 2022 08:26:28 GMT'}]",2022-01-25,"[['Guljajeva', 'Varvara', '']]","['AI-generated text', 'AI', 'GPT-2', 'GRP-3', 'language model', 'deep-learning', 'neural']"
9022,1909.11994,Filippo Bistaffa,"Ewa Andrejczuk, Filippo Bistaffa, Christian Blum, Juan A.
  Rodr\'iguez-Aguilar, Carles Sierra","Synergistic Team Composition: A Computational Approach to Foster
  Diversity in Teams",Accepted version,"Volume 182, 15 October 2019, page 104799",10.1016/j.knosys.2019.06.007,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Co-operative learning in heterogeneous teams refers to learning methods in
which teams are organised both to accomplish academic tasks and for individuals
to gain knowledge. Competencies, personality and the gender of team members are
key factors that influence team performance. Here, we introduce a team
composition problem, the so-called synergistic team composition problem (STCP),
which incorporates such key factors when arranging teams. Thus, the goal of the
STCP is to partition a set of individuals into a set of synergistic teams:
teams that are diverse in personality and gender and whose members cover all
required competencies to complete a task. Furthermore, the STCP requires that
all teams are balanced in that they are expected to exhibit similar
performances when completing the task. We propose two efficient algorithms to
solve the STCP. Our first algorithm is based on a linear programming
formulation and is appropriate to solve small instances of the problem. Our
second algorithm is an anytime heuristic that is effective for large instances
of the STCP. Finally, we thoroughly study the computational properties of both
algorithms in an educational context when grouping students in a classroom into
teams using actual-world data.
","[{'version': 'v1', 'created': 'Thu, 26 Sep 2019 09:24:25 GMT'}]",2019-09-27,"[['Andrejczuk', 'Ewa', ''], ['Bistaffa', 'Filippo', ''], ['Blum', 'Christian', ''], ['Rodríguez-Aguilar', 'Juan A.', ''], ['Sierra', 'Carles', '']]","['team composition', 'exact algorithms', 'heuristicalgorithms', 'optimisation', 'coalition formation']"
9023,2107.12524,Matthew Guzdial,"Bowei Li, Ruohan Chen, Yuqing Xue, Ricky Wang, Wenwen Li, and Matthew
  Guzdial",Ensemble Learning For Mega Man Level Generation,"9 pages, 7 figures, Workshop on Procedural Content Generation","Proceedings of the Twelfth Workshop on Procedural Content
  Generation 2021",10.1145/3472538.3472600,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Procedural content generation via machine learning (PCGML) is the process of
procedurally generating game content using models trained on existing game
content. PCGML methods can struggle to capture the true variance present in
underlying data with a single model. In this paper, we investigated the use of
ensembles of Markov chains for procedurally generating \emph{Mega Man} levels.
We conduct an initial investigation of our approach and evaluate it on measures
of playability and stylistic similarity in comparison to a non-ensemble,
existing Markov chain approach.
","[{'version': 'v1', 'created': 'Tue, 27 Jul 2021 00:16:23 GMT'}]",2021-07-28,"[['Li', 'Bowei', ''], ['Chen', 'Ruohan', ''], ['Xue', 'Yuqing', ''], ['Wang', 'Ricky', ''], ['Li', 'Wenwen', ''], ['Guzdial', 'Matthew', '']]","['procedural content generation', 'ensemble methods', 'markov chains', 'mega man']"
9024,2001.01653,Tobias Gysi,"Tobias Gysi, Tobias Grosser, Laurin Brandner, and Torsten Hoefler",A Fast Analytical Model of Fully Associative Caches,"14 pages, 16 figures, PLDI19",,10.1145/3314221.3314606,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While the cost of computation is an easy to understand local property, the
cost of data movement on cached architectures depends on global state, does not
compose, and is hard to predict. As a result, programmers often fail to
consider the cost of data movement. Existing cache models and simulators
provide the missing information but are computationally expensive. We present a
lightweight cache model for fully associative caches with least recently used
(LRU) replacement policy that gives fast and accurate results. We count the
cache misses without explicit enumeration of all memory accesses by using
symbolic counting techniques twice: 1) to derive the stack distance for each
memory access and 2) to count the memory accesses with stack distance larger
than the cache size. While this technique seems infeasible in theory, due to
non-linearities after the first round of counting, we show that the counting
problems are sufficiently linear in practice. Our cache model often computes
the results within seconds and contrary to simulation the execution time is
mostly problem size independent. Our evaluation measures modeling errors below
0.6% on real hardware. By providing accurate data placement information we
enable memory hierarchy aware software development.
","[{'version': 'v1', 'created': 'Mon, 6 Jan 2020 16:35:46 GMT'}]",2020-01-07,"[['Gysi', 'Tobias', ''], ['Grosser', 'Tobias', ''], ['Brandner', 'Laurin', ''], ['Hoefler', 'Torsten', '']]","['static analysis', 'cache model', 'performance tool']"
9025,2211.00555,John Paul Miranda,"John Paul P. Miranda, Julieta M. Umali, Aileen P. de Leon","Datasets of Fire and Crime Incidents in Pampanga, Philippines","10 pages, 10 citations, 5 figures, 1 table, journal article,
  peer-reviewed","International Journal of Computing Sciences Research, 2022",10.25147/ijcsr.2017.001.1.121,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  The fire and crime incident datasets were requested and collected from two
Philippine regional agencies (i.e., the Bureau of Fire Protection and the
Philippine National Police). The datasets were used to initially analyze and
map both fire and crime incidents within the province of Pampanga for a
specific time frame. Several data preparation, normalization, and data cleaning
steps were implemented to properly map and identify patterns within the
datasets. The initial results also indicate the leading causes of fire and
crimes are rubbish and acts against property. Fires mostly occur during the dry
season in the province. Crime is particularly high during December, and most of
the fire and crime incidents occur during the time when people are most active.
The dataset was able to present the temporal characteristics of the fire and
crime incidents that occurred in the province of Pampanga. Merge the existing
dataset with the other datasets from other related agencies to get a bigger
picture and produce more objective results that could be used for
decision-making.
","[{'version': 'v1', 'created': 'Tue, 1 Nov 2022 16:06:55 GMT'}]",2022-11-02,"[['Miranda', 'John Paul P.', ''], ['Umali', 'Julieta M.', ''], ['de Leon', 'Aileen P.', '']]","['dataset', 'fire', 'crime', 'incidents', 'rubbish', 'crimes against property', 'temporal    VALUE OF THE DATASETS']"
9026,1306.5787,Gaurav Thakur,Gaurav Thakur,Spread Spectrum Codes for Continuous-Phase Modulated Systems,,IEEE Transactions on Communications 62(3):952-960 (2014),10.1109/TCOMM.2014.011514.130842,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the theoretical performance of a combined approach to demodulation
and decoding of binary continuous-phase modulated signals under repetition-like
codes. This technique is motivated by a need to transmit packetized or framed
data bursts in high noise regimes where many powerful, short-length codes are
ineffective. In channels with strong noise, we mathematically study the
asymptotic bit error rates of this combined approach and quantify the
performance improvement over performing demodulation and decoding separately as
the code rate increases. In this context, we also discuss a simple variant of
repetition coding involving pseudorandom code words, based on direct-sequence
spread spectrum methods, that preserves the spectral density of the encoded
signal in order to maintain resistance to narrowband interference. We describe
numerical simulations that demonstrate the advantages of this approach as an
inner code which can be used underneath modern coding schemes in high noise
environments.
","[{'version': 'v1', 'created': 'Mon, 24 Jun 2013 21:25:14 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Oct 2013 19:24:29 GMT'}, {'version': 'v3', 'created': 'Wed, 1 Jan 2014 20:05:09 GMT'}]",2014-04-28,"[['Thakur', 'Gaurav', '']]","['continuous phase modulation', 'random codes', 'biterror rates', 'asymptotic bounds']"
9027,2105.13813,Daniel Pitchforth,"Daniel J Pitchforth, Timothy J Rogers, Ulf T Tygesen, Elizabeth J
  Cross",Grey-box models for wave loading prediction,,"Mechanical Systems and Signal Processing, Volume 159, 2021",10.1016/j.ymssp.2021.107741,,cs.LG eess.SP physics.flu-dyn,http://creativecommons.org/licenses/by/4.0/,"  The quantification of wave loading on offshore structures and components is a
crucial element in the assessment of their useful remaining life. In many
applications the well-known Morison's equation is employed to estimate the
forcing from waves with assumed particle velocities and accelerations. This
paper develops a grey-box modelling approach to improve the predictions of the
force on structural members. A grey-box model intends to exploit the enhanced
predictive capabilities of data-based modelling whilst retaining physical
insight into the behaviour of the system; in the context of the work carried
out here, this can be considered as physics-informed machine learning. There
are a number of possible approaches to establish a grey-box model. This paper
demonstrates two means of combining physics (white box) and data-based (black
box) components; one where the model is a simple summation of the two
components, the second where the white-box prediction is fed into the black box
as an additional input. Here Morison's equation is used as the physics-based
component in combination with a data-based Gaussian process NARX - a dynamic
variant of the more well-known Gaussian process regression. Two key challenges
with employing the GP-NARX formulation that are addressed here are the
selection of appropriate lag terms and the proper treatment of uncertainty
propagation within the dynamic GP. The best performing grey-box model, the
residual modelling GP-NARX, was able to achieve a 29.13\% and 5.48\% relative
reduction in NMSE over Morison's Equation and a black-box GP-NARX respectively,
alongside significant benefits in extrapolative capabilities of the model, in
circumstances of low dataset coverage.
","[{'version': 'v1', 'created': 'Mon, 10 May 2021 15:10:33 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Jun 2021 15:15:44 GMT'}]",2021-07-01,"[['Pitchforth', 'Daniel J', ''], ['Rogers', 'Timothy J', ''], ['Tygesen', 'Ulf T', ''], ['Cross', 'Elizabeth J', '']]","['Grey-box model', 'Offshore structures', 'GP-NARX', 'Gaussian process', 'Uncertainty']"
9028,2007.13404,Christos Kyrkou,Christos Kyrkou,"YOLOpeds: Efficient Real-Time Single-Shot Pedestrian Detection for Smart
  Camera Applications",,,10.1049/iet-cvi.2019.0897,,cs.CV,http://creativecommons.org/licenses/by-sa/4.0/,"  Deep Learning-based object detectors can enhance the capabilities of smart
camera systems in a wide spectrum of machine vision applications including
video surveillance, autonomous driving, robots and drones, smart factory, and
health monitoring. Pedestrian detection plays a key role in all these
applications and deep learning can be used to construct accurate
state-of-the-art detectors. However, such complex paradigms do not scale easily
and are not traditionally implemented in resource-constrained smart cameras for
on-device processing which offers significant advantages in situations when
real-time monitoring and robustness are vital. Efficient neural networks can
not only enable mobile applications and on-device experiences but can also be a
key enabler of privacy and security allowing a user to gain the benefits of
neural networks without needing to send their data to the server to be
evaluated. This work addresses the challenge of achieving a good trade-off
between accuracy and speed for efficient deployment of deep-learning-based
pedestrian detection in smart camera applications. A computationally efficient
architecture is introduced based on separable convolutions and proposes
integrating dense connections across layers and multi-scale feature fusion to
improve representational capacity while decreasing the number of parameters and
operations. In particular, the contributions of this work are the following: 1)
An efficient backbone combining multi-scale feature operations, 2) a more
elaborate loss function for improved localization, 3) an anchor-less approach
for detection, The proposed approach called YOLOpeds is evaluated using the
PETS2009 surveillance dataset on 320x320 images. Overall, YOLOpeds provides
real-time sustained operation of over 30 frames per second with detection rates
in the range of 86% outperforming existing deep learning models.
","[{'version': 'v1', 'created': 'Mon, 27 Jul 2020 09:50:11 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Oct 2020 16:23:12 GMT'}]",2020-10-30,"[['Kyrkou', 'Christos', '']]","['Deep Learning', 'Convolutional Neural Networks', 'Real-Time', 'Smart Cameras', 'Pedestrian Detection', 'Surveillance', 'Computational Efficiency']"
9029,2010.05036,Lloyd Montgomery,"Tyson Bulmer, Lloyd Montgomery, Daniela Damian",Predicting Developers' IDE Commands with Machine Learning,"4 pages, 1 figure, accepted at the 2018 ACM 15th Mining Software
  Repositories (MSR) conference",,10.1145/3196398.3196459,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When a developer is writing code they are usually focused and in a
state-of-mind which some refer to as flow. Breaking out of this flow can cause
the developer to lose their train of thought and have to start their thought
process from the beginning. This loss of thought can be caused by interruptions
and sometimes slow IDE interactions. Predictive functionality has been
harnessed in user applications to speed up load times, such as in Google
Chrome's browser which has a feature called ""Predicting Network Actions"". This
will pre-load web-pages that the user is most likely to click through. This
mitigates the interruption that load times can introduce. In this paper we seek
to make the first step towards predicting user commands in the IDE. Using the
MSR 2018 Challenge Data of over 3000 developer session and over 10 million
recorded events, we analyze and cleanse the data to be parsed into event
series, which can then be used to train a variety of machine learning models,
including a neural network, to predict user induced commands. Our highest
performing model is able to obtain a 5 cross-fold validation prediction
accuracy of 64%.
","[{'version': 'v1', 'created': 'Sat, 10 Oct 2020 16:01:22 GMT'}]",2020-10-13,"[['Bulmer', 'Tyson', ''], ['Montgomery', 'Lloyd', ''], ['Damian', 'Daniela', '']]","['IDE Monitoring', 'Machine Learning', 'Neural Network', 'DeveloperCommands']"
9030,2204.06371,Alexandre Benoit,"Emna Amri (LISTIC), Hermann Courteille (LISTIC), A Benoit (LISTIC),
  Philippe Bolon (LISTIC), Dominique Dubucq, Gilles Poulain, Anthony Credoz","Deep learning based automatic detection of offshore oil slicks using SAR
  data and contextual information","SPIE Conference on Remote Sensing of the Ocean, Sea Ice, Coastal
  Waters, and Large Water Regions, Sep 2021, Online, Spain",,10.1117/12.2598032,,cs.CV cs.NE eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ocean surface monitoring, especially oil slick detection, has become
mandatory due to its importance for oil exploration and risk prevention on
ecosystems. For years, the detection task has been performed manually by
photo-interpreters using Synthetic Aperture Radar (SAR) images with the help of
contextual data such as wind. This tedious manual work cannot handle the
increasing amount of data collected by the available sensors and thus requires
automation. Literature reports conventional and semi-automated detection
methods that generally focus either on oil slicks originating from
anthropogenic (spills) or natural (seeps) sources on limited data collections.
As an extension, this paper presents the automation of offshore oil slicks on
an extensive database with both kinds of slicks. It builds upon the slick
annotations of specialized photo-interpreters on Sentinel-1 SAR data for 4
years over 3 exploration and monitoring areas worldwide. All the considered SAR
images and related annotation relate to real oil slick monitoring scenarios.
Further, wind estimation is systematically computed to enrich the data
collection. Paper contributions are the following : (i) a performance
comparison of two deep learning approaches: semantic segmentation using
FC-DenseNet and instance segmentation using Mask-RCNN. (ii) the introduction of
meteorological information (wind speed) is deemed valuable for oil slick
detection in the performance evaluation. The main results of this study show
the effectiveness of slick detection by deep learning approaches, in particular
FC-DenseNet, which captures more than 92% of oil instances in our test set.
Furthermore, a strong correlation between model performances and contextual
information such as slick size and wind speed is demonstrated in the
performance evaluation. This work opens perspectives to design models that can
fuse SAR and wind information to reduce the false alarm rate.
","[{'version': 'v1', 'created': 'Wed, 13 Apr 2022 13:30:16 GMT'}]",2022-04-14,"[['Amri', 'Emna', '', 'LISTIC'], ['Courteille', 'Hermann', '', 'LISTIC'], ['Benoit', 'A', '', 'LISTIC'], ['Bolon', 'Philippe', '', 'LISTIC'], ['Dubucq', 'Dominique', ''], ['Poulain', 'Gilles', ''], ['Credoz', 'Anthony', '']]","['Deep Learning', 'Image Segmentation', 'Neural Networks', 'Remote Sensing', 'Oil Slick Detection', 'SARImages', 'Wind Speed']"
9031,1911.07408,Aleksey Fedoseev,"Aleksey Fedoseev, Nikita Chernyadev, and Dzmitry Tsetserukou","Development of MirrorShape: High Fidelity Large-Scale Shape Rendering
  Framework for Virtual Reality","Accepted to the 25th ACM Symposium on Virtual Reality Software and
  Technology (VRST'19), ACM copyright",,10.1145/3359996.3365049,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today there is a high variety of haptic devices capable of providing tactile
feedback. Although most of existing designs are aimed at realistic simulation
of the surface properties, their capabilities are limited in attempts of
displaying shape and position of virtual objects. This paper suggests a new
concept of distributed haptic display for realistic interaction with virtual
object of complex shape by a collaborative robot with shape display
end-effector. MirrorShape renders the 3D object in virtual reality (VR) system
by contacting the user hands with the robot end-effector at the calculated
point in real-time. Our proposed system makes it possible to synchronously
merge the position of contact point in VR and end-effector in real world. This
feature provides presentation of different shapes, and at the same time expands
the working area comparing to desktop solutions. The preliminary user study
revealed that MirrorShape was effective at reducing positional error in VR
interactions. Potentially this approach can be used in the virtual systems for
rendering versatile VR objects with wide range of sizes with high fidelity
large-scaleshape experience.
","[{'version': 'v1', 'created': 'Mon, 18 Nov 2019 03:35:44 GMT'}]",2021-04-20,"[['Fedoseev', 'Aleksey', ''], ['Chernyadev', 'Nikita', ''], ['Tsetserukou', 'Dzmitry', '']]","['3D interaction', 'collaborative technologies', 'haptics', 'interaction technologies', 'robotics', 'shape-changing interfaces', 'virtual reality']"
9032,1801.08650,Chang-Shing Lee,"Chang-Shing Lee, Mei-Hui Wang, Tzong-Xiang Huang, Li-Chung Chen,
  Yung-Ching Huang, Sheng-Chi Yang, Chien-Hsun Tseng, Pi-Hsia Hung, and Naoyuki
  Kubota","Ontology-based Fuzzy Markup Language Agent for Student and Robot
  Co-Learning",This paper is submitted to IEEE WCCI 2018 Conference for review,,10.1109/FUZZ-IEEE.2018.8491610,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An intelligent robot agent based on domain ontology, machine learning
mechanism, and Fuzzy Markup Language (FML) for students and robot co-learning
is presented in this paper. The machine-human co-learning model is established
to help various students learn the mathematical concepts based on their
learning ability and performance. Meanwhile, the robot acts as a teacher's
assistant to co-learn with children in the class. The FML-based knowledge base
and rule base are embedded in the robot so that the teachers can get feedback
from the robot on whether students make progress or not. Next, we inferred
students' learning performance based on learning content's difficulty and
students' ability, concentration level, as well as teamwork sprit in the class.
Experimental results show that learning with the robot is helpful for
disadvantaged and below-basic children. Moreover, the accuracy of the
intelligent FML-based agent for student learning is increased after machine
learning mechanism.
","[{'version': 'v1', 'created': 'Fri, 26 Jan 2018 02:04:01 GMT'}]",2019-04-15,"[['Lee', 'Chang-Shing', ''], ['Wang', 'Mei-Hui', ''], ['Huang', 'Tzong-Xiang', ''], ['Chen', 'Li-Chung', ''], ['Huang', 'Yung-Ching', ''], ['Yang', 'Sheng-Chi', ''], ['Tseng', 'Chien-Hsun', ''], ['Hung', 'Pi-Hsia', ''], ['Kubota', 'Naoyuki', '']]","['Ontology', 'Fuzzy Markup Language', 'Intelligent']"
9033,2205.15406,Emily Sullivan,Emily Sullivan and Philippe Verreault-Julien,"From Explanation to Recommendation: Ethical Standards for Algorithmic
  Recourse","11 pages, 3 figures, to be published in Proceedings of the 2022
  AAAI/ACM Conference on AI, Ethics, and Society",,10.1145/3514094.3534185,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  People are increasingly subject to algorithmic decisions, and it is generally
agreed that end-users should be provided an explanation or rationale for these
decisions. There are different purposes that explanations can have, such as
increasing user trust in the system or allowing users to contest the decision.
One specific purpose that is gaining more traction is algorithmic recourse. We
first propose that recourse should be viewed as a recommendation problem, not
an explanation problem. Then, we argue that the capability approach provides
plausible and fruitful ethical standards for recourse. We illustrate by
considering the case of diversity constraints on algorithmic recourse. Finally,
we discuss the significance and implications of adopting the capability
approach for algorithmic recourse research.
","[{'version': 'v1', 'created': 'Mon, 30 May 2022 20:09:42 GMT'}]",2022-06-01,"[['Sullivan', 'Emily', ''], ['Verreault-Julien', 'Philippe', '']]","['algorithmic recourse', 'recommendations', 'capability approach', 'diversity', 'explainable AI', 'counterfactuals']"
9034,2009.07204,Christof Beierle,Christof Beierle and Gregor Leander,New Instances of Quadratic APN Functions,"18 pages. This is the version accepted to IEEE Transactions on
  Information Theory",IEEE Trans. Inf. Theory 68(1): 670-678 (2022),10.1109/TIT.2021.3120698,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a recent work, Beierle, Brinkmann and Leander presented a recursive tree
search for finding APN permutations with linear self-equivalences in small
dimensions. In this paper, we describe how this search can be adapted to find
many new instances of quadratic APN functions. In particular, we found 12,921
new quadratic APN functions in dimension eight, 35 new quadratic APN functions
in dimension nine and five new quadratic APN functions in dimension ten up to
CCZ-equivalence. Remarkably, two of the 35 new APN functions in dimension nine
are APN permutations.
  Among the 8-bit APN functions, there are three extended Walsh spectra that do
not correspond to any of the previously-known quadratic 8-bit APN functions
and, surprisingly, there exist at least four CCZ-inequivalent 8-bit APN
functions with linearity $2^7$, i.e., the highest possible non-trivial
linearity for quadratic functions in dimension eight.
","[{'version': 'v1', 'created': 'Tue, 15 Sep 2020 16:33:20 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Nov 2020 14:05:03 GMT'}, {'version': 'v3', 'created': 'Fri, 7 May 2021 12:25:45 GMT'}, {'version': 'v4', 'created': 'Thu, 14 Oct 2021 07:32:35 GMT'}]",2021-12-24,"[['Beierle', 'Christof', ''], ['Leander', 'Gregor', '']]","['almost perfect nonlinear', 'Walsh spectrum', 'linearity', 'self-equivalence', 'EAequivalence']"
9035,2209.12145,Ruipeng Zhang,"Ruipeng Zhang, Chen Xu, Mengjun Xie",Secure Decentralized IoT Service Platform using Consortium Blockchain,,,10.3390/s22218186,,cs.CR cs.DC,http://creativecommons.org/licenses/by-sa/4.0/,"  Blockchain technology has gained increasing popularity in the research of
Internet of Things (IoT) systems in the past decade. As a distributed and
immutable ledger secured by strong cryptography algorithms, the blockchain
brings a new perspective to secure IoT systems. Many studies have been devoted
to integrating blockchain into IoT device management, access control, data
integrity, security, and privacy. In comparison, the blockchain-facilitated IoT
communication is much less studied. Nonetheless, we see the potential of
blockchain in decentralizing and securing IoT communications. This paper
proposes an innovative IoT service platform powered by consortium blockchain
technology. The presented solution abstracts machine-to-machine (M2M) and
human-to-machine (H2M) communications into services provided by IoT devices.
Then, it materializes data exchange of the IoT network through smart contracts
and blockchain transactions. Additionally, we introduce the auxiliary storage
layer to the proposed platform to address various data storage requirements.
Our proof-of-concept implementation is tested against various workloads and
connection sizes under different block configurations to evaluate the
platform's transaction throughput, latency, and hardware utilization. The
experiment results demonstrate that our solution can maintain high performance
under most testing scenarios and provide valuable insights on optimizing the
blockchain configuration to achieve the best performance.
","[{'version': 'v1', 'created': 'Sun, 25 Sep 2022 04:37:31 GMT'}]",2022-10-31,"[['Zhang', 'Ruipeng', ''], ['Xu', 'Chen', ''], ['Xie', 'Mengjun', '']]","['Internet of Things', 'IoT communication', 'security and privacy', 'consortium blockchain', 'smart contract', 'Hyperledger Fabric']"
9036,2108.08734,Ilie Sarpe,Ilie Sarpe and Fabio Vandin,"odeN: Simultaneous Approximation of Multiple Motif Counts in Large
  Temporal Networks","14 pages, 8 figures, accepted at CIKM 2021",,10.1145/3459637.3482459,,cs.SI cs.DS stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Counting the number of occurrences of small connected subgraphs, called
temporal motifs, has become a fundamental primitive for the analysis of
temporal networks, whose edges are annotated with the time of the event they
represent. One of the main complications in studying temporal motifs is the
large number of motifs that can be built even with a limited number of vertices
or edges. As a consequence, since in many applications motifs are employed for
exploratory analyses, the user needs to iteratively select and analyze several
motifs that represent different aspects of the network, resulting in an
inefficient, time-consuming process. This problem is exacerbated in large
networks, where the analysis of even a single motif is computationally
demanding. As a solution, in this work we propose and study the problem of
simultaneously counting the number of occurrences of multiple temporal motifs,
all corresponding to the same (static) topology (e.g., a triangle). Given that
for large temporal networks computing the exact counts is unfeasible, we
propose odeN, a sampling-based algorithm that provides an accurate
approximation of all the counts of the motifs. We provide analytical bounds on
the number of samples required by odeN to compute rigorous, probabilistic,
relative approximations. Our extensive experimental evaluation shows that odeN
enables the approximation of the counts of motifs in temporal networks in a
fraction of the time needed by state-of-the-art methods, and that it also
reports more accurate approximations than such methods.
","[{'version': 'v1', 'created': 'Thu, 19 Aug 2021 15:06:05 GMT'}]",2021-08-20,"[['Sarpe', 'Ilie', ''], ['Vandin', 'Fabio', '']]","['temporal motifs', 'sampling algorithm', 'temporal networks', 'randomized algorithm']"
9037,1801.06447,Omid Taghizadeh M.Sc.,"Omid Taghizadeh, Praveen Sirvi, Santosh Narasimha, Jose Angel Leon
  Calvo, Rudolf Mathar","Environment-Aware Minimum-Cost Wireless Backhaul Network Planning with
  Full-Duplex Links",Submuitted to IEEE for publication,,10.1109/JSYST.2019.2893537,,cs.NI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we address the joint design of the wireless backhauling network
topology as well as the frequency/power allocation on the wireless links, where
nodes are capable of full-duplex (FD) operation. The proposed joint design
enables the coexistence of multiple wireless links at the same channel,
resulting in an enhanced spectral efficiency. Moreover, it enables the usage of
FD capability when/where it is gainful. In this regard, a
mixed-integer-linear-program (MILP) is proposed, aiming at a minimum cost
design for the wireless backhaul network, considering the required rate demand
at each base station. Moreover, a re-tunning algorithm is proposed which reacts
to the slight changes in the network condition, e.g., channel attenuation or
rate demand, by adjusting the transmit power at the wireless links. In this
regard, a successive inner approximation (SIA)- based design is proposed, where
in each step a convex subproblem is solved. Numerical simulations show a
reduction in the overall network cost via the utilization of the proposed
designs, thanks to the coexistence of multiple wireless links on the same
channel due to the FD capability.
","[{'version': 'v1', 'created': 'Wed, 10 Jan 2018 17:35:03 GMT'}]",2019-10-02,"[['Taghizadeh', 'Omid', ''], ['Sirvi', 'Praveen', ''], ['Narasimha', 'Santosh', ''], ['Calvo', 'Jose Angel Leon', ''], ['Mathar', 'Rudolf', '']]","['Full-duplex', 'wireless backhaul', 'resource allocation', 'multi-objective optimization', 'mixed integer programming']"
9038,2208.10493,Namkyeong Lee,"Namkyeong Lee, Dongmin Hyun, Junseok Lee, Chanyoung Park",Relational Self-Supervised Learning on Graphs,CIKM 2022,,10.1145/3511808.3557428,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the past few years, graph representation learning (GRL) has been a
powerful strategy for analyzing graph-structured data. Recently, GRL methods
have shown promising results by adopting self-supervised learning methods
developed for learning representations of images. Despite their success,
existing GRL methods tend to overlook an inherent distinction between images
and graphs, i.e., images are assumed to be independently and identically
distributed, whereas graphs exhibit relational information among data
instances, i.e., nodes. To fully benefit from the relational information
inherent in the graph-structured data, we propose a novel GRL method, called
RGRL, that learns from the relational information generated from the graph
itself. RGRL learns node representations such that the relationship among nodes
is invariant to augmentations, i.e., augmentation-invariant relationship, which
allows the node representations to vary as long as the relationship among the
nodes is preserved. By considering the relationship among nodes in both global
and local perspectives, RGRL overcomes limitations of previous contrastive and
non-contrastive methods, and achieves the best of both worlds. Extensive
experiments on fourteen benchmark datasets over various downstream tasks
demonstrate the superiority of RGRL over state-of-the-art baselines. The source
code for RGRL is available at https://github.com/Namkyeong/RGRL.
","[{'version': 'v1', 'created': 'Sun, 21 Aug 2022 12:33:16 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Sep 2022 01:59:12 GMT'}]",2022-09-05,"[['Lee', 'Namkyeong', ''], ['Hyun', 'Dongmin', ''], ['Lee', 'Junseok', ''], ['Park', 'Chanyoung', '']]","['Self-Supervised Learning', 'Graph Representation Learning', 'GraphNeural Networks']"
9039,2001.02091,Chengkun Lang,"Huiwei Zhou, Zhuang Liu1, Shixian Ning, Chengkun Lang, Yingyu Lin, Lei
  Du","Knowledge-aware Attention Network for Protein-Protein Interaction
  Extraction","Published on Journal of Biomedical Informatics, 14 pages, 5 figures","Journal of Biomedical Informatics, 2019, 96: 103234",10.1016/j.jbi.2019.103234,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Protein-protein interaction (PPI) extraction from published scientific
literature provides additional support for precision medicine efforts. However,
many of the current PPI extraction methods need extensive feature engineering
and cannot make full use of the prior knowledge in knowledge bases (KB). KBs
contain huge amounts of structured information about entities and
relationships, therefore plays a pivotal role in PPI extraction. This paper
proposes a knowledge-aware attention network (KAN) to fuse prior knowledge
about protein-protein pairs and context information for PPI extraction. The
proposed model first adopts a diagonal-disabled multi-head attention mechanism
to encode context sequence along with knowledge representations learned from
KB. Then a novel multi-dimensional attention mechanism is used to select the
features that can best describe the encoded context. Experiment results on the
BioCreative VI PPI dataset show that the proposed approach could acquire
knowledge-aware dependencies between different words in a sequence and lead to
a new state-of-the-art performance.
","[{'version': 'v1', 'created': 'Tue, 7 Jan 2020 15:02:28 GMT'}]",2020-01-08,"[['Zhou', 'Huiwei', ''], ['Liu1', 'Zhuang', ''], ['Ning', 'Shixian', ''], ['Lang', 'Chengkun', ''], ['Lin', 'Yingyu', ''], ['Du', 'Lei', '']]","['PPI extraction', 'Attention mechanism', 'Prior knowledge']"
9040,2209.05179,Xiaojie Chen,"Ketian Sun, Yang Liu, Xiaojie Chen, Attila Szolnoki",Evolution of trust in a hierarchical population with punishing investors,,"Chaos, Solitons & Fractals 162 (2022) 112413",10.1016/j.chaos.2022.112413,,cs.GT physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Trust plays an essential role in the development of human society. According
to the standard trust game, an investor decides whether to keep or transfer a
certain portion of initial stake to a trustee. In the latter case, the stake is
enhanced to signal the value of trust. The trustee then chooses how much to
return to the investor. We here distinguish two types of investors and two
types of trustees who can learn from each other. While a trustee can be
trustworthy or untrustworthy, an investor could be normal or punishing one. The
latter strategy punishes both untrustworthy trustees and normal investors who
are reluctant to control misbehaving trustees. Importantly, we assume a
hierarchical population where the portion of investors and trustees is fixed.
By means of replicator equation approach, we study the $N$-player trust game
and calculate the level of trust and trustworthiness. We find that the
introduction of punishment can induce a stable coexistence state between
punishing investors and trustworthy trustees. Furthermore, an intermediate
fraction of investors can better promote the evolution of trust when the
punishment intensity is low. For more intensive punishment, however, a higher
fraction of investors can be more efficient to elevate the trust level. In
addition, we reveal that appropriate increase of the punishment intensity can
enlarge the attraction domain of the coexistence state.
","[{'version': 'v1', 'created': 'Mon, 12 Sep 2022 12:12:06 GMT'}]",2022-09-13,"[['Sun', 'Ketian', ''], ['Liu', 'Yang', ''], ['Chen', 'Xiaojie', ''], ['Szolnoki', 'Attila', '']]","['Trust', 'Punishment', 'Hierarchical population']"
9041,2104.11601,Amin Honarmandi Shandiz,"Amin Honarmandi Shandiz, L\'aszl\'o T\'oth, G\'abor Gosztolya,
  Alexandra Mark\'o, Tam\'as G\'abor Csap\'o",Improving Neural Silent Speech Interface Models by Adversarial Training,"11 pages, 3 tables, 2 figures",,10.1007/978-3-030-76346-6_39,,cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Besides the well-known classification task, these days neural networks are
frequently being applied to generate or transform data, such as images and
audio signals. In such tasks, the conventional loss functions like the mean
squared error (MSE) may not give satisfactory results. To improve the
perceptual quality of the generated signals, one possibility is to increase
their similarity to real signals, where the similarity is evaluated via a
discriminator network. The combination of the generator and discriminator nets
is called a Generative Adversarial Network (GAN). Here, we evaluate this
adversarial training framework in the articulatory-to-acoustic mapping task,
where the goal is to reconstruct the speech signal from a recording of the
movement of articulatory organs. As the generator, we apply a 3D convolutional
network that gave us good results in an earlier study. To turn it into a GAN,
we extend the conventional MSE training loss with an adversarial loss component
provided by a discriminator network. As for the evaluation, we report various
objective speech quality metrics such as the Perceptual Evaluation of Speech
Quality (PESQ), and the Mel-Cepstral Distortion (MCD). Our results indicate
that the application of the adversarial training loss brings about a slight,
but consistent improvement in all these metrics.
","[{'version': 'v1', 'created': 'Fri, 23 Apr 2021 13:48:21 GMT'}]",2021-06-02,"[['Shandiz', 'Amin Honarmandi', ''], ['Tóth', 'László', ''], ['Gosztolya', 'Gábor', ''], ['Markó', 'Alexandra', ''], ['Csapó', 'Tamás Gábor', '']]","['silent speech interface', 'generative adversarial network', 'adversarial training', 'neural vocoder', 'articulatory-to-acoustic mapping']"
9042,2212.14289,Zaid El Shair,Zaid El-Shair and Samir Rawashdeh,High-temporal-resolution event-based vehicle detection and tracking,"38 pages, 9 figures, 4 tables","Optical Engineering 62(3), 031209 (22 December 2022)",10.1117/1.OE.62.3.031209,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Event-based vision has been rapidly growing in recent years justified by the
unique characteristics it presents such as its high temporal resolutions
(~1us), high dynamic range (>120dB), and output latency of only a few
microseconds. This work further explores a hybrid, multi-modal, approach for
object detection and tracking that leverages state-of-the-art frame-based
detectors complemented by hand-crafted event-based methods to improve the
overall tracking performance with minimal computational overhead. The methods
presented include event-based bounding box (BB) refinement that improves the
precision of the resulting BBs, as well as a continuous event-based object
detection method, to recover missed detections and generate inter-frame
detections that enable a high-temporal-resolution tracking output. The
advantages of these methods are quantitatively verified by an ablation study
using the higher order tracking accuracy (HOTA) metric. Results show
significant performance gains resembled by an improvement in the HOTA from
56.6%, using only frames, to 64.1% and 64.9%, for the event and edge-based mask
configurations combined with the two methods proposed, at the baseline
framerate of 24Hz. Likewise, incorporating these methods with the same
configurations has improved HOTA from 52.5% to 63.1%, and from 51.3% to 60.2%
at the high-temporal-resolution tracking rate of 384Hz. Finally, a validation
experiment is conducted to analyze the real-world single-object tracking
performance using high-speed LiDAR. Empirical evidence shows that our
approaches provide significant advantages compared to using frame-based object
detectors at the baseline framerate of 24Hz and higher tracking rates of up to
500Hz.
","[{'version': 'v1', 'created': 'Thu, 29 Dec 2022 12:45:06 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Jan 2023 07:15:02 GMT'}]",2023-01-03,"[['El-Shair', 'Zaid', ''], ['Rawashdeh', 'Samir', '']]","['event-based vision', 'event cameras', 'object detection', 'object tracking', 'vehicle tracking', 'bounding box refinement.  *Zaid El Shair', 'E-mail zelshair@umich']"
9043,2205.00869,Vytautas Tumas,"Vytautas Tumas, Sean Rivera, Damien Magoni, Radu State",Topology Analysis of the XRP Ledger,"Extended edition, 8 pages. In The 38th ACM/SIGAPP Symposium on
  Applied Computing, March 27 - March 31, 2023, Tallinn, Estonia",,10.1145/3555776.3577611,,cs.CE cs.SI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  XRP Ledger is one of the oldest, well-established blockchains. Despite the
popularity of the XRP Ledger, little is known about its underlying peer-to-peer
network. The structural properties of a network impact its efficiency, security
and robustness. We aim to close the knowledge gap by providing a detailed
analysis of the XRP overlay network.
  In this paper we examine the graph-theoretic properties of the XRP Ledger
peer-to-peer network and its temporal characteristics. We crawl the XRP Ledger
over two months and collect 1,290 unique network snapshots. We uncover a small
group of nodes that act as a networking backbone. In addition, we observe a
high network churn, with a third of the nodes changing every five days. Our
findings have strong implications for the resilience and safety of the XRP
Ledger.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 12:53:09 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Jan 2023 13:04:12 GMT'}]",2023-01-11,"[['Tumas', 'Vytautas', ''], ['Rivera', 'Sean', ''], ['Magoni', 'Damien', ''], ['State', 'Radu', '']]","['Blockchain', 'XRP Ledger', 'Topology Analysis', 'Measurement']"
9044,2011.00379,Jialu Wang,"Jialu Wang, Yang Liu, Caleb Levy",Fair Classification with Group-Dependent Label Noise,"11 pages, 9 tables",,10.1145/3442188.3445915,,cs.LG cs.AI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work examines how to train fair classifiers in settings where training
labels are corrupted with random noise, and where the error rates of corruption
depend both on the label class and on the membership function for a protected
subgroup. Heterogeneous label noise models systematic biases towards particular
groups when generating annotations. We begin by presenting analytical results
which show that naively imposing parity constraints on demographic disparity
measures, without accounting for heterogeneous and group-dependent error rates,
can decrease both the accuracy and the fairness of the resulting classifier.
Our experiments demonstrate these issues arise in practice as well. We address
these problems by performing empirical risk minimization with carefully defined
surrogate loss functions and surrogate constraints that help avoid the pitfalls
introduced by heterogeneous label noise. We provide both theoretical and
empirical justifications for the efficacy of our methods. We view our results
as an important example of how imposing fairness on biased data sets without
proper care can do at least as much harm as it does good.
","[{'version': 'v1', 'created': 'Sat, 31 Oct 2020 22:35:01 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Feb 2021 00:01:56 GMT'}]",2021-02-18,"[['Wang', 'Jialu', ''], ['Liu', 'Yang', ''], ['Levy', 'Caleb', '']]","['machine learning', 'algorithmic fairness', 'learning with noisy andbiased labels']"
9045,1601.05656,Roman Kuznets,Roman Kuznets,Proving Craig and Lyndon Interpolation Using Labelled Sequent Calculi,,,10.1007/978-3-319-48758-8_21,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We have recently presented a general method of proving the fundamental
logical properties of Craig and Lyndon Interpolation (IPs) by induction on
derivations in a wide class of internal sequent calculi, including sequents,
hypersequents, and nested sequents. Here we adapt the method to a more general
external formalism of labelled sequents and provide sufficient criteria on the
Kripke-frame characterization of a logic that guarantee the IPs. In particular,
we show that classes of frames definable by quantifier-free Horn formulas
correspond to logics with the IPs. These criteria capture the modal cube and
the infinite family of transitive Geach logics.
","[{'version': 'v1', 'created': 'Thu, 21 Jan 2016 14:34:16 GMT'}]",2021-10-12,"[['Kuznets', 'Roman', '']]","['Craig interpolation', 'Lyndon interpolation', 'labelled sequents', 'modal logic', 'Geach formulas']"
9046,2208.04259,Alberto Bacchelli,"Enrico Fregnan, Larissa Braz, Marco D'Ambros, G\""ul \c{C}alikli,
  Alberto Bacchelli",First Come First Served: The Impact of File Position on Code Review,"This paper has been accepted at ESEC/FSE '22 (30th ACM Joint European
  Software Engineering Conference and Symposium on the Foundations of Software
  Engineering)",,10.1145/3540250.3549177,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  The most popular code review tools (e.g., Gerrit and GitHub) present the
files to review sorted in alphabetical order. Could this choice or, more
generally, the relative position in which a file is presented bias the outcome
of code reviews? We investigate this hypothesis by triangulating complementary
evidence in a two-step study.
  First, we observe developers' code review activity. We analyze the review
comments pertaining to 219,476 Pull Requests (PRs) from 138 popular Java
projects on GitHub. We found files shown earlier in a PR to receive more
comments than files shown later, also when controlling for possible confounding
factors: e.g., the presence of discussion threads or the lines added in a file.
Second, we measure the impact of file position on defect finding in code
review. Recruiting 106 participants, we conduct an online controlled experiment
in which we measure participants' performance in detecting two unrelated
defects seeded into two different files. Participants are assigned to one of
two treatments in which the position of the defective files is switched. For
one type of defect, participants are not affected by its file's position; for
the other, they have 64% lower odds to identify it when its file is last as
opposed to first. Overall, our findings provide evidence that the relative
position in which files are presented has an impact on code reviews' outcome;
we discuss these results and implications for tool design and code review.
  Data and materials: https://doi.org/10.5281/zenodo.6901285
","[{'version': 'v1', 'created': 'Mon, 8 Aug 2022 16:44:14 GMT'}]",2022-08-09,"[['Fregnan', 'Enrico', ''], ['Braz', 'Larissa', ''], [""D'Ambros"", 'Marco', ''], ['Çalikli', 'Gül', ''], ['Bacchelli', 'Alberto', '']]","['Code Review', 'Controlled Experiment', 'Cognitive Bias']"
9047,2012.01167,Albert Paytaren,Albert V. Paytaren,"Seminar and Training Programs Recommender System for Faculty Members of
  Higher Education Institution",,"International Journal of Computing Sciences Research (ISSN print:
  2546-0552; ISSN online: 2546-115X) Vol. 4, No. 4, pp. 359-369, 2020",10.25147/ijcsr.2017.001.1.43,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  This study aims to develop a personalized Recommender System that helps to
address the problems encountered by the faculty members of Higher Education
Institutions in the selection of Seminar and Training Programs (STP). The
researcher used the Descriptive Developmental Method of research to gather
information relevant to the current problems and challenges encountered and
used these to develop software that addresses the identified challenges. For
the development of the software, the researcher adopted a step-wise approach
defined in the Incremental Developmental Model. The level of acceptance of the
developed system was evaluated by 24 faculty respondents. The level of
acceptance of the developed system was classified into functionality,
reliability, and usability and the study garnered an evaluation score of 4.65,
4.67, and 4.67 respectively. The overall interpretation of the results of the
evaluation is Highly Acceptable. The study created a system that provides
seminars and training program recommendations. The developed recommender system
was rated Highly Acceptable, respondents were very satisfied with the features
of the system and agreed that it was functional, reliable, and usable.
","[{'version': 'v1', 'created': 'Sat, 21 Nov 2020 00:53:51 GMT'}]",2020-12-03,"[['Paytaren', 'Albert V.', '']]","['recommender system', 'seminar and training program', 'collaborative filtering', 'software development   INTRODUCTION']"
9048,2001.00295,Chengkun Lang,"Huiwei Zhou, Shixian Ning, Yunlong Yang, Zhuang Liu, Chengkun Lang,
  Yingyu Lin","Chemical-induced Disease Relation Extraction with Dependency Information
  and Prior Knowledge","Published on Journal of Biomedical Informatics, 13 pages","Journal of Biomedical Informatics, 2018, 84:171-178",10.1016/j.jbi.2018.07.007,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Chemical-disease relation (CDR) extraction is significantly important to
various areas of biomedical research and health care. Nowadays, many
large-scale biomedical knowledge bases (KBs) containing triples about entity
pairs and their relations have been built. KBs are important resources for
biomedical relation extraction. However, previous research pays little
attention to prior knowledge. In addition, the dependency tree contains
important syntactic and semantic information, which helps to improve relation
extraction. So how to effectively use it is also worth studying. In this paper,
we propose a novel convolutional attention network (CAN) for CDR extraction.
Firstly, we extract the shortest dependency path (SDP) between chemical and
disease pairs in a sentence, which includes a sequence of words, dependency
directions, and dependency relation tags. Then the convolution operations are
performed on the SDP to produce deep semantic dependency features. After that,
an attention mechanism is employed to learn the importance/weight of each
semantic dependency vector related to knowledge representations learned from
KBs. Finally, in order to combine dependency information and prior knowledge,
the concatenation of weighted semantic dependency representations and knowledge
representations is fed to the softmax layer for classification. Experiments on
the BioCreative V CDR dataset show that our method achieves comparable
performance with the state-of-the-art systems, and both dependency information
and prior knowledge play important roles in CDR extraction task.
","[{'version': 'v1', 'created': 'Thu, 2 Jan 2020 02:24:53 GMT'}]",2020-01-03,"[['Zhou', 'Huiwei', ''], ['Ning', 'Shixian', ''], ['Yang', 'Yunlong', ''], ['Liu', 'Zhuang', ''], ['Lang', 'Chengkun', ''], ['Lin', 'Yingyu', '']]","['CDR extraction', 'Dependency information', 'Prior knowledge', 'Attention mechanism']"
9049,2208.09027,Xinshun Feng,"Xinshun Feng, Herun Wan, Shangbin Feng, Hongrui Wang, Jun Zhou,
  Qinghua Zheng, Minnan Luo","GraTO: Graph Neural Network Framework Tackling Over-smoothing with
  Neural Architecture Search",accepted at CIKM2022,,10.1145/3511808.3557337,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Current Graph Neural Networks (GNNs) suffer from the over-smoothing problem,
which results in indistinguishable node representations and low model
performance with more GNN layers. Many methods have been put forward to tackle
this problem in recent years. However, existing tackling over-smoothing methods
emphasize model performance and neglect the over-smoothness of node
representations. Additional, different approaches are applied one at a time,
while there lacks an overall framework to jointly leverage multiple solutions
to the over-smoothing challenge. To solve these problems, we propose GraTO, a
framework based on neural architecture search to automatically search for GNNs
architecture. GraTO adopts a novel loss function to facilitate striking a
balance between model performance and representation smoothness. In addition to
existing methods, our search space also includes DropAttribute, a novel scheme
for alleviating the over-smoothing challenge, to fully leverage diverse
solutions. We conduct extensive experiments on six real-world datasets to
evaluate GraTo, which demonstrates that GraTo outperforms baselines in the
over-smoothing metrics and achieves competitive performance in accuracy. GraTO
is especially effective and robust with increasing numbers of GNN layers.
Further experiments bear out the quality of node representations learned with
GraTO and the effectiveness of model architecture. We make cide of GraTo
available at Github (\url{https://github.com/fxsxjtu/GraTO}).
","[{'version': 'v1', 'created': 'Thu, 18 Aug 2022 18:59:25 GMT'}, {'version': 'v2', 'created': 'Sat, 22 Oct 2022 08:57:39 GMT'}]",2022-10-25,"[['Feng', 'Xinshun', ''], ['Wan', 'Herun', ''], ['Feng', 'Shangbin', ''], ['Wang', 'Hongrui', ''], ['Zhou', 'Jun', ''], ['Zheng', 'Qinghua', ''], ['Luo', 'Minnan', '']]","['Neural Architecture Search', 'Over-smoothing', 'Neural Network']"
9050,2107.03564,Junsu Cho,"Junsu Cho, SeongKu Kang, Dongmin Hyun, Hwanjo Yu",Unsupervised Proxy Selection for Session-based Recommender Systems,Accepted to SIGIR 2021,,10.1145/3404835.3462958,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Session-based Recommender Systems (SRSs) have been actively developed to
recommend the next item of an anonymous short item sequence (i.e., session).
Unlike sequence-aware recommender systems where the whole interaction sequence
of each user can be used to model both the short-term interest and the general
interest of the user, the absence of user-dependent information in SRSs makes
it difficult to directly derive the user's general interest from data.
Therefore, existing SRSs have focused on how to effectively model the
information about short-term interest within the sessions, but they are
insufficient to capture the general interest of users. To this end, we propose
a novel framework to overcome the limitation of SRSs, named ProxySR, which
imitates the missing information in SRSs (i.e., general interest of users) by
modeling proxies of sessions. ProxySR selects a proxy for the input session in
an unsupervised manner, and combines it with the encoded short-term interest of
the session. As a proxy is jointly learned with the short-term interest and
selected by multiple sessions, a proxy learns to play the role of the general
interest of a user and ProxySR learns how to select a suitable proxy for an
input session. Moreover, we propose another real-world situation of SRSs where
a few users are logged-in and leave their identifiers in sessions, and a
revision of ProxySR for the situation. Our experiments on real-world datasets
show that ProxySR considerably outperforms the state-of-the-art competitors,
and the proxies successfully imitate the general interest of the users without
any user-dependent information.
","[{'version': 'v1', 'created': 'Thu, 8 Jul 2021 02:03:06 GMT'}]",2021-07-09,"[['Cho', 'Junsu', ''], ['Kang', 'SeongKu', ''], ['Hyun', 'Dongmin', ''], ['Yu', 'Hwanjo', '']]","['Session-based Recommender System', 'Collaborative Filtering', 'Proxy']"
9051,1604.04721,Victor Sanchez-Anguix Dr.,"Juan M. Alberola, Elena Del Val, Victor Sanchez-Anguix, Alberto
  Palomares and Maria Dolores Teruel","An artificial intelligence tool for heterogeneous team formation in the
  classroom",,"Knowledge-Based Systems, 2016",10.1016/j.knosys.2016.02.010,,cs.AI cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, there is increasing interest in the development of teamwork skills
in the educational context. This growing interest is motivated by its
pedagogical effectiveness and the fact that, in labour contexts, enterprises
organize their employees in teams to carry out complex projects. Despite its
crucial importance in the classroom and industry, there is a lack of support
for the team formation process. Not only do many factors influence team
performance, but the problem becomes exponentially costly if teams are to be
optimized. In this article, we propose a tool whose aim it is to cover such a
gap. It combines artificial intelligence techniques such as coalition structure
generation, Bayesian learning, and Belbin's role theory to facilitate the
generation of working groups in an educational context. This tool improves
current state of the art proposals in three ways: i) it takes into account the
feedback of other teammates in order to establish the most predominant role of
a student instead of self-perception questionnaires; ii) it handles uncertainty
with regard to each student's predominant team role; iii) it is iterative since
it considers information from several interactions in order to improve the
estimation of role assignments. We tested the performance of the proposed tool
in an experiment involving students that took part in three different team
activities. The experiments suggest that the proposed tool is able to improve
different teamwork aspects such as team dynamics and student satisfaction.
","[{'version': 'v1', 'created': 'Sat, 16 Apr 2016 10:50:02 GMT'}]",2016-04-19,"[['Alberola', 'Juan M.', ''], ['Del Val', 'Elena', ''], ['Sanchez-Anguix', 'Victor', ''], ['Palomares', 'Alberto', ''], ['Teruel', 'Maria Dolores', '']]","['team formation', 'artificial intelligence', 'Belbin roles', 'computational intelligence']"
9052,2111.05576,Abdulkadir Celikkanat,Abdulkadir \c{C}elikkanat and Fragkiskos D. Malliaros,Topic-aware latent models for representation learning on networks,"This paper is an extension of the previous work [arXiv:1810.06917],
  and it was published in Pattern Recognition Letters journal",Pattern Recognition Letters 144 (2021) pp. 89-96,10.1016/j.patrec.2021.01.006,,cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network representation learning (NRL) methods have received significant
attention over the last years thanks to their success in several graph analysis
problems, including node classification, link prediction, and clustering. Such
methods aim to map each vertex of the network into a low-dimensional space in a
way that the structural information of the network is preserved. Of particular
interest are methods based on random walks; such methods transform the network
into a collection of node sequences, aiming to learn node representations by
predicting the context of each node within the sequence. In this paper, we
introduce TNE, a generic framework to enhance the embeddings of nodes acquired
by means of random walk-based approaches with topic-based information. Similar
to the concept of topical word embeddings in Natural Language Processing, the
proposed model first assigns each node to a latent community with the favor of
various statistical graph models and community detection methods and then
learns the enhanced topic-aware representations. We evaluate our methodology in
two downstream tasks: node classification and link prediction. The experimental
results demonstrate that by incorporating node and community embeddings, we are
able to outperform widely-known baseline NRL models.
","[{'version': 'v1', 'created': 'Wed, 10 Nov 2021 08:52:52 GMT'}]",2021-11-11,"[['Çelikkanat', 'Abdulkadir', ''], ['Malliaros', 'Fragkiskos D.', '']]","['Network representation learning', 'Node embeddings', 'Link prediction', 'Community structure']"
9053,2112.08842,Sebastian Friston,"Sebastian Friston, Ben Congdon, David Swapp, Lisa Izzouzi, Klara
  Brandst\""atter, Daniel Archer, Otto Olkkonen, Felix Thiel, Anthony Steed",Ubiq: A System to Build Flexible Social Virtual Reality Experiences,,,10.1145/3489849.3489871,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While they have long been a subject of academic study, social virtual reality
(SVR) systems are now attracting increasingly large audiences on current
consumer virtual reality systems. The design space of SVR systems is very
large, and relatively little is known about how these systems should be
constructed in order to be usable and efficient. In this paper we present Ubiq,
a toolkit that focuses on facilitating the construction of SVR systems. We
argue for the design strategy of Ubiq and its scope. Ubiq is built on the Unity
platform. It provides core functionality of many SVR systems such as connection
management, voice, avatars, etc. However, its design remains easy to extend. We
demonstrate examples built on Ubiq and how it has been successfully used in
classroom teaching. Ubiq is open source (Apache License) and thus enables
several use cases that commercial systems cannot.
","[{'version': 'v1', 'created': 'Thu, 16 Dec 2021 12:49:06 GMT'}]",2021-12-17,"[['Friston', 'Sebastian', ''], ['Congdon', 'Ben', ''], ['Swapp', 'David', ''], ['Izzouzi', 'Lisa', ''], ['Brandstätter', 'Klara', ''], ['Archer', 'Daniel', ''], ['Olkkonen', 'Otto', ''], ['Thiel', 'Felix', ''], ['Steed', 'Anthony', '']]","['social virtual reality', 'open source', 'networking', 'avatars', 'communication tools']"
9054,2208.04482,Fuyuan Lyu,"Fuyuan Lyu, Xing Tang, Hong Zhu, Huifeng Guo, Yingxue Zhang, Ruiming
  Tang and Xue Liu","OptEmbed: Learning Optimal Embedding Table for Click-through Rate
  Prediction",Accepted by CIKM 2022 Research Track,,10.1145/3511808.3557411,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning embedding table plays a fundamental role in Click-through rate(CTR)
prediction from the view of the model performance and memory usage. The
embedding table is a two-dimensional tensor, with its axes indicating the
number of feature values and the embedding dimension, respectively. To learn an
efficient and effective embedding table, recent works either assign various
embedding dimensions for feature fields and reduce the number of embeddings
respectively or mask the embedding table parameters. However, all these
existing works cannot get an optimal embedding table. On the one hand, various
embedding dimensions still require a large amount of memory due to the vast
number of features in the dataset. On the other hand, decreasing the number of
embeddings usually suffers from performance degradation, which is intolerable
in CTR prediction. Finally, pruning embedding parameters will lead to a sparse
embedding table, which is hard to be deployed. To this end, we propose an
optimal embedding table learning framework OptEmbed, which provides a practical
and general method to find an optimal embedding table for various base CTR
models. Specifically, we propose pruning the redundant embeddings regarding
corresponding features' importance by learnable pruning thresholds.
Furthermore, we consider assigning various embedding dimensions as one single
candidate architecture. To efficiently search the optimal embedding dimensions,
we design a uniform embedding dimension sampling scheme to equally train all
candidate architectures, meaning architecture-related parameters and learnable
thresholds are trained simultaneously in one supernet. We then propose an
evolution search method based on the supernet to find the optimal embedding
dimensions for each field. Experiments on public datasets show that OptEmbed
can learn a compact embedding table which can further improve the model
performance.
","[{'version': 'v1', 'created': 'Tue, 9 Aug 2022 01:09:52 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Sep 2022 15:26:55 GMT'}]",2022-09-07,"[['Lyu', 'Fuyuan', ''], ['Tang', 'Xing', ''], ['Zhu', 'Hong', ''], ['Guo', 'Huifeng', ''], ['Zhang', 'Yingxue', ''], ['Tang', 'Ruiming', ''], ['Liu', 'Xue', '']]","['CTR Prediction', 'Neural Architecture Search', 'Recommendation']"
9055,1908.10608,Michele Ginesi Mr,"Michele Ginesi, Nicola Sansonetto, and Paolo Fiorini",Overcoming Some Drawbacks of Dynamic Movement Primitives,"Published on Robotics and Autonomous Systems,
  https://doi.org/10.1016/j.robot.2021.103844","GINESI, Michele; SANSONETTO, Nicola; FIORINI, Paolo. Overcoming
  some drawbacks of dynamic movement primitives. Robotics and Autonomous
  Systems, 2021, 103844",10.1016/j.robot.2021.103844,,cs.RO cs.NA cs.SY eess.SY math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dynamic Movement Primitives (DMPs) is a framework for learning a
point-to-point trajectory from a demonstration. Despite being widely used, DMPs
still present some shortcomings that may limit their usage in real robotic
applications. Firstly, at the state of the art, mainly Gaussian basis functions
have been used to perform function approximation. Secondly, the adaptation of
the trajectory generated by the DMP heavily depends on the choice of
hyperparameters and the new desired goal position. Lastly, DMPs are a framework
for `one-shot learning', meaning that they are constrained to learn from a
unique demonstration. In this work, we present and motivate a new set of basis
functions to be used in the learning process, showing their ability to
accurately approximate functions while having both analytical and numerical
advantages w.r.t. Gaussian basis functions. Then, we show how to use the
invariance of DMPs w.r.t. affine transformations to make the generalization of
the trajectory robust against both the choice of hyperparameters and new goal
position, performing both synthetic tests and experiments with real robots to
show this increased robustness. Finally, we propose an algorithm to extract a
common behavior from multiple observations, validating it both on a synthetic
dataset and on a dataset obtained by performing a task on a real robot.
","[{'version': 'v1', 'created': 'Wed, 28 Aug 2019 09:37:35 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Feb 2020 16:59:27 GMT'}, {'version': 'v3', 'created': 'Tue, 1 Sep 2020 09:40:19 GMT'}, {'version': 'v4', 'created': 'Tue, 20 Jul 2021 15:13:06 GMT'}]",2022-01-28,"[['Ginesi', 'Michele', ''], ['Sansonetto', 'Nicola', ''], ['Fiorini', 'Paolo', '']]","['Learning from Demonstrations', 'Motion and Path Planning', 'Kinematics', 'Dynamic Movement Primitives']"
9056,2201.11221,Alejandro D\'iaz-Caro,Alejandro D\'iaz-Caro and Gilles Dowek,Linear lambda-calculus is linear,27 pages,"(FSCD 2022) LIPIcs 228:21, 2022",10.4230/LIPIcs.FSCD.2022.21,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove a linearity theorem for an extension of linear logic with addition
and multiplication by a scalar: the proofs of some propositions in this logic
are linear in the algebraic sense. This work is part of a wider research
program that aims at defining a logic whose proof language is a quantum
programming language.
","[{'version': 'v1', 'created': 'Wed, 26 Jan 2022 22:48:04 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Feb 2022 16:45:51 GMT'}, {'version': 'v3', 'created': 'Wed, 20 Apr 2022 15:19:40 GMT'}]",2022-09-16,"[['Díaz-Caro', 'Alejandro', ''], ['Dowek', 'Gilles', '']]","['Proof theory', 'Lambda calculus', 'Linear logic', 'Quantum computing']"
9057,2204.06319,Yihao Chen,Yihao Chen and Yongxing Shen,"A ""parallel universe"" scheme for crack nucleation in the phase field
  approach to fracture",,,10.1016/j.cma.2022.115708,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  Crack nucleation is crucial in many industrial applications. The phase field
method for fracture transforms the crack nucleation problem into a minimization
problem of the sum of the elastic potential energy and the crack surface
energy. Due to the polyconvexity of the formulation, starting from a crackless
solid, a standard Newton iteration may lead to a solution with no crack, even
though a cracked solution has a lower total energy. As such, the critical load
for cracking is highly overestimated. Here, we propose an algorithm termed
""parallel universe"" algorithm to capture the global minimum. This algorithm has
two key ingredients: (a) a necessary condition for cracking solely based on the
current crackless solution, and (b) beginning from when this condition is met,
Newton iteration with two initial guesses, a crackles one and a cracked one,
will both be performed and the converged candidate solution with lower energy
is accepted as the solution at that load step. Once the cracked candidate
solution is accepted, the crackless one is discarded, i.e., only one universe
is retained. This cracked initial guess is obtained only once for all load
steps by solving a series of similar minimization problems with a progressively
reduced critical crack energy release rate. Numerical examples with isotropic
and anisotropic critical crack energy release rates indicate that the proposed
algorithm is more reliable (as there is no need to retrace) and more efficient
than the standard Newton iteration and a well-known backtracking algorithm.
","[{'version': 'v1', 'created': 'Tue, 12 Apr 2022 06:20:55 GMT'}]",2022-11-30,"[['Chen', 'Yihao', ''], ['Shen', 'Yongxing', '']]","['Phase field for fracture', 'Global minimization', 'Crack nucleation', 'Newton method']"
9058,2101.01874,Majid Harouni,"Mina Mohammadi Dashti, Majid Harouni",Smile and Laugh Expressions Detection Based on Local Minimum Key Points,"20 pages, in Farsi, 11 figures, 7 tables, 21 equations, journal, 2
  authors",,10.29252/jsdp.15.2.69,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this paper, a smile and laugh facial expression is presented based on
dimension reduction and description process of the key points. The paper has
two main objectives; the first is to extract the local critical points in terms
of their apparent features, and the second is to reduce the system's dependence
on training inputs. To achieve these objectives, three different scenarios on
extracting the features are proposed. First of all, the discrete parts of a
face are detected by local binary pattern method that is used to extract a set
of global feature vectors for texture classification considering various
regions of an input-image face. Then, in the first scenario and with respect to
the correlation changes of adjacent pixels on the texture of a mouth area, a
set of local key points are extracted using the Harris corner detector. In the
second scenario, the dimension reduction of the extracted points of first
scenario provided by principal component analysis algorithm leading to
reduction in computational costs and overall complexity without loss of
performance and flexibility, etc.
","[{'version': 'v1', 'created': 'Wed, 6 Jan 2021 05:13:11 GMT'}]",2021-01-07,"[['Dashti', 'Mina Mohammadi', ''], ['Harouni', 'Majid', '']]","['Local key points extraction', 'facial expression detection', 'corner detector', 'descriptor algorithm', 'dimension reduction']"
9059,1907.00631,Sebastian Ochmann,"Sebastian Ochmann, Richard Vock, Reinhard Klein","Automatic reconstruction of fully volumetric 3D building models from
  point clouds","Preprint submitted to ISPRS Journal of Photogrammetry and Remote
  Sensing. Final version available at
  https://doi.org/10.1016/j.isprsjprs.2019.03.017","ISPRS Journal of Photogrammetry and Remote Sensing, Volume 151,
  May 2019, Pages 251-262",10.1016/j.isprsjprs.2019.03.017,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a novel method for reconstructing parametric, volumetric,
multi-story building models from unstructured, unfiltered indoor point clouds
by means of solving an integer linear optimization problem. Our approach
overcomes limitations of previous methods in several ways: First, we drop
assumptions about the input data such as the availability of separate scans as
an initial room segmentation. Instead, a fully automatic room segmentation and
outlier removal is performed on the unstructured point clouds. Second,
restricting the solution space of our optimization approach to arrangements of
volumetric wall entities representing the structure of a building enforces a
consistent model of volumetric, interconnected walls fitted to the observed
data instead of unconnected, paper-thin surfaces. Third, we formulate the
optimization as an integer linear programming problem which allows for an exact
solution instead of the approximations achieved with most previous techniques.
Lastly, our optimization approach is designed to incorporate hard constraints
which were difficult or even impossible to integrate before. We evaluate and
demonstrate the capabilities of our proposed approach on a variety of complex
real-world point clouds.
","[{'version': 'v1', 'created': 'Mon, 1 Jul 2019 09:51:04 GMT'}]",2019-07-02,"[['Ochmann', 'Sebastian', ''], ['Vock', 'Richard', ''], ['Klein', 'Reinhard', '']]","['Indoor Building Reconstruction', 'Point Cloud Processing', 'IntegerLinear Programming', 'Building Information Modeling']"
9060,2107.08480,Viet-Dung Nguyen,"Viet Dung Nguyen, Ba Thai Pham, Phan Thuan Do","Efficient algorithms for maximum induced matching problem in permutation
  and trapezoid graphs",,"Fundamenta Informaticae, Volume 182, Issue 3 (November 18, 2021)
  fi:8685",10.3233/FI-2021-2073,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We first design an $\mathcal{O}(n^2)$ solution for finding a maximum induced
matching in permutation graphs given their permutation models, based on a
dynamic programming algorithm with the aid of the sweep line technique. With
the support of the disjoint-set data structure, we improve the complexity to
$\mathcal{O}(m + n)$. Consequently, we extend this result to give an
$\mathcal{O}(m + n)$ algorithm for the same problem in trapezoid graphs. By
combining our algorithms with the current best graph identification algorithms,
we can solve the MIM problem in permutation and trapezoid graphs in linear and
$\mathcal{O}(n^2)$ time, respectively. Our results are far better than the best
known $\mathcal{O}(mn)$ algorithm for the maximum induced matching problem in
both graph classes, which was proposed by Habib et al.
","[{'version': 'v1', 'created': 'Sun, 18 Jul 2021 15:53:32 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Nov 2021 02:19:50 GMT'}]",2021-12-11,"[['Nguyen', 'Viet Dung', ''], ['Pham', 'Ba Thai', ''], ['Do', 'Phan Thuan', '']]","['permutation graph', 'trapezoid graph', 'induced matching', 'sweep line', 'disjoint set']"
9061,2010.03957,Nicholas Geneva,"Nicholas Geneva, Nicholas Zabaras",Transformers for Modeling Physical Systems,"22 pages, 14 figures, 3 appendices","Neural Networks; Volume 146, February 2022, Pages 272-289",10.1016/j.neunet.2021.11.022,,cs.LG physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transformers are widely used in natural language processing due to their
ability to model longer-term dependencies in text. Although these models
achieve state-of-the-art performance for many language related tasks, their
applicability outside of the natural language processing field has been
minimal. In this work, we propose the use of transformer models for the
prediction of dynamical systems representative of physical phenomena. The use
of Koopman based embeddings provide a unique and powerful method for projecting
any dynamical system into a vector representation which can then be predicted
by a transformer. The proposed model is able to accurately predict various
dynamical systems and outperform classical methods that are commonly used in
the scientific machine learning literature.
","[{'version': 'v1', 'created': 'Sun, 4 Oct 2020 20:27:22 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Nov 2020 21:31:11 GMT'}, {'version': 'v3', 'created': 'Tue, 19 Jan 2021 02:25:11 GMT'}, {'version': 'v4', 'created': 'Thu, 11 Feb 2021 16:32:00 GMT'}, {'version': 'v5', 'created': 'Tue, 8 Jun 2021 20:18:19 GMT'}, {'version': 'v6', 'created': 'Mon, 13 Dec 2021 21:27:40 GMT'}]",2021-12-15,"[['Geneva', 'Nicholas', ''], ['Zabaras', 'Nicholas', '']]","['Transformers', 'Deep Learning', 'Self-Attention', 'Physics', 'Koopman', 'Surrogate Modeling']"
9062,2011.11716,Pingakshya Goswami,Pingakshya Goswami and Dinesh Bhatia,"Automated Floorplanning for Partially Reconfigurable Designs on
  Heterogenrous FPGAs","This paper was accepted as a poster in ACM SIGDA International
  Symposium on FPGA, 2016",,10.1145/2847263.2847323,,cs.AR,http://creativecommons.org/licenses/by-sa/4.0/,"  Floorplanning problem has been extensively explored for homogeneous FPGAs.
Most modern FPGAs consist of heterogeneous resources in the form of
configurable logic blocks, DSP blocks, BRAMs and more. Very little work has
been done for heterogeneous FPGAs. In addition, features like partial
reconfigurability allow on-the-fly changes to the executable design that can
result in enhanced performance and very efficient utilization of resources. In
this paper, we have designed a floorplanner for Partially Reconfigurable (PR)
designs in FPGA that smartly decides one of the three proposed resource
allocation schemes to floorplan a particular type of reconfigurable region. We
also propose a White Space Detection algorithm for efficient management of
white space inside an FPGA in order to reduce the area and the wire length. The
floorplanner is demonstrated on Xilinx Virtex 5 and Artix 7 FPGA architectures
and can be easily integrated with existing vendor-supplied Place and Route
tools. The main objective of the floorplanner is to reduce the wire length,
minimize wasted resources and the area. The performance of our floorplanner is
evaluated using MCNC benchmarks. We have compared our proposed floorplanner
with other previously published results reported in the literature. We observe
a substantial improvement in the overall wire length as well as the execution
time. Also, the floorplanner was integrated with vendor supplied place and
route tools (Xilinx Vivado) to automate the floorplanning flow. The automation
process was tested on a partially reconfigurable median filter used in image
processing applications.
","[{'version': 'v1', 'created': 'Mon, 23 Nov 2020 20:41:03 GMT'}]",2020-11-25,"[['Goswami', 'Pingakshya', ''], ['Bhatia', 'Dinesh', '']]","['Heterogeneous FPGA', 'Floorplanning', 'Partial Reconfiguration']"
9063,2202.09662,Farshid Faal,"Farshid Faal, Ketra Schmitt and Jia Yuan Yu","Reward Modeling for Mitigating Toxicity in Transformer-based Language
  Models",,,10.1007/s10489-022-03944-z,,cs.CL cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Transformer-based language models are able to generate fluent text and be
efficiently adapted across various natural language generation tasks. However,
language models that are pretrained on large unlabeled web text corpora have
been shown to suffer from degenerating toxic content and social bias behaviors,
consequently hindering their safe deployment. Various detoxification methods
were proposed to mitigate the language model's toxicity; however, these methods
struggled to detoxify language models when conditioned on prompts that contain
specific social identities related to gender, race, or religion. In this study,
we propose Reinforce-Detoxify; A reinforcement learning-based method for
mitigating toxicity in language models. We address the challenge of safety in
language models and propose a new reward model that is able to detect toxic
content and mitigate unintended bias towards social identities in toxicity
prediction. The experiments demonstrate that the Reinforce-Detoxify method for
language model detoxification outperforms existing detoxification approaches in
automatic evaluation metrics, indicating the ability of our approach in
language model detoxification and less prone to unintended bias toward social
identities in generated content.
","[{'version': 'v1', 'created': 'Sat, 19 Feb 2022 19:26:22 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Feb 2022 20:20:33 GMT'}, {'version': 'v3', 'created': 'Thu, 24 Feb 2022 02:07:57 GMT'}, {'version': 'v4', 'created': 'Mon, 28 Feb 2022 15:59:02 GMT'}, {'version': 'v5', 'created': 'Mon, 4 Apr 2022 16:37:43 GMT'}, {'version': 'v6', 'created': 'Wed, 27 Jul 2022 14:37:45 GMT'}]",2022-07-28,"[['Faal', 'Farshid', ''], ['Schmitt', 'Ketra', ''], ['Yu', 'Jia Yuan', '']]","['Language Models', 'Transformers', 'Reinforcement Learning', 'Toxic Language Mitigation', 'Natural LanguageGeneration']"
9064,2101.02496,Manuel Lagunas,"Manuel Lagunas, Ana Serrano, Diego Gutierrez, Belen Masia",The joint role of geometry and illumination on material recognition,"15 pages, 16 figures, Accepted to the Journal of Vision, 2021","Journal of Vision February 2021, Vol.21, 2",10.1167/jov.21.2.2,,cs.CV cs.AI cs.GR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Observing and recognizing materials is a fundamental part of our daily life.
Under typical viewing conditions, we are capable of effortlessly identifying
the objects that surround us and recognizing the materials they are made of.
Nevertheless, understanding the underlying perceptual processes that take place
to accurately discern the visual properties of an object is a long-standing
problem. In this work, we perform a comprehensive and systematic analysis of
how the interplay of geometry, illumination, and their spatial frequencies
affects human performance on material recognition tasks. We carry out
large-scale behavioral experiments where participants are asked to recognize
different reference materials among a pool of candidate samples. In the
different experiments, we carefully sample the information in the frequency
domain of the stimuli. From our analysis, we find significant first-order
interactions between the geometry and the illumination, of both the reference
and the candidates. In addition, we observe that simple image statistics and
higher-order image histograms do not correlate with human performance.
Therefore, we perform a high-level comparison of highly non-linear statistics
by training a deep neural network on material recognition tasks. Our results
show that such models can accurately classify materials, which suggests that
they are capable of defining a meaningful representation of material appearance
from labeled proximal image data. Last, we find preliminary evidence that these
highly non-linear models and humans may use similar high-level factors for
material recognition tasks.
","[{'version': 'v1', 'created': 'Thu, 7 Jan 2021 11:29:52 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Feb 2021 12:35:25 GMT'}]",2021-02-05,"[['Lagunas', 'Manuel', ''], ['Serrano', 'Ana', ''], ['Gutierrez', 'Diego', ''], ['Masia', 'Belen', '']]","['Material recognition', 'Surface geometry', 'Scene illumination', 'Confounding factors', 'Material perception']"
9065,2108.03761,Jimmy Moore,Jimmy Moore and Pascal Goffin and Jason Wiese and Miriah Meyer,"Exploring the Personal Informatics Analysis Gap: ""There's a Lot of
  Bacon""","17 pages, 2 figures, to appear in the TVCG Special Issue on the 2021
  IEEE Visualization Conference (VIS)",,10.1109/TVCG.2021.3114798,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Personal informatics research helps people track personal data for the
purposes of self-reflection and gaining self-knowledge. This field, however,
has predominantly focused on the data collection and insight-generation
elements of self-tracking, with less attention paid to flexible data analysis.
As a result, this inattention has led to inflexible analytic pipelines that do
not reflect or support the diverse ways people want to engage with their data.
This paper contributes a review of personal informatics and visualization
research literature to expose a gap in our knowledge for designing flexible
tools that assist people engaging with and analyzing personal data in personal
contexts, what we call the personal informatics analysis gap. We explore this
gap through a multistage longitudinal study on how asthmatics engage with
personal air quality data, and we report how participants: were motivated by
broad and diverse goals; exhibited patterns in the way they explored their
data; engaged with their data in playful ways; discovered new insights through
serendipitous exploration; and were reluctant to use analysis tools on their
own. These results present new opportunities for visual analysis research and
suggest the need for fundamental shifts in how and what we design when
supporting personal data analysis.
","[{'version': 'v1', 'created': 'Sun, 8 Aug 2021 23:59:03 GMT'}]",2021-10-07,"[['Moore', 'Jimmy', ''], ['Goffin', 'Pascal', ''], ['Wiese', 'Jason', ''], ['Meyer', 'Miriah', '']]","['Personal visualization', 'Personal visual analytics', 'Personal informatics', 'Interview methods']"
9066,1812.09094,Felipe A. Louza,Felipe A. Louza,A Simple Algorithm for Computing the Document Array,,,10.1016/j.ipl.2019.105887,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a simple algorithm for computing the document array given a string
collection and its suffix array as input. Our algorithm runs in linear time
using constant additional space for strings from constant alphabets.
","[{'version': 'v1', 'created': 'Fri, 21 Dec 2018 13:03:06 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Mar 2019 13:54:54 GMT'}, {'version': 'v3', 'created': 'Sat, 2 Nov 2019 18:17:50 GMT'}]",2020-09-10,"[['Louza', 'Felipe A.', '']]","['Document array', 'Text indexing', 'Algorithms']"
9067,2105.14878,Mingjun Zhao,"Mingjun Zhao, Haijiang Wu, Di Niu, Zixuan Wang, Xiaoli Wang",Verdi: Quality Estimation and Error Detection for Bilingual Corpora,Accepted by The Web Conference 2021,,10.1145/3442381.3449931,,cs.CL cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Translation Quality Estimation is critical to reducing post-editing efforts
in machine translation and to cross-lingual corpus cleaning. As a research
problem, quality estimation (QE) aims to directly estimate the quality of
translation in a given pair of source and target sentences, and highlight the
words that need corrections, without referencing to golden translations. In
this paper, we propose Verdi, a novel framework for word-level and
sentence-level post-editing effort estimation for bilingual corpora. Verdi
adopts two word predictors to enable diverse features to be extracted from a
pair of sentences for subsequent quality estimation, including a
transformer-based neural machine translation (NMT) model and a pre-trained
cross-lingual language model (XLM). We exploit the symmetric nature of
bilingual corpora and apply model-level dual learning in the NMT predictor,
which handles a primal task and a dual task simultaneously with weight sharing,
leading to stronger context prediction ability than single-direction NMT
models. By taking advantage of the dual learning scheme, we further design a
novel feature to directly encode the translated target information without
relying on the source context. Extensive experiments conducted on WMT20 QE
tasks demonstrate that our method beats the winner of the competition and
outperforms other baseline methods by a great margin. We further use the
sentence-level scores provided by Verdi to clean a parallel corpus and observe
benefits on both model performance and training efficiency.
","[{'version': 'v1', 'created': 'Mon, 31 May 2021 11:04:13 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Sep 2021 06:11:56 GMT'}]",2021-09-06,"[['Zhao', 'Mingjun', ''], ['Wu', 'Haijiang', ''], ['Niu', 'Di', ''], ['Wang', 'Zixuan', ''], ['Wang', 'Xiaoli', '']]","['Quality Estimation', 'Machine Translation', 'Model-level Dual Learning', 'Bilingual Corpus Filtering']"
9068,1909.03947,Gabriel Laberge,"G. Laberge and S. Shirzad and P. Diehl and H. Kaiser and S. Prudhomme
  and A. Lemoine","Scheduling optimization of parallel linear algebra algorithms using
  Supervised Learning",Accepted at HPCML19,,10.1109/MLHPC49564.2019.00009,,cs.LG cs.DC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linear algebra algorithms are used widely in a variety of domains, e.g
machine learning, numerical physics and video games graphics. For all these
applications, loop-level parallelism is required to achieve high performance.
However, finding the optimal way to schedule the workload between threads is a
non-trivial problem because it depends on the structure of the algorithm being
parallelized and the hardware the executable is run on. In the realm of
Asynchronous Many Task runtime systems, a key aspect of the scheduling problem
is predicting the proper chunk-size, where the chunk-size is defined as the
number of iterations of a for-loop assigned to a thread as one task. In this
paper, we study the applications of supervised learning models to predict the
chunk-size which yields maximum performance on multiple parallel linear algebra
operations using the HPX backend of Blaze's linear algebra library. More
precisely, we generate our training and tests sets by measuring performance of
the application with different chunk-sizes for multiple linear algebra
operations; vector-addition, matrix-vector-multiplication, matrix-matrix
addition and matrix-matrix-multiplication. We compare the use of logistic
regression, neural networks and decision trees with a newly developed decision
tree based model in order to predict the optimal value for chunk-size. Our
results show that classical decision trees and our custom decision tree model
are able to forecast a chunk-size which results in good performance for the
linear algebra operations.
","[{'version': 'v1', 'created': 'Mon, 9 Sep 2019 15:54:35 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Sep 2019 19:10:27 GMT'}]",2020-01-24,"[['Laberge', 'G.', ''], ['Shirzad', 'S.', ''], ['Diehl', 'P.', ''], ['Kaiser', 'H.', ''], ['Prudhomme', 'S.', ''], ['Lemoine', 'A.', '']]","['HPC', 'linear algebra', 'loop-level parallelism', 'supervised learning', 'HPX', 'Blaze', 'AMT']"
9069,2007.00872,Daniel Gonzalez,Daniel J. Gonzalez and H. Harry Asada,"Design of Extra Robotic Legs for Augmenting Human Payload Capabilities
  by Exploiting Singularity and Torque Redistribution",,"2018 IEEE/RSJ International Conference on Intelligent Robots and
  Systems (IROS), Madrid, 2018, pp. 4348-4354",10.1109/IROS.2018.8593506,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the design of a new robotic human augmentation system that will
assist the operator in carrying a heavy payload, reaching and maintaining
difficult postures, and ultimately better performing their job. The Extra
Robotic Legs (XRL) system is worn by the operator and consists of two
articulated robotic legs that move with the operator to bear a heavy payload.
The design was driven by a need to increase the effectiveness of hazardous
material emergency response personnel who are encumbered by their personal
protective equipment (PPE). The legs will ultimately walk, climb stairs, crouch
down, and crawl with the operator while eliminating all external PPE loads on
the operator. The forces involved in the most extreme loading cases were
analyzed to find an effective strategy for reducing actuator loads. The
analysis reveals that the maximum torque is exerted during the transition from
the crawling to standing mode of motion. Peak torques are significantly reduced
by leveraging redundancy in force application resulting from a closed-loop
kinematic chain formed by a particular posture of the XRL. The actuators, power
systems, and transmission elements were designed from the results of these
analyses. Using differential mechanisms to combine the inputs of multiple
actuators into a single degree of freedom, the gear reductions needed to bear
the heavy loads could be kept at a minimum, enabling high bandwidth force
control due to the near-direct-drive transmission. A prototype was fabricated
utilizing the insights gained from these analyses and initial tests indicate
the feasibility of the XRL system.
","[{'version': 'v1', 'created': 'Thu, 2 Jul 2020 04:40:14 GMT'}]",2020-07-03,"[['Gonzalez', 'Daniel J.', ''], ['Asada', 'H. Harry', '']]","['Human Augmentation', 'Supernumerary RoboticLimbs', 'Exoskeletons', 'Mechanism Design', 'Industrial Robotics']"
9070,1401.7076,Dmitry Berdinsky,"Dmitry Berdinsky, Tae-wan Kim, Durkbin Cho, Cesare Bracco, Sutipong
  Kiatpanichgij",Bases of T-meshes and the refinement of hierarchical B-splines,,"Berdinsky D., Kim T., Cho D., Bracco C., Kiatpanichgij S., ""Bases
  of T-meshes and the refinement of hierarchical B-splines"", Computer Methods
  in Applied Mechanics and Engineering 2015, V. 283, pp. 841-855",10.1016/j.cma.2014.09.023,,cs.CG math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider spaces of bivariate splines of bi-degree (m, n)
with maximal order of smoothness over domains associated to a two-dimensional
grid. We define admissible classes of domains for which suitable combinatorial
technique allows us to obtain the dimension of such spline spaces and the
number of tensor-product B-splines acting effectively on these domains.
Following the strategy introduced recently by Giannelli and Juettler, these
results enable us to prove that under certain assumptions about the
configuration of a hierarchical T-mesh the hierarchical B-splines form a basis
of bivariate splines of bi-degree (m, n) with maximal order of smoothness over
this hierarchical T-mesh. In addition, we derive a sufficient condition about
the configuration of a hierarchical T-mesh that ensures a weighted partition of
unity property for hierarchical B-splines with only positive weights.
","[{'version': 'v1', 'created': 'Tue, 28 Jan 2014 03:38:01 GMT'}]",2021-08-18,"[['Berdinsky', 'Dmitry', ''], ['Kim', 'Tae-wan', ''], ['Cho', 'Durkbin', ''], ['Bracco', 'Cesare', ''], ['Kiatpanichgij', 'Sutipong', '']]","['T-mesh', 'spline space', 'local refinement', 'hierarchical B-splines']"
9071,2106.00576,Isaac Dunn,"Isaac Dunn, Hadrien Pouget, Daniel Kroening and Tom Melham",Exposing Previously Undetectable Faults in Deep Neural Networks,"Accepted to the ACM SIGSOFT International Symposium on Software
  Testing and Analysis (ISSTA 2021)",,10.1145/3460319.3464801,,cs.LG cs.CV cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing methods for testing DNNs solve the oracle problem by constraining
the raw features (e.g. image pixel values) to be within a small distance of a
dataset example for which the desired DNN output is known. But this limits the
kinds of faults these approaches are able to detect. In this paper, we
introduce a novel DNN testing method that is able to find faults in DNNs that
other methods cannot. The crux is that, by leveraging generative machine
learning, we can generate fresh test inputs that vary in their high-level
features (for images, these include object shape, location, texture, and
colour). We demonstrate that our approach is capable of detecting deliberately
injected faults as well as new faults in state-of-the-art DNNs, and that in
both cases, existing methods are unable to find these faults.
","[{'version': 'v1', 'created': 'Tue, 1 Jun 2021 15:37:30 GMT'}]",2021-06-02,"[['Dunn', 'Isaac', ''], ['Pouget', 'Hadrien', ''], ['Kroening', 'Daniel', ''], ['Melham', 'Tom', '']]","['Deep Learning', 'Generative Adversarial Networks', 'Robustness']"
9072,2203.03099,Randall Balestriero,"Rudolf H. Riedi, Randall Balestriero, Richard G. Baraniuk",Singular Value Perturbation and Deep Network Optimization,Constr Approx (2022),,10.1007/s00365-022-09601-5,,cs.LG math.SP,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We develop new theoretical results on matrix perturbation to shed light on
the impact of architecture on the performance of a deep network. In particular,
we explain analytically what deep learning practitioners have long observed
empirically: the parameters of some deep architectures (e.g., residual
networks, ResNets, and Dense networks, DenseNets) are easier to optimize than
others (e.g., convolutional networks, ConvNets). Building on our earlier work
connecting deep networks with continuous piecewise-affine splines, we develop
an exact local linear representation of a deep network layer for a family of
modern deep networks that includes ConvNets at one end of a spectrum and
ResNets, DenseNets, and other networks with skip connections at the other. For
regression and classification tasks that optimize the squared-error loss, we
show that the optimization loss surface of a modern deep network is piecewise
quadratic in the parameters, with local shape governed by the singular values
of a matrix that is a function of the local linear representation. We develop
new perturbation results for how the singular values of matrices of this sort
behave as we add a fraction of the identity and multiply by certain diagonal
matrices. A direct application of our perturbation results explains
analytically why a network with skip connections (such as a ResNet or DenseNet)
is easier to optimize than a ConvNet: thanks to its more stable singular values
and smaller condition number, the local loss surface of such a network is less
erratic, less eccentric, and features local minima that are more accommodating
to gradient-based optimization. Our results also shed new light on the impact
of different nonlinear activation functions on a deep network's singular
values, regardless of its architecture.
","[{'version': 'v1', 'created': 'Mon, 7 Mar 2022 02:09:39 GMT'}, {'version': 'v2', 'created': 'Sun, 13 Mar 2022 17:07:14 GMT'}, {'version': 'v3', 'created': 'Tue, 15 Mar 2022 15:24:10 GMT'}, {'version': 'v4', 'created': 'Mon, 5 Dec 2022 14:38:02 GMT'}]",2022-12-06,"[['Riedi', 'Rudolf H.', ''], ['Balestriero', 'Randall', ''], ['Baraniuk', 'Richard G.', '']]","['Deep Learning', 'Optimization Landscape', 'Perturbation Theory', 'Singular Values']"
9073,2007.03809,Saul Johnson,"Saul Johnson and Jo\~ao F. Ferreira and Alexandra Mendes and Julien
  Cordry","Skeptic: Automatic, Justified and Privacy-Preserving Password
  Composition Policy Selection","15 pages, 15 figures, 10 tables",,10.1145/3320269.3384762,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The choice of password composition policy to enforce on a password-protected
system represents a critical security decision, and has been shown to
significantly affect the vulnerability of user-chosen passwords to guessing
attacks. In practice, however, this choice is not usually rigorous or
justifiable, with a tendency for system administrators to choose password
composition policies based on intuition alone. In this work, we propose a novel
methodology that draws on password probability distributions constructed from
large sets of real-world password data which have been filtered according to
various password composition policies. Password probabilities are then
redistributed to simulate different user password reselection behaviours in
order to automatically determine the password composition policy that will
induce the distribution of user-chosen passwords with the greatest uniformity,
a metric which we show to be a useful proxy to measure overall resistance to
password guessing attacks. Further, we show that by fitting power-law equations
to the password probability distributions we generate, we can justify our
choice of password composition policy without any direct access to user
password data. Finally, we present Skeptic---a software toolkit that implements
this methodology, including a DSL to enable system administrators with no
background in password security to compare and rank password composition
policies without resorting to expensive and time-consuming user studies.
Drawing on 205,176,321 pass words across 3 datasets, we lend validity to our
approach by demonstrating that the results we obtain align closely with
findings from a previous empirical study into password composition policy
effectiveness.
","[{'version': 'v1', 'created': 'Tue, 7 Jul 2020 22:12:13 GMT'}]",2020-07-09,"[['Johnson', 'Saul', ''], ['Ferreira', 'João F.', ''], ['Mendes', 'Alexandra', ''], ['Cordry', 'Julien', '']]","['Password composition policy', 'Passwords', 'Password authentication', 'Formal verification', 'Interactive theorem proving']"
9074,1802.02919,Istv\'an M\'odos,"Istv\'an M\'odos, P\v{r}emysl \v{S}\r{u}cha, Roman V\'aclav\'ik, Jan
  Smejkal, Zden\v{e}k Hanz\'alek","Adaptive online scheduling of tasks with anytime property on
  heterogeneous resources",,"I. Modos, P. Sucha, R. Vaclavik, J. Smejkal, and Z. Hanzalek.
  Adaptive online scheduling of tasks with anytime property on heterogeneous
  resources. Computers Operations Research, 76:95 - 117, 2016",10.1016/j.cor.2016.06.008,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  An acceptable response time of a server is an important aspect in many
client-server applications; this is evident in situations in which the server
is overloaded by many computationally intensive requests. In this work, we
consider that the requests, or in this case tasks, generated by the clients are
instances of optimization problems solved by anytime algorithms, i.e. the
quality of the solution increases with the processing time of a task. These
tasks are submitted to the server which schedules them to the available
computational resources where the tasks are processed. To tackle the overload
problem, we propose a scheduling algorithm which combines traditional
scheduling approaches with a quality control heuristic which adjusts the
requested quality of the solutions and thus changes the processing time of the
tasks. Two efficient quality control heuristics are introduced: the first
heuristic sets a global quality for all tasks, whereas the second heuristic
sets the quality for each task independently. Moreover, in practice, the
relationship between the processing time and the quality is not known a priori.
Because it is crucial for scheduling algorithms to know at least the estimation
of these relationships, we propose a general procedure for estimating these
relationships using information obtained from the already executed tasks.
Finally, the performance of the proposed scheduling algorithm is demonstrated
on a real-world problem from the domain of personnel rostering with very good
results.
","[{'version': 'v1', 'created': 'Thu, 8 Feb 2018 15:27:19 GMT'}]",2018-02-09,"[['Módos', 'István', ''], ['Šůcha', 'Přemysl', ''], ['Václavík', 'Roman', ''], ['Smejkal', 'Jan', ''], ['Hanzálek', 'Zdeněk', '']]","['Online scheduling', 'anytime algorithms', 'machine learning', 'adaptive systems']"
9075,2204.12998,Rohit Mehra,"Rohit Mehra, Vibhu Saujanya Sharma, Vikrant Kaulgud, Sanjay Podder,
  Adam P. Burden",Towards a Green Quotient for Software Projects,"2 pages. To be published in the proceedings of 44th International
  Conference on Software Engineering: Software Engineering in Practice Track
  (ICSE-SEIP '22), May 21-29, 2022, Pittsburgh, PA, USA",,10.1145/3510457.3513077,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As sustainability takes center stage across businesses, green and
energy-efficient choices are more crucial than ever. While it is becoming
increasingly evident that software and the software industry are substantial
and rapidly evolving contributors to carbon emissions, there is a dearth of
approaches to create actionable awareness about this during the software
development lifecycle (SDLC). Can software teams comprehend how green are their
projects? Here we provide an industry perspective on why this is a challenging
and worthy problem that needs to be addressed. We also outline an approach to
quickly gauge the ""greenness"" of a software project based on the choices made
across different SDLC dimensions and present the initial encouraging feedback
this approach has received.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2022 15:12:51 GMT'}]",2022-04-28,"[['Mehra', 'Rohit', ''], ['Sharma', 'Vibhu Saujanya', ''], ['Kaulgud', 'Vikrant', ''], ['Podder', 'Sanjay', ''], ['Burden', 'Adam P.', '']]","['Sustainable Software Engineering', 'Green Software', 'Carbon Emissions', 'Software Metrics']"
9076,2101.04086,An Nguyen,"An Nguyen, Stefan Foerstel, Thomas Kittler, Andrey Kurzyukov, Leo
  Schwinn, Dario Zanca, Tobias Hipp, Da Jun Sun, Michael Schrapp, Eva Rothgang,
  Bjoern Eskofier","System Design for a Data-driven and Explainable Customer Sentiment
  Monitor",,IEEE Access 9 (2021): 117140-117152,10.1109/ACCESS.2021.3106791,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The most important goal of customer services is to keep the customer
satisfied. However, service resources are always limited and must be
prioritized. Therefore, it is important to identify customers who potentially
become unsatisfied and might lead to escalations. Today this prioritization of
customers is often done manually. Data science on IoT data (esp. log data) for
machine health monitoring, as well as analytics on enterprise data for customer
relationship management (CRM) have mainly been researched and applied
independently. In this paper, we present a framework for a data-driven decision
support system which combines IoT and enterprise data to model customer
sentiment. Such decision support systems can help to prioritize customers and
service resources to effectively troubleshoot problems or even avoid them. The
framework is applied in a real-world case study with a major medical device
manufacturer. This includes a fully automated and interpretable machine
learning pipeline designed to meet the requirements defined with domain experts
and end users. The overall framework is currently deployed, learns and
evaluates predictive models from terabytes of IoT and enterprise data to
actively monitor the customer sentiment for a fleet of thousands of high-end
medical devices. Furthermore, we provide an anonymized industrial benchmark
dataset for the research community.
","[{'version': 'v1', 'created': 'Mon, 11 Jan 2021 18:29:50 GMT'}]",2022-01-11,"[['Nguyen', 'An', ''], ['Foerstel', 'Stefan', ''], ['Kittler', 'Thomas', ''], ['Kurzyukov', 'Andrey', ''], ['Schwinn', 'Leo', ''], ['Zanca', 'Dario', ''], ['Hipp', 'Tobias', ''], ['Sun', 'Da Jun', ''], ['Schrapp', 'Michael', ''], ['Rothgang', 'Eva', ''], ['Eskofier', 'Bjoern', '']]","['customer service', 'decision support system', 'IoT data', 'explainable']"
9077,1905.00185,Elisa Claire Alem\'an Carre\'on,"Elisa Claire Alem\'an Carre\'on, Hirofumi Nonaka, Toru Hiraoka, Minoru
  Kumano, Takao Ito and Masaharu Hirota",Emotional Contribution Analysis of Online Reviews,,"In proceedings of the 2018 International Conference on Artificial
  Life and Robotics (ICAROB2018). pp. 259 - 362. Beppu, Japan (2018, February
  1-4)",10.5954/ICAROB.2018.OS5-3,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  In response to the constant increase in population and tourism worldwide,
there is a need for the development of cross-language market research tools
that are more cost and time effective than surveys or interviews. Focusing on
the Chinese tourism boom and the hotel industry in Japan, we extracted the most
influential keywords in emotional judgement from Chinese online reviews of
Japanese hotels in the portal site Ctrip. Using an entropy based mathematical
model and a machine learning algorithm, we determined the words that most
closely represent the demands and emotions of this customer base.
","[{'version': 'v1', 'created': 'Wed, 1 May 2019 04:54:41 GMT'}]",2019-05-02,"[['Carreón', 'Elisa Claire Alemán', ''], ['Nonaka', 'Hirofumi', ''], ['Hiraoka', 'Toru', ''], ['Kumano', 'Minoru', ''], ['Ito', 'Takao', ''], ['Hirota', 'Masaharu', '']]","['Entropy', 'Support Vector Machine (SVM)', 'Online Review']"
9078,2106.03673,Karen Levy,"Karen Levy, Kyla Chasalow, Sarah Riley",Algorithms and Decision-Making in the Public Sector,,"Annual Review of Law and Social Science, Vol. 17 (2021)",10.1146/annurev-lawsocsci-041221-023808,,cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This article surveys the use of algorithmic systems to support
decision-making in the public sector. Governments adopt, procure, and use
algorithmic systems to support their functions within several contexts --
including criminal justice, education, and benefits provision -- with important
consequences for accountability, privacy, social inequity, and public
participation in decision-making. We explore the social implications of
municipal algorithmic systems across a variety of stages, including problem
formulation, technology acquisition, deployment, and evaluation. We highlight
several open questions that require further empirical research.
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2021 14:53:04 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Jun 2021 02:33:35 GMT'}]",2021-06-11,"[['Levy', 'Karen', ''], ['Chasalow', 'Kyla', ''], ['Riley', 'Sarah', '']]","['algorithms', 'technology', 'government', 'policy', 'prediction', 'accountability']"
9079,1802.01489,David Burns,"David Burns, Nathan Leung, Michael Hardisty, Cari Whyne, Patrick
  Henry, Stewart McLachlin","Shoulder Physiotherapy Exercise Recognition: Machine Learning the
  Inertial Signals from a Smartwatch",,,10.1088/1361-6579/aacfd9,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Objective: Participation in a physical therapy program is considered one of
the greatest predictors of successful conservative management of common
shoulder disorders. However, adherence to these protocols is often poor and
typically worse for unsupervised home exercise programs. Currently, there are
limited tools available for objective measurement of adherence in the home
setting. The goal of this study was to develop and evaluate the potential for
performing home shoulder physiotherapy monitoring using a commercial
smartwatch.
  Approach: Twenty healthy adult subjects with no prior shoulder disorders
performed seven exercises from an evidence-based rotator cuff physiotherapy
protocol, while 6-axis inertial sensor data was collected from the active
extremity. Within an activity recognition chain (ARC) framework, four
supervised learning algorithms were trained and optimized to classify the
exercises: k-nearest neighbor (k-NN), random forest (RF), support vector
machine classifier (SVC), and a convolutional recurrent neural network (CRNN).
Algorithm performance was evaluated using 5-fold cross-validation stratified
first temporally and then by subject.
  Main Results: Categorical classification accuracy was above 94% for all
algorithms on the temporally stratified cross validation, with the best
performance achieved by the CRNN algorithm (99.4%). The subject stratified
cross validation, which evaluated classifier performance on unseen subjects,
yielded lower accuracies scores again with CRNN performing best (88.9%).
  Significance: This proof of concept study demonstrates the technical
feasibility of a smartwatch device and supervised machine learning approach to
more easily monitor and assess the at-home adherence of shoulder physiotherapy
exercise protocols.
","[{'version': 'v1', 'created': 'Mon, 5 Feb 2018 16:06:09 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Feb 2018 21:56:15 GMT'}]",2018-09-10,"[['Burns', 'David', ''], ['Leung', 'Nathan', ''], ['Hardisty', 'Michael', ''], ['Whyne', 'Cari', ''], ['Henry', 'Patrick', ''], ['McLachlin', 'Stewart', '']]","['Human activity recognition', 'physiotherapy', 'machine learning', 'wearable sensors', 'inertial sensors', 'rotator cuff', 'shoulder']"
9080,2209.06450,Donald Ene,Donald Ene Vincent Ike Anireh,Performance Evaluation of Parallel Algorithms,"4 Pages, 1 figure",,10.14445/23488387/IJCSE-V9I6P102,,cs.DC cs.DS cs.PF,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Evaluating how well a whole system or set of subsystems performs is one of
the primary objectives of performance testing. We can tell via performance
assessment if the architecture implementation meets the design objectives.
Performance evaluations of several parallel algorithms are compared in this
study. Both theoretical and experimental methods are used in performance
assessment as a subdiscipline in computer science. The parallel method
outperforms its sequential counterpart in terms of throughput. The parallel
algorithm's performance (speedup) is examined, as shown in the result.
","[{'version': 'v1', 'created': 'Wed, 14 Sep 2022 06:53:29 GMT'}]",2022-09-15,"[['Anireh', 'Donald Ene Vincent Ike', '']]","['Algorithm', 'Performance', 'Parallel computing', 'Distributed systems.   1']"
9081,2109.03042,Fillipe Santos,"Fillipe Santos, Andre L. L. Aquino, Edmundo R. M. Madeira, and Raquel
  S. Cabral",Temporal complex networks modeling applied to vehicular ad-hoc networks,,Journal of Network and Computer Applications (2021): 103168,10.1016/j.jnca.2021.103168,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  VANETs solutions use aggregated graph representation to model the interaction
among the vehicles and different aggregated complex network measures to
quantify some topological characteristics. This modeling ignores the temporal
interactions between the cars, causing loss of information or unrealistic
behavior. This work proposes the use of both temporal graphs and temporal
measures to model VANETs applications. To verify the viability of this model,
we initially perform a comparative analysis between the temporal and aggregated
modeling considering five different real datasets. This analysis shows that the
aggregated model is inefficient in modeling the temporal aspects of networks.
After that, we perform a network evaluation through a simulation by considering
the impact of temporal modeling applied to the deployment of RSUs. First, we
compare a solution based on our temporal modeling with a greedy algorithm based
on an aggregated model to choose the positions of RSUs. In a scenario with 70
RSUs, we have 77% and 65% of coverage in the temporal and aggregated model
(greedy algorithm), respectively. Second, we evaluate the use of aggregated and
temporal measures applied as features in a genetic algorithm. The approach with
temporal betweenness had the better result with 90% of the coverage area
against 61% of aggregated one applied to the same scenario.
","[{'version': 'v1', 'created': 'Tue, 7 Sep 2021 12:34:30 GMT'}]",2021-09-08,"[['Santos', 'Fillipe', ''], ['Aquino', 'Andre L. L.', ''], ['Madeira', 'Edmundo R. M.', ''], ['Cabral', 'Raquel S.', '']]","['VANETs', 'Complex Networks', 'Temporal Centrality Measures']"
9082,2110.03551,Eric Wieser,"Eric Wieser, Utensil Song",Formalizing Geometric Algebra in Lean,"26 pages. This is the version accepted for publication on 2021-07-22,
  after peer review, in ""Advances in Applied Clifford Algebras"". This is not
  the Version of Record and does not reflect post-acceptance improvements, or
  corrections by the journal. Note that the web version of this article
  provided by the journal has typesetting issues not present here or in the
  journal's PDF","Advances in Applied Clifford Algebras 32, Article 28 (2022)",10.1007/s00006-021-01164-1,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  This paper explores formalizing Geometric (or Clifford) algebras into the
Lean 3 theorem prover, building upon the substantial body of work that is the
Lean mathematics library, mathlib. As we use Lean source code to demonstrate
many of our ideas, we include a brief introduction to the Lean language
targeted at a reader with no prior experience with Lean or theorem provers in
general.
  We formalize the multivectors as the quotient of the tensor algebra by a
suitable relation, which provides the ring structure automatically, then go on
to establish the universal property of the Clifford algebra. We show that this
is quite different to the approach taken by existing formalizations of
Geometric algebra in other theorem provers; most notably, our approach does not
require a choice of basis.
  We go on to show how operations and structure such as involutions, versors,
and the $\mathbb{Z}_2$-grading can be defined using the universal property
alone, and how to recover an induction principle from the universal property
suitable for proving statements about these definitions. We outline the steps
needed to formalize the wedge product and $\mathbb{N}$-grading, and some of the
gaps in mathlib that currently make this challenging.
","[{'version': 'v1', 'created': 'Thu, 7 Oct 2021 15:18:30 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Apr 2022 17:49:09 GMT'}]",2022-04-20,"[['Wieser', 'Eric', ''], ['Song', 'Utensil', '']]","['Geometric Algebra', 'Clifford Algebra', 'Universal property', 'Lean', 'mathlib']"
9083,2104.04990,Raven Beutner,"Raven Beutner, Luke Ong","On Probabilistic Termination of Functional Programs with Continuous
  Distributions",PLDI 2021,,10.1145/3453483.3454111,,cs.PL cs.LO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We study termination of higher-order probabilistic functional programs with
recursion, stochastic conditioning and sampling from continuous distributions.
  Reasoning about the termination probability of programs with continuous
distributions is hard, because the enumeration of terminating executions cannot
provide any non-trivial bounds. We present a new operational semantics based on
traces of intervals, which is sound and complete with respect to the standard
sampling-based semantics, in which (countable) enumeration can provide
arbitrarily tight lower bounds. Consequently we obtain the first proof that
deciding almost-sure termination (AST) for programs with continuous
distributions is $\Pi^0_2$-complete. We also provide a compositional
representation of our semantics in terms of an intersection type system.
  In the second part, we present a method of proving AST for non-affine
programs, i.e., recursive programs that can, during the evaluation of the
recursive body, make multiple recursive calls (of a first-order function) from
distinct call sites. Unlike in a deterministic language, the number of
recursion call sites has direct consequences on the termination probability.
Our framework supports a proof system that can verify AST for programs that are
well beyond the scope of existing methods.
  We have constructed prototype implementations of our method of computing
lower bounds of termination probability, and AST verification.
","[{'version': 'v1', 'created': 'Sun, 11 Apr 2021 10:57:17 GMT'}]",2021-04-13,"[['Beutner', 'Raven', ''], ['Ong', 'Luke', '']]","['almost-sure termination', 'probabilistic programs', 'sampling-style operational semantics', 'intersection types', 'random walk']"
9084,2004.14777,Lambert Leong,"Lambert T. Leong, Sean Wiere","Digit Recognition From Wrist Movements and Security Concerns with Smart
  Wrist Wearable IOT Devices","7 pages, 5 figures, 10 tables, in Proc Hawaii International
  Conference on System Science (HICSS)",,10.24251/HICSS.2020.790,978-0-9981331-3-3,cs.CR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate a potential security vulnerability associated
with wrist wearable devices. Hardware components on common wearable devices
include an accelerometer and gyroscope, among other sensors. We demonstrate
that an accelerometer and gyroscope can pick up enough unique wrist movement
information to identify digits being written by a user. With a data set of 400
writing samples, of either the digit zero or the digit one, we constructed a
machine learning model to correctly identify the digit being written based on
the movements of the wrist. Our model's performance on an unseen test set
resulted in an area under the receiver operating characteristic (AUROC) curve
of 1.00. Loading our model onto our fabricated device resulted in 100% accuracy
when predicting ten writing samples in real-time. The model's ability to
correctly identify all digits via wrist movement and orientation changes raises
security concerns. Our results imply that nefarious individuals may be able to
gain sensitive digit based information such as social security, credit card,
and medical record numbers from wrist wearable devices.
","[{'version': 'v1', 'created': 'Wed, 22 Apr 2020 23:37:38 GMT'}]",2020-05-01,"[['Leong', 'Lambert T.', ''], ['Wiere', 'Sean', '']]","['Mahine Learning', 'Cyber Security', 'Wearables', 'IOT', 'Sensor', 'ArtificialIntelligence']"
9085,2208.12544,Taekeun Yoon,"Taekeun Yoon, Seon Woong Kim, Hosung Byun, Younsik Kim, Campbell D.
  Carter, Hyungrok Do","Deep learning-based denoising for fast time-resolved flame emission
  spectroscopy in high-pressure combustion environment","25 pages, 12 figures, accepted to Combustion and Flame",,10.1016/j.combustflame.2022.112583,Combustion and Flame 248 (2023) 112583,cs.LG eess.SP physics.flu-dyn,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A deep learning strategy is developed for fast and accurate gas property
measurements using flame emission spectroscopy (FES). Particularly, the
short-gated fast FES is essential to resolve fast-evolving combustion
behaviors. However, as the exposure time for capturing the flame emission
spectrum gets shorter, the signal-to-noise ratio (SNR) decreases, and
characteristic spectral features indicating the gas properties become
relatively weaker. Then, the property estimation based on the short-gated
spectrum is difficult and inaccurate. Denoising convolutional neural networks
(CNN) can enhance the SNR of the short-gated spectrum. A new CNN architecture
including a reversible down- and up-sampling (DU) operator and a loss function
based on proper orthogonal decomposition (POD) coefficients is proposed. For
training and testing the CNN, flame chemiluminescence spectra were captured
from a stable methane-air flat flame using a portable spectrometer (spectral
range: 250 - 850 nm, resolution: 0.5 nm) with varied equivalence ratio (0.8 -
1.2), pressure (1 - 10 bar), and exposure time (0.05, 0.2, 0.4, and 2 s). The
long exposure (2 s) spectra were used as the ground truth when training the
denoising CNN. A kriging model with POD is trained by the long-gated spectra
for calibration, and then the prediction of the gas properties taking the
denoised short-gated spectrum as the input: The property prediction errors of
pressure and equivalence ratio were remarkably lowered in spite of the low SNR
attendant with reduced exposure.
","[{'version': 'v1', 'created': 'Fri, 29 Jul 2022 05:33:32 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Dec 2022 00:10:36 GMT'}, {'version': 'v3', 'created': 'Mon, 26 Dec 2022 08:15:07 GMT'}]",2023-01-02,"[['Yoon', 'Taekeun', ''], ['Kim', 'Seon Woong', ''], ['Byun', 'Hosung', ''], ['Kim', 'Younsik', ''], ['Carter', 'Campbell D.', ''], ['Do', 'Hyungrok', '']]","['flame emission spectroscopy', 'chemiluminescence', 'deep learning', 'convolutional']"
9086,2201.10664,Xavier Boix,"Kimberly Villalobos, Vilim \v{S}tih, Amineh Ahmadinejad, Shobhita
  Sundaram, Jamell Dozier, Andrew Francl, Frederico Azevedo, Tomotake Sasaki,
  Xavier Boix",Do Neural Networks for Segmentation Understand Insideness?,,Neural Computation 33 (2021) 2511-2549,10.1162/neco_a_01413,,cs.CV cs.LG q-bio.NC,http://creativecommons.org/licenses/by/4.0/,"  The insideness problem is an aspect of image segmentation that consists of
determining which pixels are inside and outside a region. Deep Neural Networks
(DNNs) excel in segmentation benchmarks, but it is unclear if they have the
ability to solve the insideness problem as it requires evaluating long-range
spatial dependencies. In this paper, the insideness problem is analysed in
isolation, without texture or semantic cues, such that other aspects of
segmentation do not interfere in the analysis. We demonstrate that DNNs for
segmentation with few units have sufficient complexity to solve insideness for
any curve. Yet, such DNNs have severe problems with learning general solutions.
Only recurrent networks trained with small images learn solutions that
generalize well to almost any curve. Recurrent networks can decompose the
evaluation of long-range dependencies into a sequence of local operations, and
learning with small images alleviates the common difficulties of training
recurrent networks with a large number of unrolling steps.
","[{'version': 'v1', 'created': 'Tue, 25 Jan 2022 22:54:41 GMT'}]",2022-01-27,"[['Villalobos', 'Kimberly', ''], ['Štih', 'Vilim', ''], ['Ahmadinejad', 'Amineh', ''], ['Sundaram', 'Shobhita', ''], ['Dozier', 'Jamell', ''], ['Francl', 'Andrew', ''], ['Azevedo', 'Frederico', ''], ['Sasaki', 'Tomotake', ''], ['Boix', 'Xavier', '']]","['Insideness', 'Long-range dependencies', 'Segmentation']"
9087,2205.04181,Xiaokun Zhang,"Xiaokun Zhang, Bo Xu, Liang Yang, Chenliang Li, Fenglong Ma, Haifeng
  Liu, Hongfei Lin","Price DOES Matter! Modeling Price and Interest Preferences in
  Session-based Recommendation",This paper has bee accepted as a conference paper at SIGIR 2022,,10.1145/3477495.3532043,,cs.IR cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Session-based recommendation aims to predict items that an anonymous user
would like to purchase based on her short behavior sequence. The current
approaches towards session-based recommendation only focus on modeling users'
interest preferences, while they all ignore a key attribute of an item, i.e.,
the price. Many marketing studies have shown that the price factor
significantly influences users' behaviors and the purchase decisions of users
are determined by both price and interest preferences simultaneously. However,
it is nontrivial to incorporate price preferences for session-based
recommendation. Firstly, it is hard to handle heterogeneous information from
various features of items to capture users' price preferences. Secondly, it is
difficult to model the complex relations between price and interest preferences
in determining user choices.
  To address the above challenges, we propose a novel method Co-guided
Heterogeneous Hypergraph Network (CoHHN) for session-based recommendation.
Towards the first challenge, we devise a heterogeneous hypergraph to represent
heterogeneous information and rich relations among them. A dual-channel
aggregating mechanism is then designed to aggregate various information in the
heterogeneous hypergraph. After that, we extract users' price preferences and
interest preferences via attention layers. As to the second challenge, a
co-guided learning scheme is designed to model the relations between price and
interest preferences and enhance the learning of each other. Finally, we
predict user actions based on item features and users' price and interest
preferences. Extensive experiments on three real-world datasets demonstrate the
effectiveness of the proposed CoHHN. Further analysis reveals the significance
of price for session-based recommendation.
","[{'version': 'v1', 'created': 'Mon, 9 May 2022 10:47:15 GMT'}]",2022-05-10,"[['Zhang', 'Xiaokun', ''], ['Xu', 'Bo', ''], ['Yang', 'Liang', ''], ['Li', 'Chenliang', ''], ['Ma', 'Fenglong', ''], ['Liu', 'Haifeng', ''], ['Lin', 'Hongfei', '']]","['Session-based recommendation', 'Price preferences', 'Interest preferences', 'Heterogeneous hypergraph network', 'Co-guided learning']"
9088,2111.06840,Luiz Capretz Dr.,"Sonia Meskini, Ali Bou Nassif, Luiz Fernando Capretz",Reliability Models for Smartphone Applications,"25 pages. arXiv admin note: substantial text overlap with
  arXiv:1910.02452","5th Computational Methods in Systems and Software (CoMeSySo 2021),
  Lecture Notes in Networks and Systems (LNNS 232), pp. 1-25, Springer Nature
  Switzerland AG, October 2021",10.1007/978-3-030-90318-3_31,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smartphones have become the most used electronic devices. They carry out most
of the functionalities of desktops, offering various useful applications that
suit the users needs. Therefore, instead of the operator, the user has been the
main controller of the device and its applications, therefore its reliability
has become an emergent requirement. As a first step, based on collected
smartphone applications failure data, we investigated and evaluated the
efficacy of Software Reliability Growth Models (SRGMs) when applied to these
smartphone data in order to check whether they achieve the same accuracy as in
the desktop/laptop area. None of the selected models were able to account for
the smartphone data satisfactorily. Their failure is traced back to: (i) the
hardware and software differences between desktops and smartphones, (ii) the
specific features of mobile applications compared to desktop applications, and
(iii) the different operational conditions and usage profiles. Thus, a
reliability model suited to smartphone applications is still needed. In the
second step, we applied the Weibull and Gamma distributions, and their two
particular cases, Rayleigh and S-Shaped, to model the smartphone failure data
sorted by application version number and grouped into different time periods.
An estimation of the expected number of defects in each application version was
obtained. The performances of the distributions were then compared amongst each
other. We found that both Weibull and Gamma distributions can fit the failure
data of mobile applications, although the Gamma distribution is frequently more
suited.
","[{'version': 'v1', 'created': 'Fri, 12 Nov 2021 17:54:34 GMT'}]",2021-11-15,"[['Meskini', 'Sonia', ''], ['Nassif', 'Ali Bou', ''], ['Capretz', 'Luiz Fernando', '']]","['Smartphone Applications', 'Software Reliability', 'NHPP Model', 'SGRM Model', 'Software Reliability Growth Models']"
9089,2301.04130,Yevhen Zolotavkin,"Yevhen Zolotavkin, Yurii Baryshev, Vitalii Lukichov, Jannik M\""ahn,
  Stefan K\""opsell",Improving unlinkability in C-ITS: a methodology for optimal obfuscation,13 pages,,10.6084/m9.figshare.21830418,,cs.CR cs.GT cs.IT math.IT,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we develop a new methodology to provide high assurance about
privacy in Cooperative Intelligent Transport Systems (C-ITS). Our focus lies on
vehicle-to-everything (V2X) communications enabled by Cooperative Awareness
Basic Service. Our research motivation is developed based on the analysis of
unlinkability provision methods indicating a gap. To address this, we propose a
Hidden Markov Model (HMM) to express unlinkability for the situation where two
cars are communicating with a Roadside Unit (RSU) using Cooperative Awareness
Messages (CAMs). Our HMM has labeled states specifying distinct origins of the
CAMs observable by a passive attacker. We then demonstrate that a high
assurance about the degree of uncertainty (e.g., entropy) about labeled states
can be obtained for the attacker under the assumption that he knows actual
positions of the vehicles (e.g., hidden states in HMM). We further demonstrate
how unlinkability can be increased in C-ITS: we propose a joint probability
distribution that both drivers must use to obfuscate their actual data jointly.
This obfuscated data is then encapsulated in their CAMs. Finally, our findings
are incorporated into an obfuscation algorithm whose complexity is linear in
the number of discrete time steps in HMM.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2023 18:53:50 GMT'}]",2023-01-11,"[['Zolotavkin', 'Yevhen', ''], ['Baryshev', 'Yurii', ''], ['Lukichov', 'Vitalii', ''], ['Mähn', 'Jannik', ''], ['Köpsell', 'Stefan', '']]","['privacy', 'V2X', 'unlinkability', 'hidden Markov model', 'cybersecurity', 'entropy', 'obfuscation']"
9090,1811.06655,Thomas Beckers,"Thomas Beckers, Jonas Umlauft, Sandra Hirche","Stable Model-based Control with Gaussian Process Regression for Robot
  Manipulators",Please cite the conference paper,"IFAC-PapersOnLine, Volume 50, Issue 1, 2017, Pages 3877-3884",10.1016/j.ifacol.2017.08.359,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computed-torque control requires a very precise dynamical model of the robot
for compensating the manipulator dynamics. This allows reduction of the
controller's feedback gains resulting in disturbance attenuation and other
advantages. Finding precise models for manipulators is often difficult with
parametric approaches, e.g. in the presence of complex friction or flexible
links. Therefore, we propose a novel computed-torque control law which consists
of a PD feedback and a dynamic feed forward compensation part with Gaussian
Processes. For this purpose, the nonparametric Gaussian Process regression
infers the difference between an estimated and the true dynamics. In contrast
to other approaches, we can guarantee that the tracking error is stochastically
bounded. Furthermore, if the number of training points tends to infinity, the
tracking error is asymptotically stable in the large. In simulation and with an
experiment, we demonstrate the applicability of the proposed control law and
that it outperforms classical computed-torque approaches in terms of tracking
precision.
","[{'version': 'v1', 'created': 'Fri, 16 Nov 2018 02:19:49 GMT'}]",2018-11-19,"[['Beckers', 'Thomas', ''], ['Umlauft', 'Jonas', ''], ['Hirche', 'Sandra', '']]","['Stochastic control', 'Stability of nonlinear systems', 'Data-based controlNonparametric methods', 'Adaptive system and control', 'robotic manipulators']"
9091,1810.00551,Hazrat Ali,"Talha Iqbal, Hazrat Ali",Generative Adversarial Network for Medical Images (MI-GAN),Journal of Medical Systems,Med Syst (2018) 42: 231,10.1007/s10916-018-1072-9,,cs.LG cs.CV eess.IV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning algorithms produces state-of-the-art results for different
machine learning and computer vision tasks. To perform well on a given task,
these algorithms require large dataset for training. However, deep learning
algorithms lack generalization and suffer from over-fitting whenever trained on
small dataset, especially when one is dealing with medical images. For
supervised image analysis in medical imaging, having image data along with
their corresponding annotated ground-truths is costly as well as time consuming
since annotations of the data is done by medical experts manually. In this
paper, we propose a new Generative Adversarial Network for Medical Imaging
(MI-GAN). The MI-GAN generates synthetic medical images and their segmented
masks, which can then be used for the application of supervised analysis of
medical images. Particularly, we present MI-GAN for synthesis of retinal
images. The proposed method generates precise segmented images better than the
existing techniques. The proposed model achieves a dice coefficient of 0.837 on
STARE dataset and 0.832 on DRIVE dataset which is state-of-the-art performance
on both the datasets.
","[{'version': 'v1', 'created': 'Mon, 1 Oct 2018 06:59:37 GMT'}]",2019-04-03,"[['Iqbal', 'Talha', ''], ['Ali', 'Hazrat', '']]","['GAN', 'medical imaging', 'style transfer', 'deep learning', 'retinalimages']"
9092,2108.08876,Jianing Song,"Jianing Song, Duarte Rondao, Nabil Aouf",Deep Learning-based Spacecraft Relative Navigation Methods: A Survey,"41 pages; 17 figures; Submitted to Acta Astronautica, under review",,10.1016/j.actaastro.2021.10.025,,cs.RO cs.AI cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autonomous spacecraft relative navigation technology has been planned for and
applied to many famous space missions. The development of on-board electronics
systems has enabled the use of vision-based and LiDAR-based methods to achieve
better performances. Meanwhile, deep learning has reached great success in
different areas, especially in computer vision, which has also attracted the
attention of space researchers. However, spacecraft navigation differs from
ground tasks due to high reliability requirements but lack of large datasets.
This survey aims to systematically investigate the current deep learning-based
autonomous spacecraft relative navigation methods, focusing on concrete orbital
applications such as spacecraft rendezvous and landing on small bodies or the
Moon. The fundamental characteristics, primary motivations, and contributions
of deep learning-based relative navigation algorithms are first summarised from
three perspectives of spacecraft rendezvous, asteroid exploration, and terrain
navigation. Furthermore, popular visual tracking benchmarks and their
respective properties are compared and summarised. Finally, potential
applications are discussed, along with expected impediments.
","[{'version': 'v1', 'created': 'Thu, 19 Aug 2021 18:54:19 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Oct 2021 09:31:08 GMT'}]",2021-11-24,"[['Song', 'Jianing', ''], ['Rondao', 'Duarte', ''], ['Aouf', 'Nabil', '']]","['Deep learning', 'Space relative navigation', 'Terrain navigation', 'Asteroid exploration']"
9093,2107.07040,Yongming Liu,Zhiming Zhang and Yongming Liu,"Parsimony-Enhanced Sparse Bayesian Learning for Robust Discovery of
  Partial Differential Equations",arXiv admin note: text overlap with arXiv:2102.06504,,10.1016/j.ymssp.2022.108833,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robust physics discovery is of great interest for many scientific and
engineering fields. Inspired by the principle that a representative model is
the one simplest possible, a new model selection criteria considering both
model's Parsimony and Sparsity is proposed. A Parsimony Enhanced Sparse
Bayesian Learning (PeSBL) method is developed for discovering the governing
Partial Differential Equations (PDEs) of nonlinear dynamical systems. Compared
with the conventional Sparse Bayesian Learning (SBL) method, the PeSBL method
promotes parsimony of the learned model in addition to its sparsity. In this
method, the parsimony of model terms is evaluated using their locations in the
prescribed candidate library, for the first time, considering the increased
complexity with the power of polynomials and the order of spatial derivatives.
Subsequently, the model parameters are updated through Bayesian inference with
the raw data. This procedure aims to reduce the error associated with the
possible loss of information in data preprocessing and numerical
differentiation prior to sparse regression. Results of numerical case studies
indicate that the governing PDEs of many canonical dynamical systems can be
correctly identified using the proposed PeSBL method from highly noisy data (up
to 50% in the current study). Next, the proposed methodology is extended for
stochastic PDE learning where all parameters and modeling error are considered
as random variables. Hierarchical Bayesian Inference (HBI) is integrated with
the proposed framework for stochastic PDE learning from a population of
observations. Finally, the proposed PeSBL is demonstrated for system response
prediction with uncertainties and anomaly diagnosis. Codes of all demonstrated
examples in this study are available on the website: https://github.com/ymlasu.
","[{'version': 'v1', 'created': 'Thu, 8 Jul 2021 00:56:11 GMT'}]",2022-03-02,"[['Zhang', 'Zhiming', ''], ['Liu', 'Yongming', '']]","['physics discovery', 'partial differential equation', 'sparse Bayesian learning', 'parsimony', 'uncertainty']"
9094,1710.04623,Sibel Tari,Venera Adanova and Sibel Tari,"Analysis of planar ornament patterns via motif asymmetry assumption and
  local connections",,,10.1007/s10851-018-0835-8,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Planar ornaments, a.k.a. wallpapers, are regular repetitive patterns which
exhibit translational symmetry in two independent directions. There are exactly
$17$ distinct planar symmetry groups. We present a fully automatic method for
complete analysis of planar ornaments in $13$ of these groups, specifically,
the groups called $p6m, \, p6, \, p4g, \,p4m, \,p4, \, p31m, \,p3m, \, p3, \,
cmm, \, pgg, \, pg, \, p2$ and $p1$. Given the image of an ornament fragment,
we present a method to simultaneously classify the input into one of the $13$
groups and extract the so called fundamental domain (FD), the minimum region
that is sufficient to reconstruct the entire ornament. A nice feature of our
method is that even when the given ornament image is a small portion such that
it does not contain multiple translational units, the symmetry group as well as
the fundamental domain can still be defined. This is because, in contrast to
common approach, we do not attempt to first identify a global translational
repetition lattice. Though the presented constructions work for quite a wide
range of ornament patterns, a key assumption we make is that the perceivable
motifs (shapes that repeat) alone do not provide clues for the underlying
symmetries of the ornament. In this sense, our main target is the planar
arrangements of asymmetric interlocking shapes, as in the symmetry art of
Escher.
","[{'version': 'v1', 'created': 'Thu, 12 Oct 2017 17:19:06 GMT'}]",2018-10-30,"[['Adanova', 'Venera', ''], ['Tari', 'Sibel', '']]","['ornaments', 'wallpaper groups', 'mosaics', 'regular patterns', 'Escher style planar patterns']"
9095,1709.09075,Kaisar Kushibar,"Kaisar Kushibar, Sergi Valverde, Sandra Gonzalez-Villa, Jose Bernal,
  Mariano Cabezas, Arnau Oliver, Xavier Llado","Automated sub-cortical brain structure segmentation combining spatial
  and deep convolutional features",,,10.1016/j.media.2018.06.006,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sub-cortical brain structure segmentation in Magnetic Resonance Images (MRI)
has attracted the interest of the research community for a long time because
morphological changes in these structures are related to different
neurodegenerative disorders. However, manual segmentation of these structures
can be tedious and prone to variability, highlighting the need for robust
automated segmentation methods. In this paper, we present a novel convolutional
neural network based approach for accurate segmentation of the sub-cortical
brain structures that combines both convolutional and prior spatial features
for improving the segmentation accuracy. In order to increase the accuracy of
the automated segmentation, we propose to train the network using a restricted
sample selection to force the network to learn the most difficult parts of the
structures. We evaluate the accuracy of the proposed method on the public
MICCAI 2012 challenge and IBSR 18 datasets, comparing it with different
available state-of-the-art methods and other recently proposed deep learning
approaches. On the MICCAI 2012 dataset, our method shows an excellent
performance comparable to the best challenge participant strategy, while
performing significantly better than state-of-the-art techniques such as
FreeSurfer and FIRST. On the IBSR 18 dataset, our method also exhibits a
significant increase in the performance with respect to not only FreeSurfer and
FIRST, but also comparable or better results than other recent deep learning
approaches. Moreover, our experiments show that both the addition of the
spatial priors and the restricted sampling strategy have a significant effect
on the accuracy of the proposed method. In order to encourage the
reproducibility and the use of the proposed method, a public version of our
approach is available to download for the neuroimaging community.
","[{'version': 'v1', 'created': 'Tue, 26 Sep 2017 15:02:16 GMT'}]",2018-11-15,"[['Kushibar', 'Kaisar', ''], ['Valverde', 'Sergi', ''], ['Gonzalez-Villa', 'Sandra', ''], ['Bernal', 'Jose', ''], ['Cabezas', 'Mariano', ''], ['Oliver', 'Arnau', ''], ['Llado', 'Xavier', '']]","['Brain', 'MRI', 'sub-cortical structures', 'segmentation', 'convolutional neural networks']"
9096,2107.14316,Piyush Sharma,"Piyush K. Sharma, Rolando Fernandez, Erin Zaroukian, Michael Dorothy,
  Anjon Basak, and Derrik E. Asher","Survey of Recent Multi-Agent Reinforcement Learning Algorithms Utilizing
  Centralized Training","This article appeared in the news at:
  https://www.army.mil/article/247261/army_researchers_develop_innovative_framework_for_training_ai","Published at: Proceedings Volume 11746, Artificial Intelligence
  and Machine Learning for Multi-Domain Operations Applications III; 117462K
  (2021), SPIE Defense + Commercial Sensing, 2021, Online Only",10.1117/12.2585808,,cs.MA cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Much work has been dedicated to the exploration of Multi-Agent Reinforcement
Learning (MARL) paradigms implementing a centralized learning with
decentralized execution (CLDE) approach to achieve human-like collaboration in
cooperative tasks. Here, we discuss variations of centralized training and
describe a recent survey of algorithmic approaches. The goal is to explore how
different implementations of information sharing mechanism in centralized
learning may give rise to distinct group coordinated behaviors in multi-agent
systems performing cooperative tasks.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2021 20:29:12 GMT'}]",2021-08-02,"[['Sharma', 'Piyush K.', ''], ['Fernandez', 'Rolando', ''], ['Zaroukian', 'Erin', ''], ['Dorothy', 'Michael', ''], ['Basak', 'Anjon', ''], ['Asher', 'Derrik E.', '']]","['Reinforcement Learning', 'MARL', 'Decision-Making']"
9097,2112.10061,Ritik Batra,"Ritik Batra, Kaitlyn Lee","Redycler: Daily Outfit Texture Fabrication Appliance Using
  Re-Programmable Dyes","4 pages, 4 figures, TEI '22: Sixteenth International Conference on
  Tangible, Embedded, and Embodied Interaction",,10.1145/3490149.3502424,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We present a speculative design for a novel appliance for future fabrication
in the home to revitalize textiles using re-programmable multi-color textures.
Utilizing colored photochromic dyes activated by ultraviolet (UV) light, we can
selectively deactivate hues using complementary colors in visible light to
result in the final desired dye pattern. Our proposed appliance would automate
this process within a box placed in the bedroom. We envision a future where
people are able to transform old apparel into unique and fashionable pieces of
clothing.
  We discuss how the user would interact with the appliance and how this device
elongates the life-cycle of clothing through modification. We also outline the
central issues to integrate such a concept into the home. Finally, we analyze
how this device fits into personal modification trends in HCI to show how this
device could change existing conceptions around sustainable fashion and
personal style.
","[{'version': 'v1', 'created': 'Sun, 19 Dec 2021 04:54:53 GMT'}]",2021-12-21,"[['Batra', 'Ritik', ''], ['Lee', 'Kaitlyn', '']]","['Personal fabrication', 'programmable matter', 'multi-color textures', 'color change', 'photochromic', 'home appliance', 'dynamic textiles']"
9098,2007.15745,Li Yang,"Li Yang, Abdallah Shami","On Hyperparameter Optimization of Machine Learning Algorithms: Theory
  and Practice","Published in Neurocomputing (Elsevier's journal, Q1, IF: 5.779).
  Tutorial code has got 1000+ stars. Github link:
  https://github.com/LiYangHart/Hyperparameter-Optimization-of-Machine-Learning-Algorithms",,10.1016/j.neucom.2020.07.061,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning algorithms have been used widely in various applications and
areas. To fit a machine learning model into different problems, its
hyper-parameters must be tuned. Selecting the best hyper-parameter
configuration for machine learning models has a direct impact on the model's
performance. It often requires deep knowledge of machine learning algorithms
and appropriate hyper-parameter optimization techniques. Although several
automatic optimization techniques exist, they have different strengths and
drawbacks when applied to different types of problems. In this paper,
optimizing the hyper-parameters of common machine learning models is studied.
We introduce several state-of-the-art optimization techniques and discuss how
to apply them to machine learning algorithms. Many available libraries and
frameworks developed for hyper-parameter optimization problems are provided,
and some open challenges of hyper-parameter optimization research are also
discussed in this paper. Moreover, experiments are conducted on benchmark
datasets to compare the performance of different optimization methods and
provide practical examples of hyper-parameter optimization. This survey paper
will help industrial users, data analysts, and researchers to better develop
machine learning models by identifying the proper hyper-parameter
configurations effectively.
","[{'version': 'v1', 'created': 'Thu, 30 Jul 2020 21:11:01 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Aug 2020 15:42:07 GMT'}, {'version': 'v3', 'created': 'Wed, 5 Oct 2022 03:06:52 GMT'}]",2022-10-06,"[['Yang', 'Li', ''], ['Shami', 'Abdallah', '']]","['Hyper-parameter optimization', 'machine learning', 'Bayesian']"
9099,1601.04294,Alejandro D\'iaz-Caro,Alejandro D\'iaz-Caro and Gilles Dowek and Juan Pablo Rinaldi,Two linearities for quantum computing in the lambda calculus,"Long journal version of TPNC'17 paper
  (doi:10.1007/978-3-319-71069-3_22) extended with third author's
  ""Licenciatura""'s thesis","Biosystems Volume 186, December 2019, 104012. Post proceedings of
  TPNC'17",10.1016/j.biosystems.2019.104012,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a way to unify two approaches of non-cloning in quantum
lambda-calculi: logical and algebraic linearities. The first approach is to
forbid duplicating variables, while the second is to consider all lambda-terms
as algebraic-linear functions. We illustrate this idea by defining a quantum
extension of first-order simply-typed lambda-calculus, where the type is linear
on superposition, while allows cloning base vectors. In addition, we provide an
interpretation of the calculus where superposed types are interpreted as vector
spaces and non-superposed types as their basis.
","[{'version': 'v1', 'created': 'Sun, 17 Jan 2016 13:43:08 GMT'}, {'version': 'v10', 'created': 'Wed, 31 Jul 2019 20:12:54 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Jan 2016 10:57:18 GMT'}, {'version': 'v3', 'created': 'Fri, 29 Jan 2016 17:16:07 GMT'}, {'version': 'v4', 'created': 'Wed, 6 Jul 2016 15:15:07 GMT'}, {'version': 'v5', 'created': 'Fri, 21 Oct 2016 20:34:02 GMT'}, {'version': 'v6', 'created': 'Sun, 6 Aug 2017 01:24:07 GMT'}, {'version': 'v7', 'created': 'Fri, 6 Apr 2018 14:30:56 GMT'}, {'version': 'v8', 'created': 'Thu, 16 Aug 2018 17:10:51 GMT'}, {'version': 'v9', 'created': 'Tue, 18 Jun 2019 09:17:34 GMT'}]",2019-12-06,"[['Díaz-Caro', 'Alejandro', ''], ['Dowek', 'Gilles', ''], ['Rinaldi', 'Juan Pablo', '']]","['quantum computing', 'lambda-calculus', 'algebraic linearity', 'linearlogic', 'measurement']"
9100,2101.05357,Mehrshad Zandigohar,"Mehrshad Zandigohar, Mo Han, Deniz Erdogmus, and Gunar Schirner","Towards Creating a Deployable Grasp Type Probability Estimator for a
  Prosthetic Hand",,"CyPhy 2019, WESE 2019. Lecture Notes in Computer Science, vol
  11971. Springer, Cham",10.1007/978-3-030-41131-2_3,,cs.LG cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For lower arm amputees, prosthetic hands promise to restore most of physical
interaction capabilities. This requires to accurately predict hand gestures
capable of grabbing varying objects and execute them timely as intended by the
user. Current approaches often rely on physiological signal inputs such as
Electromyography (EMG) signal from residual limb muscles to infer the intended
motion. However, limited signal quality, user diversity and high variability
adversely affect the system robustness. Instead of solely relying on EMG
signals, our work enables augmenting EMG intent inference with physical state
probability through machine learning and computer vision method. To this end,
we: (1) study state-of-the-art deep neural network architectures to select a
performant source of knowledge transfer for the prosthetic hand, (2) use a
dataset containing object images and probability distribution of grasp types as
a new form of labeling where instead of using absolute values of zero and one
as the conventional classification labels, our labels are a set of
probabilities whose sum is 1. The proposed method generates probabilistic
predictions which could be fused with EMG prediction of probabilities over
grasps by using the visual information from the palm camera of a prosthetic
hand. Our results demonstrate that InceptionV3 achieves highest accuracy with
0.95 angular similarity followed by 1.4 MobileNetV2 with 0.93 at ~20% the
amount of operations.
","[{'version': 'v1', 'created': 'Wed, 13 Jan 2021 21:39:41 GMT'}]",2021-01-15,"[['Zandigohar', 'Mehrshad', ''], ['Han', 'Mo', ''], ['Erdogmus', 'Deniz', ''], ['Schirner', 'Gunar', '']]","['Learning from multimodal data · Neural networks', 'deeplearning · Signal detection pattern recognition', 'classification']"
9101,2104.12601,Freddie Hong,"Freddie Hong, Luca Tendera, Connor Myant, David Boyle","Vacuum-formed 3D printed electronics: fabrication of thin, rigid and
  free-form interactive surfaces","9 pages, 14 figures",,10.1007/s42979-022-01174-1,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vacuum-forming is a common manufacturing technique for constructing thin
plastic shell products by pressing heated plastic sheets onto a mold using
atmospheric pressure. Vacuum-forming is ubiquitous in packaging and casing
products in industry spanning fast moving consumer goods to connected devices.
Integrating advanced functionality, which may include sensing, computation and
communication, within thin structures is desirable for various next-generation
interactive devices. Hybrid additive manufacturing techniques like
thermoforming are becoming popular for prototyping freeform electronics given
its design flexibility, speed and cost-effectiveness. In this paper, we present
a new hybrid method for constructing thin, rigid and free-form interconnected
surfaces via fused deposition modelling (FDM) 3D printing and vacuum-forming.
While 3D printing a mold for vacuum-forming has been explored by many,
utilising 3D printing to construct sheet materials has remains unexplored. 3D
printing the sheet material allows embedding conductive traces within thin
layers of the substrate, which can be vacuum-formed but remain conductive and
insulated. We characterise the behaviour of the vacuum-formed 3D printed sheet,
analyse the electrical performance of 3D printed traces after vacuum-forming,
and showcase a range of examples constructed using the technique. We
demonstrate a new design interface specifically for designing conformal
interconnects, which allows designers to draw conductive patterns in 3D and
export pre-distorted sheet models ready to be 3D printed.
","[{'version': 'v1', 'created': 'Mon, 26 Apr 2021 14:03:33 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Apr 2021 10:25:35 GMT'}]",2022-05-10,"[['Hong', 'Freddie', ''], ['Tendera', 'Luca', ''], ['Myant', 'Connor', ''], ['Boyle', 'David', '']]","['3D printed electronics', 'conductive filament', 'hybrid additive manufacturing']"
9102,1604.03330,Trung Kien Vu,Trung Kien Vu and Sungoh Kwon,"Mobility-Assisted on-Demand Routing Algorithm for MANETs in the Presence
  of Location Errors","Special Issues on Recent Advances in Communications and Networking,
  The Scientific World Journal, 11 figures",,10.1155/2014/790103,,cs.NI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a mobility-assisted on-demand routing algorithm for mobile ad hoc
networks in the presence of location errors. Location awareness enables mobile
nodes to predict their mobility and enhances routing performance by estimating
link duration and selecting reliable routes. However, measured locations
intrinsically include errors in measurement. Such errors degrade mobility
prediction and have been ignored in previous work. To mitigate the impact of
location errors on routing, we propose an on-demand routing algorithm taking
into account location errors. To that end, we adopt the Kalman filter to
estimate accurate locations and consider route confidence in discovering
routes. Via simulations, we compare our algorithmand previous algorithms in
various environments. Our proposed mobility prediction is robust to the
location errors.
","[{'version': 'v1', 'created': 'Tue, 12 Apr 2016 10:19:08 GMT'}]",2016-04-14,"[['Vu', 'Trung Kien', ''], ['Kwon', 'Sungoh', '']]","['Location errors', 'Mobility prediction', 'Kalman Filter', 'Path duration']"
9103,2112.02811,Kundan Kandhway,"Jagtap Kalyani Devendra, Kundan Kandhway",Mitigating Biological Epidemic on Heterogeneous Social Networks,"17 pages, 9 figures. Accepted for publication in Results in Control
  and Optimization. Published version can be accessed at:
  https://doi.org/10.1016/j.rico.2021.100078",,10.1016/j.rico.2021.100078,,cs.SI cs.SY eess.SY physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  Recent Covid-19 pandemic has demonstrated the need of efficient epidemic
outbreak management. We study the optimal control problem of minimizing the
fraction of infected population by applying vaccination and treatment control
strategies, while at the same time minimizing the cost of implementing them. We
model the epidemic using the degree based Susceptible-Infected-Recovered (SIR)
compartmental model. We study the impact of varying network topologies on the
optimal epidemic management strategies and present results for the Erdos-Renyi,
scale free, and real world networks. For efficient computational modeling we
form groups of groups of degree classes, and apply separate vaccination and
treatment control signals to each group. This allows us to identify the degree
classes that play a significant role in mitigating the epidemic for a given
network topology. We compare the optimal control strategy with non optimal
strategies (constant control and no control) and study the effect of various
model parameters on the system. We identify which strategy
(vaccination/treatment) plays a significant role in controlling the epidemic on
different network topologies. We also study the effect of the cost of
vaccination and treatment controls on the resource allocation. We find that the
optimal strategy achieves significant improvements over the non optimal
heuristics for all networks studied in this paper. Our results may be of
interest to governments and healthcare authorities for devising effective
vaccination and treatment campaigns during an epidemic outbreak.
","[{'version': 'v1', 'created': 'Mon, 6 Dec 2021 06:47:50 GMT'}]",2021-12-07,"[['Devendra', 'Jagtap Kalyani', ''], ['Kandhway', 'Kundan', '']]","['Epidemics', 'heterogeneous social networks', 'optimal control', 'SIR']"
9104,2203.16775,Abdullah Al Asif,"Amit Kumar Das, Abdullah Al Asif, Anik Paul, and Md. Nur Hossain","Bangla hate speech detection on social media using attention-based
  recurrent neural network",,"Type: Journal Language: English Publisher: De Gruyter First
  published: September 1, 1991 Publication Frequency: 1 Issue per Year
  Audience: researchers in the field of intelligent systems",10.1515/jisys-2020-0060,,cs.CL cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Hate speech has spread more rapidly through the daily use of technology and,
most notably, by sharing your opinions or feelings on social media in a
negative aspect. Although numerous works have been carried out in detecting
hate speeches in English, German, and other languages, very few works have been
carried out in the context of the Bengali language. In contrast, millions of
people communicate on social media in Bengali. The few existing works that have
been carried out need improvements in both accuracy and interpretability. This
article proposed encoder decoder based machine learning model, a popular tool
in NLP, to classify user's Bengali comments on Facebook pages. A dataset of
7,425 Bengali comments, consisting of seven distinct categories of hate
speeches, was used to train and evaluate our model. For extracting and encoding
local features from the comments, 1D convolutional layers were used. Finally,
the attention mechanism, LSTM, and GRU based decoders have been used for
predicting hate speech categories. Among the three encoder decoder algorithms,
the attention-based decoder obtained the best accuracy (77%).
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2022 03:31:53 GMT'}]",2022-04-01,"[['Das', 'Amit Kumar', ''], ['Asif', 'Abdullah Al', ''], ['Paul', 'Anik', ''], ['Hossain', 'Md. Nur', '']]","['RNN', 'attention mechanism', 'LSTM', 'GRU', 'Bangla text classification', 'Bangla hate speech detection']"
9105,2103.03564,Carlo Sau,"Carlo Sau, Tiziana Fanni, Claudio Rubattu, Luigi Raffo, Francesca
  Palumbo","The Multi-Dataflow Composer Tool: an open-source tool suite for
  Optimized Coarse-Grain Reconfigurable Hardware Accelerators and Platform
  Design",,"Microprocessors and Microsystems, Volume 80, February 2021",10.1016/j.micpro.2020.103326,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern embedded and cyber-physical systems require every day more
performance, power efficiency and flexibility, to execute several profiles and
functionalities targeting the ever growing adaptivity needs and preserving
execution efficiency. Such requirements pushed designers towards the adoption
of heterogeneous and reconfigurable substrates, which development and
management is not that straightforward. Despite acceleration and flexibility
are desirable in many domains, the barrier of hardware deployment and operation
is still there since specific advanced expertise and skills are needed. Related
challenges are effectively tackled by leveraging on automation strategies that
in some cases, as in the proposed work, exploit model-based approaches. This
paper is focused on the Multi-Dataflow Composer (MDC) tool, that intends to
solve issues related to design, optimization and operation of coarse-grain
reconfigurable hardware accelerators and their easy adoption in modern
heterogeneous substrates. MDC latest features and improvements are introduced
in detail and have been assessed on the so far unexplored robotics application
field. A multi-profile trajectory generator for a robotic arm is implemented
over a Xilinx FPGA board to show in which cases coarse-grain reconfiguration
can be applied and which can be the parameters and trade-offs MDC will allow
users to play with.
","[{'version': 'v1', 'created': 'Fri, 5 Mar 2021 09:47:11 GMT'}]",2021-03-08,"[['Sau', 'Carlo', ''], ['Fanni', 'Tiziana', ''], ['Rubattu', 'Claudio', ''], ['Raffo', 'Luigi', ''], ['Palumbo', 'Francesca', '']]","['datapath merging', 'dataflow-based design', 'HLS', 'Coarse-Grain']"
9106,2204.06519,Ahmed Rashed,"Ahmed Rashed, Shereen Elsayed, Lars Schmidt-Thieme","CARCA: Context and Attribute-Aware Next-Item Recommendation via
  Cross-Attention",,RecSys (2022) 71-80,10.1145/3523227.3546777,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In sparse recommender settings, users' context and item attributes play a
crucial role in deciding which items to recommend next. Despite that, recent
works in sequential and time-aware recommendations usually either ignore both
aspects or only consider one of them, limiting their predictive performance. In
this paper, we address these limitations by proposing a context and
attribute-aware recommender model (CARCA) that can capture the dynamic nature
of the user profiles in terms of contextual features and item attributes via
dedicated multi-head self-attention blocks that extract profile-level features
and predicting item scores. Also, unlike many of the current state-of-the-art
sequential item recommendation approaches that use a simple dot-product between
the most recent item's latent features and the target items embeddings for
scoring, CARCA uses cross-attention between all profile items and the target
items to predict their final scores. This cross-attention allows CARCA to
harness the correlation between old and recent items in the user profile and
their influence on deciding which item to recommend next. Experiments on four
real-world recommender system datasets show that the proposed model
significantly outperforms all state-of-the-art models in the task of item
recommendation and achieving improvements of up to 53% in Normalized Discounted
Cumulative Gain (NDCG) and Hit-Ratio. Results also show that CARCA outperformed
several state-of-the-art dedicated image-based recommender systems by merely
utilizing image attributes extracted from a pre-trained ResNet50 in a black-box
fashion.
","[{'version': 'v1', 'created': 'Mon, 4 Apr 2022 13:22:28 GMT'}]",2022-09-21,"[['Rashed', 'Ahmed', ''], ['Elsayed', 'Shereen', ''], ['Schmidt-Thieme', 'Lars', '']]","['Sequential Recommendation', 'Context-Aware Recommendation', 'Attribute-Aware Recommendation', 'Cross Multi-Head Attention']"
9107,2203.02192,Yanwu Yang,"Huiran Li, Yanwu Yang","Optimal Keywords Grouping in Sponsored Search Advertising under
  Uncertain Environments","36 pages, 6 figures, 5 tables","International Journal of Electronic Commerce, 24(1), 107-129
  (2020)",10.1080/10864415.2019.1683704,,cs.AI cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In sponsored search advertising, advertisers need to make a series of keyword
decisions. Among them, how to group these keywords to form several adgroups
within a campaign is a challenging task, due to the highly uncertain
environment of search advertising. This paper proposes a stochastic programming
model for keywords grouping, taking click-through rate and conversion rate as
random variables, with consideration of budget constraints and advertisers'
risk-tolerance. A branch-and-bound algorithm is developed to solve our model.
Furthermore, we conduct computational experiments to evaluate the effectiveness
of our model and solution, with two real-world datasets collected from reports
and logs of search advertising campaigns. Experimental results illustrated that
our keywords grouping approach outperforms five baselines, and it can
approximately approach the optimum in a steady way. This research generates
several interesting findings that illuminate critical managerial insights for
advertisers in sponsored search advertising. First, keywords grouping does
matter for advertisers, especially in the situation with a large number of
keywords. Second, in keyword grouping decisions, the marginal profit does not
necessarily show the marginal diminishing phenomenon as the budget increases.
Such that, it's a worthy try for advertisers to increase their budget in
keywords grouping decisions, in order to obtain additional profit. Third, the
optimal keywords grouping solution is a result of multifaceted trade-off among
various advertising factors. In particular, assigning more keywords into
adgroups or having more budget won't certainly lead to higher profits. This
suggests a warning for advertisers that it's not wise to take the number of
keywords as the criterion for keywords grouping decisions.
","[{'version': 'v1', 'created': 'Fri, 4 Mar 2022 08:54:50 GMT'}]",2022-03-07,"[['Li', 'Huiran', ''], ['Yang', 'Yanwu', '']]","['keywords grouping', 'keyword decisions', 'sponsored search advertising', 'chance constrained programming']"
9108,2203.01514,Ehsan Haghighat,"Danial Amini, Ehsan Haghighat, Ruben Juanes","Physics-informed neural network solution of thermo-hydro-mechanical
  (THM) processes in porous media","21 pages, 7 figures",,10.1061/(ASCE)EM.1943-7889.0002156,,cs.LG cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Physics-Informed Neural Networks (PINNs) have received increased interest for
forward, inverse, and surrogate modeling of problems described by partial
differential equations (PDE). However, their application to multiphysics
problem, governed by several coupled PDEs, present unique challenges that have
hindered the robustness and widespread applicability of this approach. Here we
investigate the application of PINNs to the forward solution of problems
involving thermo-hydro-mechanical (THM) processes in porous media, which
exhibit disparate spatial and temporal scales in thermal conductivity,
hydraulic permeability, and elasticity. In addition, PINNs are faced with the
challenges of the multi-objective and non-convex nature of the optimization
problem. To address these fundamental issues, we: (1)~rewrite the THM governing
equations in dimensionless form that is best suited for deep-learning
algorithms; (2)~propose a sequential training strategy that circumvents the
need for a simultaneous solution of the multiphysics problem and facilitates
the task of optimizers in the solution search; and (3)~leverage adaptive weight
strategies to overcome the stiffness in the gradient flow of the
multi-objective optimization problem. Finally, we apply this framework to the
solution of several synthetic problems in 1D and~2D.
","[{'version': 'v1', 'created': 'Thu, 3 Mar 2022 04:55:47 GMT'}]",2022-09-09,"[['Amini', 'Danial', ''], ['Haghighat', 'Ehsan', ''], ['Juanes', 'Ruben', '']]","['Multiphysics', 'Thermo-Hydro-Mechanical', 'Deep learning', 'Porous media', 'SciANN']"
9109,2011.04232,Kamalesh Palanisamy,"Kamalesh Palanisamy, Vivek Khimani, Moin Hussain Moti, Dimitris
  Chatzopoulos",SplitEasy: A Practical Approach for Training ML models on Mobile Devices,"7 pages, 4 figures, Accepted at the ACM HotMobile workshop",,10.1145/3446382.3448362,,cs.LG cs.CR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern mobile devices, although resourceful, cannot train state-of-the-art
machine learning models without the assistance of servers, which require access
to, potentially, privacy-sensitive user data. Split learning has recently
emerged as a promising technique for training complex deep learning (DL) models
on low-powered mobile devices. The core idea behind this technique is to train
the sensitive layers of a DL model on mobile devices while offloading the
computationally intensive layers to a server. Although a lot of works have
already explored the effectiveness of split learning in simulated settings, a
usable toolkit for this purpose does not exist. In this work, we highlight the
theoretical and technical challenges that need to be resolved to develop a
functional framework that trains ML models in mobile devices without
transferring raw data to a server. Focusing on these challenges, we propose
SplitEasy, a framework for training ML models on mobile devices using split
learning. Using the abstraction provided by SplitEasy, developers can run
various DL models under split learning setting by making minimal modifications.
We provide a detailed explanation of SplitEasy and perform experiments with six
state-of-the-art neural networks. We demonstrate how SplitEasy can train models
that cannot be trained solely by a mobile device while incurring nearly
constant time per data sample.
","[{'version': 'v1', 'created': 'Mon, 9 Nov 2020 07:41:43 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Jan 2021 18:58:24 GMT'}]",2021-02-01,"[['Palanisamy', 'Kamalesh', ''], ['Khimani', 'Vivek', ''], ['Moti', 'Moin Hussain', ''], ['Chatzopoulos', 'Dimitris', '']]","['Deep learning', 'neural networks', 'split learning', 'on-device training']"
9110,1911.03332,Victor Gimenez-Abalos,"Victor Gimenez-Abalos, Armand Vilalta, Dario Garcia-Gasulla, Jesus
  Labarta and Eduard Ayguad\'e",Feature discriminativity estimation in CNNs for transfer learning,"Presented in the 22nd International Conference of the Catalan
  Association for Artificial Intelligence (CCIA 19)",Volume 319: Artificial Intelligence Research and Development 2019,10.3233/FAIA190109,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of feature extraction on convolutional neural networks is to
reuse deep representations learnt for a pre-trained model to solve a new,
potentially unrelated problem. However, raw feature extraction from all layers
is unfeasible given the massive size of these networks. Recently, a supervised
method using complexity reduction was proposed, resulting in significant
improvements in performance for transfer learning tasks. This approach first
computes the discriminative power of features, and then discretises them using
thresholds computed for the task. In this paper, we analyse the behaviour of
these thresholds, with the purpose of finding a methodology for their
estimation. After a comprehensive study, we find a very strong correlation
between problem size and threshold value, with coefficient of determination
above 90%. These results allow us to propose a unified model for threshold
estimation, with potential application to transfer learning tasks.
","[{'version': 'v1', 'created': 'Fri, 8 Nov 2019 15:37:25 GMT'}]",2019-11-11,"[['Gimenez-Abalos', 'Victor', ''], ['Vilalta', 'Armand', ''], ['Garcia-Gasulla', 'Dario', ''], ['Labarta', 'Jesus', ''], ['Ayguadé', 'Eduard', '']]","['transfer learning', 'machine learning', 'CNN', 'feature extraction']"
9111,1710.05368,"Paul G\""olz","Bernd Finkbeiner (Saarland University), and Paul G\""olz (Saarland
  University)",Synthesis in Distributed Environments,"12 pages excluding references and appendices, 29 pages total, 5
  figures. Version without appendices to be published in conference proceedings
  of FSTTCS 2017. Appendix A includes notation for multisets. Appendix B
  includes detailed proofs that have been omitted due to space constraints.
  Appendix C contains an algorithm for symbolic evaluation of commitments and
  its runtime analysis",,10.4230/LIPIcs.FSTTCS.2017.28,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  Most approaches to the synthesis of reactive systems study the problem in
terms of a two-player game with complete observation. In many applications,
however, the system's environment consists of several distinct entities, and
the system must actively communicate with these entities in order to obtain
information available in the environment. In this paper, we model such
environments as a team of players and keep track of the information known to
each individual player. This allows us to synthesize programs that interact
with a distributed environment and leverage multiple interacting sources of
information.
  The synthesis problem in distributed environments corresponds to solving a
special class of Petri games, i.e., multi-player games played over Petri nets,
where the net has a distinguished token representing the system and an
arbitrary number of tokens representing the environment. While, in general,
even the decidability of Petri games is an open question, we show that the
synthesis problem in distributed environments can be solved in polynomial time
for nets with up to two environment tokens. For an arbitrary but fixed number
of three or more environment tokens, the problem is NP-complete. If the number
of environment tokens grows with the size of the net, the problem is
EXPTIME-complete.
","[{'version': 'v1', 'created': 'Sun, 15 Oct 2017 18:01:31 GMT'}]",2018-09-11,"[['Finkbeiner', 'Bernd', '', 'Saarland University'], ['Gölz', 'Paul', '', 'Saarland\n  University']]","['reactive synthesis', 'distributed information', 'causal memory', 'Petri nets']"
9112,2003.09504,Fahad Sohrab,"Fahad Sohrab, Jenni Raitoharju, Alexandros Iosifidis, Moncef Gabbouj",Ellipsoidal Subspace Support Vector Data Description,,"IEEE Access, vol. 8, pp. 122013-122025, 2020",10.1109/ACCESS.2020.3007123,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel method for transforming data into a
low-dimensional space optimized for one-class classification. The proposed
method iteratively transforms data into a new subspace optimized for
ellipsoidal encapsulation of target class data. We provide both linear and
non-linear formulations for the proposed method. The method takes into account
the covariance of the data in the subspace; hence, it yields a more generalized
solution as compared to Subspace Support Vector Data Description for a
hypersphere. We propose different regularization terms expressing the class
variance in the projected space. We compare the results with classic and
recently proposed one-class classification methods and achieve better results
in the majority of cases. The proposed method is also noticed to converge much
faster than recently proposed Subspace Support Vector Data Description.
","[{'version': 'v1', 'created': 'Fri, 20 Mar 2020 21:31:03 GMT'}]",2020-09-15,"[['Sohrab', 'Fahad', ''], ['Raitoharju', 'Jenni', ''], ['Iosifidis', 'Alexandros', ''], ['Gabbouj', 'Moncef', '']]","['ellipsoidal data description', 'anomaly detection', 'machine learning', 'one-classclassification', 'subspace learning']"
9113,1906.09864,Till Massing,"Till Massing, Natalie Reckmann, Alexander Blasberg, Benjamin Otto,
  Christoph Hanck, Michael Goedicke","When is the best time to learn? -- Evidence from an introductory
  statistics course",,,10.1515/edu-2020-0144,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We analyze learning data of an e-assessment platform for an introductory
mathematical statistics course, more specifically the time of the day when
students learn. We propose statistical models to predict students' success and
to describe their behavior with a special focus on the following aspects.
First, we find that learning during daytime and not at nighttime is a relevant
variable for predicting success in final exams. Second, we observe that good
and very good students tend to learn in the afternoon, while some students who
failed our course were more likely to study at night but not successfully so.
Third, we discuss the average time spent on exercises. Regarding this, students
who participated in an exam spent more time doing exercises than students who
dropped the course before.
","[{'version': 'v1', 'created': 'Mon, 24 Jun 2019 11:47:30 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Feb 2021 14:50:13 GMT'}]",2021-03-26,"[['Massing', 'Till', ''], ['Reckmann', 'Natalie', ''], ['Blasberg', 'Alexander', ''], ['Otto', 'Benjamin', ''], ['Hanck', 'Christoph', ''], ['Goedicke', 'Michael', '']]","['Learning analytics', 'E-assessment', 'effective learning times']"
9114,1905.09103,Andrea Galassi,"Andrea Galassi, Kristian Kersting, Marco Lippi, Xiaoting Shao, Paolo
  Torroni","Neural-Symbolic Argumentation Mining: an Argument in Favor of Deep
  Learning and Reasoning",,Frontiers in Big Data 2 (2020) 52,10.3389/fdata.2019.00052,,cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Deep learning is bringing remarkable contributions to the field of
argumentation mining, but the existing approaches still need to fill the gap
toward performing advanced reasoning tasks. In this position paper, we posit
that neural-symbolic and statistical relational learning could play a crucial
role in the integration of symbolic and sub-symbolic methods to achieve this
goal.
","[{'version': 'v1', 'created': 'Wed, 22 May 2019 12:31:08 GMT'}, {'version': 'v2', 'created': 'Fri, 31 May 2019 08:55:00 GMT'}, {'version': 'v3', 'created': 'Tue, 28 Jan 2020 16:59:48 GMT'}]",2020-01-29,"[['Galassi', 'Andrea', ''], ['Kersting', 'Kristian', ''], ['Lippi', 'Marco', ''], ['Shao', 'Xiaoting', ''], ['Torroni', 'Paolo', '']]","['neural symbolic learning', 'argumentation mining', 'probabilistic logic programming', 'integrative AI', 'DeepProbLog', 'Ground-Specific Markov Logic Networks']"
9115,2010.16302,Hsiang-Shang Ko,Hsiang-Shang Ko,"Programming Metamorphic Algorithms: An Experiment in Type-Driven
  Algorithm Design",,"The Art, Science, and Engineering of Programming, 2021, Vol. 5,
  Issue 2, Article 7",10.22152/programming-journal.org/2021/5/7,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In dependently typed programming, proofs of basic, structural properties can
be embedded implicitly into programs and do not need to be written explicitly.
Besides saving the effort of writing separate proofs, a most distinguishing and
fascinating aspect of dependently typed programming is that it makes the idea
of interactive type-driven development much more powerful, where expressive
type information becomes useful hints that help the programmer to complete a
program. There have not been many attempts at exploiting the full potential of
the idea, though. As a departure from the usual properties dealt with in
dependently typed programming, and as a demonstration that the idea of
interactive type-driven development has more potential to be discovered, we
conduct an experiment in ?type-driven algorithm design?: we develop algorithms
from their specifications encoded in sophisticated types, to see how useful the
hints provided by a type-aware interactive development environment can be. The
algorithmic problem we choose is metamorphisms, whose definitional behaviour is
consuming a data structure to compute an intermediate value and then producing
a codata structure from that value, but there are other ways to compute
metamorphisms. We develop Gibbons?s streaming algorithm and Nakano?s jigsaw
model in the interactive development environment provided by the dependently
typed language Agda, turning intuitive ideas about these algorithms into formal
conditions and programs that are correct by construction.
","[{'version': 'v1', 'created': 'Fri, 30 Oct 2020 14:53:25 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Mar 2021 10:24:41 GMT'}, {'version': 'v3', 'created': 'Mon, 8 Mar 2021 08:37:49 GMT'}]",2021-03-09,"[['Ko', 'Hsiang-Shang', '']]","['dependent types', 'interactive type-driven development', 'metamorphisms', 'Agda']"
9116,2205.15759,Qi Yan,"Dagui Chen, Qi Yan, Chunjie Chen, Zhenzhe Zheng, Yangsu Liu, Zhenjia
  Ma and Chuan Yu, Jian Xu and Bo Zheng",Hierarchically Constrained Adaptive Ad Exposure in Feeds,"In Proceedings of the 31st ACM International Conference on
  Information and Knowledge Management (CIKM '22)",,10.1145/3511808.3557103,,cs.AI cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A contemporary feed application usually provides blended results of organic
items and sponsored items~(ads) to users. Conventionally, ads are exposed at
fixed positions. Such a static exposure strategy is inefficient due to ignoring
users' personalized preferences towards ads. To this end, adaptive ad exposure
has become an appealing strategy to boost the overall performance of the feed.
However, existing approaches to implementing the adaptive ad exposure still
suffer from several limitations: 1) they usually fall into sub-optimal
solutions because of only focusing on request-level optimization without
consideration of the long-term application-level performance and constraints,
2) they neglect the necessity of keeping the game-theoretical properties of ad
auctions, which may lead to anarchy in bidding, and 3) they can hardly be
deployed in large-scale applications due to high computational complexity. In
this paper, we focus on long-term performance optimization under hierarchical
constraints in feeds and formulate the adaptive ad exposure as a Dynamic
Knapsack Problem. We propose an effective approach: Hierarchically Constrained
Adaptive Ad Exposure~(HCA2E). We present that HCA2E possesses desired
game-theoretical properties, computational efficiency, and performance
robustness. Comprehensive offline and online experiments on a leading
e-commerce application demonstrate the significant performance superiority of
HCA2E over representative baselines. HCA2E has also been deployed on this
application to serve millions of daily users.
","[{'version': 'v1', 'created': 'Tue, 31 May 2022 12:56:49 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Oct 2022 02:57:12 GMT'}]",2022-10-20,"[['Chen', 'Dagui', ''], ['Yan', 'Qi', ''], ['Chen', 'Chunjie', ''], ['Zheng', 'Zhenzhe', ''], ['Liu', 'Yangsu', ''], ['Ma', 'Zhenjia', ''], ['Yu', 'Chuan', ''], ['Xu', 'Jian', ''], ['Zheng', 'Bo', '']]","['Adaptive Ad Exposure', 'Dynamic Knapsack Problem', 'HierarchicallyConstrained Optimization']"
9117,1904.05816,Yuqing Wang,"Yuqing Wang, Mika M\""antyl\""a, Sigrid Eldh, Jouni Markkula, Kristian
  Wiklund, Tatu Kairi, P\""aivi Raulamo-Jurvanen and Antti Haukinen",A self-assessment Instrument for assessing test automation maturity,10 pages,,10.1145/3319008.3319020,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Test automation is important in software industry but self-assessment
instruments for assessing its maturity are not sufficient. The two objectives
of this study are to synthesize what an organization should focus to assess its
test automation; develop a self-assessment instrument (a survey) for assessing
test automation maturity and scientifically evaluate it. We carried out the
study in four stages. First, a literature review of 25 sources was conducted.
Second, the initial instrument was developed. Third, seven experts from five
companies evaluated the initial instrument. Content Validity Index and
Cognitive Interview methods were used. Fourth, we revised the developed
instrument. Our contributions are as follows: (a) we collected practices mapped
into 15 KAs that indicate where an organization should focus to assess its test
automation; (b) we developed and evaluated a self-assessment instrument for
assessing test automation maturity; (c) we discuss important topics such as
response bias that threatens self-assessment instruments. Our results help
companies and researchers to understand and improve test automation practices
and processes.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2019 16:13:41 GMT'}]",2019-04-12,"[['Wang', 'Yuqing', ''], ['Mäntylä', 'Mika', ''], ['Eldh', 'Sigrid', ''], ['Markkula', 'Jouni', ''], ['Wiklund', 'Kristian', ''], ['Kairi', 'Tatu', ''], ['Raulamo-Jurvanen', 'Päivi', ''], ['Haukinen', 'Antti', '']]","['test automation', 'assessment', 'instrument', 'maturity', 'content validity']"
9118,2101.01364,Quazi Marufur Rahman,"Quazi Marufur Rahman, Peter Corke, Feras Dayoub","Run-Time Monitoring of Machine Learning for Robotic Perception: A Survey
  of Emerging Trends","Updated version of 10.1109/ACCESS.2021.3055015. Published at IEEE
  Access. 27 January 2021",,10.1109/ACCESS.2021.3055015,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As deep learning continues to dominate all state-of-the-art computer vision
tasks, it is increasingly becoming an essential building block for robotic
perception. This raises important questions concerning the safety and
reliability of learning-based perception systems. There is an established field
that studies safety certification and convergence guarantees of complex
software systems at design-time. However, the unknown future deployment
environments of an autonomous system and the complexity of learning-based
perception make the generalization of design-time verification to run-time
problematic. In the face of this challenge, more attention is starting to focus
on run-time monitoring of performance and reliability of perception systems
with several trends emerging in the literature. This paper attempts to identify
these trends and summarise the various approaches to the topic.
","[{'version': 'v1', 'created': 'Tue, 5 Jan 2021 06:23:03 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Jun 2021 05:31:07 GMT'}, {'version': 'v3', 'created': 'Mon, 12 Jul 2021 03:42:34 GMT'}]",2021-07-13,"[['Rahman', 'Quazi Marufur', ''], ['Corke', 'Peter', ''], ['Dayoub', 'Feras', '']]","['Machine learning', 'performance evaluation', 'reliability', 'robot learning']"
9119,2207.11118,Yangjun Mao,"Yangjun Mao, Long Chen, Zhihong Jiang, Dong Zhang, Zhimeng Zhang, Jian
  Shao, Jun Xiao",Rethinking the Reference-based Distinctive Image Captioning,ACM MM 2022,,10.1145/3503161.3548358,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distinctive Image Captioning (DIC) -- generating distinctive captions that
describe the unique details of a target image -- has received considerable
attention over the last few years. A recent DIC work proposes to generate
distinctive captions by comparing the target image with a set of
semantic-similar reference images, i.e., reference-based DIC (Ref-DIC). It aims
to make the generated captions can tell apart the target and reference images.
Unfortunately, reference images used by existing Ref-DIC works are easy to
distinguish: these reference images only resemble the target image at
scene-level and have few common objects, such that a Ref-DIC model can
trivially generate distinctive captions even without considering the reference
images. To ensure Ref-DIC models really perceive the unique objects (or
attributes) in target images, we first propose two new Ref-DIC benchmarks.
Specifically, we design a two-stage matching mechanism, which strictly controls
the similarity between the target and reference images at object-/attribute-
level (vs. scene-level). Secondly, to generate distinctive captions, we develop
a strong Transformer-based Ref-DIC baseline, dubbed as TransDIC. It not only
extracts visual features from the target image, but also encodes the
differences between objects in the target and reference images. Finally, for
more trustworthy benchmarking, we propose a new evaluation metric named
DisCIDEr for Ref-DIC, which evaluates both the accuracy and distinctiveness of
the generated captions. Experimental results demonstrate that our TransDIC can
generate distinctive captions. Besides, it outperforms several state-of-the-art
models on the two new benchmarks over different metrics.
","[{'version': 'v1', 'created': 'Fri, 22 Jul 2022 14:49:54 GMT'}]",2022-07-25,"[['Mao', 'Yangjun', ''], ['Chen', 'Long', ''], ['Jiang', 'Zhihong', ''], ['Zhang', 'Dong', ''], ['Zhang', 'Zhimeng', ''], ['Shao', 'Jian', ''], ['Xiao', 'Jun', '']]","['Image Captioning', 'Distinctiveness', 'Benchmark', 'Transformer']"
9120,2301.07879,Saurabh Sharma,"Saurabh Sharma, Faizan Ahemad","Unposed: Unsupervised Pose Estimation based Product Image
  Recommendations",,,10.1145/3564121.3564126,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Product images are the most impressing medium of customer interaction on the
product detail pages of e-commerce websites. Millions of products are onboarded
on to webstore catalogues daily and maintaining a high quality bar for a
product's set of images is a problem at scale. Grouping products by categories,
clothing is a very high volume and high velocity category and thus deserves its
own attention. Given the scale it is challenging to monitor the completeness of
image set, which adequately details the product for the consumers, which in
turn often leads to a poor customer experience and thus customer drop off.
  To supervise the quality and completeness of the images in the product pages
for these product types and suggest improvements, we propose a Human Pose
Detection based unsupervised method to scan the image set of a product for the
missing ones. The unsupervised approach suggests a fair approach to sellers
based on product and category irrespective of any biases. We first create a
reference image set of popular products with wholesome imageset. Then we create
clusters of images to label most desirable poses to form the classes for the
reference set from these ideal products set. Further, for all test products we
scan the images for all desired pose classes w.r.t. reference set poses,
determine the missing ones and sort them in the order of potential impact.
These missing poses can further be used by the sellers to add enriched product
listing image. We gathered data from popular online webstore and surveyed ~200
products manually, a large fraction of which had at least 1 repeated image or
missing variant, and sampled 3K products(~20K images) of which a significant
proportion had scope for adding many image variants as compared to high rated
products which had more than double image variants, indicating that our model
can potentially be used on a large scale.
","[{'version': 'v1', 'created': 'Thu, 19 Jan 2023 05:02:55 GMT'}]",2023-01-20,"[['Sharma', 'Saurabh', ''], ['Ahemad', 'Faizan', '']]","['pose detection', 'interpretable', 'image tagging']"
9121,1910.14532,Maxime Ferrera,"Maxime Ferrera (LIRMM), Vincent Creuze (LIRMM), Julien Moras, Pauline
  Trouv\'e-Peloux",AQUALOC: An Underwater Dataset for Visual-Inertial-Pressure Localization,"The International Journal of Robotics Research, SAGE Publications,
  2019",,10.1177/0278364919883346,,cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new dataset, dedicated to the development of simultaneous
localization and mapping methods for underwater vehicles navigating close to
the seabed. The data sequences composing this dataset are recorded in three
different environments: a harbor at a depth of a few meters, a first
archaeological site at a depth of 270 meters and a second site at a depth of
380 meters. The data acquisition is performed using Remotely Operated Vehicles
equipped with a monocular monochromatic camera, a low-cost inertial measurement
unit, a pressure sensor and a computing unit, all embedded in a single
enclosure. The sensors' measurements are recorded synchronously on the
computing unit and seventeen sequences have been created from all the acquired
data. These sequences are made available in the form of ROS bags and as raw
data. For each sequence, a trajectory has also been computed offline using a
Structure-from-Motion library in order to allow the comparison with real-time
localization methods. With the release of this dataset, we wish to provide data
difficult to acquire and to encourage the development of vision-based
localization methods dedicated to the underwater environment. The dataset can
be downloaded from: http://www.lirmm.fr/aqualoc/
","[{'version': 'v1', 'created': 'Thu, 31 Oct 2019 15:28:08 GMT'}]",2019-11-01,"[['Ferrera', 'Maxime', '', 'LIRMM'], ['Creuze', 'Vincent', '', 'LIRMM'], ['Moras', 'Julien', ''], ['Trouvé-Peloux', 'Pauline', '']]","['Dataset', 'Underwater robotics', 'Monocular Vision', 'IMU', 'Pressure', 'SLAM']"
9122,2104.10634,David Purser,"Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel
  Lefaucheux, Florian Luca, Jo\""el Ouaknine, David Purser, Markus A. Whiteland
  and James Worrell",The Orbit Problem for Parametric Linear Dynamical Systems,Full version of the paper appearing at CONCUR 2021,,10.4230/LIPIcs.CONCUR.2021.28,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study a parametric version of the Kannan-Lipton Orbit Problem for linear
dynamical systems. We show decidability in the case of one parameter and
Skolem-hardness with two or more parameters.
  More precisely, consider a $d$-dimensional square matrix $M$ whose entries
are algebraic functions in one or more real variables. Given initial and target
vectors $u,v\in \mathbb{Q}^d$, the parametric point-to-point orbit problem asks
whether there exist values of the parameters giving rise to a concrete matrix
$N \in \mathbb{R}^{d\times d}$, and a positive integer $n\in \mathbb{N}$, such
that $N^nu = v$.
  We show decidability for the case in which $M$ depends only upon a single
parameter, and we exhibit a reduction from the well-known Skolem Problem for
linear recurrence sequences, suggesting intractability in the case of two or
more parameters.
","[{'version': 'v1', 'created': 'Wed, 21 Apr 2021 16:59:44 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Aug 2021 11:49:15 GMT'}]",2021-08-16,"[['Baier', 'Christel', ''], ['Funke', 'Florian', ''], ['Jantsch', 'Simon', ''], ['Karimov', 'Toghrul', ''], ['Lefaucheux', 'Engel', ''], ['Luca', 'Florian', ''], ['Ouaknine', 'Joël', ''], ['Purser', 'David', ''], ['Whiteland', 'Markus A.', ''], ['Worrell', 'James', '']]","['Orbit problem', 'parametric', 'linear dynamical systems']"
9123,2004.03058,Ron Roth,"Rachel N. Berman, Ron M. Roth",On the Number of Factorizations of Polynomials over Finite Fields,,,10.1016/j.jcta.2021.105462,,cs.DM cs.IT math.CO math.IT,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Motivated by coding applications,two enumeration problems are considered: the
number of distinct divisors of a degree-m polynomial over F = GF(q), and the
number of ways a polynomial can be written as a product of two polynomials of
degree at most n over F. For the two problems, bounds are obtained on the
maximum number of factorizations, and a characterization is presented for
polynomials attaining that maximum. Finally, expressions are presented for the
average and the variance of the number of factorizations, for any given m
(respectively, n).
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2020 00:54:25 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Apr 2021 15:49:39 GMT'}]",2021-04-10,"[['Berman', 'Rachel N.', ''], ['Roth', 'Ron M.', '']]","['Enumerating divisors of polynomials', 'Polynomial factorization', 'Polynomials over finite fields']"
9124,2211.02976,Sumana Biswas,"Sumana Biswas, Karen Young, and Josephine Griffith",A Comparison of Automatic Labelling Approaches for Sentiment Analysis,"12 pages 3 figure, 11th International Conference on Data Science,
  Technology and Applications, ISBN 978-989-758-583-8, ISSN 2184-285X, pages
  312-319",,10.5220/0011265900003269,,cs.CL cs.DL cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Labelling a large quantity of social media data for the task of supervised
machine learning is not only time-consuming but also difficult and expensive.
On the other hand, the accuracy of supervised machine learning models is
strongly related to the quality of the labelled data on which they train, and
automatic sentiment labelling techniques could reduce the time and cost of
human labelling. We have compared three automatic sentiment labelling
techniques: TextBlob, Vader, and Afinn to assign sentiments to tweets without
any human assistance. We compare three scenarios: one uses training and testing
datasets with existing ground truth labels; the second experiment uses
automatic labels as training and testing datasets; and the third experiment
uses three automatic labelling techniques to label the training dataset and
uses the ground truth labels for testing. The experiments were evaluated on two
Twitter datasets: SemEval-2013 (DS-1) and SemEval-2016 (DS-2). Results show
that the Afinn labelling technique obtains the highest accuracy of 80.17%
(DS-1) and 80.05% (DS-2) using a BiLSTM deep learning model. These findings
imply that automatic text labelling could provide significant benefits, and
suggest a feasible alternative to the time and cost of human labelling efforts.
","[{'version': 'v1', 'created': 'Sat, 5 Nov 2022 21:41:44 GMT'}]",2022-11-08,"[['Biswas', 'Sumana', ''], ['Young', 'Karen', ''], ['Griffith', 'Josephine', '']]","['Sentiment Analysis', 'NLP', 'Deep Learning', 'Automatic Labelling']"
9125,1912.08881,Sebastian Lapuschkin,"Seul-Ki Yeom, Philipp Seegerer, Sebastian Lapuschkin, Alexander
  Binder, Simon Wiedemann, Klaus-Robert M\""uller, Wojciech Samek",Pruning by Explaining: A Novel Criterion for Deep Neural Network Pruning,"25 pages + 5 supplementary pages, 13 figures, 6 tables","Pattern Recognition, Volume 115, pp.107899, 2021",10.1016/j.patcog.2021.107899,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The success of convolutional neural networks (CNNs) in various applications
is accompanied by a significant increase in computation and parameter storage
costs. Recent efforts to reduce these overheads involve pruning and compressing
the weights of various layers while at the same time aiming to not sacrifice
performance. In this paper, we propose a novel criterion for CNN pruning
inspired by neural network interpretability: The most relevant units, i.e.
weights or filters, are automatically found using their relevance scores
obtained from concepts of explainable AI (XAI). By exploring this idea, we
connect the lines of interpretability and model compression research. We show
that our proposed method can efficiently prune CNN models in transfer-learning
setups in which networks pre-trained on large corpora are adapted to
specialized tasks. The method is evaluated on a broad range of computer vision
datasets. Notably, our novel criterion is not only competitive or better
compared to state-of-the-art pruning criteria when successive retraining is
performed, but clearly outperforms these previous criteria in the
resource-constrained application scenario in which the data of the task to be
transferred to is very scarce and one chooses to refrain from fine-tuning. Our
method is able to compress the model iteratively while maintaining or even
improving accuracy. At the same time, it has a computational cost in the order
of gradient computation and is comparatively simple to apply without the need
for tuning hyperparameters for pruning.
","[{'version': 'v1', 'created': 'Wed, 18 Dec 2019 20:42:30 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Sep 2020 14:43:54 GMT'}, {'version': 'v3', 'created': 'Fri, 12 Mar 2021 11:30:15 GMT'}]",2021-03-15,"[['Yeom', 'Seul-Ki', ''], ['Seegerer', 'Philipp', ''], ['Lapuschkin', 'Sebastian', ''], ['Binder', 'Alexander', ''], ['Wiedemann', 'Simon', ''], ['Müller', 'Klaus-Robert', ''], ['Samek', 'Wojciech', '']]","['Pruning', 'Layer-wise Relevance Propagation (LRP)', 'Convolutional Neural Network(CNN)', 'Interpretation of Models', 'Explainable AI (XAI)']"
9126,2207.05577,Niki Maria Foteinopoulou,"Niki Maria Foteinopoulou, Ioannis Patras",Learning from Label Relationships in Human Affect,"Accepted at ACM Multimedia (ACMMM) 2022, 10 pages, 4 figures",,10.1145/3503161.3548373,,cs.CV cs.HC cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human affect and mental state estimation in an automated manner, face a
number of difficulties, including learning from labels with poor or no temporal
resolution, learning from few datasets with little data (often due to
confidentiality constraints) and, (very) long, in-the-wild videos. For these
reasons, deep learning methodologies tend to overfit, that is, arrive at latent
representations with poor generalisation performance on the final regression
task. To overcome this, in this work, we introduce two complementary
contributions. First, we introduce a novel relational loss for multilabel
regression and ordinal problems that regularises learning and leads to better
generalisation. The proposed loss uses label vector inter-relational
information to learn better latent representations by aligning batch label
distances to the distances in the latent feature space. Second, we utilise a
two-stage attention architecture that estimates a target for each clip by using
features from the neighbouring clips as temporal context. We evaluate the
proposed methodology on both continuous affect and schizophrenia severity
estimation problems, as there are methodological and contextual parallels
between the two. Experimental results demonstrate that the proposed methodology
outperforms all baselines. In the domain of schizophrenia, the proposed
methodology outperforms previous state-of-the-art by a large margin, achieving
a PCC of up to 78% performance close to that of human experts (85%) and much
higher than previous works (uplift of up to 40%). In the case of affect
recognition, we outperform previous vision-based methods in terms of CCC on
both the OMG and the AMIGOS datasets. Specifically for AMIGOS, we outperform
previous SoTA CCC for both arousal and valence by 9% and 13% respectively, and
in the OMG dataset we outperform previous vision works by up to 5% for both
arousal and valence.
","[{'version': 'v1', 'created': 'Tue, 12 Jul 2022 15:00:54 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Aug 2022 12:45:57 GMT'}]",2022-08-16,"[['Foteinopoulou', 'Niki Maria', ''], ['Patras', 'Ioannis', '']]","['continuous affect estimation', 'multilabel', 'representation learning']"
9127,1712.00865,Mohammed Abufouda,Mohammed Abufouda and Hadil Abukwaik,"On Using Network Science in Mining Developers Collaboration in Software
  Engineering: A Systematic Literature Review","International Journal of Data Mining & Knowledge Management Process
  (IJDKP)",,10.5121/ijdkp.2017.7601,,cs.SI cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The goal of this study is to identify, review, and analyze the published
research works that used network analysis as a tool for understanding the human
collaboration on different levels of software development. This study and its
findings are expected to be of benefit for software engineering practitioners
and researchers who are mining software repositories using tools from network
science field. We conducted a systematic literature review, in which we
analyzed a number of selected papers from different digital libraries based on
inclusion and exclusion criteria. We identified $35$ primary studies (PSs) from
4 digital libraries, then we extracted data from each PS according to a
predefined data extraction sheet. The results of our data analysis showed that
not all of the constructed networks used in the PSs were valid as the edges of
these networks did not reflect a real relationship between the entities of the
network. Additionally, the used measures in the PSs were in many cases not
suitable for the used networks. Also, the reported analysis results by the PSs
were not, in most cases, validated using any statistical model. Finally, many
of the PSs did not provide lessons or guidelines for software practitioners
that can improve the software engineering practices. Although employing network
analysis in mining developers' collaboration showed some satisfactory results
in some of the PSs, the application of network analysis needs to be conducted
more carefully. That is said, the constructed network should be representative
and meaningful, the used measure needs to be suitable for the context, and the
validation of the results should be considered. More and above, we state some
research gaps, in which network science can be applied, with some pointers to
recent advances that can be used to mine collaboration networks.
","[{'version': 'v1', 'created': 'Mon, 4 Dec 2017 00:57:16 GMT'}]",2017-12-05,"[['Abufouda', 'Mohammed', ''], ['Abukwaik', 'Hadil', '']]","['Network Analysis', 'software engineering', 'developers collaboration', 'systematic literature review']"
9128,2003.04740,Myroslav Kryven,"Steven Chaplick, Henry F\""orster, Myroslav Kryven, Alexander Wolff",Drawing Graphs with Circular Arcs and Right-Angle Crossings,,"Proc. 17th Scandinavian Symposium and Workshops on Algorithm
  Theory (SWAT 2020), LIPIcs 162, pages 21:1-21:14",10.4230/LIPIcs.SWAT.2020.21,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a RAC drawing of a graph, vertices are represented by points in the plane,
adjacent vertices are connected by line segments, and crossings must form right
angles. Graphs that admit such drawings are RAC graphs. RAC graphs are
beyond-planar graphs and have been studied extensively. In particular, it is
known that a RAC graph with n vertices has at most 4n - 10 edges.
  We introduce a superclass of RAC graphs, which we call arc-RAC graphs. A
graph is arc-RAC if it admits a drawing where edges are represented by circular
arcs and crossings form right angles. We provide a Tur\'an-type result showing
that an arc-RAC graph with n vertices has at most 14n - 12 edges and that there
are n-vertex arc-RAC graphs with 4.5n - o(n) edges.
","[{'version': 'v1', 'created': 'Tue, 10 Mar 2020 13:56:23 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Apr 2020 10:44:09 GMT'}, {'version': 'v3', 'created': 'Thu, 9 Jul 2020 10:43:50 GMT'}]",2020-07-10,"[['Chaplick', 'Steven', ''], ['Förster', 'Henry', ''], ['Kryven', 'Myroslav', ''], ['Wolff', 'Alexander', '']]","['circular arcs', 'right-angle crossings', 'edge density', 'charging argument']"
9129,2103.07108,Katie Seaborn,Katie Seaborn and Jacqueline Urakami,Measuring Voice UX Quantitatively: A Rapid Review,Accepted at CHI EA '21,,10.1145/3411763.3451712,,cs.HC cs.RO cs.SD,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Computer voice is experiencing a renaissance through the growing popularity
of voice-based interfaces, agents, and environments. Yet, how to measure the
user experience (UX) of voice-based systems remains an open and urgent
question, especially given that their form factors and interaction styles tend
to be non-visual, intangible, and often considered disembodied or ""body-less.""
As a first step, we surveyed the ACM and IEEE literatures to determine which
quantitative measures and measurements have been deemed important for voice UX.
Our findings show that there is little consensus, even with similar situations
and systems, as well as an overreliance on lab work and unvalidated scales. In
response, we offer two high-level descriptive frameworks for guiding future
research, developing standardized instruments, and informing ongoing review
work. Our work highlights the current strengths and weaknesses of voice UX
research and charts a path towards measuring voice UX in a more comprehensive
way.
","[{'version': 'v1', 'created': 'Fri, 12 Mar 2021 07:05:06 GMT'}]",2021-03-15,"[['Seaborn', 'Katie', ''], ['Urakami', 'Jacqueline', '']]","['Voice user interfaces', 'voice agents', 'voice assistants', 'voice user experience']"
9130,2203.03555,Dmitrii Pavlov,"Dmitrii Pavlov, Gleb Pogudin","On realizing differential-algebraic equations by rational dynamical
  systems",,,10.1145/3476446.3535492,,cs.SC math.AG math.DS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real-world phenomena can often be conveniently described by dynamical systems
(that is, ODE systems in the state-space form). However, if one observes the
state of the system only partially, the observed quantities (outputs) and the
inputs of the system can typically be related by more complicated
differential-algebraic equations (DAEs). Therefore, a natural question
(referred to as the realizability problem) is: given a differential-algebraic
equation (say, fitted from data), does it come from a partially observed
dynamical system? A special case in which the functions involved in the
dynamical system are rational is of particular interest. For a single
differential-algebraic equation in a single output variable, Forsman has shown
that it is realizable by a rational dynamical system if and only if the
corresponding hypersurface is unirational, and he turned this into an algorithm
in the first-order case.
  In this paper, we study a more general case of single-input-single-output
equations. We show that if a realization by a rational dynamical system exists,
the system can be taken to have the dimension equal to the order of the DAE. We
provide a complete algorithm for first-order DAEs. We also show that the same
approach can be used for higher-order DAEs using several examples from the
literature.
","[{'version': 'v1', 'created': 'Mon, 7 Mar 2022 17:56:27 GMT'}, {'version': 'v2', 'created': 'Sat, 14 May 2022 09:05:07 GMT'}]",2022-05-17,"[['Pavlov', 'Dmitrii', ''], ['Pogudin', 'Gleb', '']]","['differential-algebraic equations', 'rational dynamical systems', 'realization theory']"
9131,2003.03819,Yongxing Wang,"Yongxing Wang, Peter K. Jimack, Mark A. Walkley and Olivier Pironneau","An energy stable one-field monolithic arbitrary Lagrangian-Eulerian
  formulation for fluid-structure interaction",,,10.1016/j.jfluidstructs.2020.103117,,cs.CE math.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article we present a one-field monolithic finite element method in
the Arbitrary Lagrangian-Eulerian (ALE) formulation for Fluid-Structure
Interaction (FSI) problems. The method only solves for one velocity field in
the whole FSI domain, and it solves in a monolithic manner so that the fluid
solid interface conditions are satisfied automatically. We prove that the
proposed scheme is unconditionally stable, through energy analysis, by
utilising a conservative formulation and an exact quadrature rule. We implement
the algorithm using both ${\bf F}$-scheme and ${\bf d}$-scheme, and demonstrate
that the former has the same formulation in two and three dimensions. Finally
several numerical examples are presented to validate this methodology,
including combination with remesh techniques to handle the case of very large
solid displacement.
","[{'version': 'v1', 'created': 'Sun, 8 Mar 2020 17:53:44 GMT'}]",2020-08-26,"[['Wang', 'Yongxing', ''], ['Jimack', 'Peter K.', ''], ['Walkley', 'Mark A.', ''], ['Pironneau', 'Olivier', '']]","['fluid structure interaction', 'finite element', 'one field', 'monolithicscheme', 'arbitrary Lagrangian-Eulerian', 'energy stable']"
9132,2210.07973,Sahil Faizal Mr,"Sahil Faizal, Sanjay Sundaresan",Wild Animal Classifier Using CNN,"7 pages, 6 figures","IJARSCT, Volume 2, Issue 1, September 2022",10.48175/IJARSCT-7097,,cs.CV cs.AI,http://creativecommons.org/publicdomain/zero/1.0/,"  Classification and identification of wild animals for tracking and protection
purposes has become increasingly important with the deterioration of the
environment, and technology is the agent of change which augments this process
with novel solutions. Computer vision is one such technology which uses the
abilities of artificial intelligence and machine learning models on visual
inputs. Convolution neural networks (CNNs) have multiple layers which have
different weights for the purpose of prediction of a particular input. The
precedent for classification, however, is set by the image processing
techniques which provide nearly ideal input images that produce optimal
results. Image segmentation is one such widely used image processing method
which provides a clear demarcation of the areas of interest in the image, be it
regions or objects. The Efficiency of CNN can be related to the preprocessing
done before training. Further, it is a well-established fact that heterogeneity
in image sources is detrimental to the performance of CNNs. Thus, the added
functionality of heterogeneity elimination is performed by the image processing
techniques, introducing a level of consistency that sets the tone for the
excellent feature extraction and eventually in classification.
","[{'version': 'v1', 'created': 'Mon, 3 Oct 2022 13:14:08 GMT'}]",2022-10-17,"[['Faizal', 'Sahil', ''], ['Sundaresan', 'Sanjay', '']]","['Multi-class Classification', 'Computer Vision', 'Deep Learning', 'CNNs', 'Image Segmentation', 'Data Augmentation', 'Cross-Validation']"
9133,1906.06047,Rasmus Kr{\ae}mmer Rendsvig,"Andr\'es Occhipinti Liberman, Andreas Achen, Rasmus Kr{\ae}mmer
  Rendsvig",Dynamic Term-Modal Logics for First-Order Epistemic Planning,,,10.1016/j.artint.2020.103305,,cs.LO cs.AI cs.MA math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many classical planning frameworks are built on first-order languages. The
first-order expressive power is desirable for compactly representing actions
via schemas, and for specifying quantified conditions such as $\neg\exists
x\mathsf{blocks\_door}(x)$. In contrast, several recent epistemic planning
frameworks are built on propositional epistemic logic. The epistemic language
is useful to describe planning problems involving higher-order reasoning or
epistemic goals such as $K_{a}\neg\mathsf{problem}$.
  This paper develops a first-order version of Dynamic Epistemic Logic (DEL).
In this framework, for example, $\exists xK_{x}\exists
y\mathsf{blocks\_door}(y)$ is a formula. The formalism combines the strengths
of DEL (higher-order reasoning) with those of first-order logic (lifted
representation) to model multi-agent epistemic planning. The paper introduces
an epistemic language with a possible-worlds semantics, followed by novel
dynamics given by first-order action models and their execution via product
updates. Taking advantage of the first-order machinery, epistemic action
schemas are defined to provide compact, problem-independent domain
descriptions, in the spirit of PDDL.
  Concerning metatheory, the paper defines axiomatic normal term-modal logics,
shows a Canonical Model Theorem-like result which allows establishing
completeness through frame characterization formulas, shows decidability for
the finite agent case, and shows a general completeness result for the dynamic
extension by reduction axioms.
","[{'version': 'v1', 'created': 'Fri, 14 Jun 2019 06:51:25 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Jun 2020 22:56:16 GMT'}]",2020-06-04,"[['Liberman', 'Andrés Occhipinti', ''], ['Achen', 'Andreas', ''], ['Rendsvig', 'Rasmus Kræmmer', '']]","['epistemic planning', 'planning formalisms', 'multi-agent systems', 'term-modal logic', 'dynamic epistemic logic']"
9134,2209.06813,Sobhan Moosavi,"Amin Karimi Monsefi, Sobhan Moosavi, Rajiv Ramnath","Will there be a construction? Predicting road constructions based on
  heterogeneous spatiotemporal data","In Proceedings of the 30th ACM SIGSPATIAL, International Conference
  on Advances in Geographic Information Systems (2022) [accepted as a short
  paper]",,10.1145/3557915.3560943,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Road construction projects maintain transportation infrastructures. These
projects range from the short-term (e.g., resurfacing or fixing potholes) to
the long-term (e.g., adding a shoulder or building a bridge). Deciding what the
next construction project is and when it is to be scheduled is traditionally
done through inspection by humans using special equipment. This approach is
costly and difficult to scale. An alternative is the use of computational
approaches that integrate and analyze multiple types of past and present
spatiotemporal data to predict location and time of future road constructions.
This paper reports on such an approach, one that uses a
deep-neural-network-based model to predict future constructions. Our model
applies both convolutional and recurrent components on a heterogeneous dataset
consisting of construction, weather, map and road-network data. We also report
on how we addressed the lack of adequate publicly available data - by building
a large scale dataset named ""US-Constructions"", that includes 6.2 million cases
of road constructions augmented by a variety of spatiotemporal attributes and
road-network features, collected in the contiguous United States (US) between
2016 and 2021. Using extensive experiments on several major cities in the US,
we show the applicability of our work in accurately predicting future
constructions - an average f1-score of 0.85 and accuracy 82.2% - that
outperform baselines. Additionally, we show how our training pipeline addresses
spatial sparsity of data.
","[{'version': 'v1', 'created': 'Wed, 14 Sep 2022 17:59:14 GMT'}]",2022-09-15,"[['Monsefi', 'Amin Karimi', ''], ['Moosavi', 'Sobhan', ''], ['Ramnath', 'Rajiv', '']]","['US-Constructions', 'Road Constructions Prediction', 'Dataset']"
9135,2205.11680,Hanyang Liu,"Hanyang Liu, Sunny S. Lou, Benjamin C. Warner, Derek R. Harford,
  Thomas Kannampallil, Chenyang Lu","HiPAL: A Deep Framework for Physician Burnout Prediction Using Activity
  Logs in Electronic Health Records",11 pages including appendices. Accepted by KDD'22,KDD 2022,10.1145/3534678.3539056,,cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Burnout is a significant public health concern affecting nearly half of the
healthcare workforce. This paper presents the first end-to-end deep learning
framework for predicting physician burnout based on electronic health record
(EHR) activity logs, digital traces of physician work activities that are
available in any EHR system. In contrast to prior approaches that exclusively
relied on surveys for burnout measurement, our framework directly learns deep
representations of physician behaviors from large-scale clinician activity logs
to predict burnout. We propose the Hierarchical burnout Prediction based on
Activity Logs (HiPAL), featuring a pre-trained time-dependent activity
embedding mechanism tailored for activity logs and a hierarchical predictive
model, which mirrors the natural hierarchical structure of clinician activity
logs and captures physicians' evolving burnout risk at both short-term and
long-term levels. To utilize the large amount of unlabeled activity logs, we
propose a semi-supervised framework that learns to transfer knowledge extracted
from unlabeled clinician activities to the HiPAL-based prediction model. The
experiment on over 15 million clinician activity logs collected from the EHR at
a large academic medical center demonstrates the advantages of our proposed
framework in predictive performance of physician burnout and training
efficiency over state-of-the-art approaches.
","[{'version': 'v1', 'created': 'Tue, 24 May 2022 00:10:27 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Jul 2022 21:40:33 GMT'}]",2022-07-12,"[['Liu', 'Hanyang', ''], ['Lou', 'Sunny S.', ''], ['Warner', 'Benjamin C.', ''], ['Harford', 'Derek R.', ''], ['Kannampallil', 'Thomas', ''], ['Lu', 'Chenyang', '']]","['EHR activity logs', 'physician wellness', 'deep sequence learning']"
9136,2009.12711,Gasper Begus,Ga\v{s}per Begu\v{s},"Local and non-local dependency learning and emergence of rule-like
  representations in speech data by Deep Convolutional Generative Adversarial
  Networks",In press at Computer Speech & Language,Computer Speech and Language 71 (2022): 101244,10.1016/j.csl.2021.101244,,cs.CL cs.LG,http://creativecommons.org/licenses/by/4.0/,"  This paper argues that training GANs on local and non-local dependencies in
speech data offers insights into how deep neural networks discretize continuous
data and how symbolic-like rule-based morphophonological processes emerge in a
deep convolutional architecture. Acquisition of speech has recently been
modeled as a dependency between latent space and data generated by GANs in
Begu\v{s} (2020b; arXiv:2006.03965), who models learning of a simple local
allophonic distribution. We extend this approach to test learning of local and
non-local phonological processes that include approximations of morphological
processes. We further parallel outputs of the model to results of a behavioral
experiment where human subjects are trained on the data used for training the
GAN network. Four main conclusions emerge: (i) the networks provide useful
information for computational models of speech acquisition even if trained on a
comparatively small dataset of an artificial grammar learning experiment; (ii)
local processes are easier to learn than non-local processes, which matches
both behavioral data in human subjects and typology in the world's languages.
This paper also proposes (iii) how we can actively observe the network's
progress in learning and explore the effect of training steps on learning
representations by keeping latent space constant across different training
steps. Finally, this paper shows that (iv) the network learns to encode the
presence of a prefix with a single latent variable; by interpolating this
variable, we can actively observe the operation of a non-local phonological
process. The proposed technique for retrieving learning representations has
general implications for our understanding of how GANs discretize continuous
speech data and suggests that rule-like generalizations in the training data
are represented as an interaction between variables in the network's latent
space.
","[{'version': 'v1', 'created': 'Sun, 27 Sep 2020 00:02:34 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Jul 2021 07:28:49 GMT'}]",2021-09-14,"[['Beguš', 'Gašper', '']]","['neural networks', 'behavioral experiments', 'machine learning', 'learning biases', 'speech', 'morphology']"
9137,2205.14439,Muhammad Izzatullah,"Muhammad Izzatullah, Isa Eren Yildirim, Umair Bin Waheed, Tariq
  Alkhalifah","Laplace HypoPINN: Physics-Informed Neural Network for hypocenter
  localization and its predictive uncertainty","13 pages, 9 figures",,10.1088/2632-2153/ac94b3,,cs.LG physics.geo-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several techniques have been proposed over the years for automatic hypocenter
localization. While those techniques have pros and cons that trade-off
computational efficiency and the susceptibility of getting trapped in local
minima, an alternate approach is needed that allows robust localization
performance and holds the potential to make the elusive goal of real-time
microseismic monitoring possible. Physics-informed neural networks (PINNs) have
appeared on the scene as a flexible and versatile framework for solving partial
differential equations (PDEs) along with the associated initial or boundary
conditions. We develop HypoPINN -- a PINN-based inversion framework for
hypocenter localization and introduce an approximate Bayesian framework for
estimating its predictive uncertainties. This work focuses on predicting the
hypocenter locations using HypoPINN and investigates the propagation of
uncertainties from the random realizations of HypoPINN's weights and biases
using the Laplace approximation. We train HypoPINN to obtain the optimized
weights for predicting hypocenter location. Next, we approximate the covariance
matrix at the optimized HypoPINN's weights for posterior sampling with the
Laplace approximation. The posterior samples represent various realizations of
HypoPINN's weights. Finally, we predict the locations of the hypocenter
associated with those weights' realizations to investigate the uncertainty
propagation that comes from those realisations. We demonstrate the features of
this methodology through several numerical examples, including using the Otway
velocity model based on the Otway project in Australia.
","[{'version': 'v1', 'created': 'Sat, 28 May 2022 13:59:32 GMT'}]",2023-01-02,"[['Izzatullah', 'Muhammad', ''], ['Yildirim', 'Isa Eren', ''], ['Waheed', 'Umair Bin', ''], ['Alkhalifah', 'Tariq', '']]","['Deep learning', 'Approximate probabilistic inference', 'Simulation', 'Unsupervised learning', 'Neural networks']"
9138,2103.00738,Aoran Xiao,"Aoran Xiao, Xiaofei Yang, Shijian Lu, Dayan Guan and Jiaxing Huang","FPS-Net: A Convolutional Fusion Network for Large-Scale LiDAR Point
  Cloud Segmentation","20 pages, 7 figures",,10.1016/j.isprsjprs.2021.04.011,,cs.CV cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Scene understanding based on LiDAR point cloud is an essential task for
autonomous cars to drive safely, which often employs spherical projection to
map 3D point cloud into multi-channel 2D images for semantic segmentation. Most
existing methods simply stack different point attributes/modalities (e.g.
coordinates, intensity, depth, etc.) as image channels to increase information
capacity, but ignore distinct characteristics of point attributes in different
image channels. We design FPS-Net, a convolutional fusion network that exploits
the uniqueness and discrepancy among the projected image channels for optimal
point cloud segmentation. FPS-Net adopts an encoder-decoder structure. Instead
of simply stacking multiple channel images as a single input, we group them
into different modalities to first learn modality-specific features separately
and then map the learned features into a common high-dimensional feature space
for pixel-level fusion and learning. Specifically, we design a residual dense
block with multiple receptive fields as a building block in the encoder which
preserves detailed information in each modality and learns hierarchical
modality-specific and fused features effectively. In the FPS-Net decoder, we
use a recurrent convolution block likewise to hierarchically decode fused
features into output space for pixel-level classification. Extensive
experiments conducted on two widely adopted point cloud datasets show that
FPS-Net achieves superior semantic segmentation as compared with
state-of-the-art projection-based methods. In addition, the proposed modality
fusion idea is compatible with typical projection-based methods and can be
incorporated into them with consistent performance improvements.
","[{'version': 'v1', 'created': 'Mon, 1 Mar 2021 04:08:28 GMT'}]",2021-07-19,"[['Xiao', 'Aoran', ''], ['Yang', 'Xiaofei', ''], ['Lu', 'Shijian', ''], ['Guan', 'Dayan', ''], ['Huang', 'Jiaxing', '']]","['LiDAR', 'point cloud', 'semantic segmentation', 'spherical projection', 'autonomous driving', 'scene']"
9139,2208.14071,Luca Frittoli,"Luca Frittoli, Diego Carrera, Beatrice Rossi, Pasqualina Fragneto,
  Giacomo Boracchi",Deep Open-Set Recognition for Silicon Wafer Production Monitoring,,"Pattern Recognition Volume 124, April 2022, 108488",10.1016/j.patcog.2021.108488,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The chips contained in any electronic device are manufactured over circular
silicon wafers, which are monitored by inspection machines at different
production stages. Inspection machines detect and locate any defect within the
wafer and return a Wafer Defect Map (WDM), i.e., a list of the coordinates
where defects lie, which can be considered a huge, sparse, and binary image. In
normal conditions, wafers exhibit a small number of randomly distributed
defects, while defects grouped in specific patterns might indicate known or
novel categories of failures in the production line. Needless to say, a primary
concern of semiconductor industries is to identify these patterns and intervene
as soon as possible to restore normal production conditions.
  Here we address WDM monitoring as an open-set recognition problem to
accurately classify WDM in known categories and promptly detect novel patterns.
In particular, we propose a comprehensive pipeline for wafer monitoring based
on a Submanifold Sparse Convolutional Network, a deep architecture designed to
process sparse data at an arbitrary resolution, which is trained on the known
classes. To detect novelties, we define an outlier detector based on a Gaussian
Mixture Model fitted on the latent representation of the classifier. Our
experiments on a real dataset of WDMs show that directly processing
full-resolution WDMs by Submanifold Sparse Convolutions yields superior
classification performance on known classes than traditional Convolutional
Neural Networks, which require a preliminary binning to reduce the size of the
binary images representing WDMs. Moreover, our solution outperforms
state-of-the-art open-set recognition solutions in detecting novelties.
","[{'version': 'v1', 'created': 'Tue, 30 Aug 2022 08:39:52 GMT'}]",2022-08-31,"[['Frittoli', 'Luca', ''], ['Carrera', 'Diego', ''], ['Rossi', 'Beatrice', ''], ['Fragneto', 'Pasqualina', ''], ['Boracchi', 'Giacomo', '']]","['pattern classification', 'open-set recognition', 'sparse convolutions', 'quality inspection', 'wafer monitoring']"
9140,2111.00977,Gan Tong,Gan Tong and Libo Huang,"Fast Convolution based on Winograd Minimum Filtering: Introduction and
  Development","15 pages, 1 figure",,10.5121/csit.2021.111716,,cs.AI cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convolutional Neural Network (CNN) has been widely used in various fields and
played an important role. Convolution operators are the fundamental component
of convolutional neural networks, and it is also the most time-consuming part
of network training and inference. In recent years, researchers have proposed
several fast convolution algorithms including FFT and Winograd. Among them,
Winograd convolution significantly reduces the multiplication operations in
convolution, and it also takes up less memory space than FFT convolution.
Therefore, Winograd convolution has quickly become the first choice for fast
convolution implementation within a few years. At present, there is no
systematic summary of the convolution algorithm. This article aims to fill this
gap and provide detailed references for follow-up researchers. This article
summarizes the development of Winograd convolution from the three aspects of
algorithm expansion, algorithm optimization, implementation, and application,
and finally makes a simple outlook on the possible future directions.
","[{'version': 'v1', 'created': 'Mon, 1 Nov 2021 14:39:56 GMT'}]",2021-11-02,"[['Tong', 'Gan', ''], ['Huang', 'Libo', '']]","['Winograd Minimum Filtering', 'Winograd Convolution', 'Fast Convolution', 'Convolution Optimization']"
9141,2010.13697,Kristina Wolfe,"Kristina Wolfe, Douglas Swanson, Rupert Till","The Frequency Spectrum and Geometry of the Hal Saflieni Hypogeum Appear
  Tuned","8 pages, 6 figures. Accepted to Journal of Archaeological Science:
  Reports (2020)",Journal of Archaeological Science: Reports 34 (2020),10.1016/j.jasrep.2020.102623,,cs.SD eess.AS physics.app-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Hal Saflieni Hypogeum is a unique subterranean Maltese Neolithic
sanctuary with a well-documented history of interest in its acoustics. Previous
studies have noted its unusual strongly-defined frequency spectrum, but it is
unknown if this was coincidental. In this paper, we present evidence that the
Hypogeum's creators shaped the site's geometry to create or amplify its
frequency spectrum, or another property closely correlated with the spectrum.
Specifically, we show that the observed spectrum required jointly fine-tuning
the dimensions of multiple non-contiguous cave walls across multiple
independent chambers, to a degree that seems unlikely to be coincidental. We
also note that the peak frequencies are evenly spaced and resemble a whole-tone
scale in music, which is also unlikely to be coincidental and suggests the
spectrum itself might have held some cultural significance. Taken together, it
suggests acoustic or spectral properties may have played a motivational or
cultural role for the site's Neolithic creators. This work identifies one of
the earliest known examples of a manmade structure with a significant musical
element to its interior architecture.
","[{'version': 'v1', 'created': 'Mon, 26 Oct 2020 16:28:49 GMT'}]",2020-11-03,"[['Wolfe', 'Kristina', ''], ['Swanson', 'Douglas', ''], ['Till', 'Rupert', '']]","['¯H¯al Saflieni Hypogeum', 'Malta', 'Neolithic', 'sound archaeology', 'archaeoacoustics', 'cave acoustics', 'acousticmodeling']"
9142,2103.00499,Steffen Wendzel,Steffen Wendzel,"Protocol-independent Detection of ""Messaging Ordering"" Network Covert
  Channels",,Published in Proc. ARES 2019 (CUING Workshop),10.1145/3339252.3341477,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detection methods are available for several known covert channels. However, a
type of covert channel that received little attention within the last decade is
the ""message ordering"" channel. Such a covert channel changes the order of PDUs
(protocol data units, i.e. packets) transferred over the network to encode
hidden information. The advantage of these channels is that they cannot be
blocked easily as they do not modify header content but instead mimic typical
network behavior such as TCP segments that arrive in a different order than
they were sent.
  Contribution: In this paper, we show a protocol-independent approach to
detect message ordering channels. Our approach is based on a modified
compressibility score. We analyze the detectability of message ordering
channels and whether several types of message ordering channels differ in their
detectability.
  Results: Our results show that the detection of message ordering channels
depends on their number of utilized PDUs. First, we performed a rough threshold
selection by hand, which we later optimized using the C4.5 decision tree
classifier. We were able to detect message ordering covert channels with an
accuracy and F1 score of >= 99.5% and a false-positive rate < 1% and < 0.1% if
they use sequences of 3 or 4 PDUs, respectively. Simpler channels that only
manipulate a sequence of two PDUs were detectable with an accuracy and F1 score
of 94.5% and were linked to a false-positive rate of 5.19%. We thus consider
our approach suitable for real-world detection scenarios with channels
utilizing 3 or 4 PDUs while the detection of channels utilizing 2 PDUs should
be improved further.
","[{'version': 'v1', 'created': 'Sun, 28 Feb 2021 13:02:07 GMT'}]",2021-03-02,"[['Wendzel', 'Steffen', '']]","['Covert Channels', 'Steganography', 'Information Hiding', 'Stegomalware', 'Hiding Patterns', 'Message Ordering Pattern', 'PDU Order Pattern']"
9143,1601.06521,EPTCS,"Bishoksan Kafle (Roskilde University), John P. Gallagher (Roskilde
  University)","Interpolant Tree Automata and their Application in Horn Clause
  Verification","In Proceedings VPT 2016, arXiv:1607.01835","EPTCS 216, 2016, pp. 104-117",10.4204/EPTCS.216.6,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates the combination of abstract interpretation over the
domain of convex polyhedra with interpolant tree automata, in an
abstraction-refinement scheme for Horn clause verification. These techniques
have been previously applied separately, but are combined in a new way in this
paper. The role of an interpolant tree automaton is to provide a generalisation
of a spurious counterexample during refinement, capturing a possibly infinite
set of spurious counterexample traces. In our approach these traces are then
eliminated using a transformation of the Horn clauses. We compare this approach
with two other methods; one of them uses interpolant tree automata in an
algorithm for trace abstraction and refinement, while the other uses abstract
interpretation over the domain of convex polyhedra without the generalisation
step. Evaluation of the results of experiments on a number of Horn clause
verification problems indicates that the combination of interpolant tree
automaton with abstract interpretation gives some increase in the power of the
verification tool, while sometimes incurring a performance overhead.
","[{'version': 'v1', 'created': 'Mon, 25 Jan 2016 09:16:44 GMT'}, {'version': 'v2', 'created': 'Sun, 10 Jul 2016 04:49:20 GMT'}]",2016-07-12,"[['Kafle', 'Bishoksan', '', 'Roskilde University'], ['Gallagher', 'John P.', '', 'Roskilde\n  University']]","['Interpolant tree automata', 'Horn clauses', 'abstraction-refinement', 'trace abstraction']"
9144,2110.09887,Vanessa Silva,"Vanessa Freitas Silva, Maria Eduarda Silva, Pedro Ribeiro and Fernando
  Silva",Time Series Analysis via Network Science: Concepts and Algorithms,,,10.1002/widm.1404,,cs.SI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is nowadays a constant flux of data being generated and collected in
all types of real world systems. These data sets are often indexed by time,
space or both requiring appropriate approaches to analyze the data. In
univariate settings, time series analysis is a mature and solid field. However,
in multivariate contexts, time series analysis still presents many limitations.
In order to address these issues, the last decade has brought approaches based
on network science. These methods involve transforming an initial time series
data set into one or more networks, which can be analyzed in depth to provide
insight into the original time series. This review provides a comprehensive
overview of existing mapping methods for transforming time series into networks
for a wide audience of researchers and practitioners in machine learning, data
mining and time series. Our main contribution is a structured review of
existing methodologies, identifying their main characteristics and their
differences. We describe the main conceptual approaches, provide authoritative
references and give insight into their advantages and limitations in a unified
notation and language. We first describe the case of univariate time series,
which can be mapped to single layer networks, and we divide the current
mappings based on the underlying concept: visibility, transition and proximity.
We then proceed with multivariate time series discussing both single layer and
multiple layer approaches. Although still very recent, this research area has
much potential and with this survey we intend to pave the way for future
research on the topic.
","[{'version': 'v1', 'created': 'Mon, 11 Oct 2021 13:33:18 GMT'}]",2021-10-20,"[['Silva', 'Vanessa Freitas', ''], ['Silva', 'Maria Eduarda', ''], ['Ribeiro', 'Pedro', ''], ['Silva', 'Fernando', '']]","['univariate time series', 'multivariate time series', 'network science', 'mapping methods']"
9145,1910.03818,Run-Qing Chen,Run-Qing Chen and Guang-Hui Shi and Wan-Lei Zhao and Chang-Hui Liang,A Joint Model for IT Operation Series Prediction and Anomaly Detection,This paper has been published in Neurocomputing,"Volume 448, 11 August 2021, Pages 130-139",10.1016/j.neucom.2021.03.062,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Status prediction and anomaly detection are two fundamental tasks in
automatic IT systems monitoring. In this paper, a joint model Predictor &
Anomaly Detector (PAD) is proposed to address these two issues under one
framework. In our design, the variational auto-encoder (VAE) and long
short-term memory (LSTM) are joined together. The prediction block (LSTM) takes
clean input from the reconstructed time series by VAE, which makes it robust to
the anomalies and noise for prediction task. In the meantime, the LSTM block
maintains the long-term sequential patterns, which are out of the sight of a
VAE encoding window. This leads to the better performance of VAE in anomaly
detection than it is trained alone. In the whole processing pipeline, the
spectral residual analysis is integrated with VAE and LSTM to boost the
performance of both. The superior performance on two tasks is confirmed with
the experiments on two challenging evaluation benchmarks.
","[{'version': 'v1', 'created': 'Wed, 9 Oct 2019 07:25:33 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Oct 2019 07:21:37 GMT'}, {'version': 'v3', 'created': 'Fri, 26 Jun 2020 13:20:57 GMT'}, {'version': 'v4', 'created': 'Wed, 9 Dec 2020 01:54:56 GMT'}, {'version': 'v5', 'created': 'Thu, 22 Apr 2021 03:26:59 GMT'}]",2021-04-23,"[['Chen', 'Run-Qing', ''], ['Shi', 'Guang-Hui', ''], ['Zhao', 'Wan-Lei', ''], ['Liang', 'Chang-Hui', '']]","['time series', 'unsupervised anomaly detection', 'robust prediction']"
9146,2012.06344,Raffaele Marino,Raffaele Marino,Learning from Survey Propagation: a Neural Network for MAX-E-$3$-SAT,,Mach. Learn.: Sci. Technol. 2 (2021) 035032,10.1088/2632-2153/ac0496,,cs.AI,http://creativecommons.org/publicdomain/zero/1.0/,"  Many natural optimization problems are NP-hard, which implies that they are
probably hard to solve exactly in the worst-case. However, it suffices to get
reasonably good solutions for all (or even most) instances in practice. This
paper presents a new algorithm for computing approximate solutions in
${\Theta(N})$ for the Maximum Exact 3-Satisfiability (MAX-E-$3$-SAT) problem by
using deep learning methodology. This methodology allows us to create a
learning algorithm able to fix Boolean variables by using local information
obtained by the Survey Propagation algorithm. By performing an accurate
analysis, on random CNF instances of the MAX-E-$3$-SAT with several Boolean
variables, we show that this new algorithm, avoiding any decimation strategy,
can build assignments better than a random one, even if the convergence of the
messages is not found. Although this algorithm is not competitive with
state-of-the-art Maximum Satisfiability (MAX-SAT) solvers, it can solve
substantially larger and more complicated problems than it ever saw during
training.
","[{'version': 'v1', 'created': 'Thu, 10 Dec 2020 07:59:54 GMT'}, {'version': 'v2', 'created': 'Sun, 14 Feb 2021 09:22:57 GMT'}]",2022-09-13,"[['Marino', 'Raffaele', '']]","['Maximum Satisfiability', 'message passing', 'combinatorial optimization', 'deeplearning']"
9147,2111.02259,Gerhard Hagerer M.Sc.,"Gerhard Hagerer, Wing Sheung Leung, Qiaoxi Liu, Hannah Danner, Georg
  Groh","A Case Study and Qualitative Analysis of Simple Cross-Lingual Opinion
  Mining","10 pages, 2 tables, 5 figures, full paper, peer-reviewed, published
  at KDIR/IC3k 2021 conference","Proceedings of the 13th International Joint Conference on
  Knowledge Discovery, Knowledge Engineering and Knowledge Management - KDIR
  2021",10.5220/0010649500003064,,cs.CL cs.IR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  User-generated content from social media is produced in many languages,
making it technically challenging to compare the discussed themes from one
domain across different cultures and regions. It is relevant for domains in a
globalized world, such as market research, where people from two nations and
markets might have different requirements for a product. We propose a simple,
modern, and effective method for building a single topic model with sentiment
analysis capable of covering multiple languages simultanteously, based on a
pre-trained state-of-the-art deep neural network for natural language
understanding. To demonstrate its feasibility, we apply the model to newspaper
articles and user comments of a specific domain, i.e., organic food products
and related consumption behavior. The themes match across languages.
Additionally, we obtain an high proportion of stable and domain-relevant
topics, a meaningful relation between topics and their respective textual
contents, and an interpretable representation for social media documents.
Marketing can potentially benefit from our method, since it provides an
easy-to-use means of addressing specific customer interests from different
market regions around the globe. For reproducibility, we provide the code,
data, and results of our study.
","[{'version': 'v1', 'created': 'Wed, 3 Nov 2021 14:49:50 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Nov 2021 12:48:04 GMT'}]",2021-11-05,"[['Hagerer', 'Gerhard', ''], ['Leung', 'Wing Sheung', ''], ['Liu', 'Qiaoxi', ''], ['Danner', 'Hannah', ''], ['Groh', 'Georg', '']]","['Opinion Mining', 'Topic Modeling', 'Sentiment Analysis', 'Cross-Lingual', 'Multi-Lingual', 'Market Research']"
9148,2001.06833,Janine Mergel,"Janine C. Mergel, Julien Scheibert, Roger A. Sauer","Contact with coupled adhesion and friction: Computational framework,
  applications, and new insights",,"Journal of the Mechanics and Physics of Solids 146:104194, 2021",10.1016/j.jmps.2020.104194,,cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Contact involving soft materials often combines dry adhesion, sliding
friction, and large deformations. At the local level, these three aspects are
rarely captured simultaneously, but included in the theoretical models by
Mergel et al. (2019). We here develop a corresponding finite element framework
that captures 3D finite-strain contact of two deformable bodies. This framework
is suitable to investigate sliding friction even under tensile normal loads.
First, we demonstrate the capabilities of our finite element model using both
2D and 3D test cases, which range from compliant tapes to structures with high
stiffness, and include deformable-rigid and deformable-deformable contact. We
then provide new results on the onset of sliding of smooth elastomer-glass
interfaces, a setup that couples nonlinear material behavior, adhesion, and
large frictional stresses. Our simulations not only agree well with both
experimental and theoretical findings, they also provide new insights into the
current debate on the shear-induced reduction of the contact area in
elastomeric contact.
","[{'version': 'v1', 'created': 'Sun, 19 Jan 2020 14:15:35 GMT'}, {'version': 'v2', 'created': 'Sun, 5 Jul 2020 14:28:17 GMT'}, {'version': 'v3', 'created': 'Tue, 1 Dec 2020 19:27:02 GMT'}]",2020-12-03,"[['Mergel', 'Janine C.', ''], ['Scheibert', 'Julien', ''], ['Sauer', 'Roger A.', '']]","['van der Waals interactions', 'computational contact mechanics', 'nonlinear finite elementmethods', 'peeling', 'elastomer contact']"
9149,2212.11101,Mehdi Delrobaei,"Paniz Sedighi, Mohammad Hesam Norouzi, Mehdi Delrobaei",An RFID-Based Assistive Glove to Help the Visually Impaired,,"IEEE Transactions on Instrumentation and Measurement 70 (2021):
  1-9",10.1109/TIM.2021.3069834,,cs.HC cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Recent studies have focused on facilitating perception and outdoor navigation
for people with blindness or some form of vision loss. However, a significant
portion of these studies is centered around treatment and vision
rehabilitation, leaving some immediate needs, such as interaction with the
surrounding objects or recognizing colors and fine patterns without tactile
feedback. This study targets such needs and delivers a straightforward
communication method using a wearable, unobtrusive device with the environment.
We initially discuss the advantages and limitations of related works to draw
out the best-fitting design concepts. Then, we introduce the potential for
emerging technologies such as radio-frequency identification. We present the
design details and the experimental results of an assistive glove to allow
people with vision disabilities to interact with the environment more
efficiently. Based on the collected data from 17 blind-folded healthy
participants, the implemented system's success rate in identifying objects was
about 96.32%. Overall, 70% of the users found the device very satisfactory.
","[{'version': 'v1', 'created': 'Wed, 21 Dec 2022 15:44:34 GMT'}]",2022-12-22,"[['Sedighi', 'Paniz', ''], ['Norouzi', 'Mohammad Hesam', ''], ['Delrobaei', 'Mehdi', '']]","['Low vision', 'wearable technologies', 'human-machine']"
9150,1812.09351,Quang Minh Ha,"Quang Minh Ha, Yves Deville, Quang Dung Pham, Minh Ho\`ang H\`a",A Hybrid Genetic Algorithm for the Traveling Salesman Problem with Drone,"Technical Report. 34 pages, 5 figures",,10.1007/s10732-019-09431-y,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the Traveling Salesman Problem with Drone (TSP-D), in
which a truck and drone are used to deliver parcels to customers. The objective
of this problem is to either minimize the total operational cost (min-cost
TSP-D) or minimize the completion time for the truck and drone (min-time
TSP-D). This problem has gained a lot of attention in the last few years since
it is matched with the recent trends in a new delivery method among logistics
companies. To solve the TSP-D, we propose a hybrid genetic search with dynamic
population management and adaptive diversity control based on a split
algorithm, problem-tailored crossover and local search operators, a new restore
method to advance the convergence and an adaptive penalization mechanism to
dynamically balance the search between feasible/infeasible solutions. The
computational results show that the proposed algorithm outperforms existing
methods in terms of solution quality and improves best known solutions found in
the literature. Moreover, various analyses on the impacts of crossover choice
and heuristic components have been conducted to analysis further their
sensitivity to the performance of our method.
","[{'version': 'v1', 'created': 'Fri, 21 Dec 2018 19:42:56 GMT'}]",2019-11-20,"[['Ha', 'Quang Minh', ''], ['Deville', 'Yves', ''], ['Pham', 'Quang Dung', ''], ['Hà', 'Minh Hoàng', '']]","['Traveling Salesman Problem with Drone', 'metaheuristic', 'genetic']"
9151,1909.02960,Emil Pricop,"Florin Zamfir, Nicolae Paraschiv, Emil Pricop",Real-time stock analysis for blending recipes in industrial plants,"Accepted for presentation at 23rd International Conference on System
  Theory, Control and Computing (ICSTCC 2019), October 9-11, 2019, Sinaia,
  Romania",,10.1109/ICSTCC.2019.8886147,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many companies use Excel spreadsheets to keep stock records and to calculate
process-specific data. These spreadsheets are often hard to understand and
track. And if the user does not protect them, there is a risk that the user
randomly changes or erase formulas. The paper focuses on the stocks of products
used in a blending process with a known recipe. Developing an application that
can bring this data in a centralized form and that can assist the operator in
decide is a necessity. When a programmer implements an application that uses
data from plants he needs to consider one fundamental aspect as reading
real-time data from the process. The real-time stock analysis application takes
into account all the above elements. The application is easy to use by an
operator in the command room of installation because of the planning algorithms
integrated into it. The algorithms proposed and implemented in this paper have
well-defined goals: identifying the ingredients needed to achieve the blending
process for required quantities, determine the quantities of the finished
product that can be made with the existing ingredients and determine the
optimum quantities of the finished product. The application implemented in C#
intensively uses these algorithms and gives the user the ability to build the
result step by step.
","[{'version': 'v1', 'created': 'Thu, 29 Aug 2019 13:36:09 GMT'}]",2019-12-03,"[['Zamfir', 'Florin', ''], ['Paraschiv', 'Nicolae', ''], ['Pricop', 'Emil', '']]","['blending recipes', 'algorithm', 'C#', 'planning']"
9152,2207.06937,Chenyang Qi,"Chenyang Qi, Junming Chen, Xin Yang, Qifeng Chen",Real-time Streaming Video Denoising with Bidirectional Buffers,"Accepted to ACM MM 2022; Github link:
  https://github.com/ChenyangQiQi/BSVD ;",,10.1145/3503161.3547934,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video streams are delivered continuously to save the cost of storage and
device memory. Real-time denoising algorithms are typically adopted on the user
device to remove the noise involved during the shooting and transmission of
video streams. However, sliding-window-based methods feed multiple input frames
for a single output and lack computation efficiency. Recent multi-output
inference works propagate the bidirectional temporal feature with a parallel or
recurrent framework, which either suffers from performance drops on the
temporal edges of clips or can not achieve online inference. In this paper, we
propose a Bidirectional Streaming Video Denoising (BSVD) framework, to achieve
high-fidelity real-time denoising for streaming videos with both past and
future temporal receptive fields. The bidirectional temporal fusion for online
inference is considered not applicable in the MoViNet. However, we introduce a
novel Bidirectional Buffer Block as the core module of our BSVD, which makes it
possible during our pipeline-style inference. In addition, our method is
concise and flexible to be utilized in both non-blind and blind video
denoising. We compare our model with various state-of-the-art video denoising
models qualitatively and quantitatively on synthetic and real noise. Our method
outperforms previous methods in terms of restoration fidelity and runtime. Our
source code is publicly available at https://github.com/ChenyangQiQi/BSVD
","[{'version': 'v1', 'created': 'Thu, 14 Jul 2022 14:01:03 GMT'}]",2022-07-15,"[['Qi', 'Chenyang', ''], ['Chen', 'Junming', ''], ['Yang', 'Xin', ''], ['Chen', 'Qifeng', '']]","['Video Denoising', 'Efficient Inference', 'Online Inference']"
9153,1710.03575,Pei Cao,"Pei Cao, Qi Shuai, Jiong Tang","A Multi-Objective DIRECT Algorithm Towards Structural Damage
  Identification with Limited Dynamic Response Information",,,10.1115/1.4038630,,cs.CE physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A major challenge in Structural Health Monitoring (SHM) is to accurately
identify both the location and severity of damage using the dynamic response
information acquired. While in theory the vibration-based and impedance-based
methods may facilitate damage identification with the assistance of a credible
baseline finite element model since the changes of stationary wave responses
are used in these methods, the response information is generally limited and
the measurements may be heterogeneous, making an inverse analysis using
sensitivity matrix difficult. Aiming at fundamental advancement, in this
research we cast the damage identification problem into an optimization problem
where possible changes of finite element properties due to damage occurrence
are treated as unknowns. We employ the multiple damage location assurance
criterion (MDLAC), which characterizes the relation between measurements and
predictions (under sampled elemental property changes), as the vector-form
objective function. We then develop an enhanced, multi-objective version of the
DIRECT approach to solve the optimization problem. The underlying idea of the
multi-objective DIRECT approach is to branch and bound the unknown parametric
space to converge to a set of optimal solutions. A new sampling scheme is
established, which significantly increases the efficiency in minimizing the
error between measurements and predictions. The enhanced DIRECT algorithm is
particularly suitable to solving for unknowns that are sparse, as in practical
situations structural damage affect only a small number of finite elements. A
number of test cases using vibration response information are executed to
demonstrate the effectiveness of the new approach.
","[{'version': 'v1', 'created': 'Thu, 5 Oct 2017 19:53:06 GMT'}]",2018-10-30,"[['Cao', 'Pei', ''], ['Shuai', 'Qi', ''], ['Tang', 'Jiong', '']]","['damage identification', 'MDLAC', 'multi-objective optimization', 'DIRECT algorithm']"
9154,2107.14077,Soaad Hossain Mr,"Soraia Oueida, Soaad Hossain, Yehia Kotb, Syed Ishtiaque Ahmed","A Fair and Ethical Healthcare Artificial Intelligence System for
  Monitoring Driver Behavior and Preventing Road Accidents","This is a preprint of the following chapter: A Fair and Ethical
  Healthcare Artificial Intelligence System for Monitoring Driver Behavior and
  Preventing Road Accidents, published in Proceedings of the Future
  Technologies Conference (FTC) 2021, edited by Kohei Arai, reproduced with
  permission. The final authenticated version is available online at:
  https://doi.org/10.1007/978-3-030-89880-9_33",,10.1007/978-3-030-89880-9_33,,cs.CY cs.AI cs.HC cs.LG,http://creativecommons.org/licenses/by/4.0/,"  This paper presents a new approach to prevent transportation accidents and
monitor driver's behavior using a healthcare AI system that incorporates
fairness and ethics. Dangerous medical cases and unusual behavior of the driver
are detected. Fairness algorithm is approached in order to improve
decision-making and address ethical issues such as privacy issues, and to
consider challenges that appear in the wild within AI in healthcare and
driving. A healthcare professional will be alerted about any unusual activity,
and the driver's location when necessary, is provided in order to enable the
healthcare professional to immediately help to the unstable driver. Therefore,
using the healthcare AI system allows for accidents to be predicted and thus
prevented and lives may be saved based on the built-in AI system inside the
vehicle which interacts with the ER system.
","[{'version': 'v1', 'created': 'Wed, 16 Jun 2021 20:23:42 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Nov 2021 04:39:32 GMT'}]",2021-11-09,"[['Oueida', 'Soraia', ''], ['Hossain', 'Soaad', ''], ['Kotb', 'Yehia', ''], ['Ahmed', 'Syed Ishtiaque', '']]","['artificial intelligence (AI)', 'driver monitoring', 'road accident', 'healthcare', 'behavior']"
9155,1904.08233,Issam Damaj,"Issam Damaj (1), Hassan Diab (2) ((1) London South Bank University,
  (2) American University of Beirut)","Performance Analysis of Linear Algebraic Functions using Reconfigurable
  Computing","22 pages, 17 figures, 5 tables. arXiv admin note: substantial text
  overlap with arXiv:1904.04953; text overlap with arXiv:1904.06198",Intl. Jrnl. of. Super. Comp. 24(2003) 91-107,10.1023/A:1020993510939,,cs.AR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a new mapping of geometrical transformation on the
MorphoSys (M1) reconfigurable computing (RC) system. New mapping techniques for
some linear algebraic functions are recalled. A new mapping for geometrical
transformation operations is introduced and their performance on the M1 system
is evaluated. The translation and scaling transformation addressed in this
mapping employ some vector-vector and vector-scalar operations [6-7]. A
performance analysis study of the M1 RC system is also presented to evaluate
the efficiency of the algorithm execution. Numerical examples were simulated to
validate our results, using the MorphoSys mULATE program, which emulates M1
operations.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2019 20:15:29 GMT'}]",2019-04-18,"[['Damaj', 'Issam', ''], ['Diab', 'Hassan', '']]","['Reconfigurable Computing', 'Geometrical Transformations', 'MorphoSys', 'Parallel']"
9156,2111.03480,Christos Kyrkou,"Andreas Papachristodoulou, Christos Kyrkou, Theocharis Theocharides","DriveGuard: Robustification of Automated Driving Systems with Deep
  Spatio-Temporal Convolutional Autoencoder","2021 IEEE Winter Conference on Applications of Computer Vision
  Workshops (WACVW)",,10.1109/WACVW52041.2021.00016,,cs.CV cs.AI cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Autonomous vehicles increasingly rely on cameras to provide the input for
perception and scene understanding and the ability of these models to classify
their environment and objects, under adverse conditions and image noise is
crucial. When the input is, either unintentionally or through targeted attacks,
deteriorated, the reliability of autonomous vehicle is compromised. In order to
mitigate such phenomena, we propose DriveGuard, a lightweight spatio-temporal
autoencoder, as a solution to robustify the image segmentation process for
autonomous vehicles. By first processing camera images with DriveGuard, we
offer a more universal solution than having to re-train each perception model
with noisy input. We explore the space of different autoencoder architectures
and evaluate them on a diverse dataset created with real and synthetic images
demonstrating that by exploiting spatio-temporal information combined with
multi-component loss we significantly increase robustness against adverse image
effects reaching within 5-6% of that of the original model on clean images.
","[{'version': 'v1', 'created': 'Fri, 5 Nov 2021 12:57:38 GMT'}]",2021-11-08,"[['Papachristodoulou', 'Andreas', ''], ['Kyrkou', 'Christos', ''], ['Theocharides', 'Theocharis', '']]","['Autonomous Driving', 'Cyber-security', 'Computer Vision', 'Deep Learning', 'Machine Learning']"
9157,2209.07333,Murtuza Shahzad Syed,"Murtuza Shahzad, Hamed Alhoori",Public Reaction to Scientific Research via Twitter Sentiment Prediction,Journal of Data and Information Sciences,"Journal of Data and Information Science (2022), Volume 7, Issue 1,
  97-124",10.2478/jdis-2022-0003,,cs.IR cs.AI cs.LG cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Social media users share their ideas, thoughts, and emotions with other
users. However, it is not clear how online users would respond to new research
outcomes. This study aims to predict the nature of the emotions expressed by
Twitter users toward scientific publications. Additionally, we investigate what
features of the research articles help in such prediction. Identifying the
sentiments of research articles on social media will help scientists gauge a
new societal impact of their research articles.
","[{'version': 'v1', 'created': 'Sun, 11 Sep 2022 17:24:37 GMT'}]",2022-09-16,"[['Shahzad', 'Murtuza', ''], ['Alhoori', 'Hamed', '']]","['Sentiment Analysis', 'Social Media', 'Twitter', 'Emotional Impact', 'Public']"
9158,2007.10146,"Malin K\""all\'en","Malin K\""all\'en, Tobias Wrigstad",Jupyter Notebooks on GitHub: Characteristics and Code Clones,,"The Art, Science, and Engineering of Programming, 2021, Vol. 5,
  Issue 3, Article 15",10.22152/programming-journal.org/2021/5/15,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Jupyter notebooks has emerged as a standard tool for data science
programming. Programs in Jupyter notebooks are different from typical programs
as they are constructed by a collection of code snippets interleaved with text
and visualisation. This allows interactive exploration and snippets may be
executed in different order which may give rise to different results due to
side-effects between snippets. Previous studies have shown the presence of
considerable code duplication -- code clones -- in sources of traditional
programs, in both so-called systems programming languages and so-called
scripting languages. In this paper we present the first large-scale study of
code cloning in Jupyter notebooks. We analyse a corpus of 2.7 million Jupyter
notebooks hosted on GitHJub, representing 37 million individual snippets and
227 million lines of code. We study clones at the level of individual snippets,
and study the extent to which snippets are recurring across multiple notebooks.
We study both identical clones and approximate clones and conduct a small-scale
ocular inspection of the most common clones. We find that code cloning is
common in Jupyter notebooks -- more than 70% of all code snippets are exact
copies of other snippets (with possible differences in white spaces), and
around 50% of all notebooks do not have any unique snippet, but consists solely
of snippets that are also found elsewhere. In notebooks written in Python, at
least 80% of all snippets are approximate clones and the prevalence of code
cloning is higher in Python than in other languages. We further find that
clones between different repositories are far more common than clones within
the same repository. However, the most common individual repository from which
a Jupyter notebook contains clones is the repository in which itself resides.
","[{'version': 'v1', 'created': 'Mon, 20 Jul 2020 14:19:10 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Feb 2021 22:38:32 GMT'}]",2021-03-02,"[['Källén', 'Malin', ''], ['Wrigstad', 'Tobias', '']]","['Jupyter notebooks', 'Mining software repositories', 'Code cloning', 'Software analytics']"
9159,2109.10523,Ding Lyu,"Ding Lyu, Yuan Yuan, Lin Wang, Xiaofan Wang, Alex Pentland",Investigating and Modeling the Dynamics of Long Ties,Forthcoming at Communications Physics (Nature portfolio),Commun. Phys. 5 (2022) 87,10.1038/s42005-022-00863-w,,cs.SI cs.GT cs.LG physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Long ties, the social ties that bridge different communities, are widely
believed to play crucial roles in spreading novel information in social
networks. However, some existing network theories and prediction models
indicate that long ties might dissolve quickly or eventually become redundant,
thus putting into question the long-term value of long ties. Our empirical
analysis of real-world dynamic networks shows that contrary to such reasoning,
long ties are more likely to persist than other social ties, and that many of
them constantly function as social bridges without being embedded in local
networks. Using a novel cost-benefit analysis model combined with machine
learning, we show that long ties are highly beneficial, which instinctively
motivates people to expend extra effort to maintain them. This partly explains
why long ties are more persistent than what has been suggested by many existing
theories and models. Overall, our study suggests the need for social
interventions that can promote the formation of long ties, such as mixing
people with diverse backgrounds.
","[{'version': 'v1', 'created': 'Wed, 22 Sep 2021 05:40:45 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Dec 2021 04:36:29 GMT'}, {'version': 'v3', 'created': 'Sat, 2 Apr 2022 07:23:50 GMT'}]",2022-04-15,"[['Lyu', 'Ding', ''], ['Yuan', 'Yuan', ''], ['Wang', 'Lin', ''], ['Wang', 'Xiaofan', ''], ['Pentland', 'Alex', '']]","['long ties', 'networks dynamics', 'network embedding', 'strategic network formation']"
9160,1604.05535,J. G. Wolff,J Gerard Wolff,"The SP theory of intelligence and the representation and processing of
  knowledge in the brain",,"Frontiers in Psychology, 7, 1584, 2016",10.3389/fpsyg.2016.01584,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ""SP theory of intelligence"", with its realisation in the ""SP computer
model"", aims to simplify and integrate observations and concepts across
AI-related fields, with information compression as a unifying theme. This paper
describes how abstract structures and processes in the theory may be realised
in terms of neurons, their interconnections, and the transmission of signals
between neurons. This part of the SP theory -- ""SP-neural"" -- is a tentative
and partial model for the representation and processing of knowledge in the
brain. In the SP theory (apart from SP-neural), all kinds of knowledge are
represented with ""patterns"", where a pattern is an array of atomic symbols in
one or two dimensions. In SP-neural, the concept of a ""pattern"" is realised as
an array of neurons called a ""pattern assembly"", similar to Hebb's concept of a
""cell assembly"" but with important differences. Central to the processing of
information in the SP system is the powerful concept of ""multiple alignment"",
borrowed and adapted from bioinformatics. Processes such as pattern
recognition, reasoning and problem solving are achieved via the building of
multiple alignments, while unsupervised learning -- significantly different
from the ""Hebbian"" kinds of learning -- is achieved by creating patterns from
sensory information and also by creating patterns from multiple alignments in
which there is a partial match between one pattern and another. Short-lived
neural structures equivalent to multiple alignments will be created via an
inter-play of excitatory and inhibitory neural signals. The paper discusses
several associated issues, with relevant empirical evidence.
","[{'version': 'v1', 'created': 'Tue, 19 Apr 2016 12:04:14 GMT'}, {'version': 'v2', 'created': 'Thu, 12 May 2016 11:29:50 GMT'}]",2016-12-12,"[['Wolff', 'J Gerard', '']]","['multiple alignment', 'cell assembly', 'information compression', 'unsupervised learning', 'artificial intelligence']"
9161,1906.01696,Samin Aref,"Samin Aref, Zachary Neal","Detecting coalitions by optimally partitioning signed networks of
  political collaboration","21 pages, 10 figures, 4 tables (including supplementary information)
  Old title: Legislative effectiveness hangs in the balance: Studying balance
  and polarization through partitioning signed networks","AREF, S., and NEAL, Z. Detecting coalitions by optimally
  partitioning signed networks of political collaboration. Scientific Reports,
  (2020), www.doi.org/10.1038/s41598-020-58471-z",10.1038/s41598-020-58471-z,,cs.SI math.OC physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose new mathematical programming models for optimal partitioning of a
signed graph into cohesive groups. To demonstrate the approach's utility, we
apply it to identify coalitions in US Congress since 1979 and examine the
impact of polarized coalitions on the effectiveness of passing bills. Our
models produce a globally optimal solution to the NP-hard problem of minimizing
the total number of intra-group negative and inter-group positive edges. We
tackle the intensive computations of dense signed networks by providing upper
and lower bounds, then solving an optimization model which closes the gap
between the two bounds and returns the optimal partitioning of vertices. Our
substantive findings suggest that the dominance of an ideologically homogeneous
coalition (i.e. partisan polarization) can be a protective factor that enhances
legislative effectiveness.
","[{'version': 'v1', 'created': 'Tue, 4 Jun 2019 19:37:06 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Aug 2019 09:44:43 GMT'}, {'version': 'v3', 'created': 'Fri, 17 Jan 2020 19:52:28 GMT'}]",2020-01-22,"[['Aref', 'Samin', ''], ['Neal', 'Zachary', '']]","['Signed network', 'Polarization', 'Balance theory', 'Graph partitioning']"
9162,1711.10553,Lili Sun,"Lili Sun, Jianming Yong and Jeffrey Soar",Access control management for e-Healthcare in cloud environment,11 pages,"EAI Endorsed Transactions on Scalable Information Systems 14(2):
  e3, 2014",10.4108/sis.1.2.e3,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semantic web technologies represent much richer forms of relationships among
users, resources and actions among different web applications such as clouding
computing. However, Semantic web applications pose new requirements for
security mechanisms especially in the access control models. This paper
addresses existing access control methods and presents a semantic based access
control model which considers semantic relations among different entities in
cloud computing environment. We have enriched the research for semantic web
technology with role-based access control that is able to be applied in the
field of medical information system or e-Healthcare system. This work shows how
the semantic web technology provides efficient solutions for the management of
complex and distributed data in heterogeneous systems, and it can be used in
the medical information systems as well.
","[{'version': 'v1', 'created': 'Wed, 25 Oct 2017 11:46:25 GMT'}]",2017-11-30,"[['Sun', 'Lili', ''], ['Yong', 'Jianming', ''], ['Soar', 'Jeffrey', '']]","['Semantic web', 'access control', 'e-Healthcare', 'cloud computing']"
9163,2209.10489,Joseph Lemley,"David O'Callaghan, Cian Ryan, Waseem Shariff, Muhammad Ali Farooq,
  Joseph Lemley, Peter Corcoran","Recurrent Super-Resolution Method for Enhancing Low Quality Thermal
  Facial Data","In proceedings of the 24th Irish Machine Vision and Image Processing
  Conference, Belfast Ireland, 31 August - 2nd September 2022",,10.56541/UAOV9084,,cs.CV cs.LG eess.IV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The process of obtaining high-resolution images from single or multiple
low-resolution images of the same scene is of great interest for real-world
image and signal processing applications. This study is about exploring the
potential usage of deep learning based image super-resolution algorithms on
thermal data for producing high quality thermal imaging results for in-cabin
vehicular driver monitoring systems. In this work we have proposed and
developed a novel multi-image super-resolution recurrent neural network to
enhance the resolution and improve the quality of low-resolution thermal
imaging data captured from uncooled thermal cameras. The end-to-end fully
convolutional neural network is trained from scratch on newly acquired thermal
data of 30 different subjects in indoor environmental conditions. The
effectiveness of the thermally tuned super-resolution network is validated
quantitatively as well as qualitatively on test data of 6 distinct subjects.
The network was able to achieve a mean peak signal to noise ratio of 39.24 on
the validation dataset for 4x super-resolution, outperforming bicubic
interpolation both quantitatively and qualitatively.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2022 16:44:06 GMT'}]",2022-09-22,"[[""O'Callaghan"", 'David', ''], ['Ryan', 'Cian', ''], ['Shariff', 'Waseem', ''], ['Farooq', 'Muhammad Ali', ''], ['Lemley', 'Joseph', ''], ['Corcoran', 'Peter', '']]","['Super-resolution', 'Deep learning', 'Thermal imaging', 'LWIR']"
9164,2107.00962,Antonella Barisic,"Antonella Barisic, Frano Petric, Stjepan Bogdan","Brain over Brawn: Using a Stereo Camera to Detect, Track, and Intercept
  a Faster UAV by Reconstructing the Intruder's Trajectory","Published in journal Field Robotics, March 2022. UAV-Eagle dataset
  available at: https://github.com/larics/UAV-Eagle",Field Robotics 2022 ISSN: 2771-3989,10.55417/fr.2022009,,cs.RO cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper presents our approach to intercepting a faster intruder UAV,
inspired by the MBZIRC 2020 Challenge 1. By utilizing a priori knowledge of the
shape of the intruder's trajectory, we can calculate an interception point.
Target tracking is based on image processing by a YOLOv3 Tiny convolutional
neural network, combined with depth calculation using a gimbal-mounted ZED Mini
stereo camera. We use RGB and depth data from the camera, devising a
noise-reducing histogram-filter to extract the target's 3D position. Obtained
3D measurements of target's position are used to calculate the position,
orientation, and size of a figure-eight shaped trajectory, which we approximate
using a Bernoulli lemniscate. Once the approximation is deemed sufficiently
precise, as measured by the distance between observations and estimate, we
calculate an interception point to position the interceptor UAV directly on the
intruder's path. Our method, which we have significantly improved based on the
experience gathered during the MBZIRC competition, has been validated in
simulation and through field experiments. Our results confirm that we have
developed an efficient, visual-perception module that can extract information
describing the intruder UAV's motion with precision sufficient to support
interception planning. In a majority of our simulated encounters, we can track
and intercept a target that moves 30% faster than the interceptor.
Corresponding tests in an unstructured environment yielded 9 out of 12
successful results.
","[{'version': 'v1', 'created': 'Fri, 2 Jul 2021 10:49:22 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Jun 2022 22:15:46 GMT'}]",2022-06-16,"[['Barisic', 'Antonella', ''], ['Petric', 'Frano', ''], ['Bogdan', 'Stjepan', '']]","['aerial robotics', 'computer vision', 'perception', 'position estimation', 'visual serving']"
9165,2108.03466,Yingqing He,"Yingqing He, Yazhou Xing, Tianjia Zhang, Qifeng Chen",Unsupervised Portrait Shadow Removal via Generative Priors,"Accepted to ACM MM 2021 (Oral). Code is available at:
  https://github.com/YingqingHe/Shadow-Removal-via-Generative-Priors",,10.1145/3474085.3475663,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Portrait images often suffer from undesirable shadows cast by casual objects
or even the face itself. While existing methods for portrait shadow removal
require training on a large-scale synthetic dataset, we propose the first
unsupervised method for portrait shadow removal without any training data. Our
key idea is to leverage the generative facial priors embedded in the
off-the-shelf pretrained StyleGAN2. To achieve this, we formulate the shadow
removal task as a layer decomposition problem: a shadowed portrait image is
constructed by the blending of a shadow image and a shadow-free image. We
propose an effective progressive optimization algorithm to learn the
decomposition process. Our approach can also be extended to portrait tattoo
removal and watermark removal. Qualitative and quantitative experiments on a
real-world portrait shadow dataset demonstrate that our approach achieves
comparable performance with supervised shadow removal methods. Our source code
is available at
https://github.com/YingqingHe/Shadow-Removal-via-Generative-Priors.
","[{'version': 'v1', 'created': 'Sat, 7 Aug 2021 15:09:36 GMT'}]",2021-08-10,"[['He', 'Yingqing', ''], ['Xing', 'Yazhou', ''], ['Zhang', 'Tianjia', ''], ['Chen', 'Qifeng', '']]","['Portrait Shadow Removal', 'Unsupervised Learning', 'Generative Priors', 'Image Decomposition']"
9166,2205.06502,Marius Kurz,"Marius Kurz, Philipp Offenh\""auser, Dominic Viola, Oleksandr
  Shcherbakov, Michael Resch, Andrea Beck","Deep Reinforcement Learning for Computational Fluid Dynamics on HPC
  Systems","11 pages, 5 figures, the code can be accessed at
  https://github.com/flexi-framework/relexi",Journal of Computational Science 65 (2022) 101884,10.1016/j.jocs.2022.101884,,cs.LG cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Reinforcement learning (RL) is highly suitable for devising control
strategies in the context of dynamical systems. A prominent instance of such a
dynamical system is the system of equations governing fluid dynamics. Recent
research results indicate that RL-augmented computational fluid dynamics (CFD)
solvers can exceed the current state of the art, for example in the field of
turbulence modeling. However, while in supervised learning, the training data
can be generated a priori in an offline manner, RL requires constant run-time
interaction and data exchange with the CFD solver during training. In order to
leverage the potential of RL-enhanced CFD, the interaction between the CFD
solver and the RL algorithm thus have to be implemented efficiently on
high-performance computing (HPC) hardware. To this end, we present Relexi as a
scalable RL framework that bridges the gap between machine learning workflows
and modern CFD solvers on HPC systems providing both components with its
specialized hardware. Relexi is built with modularity in mind and allows easy
integration of various HPC solvers by means of the in-memory data transfer
provided by the SmartSim library. Here, we demonstrate that the Relexi
framework can scale up to hundreds of parallel environment on thousands of
cores. This allows to leverage modern HPC resources to either enable larger
problems or faster turnaround times. Finally, we demonstrate the potential of
an RL-augmented CFD solver by finding a control strategy for optimal eddy
viscosity selection in large eddy simulations.
","[{'version': 'v1', 'created': 'Fri, 13 May 2022 08:21:18 GMT'}]",2022-11-21,"[['Kurz', 'Marius', ''], ['Offenhäuser', 'Philipp', ''], ['Viola', 'Dominic', ''], ['Shcherbakov', 'Oleksandr', ''], ['Resch', 'Michael', ''], ['Beck', 'Andrea', '']]","['Deep Reinforcement Learning', 'High-Performance Computing', 'Computational Fluid Dynamics', 'Turbulence Modeling', 'Large Eddy Simulation']"
9167,1811.05396,Federico Iuricich,"Sara Scaramuccia and Federico Iuricich and Leila De Floriani and
  Claudia Landi","Computing multiparameter persistent homology through a discrete
  Morse-based approach",,,10.1016/j.comgeo.2020.101623,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Persistent Homology (PH) allows tracking homology features like loops, holes
and their higher-dimensional analogs, along with a single-parameter family of
nested spaces. Currently, computing descriptors for complex data characterized
by multiple functions is becoming an important task in several applications,
including physics, chemistry, medicine, geography, etc. Multiparameter
Persistent Homology (MPH) generalizes persistent homology opening to the
exploration and analysis of shapes endowed with multiple filtering functions.
Still, computational constraints prevent MPH to be feasible over real-sized
data. In this paper, we consider discrete Morse Theory as a tool to simplify
the computation of MPH on a multiparameter dataset. We propose a new algorithm,
well suited for parallel and distributed implementations and we provide the
first evaluation of the impact on MPH computations of a preprocessing approach.
","[{'version': 'v1', 'created': 'Tue, 13 Nov 2018 16:39:58 GMT'}]",2020-10-19,"[['Scaramuccia', 'Sara', ''], ['Iuricich', 'Federico', ''], ['De Floriani', 'Leila', ''], ['Landi', 'Claudia', '']]","['persistent homology', 'topological data analysis', 'Multiparameter persistenthomology', 'Morse reduction', 'discrete Morse theory']"
9168,1812.10401,Denis Sedov,"Denis Sedov, Zhirong Yang",Word Embedding based on Low-Rank Doubly Stochastic Matrix Decomposition,,"Cheng, L., Leung, A., Ozawa, S. (eds.) ICONIP 2018. LNCS, vol.
  11303, pp. 90-100. Springer, Cham (2018)",10.1007/978-3-030-04182-3_9,,cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Word embedding, which encodes words into vectors, is an important starting
point in natural language processing and commonly used in many text-based
machine learning tasks. However, in most current word embedding approaches, the
similarity in embedding space is not optimized in the learning. In this paper
we propose a novel neighbor embedding method which directly learns an embedding
simplex where the similarities between the mapped words are optimal in terms of
minimal discrepancy to the input neighborhoods. Our method is built upon
two-step random walks between words via topics and thus able to better reveal
the topics among the words. Experiment results indicate that our method,
compared with another existing word embedding approach, is more favorable for
various queries.
","[{'version': 'v1', 'created': 'Wed, 12 Dec 2018 15:38:46 GMT'}]",2018-12-27,"[['Sedov', 'Denis', ''], ['Yang', 'Zhirong', '']]","['Nonnegative matrix factorization', 'Word embedding', 'Cluster analysis', 'Doubly stochastic']"
9169,2203.06265,Marcos Faundez-Zanuy,"Marcos Faundez-Zanuy, Enric Sesa-Nogueras","Preliminary experiments on automatic gender recognition based on online
  capital letters",9 pages,"In: Bassis S., Esposito A., Morabito F. (eds) Recent Advances of
  Neural Network Models and Applications. Smart Innovation, Systems and
  Technologies, vol 26. Springer, Cham. 2014",10.1007/978-3-319-04129-2_36,,cs.CV cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this paper we present some experiments to automatically classify online
handwritten text based on capital letters. Although handwritten text is not as
discriminative as face or voice, we still found some chance for gender
classification based on handwritten text. Accuracies are up to 74%, even in the
most challenging case of capital letters.
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2022 21:55:38 GMT'}]",2022-03-15,"[['Faundez-Zanuy', 'Marcos', ''], ['Sesa-Nogueras', 'Enric', '']]","['on-line handwriting', 'gender recognition', 'capital letters', 'deidentification']"
9170,2007.06141,Wenying Wu,"Wenying Wu, Pavlos Protopapas, Zheng Yang, Panagiotis Michalatos",Gender Classification and Bias Mitigation in Facial Images,9 pages,WebSci (2020) 106-114,10.1145/3394231,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Gender classification algorithms have important applications in many domains
today such as demographic research, law enforcement, as well as human-computer
interaction. Recent research showed that algorithms trained on biased benchmark
databases could result in algorithmic bias. However, to date, little research
has been carried out on gender classification algorithms' bias towards gender
minorities subgroups, such as the LGBTQ and the non-binary population, who have
distinct characteristics in gender expression. In this paper, we began by
conducting surveys on existing benchmark databases for facial recognition and
gender classification tasks. We discovered that the current benchmark databases
lack representation of gender minority subgroups. We worked on extending the
current binary gender classifier to include a non-binary gender class. We did
that by assembling two new facial image databases: 1) a racially balanced
inclusive database with a subset of LGBTQ population 2) an inclusive-gender
database that consists of people with non-binary gender. We worked to increase
classification accuracy and mitigate algorithmic biases on our baseline model
trained on the augmented benchmark database. Our ensemble model has achieved an
overall accuracy score of 90.39%, which is a 38.72% increase from the baseline
binary gender classifier trained on Adience. While this is an initial attempt
towards mitigating bias in gender classification, more work is needed in
modeling gender as a continuum by assembling more inclusive databases.
","[{'version': 'v1', 'created': 'Mon, 13 Jul 2020 01:09:06 GMT'}]",2020-07-14,"[['Wu', 'Wenying', ''], ['Protopapas', 'Pavlos', ''], ['Yang', 'Zheng', ''], ['Michalatos', 'Panagiotis', '']]","['gender classifcation', 'convolutional neural networks', 'machine learning ethics']"
9171,2209.15492,Anne Baanen,"Anne Baanen, Alex J. Best, Nirvana Coppola, Sander R. Dahmen","Formalized Class Group Computations and Integral Points on Mordell
  Elliptic Curves","14 pages. Accepted for CPP '23. Source code available at
  https://github.com/lean-forward/class-group-and-mordell-equation",,10.1145/3573105.3575682,,cs.LO math.NT,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Diophantine equations are a popular and active area of research in number
theory. In this paper we consider Mordell equations, which are of the form
$y^2=x^3+d$, where $d$ is a (given) nonzero integer number and all solutions in
integers $x$ and $y$ have to be determined. One non-elementary approach for
this problem is the resolution via descent and class groups. Along these lines
we formalized in Lean 3 the resolution of Mordell equations for several
instances of $d<0$. In order to achieve this, we needed to formalize several
other theories from number theory that are interesting on their own as well,
such as ideal norms, quadratic fields and rings, and explicit computations of
the class number. Moreover we introduced new computational tactics in order to
carry out efficiently computations in quadratic rings and beyond.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2022 14:28:46 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Dec 2022 16:25:06 GMT'}]",2022-12-26,"[['Baanen', 'Anne', ''], ['Best', 'Alex J.', ''], ['Coppola', 'Nirvana', ''], ['Dahmen', 'Sander R.', '']]","['formalized mathematics', 'algebraic number theory', 'Diophantine equations', 'tactics', 'Lean', 'Mathlib']"
9172,2001.07644,Xiaoran Fan,"Xiaoran Fan, Longfei Shangguan, Richard Howard, Yanyong Zhang, Yao
  Peng, Jie Xiong, Yunfei Ma, Xiang-Yang Li","Towards Flexible Wireless Charging for Medical Implants Using
  Distributed Antenna System","In MobiCom 2020: The 26th Annual International Conference on Mobile
  Computing and Networking, London, 15 pages",,10.1145/3372224.3380899,,cs.NI cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the design, implementation and evaluation of In-N-Out, a
software-hardware solution for far-field wireless power transfer. In-N-Out can
continuously charge a medical implant residing in deep tissues at near-optimal
beamforming power, even when the implant moves around inside the human body. To
accomplish this, we exploit the unique energy ball pattern of distributed
antenna array and devise a backscatter-assisted beamforming algorithm that can
concentrate RF energy on a tiny spot surrounding the medical implant.
Meanwhile, the power levels on other body parts stay in low level, reducing the
risk of overheating. We prototype In-N-Out on 21 software-defined radios and a
printed circuit board (PCB). Extensive experiments demonstrate that In-N-Out
achieves 0.37~mW average charging power inside a 10~cm-thick pork belly, which
is sufficient to wirelessly power a range of commercial medical devices. Our
head-to-head comparison with the state-of-the-art approach shows that In-N-Out
achieves 5.4$\times$--18.1$\times$ power gain when the implant is stationary,
and 5.3$\times$--7.4$\times$ power gain when the implant is in motion.
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2020 16:47:14 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Feb 2020 01:40:10 GMT'}]",2020-02-04,"[['Fan', 'Xiaoran', ''], ['Shangguan', 'Longfei', ''], ['Howard', 'Richard', ''], ['Zhang', 'Yanyong', ''], ['Peng', 'Yao', ''], ['Xiong', 'Jie', ''], ['Ma', 'Yunfei', ''], ['Li', 'Xiang-Yang', '']]","['Backscatter', 'Wireless Charging', 'Medical Implants', 'Distributed Beamforming']"
9173,2011.00675,Chang Xu,"Chang Xu, Jun Wang, Yuqing Tang, Francisco Guzman, Benjamin I. P.
  Rubinstein, Trevor Cohn","A Targeted Attack on Black-Box Neural Machine Translation with Parallel
  Data Poisoning",In Proceedings of the 2021 World Wide Web Conference (WWW 2021),,10.1145/3442381.3450034,,cs.CL cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As modern neural machine translation (NMT) systems have been widely deployed,
their security vulnerabilities require close scrutiny. Most recently, NMT
systems have been found vulnerable to targeted attacks which cause them to
produce specific, unsolicited, and even harmful translations. These attacks are
usually exploited in a white-box setting, where adversarial inputs causing
targeted translations are discovered for a known target system. However, this
approach is less viable when the target system is black-box and unknown to the
adversary (e.g., secured commercial systems). In this paper, we show that
targeted attacks on black-box NMT systems are feasible, based on poisoning a
small fraction of their parallel training data. We show that this attack can be
realised practically via targeted corruption of web documents crawled to form
the system's training data. We then analyse the effectiveness of the targeted
poisoning in two common NMT training scenarios: the from-scratch training and
the pre-train & fine-tune paradigm. Our results are alarming: even on the
state-of-the-art systems trained with massive parallel data (tens of millions),
the attacks are still successful (over 50% success rate) under surprisingly low
poisoning budgets (e.g., 0.006%). Lastly, we discuss potential defences to
counter such attacks.
","[{'version': 'v1', 'created': 'Mon, 2 Nov 2020 01:52:46 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Feb 2021 05:10:33 GMT'}]",2021-02-16,"[['Xu', 'Chang', ''], ['Wang', 'Jun', ''], ['Tang', 'Yuqing', ''], ['Guzman', 'Francisco', ''], ['Rubinstein', 'Benjamin I. P.', ''], ['Cohn', 'Trevor', '']]","['neural machine translation', 'data poisoning', 'black-box attacks']"
9174,2004.04858,Massimiliano Rossi,"Zsuzsanna Lipt\'ak, Simon J. Puglisi and Massimiliano Rossi",Pattern Discovery in Colored Strings,"22 pages, 5 figures, 2 tables, published in ACM Journal of
  Experimental Algorithmics. This is the journal version of the paper with the
  same title at SEA 2020 (18th Symposium on Experimental Algorithms, Catania,
  Italy, June 16-18, 2020)",,10.1145/3429280,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider the problem of identifying patterns of interest in
colored strings. A colored string is a string where each position is assigned
one of a finite set of colors. Our task is to find substrings of the colored
string that always occur followed by the same color at the same distance. The
problem is motivated by applications in embedded systems verification, in
particular, assertion mining. The goal there is to automatically find
properties of the embedded system from the analysis of its simulation traces.
  We show that, in our setting, the number of patterns of interest is
upper-bounded by $\mathcal{O}(n^2)$, where $n$ is the length of the string. We
introduce a baseline algorithm, running in $\mathcal{O}(n^2)$ time, which
identifies all patterns of interest satisfying certain minimality conditions,
for all colors in the string. For the case where one is interested in patterns
related to one color only, we also provide a second algorithm which runs in
$\mathcal{O}(n^2\log n)$ time in the worst case but is faster than the baseline
algorithm in practice. Both solutions use suffix trees, and the second
algorithm also uses an appropriately defined priority queue, which allows us to
reduce the number of computations. We performed an experimental evaluation of
the proposed approaches over both synthetic and real-world datasets, and found
that the second algorithm outperforms the first algorithm on all simulated
data, while on the real-world data, the performance varies between a slight
slowdown (on half of the datasets) and a speedup by a factor of up to 11.
","[{'version': 'v1', 'created': 'Thu, 9 Apr 2020 23:51:23 GMT'}, {'version': 'v2', 'created': 'Fri, 28 May 2021 15:35:35 GMT'}]",2021-05-31,"[['Lipták', 'Zsuzsanna', ''], ['Puglisi', 'Simon J.', ''], ['Rossi', 'Massimiliano', '']]","['property testing', 'suffix tree', 'pattern mining', 'efficient algorithm']"
9175,2206.04720,Orestis Papakyriakopoulos,"Orestis Papakyriakopoulos, Christelle Tessono, Arvind Narayanan, Mihir
  Kshirsagar","How Algorithms Shape the Distribution of Political Advertising: Case
  Studies of Facebook, Google, and TikTok","Forthcoming in: Proceedings of the 2022 AAAI/ACM Conference on AI,
  Ethics, and Society (AIES'22), August 1-3, 2022, Oxford, United Kingdom. ACM,
  New York, NY, USA, 15 pages",,10.1145/3514094.3534166,,cs.SI cs.CY cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Online platforms play an increasingly important role in shaping democracy by
influencing the distribution of political information to the electorate. In
recent years, political campaigns have spent heavily on the platforms'
algorithmic tools to target voters with online advertising. While the public
interest in understanding how platforms perform the task of shaping the
political discourse has never been higher, the efforts of the major platforms
to make the necessary disclosures to understand their practices falls woefully
short. In this study, we collect and analyze a dataset containing over 800,000
ads and 2.5 million videos about the 2020 U.S. presidential election from
Facebook, Google, and TikTok. We conduct the first large scale data analysis of
public data to critically evaluate how these platforms amplified or moderated
the distribution of political advertisements. We conclude with recommendations
for how to improve the disclosures so that the public can hold the platforms
and political advertisers accountable.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2022 18:19:30 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Jul 2022 17:46:46 GMT'}]",2022-07-14,"[['Papakyriakopoulos', 'Orestis', ''], ['Tessono', 'Christelle', ''], ['Narayanan', 'Arvind', ''], ['Kshirsagar', 'Mihir', '']]","['interpretability', 'political speech', 'algorithmic auditing', 'accountability', 'political advertising', 'algorithmic targeting', 'regulation']"
9176,1905.06533,Emre Yilmaz,"Emre Y{\i}lmaz and Vikramjit Mitra and Ganesh Sivaraman and Horacio
  Franco","Articulatory and bottleneck features for speaker-independent ASR of
  dysarthric speech","to appear in Computer Speech & Language -
  https://doi.org/10.1016/j.csl.2019.05.002 - arXiv admin note: substantial
  text overlap with arXiv:1807.10948",,10.1016/j.csl.2019.05.002,,cs.CL cs.SD eess.AS,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The rapid population aging has stimulated the development of assistive
devices that provide personalized medical support to the needies suffering from
various etiologies. One prominent clinical application is a computer-assisted
speech training system which enables personalized speech therapy to patients
impaired by communicative disorders in the patient's home environment. Such a
system relies on the robust automatic speech recognition (ASR) technology to be
able to provide accurate articulation feedback. With the long-term aim of
developing off-the-shelf ASR systems that can be incorporated in clinical
context without prior speaker information, we compare the ASR performance of
speaker-independent bottleneck and articulatory features on dysarthric speech
used in conjunction with dedicated neural network-based acoustic models that
have been shown to be robust against spectrotemporal deviations. We report ASR
performance of these systems on two dysarthric speech datasets of different
characteristics to quantify the achieved performance gains. Despite the
remaining performance gap between the dysarthric and normal speech, significant
improvements have been reported on both datasets using speaker-independent ASR
architectures.
","[{'version': 'v1', 'created': 'Thu, 16 May 2019 05:40:18 GMT'}, {'version': 'v2', 'created': 'Tue, 21 May 2019 02:13:22 GMT'}]",2019-05-22,"[['Yılmaz', 'Emre', ''], ['Mitra', 'Vikramjit', ''], ['Sivaraman', 'Ganesh', ''], ['Franco', 'Horacio', '']]","['pathological speech', 'automatic speech recognition', 'articulatory features', 'time-frequencyconvolutional neural networks', 'dysarthria']"
9177,2012.15799,Wensheng Gan,"Jiahui Chen, Wensheng Gan, Muchuang Hu, Chien-Ming Chen",On the Construction of a Post-Quantum Blockchain for Smart City,"Elsevier. 20 pages, 9 figures, 6 tables","Journal of Information Security and Applications, 2021",10.1016/j.jisa.2021.102780,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Owing to some special characteristics and features, blockchain is a very
useful technique that can securely organize diverse devices in a smart city. It
finds wide applications, especially in distributed environments, where entities
such as wireless sensors need to be certain of the authenticity of the server.
As contemporary blockchain techniques that address post-quantum concerns have
not been designed, in this study, we investigate a blockchain in the
post-quantum setting and seek to discover how it can resist attacks from
quantum computing. In addition, traditional proof of work (PoW)-based consensus
protocols such as Bitcoin cannot supply memory mining, and the transaction
capacity of each block in a blockchain is limited and needs to be expanded.
Thus, a new post-quantum proof of work (post-quantum PoW) consensus algorithm
for security and privacy of smart city applications is proposed. It can be used
to not only protect a blockchain under a quantum computing attack compared to
existing classical hash-based PoW algorithms but also to supply memory mining.
Meanwhile, an identity-based post-quantum signature is embedded into a
transaction process to construct lightweight transactions. Subsequently, we
provide a detailed description on the execution of the post-quantum lightweight
transaction in a blockchain. Overall, this work can help enrich the research on
future post-quantum blockchain and support the construction or architecture of
emerging blockchain-based smart cities.
","[{'version': 'v1', 'created': 'Thu, 31 Dec 2020 18:21:16 GMT'}]",2021-04-01,"[['Chen', 'Jiahui', ''], ['Gan', 'Wensheng', ''], ['Hu', 'Muchuang', ''], ['Chen', 'Chien-Ming', '']]","['blockchain', 'blockchain security', 'blockchain consensus', 'smart cities', 'post-quantum blockchain']"
9178,1802.00438,Hamid Reza Zohouri,"Hamid Reza Zohouri, Artur Podobas, Satoshi Matsuoka","Combined Spatial and Temporal Blocking for High-Performance Stencil
  Computation on FPGAs Using OpenCL","FPGA '18: 2018 ACM/SIGDA International Symposium on
  Field-Programmable Gate Arrays",,10.1145/3174243.3174248,,cs.DC cs.AR,http://creativecommons.org/licenses/by/4.0/,"  Recent developments in High Level Synthesis tools have attracted software
programmers to accelerate their high-performance computing applications on
FPGAs. Even though it has been shown that FPGAs can compete with GPUs in terms
of performance for stencil computation, most previous work achieve this by
avoiding spatial blocking and restricting input dimensions relative to FPGA
on-chip memory. In this work we create a stencil accelerator using Intel FPGA
SDK for OpenCL that achieves high performance without having such restrictions.
We combine spatial and temporal blocking to avoid input size restrictions, and
employ multiple FPGA-specific optimizations to tackle issues arisen from the
added design complexity. Accelerator parameter tuning is guided by our
performance model, which we also use to project performance for the upcoming
Intel Stratix 10 devices. On an Arria 10 GX 1150 device, our accelerator can
reach up to 760 and 375 GFLOP/s of compute performance, for 2D and 3D stencils,
respectively, which rivals the performance of a highly-optimized GPU
implementation. Furthermore, we estimate that the upcoming Stratix 10 devices
can achieve a performance of up to 3.5 TFLOP/s and 1.6 TFLOP/s for 2D and 3D
stencil computation, respectively.
","[{'version': 'v1', 'created': 'Thu, 1 Feb 2018 10:55:40 GMT'}]",2019-10-16,"[['Zohouri', 'Hamid Reza', ''], ['Podobas', 'Artur', ''], ['Matsuoka', 'Satoshi', '']]","['FPGA', 'Stencil', 'OpenCL', 'Spatial Blocking', 'Temporal Blocking']"
9179,1908.05383,Pedro Braga,"Lucas R. C. de Farias, Pedro H. M. Braga, Hansenclever F. Bassani and
  Aluizio F. R. Ara\'ujo",MOEA/D with Uniformly Randomly Adaptive Weights,,2018 Genetic and Evolutionary Computation Conference (GECCO),10.1145/3205455.3205648,,cs.NE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  When working with decomposition-based algorithms, an appropriate set of
weights might improve quality of the final solution. A set of uniformly
distributed weights usually leads to well-distributed solutions on a Pareto
front. However, there are two main difficulties with this approach. Firstly, it
may fail depending on the problem geometry. Secondly, the population size
becomes not flexible as the number of objectives increases. In this paper, we
propose the MOEA/D with Uniformly Randomly Adaptive Weights (MOEA/DURAW) which
uses the Uniformly Randomly method as an approach to subproblems generation,
allowing a flexible population size even when working with many objective
problems. During the evolutionary process, MOEA/D-URAW adds and removes
subproblems as a function of the sparsity level of the population. Moreover,
instead of requiring assumptions about the Pareto front shape, our method
adapts its weights to the shape of the problem during the evolutionary process.
Experimental results using WFG41-48 problem classes, with different Pareto
front shapes, shows that the present method presents better or equal results in
77.5% of the problems evaluated from 2 to 6 objectives when compared with
state-of-the-art methods in the literature.
","[{'version': 'v1', 'created': 'Thu, 15 Aug 2019 00:52:06 GMT'}]",2020-03-26,"[['de Farias', 'Lucas R. C.', ''], ['Braga', 'Pedro H. M.', ''], ['Bassani', 'Hansenclever F.', ''], ['Araújo', 'Aluizio F. R.', '']]","['Many-objective optimization', 'Multi-objective optimization', 'Evolution strategies', 'Decomposition methods']"
9180,2206.09762,Stephen MacDonell,"Chathrie Wimalasooriya, Sherlock A. Licorish, Daniel Alencar da Costa,
  Stephen G. MacDonell","A Systematic Mapping Study Addressing the Reliability of Mobile
  Applications: The Need to Move Beyond Testing Reliability","Journal paper, 29 pages, 12 tables, 7 figures","Journal of Systems and Software 186(2022), pp. 111-166",10.1016/j.jss.2021.111166.,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intense competition in the mobile apps market means it is important to
maintain high levels of app reliability to avoid losing users. Yet despite its
importance, app reliability is underexplored in the research literature. To
address this need, we identify, analyse, and classify the state-of-the-art in
the field of mobile apps' reliability through a systematic mapping study. From
the results of such a study, researchers in the field can identify pressing
research gaps, and developers can gain knowledge about existing solutions, to
potentially leverage them in practice. We found 87 relevant papers which were
then analysed and classified based on their research focus, research type,
contribution, research method, study settings, data, quality attributes and
metrics used. Results indicate that there is a lack of research on
understanding reliability with regard to context-awareness, self-healing,
ageing and rejuvenation, and runtime event handling. These aspects have rarely
been studied, or if studied, there is limited evaluation. We also identified
several other research gaps including the need to conduct more research in
real-world industrial projects. Furthermore, little attention has been paid
towards quality standards while conducting research. Outcomes here show
numerous opportunities for greater research depth and breadth on mobile app
reliability.
","[{'version': 'v1', 'created': 'Mon, 20 Jun 2022 13:16:00 GMT'}]",2022-06-22,"[['Wimalasooriya', 'Chathrie', ''], ['Licorish', 'Sherlock A.', ''], ['da Costa', 'Daniel Alencar', ''], ['MacDonell', 'Stephen G.', '']]","['Mapping study', 'Software reliability', 'Mobile app reliability', 'Evidence-based software engineering']"
9181,2003.09926,Carlos Junqueira Junior PhD,"Carlos Junqueira-Junior, Jo\~ao Luiz F. Azevedo, Jairo Panetta,
  William R. Wolf, and Sami Yamouni",On the scalability of CFD tool for supersonic jet flow configurations,"13 pages journal article. arXiv admin note: text overlap with
  arXiv:2003.08746","Parallel Computing, Volume 93, May 2020, 102620",10.1016/j.parco.2020.102620,,cs.DC cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  New regulations are imposing noise emissions limitations for the aviation
industry which are pushing researchers and engineers to invest efforts in
studying the aeroacoustics phenomena. Following this trend, an in-house
computational fluid dynamics tool is build to reproduce high fidelity results
of supersonic jet flows for aeroacoustic analogy applications. The solver is
written using the large eddy simulation formulation that is discretized using a
finite difference approach and an explicit time integration. Numerical
simulations of supersonic jet flows are very expensive and demand efficient
high-performance computing. Therefore, non-blocking message passage interface
protocols and parallel Input/Output features are implemented into the code in
order to perform simulations which demand up to one billion grid points. The
present work addresses the evaluation of code improvements along with the
computational performance of the solver running on a computer with maximum
theoretical peak of 2.727 PFlops. Different mesh configurations, whose size
varies from a few hundred thousand to approximately one billion grid points,
are evaluated in the present paper. Calculations are performed using different
workloads in order to assess the strong and weak scalability of the parallel
computational tool. Moreover, validation results of a realistic flow condition
are also presented in the current work.
","[{'version': 'v1', 'created': 'Wed, 18 Mar 2020 17:49:52 GMT'}]",2020-03-24,"[['Junqueira-Junior', 'Carlos', ''], ['Azevedo', 'João Luiz F.', ''], ['Panetta', 'Jairo', ''], ['Wolf', 'William R.', ''], ['Yamouni', 'Sami', '']]","['Computational Fluid Dynamics', 'Large Eddy Simulation', 'Scalability', 'Supersonic Jet Flow']"
9182,1910.11601,Christine Michel,"Elena Codreanu (GRePS, SICAL), Christine Michel (SICAL), Marc-Eric
  Bobillier-Chaumon (GRePS), Olivier Vigneau (WSE)","Assessing the Adoption of Virtual Learning Environments in Primary
  Schools: An Activity Oriented Study of Teacher's Acceptance",,"Computers Supported Education, CCIS 739, Springer International
  Publishing, pp. 513-531, 2017, 8th International Conference CSEDU 2016
  Revised Selected Papers, 978-3-319-63184-4",10.1007/978-3-319-63184-4_27,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article studies the conditions of use of a VLE (Virtual Learning
Environment) by primary school teachers. It first presents a triangulated model
to explore Virtual Learning Environments' adoption in primary schools. The
theoretical models cover three approaches: the social acceptance, the practical
acceptance and the situated acceptance. The situated acceptance of teachers is
studied according to the model by using activity theory and qualitative methods
(individual and collective interviews). Our study describes how teachers (8
participants) perceived the role of the VLE in the evolution of their working
practices (maintaining, transforming or restricting existent practices), in
their relationship with parents and in the follow-up of their students.
","[{'version': 'v1', 'created': 'Fri, 25 Oct 2019 10:00:25 GMT'}]",2019-10-28,"[['Codreanu', 'Elena', '', 'GRePS, SICAL'], ['Michel', 'Christine', '', 'SICAL'], ['Bobillier-Chaumon', 'Marc-Eric', '', 'GRePS'], ['Vigneau', 'Olivier', '', 'WSE']]","['VLE', 'acceptance', 'activity theory', 'primary school', 'professional practices']"
9183,1606.03572,Sam Fletcher,Sam Fletcher and Md Zahidul Islam,Differentially Private Random Decision Forests using Smooth Sensitivity,"Pre-print of 2017 paper published in Expert Systems with
  Applications, 36 pages; 2021 Addendum added to end of paper",,10.1016/j.eswa.2017.01.034,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new differentially-private decision forest algorithm that
minimizes both the number of queries required, and the sensitivity of those
queries. To do so, we build an ensemble of random decision trees that avoids
querying the private data except to find the majority class label in the leaf
nodes. Rather than using a count query to return the class counts like the
current state-of-the-art, we use the Exponential Mechanism to only output the
class label itself. This drastically reduces the sensitivity of the query --
often by several orders of magnitude -- which in turn reduces the amount of
noise that must be added to preserve privacy. Our improved sensitivity is
achieved by using ""smooth sensitivity"", which takes into account the specific
data used in the query rather than assuming the worst-case scenario. We also
extend work done on the optimal depth of random decision trees to handle
continuous features, not just discrete features. This, along with several other
improvements, allows us to create a differentially private decision forest with
substantially higher predictive power than the current state-of-the-art.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 09:47:05 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Sep 2016 07:14:18 GMT'}, {'version': 'v3', 'created': 'Wed, 25 Jan 2017 05:19:56 GMT'}, {'version': 'v4', 'created': 'Tue, 24 Aug 2021 03:46:51 GMT'}]",2021-08-25,"[['Fletcher', 'Sam', ''], ['Islam', 'Md Zahidul', '']]","['Privacy', 'Data Mining', 'Decision Tree', 'Decision Forest', 'DifferentialPrivacy', 'Smooth Sensitivity']"
9184,2001.07311,Wenjie Hu,"Wenjie Hu, Yang Yang, Jianbo Wang, Xuanwen Huang, Ziqiang Cheng",Understanding Electricity-Theft Behavior via Multi-Source Data,"11 pages, 8 figures, WWW'20 full paper",,10.1145/3366423.3380291,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Electricity theft, the behavior that involves users conducting illegal
operations on electrical meters to avoid individual electricity bills, is a
common phenomenon in the developing countries. Considering its harmfulness to
both power grids and the public, several mechanized methods have been developed
to automatically recognize electricity-theft behaviors. However, these methods,
which mainly assess users' electricity usage records, can be insufficient due
to the diversity of theft tactics and the irregularity of user behaviors.
  In this paper, we propose to recognize electricity-theft behavior via
multi-source data. In addition to users' electricity usage records, we analyze
user behaviors by means of regional factors (non-technical loss) and climatic
factors (temperature) in the corresponding transformer area. By conducting
analytical experiments, we unearth several interesting patterns: for instance,
electricity thieves are likely to consume much more electrical power than
normal users, especially under extremely high or low temperatures. Motivated by
these empirical observations, we further design a novel hierarchical framework
for identifying electricity thieves. Experimental results based on a real-world
dataset demonstrate that our proposed model can achieve the best performance in
electricity-theft detection (e.g., at least +3.0% in terms of F0.5) compared
with several baselines. Last but not least, our work has been applied by the
State Grid of China and used to successfully catch electricity thieves in
Hangzhou with a precision of 15% (an improvement form 0% attained by several
other models the company employed) during monthly on-site investigation.
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2020 02:15:07 GMT'}]",2020-01-22,"[['Hu', 'Wenjie', ''], ['Yang', 'Yang', ''], ['Wang', 'Jianbo', ''], ['Huang', 'Xuanwen', ''], ['Cheng', 'Ziqiang', '']]","['User modeling', 'electricity-theft detection', 'hierarchical recurrentneural network', 'power grids']"
9185,1912.09723,Pavel Efimov,"Pavel Efimov, Andrey Chertok, Leonid Boytsov, Pavel Braslavski","SberQuAD -- Russian Reading Comprehension Dataset: Description and
  Analysis",,,10.1007/978-3-030-58219-7_1,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  SberQuAD -- a large scale analog of Stanford SQuAD in the Russian language -
is a valuable resource that has not been properly presented to the scientific
community. We fill this gap by providing a description, a thorough analysis,
and baseline experimental results.
","[{'version': 'v1', 'created': 'Fri, 20 Dec 2019 09:44:42 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Dec 2019 10:44:08 GMT'}, {'version': 'v3', 'created': 'Sat, 2 May 2020 19:55:06 GMT'}]",2020-11-02,"[['Efimov', 'Pavel', ''], ['Chertok', 'Andrey', ''], ['Boytsov', 'Leonid', ''], ['Braslavski', 'Pavel', '']]","['reading comprehension', 'question answering', 'Russian language resources', 'evaluation']"
9186,2001.10285,Rion Brattig Correia,"Rion Brattig Correia and Ian B. Wood and Johan Bollen and Luis M.
  Rocha","Mining social media data for biomedical signals and health-related
  behavior",To appear in the Annual Review of Biomedical Data Science,"Annual Review of Biomedical Data Science, 3:1 (2020)",10.1146/annurev-biodatasci-030320-040844,,cs.CY cs.SI q-bio.QM,http://creativecommons.org/licenses/by/4.0/,"  Social media data has been increasingly used to study biomedical and
health-related phenomena. From cohort level discussions of a condition to
planetary level analyses of sentiment, social media has provided scientists
with unprecedented amounts of data to study human behavior and response
associated with a variety of health conditions and medical treatments. Here we
review recent work in mining social media for biomedical, epidemiological, and
social phenomena information relevant to the multilevel complexity of human
health. We pay particular attention to topics where social media data analysis
has shown the most progress, including pharmacovigilance, sentiment analysis
especially for mental health, and other areas. We also discuss a variety of
innovative uses of social media data for health-related applications and
important limitations in social media data access and use.
","[{'version': 'v1', 'created': 'Tue, 28 Jan 2020 12:08:22 GMT'}]",2020-09-17,"[['Correia', 'Rion Brattig', ''], ['Wood', 'Ian B.', ''], ['Bollen', 'Johan', ''], ['Rocha', 'Luis M.', '']]","['social media', 'healthcare', 'pharmacovigilance', 'sentiment analysis', 'biomedicine']"
9187,2105.14935,Dalila Tamzalit,"Jean-Philippe Gouigoux, Dalila Tamzalit (IUT Nantes, LS2N), Joost
  Noppen",Microservice Maturity of Organizations: towards an assessment framework,,"International Conference on Research Challenges in Information
  Science, May 2021, Virtual, Cyprus. pp.523-540",10.1007/978-3-030-75018-3_34,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This early work aims to allow organizations to diagnose their capacity to
properly adopt microservices through initial milestones of a Microservice
Maturity Model (MiMMo). The objective is to prepare the way towards a general
framework to help companies and industries to determine their microservices
maturity. Organizations lean more and more on distributed web applications and
Line of Business software. This is particularly relevant during the current
Covid-19 crisis, where companies are even more challenged to offer their
services online, targeting a very high level of responsiveness in the face of
rapidly increasing and diverse demands. For this, microservices remain the most
suitable delivery application architectural style. They allow agility not only
on the technical application, as often considered, but on the enterprise
architecture as a whole, influencing the actual financial business of the
company. However, microservices adoption is highly risk-prone and complex.
Before they establish an appropriate migration plan, first and foremost,
companies must assess their degree of readiness to adopt microservices. For
this, MiMMo, a Microservices Maturity Model framework assessment, is proposed
to help companies assess their readiness for the microservice architectural
style, based on their actual situation. MiMMo results from observations of and
experience with about thirty organizations writing software. It conceptualizes
and generalizes the progression paths they have followed to adopt microservices
appropriately. Using the model, an organization can evaluate itself in two
dimensions and five maturity levels and thus: (i) benchmark itself on its
current use of microservices; (ii) project the next steps it needs to achieve a
higher maturity level and (iii) analyze how it has evolved and maintain a
global coherence between technical and business stakes.
","[{'version': 'v1', 'created': 'Mon, 31 May 2021 13:01:06 GMT'}]",2021-06-01,"[['Gouigoux', 'Jean-Philippe', '', 'IUT Nantes, LS2N'], ['Tamzalit', 'Dalila', '', 'IUT Nantes, LS2N'], ['Noppen', 'Joost', '']]","['Microservices', 'Maturity Model', 'assessment', 'Information Systems']"
9188,2004.14657,"Jarkko Peltom\""aki","Jarkko Peltom\""aki, Aleksi Saarela","Standard words and solutions of the word equation $X_1^2 \dotsm X_n^2 =
  (X_1 \dotsm X_n)^2$","18 pages, 2 figures, 1 table","Journal of Combinatorial Theory, Series A, Vol. 178, 105340:1-23
  (2021)",10.1016/j.jcta.2020.105340,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider solutions of the word equation $X_1^2 \dotsm X_n^2 = (X_1 \dotsm
X_n)^2$ such that the squares $X_i^2$ are minimal squares found in optimal
squareful infinite words. We apply a method developed by the second author for
studying word equations and prove that there are exactly two families of
solutions: reversed standard words and words obtained from reversed standard
words by a simple substitution scheme. A particular and remarkable consequence
is that a word $w$ is a standard word if and only if its reversal is a solution
to the word equation and $\gcd(|w|, |w|_1) = 1$. This result can be interpreted
as a yet another characterization for standard Sturmian words.
  We apply our results to the symbolic square root map $\sqrt{\cdot}$ studied
by the first author and M. A. Whiteland. We prove that if the language of a
minimal subshift $\Omega$ contains infinitely many solutions to the word
equation, then either $\Omega$ is Sturmian and $\sqrt{\cdot}$-invariant or
$\Omega$ is a so-called SL-subshift and not $\sqrt{\cdot}$-invariant. This
result is progress towards proving the conjecture that a minimal and
$\sqrt{\cdot}$-invariant subshift is necessarily Sturmian.
","[{'version': 'v1', 'created': 'Thu, 30 Apr 2020 09:40:10 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Nov 2020 08:45:04 GMT'}]",2020-11-04,"[['Peltomäki', 'Jarkko', ''], ['Saarela', 'Aleksi', '']]","['word equation', 'symbolic square root map', 'standard word', 'Sturmian word', 'optimal squarefulword']"
9189,2111.04324,Jiayang Song,"Jiayang Song, Deyun Lyu, Zhenya Zhang, Zhijie Wang, Tianyi Zhang, Lei
  Ma","When Cyber-Physical Systems Meet AI: A Benchmark, an Evaluation, and a
  Way Forward",,,10.1145/3510457.3513049,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Cyber-physical systems (CPS) have been broadly deployed in safety-critical
domains, such as automotive systems, avionics, medical devices, etc. In recent
years, Artificial Intelligence (AI) has been increasingly adopted to control
CPS. Despite the popularity of AI-enabled CPS, few benchmarks are publicly
available. There is also a lack of deep understanding on the performance and
reliability of AI-enabled CPS across different industrial domains. To bridge
this gap, we initiate to create a public benchmark of industry-level CPS in
seven domains and build AI controllers for them via state-of-the-art deep
reinforcement learning (DRL) methods. Based on that, we further perform a
systematic evaluation of these AI-enabled systems with their traditional
counterparts to identify the current challenges and explore future
opportunities. Our key findings include (1) AI controllers do not always
outperform traditional controllers, (2) existing CPS testing techniques
(falsification, specifically) fall short of analyzing AI-enabled CPS, and (3)
building a hybrid system that strategically combines and switches between AI
controllers and traditional controllers can achieve better performance across
different domains. Our results highlight the need for new testing techniques
for AI-enabled CPS and the need for more investigations into hybrid CPS systems
to achieve optimal performance and reliability.
","[{'version': 'v1', 'created': 'Mon, 8 Nov 2021 08:29:28 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Apr 2022 05:38:08 GMT'}]",2022-04-20,"[['Song', 'Jiayang', ''], ['Lyu', 'Deyun', ''], ['Zhang', 'Zhenya', ''], ['Wang', 'Zhijie', ''], ['Zhang', 'Tianyi', ''], ['Ma', 'Lei', '']]","['Cyper-Physical Systems', 'AI Controllers', 'Falsification', 'Benchmarks', 'Deep Reinforcement Learning']"
9190,1810.04886,Federico Cerutti,"Pietro Baroni, Federico Cerutti, Massimiliano Giacomin, Giovanni Guida",AFRA: Argumentation framework with recursive attacks,,,10.1016/j.ijar.2010.05.004,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The issue of representing attacks to attacks in argumentation is receiving an
increasing attention as a useful conceptual modelling tool in several contexts.
In this paper we present AFRA, a formalism encompassing unlimited recursive
attacks within argumentation frameworks. AFRA satisfies the basic requirements
of definition simplicity and rigorous compatibility with Dung's theory of
argumentation. This paper provides a complete development of the AFRA formalism
complemented by illustrative examples and a detailed comparison with other
recursive attack formalizations.
","[{'version': 'v1', 'created': 'Thu, 11 Oct 2018 08:16:48 GMT'}]",2018-10-12,"[['Baroni', 'Pietro', ''], ['Cerutti', 'Federico', ''], ['Giacomin', 'Massimiliano', ''], ['Guida', 'Giovanni', '']]","['Argumentation frameworks', 'Argumentation semantics', 'Argumentattack relation']"
9191,2009.10369,"S\""oren Henning","S\""oren Henning, Wilhelm Hasselbring, Heinz Burmester, Armin M\""obius,
  Maik Wojcieszak","Goals and Measures for Analyzing Power Consumption Data in Manufacturing
  Enterprises",24 pages,"Journal of Data, Information and Management (2021)",10.1007/s42488-021-00043-5,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Internet of Things adoption in the manufacturing industry allows
enterprises to monitor their electrical power consumption in real time and at
machine level. In this paper, we follow up on such emerging opportunities for
data acquisition and show that analyzing power consumption in manufacturing
enterprises can serve a variety of purposes. Apart from the prevalent goal of
reducing overall power consumption for economical and ecological reasons, such
data can, for example, be used to improve production processes.
  Based on a literature review and expert interviews, we discuss how analyzing
power consumption data can serve the goals reporting, optimization, fault
detection, and predictive maintenance. To tackle these goals, we propose to
implement the measures real-time data processing, multi-level monitoring,
temporal aggregation, correlation, anomaly detection, forecasting,
visualization, and alerting in software.
  We transfer our findings to two manufacturing enterprises and show how the
presented goals reflect in these enterprises. In a pilot implementation of a
power consumption analytics platform, we show how our proposed measures can be
implemented with a microservice-based architecture, stream processing
techniques, and the fog computing paradigm. We provide the implementations as
open source as well as a public demo allowing to reproduce and extend our
research.
","[{'version': 'v1', 'created': 'Tue, 22 Sep 2020 07:55:03 GMT'}]",2021-03-29,"[['Henning', 'Sören', ''], ['Hasselbring', 'Wilhelm', ''], ['Burmester', 'Heinz', ''], ['Möbius', 'Armin', ''], ['Wojcieszak', 'Maik', '']]","['Power Consumption', 'Energy Management', 'Industry 4']"
9192,2201.08135,Nuria Rodr\'iguez-Barroso,"Nuria Rodr\'iguez-Barroso, Daniel Jim\'enez L\'opez, M. Victoria
  Luz\'on, Francisco Herrera and Eugenio Mart\'inez-C\'amara","Survey on Federated Learning Threats: concepts, taxonomy on attacks and
  defences, experimental study and challenges",,Information Fusion (2022),10.1016/j.inffus.2022.09.011,,cs.CR cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Federated learning is a machine learning paradigm that emerges as a solution
to the privacy-preservation demands in artificial intelligence. As machine
learning, federated learning is threatened by adversarial attacks against the
integrity of the learning model and the privacy of data via a distributed
approach to tackle local and global learning. This weak point is exacerbated by
the inaccessibility of data in federated learning, which makes harder the
protection against adversarial attacks and evidences the need to furtherance
the research on defence methods to make federated learning a real solution for
safeguarding data privacy. In this paper, we present an extensive review of the
threats of federated learning, as well as as their corresponding
countermeasures, attacks versus defences. This survey provides a taxonomy of
adversarial attacks and a taxonomy of defence methods that depict a general
picture of this vulnerability of federated learning and how to overcome it.
Likewise, we expound guidelines for selecting the most adequate defence method
according to the category of the adversarial attack. Besides, we carry out an
extensive experimental study from which we draw further conclusions about the
behaviour of attacks and defences and the guidelines for selecting the most
adequate defence method according to the category of the adversarial attack.
This study is finished leading to meditated learned lessons and challenges.
","[{'version': 'v1', 'created': 'Thu, 20 Jan 2022 12:23:03 GMT'}]",2022-09-20,"[['Rodríguez-Barroso', 'Nuria', ''], ['López', 'Daniel Jiménez', ''], ['Luzón', 'M. Victoria', ''], ['Herrera', 'Francisco', ''], ['Martínez-Cámara', 'Eugenio', '']]","['Federated learning', 'adversarial attacks', 'privacy attacks', 'defences']"
9193,2104.04485,Reza Sepasdar,"Reza Sepasdar, Anuj Karpatne, Maryam Shakiba","A Data-Driven Approach to Full-Field Damage and Failure Pattern
  Prediction in Microstructure-Dependent Composites using Deep Learning",,,10.1016/j.cma.2022.115126,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An image-based deep learning framework is developed in this paper to predict
damage and failure in microstructure-dependent composite materials. The work is
motivated by the complexity and computational cost of high-fidelity simulations
of such materials. The proposed deep learning framework predicts the
post-failure full-field stress distribution and crack pattern in
two-dimensional representations of the composites based on the geometry of
microstructures. The material of interest is selected to be a high-performance
unidirectional carbon fiber-reinforced polymer composite. The deep learning
framework contains two stacked fully-convolutional networks, namely, Generator
1 and Generator 2, trained sequentially. First, Generator 1 learns to translate
the microstructural geometry to the full-field post-failure stress
distribution. Then, Generator 2 learns to translate the output of Generator 1
to the failure pattern. A physics-informed loss function is also designed and
incorporated to further improve the performance of the proposed framework and
facilitate the validation process. In order to provide a sufficiently large
data set for training and validating the deep learning framework, 4500
microstructural representations are synthetically generated and simulated in an
efficient finite element framework. It is shown that the proposed deep learning
approach can effectively predict the composites' post-failure full-field stress
distribution and failure pattern, two of the most complex phenomena to simulate
in computational solid mechanics.
","[{'version': 'v1', 'created': 'Fri, 9 Apr 2021 17:11:50 GMT'}]",2022-06-07,"[['Sepasdar', 'Reza', ''], ['Karpatne', 'Anuj', ''], ['Shakiba', 'Maryam', '']]","['machine learning', 'deep learning', 'full-field stress prediction', 'failure']"
9194,2009.00707,Steven Kearnes,Steven Kearnes,Pursuing a Prospective Perspective,Trends in Chemistry (2020),,10.1016/j.trechm.2020.10.012,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Retrospective testing of predictive models does not consider the real-world
context in which models are deployed. Prospective validation, on the other
hand, enables meaningful comparisons between data generation processes by
incorporating trained models and considering the subjective decisions that
affect reproducibility. Prospective experiments are essential for consistent
progress in modeling.
","[{'version': 'v1', 'created': 'Wed, 26 Aug 2020 17:39:53 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Oct 2020 16:43:10 GMT'}]",2020-11-19,"[['Kearnes', 'Steven', '']]","['machine learning', 'QSAR', 'model validation']"
9195,2201.13078,Huang Ling,"Ling Huang, Su Ruan, Pierre Decazes, Thierry Denoeux","Lymphoma segmentation from 3D PET-CT images using a deep evidential
  network",Preprint submitted to International Journal of Approximate Reasoning,"International Journal of Approximate Reasoning, Volume 149, 2022,
  Pages 39-60,",10.1016/j.ijar.2022.06.007,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An automatic evidential segmentation method based on Dempster-Shafer theory
and deep learning is proposed to segment lymphomas from three-dimensional
Positron Emission Tomography (PET) and Computed Tomography (CT) images. The
architecture is composed of a deep feature-extraction module and an evidential
layer. The feature extraction module uses an encoder-decoder framework to
extract semantic feature vectors from 3D inputs. The evidential layer then uses
prototypes in the feature space to compute a belief function at each voxel
quantifying the uncertainty about the presence or absence of a lymphoma at this
location. Two evidential layers are compared, based on different ways of using
distances to prototypes for computing mass functions. The whole model is
trained end-to-end by minimizing the Dice loss function. The proposed
combination of deep feature extraction and evidential segmentation is shown to
outperform the baseline UNet model as well as three other state-of-the-art
models on a dataset of 173 patients.
","[{'version': 'v1', 'created': 'Mon, 31 Jan 2022 09:34:38 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Jun 2022 14:11:18 GMT'}]",2022-11-21,"[['Huang', 'Ling', ''], ['Ruan', 'Su', ''], ['Decazes', 'Pierre', ''], ['Denoeux', 'Thierry', '']]","['medical image analysis', 'Dempster-Shafer theory', 'evidence theory', 'belieffunctions', 'uncertainty quantification', 'deep learning']"
9196,2204.00371,Thomas Spenke,"Thomas Spenke, Michel Make, Norbert Hosters","A Robin-Neumann Scheme with Quasi-Newton Acceleration for Partitioned
  Fluid-Structure Interaction","Keywords: Partitioned Fluid-Structure Interaction, Robin-Neumann
  Scheme,Interface Quasi-Newton Methods",Int J Numer Methods Eng. 2022;1-19,10.1002/nme.7151,,cs.CE cs.NA math.NA,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The Dirichlet-Neumann scheme is the most common partitioned algorithm for
fluid-structure interaction (FSI) and offers high flexibility concerning the
solvers employed for the two subproblems. Nevertheless, it is not without
shortcomings: to begin with, the inherent added-mass effect often destabilizes
the numerical solution severely. Moreover, the Dirichlet-Neumann scheme cannot
be applied to FSI problems in which an incompressible fluid is fully enclosed
by Dirichlet boundaries, as it is incapable of satisfying the volume
constraint. In the last decade, interface quasi-Newton methods have proven to
control the added-mass effect and substantially speed up convergence by adding
a Newton-like update step to the Dirichlet-Neumann coupling. They are, however,
without effect on the incompressibility dilemma. As an alternative, the
Robin-Neumann scheme generalizes the fluid's boundary condition to a Robin
condition by including the Cauchy stresses. While this modification in fact
successfully tackles both drawbacks of the Dirichlet-Neumann approach, the
price to be paid is a strong dependency on the Robin weighting parameter, with
very limited a priori knowledge about good choices. This work proposes a
strategy to merge these two ideas and benefit from their combined strengths.
The resulting quasi-Newton-accelerated Robin-Neumann scheme is compared to both
Robin- and Dirichlet-Neumann variants. The numerical tests demonstrate that it
does not only provide faster convergence, but also massively reduces the
influence of the Robin parameter, mitigating the main drawback of the
Robin-Neumann algorithm.
","[{'version': 'v1', 'created': 'Fri, 1 Apr 2022 11:41:34 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Nov 2022 07:50:40 GMT'}]",2022-11-15,"[['Spenke', 'Thomas', ''], ['Make', 'Michel', ''], ['Hosters', 'Norbert', '']]","['Partitioned Fluid-Structure Interaction', 'Robin-Neumann Scheme', 'Interface Quasi-Newton Methods']"
9197,2207.10175,Angelo Bratta,"Angelo Bratta, Michele Focchi, Niraj Rathod, and Claudio Semini","Optimization-Based Reference Generator for Nonlinear Model Predictive
  Control of Legged Robots",,,10.3390/robotics12010006,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Model Predictive Control (MPC) approaches are widely used in robotics, since
they guarantee feasibility and allow the computation of updated trajectories
while the robot is moving. They generally require heuristic references for the
tracking terms and proper tuning of the parameters of the cost function in
order to obtain good performance. For instance, when a legged robot has to
react to disturbances from the environment (e.g., recover after a push) or
track a specific goal with statically unstable gaits, the effectiveness of the
algorithm can degrade. In this work, we propose a novel optimization-based
Reference Generator which exploits a Linear Inverted Pendulum (LIP) model to
compute reference trajectories for the Center of Mass while taking into account
the possible under-actuation of a gait (e.g., in a trot). The obtained
trajectories are used as references for the cost function of the Nonlinear MPC
presented in our previous work. We also present a formulation that ensures
guarantees on the response time to reach a goal without the need to tune the
weights of the cost terms. In addition, footholds are corrected using the
optimized reference to drive the robot towards the goal. We demonstrate the
effectiveness of our approach both in simulations and experiments in different
scenarios with the Aliengo robot.
","[{'version': 'v1', 'created': 'Wed, 20 Jul 2022 19:59:07 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Nov 2022 16:12:07 GMT'}, {'version': 'v3', 'created': 'Fri, 6 Jan 2023 10:31:08 GMT'}]",2023-01-09,"[['Bratta', 'Angelo', ''], ['Focchi', 'Michele', ''], ['Rathod', 'Niraj', ''], ['Semini', 'Claudio', '']]","['Legged Robots', 'Reference Generator', 'Model Predictive Controller', 'Motion and Path Planning', 'Optimization', 'Optimal Control']"
9198,2012.06502,Mohammad Mannan,"S. Ali, M. Elgharabawy, Q. Duchaussoy, M. Mannan, A. Youssef","Betrayed by the Guardian: Security and Privacy Risks of Parental Control
  Solutions",,Published at ACSAC 2020,10.1145/3427228.3427287,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For parents of young children and adolescents, the digital age has introduced
many new challenges, including excessive screen time, inappropriate online
content, cyber predators, and cyberbullying. To address these challenges, many
parents rely on numerous parental control solutions on different platforms,
including parental control network devices (e.g., WiFi routers) and software
applications on mobile devices and laptops. While these parental control
solutions may help digital parenting, they may also introduce serious security
and privacy risks to children and parents, due to their elevated privileges and
having access to a significant amount of privacy-sensitive data. In this paper,
we present an experimental framework for systematically evaluating security and
privacy issues in parental control software and hardware solutions. Using the
developed framework, we provide the first comprehensive study of parental
control tools on multiple platforms including network devices, Windows
applications, Chrome extensions and Android apps. Our analysis uncovers
pervasive security and privacy issues that can lead to leakage of private
information, and/or allow an adversary to fully control the parental control
solution, and thereby may directly aid cyberbullying and cyber predators.
","[{'version': 'v1', 'created': 'Fri, 11 Dec 2020 17:06:00 GMT'}]",2020-12-14,"[['Ali', 'S.', ''], ['Elgharabawy', 'M.', ''], ['Duchaussoy', 'Q.', ''], ['Mannan', 'M.', ''], ['Youssef', 'A.', '']]","['Parental control network devices', 'Android apps', 'Windows applications', 'Web extensions', 'Privacy', 'Security']"
9199,1702.05701,Vivek Nair,"Vivek Nair, Tim Menzies, Norbert Siegmund, Sven Apel",Using Bad Learners to find Good Configurations,"11 pages, 11 figures",,10.1145/3106237.3106238,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finding the optimally performing configuration of a software system for a
given setting is often challenging. Recent approaches address this challenge by
learning performance models based on a sample set of configurations. However,
building an accurate performance model can be very expensive (and is often
infeasible in practice). The central insight of this paper is that exact
performance values (e.g. the response time of a software system) are not
required to rank configurations and to identify the optimal one. As shown by
our experiments, models that are cheap to learn but inaccurate (with respect to
the difference between actual and predicted performance) can still be used rank
configurations and hence find the optimal configuration. This novel
\emph{rank-based approach} allows us to significantly reduce the cost (in terms
of number of measurements of sample configuration) as well as the time required
to build models. We evaluate our approach with 21 scenarios based on 9 software
systems and demonstrate that our approach is beneficial in 16 scenarios; for
the remaining 5 scenarios, an accurate model can be built by using very few
samples anyway, without the need for a rank-based approach.
","[{'version': 'v1', 'created': 'Sun, 19 Feb 2017 05:04:23 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Jun 2017 11:21:04 GMT'}]",2017-09-12,"[['Nair', 'Vivek', ''], ['Menzies', 'Tim', ''], ['Siegmund', 'Norbert', ''], ['Apel', 'Sven', '']]","['Performance Prediction', 'SBSE', 'Sampling', 'Rank-based method']"
9200,2111.03512,Hongrui Shi,"Hongrui Shi, Valentin Radu",Data Selection for Efficient Model Update in Federated Learning,,,10.1145/3517207.3526980,,cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  The Federated Learning (FL) workflow of training a centralized model with
distributed data is growing in popularity. However, until recently, this was
the realm of contributing clients with similar computing capability. The fast
expanding IoT space and data being generated and processed at the edge are
encouraging more effort into expanding federated learning to include
heterogeneous systems. Previous approaches distribute light-weight models to
clients are rely on knowledge transfer to distil the characteristic of local
data in partitioned updates. However, their additional knowledge exchange
transmitted through the network degrades the communication efficiency of FL. We
propose to reduce the size of knowledge exchanged in these FL setups by
clustering and selecting only the most representative bits of information from
the clients. The partitioned global update adopted in our work splits the
global deep neural network into a lower part for generic feature extraction and
an upper part that is more sensitive to this selected client knowledge. Our
experiments show that only 1.6% of the initially exchanged data can effectively
transfer the characteristic of the client data to the global model in our FL
approach, using split networks. These preliminary results evolve our
understanding of federated learning by demonstrating efficient training using
strategically selected training samples.
","[{'version': 'v1', 'created': 'Fri, 5 Nov 2021 14:07:06 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Mar 2022 13:57:39 GMT'}]",2022-03-23,"[['Shi', 'Hongrui', ''], ['Radu', 'Valentin', '']]","['federated learning', 'split learning', 'metadata', 'clustering']"
9201,1709.02535,Shiro Yano,"Megumi Miyashita, Shiro Yano, Toshiyuki Kondo",Mirror Descent Search and its Acceleration,"Gold open access in Journal of Robotics and Autonomous Systems:
  https://www.sciencedirect.com/science/article/pii/S0921889017307546",,10.1016/j.robot.2018.04.009,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, attention has been focused on the relationship between
black-box optimiza- tion problem and reinforcement learning problem. In this
research, we propose the Mirror Descent Search (MDS) algorithm which is
applicable both for black box optimization prob- lems and reinforcement
learning problems. Our method is based on the mirror descent method, which is a
general optimization algorithm. The contribution of this research is roughly
twofold. We propose two essential algorithms, called MDS and Accelerated Mirror
Descent Search (AMDS), and two more approximate algorithms: Gaussian Mirror
Descent Search (G-MDS) and Gaussian Accelerated Mirror Descent Search (G-AMDS).
This re- search shows that the advanced methods developed in the context of the
mirror descent research can be applied to reinforcement learning problem. We
also clarify the relationship between an existing reinforcement learning
algorithm and our method. With two evaluation experiments, we show our proposed
algorithms converge faster than some state-of-the-art methods.
","[{'version': 'v1', 'created': 'Fri, 8 Sep 2017 04:43:48 GMT'}, {'version': 'v2', 'created': 'Sat, 12 May 2018 09:04:21 GMT'}]",2018-05-15,"[['Miyashita', 'Megumi', ''], ['Yano', 'Shiro', ''], ['Kondo', 'Toshiyuki', '']]","['Reinforcement Learning', 'Mirror Descent', 'Bregman Divergence', 'AcceleratedMirror Descent', 'Policy Improvement with Path Integrals']"
9202,2204.05954,Shan Xu,"Shan Xu, Chang Xu, Sarah McIntyre, H{\aa}kan Olausson, Gregory J.
  Gerling","3D Visual Tracking to Quantify Physical Contact Interactions in
  Human-to-Human Touch",Accepted by Frontiers in Physiology,,10.3389/fphys.2022.841938,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Across a plethora of social situations, we touch others in natural and
intuitive ways to share thoughts and emotions, such as tapping to get one's
attention or caressing to soothe one's anxiety. A deeper understanding of these
human-to-human interactions will require, in part, the precise measurement of
skin-to-skin physical contact. Among prior efforts, each measurement approach
exhibits certain constraints, e.g., motion trackers do not capture the precise
shape of skin surfaces, while pressure sensors impede direct skin contact. In
contrast, this work develops an interference-free 3D visual tracking system
using a depth camera to measure the contact attributes between the bare hand of
a toucher and the forearm of a receiver. The toucher's hand is tracked as a
posed and positioned mesh by fitting a hand model to detected 3D joints,
whereas the forearm is extracted as a detailed 3D surface. Based on a contact
model of point clouds, the spatiotemporal contact changes are decomposed as six
high-resolution time-series attributes, i.e., contact area, indentation depth,
absolute velocity, and three orthogonal velocity components, together with
contact duration. To examine the system's capabilities and limitations, two
experiments were performed. First, to evaluate its ability to discern human
touches, one person delivered cued social messages, e.g., happiness, anger,
sympathy, to another using their preferred gestures. The results indicated that
messages, gestures, and the individual touchers, were readily discerned from
their contact attributes. Second, the measurement accuracy was validated
against independent devices, including an electromagnetic tracker, pressure
mat, and laser sensor. While validated here in the context of social
communication, this system is extendable to human touch interactions such as
maternal care of infants and massage therapy.
","[{'version': 'v1', 'created': 'Tue, 12 Apr 2022 17:11:28 GMT'}]",2022-10-11,"[['Xu', 'Shan', ''], ['Xu', 'Chang', ''], ['McIntyre', 'Sarah', ''], ['Olausson', 'Håkan', ''], ['Gerling', 'Gregory J.', '']]","['touch', 'social touch', 'haptics', 'visual tracking', 'tactile mechanics', 'human performance', 'emotion communication']"
9203,2202.11984,Jan Luxemburk,"Jan Luxemburk, Tom\'a\v{s} \v{C}ejka",Fine-grained TLS services classification with reject option,,"Computer Networks, vol. 220, p. 109467, Jan. 2023",10.1016/j.comnet.2022.109467,,cs.LG cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The recent success and proliferation of machine learning and deep learning
have provided powerful tools, which are also utilized for encrypted traffic
analysis, classification, and threat detection in computer networks. These
methods, neural networks in particular, are often complex and require a huge
corpus of training data. Therefore, this paper focuses on collecting a large
up-to-date dataset with almost 200 fine-grained service labels and 140 million
network flows extended with packet-level metadata. The number of flows is three
orders of magnitude higher than in other existing public labeled datasets of
encrypted traffic. The number of service labels, which is important to make the
problem hard and realistic, is four times higher than in the public dataset
with the most class labels. The published dataset is intended as a benchmark
for identifying services in encrypted traffic. Service identification can be
further extended with the task of ""rejecting"" unknown services, i.e., the
traffic not seen during the training phase. Neural networks offer superior
performance for tackling this more challenging problem. To showcase the
dataset's usefulness, we implemented a neural network with a multi-modal
architecture, which is the state-of-the-art approach, and achieved 97.04%
classification accuracy and detected 91.94% of unknown services with 5% false
positive rate.
","[{'version': 'v1', 'created': 'Thu, 24 Feb 2022 09:44:12 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Nov 2022 19:05:29 GMT'}]",2022-12-01,"[['Luxemburk', 'Jan', ''], ['Čejka', 'Tomáš', '']]","['Traffic classification', 'Deep learning', 'Novelty detection', 'Traffic datasets', 'Encrypted traffic', 'TLS']"
9204,1508.04855,EPTCS,"Xian Xu (East China University of Science and Technology), Qiang Yin
  (Shanghai Jiao Tong University), Huan Long (Shanghai Jiao Tong University)","On the Computation Power of Name Parameterization in Higher-order
  Processes","In Proceedings ICE 2015, arXiv:1508.04595","EPTCS 189, 2015, pp. 114-127",10.4204/EPTCS.189.10,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parameterization extends higher-order processes with the capability of
abstraction (akin to that in lambda-calculus), and is known to be able to
enhance the expressiveness. This paper focuses on the parameterization of
names, i.e. a construct that maps a name to a process, in the higher-order
setting. We provide two results concerning its computation capacity. First,
name parameterization brings up a complete model, in the sense that it can
express an elementary interactive model with built-in recursive functions.
Second, we compare name parameterization with the well-known pi-calculus, and
provide two encodings between them.
","[{'version': 'v1', 'created': 'Thu, 20 Aug 2015 01:41:25 GMT'}]",2015-08-21,"[['Xu', 'Xian', '', 'East China University of Science and Technology'], ['Yin', 'Qiang', '', 'Shanghai Jiao Tong University'], ['Long', 'Huan', '', 'Shanghai Jiao Tong University']]","['Parameterization', 'Computation', 'Higher-order', 'Processes']"
9205,2101.11103,Toby Jia-Jun Li,"Toby Jia-Jun Li, Lindsay Popowski, Tom M. Mitchell, Brad A. Myers",Screen2Vec: Semantic Embedding of GUI Screens and GUI Components,"Accepted to CHI Conference on Human Factors in Computing Systems (CHI
  2021)",,10.1145/3411764.3445049,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Representing the semantics of GUI screens and components is crucial to
data-driven computational methods for modeling user-GUI interactions and mining
GUI designs. Existing GUI semantic representations are limited to encoding
either the textual content, the visual design and layout patterns, or the app
contexts. Many representation techniques also require significant manual data
annotation efforts. This paper presents Screen2Vec, a new self-supervised
technique for generating representations in embedding vectors of GUI screens
and components that encode all of the above GUI features without requiring
manual annotation using the context of user interaction traces. Screen2Vec is
inspired by the word embedding method Word2Vec, but uses a new two-layer
pipeline informed by the structure of GUIs and interaction traces and
incorporates screen- and app-specific metadata. Through several sample
downstream tasks, we demonstrate Screen2Vec's key useful properties:
representing between-screen similarity through nearest neighbors,
composability, and capability to represent user tasks.
","[{'version': 'v1', 'created': 'Mon, 11 Jan 2021 17:17:34 GMT'}]",2021-01-28,"[['Li', 'Toby Jia-Jun', ''], ['Popowski', 'Lindsay', ''], ['Mitchell', 'Tom M.', ''], ['Myers', 'Brad A.', '']]","['GUI embedding', 'interaction mining', 'screen semantics']"
9206,2203.09103,Majid Ramezani,"Majid Ramezani and Mohammad-Reza Feizi-Derakhshi and Mohammad-Ali
  Balafar",Knowledge Graph-Enabled Text-Based Automatic Personality Prediction,"This is a preprint of an article published in ""Computational
  Intelligence and Neuroscience""",,10.1155/2022/3732351,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  How people think, feel, and behave, primarily is a representation of their
personality characteristics. By being conscious of personality characteristics
of individuals whom we are dealing with or decided to deal with, one can
competently ameliorate the relationship, regardless of its type. With the rise
of Internet-based communication infrastructures (social networks, forums,
etc.), a considerable amount of human communications take place there. The most
prominent tool in such communications, is the language in written and spoken
form that adroitly encodes all those essential personality characteristics of
individuals. Text-based Automatic Personality Prediction (APP) is the automated
forecasting of the personality of individuals based on the generated/exchanged
text contents. This paper presents a novel knowledge graph-enabled approach to
text-based APP that relies on the Big Five personality traits. To this end,
given a text a knowledge graph which is a set of interlinked descriptions of
concepts, was built through matching the input text's concepts with DBpedia
knowledge base entries. Then, due to achieving more powerful representation the
graph was enriched with the DBpedia ontology, NRC Emotion Intensity Lexicon,
and MRC psycholinguistic database information. Afterwards, the knowledge graph
which is now a knowledgeable alternative for the input text was embedded to
yield an embedding matrix. Finally, to perform personality predictions the
resulting embedding matrix was fed to four suggested deep learning models
independently, which are based on convolutional neural network (CNN), simple
recurrent neural network (RNN), long short term memory (LSTM) and bidirectional
long short term memory (BiLSTM). The results indicated a considerable
improvements in prediction accuracies in all of the suggested classifiers.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2022 06:01:45 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Jun 2022 11:23:53 GMT'}]",2022-07-05,"[['Ramezani', 'Majid', ''], ['Feizi-Derakhshi', 'Mohammad-Reza', ''], ['Balafar', 'Mohammad-Ali', '']]","['Automatic Personality Prediction (APP)', 'Knowledge Graph(KG)', 'Knowledge Representation (KR)', 'DBpedia', 'Big Five', 'Natural Language Processing (NLP)']"
9207,1911.04667,Evgeny Tsykunov,Evgeny Tsykunov and Dzmitry Tsetserukou,"WiredSwarm: High Resolution Haptic Feedback Provided by a Swarm of
  Drones to the User's Fingers for VR interaction",ACM VRST 2019 conference,,10.1145/3359996.3364789,,cs.RO cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a concept of a novel interaction strategy for providing rich
haptic feedback in Virtual Reality (VR), when each user's finger is connected
to micro-quadrotor with a wire. Described technology represents the first
flying wearable haptic interface. The solution potentially is able to deliver
high resolution force feedback to each finger during fine motor interaction in
VR. The tips of tethers are connected to the centers of quadcopters under their
bottom. Therefore, flight stability is increasing and the interaction forces
are becoming stronger which allows to use smaller drones.
","[{'version': 'v1', 'created': 'Tue, 12 Nov 2019 04:25:37 GMT'}]",2019-11-13,"[['Tsykunov', 'Evgeny', ''], ['Tsetserukou', 'Dzmitry', '']]","['human-swarm interaction', 'haptics', 'force feedback', 'quadrotor', 'drone', 'virtual reality', 'swarm', 'multi-agent system']"
9208,2005.06964,Ripon Patgiri,Sabuzima Nayak and Ripon Patgiri and Thoudam Doren Singh,Big Computing: Where are we heading?,"Published in EAI Endorsed Transactions on Scalable Information
  Systems","EAI Endorsed Transactions on Scalable Information Systems, 2020",10.4108/eai.13-7-2018.163972,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  This paper presents the overview of the current trends of Big data against
the computing scenario from different aspects. Some of the important aspect
includes the Exascale, the computing power and the kind of applications which
offer the Big data. This starts with the current computing hardware constraint
against the need of the rising Big data applications. We highlight the issues
and challenges of energy requirement, software complexity, hardware failure,
fault tolerant computing, and communication. As the complexity of computation
is going to rise in the future. The paper also highlights the future direction
of Big computing systems for Bioinformatics, social media, hardware and
software requirements, data intensive computation and then towards GPU era.
","[{'version': 'v1', 'created': 'Thu, 9 Apr 2020 12:32:56 GMT'}]",2020-05-15,"[['Nayak', 'Sabuzima', ''], ['Patgiri', 'Ripon', ''], ['Singh', 'Thoudam Doren', '']]","['Big Computation', 'Big Computing', 'Big Data', 'Exascale', 'Exaflops', 'Zettaflops', 'GPU']"
9209,2008.00992,Matteo Dunnhofer,"Matteo Dunnhofer, Niki Martinel, Christian Micheloni","An Exploration of Target-Conditioned Segmentation Methods for Visual
  Object Trackers","European Conference on Computer Vision (ECCV) 2020, Visual Object
  Tracking Challenge VOT2020 workshop",,10.1007/978-3-030-68238-5_41,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visual object tracking is the problem of predicting a target object's state
in a video. Generally, bounding-boxes have been used to represent states, and a
surge of effort has been spent by the community to produce efficient causal
algorithms capable of locating targets with such representations. As the field
is moving towards binary segmentation masks to define objects more precisely,
in this paper we propose to extensively explore target-conditioned segmentation
methods available in the computer vision community, in order to transform any
bounding-box tracker into a segmentation tracker. Our analysis shows that such
methods allow trackers to compete with recently proposed segmentation trackers,
while performing quasi real-time.
","[{'version': 'v1', 'created': 'Mon, 3 Aug 2020 16:21:18 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Aug 2020 14:17:19 GMT'}]",2021-02-02,"[['Dunnhofer', 'Matteo', ''], ['Martinel', 'Niki', ''], ['Micheloni', 'Christian', '']]","['Visual Object Tracking', 'Video Object Segmentation', 'TargetConditioned Segmentation', 'Deep Learning']"
9210,2012.01651,EPTCS,"Fatma Kachi (LIRE Laboratory, University of Constantine2-Abdelhamid
  Mehri), Chafia Bouanaka (LIRE Laboratory, University of
  Constantine2-Abdelhamid Mehri), Souheir Merkouche (University of
  Constantine2-Abdelhamid Mehri)","A Formal Model for Quality-Driven Decision Making in Self-Adaptive
  Systems","In Proceedings FMAS 2020, arXiv:2012.01176","EPTCS 329, 2020, pp. 48-64",10.4204/EPTCS.329.5,,cs.SE cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Maintaining an acceptable level of quality of service in modern complex
systems is challenging, particularly in the presence of various forms of
uncertainty caused by changing execution context, unpredicted events, etc.
Although self-adaptability is a well-established approach for modelling such
systems, and thus enabling them to achieve functional and/or quality of service
objectives by autonomously modifying their behavior at runtime, guaranteeing a
continuous satisfaction of quality objectives is still challenging and needs a
rigorous definition and analysis of system behavioral properties. Formal
methods constitute a promising and effective solution in this direction in
order to rigorously specify mathematical models of a software system and to
analyze its behavior. They are also largely adopted to analyze and provide
guarantees on the required functional/non-functional properties of
self-adaptive systems. Therefore, we introduce a formal model for
quality-driven self-adaptive systems under uncertainty. We combine high-level
Petri nets and plausible Petri nets in order to model complex data structures
enabling system quality attributes quantification and to improve the
decision-making process through selecting the most plausible plans with regard
to the system's actual context.
","[{'version': 'v1', 'created': 'Thu, 3 Dec 2020 02:22:38 GMT'}]",2020-12-04,"[['Kachi', 'Fatma', '', 'LIRE Laboratory, University of Constantine2-Abdelhamid\n  Mehri'], ['Bouanaka', 'Chafia', '', 'LIRE Laboratory, University of\n  Constantine2-Abdelhamid Mehri'], ['Merkouche', 'Souheir', '', 'University of\n  Constantine2-Abdelhamid Mehri']]","['Formal methods', 'Petri nets', 'Self-adaptive systems', 'Quality-driven systems', 'uncertainty models']"
9211,2011.14824,Wenyu Zhao,"Wenyu Zhao, Teli Ma, Xuan Gong, Baochang Zhang, and David Doermann",A Review of Recent Advances of Binary Neural Networks for Edge Computing,,,10.1109/JMASS.2020.3034205,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Edge computing is promising to become one of the next hottest topics in
artificial intelligence because it benefits various evolving domains such as
real-time unmanned aerial systems, industrial applications, and the demand for
privacy protection. This paper reviews recent advances on binary neural network
(BNN) and 1-bit CNN technologies that are well suitable for front-end,
edge-based computing. We introduce and summarize existing work and classify
them based on gradient approximation, quantization, architecture, loss
functions, optimization method, and binary neural architecture search. We also
introduce applications in the areas of computer vision and speech recognition
and discuss future applications for edge computing.
","[{'version': 'v1', 'created': 'Tue, 24 Nov 2020 01:10:21 GMT'}]",2020-12-01,"[['Zhao', 'Wenyu', ''], ['Ma', 'Teli', ''], ['Gong', 'Xuan', ''], ['Zhang', 'Baochang', ''], ['Doermann', 'David', '']]","['Edge Computing', 'BNN', '1-bit CNN', 'Front-end Computing', 'Neural Architecture Search']"
9212,1712.01163,Manuel Rigger,"Manuel Rigger (Johannes Kepler University Linz, Austria), Rene
  Mayrhofer (Johannes Kepler University Linz, Austria), Roland Schatz (Oracle
  Labs, Austria), Matthias Grimmer (Oracle Labs, Austria), Hanspeter
  M\""ossenb\""ock (Johannes Kepler University Linz, Austria)",Introspection for C and its Applications to Library Robustness,,"The Art, Science, and Engineering of Programming, 2018, Vol. 2,
  Issue 2, Article 4",10.22152/programming-journal.org/2018/2/4,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: In C, low-level errors, such as buffer overflow and use-after-free,
are a major problem, as they cause security vulnerabilities and hard-to-find
bugs. C lacks automatic checks, and programmers cannot apply defensive
programming techniques because objects (e.g., arrays or structs) lack run-time
information about bounds, lifetime, and types. Inquiry: Current approaches to
tackling low-level errors include dynamic tools, such as bounds or type
checkers, that check for certain actions during program execution. If they
detect an error, they typically abort execution. Although they track run-time
information as part of their runtimes, they do not expose this information to
programmers. Approach: We devised an introspection interface that allows C
programmers to access run-time information and to query object bounds, object
lifetimes, object types, and information about variadic arguments. This enables
library writers to check for invalid input or program states and thus, for
example, to implement custom error handling that maintains system availability
and does not terminate on benign errors. As we assume that introspection is
used together with a dynamic tool that implements automatic checks, errors that
are not handled in the application logic continue to cause the dynamic tool to
abort execution. Knowledge: Using the introspection interface, we implemented a
more robust, source-compatible version of the C standard library that validates
parameters to its functions. The library functions react to otherwise undefined
behavior; for example, they can detect lurking flaws, handle unterminated
strings, check format string arguments, and set errno when they detect benign
usage errors. Grounding: Existing dynamic tools maintain run-time information
that can be used to implement the introspection interface, and we demonstrate
its implementation in Safe Sulong, an interpreter and dynamic bug-finding tool
for C that runs on a Java Virtual Machine and can thus easily expose relevant
run-time information. Importance: Using introspection in user code is a novel
approach to tackling the long-standing problem of low-level errors in C. As new
approaches are lowering the performance overhead of run-time information
maintenance, the usage of dynamic runtimes for C could become more common,
which could ultimately facilitate a more widespread implementation of such an
introspection interface.
","[{'version': 'v1', 'created': 'Mon, 4 Dec 2017 15:56:38 GMT'}]",2017-12-05,"[['Rigger', 'Manuel', '', 'Johannes Kepler University Linz, Austria'], ['Mayrhofer', 'Rene', '', 'Johannes Kepler University Linz, Austria'], ['Schatz', 'Roland', '', 'Oracle\n  Labs, Austria'], ['Grimmer', 'Matthias', '', 'Oracle Labs, Austria'], ['Mössenböck', 'Hanspeter', '', 'Johannes Kepler University Linz, Austria']]","['refection for C', 'library robustness', 'fault tolerance']"
9213,2212.04603,Indranil Sur Mr,"Indranil Sur, Zachary Daniels, Abrar Rahman, Kamil Faber, Gianmarco J.
  Gallardo, Tyler L. Hayes, Cameron E. Taylor, Mustafa Burak Gurbuz, James
  Smith, Sahana Joshi, Nathalie Japkowicz, Michael Baron, Zsolt Kira,
  Christopher Kanan, Roberto Corizzo, Ajay Divakaran, Michael Piacentino, Jesse
  Hostetler, Aswin Raghavan","System Design for an Integrated Lifelong Reinforcement Learning Agent
  for Real-Time Strategy Games","The Second International Conference on AIML Systems, October 12--15,
  2022, Bangalore, India",,10.1145/3564121.3565236,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As Artificial and Robotic Systems are increasingly deployed and relied upon
for real-world applications, it is important that they exhibit the ability to
continually learn and adapt in dynamically-changing environments, becoming
Lifelong Learning Machines. Continual/lifelong learning (LL) involves
minimizing catastrophic forgetting of old tasks while maximizing a model's
capability to learn new tasks. This paper addresses the challenging lifelong
reinforcement learning (L2RL) setting. Pushing the state-of-the-art forward in
L2RL and making L2RL useful for practical applications requires more than
developing individual L2RL algorithms; it requires making progress at the
systems-level, especially research into the non-trivial problem of how to
integrate multiple L2RL algorithms into a common framework. In this paper, we
introduce the Lifelong Reinforcement Learning Components Framework (L2RLCF),
which standardizes L2RL systems and assimilates different continual learning
components (each addressing different aspects of the lifelong learning problem)
into a unified system. As an instantiation of L2RLCF, we develop a standard API
allowing easy integration of novel lifelong learning components. We describe a
case study that demonstrates how multiple independently-developed LL components
can be integrated into a single realized system. We also introduce an
evaluation environment in order to measure the effect of combining various
system components. Our evaluation environment employs different LL scenarios
(sequences of tasks) consisting of Starcraft-2 minigames and allows for the
fair, comprehensive, and quantitative comparison of different combinations of
components within a challenging common evaluation environment.
","[{'version': 'v1', 'created': 'Thu, 8 Dec 2022 23:32:57 GMT'}]",2022-12-12,"[['Sur', 'Indranil', ''], ['Daniels', 'Zachary', ''], ['Rahman', 'Abrar', ''], ['Faber', 'Kamil', ''], ['Gallardo', 'Gianmarco J.', ''], ['Hayes', 'Tyler L.', ''], ['Taylor', 'Cameron E.', ''], ['Gurbuz', 'Mustafa Burak', ''], ['Smith', 'James', ''], ['Joshi', 'Sahana', ''], ['Japkowicz', 'Nathalie', ''], ['Baron', 'Michael', ''], ['Kira', 'Zsolt', ''], ['Kanan', 'Christopher', ''], ['Corizzo', 'Roberto', ''], ['Divakaran', 'Ajay', ''], ['Piacentino', 'Michael', ''], ['Hostetler', 'Jesse', ''], ['Raghavan', 'Aswin', '']]","['Lifelong Learning', 'Reinforcement Learning', 'System Design', 'Integrative Component Framework', 'Starcraft-2']"
9214,2012.00249,Charles Martin,Charles Martin and Benjamin Forster and Hanna Cormick,"Cross-artform performance using networked interfaces: Last Man to Die's
  Vital LMTD",,"Proceedings of the International Conference on New Interfaces for
  Musical Expression (2010) pp. 204-207",10.5281/zenodo.1177843,,cs.HC cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  In 2009 the cross artform group, Last Man to Die, presented a series of
performances using new interfaces and networked performance to integrate the
three artforms of its members (actor, Hanna Cormick, visual artist, Benjamin
Forster and percussionist, Charles Martin). This paper explains our artistic
motivations and design for a computer vision surface and networked heartbeat
sensor as well as the experience of mounting our first major work, Vital LMTD.
","[{'version': 'v1', 'created': 'Tue, 1 Dec 2020 04:09:39 GMT'}]",2020-12-02,"[['Martin', 'Charles', ''], ['Forster', 'Benjamin', ''], ['Cormick', 'Hanna', '']]","['cross-artform performance', 'networked performance', 'physical computing']"
9215,2108.05025,Beibin Li,"Beibin Li, Nicholas Nuechterlein, Erin Barney, Claire Foster, Minah
  Kim, Monique Mahony, Adham Atyabi, Li Feng, Quan Wang, Pamela Ventola, Linda
  Shapiro, Frederick Shic",Learning Oculomotor Behaviors from Scanpath,Accepted ACM ICMI 2021,,10.1145/3462244.3479923,,cs.CV cs.HC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identifying oculomotor behaviors relevant for eye-tracking applications is a
critical but often challenging task. Aiming to automatically learn and extract
knowledge from existing eye-tracking data, we develop a novel method that
creates rich representations of oculomotor scanpaths to facilitate the learning
of downstream tasks. The proposed stimulus-agnostic Oculomotor Behavior
Framework (OBF) model learns human oculomotor behaviors from unsupervised and
semi-supervised tasks, including reconstruction, predictive coding, fixation
identification, and contrastive learning tasks. The resultant pre-trained OBF
model can be used in a variety of applications. Our pre-trained model
outperforms baseline approaches and traditional scanpath methods in autism
spectrum disorder and viewed-stimulus classification tasks. Ablation
experiments further show our proposed method could achieve even better results
with larger model sizes and more diverse eye-tracking training datasets,
supporting the model's potential for future eye-tracking applications. Open
source code: http://github.com/BeibinLi/OBF.
","[{'version': 'v1', 'created': 'Wed, 11 Aug 2021 04:38:17 GMT'}]",2021-08-12,"[['Li', 'Beibin', ''], ['Nuechterlein', 'Nicholas', ''], ['Barney', 'Erin', ''], ['Foster', 'Claire', ''], ['Kim', 'Minah', ''], ['Mahony', 'Monique', ''], ['Atyabi', 'Adham', ''], ['Feng', 'Li', ''], ['Wang', 'Quan', ''], ['Ventola', 'Pamela', ''], ['Shapiro', 'Linda', ''], ['Shic', 'Frederick', '']]","['eye-tracking', 'neural networks', 'deep learning', 'gaze detection', 'pretrain', 'unsupervised learning']"
9216,2204.04381,Jose Mari Ortega,"Jose Mari E. Ortega, Rolito G. Eballe",Harmonic Centralization of Some Graph Families,"21 pages, 5 figures. arXiv admin note: text overlap with
  arXiv:2111.12239","Advances and Applications in Discrete Mathematics, Volume 31,
  2022, Pages 13-33",10.17654/0974165822023,,cs.SI cs.DM,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Centrality describes the importance of nodes in a graph and is modeled by
various measures. Its global analogue, called centralization, is a general
formula for calculating a graph-level centrality score based on the node-level
centrality measure. The latter enables us to compare graphs based on the extent
to which the connections of a given network are concentrated on a single vertex
or group of vertices. One of the measures of centrality in social network
analysis is harmonic centrality. It sums the inverse of the geodesic distances
of each node to other nodes where it is 0 if there is no path from one node to
another, with the sum normalized by dividing it by $m-1$, where $m$ is the
number of nodes of the graph. In this paper, we present some results regarding
the harmonic centralization of some important families of graphs with the hope
that formulas generated herein will be of use when one determines the harmonic
centralization of more complex graphs.
","[{'version': 'v1', 'created': 'Sat, 9 Apr 2022 03:54:20 GMT'}, {'version': 'v2', 'created': 'Mon, 2 May 2022 11:36:24 GMT'}]",2022-05-03,"[['Ortega', 'Jose Mari E.', ''], ['Eballe', 'Rolito G.', '']]","['centrality', 'centralization', 'harmonic centralization', 'graph families']"
9217,2101.02003,Joshua Lau,Joshua Lau and Angus Ritossa,Algorithms and Hardness for Multidimensional Range Updates and Queries,"38 pages, 3 figures, 1 table. Full version of paper to appear in ITCS
  2021. Abstract abridged for arXiv limits",,10.4230/LIPIcs.ITCS.2021.37,,cs.DS cs.CC cs.CG,http://creativecommons.org/licenses/by/4.0/,"  Traditional orthogonal range problems allow queries over a static set of
points, each with some value. Dynamic variants allow points to be added or
removed, one at a time. To support more powerful updates, we introduce the Grid
Range class of data structure problems over integer arrays in one or more
dimensions. These problems allow range updates (such as filling all cells in a
range with a constant) and queries (such as finding the sum or maximum of
values in a range). In this work, we consider these operations along with
updates that replace each cell in a range with the minimum, maximum, or sum of
its existing value, and a constant. In one dimension, it is known that segment
trees can be leveraged to facilitate any $n$ of these operations in
$\tilde{O}(n)$ time overall. Other than a few specific cases, until now, higher
dimensional variants have been largely unexplored.
  We show that no truly subquadratic time algorithm can support certain pairs
of these updates simultaneously without falsifying several popular conjectures.
On the positive side, we show that truly subquadratic algorithms can be
obtained for variants induced by other subsets. We provide two approaches to
designing such algorithms that can be generalised to online and higher
dimensional settings. First, we give almost-tight $\tilde{O}(n^{3/2})$ time
algorithms for single-update variants where the update operation distributes
over the query operation. Second, for other variants, we provide a general
framework for reducing to instances with a special geometry. Using this, we
show that $O(m^{3/2-\epsilon})$ time algorithms for counting paths and walks of
length 2 and 3 between vertex pairs in sparse graphs imply truly subquadratic
data structures for certain variants; to this end, we give an
$\tilde{O}(m^{(4\omega-1)/(2\omega+1)}) = O(m^{1.478})$ time algorithm for
counting simple 3-paths between vertex pairs.
","[{'version': 'v1', 'created': 'Wed, 6 Jan 2021 13:18:02 GMT'}]",2021-01-07,"[['Lau', 'Joshua', ''], ['Ritossa', 'Angus', '']]","['Orthogonal range', 'Range updates', 'Online and Dynamic Data Structures', 'Fine-grained complexity', 'Cycle counting']"
9218,1905.12987,Felipe A. Louza,"Felipe A. Louza, Sabrina Mantaci, Giovanni Manzini, Marinella
  Sciortino, Guilherme P. Telles",Inducing the Lyndon Array,Accepted to SPIRE'19,,10.1007/978-3-030-32686-9_10,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a variant of the induced suffix sorting algorithm by
Nong (TOIS, 2013) that computes simultaneously the Lyndon array and the suffix
array of a text in $O(n)$ time using $\sigma + O(1)$ words of working space,
where $n$ is the length of the text and $\sigma$ is the alphabet size. Our
result improves the previous best space requirement for linear time computation
of the Lyndon array. In fact, all the known linear algorithms for Lyndon array
computation use suffix sorting as a preprocessing step and use $O(n)$ words of
working space in addition to the Lyndon array and suffix array. Experimental
results with real and synthetic datasets show that our algorithm is not only
space-efficient but also fast in practice.
","[{'version': 'v1', 'created': 'Thu, 30 May 2019 12:01:00 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Jul 2019 19:34:44 GMT'}]",2020-09-10,"[['Louza', 'Felipe A.', ''], ['Mantaci', 'Sabrina', ''], ['Manzini', 'Giovanni', ''], ['Sciortino', 'Marinella', ''], ['Telles', 'Guilherme P.', '']]","['Lyndon array', 'Suffix array', 'induced suffix sorting', 'lightweightalgorithms']"
9219,1909.11946,Palakorn Achananuparp,"Doyen Sahoo, Wang Hao, Shu Ke, Wu Xiongwei, Hung Le, Palakorn
  Achananuparp, Ee-Peng Lim, Steven C. H. Hoi",FoodAI: Food Image Recognition via Deep Learning for Smart Food Logging,"Published at KDD 2019 (Applied Data Science track). Demo is
  accessible at https://foodai.org/",,10.1145/3292500.3330734,,cs.CV cs.LG cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An important aspect of health monitoring is effective logging of food
consumption. This can help management of diet-related diseases like obesity,
diabetes, and even cardiovascular diseases. Moreover, food logging can help
fitness enthusiasts, and people who wanting to achieve a target weight.
However, food-logging is cumbersome, and requires not only taking additional
effort to note down the food item consumed regularly, but also sufficient
knowledge of the food item consumed (which is difficult due to the availability
of a wide variety of cuisines). With increasing reliance on smart devices, we
exploit the convenience offered through the use of smart phones and propose a
smart-food logging system: FoodAI, which offers state-of-the-art deep-learning
based image recognition capabilities. FoodAI has been developed in Singapore
and is particularly focused on food items commonly consumed in Singapore.
FoodAI models were trained on a corpus of 400,000 food images from 756
different classes. In this paper we present extensive analysis and insights
into the development of this system. FoodAI has been deployed as an API service
and is one of the components powering Healthy 365, a mobile app developed by
Singapore's Heath Promotion Board. We have over 100 registered organizations
(universities, companies, start-ups) subscribing to this service and actively
receive several API requests a day. FoodAI has made food logging convenient,
aiding smart consumption and a healthy lifestyle.
","[{'version': 'v1', 'created': 'Thu, 26 Sep 2019 07:15:46 GMT'}]",2020-10-28,"[['Sahoo', 'Doyen', ''], ['Hao', 'Wang', ''], ['Ke', 'Shu', ''], ['Xiongwei', 'Wu', ''], ['Le', 'Hung', ''], ['Achananuparp', 'Palakorn', ''], ['Lim', 'Ee-Peng', ''], ['Hoi', 'Steven C. H.', '']]","['Food Computing', 'Image Recognition', 'Smart Food Logging']"
9220,2011.05933,Fabio Saracco,"Giacomo Aletti, Irene Crimaldi, Fabio Saracco",A model for the Twitter sentiment curve,"19 pages, 12 figures",PLoS ONE 16(4): e0249634 (2021),10.1371/journal.pone.0249634,,cs.SI physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  Twitter is among the most used online platforms for the political
communications, due to the concision of its messages (which is particularly
suitable for political slogans) and the quick diffusion of messages. Especially
when the argument stimulate the emotionality of users, the content on Twitter
is shared with extreme speed and thus studying the tweet sentiment if of utmost
importance to predict the evolution of the discussions and the register of the
relative narratives. In this article, we present a model able to reproduce the
dynamics of the sentiments of tweets related to specific topics and periods and
to provide a prediction of the sentiment of the future posts based on the
observed past. The model is a recent variant of the P\'olya urn, introduced and
studied in arXiv:1906.10951 and arXiv:2010.06373, which is characterized by a
""local"" reinforcement, i.e. a reinforcement mechanism mainly based on the most
recent observations, and by a random persistent fluctuation of the predictive
mean. In particular, this latter feature is capable of capturing the trend
fluctuations in the sentiment curve. While the proposed model is extremely
general and may be also employed in other contexts, it has been tested on
several Twitter data sets and demonstrated greater performances compared to the
standard P\'olya urn model. Moreover, the different performances on different
data sets highlight different emotional sensitivities respect to a public
event.
","[{'version': 'v1', 'created': 'Wed, 11 Nov 2020 17:45:50 GMT'}]",2021-06-08,"[['Aletti', 'Giacomo', ''], ['Crimaldi', 'Irene', ''], ['Saracco', 'Fabio', '']]","['P´olya urn', 'reinforcement learning', 'sentiment analysis', 'urn model', 'Twitter']"
9221,1805.03947,Marco Ponza,"Paolo Cifariello, Paolo Ferragina, Marco Ponza","WISER: A Semantic Approach for Expert Finding in Academia based on
  Entity Linking",,"Information Systems, Elsevier (2019)",10.1016/j.is.2018.12.003,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present WISER, a new semantic search engine for expert finding in
academia. Our system is unsupervised and it jointly combines classical language
modeling techniques, based on text evidences, with the Wikipedia Knowledge
Graph, via entity linking.
  WISER indexes each academic author through a novel profiling technique which
models her expertise with a small, labeled and weighted graph drawn from
Wikipedia. Nodes in this graph are the Wikipedia entities mentioned in the
author's publications, whereas the weighted edges express the semantic
relatedness among these entities computed via textual and graph-based
relatedness functions. Every node is also labeled with a relevance score which
models the pertinence of the corresponding entity to author's expertise, and is
computed by means of a proper random-walk calculation over that graph; and with
a latent vector representation which is learned via entity and other kinds of
structural embeddings derived from Wikipedia.
  At query time, experts are retrieved by combining classic document-centric
approaches, which exploit the occurrences of query terms in the author's
documents, with a novel set of profile-centric scoring strategies, which
compute the semantic relatedness between the author's expertise and the query
topic via the above graph-based profiles.
  The effectiveness of our system is established over a large-scale
experimental test on a standard dataset for this task. We show that WISER
achieves better performance than all the other competitors, thus proving the
effectiveness of modelling author's profile via our ""semantic"" graph of
entities. Finally, we comment on the use of WISER for indexing and profiling
the whole research community within the University of Pisa, and its application
to technology transfer in our University.
","[{'version': 'v1', 'created': 'Thu, 10 May 2018 13:00:02 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Jun 2019 08:56:07 GMT'}]",2019-06-11,"[['Cifariello', 'Paolo', ''], ['Ferragina', 'Paolo', ''], ['Ponza', 'Marco', '']]","['expert finding', 'expert profiling', 'expertise retrieval', 'entity linking', 'information retrieval', 'wikipedia']"
9222,2104.13793,Matthias Lanzinger,"Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler",Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth,,,10.1145/1122445.1122456,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern trends in data collection are bringing current mainstream techniques
for database query processing to their limits. Consequently, various novel
approaches for efficient query processing are being actively studied. One such
approach is based on hypertree decompositions (HDs), which have been shown to
carry great potential to process complex queries more efficiently and with
stronger theoretical guarantees. However, using HDs for query execution relies
on the difficult task of computing decompositions of the query structure, which
guides the efficient execution of the query. From theoretical results we know
that the performance of purely sequential methods is inherently limited, yet
the problem is susceptible to parallelisation.
  In this paper we propose the first algorithm for computing hypertree
decompositions that is well-suited for parallelisation. The proposed algorithm
log-k-decomp requires only a logarithmic number of recursion levels and
additionally allows for highly parallelised pruning of the search space by
restriction to balanced separators. We provide detailed experimental evaluation
over the HyperBench benchmark and demonstrate that our approach is highly
effective especially for complex queries.
","[{'version': 'v1', 'created': 'Wed, 28 Apr 2021 14:33:05 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Apr 2022 13:11:42 GMT'}]",2022-04-13,"[['Gottlob', 'Georg', ''], ['Lanzinger', 'Matthias', ''], ['Okulmus', 'Cem', ''], ['Pichler', 'Reinhard', '']]","['hypergraph decomposition', 'hypertree width', 'parallel algorithms']"
9223,1905.11060,Jose M. Barcelo-Ordinas,"Jose M. Barcelo-Ordinas, Messaud Doudou, Jorge Garcia-Vidal, Nadjib
  Badache","Self-Calibration Methods for Uncontrolled Environments in Sensor
  Networks: A Reference Survey",,"Ad Hoc Networks, Volume 88, 15 May 2019, Pages 142-159",10.1016/j.adhoc.2019.01.008,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Growing progress in sensor technology has constantly expanded the number and
range of low-cost, small, and portable sensors on the market, increasing the
number and type of physical phenomena that can be measured with wirelessly
connected sensors. Large-scale deployments of wireless sensor networks (WSN)
involving hundreds or thousands of devices and limited budgets often constrain
the choice of sensing hardware, which generally has reduced accuracy,
precision, and reliability. Therefore, it is challenging to achieve good data
quality and maintain error-free measurements during the whole system lifetime.
Self-calibration or recalibration in ad hoc sensor networks to preserve data
quality is essential, yet challenging, for several reasons, such as the
existence of random noise and the absence of suitable general models.
Calibration performed in the field, without accurate and controlled
instrumentation, is said to be in an uncontrolled environment. This paper
provides current and fundamental self-calibration approaches and models for
wireless sensor networks in uncontrolled environments.
","[{'version': 'v1', 'created': 'Mon, 27 May 2019 09:10:00 GMT'}]",2019-05-28,"[['Barcelo-Ordinas', 'Jose M.', ''], ['Doudou', 'Messaud', ''], ['Garcia-Vidal', 'Jorge', ''], ['Badache', 'Nadjib', '']]","['Wireless Sensor Networks (WSN)', 'Calibration', 'Low-cost sensors', 'Uncontrolled environments', 'Quality of Information(QoI)']"
9224,2203.13247,\'Etienne Andr\'e,"\'Etienne Andr\'e, Masaki Waga, Natsuki Urabe and Ichiro Hasuo","Exemplifying parametric timed specifications over signals with bounded
  behavior","This is the author (and extended) version of the manuscript of the
  same name published in the proceedings of the 14th NASA Formal Methods
  Symposium (NFM 2022). This work is partially supported by ERATO HASUO
  Metamathematics for Systems Design Project (No. JPMJER1603), JST and by the
  ANR-NRF French-Singaporean research program ProMiS (ANR-19-CE25-0015)","Proceedings of the 14th NASA Formal Methods Symposium (NFM 2022),
  LNCS 13260, 2022",10.1007/978-3-031-06773-0_25,,cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Specifying properties can be challenging work. In this paper, we propose an
automated approach to exemplify properties given in the form of automata
extended with timing constraints and timing parameters, and that can also
encode constraints over real-valued signals. That is, given such a
specification and given an admissible automaton for each signal, we output
concrete runs exemplifying real (or impossible) runs for this specification.
Specifically, our method takes as input a specification, and a set of
admissible behaviors, all given as a subclass of rectangular hybrid automata,
namely timed automata extended with arbitrary clock rates, signal constraints,
and timing parameters. Our method then generates concrete runs exemplifying the
specification.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2022 17:55:58 GMT'}]",2022-06-08,"[['André', 'Étienne', ''], ['Waga', 'Masaki', ''], ['Urabe', 'Natsuki', ''], ['Hasuo', 'Ichiro', '']]","['specification', 'timed automata', 'hybrid automata', 'signals']"
9225,2007.03841,Kashif Inayat,"S.M. Usman Hashmi, Muntazir Hussain, S.M. Nashit Arshad, Kashif Inayat
  and Seong Oun Hwang","Energy Efficient Cross Layer Time Synchronization in Cognitive Radio
  Networks","International Journal of Internet Technology and Secured
  Transactions, 2020",,10.1504/IJITST.2020.10033617,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  Time synchronization is a vital concern for any Cognitive Radio Network (CRN)
to perform dynamic spectrum management. Each Cognitive Radio (CR) node has to
be environment aware and self adaptive and must have the ability to switch
between multiple modulation schemes and frequencies. Achieving same notion of
time within these CR nodes is essential to fulfill the requirements for
simultaneous quiet periods for spectrum sensing. Current application layer time
synchronization protocols require multiple timestamp exchanges to estimate skew
between the clocks of CRN nodes. The proposed symbol timing recovery method
already estimates the skew of hardware clock at the physical layer and use it
for skew correction of application layer clock of each node. The heart of
application layer clock is the hardware clock and hence application layer clock
skew will be same as of physical layer and can be corrected from symbol timing
recovery process. So one timestamp is enough to synchronize two CRN nodes. This
conserves the energy utilized by application layer protocol and makes a CRN
energy efficient and can achieve time synchronization in short span.
","[{'version': 'v1', 'created': 'Wed, 8 Jul 2020 01:28:06 GMT'}]",2021-02-01,"[['Hashmi', 'S. M. Usman', ''], ['Hussain', 'Muntazir', ''], ['Arshad', 'S. M. Nashit', ''], ['Inayat', 'Kashif', ''], ['Hwang', 'Seong Oun', '']]","['time synchronization', 'cognitive radio', 'clock correction', 'symboltiming recovery']"
9226,2203.05109,Yalong Yang,"Yalong Yang, Wenyu Xia, Fritz Lekschas, Carolina Nobre, Robert
  Krueger, Hanspeter Pfister","The Pattern is in the Details: An Evaluation of Interaction Techniques
  for Locating, Searching, and Contextualizing Details in Multivariate Matrix
  Visualizations","To appear in the ACM CHI Conference on Human Factors in Computing
  Systems (CHI 2022)",,10.1145/3491102.3517673,,cs.HC cs.GR,http://creativecommons.org/licenses/by/4.0/,"  Matrix visualizations are widely used to display large-scale network,
tabular, set, or sequential data. They typically only encode a single value per
cell, e.g., through color. However, this can greatly limit the visualizations'
utility when exploring multivariate data, where each cell represents a data
point with multiple values (referred to as details). Three well-established
interaction approaches can be applicable in multivariate matrix visualizations
(or MMV): focus+context, pan&zoom, and overview+detail. However, there is
little empirical knowledge of how these approaches compare in exploring MMV. We
report on two studies comparing them for locating, searching, and
contextualizing details in MMV. We first compared four focus+context techniques
and found that the fisheye lens overall outperformed the others. We then
compared the fisheye lens, to pan&zoom and overview+detail. We found that
pan&zoom was faster in locating and searching details, and as good as
overview+detail in contextualizing details.
","[{'version': 'v1', 'created': 'Thu, 10 Mar 2022 01:54:44 GMT'}]",2022-03-11,"[['Yang', 'Yalong', ''], ['Xia', 'Wenyu', ''], ['Lekschas', 'Fritz', ''], ['Nobre', 'Carolina', ''], ['Krueger', 'Robert', ''], ['Pfister', 'Hanspeter', '']]","['Multi-level navigation', 'multivariate', 'matrix', 'focus+context', 'overview+detail', 'pan&zoom']"
9227,2106.07287,I\~nigo Martinez,"I\~nigo Martinez, Elisabeth Viles, Igor G. Olaizola",Data Science Methodologies: Current Challenges and Future Approaches,"23 pages, 23 figures, 5 tables","Big Data Research, Vol. 24, January 2021",10.1016/j.bdr.2020.100183,,cs.LG cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data science has employed great research efforts in developing advanced
analytics, improving data models and cultivating new algorithms. However, not
many authors have come across the organizational and socio-technical challenges
that arise when executing a data science project: lack of vision and clear
objectives, a biased emphasis on technical issues, a low level of maturity for
ad-hoc projects and the ambiguity of roles in data science are among these
challenges. Few methodologies have been proposed on the literature that tackle
these type of challenges, some of them date back to the mid-1990, and
consequently they are not updated to the current paradigm and the latest
developments in big data and machine learning technologies. In addition, fewer
methodologies offer a complete guideline across team, project and data &
information management. In this article we would like to explore the necessity
of developing a more holistic approach for carrying out data science projects.
We first review methodologies that have been presented on the literature to
work on data science projects and classify them according to the their focus:
project, team, data and information management. Finally, we propose a
conceptual framework containing general characteristics that a methodology for
managing data science projects with a holistic point of view should have. This
framework can be used by other researchers as a roadmap for the design of new
data science methodologies or the updating of existing ones.
","[{'version': 'v1', 'created': 'Mon, 14 Jun 2021 10:34:50 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Jan 2022 11:48:38 GMT'}]",2022-01-17,"[['Martinez', 'Iñigo', ''], ['Viles', 'Elisabeth', ''], ['Olaizola', 'Igor G.', '']]","['data science', 'machine learning', 'big data', 'data science methodology', 'project life-cycle', 'organizational impacts', 'knowledge management', 'computing milieux']"
9228,2111.12276,Shota Orihashi,"Shota Orihashi, Yoshihiro Yamazaki, Naoki Makishima, Mana Ihori,
  Akihiko Takashima, Tomohiro Tanaka, Ryo Masumura","Utilizing Resource-Rich Language Datasets for End-to-End Scene Text
  Recognition in Resource-Poor Languages",Accept as short paper at ACM MMAsia 2021,,10.1145/3469877.3490571,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel training method for end-to-end scene text
recognition. End-to-end scene text recognition offers high recognition
accuracy, especially when using the encoder-decoder model based on Transformer.
To train a highly accurate end-to-end model, we need to prepare a large
image-to-text paired dataset for the target language. However, it is difficult
to collect this data, especially for resource-poor languages. To overcome this
difficulty, our proposed method utilizes well-prepared large datasets in
resource-rich languages such as English, to train the resource-poor
encoder-decoder model. Our key idea is to build a model in which the encoder
reflects knowledge of multiple languages while the decoder specializes in
knowledge of just the resource-poor language. To this end, the proposed method
pre-trains the encoder by using a multilingual dataset that combines the
resource-poor language's dataset and the resource-rich language's dataset to
learn language-invariant knowledge for scene text recognition. The proposed
method also pre-trains the decoder by using the resource-poor language's
dataset to make the decoder better suited to the resource-poor language.
Experiments on Japanese scene text recognition using a small, publicly
available dataset demonstrate the effectiveness of the proposed method.
","[{'version': 'v1', 'created': 'Wed, 24 Nov 2021 05:28:46 GMT'}]",2021-11-25,"[['Orihashi', 'Shota', ''], ['Yamazaki', 'Yoshihiro', ''], ['Makishima', 'Naoki', ''], ['Ihori', 'Mana', ''], ['Takashima', 'Akihiko', ''], ['Tanaka', 'Tomohiro', ''], ['Masumura', 'Ryo', '']]","['scene text recognition', 'pre-training', 'Transformer', 'resource-poorlanguage']"
9229,2209.15238,Faizan Ahemad,Faizan Ahemad,"Efficient Graph based Recommender System with Weighted Averaging of
  Messages","Accepted to The Second International Conference on AI-ML Systems
  (AIMLSystems, October 12-15, 2022)",,10.1145/3564121.3564127,,cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We showcase a novel solution to a recommendation system problem where we face
a perpetual soft item cold start issue. Our system aims to recommend demanded
products to prospective sellers for listing in Amazon stores. These products
always have only few interactions thereby giving rise to a perpetual soft item
cold start situation. Modern collaborative filtering methods solve cold start
using content attributes and exploit the existing implicit signals from warm
start items. This approach fails in our use-case since our entire item set
faces cold start issue always. Our Product Graph has over 500 Million nodes and
over 5 Billion edges which makes training and inference using modern graph
algorithms very compute intensive. To overcome these challenges we propose a
system which reduces the dataset size and employs an improved modelling
technique to reduce storage and compute without loss in performance.
Particularly, we reduce our graph size using a filtering technique and then
exploit this reduced product graph using Weighted Averaging of Messages over
Layers (WAML) algorithm. WAML simplifies training on large graphs and improves
over previous methods by reducing compute time to 1/7 of LightGCN and 1/26 of
Graph Attention Network (GAT) and increasing recall$@100$ by 66% over LightGCN
and 2.3x over GAT.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2022 05:10:34 GMT'}]",2022-10-03,"[['Ahemad', 'Faizan', '']]","['graph neural networks', 'recommendation system', 'compute efficiency', 'data efficiency', 'personalization']"
9230,2204.06787,Feijie Wu,"Feijie Wu, Shiqi He, Song Guo, Zhihao Qu, Haozhao Wang, Weihua Zhuang,
  Jie Zhang","Sign Bit is Enough: A Learning Synchronization Framework for Multi-hop
  All-reduce with Ultimate Compression",Accepted by DAC 2022,,10.1145/3489517.3530417,,cs.LG cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Traditional one-bit compressed stochastic gradient descent can not be
directly employed in multi-hop all-reduce, a widely adopted distributed
training paradigm in network-intensive high-performance computing systems such
as public clouds. According to our theoretical findings, due to the cascading
compression, the training process has considerable deterioration on the
convergence performance. To overcome this limitation, we implement a sign-bit
compression-based learning synchronization framework, Marsit. It prevents
cascading compression via an elaborate bit-wise operation for unbiased sign
aggregation and its specific global compensation mechanism for mitigating
compression deviation. The proposed framework retains the same theoretical
convergence rate as non-compression mechanisms. Experimental results
demonstrate that Marsit reduces up to 35% training time while preserving the
same accuracy as training without compression.
","[{'version': 'v1', 'created': 'Thu, 14 Apr 2022 06:54:32 GMT'}]",2022-10-14,"[['Wu', 'Feijie', ''], ['He', 'Shiqi', ''], ['Guo', 'Song', ''], ['Qu', 'Zhihao', ''], ['Wang', 'Haozhao', ''], ['Zhuang', 'Weihua', ''], ['Zhang', 'Jie', '']]","['Distributed Machine Learning', 'Multi-hop All-reduce', 'signSGD']"
9231,2205.15913,Manh Duong Phung,Van Truong Hoang and Manh Duong Phung,"Enhanced Teaching-Learning-based Optimization for 3D Path Planning of
  Multicopter UAVs","Proceedings of the International Conference on Advanced Mechanical
  Engineering, Automation, and Sustainable Development 2021 (AMAS2021)","Lecture Notes in Mechanical Engineering, 2022",10.1007/978-3-030-99666-6_107,,cs.RO cs.AI,http://creativecommons.org/licenses/by/4.0/,"  This paper introduces a new path planning algorithm for unmanned aerial
vehicles (UAVs) based on the teaching-learning-based optimization (TLBO)
technique. We first define an objective function that incorporates requirements
on the path length and constraints on the movement and safe operation of UAVs
to convert the path planning into an optimization problem. The optimization
algorithm named Multi-subject TLBO is then proposed to minimize the formulated
objective function. The algorithm is developed based on TLBO but enhanced with
new operations including mutation, elite selection and multi-subject training
to improve the solution quality and speed up the convergence rate. Comparison
with state-of-the-art algorithms and experiments with real UAVs have been
conducted to evaluate the performance of the proposed algorithm. The results
confirm its validity and effectiveness in generating optimal, collision-free
and flyable paths for UAVs in complex operating environments.
","[{'version': 'v1', 'created': 'Tue, 31 May 2022 16:00:32 GMT'}]",2022-06-01,"[['Hoang', 'Van Truong', ''], ['Phung', 'Manh Duong', '']]","['Multicopter', 'UAV', 'teaching-learning-based optimization', 'path planning', 'infrastructure inspection']"
9232,1802.03274,Neil Clancy,"Timur Kuzhagaliyev, Neil T. Clancy, Mirek Janatka, Kevin Tchaka,
  Francisco Vasconcelos, Matthew J. Clarkson, Kurinchi Gurusamy, David J.
  Hawkes, Brian Davidson, Danail Stoyanov","Augmented Reality needle ablation guidance tool for Irreversible
  Electroporation in the pancreas","6 pages, 5 figures. Proc. SPIE 10576 (2018) Copyright 2018 Society of
  Photo Optical Instrumentation Engineers (SPIE). One print or electronic copy
  may be made for personal use only. Systematic reproduction and distribution,
  duplication of any material in this publication for a fee or for commercial
  purposes, or modification of the contents of the publication are prohibited",,10.1117/12.2293671,,cs.CV physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Irreversible electroporation (IRE) is a soft tissue ablation technique
suitable for treatment of inoperable tumours in the pancreas. The process
involves applying a high voltage electric field to the tissue containing the
mass using needle electrodes, leaving cancerous cells irreversibly damaged and
vulnerable to apoptosis. Efficacy of the treatment depends heavily on the
accuracy of needle placement and requires a high degree of skill from the
operator. In this paper, we describe an Augmented Reality (AR) system designed
to overcome the challenges associated with planning and guiding the needle
insertion process. Our solution, based on the HoloLens (Microsoft, USA)
platform, tracks the position of the headset, needle electrodes and ultrasound
(US) probe in space. The proof of concept implementation of the system uses
this tracking data to render real-time holographic guides on the HoloLens,
giving the user insight into the current progress of needle insertion and an
indication of the target needle trajectory. The operator's field of view is
augmented using visual guides and real-time US feed rendered on a holographic
plane, eliminating the need to consult external monitors. Based on these early
prototypes, we are aiming to develop a system that will lower the skill level
required for IRE while increasing overall accuracy of needle insertion and,
hence, the likelihood of successful treatment.
","[{'version': 'v1', 'created': 'Fri, 9 Feb 2018 14:25:56 GMT'}]",2018-03-20,"[['Kuzhagaliyev', 'Timur', ''], ['Clancy', 'Neil T.', ''], ['Janatka', 'Mirek', ''], ['Tchaka', 'Kevin', ''], ['Vasconcelos', 'Francisco', ''], ['Clarkson', 'Matthew J.', ''], ['Gurusamy', 'Kurinchi', ''], ['Hawkes', 'David J.', ''], ['Davidson', 'Brian', ''], ['Stoyanov', 'Danail', '']]","['Irreversible Electroporation', 'Ablation', 'Needle guidance', 'Augmented Reality', 'Microsoft HoloLens']"
9233,2008.12336,Amro Alabsi Aljundi,"Taha Atahan Akyildiz, Amro Alabsi Aljundi, Kamer Kaya",GOSH: Embedding Big Graphs on Small Hardware,"11 pages, 4 figures, published in ICPP 2020: The 49th International
  Conference on Parallel Processing - Edmonton, AB, Canada",,10.1145/3404397.3404456,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In graph embedding, the connectivity information of a graph is used to
represent each vertex as a point in a d-dimensional space. Unlike the original,
irregular structural information, such a representation can be used for a
multitude of machine learning tasks. Although the process is extremely useful
in practice, it is indeed expensive and unfortunately, the graphs are becoming
larger and harder to embed. Attempts at scaling up the process to larger graphs
have been successful but often at a steep price in hardware requirements. We
present GOSH, an approach for embedding graphs of arbitrary sizes on a single
GPU with minimum constraints. GOSH utilizes a novel graph coarsening approach
to compress the graph and minimize the work required for embedding, delivering
high-quality embeddings at a fraction of the time compared to the
state-of-the-art. In addition to this, it incorporates a decomposition schema
that enables any arbitrarily large graph to be embedded using a single GPU with
minimum constraints on the memory size. With these techniques, GOSH is able to
embed a graph with over 65 million vertices and 1.8 billion edges in less than
an hour on a single GPU and obtains a 93% AUCROC for link-prediction which can
be increased to 95% by running the tool for 80 minutes.
","[{'version': 'v1', 'created': 'Thu, 27 Aug 2020 18:53:32 GMT'}, {'version': 'v2', 'created': 'Mon, 31 Aug 2020 09:38:24 GMT'}]",2020-09-01,"[['Akyildiz', 'Taha Atahan', ''], ['Aljundi', 'Amro Alabsi', ''], ['Kaya', 'Kamer', '']]","['Graph embedding', 'GPU', 'parallel graph algorithms', 'graph coarsening', 'link prediction']"
9234,2007.04671,Timothy Callemein,"Timothy Callemein, Kristof Van Beeck, Geert Br\^one, Toon Goedem\'e",Automated analysis of eye-tracker-based human-human interaction studies,,,10.1007/978-981-13-1056-0_50,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile eye-tracking systems have been available for about a decade now and
are becoming increasingly popular in different fields of application, including
marketing, sociology, usability studies and linguistics. While the
user-friendliness and ergonomics of the hardware are developing at a rapid
pace, the software for the analysis of mobile eye-tracking data in some points
still lacks robustness and functionality. With this paper, we investigate which
state-of-the-art computer vision algorithms may be used to automate the
post-analysis of mobile eye-tracking data. For the case study in this paper, we
focus on mobile eye-tracker recordings made during human-human face-to-face
interactions. We compared two recent publicly available frameworks (YOLOv2 and
OpenPose) to relate the gaze location generated by the eye-tracker to the head
and hands visible in the scene camera data. In this paper we will show that the
use of this single-pipeline framework provides robust results, which are both
more accurate and faster than previous work in the field. Moreover, our
approach does not rely on manual interventions during this process.
","[{'version': 'v1', 'created': 'Thu, 9 Jul 2020 10:00:03 GMT'}]",2020-07-10,"[['Callemein', 'Timothy', ''], ['Van Beeck', 'Kristof', ''], ['Brône', 'Geert', ''], ['Goedemé', 'Toon', '']]","['Post analysis', 'Human-Human-interaction studies', 'mobile eye-trackers']"
9235,2211.14430,Aaron Paul Dela Rosa,Aaron Paul M. Dela Rosa,"Effectiveness of an Online Course in Programming in a State University
  in the Philippines",,"International Journal of Computing Sciences Research (ISSN print:
  2546-0552; ISSN online: 2546-115X) Vol. 6, November 23, 2022",10.25147/ijcsr.2017.001.1.127,,cs.CY cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Online courses, as a pedagogical approach to teaching, boomed during this
Coronavirus Disease 2019 pandemic era. Universities shifted from traditional
face to face classes to online distance learning due to the cause of the
pandemic. This study aimed to determine how effective an online course is in
learning a programming course. The study utilized mixed method research applied
through a validated survey questionnaire consisting of closed and open ended
questions. Python programming was the course selected to undergo the study and
underwent an evaluation to determine the students' responses. Student
respondents are from Bulacan State University, a state university in the
Philippines, under the Bachelor of Science in Information Technology program.
Based on their responses, the students found that the online Python programming
was Very Effective, with an overall mean of 4.49. This result shows that
students found the online course effective, provided the proper course design
and content, allowed them to spend enough time finishing tasks, and provided
communication and interaction with their instructor and fellow students.
Additionally, students gave overwhelmingly positive responses when asked what
their instructors had done well on the course delivery and provided insightful
and constructive comments for further enhancement and delivery of the course.
This study found that most students strongly agreed and believed in the
effectiveness of delivering the Python Programming course asynchronously. With
such positive results from the student's perspective and evaluation, the course
can be enhanced to continue providing quality education at Bulacan State
University.
","[{'version': 'v1', 'created': 'Wed, 23 Nov 2022 06:51:02 GMT'}]",2022-11-29,"[['Rosa', 'Aaron Paul M. Dela', '']]","['programming', 'information technology', 'online course', 'Python programming', 'online learning   INTRODUCTION']"
9236,1902.03377,Guangcun Shan,"Weikuang Li, Tian Wang, Chuanyun Wang, Guangcun Shan, Mengyi Zhang and
  Hichem Snoussi",Region based Ensemble Learning Network for Fine-grained Classification,"6 pages, 3 figures, 2018 Chinese Automation Congress (CAC)",,10.1109/CAC.2018.8623687,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  As an important research topic in computer vision, fine-grained
classification which aims to recognition subordinate-level categories has
attracted significant attention. We propose a novel region based ensemble
learning network for fine-grained classification. Our approach contains a
detection module and a module for classification. The detection module is based
on the faster R-CNN framework to locate the semantic regions of the object. The
classification module using an ensemble learning method, which trains a set of
sub-classifiers for different semantic regions and combines them together to
get a stronger classifier. In the evaluation, we implement experiments on the
CUB-2011 dataset and the result of experiments proves our method s efficient
for fine-grained classification. We also extend our approach to remote scene
recognition and evaluate it on the NWPU-RESISC45 dataset.
","[{'version': 'v1', 'created': 'Sat, 9 Feb 2019 06:11:32 GMT'}]",2019-02-12,"[['Li', 'Weikuang', ''], ['Wang', 'Tian', ''], ['Wang', 'Chuanyun', ''], ['Shan', 'Guangcun', ''], ['Zhang', 'Mengyi', ''], ['Snoussi', 'Hichem', '']]","['Fine-grained classification', 'Ensemble learning', 'Region detection', 'Remote sensing  image  I']"
9237,2006.12379,\'Angel Gonz\'alez-Prieto,"Jes\'us Bobadilla, \'Angel Gonz\'alez-Prieto, Fernando Ortega, Ra\'ul
  Lara-Cabrera","Deep Learning feature selection to unhide demographic recommender
  systems factors","20 pages, 14 figures, 1 table","Neural Computing and Applications, 1-18, 2020",10.1007/s00521-020-05494-2,,cs.IR cs.CV cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Extracting demographic features from hidden factors is an innovative concept
that provides multiple and relevant applications. The matrix factorization
model generates factors which do not incorporate semantic knowledge. This paper
provides a deep learning-based method: DeepUnHide, able to extract demographic
information from the users and items factors in collaborative filtering
recommender systems. The core of the proposed method is the gradient-based
localization used in the image processing literature to highlight the
representative areas of each classification class. Validation experiments make
use of two public datasets and current baselines. Results show the superiority
of DeepUnHide to make feature selection and demographic classification,
compared to the state of art of feature selection methods. Relevant and direct
applications include recommendations explanation, fairness in collaborative
filtering and recommendation to groups of users.
","[{'version': 'v1', 'created': 'Wed, 17 Jun 2020 17:36:48 GMT'}]",2020-12-22,"[['Bobadilla', 'Jesús', ''], ['González-Prieto', 'Ángel', ''], ['Ortega', 'Fernando', ''], ['Lara-Cabrera', 'Raúl', '']]","['Feature selection', 'collaborative filtering', 'demographic information', 'matrixfactorization', 'gradient based localization', 'deep learning']"
9238,2006.11632,Jui-Ting Huang,"Jui-Ting Huang, Ashish Sharma, Shuying Sun, Li Xia, David Zhang,
  Philip Pronin, Janani Padmanabhan, Giuseppe Ottaviano, Linjun Yang",Embedding-based Retrieval in Facebook Search,"9 pages, 3 figures, 3 tables, to be published in KDD '20",,10.1145/3394486.3403305,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Search in social networks such as Facebook poses different challenges than in
classical web search: besides the query text, it is important to take into
account the searcher's context to provide relevant results. Their social graph
is an integral part of this context and is a unique aspect of Facebook search.
While embedding-based retrieval (EBR) has been applied in eb search engines for
years, Facebook search was still mainly based on a Boolean matching model. In
this paper, we discuss the techniques for applying EBR to a Facebook Search
system. We introduce the unified embedding framework developed to model
semantic embeddings for personalized search, and the system to serve
embedding-based retrieval in a typical search system based on an inverted
index. We discuss various tricks and experiences on end-to-end optimization of
the whole system, including ANN parameter tuning and full-stack optimization.
Finally, we present our progress on two selected advanced topics about
modeling. We evaluated EBR on verticals for Facebook Search with significant
metrics gains observed in online A/B experiments. We believe this paper will
provide useful insights and experiences to help people on developing
embedding-based retrieval systems in search engines.
","[{'version': 'v1', 'created': 'Sat, 20 Jun 2020 18:34:09 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jul 2020 20:30:39 GMT'}]",2020-07-31,"[['Huang', 'Jui-Ting', ''], ['Sharma', 'Ashish', ''], ['Sun', 'Shuying', ''], ['Xia', 'Li', ''], ['Zhang', 'David', ''], ['Pronin', 'Philip', ''], ['Padmanabhan', 'Janani', ''], ['Ottaviano', 'Giuseppe', ''], ['Yang', 'Linjun', '']]","['Embedding', 'deep learning', 'search', 'information retrieval']"
9239,2206.14483,C\'edric Rommel,"C\'edric Rommel, Joseph Paillard, Thomas Moreau, Alexandre Gramfort","Data augmentation for learning predictive models on EEG: a systematic
  comparison",Accepted in Journal of Neural Engineering,,10.1088/1741-2552/aca220,,cs.LG cs.AI eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Objective: The use of deep learning for electroencephalography (EEG)
classification tasks has been rapidly growing in the last years, yet its
application has been limited by the relatively small size of EEG datasets. Data
augmentation, which consists in artificially increasing the size of the dataset
during training, can be employed to alleviate this problem. While a few
augmentation transformations for EEG data have been proposed in the literature,
their positive impact on performance is often evaluated on a single dataset and
compared to one or two competing augmentation methods. This work proposes to
better validate the existing data augmentation approaches through a unified and
exhaustive analysis. Approach: We compare quantitatively 13 different
augmentations with two different predictive tasks, datasets and models, using
three different types of experiments. Main results: We demonstrate that
employing the adequate data augmentations can bring up to 45% accuracy
improvements in low data regimes compared to the same model trained without any
augmentation. Our experiments also show that there is no single best
augmentation strategy, as the good augmentations differ on each task.
Significance: Our results highlight the best data augmentations to consider for
sleep stage classification and motor imagery brain-computer interfaces. More
broadly, it demonstrates that EEG classification tasks benefit from adequate
data augmentation
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2022 09:18:15 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Nov 2022 10:43:08 GMT'}]",2022-11-16,"[['Rommel', 'Cédric', ''], ['Paillard', 'Joseph', ''], ['Moreau', 'Thomas', ''], ['Gramfort', 'Alexandre', '']]","['Data augmentation', 'sleep stage classification', 'brain-computer interfaceSubmitted to J. Neural Eng']"
9240,2201.02868,Ievgen Kabin,"Ievgen Kabin, Zoya Dyka, Dan Klann and Peter Langendoerfer",Horizontal Attacks against ECC: from Simulations to ASIC,"Author's version accepted for IOSEC 2019; the final publication is
  available at Springer via https://doi.org/10.1007/978-3-030-42051-2_5. arXiv
  admin note: text overlap with arXiv:2201.02866",,10.1007/978-3-030-42051-2_5,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this paper we analyse the impact of different compile options on the
success rate of side-channel analysis attacks. We run horizontal differential
side-channel attacks against simulated power traces for the same $kP$ design
synthesized using two different compile options after synthesis and after
layout. As we are interested in the effect on the produced ASIC we also run the
same attack against measured power traces after manufacturing the ASIC. We
found that the compile_ultra option reduces the success rate significantly from
5 key candidates with a correctness of between 75 and 90 per cent down to 3 key
candidates with a maximum success rate of 72 per cent compared to the simple
compile option. Also the success rate after layout shows a very high
correlation with the one obtained attacking the measured power and
electromagnetic traces, i.e. the simulations are a good indicator of the
resistance of the ASIC.
","[{'version': 'v1', 'created': 'Sat, 8 Jan 2022 17:47:23 GMT'}]",2022-01-11,"[['Kabin', 'Ievgen', ''], ['Dyka', 'Zoya', ''], ['Klann', 'Dan', ''], ['Langendoerfer', 'Peter', '']]","['Power Traces', 'Side Channel Analysis (SCA) Attacks', 'Horizontal Attacks', 'ECC', 'ASIC']"
9241,2106.15297,Jussi Karlgren,"Jussi Karlgren, Lennart E. Fahl\'en, Anders Wallberg, P\""ar Hansson,
  Olov St{\aa}hl, Jonas S\""oderberg, Karl-Petter {\AA}kesson","Socially Intelligent Interfaces for Increased Energy Awareness in the
  Home",,,10.1007/978-3-540-78731-0_17,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes how home appliances might be enhanced to improve user
awareness of energy usage. Households wish to lead comfortable and manageable
lives. Balancing this reasonable desire with the environmental and political
goal of reducing electricity usage is a challenge that we claim is best met
through the design of interfaces that allows users better control of their
usage and unobtrusively informs them of the actions of their peers. A set of
design principles along these lines is formulated in this paper. We have built
a fully functional prototype home appliance with a socially aware interface to
signal the aggregate usage of the users peer group according to these
principles, and present the prototype in the paper.
","[{'version': 'v1', 'created': 'Tue, 29 Jun 2021 12:19:21 GMT'}]",2021-06-30,"[['Karlgren', 'Jussi', ''], ['Fahlén', 'Lennart E.', ''], ['Wallberg', 'Anders', ''], ['Hansson', 'Pär', ''], ['Ståhl', 'Olov', ''], ['Söderberg', 'Jonas', ''], ['Åkesson', 'Karl-Petter', '']]","['smart homes', 'domestic energy usage', 'physical programming', 'connected artifacts', 'distributed applications', 'microlevel load-balancing']"
9242,2005.05836,Igor Sfiligoi,Igor Sfiligoi,Demonstrating 100 Gbps in and out of the public Clouds,"4 pages, 6 figures, 3 tables",,10.1145/3311790.3399612,,cs.PF cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  There is increased awareness and recognition that public Cloud providers do
provide capabilities not found elsewhere, with elasticity being a major driver.
The value of elastic scaling is however tightly coupled to the capabilities of
the networks that connect all involved resources, both in the public Clouds and
at the various research institutions. This paper presents results of
measurements involving file transfers inside public Cloud providers, fetching
data from on-prem resources into public Cloud instances and fetching data from
public Cloud storage into on-prem nodes. The networking of the three major
Cloud providers, namely Amazon Web Services, Microsoft Azure and the Google
Cloud Platform, has been benchmarked. The on-prem nodes were managed by either
the Pacific Research Platform or located at the University of Wisconsin -
Madison. The observed sustained throughput was of the order of 100 Gbps in all
the tests moving data in and out of the public Clouds and throughput reaching
into the Tbps range for data movements inside the public Cloud providers
themselves. All the tests used HTTP as the transfer protocol.
","[{'version': 'v1', 'created': 'Tue, 12 May 2020 14:56:05 GMT'}]",2020-07-28,"[['Sfiligoi', 'Igor', '']]","['Cloud', 'networking', 'benchmarking']"
9243,2004.06303,Rediet Abebe,"Rediet Abebe, Salvatore Giorgi, Anna Tedijanto, Anneke Buffone, H.
  Andrew Schwartz","Quantifying Community Characteristics of Maternal Mortality Using Social
  Media",In Proceedings of The Web Conference 2020(WWW '20),,10.1145/3366423.3380066,,cs.CL cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While most mortality rates have decreased in the US, maternal mortality has
increased and is among the highest of any OECD nation. Extensive public health
research is ongoing to better understand the characteristics of communities
with relatively high or low rates. In this work, we explore the role that
social media language can play in providing insights into such community
characteristics. Analyzing pregnancy-related tweets generated in US counties,
we reveal a diverse set of latent topics including Morning Sickness, Celebrity
Pregnancies, and Abortion Rights. We find that rates of mentioning these topics
on Twitter predicts maternal mortality rates with higher accuracy than standard
socioeconomic and risk variables such as income, race, and access to
health-care, holding even after reducing the analysis to six topics chosen for
their interpretability and connections to known risk factors. We then
investigate psychological dimensions of community language, finding the use of
less trustful, more stressed, and more negative affective language is
significantly associated with higher mortality rates, while trust and negative
affect also explain a significant portion of racial disparities in maternal
mortality. We discuss the potential for these insights to inform actionable
health interventions at the community-level.
","[{'version': 'v1', 'created': 'Tue, 14 Apr 2020 04:57:51 GMT'}]",2020-04-15,"[['Abebe', 'Rediet', ''], ['Giorgi', 'Salvatore', ''], ['Tedijanto', 'Anna', ''], ['Buffone', 'Anneke', ''], ['Schwartz', 'H. Andrew', '']]","['maternal mortality', 'health disparities', 'language', 'topic modeling', 'community characteristics']"
9244,2008.03020,Zeinab Rajabi,"Zeinab Rajabi, MohammadReza Valavi, Maryam Hourali","A Context-based Disambiguation Model for Sentiment Concepts Using a
  Bag-of-concepts Approach",This is a pre-print of an article published in Cogn Comput(2020),,10.1007/s12559-020-09729-1,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the widespread dissemination of user-generated content on different
social networks, and online consumer systems such as Amazon, the quantity of
opinionated information available on the Internet has been increased. One of
the main tasks of the sentiment analysis is to detect polarity within a text.
The existing polarity detection methods mainly focus on keywords and their
naive frequency counts; however, they less regard the meanings and implicit
dimensions of the natural concepts. Although background knowledge plays a
critical role in determining the polarity of concepts, it has been disregarded
in polarity detection methods. This study presents a context-based model to
solve ambiguous polarity concepts using commonsense knowledge. First, a model
is presented to generate a source of ambiguous sentiment concepts based on
SenticNet by computing the probability distribution. Then the model uses a
bag-of-concepts approach to remove ambiguities and semantic augmentation with
the ConceptNet handling to overcome lost knowledge. ConceptNet is a large-scale
semantic network with a large number of commonsense concepts. In this paper,
the point mutual information (PMI) measure is used to select the contextual
concepts having strong relationships with ambiguous concepts. The polarity of
the ambiguous concepts is precisely detected using positive/negative contextual
concepts and the relationship of the concepts in the semantic knowledge base.
The text representation scheme is semantically enriched using Numberbatch,
which is a word embedding model based on the concepts from the ConceptNet
semantic network. The proposed model is evaluated by applying a corpus of
product reviews, called Semeval. The experimental results revealed an accuracy
rate of 82.07%, representing the effectiveness of the proposed model.
","[{'version': 'v1', 'created': 'Fri, 7 Aug 2020 07:16:40 GMT'}]",2020-11-16,"[['Rajabi', 'Zeinab', ''], ['Valavi', 'MohammadReza', ''], ['Hourali', 'Maryam', '']]","['Sentiment analysis', 'Sentiment concept', 'Disambiguation', 'Commonsense knowledge', 'Bag-of-concepts', 'ConceptNet', 'Numberbatch', 'Word embedding']"
9245,2107.09600,Li Gao,"Li Gao, Jing Zhang, Lefei Zhang, Dacheng Tao","DSP: Dual Soft-Paste for Unsupervised Domain Adaptive Semantic
  Segmentation",,,10.1145/3474085.3475186,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Unsupervised domain adaptation (UDA) for semantic segmentation aims to adapt
a segmentation model trained on the labeled source domain to the unlabeled
target domain. Existing methods try to learn domain invariant features while
suffering from large domain gaps that make it difficult to correctly align
discrepant features, especially in the initial training phase. To address this
issue, we propose a novel Dual Soft-Paste (DSP) method in this paper.
Specifically, DSP selects some classes from a source domain image using a
long-tail class first sampling strategy and softly pastes the corresponding
image patch on both the source and target training images with a fusion weight.
Technically, we adopt the mean teacher framework for domain adaptation, where
the pasted source and target images go through the student network while the
original target image goes through the teacher network. Output-level alignment
is carried out by aligning the probability maps of the target fused image from
both networks using a weighted cross-entropy loss. In addition, feature-level
alignment is carried out by aligning the feature maps of the source and target
images from student network using a weighted maximum mean discrepancy loss. DSP
facilitates the model learning domain-invariant features from the intermediate
domains, leading to faster convergence and better performance. Experiments on
two challenging benchmarks demonstrate the superiority of DSP over
state-of-the-art methods. Code is available at
\url{https://github.com/GaoLii/DSP}.
","[{'version': 'v1', 'created': 'Tue, 20 Jul 2021 16:22:40 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Jul 2021 15:20:09 GMT'}, {'version': 'v3', 'created': 'Tue, 27 Jul 2021 15:41:13 GMT'}]",2021-07-28,"[['Gao', 'Li', ''], ['Zhang', 'Jing', ''], ['Zhang', 'Lefei', ''], ['Tao', 'Dacheng', '']]","['unsupervised learning', 'semantic segmentation', 'convolutional neural networks', 'domain adaptation']"
9246,1904.09448,Vinod Kumar Chauhan,"Vinod Kumar Chauhan, Anuj Sharma, Kalpana Dahiya",LIBS2ML: A Library for Scalable Second Order Machine Learning Algorithms,"5 page JMLR library format, 4 figures. Library available as open
  source for download at: https://github.com/jmdvinodjmd/LIBS2ML","Software Impacts, Volume 10, November 2021, 100123 (2021)",10.1016/j.simpa.2021.100123,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  LIBS2ML is a library based on scalable second order learning algorithms for
solving large-scale problems, i.e., big data problems in machine learning.
LIBS2ML has been developed using MEX files, i.e., C++ with MATLAB/Octave
interface to take the advantage of both the worlds, i.e., faster learning using
C++ and easy I/O using MATLAB. Most of the available libraries are either in
MATLAB/Python/R which are very slow and not suitable for large-scale learning,
or are in C/C++ which does not have easy ways to take input and display
results. So LIBS2ML is completely unique due to its focus on the scalable
second order methods, the hot research topic, and being based on MEX files.
Thus it provides researchers a comprehensive environment to evaluate their
ideas and it also provides machine learning practitioners an effective tool to
deal with the large-scale learning problems. LIBS2ML is an open-source, highly
efficient, extensible, scalable, readable, portable and easy to use library.
The library can be downloaded from the URL:
\url{https://github.com/jmdvinodjmd/LIBS2ML}.
","[{'version': 'v1', 'created': 'Sat, 20 Apr 2019 14:41:05 GMT'}]",2021-11-16,"[['Chauhan', 'Vinod Kumar', ''], ['Sharma', 'Anuj', ''], ['Dahiya', 'Kalpana', '']]","['stochastic optimization', 'second order methods', 'large-scale learning']"
9247,2107.14109,Omer Aydin,"Suleyman Yukcu, Omer Aydin",Digital Twin As A Cost Reduction Method,"Digital Twin, Cost Accounting, Cyber Physical Systems, Artificial
  Intelligence, Internet of Things, Sensor","Muhasebe Bilim Dunyas{\i} Dergisi , 22 (3) , 563-579",10.31460/mbdd.694571,,cs.OH econ.GN q-fin.EC q-fin.GN,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Many fields have been affected by the introduction of concepts such as
sensors, industry 4.0, internet of things, machine learning and artificial
intelligence in recent years. As a result of the interaction of cyber physical
systems with these concepts, digital twin model has emerged. The concept of
digital twin has been used in many areas with its emergence. The use of this
model has made significant gains, especially in decision making processes. The
gains in decision making processes contribute to every field and cause changes
in terms of cost. In this study, the historical development of the concept of
digital twin has been mentioned and general information about the usage areas
of digital twin has been given. In the light of this information, the cost
effect of the digital twin model, therefore its appearance from the cost
accounting window and its use as a cost reduction method were evaluated. This
study was carried out in order to shed light on the studies with the
insufficient resources in the Turkish literature and the cost accounting
perspective.
","[{'version': 'v1', 'created': 'Sat, 10 Jul 2021 22:01:34 GMT'}]",2021-07-30,"[['Yukcu', 'Suleyman', ''], ['Aydin', 'Omer', '']]","['Digital Twin', 'Cost Accounting', 'Cyber Physical Systems', 'Artificial Intelligence', 'Internet of']"
9248,2112.13555,Pengcheng An,"Pengcheng An, Ziqi Zhou, Qing Liu, Yifei Yin, Linghao Du, Da-Yuan
  Huang, Jian Zhao","VibEmoji: Exploring User-authoring Multi-modal Emoticons in Social
  Communication",To be published at ACM CHI '22,,10.1145/3491102.3501940,,cs.HC,http://creativecommons.org/licenses/by-sa/4.0/,"  Emoticons are indispensable in online communications. With users' growing
needs for more customized and expressive emoticons, recent messaging
applications begin to support (limited) multi-modal emoticons: e.g., enhancing
emoticons with animations or vibrotactile feedback. However, little empirical
knowledge has been accumulated concerning how people create, share and
experience multi-modal emoticons in everyday communication, and how to better
support them through design. To tackle this, we developed VibEmoji, a
user-authoring multi-modal emoticon interface for mobile messaging. Extending
existing designs, VibEmoji grants users greater flexibility to combine various
emoticons, vibrations, and animations on-the-fly, and offers non-aggressive
recommendations based on these components' emotional relevance. Using VibEmoji
as a probe, we conducted a four-week field study with 20 participants, to gain
new understandings from in-the-wild usage and experience, and extract
implications for design. We thereby contribute both a novel system and various
insights for supporting users' creation and communication of multi-modal
emoticons.
","[{'version': 'v1', 'created': 'Mon, 27 Dec 2021 07:50:02 GMT'}]",2021-12-28,"[['An', 'Pengcheng', ''], ['Zhou', 'Ziqi', ''], ['Liu', 'Qing', ''], ['Yin', 'Yifei', ''], ['Du', 'Linghao', ''], ['Huang', 'Da-Yuan', ''], ['Zhao', 'Jian', '']]","['Social communication', 'emotional expression', 'emoticons', 'hapticfeedback', 'animation', 'multi-modal interaction', 'mobile interfaces']"
9249,2108.04423,Balagopal Unnikrishnan Mr,"Balagopal Unnikrishnan, Cuong Nguyen, Shafa Balaram, Chao Li, Chuan
  Sheng Foo, Pavitra Krishnaswamy","Semi-supervised classification of radiology images with NoTeacher: A
  Teacher that is not Mean",Preprint submitted to Medical Image Analysis. Accepted in June 2021,,10.1016/j.media.2021.102148,,cs.CV cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Deep learning models achieve strong performance for radiology image
classification, but their practical application is bottlenecked by the need for
large labeled training datasets. Semi-supervised learning (SSL) approaches
leverage small labeled datasets alongside larger unlabeled datasets and offer
potential for reducing labeling cost. In this work, we introduce NoTeacher, a
novel consistency-based SSL framework which incorporates probabilistic
graphical models. Unlike Mean Teacher which maintains a teacher network updated
via a temporal ensemble, NoTeacher employs two independent networks, thereby
eliminating the need for a teacher network. We demonstrate how NoTeacher can be
customized to handle a range of challenges in radiology image classification.
Specifically, we describe adaptations for scenarios with 2D and 3D inputs, uni
and multi-label classification, and class distribution mismatch between labeled
and unlabeled portions of the training data. In realistic empirical evaluations
on three public benchmark datasets spanning the workhorse modalities of
radiology (X-Ray, CT, MRI), we show that NoTeacher achieves over 90-95% of the
fully supervised AUROC with less than 5-15% labeling budget. Further, NoTeacher
outperforms established SSL methods with minimal hyperparameter tuning, and has
implications as a principled and practical option for semisupervised learning
in radiology applications.
","[{'version': 'v1', 'created': 'Tue, 10 Aug 2021 03:08:35 GMT'}]",2021-08-11,"[['Unnikrishnan', 'Balagopal', ''], ['Nguyen', 'Cuong', ''], ['Balaram', 'Shafa', ''], ['Li', 'Chao', ''], ['Foo', 'Chuan Sheng', ''], ['Krishnaswamy', 'Pavitra', '']]","['Semi-supervised deep learning', 'Classification', 'Radiographs', 'MRI', 'Mean Teacher', 'Co-training']"
9250,1905.05835,Pablo Moriano,"Pablo Moriano, Raquel Hill, L. Jean Camp",Using Bursty Announcements for Detecting BGP Routing Anomalies,"16 pages, 13 figures, 4 table","Comput. Netw. vol. 188, pp. 107835, 2021",10.1016/j.comnet.2021.107835,,cs.NI stat.AP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the robust structure of the Internet, it is still susceptible to
disruptive routing updates that prevent network traffic from reaching its
destination. Our research shows that BGP announcements that are associated with
disruptive updates tend to occur in groups of relatively high frequency,
followed by periods of infrequent activity. We hypothesize that we may use
these bursty characteristics to detect anomalous routing incidents. In this
work, we use manually verified ground truth metadata and volume of
announcements as a baseline measure, and propose a burstiness measure that
detects prior anomalous incidents with high recall and better precision than
the volume baseline. We quantify the burstiness of inter-arrival times around
the date and times of four large-scale incidents: the Indosat hijacking event
in April 2014, the Telecom Malaysia leak in June 2015, the Bharti Airtel Ltd.
hijack in November 2015, and the MainOne leak in November 2018; and three
smaller scale incidents that led to traffic interception: the Belarusian
traffic direction in February 2013, the Icelandic traffic direction in July
2013, and the Russian telecom that hijacked financial services in April 2017.
Our method leverages the burstiness of disruptive update messages to detect
these incidents. We describe limitations, open challenges, and how this method
can be used for routing anomaly detection.
","[{'version': 'v1', 'created': 'Tue, 14 May 2019 20:44:11 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Jan 2021 22:30:59 GMT'}]",2021-02-02,"[['Moriano', 'Pablo', ''], ['Hill', 'Raquel', ''], ['Camp', 'L. Jean', '']]","['Border Gateway Protocol (BGP)', 'Internet measurements', 'prefix hijacking', 'time series analysis', 'anomaly detection', 'burstiness']"
9251,2206.07762,Ryan Nguyen,"Ryan Nguyen, Shubhendu Kumar Singh, Rahul Rai","Physics-Infused Fuzzy Generative Adversarial Network for Robust Failure
  Prognosis",,,10.1016/j.ymssp.2022.109611,,cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Prognostics aid in the longevity of fielded systems or products. Quantifying
the system's current health enable prognosis to enhance the operator's
decision-making to preserve the system's health. Creating a prognosis for a
system can be difficult due to (a) unknown physical relationships and/or (b)
irregularities in data appearing well beyond the initiation of a problem.
Traditionally, three different modeling paradigms have been used to develop a
prognostics model: physics-based (PbM), data-driven (DDM), and hybrid modeling.
Recently, the hybrid modeling approach that combines the strength of both PbM
and DDM based approaches and alleviates their limitations is gaining traction
in the prognostics domain. In this paper, a novel hybrid modeling approach for
prognostics applications based on combining concepts from fuzzy logic and
generative adversarial networks (GANs) is outlined. The FuzzyGAN based method
embeds a physics-based model in the aggregation of the fuzzy implications. This
technique constrains the output of the learning method to a realistic solution.
Results on a bearing problem showcases the efficacy of adding a physics-based
aggregation in a fuzzy logic model to improve GAN's ability to model health and
give a more accurate system prognosis.
","[{'version': 'v1', 'created': 'Wed, 15 Jun 2022 18:50:16 GMT'}]",2022-08-31,"[['Nguyen', 'Ryan', ''], ['Singh', 'Shubhendu Kumar', ''], ['Rai', 'Rahul', '']]","['GANs', 'Regression', 'Hybrid', 'Prognostics', 'Fuzzy', 'Physics']"
9252,2004.13282,William La Cava,William La Cava and Jason H. Moore,Genetic programming approaches to learning fair classifiers,"9 pages, 7 figures. GECCO 2020",,10.1145/3377930.3390157,,cs.NE cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Society has come to rely on algorithms like classifiers for important
decision making, giving rise to the need for ethical guarantees such as
fairness. Fairness is typically defined by asking that some statistic of a
classifier be approximately equal over protected groups within a population. In
this paper, current approaches to fairness are discussed and used to motivate
algorithmic proposals that incorporate fairness into genetic programming for
classification. We propose two ideas. The first is to incorporate a fairness
objective into multi-objective optimization. The second is to adapt lexicase
selection to define cases dynamically over intersections of protected groups.
We describe why lexicase selection is well suited to pressure models to perform
well across the potentially infinitely many subgroups over which fairness is
desired. We use a recent genetic programming approach to construct models on
four datasets for which fairness constraints are necessary, and empirically
compare performance to prior methods utilizing game-theoretic solutions.
Methods are assessed based on their ability to generate trade-offs of subgroup
fairness and accuracy that are Pareto optimal. The result show that genetic
programming methods in general, and random search in particular, are well
suited to this task.
","[{'version': 'v1', 'created': 'Tue, 28 Apr 2020 04:20:25 GMT'}]",2020-04-29,"[['La Cava', 'William', ''], ['Moore', 'Jason H.', '']]","['genetic programming', 'pareto optimization', 'fairness', 'classification']"
9253,2011.08740,Deeksha Arya,"Deeksha Arya (1, 2), Hiroya Maeda (2), Sanjay Kumar Ghosh (1), Durga
  Toshniwal (1), Hiroshi Omata (2), Takehiro Kashiyama (2) and Yoshihide
  Sekimoto (2) ((1) Indian Institute of Technology Roorkee, India, (2) The
  University of Tokyo, Japan)",Global Road Damage Detection: State-of-the-art Solutions,"11 Pages, 2 Figures, 3 Tables",,10.1109/BigData50022.2020.9377790,,cs.CV cs.CY,http://creativecommons.org/licenses/by-sa/4.0/,"  This paper summarizes the Global Road Damage Detection Challenge (GRDDC), a
Big Data Cup organized as a part of the IEEE International Conference on Big
Data'2020. The Big Data Cup challenges involve a released dataset and a
well-defined problem with clear evaluation metrics. The challenges run on a
data competition platform that maintains a leaderboard for the participants. In
the presented case, the data constitute 26336 road images collected from India,
Japan, and the Czech Republic to propose methods for automatically detecting
road damages in these countries. In total, 121 teams from several countries
registered for this competition. The submitted solutions were evaluated using
two datasets test1 and test2, comprising 2,631 and 2,664 images. This paper
encapsulates the top 12 solutions proposed by these teams. The best performing
model utilizes YOLO-based ensemble learning to yield an F1 score of 0.67 on
test1 and 0.66 on test2. The paper concludes with a review of the facets that
worked well for the presented challenge and those that could be improved in
future challenges.
","[{'version': 'v1', 'created': 'Tue, 17 Nov 2020 16:19:02 GMT'}]",2021-03-24,"[['Arya', 'Deeksha', ''], ['Maeda', 'Hiroya', ''], ['Ghosh', 'Sanjay Kumar', ''], ['Toshniwal', 'Durga', ''], ['Omata', 'Hiroshi', ''], ['Kashiyama', 'Takehiro', ''], ['Sekimoto', 'Yoshihide', '']]","['Object Detection', 'Classification', 'Road Maintenance', 'Intelligent Transport', 'Big Data', 'Deep Learning', 'Database']"
9254,2208.01211,Zhongyi Zhou,Zhongyi Zhou and Koji Yatani,"Gesture-aware Interactive Machine Teaching with In-situ Object
  Annotations",UIST 2022,,10.1145/3526113.3545648,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interactive Machine Teaching (IMT) systems allow non-experts to easily create
Machine Learning (ML) models. However, existing vision-based IMT systems either
ignore annotations on the objects of interest or require users to annotate in a
post-hoc manner. Without the annotations on objects, the model may misinterpret
the objects using unrelated features. Post-hoc annotations cause additional
workload, which diminishes the usability of the overall model building process.
In this paper, we develop LookHere, which integrates in-situ object annotations
into vision-based IMT. LookHere exploits users' deictic gestures to segment the
objects of interest in real time. This segmentation information can be
additionally used for training. To achieve the reliable performance of this
object segmentation, we utilize our custom dataset called HuTics, including
2040 front-facing images of deictic gestures toward various objects by 170
people. The quantitative results of our user study showed that participants
were 16.3 times faster in creating a model with our system compared to a
standard IMT system with a post-hoc annotation process while demonstrating
comparable accuracies. Additionally, models created by our system showed a
significant accuracy improvement ($\Delta mIoU=0.466$) in segmenting the
objects of interest compared to those without annotations.
","[{'version': 'v1', 'created': 'Tue, 2 Aug 2022 02:23:35 GMT'}]",2022-11-08,"[['Zhou', 'Zhongyi', ''], ['Yatani', 'Koji', '']]","['Interactive machine teaching', 'deictic gestures', 'in-situ annotation', 'dataset']"
9255,2005.08572,Florentin Putz,"Florentin Putz, Flor \'Alvarez, Jiska Classen","Acoustic Integrity Codes: Secure Device Pairing Using Short-Range
  Acoustic Communication","11 pages, 11 figures. Published at ACM WiSec 2020 (13th ACM
  Conference on Security and Privacy in Wireless and Mobile Networks). Updated
  references",,10.1145/3395351.3399420,,cs.CR cs.NI cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Secure Device Pairing (SDP) relies on an out-of-band channel to authenticate
devices. This requires a common hardware interface, which limits the use of
existing SDP systems. We propose to use short-range acoustic communication for
the initial pairing. Audio hardware is commonly available on existing
off-the-shelf devices and can be accessed from user space without requiring
firmware or hardware modifications. We improve upon previous approaches by
designing Acoustic Integrity Codes (AICs): a modulation scheme that provides
message authentication on the acoustic physical layer. We analyze their
security and demonstrate that we can defend against signal cancellation attacks
by designing signals with low autocorrelation. Our system can detect
overshadowing attacks using a ternary decision function with a threshold. In
our evaluation of this SDP scheme's security and robustness, we achieve a bit
error ratio below 0.1% for a net bit rate of 100 bps with a signal-to-noise
ratio (SNR) of 14 dB. Using our open-source proof-of-concept implementation on
Android smartphones, we demonstrate pairing between different smartphone
models.
","[{'version': 'v1', 'created': 'Mon, 18 May 2020 10:33:26 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Aug 2020 17:53:32 GMT'}]",2020-08-11,"[['Putz', 'Florentin', ''], ['Álvarez', 'Flor', ''], ['Classen', 'Jiska', '']]","['physical-layer security', 'signal cancellation', 'secure device pairing', 'acoustic communication', 'trust', 'integrity codes', 'android']"
9256,2109.11921,Joseph Hejderup,Joseph Hejderup and Georgios Gousios,"Can We Trust Tests To Automate Dependency Updates? A Case Study of Java
  Projects","15 pages, 5 figures, journal",,10.1016/j.jss.2021.111097,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Developers are increasingly using services such as Dependabot to automate
dependency updates. However, recent research has shown that developers perceive
such services as unreliable, as they heavily rely on test coverage to detect
conflicts in updates. To understand the prevalence of tests exercising
dependencies, we calculate the test coverage of direct and indirect uses of
dependencies in 521 well-tested Java projects. We find that tests only cover
58% of direct and 20% of transitive dependency calls. By creating 1,122,420
artificial updates with simple faults covering all dependency usages in 262
projects, we measure the effectiveness of test suites in detecting semantic
faults in dependencies; we find that tests can only detect 47% of direct and
35% of indirect artificial faults on average. To increase reliability, we
investigate the use of change impact analysis as a means of reducing false
negatives; on average, our tool can uncover 74% of injected faults in direct
dependencies and 64% for transitive dependencies, nearly two times more than
test suites. We then apply our tool in 22 real-world dependency updates, where
it identifies three semantically conflicting cases and five cases of unused
dependencies. Our findings indicate that the combination of static and dynamic
analysis should be a requirement for future dependency updating systems.
","[{'version': 'v1', 'created': 'Fri, 24 Sep 2021 12:32:07 GMT'}]",2021-09-27,"[['Hejderup', 'Joseph', ''], ['Gousios', 'Georgios', '']]","['semantic versioning', 'library updates', 'package management', 'dependency management', 'software migration']"
9257,1801.06044,Liu Feng,"Feng Liu, Yong Shi, Peijia Lia","Analysis of the Relation between Artificial Intelligence and the
  Internet from the Perspective of Brain Science","6 pages,3 figures",,10.1016/j.procs.2017.11.383,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Artificial intelligence (AI) like deep learning, cloud AI computation has
been advancing at a rapid pace since 2014. There is no doubt that the
prosperity of AI is inseparable with the development of the Internet. However,
there has been little attention to the link between AI and the internet. This
paper explores them with brain insights mainly from four views:1) How is the
general relation between artificial intelligence and Internet of Things, cloud
computing, big data and Industrial Internet from the perspective of brain
science. 2) Construction of a new AI system model with the Internet and brain
science.
","[{'version': 'v1', 'created': 'Tue, 2 Jan 2018 15:19:52 GMT'}]",2018-01-19,"[['Liu', 'Feng', ''], ['Shi', 'Yong', ''], ['Lia', 'Peijia', '']]","[""Internet's virtual brain"", 'Big SNS', 'AI model of the Internet-like brain;']"
9258,2001.06920,Hongyu Jin,Hongyu Jin and Panos Papadimitratos,"DoS-resilient Cooperative Beacon Verification for Vehicular
  Communication Systems",,"Elsevier Ad Hoc Networks, 90, 101775, 2019",10.1016/j.adhoc.2018.10.003,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Authenticated safety beacons in Vehicular Communication (VC) systems ensure
awareness among neighboring vehicles. However, the verification of beacon
signatures introduces significant processing overhead for resource-constrained
vehicular On-Board Units (OBUs). Even worse in dense neighborhood or when a
clogging Denial of Service (DoS) attack is mounted. The OBU would fail to
verify for all received (authentic or fictitious) beacons. This could
significantly delay the verifications of authentic beacons or even affect the
awareness of neighboring vehicle status. In this paper, we propose an efficient
cooperative beacon verification scheme leveraging efficient symmetric key based
authentication on top of pseudonymous authentication (based on traditional
public key cryptography), providing efficient discovery of authentic beacons
among a pool of received authentic and fictitious beacons, and can
significantly decrease waiting times of beacons in queue before their
validations. We show with simulation results that our scheme can guarantee low
waiting times for received beacons even in high neighbor density situations and
under DoS attacks, under which a traditional scheme would not be workable.
","[{'version': 'v1', 'created': 'Sun, 19 Jan 2020 23:42:35 GMT'}]",2020-01-22,"[['Jin', 'Hongyu', ''], ['Papadimitratos', 'Panos', '']]","['Security', 'Privacy', 'Pseudonymous authentication', 'Efficiency']"
9259,1905.02051,James Cheney,Stefan Fehrenbach and James Cheney,Language-integrated provenance by trace analysis,DBPL 2019,,10.1145/3315507.3330198,,cs.PL cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Language-integrated provenance builds on language-integrated query techniques
to make provenance information explaining query results readily available to
programmers. In previous work we have explored language-integrated approaches
to provenance in Links and Haskell. However, implementing a new form of
provenance in a language-integrated way is still a major challenge. We propose
a self-tracing transformation and trace analysis features that, together with
existing techniques for type-directed generic programming, make it possible to
define different forms of provenance as user code. We present our design as an
extension to a core language for Links called LinksT, give examples showing its
capabilities, and outline its metatheory and key correctness properties.
","[{'version': 'v1', 'created': 'Mon, 6 May 2019 13:56:46 GMT'}]",2019-05-07,"[['Fehrenbach', 'Stefan', ''], ['Cheney', 'James', '']]","['language-integrated provenance', 'language-integrated query', 'query normalization', 'provenance']"
9260,2104.09627,Mo Han,"Mo Han, Mehrshad Zandigohar, Sezen Yagmur Gunay, Gunar Schirner, and
  Deniz Erdogmus","Inference of Upcoming Human Grasp Using EMG During Reach-to-Grasp
  Movement",,,10.3389/fnins.2022.849991,,cs.RO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Electromyography (EMG) data has been extensively adopted as an intuitive
interface for instructing human-robot collaboration. A major challenge of the
real-time detection of human grasp intent is the identification of dynamic EMG
from hand movements. Previous studies mainly implemented steady-state EMG
classification with a small number of grasp patterns on dynamic situations,
which are insufficient to generate differentiated control regarding the
muscular activity variation in practice. In order to better detect dynamic
movements, more EMG variability could be integrated into the model. However,
only limited research were concentrated on such detection of dynamic grasp
motions, and most existing assessments on non-static EMG classification either
require supervised ground-truth timestamps of the movement status, or only
contain limited kinematic variations. In this study, we propose a framework for
classifying dynamic EMG signals into gestures, and examine the impact of
different movement phases, using an unsupervised method to segment and label
the action transitions. We collected and utilized data from large gesture
vocabularies with multiple dynamic actions to encode the transitions from one
grasp intent to another based on common sequences of the grasp movements. The
classifier for identifying the gesture label was constructed afterwards based
on the dynamic EMG signal, with no supervised annotation of kinematic movements
required. Finally, we evaluated the performances of several training strategies
using EMG data from different movement phases, and explored the information
revealed from each phase. All experiments were evaluated in a real-time style
with the performance transitions over time presented.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2021 20:41:06 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Mar 2022 20:07:42 GMT'}, {'version': 'v3', 'created': 'Mon, 26 Sep 2022 14:09:33 GMT'}]",2022-09-27,"[['Han', 'Mo', ''], ['Zandigohar', 'Mehrshad', ''], ['Gunay', 'Sezen Yagmur', ''], ['Schirner', 'Gunar', ''], ['Erdogmus', 'Deniz', '']]","['electromyography (EMG) signals', 'dynamic EMG', 'gesture classification', 'human intent inference', 'machine learning']"
9261,1602.07675,Daniel Severin Dr.,Daniel Severin,On the additive chromatic number of several families of graphs,,,10.1016/j.ipl.2020.105937,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Additive Coloring Problem is a variation of the Coloring Problem where
labels of $\{1,\ldots,k\}$ are assigned to the vertices of a graph $G$ so that
the sum of labels over the neighborhood of each vertex is a proper coloring of
$G$. The least value $k$ for which $G$ admits such labeling is called
\emph{additive chromatic number} of $G$. This problem was first presented by
Czerwi\'nski, Grytczuk and \.Zelazny who also proposed a conjecture that for
every graph $G$, the additive chromatic number never exceeds the classic
chromatic number. Up to date, the conjecture has been proved for complete
graphs, trees, non-3-colorable planar graphs with girth at least 13 and
non-bipartite planar graphs with girth at least 26. In this work, we show that
the conjecture holds for split graphs. We also present exact formulas for
computing the additive chromatic number for some subfamilies of split graphs
(complete split, headless spiders and complete sun), regular bipartite,
complete multipartite, fan, windmill, circuit, wheel, cycle sun and wheel sun.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2016 20:58:10 GMT'}, {'version': 'v2', 'created': 'Sat, 27 Feb 2016 16:34:06 GMT'}, {'version': 'v3', 'created': 'Wed, 12 Feb 2020 17:14:13 GMT'}]",2020-02-28,"[['Severin', 'Daniel', '']]","['Additive chromatic number', 'Additive coloring conjecture', 'Lucky labeling', 'Graph algorithms']"
9262,2111.04636,H\'eber H. Arcolezi,"H\'eber H. Arcolezi, Jean-Fran\c{c}ois Couchot, Bechara Al Bouna,
  Xiaokui Xiao","Improving the utility of locally differentially private protocols for
  longitudinal and multidimensional frequency estimates","Final version accepted in the journal Digital Communications and
  Networks. Version of Record: https://doi.org/10.1016/j.dcan.2022.07.003",,10.1016/j.dcan.2022.07.003,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  This paper investigates the problem of collecting multidimensional data
throughout time (i.e., longitudinal studies) for the fundamental task of
frequency estimation under Local Differential Privacy (LDP) guarantees.
Contrary to frequency estimation of a single attribute, the multidimensional
aspect demands particular attention to the privacy budget. Besides, when
collecting user statistics longitudinally, privacy progressively degrades.
Indeed, the ""multiple"" settings in combination (i.e., many attributes and
several collections throughout time) impose several challenges, for which this
paper proposes the first solution for frequency estimates under LDP. To tackle
these issues, we extend the analysis of three state-of-the-art LDP protocols
(Generalized Randomized Response -- GRR, Optimized Unary Encoding -- OUE, and
Symmetric Unary Encoding -- SUE) for both longitudinal and multidimensional
data collections. While the known literature uses OUE and SUE for two rounds of
sanitization (a.k.a. memoization), i.e., L-OUE and L-SUE, respectively, we
analytically and experimentally show that starting with OUE and then with SUE
provides higher data utility (i.e., L-OSUE). Also, for attributes with small
domain sizes, we propose Longitudinal GRR (L-GRR), which provides higher
utility than the other protocols based on unary encoding. Last, we also propose
a new solution named Adaptive LDP for LOngitudinal and Multidimensional
FREquency Estimates (ALLOMFREE), which randomly samples a single attribute to
be sent with the whole privacy budget and adaptively selects the optimal
protocol, i.e., either L-GRR or L-OSUE. As shown in the results, ALLOMFREE
consistently and considerably outperforms the state-of-the-art L-SUE and L-OUE
protocols in the quality of the frequency estimates.
","[{'version': 'v1', 'created': 'Mon, 8 Nov 2021 17:04:02 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jul 2022 08:11:25 GMT'}, {'version': 'v3', 'created': 'Sat, 16 Jul 2022 16:35:53 GMT'}]",2022-07-19,"[['Arcolezi', 'Héber H.', ''], ['Couchot', 'Jean-François', ''], ['Bouna', 'Bechara Al', ''], ['Xiao', 'Xiaokui', '']]","['Local differential privacy', 'Discrete distribution estimation', 'Frequency estimation', 'Multidimensional data', 'Longitudinal studies']"
9263,1712.08160,Ilya Kuzovkin,"Anna Leontjeva, Ilya Kuzovkin","Combining Static and Dynamic Features for Multivariate Sequence
  Classification",Presented at IEEE DSAA 2016,,10.1109/DSAA.2016.10,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Model precision in a classification task is highly dependent on the feature
space that is used to train the model. Moreover, whether the features are
sequential or static will dictate which classification method can be applied as
most of the machine learning algorithms are designed to deal with either one or
another type of data. In real-life scenarios, however, it is often the case
that both static and dynamic features are present, or can be extracted from the
data. In this work, we demonstrate how generative models such as Hidden Markov
Models (HMM) and Long Short-Term Memory (LSTM) artificial neural networks can
be used to extract temporal information from the dynamic data. We explore how
the extracted information can be combined with the static features in order to
improve the classification performance. We evaluate the existing techniques and
suggest a hybrid approach, which outperforms other methods on several public
datasets.
","[{'version': 'v1', 'created': 'Wed, 20 Dec 2017 23:59:13 GMT'}]",2017-12-25,"[['Leontjeva', 'Anna', ''], ['Kuzovkin', 'Ilya', '']]","['Sequence classification', 'HMM', 'LSTM', 'Featureextraction', 'Ensembles']"
9264,1904.06879,Francisco Cruz,"Francisco Cruz, Sven Magg, Yukie Nagai, Stefan Wermter",Improving interactive reinforcement learning: What makes a good teacher?,"21 pages, 12 figures","Connection Science, Vol. 30, Nr. 3, 2018",10.1080/09540091.2018.1443318,,cs.AI cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interactive reinforcement learning has become an important apprenticeship
approach to speed up convergence in classic reinforcement learning problems. In
this regard, a variant of interactive reinforcement learning is policy shaping
which uses a parent-like trainer to propose the next action to be performed and
by doing so reduces the search space by advice. On some occasions, the trainer
may be another artificial agent which in turn was trained using reinforcement
learning methods to afterward becoming an advisor for other learner-agents. In
this work, we analyze internal representations and characteristics of
artificial agents to determine which agent may outperform others to become a
better trainer-agent. Using a polymath agent, as compared to a specialist
agent, an advisor leads to a larger reward and faster convergence of the reward
signal and also to a more stable behavior in terms of the state visit frequency
of the learner-agents. Moreover, we analyze system interaction parameters in
order to determine how influential they are in the apprenticeship process,
where the consistency of feedback is much more relevant when dealing with
different learner obedience parameters.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2019 07:17:20 GMT'}]",2019-04-16,"[['Cruz', 'Francisco', ''], ['Magg', 'Sven', ''], ['Nagai', 'Yukie', ''], ['Wermter', 'Stefan', '']]","['Interactive reinforcement learning', 'policy shape', 'artificial trainer-agent', 'cleaning scenario']"
9265,2009.10290,Xinyu Zuo,"Xinyu Zuo, Yubo Chen, Kang Liu and Jun Zhao","Event Coreference Resolution via a Multi-loss Neural Network without
  Using Argument Information",Published on SCIENCE CHINA Information Sciences,"SCIENCE CHINA Information Sciences, Volume 62, Issue
  11:212101(2019)",10.1007/s11432-018-9833-1,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Event coreference resolution(ECR) is an important task in Natural Language
Processing (NLP) and nearly all the existing approaches to this task rely on
event argument information. However, these methods tend to suffer from error
propagation from the stage of event argument extraction. Besides, not every
event mention contains all arguments of an event, and argument information may
confuse the model that events have arguments to detect event coreference in
real text. Furthermore, the context information of an event is useful to infer
the coreference between events. Thus, in order to reduce the errors propagated
from event argument extraction and use context information effectively, we
propose a multi-loss neural network model that does not need any argument
information to do the within-document event coreference resolution task and
achieve a significant performance than the state-of-the-art methods.
","[{'version': 'v1', 'created': 'Tue, 22 Sep 2020 02:48:48 GMT'}]",2020-09-23,"[['Zuo', 'Xinyu', ''], ['Chen', 'Yubo', ''], ['Liu', 'Kang', ''], ['Zhao', 'Jun', '']]","['Event coreference resolution', 'Neural network', 'Information extraction', 'Multi-loss function', 'Event mention extraction']"
9266,1906.02400,Behnam Sherafat,"Hosein Taghaddos, Ali Mashayekhi, and Behnam Sherafat","Automation of Construction Quantity Take-Off: Using Building Information
  Modeling (BIM)",,,10.1061/9780784479827.221,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Building information modeling (BIM) is a major upheaval in construction
industry. Although BIM advantages in construction management has been proved in
many papers reviewed, there are still many limitations that inhibit
organizations to use BIM models efficiently. However, advancement of
application programming interface (API) in the recent years has facilitated
employing BIM in construction industry. This research contributes to the state
of practice in construction management by developing API codes to automate
estimation of construction. The developed API automatically filters items
related to a particular discipline within a particular work area and facilitate
systematical quantity take off in different work areas. This allows the planner
to define proper 3D work areas and to estimate the required materials and
man-hours in different work areas throughout the project. The results of the
developed automated approach are compared with hand calculated results as well
as the results calculated from the BIM software interface in special cases.
Finally, the research has been validated by a case study of an actual
petrochemical project.
","[{'version': 'v1', 'created': 'Thu, 6 Jun 2019 03:52:04 GMT'}]",2019-06-07,"[['Taghaddos', 'Hosein', ''], ['Mashayekhi', 'Ali', ''], ['Sherafat', 'Behnam', '']]","['Building Information Modeling (BIM)', 'Quantity Take Off', 'Estimation', 'Automation', 'Database Management System']"
9267,2204.08985,Jessica M\'egane,Jessica M\'egane and Nuno Louren\c{c}o and Penousal Machado,Co-evolutionary Probabilistic Structured Grammatical Evolution,"9 pages, 10 figures, The Genetic and Evolutionary Computation
  Conference",,10.1145/3512290.3528833,,cs.NE,http://creativecommons.org/licenses/by/4.0/,"  This work proposes an extension to Structured Grammatical Evolution (SGE)
called Co-evolutionary Probabilistic Structured Grammatical Evolution
(Co-PSGE). In Co-PSGE each individual in the population is composed by a
grammar and a genotype, which is a list of dynamic lists, each corresponding to
a non-terminal of the grammar containing real numbers that correspond to the
probability of choosing a derivation rule. Each individual uses its own grammar
to map the genotype into a program. During the evolutionary process, both the
grammar and the genotype are subject to variation operators. The performance of
the proposed approach is compared to 3 different methods, namely, Grammatical
Evolution (GE), Probabilistic Grammatical Evolution (PGE), and SGE on four
different benchmark problems. The results show the effectiveness of the
approach since Co-PSGE is able to outperform all the methods with statistically
significant differences in the majority of the problems.
","[{'version': 'v1', 'created': 'Tue, 19 Apr 2022 16:35:22 GMT'}]",2022-04-20,"[['Mégane', 'Jessica', ''], ['Lourenço', 'Nuno', ''], ['Machado', 'Penousal', '']]","['probabilistic algorithms', 'grammar-based', 'Gaussian mutation', 'coevolution']"
9268,2104.00843,Stephen MacDonell,"Waqar Hussain, Didar Zowghi, Tony Clear, Stephen MacDonell and Kelly
  Blincoe","Managing Requirements Change the Informal Way: When Saying 'No' is Not
  an Option","Conference paper, 10 pages, 4 figures, 1 table","Proceedings of the 24th International Conference on Requirements
  Engineering (RE2016). Beijing, China, IEEE, pp.126-135",10.1109/RE.2016.64,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software has always been considered as malleable. Changes to software
requirements are inevitable during the development process. Despite many
software engineering advances over several decades, requirements changes are a
source of project risk, particularly when businesses and technologies are
evolving rapidly. Although effectively managing requirements changes is a
critical aspect of software engineering, conceptions of requirements change in
the literature and approaches to their management in practice still seem
rudimentary. The overall goal of this study is to better understand the process
of requirements change management. We present findings from an exploratory case
study of requirements change management in a globally distributed setting. In
this context we noted a contrast with the traditional models of requirements
change. In theory, change control policies and formal processes are considered
as a natural strategy to deal with requirements changes. Yet we observed that
""informal requirements changes"" (InfRc) were pervasive and unavoidable. Our
results reveal an equally 'natural' informal change management process that is
required to handle InfRc in parallel. We present a novel model of requirements
change which, we argue, better represents the phenomenon and more realistically
incorporates both the informal and formal types of change.
","[{'version': 'v1', 'created': 'Fri, 2 Apr 2021 01:29:50 GMT'}]",2021-04-05,"[['Hussain', 'Waqar', ''], ['Zowghi', 'Didar', ''], ['Clear', 'Tony', ''], ['MacDonell', 'Stephen', ''], ['Blincoe', 'Kelly', '']]","['Informal requirements change', 'scope creep', 'requirements management', 'requirements']"
9269,2101.01289,Do Le Quoc,Wojciech Ozga and Do Le Quoc and Christof Fetzer,A practical approach for updating an integrity-enforced operating system,,,10.1145/3423211.3425674,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Trusted computing defines how to securely measure, store, and verify the
integrity of software controlling a computer. One of the major challenges that
make them hard to be applied in practice is the issue with software updates.
Specifically, an operating system update causes the integrity violation because
it changes the well-known initial state trusted by remote verifiers, such as
integrity monitoring systems. Consequently, the integrity monitoring of remote
computers becomes unreliable due to the high amount of false positives. We
address this problem by adding an extra level of indirection between the
operating system and software repositories. We propose a trusted software
repository (TSR), a secure proxy that overcomes the shortcomings of previous
approaches by sanitizing software packages. Sanitization consists of modifying
unsafe installation scripts and adding digital signatures in a way software
packages can be installed in the operating system without violating its
integrity. TSR leverages shielded execution, i.e., Intel SGX, to achieve
confidentiality and integrity guarantees of the sanitization process. TSR is
transparent to package managers, and requires no changes in the software
packages building and distributing processes. Our evaluation shows that running
TSR inside SGX is practical; since it induces only ~1.18X performance overhead
during package sanitization compared to the native execution without SGX. TSR
supports 99.76% of packages available in the main and community repositories of
Alpine Linux while increasing the total repository size by 3.6%.
","[{'version': 'v1', 'created': 'Tue, 5 Jan 2021 00:09:01 GMT'}]",2021-01-06,"[['Ozga', 'Wojciech', ''], ['Quoc', 'Do Le', ''], ['Fetzer', 'Christof', '']]","['trusted computing', 'software updates', 'integrity measurement architecture (IMA)', 'intel software guard extensions']"
9270,2001.04129,Jorge Calvo-Zaragoza,"Antonio-Javier Gallego, Jorge Calvo-Zaragoza, Robert B. Fisher",Incremental Unsupervised Domain-Adversarial Training of Neural Networks,"26 pages, 7 figures",IEEE Trans. Neural Networks Learn. Syst. 32(11): 4864-4878 (2021),10.1109/TNNLS.2020.3025954,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the context of supervised statistical learning, it is typically assumed
that the training set comes from the same distribution that draws the test
samples. When this is not the case, the behavior of the learned model is
unpredictable and becomes dependent upon the degree of similarity between the
distribution of the training set and the distribution of the test set. One of
the research topics that investigates this scenario is referred to as domain
adaptation. Deep neural networks brought dramatic advances in pattern
recognition and that is why there have been many attempts to provide good
domain adaptation algorithms for these models. Here we take a different avenue
and approach the problem from an incremental point of view, where the model is
adapted to the new domain iteratively. We make use of an existing unsupervised
domain-adaptation algorithm to identify the target samples on which there is
greater confidence about their true label. The output of the model is analyzed
in different ways to determine the candidate samples. The selected set is then
added to the source training set by considering the labels provided by the
network as ground truth, and the process is repeated until all target samples
are labelled. Our results report a clear improvement with respect to the
non-incremental case in several datasets, also outperforming other
state-of-the-art domain adaptation algorithms.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2020 09:54:35 GMT'}]",2022-05-12,"[['Gallego', 'Antonio-Javier', ''], ['Calvo-Zaragoza', 'Jorge', ''], ['Fisher', 'Robert B.', '']]","['Domain Adaptation', 'Unsupervised learning', 'Neural Networks', 'Convolutional Neural']"
9271,2112.11117,Konrad Kollnig,"Konrad Kollnig, Reuben Binns, Max Van Kleek, Ulrik Lyngs, Jun Zhao,
  Claudine Tinsman, Nigel Shadbolt",Before and after GDPR: tracking in mobile apps,,"Internet Policy Review, 2021, 10(4)",10.14763/2021.4.1611,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Third-party tracking, the collection and sharing of behavioural data about
individuals, is a significant and ubiquitous privacy threat in mobile apps. The
EU General Data Protection Regulation (GDPR) was introduced in 2018 to protect
personal data better, but there exists, thus far, limited empirical evidence
about its efficacy. This paper studies tracking in nearly two million Android
apps from before and after the introduction of the GDPR. Our analysis suggests
that there has been limited change in the presence of third-party tracking in
apps, and that the concentration of tracking capabilities among a few large
gatekeeper companies persists. However, change might be imminent.
","[{'version': 'v1', 'created': 'Tue, 21 Dec 2021 11:45:01 GMT'}]",2021-12-22,"[['Kollnig', 'Konrad', ''], ['Binns', 'Reuben', ''], ['Van Kleek', 'Max', ''], ['Lyngs', 'Ulrik', ''], ['Zhao', 'Jun', ''], ['Tinsman', 'Claudine', ''], ['Shadbolt', 'Nigel', '']]","['Personal data', 'Personal data protection', 'Mobile apps', 'Privacy', 'GDPR', 'Competition']"
9272,2206.06878,Justice Darko,"Hyoshin Park and Justice Darko and Niharika Deshpande and Venktesh
  Pandey and Hui Su and Masahiro Ono and Dedrick Barkely and Larkin Folsom and
  Derek Posselt and Steve Chien",Temporal Multimodal Multivariate Learning,"11 pages, 12 figures, SIGKDD Conference on Knowledge Discovery and
  Data Mining,",,10.1145/3534678.3539159,,cs.LG cs.IT math.IT,http://creativecommons.org/licenses/by/4.0/,"  We introduce temporal multimodal multivariate learning, a new family of
decision making models that can indirectly learn and transfer online
information from simultaneous observations of a probability distribution with
more than one peak or more than one outcome variable from one time stage to
another. We approximate the posterior by sequentially removing additional
uncertainties across different variables and time, based on data-physics driven
correlation, to address a broader class of challenging time-dependent
decision-making problems under uncertainty. Extensive experiments on real-world
datasets ( i.e., urban traffic data and hurricane ensemble forecasting data)
demonstrate the superior performance of the proposed targeted decision-making
over the state-of-the-art baseline prediction methods across various settings.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2022 14:24:47 GMT'}]",2022-06-15,"[['Park', 'Hyoshin', ''], ['Darko', 'Justice', ''], ['Deshpande', 'Niharika', ''], ['Pandey', 'Venktesh', ''], ['Su', 'Hui', ''], ['Ono', 'Masahiro', ''], ['Barkely', 'Dedrick', ''], ['Folsom', 'Larkin', ''], ['Posselt', 'Derek', ''], ['Chien', 'Steve', '']]","['Multimodal Entropy', 'Multivariate Learning', 'Spatiotemporal Information', 'Sequential decision']"
9273,2006.16911,Kwadwo Osei Bonsu,"Kwadwo Osei Bonsu, Jie Song","Turbulence on the Global Economy influenced by Artificial Intelligence
  and Foreign Policy Inefficiencies",This is the pre-print version,,10.47305/JLIA2020113ob,,cs.CY econ.GN q-fin.EC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is said that Data and Information are the new oil. One, who handles the
data, handles the emerging future of the global economy. Complex algorithms and
intelligence-based filter programs are utilized to manage, store, handle and
maneuver vast amounts of data for the fulfillment of specific purposes. This
paper seeks to find the bridge between artificial intelligence and its impact
on the international policy implementation in the light of geopolitical
influence, global economy and the future of labor markets. We hypothesize that
the distortion in the labor markets caused by artificial intelligence can be
mitigated by a collaborative international foreign policy on the deployment of
AI in the industrial circles. We, in this paper, then proceed to propose a
disposition for the essentials of AI-based foreign policy and implementation,
while asking questions such as 'could AI become the real Invisible Hand
discussed by economists?'.
","[{'version': 'v1', 'created': 'Fri, 19 Jun 2020 10:59:32 GMT'}]",2021-04-02,"[['Bonsu', 'Kwadwo Osei', ''], ['Song', 'Jie', '']]","['Artificial Intelligence', 'Foreign Policy', 'Invisible Hand', 'Global Economy', 'Machine Learning Algorithm', 'Labor Markets']"
9274,2010.07987,Nadezhda Chirkova,"Nadezhda Chirkova, Sergey Troshin",Empirical Study of Transformers for Source Code,"Published at the ACM Joint European Software Engineering Conference
  and Symposium on the Foundations of Software Engineering 2021 (ESEC/FSE'21)",,10.1145/3468264.3468611,,cs.LG cs.CL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Initially developed for natural language processing (NLP), Transformers are
now widely used for source code processing, due to the format similarity
between source code and text. In contrast to natural language, source code is
strictly structured, i.e., it follows the syntax of the programming language.
Several recent works develop Transformer modifications for capturing syntactic
information in source code. The drawback of these works is that they do not
compare to each other and consider different tasks. In this work, we conduct a
thorough empirical study of the capabilities of Transformers to utilize
syntactic information in different tasks. We consider three tasks (code
completion, function naming and bug fixing) and re-implement different
syntax-capturing modifications in a unified framework. We show that
Transformers are able to make meaningful predictions based purely on syntactic
information and underline the best practices of taking the syntactic
information into account for improving the performance of the model.
","[{'version': 'v1', 'created': 'Thu, 15 Oct 2020 19:09:15 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Jun 2021 11:32:30 GMT'}]",2021-06-25,"[['Chirkova', 'Nadezhda', ''], ['Troshin', 'Sergey', '']]","['neural networks', 'transformer', 'variable misuse detection', 'functionnaming', 'code completion']"
9275,2007.05352,Antoine Cully,Antoine Cully,"Multi-Emitter MAP-Elites: Improving quality, diversity and convergence
  speed with heterogeneous sets of emitters",,"In Proceedings of the Genetic and Evolutionary Computation
  Conference (pp. 84-92) 2021",10.1145/3449639.3459326,,cs.NE,http://creativecommons.org/licenses/by-sa/4.0/,"  Quality-Diversity (QD) optimisation is a new family of learning algorithms
that aims at generating collections of diverse and high-performing solutions.
Among those algorithms, the recently introduced Covariance Matrix Adaptation
MAP-Elites (CMA-ME) algorithm proposes the concept of emitters, which uses a
predefined heuristic to drive the algorithm's exploration. This algorithm was
shown to outperform MAP-Elites, a popular QD algorithm that has demonstrated
promising results in numerous applications. In this paper, we introduce
Multi-Emitter MAP-Elites (ME-MAP-Elites), an algorithm that directly extends
CMA-ME and improves its quality, diversity and data efficiency. It leverages
the diversity of a heterogeneous set of emitters, in which each emitter type
improves the optimisation process in different ways. A bandit algorithm
dynamically finds the best selection of emitters depending on the current
situation. We evaluate the performance of ME-MAP-Elites on six tasks, ranging
from standard optimisation problems (in 100 dimensions) to complex locomotion
tasks in robotics. Our comparisons against CMA-ME and MAP-Elites show that
ME-MAP-Elites is faster at providing collections of solutions that are
significantly more diverse and higher performing. Moreover, in cases where no
fruitful synergy can be found between the different emitters, ME-MAP-Elites is
equivalent to the best of the compared algorithms.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 12:45:02 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Jul 2021 09:33:24 GMT'}]",2021-07-07,"[['Cully', 'Antoine', '']]","['Quality-Diversity optimization', 'Evolutionary robotics', 'MAP-Elites']"
9276,2001.10106,Jiaxin Huang,"Jiaxin Huang, Yiqing Xie, Yu Meng, Jiaming Shen, Yunyi Zhang and
  Jiawei Han","Guiding Corpus-based Set Expansion by Auxiliary Sets Generation and
  Co-Expansion",WWW 2020,,10.1145/3366423.3380284,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Given a small set of seed entities (e.g., ``USA'', ``Russia''), corpus-based
set expansion is to induce an extensive set of entities which share the same
semantic class (Country in this example) from a given corpus. Set expansion
benefits a wide range of downstream applications in knowledge discovery, such
as web search, taxonomy construction, and query suggestion. Existing
corpus-based set expansion algorithms typically bootstrap the given seeds by
incorporating lexical patterns and distributional similarity. However, due to
no negative sets provided explicitly, these methods suffer from semantic drift
caused by expanding the seed set freely without guidance. We propose a new
framework, Set-CoExpan, that automatically generates auxiliary sets as negative
sets that are closely related to the target set of user's interest, and then
performs multiple sets co-expansion that extracts discriminative features by
comparing target set with auxiliary sets, to form multiple cohesive sets that
are distinctive from one another, thus resolving the semantic drift issue. In
this paper we demonstrate that by generating auxiliary sets, we can guide the
expansion process of target set to avoid touching those ambiguous areas around
the border with auxiliary sets, and we show that Set-CoExpan outperforms strong
baseline methods significantly.
","[{'version': 'v1', 'created': 'Mon, 27 Jan 2020 22:34:07 GMT'}]",2020-01-29,"[['Huang', 'Jiaxin', ''], ['Xie', 'Yiqing', ''], ['Meng', 'Yu', ''], ['Shen', 'Jiaming', ''], ['Zhang', 'Yunyi', ''], ['Han', 'Jiawei', '']]","['Set Expansion', 'Bootstrap Methods', 'Semantic Computing', 'Web Mining']"
9277,1507.05762,Peter Schachte,"Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Sondergaard,
  Peter J. Stuckey","Horn Clauses as an Intermediate Representation for Program Analysis and
  Transformation","To Appear in Theory and Practice of Logic Programming (TPLP),
  Proceedings of ICLP 2015",Theory and Practice of Logic Programming 15 (2015) 526-542,10.1017/S1471068415000204,,cs.PL,http://creativecommons.org/licenses/by-sa/4.0/,"  Many recent analyses for conventional imperative programs begin by
transforming programs into logic programs, capitalising on existing LP analyses
and simple LP semantics. We propose using logic programs as an intermediate
program representation throughout the compilation process. With restrictions
ensuring determinism and single-modedness, a logic program can easily be
transformed to machine language or other low-level language, while maintaining
the simple semantics that makes it suitable as a language for program analysis
and transformation. We present a simple LP language that enforces determinism
and single-modedness, and show that it makes a convenient program
representation for analysis and transformation.
","[{'version': 'v1', 'created': 'Tue, 21 Jul 2015 09:39:11 GMT'}]",2020-02-19,"[['Gange', 'Graeme', ''], ['Navas', 'Jorge A.', ''], ['Schachte', 'Peter', ''], ['Sondergaard', 'Harald', ''], ['Stuckey', 'Peter J.', '']]","['compilers', 'control flow graphs', 'intermediate representation', 'program analysis andtransformation', 'SSA']"
9278,1711.10662,Wellington Pinheiro Dos Santos,Jinmi Lee and Wellington Pinheiro dos Santos,"An Adaptive Fuzzy-Based System to Simulate, Quantify and Compensate
  Color Blindness",,"Integrated Computer-Aided Engineering, v. 18, p. 29-40, 2011",10.3233/ICA-2011-0356,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  About 8% of the male population of the world are affected by a determined
type of color vision disturbance, which varies from the partial to complete
reduction of the ability to distinguish certain colors. A considerable amount
of color blind people are able to live all life long without knowing they have
color vision disabilities and abnormalities. Nowadays the evolution of
information technology and computer science, specifically image processing
techniques and computer graphics, can be fundamental to aid at the development
of adaptive color blindness correction tools. This paper presents a software
tool based on Fuzzy Logic to evaluate the type and the degree of color
blindness a person suffer from. In order to model several degrees of color
blindness, herein this work we modified the classical linear transform-based
simulation method by the use of fuzzy parameters. We also proposed four new
methods to correct color blindness based on a fuzzy approach: Methods A and B,
with and without histogram equalization. All the methods are based on
combinations of linear transforms and histogram operations. In order to
evaluate the results we implemented a web-based survey to get the best results
according to optimize to distinguish different elements in an image. Results
obtained from 40 volunteers proved that the Method B with histogram
equalization got the best results for about 47% of volunteers.
","[{'version': 'v1', 'created': 'Wed, 29 Nov 2017 03:31:14 GMT'}]",2017-11-30,"[['Lee', 'Jinmi', ''], ['Santos', 'Wellington Pinheiro dos', '']]","['Color blindness correction', 'color blindness simulation', 'linear color systems', 'color transformations', 'digital imageprocessing']"
9279,2112.10638,Karn N Watcharasupat,"Karn N. Watcharasupat, Junyoung Lee, and Alexander Lerch","Latte: Cross-framework Python Package for Evaluation of Latent-Based
  Generative Models",To appear in Software Impacts,"Software Impacts, Volume 11, 2022, 100222, ISSN 2665-9638",10.1016/j.simpa.2022.100222,,cs.LG cs.AI cs.IR cs.MS,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Latte (for LATent Tensor Evaluation) is a Python library for evaluation of
latent-based generative models in the fields of disentanglement learning and
controllable generation. Latte is compatible with both PyTorch and
TensorFlow/Keras, and provides both functional and modular APIs that can be
easily extended to support other deep learning frameworks. Using NumPy-based
and framework-agnostic implementation, Latte ensures reproducible, consistent,
and deterministic metric calculations regardless of the deep learning framework
of choice.
","[{'version': 'v1', 'created': 'Mon, 20 Dec 2021 16:00:28 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Jan 2022 05:08:07 GMT'}, {'version': 'v3', 'created': 'Sat, 22 Jan 2022 11:54:21 GMT'}]",2022-03-24,"[['Watcharasupat', 'Karn N.', ''], ['Lee', 'Junyoung', ''], ['Lerch', 'Alexander', '']]","['Deep generative networks', 'disentanglement learning', 'latent space', 'controllable generation', 'Python']"
9280,1906.06435,Bilal Farooq,David Lopez and Bilal Farooq,A multi-layered blockchain framework for smart mobility data-markets,"Accepted in ""Transportation Research Part C: Emerging Technologies""
  (January 06, 2020), doi: 10.1016/j.trc.2020.01.002","Transportation Research Part C: Emerging Technologies, 111C (2020)
  pp. 588-615",10.1016/j.trc.2020.01.002,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Blockchain has the potential to render the transaction of information more
secure and transparent. Nowadays, transportation data are shared across
multiple entities using heterogeneous mediums, from paper collected data to
smartphone. Most of this data are stored in central servers that are
susceptible to hacks. In some cases shady actors who may have access to such
sources, share the mobility data with unwanted third parties. A multi-layered
Blockchain framework for Smart Mobility Data-market (BSMD) is presented for
addressing the associated privacy, security, management, and scalability
challenges. Each participant shares their encrypted data to the blockchain
network and can transact information with other participants as long as both
parties agree to the transaction rules issued by the owner of the data. Data
ownership, transparency, auditability and access control are the core
principles of the proposed blockchain for smart mobility data-market. In a case
study of real-time mobility data sharing, we demonstrate the performance of
BSMD on a 370 nodes blockchain running on heterogeneous and
geographically-separated devices communicating on a physical network. We also
demonstrate how BSMD ensures the cybersecurity and privacy of individual by
safeguarding against spoofing and message interception attacks and providing
information access management control.
","[{'version': 'v1', 'created': 'Fri, 14 Jun 2019 23:36:11 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Jan 2020 01:50:40 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Jan 2020 14:37:03 GMT'}]",2020-01-23,"[['Lopez', 'David', ''], ['Farooq', 'Bilal', '']]","['blockchain', 'privacy', 'cybersecurity', 'mobility', 'Big Data']"
9281,2102.02320,Zaid Khan,Zaid Khan and Yun Fu,"One Label, One Billion Faces: Usage and Consistency of Racial Categories
  in Computer Vision","Published as a conference paper at the 4th ACM Conference on
  Fairness, Accountability, and Transparency (FAccT 2021)",,10.1145/3442188.3445920,,cs.CV cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer vision is widely deployed, has highly visible, society altering
applications, and documented problems with bias and representation. Datasets
are critical for benchmarking progress in fair computer vision, and often
employ broad racial categories as population groups for measuring group
fairness. Similarly, diversity is often measured in computer vision datasets by
ascribing and counting categorical race labels. However, racial categories are
ill-defined, unstable temporally and geographically, and have a problematic
history of scientific use. Although the racial categories used across datasets
are superficially similar, the complexity of human race perception suggests the
racial system encoded by one dataset may be substantially inconsistent with
another. Using the insight that a classifier can learn the racial system
encoded by a dataset, we conduct an empirical study of computer vision datasets
supplying categorical race labels for face images to determine the
cross-dataset consistency and generalization of racial categories. We find that
each dataset encodes a substantially unique racial system, despite nominally
equivalent racial categories, and some racial categories are systemically less
consistent than others across datasets. We find evidence that racial categories
encode stereotypes, and exclude ethnic groups from categories on the basis of
nonconformity to stereotypes. Representing a billion humans under one racial
category may obscure disparities and create new ones by encoding stereotypes of
racial systems. The difficulty of adequately converting the abstract concept of
race into a tool for measuring fairness underscores the need for a method more
flexible and culturally aware than racial categories.
","[{'version': 'v1', 'created': 'Wed, 3 Feb 2021 22:50:04 GMT'}]",2021-02-05,"[['Khan', 'Zaid', ''], ['Fu', 'Yun', '']]","['datasets', 'bias', 'fairness', 'faces', 'computer vision', 'race']"
9282,2002.03475,Yaxiong Xie,"Yaxiong Xie, Fan Yi, Kyle Jamieson","PBE-CC: Congestion Control via Endpoint-Centric, Physical-Layer
  Bandwidth Measurements",,,10.1145/3387514.3405880,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless networks are becoming ever more sophisticated and overcrowded,
imposing the most delay, jitter, and throughput damage to end-to-end network
flows in today's internet. We therefore argue for fine-grained mobile
endpoint-based wireless measurements to inform a precise congestion control
algorithm through a well-defined API to the mobile's wireless physical layer.
Our proposed congestion control algorithm is based on Physical-Layer Bandwidth
measurements taken at the Endpoint (PBE-CC), and captures the latest 5G New
Radio innovations that increase wireless capacity, yet create abrupt rises and
falls in available wireless capacity that the PBE-CC sender can react to
precisely and very rapidly. We implement a proof-of-concept prototype of the
PBE measurement module on software-defined radios and the PBE sender and
receiver in C. An extensive performance evaluation compares PBE-CC head to head
against the leading cellular-aware and wireless-oblivious congestion control
protocols proposed in the research community and in deployment, in mobile and
static mobile scenarios, and over busy and quiet networks. Results show 6.3%
higher average throughput than BBR, while simultaneously reducing 95th
percentile delay by 1.8x.
","[{'version': 'v1', 'created': 'Mon, 10 Feb 2020 00:20:18 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Jul 2020 21:03:43 GMT'}]",2020-07-08,"[['Xie', 'Yaxiong', ''], ['Yi', 'Fan', ''], ['Jamieson', 'Kyle', '']]","['TCP congestion control', 'Transport protocols', 'Cellular network', 'LTE', 'Physical control channel', 'Control information', 'Capacity estimation']"
9283,2205.11102,Till Knollmann,"Jannik Castenow, Bj\""orn Feldkord, Till Knollmann, Manuel Malatyali,
  Friedhelm Meyer auf der Heide",The k-Server with Preferences Problem,"A conference version of this paper was accepted at the 34th ACM
  Symposium on Parallelism in Algorithms and Architectures (SPAA 2022)",,10.1145/3490148.3538595,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The $k$-Server Problem covers plenty of resource allocation scenarios, and
several variations have been studied extensively for decades. We present a
model generalizing the $k$-Server Problem by preferences of the requests, where
the servers are not identical and requests can express which specific servers
should serve them. In our model, requests can either be answered by any server
(general requests) or by a specific one (specific requests). If only general
requests appear, the instance is one of the original $k$-Server Problem, and a
lower bound for the competitive ratio of $k$ applies. If only specific requests
appear, a solution with a competitive ratio of $1$ becomes trivial. We show
that if both kinds of requests appear, the lower bound raises to $2k-1$.
  We study deterministic online algorithms and present two algorithms for
uniform metrics. The first one has a competitive ratio dependent on the
frequency of specific requests. It achieves a worst-case competitive ratio of
$3k-2$ while it is optimal when only general requests appear or when specific
requests dominate the input sequence. The second has a worst-case competitive
ratio of $2k+14$. For the first algorithm, we show a lower bound of $3k-2$,
while the second algorithm has a lower bound of $2k-1$ when only general
requests appear. The two algorithms differ in only one behavioral rule that
significantly influences the competitive ratio. We show that there is a
trade-off between performing well against instances of the $k$-Server Problem
and mixed instances based on the rule. Additionally, no deterministic online
algorithm can be optimal for both kinds of instances simultaneously.
  Regarding non-uniform metrics, we present an adaption of the Double Coverage
algorithm for $2$ servers on the line achieving a competitive ratio of $6$, and
an adaption of the Work-Function-Algorithm achieving a competitive ratio of
$4k$.
","[{'version': 'v1', 'created': 'Mon, 23 May 2022 07:52:05 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Aug 2022 18:05:24 GMT'}, {'version': 'v3', 'created': 'Thu, 1 Sep 2022 09:04:50 GMT'}, {'version': 'v4', 'created': 'Thu, 20 Oct 2022 14:09:34 GMT'}]",2022-10-21,"[['Castenow', 'Jannik', ''], ['Feldkord', 'Björn', ''], ['Knollmann', 'Till', ''], ['Malatyali', 'Manuel', ''], ['der Heide', 'Friedhelm Meyer auf', '']]","['K-Server Problem', 'Heterogeneity', 'Online Caching']"
9284,2109.04200,Junwei Zhang,"Junwei Zhang, Min Gao, Junliang Yu, Lei Guo, Jundong Li, Hongzhi Yin","Double-Scale Self-Supervised Hypergraph Learning for Group
  Recommendation","11 pages, 6 figures, CIKM 2021",,10.1145/3459637.3482426,,cs.IR cs.AI,http://creativecommons.org/licenses/by/4.0/,"  With the prevalence of social media, there has recently been a proliferation
of recommenders that shift their focus from individual modeling to group
recommendation. Since the group preference is a mixture of various
predilections from group members, the fundamental challenge of group
recommendation is to model the correlations among members. Existing methods
mostly adopt heuristic or attention-based preference aggregation strategies to
synthesize group preferences. However, these models mainly focus on the
pairwise connections of users and ignore the complex high-order interactions
within and beyond groups. Besides, group recommendation suffers seriously from
the problem of data sparsity due to severely sparse group-item interactions. In
this paper, we propose a self-supervised hypergraph learning framework for
group recommendation to achieve two goals: (1) capturing the intra- and
inter-group interactions among users; (2) alleviating the data sparsity issue
with the raw data itself. Technically, for (1), a hierarchical hypergraph
convolutional network based on the user- and group-level hypergraphs is
developed to model the complex tuplewise correlations among users within and
beyond groups. For (2), we design a double-scale node dropout strategy to
create self-supervision signals that can regularize user representations with
different granularities against the sparsity issue. The experimental analysis
on multiple benchmark datasets demonstrates the superiority of the proposed
model and also elucidates the rationality of the hypergraph modeling and the
double-scale self-supervision.
","[{'version': 'v1', 'created': 'Thu, 9 Sep 2021 12:19:49 GMT'}, {'version': 'v2', 'created': 'Sun, 20 Mar 2022 05:22:31 GMT'}]",2022-03-22,"[['Zhang', 'Junwei', ''], ['Gao', 'Min', ''], ['Yu', 'Junliang', ''], ['Guo', 'Lei', ''], ['Li', 'Jundong', ''], ['Yin', 'Hongzhi', '']]","['Group Recommendation', 'Graph Neural Networks', 'HypergraphLearning', 'Self-Supervised Learning']"
9285,2208.04261,Alberto Bacchelli,"Larissa Braz, Alberto Bacchelli",Software Security during Modern Code Review: The Developer's Perspective,"This paper has been accepted at ESEC/FSE '22 (30th ACM Joint European
  Software Engineering Conference and Symposium on the Foundations of Software
  Engineering)",,10.1145/3540250.3549135,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  To avoid software vulnerabilities, organizations are shifting security to
earlier stages of the software development, such as at code review time. In
this paper, we aim to understand the developers' perspective on assessing
software security during code review, the challenges they encounter, and the
support that companies and projects provide. To this end, we conduct a two-step
investigation: we interview 10 professional developers and survey 182
practitioners about software security assessment during code review. The
outcome is an overview of how developers perceive software security during code
review and a set of identified challenges. Our study revealed that most
developers do not immediately report to focus on security issues during code
review. Only after being asked about software security, developers state to
always consider it during review and acknowledge its importance. Most companies
do not provide security training, yet expect developers to still ensure
security during reviews. Accordingly, developers report the lack of training
and security knowledge as the main challenges they face when checking for
security issues. In addition, they have challenges with third-party libraries
and to identify interactions between parts of code that could have security
implications. Moreover, security may be disregarded during reviews due to
developers' assumptions about the security dynamic of the application they
develop.
  Data and materials: https://doi.org/10.5281/zenodo.6875435
","[{'version': 'v1', 'created': 'Mon, 8 Aug 2022 16:50:10 GMT'}]",2022-08-09,"[['Braz', 'Larissa', ''], ['Bacchelli', 'Alberto', '']]","['code review', 'security', 'software vulnerabilities']"
9286,2007.06308,Alireza Shojaifar,Alireza Shojaifar and Samuel A. Fricker,SMEs' Confidentiality Concerns for Security Information Sharing,"10 pages, 2 figures, 14th International Symposium on Human Aspects of
  Information Security & Assurance (HAISA 2020)",,10.1007/978-3-030-57404-8_22,,cs.CY cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Small and medium-sized enterprises are considered an essential part of the EU
economy, however, highly vulnerable to cyberattacks. SMEs have specific
characteristics which separate them from large companies and influence their
adoption of good cybersecurity practices. To mitigate the SMEs' cybersecurity
adoption issues and raise their awareness of cyber threats, we have designed a
self-paced security assessment and capability improvement method, CYSEC. CYSEC
is a security awareness and training method that utilises self-reporting
questionnaires to collect companies' information about cybersecurity awareness,
practices, and vulnerabilities to generate automated recommendations for
counselling. However, confidentiality concerns about cybersecurity information
have an impact on companies' willingness to share their information. Security
information sharing decreases the risk of incidents and increases users'
self-efficacy in security awareness programs. This paper presents the results
of semi-structured interviews with seven chief information security officers of
SMEs to evaluate the impact of online consent communication on motivation for
information sharing. The results were analysed in respect of the Self
Determination Theory. The findings demonstrate that online consent with
multiple options for indicating a suitable level of agreement improved
motivation for information sharing. This allows many SMEs to participate in
security information sharing activities and supports security experts to have a
better overview of common vulnerabilities. The final publication is available
at Springer via https://doi.org/10.1007/978-3-030-57404-8_22
","[{'version': 'v1', 'created': 'Mon, 13 Jul 2020 10:59:40 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Jul 2021 16:19:50 GMT'}]",2021-07-23,"[['Shojaifar', 'Alireza', ''], ['Fricker', 'Samuel A.', '']]","['Cybersecurity', 'Small and medium-sized enterprises', 'Online consent', 'Confidentiality concerns', 'Information sharing']"
9287,2111.11435,Bo Yang,"Zhehao Zhao, Bo Yang, Ge Li, Huai Liu, Zhi Jin","Precise Learning of Source Code Contextual Semantics via Hierarchical
  Dependence Structure and Graph Attention Networks","17pages, published on Journal of Systems and Software","Journal of Systems and Software, Volume 184, 2022, 111108, ISSN
  0164-1212",10.1016/j.jss.2021.111108,,cs.SE cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Deep learning is being used extensively in a variety of software engineering
tasks, e.g., program classification and defect prediction. Although the
technique eliminates the required process of feature engineering, the
construction of source code model significantly affects the performance on
those tasks. Most recent works was mainly focused on complementing AST-based
source code models by introducing contextual dependencies extracted from CFG.
However, all of them pay little attention to the representation of basic
blocks, which are the basis of contextual dependencies.
  In this paper, we integrated AST and CFG and proposed a novel source code
model embedded with hierarchical dependencies. Based on that, we also designed
a neural network that depends on the graph attention mechanism.Specifically, we
introduced the syntactic structural of the basic block, i.e., its corresponding
AST, in source code model to provide sufficient information and fill the gap.
We have evaluated this model on three practical software engineering tasks and
compared it with other state-of-the-art methods. The results show that our
model can significantly improve the performance. For example, compared to the
best performing baseline, our model reduces the scale of parameters by 50\% and
achieves 4\% improvement on accuracy on program classification task.
","[{'version': 'v1', 'created': 'Sat, 20 Nov 2021 04:03:42 GMT'}]",2021-11-24,"[['Zhao', 'Zhehao', ''], ['Yang', 'Bo', ''], ['Li', 'Ge', ''], ['Liu', 'Huai', ''], ['Jin', 'Zhi', '']]","['Graph Neural Network', 'Program Analysis', 'Deep Learning', 'Abstract Syntax Tree', 'Control FlowGraph1']"
9288,2112.14811,Ruoyu Wang,Ruoyu Wang,Active Learning-Based Optimization of Scientific Experimental Design,"2021 2nd International Conference on Artificial Intelligence and
  Computer Engineering (ICAICE 2021)",,10.1109/ICAICE54393.2021.00060,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Active learning (AL) is a machine learning algorithm that can achieve greater
accuracy with fewer labeled training instances, for having the ability to ask
oracles to label the most valuable unlabeled data chosen iteratively and
heuristically by query strategies. Scientific experiments nowadays, though
becoming increasingly automated, are still suffering from human involvement in
the designing process and the exhaustive search in the experimental space. This
article performs a retrospective study on a drug response dataset using the
proposed AL scheme comprised of the matrix factorization method of alternating
least square (ALS) and deep neural networks (DNN). This article also proposes
an AL query strategy based on expected loss minimization. As a result, the
retrospective study demonstrates that scientific experimental design, instead
of being manually set, can be optimized by AL, and the proposed query strategy
ELM sampling shows better experimental performance than other ones such as
random sampling and uncertainty sampling.
","[{'version': 'v1', 'created': 'Wed, 29 Dec 2021 20:02:35 GMT'}]",2022-09-30,"[['Wang', 'Ruoyu', '']]","['Machine Learning', 'Active Learning', 'Scientific Experiment Design', 'Alternating Least Square', 'Deep Neural Network']"
9289,2205.11995,Michael Burkhart,Michael C. Burkhart and Kyle Shan,Deep Low-Density Separation for Semi-Supervised Classification,,"Computational Science - ICCS 2020: 20th International Conference,
  Amsterdam, The Netherlands, June 3-5, 2020, Proceedings, Part III, pp.
  297-311",10.1007/978-3-030-50420-5_22,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a small set of labeled data and a large set of unlabeled data,
semi-supervised learning (SSL) attempts to leverage the location of the
unlabeled datapoints in order to create a better classifier than could be
obtained from supervised methods applied to the labeled training set alone.
Effective SSL imposes structural assumptions on the data, e.g. that neighbors
are more likely to share a classification or that the decision boundary lies in
an area of low density. For complex and high-dimensional data, neural networks
can learn feature embeddings to which traditional SSL methods can then be
applied in what we call hybrid methods.
  Previously-developed hybrid methods iterate between refining a latent
representation and performing graph-based SSL on this representation. In this
paper, we introduce a novel hybrid method that instead applies low-density
separation to the embedded features. We describe it in detail and discuss why
low-density separation may be better suited for SSL on neural network-based
embeddings than graph-based algorithms. We validate our method using in-house
customer survey data and compare it to other state-of-the-art learning methods.
Our approach effectively classifies thousands of unlabeled users from a
relatively small number of hand-classified examples.
","[{'version': 'v1', 'created': 'Sun, 22 May 2022 11:00:55 GMT'}]",2022-05-25,"[['Burkhart', 'Michael C.', ''], ['Shan', 'Kyle', '']]","['Semi-supervised learning', 'low-density separation', 'deep learning', 'user classification from survey data']"
9290,2005.03370,Parham Hadikhani,"Meysam Yari, Parham Hadikhani and Zohreh Asgharzadeh","Energy-efficient topology to enhance the wireless sensor network
  lifetime using connectivity control",,"Telecommunications and the Digital Economy, vol. 8, no. 3,
  September 2020, pp. 68-84",10.18080/jtde.v8n3.255,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless sensor networks have attracted much attention because of many
applications in the fields of industry, military, medicine, agriculture, and
education. In addition, the vast majority of researches has been done to expand
its applications and improve its efficiency. However, there are still many
challenges for increasing the efficiency in different parts of this network.
One of the most important parts is to improve the network lifetime in the
wireless sensor network. Since the sensor nodes are generally powered by
batteries, the most important issue to consider in these types of networks is
to reduce the power consumption of the nodes in such a way as to increase the
network lifetime to an acceptable level. The contribution of this paper is
using topology control, the threshold for the remaining energy in nodes, and
two of the meta-algorithms include SA (Simulated annealing) and VNS (Variable
Neighbourhood Search) to increase the energy remaining in the sensors.
Moreover, using a low-cost spanning tree, an appropriate connectivity control
among nodes is created in the network in order to increase the network
lifetime. The results of simulations show that the proposed method improves the
sensor lifetime and reduces the energy consumed.
","[{'version': 'v1', 'created': 'Thu, 7 May 2020 10:19:41 GMT'}, {'version': 'v2', 'created': 'Sat, 27 Jun 2020 09:06:03 GMT'}, {'version': 'v3', 'created': 'Tue, 13 Oct 2020 19:51:05 GMT'}]",2020-10-15,"[['Yari', 'Meysam', ''], ['Hadikhani', 'Parham', ''], ['Asgharzadeh', 'Zohreh', '']]","['Wireless Sensor Network', 'Connectivity Control', 'Lifetime', 'Meta-heuristic Algorithm', 'Energy Efficient']"
9291,1903.05875,Sebastian Stefan Feger,"Sebastian S. Feger, S\""unje Dallmeier-Tiessen, Albrecht Schmidt,
  Pawe{\l} W. Wo\'zniak","Designing for Reproducibility: A Qualitative Study of Challenges and
  Opportunities in High Energy Physics","Accepted for publication at the 2019 Conference on Human Factors in
  Computing Systems (CHI 2019)",,10.1145/3290605.3300685,,cs.HC hep-ex,http://creativecommons.org/licenses/by/4.0/,"  Reproducibility should be a cornerstone of scientific research and is a
growing concern among the scientific community and the public. Understanding
how to design services and tools that support documentation, preservation and
sharing is required to maximize the positive impact of scientific research. We
conducted a study of user attitudes towards systems that support data
preservation in High Energy Physics, one of science's most data-intensive
branches. We report on our interview study with 12 experimental physicists,
studying requirements and opportunities in designing for research preservation
and reproducibility. Our findings suggest that we need to design for motivation
and benefits in order to stimulate contributions and to address the observed
scalability challenge. Therefore, researchers' attitudes towards communication,
uncertainty, collaboration and automation need to be reflected in design. Based
on our findings, we present a systematic view of user needs and constraints
that define the design space of systems supporting reproducible practices.
","[{'version': 'v1', 'created': 'Thu, 14 Mar 2019 09:48:17 GMT'}]",2019-03-15,"[['Feger', 'Sebastian S.', ''], ['Dallmeier-Tiessen', 'Sünje', ''], ['Schmidt', 'Albrecht', ''], ['Woźniak', 'Paweł W.', '']]","['Reproducible Research', 'Design Requirements', 'Interview Study', 'Secondary Usage Forms']"
9292,1911.00995,Nicholas James,"Nick James, Max Menzies, Lamiae Azizi, Jennifer Chan","Novel semi-metrics for multivariate change point analysis and anomaly
  detection","Accepted manuscript. Minor edits since v2. Equal contribution from
  first two authors",Physica D: Nonlinear Phenomena 412 (2020) 132636,10.1016/j.physd.2020.132636,,cs.LG math.DS stat.CO stat.ME stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a new method for determining similarity and anomalies
between time series, most practically effective in large collections of (likely
related) time series, by measuring distances between structural breaks within
such a collection. We introduce a class of \emph{semi-metric} distance
measures, which we term \emph{MJ distances}. These semi-metrics provide an
advantage over existing options such as the Hausdorff and Wasserstein metrics.
We prove they have desirable properties, including better sensitivity to
outliers, while experiments on simulated data demonstrate that they uncover
similarity within collections of time series more effectively. Semi-metrics
carry a potential disadvantage: without the triangle inequality, they may not
satisfy a ""transitivity property of closeness."" We analyse this failure with
proof and introduce an computational method to investigate, in which we
demonstrate that our semi-metrics violate transitivity infrequently and mildly.
Finally, we apply our methods to cryptocurrency and measles data, introducing a
judicious application of eigenvalue analysis.
","[{'version': 'v1', 'created': 'Mon, 4 Nov 2019 00:04:30 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Feb 2020 14:58:46 GMT'}, {'version': 'v3', 'created': 'Fri, 3 Jul 2020 10:44:42 GMT'}]",2020-12-01,"[['James', 'Nick', ''], ['Menzies', 'Max', ''], ['Azizi', 'Lamiae', ''], ['Chan', 'Jennifer', '']]","['semi-metrics', 'change-point detection', 'multivariate analysis', 'timeseries', 'anomaly detection']"
9293,2202.06197,Luisito Lacatan,"Christie A. Luzon, Luisito Lolong Lacatan, Harold Y. Bangalisan,
  Jayvee M. Osapdin",Web-Based File Clustering and Indexing for Mindoro State University,"11 pages, 9 figures, 1 table","International Journal of Computing Sciences Research, 2022",10.25147/ijcsr.2017.001.1.82,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Web Based File Clustering and Indexing for Mindoro State University aim
to organize data circulated over the Web into groups or collections to
facilitate data availability and access and at the same time meet user
preferences. The main benefits include increasing Web information
accessibility, understanding users navigation behavior, improving information
retrieval and content delivery on the Web. Web based file clustering could help
in reaching the required documents that the user is searching for. In this
paper a novel approach has been introduced for search results clustering that
is based on the semantics of the retrieved documents rather than the syntax of
the terms in those documents. Data clustering was used to improve the
information retrieval from the collection of documents. Data were processed and
analyzed using SPSS where the instrument was evaluated to test the reliability
and validity of the measures used. Evaluation was based on a Likert scale of
Excellent, Good, Fair, and Poor as described for the selected quality
characteristics.
","[{'version': 'v1', 'created': 'Sun, 13 Feb 2022 04:06:13 GMT'}]",2022-02-15,"[['Luzon', 'Christie A.', ''], ['Lacatan', 'Luisito Lolong', ''], ['Bangalisan', 'Harold Y.', ''], ['Osapdin', 'Jayvee M.', '']]","['clustering', 'indexing', 'retrieval', 'web-based', 'semantics  INTRODUCTION']"
9294,2004.12465,Mingmou Liu,"Mingmou Liu, Yitong Yin, Huacheng Yu",Succinct Filters for Sets of Unknown Sizes,Full version of the paper accepted to ICALP 2020,,10.4230/LIPIcs.ICALP.2020.79,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The membership problem asks to maintain a set $S\subseteq[u]$, supporting
insertions and membership queries, i.e., testing if a given element is in the
set. A data structure that computes exact answers is called a dictionary. When
a (small) false positive rate $\epsilon$ is allowed, the data structure is
called a filter.
  The space usages of the standard dictionaries or filters usually depend on
the upper bound on the size of $S$, while the actual set can be much smaller.
  Pagh, Segev and Wieder (FOCS'13) were the first to study filters with varying
space usage based on the current $|S|$. They showed in order to match the space
with the current set size $n=|S|$, any filter data structure must use
$(1-o(1))n(\log(1/\epsilon)+(1-O(\epsilon))\log\log n)$ bits, in contrast to
the well-known lower bound of $N\log(1/\epsilon)$ bits, where $N$ is an upper
bound on $|S|$. They also presented a data structure with almost optimal space
of $(1+o(1))n(\log(1/\epsilon)+O(\log\log n))$ bits provided that
$n>u^{0.001}$, with expected amortized constant insertion time and worst-case
constant lookup time.
  In this work, we present a filter data structure with improvements in two
aspects:
  - it has constant worst-case time for all insertions and lookups with high
probability;
  - it uses space $(1+o(1))n(\log (1/\epsilon)+\log\log n)$ bits when
$n>u^{0.001}$, achieving optimal leading constant for all $\epsilon=o(1)$.
  We also present a dictionary that uses $(1+o(1))n\log(u/n)$ bits of space,
matching the optimal space in terms of the current size, and performs all
operations in constant time with high probability.
","[{'version': 'v1', 'created': 'Sun, 26 Apr 2020 20:05:56 GMT'}]",2020-04-28,"[['Liu', 'Mingmou', ''], ['Yin', 'Yitong', ''], ['Yu', 'Huacheng', '']]","['Bloom filters', 'Data structures', 'Approximate set membership', 'Dictionaries']"
9295,2003.03133,Kshitij Tiwari,"Kshitij Tiwari, Ville Kyrki, Allen Cheung, Naohide Yamamoto","DeFINE: Delayed Feedback based Immersive Navigation Environment for
  Studying Goal-Directed Human Navigation","43 pages, 10 figures, 5 tables, Submitted to Behavioral Research
  Methods",Behav Res (2021),10.3758/s13428-021-01586-6,,cs.HC cs.AI cs.LG cs.RO,http://creativecommons.org/licenses/by/4.0/,"  With the advent of consumer-grade products for presenting an immersive
virtual environment (VE), there is a growing interest in utilizing VEs for
testing human navigation behavior. However, preparing a VE still requires a
high level of technical expertise in computer graphics and virtual reality,
posing a significant hurdle to embracing the emerging technology. To address
this issue, this paper presents Delayed Feedback based Immersive Navigation
Environment (DeFINE), a framework that allows for easy creation and
administration of navigation tasks within customizable VEs via intuitive
graphical user interfaces and simple settings files. Importantly, DeFINE has a
built-in capability to provide performance feedback to participants during an
experiment, a feature that is critically missing in other similar frameworks.
To show the usability of DeFINE from both experimentalists' and participants'
perspectives, a demonstration was made in which participants navigated to a
hidden goal location with feedback that differentially weighted speed and
accuracy of their responses. In addition, the participants evaluated DeFINE in
terms of its ease of use, required workload, and proneness to induce
cybersickness. The demonstration exemplified typical experimental manipulations
DeFINE accommodates and what types of data it can collect for characterizing
participants' task performance. With its out-of-the-box functionality and
potential customizability due to open-source licensing, DeFINE makes VEs more
accessible to many researchers.
","[{'version': 'v1', 'created': 'Fri, 6 Mar 2020 11:00:12 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Feb 2021 09:03:41 GMT'}]",2021-05-25,"[['Tiwari', 'Kshitij', ''], ['Kyrki', 'Ville', ''], ['Cheung', 'Allen', ''], ['Yamamoto', 'Naohide', '']]","['Virtual reality', 'Software', 'Closed-loop', 'Locomotion', 'Gamification', 'Unity']"
9296,2003.04776,Mirko Myllykoski,Carl Christian Kjelgaard Mikkelsen and Mirko Myllykoski,"Parallel Robust Computation of Generalized Eigenvectors of Matrix
  Pencils","This manuscript was accepted to 13th International Conference on
  Parallel Processing and Applied Mathematics (PPAM2019), Bialystok, Poland,
  September 8-11, 2019. The final authenticated version is available online at
  https://doi.org/10.1007/978-3-030-43229-4_6 (DOI valid from May 8, 2020
  onward). First author's first name is ""Carl Christian"" and last name
  ""Kjelgaard Mikkelsen""",LNCS 12043 (2020) 58-69,10.1007/978-3-030-43229-4_6,,cs.MS cs.DC cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider the problem of computing generalized eigenvectors
of a matrix pencil in real Schur form. In exact arithmetic, this problem can be
solved using substitution. In practice, substitution is vulnerable to
floating-point overflow. The robust solvers xTGEVC in LAPACK prevent overflow
by dynamically scaling the eigenvectors. These subroutines are sequential
scalar codes which compute the eigenvectors one by one. In this paper we
discuss how to derive robust blocked algorithms. The new StarNEig library
contains a robust task-parallel solver Zazamoukh which runs on top of StarPU.
Our numerical experiments show that Zazamoukh achieves a super-linear speedup
compared with DTGEVC for sufficiently large matrices.
","[{'version': 'v1', 'created': 'Tue, 10 Mar 2020 14:37:39 GMT'}]",2020-03-23,"[['Mikkelsen', 'Carl Christian Kjelgaard', ''], ['Myllykoski', 'Mirko', '']]","['generalized eigenvectors', 'overflow protection', 'task-parallelism']"
9297,2003.11410,Ana Tanevska,"Ana Tanevska, Francesco Rea, Giulio Sandini, Lola Ca\~namero,
  Alessandra Sciutti",A Socially Adaptable Framework for Human-Robot Interaction,,,10.3389/frobt.2020.00121,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In our everyday lives we are accustomed to partake in complex, personalized,
adaptive interactions with our peers. For a social robot to be able to recreate
this same kind of rich, human-like interaction, it should be aware of our needs
and affective states and be capable of continuously adapting its behavior to
them. One proposed solution to this problem would involve the robot to learn
how to select the behaviors that would maximize the pleasantness of the
interaction for its peers, guided by an internal motivation system that would
provide autonomy to its decision-making process. We are interested in studying
how an adaptive robotic framework of this kind would function and personalize
to different users. In addition we explore whether including the element of
adaptability and personalization in a cognitive framework will bring any
additional richness to the human-robot interaction (HRI), or if it will instead
bring uncertainty and unpredictability that would not be accepted by the
robot`s human peers. To this end, we designed a socially-adaptive framework for
the humanoid robot iCub which allows it to perceive and reuse the affective and
interactive signals from the person as input for the adaptation based on
internal social motivation. We propose a comparative interaction study with
iCub where users act as the robot's caretaker, and iCub's social adaptation is
guided by an internal comfort level that varies with the amount of stimuli iCub
receives from its caretaker. We investigate and compare how the internal
dynamics of the robot would be perceived by people in a condition when the
robot does not personalize its interaction, and in a condition where it is
adaptive. Finally, we establish the potential benefits that an adaptive
framework could bring to the context of having repeated interactions with a
humanoid robot.
","[{'version': 'v1', 'created': 'Wed, 25 Mar 2020 13:53:12 GMT'}]",2020-10-26,"[['Tanevska', 'Ana', ''], ['Rea', 'Francesco', ''], ['Sandini', 'Giulio', ''], ['Cañamero', 'Lola', ''], ['Sciutti', 'Alessandra', '']]","['human-robot interaction', 'social adaptability', 'affective interaction', 'personalized HRI', 'emotionrecognition']"
9298,2209.04791,Lili Quan,"Lili Quan, Qianyu Guo, Xiaofei Xie, Sen Chen, Xiaohong Li, Yang Liu","Towards Understanding the Faults of JavaScript-Based Deep Learning
  Systems","13 pages, 8 figures, ASE 2022",,10.1145/3551349.3560427,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quality assurance is of great importance for deep learning (DL) systems,
especially when they are applied in safety-critical applications. While quality
issues of native DL applications have been extensively analyzed, the issues of
JavaScript-based DL applications have never been systematically studied.
Compared with native DL applications, JavaScript-based DL applications can run
on major browsers, making the platform- and device-independent. Specifically,
the quality of JavaScript-based DL applications depends on the 3 parts: the
application, the third-party DL library used and the underlying DL framework
(e.g., TensorFlow.js), called JavaScript-based DL system. In this paper, we
conduct the first empirical study on the quality issues of JavaScript-based DL
systems. Specifically, we collect and analyze 700 real-world faults from
relevant GitHub repositories, including the official TensorFlow.js repository,
13 third-party DL libraries, and 58 JavaScript-based DL applications. To better
understand the characteristics of these faults, we manually analyze and
construct taxonomies for the fault symptoms, root causes, and fix patterns,
respectively. Moreover, we also study the fault distributions of symptoms and
root causes, in terms of the different stages of the development lifecycle, the
3-level architecture in the DL system, and the 4 major components of
TensorFlow.js framework. Based on the results, we suggest actionable
implications and research avenues that can potentially facilitate the
development, testing, and debugging of JavaScript-based DL systems.
","[{'version': 'v1', 'created': 'Sun, 11 Sep 2022 05:39:54 GMT'}]",2022-09-13,"[['Quan', 'Lili', ''], ['Guo', 'Qianyu', ''], ['Xie', 'Xiaofei', ''], ['Chen', 'Sen', ''], ['Li', 'Xiaohong', ''], ['Liu', 'Yang', '']]","['JavaScript', 'Deep Learning', 'TensorFlow']"
9299,2109.12813,Yeshwanth Bethi,"Yeshwanth Bethi, Ying Xu, Gregory Cohen, Andre van Schaik, Saeed
  Afshar",An optimised deep spiking neural network architecture without gradients,"18 pages, 6 figures","IEEE Access, 2022",10.1109/ACCESS.2022.3200699,,cs.NE cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We present an end-to-end trainable modular event-driven neural architecture
that uses local synaptic and threshold adaptation rules to perform
transformations between arbitrary spatio-temporal spike patterns. The
architecture represents a highly abstracted model of existing Spiking Neural
Network (SNN) architectures. The proposed Optimized Deep Event-driven Spiking
neural network Architecture (ODESA) can simultaneously learn hierarchical
spatio-temporal features at multiple arbitrary time scales. ODESA performs
online learning without the use of error back-propagation or the calculation of
gradients. Through the use of simple local adaptive selection thresholds at
each node, the network rapidly learns to appropriately allocate its neuronal
resources at each layer for any given problem without using a real-valued error
measure. These adaptive selection thresholds are the central feature of ODESA,
ensuring network stability and remarkable robustness to noise as well as to the
selection of initial system parameters. Network activations are inherently
sparse due to a hard Winner-Take-All (WTA) constraint at each layer. We
evaluate the architecture on existing spatio-temporal datasets, including the
spike-encoded IRIS and TIDIGITS datasets, as well as a novel set of tasks based
on International Morse Code that we created. These tests demonstrate the
hierarchical spatio-temporal learning capabilities of ODESA. Through these
tests, we demonstrate ODESA can optimally solve practical and highly
challenging hierarchical spatio-temporal learning tasks with the minimum
possible number of computing nodes.
","[{'version': 'v1', 'created': 'Mon, 27 Sep 2021 05:59:12 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Oct 2021 03:59:53 GMT'}, {'version': 'v3', 'created': 'Mon, 2 May 2022 20:45:29 GMT'}]",2022-09-23,"[['Bethi', 'Yeshwanth', ''], ['Xu', 'Ying', ''], ['Cohen', 'Gregory', ''], ['van Schaik', 'Andre', ''], ['Afshar', 'Saeed', '']]","['Local Learning', 'Neuromorphic Feature Extraction', 'Spiking Neural Networks', 'Spike-Timing-DependentPlasticity', 'Supervised Learning']"
9300,1506.06193,Xinhua Wang,"Xinhua Wang, Zengqiang Chen, Zhuzhi Yuan",Modeling and control of an agile tail-sitter aircraft,,,10.1016/j.jfranklin.2015.09.012,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a model of an agile tail-sitter aircraft, which can
operate as a helicopter as well as capable of transition to fixed-wing flight.
Aerodynamics of the co-axial counter-rotating propellers with quad rotors are
analysed under the condition that the co-axial is operated at equal rotor
torque (power). A finite-time convergent observer based on Lyapunov function is
presented to estimate the unknown nonlinear terms in co-axial counter-rotating
propellers, the uncertainties and external disturbances during mode transition.
Furthermore, a simple controller based on the finite-time convergent observer
and quaternion method is designed to implement mode transition.
","[{'version': 'v1', 'created': 'Sat, 20 Jun 2015 02:21:59 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Jul 2015 03:40:37 GMT'}]",2015-11-30,"[['Wang', 'Xinhua', ''], ['Chen', 'Zengqiang', ''], ['Yuan', 'Zhuzhi', '']]","['Tail-sitter aircraft', 'co-axial counter-rotating', 'fixed-wing flight', 'mode transition']"
9301,2211.16043,Xevi Roca,"Albert Jim\'enez-Ramos, Abel Gargallo-Peir\'o, Xevi Roca",Interpolation of subdivision features for curved geometry modeling,,"Computer-Aided Design, 145, 2022",10.1016/j.cad.2021.103185,,cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We present a nodal interpolation method to approximate a subdivision model.
The main application is to model and represent curved geometry without gaps and
preserving the required simulation intent. Accordingly, we devise the technique
to maintain the necessary sharp features and smooth the indicated ones. This
sharp-to-smooth modeling capability handles unstructured configurations of the
simulation points, curves, and surfaces. The surfaces correspond to initial
linear triangulations that determine the sharp point and curve features. The
method automatically suggests a subset of sharp features to smooth which the
user modifies to obtain a limit model preserving the initial points. This model
reconstructs the curvature by subdivision of the initial mesh, with no need of
an underlying curved geometry model. Finally, given a polynomial degree and a
nodal distribution, the method generates a piece-wise polynomial representation
interpolating the limit model. We show numerical evidence that this
approximation, naturally aligned to the subdivision features, converges to the
model geometrically with the polynomial degree for nodal distributions with
sub-optimal Lebesgue constant. We also apply the method to prescribe the curved
boundary of a high-order volume mesh. We conclude that our sharp-to-smooth
modeling capability leads to curved geometry representations with enhanced
preservation of the simulation intent.
","[{'version': 'v1', 'created': 'Tue, 29 Nov 2022 09:27:56 GMT'}]",2022-11-30,"[['Jiménez-Ramos', 'Albert', ''], ['Gargallo-Peiró', 'Abel', ''], ['Roca', 'Xevi', '']]","['mesh curving', 'surrogate geometry', 'geometry modeling', 'subdivision', 'blending']"
9302,1707.09320,Dingwen Tao,"Dingwen Tao, Sheng Di, Hanqi Guo, Zizhong Chen, Franck Cappello","Z-checker: A Framework for Assessing Lossy Compression of Scientific
  Data","Accepted by The International Journal of High Performance Computing
  Application",,10.1177/1094342017737147,,cs.OH astro-ph.IM cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Because of vast volume of data being produced by today's scientific
simulations and experiments, lossy data compressor allowing user-controlled
loss of accuracy during the compression is a relevant solution for
significantly reducing the data size. However, lossy compressor developers and
users are missing a tool to explore the features of scientific datasets and
understand the data alteration after compression in a systematic and reliable
way. To address this gap, we have designed and implemented a generic framework
called Z-checker. On the one hand, Z-checker combines a battery of data
analysis components for data compression. On the other hand, Z-checker is
implemented as an open-source community tool to which users and developers can
contribute and add new analysis components based on their additional analysis
demands. In this paper, we present a survey of existing lossy compressors. Then
we describe the design framework of Z-checker, in which we integrated
evaluation metrics proposed in prior work as well as other analysis tools.
Specifically, for lossy compressor developers, Z-checker can be used to
characterize critical properties of any dataset to improve compression
strategies. For lossy compression users, Z-checker can detect the compression
quality, provide various global distortion analysis comparing the original data
with the decompressed data and statistical analysis of the compression error.
Z-checker can perform the analysis with either coarse granularity or fine
granularity, such that the users and developers can select the best-fit,
adaptive compressors for different parts of the dataset. Z-checker features a
visualization interface displaying all analysis results in addition to some
basic views of the datasets such as time series. To the best of our knowledge,
Z-checker is the first tool designed to assess lossy compression
comprehensively for scientific datasets.
","[{'version': 'v1', 'created': 'Mon, 12 Jun 2017 18:09:33 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Nov 2017 20:16:10 GMT'}]",2017-11-15,"[['Tao', 'Dingwen', ''], ['Di', 'Sheng', ''], ['Guo', 'Hanqi', ''], ['Chen', 'Zizhong', ''], ['Cappello', 'Franck', '']]","['Framework', 'lossy compression', 'assessment tool', 'data analytics', 'scientific data', 'visualization']"
9303,1909.04427,Mykhailo Vladymyrov,"Mykhailo Vladymyrov, Akitaka Ariga","Novel tracking approach based on fully-unsupervised disentanglement of
  the geometrical factors of variation",Accepted for publication in JINST,,10.1088/1748-0221/15/03/P03009,,cs.CV hep-ex,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efficient tracking algorithms are a crucial part of particle tracking
detectors. While a lot of work has been done in designing a plethora of
algorithms, these usually require tedious tuning for each use case. (Weakly)
supervised Machine Learning-based approaches can leverage the actual raw data
for maximal performance. Yet in realistic scenarios, sufficient high-quality
labeled data is not available. While training might be performed on simulated
data, the reproduction of realistic signal and noise in the detector requires
substantial effort, compromising this approach.
  Here we propose a novel, fully unsupervised, approach to track
reconstruction. The introduced model for learning to disentangle the factors of
variation in a geometrically meaningful way employs geometrical space
invariances. We train it through constraints on the equivariance between the
image space and the latent representation in a Deep Convolutional Autoencoder.
Using experimental results on synthetic data we show that a combination of
different space transformations is required for meaningful disentanglement of
factors of variation. We also demonstrate the performance of our model on real
data from tracking detectors.
","[{'version': 'v1', 'created': 'Tue, 10 Sep 2019 12:05:59 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Feb 2020 15:29:58 GMT'}]",2020-04-22,"[['Vladymyrov', 'Mykhailo', ''], ['Ariga', 'Akitaka', '']]","['Unsupervised Learning', 'Disentangling factors of variation', 'particle tracking']"
9304,2009.05474,Antonio Emanuele Cin\`a,"Antonio Emanuele Cin\`a, Alessandro Torcinovich, Marcello Pelillo",A black-box adversarial attack for poisoning clustering,"18 pages, Pattern Recognition 2022",Pattern Recognition 2022,10.1016/j.patcog.2021.108306,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering algorithms play a fundamental role as tools in decision-making and
sensible automation processes. Due to the widespread use of these applications,
a robustness analysis of this family of algorithms against adversarial noise
has become imperative. To the best of our knowledge, however, only a few works
have currently addressed this problem. In an attempt to fill this gap, in this
work, we propose a black-box adversarial attack for crafting adversarial
samples to test the robustness of clustering algorithms. We formulate the
problem as a constrained minimization program, general in its structure and
customizable by the attacker according to her capability constraints. We do not
assume any information about the internal structure of the victim clustering
algorithm, and we allow the attacker to query it as a service only. In the
absence of any derivative information, we perform the optimization with a
custom approach inspired by the Abstract Genetic Algorithm (AGA). In the
experimental part, we demonstrate the sensibility of different single and
ensemble clustering algorithms against our crafted adversarial samples on
different scenarios. Furthermore, we perform a comparison of our algorithm with
a state-of-the-art approach showing that we are able to reach or even
outperform its performance. Finally, to highlight the general nature of the
generated noise, we show that our attacks are transferable even against
supervised algorithms such as SVMs, random forests, and neural networks.
","[{'version': 'v1', 'created': 'Wed, 9 Sep 2020 18:19:31 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Sep 2021 12:30:58 GMT'}, {'version': 'v3', 'created': 'Thu, 30 Sep 2021 08:39:03 GMT'}, {'version': 'v4', 'created': 'Wed, 10 Nov 2021 15:34:58 GMT'}]",2021-11-11,"[['Cinà', 'Antonio Emanuele', ''], ['Torcinovich', 'Alessandro', ''], ['Pelillo', 'Marcello', '']]","['Clustering', 'Adversarial machine learning', 'Secure machine learning', 'Unsupervised learning']"
9305,2201.06638,"Nicolas Pr\""ollochs","Kirill Solovev, Nicolas Pr\""ollochs","Hate Speech in the Political Discourse on Social Media: Disparities
  Across Parties, Gender, and Ethnicity",,,10.1145/3485447.3512261,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media has become an indispensable channel for political communication.
However, the political discourse is increasingly characterized by hate speech,
which affects not only the reputation of individual politicians but also the
functioning of society at large. In this work, we empirically analyze how the
amount of hate speech in replies to posts from politicians on Twitter depends
on personal characteristics, such as their party affiliation, gender, and
ethnicity. For this purpose, we employ Twitter's Historical API to collect
every tweet posted by members of the 117th U.S. Congress for an observation
period of more than six months. Additionally, we gather replies for each tweet
and use machine learning to predict the amount of hate speech they embed.
Subsequently, we implement hierarchical regression models to analyze whether
politicians with certain characteristics receive more hate speech. We find that
tweets are particularly likely to receive hate speech in replies if they are
authored by (i) persons of color from the Democratic party, (ii) white
Republicans, and (iii) women. Furthermore, our analysis reveals that more
negative sentiment (in the source tweet) is associated with more hate speech
(in replies). However, the association varies across parties: negative
sentiment attracts more hate speech for Democrats (vs. Republicans).
Altogether, our empirical findings imply significant differences in how
politicians are treated on social media depending on their party affiliation,
gender, and ethnicity.
","[{'version': 'v1', 'created': 'Mon, 17 Jan 2022 21:41:12 GMT'}]",2022-05-30,"[['Solovev', 'Kirill', ''], ['Pröllochs', 'Nicolas', '']]","['Social media', 'political discourse', 'hate speech', 'sentiment analysis', 'disparities', 'computational social science', 'explanatory modeling']"
9306,2204.02725,Shicheng Xu,"Shicheng Xu, Liang Pang, Huawei Shen, Xueqi Cheng","Match-Prompt: Improving Multi-task Generalization Ability for Neural
  Text Matching via Prompt Learning",Accepted by CIKM 2022,,10.1145/3511808.3557388,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Text matching is a fundamental technique in both information retrieval and
natural language processing. Text matching tasks share the same paradigm that
determines the relationship between two given texts. The relationships vary
from task to task, e.g.~relevance in document retrieval, semantic alignment in
paraphrase identification and answerable judgment in question answering.
However, the essential signals for text matching remain in a finite scope,
i.e.~exact matching, semantic matching, and inference matching. Ideally, a good
text matching model can learn to capture and aggregate these signals for
different matching tasks to achieve competitive performance, while recent
state-of-the-art text matching models, e.g.~Pre-trained Language Models (PLMs),
are hard to generalize. It is because the end-to-end supervised learning on
task-specific dataset makes model overemphasize the data sample bias and
task-specific signals instead of the essential matching signals. To overcome
this problem, we adopt a specialization-generalization training strategy and
refer to it as Match-Prompt. In specialization stage, descriptions of different
matching tasks are mapped to a few prompt tokens. In generalization stage,
matching model explores the essential matching signals by being trained on
diverse matching tasks. High diverse matching tasks avoid model fitting the
data bias on a specific task, so that model can focus on learning the essential
matching signals. Meanwhile, the prompt tokens obtained in the first step help
the model distinguish different task-specific matching signals. Experimental
results on public datasets show that Match-Prompt can improve multi-task
generalization capability of PLMs in text matching and yield better in-domain
multi-task, out-of-domain multi-task and new task adaptation performance than
multi-task and task-specific models trained by previous fine-tuning paradigm.
","[{'version': 'v1', 'created': 'Wed, 6 Apr 2022 11:01:08 GMT'}, {'version': 'v2', 'created': 'Sat, 20 Aug 2022 02:08:02 GMT'}]",2022-08-23,"[['Xu', 'Shicheng', ''], ['Pang', 'Liang', ''], ['Shen', 'Huawei', ''], ['Cheng', 'Xueqi', '']]","['Text Matching', 'Prompt Learning', 'Multi-task Learning']"
9307,2207.14648,Yoav Alon,Yoav Alon and Cristina David,Using Graph Neural Networks for Program Termination,"ESEC/FSE 2022 - The 30th ACM Joint European Software Engineering
  Conference and Symposium on the Foundations of Software Engineering",,10.1145/1122445.1122456,,cs.SE cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Termination analyses investigate the termination behavior of programs,
intending to detect nontermination, which is known to cause a variety of
program bugs (e.g. hanging programs, denial-of-service vulnerabilities). Beyond
formal approaches, various attempts have been made to estimate the termination
behavior of programs using neural networks. However, the majority of these
approaches continue to rely on formal methods to provide strong soundness
guarantees and consequently suffer from similar limitations. In this paper, we
move away from formal methods and embrace the stochastic nature of machine
learning models. Instead of aiming for rigorous guarantees that can be
interpreted by solvers, our objective is to provide an estimation of a
program's termination behavior and of the likely reason for nontermination
(when applicable) that a programmer can use for debugging purposes. Compared to
previous approaches using neural networks for program termination, we also take
advantage of the graph representation of programs by employing Graph Neural
Networks. To further assist programmers in understanding and debugging
nontermination bugs, we adapt the notions of attention and semantic
segmentation, previously used for other application domains, to programs.
Overall, we designed and implemented classifiers for program termination based
on Graph Convolutional Networks and Graph Attention Networks, as well as a
semantic segmentation Graph Neural Network that localizes AST nodes likely to
cause nontermination. We also illustrated how the information provided by
semantic segmentation can be combined with program slicing to further aid
debugging.
","[{'version': 'v1', 'created': 'Thu, 28 Jul 2022 12:16:37 GMT'}]",2022-08-01,"[['Alon', 'Yoav', ''], ['David', 'Cristina', '']]","['Graph Neural Networks', 'Graph Attention Networks', 'Program Termination']"
9308,1801.09053,Thien Thai Mr,"Vinh D. Van, Thien Thai, Minh-Quoc Nghiem","Combining Convolution and Recursive Neural Networks for Sentiment
  Analysis","8 pages, 3 figures, Proceedings of the Eighth International Symposium
  on Information and Communication Technology. ACM, 2017",,10.1145/3155133.3155158,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the problem of sentence-level sentiment analysis. In
recent years, Convolution and Recursive Neural Networks have been proven to be
effective network architecture for sentence-level sentiment analysis.
Nevertheless, each of them has their own potential drawbacks. For alleviating
their weaknesses, we combined Convolution and Recursive Neural Networks into a
new network architecture. In addition, we employed transfer learning from a
large document-level labeled sentiment dataset to improve the word embedding in
our models. The resulting models outperform all recent Convolution and
Recursive Neural Networks. Beyond that, our models achieve comparable
performance with state-of-the-art systems on Stanford Sentiment Treebank.
","[{'version': 'v1', 'created': 'Sat, 27 Jan 2018 08:33:22 GMT'}]",2018-01-30,"[['Van', 'Vinh D.', ''], ['Thai', 'Thien', ''], ['Nghiem', 'Minh-Quoc', '']]","['Sentence-level Sentiment Analysis', 'Convolution Neural Network', 'Recursive Neural Network', 'Transfer Learning']"
9309,1905.11874,Antoine Cully,Antoine Cully,"Autonomous skill discovery with Quality-Diversity and Unsupervised
  Descriptors",The Genetic and Evolutionary Computation Conference 2019,,10.1145/3321707.3321804,,cs.RO cs.NE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Quality-Diversity optimization is a new family of optimization algorithms
that, instead of searching for a single optimal solution to solving a task,
searches for a large collection of solutions that all solve the task in a
different way. This approach is particularly promising for learning behavioral
repertoires in robotics, as such a diversity of behaviors enables robots to be
more versatile and resilient. However, these algorithms require the user to
manually define behavioral descriptors, which is used to determine whether two
solutions are different or similar. The choice of a behavioral descriptor is
crucial, as it completely changes the solution types that the algorithm
derives. In this paper, we introduce a new method to automatically define this
descriptor by combining Quality-Diversity algorithms with unsupervised
dimensionality reduction algorithms. This approach enables robots to
autonomously discover the range of their capabilities while interacting with
their environment. The results from two experimental scenarios demonstrate that
robot can autonomously discover a large range of possible behaviors, without
any prior knowledge about their morphology and environment. Furthermore, these
behaviors are deemed to be similar to handcrafted solutions that uses domain
knowledge and significantly more diverse than when using existing unsupervised
methods.
","[{'version': 'v1', 'created': 'Tue, 28 May 2019 15:12:55 GMT'}]",2019-05-29,"[['Cully', 'Antoine', '']]","['Behavioral repertoires', 'Qality-diversity optimization', 'Evolutionary robotics', 'Deep Learning', 'Representation Learning', 'Auto-encoders']"
9310,2107.07791,Zahra Gharaee,"Zahra Gharaee and Shreyas Kowshik and Oliver Stromann and Michael
  Felsberg",Graph Representation Learning for Road Type Classification,,,10.1016/j.patcog.2021.108174,,cs.LG cs.AI cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We present a novel learning-based approach to graph representations of road
networks employing state-of-the-art graph convolutional neural networks. Our
approach is applied to realistic road networks of 17 cities from Open Street
Map. While edge features are crucial to generate descriptive graph
representations of road networks, graph convolutional networks usually rely on
node features only. We show that the highly representative edge features can
still be integrated into such networks by applying a line graph transformation.
We also propose a method for neighborhood sampling based on a topological
neighborhood composed of both local and global neighbors. We compare the
performance of learning representations using different types of neighborhood
aggregation functions in transductive and inductive tasks and in supervised and
unsupervised learning. Furthermore, we propose a novel aggregation approach,
Graph Attention Isomorphism Network, GAIN. Our results show that GAIN
outperforms state-of-the-art methods on the road type classification problem.
","[{'version': 'v1', 'created': 'Fri, 16 Jul 2021 09:32:58 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Aug 2021 11:39:18 GMT'}, {'version': 'v3', 'created': 'Tue, 7 Sep 2021 12:11:25 GMT'}, {'version': 'v4', 'created': 'Fri, 3 Jun 2022 20:33:50 GMT'}]",2022-06-07,"[['Gharaee', 'Zahra', ''], ['Kowshik', 'Shreyas', ''], ['Stromann', 'Oliver', ''], ['Felsberg', 'Michael', '']]","['Road network graphs', 'graph representation learning', 'line graph']"
9311,2109.09905,Stavros Shiaeles Dr,"Levgeniia Kuzminykh, Bogdan Ghita, Stavros Shiaeles",Comparative Analysis of Cryptographic Key Management Systems,"20th International Conference on Next Generation Teletraffic and
  Wired/Wireless Advanced Networks and Systems, NEW2AN 2020 and 13th Conference
  on the Internet of Things and Smart Spaces, ruSMART 2020",,10.1007/978-3-030-65729-1_8,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Managing cryptographic keys can be a complex task for an enterprise and
particularly difficult to scale when an increasing number of users and
applications need to be managed. In order to address scalability issues,
typical IT infrastructures employ key management systems that are able to
handle a large number of encryption keys and associate them with the authorized
requests. Given their necessity, recent years have witnessed a variety of key
management systems, aligned with the features, quality, price and security
needs of specific organisations. While the spectrum of such solutions is
welcome and demonstrates the expanding nature of the market, it also makes it
time consuming for IT managers to identify the appropriate system for their
respective company needs. This paper provides a list of key management tools
which include a minimum set of features, such as availability of secure
database for managing keys, an authentication, authorization, and access
control model for restricting and managing access to keys, effective logging of
actions with keys, and the presence of an API for accessing functions directly
from the application code. Five systems were comprehensively compared by
evaluating the attributes related to complexity of the implementation, its
popularity, linked vulnerabilities and technical performance in terms of
response time and network usage. These were Pinterest Knox, Hashicorp Vault,
Square Keywhiz, OpenStack Barbican, and Cyberark Conjur. Out of these five,
Hachicorp Vault was determined to be the most suitable system for small
businesses.
","[{'version': 'v1', 'created': 'Tue, 21 Sep 2021 01:31:58 GMT'}]",2021-09-22,"[['Kuzminykh', 'Levgeniia', ''], ['Ghita', 'Bogdan', ''], ['Shiaeles', 'Stavros', '']]","['Cryptography', 'Key Distribution', 'Key Management Service', 'Secret Handling']"
9312,1908.10186,Barbara Drossel,George Ellis and Barbara Drossel,How Downwards Causation Occurs in Digital Computers,"Final version, as accepted for publication","Foundations of Physics, 49(11), 1253-1277 (2019)",10.1007/s10701-019-00307-6,,cs.OH quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Digital computers carry out algorithms coded in high level programs. These
abstract entities determine what happens at the physical level: they control
whether electrons flow through specific transistors at specific times or not,
entailing downward causation in both the logical and implementation
hierarchies. This paper explores how this is possible in the light of the
alleged causal completeness of physics at the bottom level, and highlights the
mechanism that enables strong emergence (the manifest causal effectiveness of
application programs) to occur. Although synchronic emergence of higher levels
from lower levels is manifestly true, diachronic emergence is generically not
the case; indeed we give specific examples where it cannot occur because of the
causal effectiveness of higher level variables.
","[{'version': 'v1', 'created': 'Thu, 15 Aug 2019 14:49:53 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Nov 2019 11:19:33 GMT'}]",2019-11-12,"[['Ellis', 'George', ''], ['Drossel', 'Barbara', '']]","['Emergence', 'Downward causation', 'Digital computers', 'Logicalcontrol', 'Transistors']"
9313,2301.01618,William Buchanan Prof,"Pavlos Papadopoulos, William J Buchanan, Sarwar Sayeed, Nikolaos
  Pitropakis",Towards The Creation Of The Future Fish Farm,,"Security and Safety, 3(4), 174-186 (2022)",10.20517/jsss.2022.1,,cs.CY cs.CR,http://creativecommons.org/licenses/by/4.0/,"  A fish farm is an area where fish raise and bred for food. Fish farm
environments support the care and management of seafood within a controlled
environment. Over the past few decades, there has been a remarkable increase in
the calorie intake of protein attributed to seafood. Along with this, there are
significant opportunities within the fish farming industry for economic
development. Determining the fish diseases, monitoring the aquatic organisms,
and examining the imbalance in the water element are some key factors that
require precise observation to determine the accuracy of the acquired data.
Similarly, due to the rapid expansion of aquaculture, new technologies are
constantly being implemented in this sector to enhance efficiency. However, the
existing approaches have often failed to provide an efficient method of farming
fish. This work has kept aside the traditional approaches and opened up new
dimensions to perform accurate analysis by adopting a distributed ledger
technology. Our work analyses the current state-of-the-art of fish farming and
proposes a fish farm ecosystem that relies on a private-by-design architecture
based on the Hyperledger Fabric private-permissioned distributed ledger
technology. The proposed method puts forward accurate and secure storage of the
retrieved data from multiple sensors across the ecosystem so that the adhering
entities can exercise their decision based on the acquired data. This study
demonstrates a proof-of-concept to signify the efficiency and usability of the
future fish farm.
","[{'version': 'v1', 'created': 'Mon, 2 Jan 2023 21:41:06 GMT'}]",2023-01-05,"[['Papadopoulos', 'Pavlos', ''], ['Buchanan', 'William J', ''], ['Sayeed', 'Sarwar', ''], ['Pitropakis', 'Nikolaos', '']]","['blockchain', 'hyperledger fabric', 'fish farm', 'security', 'privacy', 'trust']"
9314,2104.06186,Romain Raveaux M.,Romain Raveaux,"On the unification of the graph edit distance and graph matching
  problems",,,10.1016/j.patrec.2021.02.014,,cs.DM,http://creativecommons.org/licenses/by/4.0/,"  Error-tolerant graph matching gathers an important family of problems. These
problems aim at finding correspondences between two graphs while integrating an
error model. In the Graph Edit Distance (GED) problem, the insertion/deletion
of edges/nodes from one graph to another is explicitly expressed by the error
model. At the opposite, the problem commonly referred to as ""graph matching""
does not explicitly express such operations. For decades, these two problems
have split the research community in two separated parts. It resulted in the
design of different solvers for the two problems. In this paper, we propose a
unification of both problems thanks to a single model. We give the proof that
the two problems are equivalent under a reformulation of the error models. This
unification makes possible the use on both problems of existing solving methods
from the two communities.
","[{'version': 'v1', 'created': 'Tue, 9 Mar 2021 08:32:46 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Apr 2021 06:10:59 GMT'}]",2021-04-19,"[['Raveaux', 'Romain', '']]","['Graph edit distance', 'graph matching', 'error-correcting graph matching', 'discrete optimization']"
9315,1712.01656,Michele Alberti,"Michele Alberti, Manuel Bouillon, Rolf Ingold, Marcus Liwicki",Open Evaluation Tool for Layout Analysis of Document Images,"The 14th IAPR International Conference on Document Analysis and
  Recognition (ICDAR), HIP: 4th International Workshop on Historical Document
  Imaging and Processing, Kyoto, Japan, 2017",ICDAR-OST 2017,10.1109/ICDAR.2017.311,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an open tool for standardizing the evaluation process of
the layout analysis task of document images at pixel level. We introduce a new
evaluation tool that is both available as a standalone Java application and as
a RESTful web service. This evaluation tool is free and open-source in order to
be a common tool that anyone can use and contribute to. It aims at providing as
many metrics as possible to investigate layout analysis predictions, and also
provide an easy way of visualizing the results. This tool evaluates document
segmentation at pixel level, and support multi-labeled pixel ground truth.
Finally, this tool has been successfully used for the ICDAR2017 competition on
Layout Analysis for Challenging Medieval Manuscripts.
","[{'version': 'v1', 'created': 'Thu, 23 Nov 2017 15:18:04 GMT'}]",2018-04-25,"[['Alberti', 'Michele', ''], ['Bouillon', 'Manuel', ''], ['Ingold', 'Rolf', ''], ['Liwicki', 'Marcus', '']]","['Evaluation Tool', 'Open-Source', 'Layout Analysis', 'Results Visualization', 'Web service']"
9316,2206.13560,Dharun Anandayuvaraj,"Dharun Anandayuvaraj, James C. Davis",Reflecting on Recurring Failures in IoT Development,"Accepted at the New Ideas and Emerging Results Track (NIER) at The
  37th IEEE/ACM International Conference on Automated Software Engineering (ASE
  2022)",,10.1145/3551349.3559545,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As IoT systems are given more responsibility and autonomy, they offer greater
benefits, but also carry greater risks. We believe this trend invigorates an
old challenge of software engineering: how to develop high-risk
software-intensive systems safely and securely under market pressures? As a
first step, we conducted a systematic analysis of recent IoT failures to
identify engineering challenges. We collected and analyzed 22 news reports and
studied the sources, impacts, and repair strategies of failures in IoT systems.
We observed failure trends both within and across application domains. We also
observed that failure themes have persisted over time. To alleviate these
trends, we outline a research agenda toward a Failure-Aware Software
Development Life Cycle for IoT development. We propose an encyclopedia of
failures and an empirical basis for system postmortems, complemented by
appropriate automated tools.
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2022 18:03:40 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Sep 2022 13:30:47 GMT'}]",2022-09-20,"[['Anandayuvaraj', 'Dharun', ''], ['Davis', 'James C.', '']]","['Internet of Things', 'Cyber-Physical Systems', 'Embedded Systems', 'Safety-Critical Software', 'Software Engineering', 'Failure Analysis']"
9317,1403.0282,Orhio Creado,"Orhio Mark Creado, Bala Srinivasan, Phu Dung Le, Jefferson Tan",An Explicit Trust Model Towards Better System Security,"13 pages, 7 figures, The Fourth International Conference on Computer
  Science and Information Technology, CCSIT 2014",,10.5121/csit.2014.4212,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Trust is an absolute necessity for digital communications; but is often
viewed as an implicit singular entity. The use of the internet as the primary
vehicle for information exchange has made accountability and verifiability of
system code almost obsolete. This paper proposes a novel approach towards
enforcing system security by requiring the explicit definition of trust for all
operating code. By identifying the various classes and levels of trust required
within a computing system; trust is defined as a combination of individual
characteristics. Trust is then represented as a calculable metric obtained
through the collective enforcement of each of these characteristics to varying
degrees. System Security is achieved by facilitating trust to be a constantly
evolving aspect for each operating code segment capable of getting stronger or
weaker over time.
","[{'version': 'v1', 'created': 'Mon, 3 Mar 2014 00:40:35 GMT'}]",2014-03-04,"[['Creado', 'Orhio Mark', ''], ['Srinivasan', 'Bala', ''], ['Le', 'Phu Dung', ''], ['Tan', 'Jefferson', '']]","['System Security', 'Trusted Computing', 'Trust Framework']"
9318,2107.08572,Spyridon Ampanavos,"Spyridon Ampanavos, Ali Malkawi",Early-Phase Performance-Driven Design using Generative Models,CAAD Futures 2021,,10.1007/978-981-19-1280-1_6,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Current performance-driven building design methods are not widely adopted
outside the research field for several reasons that make them difficult to
integrate into a typical design process. In the early design phase, in
particular, the time-intensity and the cognitive load associated with
optimization and form parametrization are incompatible with design exploration,
which requires quick iteration. This research introduces a novel method for
performance-driven geometry generation that can afford interaction directly in
the 3d modeling environment, eliminating the need for explicit parametrization,
and is multiple orders faster than the equivalent form optimization. The method
uses Machine Learning techniques to train a generative model offline. The
generative model learns a distribution of optimal performing geometries and
their simulation contexts based on a dataset that addresses the performance(s)
of interest. By navigating the generative model's latent space, geometries with
the desired characteristics can be quickly generated. A case study is
presented, demonstrating the generation of a synthetic dataset and the use of a
Variational Autoencoder (VAE) as a generative model for geometries with optimal
solar gain. The results show that the VAE-generated geometries perform on
average at least as well as the optimized ones, suggesting that the introduced
method shows a feasible path towards more intuitive and interactive early-phase
performance-driven design assistance.
","[{'version': 'v1', 'created': 'Mon, 19 Jul 2021 01:25:11 GMT'}]",2022-04-19,"[['Ampanavos', 'Spyridon', ''], ['Malkawi', 'Ali', '']]","['Performance Driven Design', 'Machine Learning', 'Generative Model']"
9319,2204.09623,Marion Wiese,"Marion Wiese, Paula Rachow, Matthias Riebisch, Julian Schwarze","Preventing technical debt with the TAP framework for Technical Debt
  Aware Management","Accepted manuscript for ""Information and Software Technology"" -
  Special Issue on the TechDebt 2021 conference","Information and Software Technology, 2022, 106926, ISSN 0950-5849",10.1016/j.infsof.2022.106926,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Context. Technical Debt (TD) is a metaphor for technical problems that are
not visible to users and customers but hinder developers in their work, making
future changes more difficult. TD is often incurred due to tight project
deadlines and can make future changes more costly or impossible. Project
Management usually focuses on customer benefits and pays less attention to
their IT systems' internal quality. TD prevention should be preferred over TD
repayment because subsequent refactoring and re-engineering are expensive.
Objective. This paper evaluates a framework focusing on both TD prevention and
TD repayment in the context of agile-managed projects. The framework was
developed and applied in an IT unit of a publishing house. The unique
contribution of this framework is the integration of TD management into project
management. Method. The evaluation was performed as a comparative case study
based on ticket statistics and two structured surveys. The surveys were
conducted in the observed IT unit using the framework and a comparison unit not
using the framework. The first survey targeted team members, the second one IT
managers. Results. The evaluation shows that in this IT unit, the TAP framework
led to a raised awareness for the incurrence of TD. Decisions to incur TD are
intentional, and TD is repaid timelier. Unintentional TD incurred by
unconscious decisions is prevented. Furthermore, better communication and
better planning of the project pipeline can be observed. Conclusions. We
provide an insight into practitioners' ways to identify, monitor, prevent and
repay TD. The presented framework includes a feasible method for TD prevention
despite tight timelines by making TD repayment part of project management.
","[{'version': 'v1', 'created': 'Wed, 20 Apr 2022 17:05:37 GMT'}]",2022-04-26,"[['Wiese', 'Marion', ''], ['Rachow', 'Paula', ''], ['Riebisch', 'Matthias', ''], ['Schwarze', 'Julian', '']]","['Technical Debt', 'Project Management', 'Technical Debt Awareness', 'Technical Debt Repayment', 'TechnicalDebt Prevention', 'Technical Debt Backlog']"
9320,2010.04778,Konrad Kulakowski,Konrad Ku{\l}akowski and Ji\v{r}\'i Mazurek and Micha{\l} Strada,"On the similarity between ranking vectors in the pairwise comparison
  method","18 pages, 4 figures",,10.1080/01605682.2021.1947754,,cs.DM math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are many priority deriving methods for pairwise comparison matrices. It
is known that when these matrices are consistent all these methods result in
the same priority vector. However, when they are inconsistent, the results may
vary. The presented work formulates an estimation of the difference between
priority vectors in the two most popular ranking methods: the eigenvalue method
and the geometric mean method. The estimation provided refers to the
inconsistency of the pairwise comparison matrix. Theoretical considerations are
accompanied by Montecarlo experiments showing the discrepancy between the
values of both methods.
","[{'version': 'v1', 'created': 'Fri, 9 Oct 2020 19:47:01 GMT'}]",2021-12-21,"[['Kułakowski', 'Konrad', ''], ['Mazurek', 'Jiří', ''], ['Strada', 'Michał', '']]","['pairwise comparisons', 'Analytic Hierarchy Process', 'Eigenvaluemethod', 'Geometric Mean Method', 'AHP', 'EVM', 'GMM']"
9321,2007.10047,Valdecy Pereira,"Gabriela Montenegro de Barros (Federal Fluminense University) and
  Valdecy Pereira (Federal Fluminense University)","Electre Tree A Machine Learning Approach to Infer Electre Tri B
  Parameters","21 pages, 8 figures, 8 tables",Data Technologies and Applications 2021,10.1108/DTA-10-2020-0256,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Purpose: This paper presents an algorithm that can elicitate (infer) all or
any combination of ELECTRE Tri-B parameters. For example, a decision-maker can
maintain the values for indifference, preference, and veto thresholds, and our
algorithm can find the criteria weights, reference profiles, and the lambda
cutting level. Our approach is inspired by a Machine Learning ensemble
technique, the Random Forest, and for that, we named our approach as ELECTRE
Tree algorithm. Methodology: First, we generate a set of ELECTRE Tri-B models,
where each model solves a random sample of criteria and alternatives. Each
sample is made with replacement, having at least two criteria and between 10%
to 25% of alternatives. Each model has its parameters optimized by a genetic
algorithm that can use an ordered cluster or an assignment example as a
reference to the optimization. Finally, after the optimization phase, two
procedures can be performed, the first one will merge all models, finding in
this way the elicitated parameters, and in the second procedure each
alternative is classified (voted) by each separated model, and the majority
vote decides the final class. Findings: We have noted that concerning the
voting procedure, non-linear decision boundaries are generated, and they can be
suitable in analyzing problems with the same nature. In contrast, the merged
model generates linear decision boundaries. Originality: The elicitation of
ELECTRE Tri-B parameters is made by an ensemble technique that is composed of a
set of multicriteria models that are engaged in generating robust solutions.
","[{'version': 'v1', 'created': 'Mon, 20 Jul 2020 12:39:56 GMT'}]",2021-04-12,"[['de Barros', 'Gabriela Montenegro', '', 'Federal Fluminense University'], ['Pereira', 'Valdecy', '', 'Federal Fluminense University']]","['ELECTRE Tri-B', 'Parameters Elicitation', 'Machine Learning']"
9322,2109.00051,Vinicius Santos,"Vinicius dos Santos, Anderson Yoshiaki Iwazaki, Katia Romero
  Felizardo, \'Erica Ferreira de Souza, Elisa Yumi Nakagawa",Towards Sustainability of Systematic Literature Reviews,,,10.1145/3475716.3484192,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Background: The software engineering community has increasingly conducted
systematic literature reviews (SLR) as a means to summarize evidence from
different studies and bring to light the state of the art of a given research
topic. While SLR provide many benefits, they also present several problems with
punctual solutions for some of them. However, two main problems still remain:
the high time-/effort-consumption nature of SLR and the lack of an effective
impact of SLR results in the industry, as initially expected for SLR. Aims: The
main goal of this paper is to introduce a new view - which we name
Sustainability of SLR - on how to deal with SLR aiming at reducing those
problems. Method: We analyzed six reference studies published in the last
decade to identify, group, and analyze the SLR problems and their
interconnections. Based on such analysis, we proposed the view of
Sustainability of SLR that intends to address these problems. Results: The
proposed view encompasses three dimensions (social, economic, and technical)
that could become SLR more sustainable in the sense that the four major
problems and 31 barriers (i.e., possible causes for those problems) that we
identified could be mitigated. Conclusions: The view of Sustainability of SLR
intends to change the researchers' mindset to mitigate the inherent SLR
problems and, as a consequence, achieve sustainable SLR, i.e., those that
consume less time/effort to be conducted and updated with useful results for
the industry.
","[{'version': 'v1', 'created': 'Tue, 31 Aug 2021 19:31:16 GMT'}]",2021-09-02,"[['Santos', 'Vinicius dos', ''], ['Iwazaki', 'Anderson Yoshiaki', ''], ['Felizardo', 'Katia Romero', ''], ['de Souza', 'Érica Ferreira', ''], ['Nakagawa', 'Elisa Yumi', '']]","['Systematic Literature Review', 'SLR', 'Sustainability', 'Sustainability of SLR']"
9323,2005.05465,"Tom Kr\""uger","Tom Kr\""uger, Wolfgang Mauerer","Quantum Annealing-Based Software Components: An Experimental Case Study
  with SAT Solving",,,10.1145/3387940.3391472,,cs.ET quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quantum computers have the potential of solving problems more efficiently
than classical computers. While first commercial prototypes have become
available, the performance of such machines in practical application is still
subject to exploration. Quantum computers will not entirely replace classical
machines, but serve as accelerators for specific problems. This necessitates
integrating quantum computational primitives into existing applications.
  In this paper, we perform a case study on how to augment existing software
with quantum computational primitives for the Boolean satisfiability problem
(SAT) implemented using a quantum annealer (QA). We discuss relevant quality
measures for quantum components, and show that mathematically equivalent, but
structurally different ways of transforming SAT to a QA can lead to substantial
differences regarding these qualities. We argue that engineers need to be aware
that (and which) details, although they may be less relevant in traditional
software engineering, require considerable attention in quantum computing.
","[{'version': 'v1', 'created': 'Mon, 11 May 2020 22:20:17 GMT'}]",2020-05-13,"[['Krüger', 'Tom', ''], ['Mauerer', 'Wolfgang', '']]","['Qantum Computing', 'Qantum Annealing', 'Boolean Satisfability', 'Experimental Performance Analysis']"
9324,2008.12537,Paraskevi Chasani,Paraskevi Chasani and Aristidis Likas,The UU-test for Statistical Modeling of Unimodal Data,"32 pages, 20 figures, 6 tables",,10.1016/j.patcog.2021.108272,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deciding on the unimodality of a dataset is an important problem in data
analysis and statistical modeling. It allows to obtain knowledge about the
structure of the dataset, ie. whether data points have been generated by a
probability distribution with a single or more than one peaks. Such knowledge
is very useful for several data analysis problems, such as for deciding on the
number of clusters and determining unimodal projections. We propose a technique
called UU-test (Unimodal Uniform test) to decide on the unimodality of a
one-dimensional dataset. The method operates on the empirical cumulative
density function (ecdf) of the dataset. It attempts to build a piecewise linear
approximation of the ecdf that is unimodal and models the data sufficiently in
the sense that the data corresponding to each linear segment follows the
uniform distribution. A unique feature of this approach is that in the case of
unimodality, it also provides a statistical model of the data in the form of a
Uniform Mixture Model. We present experimental results in order to assess the
ability of the method to decide on unimodality and perform comparisons with the
well-known dip-test approach. In addition, in the case of unimodal datasets we
evaluate the Uniform Mixture Models provided by the proposed method using the
test set log-likelihood and the two-sample Kolmogorov-Smirnov (KS) test.
","[{'version': 'v1', 'created': 'Fri, 28 Aug 2020 08:34:28 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Sep 2021 15:28:00 GMT'}]",2021-09-10,"[['Chasani', 'Paraskevi', ''], ['Likas', 'Aristidis', '']]","['unimodal data', 'unimodality test', 'statistical modeling', 'uniform mixture model']"
9325,2001.09782,Tram Truong-Huu,"Tien-Dung Cao, Tram Truong-Huu, Hien Tran, and Khanh Tran","A Federated Deep Learning Framework for Privacy Preservation and
  Communication Efficiency",,"Journal of Systems Architecture, vol. 124, March 2022",10.1016/j.sysarc.2022.102413,,cs.DC cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning has achieved great success in many applications. However, its
deployment in practice has been hurdled by two issues: the privacy of data that
has to be aggregated centrally for model training and high communication
overhead due to transmission of a large amount of data usually geographically
distributed. Addressing both issues is challenging and most existing works
could not provide an efficient solution. In this paper, we develop FedPC, a
Federated Deep Learning Framework for Privacy Preservation and Communication
Efficiency. The framework allows a model to be learned on multiple private
datasets while not revealing any information of training data, even with
intermediate data. The framework also minimizes the amount of data exchanged to
update the model. We formally prove the convergence of the learning model when
training with FedPC and its privacy-preserving property. We perform extensive
experiments to evaluate the performance of FedPC in terms of the approximation
to the upper-bound performance (when training centrally) and communication
overhead. The results show that FedPC maintains the performance approximation
of the models within $8.5\%$ of the centrally-trained models when data is
distributed to 10 computing nodes. FedPC also reduces the communication
overhead by up to $42.20\%$ compared to existing works.
","[{'version': 'v1', 'created': 'Wed, 22 Jan 2020 02:52:31 GMT'}, {'version': 'v2', 'created': 'Fri, 29 May 2020 14:39:14 GMT'}, {'version': 'v3', 'created': 'Wed, 5 Jan 2022 05:05:42 GMT'}]",2022-02-04,"[['Cao', 'Tien-Dung', ''], ['Truong-Huu', 'Tram', ''], ['Tran', 'Hien', ''], ['Tran', 'Khanh', '']]","['Federated learning', 'deep learning', 'parallel training', 'communication efficiency', 'privacy preserving']"
9326,1710.08107,Michael Amir,"Michael Amir, Alfred M. Bruckstein",Probabilistic Pursuits on Graphs,Corrections and additional details,,10.1016/j.tcs.2019.08.001,,cs.DM cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider discrete dynamical systems of ""ant-like"" agents engaged in a
sequence of pursuits on a graph environment. The agents emerge one by one at
equal time intervals from a source vertex $s$ and pursue each other by greedily
attempting to close the distance to their immediate predecessor, the agent that
emerged just before them from $s$, until they arrive at the destination point
$t$. Such pursuits have been investigated before in the continuous setting and
in discrete time when the underlying environment is a regular grid. In both
these settings the agents' walks provably converge to a shortest path from $s$
to $t$. Furthermore, assuming a certain natural probability distribution over
the move choices of the agents on the grid (in case there are multiple shortest
paths between an agent and its predecessor), the walks converge to the uniform
distribution over all shortest paths from $s$ to $t$.
  We study the evolution of agent walks over a general finite graph environment
$G$. Our model is a natural generalization of the pursuit rule proposed for the
case of the grid. The main results are as follows. We show that ""convergence""
to the shortest paths in the sense of previous work extends to all
pseudo-modular graphs (i.e. graphs in which every three pairwise intersecting
disks have a nonempty intersection), and also to environments obtained by
taking graph products, generalizing previous results in two different ways. We
show that convergence to the shortest paths is also obtained by chordal graphs,
and discuss some further positive and negative results for planar graphs. In
the most general case, convergence to the shortest paths is not guaranteed, and
the agents may get stuck on sets of recurrent, non-optimal walks from $s$ to
$t$. However, we show that the limiting distributions of the agents' walks will
always be uniform distributions over some set of walks of equal length.
","[{'version': 'v1', 'created': 'Mon, 23 Oct 2017 06:52:09 GMT'}, {'version': 'v2', 'created': 'Sun, 29 Oct 2017 13:37:14 GMT'}, {'version': 'v3', 'created': 'Thu, 31 Jan 2019 17:26:48 GMT'}]",2019-08-09,"[['Amir', 'Michael', ''], ['Bruckstein', 'Alfred M.', '']]","['Chain pursuits', 'Grids', 'Grid geometry', 'Pseudo-modular graphs', 'Multi-agent pursuits', 'Probabilistic multi-agent systems']"
9327,2110.12633,Shreyansh Joshi,"Vikas Sheoran, Shreyansh Joshi and Tanisha R. Bhayani",Age and Gender Prediction using Deep CNNs and Transfer Learning,"12 pages, 2 figures, 11 tables",CCIS 1377 (2021) 293-304,10.1007/978-981-16-1092-9_25,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The last decade or two has witnessed a boom of images. With the increasing
ubiquity of cameras and with the advent of selfies, the number of facial images
available in the world has skyrocketed. Consequently, there has been a growing
interest in automatic age and gender prediction of a person using facial
images. We in this paper focus on this challenging problem. Specifically, this
paper focuses on age estimation, age classification and gender classification
from still facial images of an individual. We train different models for each
problem and we also draw comparisons between building a custom CNN
(Convolutional Neural Network) architecture and using various CNN architectures
as feature extractors, namely VGG16 pre-trained on VGGFace, Res-Net50 and
SE-ResNet50 pre-trained on VGGFace2 dataset and training over those extracted
features. We also provide baseline performance of various machine learning
algorithms on the feature extraction which gave us the best results. It was
observed that even simple linear regression trained on such extracted features
outperformed training CNN, ResNet50 and ResNeXt50 from scratch for age
estimation.
","[{'version': 'v1', 'created': 'Mon, 25 Oct 2021 04:23:59 GMT'}]",2021-10-26,"[['Sheoran', 'Vikas', ''], ['Joshi', 'Shreyansh', ''], ['Bhayani', 'Tanisha R.', '']]","['Age Estimation', 'CNN', 'Transfer Learning']"
9328,2210.02071,Leonard Hackel,"Tom-Lukas Breitkopf (1), Leonard W. Hackel (1), Mahdyar Ravanbakhsh
  (1), Anne-Karin Cooke (2), Sandra Willkommen (2), Stefan Broda (2), Beg\""um
  Demir (1) ((1) Technische Universit\""at Berlin, (2) Bundesanstalt f\""ur
  Geowissenschaften und Rohstoffe Berlin)","Advanced Deep Learning Architectures for Accurate Detection of
  Subsurface Tile Drainage Pipes from Remote Sensing Images","Accepted at the SPIE Image and Signal Processing for Remote Sensing
  2022. For code visit: https://git.tu-berlin.de/rsim/drainage-pipes-detection",,10.1117/12.2636263,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Subsurface tile drainage pipes provide agronomic, economic and environmental
benefits. By lowering the water table of wet soils, they improve the aeration
of plant roots and ultimately increase the productivity of farmland. They do
however also provide an entryway of agrochemicals into subsurface water bodies
and increase nutrition loss in soils. For maintenance and infrastructural
development, accurate maps of tile drainage pipe locations and drained
agricultural land are needed. However, these maps are often outdated or not
present. Different remote sensing (RS) image processing techniques have been
applied over the years with varying degrees of success to overcome these
restrictions. Recent developments in deep learning (DL) techniques improve upon
the conventional techniques with machine learning segmentation models. In this
study, we introduce two DL-based models: i) improved U-Net architecture; and
ii) Visual Transformer-based encoder-decoder in the framework of tile drainage
pipe detection. Experimental results confirm the effectiveness of both models
in terms of detection accuracy when compared to a basic U-Net architecture. Our
code and models are publicly available at
https://git.tu-berlin.de/rsim/drainage-pipes-detection.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2022 07:48:53 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Oct 2022 07:35:55 GMT'}, {'version': 'v3', 'created': 'Tue, 1 Nov 2022 12:48:59 GMT'}]",2022-11-02,"[['Breitkopf', 'Tom-Lukas', ''], ['Hackel', 'Leonard W.', ''], ['Ravanbakhsh', 'Mahdyar', ''], ['Cooke', 'Anne-Karin', ''], ['Willkommen', 'Sandra', ''], ['Broda', 'Stefan', ''], ['Demir', 'Begüm', '']]","['Semantic segmentation', 'tile drainage pipe detection', 'visual transformer', 'U-Net', 'remote sensing']"
9329,2111.15348,Janamejaya Channegowda,"Aniruddh Herle, Janamejaya Channegowda, Dinakar Prabhu","Overcoming limited battery data challenges: A coupled neural network
  approach",Published at International Journal of Energy Research,,10.1002/er.7081,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Electric Vehicle (EV) Industry has seen extraordinary growth in the last
few years. This is primarily due to an ever increasing awareness of the
detrimental environmental effects of fossil fuel powered vehicles and
availability of inexpensive Lithium-ion batteries (LIBs). In order to safely
deploy these LIBs in Electric Vehicles, certain battery states need to be
constantly monitored to ensure safe and healthy operation. The use of Machine
Learning to estimate battery states such as State-of-Charge and State-of-Health
have become an extremely active area of research. However, limited availability
of open-source diverse datasets has stifled the growth of this field, and is a
problem largely ignored in literature. In this work, we propose a novel method
of time-series battery data augmentation using deep neural networks. We
introduce and analyze the method of using two neural networks working together
to alternatively produce synthetic charging and discharging battery profiles.
One model produces battery charging profiles, and another produces battery
discharging profiles. The proposed approach is evaluated using few public
battery datasets to illustrate its effectiveness, and our results show the
efficacy of this approach to solve the challenges of limited battery data. We
also test this approach on dynamic Electric Vehicle drive cycles as well.
","[{'version': 'v1', 'created': 'Tue, 5 Oct 2021 16:17:19 GMT'}]",2021-12-01,"[['Herle', 'Aniruddh', ''], ['Channegowda', 'Janamejaya', ''], ['Prabhu', 'Dinakar', '']]","['Electric Vehicle', 'Lithium-ion batteries', 'Machine Learning', 'deep learning', 'data augmentation']"
9330,1710.07891,Xin Hu,"Xin Hu, Yingting Yao, Luting Ye, Depeng Dang",Natural Language Aggregate Query over RDF Data,,,10.1016/j.ins.2018.04.042,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Natural language question-answering over RDF data has received widespread
attention. Although there have been several studies that have dealt with a
small number of aggregate queries, they have many restrictions (i.e.,
interactive information, controlled question or query template). Thus far,
there has been no natural language querying mechanism that can process general
aggregate queries over RDF data. Therefore, we propose a framework called NLAQ
(Natural Language Aggregate Query). First, we propose a novel algorithm to
automatically understand a users query intention, which mainly contains
semantic relations and aggregations. Second, to build a better bridge between
the query intention and RDF data, we propose an extended paraphrase dictionary
ED to obtain more candidate mappings for semantic relations, and we introduce a
predicate-type adjacent set PT to filter out inappropriate candidate mapping
combinations in semantic relations and basic graph patterns. Third, we design a
suitable translation plan for each aggregate category and effectively
distinguish whether an aggregate item is numeric or not, which will greatly
affect the aggregate result. Finally, we conduct extensive experiments over
real datasets (QALD benchmark and DBpedia), and the experimental results
demonstrate that our solution is effective.
","[{'version': 'v1', 'created': 'Sun, 22 Oct 2017 05:35:37 GMT'}]",2018-04-27,"[['Hu', 'Xin', ''], ['Yao', 'Yingting', ''], ['Ye', 'Luting', ''], ['Dang', 'Depeng', '']]","['RDF', 'question answering', 'natural language', 'aggregate query']"
9331,2104.11473,Kejun Wang,"Xinnan Ding, Kejun Wang, Chenhui Wang, Tianyi Lan, Liangliang Liu","Sequential convolutional network for behavioral pattern extraction in
  gait recognition",,Neurocomputing2021,10.1016/j.neucom.2021.08.054,,cs.CV,http://creativecommons.org/publicdomain/zero/1.0/,"  As a unique and promising biometric, video-based gait recognition has broad
applications. The key step of this methodology is to learn the walking pattern
of individuals, which, however, often suffers challenges to extract the
behavioral feature from a sequence directly. Most existing methods just focus
on either the appearance or the motion pattern. To overcome these limitations,
we propose a sequential convolutional network (SCN) from a novel perspective,
where spatiotemporal features can be learned by a basic convolutional backbone.
In SCN, behavioral information extractors (BIE) are constructed to comprehend
intermediate feature maps in time series through motion templates where the
relationship between frames can be analyzed, thereby distilling the information
of the walking pattern. Furthermore, a multi-frame aggregator in SCN performs
feature integration on a sequence whose length is uncertain, via a mobile 3D
convolutional layer. To demonstrate the effectiveness, experiments have been
conducted on two popular public benchmarks, CASIA-B and OU-MVLP, and our
approach is demonstrated superior performance, comparing with the state-of-art
methods.
","[{'version': 'v1', 'created': 'Fri, 23 Apr 2021 08:44:10 GMT'}]",2021-08-30,"[['Ding', 'Xinnan', ''], ['Wang', 'Kejun', ''], ['Wang', 'Chenhui', ''], ['Lan', 'Tianyi', ''], ['Liu', 'Liangliang', '']]","['Gait recognition', 'convolutional neural networks', 'spatiotemporal features', 'sequence']"
9332,2001.09077,William Seymour,"William Seymour, Martin J. Kraemer, Reuben Binns, Max Van Kleek",Informing the Design of Privacy-Empowering Tools for the Connected Home,"10 pages, 2 figures. To appear in the Proceedings of the 2020 CHI
  Conference on Human Factors in Computing Systems (CHI '20)",,10.1145/3313831.3376264,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Connected devices in the home represent a potentially grave new privacy
threat due to their unfettered access to the most personal spaces in people's
lives. Prior work has shown that despite concerns about such devices, people
often lack sufficient awareness, understanding, or means of taking effective
action. To explore the potential for new tools that support such needs directly
we developed Aretha, a privacy assistant technology probe that combines a
network disaggregator, personal tutor, and firewall, to empower end-users with
both the knowledge and mechanisms to control disclosures from their homes. We
deployed Aretha in three households over six weeks, with the aim of
understanding how this combination of capabilities might enable users to gain
awareness of data disclosures by their devices, form educated privacy
preferences, and to block unwanted data flows. The probe, with its novel
affordances-and its limitations-prompted users to co-adapt, finding new control
mechanisms and suggesting new approaches to address the challenge of regaining
privacy in the connected home.
","[{'version': 'v1', 'created': 'Fri, 24 Jan 2020 16:30:52 GMT'}]",2020-01-27,"[['Seymour', 'William', ''], ['Kraemer', 'Martin J.', ''], ['Binns', 'Reuben', ''], ['Van Kleek', 'Max', '']]","['Technology Probe', 'Privacy-Empowering Technology', 'Network Disaggregator']"
9333,1910.01199,Lu Wei Dr.,Lu Wei,Skewness of von Neumann entanglement entropy,,"J. Phys. A: Math. Theor. 53 075302, 2020",10.1088/1751-8121/ab63a7,,cs.IT math-ph math.IT math.MP math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study quantum bipartite systems in a random pure state, where von Neumann
entropy is considered as a measure of the entanglement. Expressions of the
first and second exact cumulants of von Neumann entropy, relevant respectively
to the average and fluctuation behavior, are known in the literature. The focus
of this paper is on its skewness that specifies the degree of asymmetry of the
distribution. Computing the skewness requires additionally the third cumulant,
an exact formula of which is the main result of this work. In proving the main
result, we obtain as a byproduct various summation identities involving
polygamma and related functions. The derived third cumulant also leads to an
improved approximation to the distribution of von Neumann entropy.
","[{'version': 'v1', 'created': 'Wed, 2 Oct 2019 20:11:48 GMT'}]",2020-02-13,"[['Wei', 'Lu', '']]","['quantum entanglement', 'von Neumann entropy', 'skewness', 'random matrixtheory', 'polygamma functions']"
9334,2103.03133,\v{S}imon Bil\'ik,"Simon Bilik, Lukas Kratochvila, Adam Ligocki, Ondrej Bostik, Tomas
  Zemcik, Matous Hybl, Karel Horak, Ludek Zalud","Visual diagnosis of the Varroa destructor parasitic mite in honeybees
  using object detector techniques",,,10.3390/s21082764,,cs.CV cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The Varroa destructor mite is one of the most dangerous Honey Bee (Apis
mellifera) parasites worldwide and the bee colonies have to be regularly
monitored in order to control its spread. Here we present an object detector
based method for health state monitoring of bee colonies. This method has the
potential for online measurement and processing. In our experiment, we compare
the YOLO and SSD object detectors along with the Deep SVDD anomaly detector.
Based on the custom dataset with 600 ground-truth images of healthy and
infected bees in various scenes, the detectors reached a high F1 score up to
0.874 in the infected bee detection and up to 0.727 in the detection of the
Varroa Destructor mite itself. The results demonstrate the potential of this
approach, which will be later used in the real-time computer vision based honey
bee inspection system. To the best of our knowledge, this study is the first
one using object detectors for this purpose. We expect that performance of
those object detectors will enable us to inspect the health status of the honey
bee colonies.
","[{'version': 'v1', 'created': 'Fri, 26 Feb 2021 11:01:31 GMT'}]",2021-04-15,"[['Bilik', 'Simon', ''], ['Kratochvila', 'Lukas', ''], ['Ligocki', 'Adam', ''], ['Bostik', 'Ondrej', ''], ['Zemcik', 'Tomas', ''], ['Hybl', 'Matous', ''], ['Horak', 'Karel', ''], ['Zalud', 'Ludek', '']]","['Varroa destructor', 'Apis mellifera', 'Western honey bee', 'Bee health monitoring', 'Object detection', 'YOLO', 'SSD', 'Deep Learning']"
9335,1910.11377,Sunyang Fu,"Sunyang Fu, David Chen, Huan He, Sijia Liu, Sungrim Moon, Kevin J
  Peterson, Feichen Shen, Liwei Wang, Yanshan Wang, Andrew Wen, Yiqing Zhao,
  Sunghwan Sohn, Hongfang Liu",Clinical Concept Extraction: a Methodology Review,,Journal of Biomedical Informatics (2020): 103526,10.1016/j.jbi.2020.103526,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background Concept extraction, a subdomain of natural language processing
(NLP) with a focus on extracting concepts of interest, has been adopted to
computationally extract clinical information from text for a wide range of
applications ranging from clinical decision support to care quality
improvement.
  Objectives In this literature review, we provide a methodology review of
clinical concept extraction, aiming to catalog development processes, available
methods and tools, and specific considerations when developing clinical concept
extraction applications.
  Methods Based on the Preferred Reporting Items for Systematic Reviews and
Meta-Analyses (PRISMA) guidelines, a literature search was conducted for
retrieving EHR-based information extraction articles written in English and
published from January 2009 through June 2019 from Ovid MEDLINE In-Process &
Other Non-Indexed Citations, Ovid MEDLINE, Ovid EMBASE, Scopus, Web of Science,
and the ACM Digital Library.
  Results A total of 6,686 publications were retrieved. After title and
abstract screening, 228 publications were selected. The methods used for
developing clinical concept extraction applications were discussed in this
review.
","[{'version': 'v1', 'created': 'Thu, 24 Oct 2019 18:54:25 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Oct 2019 19:17:01 GMT'}, {'version': 'v3', 'created': 'Mon, 2 Mar 2020 19:17:25 GMT'}, {'version': 'v4', 'created': 'Mon, 10 Aug 2020 21:09:35 GMT'}]",2020-08-12,"[['Fu', 'Sunyang', ''], ['Chen', 'David', ''], ['He', 'Huan', ''], ['Liu', 'Sijia', ''], ['Moon', 'Sungrim', ''], ['Peterson', 'Kevin J', ''], ['Shen', 'Feichen', ''], ['Wang', 'Liwei', ''], ['Wang', 'Yanshan', ''], ['Wen', 'Andrew', ''], ['Zhao', 'Yiqing', ''], ['Sohn', 'Sunghwan', ''], ['Liu', 'Hongfang', '']]","['concept extraction', 'natural language processing', 'information extraction', 'electronic']"
9336,2009.10317,Sirat Samyoun,"Sirat Samyoun, Sudipta Saha Shubha, Md Abu Sayeed Mondol, John A.
  Stankovic","iWash: A Smartwatch Handwashing Quality Assessment and Reminder System
  with Real-time Feedback in the Context of Infectious Disease","Published in Elsevier Smart Health Journal, 2021","Elsevier Smart Health, volume-19, pages-100171, March 2021",10.1016/j.smhl.2020.100171,,cs.HC cs.CY eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Washing hands properly and frequently is the simplest and most cost-effective
interventions to prevent the spread of infectious diseases. People are often
ignorant about proper handwashing in different situations and do not know if
they wash hands properly. Smartwatches are found to be effective for assessing
the quality of handwashing. However, the existing smartwatch based systems are
not comprehensive enough in terms of achieving accuracy as well as reminding
people to handwash and providing feedback to the user about the quality of
handwashing. On-device processing is often required to provide real-time
feedback to the user, and so it is important to develop a system that runs
efficiently on low-resource devices like smartwatches. However, none of the
existing systems for handwashing quality assessment are optimized for on-device
processing. We present iWash, a comprehensive system for quality assessment and
context-aware reminder for handwashing with real-time feedback using
smartwatches. iWash is a hybrid deep neural network based system that is
optimized for on-device processing to ensure high accuracy with minimal
processing time and battery usage. Additionally, it is a context-aware system
that detects when the user is entering home using a Bluetooth beacon and
provides reminders to wash hands. iWash also offers touch-free interaction
between the user and the smartwatch that minimizes the risk of germ
transmission. We collected a real-life dataset and conducted extensive
evaluations to demonstrate the performance of iWash. Compared to the existing
handwashing quality assessment systems, we achieve around 12% higher accuracy
for quality assessment, as well as we reduce the processing time and battery
usage by around 37% and 10%, respectively.
","[{'version': 'v1', 'created': 'Tue, 22 Sep 2020 04:52:35 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Nov 2021 01:25:48 GMT'}]",2021-11-22,"[['Samyoun', 'Sirat', ''], ['Shubha', 'Sudipta Saha', ''], ['Mondol', 'Md Abu Sayeed', ''], ['Stankovic', 'John A.', '']]","['Handwashing', 'Reminder', 'Sensors', 'Smartwatch', 'Infectious diseases', 'On-device computation']"
9337,1810.00360,Dawood Al Chanti,Dawood Al Chanti and Alice Caplier,"Improving Bag-of-Visual-Words Towards Effective Facial Expressive Image
  Classification","8 pages, 6 figures, Volume 5: VISAPPm year 2018,
  publisher=SciTePress, organization=INSTICC, isbn=978-989-758-290-5","In Proceedings of the 13th International Joint Conference on
  Computer Vision, Imaging and Computer Graphics Theory and Applications -
  Volume 5: VISAPP, ISBN 978-989-758-290-5, pages 145-152, year=2018",10.5220/0006537601450152,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Bag-of-Visual-Words (BoVW) approach has been widely used in the recent years
for image classification purposes. However, the limitations regarding optimal
feature selection, clustering technique, the lack of spatial organization of
the data and the weighting of visual words are crucial. These factors affect
the stability of the model and reduce performance. We propose to develop an
algorithm based on BoVW for facial expression analysis which goes beyond those
limitations. Thus the visual codebook is built by using k-Means++ method to
avoid poor clustering. To exploit reliable low level features, we search for
the best feature detector that avoids locating a large number of keypoints
which do not contribute to the classification process. Then, we propose to
compute the relative conjunction matrix in order to preserve the spatial order
of the data by coding the relationships among visual words. In addition, a
weighting scheme that reflects how important a visual word is with respect to a
given image is introduced. We speed up the learning process by using histogram
intersection kernel by Support Vector Machine to learn a discriminative
classifier. The efficiency of the proposed algorithm is compared with standard
bag of visual words method and with bag of visual words method with spatial
pyramid. Extensive experiments on the CK+, the MMI and the JAFFE databases show
good average recognition rates. Likewise, the ability to recognize spontaneous
and non-basic expressive states is investigated using the DynEmo database.
","[{'version': 'v1', 'created': 'Sun, 30 Sep 2018 11:28:24 GMT'}]",2018-10-02,"[['Chanti', 'Dawood Al', ''], ['Caplier', 'Alice', '']]","['BoVW', 'k-means++', 'Relative Conjunction Matrix', 'SIFT', 'Spatial Pyramids', 'TF.IDF']"
9338,2202.03310,Adam Day,Adam Day,"Exploratory analysis of text duplication in peer-review reveals
  peer-review fraud and paper mills",,,10.1007/s11192-022-04504-5,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Comments received from referees during peer-review were analysed to determine
the rates of duplication and partial duplication. It is very unusual for 2
different referees to submit identical comments, so the rare cases where this
happens are of interest. In some cases, it appears that paper-mills create fake
referee accounts and use them to submit fake peer-review reports. These include
comments that are copied and pasted across multiple reviews. Searching for
duplication in referee comments is therefore an effective method to search for
misconduct generally, since the forms of misconduct committed by paper-mills go
beyond peer-review fraud. These search methods allow the automatic detection of
misconduct candidates which may then be investigated carefully to confirm if
misconduct has indeed taken place. There are innocent reasons why referees
might share template reports, so these methods are not intended to
automatically diagnose misconduct.
","[{'version': 'v1', 'created': 'Mon, 7 Feb 2022 15:55:24 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Feb 2022 09:39:03 GMT'}]",2022-09-12,"[['Day', 'Adam', '']]","['research integrity', 'peer-review fraud', 'peer-review rings', 'paper mills']"
9339,2008.10515,Krikor Maroukian,Krikor Maroukian and Stephen R. Gulliver,Leading DevOps Practice and Principle Adoption,"16 pages, 5 Tables, 3 Figures","9th International Conference on Information Technology Convergence
  and Services (ITCSE 2020), May 30~31, 2020, Vancouver, Canada Volume Editors
  : David C. Wyld, Natarajan Meghanathan (Eds) ISBN : 978-1-925953-19-0",10.5121/csit.2020.100504,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This research, undertaken in highly structured software-intensive
organizations, outlines challenges associated to agile, lean and DevOps
practices and principles adoption. The approach collected data via a series of
thirty (30) interviews, with practitioners from the EMEA region (Czech
Republic, Estonia, Italy, Georgia, Greece, The Netherlands, Saudi Arabia, South
Africa, UAE, UK), working in nine (9) different industry domains and ten (10)
different countries. A set of agile, lean and DevOps practices and principles,
which organizations choose to include in their DevOps adoption journeys were
identified. The most frequently adopted structured service management
practices, contributing to DevOps practice adoption success, indicate that
those with software development and operation roles in DevOps-oriented
organizations benefit from existence of highly structured service management
approaches such as ITIL.
","[{'version': 'v1', 'created': 'Mon, 24 Aug 2020 15:29:34 GMT'}]",2020-08-25,"[['Maroukian', 'Krikor', ''], ['Gulliver', 'Stephen R.', '']]","['Agile', 'Lean', 'DevOps', 'Practices and Principles', 'IT service management', 'Leadership']"
9340,2209.10536,Kumar Akash,"Zhaobo K. Zheng, Kumar Akash, Teruhisa Misu, Vidya Krishmoorthy,
  Miaomiao Dong, Yuni Lee, Gaojian Huang","Identification of Adaptive Driving Style Preference through Implicit
  Inputs in SAE L2 Vehicles",,,10.1145/3536221.3556637,,cs.HC cs.LG cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A key factor to optimal acceptance and comfort of automated vehicle features
is the driving style. Mismatches between the automated and the driver preferred
driving styles can make users take over more frequently or even disable the
automation features. This work proposes identification of user driving style
preference with multimodal signals, so the vehicle could match user preference
in a continuous and automatic way. We conducted a driving simulator study with
36 participants and collected extensive multimodal data including behavioral,
physiological, and situational data. This includes eye gaze, steering grip
force, driving maneuvers, brake and throttle pedal inputs as well as foot
distance from pedals, pupil diameter, galvanic skin response, heart rate, and
situational drive context. Then, we built machine learning models to identify
preferred driving styles, and confirmed that all modalities are important for
the identification of user preference. This work paves the road for implicit
adaptive driving styles on automated vehicles.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2022 17:56:21 GMT'}]",2022-09-22,"[['Zheng', 'Zhaobo K.', ''], ['Akash', 'Kumar', ''], ['Misu', 'Teruhisa', ''], ['Krishmoorthy', 'Vidya', ''], ['Dong', 'Miaomiao', ''], ['Lee', 'Yuni', ''], ['Huang', 'Gaojian', '']]","['multimodal data', 'adaptive driving style', 'automated vehicle', 'gaze detection']"
9341,2201.02093,Abu Kaisar Mohammad Masum,"Mirajul Islam, Nushrat Jahan Ria, Jannatul Ferdous Ani, Abu Kaisar
  Mohammad Masum, Sheikh Abujar, Syed Akhter Hossain",Deep Learning Based Classification System For Recognizing Local Spinach,"10 pages, 4 figures, supplemental materials. Accepted in 2nd
  International Conference on Deep Learning, Artificial Intelligence and
  Robotics,(ICDLAIR) 2020",,10.1007/978-3-030-85365-5_1,,cs.CV cs.LG eess.IV,http://creativecommons.org/licenses/by/4.0/,"  A deep learning model gives an incredible result for image processing by
studying from the trained dataset. Spinach is a leaf vegetable that contains
vitamins and nutrients. In our research, a Deep learning method has been used
that can automatically identify spinach and this method has a dataset of a
total of five species of spinach that contains 3785 images. Four Convolutional
Neural Network (CNN) models were used to classify our spinach. These models
give more accurate results for image classification. Before applying these
models there is some preprocessing of the image data. For the preprocessing of
data, some methods need to happen. Those are RGB conversion, filtering, resize
& rescaling, and categorization. After applying these methods image data are
pre-processed and ready to be used in the classifier algorithms. The accuracy
of these classifiers is in between 98.68% - 99.79%. Among those models, VGG16
achieved the highest accuracy of 99.79%.
","[{'version': 'v1', 'created': 'Thu, 6 Jan 2022 15:10:41 GMT'}]",2022-01-07,"[['Islam', 'Mirajul', ''], ['Ria', 'Nushrat Jahan', ''], ['Ani', 'Jannatul Ferdous', ''], ['Masum', 'Abu Kaisar Mohammad', ''], ['Abujar', 'Sheikh', ''], ['Hossain', 'Syed Akhter', '']]","['Spinach Recognition', 'Convolutional Neural Network (CNN)', 'Deep Learning', 'Image Classification', 'Evaluation metric']"
9342,2011.11545,Xuhong Wang,"Xuhong Wang, Ding Lyu, Mengjian Li, Yang Xia, Qi Yang, Xinwen Wang,
  Xinguang Wang, Ping Cui, Yupu Yang, Bowen Sun, Zhenyu Guo","APAN: Asynchronous Propagation Attention Network for Real-time Temporal
  Graph Embedding","In Proceedings of the 2021 International Conference on Management of
  Data (SIGMOD/PODS '21)",,10.1145/3448016.3457564,,cs.AI cs.DB cs.SI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Limited by the time complexity of querying k-hop neighbors in a graph
database, most graph algorithms cannot be deployed online and execute
millisecond-level inference. This problem dramatically limits the potential of
applying graph algorithms in certain areas, such as financial fraud detection.
Therefore, we propose Asynchronous Propagation Attention Network, an
asynchronous continuous time dynamic graph algorithm for real-time temporal
graph embedding. Traditional graph models usually execute two serial
operations: first graph computation and then model inference. We decouple model
inference and graph computation step so that the heavy graph query operations
will not damage the speed of model inference. Extensive experiments demonstrate
that the proposed method can achieve competitive performance and 8.7 times
inference speed improvement in the meantime.
","[{'version': 'v1', 'created': 'Mon, 23 Nov 2020 16:58:50 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Nov 2020 03:12:47 GMT'}, {'version': 'v3', 'created': 'Wed, 16 Dec 2020 02:35:09 GMT'}, {'version': 'v4', 'created': 'Fri, 26 Mar 2021 05:42:05 GMT'}]",2021-07-06,"[['Wang', 'Xuhong', ''], ['Lyu', 'Ding', ''], ['Li', 'Mengjian', ''], ['Xia', 'Yang', ''], ['Yang', 'Qi', ''], ['Wang', 'Xinwen', ''], ['Wang', 'Xinguang', ''], ['Cui', 'Ping', ''], ['Yang', 'Yupu', ''], ['Sun', 'Bowen', ''], ['Guo', 'Zhenyu', '']]","['graph neural networks', 'dynamic graph', 'network embedding']"
9343,2003.02498,Palakorn Achananuparp,"Helena H. Lee, Ke Shu, Palakorn Achananuparp, Philips Kokoh Prasetyo,
  Yue Liu, Ee-Peng Lim, Lav R. Varshney","RecipeGPT: Generative Pre-training Based Cooking Recipe Generation and
  Evaluation System",Accepted to WWW 2020. Demo track paper,,10.1145/3366424.3383536,,cs.CL cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interests in the automatic generation of cooking recipes have been growing
steadily over the past few years thanks to a large amount of online cooking
recipes. We present RecipeGPT, a novel online recipe generation and evaluation
system. The system provides two modes of text generations: (1) instruction
generation from given recipe title and ingredients; and (2) ingredient
generation from recipe title and cooking instructions. Its back-end text
generation module comprises a generative pre-trained language model GPT-2
fine-tuned on a large cooking recipe dataset. Moreover, the recipe evaluation
module allows the users to conveniently inspect the quality of the generated
recipe contents and store the results for future reference. RecipeGPT can be
accessed online at https://recipegpt.org/.
","[{'version': 'v1', 'created': 'Thu, 5 Mar 2020 09:25:30 GMT'}]",2020-10-28,"[['Lee', 'Helena H.', ''], ['Shu', 'Ke', ''], ['Achananuparp', 'Palakorn', ''], ['Prasetyo', 'Philips Kokoh', ''], ['Liu', 'Yue', ''], ['Lim', 'Ee-Peng', ''], ['Varshney', 'Lav R.', '']]","['recipe generation', 'natural language generation', 'web application']"
9344,2011.13560,Mingfu Xue,"Mingfu Xue, Shichang Sun, Zhiyu Wu, Can He, Jian Wang, Weiqiang Liu","SocialGuard: An Adversarial Example Based Privacy-Preserving Technique
  for Social Images",,"Journal of Information Security and Applications, Vol. 63, 2021,
  102993",10.1016/j.jisa.2021.102993,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The popularity of various social platforms has prompted more people to share
their routine photos online. However, undesirable privacy leakages occur due to
such online photo sharing behaviors. Advanced deep neural network (DNN) based
object detectors can easily steal users' personal information exposed in shared
photos. In this paper, we propose a novel adversarial example based
privacy-preserving technique for social images against object detectors based
privacy stealing. Specifically, we develop an Object Disappearance Algorithm to
craft two kinds of adversarial social images. One can hide all objects in the
social images from being detected by an object detector, and the other can make
the customized sensitive objects be incorrectly classified by the object
detector. The Object Disappearance Algorithm constructs perturbation on a clean
social image. After being injected with the perturbation, the social image can
easily fool the object detector, while its visual quality will not be degraded.
We use two metrics, privacy-preserving success rate and privacy leakage rate,
to evaluate the effectiveness of the proposed method. Experimental results show
that, the proposed method can effectively protect the privacy of social images.
The privacy-preserving success rates of the proposed method on MS-COCO and
PASCAL VOC 2007 datasets are high up to 96.1% and 99.3%, respectively, and the
privacy leakage rates on these two datasets are as low as 0.57% and 0.07%,
respectively. In addition, compared with existing image processing methods (low
brightness, noise, blur, mosaic and JPEG compression), the proposed method can
achieve much better performance in privacy protection and image visual quality
maintenance.
","[{'version': 'v1', 'created': 'Fri, 27 Nov 2020 05:12:47 GMT'}]",2022-07-05,"[['Xue', 'Mingfu', ''], ['Sun', 'Shichang', ''], ['Wu', 'Zhiyu', ''], ['He', 'Can', ''], ['Wang', 'Jian', ''], ['Liu', 'Weiqiang', '']]","['Artificial intelligence security', 'Privacy protection', 'Socialphotos', 'Adversarial examples', 'Object detectors']"
9345,2005.11444,Colin Gordon,Colin S. Gordon,"Designing with Static Capabilities and Effects: Use, Mention, and
  Invariants",Preprint of ECOOP 2020 paper,,10.4230/LIPIcs.ECOOP.2020.10,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Capabilities (whether object or reference capabilities) are fundamentally
tools to restrict effects. Thus static capabilities (object or reference) and
effect systems take different technical machinery to the same core problem of
statically restricting or reasoning about effects in programs. Any time two
approaches can in principle address the same sets of problems, it becomes
important to understand the trade-offs between the approaches, how these
trade-offs might interact with the problem at hand.
  Experts who have worked in these areas tend to find the trade-offs somewhat
obvious, having considered them in context before. However, this kind of design
discussion is often written down only implicitly as comparison between two
approaches for a specific program reasoning problem, rather than as a
discussion of general trade-offs between general classes of techniques. As a
result, it is not uncommon to set out to solve a problem with one technique,
only to find the other better-suited.
  We discuss the trade-offs between static capabilities (specifically reference
capabilities) and effect systems, articulating the challenges each approach
tends to have in isolation, and how these are sometimes mitigated. We also put
our discussion in context, by appealing to examples of how these trade-offs
were considered in the course of developing prior systems in the area. Along
the way, we highlight how seemingly-minor aspects of type systems --
weakening/framing and the mere existence of type contexts -- play a subtle role
in the efficacy of these systems.
","[{'version': 'v1', 'created': 'Sat, 23 May 2020 01:52:03 GMT'}, {'version': 'v2', 'created': 'Tue, 26 May 2020 17:32:07 GMT'}]",2020-05-27,"[['Gordon', 'Colin S.', '']]","['Effect systems', 'reference capabilities', 'object capabilities']"
9346,1906.05554,Fabian Mager,"Fabian Mager, Dominik Baumann, Romain Jacob, Lothar Thiele, Sebastian
  Trimpe, Marco Zimmerling","Demo Abstract: Fast Feedback Control and Coordination with Mode Changes
  for Wireless Cyber-Physical Systems","Proceedings of the 18th International Conference on Information
  Processing in Sensor Networks (IPSN'19), April 16--18, 2019, Montreal, QC,
  Canada",,10.1145/3302506.3312483,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This abstract describes the first public demonstration of feedback control
and coordination of multiple physical systems over a dynamic multi-hop
low-power wireless network with update intervals of tens of milliseconds. Our
running system can dynamically change between different sets of application
tasks (e.g., sensing, actuation, control) executing on the spatially
distributed embedded devices, while closed-loop stability is provably
guaranteed even across those so-called mode changes. Moreover, any subset of
the devices can move freely, which does not affect closed-loop stability and
control performance as long as the wireless network remains connected.
","[{'version': 'v1', 'created': 'Thu, 13 Jun 2019 09:04:51 GMT'}]",2019-06-14,"[['Mager', 'Fabian', ''], ['Baumann', 'Dominik', ''], ['Jacob', 'Romain', ''], ['Thiele', 'Lothar', ''], ['Trimpe', 'Sebastian', ''], ['Zimmerling', 'Marco', '']]","['Wireless control', 'Closed-loop stability', 'Multi-agent systems', 'Multihop networks', 'Synchronous transmissions', 'Mode changes']"
9347,2106.10684,Toni Mancini,"Stefano Sinisi, Vadim Alimguzhin, Toni Mancini, Enrico Tronci,
  Federico Mari, Brigitte Leeners","Optimal personalised treatment computation through in silico clinical
  trials on patient digital twins","31 pages, 9 figures","Fundamenta Informaticae, 174(3-4):283-310, 2020",10.3233/FI-2020-1943,,cs.AI q-bio.QM,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In Silico Clinical Trials (ISTC), i.e., clinical experimental campaigns
carried out by means of computer simulations, hold the promise to decrease time
and cost for the safety and efficacy assessment of pharmacological treatments,
reduce the need for animal and human testing, and enable precision medicine. In
this paper we present methods and an algorithm that, by means of extensive
computer simulation--based experimental campaigns (ISTC) guided by intelligent
search, optimise a pharmacological treatment for an individual patient
(precision medicine). e show the effectiveness of our approach on a case study
involving a real pharmacological treatment, namely the downregulation phase of
a complex clinical protocol for assisted reproduction in humans.
","[{'version': 'v1', 'created': 'Sun, 20 Jun 2021 12:12:36 GMT'}]",2021-06-22,"[['Sinisi', 'Stefano', ''], ['Alimguzhin', 'Vadim', ''], ['Mancini', 'Toni', ''], ['Tronci', 'Enrico', ''], ['Mari', 'Federico', ''], ['Leeners', 'Brigitte', '']]","['Artificial Intelligence', 'Virtual Physiological Human', 'In Silico Clinical Trials', 'Simulation', 'Personalised Medicine', 'In Silico Treatment Optimisation']"
9348,2206.10272,Luk\'a\v{s} Sadlek,"Luk\'a\v{s} Sadlek, Pavel \v{C}eleda, Daniel Tovar\v{n}\'ak",Identification of Attack Paths Using Kill Chain and Attack Graphs,"IEEE/IFIP NOMS 2022 conference, 6 pages",,10.1109/NOMS54207.2022.9789803,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ever-evolving capabilities of cyber attackers force security
administrators to focus on the early identification of emerging threats.
Targeted cyber attacks usually consist of several phases, from initial
reconnaissance of the network environment to final impact on objectives. This
paper investigates the identification of multi-step cyber threat scenarios
using kill chain and attack graphs. Kill chain and attack graphs are threat
modeling concepts that enable determining weak security defense points. We
propose a novel kill chain attack graph that merges kill chain and attack
graphs together. This approach determines possible chains of attacker's actions
and their materialization within the protected network. The graph generation
uses a categorization of threats according to violated security properties. The
graph allows determining the kill chain phase the administrator should focus on
and applicable countermeasures to mitigate possible cyber threats. We
implemented the proposed approach for a predefined range of cyber threats,
especially vulnerability exploitation and network threats. The approach was
validated on a real-world use case. Publicly available implementation contains
a proof-of-concept kill chain attack graph generator.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2022 11:44:27 GMT'}]",2022-06-22,"[['Sadlek', 'Lukáš', ''], ['Čeleda', 'Pavel', ''], ['Tovarňák', 'Daniel', '']]","['kill chain', 'attack graph', 'threat identification', 'CVE', 'MITRE ATT&CK', 'STRIDE']"
9349,1602.05038,David Orden,"David Orden, Jose Manuel Gimenez-Guzman, Ivan Marsa-Maestre, Enrique
  de la Hoz",Spectrum graph coloring and applications to WiFi channel assignment,"28 pages, 7 figures, 11 tables, submitted. From the previous version,
  more experiments have been added and some rephrasing performed","Symmetry 2018, 10, 65",10.3390/sym10030065,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce and explore a family of vertex-coloring problems which,
surprisingly enough, have not been considered before despite stemming from the
problem of Wi-Fi channel assignment. Given a spectrum of colors, endowed with a
matrix of interferences between each pair of colors, the Threshold Spectrum
Coloring problem fixes the number of colors available and aims to minimize the
interference threshold, i.e., the maximum of the interferences at the vertices.
Conversely, the Chromatic Spectrum Coloring problem fixes a threshold and aims
to minimize the number of colors for which respecting that threshold is
possible. As main theoretical results, we prove tight upper bounds for the
solutions to each problem. Since both problems turn out to be NP-hard, we
complete the scene with experimental results. We propose a DSATUR-based
heuristic and study its performance to minimize the maximum vertex interference
in Wi-Fi channel assignment, both for randomly generated graphs and for a
real-world scenario. Further, for all these graphs we experimentally check the
goodness of the theoretical bounds.
","[{'version': 'v1', 'created': 'Tue, 16 Feb 2016 14:56:27 GMT'}, {'version': 'v2', 'created': 'Tue, 31 Jan 2017 09:33:48 GMT'}, {'version': 'v3', 'created': 'Wed, 19 Jul 2017 13:21:34 GMT'}]",2018-11-19,"[['Orden', 'David', ''], ['Gimenez-Guzman', 'Jose Manuel', ''], ['Marsa-Maestre', 'Ivan', ''], ['de la Hoz', 'Enrique', '']]","['graph coloring', 'interference', 'chromatic number', 'DSATUR', 'frequency assignment', 'Wi-Fi channel assignment']"
9350,2208.06147,Pino Caballero-Gil,"Jezabel Molina-Gil, Pino Caballero-Gil, C\'andido Caballero-Gil,
  Amparo F\'uster-Sabater","Software implementation of the SNOW 3G Generator on iOS and Android
  platforms",,"Logic Journal of IGPL 24 (1), 29-41, 2016",10.1093/jigpal/jzv042,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The standard for wireless communication of high-speed data in mobile phones
and data terminals, called LTE (Long-Term Evolution) and marketed as 4G/LTE, is
quickly being adopted worldwide. The security of this type of communication is
a crucial factor mainly due to its mobile and wireless nature. This work
includes a practical analysis of the SNOW 3G generator used to protect the
confidentiality and integrity in LTE communications. In particular, several
techniques to perform multiplications and LFSR operations have been studied and
implemented on both iOS and Android platforms. The evaluation of those
implementations led to some conclusions that could be used to improve the
efficiency of future implementations of the standard.
","[{'version': 'v1', 'created': 'Fri, 12 Aug 2022 07:30:20 GMT'}]",2022-08-15,"[['Molina-Gil', 'Jezabel', ''], ['Caballero-Gil', 'Pino', ''], ['Caballero-Gil', 'Cándido', ''], ['Fúster-Sabater', 'Amparo', '']]","['SNOW 3G', 'stream cipher', '4G/LTE', 'iOS and Android']"
9351,1910.11185,Mohamed Hamidi,"Mohamed Hamidi, Mohamed El Haziti, Hocine Cherifi, Driss Aboutajdine",A blind Robust Image Watermarking Approach exploiting the DFT Magnitude,"6 pages, 4 Figures, published in : (2015) IEEE/ACS 12th International
  Conference of Computer Systems and Applications (AICCSA)",,10.1109/AICCSA.2015.7507124,,cs.CR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the current progress in Internet, digital contents (video, audio and
images) are widely used. Distribution of multimedia contents is now faster and
it allows for easy unauthorized reproduction of information. Digital
watermarking came up while trying to solve this problem. Its main idea is to
embed a watermark into a host digital content without affecting its quality.
Moreover, watermarking can be used in several applications such as
authentication, copy control, indexation, Copyright protection, etc. In this
paper, we propose a blind robust image watermarking approach as a solution to
the problem of copyright protection of digital images. The underlying concept
of our method is to apply a discrete cosine transform (DCT) to the magnitude
resulting from a discrete Fourier transform (DFT) applied to the original
image. Then, the watermark is embedded by modifying the coefficients of the DCT
using a secret key to increase security. Experimental results show the
robustness of the proposed technique to a wide range of common attacks, e.g.,
Low-Pass Gaussian Filtering, JPEG compression, Gaussian noise, salt & pepper
noise, Gaussian Smoothing and Histogram equalization. The proposed method
achieves a Peak signal-to-noise-ration (PSNR) value greater than 66 (dB) and
ensures a perfect watermark extraction.
","[{'version': 'v1', 'created': 'Tue, 22 Oct 2019 00:26:13 GMT'}]",2019-10-25,"[['Hamidi', 'Mohamed', ''], ['Haziti', 'Mohamed El', ''], ['Cherifi', 'Hocine', ''], ['Aboutajdine', 'Driss', '']]","['copyright protection', 'image watermarking', 'DiscreteFourier Transform (DFT)', 'Discrete Cosine Transform (DCT)', 'embedded', 'blind', 'etc']"
9352,2003.07162,Jiwei Tan,"Xiang Li, Chao Wang, Jiwei Tan, Xiaoyi Zeng, Dan Ou, Bo Zheng","Adversarial Multimodal Representation Learning for Click-Through Rate
  Prediction","Accepted to WWW 2020, 10 pages",,10.1145/3366423.3380163,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For better user experience and business effectiveness, Click-Through Rate
(CTR) prediction has been one of the most important tasks in E-commerce.
Although extensive CTR prediction models have been proposed, learning good
representation of items from multimodal features is still less investigated,
considering an item in E-commerce usually contains multiple heterogeneous
modalities. Previous works either concatenate the multiple modality features,
that is equivalent to giving a fixed importance weight to each modality; or
learn dynamic weights of different modalities for different items through
technique like attention mechanism. However, a problem is that there usually
exists common redundant information across multiple modalities. The dynamic
weights of different modalities computed by using the redundant information may
not correctly reflect the different importance of each modality. To address
this, we explore the complementarity and redundancy of modalities by
considering modality-specific and modality-invariant features differently. We
propose a novel Multimodal Adversarial Representation Network (MARN) for the
CTR prediction task. A multimodal attention network first calculates the
weights of multiple modalities for each item according to its modality-specific
features. Then a multimodal adversarial network learns modality-invariant
representations where a double-discriminators strategy is introduced. Finally,
we achieve the multimodal item representations by combining both
modality-specific and modality-invariant representations. We conduct extensive
experiments on both public and industrial datasets, and the proposed method
consistently achieves remarkable improvements to the state-of-the-art methods.
Moreover, the approach has been deployed in an operational E-commerce system
and online A/B testing further demonstrates the effectiveness.
","[{'version': 'v1', 'created': 'Sat, 7 Mar 2020 15:50:23 GMT'}]",2020-03-17,"[['Li', 'Xiang', ''], ['Wang', 'Chao', ''], ['Tan', 'Jiwei', ''], ['Zeng', 'Xiaoyi', ''], ['Ou', 'Dan', ''], ['Zheng', 'Bo', '']]","['multimodal learning', 'adversarial learning', 'recurrent neural network', 'attention', 'representation learning', 'e-commerce search']"
9353,2203.11087,Nicolas Tempelmeier,"Nicolas Tempelmeier, Elena Demidova","Ovid: A Machine Learning Approach for Automated Vandalism Detection in
  OpenStreetMap",arXiv admin note: substantial text overlap with arXiv:2201.10406,SIGSPATIAL 2021,10.1145/3474717.3484204,,cs.LG cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  OpenStreetMap is a unique source of openly available worldwide map data,
increasingly adopted in real-world applications. Vandalism detection in
OpenStreetMap is critical and remarkably challenging due to the large scale of
the dataset, the sheer number of contributors, various vandalism forms, and the
lack of annotated data to train machine learning algorithms. This paper
presents Ovid - a novel machine learning method for vandalism detection in
OpenStreetMap. Ovid relies on a neural network architecture that adopts a
multi-head attention mechanism to effectively summarize information indicating
vandalism from OpenStreetMap changesets. To facilitate automated vandalism
detection, we introduce a set of original features that capture changeset,
user, and edit information. Our evaluation results on real-world vandalism data
demonstrate that the proposed Ovid method outperforms the baselines by 4.7
percentage points in F1 score.
","[{'version': 'v1', 'created': 'Mon, 21 Mar 2022 16:07:46 GMT'}]",2022-03-22,"[['Tempelmeier', 'Nicolas', ''], ['Demidova', 'Elena', '']]","['Vandalism Detection', 'OpenStreetMap', 'Machine Learning']"
9354,2206.00699,Moses Openja,"Moses Openja, Forough Majidi, Foutse Khomh, Bhagya Chembakottu, Heng
  Li",Studying the Practices of Deploying Machine Learning Projects on Docker,,"The International Conference on Evaluation and Assessment in
  Software Engineering 2022 (EASE 2022), June 13--15, 2022, Gothenburg, Sweden",10.1145/3530019.3530039,,cs.SE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Docker is a containerization service that allows for convenient deployment of
websites, databases, applications' APIs, and machine learning (ML) models with
a few lines of code. Studies have recently explored the use of Docker for
deploying general software projects with no specific focus on how Docker is
used to deploy ML-based projects.
  In this study, we conducted an exploratory study to understand how Docker is
being used to deploy ML-based projects. As the initial step, we examined the
categories of ML-based projects that use Docker. We then examined why and how
these projects use Docker, and the characteristics of the resulting Docker
images. Our results indicate that six categories of ML-based projects use
Docker for deployment, including ML Applications, MLOps/ AIOps, Toolkits, DL
Frameworks, Models, and Documentation. We derived the taxonomy of 21 major
categories representing the purposes of using Docker, including those specific
to models such as model management tasks (e.g., testing, training). We then
showed that ML engineers use Docker images mostly to help with the platform
portability, such as transferring the software across the operating systems,
runtimes such as GPU, and language constraints. However, we also found that
more resources may be required to run the Docker images for building ML-based
software projects due to the large number of files contained in the image
layers with deeply nested directories. We hope to shed light on the emerging
practices of deploying ML software projects using containers and highlight
aspects that should be improved.
","[{'version': 'v1', 'created': 'Wed, 1 Jun 2022 18:13:30 GMT'}]",2022-06-03,"[['Openja', 'Moses', ''], ['Majidi', 'Forough', ''], ['Khomh', 'Foutse', ''], ['Chembakottu', 'Bhagya', ''], ['Li', 'Heng', '']]","['Machine Learning', 'Deep Neural Network', 'Deployment', 'Docker']"
9355,2008.13566,Gordon Fraser,"Nina K\""orber, Lisa Bailey, Luisa Greifenstein, Gordon Fraser, Barbara
  Sabitzer, Marina Rottenhofer","An Experience of Introducing Primary School Children to Programming
  using Ozobots (Practical Report)","To be published in the proceedings of the 16th Workshop in Primary
  and Secondary Computing Education (WIPSCE)",,10.1145/3481312.3481347,,cs.CY cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Algorithmic thinking is a central concept in the context of computational
thinking, and it is commonly taught by computer programming. A recent trend is
to introduce basic programming concepts already very early on at primary school
level. There are, however, several challenges in teaching programming at this
level: Schools and teachers are often neither equipped nor trained
appropriately, and the best way to move from initial ""unplugged"" activities to
creating programs on a computer are still a matter of open debate. In this
paper, we describe our experience of a small INTERREG-project aiming at
supporting local primary schools in introducing children to programming
concepts using Ozobot robots. These robots have two distinct advantages: First,
they can be programmed with and without computers, thus helping the transition
from unplugged programming to programming with a computer. Second, they are
small and easy to transport, even when used together with tablet computers.
Although we learned in our outreach events that the use of Ozobots is not
without challenges, our overall experience is positive and can hopefully
support others in setting up first encounters with programming at primary
schools.
","[{'version': 'v1', 'created': 'Fri, 28 Aug 2020 07:36:07 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Aug 2021 04:40:37 GMT'}]",2021-08-17,"[['Körber', 'Nina', ''], ['Bailey', 'Lisa', ''], ['Greifenstein', 'Luisa', ''], ['Fraser', 'Gordon', ''], ['Sabitzer', 'Barbara', ''], ['Rottenhofer', 'Marina', '']]","['Ozobots', 'Programming Education', 'Primary School Programming']"
9356,1601.05575,Bita Shams,Bita Shams and Saman Haratizadeh,"SibRank: Signed Bipartite Network Analysis for Neighbor-based
  Collaborative Ranking",,"Physica A Statistical Mechanics and its Applications 458 (2016)
  364-377",10.1016/j.physa.2016.04.025,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Collaborative ranking is an emerging field of recommender systems that
utilizes users' preference data rather than rating values. Unfortunately,
neighbor-based collaborative ranking has gained little attention despite its
more flexibility and justifiability. This paper proposes a novel framework,
called SibRank that seeks to improve the state of the art neighbor-based
collaborative ranking methods. SibRank represents users' preferences as a
signed bipartite network, and finds similar users, through a novel personalized
ranking algorithm in signed networks.
","[{'version': 'v1', 'created': 'Thu, 21 Jan 2016 10:01:35 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Apr 2016 09:54:42 GMT'}]",2016-06-15,"[['Shams', 'Bita', ''], ['Haratizadeh', 'Saman', '']]","['Recommender System', 'Collaborative Ranking', 'Signed Network', 'Similarity Measure', 'Preference Data', 'Personalized Ranking;']"
9357,2001.09052,David Chaves-Fraga,"David Chaves-Fraga, Edna Ruckhaus, Freddy Priyatna, Maria-Esther
  Vidal, Oscar Corcho",Enhancing Virtual Ontology Based Access over Tabular Data with Morph-CSV,,,10.3233/SW-210432,,cs.DB,http://creativecommons.org/licenses/by/4.0/,"  Ontology-Based Data Access (OBDA) has traditionally focused on providing a
unified view of heterogeneous datasets, either by materializing integrated data
into RDF or by performing on-the fly querying via SPARQL query translation. In
the specific case of tabular datasets represented as several CSV or Excel
files, query translation approaches have been applied by considering each
source as a single table that can be loaded into a relational database
management system (RDBMS). Nevertheless, constraints over these tables are not
represented; thus, neither consistency among attributes nor indexes over tables
are enforced. As a consequence, efficiency of the SPARQL-to-SQL translation
process may be affected, as well as the completeness of the answers produced
during the evaluation of the generated SQL query. Our work is focused on
applying implicit constraints on the OBDA query translation process over
tabular data. We propose Morph-CSV, a framework for querying tabular data that
exploits information from typical OBDA inputs (e.g., mappings, queries) to
enforce constraints that can be used together with any SPARQL-to-SQL OBDA
engine. Morph-CSV relies on both a constraint component and a set of constraint
operators. For a given set of constraints, the operators are applied to each
type of constraint with the aim of enhancing query completeness and
performance. We evaluate Morph-CSV in several domains: e-commerce with the BSBM
benchmark; transportation with a benchmark using the GTFS dataset from the
Madrid subway; and biology with a use case extracted from the Bio2RDF project.
We compare and report the performance of two SPARQL-to-SQL OBDA engines,
without and with the incorporation of MorphCSV. The observed results suggest
that Morph-CSV is able to speed up the total query execution time by up to two
orders of magnitude, while it is able to produce all the query answers.
","[{'version': 'v1', 'created': 'Fri, 24 Jan 2020 15:26:03 GMT'}, {'version': 'v2', 'created': 'Sun, 21 Feb 2021 14:21:23 GMT'}]",2021-04-13,"[['Chaves-Fraga', 'David', ''], ['Ruckhaus', 'Edna', ''], ['Priyatna', 'Freddy', ''], ['Vidal', 'Maria-Esther', ''], ['Corcho', 'Oscar', '']]","['Knowledge Graphs', 'Tabular Data', 'Mapping Languages', 'Constraints']"
9358,1908.05399,Satnam Kaur Ms,"Satnam Kaur, Paramvir Singh","How does Object-Oriented Code Refactoring Influence Software Quality?
  Research Landscape and Challenges",To appear in a future issue of journal of Systems and Software,Journal of systems and software 2019,10.1016/j.jss.2019.110394,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Context: Software refactoring aims to improve software quality and developer
productivity. Numerous empirical studies investigating the impact of
refactoring activities on software quality have been conducted over the last
two decades. Objective: This study aims to perform a comprehensive systematic
mapping study of existing empirical studies on evaluation of the effect of
object-oriented code refactoring activities on software quality attributes.
Method: We followed a multi-stage scrutinizing process to select 142 primary
studies published till December 2017. The selected primary studies were further
classified based on several aspects to answer the research questions defined
for this work. In addition, we applied vote-counting approach to combine the
empirical results and their analysis reported in primary studies. Results: The
findings indicate that studies conducted in academic settings found more
positive impact of refactoring on software quality than studies performed in
industries. In general, refactoring activities caused all quality attributes to
improve or degrade except for cohesion, complexity, inheritance,
fault-proneness and power consumption attributes. Furthermore, individual
refactoring activities have variable effects on most quality attributes
explored in primary studies, indicating that refactoring does not always
improve all quality attributes. Conclusions: This study points out several open
issues which require further investigation, e.g., lack of industrial
validation, lesser coverage of refactoring activities, limited tool support,
etc.
","[{'version': 'v1', 'created': 'Thu, 15 Aug 2019 03:22:57 GMT'}]",2019-08-19,"[['Kaur', 'Satnam', ''], ['Singh', 'Paramvir', '']]","['Software quality', 'object-oriented software', 'refactoring activity', 'quality measures', 'systematic mapping study']"
9359,2004.08732,Christopher Duffy,Christopher Duffy and Sonja Linghui Shan,"On the existence and non-existence of improper homomorphisms of oriented
  and $2$-edge-coloured graphs to reflexive targets",,"Discrete Mathematics & Theoretical Computer Science, vol. 23 no.
  1, Graph Theory (March 29, 2021) dmtcs:7292",10.46298/dmtcs.6773,,cs.DM math.CO,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We consider non-trivial homomorphisms to reflexive oriented graphs in which
some pair of adjacent vertices have the same image. Using a notion of convexity
for oriented graphs, we study those oriented graphs that do not admit such
homomorphisms. We fully classify those oriented graphs with tree-width $2$ that
do not admit such homomorphisms and show that it is NP-complete to decide if a
graph admits an orientation that does not admit such homomorphisms. We prove
analogous results for $2$-edge-coloured graphs. We apply our results on
oriented graphs to provide a new tool in the study of chromatic number of
orientations of planar graphs -- a long-standing open problem.
","[{'version': 'v1', 'created': 'Sat, 18 Apr 2020 23:55:29 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Apr 2020 20:45:10 GMT'}, {'version': 'v3', 'created': 'Thu, 27 Aug 2020 18:07:13 GMT'}, {'version': 'v4', 'created': 'Mon, 15 Feb 2021 20:26:37 GMT'}, {'version': 'v5', 'created': 'Thu, 18 Mar 2021 14:59:33 GMT'}]",2021-10-04,"[['Duffy', 'Christopher', ''], ['Shan', 'Sonja Linghui', '']]","['oriented graph', '2-edge-coloured graph', 'graph colouring', 'complexity']"
9360,2003.00600,Chaoyang Song,"Yaohui Chen, Sing Le, Qiao Chu Tan, Oscar Lau, Chaoyang Song",A Lobster-inspired Hybrid Actuator With Rigid and Soft Components,"9 pages, 7 figures, accepted for ASME DETC 2017",,10.1115/detc2017-68082,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Soft actuators have drawn significant attention from researchers with an
inherently compliant design to address the safety issues in physical
human-robot interactions. However, they are also vulnerable and pose new
challenges in the design, fabrication, and analysis due to their inherent
material softness. In this paper, a novel hybrid actuator design is presented
with bio-inspirations from the lobster, or crustaceans in a broader
perspective. We enclose a soft chamber with rectangular cross-section using a
series of articulated rigid shells to produce bending under pneumatic input. By
mimicking the shell pattern of lobsters' abdomen, foldable rigid shells are
designed to provide the soft actuator with full protection throughout the
motion range. The articulation of the rigid shells predefines the actuator's
bending motions. As a result, the proposed design enables one to analyze this
hybrid actuator with simplified quasi-static models and rigid-body kinematics,
which are further validated by mechanical tests. This paper demonstrates that
the proposed hybrid actuator design is capable of bridging the major design
drawbacks of the entirely rigid and soft robots while preserving their
engineering merits in performance.
","[{'version': 'v1', 'created': 'Sun, 1 Mar 2020 22:04:29 GMT'}]",2020-03-03,"[['Chen', 'Yaohui', ''], ['Le', 'Sing', ''], ['Tan', 'Qiao Chu', ''], ['Lau', 'Oscar', ''], ['Song', 'Chaoyang', '']]","['biomimicry', 'soft robotics', 'hybrid actuator', 'pHRI']"
9361,1905.12032,Pu Zhao,"Pu Zhao, Siyue Wang, Cheng Gongye, Yanzhi Wang, Yunsi Fei, Xue Lin","Fault Sneaking Attack: a Stealthy Framework for Misleading Deep Neural
  Networks",Accepted by the 56th Design Automation Conference (DAC 2019),,10.1145/3316781.3317825,,cs.LG cs.CR cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the great achievements of deep neural networks (DNNs), the
vulnerability of state-of-the-art DNNs raises security concerns of DNNs in many
application domains requiring high reliability.We propose the fault sneaking
attack on DNNs, where the adversary aims to misclassify certain input images
into any target labels by modifying the DNN parameters. We apply ADMM
(alternating direction method of multipliers) for solving the optimization
problem of the fault sneaking attack with two constraints: 1) the
classification of the other images should be unchanged and 2) the parameter
modifications should be minimized. Specifically, the first constraint requires
us not only to inject designated faults (misclassifications), but also to hide
the faults for stealthy or sneaking considerations by maintaining model
accuracy. The second constraint requires us to minimize the parameter
modifications (using L0 norm to measure the number of modifications and L2 norm
to measure the magnitude of modifications). Comprehensive experimental
evaluation demonstrates that the proposed framework can inject multiple
sneaking faults without losing the overall test accuracy performance.
","[{'version': 'v1', 'created': 'Tue, 28 May 2019 18:56:44 GMT'}]",2019-05-30,"[['Zhao', 'Pu', ''], ['Wang', 'Siyue', ''], ['Gongye', 'Cheng', ''], ['Wang', 'Yanzhi', ''], ['Fei', 'Yunsi', ''], ['Lin', 'Xue', '']]","['Deep neural networks', 'Fault injection', 'ADMM']"
9362,2212.03217,Antonis Troumpoukis,"Antonis Troumpoukis, Stasinos Konstantopoulos, Nefeli
  Prokopaki-Kostopoulou",A geospatial source selector for federated GeoSPARQL querying,Published in Open Research Europe,"Open Res Europe 2022, 2:48",10.12688/openreseurope.14605.2,,cs.DB,http://creativecommons.org/licenses/by/4.0/,"  Background: Geospatial linked data brings into the scope of the Semantic Web
and its technologies, a wealth of datasets that combine semantically-rich
descriptions of resources with their geo-location. There are, however, various
Semantic Web technologies where technical work is needed in order to achieve
the full integration of geospatial data, and federated query processing is one
of these technologies. Methods: In this paper, we explore the idea of
annotating data sources with a bounding polygon that summarizes the spatial
extent of the resources in each data source, and of using such a summary as an
(additional) source selection criterion in order to reduce the set of sources
that will be tested as potentially holding relevant data. We present our source
selection method, and we discuss its correctness and implementation. Results:
We evaluate the proposed source selection using three different types of
summaries with different degrees of accuracy, against not using geospatial
summaries. We use datasets and queries from a practical use case that combines
crop-type data with water availability data for food security. The experimental
results suggest that more complex summaries lead to slower source selection
times, but also to more precise exclusion of unneeded sources. Moreover, we
observe the source selection runtime is (partially or fully) recovered by
shorter planning and execution runtimes. As a result, the federated sources are
not burdened by pointless querying from the federation engine. Conclusions: The
evaluation draws on data and queries from the agroenvironmental domain and
shows that our source selection method substantially improves the effectiveness
of federated GeoSPARQL query processing.
","[{'version': 'v1', 'created': 'Tue, 6 Dec 2022 18:38:16 GMT'}]",2022-12-07,"[['Troumpoukis', 'Antonis', ''], ['Konstantopoulos', 'Stasinos', ''], ['Prokopaki-Kostopoulou', 'Nefeli', '']]","['Federated and distributed query processing', 'Linked geospatial data', 'GeoSPARQL query processing', 'Source selection']"
9363,2108.08079,W{\l}odzimierz Drabent,W{\l}odzimierz Drabent,On correctness and completeness of an n queens program,"Under consideration in Theory and Practice of Logic Programming
  (TPLP). 13 pages, 1 figure. A re-worked version of arXiv:1909.07479","Theory and Practice of Logic Programming, Volume 22 , Issue 1 ,
  January 2022 , pp. 37 - 50",10.1017/S1471068421000223,,cs.LO cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Thom Fr\""uhwirth presented a short, elegant and efficient Prolog program for
the n queens problem. However the program may be seen as rather tricky and one
may not be convinced about its correctness. This paper explains the program in
a declarative way, and provides proofs of its correctness and completeness. The
specification and the proofs are declarative, i.e. they abstract from any
operational semantics. The specification is approximate, it is unnecessary to
describe the program's semantics exactly. Despite the program works on
non-ground terms, this work employs the standard semantics, based on logical
consequence and Herbrand interpretations.
  Another purpose of the paper is to present an example of precise declarative
reasoning about the semantics of a logic program.
  Under consideration in Theory and Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Wed, 18 Aug 2021 10:21:03 GMT'}]",2022-02-08,"[['Drabent', 'Włodzimierz', '']]","['logic programming', 'declarative programming', 'program completeness', 'programcorrectness', 'specification', 'non-ground answers']"
9364,2112.09435,Weijian Li,"Weijian Li, Masato Kikuchi, Tadachika Ozono","Product Information Browsing Support System Using Analytic Hierarchy
  Process","6 pages, 5 figures, IEEE/WIC/ACM International Conference on Web
  Intelligence (WI-IAT'21)",,10.1145/3486622.3493985,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Large-scale e-commerce sites can collect and analyze a large number of user
preferences and behaviors, and thus can recommend highly trusted products to
users. However, it is very difficult for individuals or non-corporate groups to
obtain large-scale user data. Therefore, we consider whether knowledge of the
decision-making domain can be used to obtain user preferences and combine it
with content-based filtering to design an information retrieval system. This
study describes the process of building a product information browsing support
system with high satisfaction based on product similarity and multiple other
perspectives about products on the Internet. We present the architecture of the
proposed system and explain the working principle of its constituent modules.
Finally, we demonstrate the effectiveness of the proposed system through an
evaluation experiment and a questionnaire.
","[{'version': 'v1', 'created': 'Fri, 17 Dec 2021 11:08:45 GMT'}]",2021-12-20,"[['Li', 'Weijian', ''], ['Kikuchi', 'Masato', ''], ['Ozono', 'Tadachika', '']]","['Analytic Hierarchy Process', 'Content-based filtering', 'Multiple-criteriadecision-making', 'TF-IDF', 'Information Retrieval']"
9365,1401.6060,Marco Mondelli,"Marco Mondelli, S. Hamed Hassani, Igal Sason, and R\""udiger Urbanke",Achieving Marton's Region for Broadcast Channels Using Polar Codes,"26 pages, 11 figures, accepted to IEEE Trans. Inform. Theory and
  presented in part at ISIT'14",,10.1109/ISIT.2014.6874844,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents polar coding schemes for the 2-user discrete memoryless
broadcast channel (DM-BC) which achieve Marton's region with both common and
private messages. This is the best achievable rate region known to date, and it
is tight for all classes of 2-user DM-BCs whose capacity regions are known. To
accomplish this task, we first construct polar codes for both the superposition
as well as the binning strategy. By combining these two schemes, we obtain
Marton's region with private messages only. Finally, we show how to handle the
case of common information. The proposed coding schemes possess the usual
advantages of polar codes, i.e., they have low encoding and decoding complexity
and a super-polynomial decay rate of the error probability.
  We follow the lead of Goela, Abbe, and Gastpar, who recently introduced polar
codes emulating the superposition and binning schemes. In order to align the
polar indices, for both schemes, their solution involves some degradedness
constraints that are assumed to hold between the auxiliary random variables and
the channel outputs. To remove these constraints, we consider the transmission
of $k$ blocks and employ a chaining construction that guarantees the proper
alignment of the polarized indices. The techniques described in this work are
quite general, and they can be adopted to many other multi-terminal scenarios
whenever there polar indices need to be aligned.
","[{'version': 'v1', 'created': 'Thu, 23 Jan 2014 17:23:38 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Feb 2014 17:09:15 GMT'}, {'version': 'v3', 'created': 'Fri, 10 Oct 2014 18:29:05 GMT'}]",2016-11-15,"[['Mondelli', 'Marco', ''], ['Hassani', 'S. Hamed', ''], ['Sason', 'Igal', ''], ['Urbanke', 'Rüdiger', '']]","['Binning', 'broadcast channel', 'Marton’s region', 'Marton-Gelfand-Pinsker (MGP) region', 'polar codes', 'polarizationalignment', 'superposition coding']"
9366,2005.13040,Rylan Perumal,Rylan Perumal and Terence L van Zyl,"Comparison of Recurrent Neural Network Architectures for Wildfire Spread
  Modelling",,"2020 International SAUPEC/RobMech/PRASA Conference, Cape Town,
  South Africa, 2020, pp. 1-6",10.1109/SAUPEC/RobMech/PRASA48453.2020.9078028,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wildfire modelling is an attempt to reproduce fire behaviour. Through active
fire analysis, it is possible to reproduce a dynamical process, such as
wildfires, with limited duration time series data. Recurrent neural networks
(RNNs) can model dynamic temporal behaviour due to their ability to remember
their internal input. In this paper, we compare the Gated Recurrent Unit (GRU)
and the Long Short-Term Memory (LSTM) network. We try to determine whether a
wildfire continues to burn and given that it does, we aim to predict which one
of the 8 cardinal directions the wildfire will spread in. Overall the GRU
performs better for longer time series than the LSTM. We have shown that
although we are reasonable at predicting the direction in which the wildfire
will spread, we are not able to asses if the wildfire continues to burn due to
the lack of auxiliary data.
","[{'version': 'v1', 'created': 'Tue, 26 May 2020 20:58:22 GMT'}]",2020-05-28,"[['Perumal', 'Rylan', ''], ['van Zyl', 'Terence L', '']]","['machine learning', 'wildfire spread modelling', 'recurrent neural networks']"
9367,2002.07443,Bestoun Ahmed Dr.,"Bestoun S. Ahmed, Eduard Enoiu, Wasif Afzal, Kamal Z. Zamli","An Evaluation of Monte Carlo-Based Hyper-Heuristic for Interaction
  Testing of Industrial Embedded Software Applications",37 Pages,Soft Computing Journal 2020,10.1007/s00500-020-04769-z,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hyper-heuristic is a new methodology for the adaptive hybridization of
meta-heuristic algorithms to derive a general algorithm for solving
optimization problems. This work focuses on the selection type of
hyper-heuristic, called the Exponential Monte Carlo with Counter (EMCQ).
Current implementations rely on the memory-less selection that can be
counterproductive as the selected search operator may not (historically) be the
best performing operator for the current search instance. Addressing this
issue, we propose to integrate the memory into EMCQ for combinatorial t-wise
test suite generation using reinforcement learning based on the Q-learning
mechanism, called Q-EMCQ. The limited application of combinatorial test
generation on industrial programs can impact the use of such techniques as
Q-EMCQ. Thus, there is a need to evaluate this kind of approach against
relevant industrial software, with a purpose to show the degree of interaction
required to cover the code as well as finding faults. We applied Q-EMCQ on 37
real-world industrial programs written in Function Block Diagram (FBD)
language, which is used for developing a train control management system at
Bombardier Transportation Sweden AB. The results of this study show that Q-EMCQ
is an efficient technique for test case generation. Additionally, unlike the
t-wise test suite generation, which deals with the minimization problem, we
have also subjected Q-EMCQ to a maximization problem involving the general
module clustering to demonstrate the effectiveness of our approach.
","[{'version': 'v1', 'created': 'Tue, 18 Feb 2020 09:28:14 GMT'}]",2020-02-19,"[['Ahmed', 'Bestoun S.', ''], ['Enoiu', 'Eduard', ''], ['Afzal', 'Wasif', ''], ['Zamli', 'Kamal Z.', '']]","['Search-based Software Engineering (SBSE)', 'Fault finding', 'Systemreliability', 'Software testing', 'Hyper-heuristics']"
9368,1910.11380,Sahar Hojjatinia,"Sahar Hojjatinia, Mahdi Aliyari Shoorehdeli, Zahra Fatahi, Zeinab
  Hojjatinia, Abbas Haghparast","Improving the Izhikevich Model Based on Rat Basolateral Amygdala and
  Hippocampus Neurons, and Recognizing Their Possible Firing Patterns","29 pages, 3 figures, 2 supplemental figures, 2 tables",Basic and Clinical Neuroscience 11.1 (2020): 79,10.32598/bcn.9.10.435,,cs.NE q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Introduction- Identifying the potential firing patterns following different
brain regions under normal and abnormal conditions increases our understanding
of events at the level of neural interactions in the brain. The Izhikevich
model is one of the simplest biologically plausible models, i.e. capable of
capturing the most recognized firing patterns of neurons. This property makes
the model efficient in simulating the large-scale networks of neurons.
Improving the Izhikevich model for adapting to the neuronal activity of the rat
brain with great accuracy would make the model effective for future neural
network implementations. Methods- Data sampling from two brain regions, the HIP
and BLA, was performed by the extracellular recordings of male rats, and spike
sorting was conducted by Plexon offline sorter. Further analyses were performed
through NeuroExplorer and MATLAB. To optimize the Izhikevich model parameters,
a genetic algorithm was used. The process of comparison in each iteration leads
to the survival of better populations until achieving the optimum solution.
Results- In the present study, the possible firing patterns of the real single
neurons of the HIP and BLA were identified. Additionally, an improved
Izhikevich model was achieved. Accordingly, the real neuronal spiking pattern
of these regions neurons and the corresponding cases of the Izhikevich neuron
spiking pattern were adjusted with great accuracy. Conclusion- This study was
conducted to elevate our knowledge of neural interactions in different
structures of the brain and accelerate the quality of future large-scale neural
network simulations, as well as reducing the modeling complexity. This aim was
achievable by performing the improved Izhikevich model, and inserting only the
plausible firing patterns, and eliminating unrealistic ones.
","[{'version': 'v1', 'created': 'Thu, 24 Oct 2019 19:04:36 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Nov 2019 00:02:16 GMT'}, {'version': 'v3', 'created': 'Mon, 1 Mar 2021 05:22:10 GMT'}, {'version': 'v4', 'created': 'Sat, 6 Mar 2021 20:36:40 GMT'}]",2021-03-09,"[['Hojjatinia', 'Sahar', ''], ['Shoorehdeli', 'Mahdi Aliyari', ''], ['Fatahi', 'Zahra', ''], ['Hojjatinia', 'Zeinab', ''], ['Haghparast', 'Abbas', '']]","['Izhikevich model', 'Firing pattern', 'Optimization', 'Genetic algorithm', 'Basolateral amygdala', 'Hippocampus']"
9369,2212.11119,Gustavo de Rosa,"Gustavo Henrique de Rosa, Jo\~ao Paulo Papa",A survey on text generation using generative adversarial networks,,Pattern Recognition 119 (2021): 108098,10.1016/j.patcog.2021.108098,,cs.CL cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  This work presents a thorough review concerning recent studies and text
generation advancements using Generative Adversarial Networks. The usage of
adversarial learning for text generation is promising as it provides
alternatives to generate the so-called ""natural"" language. Nevertheless,
adversarial text generation is not a simple task as its foremost architecture,
the Generative Adversarial Networks, were designed to cope with continuous
information (image) instead of discrete data (text). Thus, most works are based
on three possible options, i.e., Gumbel-Softmax differentiation, Reinforcement
Learning, and modified training objectives. All alternatives are reviewed in
this survey as they present the most recent approaches for generating text
using adversarial-based techniques. The selected works were taken from renowned
databases, such as Science Direct, IEEEXplore, Springer, Association for
Computing Machinery, and arXiv, whereas each selected work has been critically
analyzed and assessed to present its objective, methodology, and experimental
results.
","[{'version': 'v1', 'created': 'Tue, 20 Dec 2022 17:54:08 GMT'}]",2022-12-22,"[['de Rosa', 'Gustavo Henrique', ''], ['Papa', 'João Paulo', '']]","['Text Generation', 'Generative Adversarial Networks', 'Machine']"
9370,2112.07414,Mengkun She,"Mengkun She, Tim Wei{\ss}, Yifan Song, Peter Urban, Jens Greinert,
  Kevin K\""oser","Marine Bubble Flow Quantification Using Wide-Baseline Stereo
  Photogrammetry","56 pages, 26 figures",,10.1016/j.isprsjprs.2022.06.014,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reliable quantification of natural and anthropogenic gas release (e.g.\
CO$_2$, methane) from the seafloor into the water column, and potentially to
the atmosphere, is a challenging task. While ship-based echo sounders such as
single beam and multibeam systems allow detection of free gas, bubbles, in the
water even from a great distance, exact quantification utilizing the
hydroacoustic data requires additional parameters such as rise speed and bubble
size distribution. Optical methods are complementary in the sense that they can
provide high temporal and spatial resolution of single bubbles or bubble
streams from close distance. In this contribution we introduce a complete
instrument and evaluation method for optical bubble stream characterization
targeted at flows of up to 100ml/min and bubbles with a few millimeters radius.
The dedicated instrument employs a high-speed deep sea capable stereo camera
system that can record terabytes of bubble imagery when deployed at a seep site
for later automated analysis. Bubble characteristics can be obtained for short
sequences, then relocating the instrument to other locations, or in autonomous
mode of definable intervals up to several days, in order to capture bubble flow
variations due to e.g. tide dependent pressure changes or reservoir depletion.
Beside reporting the steps to make bubble characterization robust and
autonomous, we carefully evaluate the reachable accuracy to be in the range of
1-2\% of the bubble radius and propose a novel auto-calibration procedure that,
due to the lack of point correspondences, uses only the silhouettes of bubbles.
The system has been operated successfully in 1000m water depth at the Cascadia
margin offshore Oregon to assess methane fluxes from various seep locations.
Besides sample results we also report failure cases and lessons learnt during
deployment and method development.
","[{'version': 'v1', 'created': 'Tue, 14 Dec 2021 14:07:16 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Dec 2021 10:09:18 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Jul 2022 11:17:26 GMT'}]",2022-07-19,"[['She', 'Mengkun', ''], ['Weiß', 'Tim', ''], ['Song', 'Yifan', ''], ['Urban', 'Peter', ''], ['Greinert', 'Jens', ''], ['Köser', 'Kevin', '']]","['gas bubbles', 'gas flow rate quantification', 'bubble stream']"
9371,2003.08349,Tapajit Dey,"Tanner Fry, Tapajit Dey, Andrey Karnauch, Audris Mockus","A Dataset and an Approach for Identity Resolution of 38 Million Author
  IDs extracted from 2B Git Commits",,,10.1145/3379597.3387500,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The data collected from open source projects provide means to model large
software ecosystems, but often suffer from data quality issues, specifically,
multiple author identification strings in code commits might actually be
associated with one developer. While many methods have been proposed for
addressing this problem, they are either heuristics requiring manual tweaking,
or require too much calculation time to do pairwise comparisons for 38M author
IDs in, for example, the World of Code collection. In this paper, we propose a
method that finds all author IDs belonging to a single developer in this entire
dataset, and share the list of all author IDs that were found to have aliases.
To do this, we first create blocks of potentially connected author IDs and then
use a machine learning model to predict which of these potentially related IDs
belong to the same developer. We processed around 38 million author IDs and
found around 14.8 million IDs to have an alias, which belong to 5.4 million
different developers, with the median number of aliases being 2 per developer.
This dataset can be used to create more accurate models of developer behaviour
at the entire OSS ecosystem level and can be used to provide a service to
rapidly resolve new author IDs.
","[{'version': 'v1', 'created': 'Wed, 18 Mar 2020 17:22:45 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Mar 2020 20:45:01 GMT'}]",2020-03-31,"[['Fry', 'Tanner', ''], ['Dey', 'Tapajit', ''], ['Karnauch', 'Andrey', ''], ['Mockus', 'Audris', '']]","['Identity Resolution', 'Git Commits', 'Heuristics', 'Machine Learning', 'Data Sharing']"
9372,2108.09628,Junkang Wu,"Junkang Wu, Wentao Shi, Xuezhi Cao, Jiawei Chen, Wenqiang Lei, Fuzheng
  Zhang, Wei Wu and Xiangnan He","DisenKGAT: Knowledge Graph Embedding with Disentangled Graph Attention
  Network",CIKM2021,,10.1145/3459637.3482424,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge graph completion (KGC) has become a focus of attention across deep
learning community owing to its excellent contribution to numerous downstream
tasks. Although recently have witnessed a surge of work on KGC, they are still
insufficient to accurately capture complex relations, since they adopt the
single and static representations. In this work, we propose a novel
Disentangled Knowledge Graph Attention Network (DisenKGAT) for KGC, which
leverages both micro-disentanglement and macro-disentanglement to exploit
representations behind Knowledge graphs (KGs). To achieve
micro-disentanglement, we put forward a novel relation-aware aggregation to
learn diverse component representation. For macro-disentanglement, we leverage
mutual information as a regularization to enhance independence. With the
assistance of disentanglement, our model is able to generate adaptive
representations in terms of the given scenario. Besides, our work has strong
robustness and flexibility to adapt to various score functions. Extensive
experiments on public benchmark datasets have been conducted to validate the
superiority of DisenKGAT over existing methods in terms of both accuracy and
explainability.
","[{'version': 'v1', 'created': 'Sun, 22 Aug 2021 04:10:35 GMT'}, {'version': 'v2', 'created': 'Sun, 10 Oct 2021 12:26:09 GMT'}]",2021-10-12,"[['Wu', 'Junkang', ''], ['Shi', 'Wentao', ''], ['Cao', 'Xuezhi', ''], ['Chen', 'Jiawei', ''], ['Lei', 'Wenqiang', ''], ['Zhang', 'Fuzheng', ''], ['Wu', 'Wei', ''], ['He', 'Xiangnan', '']]","['Knowledge Graph', 'graph neural network', 'disentangled representation', 'mutual information']"
9373,2002.07944,Alejandro D\'iaz-Caro,Beniamino Accattoli and Alejandro D\'iaz-Caro,Functional Pearl: The Distributive $\lambda$-Calculus,17 pages. Accepted at FLOPS 2020,"LNCS 12073:13-32, 2020",10.1007/978-3-030-59025-3_3,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a simple extension of the $\lambda$-calculus with pairs---called
the distributive $\lambda$-calculus---obtained by adding a computational
interpretation of the valid distributivity isomorphism $A \Rightarrow (B\wedge
C)\ \ \equiv\ \ (A\Rightarrow B) \wedge (A\Rightarrow C)$ of simple types. We
study the calculus both as an untyped and as a simply typed setting. Key
features of the untyped calculus are confluence, the absence of clashes of
constructs, that is, evaluation never gets stuck, and a leftmost-outermost
normalization theorem, obtained with straightforward proofs. With respect to
simple types, we show that the new rules satisfy subject reduction if types are
considered up to the distributivity isomorphism. The main result is strong
normalization for simple types up to distributivity. The proof is a smooth
variation over the one for the $\lambda$-calculus with pairs and simple types.
","[{'version': 'v1', 'created': 'Wed, 19 Feb 2020 00:58:44 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jul 2020 12:17:05 GMT'}]",2020-10-23,"[['Accattoli', 'Beniamino', ''], ['Díaz-Caro', 'Alejandro', '']]","['λ-calculus', 'type isomorphisms', 'rewriting', 'normalization']"
9374,2103.05296,Gianluca Schiavo,"Gianluca Schiavo, Nadia Mana, Ornella Mich, Massimo Zancanaro, Remo
  Job","Attention-driven read-aloud technology increases reading comprehension
  in children with reading disabilities",,J Comput Assist Learn. 2021 1-12,10.1111/jcal.12530,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The paper presents the design of an assistive reading tool that integrates
read-aloud technology with eye-tracking to regulate the speed of reading and
support struggling readers in following the text while listening to it. The
paper describes the design rationale of this approach, following the theory of
auditory-visual integration, in terms of an automatic self-adaptable technique
based on the reader's gaze that provides an individualized interaction
experience. This tool has been assessed in a controlled experiment with 20
children (aged 8-10 years) with a diagnosis of dyslexia and a control group of
20 children with typical reading abilities. The results show that children with
reading difficulties improved their comprehension scores by 24% measured on a
standardized instrument for the assessment of reading comprehension, and that
children with more inaccurate reading (N=9) tended to benefit more. The
findings are discussed in terms of a better integration between audio and
visual text information, paving the way to improve standard read-aloud
technology with gaze-contingency and self-adaptable techniques to personalize
the reading experience.
","[{'version': 'v1', 'created': 'Tue, 9 Mar 2021 08:52:41 GMT'}]",2021-03-10,"[['Schiavo', 'Gianluca', ''], ['Mana', 'Nadia', ''], ['Mich', 'Ornella', ''], ['Zancanaro', 'Massimo', ''], ['Job', 'Remo', '']]","['human-computer interface', 'special needs education', 'reading difficulties', 'dyslexia', 'eye']"
9375,2103.02843,Agastya Bhati,"Agastya P. Bhati, Shunzhou Wan, Dario Alf\`e, Austin R. Clyde, Mathis
  Bode, Li Tan, Mikhail Titov, Andre Merzky, Matteo Turilli, Shantenu Jha,
  Roger R. Highfield, Walter Rocchia, Nicola Scafuri, Sauro Succi, Dieter
  Kranzlm\""uller, Gerald Mathias, David Wifling, Yann Donon, Alberto Di Meglio,
  Sofia Vallecorsa, Heng Ma, Anda Trifan, Arvind Ramanathan, Tom Brettin,
  Alexander Partin, Fangfang Xia, Xiaotan Duan, Rick Stevens, Peter V. Coveney","Pandemic Drugs at Pandemic Speed: Infrastructure for Accelerating
  COVID-19 Drug Discovery with Hybrid Machine Learning- and Physics-based
  Simulations on High Performance Computers",,Interface Focus. 2021. 11 (6): 20210018,10.1098/rsfs.2021.0018,,cs.DC cs.CE cs.LG physics.bio-ph q-bio.QM,http://creativecommons.org/licenses/by/4.0/,"  The race to meet the challenges of the global pandemic has served as a
reminder that the existing drug discovery process is expensive, inefficient and
slow. There is a major bottleneck screening the vast number of potential small
molecules to shortlist lead compounds for antiviral drug development. New
opportunities to accelerate drug discovery lie at the interface between machine
learning methods, in this case developed for linear accelerators, and
physics-based methods. The two in silico methods, each have their own
advantages and limitations which, interestingly, complement each other. Here,
we present an innovative infrastructural development that combines both
approaches to accelerate drug discovery. The scale of the potential resulting
workflow is such that it is dependent on supercomputing to achieve extremely
high throughput. We have demonstrated the viability of this workflow for the
study of inhibitors for four COVID-19 target proteins and our ability to
perform the required large-scale calculations to identify lead antiviral
compounds through repurposing on a variety of supercomputers.
","[{'version': 'v1', 'created': 'Thu, 4 Mar 2021 05:43:18 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Sep 2021 04:01:25 GMT'}]",2021-11-01,"[['Bhati', 'Agastya P.', ''], ['Wan', 'Shunzhou', ''], ['Alfè', 'Dario', ''], ['Clyde', 'Austin R.', ''], ['Bode', 'Mathis', ''], ['Tan', 'Li', ''], ['Titov', 'Mikhail', ''], ['Merzky', 'Andre', ''], ['Turilli', 'Matteo', ''], ['Jha', 'Shantenu', ''], ['Highfield', 'Roger R.', ''], ['Rocchia', 'Walter', ''], ['Scafuri', 'Nicola', ''], ['Succi', 'Sauro', ''], ['Kranzlmüller', 'Dieter', ''], ['Mathias', 'Gerald', ''], ['Wifling', 'David', ''], ['Donon', 'Yann', ''], ['Di Meglio', 'Alberto', ''], ['Vallecorsa', 'Sofia', ''], ['Ma', 'Heng', ''], ['Trifan', 'Anda', ''], ['Ramanathan', 'Arvind', ''], ['Brettin', 'Tom', ''], ['Partin', 'Alexander', ''], ['Xia', 'Fangfang', ''], ['Duan', 'Xiaotan', ''], ['Stevens', 'Rick', ''], ['Coveney', 'Peter V.', '']]","['Machine Learning', 'Artificial Intelligence', 'Novel Drug Design', 'Molecular']"
9376,2101.04804,Beatriz Asfora,Beatriz Arruda Asfora,"Embedded Computer Vision System Applied to a Four-Legged Line Follower
  Robot",,"23rd ABCM International Congress of Mechanical
  Engineering,December 6-11, 2015, Rio de Janeiro, RJ, Brazil",10.20906/CPS/COB-2015-1649,,cs.RO cs.CV cs.SY eess.IV eess.SY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Robotics can be defined as the connection of perception to action. Taking
this further, this project aims to drive a robot using an automated computer
vision embedded system, connecting the robot's vision to its behavior. In order
to implement a color recognition system on the robot, open source tools are
chosen, such as Processing language, Android system, Arduino platform and Pixy
camera. The constraints are clear: simplicity, replicability and financial
viability. In order to integrate Robotics, Computer Vision and Image
Processing, the robot is applied on a typical mobile robot's issue: line
following. The problem of distinguishing the path from the background is
analyzed through different approaches: the popular Otsu's Method, thresholding
based on color combinations through experimentation and color tracking via hue
and saturation. Decision making of where to move next is based on the line
center of the path and is fully automated. Using a four-legged robot as
platform and a camera as its only sensor, the robot is capable of successfully
follow a line. From capturing the image to moving the robot, it's evident how
integrative Robotics can be. The issue of this paper alone involves knowledge
of Mechanical Engineering, Electronics, Control Systems and Programming.
Everything related to this work was documented and made available on an open
source online page, so it can be useful in learning and experimenting with
robotics.
","[{'version': 'v1', 'created': 'Tue, 12 Jan 2021 23:52:53 GMT'}]",2021-01-14,"[['Asfora', 'Beatriz Arruda', '']]","['Computer Vision', 'Four-Legged Robot', 'Line Follower', 'Thresholding  1']"
9377,2012.04203,Yuqi Kong,"Yuqi Kong, Fanchao Meng, Benjamin Carterette",A Topological Method for Comparing Document Semantics,"9 pages, 3 tables, 9th International Conference on Natural Language
  Processing (NLP 2020)","pp. 143-151, 2020. CS & IT - CSCP 2020",10.5121/csit.2020.101411,,cs.CL cs.IR,http://creativecommons.org/licenses/by-sa/4.0/,"  Comparing document semantics is one of the toughest tasks in both Natural
Language Processing and Information Retrieval. To date, on one hand, the tools
for this task are still rare. On the other hand, most relevant methods are
devised from the statistic or the vector space model perspectives but nearly
none from a topological perspective. In this paper, we hope to make a different
sound. A novel algorithm based on topological persistence for comparing
semantics similarity between two documents is proposed. Our experiments are
conducted on a document dataset with human judges' results. A collection of
state-of-the-art methods are selected for comparison. The experimental results
show that our algorithm can produce highly human-consistent results, and also
beats most state-of-the-art methods though ties with NLTK.
","[{'version': 'v1', 'created': 'Tue, 8 Dec 2020 04:21:40 GMT'}]",2020-12-09,"[['Kong', 'Yuqi', ''], ['Meng', 'Fanchao', ''], ['Carterette', 'Benjamin', '']]","['Topological Graph', 'Document Semantics Comparison', 'Natural Language Processing', 'Information Retrieval', 'Topological Persistence']"
9378,2007.09436,Konstantinos Kallas,"Nikos Vasilakis (MIT), Konstantinos Kallas (University of
  Pennsylvania), Konstantinos Mamouras (Rice University), Achilleas
  Benetopoulos (Unaffiliated), Lazar Cvetkovi\'c (University of Belgrade)",PaSh: Light-touch Data-Parallel Shell Processing,"18 pages, 12 figures",,10.1145/3447786.3456228,,cs.DC cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents {\scshape PaSh}, a system for parallelizing POSIX shell
scripts. Given a script, {\scshape PaSh} converts it to a dataflow graph,
performs a series of semantics-preserving program transformations that expose
parallelism, and then converts the dataflow graph back into a script -- one
that adds POSIX constructs to explicitly guide parallelism coupled with
{\scshape PaSh}-provided {\scshape Unix}-aware runtime primitives for
addressing performance- and correctness-related issues. A lightweight
annotation language allows command developers to express key parallelizability
properties about their commands. An accompanying parallelizability study of
POSIX and GNU commands -- two large and commonly used groups -- guides the
annotation language and optimized aggregator library that {\scshape PaSh} uses.
Finally, {\scshape PaSh}'s {\scshape PaSh}'s extensive evaluation over 44
unmodified {\scshape Unix} scripts shows significant speedups
($0.89$--$61.1\times$, avg: $6.7\times$) stemming from the combination of its
program transformations and runtime primitives.
","[{'version': 'v1', 'created': 'Sat, 18 Jul 2020 14:14:11 GMT'}, {'version': 'v2', 'created': 'Sun, 11 Oct 2020 20:24:41 GMT'}, {'version': 'v3', 'created': 'Mon, 4 Jan 2021 02:04:55 GMT'}, {'version': 'v4', 'created': 'Sat, 3 Apr 2021 16:02:11 GMT'}]",2021-04-06,"[['Vasilakis', 'Nikos', '', 'MIT'], ['Kallas', 'Konstantinos', '', 'University of\n  Pennsylvania'], ['Mamouras', 'Konstantinos', '', 'Rice University'], ['Benetopoulos', 'Achilleas', '', 'Unaffiliated'], ['Cvetković', 'Lazar', '', 'University of Belgrade']]","['Automatic Parallelization', 'Shell', 'Pipelines', 'Sourceto-source compiler', 'POSIX', 'Unix']"
9379,1810.06240,Malte Renken,"Vincent Froese, Brijnesh Jain, Rolf Niedermeier, Malte Renken",Comparing Temporal Graphs Using Dynamic Time Warping,,,10.1007/s13278-020-00664-5,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Within many real-world networks the links between pairs of nodes change over
time. Thus, there has been a recent boom in studying temporal graphs.
Recognizing patterns in temporal graphs requires a proximity measure to compare
different temporal graphs. To this end, we propose to study dynamic time
warping on temporal graphs. We define the dynamic temporal graph warping
distance (dtgw) to determine the dissimilarity of two temporal graphs. Our
novel measure is flexible and can be applied in various application domains. We
show that computing the dtgw-distance is a challenging (in general) NP-hard
optimization problem and identify some polynomial-time solvable special cases.
Moreover, we develop a quadratic programming formulation and an efficient
heuristic. In experiments on real-word data we show that the heuristic performs
very well and that our dtgw-distance performs favorably in de-anonymizing
networks compared to other approaches.
","[{'version': 'v1', 'created': 'Mon, 15 Oct 2018 09:21:36 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Aug 2019 13:39:14 GMT'}, {'version': 'v3', 'created': 'Mon, 9 Mar 2020 08:57:12 GMT'}, {'version': 'v4', 'created': 'Mon, 6 Jul 2020 12:41:12 GMT'}]",2020-07-07,"[['Froese', 'Vincent', ''], ['Jain', 'Brijnesh', ''], ['Niedermeier', 'Rolf', ''], ['Renken', 'Malte', '']]","['temporal graph matching', 'vertex signatures', 'heuristic optimization', 'quadraticprogramming', 'parameterized algorithms']"
9380,2009.01197,Rafael Melo,"Willian C. S. Martinho, Rafael A. Melo, Kenneth S\""orensen","An enhanced simulation-based iterated local search metaheuristic for
  gravity fed water distribution network design optimization",,,10.1016/j.cor.2021.105429,,cs.AI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The gravity fed water distribution network design (WDND) optimization problem
consists in determining the pipe diameters of a water network such that
hydraulic constraints are satisfied and the total cost is minimized.
Traditionally, such design decisions are made on the basis of expert
experience. When networks increase in size, however, rules of thumb will rarely
lead to near optimal decisions. Over the past thirty years, a large number of
techniques have been developed to tackle the problem of optimally designing a
water distribution network. In this paper, we tackle the NP-hard water
distribution network design (WDND) optimization problem in a multi-period
setting where time varying demand patterns occur. We propose a new
simulation-based iterated local search metaheuristic which further explores the
structure of the problem in an attempt to obtain high quality solutions.
Computational experiments show that our approach is very competitive as it is
able to improve over a state-of-the-art metaheuristic for most of the performed
tests. Furthermore, it converges much faster to low cost solutions and
demonstrates a more robust performance in that it obtains smaller deviations
from the best known solutions.
","[{'version': 'v1', 'created': 'Wed, 2 Sep 2020 17:12:46 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Mar 2021 11:29:27 GMT'}, {'version': 'v3', 'created': 'Mon, 7 Jun 2021 10:38:52 GMT'}]",2021-12-28,"[['Martinho', 'Willian C. S.', ''], ['Melo', 'Rafael A.', ''], ['Sörensen', 'Kenneth', '']]","['metaheuristics', 'water distribution network design', 'iterated local search', 'simulation']"
9381,1902.05376,Guangcun Shan Prof.,"Guangcun Shan, Hongyu Wang and Wei Liang","Robust Encoder-Decoder Learning Framework towards Offline Handwritten
  Mathematical Expression Recognition Based on Multi-Scale Deep Neural Network","11 pages, 16 figures","Sci China Inf Sci, 2021, 64(3): 139101, doi:
  10.1007/s11432-018-9824-9",10.1007/s11432-018-9824-9,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Offline handwritten mathematical expression recognition is a challenging
task, because handwritten mathematical expressions mainly have two problems in
the process of recognition. On one hand, it is how to correctly recognize
different mathematical symbols. On the other hand, it is how to correctly
recognize the two-dimensional structure existing in mathematical expressions.
Inspired by recent work in deep learning, a new neural network model that
combines a Multi-Scale convolutional neural network (CNN) with an Attention
recurrent neural network (RNN) is proposed to identify two-dimensional
handwritten mathematical expressions as one-dimensional LaTeX sequences. As a
result, the model proposed in the present work has achieved a WER error of
25.715% and ExpRate of 28.216%.
","[{'version': 'v1', 'created': 'Fri, 8 Feb 2019 03:29:49 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Feb 2019 09:29:27 GMT'}, {'version': 'v3', 'created': 'Thu, 28 May 2020 11:06:38 GMT'}]",2020-05-29,"[['Shan', 'Guangcun', ''], ['Wang', 'Hongyu', ''], ['Liang', 'Wei', '']]","['Encoder-Decoder', 'Handwritten mathematical expression recognition', 'Multi-Scale', 'Attention']"
9382,2301.01707,Dmitry Kulyabov,Anna V. Korolkova and Migran N. Gevorkyan and Dmitry S. Kulyabov,Implementation of hyperbolic complex numbers in Julia language,in English; in Russian,,10.22363/2658-4670-2022-30-4-318-329,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Hyperbolic complex numbers are used in the description of
hyperbolic spaces. One of the well-known examples of such spaces is the
Minkowski space, which plays a leading role in the problems of the special
theory of relativity and electrodynamics. However, such numbers are not very
common in different programming languages. Purpose: Of interest is the
implementation of hyperbolic complex in scientific programming languages, in
particular, in the Julia language. Methods: The Julia language is based on the
concept of multiple dispatch. This concept is an extension of the concept of
polymorphism for object-oriented programming languages. To implement hyperbolic
complex numbers, the multiple dispatching approach of the Julia language was
used. Results: The result is a library that implements hyperbolic numbers.
Conclusions: Based on the results of the study, we can conclude that the
concept of multiple dispatching in scientific programming languages is
convenient and natural.
","[{'version': 'v1', 'created': 'Wed, 4 Jan 2023 17:10:39 GMT'}]",2023-01-05,"[['Korolkova', 'Anna V.', ''], ['Gevorkyan', 'Migran N.', ''], ['Kulyabov', 'Dmitry S.', '']]","['Julia programming language', 'multiple dispatch', 'abstract data types', 'type conversion', 'parametricstructures', 'hyperbolic complex numbers']"
9383,1906.04059,Kyongmin Yeo,Kyongmin Yeo,Data-driven Reconstruction of Nonlinear Dynamics from Sparse Observation,,,10.1016/j.jcp.2019.06.039,,cs.NE physics.comp-ph physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a data-driven model to reconstruct nonlinear dynamics from a very
sparse times series data, which relies on the strength of the echo state
network (ESN) in learning nonlinear representation of data. With an assumption
of the universal function approximation capability of ESN, it is shown that the
reconstruction problem can be formulated as a fixed-point problem, in which the
trajectory of the dynamical system is a fixed point of the ESN. An
under-relaxed fixed-point iteration is proposed to reconstruct the nonlinear
dynamics from a sparse observation. The proposed fixed-point ESN is tested
against both univariate and multivariate chaotic dynamical systems by randomly
removing up to 95% of the data. It is shown that the fixed-point ESN is able to
reconstruct the complex dynamics from only 5 ~ 10% of the data. For a
relatively simple non-chaotic dynamical system, the numerical experiments on a
forced van der Pol oscillator show that it is possible to reconstruct the
nonlinear dynamics from only 1~2% of the data.
","[{'version': 'v1', 'created': 'Mon, 10 Jun 2019 15:04:14 GMT'}]",2019-07-24,"[['Yeo', 'Kyongmin', '']]","['echo state network', 'reservoir computing', 'nonlinear dynamicalsystem', 'time series', 'sparse observation', 'imputation']"
9384,2106.03114,Thi-Hoa Nguyen,"Thi-Hoa Nguyen, Ren\'e R. Hiemstra, Dominik Schillinger","Leveraging spectral analysis to elucidate membrane locking and unlocking
  in isogeometric finite element formulations of the curved Euler-Bernoulli
  beam",,,10.1016/j.cma.2021.114240,,cs.CE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this paper, we take a fresh look at using spectral analysis for assessing
locking phenomena in finite element formulations. We propose to ""measure""
locking by comparing the difference between eigenvalue and mode error curves
computed on coarse meshes with ""asymptotic"" error curves computed on ""overkill""
meshes, both plotted with respect to the normalized mode number. To demonstrate
the intimate relation between membrane locking and spectral accuracy, we focus
on the example of a circular ring discretized with isogeometric curved
Euler-Bernoulli beam elements. We show that the
transverse-displacement-dominating modes are locking-prone, while the
circumferential-displacement-dominating modes are naturally locking-free. We
use eigenvalue and mode errors to assess five isogeometric finite element
formulations in terms of their locking-related efficiency: the
displacement-based formulation with full and reduced integration and three
locking-free formulations based on the B-bar, discrete strain gap and
Hellinger-Reissner methods. Our study shows that spectral analysis uncovers
locking-related effects across the spectrum of eigenvalues and eigenmodes,
rigorously characterizing membrane locking in the displacement-based
formulation and unlocking in the locking-free formulations.
","[{'version': 'v1', 'created': 'Sun, 6 Jun 2021 13:09:28 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Nov 2021 12:00:05 GMT'}]",2021-11-02,"[['Nguyen', 'Thi-Hoa', ''], ['Hiemstra', 'René R.', ''], ['Schillinger', 'Dominik', '']]","['Spectral analysis', 'Membrane locking', 'Euler-Bernoulli curved beam elements', 'Closedcircular ring', 'Isogeometric analysis']"
9385,2203.15745,Ahmad Naghavi,"Ahmad Naghavi, Mohammad Sadegh Fazel, Mojtaba Beheshti, Ehsan Yazdian","Super-resolving multiple scatterers detection in SAR Tomography assisted
  by correlation information",,,10.1117/1.JRS.14.034517,,cs.IT math.IT,http://creativecommons.org/licenses/by/4.0/,"  This paper proposes a method for detecting multiple scatterers (targets) in
the elevation direction for synthetic aperture radar (SAR) tomography. The
proposed method can resolve closely spaced targets through a twostep procedure.
In the first step, coarse detection is performed with a successive cancellation
scheme in which possible locations of targets are marked. Then, in the second
step, by searching in the reduced search space which is finely 10 gridded, the
accurate location of the targets is found. For estimating the actual number of
targets, a model order selection scheme is used in two cases of known and
unknown noise variance. Also, by analytical investigation of the probability of
detection for the proposed method, the effect of the influential parameters on
the detection ability is explicitly demonstrated. Compared to the
super-resolution methods based on compressed sensing (CS), the proposed method
has a lower computational cost and higher estimation accuracy, especially at
low signal-to-noise ratio regime. 15 Simulation results show the superiority of
the proposed method in terms of both 3D scatterer reconstruction and detection
ability
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2022 16:54:01 GMT'}]",2022-04-11,"[['Naghavi', 'Ahmad', ''], ['Fazel', 'Mohammad Sadegh', ''], ['Beheshti', 'Mojtaba', ''], ['Yazdian', 'Ehsan', '']]","['Synthetic aperture radar tomography (TomoSAR)', 'nonlinear least square (NLS)', 'complexity reduction', 'detection', 'model order selection']"
9386,1811.06912,Mengyue Hang,"Mengyue Hang, Ian Pytlarz and Jennifer Neville","Exploring Student Check-In Behavior for Improved Point-of-Interest
  Prediction",published in KDD'18,,10.1145/3219819.3219902,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the availability of vast amounts of user visitation history on
location-based social networks (LBSN), the problem of Point-of-Interest (POI)
prediction has been extensively studied. However, much of the research has been
conducted solely on voluntary checkin datasets collected from social apps such
as Foursquare or Yelp. While these data contain rich information about
recreational activities (e.g., restaurants, nightlife, and entertainment),
information about more prosaic aspects of people's lives is sparse. This not
only limits our understanding of users' daily routines, but more importantly
the modeling assumptions developed based on characteristics of recreation-based
data may not be suitable for richer check-in data. In this work, we present an
analysis of education ""check-in"" data using WiFi access logs collected at
Purdue University. We propose a heterogeneous graph-based method to encode the
correlations between users, POIs, and activities, and then jointly learn
embeddings for the vertices. We evaluate our method compared to previous
state-of-the-art POI prediction methods, and show that the assumptions made by
previous methods significantly degrade performance on our data with dense(r)
activity signals. We also show how our learned embeddings could be used to
identify similar students (e.g., for friend suggestions).
","[{'version': 'v1', 'created': 'Tue, 25 Sep 2018 21:07:18 GMT'}]",2018-11-19,"[['Hang', 'Mengyue', ''], ['Pytlarz', 'Ian', ''], ['Neville', 'Jennifer', '']]","['Location-based social networks', 'network embedding', 'heterogeneous graphs', 'representation learning']"
9387,2211.03306,Atsushi Miyauchi,"Yasushi Kawase, Atsushi Miyauchi, Hanna Sumita",Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks,Accepted to WSDM 2023,,10.1145/3539597.3570444,,cs.SI cs.DS,http://creativecommons.org/licenses/by/4.0/,"  Network analysis has played a key role in knowledge discovery and data
mining. In many real-world applications in recent years, we are interested in
mining multilayer networks, where we have a number of edge sets called layers,
which encode different types of connections and/or time-dependent connections
over the same set of vertices. Among many network analysis techniques, dense
subgraph discovery, aiming to find a dense component in a network, is an
essential primitive with a variety of applications in diverse domains. In this
paper, we introduce a novel optimization model for dense subgraph discovery in
multilayer networks. Our model aims to find a stochastic solution, i.e., a
probability distribution over the family of vertex subsets, rather than a
single vertex subset, whereas it can also be used for obtaining a single vertex
subset. For our model, we design an LP-based polynomial-time exact algorithm.
Moreover, to handle large-scale networks, we also devise a simple, scalable
preprocessing algorithm, which often reduces the size of the input networks
significantly and results in a substantial speed-up. Computational experiments
demonstrate the validity of our model and the effectiveness of our algorithms.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2022 04:52:54 GMT'}]",2022-11-08,"[['Kawase', 'Yasushi', ''], ['Miyauchi', 'Atsushi', ''], ['Sumita', 'Hanna', '']]","['network analysis', 'multilayer networks', 'dense subgraph discovery', 'stochastic solutions']"
9388,2202.04141,Manuel Birlo,"Manuel Birlo, P.J. ""Eddie'' Edwards, Matthew Clarkson, Danail Stoyanov","Utility of Optical See-Through Head Mounted Displays in Augmented
  Reality-Assisted Surgery: A systematic review",,"Medical Image Analysis, 2022, 102361, ISSN 1361-8415",10.1016/j.media.2022.102361,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This article presents a systematic review of optical see-through head mounted
display (OST-HMD) usage in augmented reality (AR) surgery applications from
2013 to 2020. Articles were categorised by: OST-HMD device, surgical
speciality, surgical application context, visualisation content, experimental
design and evaluation, accuracy and human factors of human-computer
interaction. 91 articles fulfilled all inclusion criteria. Some clear trends
emerge. The Microsoft HoloLens increasingly dominates the field, with
orthopaedic surgery being the most popular application (28.6\%). By far the
most common surgical context is surgical guidance (n=58) and segmented
preoperative models dominate visualisation (n = 40). Experiments mainly involve
phantoms (n = 43) or system setup (n = 21), with patient case studies ranking
third (n = 19), reflecting the comparative infancy of the field. Experiments
cover issues from registration to perception with very different accuracy
results. Human factors emerge as significant to OST-HMD utility. Some factors
are addressed by the systems proposed, such as attention shift away from the
surgical site and mental mapping of 2D images to 3D patient anatomy. Other
persistent human factors remain or are caused by OST-HMD solutions, including
ease of use, comfort and spatial perception issues. The significant upward
trend in published articles is clear, but such devices are not yet established
in the operating room and clinical studies showing benefit are lacking. A
focused effort addressing technical registration and perceptual factors in the
lab coupled with design that incorporates human factors considerations to solve
clear clinical problems should ensure that the significant current research
efforts will succeed.
","[{'version': 'v1', 'created': 'Tue, 8 Feb 2022 21:02:12 GMT'}]",2022-02-10,"[['Birlo', 'Manuel', ''], ['Edwards', 'P. J. ""Eddie\'\'', ''], ['Clarkson', 'Matthew', ''], ['Stoyanov', 'Danail', '']]","['Augmented reality', 'Head-mounted displays', 'Optical see-through', 'Human factors']"
9389,2108.06040,Yongqi Zhang,Yongqi Zhang and Quanming Yao,Knowledge Graph Reasoning with Relational Digraph,,,10.1145/3485447.3512008,,cs.AI cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Reasoning on the knowledge graph (KG) aims to infer new facts from existing
ones. Methods based on the relational path have shown strong, interpretable,
and transferable reasoning ability. However, paths are naturally limited in
capturing local evidence in graphs. In this paper, we introduce a novel
relational structure, i.e., relational directed graph (r-digraph), which is
composed of overlapped relational paths, to capture the KG's local evidence.
Since the r- digraphs are more complex than paths, how to efficiently construct
and effectively learn from them are challenging. Directly encoding the
r-digraphs cannot scale well and capturing query-dependent information is hard
in r-digraphs. We propose a variant of graph neural network, i.e., RED-GNN, to
address the above challenges. Specifically, RED-GNN makes use of dynamic
programming to recursively encodes multiple r-digraphs with shared edges, and
utilizes a query-dependent attention mechanism to select the strongly
correlated edges. We demonstrate that RED-GNN is not only efficient but also
can achieve significant performance gains in both inductive and transductive
reasoning tasks over existing methods. Besides, the learned attention weights
in RED-GNN can exhibit interpretable evidence for KG reasoning.
","[{'version': 'v1', 'created': 'Fri, 13 Aug 2021 03:27:01 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Jan 2022 07:31:14 GMT'}]",2022-01-24,"[['Zhang', 'Yongqi', ''], ['Yao', 'Quanming', '']]","['Knowledge graph', 'Graph embedding', 'Knowledge graph reasoning', 'Graph representation learning', 'Graph neural network']"
9390,1506.05693,Bernard Cousin,"Omar Smail, Bernard Cousin (UR1, ATNET), Zoulikha Mekkakia, Rachida
  Mekki","A multipath energy-conserving routing protocol for wireless ad hoc
  networks lifetime improvement",,"EURASIP Journal on Wireless Communications and Networking,
  SpringerOpen, 2014, 2014 (139), pp. 1 - 22",10.1186/1687-1499-2014-139,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ad hoc networks are wireless mobile networks that can operate without
infrastructure and without centralized network management. Traditional
techniques of routing are not well adapted. Indeed, their lack of reactivity
with respect to the variability of network changes makes them difficult to use.
Moreover, conserving energy is a critical concern in the design of routing
protocols for ad hoc networks, because most mobile nodes operate with limited
battery capacity, and the energy depletion of a node affects not only the node
itself but also the overall network lifetime. In all proposed single-path
routing schemes a new path-discovery process is required once a path failure is
detected, and this process causes delay and wastage of node resources. A
multipath routing scheme is an alternative to maximize the network lifetime. In
this paper, we propose an energy-efficient multipath routing protocol, called
AOMR-LM (Ad hoc On-demand Multipath Routing with Lifetime Maximization), which
preserves the residual energy of nodes and balances the consumed energy to
increase the network lifetime. To achieve this goal, we used the residual
energy of nodes for calculating the node energy level. The multipath selection
mechanism uses this energy level to classify the paths. Two parameters are
analyzed: the energy threshold beta and the coefficient alpha. These parameters
are required to classify the nodes and to ensure the preservation of node
energy. Our protocol improves the performance of mobile ad hoc networks by
prolonging the lifetime of the network. This novel protocol has been compared
with other protocols: AOMDV and ZD-AOMDV. The protocol performance has been
evaluated in terms of network lifetime, energy consumption, and end-to-end
delay.
","[{'version': 'v1', 'created': 'Thu, 18 Jun 2015 14:25:53 GMT'}]",2015-06-19,"[['Smail', 'Omar', '', 'UR1, ATNET'], ['Cousin', 'Bernard', '', 'UR1, ATNET'], ['Mekkakia', 'Zoulikha', ''], ['Mekki', 'Rachida', '']]","['Ad hoc network', 'Multipath routing', 'Energy efficiency', 'Network lifetime']"
9391,1906.02599,Dmitry Kulyabov,"D. S. Kulyabov, A. V. Korolkova, and L. A. Sevastianov","New Features in the Second Version of the Cadabra Computer Algebra
  System",in English; in Russian,,10.1134/S0361768819020063,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In certain scientific domains, there is a need for tensor operations. To
facilitate tensor computations,computer algebra systems are employed. In our
research, we have been using Cadabra as the main computer algebra system for
several years. Recently, an operable second version of this software was
released. In this version, a number of improvements were made that can be
regarded as revolutionary ones. The most significant improvements are the
implementation of component computations and the change in the ideology of the
Cadabra's software mechanism as compared to the first version. This paper
provides a brief overview of the key improvements in the Cadabra system.
","[{'version': 'v1', 'created': 'Thu, 6 Jun 2019 14:12:05 GMT'}]",2019-06-07,"[['Kulyabov', 'D. S.', ''], ['Korolkova', 'A. V.', ''], ['Sevastianov', 'L. A.', '']]","['computer algebra systems', 'tensor calculations', 'component calculations', 'python', 'sympy']"
9392,2211.05429,Ravi Kiran Sarvadevabhatla,"Nikhil Bansal, Kartik Gupta, Kiruthika Kannan, Sivani Pentapati, Ravi
  Kiran Sarvadevabhatla","DrawMon: A Distributed System for Detection of Atypical Sketch Content
  in Concurrent Pictionary Games","Presented at ACM Multimedia 2022. For project page and dataset, visit
  https://drawm0n.github.io",,10.1145/3503161.3547747,,cs.CV cs.GR cs.MM,http://creativecommons.org/licenses/by/4.0/,"  Pictionary, the popular sketch-based guessing game, provides an opportunity
to analyze shared goal cooperative game play in restricted communication
settings. However, some players occasionally draw atypical sketch content.
While such content is occasionally relevant in the game context, it sometimes
represents a rule violation and impairs the game experience. To address such
situations in a timely and scalable manner, we introduce DrawMon, a novel
distributed framework for automatic detection of atypical sketch content in
concurrently occurring Pictionary game sessions. We build specialized online
interfaces to collect game session data and annotate atypical sketch content,
resulting in AtyPict, the first ever atypical sketch content dataset. We use
AtyPict to train CanvasNet, a deep neural atypical content detection network.
We utilize CanvasNet as a core component of DrawMon. Our analysis of post
deployment game session data indicates DrawMon's effectiveness for scalable
monitoring and atypical sketch content detection. Beyond Pictionary, our
contributions also serve as a design guide for customized atypical content
response systems involving shared and interactive whiteboards. Code and
datasets are available at https://drawm0n.github.io.
","[{'version': 'v1', 'created': 'Thu, 10 Nov 2022 09:09:41 GMT'}]",2022-11-11,"[['Bansal', 'Nikhil', ''], ['Gupta', 'Kartik', ''], ['Kannan', 'Kiruthika', ''], ['Pentapati', 'Sivani', ''], ['Sarvadevabhatla', 'Ravi Kiran', '']]","['whiteboard', 'shared interaction', 'anomaly detection', 'Pictionary', 'deepnetwork', 'dataset', 'sketch']"
9393,2201.12686,Sejoon Oh,"Sejoon Oh, Berk Ustun, Julian McAuley, Srijan Kumar","Rank List Sensitivity of Recommender Systems to Interaction
  Perturbations","Accepted for publication at: 31st ACM International Conference on
  Information and Knowledge Management (CIKM 2022). Code and data at:
  https://github.com/srijankr/casper",,10.1145/3511808.3557425,,cs.IR cs.CR cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Prediction models can exhibit sensitivity with respect to training data:
small changes in the training data can produce models that assign conflicting
predictions to individual data points during test time. In this work, we study
this sensitivity in recommender systems, where users' recommendations are
drastically altered by minor perturbations in other unrelated users'
interactions. We introduce a measure of stability for recommender systems,
called Rank List Sensitivity (RLS), which measures how rank lists generated by
a given recommender system at test time change as a result of a perturbation in
the training data. We develop a method, CASPER, which uses cascading effect to
identify the minimal and systematical perturbation to induce higher instability
in a recommender system. Experiments on four datasets show that recommender
models are overly sensitive to minor perturbations introduced randomly or via
CASPER - even perturbing one random interaction of one user drastically changes
the recommendation lists of all users. Importantly, with CASPER perturbation,
the models generate more unstable recommendations for low-accuracy users (i.e.,
those who receive low-quality recommendations) than high-accuracy ones.
","[{'version': 'v1', 'created': 'Sat, 29 Jan 2022 23:43:21 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Aug 2022 03:16:00 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Aug 2022 16:17:27 GMT'}]",2022-08-17,"[['Oh', 'Sejoon', ''], ['Ustun', 'Berk', ''], ['McAuley', 'Julian', ''], ['Kumar', 'Srijan', '']]","['Recommender Systems', 'Model Stability', 'Input Data Perturbation']"
9394,1907.00172,John L{\aa}ng,John L{\aa}ng and I.S.W.B. Prasetya,"Model Checking a C++ Software Framework, a Case Study","In Proceedings of the 27th ACM Joint European Software Engineering
  Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE
  '19), August 26-30, 2019, Tallinn, Estonia. ACM, New York, NY, USA, 11 pages",,10.1145/3338906.3340453,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a case study on applying two model checkers, SPIN and
DIVINE, to verify key properties of a C++ software framework, known as ADAPRO,
originally developed at CERN. SPIN was used for verifying properties on the
design level. DIVINE was used for verifying simple test applications that
interacted with the implementation. Both model checkers were found to have
their own respective sets of pros and cons, but the overall experience was
positive. Because both model checkers were used in a complementary manner, they
provided valuable new insights into the framework, which would arguably have
been hard to gain by traditional testing and analysis tools only. Translating
the C++ source code into the modeling language of the SPIN model checker helped
to find flaws in the original design. With DIVINE, defects were found in parts
of the code base that had already been subject to hundreds of hours of unit
tests, integration tests, and acceptance tests. Most importantly, model
checking was found to be easy to integrate into the workflow of the software
project and bring added value, not only as verification, but also validation
methodology. Therefore, using model checking for developing library-level code
seems realistic and worth the effort.
","[{'version': 'v1', 'created': 'Sat, 29 Jun 2019 09:37:34 GMT'}]",2019-07-02,"[['Lång', 'John', ''], ['Prasetya', 'I. S. W. B.', '']]","['model checking concurrent C++', 'verification concurrent C++', 'modelchecking C++ case study']"
9395,2205.11108,D. Murugan,"Petchiammal A, Briskline Kiruba S, D. Murugan, Pandarasamy A","Paddy Doctor: A Visual Image Dataset for Automated Paddy Disease
  Classification and Benchmarking",,,10.1145/3570991.3570994,,cs.CV,http://creativecommons.org/licenses/by-sa/4.0/,"  One of the critical biotic stress factors paddy farmers face is diseases
caused by bacteria, fungi, and other organisms. These diseases affect plants'
health severely and lead to significant crop loss. Most of these diseases can
be identified by regularly observing the leaves and stems under expert
supervision. In a country with vast agricultural regions and limited crop
protection experts, manual identification of paddy diseases is challenging.
Thus, to add a solution to this problem, it is necessary to automate the
disease identification process and provide easily accessible decision support
tools to enable effective crop protection measures. However, the lack of
availability of public datasets with detailed disease information limits the
practical implementation of accurate disease detection systems. This paper
presents \emph{Paddy Doctor}, a visual image dataset for identifying paddy
diseases. Our dataset contains 16,225 annotated paddy leaf images across 13
classes (12 diseases and normal leaf). We benchmarked the \emph{Paddy Doctor}
dataset using a Convolutional Neural Network (CNN) and four transfer learning
based models (VGG16, MobileNet, Xception, and ResNet34). The experimental
results showed that ResNet34 achieved the highest F1-score of 97.50%. We
release our dataset and reproducible code in the open source for community use.
","[{'version': 'v1', 'created': 'Mon, 23 May 2022 07:57:40 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Nov 2022 11:23:28 GMT'}]",2022-11-28,"[['A', 'Petchiammal', ''], ['S', 'Briskline Kiruba', ''], ['Murugan', 'D.', ''], ['A', 'Pandarasamy', '']]","['Plant Disease Diagnosis', 'Paddy Diseases', 'Computer Vision', 'Deeplearning', 'Transfer Learning']"
9396,1909.07587,Sayan Putatunda PhD,Sayan Putatunda,"A Hybrid Deep Learning Approach for Diagnosis of the Erythemato-Squamous
  Disease","Pre-review version of the paper accepted at the 2020 IEEE
  International Conference on Electronics, Computing and Communication
  Technologies (CONECCT)","2020 IEEE International Conference on Electronics, Computing and
  Communication Technologies (CONECCT)",10.1109/CONECCT50063.2020.9198447,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The diagnosis of the Erythemato-squamous disease (ESD) is accepted as a
difficult problem in dermatology. ESD is a form of skin disease. It generally
causes redness of the skin and also may cause loss of skin. They are generally
due to genetic or environmental factors. ESD comprises six classes of skin
conditions namely, pityriasis rubra pilaris, lichen planus, chronic dermatitis,
psoriasis, seboreic dermatitis and pityriasis rosea. The automated diagnosis of
ESD can help doctors and dermatologists in reducing the efforts from their end
and in taking faster decisions for treatment. The literature is replete with
works that used conventional machine learning methods for the diagnosis of ESD.
However, there isn't much instances of application of Deep learning for the
diagnosis of ESD. In this paper, we propose a novel hybrid deep learning
approach i.e. Derm2Vec for the diagnosis of the ESD. Derm2Vec is a hybrid deep
learning model that consists of both Autoencoders and Deep Neural Networks. We
also apply a conventional Deep Neural Network (DNN) for the classification of
ESD. We apply both Derm2Vec and DNN along with other traditional machine
learning methods on a real world dermatology dataset. The Derm2Vec method is
found to be the best performer (when taking the prediction accuracy into
account) followed by DNN and Extreme Gradient Boosting.The mean CV score of
Derm2Vec, DNN and Extreme Gradient Boosting are 96.92 percent, 96.65 percent
and 95.80 percent respectively.
","[{'version': 'v1', 'created': 'Tue, 17 Sep 2019 04:50:28 GMT'}, {'version': 'v2', 'created': 'Sun, 24 May 2020 04:52:54 GMT'}]",2020-09-18,"[['Putatunda', 'Sayan', '']]","['Autoencoders', 'Deep Learning', 'Dermatology', 'Erythemato-SquamousDisease', 'Machine Learning', 'Medical Informatics']"
9397,2204.05039,Shrestha Ghosh,"Shrestha Ghosh, Simon Razniewski, Gerhard Weikum",Answering Count Queries with Explanatory Evidence,Version published at SIGIR 2022,,10.1145/3477495.3531870,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  A challenging case in web search and question answering are count queries,
such as \textit{""number of songs by John Lennon""}. Prior methods merely answer
these with a single, and sometimes puzzling number or return a ranked list of
text snippets with different numbers. This paper proposes a methodology for
answering count queries with inference, contextualization and explanatory
evidence. Unlike previous systems, our method infers final answers from
multiple observations, supports semantic qualifiers for the counts, and
provides evidence by enumerating representative instances. Experiments with a
wide variety of queries show the benefits of our method. To promote further
research on this underexplored topic, we release an annotated dataset of 5k
queries with 200k relevant text spans.
","[{'version': 'v1', 'created': 'Mon, 11 Apr 2022 12:20:13 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Aug 2022 09:46:27 GMT'}]",2022-08-31,"[['Ghosh', 'Shrestha', ''], ['Razniewski', 'Simon', ''], ['Weikum', 'Gerhard', '']]","['Question Answering', 'Count Queries', 'Explainable AI']"
9398,2011.07914,Stefano Zacchiroli,"Antoine Pietri (DGD-I), Guillaume Rousseau (UP, DGD-I), Stefano
  Zacchiroli (UP, DGD-I)","Determining the Intrinsic Structure of Public Software Development
  History","MSR 2020 - 17th International Conference on Mining Software
  Repositories, Oct 2020, Seoul, South Korea",,10.1145/3379597.3387506,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background. Collaborative software development has produced a wealth of
version control system (VCS) data that can now be analyzed in full. Little is
known about the intrinsic structure of the entire corpus of publicly available
VCS as an interconnected graph. Understanding its structure is needed to
determine the best approach to analyze it in full and to avoid methodological
pitfalls when doing so. Objective. We intend to determine the most salient
network topol-ogy properties of public software development history as captured
by VCS. We will explore: degree distributions, determining whether they are
scale-free or not; distribution of connect component sizes; distribution of
shortest path lengths.Method. We will use Software Heritage-which is the
largest corpus of public VCS data-compress it using webgraph compression
techniques, and analyze it in-memory using classic graph algorithms. Analyses
will be performed both on the full graph and on relevant subgraphs.
Limitations. The study is exploratory in nature; as such no hypotheses on the
findings is stated at this time. Chosen graph algorithms are expected to scale
to the corpus size, but it will need to be confirmed experimentally. External
validity will depend on how representative Software Heritage is of the software
commons.
","[{'version': 'v1', 'created': 'Mon, 16 Nov 2020 13:02:17 GMT'}]",2020-11-17,"[['Pietri', 'Antoine', '', 'DGD-I'], ['Rousseau', 'Guillaume', '', 'UP, DGD-I'], ['Zacchiroli', 'Stefano', '', 'UP, DGD-I']]","['source code', 'version control system', 'network topology', 'graph structure', 'statistical mechanics']"
9399,2007.05675,Jinhai Yang,"Jinhai Yang, Hua Yang, Lin Chen","Towards Cross-Granularity Few-Shot Learning: Coarse-to-Fine
  Pseudo-Labeling with Visual-Semantic Meta-Embedding",Accepted by ACM MM 2021,,10.1145/3474085.3475200,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Few-shot learning aims at rapidly adapting to novel categories with only a
handful of samples at test time, which has been predominantly tackled with the
idea of meta-learning. However, meta-learning approaches essentially learn
across a variety of few-shot tasks and thus still require large-scale training
data with fine-grained supervision to derive a generalized model, thereby
involving prohibitive annotation cost. In this paper, we advance the few-shot
classification paradigm towards a more challenging scenario, i.e.,
cross-granularity few-shot classification, where the model observes only coarse
labels during training while is expected to perform fine-grained classification
during testing. This task largely relieves the annotation cost since
fine-grained labeling usually requires strong domain-specific expertise. To
bridge the cross-granularity gap, we approximate the fine-grained data
distribution by greedy clustering of each coarse-class into pseudo-fine-classes
according to the similarity of image embeddings. We then propose a
meta-embedder that jointly optimizes the visual- and semantic-discrimination,
in both instance-wise and coarse class-wise, to obtain a good feature space for
this coarse-to-fine pseudo-labeling process. Extensive experiments and ablation
studies are conducted to demonstrate the effectiveness and robustness of our
approach on three representative datasets.
","[{'version': 'v1', 'created': 'Sat, 11 Jul 2020 03:44:21 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Oct 2020 02:46:54 GMT'}, {'version': 'v3', 'created': 'Tue, 20 Jul 2021 12:39:41 GMT'}]",2021-07-21,"[['Yang', 'Jinhai', ''], ['Yang', 'Hua', ''], ['Chen', 'Lin', '']]","['meta-learning', 'few-shot learning', 'cross-granularity learning', 'inexact supervision', 'visual-semantic embedding']"
9400,2211.10382,Aoyu Li,"Aoyu Li, Ikuro Sato, Kohta Ishikawa, Rei Kawakami, Rio Yokota",Informative Sample-Aware Proxy for Deep Metric Learning,Accepted at ACM Multimedia Asia (MMAsia) 2022,,10.1145/3551626.3564942,,cs.CV cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Among various supervised deep metric learning methods proxy-based approaches
have achieved high retrieval accuracies. Proxies, which are
class-representative points in an embedding space, receive updates based on
proxy-sample similarities in a similar manner to sample representations. In
existing methods, a relatively small number of samples can produce large
gradient magnitudes (ie, hard samples), and a relatively large number of
samples can produce small gradient magnitudes (ie, easy samples); these can
play a major part in updates. Assuming that acquiring too much sensitivity to
such extreme sets of samples would deteriorate the generalizability of a
method, we propose a novel proxy-based method called Informative Sample-Aware
Proxy (Proxy-ISA), which directly modifies a gradient weighting factor for each
sample using a scheduled threshold function, so that the model is more
sensitive to the informative samples. Extensive experiments on the
CUB-200-2011, Cars-196, Stanford Online Products and In-shop Clothes Retrieval
datasets demonstrate the superiority of Proxy-ISA compared with the
state-of-the-art methods.
","[{'version': 'v1', 'created': 'Fri, 18 Nov 2022 17:25:25 GMT'}]",2022-11-21,"[['Li', 'Aoyu', ''], ['Sato', 'Ikuro', ''], ['Ishikawa', 'Kohta', ''], ['Kawakami', 'Rei', ''], ['Yokota', 'Rio', '']]","['metric learning', 'adaptive sampling', 'robust estimation']"
9401,1905.08871,Elisa Ferrari,"Elisa Ferrari, Alessandra Retico, Davide Bacciu","Measuring the effects of confounders in medical supervised
  classification problems: the Confounding Index (CI)","This is the accepted manuscript. The edited version is freely
  available until 23/03/2020 at the following link:
  https://authors.elsevier.com/a/1aVYZ3KEGa9GJo","Artificial Intelligence in Medicine, 101804 (2020)",10.1016/j.artmed.2020.101804,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the years, there has been growing interest in using Machine Learning
techniques for biomedical data processing. When tackling these tasks, one needs
to bear in mind that biomedical data depends on a variety of characteristics,
such as demographic aspects (age, gender, etc) or the acquisition technology,
which might be unrelated with the target of the analysis. In supervised tasks,
failing to match the ground truth targets with respect to such characteristics,
called confounders, may lead to very misleading estimates of the predictive
performance. Many strategies have been proposed to handle confounders, ranging
from data selection, to normalization techniques, up to the use of training
algorithm for learning with imbalanced data. However, all these solutions
require the confounders to be known a priori. To this aim, we introduce a novel
index that is able to measure the confounding effect of a data attribute in a
bias-agnostic way. This index can be used to quantitatively compare the
confounding effects of different variables and to inform correction methods
such as normalization procedures or ad-hoc-prepared learning algorithms. The
effectiveness of this index is validated on both simulated data and real-world
neuroimaging data.
","[{'version': 'v1', 'created': 'Tue, 21 May 2019 21:04:26 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Feb 2020 21:11:12 GMT'}]",2020-02-05,"[['Ferrari', 'Elisa', ''], ['Retico', 'Alessandra', ''], ['Bacciu', 'Davide', '']]","['Machine Learning', 'Confounding variables', 'Biomedical Data', 'Classification']"
9402,2208.05074,Jiashu Wu,"Jiashu Wu, Hao Dai, Yang Wang, Shigen Shen, Chengzhong Xu","PECCO: A Profit and Cost-oriented Computation Offloading Scheme in
  Edge-Cloud Environment with Improved Moth-flame Optimisation",Accepted by Concurrency and Computation: Practice and Experience,,10.1002/cpe.7163,,cs.DC cs.NE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  With the fast growing quantity of data generated by smart devices and the
exponential surge of processing demand in the Internet of Things (IoT) era, the
resource-rich cloud centres have been utilised to tackle these challenges. To
relieve the burden on cloud centres, edge-cloud computation offloading becomes
a promising solution since shortening the proximity between the data source and
the computation by offloading computation tasks from the cloud to edge devices
can improve performance and Quality of Service (QoS). Several optimisation
models of edge-cloud computation offloading have been proposed that take
computation costs and heterogeneous communication costs into account. However,
several important factors are not jointly considered, such as heterogeneities
of tasks, load balancing among nodes and the profit yielded by computation
tasks, which lead to the profit and cost-oriented computation offloading
optimisation model PECCO proposed in this paper. Considering that the model is
hard in nature and the optimisation objective is not differentiable, we propose
an improved Moth-flame optimiser PECCO-MFI which addresses some deficiencies of
the original Moth-flame Optimiser and integrate it under the edge-cloud
environment. Comprehensive experiments are conducted to verify the superior
performance of the proposed method when optimising the proposed task offloading
model under the edge-cloud environment.
","[{'version': 'v1', 'created': 'Tue, 9 Aug 2022 23:26:42 GMT'}]",2022-08-11,"[['Wu', 'Jiashu', ''], ['Dai', 'Hao', ''], ['Wang', 'Yang', ''], ['Shen', 'Shigen', ''], ['Xu', 'Chengzhong', '']]","['Cloud Computing', 'Edge-Cloud Computation Offloading', 'Internet of Things', 'Moth-flame Optimiser']"
9403,2108.12502,Lam Huynh,"Lam Huynh, Tri Nguyen, Thu Nguyen, Susanna Pirttikangas and Pekka
  Siirtola","StressNAS: Affect State and Stress Detection Using Neural Architecture
  Search","5 pages, 2 figures",,10.1145/3460418.3479320,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Smartwatches have rapidly evolved towards capabilities to accurately capture
physiological signals. As an appealing application, stress detection attracts
many studies due to its potential benefits to human health. It is propitious to
investigate the applicability of deep neural networks (DNN) to enhance human
decision-making through physiological signals. However, manually engineering
DNN proves a tedious task especially in stress detection due to the complex
nature of this phenomenon. To this end, we propose an optimized deep neural
network training scheme using neural architecture search merely using
wrist-worn data from WESAD. Experiments show that our approach outperforms
traditional ML methods by 8.22% and 6.02% in the three-state and two-state
classifiers, respectively, using the combination of WESAD wrist signals.
Moreover, the proposed method can minimize the need for human-design DNN while
improving performance by 4.39% (three-state) and 8.99% (binary).
","[{'version': 'v1', 'created': 'Thu, 26 Aug 2021 07:23:21 GMT'}]",2021-08-31,"[['Huynh', 'Lam', ''], ['Nguyen', 'Tri', ''], ['Nguyen', 'Thu', ''], ['Pirttikangas', 'Susanna', ''], ['Siirtola', 'Pekka', '']]","['Affect detection', 'Stress detection', 'Neural Architecture Search']"
9404,2004.04211,Ali Parsai,Ali Parsai and Serge Demeyer,Do Null-Type Mutation Operators Help Prevent Null-Type Faults?,,"SOFSEM 2019: Theory and Practice of Computer Science. SOFSEM 2019.
  Lecture Notes in Computer Science, vol 11376. (2019) Springer, Cham",10.1007/978-3-030-10801-4_33,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The null-type is a major source of faults in Java programs, and its overuse
has a severe impact on software maintenance. Unfortunately traditional mutation
testing operators do not cover null-type faults by default, hence cannot be
used as a preventive measure. We address this problem by designing four new
mutation operators which model null-type faults explicitly. We show how these
mutation operators are capable of revealing the missing tests, and we
demonstrate that these mutation operators are useful in practice. For the
latter, we analyze the test suites of 15 open-source projects to describe the
trade-offs related to the adoption of these operators to strengthen the test
suite.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2020 19:14:29 GMT'}]",2020-04-10,"[['Parsai', 'Ali', ''], ['Demeyer', 'Serge', '']]","['Software Maintenance', 'Software Testing', 'Mutation Testing', 'Null-Type', 'Test Quality']"
9405,1806.06579,Niranjan Saikumar,"Niranjan Saikumar, Rahul Kumar Sinha and S. Hassan HosseinNia","Resetting Disturbance Observers with application in Compensation of
  bounded nonlinearities like Hysteresis in Piezo-Actuators",,,10.1016/j.conengprac.2018.09.026,,cs.SY,http://creativecommons.org/licenses/by/4.0/,"  This paper presents a novel nonlinear (reset) disturbance observer for
dynamic compensation of bounded nonlinearities like hysteresis in piezoelectric
actuators. Proposed Resetting Disturbance Observer (RDOB) utilizes a novel
Constant-gain Lead-phase (CgLp) element based on the concept of reset control.
The fundamental limitations of linear DOB which results in contradictory
requirements and in a dependent design between DOB and feedback controller are
analysed. Two different configurations of RDOB which attempt to alleviate these
problems from different perspectives are presented and an example plant is used
to highlight the improvement. Stability criteria are presented for both
configurations. Performance improvement seen with both RDOB configurations
compared to linear DOB is also verified on a practical piezoelectric setup for
hysteresis compensation and results analysed.
","[{'version': 'v1', 'created': 'Mon, 18 Jun 2018 10:11:28 GMT'}]",2018-10-09,"[['Saikumar', 'Niranjan', ''], ['Sinha', 'Rahul Kumar', ''], ['HosseinNia', 'S. Hassan', '']]","['Disturbance Observers', 'Reset element', 'Hysteresis', 'Piezo-actuators', 'Precision control']"
9406,2106.02533,Weiwei Jiang,Weiwei Jiang,Graph-based Deep Learning for Communication Networks: A Survey,"Accepted by Elsevier Computer Communications. Github link:
  https://github.com/jwwthu/GNN-Communication-Networks","Computer Communications, 2021",10.1016/j.comcom.2021.12.015,,cs.NI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Communication networks are important infrastructures in contemporary society.
There are still many challenges that are not fully solved and new solutions are
proposed continuously in this active research area. In recent years, to model
the network topology, graph-based deep learning has achieved the
state-of-the-art performance in a series of problems in communication networks.
In this survey, we review the rapidly growing body of research using different
graph-based deep learning models, e.g. graph convolutional and graph attention
networks, in various problems from different types of communication networks,
e.g. wireless networks, wired networks, and software defined networks. We also
present a well-organized list of the problem and solution for each study and
identify future research directions. To the best of our knowledge, this paper
is the first survey that focuses on the application of graph-based deep
learning methods in communication networks involving both wired and wireless
scenarios. To track the follow-up research, a public GitHub repository is
created, where the relevant papers will be updated continuously.
","[{'version': 'v1', 'created': 'Fri, 4 Jun 2021 14:59:10 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Dec 2021 02:28:48 GMT'}]",2022-01-03,"[['Jiang', 'Weiwei', '']]","['Graph', 'Deep Learning', 'Graph Neural Network', 'Communication']"
9407,1802.05031,Francisco Charte,"Francisco Charte and Antonio J. Rivera and Mar\'ia J. del Jesus and
  Francisco Herrera","Tackling Multilabel Imbalance through Label Decoupling and Data
  Resampling Hybridization",,,10.1016/j.neucom.2017.01.118,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The learning from imbalanced data is a deeply studied problem in standard
classification and, in recent times, also in multilabel classification. A
handful of multilabel resampling methods have been proposed in late years,
aiming to balance the labels distribution. However these methods have to face a
new obstacle, specific for multilabel data, as is the joint appearance of
minority and majority labels in the same data patterns. We proposed recently a
new algorithm designed to decouple imbalanced labels concurring in the same
instance, called REMEDIAL (\textit{REsampling MultilabEl datasets by Decoupling
highly ImbAlanced Labels}). The goal of this work is to propose a procedure to
hybridize this method with some of the best resampling algorithms available in
the literature, including random oversampling, heuristic undersampling and
synthetic sample generation techniques. These hybrid methods are then
empirically analyzed, determining how their behavior is influenced by the label
decoupling process. As a result, a noteworthy set of guidelines on the combined
use of these techniques can be drawn from the conducted experimentation.
","[{'version': 'v1', 'created': 'Wed, 14 Feb 2018 10:45:57 GMT'}]",2018-02-15,"[['Charte', 'Francisco', ''], ['Rivera', 'Antonio J.', ''], ['del Jesus', 'María J.', ''], ['Herrera', 'Francisco', '']]","['Multilabel classification', 'Imbalanced learning', 'Resampling algorithms', 'Label concurrence']"
9408,2111.07503,Feras Batarseh,"Chih-Hao Huang, Feras A. Batarseh, Adel Boueiz, Ajay Kulkarni,
  Po-Hsuan Su, Jahan Aman","Measuring Outcomes in Healthcare Economics using Artificial
  Intelligence: with Application to Resource Management","This paper is published at Cambridge University Press Journal of Data
  & Policy","Data & Policy, 3, E30",10.1017/dap.2021.29,,cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The quality of service in healthcare is constantly challenged by outlier
events such as pandemics (i.e. Covid-19) and natural disasters (such as
hurricanes and earthquakes). In most cases, such events lead to critical
uncertainties in decision making, as well as in multiple medical and economic
aspects at a hospital. External (geographic) or internal factors (medical and
managerial), lead to shifts in planning and budgeting, but most importantly,
reduces confidence in conventional processes. In some cases, support from other
hospitals proves necessary, which exacerbates the planning aspect. This
manuscript presents three data-driven methods that provide data-driven
indicators to help healthcare managers organize their economics and identify
the most optimum plan for resources allocation and sharing. Conventional
decision-making methods fall short in recommending validated policies for
managers. Using reinforcement learning, genetic algorithms, traveling salesman,
and clustering, we experimented with different healthcare variables and
presented tools and outcomes that could be applied at health institutes.
Experiments are performed; the results are recorded, evaluated, and presented.
","[{'version': 'v1', 'created': 'Mon, 15 Nov 2021 02:39:39 GMT'}]",2021-11-16,"[['Huang', 'Chih-Hao', ''], ['Batarseh', 'Feras A.', ''], ['Boueiz', 'Adel', ''], ['Kulkarni', 'Ajay', ''], ['Su', 'Po-Hsuan', ''], ['Aman', 'Jahan', '']]","['Data Normalization', 'Decision Making', 'Fitness Function', 'Genetic Algorithms', 'Reinforcement Learning', 'Resource Allocation']"
9409,1812.08257,Luis Pablo Borja Rosales,"T.C. Wesselink, P. Borja, and J.M.A. Scherpen","Saturated control without velocity measurements for planar robots with
  flexible joints","9 figures, 3 tables. A short version of this paper was presented at
  the 58th Conference on Decision and Control (2019)",,10.1109/CDC40024.2019.9029741,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we propose a passivity-based controller that addresses the
problem of set point regulation for planar robots with two links and flexible
joints. Moreover, the controller is saturated and does not require velocity
measurements. Additionally, we present experiments that corroborate the
theoretical results of this note.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2018 21:36:34 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Nov 2020 23:49:45 GMT'}]",2020-11-24,"[['Wesselink', 'T. C.', ''], ['Borja', 'P.', ''], ['Scherpen', 'J. M. A.', '']]","['-Port-Hamiltonian systems', 'passivity-basedcontrol', 'saturation', 'asymptotic stabilization']"
9410,2101.05673,Anton Khritankov,Anton Khritankov,Analysis of hidden feedback loops in continuous machine learning systems,"7 pages, 9 figures; added more experiments, minor stylistic fixes and
  typos","Soft. Qual.: Fut. Persp. on Soft. Eng. Q. SWQD 2021. LNBIP, V. 404",10.1007/978-3-030-65854-0_5,,cs.LG cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this concept paper, we discuss intricacies of specifying and verifying the
quality of continuous and lifelong learning artificial intelligence systems as
they interact with and influence their environment causing a so-called concept
drift. We signify a problem of implicit feedback loops, demonstrate how they
intervene with user behavior on an exemplary housing prices prediction system.
Based on a preliminary model, we highlight conditions when such feedback loops
arise and discuss possible solution approaches.
","[{'version': 'v1', 'created': 'Thu, 14 Jan 2021 15:43:18 GMT'}, {'version': 'v2', 'created': 'Sun, 17 Jan 2021 18:38:51 GMT'}]",2021-01-19,"[['Khritankov', 'Anton', '']]","['machine learning', 'continuous machine learning', 'software quality', 'feedback loop']"
9411,1910.04009,Konstantin Bulatov,"Konstantin Bulatov, Daniil Matalov, Vladimir V. Arlazarov",MIDV-2019: Challenges of the modern mobile-based document OCR,"6 pages, 3 figures, 3 tables, 18 references, submitted and accepted
  to the 12th International Conference on Machine Vision (ICMV 2019)","Proc. SPIE 11433 ICMV-2019 (2020), 114332N",10.1117/12.2558438,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recognition of identity documents using mobile devices has become a topic of
a wide range of computer vision research. The portfolio of methods and
algorithms for solving such tasks as face detection, document detection and
rectification, text field recognition, and other, is growing, and the scarcity
of datasets has become an important issue. One of the openly accessible
datasets for evaluating such methods is MIDV-500, containing video clips of 50
identity document types in various conditions. However, the variability of
capturing conditions in MIDV-500 did not address some of the key issues, mainly
significant projective distortions and different lighting conditions. In this
paper we present a MIDV-2019 dataset, containing video clips shot with modern
high-resolution mobile cameras, with strong projective distortions and with low
lighting conditions. The description of the added data is presented, and
experimental baselines for text field recognition in different conditions. The
dataset is available for download at
ftp://smartengines.com/midv-500/extra/midv-2019/.
","[{'version': 'v1', 'created': 'Wed, 9 Oct 2019 14:12:27 GMT'}]",2020-02-12,"[['Bulatov', 'Konstantin', ''], ['Matalov', 'Daniil', ''], ['Arlazarov', 'Vladimir V.', '']]","['document analysis and recognition', 'open data', 'recognition systems', 'mobile OCR systems', 'video stream recognition', 'identity documents']"
9412,1506.08620,Fabio Cannizzo,Fabio Cannizzo,"Fast and Vectorizable Alternative to Binary Search in O(1) Applicable to
  a Wide Domain of Sorted Arrays of Floating Point Numbers",,"Journal of Parallel and Distributed Computing, Volume 113, March
  2018, Pages 37-5",10.1016/j.jpdc.2017.10.007,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given an array $X$ of $N+1$ strictly ordered floating point numbers and a
floating point number $z$ in the interval $[X_0,X_N)$, a common problem is to
find the index $i$ of the interval $[X_{i},X_{i+1})$ containing $z$. This
problem arises for instance in the context of spline interpolation or the
computation of empirical probability distribution from empirical data. Often it
needs to be solved for a large number of different values $z$ and the same
array $X$, which makes it worth investing resources upfront in pre-processing
the array $X$ with the goal of speeding up subsequent search operations. In
some cases the values $z$ to be processed are known simultaneously in blocks of
size $M$, which offers the opportunity to solve the problem vectorially,
exploiting the parallel capabilities of modern CPUs. The common solution is to
sequentially invoke $M$ times the well known binary search algorithm, which has
complexity $O(log_2 N)$ per individual search and, in its classic formulation,
is not vectorizable, i.e. is not SIMD friendly. This paper describes technical
improvements to the binary search algorithm, which make it faster and
vectorizable. Next it proposes a new vectorizable algorithm, based on an
indexing technique, applicable to a wide family of $X$ partitions, which solves
the problem with complexity $O(1)$ per individual search at the cost of
introducing an initial overhead to compute the index and requiring extra memory
for its storage. Test results using streaming SIMD extensions compare the
performance of the algorithm versus various benchmarks and demonstrate its
effectiveness. Depending on the test case, the algorithm can produce a
throughput up to two orders of magnitude larger than the classic binary search.
Applicability limitations and cache-friendliness related aspects are also
discussed.
","[{'version': 'v1', 'created': 'Mon, 29 Jun 2015 13:44:21 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Mar 2017 15:39:53 GMT'}, {'version': 'v3', 'created': 'Tue, 26 Sep 2017 06:10:03 GMT'}]",2017-12-01,"[['Cannizzo', 'Fabio', '']]","['interpolation', 'spline', 'SIMD', 'SSE', 'vectorization', 'lower']"
9413,1910.00862,Joachim Schopfel,"Otmane Azeroual (DZHW), Joachim Sch\""opfel (GERIICO)",Research Intelligence (CRIS) and the Cloud: A Review,,"Computer & Information Science, 2019, 12 (4), pp.40-55",10.5539/cis.v12n4p40,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this paper is to explore the impact of the cloud technology on
current research information systems (CRIS). Based on an overview of published
literature and on empirical evidence from surveys, the paper presents main
characteristics, delivery models, service levels and general benefits of cloud
computing. The second part assesses how the cloud computing challenges the
research information management, from three angles: networking, specific
benefits, and the ingestion of data in the cloud. The third part describes
three aspects of the implementation of current research systems in the clouds,
i.e. service models, requirements and potential risks and barriers. The paper
concludes with some perspectives for future work. The paper is written for CRIS
administrators and users, in order to improve research information management
and to contribute to future development and implementation of these systems,
but also for scholars and students who want to have detailed knowledge on this
topic.
","[{'version': 'v1', 'created': 'Wed, 2 Oct 2019 10:22:33 GMT'}]",2019-10-03,"[['Azeroual', 'Otmane', '', 'DZHW'], ['Schöpfel', 'Joachim', '', 'GERIICO']]","['current research information systems (CRIS)', 'research information management', 'cloud computing', 'data quality', 'data security']"
9414,1804.00651,Cairong Zhang,"Cairong Zhang, Guijin Wang, Hengkai Guo, Xinghao Chen, Fei Qiao,
  Huazhong Yang","Interactive Hand Pose Estimation: Boosting accuracy in localizing
  extended finger joints","Original publication available on
  https://doi.org/10.2352/ISSN.2470-1173.2018.2.VIPC-251","Electronic Imaging, Visual Information Processing and
  Communication IX (2018), pp. 251-1-251-6(6)",10.2352/ISSN.2470-1173.2018.2.VIPC-251,,cs.CV cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate 3D hand pose estimation plays an important role in Human Machine
Interaction (HMI). In the reality of HMI, joints in fingers stretching out,
especially corresponding fingertips, are much more important than other joints.
We propose a novel method to refine stretching-out finger joint locations after
obtaining rough hand pose estimation. It first detects which fingers are
stretching out, then neighbor pixels of certain joint vote for its new location
based on random forests. The algorithm is tested on two public datasets: MSRA15
and ICVL. After the refinement stage of stretching-out fingers, errors of
predicted HMI finger joint locations are significantly reduced. Mean error of
all fingertips reduces around 5mm (relatively more than 20%). Stretching-out
fingertip locations are even more precise, which in MSRA15 reduces 10.51mm
(relatively 41.4%).
","[{'version': 'v1', 'created': 'Mon, 2 Apr 2018 17:59:38 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Jul 2018 15:31:40 GMT'}]",2018-07-26,"[['Zhang', 'Cairong', ''], ['Wang', 'Guijin', ''], ['Guo', 'Hengkai', ''], ['Chen', 'Xinghao', ''], ['Qiao', 'Fei', ''], ['Yang', 'Huazhong', '']]","['Random Forest', 'Hand Pose Estimation', 'Human Machine Interaction', 'Fingertip Detection']"
9415,1601.04115,Chuyang Ye,"Chuyang Ye, Jiachen Zhuo, Rao P. Gullapalli, Jerry L. Prince",Estimation of Fiber Orientations Using Neighborhood Information,"Journal paper accepted in Medical Image Analysis. 35 pages and 16
  figures",,10.1016/j.media.2016.05.008,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data from diffusion magnetic resonance imaging (dMRI) can be used to
reconstruct fiber tracts, for example, in muscle and white matter. Estimation
of fiber orientations (FOs) is a crucial step in the reconstruction process and
these estimates can be corrupted by noise. In this paper, a new method called
Fiber Orientation Reconstruction using Neighborhood Information (FORNI) is
described and shown to reduce the effects of noise and improve FO estimation
performance by incorporating spatial consistency. FORNI uses a fixed tensor
basis to model the diffusion weighted signals, which has the advantage of
providing an explicit relationship between the basis vectors and the FOs. FO
spatial coherence is encouraged using weighted l1-norm regularization terms,
which contain the interaction of directional information between neighbor
voxels. Data fidelity is encouraged using a squared error between the observed
and reconstructed diffusion weighted signals. After appropriate weighting of
these competing objectives, the resulting objective function is minimized using
a block coordinate descent algorithm, and a straightforward parallelization
strategy is used to speed up processing. Experiments were performed on a
digital crossing phantom, ex vivo tongue dMRI data, and in vivo brain dMRI data
for both qualitative and quantitative evaluation. The results demonstrate that
FORNI improves the quality of FO estimation over other state of the art
algorithms.
","[{'version': 'v1', 'created': 'Sat, 16 Jan 2016 02:49:28 GMT'}, {'version': 'v2', 'created': 'Mon, 16 May 2016 09:59:51 GMT'}]",2016-05-17,"[['Ye', 'Chuyang', ''], ['Zhuo', 'Jiachen', ''], ['Gullapalli', 'Rao P.', ''], ['Prince', 'Jerry L.', '']]","['Diffusion MRI', 'fiber orientation estimation', 'neighborhood information']"
9416,2101.02767,Joris Gu\'erin,"Joris Guerin, Stephane Thiery, Eric Nyiri, Olivier Gibaru, Byron Boots","Combining pretrained CNN feature extractors to enhance clustering of
  complex natural images","21 pages, 16 figures, 10 tables, preprint of our paper published in
  Neurocomputing","Guerin, J., Thiery, S., Nyiri, E., Gibaru, O., & Boots, B. (2021).
  Combining pretrained CNN feature extractors to enhance clustering of complex
  natural images. Neurocomputing, 423, 551-571",10.1016/j.neucom.2020.10.068,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, a common starting point for solving complex unsupervised image
classification tasks is to use generic features, extracted with deep
Convolutional Neural Networks (CNN) pretrained on a large and versatile dataset
(ImageNet). However, in most research, the CNN architecture for feature
extraction is chosen arbitrarily, without justification. This paper aims at
providing insight on the use of pretrained CNN features for image clustering
(IC). First, extensive experiments are conducted and show that, for a given
dataset, the choice of the CNN architecture for feature extraction has a huge
impact on the final clustering. These experiments also demonstrate that proper
extractor selection for a given IC task is difficult. To solve this issue, we
propose to rephrase the IC problem as a multi-view clustering (MVC) problem
that considers features extracted from different architectures as different
""views"" of the same data. This approach is based on the assumption that
information contained in the different CNN may be complementary, even when
pretrained on the same data. We then propose a multi-input neural network
architecture that is trained end-to-end to solve the MVC problem effectively.
This approach is tested on nine natural image datasets, and produces
state-of-the-art results for IC.
","[{'version': 'v1', 'created': 'Thu, 7 Jan 2021 21:23:04 GMT'}]",2021-01-11,"[['Guerin', 'Joris', ''], ['Thiery', 'Stephane', ''], ['Nyiri', 'Eric', ''], ['Gibaru', 'Olivier', ''], ['Boots', 'Byron', '']]","['Image Clustering', 'Transfer Clustering', 'Multi-View Clustering']"
9417,2202.03762,Lioba Heimbach,Lioba Heimbach and Roger Wattenhofer,Eliminating Sandwich Attacks with the Help of Game Theory,,,10.1145/3488932.3517390,,cs.GT cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predatory trading bots lurking in Ethereum's mempool present invisible
taxation of traders on automated market makers (AMMs). AMM traders specify a
slippage tolerance to indicate the maximum price movement they are willing to
accept. This way, traders avoid automatic transaction failure in case of small
price movements before their trade request executes. However, while a too-small
slippage tolerance may lead to trade failures, a too-large slippage tolerance
allows predatory trading bots to profit from sandwich attacks. These bots can
extract the difference between the slippage tolerance and the actual price
movement as profit.
  In this work, we introduce the sandwich game to analyze sandwich attacks
analytically from both the attacker and victim perspectives. Moreover, we
provide a simple and highly effective algorithm that traders can use to set the
slippage tolerance. We unveil that most broadcasted transactions can avoid
sandwich attacks while simultaneously only experiencing a low risk of
transaction failure. Thereby, we demonstrate that a constant auto-slippage
cannot adjust to varying trade sizes and pool characteristics. Our algorithm
outperforms the constant auto-slippage suggested by the biggest AMM, Uniswap,
in all performed tests. Specifically, our algorithm repeatedly demonstrates a
cost reduction exceeding a factor of 100.
","[{'version': 'v1', 'created': 'Tue, 8 Feb 2022 10:11:42 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Mar 2022 14:45:09 GMT'}]",2022-03-03,"[['Heimbach', 'Lioba', ''], ['Wattenhofer', 'Roger', '']]","['blockchain', 'Ethereum', 'smart contract', 'decentralized finance', 'frontrunning', 'sandwich attack']"
9418,2208.01635,Kunal Abhishek,Kunal Abhishek and E. George Dharma Prakash Raj,"Computation of Trusted Short Weierstrass Elliptic Curves for
  Cryptography","CYBERNETICS AND INFORMATION TECHNOLOGIES, Volume 21, No 2","CYBERNETICS AND INFORMATION TECHNOLOGIES, 2021, Volume 21, No 2,
  pages 71-88",10.2478/cait-2021-0020,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Short Weierstrass's elliptic curves with underlying hard Elliptic Curve
Discrete Logarithm Problems was widely used in Cryptographic applications. This
paper introduces a new security notation 'trusted security' for computation
methods of elliptic curves for cryptography. Three additional ""trusted security
acceptance criteria"" is proposed to be met by the elliptic curves aimed for
cryptography. Further, two cryptographically secure elliptic curves over 256
bit and 384 bit prime fields are demonstrated which are secure from ECDLP, ECC
as well as trust perspectives. The proposed elliptic curves are successfully
subjected to thorough security analysis and performance evaluation with respect
to key generation and signing/verification and hence, proven for their
cryptographic suitability and great feasibility for acceptance by the
community.
","[{'version': 'v1', 'created': 'Fri, 15 Apr 2022 08:39:17 GMT'}]",2022-08-04,"[['Abhishek', 'Kunal', ''], ['Raj', 'E. George Dharma Prakash', '']]","['Short Weierstrass elliptic curves', 'prime field', 'cryptography', 'ECDLP Security', 'ECC Security', 'Trusted Security']"
9419,1712.06070,Andres Felipe Cruz Salinas,Andres Felipe Cruz Salinas and Jonatan Gomez Perdomo,"Self-adaptation of Genetic Operators Through Genetic Programming
  Techniques",Presented in GECCO 2017,,10.1145/3071178.3071214,,cs.NE,http://creativecommons.org/publicdomain/zero/1.0/,"  Here we propose an evolutionary algorithm that self modifies its operators at
the same time that candidate solutions are evolved. This tackles convergence
and lack of diversity issues, leading to better solutions. Operators are
represented as trees and are evolved using genetic programming (GP) techniques.
The proposed approach is tested with real benchmark functions and an analysis
of operator evolution is provided.
","[{'version': 'v1', 'created': 'Sun, 17 Dec 2017 07:53:36 GMT'}]",2017-12-19,"[['Salinas', 'Andres Felipe Cruz', ''], ['Perdomo', 'Jonatan Gomez', '']]","['Evolutionary algorithms', 'real optimization', 'self-adaptation', 'geneticprogramming', 'self-adapted operators']"
9420,2106.10621,Dong Li,Dong Li and Ruoming Jin and Jing Gao and Zhi Liu,On Sampling Top-K Recommendation Evaluation,,,10.1145/3394486.3403262,,cs.IR stat.AP,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Recently, Rendle has warned that the use of sampling-based top-$k$ metrics
might not suffice. This throws a number of recent studies on deep
learning-based recommendation algorithms, and classic non-deep-learning
algorithms using such a metric, into jeopardy. In this work, we thoroughly
investigate the relationship between the sampling and global top-$K$ Hit-Ratio
(HR, or Recall), originally proposed by Koren[2] and extensively used by
others. By formulating the problem of aligning sampling top-$k$ ($SHR@k$) and
global top-$K$ ($HR@K$) Hit-Ratios through a mapping function $f$, so that
$SHR@k\approx HR@f(k)$, we demonstrate both theoretically and experimentally
that the sampling top-$k$ Hit-Ratio provides an accurate approximation of its
global (exact) counterpart, and can consistently predict the correct winners
(the same as indicate by their corresponding global Hit-Ratios).
","[{'version': 'v1', 'created': 'Sun, 20 Jun 2021 04:48:13 GMT'}]",2021-06-22,"[['Li', 'Dong', ''], ['Jin', 'Ruoming', ''], ['Gao', 'Jing', ''], ['Liu', 'Zhi', '']]","['Recommender systems', 'top-k', 'hit ratio', 'recall', 'evaluation metric']"
9421,2006.00199,Sule Anjomshoae,"Sule Anjomshoae, Kary Fr\""amling and Amro Najjar","Explanations of Black-Box Model Predictions by Contextual Importance and
  Utility",,,10.1007/978-3-030-30391-4_6,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The significant advances in autonomous systems together with an immensely
wider application domain have increased the need for trustable intelligent
systems. Explainable artificial intelligence is gaining considerable attention
among researchers and developers to address this requirement. Although there is
an increasing number of works on interpretable and transparent machine learning
algorithms, they are mostly intended for the technical users. Explanations for
the end-user have been neglected in many usable and practical applications. In
this work, we present the Contextual Importance (CI) and Contextual Utility
(CU) concepts to extract explanations that are easily understandable by experts
as well as novice users. This method explains the prediction results without
transforming the model into an interpretable one. We present an example of
providing explanations for linear and non-linear models to demonstrate the
generalizability of the method. CI and CU are numerical values that can be
represented to the user in visuals and natural language form to justify actions
and explain reasoning for individual instances, situations, and contexts. We
show the utility of explanations in car selection example and Iris flower
classification by presenting complete (i.e. the causes of an individual
prediction) and contrastive explanation (i.e. contrasting instance against the
instance of interest). The experimental results show the feasibility and
validity of the provided explanation methods.
","[{'version': 'v1', 'created': 'Sat, 30 May 2020 06:49:50 GMT'}]",2020-06-02,"[['Anjomshoae', 'Sule', ''], ['Främling', 'Kary', ''], ['Najjar', 'Amro', '']]","['Explainable AI', 'black-box models', 'contextual importance', 'contextual utility', 'contrastive explanations']"
9422,2109.07084,Junsheng Kong,"Junsheng Kong, Weizhao Li, Zeyi Liu, Ben Liao, Jiezhong Qiu, Chang-Yu
  Hsieh, Yi Cai and Shengyu Zhang",Fast Extraction of Word Embedding from Q-contexts,Accepted by CIKM 2021,,10.1145/3459637.3482343,,cs.CL cs.AI,http://creativecommons.org/licenses/by/4.0/,"  The notion of word embedding plays a fundamental role in natural language
processing (NLP). However, pre-training word embedding for very large-scale
vocabulary is computationally challenging for most existing methods. In this
work, we show that with merely a small fraction of contexts (Q-contexts)which
are typical in the whole corpus (and their mutual information with words), one
can construct high-quality word embedding with negligible errors. Mutual
information between contexts and words can be encoded canonically as a sampling
state, thus, Q-contexts can be fast constructed. Furthermore, we present an
efficient and effective WEQ method, which is capable of extracting word
embedding directly from these typical contexts. In practical scenarios, our
algorithm runs 11$\sim$13 times faster than well-established methods. By
comparing with well-known methods such as matrix factorization, word2vec,
GloVeand fasttext, we demonstrate that our method achieves comparable
performance on a variety of downstream NLP tasks, and in the meanwhile
maintains run-time and resource advantages over all these baselines.
","[{'version': 'v1', 'created': 'Wed, 15 Sep 2021 05:14:31 GMT'}]",2021-09-16,"[['Kong', 'Junsheng', ''], ['Li', 'Weizhao', ''], ['Liu', 'Zeyi', ''], ['Liao', 'Ben', ''], ['Qiu', 'Jiezhong', ''], ['Hsieh', 'Chang-Yu', ''], ['Cai', 'Yi', ''], ['Zhang', 'Shengyu', '']]","['word embedding', 'Q-contexts', 'fast extraction', 'large-scale']"
9423,2002.12618,Marialena Akriotou,"M. Akriotou (1), A. Fragkos (2), D. Syvridis (1) ((1) Department of
  Informatics & Telecommunications, National and Kapodistrian University of
  Athens, Athens, Greece, (2) Eulambia Advanced Technologies Ltd., Athens,
  Greece)","Photonic Physical Unclonable Functions: From the Concept to Fully
  Functional Device Operating in the Field",,"Proc. SPIE 11274, Physics and Simulation of Optoelectronic Devices
  XXVIII, 112740N (9 March 2020)",10.1117/12.2551272,,cs.CR eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The scope of this paper is to demonstrate a fully working and compact
photonic Physical Unclonable Function (PUF) device capable of operating in real
life scenarios as an authentication mechanism and random number generator. For
this purpose, an extensive experimental investigation of a Polymer Optical
Fiber (POF) and a diffuser as PUF tokens is performed and the most significant
properties are evaluated using the proper mathematical tools. Two different
software algorithms, the Random Binary Method (RBM) and Singular Value
Decomposition (SVD), were tested for optimized key extraction and error
correction codes have been incorporated for enhancing key reproducibility. By
taking into consideration the limitations and overall performance derived by
the experimental evaluation of the system, the designing details towards the
implementation of a miniaturized, energy efficient and low-cost device are
extensively discussed. The performance of the final device is thoroughly
evaluated, demonstrating a long-term stability of 1 week, an operating
temperature range of 50C, an exponentially large pool of unique
Challenge-Response Pairs (CRPs), recovery after power failure and capability of
generating NIST compliant true random numbers.
","[{'version': 'v1', 'created': 'Fri, 28 Feb 2020 09:37:32 GMT'}]",2020-03-12,"[['Akriotou', 'M.', ''], ['Fragkos', 'A.', ''], ['Syvridis', 'D.', '']]","['Physical Unclonable Function', 'photonics', 'hardware-based authentication techniques', 'random number generation', 'Challenge-Response mechanism']"
9424,2112.07882,Jaromir Savelka,"Jaromir Savelka, Hannes Westermann, Karim Benyekhlef, Charlotte S.
  Alexander, Jayla C. Grant, David Restrepo Amariles, Rajaa El Hamdani,
  S\'ebastien Mee\`us, Micha{\l} Araszkiewicz, Kevin D. Ashley, Alexandra
  Ashley, Karl Branting, Mattia Falduti, Matthias Grabmair, Jakub Hara\v{s}ta,
  Tereza Novotn\'a, Elizabeth Tippett, Shiwanni Johnson","Lex Rosetta: Transfer of Predictive Models Across Languages,
  Jurisdictions, and Legal Domains",10 pages,"In Proceedings of ICAIL 2021, pp. 129-138. 2021",10.1145/3462757.3466149,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we examine the use of multi-lingual sentence embeddings to
transfer predictive models for functional segmentation of adjudicatory
decisions across jurisdictions, legal systems (common and civil law),
languages, and domains (i.e. contexts). Mechanisms for utilizing linguistic
resources outside of their original context have significant potential benefits
in AI & Law because differences between legal systems, languages, or traditions
often block wider adoption of research outcomes. We analyze the use of
Language-Agnostic Sentence Representations in sequence labeling models using
Gated Recurrent Units (GRUs) that are transferable across languages. To
investigate transfer between different contexts we developed an annotation
scheme for functional segmentation of adjudicatory decisions. We found that
models generalize beyond the contexts on which they were trained (e.g., a model
trained on administrative decisions from the US can be applied to criminal law
decisions from Italy). Further, we found that training the models on multiple
contexts increases robustness and improves overall performance when evaluating
on previously unseen contexts. Finally, we found that pooling the training data
from all the contexts enhances the models' in-context performance.
","[{'version': 'v1', 'created': 'Wed, 15 Dec 2021 04:53:13 GMT'}]",2021-12-16,"[['Savelka', 'Jaromir', ''], ['Westermann', 'Hannes', ''], ['Benyekhlef', 'Karim', ''], ['Alexander', 'Charlotte S.', ''], ['Grant', 'Jayla C.', ''], ['Amariles', 'David Restrepo', ''], ['Hamdani', 'Rajaa El', ''], ['Meeùs', 'Sébastien', ''], ['Araszkiewicz', 'Michał', ''], ['Ashley', 'Kevin D.', ''], ['Ashley', 'Alexandra', ''], ['Branting', 'Karl', ''], ['Falduti', 'Mattia', ''], ['Grabmair', 'Matthias', ''], ['Harašta', 'Jakub', ''], ['Novotná', 'Tereza', ''], ['Tippett', 'Elizabeth', ''], ['Johnson', 'Shiwanni', '']]","['multi-lingual sentence embeddings', 'transfer learning', 'domain adaptation', 'adjudicatory decisions', 'document segmentation', 'annotation']"
9425,2206.00429,Lauritz Thamsen,"Lauritz Thamsen, Dominik Scheinert, Jonathan Will, Jonathan Bader,
  Odej Kao","Collaborative Cluster Configuration for Distributed Data-Parallel
  Processing: A Research Overview",,,10.1007/s13222-022-00416-z,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many organizations routinely analyze large datasets using systems for
distributed data-parallel processing and clusters of commodity resources. Yet,
users need to configure adequate resources for their data processing jobs. This
requires significant insights into expected job runtimes and scaling behavior,
resource characteristics, input data distributions, and other factors. Unable
to estimate performance accurately, users frequently overprovision resources
for their jobs, leading to low resource utilization and high costs. In this
paper, we present major building blocks towards a collaborative approach for
optimization of data processing cluster configurations based on runtime data
and performance models. We believe that runtime data can be shared and used for
performance models across different execution contexts, significantly reducing
the reliance on the recurrence of individual processing jobs or, else,
dedicated job profiling. For this, we describe how the similarity of processing
jobs and cluster infrastructures can be employed to combine suitable data
points from local and global job executions into accurate performance models.
Furthermore, we outline approaches to performance prediction via more
context-aware and reusable models. Finally, we lay out how metrics from
previous executions can be combined with runtime monitoring to effectively
re-configure models and clusters dynamically.
","[{'version': 'v1', 'created': 'Wed, 1 Jun 2022 12:08:48 GMT'}]",2022-06-02,"[['Thamsen', 'Lauritz', ''], ['Scheinert', 'Dominik', ''], ['Will', 'Jonathan', ''], ['Bader', 'Jonathan', ''], ['Kao', 'Odej', '']]","['Scalable Data Analytics', 'Batch Processing', 'Distributed Dataflows', 'Runtime Prediction', 'Resource Allocation', 'Cluster Resource Management']"
9426,1704.05596,Zhen Wang,"Zhen Wang, Yuan-Hai Shao, Lan Bai, Li-Ming Liu, Nai-Yang Deng","Insensitive Stochastic Gradient Twin Support Vector Machine for Large
  Scale Problems","31 pages, 31 figures","Information Sciences, Volume 462, September 2018, Pages 114-131",10.1016/j.ins.2018.06.007,,cs.LG cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stochastic gradient descent algorithm has been successfully applied on
support vector machines (called PEGASOS) for many classification problems. In
this paper, stochastic gradient descent algorithm is investigated to twin
support vector machines for classification. Compared with PEGASOS, the proposed
stochastic gradient twin support vector machines (SGTSVM) is insensitive on
stochastic sampling for stochastic gradient descent algorithm. In theory, we
prove the convergence of SGTSVM instead of almost sure convergence of PEGASOS.
For uniformly sampling, the approximation between SGTSVM and twin support
vector machines is also given, while PEGASOS only has an opportunity to obtain
an approximation of support vector machines. In addition, the nonlinear SGTSVM
is derived directly from its linear case. Experimental results on both
artificial datasets and large scale problems show the stable performance of
SGTSVM with a fast learning speed.
","[{'version': 'v1', 'created': 'Wed, 19 Apr 2017 03:08:38 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Nov 2017 06:38:48 GMT'}]",2018-08-17,"[['Wang', 'Zhen', ''], ['Shao', 'Yuan-Hai', ''], ['Bai', 'Lan', ''], ['Liu', 'Li-Ming', ''], ['Deng', 'Nai-Yang', '']]","['Classification', 'support vector machines', 'twin support vectormachines', 'stochastic gradient descent', 'large scale problem']"
9427,2004.02503,Robert Eggersmann,"Robert Eggersmann, Laurent Stainier, Michael Ortiz, Stefanie Reese",Model-free Data-Driven Computational Mechanics Enhanced by Tensor Voting,,,10.1016/j.cma.2020.113499,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The data-driven computing paradigm initially introduced by Kirchdoerfer &
Ortiz (2016) is extended by incorporating locally linear tangent spaces into
the data set. These tangent spaces are constructed by means of the tensor
voting method introduced by Mordohai & Medioni (2010) which improves the
learning of the underlying structure of a data set. Tensor voting is an
instance-based machine learning technique which accumulates votes from the
nearest neighbors to build up second-order tensors encoding tangents and
normals to the underlying data structure. The here proposed second-order
data-driven paradigm is a plug-in method for distance-minimizing as well as
entropy-maximizing data-driven schemes. Like its predecessor, the resulting
method aims to minimize a suitably defined free energy over phase space subject
to compatibility and equilibrium constraints. The method's implementation is
straightforward and numerically efficient since the data structure analysis is
performed in an offline step. Selected numerical examples are presented that
establish the higher-order convergence properties of the data-driven solvers
enhanced by tensor voting for ideal and noisy data sets.
","[{'version': 'v1', 'created': 'Mon, 6 Apr 2020 09:18:24 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Apr 2020 09:59:36 GMT'}]",2020-12-02,"[['Eggersmann', 'Robert', ''], ['Stainier', 'Laurent', ''], ['Ortiz', 'Michael', ''], ['Reese', 'Stefanie', '']]","['data-driven computing', 'tensor voting', 'second-order method', 'datascience']"
9428,2008.05801,"Noleen K\""ohler","Isolde Adler (1) and Noleen K\""ohler (1) ((1) University of Leeds)","An explicit construction of graphs of bounded degree that are far from
  being Hamiltonian","19 pages, 4 figures","Discrete Mathematics & Theoretical Computer Science, vol. 24, no.
  1, Graph Theory (January 31, 2022) dmtcs:8997",10.46298/dmtcs.7109,,cs.DM cs.CC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hamiltonian cycles in graphs were first studied in the 1850s. Since then, an
impressive amount of research has been dedicated to identifying classes of
graphs that allow Hamiltonian cycles, and to related questions. The
corresponding decision problem, that asks whether a given graph is Hamiltonian
(i.\,e.\ admits a Hamiltonian cycle), is one of Karp's famous NP-complete
problems. In this paper we study graphs of bounded degree that are \emph{far}
from being Hamiltonian, where a graph $G$ on $n$ vertices is \emph{far} from
being Hamiltonian, if modifying a constant fraction of $n$ edges is necessary
to make $G$ Hamiltonian. We give an explicit deterministic construction of a
class of graphs of bounded degree that are locally Hamiltonian, but (globally)
far from being Hamiltonian. Here, \emph{locally Hamiltonian} means that every
subgraph induced by the neighbourhood of a small vertex set appears in some
Hamiltonian graph. More precisely, we obtain graphs which differ in $\Theta(n)$
edges from any Hamiltonian graph, but non-Hamiltonicity cannot be detected in
the neighbourhood of $o(n)$ vertices. Our class of graphs yields a class of
hard instances for one-sided error property testers with linear query
complexity. It is known that any property tester (even with two-sided error)
requires a linear number of queries to test Hamiltonicity (Yoshida, Ito, 2010).
This is proved via a randomised construction of hard instances. In contrast,
our construction is deterministic. So far only very few deterministic
constructions of hard instances for property testing are known. We believe that
our construction may lead to future insights in graph theory and towards a
characterisation of the properties that are testable in the bounded-degree
model.
","[{'version': 'v1', 'created': 'Thu, 13 Aug 2020 10:22:53 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Jan 2021 17:20:56 GMT'}, {'version': 'v3', 'created': 'Tue, 19 Jan 2021 10:11:01 GMT'}, {'version': 'v4', 'created': 'Mon, 13 Sep 2021 18:33:13 GMT'}, {'version': 'v5', 'created': 'Fri, 17 Dec 2021 08:45:03 GMT'}, {'version': 'v6', 'created': 'Fri, 21 Jan 2022 14:58:47 GMT'}]",2022-03-14,"[['Adler', 'Isolde', '', 'University of Leeds'], ['Köhler', 'Noleen', '', 'University of Leeds']]","['Hamiltonian cycle', 'property testing', 'bounded-degree graphs', 'bounded-degree model', 'lower bound']"
9429,2103.02453,Shoko Imaizumi,Minagi Ueda and Shoko Imaizumi,"Reversible Data Hiding Associated with Digital Halftoning That Allows
  Printing with Special Color Ink by Using Single Color Layer",2 pages,,10.1541/ieejeiss.141.163,"IEEJ Trans. Electr. Inf. & Syst., vol.141, no.2, pp.163-164,
  February 2021",cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an efficient framework of reversible data hiding to preserve
compatibility between normal printing and printing with a special color ink by
using a single common image. The special color layer is converted to a binary
image by digital halftoning and losslessly compressed using JBIG2. Then, the
compressed information of the binarized special color layer is reversibly
embedded into the general color layer without significant distortion. Our
experimental results show the availability of the proposed method in terms of
the marked image quality.
","[{'version': 'v1', 'created': 'Wed, 3 Mar 2021 14:59:58 GMT'}]",2021-03-04,"[['Ueda', 'Minagi', ''], ['Imaizumi', 'Shoko', '']]","['reversible data hiding', 'printing with special color ink', 'digital halftoning', 'image compression']"
9430,2008.07873,Kun Zhou,"Kun Zhou, Hui Wang, Wayne Xin Zhao, Yutao Zhu, Sirui Wang, Fuzheng
  Zhang, Zhongyuan Wang and Ji-Rong Wen","S^3-Rec: Self-Supervised Learning for Sequential Recommendation with
  Mutual Information Maximization",Accepted as CIKM2020 long paper,,10.1145/3340531.3411954,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, significant progress has been made in sequential recommendation
with deep learning. Existing neural sequential recommendation models usually
rely on the item prediction loss to learn model parameters or data
representations. However, the model trained with this loss is prone to suffer
from data sparsity problem. Since it overemphasizes the final performance, the
association or fusion between context data and sequence data has not been well
captured and utilized for sequential recommendation. To tackle this problem, we
propose the model S^3-Rec, which stands for Self-Supervised learning for
Sequential Recommendation, based on the self-attentive neural architecture. The
main idea of our approach is to utilize the intrinsic data correlation to
derive self-supervision signals and enhance the data representations via
pre-training methods for improving sequential recommendation. For our task, we
devise four auxiliary self-supervised objectives to learn the correlations
among attribute, item, subsequence, and sequence by utilizing the mutual
information maximization (MIM) principle. MIM provides a unified way to
characterize the correlation between different types of data, which is
particularly suitable in our scenario. Extensive experiments conducted on six
real-world datasets demonstrate the superiority of our proposed method over
existing state-of-the-art methods, especially when only limited training data
is available. Besides, we extend our self-supervised learning method to other
recommendation models, which also improve their performance.
","[{'version': 'v1', 'created': 'Tue, 18 Aug 2020 11:44:10 GMT'}]",2020-08-19,"[['Zhou', 'Kun', ''], ['Wang', 'Hui', ''], ['Zhao', 'Wayne Xin', ''], ['Zhu', 'Yutao', ''], ['Wang', 'Sirui', ''], ['Zhang', 'Fuzheng', ''], ['Wang', 'Zhongyuan', ''], ['Wen', 'Ji-Rong', '']]","['Self-Supervised Learning', 'Sequential Recommendation', 'Mutual Information Maximization']"
9431,1806.07292,Joberto Martins Prof. Dr.,"Rafael Freitas Reale, Romildo Martins da S. Bezerra and Joberto S. B.
  Martins","G-BAM: A Generalized Bandwidth Allocation Model for IP/MPLS/DS-TE
  Networks",,"International Journal of Computer Information Systems and
  Industrial Management Applications, vol 6, pp 635 643, Dec 2014",10.5281/zenodo.1292771,,cs.NI,http://creativecommons.org/licenses/by-sa/4.0/,"  Bandwidth Allocation Models (BAMs) configure and handle resource allocation
(bandwidth, LSPs, fiber) in networks in general (IP/MPLS/DS-TE, optical domain,
other). BAMs currently available for IP/MPLS/DS-TE networks (MAM, RDM, G-RDM
and AllocTC-Sharing) basically define resource restrictions (bandwidth) by
class (traffic class, application class, user class or other grouping criteria)
and allocate on demand this resource. There is a BAM allocation policy inherent
for each existing model which behaves differently under distinct network state,
such as heavy traffic loads and dynamic traffic and/or application scenarios. A
generalized Bandwidth Allocation Model (G-BAM) is proposed in this paper.
G-BAM, firstly, incorporates the inherent behavior of currently used BAMs such
as MAM, RDM, G-RDM and AllocTC-Sharing in IP/MPLS/DS-TE context. G-BAM,
secondly, proposes a new policy/ behavior allocation in addition to existing
ones in which additional private resources are incorporated. G-BAM, thirdly,
allows a smoother BAM policy transition among existing policy alternatives
resulting from MAM, RDM and AllocTC-Sharing adoption independently. The paper
focuses on the first characteristics of G-BAM which is to reproduce MAM, RDM
and AllocTC-Sharing behaviors. As such, the required configuration to achieve
MAM, RDM and AllocTC-Sharing behaviors is presented followed by a proof of
concept. Authors argue that the G-BAM reproducibility characteristics may
improve overall network resource utilization under distinct traffic profiles.
","[{'version': 'v1', 'created': 'Tue, 19 Jun 2018 14:52:12 GMT'}]",2018-06-20,"[['Reale', 'Rafael Freitas', ''], ['Bezerra', 'Romildo Martins da S.', ''], ['Martins', 'Joberto S. B.', '']]","['Bandwidth Allocation Models -BAM', 'Dynamic Resource Management', 'MAM', 'RDM', 'AllocTC-Sharing', 'BAM Switching']"
9432,2103.11071,Yuguang Shi,"Yuguang Shi, Yu Guo, Zhenqiang Mi, Xinjie Li",Stereo CenterNet based 3D Object Detection for Autonomous Driving,,"Published by Neurocomputing,Volume 471, 30 January 2022, Pages
  219-229",10.1016/j.neucom.2021.11.048,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, three-dimensional (3D) detection based on stereo images has
progressed remarkably; however, most advanced methods adopt anchor-based
two-dimensional (2D) detection or depth estimation to address this problem.
Nevertheless, high computational cost inhibits these methods from achieving
real-time performance. In this study, we propose a 3D object detection method,
Stereo CenterNet (SC), using geometric information in stereo imagery. SC
predicts the four semantic key points of the 3D bounding box of the object in
space and utilizes 2D left and right boxes, 3D dimension, orientation, and key
points to restore the bounding box of the object in the 3D space. Subsequently,
we adopt an improved photometric alignment module to further optimize the
position of the 3D bounding box. Experiments conducted on the KITTI dataset
indicate that the proposed SC exhibits the best speed-accuracy trade-off among
advanced methods without using extra data.
","[{'version': 'v1', 'created': 'Sat, 20 Mar 2021 02:18:49 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Apr 2021 16:16:14 GMT'}, {'version': 'v3', 'created': 'Thu, 23 Sep 2021 08:50:58 GMT'}]",2021-12-03,"[['Shi', 'Yuguang', ''], ['Guo', 'Yu', ''], ['Mi', 'Zhenqiang', ''], ['Li', 'Xinjie', '']]","['3D object detection', 'stereo imagery', 'photometric alignment']"
9433,1710.05141,Kenji Saito,"Kenji Saito, Shinji Hatta, Toshiya Hanada",Digital Currency Design for Sustainable Active Debris Removal in Space,"18 pages, 12 figures","IEEE Transactions on Computational Social Systems, vol. 6, no. 1,
  pp. 127-134, Feb. 2019",10.1109/TCSS.2018.2890655,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Orbital debris remains as an obstacle to further space development. While
efforts are ongoing to avoid newly launched objects becoming debris, the number
of debris would still continue to grow because of collisions. ADR (Active
Debris Removal) is an effective measure, but building a sustainable economic
model for ADR remains as a difficult problem. We propose that the cost of
removal can be paid by circulating digital currency tokens on a blockchain
platform whose values may decrease and/or increase over time, issued by global
cooperation (a consortium) of parties interested in space development, in
exchange with proofs of ADR. The tokens pay their cost by themselves through
contributions by the token holders, who are likely to be benefited by removal
of debris. This scheme imposes virtually no cost to the consortium. We have
generalized this concept as POD (Proof of Disposal), which, we believe,
provides a more accountable foundation for solving social problems with digital
currency than many ICO (Initial Coin or Cryptoasset Offering) in practice
today. We evaluated the feasibility of our proposal through a simulation. We
conclude that dynamic estimation of the economic values of each ADR and
automated pricing of tokens that represent the orbital debris being removed are
indeed possible. Actual prototyping of the proposed digital currency system is
ongoing.
","[{'version': 'v1', 'created': 'Sat, 14 Oct 2017 06:48:44 GMT'}, {'version': 'v2', 'created': 'Mon, 13 May 2019 21:59:35 GMT'}]",2019-05-15,"[['Saito', 'Kenji', ''], ['Hatta', 'Shinji', ''], ['Hanada', 'Toshiya', '']]","['Digital currency', 'Cryptocurrency', 'Blockchain', 'Orbital debris', 'Environmental remediation']"
9434,2205.06761,Diab Abueidda,"Junyan He, Shashank Kushwaha, Diab Abueidda, Iwona Jasiuk","Exploring the structure-property relations of thin-walled, 2D extruded
  lattices using neural networks",,,10.1016/j.compstruc.2022.106940,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  This paper investigates the structure-property relations of thin-walled
lattices under dynamic longitudinal compression, characterized by their
cross-sections and heights. These relations elucidate the interactions of
different geometric features of a design on mechanical response, including
energy absorption. We proposed a combinatorial, key-based design system to
generate different lattice designs and used the finite element method to
simulate their response with the Johnson-Cook material model. Using an
autoencoder, we encoded the cross-sectional images of the lattices into latent
design feature vectors, which were supplied to the neural network model to
generate predictions. The trained models can accurately predict lattice energy
absorption curves in the key-based design system and can be extended to new
designs outside of the system via transfer learning.
","[{'version': 'v1', 'created': 'Fri, 13 May 2022 16:45:54 GMT'}]",2022-12-22,"[['He', 'Junyan', ''], ['Kushwaha', 'Shashank', ''], ['Abueidda', 'Diab', ''], ['Jasiuk', 'Iwona', '']]","['Thin-walled lattices', 'Structure-property relations', 'Johnson-Cook model', 'Neuralnetworks']"
9435,1910.12711,Francesco Tudisco,"Francesca Arrigo, Desmond J. Higham, Francesco Tudisco","A framework for second order eigenvector centralities and clustering
  coefficients",,,10.1098/rspa.2019.0724,,cs.SI cs.NA math.NA physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose and analyse a general tensor-based framework for incorporating
second order features into network measures. This approach allows us to combine
traditional pairwise links with information that records whether triples of
nodes are involved in wedges or triangles. Our treatment covers classical
spectral methods and recently proposed cases from the literature, but we also
identify many interesting extensions. In particular, we define a
mutually-reinforcing (spectral) version of the classical clustering
coefficient. The underlying object of study is a constrained nonlinear
eigenvalue problem associated with a cubic tensor. Using recent results from
nonlinear Perron--Frobenius theory, we establish existence and uniqueness under
appropriate conditions, and show that the new spectral measures can be computed
efficiently with a nonlinear power method. To illustrate the added value of the
new formulation, we analyse the measures on a class of synthetic networks. We
also give computational results on centrality and link prediction for
real-world networks.
","[{'version': 'v1', 'created': 'Mon, 28 Oct 2019 14:31:47 GMT'}]",2021-03-17,"[['Arrigo', 'Francesca', ''], ['Higham', 'Desmond J.', ''], ['Tudisco', 'Francesco', '']]","['Clustering coefficient', 'Eigenvector centrality', 'Higher order network analysis', 'Tensor', 'Hypergraph', 'Perron-Frobenius theory', 'Link prediction']"
9436,2104.05375,Peter Mell,"Carlos Cardoso Galhardo, Peter Mell, Irena Bojanova, Assane Gueye",Measurements of the Most Significant Software Security Weaknesses,12 pages,,10.1145/3427228.3427257,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we provide a metric to calculate the most significant software
security weaknesses as defined by an aggregate metric of the frequency,
exploitability, and impact of related vulnerabilities. The Common Weakness
Enumeration (CWE) is a well-known and used list of software security
weaknesses. The CWE community publishes such an aggregate metric to calculate
the `Most Dangerous Software Errors'. However, we find that the published
equation highly biases frequency and almost ignores exploitability and impact
in generating top lists of varying sizes. This is due to the differences in the
distributions of the component metric values. To mitigate this, we linearize
the frequency distribution using a double log function. We then propose a
variety of other improvements, provide top lists of the most significant CWEs
for 2019, provide an analysis of the identified software security weaknesses,
and compare them against previously published top lists.
","[{'version': 'v1', 'created': 'Mon, 12 Apr 2021 11:51:50 GMT'}]",2021-04-13,"[['Galhardo', 'Carlos Cardoso', ''], ['Mell', 'Peter', ''], ['Bojanova', 'Irena', ''], ['Gueye', 'Assane', '']]","['Security', 'Weakness', 'Software Flaw', 'Severity']"
9437,1903.06043,Vahan Mkrtchyan,Giuseppe Mazzuoccolo and Vahan Mkrtchyan,Normal 6-edge-colorings of some bridgeless cubic graphs,"17 pages, 11 figures. arXiv admin note: text overlap with
  arXiv:1804.09449",,10.1016/j.dam.2019.09.019,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In an edge-coloring of a cubic graph, an edge is poor or rich, if the set of
colors assigned to the edge and the four edges adjacent it, has exactly five or
exactly three distinct colors, respectively. An edge is normal in an
edge-coloring if it is rich or poor in this coloring. A normal
$k$-edge-coloring of a cubic graph is an edge-coloring with $k$ colors such
that each edge of the graph is normal. We denote by $\chi'_{N}(G)$ the smallest
$k$, for which $G$ admits a normal $k$-edge-coloring. Normal edge-colorings
were introduced by Jaeger in order to study his well-known Petersen Coloring
Conjecture. It is known that proving $\chi'_{N}(G)\leq 5$ for every bridgeless
cubic graph is equivalent to proving Petersen Coloring Conjecture. Moreover,
Jaeger was able to show that it implies classical conjectures like Cycle Double
Cover Conjecture and Berge-Fulkerson Conjecture. Recently, two of the authors
were able to show that any simple cubic graph admits a normal
$7$-edge-coloring, and this result is best possible. In the present paper, we
show that any claw-free bridgeless cubic graph, permutation snark, tree-like
snark admits a normal $6$-edge-coloring. Finally, we show that any bridgeless
cubic graph $G$ admits a $6$-edge-coloring such that at least $\frac{7}{9}\cdot
|E|$ edges of $G$ are normal.
","[{'version': 'v1', 'created': 'Wed, 13 Mar 2019 13:14:47 GMT'}, {'version': 'v2', 'created': 'Sun, 27 Oct 2019 13:29:53 GMT'}]",2021-10-05,"[['Mazzuoccolo', 'Giuseppe', ''], ['Mkrtchyan', 'Vahan', '']]","['Cubic graph', 'Petersen coloring conjecture', 'normal edge-coloring', 'class ofsnarks']"
9438,2001.05354,Shahram Zandian,"Kobra Mabodi, Mehdi Yusefi, Shahram Zandiyan, Leili Irankhah, Reza
  Fotohi","Multi-level trust-based intelligence schema for securing of internet of
  things (IoT) against security threats using cryptographic authentication","23 pages, 11 figures, journal","The Journal of Supercomputing, 1-25 (2020)",10.1007/s11227-019-03137-5,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The internet of things (IoT) is able to provide a prediction of linked,
universal, and smart nodes that have autonomous interaction when they present
services. Because of wide openness, relatively high processing power, and wide
distribution of IoT things, they are ideal for attacks of the gray hole. In the
gray hole attack, the attacker fakes itself as the shortest path to the
destination that is a thing here. This causes the routing packets not to reach
the destination. The proposed method is based on the AODV routing protocol and
is presented under the MTISS-IoT name which means for the reduction of gray
hole attacks using check node information. In this paper, a hybrid approach is
proposed based on cryptographic authentication. The proposed approach consists
of four phases, such as the verifying node trust in the IoT, testing the
routes, gray hole attack discovery, and the malicious attack elimination
process in MTISS-IoT. The method is evaluated here via extensive simulations
carried out in the NS-3 environment. The experimental results of four scenarios
demonstrated that the MTISS-IoT method can achieve a false positive rate of
14.104%, a false negative rate of 17.49%, and a detection rate of 94.5% when
gray hole attack was launched.
","[{'version': 'v1', 'created': 'Wed, 15 Jan 2020 14:51:05 GMT'}]",2020-01-16,"[['Mabodi', 'Kobra', ''], ['Yusefi', 'Mehdi', ''], ['Zandiyan', 'Shahram', ''], ['Irankhah', 'Leili', ''], ['Fotohi', 'Reza', '']]","['Internet of Things (IoT)', 'Gray hole attack', 'Multi-level trust']"
9439,2002.03583,Tom\'a\v{s} Masa\v{r}\'ik,"Radek Hu\v{s}ek, Du\v{s}an Knop, Tom\'a\v{s} Masa\v{r}\'ik","Approximation Algorithms for Steiner Tree Based on Star Contractions: A
  Unified View","27 pages, 9 figures",,10.4230/LIPIcs.IPEC.2020.16,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the Steiner Tree problem we are given an edge weighted undirected graph $G
= (V,E)$ and a set of terminals $R \subseteq V$. The task is to find a
connected subgraph of $G$ containing $R$ and minimizing the sum of weights of
its edges. We observe that many approximation algorithms for Steiner Tree
follow a similar scheme (meta-algorithm) and perform (exhaustively) a similar
routine which we call star contraction. Here, by a star contraction, we mean
finding a star-like subgraph in the input graph minimizing the ratio of its
weight to the number of contained terminals minus one. It is not hard to see
that the well-known MST-approximation seeks the best star to contract among
those containing two terminals only. We perform an empirical study of star
contractions with the relaxed condition on the number of terminals in each star
contraction. Our experiments suggest the following: -- if the algorithm
performs star contractions exhaustively, the quality of the solution is usually
slightly better than Zelikovsky's 11/6-approximation algorithm, -- on average
the quality of the solution returned by the MST-approximation algorithm
improves with every star contraction, -- the same holds for iterated MST
(MST+), which outperforms MST in every measurement while keeping very fast
running time (on average $\sim 3\times$ slower than MST), -- on average the
quality of the solution obtained by exhaustively performing star contraction is
about 16\% better than the initial MST-approximation, and -- we propose a more
precise way to find the so-called improved stars which yield a slightly better
solution within a comparable running time (on average $\sim 3\times$ slower).
Furthermore, we propose two improvements of Zelikovsky's 11/6-approximation
algorithm and we empirically confirm that the quality of the solution returned
by any of these is better than the one returned by the former algorithm.
","[{'version': 'v1', 'created': 'Mon, 10 Feb 2020 07:47:30 GMT'}]",2021-05-12,"[['Hušek', 'Radek', ''], ['Knop', 'Dušan', ''], ['Masařík', 'Tomáš', '']]","['Steiner tree', 'approximation', 'Star contractions', 'minimum spanning tree']"
9440,2012.12838,Stasys Jukna,Stasys Jukna and Hannes Seiwert,Sorting Can Exponentially Speed Up Pure Dynamic Programming,,"Information Processing Letters 159-160 (2020), article Nr. 105962",10.1016/j.ipl.2020.105962,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many discrete minimization problems, including various versions of the
shortest path problem, can be efficiently solved by dynamic programming (DP)
algorithms that are ""pure"" in that they only perform basic operations, as min,
max, +, but no conditional branchings via if-then-else in their recursion
equations. It is known that any pure (min,+) DP algorithm solving the minimum
weight spanning tree problem on undirected n-vertex graphs must perform at
least $2^{\Omega(\sqrt{n})}$ operations. We show that this problem can be
solved by a pure (min,max,+) DP algorithm performing only $O(n^3)$ operations.
The algorithm is essentially a (min,max) algorithm: addition operations are
only used to output the final values. The presence of both min and max
operations means that now DP algorithms can sort: this explains the title of
the paper.
","[{'version': 'v1', 'created': 'Wed, 23 Dec 2020 18:03:33 GMT'}]",2020-12-24,"[['Jukna', 'Stasys', ''], ['Seiwert', 'Hannes', '']]","['Spanning tree', 'MST problem', 'dynamic programming']"
9441,2107.07482,Peng Liang,"Yajing Luo, Peng Liang, Chong Wang, Mojtaba Shahin, Jing Zhan","Characteristics and Challenges of Low-Code Development: The
  Practitioners' Perspective","15th ACM/IEEE International Symposium on Empirical Software
  Engineering and Measurement (ESEM)",,10.1145/3475716.3475782,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Background: In recent years, Low-code development (LCD) is growing rapidly,
and Gartner and Forrester have predicted that the use of LCD is very promising.
Giant companies, such as Microsoft, Mendix, and Outsystems have also launched
their LCD platforms. Aim: In this work, we explored two popular online
developer communities, Stack Overflow (SO) and Reddit, to provide insights on
the characteristics and challenges of LCD from a practitioners' perspective.
Method: We used two LCD related terms to search the relevant posts in SO and
extracted 73 posts. Meanwhile, we explored three LCD related subreddits from
Reddit and collected 228 posts. We extracted data from these posts and applied
the Constant Comparison method to analyze the descriptions, benefits, and
limitations and challenges of LCD. For platforms and programming languages used
in LCD, implementation units in LCD, supporting technologies of LCD, types of
applications developed by LCD, and domains that use LCD, we used descriptive
statistics to analyze and present the results. Results: Our findings show that:
(1) LCD may provide a graphical user interface for users to drag and drop with
little or even no code; (2) the equipment of out-of-the-box units (e.g., APIs
and components) in LCD platforms makes them easy to learn and use as well as
speeds up the development; (3) LCD is particularly favored in the domains that
have the need for automated processes and workflows; and (4) practitioners have
conflicting views on the advantages and disadvantages of LCD. Conclusions: Our
findings suggest that researchers should clearly define the terms when they
refer to LCD, and developers should consider whether the characteristics of LCD
are appropriate for their projects.
","[{'version': 'v1', 'created': 'Thu, 15 Jul 2021 17:35:09 GMT'}]",2021-07-16,"[['Luo', 'Yajing', ''], ['Liang', 'Peng', ''], ['Wang', 'Chong', ''], ['Shahin', 'Mojtaba', ''], ['Zhan', 'Jing', '']]","['Low-Code Development', 'Stack Overflow', 'Reddit', 'Empirical Study']"
9442,1909.08604,Oleh Lukianykhin,"Oleh Lukianykhin, Tetiana Bogodorova",ModelicaGym: Applying Reinforcement Learning to Modelica Models,accepted at EOOLT'19,,10.1145/3365984.3365985,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents ModelicaGym toolbox that was developed to employ
Reinforcement Learning (RL) for solving optimization and control tasks in
Modelica models. The developed tool allows connecting models using Functional
Mock-up Interface (FMI) toOpenAI Gym toolkit in order to exploit Modelica
equation-based modelling and co-simulation together with RL algorithms as a
functionality of the tools correspondingly. Thus, ModelicaGym facilitates fast
and convenient development of RL algorithms and their comparison when solving
optimal control problem for Modelicadynamic models. Inheritance structure
ofModelicaGymtoolbox's classes and the implemented methods are discussed in
details. The toolbox functionality validation is performed on Cart-Pole
balancing problem. This includes physical system model description and its
integration using the toolbox, experiments on selection and influence of the
model parameters (i.e. force magnitude, Cart-pole mass ratio, reward ratio, and
simulation time step) on the learning process of Q-learning algorithm supported
with the discussion of the simulation results.
","[{'version': 'v1', 'created': 'Wed, 18 Sep 2019 17:48:12 GMT'}]",2019-10-29,"[['Lukianykhin', 'Oleh', ''], ['Bogodorova', 'Tetiana', '']]","['Cart Pole', 'FMI', 'JModelica']"
9443,2009.02016,Huan Lin,"Huan Lin and Fandong Meng and Jinsong Su and Yongjing Yin and
  Zhengyuan Yang and Yubin Ge and Jie Zhou and Jiebo Luo","Dynamic Context-guided Capsule Network for Multimodal Machine
  Translation",,,10.1145/3394171.3413715,,cs.CL cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multimodal machine translation (MMT), which mainly focuses on enhancing
text-only translation with visual features, has attracted considerable
attention from both computer vision and natural language processing
communities. Most current MMT models resort to attention mechanism, global
context modeling or multimodal joint representation learning to utilize visual
features. However, the attention mechanism lacks sufficient semantic
interactions between modalities while the other two provide fixed visual
context, which is unsuitable for modeling the observed variability when
generating translation. To address the above issues, in this paper, we propose
a novel Dynamic Context-guided Capsule Network (DCCN) for MMT. Specifically, at
each timestep of decoding, we first employ the conventional source-target
attention to produce a timestep-specific source-side context vector. Next, DCCN
takes this vector as input and uses it to guide the iterative extraction of
related visual features via a context-guided dynamic routing mechanism.
Particularly, we represent the input image with global and regional visual
features, we introduce two parallel DCCNs to model multimodal context vectors
with visual features at different granularities. Finally, we obtain two
multimodal context vectors, which are fused and incorporated into the decoder
for the prediction of the target word. Experimental results on the Multi30K
dataset of English-to-German and English-to-French translation demonstrate the
superiority of DCCN. Our code is available on
https://github.com/DeepLearnXMU/MM-DCCN.
","[{'version': 'v1', 'created': 'Fri, 4 Sep 2020 06:18:24 GMT'}]",2020-09-07,"[['Lin', 'Huan', ''], ['Meng', 'Fandong', ''], ['Su', 'Jinsong', ''], ['Yin', 'Yongjing', ''], ['Yang', 'Zhengyuan', ''], ['Ge', 'Yubin', ''], ['Zhou', 'Jie', ''], ['Luo', 'Jiebo', '']]","['Multimodal Machine Translation', 'Capsule Network', 'Transformer']"
9444,2009.09575,Francisco Cruz,"Adam Bignold, Francisco Cruz, Richard Dazeley, Peter Vamplew, Cameron
  Foale","Human Engagement Providing Evaluative and Informative Advice for
  Interactive Reinforcement Learning","23 pages, 15 figures","Neural Computing and Applications, 1-16 (2022)",10.1007/s00521-021-06850-6,,cs.AI cs.HC cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interactive reinforcement learning proposes the use of externally-sourced
information in order to speed up the learning process. When interacting with a
learner agent, humans may provide either evaluative or informative advice.
Prior research has focused on the effect of human-sourced advice by including
real-time feedback on the interactive reinforcement learning process,
specifically aiming to improve the learning speed of the agent, while
minimising the time demands on the human. This work focuses on answering which
of two approaches, evaluative or informative, is the preferred instructional
approach for humans. Moreover, this work presents an experimental setup for a
human-trial designed to compare the methods people use to deliver advice in
terms of human engagement. The results obtained show that users giving
informative advice to the learner agents provide more accurate advice, are
willing to assist the learner agent for a longer time, and provide more advice
per episode. Additionally, self-evaluation from participants using the
informative approach has indicated that the agent's ability to follow the
advice is higher, and therefore, they feel their own advice to be of higher
accuracy when compared to people providing evaluative advice.
","[{'version': 'v1', 'created': 'Mon, 21 Sep 2020 02:14:02 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jul 2022 07:14:45 GMT'}]",2022-07-08,"[['Bignold', 'Adam', ''], ['Cruz', 'Francisco', ''], ['Dazeley', 'Richard', ''], ['Vamplew', 'Peter', ''], ['Foale', 'Cameron', '']]","['interactive reinforcement learning', 'assisted reinforcement learning', 'evaluative and infor']"
9445,1401.6170,Jose Teixeira,Joni Salminen and Jose Teixeira,"Fools gold? Developer dilemmas in a closed mobile application market
  platform","Presented at the 15th International Conference on Electronic
  Commerce, ICEC 2013, Turku, Finland, August 13-15, 2013",,10.1007/978-3-642-39808-7_11,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we outline some potential conflicts that platform owners and
software developers face in mobile application markets. Our arguments are based
on comments captured in specialized online discussion forums, in which
developers gather to share knowledge and experiences. The key findings indicate
conflicts of interests, including 1) intra-platform competition, 2)
discriminative promotion, 3) entry prevention, 4) restricted monetization, 5)
restricted knowledge sharing, 6) substitution, and 7) strategic technology
selection. Opportunistic platform owners may use their power to discriminate
between third-part software developers. However, there are also potential
strategic solutions that developers can apply; for example diversification
(multi-homing), syndication and brand building.
","[{'version': 'v1', 'created': 'Thu, 23 Jan 2014 15:49:47 GMT'}]",2014-01-27,"[['Salminen', 'Joni', ''], ['Teixeira', 'Jose', '']]","['Platform', 'Ecosystem', 'Technological Strategy', 'Software']"
9446,2209.00602,Hayden Jananthan,"Hayden Jananthan, Lauren Milechin, Michael Jones, William Arcand,
  William Bergeron, David Bestor, Chansup Byun, Michael Houle, Matthew Hubbell,
  Vijay Gadepally, Anna Klein, Peter Michaleas, Guillermo Morales, Julie
  Mullen, Andrew Prout, Albert Reuther, Antonio Rosa, Siddharth Samsi, Charles
  Yee, Jeremy Kepner",Python Implementation of the Dynamic Distributed Dimensional Data Model,"8 pages, 7 figures, accepted to HPEC 2022",,10.1109/HPEC55821.2022.9926316,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Python has become a standard scientific computing language with fast-growing
support of machine learning and data analysis modules, as well as an increasing
usage of big data. The Dynamic Distributed Dimensional Data Model (D4M) offers
a highly composable, unified data model with strong performance built to handle
big data fast and efficiently. In this work we present an implementation of D4M
in Python. $D4M.py$ implements all foundational functionality of D4M and
includes Accumulo and SQL database support via Graphulo. We describe the
mathematical background and motivation, an explanation of the approaches made
for its fundamental functions and building blocks, and performance results
which compare $D4M.py$'s performance to D4M-MATLAB and D4M.jl.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2022 17:17:07 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Nov 2022 22:50:59 GMT'}]",2022-11-24,"[['Jananthan', 'Hayden', ''], ['Milechin', 'Lauren', ''], ['Jones', 'Michael', ''], ['Arcand', 'William', ''], ['Bergeron', 'William', ''], ['Bestor', 'David', ''], ['Byun', 'Chansup', ''], ['Houle', 'Michael', ''], ['Hubbell', 'Matthew', ''], ['Gadepally', 'Vijay', ''], ['Klein', 'Anna', ''], ['Michaleas', 'Peter', ''], ['Morales', 'Guillermo', ''], ['Mullen', 'Julie', ''], ['Prout', 'Andrew', ''], ['Reuther', 'Albert', ''], ['Rosa', 'Antonio', ''], ['Samsi', 'Siddharth', ''], ['Yee', 'Charles', ''], ['Kepner', 'Jeremy', '']]","['Python', 'matrix', 'array', 'sparse linear algebra', 'datascience']"
9447,1912.11849,Baris Yamansavascilar,"Baris Yamansavascilar, Ahmet Cihat Baktir, Atay Ozgovde, Cem Ersoy","Fault Tolerance in SDN Data Plane Considering Network and Application
  Based Metrics","15 pages, 20 figures, Journal Paper",,10.1016/j.jnca.2020.102780,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Failures in networks result in service disruptions which may cause
deteriorated Quality of Service (QoS) for the end users. Since SDN is becoming
the mainstream paradigm for networks, implementation of a robust fault
tolerance scheme for SDN-based networks is crucial. Existing SDN data plane
fault tolerance approaches can be classified as reactive and proactive which
may or may not rely on the controller, respectively. However, none of them
qualifies as a complete solution, providing only partial remedies. In this
work, we propose Dynamic Protection with Quality of Alternative Paths (DPQoAP)
that considers not only the existing faults within the network but also the
quality of alternative paths. As a result, we can sustain the QoS throughout
the network after the recovery. We also investigate how application based
parameters are affected by link failures. To this end, we explore the change in
Quality of Experience (QoE) caused by link failures under different cases using
Dynamic Adaptive Streaming over HTTP (DASH) for video streaming. On the other
hand, even though DASH is proposed as a solution to improve the QoE affected by
the dynamic conditions of the networks, it remains insufficient to handle the
congested links that show the symptoms of a link failure. Thus, we apply the
data plane fault tolerance approach in SDN to improve the QoE of DASH clients
in the case of congestion as well as the failure. The performance of the
proposed solutions are evaluated through various experiments considering the
QoS and QoE parameters. It is observed that DPQoAP enhances the efficiency of
the networking operations and adaptability of the applications.
","[{'version': 'v1', 'created': 'Thu, 26 Dec 2019 12:05:45 GMT'}]",2020-10-26,"[['Yamansavascilar', 'Baris', ''], ['Baktir', 'Ahmet Cihat', ''], ['Ozgovde', 'Atay', ''], ['Ersoy', 'Cem', '']]","['SDN', 'Fault Tolerance', 'Reliability', 'Dynamic Adaptive Streaming over HTTP (DASH)', 'Quality of Experience (QoE)', 'Quality ofService (QoS)']"
9448,2011.07990,"Markus Schr\""oder","Markus Schr\""oder, Christian Jilek, Michael Schulze, Andreas Dengel","The Person Index Challenge: Extraction of Persons from Messy, Short
  Texts","7 pages, accepted at ICAART 2021","Proceedings of the 13th International Conference on Agents and
  Artificial Intelligence (ICAART 2021), Online Streaming, February 4-6, Vol.
  2, pp. 531-537, SciTePress, 2021",10.5220/0010188405310537,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When persons are mentioned in texts with their first name, last name and/or
middle names, there can be a high variation which of their names are used, how
their names are ordered and if their names are abbreviated. If multiple persons
are mentioned consecutively in very different ways, especially short texts can
be perceived as ""messy"". Once ambiguous names occur, associations to persons
may not be inferred correctly. Despite these eventualities, in this paper we
ask how well an unsupervised algorithm can build a person index from short
texts. We define a person index as a structured table that distinctly catalogs
individuals by their names. First, we give a formal definition of the problem
and describe a procedure to generate ground truth data for future evaluations.
To give a first solution to this challenge, a baseline approach is implemented.
By using our proposed evaluation strategy, we test the performance of the
baseline and suggest further improvements. For future research the source code
is publicly available.
","[{'version': 'v1', 'created': 'Mon, 16 Nov 2020 14:36:42 GMT'}]",2021-08-02,"[['Schröder', 'Markus', ''], ['Jilek', 'Christian', ''], ['Schulze', 'Michael', ''], ['Dengel', 'Andreas', '']]","['Person Index', 'Extraction', 'Short Text']"
9449,2001.06007,Nicolas Lair,"Nicolas Lair, Cl\'ement Delgrange, David Mugisha, Jean-Michel Dussoux,
  Pierre-Yves Oudeyer, and Peter Ford Dominey","User-in-the-loop Adaptive Intent Detection for Instructable Digital
  Assistant",To be published as a conference paper in the proceedings of IUI'20,"25th International Conference on Intelligent User Interfaces (IUI
  '20), March 17--20, 2020, Cagliari, Italy",10.1145/3377325.3377490,,cs.HC cs.AI cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  People are becoming increasingly comfortable using Digital Assistants (DAs)
to interact with services or connected objects. However, for non-programming
users, the available possibilities for customizing their DA are limited and do
not include the possibility of teaching the assistant new tasks. To make the
most of the potential of DAs, users should be able to customize assistants by
instructing them through Natural Language (NL). To provide such
functionalities, NL interpretation in traditional assistants should be
improved: (1) The intent identification system should be able to recognize new
forms of known intents, and to acquire new intents as they are expressed by the
user. (2) In order to be adaptive to novel intents, the Natural Language
Understanding module should be sample efficient, and should not rely on a
pretrained model. Rather, the system should continuously collect the training
data as it learns new intents from the user. In this work, we propose AidMe
(Adaptive Intent Detection in Multi-Domain Environments), a user-in-the-loop
adaptive intent detection framework that allows the assistant to adapt to its
user by learning his intents as their interaction progresses. AidMe builds its
repertoire of intents and collects data to train a model of semantic similarity
evaluation that can discriminate between the learned intents and autonomously
discover new forms of known intents. AidMe addresses two major issues - intent
learning and user adaptation - for instructable digital assistants. We
demonstrate the capabilities of AidMe as a standalone system by comparing it
with a one-shot learning system and a pretrained NLU module through simulations
of interactions with a user. We also show how AidMe can smoothly integrate to
an existing instructable digital assistant.
","[{'version': 'v1', 'created': 'Thu, 16 Jan 2020 18:06:43 GMT'}]",2020-01-20,"[['Lair', 'Nicolas', ''], ['Delgrange', 'Clément', ''], ['Mugisha', 'David', ''], ['Dussoux', 'Jean-Michel', ''], ['Oudeyer', 'Pierre-Yves', ''], ['Dominey', 'Peter Ford', '']]","['Natural language processing', 'intent detection', 'user-in-the-loop', 'digital assistant', 'learning by interaction', 'multi-domain']"
9450,2207.08865,Luke Chen,"Luke Chen, Mohanad Odema, Mohammad Abdullah Al Faruque","Romanus: Robust Task Offloading in Modular Multi-Sensor Autonomous
  Driving Systems","This paper has been accepted to the 2022 International Conference On
  Computer-Aided Design (ICCAD 2022)",,10.1145/3508352.3549356,,cs.DC cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the high performance and safety requirements of self-driving
applications, the complexity of modern autonomous driving systems (ADS) has
been growing, instigating the need for more sophisticated hardware which could
add to the energy footprint of the ADS platform. Addressing this, edge
computing is poised to encompass self-driving applications, enabling the
compute-intensive autonomy-related tasks to be offloaded for processing at
compute-capable edge servers. Nonetheless, the intricate hardware architecture
of ADS platforms, in addition to the stringent robustness demands, set forth
complications for task offloading which are unique to autonomous driving.
Hence, we present $ROMANUS$, a methodology for robust and efficient task
offloading for modular ADS platforms with multi-sensor processing pipelines.
Our methodology entails two phases: (i) the introduction of efficient
offloading points along the execution path of the involved deep learning
models, and (ii) the implementation of a runtime solution based on Deep
Reinforcement Learning to adapt the operating mode according to variations in
the perceived road scene complexity, network connectivity, and server load.
Experiments on the object detection use case demonstrated that our approach is
14.99% more energy-efficient than pure local execution while achieving a 77.06%
reduction in risky behavior from a robust-agnostic offloading baseline.
","[{'version': 'v1', 'created': 'Mon, 18 Jul 2022 18:22:49 GMT'}]",2022-07-20,"[['Chen', 'Luke', ''], ['Odema', 'Mohanad', ''], ['Faruque', 'Mohammad Abdullah Al', '']]","['Autonomous Driving Systems', 'Multi-sensor', 'Sensor Fusion', 'Vehicular Edge Computing', 'Robustness', 'Task Offloading', 'Object Detection']"
9451,2008.09472,Mawulolo Ameko,"Mawulolo K. Ameko, Miranda L. Beltzer, Lihua Cai, Mehdi Boukhechba,
  Bethany A. Teachman, Laura E. Barnes","Offline Contextual Multi-armed Bandits for Mobile Health Interventions:
  A Case Study on Emotion Regulation",Accepted at RecSys 2020,,10.1145/3383313.3412244,,cs.IR cs.HC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Delivering treatment recommendations via pervasive electronic devices such as
mobile phones has the potential to be a viable and scalable treatment medium
for long-term health behavior management. But active experimentation of
treatment options can be time-consuming, expensive and altogether unethical in
some cases. There is a growing interest in methodological approaches that allow
an experimenter to learn and evaluate the usefulness of a new treatment
strategy before deployment. We present the first development of a treatment
recommender system for emotion regulation using real-world historical mobile
digital data from n = 114 high socially anxious participants to test the
usefulness of new emotion regulation strategies. We explore a number of offline
contextual bandits estimators for learning and propose a general framework for
learning algorithms. Our experimentation shows that the proposed doubly robust
offline learning algorithms performed significantly better than baseline
approaches, suggesting that this type of recommender algorithm could improve
emotion regulation. Given that emotion regulation is impaired across many
mental illnesses and such a recommender algorithm could be scaled up easily,
this approach holds potential to increase access to treatment for many people.
We also share some insights that allow us to translate contextual bandit models
to this complex real-world data, including which contextual features appear to
be most important for predicting emotion regulation strategy effectiveness.
","[{'version': 'v1', 'created': 'Fri, 21 Aug 2020 13:41:24 GMT'}]",2020-08-24,"[['Ameko', 'Mawulolo K.', ''], ['Beltzer', 'Miranda L.', ''], ['Cai', 'Lihua', ''], ['Boukhechba', 'Mehdi', ''], ['Teachman', 'Bethany A.', ''], ['Barnes', 'Laura E.', '']]","['Offline contextual bandits', 'User modeling', 'Emotion regulation', 'Mobile health', 'Health recommender systems']"
9452,2106.01331,Tao Chen,Tao Chen and Miqing Li,"Multi-Objectivizing Software Configuration Tuning (for a single
  performance concern)","13 pages, 7 figures, 4 tables. In Proceedings of the 29th ACM Joint
  European Software Engineering Conference and Symposium on the Foundations of
  Software Engineering (ESEC/FSE'21), 2021",,10.1145/3468264.3468555,,cs.DC cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Automatically tuning software configuration for optimizing a single
performance attribute (e.g., minimizing latency) is not trivial, due to the
nature of the configuration systems (e.g., complex landscape and expensive
measurement). To deal with the problem, existing work has been focusing on
developing various effective optimizers. However, a prominent issue that all
these optimizers need to take care of is how to avoid the search being trapped
in local optima -- a hard nut to crack for software configuration tuning due to
its rugged and sparse landscape, and neighboring configurations tending to
behave very differently. Overcoming such in an expensive measurement setting is
even more challenging. In this paper, we take a different perspective to tackle
this issue. Instead of focusing on improving the optimizer, we work on the
level of optimization model. We do this by proposing a meta
multi-objectivization model (MMO) that considers an auxiliary performance
objective (e.g., throughput in addition to latency). What makes this model
unique is that we do not optimize the auxiliary performance objective, but
rather use it to make similarly-performing while different configurations less
comparable (i.e. Pareto nondominated to each other), thus preventing the search
from being trapped in local optima.
  Experiments on eight real-world software systems/environments with diverse
performance attributes reveal that our MMO model is statistically more
effective than state-of-the-art single-objective counterparts in overcoming
local optima (up to 42% gain), while using as low as 24% of their measurements
to achieve the same (or better) performance result.
","[{'version': 'v1', 'created': 'Mon, 31 May 2021 03:03:53 GMT'}]",2021-06-03,"[['Chen', 'Tao', ''], ['Li', 'Miqing', '']]","['Configuration tuning', 'performance optimization', 'search-based software engineering', 'multi-objectivization']"
9453,2005.07875,Matthew Kirchner,"Matthew R. Kirchner, Eddie Ball, Jacques Hoffler, Don Gaublomme","Reachability as a Unifying Framework for Computing Helicopter Safe
  Operating Conditions and Autonomous Emergency Landing","Accepted for publication in the proceedings of the 2020 IFAC World
  Congress","IFAC PapersOnLine, volume 53, issue 2, pp. 9282-9287, 2020",10.1016/j.ifacol.2020.12.2381,UCLA CAM 20-42,cs.RO cs.SY eess.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a numeric method to compute the safe operating flight conditions
for a helicopter such that we can ensure a safe landing in the event of a
partial or total engine failure. The unsafe operating region is the complement
of the backwards reachable tube, which can be found as the sub-zero level set
of the viscosity solution of a Hamilton-Jacobi (HJ) equation. Traditionally,
numerical methods used to solve the HJ equation rely on a discrete grid of the
solution space and exhibit exponential scaling with dimension, which is
problematic for the high-fidelity dynamics models required for accurate
helicopter modeling. We avoid the use of spatial grids by formulating a
trajectory optimization problem, where the solution at each initial condition
can be computed in a computationally efficient manner. The proposed method is
shown to compute an autonomous landing trajectory from any operating condition,
even in non-cruise flight conditions.
","[{'version': 'v1', 'created': 'Sat, 16 May 2020 05:26:39 GMT'}, {'version': 'v2', 'created': 'Wed, 27 May 2020 05:09:27 GMT'}]",2021-04-21,"[['Kirchner', 'Matthew R.', ''], ['Ball', 'Eddie', ''], ['Hoffler', 'Jacques', ''], ['Gaublomme', 'Don', '']]","['Reachability', 'Autorotation', 'Optimal Control']"
9454,1508.06778,L\'aszl\'o Csat\'o,L\'aszl\'o Csat\'o,A graph interpretation of the least squares ranking method,,"Social Choice and Welfare, 44(1): 51-69, 2015",10.1007/s00355-014-0820-0,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper aims at analyzing the least squares ranking method for generalized
tournaments with possible missing and multiple paired comparisons. The
bilateral relationships may reflect the outcomes of a sport competition,
product comparisons, or evaluation of political candidates and policies. It is
shown that the rating vector can be obtained as a limit point of an iterative
process based on the scores in almost all cases. The calculation is interpreted
on an undirected graph with loops attached to some nodes, revealing that the
procedure takes into account not only the given object's results but also the
strength of objects compared with it. We explore the connection between this
method and another procedure defined for ranking the nodes in a digraph, the
positional power measure. The decomposition of the least squares solution
offers a number of ways to modify the method.
","[{'version': 'v1', 'created': 'Thu, 27 Aug 2015 09:42:42 GMT'}]",2019-06-20,"[['Csató', 'László', '']]","['Preference aggregation', 'Paired comparison', 'Ranking', 'Least squares method', 'Laplacianmatrix']"
9455,2002.11813,Lucas Layman,"Lucas Layman, Yang Song, Curry Guinn",Toward Predicting Success and Failure in CS2: A Mixed-Method Analysis,"The definitive Version of Record was published in 2020 ACM Southeast
  Conference (ACMSE 2020), April 2-4, 2020, Tampa, FL, USA. 8 pages",,10.1145/3374135.3385277,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Factors driving success and failure in CS1 are the subject of much study but
less so for CS2. This paper investigates the transition from CS1 to CS2 in
search of leading indicators of success in CS2. Both CS1 and CS2 at the
University of North Carolina Wilmington (UNCW) are taught in Python with annual
enrollments of 300 and 150 respectively. In this paper, we report on the
following research questions: 1) Are CS1 grades indicators of CS2 grades? 2)
Does a quantitative relationship exist between CS2 course grade and a modified
version of the SCS1 concept inventory? 3) What are the most challenging aspects
of CS2, and how well does CS1 prepare students for CS2 from the student's
perspective? We provide a quantitative analysis of 2300 CS1 and CS2 course
grades from 2013--2019. In Spring 2019, we administered a modified version of
the SCS1 concept inventory to 44 students in the first week of CS2. Further, 69
students completed an exit questionnaire at the conclusion of CS2 to gain
qualitative student feedback on their challenges in CS2 and on how well CS1
prepared them for CS2. We find that 56% of students' grades were lower in CS2
than CS1, 18% improved their grades, and 26% earned the same grade. Of the
changes, 62% were within one grade point. We find a statistically significant
correlation between the modified SCS1 score and CS2 grade points. Students
identify linked lists and class/object concepts among the most challenging.
Student feedback on CS2 challenges and the adequacy of their CS1 preparations
identify possible avenues for improving the CS1-CS2 transition.
","[{'version': 'v1', 'created': 'Tue, 25 Feb 2020 01:49:43 GMT'}]",2020-02-28,"[['Layman', 'Lucas', ''], ['Song', 'Yang', ''], ['Guinn', 'Curry', '']]","['CS1', 'CS2', 'student assessment']"
9456,1910.11754,Diego Pennino,"Diego Pennino, Maurizio Pizzonia and Alessio Papi","Overlay Indexes: Efficiently Supporting Aggregate Range Queries and
  Authenticated Data Structures in Off-the-Shelf Databases",,"IEEE Access, Volume 7, pages 175642 - 175670, year 2019",10.1109/ACCESS.2019.2957346,,cs.DB cs.CR cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Commercial off-the-shelf DataBase Management Systems (DBMSes) are highly
optimized to process a wide range of queries by means of carefully designed
indexing and query planning. However, many aggregate range queries are usually
performed by DBMSes using sequential scans, and certain needs, like storing
Authenticated Data Structures (ADS), are not supported at all. Theoretically,
these needs could be efficiently fulfilled adopting specific kinds of indexing,
which however are normally ruled-out in DBMSes design.
  We introduce the concept of overlay index: an index that is meant to be
stored in a standard database, alongside regular data and managed by regular
software, to complement DBMS capabilities. We show a data structure, that we
call DB-tree, that realizes an overlay index to support a wide range of custom
aggregate range queries as well as ADSes, efficiently. All DB-trees operations
can be performed by executing a small number of queries to the DBMS, that can
be issued in parallel in one or two query rounds, and involves a logarithmic
amount of data. We experimentally evaluate the efficiency of DB-trees showing
that our approach is effective, especially if data updates are limited.
","[{'version': 'v1', 'created': 'Fri, 25 Oct 2019 14:24:35 GMT'}]",2019-12-18,"[['Pennino', 'Diego', ''], ['Pizzonia', 'Maurizio', ''], ['Papi', 'Alessio', '']]","['Database systems', 'Indexes', 'Tree data structures', 'Data security', 'Computational efficiency', 'Aggregated range queries', 'Authenticateddata structures']"
9457,2007.04604,Sao Mai Nguyen,"Linda Nanan Vall\'ee (ESATIC), Christophe Lohr, Sao Mai Nguyen (IMT
  Atlantique), Ioannis Kanellos (IMT Atlantique - INFO), O. Asseu (ESATIC)",Building an Automated Gesture Imitation Game for Teenagers with ASD,,"Far East Journal of Electronics and Communications, 2019, 22,
  pp.19 - 28",10.17654/EC023010001,,cs.HC cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autism spectrum disorder is a neurodevelopmental condition that includes
issues with communication and social interactions. People with ASD also often
have restricted interests and repetitive behaviors. In this paper we build
preliminary bricks of an automated gesture imitation game that will aim at
improving social interactions with teenagers with ASD. The structure of the
game is presented, as well as support tools and methods for skeleton detection
and imitation learning. The game shall later be implemented using an
interactive robot.
","[{'version': 'v1', 'created': 'Thu, 9 Jul 2020 07:27:43 GMT'}]",2020-07-10,"[['Vallée', 'Linda Nanan', '', 'ESATIC'], ['Lohr', 'Christophe', '', 'IMT\n  Atlantique'], ['Nguyen', 'Sao Mai', '', 'IMT\n  Atlantique'], ['Kanellos', 'Ioannis', '', 'IMT Atlantique - INFO'], ['Asseu', 'O.', '', 'ESATIC']]","['Autism', 'Imitation', 'Artificial intelligence', 'Human-machine interaction', 'Gesture']"
9458,2004.06883,Jon McCormack,Nina Rajcic and Jon McCormack,Mirror Ritual: Human-Machine Co-Construction of Emotion,"Paper presented at ACM TEI Conference 2020 Arts Track, Sydney
  Australia","TEI '20: Proceedings of the Fourteenth International Conference on
  Tangible, Embedded, and Embodied Interaction, February 2020, Pages 697-702",10.1145/3374920.3375293,,cs.HC cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mirror Ritual is an interactive installation that challenges the existing
paradigms in our understanding of human emotion and machine perception. In
contrast to prescriptive interfaces, the work's real-time affective interface
engages the audience in the iterative conceptualisation of their emotional
state through the use of affectively-charged machine generated poetry. The
audience are encouraged to make sense of the mirror's poetry by framing it with
respect to their recent life experiences, effectively `putting into words'
their felt emotion. This process of affect labelling and contextualisation
works to not only regulate emotion, but helps to construct the rich personal
narratives that constitute human identity.
","[{'version': 'v1', 'created': 'Wed, 15 Apr 2020 05:09:38 GMT'}]",2020-04-16,"[['Rajcic', 'Nina', ''], ['McCormack', 'Jon', '']]","['affective computing', 'emotion', 'neural networks', 'gaze detection', 'text generation', 'poetics']"
9459,2202.07966,Manuel Kauers,"Manuel Kauers, Christoph Koutschan",Guessing with Little Data,,"Proceedings of ISSAC 2022, pp 83--90",10.1145/3476446.3535486,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reconstructing a hypothetical recurrence equation from the first terms of an
infinite sequence is a classical and well-known technique in experimental
mathematics. We propose a variation of this technique which can succeed with
fewer input terms.
","[{'version': 'v1', 'created': 'Wed, 16 Feb 2022 10:20:17 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Jul 2022 12:37:58 GMT'}]",2022-07-11,"[['Kauers', 'Manuel', ''], ['Koutschan', 'Christoph', '']]","['Experimental Mathematics', 'D-finite Functions', 'Lattice Reduction', 'Integer Sequences']"
9460,1912.08923,Fei Ma,"Fei Ma, Xiaomin Wang, Ping Wang, Xudong Luo",Dense networks with scale-free feature,,,10.1103/PhysRevE.101.052317,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While previous works have shown that an overwhelming number of scale-free
networks are sparse, there still exist some real-world networks including
social networks, urban networks, information networks, which are by observation
dense. In this paper, we propose a novel framework for generating scale-free
graphs with dense feature using two simple yet helpful operations, first-order
subdivision and Line-operation. From the theoretical point of view, our method
can be used not only to produce desired scale-free graphs with density feature,
i.e. power-law exponent $\gamma$ falling into the interval $1<\gamma\leq2$, but
also to establish many other unexpected networked models, for instance,
power-law models having large diameter. In addition, the networked models
generated upon our framework show especially assortative structure. That is,
their own Pearson correlation coefficients are able to achieve the theoretical
upper bound. Last but not the least, we find the sizes of community in the
proposed models to follow power-law in form with respect to modularity
maximization.
","[{'version': 'v1', 'created': 'Mon, 2 Dec 2019 02:07:27 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Oct 2020 09:20:23 GMT'}]",2020-10-29,"[['Ma', 'Fei', ''], ['Wang', 'Xiaomin', ''], ['Wang', 'Ping', ''], ['Luo', 'Xudong', '']]","['Complex network', 'Dense graph', 'Scale-free feature']"
9461,2202.11426,Freddie Hong,"Freddie Hong, Steve Hodges, Connor Myant, David Boyle",Open5x: Accessible 5-axis 3D printing and conformal slicing,"6 pages, 7 Figures, Extended Abstracts of the 2022 CHI Conference on
  Human Factors in Computing Systems",,10.1145/3491101.3519782,,cs.HC cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The common layer-by-layer deposition of regular, 3-axis 3D printing
simplifies both the fabrication process and the 3D printer's mechanical design.
However, the resulting 3D printed objects have some unfavourable
characteristics including visible layers, uneven structural strength and
support material. To overcome these, researchers have employed robotic arms and
multi-axis CNCs to deposit materials in conformal layers. Conformal deposition
improves the quality of the 3D printed parts through support-less printing and
curved layer deposition. However, such multi-axis 3D printing is inaccessible
to many individuals due to high costs and technical complexities. Furthermore,
the limited GUI support for conformal slicers creates an additional barrier for
users. To open multi-axis 3D printing up to more makers and researchers, we
present a cheap and accessible way to upgrade a regular 3D printer to 5 axes.
We have also developed a GUI-based conformal slicer, integrated within a
popular CAD package. Together, these deliver an accessible workflow for
designing, simulating and creating conformally-printed 3D models.
","[{'version': 'v1', 'created': 'Wed, 23 Feb 2022 11:14:24 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Mar 2022 16:06:20 GMT'}]",2022-03-30,"[['Hong', 'Freddie', ''], ['Hodges', 'Steve', ''], ['Myant', 'Connor', ''], ['Boyle', 'David', '']]","['additive manufacturing', 'personal fabrication', 'democratising hardware']"
9462,2112.00648,Yu-Chin Chan,"Yu-Chin Chan, Daicong Da, Liwei Wang, Wei Chen","Remixing Functionally Graded Structures: Data-Driven Topology
  Optimization with Multiclass Shape Blending","Accepted to Structural and Multidisciplinary Optimization: Selected
  papers from WCSMO-14",,10.1007/s00158-022-03224-x,,cs.CE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To create heterogeneous, multiscale structures with unprecedented
functionalities, recent topology optimization approaches design either fully
aperiodic systems or functionally graded structures, which compete in terms of
design freedom and efficiency. We propose to inherit the advantages of both
through a data-driven framework for multiclass functionally graded structures
that mixes several families, i.e., classes, of microstructure topologies to
create spatially-varying designs with guaranteed feasibility. The key is a new
multiclass shape blending scheme that generates smoothly graded microstructures
without requiring compatible classes or connectivity and feasibility
constraints. Moreover, it transforms the microscale problem into an efficient,
low-dimensional one without confining the design to predefined shapes.
Compliance and shape matching examples using common truss geometries and
diversity-based freeform topologies demonstrate the versatility of our
framework, while studies on the effect of the number and diversity of classes
illustrate the effectiveness. The generality of the proposed methods supports
future extensions beyond the linear applications presented.
","[{'version': 'v1', 'created': 'Wed, 1 Dec 2021 16:54:56 GMT'}, {'version': 'v2', 'created': 'Sat, 2 Apr 2022 22:32:54 GMT'}]",2022-04-05,"[['Chan', 'Yu-Chin', ''], ['Da', 'Daicong', ''], ['Wang', 'Liwei', ''], ['Chen', 'Wei', '']]","['Topology optimization', 'Functionally graded structure', 'Multiscale', 'Multiclass', 'Shapeinterpolation', 'Data-driven design']"
9463,2202.05331,Daniel Fernandes,"Daniel Louzada Fernandes, Marcos Henrique Fonseca Ribeiro, Fabio
  Ribeiro Cerqueira, Michel Melo Silva","Describing image focused in cognitive and visual details for visually
  impaired people: An approach to generating inclusive paragraphs","Accepted in the 17th International Joint Conference on Computer
  Vision, Imaging and Computer Graphics Theory and Applications (VISAPP) 2022",,10.5220/0010845700003124,,cs.CV cs.AI cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several services for people with visual disabilities have emerged recently
due to achievements in Assistive Technologies and Artificial Intelligence
areas. Despite the growth in assistive systems availability, there is a lack of
services that support specific tasks, such as understanding the image context
presented in online content, e.g., webinars. Image captioning techniques and
their variants are limited as Assistive Technologies as they do not match the
needs of visually impaired people when generating specific descriptions. We
propose an approach for generating context of webinar images combining a dense
captioning technique with a set of filters, to fit the captions in our domain,
and a language model for the abstractive summary task. The results demonstrated
that we can produce descriptions with higher interpretability and focused on
the relevant information for that group of people by combining image analysis
methods and neural language models.
","[{'version': 'v1', 'created': 'Thu, 10 Feb 2022 21:20:53 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Feb 2022 20:38:22 GMT'}]",2022-02-17,"[['Fernandes', 'Daniel Louzada', ''], ['Ribeiro', 'Marcos Henrique Fonseca', ''], ['Cerqueira', 'Fabio Ribeiro', ''], ['Silva', 'Michel Melo', '']]","['Image Captioning', 'Dense Captioning', 'Neural Language Model', 'Visually Impaired', 'Assistive Technologies']"
9464,1707.08824,Davide Fucci,"Mathias Ellmann, Alexander Oeser, Davide Fucci, Walid Maalej","Find, Understand, and Extend Development Screencasts on YouTube",,,10.1145/3121257.3121260,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A software development screencast is a video that captures the screen of a
developer working on a particular task while explaining its implementation
details. Due to the increased popularity of software development screencasts
(e.g., available on YouTube), we study how and to what extent they can be used
as additional source of knowledge to answer developer's questions about, for
example, the use of a specific API. We first differentiate between development
and other types of screencasts using video frame analysis. By using the Cosine
algorithm, developers can expect ten development screencasts in the top 20 out
of 100 different YouTube videos. We then extracted popular development topics
on which screencasts are reporting on YouTube: database operations, system
set-up, plug-in development, game development, and testing. Besides, we found
six recurring tasks performed in development screencasts, such as object usage
and UI operations. Finally, we conducted a similarity analysis by considering
only the spoken words (i.e., the screencast transcripts but not the text that
might appear in a scene) to link API documents, such as the Javadoc, to the
appropriate screencasts. By using Cosine similarity, we identified 38 relevant
documents in the top 20 out of 9455 API documents.
","[{'version': 'v1', 'created': 'Thu, 27 Jul 2017 12:07:06 GMT'}]",2017-08-03,"[['Ellmann', 'Mathias', ''], ['Oeser', 'Alexander', ''], ['Fucci', 'Davide', ''], ['Maalej', 'Walid', '']]","['Development screencasts', 'API reference documents', 'Similarity analysis']"
9465,2105.01792,Xinlong Yin,"Ranjan Pal, Ziyuan Huang, Xinlong Yin, Sergey Lototsky, Swades De,
  Sasu Tarkoma, Mingyan Liu, Jon Crowcroft, Nishanth Sastry","Aggregate Cyber-Risk Management in the IoT Age: Cautionary Statistics
  for (Re)Insurers and Likes","incrementally updated version to version in IEEE Internet of Things
  Journal",,10.1109/JIOT.2020.3039254,,cs.PF cs.SY eess.SY q-fin.RM,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we provide (i) a rigorous general theory to elicit conditions
on (tail-dependent) heavy-tailed cyber-risk distributions under which a risk
management firm might find it (non)sustainable to provide aggregate cyber-risk
coverage services for smart societies, and (ii)a real-data driven numerical
study to validate claims made in theory assuming boundedly rational cyber-risk
managers, alongside providing ideas to boost markets that aggregate dependent
cyber-risks with heavy-tails.To the best of our knowledge, this is the only
complete general theory till date on the feasibility of aggregate cyber-risk
management.
","[{'version': 'v1', 'created': 'Tue, 4 May 2021 23:10:43 GMT'}]",2021-05-06,"[['Pal', 'Ranjan', ''], ['Huang', 'Ziyuan', ''], ['Yin', 'Xinlong', ''], ['Lototsky', 'Sergey', ''], ['De', 'Swades', ''], ['Tarkoma', 'Sasu', ''], ['Liu', 'Mingyan', ''], ['Crowcroft', 'Jon', ''], ['Sastry', 'Nishanth', '']]","['aggregate cyber-risk', 'heavy-tail', 'tail-dependency']"
9466,2201.12153,Zhe Sun,"Hao Jia, Zhe Sun, Feng Duan, Yu Zhang, Cesar F. Caiafa, Jordi
  Sol\'e-Casals",Improving Pre-movement Pattern Detection with Filter Bank Selection,,"Journal of Neural Engineering, 2022",10.1088/1741-2552/ac9e75,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pre-movement decoding plays an important role in movement detection and is
able to detect movement onset with low-frequency electroencephalogram (EEG)
signals before the limb moves. In related studies, pre-movement decoding with
standard task-related component analysis (STRCA) has been demonstrated to be
efficient for classification between movement state and resting state. However,
the accuracies of STRCA differ among subbands in the frequency domain. Due to
individual differences, the best subband differs among subjects and is
difficult to be determined. This study aims to improve the performance of the
STRCA method by a feature selection on multiple subbands and avoid the
selection of best subbands. This study first compares three frequency range
settings ($M_1$: subbands with equally spaced bandwidths; $M_2$: subbands whose
high cut-off frequencies are twice the low cut-off frequencies; $M_3$: subbands
that start at some specific fixed frequencies and end at the frequencies in an
arithmetic sequence.). Then, we develop a mutual information based technique to
select the features in these subbands. A binary support vector machine
classifier is used to classify the selected essential features. The results
show that $M_3$ is a better setting than the other two settings. With the
filter banks in $M_3$, the classification accuracy of the proposed FBTRCA
achieves 0.8700$\pm$0.1022, which means a significantly improved performance
compared to STRCA (0.8287$\pm$0.1101) as well as to the cross validation and
testing method (0.8431$\pm$0.1078).
","[{'version': 'v1', 'created': 'Fri, 28 Jan 2022 14:37:54 GMT'}]",2022-11-07,"[['Jia', 'Hao', ''], ['Sun', 'Zhe', ''], ['Duan', 'Feng', ''], ['Zhang', 'Yu', ''], ['Caiafa', 'Cesar F.', ''], ['Solé-Casals', 'Jordi', '']]","['Brain Computer Interface', 'Movement Detection', 'Pre-movement Decoding', 'Standard Task-Related Component Analysis', 'Filter Bank Selection']"
9467,1805.02393,Nikos Voskarides,"Nikos Voskarides, and Edgar Meij, and Ridho Reinanda, and Abhinav
  Khaitan, and Miles Osborne, and Giorgio Stefanoni, and Prabhanjan Kambadur,
  and Maarten de Rijke",Weakly-supervised Contextualization of Knowledge Graph Facts,"SIGIR 2018: 41st international ACM SIGIR conference on Research and
  Development in Information Retrieval. July version: corrected typos",,10.1145/3209978.3210031,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge graphs (KGs) model facts about the world, they consist of nodes
(entities such as companies and people) that are connected by edges (relations
such as founderOf). Facts encoded in KGs are frequently used by search
applications to augment result pages. When presenting a KG fact to the user,
providing other facts that are pertinent to that main fact can enrich the user
experience and support exploratory information needs. KG fact contextualization
is the task of augmenting a given KG fact with additional and useful KG facts.
The task is challenging because of the large size of KGs, discovering other
relevant facts even in a small neighborhood of the given fact results in an
enormous amount of candidates. We introduce a neural fact contextualization
method (NFCM) to address the KG fact contextualization task. NFCM first
generates a set of candidate facts in the neighborhood of a given fact and then
ranks the candidate facts using a supervised learning to rank model. The
ranking model combines features that we automatically learn from data and that
represent the query-candidate facts with a set of hand-crafted features we
devised or adjusted for this task. In order to obtain the annotations required
to train the learning to rank model at scale, we generate training data
automatically using distant supervision on a large entity-tagged text corpus.
We show that ranking functions learned on this data are effective at
contextualizing KG facts. Evaluation using human assessors shows that it
significantly outperforms several competitive baselines.
","[{'version': 'v1', 'created': 'Mon, 7 May 2018 08:22:57 GMT'}, {'version': 'v2', 'created': 'Sun, 8 Jul 2018 21:04:52 GMT'}]",2018-07-10,"[['Voskarides', 'Nikos', ''], ['Meij', 'Edgar', ''], ['Reinanda', 'Ridho', ''], ['Khaitan', 'Abhinav', ''], ['Osborne', 'Miles', ''], ['Stefanoni', 'Giorgio', ''], ['Kambadur', 'Prabhanjan', ''], ['de Rijke', 'Maarten', '']]","['Knowledge graphs', 'Fact contextualization', 'Distant supervision']"
9468,2012.04337,Hwanjun Song,"Hwanjun Song, Minseok Kim, Dongmin Park, Yooju Shin, Jae-Gil Lee",Robust Learning by Self-Transition for Handling Noisy Labels,Accepted at KDD 2021,,10.1145/3447548.3467222,,cs.LG cs.AI cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real-world data inevitably contains noisy labels, which induce the poor
generalization of deep neural networks. It is known that the network typically
begins to rapidly memorize false-labeled samples after a certain point of
training. Thus, to counter the label noise challenge, we propose a novel
self-transitional learning method called MORPH, which automatically switches
its learning phase at the transition point from seeding to evolution. In the
seeding phase, the network is updated using all the samples to collect a seed
of clean samples. Then, in the evolution phase, the network is updated using
only the set of arguably clean samples, which precisely keeps expanding by the
updated network. Thus, MORPH effectively avoids the overfitting to
false-labeled samples throughout the entire training period. Extensive
experiments using five real-world or synthetic benchmark datasets demonstrate
substantial improvements over state-of-the-art methods in terms of robustness
and efficiency.
","[{'version': 'v1', 'created': 'Tue, 8 Dec 2020 10:25:29 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Jun 2021 10:29:02 GMT'}]",2021-06-08,"[['Song', 'Hwanjun', ''], ['Kim', 'Minseok', ''], ['Park', 'Dongmin', ''], ['Shin', 'Yooju', ''], ['Lee', 'Jae-Gil', '']]","['Noisy Label', 'Label Noise', 'Robust Learning', 'Deep Learning']"
9469,1912.12636,Tzofnat Greenberg-Toledo,"Tzofnat Greenberg Toledo, Ben Perach, Itay Hubara, Daniel Soudry and
  Shahar Kvatinsky","Training of Quantized Deep Neural Networks using a Magnetic Tunnel
  Junction-Based Synapse","Published in Semiconductor Science and Technology, Vol 36",Semicond. Sci. Technol. 36 114003 (2021),10.1088/1361-6641/ac251b,,cs.ET cs.AR cs.LG cs.NE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Quantized neural networks (QNNs) are being actively researched as a solution
for the computational complexity and memory intensity of deep neural networks.
This has sparked efforts to develop algorithms that support both inference and
training with quantized weight and activation values, without sacrificing
accuracy. A recent example is the GXNOR framework for stochastic training of
ternary (TNN) and binary (BNN) neural networks. In this paper, we show how
magnetic tunnel junction (MTJ) devices can be used to support QNN training. We
introduce a novel hardware synapse circuit that uses the MTJ stochastic
behavior to support the quantize update. The proposed circuit enables
processing near memory (PNM) of QNN training, which subsequently reduces data
movement. We simulated MTJ-based stochastic training of a TNN over the MNIST,
SVHN, and CIFAR10 datasets and achieved an accuracy of 98.61%, 93.99% and
82.71%, respectively (less than 1% degradation compared to the GXNOR
algorithm). We evaluated the synapse array performance potential and showed
that the proposed synapse circuit can train ternary networks in situ, with
18.3TOPs/W for feedforward and 3TOPs/W for weight update.
","[{'version': 'v1', 'created': 'Sun, 29 Dec 2019 11:36:32 GMT'}, {'version': 'v2', 'created': 'Sun, 29 May 2022 07:16:41 GMT'}]",2022-05-31,"[['Toledo', 'Tzofnat Greenberg', ''], ['Perach', 'Ben', ''], ['Hubara', 'Itay', ''], ['Soudry', 'Daniel', ''], ['Kvatinsky', 'Shahar', '']]","['Magnetic Tunnel Junction', 'Memristor', 'Deep Neural Networks', 'QuantizedNeural Networks']"
9470,2103.04899,Shawn Jones,"Shawn M. Jones and Michele C. Weigle and Martin Klein and Michael L.
  Nelson",Automatically Selecting Striking Images for Social Cards,"10 pages, 5 figures, 10 tables",,10.1145/3447535.3462505,,cs.DL cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To allow previewing a web page, social media platforms have developed social
cards: visualizations consisting of vital information about the underlying
resource. At a minimum, social cards often include features such as the web
resource's title, text summary, striking image, and domain name. News and
scholarly articles on the web are frequently subject to social card creation
when being shared on social media. However, we noticed that not all web
resources offer sufficient metadata elements to enable appealing social cards.
For example, the COVID-19 emergency has made it clear that scholarly articles,
in particular, are at an aesthetic disadvantage in social media platforms when
compared to their often more flashy disinformation rivals. Also, social cards
are often not generated correctly for archived web resources, including pages
that lack or predate standards for specifying striking images. With these
observations, we are motivated to quantify the levels of inclusion of required
metadata in web resources, its evolution over time for archived resources, and
create and evaluate an algorithm to automatically select a striking image for
social cards. We find that more than 40% of archived news articles sampled from
the NEWSROOM dataset and 22% of scholarly articles sampled from the PubMed
Central dataset fail to supply striking images. We demonstrate that we can
automatically predict the striking image with a Precision@1 of 0.83 for news
articles from NEWSROOM and 0.78 for scholarly articles from the open access
journal PLOS ONE.
","[{'version': 'v1', 'created': 'Mon, 8 Mar 2021 17:01:45 GMT'}]",2022-01-19,"[['Jones', 'Shawn M.', ''], ['Weigle', 'Michele C.', ''], ['Klein', 'Martin', ''], ['Nelson', 'Michael L.', '']]","['summarization', 'image analysis', 'metadata analysis', 'web archives', 'scholarly communications']"
9471,1910.03139,Nitya Nand Dwivedi,"Taskeen Zaidi, Nitya Nand Dwivedi",Voice Packet Performance Estimation through Step Network Using OPNET,"2018 IEEE 3rd International Conference on Computing, Communication
  and Security (ICCCS). arXiv admin note: text overlap with arXiv:1701.04792",,10.1109/CCCS.2018.8586812,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  VoIP transfer voice over networks such as LAN. This technology is growing
rapidly due to support of existing network infrastructure at low cost. Various
simulations have been done and it is observed that by increasing the VoIP
client, packet length and traffic arrival rate the performance of step network
affected. In the current work packet dropped, packet received, voice traffic
sent and end-to-end delay is estimated for various queuing disciplines like PQ,
FIFO and WFQ. It is depicted that queuing disciplines effects the applications
performance and utilization of resources.
","[{'version': 'v1', 'created': 'Mon, 7 Oct 2019 17:46:03 GMT'}]",2019-10-09,"[['Zaidi', 'Taskeen', ''], ['Dwivedi', 'Nitya Nand', '']]","['Performance', 'Queuing Discipline', 'OPNET', 'PQ', 'WFQ', 'FQ']"
9472,1909.03812,Anastasia Ingacheva,"Alexander Sheshkus, Anastasia Ingacheva, Vladimir Arlazarov, Dmitry
  Nikolaev",HoughNet: neural network architecture for vanishing points detection,"6 pages, 6 figures, 2 tables, 28 references, conference","15th International Conference on Document Analysis and Recognition
  (ICDAR 2019)",10.1109/ICDAR.2019.00140,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we introduce a novel neural network architecture based on Fast
Hough Transform layer. The layer of this type allows our neural network to
accumulate features from linear areas across the entire image instead of local
areas. We demonstrate its potential by solving the problem of vanishing points
detection in the images of documents. Such problem occurs when dealing with
camera shots of the documents in uncontrolled conditions. In this case, the
document image can suffer several specific distortions including projective
transform. To train our model, we use MIDV-500 dataset and provide testing
results. The strong generalization ability of the suggested method is proven
with its applying to a completely different ICDAR 2011 dewarping contest. In
previously published papers considering these dataset authors measured the
quality of vanishing point detection by counting correctly recognized words
with open OCR engine Tesseract. To compare with them, we reproduce this
experiment and show that our method outperforms the state-of-the-art result.
","[{'version': 'v1', 'created': 'Mon, 9 Sep 2019 12:45:19 GMT'}, {'version': 'v2', 'created': 'Sun, 6 Oct 2019 07:41:38 GMT'}]",2020-07-09,"[['Sheshkus', 'Alexander', ''], ['Ingacheva', 'Anastasia', ''], ['Arlazarov', 'Vladimir', ''], ['Nikolaev', 'Dmitry', '']]","['Vanishing point', 'Fast Hough Transform', 'Convolutional Neural Network', 'Document Rectification', 'Deep Learning']"
9473,2007.08866,Sven Dziadek,"Manfred Droste, Sven Dziadek, Werner Kuich","Greibach Normal Form for $\omega$-Algebraic Systems and Weighted Simple
  $\omega$-Pushdown Automata",,Inf. Comput. 285 B (2022) 104871,10.1016/j.ic.2022.104871,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In weighted automata theory, many classical results on formal languages have
been extended into a quantitative setting. Here, we investigate weighted
context-free languages of infinite words, a generalization of
$\omega$-context-free languages (Cohen, Gold 1977) and an extension of weighted
context-free languages of finite words (Chomsky, Sch\""utzenberger 1963). As in
the theory of formal grammars, these weighted context-free languages, or
$\omega$-algebraic series, can be represented as solutions of mixed
$\omega$-algebraic systems of equations and by weighted $\omega$-pushdown
automata.
  In our first main result, we show that (mixed) $\omega$-algebraic systems can
be transformed into Greibach normal form. We use the Greibach normal form in
our second main result to prove that simple $\omega$-reset pushdown automata
recognize all $\omega$-algebraic series. Simple $\omega$-reset automata do not
use $\epsilon$-transitions and can change the stack only by at most one symbol.
These results generalize fundamental properties of context-free languages to
weighted context-free languages.
","[{'version': 'v1', 'created': 'Fri, 17 Jul 2020 09:49:43 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Oct 2021 12:01:50 GMT'}]",2022-06-24,"[['Droste', 'Manfred', ''], ['Dziadek', 'Sven', ''], ['Kuich', 'Werner', '']]","['Greibach normal form', 'weighted automata', 'omega-pushdown automata', 'omega context-free languages']"
9474,1805.01952,Ehsan Kamalloo,Ehsan Kamalloo and Davood Rafiei,A Coherent Unsupervised Model for Toponym Resolution,"9 pages (+1 page reference), WWW '18 Proceedings of the 2018 World
  Wide Web Conference",,10.1145/3178876.3186027,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Toponym Resolution, the task of assigning a location mention in a document to
a geographic referent (i.e., latitude/longitude), plays a pivotal role in
analyzing location-aware content. However, the ambiguities of natural language
and a huge number of possible interpretations for toponyms constitute
insurmountable hurdles for this task. In this paper, we study the problem of
toponym resolution with no additional information other than a gazetteer and no
training data. We demonstrate that a dearth of large enough annotated data
makes supervised methods less capable of generalizing. Our proposed method
estimates the geographic scope of documents and leverages the connections
between nearby place names as evidence to resolve toponyms. We explore the
interactions between multiple interpretations of mentions and the relationships
between different toponyms in a document to build a model that finds the most
coherent resolution. Our model is evaluated on three news corpora, two from the
literature and one collected and annotated by us; then, we compare our methods
to the state-of-the-art unsupervised and supervised techniques. We also examine
three commercial products including Reuters OpenCalais, Yahoo! YQL Placemaker,
and Google Cloud Natural Language API. The evaluation shows that our method
outperforms the unsupervised technique as well as Reuters OpenCalais and Google
Cloud Natural Language API on all three corpora; also, our method shows a
performance close to that of the state-of-the-art supervised method and
outperforms it when the test data has 40% or more toponyms that are not seen in
the training data.
","[{'version': 'v1', 'created': 'Fri, 4 May 2018 22:31:33 GMT'}, {'version': 'v2', 'created': 'Tue, 8 May 2018 22:21:53 GMT'}]",2018-05-10,"[['Kamalloo', 'Ehsan', ''], ['Rafiei', 'Davood', '']]","['Toponym resolution', 'geolocation extraction', 'unsupervised disambiguation', 'context-bound hypotheses', 'spatial hierarchies']"
9475,2003.03504,Ting-En Lin,"Ting-En Lin, Hua Xu","A Post-processing Method for Detecting Unknown Intent of Dialogue System
  via Pre-trained Deep Neural Network Classifier",Published in Knowledge-Based Systems 2019,,10.1016/j.knosys.2019.104979,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the maturity and popularity of dialogue systems, detecting user's
unknown intent in dialogue systems has become an important task. It is also one
of the most challenging tasks since we can hardly get examples, prior knowledge
or the exact numbers of unknown intents. In this paper, we propose SofterMax
and deep novelty detection (SMDN), a simple yet effective post-processing
method for detecting unknown intent in dialogue systems based on pre-trained
deep neural network classifiers. Our method can be flexibly applied on top of
any classifiers trained in deep neural networks without changing the model
architecture. We calibrate the confidence of the softmax outputs to compute the
calibrated confidence score (i.e., SofterMax) and use it to calculate the
decision boundary for unknown intent detection. Furthermore, we feed the
feature representations learned by the deep neural networks into traditional
novelty detection algorithm to detect unknown intents from different
perspectives. Finally, we combine the methods above to perform the joint
prediction. Our method classifies examples that differ from known intents as
unknown and does not require any examples or prior knowledge of it. We have
conducted extensive experiments on three benchmark dialogue datasets. The
results show that our method can yield significant improvements compared with
the state-of-the-art baselines
","[{'version': 'v1', 'created': 'Sat, 7 Mar 2020 03:29:01 GMT'}]",2020-03-26,"[['Lin', 'Ting-En', ''], ['Xu', 'Hua', '']]","['Novelty detection', 'Open-world classification', 'Probability calibration', 'Platt scaling', 'Dialoguesystem', 'Deep neural network']"
9476,2210.13263,Shyam Murthy,Shyam Murthy and Srinivas Vivek,Driver Locations Harvesting Attack on pRide,,,10.1007/978-3-031-23020-2_36,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Privacy preservation in Ride-Hailing Services (RHS) is intended to protect
privacy of drivers and riders. pRide, published in IEEE Trans. Vehicular
Technology 2021, is a prediction based privacy-preserving RHS protocol to match
riders with an optimum driver. In the protocol, the Service Provider (SP)
homomorphically computes Euclidean distances between encrypted locations of
drivers and rider. Rider selects an optimum driver using decrypted distances
augmented by a new-ride-emergence prediction. To improve the effectiveness of
driver selection, the paper proposes an enhanced version where each driver
gives encrypted distances to each corner of her grid. To thwart a rider from
using these distances to launch an inference attack, the SP blinds these
distances before sharing them with the rider. In this work, we propose a
passive attack where an honest-but-curious adversary rider who makes a single
ride request and receives the blinded distances from SP can recover the
constants used to blind the distances. Using the unblinded distances, rider to
driver distance and Google Nearest Road API, the adversary can obtain the
precise locations of responding drivers. We conduct experiments with random
on-road driver locations for four different cities. Our experiments show that
we can determine the precise locations of at least 80% of the drivers
participating in the enhanced pRide protocol.
","[{'version': 'v1', 'created': 'Mon, 24 Oct 2022 14:03:36 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Nov 2022 14:56:08 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Jan 2023 11:05:30 GMT'}]",2023-01-05,"[['Murthy', 'Shyam', ''], ['Vivek', 'Srinivas', '']]","['Ride-Hailing Services', 'Privacy and Censorship', 'Attacks']"
9477,1702.03741,Iqra Altaf Gillani,"Iqra Altaf Gillani, Pooja Vyavahare and Amitabha Bagchi",Random walk based in-network computation of arbitrary functions,,"Distributed Computing 34(3), 181-193, April 2021",10.1007/s00446-021-00394-7,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study in-network computation on general network topologies. Specifically,
we are given the description of a function, and a network with distinct nodes
at which the operands of the function are made available, and a designated sink
where the computed value of the function is to be consumed. We want to compute
the function during the process of moving the data towards the sink. Such
settings have been studied in the literature, but mainly for symmetric
functions, e.g. average, parity etc., which have the specific property that the
output is invariant to permutation of the operands. To the best of our
knowledge, we present the first fully decentralised algorithms for arbitrary
functions, which we model as those functions whose computation schema is
structured as a binary tree. We propose two algorithms, Fixed Random-Compute
and Flexible Random-Compute, for this problem, both of which use simple random
walks on the network as their basic primitive. Assuming a stochastic model for
the generation of streams of data at each source, we provide a lower and an
upper bound on the rate at which Fixed Random-Compute can compute the stream of
associated function values. Note that the lower bound on rate though computed
for our algorithm serves as a general lower bound for the function computation
problem and to the best of our knowledge is first such lower bound for
asymmetric functions. We also provide upper bounds on the average time taken to
compute the function, characterising this time in terms of the fundamental
parameters of the random walk on the network: the hitting time in the case of
Fixed Random-Compute, and the mixing time in the case of Flexible
Random-Compute.
","[{'version': 'v1', 'created': 'Mon, 13 Feb 2017 12:35:50 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Oct 2017 11:24:04 GMT'}, {'version': 'v3', 'created': 'Mon, 19 Feb 2018 14:31:50 GMT'}]",2021-06-22,"[['Gillani', 'Iqra Altaf', ''], ['Vyavahare', 'Pooja', ''], ['Bagchi', 'Amitabha', '']]","['Function computation', 'random walks', 'coalescing random walks', 'stable rate']"
9478,2007.15705,Jorge Lucero,Jorge C. Lucero and S{\l}awek Staworko,"A note on the class of languages generated by F-systems over regular
  languages","Nine pages. This is the accepted version of a manuscript submitted
  for publication in Information Processing Letters","Information Processing Letters 179, 106283, 2023",10.1016/j.ipl.2022.106283,,cs.FL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  An F-system is a computational model that performs a folding operation on
words of a given language, following directions coded on words of another given
language. This paper considers the case in which both given languages are
regular, and it shows that the class of languages generated by such F-systems
is a proper subset of the class of linear context-free languages.
","[{'version': 'v1', 'created': 'Thu, 30 Jul 2020 19:43:16 GMT'}, {'version': 'v2', 'created': 'Wed, 11 May 2022 13:22:22 GMT'}]",2022-05-23,"[['Lucero', 'Jorge C.', ''], ['Staworko', 'Sławek', '']]","['F-system', 'folding', 'regular language', 'linear language']"
9479,1912.10986,Thanh Pham Dinh,"Tran Ba Trung and Huynh Thi Thanh Binh and Le Tien Thanh and Ly Trung
  Hieu and Pham Dinh Thanh","Multifactorial Evolutionary Algorithm For Clustered Minimum Routing Cost
  Problem",,,10.1145/3368926.3369712,,cs.NE cs.AI cs.DM,http://creativecommons.org/licenses/by/4.0/,"  Minimum Routing Cost Clustered Tree Problem (CluMRCT) is applied in various
fields in both theory and application. Because the CluMRCT is NP-Hard, the
approximate approaches are suitable to find the solution for this problem.
Recently, Multifactorial Evolutionary Algorithm (MFEA) has emerged as one of
the most efficient approximation algorithms to deal with many different kinds
of problems. Therefore, this paper studies to apply MFEA for solving CluMRCT
problems. In the proposed MFEA, we focus on crossover and mutation operators
which create a valid solution of CluMRCT problem in two levels: first level
constructs spanning trees for graphs in clusters while the second level builds
a spanning tree for connecting among clusters. To reduce the consuming
resources, we will also introduce a new method of calculating the cost of
CluMRCT solution. The proposed algorithm is experimented on numerous types of
datasets. The experimental results demonstrate the effectiveness of the
proposed algorithm, partially on large instances
","[{'version': 'v1', 'created': 'Mon, 23 Dec 2019 17:27:22 GMT'}]",2019-12-24,"[['Trung', 'Tran Ba', ''], ['Binh', 'Huynh Thi Thanh', ''], ['Thanh', 'Le Tien', ''], ['Hieu', 'Ly Trung', ''], ['Thanh', 'Pham Dinh', '']]","['Clustered Minimum Routing Cost Problem', 'Clustered Tree Problem', 'Multifactorial Evolutionary Algorithm', 'Evolutionary Algorithm']"
9480,2111.11103,Florian Fervers,"Florian Fervers, Timo Breuer, Gregor Stachowiak, Sebastian Bullinger,
  Christoph Bodensteiner, Michael Arens","Improving Semantic Image Segmentation via Label Fusion in Semantically
  Textured Meshes",,,10.5220/0010841800003124,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Models for semantic segmentation require a large amount of hand-labeled
training data which is costly and time-consuming to produce. For this purpose,
we present a label fusion framework that is capable of improving semantic pixel
labels of video sequences in an unsupervised manner. We make use of a 3D mesh
representation of the environment and fuse the predictions of different frames
into a consistent representation using semantic mesh textures. Rendering the
semantic mesh using the original intrinsic and extrinsic camera parameters
yields a set of improved semantic segmentation images. Due to our optimized
CUDA implementation, we are able to exploit the entire $c$-dimensional
probability distribution of annotations over $c$ classes in an
uncertainty-aware manner. We evaluate our method on the Scannet dataset where
we improve annotations produced by the state-of-the-art segmentation network
ESANet from $52.05 \%$ to $58.25 \%$ pixel accuracy. We publish the source code
of our framework online to foster future research in this area
(\url{https://github.com/fferflo/semantic-meshes}). To the best of our
knowledge, this is the first publicly available label fusion framework for
semantic image segmentation based on meshes with semantic textures.
","[{'version': 'v1', 'created': 'Mon, 22 Nov 2021 10:47:32 GMT'}]",2022-02-25,"[['Fervers', 'Florian', ''], ['Breuer', 'Timo', ''], ['Stachowiak', 'Gregor', ''], ['Bullinger', 'Sebastian', ''], ['Bodensteiner', 'Christoph', ''], ['Arens', 'Michael', '']]","['Semantic Segmentation', 'Mesh Reconstruction', 'Label Fusion']"
9481,1604.04144,Jason Kuen,"Jason Kuen, Kian Ming Lim, Chin Poo Lee","Self-taught learning of a deep invariant representation for visual
  tracking via temporal slowness principle","Pattern Recognition (Elsevier), 2015",,10.1016/j.patcog.2015.02.012,,cs.CV cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visual representation is crucial for a visual tracking method's performances.
Conventionally, visual representations adopted in visual tracking rely on
hand-crafted computer vision descriptors. These descriptors were developed
generically without considering tracking-specific information. In this paper,
we propose to learn complex-valued invariant representations from tracked
sequential image patches, via strong temporal slowness constraint and stacked
convolutional autoencoders. The deep slow local representations are learned
offline on unlabeled data and transferred to the observational model of our
proposed tracker. The proposed observational model retains old training samples
to alleviate drift, and collect negative samples which are coherent with
target's motion pattern for better discriminative tracking. With the learned
representation and online training samples, a logistic regression classifier is
adopted to distinguish target from background, and retrained online to adapt to
appearance changes. Subsequently, the observational model is integrated into a
particle filter framework to peform visual tracking. Experimental results on
various challenging benchmark sequences demonstrate that the proposed tracker
performs favourably against several state-of-the-art trackers.
","[{'version': 'v1', 'created': 'Thu, 14 Apr 2016 13:12:07 GMT'}]",2016-04-15,"[['Kuen', 'Jason', ''], ['Lim', 'Kian Ming', ''], ['Lee', 'Chin Poo', '']]","['Visual tracking', 'temporal slowness', 'deep learning', 'self-taught learning', 'invariant representation']"
9482,2210.05245,Tim Schopf,"Tim Schopf, Simon Klimek, Florian Matthes","PatternRank: Leveraging Pretrained Language Models and Part of Speech
  for Unsupervised Keyphrase Extraction","Accepted to 14th International Joint Conference on Knowledge
  Discovery, Knowledge Engineering and Knowledge Management - KDIR","In Proceedings of the 14th International Joint Conference on
  Knowledge Discovery, Knowledge Engineering and Knowledge Management - KDIR
  2022, ISBN 978-989-758-614-9; ISSN 2184-3228, pages 243-248. DOI:
  10.5220/0011546600003335",10.5220/0011546600003335,,cs.CL cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Keyphrase extraction is the process of automatically selecting a small set of
most relevant phrases from a given text. Supervised keyphrase extraction
approaches need large amounts of labeled training data and perform poorly
outside the domain of the training data. In this paper, we present PatternRank,
which leverages pretrained language models and part-of-speech for unsupervised
keyphrase extraction from single documents. Our experiments show PatternRank
achieves higher precision, recall and F1-scores than previous state-of-the-art
approaches. In addition, we present the KeyphraseVectorizers package, which
allows easy modification of part-of-speech patterns for candidate keyphrase
selection, and hence adaptation of our approach to any domain.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2022 08:23:54 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Oct 2022 08:56:19 GMT'}]",2023-01-03,"[['Schopf', 'Tim', ''], ['Klimek', 'Simon', ''], ['Matthes', 'Florian', '']]","['Natural Language Processing', 'Keyphrase Extraction', 'Pretrained Language Models', 'Part of Speech']"
9483,2208.12149,Guillaume Deffuant,"Guillaume Deffuant, Thibaut Roubin",Emergence of group hierarchy,,,10.1016/j.physa.2022.128422,,cs.MA,http://creativecommons.org/licenses/by/4.0/,"  We consider an opinion dynamics model where, during random pair interactions,
each agent modifies her opinions about both agents of the random pair and also
about some other agents, chosen randomly. Moreover, each agent belongs to a
single group and the opinions within the group are attracted to their average.
In simulations starting from neutral opinions, we observe the emergence of a
group hierarchy. We derive a moment approximation that provides equations
ruling the evolution of the average opinion of agents in a group about the
agents of another group. This approximation explains how the group hierarchy
emerges.
","[{'version': 'v1', 'created': 'Thu, 25 Aug 2022 15:08:49 GMT'}]",2023-01-25,"[['Deffuant', 'Guillaume', ''], ['Roubin', 'Thibaut', '']]","['Opinion dynamics', 'Group', 'Hierarchy', 'Negative bias', 'Gossip', 'Moment approximation']"
9484,1911.01851,Clelia De Felice,"Paola Bonizzoni, Clelia De Felice, Rocco Zaccagnino, Rosalba Zizza","Lyndon words versus inverse Lyndon words: queries on suffixes and
  bordered words",arXiv admin note: text overlap with arXiv:1705.10277,"Theoretical Computer Science, 2020",10.1016/j.tcs.2020.10.034,,cs.FL math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lyndon words have been largely investigated and showned to be a useful tool
to prove interesting combinatorial properties of words. In this paper we state
new properties of both Lyndon and inverse Lyndon factorizations of a word $w$,
with the aim of exploring their use in some classical queries on $w$.
  The main property we prove is related to a classical query on words. We prove
that there are relations between the length of the longest common extension (or
longest common prefix) $lcp(x,y)$ of two different suffixes $x,y$ of a word $w$
and the maximum length $\mathcal{M}$ of two consecutive factors of the inverse
Lyndon factorization of $w$. More precisely, $\mathcal{M}$ is an upper bound on
the length of $lcp(x,y)$. This result is in some sense stronger than the
compatibility property, proved by Mantaci, Restivo, Rosone and Sciortino for
the Lyndon factorization and here for the inverse Lyndon factorization.
Roughly, the compatibility property allows us to extend the mutual order
between local suffixes of (inverse) Lyndon factors to the suffixes of the whole
word.
  A main tool used in the proof of the above results is a property that we
state for factors $m_i$ with nonempty borders in an inverse Lyndon
factorization: a nonempty border of $m_i$ cannot be a prefix of the next factor
$m_{i+1}$. The last property we prove shows that if two words share a common
overlap, then their Lyndon factorizations can be used to capture the common
overlap of the two words.
  The above results open to the study of new applications of Lyndon words and
inverse Lyndon words in the field of string comparison.
","[{'version': 'v1', 'created': 'Sat, 2 Nov 2019 14:56:53 GMT'}]",2020-11-24,"[['Bonizzoni', 'Paola', ''], ['De Felice', 'Clelia', ''], ['Zaccagnino', 'Rocco', ''], ['Zizza', 'Rosalba', '']]","['Lyndon words', 'Lyndon factorization', 'Combinatorial algorithms on words']"
9485,2208.03302,Johan Lin{\aa}ker,"Johan Lin{\aa}ker, Bj\""orn Regnell, Daniela Damian","A Community Strategy Framework -- How to obtain Influence on
  Requirements in Meritocratic Open Source Software Communities?",,,10.1016/j.infsof.2019.04.010,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Context: In the Requirements Engineering (RE) process of an Open Source
Software (OSS) community, an involved firm is a stakeholder among many.
Conflicting agendas may create miss-alignment with the firm's internal
requirements strategy. In communities with meritocratic governance or with
aspects thereof, a firm has the opportunity to affect the RE process in line
with their own agenda by gaining influence through active and symbiotic
engagements.
  Objective: The focus of this study has been to identify what aspects that
firms should consider when they assess their need of influencing the RE process
in an OSS community, as well as what engagement practices that should be
considered in order to gain this influence.
  Method: Using a design science approach, 21 interviews with 18 industry
professionals from 12 different software-intensive firms were conducted to
explore, design and validate an artifact for the problem context.
  Results: A Community Strategy Framework (CSF) is presented to help firms
create community strategies that describe if and why they need influence on the
RE process in a specific (meritocratic) OSS community, and how the firm could
gain it. The framework consists of aspects and engagement practices. The
aspects help determine how important an OSS project and its community is from
business and technical perspectives. A community perspective is used when
considering the feasibility and potential in gaining influence. The engagement
practices are intended as a tool-box for how a firm can engage with a community
in order to build influence needed.
  Conclusion: It is concluded from interview-based validation that the proposed
CSF may provide support for firms in creating and tailoring community
strategies and help them to focus resources on communities that matter and gain
the influence needed on their respective RE processes.
","[{'version': 'v1', 'created': 'Fri, 29 Jul 2022 20:21:39 GMT'}]",2022-08-08,"[['Linåker', 'Johan', ''], ['Regnell', 'Björn', ''], ['Damian', 'Daniela', '']]","['Open Innovation', 'Open Source Software', 'Software Ecosystem', 'Community Strategy', 'Requirements Engineering', 'Product Management']"
9486,2108.11259,Ken Jen Lee,"Jessy Ceha, Ken Jen Lee, Elizabeth Nilsen, Joslin Goh and Edith Law","Can a Humorous Conversational Agent Enhance Learning Experience and
  Outcomes?","14 pages, 4 figures, ACM CHI 2021","CHI Conference on Human Factors in Computing Systems (2021), 14
  pages",10.1145/3411764.3445068,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Previous studies have highlighted the benefits of pedagogical conversational
agents using socially-oriented conversation with students. In this work, we
examine the effects of a conversational agent's use of affiliative and
self-defeating humour -- considered conducive to social well-being and
enhancing interpersonal relationships -- on learners' perception of the agent
and attitudes towards the task. Using a between-subjects protocol, 58
participants taught a conversational agent about rock classification using a
learning-by-teaching platform, the Curiosity Notebook. While all agents were
curious and enthusiastic, the style of humour was manipulated such that the
agent either expressed an affiliative style, a self-defeating style, or no
humour. Results demonstrate that affiliative humour can significantly increase
motivation and effort, while self-defeating humour, although enhancing effort,
negatively impacts enjoyment. Findings further highlight the importance of
understanding learner characteristics when using humour.
","[{'version': 'v1', 'created': 'Wed, 25 Aug 2021 14:34:23 GMT'}]",2021-08-26,"[['Ceha', 'Jessy', ''], ['Lee', 'Ken Jen', ''], ['Nilsen', 'Elizabeth', ''], ['Goh', 'Joslin', ''], ['Law', 'Edith', '']]","['Conversational Agent', 'Education', 'Motivation', 'Learning Experience', 'Learning Outcomes', 'Humour']"
9487,2109.05778,Haolan Zhan,"Lei Shen, Haolan Zhan, Xin Shen, Yonghao Song and Xiaofang Zhao","Text is NOT Enough: Integrating Visual Impressions into Open-domain
  Dialogue Generation",Accepted by ACM MultiMedia 2021,,10.1145/1122445.1122456,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Open-domain dialogue generation in natural language processing (NLP) is by
default a pure-language task, which aims to satisfy human need for daily
communication on open-ended topics by producing related and informative
responses. In this paper, we point out that hidden images, named as visual
impressions (VIs), can be explored from the text-only data to enhance dialogue
understanding and help generate better responses. Besides, the semantic
dependency between an dialogue post and its response is complicated, e.g., few
word alignments and some topic transitions. Therefore, the visual impressions
of them are not shared, and it is more reasonable to integrate the response
visual impressions (RVIs) into the decoder, rather than the post visual
impressions (PVIs). However, both the response and its RVIs are not given
directly in the test process. To handle the above issues, we propose a
framework to explicitly construct VIs based on pure-language dialogue datasets
and utilize them for better dialogue understanding and generation.
Specifically, we obtain a group of images (PVIs) for each post based on a
pre-trained word-image mapping model. These PVIs are used in a co-attention
encoder to get a post representation with both visual and textual information.
Since the RVIs are not provided directly during testing, we design a cascade
decoder that consists of two sub-decoders. The first sub-decoder predicts the
content words in response, and applies the word-image mapping model to get
those RVIs. Then, the second sub-decoder generates the response based on the
post and RVIs. Experimental results on two open-domain dialogue datasets show
that our proposed approach achieves superior performance over competitive
baselines.
","[{'version': 'v1', 'created': 'Mon, 13 Sep 2021 08:57:13 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Sep 2021 07:36:20 GMT'}]",2021-09-21,"[['Shen', 'Lei', ''], ['Zhan', 'Haolan', ''], ['Shen', 'Xin', ''], ['Song', 'Yonghao', ''], ['Zhao', 'Xiaofang', '']]","['open-domain dialogue', 'visual impressions', 'dialogue generation']"
9488,2301.02336,Vinitha Ranganeni,"Vinitha Ranganeni, Mike Sinclair, Eyal Ofek, Amos Miller, Jonathan
  Campbell, Andrey Kolobov, Edward Cutrell","Exploring Levels of Control for a Navigation Assistant for Blind
  Travelers","9 pages, 6 figures, Human-Robot Interaction 2023",,10.1145/3568162.3578630,,cs.RO cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Only a small percentage of blind and low-vision people use traditional
mobility aids such as a cane or a guide dog. Various assistive technologies
have been proposed to address the limitations of traditional mobility aids.
These devices often give either the user or the device majority of the control.
In this work, we explore how varying levels of control affect the users' sense
of agency, trust in the device, confidence, and successful navigation. We
present Glide, a novel mobility aid with two modes for control: Glide-directed
and User-directed. We employ Glide in a study (N=9) in which blind or
low-vision participants used both modes to navigate through an indoor
environment. Overall, participants found that Glide was easy to use and learn.
Most participants trusted Glide despite its current limitations, and their
confidence and performance increased as they continued to use Glide. Users'
control mode preference varied in different situations; no single mode ""won"" in
all situations.
","[{'version': 'v1', 'created': 'Thu, 5 Jan 2023 23:55:49 GMT'}]",2023-01-09,"[['Ranganeni', 'Vinitha', ''], ['Sinclair', 'Mike', ''], ['Ofek', 'Eyal', ''], ['Miller', 'Amos', ''], ['Campbell', 'Jonathan', ''], ['Kolobov', 'Andrey', ''], ['Cutrell', 'Edward', '']]","['assistive navigation', 'robotics', 'user study']"
9489,2206.00242,Yunshan Ma,"Yunshan Ma, Yingzhi He, An Zhang, Xiang Wang, Tat-Seng Chua",CrossCBR: Cross-view Contrastive Learning for Bundle Recommendation,"9 pages, 5 figures, 5 tables; this the 3rd version that fixes a typo
  in table 1",KDD 2022,10.1145/3534678.3539229,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Bundle recommendation aims to recommend a bundle of related items to users,
which can satisfy the users' various needs with one-stop convenience. Recent
methods usually take advantage of both user-bundle and user-item interactions
information to obtain informative representations for users and bundles,
corresponding to bundle view and item view, respectively. However, they either
use a unified view without differentiation or loosely combine the predictions
of two separate views, while the crucial cooperative association between the
two views' representations is overlooked. In this work, we propose to model the
cooperative association between the two different views through cross-view
contrastive learning. By encouraging the alignment of the two separately
learned views, each view can distill complementary information from the other
view, achieving mutual enhancement. Moreover, by enlarging the dispersion of
different users/bundles, the self-discrimination of representations is
enhanced. Extensive experiments on three public datasets demonstrate that our
method outperforms SOTA baselines by a large margin. Meanwhile, our method
requires minimal parameters of three set of embeddings (user, bundle, and item)
and the computational costs are largely reduced due to more concise graph
structure and graph learning module. In addition, various ablation and model
studies demystify the working mechanism and justify our hypothesis. Codes and
datasets are available at https://github.com/mysbupt/CrossCBR.
","[{'version': 'v1', 'created': 'Wed, 1 Jun 2022 05:51:38 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Jun 2022 10:17:37 GMT'}, {'version': 'v3', 'created': 'Wed, 8 Jun 2022 09:28:34 GMT'}, {'version': 'v4', 'created': 'Wed, 29 Jun 2022 03:27:07 GMT'}, {'version': 'v5', 'created': 'Sun, 15 Jan 2023 16:50:48 GMT'}]",2023-01-18,"[['Ma', 'Yunshan', ''], ['He', 'Yingzhi', ''], ['Zhang', 'An', ''], ['Wang', 'Xiang', ''], ['Chua', 'Tat-Seng', '']]","['Bundle Recommendation', 'Contrastive Learning', 'Graph Neural Network']"
9490,1708.05377,Michele Boreale,Michele Boreale,"Complete algorithms for algebraic strongest postconditions and weakest
  preconditions in polynomial ODEs",19 pages,Science of Computer Programming 193 (2020) 102441,10.1016/j.scico.2020.102441,DISIA WORKING PAPER 2018/03,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A system of polynomial ordinary differential equations (ODEs) is specified
via a vector of multivariate polynomials, or vector field, $F$. A safety
assertion $\psi\rightarrow[F]\phi$ means that the trajectory of the system will
lie in a subset $\phi$ (the postcondition) of the state-space, whenever the
initial state belongs to a subset $\psi$ (the precondition). We consider the
case when $\phi$ and $\psi$ are algebraic varieties, that is, zero sets of
polynomials. In particular, polynomials specifying the postcondition can be
seen as a system's conservation laws implied by $\psi$. Checking the validity
of algebraic safety assertions is a fundamental problem in, for instance,
hybrid systems. We consider a generalized version of this problem, and offer an
algorithm that, given a user specified polynomial set $P$ and an algebraic
precondition $\psi$, finds the largest subset of polynomials in $P$ implied by
$\psi$ (relativized strongest postcondition). Under certain assumptions on
$\phi$, this algorithm can also be used to find the largest algebraic invariant
included in $\phi$ and the weakest algebraic precondition for $\phi$.
Applications to continuous semialgebraic systems are also considered. The
effectiveness of the proposed algorithm is demonstrated on several case studies
from the literature.
","[{'version': 'v1', 'created': 'Thu, 17 Aug 2017 17:48:40 GMT'}, {'version': 'v2', 'created': 'Sun, 29 Mar 2020 17:46:53 GMT'}]",2020-03-31,"[['Boreale', 'Michele', '']]","['Ordinary differential equations', 'postconditions', 'preconditions', 'invariants', 'Gröbner bases']"
9491,2203.15979,Jerin Yasmin,"Jerin Yasmin, Mohammad Sadegh Sheikhaei, Yuan Tian","A First Look at Duplicate and Near-duplicate Self-admitted Technical
  Debt Comments",4 +1 pages,,10.1145/3524610.3528387,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-admitted technical debt (SATD) refers to technical debt that is
intentionally introduced by developers and explicitly documented in code
comments or other software artifacts (e.g., issue reports) to annotate
sub-optimal decisions made by developers in the software development process.
  In this work, we take the first look at the existence and characteristics of
duplicate and near-duplicate SATD comments in five popular Apache OSS projects,
i.e., JSPWiki, Helix, Jackrabbit, Archiva, and SystemML. We design a method to
automatically identify groups of duplicate and near-duplicate SATD comments and
track their evolution in the software system by mining the commit history of a
software project. Leveraging the proposed method, we identified 3,520 duplicate
and near-duplicate SATD comments from the target projects, which belong to
1,141 groups. We manually analyze the content and context of a sample of 1,505
SATD comments (by sampling 100 groups for each project) and identify if they
annotate the same root cause. We also investigate whether duplicate SATD
comments exist in code clones, whether they co-exist in the same file, and
whether they are introduced and removed simultaneously. Our preliminary study
reveals several surprising findings that would shed light on future studies
aiming to improve the management of duplicate SATD comments. For instance, only
48.5% duplicate SATD comment groups with the same root cause exist in regular
code clones, and only 33.9% of the duplicate SATD comment pairs are introduced
in the same commit.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2022 01:36:18 GMT'}]",2022-03-31,"[['Yasmin', 'Jerin', ''], ['Sheikhaei', 'Mohammad Sadegh', ''], ['Tian', 'Yuan', '']]","['Self-admitted technical debt (SATD)', 'Apache', 'OSS', 'duplicate comments', 'documentation']"
9492,1806.04599,Kumar Vijay Mishra,"Fabio Giovanneschi, Kumar Vijay Mishra, Maria Antonia Gonzalez-Huici,
  Yonina C. Eldar and Joachim H. G. Ender",Dictionary Learning for Adaptive GPR Landmine Classification,"16 pages, 11 figures, 10 tables",,10.1109/TGRS.2019.2931134,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ground penetrating radar (GPR) target detection and classification is a
challenging task. Here, we consider online dictionary learning (DL) methods to
obtain sparse representations (SR) of the GPR data to enhance feature
extraction for target classification via support vector machines. Online
methods are preferred because traditional batch DL like K-SVD is not scalable
to high-dimensional training sets and infeasible for real-time operation. We
also develop Drop-Off MINi-batch Online Dictionary Learning (DOMINODL) which
exploits the fact that a lot of the training data may be correlated. The
DOMINODL algorithm iteratively considers elements of the training set in small
batches and drops off samples which become less relevant. For the case of
abandoned anti-personnel landmines classification, we compare the performance
of K-SVD with three online algorithms: classical Online Dictionary Learning,
its correlation-based variant, and DOMINODL. Our experiments with real data
from L-band GPR show that online DL methods reduce learning time by 36-93% and
increase mine detection by 4-28% over K-SVD. Our DOMINODL is the fastest and
retains similar classification performance as the other two online DL
approaches. We use a Kolmogorov-Smirnoff test distance and the
Dvoretzky-Kiefer-Wolfowitz inequality for the selection of DL input parameters
leading to enhanced classification results. To further compare with
state-of-the-art classification approaches, we evaluate a convolutional neural
network (CNN) classifier which performs worse than the proposed approach.
Moreover, when the acquired samples are randomly reduced by 25%, 50% and 75%,
sparse decomposition based classification with DL remains robust while the CNN
accuracy is drastically compromised.
","[{'version': 'v1', 'created': 'Thu, 24 May 2018 14:42:42 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Jun 2019 10:08:05 GMT'}]",2020-01-08,"[['Giovanneschi', 'Fabio', ''], ['Mishra', 'Kumar Vijay', ''], ['Gonzalez-Huici', 'Maria Antonia', ''], ['Eldar', 'Yonina C.', ''], ['Ender', 'Joachim H. G.', '']]","['ground penetrating radar', 'online dictionary learning', 'adaptiveradar', 'deep learning', 'radar target classification', 'sparse decomposition']"
9493,2109.03487,Joseba Fernandez De Landa,J. Fernandez de Landa and R. Agerri,Social Analysis of Young Basque Speaking Communities in Twitter,,Journal of Multilingual and Multicultural Development (2021),10.1080/01434632.2021.1962331,,cs.CY cs.CL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this paper we take into account both social and linguistic aspects to
perform demographic analysis by processing a large amount of tweets in Basque
language. The study of demographic characteristics and social relationships are
approached by applying machine learning and modern deep-learning Natural
Language Processing (NLP) techniques, combining social sciences with automatic
text processing. More specifically, our main objective is to combine
demographic inference and social analysis in order to detect young Basque
Twitter users and to identify the communities that arise from their
relationships or shared content. This social and demographic analysis will be
entirely based on the~automatically collected tweets using NLP to convert
unstructured textual information into interpretable knowledge.
","[{'version': 'v1', 'created': 'Wed, 8 Sep 2021 08:19:08 GMT'}]",2021-09-09,"[['de Landa', 'J. Fernandez', ''], ['Agerri', 'R.', '']]","['Computational Social Science', 'Cultural Analytics', 'Natural Language Processing', 'Basque language', 'Demographic Analysis', 'Social media']"
9494,2012.03619,Satya Almasian,"Dennis Aumiller, Satya Almasian, Sebastian Lackner and Michael Gertz",Structural Text Segmentation of Legal Documents,,,10.1145/3462757.3466085,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  The growing complexity of legal cases has lead to an increasing interest in
legal information retrieval systems that can effectively satisfy user-specific
information needs. However, such downstream systems typically require documents
to be properly formatted and segmented, which is often done with relatively
simple pre-processing steps, disregarding topical coherence of segments.
Systems generally rely on representations of individual sentences or
paragraphs, which may lack crucial context, or document-level representations,
which are too long for meaningful search results. To address this issue, we
propose a segmentation system that can predict topical coherence of sequential
text segments spanning several paragraphs, effectively segmenting a document
and providing a more balanced representation for downstream applications. We
build our model on top of popular transformer networks and formulate structural
text segmentation as topical change detection, by performing a series of
independent classifications that allow for efficient fine-tuning on
task-specific data. We crawl a novel dataset consisting of roughly $74,000$
online Terms-of-Service documents, including hierarchical topic annotations,
which we use for training. Results show that our proposed system significantly
outperforms baselines, and adapts well to structural peculiarities of legal
documents. We release both data and trained models to the research community
for future work.https://github.com/dennlinger/TopicalChange
","[{'version': 'v1', 'created': 'Mon, 7 Dec 2020 12:09:37 GMT'}, {'version': 'v2', 'created': 'Mon, 17 May 2021 11:38:28 GMT'}]",2021-05-18,"[['Aumiller', 'Dennis', ''], ['Almasian', 'Satya', ''], ['Lackner', 'Sebastian', ''], ['Gertz', 'Michael', '']]","['Document Understanding', 'Outline Generation', 'Text Segmentation']"
9495,2109.11519,Marco Grassia,"Marco Grassia, Giuseppe Mangioni",wsGAT: Weighted and Signed Graph Attention Networks for Link Prediction,,,10.1007/978-3-030-93409-5_31,,cs.SI cs.LG physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph Neural Networks (GNNs) have been widely used to learn representations
on graphs and tackle many real-world problems from a wide range of domains. In
this paper we propose wsGAT, an extension of the Graph Attention Network (GAT)
layers, meant to address the lack of GNNs that can handle graphs with signed
and weighted links, which are ubiquitous, for instance, in trust and
correlation networks. We first evaluate the performance of our proposal by
comparing against GCNII in the weighed link prediction task, and against SGCN
in the link sign prediction task. After that, we combine the two tasks and show
their performance on predicting the signed weight of links, and their
existence. Our results on real-world networks show that models with wsGAT
layers outperform the ones with GCNII and SGCN layers, and that there is no
loss in performance when signed weights are predicted.
","[{'version': 'v1', 'created': 'Tue, 21 Sep 2021 12:07:51 GMT'}]",2022-02-01,"[['Grassia', 'Marco', ''], ['Mangioni', 'Giuseppe', '']]","['network science', 'link prediction', 'geometric deep learning', 'geometric representation learning', 'graph neural networks']"
9496,2107.12428,Seba Susan,"Sunakshi Mehra, Seba Susan","Improving Word Recognition in Speech Transcriptions by Decision-level
  Fusion of Stemming and Two-way Phoneme Pruning",Accepted in International Advanced Computing Conference (2020),,10.1007/978-981-16-0401-0_19,,cs.CL cs.SD eess.AS,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We introduce an unsupervised approach for correcting highly imperfect speech
transcriptions based on a decision-level fusion of stemming and two-way phoneme
pruning. Transcripts are acquired from videos by extracting audio using Ffmpeg
framework and further converting audio to text transcript using Google API. In
the benchmark LRW dataset, there are 500 word categories, and 50 videos per
class in mp4 format. All videos consist of 29 frames (each 1.16 s long) and the
word appears in the middle of the video. In our approach we tried to improve
the baseline accuracy from 9.34% by using stemming, phoneme extraction,
filtering and pruning. After applying the stemming algorithm to the text
transcript and evaluating the results, we achieved 23.34% accuracy in word
recognition. To convert words to phonemes we used the Carnegie Mellon
University (CMU) pronouncing dictionary that provides a phonetic mapping of
English words to their pronunciations. A two-way phoneme pruning is proposed
that comprises of the two non-sequential steps: 1) filtering and pruning the
phonemes containing vowels and plosives 2) filtering and pruning the phonemes
containing vowels and fricatives. After obtaining results of stemming and
two-way phoneme pruning, we applied decision-level fusion and that led to an
improvement of word recognition rate upto 32.96%.
","[{'version': 'v1', 'created': 'Mon, 26 Jul 2021 18:44:24 GMT'}]",2021-07-28,"[['Mehra', 'Sunakshi', ''], ['Susan', 'Seba', '']]","['Stemming', 'Phoneme filtering', 'Phoneme Selection', 'Decision Fusion']"
9497,1906.09735,Victor Coscrato,"Victor Coscrato, Marco Henrique de Almeida In\'acio, Rafael Izbicki","The NN-Stacking: Feature weighted linear stacking through neural
  networks",,,10.1016/j.neucom.2020.02.073,,cs.LG stat.ME stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stacking methods improve the prediction performance of regression models. A
simple way to stack base regressions estimators is by combining them linearly,
as done by \citet{breiman1996stacked}. Even though this approach is useful from
an interpretative perspective, it often does not lead to high predictive power.
We propose the NN-Stacking method (NNS), which generalizes Breiman's method by
allowing the linear parameters to vary with input features. This improvement
enables NNS to take advantage of the fact that distinct base models often
perform better at different regions of the feature space. Our method uses
neural networks to estimate the stacking coefficients. We show that while our
approach keeps the interpretative features of Breiman's method at a local
level, it leads to better predictive power, especially in datasets with large
sample sizes.
","[{'version': 'v1', 'created': 'Mon, 24 Jun 2019 05:46:07 GMT'}]",2020-02-26,"[['Coscrato', 'Victor', ''], ['Inácio', 'Marco Henrique de Almeida', ''], ['Izbicki', 'Rafael', '']]","['meta-learning', 'neural networks', 'model stacking', 'model selection']"
9498,1911.07805,Shokooh Taghian,"Shokooh Taghian, Mohammad H. Nadimi-Shahraki",Binary Sine Cosine Algorithms for Feature Selection from Medical Data,,,10.5121/acij.2019.10501,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A well-constructed classification model highly depends on input feature
subsets from a dataset, which may contain redundant, irrelevant, or noisy
features. This challenge can be worse while dealing with medical datasets. The
main aim of feature selection as a pre-processing task is to eliminate these
features and select the most effective ones. In the literature, metaheuristic
algorithms show a successful performance to find optimal feature subsets. In
this paper, two binary metaheuristic algorithms named S-shaped binary Sine
Cosine Algorithm (SBSCA) and V-shaped binary Sine Cosine Algorithm (VBSCA) are
proposed for feature selection from the medical data. In these algorithms, the
search space remains continuous, while a binary position vector is generated by
two transfer functions S-shaped and V-shaped for each solution. The proposed
algorithms are compared with four latest binary optimization algorithms over
five medical datasets from the UCI repository. The experimental results confirm
that using both bSCA variants enhance the accuracy of classification on these
medical datasets compared to four other algorithms.
","[{'version': 'v1', 'created': 'Fri, 15 Nov 2019 12:57:09 GMT'}]",2019-11-19,"[['Taghian', 'Shokooh', ''], ['Nadimi-Shahraki', 'Mohammad H.', '']]","['Medical data', 'Feature selection', 'metaheuristic algorithm', 'Sine Cosine Algorithm', 'Transfer function.  1']"
9499,1712.03747,Jose Bernal Moyano,"Jose Bernal, Kaisar Kushibar, Daniel S. Asfaw, Sergi Valverde, Arnau
  Oliver, Robert Mart\'i, Xavier Llad\'o","Deep convolutional neural networks for brain image analysis on magnetic
  resonance imaging: a review",,,10.1016/j.artmed.2018.08.008,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, deep convolutional neural networks (CNNs) have shown
record-shattering performance in a variety of computer vision problems, such as
visual object recognition, detection and segmentation. These methods have also
been utilised in medical image analysis domain for lesion segmentation,
anatomical segmentation and classification. We present an extensive literature
review of CNN techniques applied in brain magnetic resonance imaging (MRI)
analysis, focusing on the architectures, pre-processing, data-preparation and
post-processing strategies available in these works. The aim of this study is
three-fold. Our primary goal is to report how different CNN architectures have
evolved, discuss state-of-the-art strategies, condense their results obtained
using public datasets and examine their pros and cons. Second, this paper is
intended to be a detailed reference of the research activity in deep CNN for
brain MRI analysis. Finally, we present a perspective on the future of CNNs in
which we hint some of the research directions in subsequent years.
","[{'version': 'v1', 'created': 'Mon, 11 Dec 2017 12:25:30 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Dec 2017 12:15:51 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Jun 2018 16:47:32 GMT'}]",2019-07-30,"[['Bernal', 'Jose', ''], ['Kushibar', 'Kaisar', ''], ['Asfaw', 'Daniel S.', ''], ['Valverde', 'Sergi', ''], ['Oliver', 'Arnau', ''], ['Martí', 'Robert', ''], ['Lladó', 'Xavier', '']]","['Deep convolutional neural network', 'brain MRI', 'segmentation', 'review']"
9500,1904.04479,Tatiana Likhomanenko,"Tatiana Likhomanenko, Gabriel Synnaeve, Ronan Collobert",Who Needs Words? Lexicon-Free Speech Recognition,"8 pages, 1 figure",Proc. Interspeech 2019,10.21437/Interspeech.2019-3107,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lexicon-free speech recognition naturally deals with the problem of
out-of-vocabulary (OOV) words. In this paper, we show that character-based
language models (LM) can perform as well as word-based LMs for speech
recognition, in word error rates (WER), even without restricting the decoding
to a lexicon. We study character-based LMs and show that convolutional LMs can
effectively leverage large (character) contexts, which is key for good speech
recognition performance downstream. We specifically show that the lexicon-free
decoding performance (WER) on utterances with OOV words using character-based
LMs is better than lexicon-based decoding, both with character or word-based
LMs.
","[{'version': 'v1', 'created': 'Tue, 9 Apr 2019 06:06:54 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Jul 2019 19:35:52 GMT'}, {'version': 'v3', 'created': 'Fri, 5 Jul 2019 20:35:52 GMT'}, {'version': 'v4', 'created': 'Fri, 13 Sep 2019 15:13:24 GMT'}]",2019-09-25,"[['Likhomanenko', 'Tatiana', ''], ['Synnaeve', 'Gabriel', ''], ['Collobert', 'Ronan', '']]","['speech recognition', 'beam-search decoder', 'out-of-vocabulary words', 'lexicon-free']"
9501,1709.09929,Milad Zafar Nezhad,"Milad Zafar Nezhad, Dongxiao Zhu, Najibesadat Sadati, Kai Yang,
  Phillip Levy",SUBIC: A Supervised Bi-Clustering Approach for Precision Medicine,,,10.1109/ICMLA.2017.00-68,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional medicine typically applies one-size-fits-all treatment for the
entire patient population whereas precision medicine develops tailored
treatment schemes for different patient subgroups. The fact that some factors
may be more significant for a specific patient subgroup motivates clinicians
and medical researchers to develop new approaches to subgroup detection and
analysis, which is an effective strategy to personalize treatment. In this
study, we propose a novel patient subgroup detection method, called Supervised
Biclustring (SUBIC) using convex optimization and apply our approach to detect
patient subgroups and prioritize risk factors for hypertension (HTN) in a
vulnerable demographic subgroup (African-American). Our approach not only finds
patient subgroups with guidance of a clinically relevant target variable but
also identifies and prioritizes risk factors by pursuing sparsity of the input
variables and encouraging similarity among the input variables and between the
input and target variables
","[{'version': 'v1', 'created': 'Tue, 26 Sep 2017 22:21:46 GMT'}]",2018-01-29,"[['Nezhad', 'Milad Zafar', ''], ['Zhu', 'Dongxiao', ''], ['Sadati', 'Najibesadat', ''], ['Yang', 'Kai', ''], ['Levy', 'Phillip', '']]","['Precision medicine; subgroup identification', 'biclustering', 'regularized regression', 'cardiovascular disease']"
9502,2110.04478,Saeed Rashidi,"Saeed Rashidi, William Won, Sudarshan Srinivasan, Srinivas Sridharan,
  Tushar Krishna","Themis: A Network Bandwidth-Aware Collective Scheduling Policy for
  Distributed Training of DL Models",,,10.1145/3470496.3527382,,cs.DC cs.AR cs.LG cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed training is a solution to reduce DNN training time by splitting
the task across multiple NPUs (e.g., GPU/TPU). However, distributed training
adds communication overhead between the NPUs in order to synchronize the
gradients and/or activation, depending on the parallelization strategy. In
next-generation platforms for training at scale, NPUs will be connected through
multi-dimensional networks with diverse, heterogeneous bandwidths. This work
identifies a looming challenge of keeping all network dimensions busy and
maximizing the network BW within the hybrid environment if we leverage
scheduling techniques for collective communication on systems today. We propose
Themis, a novel collective scheduling scheme that dynamically schedules
collectives (divided into chunks) to balance the communication loads across all
dimensions, further improving the network BW utilization. Our results show that
on average, Themis can improve the network BW utilization of the single
All-Reduce by 1.72X (2.70X max), and improve the end-to-end training iteration
performance of real workloads such as ResNet-152, GNMT, DLRM, and
Transformer-1T by 1.49X (2.25X max), 1.30X (1.78X max), 1.30X (1.77X max), and
1.25X (1.53X max), respectively.
","[{'version': 'v1', 'created': 'Sat, 9 Oct 2021 06:50:04 GMT'}, {'version': 'v2', 'created': 'Wed, 4 May 2022 00:46:03 GMT'}, {'version': 'v3', 'created': 'Thu, 7 Jul 2022 04:20:56 GMT'}]",2022-07-08,"[['Rashidi', 'Saeed', ''], ['Won', 'William', ''], ['Srinivasan', 'Sudarshan', ''], ['Sridharan', 'Srinivas', ''], ['Krishna', 'Tushar', '']]","['distributed training', 'collective communication', 'bandwidth-awarecommunication scheduling']"
9503,2106.12322,Louis Esperet,"Louis Esperet, S\'ebastien Julliot, Arnaud de Mesmay",Distributed coloring and the local structure of unit-disk graphs,"25 pages, corrects a mistake in the proceedings version of the paper.
  A preliminary version of this work appeared in the proceedings of the 17th
  International Symposium on Algorithms and Experiments for Wireless Sensor
  Networks (ALGOSENSORS 2021)","Theoretical Computer Science 944 (2023), 113674",10.1016/j.tcs.2022.12.024,,cs.DC cs.CG math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Coloring unit-disk graphs efficiently is an important problem in the global
and distributed setting, with applications in radio channel assignment problems
when the communication relies on omni-directional antennas of the same power.
In this context it is important to bound not only the complexity of the
coloring algorithms, but also the number of colors used. In this paper, we
consider two natural distributed settings. In the location-aware setting (when
nodes know their coordinates in the plane), we give a constant time distributed
algorithm coloring any unit-disk graph $G$ with at most $4\omega(G)$ colors,
where $\omega(G)$ is the clique number of $G$. This improves upon a classical
3-approximation algorithm for this problem, for all unit-disk graphs whose
chromatic number significantly exceeds their clique number. When nodes do not
know their coordinates in the plane, we give a distributed algorithm in the
LOCAL model that colors every unit-disk graph $G$ with at most
$5.68\omega(G)+1$ colors in $O(\log^* n)$ rounds. This algorithm is based on a
study of the local structure of unit-disk graphs, which is of independent
interest. We conjecture that every unit-disk graph $G$ has average degree at
most $4\omega(G)$, which would imply the existence of a $O(\log n)$ round
algorithm coloring any unit-disk graph $G$ with (approximately) $4\omega(G)$
colors in the LOCAL model. We provide partial results towards this conjecture
using Fourier-analytical tools.
","[{'version': 'v1', 'created': 'Wed, 23 Jun 2021 11:36:41 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Sep 2021 09:16:03 GMT'}, {'version': 'v3', 'created': 'Fri, 24 Sep 2021 09:28:32 GMT'}, {'version': 'v4', 'created': 'Mon, 13 Dec 2021 09:04:08 GMT'}, {'version': 'v5', 'created': 'Fri, 9 Sep 2022 13:58:54 GMT'}, {'version': 'v6', 'created': 'Tue, 13 Dec 2022 16:51:03 GMT'}]",2023-01-23,"[['Esperet', 'Louis', ''], ['Julliot', 'Sébastien', ''], ['de Mesmay', 'Arnaud', '']]","['Unit-disk graphs', 'distributed coloring', 'average degree']"
9504,2209.03190,Olivier Pantal\'e,Olivier Pantal\'e and Pierre Tize Mha and Am\`evi Tongne,"Efficient Implementation of Non-linear Flow Law Using Neural Network
  into the Abaqus Explicit FEM code",,"Finite Elements in Analysis and Design, Volume 198, 2022",10.1016/j.finel.2021.103647,,cs.CE cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Machine learning techniques are increasingly used to predict material
behavior in scientific applications and offer a significant advantage over
conventional numerical methods. In this work, an Artificial Neural Network
(ANN) model is used in a finite element formulation to define the flow law of a
metallic material as a function of plastic strain, plastic strain rate and
temperature. First, we present the general structure of the neural network, its
operation and focus on the ability of the network to deduce, without prior
learning, the derivatives of the flow law with respect to the model inputs. In
order to validate the robustness and accuracy of the proposed model, we compare
and analyze the performance of several network architectures with respect to
the analytical formulation of a Johnson-Cook behavior law for a 42CrMo4 steel.
In a second part, after having selected an Artificial Neural Network
architecture with $2$ hidden layers, we present the implementation of this
model in the Abaqus Explicit computational code in the form of a VUHARD
subroutine. The predictive capability of the proposed model is then
demonstrated during the numerical simulation of two test cases: the necking of
a circular bar and a Taylor impact test. The results obtained show a very high
capability of the ANN to replace the analytical formulation of a Johnson-Cook
behavior law in a finite element code, while remaining competitive in terms of
numerical simulation time compared to a classical approach.
","[{'version': 'v1', 'created': 'Wed, 7 Sep 2022 14:37:09 GMT'}]",2022-09-08,"[['Pantalé', 'Olivier', ''], ['Mha', 'Pierre Tize', ''], ['Tongne', 'Amèvi', '']]","['Artificial Neural Network', 'Constitutive Behavior', 'Finite Element Method', 'Numerical Implementation', 'Johnson-Cook flow law']"
9505,1306.6852,Matteo Brunelli,Matteo Brunelli and Michele Fedrizzi,Axiomatic properties of inconsistency indices for pairwise comparisons,"25 pages, 3 figures","Journal of the Operational Research Society, 66(1), 1-15, (2015)",10.1057/jors.2013.135,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pairwise comparisons are a well-known method for the representation of the
subjective preferences of a decision maker. Evaluating their inconsistency has
been a widely studied and discussed topic and several indices have been
proposed in the literature to perform this task. Since an acceptable level of
consistency is closely related with the reliability of preferences, a suitable
choice of an inconsistency index is a crucial phase in decision making
processes. The use of different methods for measuring consistency must be
carefully evaluated, as it can affect the decision outcome in practical
applications. In this paper, we present five axioms aimed at characterizing
inconsistency indices. In addition, we prove that some of the indices proposed
in the literature satisfy these axioms, while others do not, and therefore, in
our view, they may fail to correctly evaluate inconsistency.
","[{'version': 'v1', 'created': 'Fri, 28 Jun 2013 14:27:03 GMT'}]",2014-12-25,"[['Brunelli', 'Matteo', ''], ['Fedrizzi', 'Michele', '']]","['Pairwise comparisons', 'inconsistency indices', 'axiomatic properties', 'analytic hierarchy pro']"
9506,1601.06449,Katina Kralevska,"Danilo Gligoroski, Katina Kralevska, Harald Oeverby",Minimal Header Overhead for Random Linear Network Coding,"IEEE International Conference on Communication Workshop (ICCW), 2015","Published in 2015 IEEE International Conference on Communication
  Workshop (ICCW)",10.1109/ICCW.2015.7247260,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The energy used to transmit a single bit of data between the devices in
wireless networks is equal to the energy for performing hundreds of
instructions in those devices. Thus the reduction of the data necessary to
transmit, while keeping the same functionality of the employed algorithms is a
formidable and challenging scientific task. We describe an algorithm called
Small Set of Allowed Coefficients (SSAC) that produces the shortest header
overhead in random linear network coding schemes compared with all other
approaches reported in the literature. The header overhead length is 2 to 7
times shorter than the length achieved by related compression techniques. For
example, SSAC algorithm compresses the length of the header overhead in a
generation of 128 packets to 24 bits, while the closest best result achieved by
an algorithm based on error correcting codes has a header overhead length of 84
bits in $GF(16)$ and 224 bits in $GF(256)$. We show that the header length in
SSAC does not depend on the size of the finite field where the operations are
performed, i.e., it just depends on the number of combined packets $m$.
","[{'version': 'v1', 'created': 'Sun, 24 Jan 2016 23:44:59 GMT'}]",2020-02-14,"[['Gligoroski', 'Danilo', ''], ['Kralevska', 'Katina', ''], ['Oeverby', 'Harald', '']]","['Network coding', 'Header overhead', 'Compressedheader overhead']"
9507,2005.10554,Conrad Watt,"Conrad Watt, Christopher Pulte, Anton Podkopaev, Guillaume Barbier,
  Stephen Dolan, Shaked Flur, Jean Pichon-Pharabod, Shu-yu Guo",Repairing and Mechanising the JavaScript Relaxed Memory Model,"16 pages, 13 figiures",,10.1145/3385412.3385973,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern JavaScript includes the SharedArrayBuffer feature, which provides
access to true shared memory concurrency. SharedArrayBuffers are simple linear
buffers of bytes, and the JavaScript specification defines an axiomatic relaxed
memory model to describe their behaviour. While this model is heavily based on
the C/C++11 model, it diverges in some key areas. JavaScript chooses to give a
well-defined semantics to data-races, unlike the ""undefined behaviour"" of
C/C++11. Moreover, the JavaScript model is mixed-size. This means that its
accesses are not to discrete locations, but to (possibly overlapping) ranges of
bytes.
  We show that the model, in violation of the design intention, does not
support a compilation scheme to ARMv8 which is used in practice. We propose a
correction, which also incorporates a previously proposed fix for a failure of
the model to provide Sequential Consistency of Data-Race-Free programs
(SC-DRF), an important correctness condition. We use model checking, in Alloy,
to generate small counter-examples for these deficiencies, and investigate our
correction. To accomplish this, we also develop a mixed-size extension to the
existing ARMv8 axiomatic model.
  Guided by our Alloy experimentation, we mechanise (in Coq) the JavaScript
model (corrected and uncorrected), our ARMv8 model, and, for the corrected
JavaScript model, a ""model-internal"" SC-DRF proof and a compilation scheme
correctness proof to ARMv8. In addition, we investigate a non-mixed-size subset
of the corrected JavaScript model, and give proofs of compilation correctness
for this subset to x86-TSO, Power, RISC-V, ARMv7, and (again) ARMv8, via the
Intermediate Memory Model (IMM).
  As a result of our work, the JavaScript standards body (ECMA TC39) will
include fixes for both issues in an upcoming edition of the specification.
","[{'version': 'v1', 'created': 'Thu, 21 May 2020 10:27:24 GMT'}, {'version': 'v2', 'created': 'Fri, 22 May 2020 01:37:14 GMT'}]",2020-05-25,"[['Watt', 'Conrad', ''], ['Pulte', 'Christopher', ''], ['Podkopaev', 'Anton', ''], ['Barbier', 'Guillaume', ''], ['Dolan', 'Stephen', ''], ['Flur', 'Shaked', ''], ['Pichon-Pharabod', 'Jean', ''], ['Guo', 'Shu-yu', '']]","['Alloy', 'ARMv8', 'Coq', 'weak memory', 'Web worker']"
9508,1508.04586,Veronica Vilaplana,Ver\'onica Vilaplana,Saliency maps on image hierarchies,"Accepted for publication in Signal Processing: Image Communications,
  2015",,10.1016/j.image.2015.07.012,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose two saliency models for salient object segmentation
based on a hierarchical image segmentation, a tree-like structure that
represents regions at different scales from the details to the whole image
(e.g. gPb-UCM, BPT). The first model is based on a hierarchy of image
partitions. The saliency at each level is computed on a region basis, taking
into account the contrast between regions. The maps obtained for the different
partitions are then integrated into a final saliency map. The second model
directly works on the structure created by the segmentation algorithm,
computing saliency at each node and integrating these cues in a straightforward
manner into a single saliency map. We show that the proposed models produce
high quality saliency maps. Objective evaluation demonstrates that the two
methods achieve state-of-the-art performance in several benchmark datasets.
","[{'version': 'v1', 'created': 'Wed, 19 Aug 2015 10:07:07 GMT'}]",2015-08-20,"[['Vilaplana', 'Verónica', '']]","['region-based saliency map', 'hierarchical segmentation', 'salientobjects']"
9509,2012.01216,Xiao Mao,Xiao Mao,A natural extension to the convex hull problem and a novel solution,"The result is non-original and inferior compared to
  https://dl.acm.org/doi/pdf/10.1145/3188745.3188878",,10.4230/LIPIcs,,cs.CG,http://creativecommons.org/licenses/by/4.0/,"  We study a natural extension to the well-known convex hull problem by
introducing multiplicity: if we are given a set of convex polygons, and we are
allowed to partition the set into multiple components and take the convex hull
of each individual component, what is the minimum total sum of the perimeters
of the convex hulls? We show why this problem is intriguing, and then introduce
a novel algorithm with a run-time cubic in the total number of vertices. In the
case that the input polygons are disjoint, we show an optimization that
achieves a run-time that, in most cases, is cubic in the total number of
polygons, within a logarithmic factor.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2020 13:56:31 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Dec 2020 16:12:59 GMT'}]",2020-12-07,"[['Mao', 'Xiao', '']]","['Convex Hull', 'Optimization Algorithm', 'Convex Geometry', 'Computational Geometry']"
9510,1907.05028,Siwar Jendoubi,"Siwar Jendoubi (LARODEC), Arnaud Martin (DRUID)",Evidential positive opinion influence measures for viral marketing,"Knowledge and Information Systems (KAIS), Springer, 2019",,10.1007/s10115-019-01375-w,,cs.SI cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Viral Marketing is a relatively new form of marketing that exploits
social networks to promote a brand, a product, etc. The idea behind it is to
find a set of influencers on the network that can trigger a large cascade of
propagation and adoptions. In this paper, we will introduce an evidential
opinion-based influence maximization model for viral marketing. Besides, our
approach tackles three opinions based scenarios for viral marketing in the real
world. The first scenario concerns influencers who have a positive opinion
about the product. The second scenario deals with influencers who have a
positive opinion about the product and produce effects on users who also have a
positive opinion. The third scenario involves influence users who have a
positive opinion about the product and produce effects on the negative opinion
of other users concerning the product in question. Next, we proposed six
influence measures, two for each scenario. We also use an influence
maximization model that the set of detected influencers for each scenario.
Finally, we show the performance of the proposed model with each influence
measure through some experiments conducted on a generated dataset and a real
world dataset collected from Twitter.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2019 07:33:27 GMT'}]",2019-07-12,"[['Jendoubi', 'Siwar', '', 'LARODEC'], ['Martin', 'Arnaud', '', 'DRUID']]","['Influence maximization', 'influence measure', 'user opinion', 'theory of']"
9511,2111.14984,Teeratorn Kadeethum,"T. Kadeethum and D. O'Malley and Y. Choi and H. S. Viswanathan and N.
  Bouklas and H. Yoon","Continuous conditional generative adversarial networks for data-driven
  solutions of poroelasticity with heterogeneous material properties",,,10.1016/j.cageo.2022.105212,,cs.CE cs.NA math.NA,http://creativecommons.org/licenses/by/4.0/,"  Machine learning-based data-driven modeling can allow computationally
efficient time-dependent solutions of PDEs, such as those that describe
subsurface multiphysical problems. In this work, our previous approach of
conditional generative adversarial networks (cGAN) developed for the solution
of steady-state problems involving highly heterogeneous material properties is
extended to time-dependent problems by adopting the concept of continuous cGAN
(CcGAN). The CcGAN that can condition continuous variables is developed to
incorporate the time domain through either element-wise addition or conditional
batch normalization. We note that this approach can accommodate other
continuous variables (e.g., Young's modulus) similar to the time domain, which
makes this framework highly flexible and extendable. Moreover, this framework
can handle training data that contain different timestamps and then predict
timestamps that do not exist in the training data. As a numerical example, the
transient response of the coupled poroelastic process is studied in two
different permeability fields: Zinn \& Harvey transformation and a bimodal
transformation. The proposed CcGAN uses heterogeneous permeability fields as
input parameters while pressure and displacement fields over time are model
output. Our results show that the model provides sufficient accuracy with
computational speed-up. This robust framework will enable us to perform
real-time reservoir management and robust uncertainty quantification in
realistic problems.
","[{'version': 'v1', 'created': 'Mon, 29 Nov 2021 21:56:23 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Feb 2022 22:33:38 GMT'}]",2022-08-31,"[['Kadeethum', 'T.', ''], [""O'Malley"", 'D.', ''], ['Choi', 'Y.', ''], ['Viswanathan', 'H. S.', ''], ['Bouklas', 'N.', ''], ['Yoon', 'H.', '']]","['non-intrusive', 'data-driven', 'reduced order modeling', 'generative adversarialnetworks', 'finite element', 'poroelasticity']"
9512,2108.12956,Hao Wu,"Ling Guo, Hao Wu, Tao Zhou","Normalizing field flows: Solving forward and inverse stochastic
  differential equations using physics-informed flow models",,,10.1016/j.jcp.2022.111202,,cs.LG cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce in this work the normalizing field flows (NFF) for learning
random fields from scattered measurements. More precisely, we construct a
bijective transformation (a normalizing flow characterizing by neural networks)
between a Gaussian random field with the Karhunen-Lo\`eve (KL) expansion
structure and the target stochastic field, where the KL expansion coefficients
and the invertible networks are trained by maximizing the sum of the
log-likelihood on scattered measurements. This NFF model can be used to solve
data-driven forward, inverse, and mixed forward/inverse stochastic partial
differential equations in a unified framework. We demonstrate the capability of
the proposed NFF model for learning Non Gaussian processes and different types
of stochastic partial differential equations.
","[{'version': 'v1', 'created': 'Mon, 30 Aug 2021 01:58:01 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Sep 2021 05:55:05 GMT'}]",2022-05-11,"[['Guo', 'Ling', ''], ['Wu', 'Hao', ''], ['Zhou', 'Tao', '']]","['Data-driven modeling', 'normalizing flows', 'uncertainty quantification', 'random fields']"
9513,2106.00988,Bogdan Trasnea,"Bogdan Trasnea, Cosmin Ginerica, Mihai Zaha, Gigel Macesanu, Claudiu
  Pozna, Sorin Grigorescu","OctoPath: An OcTree Based Self-Supervised Learning Approach to Local
  Trajectory Planning for Mobile Robots",,"Sensors 2021, 21(11), 3606",10.3390/s21113606,,cs.RO cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Autonomous mobile robots are usually faced with challenging situations when
driving in complex environments. Namely, they have to recognize the static and
dynamic obstacles, plan the driving path and execute their motion. For
addressing the issue of perception and path planning, in this paper, we
introduce OctoPath , which is an encoder-decoder deep neural network, trained
in a self-supervised manner to predict the local optimal trajectory for the
ego-vehicle. Using the discretization provided by a 3D octree environment
model, our approach reformulates trajectory prediction as a classification
problem with a configurable resolution. During training, OctoPath minimizes the
error between the predicted and the manually driven trajectories in a given
training dataset. This allows us to avoid the pitfall of regression-based
trajectory estimation, in which there is an infinite state space for the output
trajectory points. Environment sensing is performed using a 40-channel
mechanical LiDAR sensor, fused with an inertial measurement unit and wheels
odometry for state estimation. The experiments are performed both in simulation
and real-life, using our own developed GridSim simulator and RovisLab's
Autonomous Mobile Test Unit platform. We evaluate the predictions of OctoPath
in different driving scenarios, both indoor and outdoor, while benchmarking our
system against a baseline hybrid A-Star algorithm and a regression-based
supervised learning method, as well as against a CNN learning-based optimal
path planning method.
","[{'version': 'v1', 'created': 'Wed, 2 Jun 2021 07:10:54 GMT'}]",2021-06-03,"[['Trasnea', 'Bogdan', ''], ['Ginerica', 'Cosmin', ''], ['Zaha', 'Mihai', ''], ['Macesanu', 'Gigel', ''], ['Pozna', 'Claudiu', ''], ['Grigorescu', 'Sorin', '']]","['Sensor Fusion', 'Mobile Robot Systems', 'Path Planning', 'Autonomous Vehicles', 'Artificial Intelligence', 'Deep Learning']"
9514,1904.05267,Eric Silverman,Umberto Gostoli and Eric Silverman,"Modelling Social Care Provision in An Agent-Based Framework with Kinship
  Networks","15 pages, 12 figures",,10.1098/rsos.190029,,cs.MA cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Current demographic trends in the UK include a fast-growing elderly
population and dropping birth rates, and demand for social care amongst the
aged is rising. The UK depends on informal social care -- family members or
friends providing care -- for some 50\% of care provision. However, lower birth
rates and a graying population mean that care availability is becoming a
significant problem, causing concern amongst policy-makers that substantial
public investment in formal care will be required in decades to come. In this
paper we present an agent-based simulation of care provision in the UK, in
which individual agents can decide to provide informal care, or pay for private
care, for their loved ones. Agents base these decisions on factors including
their own health, employment status, financial resources, relationship to the
individual in need, and geographical location. Results demonstrate that the
model can produce similar patterns of care need and availability as is observed
in the real world, despite the model containing minimal empirical data. We
propose that our model better captures the complexities of social care
provision than other methods, due to the socioeconomic details present and the
use of kinship networks to distribute care amongst family members.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2019 16:09:53 GMT'}]",2020-02-07,"[['Gostoli', 'Umberto', ''], ['Silverman', 'Eric', '']]","['Social Care', 'Kinship Networks', 'Agent-Based Modelling']"
9515,1904.06862,Elisa Claire Alem\'an Carre\'on,"Elisa Claire Alem\'an Carre\'on, Hirofumi Nonaka, Asahi Hentona and
  Hirochika Yamashiro","Measuring the influence of mere exposure effect of TV commercial adverts
  on purchase behavior based on machine learning prediction models",,"2019. Information Processing & Management, Vol. 56, No. 4. pp.
  1339 - 1355. URL https://authors.elsevier.com/a/1YotZ15hYdcAq4",10.1016/j.ipm.2019.03.007,,cs.IR cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Since its introduction, television has been the main channel of investment
for advertisements in order to influence customers purchase behavior. Many have
attributed the mere exposure effect as the source of influence in purchase
intention and purchase decision; however, most of the studies of television
advertisement effects are not only outdated, but their sample size is
questionable and their environments do not reflect reality. With the advent of
the internet, social media and new information technologies, many recent
studies focus on the effects of online advertisement, meanwhile, the investment
in television advertisement still has not declined. In response to this, we
applied machine learning algorithms SVM and XGBoost, as well as Logistic
Regression, to construct a number of prediction models based on at-home
advertisement exposure time and demographic data, examining the predictability
of Actual Purchase and Purchase Intention behaviors of 3000 customers across 36
different products during the span of 3 months. If models based on exposure
time had unreliable predictability in contrast to models based on demographic
data, doubts would surface about the effectiveness of the hard investment in
television advertising. Based on our results, we found that models based on
advert exposure time were consistently low in their predictability in
comparison with models based on demographic data only, and with models based on
both demographic data and exposure time data. We also found that there was not
a statistically significant difference between these last two kinds of models.
This suggests that advert exposure time has little to no effect in the
short-term in increasing positive actual purchase behavior.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2019 05:50:56 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Apr 2019 07:30:59 GMT'}]",2019-05-01,"[['Carreón', 'Elisa Claire Alemán', ''], ['Nonaka', 'Hirofumi', ''], ['Hentona', 'Asahi', ''], ['Yamashiro', 'Hirochika', '']]","['Television Adverts', 'Purchase Behavior', 'SVM', 'XGBoost', 'Machine']"
9516,1906.04206,Guoqiang Liang,"Guoqiang Liang, Xiaodan Lou, Haiyan Hou, Zhigang Hu","Qualifying threshold of take off stage for successfully disseminated
  creative ideas",17 pages,"Scientometrics, 2019",10.1007/s11192-019-03154-4,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The creative process is essentially Darwinian and only a small proportion of
creative ideas are selected for further development. However, the threshold
that identifies this small fraction of successfully disseminated creative ideas
at their early stage has not been thoroughly analyzed through the lens of
Rogers innovation diffusion theory. Here, we take highly cited (top 1%)
research papers as an example of the most successfully disseminated creative
ideas and explore the time it takes and citations it receives at their take off
stage, which play a crucial role in the dissemination of creativity. Results
show the majority of highly cited papers will reach 10% and 25% of their total
citations within two years and four years, respectively. Interestingly, our
results also present a minimal number of articles that attract their first
citation before publication. As for the discipline, number of references, and
Price index, we find a significant difference exists: Clinical, Pre-Clinical &
Health and Life Sciences are the first two disciplines to reach the C10% and
C25% in a shorter amount of time. Highly cited papers with limited references
usually take more time to reach 10% and 25% of their total citations. In
addition, highly cited papers will attract citations rapidly when they cite
more recent references. These results provide insights into the timespan and
citations for a research paper to become highly cited at the take off stage in
its diffusion process, as well as the factors that may influence it.
","[{'version': 'v1', 'created': 'Mon, 10 Jun 2019 18:05:27 GMT'}]",2019-06-18,"[['Liang', 'Guoqiang', ''], ['Lou', 'Xiaodan', ''], ['Hou', 'Haiyan', ''], ['Hu', 'Zhigang', '']]","['Innovation diffusion', 'citation analysis', 'creativity', 'highly cited paper']"
9517,2012.11779,Philip Edwards PhD,"P.J. ""Eddie'' Edwards, Dimitris Psychogyios, Stefanie Speidel, Lena
  Maier-Hein and Danail Stoyanov","SERV-CT: A disparity dataset from CT for validation of endoscopic 3D
  reconstruction","Submitted to Medical Image Analysis. 14 Figures, 17 pages",,10.1016/j.media.2021.102302,,cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In computer vision, reference datasets have been highly successful in
promoting algorithmic development in stereo reconstruction. Surgical scenes
gives rise to specific problems, including the lack of clear corner features,
highly specular surfaces and the presence of blood and smoke. Publicly
available datasets have been produced using CT and either phantom images or
biological tissue samples covering a relatively small region of the endoscope
field-of-view. We present a stereo-endoscopic reconstruction validation dataset
based on CT (SERV-CT). Two {\it ex vivo} small porcine full torso cadavers were
placed within the view of the endoscope with both the endoscope and target
anatomy visible in the CT scan. Orientation of the endoscope was manually
aligned to the stereoscopic view. Reference disparities and occlusions were
calculated for 8 stereo pairs from each sample. For the second sample an RGB
surface was acquired to aid alignment of smooth, featureless surfaces. Repeated
manual alignments showed an RMS disparity accuracy of ~2 pixels and a depth
accuracy of ~2mm. The reference dataset includes endoscope image pairs with
corresponding calibration, disparities, depths and occlusions covering the
majority of the endoscopic image and a range of tissue types. Smooth specular
surfaces and images with significant variation of depth are included. We
assessed the performance of various stereo algorithms from online available
repositories. There is a significant variation between algorithms, highlighting
some of the challenges of surgical endoscopic images. The SERV-CT dataset
provides an easy to use stereoscopic validation for surgical applications with
smooth reference disparities and depths with coverage over the majority of the
endoscopic images. This complements existing resources well and we hope will
aid the development of surgical endoscopic anatomical reconstruction
algorithms.
","[{'version': 'v1', 'created': 'Tue, 22 Dec 2020 01:28:30 GMT'}]",2022-02-10,"[['Edwards', 'P. J. ""Eddie\'\'', ''], ['Psychogyios', 'Dimitris', ''], ['Speidel', 'Stefanie', ''], ['Maier-Hein', 'Lena', ''], ['Stoyanov', 'Danail', '']]","['Stereo 3D reconstruction', 'CT validation', 'Surgical endoscopy', 'Computer-assisted interventions']"
9518,1403.0068,Nithya C,C. Nithya and K. Saravanan,"Semantic Annotation and Search for Educational Resources Supporting
  Distance Learning","Linked Data, Semantic search, Cloud Applications, Web services,
  Semantic annotation, Ontology","IJETT V8(6),277-285 February 2014. ISSN:2231-5381",10.14445/22315381/IJETT-V8P252,,cs.IR cs.CY cs.DL,http://creativecommons.org/licenses/by/3.0/,"  Multimedia educational resources play an important role in education,
particularly for distance learning environments. With the rapid growth of the
multimedia web, large numbers of education articles video resources are
increasingly being created by several different organizations. It is crucial to
explore, share, reuse, and link these educational resources for better
e-learning experiences. Most of the video resources are currently annotated in
an isolated way, which means that they lack semantic connections. Thus,
providing the facilities for annotating these video resources is highly
demanded. These facilities create the semantic connections among video
resources and allow their metadata to be understood globally. Adopting Linked
Data technology, this paper introduces a video annotation and browser platform
with two online tools: Notitia and Sansu-Wolke. Notitia enables users to
semantically annotate video resources using vocabularies defined in the Linked
Data cloud. Sansu-Wolke allows users to browse semantically linked educational
video resources with enhanced web information from different online resources.
In the prototype development, the platform uses existing video resources for
education articles. The result of the initial development demonstrates the
benefits of applying Linked Data technology in the aspects of reusability,
scalability, and extensibility
","[{'version': 'v1', 'created': 'Sat, 1 Mar 2014 09:26:35 GMT'}]",2014-03-04,"[['Nithya', 'C.', ''], ['Saravanan', 'K.', '']]","['Linked Data', 'Semantic search', 'Cloud Applications', 'Web services', 'Semantic annotation', 'Ontology']"
9519,2111.00830,Ridewaan Hanslo,Ridewaan Hanslo,"Deep Learning Transformer Architecture for Named Entity Recognition on
  Low Resourced Languages: State of the art results","8 pages, 6 tables, and 3 figures",,10.15439/2022F53,,cs.CL cs.AI,http://creativecommons.org/licenses/by/4.0/,"  This paper reports on the evaluation of Deep Learning (DL) transformer
architecture models for Named-Entity Recognition (NER) on ten low-resourced
South African (SA) languages. In addition, these DL transformer models were
compared to other Neural Network and Machine Learning (ML) NER models. The
findings show that transformer models substantially improve performance when
applying discrete fine-tuning parameters per language. Furthermore, fine-tuned
transformer models outperform other neural network and machine learning models
on NER with the low-resourced SA languages. For example, the transformer models
obtained the highest F-scores for six of the ten SA languages and the highest
average F-score surpassing the Conditional Random Fields ML model. Practical
implications include developing high-performance NER capability with less
effort and resource costs, potentially improving downstream NLP tasks such as
Machine Translation (MT). Therefore, the application of DL transformer
architecture models for NLP NER sequence tagging tasks on low-resourced SA
languages is viable. Additional research could evaluate the more recent
transformer architecture models on other Natural Language Processing tasks and
applications, such as Phrase chunking, MT, and Part-of-Speech tagging.
","[{'version': 'v1', 'created': 'Mon, 1 Nov 2021 11:02:01 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Oct 2022 11:38:57 GMT'}]",2022-10-04,"[['Hanslo', 'Ridewaan', '']]","['Named-Entity Recognition', 'Natural Language Processing', 'Neural Networks', 'Sequence Tagging', 'XLM-R', 'Machine Learning', 'Transformer Models']"
9520,2010.07211,Paul Brown,Paul Brown and Trevor Fenner,Fast Generation of Unlabelled Free Trees using Weight Sequences,"21 pages, 1 table and 8 figures",,10.7155/jgaa.00556,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce a new representation for ordered trees, the
weight sequence representation. We then use this to construct new
representations for both rooted trees and free trees, namely the canonical
weight sequence representation. We construct algorithms for generating the
weight sequence representations for all rooted and free trees of order n, and
then add a number of modifications to improve the efficiency of the algorithms.
Python implementations of the algorithms incorporate further improvements by
using generators to avoid having to store the long lists of trees returned by
the recursive calls, as well as caching the lists for rooted trees of small
order, thereby eliminating many of the recursive calls. We further show how the
algorithm can be modifed to generate adjacency list and adjacency matrix
representations for free trees. We compared the run-times of our Python
implementation for generating free trees with the Python implementation of the
well-known WROM algorithm taken from NetworkX. The implementation of our
algorithm is over four times as fast as the implementation of the WROM
algorithm. The run-times for generating adjacency lists and matrices are
somewhat longer than those for weight sequences, but are still over three times
as fast as the corresponding implementations of the WROM algorithm.
","[{'version': 'v1', 'created': 'Wed, 14 Oct 2020 16:24:54 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Dec 2020 15:51:30 GMT'}]",2021-02-24,"[['Brown', 'Paul', ''], ['Fenner', 'Trevor', '']]","['Free trees', 'rooted trees', 'representations of trees', 'weight sequences', 'tree generationalgorithms']"
9521,2201.02896,Govind Krishnan Gangadhar,Govind Krishnan Gangadhar and Ashish Kulkarni,"Extraction of Product Specifications from the Web -- Going Beyond Tables
  and Lists","9 pages, 7 figures, 9th ACM IKDD CODS and 27th COMAD",,10.1145/3493700.3493713,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  E-commerce product pages on the web often present product specification data
in structured tabular blocks. Extraction of these product attribute-value
specifications has benefited applications like product catalogue curation,
search, question answering, and others. However, across different Websites,
there is a wide variety of HTML elements (like <table>, <ul>, <div>, <span>,
<dl> etc.) typically used to render these blocks that makes their automatic
extraction a challenge. Most of the current research has focused on extracting
product specifications from tables and lists and, therefore, suffers from
recall when applied to a large-scale extraction setting. In this paper, we
present a product specification extraction approach that goes beyond tables or
lists and generalizes across the diverse HTML elements used for rendering
specification blocks. Using a combination of hand-coded features and deep
learned spatial and token features, we first identify the specification blocks
on a product page. We then extract the product attribute-value pairs from these
blocks following an approach inspired by wrapper induction. We created a
labeled dataset of product specifications extracted from 14,111 diverse
specification blocks taken from a range of different product websites. Our
experiments show the efficacy of our approach compared to the current
specification extraction models and support our claim about its application to
large-scale product specification extraction.
","[{'version': 'v1', 'created': 'Sat, 8 Jan 2022 22:25:32 GMT'}]",2022-01-11,"[['Gangadhar', 'Govind Krishnan', ''], ['Kulkarni', 'Ashish', '']]","['Information Retrieval', 'Data Mining', 'Extraction', 'Text Classification']"
9522,2008.01415,Pierre Talbot,"Pierre Talbot, \'Eric Monfroy and Charlotte Truchet",Modular Constraint Solver Cooperation via Abstract Interpretation,"Paper presented at the 36th International Conference on Logic
  Programming (ICLP 2020), University Of Calabria, Rende (CS), Italy, September
  2020, 17 pages. v2: Fix an example in Section 3.2 (improved closure)",Theory and Practice of Logic Programming 20 (2020) 848-863,10.1017/S1471068420000162,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cooperation among constraint solvers is difficult because different solving
paradigms have different theoretical foundations. Recent works have shown that
abstract interpretation can provide a unifying theory for various constraint
solvers. In particular, it relies on abstract domains which capture constraint
languages as ordered structures. The key insight of this paper is viewing
cooperation schemes as abstract domains combinations. We propose a modular
framework in which solvers and cooperation schemes can be seamlessly added and
combined. This differs from existing approaches such as SMT where the
cooperation scheme is usually fixed (e.g., Nelson-Oppen). We contribute to two
new cooperation schemes: (i) interval propagators completion that allows
abstract domains to exchange bound constraints, and (ii) delayed product which
exchanges over-approximations of constraints between two abstract domains.
Moreover, the delayed product is based on delayed goal of logic programming,
and it shows that abstract domains can also capture control aspects of
constraint solving. Finally, to achieve modularity, we propose the shared
product to combine abstract domains and cooperation schemes. Our approach has
been fully implemented, and we provide various examples on the flexible job
shop scheduling problem. Under consideration for acceptance in TPLP.
","[{'version': 'v1', 'created': 'Tue, 4 Aug 2020 08:52:19 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Sep 2020 10:01:14 GMT'}]",2020-09-23,"[['Talbot', 'Pierre', ''], ['Monfroy', 'Éric', ''], ['Truchet', 'Charlotte', '']]","['abstract domains', 'solver cooperation', 'modularity', 'constraint programming']"
9523,2208.10816,Yifan Liu,"Yifan Liu, Wei Wei, Jiayi Liu, Xianling Mao, Rui Fang, and Dangyang
  Chen",Improving Personality Consistency in Conversation by Persona Extending,Accepted by CIKM 2022,,10.1145/3511808.3557359,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Endowing chatbots with a consistent personality plays a vital role for agents
to deliver human-like interactions. However, existing personalized approaches
commonly generate responses in light of static predefined personas depicted
with textual description, which may severely restrict the interactivity of
human and the chatbot, especially when the agent needs to answer the query
excluded in the predefined personas, which is so-called out-of-predefined
persona problem (named OOP for simplicity). To alleviate the problem, in this
paper we propose a novel retrieval-to-prediction paradigm consisting of two
subcomponents, namely, (1) Persona Retrieval Model (PRM), it retrieves a
persona from a global collection based on a Natural Language Inference (NLI)
model, the inferred persona is consistent with the predefined personas; and (2)
Posterior-scored Transformer (PS-Transformer), it adopts a persona posterior
distribution that further considers the actual personas used in the ground
response, maximally mitigating the gap between training and inferring.
Furthermore, we present a dataset called IT-ConvAI2 that first highlights the
OOP problem in personalized dialogue. Extensive experiments on both IT-ConvAI2
and ConvAI2 demonstrate that our proposed model yields considerable
improvements in both automatic metrics and human evaluations.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2022 09:00:58 GMT'}]",2022-08-24,"[['Liu', 'Yifan', ''], ['Wei', 'Wei', ''], ['Liu', 'Jiayi', ''], ['Mao', 'Xianling', ''], ['Fang', 'Rui', ''], ['Chen', 'Dangyang', '']]","['dialogue generation', 'personality consistency', 'persona expanding']"
9524,1909.12235,Matteo Tiezzi,"Matteo Tiezzi, Stefano Melacci, Marco Maggini, Angelo Frosini","Video Surveillance of Highway Traffic Events by Deep Learning
  Architectures",,"Lecture Notes in Computer Science, vol 11141, (2018) pp 584-593",10.1007/978-3-030-01424-7_57,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we describe a video surveillance system able to detect traffic
events in videos acquired by fixed videocameras on highways. The events of
interest consist in a specific sequence of situations that occur in the video,
as for instance a vehicle stopping on the emergency lane. Hence, the detection
of these events requires to analyze a temporal sequence in the video stream. We
compare different approaches that exploit architectures based on Recurrent
Neural Networks (RNNs) and Convolutional Neural Networks (CNNs). A first
approach extracts vectors of features, mostly related to motion, from each
video frame and exploits a RNN fed with the resulting sequence of vectors. The
other approaches are based directly on the sequence of frames, that are
eventually enriched with pixel-wise motion information. The obtained stream is
processed by an architecture that stacks a CNN and a RNN, and we also
investigate a transfer-learning-based model. The results are very promising and
the best architecture will be tested online in real operative conditions.
","[{'version': 'v1', 'created': 'Fri, 6 Sep 2019 15:36:02 GMT'}]",2019-09-27,"[['Tiezzi', 'Matteo', ''], ['Melacci', 'Stefano', ''], ['Maggini', 'Marco', ''], ['Frosini', 'Angelo', '']]","['Convolutional Neural Networks', 'Recurrent Neural Networks', 'Deep Learning', 'Video Surveillance', 'Highway Traffic']"
9525,2008.05230,Miaojing Shi,"Wenqing Liu, Miaojing Shi, Teddy Furon, Li Li",Defending Adversarial Examples via DNN Bottleneck Reinforcement,ACM MM 2020 - Full Paper,,10.1145/3394171.3413604,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a DNN bottleneck reinforcement scheme to alleviate the
vulnerability of Deep Neural Networks (DNN) against adversarial attacks.
Typical DNN classifiers encode the input image into a compressed latent
representation more suitable for inference. This information bottleneck makes a
trade-off between the image-specific structure and class-specific information
in an image. By reinforcing the former while maintaining the latter, any
redundant information, be it adversarial or not, should be removed from the
latent representation. Hence, this paper proposes to jointly train an
auto-encoder (AE) sharing the same encoding weights with the visual classifier.
In order to reinforce the information bottleneck, we introduce the multi-scale
low-pass objective and multi-scale high-frequency communication for better
frequency steering in the network. Unlike existing approaches, our scheme is
the first reforming defense per se which keeps the classifier structure
untouched without appending any pre-processing head and is trained with clean
images only. Extensive experiments on MNIST, CIFAR-10 and ImageNet demonstrate
the strong defense of our method against various adversarial attacks.
","[{'version': 'v1', 'created': 'Wed, 12 Aug 2020 11:02:01 GMT'}]",2020-08-13,"[['Liu', 'Wenqing', ''], ['Shi', 'Miaojing', ''], ['Furon', 'Teddy', ''], ['Li', 'Li', '']]","['DNN', 'adversarial attacks', 'information bottleneck', 'auto-encoder']"
9526,2010.00004,Soraia Musse,"Estevso Testa, Rodrigo C. Barros, Soraia Raupp Musse","CrowdEst: A Method for Estimating (and not Simulating) Crowd Evacuation
  Parameters in Generic Environments",,"THE VISUAL COMPUTER, 2019",10.1007/s00371-019-01684-9,,cs.MA cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evacuation plans have been historically used as a safety measure for the
construction of buildings. The existing crowd simulators require fully-modeled
3D environments and enough time to prepare and simulate scenarios, where the
distribution and behavior of the crowd needs to be controlled. In addition, its
population, routes or even doors and passages may change, so the 3D model and
configurations have to be updated accordingly. This is a time-consuming task
that commonly has to be addressed within the crowd simulators. With that in
mind, we present a novel approach to estimate the resulting data of a given
evacuation scenario without actually simulating it. For such, we divide the
environment into smaller modular rooms with different configurations, in a
divide-and-conquer fashion. Next, we train an artificial neural network to
estimate all required data regarding the evacuation of a single room. After
collecting the estimated data from each room, we develop a heuristic capable of
aggregating per-room information so the full environment can be properly
evaluated. Our method presents an average error of 5% when compared to
evacuation time in a real-life environment. Our crowd estimator approach has
several advantages, such as not requiring to model the 3D environment, nor
learning how to use and configure a crowd simulator, which means any user can
easily use it. Furthermore, the computational time to estimate evacuation data
(inference time) is virtually zero, which is much better even when compared to
the best-case scenario in a real-time crowd simulator.
","[{'version': 'v1', 'created': 'Wed, 30 Sep 2020 14:42:45 GMT'}]",2020-10-02,"[['Testa', 'Estevso', ''], ['Barros', 'Rodrigo C.', ''], ['Musse', 'Soraia Raupp', '']]","['Crowd simulation', 'Crowd estimation', 'Neural Networks']"
9527,2205.13992,Zhe Liu,Zhe Liu and Chunyang Chen and Junjie Wang and Yuhui Su and Qing Wang,NaviDroid: A Tool for Guiding Manual Android Testing via Hint Moves,"Accepted by ICSE 2022. arXiv admin note: substantial text overlap
  with arXiv:2201.12085",,10.1145/3510454.3516848,,cs.SE,http://creativecommons.org/publicdomain/zero/1.0/,"  Manual testing, as a complement to automated GUI testing, is the last line of
defense for app quality especially in spotting usability and accessibility
issues. However, the repeated actions and easy missing of some functionalities
make manual testing time-consuming, labor-extensive and inefficient. Inspired
by the game candy crush with flashy candies as hint moves for players, we
develop a tool named NaviDroid for navigating human testers via highlighted
next operations for more effective and efficient testing. Within NaviDroid, it
constructs an enriched state transition graph (STG) with the trigger actions as
the edges for two involved states. Based on the STG, NaviDroid utilizes the
dynamic programming algorithm to plan the exploration path, and augment the
run-time GUI with visualized hint moves for testers to quickly explore untested
states and avoid duplication. The automated experiments demonstrate the high
coverage and efficient path planning of NaviDroid. A user study further
confirms its usefulness in the participants covering more states and
activities, detecting more bugs within less time compared with the control
group. NaviDroid demo video: https://youtu.be/lShFyg_nTA0.
","[{'version': 'v1', 'created': 'Fri, 27 May 2022 14:10:12 GMT'}]",2022-05-30,"[['Liu', 'Zhe', ''], ['Chen', 'Chunyang', ''], ['Wang', 'Junjie', ''], ['Su', 'Yuhui', ''], ['Wang', 'Qing', '']]","['GUI testing', 'Android App', 'State Transition Graph', 'Human testing']"
9528,2106.14020,Suthee Ruangwises,Suthee Ruangwises,An Improved Physical ZKP for Nonogram,This paper has appeared at COCOA 2021,,10.1007/978-3-030-92681-6_22,,cs.CC cs.CR cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nonogram is a logic puzzle consisting of a rectangular grid with an objective
to color every cell black or white such that the lengths of blocks of
consecutive black cells in each row and column are equal to the given numbers.
In 2010, Chien and Hon developed the first physical zero-knowledge proof for
Nonogram, which allows a prover to physically show that he/she knows a solution
of the puzzle without revealing it. However, their protocol requires special
tools such as scratch-off cards and a machine to seal the cards, which are
difficult to find in everyday life. Their protocol also has a nonzero soundness
error. In this paper, we propose a more practical physical zero-knowledge proof
for Nonogram that uses only a deck of regular paper cards and also has perfect
soundness.
","[{'version': 'v1', 'created': 'Sat, 26 Jun 2021 13:32:25 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Oct 2021 18:43:48 GMT'}, {'version': 'v3', 'created': 'Wed, 24 Nov 2021 09:15:21 GMT'}, {'version': 'v4', 'created': 'Mon, 20 Dec 2021 18:47:36 GMT'}]",2022-01-02,"[['Ruangwises', 'Suthee', '']]","['zero-knowledge proof', 'card-based cryptography', 'Nonogram', 'puzzle']"
9529,2006.14049,Ondrej Rokos,"P. Samantray, R.H.J. Peerlings, E. Bosco, M.G.D. Geers, T.J. Massart,
  O. Roko\v{s}","Level set based eXtended finite element modelling of the response of
  fibrous networks under hygroscopic swelling","27 pages, 22 figures, 4 tables, J. Appl. Mech. June 19, 2020",,10.1115/1.4047573,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Materials like paper, consisting of a network of natural fibres, exposed to
variations in moisture, undergo changes in geometrical and mechanical
properties. This behaviour is particularly important for understanding the
hygro-mechanical response of sheets of paper in applications like digital
printing. A two-dimensional microstructural model of a fibrous network is
therefore developed to upscale the hygro-expansion of individual fibres,
through their interaction, to the resulting overall expansion of the network.
The fibres are modelled with rectangular shapes and are assumed to be perfectly
bonded where they overlap. For realistic networks the number of bonds is large
and the network is geometrically so complex that discretizing it by
conventional, geometry-conforming, finite elements is cumbersome. The
combination of a level-set and XFEM formalism enables the use of regular,
structured grids in order to model the complex microstructural geometry. In
this approach, the fibres are described implicitly by a level-set function. In
order to represent the fibre boundaries in the fibrous network, an XFEM
discretization is used together with a Heaviside enrichment function. Numerical
results demonstrate that the proposed approach successfully captures the
hygro-expansive properties of the network with fewer degrees of freedom
compared to classical FEM, preserving desired accuracy.
","[{'version': 'v1', 'created': 'Tue, 23 Jun 2020 14:59:39 GMT'}]",2020-06-26,"[['Samantray', 'P.', ''], ['Peerlings', 'R. H. J.', ''], ['Bosco', 'E.', ''], ['Geers', 'M. G. D.', ''], ['Massart', 'T. J.', ''], ['Rokoš', 'O.', '']]","['Fibrous network', 'hygro-expansion', 'level-set functions', 'XFEM']"
9530,2109.00020,Federico Landi,"Federico Landi, Lorenzo Baraldi, Marcella Cornia, Rita Cucchiara",Working Memory Connections for LSTM,Accepted for publication in Neural Networks,,10.1016/j.neunet.2021.08.030,,cs.LG cs.CL cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recurrent Neural Networks with Long Short-Term Memory (LSTM) make use of
gating mechanisms to mitigate exploding and vanishing gradients when learning
long-term dependencies. For this reason, LSTMs and other gated RNNs are widely
adopted, being the standard de facto for many sequence modeling tasks. Although
the memory cell inside the LSTM contains essential information, it is not
allowed to influence the gating mechanism directly. In this work, we improve
the gate potential by including information coming from the internal cell
state. The proposed modification, named Working Memory Connection, consists in
adding a learnable nonlinear projection of the cell content into the network
gates. This modification can fit into the classical LSTM gates without any
assumption on the underlying task, being particularly effective when dealing
with longer sequences. Previous research effort in this direction, which goes
back to the early 2000s, could not bring a consistent improvement over vanilla
LSTM. As part of this paper, we identify a key issue tied to previous
connections that heavily limits their effectiveness, hence preventing a
successful integration of the knowledge coming from the internal cell state. We
show through extensive experimental evaluation that Working Memory Connections
constantly improve the performance of LSTMs on a variety of tasks. Numerical
results suggest that the cell state contains useful information that is worth
including in the gate structure.
","[{'version': 'v1', 'created': 'Tue, 31 Aug 2021 18:01:30 GMT'}]",2021-09-27,"[['Landi', 'Federico', ''], ['Baraldi', 'Lorenzo', ''], ['Cornia', 'Marcella', ''], ['Cucchiara', 'Rita', '']]","['Long Short-Term Memory Networks', 'Cell-to-Gate Connections', 'GatedRNNs', 'Language Modeling', 'Image Captioning']"
9531,1506.04571,Vincent Labatut,"Nicolas Dugu\'e (LIFO), Vincent Labatut (LIA), Anthony Perez (LIFO)","A community role approach to assess social capitalists visibility in the
  Twitter network",arXiv admin note: substantial text overlap with arXiv:1406.6611,"Social Network Analysis and Mining, Springer, 2015, 5, pp. 26",10.1007/s13278-015-0266-0,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the context of Twitter, social capitalists are specific users trying to
increase their number of followers and interactions by any means. These users
are not healthy for the service, because they are either spammers or real users
flawing the notions of influence and visibility. Studying their behavior and
understanding their position in Twit-ter is thus of important interest. It is
also necessary to analyze how these methods effectively affect user visibility.
Based on a recently proposed method allowing to identify social capitalists, we
tackle both points by studying how they are organized, and how their links
spread across the Twitter follower-followee network. To that aim, we consider
their position in the network w.r.t. its community structure. We use the
concept of community role of a node, which describes its position in a network
depending on its connectiv-ity at the community level. However, the topological
measures originally defined to characterize these roles consider only certain
aspects of the community-related connectivity, and rely on a set of empirically
fixed thresholds. We first show the limitations of these measures, before
extending and generalizing them. Moreover, we use an unsupervised approach to
identify the roles, in order to provide more flexibility relatively to the
studied system. We then apply our method to the case of social capitalists and
show they are highly visible on Twitter, due to the specific roles they hold.
","[{'version': 'v1', 'created': 'Mon, 15 Jun 2015 12:43:45 GMT'}]",2015-06-16,"[['Dugué', 'Nicolas', '', 'LIFO'], ['Labatut', 'Vincent', '', 'LIA'], ['Perez', 'Anthony', '', 'LIFO']]","['Twitter', 'Social network', 'Social capitalism', 'influence', 'community roles']"
9532,2205.10124,Dario  Izzo,"Marcus M\""artens and Dario Izzo and Emmanuel Blazquez and Moritz von
  Looz and Pablo G\'omez and Anne Mergy and Giacomo Acciarini and Chit Hong Yam
  and Javier Hernando Ayuso and Yuri Shimane","The Fellowship of the Dyson Ring: ACT&Friends' Results and Methods for
  GTOC 11",,,10.1016/j.actaastro.2022.06.025,,cs.AI astro-ph.EP astro-ph.IM cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Dyson spheres are hypothetical megastructures encircling stars in order to
harvest most of their energy output. During the 11th edition of the GTOC
challenge, participants were tasked with a complex trajectory planning related
to the construction of a precursor Dyson structure, a heliocentric ring made of
twelve stations. To this purpose, we developed several new approaches that
synthesize techniques from machine learning, combinatorial optimization,
planning and scheduling, and evolutionary optimization effectively integrated
into a fully automated pipeline. These include a machine learned transfer time
estimator, improving the established Edelbaum approximation and thus better
informing a Lazy Race Tree Search to identify and collect asteroids with high
arrival mass for the stations; a series of optimally-phased low-thrust
transfers to all stations computed by indirect optimization techniques,
exploiting the synodic periodicity of the system; and a modified Hungarian
scheduling algorithm, which utilizes evolutionary techniques to arrange a
mass-balanced arrival schedule out of all transfer possibilities. We describe
the steps of our pipeline in detail with a special focus on how our approaches
mutually benefit from each other. Lastly, we outline and analyze the final
solution of our team, ACT&Friends, which ranked second at the GTOC 11
challenge.
","[{'version': 'v1', 'created': 'Fri, 13 May 2022 12:26:16 GMT'}, {'version': 'v2', 'created': 'Mon, 23 May 2022 06:28:11 GMT'}]",2022-12-28,"[['Märtens', 'Marcus', ''], ['Izzo', 'Dario', ''], ['Blazquez', 'Emmanuel', ''], ['von Looz', 'Moritz', ''], ['Gómez', 'Pablo', ''], ['Mergy', 'Anne', ''], ['Acciarini', 'Giacomo', ''], ['Yam', 'Chit Hong', ''], ['Ayuso', 'Javier Hernando', ''], ['Shimane', 'Yuri', '']]","['Trajectory optimization', 'indirect methods', 'beam search', 'Dyson']"
9533,2004.08664,Maxim Buzdalov,Anton Bassin and Maxim Buzdalov,"The $(1+(\lambda,\lambda))$ Genetic Algorithm for Permutations","This contribution is a slightly extended version of the paper
  accepted to the GECCO 2020 workshop on permutation-based problems",,10.1145/3377929.3398148,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The $(1+(\lambda,\lambda))$ genetic algorithm is a bright example of an
evolutionary algorithm which was developed based on the insights from
theoretical findings. This algorithm uses crossover, and it was shown to
asymptotically outperform all mutation-based evolutionary algorithms even on
simple problems like OneMax. Subsequently it was studied on a number of other
problems, but all of these were pseudo-Boolean.
  We aim at improving this situation by proposing an adaptation of the
$(1+(\lambda,\lambda))$ genetic algorithm to permutation-based problems. Such
an adaptation is required, because permutations are noticeably different from
bit strings in some key aspects, such as the number of possible mutations and
their mutual dependence. We also present the first runtime analysis of this
algorithm on a permutation-based problem called Ham whose properties resemble
those of OneMax. On this problem, where the simple mutation-based algorithms
have the running time of $\Theta(n^2 \log n)$ for problem size $n$, the
$(1+(\lambda,\lambda))$ genetic algorithm finds the optimum in $O(n^2)$ fitness
queries. We augment this analysis with experiments, which show that this
algorithm is also fast in practice.
","[{'version': 'v1', 'created': 'Sat, 18 Apr 2020 17:04:57 GMT'}, {'version': 'v2', 'created': 'Sun, 10 May 2020 13:13:44 GMT'}]",2020-05-12,"[['Bassin', 'Anton', ''], ['Buzdalov', 'Maxim', '']]","['Runtime analysis', '(1 + (λ', 'λ)) GA', 'permutations']"
9534,1506.05672,Philipp Schaer,"Nadine Dulisch, Andreas Oskar Kempf, Philipp Schaer",Query Expansion for Survey Question Retrieval in the Social Sciences,"to appear in Proceedings of 19th International Conference on Theory
  and Practice of Digital Libraries 2015 (TPDL 2015)",,10.1007/978-3-319-24592-8_3,,cs.DL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, the importance of research data and the need to archive and
to share it in the scientific community have increased enormously. This
introduces a whole new set of challenges for digital libraries. In the social
sciences typical research data sets consist of surveys and questionnaires. In
this paper we focus on the use case of social science survey question reuse and
on mechanisms to support users in the query formulation for data sets. We
describe and evaluate thesaurus- and co-occurrence-based approaches for query
expansion to improve retrieval quality in digital libraries and research data
archives. The challenge here is to translate the information need and the
underlying sociological phenomena into proper queries. As we can show retrieval
quality can be improved by adding related terms to the queries. In a direct
comparison automatically expanded queries using extracted co-occurring terms
can provide better results than queries manually reformulated by a domain
expert and better results than a keyword-based BM25 baseline.
","[{'version': 'v1', 'created': 'Thu, 18 Jun 2015 13:35:28 GMT'}]",2017-05-03,"[['Dulisch', 'Nadine', ''], ['Kempf', 'Andreas Oskar', ''], ['Schaer', 'Philipp', '']]","['Scientific data management', 'survey question retrieval', 'survey question reuse', 'query expansion', 'co-occurrence analysis', 'thesauri', 'evaluation']"
9535,2003.00971,Philip Kulp,Philip H. Kulp and Nikki E. Robinson,"Graphing Website Relationships for Risk Prediction: Identifying Derived
  Threats to Users Based on Known Indicators","10 pages, 3 figures, 3 tables",,10.1007/978-3-030-63089-8,,cs.CR cs.DB cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The hypothesis for the study was that the relationship based on referrer
links and the number of hops to a malicious site could indicate the risk to
another website. We chose Receiver Operating Characteristics (ROC) analysis as
the method of comparing true positive and false positive rates for captured web
traffic to test the predictive capabilities of our model. Known threat
indicators were used as designators, and the Neo4j graph database was leveraged
to map the relationships between other websites based on referring links. Using
the referring traffic, we mapped user visits across websites with a known
relationship to track the rate at which users progressed from a non-malicious
website to a known threat. The results were grouped by the hop distance from
the known threat to calculate the predictive rate. The results of the model
produced true positive rates between 58.59% and 63.45% and false positive rates
between 7.42% to 37.50%, respectively. The true and false positive rates
suggest an improved performance based on the closer proximity from the known
threat, while an increased referring distance from the threat resulted in
higher rates of false positives.
","[{'version': 'v1', 'created': 'Mon, 2 Mar 2020 15:41:48 GMT'}]",2020-11-04,"[['Kulp', 'Philip H.', ''], ['Robinson', 'Nikki E.', '']]","['cyber security', 'graphing database', 'Receiver Operating Characteristics', 'Neo4j', 'website', 'threat model']"
9536,2005.03717,Kiru Park,"Kiru Park, Timothy Patten, Markus Vincze","Neural Object Learning for 6D Pose Estimation Using a Few Cluttered
  Images",ECCV 2020 (Spotlight),,10.1007/978-3-030-58548-8_38,,cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent methods for 6D pose estimation of objects assume either textured 3D
models or real images that cover the entire range of target poses. However, it
is difficult to obtain textured 3D models and annotate the poses of objects in
real scenarios. This paper proposes a method, Neural Object Learning (NOL),
that creates synthetic images of objects in arbitrary poses by combining only a
few observations from cluttered images. A novel refinement step is proposed to
align inaccurate poses of objects in source images, which results in better
quality images. Evaluations performed on two public datasets show that the
rendered images created by NOL lead to state-of-the-art performance in
comparison to methods that use 13 times the number of real images. Evaluations
on our new dataset show multiple objects can be trained and recognized
simultaneously using a sequence of a fixed scene.
","[{'version': 'v1', 'created': 'Thu, 7 May 2020 19:33:06 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Aug 2020 15:28:16 GMT'}]",2020-11-04,"[['Park', 'Kiru', ''], ['Patten', 'Timothy', ''], ['Vincze', 'Markus', '']]","['6D pose estimation', 'object learning', 'object model', 'objectmodeling', 'differentiable rendering', 'object recognition']"
9537,1605.02669,Rafa{\l} Skinderowicz,Rafa{\l} Skinderowicz,The GPU-based Parallel Ant Colony System,,,10.1016/j.jpdc.2016.04.014,,cs.DC cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Ant Colony System (ACS) is, next to Ant Colony Optimization (ACO) and the
MAX-MIN Ant System (MMAS), one of the most efficient metaheuristic algorithms
inspired by the behavior of ants. In this article we present three novel
parallel versions of the ACS for the graphics processing units (GPUs). To the
best of our knowledge, this is the first such work on the ACS which shares many
key elements of the ACO and the MMAS, but differences in the process of
building solutions and updating the pheromone trails make obtaining an
efficient parallel version for the GPUs a difficult task. The proposed parallel
versions of the ACS differ mainly in their implementations of the pheromone
memory. The first two use the standard pheromone matrix, and the third uses a
novel selective pheromone memory. Computational experiments conducted on
several Travelling Salesman Problem (TSP) instances of sizes ranging from 198
to 2392 cities showed that the parallel ACS on Nvidia Kepler GK104 GPU (1536
CUDA cores) is able to obtain a speedup up to 24.29x vs the sequential ACS
running on a single core of Intel Xeon E5-2670 CPU. The parallel ACS with the
selective pheromone memory achieved speedups up to 16.85x, but in most cases
the obtained solutions were of significantly better quality than for the
sequential ACS.
","[{'version': 'v1', 'created': 'Mon, 9 May 2016 17:41:37 GMT'}, {'version': 'v2', 'created': 'Fri, 5 May 2017 10:43:58 GMT'}]",2017-05-08,"[['Skinderowicz', 'Rafał', '']]","['parallel Ant Colony System', 'CUDA', 'GPU', 'selective pheromone memory', 'parallel metaheuristic']"
9538,2205.03853,Ling Luo,"Ling Luo, Chih-Hsuan Wei, Po-Ting Lai, Qingyu Chen, Rezarta Islamaj
  Do\u{g}an, Zhiyong Lu","Assigning Species Information to Corresponding Genes by a Sequence
  Labeling Framework",,"Database, Volume 2022, 2022, baac090",10.1093/database/baac090,,cs.CL cs.IR cs.LG q-bio.GN,http://creativecommons.org/licenses/by/4.0/,"  The automatic assignment of species information to the corresponding genes in
a research article is a critically important step in the gene normalization
task, whereby a gene mention is normalized and linked to a database record or
identifier by a text-mining algorithm. Existing methods typically rely on
heuristic rules based on gene and species co-occurrence in the article, but
their accuracy is suboptimal. We therefore developed a high-performance method,
using a novel deep learning-based framework, to classify whether there is a
relation between a gene and a species. Instead of the traditional binary
classification framework in which all possible pairs of genes and species in
the same article are evaluated, we treat the problem as a sequence-labeling
task such that only a fraction of the pairs needs to be considered. Our
benchmarking results show that our approach obtains significantly higher
performance compared to that of the rule-based baseline method for the species
assignment task (from 65.8% to 81.3% in accuracy). The source code and data for
species assignment are freely available at
https://github.com/ncbi/SpeciesAssignment.
","[{'version': 'v1', 'created': 'Sun, 8 May 2022 12:39:45 GMT'}]",2022-10-17,"[['Luo', 'Ling', ''], ['Wei', 'Chih-Hsuan', ''], ['Lai', 'Po-Ting', ''], ['Chen', 'Qingyu', ''], ['Doğan', 'Rezarta Islamaj', ''], ['Lu', 'Zhiyong', '']]","['Species name recognition', 'Species assignment', 'Deep learning', 'Sequence labeling framework']"
9539,2207.14291,Jan-Hendrik Bastek,"Jan-Hendrik Bastek, Dennis M. Kochmann",Physics-Informed Neural Networks for Shell Structures,"24 pages, 16 figures",,10.1016/j.euromechsol.2022.104849,,cs.CE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The numerical modeling of thin shell structures is a challenge, which has
been met by a variety of finite element (FE) and other formulations -- many of
which give rise to new challenges, from complex implementations to artificial
locking. As a potential alternative, we use machine learning and present a
Physics-Informed Neural Network (PINN) to predict the small-strain response of
arbitrarily curved shells. To this end, the shell midsurface is described by a
chart, from which the mechanical fields are derived in a curvilinear coordinate
frame by adopting Naghdi's shell theory. Unlike in typical PINN applications,
the corresponding strong or weak form must therefore be solved in a
non-Euclidean domain. We investigate the performance of the proposed PINN in
three distinct scenarios, including the well-known Scordelis-Lo roof setting
widely used to test FE shell elements against locking. Results show that the
PINN can accurately identify the solution field in all three benchmarks if the
equations are presented in their weak form, while it may fail to do so when
using the strong form. In the thin-thickness limit, where classical methods are
susceptible to locking, training time notably increases as the differences in
scaling of the membrane, shear, and bending energies lead to adverse numerical
stiffness in the gradient flow dynamics. Nevertheless, the PINN can accurately
match the ground truth and performs well in the Scordelis-Lo roof benchmark,
highlighting its potential for a drastically simplified alternative to
designing locking-free shell FE formulations.
","[{'version': 'v1', 'created': 'Tue, 26 Jul 2022 07:48:14 GMT'}]",2022-11-30,"[['Bastek', 'Jan-Hendrik', ''], ['Kochmann', 'Dennis M.', '']]","['Structural mechanics', 'Machine learning', 'Shell theory', 'Finite Element Method']"
9540,2011.09052,Naftali Cohen,"Srijan Sood, Zhen Zeng, Naftali Cohen, Tucker Balch, and Manuela
  Veloso",Visual Time Series Forecasting: An Image-driven Approach,"This work appeared in the 2nd ACM International Conference on AI in
  Finance (ICAIF-2021)",,10.1145/3490354.3494387,,cs.CV cs.LG econ.EM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Time series forecasting is essential for agents to make decisions.
Traditional approaches rely on statistical methods to forecast given past
numeric values. In practice, end-users often rely on visualizations such as
charts and plots to reason about their forecasts. Inspired by practitioners, we
re-imagine the topic by creating a novel framework to produce visual forecasts,
similar to the way humans intuitively do. In this work, we leverage advances in
deep learning to extend the field of time series forecasting to a visual
setting. We capture input data as an image and train a model to produce the
subsequent image. This approach results in predicting distributions as opposed
to pointwise values. We examine various synthetic and real datasets with
diverse degrees of complexity. Our experiments show that visual forecasting is
effective for cyclic data but somewhat less for irregular data such as stock
price. Importantly, when using image-based evaluation metrics, we find the
proposed visual forecasting method to outperform various numerical baselines,
including ARIMA and a numerical variation of our method. We demonstrate the
benefits of incorporating vision-based approaches in forecasting tasks -- both
for the quality of the forecasts produced, as well as the metrics that can be
used to evaluate them.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2020 02:51:37 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Nov 2021 19:20:23 GMT'}, {'version': 'v3', 'created': 'Fri, 19 Nov 2021 19:38:46 GMT'}]",2021-11-23,"[['Sood', 'Srijan', ''], ['Zeng', 'Zhen', ''], ['Cohen', 'Naftali', ''], ['Balch', 'Tucker', ''], ['Veloso', 'Manuela', '']]","['time-series forecasting', 'image representations', 'neural networks', 'ARIMA', 'visualizations']"
9541,1809.05415,Rodrigo Bonif\'acio,Welder Pinheiro Luz and Gustavo Pinto and Rodrigo Bonif\'acio,"Building a Collaborative Culture: A Grounded Theory of Well Succeeded
  DevOps Adoption in Practice",11 pages,,10.1145/3239235.3240299,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background. DevOps is a set of practices and cultural values that aims to
reduce the barriers between development and operations teams. Due to its
increasing interest and imprecise definitions, existing research works have
tried to characterize DevOps---mainly using a set of concepts and related
practices. Aims. Nevertheless, little is known about thepractitioners
practitioners' understanding about successful paths for DevOps adoption. The
lack of such understanding might hinder institutions to adopt DevOps practices.
Therefore, our goal here is to present a theory about DevOps adoption,
highlighting the main related concepts that contribute to its adoption in
industry. Method. Our work builds upon Classic Grounded Theory. We interviewed
practitioners that contributed to DevOps adoption in 15 companies from
different domains and across 5 countries. We empirically evaluate our model
through a case study, whose goal is to increase the maturity level of DevOps
adoption at the Brazilian Federal Court of Accounts, a Brazilian Government
institution.Results. This paper presents a model to improve both the
understanding and guidance of DevOps adoption. The model increments the
existing view of DevOps by explaining the role and motivation of each category
(and their relationships) in the DevOps adoption process. We organize this
model in terms of DevOps enabler categories and DevOps outcome categories. We
provide evidence that collaboration is the core DevOps concern, contrasting
with an existing wisdom that implanting specific tools to automate building,
deployment, and infrastructure provisioning and management is enough to achieve
DevOps. Conclusions. Altogether, our results contribute to (a) generating an
adequate understanding of DevOps, from the perspective of practitioners; and
(b) assisting other institutions in the migration path towards DevOps adoption.
","[{'version': 'v1', 'created': 'Fri, 14 Sep 2018 13:31:19 GMT'}]",2018-09-17,"[['Luz', 'Welder Pinheiro', ''], ['Pinto', 'Gustavo', ''], ['Bonifácio', 'Rodrigo', '']]","['DevOps', 'Grounded Theory', 'Software Development', 'Software Operations']"
9542,2109.15276,Jesse David Dinneen,"Charles-Antoine Julien, Banafsheh Asadi, Jesse David Dinneen, Fei Shu","Library of Congress Subject Heading (LCSH) Browsing and Natural Language
  Searching","conference paper (ASIST '16), 4 pages plus a poster","ASIST 2016: Proceedings of the 79th Annual Meeting of the
  Association for Information Science & Technology, 53",10.1002/pra2.2016.14505301116,,cs.IR cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Controlled topical vocabularies (CVs) are built into information systems to
aid browsing and retrieval of items that may be unfamiliar, but it is unclear
how this feature should be integrated with standard keyword searching. Few
systems or scholarly prototypes have attempted this, and none have used the
most widely used CV, the Library of Congress Subject Headings (LCSH), which
organizes monograph collections in academic libraries throughout the world.
This paper describes a working prototype of a Web application that concurrently
allows topic exploration using an outline tree view of the LCSH hierarchy and
natural language keyword searching of a real-world Science and Engineering
bibliographic collection. Pilot testing shows the system is functional, and
work to fit the complex LCSH structure into a usable hierarchy is ongoing. This
study contributes to knowledge of the practical design decisions required when
developing linked interactions between topical hierarchy browsing and natural
language searching, which promise to facilitate information discovery and
exploration.
","[{'version': 'v1', 'created': 'Thu, 30 Sep 2021 17:22:35 GMT'}]",2022-09-21,"[['Julien', 'Charles-Antoine', ''], ['Asadi', 'Banafsheh', ''], ['Dinneen', 'Jesse David', ''], ['Shu', 'Fei', '']]","['Information Exploration Systems', 'Information Retrieval', 'Information Organization', 'Information Visualization']"
9543,2008.03674,Pierre-Alain Fayolle,"Markus Friedrich and Christoph Roch and Sebastian Feld and Carsten
  Hahn and Pierre-Alain Fayolle",A Flexible Pipeline for the Optimization of CSG Trees,"The 28th International Conference in Central Europe on Computer
  Graphics, Visualization and Computer Vision (WSCG) 2020, p. 79-88. Update:
  Enlarge some of the figures and move some of the figures to the end",,10.24132/CSRN.2020.3001.10,,cs.AI cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CSG trees are an intuitive, yet powerful technique for the representation of
geometry using a combination of Boolean set-operations and geometric
primitives. In general, there exists an infinite number of trees all describing
the same 3D solid. However, some trees are optimal regarding the number of used
operations, their shape or other attributes, like their suitability for
intuitive, human-controlled editing. In this paper, we present a systematic
comparison of newly developed and existing tree optimization methods and
propose a flexible processing pipeline with a focus on tree editability. The
pipeline uses a redundancy removal and decomposition stage for complexity
reduction and different (meta-)heuristics for remaining tree optimization. We
also introduce a new quantitative measure for CSG tree editability and show how
it can be used as a constraint in the optimization process.
","[{'version': 'v1', 'created': 'Sun, 9 Aug 2020 06:45:10 GMT'}, {'version': 'v2', 'created': 'Sat, 12 Sep 2020 05:43:03 GMT'}]",2020-09-15,"[['Friedrich', 'Markus', ''], ['Roch', 'Christoph', ''], ['Feld', 'Sebastian', ''], ['Hahn', 'Carsten', ''], ['Fayolle', 'Pierre-Alain', '']]","['Evolutionary Algorithms', 'Quantum Annealing', 'Geometry Processing', 'CAD', 'CSG', 'Combinatorial Optimization']"
9544,2207.00068,Jung Hwan Heo,"Jung Hwan Heo, Arash Fayyazi, Amirhossein Esmaili, Massoud Pedram","Sparse Periodic Systolic Dataflow for Lowering Latency and Power
  Dissipation of Convolutional Neural Network Accelerators","6 pages, Published in ACM/IEEE International Symposium on Low Power
  Electronics and Design (ISLPED) 2022",,10.1145/3531437.3539715,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  This paper introduces the sparse periodic systolic (SPS) dataflow, which
advances the state-of-the-art hardware accelerator for supporting lightweight
neural networks. Specifically, the SPS dataflow enables a novel hardware design
approach unlocked by an emergent pruning scheme, periodic pattern-based
sparsity (PPS). By exploiting the regularity of PPS, our sparsity-aware
compiler optimally reorders the weights and uses a simple indexing unit in
hardware to create matches between the weights and activations. Through the
compiler-hardware codesign, SPS dataflow enjoys higher degrees of parallelism
while being free of the high indexing overhead and without model accuracy loss.
Evaluated on popular benchmarks such as VGG and ResNet, the SPS dataflow and
accompanying neural network compiler outperform prior work in convolutional
neural network (CNN) accelerator designs targeting FPGA devices. Against other
sparsity-supporting weight storage formats, SPS results in 4.49x energy
efficiency gain while lowering storage requirements by 3.67x for total weight
storage (non-pruned weights plus indexing) and 22,044x for indexing memory.
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2022 19:16:46 GMT'}]",2022-07-04,"[['Heo', 'Jung Hwan', ''], ['Fayyazi', 'Arash', ''], ['Esmaili', 'Amirhossein', ''], ['Pedram', 'Massoud', '']]","['Deep Learning', 'Pattern-based Pruning', 'CNN Acceleration', 'FPGA']"
9545,2012.03021,Takahiro Kinoshita,Takahiro Kinoshita and Satoshi Ono,Depth estimation from 4D light field videos,"6 pages, 6 figures, International Workshop on Advanced Image
  Technology (IWAIT) 2021",,10.1117/12.2591012,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Depth (disparity) estimation from 4D Light Field (LF) images has been a
research topic for the last couple of years. Most studies have focused on depth
estimation from static 4D LF images while not considering temporal information,
i.e., LF videos. This paper proposes an end-to-end neural network architecture
for depth estimation from 4D LF videos. This study also constructs a
medium-scale synthetic 4D LF video dataset that can be used for training deep
learning-based methods. Experimental results using synthetic and real-world 4D
LF videos show that temporal information contributes to the improvement of
depth estimation accuracy in noisy regions. Dataset and code is available at:
https://mediaeng-lfv.github.io/LFV_Disparity_Estimation
","[{'version': 'v1', 'created': 'Sat, 5 Dec 2020 12:33:15 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Dec 2020 08:25:32 GMT'}]",2021-03-29,"[['Kinoshita', 'Takahiro', ''], ['Ono', 'Satoshi', '']]","['Light field video', 'Light field dataset', 'Depth estimation', 'Deep neural network']"
9546,2107.09512,Elder Sobrinho Dr.,Elder Vicente de Paulo Sobrinho and Marcelo de Almeida Maia,"On the Interplay of Smells Large Class, Complex Class and Duplicate Code",10 pages,"Brazilian Symposium on Software Engineering (SBES '21), September
  27-October 1, 2021, Joinville, Brazil",10.1145/3474624.3474716,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Bad smells have been defined to describe potential problems in code, possibly
pointing out refactoring opportunities. Several empirical studies have
highlighted that smells have a negative impact on comprehension and
maintainability. Consequently, several approaches have been proposed to detect
and restructure them. However, studies on the inter-relationship of occurrence
of different types of smells in source code are still lacking, especially those
focused on the quantification of this inter-relationship. In this work, we aim
at understand and quantify the possible the inter-relation of smells Large
Class - LC, Complex Class - CC and Duplicate Code - DC. In particular, we
investigate patterns of LC and CC regarding the presence or absence of
duplicate code. We conduct a quantitative study on five open source projects,
and also a qualitative analysis to measure and understand the association of
specific smells. As one of the main results, we highlight that there are
""occurrence patterns"" among these smells, for example: either in Complex Class
or in the co-occurrence of Large Class and Complex Class, clones tend to be
more prevalent in highly complex classes than less complex classes. The found
patterns could be used to improve the performance of detection tools or even
help in refactoring tasks.
","[{'version': 'v1', 'created': 'Tue, 20 Jul 2021 14:00:47 GMT'}]",2021-07-21,"[['Sobrinho', 'Elder Vicente de Paulo', ''], ['Maia', 'Marcelo de Almeida', '']]","['Software maintenance', 'reengineering', 'bad smell']"
9547,2112.14531,Lanning Wei,"Lanning Wei, Huan Zhao, Zhiqiang He","Designing the Topology of Graph Neural Networks: A Novel Feature Fusion
  Perspective",,,10.1145/3485447.3512185,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  In recent years, Graph Neural Networks (GNNs) have shown superior performance
on diverse real-world applications. To improve the model capacity, besides
designing aggregation operations, GNN topology design is also very important.
In general, there are two mainstream GNN topology design manners. The first one
is to stack aggregation operations to obtain the higher-level features but
easily got performance drop as the network goes deeper. Secondly, the multiple
aggregation operations are utilized in each layer which provides adequate and
independent feature extraction stage on local neighbors while are costly to
obtain the higher-level information. To enjoy the benefits while alleviating
the corresponding deficiencies of these two manners, we learn to design the
topology of GNNs in a novel feature fusion perspective which is dubbed
F$^2$GNN. To be specific, we provide a feature fusion perspective in designing
GNN topology and propose a novel framework to unify the existing topology
designs with feature selection and fusion strategies. Then we develop a neural
architecture search method on top of the unified framework which contains a set
of selection and fusion operations in the search space and an improved
differentiable search algorithm. The performance gains on eight real-world
datasets demonstrate the effectiveness of F$^2$GNN. We further conduct
experiments to show that F$^2$GNN can improve the model capacity while
alleviating the deficiencies of existing GNN topology design manners,
especially alleviating the over-smoothing problem, by utilizing different
levels of features adaptively.
","[{'version': 'v1', 'created': 'Wed, 29 Dec 2021 13:06:12 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Feb 2022 13:55:41 GMT'}]",2022-02-02,"[['Wei', 'Lanning', ''], ['Zhao', 'Huan', ''], ['He', 'Zhiqiang', '']]","['Graph Neural Networks', 'Topology Design', 'Neural ArchitectureSearch', 'Over-smoothing', 'Heterophily']"
9548,2011.01200,Valentyn Yanchuk M,"Valentyn M. Yanchuk, Andrii G. Tkachuk, Dmitry S. Antoniuk, Tetiana A.
  Vakaliuk, and Anna A. Humeniuk","Mathematical simulation of package delivery optimization using a
  combination of carriers",,"International Conference on Machine Learning Techniques and NLP
  (MLNLP 2020), October 24-25, 2020, Sydney, Australia. Computer Science &
  Information Technology (CS & IT), Vol. 10, N.12, pp. 45-55",10.5121/csit.2020.101205,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A variety of goods and services in the contemporary world requires permanent
improvement of services e-commerce platform performance. Modern society is so
deeply integrated with mail deliveries, purchasing of goods and services
online, that makes competition between service and good providers a key
selection factor. As long as logistic, timely, and cost-effective delivery
plays important part authors decided to analyze possible ways of improvements
in the current field, especially for regions distantly located from popular
distribution centers. Considering both: fast and lazy delivery the factor of
costs is playing an important role for each end-user. Given work proposes a
simulation that analyses the current cost of delivery for e-commerce orders in
the context of delivery by the Supplier Fleet, World-Wide delivery service
fleet, and possible vendor drop-ship and checks of the alternative ways can be
used to minimize the costs. The main object of investigation is focused around
mid and small businesses living far from big distribution centers (except edge
cases like lighthouses, edge rocks with very limited accessibility) but
actively using e-commerce solutions for daily activities fulfillment. Authors
analyzed and proposed a solution for the problem of cost optimization for
packages delivery for long-distance deliveries using a combination of paths
delivered by supplier fleets, worldwide and local carriers. Data models and
Add-ons of contemporary Enterprise Resource Planning systems were used, and
additional development is proposed in the perspective of the flow selection
change. The experiment is based on data sources of the United States companies
using a wide range of carriers for delivery services and uses the data sources
of the real companies; however, it applies repetitive simulations to analyze
variances in obtained solutions.
","[{'version': 'v1', 'created': 'Mon, 2 Nov 2020 18:44:04 GMT'}]",2020-11-03,"[['Yanchuk', 'Valentyn M.', ''], ['Tkachuk', 'Andrii G.', ''], ['Antoniuk', 'Dmitry S.', ''], ['Vakaliuk', 'Tetiana A.', ''], ['Humeniuk', 'Anna A.', '']]","['Simulation', 'Customer Behavior', 'Optimization', 'E-commerce']"
9549,1905.09661,Javad Amirian,"Javad Amirian, Wouter van Toll, Jean-Bernard Hayet, Julien Pettr\'e",Data-Driven Crowd Simulation with Generative Adversarial Networks,Accepted in CASA '19 (Computer Animation and Social Agents),,10.1145/3328756.3328769,,cs.GR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel data-driven crowd simulation method that can
mimic the observed traffic of pedestrians in a given environment. Given a set
of observed trajectories, we use a recent form of neural networks, Generative
Adversarial Networks (GANs), to learn the properties of this set and generate
new trajectories with similar properties. We define a way for simulated
pedestrians (agents) to follow such a trajectory while handling local collision
avoidance. As such, the system can generate a crowd that behaves similarly to
observations, while still enabling real-time interactions between agents. Via
experiments with real-world data, we show that our simulated trajectories
preserve the statistical properties of their input. Our method simulates crowds
in real time that resemble existing crowds, while also allowing insertion of
extra agents, combination with other simulation methods, and user interaction.
","[{'version': 'v1', 'created': 'Thu, 23 May 2019 13:53:31 GMT'}]",2019-05-24,"[['Amirian', 'Javad', ''], ['van Toll', 'Wouter', ''], ['Hayet', 'Jean-Bernard', ''], ['Pettré', 'Julien', '']]","['crowd simulation', 'content generation', 'machine learning', 'intelligentagents', 'generative adversarial networks']"
9550,2101.00388,Houjin Yu,"Houjin Yu, Xian-Ling Mao, Zewen Chi, Wei Wei and Heyan Huang","A Robust and Domain-Adaptive Approach for Low-Resource Named Entity
  Recognition","Best Student Paper of 2020 IEEE International Conference on Knowledge
  Graph (ICKG)","2020 IEEE International Conference on Knowledge Graph (ICKG) (pp.
  297-304)-",10.1109/ICBK50248.2020.00050,,cs.CL cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, it has attracted much attention to build reliable named entity
recognition (NER) systems using limited annotated data. Nearly all existing
works heavily rely on domain-specific resources, such as external lexicons and
knowledge bases. However, such domain-specific resources are often not
available, meanwhile it's difficult and expensive to construct the resources,
which has become a key obstacle to wider adoption. To tackle the problem, in
this work, we propose a novel robust and domain-adaptive approach RDANER for
low-resource NER, which only uses cheap and easily obtainable resources.
Extensive experiments on three benchmark datasets demonstrate that our approach
achieves the best performance when only using cheap and easily obtainable
resources, and delivers competitive results against state-of-the-art methods
which use difficultly obtainable domainspecific resources. All our code and
corpora can be found on https://github.com/houking-can/RDANER.
","[{'version': 'v1', 'created': 'Sat, 2 Jan 2021 06:47:01 GMT'}]",2021-01-05,"[['Yu', 'Houjin', ''], ['Mao', 'Xian-Ling', ''], ['Chi', 'Zewen', ''], ['Wei', 'Wei', ''], ['Huang', 'Heyan', '']]","['named entity recognition', 'low resource', 'domainadaptive']"
9551,1909.08288,Pedro Machado,"Pedro Machado, Georgina Cosma, T.M McGinnity","NatCSNN: A Convolutional Spiking Neural Network for recognition of
  objects extracted from natural images",12 pages,"Artificial Neural Networks and Machine Learning - ICANN 2019:
  Theoretical Neural Computation. ICANN 2019. Lecture Notes in Computer
  Science, vol 11727",10.1007/978-3-030-30487-4_28,,cs.NE cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Biological image processing is performed by complex neural networks composed
of thousands of neurons interconnected via thousands of synapses, some of which
are excitatory and others inhibitory. Spiking neural models are distinguished
from classical neurons by being biological plausible and exhibiting the same
dynamics as those observed in biological neurons. This paper proposes a Natural
Convolutional Neural Network (NatCSNN) which is a 3-layer bio-inspired
Convolutional Spiking Neural Network (CSNN), for classifying objects extracted
from natural images. A two-stage training algorithm is proposed using
unsupervised Spike Timing Dependent Plasticity (STDP) learning (phase 1) and
ReSuMe supervised learning (phase 2). The NatCSNN was trained and tested on the
CIFAR-10 dataset and achieved an average testing accuracy of 84.7% which is an
improvement over the 2-layer neural networks previously applied to this
dataset.
","[{'version': 'v1', 'created': 'Wed, 18 Sep 2019 08:52:42 GMT'}]",2019-09-19,"[['Machado', 'Pedro', ''], ['Cosma', 'Georgina', ''], ['McGinnity', 'T. M', '']]","['SNN', 'CSNN', 'bio-inspired neural networks', 'object classification', 'unsupervised learning', 'supervised learning', 'ReSuMe', 'STDP']"
9552,2209.08018,Li Yang,"Li Yang, Abdallah Shami","IoT Data Analytics in Dynamic Environments: From An Automated Machine
  Learning Perspective","Published in Engineering Applications of Artificial Intelligence
  (Elsevier, IF:7.8); Code/An AutoML tutorial is available at Github link:
  https://github.com/Western-OC2-Lab/AutoML-Implementation-for-Static-and-Dynamic-Data-Analytics","Engineering Applications of Artificial Intelligence 116C (2022)
  105366",10.1016/j.engappai.2022.105366,,cs.LG cs.CR cs.NI cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  With the wide spread of sensors and smart devices in recent years, the data
generation speed of the Internet of Things (IoT) systems has increased
dramatically. In IoT systems, massive volumes of data must be processed,
transformed, and analyzed on a frequent basis to enable various IoT services
and functionalities. Machine Learning (ML) approaches have shown their capacity
for IoT data analytics. However, applying ML models to IoT data analytics tasks
still faces many difficulties and challenges, specifically, effective model
selection, design/tuning, and updating, which have brought massive demand for
experienced data scientists. Additionally, the dynamic nature of IoT data may
introduce concept drift issues, causing model performance degradation. To
reduce human efforts, Automated Machine Learning (AutoML) has become a popular
field that aims to automatically select, construct, tune, and update machine
learning models to achieve the best performance on specified tasks. In this
paper, we conduct a review of existing methods in the model selection, tuning,
and updating procedures in the area of AutoML in order to identify and
summarize the optimal solutions for every step of applying ML algorithms to IoT
data analytics. To justify our findings and help industrial users and
researchers better implement AutoML approaches, a case study of applying AutoML
to IoT anomaly detection problems is conducted in this work. Lastly, we discuss
and classify the challenges and research directions for this domain.
","[{'version': 'v1', 'created': 'Fri, 16 Sep 2022 16:02:56 GMT'}]",2022-09-19,"[['Yang', 'Li', ''], ['Shami', 'Abdallah', '']]","['IoT data analytics', 'AutoML', 'Concept drift', 'Machine learning']"
9553,2005.14617,Manuel Roehrl,"Manuel A. Roehrl, Thomas A. Runkler, Veronika Brandtstetter, Michel
  Tokic, Stefan Obermayer","Modeling System Dynamics with Physics-Informed Neural Networks Based on
  Lagrangian Mechanics",Accepted for publication at the 21st IFAC World Congress 2020,,10.1016/j.ifacol.2020.12.2182,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Identifying accurate dynamic models is required for the simulation and
control of various technical systems. In many important real-world
applications, however, the two main modeling approaches often fail to meet
requirements: first principles methods suffer from high bias, whereas
data-driven modeling tends to have high variance. Additionally, purely
data-based models often require large amounts of data and are often difficult
to interpret. In this paper, we present physics-informed neural ordinary
differential equations (PINODE), a hybrid model that combines the two modeling
techniques to overcome the aforementioned problems. This new approach directly
incorporates the equations of motion originating from the Lagrange Mechanics
into a deep neural network structure. Thus, we can integrate prior physics
knowledge where it is available and use function approximation--e. g., neural
networks--where it is not. The method is tested with a forward model of a
real-world physical system with large uncertainties. The resulting model is
accurate and data-efficient while ensuring physical plausibility. With this, we
demonstrate a method that beneficially merges physical insight with real data.
Our findings are of interest for model-based control and system identification
of mechanical systems.
","[{'version': 'v1', 'created': 'Fri, 29 May 2020 15:10:43 GMT'}]",2021-04-19,"[['Roehrl', 'Manuel A.', ''], ['Runkler', 'Thomas A.', ''], ['Brandtstetter', 'Veronika', ''], ['Tokic', 'Michel', ''], ['Obermayer', 'Stefan', '']]","['neural network models', 'computer simulation', 'differential equations', 'semi-parametricidentification', 'system identification']"
9554,2207.03207,Sean Lake,Sean E. Lake and Chao-Wei Tsai,"An Exploration of How Training Set Composition Bias in Machine Learning
  Affects Identifying Rare Objects","27 pages, 9 figures, 4 tables, accepted by Astronomy and Computing",,10.1016/j.ascom.2022.100617,,cs.LG astro-ph.IM,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  When training a machine learning classifier on data where one of the classes
is intrinsically rare, the classifier will often assign too few sources to the
rare class. To address this, it is common to up-weight the examples of the rare
class to ensure it isn't ignored. It is also a frequent practice to train on
restricted data where the balance of source types is closer to equal for the
same reason. Here we show that these practices can bias the model toward
over-assigning sources to the rare class. We also explore how to detect when
training data bias has had a statistically significant impact on the trained
model's predictions, and how to reduce the bias's impact. While the magnitude
of the impact of the techniques developed here will vary with the details of
the application, for most cases it should be modest. They are, however,
universally applicable to every time a machine learning classification model is
used, making them analogous to Bessel's correction to the sample variance.
","[{'version': 'v1', 'created': 'Thu, 7 Jul 2022 10:26:55 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Jul 2022 10:56:29 GMT'}]",2022-08-02,"[['Lake', 'Sean E.', ''], ['Tsai', 'Chao-Wei', '']]","['methods data analysis', 'methods statistical', 'Machine learning', 'Probability and statistics']"
9555,2008.07853,Ovi Paul,Ovi Paul,"Image Pre-processing on NumtaDB for Bengali Handwritten Digit
  Recognition","5 pages, 8 figures and 4 tables","2018 International Conference on Bangla Speech and Language
  Processing (ICBSLP), Sylhet, 2018, pp. 1-6",10.1109/ICBSLP.2018.8554910,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  NumtaDB is by far the largest data-set collection for handwritten digits in
Bengali. This is a diverse dataset containing more than 85000 images. But this
diversity also makes this dataset very difficult to work with. The goal of this
paper is to find the benchmark for pre-processed images which gives good
accuracy on any machine learning models. The reason being, there are no
available pre-processed data for Bengali digit recognition to work with like
the English digits for MNIST.
","[{'version': 'v1', 'created': 'Tue, 18 Aug 2020 11:02:25 GMT'}]",2020-08-19,"[['Paul', 'Ovi', '']]","['Image processing', 'Data pre-processing', 'Bengali']"
9556,1905.07987,Anne Reinarz,"Anne Reinarz, Dominic E. Charrier, Michael Bader, Luke Bovard, Michael
  Dumbser, Kenneth Duru, Francesco Fambri, Alice-Agnes Gabriel, Jean-Matthieu
  Gallard, Sven K\""oppel, Lukas Krenz, Leonhard Rannabauer, Luciano Rezzolla,
  Philipp Samfass, Maurizio Tavelli, Tobias Weinzierl","ExaHyPE: An Engine for Parallel Dynamically Adaptive Simulations of Wave
  Problems",,,10.1016/j.cpc.2020.107251,,cs.MS cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  ExaHyPE (""An Exascale Hyperbolic PDE Engine"") is a software engine for
solving systems of first-order hyperbolic partial differential equations
(PDEs). Hyperbolic PDEs are typically derived from the conservation laws of
physics and are useful in a wide range of application areas. Applications
powered by ExaHyPE can be run on a student's laptop, but are also able to
exploit thousands of processor cores on state-of-the-art supercomputers. The
engine is able to dynamically increase the accuracy of the simulation using
adaptive mesh refinement where required. Due to the robustness and shock
capturing abilities of ExaHyPE's numerical methods, users of the engine can
simulate linear and non-linear hyperbolic PDEs with very high accuracy. Users
can tailor the engine to their particular PDE by specifying evolved quantities,
fluxes, and source terms. A complete simulation code for a new hyperbolic PDE
can often be realised within a few hours - a task that, traditionally, can take
weeks, months, often years for researchers starting from scratch. In this
paper, we showcase ExaHyPE's workflow and capabilities through real-world
scenarios from our two main application areas: seismology and astrophysics.
","[{'version': 'v1', 'created': 'Mon, 20 May 2019 10:53:27 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Mar 2020 13:16:40 GMT'}, {'version': 'v3', 'created': 'Mon, 18 May 2020 11:43:55 GMT'}]",2020-07-15,"[['Reinarz', 'Anne', ''], ['Charrier', 'Dominic E.', ''], ['Bader', 'Michael', ''], ['Bovard', 'Luke', ''], ['Dumbser', 'Michael', ''], ['Duru', 'Kenneth', ''], ['Fambri', 'Francesco', ''], ['Gabriel', 'Alice-Agnes', ''], ['Gallard', 'Jean-Matthieu', ''], ['Köppel', 'Sven', ''], ['Krenz', 'Lukas', ''], ['Rannabauer', 'Leonhard', ''], ['Rezzolla', 'Luciano', ''], ['Samfass', 'Philipp', ''], ['Tavelli', 'Maurizio', ''], ['Weinzierl', 'Tobias', '']]","['hyperbolic', 'PDE', 'ADER-DG', 'Finite Volumes', 'AMR', 'MPI', 'TBB', 'MPI+X']"
9557,1911.05430,Emanuele D'Osualdo,Emanuele D'Osualdo and Felix Stutz,"Decidable Inductive Invariants for Verification of Cryptographic
  Protocols with Unbounded Sessions","16 pages + 23 pages appendix, 5 figures To appear in CONCUR 2020",31st International Conference on Concurrency Theory (CONCUR 2020),10.4230/LIPIcs.CONCUR.2020.31,,cs.LO cs.CR cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop a theory of decidable inductive invariants for an infinite-state
variant of the Applied pi-calculus, with applications to automatic verification
of stateful cryptographic protocols with unbounded sessions/nonces. Since the
problem is undecidable in general, we introduce depth-bounded protocols, a
strict generalisation of a class from the literature, for which our decidable
analysis is sound and complete. Our core contribution is a procedure to check
that an invariant is inductive, which implies that every reachable
configuration satisfies it. Our invariants can capture security properties like
secrecy, can be inferred automatically, and represent an independently
checkable certificate of correctness.
  We provide a prototype implementation and we report on its performance on
some textbook examples.
","[{'version': 'v1', 'created': 'Wed, 13 Nov 2019 12:45:28 GMT'}, {'version': 'v2', 'created': 'Sun, 19 Jul 2020 09:15:53 GMT'}]",2022-09-22,"[[""D'Osualdo"", 'Emanuele', ''], ['Stutz', 'Felix', '']]","['Security Protocols', 'Infinite-State Verification', 'Ideal Completions for WSTS']"
9558,1507.01272,Srijan Kumar,"Srijan Kumar, Francesca Spezzano, V.S. Subrahmanian",VEWS: A Wikipedia Vandal Early Warning System,"To appear in Proceedings of the 21st ACM SIGKDD Conference of
  Knowledge Discovery and Data Mining (KDD 2015)",,10.1145/2783258.2783367,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of detecting vandals on Wikipedia before any human or
known vandalism detection system reports flagging potential vandals so that
such users can be presented early to Wikipedia administrators. We leverage
multiple classical ML approaches, but develop 3 novel sets of features. Our
Wikipedia Vandal Behavior (WVB) approach uses a novel set of user editing
patterns as features to classify some users as vandals. Our Wikipedia
Transition Probability Matrix (WTPM) approach uses a set of features derived
from a transition probability matrix and then reduces it via a neural net
auto-encoder to classify some users as vandals. The VEWS approach merges the
previous two approaches. Without using any information (e.g. reverts) provided
by other users, these algorithms each have over 85% classification accuracy.
Moreover, when temporal recency is considered, accuracy goes to almost 90%. We
carry out detailed experiments on a new data set we have created consisting of
about 33K Wikipedia users (including both a black list and a white list of
editors) and containing 770K edits. We describe specific behaviors that
distinguish between vandals and non-vandals. We show that VEWS beats ClueBot NG
and STiki, the best known algorithms today for vandalism detection. Moreover,
VEWS detects far more vandals than ClueBot NG and on average, detects them 2.39
edits before ClueBot NG when both detect the vandal. However, we show that the
combination of VEWS and ClueBot NG can give a fully automated vandal early
warning system with even higher accuracy.
","[{'version': 'v1', 'created': 'Sun, 5 Jul 2015 20:53:26 GMT'}]",2015-07-07,"[['Kumar', 'Srijan', ''], ['Spezzano', 'Francesca', ''], ['Subrahmanian', 'V. S.', '']]","['Wikipedia', 'vandal detection', 'behavior modeling', 'early detection']"
9559,2106.14637,Raphael Pages,"Rapha\""el Pag\`es (IMB, LFANT, SPECFUN)","Computing Characteristic Polynomials of p-Curvatures in Average
  Polynomial Time",,"ISSAC 2021 - International Symposium on Symbolic and Algebraic
  Computation, Jul 2021, Saint-Petersbourg / Virtual, Russia",10.1145/3452143.3465524,,cs.SC math.FA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We design a fast algorithm that computes, for a given linear differential
operator with coefficients in $Z[x ]$, all the characteristic polynomials of
its p-curvatures, for all primes $p < N$ , in asymptotically quasi-linear bit
complexity in N. We discuss implementations and applications of our algorithm.
We shall see in particular that the good performances of our algorithm are
quickly visible.
","[{'version': 'v1', 'created': 'Mon, 28 Jun 2021 12:40:27 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Jul 2021 06:40:22 GMT'}]",2021-07-05,"[['Pagès', 'Raphaël', '', 'IMB, LFANT, SPECFUN']]","['Algorithms', 'complexity', '𝑝-curvature', 'matrix factorial']"
9560,2011.14684,Francesco Salvetti,"Simone Angarano, Vittorio Mazzia, Francesco Salvetti, Giovanni Fantin
  and Marcello Chiaberge","Robust Ultra-wideband Range Error Mitigation with Deep Learning at the
  Edge",Submitted to Engineering Applications of Artificial Intelligence,"Engineering Applications of Artificial Intelligence, Volume 102,
  June 2021, 104278",10.1016/j.engappai.2021.104278,,cs.LG cs.AI cs.RO eess.SP,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Ultra-wideband (UWB) is the state-of-the-art and most popular technology for
wireless localization. Nevertheless, precise ranging and localization in
non-line-of-sight (NLoS) conditions is still an open research topic. Indeed,
multipath effects, reflections, refractions, and complexity of the indoor radio
environment can easily introduce a positive bias in the ranging measurement,
resulting in highly inaccurate and unsatisfactory position estimation. This
article proposes an efficient representation learning methodology that exploits
the latest advancement in deep learning and graph optimization techniques to
achieve effective ranging error mitigation at the edge. Channel Impulse
Response (CIR) signals are directly exploited to extract high semantic features
to estimate corrections in either NLoS or LoS conditions. Extensive
experimentation with different settings and configurations has proved the
effectiveness of our methodology and demonstrated the feasibility of a robust
and low computational power UWB range error mitigation.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2020 10:52:21 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Apr 2021 09:16:00 GMT'}]",2021-05-06,"[['Angarano', 'Simone', ''], ['Mazzia', 'Vittorio', ''], ['Salvetti', 'Francesco', ''], ['Fantin', 'Giovanni', ''], ['Chiaberge', 'Marcello', '']]","['Deep learning', 'Ultra-wideband', 'Edge AI', 'Indoorpositioning']"
9561,2106.13646,Suthee Ruangwises,Suthee Ruangwises,Two Standard Decks of Playing Cards are Sufficient for a ZKP for Sudoku,A shortened version of this paper has appeared at COCOON 2021,"New Generation Computing, 40(1): 49-65 (2022)",10.1007/s00354-021-00146-y,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sudoku is a famous logic puzzle where the player has to fill a number between
1 and 9 into each empty cell of a $9 \times 9$ grid such that every number
appears exactly once in each row, each column, and each $3 \times 3$ block. In
2020, Sasaki et al. developed a physical card-based protocol of zero-knowledge
proof (ZKP) for Sudoku, which enables a prover to convince a verifier that
he/she knows a solution of the puzzle without revealing it. Their protocol uses
90 cards, but requires nine identical copies of some cards, which cannot be
found in a standard deck of playing cards (consisting of 52 different cards and
two jokers). Hence, nine identical standard decks are required to perform that
protocol, making the protocol not very practical. In this paper, we propose a
new ZKP protocol for Sudoku that can be performed using only two standard decks
of playing cards, regardless of whether the two decks are identical or
different. In general, we also develop the first ZKP protocol for a generalized
$n \times n$ Sudoku that can be performed using a deck of all different cards.
","[{'version': 'v1', 'created': 'Fri, 25 Jun 2021 14:03:36 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Oct 2021 13:40:40 GMT'}, {'version': 'v3', 'created': 'Mon, 24 Jan 2022 16:39:55 GMT'}]",2022-05-19,"[['Ruangwises', 'Suthee', '']]","['zero-knowledge proof', 'card-based cryptography', 'Sudoku', 'puzzle']"
9562,2112.13761,Nicol\'as Navarro-Guerrero,"Lasse Emil R. Bonner, and Daniel Daugaard Buhl, and Kristian
  Kristensen, and Nicol\'as Navarro-Guerrero",AU Dataset for Visuo-Haptic Object Recognition for Robots,,,10.6084/m9.figshare.14222486,,cs.RO cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Multimodal object recognition is still an emerging field. Thus, publicly
available datasets are still rare and of small size. This dataset was developed
to help fill this void and presents multimodal data for 63 objects with some
visual and haptic ambiguity. The dataset contains visual, kinesthetic and
tactile (audio/vibrations) data. To completely solve sensory ambiguity, sensory
integration/fusion would be required. This report describes the creation and
structure of the dataset. The first section explains the underlying approach
used to capture the visual and haptic properties of the objects. The second
section describes the technical aspects (experimental setup) needed for the
collection of the data. The third section introduces the objects, while the
final section describes the structure and content of the dataset.
","[{'version': 'v1', 'created': 'Mon, 27 Dec 2021 16:15:11 GMT'}]",2021-12-28,"[['Bonner', 'Lasse Emil R.', ''], ['Buhl', 'Daniel Daugaard', ''], ['Kristensen', 'Kristian', ''], ['Navarro-Guerrero', 'Nicolás', '']]","['Multimodal Object Recognition', 'Data Fusion', 'Visuo-HapticObject Recognition', 'Tactile Perception', 'Haptic Information', 'KinestheticPerception', 'Robot Perception']"
9563,2211.06491,Chinmay Sahu,"Chinmay Sahu, Blaine Ayotte, Mahesh K. Banavar",Integrating machine learning concepts into undergraduate classes,"This paper has been accepted to 2021 IEEE Frontiers in Education
  Conference (FIE)",,10.1109/FIE49875.2021.9637283,,cs.LG cs.CV,http://creativecommons.org/licenses/by/4.0/,"  In this innovative practice work-in-progress paper, we compare two different
methods to teach machine learning concepts to undergraduate students in
Electrical Engineering. While machine learning is now being offered as a
senior-level elective in several curricula, this does not mean all students are
exposed to it. Exposure to the concepts and practical applications of machine
learning will assist in the creation of a workforce ready to tackle problems
related to machine learning, currently a hot topic in industry. Preliminary
assessments indicate that this approach promotes student learning. While
students prefer the proposed side-by-side teaching approach, numerical
comparisons show that the workshop approach may be more effective for student
learning, indicating that further work in this area is required.
","[{'version': 'v1', 'created': 'Wed, 9 Nov 2022 23:28:45 GMT'}]",2022-11-15,"[['Sahu', 'Chinmay', ''], ['Ayotte', 'Blaine', ''], ['Banavar', 'Mahesh K.', '']]","['STEM', 'machine learning', 'signal processing', 'projects', 'hands-on activities']"
9564,2202.09868,Richard Schumi,"Richard Schumi, Jun Sun",ExAIS: Executable AI Semantics,,,10.1145/3510003.3510112,,cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Neural networks can be regarded as a new programming paradigm, i.e., instead
of building ever-more complex programs through (often informal) logical
reasoning in the programmers' mind, complex 'AI' systems are built by
optimising generic neural network models with big data. In this new paradigm,
AI frameworks such as TensorFlow and PyTorch play a key role, which is as
essential as the compiler for traditional programs. It is known that the lack
of a proper semantics for programming languages (such as C), i.e., a
correctness specification for compilers, has contributed to many problematic
program behaviours and security issues. While it is in general hard to have a
correctness specification for compilers due to the high complexity of
programming languages and their rapid evolution, we have a unique opportunity
to do it right this time for neural networks (which have a limited set of
functions, and most of them have stable semantics). In this work, we report our
effort on providing a correctness specification of neural network frameworks
such as TensorFlow. We specify the semantics of almost all TensorFlow layers in
the logical programming language Prolog. We demonstrate the usefulness of the
semantics through two applications. One is a fuzzing engine for TensorFlow,
which features a strong oracle and a systematic way of generating valid neural
networks. The other is a model validation approach which enables consistent bug
reporting for TensorFlow models.
","[{'version': 'v1', 'created': 'Sun, 20 Feb 2022 17:33:34 GMT'}]",2022-02-22,"[['Schumi', 'Richard', ''], ['Sun', 'Jun', '']]","['AI frameworks', 'AI libraries', 'deep learning models', 'semantics', 'specification', 'test case generation', 'model validation', 'AI model generation']"
9565,1601.05002,Jo\~ao Sousa Pinto,"Jo\""el Ouaknine, Amaury Pouly, Jo\~ao Sousa-Pinto, James Worrell",Solvability of Matrix-Exponential Equations,Accepted to LICS 2016,,10.1145/2933575.2934538,,cs.DM cs.LO,http://creativecommons.org/licenses/by/4.0/,"  We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem
of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1},
\ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic,
we examine the problem of deciding whether there exist non-negative reals
$t_{1}, \ldots, t_{k}$ such that \begin{align*} \prod \limits_{i=1}^{k}
\exp(A_{i} t_{i}) = C . \end{align*} We show that this problem is undecidable
in general, but decidable under the assumption that the matrices $A_{1},
\ldots, A_{k}$ commute. Our results have applications to reachability problems
for linear hybrid automata. Our decidability proof relies on a number of
theorems from algebraic and transcendental number theory, most notably those of
Baker, Kronecker, Lindemann, and Masser, as well as some useful geometric and
linear-algebraic results, including the Minkowski-Weyl theorem and a new (to
the best of our knowledge) result about the uniqueness of strictly upper
triangular matrix logarithms of upper unitriangular matrices. On the other
hand, our undecidability result is shown by reduction from Hilbert's Tenth
Problem.
","[{'version': 'v1', 'created': 'Tue, 19 Jan 2016 17:14:39 GMT'}, {'version': 'v2', 'created': 'Sun, 15 May 2016 17:44:40 GMT'}]",2017-01-18,"[['Ouaknine', 'Joël', ''], ['Pouly', 'Amaury', ''], ['Sousa-Pinto', 'João', ''], ['Worrell', 'James', '']]","['exponential matrices', 'matrix reachability', 'matrix logarithms', 'commuting matrices', 'hybrid automata']"
9566,1403.0448,Yimin Ding,"Yimin Ding, Bin Zhou, Xiaosong Chen",Hybrid evolving clique-networks and their communicability,,,10.1016/j.physa.2014.03.089,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aiming to understand real-world hierarchical networks whose degree
distributions are neither power law nor exponential, we construct a hybrid
clique network that includes both homogeneous and inhomogeneous parts, and
introduce an inhomogeneity parameter to tune the ratio between the homogeneous
part and the inhomogeneous one. We perform Monte-Carlo simulations to study
various properties of such a network, including the degree distribution, the
average shortest-path-length, the clustering coefficient, the clustering
spectrum, and the communicability.
","[{'version': 'v1', 'created': 'Mon, 3 Mar 2014 14:42:35 GMT'}]",2015-06-18,"[['Ding', 'Yimin', ''], ['Zhou', 'Bin', ''], ['Chen', 'Xiaosong', '']]","['complex networks', 'clique', 'hierarchical structure', 'communicability']"
9567,2004.04249,Mojan Javaheripi,"Mojan Javaheripi, Mohammad Samragh, Tara Javidi, Farinaz Koushanfar",GeneCAI: Genetic Evolution for Acquiring Compact AI,,,10.1145/3377930.3390226,,cs.LG cs.CV cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the contemporary big data realm, Deep Neural Networks (DNNs) are evolving
towards more complex architectures to achieve higher inference accuracy. Model
compression techniques can be leveraged to efficiently deploy such
compute-intensive architectures on resource-limited mobile devices. Such
methods comprise various hyper-parameters that require per-layer customization
to ensure high accuracy. Choosing such hyper-parameters is cumbersome as the
pertinent search space grows exponentially with model layers. This paper
introduces GeneCAI, a novel optimization method that automatically learns how
to tune per-layer compression hyper-parameters. We devise a bijective
translation scheme that encodes compressed DNNs to the genotype space. The
optimality of each genotype is measured using a multi-objective score based on
accuracy and number of floating point operations. We develop customized genetic
operations to iteratively evolve the non-dominated solutions towards the
optimal Pareto front, thus, capturing the optimal trade-off between model
accuracy and complexity. GeneCAI optimization method is highly scalable and can
achieve a near-linear performance boost on distributed multi-GPU platforms. Our
extensive evaluations demonstrate that GeneCAI outperforms existing rule-based
and reinforcement learning methods in DNN compression by finding models that
lie on a better accuracy-complexity Pareto curve.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2020 20:56:37 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Apr 2020 04:35:42 GMT'}]",2020-04-15,"[['Javaheripi', 'Mojan', ''], ['Samragh', 'Mohammad', ''], ['Javidi', 'Tara', ''], ['Koushanfar', 'Farinaz', '']]","['Deep Learning', 'Genetic Algorithms', 'Multi-objective Optimization', 'Computer aided/automated design', 'Parallel Optimization']"
9568,2207.04523,Manuel Knott,"Manuel Knott, Fernando Perez-Cruz, Thijs Defraeye",Facilitated machine learning for image-based fruit quality assessment,,,10.1016/j.jfoodeng.2022.111401,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Image-based machine learning models can be used to make the sorting and
grading of agricultural products more efficient. In many regions, implementing
such systems can be difficult due to the lack of centralization and automation
of postharvest supply chains. Stakeholders are often too small to specialize in
machine learning, and large training data sets are unavailable. We propose a
machine learning procedure for images based on pre-trained Vision Transformers.
It is easier to implement than the current standard approach of training
Convolutional Neural Networks (CNNs) as we do not (re-)train deep neural
networks. We evaluate our approach based on two data sets for apple defect
detection and banana ripeness estimation. Our model achieves a competitive
classification accuracy equal to or less than one percent below the
best-performing CNN. At the same time, it requires three times fewer training
samples to achieve a 90% accuracy.
","[{'version': 'v1', 'created': 'Sun, 10 Jul 2022 19:52:20 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Aug 2022 13:32:59 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Jan 2023 01:22:30 GMT'}, {'version': 'v4', 'created': 'Tue, 10 Jan 2023 02:48:59 GMT'}]",2023-01-11,"[['Knott', 'Manuel', ''], ['Perez-Cruz', 'Fernando', ''], ['Defraeye', 'Thijs', '']]","['Machine Learning', 'Computer Vision', 'Food Quality', 'Postharvest']"
9569,2011.06684,Joseph Schuchart,"Joseph Schuchart, Christoph Niethammer and Jos\'e Gracia","Fibers are not (P)Threads: The Case for Loose Coupling of Asynchronous
  Programming Models and MPI Through Continuations","12 pages, 7 figures Published in proceedings of EuroMPI/USA '20,
  September 21-24, 2020, Austin, TX, USA",,10.1145/3416315.3416320,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Asynchronous programming models (APM) are gaining more and more traction,
allowing applications to expose the available concurrency to a runtime system
tasked with coordinating the execution. While MPI has long provided support for
multi-threaded communication and non-blocking operations, it falls short of
adequately supporting APMs as correctly and efficiently handling MPI
communication in different models is still a challenge. Meanwhile, new
low-level implementations of light-weight, cooperatively scheduled execution
contexts (fibers, aka user-level threads (ULT)) are meant to serve as a basis
for higher-level APMs and their integration in MPI implementations has been
proposed as a replacement for traditional POSIX thread support to alleviate
these challenges.
  In this paper, we first establish a taxonomy in an attempt to clearly
distinguish different concepts in the parallel software stack. We argue that
the proposed tight integration of fiber implementations with MPI is neither
warranted nor beneficial and instead is detrimental to the goal of MPI being a
portable communication abstraction. We propose MPI Continuations as an
extension to the MPI standard to provide callback-based notifications on
completed operations, leading to a clear separation of concerns by providing a
loose coupling mechanism between MPI and APMs. We show that this interface is
flexible and interacts well with different APMs, namely OpenMP detached tasks,
OmpSs-2, and Argobots.
","[{'version': 'v1', 'created': 'Thu, 12 Nov 2020 23:21:16 GMT'}]",2021-12-23,"[['Schuchart', 'Joseph', ''], ['Niethammer', 'Christoph', ''], ['Gracia', 'José', '']]","['MPI+X', 'Tasks', 'Continuations', 'OpenMP', 'OmpSs', 'TAMPI', 'Fiber', 'ULT']"
9570,2010.08453,Martin Rosso,"Martin Rosso, Michele Campobasso, Ganduulga Gankhuyag, Luca Allodi","SAIBERSOC: Synthetic Attack Injection to Benchmark and Evaluate the
  Performance of Security Operation Centers","To be published in Annual Computer Security Applications Conference
  (ACSAC 2020), December 7-11, 2020, Austin, USA. ACM, New York, NY, USA, 13
  pages. https://doi.org/10.1145/3427228.3427233, ISBN: 978-1-4503-8858-0/20/12
  Artifact repository: https://gitlab.tue.nl/saibersoc/acsac2020-artifacts",,10.1145/3427228.3427233,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we introduce SAIBERSOC, a tool and methodology enabling
security researchers and operators to evaluate the performance of deployed and
operational Security Operation Centers (SOCs) (or any other security monitoring
infrastructure). The methodology relies on the MITRE ATT&CK Framework to define
a procedure to generate and automatically inject synthetic attacks in an
operational SOC to evaluate any output metric of interest (e.g., detection
accuracy, time-to-investigation, etc.). To evaluate the effectiveness of the
proposed methodology, we devise an experiment with $n=124$ students playing the
role of SOC analysts. The experiment relies on a real SOC infrastructure and
assigns students to either a BADSOC or a GOODSOC experimental condition. Our
results show that the proposed methodology is effective in identifying
variations in SOC performance caused by (minimal) changes in SOC configuration.
We release the SAIBERSOC tool implementation as free and open source software.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2020 15:30:35 GMT'}]",2020-10-19,"[['Rosso', 'Martin', ''], ['Campobasso', 'Michele', ''], ['Gankhuyag', 'Ganduulga', ''], ['Allodi', 'Luca', '']]","['Cyber Security Operations Center', 'SOC', 'Performance', 'Evaluation']"
9571,2004.14826,Amir Hossein Kargaran,"Amir Hossein Kargaran, Mohammad Sadegh Akhondzadeh, Mohammad Reza
  Heidarpour, Mohammad Hossein Manshaei, Kave Salamatian, Masoud Nejad Sattary",Wide-AdGraph: Detecting Ad Trackers with a Wide Dependency Chain Graph,"9 pages, 7 figures, To appear in the 13th ACM Web Science Conference
  2021 (WebSci '21), June 2021",,10.1145/3447535.3462549,,cs.CR cs.CY cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Websites use third-party ads and tracking services to deliver targeted ads
and collect information about users that visit them. These services put users'
privacy at risk, and that is why users' demand for blocking these services is
growing. Most of the blocking solutions rely on crowd-sourced filter lists
manually maintained by a large community of users. In this work, we seek to
simplify the update of these filter lists by combining different websites
through a large-scale graph connecting all resource requests made over a large
set of sites. The features of this graph are extracted and used to train a
machine learning algorithm with the aim of detecting ads and tracking
resources. As our approach combines different information sources, it is more
robust toward evasion techniques that use obfuscation or changing the usage
patterns. We evaluate our work over the Alexa top-10K websites and find its
accuracy to be 96.1% biased and 90.9% unbiased with high precision and recall.
It can also block new ads and tracking services, which would necessitate being
blocked by further crowd-sourced existing filter lists. Moreover, the approach
followed in this paper sheds light on the ecosystem of third-party tracking and
advertising.
","[{'version': 'v1', 'created': 'Wed, 29 Apr 2020 11:28:49 GMT'}, {'version': 'v2', 'created': 'Mon, 10 May 2021 11:43:46 GMT'}]",2021-05-11,"[['Kargaran', 'Amir Hossein', ''], ['Akhondzadeh', 'Mohammad Sadegh', ''], ['Heidarpour', 'Mohammad Reza', ''], ['Manshaei', 'Mohammad Hossein', ''], ['Salamatian', 'Kave', ''], ['Sattary', 'Masoud Nejad', '']]","['Tracking', 'data privacy', 'ad blocking', 'filter lists', 'crowdsource']"
9572,1902.03285,Nikolaj Tatti,Nikolaj Tatti,Fast Sequence Segmentation using Log-Linear Models,,,10.1007/s10618-012-0301-y,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sequence segmentation is a well-studied problem, where given a sequence of
elements, an integer K, and some measure of homogeneity, the task is to split
the sequence into K contiguous segments that are maximally homogeneous. A
classic approach to find the optimal solution is by using a dynamic program.
Unfortunately, the execution time of this program is quadratic with respect to
the length of the input sequence. This makes the algorithm slow for a sequence
of non-trivial length. In this paper we study segmentations whose measure of
goodness is based on log-linear models, a rich family that contains many of the
standard distributions. We present a theoretical result allowing us to prune
many suboptimal segmentations. Using this result, we modify the standard
dynamic program for one-dimensional log-linear models, and by doing so reduce
the computational time. We demonstrate empirically, that this approach can
significantly reduce the computational burden of finding the optimal
segmentation.
","[{'version': 'v1', 'created': 'Fri, 8 Feb 2019 20:42:07 GMT'}]",2019-02-12,"[['Tatti', 'Nikolaj', '']]","['segmentation', 'pruning', 'change-point detection', 'dynamic program']"
9573,1812.08949,\'Etienne Andr\'e,"\'Etienne Andr\'e, Laurent Fribourg, Jean-Marc Mota and Romain Soulat","Verification of an industrial asynchronous leader election algorithm
  using abstractions and parametric model checking","This is the author version of the manuscript of the same name
  published in the proceedings of the 20th International Conference on
  Verification, Model Checking, and Abstract Interpretation (VMCAI 2019)",,10.1007/978-3-030-11245-5_19,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The election of a leader in a network is a challenging task, especially when
the processes are asynchronous, i.e., execute an algorithm with time-varying
periods. Thales developed an industrial election algorithm with an arbitrary
number of processes, that can possibly fail. In this work, we prove the
correctness of a variant of this industrial algorithm. We use a method
combining abstraction, the SafeProver solver, and a parametric timed
model-checker. This allows us to prove the correctness of the algorithm for a
large number p of processes (p=5000).
","[{'version': 'v1', 'created': 'Fri, 21 Dec 2018 05:03:21 GMT'}]",2019-07-05,"[['André', 'Étienne', ''], ['Fribourg', 'Laurent', ''], ['Mota', 'Jean-Marc', ''], ['Soulat', 'Romain', '']]","['leader election', 'distributed algorithm', 'model checking', 'SaveProver', 'parameterized verification', 'parametric timed automata']"
9574,2208.00087,R J Cintra,"R. J. Cintra, S. Duffner, C. Garcia, A. Leite",Low-complexity Approximate Convolutional Neural Networks,"13 pages, 4 figures, 8 tables","IEEE Transactions on Neural Networks and Learning Systems, v. 29,
  n. 12, Dec. 2018",10.1109/TNNLS.2018.2815435,,cs.LG cs.CC cs.CV eess.SP stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present an approach for minimizing the computational
complexity of trained Convolutional Neural Networks (ConvNet). The idea is to
approximate all elements of a given ConvNet and replace the original
convolutional filters and parameters (pooling and bias coefficients; and
activation function) with efficient approximations capable of extreme
reductions in computational complexity. Low-complexity convolution filters are
obtained through a binary (zero-one) linear programming scheme based on the
Frobenius norm over sets of dyadic rationals. The resulting matrices allow for
multiplication-free computations requiring only addition and bit-shifting
operations. Such low-complexity structures pave the way for low-power,
efficient hardware designs. We applied our approach on three use cases of
different complexity: (i) a ""light"" but efficient ConvNet for face detection
(with around 1000 parameters); (ii) another one for hand-written digit
classification (with more than 180000 parameters); and (iii) a significantly
larger ConvNet: AlexNet with $\approx$1.2 million matrices. We evaluated the
overall performance on the respective tasks for different levels of
approximations. In all considered applications, very low-complexity
approximations have been derived maintaining an almost equal classification
performance.
","[{'version': 'v1', 'created': 'Fri, 29 Jul 2022 21:59:29 GMT'}]",2022-08-02,"[['Cintra', 'R. J.', ''], ['Duffner', 'S.', ''], ['Garcia', 'C.', ''], ['Leite', 'A.', '']]","['Convolutional Neural Networks', 'Approximation', 'Optimization', 'Numerical Computation']"
9575,2008.04853,Praveen Damacharla,"Praveen Damacharla, Dhwani Mehta, Ahmad Y Javaid, Vijay K.
  Devabhaktuni","Study on State-of-the-art Cloud Services Integration Capabilities with
  Autonomous Ground Vehicles",,"2018 IEEE 88th Vehicular Technology Conference (VTC-Fall),
  Chicago, IL, USA, 2018, pp. 1-5",10.1109/VTCFall.2018.8690650,,cs.CY cs.CC cs.PF,http://creativecommons.org/licenses/by/4.0/,"  Computing and intelligence are substantial requirements for the accurate
performance of autonomous ground vehicles (AGVs). In this context, the use of
cloud services in addition to onboard computers enhances computing and
intelligence capabilities of AGVs. In addition, the vast amount of data
processed in a cloud system contributes to overall performance and capabilities
of the onboard system. This research study entails a qualitative analysis to
gather insights on the applicability of the leading cloud service providers in
AGV operations. These services include Google Cloud, Microsoft Azure, Amazon
AWS, and IBM Cloud. The study begins with a brief review of AGV technical
requirements that are necessary to determine the rationale for identifying the
most suitable cloud service. The qualitative analysis studies and addresses the
applicability of the cloud service over the proposed generalized AGV's
architecture integration, performance, and manageability. Our findings conclude
that a generalized AGV architecture can be supported by state-of-the-art cloud
service, but there should be a clear line of separation between the primary and
secondary computing needs. Moreover, our results show significant lags while
using cloud services and preventing their use in real-time AGV operation.
","[{'version': 'v1', 'created': 'Tue, 11 Aug 2020 16:56:14 GMT'}]",2020-08-12,"[['Damacharla', 'Praveen', ''], ['Mehta', 'Dhwani', ''], ['Javaid', 'Ahmad Y', ''], ['Devabhaktuni', 'Vijay K.', '']]","['autonomous ground vehicles', 'cloud computing', 'intelligent transportation systems', 'vehicular computing']"
9576,2108.08784,Ravi Kiran Sarvadevabhatla,"Sravya Vardhani Shivapuja, Mansi Pradeep Khamkar, Divij Bajaj, Ganesh
  Ramakrishnan, Ravi Kiran Sarvadevabhatla","Wisdom of (Binned) Crowds: A Bayesian Stratification Paradigm for Crowd
  Counting","Accepted at ACM Multimedia (ACMMM) 2021 . Code, pretrained models and
  interactive visualizations can be viewed at our project page
  https://deepcount.iiit.ac.in/",,10.1145/3474085.3475522,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Datasets for training crowd counting deep networks are typically heavy-tailed
in count distribution and exhibit discontinuities across the count range. As a
result, the de facto statistical measures (MSE, MAE) exhibit large variance and
tend to be unreliable indicators of performance across the count range. To
address these concerns in a holistic manner, we revise processes at various
stages of the standard crowd counting pipeline. To enable principled and
balanced minibatch sampling, we propose a novel smoothed Bayesian sample
stratification approach. We propose a novel cost function which can be readily
incorporated into existing crowd counting deep networks to encourage
strata-aware optimization. We analyze the performance of representative crowd
counting approaches across standard datasets at per strata level and in
aggregate. We analyze the performance of crowd counting approaches across
standard datasets and demonstrate that our proposed modifications noticeably
reduce error standard deviation. Our contributions represent a nuanced,
statistically balanced and fine-grained characterization of performance for
crowd counting approaches. Code, pretrained models and interactive
visualizations can be viewed at our project page https://deepcount.iiit.ac.in/
","[{'version': 'v1', 'created': 'Thu, 19 Aug 2021 16:50:31 GMT'}]",2021-08-20,"[['Shivapuja', 'Sravya Vardhani', ''], ['Khamkar', 'Mansi Pradeep', ''], ['Bajaj', 'Divij', ''], ['Ramakrishnan', 'Ganesh', ''], ['Sarvadevabhatla', 'Ravi Kiran', '']]","['crowd counting', 'deep network', 'performance measure']"
9577,2003.10435,Przemyslaw Musialski,"Kurt Leimer, Andreas Winkler, Stefan Ohrhallinger, Przemyslaw
  Musialski",Pose to Seat: Automated Design of Body-Supporting Surfaces,"14 pages, 15 figures","Computer Aided Geometric Design Volume 79, May 2020, 101855",10.1016/j.cagd.2020.101855,,cs.GR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The design of functional seating furniture is a complicated process which
often requires extensive manual design effort and empirical evaluation. We
propose a computational design framework for pose-driven automated generation
of body-supports which are optimized for comfort of sitting. Given a human body
in a specified pose as input, our method computes an approximate pressure
distribution that also takes frictional forces and body torques into
consideration which serves as an objective measure of comfort. Utilizing this
information to find out where the body needs to be supported in order to
maintain comfort of sitting, our algorithm can create a supporting mesh suited
for a person in that specific pose. This is done in an automated fitting
process, using a template model capable of supporting a large variety of
sitting poses. The results can be used directly or can be considered as a
starting point for further interactive design.
","[{'version': 'v1', 'created': 'Sun, 22 Mar 2020 21:08:52 GMT'}]",2020-07-02,"[['Leimer', 'Kurt', ''], ['Winkler', 'Andreas', ''], ['Ohrhallinger', 'Stefan', ''], ['Musialski', 'Przemyslaw', '']]","['computer-aided design', 'geometric modeling', 'mesh generation', 'mesh optimization']"
9578,2010.11995,Soraia Musse,"Rodolfo M. Favaretto, Roberto R. Santos, Marcio Ballotin, Paulo Knob,
  Soraia R. Musse, Felipe Vilanova, Angelo B. Costa","Investigating Cultural Aspects in the Fundamental Diagram using
  Convolutional Neural Networks and Simulation","Computer Animation and Virtual Worlds, 2019",,10.1002/cav.1899,,cs.OH cs.CV cs.GR physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a study regarding group behavior in a controlled
experiment focused on differences in an important attribute that vary across
cultures -- the personal spaces -- in two Countries: Brazil and Germany. In
order to coherently compare Germany and Brazil evolutions with same population
applying same task, we performed the pedestrian Fundamental Diagram experiment
in Brazil, as performed in Germany. We use CNNs to detect and track people in
video sequences. With this data, we use Voronoi Diagrams to find out the
neighbor relation among people and then compute the walking distances to find
out the personal spaces. Based on personal spaces analyses, we found out that
people behavior is more similar, in terms of their behaviours, in high dense
populations and vary more in low and medium densities. So, we focused our study
on cultural differences between the two Countries in low and medium densities.
Results indicate that personal space analyses can be a relevant feature in
order to understand cultural aspects in video sequences. In addition to the
cultural differences, we also investigate the personality model in crowds,
using OCEAN. We also proposed a way to simulate the FD experiment from other
countries using the OCEAN psychological traits model as input. The simulated
countries were consistent with the literature.
","[{'version': 'v1', 'created': 'Wed, 30 Sep 2020 14:44:04 GMT'}]",2020-10-26,"[['Favaretto', 'Rodolfo M.', ''], ['Santos', 'Roberto R.', ''], ['Ballotin', 'Marcio', ''], ['Knob', 'Paulo', ''], ['Musse', 'Soraia R.', ''], ['Vilanova', 'Felipe', ''], ['Costa', 'Angelo B.', '']]","['Group behaviors', 'Cultural aspects', 'Convolutional Neural']"
9579,2011.03424,Sara Latifi,"Sara Latifi, Noemi Mauro, Dietmar Jannach","Session-aware Recommendation: A Surprising Quest for the
  State-of-the-art",,,10.1016/j.ins.2021.05.048,,cs.IR cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender systems are designed to help users in situations of information
overload. In recent years, we observed increased interest in session-based
recommendation scenarios, where the problem is to make item suggestions to
users based only on interactions observed in an ongoing session. However, in
cases where interactions from previous user sessions are available, the
recommendations can be personalized according to the users' long-term
preferences, a process called session-aware recommendation. Today, research in
this area is scattered and many existing works only compare session-aware with
session-based models. This makes it challenging to understand what represents
the state-of-the-art. To close this research gap, we benchmarked recent
session-aware algorithms against each other and against a number of
session-based recommendation algorithms and trivial extensions thereof. Our
comparison, to some surprise, revealed that (i) item simple techniques based on
nearest neighbors consistently outperform recent neural techniques and that
(ii) session-aware models were mostly not better than approaches that do not
use long-term preference information. Our work therefore not only points to
potential methodological issues where new methods are compared to weak
baselines, but also indicates that there remains a huge potential for more
sophisticated session-aware recommendation algorithms.
","[{'version': 'v1', 'created': 'Fri, 6 Nov 2020 15:18:01 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Sep 2021 12:28:10 GMT'}]",2021-09-15,"[['Latifi', 'Sara', ''], ['Mauro', 'Noemi', ''], ['Jannach', 'Dietmar', '']]","['Session-aware Recommendation', 'Evaluation', 'Reproducibility']"
9580,2201.00893,Yibin Wang,"Yibin Wang, Haifeng Wang, Zhaohua Peng","Rice Diseases Detection and Classification Using Attention Based Neural
  Network and Bayesian Optimization",,"Expert Systems with Applications, 178, 114770. (2021)",10.1016/j.eswa.2021.114770,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this research, an attention-based depthwise separable neural network with
Bayesian optimization (ADSNN-BO) is proposed to detect and classify rice
disease from rice leaf images. Rice diseases frequently result in 20 to 40 \%
corp production loss in yield and is highly related to the global economy.
Rapid disease identification is critical to plan treatment promptly and reduce
the corp losses. Rice disease diagnosis is still mainly performed manually. To
achieve AI assisted rapid and accurate disease detection, we proposed the
ADSNN-BO model based on MobileNet structure and augmented attention mechanism.
Moreover, Bayesian optimization method is applied to tune hyper-parameters of
the model. Cross-validated classification experiments are conducted based on a
public rice disease dataset with four categories in total. The experimental
results demonstrate that our mobile compatible ADSNN-BO model achieves a test
accuracy of 94.65\%, which outperforms all of the state-of-the-art models
tested. To check the interpretability of our proposed model, feature analysis
including activation map and filters visualization approach are also conducted.
Results show that our proposed attention-based mechanism can more effectively
guide the ADSNN-BO model to learn informative features. The outcome of this
research will promote the implementation of artificial intelligence for fast
plant disease diagnosis and control in the agricultural field.
","[{'version': 'v1', 'created': 'Mon, 3 Jan 2022 22:26:00 GMT'}]",2022-01-05,"[['Wang', 'Yibin', ''], ['Wang', 'Haifeng', ''], ['Peng', 'Zhaohua', '']]","['Deep learning', 'Rice diseases detection', 'Plant disease', 'Agriculture image analysis']"
9581,2108.13166,Bensingh Dhas,"Bensingh Dhas, Jamun Kumar N, Debasish Roy and J N Reddy","A mixed variational principle in nonlinear elasticity using Cartan's
  moving frame and implementation with finite element exterior calculus",arXiv admin note: text overlap with arXiv:2009.00275,,10.1016/j.cma.2022.114756,,cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This article offers a new perspective for the mechanics of solids using
moving Cartan's frame, specifically discussing a mixed variational principle in
non-linear elasticity. We treat quantities defined on the co-tangent bundles of
reference and deformed configurations as additional unknowns. Such a treatment
invites compatibility of the fields with base-space (configurations of the
body), so that the configuration can be realised as a subset of the Euclidean
space. We first rewrite the metric and connection using differential forms,
which are further utilised to write the deformation gradient and Cauchy-Green
deformation tensor in terms of frame and co-frame fields. The geometric
understanding of stress as a co-vector valued 2-form fits squarely within our
overall program. We show that, for a hyperelastic solid, an equation similar to
the Doyle-Erciksen formula may be written for the co-vector part of stress.
Using these, we write a mixed energy functional in terms of differential forms,
whose extremum leads to the compatibility of deformation, constitutive rules
and equations of equilibrium. Finite element exterior calculus is then utilised
to construct a finite dimensional approximation for the differential forms
appearing in the variational principle. These approximations are then used to
construct a discrete functional which is then numerically extremised. This
discertization leads to a mixed method as it uses independent approximations
for differential forms related to stress and deformation gradient. The mixed
variational principle is then specialized for 2D case, whose discrete
approximation is applied to problems in nonlinear elasticity. An important
feature of our FE technique is the lack of additional stabilization. From the
numerical study, it is found that the present discretization also does not
suffer form locking and related convergence issues.
","[{'version': 'v1', 'created': 'Wed, 11 Aug 2021 11:01:11 GMT'}]",2022-04-06,"[['Dhas', 'Bensingh', ''], ['N', 'Jamun Kumar', ''], ['Roy', 'Debasish', ''], ['Reddy', 'J N', '']]","['non-linear elasticity', 'differential forms', 'Cartan’s moving frame', 'kinematic closure', 'HuWashizu variational principle', 'finite element exterior calculus']"
9582,2008.04165,Alasdair Hill,"Alasdair Hill, Ekaterina Komendantskaya, Ronald P. A. Petrick",Proof-Carrying Plans: a Resource Logic for AI Planning,"PPDP 2020, 13 pages, 9 figures",,10.1145/3414080.3414094,,cs.LO cs.AI cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent trends in AI verification and Explainable AI have raised the question
of whether AI planning techniques can be verified. In this paper, we present a
novel resource logic, the Proof Carrying Plans (PCP) logic that can be used to
verify plans produced by AI planners. The PCP logic takes inspiration from
existing resource logics (such as Linear logic and Separation logic) as well as
Hoare logic when it comes to modelling states and resource-aware plan
execution. It also capitalises on the Curry-Howard approach to logics, in its
treatment of plans as functions and plan pre- and post-conditions as types.
This paper presents two main results. From the theoretical perspective, we show
that the PCP logic is sound relative to the standard possible world semantics
used in AI planning. From the practical perspective, we present a complete Agda
formalisation of the PCP logic and of its soundness proof. Moreover, we
showcase the Curry-Howard, or functional, value of this implementation by
supplementing it with the library that parses AI plans into Agda's proofs
automatically. We provide evaluation of this library and the resulting Agda
functions.
","[{'version': 'v1', 'created': 'Mon, 10 Aug 2020 14:45:52 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Oct 2020 03:49:19 GMT'}]",2020-10-29,"[['Hill', 'Alasdair', ''], ['Komendantskaya', 'Ekaterina', ''], ['Petrick', 'Ronald P. A.', '']]","['AI planning', 'Verification', 'Resource Logics', 'TheoremProving', 'Dependent Types']"
9583,2108.10619,Peiling Yi,Peiling Yi and Arkaitz Zubiaga,"Weakly Supervised Cross-platform Teenager Detection with Adversarial
  BERT","6 pages,1 figure,3 tables",,10.1145/3465336.3475105,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Teenager detection is an important case of the age detection task in social
media, which aims to detect teenage users to protect them from negative
influences. The teenager detection task suffers from the scarcity of labelled
data, which exacerbates the ability to perform well across social media
platforms. To further research in teenager detection in settings where no
labelled data is available for a platform, we propose a novel cross-platform
framework based on Adversarial BERT. Our framework can operate with a limited
amount of labelled instances from the source platform and with no labelled data
from the target platform, transferring knowledge from the source to the target
social media. We experiment on four publicly available datasets, obtaining
results demonstrating that our framework can significantly improve over
competitive baseline models on the cross-platform teenager detection task.
","[{'version': 'v1', 'created': 'Tue, 24 Aug 2021 10:10:40 GMT'}]",2021-08-25,"[['Yi', 'Peiling', ''], ['Zubiaga', 'Arkaitz', '']]","['Natural language processing', 'Age detection', 'Deep transfer learning', 'BERT']"
9584,2106.07417,Bin Han,"Yasameen Shihab Hamad, Bin Han, and Osman Nuri ucan",Online Estimation of Resource Overload Risk in 5G Multi-Tenancy Network,To appear at ESREL 2021,"Proceedings of the 31st European Safety and Reliability
  Conference, 2021",10.3850/978-981-18-2016-8_095-cd,,cs.NI eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The technology of network slicing, as the most characteristic feature of the
fifth generation (5G) wireless networks, manages the resources and network
functions in heterogeneous and logically isolated slices on the top of a shared
physical infrastructure, where every slice can be independently customized to
fulfill the specific requirements of its devoted service type. It enables a new
paradigm of multi-tenancy networking, where the network slices can be leased by
the mobile network operator (MNO) to tenants in form of public cloud computing
service, known as Slice-asa- Service (SlaaS). Similar to classical cloud
computing scenarios, SlaaS benefits from overbooking its resources to numerous
tenants, taking advantage of the resource elasticity and diversity, at a price
of risking overloading network resources and violating the service-level
agreements (SLAs), which stipulate the quality of service (QoS) that shall be
guaranteed to the network slices. Thus, it becomes a critical challenge to the
MNOs, accurately estimating the resource overload risk - especially under the
sophisticated network dynamics - for monitoring and enhancing the reliability
of SlaaS business.
","[{'version': 'v1', 'created': 'Mon, 14 Jun 2021 13:27:46 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Jun 2021 08:28:34 GMT'}]",2021-10-06,"[['Hamad', 'Yasameen Shihab', ''], ['Han', 'Bin', ''], ['ucan', 'Osman Nuri', '']]","['Outage control', 'modeling', '5G', 'network slicing', 'multi-tenancy', 'estimation']"
9585,1805.00556,Stefano Markidis Prof.,"Sai Narasimhamurthy, Nikita Danilov, Sining Wu, Ganesan Umanesan,
  Stefano Markidis, Sergio Rivas-Gomez, Ivy Bo Peng, Erwin Laure, Dirk Pleiter,
  Shaun de Witt",SAGE: Percipient Storage for Exascale Data Centric Computing,,"Parallel Computing, 23 March 2018",10.1016/j.parco.2018.03.002,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We aim to implement a Big Data/Extreme Computing (BDEC) capable system
infrastructure as we head towards the era of Exascale computing - termed SAGE
(Percipient StorAGe for Exascale Data Centric Computing). The SAGE system will
be capable of storing and processing immense volumes of data at the Exascale
regime, and provide the capability for Exascale class applications to use such
a storage infrastructure. SAGE addresses the increasing overlaps between Big
Data Analysis and HPC in an era of next-generation data centric computing that
has developed due to the proliferation of massive data sources, such as large,
dispersed scientific instruments and sensors, whose data needs to be processed,
analyzed and integrated into simulations to derive scientific and innovative
insights. Indeed, Exascale I/O, as a problem that has not been sufficiently
dealt with for simulation codes, is appropriately addressed by the SAGE
platform. The objective of this paper is to discuss the software architecture
of the SAGE system and look at early results we have obtained employing some of
its key methodologies, as the system continues to evolve.
","[{'version': 'v1', 'created': 'Tue, 1 May 2018 21:20:31 GMT'}]",2018-05-03,"[['Narasimhamurthy', 'Sai', ''], ['Danilov', 'Nikita', ''], ['Wu', 'Sining', ''], ['Umanesan', 'Ganesan', ''], ['Markidis', 'Stefano', ''], ['Rivas-Gomez', 'Sergio', ''], ['Peng', 'Ivy Bo', ''], ['Laure', 'Erwin', ''], ['Pleiter', 'Dirk', ''], ['de Witt', 'Shaun', '']]","['SAGE Architecture', 'Object storage', 'Mero', 'Clovis', 'PGAS I/O', 'MPI I/O', 'MPI Streams']"
9586,1909.05052,Timo Koch,"Timo Koch, Dennis Gl\""aser, Kilian Weishaupt, Sina Ackermann, Martin
  Beck, Beatrix Becker, Samuel Burbulla, Holger Class, Edward Coltman, Simon
  Emmert, Thomas Fetzer, Christoph Gr\""uninger, Katharina Heck, Johannes
  Hommel, Theresa Kurz, Melanie Lipp, Farid Mohammadi, Samuel Scherrer, Martin
  Schneider, Gabriele Seitz, Leopold Stadler, Martin Utz, Felix Weinhardt,
  Bernd Flemisch","DuMu$^\text{x}$ 3 -- an open-source simulator for solving flow and
  transport problems in porous media with a focus on model coupling",,,10.1016/j.camwa.2020.02.012,,cs.CE cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present version 3 of the open-source simulator for flow and transport
processes in porous media DuMu$^\text{x}$. DuMu$^\text{x}$ is based on the
modular C++ framework Dune (Distributed and Unified Numerics Environment) and
is developed as a research code with a focus on modularity and reusability. We
describe recent efforts in improving the transparency and efficiency of the
development process and community-building, as well as efforts towards quality
assurance and reproducible research. In addition to a major redesign of many
simulation components in order to facilitate setting up complex simulations in
DuMu$^\text{x}$, version 3 introduces a more consistent abstraction of finite
volume schemes. Finally, the new framework for multi-domain simulations is
described, and three numerical examples demonstrate its flexibility.
","[{'version': 'v1', 'created': 'Wed, 11 Sep 2019 13:48:47 GMT'}]",2020-03-23,"[['Koch', 'Timo', ''], ['Gläser', 'Dennis', ''], ['Weishaupt', 'Kilian', ''], ['Ackermann', 'Sina', ''], ['Beck', 'Martin', ''], ['Becker', 'Beatrix', ''], ['Burbulla', 'Samuel', ''], ['Class', 'Holger', ''], ['Coltman', 'Edward', ''], ['Emmert', 'Simon', ''], ['Fetzer', 'Thomas', ''], ['Grüninger', 'Christoph', ''], ['Heck', 'Katharina', ''], ['Hommel', 'Johannes', ''], ['Kurz', 'Theresa', ''], ['Lipp', 'Melanie', ''], ['Mohammadi', 'Farid', ''], ['Scherrer', 'Samuel', ''], ['Schneider', 'Martin', ''], ['Seitz', 'Gabriele', ''], ['Stadler', 'Leopold', ''], ['Utz', 'Martin', ''], ['Weinhardt', 'Felix', ''], ['Flemisch', 'Bernd', '']]","['porous media', 'multi-phase flow', 'Dune', 'coupled problems', 'open-source software', 'research software']"
9587,2110.12937,Sascha El-Sharkawy,"Klaus Schmid, Sascha El-Sharkawy, Christian Kr\""oher","Improving Software Engineering Research through Experimentation
  Workbenches",,"ter Beek M., Fantechi A., Semini L. (eds) From Software
  Engineering to Formal Methods and Tools, and Back. Lecture Notes in Computer
  Science, vol 11865, 2019, pages 67-82",10.1007/978-3-030-30985-5_6,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Experimentation with software prototypes plays a fundamental role in software
engineering research. In contrast to many other scientific disciplines,
however, explicit support for this key activity in software engineering is
relatively small. While some approaches to improve this situation have been
proposed by the software engineering community, experiments are still very
difficult and sometimes impossible to replicate. In this paper, we propose the
concept of an experimentation workbench as a means of explicit support for
experimentation in software engineering research. In particular, we discuss
core requirements that an experimentation workbench should satisfy in order to
qualify as such and to offer a real benefit for researchers. Beyond their core
benefits for experimentation, we stipulate that experimentation workbenches
will also have benefits in regard to reproducibility and repeatability of
software engineering research. Further, we illustrate this concept with a
scenario and a case study, and describe relevant challenges as well as our
experience with experimentation workbenches.
","[{'version': 'v1', 'created': 'Mon, 25 Oct 2021 13:16:14 GMT'}]",2021-10-26,"[['Schmid', 'Klaus', ''], ['El-Sharkawy', 'Sascha', ''], ['Kröher', 'Christian', '']]","['Experimentation workbench', 'empirical software engineering', 'static analysis', 'software product line analysis']"
9588,2103.11300,Zhenyu Shi,"Zhenyu Shi, Wei Wei, Xiangnan Feng, Ruizhi Zhang and Zhiming Zheng","Effects of Dynamic-Win-Stay-Lose-Learn model with voluntary
  participation in social dilemma","13 pages,9 figures",,10.1016/j.chaos.2021.111269,,cs.GT cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, Win-Stay-Lose-Learn rule has attracted wide attention as an
effective strategy updating rule, and voluntary participation is proposed by
introducing a third strategy in Prisoner's dilemma game. Some researches show
that combining Win-Stay-Lose-Learn rule with voluntary participation could
promote cooperation more significantly under moderate temptation values,
however, cooperators' survival under high aspiration levels and high temptation
values is still a challenging problem. In this paper, inspired by Achievement
Motivation Theory, a Dynamic-Win-Stay-Lose-Learn rule with voluntary
participation is investigated, where a dynamic aspiration process is introduced
to describe the co-evolution of individuals' strategies and aspirations. It is
found that cooperation is extremely promoted and defection is almost extinct in
our model, even when the initial aspiration levels and temptation values are
high. The combination of dynamic aspiration and voluntary participation plays
an active role since loners could survive under high initial aspiration levels
and they will expand stably because of their fixed payoffs. The robustness of
our model is also discussed and some adverse structures are found which should
be alerted in the evolutionary process. Our work provides a more realistic
model and shows that cooperators may prevail defectors in an unfavorable
initial environment.
","[{'version': 'v1', 'created': 'Sun, 21 Mar 2021 04:30:49 GMT'}]",2021-08-18,"[['Shi', 'Zhenyu', ''], ['Wei', 'Wei', ''], ['Feng', 'Xiangnan', ''], ['Zhang', 'Ruizhi', ''], ['Zheng', 'Zhiming', '']]","['Prisoner’s dilemma game', 'Dynamic aspiration', 'Cooperation', 'Spatial evolutionary game']"
9589,1902.05478,Marcos Eduardo Valle,Fidelis Zanetti de Castro and Marcos Eduardo Valle,"A Broad Class of Discrete-Time Hypercomplex-Valued Hopfield Neural
  Networks",,,10.1016/j.neunet.2019.09.040,,cs.LG math.DS stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we address the stability of a broad class of discrete-time
hypercomplex-valued Hopfield-type neural networks. To ensure the neural
networks belonging to this class always settle down at a stationary state, we
introduce novel hypercomplex number systems referred to as real-part
associative hypercomplex number systems. Real-part associative hypercomplex
number systems generalize the well-known Cayley-Dickson algebras and real
Clifford algebras and include the systems of real numbers, complex numbers,
dual numbers, hyperbolic numbers, quaternions, tessarines, and octonions as
particular instances. Apart from the novel hypercomplex number systems, we
introduce a family of hypercomplex-valued activation functions called
$\mathcal{B}$-projection functions. Broadly speaking, a
$\mathcal{B}$-projection function projects the activation potential onto the
set of all possible states of a hypercomplex-valued neuron. Using the theory
presented in this paper, we confirm the stability analysis of several
discrete-time hypercomplex-valued Hopfield-type neural networks from the
literature. Moreover, we introduce and provide the stability analysis of a
general class of Hopfield-type neural networks on Cayley-Dickson algebras.
","[{'version': 'v1', 'created': 'Thu, 14 Feb 2019 16:21:49 GMT'}, {'version': 'v2', 'created': 'Thu, 30 May 2019 11:55:45 GMT'}, {'version': 'v3', 'created': 'Thu, 31 Oct 2019 12:54:32 GMT'}]",2019-11-01,"[['de Castro', 'Fidelis Zanetti', ''], ['Valle', 'Marcos Eduardo', '']]","['Hopfield neural network', 'hypercomplex-valued neural network', 'stability']"
9590,2108.10565,Sebastian Wolf,"Sebastian Wolf and Martin Galis and Carsten Uphoff and Alice-Agnes
  Gabriel and Peter Moczo and David Gregor and Michael Bader","An Efficient ADER-DG Local Time Stepping Scheme for 3D HPC Simulation of
  Seismic Waves in Poroelastic Media","37 pages, 18 figures, published in the Journal of Computational
  Physics","Journal of Computational Physics: Volume 455, 2022",10.1016/j.jcp.2021.110886,,cs.DC cs.MS physics.comp-ph physics.geo-ph,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Many applications from geosciences require simulations of seismic waves in
porous media. Biot's theory of poroelasticity describes the coupling between
solid and fluid phases and introduces a stiff source term, thereby increasing
computational cost and motivating efficient methods utilising High-Performance
Computing. We present a novel realisation of the discontinuous Galerkin scheme
with Arbitrary DERivative time stepping (ADER-DG) that copes with stiff source
terms.
  To integrate this source term with a reasonable time step size, we use an
element-local space-time predictor, which needs to solve medium-sized linear
systems - with 1000 to 10000 unknowns - in each element update (i.e., billions
of times). We present a novel block-wise back-substitution algorithm for
solving these systems efficiently. In comparison to LU decomposition, we reduce
the number of floating-point operations by a factor of up to 25. The block-wise
back-substitution is mapped to a sequence of small matrix-matrix
multiplications, for which code generators are available to generate highly
optimised code.
  We verify the new solver thoroughly in problems of increasing complexity. We
demonstrate high-order convergence for 3D problems. We verify the correct
treatment of point sources, material interfaces and traction-free boundary
conditions. In addition, we compare against a finite difference code for a
newly defined layer over half-space problem. We find that extremely high
accuracy is required to resolve the slow P-wave at a free surface, while solid
particle velocities are not affected by coarser resolutions. By using a
clustered local time stepping scheme, we reduce time to solution by a factor of
6 to 10 compared to global time stepping. We conclude our study with a scaling
and performance analysis, demonstrating our implementation's efficiency and its
potential for extreme-scale simulations.
","[{'version': 'v1', 'created': 'Tue, 24 Aug 2021 08:04:13 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Aug 2021 07:14:38 GMT'}, {'version': 'v3', 'created': 'Tue, 1 Mar 2022 08:30:49 GMT'}]",2022-03-02,"[['Wolf', 'Sebastian', ''], ['Galis', 'Martin', ''], ['Uphoff', 'Carsten', ''], ['Gabriel', 'Alice-Agnes', ''], ['Moczo', 'Peter', ''], ['Gregor', 'David', ''], ['Bader', 'Michael', '']]","['Poroelasticity', 'Discontinuous Galerkin', 'Wave Propagation', 'High Performance Computing(HPC)', 'Computational Seismology', 'ADER-DG']"
9591,2106.07384,Mohammad Rahaman,"Mohammad Saiedur Rahaman, Wei Shao, Flora D. Salim, Ayad Turky, Andy
  Song, Jeffrey Chan, Junliang Jiang, Doug Bradbrook",MoParkeR : Multi-objective Parking Recommendation,"6 pages, 5 figures",,10.1145/3468791.3468810,,cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Existing parking recommendation solutions mainly focus on finding and
suggesting parking spaces based on the unoccupied options only. However, there
are other factors associated with parking spaces that can influence someone's
choice of parking such as fare, parking rule, walking distance to destination,
travel time, likelihood to be unoccupied at a given time. More importantly,
these factors may change over time and conflict with each other which makes the
recommendations produced by current parking recommender systems ineffective. In
this paper, we propose a novel problem called multi-objective parking
recommendation. We present a solution by designing a multi-objective parking
recommendation engine called MoParkeR that considers various conflicting
factors together. Specifically, we utilise a non-dominated sorting technique to
calculate a set of Pareto-optimal solutions, consisting of recommended
trade-off parking spots. We conduct extensive experiments using two real-world
datasets to show the applicability of our multi-objective recommendation
methodology.
","[{'version': 'v1', 'created': 'Thu, 10 Jun 2021 10:57:09 GMT'}]",2021-06-15,"[['Rahaman', 'Mohammad Saiedur', ''], ['Shao', 'Wei', ''], ['Salim', 'Flora D.', ''], ['Turky', 'Ayad', ''], ['Song', 'Andy', ''], ['Chan', 'Jeffrey', ''], ['Jiang', 'Junliang', ''], ['Bradbrook', 'Doug', '']]","['Parking sensor', 'multi-objective optimization', 'parking recommendation', 'Pareto front']"
9592,2011.02980,Suthee Ruangwises,Suthee Ruangwises,Using Five Cards to Encode Each Integer in $\mathbb{Z}/6\mathbb{Z}$,This paper has appeared at SecITC 2021,,10.1007/978-3-031-17510-7_12,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Research in secure multi-party computation using a deck of playing cards,
often called card-based cryptography, dates back to 1989 when Den Boer
introduced the ""five-card trick"" to compute the logical AND function. Since
then, many protocols to compute different functions have been developed. In
this paper, we propose a new encoding scheme that uses five cards to encode
each integer in $\mathbb{Z}/6\mathbb{Z}$. Using this encoding scheme, we
develop protocols that can copy a commitment with 13 cards, add two integers
with 10 cards, and multiply two integers with 14 cards. All of our protocols
are the currently best known protocols in terms of the required number of
cards. Our encoding scheme can be generalized to encode integers in
$\mathbb{Z}/n\mathbb{Z}$ for other values of $n$ as well.
","[{'version': 'v1', 'created': 'Thu, 5 Nov 2020 17:12:09 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Dec 2020 20:57:44 GMT'}, {'version': 'v3', 'created': 'Sun, 30 May 2021 15:53:09 GMT'}, {'version': 'v4', 'created': 'Tue, 25 Oct 2022 09:25:33 GMT'}]",2022-10-26,"[['Ruangwises', 'Suthee', '']]","['card-based cryptography', 'secure multi-party computation', 'function', 'ring of integers modulo n']"
9593,1507.01285,Andres Monroy-Hernandez,"Andr\'es Monroy-Hern\'andez, Benjamin Mako Hill, Jazmin
  Gonzalez-Rivero, Danah Boyd","Computers Can't Give Credit: How Automatic Attribution Falls Short in an
  Online Remixing Community","Proceedings of the SIGCHI Conference on Human Factors in Computing
  Systems (CHI 2011), Best paper honorable mention, 10 pages",,10.1145/1978942.1979452,,cs.HC cs.CY cs.SI,http://creativecommons.org/licenses/by-sa/4.0/,"  In this paper, we explore the role that attribution plays in shaping user
reactions to content reuse, or remixing, in a large user-generated content
community. We present two studies using data from the Scratch online community
-- a social media platform where hundreds of thousands of young people share
and remix animations and video games. First, we present a quantitative analysis
that examines the effects of a technological design intervention introducing
automated attribution of remixes on users' reactions to being remixed. We
compare this analysis to a parallel examination of ""manual"" credit-giving.
Second, we present a qualitative analysis of twelve in-depth, semi-structured,
interviews with Scratch participants on the subject of remixing and
attribution. Results from both studies suggest that automatic attribution done
by technological systems (i.e., the listing of names of contributors) plays a
role that is distinct from, and less valuable than, credit which may
superficially involve identical information but takes on new meaning when it is
given by a human remixer. We discuss the implications of these findings for the
designers of online communities and social media platforms.
","[{'version': 'v1', 'created': 'Sun, 5 Jul 2015 22:05:40 GMT'}]",2021-08-02,"[['Monroy-Hernández', 'Andrés', ''], ['Hill', 'Benjamin Mako', ''], ['Gonzalez-Rivero', 'Jazmin', ''], ['Boyd', 'Danah', '']]","['remixing', 'attribution', 'credit-giving', 'user-generated content', 'online communities']"
9594,2108.01207,Jose Franceli,Jos\'e Carlos Franceli and Silvia Novaes Zilber Turri,"Adoption Factors of Enabling I4.0 Technologies and Benefits in the
  Supply Chain","16 pages, 10 figures, 2nd International Conference on Cloud, Big Data
  and IoT (CBIoT 2021)","David C. Wyld et al. (Eds): ITCSE, ICDIPV, NC, CBIoT, CAIML,
  CRYPIS, ICAIT, NLCA - 2021 pp. 81-96, 2021. CS & IT - CSCP 2021",10.5121/csit.2021.110908,,cs.OH,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Industry 4.0 technologies is a new paradigm of integration of cyber-physical
systems and information and communication solutions. This topic has been
vaguely explored in social sciences; hence this study attempts to bridge this
gap by investigating adoption process, based on I4.0 technologies. This paper
aims to identify the barriers and benefits generated in the Supply Chain
through a systematic literature review. The results present a framework that
connects adoption factors, enabling technologies of I4.0, and benefits to the
Supply Chain. innovations to be adopted.
","[{'version': 'v1', 'created': 'Mon, 2 Aug 2021 23:24:22 GMT'}]",2021-10-05,"[['Franceli', 'José Carlos', ''], ['Turri', 'Silvia Novaes Zilber', '']]","['IoT', 'Supply Chain', 'Digital Transformation', 'I4.0', 'Adoption']"
9595,2012.05318,"Mika H\""am\""al\""ainen","Mika H\""am\""al\""ainen, Niko Partanen, Khalid Alnajjar",Normalization of Different Swedish Dialects Spoken in Finland,"In Proceedings of the 4th ACM SIGSPATIAL Workshop on Geospatial
  Humanities (GeoHumanities'20)",,10.1145/3423337.3429435,,cs.CL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Our study presents a dialect normalization method for different Finland
Swedish dialects covering six regions. We tested 5 different models, and the
best model improved the word error rate from 76.45 to 28.58. Contrary to
results reported in earlier research on Finnish dialects, we found that
training the model with one word at a time gave best results. We believe this
is due to the size of the training data available for the model. Our models are
accessible as a Python package. The study provides important information about
the adaptability of these methods in different contexts, and gives important
baselines for further study.
","[{'version': 'v1', 'created': 'Wed, 9 Dec 2020 20:59:31 GMT'}]",2020-12-11,"[['Hämäläinen', 'Mika', ''], ['Partanen', 'Niko', ''], ['Alnajjar', 'Khalid', '']]","['dialect normalization', 'regional languages', 'non-standard language']"
9596,1412.3289,Inibehe Akpannah,Inibehe Emmanuel Akpannah,"Optimization of Software Quality Using Management and Technical Review
  Techniques",5 Pages and 1 figure,"Optimization of Software Quality using Management and Technical
  Review Techniques- International Journal of Computer Trends and Technology by
  IJCTTJournal Volume-17 Number-6 Year of Publication : 2014 Authors :Inibehe
  Emmanuel Akpannah",10.14445/22312803/IJCTT-V17P154,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optimizing the quality of software is a function of the degree of reviews
made during the early life of a software development process. Reviews detect
errors and potential errors early in the software development process. The
errors detected during the early life cycle of software are least expensive to
correct. Efficient involvement in software inspections and technical reviews,
help developers improve their own skills, thereby mitigating the occurrence of
errors in the later stage of software development process. The ideas gathered
on this paper point that a properly implemented program of technical and
management reviews drastically reduces the time as well as the cost required
for testing, debugging, and reworking, and dramatically improves the quality of
the resulting product. This paper, Optimization of Software Quality using
management and technical Review Techniques, provides its readers with the
opportunity to learn about and experience using this indispensable software
quality tools.
","[{'version': 'v1', 'created': 'Wed, 10 Dec 2014 12:56:42 GMT'}]",2014-12-11,"[['Akpannah', 'Inibehe Emmanuel', '']]","['Optimization', 'quality', 'management', 'technical', 'review']"
9597,2205.11622,Adhitha Dias,"Adhitha Dias, Kirshanthan Sundararajah, Charitha Saumya, Milind
  Kulkarni","SparseLNR: Accelerating Sparse Tensor Computations Using Loop Nest
  Restructuring",Accepted at International Conference on Supercomputing (ICS) '22,,10.1145/3524059.3532386,,cs.PL cs.PF,http://creativecommons.org/licenses/by/4.0/,"  Sparse tensor algebra computations have become important in many real-world
applications like machine learning, scientific simulations, and data mining.
Hence, automated code generation and performance optimizations for tensor
algebra kernels are paramount. Recent advancements such as the Tensor Algebra
Compiler (TACO) greatly generalize and automate the code generation for tensor
algebra expressions. However, the code generated by TACO for many important
tensor computations remains suboptimal due to the absence of a scheduling
directive to support transformations such as distribution/fusion.
  This paper extends TACO's scheduling space to support kernel
distribution/loop fusion in order to reduce asymptotic time complexity and
improve locality of complex tensor algebra computations. We develop an
intermediate representation (IR) for tensor operations called branched
iteration graph which specifies breakdown of the computation into smaller ones
(kernel distribution) and then fuse (loop fusion) outermost dimensions of the
loop nests, while the innermost dimensions are distributed, to increase data
locality. We describe exchanges of intermediate results between space iteration
spaces, transformation in the IR, and its programmatic invocation. Finally, we
show that the transformation can be used to optimize sparse tensor kernels. Our
results show that this new transformation significantly improves the
performance of several real-world tensor algebra computations compared to
TACO-generated code.
","[{'version': 'v1', 'created': 'Mon, 23 May 2022 20:47:42 GMT'}]",2022-05-25,"[['Dias', 'Adhitha', ''], ['Sundararajah', 'Kirshanthan', ''], ['Saumya', 'Charitha', ''], ['Kulkarni', 'Milind', '']]","['Sparse Tensor Algebra', 'Loop Transformations', 'Kernel Distribution', 'Loop Fusion']"
9598,2107.06802,Novanto Yudistira,"Kuncahyo Setyo Nugroho, Anantha Yullian Sukmadewa, Haftittah
  Wuswilahaken DW, Fitra Abdurrachman Bachtiar, Novanto Yudistira","BERT Fine-Tuning for Sentiment Analysis on Indonesian Mobile Apps
  Reviews",,"SIET '21: 6th International Conference on Sustainable Information
  Engineering and Technology 2021",10.1145/3479645.3479679,,cs.CL cs.LG,http://creativecommons.org/licenses/by/4.0/,"  User reviews have an essential role in the success of the developed mobile
apps. User reviews in the textual form are unstructured data, creating a very
high complexity when processed for sentiment analysis. Previous approaches that
have been used often ignore the context of reviews. In addition, the relatively
small data makes the model overfitting. A new approach, BERT, has been
introduced as a transfer learning model with a pre-trained model that has
previously been trained to have a better context representation. This study
examines the effectiveness of fine-tuning BERT for sentiment analysis using two
different pre-trained models. Besides the multilingual pre-trained model, we
use the pre-trained model that only has been trained in Indonesian. The dataset
used is Indonesian user reviews of the ten best apps in 2020 in Google Play
sites. We also perform hyper-parameter tuning to find the optimum trained
model. Two training data labeling approaches were also tested to determine the
effectiveness of the model, which is score-based and lexicon-based. The
experimental results show that pre-trained models trained in Indonesian have
better average accuracy on lexicon-based data. The pre-trained Indonesian model
highest accuracy is 84%, with 25 epochs and a training time of 24 minutes.
These results are better than all of the machine learning and multilingual
pre-trained models.
","[{'version': 'v1', 'created': 'Wed, 14 Jul 2021 16:00:15 GMT'}]",2021-11-05,"[['Nugroho', 'Kuncahyo Setyo', ''], ['Sukmadewa', 'Anantha Yullian', ''], ['DW', 'Haftittah Wuswilahaken', ''], ['Bachtiar', 'Fitra Abdurrachman', ''], ['Yudistira', 'Novanto', '']]","['BERT fine-tuning', 'Sentiment analysis', 'Apps review']"
9599,1910.00034,Laltu Sardar,Laltu Sardar and Sushmita Ruj,FSPVDsse: A Forward Secure Publicly Verifiable Dynamic SSE scheme,"17 pages, Published in ProvSec 2019","Provable Security (2019), 355-371",10.1007/978-3-030-31919-9_23,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A symmetric searchable encryption (SSE) scheme allows a client (data owner)
to search on encrypted data outsourced to an untrusted cloud server. The search
may either be a single keyword search or a complex query search like
conjunctive or Boolean keyword search. Information leakage is quite high for
dynamic SSE, where data might be updated. It has been proven that to avoid this
information leakage an SSE scheme with dynamic data must be forward private. A
dynamic SSE scheme is said to be forward private, if adding a keyword-document
pair does not reveal any information about the previous search result with that
keyword.
  In SSE setting, the data owner has very low computation and storage power. In
this setting, though some schemes achieve forward privacy with
honest-but-curious cloud, it becomes difficult to achieve forward privacy when
the server is malicious, meaning that it can alter the data. Verifiable dynamic
SSE requires the server to give a proof of the result of the search query. The
data owner can verify this proof efficiently. In this paper, we have proposed a
generic publicly verifiable dynamic SSE (DSSE) scheme that makes any forward
private DSSE scheme verifiable without losing forward privacy. The proposed
scheme does not require any extra storage at owner-side and requires minimal
computational cost as well for the owner. Moreover, we have compared our scheme
with the existing results and show that our scheme is practical.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2019 18:04:20 GMT'}]",2019-10-02,"[['Sardar', 'Laltu', ''], ['Ruj', 'Sushmita', '']]","['Searchable encryption', 'Forward privacy', 'Verifiability', 'BLS signature', 'Cloud computing']"
9600,2109.03505,Dong Li,"Yongbiao Wan, Pidong Wang, Feng Huang, Jun Yuan, Dong Li, Kun Chen,
  Jianbin Kang, Qian Li, Taiping Zhang, Song Sun, Zhiguang Qiu and Yao Yao","Bionic Optical Physical Unclonable Functions for Authentication and
  Encryption",,,10.1039/D1TC02883A,,cs.CR cond-mat.mtrl-sci physics.optics,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information security is of great importance for modern society with all
things connected. Physical unclonable function (PUF) as a promising hardware
primitive has been intensively studied for information security. However, the
widely investigated silicon PUF with low entropy is vulnerable to various
attacks. Herein, we introduce a concept of bionic optical PUFs inspired from
unique biological architectures, and fabricate four types of bionic PUFs by
molding the surface micro-nano structures of natural plant tissues with a
simple, low-cost, green and environmentally friendly manufacturing process. The
laser speckle responses of all bionic PUFs are statistically demonstrated to be
random, unique, unpredictable and robust enough for cryptographic applications,
indicating the broad applicability of bionic PUFs. On this ground, the
feasibility of implementing bionic PUFs as cryptographic primitives in entity
authentication and encrypted communication is experimentally validated, which
shows its promising potential in the application of future information
security.
","[{'version': 'v1', 'created': 'Wed, 8 Sep 2021 09:02:30 GMT'}]",2021-09-09,"[['Wan', 'Yongbiao', ''], ['Wang', 'Pidong', ''], ['Huang', 'Feng', ''], ['Yuan', 'Jun', ''], ['Li', 'Dong', ''], ['Chen', 'Kun', ''], ['Kang', 'Jianbin', ''], ['Li', 'Qian', ''], ['Zhang', 'Taiping', ''], ['Sun', 'Song', ''], ['Qiu', 'Zhiguang', ''], ['Yao', 'Yao', '']]","['physical unclonable functions (PUF)', 'bionic film', 'PDMS', 'cryptographic']"
9601,2109.10535,Quentin Duchemin,"Xiaoxia Zhang, Quentin Duchemin, Kangning Liu, Sebastian Flassbeck,
  Cem Gultekin, Carlos Fernandez-Granda, Jakob Assl\""ander","Cram\'er-Rao bound-informed training of neural networks for quantitative
  MRI","Xiaoxia Zhang, Quentin Duchemin, and Kangning Liu contributed equally
  to this work",,10.1002/mrm.29206,,cs.LG eess.IV physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural networks are increasingly used to estimate parameters in quantitative
MRI, in particular in magnetic resonance fingerprinting. Their advantages over
the gold standard non-linear least square fitting are their superior speed and
their immunity to the non-convexity of many fitting problems. We find, however,
that in heterogeneous parameter spaces, i.e. in spaces in which the variance of
the estimated parameters varies considerably, good performance is hard to
achieve and requires arduous tweaking of the loss function, hyper parameters,
and the distribution of the training data in parameter space. Here, we address
these issues with a theoretically well-founded loss function: the Cram\'er-Rao
bound (CRB) provides a theoretical lower bound for the variance of an unbiased
estimator and we propose to normalize the squared error with respective CRB.
With this normalization, we balance the contributions of hard-to-estimate and
not-so-hard-to-estimate parameters and areas in parameter space, and avoid a
dominance of the former in the overall training loss. Further, the CRB-based
loss function equals one for a maximally-efficient unbiased estimator, which we
consider the ideal estimator. Hence, the proposed CRB-based loss function
provides an absolute evaluation metric. We compare a network trained with the
CRB-based loss with a network trained with the commonly used means squared
error loss and demonstrate the advantages of the former in numerical, phantom,
and in vivo experiments.
","[{'version': 'v1', 'created': 'Wed, 22 Sep 2021 06:38:03 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Oct 2021 12:58:01 GMT'}]",2022-04-20,"[['Zhang', 'Xiaoxia', ''], ['Duchemin', 'Quentin', ''], ['Liu', 'Kangning', ''], ['Flassbeck', 'Sebastian', ''], ['Gultekin', 'Cem', ''], ['Fernandez-Granda', 'Carlos', ''], ['Assländer', 'Jakob', '']]","['quantitative MRI', 'objective function', 'deep learning', 'parameter estimation', 'magnetic transfer (MT)', 'magneticfingerprinting (MRF)']"
9602,2008.01023,Yu Han,"Yu Han, Shuai Yang, Wenjing Wang, Jiaying Liu",From Design Draft to Real Attire: Unaligned Fashion Image Translation,"Accepted by ACMMM 2020. Our project website is available at:
  https://victoriahy.github.io/MM2020/",,10.1145/3394171.3413953,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fashion manipulation has attracted growing interest due to its great
application value, which inspires many researches towards fashion images.
However, little attention has been paid to fashion design draft. In this paper,
we study a new unaligned translation problem between design drafts and real
fashion items, whose main challenge lies in the huge misalignment between the
two modalities. We first collect paired design drafts and real fashion item
images without pixel-wise alignment. To solve the misalignment problem, our
main idea is to train a sampling network to adaptively adjust the input to an
intermediate state with structure alignment to the output. Moreover, built upon
the sampling network, we present design draft to real fashion item translation
network (D2RNet), where two separate translation streams that focus on texture
and shape, respectively, are combined tactfully to get both benefits. D2RNet is
able to generate realistic garments with both texture and shape consistency to
their design drafts. We show that this idea can be effectively applied to the
reverse translation problem and present R2DNet accordingly. Extensive
experiments on unaligned fashion design translation demonstrate the superiority
of our method over state-of-the-art methods. Our project website is available
at: https://victoriahy.github.io/MM2020/ .
","[{'version': 'v1', 'created': 'Mon, 3 Aug 2020 17:03:11 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Aug 2020 03:02:40 GMT'}, {'version': 'v3', 'created': 'Wed, 16 Sep 2020 12:27:01 GMT'}]",2020-09-17,"[['Han', 'Yu', ''], ['Yang', 'Shuai', ''], ['Wang', 'Wenjing', ''], ['Liu', 'Jiaying', '']]","['Fashion design', 'image-to-image translation', 'unaligned data', 'bidirectional translation']"
9603,1708.03889,Sven Hug,"Lutz Bornmann, Robin Haunschild, Sven E. Hug","Visualizing the context of citations referencing papers published by
  Eugene Garfield: A new type of keyword co-occurrence analysis",,,10.1007/s11192-017-2591-8,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During Eugene Garfield's (EG's) lengthy career as information scientist, he
published about 1,500 papers. In this study, we use the impressive oeuvre of EG
to introduce a new type of bibliometric networks: keyword co-occurrences
networks based on the context of citations, which are referenced in a certain
paper set (here: the papers published by EG). The citation context is defined
by the words which are located around a specific citation. We retrieved the
citation context from Microsoft Academic. To interpret and compare the results
of the new network type, we generated two further networks: co-occurrence
networks which are based on title and abstract keywords from (1) EG's papers
and (2) the papers citing EG's publications. The comparison of the three
networks suggests that papers of EG and citation contexts of papers citing EG
are semantically more closely related to each other than to titles and
abstracts of papers citing EG. This result accords with the use of citations in
research evaluation that is based on the premise that citations reflect the
cognitive influence of the cited on the citing publication.
","[{'version': 'v1', 'created': 'Sun, 13 Aug 2017 11:16:28 GMT'}]",2019-08-06,"[['Bornmann', 'Lutz', ''], ['Haunschild', 'Robin', ''], ['Hug', 'Sven E.', '']]","['bibliometrics', 'Eugene Garfield', 'citation context analysis', 'co-occurrence network']"
9604,2208.12715,Patrick Ebel,"Patrick Ebel, Kim Julian G\""ulle, Christoph Lingenfelder, Andreas
  Vogelsang","ICEBOAT: An Interactive User Behavior Analysis Tool for Automotive User
  Interfaces","The Adjunct Publication of the 35th Annual ACM Symposium on User
  Interface Software and Technology",,10.1145/3526114.3558739,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we present ICEBOAT an interactive tool that enables automotive
UX experts to explore how users interact with In-vehicle Information Systems.
Based on large naturalistic driving data continuously collected from production
line vehicles, ICEBOAT visualizes drivers' interactions and driving behavior on
different levels of detail. Hence, it allows to easily compare different user
flows based on performance- and safety-related metrics.
","[{'version': 'v1', 'created': 'Fri, 26 Aug 2022 15:17:31 GMT'}]",2022-08-29,"[['Ebel', 'Patrick', ''], ['Gülle', 'Kim Julian', ''], ['Lingenfelder', 'Christoph', ''], ['Vogelsang', 'Andreas', '']]","['Human-Computer Interaction', 'In-Vehicle Information System', 'Design Tools', 'Naturalistic Driving Data', 'Data Visualization']"
9605,2108.11436,Siyang Wang,"Siyang Wang, Simon Alexanderson, Joakim Gustafson, Jonas Beskow,
  Gustav Eje Henter, \'Eva Sz\'ekely",Integrated Speech and Gesture Synthesis,"9 pages, accepted at ICMI 2021",,10.1145/3462244.3479914,,cs.HC cs.GR cs.LG cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Text-to-speech and co-speech gesture synthesis have until now been treated as
separate areas by two different research communities, and applications merely
stack the two technologies using a simple system-level pipeline. This can lead
to modeling inefficiencies and may introduce inconsistencies that limit the
achievable naturalness. We propose to instead synthesize the two modalities in
a single model, a new problem we call integrated speech and gesture synthesis
(ISG). We also propose a set of models modified from state-of-the-art neural
speech-synthesis engines to achieve this goal. We evaluate the models in three
carefully-designed user studies, two of which evaluate the synthesized speech
and gesture in isolation, plus a combined study that evaluates the models like
they will be used in real-world applications -- speech and gesture presented
together. The results show that participants rate one of the proposed
integrated synthesis models as being as good as the state-of-the-art pipeline
system we compare against, in all three tests. The model is able to achieve
this with faster synthesis time and greatly reduced parameter count compared to
the pipeline system, illustrating some of the potential benefits of treating
speech and gesture synthesis together as a single, unified problem. Videos and
code are available on our project page at https://swatsw.github.io/isg_icmi21/
","[{'version': 'v1', 'created': 'Wed, 25 Aug 2021 19:04:00 GMT'}]",2021-08-27,"[['Wang', 'Siyang', ''], ['Alexanderson', 'Simon', ''], ['Gustafson', 'Joakim', ''], ['Beskow', 'Jonas', ''], ['Henter', 'Gustav Eje', ''], ['Székely', 'Éva', '']]","['neural networks', 'speech synthesis', 'gesture generation']"
9606,2212.03327,Stefano Scanzio,"Maurizio Mongelli, Stefano Scanzio","A neural approach to synchronization in wireless networks with
  heterogeneous sources of noise","preprint, 18 pages","Ad Hoc Networks, vol. 49, pp. 1-16, October 2016",10.1016/j.adhoc.2016.06.002,,cs.NI cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The paper addresses state estimation for clock synchronization in the
presence of factors affecting the quality of synchronization. Examples are
temperature variations and delay asymmetry. These working conditions make
synchronization a challenging problem in many wireless environments, such as
Wireless Sensor Networks or WiFi. Dynamic state estimation is investigated as
it is essential to overcome non-stationary noises. The two-way timing message
exchange synchronization protocol has been taken as a reference. No a-priori
assumptions are made on the stochastic environments and no temperature
measurement is executed. The algorithms are unequivocally specified offline,
without the need of tuning some parameters in dependence of the working
conditions. The presented approach reveals to be robust to a large set of
temperature variations, different delay distributions and levels of asymmetry
in the transmission path.
","[{'version': 'v1', 'created': 'Tue, 6 Dec 2022 21:14:38 GMT'}]",2022-12-08,"[['Mongelli', 'Maurizio', ''], ['Scanzio', 'Stefano', '']]","['Clock synchronization protocols', 'Dynamic state estimation', 'Two-way timing message exchange', 'WSN', 'WiFi']"
9607,2208.06793,Zehra Yigit,"Zehra Yigit, Ertugrul Basar, Ibrahim Altunbas",Over-the-Air Beamforming with Reconfigurable Intelligent Surfaces,to appear in Frontiers in Communications and Networks,,10.3389/frcmn.2022.1016270,,cs.IT eess.SP math.IT,http://creativecommons.org/licenses/by/4.0/,"  Reconfigurable intelligent surface (RIS)-empowered communication is a
revolutionary technology that enables to manipulate wireless propagation
environment via smartly controllable low-cost reflecting surfaces. However, in
order to outperform conventional communication systems, an RIS-aided system
with solely passive reflection requires an extremely large surface. To meet
this challenge, the concept of active RIS, which performs simultaneous
amplification and reflection on the incident signal at the expense of
additional power consumption, has been recently introduced. In this paper,
deploying an active RIS, we propose a novel beamforming concept, over-the-air
beamforming, for RIS-aided multi-user multiple-input single-output (MISO)
transmission schemes without requiring any pre/post signal processing hardware
designs at the transmitter and receiver sides. In the proposed over-the-air
beamforming-based transmission scheme, the reflection coefficients of the
active RIS elements are customized to maximize the sum-rate gain. To tackle
this issue, first, a non-convex quadratically constrained quadratic programming
(QCQP) problem is formulated. Then, using semidefinite relaxation (SDR)
approach, this optimization problem is converted to a convex feasibility
problem, which is efficiently solved using the CVX optimization toolbox.
Moreover, taking inspiration from this beamforming technique, a novel high-rate
receive index modulation (IM) scheme with a low-complexity sub-optimal detector
is developed. Through comprehensive simulation results, the sum-rate and bit
error rate (BER) performance of the proposed designs are investigated.
","[{'version': 'v1', 'created': 'Sun, 14 Aug 2022 06:40:02 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Aug 2022 20:05:34 GMT'}, {'version': 'v3', 'created': 'Sun, 11 Dec 2022 12:20:08 GMT'}]",2022-12-13,"[['Yigit', 'Zehra', ''], ['Basar', 'Ertugrul', ''], ['Altunbas', 'Ibrahim', '']]","['Reconfigurable intelligent surface (RIS)', 'active RIS', 'over-the-air beamforming', 'multi-user (MU) transmission', 'index']"
9608,2003.05434,Silverio Mart\'inez-Fern\'andez,"Silverio Mart\'inez-Fern\'andez, Xavier Franch, Andreas Jedlitschka,
  Marc Oriol, and Adam Trendowicz","Developing and Operating Artificial Intelligence Models in Trustworthy
  Autonomous Systems","9 pages, 1 figure, preprint. Accepted in RCIS 2021",,10.1007/978-3-030-75018-3_14,,cs.SE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Companies dealing with Artificial Intelligence (AI) models in Autonomous
Systems (AS) face several problems, such as users' lack of trust in adverse or
unknown conditions, gaps between software engineering and AI model development,
and operation in a continuously changing operational environment. This
work-in-progress paper aims to close the gap between the development and
operation of trustworthy AI-based AS by defining an approach that coordinates
both activities. We synthesize the main challenges of AI-based AS in industrial
settings. We reflect on the research efforts required to overcome these
challenges and propose a novel, holistic DevOps approach to put it into
practice. We elaborate on four research directions: (a) increased users' trust
by monitoring operational AI-based AS and identifying self-adaptation needs in
critical situations; (b) integrated agile process for the development and
evolution of AI models and AS; (c) continuous deployment of different
context-specific instances of AI models in a distributed setting of AS; and (d)
holistic DevOps-based lifecycle for AI-based AS.
","[{'version': 'v1', 'created': 'Wed, 11 Mar 2020 17:52:30 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Apr 2021 09:21:38 GMT'}]",2021-04-26,"[['Martínez-Fernández', 'Silverio', ''], ['Franch', 'Xavier', ''], ['Jedlitschka', 'Andreas', ''], ['Oriol', 'Marc', ''], ['Trendowicz', 'Adam', '']]","['DevOps', 'Autonomous Systems', 'AI', 'Trustworthiness']"
9609,1904.09283,Rathish Das,"Rathish Das, Shih-Yu Tsai, Sharmila Duppala, Jayson Lynch, Esther M.
  Arkin, Rezaul Chowdhury, Joseph S. B. Mitchell, and Steven Skiena","Data Races and the Discrete Resource-time Tradeoff Problem with Resource
  Reuse over Paths",,,10.1145/3323165.3323209,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A determinacy race occurs if two or more logically parallel instructions
access the same memory location and at least one of them tries to modify its
content. Races often lead to nondeterministic and incorrect program behavior. A
data race is a special case of a determinacy race which can be eliminated by
associating a mutual-exclusion lock or allowing atomic accesses to the memory
location. However, such solutions can reduce parallelism by serializing all
accesses to that location. For associative and commutative updates, reducers
allow parallel race-free updates at the expense of using some extra space. We
ask the following question. Given a fixed budget of extra space to mitigate the
cost of races in a parallel program, which memory locations should be assigned
reducers and how should the space be distributed among the reducers in order to
minimize the overall running time? We argue that the races can be captured by a
directed acyclic graph (DAG), with nodes representing memory cells and arcs
representing read-write dependencies between cells. We then formulate our
optimization problem on DAGs. We concentrate on a variation of this problem
where space reuse among reducers is allowed by routing extra space along a
source to sink path of the DAG and using it in the construction of reducers
along the path. We consider two reducers and the corresponding duration
functions (i.e., reduction time as a function of space budget). We generalize
our race-avoiding space-time tradeoff problem to a discrete resource-time
tradeoff problem with general non-increasing duration functions and resource
reuse over paths. For general DAGs, the offline problem is strongly NP-hard
under all three duration functions, and we give approximation algorithms. We
also prove hardness of approximation for the general resource-time tradeoff
problem and give a pseudo-polynomial time algorithm for series-parallel DAGs.
","[{'version': 'v1', 'created': 'Fri, 19 Apr 2019 17:48:35 GMT'}]",2019-04-22,"[['Das', 'Rathish', ''], ['Tsai', 'Shih-Yu', ''], ['Duppala', 'Sharmila', ''], ['Lynch', 'Jayson', ''], ['Arkin', 'Esther M.', ''], ['Chowdhury', 'Rezaul', ''], ['Mitchell', 'Joseph S. B.', ''], ['Skiena', 'Steven', '']]","['Parallel and Distributed Algorithms', 'Multi-Core Architectures', 'Resource Management and Awareness', 'Scheduling Problems']"
9610,1909.02988,Jens Grubert,"Anna Eiberger and Per Ola Kristensson and Susanne Mayr and Matthias
  Kranz and Jens Grubert","Effects of Depth Layer Switching between an Optical See-Through
  Head-Mounted Display and a Body-Proximate Display",,"Symposium on Spatial User Interaction (SUI '19), October 19--20,
  2019, New Orleans, LA, USA",10.1145/3357251.3357588,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optical see-through head-mounted displays (OST HMDs) typically display
virtual content at a fixed focal distance while users need to integrate this
information with real-world information at different depth layers. This problem
is pronounced in body-proximate multi-display systems, such as when an OST HMD
is combined with a smartphone or smartwatch. While such joint systems open up a
new design space, they also reduce users' ability to integrate visual
information. We quantify this cost by presenting the results of an experiment
(n=24) that evaluates human performance in a visual search task across an OST
HMD and a body-proximate display at 30 cm. The results reveal that task
completion time increases significantly by approximately 50 % and the error
rate increases significantly by approximately 100 % compared to visual search
on a single depth layer. These results highlight a design trade-off when
designing joint OST HMD-body proximate display systems.
","[{'version': 'v1', 'created': 'Fri, 6 Sep 2019 16:04:52 GMT'}]",2019-09-09,"[['Eiberger', 'Anna', ''], ['Kristensson', 'Per Ola', ''], ['Mayr', 'Susanne', ''], ['Kranz', 'Matthias', ''], ['Grubert', 'Jens', '']]","['augmented reality', 'perception', 'multi-display environments', 'accomodation', 'vergence']"
9611,2203.08207,Pei Xu,"Pei Xu, Jean-Bernard Hayet, Ioannis Karamouzas",SocialVAE: Human Trajectory Prediction using Timewise Latents,"In the 17th European Conference on Computer Vision (ECCV 2022). Code:
  https://github.com/xupei0610/SocialVAE","Computer Vision -- ECCV 2022. ECCV 2022. Lecture Notes in Computer
  Science, vol 13664, page 511--528",10.1007/978-3-031-19772-7_30,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predicting pedestrian movement is critical for human behavior analysis and
also for safe and efficient human-agent interactions. However, despite
significant advancements, it is still challenging for existing approaches to
capture the uncertainty and multimodality of human navigation decision making.
In this paper, we propose SocialVAE, a novel approach for human trajectory
prediction. The core of SocialVAE is a timewise variational autoencoder
architecture that exploits stochastic recurrent neural networks to perform
prediction, combined with a social attention mechanism and a backward posterior
approximation to allow for better extraction of pedestrian navigation
strategies. We show that SocialVAE improves current state-of-the-art
performance on several pedestrian trajectory prediction benchmarks, including
the ETH/UCY benchmark, Stanford Drone Dataset, and SportVU NBA movement
dataset. Code is available at: https://github.com/xupei0610/SocialVAE.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2022 19:14:33 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Mar 2022 14:25:40 GMT'}, {'version': 'v3', 'created': 'Sat, 23 Jul 2022 02:37:58 GMT'}, {'version': 'v4', 'created': 'Sun, 31 Jul 2022 18:56:18 GMT'}]",2022-11-01,"[['Xu', 'Pei', ''], ['Hayet', 'Jean-Bernard', ''], ['Karamouzas', 'Ioannis', '']]","['Human Trajectory Prediction', 'Multimodal Prediction', 'Timewise Variational Autoencoder']"
9612,2007.10938,Francesca Noardo,"Francesca Noardo, Ken Arroyo Ohori, Filip Biljecki, Claire Ellul, Lars
  Harrie, Thomas Krijnen, Helen Eriksson, Jordi van Liempt, Maria Pla, Antonio
  Ruiz, Dean Hintz, Nina Krueger, Cristina Leoni, Leire Leoz, Diana Moraru,
  Stelios Vitalis, Philipp Willkomm, Jantien Stoter","Reference study of CityGML software support: the GeoBIM benchmark 2019
  -- Part II",preprint of the paper,"Transactions in GIS, ISSN: 1361-1682, 2020",10.1111/tgis.12710,,cs.DB,http://creativecommons.org/licenses/by/4.0/,"  OGC CityGML is an open standard for 3D city models intended to foster
interoperability and support various applications. However, through our
practical experience and discussions with practitioners, we have noticed
several problems related to the implementation of the standard and the use of
standardized data. Nevertheless, a systematic investigation of these issues has
never been performed, and there is thus insufficient evidence that can be used
for tackling the problems. The GeoBIM benchmark project is aimed at finding
such evidence by involving external volunteers, reporting on tools behaviour
about relevant aspects (geometry, semantics, georeferencing, functionalities),
analysed and described in this paper. This study explicitly pointed out the
critical points embedded in the format as an evidence base for future
development. This paper is in tandem with Part I, describing the results of the
benchmark related to IFC, counterpart of CityGML within building information
modelling.
","[{'version': 'v1', 'created': 'Tue, 21 Jul 2020 16:55:36 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jan 2021 17:28:40 GMT'}]",2021-01-08,"[['Noardo', 'Francesca', ''], ['Ohori', 'Ken Arroyo', ''], ['Biljecki', 'Filip', ''], ['Ellul', 'Claire', ''], ['Harrie', 'Lars', ''], ['Krijnen', 'Thomas', ''], ['Eriksson', 'Helen', ''], ['van Liempt', 'Jordi', ''], ['Pla', 'Maria', ''], ['Ruiz', 'Antonio', ''], ['Hintz', 'Dean', ''], ['Krueger', 'Nina', ''], ['Leoni', 'Cristina', ''], ['Leoz', 'Leire', ''], ['Moraru', 'Diana', ''], ['Vitalis', 'Stelios', ''], ['Willkomm', 'Philipp', ''], ['Stoter', 'Jantien', '']]","['CityGML', '3D city models', 'standards', 'data models', 'software support', 'interoperability', 'GeoBIM']"
9613,2012.02454,Jerome Darmont,"J\'er\^ome Darmont (ERIC), C\'ecile Favre (ERIC), Sabine Loudcher
  (ERIC), Camille No\^us",Data Lakes for Digital Humanities,Data and Digital Humanities Track,"2nd International Digital Tools & Uses Congress (DTUC 2020), Oct
  2020, Hammamet, Tunisia. pp.38-41",10.1145/3423603.3424004,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional data in Digital Humanities projects bear various formats
(structured, semi-structured, textual) and need substantial transformations
(encoding and tagging, stemming, lemmatization, etc.) to be managed and
analyzed. To fully master this process, we propose the use of data lakes as a
solution to data siloing and big data variety problems. We describe data lake
projects we currently run in close collaboration with researchers in humanities
and social sciences and discuss the lessons learned running these projects.
","[{'version': 'v1', 'created': 'Fri, 4 Dec 2020 08:18:48 GMT'}]",2020-12-07,"[['Darmont', 'Jérôme', '', 'ERIC'], ['Favre', 'Cécile', '', 'ERIC'], ['Loudcher', 'Sabine', '', 'ERIC'], ['Noûs', 'Camille', '']]","['Data Lakes', 'Digital Humanities', 'Metadata']"
9614,1602.06818,Yubao Sun,"Yubao Sun, Renlong Hang, Qingshan Liu, Fuping Zhu, Hucheng Pei","Graph Regularized Low Rank Representation for Aerosol Optical Depth
  Retrieval","16 pages, 6 figures",,10.1080/01431161.2016.1249302,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel data-driven regression model for aerosol
optical depth (AOD) retrieval. First, we adopt a low rank representation (LRR)
model to learn a powerful representation of the spectral response. Then, graph
regularization is incorporated into the LRR model to capture the local
structure information and the nonlinear property of the remote-sensing data.
Since it is easy to acquire the rich satellite-retrieval results, we use them
as a baseline to construct the graph. Finally, the learned feature
representation is feeded into support vector machine (SVM) to retrieve AOD.
Experiments are conducted on two widely used data sets acquired by different
sensors, and the experimental results show that the proposed method can achieve
superior performance compared to the physical models and other state-of-the-art
empirical models.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2016 15:31:19 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Mar 2016 16:03:39 GMT'}]",2016-11-23,"[['Sun', 'Yubao', ''], ['Hang', 'Renlong', ''], ['Liu', 'Qingshan', ''], ['Zhu', 'Fuping', ''], ['Pei', 'Hucheng', '']]","['Aerosol optical depth (AOD)', 'physical model', 'empirical model', 'low rank representation (LRR)', 'graph regular']"
9615,2206.00783,Marios Papachristou,"Marios Papachristou, Jon Kleinberg",Core-periphery Models for Hypergraphs,Accepted at as a research track paper at KDD 2022,,10.1145/3534678.3539272,,cs.SI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  We introduce a random hypergraph model for core-periphery structure. By
leveraging our model's sufficient statistics, we develop a novel statistical
inference algorithm that is able to scale to large hypergraphs with runtime
that is practically linear wrt. the number of nodes in the graph after a
preprocessing step that is almost linear in the number of hyperedges, as well
as a scalable sampling algorithm. Our inference algorithm is capable of
learning embeddings that correspond to the reputation (rank) of a node within
the hypergraph. We also give theoretical bounds on the size of the core of
hypergraphs generated by our model. We experiment with hypergraph data that
range to $\sim 10^5$ hyperedges mined from the Microsoft Academic Graph, Stack
Exchange, and GitHub and show that our model outperforms baselines wrt.
producing good fits.
","[{'version': 'v1', 'created': 'Wed, 1 Jun 2022 22:11:44 GMT'}]",2022-06-03,"[['Papachristou', 'Marios', ''], ['Kleinberg', 'Jon', '']]","['hypergraph', 'core-periphery networks', 'inference']"
9616,2110.08753,Quan Li,"Quan Li, Haipeng Zeng, Zhenhui Peng, Xiaojuan Ma","Understanding Players' Interaction Patterns with Mobile Game App UI via
  Visualizations",Chinese CHI 2021,,10.1145/3490355.3490357,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Understanding how players interact with the mobile game app on smartphone
devices is important for game experts to develop and refine their app products.
Conventionally, the game experts achieve their purposes through intensive user
studies with target players or iterative UI design processes, which can not
capture interaction patterns of large-scale individual players. Visualizing the
recorded logs of users' UI operations is a promising way for quantitatively
understanding the interaction patterns. However, few visualization tools have
been developed for mobile game app interaction, which is challenging with
multi-touch dynamic operations and complex UI. In this work, we fill the gap by
presenting a visualization approach that aims to understand players'
interaction patterns in a multi-touch gaming app with more complex interactions
supported by joysticks and a series of skill buttons. Particularly, we identify
players' dynamic gesture patterns, inspect the similarities and differences of
gesture behaviors, and explore the potential gaps between the current mobile
game app UI design and the real-world practice of players. Three case studies
indicate that our approach is promising and can be potentially complementary to
theoretical UI designs for further research.
","[{'version': 'v1', 'created': 'Sun, 17 Oct 2021 08:10:03 GMT'}]",2021-10-19,"[['Li', 'Quan', ''], ['Zeng', 'Haipeng', ''], ['Peng', 'Zhenhui', ''], ['Ma', 'Xiaojuan', '']]","['gesture trajectory', 'mobile game interface', 'visualization']"
9617,2002.03140,Qiming Bao,"Qiming Bao, Lin Ni and Jiamou Liu","HHH: An Online Medical Chatbot System based on Knowledge Graph and
  Hierarchical Bi-Directional Attention","10 pages, 9 figures, 3 tables. Proceedings of the Australasian
  Computer Science Week Multiconference (ACSW 2020)",,10.1145/3373017.3373049,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a chatbot framework that adopts a hybrid model which
consists of a knowledge graph and a text similarity model. Based on this
chatbot framework, we build HHH, an online question-and-answer (QA) Healthcare
Helper system for answering complex medical questions. HHH maintains a
knowledge graph constructed from medical data collected from the Internet. HHH
also implements a novel text representation and similarity deep learning model,
Hierarchical BiLSTM Attention Model (HBAM), to find the most similar question
from a large QA dataset. We compare HBAM with other state-of-the-art language
models such as bidirectional encoder representation from transformers (BERT)
and Manhattan LSTM Model (MaLSTM). We train and test the models with a subset
of the Quora duplicate questions dataset in the medical area. The experimental
results show that our model is able to achieve a superior performance than
these existing methods.
","[{'version': 'v1', 'created': 'Sat, 8 Feb 2020 11:06:27 GMT'}]",2020-02-11,"[['Bao', 'Qiming', ''], ['Ni', 'Lin', ''], ['Liu', 'Jiamou', '']]","['Hierarchial BiLSTM attention model', 'natural language processing', 'knowledge graph', 'question answering', 'medical chatbot']"
9618,1909.12927,Basemah Alshemali,"Basemah Alshemali, Alta Graham, Jugal Kalita",Toward Robust Image Classification,"2019 Intelligent Systems Conference, pp 483-489","Intelligent Systems and Applications. IntelliSys 2019. Advances in
  Intelligent Systems and Computing, vol 1038. Springer, Cham",10.1007/978-3-030-29513-4,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural networks are frequently used for image classification, but can be
vulnerable to misclassification caused by adversarial images. Attempts to make
neural network image classification more robust have included variations on
preprocessing (cropping, applying noise, blurring), adversarial training, and
dropout randomization. In this paper, we implemented a model for adversarial
detection based on a combination of two of these techniques: dropout
randomization with preprocessing applied to images within a given Bayesian
uncertainty. We evaluated our model on the MNIST dataset, using adversarial
images generated using Fast Gradient Sign Method (FGSM), Jacobian-based
Saliency Map Attack (JSMA) and Basic Iterative Method (BIM) attacks. Our model
achieved an average adversarial image detection accuracy of 97%, with an
average image classification accuracy, after discarding images flagged as
adversarial, of 99%. Our average detection accuracy exceeded that of recent
papers using similar techniques.
","[{'version': 'v1', 'created': 'Thu, 19 Sep 2019 21:08:13 GMT'}]",2019-10-01,"[['Alshemali', 'Basemah', ''], ['Graham', 'Alta', ''], ['Kalita', 'Jugal', '']]","['Adversarial examples', 'Robust image classification', 'Bayesianuncertainty', 'Image cropping']"
9619,2004.01703,Jacob Schrum,Jacob Schrum and Vanessa Volz and Sebastian Risi,"CPPN2GAN: Combining Compositional Pattern Producing Networks and GANs
  for Large-scale Pattern Generation",GECCO 2020. arXiv admin note: text overlap with arXiv:2004.00151,,10.1145/3377930.3389822,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generative Adversarial Networks (GANs) are proving to be a powerful indirect
genotype-to-phenotype mapping for evolutionary search, but they have
limitations. In particular, GAN output does not scale to arbitrary dimensions,
and there is no obvious way of combining multiple GAN outputs into a cohesive
whole, which would be useful in many areas, such as the generation of video
game levels. Game levels often consist of several segments, sometimes repeated
directly or with variation, organized into an engaging pattern. Such patterns
can be produced with Compositional Pattern Producing Networks (CPPNs).
Specifically, a CPPN can define latent vector GAN inputs as a function of
geometry, which provides a way to organize level segments output by a GAN into
a complete level. This new CPPN2GAN approach is validated in both Super Mario
Bros. and The Legend of Zelda. Specifically, divergent search via MAP-Elites
demonstrates that CPPN2GAN can better cover the space of possible levels. The
layouts of the resulting levels are also more cohesive and aesthetically
consistent.
","[{'version': 'v1', 'created': 'Fri, 3 Apr 2020 04:29:43 GMT'}]",2020-04-07,"[['Schrum', 'Jacob', ''], ['Volz', 'Vanessa', ''], ['Risi', 'Sebastian', '']]","['Compositional Pattern Producing Networks', 'Generative Adversarial Networks', 'Indirect Encoding', 'Neuroevolution']"
9620,1605.03804,Sandra Avila,"Carlos Caetano and Sandra Avila and William Robson Schwartz and Silvio
  Jamil F. Guimar\~aes and Arnaldo de A. Ara\'ujo","A Mid-level Video Representation based on Binary Descriptors: A Case
  Study for Pornography Detection",Manuscript accepted at Elsevier Neurocomputing,,10.1016/j.neucom.2016.03.099,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the growing amount of inappropriate content on the Internet, such as
pornography, arises the need to detect and filter such material. The reason for
this is given by the fact that such content is often prohibited in certain
environments (e.g., schools and workplaces) or for certain publics (e.g.,
children). In recent years, many works have been mainly focused on detecting
pornographic images and videos based on visual content, particularly on the
detection of skin color. Although these approaches provide good results, they
generally have the disadvantage of a high false positive rate since not all
images with large areas of skin exposure are necessarily pornographic images,
such as people wearing swimsuits or images related to sports. Local feature
based approaches with Bag-of-Words models (BoW) have been successfully applied
to visual recognition tasks in the context of pornography detection. Even
though existing methods provide promising results, they use local feature
descriptors that require a high computational processing time yielding
high-dimensional vectors. In this work, we propose an approach for pornography
detection based on local binary feature extraction and BossaNova image
representation, a BoW model extension that preserves more richly the visual
information. Moreover, we propose two approaches for video description based on
the combination of mid-level representations namely BossaNova Video Descriptor
(BNVD) and BoW Video Descriptor (BoW-VD). The proposed techniques are
promising, achieving an accuracy of 92.40%, thus reducing the classification
error by 16% over the current state-of-the-art local features approach on the
Pornography dataset.
","[{'version': 'v1', 'created': 'Thu, 12 May 2016 13:27:12 GMT'}]",2016-11-14,"[['Caetano', 'Carlos', ''], ['Avila', 'Sandra', ''], ['Schwartz', 'William Robson', ''], ['Guimarães', 'Silvio Jamil F.', ''], ['Araújo', 'Arnaldo de A.', '']]","['Binary descriptors', 'mid-level representation', 'Bag-of-Words', 'BossaNova', 'pornography']"
9621,2001.09954,Luca Maria Aiello,"Minje Choi, Luca Maria Aiello, Krisztian Zsolt Varga, Daniele Quercia",Ten Social Dimensions of Conversations and Relationships,"12 pages, 7 tables, 7 figures",In Proceedings of the Web Conference 2020 (WWW'20),10.1145/3366423.3380224,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Decades of social science research identified ten fundamental dimensions that
provide the conceptual building blocks to describe the nature of human
relationships. Yet, it is not clear to what extent these concepts are expressed
in everyday language and what role they have in shaping observable dynamics of
social interactions. After annotating conversational text through
crowdsourcing, we trained NLP tools to detect the presence of these types of
interaction from conversations, and applied them to 160M messages written by
geo-referenced Reddit users, 290k emails from the Enron corpus and 300k lines
of dialogue from movie scripts. We show that social dimensions can be predicted
purely from conversations with an AUC up to 0.98, and that the combination of
the predicted dimensions suggests both the types of relationships people
entertain (conflict vs. support) and the types of real-world communities
(wealthy vs. deprived) they shape.
","[{'version': 'v1', 'created': 'Mon, 27 Jan 2020 18:20:34 GMT'}]",2020-01-28,"[['Choi', 'Minje', ''], ['Aiello', 'Luca Maria', ''], ['Varga', 'Krisztian Zsolt', ''], ['Quercia', 'Daniele', '']]","['conversations', 'social relationships', 'NLP', 'reddit', 'enron', 'twitter', 'tinghy']"
9622,1601.02372,Luka \v{C}ehovin,Jernej Kos and Mitar Milutinovi\'c and Luka \v{C}ehovin,nodewatcher: A Substrate for Growing Your own Community Network,,"Computer Networks, Volume 93, Part 2, 24 December 2015",10.1016/j.comnet.2015.09.021,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Community networks differ from regular networks by their organic growth
patterns -- there is no central planning body that would decide how the network
is built. Instead, the network grows in a bottom-up fashion as more people
express interest in participating in the community and connect with their
neighbours. People who participate in community networks are usually volunteers
with limited free time. Due to these factors, making the management of
community networks simpler and easier for all participants is the key component
in boosting their growth. Specifics of individual networks often force
communities to develop their own sets of tools and best practices which are
hard to share and do not interoperate well with others. We propose a new
general community network management platform nodewatcher that is built around
the core principle of modularity and extensibility, making it suitable for
reuse by different community networks. Devices are configured using
platform-independent configuration which nodewatcher can transform into
deployable firmware images, eliminating any manual device configuration,
reducing errors, and enabling participation of novice maintainers. An embedded
monitoring system enables live overview and validation of the whole community
network. We show how the system successfully operates in an actual community
wireless network, wlan Slovenija.
","[{'version': 'v1', 'created': 'Mon, 11 Jan 2016 09:44:03 GMT'}]",2016-01-12,"[['Kos', 'Jernej', ''], ['Milutinović', 'Mitar', ''], ['Čehovin', 'Luka', '']]","['community networks', 'management', 'provisioning', 'monitoring', 'wireless', 'mesh', 'collaboration']"
9623,1805.04101,Alberto Giaretta,"Alberto Giaretta, Michele De Donno, Nicola Dragoni","Adding Salt to Pepper: A Structured Security Assessment over a Humanoid
  Robot","8 pages, 3 figures, 4 tables",,10.1145/3230833.3232807,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rise of connectivity, digitalization, robotics, and artificial
intelligence (AI) is rapidly changing our society and shaping its future
development. During this technological and societal revolution, security has
been persistently neglected, yet a hacked robot can act as an insider threat in
organizations, industries, public spaces, and private homes. In this paper, we
perform a structured security assessment of Pepper, a commercial humanoid
robot. Our analysis, composed by an automated and a manual part, points out a
relevant number of security flaws that can be used to take over and command the
robot. Furthermore, we suggest how these issues could be fixed, thus, avoided
in the future. The very final aim of this work is to push the rise of the
security level of IoT products before they are sold on the public market.
","[{'version': 'v1', 'created': 'Thu, 10 May 2018 17:56:37 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Jul 2018 23:21:54 GMT'}]",2018-07-06,"[['Giaretta', 'Alberto', ''], ['De Donno', 'Michele', ''], ['Dragoni', 'Nicola', '']]","['Security', 'Internet of Things (IoT)', 'Robot', 'Penetration Testing', 'Pepper']"
9624,2112.09834,Hermes Senger,"Guilherme Cassales, Heitor Gomes, Albert Bifet, Bernhard Pfahringer,
  Hermes Senger","Improving the performance of bagging ensembles for data streams through
  mini-batching",,"Information Sciences, Volume 580, 2021, Pages 260-282",10.1016/j.ins.2021.08.085,,cs.LG cs.PF,http://creativecommons.org/licenses/by/4.0/,"  Often, machine learning applications have to cope with dynamic environments
where data are collected in the form of continuous data streams with
potentially infinite length and transient behavior. Compared to traditional
(batch) data mining, stream processing algorithms have additional requirements
regarding computational resources and adaptability to data evolution. They must
process instances incrementally because the data's continuous flow prohibits
storing data for multiple passes. Ensemble learning achieved remarkable
predictive performance in this scenario. Implemented as a set of (several)
individual classifiers, ensembles are naturally amendable for task parallelism.
However, the incremental learning and dynamic data structures used to capture
the concept drift increase the cache misses and hinder the benefit of
parallelism. This paper proposes a mini-batching strategy that can improve
memory access locality and performance of several ensemble algorithms for
stream mining in multi-core environments. With the aid of a formal framework,
we demonstrate that mini-batching can significantly decrease the reuse distance
(and the number of cache misses). Experiments on six different state-of-the-art
ensemble algorithms applying four benchmark datasets with varied
characteristics show speedups of up to 5X on 8-core processors. These benefits
come at the expense of a small reduction in predictive performance.
","[{'version': 'v1', 'created': 'Sat, 18 Dec 2021 03:44:07 GMT'}]",2021-12-21,"[['Cassales', 'Guilherme', ''], ['Gomes', 'Heitor', ''], ['Bifet', 'Albert', ''], ['Pfahringer', 'Bernhard', ''], ['Senger', 'Hermes', '']]","['Multicore task-parallelism', 'data-stream learning', 'ensemblelearners', 'bagging algorithms', 'Hoeffding tree']"
9625,2012.08640,Gustau Camps-Valls,"Jochem Verrelst, Juan Pablo Rivera, Anatoly Gitelson, Jesus Delegido,
  Jos\'e Moreno, Gustau Camps-Valls","Spectral band selection for vegetation properties retrieval using
  Gaussian processes regression",,"International Journal of Applied Earth Observation and
  Geoinformation Volume 52, October 2016, Pages 554-567",10.1016/j.jag.2016.07.016,,cs.CV eess.IV stat.AP,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  With current and upcoming imaging spectrometers, automated band analysis
techniques are needed to enable efficient identification of most informative
bands to facilitate optimized processing of spectral data into estimates of
biophysical variables. This paper introduces an automated spectral band
analysis tool (BAT) based on Gaussian processes regression (GPR) for the
spectral analysis of vegetation properties. The GPR-BAT procedure sequentially
backwards removes the least contributing band in the regression model for a
given variable until only one band is kept. GPR-BAT is implemented within the
framework of the free ARTMO's MLRA (machine learning regression algorithms)
toolbox, which is dedicated to the transforming of optical remote sensing
images into biophysical products. GPR-BAT allows (1) to identify the most
informative bands in relating spectral data to a biophysical variable, and (2)
to find the least number of bands that preserve optimized accurate predictions.
This study concludes that a wise band selection of hyperspectral data is
strictly required for optimal vegetation properties mapping.
","[{'version': 'v1', 'created': 'Mon, 7 Dec 2020 09:28:33 GMT'}]",2020-12-17,"[['Verrelst', 'Jochem', ''], ['Rivera', 'Juan Pablo', ''], ['Gitelson', 'Anatoly', ''], ['Delegido', 'Jesus', ''], ['Moreno', 'José', ''], ['Camps-Valls', 'Gustau', '']]","['Gaussian processes regression (GPR)', 'machine learning', 'band']"
9626,2104.13060,Tome Eftimov,"Urban \v{S}kvorc, Tome Eftimov, Peter Koro\v{s}ec","A Complementarity Analysis of the COCO Benchmark Problems and
  Artificially Generated Problems","To appear in the Proceedings of Genetic and Evolutionary Computation
  Conference Companion (GECCO 2021), ACM",,10.1145/3449726.3459585,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When designing a benchmark problem set, it is important to create a set of
benchmark problems that are a good generalization of the set of all possible
problems. One possible way of easing this difficult task is by using
artificially generated problems. In this paper, one such single-objective
continuous problem generation approach is analyzed and compared with the COCO
benchmark problem set, a well know problem set for benchmarking numerical
optimization algorithms. Using Exploratory Landscape Analysis and Singular
Value Decomposition, we show that such representations allow us to further
explore the relations between the problems by applying visualization and
correlation analysis techniques, with the goal of decreasing the bias in
benchmark problem assessment.
","[{'version': 'v1', 'created': 'Tue, 27 Apr 2021 09:18:43 GMT'}]",2021-04-28,"[['Škvorc', 'Urban', ''], ['Eftimov', 'Tome', ''], ['Korošec', 'Peter', '']]","['Numerical Optimization', 'Benchmarking', 'Optimization ProblemVisualization']"
9627,2010.06653,Teeratorn Kadeethum,T. Kadeethum and H. M. Nick and S. Lee and F. Ballarin,"Enriched Galerkin Discretization for Modeling Poroelasticity and
  Permeability Alteration in Heterogeneous Porous Media",,,10.1016/j.jcp.2020.110030,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  Accurate simulation of the coupled fluid flow and solid deformation in porous
media is challenging, especially when the media permeability and storativity
are heterogeneous. We apply the enriched Galerkin (EG) finite element method
for the Biot's system. Block structure used to compose the enriched space and
linearization and iterative schemes employed to solve the coupled media
permeability alteration are illustrated. The open-source platform used to build
the block structure is presented and illustrate that it helps the enriched
Galerkin method easily adaptable to any existing discontinuous Galerkin codes.
Subsequently, we compare the EG method with the classic continuous Galerkin
(CG) and discontinuous Galerkin (DG) finite element methods. While these
methods provide similar approximations for the pressure solution of Terzaghi's
one-dimensional consolidation, the CG method produces spurious oscillations in
fluid pressure and volumetric strain solutions at material interfaces that have
permeability contrast and does not conserve mass locally. As a result, the flux
approximation of the CG method is significantly different from the one of EG
and DG methods, especially for the soft materials. The difference of flux
approximation between EG and DG methods is insignificant; still, the EG method
demands approximately two and three times fewer degrees of freedom than the DG
method for two- and three-dimensional geometries, respectively. Lastly, we
illustrate that the EG method produces accurate results even for much coarser
meshes.
","[{'version': 'v1', 'created': 'Tue, 13 Oct 2020 19:41:04 GMT'}]",2021-02-03,"[['Kadeethum', 'T.', ''], ['Nick', 'H. M.', ''], ['Lee', 'S.', ''], ['Ballarin', 'F.', '']]","['deformable porous media', 'poroelastic effects', 'enriched Galerkin', 'finite elementmethod', 'heterogeneity']"
9628,2008.03485,Leonid Sokolinsky,Leonid B. Sokolinsky,"BSF: a parallel computation model for scalability estimation of
  iterative numerical algorithms on cluster computing systems",,"Journal of Parallel and Distributed Computing, 2021, Volume 149,
  Pages 193-206",10.1016/j.jpdc.2020.12.009,,cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper examines a new parallel computation model called bulk synchronous
farm (BSF) that focuses on estimating the scalability of compute-intensive
iterative algorithms aimed at cluster computing systems. In the BSF model, a
computer is a set of processor nodes connected by a network and organized
according to the master/slave paradigm. A cost metric of the BSF model is
presented. This cost metric requires the algorithm to be represented in the
form of operations on lists. This allows us to derive an equation that predicts
the scalability boundary of a parallel program: the maximum number of processor
nodes after which the speedup begins to decrease. The paper includes several
examples of applying the BSF model to designing and analyzing parallel
nu-merical algorithms. The large-scale computational experiments conducted on a
cluster computing system confirm the adequacy of the analytical estimations
obtained using the BSF model.
","[{'version': 'v1', 'created': 'Sat, 8 Aug 2020 09:47:23 GMT'}, {'version': 'v2', 'created': 'Sat, 5 Sep 2020 15:09:09 GMT'}, {'version': 'v3', 'created': 'Sun, 27 Sep 2020 07:20:54 GMT'}, {'version': 'v4', 'created': 'Fri, 30 Oct 2020 03:02:42 GMT'}, {'version': 'v5', 'created': 'Sat, 2 Jan 2021 14:50:05 GMT'}]",2021-01-05,"[['Sokolinsky', 'Leonid B.', '']]","['parallel computation model', 'cluster computing systems', 'iterative']"
9629,2008.11428,Tobin South,"Tobin South, Matthew Roughan and Lewis Mitchell","Popularity and Centrality in Spotify Networks: Critical transitions in
  eigenvector centrality",,"Journal of Complex Networks, Volume 8, Issue 6, 1 December 2020,
  cnaa050",10.1093/comnet/cnaa050,,cs.SI stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The modern age of digital music access has increased the availability of data
about music consumption and creation, facilitating the large-scale analysis of
the complex networks that connect music together. Data about user streaming
behaviour, and the musical collaboration networks are particularly important
with new data-driven recommendation systems. Without thorough analysis, such
collaboration graphs can lead to false or misleading conclusions. Here we
present a new collaboration network of artists from the online music streaming
service Spotify, and demonstrate a critical change in the eigenvector
centrality of artists, as low popularity artists are removed. The critical
change in centrality, from classical artists to rap artists, demonstrates
deeper structural properties of the network. A Social Group Centrality model is
presented to simulate this critical transition behaviour, and switching between
dominant eigenvectors is observed. This model presents a novel investigation of
the effect of popularity bias on how centrality and importance are measured,
and provides a new tool for examining such flaws in networks.
","[{'version': 'v1', 'created': 'Wed, 26 Aug 2020 07:50:16 GMT'}, {'version': 'v2', 'created': 'Sun, 29 Aug 2021 14:55:41 GMT'}]",2021-08-31,"[['South', 'Tobin', ''], ['Roughan', 'Matthew', ''], ['Mitchell', 'Lewis', '']]","['collaboration networks', 'centrality', 'critical transitions', 'social network analysis']"
9630,2110.09937,Teddy Cunningham,"Chris Conlan, Teddy Cunningham, Gunduz Vehbi Demirci, and Hakan
  Ferhatosmanoglu","Collective Shortest Paths for Minimizing Congestion on Temporal
  Load-Aware Road Networks","10 pages, to appear at the IWCTS Workshop at SIGSPATIAL 2021",,10.1145/3486629.3490691,,cs.DB cs.DS,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Shortest path queries over graphs are usually considered as isolated tasks,
where the goal is to return the shortest path for each individual query. In
practice, however, such queries are typically part of a system (e.g., a road
network) and their execution dynamically affects other queries and network
parameters, such as the loads on edges, which in turn affects the shortest
paths. We study the problem of collectively processing shortest path queries,
where the objective is to optimize a collective objective, such as minimizing
the overall cost. We define a temporal load-aware network that dynamically
tracks expected loads while satisfying the desirable `first in, first out'
property. We develop temporal load-aware extensions of widely used shortest
path algorithms, and a scalable collective routing solution that seeks to
reduce system-wide congestion through dynamic path reassignment. Experiments
illustrate that our collective approach to this NP-hard problem achieves
improvements in a variety of performance measures, such as, i) reducing average
travel times by up to 63%, ii) producing fairer suggestions across queries, and
iii) distributing load across up to 97% of a city's road network capacity. The
proposed approach is generalizable, which allows it to be adapted for other
concurrent query processing tasks over networks.
","[{'version': 'v1', 'created': 'Tue, 19 Oct 2021 12:52:03 GMT'}]",2021-10-20,"[['Conlan', 'Chris', ''], ['Cunningham', 'Teddy', ''], ['Demirci', 'Gunduz Vehbi', ''], ['Ferhatosmanoglu', 'Hakan', '']]","['Shortest Path Queries', 'Road Networks', 'Temporal Load-aware Networks', 'Collective Route Optimization', 'Graph Data Analytics']"
9631,2108.08669,Kaifeng Gao,"Kaifeng Gao, Long Chen, Yifeng Huang, Jun Xiao",Video Relation Detection via Tracklet based Visual Transformer,"1st of Video Relation Understanding (VRU) Grand Challenge in ACM
  Multimedia 2021",,10.1145/3474085.3479231,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Video Visual Relation Detection (VidVRD), has received significant attention
of our community over recent years. In this paper, we apply the
state-of-the-art video object tracklet detection pipeline MEGA and deepSORT to
generate tracklet proposals. Then we perform VidVRD in a tracklet-based manner
without any pre-cutting operations. Specifically, we design a tracklet-based
visual Transformer. It contains a temporal-aware decoder which performs feature
interactions between the tracklets and learnable predicate query embeddings,
and finally predicts the relations. Experimental results strongly demonstrate
the superiority of our method, which outperforms other methods by a large
margin on the Video Relation Understanding (VRU) Grand Challenge in ACM
Multimedia 2021. Codes are released at
https://github.com/Dawn-LX/VidVRD-tracklets.
","[{'version': 'v1', 'created': 'Thu, 19 Aug 2021 13:13:23 GMT'}]",2021-08-20,"[['Gao', 'Kaifeng', ''], ['Chen', 'Long', ''], ['Huang', 'Yifeng', ''], ['Xiao', 'Jun', '']]","['Visual Relation Detection', 'Video Tracklets', 'Transformer']"
9632,2111.15298,Shashank Kedia,"Shashank Kedia, Aditya Mantha, Sneha Gupta, Stephen Guo, Kannan Achan","Generating Rich Product Descriptions for Conversational E-commerce
  Systems","8 pages, 1 figure. arXiv admin note: substantial text overlap with
  arXiv:2007.11768","Companion Proceedings of the Web Conference 2021, 349-356",10.1145/3442442.3451893,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Through recent advancements in speech technologies and introduction of smart
assistants, such as Amazon Alexa, Apple Siri and Google Home, increasing number
of users are interacting with various applications through voice commands.
E-commerce companies typically display short product titles on their webpages,
either human-curated or algorithmically generated, when brevity is required.
However, these titles are dissimilar from natural spoken language. For example,
""Lucky Charms Gluten Free Break-fast Cereal, 20.5 oz a box Lucky Charms Gluten
Free"" is acceptable to display on a webpage, while a similar title cannot be
used in a voice based text-to-speech application. In such conversational
systems, an easy to comprehend sentence, such as ""a 20.5 ounce box of lucky
charms gluten free cereal"" is preferred. Compared to display devices, where
images and detailed product information can be presented to users, short titles
for products which convey the most important information, are necessary when
interfacing with voice assistants. We propose eBERT, a sequence-to-sequence
approach by further pre-training the BERT embeddings on an e-commerce product
description corpus, and then fine-tuning the resulting model to generate short,
natural, spoken language titles from input web titles. Our extensive
experiments on a real-world industry dataset, as well as human evaluation of
model output, demonstrate that eBERT summarization outperforms comparable
baseline models. Owing to the efficacy of the model, a version of this model
has been deployed in real-world setting.
","[{'version': 'v1', 'created': 'Tue, 30 Nov 2021 11:22:43 GMT'}]",2021-12-01,"[['Kedia', 'Shashank', ''], ['Mantha', 'Aditya', ''], ['Gupta', 'Sneha', ''], ['Guo', 'Stephen', ''], ['Achan', 'Kannan', '']]","['BERT', 'Pre-training', 'E-commerce', 'Personal Assistants']"
9633,1911.06633,Shreshth Tuli,"Shreshth Tuli, Nipam Basumatary, Sukhpal Singh Gill, Mohsen Kahani,
  Rajesh Chand Arya, Gurpreet Singh Wander, Rajkumar Buyya","HealthFog: An Ensemble Deep Learning based Smart Healthcare System for
  Automatic Diagnosis of Heart Diseases in Integrated IoT and Fog Computing
  Environments",,"Future Generation Computing Systems, 2020",10.1016/j.future.2019.10.043,,cs.DC eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing provides resources over the Internet and allows a plethora of
applications to be deployed to provide services for different industries. The
major bottleneck being faced currently in these cloud frameworks is their
limited scalability and hence inability to cater to the requirements of
centralized Internet of Things (IoT) based compute environments. The main
reason for this is that latency-sensitive applications like health monitoring
and surveillance systems now require computation over large amounts of data
(Big Data) transferred to centralized database and from database to cloud data
centers which leads to drop in performance of such systems. The new paradigms
of fog and edge computing provide innovative solutions by bringing resources
closer to the user and provide low latency and energy-efficient solutions for
data processing compared to cloud domains. Still, the current fog models have
many limitations and focus from a limited perspective on either accuracy of
results or reduced response time but not both. We proposed a novel framework
called HealthFog for integrating ensemble deep learning in Edge computing
devices and deployed it for a real-life application of automatic Heart Disease
analysis. HealthFog delivers healthcare as a fog service using IoT devices and
efficiently manages the data of heart patients, which comes as user requests.
Fog-enabled cloud framework, FogBus is used to deploy and test the performance
of the proposed model in terms of power consumption, network bandwidth,
latency, jitter, accuracy and execution time. HealthFog is configurable to
various operation modes that provide the best Quality of Service or prediction
accuracy, as required, in diverse fog computation scenarios and for different
user requirements.
","[{'version': 'v1', 'created': 'Fri, 15 Nov 2019 13:50:27 GMT'}]",2019-11-18,"[['Tuli', 'Shreshth', ''], ['Basumatary', 'Nipam', ''], ['Gill', 'Sukhpal Singh', ''], ['Kahani', 'Mohsen', ''], ['Arya', 'Rajesh Chand', ''], ['Wander', 'Gurpreet Singh', ''], ['Buyya', 'Rajkumar', '']]","['Fog Computing', 'Internet of Things', 'Healthcare', 'Deep Learning', 'Ensemble Learning', 'Heart Patient analysis']"
9634,2111.03813,Aditya Mandke,"Aditya Mandke, Onkar Litake, Dipali Kadam","Analyzing Architectures for Neural Machine Translation Using Low
  Computational Resources",,,10.5121/ijnlc.2021.10502,,cs.CL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  With the recent developments in the field of Natural Language Processing,
there has been a rise in the use of different architectures for Neural Machine
Translation. Transformer architectures are used to achieve state-of-the-art
accuracy, but they are very computationally expensive to train. Everyone cannot
have such setups consisting of high-end GPUs and other resources. We train our
models on low computational resources and investigate the results. As expected,
transformers outperformed other architectures, but there were some surprising
results. Transformers consisting of more encoders and decoders took more time
to train but had fewer BLEU scores. LSTM performed well in the experiment and
took comparatively less time to train than transformers, making it suitable to
use in situations having time constraints.
","[{'version': 'v1', 'created': 'Sat, 6 Nov 2021 06:25:46 GMT'}]",2021-11-30,"[['Mandke', 'Aditya', ''], ['Litake', 'Onkar', ''], ['Kadam', 'Dipali', '']]","['Machine Translation', 'Indic Languages', 'Natural Language Processing']"
9635,2103.11364,Piotr Kulicki,"Xin Sun, Feifei He, Piotr Kulicki, Mirek Sopek","Schr\""odinger's Ballot: Quantum Information and the Violation of Arrow's
  Impossibility Theorem",11 pages,,10.3390/e23081083,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  In this paper we study Arrow's Impossibility Theorem in the quantum setting.
Our work is based on the work of Bao and Halpern, in which it is proved that
the quantum analogue of Arrow's Impossibility Theorem is not valid. However, we
feel unsatisfied about the proof presented there. Moreover, the definition of
Quantum Independence of Irrelevant Alternatives (QIIA) seems not appropriate to
us. In this paper, we give a better definition of QIIA, which properly captures
the idea of the independence of irrelevant alternatives, and a detailed proof
of the violation of Arrow's Impossibility Theorem in the quantum setting with
the modified definition.
","[{'version': 'v1', 'created': 'Sun, 21 Mar 2021 11:13:06 GMT'}]",2021-09-01,"[['Sun', 'Xin', ''], ['He', 'Feifei', ''], ['Kulicki', 'Piotr', ''], ['Sopek', 'Mirek', '']]","['vote', 'quantum information', 'Arrow’s Impossibility Theorem', 'social choice']"
9636,2005.14230,Nathaniel Bastian PhD,"Marc Chal\'e, Nathaniel D. Bastian, Jeffery Weir",Algorithm Selection Framework for Cyber Attack Detection,"6 pages, 7 figures, 1 table, accepted to WiseML '20",,10.1145/3395352.3402623,,cs.CR cs.AI cs.LG stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The number of cyber threats against both wired and wireless computer systems
and other components of the Internet of Things continues to increase annually.
In this work, an algorithm selection framework is employed on the NSL-KDD data
set and a novel paradigm of machine learning taxonomy is presented. The
framework uses a combination of user input and meta-features to select the best
algorithm to detect cyber attacks on a network. Performance is compared between
a rule-of-thumb strategy and a meta-learning strategy. The framework removes
the conjecture of the common trial-and-error algorithm selection method. The
framework recommends five algorithms from the taxonomy. Both strategies
recommend a high-performing algorithm, though not the best performing. The work
demonstrates the close connectedness between algorithm selection and the
taxonomy for which it is premised.
","[{'version': 'v1', 'created': 'Thu, 28 May 2020 18:49:29 GMT'}]",2020-06-01,"[['Chalé', 'Marc', ''], ['Bastian', 'Nathaniel D.', ''], ['Weir', 'Jeffery', '']]","['machine learning', 'algorithm selection', 'meta learning', 'feature engineering', 'cybersecurity']"
9637,1506.09169,Ali Avanaki,"Ali R. N. Avanaki, Kathryn S. Espig, Tom R. L. Kimpe, Andrew D. A.
  Maidment",On anthropomorphic decision making in a model observer,,,10.1117/12.2082129,,cs.CV cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  By analyzing human readers' performance in detecting small round lesions in
simulated digital breast tomosynthesis background in a location known exactly
scenario, we have developed a model observer that is a better predictor of
human performance with different levels of background complexity (i.e.,
anatomical and quantum noise). Our analysis indicates that human observers
perform a lesion detection task by combining a number of sub-decisions, each an
indicator of the presence of a lesion in the image stack. This is in contrast
to a channelized Hotelling observer, where the detection task is conducted
holistically by thresholding a single decision variable, made from an optimally
weighted linear combination of channels. However, it seems that the sub-par
performance of human readers compared to the CHO cannot be fully explained by
their reliance on sub-decisions, or perhaps we do not consider a sufficient
number of sub-decisions. To bridge the gap between the performances of human
readers and the model observer based upon sub-decisions, we use an additive
noise model, the power of which is modulated with the level of background
complexity. The proposed model observer better predicts the fast drop in human
detection performance with background complexity.
","[{'version': 'v1', 'created': 'Tue, 30 Jun 2015 17:36:33 GMT'}]",2015-07-01,"[['Avanaki', 'Ali R. N.', ''], ['Espig', 'Kathryn S.', ''], ['Kimpe', 'Tom R. L.', ''], ['Maidment', 'Andrew D. A.', '']]","['Human visual system properties', 'anthropomorphic numerical observer', 'virtual clinical trials']"
9638,2205.01100,Siddhartha Paul Tiwari,Siddhartha Paul Tiwari,"Knowledge Management Strategies and Emerging Technologies -- An Overview
  Of the Underpinning Concepts",,"2022 International Journal of Innovative Technologies in Economy,
  (1(37)",10.31435/rsglobal_ijite/30032022/7791,,cs.CY,http://creativecommons.org/licenses/by-sa/4.0/,"  Among the essential elements of knowledge management is the use of
information and data, as well as the knowledge, skills, and abilities inherent
within communities, as well as their ideas, commitments, and motivations for
making good decisions as emerging technologies become more prevalent. Numerous
leading social scientists in this field have asserted that organisational
knowledge should be regarded as a strategic asset. There is a growing awareness
of the importance of gathering, locating, capturing, and sharing collective
knowledge and expertise of societies, and societies are urged to develop
effective and efficient methods of gathering, locating, capturing, and sharing
that knowledge in order to deal with problems and to benefit from
opportunities. People living in many countries and regions are interested in
implementing knowledge management processes and technologies, and many of them
have included knowledge management as an integral part of their overall
development strategies. The management of knowledge plays an increasingly
important role in global economic development (Bell, 1973, 1978). In order to
remain relevant in the modern world, organisations should not ignore knowledge
management and emerging technologies.
","[{'version': 'v1', 'created': 'Tue, 3 May 2022 14:33:31 GMT'}]",2022-05-04,"[['Tiwari', 'Siddhartha Paul', '']]","['Knowledge Management and Emerging Technologies', 'New Technologies', 'KnowledgeManagement Concepts', 'Intelligent Knowledge Systems']"
9639,2005.10004,Alessandro Celestini,"Stefano Guarino, Noemi Trino, Alessandro Celestini, Alessandro Chessa,
  Gianni Riotta",Characterizing networks of propaganda on Twitter: a case study,,"Applied Network Science 5, 59 (2020)",10.1007/s41109-020-00286-y,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The daily exposure of social media users to propaganda and disinformation
campaigns has reinvigorated the need to investigate the local and global
patterns of diffusion of different (mis)information content on social media.
Echo chambers and influencers are often deemed responsible of both the
polarization of users in online social networks and the success of propaganda
and disinformation campaigns. This article adopts a data-driven approach to
investigate the structuration of communities and propaganda networks on Twitter
in order to assess the correctness of these imputations. In particular, the
work aims at characterizing networks of propaganda extracted from a Twitter
dataset by combining the information gained by three different classification
approaches, focused respectively on (i) using Tweets content to infer the
""polarization"" of users around a specific topic, (ii) identifying users having
an active role in the diffusion of different propaganda and disinformation
items, and (iii) analyzing social ties to identify topological clusters and
users playing a ""central"" role in the network. The work identifies highly
partisan community structures along political alignments; furthermore,
centrality metrics proved to be very informative to detect the most active
users in the network and to distinguish users playing different roles; finally,
polarization and clustering structure of the retweet graphs provided useful
insights about relevant properties of users exposure, interactions, and
participation to different propaganda items.
","[{'version': 'v1', 'created': 'Wed, 20 May 2020 12:42:08 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Sep 2020 15:56:39 GMT'}]",2020-09-24,"[['Guarino', 'Stefano', ''], ['Trino', 'Noemi', ''], ['Celestini', 'Alessandro', ''], ['Chessa', 'Alessandro', ''], ['Riotta', 'Gianni', '']]","['Propaganda networks', 'Polarization', 'Centrality', 'Clustering']"
9640,2012.06384,Alex Halle,"Alex Halle, L. Flavio Campanile, Alexander Hasse","An AI-Assisted Design Method for Topology Optimization Without
  Pre-Optimized Training Data",,,10.3390/app11199041,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Topology optimization is widely used by engineers during the initial product
development process to get a first possible geometry design. The
state-of-the-art is the iterative calculation, which requires both time and
computational power. Some newly developed methods use artificial intelligence
to accelerate the topology optimization. These require conventionally
pre-optimized data and therefore are dependent on the quality and number of
available data. This paper proposes an AI-assisted design method for topology
optimization, which does not require pre-optimized data. The designs are
provided by an artificial neural network, the predictor, on the basis of
boundary conditions and degree of filling (the volume percentage filled by
material) as input data. In the training phase, geometries generated on the
basis of random input data are evaluated with respect to given criteria. The
results of those evaluations flow into an objective function which is minimized
by adapting the predictor's parameters. After the training is completed, the
presented AI-assisted design procedure supplies geometries which are similar to
the ones generated by conventional topology optimizers, but requires a small
fraction of the computational effort required by those algorithms. We
anticipate our paper to be a starting point for AI-based methods that requires
data, that is hard to compute or not available.
","[{'version': 'v1', 'created': 'Fri, 11 Dec 2020 14:33:27 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Jul 2021 08:53:48 GMT'}]",2021-09-30,"[['Halle', 'Alex', ''], ['Campanile', 'L. Flavio', ''], ['Hasse', 'Alexander', '']]","['deep learning', 'topology optimization', 'artificial neural networks', 'ai-assisted design']"
9641,1906.03253,Victor Hansen,Victor E Hansen,Representing and Using Knowledge with the Contextual Evaluation Model,,,10.13140/RG.2.2.34892.05762,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces the Contextual Evaluation Model (CEM), a novel method
for knowledge representation and manipulation. The CEM differs from existing
models in that it integrates facts, patterns and sequences into a single
contextual framework. V5, an implementation of the model is presented and
demonstrated with multiple annotated examples. The paper includes simulations
demonstrating how the model reacts to pleasure/pain stimuli. The 'thought' is
defined within the model and examples are given converting thoughts to
language, converting language to thoughts and how 'meaning' arises from
thoughts. A pattern learning algorithm is described. The algorithm is applied
to multiple problems ranging from recognizing a voice to the autonomous
learning of a simplified natural language.
","[{'version': 'v1', 'created': 'Fri, 31 May 2019 19:26:54 GMT'}]",2019-06-10,"[['Hansen', 'Victor E', '']]","['knowledge representation', 'artificial intelligence', 'context', 'natural language']"
9642,2004.05074,Heidi Howard,"Heidi Howard, Richard Mortier",Paxos vs Raft: Have we reached consensus on distributed consensus?,"To be published in the 7th Workshop on Principles and Practice of
  Consistency for Distributed Data (PaPoC)",,10.1145/3380787.3393681,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed consensus is a fundamental primitive for constructing
fault-tolerant, strongly-consistent distributed systems. Though many
distributed consensus algorithms have been proposed, just two dominate
production systems: Paxos, the traditional, famously subtle, algorithm; and
Raft, a more recent algorithm positioned as a more understandable alternative
to Paxos.
  In this paper, we consider the question of which algorithm, Paxos or Raft, is
the better solution to distributed consensus? We analyse both to determine
exactly how they differ by describing a simplified Paxos algorithm using Raft's
terminology and pragmatic abstractions.
  We find that both Paxos and Raft take a very similar approach to distributed
consensus, differing only in their approach to leader election. Most notably,
Raft only allows servers with up-to-date logs to become leaders, whereas Paxos
allows any server to be leader provided it then updates its log to ensure it is
up-to-date. Raft's approach is surprisingly efficient given its simplicity as,
unlike Paxos, it does not require log entries to be exchanged during leader
election. We surmise that much of the understandability of Raft comes from the
paper's clear presentation rather than being fundamental to the underlying
algorithm being presented.
","[{'version': 'v1', 'created': 'Fri, 10 Apr 2020 15:30:31 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Apr 2020 21:29:45 GMT'}]",2020-04-29,"[['Howard', 'Heidi', ''], ['Mortier', 'Richard', '']]","['State machine replication', 'Distributed consensus', 'Paxos', 'Raft']"
9643,2204.03254,Stefano Zacchiroli,"Zeinab Abou Khalil (DGD-I), Stefano Zacchiroli (IP Paris, LTCI)",The General Index of Software Engineering Papers,"MSR 2022 - The 2022 Mining Software Repositories Conference, May
  2022, Pittsburgh, Pennsylvania, United States",,10.1145/3524842.3528494,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the General Index of Software Engineering Papers, a dataset of
fulltext-indexed papers from the most prominent scientific venues in the field
of Software Engineering. The dataset includes both complete bibliographic
information and indexed ngrams (sequence of contiguous words after removal of
stopwords and non-words, for a total of 577 276 382 unique n-grams in this
release) with length 1 to 5 for 44 581 papers retrieved from 34 venues over the
1971-2020 period.The dataset serves use cases in the field of meta-research,
allowing to introspect the output of software engineering research even when
access to papers or scholarly search engines is not possible (e.g., due to
contractual reasons). The dataset also contributes to making such analyses
reproducible and independently verifiable, as opposed to what happens when they
are conducted using 3rd-party and non-open scholarly indexing services.The
dataset is available as a portable Postgres database dump and released as open
data.
","[{'version': 'v1', 'created': 'Thu, 7 Apr 2022 06:52:35 GMT'}]",2022-04-08,"[['Khalil', 'Zeinab Abou', '', 'DGD-I'], ['Zacchiroli', 'Stefano', '', 'IP Paris, LTCI']]","['dataset', 'academic publishing', 'software engineering', 'ngrams', 'metaanalysis', 'natural language processing', 'fulltext index']"
9644,2003.07914,Hlib Babii,"Rafael-Michael Karampatsis, Hlib Babii, Romain Robbes, Charles Sutton,
  Andrea Janes",Big Code != Big Vocabulary: Open-Vocabulary Models for Source Code,13 pages; to appear in Proceedings of ICSE 2020,,10.1145/3377811.3380342,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Statistical language modeling techniques have successfully been applied to
large source code corpora, yielding a variety of new software development
tools, such as tools for code suggestion, improving readability, and API
migration. A major issue with these techniques is that code introduces new
vocabulary at a far higher rate than natural language, as new identifier names
proliferate. Both large vocabularies and out-of-vocabulary issues severely
affect Neural Language Models (NLMs) of source code, degrading their
performance and rendering them unable to scale.
  In this paper, we address this issue by: 1) studying how various modelling
choices impact the resulting vocabulary on a large-scale corpus of 13,362
projects; 2) presenting an open vocabulary source code NLM that can scale to
such a corpus, 100 times larger than in previous work; and 3) showing that such
models outperform the state of the art on three distinct code corpora (Java, C,
Python). To our knowledge, these are the largest NLMs for code that have been
reported.
  All datasets, code, and trained models used in this work are publicly
available.
","[{'version': 'v1', 'created': 'Tue, 17 Mar 2020 19:48:41 GMT'}]",2020-03-19,"[['Karampatsis', 'Rafael-Michael', ''], ['Babii', 'Hlib', ''], ['Robbes', 'Romain', ''], ['Sutton', 'Charles', ''], ['Janes', 'Andrea', '']]","['Naturalness of code', 'Neural Language Models', 'Byte-Pair Encoding']"
9645,2206.12374,Jane Yu,"Jane Dwivedi-Yu, Yi-Chia Wang, Lijing Qin, Cristian Canton-Ferrer,
  Alon Y. Halevy",Affective Signals in a Social Media Recommender System,,,10.1145/3534678.3539054,,cs.SI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  People come to social media to satisfy a variety of needs, such as being
informed, entertained and inspired, or connected to their friends and
community. Hence, to design a ranking function that gives useful and
personalized post recommendations, it would be helpful to be able to predict
the affective response a user may have to a post (e.g., entertained, informed,
angered). This paper describes the challenges and solutions we developed to
apply Affective Computing to social media recommendation systems.
  We address several types of challenges. First, we devise a taxonomy of
affects that was small (for practical purposes) yet covers the important
nuances needed for the application. Second, to collect training data for our
models, we balance between signals that are already available to us (namely,
different types of user engagement) and data we collected through a carefully
crafted human annotation effort on 800k posts. We demonstrate that affective
response information learned from this dataset improves a module in the
recommendation system by more than 8%. Online experimentation also demonstrates
statistically significant decreases in surfaced violating content and increases
in surfaced content that users find valuable.
","[{'version': 'v1', 'created': 'Fri, 24 Jun 2022 16:57:08 GMT'}]",2022-06-27,"[['Dwivedi-Yu', 'Jane', ''], ['Wang', 'Yi-Chia', ''], ['Qin', 'Lijing', ''], ['Canton-Ferrer', 'Cristian', ''], ['Halevy', 'Alon Y.', '']]","['affective computing', 'recommendation systems', 'social media']"
9646,2209.02948,Feiyang Tang,"Feiyang Tang, Bjarte M. {\O}stvold",Assessing Software Privacy using the Privacy Flow-Graph,"Published at International Workshop on Mining Software Repositories
  Applications for Privacy and Security (MSR4P&S) 2022",,10.1145/3549035.3561185,,cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We increasingly rely on digital services and the conveniences they provide.
Processing of personal data is integral to such services and thus privacy and
data protection are a growing concern, and governments have responded with
regulations such as the EU's GDPR. Following this, organisations that make
software have legal obligations to document the privacy and data protection of
their software. This work must involve both software developers that understand
the code and the organisation's data protection officer or legal department
that understands privacy and the requirements of a Data Protection and Impact
Assessment (DPIA).
  To help developers and non-technical people such as lawyers document the
privacy and data protection behaviour of software, we have developed an
automatic software analysis technique. This technique is based on static
program analysis to characterise the flow of privacy-related data. The results
of the analysis can be presented as a graph of privacy flows and operations -
that is understandable also for non-technical people. We argue that our
technique facilitates collaboration between technical and non-technical people
in documenting the privacy behaviour of the software. We explain how to use the
results produced by our technique to answer a series of privacy-relevant
questions needed for a DPIA. To illustrate our work, we show both detailed and
abstract analysis results from applying our analysis technique to the secure
messaging service Signal and to the client of the cloud service NextCloud and
show how their privacy flow-graphs inform the writing of a DPIA.
","[{'version': 'v1', 'created': 'Wed, 7 Sep 2022 06:11:21 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Nov 2022 09:04:45 GMT'}, {'version': 'v3', 'created': 'Tue, 29 Nov 2022 16:08:55 GMT'}]",2022-11-30,"[['Tang', 'Feiyang', ''], ['Østvold', 'Bjarte M.', '']]","['Program analysis', 'data protection and privacy', 'GDPR', 'softwaredesign documentation']"
9647,2011.01397,Paulo Santos,Danilo Perico and Paulo E. Santos and Reinaldo Bianchi,"Guided Navigation from Multiple Viewpoints using Qualitative Spatial
  Reasoning",26 pages,Spatial Cognition and Computation - 2020,10.1080/13875868.2020.1857386,,cs.RO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Navigation is an essential ability for mobile agents to be completely
autonomous and able to perform complex actions. However, the problem of
navigation for agents with limited (or no) perception of the world, or devoid
of a fully defined motion model, has received little attention from research in
AI and Robotics. One way to tackle this problem is to use guided navigation, in
which other autonomous agents, endowed with perception, can combine their
distinct viewpoints to infer the localisation and the appropriate commands to
guide a sensory deprived agent through a particular path. Due to the limited
knowledge about the physical and perceptual characteristics of the guided
agent, this task should be conducted on a level of abstraction allowing the use
of a generic motion model, and high-level commands, that can be applied by any
type of autonomous agents, including humans. The main task considered in this
work is, given a group of autonomous agents perceiving their common environment
with their independent, egocentric and local vision sensors, the development
and evaluation of algorithms capable of producing a set of high-level commands
(involving qualitative directions: e.g. move left, go straight ahead) capable
of guiding a sensory deprived robot to a goal location.
","[{'version': 'v1', 'created': 'Tue, 3 Nov 2020 00:34:26 GMT'}]",2020-11-30,"[['Perico', 'Danilo', ''], ['Santos', 'Paulo E.', ''], ['Bianchi', 'Reinaldo', '']]","['Knowledge Representation', 'reasoning in Robotic Systems; Mapping,localisation', 'exploration; Multi-Robot Systems']"
9648,2010.12575,Ponkrshnan Thiagarajan,"Ponkrshnan Thiagarajan, Pushkar Khairnar, and Susanta Ghosh","Explanation and Use of Uncertainty Quantified by Bayesian Neural Network
  Classifiers for Breast Histopathology Images",Published in IEEE Transactions on Medical Imaging,,10.1109/TMI.2021.3123300,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the promise of Convolutional neural network (CNN) based
classification models for histopathological images, it is infeasible to
quantify its uncertainties. Moreover, CNNs may suffer from overfitting when the
data is biased. We show that Bayesian-CNN can overcome these limitations by
regularizing automatically and by quantifying the uncertainty. We have
developed a novel technique to utilize the uncertainties provided by the
Bayesian-CNN that significantly improves the performance on a large fraction of
the test data (about 6% improvement in accuracy on 77% of test data). Further,
we provide a novel explanation for the uncertainty by projecting the data into
a low dimensional space through a nonlinear dimensionality reduction technique.
This dimensionality reduction enables interpretation of the test data through
visualization and reveals the structure of the data in a low dimensional
feature space. We show that the Bayesian-CNN can perform much better than the
state-of-the-art transfer learning CNN (TL-CNN) by reducing the false negative
and false positive by 11% and 7.7% respectively for the present data set. It
achieves this performance with only 1.86 million parameters as compared to
134.33 million for TL-CNN. Besides, we modify the Bayesian-CNN by introducing a
stochastic adaptive activation function. The modified Bayesian-CNN performs
slightly better than Bayesian-CNN on all performance metrics and significantly
reduces the number of false negatives and false positives (3% reduction for
both). We also show that these results are statistically significant by
performing McNemar's statistical significance test. This work shows the
advantages of Bayesian-CNN against the state-of-the-art, explains and utilizes
the uncertainties for histopathological images. It should find applications in
various medical image classifications.
","[{'version': 'v1', 'created': 'Wed, 7 Oct 2020 23:20:26 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Sep 2021 19:55:12 GMT'}, {'version': 'v3', 'created': 'Fri, 5 Nov 2021 21:21:14 GMT'}]",2021-11-09,"[['Thiagarajan', 'Ponkrshnan', ''], ['Khairnar', 'Pushkar', ''], ['Ghosh', 'Susanta', '']]","['Bayesian Convolutional Neural Networks', 'Breast Cancer', 'Histopathological Imaging', 'MachineLearning', 'Uncertainty Quantification', 't-SNE']"
9649,1710.04890,Ruben Mayer,"Thomas Bach, Muhammad Adnan Tariq, Ruben Mayer and Kurt Rothermel","Knowledge is at the Edge! How to Search in Distributed Machine Learning
  Models",Published in CoopIS 2017,,10.1007/978-3-319-69462-7_27,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the advent of the Internet of Things and Industry 4.0 an enormous amount
of data is produced at the edge of the network. Due to a lack of computing
power, this data is currently send to the cloud where centralized machine
learning models are trained to derive higher level knowledge. With the recent
development of specialized machine learning hardware for mobile devices, a new
era of distributed learning is about to begin that raises a new research
question: How can we search in distributed machine learning models? Machine
learning at the edge of the network has many benefits, such as low-latency
inference and increased privacy. Such distributed machine learning models can
also learn personalized for a human user, a specific context, or application
scenario. As training data stays on the devices, control over possibly
sensitive data is preserved as it is not shared with a third party. This new
form of distributed learning leads to the partitioning of knowledge between
many devices which makes access difficult. In this paper we tackle the problem
of finding specific knowledge by forwarding a search request (query) to a
device that can answer it best. To that end, we use a entropy based quality
metric that takes the context of a query and the learning quality of a device
into account. We show that our forwarding strategy can achieve over 95%
accuracy in a urban mobility scenario where we use data from 30 000 people
commuting in the city of Trento, Italy.
","[{'version': 'v1', 'created': 'Fri, 13 Oct 2017 12:22:03 GMT'}]",2017-10-16,"[['Bach', 'Thomas', ''], ['Tariq', 'Muhammad Adnan', ''], ['Mayer', 'Ruben', ''], ['Rothermel', 'Kurt', '']]","['Knowledge retrieval', 'Distributed knowledge', 'Query routing']"
9650,2003.04984,Reza Fotohi,Reza Fotohi,"Securing of Unmanned Aerial Systems (UAS) against security threats using
  human immune system","29 pages, 12 figures, 10 tables, 8 equations, Journal","Reliability Engineering & System Safety, 193, 106675 (2020)",10.1016/j.ress.2019.106675,,cs.CR cs.AI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  UASs form a large part of the fighting ability of the advanced military
forces. In particular, these systems that carry confidential information are
subject to security attacks. Accordingly, an Intrusion Detection System (IDS)
has been proposed in the proposed design to protect against the security
problems using the human immune system (HIS). The IDSs are used to detect and
respond to attempts to compromise the target system. Since the UASs operate in
the real world, the testing and validation of these systems with a variety of
sensors is confronted with problems. This design is inspired by HIS. In the
mapping, insecure signals are equivalent to an antigen that are detected by
antibody-based training patterns and removed from the operation cycle. Among
the main uses of the proposed design are the quick detection of intrusive
signals and quarantining their activity. Moreover, SUAS-HIS method is evaluated
here via extensive simulations carried out in NS-3 environment. The simulation
results indicate that the UAS network performance metrics are improved in terms
of false positive rate, false negative rate, detection rate, and packet
delivery rate.
","[{'version': 'v1', 'created': 'Sun, 1 Mar 2020 19:05:16 GMT'}]",2020-03-12,"[['Fotohi', 'Reza', '']]","['Unmanned Aerial Systems', 'Security threats', 'IDS', 'HIS', 'Routing security', 'SUAS-HIS']"
9651,2010.14945,Yanqiao Zhu,"Yanqiao Zhu and Yichen Xu and Feng Yu and Qiang Liu and Shu Wu and
  Liang Wang",Graph Contrastive Learning with Adaptive Augmentation,"Accepted to WWW 2021, authors' version. 12 pages, 3 figures, 5
  tables. arXiv admin note: substantial text overlap with arXiv:2006.04131",,10.1145/3442381.3449802,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Recently, contrastive learning (CL) has emerged as a successful method for
unsupervised graph representation learning. Most graph CL methods first perform
stochastic augmentation on the input graph to obtain two graph views and
maximize the agreement of representations in the two views. Despite the
prosperous development of graph CL methods, the design of graph augmentation
schemes -- a crucial component in CL -- remains rarely explored. We argue that
the data augmentation schemes should preserve intrinsic structures and
attributes of graphs, which will force the model to learn representations that
are insensitive to perturbation on unimportant nodes and edges. However, most
existing methods adopt uniform data augmentation schemes, like uniformly
dropping edges and uniformly shuffling features, leading to suboptimal
performance. In this paper, we propose a novel graph contrastive representation
learning method with adaptive augmentation that incorporates various priors for
topological and semantic aspects of the graph. Specifically, on the topology
level, we design augmentation schemes based on node centrality measures to
highlight important connective structures. On the node attribute level, we
corrupt node features by adding more noise to unimportant node features, to
enforce the model to recognize underlying semantic information. We perform
extensive experiments of node classification on a variety of real-world
datasets. Experimental results demonstrate that our proposed method
consistently outperforms existing state-of-the-art baselines and even surpasses
some supervised counterparts, which validates the effectiveness of the proposed
contrastive framework with adaptive augmentation.
","[{'version': 'v1', 'created': 'Tue, 27 Oct 2020 15:12:21 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Feb 2021 07:45:30 GMT'}, {'version': 'v3', 'created': 'Fri, 26 Feb 2021 15:12:23 GMT'}]",2021-03-01,"[['Zhu', 'Yanqiao', ''], ['Xu', 'Yichen', ''], ['Yu', 'Feng', ''], ['Liu', 'Qiang', ''], ['Wu', 'Shu', ''], ['Wang', 'Liang', '']]","['Contrastive learning', 'graph representation learning', 'unsupervisedlearning', 'self-supervised learning']"
9652,2010.06460,Gergely Hajgat\'o,"Gergely Hajgat\'o and Gy\""orgy Pa\'al and B\'alint Gyires-T\'oth","Deep Reinforcement Learning for Real-Time Optimization of Pumps in Water
  Distribution Systems",,"Journal of Water Resources Planning and Management, Volume 146,
  Issue 11 (November 2020)",10.1061/(ASCE)WR.1943-5452.0001287,,cs.AI cs.LG physics.flu-dyn physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real-time control of pumps can be an infeasible task in water distribution
systems (WDSs) because the calculation to find the optimal pump speeds is
resource-intensive. The computational need cannot be lowered even with the
capabilities of smart water networks when conventional optimization techniques
are used. Deep reinforcement learning (DRL) is presented here as a controller
of pumps in two WDSs. An agent based on a dueling deep q-network is trained to
maintain the pump speeds based on instantaneous nodal pressure data. General
optimization techniques (e.g., Nelder-Mead method, differential evolution)
serve as baselines. The total efficiency achieved by the DRL agent compared to
the best performing baseline is above 0.98, whereas the speedup is around 2x
compared to that. The main contribution of the presented approach is that the
agent can run the pumps in real-time because it depends only on measurement
data. If the WDS is replaced with a hydraulic simulation, the agent still
outperforms conventional techniques in search speed.
","[{'version': 'v1', 'created': 'Tue, 13 Oct 2020 15:13:49 GMT'}]",2020-10-14,"[['Hajgató', 'Gergely', ''], ['Paál', 'György', ''], ['Gyires-Tóth', 'Bálint', '']]","['deep reinforcement learning', 'dueling deep Q-network', 'real-time control', 'water distribution systems', 'pump control']"
9653,1909.03753,Simon Duque Anton,"Simon D. Duque Anton, Anna Pia Lohfink, and Hans Dieter Schotten","Discussing the Feasibility of Acoustic Sensors for Side Channel-aided
  Industrial Intrusion Detection: An Essay",,,10.1145/3360664.3360667,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The fourth industrial revolution leads to an increased use of embedded
computation and intercommunication in an industrial environment. While reducing
cost and effort for set up, operation and maintenance, and increasing the time
to operation or market respectively as well as the efficiency, this also
increases the attack surface of enterprises. Industrial enterprises have become
targets of cyber criminals in the last decade, reasons being espionage but also
politically motivated. Infamous attack campaigns as well as easily available
malware that hits industry in an unprepared state create a large threat
landscape. As industrial systems often operate for many decades and are
difficult or impossible to upgrade in terms of security, legacy-compatible
industrial security solutions are necessary in order to create a security
parameter. One plausible approach in industry is the implementation and
employment of side-channel sensors. Combining readily available sensor data
from different sources via different channels can provide an enhanced insight
about the security state. In this work, a data set of an experimental
industrial set up containing side channel sensors is discussed conceptually and
insights are derived.
","[{'version': 'v1', 'created': 'Mon, 9 Sep 2019 10:48:56 GMT'}]",2019-09-10,"[['Anton', 'Simon D. Duque', ''], ['Lohfink', 'Anna Pia', ''], ['Schotten', 'Hans Dieter', '']]","['Anomaly Detection', 'Intrusion Detection', 'Industrial Networks', 'Machine Learning', 'SCADA']"
9654,2009.09217,Luca Martino,"Luca Martino, Jesse Read","A Joint introduction to Gaussian Processes and Relevance Vector Machines
  with Connections to Kalman filtering and other Kernel Smoothers",,"Information Fusion, Volume 74, Pages 17-38, 2021",10.1016/j.inffus.2021.03.002,,cs.LG cs.AI cs.NA math.NA stat.CO stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The expressive power of Bayesian kernel-based methods has led them to become
an important tool across many different facets of artificial intelligence, and
useful to a plethora of modern application domains, providing both power and
interpretability via uncertainty analysis. This article introduces and
discusses two methods which straddle the areas of probabilistic Bayesian
schemes and kernel methods for regression: Gaussian Processes and Relevance
Vector Machines. Our focus is on developing a common framework with which to
view these methods, via intermediate methods a probabilistic version of the
well-known kernel ridge regression, and drawing connections among them, via
dual formulations, and discussion of their application in the context of major
tasks: regression, smoothing, interpolation, and filtering. Overall, we provide
understanding of the mathematical concepts behind these models, and we
summarize and discuss in depth different interpretations and highlight the
relationship to other methods, such as linear kernel smoothers, Kalman
filtering and Fourier approximations. Throughout, we provide numerous figures
to promote understanding, and we make numerous recommendations to
practitioners. Benefits and drawbacks of the different techniques are
highlighted. To our knowledge, this is the most in-depth study of its kind to
date focused on these two methods, and will be relevant to theoretical
understanding and practitioners throughout the domains of data-science, signal
processing, machine learning, and artificial intelligence in general.
","[{'version': 'v1', 'created': 'Sat, 19 Sep 2020 12:22:41 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Sep 2020 20:03:15 GMT'}, {'version': 'v3', 'created': 'Mon, 22 Mar 2021 17:02:30 GMT'}, {'version': 'v4', 'created': 'Sun, 11 Jul 2021 19:28:28 GMT'}]",2021-07-13,"[['Martino', 'Luca', ''], ['Read', 'Jesse', '']]","['Gaussian processes', 'Relevance Vector Machines', 'Bayesian Learning', 'BayesianRidge', 'Kernel Smoothing', 'Kalman Filtering']"
9655,1605.03071,Florian Sikora,"Riccardo Dondi, Florian Sikora","Parameterized Complexity and Approximation Issues for the Colorful
  Components Problems",,"Theoretical Computer Science Volume 739, 29 August 2018, Pages
  1-12",10.1016/j.tcs.2018.04.044,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The quest for colorful components (connected components where each color is
associated with at most one vertex) inside a vertex-colored graph has been
widely considered in the last ten years. Here we consider two variants, Minimum
Colorful Components (MCC) and Maximum Edges in transitive Closure (MEC),
introduced in 2011 in the context of orthology gene identification in
bioinformatics. The input of both MCC and MEC is a vertex-colored graph. MCC
asks for the removal of a subset of edges, so that the resulting graph is
partitioned in the minimum number of colorful connected components; MEC asks
for the removal of a subset of edges, so that the resulting graph is
partitioned in colorful connected components and the number of edges in the
transitive closure of such a graph is maximized. We study the parameterized and
approximation complexity of MCC and MEC, for general and restricted instances.
  For MCC on trees we show that the problem is basically equivalent to Minimum
Cut on Trees, thus MCC is not approximable within factor $1.36 - \varepsilon$,
it is fixed-parameter tractable and it admits a poly-kernel (when the parameter
is the number of colorful components). Moreover, we show that MCC, while it is
polynomial time solvable on paths, it is NP-hard even for graphs with constant
distance to disjoint paths number. Then we consider the parameterized
complexity of MEC when parameterized by the number $k$ of edges in the
transitive closure of a solution (the graph obtained by removing edges so that
it is partitioned in colorful connected components). We give a fixed-parameter
algorithm for MEC paramterized by $k$ and, when the input graph is a tree, we
give a poly-kernel.
","[{'version': 'v1', 'created': 'Tue, 10 May 2016 15:55:58 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Jun 2018 15:14:38 GMT'}]",2018-06-20,"[['Dondi', 'Riccardo', ''], ['Sikora', 'Florian', '']]","['Colorful Components', 'Parameterized Complexity', 'Algorithms', 'ComputationalBiology']"
9656,2007.11328,Kenneth Lai,K. Lai and S.N. Yanushkevich,"Watchlist Risk Assessment using Multiparametric Cost and Relative
  Entropy",,"2017 IEEE Symposium Series on Computational Intelligence (SSCI),
  Honolulu, HI, 2017, pp. 1-7",10.1109/SSCI.2017.8285219,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the facial biometric-enabled watchlist technology in
which risk detectors are mandatory mechanisms for early detection of threats,
as well as for avoiding offense to innocent travelers. We propose a
multiparametric cost assessment and relative entropy measures as risk
detectors. We experimentally demonstrate the effects of mis-identification and
impersonation under various watchlist screening scenarios and constraints. The
key contributions of this paper are the novel techniques for design and
analysis of the biometric-enabled watchlist and the supporting infrastructure,
as well as measuring the impersonation impact on e-border performance.
","[{'version': 'v1', 'created': 'Wed, 22 Jul 2020 10:27:53 GMT'}]",2020-07-23,"[['Lai', 'K.', ''], ['Yanushkevich', 'S. N.', '']]","['Biometrics', 'automated border control', 'watchlist', 'riskassessment', 'entropy']"
9657,2202.12245,Marcos Faundez-Zanuy,"Laurence Likforman-Sulem, Anna Esposito, Marcos Faundez-Zanuy, Stephan
  Clemen\c{c}on, Gennaro Cordasco","EMOTHAW: A novel database for emotional state recognition from
  handwriting",31 pages,"IEEE Transactions on Human-Machine Systems, vol. 47, no. 2, pp.
  273-284, April 2017",10.1109/THMS.2016.2635441,,cs.CV cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The detection of negative emotions through daily activities such as
handwriting is useful for promoting well-being. The spread of human-machine
interfaces such as tablets makes the collection of handwriting samples easier.
In this context, we present a first publicly available handwriting database
which relates emotional states to handwriting, that we call EMOTHAW. This
database includes samples of 129 participants whose emotional states, namely
anxiety, depression and stress, are assessed by the Depression Anxiety Stress
Scales (DASS) questionnaire. Seven tasks are recorded through a digitizing
tablet: pentagons and house drawing, words copied in handprint, circles and
clock drawing, and one sentence copied in cursive writing. Records consist in
pen positions, on-paper and in-air, time stamp, pressure, pen azimuth and
altitude. We report our analysis on this database. From collected data, we
first compute measurements related to timing and ductus. We compute separate
measurements according to the position of the writing device: on paper or
in-air. We analyse and classify this set of measurements (referred to as
features) using a random forest approach. This latter is a machine learning
method [2], based on an ensemble of decision trees, which includes a feature
ranking process. We use this ranking process to identify the features which
best reveal a targeted emotional state.
  We then build random forest classifiers associated to each emotional state.
Our results, obtained from cross-validation experiments, show that the targeted
emotional states can be identified with accuracies ranging from 60% to 71%.
","[{'version': 'v1', 'created': 'Wed, 23 Feb 2022 15:15:44 GMT'}]",2022-02-25,"[['Likforman-Sulem', 'Laurence', ''], ['Esposito', 'Anna', ''], ['Faundez-Zanuy', 'Marcos', ''], ['Clemençon', 'Stephan', ''], ['Cordasco', 'Gennaro', '']]","['Affective database', 'Random Forests', 'Handwriting', 'Emotional state', 'DASS']"
9658,1906.01984,Xianxu Hou,"Xianxu Hou, Ke Sun, Linlin Shen, Guoping Qiu","Improving Variational Autoencoder with Deep Feature Consistent and
  Generative Adversarial Training","Accepted in Neurocomputing, 2019. arXiv admin note: text overlap with
  arXiv:1610.00291",,10.1016/j.neucom.2019.03.013,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new method for improving the performances of variational
autoencoder (VAE). In addition to enforcing the deep feature consistent
principle thus ensuring the VAE output and its corresponding input images to
have similar deep features, we also implement a generative adversarial training
mechanism to force the VAE to output realistic and natural images. We present
experimental results to show that the VAE trained with our new method
outperforms state of the art in generating face images with much clearer and
more natural noses, eyes, teeth, hair textures as well as reasonable
backgrounds. We also show that our method can learn powerful embeddings of
input face images, which can be used to achieve facial attribute manipulation.
Moreover we propose a multi-view feature extraction strategy to extract
effective image representations, which can be used to achieve state of the art
performance in facial attribute prediction.
","[{'version': 'v1', 'created': 'Tue, 4 Jun 2019 03:17:30 GMT'}]",2019-06-06,"[['Hou', 'Xianxu', ''], ['Sun', 'Ke', ''], ['Shen', 'Linlin', ''], ['Qiu', 'Guoping', '']]","['Image Generation', 'Facial Attributes', 'Generative model', 'VAE', 'GAN']"
9659,1911.06861,Dmtri Babaev,"Alexander Panchenko, Dmitry Babaev, Sergei Obiedkov",Large-Scale Parallel Matching of Social Network Profiles,,,10.1007/978-3-319-26123-2_27,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A profile matching algorithm takes as input a user profile of one social
network and returns, if existing, the profile of the same person in another
social network. Such methods have immediate applications in Internet marketing,
search, security, and a number of other domains, which is why this topic saw a
recent surge in popularity. In this paper, we present a user identity
resolution approach that uses minimal supervision and achieves a precision of
0.98 at a recall of 0.54. Furthermore, the method is computationally efficient
and easily parallelizable. We show that the method can be used to match
Facebook, the most popular social network globally, with VKontakte, the most
popular social network among Russian-speaking users.
","[{'version': 'v1', 'created': 'Fri, 15 Nov 2019 20:21:44 GMT'}]",2019-11-19,"[['Panchenko', 'Alexander', ''], ['Babaev', 'Dmitry', ''], ['Obiedkov', 'Sergei', '']]","['User identify resolution', 'entity resolution', 'profile matching', 'recordlinkage', 'social networks', 'social network analysis', 'Facebook', 'Vkontakte']"
9660,1710.02869,Isaac Sledge,"Isaac J. Sledge, Jose C. Principe","An Analysis of the Value of Information when Exploring Stochastic,
  Discrete Multi-Armed Bandits",Entropy,,10.3390/e20030155,,cs.AI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose an information-theoretic exploration strategy for
stochastic, discrete multi-armed bandits that achieves optimal regret. Our
strategy is based on the value of information criterion. This criterion
measures the trade-off between policy information and obtainable rewards. High
amounts of policy information are associated with exploration-dominant searches
of the space and yield high rewards. Low amounts of policy information favor
the exploitation of existing knowledge. Information, in this criterion, is
quantified by a parameter that can be varied during search. We demonstrate that
a simulated-annealing-like update of this parameter, with a sufficiently fast
cooling schedule, leads to an optimal regret that is logarithmic with respect
to the number of episodes.
","[{'version': 'v1', 'created': 'Sun, 8 Oct 2017 18:48:48 GMT'}, {'version': 'v2', 'created': 'Sat, 3 Mar 2018 21:01:57 GMT'}]",2018-03-06,"[['Sledge', 'Isaac J.', ''], ['Principe', 'Jose C.', '']]","['Multi-armed bandits', 'exploration', 'exploitation', 'exploration-exploitation dilemma', 'reinforcementlearning', 'information theory']"
9661,2201.02217,Yue Yu,"Huaiqian You, Yue Yu, Marta D'Elia, Tian Gao, Stewart Silling","Nonlocal Kernel Network (NKN): a Stable and Resolution-Independent Deep
  Neural Network",,,10.1016/j.jcp.2022.111536,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Neural operators have recently become popular tools for designing solution
maps between function spaces in the form of neural networks. Differently from
classical scientific machine learning approaches that learn parameters of a
known partial differential equation (PDE) for a single instance of the input
parameters at a fixed resolution, neural operators approximate the solution map
of a family of PDEs. Despite their success, the uses of neural operators are so
far restricted to relatively shallow neural networks and confined to learning
hidden governing laws. In this work, we propose a novel nonlocal neural
operator, which we refer to as nonlocal kernel network (NKN), that is
resolution independent, characterized by deep neural networks, and capable of
handling a variety of tasks such as learning governing equations and
classifying images. Our NKN stems from the interpretation of the neural network
as a discrete nonlocal diffusion reaction equation that, in the limit of
infinite layers, is equivalent to a parabolic nonlocal equation, whose
stability is analyzed via nonlocal vector calculus. The resemblance with
integral forms of neural operators allows NKNs to capture long-range
dependencies in the feature space, while the continuous treatment of
node-to-node interactions makes NKNs resolution independent. The resemblance
with neural ODEs, reinterpreted in a nonlocal sense, and the stable network
dynamics between layers allow for generalization of NKN's optimal parameters
from shallow to deep networks. This fact enables the use of shallow-to-deep
initialization techniques. Our tests show that NKNs outperform baseline methods
in both learning governing equations and image classification tasks and
generalize well to different resolutions and depths.
","[{'version': 'v1', 'created': 'Thu, 6 Jan 2022 19:19:35 GMT'}]",2022-09-07,"[['You', 'Huaiqian', ''], ['Yu', 'Yue', ''], [""D'Elia"", 'Marta', ''], ['Gao', 'Tian', ''], ['Silling', 'Stewart', '']]","['Neural Operator Learning', 'Deep Learning', 'Partial Differential Equation Learning', 'Image']"
9662,2107.06645,Volker Hohmann,Volker Hohmann,"The Period-Modulated Harmonic Locked Loop (PM-HLL): A low-effort
  algorithm for rapid time-domain multi-periodicity estimation","Preprint (2nd version), accepted for publication at acta acustica",,10.1051/aacus/2021050,,cs.SD eess.AS eess.SP,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Many speech and music analysis and processing schemes rely on an estimate of
the fundamental frequency $f_0$ of periodic signal components. Most established
schemes apply rather unspecific signal models such as sinusoidal models to the
estimation problem, which may limit time resolution and estimation accuracy.
This study proposes a novel time-domain locked-loop algorithm with low
computational effort and low memory footprint for $f_0$ estimation. The loop
control signal is directly derived from the input time signal, using a harmonic
signal model. Theoretically, this allows for a noise-robust and rapid $f_0$
estimation for periodic signals of arbitrary waveform, and without the
requirement of a prior frequency analysis. Several simulations with short
signals employing different types of periodicity and with added wide-band noise
were performed to demonstrate and evaluate the basic properties of the proposed
algorithm. Depending on the Signal-to-Noise Ratio (SNR), the estimator was
found to converge within 3-4 signal repetitions, even at SNR close to or below
0dB. Furthermore, it was found to follow fundamental frequency sweeps with a
delay of less than one period and to track all tones of a three-tone musical
chord signal simultaneously. Quasi-periodic sounds with shifted harmonics as
well as signals with stochastic periodicity were robustly tracked. Mean and
standard deviation of the estimation error, i.e., the difference between true
and estimated $f_0$, were at or below 1 Hz in most cases. The results suggest
that the proposed algorithm may be applicable to low-delay speech and music
analysis and processing.
","[{'version': 'v1', 'created': 'Wed, 14 Jul 2021 12:33:16 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Nov 2021 17:58:39 GMT'}]",2021-12-23,"[['Hohmann', 'Volker', '']]","['Multi-Periodicity', 'Multi-Pitch', 'Fundamental Frequency Estimation', 'Harmonic-to-Noise Ratio', 'Hearing Acoustics']"
9663,1401.2516,Trisiladevi C Nagavi,Trisiladevi C. Nagavi and Nagappa U. Bhajantri,"Progressive Filtering Using Multiresolution Histograms for Query by
  Humming System","12 Pages, 6 Figures, Full version of the paper published at
  ICMCCA-2012 with the same title,
  Link:http://link.springer.com/chapter/10.1007/978-81-322-1143-3_21","Proc. of the First International Conference on Multimedia
  Processing,Communication and Computing Applications(ICMCCA) 13-15 December
  2012,Bangalore India,Lecture Notes in Electrical Engineering,Volume 213,Pages
  253-265,Springer India,2013",10.1007/978-81-322-1143-3_21,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rising availability of digital music stipulates effective categorization
and retrieval methods. Real world scenarios are characterized by mammoth music
collections through pertinent and non-pertinent songs with reference to the
user input. The primary goal of the research work is to counter balance the
perilous impact of non-relevant songs through Progressive Filtering (PF) for
Query by Humming (QBH) system. PF is a technique of problem solving through
reduced space. This paper presents the concept of PF and its efficient design
based on Multi-Resolution Histograms (MRH) to accomplish searching in
manifolds. Initially the entire music database is searched to obtain high
recall rate and narrowed search space. Later steps accomplish slow search in
the reduced periphery and achieve additional accuracy.
  Experimentation on large music database using recursive programming
substantiates the potential of the method. The outcome of proposed strategy
glimpses that MRH effectively locate the patterns. Distances of MRH at lower
level are the lower bounds of the distances at higher level, which guarantees
evasion of false dismissals during PF. In due course, proposed method helps to
strike a balance between efficiency and effectiveness. The system is scalable
for large music retrieval systems and also data driven for performance
optimization as an added advantage.
","[{'version': 'v1', 'created': 'Sat, 11 Jan 2014 10:29:34 GMT'}]",2014-01-14,"[['Nagavi', 'Trisiladevi C.', ''], ['Bhajantri', 'Nagappa U.', '']]","['Progressive Filtering', 'Multiresolution Histograms', 'Multiresolution Analysis', 'Query by Humming']"
9664,1909.08795,Dibyayan Chakraborty,"Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar
  Ghosh, Bodhayan Roy","Hardness and approximation for the geodetic set problem in some graph
  classes",,"Proceedings CALDAM 2020. Lecture Notes in Computer Science
  12016:102-115, 2020",10.1007/978-3-030-39219-2_9,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the computational complexity of finding the
\emph{geodetic number} of graphs. A set of vertices $S$ of a graph $G$ is a
\emph{geodetic set} if any vertex of $G$ lies in some shortest path between
some pair of vertices from $S$. The \textsc{Minimum Geodetic Set (MGS)} problem
is to find a geodetic set with minimum cardinality. In this paper, we prove
that solving the \textsc{MGS} problem is NP-hard on planar graphs with a
maximum degree six and line graphs. We also show that unless $P=NP$, there is
no polynomial time algorithm to solve the \textsc{MGS} problem with
sublogarithmic approximation factor (in terms of the number of vertices) even
on graphs with diameter $2$. On the positive side, we give an
$O\left(\sqrt[3]{n}\log n\right)$-approximation algorithm for the \textsc{MGS}
problem on general graphs of order $n$. We also give a $3$-approximation
algorithm for the \textsc{MGS} problem on the family of solid grid graphs which
is a subclass of planar graphs.
","[{'version': 'v1', 'created': 'Thu, 19 Sep 2019 04:08:08 GMT'}]",2020-12-08,"[['Chakraborty', 'Dibyayan', ''], ['Foucaud', 'Florent', ''], ['Gahlawat', 'Harmender', ''], ['Ghosh', 'Subir Kumar', ''], ['Roy', 'Bodhayan', '']]","['Planar graph', 'Geodetic Set', 'Approximation']"
9665,2106.09397,Yanmeng Wang,"Yanmeng Wang, Yanqing Xu, Qingjiang Shi, Tsung-Hui Chang","Quantized Federated Learning under Transmission Delay and Outage
  Constraints",,"IEEE Journal on Selected Areas in Communications, vol. 40, no. 1,
  pp. 323-341, Jan. 2022",10.1109/JSAC.2021.3126081,,cs.IT cs.LG math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Federated learning (FL) has been recognized as a viable distributed learning
paradigm which trains a machine learning model collaboratively with massive
mobile devices in the wireless edge while protecting user privacy. Although
various communication schemes have been proposed to expedite the FL process,
most of them have assumed ideal wireless channels which provide reliable and
lossless communication links between the server and mobile clients.
Unfortunately, in practical systems with limited radio resources such as
constraint on the training latency and constraints on the transmission power
and bandwidth, transmission of a large number of model parameters inevitably
suffers from quantization errors (QE) and transmission outage (TO). In this
paper, we consider such non-ideal wireless channels, and carry out the first
analysis showing that the FL convergence can be severely jeopardized by TO and
QE, but intriguingly can be alleviated if the clients have uniform outage
probabilities. These insightful results motivate us to propose a robust FL
scheme, named FedTOE, which performs joint allocation of wireless resources and
quantization bits across the clients to minimize the QE while making the
clients have the same TO probability. Extensive experimental results are
presented to show the superior performance of FedTOE for deep learning-based
classification tasks with transmission latency constraints.
","[{'version': 'v1', 'created': 'Thu, 17 Jun 2021 11:29:12 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Jun 2021 04:09:00 GMT'}, {'version': 'v3', 'created': 'Sun, 17 Apr 2022 08:45:25 GMT'}]",2022-04-19,"[['Wang', 'Yanmeng', ''], ['Xu', 'Yanqing', ''], ['Shi', 'Qingjiang', ''], ['Chang', 'Tsung-Hui', '']]","['− Federated learning', 'transmission outage', 'quantization error', 'convergence rate', 'wireless resource allocation']"
9666,2003.09512,Karen Bodie,"Mike Allenspach, Karen Bodie, Maximilian Brunner, Luca Rinsoz, Zachary
  Taylor, Mina Kamel, Roland Siegwart and Juan Nieto","Design and optimal control of a tiltrotor micro aerial vehicle for
  efficient omnidirectional flight","16 pages, 24 figures, 3 page appendix, video available at
  https://youtu.be/mBi9mOQaZzQ",,10.1177/0278364920943654,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Omnidirectional micro aerial vehicles are a growing field of research, with
demonstrated advantages for aerial interaction and uninhibited observation.
While systems with complete pose omnidirectionality and high hover efficiency
have been developed independently, a robust system that combines the two has
not been demonstrated to date. This paper presents the design and optimal
control of a novel omnidirectional vehicle that can exert a wrench in any
orientation while maintaining efficient flight configurations. The system
design is motivated by the result of a morphology design optimization. A six
degrees of freedom optimal controller is derived, with an actuator allocation
approach that implements task prioritization, and is robust to singularities.
Flight experiments demonstrate and verify the system's capabilities.
","[{'version': 'v1', 'created': 'Fri, 20 Mar 2020 21:55:06 GMT'}]",2020-08-27,"[['Allenspach', 'Mike', ''], ['Bodie', 'Karen', ''], ['Brunner', 'Maximilian', ''], ['Rinsoz', 'Luca', ''], ['Taylor', 'Zachary', ''], ['Kamel', 'Mina', ''], ['Siegwart', 'Roland', ''], ['Nieto', 'Juan', '']]","['Aerial robotics', 'optimal control', 'omnidirectional MAV', 'tiltrotor', 'design optimization']"
9667,2006.12425,Shan Li,"Shan Li, Baoxu Shi, Jaewon Yang, Ji Yan, Shuai Wang, Fei Chen, Qi He",Deep Job Understanding at LinkedIn,"4 pages, to appear in SIGIR2020",,10.1145/3397271.3401403,,cs.IR cs.AI cs.CL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As the world's largest professional network, LinkedIn wants to create
economic opportunity for everyone in the global workforce. One of its most
critical missions is matching jobs with processionals. Improving job targeting
accuracy and hire efficiency align with LinkedIn's Member First Motto. To
achieve those goals, we need to understand unstructured job postings with noisy
information. We applied deep transfer learning to create domain-specific job
understanding models. After this, jobs are represented by professional
entities, including titles, skills, companies, and assessment questions. To
continuously improve LinkedIn's job understanding ability, we designed an
expert feedback loop where we integrated job understanding models into
LinkedIn's products to collect job posters' feedback. In this demonstration, we
present LinkedIn's job posting flow and demonstrate how the integrated deep job
understanding work improves job posters' satisfaction and provides significant
metric lifts in LinkedIn's job recommendation system.
","[{'version': 'v1', 'created': 'Fri, 29 May 2020 20:04:59 GMT'}]",2020-06-23,"[['Li', 'Shan', ''], ['Shi', 'Baoxu', ''], ['Yang', 'Jaewon', ''], ['Yan', 'Ji', ''], ['Wang', 'Shuai', ''], ['Chen', 'Fei', ''], ['He', 'Qi', '']]","['job understanding', 'human feedback loop', 'deep learning']"
9668,2106.00309,Rasmus Ulfsnes,"Rasmus Ulfsnes, Viktoria Stray, Nils Brede Moe, Darja \v{S}mite","Innovation in Large-scale agile -- Benefits and Challenges of Hackathons
  when Hacking from Home",,"In: Gregory P., Kruchten P. (eds) Agile Processes in Software
  Engineering and Extreme Programming - Workshops. XP 2021. Lecture Notes in
  Business Information Processing, vol 426. Springer, Cham",10.1007/978-3-030-88583-0_3,,cs.SE,http://creativecommons.org/publicdomain/zero/1.0/,"  Hackathons are events in which diverse teams work together to explore, and
develop solutions, software or even ideas. Hackathons have been recognized not
only as public events for hacking, but also as a corporate mechanism for
innovation. Hackathons are a way for established companies to achieve increased
employee wellbeing as well as being a curator for innovation and developing new
products. Sudden transition to the work-from-home mode caused by the COVID-19
pandemic first put many corporate events requiring collocation, such as
hackathons, temporarily on hold and then motivated companies to find ways to
hold these events virtually. In this paper, we report our findings from
investigating hackathons in the context of a large agile company by first
exploring the general benefits and challenges of hackathons and then trying to
understand how they were affected by the virtual setup. We conducted nine
interviews, surveyed 23 employees and analyzed a hackathon demo. We found that
hackathons provide both individual and organizational benefits of innovation,
personal interests, and acquiring new skills and competences. Several
challenges such as added stress due to stopping the regular work, employees
fearing not having enough contribution to deliver and potential mismatch
between individual and organizational goals were also found. With respect to
the virtual setup, we found that virtual hackathons are not diminishing the
innovation benefits, however, some negative effect surfaced on the social and
networking side.
","[{'version': 'v1', 'created': 'Tue, 1 Jun 2021 08:32:12 GMT'}]",2021-12-22,"[['Ulfsnes', 'Rasmus', ''], ['Stray', 'Viktoria', ''], ['Moe', 'Nils Brede', ''], ['Šmite', 'Darja', '']]","['Large-scale software development', 'work-from-anywhere', 'innovation', 'hackathon']"
9669,2208.14231,Seoyoung Hong,"Seoyoung Hong, Heejoo Shin, Jeongwhan Choi, and Noseong Park",Prediction-based One-shot Dynamic Parking Pricing,Accepted at CIKM 2022,,10.1145/3511808.3557421,,cs.LG cs.AI math.OC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Many U.S. metropolitan cities are notorious for their severe shortage of
parking spots. To this end, we present a proactive prediction-driven
optimization framework to dynamically adjust parking prices. We use
state-of-the-art deep learning technologies such as neural ordinary
differential equations (NODEs) to design our future parking occupancy rate
prediction model given historical occupancy rates and price information. Owing
to the continuous and bijective characteristics of NODEs, in addition, we
design a one-shot price optimization method given a pre-trained prediction
model, which requires only one iteration to find the optimal solution. In other
words, we optimize the price input to the pre-trained prediction model to
achieve targeted occupancy rates in the parking blocks. We conduct experiments
with the data collected in San Francisco and Seattle for years. Our prediction
model shows the best accuracy in comparison with various temporal or
spatio-temporal forecasting models. Our one-shot optimization method greatly
outperforms other black-box and white-box search methods in terms of the search
time and always returns the optimal price solution.
","[{'version': 'v1', 'created': 'Tue, 30 Aug 2022 12:59:58 GMT'}]",2022-08-31,"[['Hong', 'Seoyoung', ''], ['Shin', 'Heejoo', ''], ['Choi', 'Jeongwhan', ''], ['Park', 'Noseong', '']]","['dynamic pricing', 'parking occupancy prediction', 'price modeling', 'prediction-driven optimization']"
9670,1905.01545,Luciano Caroprese,Luciano Caroprese and Ester Zumpano,A Logic Framework for P2P Deductive Databases,"Under consideration in Theory and Practice of Logic Programming
  (TPLP)",Theory and Practice of Logic Programming 20 (2020) 1-43,10.1017/S1471068419000073,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a logic framework for modeling the interaction among
deductive databases in a P2P (Peer to Peer) environment. Each peer joining a
P2P system provides or imports data from its neighbors by using a set of
mapping rules, i.e. a set of semantic correspondences to a set of peers
belonging to the same environment. Two different types of mapping rules are
defined: mapping rules allowing to import a maximal set of atoms not leading to
inconsistency (called maximal mapping rules) and mapping rules allowing to
import a minimal set of atoms needed to restore consistency (called minimal
mapping rules). Implicitly, the use of maximal mapping rules states it is
preferable to import as long as no inconsistencies arise; whereas the use of
minimal mapping rules states that it is preferable not to import unless a
inconsistency exists. The paper presents three different declarative semantics
of a P2P system: (i) the Max Weak Model Semantics, in which mapping rules are
used to import as much knowledge as possible} from a peer's neighborhood
without violating local integrity constraints; (ii) the Min Weak Model
Semantics, in which the P2P system can be locally inconsistent and the
information provided by the neighbors is used to restore consistency, that is
to only integrate the missing portion of a correct, but incomplete database;
(iii) the Max-Min Weak Model Semantics that unifies the previous two different
perspectives captured by the Max Weak Model Semantics and Min Weak Model
Semantics. This last semantics allows to characterize each peer in the
neighborhood as a resource used either to enrich (integrate) or to fix (repair)
the knowledge, so as to define a kind of integrate-repair strategy for each
peer.
  Under consideration in Theory and Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Sat, 4 May 2019 19:39:06 GMT'}]",2020-02-19,"[['Caroprese', 'Luciano', ''], ['Zumpano', 'Ester', '']]","['Peer data Exchange', 'Incompleteness', 'Inconsistency', 'Integrity Constraints', 'Relational Databases', 'Prioritized Logic Program']"
9671,1810.01270,Rafael Menelau Oliveira E Cruz,"Rafael M. O. Cruz, Robert Sabourin, George D. C. Cavalcanti and Tsang
  Ing Ren",META-DES: A Dynamic Ensemble Selection Framework using Meta-Learning,"Article published on Pattern Recognition. arXiv admin note: text
  overlap with arXiv:1509.00825","Pattern Recognition Volume 48, Issue 5, Pages 1925-1935",10.1016/j.patcog.2014.12.003,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dynamic ensemble selection systems work by estimating the level of competence
of each classifier from a pool of classifiers. Only the most competent ones are
selected to classify a given test sample. This is achieved by defining a
criterion to measure the level of competence of a base classifier, such as, its
accuracy in local regions of the feature space around the query instance.
However, using only one criterion about the behavior of a base classifier is
not sufficient to accurately estimate its level of competence. In this paper,
we present a novel dynamic ensemble selection framework using meta-learning. We
propose five distinct sets of meta-features, each one corresponding to a
different criterion to measure the level of competence of a classifier for the
classification of input samples. The meta-features are extracted from the
training data and used to train a meta-classifier to predict whether or not a
base classifier is competent enough to classify an input instance. During the
generalization phase, the meta-features are extracted from the query instance
and passed down as input to the meta-classifier. The meta-classifier estimates,
whether a base classifier is competent enough to be added to the ensemble.
Experiments are conducted over several small sample size classification
problems, i.e., problems with a high degree of uncertainty due to the lack of
training data. Experimental results show the proposed meta-learning framework
greatly improves classification accuracy when compared against current
state-of-the-art dynamic ensemble selection techniques.
","[{'version': 'v1', 'created': 'Sun, 30 Sep 2018 00:27:49 GMT'}]",2020-03-06,"[['Cruz', 'Rafael M. O.', ''], ['Sabourin', 'Robert', ''], ['Cavalcanti', 'George D. C.', ''], ['Ren', 'Tsang Ing', '']]","['Ensemble of Classifiers', 'Dynamic Ensemble Selection', 'Meta-Learning', 'Classifier competence']"
9672,1907.02192,Ramy Shahin,"Ramy Shahin, Marsha Chechik, Rick Salay",Lifting Datalog-Based Analyses to Software Product Lines,FSE'19 paper,,10.1145/3338906.3338928,,cs.SE cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Applying program analyses to Software Product Lines (SPLs) has been a
fundamental research problem at the intersection of Product Line Engineering
and software analysis. Different attempts have been made to ""lift"" particular
product-level analyses to run on the entire product line. In this paper, we
tackle the class of Datalog-based analyses (e.g., pointer and taint analyses),
study the theoretical aspects of lifting Datalog inference, and implement a
lifted inference algorithm inside the Souffl\'e Datalog engine. We evaluate our
implementation on a set of benchmark product lines. We show significant savings
in processing time and fact database size (billions of times faster on one of
the benchmarks) compared to brute-force analysis of each product individually.
","[{'version': 'v1', 'created': 'Thu, 4 Jul 2019 02:31:13 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Jul 2019 00:01:30 GMT'}]",2019-09-02,"[['Shahin', 'Ramy', ''], ['Chechik', 'Marsha', ''], ['Salay', 'Rick', '']]","['Software Product Lines', 'Datalog', 'Program Analysis', 'Pointer Analysis', 'Lifting', 'Doop', 'Soufflé']"
9673,2008.04373,Lei Shi,"Lei Shi, Alexandra I. Cristea, Armando M. Toda, Wilk Oliveira",Exploring Navigation Styles in a FutureLearn MOOC,"The 16th International Conference on Intelligent Tutoring Systems
  (ITS2020)",,10.1007/978-3-030-49663-0_7,,cs.HC cs.CY,http://creativecommons.org/licenses/by/4.0/,"  This paper presents for the first time a detailed analysis of fine-grained
navigation style identification in MOOCs backed by a large number of active
learners. The result shows 1) whilst the sequential style is clearly in
evidence, the global style is less prominent; 2) the majority of the learners
do not belong to either category; 3) navigation styles are not as stable as
believed in the literature; and 4) learners can, and do, swap between
navigation styles with detrimental effects. The approach is promising, as it
provides insight into online learners' temporal engagement, as well as a tool
to identify vulnerable learners, which potentially benefit personalised
interventions (from teachers or automatic help) in Intelligent Tutoring Systems
(ITS).
","[{'version': 'v1', 'created': 'Mon, 10 Aug 2020 19:12:21 GMT'}]",2020-08-12,"[['Shi', 'Lei', ''], ['Cristea', 'Alexandra I.', ''], ['Toda', 'Armando M.', ''], ['Oliveira', 'Wilk', '']]","['MOOCs', 'Navigation', 'Learning Styles', 'Learning Analytics']"
9674,1602.04529,Jonathan Vitale,"Jonathan Vitale, Mary-Anne Williams, Benjamin Johnston","Socially Impaired Robots: Human Social Disorders and Robots'
  Socio-Emotional Intelligence",International Conference on Social Robotics 2014,,10.1007/978-3-319-11973-1_36,,cs.RO cs.CY cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Social robots need intelligence in order to safely coexist and interact with
humans. Robots without functional abilities in understanding others and unable
to empathise might be a societal risk and they may lead to a society of
socially impaired robots. In this work we provide a survey of three relevant
human social disorders, namely autism, psychopathy and schizophrenia, as a
means to gain a better understanding of social robots' future capability
requirements. We provide evidence supporting the idea that social robots will
require a combination of emotional intelligence and social intelligence, namely
socio-emotional intelligence. We argue that a robot with a simple
socio-emotional process requires a simulation-driven model of intelligence.
Finally, we provide some critical guidelines for designing future
socio-emotional robots.
","[{'version': 'v1', 'created': 'Mon, 15 Feb 2016 00:06:34 GMT'}]",2016-05-04,"[['Vitale', 'Jonathan', ''], ['Williams', 'Mary-Anne', ''], ['Johnston', 'Benjamin', '']]","['social robots', 'socio-emotional intelligence', 'empathy', 'theoryof mind', 'simulation theory', 'autism', 'psychopathy', 'schizophrenia']"
9675,2012.14274,Kiran Garimella,"Kirill Martynov, Kiran Garimella, Robert West",Darks and Stripes: Effects of Clothing on Weight Perception,Accepted at the IEEE Journal of Social Computing,"Journal of Social Computing (Volume: 1, Issue: 1, September 2020)
  pg. 53-70",10.23919/JSC.2020.0006,,cs.CY cs.SI,http://creativecommons.org/licenses/by/4.0/,"  In many societies, appearing slim is considered attractive. The fashion
industry has been attempting to cater to this trend by designing outfits that
can enhance the appearance of slimness. Two anecdotal rules, widespread in the
world of fashion, are (1) choose dark clothes and (2) avoid horizontal stripes,
in order to appear slim. Thus far, empirical evidence has been unable to
conclusively determine the validity of these rules, and there is consequently
much controversy regarding the impact of both color and patterns on the visual
perception of weight. In this paper, we aim to close this gap by presenting the
results from a series of large-scale crowdsourcing studies that investigate the
above two claims. We gathered a dataset of around 1,000 images of people from
the Web together with their ground-truth weight and height, as well as clothing
attributes about colors and patterns. To elicit the effects of colors and
patterns, we asked crowd workers to estimate the weight in each image. For the
analysis, we controlled potential confounds by matching images in pairs where
the two images differ with respect to color or pattern, but are similar with
respect to other relevant aspects. We created image pairs in two ways: first,
observationally, i.e., from two real images; and second, experimentally, by
manipulating the color or pattern of clothing in a real image via photo
editing. Based on our analysis, we conclude that (1) dark clothes indeed
decrease perceived weight slightly but statistically significantly, and (2)
horizontal stripes have no discernible effect compared to solid light-colored
clothes. These results contribute to advancing the debate around the effect of
specific clothing colors and patterns and thus provide empirical grounds for
everyday fashion decisions. Moreover, our work gives an outlook on the vast
opportunities of using crowd sourcing in the modern fashion industry.
","[{'version': 'v1', 'created': 'Fri, 11 Dec 2020 16:14:40 GMT'}]",2020-12-29,"[['Martynov', 'Kirill', ''], ['Garimella', 'Kiran', ''], ['West', 'Robert', '']]","['clothing', 'fashion', 'weight perception', 'body size', 'crowdsourcing']"
9676,2108.06228,Erzhuo Shao,"Erzhuo Shao, Jie Feng, Yingheng Wang, Tong Xia and Yong Li",One-shot Transfer Learning for Population Mapping,"Published in Proceedings of the 30th ACM International Conference on
  Information and Knowledge Management (CIKM '21)",,10.1145/3459637.3482460,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fine-grained population distribution data is of great importance for many
applications, e.g., urban planning, traffic scheduling, epidemic modeling, and
risk control. However, due to the limitations of data collection, including
infrastructure density, user privacy, and business security, such fine-grained
data is hard to collect and usually, only coarse-grained data is available.
Thus, obtaining fine-grained population distribution from coarse-grained
distribution becomes an important problem. To tackle this problem, existing
methods mainly rely on sufficient fine-grained ground truth for training, which
is not often available for the majority of cities. That limits the applications
of these methods and brings the necessity to transfer knowledge between
data-sufficient source cities to data-scarce target cities.
  In knowledge transfer scenario, we employ single reference fine-grained
ground truth in target city, which is easy to obtain via remote sensing or
questionnaire, as the ground truth to inform the large-scale urban structure
and support the knowledge transfer in target city. By this approach, we
transform the fine-grained population mapping problem into a one-shot transfer
learning problem. In this paper, we propose a novel one-shot transfer learning
framework PSRNet to transfer spatial-temporal knowledge across cities from the
view of network structure, the view of data, and the view of optimization.
  Experiments on real-life datasets of 4 cities demonstrate that PSRNet has
significant advantages over 8 state-of-the-art baselines by reducing RMSE and
MAE by more than 25%. Our code and datasets are released in Github
(https://github.com/erzhuoshao/PSRNet-CIKM).
","[{'version': 'v1', 'created': 'Fri, 13 Aug 2021 13:19:09 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Aug 2021 17:48:58 GMT'}]",2021-08-18,"[['Shao', 'Erzhuo', ''], ['Feng', 'Jie', ''], ['Wang', 'Yingheng', ''], ['Xia', 'Tong', ''], ['Li', 'Yong', '']]","['Transfer Learning', 'Population Distribution', 'Super-resolution']"
9677,1905.01817,Song Gao,"Yuhao Kang, Qingyuan Jia, Song Gao, Xiaohuan Zeng, Yueyao Wang,
  Stephan Angsuesser, Yu Liu, Xinyue Ye, Teng Fei","Extracting human emotions at different places based on facial
  expressions and spatial clustering analysis",40 pages; 9 figures,"Transactions in GIS, Year 2019, Volume 23, Issue 3",10.1111/tgis.12552,,cs.CV cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The emergence of big data enables us to evaluate the various human emotions
at places from a statistic perspective by applying affective computing. In this
study, a novel framework for extracting human emotions from large-scale
georeferenced photos at different places is proposed. After the construction of
places based on spatial clustering of user generated footprints collected in
social media websites, online cognitive services are utilized to extract human
emotions from facial expressions using the state-of-the-art computer vision
techniques. And two happiness metrics are defined for measuring the human
emotions at different places. To validate the feasibility of the framework, we
take 80 tourist attractions around the world as an example and a happiness
ranking list of places is generated based on human emotions calculated over 2
million faces detected out from over 6 million photos. Different kinds of
geographical contexts are taken into consideration to find out the relationship
between human emotions and environmental factors. Results show that much of the
emotional variation at different places can be explained by a few factors such
as openness. The research may offer insights on integrating human emotions to
enrich the understanding of sense of place in geography and in place-based GIS.
","[{'version': 'v1', 'created': 'Mon, 6 May 2019 04:10:37 GMT'}]",2019-05-07,"[['Kang', 'Yuhao', ''], ['Jia', 'Qingyuan', ''], ['Gao', 'Song', ''], ['Zeng', 'Xiaohuan', ''], ['Wang', 'Yueyao', ''], ['Angsuesser', 'Stephan', ''], ['Liu', 'Yu', ''], ['Ye', 'Xinyue', ''], ['Fei', 'Teng', '']]","['affective computing', 'human emotion', 'place', 'big data', 'GeoAI']"
9678,2207.14292,Gerard Guillamet Busquets,"G. Guillamet, M. Rivero, M. Zavala-Ak\'e, M. V\'azquez, G. Houzeaux,
  S. Oller",A parallel algorithm for unilateral contact problems,"26 pages, 23 figures","Computers & Structures, Volume 271 (2022) 106862",10.1016/j.compstruc.2022.106862,,cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this paper, we introduce a novel parallel contact algorithm designed to
run efficiently in High-Performance Computing based supercomputers. Particular
emphasis is put on its computational implementation in a multiphysics finite
element code. The algorithm is based on the method of partial Dirichlet-Neumann
boundary conditions and is capable to solve numerically a nonlinear contact
problem between rigid and deformable bodies in a whole parallel framework. Its
distinctive characteristic is that the contact is tackled as a coupled problem,
in which the contacting bodies are treated separately, in a staggered way.
Then, the coupling is performed through the exchange of boundary conditions at
the contact interface following a Gauss-Seidel strategy. To validate this
algorithm we conducted several benchmark tests by comparing the proposed
solution against theoretical and other numerical solutions. Finally, we
evaluated the parallel performance of the proposed algorithm in a real impact
test to show its capabilities for large-scale applications.
","[{'version': 'v1', 'created': 'Wed, 27 Jul 2022 16:25:41 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Aug 2022 07:26:32 GMT'}]",2022-08-02,"[['Guillamet', 'G.', ''], ['Rivero', 'M.', ''], ['Zavala-Aké', 'M.', ''], ['Vázquez', 'M.', ''], ['Houzeaux', 'G.', ''], ['Oller', 'S.', '']]","['Contact mechanics', 'Dirichlet-Neumann boundary conditions', 'Finite element method', 'High performancecomputing', 'Domain decomposition approach']"
9679,1911.07449,Junfeng Li,"Junfeng Li, Sameer G. Kulkarni, K. K. Ramakrishnan, Dan Li","Understanding Open Source Serverless Platforms: Design Considerations
  and Performance",,"Proceedings of the 5th International Workshop on Serverless
  Computing, Pages 37-42, 2019",10.1145/3366623.3368139,,cs.PF cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Serverless computing is increasingly popular because of the promise of lower
cost and the convenience it provides to users who do not need to focus on
server management. This has resulted in the availability of a number of
proprietary and open-source serverless solutions. We seek to understand how the
performance of serverless computing depends on a number of design issues using
several popular open-source serverless platforms. We identify the
idiosyncrasies affecting performance (throughput and latency) for different
open-source serverless platforms. Further, we observe that just having either
resource-based (CPU and memory) or workload-based (request per second (RPS) or
concurrent requests) auto-scaling is inadequate to address the needs of the
serverless platforms.
","[{'version': 'v1', 'created': 'Mon, 18 Nov 2019 06:42:15 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Nov 2019 20:17:34 GMT'}, {'version': 'v3', 'created': 'Thu, 28 Nov 2019 18:53:02 GMT'}, {'version': 'v4', 'created': 'Fri, 13 Dec 2019 00:46:38 GMT'}]",2019-12-16,"[['Li', 'Junfeng', ''], ['Kulkarni', 'Sameer G.', ''], ['Ramakrishnan', 'K. K.', ''], ['Li', 'Dan', '']]","['serverless', 'function-as-a-service', 'performance']"
9680,2206.00502,Christoph Schweimer,Christoph Schweimer,"Fast generation of simple directed social network graphs with reciprocal
  edges and high clustering","6 pages, 1 figure","Soc. Netw. Anal. Min. 12, 127 (2022)",10.1007/s13278-022-00963-z,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Online social networks have emerged as useful tools to communicate or share
information and news on a daily basis. One of the most popular networks is
Twitter, where users connect to each other via directed follower relationships.
Researchers have studied Twitter follower graphs and described them with
various topological features. Collecting Twitter data, especially crawling the
followers of users, is a tedious and time-consuming process and the data needs
to be treated carefully due to its sensitive nature, containing personal user
information. We therefore aim at the fast generation of synthetic directed
social network graphs with reciprocal edges and high clustering. Our proposed
method is based on a previously developed model, but relies on less
hyperparameters and has a significantly lower runtime. Results show that the
method does not only replicate the crawled directed Twitter graphs well w.r.t.
several topological features and the application of an epidemics spreading
process, but that it is also highly scalable which allows the fast creation of
bigger graphs that exhibit similar properties as real-world networks.
","[{'version': 'v1', 'created': 'Wed, 1 Jun 2022 14:00:39 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Aug 2022 09:09:15 GMT'}]",2022-09-07,"[['Schweimer', 'Christoph', '']]","['Social Network Graphs', 'Social Network Modeling', 'Random GraphGeneration', 'High Clustering']"
9681,2004.06266,Zhu Su,"Zongkai Yang, Zhu Su, Sannyuya Liu, Zhi Liu, Wenxiang Ke and Liang
  Zhao","Evolution Features and Behavior Characters of Friendship Networks on
  Campus Life",,"Expert Systems with Applications, 2020",10.1016/j.eswa.2020.113519,"Volume 158, 15 November 2020, 113519",cs.SI physics.soc-ph stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Analyzing and mining students' behaviors and interactions from big data is an
essential part of education data mining. Based on the data of campus smart
cards, which include not only static demographic information but also dynamic
behavioral data from more than 30000 anonymous students, in this paper, the
evolution features of friendship and the relations between behavior characters
and student interactions are investigated. On the one hand, four different
evolving friendship networks are constructed by means of the friend ties
proposed in this paper, which are extracted from monthly consumption records.
In addition, the features of the giant connected components (GCCs) of
friendship networks are analyzed via social network analysis (SNA) and
percolation theory. On the other hand, two high-level behavior characters,
orderliness and diligence, are adopted to analyze their associations with
student interactions. Our experiment/empirical results indicate that the sizes
of friendship networks have declined with time growth and both the small-world
effect and power-law degree distribution are found in friendship networks.
Second, the results of the assortativity coefficient of both orderliness and
diligence verify that there are strong peer effects among students. Finally,
the percolation analysis of orderliness on friendship networks shows that a
phase transition exists, which is enlightening in that swarm intelligence can
be realized by intervening the key students near the transition point.
","[{'version': 'v1', 'created': 'Tue, 14 Apr 2020 02:01:27 GMT'}]",2020-06-03,"[['Yang', 'Zongkai', ''], ['Su', 'Zhu', ''], ['Liu', 'Sannyuya', ''], ['Liu', 'Zhi', ''], ['Ke', 'Wenxiang', ''], ['Zhao', 'Liang', '']]","['Evolution feature', 'Behavior character', 'Friendship network', 'Percolation theory']"
9682,2004.11081,Mohammed Belkhatir,"Mohammed Maree, Mohammed Belkhatir","Coupling semantic and statistical techniques for dynamically enriching
  web ontologies",,Journal Intelligent Information Systems 2013,10.1007/s10844-012-0233-4,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the development of the Semantic Web technology, the use of ontologies to
store and retrieve information covering several domains has increased. However,
very few ontologies are able to cope with the ever-growing need of frequently
updated semantic information or specific user requirements in specialized
domains. As a result, a critical issue is related to the unavailability of
relational information between concepts, also coined missing background
knowledge. One solution to address this issue relies on the manual enrichment
of ontologies by domain experts which is however a time consuming and costly
process, hence the need for dynamic ontology enrichment. In this paper we
present an automatic coupled statistical/semantic framework for dynamically
enriching large-scale generic ontologies from the World Wide Web. Using the
massive amount of information encoded in texts on the Web as a corpus, missing
background knowledge can therefore be discovered through a combination of
semantic relatedness measures and pattern acquisition techniques and
subsequently exploited. The benefits of our approach are: (i) proposing the
dynamic enrichment of large-scale generic ontologies with missing background
knowledge, and thus, enabling the reuse of such knowledge, (ii) dealing with
the issue of costly ontological manual enrichment by domain experts.
Experimental results in a precision-based evaluation setting demonstrate the
effectiveness of the proposed techniques.
","[{'version': 'v1', 'created': 'Thu, 23 Apr 2020 11:21:30 GMT'}]",2020-04-24,"[['Maree', 'Mohammed', ''], ['Belkhatir', 'Mohammed', '']]","['large-scale ontologies', 'dynamic ontology enrichment', 'missing background knowledge', 'semantic relatedness', 'precision-based evaluation']"
9683,2010.02505,Boris Oreshkin N,Boris N. Oreshkin and Tal Arbel,"Optimization over Random and Gradient Probabilistic Pixel Sampling for
  Fast, Robust Multi-Resolution Image Registration",arXiv admin note: substantial text overlap with arXiv:2010.00988,"WBIR 2012. Lecture Notes in Computer Science, vol 7359. Springer,
  Berlin, Heidelberg",10.1007/978-3-642-31340-0_16,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an approach to fast image registration through
probabilistic pixel sampling. We propose a practical scheme to leverage the
benefits of two state-of-the-art pixel sampling approaches: gradient magnitude
based pixel sampling and uniformly random sampling. Our framework involves
learning the optimal balance between the two sampling schemes off-line during
training, based on a small training dataset, using particle swarm optimization.
We then test the proposed sampling approach on 3D rigid registration against
two state-of-the-art approaches based on the popular, publicly available,
Vanderbilt RIRE dataset. Our results indicate that the proposed sampling
approach yields much faster, accurate and robust registration results when
compared against the state-of-the-art.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2020 13:43:50 GMT'}]",2020-10-07,"[['Oreshkin', 'Boris N.', ''], ['Arbel', 'Tal', '']]","['image registration', 'pixel selection', 'sampling']"
9684,2206.11023,Hung Phan D,Hung Phan and Ali Jannesari,Heterogeneous Graph Neural Networks for Software Effort Estimation,"Accepted in the Technical Papers Track of the 16th International
  Symposium on Empirical Software Engineering and Measurement, 2022 (ESEM 2022)",,10.1145/3544902.3546248,,cs.SE cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Software effort can be measured by story point [35]. Current approaches for
automatically estimating story points focus on applying pre-trained embedding
models and deep learning for text regression to solve this problem which
required expensive embedding models. We propose HeteroSP, a tool for estimating
story points from textual input of Agile software project issues. We select
GPT2SP [12] and Deep-SE [8] as the baselines for comparison. First, from the
analysis of the story point dataset [8], we conclude that software issues are
actually a mixture of natural language sentences with quoted code snippets and
have problems related to large-size vocabulary. Second, we provide a module to
normalize the input text including words and code tokens of the software
issues. Third, we design an algorithm to convert an input software issue to a
graph with different types of nodes and edges. Fourth, we construct a
heterogeneous graph neural networks model with the support of fastText [6] for
constructing initial node embedding to learn and predict the story points of
new issues. We did the comparison over three scenarios of estimation, including
within project, cross-project within the repository, and cross-project cross
repository with our baseline approaches. We achieve the average Mean Absolute
Error (MAE) as 2.38, 2.61, and 2.63 for three scenarios. We outperform GPT2SP
in 2/3 of the scenarios while outperforming Deep-SE in the most challenging
scenario with significantly less amount of running time. We also compare our
approaches with different homogeneous graph neural network models and the
results show that the heterogeneous graph neural networks model outperforms the
homogeneous models in story point estimation. For time performance, we achieve
about 570 seconds as the time performance in both three processes: node
embedding initialization, model construction, and story point estimation.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2022 12:46:02 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Jun 2022 20:47:03 GMT'}]",2022-07-04,"[['Phan', 'Hung', ''], ['Jannesari', 'Ali', '']]","['software effort estimation', 'heterogeneous graph transformer', 'graphneural networks']"
9685,2007.06315,Jasper Brown,"Jasper Brown, Salah Sukkarieh","Design and Evaluation of a Modular Robotic Plum Harvesting System
  Utilising Soft Components","25 pages, 12 figures, 4 tables. Experimental data available at
  http://data.acfr.usyd.edu.au/Agriculture/PlumHarvesting",Journal of Field Robotics. 2021. 38: 28--306,10.1002/rob.21987,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The human labour required for tree crop harvesting is a major cost component
in fruit production and is increasing. To address this, many existing research
works have sought to demonstrate commercially viable robotic harvesting for
tree crops, though successful commercial products resulting from these have
been few and far between. Systems developed for specific crops such as sweet
peppers or apples have shown promise, but the vast majority of cultivar types
remain unaddressed and developing a specific system for each one is
inefficient. In this work a flexible and modular development platform is
presented, this can be used to test specific design choices on different fruit
and growing conditions. The system is evaluated in a commercial plum orchard,
with no crop modifications. Some existing techniques are found to be
counterproductive for plums, while soft robotics and persistent target tracking
significantly improve performance. A harvest success rate of 42% was observed,
with lower than expected effectiveness based on prior testing with apples. The
plum type and growing style pose unique challenges which are examined in the
context of system module design choices.
","[{'version': 'v1', 'created': 'Mon, 13 Jul 2020 11:18:59 GMT'}]",2021-10-05,"[['Brown', 'Jasper', ''], ['Sukkarieh', 'Salah', '']]","['terrestrial robotics', 'agriculture', 'tree crops', 'harvesting', 'soft robotics']"
9686,1804.01226,Hongyu Liu,"Hongyu Liu, Sam Silvestro, Wei Wang, Chen Tian, and Tongping Liu","iReplayer: In-situ and Identical Record-and-Replay for Multithreaded
  Applications","16 pages, 5 figures, to be published at PLDI'18",,10.1145/3192366.3192380,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reproducing executions of multithreaded programs is very challenging due to
many intrinsic and external non-deterministic factors. Existing RnR systems
achieve significant progress in terms of performance overhead, but none targets
the in-situ setting, in which replay occurs within the same process as the
recording process. Also, most existing work cannot achieve identical replay,
which may prevent the reproduction of some errors.
  This paper presents iReplayer, which aims to identically replay multithreaded
programs in the original process (under the ""in-situ"" setting). The novel
in-situ and identical replay of iReplayer makes it more likely to reproduce
errors, and allows it to directly employ debugging mechanisms (e.g.
watchpoints) to aid failure diagnosis. Currently, iReplayer only incurs 3%
performance overhead on average, which allows it to be always enabled in the
production environment. iReplayer enables a range of possibilities, and this
paper presents three examples: two automatic tools for detecting buffer
overflows and use-after-free bugs, and one interactive debugging tool that is
integrated with GDB.
","[{'version': 'v1', 'created': 'Wed, 4 Apr 2018 03:26:13 GMT'}]",2018-04-05,"[['Liu', 'Hongyu', ''], ['Silvestro', 'Sam', ''], ['Wang', 'Wei', ''], ['Tian', 'Chen', ''], ['Liu', 'Tongping', '']]","['Record-and-Replay', 'Identical Replay', 'Insitu Replay', 'Multithreaded Debugging']"
9687,2104.07460,Guixin Ye,"Guixin Ye, Zhanyong Tang, Shin Hwei Tan, Songfang Huang, Dingyi Fang,
  Xiaoyang Sun, Lizhong Bian, Haibo Wang, Zheng Wang","Automated Conformance Testing for JavaScript Engines via Deep Compiler
  Fuzzing",PLDI 2021,,10.1145/3453483.3454054,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  JavaScript (JS) is a popular, platform-independent programming language. To
ensure the interoperability of JS programs across different platforms, the
implementation of a JS engine should conform to the ECMAScript standard.
However, doing so is challenging as there are many subtle definitions of API
behaviors, and the definitions keep evolving.
  We present COMFORT, a new compiler fuzzing framework for detecting JS engine
bugs and behaviors that deviate from the ECMAScript standard. COMFORT leverages
the recent advance in deep learning-based language models to automatically
generate JS test code. As a departure from prior fuzzers, COMFORT utilizes the
well-structured ECMAScript specifications to automatically generate test data
along with the test programs to expose bugs that could be overlooked by the
developers or manually written test cases. COMFORT then applies differential
testing methodologies on the generated test cases to expose standard
conformance bugs. We apply COMFORT to ten mainstream JS engines. In 200 hours
of automated concurrent testing runs, we discover bugs in all tested JS
engines. We had identified 158 unique JS engine bugs, of which 129 have been
verified, and 115 have already been fixed by the developers. Furthermore, 21 of
the Comfort-generated test cases have been added to Test262, the official
ECMAScript conformance test suite.
","[{'version': 'v1', 'created': 'Thu, 15 Apr 2021 13:47:42 GMT'}]",2021-04-16,"[['Ye', 'Guixin', ''], ['Tang', 'Zhanyong', ''], ['Tan', 'Shin Hwei', ''], ['Huang', 'Songfang', ''], ['Fang', 'Dingyi', ''], ['Sun', 'Xiaoyang', ''], ['Bian', 'Lizhong', ''], ['Wang', 'Haibo', ''], ['Wang', 'Zheng', '']]","['JavaScript', 'Conformance bugs', 'Compiler fuzzing', 'Differential testing', 'Deep learning']"
9688,2208.02598,Jadson Santos,"Jadson Santos, Daniel Alencar da Costa, Uir\'a Kulesza","Investigating the Impact of Continuous Integration Practices on the
  Productivity and Quality of Open-Source Projects","Paper accepted for publication by The ACM/IEEE International
  Symposium on Empirical Software Engineering and Measurement (ESEM)",,10.1145/3544902.3546244,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Much research has been conducted to investigate the impact of
Continuous Integration (CI) on the productivity and quality of open-source
projects. Most of studies have analyzed the impact of adopting a CI server
service (e.g, Travis-CI) but did not analyze CI sub-practices. Aims: We aim to
evaluate the impact of five CI sub-practices with respect to the productivity
and quality of GitHub open-source projects. Method: We collect CI sub-practices
of 90 relevant open-source projects for a period of 2 years. We use regression
models to analyze whether projects upholding the CI sub-practices are more
productive and/or generate fewer bugs. We also perform a qualitative document
analysis to understand whether CI best practices are related to a higher
quality of projects. Results: Our findings reveal a correlation between the
Build Activity and Commit Activity sub-practices and the number of merged pull
requests. We also observe a correlation between the Build Activity, Build
Health and Time to Fix Broken Builds sub-practices and number of bug-related
issues. The qualitative analysis reveals that projects with the best values for
CI sub-practices face fewer CI-related problems compared to projects that
exhibit the worst values for CI sub-practices. Conclusions: We recommend that
projects should strive to uphold the several CI sub-practices as they can
impact in the productivity and quality of projects.
","[{'version': 'v1', 'created': 'Thu, 4 Aug 2022 11:54:00 GMT'}]",2022-08-05,"[['Santos', 'Jadson', ''], ['da Costa', 'Daniel Alencar', ''], ['Kulesza', 'Uirá', '']]","['Continuous Integration', 'CI Sub-Practices', 'CI Maturity', 'SoftwareProductivity', 'Software Quality']"
9689,1601.06664,Usman Raza,"Usman Raza, Alessandro Bogliolo, Valerio Freschi, Emanuele Lattanzi,
  Amy L. Murphy","A Two-Prong Approach to Energy-Efficient WSNs: Wake-Up Receivers plus
  Dedicated, Model-Based Sensing","30 pages, 7 figures, 5 tables",,10.1016/j.adhoc.2016.03.005,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Energy neutral operation of WSNs can be achieved by exploiting the idleness
of the workload to bring the average power consumption of each node below the
harvesting power available. This paper proposes a combination of
state-of-the-art low-power design techniques to minimize the local and global
impact of the two main activities of each node: sampling and communication.
Dynamic power management is adopted to exploit low-power modes during idle
periods, while asynchronous wake-up and prediction-based data collection are
used to opportunistically activate hardware components and network nodes only
when they are strictly required. Furthermore, the concept of ""model-based
sensing"" is introduced to push prediction-based data collection techniques as
close as possible to the sensing elements. The results achieved on
representative real-world WSN case studies show that the combined benefits of
the design techniques adopted is more than linear, providing an overall power
reduction of more than 3 orders of magnitude.
","[{'version': 'v1', 'created': 'Mon, 25 Jan 2016 16:44:47 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Mar 2016 10:49:44 GMT'}]",2016-03-21,"[['Raza', 'Usman', ''], ['Bogliolo', 'Alessandro', ''], ['Freschi', 'Valerio', ''], ['Lattanzi', 'Emanuele', ''], ['Murphy', 'Amy L.', '']]","['Wireless Sensor Network', 'Wake-up receiver', 'Energyharvesting', 'Model-based sensing', 'Energetic sustainability']"
9690,2203.15950,Tushar Sharma,"Preetha Chatterjee, Tushar Sharma, Paul Ralph",Empirical Standards for Repository Mining,,,10.1145/3524842.3528032,,cs.DL cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The purpose of scholarly peer review is to evaluate the quality of scientific
manuscripts. However, study after study demonstrates that peer review neither
effectively nor reliably assesses research quality. Empirical standards attempt
to address this problem by modelling a scientific community's expectations for
each kind of empirical study conducted in that community. This should enhance
not only the quality of research but also the reliability and predictability of
peer review, as scientists adopt the standards in both their researcher and
reviewer roles. However, these improvements depend on the quality and adoption
of the standards. This tutorial will therefore present the empirical standard
for mining software repositories, both to communicate its contents and to get
feedback from the attendees. The tutorial will be organized into three parts:
(1) brief overview of the empirical standards project; (2) detailed
presentation of the repository mining standard; (3) discussion and suggestions
for improvement.
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2022 23:45:43 GMT'}]",2022-03-31,"[['Chatterjee', 'Preetha', ''], ['Sharma', 'Tushar', ''], ['Ralph', 'Paul', '']]","['Mining software repositories', 'Empirical standards', 'scholarly peerreview']"
9691,2101.08887,Geunsik Lim,"Geunsik Lim, Minho Lee, R.J.W.E. Lahaye, and Young Ik Eom",Distributed Compilation System for High-Speed Software Build Processes,,,10.1109/BIGCOMP.2014.6741419,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The idle time of personal computers has increased steadily due to the
generalization of computer usage and cloud computing. Clustering research aims
at utilizing idle computer resources for processing a variable workload on a
large number of computers. The workload is processed continually despite the
volatile status of the individual computer resources. This paper proposes a
distributed compilation system for improving the processing speed of
CPU-intensive software compilations. This significantly reduces the compilation
time of mass sources by using the idle resources. We expect gains of up to 65%
compared to non-distributed compilation systems.
","[{'version': 'v1', 'created': 'Thu, 21 Jan 2021 23:24:39 GMT'}]",2021-01-25,"[['Lim', 'Geunsik', ''], ['Lee', 'Minho', ''], ['Lahaye', 'R. J. W. E.', ''], ['Eom', 'Young Ik', '']]","['Distributed Computing', 'Grid Computing', 'HighPerformance Computing', 'High-Throughput Computing', 'Super Computing', 'Distributed Compilation']"
9692,2202.03120,Guilherme Moraes Rosa,"Guilherme Moraes Rosa, Ruan Chaves Rodrigues, Roberto de Alencar
  Lotufo, Rodrigo Nogueira",To Tune or Not To Tune? Zero-shot Models for Legal Case Entailment,,,10.1145/3462757.3466103,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There has been mounting evidence that pretrained language models fine-tuned
on large and diverse supervised datasets can transfer well to a variety of
out-of-domain tasks. In this work, we investigate this transfer ability to the
legal domain. For that, we participated in the legal case entailment task of
COLIEE 2021, in which we use such models with no adaptations to the target
domain. Our submissions achieved the highest scores, surpassing the second-best
team by more than six percentage points. Our experiments confirm a
counter-intuitive result in the new paradigm of pretrained language models:
given limited labeled data, models with little or no adaptation to the target
task can be more robust to changes in the data distribution than models
fine-tuned on it. Code is available at https://github.com/neuralmind-ai/coliee.
","[{'version': 'v1', 'created': 'Mon, 7 Feb 2022 13:02:48 GMT'}]",2022-02-08,"[['Rosa', 'Guilherme Moraes', ''], ['Rodrigues', 'Ruan Chaves', ''], ['Lotufo', 'Roberto de Alencar', ''], ['Nogueira', 'Rodrigo', '']]","['Legal NLP', 'Legal Case Entailment', 'Deberta', 'T5', 'Zero-shot']"
9693,2210.02260,Vahid Yazdanpanah,"Mohammad Divband Soorati, Enrico H. Gerding, Enrico Marchioni, Pavel
  Naumov, Timothy J. Norman, Sarvapali D. Ramchurn, Bahar Rastegari, Adam
  Sobey, Sebastian Stein, Danesh Tarpore, Vahid Yazdanpanah, Jie Zhang",From Intelligent Agents to Trustworthy Human-Centred Multiagent Systems,"Appears in the Special Issue on Multi-Agent Systems Research in the
  United Kingdom","AI Communications, vol. 35, no. 4, pp. 443-457, 2022",10.3233/AIC-220127,,cs.MA cs.AI,http://creativecommons.org/licenses/by/4.0/,"  The Agents, Interaction and Complexity research group at the University of
Southampton has a long track record of research in multiagent systems (MAS). We
have made substantial scientific contributions across learning in MAS,
game-theoretic techniques for coordinating agent systems, and formal methods
for representation and reasoning. We highlight key results achieved by the
group and elaborate on recent work and open research challenges in developing
trustworthy autonomous systems and deploying human-centred AI systems that aim
to support societal good.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2022 13:40:38 GMT'}]",2022-10-06,"[['Soorati', 'Mohammad Divband', ''], ['Gerding', 'Enrico H.', ''], ['Marchioni', 'Enrico', ''], ['Naumov', 'Pavel', ''], ['Norman', 'Timothy J.', ''], ['Ramchurn', 'Sarvapali D.', ''], ['Rastegari', 'Bahar', ''], ['Sobey', 'Adam', ''], ['Stein', 'Sebastian', ''], ['Tarpore', 'Danesh', ''], ['Yazdanpanah', 'Vahid', ''], ['Zhang', 'Jie', '']]","['Multiagent Systems', 'Intelligent Agents', 'Distributed Artificial Intelligence', 'Trustworthy Autonomous Systems']"
9694,1909.01207,Nikolaos Zioulis Mr.,"Vladimiros Sterzentsenko, Antonis Karakottas, Alexandros Papachristou,
  Nikolaos Zioulis, Alexandros Doumanoglou, Dimitrios Zarpalas, Petros Daras","A Low-Cost, Flexible and Portable Volumetric Capturing System",System available at https://github.com/VCL3D/VolumetricCapture,,10.1109/SITIS.2018.00038,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-view capture systems are complex systems to engineer. They require
technical knowledge to install and intricate processes to setup related mainly
to the sensors' spatial alignment (i.e. external calibration). However, with
the ongoing developments in new production methods, we are now at a position
where the production of high quality realistic 3D assets is possible even with
commodity sensors. Nonetheless, the capturing systems developed with these
methods are heavily intertwined with the methods themselves, relying on custom
solutions and seldom - if not at all - publicly available. In light of this, we
design, develop and publicly offer a multi-view capture system based on the
latest RGB-D sensor technology. For our system, we develop a portable and
easy-to-use external calibration method that greatly reduces the effort and
knowledge required, as well as simplify the overall process.
","[{'version': 'v1', 'created': 'Tue, 3 Sep 2019 14:23:24 GMT'}]",2019-09-04,"[['Sterzentsenko', 'Vladimiros', ''], ['Karakottas', 'Antonis', ''], ['Papachristou', 'Alexandros', ''], ['Zioulis', 'Nikolaos', ''], ['Doumanoglou', 'Alexandros', ''], ['Zarpalas', 'Dimitrios', ''], ['Daras', 'Petros', '']]","['Multi-view system', '3D Capture', 'RGB-D', 'Registration', 'Multi-sensor calibration', 'VR', 'AR', 'Intel RealSense']"
9695,2007.00914,Eugenio Mart\'inez-C\'amara,"Nuria Rodr\'iguez-Barroso, Goran Stipcich, Daniel Jim\'enez-L\'opez,
  Jos\'e Antonio Ruiz-Mill\'an, Eugenio Mart\'inez-C\'amara, Gerardo
  Gonz\'alez-Seco, M. Victoria Luz\'on, Miguel \'Angel Veganzones, Francisco
  Herrera","Federated Learning and Differential Privacy: Software tools analysis,
  the Sherpa.ai FL framework and methodological guidelines for preserving data
  privacy","46 pages, 5 figures",Information Fusion 64 (2020) 270-292,10.1016/j.inffus.2020.07.009,,cs.LG cs.AI cs.CR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The high demand of artificial intelligence services at the edges that also
preserve data privacy has pushed the research on novel machine learning
paradigms that fit those requirements. Federated learning has the ambition to
protect data privacy through distributed learning methods that keep the data in
their data silos. Likewise, differential privacy attains to improve the
protection of data privacy by measuring the privacy loss in the communication
among the elements of federated learning. The prospective matching of federated
learning and differential privacy to the challenges of data privacy protection
has caused the release of several software tools that support their
functionalities, but they lack of the needed unified vision for those
techniques, and a methodological workflow that support their use. Hence, we
present the Sherpa.ai Federated Learning framework that is built upon an
holistic view of federated learning and differential privacy. It results from
the study of how to adapt the machine learning paradigm to federated learning,
and the definition of methodological guidelines for developing artificial
intelligence services based on federated learning and differential privacy. We
show how to follow the methodological guidelines with the Sherpa.ai Federated
Learning framework by means of a classification and a regression use cases.
","[{'version': 'v1', 'created': 'Thu, 2 Jul 2020 06:47:35 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Oct 2020 07:39:39 GMT'}]",2020-10-07,"[['Rodríguez-Barroso', 'Nuria', ''], ['Stipcich', 'Goran', ''], ['Jiménez-López', 'Daniel', ''], ['Ruiz-Millán', 'José Antonio', ''], ['Martínez-Cámara', 'Eugenio', ''], ['González-Seco', 'Gerardo', ''], ['Luzón', 'M. Victoria', ''], ['Veganzones', 'Miguel Ángel', ''], ['Herrera', 'Francisco', '']]","['federated learning', 'differential privacy', 'software framework', 'Sherpa']"
9696,1706.10215,Swapnil Dhamal,Swapnil Dhamal and Y. Narahari,Formation of Stable Strategic Networks with Desired Topologies,"The original publication appears in Studies in Microeconomics, volume
  3, number 2, pages 158-213, 2015, and is available at
  http://journals.sagepub.com/doi/pdf/10.1177/2321022215588873","Studies in Microeconomics, vol. 3, no. 2, pp. 158-213 (2015)",10.1177/2321022215588873,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many real-world networks such as social networks consist of strategic agents.
The topology of these networks often plays a crucial role in determining the
ease and speed with which certain information driven tasks can be accomplished.
Consequently, growing a stable network having a certain desired topology is of
interest. Motivated by this, we study the following important problem: given a
certain desired topology, under what conditions would best response link
alteration strategies adopted by strategic agents, uniquely lead to formation
of a stable network having the given topology. This problem is the inverse of
the classical network formation problem where we are concerned with determining
stable topologies, given the conditions on the network parameters. We study
this interesting inverse problem by proposing (1) a recursive model of network
formation and (2) a utility model that captures key determinants of network
formation. Building upon these models, we explore relevant topologies such as
star graph, complete graph, bipartite Turan graph, and multiple stars with
interconnected centers. We derive a set of sufficient conditions under which
these topologies uniquely emerge, study their social welfare properties, and
investigate the effects of deviating from the derived conditions.
","[{'version': 'v1', 'created': 'Fri, 30 Jun 2017 14:28:35 GMT'}]",2017-07-03,"[['Dhamal', 'Swapnil', ''], ['Narahari', 'Y.', '']]","['strategic networks', 'network formation', 'social welfare', 'game theory', 'pairwisestability', 'network topology', 'graph edit distance']"
9697,2108.08307,Chung-Yi Lin,"Chung-Yi Lin, Hung-Ting Su, Shen-Lung Tung, Winston H. Hsu","Multivariate and Propagation Graph Attention Network for
  Spatial-Temporal Prediction with Outdoor Cellular Traffic","5 pages, 5 figures",,10.1145/3459637.3482152,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Spatial-temporal prediction is a critical problem for intelligent
transportation, which is helpful for tasks such as traffic control and accident
prevention. Previous studies rely on large-scale traffic data collected from
sensors. However, it is unlikely to deploy sensors in all regions due to the
device and maintenance costs. This paper addresses the problem via outdoor
cellular traffic distilled from over two billion records per day in a telecom
company, because outdoor cellular traffic induced by user mobility is highly
related to transportation traffic. We study road intersections in urban and aim
to predict future outdoor cellular traffic of all intersections given historic
outdoor cellular traffic. Furthermore, we propose a new model for multivariate
spatial-temporal prediction, mainly consisting of two extending graph attention
networks (GAT). First GAT is used to explore correlations among multivariate
cellular traffic. Another GAT leverages the attention mechanism into graph
propagation to increase the efficiency of capturing spatial dependency.
Experiments show that the proposed model significantly outperforms the
state-of-the-art methods on our dataset.
","[{'version': 'v1', 'created': 'Wed, 18 Aug 2021 17:31:11 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Aug 2021 02:44:31 GMT'}, {'version': 'v3', 'created': 'Mon, 23 Aug 2021 05:59:52 GMT'}]",2021-08-24,"[['Lin', 'Chung-Yi', ''], ['Su', 'Hung-Ting', ''], ['Tung', 'Shen-Lung', ''], ['Hsu', 'Winston H.', '']]","['Multivariate spatial-temporal prediction', 'graph attention network', 'outdoor cellular traffic']"
9698,1708.03178,Marius Kamp,"Georg Dotzler, Marius Kamp, Patrick Kreutzer, Michael Philippsen",More Accurate Recommendations for Method-Level Changes,"11 pages, 11 figures",,10.1145/3106237.3106276,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During the life span of large software projects, developers often apply the
same code changes to different code locations in slight variations. Since the
application of these changes to all locations is time-consuming and
error-prone, tools exist that learn change patterns from input examples, search
for possible pattern applications, and generate corresponding recommendations.
In many cases, the generated recommendations are syntactically or semantically
wrong due to code movements in the input examples. Thus, they are of low
accuracy and developers cannot directly copy them into their projects without
adjustments.
  We present the Accurate REcommendation System (ARES) that achieves a higher
accuracy than other tools because its algorithms take care of code movements
when creating patterns and recommendations. On average, the recommendations by
ARES have an accuracy of 96% with respect to code changes that developers have
manually performed in commits of source code archives. At the same time ARES
achieves precision and recall values that are on par with other tools.
","[{'version': 'v1', 'created': 'Thu, 10 Aug 2017 12:14:01 GMT'}]",2017-08-11,"[['Dotzler', 'Georg', ''], ['Kamp', 'Marius', ''], ['Kreutzer', 'Patrick', ''], ['Philippsen', 'Michael', '']]","['Program transformation', 'refactoring', 'recommendation system']"
9699,2203.05695,Devansh Saxena,"Devansh Saxena, Charlie Repaci, Melanie Sage, Shion Guha","How to Train a (Bad) Algorithmic Caseworker: A Quantitative
  Deconstruction of Risk Assessments in Child-Welfare",,,10.1145/3491101.3519771,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Child welfare (CW) agencies use risk assessment tools as a means to achieve
evidence-based, consistent, and unbiased decision-making. These risk
assessments act as data collection mechanisms and have further evolved into
algorithmic systems in recent years. Moreover, several of these algorithms have
reinforced biased theoretical constructs and predictors because of the easy
availability of structured assessment data. In this study, we critically
examine the Washington Assessment of Risk Model (WARM), a prominent risk
assessment tool that has been adopted by over 30 states in the United States
and has been repurposed into more complex algorithms. We compared WARM against
the narrative coding of casenotes written by caseworkers who used WARM. We
found significant discrepancies between the casenotes and WARM data where WARM
scores did not not mirror caseworkers' notes about family risk. We provide the
SIGCHI community with some initial findings from the quantitative
de-construction of a child-welfare algorithm.
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2022 01:05:45 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Dec 2022 03:00:48 GMT'}]",2022-12-21,"[['Saxena', 'Devansh', ''], ['Repaci', 'Charlie', ''], ['Sage', 'Melanie', ''], ['Guha', 'Shion', '']]","['risk assessments', 'algorithmic decision-making', 'algorithmic bias']"
9700,2107.06212,Bharadwaj Manda,"Bharadwaj Manda, Shubham Dhayarkar, Sai Mitheran, V.K. Viekash,
  Ramanathan Muthuganapathy","'CADSketchNet' -- An Annotated Sketch dataset for 3D CAD Model Retrieval
  with Deep Neural Networks","Computers & Graphics Journal, Special Section on 3DOR 2021","Computers & Graphics, Volume 99, 2021, Pages 100-113, ISSN
  0097-8493",10.1016/j.cag.2021.07.001,,cs.CV cs.AI cs.GR cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Ongoing advancements in the fields of 3D modelling and digital archiving have
led to an outburst in the amount of data stored digitally. Consequently,
several retrieval systems have been developed depending on the type of data
stored in these databases. However, unlike text data or images, performing a
search for 3D models is non-trivial. Among 3D models, retrieving 3D
Engineering/CAD models or mechanical components is even more challenging due to
the presence of holes, volumetric features, presence of sharp edges etc., which
make CAD a domain unto itself. The research work presented in this paper aims
at developing a dataset suitable for building a retrieval system for 3D CAD
models based on deep learning. 3D CAD models from the available CAD databases
are collected, and a dataset of computer-generated sketch data, termed
'CADSketchNet', has been prepared. Additionally, hand-drawn sketches of the
components are also added to CADSketchNet. Using the sketch images from this
dataset, the paper also aims at evaluating the performance of various retrieval
system or a search engine for 3D CAD models that accepts a sketch image as the
input query. Many experimental models are constructed and tested on
CADSketchNet. These experiments, along with the model architecture, choice of
similarity metrics are reported along with the search results.
","[{'version': 'v1', 'created': 'Tue, 13 Jul 2021 16:10:16 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Jul 2021 06:26:54 GMT'}]",2021-07-21,"[['Manda', 'Bharadwaj', ''], ['Dhayarkar', 'Shubham', ''], ['Mitheran', 'Sai', ''], ['Viekash', 'V. K.', ''], ['Muthuganapathy', 'Ramanathan', '']]","['Retrieval', 'Search', 'Dataset', 'Deep Learning', 'CAD', 'Sketch']"
9701,2203.03914,Ling Gao,"Xin Peng, Yifu Wang, Ling Gao, Laurent Kneip",Globally-Optimal Event Camera Motion Estimation,,"European Conference on Computer Vision (ECCV), 2020",10.1007/978-3-030-58574-7_4,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Event cameras are bio-inspired sensors that perform well in HDR conditions
and have high temporal resolution. However, different from traditional
frame-based cameras, event cameras measure asynchronous pixel-level brightness
changes and return them in a highly discretised format, hence new algorithms
are needed. The present paper looks at fronto-parallel motion estimation of an
event camera. The flow of the events is modeled by a general homographic
warping in a space-time volume, and the objective is formulated as a
maximisation of contrast within the image of unwarped events. However, in stark
contrast to prior art, we derive a globally optimal solution to this generally
non-convex problem, and thus remove the dependency on a good initial guess. Our
algorithm relies on branch-and-bound optimisation for which we derive novel,
recursive upper and lower bounds for six different contrast estimation
functions. The practical validity of our approach is supported by a highly
successful application to AGV motion estimation with a downward facing event
camera, a challenging scenario in which the sensor experiences fronto-parallel
motion in front of noisy, fast moving textures.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2022 08:24:22 GMT'}]",2022-03-09,"[['Peng', 'Xin', ''], ['Wang', 'Yifu', ''], ['Gao', 'Ling', ''], ['Kneip', 'Laurent', '']]","['Event Cameras', 'Motion Estimation', 'Contrast Maximisation', 'Global Optimality', 'Branch and Bound']"
9702,1905.12630,Oscar J. Romero,Oscar J. Romero,"Cognitively-inspired Agent-based Service Composition for Mobile &
  Pervasive Computing","This paper will appear on AIMS'19 (International Conference on
  Artificial Intelligence and Mobile Services) on June 25",Artificial Intelligence and Mobile Services AIMS 2019,10.1007/978-3-030-23367-9_8,,cs.SE cs.AI cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic service composition in mobile and pervasive computing faces many
challenges due to the complex and highly dynamic nature of the environment.
Common approaches consider service composition as a decision problem whose
solution is usually addressed from optimization perspectives which are not
feasible in practice due to the intractability of the problem, limited
computational resources of smart devices, service host's mobility, and time
constraints to tailor composition plans. Thus, our main contribution is the
development of a cognitively-inspired agent-based service composition model
focused on bounded rationality rather than optimality, which allows the system
to compensate for limited resources by selectively filtering out continuous
streams of data. Our approach exhibits features such as distributedness,
modularity, emergent global functionality, and robustness, which endow it with
capabilities to perform decentralized service composition by orchestrating
manifold service providers and conflicting goals from multiple users. The
evaluation of our approach shows promising results when compared against
state-of-the-art service composition models.
","[{'version': 'v1', 'created': 'Wed, 29 May 2019 20:19:15 GMT'}]",2019-08-07,"[['Romero', 'Oscar J.', '']]","['Service composition', 'Pervasive Middleware', 'Cognition']"
9703,2206.12401,Zihan Wang,"Zihan Wang, Na Huang, Fei Sun, Pengjie Ren, Zhumin Chen, Hengliang
  Luo, Maarten de Rijke, Zhaochun Ren","Debiasing Learning for Membership Inference Attacks Against Recommender
  Systems",Accepted by KDD 2022,,10.1145/3534678.3539392,,cs.IR cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learned recommender systems may inadvertently leak information about their
training data, leading to privacy violations. We investigate privacy threats
faced by recommender systems through the lens of membership inference. In such
attacks, an adversary aims to infer whether a user's data is used to train the
target recommender. To achieve this, previous work has used a shadow
recommender to derive training data for the attack model, and then predicts the
membership by calculating difference vectors between users' historical
interactions and recommended items. State-of-the-art methods face two
challenging problems: (1) training data for the attack model is biased due to
the gap between shadow and target recommenders, and (2) hidden states in
recommenders are not observational, resulting in inaccurate estimations of
difference vectors. To address the above limitations, we propose a Debiasing
Learning for Membership Inference Attacks against recommender systems (DL-MIA)
framework that has four main components: (1) a difference vector generator, (2)
a disentangled encoder, (3) a weight estimator, and (4) an attack model. To
mitigate the gap between recommenders, a variational auto-encoder (VAE) based
disentangled encoder is devised to identify recommender invariant and specific
features. To reduce the estimation bias, we design a weight estimator,
assigning a truth-level score for each difference vector to indicate estimation
accuracy. We evaluate DL-MIA against both general recommenders and sequential
recommenders on three real-world datasets. Experimental results show that
DL-MIA effectively alleviates training and estimation biases simultaneously,
and achieves state-of-the-art attack performance.
","[{'version': 'v1', 'created': 'Fri, 24 Jun 2022 17:57:34 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Jun 2022 15:46:57 GMT'}]",2022-06-29,"[['Wang', 'Zihan', ''], ['Huang', 'Na', ''], ['Sun', 'Fei', ''], ['Ren', 'Pengjie', ''], ['Chen', 'Zhumin', ''], ['Luo', 'Hengliang', ''], ['de Rijke', 'Maarten', ''], ['Ren', 'Zhaochun', '']]","['Recommender system', 'Membership inference attack', 'Debiasing']"
9704,2101.01528,Christoph Matthies,"Christoph Matthies, Franziska Dobrigkeit","Experience vs Data: A Case for More Data-informed Retrospective
  Activities","5th International Conference on Lean and Agile Software Development
  (LASD 2021). 23 January 2021","Lecture Notes in Business Information Processing. Springer
  International Publishing. pp. 130-144. 2021",10.1007/978-3-030-67084-9_8,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Effective Retrospective meetings are vital for ensuring productive
development processes because they provide the means for Agile software
development teams to discuss and decide on future improvements of their
collaboration. Retrospective agendas often include activities that encourage
sharing ideas and motivate participants to discuss possible improvements. The
outcomes of these activities steer the future directions of team dynamics and
influence team happiness. However, few empirical evaluations of Retrospective
activities are currently available. Additionally, most activities rely on team
members experiences and neglect to take existing project data into account.
With this paper we want to make a case for data-driven decision-making
principles, which have largely been adopted in other business areas. Towards
this goal we review existing retrospective activities and highlight activities
that already use project data as well as activities that could be augmented to
take advantage of additional, more subjective data sources. We conclude that
data-driven decision-making principles, are advantageous, and yet underused, in
modern Agile software development. Making use of project data in retrospective
activities would strengthen this principle and is a viable approach as such
data can support the teams in making decisions on process improvement.
","[{'version': 'v1', 'created': 'Tue, 5 Jan 2021 14:21:19 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Jan 2021 14:46:44 GMT'}]",2021-01-18,"[['Matthies', 'Christoph', ''], ['Dobrigkeit', 'Franziska', '']]","['Retrospective', 'Scrum', 'Agile Methods', 'Data-driven DecisionMaking', 'Data-informed Processes']"
9705,2108.02089,Teddy Cunningham,"Teddy Cunningham, Graham Cormode, Hakan Ferhatosmanoglu",Privacy-Preserving Synthetic Location Data in the Real World,,"17th International Symposium on Spatial and Temporal Databases
  (SSTD '21), 2021",10.1145/3469830.3470893,,cs.DB cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Sharing sensitive data is vital in enabling many modern data analysis and
machine learning tasks. However, current methods for data release are
insufficiently accurate or granular to provide meaningful utility, and they
carry a high risk of deanonymization or membership inference attacks. In this
paper, we propose a differentially private synthetic data generation solution
with a focus on the compelling domain of location data. We present two methods
with high practical utility for generating synthetic location data from real
locations, both of which protect the existence and true location of each
individual in the original dataset. Our first, partitioning-based approach
introduces a novel method for privately generating point data using kernel
density estimation, in addition to employing private adaptations of classic
statistical techniques, such as clustering, for private partitioning. Our
second, network-based approach incorporates public geographic information, such
as the road network of a city, to constrain the bounds of synthetic data points
and hence improve the accuracy of the synthetic data. Both methods satisfy the
requirements of differential privacy, while also enabling accurate generation
of synthetic data that aims to preserve the distribution of the real locations.
We conduct experiments using three large-scale location datasets to show that
the proposed solutions generate synthetic location data with high utility and
strong similarity to the real datasets. We highlight some practical
applications for our work by applying our synthetic data to a range of location
analytics queries, and we demonstrate that our synthetic data produces
near-identical answers to the same queries compared to when real data is used.
Our results show that the proposed approaches are practical solutions for
sharing and analyzing sensitive location data privately.
","[{'version': 'v1', 'created': 'Wed, 4 Aug 2021 14:43:50 GMT'}]",2021-08-25,"[['Cunningham', 'Teddy', ''], ['Cormode', 'Graham', ''], ['Ferhatosmanoglu', 'Hakan', '']]","['Differential Privacy', 'Location Data Sharing', 'Synthetic Data']"
9706,1606.00405,"Carlo Maria Zw\""olf","Carlo Maria Zw\""olf, Nicolas Moreau, Marie-Lise Dubernet",New model for datasets citation and extraction reproducibility in VAMDC,48 pages,,10.1016/j.jms.2016.04.009,,cs.DL physics.atom-ph physics.chem-ph,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this paper we present a new paradigm for the identification of datasets
extracted from the Virtual Atomic and Molecular Data Centre (VAMDC) e-science
infrastructure. Such identification includes information on the origin and
version of the datasets, references associated to individual data in the
datasets, as well as timestamps linked to the extraction procedure. This
paradigm is described through the modifications of the language used to
exchange data within the VAMDC and through the services that will implement
those modifications. This new paradigm should enforce traceability of datasets,
favour reproducibility of datasets extraction, and facilitate the systematic
citation of the authors having originally measured and/or calculated the
extracted atomic and molecular data.
","[{'version': 'v1', 'created': 'Mon, 9 May 2016 19:14:35 GMT'}]",2016-06-02,"[['Zwölf', 'Carlo Maria', ''], ['Moreau', 'Nicolas', ''], ['Dubernet', 'Marie-Lise', '']]","['database', 'data citation', 'atomic data', 'molecular data']"
9707,1508.03040,Ramón Casares,Ram\'on Casares,Syntax Evolution: Problems and Recursion,37 pages,,10.6084/m9.figshare.4956359,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  To investigate the evolution of syntax, we need to ascertain the evolutionary
r\^ole of syntax and, before that, the very nature of syntax. Here, we will
assume that syntax is computing. And then, since we are computationally Turing
complete, we meet an evolutionary anomaly, the anomaly of sytax: we are
syntactically too competent for syntax. Assuming that problem solving is
computing, and realizing that the evolutionary advantage of Turing completeness
is full problem solving and not syntactic proficiency, we explain the anomaly
of syntax by postulating that syntax and problem solving co-evolved in humans
towards Turing completeness. Examining the requirements that full problem
solving impose on language, we find firstly that semantics is not sufficient
and that syntax is necessary to represent problems. Our final conclusion is
that full problem solving requires a functional semantics on an infinite
tree-structured syntax. Besides these results, the introduction of Turing
completeness and problem solving to explain the evolution of syntax should help
us to fit the evolution of language within the evolution of cognition, giving
us some new clues to understand the elusive relation between language and
thinking.
","[{'version': 'v1', 'created': 'Wed, 12 Aug 2015 09:04:01 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Jan 2016 16:55:24 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Feb 2016 09:51:09 GMT'}, {'version': 'v4', 'created': 'Mon, 23 May 2016 11:25:40 GMT'}, {'version': 'v5', 'created': 'Tue, 14 Jun 2016 09:15:15 GMT'}, {'version': 'v6', 'created': 'Thu, 1 Sep 2016 08:41:41 GMT'}, {'version': 'v7', 'created': 'Tue, 2 Jul 2019 07:49:40 GMT'}]",2019-07-03,"[['Casares', 'Ramón', '']]","['syntax evolution', 'problem solving', 'Turing completeness', 'recursion', 'language and thinking']"
9708,2208.02080,Alex Falcon,Alex Falcon and Giuseppe Serra and Oswald Lanz,"A Feature-space Multimodal Data Augmentation Technique for Text-video
  Retrieval","Accepted for presentation at 30th ACM International Conference on
  Multimedia (ACM MM)",,10.1145/3503161.3548365,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Every hour, huge amounts of visual contents are posted on social media and
user-generated content platforms. To find relevant videos by means of a natural
language query, text-video retrieval methods have received increased attention
over the past few years. Data augmentation techniques were introduced to
increase the performance on unseen test examples by creating new training
samples with the application of semantics-preserving techniques, such as color
space or geometric transformations on images. Yet, these techniques are usually
applied on raw data, leading to more resource-demanding solutions and also
requiring the shareability of the raw data, which may not always be true, e.g.
copyright issues with clips from movies or TV series. To address this
shortcoming, we propose a multimodal data augmentation technique which works in
the feature space and creates new videos and captions by mixing semantically
similar samples. We experiment our solution on a large scale public dataset,
EPIC-Kitchens-100, and achieve considerable improvements over a baseline
method, improved state-of-the-art performance, while at the same time
performing multiple ablation studies. We release code and pretrained models on
Github at https://github.com/aranciokov/FSMMDA_VideoRetrieval.
","[{'version': 'v1', 'created': 'Wed, 3 Aug 2022 14:05:20 GMT'}]",2022-08-04,"[['Falcon', 'Alex', ''], ['Serra', 'Giuseppe', ''], ['Lanz', 'Oswald', '']]","['vision and language', 'cross-modal video retrieval', 'data augmentation']"
9709,2110.14185,Muneeb Ahmad,"Muneeb Ahmad, Soo Young Shin","Massive MIMO NOMA with Wavelet Pulse Shaping to Minimize Undesired
  Channel Interference","8 pages, 3 figures, ICT Express (Accepted 9 June 2022)",,10.1016/j.icte.2022.06.005,,cs.IT cs.SY eess.SY math.IT,http://creativecommons.org/licenses/by/4.0/,"  In this article, wavelet OFDM based non-orthogonal-multiple-access (NOMA)
combined with massive MIMO system for 6G networks is proposed. For mMIMO
transmissions, the proposed system could enhance the performance by utilizing
wavelets to compensate for channel impairments on the transmitted signal.
Performance measures include spectral efficiency, symbol error rate (SER), and
peak to average ratio (PAPR). Simulation results prove that the proposed system
outperforms the conventional OFDM based NOMA systems.
","[{'version': 'v1', 'created': 'Wed, 27 Oct 2021 05:34:29 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jun 2022 01:56:23 GMT'}]",2022-06-30,"[['Ahmad', 'Muneeb', ''], ['Shin', 'Soo Young', '']]","['NOMA', '6G', 'mMIMO', 'Imperfect SIC', 'Wavelet filter banks', 'FFT-OFDM', 'Future WirelessCommunication']"
9710,2207.14740,Fanqi Meng,"Fanqi Meng, Xixi Xiao, Jingdong Wang","Rating the Crisis of Online Public Opinion Using a Multi-Level Index
  System",,,10.34028/iajit/19/4/4,,cs.SI cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online public opinion usually spreads rapidly and widely, thus a small
incident probably evolves into a large social crisis in a very short time, and
results in a heavy loss in credit or economic aspects. We propose a method to
rate the crisis of online public opinion based on a multi-level index system to
evaluate the impact of events objectively. Firstly, the dissemination mechanism
of online public opinion is explained from the perspective of information
ecology. According to the mechanism, some evaluation indexes are selected
through correlation analysis and principal component analysis. Then, a
classification model of text emotion is created via the training by deep
learning to achieve the accurate quantification of the emotional indexes in the
index system. Finally, based on the multi-level evaluation index system and
grey correlation analysis, we propose a method to rate the crisis of online
public opinion. The experiment with the real-time incident show that this
method can objectively evaluate the emotional tendency of Internet users and
rate the crisis in different dissemination stages of online public opinion. It
is helpful to realizing the crisis warning of online public opinion and timely
blocking the further spread of the crisis.
","[{'version': 'v1', 'created': 'Fri, 29 Jul 2022 15:25:36 GMT'}]",2022-08-01,"[['Meng', 'Fanqi', ''], ['Xiao', 'Xixi', ''], ['Wang', 'Jingdong', '']]","['Online public opinions', 'index system', 'emotional classification', 'crisis level']"
9711,2008.08708,Zhengyang Liu,"Zixian Cai, Zhengyang Liu, Saeed Maleki, Madan Musuvathi, Todd
  Mytkowicz, Jacob Nelson, Olli Saarikivi",Synthesizing Optimal Collective Algorithms,"Both Zixian Cai and Zhengyang Liu contributed equally to the paper.
  The work was done during internships at Microsoft Research. To appear at
  PPoPP 2021",,10.1145/3437801.3441620,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Collective communication algorithms are an important component of distributed
computation. Indeed, in the case of deep-learning, collective communication is
the Amdahl's bottleneck of data-parallel training.
  This paper introduces SCCL (for Synthesized Collective Communication
Library), a systematic approach to synthesize collective communication
algorithms that are explicitly tailored to a particular hardware topology. SCCL
synthesizes algorithms along the Pareto-frontier spanning from latency-optimal
to bandwidth-optimal implementations of a collective. The paper demonstrates
how to encode SCCL's synthesis as a quantifier-free SMT formula which can be
discharged to a theorem prover. We further demonstrate how to scale our
synthesis by exploiting symmetries in topologies and collectives.
  We synthesize and introduce novel latency and bandwidth optimal algorithms
not seen in the literature on two popular hardware topologies. We also show how
SCCL efficiently lowers algorithms to implementations on two hardware
architectures (NVIDIA and AMD) and demonstrate competitive performance with
hand optimized collective communication libraries.
","[{'version': 'v1', 'created': 'Wed, 19 Aug 2020 23:51:23 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Jan 2021 19:04:03 GMT'}]",2021-04-22,"[['Cai', 'Zixian', ''], ['Liu', 'Zhengyang', ''], ['Maleki', 'Saeed', ''], ['Musuvathi', 'Madan', ''], ['Mytkowicz', 'Todd', ''], ['Nelson', 'Jacob', ''], ['Saarikivi', 'Olli', '']]","['GPU', 'Synthesis', 'Collective Communication', 'Interconnection', 'Network']"
9712,1802.03221,Yanlong Wang,"Yanlong Wang, Xu Liang, Baoan Li, Xuemin Yu","Research and Implementation of Global Path Planning for Unmanned Surface
  Vehicle Based on Electronic Chart","7 pages, 3 figures, conference","Recent Developments in Mechatronics and Intelligent Robotics.
  ICMIR 2017. Advances in Intelligent Systems and Computing, vol 690. Springer,
  Cham",10.1007/978-3-319-65978-7_80,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Unmanned Surface Vehicle (USV) is a new type of intelligent surface craft,
and global path planning is the key technology of USV research, which can
reflect the intelligent level of USV. In order to solve the problem of global
path planning of USV, this paper proposes an improved A* algorithm for sailing
cost optimization based on electronic charts. This paper uses the S-57
electronic chart to realize the establishment of the octree grid environment
model, and proposes an improved A* algorithm based on sailing safety weight,
pilot quantity and path curve smoothing to ensure the safety of the route,
reduce the planning time, and improve path smoothness. The simulation results
show that the environmental model construction method and the improved A*
algorithm can generate safe and reasonable global path.
","[{'version': 'v1', 'created': 'Fri, 9 Feb 2018 12:13:24 GMT'}]",2018-02-12,"[['Wang', 'Yanlong', ''], ['Liang', 'Xu', ''], ['Li', 'Baoan', ''], ['Yu', 'Xuemin', '']]","['USV', 'Improved A* Algorithm', 'Electronic Chart', 'Global Path Planning']"
9713,2010.00523,Ian McQuillan,Oscar H. Ibarra and Ian McQuillan,On Store Languages and Applications,,"Information and Computation, 267, 28-48, 2019",10.1016/j.ic.2019.03.003,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The store language of a machine of some arbitrary type is the set of all
store configurations (state plus store contents but not the input) that can
appear in an accepting computation. New algorithms and characterizations of
store languages are obtained, such as the result that any nondeterministic
pushdown automaton augmented with reversal-bounded counters, where the pushdown
can ""flip"" its contents up to a bounded number of times, can be accepted by a
machine with only reversal-bounded counters. Then, connections are made between
store languages and several model checking and reachability problems, such as
accepting the set of all predecessor and successor configurations from a given
set of configurations, and determining whether there are at least one, or
infinitely many, common configurations between accepting computations of two
machines. These are explored for a variety of different machine models often
containing multiple parallel data stores. Many of the machine models studied
can accept the set of predecessor configurations (of a regular set of
configurations), the set of successor configurations, and the set of common
configurations between two machines, with a machine model that is simpler than
itself, with a decidable emptiness, infiniteness, and disjointness property.
Store languages are key to showing these properties.
","[{'version': 'v1', 'created': 'Thu, 1 Oct 2020 16:13:01 GMT'}]",2020-10-02,"[['Ibarra', 'Oscar H.', ''], ['McQuillan', 'Ian', '']]","['Automata', 'Store Languages', 'Counter Machines', 'Deletion Operations', 'Reversal-Bounds', 'Determinism', 'Finite Automata']"
9714,2212.04747,Matthias Wessling,"Daniel Felder, Katerina Muche, John Linkhorst, Matthias Wessling",Reminding Forgetful Organic Neuromorphic Device Networks,,Neuromorph. Comput. Eng. 2 044014 (2022),10.1088/2634-4386/ac9c8a,,cs.ET cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Organic neuromorphic device networks can accelerate neural network algorithms
and directly integrate with microfluidic systems or living tissues. Proposed
devices based on the bio-compatible conductive polymer PEDOT:PSS have shown
high switching speeds and low energy demand. However, as electrochemical
systems, they are prone to self-discharge through parasitic electrochemical
reactions. Therefore, the network's synapses forget their trained conductance
states over time. This work integrates single-device high-resolution charge
transport models to simulate neuromorphic device networks and analyze the
impact of self-discharge on network performance. Simulation of a single-layer
nine-pixel image classification network reveals no significant impact of
self-discharge on training efficiency. And, even though the network's weights
drift significantly during self-discharge, its predictions remain 100\%
accurate for over ten hours. On the other hand, a multi-layer network for the
approximation of the circle function is shown to degrade significantly over
twenty minutes with a final mean-squared-error loss of 0.4. We propose to
counter the effect by periodically reminding the network based on a map between
a synapse's current state, the time since the last reminder, and the weight
drift. We show that this method with a map obtained through validated
simulations can reduce the effective loss to below 0.1 even with worst-case
assumptions. Finally, while the training of this network is affected by
self-discharge, a good classification is still obtained. Electrochemical
organic neuromorphic devices have not been integrated into larger device
networks. This work predicts their behavior under nonideal conditions,
mitigates the worst-case effects of parasitic self-discharge, and opens the
path toward implementing fast and efficient neural networks on organic
neuromorphic hardware.
","[{'version': 'v1', 'created': 'Fri, 9 Dec 2022 09:50:41 GMT'}]",2022-12-12,"[['Felder', 'Daniel', ''], ['Muche', 'Katerina', ''], ['Linkhorst', 'John', ''], ['Wessling', 'Matthias', '']]","['neuromorphic computing', 'artificial synapse', 'organic electronics', 'neuralnetwork', 'algorithm-hardware co-design']"
9715,2208.01696,Andres Ferraro,"Andres Ferraro, Gustavo Ferreira, Fernando Diaz, Georgina Born","Measuring Commonality in Recommendation of Cultural Content: Recommender
  Systems to Enhance Cultural Citizenship",The 16th ACM Conference on Recommender Systems,,10.1145/3523227.3551476,,cs.CY cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Recommender systems have become the dominant means of curating cultural
content, significantly influencing the nature of individual cultural
experience. While the majority of research on recommender systems optimizes for
personalized user experience, this paradigm does not capture the ways that
recommender systems impact cultural experience in the aggregate, across
populations of users. Although existing novelty, diversity, and fairness
studies probe how systems relate to the broader social role of cultural
content, they do not adequately center culture as a core concept and challenge.
In this work, we introduce commonality as a new measure that reflects the
degree to which recommendations familiarize a given user population with
specified categories of cultural content. Our proposed commonality metric
responds to a set of arguments developed through an interdisciplinary dialogue
between researchers in computer science and the social sciences and humanities.
With reference to principles underpinning non-profit, public service media
systems in democratic societies, we identify universality of address and
content diversity in the service of strengthening cultural citizenship as
particularly relevant goals for recommender systems delivering cultural
content. Taking diversity in movie recommendation as a case study in enhancing
pluralistic cultural experience, we empirically compare systems' performance
using commonality and existing utility, diversity, and fairness metrics. Our
results demonstrate that commonality captures a property of system behavior
complementary to existing metrics and suggest the need for alternative,
non-personalized interventions in recommender systems oriented to strengthening
cultural citizenship across populations of users. In this way, commonality
contributes to a growing body of scholarship developing 'public good'
rationales for digital media and ML systems.
","[{'version': 'v1', 'created': 'Tue, 2 Aug 2022 19:14:49 GMT'}]",2022-08-04,"[['Ferraro', 'Andres', ''], ['Ferreira', 'Gustavo', ''], ['Diaz', 'Fernando', ''], ['Born', 'Georgina', '']]","['recommender systems', 'evaluation', 'cultural content', 'movies', 'publicservice media']"
9716,2203.15834,Irene-Angelica Chounta,Irene-Angelia Chounta,Collaborative Learning and Patterns of Practice,"34 pages, entry for the Encyclopedia of Education and Information
  Technologies, Springer",,10.1007/978-3-030-10576-1_83,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  In this article, an overview of the background, the research approaches and
the patterns of practice in the field of collaborative learning are provided. A
definition of collaborative learning and an overview of fundamental aspects
that shape research and practice in this field are included. Pedagogies and
learning theories that are used as foundations of the field alongside goals and
objectives of collaborative learning approaches are discussed. Popular patterns
of practice, exploring their application in classrooms and elaborating on the
state of the art around those practices in research are outlined. A discussion
about important topics, open questions and future directions are provided in
conclusion.
","[{'version': 'v1', 'created': 'Thu, 10 Mar 2022 13:58:34 GMT'}]",2022-03-31,"[['Chounta', 'Irene-Angelia', '']]","['Group learning', 'team learning', 'collaborative knowledge building', 'social constructivism']"
9717,cs/0404017,Matthew Berryman,"Matthew J. Berryman, Wei-Li Khoo, Hiep Nguyen, Erin O'Neill, Andrew
  Allison and Derek Abbott","Exploring tradeoffs in pleiotropy and redundancy using evolutionary
  computing","10 pages, 6 figures","Proc. SPIE 5275, BioMEMS and Nanotechnology, Ed. Dan V. Nicolau,
  Perth, Australia, Dec. 2003, pp49-58",10.1117/12.548001,,cs.NE cs.NI,,"  Evolutionary computation algorithms are increasingly being used to solve
optimization problems as they have many advantages over traditional
optimization algorithms. In this paper we use evolutionary computation to study
the trade-off between pleiotropy and redundancy in a client-server based
network. Pleiotropy is a term used to describe components that perform multiple
tasks, while redundancy refers to multiple components performing one same task.
Pleiotropy reduces cost but lacks robustness, while redundancy increases
network reliability but is more costly, as together, pleiotropy and redundancy
build flexibility and robustness into systems. Therefore it is desirable to
have a network that contains a balance between pleiotropy and redundancy. We
explore how factors such as link failure probability, repair rates, and the
size of the network influence the design choices that we explore using genetic
algorithms.
","[{'version': 'v1', 'created': 'Wed, 7 Apr 2004 06:23:18 GMT'}]",2009-11-10,"[['Berryman', 'Matthew J.', ''], ['Khoo', 'Wei-Li', ''], ['Nguyen', 'Hiep', ''], [""O'Neill"", 'Erin', ''], ['Allison', 'Andrew', ''], ['Abbott', 'Derek', '']]","['pleiotropy', 'redundancy', 'genetic algorithms', 'computer networks']"
9718,2109.05290,Nicola Rizzo,"Nicola Rizzo, Alexandru I. Tomescu, Alberto Policriti",The Labeled Direct Product Optimally Solves String Problems on Graphs,"19 pages, 8 figures",Algorithmica (2022) 1-26,10.1007/s00453-022-00989-x,,cs.DS cs.CC,http://creativecommons.org/licenses/by/4.0/,"  Suffix trees are an important data structure at the core of optimal solutions
to many fundamental string problems, such as exact pattern matching, longest
common substring, matching statistics, and longest repeated substring. Recent
lines of research focused on extending some of these problems to vertex-labeled
graphs, although using ad-hoc approaches which in some cases do not generalize
to all input graphs. In the absence of a ubiquitous tool like the suffix tree
for labeled graphs, we introduce the labeled direct product of two graphs as a
general tool for obtaining optimal algorithms: we obtain conceptually simpler
algorithms for the quadratic problems of string matching (SMLG) and longest
common substring (LCSP) in labeled graphs. Our algorithms are also more
efficient, since they run in time linear in the size of the labeled product
graph, which may be smaller than quadratic for some inputs, and their run-time
is predictable, because the size of the labeled direct product graph can be
precomputed efficiently. We also solve LCSP on graphs containing cycles, which
was left as an open problem by Shimohira et al. in 2011. To show the power of
the labeled product graph, we also apply it to solve the matching statistics
(MSP) and the longest repeated string (LRSP) problems in labeled graphs.
Moreover, we show that our (worst-case quadratic) algorithms are also optimal,
conditioned on the Orthogonal Vectors Hypothesis. Finally, we complete the
complexity picture around LRSP by studying it on undirected graphs.
","[{'version': 'v1', 'created': 'Sat, 11 Sep 2021 14:28:26 GMT'}]",2022-08-31,"[['Rizzo', 'Nicola', ''], ['Tomescu', 'Alexandru I.', ''], ['Policriti', 'Alberto', '']]","['Longest repeated substring', 'Longest common substring', 'Matching statistics', 'String algorithm', 'Graph algorithm', 'Motif discovery', 'Fine-grained complexity']"
9719,2001.00132,Aravind Sankar,"Aravind Sankar, Xinyang Zhang, Adit Krishnan, Jiawei Han","Inf-VAE: A Variational Autoencoder Framework to Integrate Homophily and
  Influence in Diffusion Prediction",International Conference on Web Search and Data Mining (WSDM 2020),,10.1145/3336191.3371811,,cs.SI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent years have witnessed tremendous interest in understanding and
predicting information spread on social media platforms such as Twitter,
Facebook, etc. Existing diffusion prediction methods primarily exploit the
sequential order of influenced users by projecting diffusion cascades onto
their local social neighborhoods. However, this fails to capture global social
structures that do not explicitly manifest in any of the cascades, resulting in
poor performance for inactive users with limited historical activities.
  In this paper, we present a novel variational autoencoder framework (Inf-VAE)
to jointly embed homophily and influence through proximity-preserving social
and position-encoded temporal latent variables. To model social homophily,
Inf-VAE utilizes powerful graph neural network architectures to learn social
variables that selectively exploit the social connections of users. Given a
sequence of seed user activations, Inf-VAE uses a novel expressive co-attentive
fusion network that jointly attends over their social and temporal variables to
predict the set of all influenced users. Our experimental results on multiple
real-world social network datasets, including Digg, Weibo, and Stack-Exchanges
demonstrate significant gains (22% MAP@10) for Inf-VAE over state-of-the-art
diffusion prediction models; we achieve massive gains for users with sparse
activities, and users who lack direct social neighbors in seed sets.
","[{'version': 'v1', 'created': 'Wed, 1 Jan 2020 03:35:10 GMT'}]",2020-06-09,"[['Sankar', 'Aravind', ''], ['Zhang', 'Xinyang', ''], ['Krishnan', 'Adit', ''], ['Han', 'Jiawei', '']]","['Social Network', 'Diffusion', 'Deep Learning', 'Autoencoder', 'Attention']"
9720,2112.11277,Attila Klenik,Attila Klenik and Imre Kocsis,"Porting a benchmark with a classic workload to blockchain: TPC-C on
  Hyperledger Fabric",9 pages,,10.1145/3477314.3507006,,cs.PF,http://creativecommons.org/licenses/by/4.0/,"  Many cross-organization cooperation applications of blockchain-based
distributed ledger technologies (DLT) do not aim at innovation at the
cooperation pattern level: essentially the same ''business'' is conducted by
the parties, but this time without a central party to be trusted with
bookkeeping. The migration to DLT is expected to have a negative performance
impact, but some DLTs, such as Hyperledger Fabric, are accepted to be much
better suited performance-wise to such use cases than others. However, with the
somewhat surprising, but ongoing absence of application-level performance
benchmarks for DLTs, cross-DLT comparison for ""classic"" workloads and the
evaluation of the performance impact of ""blockchainification"" is still
ill-supported. We present the design and Hyperledger Caliper-based open
implementation of a full port of the classic TPC-C benchmark to Hyperledger
Fabric, complete with a structured approach for transforming the original
database schema to a smart contract data model. Initial measurements about the
workload characteristics that will affect the design of large-scale performance
evaluations are also included.
","[{'version': 'v1', 'created': 'Tue, 21 Dec 2021 15:04:32 GMT'}]",2021-12-22,"[['Klenik', 'Attila', ''], ['Kocsis', 'Imre', '']]","['blockchain', 'DLT', 'benchmarking', 'TPC-C', 'Hyperledger Fabric']"
9721,2204.12063,Jie Shuai,"Jie Shuai, Kun Zhang, Le Wu, Peijie Sun, Richang Hong, Meng Wang, Yong
  Li",A Review-aware Graph Contrastive Learning Framework for Recommendation,Accepted by SIGIR 2022,,10.1145/3477495.3531927,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most modern recommender systems predict users preferences with two
components: user and item embedding learning, followed by the user-item
interaction modeling. By utilizing the auxiliary review information accompanied
with user ratings, many of the existing review-based recommendation models
enriched user/item embedding learning ability with historical reviews or better
modeled user-item interactions with the help of available user-item target
reviews. Though significant progress has been made, we argue that current
solutions for review-based recommendation suffer from two drawbacks. First, as
review-based recommendation can be naturally formed as a user-item bipartite
graph with edge features from corresponding user-item reviews, how to better
exploit this unique graph structure for recommendation? Second, while most
current models suffer from limited user behaviors, can we exploit the unique
self-supervised signals in the review-aware graph to guide two recommendation
components better? To this end, in this paper, we propose a novel Review-aware
Graph Contrastive Learning (RGCL) framework for review-based recommendation.
Specifically, we first construct a review-aware user-item graph with
feature-enhanced edges from reviews, where each edge feature is composed of
both the user-item rating and the corresponding review semantics. This graph
with feature-enhanced edges can help attentively learn each neighbor node
weight for user and item representation learning. After that, we design two
additional contrastive learning tasks (i.e., Node Discrimination and Edge
Discrimination) to provide self-supervised signals for the two components in
recommendation process. Finally, extensive experiments over five benchmark
datasets demonstrate the superiority of our proposed RGCL compared to the
state-of-the-art baselines.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2022 03:58:27 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Apr 2022 15:35:50 GMT'}, {'version': 'v3', 'created': 'Wed, 4 May 2022 07:00:24 GMT'}, {'version': 'v4', 'created': 'Mon, 16 May 2022 13:47:29 GMT'}]",2022-05-17,"[['Shuai', 'Jie', ''], ['Zhang', 'Kun', ''], ['Wu', 'Le', ''], ['Sun', 'Peijie', ''], ['Hong', 'Richang', ''], ['Wang', 'Meng', ''], ['Li', 'Yong', '']]","['Recommender Systems', 'Review-based Recommendation', 'GraphContrastive Learning']"
9722,2103.01168,Abeba Birhane,"Rediet Abebe, Kehinde Aruleba, Abeba Birhane, Sara Kingsley, George
  Obaido, Sekou L. Remy, Swathi Sadagopan",Narratives and Counternarratives on Data Sharing in Africa,,,10.1145/3442188.3445897,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  As machine learning and data science applications grow ever more prevalent,
there is an increased focus on data sharing and open data initiatives,
particularly in the context of the African continent. Many argue that data
sharing can support research and policy design to alleviate poverty,
inequality, and derivative effects in Africa. Despite the fact that the
datasets in question are often extracted from African communities,
conversations around the challenges of accessing and sharing African data are
too often driven by nonAfrican stakeholders. These perspectives frequently
employ a deficit narratives, often focusing on lack of education, training, and
technological resources in the continent as the leading causes of friction in
the data ecosystem. We argue that these narratives obfuscate and distort the
full complexity of the African data sharing landscape. In particular, we use
storytelling via fictional personas built from a series of interviews with
African data experts to complicate dominant narratives and to provide
counternarratives. Coupling these personas with research on data practices
within the continent, we identify recurring barriers to data sharing as well as
inequities in the distribution of data sharing benefits. In particular, we
discuss issues arising from power imbalances resulting from the legacies of
colonialism, ethno-centrism, and slavery, disinvestment in building trust, lack
of acknowledgement of historical and present-day extractive practices, and
Western-centric policies that are ill-suited to the African context. After
outlining these problems, we discuss avenues for addressing them when sharing
data generated in the continent.
","[{'version': 'v1', 'created': 'Mon, 1 Mar 2021 18:07:35 GMT'}]",2021-03-02,"[['Abebe', 'Rediet', ''], ['Aruleba', 'Kehinde', ''], ['Birhane', 'Abeba', ''], ['Kingsley', 'Sara', ''], ['Obaido', 'George', ''], ['Remy', 'Sekou L.', ''], ['Sadagopan', 'Swathi', '']]","['Data sharing', 'data access', 'open data', 'storytelling', 'decolonial theory']"
9723,1601.06704,Nikita Polyanskii,"A. G. D'yachkov, I.V. Vorobyev, N.A. Polyanskii and V.Yu. Shchukin",On a Hypergraph Approach to Multistage Group Testing Problems,"5 pages, IEEE conference",,10.1109/ISIT.2016.7541486,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Group testing is a well known search problem that consists in detecting up to
$s$ defective elements of the set $[t]=\{1,\ldots,t\}$ by carrying out tests on
properly chosen subsets of $[t]$. In classical group testing the goal is to
find all defective elements by using the minimal possible number of tests. In
this paper we consider multistage group testing. We propose a general idea how
to use a hypergraph approach to searching defects. For the case $s=2$, we
design an explicit construction, which makes use of $2\log_2t(1+o(1))$ tests in
the worst case and consists of $4$ stages. For the general case $s>2$, we
provide an explicit construction, which uses $(2s-1)\log_2t(1+o(1))$ tests and
consists of $2s-1$ rounds.
","[{'version': 'v1', 'created': 'Mon, 25 Jan 2016 18:20:45 GMT'}]",2016-11-18,"[[""D'yachkov"", 'A. G.', ''], ['Vorobyev', 'I. V.', ''], ['Polyanskii', 'N. A.', ''], ['Shchukin', 'V. Yu.', '']]","['Group testing problem', 'multistagealgorithms', 'hypergraph', 'construction']"
9724,2002.00027,Marcos Eduardo Valle,Marcos Eduardo Valle and Rodolfo Anibal Lobo,Hypercomplex-Valued Recurrent Correlation Neural Networks,,,10.1016/j.neucom.2020.12.034,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recurrent correlation neural networks (RCNNs), introduced by Chiueh and
Goodman as an improved version of the bipolar correlation-based Hopfield neural
network, can be used to implement high-capacity associative memories. In this
paper, we extend the bipolar RCNNs for processing hypercomplex-valued data.
Precisely, we present the mathematical background for a broad class of
hypercomplex-valued RCNNs. Then, we provide the necessary conditions which
ensure that a hypercomplex-valued RCNN always settles at an equilibrium using
either synchronous or asynchronous update modes. Examples with bipolar,
complex, hyperbolic, quaternion, and octonion-valued RCNNs are given to
illustrate the theoretical results. Finally, computational experiments confirm
the potential application of hypercomplex-valued RCNNs as associative memories
designed for the storage and recall of gray-scale images.
","[{'version': 'v1', 'created': 'Fri, 31 Jan 2020 19:14:19 GMT'}]",2021-01-06,"[['Valle', 'Marcos Eduardo', ''], ['Lobo', 'Rodolfo Anibal', '']]","['Recurrent neural network', 'hypercomplex number system', 'Hopfieldneural network', 'associative memory']"
9725,1906.04033,Andreas Hessenthaler,"Andreas Hessenthaler, Maximilian Balmus, Oliver R\""ohrle, David
  Nordsletten","A Class of Analytic Solutions for Verification and Convergence Analysis
  of Linear and Nonlinear Fluid-Structure Interaction Algorithms",30 pages; 6 pages Supplementary Materials,,10.1016/j.cma.2020.112841,,cs.NA cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fluid-structure interaction (FSI) problems are pervasive in the computational
engineering community. The need to address challenging FSI problems has led to
the development of a broad range of numerical methods addressing a variety of
application-specific demands. While a range of numerical and experimental
benchmarks are present in the literature, few solutions are available that
enable both verification and spatiotemporal convergence analysis. In this
paper, we introduce a class of analytic solutions to FSI problems involving
shear in channels and pipes. Comprised of 16 separate analytic solutions, our
approach is permuted to enable progressive verification and analysis of FSI
methods and implementations, in two and three dimensions, for static and
transient scenarios as well as for linear and hyperelastic solid materials.
Results are shown for a range of analytic models exhibiting progressively
complex behavior. The utility of these solutions for analysis of convergence
behavior is further demonstrated using a previously published monolithic FSI
technique. The resulting class of analytic solutions addresses a core challenge
in the development of novel FSI algorithms and implementations, providing a
progressive testbed for verification and detailed convergence analysis.
","[{'version': 'v1', 'created': 'Fri, 7 Jun 2019 09:52:39 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Jan 2020 13:39:44 GMT'}]",2020-02-19,"[['Hessenthaler', 'Andreas', ''], ['Balmus', 'Maximilian', ''], ['Röhrle', 'Oliver', ''], ['Nordsletten', 'David', '']]","['Fluid-Structure Interaction', 'Analytic Solutions', 'Convergence Analysis', 'Navier-StokesEquations', 'Linear Elasticity', 'Hyperelasticity']"
9726,2101.08070,Yulia Goldenberg,Yulia Goldenberg and Noam Tractinsky,Towards the Right Direction in BiDirectional User Interfaces,Accepted to CHI 2021,,10.1145/3411764.3445461,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hundreds of millions of speakers of bidirectional (BiDi) languages rely on
writing systems that mix the native right-to-left script with left-to-right
strings. The global reach of interactive digital technologies requires special
attention to these people, whose perception of interfaces is affected by this
script mixture. However, empirical research on this topic is scarce. Although
leading software vendors provide guidelines for BiDi design, bidirectional
interfaces demonstrate inconsistent and incorrect directionality of UI
elements, which may cause user confusion and errors. Through a websites'
review, we identified problematic UI items and considered reasons for their
existence. In an online survey with 234 BiDi speakers, we observed that in many
cases, users' direction preferences were inconsistent with the guidelines. The
findings provide potential insights for design rules and empirical evidence for
the problem's complexity, suggesting the need for further empirical research
and greater attention by the HCI community to the BiDi design problem.
","[{'version': 'v1', 'created': 'Wed, 20 Jan 2021 11:10:35 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Jan 2021 22:13:08 GMT'}]",2021-01-27,"[['Goldenberg', 'Yulia', ''], ['Tractinsky', 'Noam', '']]","['Bidirectional design', 'BiDi', 'Right-to-left design', 'Bidirectional interface', 'Localization', 'UI element direction']"
9727,2102.01739,Jacopo Marconi,"Jacopo Marconi, Paolo Tiso, Davide E. Quadrelli, Francesco Braghin","An enhanced parametric nonlinear reduced order model for imperfect
  structures using Neumann expansion",,"Nonlinear Dyn 104, 3039-3063 (2021)",10.1007/s11071-021-06496-y,,cs.CE cs.NA math.NA,http://creativecommons.org/licenses/by/4.0/,"  We present an enhanced version of the parametric nonlinear reduced order
model for shape imperfections in structural dynamics we studied in a previous
work [1]. The model is computed intrusively and with no training using
information about the nominal geometry of the structure and some user-defined
displacement fields representing shape defects, i.e. small deviations from the
nominal geometry parametrized by their respective amplitudes. The linear
superposition of these artificial displacements describe the defected geometry
and can be embedded in the strain formulation in such a way that, in the end,
nonlinear internal elastic forces can be expressed as a polynomial function of
both these defect fields and the actual displacement field. This way, a
tensorial representation of the internal forces can be obtained and, owning the
reduction in size of the model given by a Galerkin projection, high simulation
speed-ups can be achieved. We show that by adopting a rigorous deformation
framework we are able to achieve better accuracy as compared to the previous
work. In particular, exploiting Neumann expansion in the definition of the
Green-Lagrange strain tensor, we show that our previous model is a lower order
approximation with respect to the one we present now. Two numerical examples of
a clamped beam and a MEMS gyroscope finally demonstrate the benefits of the
method in terms of speed and increased accuracy.
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2021 20:24:02 GMT'}]",2022-01-02,"[['Marconi', 'Jacopo', ''], ['Tiso', 'Paolo', ''], ['Quadrelli', 'Davide E.', ''], ['Braghin', 'Francesco', '']]","['Nonlinear Modeling', 'Reduced Order Models', 'Parametric', 'Geometric Nonlinearities', 'Defects']"
9728,1906.08863,Amir Mosavi,"Shahaboddin Shamshirband, Amir Mosavi, Timon Rabczuk","Particle swarm optimization model to predict scour depth around bridge
  pier","18 pages, 5 figures, journal paper",,10.20944/preprints201905.0121.v1,,cs.NE cs.CE cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Scour depth around bridge piers plays a vital role in the safety and
stability of the bridges. Existing methods to predict scour depth are mainly
based on regression models or black box models in which the first one lacks
enough accuracy while the later one does not provide a clear mathematical
expression to easily employ it for other situations or cases. Therefore, this
paper aims to develop new equations using particle swarm optimization as a
metaheuristic approach to predict scour depth around bridge piers. To improve
the efficiency of the proposed model, individual equations are derived for
laboratory and field data. Moreover, sensitivity analysis is conducted to
achieve the most effective parameters in the estimation of scour depth for both
experimental and filed data sets. Comparing the results of the proposed model
with those of existing regression-based equations reveal the superiority of the
proposed method in terms of accuracy and uncertainty. Moreover, the ratio of
pier width to flow depth and ratio of d50 (mean particle diameter) to flow
depth for the laboratory and field data were recognized as the most effective
parameters, respectively. The derived equations can be used as a suitable proxy
to estimate scour depth in both experimental and prototype scales.
","[{'version': 'v1', 'created': 'Sun, 26 May 2019 06:53:32 GMT'}]",2019-06-24,"[['Shamshirband', 'Shahaboddin', ''], ['Mosavi', 'Amir', ''], ['Rabczuk', 'Timon', '']]","['Scour depth', 'particle swarm optimization (PSO)', 'uncertainty analysis', 'prediction', 'bridge pier', 'big data', 'metaheuristic optimization']"
9729,2101.08432,Stephen MacDonell,"Marco Kuhrmann, Joyce Nakatumba-Nabende, Rolf-Helge Pfeiffer, Paolo
  Tell, Jil Kl\""under, Tayana Conte, Stephen G. MacDonell and Regina Hebig","Walking Through the Method Zoo: Does Higher Education really meet
  Software Industry Demands?","Conference, 11 pages, 7 figures, 3 tables","Proceedings of the International Conference on Software
  Engineering -- Software Engineering Education and Training (ICSE-SEET2019).
  Montr\'eal, Canada, IEEE Computer Society Press, pp.1-11",10.1109/ICSE-SEET.2019.00009,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software engineering educators are continually challenged by rapidly evolving
concepts, technologies, and industry demands. Due to the omnipresence of
software in a digitalized society, higher education institutions (HEIs) have to
educate the students such that they learn how to learn, and that they are
equipped with a profound basic knowledge and with latest knowledge about modern
software and system development. Since industry demands change constantly, HEIs
are challenged in meeting such current and future demands in a timely manner.
This paper analyzes the current state of practice in software engineering
education. Specifically, we want to compare contemporary education with
industrial practice to understand if frameworks, methods and practices for
software and system development taught at HEIs reflect industrial practice. For
this, we conducted an online survey and collected information about 67 software
engineering courses. Our findings show that development approaches taught at
HEIs quite closely reflect industrial practice. We also found that the choice
of what process to teach is sometimes driven by the wish to make a course
successful. Especially when this happens for project courses, it could be
beneficial to put more emphasis on building learning sequences with other
courses.
","[{'version': 'v1', 'created': 'Thu, 21 Jan 2021 04:22:12 GMT'}]",2021-01-22,"[['Kuhrmann', 'Marco', ''], ['Nakatumba-Nabende', 'Joyce', ''], ['Pfeiffer', 'Rolf-Helge', ''], ['Tell', 'Paolo', ''], ['Klünder', 'Jil', ''], ['Conte', 'Tayana', ''], ['MacDonell', 'Stephen G.', ''], ['Hebig', 'Regina', '']]","['Agile teams', 'onboarding', 'software engineering']"
9730,2201.08688,Abdulrahman Alruban,"Abdulrahman Alruban, Hind Alobaidi, Nathan Clarke' Fudong Li",Physical Activity Recognition by Utilising Smartphone Sensor Signals,"10 pages, 10 figures, conference",,10.5220/0007271903420351,,cs.HC cs.CR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Human physical motion activity identification has many potential applications
in various fields, such as medical diagnosis, military sensing, sports
analysis, and human-computer security interaction. With the recent advances in
smartphones and wearable technologies, it has become common for such devices to
have embedded motion sensors that are able to sense even small body movements.
This study collected human activity data from 60 participants across two
different days for a total of six activities recorded by gyroscope and
accelerometer sensors in a modern smartphone. The paper investigates to what
extent different activities can be identified by utilising machine learning
algorithms using approaches such as majority algorithmic voting. More analyses
are also provided that reveal which time and frequency domain based features
were best able to identify individuals motion activity types. Overall, the
proposed approach achieved a classification accuracy of 98 percent in
identifying four different activities: walking, walking upstairs, walking
downstairs, and sitting while the subject is calm and doing a typical
desk-based activity.
","[{'version': 'v1', 'created': 'Thu, 20 Jan 2022 09:58:52 GMT'}]",2022-01-24,"[['Alruban', 'Abdulrahman', ''], ['Alobaidi', 'Hind', ''], ['Li', ""Nathan Clarke' Fudong"", '']]","['Human activity recognition', 'Smartphone sensors', 'Gait activity', 'Gyroscope', 'Accelerometer']"
9731,2103.05443,Emilio Mart\'inez-Pa\~neda,"P.K. Kristensen, C.F. Niordson, E. Mart\'inez-Pa\~neda",An assessment of phase field fracture: crack initiation and growth,,"Philosophical Transactions of the Royal Society A: Mathematical,
  Physical and Engineering Sciences 379, 20210021 (2021)",10.1098/rsta.2021.0021,,cs.CE cs.NA math.NA physics.app-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The phase field paradigm, in combination with a suitable variational
structure, has opened a path for using Griffith's energy balance to predict the
fracture of solids. These so-called phase field fracture methods have gained
significant popularity over the past decade, and are now part of commercial
finite element packages and engineering fitness-for-service assessments. Crack
paths can be predicted, in arbitrary geometries and dimensions, based on a
global energy minimisation - without the need for \textit{ad hoc} criteria. In
this work, we review the fundamentals of phase field fracture methods and
examine their capabilities in delivering predictions in agreement with the
classical fracture mechanics theory pioneered by Griffith. The two most widely
used phase field fracture models are implemented in the context of the finite
element method, and several paradigmatic boundary value problems are addressed
to gain insight into their predictive abilities across all cracking stages;
both the initiation of growth and stable crack propagation are investigated. In
addition, we examine the effectiveness of phase field models with an internal
material length scale in capturing size effects and the transition flaw size
concept. Our results show that phase field fracture methods satisfactorily
approximate classical fracture mechanics predictions and can also reconcile
stress and toughness criteria for fracture. The accuracy of the approximation
is however dependent on modelling and constitutive choices; we provide a
rationale for these differences and identify suitable approaches for delivering
phase field fracture predictions that are in good agreement with
well-established fracture mechanics paradigms.
","[{'version': 'v1', 'created': 'Sat, 6 Mar 2021 07:27:55 GMT'}, {'version': 'v2', 'created': 'Sat, 5 Mar 2022 18:08:28 GMT'}]",2022-03-08,"[['Kristensen', 'P. K.', ''], ['Niordson', 'C. F.', ''], ['Martínez-Pañeda', 'E.', '']]","['Griffith', 'Phase field fracture', 'Fracture mechanics', 'Finite element analysis']"
9732,1702.05763,Maurice Chandoo,Maurice Chandoo,Canonical Representations for Circular-Arc Graphs Using Flip Sets,24 pages,,10.1007/s00453-018-0410-0,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that computing canonical representations for circular-arc (CA) graphs
reduces to computing certain subsets of vertices called flip sets. For a broad
class of CA graphs, which we call uniform, it suffices to compute a CA
representation to find such flip sets. As a consequence canonical
representations for uniform CA graphs can be obtained in polynomial-time. We
then investigate what kind of CA graphs pose a challenge to this approach. This
leads us to introduce the notion of restricted CA matrices and show that the
canonical representation problem for CA graphs is logspace-reducible to that of
restricted CA matrices. As a byproduct, we obtain the result that CA graphs
without induced 4-cycles can be canonized in logspace.
","[{'version': 'v1', 'created': 'Sun, 19 Feb 2017 16:09:28 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Dec 2017 18:55:59 GMT'}]",2018-02-02,"[['Chandoo', 'Maurice', '']]","['canonization', 'circular-arc graphs', 'isomorphism']"
9733,2005.08829,Chen Wang,"Chen Wang, Wenshan Wang, Yuheng Qiu, Yafei Hu, and Sebastian Scherer","Visual Memorability for Robotic Interestingness via Unsupervised Online
  Learning",Oral paper in ECCV 2020,2020 European Conference on Computer Vision (ECCV),10.1007/978-3-030-58536-5_4,,cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we explore the problem of interesting scene prediction for
mobile robots. This area is currently underexplored but is crucial for many
practical applications such as autonomous exploration and decision making.
Inspired by industrial demands, we first propose a novel translation-invariant
visual memory for recalling and identifying interesting scenes, then design a
three-stage architecture of long-term, short-term, and online learning. This
enables our system to learn human-like experience, environmental knowledge, and
online adaption, respectively. Our approach achieves much higher accuracy than
the state-of-the-art algorithms on challenging robotic interestingness
datasets.
","[{'version': 'v1', 'created': 'Mon, 18 May 2020 16:00:27 GMT'}, {'version': 'v2', 'created': 'Tue, 19 May 2020 01:26:24 GMT'}, {'version': 'v3', 'created': 'Sat, 18 Jul 2020 16:43:35 GMT'}]",2020-11-04,"[['Wang', 'Chen', ''], ['Wang', 'Wenshan', ''], ['Qiu', 'Yuheng', ''], ['Hu', 'Yafei', ''], ['Scherer', 'Sebastian', '']]","['Unsupervised', 'Online', 'Memorability', 'Interestingness']"
9734,1909.11601,Yoshimichi Nakatsuka,"Yoshimichi Nakatsuka, Andrew Paverd, Gene Tsudik",PDoT: Private DNS-over-TLS with TEE Support,To appear: ACSAC 2019,,10.1145/3359789.3359793,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security and privacy of the Internet Domain Name System (DNS) have been
longstanding concerns. Recently, there is a trend to protect DNS traffic using
Transport Layer Security (TLS). However, at least two major issues remain: (1)
how do clients authenticate DNS-over-TLS endpoints in a scalable and extensible
manner; and (2) how can clients trust endpoints to behave as expected? In this
paper, we propose a novel Private DNS-over-TLS (PDoT ) architecture. PDoT
includes a DNS Recursive Resolver (RecRes) that operates within a Trusted
Execution Environment (TEE). Using Remote Attestation, DNS clients can
authenticate, and receive strong assurance of trustworthiness of PDoT RecRes.
We provide an open-source proof-of-concept implementation of PDoT and use it to
experimentally demonstrate that its latency and throughput match that of the
popular Unbound DNS-over-TLS resolver.
","[{'version': 'v1', 'created': 'Wed, 25 Sep 2019 16:36:12 GMT'}]",2019-09-26,"[['Nakatsuka', 'Yoshimichi', ''], ['Paverd', 'Andrew', ''], ['Tsudik', 'Gene', '']]","['Domain Name System', 'Privacy', 'Trusted Execution Environment']"
9735,2108.13592,Hongxiang Chen,"Philip J. Feng, Pingjun Pan, Tingting Zhou, Hongxiang Chen, Chuanjiang
  Luo","Zero Shot on the Cold-Start Problem: Model-Agnostic Interest Learning
  for Recommender Systems",,,10.1145/3459637.3482312,,cs.IR cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  User behavior has been validated to be effective in revealing personalized
preferences for commercial recommendations. However, few user-item interactions
can be collected for new users, which results in a null space for their
interests, i.e., the cold-start dilemma. In this paper, a two-tower framework,
namely, the model-agnostic interest learning (MAIL) framework, is proposed to
address the cold-start recommendation (CSR) problem for recommender systems. In
MAIL, one unique tower is constructed to tackle the CSR from a zero-shot view,
and the other tower focuses on the general ranking task. Specifically, the
zero-shot tower first performs cross-modal reconstruction with dual
auto-encoders to obtain virtual behavior data from highly aligned hidden
features for new users; and the ranking tower can then output recommendations
for users based on the completed data by the zero-shot tower. Practically, the
ranking tower in MAIL is model-agnostic and can be implemented with any
embedding-based deep models. Based on the co-training of the two towers, the
MAIL presents an end-to-end method for recommender systems that shows an
incremental performance improvement. The proposed method has been successfully
deployed on the live recommendation system of NetEase Cloud Music to achieve a
click-through rate improvement of 13% to 15% for millions of users. Offline
experiments on real-world datasets also show its superior performance in CSR.
Our code is available.
","[{'version': 'v1', 'created': 'Tue, 31 Aug 2021 02:41:19 GMT'}]",2021-09-06,"[['Feng', 'Philip J.', ''], ['Pan', 'Pingjun', ''], ['Zhou', 'Tingting', ''], ['Chen', 'Hongxiang', ''], ['Luo', 'Chuanjiang', '']]","['Recommender Systems', 'Two-Tower Structure', 'Cross-Modal Reconstruction', 'Commercial Application']"
9736,1601.05991,Milos Cernak,"Milos Cernak, Stefan Benus, Alexandros Lazaridis",Speech vocoding for laboratory phonology,,"Computer Speech & Language, Volume 42, March 2017, Pages 100-121",10.1016/j.csl.2016.10.001,Idiap-RR-07-2016,cs.CL cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using phonological speech vocoding, we propose a platform for exploring
relations between phonology and speech processing, and in broader terms, for
exploring relations between the abstract and physical structures of a speech
signal. Our goal is to make a step towards bridging phonology and speech
processing and to contribute to the program of Laboratory Phonology. We show
three application examples for laboratory phonology: compositional phonological
speech modelling, a comparison of phonological systems and an experimental
phonological parametric text-to-speech (TTS) system. The featural
representations of the following three phonological systems are considered in
this work: (i) Government Phonology (GP), (ii) the Sound Pattern of English
(SPE), and (iii) the extended SPE (eSPE). Comparing GP- and eSPE-based vocoded
speech, we conclude that the latter achieves slightly better results than the
former. However, GP - the most compact phonological speech representation -
performs comparably to the systems with a higher number of phonological
features. The parametric TTS based on phonological speech representation, and
trained from an unlabelled audiobook in an unsupervised manner, achieves
intelligibility of 85% of the state-of-the-art parametric speech synthesis. We
envision that the presented approach paves the way for researchers in both
fields to form meaningful hypotheses that are explicitly testable using the
concepts developed and exemplified in this paper. On the one hand, laboratory
phonologists might test the applied concepts of their theoretical models, and
on the other hand, the speech processing community may utilize the concepts
developed for the theoretical phonological models for improvements of the
current state-of-the-art applications.
","[{'version': 'v1', 'created': 'Fri, 22 Jan 2016 13:22:10 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Apr 2016 12:06:21 GMT'}, {'version': 'v3', 'created': 'Thu, 15 Sep 2016 08:26:38 GMT'}]",2016-11-16,"[['Cernak', 'Milos', ''], ['Benus', 'Stefan', ''], ['Lazaridis', 'Alexandros', '']]","['Phonological speech representation', 'parametric speechsynthesis', 'laboratory phonology']"
9737,1907.03988,Zhenyu Tang,"Zhenyu Tang, Lianwu Chen, Bo Wu, Dong Yu, Dinesh Manocha",Improving Reverberant Speech Training Using Diffuse Acoustic Simulation,"Accepted to ICASSP 2020, impulse response generation code at
  https://github.com/RoyJames/pygsound","2020 IEEE International Conference on Acoustics, Speech and Signal
  Processing (ICASSP) (pp. 6969-6973)",10.1109/ICASSP40776.2020.9052932,,cs.SD cs.LG eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an efficient and realistic geometric acoustic simulation approach
for generating and augmenting training data in speech-related machine learning
tasks. Our physically-based acoustic simulation method is capable of modeling
occlusion, specular and diffuse reflections of sound in complicated acoustic
environments, whereas the classical image method can only model specular
reflections in simple room settings. We show that by using our synthetic
training data, the same neural networks gain significant performance
improvement on real test sets in far-field speech recognition by 1.58% and
keyword spotting by 21%, without fine-tuning using real impulse responses.
","[{'version': 'v1', 'created': 'Tue, 9 Jul 2019 05:26:52 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Oct 2019 21:35:16 GMT'}, {'version': 'v3', 'created': 'Thu, 31 Oct 2019 20:01:36 GMT'}, {'version': 'v4', 'created': 'Mon, 10 Feb 2020 15:59:52 GMT'}, {'version': 'v5', 'created': 'Thu, 2 Apr 2020 18:25:46 GMT'}]",2021-09-28,"[['Tang', 'Zhenyu', ''], ['Chen', 'Lianwu', ''], ['Wu', 'Bo', ''], ['Yu', 'Dong', ''], ['Manocha', 'Dinesh', '']]","['systems', 'Project website https//gamma', 'umd']"
9738,2112.04465,Niki Gitinabard,"Niki Gitinabard, Sarah Heckman, Tiffany Barnes, Collin F. Lynch",Designing a Dashboard for Student Teamwork Analysis,In press: SIGCSE 2022,,10.1145/3478431.3499377,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Classroom dashboards are designed to help instructors effectively orchestrate
classrooms by providing summary statistics, activity tracking, and other
information. Existing dashboards are generally specific to an LMS or platform
and they generally summarize individual work, not group behaviors. However, CS
courses typically involve constellations of tools and mix on- and offline
collaboration. Thus, cross-platform monitoring of individuals and teams is
important to develop a full picture of the class. In this work, we describe our
work on Concert, a data integration platform that collects data about student
activities from several sources such as Piazza, My Digital Hand, and GitHub and
uses it to support classroom monitoring through analysis and visualizations. We
discuss team visualizations that we have developed to support effective group
management and to help instructors identify teams in need of intervention.
","[{'version': 'v1', 'created': 'Mon, 6 Dec 2021 22:20:24 GMT'}]",2021-12-09,"[['Gitinabard', 'Niki', ''], ['Heckman', 'Sarah', ''], ['Barnes', 'Tiffany', ''], ['Lynch', 'Collin F.', '']]","['Teamwork', 'Educational Dashboards', 'Blended Courses', 'MultipleTool Integration']"
9739,2010.15692,Joao Caldeira,"Jo\~ao Caldeira, Fernando Brito e Abreu, Jorge Cardoso, Jos\'e Reis",Unveiling process insights from refactoring practices,,,10.1016/j.csi.2021.103587,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context : Software comprehension and maintenance activities, such as
refactoring, are said to be negatively impacted by software complexity. The
methods used to measure software product and processes complexity have been
thoroughly debated in the literature. However, the discernment about the
possible links between these two dimensions, particularly on the benefits of
using the process perspective, has a long journey ahead. Objective: To improve
the understanding of the liaison of developers' activities and software
complexity within a refactoring task, namely by evaluating if process metrics
gathered from the IDE, using process mining methods and tools, are suitable to
accurately classify different refactoring practices and the resulting software
complexity. Method: We mined source code metrics from a software product after
a quality improvement task was given in parallel to (117) software developers,
organized in (71) teams. Simultaneously, we collected events from their IDE
work sessions (320) and used process mining to model their processes and
extract the correspondent metrics. Results: Most teams using a plugin for
refactoring (JDeodorant) reduced software complexity more effectively and with
simpler processes than the ones that performed refactoring using only Eclipse
native features. We were able to find moderate correlations (43%) between
software cyclomatic complexity and process cyclomatic complexity. The best
models found for the refactoring method and cyclomatic complexity level
predictions, had an accuracy of 92.95% and 94.36%, respectively. Conclusions:
Our approach agnostic to programming languages, geographic location, or
development practices. Initial findings are encouraging, and lead us to suggest
practitioners may use our method in other development tasks, such as, defect
analysis and unit or integration tests.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2020 15:32:48 GMT'}]",2021-12-24,"[['Caldeira', 'João', ''], ['Abreu', 'Fernando Brito e', ''], ['Cardoso', 'Jorge', ''], ['Reis', 'José', '']]","['Software Complexity', 'Software Process Complexity', 'SoftwareDevelopment Process Mining', 'Refactoring Practices']"
9740,1904.05383,Jim Basney,"Andrew Adams (Pittsburgh Supercomputing Center), Kay Avila (NCSA), Jim
  Basney (NCSA), Dana Brunson (Internet2), Robert Cowles (BrightLite
  Information Security), Jeannette Dopheide (NCSA), Terry Fleury (NCSA), Elisa
  Heymann (University of Wisconsin-Madison), Florence Hudson (Independent
  Consultant), Craig Jackson (Indiana University), Ryan Kiser (Indiana
  University), Mark Krenz (Indiana University), Jim Marsteller (Pittsburgh
  Supercomputing Center), Barton P. Miller (University of Wisconsin-Madison),
  Sean Peisert (Berkeley Lab), Scott Russell (Indiana University), Susan Sons
  (Indiana University), Von Welch (Indiana University), John Zage (NCSA)",Trusted CI Experiences in Cybersecurity and Service to Open Science,"8 pages, PEARC '19: Practice and Experience in Advanced Research
  Computing, July 28-August 1, 2019, Chicago, IL, USA",,10.1145/3332186.3340601,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article describes experiences and lessons learned from the Trusted CI
project, funded by the US National Science Foundation to serve the community as
the NSF Cybersecurity Center of Excellence. Trusted CI is an effort to address
cybersecurity for the open science community through a single organization that
provides leadership, training, consulting, and knowledge to that community. The
article describes the experiences and lessons learned of Trusted CI regarding
both cybersecurity for open science and managing the process of providing
centralized services to a broad and diverse community.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2019 18:38:27 GMT'}, {'version': 'v2', 'created': 'Wed, 15 May 2019 19:12:44 GMT'}, {'version': 'v3', 'created': 'Mon, 5 Aug 2019 16:31:13 GMT'}, {'version': 'v4', 'created': 'Wed, 7 Aug 2019 19:28:19 GMT'}]",2019-08-09,"[['Adams', 'Andrew', '', 'Pittsburgh Supercomputing Center'], ['Avila', 'Kay', '', 'NCSA'], ['Basney', 'Jim', '', 'NCSA'], ['Brunson', 'Dana', '', 'Internet2'], ['Cowles', 'Robert', '', 'BrightLite\n  Information Security'], ['Dopheide', 'Jeannette', '', 'NCSA'], ['Fleury', 'Terry', '', 'NCSA'], ['Heymann', 'Elisa', '', 'University of Wisconsin-Madison'], ['Hudson', 'Florence', '', 'Independent\n  Consultant'], ['Jackson', 'Craig', '', 'Indiana University'], ['Kiser', 'Ryan', '', 'Indiana\n  University'], ['Krenz', 'Mark', '', 'Indiana University'], ['Marsteller', 'Jim', '', 'Pittsburgh\n  Supercomputing Center'], ['Miller', 'Barton P.', '', 'University of Wisconsin-Madison'], ['Peisert', 'Sean', '', 'Berkeley Lab'], ['Russell', 'Scott', '', 'Indiana University'], ['Sons', 'Susan', '', 'Indiana University'], ['Welch', 'Von', '', 'Indiana University'], ['Zage', 'John', '', 'NCSA']]","['security and protection', 'distributed systems', 'risk management']"
9741,2205.08818,Aitor Arjona,Aitor Arjona and Gerard Finol and Pedro Garcia-Lopez,Transparent Serverless execution of Python multiprocessing applications,,"Future Generation Computer Systems, Volume 140, March 2023, Pages
  436-449",10.1016/j.future.2022.10.038,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Access transparency means that both local and remote resources are accessed
using identical operations. With transparency, unmodified single-machine
applications could run over disaggregated compute, storage, and memory
resources. Hiding the complexity of distributed systems through transparency
would have great benefits, like scaling-out local-parallel scientific
applications over flexible disaggregated resources in the Cloud.
  This paper presents a performance evaluation where we assess the feasibility
of access transparency over state-of-the-art Cloud disaggregated resources for
Python multiprocessing applications. We have interfaced the multiprocessing
module with an implementation that transparently runs processes on serverless
functions and uses an in-memory data store for shared state.
  To evaluate transparency, we run in the Cloud four unmodified applications:
Uber Research's Evolution Strategies, Baselines-AI's Proximal Policy
Optimization, Pandaral.lel's dataframe, and ScikitLearn's Hyperparameter
tuning. We compare execution time and scalability of the same application
running over disaggregated resources using our library, with the single-machine
Python multiprocessing libraries in a large VM. For equal resources,
applications efficiently using message-passing abstractions achieve comparable
results despite the significant overheads of remote communication. Other
shared-memory intensive applications do not perform due to high remote memory
latency.
  The results show that Python's multiprocessing library design is an enabler
towards transparency: legacy applications using efficient disaggregated
abstractions can transparently scale beyond VM limited resources for increased
parallelism without changing the underlying code or architecture.
","[{'version': 'v1', 'created': 'Wed, 18 May 2022 09:32:11 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Nov 2022 11:01:36 GMT'}]",2022-11-23,"[['Arjona', 'Aitor', ''], ['Finol', 'Gerard', ''], ['Garcia-Lopez', 'Pedro', '']]","['transparency', 'access transparency', 'serverless', 'FaaS', 'multiprocessing', 'parallel programming']"
9742,2105.00669,Thorsten Wi{\ss}mann,"Thorsten Wi{\ss}mann, Stefan Milius, Lutz Schr\""oder",Explaining Behavioural Inequivalence Generically in Quasilinear Time,Full version with appendix containing all proofs,,10.4230/LIPIcs.CONCUR.2021.32,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  We provide a generic algorithm for constructing formulae that distinguish
behaviourally inequivalent states in systems of various transition types such
as nondeterministic, probabilistic or weighted; genericity over the transition
type is achieved by working with coalgebras for a set functor in the paradigm
of universal coalgebra. For every behavioural equivalence class in a given
system, we construct a formula which holds precisely at the states in that
class. The algorithm instantiates to deterministic finite automata, transition
systems, labelled Markov chains, and systems of many other types. The ambient
logic is a modal logic featuring modalities that are generically extracted from
the functor; these modalities can be systematically translated into custom sets
of modalities in a postprocessing step. The new algorithm builds on an existing
coalgebraic partition refinement algorithm. It runs in time $\mathcal{O}((m+n)
\log n)$ on systems with $n$ states and $m$ transitions, and the same
asymptotic bound applies to the dag size of the formulae it constructs. This
improves the bounds on run time and formula size compared to previous
algorithms even for previously known specific instances, viz. transition
systems and Markov chains; in particular, the best previous bound for
transition systems was $\mathcal{O}(m n)$.
","[{'version': 'v1', 'created': 'Mon, 3 May 2021 07:57:17 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Jul 2021 17:27:59 GMT'}, {'version': 'v3', 'created': 'Tue, 28 Sep 2021 10:59:29 GMT'}]",2021-09-29,"[['Wißmann', 'Thorsten', ''], ['Milius', 'Stefan', ''], ['Schröder', 'Lutz', '']]","['bisimulation', 'partition refinement', 'modal logic', 'distinguishing formulae', 'coalgebra']"
9743,2002.06413,Alexander Beasley,"Alexander E. Beasley, Mohammed-Salah Abdelouahab, Ren\'e Lozi, Anna L.
  Powell, and Andrew Adamatzky",Mem-fractive Properties of Mushrooms,"26 pages, 37 figures",,10.1088/1748-3190/ac2e0c,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Memristors close the loop for I-V characteristics of the traditional,
passive, semi-conductor devices. Originally proposed in 1971, the hunt for the
memristor has been going ever since. The key feature of a memristor is that its
current resitance is a function of its previous resistance. As such, the
behaviour of the device is influenced by changing the way in which potential is
applied across it. Ultimately, information can be encoded on memristors.
Biological substrates have already been shown to exhibit some memristive
properties. However, many memristive devices are yet to be found. Here we show
that the fruit bodies of grey oyster fungi Pleurotus ostreatus exhibit
memristive behaviours. This paper presents the I-V characteristics of the
mushrooms. By examination of the conducted current for a given voltage applied
as a function of the previous voltage, it is shown that the mushroom is a
memristor. Our results demonstrate that nature continues to provide specimens
that hold these unique and valuable electrical characteristics and which have
the potential to advance the field of hybrid electronic systems.
","[{'version': 'v1', 'created': 'Sat, 15 Feb 2020 16:59:14 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Apr 2020 16:43:02 GMT'}]",2022-03-30,"[['Beasley', 'Alexander E.', ''], ['Abdelouahab', 'Mohammed-Salah', ''], ['Lozi', 'René', ''], ['Powell', 'Anna L.', ''], ['Adamatzky', 'Andrew', '']]","['memristor', 'fungi', 'memfractance']"
9744,2007.06933,Clayton Miller,"Clayton Miller, Pandarasamy Arjunan, Anjukan Kathirgamanathan, Chun
  Fu, Jonathan Roth, June Young Park, Chris Balbach, Krishnan Gowri, Zoltan
  Nagy, Anthony Fontanini, Jeff Haberl",The ASHRAE Great Energy Predictor III competition: Overview and results,,"Science and Technology for the Built Environment, 26:10,
  1427-1447, (2020)",10.1080/23744731.2020.1795514,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  In late 2019, ASHRAE hosted the Great Energy Predictor III (GEPIII) machine
learning competition on the Kaggle platform. This launch marked the third
energy prediction competition from ASHRAE and the first since the mid-1990s. In
this updated version, the competitors were provided with over 20 million points
of training data from 2,380 energy meters collected for 1,448 buildings from 16
sources. This competition's overall objective was to find the most accurate
modeling solutions for the prediction of over 41 million private and public
test data points. The competition had 4,370 participants, split across 3,614
teams from 94 countries who submitted 39,403 predictions. In addition to the
top five winning workflows, the competitors publicly shared 415 reproducible
online machine learning workflow examples (notebooks), including over 40
additional, full solutions. This paper gives a high-level overview of the
competition preparation and dataset, competitors and their discussions, machine
learning workflows and models generated, winners and their submissions,
discussion of lessons learned, and competition outputs and next steps. The most
popular and accurate machine learning workflows used large ensembles of mostly
gradient boosting tree models, such as LightGBM. Similar to the first predictor
competition, preprocessing of the data sets emerged as a key differentiator.
","[{'version': 'v1', 'created': 'Tue, 14 Jul 2020 09:41:36 GMT'}]",2020-10-07,"[['Miller', 'Clayton', ''], ['Arjunan', 'Pandarasamy', ''], ['Kathirgamanathan', 'Anjukan', ''], ['Fu', 'Chun', ''], ['Roth', 'Jonathan', ''], ['Park', 'June Young', ''], ['Balbach', 'Chris', ''], ['Gowri', 'Krishnan', ''], ['Nagy', 'Zoltan', ''], ['Fontanini', 'Anthony', ''], ['Haberl', 'Jeff', '']]","['Building energy model benchmarking', 'Machine learning benchmarking', 'Data-driven energy modeling', 'GradientBoosting Trees', 'Measurement and verification']"
9745,2205.15657,Andrea Passarella,"Valerio Arnaboldi, Andrea Passarella, Marco Conti, Robin Dunbar",Structure of Ego-alter relationships of Politicians in Twitter,,"Journal of Computer-Mediated Communication, Volume 22, Issue 5, 1
  September 2017, Pages 231-247",10.1111/jcc4.12193,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze the ego-alter Twitter networks of 300 Italian MPs and 18 European
leaders, and of about 14,000 generic users. We find structural properties
typical of social environments, meaning that Twitter activity is controlled by
constraints that are similar to those shaping conventional social
relationships. However, the evolution of ego-alter ties is very dynamic, which
suggests that they are not entirely used for social interaction, but for public
signaling and self-promotion. From this standpoint, the behavior of EU leaders
is much more evident, while Italian MPs are in between them and generic users.
We find that politicians, more than generic users, create relationships as a
side effect of tweeting on discussion topics, rather than by contacting
specific alters.
","[{'version': 'v1', 'created': 'Tue, 31 May 2022 09:53:07 GMT'}]",2022-06-01,"[['Arnaboldi', 'Valerio', ''], ['Passarella', 'Andrea', ''], ['Conti', 'Marco', ''], ['Dunbar', 'Robin', '']]","['political social networks', 'ego-centric networks', 'ego-alter network structure', 'Twitter', 'network dynamics']"
9746,2006.05385,Xiaojie Guo,"Xiaojie Guo, Liang Zhao, Zhao Qin, Lingfei Wu, Amarda Shehu, Yanfang
  Ye",Interpretable Deep Graph Generation with Node-Edge Co-Disentanglement,This paper has been accepted by KDD 2020,,10.1145/3394486.3403221,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Disentangled representation learning has recently attracted a significant
amount of attention, particularly in the field of image representation
learning. However, learning the disentangled representations behind a graph
remains largely unexplored, especially for the attributed graph with both node
and edge features. Disentanglement learning for graph generation has
substantial new challenges including 1) the lack of graph deconvolution
operations to jointly decode node and edge attributes; and 2) the difficulty in
enforcing the disentanglement among latent factors that respectively influence:
i) only nodes, ii) only edges, and iii) joint patterns between them. To address
these challenges, we propose a new disentanglement enhancement framework for
deep generative models for attributed graphs. In particular, a novel
variational objective is proposed to disentangle the above three types of
latent factors, with novel architecture for node and edge deconvolutions.
Moreover, within each type, individual-factor-wise disentanglement is further
enhanced, which is shown to be a generalization of the existing framework for
images. Qualitative and quantitative experiments on both synthetic and
real-world datasets demonstrate the effectiveness of the proposed model and its
extensions.
","[{'version': 'v1', 'created': 'Tue, 9 Jun 2020 16:33:49 GMT'}]",2020-06-11,"[['Guo', 'Xiaojie', ''], ['Zhao', 'Liang', ''], ['Qin', 'Zhao', ''], ['Wu', 'Lingfei', ''], ['Shehu', 'Amarda', ''], ['Ye', 'Yanfang', '']]","['Deep generative models', 'Graph Generation', 'disentanglement learning', 'Variational Auto-encoders']"
9747,2008.10449,Feng Xia,"Feng Xia, Qiuyuan Yang, Jie Li, Jiannong Cao, Li Liu, Ahmedin Mohammed
  Ahmed",Data Dissemination Using Interest Tree in Socially Aware Networking,"13 pages, 9 figures","Computer Networks, Vol. 91, November 2015, pp: 495-507",10.1016/j.comnet.2015.08.047,,cs.SI cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Socially aware networking (SAN) exploits social characteristics of mobile
users to streamline data dissemination protocols in opportunistic environments.
Existing protocols in this area utilized various social features such as user
interests, social similarity, and community structure to improve the
performance of data dissemination. However, the interrelationship between user
interests and its impact on the efficiency of data dissemination has not been
explored sufficiently. In this paper, we analyze various kinds of relationships
between user interests and model them using a layer-based structure in order to
form social communities in SAN paradigm. We propose Int-Tree, an Interest-Tree
based scheme which uses the relationship between user interests to improve the
performance of data dissemination. The core of Int-Tree is the interest-tree, a
tree-based community structure that combines two social features, i.e. density
of a community and social tie, to support data dissemination. The simulation
results show that Int-Tree achieves higher delivery ratio, lower overhead, in
comparison to two benchmark protocols, PROPHET and Epidemic routing. In
addition, Int-Tree can perform with 1.36 hop counts in average, and tolerable
latency in terms of buffer size, time to live (TTL) and simulation duration.
Finally, Int-Tree keeps stable performance with various parameters.
","[{'version': 'v1', 'created': 'Sun, 9 Aug 2020 03:45:52 GMT'}]",2020-08-25,"[['Xia', 'Feng', ''], ['Yang', 'Qiuyuan', ''], ['Li', 'Jie', ''], ['Cao', 'Jiannong', ''], ['Liu', 'Li', ''], ['Ahmed', 'Ahmedin Mohammed', '']]","['data dissemination', 'social awareness', 'community structure', 'user interest', 'tree structure']"
9748,2009.05695,Niluthpol Chowdhury Mithun,"Niluthpol Chowdhury Mithun, Karan Sikka, Han-Pang Chiu, Supun
  Samarasekera, Rakesh Kumar",RGB2LIDAR: Towards Solving Large-Scale Cross-Modal Visual Localization,ACM Multimedia 2020,,10.1145/3394171.3413647,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study an important, yet largely unexplored problem of large-scale
cross-modal visual localization by matching ground RGB images to a
geo-referenced aerial LIDAR 3D point cloud (rendered as depth images). Prior
works were demonstrated on small datasets and did not lend themselves to
scaling up for large-scale applications. To enable large-scale evaluation, we
introduce a new dataset containing over 550K pairs (covering 143 km^2 area) of
RGB and aerial LIDAR depth images. We propose a novel joint embedding based
method that effectively combines the appearance and semantic cues from both
modalities to handle drastic cross-modal variations. Experiments on the
proposed dataset show that our model achieves a strong result of a median rank
of 5 in matching across a large test set of 50K location pairs collected from a
14km^2 area. This represents a significant advancement over prior works in
performance and scale. We conclude with qualitative results to highlight the
challenging nature of this task and the benefits of the proposed model. Our
work provides a foundation for further research in cross-modal visual
localization.
","[{'version': 'v1', 'created': 'Sat, 12 Sep 2020 01:18:45 GMT'}]",2020-09-15,"[['Mithun', 'Niluthpol Chowdhury', ''], ['Sikka', 'Karan', ''], ['Chiu', 'Han-Pang', ''], ['Samarasekera', 'Supun', ''], ['Kumar', 'Rakesh', '']]","['Large-scale Visual Localization', 'Cross-Modal Matching', 'Joint Embedding', 'RGB2LIDAR', 'Weak Cross-Modal Supervision']"
9749,2010.10913,Jakob Bossek,"Jakob Bossek, Frank Neumann","Evolutionary Diversity Optimization and the Minimum Spanning Tree
  Problem",,,10.1145/3449639.3459363,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the area of evolutionary computation the calculation of diverse sets of
high-quality solutions to a given optimization problem has gained momentum in
recent years under the term evolutionary diversity optimization. Theoretical
insights into the working principles of baseline evolutionary algorithms for
diversity optimization are still rare. In this paper we study the well-known
Minimum Spanning Tree problem (MST) in the context of diversity optimization
where population diversity is measured by the sum of pairwise edge overlaps.
Theoretical results provide insights into the fitness landscape of the MST
diversity optimization problem pointing out that even for a population of
$\mu=2$ fitness plateaus (of constant length) can be reached, but nevertheless
diverse sets can be calculated in polynomial time. We supplement our
theoretical results with a series of experiments for the unconstrained and
constraint case where all solutions need to fulfill a minimal quality
threshold. Our results show that a simple $(\mu+1)$-EA can effectively compute
a diversified population of spanning trees of high quality.
","[{'version': 'v1', 'created': 'Wed, 21 Oct 2020 11:50:49 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Apr 2021 12:38:45 GMT'}]",2021-04-28,"[['Bossek', 'Jakob', ''], ['Neumann', 'Frank', '']]","['Evolutionary algorithms', 'evolutionary diversity optimization', 'runtime analysis', 'minimum spanning tree']"
9750,2211.14452,Aaron Paul Dela Rosa,Aaron Paul M. Dela Rosa,"Web-based Management Information System of Cases Filed with the National
  Labor Relations Commission",,"International Journal of Computing Sciences Research (ISSN print:
  2546-0552; ISSN online: 2546-115X), Vol. 6, August 13, 2022",10.25147/ijcsr.2017.001.1.113,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  This study was developed to describe the daily operations and encountered
problems of the National Labor Relations Commission Regional Arbitration Branch
No. IV (NLRC RAB IV) through conducted observations and interviews. These
problems were addressed and analyzed to be the features of the developed
web-based management information system (MIS) for cases. The research
methodology utilized in this project was the descriptive developmental
approach. The Agile Software Development methodology was followed to develop
the system. It was used to quickly produce the desired output while allowing
the user to go back through phases without finishing the whole cycle. The
system covered managing filed complaints, Single-Entry Approach (SEnA), labor
cases, and report generation. The findings, through the interview, of handling
records were inconsistent and inaccurate. This study also focused on ensuring
the Data Privacy Act of 2012, protecting the database's information using the
XOR Cipher Algorithm. This study was evaluated using standard web evaluation
criteria. Using the criteria, the study's overall mean was 4.27 and 4.43, with
the descriptive meaning of Very Good, which showed that the system was accepted
as perceived by experts and end-users, respectively. Management of filed cases
is a vital process for the Commission. With that said, developing a web-based
management information system could ease the internal operations of handling
and managing filed labor cases. Moreover, respondents and complainants can
easily determine their filed cases' status using the case status tracking
system. For further improvements to the system, additional printable documents
may be added that could be found needed by the Commission. Lastly, further
research about the effectiveness of the web-based system may be conducted for
further enhancements of the system.
","[{'version': 'v1', 'created': 'Wed, 23 Nov 2022 06:30:01 GMT'}]",2022-11-29,"[['Rosa', 'Aaron Paul M. Dela', '']]","['management information system', 'information technology', 'information systems', 'agile software development methodology', 'labor relations   INTRODUCTION']"
9751,1908.10193,Hiteshwar Azad,"Hiteshwar Kumar Azad, Akshay Deepak",A novel model for query expansion using pseudo-relevant web knowledge,32 pages,Pattern Recognition Letters 2022,10.1016/j.patrec.2022.04.013,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the field of information retrieval, query expansion (QE) has long been
used as a technique to deal with the fundamental issue of word mismatch between
a user's query and the target information. In the context of the relationship
between the query and expanded terms, existing weighting techniques often fail
to appropriately capture the term-term relationship and term to the whole query
relationship, resulting in low retrieval effectiveness. Our proposed QE
approach addresses this by proposing three weighting models based on (1)
tf-itf, (2) k-nearest neighbor (kNN) based cosine similarity, and (3)
correlation score. Further, to extract the initial set of expanded terms, we
use pseudo-relevant web knowledge consisting of the top N web pages returned by
the three popular search engines namely, Google, Bing, and DuckDuckGo, in
response to the original query. Among the three weighting models, tf-itf scores
each of the individual terms obtained from the web content, kNN-based cosine
similarity scores the expansion terms to obtain the term-term relationship, and
correlation score weighs the selected expansion terms with respect to the whole
query. The proposed model, called web knowledge based query expansion (WKQE),
achieves an improvement of 25.89% on the MAP score and 30.83% on the GMAP score
over the unexpanded queries on the FIRE dataset. A comparative analysis of the
WKQE techniques with other related approaches clearly shows significant
improvement in the retrieval performance. We have also analyzed the effect of
varying the number of pseudo-relevant documents and expansion terms on the
retrieval effectiveness of the proposed model.
","[{'version': 'v1', 'created': 'Tue, 27 Aug 2019 13:38:35 GMT'}]",2022-08-16,"[['Azad', 'Hiteshwar Kumar', ''], ['Deepak', 'Akshay', '']]","['Query expansion', 'Query reformulation', 'Information retrieval', 'Pseudo']"
9752,2110.12855,Wei-Tsung Lu,"Wei-Tsung Lu, Meng-Hsuan Wu, Yuh-Ming Chiu, Li Su","Actions Speak Louder than Listening: Evaluating Music Style Transfer
  based on Editing Experience","9 pages, Proceedings of the 29th ACM International Conference on
  Multimedia",,10.1145/3474085.3475529,,cs.SD cs.HC cs.LG cs.MM eess.AS,http://creativecommons.org/licenses/by/4.0/,"  The subjective evaluation of music generation techniques has been mostly done
with questionnaire-based listening tests while ignoring the perspectives from
music composition, arrangement, and soundtrack editing. In this paper, we
propose an editing test to evaluate users' editing experience of music
generation models in a systematic way. To do this, we design a new music style
transfer model combining the non-chronological inference architecture,
autoregressive models and the Transformer, which serves as an improvement from
the baseline model on the same style transfer task. Then, we compare the
performance of the two models with a conventional listening test and the
proposed editing test, in which the quality of generated samples is assessed by
the amount of effort (e.g., the number of required keyboard and mouse actions)
spent by users to polish a music clip. Results on two target styles indicate
that the improvement over the baseline model can be reflected by the editing
test quantitatively. Also, the editing test provides profound insights which
are not accessible from usual listening tests. The major contribution of this
paper is the systematic presentation of the editing test and the corresponding
insights, while the proposed music style transfer model based on
state-of-the-art neural networks represents another contribution.
","[{'version': 'v1', 'created': 'Mon, 25 Oct 2021 12:20:30 GMT'}]",2021-10-26,"[['Lu', 'Wei-Tsung', ''], ['Wu', 'Meng-Hsuan', ''], ['Chiu', 'Yuh-Ming', ''], ['Su', 'Li', '']]","['Human-centered computing', 'neural networks', 'music generation', 'style transfer', 'artificial intelligence']"
9753,2212.12733,Daniel Benalcazar,"Daniel P. Benalcazar, David A. Benalcazar, Andres Valenzuela","Artificial Pupil Dilation for Data Augmentation in Iris Semantic
  Segmentation","6 pages, 7 figures, 2 tables","2022 IEEE Sixth Ecuador Technical Chapters Meeting (ETCM), 2022,
  pp. 1-6",10.1109/ETCM56276.2022.9935749,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Biometrics is the science of identifying an individual based on their
intrinsic anatomical or behavioural characteristics, such as fingerprints,
face, iris, gait, and voice. Iris recognition is one of the most successful
methods because it exploits the rich texture of the human iris, which is unique
even for twins and does not degrade with age. Modern approaches to iris
recognition utilize deep learning to segment the valid portion of the iris from
the rest of the eye, so it can then be encoded, stored and compared. This paper
aims to improve the accuracy of iris semantic segmentation systems by
introducing a novel data augmentation technique. Our method can transform an
iris image with a certain dilation level into any desired dilation level, thus
augmenting the variability and number of training examples from a small
dataset. The proposed method is fast and does not require training. The results
indicate that our data augmentation method can improve segmentation accuracy up
to 15% for images with high pupil dilation, which creates a more reliable iris
recognition pipeline, even under extreme dilation.
","[{'version': 'v1', 'created': 'Sat, 24 Dec 2022 13:31:56 GMT'}]",2022-12-27,"[['Benalcazar', 'Daniel P.', ''], ['Benalcazar', 'David A.', ''], ['Valenzuela', 'Andres', '']]","['iris recognition', 'semantic segmentation', 'data augmentation', 'pupil dilation']"
9754,2108.12675,Ali Rajaei Harandi,"Shahed Rezaei (1), Ali Harandi (2), Tim Brepols (2), Stefanie Reese
  (2)","An anisotropic cohesive fracture model: advantages and limitations of
  length-scale insensitive phase-field damage models",,,10.1016/j.engfracmech.2021.108177,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The goal of the current work is to explore direction-dependent damage
initiation and propagation within an arbitrary anisotropic solid. In
particular, we aim at developing anisotropic cohesive phase-field (PF) damage
models by extending the idea introduced in \cite{REZAEI2021a} for
direction-dependent fracture energy and also anisotropic PF damage models based
on structural tensors. The cohesive PF damage formulation used in the current
contribution is motivated by the works of \cite{LORENTZ201120, wu2018,
GEELEN2019}. The results of the latter models are shown to be insensitive with
respect to the length scale parameter for the isotropic case. This is because
they manage to formulate the fracture energy as a function of diffuse
displacement jumps in the localized damaged zone. In the present paper, we
discuss numerical examples and details on finite element implementations where
the fracture energy, as well as the material strength, are introduced as an
arbitrary function of the crack direction. Using the current formulation for
anisotropic cohesive fracture, the obtained results are almost insensitive with
respect to the length scale parameter. The latter is achieved by including the
direction-dependent strength of the material in addition to its fracture
energy. Utilizing the current formulation, one can increase the mesh size which
reduces the computational time significantly without any severe change in the
predicted crack path and overall obtained load-displacement curves. We also
argue that these models still lack to capture mode-dependent fracture
properties. Open issues and possible remedies for future developments are
finally discussed as well.
","[{'version': 'v1', 'created': 'Sat, 28 Aug 2021 16:48:06 GMT'}]",2022-05-23,"[['Rezaei', 'Shahed', ''], ['Harandi', 'Ali', ''], ['Brepols', 'Tim', ''], ['Reese', 'Stefanie', '']]","['anisotropic cohesive fracture', 'phase-field damage model', 'length-scale insensitive']"
9755,1601.01876,Salah Eddine Bekhouche SE. Bekhouche,"Salah Eddine Bekhouche (1), Abdelkrim Ouafi (1), Abdelmalik
  Taleb-Ahmed (2), Abdenour Hadid (3), Azeddine Benlamoudi (1) ((1) Laboratory
  of LESIA, University of Biskra, Algeria, (2) LAMIH, University of
  Valenciennes, France, (3) Center for Machine Vision Research, University of
  Oulu, Finland)",Facial age estimation using BSIF and LBP,"5 pages, 8 figures",,10.13140/RG.2.1.1933.6483/1,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human face aging is irreversible process causing changes in human face
characteristics such us hair whitening, muscles drop and wrinkles. Due to the
importance of human face aging in biometrics systems, age estimation became an
attractive area for researchers. This paper presents a novel method to estimate
the age from face images, using binarized statistical image features (BSIF) and
local binary patterns (LBP)histograms as features performed by support vector
regression (SVR) and kernel ridge regression (KRR). We applied our method on
FG-NET and PAL datasets. Our proposed method has shown superiority to that of
the state-of-the-art methods when using the whole PAL database.
","[{'version': 'v1', 'created': 'Fri, 8 Jan 2016 14:03:21 GMT'}]",2016-01-11,"[['Bekhouche', 'Salah Eddine', ''], ['Ouafi', 'Abdelkrim', ''], ['Taleb-Ahmed', 'Abdelmalik', ''], ['Hadid', 'Abdenour', ''], ['Benlamoudi', 'Azeddine', '']]","['Age estimation', 'BSIF', 'LBP', 'Regression']"
9756,2210.01362,Ryo Suzuki,"Marcus Friedel, Ehud Sharlin, Ryo Suzuki",HapticLever: Kinematic Force Feedback using a 3D Pantograph,UIST 2022 Poster,,10.1145/3526114.3558736,,cs.HC cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  HapticLever is a new kinematic approach for VR haptics which uses a 3D
pantograph to stiffly render large-scale surfaces using small-scale proxies.
The HapticLever approach does not consume power to render forces, but rather
puts a mechanical constraint on the end effector using a small-scale proxy
surface. The HapticLever approach provides stiff force feedback when the user
interacts with a static virtual surface, but allows the user to move their arm
freely when moving through free virtual space. We present the problem space,
the related work, and the HapticLever design approach.
","[{'version': 'v1', 'created': 'Tue, 4 Oct 2022 04:08:00 GMT'}]",2022-10-05,"[['Friedel', 'Marcus', ''], ['Sharlin', 'Ehud', ''], ['Suzuki', 'Ryo', '']]","['haptics', 'force feedback', 'virtual reality', 'robotics', 'user interfaces']"
9757,2107.03698,Lukas Lamm,"L. Lamm and H. Holthusen and T. Brepols and S. Jockenh\""ovel and S.
  Reese","A macroscopic approach for stress driven anisotropic growth in
  bioengineered soft tissues",,,10.1007/s10237-021-01554-1,,cs.CE cond-mat.soft,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The simulation of growth processes within soft biological tissues is of
utmost importance for many applications in the medical sector. Within this
contribution we propose a new macroscopic approach fro modelling stress-driven
volumetric growth occurring in soft tissues. Instead of using the standard
approach of a-priori defining the structure of the growth tensor, we postulate
the existance of a general growth potential. Such a potential describes all
eligable homeostatic stress states that can ultimately be reached as a result
of the growth process. Making use of well established methods from
visco-plasticity, the evolution of the growth related right Cauchy-Green tensor
is subsequently defined as a time dependent associative evolution law with
respect to the introduced potential. This approach naturally leads to a
formulation that is able to cover both, isotropic and anisotropic growth
related changes in geometry. It furthermore allows the model to flexibly adapt
to changing boundary and loading conditions. Besides the theoretical
development, we also describe the algorithmic implementation and furthermore
compare the newly derived model with a standard formulation of isotropic
growth.
","[{'version': 'v1', 'created': 'Thu, 8 Jul 2021 09:21:33 GMT'}]",2022-01-21,"[['Lamm', 'L.', ''], ['Holthusen', 'H.', ''], ['Brepols', 'T.', ''], ['Jockenhövel', 'S.', ''], ['Reese', 'S.', '']]","['anisotropic growth', 'growth potential', 'engineered tissue', 'finite strain']"
9758,2011.09121,Mahdi Miraz,Mahdi H. Miraz and Maaruf Ali,Integration of Blockchain and IoT: An Enhanced Security Perspective,arXiv admin note: substantial text overlap with arXiv:1806.05242,"Annals of Emerging Technologies in Computing (AETiC), Print ISSN:
  2516-0281, Online ISSN: 2516-029X, pp. 52-63, Vol. 4, No. 4, 1st October
  2020, Available: http://aetic.theiaer.org/archive/v4/v4n4/p6.html",10.33166/AETiC.2020.04.006,,cs.CR cs.NI,http://creativecommons.org/licenses/by/4.0/,"  Blockchain (BC), a by-product of Bitcoin cryptocurrency, has gained immense
and wide scale popularity for its applicability in various diverse domains -
especially in multifaceted non-monetary systems. By adopting cryptographic
techniques such as hashing and asymmetric encryption - along with distributed
consensus approach, a Blockchain based distributed ledger not only becomes
highly secure but also immutable and thus eliminates the need for any
third-party intermediators. On the contrary, innumerable IoT (Internet of
Things) devices are increasingly being added to the network. This phenomenon
poses higher risk in terms of security and privacy. It is thus extremely
important to address the security aspects of the growing IoT ecosystem. This
paper explores the applicability of BC for ensuring enhanced security and
privacy in the IoT ecosystem. Recent research articles and projects or
applications were surveyed to assess the implementation of BC for IoT Security
and identify associated challenges and propose solutions for BC enabled
enhanced security for the IoT ecosystem.
","[{'version': 'v1', 'created': 'Thu, 5 Nov 2020 13:42:35 GMT'}]",2020-11-19,"[['Miraz', 'Mahdi H.', ''], ['Ali', 'Maaruf', '']]","['Blockchain', 'Blockchain of Things (BCoT)', 'Distributed Ledger Technology (DLT)', 'Internet of Things (IoT)', 'Proof-of-Work (PoW)', 'Security']"
9759,2002.06213,Toni Mattis,"Toni Mattis (Hasso Plattner Institute, Germany), Robert Hirschfeld
  (HPI, University of Potsdam, Germany)",Lightweight Lexical Test Prioritization for Immediate Feedback,,"The Art, Science, and Engineering of Programming, 2020, Vol. 4,
  Issue 3, Article 12",10.22152/programming-journal.org/2020/4/12,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The practice of unit testing enables programmers to obtain automated feedback
on whether a currently edited program is consistent with the expectations
specified in test cases. Feedback is most valuable when it happens immediately,
as defects can be corrected instantly before they become harder to fix. With
growing and longer running test suites, however, feedback is obtained less
frequently and lags behind program changes.
  The objective of test prioritization is to rank tests so that defects, if
present, are found as early as possible or with the least costs. While there
are numerous static approaches that output a ranking of tests solely based on
the current version of a program, we focus on change-based test prioritization,
which recommends tests that likely fail in response to the most recent program
change. The canonical approach relies on coverage data and prioritizes tests
that cover the changed region, but obtaining and updating coverage data is
costly. More recently, information retrieval techniques that exploit
overlapping vocabulary between change and tests have proven to be powerful, yet
lightweight.
  In this work, we demonstrate the capabilities of information retrieval for
prioritizing tests in dynamic programming languages using Python as example. We
discuss and measure previously understudied variation points, including how
contextual information around a program change can be used, and design
alternatives to the widespread \emph{TF-IDF} retrieval model tailored to
retrieving failing tests.
  To obtain program changes with associated test failures, we designed a tool
that generates a large set of faulty changes from version history along with
their test results. Using this data set, we compared existing and new lexical
prioritization strategies using four open-source Python projects, showing large
improvements over untreated and random test orders and results consistent with
related work in statically typed languages.
  We conclude that lightweight IR-based prioritization strategies are effective
tools to predict failing tests in the absence of coverage data or when static
analysis is intractable like in dynamic languages. This knowledge can benefit
both individual programmers that rely on fast feedback, as well as operators of
continuous integration infrastructure, where resources can be freed sooner by
detecting defects earlier in the build cycle.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 19:00:13 GMT'}]",2020-02-21,"[['Mattis', 'Toni', '', 'Hasso Plattner Institute, Germany'], ['Hirschfeld', 'Robert', '', 'HPI, University of Potsdam, Germany']]","['immediate feedback', 'test prioritization', 'fault seeding', 'dynamic languages']"
9760,2011.11074,Simon Gabay,"Simon Gabay (UNIGE), Thibault Cl\'erice (ENC), Jean-Baptiste Camps
  (ENC), Jean-Baptiste Tanguy (SU), Matthias Gille-Levenson (ENS Lyon)","Standardizing linguistic data: method and tools for annotating
  (pre-orthographic) French",,"Proceedings of the 2nd International Digital Tools & Uses Congress
  (DTUC '20), Oct 2020, Hammamet, Tunisia",10.1145/3423603.3423996,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the development of big corpora of various periods, it becomes crucial to
standardise linguistic annotation (e.g. lemmas, POS tags, morphological
annotation) to increase the interoperability of the data produced, despite
diachronic variations. In the present paper, we describe both methodologically
(by proposing annotation principles) and technically (by creating the required
training data and the relevant models) the production of a linguistic tagger
for (early) modern French (16-18th c.), taking as much as possible into account
already existing standards for contemporary and, especially, medieval French.
","[{'version': 'v1', 'created': 'Sun, 22 Nov 2020 17:39:43 GMT'}]",2020-11-24,"[['Gabay', 'Simon', '', 'UNIGE'], ['Clérice', 'Thibault', '', 'ENC'], ['Camps', 'Jean-Baptiste', '', 'ENC'], ['Tanguy', 'Jean-Baptiste', '', 'SU'], ['Gille-Levenson', 'Matthias', '', 'ENS Lyon']]","['linguisticannotation', 'pre-orthographiclanguage', 'lemmatisation', 'POStagging']"
9761,2001.11458,Subendhu Rongali,"Subendhu Rongali (University of Massachusetts Amherst), Luca Soldaini
  (Amazon Alexa Search), Emilio Monti (Amazon Alexa), Wael Hamza (Amazon Alexa
  AI)","Don't Parse, Generate! A Sequence to Sequence Architecture for
  Task-Oriented Semantic Parsing",To be published in The Web Conference (WWW 2020),,10.1145/3366423.3380064,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Virtual assistants such as Amazon Alexa, Apple Siri, and Google Assistant
often rely on a semantic parsing component to understand which action(s) to
execute for an utterance spoken by its users. Traditionally, rule-based or
statistical slot-filling systems have been used to parse ""simple"" queries; that
is, queries that contain a single action and can be decomposed into a set of
non-overlapping entities. More recently, shift-reduce parsers have been
proposed to process more complex utterances. These methods, while powerful,
impose specific limitations on the type of queries that can be parsed; namely,
they require a query to be representable as a parse tree.
  In this work, we propose a unified architecture based on Sequence to Sequence
models and Pointer Generator Network to handle both simple and complex queries.
Unlike other works, our approach does not impose any restriction on the
semantic parse schema. Furthermore, experiments show that it achieves state of
the art performance on three publicly available datasets (ATIS, SNIPS, Facebook
TOP), relatively improving between 3.3% and 7.7% in exact match accuracy over
previous systems. Finally, we show the effectiveness of our approach on two
internal datasets.
","[{'version': 'v1', 'created': 'Thu, 30 Jan 2020 17:11:00 GMT'}]",2020-01-31,"[['Rongali', 'Subendhu', '', 'University of Massachusetts Amherst'], ['Soldaini', 'Luca', '', 'Amazon Alexa Search'], ['Monti', 'Emilio', '', 'Amazon Alexa'], ['Hamza', 'Wael', '', 'Amazon Alexa\n  AI']]","['Natural Language Understanding', 'Semantic Parsing', 'Voice Assistants', 'Sequence to Sequence models']"
9762,1805.01282,Ni Zhuang,"Ni Zhuang, Yan Yan, Si Chen, Hanzi Wang and Chunhua Shen","Multi-label Learning Based Deep Transfer Neural Network for Facial
  Attribute Classification",,,10.1016/j.patcog.2018.03.018,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep Neural Network (DNN) has recently achieved outstanding performance in a
variety of computer vision tasks, including facial attribute classification.
The great success of classifying facial attributes with DNN often relies on a
massive amount of labelled data. However, in real-world applications, labelled
data are only provided for some commonly used attributes (such as age, gender);
whereas, unlabelled data are available for other attributes (such as
attraction, hairline). To address the above problem, we propose a novel deep
transfer neural network method based on multi-label learning for facial
attribute classification, termed FMTNet, which consists of three sub-networks:
the Face detection Network (FNet), the Multi-label learning Network (MNet) and
the Transfer learning Network (TNet). Firstly, based on the Faster Region-based
Convolutional Neural Network (Faster R-CNN), FNet is fine-tuned for face
detection. Then, MNet is fine-tuned by FNet to predict multiple attributes with
labelled data, where an effective loss weight scheme is developed to explicitly
exploit the correlation between facial attributes based on attribute grouping.
Finally, based on MNet, TNet is trained by taking advantage of unsupervised
domain adaptation for unlabelled facial attribute classification. The three
sub-networks are tightly coupled to perform effective facial attribute
classification. A distinguishing characteristic of the proposed FMTNet method
is that the three sub-networks (FNet, MNet and TNet) are constructed in a
similar network structure. Extensive experimental results on challenging face
datasets demonstrate the effectiveness of our proposed method compared with
several state-of-the-art methods.
","[{'version': 'v1', 'created': 'Thu, 3 May 2018 13:13:50 GMT'}]",2018-05-04,"[['Zhuang', 'Ni', ''], ['Yan', 'Yan', ''], ['Chen', 'Si', ''], ['Wang', 'Hanzi', ''], ['Shen', 'Chunhua', '']]","['transfer learning', 'facial attribute classification', 'multi-label learning', 'deep learning', 'convolutional neural networks']"
9763,2106.12284,Yanye Lu,"Mengdi Gao, Ximeng Feng, Mufeng Geng, Zhe Jiang, Lei Zhu, Xiangxi
  Meng, Chuanqing Zhou, Qiushi Ren and Yanye Lu","Bayesian Statistics Guided Label Refurbishment Mechanism: Mitigating
  Label Noise in Medical Image Classification","10 pages, 11 figures",,10.1002/mp.15799,,cs.CV cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Purpose: Deep neural networks (DNNs) have been widely applied in medical
image classification, benefiting from its powerful mapping capability among
medical images. However, these existing deep learning-based methods depend on
an enormous amount of carefully labeled images. Meanwhile, noise is inevitably
introduced in the labeling process, degrading the performance of models. Hence,
it's significant to devise robust training strategies to mitigate label noise
in the medical image classification tasks. Methods: In this work, we propose a
novel Bayesian statistics guided label refurbishment mechanism (BLRM) for DNNs
to prevent overfitting noisy images. BLRM utilizes maximum a posteriori
probability (MAP) in the Bayesian statistics and the exponentially
time-weighted technique to selectively correct the labels of noisy images. The
training images are purified gradually with the training epochs when BLRM is
activated, further improving classification performance. Results: Comprehensive
experiments on both synthetic noisy images (public OCT & Messidor datasets) and
real-world noisy images (ANIMAL-10N) demonstrate that BLRM refurbishes the
noisy labels selectively, curbing the adverse effects of noisy data. Also, the
anti-noise BLRM integrated with DNNs are effective at different noise ratio and
are independent of backbone DNN architectures. In addition, BLRM is superior to
state-of-the-art comparative methods of anti-noise. Conclusions: These
investigations indicate that the proposed BLRM is well capable of mitigating
label noise in medical image classification tasks.
","[{'version': 'v1', 'created': 'Wed, 23 Jun 2021 10:05:47 GMT'}, {'version': 'v2', 'created': 'Sat, 11 Jun 2022 12:53:52 GMT'}]",2022-10-12,"[['Gao', 'Mengdi', ''], ['Feng', 'Ximeng', ''], ['Geng', 'Mufeng', ''], ['Jiang', 'Zhe', ''], ['Zhu', 'Lei', ''], ['Meng', 'Xiangxi', ''], ['Zhou', 'Chuanqing', ''], ['Ren', 'Qiushi', ''], ['Lu', 'Yanye', '']]","['deep learning', 'noisy label', 'label refurbishment', 'medical image classification']"
9764,1910.03090,Fatih Cagatay Akyon,"Fatih Cagatay Akyon, Esat Kalfaoglu",Instagram Fake and Automated Account Detection,,"2019 Innovations in Intelligent Systems and Applications
  Conference (ASYU)",10.1109/ASYU48272.2019.8946437,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fake engagement is one of the significant problems in Online Social Networks
(OSNs) which is used to increase the popularity of an account in an inorganic
manner. The detection of fake engagement is crucial because it leads to loss of
money for businesses, wrong audience targeting in advertising, wrong product
predictions systems, and unhealthy social network environment. This study is
related with the detection of fake and automated accounts which leads to fake
engagement on Instagram. Prior to this work, there were no publicly available
dataset for fake and automated accounts. For this purpose, two datasets have
been published for the detection of fake and automated accounts. For the
detection of these accounts, machine learning algorithms like Naive Bayes,
Logistic Regression, Support Vector Machines and Neural Networks are applied.
Additionally, for the detection of automated accounts, cost sensitive genetic
algorithm is proposed to handle the unnatural bias in the dataset. To deal with
the unevenness problem in the fake dataset, Smote-nc algorithm is implemented.
For the automated and fake account detection datasets, 86% and 96%
classification accuracies are obtained, respectively.
","[{'version': 'v1', 'created': 'Fri, 13 Sep 2019 12:51:01 GMT'}, {'version': 'v2', 'created': 'Thu, 31 Oct 2019 10:08:35 GMT'}, {'version': 'v3', 'created': 'Thu, 19 May 2022 20:04:52 GMT'}]",2022-05-23,"[['Akyon', 'Fatih Cagatay', ''], ['Kalfaoglu', 'Esat', '']]","['fake engagement', 'machine learning', 'online socialnetworks', 'Instagram', 'genetic algorithm', 'smote']"
9765,1710.09182,Manuel Sebastian Mariani,"Manuel Sebastian Mariani, Matus Medo, Fran\c{c}ois Lafond",Early identification of important patents through network centrality,14 pages,Technological Forecasting and Social Change (2018),10.1016/j.techfore.2018.01.036,,cs.SI cs.DL cs.IR physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the most challenging problems in technological forecasting is to
identify as early as possible those technologies that have the potential to
lead to radical changes in our society. In this paper, we use the US patent
citation network (1926-2010) to test our ability to early identify a list of
historically significant patents through citation network analysis. We show
that in order to effectively uncover these patents shortly after they are
issued, we need to go beyond raw citation counts and take into account both the
citation network topology and temporal information. In particular, an
age-normalized measure of patent centrality, called rescaled PageRank, allows
us to identify the significant patents earlier than citation count and PageRank
score. In addition, we find that while high-impact patents tend to rely on
other high-impact patents in a similar way as scientific papers, the patents'
citation dynamics is significantly slower than that of papers, which makes the
early identification of significant patents more challenging than that of
significant papers.
","[{'version': 'v1', 'created': 'Wed, 25 Oct 2017 11:43:52 GMT'}]",2018-06-04,"[['Mariani', 'Manuel Sebastian', ''], ['Medo', 'Matus', ''], ['Lafond', 'François', '']]","['Patent analysis', 'Citation networks', 'Significant patents', 'Technological forecasting', 'PageRank']"
9766,2111.14243,Priyank Kalgaonkar,"Priyank Kalgaonkar, Mohamed El-Sharkawy","EffCNet: An Efficient CondenseNet for Image Classification on NXP
  BlueBox","11 pages, 10 figures, published in American Journal of Electrical and
  Computer Engineering","Vol. 5, No. 2, 2021, pp. 77-87",10.11648/j.ajece.20210502.15,,cs.CV cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intelligent edge devices with built-in processors vary widely in terms of
capability and physical form to perform advanced Computer Vision (CV) tasks
such as image classification and object detection, for example. With constant
advances in the field of autonomous cars and UAVs, embedded systems and mobile
devices, there has been an ever-growing demand for extremely efficient
Artificial Neural Networks (ANN) for real-time inference on these smart edge
devices with constrained computational resources. With unreliable network
connections in remote regions and an added complexity of data transmission, it
is of an utmost importance to capture and process data locally instead of
sending the data to cloud servers for remote processing. Edge devices on the
other hand, offer limited processing power due to their inexpensive hardware,
and limited cooling and computational resources. In this paper, we propose a
novel deep convolutional neural network architecture called EffCNet which is an
improved and an efficient version of CondenseNet Convolutional Neural Network
(CNN) for edge devices utilizing self-querying data augmentation and depthwise
separable convolutional strategies to improve real-time inference performance
as well as reduce the final trained model size, trainable parameters, and
Floating-Point Operations (FLOPs) of EffCNet CNN. Furthermore, extensive
supervised image classification analyses are conducted on two benchmarking
datasets: CIFAR-10 and CIFAR-100, to verify real-time inference performance of
our proposed CNN. Finally, we deploy these trained weights on NXP BlueBox which
is an intelligent edge development platform designed for self-driving vehicles
and UAVs, and conclusions will be extrapolated accordingly.
","[{'version': 'v1', 'created': 'Sun, 28 Nov 2021 21:32:31 GMT'}]",2021-11-30,"[['Kalgaonkar', 'Priyank', ''], ['El-Sharkawy', 'Mohamed', '']]","['EffCNet', 'Convolutional Neural Network (CNN)', 'Computer Vision', 'Image Classification', 'Embedded Systems']"
9767,1801.05917,Kevin Moran P,"Qi Luo, Kevin Moran and Denys Poshyvanyk","A Large-Scale Empirical Comparison of Static and Dynamic Test Case
  Prioritization Techniques","12 pages, Accepted in the proceedings of the 2016 24th ACM SIGSOFT
  International Symposium on Foundations of Software Engineering (FSE'16)",,10.1145/2950290.2950344,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The large body of existing research in Test Case Prioritization (TCP)
techniques, can be broadly classified into two categories: dynamic techniques
(that rely on run-time execution information) and static techniques (that
operate directly on source and test code). Absent from this current body of
work is a comprehensive study aimed at understanding and evaluating the static
approaches and comparing them to dynamic approaches on a large set of projects.
  In this work, we perform the first extensive study aimed at empirically
evaluating four static TCP techniques comparing them with state-of-research
dynamic TCP techniques at different test-case granularities (e.g., method and
class-level) in terms of effectiveness, efficiency and similarity of faults
detected. This study was performed on 30 real-word Java programs encompassing
431 KLoC. In terms of effectiveness, we find that the static call-graph-based
technique outperforms the other static techniques at test-class level, but the
topic-model-based technique performs better at test-method level. In terms of
efficiency, the static call-graph-based technique is also the most efficient
when compared to other static techniques. When examining the similarity of
faults detected for the four static techniques compared to the four dynamic
ones, we find that on average, the faults uncovered by these two groups of
techniques are quite dissimilar, with the top 10% of test cases agreeing on
only 25% - 30% of detected faults. This prompts further research into the
severity/importance of faults uncovered by these techniques, and into the
potential for combining static and dynamic information for more effective
approaches.
","[{'version': 'v1', 'created': 'Thu, 18 Jan 2018 02:58:11 GMT'}]",2018-01-19,"[['Luo', 'Qi', ''], ['Moran', 'Kevin', ''], ['Poshyvanyk', 'Denys', '']]","['Regression testing', 'test case prioritization', 'static', 'dynamic']"
9768,2301.08632,Romain Deffayet,"Romain Deffayet, Thibaut Thonet, Jean-Michel Renders, Maarten de Rijke",Generative Slate Recommendation with Reinforcement Learning,"WSDM 2023, 9 pages, 3 figures",,10.1145/3539597.3570412,,cs.IR cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Recent research has employed reinforcement learning (RL) algorithms to
optimize long-term user engagement in recommender systems, thereby avoiding
common pitfalls such as user boredom and filter bubbles. They capture the
sequential and interactive nature of recommendations, and thus offer a
principled way to deal with long-term rewards and avoid myopic behaviors.
However, RL approaches are intractable in the slate recommendation scenario -
where a list of items is recommended at each interaction turn - due to the
combinatorial action space. In that setting, an action corresponds to a slate
that may contain any combination of items.
  While previous work has proposed well-chosen decompositions of actions so as
to ensure tractability, these rely on restrictive and sometimes unrealistic
assumptions. Instead, in this work we propose to encode slates in a continuous,
low-dimensional latent space learned by a variational auto-encoder. Then, the
RL agent selects continuous actions in this latent space, which are ultimately
decoded into the corresponding slates. By doing so, we are able to (i) relax
assumptions required by previous work, and (ii) improve the quality of the
action selection by modeling full slates instead of independent items, in
particular by enabling diversity. Our experiments performed on a wide array of
simulated environments confirm the effectiveness of our generative modeling of
slates over baselines in practical scenarios where the restrictive assumptions
underlying the baselines are lifted. Our findings suggest that representation
learning using generative models is a promising direction towards generalizable
RL-based slate recommendation.
","[{'version': 'v1', 'created': 'Fri, 20 Jan 2023 15:28:09 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Jan 2023 10:29:43 GMT'}]",2023-01-25,"[['Deffayet', 'Romain', ''], ['Thonet', 'Thibaut', ''], ['Renders', 'Jean-Michel', ''], ['de Rijke', 'Maarten', '']]","['Slate recommendation', 'Reinforcement learning', 'Variational autoencoder']"
9769,2203.10555,Bianca Trinkenreich,"Bianca Trinkenreich, Ricardo Britto, Marco Aurelio Gerosa, Igor
  Steinmacher","An Empirical Investigation on the Challenges Faced by Women in the
  Software Industry: A Case Study",,,10.1145/3510458.3513018,,cs.SE cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Addressing women's under-representation in the software industry, a widely
recognized concern, requires attracting as well as retaining more women.
Hearing from women practitioners, particularly those positioned in
multi-cultural settings, about their challenges and and adopting their lived
experienced solutions can support the design of programs to resolve the
under-representation issue.
  Goal: We investigated the challenges women face in global software
development teams, particularly what motivates women to leave their company;
how those challenges might break down according to demographics; and strategies
to mitigate the identified challenges.
  Method: To achieve this goal, we conducted an exploratory case study in
Ericsson, a global technology company. We surveyed 94 women and employed
mixed-methods to analyze the data.
  Results: Our findings reveal that women face socio-cultural challenges,
including work-life balance issues, benevolent and hostile sexism, lack of
recognition and peer parity, impostor syndrome, glass ceiling bias effects, the
prove-it-again phenomenon, and the maternal wall. The participants of our
research provided different suggestions to address/mitigate the reported
challenges, including sabbatical policies, flexibility of location and time,
parenthood support, soft skills training for managers, equality of payment and
opportunities between genders, mentoring and role models to support career
growth, directives to hire more women, inclusive groups and events, women's
empowerment, and recognition for women's success. The framework of challenges
and suggestions can inspire further initiatives both in academia and industry
to onboard and retain women.
","[{'version': 'v1', 'created': 'Sun, 20 Mar 2022 13:56:46 GMT'}]",2022-03-22,"[['Trinkenreich', 'Bianca', ''], ['Britto', 'Ricardo', ''], ['Gerosa', 'Marco Aurelio', ''], ['Steinmacher', 'Igor', '']]","['women', 'diversity', 'gender', 'inclusion', 'software engineering']"
9770,1804.01438,Guanshuo Wang,"Guanshuo Wang, Yufeng Yuan, Xiong Chen, Jiwei Li, Xi Zhou","Learning Discriminative Features with Multiple Granularities for Person
  Re-Identification","9 pages, 5 figures. To appear in ACM Multimedia 2018",,10.1145/3240508.3240552,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The combination of global and partial features has been an essential solution
to improve discriminative performances in person re-identification (Re-ID)
tasks. Previous part-based methods mainly focus on locating regions with
specific pre-defined semantics to learn local representations, which increases
learning difficulty but not efficient or robust to scenarios with large
variances. In this paper, we propose an end-to-end feature learning strategy
integrating discriminative information with various granularities. We carefully
design the Multiple Granularity Network (MGN), a multi-branch deep network
architecture consisting of one branch for global feature representations and
two branches for local feature representations. Instead of learning on semantic
regions, we uniformly partition the images into several stripes, and vary the
number of parts in different local branches to obtain local feature
representations with multiple granularities. Comprehensive experiments
implemented on the mainstream evaluation datasets including Market-1501,
DukeMTMC-reid and CUHK03 indicate that our method has robustly achieved
state-of-the-art performances and outperformed any existing approaches by a
large margin. For example, on Market-1501 dataset in single query mode, we
achieve a state-of-the-art result of Rank-1/mAP=96.6%/94.2% after re-ranking.
","[{'version': 'v1', 'created': 'Wed, 4 Apr 2018 14:36:01 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Apr 2018 07:27:07 GMT'}, {'version': 'v3', 'created': 'Tue, 14 Aug 2018 06:43:29 GMT'}]",2018-08-15,"[['Wang', 'Guanshuo', ''], ['Yuan', 'Yufeng', ''], ['Chen', 'Xiong', ''], ['Li', 'Jiwei', ''], ['Zhou', 'Xi', '']]","['Person re-identification', 'Feature learning', 'Multi-branch deep network']"
9771,2103.06909,Himan Abdollahpouri,"Himan Abdollahpouri, Edward Malthouse, Joseph Konstan, Bamshad
  Mobasher, Jeremy Gilbert",Toward the Next Generation of News Recommender Systems,"WWW '21 Companion, April 19-23, 2021, Ljubljana, Slovenia",,10.1145/3442442.3452327,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  This paper proposes a vision and research agenda for the next generation of
news recommender systems (RS), called the table d'hote approach. A table d'hote
(translates as host's table) meal is a sequence of courses that create a
balanced and enjoyable dining experience for a guest. Likewise, we believe news
RS should strive to create a similar experience for the users by satisfying the
news-diet needs of a user. While extant news RS considers criteria such as
diversity and serendipity, and RS bundles have been studied for other contexts
such as tourism, table d'hote goes further by ensuring the recommended articles
satisfy a diverse set of user needs in the right proportions and in a specific
order. In table d'hote, available articles need to be stratified based on the
different ways that news can create value for the reader, building from
theories and empirical research in journalism and user engagement. Using
theories and empirical research from communication on the uses and
gratifications (U&G) consumers derive from media, we define two main strata in
a table d'hote news RS, each with its own substrata: 1) surveillance, which
consists of information the user needs to know, and 2) serendipity, which are
the articles offering unexpected surprises. The diversity of the articles
according to the defined strata and the order of the articles within the list
of recommendations are also two important aspects of the table d'hote in order
to give the users the most effective reading experience. We propose our vision,
link it to the existing concepts in the RS literature, and identify challenges
for future research.
","[{'version': 'v1', 'created': 'Thu, 11 Mar 2021 19:07:06 GMT'}]",2021-03-15,"[['Abdollahpouri', 'Himan', ''], ['Malthouse', 'Edward', ''], ['Konstan', 'Joseph', ''], ['Mobasher', 'Bamshad', ''], ['Gilbert', 'Jeremy', '']]","['News recommender systems', 'serendipity', 'diversity', 'balance']"
9772,2001.10382,Kaitao Zhang,"Kaitao Zhang, Chenyan Xiong, Zhenghao Liu, Zhiyuan Liu",Selective Weak Supervision for Neural Information Retrieval,Accepted by WWW 2020,,10.1145/3366423.3380131,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  This paper democratizes neural information retrieval to scenarios where large
scale relevance training signals are not available. We revisit the classic IR
intuition that anchor-document relations approximate query-document relevance
and propose a reinforcement weak supervision selection method, ReInfoSelect,
which learns to select anchor-document pairs that best weakly supervise the
neural ranker (action), using the ranking performance on a handful of relevance
labels as the reward. Iteratively, for a batch of anchor-document pairs,
ReInfoSelect back propagates the gradients through the neural ranker, gathers
its NDCG reward, and optimizes the data selection network using policy
gradients, until the neural ranker's performance peaks on target relevance
metrics (convergence). In our experiments on three TREC benchmarks, neural
rankers trained by ReInfoSelect, with only publicly available anchor data,
significantly outperform feature-based learning to rank methods and match the
effectiveness of neural rankers trained with private commercial search logs.
Our analyses show that ReInfoSelect effectively selects weak supervision
signals based on the stage of the neural ranker training, and intuitively picks
anchor-document pairs similar to query-document pairs.
","[{'version': 'v1', 'created': 'Tue, 28 Jan 2020 14:47:07 GMT'}]",2020-01-29,"[['Zhang', 'Kaitao', ''], ['Xiong', 'Chenyan', ''], ['Liu', 'Zhenghao', ''], ['Liu', 'Zhiyuan', '']]","['Neural IR', 'Weak Supervision', 'Pre-Training Data Selection']"
9773,1704.01144,Jean Marie Couteyen Carpaye,"Jean Marie Couteyen Carpaye, Jean Roman, Pierre Brenner","Design and Analysis of a Task-based Parallelization over a Runtime
  System of an Explicit Finite-Volume CFD Code with Adaptive Time Stepping",Accepted manuscript of a paper in Journal of Computational Science,,10.1016/j.jocs.2017.03.008,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  FLUSEPA (Registered trademark in France No. 134009261) is an advanced
simulation tool which performs a large panel of aerodynamic studies. It is the
unstructured finite-volume solver developed by Airbus Safran Launchers company
to calculate compressible, multidimensional, unsteady, viscous and reactive
flows around bodies in relative motion. The time integration in FLUSEPA is done
using an explicit temporal adaptive method. The current production version of
the code is based on MPI and OpenMP. This implementation leads to important
synchronizations that must be reduced. To tackle this problem, we present the
study of a task-based parallelization of the aerodynamic solver of FLUSEPA
using the runtime system StarPU and combining up to three levels of
parallelism. We validate our solution by the simulation (using a finite-volume
mesh with 80 million cells) of a take-off blast wave propagation for Ariane 5
launcher.
","[{'version': 'v1', 'created': 'Wed, 29 Mar 2017 14:34:43 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Apr 2017 17:17:04 GMT'}]",2017-04-07,"[['Carpaye', 'Jean Marie Couteyen', ''], ['Roman', 'Jean', ''], ['Brenner', 'Pierre', '']]","['High performance computing', 'Computational fluid dynamics', 'Aerospace industry', 'Task-based parallelism', 'Runtime system']"
9774,1710.08736,Amritanshu Agrawal,"Rahul Krishna, Amritanshu Agrawal, Akond Rahman, Alexander Sobran, Tim
  Menzies","What is the Connection Between Issues, Bugs, and Enhancements? (Lessons
  Learned from 800+ Software Projects)","Accepted to 2018 International Conference on Software Engineering, at
  the software engineering in practice track. 10 pages, 10 figures",,10.1145/3183519.3183548,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Agile teams juggle multiple tasks so professionals are often assigned to
multiple projects, especially in service organizations that monitor and
maintain a large suite of software for a large user base. If we could predict
changes in project conditions changes, then managers could better adjust the
staff allocated to those projects.This paper builds such a predictor using data
from 832 open source and proprietary applications. Using a time series analysis
of the last 4 months of issues, we can forecast how many bug reports and
enhancement requests will be generated next month. The forecasts made in this
way only require a frequency count of this issue reports (and do not require an
historical record of bugs found in the project). That is, this kind of
predictive model is very easy to deploy within a project. We hence strongly
recommend this method for forecasting future issues, enhancements, and bugs in
a project.
","[{'version': 'v1', 'created': 'Tue, 24 Oct 2017 12:32:10 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Sep 2018 02:03:03 GMT'}]",2018-09-07,"[['Krishna', 'Rahul', ''], ['Agrawal', 'Amritanshu', ''], ['Rahman', 'Akond', ''], ['Sobran', 'Alexander', ''], ['Menzies', 'Tim', '']]","['Time series analysis', 'Bugs', 'Collaborations', 'Issues']"
9775,2210.03517,Laurent Najman,"Mariia Zameshina (LIGM, FAIR), Olivier Teytaud (FAIR), Fabien Teytaud
  (ULCO), Vlad Hosu, Nathanael Carraz, Laurent Najman (LIGM), Markus Wagner",Fairness in generative modeling,,"GECCO '22: Genetic and Evolutionary Computation Conference, Jul
  2022, Boston Massachusetts, France. pp.320-323",10.1145/3520304.3528992,,cs.NE cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We design general-purpose algorithms for addressing fairness issues and mode
collapse in generative modeling. More precisely, to design fair algorithms for
as many sensitive variables as possible, including variables we might not be
aware of, we assume no prior knowledge of sensitive variables: our algorithms
use unsupervised fairness only, meaning no information related to the sensitive
variables is used for our fairness-improving methods. All images of faces (even
generated ones) have been removed to mitigate legal risks.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2022 06:53:02 GMT'}]",2022-10-10,"[['Zameshina', 'Mariia', '', 'LIGM, FAIR'], ['Teytaud', 'Olivier', '', 'FAIR'], ['Teytaud', 'Fabien', '', 'ULCO'], ['Hosu', 'Vlad', '', 'LIGM'], ['Carraz', 'Nathanael', '', 'LIGM'], ['Najman', 'Laurent', '', 'LIGM'], ['Wagner', 'Markus', '']]","['Generative modeling', 'neural networks', 'fairness']"
9776,2110.03800,Yassaman Ommi Ms.,"Yassaman Ommi, Matin Yousefabadi, Faezeh Faez, Amirmojtaba Sabour,
  Mahdieh Soleymani Baghshah, Hamid R. Rabiee",CCGG: A Deep Autoregressive Model for Class-Conditional Graph Generation,,,10.1145/3487553.3524721,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph data structures are fundamental for studying connected entities. With
an increase in the number of applications where data is represented as graphs,
the problem of graph generation has recently become a hot topic. However,
despite its significance, conditional graph generation that creates graphs with
desired features is relatively less explored in previous studies. This paper
addresses the problem of class-conditional graph generation that uses class
labels as generation constraints by introducing the Class Conditioned Graph
Generator (CCGG). We built CCGG by injecting the class information as an
additional input into a graph generator model and including a classification
loss in its total loss along with a gradient passing trick. Our experiments
show that CCGG outperforms existing conditional graph generation methods on
various datasets. It also manages to maintain the quality of the generated
graphs in terms of distribution-based evaluation metrics.
","[{'version': 'v1', 'created': 'Thu, 7 Oct 2021 21:24:07 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Apr 2022 09:18:14 GMT'}]",2022-04-26,"[['Ommi', 'Yassaman', ''], ['Yousefabadi', 'Matin', ''], ['Faez', 'Faezeh', ''], ['Sabour', 'Amirmojtaba', ''], ['Baghshah', 'Mahdieh Soleymani', ''], ['Rabiee', 'Hamid R.', '']]","['Generative Models', 'Graph Generation', 'Conditional GenerativeModels']"
9777,2210.05254,Xiaohui Liu,"Xiaohui Liu, Meng Liu, Lin Zhang, Linjuan Zhang, Chang Zeng, Kai Li,
  Nan Li, Kong Aik Lee, Longbiao Wang, Jianwu Dang",Deep Spectro-temporal Artifacts for Detecting Synthesized Speech,"7 pages, 1 figures, Accecpted by Proceedings of the 1st International
  Workshop on Deepfake Detection for Audio Multimedia",,10.1145/3552466.3556527,,cs.SD cs.AI eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Audio Deep Synthesis Detection (ADD) Challenge has been held to detect
generated human-like speech. With our submitted system, this paper provides an
overall assessment of track 1 (Low-quality Fake Audio Detection) and track 2
(Partially Fake Audio Detection). In this paper, spectro-temporal artifacts
were detected using raw temporal signals, spectral features, as well as deep
embedding features. To address track 1, low-quality data augmentation, domain
adaptation via finetuning, and various complementary feature information fusion
were aggregated in our system. Furthermore, we analyzed the clustering
characteristics of subsystems with different features by visualization method
and explained the effectiveness of our proposed greedy fusion strategy. As for
track 2, frame transition and smoothing were detected using self-supervised
learning structure to capture the manipulation of PF attacks in the time
domain. We ranked 4th and 5th in track 1 and track 2, respectively.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2022 08:31:30 GMT'}]",2022-10-12,"[['Liu', 'Xiaohui', ''], ['Liu', 'Meng', ''], ['Zhang', 'Lin', ''], ['Zhang', 'Linjuan', ''], ['Zeng', 'Chang', ''], ['Li', 'Kai', ''], ['Li', 'Nan', ''], ['Lee', 'Kong Aik', ''], ['Wang', 'Longbiao', ''], ['Dang', 'Jianwu', '']]","['Audio Deep Synthesis Detection', 'Spectro-temporal', 'Domain Adaptation', 'Self-Supervised Learning', 'Frame transition', 'Greedy Fusion']"
9778,2107.07300,Angel Luis Scull Pupo,"Angel Luis Scull Pupo (Vrije Universiteit Brussel, Belgium), Jens
  Nicolay (Vrije Universiteit Brussel, Belgium), Elisa Gonzalez Boix (Vrije
  Universiteit Brussel, Belgium)","Deriving Static Security Testing from Runtime Security Protection for
  Web Applications",,"The Art, Science, and Engineering of Programming, 2022, Vol. 6,
  Issue 1, Article 1",10.22152/programming-journal.org/2022/6/1,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Static Application Security Testing (SAST) and Runtime Application
Security Protection (RASP) are important and complementary techniques used for
detecting and enforcing application-level security policies in web
applications.
  Inquiry: The current state of the art, however, does not allow a safe and
efficient combination of SAST and RASP based on a shared set of security
policies, forcing developers to reimplement and maintain the same policies and
their enforcement code in both tools.
  Approach: In this work, we present a novel technique for deriving SAST from
an existing RASP mechanism by using a two-phase abstract interpretation
approach in the SAST component that avoids duplicating the effort of specifying
security policies and implementing their semantics. The RASP mechanism enforces
security policies by instrumenting a base program to trap security-relevant
operations and execute the required policy enforcement code. The static
analysis of security policies is then obtained from the RASP mechanism by first
statically analyzing the base program without any traps. The results of this
first phase are used in a second phase to detect trapped operations and
abstractly execute the associated and unaltered RASP policy enforcement code.
  Knowledge: Splitting the analysis into two phases enables running each phase
with a specific analysis configuration, rendering the static analysis approach
tractable while maintaining sufficient precision.
  Grounding: We validate the applicability of our two-phase analysis approach
by using it to both dynamically enforce and statically detect a range of
security policies found in related work. Our experiments suggest that our
two-phase analysis can enable faster and more precise policy violation
detection compared to analyzing the full instrumented application under a
single analysis configuration.
  Importance: Deriving a SAST component from a RASP mechanism enables
equivalent semantics for the security policies across the static and dynamic
contexts in which policies are verified during the software development
lifecycle. Moreover, our two-phase abstract interpretation approach does not
require RASP developers to reimplement the enforcement code for static
analysis.
","[{'version': 'v1', 'created': 'Thu, 15 Jul 2021 13:05:37 GMT'}]",2021-07-16,"[['Pupo', 'Angel Luis Scull', '', 'Vrije Universiteit Brussel, Belgium'], ['Nicolay', 'Jens', '', 'Vrije Universiteit Brussel, Belgium'], ['Boix', 'Elisa Gonzalez', '', 'Vrije\n  Universiteit Brussel, Belgium']]","['security', 'JavaScript', 'web application', 'runtime monitoring', 'static analysis', 'abstract interpretation']"
9779,2211.11445,Santosh Kumar Upadhyaya,"Santosh Kumar Upadhyaya, Srinivas Vivek","Revisiting a Privacy-Preserving Location-based Service Protocol using
  Edge Computing",,"ARES 2022: Proceedings of the 17th International Conference on
  Availability, Reliability and Security",10.1145/3538969.3544432,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Location-based services are getting more popular day by day. Finding nearby
stores, proximity-based marketing, on-road service assistance, etc., are some
of the services that use location-based services. In location-based services,
user information like user identity, user query, and location must be
protected. Ma et al. (INFOCOM-BigSecurity 2019) proposed a privacy-preserving
location-based service using Somewhat Homomorphic Encryption (SHE). Their
protocol uses edge nodes that compute on SHE encrypted location data and
determines the $k$-nearest points of interest contained in the Location-based
Server (LBS) without revealing the original user coordinates to LBS, hence,
ensuring privacy of users locations. In this work, we show that the above
protocol by Ma et al. has a critical flaw. In particular, we show that their
secure comparison protocol has a correctness issue in that it will not lead to
correct comparison. A major consequence of this flaw is that straightforward
approaches to fix this issue will make their protocol insecure. Namely, the LBS
will be able to recover the actual locations of the users in each and every
query.
","[{'version': 'v1', 'created': 'Mon, 21 Nov 2022 13:33:18 GMT'}]",2022-11-22,"[['Upadhyaya', 'Santosh Kumar', ''], ['Vivek', 'Srinivas', '']]","['Location-based service', 'privacy', 'edge computing', 'somewhat homomorphic encryption', 'cryptanalysis']"
9780,2103.04816,Boel Nelson,Boel Nelson,Efficient Error Prediction for Differentially Private Algorithms,ARES version,,10.1145/3465481.3465746,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Differential privacy is a strong mathematical notion of privacy. Still, a
prominent challenge when using differential privacy in real data collection is
understanding and counteracting the accuracy loss that differential privacy
imposes. As such, the accuracy/privacy trade-off of differential privacy needs
to be balanced on a case-by-case basis. Applications in the literature tend to
focus solely on analytical accuracy bounds, not include data in error
prediction, or use arbitrary settings to measure error empirically.
  To fill the gap in the literature, we propose a novel application of factor
experiments to create data aware error predictions. Basically, factor
experiments provide a systematic approach to conducting empirical experiments.
To demonstrate our methodology in action, we conduct a case study where error
is dependent on arbitrarily complex tree structures. We first construct a tool
to simulate poll data. Next, we use our simulated data to construct a least
squares model to predict error. Last, we show how to validate the model.
Consequently, our contribution is a method for constructing error prediction
models that are data aware.
","[{'version': 'v1', 'created': 'Mon, 8 Mar 2021 15:16:17 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Aug 2021 09:20:29 GMT'}]",2021-08-24,"[['Nelson', 'Boel', '']]","['accuracy prediction', 'data privacy', 'differential privacy', 'empiricalevaluation', 'error prediction', 'factor experiments', 'prediction model']"
9781,2112.02043,Toufique Ahmed Mr.,Toufique Ahmed and Premkumar Devanbu,Multilingual training for Software Engineering,"Accepted at International Conference on Software Engineering
  (ICSE-2022)",,10.1145/3510003.3510049,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Well-trained machine-learning models, which leverage large amounts of
open-source software data, have now become an interesting approach to
automating many software engineering tasks. Several SE tasks have all been
subject to this approach, with performance gradually improving over the past
several years with better models and training methods. More, and more diverse,
clean, labeled data is better for training; but constructing good-quality
datasets is time-consuming and challenging. Ways of augmenting the volume and
diversity of clean, labeled data generally have wide applicability. For some
languages (e.g., Ruby) labeled data is less abundant; in others (e.g.,
JavaScript) the available data maybe more focused on some application domains,
and thus less diverse. As a way around such data bottlenecks, we present
evidence suggesting that human-written code in different languages (which
performs the same function), is rather similar, and particularly preserving of
identifier naming patterns; we further present evidence suggesting that
identifiers are a very important element of training data for software
engineering tasks. We leverage this rather fortuitous phenomenon to find
evidence that available multilingual training data (across different languages)
can be used to amplify performance. We study this for 3 different tasks: code
summarization, code retrieval, and function naming. We note that this
data-augmenting approach is broadly compatible with different tasks, languages,
and machine-learning models.
","[{'version': 'v1', 'created': 'Fri, 3 Dec 2021 17:47:00 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Dec 2021 01:47:57 GMT'}, {'version': 'v3', 'created': 'Wed, 2 Feb 2022 07:31:04 GMT'}, {'version': 'v4', 'created': 'Thu, 3 Feb 2022 04:34:48 GMT'}]",2022-02-04,"[['Ahmed', 'Toufique', ''], ['Devanbu', 'Premkumar', '']]","['code summarization', 'code search', 'method name prediction', 'deeplearning']"
9782,2011.05653,Mauricio Perez,"Mauricio Perez, Jun Liu and Alex C. Kot",Skeleton-based Relational Reasoning for Group Activity Analysis,"26 pages, 5 figures, accepted manuscript in Elsevier Pattern
  Recognition, minor writing revisions and new references",,10.1016/j.patcog.2021.108360,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Research on group activity recognition mostly leans on the standard
two-stream approach (RGB and Optical Flow) as their input features. Few have
explored explicit pose information, with none using it directly to reason about
the persons interactions. In this paper, we leverage the skeleton information
to learn the interactions between the individuals straight from it. With our
proposed method GIRN, multiple relationship types are inferred from independent
modules, that describe the relations between the body joints pair-by-pair.
Additionally to the joints relations, we also experiment with the previously
unexplored relationship between individuals and relevant objects (e.g.
volleyball). The individuals distinct relations are then merged through an
attention mechanism, that gives more importance to those individuals more
relevant for distinguishing the group activity. We evaluate our method in the
Volleyball dataset, obtaining competitive results to the state-of-the-art. Our
experiments demonstrate the potential of skeleton-based approaches for modeling
multi-person interactions.
","[{'version': 'v1', 'created': 'Wed, 11 Nov 2020 09:25:53 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Jul 2021 04:07:58 GMT'}, {'version': 'v3', 'created': 'Fri, 8 Oct 2021 02:05:35 GMT'}]",2021-10-11,"[['Perez', 'Mauricio', ''], ['Liu', 'Jun', ''], ['Kot', 'Alex C.', '']]","['Group Activity Recognition', 'Skeleton Information', 'RelationalNetwork', 'Attention Mechanisms']"
9783,2106.14058,"Michael M\""uhlhauser","Michael M\""uhlhauser, Henning Prid\""ohl, Dominik Herrmann","How Private is Android's Private DNS Setting? Identifying Apps by
  Encrypted DNS Traffic","Accepted at The 16th International Conference on Availability,
  Reliability and Security (ARES 2021)",,10.1145/3465481.3465764,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  DNS over TLS (DoT) and DNS over HTTPS (DoH) promise to improve privacy and
security of DNS by encrypting DNS messages, especially when messages are padded
to a uniform size. Firstly, to demonstrate the limitations of recommended
padding approaches, we present Segram, a novel app fingerprinting attack that
allows adversaries to infer which mobile apps are executed on a device.
Secondly, we record traffic traces of 118 Android apps using 10 different
DoT/DoH resolvers to study the effectiveness of Segram under different
conditions. According to our results, Segram identifies apps with accuracies of
up to 72% with padding in a controlled closed world setting. The effectiveness
of Segram is comparable with state-of-the-art techniques but Segram requires
less computational effort. We release our datasets and code. Thirdly, we study
the prevalence of padding among privacy-focused DoT/DoH resolvers, finding that
up to 81% of our sample fail to enable padding. Our results suggest that
recommended padding approaches are less effective than expected and that
resolver operators are not sufficiently aware about this feature.
","[{'version': 'v1', 'created': 'Sat, 26 Jun 2021 16:34:26 GMT'}]",2021-06-29,"[['Mühlhauser', 'Michael', ''], ['Pridöhl', 'Henning', ''], ['Herrmann', 'Dominik', '']]","['DNS over TLS', 'DNS over HTTPS', 'Traffic Analysis', 'Privacy', 'Fingerprinting', 'Benchmarking']"
9784,2301.00096,Fransiscus,Fransiscus and A. S. Girsang,"Sentiment Analysis of COVID-19 Public Activity Restriction (PPKM) Impact
  using BERT Method","8 pages, 8 figures, original article refer to
  https://ijettjournal.org/archive/ijett-v70i12p226","International Journal of Engineering Trends and Technology,
  vol.70, no. 12, pp. 281-288, 2022",10.14445/22315381/IJETT-V70I12P226,,cs.IR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Covid-19 has grown rapidly in all parts of the world and is considered an
international disaster because of its wide-reaching impact. The impact of
Covid-19 has spread to Indonesia, especially in the slowdown in economic
growth. This was influenced by the implementation of Community Activity
Restrictions (PPKM) which limited community economic activities. This study
aims to analyze the mapping of public sentiment towards PPKM policies in
Indonesia during the pandemic based on Twitter data. Knowing the mapping of
public sentiment regarding PPKM is expected to help stakeholders in the policy
evaluation process for each region. The method used is BERT with IndoBERT
specific model. The results showed the evaluation value of IndoBERT f-1 score
reached 84%, precision 86%, and recall 84%. Meanwhile for the evaluation of the
use of SVM f-1 score 70%, 72% precision, and 70% recall. Multinominal Na\""ive
Bayes evaluation shows f-1 score 83%, precision 78%, and recall 80%. As a
conclusion, BERT method with the IndoBERT model is proven to be higher than
classical methods such as SVM and Multinominal Na\""ive Bayes.
","[{'version': 'v1', 'created': 'Sat, 31 Dec 2022 02:17:38 GMT'}]",2023-01-03,"[['Fransiscus', '', ''], ['Girsang', 'A. S.', '']]","['Sentiment Analysis', 'PPKM', 'BERT', 'SVM', 'Naïve Bayes']"
9785,1910.01485,Paul Muntean,"Paul Muntean, Matthias Neumayer, Zhiqiang Lin, Gang Tan, Jens
  Grossklags, and Claudia Eckert",Analyzing Control Flow Integrity with LLVM-CFI,"Accepted for publication at ACSAC'19 conference. arXiv admin note:
  substantial text overlap with arXiv:1812.08496",,10.1145/3359789.3359806,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Control-flow hijacking attacks are used to perform malicious com-putations.
Current solutions for assessing the attack surface afteracontrol flow
integrity(CFI) policy was applied can measure onlyindirect transfer averages in
the best case without providing anyinsights w.r.t. the absolute calltarget
reduction per callsite, and gad-get availability. Further, tool comparison is
underdeveloped or notpossible at all. CFI has proven to be one of the most
promising pro-tections against control flow hijacking attacks, thus many
effortshave been made to improve CFI in various ways. However, there isa lack
of systematic assessment of existing CFI protections. In this paper, we
presentLLVM-CFI, a static source code analy-sis framework for analyzing
state-of-the-art static CFI protectionsbased on the Clang/LLVM compiler
framework.LLVM-CFIworksby precisely modeling a CFI policy and then evaluating
it within aunified approach.LLVM-CFIhelps determine the level of
securityoffered by different CFI protections, after the CFI protections
weredeployed, thus providing an important step towards exploit
cre-ation/prevention and stronger defenses. We have usedLLVM-CFIto assess eight
state-of-the-art static CFI defenses on real-worldprograms such as Google
Chrome and Apache Httpd.LLVM-CFIprovides a precise analysis of the residual
attack surfaces, andaccordingly ranks CFI policies against each
other.LLVM-CFIalsosuccessfully paves the way towards construction of COOP-like
codereuse attacks and elimination of the remaining attack surface bydisclosing
protected calltargets under eight restrictive CFI policies.
","[{'version': 'v1', 'created': 'Wed, 2 Oct 2019 09:44:47 GMT'}]",2019-10-04,"[['Muntean', 'Paul', ''], ['Neumayer', 'Matthias', ''], ['Lin', 'Zhiqiang', ''], ['Tan', 'Gang', ''], ['Grossklags', 'Jens', ''], ['Eckert', 'Claudia', '']]","['Clang', 'LLVM', 'control flow integrity', 'computer systems', 'defense']"
9786,2012.01982,Wuming Pan,Wuming Pan,Tensor Data Scattering and the Impossibility of Slicing Theorem,,"K. Arai (Ed.): IntelliSys 2021, LNNS 294, 280-290, 2022. Springer",10.1007/978-3-030-82193-7_18,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a standard way to represent sparse tensors. A broad
theoretical framework for tensor data scattering methods used in various deep
learning frameworks is established. This paper presents a theorem that is very
important for performance analysis and accelerator optimization for
implementing data scattering. The theorem shows how the impossibility of
slicing happens in tenser data scattering. A sparsity measuring formula is
provided, which can effectively indicate the storage efficiency of sparse
tensor and the possibility of parallelly using it. The source code, including
CUDA code, is provided in a related open-source project.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2020 03:27:30 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Sep 2021 14:55:16 GMT'}]",2021-09-06,"[['Pan', 'Wuming', '']]","['tensor', 'pick', 'x-sparse tensor', 'sparsity']"
9787,1912.08785,Piotr S. Maci\k{a}g,"Piotr S. Maci\k{a}g (1), Marzena Kryszkiewicz (1), Robert Bembenik
  (1), Jesus L. Lobo (2), Javier Del Ser (2 and 3) ((1) Institute of Computer
  Science, Warsaw University of Technology, Warsaw, Poland, (2) TECNALIA Parque
  Tecnol\'ogico de Bizkaia, Derio, Spain, (3) University of the Basque Country
  UPV/EHU, Bilbao, Spain)","Unsupervised Anomaly Detection in Stream Data with Online Evolving
  Spiking Neural Networks",52 pages,"Neural Networks, Volume 139, 2021, Pages 118-139",10.1016/j.neunet.2021.02.017,,cs.NE cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Unsupervised anomaly discovery in stream data is a research topic with many
practical applications. However, in many cases, it is not easy to collect
enough training data with labeled anomalies for supervised learning of an
anomaly detector in order to deploy it later for identification of real
anomalies in streaming data. It is thus important to design anomalies detectors
that can correctly detect anomalies without access to labeled training data.
Our idea is to adapt the Online evolving Spiking Neural Network (OeSNN)
classifier to the anomaly detection task. As a result, we offer an Online
evolving Spiking Neural Network for Unsupervised Anomaly Detection algorithm
(OeSNN-UAD), which, unlike OeSNN, works in an unsupervised way and does not
separate output neurons into disjoint decision classes. OeSNN-UAD uses our
proposed new two-step anomaly detection method. Also, we derive new theoretical
properties of neuronal model and input layer encoding of OeSNN, which enable
more effective and efficient detection of anomalies in our OeSNN-UAD approach.
The proposed OeSNN-UAD detector was experimentally compared with
state-of-the-art unsupervised and semi-supervised detectors of anomalies in
stream data from the Numenta Anomaly Benchmark and Yahoo Anomaly Datasets
repositories. Our approach outperforms the other solutions provided in the
literature in the case of data streams from the Numenta Anomaly Benchmark
repository. Also, in the case of real data files of the Yahoo Anomaly Benchmark
repository, OeSNN-UAD outperforms other selected algorithms, whereas in the
case of Yahoo Anomaly Benchmark synthetic data files, it provides competitive
results to the results recently reported in the literature.
","[{'version': 'v1', 'created': 'Wed, 18 Dec 2019 18:36:01 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Mar 2021 20:17:42 GMT'}]",2021-03-10,"[['Maciąg', 'Piotr S.', '', '2 and 3'], ['Kryszkiewicz', 'Marzena', '', '2 and 3'], ['Bembenik', 'Robert', '', '2 and 3'], ['Lobo', 'Jesus L.', '', '2 and 3'], ['Del Ser', 'Javier', '', '2 and 3']]","['Evolving Spiking Neural Networks', 'Anomaly detection', 'Outliersdetection', 'Online learning', 'Time series data', 'Unsupervised anomaly detection', 'Stream data']"
9788,1905.13076,Iryna Kulchytska-Ruchka,"Iryna Kulchytska-Ruchka, Herbert De Gersem, and Sebastian Sch\""ops","An efficient steady-state analysis of the eddy current problem using a
  parallel-in-time algorithm",,"The Tenth International Conference on Computational
  Electromagnetics (CEM 2019), Edinburgh, UK",10.1049/cp.2019.0113,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a parallel-in-time algorithm for efficient steady-state
solution of the eddy current problem. Its main idea is based on the application
of the well-known multi-harmonic (or harmonic balance) approach as the coarse
solver within the periodic parallel-in-time framework. A frequency domain
representation allows for the separate calculation of each harmonic component
in parallel and therefore accelerates the solution of the time-periodic system.
The presented approach is verified for a nonlinear coaxial cable model.
","[{'version': 'v1', 'created': 'Thu, 30 May 2019 14:37:33 GMT'}]",2019-11-07,"[['Kulchytska-Ruchka', 'Iryna', ''], ['De Gersem', 'Herbert', ''], ['Schöps', 'Sebastian', '']]","['Steady state', 'eddy currents', 'parallel-in-time algorithms', 'harmonic balance method', 'fast Fourier transform']"
9789,2212.10459,Hao Wang,Hao Wang,Pareto Pairwise Ranking for Fairness Enhancement of Recommender Systems,,,10.1117/12.2656668,,cs.IR cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Learning to rank is an effective recommendation approach since its
introduction around 2010. Famous algorithms such as Bayesian Personalized
Ranking and Collaborative Less is More Filtering have left deep impact in both
academia and industry. However, most learning to rank approaches focus on
improving technical accuracy metrics such as AUC, MRR and NDCG. Other
evaluation metrics of recommender systems like fairness have been largely
overlooked until in recent years. In this paper, we propose a new learning to
rank algorithm named Pareto Pairwise Ranking. We are inspired by the idea of
Bayesian Personalized Ranking and power law distribution. We show that our
algorithm is competitive with other algorithms when evaluated on technical
accuracy metrics. What is more important, in our experiment section we
demonstrate that Pareto Pairwise Ranking is the most fair algorithm in
comparison with 9 other contemporary algorithms.
","[{'version': 'v1', 'created': 'Tue, 6 Dec 2022 03:46:31 GMT'}]",2022-12-21,"[['Wang', 'Hao', '']]","['Pareto Pairwise Ranking', 'learning to rank', 'fairness', 'power law distribution', 'Bayesian Personalized Ranking']"
9790,1806.04761,Ciprian-Octavian Truica,"Ciprian-Octavian Truic\u{a} and Florin R\u{a}dulescu and Alexandru
  Boicea and Ion Bucur","Performance evaluation for CRUD operations in asynchronously replicated
  document oriented database",,,10.1109/CSCS.2015.32,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  NoSQL databases are becoming increasingly popular as more developers seek new
ways for storing information. The popularity of these databases has risen due
to their flexibility and scalability needed in domains like Big Data and Cloud
Computing. This paper examines asynchronous replication, one of the key
features for a scalable and flexible system. Three of the most popular
Document-Oriented Databases, MongoDB, CouchDB, and Couchbase, are examined. For
testing, the execution time for CRUD operations for a single database instance
and for a distributed environment with two nodes is taken into account and the
results are compared with tests outcomes obtained for three relational database
management systems: Microsoft SQL Server, MySQL, and PostgreSQL.
","[{'version': 'v1', 'created': 'Tue, 12 Jun 2018 20:38:56 GMT'}]",2018-06-14,"[['Truică', 'Ciprian-Octavian', ''], ['Rădulescu', 'Florin', ''], ['Boicea', 'Alexandru', ''], ['Bucur', 'Ion', '']]","['Asynchronousreplication', 'CRUDoperations', 'NoSQL', 'execution time', 'MongoDB', 'CouchDB', 'Couchbase']"
9791,2203.04394,Gunnar Kudrjavets,"Gunnar Kudrjavets (University of Groningen), Jeff Thomas (Meta
  Platforms, Inc.), Aditya Kumar (Snap, Inc.), Nachiappan Nagappan (Meta
  Platforms, Inc.), Ayushi Rastogi (University of Groningen)","Quantifying Daily Evolution of Mobile Software Based on Memory Allocator
  Churn","5 pages. To be published in Proceedings of The 9th International
  Conference on Mobile Software Engineering and Systems (MobileSoft '22). ACM,
  New York, NY, USA",,10.1145/3524613.3527803,,cs.SE cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The pace and volume of code churn necessary to evolve modern software systems
present challenges for analyzing the performance impact of any set of code
changes. Traditional methods used in performance analysis rely on extensive
data collection and profiling, which often takes days. For large organizations
utilizing Continuous Integration (CI) and Continuous Deployment (CD), these
traditional techniques often fail to provide timely and actionable data. A
different impact analysis method that allows for more efficient detection of
performance regressions is needed. We propose the utilization of user mode
memory allocator churn as a novel approach to performance engineering. User
mode allocator churn acts as a proxy metric to evaluate the relative change in
the cost of specific tasks. We prototyped the memory allocation churn
methodology while engaged in performance engineering for a major iOS
application. We find that calculating and analyzing memory allocator churn (a)
results in deterministic measurements, (b) is efficient for determining the
presence of both individual performance regressions and general
performance-related trends, and (c) is a suitable alternative to measuring the
task completion time.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2022 21:16:22 GMT'}, {'version': 'v2', 'created': 'Fri, 6 May 2022 04:51:24 GMT'}]",2022-05-09,"[['Kudrjavets', 'Gunnar', '', 'University of Groningen'], ['Thomas', 'Jeff', '', 'Meta\n  Platforms, Inc.'], ['Kumar', 'Aditya', '', 'Snap, Inc.'], ['Nagappan', 'Nachiappan', '', 'Meta\n  Platforms, Inc.'], ['Rastogi', 'Ayushi', '', 'University of Groningen']]","['Software evolution', 'memory', 'mobile applications', 'performance']"
9792,2006.12630,Zhichao Fang,"Zhichao Fang, Rodrigo Costas, Wencan Tian, Xianwen Wang, Paul Wouters","An extensive analysis of the presence of altmetric data for Web of
  Science publications across subject fields and research topics",,"Scientometrics, 2020",10.1007/s11192-020-03564-9,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sufficient data presence is one of the key preconditions for applying metrics
in practice. Based on both Altmetric.com data and Mendeley data collected up to
2019, this paper presents a state-of-the-art analysis of the presence of 12
kinds of altmetric events for nearly 12.3 million Web of Science publications
published between 2012 and 2018. Results show that even though an upward trend
of data presence can be observed over time, except for Mendeley readers and
Twitter mentions, the overall presence of most altmetric data is still low. The
majority of altmetric events go to publications in the fields of Biomedical and
Health Sciences, Social Sciences and Humanities, and Life and Earth Sciences.
As to research topics, the level of attention received by research topics
varies across altmetric data, and specific altmetric data show different
preferences for research topics, on the basis of which a framework for
identifying hot research topics is proposed and applied to detect research
topics with higher levels of attention garnered on certain altmetric data
source. Twitter mentions and policy document citations were selected as two
examples to identify hot research topics of interest of Twitter users and
policy-makers, respectively, shedding light on the potential of altmetric data
in monitoring research trends of specific social attention.
","[{'version': 'v1', 'created': 'Mon, 22 Jun 2020 21:33:35 GMT'}]",2020-06-24,"[['Fang', 'Zhichao', ''], ['Costas', 'Rodrigo', ''], ['Tian', 'Wencan', ''], ['Wang', 'Xianwen', ''], ['Wouters', 'Paul', '']]","['Altmetrics', 'social media metrics', 'data coverage', 'data intensity', 'hot topics', 'social attention']"
9793,2109.13049,Lorenzo Valerio,"Lorenzo Valerio, Andrea Passarella, Marco Conti","A communication efficient distributed learning framework for smart
  environments",,"Elsevier Pervasive and Mobile Computing, Volume 41, October 2017,
  Pages 46-68",10.1016/j.pmcj.2017.07.014,,cs.DC cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Due to the pervasive diffusion of personal mobile and IoT devices, many
``smart environments'' (e.g., smart cities and smart factories) will be, among
others, generators of huge amounts of data. Currently, this is typically
achieved through centralised cloud-based data analytics services. However,
according to many studies, this approach may present significant issues from
the standpoint of data ownership, and even wireless network capacity. One
possibility to cope with these shortcomings is to move data analytics closer to
where data is generated. In this paper, we tackle this issue by proposing and
analyzing a distributed learning framework, whereby data analytics are
performed at the edge of the network, i.e., on locations very close to where
data is generated. Specifically, in our framework, partial data analytics are
performed directly on the nodes that generate the data, or on nodes close by
(e.g., some of the data generators can take this role on behalf of subsets of
other nodes nearby). Then, nodes exchange partial models and refine them
accordingly. Our framework is general enough to host different analytics
services. In the specific case analysed in the paper, we focus on a learning
task, considering two distributed learning algorithms. Using an activity
recognition and a pattern recognition task, both on reference datasets, we
compare the two learning algorithms between each other and with a central cloud
solution (i.e., one that has access to the complete datasets). Our results show
that using distributed machine learning techniques, it is possible to
drastically reduce the network overhead, while obtaining performance comparable
to the cloud solution in terms of learning accuracy. The analysis also shows
when each distributed learning approach is preferable, based on the specific
distribution of the data on the nodes.
","[{'version': 'v1', 'created': 'Mon, 27 Sep 2021 13:44:34 GMT'}]",2021-09-28,"[['Valerio', 'Lorenzo', ''], ['Passarella', 'Andrea', ''], ['Conti', 'Marco', '']]","['Iot', 'big data', 'smart cities', 'distributed learning', 'communications efficiency']"
9794,2008.06893,Zhangxuan Gu,"Zhangxuan Gu, and Siyuan Zhou, and Li Niu, and Zihan Zhao, and Liqing
  Zhang",Context-aware Feature Generation for Zero-shot Semantic Segmentation,Accepted by ACM MM 2020,,10.1145/3394171.3413593,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing semantic segmentation models heavily rely on dense pixel-wise
annotations. To reduce the annotation pressure, we focus on a challenging task
named zero-shot semantic segmentation, which aims to segment unseen objects
with zero annotations. This task can be accomplished by transferring knowledge
across categories via semantic word embeddings. In this paper, we propose a
novel context-aware feature generation method for zero-shot segmentation named
CaGNet. In particular, with the observation that a pixel-wise feature highly
depends on its contextual information, we insert a contextual module in a
segmentation network to capture the pixel-wise contextual information, which
guides the process of generating more diverse and context-aware features from
semantic word embeddings. Our method achieves state-of-the-art results on three
benchmark datasets for zero-shot segmentation. Codes are available at:
https://github.com/bcmi/CaGNet-Zero-Shot-Semantic-Segmentation.
","[{'version': 'v1', 'created': 'Sun, 16 Aug 2020 12:20:49 GMT'}]",2020-08-18,"[['Gu', 'Zhangxuan', ''], ['Zhou', 'Siyuan', ''], ['Niu', 'Li', ''], ['Zhao', 'Zihan', ''], ['Zhang', 'Liqing', '']]","['zero-shot semantic segmentation', 'contextual information', 'featuregeneration']"
9795,2203.16854,Xiaofei Xu,"Xiaofei Xu, Ke Deng, Xiuzhen Zhang","Identifying Cost-effective Debunkers for Multi-stage Fake News
  Mitigation Campaigns",,,10.1145/3488560.3498457,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online social networks have become a fertile ground for spreading fake news.
Methods to automatically mitigate fake news propagation have been proposed.
Some studies focus on selecting top k influential users on social networks as
debunkers, but the social influence of debunkers may not translate to wide
mitigation information propagation as expected. Other studies assume a given
set of debunkers and focus on optimizing intensity for debunkers to publish
true news, but as debunkers are fixed, even if with high social influence
and/or high intensity to post true news, the true news may not reach users
exposed to fake news and therefore mitigation effect may be limited. In this
paper, we propose the multi-stage fake news mitigation campaign where debunkers
are dynamically selected within budget at each stage. We formulate it as a
reinforcement learning problem and propose a greedy algorithm optimized by
predicting future states so that the debunkers can be selected in a way that
maximizes the overall mitigation effect. We conducted extensive experiments on
synthetic and real-world social networks and show that our solution outperforms
state-of-the-art baselines in terms of mitigation effect.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2022 07:29:18 GMT'}]",2022-04-01,"[['Xu', 'Xiaofei', ''], ['Deng', 'Ke', ''], ['Zhang', 'Xiuzhen', '']]","['Fake News Mitigation', 'Social Network', 'Reinforcement Learning', 'Multivariate Hawkes Process']"
9796,1910.02551,Ilia Sucholutsky,"Ilia Sucholutsky, Matthias Schonlau",Soft-Label Dataset Distillation and Text Dataset Distillation,,,10.1109/IJCNN52387.2021.9533769,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dataset distillation is a method for reducing dataset sizes by learning a
small number of synthetic samples containing all the information of a large
dataset. This has several benefits like speeding up model training, reducing
energy consumption, and reducing required storage space. Currently, each
synthetic sample is assigned a single `hard' label, and also, dataset
distillation can currently only be used with image data.
  We propose to simultaneously distill both images and their labels, thus
assigning each synthetic sample a `soft' label (a distribution of labels). Our
algorithm increases accuracy by 2-4% over the original algorithm for several
image classification tasks. Using `soft' labels also enables distilled datasets
to consist of fewer samples than there are classes as each sample can encode
information for multiple classes. For example, training a LeNet model with 10
distilled images (one per class) results in over 96% accuracy on MNIST, and
almost 92% accuracy when trained on just 5 distilled images.
  We also extend the dataset distillation algorithm to distill sequential
datasets including texts. We demonstrate that text distillation outperforms
other methods across multiple datasets. For example, models attain almost their
original accuracy on the IMDB sentiment analysis task using just 20 distilled
sentences.
  Our code can be found at
$\href{https://github.com/ilia10000/dataset-distillation}{\text{https://github.com/ilia10000/dataset-distillation}}$.
","[{'version': 'v1', 'created': 'Sun, 6 Oct 2019 23:57:22 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Nov 2019 21:01:12 GMT'}, {'version': 'v3', 'created': 'Tue, 5 May 2020 04:09:03 GMT'}]",2022-06-10,"[['Sucholutsky', 'Ilia', ''], ['Schonlau', 'Matthias', '']]","['Dataset Distillation', 'Knowledge Distillation', 'Neural Networks', 'SyntheticData', 'Gradient Descent']"
9797,1704.02789,Mahardhika Pratama Dr,"Mahardhika Pratama, Plamen P. Angelov, Edwin Lughofer",Parsimonious Random Vector Functional Link Network for Data Streams,this paper is submitted for publication in Information Sciences,,10.1016/j.ins.2017.11.050,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The theory of random vector functional link network (RVFLN) has provided a
breakthrough in the design of neural networks (NNs) since it conveys solid
theoretical justification of randomized learning. Existing works in RVFLN are
hardly scalable for data stream analytics because they are inherent to the
issue of complexity as a result of the absence of structural learning
scenarios. A novel class of RVLFN, namely parsimonious random vector functional
link network (pRVFLN), is proposed in this paper. pRVFLN features an open
structure paradigm where its network structure can be built from scratch and
can be automatically generated in accordance with degree of nonlinearity and
time-varying property of system being modelled. pRVFLN is equipped with
complexity reduction scenarios where inconsequential hidden nodes can be pruned
and input features can be dynamically selected. pRVFLN puts into perspective an
online active learning mechanism which expedites the training process and
relieves operator labelling efforts. In addition, pRVFLN introduces a
non-parametric type of hidden node, developed using an interval-valued data
cloud. The hidden node completely reflects the real data distribution and is
not constrained by a specific shape of the cluster. All learning procedures of
pRVFLN follow a strictly single-pass learning mode, which is applicable for an
online real-time deployment. The efficacy of pRVFLN was rigorously validated
through numerous simulations and comparisons with state-of-the art algorithms
where it produced the most encouraging numerical results. Furthermore, the
robustness of pRVFLN was investigated and a new conclusion is made to the scope
of random parameters where it plays vital role to the success of randomized
learning.
","[{'version': 'v1', 'created': 'Mon, 10 Apr 2017 10:24:34 GMT'}, {'version': 'v2', 'created': 'Sat, 6 May 2017 11:59:53 GMT'}]",2018-02-06,"[['Pratama', 'Mahardhika', ''], ['Angelov', 'Plamen P.', ''], ['Lughofer', 'Edwin', '']]","['Random Vector Functional Link', 'Evolving Intelligent System', 'Online Learning', 'Randomized']"
9798,2207.01409,"Jil Kl\""under","Jil Kl\""under and Oliver Karras","Meetings and Mood -- Related or Not? Insights from Student Software
  Projects","This is the authors' version. The final version was published in ACM
  / IEEE International Symposium on Empirical Software Engineering and
  Measurement (ESEM) (ESEM '22)",,10.1145/3544902.3546252,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Background: Teamwork, coordination, and communication are a prerequisite for
the timely completion of a software project. Meetings as a facilitator for
coordination and communication are an established medium for information
exchange. Analyses of meetings in software projects have shown that certain
interactions in these meetings, such as proactive statements followed by
supportive ones, influence the mood and motivation of a team, which in turn
affects its productivity. So far, however, research has focused only on certain
interactions at a detailed level, requiring a complex and fine-grained analysis
of a meeting itself.
  Aim: In this paper, we investigate meetings from a more abstract perspective,
focusing on the polarity of the statements, i.e., whether they appear to be
positive, negative, or neutral.
  Method: We analyze the relationship between the polarity of statements in
meetings and different social aspects, including conflicts as well as the mood
before and after a meeting.
  Results: Our results emerge from 21 student software project meetings and
show some interesting insights: (1) Positive mood before a meeting is both
related to the amount of positive statements in the beginning, as well as
throughout the whole meeting, (2) negative mood before the meeting only
influences the amount of negative statements in the first quarter of the
meeting, but not the whole meeting, and (3) the amount of positive and negative
statements during the meeting has no influence on the mood afterwards.
  Conclusions: We conclude that the behaviour in meetings might rather
influence short-term emotional states (feelings) than long-term emotional
states (mood), which are more important for the project.
","[{'version': 'v1', 'created': 'Mon, 4 Jul 2022 13:43:40 GMT'}]",2022-07-05,"[['Klünder', 'Jil', ''], ['Karras', 'Oliver', '']]","['Software development teams', 'sentiment analysis', 'meeting', 'mood']"
9799,2110.09520,Ahmad Nagm Nagm,"Ahmed M. Nagm, Mohamed Torky, Mohammed Mahmoud Abo Ghazala, and Hosam
  Eldin Fawzan Sayed","Image Protection against Forgery and Pixel Tampering based on a Triple
  Hybrid Security Approach","10 pages, 5 figures, 4 tables, (AISC, Vol. 1058), The 5th
  International Conference on Advanced Intelligent Systems and Informatics
  2019, AISI2019. Advances in Intelligent Systems and Computing, Vol. 1058.
  Springer, Cham. p.p 588-597, ISSN 2194-5357, ISSN 2194-5365 (electronic) and
  Scopus. Online ISBN: 978-3-030-311292, https://www.springer.com/series/11156",,10.1007/978-3-030-31129-2_54,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Due to the widespread of advanced digital imaging devices, forgery of digital
images became more serious attack patterns. In this attack scenario, the
attacker tries to manipulate the digital image to conceal some meaningful
information of the genuine image for malicious purposes. This leads to increase
security interest about protecting images against integrity tampers. This paper
proposes a novel technique for protecting colored images against forgery and
pixel tamper. The proposed approach is designed as a hybrid model from three
security techniques, Message Digest hashing algorithm (MD5), Advanced
Encryption Standard-128 bits (AES), and Stenography. The proposed approach has
been evaluated using set of image quality metrics for testing the impact of
embedding the protection code on image quality. The evaluation results proved
that protecting image based on Least Significant Bit (LSB) is the best
technique that keep image quality compared with other two bit-substitution
methods. Moreover, the results proved the superiority of the proposed approach
compared with other technique in the literature.
","[{'version': 'v1', 'created': 'Sun, 17 Oct 2021 14:56:16 GMT'}]",2021-10-20,"[['Nagm', 'Ahmed M.', ''], ['Torky', 'Mohamed', ''], ['Ghazala', 'Mohammed Mahmoud Abo', ''], ['Sayed', 'Hosam Eldin Fawzan', '']]","['Image Forgery Detection', 'Cyber Crime', 'MD5 Hashing', 'Cryptography', 'AES', 'Steganography']"
9800,1907.02549,Hlynur Dav\'i{\dh} Hlynsson,"Hlynur Dav\'i{\dh} Hlynsson, Alberto N. Escalante-B., Laurenz Wiskott",Measuring the Data Efficiency of Deep Learning Methods,8 pages,"In Proceedings of the 8th International Conference on Pattern
  Recognition Applications and Methods - Volume 1: ICPRAM (2019) pages 691-698",10.5220/0007456306910698,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a new experimental protocol and use it to benchmark
the data efficiency --- performance as a function of training set size --- of
two deep learning algorithms, convolutional neural networks (CNNs) and
hierarchical information-preserving graph-based slow feature analysis (HiGSFA),
for tasks in classification and transfer learning scenarios. The algorithms are
trained on different-sized subsets of the MNIST and Omniglot data sets. HiGSFA
outperforms standard CNN networks when the models are trained on 50 and 200
samples per class for MNIST classification. In other cases, the CNNs perform
better. The results suggest that there are cases where greedy, locally optimal
bottom-up learning is equally or more powerful than global gradient-based
learning.
","[{'version': 'v1', 'created': 'Wed, 3 Jul 2019 15:22:23 GMT'}]",2019-07-08,"[['Hlynsson', 'Hlynur Davíð', ''], ['Escalante-B.', 'Alberto N.', ''], ['Wiskott', 'Laurenz', '']]","['Data Efficiency', 'Deep Learning', 'Neural Networks', 'Slow Feature Analysis', 'Transfer Learning']"
9801,2109.01002,Danning Xie,"Danning Xie, Yitong Li, Mijung Kim, Hung Viet Pham, Lin Tan, Xiangyu
  Zhang, Michael W. Godfrey","DocTer: Documentation Guided Fuzzing for Testing Deep Learning API
  Functions",,,10.1145/3533767.3534220,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Input constraints are useful for many software development tasks. For
example, input constraints of a function enable the generation of valid inputs,
i.e., inputs that follow these constraints, to test the function deeper. API
functions of deep learning (DL) libraries have DL specific input constraints,
which are described informally in the free form API documentation. Existing
constraint extraction techniques are ineffective for extracting DL specific
input constraints.
  To fill this gap, we design and implement a new technique, DocTer, to analyze
API documentation to extract DL specific input constraints for DL API
functions. DocTer features a novel algorithm that automatically constructs
rules to extract API parameter constraints from syntactic patterns in the form
of dependency parse trees of API descriptions. These rules are then applied to
a large volume of API documents in popular DL libraries to extract their input
parameter constraints. To demonstrate the effectiveness of the extracted
constraints, DocTer uses the constraints to enable the automatic generation of
valid and invalid inputs to test DL API functions.
  Our evaluation on three popular DL libraries (TensorFlow, PyTorch, and MXNet)
shows that the precision of DocTer in extracting input constraints is 85.4%.
DocTer detects 94 bugs from 174 API functions, including one previously unknown
security vulnerability that is now documented in the CVE database, while a
baseline technique without input constraints detects only 59 bugs. Most (63) of
the 94 bugs are previously unknown, 54 of which have been fixed or confirmed by
developers after we report them. In addition, DocTer detects 43 inconsistencies
in documents, 39 of which are fixed or confirmed.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2021 14:57:36 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Jun 2022 20:57:49 GMT'}]",2022-06-22,"[['Xie', 'Danning', ''], ['Li', 'Yitong', ''], ['Kim', 'Mijung', ''], ['Pham', 'Hung Viet', ''], ['Tan', 'Lin', ''], ['Zhang', 'Xiangyu', ''], ['Godfrey', 'Michael W.', '']]","['text analytics', 'testing', 'test generation', 'deep learning']"
9802,2201.01277,Soumendu Chakraborty,"Soumendu Chakraborty, Anand Singh Jalal and Charul Bhatnagar",LSB Based Non Blind Predictive Edge Adaptive Image Steganography,,,10.1007/s11042-016-3449-4,,cs.MM,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Image steganography is the art of hiding secret message in grayscale or color
images. Easy detection of secret message for any state-of-art image
steganography can break the stego system. To prevent the breakdown of the stego
system data is embedded in the selected area of an image which reduces the
probability of detection. Most of the existing adaptive image steganography
techniques achieve low embedding capacity. In this paper a high capacity
Predictive Edge Adaptive image steganography technique is proposed where
selective area of cover image is predicted using Modified Median Edge Detector
(MMED) predictor to embed the binary payload (data). The cover image used to
embed the payload is a grayscale image. Experimental results show that the
proposed scheme achieves better embedding capacity with minimum level of
distortion and higher level of security. The proposed scheme is compared with
the existing image steganography schemes. Results show that the proposed scheme
achieves better embedding rate with lower level of distortion.
","[{'version': 'v1', 'created': 'Mon, 3 Jan 2022 08:46:23 GMT'}]",2022-01-05,"[['Chakraborty', 'Soumendu', ''], ['Jalal', 'Anand Singh', ''], ['Bhatnagar', 'Charul', '']]","['Edge adaptive', 'High level bit plane', 'Low level bit plane', 'Predictive image']"
9803,1807.10435,Ali Dehghantanha,"Milda Petraityte, Ali Dehghantanha, Gregory Epiphaniou","A Model for Android and iOS Applications Risk Calculation: CVSS Analysis
  and Enhancement Using Case-Control Studies",19 Pages,,10.1007/978-3-319-73951-9_11,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Various researchers have shown that the Common Vulnerability Scoring System
(CVSS) has many drawbacks and may not provide a precise view of the risks
related to software vulnerabilities. However, many threat intelligence
platforms and industry-wide standards are relying on CVSS score to evaluate
cybersecurity compliance. This paper suggests several improvements to the
calculation of Impact and Exploitability sub-scores within the CVSS, improve
its accuracy and help threat intelligence analysts to focus on the key risks
associated with their assets. We will apply our suggested improvements against
risks associated with several Android and iOS applications and discuss achieved
improvements and advantages of our modelling, such as the importance and the
impact of time on the overall CVSS score calculation.
","[{'version': 'v1', 'created': 'Fri, 27 Jul 2018 05:20:20 GMT'}]",2018-07-30,"[['Petraityte', 'Milda', ''], ['Dehghantanha', 'Ali', ''], ['Epiphaniou', 'Gregory', '']]","['CVSS', 'Risk Management', 'Risk Calculation', 'Vulnerability', 'Exploitability']"
9804,2205.14282,Antonios Saravanos,"Antonios Saravanos (1), Olivia Verni (1), Ian Moore (1), Sall
  Aboubacar (1), Jen Arriaza (1), Sabrina Jivani (1), Audrey Bennett (1), Siqi
  Li (1), Dongnanzi Zheng (1), Stavros Zervoudakis (1) ((1) New York
  University)","Investigating End-user Acceptance of Last-mile Delivery by Autonomous
  Vehicles in the United States",,,10.1007/978-3-031-18158-0_37,,cs.CY cs.HC cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates the end-user acceptance of last-mile delivery carried
out by autonomous vehicles within the United States. A total of 296
participants were presented with information on this technology and then asked
to complete a questionnaire on their perceptions to gauge their behavioral
intention concerning acceptance. Structural equation modeling of the partial
least squares flavor (PLS-SEM) was employed to analyze the collected data. The
results indicated that the perceived usefulness of the technology played the
greatest role in end-user acceptance decisions, followed by the influence of
others, and then the enjoyment received by interacting with the technology.
Furthermore, the perception of risk associated with using autonomous delivery
vehicles for last-mile delivery led to a decrease in acceptance. However, most
participants did not perceive the use of this technology to be risky. The paper
concludes by summarizing the implications our findings have on the respective
stakeholders and proposing the next steps in this area of research.
","[{'version': 'v1', 'created': 'Sat, 28 May 2022 00:36:27 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Jul 2022 13:15:28 GMT'}, {'version': 'v3', 'created': 'Fri, 21 Oct 2022 16:13:30 GMT'}]",2022-10-24,"[['Saravanos', 'Antonios', ''], ['Verni', 'Olivia', ''], ['Moore', 'Ian', ''], ['Aboubacar', 'Sall', ''], ['Arriaza', 'Jen', ''], ['Jivani', 'Sabrina', ''], ['Bennett', 'Audrey', ''], ['Li', 'Siqi', ''], ['Zheng', 'Dongnanzi', ''], ['Zervoudakis', 'Stavros', '']]","['technology adoption', 'end-user acceptance', 'last-mile delivery', 'autonomous delivery vehicles', 'autonomous delivery robots']"
9805,2002.01804,Jan Eli\'a\v{s},Jan Eli\'a\v{s} and Miroslav Vo\v{r}echovsk\'y,"Fracture in random quasibrittle media: I. Discrete mesoscale simulations
  of load capacity and fracture process zone","26 pages, 16 figures, 4 tables","Engineering Fracture Mechanics, Volume 235, August 2020, 107160",10.1016/j.engfracmech.2020.107160,,cs.CE cond-mat.mtrl-sci,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Numerical simulations of concrete fracture performed with a probabilistic
mesoscale discrete model are presented. The model represents a substantial part
of material randomness by assigning random locations to the largest aggregates.
The remaining part of randomness is introduced by causing material parameters
to fluctuate randomly via a homogeneous random field. An extensive numerical
study performed with the model considers prisms loaded in uniaxial tension with
both fixed and rotating platens, and also beams with and without a notch loaded
in three point bending. The results show the nontrivial effect of (i)
autocorrelation length and (ii) variance of the random field on the fracture
behavior of the model. Statistics of the peak load are presented as well as the
size and shape of the fracture process zone at the moment when the maximum load
is attained. Local averaging within the fracture process zone and weakest-link
are identified as underlying mechanisms explaining the reported results. The
companion paper, Part II [64], introduces an analytical model capable of
predicting the distribution of the peak load obtained with the probabilistic
discrete model via the simple estimation of extremes of a random field obtained
as moving average of local strength.
","[{'version': 'v1', 'created': 'Wed, 5 Feb 2020 14:24:14 GMT'}, {'version': 'v2', 'created': 'Sun, 14 Jun 2020 09:10:07 GMT'}]",2022-08-05,"[['Eliáš', 'Jan', ''], ['Vořechovský', 'Miroslav', '']]","['discrete model', 'mesoscale', 'concrete', 'probability', 'random field', 'fracture', 'fracture process zone']"
9806,2203.03547,Micheal Abaho,"Micheal Abaho, Danushka Bollegala, Paula R Williamson, Susanna Dodd","Assessment of contextualised representations in detecting outcome
  phrases in clinical trials",,"European Journal of Biomedical Informatics, 2021",10.24105/ejbi.2021.17.9.53-65,,cs.CL cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Automating the recognition of outcomes reported in clinical trials using
machine learning has a huge potential of speeding up access to evidence
necessary in healthcare decision-making. Prior research has however
acknowledged inadequate training corpora as a challenge for the Outcome
detection (OD) task. Additionally, several contextualized representations like
BERT and ELMO have achieved unparalleled success in detecting various diseases,
genes, proteins, and chemicals, however, the same cannot be emphatically stated
for outcomes, because these models have been relatively under-tested and
studied for the OD task. We introduce ""EBM-COMET"", a dataset in which 300
PubMed abstracts are expertly annotated for clinical outcomes. Unlike prior
related datasets that use arbitrary outcome classifications, we use labels from
a taxonomy recently published to standardize outcome classifications. To
extract outcomes, we fine-tune a variety of pre-trained contextualized
representations, additionally, we use frozen contextualized and
context-independent representations in our custom neural model augmented with
clinically informed Part-Of-Speech embeddings and a cost-sensitive loss
function. We adopt strict evaluation for the trained models by rewarding them
for correctly identifying full outcome phrases rather than words within the
entities i.e. given an outcome ""systolic blood pressure"", the models are
rewarded a classification score only when they predict all 3 words in sequence,
otherwise, they are not rewarded. We observe our best model (BioBERT) achieve
81.5\% F1, 81.3\% sensitivity and 98.0\% specificity. We reach a consensus on
which contextualized representations are best suited for detecting outcomes
from clinical-trial abstracts. Furthermore, our best model outperforms scores
published on the original EBM-NLP dataset leader-board scores.
","[{'version': 'v1', 'created': 'Sun, 13 Feb 2022 15:08:00 GMT'}, {'version': 'v2', 'created': 'Sun, 13 Mar 2022 22:41:44 GMT'}]",2022-03-15,"[['Abaho', 'Micheal', ''], ['Bollegala', 'Danushka', ''], ['Williamson', 'Paula R', ''], ['Dodd', 'Susanna', '']]","['Outcome detection', 'Outcome dataset', 'Contextualised representations', 'Transfer Learning', 'Full outcomephrase']"
9807,2011.04057,Shreyas Labhsetwar,"Shreyas Rajesh Labhsetwar, Alistair Michael Baretto, Raj Sunil Salvi,
  Piyush Arvind Kolte, Veerasai Subramaniam Venkatesh","Analysis of Dimensional Influence of Convolutional Neural Networks for
  Histopathological Cancer Classification",conference,"2021 4th Biennial International Conference on Nascent Technologies
  in Engineering (ICNTE), 2021, pp. 1-6",10.1109/ICNTE51185.2021.9487582,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convolutional Neural Networks can be designed with different levels of
complexity depending upon the task at hand. This paper analyzes the effect of
dimensional changes to the CNN architecture on its performance on the task of
Histopathological Cancer Classification. The research starts with a baseline
10-layer CNN model with (3 X 3) convolution filters. Thereafter, the baseline
architecture is scaled in multiple dimensions including width, depth,
resolution and a combination of all of these. Width scaling involves
inculcating greater number of neurons per CNN layer, whereas depth scaling
involves deepening the hierarchical layered structure. Resolution scaling is
performed by increasing the dimensions of the input image, and compound scaling
involves a hybrid combination of width, depth and resolution scaling. The
results indicate that histopathological cancer scans are very complex in nature
and hence require high resolution images fed to a large hierarchy of
Convolution, MaxPooling, Dropout and Batch Normalization layers to extract all
the intricacies and perform perfect classification. Since compound scaling the
baseline model ensures that all the three dimensions: width, depth and
resolution are scaled, the best performance is obtained with compound scaling.
This research shows that better performance of CNN models is achieved by
compound scaling of the baseline model for the task of Histopathological Cancer
Classification.
","[{'version': 'v1', 'created': 'Sun, 8 Nov 2020 19:07:43 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Dec 2020 07:03:38 GMT'}]",2022-01-04,"[['Labhsetwar', 'Shreyas Rajesh', ''], ['Baretto', 'Alistair Michael', ''], ['Salvi', 'Raj Sunil', ''], ['Kolte', 'Piyush Arvind', ''], ['Venkatesh', 'Veerasai Subramaniam', '']]","['CNN', 'Width Scaling', 'Depth Scaling', 'Resolution']"
9808,1910.05570,Yuan Jin,"Yuan Jin, Ming Liu, Yunfeng Li, Ruohua Xu, Lan Du, Longxiang Gao, Yong
  Xiang","Variational Auto-encoder Based Bayesian Poisson Tensor Factorization for
  Sparse and Imbalanced Count Data",,,10.1007/s10618-020-00723-7,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Non-negative tensor factorization models enable predictive analysis on count
data. Among them, Bayesian Poisson-Gamma models can derive full posterior
distributions of latent factors and are less sensitive to sparse count data.
However, current inference methods for these Bayesian models adopt restricted
update rules for the posterior parameters. They also fail to share the update
information to better cope with the data sparsity. Moreover, these models are
not endowed with a component that handles the imbalance in count data values.
In this paper, we propose a novel variational auto-encoder framework called
VAE-BPTF which addresses the above issues. It uses multi-layer perceptron
networks to encode and share complex update information. The encoded
information is then reweighted per data instance to penalize common data values
before aggregated to compute the posterior parameters for the latent factors.
Under synthetic data evaluation, VAE-BPTF tended to recover the right number of
latent factors and posterior parameter values. It also outperformed current
models in both reconstruction errors and latent factor (semantic) coherence
across five real-world datasets. Furthermore, the latent factors inferred by
VAE-BPTF are perceived to be meaningful and coherent under a qualitative
analysis.
","[{'version': 'v1', 'created': 'Sat, 12 Oct 2019 14:36:45 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Dec 2020 14:16:45 GMT'}]",2020-12-15,"[['Jin', 'Yuan', ''], ['Liu', 'Ming', ''], ['Li', 'Yunfeng', ''], ['Xu', 'Ruohua', ''], ['Du', 'Lan', ''], ['Gao', 'Longxiang', ''], ['Xiang', 'Yong', '']]","['Non-negative Tensor Factorization', 'Variational Auto-encoders', 'NeuralNetworks', 'Latent Variable Modelling', 'Count Data']"
9809,2004.09786,Miikka Kuutila,"Miikka Kuutila and Mika M\""antyl\""a and Ma\""elick Claes","Chat activity is a better predictor than chat sentiment on software
  developers productivity","Semotion 2020, 4 pages, 1 figure",,10.1145/3387940.3392224,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent works have proposed that software developers' positive emotion has a
positive impact on software developers' productivity. In this paper we
investigate two data sources: developers chat messages (from Slack and Hipchat)
and source code commits of a single co-located Agile team over 200 working
days. Our regression analysis shows that the number of chat messages is the
best predictor and predicts productivity measured both in the number of commits
and lines of code with $R^2$ of 0.33 and 0.27 respectively. We then add
sentiment analysis variables until AIC of our model no longer improves and gets
$R^2$ values of 0.37 (commits) and 0.30 (lines of code). Thus, analyzing chat
sentiment improves productivity prediction over chat activity alone but the
difference is not massive. This work supports the idea that emotional state and
productivity are linked in software development. We find that three positive
sentiment metrics, but surprisingly also one negative sentiment metric is
associated with higher productivity.
","[{'version': 'v1', 'created': 'Tue, 21 Apr 2020 07:25:58 GMT'}]",2020-04-22,"[['Kuutila', 'Miikka', ''], ['Mäntylä', 'Mika', ''], ['Claes', 'Maëlick', '']]","['chat', 'sentiment analysis', 'commits', 'lines of code', 'Slack', 'hipchat']"
9810,2006.11380,Marian-Gabriel Hancean,"Marian-Gabriel H\^ancean (1), Miranda J. Lubbers (2) and Jos\'e Luis
  Molina (2) ((1) Department of Sociology, University of Bucharest, (2)
  Department of Social and Cultural Anthropology, Universitat Aut\`onoma de
  Barcelona)","Measuring transnational social fields through binational link-tracing
  sampling","37 pages, 8 figures",,10.1371/journal.pone.0253042,,cs.SI stat.ME,http://creativecommons.org/licenses/by/4.0/,"  We advance binational link-tracing sampling design, an innovative data
collection methodology for sampling from transnational social fields, i.e.,
transnational networks embedding migrants and non-migrants. This paper shows
the practical challenges of such a design, the representativeness of the
samples and the qualities of the resulted networks. We performed 303
face-to-face structured interviews on sociodemographic variables, migration
trajectories and personal networks of people living in a Romanian migration
sending community (D\^ambovi\c{t}a) and in a migration receiving Spanish town
(Castell\'on), simultaneously in both sites. Inter-connecting the personal
networks, we built a multi-layered complex network structure embedding 4,855
nominated people, 5,477 directed ties (nominations) and 2,540 edges. Results
indicate that the participants' unique identification is a particularly
difficult challenge, the representativeness of the data is not optimal
(homophily on observed attributes was detected in the nomination patterns), and
the relational and attribute data allow to explore the social organization of
the Romanian migrant enclave in Castell\'on, as well as its connectivity to
other places. Furthermore, we provide methodological suggestions for improving
link-tracing sampling from transnational networks of migration. Our research
contributes to the emerging efforts of applying social network analysis to the
study of international migration.
","[{'version': 'v1', 'created': 'Fri, 19 Jun 2020 21:03:11 GMT'}]",2021-07-14,"[['Hâncean', 'Marian-Gabriel', ''], ['Lubbers', 'Miranda J.', ''], ['Molina', 'José Luis', '']]","['transnational social fields', 'social network analysis', 'migration', 'sampling', 'binational link-tracing', 'statistical network models  1 Introduction']"
9811,2107.01871,Oliver Karras,"Oliver Karras, Alexandra Risch, Jil Kl\""under","Linking Use Cases and Associated Requirements: A Replicated Eye Tracking
  Study on the Impact of Linking Variants on Reading Behavior",,"Journal of Software Engineering Research and Development, 2021,
  9:5",10.5753/jserd.2021.1096,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A wide variety of use case templates supports different variants to link a
use case with its associated requirements. Regardless of the linking, a reader
must process the related information simultaneously to understand them. Linking
variants are intended to cause a specific reading behavior in which a reader
interrelates a use case and its associated requirements. Due to the effort to
create and maintain links, we investigated the impact of different linking
variants on the reading behavior in terms of visual effort and the intended way
of interrelating both artifacts. We designed an eye tracking study about
reading a use case and requirements. We conducted the study twice each with 15
subjects as a baseline experiment and as a repetition. The results of the
baseline experiment, its repetition, and their joint analysis are consistent.
All investigated linking variants cause comparable visual effort. In all cases,
reading the single artifacts one after the other is the most frequently
occurring behavior. Only links embedded in the fields of a use case description
significantly increase the readers' efforts to interrelate both artifacts. None
of the investigated linking variants impedes reading a use case and
requirements. However, only the most detailed linking variant causes readers to
process related information simultaneously.
","[{'version': 'v1', 'created': 'Mon, 5 Jul 2021 08:51:36 GMT'}]",2021-07-06,"[['Karras', 'Oliver', ''], ['Risch', 'Alexandra', ''], ['Klünder', 'Jil', '']]","['Linking', 'use case', 'requirement', 'reading behavior', 'eye tracking', 'visual effort', 'attention switch', 'cognitive load']"
9812,2004.11861,Simon Gottschalk,"Tarc\'isio Souza Costa, Simon Gottschalk, Elena Demidova","Event-QA: A Dataset for Event-Centric Question Answering over Knowledge
  Graphs","(c) 2020 Copyright held by the authors. This is the author's version
  of the work. It is posted here for your personal use. Not for redistribution.
  The definitive version was published in the Proceedings of the 29th ACM
  International Conference on Information and Knowledge Management,
  https://doi.org/10.1145/3340531.3412760",,10.1145/3340531.3412760,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semantic Question Answering (QA) is a crucial technology to facilitate
intuitive user access to semantic information stored in knowledge graphs.
Whereas most of the existing QA systems and datasets focus on entity-centric
questions, very little is known about these systems' performance in the context
of events. As new event-centric knowledge graphs emerge, datasets for such
questions gain importance. In this paper, we present the Event-QA dataset for
answering event-centric questions over knowledge graphs. Event-QA contains 1000
semantic queries and the corresponding English, German and Portuguese
verbalizations for EventKG - an event-centric knowledge graph with more than
970 thousand events.
","[{'version': 'v1', 'created': 'Fri, 24 Apr 2020 17:11:37 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Aug 2020 14:07:47 GMT'}]",2020-08-06,"[['Costa', 'Tarcísio Souza', ''], ['Gottschalk', 'Simon', ''], ['Demidova', 'Elena', '']]","['Question Answering', 'Events', 'Knowledge Graphs', 'Dataset']"
9813,2106.10910,Fotios Lazarinis,"Fotis Lazarinis, Dimitris Kanellopoulos","Fostering Student Engagement in a Mobile Formative Assessment System for
  High-School Economics","10 pages, 3 images","Social Education Research, 2021",10.37256/ser.222021747,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  In a mobile learning environment, students can learn via mobile devices
without being limited by time and space. Therefore, it is vital to develop
tools to assist students to learn and assess their knowledge in such
environments. This paper presents a tool/application for formative
self-assessment. The tool supports the selection of questions based on
user-defined criteria concerning (1) the difficulty level; (2) the associated
concepts; and (3) the purposes of the test taker. The main purpose of the
presented tool is to better support the learning aims of the participants and
to increase their engagement in the learning process. The focus of this study
is to evaluate the tool using quizzes in Microeconomics to realize its
potential in this specific domain. Teachers and students were involved in the
experiments conducted. The experiments demonstrated that the presented tool is
usable; it motivates the students and improves their understanding
","[{'version': 'v1', 'created': 'Mon, 21 Jun 2021 08:15:49 GMT'}]",2021-06-22,"[['Lazarinis', 'Fotis', ''], ['Kanellopoulos', 'Dimitris', '']]","['mobile learning system', 'self-assessment', 'usability assessment', 'Microeconomics']"
9814,1904.08505,Clebeson Santos Msc,"Clebeson Canuto dos Santos, Jorge Leonid Aching Samatelo, Raquel
  Frizera Vassallo","Dynamic Gesture Recognition by Using CNNs and Star RGB: a Temporal
  Information Condensation","19 pages, 12 figures, submitted to Neurocomputing Journal",,10.1016/j.neucom.2020.03.038,,cs.CV cs.HC cs.LG cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Due to the advance of technologies, machines are increasingly present in
people's daily lives. Thus, there has been more and more effort to develop
interfaces, such as dynamic gestures, that provide an intuitive way of
interaction. Currently, the most common trend is to use multimodal data, as
depth and skeleton information, to enable dynamic gesture recognition. However,
using only color information would be more interesting, since RGB cameras are
usually available in almost every public place, and could be used for gesture
recognition without the need of installing other equipment. The main problem
with such approach is the difficulty of representing spatio-temporal
information using just color. With this in mind, we propose a technique capable
of condensing a dynamic gesture, shown in a video, in just one RGB image. We
call this technique star RGB. This image is then passed to a classifier formed
by two Resnet CNNs, a soft-attention ensemble, and a fully connected layer,
which indicates the class of the gesture present in the input video.
Experiments were carried out using both Montalbano and GRIT datasets. For
Montalbano dataset, the proposed approach achieved an accuracy of 94.58%. Such
result reaches the state-of-the-art when considering this dataset and only
color information. Regarding the GRIT dataset, our proposal achieves more than
98% of accuracy, recall, precision, and F1-score, outperforming the reference
approach by more than 6%.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2019 00:39:32 GMT'}, {'version': 'v2', 'created': 'Sun, 8 Sep 2019 15:57:22 GMT'}]",2020-06-19,"[['Santos', 'Clebeson Canuto dos', ''], ['Samatelo', 'Jorge Leonid Aching', ''], ['Vassallo', 'Raquel Frizera', '']]","['Dynamic Gesture Recognition', 'Convolutional Neural Network', 'Temporal InformationRepresentation']"
9815,1712.08307,Aditi Roy,"Aditi Roy, Tzipora Halevi and Nasir Memon","An HMM-based behavior modeling approach for continuous mobile
  authentication",,,10.1109/ICASSP.2014.6854310,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies continuous authentication for touch interface based mobile
devices. A Hidden Markov Model (HMM) based behavioral template training
approach is presented, which does not require training data from other subjects
other than the owner of the mobile. The stroke patterns of a user are modeled
using a continuous left-right HMM. The approach models the horizontal and
vertical scrolling patterns of a user since these are the basic and mostly used
interactions on a mobile device. The effectiveness of the proposed method is
evaluated through extensive experiments using the Toucha-lytics database which
comprises of touch data over time. The results show that the performance of the
proposed approach is better than the state-of-the-art method.
","[{'version': 'v1', 'created': 'Fri, 22 Dec 2017 05:25:06 GMT'}]",2017-12-25,"[['Roy', 'Aditi', ''], ['Halevi', 'Tzipora', ''], ['Memon', 'Nasir', '']]","['Touch pattern', 'Continuous authentication', 'Hidden MarkovModel', 'Behavioral biometric', 'Security']"
9816,2204.11540,Ge Wang,"Li Tan, Ge Wang, Feiyang Jia, Xiaofeng Lian",Research Status of Deep Learning Methods for Rumor Detection,Accepted by MTAP,,10.1007/s11042-022-12800-8,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To manage the rumors in social media to reduce the harm of rumors in society.
Many studies used methods of deep learning to detect rumors in open networks.
To comprehensively sort out the research status of rumor detection from
multiple perspectives, this paper analyzes the highly focused work from three
perspectives: Feature Selection, Model Structure, and Research Methods. From
the perspective of feature selection, we divide methods into content feature,
social feature, and propagation structure feature of the rumors. Then, this
work divides deep learning models of rumor detection into CNN, RNN, GNN,
Transformer based on the model structure, which is convenient for comparison.
Besides, this work summarizes 30 works into 7 rumor detection methods such as
propagation trees, adversarial learning, cross-domain methods, multi-task
learning, unsupervised and semi-supervised methods, based knowledge graph, and
other methods for the first time. And compare the advantages of different
methods to detect rumors. In addition, this review enumerate datasets available
and discusses the potential issues and future work to help researchers advance
the development of field.
","[{'version': 'v1', 'created': 'Mon, 25 Apr 2022 10:21:23 GMT'}]",2022-04-26,"[['Tan', 'Li', ''], ['Wang', 'Ge', ''], ['Jia', 'Feiyang', ''], ['Lian', 'Xiaofeng', '']]","['rumor detection', 'deep learning', 'social media', 'research status']"
9817,2107.02390,Ruihong Qiu,"Ruihong Qiu, Sen Wang, Zhi Chen, Hongzhi Yin and Zi Huang","CausalRec: Causal Inference for Visual Debiasing in Visually-Aware
  Recommendation",,,10.1145/3474085.3475266,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visually-aware recommendation on E-commerce platforms aims to leverage visual
information of items to predict a user's preference. It is commonly observed
that user's attention to visual features does not always reflect the real
preference. Although a user may click and view an item in light of a visual
satisfaction of their expectations, a real purchase does not always occur due
to the unsatisfaction of other essential features (e.g., brand, material,
price). We refer to the reason for such a visually related interaction
deviating from the real preference as a visual bias. Existing visually-aware
models make use of the visual features as a separate collaborative signal
similarly to other features to directly predict the user's preference without
considering a potential bias, which gives rise to a visually biased
recommendation. In this paper, we derive a causal graph to identify and analyze
the visual bias of these existing methods. In this causal graph, the visual
feature of an item acts as a mediator, which could introduce a spurious
relationship between the user and the item. To eliminate this spurious
relationship that misleads the prediction of the user's real preference, an
intervention and a counterfactual inference are developed over the mediator.
Particularly, the Total Indirect Effect is applied for a debiased prediction
during the testing phase of the model. This causal inference framework is model
agnostic such that it can be integrated into the existing methods. Furthermore,
we propose a debiased visually-aware recommender system, denoted as CausalRec
to effectively retain the supportive significance of the visual information and
remove the visual bias. Extensive experiments are conducted on eight benchmark
datasets, which shows the state-of-the-art performance of CausalRec and the
efficacy of debiasing.
","[{'version': 'v1', 'created': 'Tue, 6 Jul 2021 05:09:38 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Jul 2021 12:31:01 GMT'}, {'version': 'v3', 'created': 'Tue, 13 Jul 2021 02:04:00 GMT'}]",2021-07-14,"[['Qiu', 'Ruihong', ''], ['Wang', 'Sen', ''], ['Chen', 'Zhi', ''], ['Yin', 'Hongzhi', ''], ['Huang', 'Zi', '']]","['visually-aware', 'causal inference', 'debiased recommendation']"
9818,2108.08683,Philipp Zieris,Emanuel Q. Vintila and Philipp Zieris and Julian Horsch,MESH: A Memory-Efficient Safe Heap for C/C++,"Original publication in The 16th International Conference on
  Availability, Reliability and Security (ARES 2021)",,10.1145/3465481.3465760,,cs.CR cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While memory corruption bugs stemming from the use of unsafe programming
languages are an old and well-researched problem, the resulting vulnerabilities
still dominate real-world exploitation today. Various mitigations have been
proposed to alleviate the problem, mainly in the form of language dialects,
static program analysis, and code or binary instrumentation. Solutions like
AdressSanitizer (ASan) and Softbound/CETS have proven that the latter approach
is very promising, being able to achieve memory safety without requiring manual
source code adaptions, albeit suffering substantial performance and memory
overheads. While performance overhead can be seen as a flexible constraint,
extensive memory overheads can be prohibitive for the use of such solutions in
memory-constrained environments. To address this problem, we propose MESH, a
highly memory-efficient safe heap for C/C++. With its constant, very small
memory overhead (configurable up to 2 MB on x86-64) and constant complexity for
pointer access checking, MESH offers efficient, byte-precise spatial and
temporal memory safety for memory-constrained scenarios. Without jeopardizing
the security of safe heap objects, MESH is fully compatible with existing code
and uninstrumented libraries, making it practical to use in heterogeneous
environments. We show the feasibility of our approach with a full LLVM-based
prototype supporting both major architectures, i.e., x86-64 and ARM64, in a
Linux runtime environment. Our prototype evaluation shows that, compared to
ASan and Softbound/CETS, MESH can achieve huge memory savings while preserving
similar execution performance.
","[{'version': 'v1', 'created': 'Thu, 19 Aug 2021 13:45:55 GMT'}]",2021-08-20,"[['Vintila', 'Emanuel Q.', ''], ['Zieris', 'Philipp', ''], ['Horsch', 'Julian', '']]","['memory safety', 'unsafe programming languages', 'buffer overflows', 'pointer tagging', 'dangling pointers', 'use-after-free']"
9819,2201.01486,Sudhakar Singh,"Sharvani Srivastava, Amisha Gangwar, Richa Mishra, Sudhakar Singh",Sign Language Recognition System using TensorFlow Object Detection API,"14 pages, 5 figures, ANTIC 2021",,10.1007/978-3-030-96040-7_48,,cs.CV cs.AI cs.LG cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Communication is defined as the act of sharing or exchanging information,
ideas or feelings. To establish communication between two people, both of them
are required to have knowledge and understanding of a common language. But in
the case of deaf and dumb people, the means of communication are different.
Deaf is the inability to hear and dumb is the inability to speak. They
communicate using sign language among themselves and with normal people but
normal people do not take seriously the importance of sign language. Not
everyone possesses the knowledge and understanding of sign language which makes
communication difficult between a normal person and a deaf and dumb person. To
overcome this barrier, one can build a model based on machine learning. A model
can be trained to recognize different gestures of sign language and translate
them into English. This will help a lot of people in communicating and
conversing with deaf and dumb people. The existing Indian Sing Language
Recognition systems are designed using machine learning algorithms with single
and double-handed gestures but they are not real-time. In this paper, we
propose a method to create an Indian Sign Language dataset using a webcam and
then using transfer learning, train a TensorFlow model to create a real-time
Sign Language Recognition system. The system achieves a good level of accuracy
even with a limited size dataset.
","[{'version': 'v1', 'created': 'Wed, 5 Jan 2022 07:13:03 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Mar 2022 04:51:42 GMT'}]",2022-03-04,"[['Srivastava', 'Sharvani', ''], ['Gangwar', 'Amisha', ''], ['Mishra', 'Richa', ''], ['Singh', 'Sudhakar', '']]","['Sign Language Recognition (SLR)', 'Computer Vision', 'Machine Learning', 'Indian Sign Language']"
9820,1907.04736,Sneha Aenugu,"Sneha Aenugu, Lee Spector",Lexicase selection in Learning Classifier Systems,"Genetic and Evolutionary Computation Conference, 2019",,10.1145/3321707.3321828,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The lexicase parent selection method selects parents by considering
performance on individual data points in random order instead of using a
fitness function based on an aggregated data accuracy. While the method has
demonstrated promise in genetic programming and more recently in genetic
algorithms, its applications in other forms of evolutionary machine learning
have not been explored. In this paper, we investigate the use of lexicase
parent selection in Learning Classifier Systems (LCS) and study its effect on
classification problems in a supervised setting. We further introduce a new
variant of lexicase selection, called batch-lexicase selection, which allows
for the tuning of selection pressure. We compare the two lexicase selection
methods with tournament and fitness proportionate selection methods on binary
classification problems. We show that batch-lexicase selection results in the
creation of more generic rules which is favorable for generalization on future
data. We further show that batch-lexicase selection results in better
generalization in situations of partial or missing data.
","[{'version': 'v1', 'created': 'Wed, 10 Jul 2019 14:06:22 GMT'}]",2019-07-11,"[['Aenugu', 'Sneha', ''], ['Spector', 'Lee', '']]","['Learning Classifier Systems', 'Parent Selection', 'Lexicase Selection']"
9821,1712.04101,Nicolas Bougie,Nicolas Bougie and Ryutaro Ichise,Deep Reinforcement Learning Boosted by External Knowledge,,,10.1145/3167132.3167165,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent improvements in deep reinforcement learning have allowed to solve
problems in many 2D domains such as Atari games. However, in complex 3D
environments, numerous learning episodes are required which may be too time
consuming or even impossible especially in real-world scenarios. We present a
new architecture to combine external knowledge and deep reinforcement learning
using only visual input. A key concept of our system is augmenting image input
by adding environment feature information and combining two sources of
decision. We evaluate the performances of our method in a 3D
partially-observable environment from the Microsoft Malmo platform.
Experimental evaluation exhibits higher performance and faster learning
compared to a single reinforcement learning model.
","[{'version': 'v1', 'created': 'Tue, 12 Dec 2017 02:19:25 GMT'}]",2017-12-13,"[['Bougie', 'Nicolas', ''], ['Ichise', 'Ryutaro', '']]","['Reinforcement Learning', 'Object Recognition', 'External Knowledge', 'Deep Learning', 'Knowledge Reasoning']"
9822,1905.00559,Heiko Vogler,Joost Engelfriet and Heiko Vogler,"A B\""uchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage",,"Discrete Mathematics & Theoretical Computer Science, vol. 22 no.
  4, Automata, Logic and Semantics (August 27, 2020) dmtcs:6734",10.23638/DMTCS-22-4-3,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce MSO graph storage types, and call a storage type MSO-expressible
if it is isomorphic to some MSO graph storage type. An MSO graph storage type
has MSO-definable sets of graphs as storage configurations and as storage
transformations. We consider sequential automata with MSO graph storage and
associate with each such automaton a string language (in the usual way) and a
graph language; a graph is accepted by the automaton if it represents a correct
sequence of storage configurations for a given input string. For each MSO graph
storage type, we define an MSO logic which is a subset of the usual MSO logic
on graphs. We prove a B\""uchi-Elgot-Trakhtenbrot theorem, both for the string
case and the graph case. Moreover, we prove that (i) each MSO graph
transduction can be used as storage transformation in an MSO graph storage
type, (ii) every automatic storage type is MSO-expressible, and (iii) the
pushdown operator on storage types preserves the property of
MSO-expressibility. Thus, the iterated pushdown storage types are
MSO-expressible.
","[{'version': 'v1', 'created': 'Thu, 2 May 2019 03:03:44 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Nov 2019 14:51:48 GMT'}, {'version': 'v3', 'created': 'Wed, 1 Jul 2020 12:11:53 GMT'}, {'version': 'v4', 'created': 'Thu, 20 Aug 2020 16:04:42 GMT'}]",2021-02-10,"[['Engelfriet', 'Joost', ''], ['Vogler', 'Heiko', '']]","['automata with storage', 'monadic second-order logic', 'graph automata', 'B¨uchi-Elgot-Trakhtenbrot theorem']"
9823,2204.03546,Rania Abdelghani,"Rania Abdelghani, Pierre-Yves Oudeyer, Edith Law, Catherine de
  Vulpilli\`eres and H\'el\`ene Sauz\'eon","Conversational agents for fostering curiosity-driven learning in
  children",,,10.1016/j.ijhcs.2022.102887,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Curiosity is an important factor that favors independent and individualized
learning in children. Research suggests that it is also a competence that can
be fostered by training specific metacognitive skills and information-searching
behaviors. In this light, we develop a conversational agent that helps children
generate curiosity-driven questions, and encourages their use to lead
autonomous explorations and gain new knowledge. The study was conducted with 51
primary school students who interacted with either a neutral agent or an
incentive agent that helped curiosity-driven questioning by offering specific
semantic cues. Results showed a significant increase in the number and the
quality of the questions generated with the incentive agent. This interaction
also resulted in longer explorations and stronger learning progress. Together,
our results suggest that the more our agent is able to train children's
curiosity-related metacognitive skills, the better they can maintain their
information-searching behaviors and the more new knowledge they are likely to
acquire.
","[{'version': 'v1', 'created': 'Thu, 7 Apr 2022 16:17:09 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Apr 2022 07:30:11 GMT'}]",2023-01-12,"[['Abdelghani', 'Rania', ''], ['Oudeyer', 'Pierre-Yves', ''], ['Law', 'Edith', ''], ['de Vulpillières', 'Catherine', ''], ['Sauzéon', 'Hélène', '']]","['Human-computer interface', 'Cooperative/collaborative learning', 'Teaching/learningstrategies', 'Improving classroom teaching']"
9824,2001.00496,Andreas Sedlmeier,"Andreas Sedlmeier, Thomas Gabor, Thomy Phan, Lenz Belzner, Claudia
  Linnhoff-Popien","Uncertainty-Based Out-of-Distribution Classification in Deep
  Reinforcement Learning",arXiv admin note: text overlap with arXiv:1901.02219,"Proceedings of the 12th International Conference on Agents and
  Artificial Intelligence - Volume 2: ICAART, 2020, ISBN 978-989-758-395-7,
  pages 522-529",10.5220/0008949905220529,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robustness to out-of-distribution (OOD) data is an important goal in building
reliable machine learning systems. Especially in autonomous systems, wrong
predictions for OOD inputs can cause safety critical situations. As a first
step towards a solution, we consider the problem of detecting such data in a
value-based deep reinforcement learning (RL) setting. Modelling this problem as
a one-class classification problem, we propose a framework for
uncertainty-based OOD classification: UBOOD. It is based on the effect that an
agent's epistemic uncertainty is reduced for situations encountered during
training (in-distribution), and thus lower than for unencountered (OOD)
situations. Being agnostic towards the approach used for estimating epistemic
uncertainty, combinations with different uncertainty estimation methods, e.g.
approximate Bayesian inference methods or ensembling techniques are possible.
We further present a first viable solution for calculating a dynamic
classification threshold, based on the uncertainty distribution of the training
data. Evaluation shows that the framework produces reliable classification
results when combined with ensemble-based estimators, while the combination
with concrete dropout-based estimators fails to reliably detect OOD situations.
In summary, UBOOD presents a viable approach for OOD classification in deep RL
settings by leveraging the epistemic uncertainty of the agent's value function.
","[{'version': 'v1', 'created': 'Tue, 31 Dec 2019 09:52:49 GMT'}]",2020-04-17,"[['Sedlmeier', 'Andreas', ''], ['Gabor', 'Thomas', ''], ['Phan', 'Thomy', ''], ['Belzner', 'Lenz', ''], ['Linnhoff-Popien', 'Claudia', '']]","['Uncertainty in AI', 'Out-of-Distribution Classification', 'Deep Reinforcement Learning']"
9825,2207.03592,Akhil Arora,"Vuk Vukovi\'c, Akhil Arora, Huan-Cheng Chang, Andreas Spitz, and
  Robert West","Quote Erat Demonstrandum: A Web Interface for Exploring the Quotebank
  Corpus","SIGIR 2022 (Demo), 5 pages, 2 figures",,10.1145/3477495.3531696,,cs.IR cs.CL cs.DB,http://creativecommons.org/licenses/by/4.0/,"  The use of attributed quotes is the most direct and least filtered pathway of
information propagation in news. Consequently, quotes play a central role in
the conception, reception, and analysis of news stories. Since quotes provide a
more direct window into a speaker's mind than regular reporting, they are a
valuable resource for journalists and researchers alike. While substantial
research efforts have been devoted to methods for the automated extraction of
quotes from news and their attribution to speakers, few comprehensive corpora
of attributed quotes from contemporary sources are available to the public.
Here, we present an adaptive web interface for searching Quotebank, a massive
collection of quotes from the news, which we make available at
https://quotebank.dlab.tools.
","[{'version': 'v1', 'created': 'Thu, 7 Jul 2022 21:41:03 GMT'}]",2022-07-11,"[['Vuković', 'Vuk', ''], ['Arora', 'Akhil', ''], ['Chang', 'Huan-Cheng', ''], ['Spitz', 'Andreas', ''], ['West', 'Robert', '']]","['Quote', 'Quote corpus', 'News', 'Search', 'Adaptive Interface']"
9826,2112.08035,Lewis Mcmillan Dr,"Lewis McMillan, Graham D. Bruce, Kishan Dholakia","Meshless Monte Carlo Radiation Transfer Method for Curved Geometries
  using Signed Distance Functions",,,10.1117/1.JBO.27.8.083003,,cs.GR physics.comp-ph physics.optics,http://creativecommons.org/licenses/by/4.0/,"  Significance: Monte Carlo radiation transfer (MCRT) is the gold standard of
modeling light transport in turbid media. Typical MCRT models use voxels or
meshes to approximate experimental geometry. A voxel based geometry does not
allow for the accurate modeling of smooth curved surfaces, such as may be found
in biological systems or food and drink packaging.
  Aim: We present our algorithm which we term signedMCRT (sMCRT), a new
geometry-based method which uses signed distance functions (SDF) to represent
the geometry of the model. SDFs are capable of modeling smooth curved surfaces
accurately whilst also modeling complex geometries.
  Approach: We show that using SDFs to represent the problem's geometry is more
accurate and can be faster than voxel based methods. sMCRT, can easily be
incorporated into existing voxel based models.
  Results: sMCRT is validated against theoretical expressions, and other voxel
based MCRT codes. We show that sMCRT can accurately model arbitrary complex
geometries such as microvascular vessel network using SDFs. In comparison to
the current state-of-the-art in MCRT methods specifically for curved surfaces,
sMCRT is up-to forty-five times more accurate.
  Conclusions: sMCRT is a highly accurate, fast MCRT method that outperforms
comparable voxel based models due to its ability to model smooth curved
surfaces. sMCRT is up-to three times faster than a voxel model for equivalent
scenarios. sMCRT is publicly available at
https://github.com/lewisfish/signedMCRT
","[{'version': 'v1', 'created': 'Wed, 15 Dec 2021 10:57:24 GMT'}]",2022-11-23,"[['McMillan', 'Lewis', ''], ['Bruce', 'Graham D.', ''], ['Dholakia', 'Kishan', '']]","['Monte Carlo', 'Light Transport', 'signed distance functions', 'SDF', 'geometry', 'meshless']"
9827,2210.04959,\`Oscar Garibo I Orts,"Nicol\'as Firbas, \`Oscar Garibo-i-Orts, Miguel \'Angel Garcia-March,
  J. Alberto Conejero","Characterization of anomalous diffusion through convolutional
  transformers","20 pages, 13 figures",,10.1088/1751-8121/acafb3,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The results of the Anomalous Diffusion Challenge (AnDi Challenge) have shown
that machine learning methods can outperform classical statistical methodology
at the characterization of anomalous diffusion in both the inference of the
anomalous diffusion exponent alpha associated with each trajectory (Task 1),
and the determination of the underlying diffusive regime which produced such
trajectories (Task 2). Furthermore, of the five teams that finished in the top
three across both tasks of the AnDi challenge, three of those teams used
recurrent neural networks (RNNs). While RNNs, like the long short-term memory
(LSTM) network, are effective at learning long-term dependencies in sequential
data, their key disadvantage is that they must be trained sequentially. In
order to facilitate training with larger data sets, by training in parallel, we
propose a new transformer based neural network architecture for the
characterization of anomalous diffusion. Our new architecture, the
Convolutional Transformer (ConvTransformer) uses a bi-layered convolutional
neural network to extract features from our diffusive trajectories that can be
thought of as being words in a sentence. These features are then fed to two
transformer encoding blocks that perform either regression or classification.
To our knowledge, this is the first time transformers have been used for
characterizing anomalous diffusion. Moreover, this may be the first time that a
transformer encoding block has been used with a convolutional neural network
and without the need for a transformer decoding block or positional encoding.
Apart from being able to train in parallel, we show that the ConvTransformer is
able to outperform the previous state of the art at determining the underlying
diffusive regime in short trajectories (length 10-50 steps), which are the most
important for experimental researchers.
","[{'version': 'v1', 'created': 'Mon, 10 Oct 2022 18:53:13 GMT'}]",2023-01-18,"[['Firbas', 'Nicolás', ''], ['Garibo-i-Orts', 'Òscar', ''], ['Garcia-March', 'Miguel Ángel', ''], ['Conejero', 'J. Alberto', '']]","['anomalous diffusion', 'machine learning', 'recurrent neural networks', 'convolutional networks', 'transformers', 'attention']"
9828,2004.05962,Orestis Zachariadis,"Orestis Zachariadis, Andrea Teatini, Nitin Satpute, Juan G\'omez-Luna,
  Onur Mutlu, Ole Jakob Elle, Joaqu\'in Olivares","Accelerating B-spline Interpolation on GPUs: Application to Medical
  Image Registration",Accepted in CMPB,Comput. Methods Programs Biomed. 193 (2020) 105431,10.1016/j.cmpb.2020.105431,,cs.DC eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background and Objective. B-spline interpolation (BSI) is a popular technique
in the context of medical imaging due to its adaptability and robustness in 3D
object modeling. A field that utilizes BSI is Image Guided Surgery (IGS). IGS
provides navigation using medical images, which can be segmented and
reconstructed into 3D models, often through BSI. Image registration tasks also
use BSI to align pre-operative data to intra-operative data. However, such IGS
tasks are computationally demanding, especially when applied to 3D medical
images, due to the complexity and amount of data involved. Therefore,
optimization of IGS algorithms is greatly desirable, for example, to perform
image registration tasks intra-operatively and to enable real-time
applications. A traditional CPU does not have sufficient computing power to
achieve these goals. In this paper, we introduce a novel GPU implementation of
BSI to accelerate the calculation of the deformation field in non-rigid image
registration algorithms.
  Methods. Our BSI implementation on GPUs minimizes the data that needs to be
moved between memory and processing cores during loading of the input grid, and
leverages the large on-chip GPU register file for reuse of input values.
Moreover, we re-formulate our method as trilinear interpolations to reduce
computational complexity and increase accuracy. To provide pre-clinical
validation of our method and demonstrate its benefits in medical applications,
we integrate our improved BSI into a registration workflow for compensation of
liver deformation (caused by pneumoperitoneum, i.e., inflation of the abdomen)
and evaluate its performance.
  Results. Our approach improves the performance of BSI by an average of 6.5x
and interpolation accuracy by 2x compared to three state-of-the-art GPU
implementations. We observe up to 34% acceleration of non-rigid image
registration.
","[{'version': 'v1', 'created': 'Mon, 13 Apr 2020 14:26:36 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Apr 2020 11:33:02 GMT'}]",2020-04-20,"[['Zachariadis', 'Orestis', ''], ['Teatini', 'Andrea', ''], ['Satpute', 'Nitin', ''], ['Gómez-Luna', 'Juan', ''], ['Mutlu', 'Onur', ''], ['Elle', 'Ole Jakob', ''], ['Olivares', 'Joaquín', '']]","['Medical Image Registration', 'Medical Image Processing', 'Parallel Computing', 'GPU', 'B-splines']"
9829,cs/0307008,Simeon Warner,Simeon Warner,Eprints and the Open Archives Initiative,13 pages,"Library Hi Tech, Volume 21, Number 2, 151-158 (2003)",10.1108/07378830310479794,,cs.DL,,"  The Open Archives Initiative (OAI) was created as a practical way to promote
interoperability between eprint repositories. Although the scope of the OAI has
been broadened, eprint repositories still represent a significant fraction of
OAI data providers. In this article I present a brief survey of OAI eprint
repositories, and of services using metadata harvested from eprint repositories
using the OAI protocol for metadata harvesting (OAI-PMH). I then discuss
several situations where metadata harvesting may be used to further improve the
utility of eprint archives as a component of the scholarly communication
infrastructure.
","[{'version': 'v1', 'created': 'Fri, 4 Jul 2003 03:33:49 GMT'}]",2007-05-23,"[['Warner', 'Simeon', '']]","['Eprint', 'Open Archives Initiative', 'Metadata Harvesting', 'Scholarly Communication']"
9830,1410.2959,Mohammed  Javed,"Mohammed Javed, P. Nagabhushan, B.B. Chaudhuri",Direct Processing of Document Images in Compressed Domain,"2014 Fourth IDRBT Doctoral Colloquium, December 11-12, 2014
  Hyderabad, India",,10.13140/2.1.2523.9042,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rapid increase in the volume of Big data of this digital era, fax
documents, invoices, receipts, etc are traditionally subjected to compression
for the efficiency of data storage and transfer. However, in order to process
these documents, they need to undergo the stage of decompression which indents
additional computing resources. This limitation induces the motivation to
research on the possibility of directly processing of compressed images. In
this research paper, we summarize the research work carried out to perform
different operations straight from run-length compressed documents without
going through the stage of decompression. The different operations demonstrated
are feature extraction; text-line, word and character segmentation; document
block segmentation; and font size detection, all carried out in the compressed
version of the document. Feature extraction methods demonstrate how to extract
the conventionally defined features such as projection profile, run-histogram
and entropy, directly from the compressed document data. Document segmentation
involves the extraction of compressed segments of text-lines, words and
characters using the vertical and horizontal projection profile features.
Further an attempt is made to segment randomly a block of interest from the
compressed document and subsequently facilitate absolute and relative
characterization of the segmented block which finds real time applications in
automatic processing of Bank Cheques, Challans, etc, in compressed domain.
Finally an application to detect font size at text line level is also
investigated. All the proposed algorithms are validated experimentally with
sufficient data set of compressed documents.
","[{'version': 'v1', 'created': 'Sat, 11 Oct 2014 07:16:41 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Oct 2014 04:21:22 GMT'}]",2014-10-15,"[['Javed', 'Mohammed', ''], ['Nagabhushan', 'P.', ''], ['Chaudhuri', 'B. B.', '']]","['Compressed document processing', 'run-length compressed domain', 'direct processing of compressed data', 'feature extraction', 'segmentation', 'font size detection']"
9831,2012.00119,Gongbo Liang,"Xin Xing, Gongbo Liang, Hunter Blanton, Muhammad Usman Rafique, Chris
  Wang, Ai-Ling Lin, Nathan Jacobs",Dynamic Image for 3D MRI Image Alzheimer's Disease Classification,Accepted to ECCV2020 Workshop on BioImage Computing,,10.1007/978-3-030-66415-2_23,,cs.CV cs.AI cs.LG cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose to apply a 2D CNN architecture to 3D MRI image Alzheimer's disease
classification. Training a 3D convolutional neural network (CNN) is
time-consuming and computationally expensive. We make use of approximate rank
pooling to transform the 3D MRI image volume into a 2D image to use as input to
a 2D CNN. We show our proposed CNN model achieves $9.5\%$ better Alzheimer's
disease classification accuracy than the baseline 3D models. We also show that
our method allows for efficient training, requiring only 20% of the training
time compared to 3D CNN models. The code is available online:
https://github.com/UkyVision/alzheimer-project.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2020 21:39:32 GMT'}]",2021-01-14,"[['Xing', 'Xin', ''], ['Liang', 'Gongbo', ''], ['Blanton', 'Hunter', ''], ['Rafique', 'Muhammad Usman', ''], ['Wang', 'Chris', ''], ['Lin', 'Ai-Ling', ''], ['Jacobs', 'Nathan', '']]","['Dynamic image', '2D CNN', 'MRI image', 'Alzheimer’s Disease']"
9832,2212.03645,Ivan Kova\v{c}evi\'c,"Ivan Kova\v{c}evi\'c, Bruno \v{S}tengl, Stjepan Gro\v{s}","Systematic review of automatic translation of high-level security policy
  into firewall rules","6 pages, 1 figure; Published in the 2022 45th Jubilee International
  Convention on Information, Communication and Electronic Technology (MIPRO)",,10.23919/MIPRO55190.2022.9803570,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Firewalls are security devices that perform network traffic filtering. They
are ubiquitous in the industry and are a common method used to enforce
organizational security policy. Security policy is specified on a high level of
abstraction, with statements such as ""web browsing is allowed only on
workstations inside the office network"", and needs to be translated into
low-level firewall rules to be enforceable. There has been a lot of work
regarding optimization, analysis and platform independence of firewall rules,
but an area that has seen much less success is automatic translation of
high-level security policies into firewall rules. In addition to improving
rules' readability, such translation would make it easier to detect errors.This
paper surveys of over twenty papers that aim to generate firewall rules
according to a security policy specified on a higher level of abstraction. It
also presents an overview of similar features in modern firewall systems. Most
approaches define specialized domain languages that get compiled into firewall
rule sets, with some of them relying on formal specification, ontology, or
graphical models. The approaches' have improved over time, but there are still
many drawbacks that need to be solved before wider application.
","[{'version': 'v1', 'created': 'Wed, 7 Dec 2022 14:00:49 GMT'}]",2022-12-08,"[['Kovačević', 'Ivan', ''], ['Štengl', 'Bruno', ''], ['Groš', 'Stjepan', '']]","['network security', 'security policy', 'firewall']"
9833,1812.08538,Giovanni Abramo,"Ciriaco Andrea D'Angelo, Cristiano Giuffrida, Giovanni Abramo","A heuristic approach to author name disambiguation in bibliometrics
  databases for large-scale research assessments",,"D'Angelo, C.A., Giuffrida C., Abramo, G. (2011). A heuristic
  approach to author name disambiguation in bibliometrics databases for
  large-scale research assessments. JASIST, 62(2), 257-269",10.1002/asi.21460,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  National exercises for the evaluation of research activity by universities
are becoming regular practice in ever more countries. These exercises have
mainly been conducted through the application of peer-review methods.
Bibliometrics has not been able to offer a valid large-scale alternative
because of almost overwhelming difficulties in identifying the true author of
each publication. We will address this problem by presenting a heuristic
approach to author name disambiguation in bibliometric datasets for large-scale
research assessments. The application proposed concerns the Italian university
system, consisting of 80 universities and a research staff of over 60,000
scientists. The key advantage of the proposed approach is the ease of
implementation. The algorithms are of practical application and have
considerably better scalability and expandability properties than
state-of-the-art unsupervised approaches. Moreover, the performance in terms of
precision and recall, which can be further improved, seems thoroughly adequate
for the typical needs of large-scale bibliometric research assessments.
","[{'version': 'v1', 'created': 'Thu, 20 Dec 2018 13:02:04 GMT'}]",2018-12-21,"[[""D'Angelo"", 'Ciriaco Andrea', ''], ['Giuffrida', 'Cristiano', ''], ['Abramo', 'Giovanni', '']]","['Research assessment', 'authorship', 'author name disambiguation', 'bibliometrics', 'universities']"
9834,1812.08335,Bodong Chen,Bodong Chen and Haiyi Zhu,Towards Value-Sensitive Learning Analytics Design,"The 9th International Learning Analytics & Knowledge Conference
  (LAK19)",,10.1145/3303772.3303798,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  To support ethical considerations and system integrity in learning analytics,
this paper introduces two cases of applying the Value Sensitive Design
methodology to learning analytics design. The first study applied two methods
of Value Sensitive Design, namely stakeholder analysis and value analysis, to a
conceptual investigation of an existing learning analytics tool. This
investigation uncovered a number of values and value tensions, leading to
design trade-offs to be considered in future tool refinements. The second study
holistically applied Value Sensitive Design to the design of a recommendation
system for the Wikipedia WikiProjects. To proactively consider values among
stakeholders, we derived a multi-stage design process that included literature
analysis, empirical investigations, prototype development, community
engagement, iterative testing and refinement, and continuous evaluation. By
reporting on these two cases, this paper responds to a need of practical means
to support ethical considerations and human values in learning analytics
systems. These two cases demonstrate that Value Sensitive Design could be a
viable approach for balancing a wide range of human values, which tend to
encompass and surpass ethical issues, in learning analytics design.
","[{'version': 'v1', 'created': 'Thu, 20 Dec 2018 02:45:34 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Jan 2019 16:59:32 GMT'}]",2019-01-29,"[['Chen', 'Bodong', ''], ['Zhu', 'Haiyi', '']]","['learning analytics', 'values', 'value sensitive design', 'data ethics', 'socialmedia']"
9835,2210.16496,ELkebir Sarhrouni,"Asma Elmaizi, Maria Merzouqi, Elkebir Sarhrouni, Ahmed hammouch and
  Chafik Nacir","Hybridization of filter and wrapper approaches for the dimensionality
  reduction and classification of hyperspectral images",,"Proceedings - 3rd International Conference on Advanced
  Technologies for Signal and Image Processing, ATSIP 2017, 2017, 8075549 -
  http://www.scopus.com/inward/record.url?eid=2-s2.0-85035329769&partnerID=MN8TOARS",10.1109/ATSIP.2017.8075549,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The high dimensionality of hyperspectral images often imposes a heavy
computational burden for image processing. Therefore, dimensionality reduction
is often an essential step in order to remove the irrelevant, noisy and
redundant bands. And consequently, increase the classification accuracy.
However, identification of useful bands from hundreds or even thousands of
related bands is a nontrivial task. This paper aims at identifying a small set
of bands, for improving computational speed and prediction accuracy. Hence, we
have proposed a hybrid algorithm through band selection for dimensionality
reduction of hyperspectral images. The proposed approach combines mutual
information gain (MIG), Minimum Redundancy Maximum Relevance (mRMR) and Error
probability of Fano with Support Vector Machine Bands Elimination (SVM-PF). The
proposed approach is compared to an effective reproduced filters approach based
on mutual information. Experimental results on HSI AVIRIS 92AV3C have shown
that the proposed approach outperforms the reproduced filters.
  Keywords - Hyperspectral images, Classification, band Selection, filter,
wrapper, mutual information, information gain.
","[{'version': 'v1', 'created': 'Sat, 29 Oct 2022 05:25:10 GMT'}]",2022-11-01,"[['Elmaizi', 'Asma', ''], ['Merzouqi', 'Maria', ''], ['Sarhrouni', 'Elkebir', ''], ['hammouch', 'Ahmed', ''], ['Nacir', 'Chafik', '']]","['Hyperspectral images', 'Classification', 'band Selection', 'filter', 'wrapper', 'mutual information', 'information gain']"
9836,2205.08087,Ajoy Das,"Ajoy Das, Gias Uddin, Guenther Ruhe",An Empirical Study of Blockchain Repositories in GitHub,"The International Conference on Evaluation and Assessment in Software
  Engineering 2022 (EASE 2022)",,10.1145/3530019.3530041,,cs.CR cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Blockchain is a distributed ledger technique that guarantees the traceability
of transactions. Blockchain is adopted in multiple domains like finance (e.g.,
cryptocurrency), healthcare, security, and supply chain. In the open-source
software (OSS) portal GitHub, we observe a growing adoption of Blockchain-based
solutions. Given the rapid emergence of Blockchain-based solutions in our daily
life and the evolving cryptocurrency market, it is important to know the status
quo, how developers generally interact in those repos, and how much freedom
they have in applying code changes. We report an empirical study of 3,664
Blockchain software repositories from GitHub. We divide the Blockchain
repositories into two categories: Tool (e.g., SDKs) and Applications (e.g.,
service/solutions developed using SDKs). The Application category is further
divided into two sub-categories: Crypto and Non-Crypto applications. In all
Blockchain repository categories, the contribution interactions on commits are
the most common interaction type. We found that more organizations contributing
to the Blockchain repos than individual users. The median numbers of internal
and external users in tools are higher than the application repos. We observed
a higher degree of collaboration (e.g., for maintenance efforts) among users in
Blockchain tools than those in the application repos. Among the artifacts,
issues have a greater number of interactions than commits and pull requests.
Related to autonomy we found that less than half of total project contributions
are autonomous. Our findings offer implications to Blockchain stakeholders,
like developers to stay aware of OSS practices around Blockchain software.
","[{'version': 'v1', 'created': 'Tue, 17 May 2022 04:21:06 GMT'}]",2022-05-18,"[['Das', 'Ajoy', ''], ['Uddin', 'Gias', ''], ['Ruhe', 'Guenther', '']]","['Blockchain', 'GitHub', 'Repositories', 'Bitcoin', 'Cryptocurrency']"
9837,1805.03285,Palash Goyal,"Anna Sapienza, Palash Goyal, Emilio Ferrara",Deep Neural Networks for Optimal Team Composition,,,10.3389/fdata.2019.00014,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cooperation is a fundamental social mechanism, whose effects on human
performance have been investigated in several environments. Online games are
modern-days natural settings in which cooperation strongly affects human
behavior. Every day, millions of players connect and play together in
team-based games: the patterns of cooperation can either foster or hinder
individual skill learning and performance. This work has three goals: (i)
identifying teammates' influence on players' performance in the short and long
term, (ii) designing a computational framework to recommend teammates to
improve players' performance, and (iii) setting to demonstrate that such
improvements can be predicted via deep learning. We leverage a large dataset
from Dota 2, a popular Multiplayer Online Battle Arena game. We generate a
directed co-play network, whose links' weights depict the effect of teammates
on players' performance. Specifically, we propose a measure of network
influence that captures skill transfer from player to player over time. We then
use such framing to design a recommendation system to suggest new teammates
based on a modified deep neural autoencoder and we demonstrate its
state-of-the-art recommendation performance. We finally provide insights into
skill transfer effects: our experimental results demonstrate that such dynamics
can be predicted using deep neural networks.
","[{'version': 'v1', 'created': 'Tue, 8 May 2018 21:02:07 GMT'}]",2019-08-22,"[['Sapienza', 'Anna', ''], ['Goyal', 'Palash', ''], ['Ferrara', 'Emilio', '']]","['recommendation system', 'link prediction', 'deep neural network', 'graph factorization', 'multiplayer online games']"
9838,2107.04781,Bryar Hassan Dr.,"Bryar A. Hassan, Tarik A. Rashid and Seyedali Mirjalili","Formal context reduction in deriving concept hierarchies from corpora
  using adaptive evolutionary clustering algorithm star",Complex Intell. Syst. (2021),,10.1007/s40747-021-00422-w,,cs.AI cs.CL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  It is beneficial to automate the process of deriving concept hierarchies from
corpora since a manual construction of concept hierarchies is typically a
time-consuming and resource-intensive process. As such, the overall process of
learning concept hierarchies from corpora encompasses a set of steps: parsing
the text into sentences, splitting the sentences and then tokenising it. After
the lemmatisation step, the pairs are extracted using FCA. However, there might
be some uninteresting and erroneous pairs in the formal context. Generating
formal context may lead to a time-consuming process, so formal context size
reduction is required to remove uninterested and erroneous pairs, taking less
time to extract the concept lattice and concept hierarchies accordingly. In
this premise, this study aims to propose two frameworks: (1) A framework to
review the current process of deriving concept hierarchies from corpus
utilising FCA; (2) A framework to decrease the formal contexts ambiguity of the
first framework using an adaptive version of ECA*. Experiments are conducted by
applying 385 sample corpora from Wikipedia on the two frameworks to examine the
reducing size of formal context, which leads to yield concept lattice and
concept hierarchy. The resulting lattice of formal context is evaluated to the
standard one using concept lattice-invariants. Accordingly, the homomorphic
between the two lattices preserves the quality of resulting concept hierarchies
by 89% in contrast to the basic ones, and the reduced concept lattice inherits
the structural relation of the standard one. The adaptive ECA* is examined
against its four counterpart baseline algorithms to measure the execution time
on random datasets with different densities (fill ratios). The results show
that adaptive ECA* performs concept lattice faster than other mentioned
competitive techniques in different fill ratios.
","[{'version': 'v1', 'created': 'Sat, 10 Jul 2021 07:18:03 GMT'}]",2021-07-13,"[['Hassan', 'Bryar A.', ''], ['Rashid', 'Tarik A.', ''], ['Mirjalili', 'Seyedali', '']]","['Concept hierarchies', 'formal context reduction', 'concept lattice reduction', 'adaptive ECA*', 'FCA', 'WordNet']"
9839,2111.04461,Rukshani Somarathna,"Rukshani Somarathna, Tomasz Bednarz, Gelareh Mohammadi",Virtual Reality for Emotion Elicitation -- A Review,This work is submitted to IEEE for possible publication,"IEEE Transactions on Affective Computing, 2022",10.1109/TAFFC.2022.3181053,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Emotions are multifaceted phenomena that affect our behaviour, perception,
and cognition. Increasing evidence indicates that induction mechanisms play a
crucial role in triggering emotions by simulating the sensations required for
an experimental design. Over the years, many reviews have evaluated a passive
elicitation mechanism where the user is an observer, ignoring the importance of
self-relevance in emotional experience. So, in response to the gap in the
literature, this study intends to explore the possibility of using Virtual
Reality (VR) as an active mechanism for emotion induction. Furthermore, for the
success and quality of research settings, VR must select the appropriate
material to effectively evoke emotions. Therefore, in the present review, we
evaluated to what extent VR visual and audio-visual stimuli, games, and tasks,
and 360-degree panoramas and videos can elicit emotions based on the current
literature. Further, we present public datasets generated by VR and
emotion-sensing interfaces that can be used in VR based research. The
conclusions of this survey reveal that VR has a great potential to evoke
emotions effectively and naturally by generating motivational and empathy
mechanisms which makes it an ecologically valid paradigm to study emotions.
","[{'version': 'v1', 'created': 'Sun, 31 Oct 2021 10:45:26 GMT'}]",2022-06-17,"[['Somarathna', 'Rukshani', ''], ['Bednarz', 'Tomasz', ''], ['Mohammadi', 'Gelareh', '']]","['Emotions', 'Emotion induction', 'Virtual Reality', 'Elicitation', 'Affective Computing']"
9840,1802.01481,Jeffrey Lienert,"Jeffrey Lienert, Laura Koehly, Felix Reed-Tsochas, Christopher Steven
  Marcum",An efficient counting method for the colored triad census,,Social Networks 59 (2019) 136-142,10.1016/j.socnet.2019.04.003,,cs.DS cs.SI,http://creativecommons.org/publicdomain/zero/1.0/,"  The triad census is an important approach to understand local structure in
network science, providing comprehensive assessments of the observed relational
configurations between triples of actors in a network. However, researchers are
often interested in combinations of relational and categorical nodal
attributes. In this case, it is desirable to account for the label, or color,
of the nodes in the triad census. In this paper, we describe an efficient
algorithm for constructing the colored triad census, based, in part, on
existing methods for the classic triad census. We evaluate the performance of
the algorithm using empirical and simulated data for both undirected and
directed graphs. The results of the simulation demonstrate that the proposed
algorithm reduces computational time many-fold over the naive approach. We also
apply the colored triad census to the Zachary karate club network dataset. We
simultaneously show the efficiency of the algorithm, and a way to conduct a
statistical test on the census by forming a null distribution from 1,000
realizations of a mixing-matrix conditioned graph and comparing the observed
colored triad counts to the expected. From this, we demonstrate the method's
utility in our discussion of results about homophily, heterophily, and
bridging, simultaneously gained via the colored triad census. In sum, the
proposed algorithm for the colored triad census brings novel utility to social
network analysis in an efficient package.
","[{'version': 'v1', 'created': 'Mon, 5 Feb 2018 15:56:30 GMT'}, {'version': 'v2', 'created': 'Fri, 18 May 2018 15:21:29 GMT'}]",2019-05-02,"[['Lienert', 'Jeffrey', ''], ['Koehly', 'Laura', ''], ['Reed-Tsochas', 'Felix', ''], ['Marcum', 'Christopher Steven', '']]","['triad census', 'labeled graphs', 'simulation']"
9841,1704.03225,Lukas Mosser,"Lukas Mosser, Olivier Dubrule, Martin J. Blunt","Reconstruction of three-dimensional porous media using generative
  adversarial neural networks","21 pages, 20 figures","Phys. Rev. E 96, 043309 (2017)",10.1103/PhysRevE.96.043309,,cs.CV cond-mat.mtrl-sci physics.flu-dyn physics.geo-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To evaluate the variability of multi-phase flow properties of porous media at
the pore scale, it is necessary to acquire a number of representative samples
of the void-solid structure. While modern x-ray computer tomography has made it
possible to extract three-dimensional images of the pore space, assessment of
the variability in the inherent material properties is often experimentally not
feasible. We present a novel method to reconstruct the solid-void structure of
porous media by applying a generative neural network that allows an implicit
description of the probability distribution represented by three-dimensional
image datasets. We show, by using an adversarial learning approach for neural
networks, that this method of unsupervised learning is able to generate
representative samples of porous media that honor their statistics. We
successfully compare measures of pore morphology, such as the Euler
characteristic, two-point statistics and directional single-phase permeability
of synthetic realizations with the calculated properties of a bead pack, Berea
sandstone, and Ketton limestone. Results show that GANs can be used to
reconstruct high-resolution three-dimensional images of porous media at
different scales that are representative of the morphology of the images used
to train the neural network. The fully convolutional nature of the trained
neural network allows the generation of large samples while maintaining
computational efficiency. Compared to classical stochastic methods of image
reconstruction, the implicit representation of the learned data distribution
can be stored and reused to generate multiple realizations of the pore
structure very rapidly.
","[{'version': 'v1', 'created': 'Tue, 11 Apr 2017 09:55:55 GMT'}]",2017-11-01,"[['Mosser', 'Lukas', ''], ['Dubrule', 'Olivier', ''], ['Blunt', 'Martin J.', '']]","['stochastic image reconstruction', 'porous media', 'artificial neural networks']"
9842,2109.04996,Will Pazner,"Tzanio Kolev and Paul Fischer and Misun Min and Jack Dongarra and Jed
  Brown and Veselin Dobrev and Tim Warburton and Stanimire Tomov and Mark S.
  Shephard and Ahmad Abdelfattah and Valeria Barra and Natalie Beams and
  Jean-Sylvain Camier and Noel Chalmers and Yohann Dudouit and Ali Karakus and
  Ian Karlin and Stefan Kerkemeier and Yu-Hsiang Lan and David Medina and Elia
  Merzari and Aleksandr Obabko and Will Pazner and Thilina Rathnayake and
  Cameron W. Smith and Lukas Spies and Kasia Swirydowicz and Jeremy Thompson
  and Ananias Tomboulides and Vladimir Tomov",Efficient Exascale Discretizations: High-Order Finite Element Methods,"22 pages, 18 figures",,10.1177/10943420211020803,,cs.DC cs.MS cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efficient exploitation of exascale architectures requires rethinking of the
numerical algorithms used in many large-scale applications. These architectures
favor algorithms that expose ultra fine-grain parallelism and maximize the
ratio of floating point operations to energy intensive data movement. One of
the few viable approaches to achieve high efficiency in the area of PDE
discretizations on unstructured grids is to use matrix-free/partially-assembled
high-order finite element methods, since these methods can increase the
accuracy and/or lower the computational time due to reduced data motion. In
this paper we provide an overview of the research and development activities in
the Center for Efficient Exascale Discretizations (CEED), a co-design center in
the Exascale Computing Project that is focused on the development of
next-generation discretization software and algorithms to enable a wide range
of finite element applications to run efficiently on future hardware. CEED is a
research partnership involving more than 30 computational scientists from two
US national labs and five universities, including members of the Nek5000, MFEM,
MAGMA and PETSc projects. We discuss the CEED co-design activities based on
targeted benchmarks, miniapps and discretization libraries and our work on
performance optimizations for large-scale GPU architectures. We also provide a
broad overview of research and development activities in areas such as
unstructured adaptive mesh refinement algorithms, matrix-free linear solvers,
high-order data visualization, and list examples of collaborations with several
ECP and external applications.
","[{'version': 'v1', 'created': 'Fri, 10 Sep 2021 17:07:48 GMT'}]",2021-09-13,"[['Kolev', 'Tzanio', ''], ['Fischer', 'Paul', ''], ['Min', 'Misun', ''], ['Dongarra', 'Jack', ''], ['Brown', 'Jed', ''], ['Dobrev', 'Veselin', ''], ['Warburton', 'Tim', ''], ['Tomov', 'Stanimire', ''], ['Shephard', 'Mark S.', ''], ['Abdelfattah', 'Ahmad', ''], ['Barra', 'Valeria', ''], ['Beams', 'Natalie', ''], ['Camier', 'Jean-Sylvain', ''], ['Chalmers', 'Noel', ''], ['Dudouit', 'Yohann', ''], ['Karakus', 'Ali', ''], ['Karlin', 'Ian', ''], ['Kerkemeier', 'Stefan', ''], ['Lan', 'Yu-Hsiang', ''], ['Medina', 'David', ''], ['Merzari', 'Elia', ''], ['Obabko', 'Aleksandr', ''], ['Pazner', 'Will', ''], ['Rathnayake', 'Thilina', ''], ['Smith', 'Cameron W.', ''], ['Spies', 'Lukas', ''], ['Swirydowicz', 'Kasia', ''], ['Thompson', 'Jeremy', ''], ['Tomboulides', 'Ananias', ''], ['Tomov', 'Vladimir', '']]","['High-Performance Computing', 'Co-design', 'High-Order Discretizations', 'Unstructured Grids', 'PDEs']"
9843,2008.04356,Andrea Beck,"Jakob D\""urrw\""achter, Marius Kurz, Patrick Kopper, Daniel Kempf,
  Claus-Dieter Munz, Andrea Beck","An Efficient Sliding Mesh Interface Method for High-Order Discontinuous
  Galerkin Schemes",,Computers & Fluids 217 (2021) 104825,10.1016/j.compfluid.2020.104825,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sliding meshes are a powerful method to treat deformed domains in
computational fluid dynamics, where different parts of the domain are in
relative motion. In this paper, we present an efficient implementation of a
sliding mesh method into a discontinuous Galerkin compressible Navier-Stokes
solver and its application to a large eddy simulation of a 1-1/2 stage turbine.
The method is based on the mortar method and is high-order accurate. It can
handle three-dimensional sliding mesh interfaces with various interface shapes.
For plane interfaces, which are the most common case, conservativity and
free-stream preservation are ensured. We put an emphasis on efficient parallel
implementation. Our implementation generates little computational and storage
overhead. Inter-node communication via MPI in a dynamically changing mesh
topology is reduced to a bare minimum by ensuring a priori information about
communication partners and data sorting. We provide performance and scaling
results showing the capability of the implementation strategy. Apart from
analytical validation computations and convergence results, we present a
wall-resolved implicit LES of the 1-1/2 stage Aachen turbine test case as a
large scale practical application example.
","[{'version': 'v1', 'created': 'Mon, 10 Aug 2020 18:39:50 GMT'}]",2022-12-21,"[['Dürrwächter', 'Jakob', ''], ['Kurz', 'Marius', ''], ['Kopper', 'Patrick', ''], ['Kempf', 'Daniel', ''], ['Munz', 'Claus-Dieter', ''], ['Beck', 'Andrea', '']]","['Sliding mesh', 'Discontinuous Galerkin', 'High-order methods', 'High-performance computing', 'Large eddy']"
9844,2010.13753,Jes\'us Ruiz-Santaquiteria,"Jesus Ruiz-Santaquiteria, Alberto Velasco-Mata, Noelia Vallez, Gloria
  Bueno, Juan A. \'Alvarez-Garc\'ia, Oscar Deniz",Handgun detection using combined human pose and weapon appearance,"17 pages, 18 figures","IEEE Access, Volume 9 (2021) 123815 - 123826",10.1109/ACCESS.2021.3110335,Access-2021-26047,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Closed-circuit television (CCTV) systems are essential nowadays to prevent
security threats or dangerous situations, in which early detection is crucial.
Novel deep learning-based methods have allowed to develop automatic weapon
detectors with promising results. However, these approaches are mainly based on
visual weapon appearance only. For handguns, body pose may be a useful cue,
especially in cases where the gun is barely visible. In this work, a novel
method is proposed to combine, in a single architecture, both weapon appearance
and human pose information. First, pose keypoints are estimated to extract hand
regions and generate binary pose images, which are the model inputs. Then, each
input is processed in different subnetworks and combined to produce the handgun
bounding box. Results obtained show that the combined model improves the
handgun detection state of the art, achieving from 4.23 to 18.9 AP points more
than the best previous approach.
","[{'version': 'v1', 'created': 'Mon, 26 Oct 2020 17:45:12 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Jan 2021 12:00:53 GMT'}, {'version': 'v3', 'created': 'Sun, 31 Jan 2021 17:28:41 GMT'}, {'version': 'v4', 'created': 'Fri, 23 Jul 2021 09:55:57 GMT'}]",2021-09-17,"[['Ruiz-Santaquiteria', 'Jesus', ''], ['Velasco-Mata', 'Alberto', ''], ['Vallez', 'Noelia', ''], ['Bueno', 'Gloria', ''], ['Álvarez-García', 'Juan A.', ''], ['Deniz', 'Oscar', '']]","['CCTV surveillance', 'deep learning', 'handgun detection', 'human pose estimation']"
9845,2007.07488,Pramesh Kumar,Pramesh Kumar and Alireza Khani,"An algorithm for integrating peer-to-peer ridesharing and schedule-based
  transit system for first mile/last mile access","36 pages, 15 figures","Transportation Research Part C: Emerging Technologies, 2021",10.1016/j.trc.2020.102891,122,cs.DS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to limited transit network coverage and infrequent service, suburban
commuters often face the transit first mile/last mile (FMLM) problem. To deal
with this, they either drive to a park-and-ride location to take transit, use
carpooling, or drive directly to their destination to avoid inconvenience.
Ridesharing, an emerging mode of transportation, can solve the transit first
mile/last mile problem. In this setup, a driver can drive a ride-seeker to a
transit station, from where the rider can take transit to her respective
destination. The problem requires solving a ridesharing matching problem with
the routing of riders in a multimodal transportation network. We develop a
transit-based ridesharing matching algorithm to solve this problem. The method
leverages the schedule-based transit shortest path to generate feasible matches
and then solves a matching optimization program to find an optimal match
between riders and drivers. The proposed method not only assigns an optimal
driver to the rider but also assigns an optimal transit stop and a transit
vehicle trip departing from that stop for the rest of the rider's itinerary. We
also introduce the application of space-time prism (STP) (the geographical area
which can be reached by a traveler given the time constraints) in the context
of ridesharing to reduce the computational time by reducing the network search.
An algorithm to solve this problem dynamically using a rolling horizon approach
is also presented. We use simulated data obtained from the activity-based
travel demand model of Twin Cities, MN to show that the transit-based
ridesharing can solve the FMLM problem and save a significant number of
vehicle-hours spent in the system.
","[{'version': 'v1', 'created': 'Wed, 15 Jul 2020 05:16:51 GMT'}]",2022-08-25,"[['Kumar', 'Pramesh', ''], ['Khani', 'Alireza', '']]","['transit', 'ridesharing', 'transit first mile last mile', 'schedule-based transit shortestpath', 'rolling horizon', 'matching optimization', 'space-time prism (STP)']"
9846,2008.00421,Germ\'an Vidal,"Fred Mesnard, Etienne Payet, German Vidal",Concolic Testing in CLP,"Paper presented at the 36th International Conference on Logic
  Programming (ICLP 2020), University Of Calabria, Rende (CS), Italy, September
  2020, 16 pages",Theory and Practice of Logic Programming 20 (2020) 671-686,10.1017/S1471068420000216,,cs.LO cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Concolic testing is a popular software verification technique based on a
combination of concrete and symbolic execution. Its main focus is finding bugs
and generating test cases with the aim of maximizing code coverage. A previous
approach to concolic testing in logic programming was not sound because it only
dealt with positive constraints (by means of substitutions) but could not
represent negative constraints. In this paper, we present a novel framework for
concolic testing of CLP programs that generalizes the previous technique. In
the CLP setting, one can represent both positive and negative constraints in a
natural way, thus giving rise to a sound and (potentially) more efficient
technique. Defining verification and testing techniques for CLP programs is
increasingly relevant since this framework is becoming popular as an
intermediate representation to analyze programs written in other programming
paradigms.
","[{'version': 'v1', 'created': 'Sun, 2 Aug 2020 07:15:43 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Aug 2020 08:43:44 GMT'}, {'version': 'v3', 'created': 'Wed, 5 Aug 2020 07:00:37 GMT'}]",2020-09-23,"[['Mesnard', 'Fred', ''], ['Payet', 'Etienne', ''], ['Vidal', 'German', '']]","['CLP', 'verification', 'concolic testing']"
9847,2106.03620,Amin Heyrani Nobari,"Amin Heyrani Nobari, Wei Chen, Faez Ahmed","PcDGAN: A Continuous Conditional Diverse Generative Adversarial Network
  For Inverse Design",,,10.1145/3447548.3467414,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Engineering design tasks often require synthesizing new designs that meet
desired performance requirements. The conventional design process, which
requires iterative optimization and performance evaluation, is slow and
dependent on initial designs. Past work has used conditional generative
adversarial networks (cGANs) to enable direct design synthesis for given target
performances. However, most existing cGANs are restricted to categorical
conditions. Recent work on Continuous conditional GAN (CcGAN) tries to address
this problem, but still faces two challenges: 1) it performs poorly on
non-uniform performance distributions, and 2) the generated designs may not
cover the entire design space. We propose a new model, named Performance
Conditioned Diverse Generative Adversarial Network (PcDGAN), which introduces a
singular vicinal loss combined with a Determinantal Point Processes (DPP) based
loss function to enhance diversity. PcDGAN uses a new self-reinforcing score
called the Lambert Log Exponential Transition Score (LLETS) for improved
conditioning. Experiments on synthetic problems and a real-world airfoil design
problem demonstrate that PcDGAN outperforms state-of-the-art GAN models and
improves the conditioning likelihood by 69% in an airfoil generation task and
up to 78% in synthetic conditional generation tasks and achieves greater design
space coverage. The proposed method enables efficient design synthesis and
design space exploration with applications ranging from CAD model generation to
metamaterial selection.
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2021 13:45:12 GMT'}]",2021-06-08,"[['Nobari', 'Amin Heyrani', ''], ['Chen', 'Wei', ''], ['Ahmed', 'Faez', '']]","['Generative Adversarial Network', 'Engineering Design', 'Diversity', 'Determinantal Point Processes', 'Inverse Airfoil Design']"
9848,2112.14005,Wencan Zhang,"Wencan Zhang, Brian Y. Lim",Towards Relatable Explainable AI with the Perceptual Process,"14 pages, 7 figures, 4 tables, accepted by chi2022",,10.1145/3491102.3501826,,cs.HC cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Machine learning models need to provide contrastive explanations, since
people often seek to understand why a puzzling prediction occurred instead of
some expected outcome. Current contrastive explanations are rudimentary
comparisons between examples or raw features, which remain difficult to
interpret, since they lack semantic meaning. We argue that explanations must be
more relatable to other concepts, hypotheticals, and associations. Inspired by
the perceptual process from cognitive psychology, we propose the XAI Perceptual
Processing Framework and RexNet model for relatable explainable AI with
Contrastive Saliency, Counterfactual Synthetic, and Contrastive Cues
explanations. We investigated the application of vocal emotion recognition, and
implemented a modular multi-task deep neural network to predict and explain
emotions from speech. From think-aloud and controlled studies, we found that
counterfactual explanations were useful and further enhanced with semantic
cues, but not saliency explanations. This work provides insights into providing
and evaluating relatable contrastive explainable AI for perception
applications.
","[{'version': 'v1', 'created': 'Tue, 28 Dec 2021 05:48:53 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Feb 2022 15:23:58 GMT'}, {'version': 'v3', 'created': 'Tue, 29 Mar 2022 03:32:04 GMT'}]",2022-03-30,"[['Zhang', 'Wencan', ''], ['Lim', 'Brian Y.', '']]","['Explainable AI', 'contrastive explanations', 'audio', 'vocal emotion']"
9849,2101.00395,Masahiro Toyoura,"Siqiang Chen, Masahiro Toyoura, Takamasa Terada, Xiaoyang Mao, Gang Xu",Image-based Textile Decoding,,"Integrated Computer-Aided Engineering, Pre-press, pp. 1-14, 2020",10.3233/ICA-200647,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  A textile fabric consists of countless parallel vertical yarns (warps) and
horizontal yarns (wefts). While common looms can weave repetitive patterns,
Jacquard looms can weave the patterns without repetition restrictions. A
pattern in which the warps and wefts cross on a grid is defined in a binary
matrix. The binary matrix can define which warp and weft is on top at each grid
point of the Jacquard fabric. The process can be regarded as encoding from
pattern to textile. In this work, we propose a decoding method that generates a
binary pattern from a textile fabric that has been already woven. We could not
use a deep neural network to learn the process based solely on the training set
of patterns and observed fabric images. The crossing points in the observed
image were not completely located on the grid points, so it was difficult to
take a direct correspondence between the fabric images and the pattern
represented by the matrix in the framework of deep learning. Therefore, we
propose a method that can apply the framework of deep learning via the
intermediate representation of patterns and images. We show how to convert a
pattern into an intermediate representation and how to reconvert the output
into a pattern and confirm its effectiveness. In this experiment, we confirmed
that 93% of correct pattern was obtained by decoding the pattern from the
actual fabric images and weaving them again.
","[{'version': 'v1', 'created': 'Sat, 2 Jan 2021 07:41:34 GMT'}]",2021-01-05,"[['Chen', 'Siqiang', ''], ['Toyoura', 'Masahiro', ''], ['Terada', 'Takamasa', ''], ['Mao', 'Xiaoyang', ''], ['Xu', 'Gang', '']]","['Textile', 'fabrication', 'intermediate representation', 'pattern decoding', 'Jacquard fabric']"
9850,2204.12575,Tiago Brito,"Tiago Brito, Pedro Lopes, Nuno Santos and Jos\'e Fragoso Santos",Wasmati: An Efficient Static Vulnerability Scanner for WebAssembly,Computers & Security,,10.1016/j.cose.2022.102745,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  WebAssembly is a new binary instruction format that allows targeted compiled
code written in high-level languages to be executed with near-native speed by
the browser's JavaScript engine. However, given that WebAssembly binaries can
be compiled from unsafe languages like C/C++, classical code vulnerabilities
such as buffer overflows or format strings can be transferred over from the
original programs down to the cross-compiled binaries. As a result, this
possibility of incorporating vulnerabilities in WebAssembly modules has widened
the attack surface of modern web applications. This paper presents Wasmati, a
static analysis tool for finding security vulnerabilities in WebAssembly
binaries. It is based on the generation of a code property graph (CPG), a
program representation previously adopted for detecting vulnerabilities in
various languages but hitherto unapplied to WebAssembly. We formalize the
definition of CPG for WebAssembly, introduce techniques to generate CPG for
complex WebAssembly, and present four different query specification languages
for finding vulnerabilities by traversing a program's CPG. We implemented ten
queries capturing different vulnerability types and extensively tested Wasmati
on four heterogeneous datasets. We show that Wasmati can scale the generation
of CPGs for large real-world applications and can efficiently find
vulnerabilities for all our query types. We have also tested our tool on
WebAssembly binaries collected in the wild and identified several potential
vulnerabilities, some of which we have manually confirmed to exist unless the
enclosing application properly sanitizes the interaction with such affected
binaries.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2022 20:26:35 GMT'}]",2022-04-28,"[['Brito', 'Tiago', ''], ['Lopes', 'Pedro', ''], ['Santos', 'Nuno', ''], ['Santos', 'José Fragoso', '']]","['WebAssembly', 'Vulnerability', 'Static Analysis', 'CPG', 'Security']"
9851,2009.10562,Anjukan Kathirgamanathan,"Anjukan Kathirgamanathan, Kacper Twardowski, Eleni Mangina, Donal Finn","A Centralised Soft Actor Critic Deep Reinforcement Learning Approach to
  District Demand Side Management through CityLearn",Accepted for ACM BuildSys2020 RLEM'20 Workshop,,10.1145/3427773.3427869,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reinforcement learning is a promising model-free and adaptive controller for
demand side management, as part of the future smart grid, at the district
level. This paper presents the results of the algorithm that was submitted for
the CityLearn Challenge, which was hosted in early 2020 with the aim of
designing and tuning a reinforcement learning agent to flatten and smooth the
aggregated curve of electrical demand of a district of diverse buildings. The
proposed solution secured second place in the challenge using a centralised
'Soft Actor Critic' deep reinforcement learning agent that was able to handle
continuous action spaces. The controller was able to achieve an averaged score
of 0.967 on the challenge dataset comprising of different buildings and
climates. This highlights the potential application of deep reinforcement
learning as a plug-and-play style controller, that is capable of handling
different climates and a heterogenous building stock, for district demand side
management of buildings.
","[{'version': 'v1', 'created': 'Tue, 22 Sep 2020 14:03:11 GMT'}]",2021-04-27,"[['Kathirgamanathan', 'Anjukan', ''], ['Twardowski', 'Kacper', ''], ['Mangina', 'Eleni', ''], ['Finn', 'Donal', '']]","['Deep Reinforcement Learning', 'Smart Grid', 'Demand Side Management']"
9852,1801.06883,Harley Eades PhD,Valeria de Paiva and Harley Eades III,Dialectica Categories for the Lambek Calculus,,"In: Artemov S., Nerode A. (eds) Logical Foundations of Computer
  Science. LFCS 2018. Lecture Notes in Computer Science, vol 10703, . Springer,
  Cham",10.1007/978-3-319-72056-2_16,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We revisit the old work of de Paiva on the models of the Lambek Calculus in
dialectica models making sure that the syntactic details that were sketchy on
the first version got completed and verified. We extend the Lambek Calculus
with a \kappa modality, inspired by Yetter's work, which makes the calculus
commutative. Then we add the of-course modality !, as Girard did, to
re-introduce weakening and contraction for all formulas and get back the full
power of intuitionistic and classical logic. We also present the categorical
semantics, proved sound and complete. Finally we show the traditional
properties of type systems, like subject reduction, the Church-Rosser theorem
and normalization for the calculi of extended modalities, which we did not have
before.
","[{'version': 'v1', 'created': 'Sun, 21 Jan 2018 19:32:37 GMT'}]",2018-01-23,"[['de Paiva', 'Valeria', ''], ['Eades', 'Harley', 'III']]","['Lambek calculus', 'dialectica models', 'categorical semantics', 'type theory', 'structural rules', 'non-commutative', 'linear logic']"
9853,1807.08578,Patrick Rein,"Patrick Rein (Hasso Plattner Institute, Germany), Stefan Ramson (Hasso
  Plattner Institute, Germany), Jens Lincke (Hasso Plattner Institute,
  University of Potsdam, Germany), Robert Hirschfeld (Hasso-Plattner-Institut
  (HPI), Germany), Tobias Pape (Hasso Plattner Institute, Germany)","Exploratory and Live, Programming and Coding: A Literature Study
  Comparing Perspectives on Liveness",,"The Art, Science, and Engineering of Programming, 2019, Vol. 3,
  Issue 1, Article 1",10.22152/programming-journal.org/2019/3/1,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Various programming tools, languages, and environments give programmers the
impression of changing a program while it is running. This experience of
liveness has been discussed for over two decades and a broad spectrum of
research on this topic exists. Amongst others, this work has been carried out
in the communities around three major ideas which incorporate liveness as an
important aspect: live programming, exploratory programming, and live coding.
While there have been publications on the focus of each particular community,
the overall spectrum of liveness across these three communities has not been
investigated yet. Thus, we want to delineate the variety of research on
liveness. At the same time, we want to investigate overlaps and differences in
the values and contributions between the three communities.
  Therefore, we conducted a literature study with a sample of 212 publications
on the terms retrieved from three major indexing services. On this sample, we
conducted a thematic analysis regarding the following aspects: motivation for
liveness, application domains, intended outcomes of running a system, and types
of contributions. We also gathered bibliographic information such as related
keywords and prominent publications.
  Besides other characteristics the results show that the field of exploratory
programming is mostly about technical designs and empirical studies on tools
for general-purpose programming. In contrast, publications on live coding have
the most variety in their motivations and methodologies with a majority being
empirical studies with users. As expected, most publications on live coding are
applied to performance art. Finally, research on live programming is mostly
motivated by making programming more accessible and easier to understand,
evaluating their tool designs through empirical studies with users.
  In delineating the spectrum of work on liveness, we hope to make the
individual communities more aware of the work of the others. Further, by giving
an overview of the values and methods of the individual communities, we hope to
provide researchers new to the field of liveness with an initial overview.
","[{'version': 'v1', 'created': 'Mon, 23 Jul 2018 13:02:32 GMT'}]",2018-08-01,"[['Rein', 'Patrick', '', 'Hasso Plattner Institute, Germany'], ['Ramson', 'Stefan', '', 'Hasso\n  Plattner Institute, Germany'], ['Lincke', 'Jens', '', 'Hasso Plattner Institute,\n  University of Potsdam, Germany'], ['Hirschfeld', 'Robert', '', 'Hasso-Plattner-Institut'], ['Pape', 'Tobias', '', 'Hasso Plattner Institute, Germany']]","['live programming', 'exploratory programming', 'live coding', 'liveness', 'literature study']"
9854,2108.04063,Cheng Tan,"Cheng Tan, Jun Xia, Lirong Wu, Stan Z. Li",Co-learning: Learning from Noisy Labels with Self-supervision,ACM Multimedia 2021,,10.1145/3474085.3475622,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Noisy labels, resulting from mistakes in manual labeling or webly data
collecting for supervised learning, can cause neural networks to overfit the
misleading information and degrade the generalization performance.
Self-supervised learning works in the absence of labels and thus eliminates the
negative impact of noisy labels. Motivated by co-training with both supervised
learning view and self-supervised learning view, we propose a simple yet
effective method called Co-learning for learning with noisy labels. Co-learning
performs supervised learning and self-supervised learning in a cooperative way.
The constraints of intrinsic similarity with the self-supervised module and the
structural similarity with the noisily-supervised module are imposed on a
shared common feature encoder to regularize the network to maximize the
agreement between the two constraints. Co-learning is compared with peer
methods on corrupted data from benchmark datasets fairly, and extensive results
are provided which demonstrate that Co-learning is superior to many
state-of-the-art approaches.
","[{'version': 'v1', 'created': 'Thu, 5 Aug 2021 06:20:51 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Aug 2021 11:41:44 GMT'}, {'version': 'v3', 'created': 'Sun, 3 Oct 2021 17:38:44 GMT'}, {'version': 'v4', 'created': 'Sat, 30 Oct 2021 11:51:44 GMT'}]",2021-11-02,"[['Tan', 'Cheng', ''], ['Xia', 'Jun', ''], ['Wu', 'Lirong', ''], ['Li', 'Stan Z.', '']]","['label noise', 'self-supervised learning', 'computer vision']"
9855,2003.08290,Zijia Zhong,"Zijia Zhong, Earl E. Lee, Mark Nejad and Joyoung Lee","Influence of CAV Clustering Strategies on Mixed Traffic Flow
  Characteristics: An Analysis of Vehicle Trajectory Data","22 pages, 17 figures. arXiv admin note: substantial text overlap with
  arXiv:1909.13204","Transportation Research Part C: Emerging Technologies, 115, 2020,
  102611",10.1016/j.trc.2020.102611,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Being one of the most promising applications enabled by connected and
automated vehicles (CAV) technology, Cooperative Adaptive Cruise Control (CACC)
is expected to be deployed in the near term on public roads.} Thus far, the
majority of the CACC studies have been focusing on the overall network
performance with limited insights on the potential impacts of CAVs on
human-driven vehicles (HVs).This paper aims to quantify such impacts by
studying the high-resolution vehicle trajectory data that are obtained from
microscopic simulation. Two platoon clustering strategies for CACC- an ad hoc
coordination strategy and a local coordination strategy-are implemented.
Results show that the local coordination outperforms the ad hoc coordination
across all tested market penetration rates (MPRs) in terms of network
throughput and productivity. According to the two-sample
Kolmogorov-\textcolor{re}{Smirnov} test, however, the distributions of the hard
braking events (as a potential safety impact) for HVs change significantly
under local coordination strategy. For both of the clustering strategy, CAVs
increase the average lane change frequency for HVs. The break-even point for
average lane change frequency between the two strategies is observed at 30%
MPR, which decreases from 5.42 to 5.38 per vehicle. The average lane change
frequency following a monotonically increasing pattern in response to MPR, and
it reaches the highest 5.48 per vehicle at 40% MPR. Lastly, the interaction
state of the car-following model for HVs is analyzed. It is revealed that the
composition of the interaction state could be influenced by CAVs as well. One
of the apparent trends is that the time spent on approaching state declines
with the increasing presence of CAVs.
","[{'version': 'v1', 'created': 'Mon, 16 Mar 2020 22:23:59 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Feb 2021 02:59:48 GMT'}]",2021-02-12,"[['Zhong', 'Zijia', ''], ['Lee', 'Earl E.', ''], ['Nejad', 'Mark', ''], ['Lee', 'Joyoung', '']]","['Platoon Formation', 'Cooperative Adaptive Cruise Control', 'Vehicle Trajectory Analysis', 'MixedTraffic Conditions', 'CACC Degradation', 'Human Factor']"
9856,2009.06342,Benjamin Paassen,"Benjamin Paa{\ss}en and Alexander Schulz and Terrence C. Stewart and
  Barbara Hammer",Reservoir Memory Machines as Neural Computers,"In print at the special issue 'New Frontiers in Extremely Efficient
  Reservoir Computing' of IEEE TNNLS","IEEE Transactions on Neural Networks and Learning Systems 33
  (2022) 2575-2585",10.1109/TNNLS.2021.3094139,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Differentiable neural computers extend artificial neural networks with an
explicit memory without interference, thus enabling the model to perform
classic computation tasks such as graph traversal. However, such models are
difficult to train, requiring long training times and large datasets. In this
work, we achieve some of the computational capabilities of differentiable
neural computers with a model that can be trained very efficiently, namely an
echo state network with an explicit memory without interference. This extension
enables echo state networks to recognize all regular languages, including those
that contractive echo state networks provably can not recognize. Further, we
demonstrate experimentally that our model performs comparably to its
fully-trained deep version on several typical benchmark tasks for
differentiable neural computers.
","[{'version': 'v1', 'created': 'Mon, 14 Sep 2020 12:01:30 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Jul 2021 08:57:42 GMT'}]",2022-06-06,"[['Paaßen', 'Benjamin', ''], ['Schulz', 'Alexander', ''], ['Stewart', 'Terrence C.', ''], ['Hammer', 'Barbara', '']]","['Reservoir Computing', 'Echo State Networks', 'Finite State Machines', 'NeuralTuring Machines', 'Differentiable Neural Computers', 'Memory-Augmented Neural Networks']"
9857,2210.13547,Subrato Bharati,"Subrato Bharati, Prajoy Podder","Machine and Deep Learning for IoT Security and Privacy: Applications,
  Challenges, and Future Directions","46 pages, 7 figures, 2 tables","Security and Communication Networks, 2022",10.1155/2022/8951961,,cs.CR cs.LG cs.NI,http://creativecommons.org/licenses/by/4.0/,"  The integration of the Internet of Things (IoT) connects a number of
intelligent devices with a minimum of human interference that can interact with
one another. IoT is rapidly emerging in the areas of computer science. However,
new security problems were posed by the cross-cutting design of the
multidisciplinary elements and IoT systems involved in deploying such schemes.
Ineffective is the implementation of security protocols, i.e., authentication,
encryption, application security, and access network for IoT systems and their
essential weaknesses in security. Current security approaches can also be
improved to protect the IoT environment effectively. In recent years, deep
learning (DL)/ machine learning (ML) has progressed significantly in various
critical implementations. Therefore, DL/ML methods are essential to turn IoT
systems protection from simply enabling safe contact between IoT systems to
intelligence systems in security. This review aims to include an extensive
analysis of ML systems and state-of-the-art developments in DL methods to
improve enhanced IoT device protection methods. On the other hand, various new
insights in machine and deep learning for IoT Securities illustrate how it
could help future research. IoT protection risks relating to emerging or
essential threats are identified, as well as future IoT device attacks and
possible threats associated with each surface. We then carefully analyze DL and
ML IoT protection approaches and present each approach's benefits,
possibilities, and weaknesses. This review discusses a number of potential
challenges and limitations. The future works, recommendations, and suggestions
of DL/ML in IoT security are also included.
","[{'version': 'v1', 'created': 'Mon, 24 Oct 2022 19:02:27 GMT'}]",2022-10-26,"[['Bharati', 'Subrato', ''], ['Podder', 'Prajoy', '']]","['Security applications', 'Deep learning', 'Internet of Things (IoT)', 'Security and Privacy', 'Machine Learning', 'Applications']"
9858,cs/0510007,Alain Barrat,"Fabien Viger, Alain Barrat, Luca Dall'Asta, Cun-Hui Zhang, and Eric D.
  Kolaczyk","Network Inference from TraceRoute Measurements: Internet Topology
  `Species'",,Phys. Rev. E 75 (2007) 056111,10.1103/PhysRevE.75.056111,,cs.NI cond-mat.stat-mech math.ST physics.soc-ph stat.TH,,"  Internet mapping projects generally consist in sampling the network from a
limited set of sources by using traceroute probes. This methodology, akin to
the merging of spanning trees from the different sources to a set of
destinations, leads necessarily to a partial, incomplete map of the Internet.
Accordingly, determination of Internet topology characteristics from such
sampled maps is in part a problem of statistical inference. Our contribution
begins with the observation that the inference of many of the most basic
topological quantities -- including network size and degree characteristics --
from traceroute measurements is in fact a version of the so-called `species
problem' in statistics. This observation has important implications, since
species problems are often quite challenging. We focus here on the most
fundamental example of a traceroute internet species: the number of nodes in a
network. Specifically, we characterize the difficulty of estimating this
quantity through a set of analytical arguments, we use statistical subsampling
principles to derive two proposed estimators, and we illustrate the performance
of these estimators on networks with various topological characteristics.
","[{'version': 'v1', 'created': 'Mon, 3 Oct 2005 15:52:27 GMT'}]",2011-11-09,"[['Viger', 'Fabien', ''], ['Barrat', 'Alain', ''], [""Dall'Asta"", 'Luca', ''], ['Zhang', 'Cun-Hui', ''], ['Kolaczyk', 'Eric D.', '']]","['Internet sampling', 'species problem', 'statistical inference']"
9859,cs/0701185,Frank Gurski,Frank Gurski,Graph Operations on Clique-Width Bounded Graphs,"30 pages, to appear in ""Theory of Computing Systems""",,10.1007/s00224-016-9685-1,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clique-width is a well-known graph parameter. Many NP-hard graph problems
admit polynomial-time solutions when restricted to graphs of bounded
clique-width. The same holds for NLC-width. In this paper we study the behavior
of clique-width and NLC-width under various graph operations and graph
transformations. We give upper and lower bounds for the clique-width and
NLC-width of the modified graphs in terms of the clique-width and NLC-width of
the involved graphs.
","[{'version': 'v1', 'created': 'Mon, 29 Jan 2007 14:36:25 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Nov 2014 14:02:50 GMT'}, {'version': 'v3', 'created': 'Sat, 4 Jun 2016 16:45:38 GMT'}]",2016-06-07,"[['Gurski', 'Frank', '']]","['clique-width', 'NLC-width', 'graph operations', 'graph transformations']"
9860,2007.08666,Mike Zajko,Mike Zajko,"Conservative AI and social inequality: Conceptualizing alternatives to
  bias through social theory",AI & Soc (2021),,10.1007/s00146-021-01153-9,,cs.CY cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In response to calls for greater interdisciplinary involvement from the
social sciences and humanities in the development, governance, and study of
artificial intelligence systems, this paper presents one sociologist's view on
the problem of algorithmic bias and the reproduction of societal bias.
Discussions of bias in AI cover much of the same conceptual terrain that
sociologists studying inequality have long understood using more specific terms
and theories. Concerns over reproducing societal bias should be informed by an
understanding of the ways that inequality is continually reproduced in society
-- processes that AI systems are either complicit in, or can be designed to
disrupt and counter. The contrast presented here is between conservative and
radical approaches to AI, with conservatism referring to dominant tendencies
that reproduce and strengthen the status quo, while radical approaches work to
disrupt systemic forms of inequality. The limitations of conservative
approaches to class, gender, and racial bias are discussed as specific
examples, along with the social structures and processes that biases in these
areas are linked to. Societal issues can no longer be out of scope for AI and
machine learning, given the impact of these systems on human lives. This
requires engagement with a growing body of critical AI scholarship that goes
beyond biased data to analyze structured ways of perpetuating inequality,
opening up the possibility for radical alternatives.
","[{'version': 'v1', 'created': 'Thu, 16 Jul 2020 21:52:13 GMT'}]",2021-02-10,"[['Zajko', 'Mike', '']]","['Bias', 'inequality', 'sociology', 'fairness', 'politics']"
9861,1806.03627,Sandy Engelhardt,"Sandy Engelhardt and Raffaele De Simone and Peter M. Full and Matthias
  Karck and Ivo Wolf","Improving Surgical Training Phantoms by Hyperrealism: Deep Unpaired
  Image-to-Image Translation from Real Surgeries","8 pages, accepted at MICCAI 2018, supplemental material at
  https://youtu.be/qugAYpK-Z4M",,10.1007/978-3-030-00928-1_84,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Current `dry lab' surgical phantom simulators are a valuable tool for
surgeons which allows them to improve their dexterity and skill with surgical
instruments. These phantoms mimic the haptic and shape of organs of interest,
but lack a realistic visual appearance. In this work, we present an innovative
application in which representations learned from real intraoperative
endoscopic sequences are transferred to a surgical phantom scenario. The term
hyperrealism is introduced in this field, which we regard as a novel subform of
surgical augmented reality for approaches that involve real-time object
transfigurations. For related tasks in the computer vision community, unpaired
cycle-consistent Generative Adversarial Networks (GANs) have shown excellent
results on still RGB images. Though, application of this approach to continuous
video frames can result in flickering, which turned out to be especially
prominent for this application. Therefore, we propose an extension of
cycle-consistent GANs, named tempCycleGAN, to improve temporal consistency.The
novel method is evaluated on captures of a silicone phantom for training
endoscopic reconstructive mitral valve procedures. Synthesized videos show
highly realistic results with regard to 1) replacement of the silicone
appearance of the phantom valve by intraoperative tissue texture, while 2)
explicitly keeping crucial features in the scene, such as instruments, sutures
and prostheses. Compared to the original CycleGAN approach, tempCycleGAN
efficiently removes flickering between frames. The overall approach is expected
to change the future design of surgical training simulators since the generated
sequences clearly demonstrate the feasibility to enable a considerably more
realistic training experience for minimally-invasive procedures.
","[{'version': 'v1', 'created': 'Sun, 10 Jun 2018 10:17:21 GMT'}]",2019-04-09,"[['Engelhardt', 'Sandy', ''], ['De Simone', 'Raffaele', ''], ['Full', 'Peter M.', ''], ['Karck', 'Matthias', ''], ['Wolf', 'Ivo', '']]","['Generative adversarial networks', 'minimally-invasive surgical training', 'augmented reality', 'mitral valve simulator', 'surgical skill']"
9862,1908.06550,Rob van Glabbeek,"Wan Fokkink, Rob van Glabbeek and Bas Luttik","Divide and Congruence III: From Decomposition of Modal Formulas to
  Preservation of Stability and Divergence",An extended abstract of this paper appeared in Proc. CONCUR'17,,10.1016/j.ic.2019.104435,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In two earlier papers we derived congruence formats with regard to transition
system specifications for weak semantics on the basis of a decomposition method
for modal formulas. The idea is that a congruence format for a semantics must
ensure that the formulas in the modal characterisation of this semantics are
always decomposed into formulas that are again in this modal characterisation.
The stability and divergence requirements that are imposed on many of the known
weak semantics have so far been outside the realm of this method. Stability
refers to the absence of a $\tau$-transition. We show, using the decomposition
method, how congruence formats can be relaxed for weak semantics that are
stability-respecting. This relaxation for instance brings the priority operator
within the range of the stability-respecting branching bisimulation format.
Divergence, which refers to the presence of an infinite sequence of
$\tau$-transitions, escapes the inductive decomposition method. We circumvent
this problem by proving that a congruence format for a stability-respecting
weak semantics is also a congruence format for its divergence-preserving
counterpart.
","[{'version': 'v1', 'created': 'Mon, 19 Aug 2019 01:21:17 GMT'}]",2019-08-20,"[['Fokkink', 'Wan', ''], ['van Glabbeek', 'Rob', ''], ['Luttik', 'Bas', '']]","['Structural Operational Semantics', 'Weak Semantics', 'Modal Logic']"
9863,1508.06106,Roman Starosolski,Roman Starosolski,"Reversible Denoising and Lifting Based Color Component Transformation
  for Lossless Image Compression","Keywords: Reversible color space transformation; Lifting technique;
  Denoising; Reversible denoising and lifting step; Detector precision
  characteristic; Lossless image compression",Multimedia Tools and Applications (2020) 79(17-18):11269-11294,10.1007/s11042-019-08371-w,,cs.MM cs.IT math.IT,http://creativecommons.org/licenses/by/4.0/,"  An undesirable side effect of reversible color space transformation, which
consists of lifting steps (LSs), is that while removing correlation it
contaminates transformed components with noise from other components. Noise
affects particularly adversely the compression ratios of lossless compression
algorithms. To remove correlation without increasing noise, a reversible
denoising and lifting step (RDLS) was proposed that integrates denoising
filters into LS. Applying RDLS to color space transformation results in a new
image component transformation that is perfectly reversible despite involving
the inherently irreversible denoising; the first application of such a
transformation is presented in this paper. For the JPEG-LS, JPEG 2000, and JPEG
XR standard algorithms in lossless mode, the application of RDLS to the RDgDb
color space transformation with simple denoising filters is especially
effective for images in the native optical resolution of acquisition devices.
It results in improving compression ratios of all those images in cases when
unmodified color space transformation either improves or worsens ratios
compared with the untransformed image. The average improvement is 5.0-6.0\% for
two out of the three sets of such images, whereas average ratios of images from
standard test-sets are improved by up to 2.2\%. For the efficient
image-adaptive determination of filters for RDLS, a couple of fast
entropy-based estimators of compression effects that may be used independently
of the actual compression algorithm are investigated and an immediate filter
selection method based on the detector precision characteristic model driven by
image acquisition parameters is introduced.
","[{'version': 'v1', 'created': 'Tue, 25 Aug 2015 11:17:54 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Apr 2016 18:50:38 GMT'}, {'version': 'v3', 'created': 'Tue, 10 Dec 2019 20:25:10 GMT'}, {'version': 'v4', 'created': 'Mon, 4 May 2020 17:44:44 GMT'}]",2020-05-05,"[['Starosolski', 'Roman', '']]","['Reversible color space transformation', 'Lifting technique', 'Denoising', 'Reversibledenoising and lifting step', 'Detector precision characteristic']"
9864,2202.02078,Arkadiy Dushatskiy,"Arkadiy Dushatskiy, Tanja Alderliesten, Peter A. N. Bosman",Heed the Noise in Performance Evaluations in Neural Architecture Search,,,10.1145/3520304.3533995,,cs.NE cs.CV eess.IV,http://creativecommons.org/licenses/by/4.0/,"  Neural Architecture Search (NAS) has recently become a topic of great
interest. However, there is a potentially impactful issue within NAS that
remains largely unrecognized: noise. Due to stochastic factors in neural
network initialization, training, and the chosen train/validation dataset
split, the performance evaluation of a neural network architecture, which is
often based on a single learning run, is also stochastic. This may have a
particularly large impact if a dataset is small. We therefore propose to reduce
this noise by evaluating architectures based on average performance over
multiple network training runs using different random seeds and
cross-validation. We perform experiments for a combinatorial optimization
formulation of NAS in which we vary noise reduction levels. We use the same
computational budget for each noise level in terms of network training runs,
i.e., we allow less architecture evaluations when averaging over more training
runs. Multiple search algorithms are considered, including evolutionary
algorithms which generally perform well for NAS. We use two publicly available
datasets from the medical image segmentation domain where datasets are often
limited and variability among samples is often high. Our results show that
reducing noise in architecture evaluations enables finding better architectures
by all considered search algorithms.
","[{'version': 'v1', 'created': 'Fri, 4 Feb 2022 11:20:46 GMT'}, {'version': 'v2', 'created': 'Mon, 2 May 2022 12:49:19 GMT'}]",2022-05-03,"[['Dushatskiy', 'Arkadiy', ''], ['Alderliesten', 'Tanja', ''], ['Bosman', 'Peter A. N.', '']]","['Neural architecture search', 'noise', 'medical image segmentation']"
9865,2004.03132,Jun Ling,"Jun Ling, Han Xue, Li Song, Shuhui Yang, Rong Xie, Xiao Gu",Toward Fine-grained Facial Expression Manipulation,,,10.1007/978-3-030-58604-1_3,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Facial expression manipulation aims at editing facial expression with a given
condition. Previous methods edit an input image under the guidance of a
discrete emotion label or absolute condition (e.g., facial action units) to
possess the desired expression. However, these methods either suffer from
changing condition-irrelevant regions or are inefficient for fine-grained
editing. In this study, we take these two objectives into consideration and
propose a novel method. First, we replace continuous absolute condition with
relative condition, specifically, relative action units. With relative action
units, the generator learns to only transform regions of interest which are
specified by non-zero-valued relative AUs. Second, our generator is built on
U-Net but strengthened by Multi-Scale Feature Fusion (MSF) mechanism for
high-quality expression editing purposes. Extensive experiments on both
quantitative and qualitative evaluation demonstrate the improvements of our
proposed approach compared to the state-of-the-art expression editing methods.
Code is available at \url{https://github.com/junleen/Expression-manipulator}.
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2020 05:14:15 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Dec 2020 08:19:55 GMT'}]",2020-12-07,"[['Ling', 'Jun', ''], ['Xue', 'Han', ''], ['Song', 'Li', ''], ['Yang', 'Shuhui', ''], ['Xie', 'Rong', ''], ['Gu', 'Xiao', '']]","['GANs', 'expression editing', 'image-to-image translation']"
9866,2209.13219,Zhengyan Tong,"Zhengyan Tong, Xiaohang Wang, Shengchao Yuan, Xuanhong Chen, Junjie
  Wang, Xiangzhong Fang","Im2Oil: Stroke-Based Oil Painting Rendering with Linearly Controllable
  Fineness Via Adaptive Sampling","ACM MM 2022 oral paper, accepted by the 30th ACM International
  Conference on Multimedia",,10.1145/3503161.3547759,,cs.CV cs.LG cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a novel stroke-based rendering (SBR) method that
translates images into vivid oil paintings. Previous SBR techniques usually
formulate the oil painting problem as pixel-wise approximation. Different from
this technique route, we treat oil painting creation as an adaptive sampling
problem. Firstly, we compute a probability density map based on the texture
complexity of the input image. Then we use the Voronoi algorithm to sample a
set of pixels as the stroke anchors. Next, we search and generate an individual
oil stroke at each anchor. Finally, we place all the strokes on the canvas to
obtain the oil painting. By adjusting the hyper-parameter maximum sampling
probability, we can control the oil painting fineness in a linear manner.
Comparison with existing state-of-the-art oil painting techniques shows that
our results have higher fidelity and more realistic textures. A user opinion
test demonstrates that people behave more preference toward our oil paintings
than the results of other methods. More interesting results and the code are in
https://github.com/TZYSJTU/Im2Oil.
","[{'version': 'v1', 'created': 'Tue, 27 Sep 2022 07:41:04 GMT'}]",2022-09-28,"[['Tong', 'Zhengyan', ''], ['Wang', 'Xiaohang', ''], ['Yuan', 'Shengchao', ''], ['Chen', 'Xuanhong', ''], ['Wang', 'Junjie', ''], ['Fang', 'Xiangzhong', '']]","['stroke-based oil painting', 'adaptive sampling', 'fineness control']"
9867,2001.06056,Karol Rydzewski,Jerzy Konorski and Karol Rydzewski,"Nodal cooperation equilibrium analysis in multihop wireless ad hoc
  networks with a reputation system","presented at International Conference on Mathematical Methods,
  Models, and Architectures for Computer Network Security; 12 pages; 2 figures;
  keywords: wireless environment, multihop network, utility, cost,
  reputation,cooperation, strategy, security","MMM-ACNS 2017. Lecture Notes in Computer Science, vol 10446.
  Springer",10.1007/978-3-319-65127-9_11,,cs.NI cs.MA,http://creativecommons.org/licenses/by/4.0/,"  Motivated by the concerns of cooperation security, this work examines
selected principles of state-of-the-art reputation systems for multihop adhoc
networks and their impact upon optimal strategies for rational nodes. An
analytic framework is proposed and used for identification of effective
cooperation-enforcement schemes. It is pointed out that an optimum rather than
high reputation can be expected to be sought by rational nodes.
","[{'version': 'v1', 'created': 'Thu, 16 Jan 2020 20:08:15 GMT'}]",2020-01-20,"[['Konorski', 'Jerzy', ''], ['Rydzewski', 'Karol', '']]","['ad hoc network', 'cooperative security', 'utility', 'cost', 'reputation system', 'cooperation', 'strategy']"
9868,2012.13869,Abhinav Gupta,Abhinav Gupta and Pierre F.J. Lermusiaux,Neural Closure Models for Dynamical Systems,"29 pages, 9 figures, 13 pages of supplementary information",Proc. R. Soc. A 477-2252 (2021): 20201004,10.1098/rspa.2020.1004,,cs.LG math.DS physics.flu-dyn,http://creativecommons.org/licenses/by/4.0/,"  Complex dynamical systems are used for predictions in many domains. Because
of computational costs, models are truncated, coarsened, or aggregated. As the
neglected and unresolved terms become important, the utility of model
predictions diminishes. We develop a novel, versatile, and rigorous methodology
to learn non-Markovian closure parameterizations for known-physics/low-fidelity
models using data from high-fidelity simulations. The new ""neural closure
models"" augment low-fidelity models with neural delay differential equations
(nDDEs), motivated by the Mori-Zwanzig formulation and the inherent delays in
complex dynamical systems. We demonstrate that neural closures efficiently
account for truncated modes in reduced-order-models, capture the effects of
subgrid-scale processes in coarse models, and augment the simplification of
complex biological and physical-biogeochemical models. We find that using
non-Markovian over Markovian closures improves long-term prediction accuracy
and requires smaller networks. We derive adjoint equations and network
architectures needed to efficiently implement the new discrete and distributed
nDDEs, for any time-integration schemes and allowing nonuniformly-spaced
temporal training data. The performance of discrete over distributed delays in
closure models is explained using information theory, and we find an optimal
amount of past information for a specified architecture. Finally, we analyze
computational complexity and explain the limited additional cost due to neural
closure models.
","[{'version': 'v1', 'created': 'Sun, 27 Dec 2020 05:55:33 GMT'}, {'version': 'v2', 'created': 'Sat, 29 May 2021 23:56:42 GMT'}, {'version': 'v3', 'created': 'Tue, 13 Jul 2021 20:57:50 GMT'}]",2021-08-19,"[['Gupta', 'Abhinav', ''], ['Lermusiaux', 'Pierre F. J.', '']]","['delay differential equations', 'reduced-order-model', 'turbulence closure', 'ecosystem modeling', 'data assimilation', 'machine learning']"
9869,2203.00653,Ilie Sarpe,Diego Santoro and Ilie Sarpe,"ONBRA: Rigorous Estimation of the Temporal Betweenness Centrality in
  Temporal Networks",Accepted at TheWebConf 2022 (WWW '22),,10.1145/3485447.3512204,,cs.SI cs.DS cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In network analysis, the betweenness centrality of a node informally captures
the fraction of shortest paths visiting that node. The computation of the
betweenness centrality measure is a fundamental task in the analysis of modern
networks, enabling the identification of the most central nodes in such
networks. Additionally to being massive, modern networks also contain
information about the time at which their events occur. Such networks are often
called temporal networks. The temporal information makes the study of the
betweenness centrality in temporal networks (i.e., temporal betweenness
centrality) much more challenging than in static networks (i.e., networks
without temporal information). Moreover, the exact computation of the temporal
betweenness centrality is often impractical on even moderately-sized networks,
given its extremely high computational cost. A natural approach to reduce such
computational cost is to obtain high-quality estimates of the exact values of
the temporal betweenness centrality. In this work we present ONBRA, the first
sampling-based approximation algorithm for estimating the temporal betweenness
centrality values of the nodes in a temporal network, providing rigorous
probabilistic guarantees on the quality of its output. ONBRA is able to compute
the estimates of the temporal betweenness centrality values under two different
optimality criteria for the shortest paths of the temporal network. In
addition, ONBRA outputs high-quality estimates with sharp theoretical
guarantees leveraging on the \emph{empirical Bernstein bound}, an advanced
concentration inequality. Finally, our experimental evaluation shows that ONBRA
significantly reduces the computational resources required by the exact
computation of the temporal betweenness centrality on several real world
networks, while reporting high-quality estimates with rigorous guarantees.
","[{'version': 'v1', 'created': 'Tue, 1 Mar 2022 17:54:10 GMT'}]",2022-03-02,"[['Santoro', 'Diego', ''], ['Sarpe', 'Ilie', '']]","['Temporal networks', 'Temporal betweenness centrality', 'Sampling algorithm', 'Probabilistic analysis']"
9870,2010.15441,Divya Thekke Kanapram,"Divya Thekke Kanapram, Pablo Marin-Plaza, Lucio Marcenaro, David
  Martin, Arturo de la Escalera and Carlo Regazzoni","Self-awareness in intelligent vehicles: Feature based dynamic Bayesian
  models for abnormality detection",,,10.1016/j.robot.2020.103652,,cs.LG cs.MA eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The evolution of Intelligent Transportation Systems in recent times
necessitates the development of self-awareness in agents. Before the intensive
use of Machine Learning, the detection of abnormalities was manually programmed
by checking every variable and creating huge nested conditions that are very
difficult to track. This paper aims to introduce a novel method to develop
self-awareness in autonomous vehicles that mainly focuses on detecting abnormal
situations around the considered agents. Multi-sensory time-series data from
the vehicles are used to develop the data-driven Dynamic Bayesian Network (DBN)
models used for future state prediction and the detection of dynamic
abnormalities. Moreover, an initial level collective awareness model that can
perform joint anomaly detection in co-operative tasks is proposed. The GNG
algorithm learns the DBN models' discrete node variables; probabilistic
transition links connect the node variables. A Markov Jump Particle Filter
(MJPF) is applied to predict future states and detect when the vehicle is
potentially misbehaving using learned DBNs as filter parameters. In this paper,
datasets from real experiments of autonomous vehicles performing various tasks
used to learn and test a set of switching DBN models.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2020 09:29:47 GMT'}]",2020-10-30,"[['Kanapram', 'Divya Thekke', ''], ['Marin-Plaza', 'Pablo', ''], ['Marcenaro', 'Lucio', ''], ['Martin', 'David', ''], ['de la Escalera', 'Arturo', ''], ['Regazzoni', 'Carlo', '']]","['Intelligent Transportation System (ITS)', 'Autonomous vehicles', 'Dynamic Bayesian Network (DBN)', 'Hellinger distance', 'Abnormality detection']"
9871,1910.02486,Orsolya Csisz\'ar,"Orsolya Csisz\'ar, G\'abor Csisz\'ar, J\'ozsef Dombi","Interpretable neural networks based on continuous-valued logic and
  multicriteria decision operators",,j.knosys.2020,10.1016/j.knosys.2020.105972,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Combining neural networks with continuous logic and multicriteria decision
making tools can reduce the black box nature of neural models. In this study,
we show that nilpotent logical systems offer an appropriate mathematical
framework for a hybridization of continuous nilpotent logic and neural models,
helping to improve the interpretability and safety of machine learning. In our
concept, perceptrons model soft inequalities; namely membership functions and
continuous logical operators. We design the network architecture before
training, using continuous logical operators and multicriteria decision tools
with given weights working in the hidden layers. Designing the structure
appropriately leads to a drastic reduction in the number of parameters to be
learned. The theoretical basis offers a straightforward choice of activation
functions (the cutting function or its differentiable approximation, the
squashing function), and also suggests an explanation to the great success of
the rectified linear unit (ReLU). In this study, we focus on the architecture
of a hybrid model and introduce the building blocks for future application in
deep neural networks. The concept is illustrated with some toy examples taken
from an extended version of the tensorflow playground.
","[{'version': 'v1', 'created': 'Sun, 6 Oct 2019 18:20:59 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Feb 2020 07:39:08 GMT'}]",2020-05-01,"[['Csiszár', 'Orsolya', ''], ['Csiszár', 'Gábor', ''], ['Dombi', 'József', '']]","['neural network', 'XAI', 'continuous logic', 'nilpotent logic', 'adversarial problems']"
9872,1904.09562,Ce Jin,Ce Jin,An Improved FPTAS for 0-1 Knapsack,To appear at ICALP'19,,10.4230/LIPIcs.ICALP.2019.76,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The 0-1 knapsack problem is an important NP-hard problem that admits fully
polynomial-time approximation schemes (FPTASs). Previously the fastest FPTAS by
Chan (2018) with approximation factor $1+\varepsilon$ runs in $\tilde O(n +
(1/\varepsilon)^{12/5})$ time, where $\tilde O$ hides polylogarithmic factors.
In this paper we present an improved algorithm in $\tilde
O(n+(1/\varepsilon)^{9/4})$ time, with only a $(1/\varepsilon)^{1/4}$ gap from
the quadratic conditional lower bound based on $(\min,+)$-convolution. Our
improvement comes from a multi-level extension of Chan's number-theoretic
construction, and a greedy lemma that reduces unnecessary computation spent on
cheap items.
","[{'version': 'v1', 'created': 'Sun, 21 Apr 2019 08:05:34 GMT'}]",2020-01-03,"[['Jin', 'Ce', '']]","['approximation algorithms', 'knapsack', 'subset sum']"
9873,2111.00655,Byungsoo Jeon,"Byungsoo Jeon, Sunghyun Park, Peiyuan Liao, Sheng Xu, Tianqi Chen,
  Zhihao Jia","Collage: Seamless Integration of Deep Learning Backends with Automatic
  Placement",Published in PACT 22,,10.1145/3559009.3569651,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The strong demand for efficient and performant deployment of Deep Learning
(DL) applications prompts the rapid development of a rich DL ecosystem. To keep
up with this fast advancement, it is crucial for modern DL frameworks to
efficiently integrate a variety of optimized tensor algebra libraries and
runtimes as their backends and generate the fastest possible executable using
these backends. However, current DL frameworks require significant manual
effort and expertise to integrate every new backend while failing to unleash
its full potential. Given the fast-evolving nature of the DL ecosystem, this
manual approach often slows down continuous innovations across different
layers; it prevents hardware vendors from the fast deployment of their
cutting-edge libraries, DL framework developers must repeatedly adjust their
hand-coded rules to accommodate new versions of libraries, and machine learning
practitioners need to wait for the integration of new technologies and often
encounter unsatisfactory performance.
  In this paper, we propose Collage, a DL framework that offers seamless
integration of DL backends. Collage provides an expressive backend registration
interface that allows users to precisely specify the capability of various
backends. By leveraging the specifications of available backends, Collage
automatically searches for an optimized backend placement strategy for a given
workload and execution environment. Our evaluation shows that Collage
outperforms the best existing framework for each hardware by $1.26\times$,
$1.43\times$, $1.40\times$ on average on NVIDIA's RTX 2070 GPU, V100 GPU, and
Intel's Xeon 8259CL CPU, respectively. Collage has been open-sourced and
deployed in Apache TVM.
","[{'version': 'v1', 'created': 'Mon, 1 Nov 2021 02:01:45 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Oct 2022 03:03:28 GMT'}, {'version': 'v3', 'created': 'Fri, 28 Oct 2022 02:20:18 GMT'}]",2022-10-31,"[['Jeon', 'Byungsoo', ''], ['Park', 'Sunghyun', ''], ['Liao', 'Peiyuan', ''], ['Xu', 'Sheng', ''], ['Chen', 'Tianqi', ''], ['Jia', 'Zhihao', '']]","['Machine Learning System', 'Compiler', 'Software Library']"
9874,2004.04616,Bruno Lima Mr.,Bruno Lima and Jo\~ao Pascoal Faria,"DCO Analyzer: Local Controllability and Observability Analysis and
  Enforcement of Distributed Test Scenarios",,,10.1145/3377812.3382142,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To ensure interoperability and the correct behavior of heterogeneous
distributed systems in key scenarios, it is important to conduct automated
integration tests, based on distributed test components (called local testers)
that are deployed close to the system components to simulate inputs from the
environment and monitor the interactions with the environment and other system
components. We say that a distributed test scenario is locally controllable and
locally observable if test inputs can be decided locally and conformance errors
can be detected locally by the local testers, without the need for exchanging
coordination messages between the test components during test execution (which
may reduce the responsiveness and fault detection capability of the test
harness). DCO Analyzer is the first tool that checks if distributed test
scenarios specified by means of UML sequence diagrams exhibit those properties,
and automatically determines a minimum number of coordination messages to
enforce them.
","[{'version': 'v1', 'created': 'Thu, 9 Apr 2020 15:58:54 GMT'}]",2020-04-10,"[['Lima', 'Bruno', ''], ['Faria', 'João Pascoal', '']]","['Local Observability', 'Local Controllability', 'Distributed Systems Testing', 'Integration Testing']"
9875,2206.12596,Mingyuan Meng,"Mingyuan Meng, Lei Bi, Dagan Feng, and Jinman Kim","Non-iterative Coarse-to-fine Registration based on Single-pass Deep
  Cumulative Learning","Accepted at International Conference on Medical Image Computing and
  Computer Assisted Intervention (MICCAI 2022)","International Conference on Medical Image Computing and
  Computer-Assisted Intervention, pp. 88-97, 2022",10.1007/978-3-031-16446-0_9,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Deformable image registration is a crucial step in medical image analysis for
finding a non-linear spatial transformation between a pair of fixed and moving
images. Deep registration methods based on Convolutional Neural Networks (CNNs)
have been widely used as they can perform image registration in a fast and
end-to-end manner. However, these methods usually have limited performance for
image pairs with large deformations. Recently, iterative deep registration
methods have been used to alleviate this limitation, where the transformations
are iteratively learned in a coarse-to-fine manner. However, iterative methods
inevitably prolong the registration runtime, and tend to learn separate image
features for each iteration, which hinders the features from being leveraged to
facilitate the registration at later iterations. In this study, we propose a
Non-Iterative Coarse-to-finE registration Network (NICE-Net) for deformable
image registration. In the NICE-Net, we propose: (i) a Single-pass Deep
Cumulative Learning (SDCL) decoder that can cumulatively learn coarse-to-fine
transformations within a single pass (iteration) of the network, and (ii) a
Selectively-propagated Feature Learning (SFL) encoder that can learn common
image features for the whole coarse-to-fine registration process and
selectively propagate the features as needed. Extensive experiments on six
public datasets of 3D brain Magnetic Resonance Imaging (MRI) show that our
proposed NICE-Net can outperform state-of-the-art iterative deep registration
methods while only requiring similar runtime to non-iterative methods.
","[{'version': 'v1', 'created': 'Sat, 25 Jun 2022 08:34:59 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Jun 2022 19:38:14 GMT'}]",2022-09-20,"[['Meng', 'Mingyuan', ''], ['Bi', 'Lei', ''], ['Feng', 'Dagan', ''], ['Kim', 'Jinman', '']]","['Image registration', 'Cumulative learning', 'Large deformations']"
9876,2008.01483,Alan Smeaton,"Alan F. Smeaton and Swathikiran Srungavarapu and Cyril Messaraa and
  Claire Tansey","Tracking Skin Colour and Wrinkle Changes During Cosmetic Product Trials
  Using Smartphone Images","17 pages, 12 figures, 3 tables. This is the submitted version, the
  definitive published version is at
  https://onlinelibrary.wiley.com/doi/abs/10.1111/srt.12928",,10.1111/srt.12928,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: To explore how the efficacy of product trials for skin cosmetics
can be improved through the use of consumer-level images taken by volunteers
using a conventional smartphone.
  Materials and Methods: 12 women aged 30 to 60 years participated in a product
trial and had close-up images of the cheek and temple regions of their faces
taken with a high-resolution Antera 3D CS camera at the start and end of a
4-week period. Additionally, they each had ``selfies'' of the same regions of
their faces taken regularly throughout the trial period. Automatic image
analysis to identify changes in skin colour used three kinds of colour
normalisation and analysis for wrinkle composition identified edges and
calculated their magnitude.
  Results: Images taken at the start and end of the trial acted as baseline
ground truth for normalisation of smartphone images and showed large changes in
both colour and wrinkle magnitude during the trial for many volunteers.
Conclusions: Results demonstrate that regular use of selfie smartphone images
within trial periods can add value to interpretation of the efficacy of the
trial.
","[{'version': 'v1', 'created': 'Tue, 4 Aug 2020 12:19:44 GMT'}]",2020-08-05,"[['Smeaton', 'Alan F.', ''], ['Srungavarapu', 'Swathikiran', ''], ['Messaraa', 'Cyril', ''], ['Tansey', 'Claire', '']]","['Computer vision', 'colour normalisation', 'edge detection', 'skin physiology/structure']"
9877,2112.06104,Zekun Li,"Zekun Li, Runyu Guan, Qianmu Yu, Yao-Yi Chiang and Craig A. Knoblock","Synthetic Map Generation to Provide Unlimited Training Data for
  Historical Map Text Detection",,,10.1145/3486635.3491070,,cs.CV cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Many historical map sheets are publicly available for studies that require
long-term historical geographic data. The cartographic design of these maps
includes a combination of map symbols and text labels. Automatically reading
text labels from map images could greatly speed up the map interpretation and
helps generate rich metadata describing the map content. Many text detection
algorithms have been proposed to locate text regions in map images
automatically, but most of the algorithms are trained on out-ofdomain datasets
(e.g., scenic images). Training data determines the quality of machine learning
models, and manually annotating text regions in map images is labor-extensive
and time-consuming. On the other hand, existing geographic data sources, such
as Open- StreetMap (OSM), contain machine-readable map layers, which allow us
to separate out the text layer and obtain text label annotations easily.
However, the cartographic styles between OSM map tiles and historical maps are
significantly different. This paper proposes a method to automatically generate
an unlimited amount of annotated historical map images for training text
detection models. We use a style transfer model to convert contemporary map
images into historical style and place text labels upon them. We show that the
state-of-the-art text detection models (e.g., PSENet) can benefit from the
synthetic historical maps and achieve significant improvement for historical
map text detection.
","[{'version': 'v1', 'created': 'Sun, 12 Dec 2021 00:27:03 GMT'}]",2021-12-14,"[['Li', 'Zekun', ''], ['Guan', 'Runyu', ''], ['Yu', 'Qianmu', ''], ['Chiang', 'Yao-Yi', ''], ['Knoblock', 'Craig A.', '']]","['datasets', 'synthetic data generation', 'historical maps', 'text detection']"
9878,2007.15751,Chaopeng Shen,"Wen-Ping Tsai, Dapeng Feng, Ming Pan, Hylke Beck, Kathryn Lawson, Yuan
  Yang, Jiangtao Liu, and Chaopeng Shen","From calibration to parameter learning: Harnessing the scaling effects
  of big data in geoscientific modeling",,,10.1038/s41467-021-26107-z,,cs.LG physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The behaviors and skills of models in many geosciences (e.g., hydrology and
ecosystem sciences) strongly depend on spatially-varying parameters that need
calibration. A well-calibrated model can reasonably propagate information from
observations to unobserved variables via model physics, but traditional
calibration is highly inefficient and results in non-unique solutions. Here we
propose a novel differentiable parameter learning (dPL) framework that
efficiently learns a global mapping between inputs (and optionally responses)
and parameters. Crucially, dPL exhibits beneficial scaling curves not
previously demonstrated to geoscientists: as training data increases, dPL
achieves better performance, more physical coherence, and better
generalizability (across space and uncalibrated variables), all with
orders-of-magnitude lower computational cost. We demonstrate examples that
learned from soil moisture and streamflow, where dPL drastically outperformed
existing evolutionary and regionalization methods, or required only ~12.5% of
the training data to achieve similar performance. The generic scheme promotes
the integration of deep learning and process-based models, without mandating
reimplementation.
","[{'version': 'v1', 'created': 'Thu, 30 Jul 2020 21:38:56 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Aug 2020 12:51:58 GMT'}, {'version': 'v3', 'created': 'Sat, 12 Sep 2020 11:22:19 GMT'}, {'version': 'v4', 'created': 'Thu, 6 May 2021 20:22:38 GMT'}, {'version': 'v5', 'created': 'Wed, 12 May 2021 21:15:31 GMT'}, {'version': 'v6', 'created': 'Wed, 23 Mar 2022 00:54:33 GMT'}]",2022-03-24,"[['Tsai', 'Wen-Ping', ''], ['Feng', 'Dapeng', ''], ['Pan', 'Ming', ''], ['Beck', 'Hylke', ''], ['Lawson', 'Kathryn', ''], ['Yang', 'Yuan', ''], ['Liu', 'Jiangtao', ''], ['Shen', 'Chaopeng', '']]","['geoscientific models', 'parameter estimation', 'deep learning', 'big data', 'global constraint', 'physicsinformed machine learning']"
9879,2008.02359,Kenneth Lai,"Kenneth Lai, Helder C. R. Oliveira, Ming Hou, Svetlana N.
  Yanushkevich, and Vlad P. Shmerko","Risk, Trust, and Bias: Causal Regulators of Biometric-Enabled Decision
  Support",Accepted to IEEE ACCESS,,10.1109/ACCESS.2020.3015855,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Biometrics and biometric-enabled decision support systems (DSS) have become a
mandatory part of complex dynamic systems such as security checkpoints,
personal health monitoring systems, autonomous robots, and epidemiological
surveillance. Risk, trust, and bias (R-T-B) are emerging measures of
performance of such systems. The existing studies on the R-T-B impact on system
performance mostly ignore the complementary nature of R-T-B and their causal
relationships, for instance, risk of trust, risk of bias, and risk of trust
over biases. This paper offers a complete taxonomy of the R-T-B causal
performance regulators for the biometric-enabled DSS. The proposed novel
taxonomy links the R-T-B assessment to the causal inference mechanism for
reasoning in decision making. Practical details of the R-T-B assessment in the
DSS are demonstrated using the experiments of assessing the trust in synthetic
biometric and the risk of bias in face biometrics. The paper also outlines the
emerging applications of the proposed approach beyond biometrics, including
decision support for epidemiological surveillance such as for COVID-19
pandemics.
","[{'version': 'v1', 'created': 'Wed, 5 Aug 2020 20:49:13 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Aug 2020 08:06:02 GMT'}]",2020-08-14,"[['Lai', 'Kenneth', ''], ['Oliveira', 'Helder C. R.', ''], ['Hou', 'Ming', ''], ['Yanushkevich', 'Svetlana N.', ''], ['Shmerko', 'Vlad P.', '']]","['Risk', 'trust', 'bias', 'biometrics', 'intelligent decisionsupport', 'Bayesian causal inference', 'machine reasoning', 'epidemiological surveillance']"
9880,1708.03416,Xinghao Chen,"Xinghao Chen, Guijin Wang, Hengkai Guo, Cairong Zhang","Pose Guided Structured Region Ensemble Network for Cascaded Hand Pose
  Estimation",Accepted by Neurocomputing,Neurocomputing 2019,10.1016/j.neucom.2018.06.097,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hand pose estimation from a single depth image is an essential topic in
computer vision and human computer interaction. Despite recent advancements in
this area promoted by convolutional neural network, accurate hand pose
estimation is still a challenging problem. In this paper we propose a Pose
guided structured Region Ensemble Network (Pose-REN) to boost the performance
of hand pose estimation. The proposed method extracts regions from the feature
maps of convolutional neural network under the guide of an initially estimated
pose, generating more optimal and representative features for hand pose
estimation. The extracted feature regions are then integrated hierarchically
according to the topology of hand joints by employing tree-structured fully
connections. A refined estimation of hand pose is directly regressed by the
proposed network and the final hand pose is obtained by utilizing an iterative
cascaded method. Comprehensive experiments on public hand pose datasets
demonstrate that our proposed method outperforms state-of-the-art algorithms.
","[{'version': 'v1', 'created': 'Fri, 11 Aug 2017 00:36:24 GMT'}, {'version': 'v2', 'created': 'Sun, 24 Jun 2018 02:00:25 GMT'}]",2019-07-16,"[['Chen', 'Xinghao', ''], ['Wang', 'Guijin', ''], ['Guo', 'Hengkai', ''], ['Zhang', 'Cairong', '']]","['Hand Pose Estimation', 'Convolutional Neural Network', 'Human Computer Interaction', 'Depth Images']"
9881,2005.06599,Pavlos Papadopoulos,"Orestis Christou and Nikolaos Pitropakis and Pavlos Papadopoulos and
  Sean McKeown and William J. Buchanan","Phishing URL Detection Through Top-level Domain Analysis: A Descriptive
  Approach",In Proceedings of the 6th ICISSP,"ICISSP, Volume 1, pages 289-298 (2020)",10.5220/0008902202890298,,cs.CR cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Phishing is considered to be one of the most prevalent cyber-attacks because
of its immense flexibility and alarmingly high success rate. Even with adequate
training and high situational awareness, it can still be hard for users to
continually be aware of the URL of the website they are visiting. Traditional
detection methods rely on blocklists and content analysis, both of which
require time-consuming human verification. Thus, there have been attempts
focusing on the predictive filtering of such URLs. This study aims to develop a
machine-learning model to detect fraudulent URLs which can be used within the
Splunk platform. Inspired from similar approaches in the literature, we trained
the SVM and Random Forests algorithms using malicious and benign datasets found
in the literature and one dataset that we created. We evaluated the algorithms'
performance with precision and recall, reaching up to 85% precision and 87%
recall in the case of Random Forests while SVM achieved up to 90% precision and
88% recall using only descriptive features.
","[{'version': 'v1', 'created': 'Wed, 13 May 2020 21:41:29 GMT'}]",2020-05-15,"[['Christou', 'Orestis', ''], ['Pitropakis', 'Nikolaos', ''], ['Papadopoulos', 'Pavlos', ''], ['McKeown', 'Sean', ''], ['Buchanan', 'William J.', '']]","['Phishing Detection', 'Machine Learning', 'Domain Names', 'URL']"
9882,2112.10963,Jingchao Peng,"Jingchao Peng, Haitao Zhao, Zhengwei Hu, Kaijie Zhao, and Zhongze Wang",DRPN: Making CNN Dynamically Handle Scale Variation,,"Digit. Signal Process, 133 (2023), pp. 103844",10.1016/j.dsp.2022.103844,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Based on our observations of infrared targets, serious scale variation along
within sequence frames has high-frequently occurred. In this paper, we propose
a dynamic re-parameterization network (DRPN) to deal with the scale variation
and balance the detection precision between small targets and large targets in
infrared datasets. DRPN adopts the multiple branches with different sizes of
convolution kernels and the dynamic convolution strategy. Multiple branches
with different sizes of convolution kernels have different sizes of receptive
fields. Dynamic convolution strategy makes DRPN adaptively weight multiple
branches. DRPN can dynamically adjust the receptive field according to the
scale variation of the target. Besides, in order to maintain effective
inference in the test phase, the multi-branch structure is further converted to
a single-branch structure via the re-parameterization technique after training.
Extensive experiments on FLIR, KAIST, and InfraPlane datasets demonstrate the
effectiveness of our proposed DRPN. The experimental results show that
detectors using the proposed DRPN as the basic structure rather than SKNet or
TridentNet obtained the best performances.
","[{'version': 'v1', 'created': 'Tue, 21 Dec 2021 03:38:58 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Sep 2022 07:23:22 GMT'}]",2022-12-01,"[['Peng', 'Jingchao', ''], ['Zhao', 'Haitao', ''], ['Hu', 'Zhengwei', ''], ['Zhao', 'Kaijie', ''], ['Wang', 'Zhongze', '']]","['Object detection', 'Infrared target detection', 'Scale variation', 'Dynamic convolution', 'Re-parameterization technique']"
9883,2112.12912,Muhammad Marwan Muhammad Fuad,Muhammad Marwan Muhammad Fuad,TSAX is Trending,21st International Conference on Computational Science (ICCS 2021),"Lecture Notes in Computer Science 12743, Springer 2021",10.1007/978-3-030-77964-1_23,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Time series mining is an important branch of data mining, as time series data
is ubiquitous and has many applications in several domains. The main task in
time series mining is classification. Time series representation methods play
an important role in time series classification and other time series mining
tasks. One of the most popular representation methods of time series data is
the Symbolic Aggregate approXimation (SAX). The secret behind its popularity is
its simplicity and efficiency. SAX has however one major drawback, which is its
inability to represent trend information. Several methods have been proposed to
enable SAX to capture trend information, but this comes at the expense of
complex processing, preprocessing, or post-processing procedures. In this paper
we present a new modification of SAX that we call Trending SAX (TSAX), which
only adds minimal complexity to SAX, but substantially improves its performance
in time series classification. This is validated experimentally on 50 datasets.
The results show the superior performance of our method, as it gives a smaller
classification error on 39 datasets compared with SAX.
","[{'version': 'v1', 'created': 'Fri, 24 Dec 2021 02:34:50 GMT'}]",2021-12-28,"[['Fuad', 'Muhammad Marwan Muhammad', '']]","['Symbolic Aggregate Approximation (SAX)', 'Time Series Classification', 'Trending SAX (TSAX)']"
9884,2210.08086,Md Shakib Khan,"Md. Shakib Khan, Kazi Nabiul Alam, Abdur Rab Dhruba, Hasib Zunair,
  Nabeel Mohammed",Knowledge Distillation approach towards Melanoma Detection,,"Computers in Biology and Medicine, Volume 146, July 2022, 105581",10.1016/j.compbiomed.2022.105581,,cs.CV cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Melanoma is regarded as the most threatening among all skin cancers. There is
a pressing need to build systems which can aid in the early detection of
melanoma and enable timely treatment to patients. Recent methods are geared
towards machine learning based systems where the task is posed as image
recognition, tag dermoscopic images of skin lesions as melanoma or
non-melanoma. Even though these methods show promising results in terms of
accuracy, they are computationally quite expensive to train, that questions the
ability of these models to be deployable in a clinical setting or memory
constraint devices. To address this issue, we focus on building simple and
performant models having few layers, less than ten compared to hundreds. As
well as with fewer learnable parameters, 0.26 million (M) compared to 42.5M
using knowledge distillation with the goal to detect melanoma from dermoscopic
images. First, we train a teacher model using a ResNet-50 to detect melanoma.
Using the teacher model, we train the student model known as Distilled Student
Network (DSNet) which has around 0.26M parameters using knowledge distillation
achieving an accuracy of 91.7%. We compare against ImageNet pre-trained models
such MobileNet, VGG-16, Inception-V3, EfficientNet-B0, ResNet-50 and
ResNet-101. We find that our approach works well in terms of inference runtime
compared to other pre-trained models, 2.57 seconds compared to 14.55 seconds.
We find that DSNet (0.26M parameters), which is 15 times smaller, consistently
performs better than EfficientNet-B0 (4M parameters) in both melanoma and
non-melanoma detection across Precision, Recall and F1 scores
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2022 20:18:07 GMT'}]",2022-10-18,"[['Khan', 'Md. Shakib', ''], ['Alam', 'Kazi Nabiul', ''], ['Dhruba', 'Abdur Rab', ''], ['Zunair', 'Hasib', ''], ['Mohammed', 'Nabeel', '']]","['Melanoma detection', 'Knowledge distillation; Skinlesion analysis', 'Deep learning']"
9885,2109.07989,Lalli Myllyaho,"Lalli Myllyaho, Mikko Raatikainen, Tomi M\""annist\""o, Jukka K.
  Nurminen, Tommi Mikkonen",On Misbehaviour and Fault Tolerance in Machine Learning Systems,"15 pages, 1 figure, 2 tables. The manuscript has been accepted to the
  Journal of Systems and Software",,10.1016/j.jss.2021.111096,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Machine learning (ML) provides us with numerous opportunities, allowing ML
systems to adapt to new situations and contexts. At the same time, this
adaptability raises uncertainties concerning the run-time product quality or
dependability, such as reliability and security, of these systems. Systems can
be tested and monitored, but this does not provide protection against faults
and failures in adapted ML systems themselves. We studied software designs that
aim at introducing fault tolerance in ML systems so that possible problems in
ML components of the systems can be avoided. The research was conducted as a
case study, and its data was collected through five semi-structured interviews
with experienced software architects. We present a conceptualisation of the
misbehaviour of ML systems, the perceived role of fault tolerance, and the
designs used. Common patterns to incorporating ML components in design in a
fault tolerant fashion have started to emerge. ML models are, for example,
guarded by monitoring the inputs and their distribution, and enforcing business
rules on acceptable outputs. Multiple, specialised ML models are used to adapt
to the variations and changes in the surrounding world, and simpler fall-over
techniques like default outputs are put in place to have systems up and running
in the face of problems. However, the general role of these patterns is not
widely acknowledged. This is mainly due to the relative immaturity of using ML
as part of a complete software system: the field still lacks established
frameworks and practices beyond training to implement, operate, and maintain
the software that utilises ML. ML software engineering needs further analysis
and development on all fronts.
","[{'version': 'v1', 'created': 'Thu, 16 Sep 2021 13:58:18 GMT'}]",2022-10-18,"[['Myllyaho', 'Lalli', ''], ['Raatikainen', 'Mikko', ''], ['Männistö', 'Tomi', ''], ['Nurminen', 'Jukka K.', ''], ['Mikkonen', 'Tommi', '']]","['Machine learning', 'Fault tolerance', 'Software architecture', 'Software engineering', 'Case study']"
9886,2012.01009,Doruk Pancaroglu,Doruk Pancaroglu,"Artist, Style And Year Classification Using Face Recognition And
  Clustering With Convolutional Neural Networks","14 pages, SIPO 2020",,10.5121/csit.2020.101604,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Artist, year and style classification of fine-art paintings are generally
achieved using standard image classification methods, image segmentation, or
more recently, convolutional neural networks (CNNs). This works aims to use
newly developed face recognition methods such as FaceNet that use CNNs to
cluster fine-art paintings using the extracted faces in the paintings, which
are found abundantly. A dataset consisting of over 80,000 paintings from over
1000 artists is chosen, and three separate face recognition and clustering
tasks are performed. The produced clusters are analyzed by the file names of
the paintings and the clusters are named by their majority artist, year range,
and style. The clusters are further analyzed and their performance metrics are
calculated. The study shows promising results as the artist, year, and styles
are clustered with an accuracy of 58.8, 63.7, and 81.3 percent, while the
clusters have an average purity of 63.1, 72.4, and 85.9 percent.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2020 08:01:27 GMT'}]",2020-12-03,"[['Pancaroglu', 'Doruk', '']]","['Face Recognition', 'Clustering', 'Convolutional Neural Networks', 'Art Identification']"
9887,2206.04397,Rafael Menezes,"Rafael Menezes, Daniel Moura, Helena Cavalcante, Rosiane de Freitas
  and Lucas C. Cordeiro","ESBMC-Jimple: Verifying Kotlin Programs via Jimple Intermediate
  Representation","ACM SIGSOFT International Symposium on Software Testing and Analysis
  2022",,10.1145/3533767.3543294,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we describe and evaluate the first model checker for verifying
Kotlin programs through the Jimple intermediate representation. The verifier,
named ESBMC-Jimple, is built on top of the Efficient SMT-based Context-Bounded
Model Checker (ESBMC). It uses the Soot framework to obtain the Jimple IR,
representing a simplified version of the Kotlin source code, containing a
maximum of three operands per instruction. ESBMC-Jimple processes Kotlin source
code together with a model of the standard Kotlin libraries and checks a set of
safety properties. Experimental results show that ESBMC-Jimple can correctly
verify a set of Kotlin benchmarks from the literature and that it is
competitive with state-of-the-art Java bytecode verifiers. A demonstration is
available at https://youtu.be/J6WhNfXvJNc.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2022 10:18:53 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Jul 2022 13:26:30 GMT'}]",2022-07-21,"[['Menezes', 'Rafael', ''], ['Moura', 'Daniel', ''], ['Cavalcante', 'Helena', ''], ['de Freitas', 'Rosiane', ''], ['Cordeiro', 'Lucas C.', '']]","['Formal Verification', 'Software Model Checking', 'Kotlin', 'Jimple']"
9888,2109.02442,Armin Salimi-Badr,"Armin Salimi-Badr, Mohammad Hashemi, Hamidreza Saffari","Parkinson's Disease Diagnosis based on Gait Cycle Analysis Through an
  Interpretable Interval Type-2 Neuro-Fuzzy System",,"Applied Intelligence, 2022",10.1007/s10489-022-04276-8,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this paper, an interpretable classifier using an interval type-2 fuzzy
neural network for detecting patients suffering from Parkinson's Disease (PD)
based on analyzing the gait cycle is presented. The proposed method utilizes
clinical features extracted from the vertical Ground Reaction Force (vGRF),
measured by 16 wearable sensors placed in the soles of subjects' shoes and
learns interpretable fuzzy rules. Therefore, experts can verify the decision
made by the proposed method based on investigating the firing strength of
interpretable fuzzy rules. Moreover, experts can utilize the extracted fuzzy
rules for patient diagnosing or adjust them based on their knowledge. To
improve the robustness of the proposed method against uncertainty and noisy
sensor measurements, Interval Type-2 Fuzzy Logic is applied. To learn fuzzy
rules, two paradigms are proposed: 1- A batch learning approach based on
clustering available samples is applied to extract initial fuzzy rules, 2- A
complementary online learning is proposed to improve the rule base encountering
new labeled samples. The performance of the method is evaluated for classifying
patients and healthy subjects in different conditions including the presence of
noise or observing new instances. Moreover, the performance of the model is
compared to some previous supervised and unsupervised machine learning
approaches. The final Accuracy, Precision, Recall, and F1 Score of the proposed
method are 88.74%, 89.41%, 95.10%, and 92.16%. Finally, the extracted fuzzy
sets for each feature are reported.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2021 08:33:27 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Sep 2021 12:50:01 GMT'}]",2022-11-30,"[['Salimi-Badr', 'Armin', ''], ['Hashemi', 'Mohammad', ''], ['Saffari', 'Hamidreza', '']]","['Parkinson’s Disease', 'Interval Type-2 Fuzzy Neural Networks', 'Interpretable ArtificialIntelligence', 'Gait Cycle']"
9889,2012.01596,Stephen MacDonell,"Michael Franklin Bosu, Stephen G. MacDonell, Peter Whigham",Time-Aware Models for Software Effort Estimation,"5 Pages, Conference SEKE2020","The 32nd International Conference on Software Engineering &
  Knowledge Engineering, Virtual, 9 - 19 July, 2020",10.18293/SEKE2020-083,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  It seems logical to assert that the dynamic nature of software engineering
practice would mean that software effort estimation (SEE) modelling should take
into account project start and completion dates. That is, we should build
models for future projects based only on data from completed projects; and we
should prefer data from recent similar projects over data from older similar
projects. Research in SEE modelling generally ignores these recommendations. In
this study two different model development approaches that take project timing
into account are applied to two publicly available datasets and the outcomes
are compared to those drawn from three baseline (non-time-aware) models. Our
results indicate: that it is feasible to build accurate effort estimation
models using project timing information; that the models differ from those
built without considering time, in terms of the parameters included and their
weightings; and that there is no statistical significance difference as to
which of the two model building approaches is superior in terms of accuracy.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2020 23:34:53 GMT'}]",2020-12-04,"[['Bosu', 'Michael Franklin', ''], ['MacDonell', 'Stephen G.', ''], ['Whigham', 'Peter', '']]","['Empirical software engineering', 'software engineering decision support', 'software effort estimation', 'time-aware models  I']"
9890,2212.05269,Mahmood Ahmadi,"Ramin Atefinia, Mahmood Ahmadi","Performance Evaluation of Apache Spark MLlib Algorithms on an Intrusion
  Detection Dataset","Journal of Computing and Security (Isfahan University, Iran), Vol. 9,
  No.1, 2022","Journal of Computing and Security (Isfahan University, Iran), Vol.
  9, No.1, 2022",10.22108/jcs.2022.131400.1085,,cs.NI,http://creativecommons.org/publicdomain/zero/1.0/,"  The increase in the use of the Internet and web services and the advent of
the fifth generation of cellular network technology (5G) along with
ever-growing Internet of Things (IoT) data traffic will grow global internet
usage. To ensure the security of future networks, machine learning-based
intrusion detection and prevention systems (IDPS) must be implemented to detect
new attacks, and big data parallel processing tools can be used to handle a
huge collection of training data in these systems. In this paper Apache Spark,
a general-purpose and fast cluster computing platform is used for processing
and training a large volume of network traffic feature data. In this work, the
most important features of the CSE-CIC-IDS2018 dataset are used for
constructing machine learning models and then the most popular machine learning
approaches, namely Logistic Regression, Support Vector Machine (SVM), three
different Decision Tree Classifiers, and Naive Bayes algorithm are used to
train the model using up to eight number of worker nodes. Our Spark cluster
contains seven machines acting as worker nodes and one machine is configured as
both a master and a worker. We use the CSE-CIC-IDS2018 dataset to evaluate the
overall performance of these algorithms on Botnet attacks and distributed
hyperparameter tuning is used to find the best single decision tree parameters.
We have achieved up to 100% accuracy using selected features by the learning
method in our experiments
","[{'version': 'v1', 'created': 'Sat, 10 Dec 2022 11:08:11 GMT'}]",2022-12-13,"[['Atefinia', 'Ramin', ''], ['Ahmadi', 'Mahmood', '']]","['Intrusion detection systems', 'Apache spark', 'MLlib', 'Machine learning']"
9891,2104.07847,Stephen MacDonell,Sherlock A. Licorish and Stephen G. MacDonell,"Exploring software developers' work practices: Task differences,
  participation, engagement, and speed of task resolution","Journal paper, 21 pages, 3 figures, 6 tables","Information & Management 54(3), 2017, pp.364-382",10.1016/j.im.2016.09.005,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In seeking to understand the processes enacted during software development,
an increasing number of studies have mined software repositories. In
particular, studies have endeavored to show how teams resolve software defects.
Although much of this work has been useful, we contend that large-scale
examinations across the range of activities that are commonly performed, beyond
defect-related issues alone, would help us to more fully understand the reasons
why defects occur as well as their consequences. More generally, these
explorations would reveal how team processes occur during all software
development efforts. We thus extend such studies by investigating how software
practitioners work while undertaking the range of software tasks that are
typically performed. Multiple forms of analyses of a longitudinal case study
reveal that software practitioners were mostly involved in fixing defects, and
that their engagement covaried depending on the nature of the work they were
performing. Furthermore, multiple external factors affected speed of task
resolution. Our outcomes suggest that behavioral and intrinsic issues may
interact with extrinsic factors becoming significant predictors of the speed of
software task resolution.
","[{'version': 'v1', 'created': 'Fri, 16 Apr 2021 01:55:45 GMT'}]",2021-04-19,"[['Licorish', 'Sherlock A.', ''], ['MacDonell', 'Stephen G.', '']]","['Software developers', 'Task differences', 'Participation and engagement', 'Speed of task resolution', 'Mining software repositories', 'Empirical studies']"
9892,2104.14229,Nasser Ghadiri,"Hoda Memarzadeh, Nasser Ghadiri, Matthias Samwald and Maryam Lotfi
  Shahreza","A Study into patient similarity through representation learning from
  medical records",,,10.1007/s10115-022-01740-2,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Patient similarity assessment, which identifies patients similar to a given
patient, can help improve medical care. The assessment can be performed using
Electronic Medical Records (EMRs). Patient similarity measurement requires
converting heterogeneous EMRs into comparable formats to calculate their
distance. While versatile document representation learning methods have been
developed in recent years, it is still unclear how complex EMR data should be
processed to create the most useful patient representations. This study
presents a new data representation method for EMRs that takes the information
in clinical narratives into account. To address the limitations of previous
approaches in handling complex parts of EMR data, an unsupervised method is
proposed for building a patient representation, which integrates unstructured
data with structured data extracted from patients' EMRs. In order to model the
extracted data, we employed a tree structure that captures the temporal
relations of multiple medical events from EMR. We processed clinical notes to
extract symptoms, signs, and diseases using different tools such as medspaCy,
MetaMap, and scispaCy and mapped entities to the Unified Medical Language
System (UMLS). After creating a tree data structure, we utilized two novel
relabeling methods for the non-leaf nodes of the tree to capture two temporal
aspects of the extracted events. By traversing the tree, we generated a
sequence that could create an embedding vector for each patient. The
comprehensive evaluation of the proposed method for patient similarity and
mortality prediction tasks demonstrated that our proposed model leads to lower
mean squared error (MSE), higher precision, and normalized discounted
cumulative gain (NDCG) relative to baselines.
","[{'version': 'v1', 'created': 'Thu, 29 Apr 2021 09:38:14 GMT'}, {'version': 'v2', 'created': 'Sun, 10 Apr 2022 16:47:00 GMT'}, {'version': 'v3', 'created': 'Tue, 3 May 2022 19:53:25 GMT'}]",2022-09-20,"[['Memarzadeh', 'Hoda', ''], ['Ghadiri', 'Nasser', ''], ['Samwald', 'Matthias', ''], ['Shahreza', 'Maryam Lotfi', '']]","['Patient similarity analytics', 'Patient representation learning', 'Natural language processing', 'Health informatics']"
9893,2012.13376,Zhaobin Mo,"Zhaobin Mo, Xuan Di, Rongye Shi",A Physics-Informed Deep Learning Paradigm for Car-Following Models,,,10.1016/j.trc.2021.103240,,cs.LG eess.SP,http://creativecommons.org/licenses/by/4.0/,"  Car-following behavior has been extensively studied using physics-based
models, such as the Intelligent Driver Model. These models successfully
interpret traffic phenomena observed in the real-world but may not fully
capture the complex cognitive process of driving. Deep learning models, on the
other hand, have demonstrated their power in capturing observed traffic
phenomena but require a large amount of driving data to train. This paper aims
to develop a family of neural network based car-following models that are
informed by physics-based models, which leverage the advantage of both
physics-based (being data-efficient and interpretable) and deep learning based
(being generalizable) models. We design physics-informed deep learning
car-following (PIDL-CF) architectures encoded with two popular physics-based
models - IDM and OVM, on which acceleration is predicted for four traffic
regimes: acceleration, deceleration, cruising, and emergency braking. Two types
of PIDL-CFM problems are studied, one to predict acceleration only and the
other to jointly predict acceleration and discover model parameters. We also
demonstrate the superior performance of PIDL with the Next Generation
SIMulation (NGSIM) dataset over baselines, especially when the training data is
sparse. The results demonstrate the superior performance of neural networks
informed by physics over those without. The developed PIDL-CF framework holds
the potential for system identification of driving models and for the
development of driving-based controls for automated vehicles.
","[{'version': 'v1', 'created': 'Thu, 24 Dec 2020 18:04:08 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Dec 2020 22:56:35 GMT'}, {'version': 'v3', 'created': 'Thu, 27 May 2021 14:15:31 GMT'}, {'version': 'v4', 'created': 'Wed, 14 Jul 2021 00:54:45 GMT'}]",2021-07-15,"[['Mo', 'Zhaobin', ''], ['Di', 'Xuan', ''], ['Shi', 'Rongye', '']]","['Car-following models (CFM)', 'Physics-informed deep learning (PIDL)', 'Neural networks']"
9894,2203.12998,Linda Freienthal,"Marit Asula, Jane Makke, Linda Freienthal, Hele-Andra Kuulmets and
  Raul Sirel","Kratt: Developing an Automatic Subject Indexing Tool for The National
  Library of Estonia","This is a preprint version. It has 12 pages, 5 figures, 3 tables","Cataloging & Classification Quarterly (2021), 59:8, 775-793",10.1080/01639374.2021.1998283,,cs.CL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Manual subject indexing in libraries is a time-consuming and costly process
and the quality of the assigned subjects is affected by the cataloguer's
knowledge on the specific topics contained in the book. Trying to solve these
issues, we exploited the opportunities arising from artificial intelligence to
develop Kratt: a prototype of an automatic subject indexing tool. Kratt is able
to subject index a book independent of its extent and genre with a set of
keywords present in the Estonian Subject Thesaurus. It takes Kratt
approximately 1 minute to subject index a book, outperforming humans 10-15
times. Although the resulting keywords were not considered satisfactory by the
cataloguers, the ratings of a small sample of regular library users showed more
promise. We also argue that the results can be enhanced by including a bigger
corpus for training the model and applying more careful preprocessing
techniques.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2022 11:45:44 GMT'}]",2022-03-25,"[['Asula', 'Marit', ''], ['Makke', 'Jane', ''], ['Freienthal', 'Linda', ''], ['Kuulmets', 'Hele-Andra', ''], ['Sirel', 'Raul', '']]","['national libraries', 'automated subject indexing', 'machine learning', 'natural language processing', 'cataloguing']"
9895,2010.07899,Stelios Tsampas,"Stelios Tsampas, Christian Williams, Andreas Nuyts, Dominique
  Devriese, Frank Piessens",Abstract Congruence Criteria for Weak Bisimilarity,,,10.4230/LIPIcs.MFCS.2021.88,,cs.LO math.CT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce three general compositionality criteria over operational
semantics and prove that, when all three are satisfied together, they guarantee
weak bisimulation being a congruence. Our work is founded upon Turi and
Plotkin's mathematical operational semantics and the coalgebraic approach to
weak bisimulation by Brengos. We demonstrate each criterion with various
examples of success and failure and establish a formal connection with the
simply WB cool rule format of Bloom and van Glabbeek. In addition, we show that
the three criteria induce lax models in the sense of Bonchi et al.
","[{'version': 'v1', 'created': 'Thu, 15 Oct 2020 17:25:45 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Jul 2021 23:40:42 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Oct 2021 13:30:52 GMT'}]",2021-10-14,"[['Tsampas', 'Stelios', ''], ['Williams', 'Christian', ''], ['Nuyts', 'Andreas', ''], ['Devriese', 'Dominique', ''], ['Piessens', 'Frank', '']]","['Structural Operational Semantics', 'distributive laws', 'weak bisimilarity']"
9896,2011.07449,Devesh Walawalkar,"Devesh Walawalkar, Zhiqiang Shen, Marios Savvides",Online Ensemble Model Compression using Knowledge Distillation,,,10.1007/978-3-030-58529-7_2,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  This paper presents a novel knowledge distillation based model compression
framework consisting of a student ensemble. It enables distillation of
simultaneously learnt ensemble knowledge onto each of the compressed student
models. Each model learns unique representations from the data distribution due
to its distinct architecture. This helps the ensemble generalize better by
combining every model's knowledge. The distilled students and ensemble teacher
are trained simultaneously without requiring any pretrained weights. Moreover,
our proposed method can deliver multi-compressed students with single training,
which is efficient and flexible for different scenarios. We provide
comprehensive experiments using state-of-the-art classification models to
validate our framework's effectiveness. Notably, using our framework a 97%
compressed ResNet110 student model managed to produce a 10.64% relative
accuracy gain over its individual baseline training on CIFAR100 dataset.
Similarly a 95% compressed DenseNet-BC(k=12) model managed a 8.17% relative
accuracy gain.
","[{'version': 'v1', 'created': 'Sun, 15 Nov 2020 04:46:29 GMT'}]",2020-11-17,"[['Walawalkar', 'Devesh', ''], ['Shen', 'Zhiqiang', ''], ['Savvides', 'Marios', '']]","['Deep Model Compression', 'Image Classification', 'KnowledgeDistillation', 'Ensemble Deep Model Training']"
9897,2010.04147,Aleksei Shpilman,"Anna Nikiforovskaya, Nikolai Kapralov, Anna Vlasova, Oleg Shpynov and
  Aleksei Shpilman",Automatic generation of reviews of scientific papers,Accepted as a full paper at ICMLA2020,,10.1109/ICMLA51294.2020.00058,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With an ever-increasing number of scientific papers published each year, it
becomes more difficult for researchers to explore a field that they are not
closely familiar with already. This greatly inhibits the potential for
cross-disciplinary research. A traditional introduction into an area may come
in the form of a review paper. However, not all areas and sub-areas have a
current review. In this paper, we present a method for the automatic generation
of a review paper corresponding to a user-defined query. This method consists
of two main parts. The first part identifies key papers in the area by their
bibliometric parameters, such as a graph of co-citations. The second stage uses
a BERT based architecture that we train on existing reviews for extractive
summarization of these key papers. We describe the general pipeline of our
method and some implementation details and present both automatic and expert
evaluations on the PubMed dataset.
","[{'version': 'v1', 'created': 'Thu, 8 Oct 2020 17:47:07 GMT'}]",2021-06-08,"[['Nikiforovskaya', 'Anna', ''], ['Kapralov', 'Nikolai', ''], ['Vlasova', 'Anna', ''], ['Shpynov', 'Oleg', ''], ['Shpilman', 'Aleksei', '']]","['extractive summarization', 'natural language processing', 'BERT language model', 'scientific papers analysis']"
9898,2010.00536,Xing Liang,"Xing Liang, Anastassia Angelopoulou, Epaminondas Kapetanios, Bencie
  Woll, Reda Al-batat, Tyron Woolfe","A Multi-modal Machine Learning Approach and Toolkit to Automate
  Recognition of Early Stages of Dementia among British Sign Language Users",,"ECCV 2020 Workshops. Lecture Notes in Computer Science, Vol 12536.
  Springer, Cham",10.1007/978-3-030-66096-3_20,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ageing population trend is correlated with an increased prevalence of
acquired cognitive impairments such as dementia. Although there is no cure for
dementia, a timely diagnosis helps in obtaining necessary support and
appropriate medication. Researchers are working urgently to develop effective
technological tools that can help doctors undertake early identification of
cognitive disorder. In particular, screening for dementia in ageing Deaf
signers of British Sign Language (BSL) poses additional challenges as the
diagnostic process is bound up with conditions such as quality and availability
of interpreters, as well as appropriate questionnaires and cognitive tests. On
the other hand, deep learning based approaches for image and video analysis and
understanding are promising, particularly the adoption of Convolutional Neural
Network (CNN), which require large amounts of training data. In this paper,
however, we demonstrate novelty in the following way: a) a multi-modal machine
learning based automatic recognition toolkit for early stages of dementia among
BSL users in that features from several parts of the body contributing to the
sign envelope, e.g., hand-arm movements and facial expressions, are combined,
b) universality in that it is possible to apply our technique to users of any
sign language, since it is language independent, c) given the trade-off between
complexity and accuracy of machine learning (ML) prediction models as well as
the limited amount of training and testing data being available, we show that
our approach is not over-fitted and has the potential to scale up.
","[{'version': 'v1', 'created': 'Thu, 1 Oct 2020 16:35:48 GMT'}]",2021-01-06,"[['Liang', 'Xing', ''], ['Angelopoulou', 'Anastassia', ''], ['Kapetanios', 'Epaminondas', ''], ['Woll', 'Bencie', ''], ['Al-batat', 'Reda', ''], ['Woolfe', 'Tyron', '']]","['Hand Tracking', 'Facial Analysis', 'Convolutional Neural Network', 'Machine Learning', 'Sign Language', 'Dementia']"
9899,1307.2499,Shenggen Zheng,"Shenggen Zheng, Jozef Gruska and Daowen Qiu",On the state complexity of semi-quantum finite automata,19 pages. We improve (make stronger) the results in section 3,RAIRO-Theor. Inf. Appl. 48 (2014) 187-207,10.1051/ita/2014003,,cs.FL quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Some of the most interesting and important results concerning quantum finite
automata are those showing that they can recognize certain languages with
(much) less resources than corresponding classical finite automata
\cite{Amb98,Amb09,AmYa11,Ber05,Fre09,Mer00,Mer01,Mer02,Yak10,ZhgQiu112,Zhg12}.
This paper shows three results of such a type that are stronger in some sense
than other ones because (a) they deal with models of quantum automata with very
little quantumness (so-called semi-quantum one- and two-way automata with one
qubit memory only); (b) differences, even comparing with probabilistic
classical automata, are bigger than expected; (c) a trade-off between the
number of classical and quantum basis states needed is demonstrated in one case
and (d) languages (or the promise problem) used to show main results are very
simple and often explored ones in automata theory or in communication
complexity, with seemingly little structure that could be utilized.
","[{'version': 'v1', 'created': 'Tue, 9 Jul 2013 15:35:28 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Jan 2014 12:59:42 GMT'}]",2019-02-20,"[['Zheng', 'Shenggen', ''], ['Gruska', 'Jozef', ''], ['Qiu', 'Daowen', '']]","['Quantum computing', 'semi-quantum finite automata', 'state complexity']"
9900,2212.03957,Shahrzad Haddadan,"Suman K.Bera and Jayesh Choudhari and Shahrzad Haddadan and Sara
  Ahmadian",DeMEtRIS: Counting (near)-Cliques by Crawling,,,10.1145/3539597.3570438,,cs.DS,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We study the problem of approximately counting cliques and near cliques in a
graph, where the access to the graph is only available through crawling its
vertices; thus typically seeing only a small portion of it. This model, known
as the random walk model or the neighborhood query model has been introduced
recently and captures real-life scenarios in which the entire graph is too
massive to be stored as a whole or be scanned entirely and sampling vertices
independently is non-trivial in it. We introduce DeMEtRIS: Dense Motif
Estimation through Random Incident Sampling. This method provides a scalable
algorithm for clique and near clique counting in the random walk model. We
prove the correctness of our algorithm through rigorous mathematical analysis
and extensive experiments. Both our theoretical results and our experiments
show that DeMEtRIS obtains a high precision estimation by only crawling a
sub-linear portion on vertices, thus we demonstrate a significant improvement
over previously known results.
","[{'version': 'v1', 'created': 'Wed, 7 Dec 2022 21:10:18 GMT'}]",2022-12-09,"[['Bera', 'Suman K.', ''], ['Choudhari', 'Jayesh', ''], ['Haddadan', 'Shahrzad', ''], ['Ahmadian', 'Sara', '']]","['motif counting', 'random walk', 'sublinear']"
9901,2203.14303,Zhihao Wen,Zhihao Wen and Yuan Fang,"TREND: TempoRal Event and Node Dynamics for Graph Representation
  Learning",Accepted by WWW2022,,10.1145/3485447.3512164,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Temporal graph representation learning has drawn significant attention for
the prevalence of temporal graphs in the real world. However, most existing
works resort to taking discrete snapshots of the temporal graph, or are not
inductive to deal with new nodes, or do not model the exciting effects which is
the ability of events to influence the occurrence of another event. In this
work, We propose TREND, a novel framework for temporal graph representation
learning, driven by TempoRal Event and Node Dynamics and built upon a Hawkes
process-based graph neural network (GNN). TREND presents a few major
advantages: (1) it is inductive due to its GNN architecture; (2) it captures
the exciting effects between events by the adoption of the Hawkes process; (3)
as our main novelty, it captures the individual and collective characteristics
of events by integrating both event and node dynamics, driving a more precise
modeling of the temporal process. Extensive experiments on four real-world
datasets demonstrate the effectiveness of our proposed model.
","[{'version': 'v1', 'created': 'Sun, 27 Mar 2022 13:46:59 GMT'}]",2022-03-29,"[['Wen', 'Zhihao', ''], ['Fang', 'Yuan', '']]","['Temporal graphs', 'Hawkes process', 'GNN', 'event and node dynamics']"
9902,2001.00406,Ilias Tachmazidis,"Michael J. Maher, Ilias Tachmazidis, Grigoris Antoniou, Stephen Wade,
  Long Cheng",Rethinking Defeasible Reasoning: A Scalable Approach,"Under consideration in Theory and Practice of Logic Programming
  (TPLP)",Theory and Practice of Logic Programming 20 (2020) 552-586,10.1017/S1471068420000010,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent technological advances have led to unprecedented amounts of generated
data that originate from the Web, sensor networks and social media. Analytics
in terms of defeasible reasoning - for example for decision making - could
provide richer knowledge of the underlying domain. Traditionally, defeasible
reasoning has focused on complex knowledge structures over small to medium
amounts of data, but recent research efforts have attempted to parallelize the
reasoning process over theories with large numbers of facts. Such work has
shown that traditional defeasible logics come with overheads that limit
scalability. In this work, we design a new logic for defeasible reasoning, thus
ensuring scalability by design. We establish several properties of the logic,
including its relation to existing defeasible logics. Our experimental results
indicate that our approach is indeed scalable and defeasible reasoning can be
applied to billions of facts.
","[{'version': 'v1', 'created': 'Thu, 2 Jan 2020 12:00:49 GMT'}]",2021-02-16,"[['Maher', 'Michael J.', ''], ['Tachmazidis', 'Ilias', ''], ['Antoniou', 'Grigoris', ''], ['Wade', 'Stephen', ''], ['Cheng', 'Long', '']]","['Defeasible Reasoning', 'Parallel Reasoning', 'Scalability']"
9903,1905.10150,Yang Li,Yang Li and Xuanqin Mou,"Saliency detection based on structural dissimilarity induced by image
  quality assessment model","For associated source code, see https://github.com/yangli-xjtu/SDS",J. Electron. Imag. 28(2) 023025 (3 April 2019),10.1117/1.JEI.28.2.023025,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The distinctiveness of image regions is widely used as the cue of saliency.
Generally, the distinctiveness is computed according to the absolute difference
of features. However, according to the image quality assessment (IQA) studies,
the human visual system is highly sensitive to structural changes rather than
absolute difference. Accordingly, we propose the computation of the structural
dissimilarity between image patches as the distinctiveness measure for saliency
detection. Similar to IQA models, the structural dissimilarity is computed
based on the correlation of the structural features. The global structural
dissimilarity of a patch to all the other patches represents saliency of the
patch. We adopt two widely used structural features, namely the local contrast
and gradient magnitude, into the structural dissimilarity computation in the
proposed model. Without any postprocessing, the proposed model based on the
correlation of either of the two structural features outperforms 11
state-of-the-art saliency models on three saliency databases.
","[{'version': 'v1', 'created': 'Fri, 24 May 2019 11:13:14 GMT'}]",2019-05-27,"[['Li', 'Yang', ''], ['Mou', 'Xuanqin', '']]","['Saliency detection', 'image quality assessment', 'fixation prediction', 'distinctiveness']"
9904,2205.04359,Matthew Ivory,Matthew Ivory,"The Soft Skills of Software Learning Development: the Psychological
  Dimensions of Computing and Security Behaviours",,,10.1145/3530019.3535344,,cs.SE cs.HC,http://creativecommons.org/licenses/by/4.0/,"  When writing software code, developers typically prioritise functionality
over security, either consciously or unconsciously through biases and
heuristics. This is often attributed to tangible pressures such as client
requirements, but little is understood about the psychological dimensions
affecting security behaviours. There is an increasing demand for understanding
how psychological skills affect secure software development and to understand
how these skills themselves are developed during the learning process.
  This doctoral research explores this research space, with aims to identify
important workplace-based skills for software developers; to identify and
empirically investigate the soft skills behind these workplace skills in order
to understand how soft skills can influence security behaviours; and, to
identify ways to introduce and teach soft skills to computer science students
to prepare the future generation of software developers.
  The motivations behind this research are presented alongside the work plan.
Three distinct phases are introduced, along with planned analyses. Phase one is
currently in the data collection stage, with the second phase in planning.
Prior relevant work is highlighted, and the paper concludes with a presentation
of preliminary results and the planned next steps.
","[{'version': 'v1', 'created': 'Mon, 9 May 2022 14:59:31 GMT'}]",2022-05-10,"[['Ivory', 'Matthew', '']]","['Soft Skills', 'Cognitive Psychology', 'Security', 'Behavioural']"
9905,2103.11109,Boxin Wang,"Boxin Wang, Fan Wu, Yunhui Long, Luka Rimanic, Ce Zhang, Bo Li","DataLens: Scalable Privacy Preserving Training via Gradient Compression
  and Aggregation","Accepted to ACM CCS 2021. 23 pages, 4 figures, 12 tables",,10.1145/3460120.3484579,,cs.LG cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent success of deep neural networks (DNNs) hinges on the availability of
large-scale dataset; however, training on such dataset often poses privacy
risks for sensitive training information. In this paper, we aim to explore the
power of generative models and gradient sparsity, and propose a scalable
privacy-preserving generative model DATALENS. Comparing with the standard PATE
privacy-preserving framework which allows teachers to vote on one-dimensional
predictions, voting on the high dimensional gradient vectors is challenging in
terms of privacy preservation. As dimension reduction techniques are required,
we need to navigate a delicate tradeoff space between (1) the improvement of
privacy preservation and (2) the slowdown of SGD convergence. To tackle this,
we take advantage of communication efficient learning and propose a novel noise
compression and aggregation approach TOPAGG by combining top-k compression for
dimension reduction with a corresponding noise injection mechanism. We
theoretically prove that the DATALENS framework guarantees differential privacy
for its generated data, and provide analysis on its convergence. To demonstrate
the practical usage of DATALENS, we conduct extensive experiments on diverse
datasets including MNIST, Fashion-MNIST, and high dimensional CelebA, and we
show that, DATALENS significantly outperforms other baseline DP generative
models. In addition, we adapt the proposed TOPAGG approach, which is one of the
key building blocks in DATALENS, to DP SGD training, and show that it is able
to achieve higher utility than the state-of-the-art DP SGD approach in most
cases. Our code is publicly available at https://github.com/AI-secure/DataLens.
","[{'version': 'v1', 'created': 'Sat, 20 Mar 2021 06:14:19 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Apr 2021 18:53:31 GMT'}, {'version': 'v3', 'created': 'Fri, 7 May 2021 14:22:08 GMT'}, {'version': 'v4', 'created': 'Tue, 14 Sep 2021 07:19:10 GMT'}, {'version': 'v5', 'created': 'Mon, 10 Jan 2022 07:15:56 GMT'}, {'version': 'v6', 'created': 'Mon, 28 Mar 2022 02:08:31 GMT'}]",2022-03-29,"[['Wang', 'Boxin', ''], ['Wu', 'Fan', ''], ['Long', 'Yunhui', ''], ['Rimanic', 'Luka', ''], ['Zhang', 'Ce', ''], ['Li', 'Bo', '']]","['Differential Privacy', 'Generative Models', 'Gradient Compression']"
9906,2007.04828,Disheng Tang,"Disheng Tang, Wenbo Du, Louis Shekhtman, Yijie Wang, Shlomo Havlin,
  Xianbin Cao, Gang Yan",Predictability of real temporal networks,,"National Science Review, Volume 7, Issue 5, May 2020, Pages
  929-937",10.1093/nsr/nwaa015,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Links in most real networks often change over time. Such temporality of links
encodes the ordering and causality of interactions between nodes and has a
profound effect on network dynamics and function. Empirical evidences have
shown that the temporal nature of links in many real-world networks is not
random. Nonetheless, it is challenging to predict temporal link patterns while
considering the entanglement between topological and temporal link patterns.
Here we propose an entropy-rate based framework, based on combined
topological-temporal regularities, for quantifying the predictability of any
temporal network. We apply our framework on various model networks,
demonstrating that it indeed captures the intrinsic topological-temporal
regularities whereas previous methods considered only temporal aspects. We also
apply our framework on 18 real networks of different types and determine their
predictability. Interestingly, we find that for most real temporal networks,
despite the greater complexity of predictability brought by the increase in
dimension the combined topological-temporal predictability is higher than the
temporal predictability. Our results demonstrate the necessity of incorporating
both temporal and topological aspects of networks in order to improve
predictions of dynamical processes.
","[{'version': 'v1', 'created': 'Thu, 9 Jul 2020 14:22:21 GMT'}]",2020-07-10,"[['Tang', 'Disheng', ''], ['Du', 'Wenbo', ''], ['Shekhtman', 'Louis', ''], ['Wang', 'Yijie', ''], ['Havlin', 'Shlomo', ''], ['Cao', 'Xianbin', ''], ['Yan', 'Gang', '']]","['temporal network', 'predictability', 'network entropy', 'predictive algorithm']"
9907,2011.07876,Marco Huber,Nadia Burkart and Marco F. Huber,A Survey on the Explainability of Supervised Machine Learning,"Accepted for publication at the Journal of Artificial Intelligence
  Research (JAIR)","Journal of Artificial Intelligence Research (JAIR), 70:245-317,
  2021",10.1613/jair.1.12228,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predictions obtained by, e.g., artificial neural networks have a high
accuracy but humans often perceive the models as black boxes. Insights about
the decision making are mostly opaque for humans. Particularly understanding
the decision making in highly sensitive areas such as healthcare or fifinance,
is of paramount importance. The decision-making behind the black boxes requires
it to be more transparent, accountable, and understandable for humans. This
survey paper provides essential definitions, an overview of the different
principles and methodologies of explainable Supervised Machine Learning (SML).
We conduct a state-of-the-art survey that reviews past and recent explainable
SML approaches and classifies them according to the introduced definitions.
Finally, we illustrate principles by means of an explanatory case study and
discuss important future directions.
","[{'version': 'v1', 'created': 'Mon, 16 Nov 2020 11:25:39 GMT'}]",2021-01-21,"[['Burkart', 'Nadia', ''], ['Huber', 'Marco F.', '']]","['Explainability', 'Interpretability', 'Supervised Machine Learning', 'Automateddecision-making', 'Black Box']"
9908,2006.07954,Alexander Veretennikov Borisovich,Alexander B. Veretennikov,An efficient algorithm for three-component key index construction,"Indexing: Web of Science, Scopus","Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika.
  Komp'yuternye Nauki, 2019, vol. 29, issue 1, pp. 117-132",10.20537/vm190111,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, proximity full-text searches in large text arrays are
considered. A search query consists of several words. The search result is a
list of documents containing these words. In a modern search system, documents
that contain search query words that are near each other are more relevant than
documents that do not share this trait. To solve this task, for each word in
each indexed document, we need to store a record in the index. In this case,
the query search time is proportional to the number of occurrences of the
queried words in the indexed documents. Consequently, it is common for search
systems to evaluate queries that contain frequently occurring words much more
slowly than queries that contain less frequently occurring, ordinary words. For
each word in the text, we use additional indexes to store information about
nearby words at distances from the given word of less than or equal to
MaxDistance, which is a parameter. This parameter can take a value of 5, 7, or
even more. Three-component key indexes can be created for faster query
execution. Previously, we presented the results of experiments showing that
when queries contain very frequently occurring words, the average time of the
query execution with three-component key indexes is 94.7 times less than that
required when using ordinary inverted indexes. In the current work, we describe
a new three-component key index building algorithm and demonstrate the
correctness of the algorithm. We present the results of experiments creating
such an index that is dependent on the value of MaxDistance.
","[{'version': 'v1', 'created': 'Sun, 14 Jun 2020 16:52:07 GMT'}]",2020-06-28,"[['Veretennikov', 'Alexander B.', '']]","['full-text search', 'search engines', 'inverted files', 'additional indexes', 'proximity search', 'threecomponent key indexes']"
9909,1905.01752,Shivangi Srivastava,Shivangi Srivastava and John E. Vargas-Mu\~noz and Devis Tuia,"Understanding urban landuse from the above and ground perspectives: a
  deep learning, multimodal solution",,"Remote Sensing of Environment, 228, pages 129 - 143, 2019",10.1016/j.rse.2019.04.014,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Landuse characterization is important for urban planning. It is traditionally
performed with field surveys or manual photo interpretation, two practices that
are time-consuming and labor-intensive. Therefore, we aim to automate landuse
mapping at the urban-object level with a deep learning approach based on data
from multiple sources (or modalities). We consider two image modalities:
overhead imagery from Google Maps and ensembles of ground-based pictures
(side-views) per urban-object from Google Street View (GSV). These modalities
bring complementary visual information pertaining to the urban-objects. We
propose an end-to-end trainable model, which uses OpenStreetMap annotations as
labels. The model can accommodate a variable number of GSV pictures for the
ground-based branch and can also function in the absence of ground pictures at
prediction time. We test the effectiveness of our model over the area of
\^Ile-de-France, France, and test its generalization abilities on a set of
urban-objects from the city of Nantes, France. Our proposed multimodal
Convolutional Neural Network achieves considerably higher accuracies than
methods that use a single image modality, making it suitable for automatic
landuse map updates. Additionally, our approach could be easily scaled to
multiple cities, because it is based on data sources available for many cities
worldwide.
","[{'version': 'v1', 'created': 'Sun, 5 May 2019 21:36:59 GMT'}]",2019-05-07,"[['Srivastava', 'Shivangi', ''], ['Vargas-Muñoz', 'John E.', ''], ['Tuia', 'Devis', '']]","['Landuse characterization', 'convolutional neural networks', 'overhead']"
9910,2208.08612,Chen Yang,"Chen Yang and Yupeng Hou and Yang Song and Tao Zhang and Ji-Rong Wen
  and Wayne Xin Zhao",Modeling Two-Way Selection Preference for Person-Job Fit,"10 pages, Accepted by RecSys 2022",,10.1145/3523227.3546752,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Person-job fit is the core technique of online recruitment platforms, which
can improve the efficiency of recruitment by accurately matching the job
positions with the job seekers. Existing works mainly focus on modeling the
unidirectional process or overall matching. However, recruitment is a two-way
selection process, which means that both candidate and employer involved in the
interaction should meet the expectation of each other, instead of unilateral
satisfaction. In this paper, we propose a dual-perspective graph representation
learning approach to model directed interactions between candidates and jobs.
To model the two-way selection preference from the dual-perspective of job
seekers and employers, we incorporate two different nodes for each candidate
(or job) and characterize both successful matching and failed matching via a
unified dual-perspective interaction graph. To learn dual-perspective node
representations effectively, we design an effective optimization algorithm,
which involves a quadruple-based loss and a dual-perspective contrastive
learning loss. Extensive experiments on three large real-world recruitment
datasets have shown the effectiveness of our approach.
","[{'version': 'v1', 'created': 'Thu, 18 Aug 2022 03:16:11 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Aug 2022 15:10:46 GMT'}]",2022-08-22,"[['Yang', 'Chen', ''], ['Hou', 'Yupeng', ''], ['Song', 'Yang', ''], ['Zhang', 'Tao', ''], ['Wen', 'Ji-Rong', ''], ['Zhao', 'Wayne Xin', '']]","['person-job fit', 'graph neural network', 'contrastive learning']"
9911,2002.06311,Dongge Liu,"Dongge Liu, Gidon Ernst, Toby Murray, Benjamin I. P. Rubinstein",Legion: Best-First Concolic Testing,"12 pages, 2 Algorithms, 3 Figures, 2 Tables, ASE2020",,10.1145/3324884.3416629,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Concolic execution and fuzzing are two complementary coverage-based testing
techniques. How to achieve the best of both remains an open challenge. To
address this research problem, we propose and evaluate Legion. Legion
re-engineers the Monte Carlo tree search (MCTS) framework from the AI
literature to treat automated test generation as a problem of sequential
decision-making under uncertainty. Its best-first search strategy provides a
principled way to learn the most promising program states to investigate at
each search iteration, based on observed rewards from previous iterations.
Legion incorporates a form of directed fuzzing that we call approximate
path-preserving fuzzing (APPFuzzing) to investigate program states selected by
MCTS. APPFuzzing serves as the Monte Carlo simulation technique and is
implemented by extending prior work on constrained sampling. We evaluate Legion
against competitors on 2531 benchmarks from the coverage category of Test-Comp
2020, as well as measuring its sensitivity to hyperparameters, demonstrating
its effectiveness on a wide variety of input programs.
","[{'version': 'v1', 'created': 'Sat, 15 Feb 2020 03:35:11 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Sep 2020 04:14:13 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Sep 2020 02:06:37 GMT'}]",2020-09-24,"[['Liu', 'Dongge', ''], ['Ernst', 'Gidon', ''], ['Murray', 'Toby', ''], ['Rubinstein', 'Benjamin I. P.', '']]","['Concolic execution', 'constrained fuzzing', 'Monte Carlo tree search']"
9912,2007.14130,Alex Serban,"Alex Serban, Koen van der Blom, Holger Hoos, Joost Visser","Adoption and Effects of Software Engineering Best Practices in Machine
  Learning","Accepted and published at the ACM/IEEE International Symposium on
  Empirical Software Engineering and Measurement (ESEM) 2020",,10.1145/3382494.3410681,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  The increasing reliance on applications with machine learning (ML) components
calls for mature engineering techniques that ensure these are built in a robust
and future-proof manner. We aim to empirically determine the state of the art
in how teams develop, deploy and maintain software with ML components. We mined
both academic and grey literature and identified 29 engineering best practices
for ML applications. We conducted a survey among 313 practitioners to determine
the degree of adoption for these practices and to validate their perceived
effects. Using the survey responses, we quantified practice adoption,
differentiated along demographic characteristics, such as geography or team
size. We also tested correlations and investigated linear and non-linear
relationships between practices and their perceived effect using various
statistical models. Our findings indicate, for example, that larger teams tend
to adopt more practices, and that traditional software engineering practices
tend to have lower adoption than ML specific practices. Also, the statistical
models can accurately predict perceived effects such as agility, software
quality and traceability, from the degree of adoption for specific sets of
practices. Combining practice adoption rates with practice importance, as
revealed by statistical models, we identify practices that are important but
have low adoption, as well as practices that are widely adopted but are less
important for the effects we studied. Overall, our survey and the analysis of
responses received provide a quantitative basis for assessment and step-wise
improvement of practice adoption by ML teams.
","[{'version': 'v1', 'created': 'Tue, 28 Jul 2020 11:20:09 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jul 2020 13:28:39 GMT'}]",2020-07-30,"[['Serban', 'Alex', ''], ['van der Blom', 'Koen', ''], ['Hoos', 'Holger', ''], ['Visser', 'Joost', '']]","['survey', 'best practices', 'machine learning engineering']"
9913,2108.02050,Anwen Hu,"Anwen Hu, Shizhe Chen, Qin Jin",ICECAP: Information Concentrated Entity-aware Image Captioning,"9 pages, 7 figures, ACM MM 2020",,10.1145/3394171.3413576,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most current image captioning systems focus on describing general image
content, and lack background knowledge to deeply understand the image, such as
exact named entities or concrete events. In this work, we focus on the
entity-aware news image captioning task which aims to generate informative
captions by leveraging the associated news articles to provide background
knowledge about the target image. However, due to the length of news articles,
previous works only employ news articles at the coarse article or sentence
level, which are not fine-grained enough to refine relevant events and choose
named entities accurately. To overcome these limitations, we propose an
Information Concentrated Entity-aware news image CAPtioning (ICECAP) model,
which progressively concentrates on relevant textual information within the
corresponding news article from the sentence level to the word level. Our model
first creates coarse concentration on relevant sentences using a cross-modality
retrieval model and then generates captions by further concentrating on
relevant words within the sentences. Extensive experiments on both BreakingNews
and GoodNews datasets demonstrate the effectiveness of our proposed method,
which outperforms other state-of-the-arts. The code of ICECAP is publicly
available at https://github.com/HAWLYQ/ICECAP.
","[{'version': 'v1', 'created': 'Wed, 4 Aug 2021 13:27:51 GMT'}]",2021-08-05,"[['Hu', 'Anwen', ''], ['Chen', 'Shizhe', ''], ['Jin', 'Qin', '']]","['Image Captioning', 'Named Entity', 'Informative Image Captioning']"
9914,2107.08944,Tarik A. Rashid,Sabat Abdulhameed and Tarik A. Rashid,"Child Drawing Development Optimization Algorithm based on Child's
  Cognitive Development",21 pages,"Arabian Journal for Science and Engineering, 2021",10.1007/s13369-021-05928-6,,cs.NE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper proposes a novel metaheuristic Child Drawing Development
Optimization (CDDO) algorithm inspired by the child's learning behaviour and
cognitive development using the golden ratio to optimize the beauty behind
their art. The golden ratio was first introduced by the famous mathematician
Fibonacci. The ratio of two consecutive numbers in the Fibonacci sequence is
similar, and it is called the golden ratio, which is prevalent in nature, art,
architecture, and design. CDDO uses golden ratio and mimics cognitive learning
and child's drawing development stages starting from the scribbling stage to
the advanced pattern-based stage. Hand pressure width, length and golden ratio
of the child's drawing are tuned to attain better results. This helps children
with evolving, improving their intelligence and collectively achieving shared
goals. CDDO shows superior performance in finding the global optimum solution
for the optimization problems tested by 19 benchmark functions. Its results are
evaluated against more than one state of art algorithms such as PSO, DE, WOA,
GSA, and FEP. The performance of the CDDO is assessed, and the test result
shows that CDDO is relatively competitive through scoring 2.8 ranks. This
displays that the CDDO is outstandingly robust in exploring a new solution.
Also, it reveals the competency of the algorithm to evade local minima as it
covers promising regions extensively within the design space and exploits the
best solution.
","[{'version': 'v1', 'created': 'Wed, 30 Jun 2021 08:51:01 GMT'}]",2021-07-20,"[['Abdulhameed', 'Sabat', ''], ['Rashid', 'Tarik A.', '']]","['Nature-inspired algorithm', 'Metaheuristic algorithms', 'Optimization algorithms', 'Golden Ratio', 'Mathematical Models', 'Child Drawing']"
9915,1910.00400,Guido Cantelmo Dr,"Guido Cantelmo, Moeid Qurashi, A. Arun Prakash, Constantinos Antoniou,
  Francesco Viti",Incorporating Trip Chaining within Online Demand Estimation,"copyright 2019. This manuscript version is made available under the
  CC-BY-NC-ND 2.0 license http://creativecommons.org/licenses/by-nc-nd/2.0
  Article presented at 23rd International Symposium on Transportation and
  Traffic Theory, ISTTT 23, 24-26 July 2019, Lausanne, Switzerland",2019 Published to Transportation Research Part B: Methodological,10.1016/j.trb.2019.05.010,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Time-dependent Origin-Destination (OD) demand flows are fundamental inputs
for Dynamic Traffic Assignment (DTA) systems and real-time traffic management.
This work introduces a novel state-space framework to estimate these demand
flows in an online context. Specifically, we propose to explicitly include
trip-chaining behavior within the state-space formulation, which is solved
using the well-established Kalman Filtering technique. While existing works
already consider structural information and recursive behavior within the
online demand estimation problem, this information has been always considered
at the OD level. In this study, we introduce this structural information by
explicitly representing trip-chaining within the estimation framework. The
advantage is twofold. First, all trips belonging to the same tour can be
jointly calibrated. Second, given the estimation during a certain time
interval, a prediction of the structural deviation over the whole day can be
obtained without the need to run additional simulations. The effectiveness of
the proposed methodology is demonstrated first on a toy network and then on a
large real-world network. Results show that the model improves the prediction
performance with respect to a conventional Kalman Filtering approach. We also
show that, on the basis of the estimation of the morning commute, the model can
be used to predict the evening commute without need of running additional
simulations.
","[{'version': 'v1', 'created': 'Tue, 1 Oct 2019 14:04:18 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Oct 2019 19:07:52 GMT'}, {'version': 'v3', 'created': 'Wed, 20 Nov 2019 16:17:45 GMT'}]",2019-11-21,"[['Cantelmo', 'Guido', ''], ['Qurashi', 'Moeid', ''], ['Prakash', 'A. Arun', ''], ['Antoniou', 'Constantinos', ''], ['Viti', 'Francesco', '']]","['OD estimation', 'Online calibration', 'Simulation-based optimization', 'State-Space modelling', 'Kalman Filter', 'Activities', 'Trip Chain']"
9916,1904.08741,Nikolaj Tatti,"Nikolaj Tatti, Boris Cule",Mining Closed Episodes with Simultaneous Events,,,10.1145/2020408.2020589,,cs.DB cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sequential pattern discovery is a well-studied field in data mining. Episodes
are sequential patterns describing events that often occur in the vicinity of
each other. Episodes can impose restrictions to the order of the events, which
makes them a versatile technique for describing complex patterns in the
sequence. Most of the research on episodes deals with special cases such as
serial, parallel, and injective episodes, while discovering general episodes is
understudied.
  In this paper we extend the definition of an episode in order to be able to
represent cases where events often occur simultaneously. We present an
efficient and novel miner for discovering frequent and closed general episodes.
Such a task presents unique challenges. Firstly, we cannot define closure based
on frequency. We solve this by computing a more conservative closure that we
use to reduce the search space and discover the closed episodes as a
postprocessing step. Secondly, episodes are traditionally presented as directed
acyclic graphs. We argue that this representation has drawbacks leading to
redundancy in the output. We solve these drawbacks by defining a subset
relationship in such a way that allows us to remove the redundant episodes. We
demonstrate the efficiency of our algorithm and the need for using closed
episodes empirically on synthetic and real-world datasets.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2019 22:53:04 GMT'}]",2019-04-19,"[['Tatti', 'Nikolaj', ''], ['Cule', 'Boris', '']]","['Frequent episodes', 'Closed episodes', 'Depth-first search']"
9917,2104.04217,Eric Knauss,"Kai Stapel, Eric Knauss, Kurt Schneider, Nico Zazworka",FLOW Mapping: Planning and Managing Communication in Distributed Teams,"In: Proceedings of Sixth IEEE International Conference on Global
  Software Engineering, 2011",,10.1109/ICGSE.2011.9,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Distributed software development is more difficult than co-located software
development. One of the main reasons is that communication is more difficult in
distributed settings. Defined processes and artifacts help, but cannot cover
all information needs. Not communicating important project information,
decisions and rationales can result in duplicate or extra work, delays or even
project failure. Planning and managing a distributed project from an
information flow perspective helps to facilitate available communication
channels right from the start - beyond the documents and artifacts which are
defined for a given development process. In this paper we propose FLOW Mapping,
a systematic approach for planning and managing information flows in
distributed projects. We demonstrate the feasibility of our approach with a
case study in a distributed agile class room project. FLOW Mapping is
sufficient to plan communication and to measure conformance to the
communication strategy. We also discuss cost and impact of our approach.
","[{'version': 'v1', 'created': 'Fri, 9 Apr 2021 07:12:52 GMT'}]",2021-04-12,"[['Stapel', 'Kai', ''], ['Knauss', 'Eric', ''], ['Schneider', 'Kurt', ''], ['Zazworka', 'Nico', '']]","['global software engineering', 'distributed development', 'communication', 'media', 'information flow']"
9918,2010.04412,Yanhao Wang,Yanhao Wang and Francesco Fabbri and Michael Mathioudakis,Fair and Representative Subset Selection from Data Streams,"11 pages, 8 figures, to appear in the Web conference 2021 (WWW '21)",,10.1145/3442381.3449799,,cs.DS cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We study the problem of extracting a small subset of representative items
from a large data stream. In many data mining and machine learning applications
such as social network analysis and recommender systems, this problem can be
formulated as maximizing a monotone submodular function subject to a
cardinality constraint $k$. In this work, we consider the setting where data
items in the stream belong to one of several disjoint groups and investigate
the optimization problem with an additional \emph{fairness} constraint that
limits selection to a given number of items from each group. We then propose
efficient algorithms for the fairness-aware variant of the streaming submodular
maximization problem. In particular, we first give a $
(\frac{1}{2}-\varepsilon) $-approximation algorithm that requires $
O(\frac{1}{\varepsilon} \log \frac{k}{\varepsilon}) $ passes over the stream
for any constant $ \varepsilon>0 $. Moreover, we give a single-pass streaming
algorithm that has the same approximation ratio of $(\frac{1}{2}-\varepsilon)$
when unlimited buffer sizes and post-processing time are permitted, and discuss
how to adapt it to more practical settings where the buffer sizes are bounded.
Finally, we demonstrate the efficiency and effectiveness of our proposed
algorithms on two real-world applications, namely \emph{maximum coverage on
large graphs} and \emph{personalized recommendation}.
","[{'version': 'v1', 'created': 'Fri, 9 Oct 2020 07:49:13 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Feb 2021 09:04:12 GMT'}]",2021-02-15,"[['Wang', 'Yanhao', ''], ['Fabbri', 'Francesco', ''], ['Mathioudakis', 'Michael', '']]","['algorithmic fairness', 'approximation algorithm', 'data summarization', 'streaming algorithm', 'submodular maximization']"
9919,2104.00501,Alexander Renz-Wieland,"Alexander Renz-Wieland, Rainer Gemulla, Zoi Kaoudi, Volker Markl","NuPS: A Parameter Server for Machine Learning with Non-Uniform Parameter
  Access",SIGMOD '22,,10.1145/3514221.3517860,,cs.DB cs.DC cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Parameter servers (PSs) facilitate the implementation of distributed training
for large machine learning tasks. In this paper, we argue that existing PSs are
inefficient for tasks that exhibit non-uniform parameter access; their
performance may even fall behind that of single node baselines. We identify two
major sources of such non-uniform access: skew and sampling. Existing PSs are
ill-suited for managing skew because they uniformly apply the same parameter
management technique to all parameters. They are inefficient for sampling
because the PS is oblivious to the associated randomized accesses and cannot
exploit locality. To overcome these performance limitations, we introduce NuPS,
a novel PS architecture that (i) integrates multiple management techniques and
employs a suitable technique for each parameter and (ii) supports sampling
directly via suitable sampling primitives and sampling schemes that allow for a
controlled quality--efficiency trade-off. In our experimental study, NuPS
outperformed existing PSs by up to one order of magnitude and provided up to
linear scalability across multiple machine learning tasks.
","[{'version': 'v1', 'created': 'Thu, 1 Apr 2021 14:52:32 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Dec 2021 09:30:36 GMT'}, {'version': 'v3', 'created': 'Mon, 28 Mar 2022 07:36:27 GMT'}]",2022-03-29,"[['Renz-Wieland', 'Alexander', ''], ['Gemulla', 'Rainer', ''], ['Kaoudi', 'Zoi', ''], ['Markl', 'Volker', '']]","['parameter servers', 'distributed machine learning', 'large-scale machine learning', 'skew', 'sampling']"
9920,2003.01825,C\'edric Colas,"C\'edric Colas, Joost Huizinga, Vashisht Madhavan, Jeff Clune",Scaling MAP-Elites to Deep Neuroevolution,Accepted to GECCO 2020,,10.1145/3377930.3390217,,cs.NE cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quality-Diversity (QD) algorithms, and MAP-Elites (ME) in particular, have
proven very useful for a broad range of applications including enabling real
robots to recover quickly from joint damage, solving strongly deceptive maze
tasks or evolving robot morphologies to discover new gaits. However, present
implementations of MAP-Elites and other QD algorithms seem to be limited to
low-dimensional controllers with far fewer parameters than modern deep neural
network models. In this paper, we propose to leverage the efficiency of
Evolution Strategies (ES) to scale MAP-Elites to high-dimensional controllers
parameterized by large neural networks. We design and evaluate a new hybrid
algorithm called MAP-Elites with Evolution Strategies (ME-ES) for post-damage
recovery in a difficult high-dimensional control task where traditional ME
fails. Additionally, we show that ME-ES performs efficient exploration, on par
with state-of-the-art exploration algorithms in high-dimensional control tasks
with strongly deceptive rewards.
","[{'version': 'v1', 'created': 'Tue, 3 Mar 2020 23:02:37 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Apr 2020 08:53:53 GMT'}, {'version': 'v3', 'created': 'Fri, 5 Jun 2020 15:59:15 GMT'}]",2020-06-08,"[['Colas', 'Cédric', ''], ['Huizinga', 'Joost', ''], ['Madhavan', 'Vashisht', ''], ['Clune', 'Jeff', '']]","['Quality-Diversity', 'Evolution Strategies', 'Map-Elites', 'Exploration']"
9921,2104.12131,Stephen MacDonell,"Sherlock A. Licorish, Stephen G. MacDonell","Exploring the links between software development task type, team
  attitudes and task completion performance: Insights from the Jazz repository","Journal Paper, 19 pages, 3 figures, 8 tables","Information and Software Technology 97(2018), pp.10-25",10.1016/j.infsof.2017.12.005,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: In seeking to better understand the impact of various human factors
in software development, and how teams' attitudes relate to their performance,
increasing attention is being given to the study of team-related artefacts. In
particular, researchers have conducted numerous studies on a range of team
communication channels to explore links between developers' language use and
the incidence of software bugs in the products they delivered. Comparatively
limited attention has been paid, however, to the full range of software tasks
that are commonly performed during the development and delivery of software
systems, in spite of compelling evidence pointing to the need to understand
teams' attitudes more widely. Objective: We were therefore motivated to study
the relationships between task type and team attitudes, and how attitudes
expressed in teams' communications might be related to their task completion
performance when undertaking a range of activities. Method: Our investigation
involved artefacts from 474 IBM Jazz practitioners assembled in 149 teams
working on around 30,000 software development tasks over a three-year period.
We applied linguistic analysis, standard statistical techniques and directed
content analysis to address our research objective. Results: Our evidence
revealed that teams expressed different attitudes when working on various forms
of software tasks, and they were particularly emotional when working to remedy
defects. That said, teams' expression of attitudes was not found to be a strong
predictor of their task completion performance. Conclusion: Efforts aimed at
reducing bug incidence may positively limit teams' emotional disposition when
resolving bugs, thereby reducing the otherwise high demand for emotionally
stable members. (Abridged)
","[{'version': 'v1', 'created': 'Sun, 25 Apr 2021 11:15:06 GMT'}]",2021-04-27,"[['Licorish', 'Sherlock A.', ''], ['MacDonell', 'Stephen G.', '']]","['Task type', 'Team attitudes', 'Task completion performance', 'Software project']"
9922,2106.07303,"Alexander Schl\""ogl","Alexander Schl\""ogl, Tobias Kupek, Rainer B\""ohme",iNNformant: Boundary Samples as Telltale Watermarks,Will be presented at IH&MMSEC '21,,10.1145/3437880.3460411,,cs.LG cs.CR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Boundary samples are special inputs to artificial neural networks crafted to
identify the execution environment used for inference by the resulting output
label. The paper presents and evaluates algorithms to generate transparent
boundary samples. Transparency refers to a small perceptual distortion of the
host signal (i.e., a natural input sample). For two established image
classifiers, ResNet on FMNIST and CIFAR10, we show that it is possible to
generate sets of boundary samples which can identify any of four tested
microarchitectures. These sets can be built to not contain any sample with a
worse peak signal-to-noise ratio than 70dB. We analyze the relationship between
search complexity and resulting transparency.
","[{'version': 'v1', 'created': 'Mon, 14 Jun 2021 11:18:32 GMT'}]",2021-06-15,"[['Schlögl', 'Alexander', ''], ['Kupek', 'Tobias', ''], ['Böhme', 'Rainer', '']]","['watermarking', 'neural networks', 'forensics', 'adversarial machinelearning']"
9923,2207.08537,Alexey Kurennoy,"Alexey Kurennoy, John Coleman, Ian Harris, Alice Lynch, Oisin Mac
  Fhearai, Daphne Tsatsoulis",A General Framework for Pairwise Unbiased Learning to Rank,10 pages,,10.1145/3539813.3545119,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Pairwise debiasing is one of the most effective strategies in reducing
position bias in learning-to-rank (LTR) models. However, limiting the scope of
this strategy, are the underlying assumptions required by many pairwise
debiasing approaches. In this paper, we develop an approach based on a
minimalistic set of assumptions that can be applied to a much broader range of
user browsing patterns and arbitrary presentation layouts. We implement the
approach as a simplified version of the Unbiased LambdaMART and demonstrate
that it retains the underlying unbiasedness property in a wider variety of
settings than the original algorithm. Finally, using simulations with ""golden""
relevance labels, we will show that the simplified version compares favourably
with the original Unbiased LambdaMART when the examination of different
positions in a ranked list is not assumed to be independent.
","[{'version': 'v1', 'created': 'Mon, 18 Jul 2022 11:59:20 GMT'}]",2022-07-19,"[['Kurennoy', 'Alexey', ''], ['Coleman', 'John', ''], ['Harris', 'Ian', ''], ['Lynch', 'Alice', ''], ['Mac Fhearai', 'Oisin', ''], ['Tsatsoulis', 'Daphne', '']]","['ranking', 'position bias', 'unbiased learning-to-rank', 'pairwise debiasing']"
9924,2301.06876,Junjie Xu H.,Junjie H. Xu and Yu Nakano and Lingrong Kong and Kojiro Iizuka,"CS-lol: a Dataset of Viewer Comment with Scene in E-sports
  Live-streaming","5 pages, 3 figures, In ACM SIGIR Conference on Human Information
  Interaction and Retrieval (CHIIR 23)",,10.1145/3576840.3578334,,cs.MM cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Billions of live-streaming viewers share their opinions on scenes they are
watching in real-time and interact with the event, commentators as well as
other viewers via text comments. Thus, there is necessary to explore viewers'
comments with scenes in E-sport live-streaming events. In this paper, we
developed CS-lol, a new large-scale dataset containing comments from viewers
paired with descriptions of game scenes in E-sports live-streaming. Moreover,
we propose a task, namely viewer comment retrieval, to retrieve the viewer
comments for the scene of the live-streaming event. Results on a series of
baseline retrieval methods derived from typical IR evaluation methods show our
task as a challenging task. Finally, we release CS-lol and baseline
implementation to the research community as a resource.
","[{'version': 'v1', 'created': 'Tue, 17 Jan 2023 13:34:06 GMT'}]",2023-01-18,"[['Xu', 'Junjie H.', ''], ['Nakano', 'Yu', ''], ['Kong', 'Lingrong', ''], ['Iizuka', 'Kojiro', '']]","['dataset', 'viewer comment with scene', 'E-sports live-streaming']"
9925,1805.02763,Junjie Wang,"Junjie Wang and Mingyang Li and Song Wang and Tim Menzies and Qing
  Wang",Cutting Away the Confusion From Crowdtesting,12 pages,Information and Software Technology. 110 (2019). 139-155,10.1016/j.infsof.2019.03.003,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crowdtesting is effective especially when it comes to the feedback on GUI
systems, or subjective opinions about features. Despite of this, we find
crowdtesting reports are highly replicated, i.e., 82% of them are replicates of
others. Hence automatically detecting replicate reports could help reduce
triaging efforts. Most of the existing approaches mainly adopted textual
information for replicate detection, and suffered from low accuracy because of
the expression gap. Our observation on real industrial crowdtesting data found
that when dealing with crowdtesting reports of GUI systems, the reports would
accompanied with images, i.e., the screenshots of the app. We assume the
screenshot to be valuable for replicate crowdtesting report detection because
it reflects the real scenario of the failure and is not affected by the variety
of natural languages.
  In this work, we propose a replicate detection approach, TSDetector, which
combines information from the screenshots and the textual descriptions to
detect replicate crowdtesting reports. We extract four types of features to
characterize the screenshots and the textual descriptions, and design an
algorithm to detect replicates based on four similarity scores derived from the
four different features respectively. We investigate the effectiveness and
advantage of TSDetector on 15 commercial projects with 4,172 reports from one
of the Chinese largest crowdtesting platforms.Results show that TSDetector can
outperform existing state-of-the-art approaches significantly. In addition, we
also evaluate its usefulness using real-world case studies. The feedback from
real-world testers demonstrates its practical value
","[{'version': 'v1', 'created': 'Mon, 7 May 2018 21:49:46 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Nov 2018 08:51:35 GMT'}]",2019-04-19,"[['Wang', 'Junjie', ''], ['Li', 'Mingyang', ''], ['Wang', 'Song', ''], ['Menzies', 'Tim', ''], ['Wang', 'Qing', '']]","['Crowdtesting', 'Duplicate report', 'Similarity detection']"
9926,1710.02823,Markku Hinkka,"Markku Hinkka, Teemu Lehto, Keijo Heljanko, Alexander Jung",Structural Feature Selection for Event Logs,"Extended version of a paper published in the proceedings of the BPM
  2017 workshops",,10.1007/978-3-319-74030-0_2,,cs.LG cs.DB cs.SE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of classifying business process instances based on
structural features derived from event logs. The main motivation is to provide
machine learning based techniques with quick response times for interactive
computer assisted root cause analysis. In particular, we create structural
features from process mining such as activity and transition occurrence counts,
and ordering of activities to be evaluated as potential features for
classification. We show that adding such structural features increases the
amount of information thus potentially increasing classification accuracy.
However, there is an inherent trade-off as using too many features leads to too
long run-times for machine learning classification models. One way to improve
the machine learning algorithms' run-time is to only select a small number of
features by a feature selection algorithm. However, the run-time required by
the feature selection algorithm must also be taken into account. Also, the
classification accuracy should not suffer too much from the feature selection.
The main contributions of this paper are as follows: First, we propose and
compare six different feature selection algorithms by means of an experimental
setup comparing their classification accuracy and achievable response times.
Second, we discuss the potential use of feature selection results for computer
assisted root cause analysis as well as the properties of different types of
structural features in the context of feature selection.
","[{'version': 'v1', 'created': 'Sun, 8 Oct 2017 11:38:37 GMT'}, {'version': 'v2', 'created': 'Thu, 17 May 2018 08:54:22 GMT'}]",2018-05-18,"[['Hinkka', 'Markku', ''], ['Lehto', 'Teemu', ''], ['Heljanko', 'Keijo', ''], ['Jung', 'Alexander', '']]","['automatic business process discovery', 'process mining', 'prediction', 'classification', 'machine learning', 'clustering', 'feature selection']"
9927,2006.09766,Anton Alekseev,"Anton Alekseev, Elena Tutubalina, Valentin Malykh, Sergey Nikolenko","Improving unsupervised neural aspect extraction for online discussions
  using out-of-domain classification","Journal of Intelligent & Fuzzy Systems, pre-press,
  https://content.iospress.com/articles/journal-of-intelligent-and-fuzzy-systems/ifs179908",,10.3233/JIFS-179908,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning architectures based on self-attention have recently achieved
and surpassed state of the art results in the task of unsupervised aspect
extraction and topic modeling. While models such as neural attention-based
aspect extraction (ABAE) have been successfully applied to user-generated
texts, they are less coherent when applied to traditional data sources such as
news articles and newsgroup documents. In this work, we introduce a simple
approach based on sentence filtering in order to improve topical aspects
learned from newsgroups-based content without modifying the basic mechanism of
ABAE. We train a probabilistic classifier to distinguish between out-of-domain
texts (outer dataset) and in-domain texts (target dataset). Then, during data
preparation we filter out sentences that have a low probability of being
in-domain and train the neural model on the remaining sentences. The positive
effect of sentence filtering on topic coherence is demonstrated in comparison
to aspect extraction models trained on unfiltered texts.
","[{'version': 'v1', 'created': 'Wed, 17 Jun 2020 10:34:16 GMT'}]",2020-06-18,"[['Alekseev', 'Anton', ''], ['Tutubalina', 'Elena', ''], ['Malykh', 'Valentin', ''], ['Nikolenko', 'Sergey', '']]","['aspect extraction', 'out-of-domain classification', 'deep learning', 'topic models', 'topic coherence']"
9928,1906.02989,Mital Kinderkhedia,Mital Kinderkhedia,Learning Representations of Graph Data -- A Survey,,,10.13140/RG.2.2.33978.64961/1,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep Neural Networks have shown tremendous success in the area of object
recognition, image classification and natural language processing. However,
designing optimal Neural Network architectures that can learn and output
arbitrary graphs is an ongoing research problem. The objective of this survey
is to summarize and discuss the latest advances in methods to Learn
Representations of Graph Data. We start by identifying commonly used types of
graph data and review basics of graph theory. This is followed by a discussion
of the relationships between graph kernel methods and neural networks. Next we
identify the major approaches used for learning representations of graph data
namely: Kernel approaches, Convolutional approaches, Graph neural networks
approaches, Graph embedding approaches and Probabilistic approaches. A variety
of methods under each of the approaches are discussed and the survey is
concluded with a brief discussion of the future of learning representation of
graph data.
","[{'version': 'v1', 'created': 'Fri, 7 Jun 2019 09:52:53 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Jul 2019 16:26:01 GMT'}]",2019-07-02,"[['Kinderkhedia', 'Mital', '']]","['Graph structured data', 'Graph representations', 'Graph-based neural networks', 'Graph embedding', 'GraphConvolutions']"
9929,1907.04924,Xichen Ding,"Xichen Ding, Jie Tang, Tracy Liu, Cheng Xu, Yaping Zhang, Feng Shi,
  Qixia Jiang, Dan Shen",Infer Implicit Contexts in Real-time Online-to-Offline Recommendation,"9 pages,KDD,KDD2019",,10.1145/3292500.3330716,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding users' context is essential for successful recommendations,
especially for Online-to-Offline (O2O) recommendation, such as Yelp, Groupon,
and Koubei. Different from traditional recommendation where individual
preference is mostly static, O2O recommendation should be dynamic to capture
variation of users' purposes across time and location. However, precisely
inferring users' real-time contexts information, especially those implicit
ones, is extremely difficult, and it is a central challenge for O2O
recommendation. In this paper, we propose a new approach, called Mixture
Attentional Constrained Denoise AutoEncoder (MACDAE), to infer implicit
contexts and consequently, to improve the quality of real-time O2O
recommendation. In MACDAE, we first leverage the interaction among users,
items, and explicit contexts to infer users' implicit contexts, then combine
the learned implicit-context representation into an end-to-end model to make
the recommendation. MACDAE works quite well in the real system. We conducted
both offline and online evaluations of the proposed approach. Experiments on
several real-world datasets (Yelp, Dianping, and Koubei) show our approach
could achieve significant improvements over state-of-the-arts. Furthermore,
online A/B test suggests a 2.9% increase for click-through rate and 5.6%
improvement for conversion rate in real-world traffic. Our model has been
deployed in the product of ""Guess You Like"" recommendation in Koubei.
","[{'version': 'v1', 'created': 'Mon, 8 Jul 2019 05:37:30 GMT'}]",2019-07-12,"[['Ding', 'Xichen', ''], ['Tang', 'Jie', ''], ['Liu', 'Tracy', ''], ['Xu', 'Cheng', ''], ['Zhang', 'Yaping', ''], ['Shi', 'Feng', ''], ['Jiang', 'Qixia', ''], ['Shen', 'Dan', '']]","['online-to-ofine recommendation', 'implicit context', 'atention']"
9930,2108.07057,Gordon Fraser,"Isabella Gra{\ss}l, Katharina Geldreich, Gordon Fraser","Data-driven Analysis of Gender Differences and Similarities in Scratch
  Programs","To be published in the proceedings of the 16th Workshop in Primary
  and Secondary Computing Education (WIPSCE)",,10.1145/3481312.3481345,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Block-based programming environments such as Scratch are an essential entry
point to computer science. In order to create an effective learning environment
that has the potential to address the gender imbalance in computer science, it
is essential to better understand gender-specific differences in how children
use such programming environments. In this paper, we explore gender differences
and similarities in Scratch programs along two dimensions: In order to
understand what motivates girls and boys to use Scratch, we apply a topic
analysis using unsupervised machine learning for the first time on Scratch
programs, using a dataset of 317 programs created by girls and boys in the
range of 8-10 years. In order to understand how they program for these topics,
we apply automated program analysis on the code implemented in these projects.
We find that, in-line with common stereotypes, girls prefer topics that revolve
around unicorns, celebrating, dancing and music, while boys tend to prefer
gloomy topics with bats and ghouls, or competitive ones such as soccer or
basketball. Girls prefer animations and stories, resulting in simpler control
structures, while boys create games with more loops and conditional statements,
resulting in more complex programs. Considering these differences can help to
improve the learning outcomes and the resulting computing-related
self-concepts, which are prerequisites for developing a longer-term interest in
computer science.
","[{'version': 'v1', 'created': 'Mon, 16 Aug 2021 12:49:43 GMT'}]",2021-08-17,"[['Graßl', 'Isabella', ''], ['Geldreich', 'Katharina', ''], ['Fraser', 'Gordon', '']]","['Scratch', 'gender', 'topic modeling', 'automated code analysis']"
9931,2202.08174,Yuchen Zhao,"Yuchen Zhao, Sayed Saad Afzal, Waleed Akbar, Osvy Rodriguez, Fan Mo,
  David Boyle, Fadel Adib, Hamed Haddadi","Towards Battery-Free Machine Learning and Inference in Underwater
  Environments","6 pages, HotMobile '22, March 9-10, 2022, Tempe, AZ, USA",,10.1145/3508396.3512877,,cs.LG eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is motivated by a simple question: Can we design and build
battery-free devices capable of machine learning and inference in underwater
environments? An affirmative answer to this question would have significant
implications for a new generation of underwater sensing and monitoring
applications for environmental monitoring, scientific exploration, and
climate/weather prediction.
  To answer this question, we explore the feasibility of bridging advances from
the past decade in two fields: battery-free networking and low-power machine
learning. Our exploration demonstrates that it is indeed possible to enable
battery-free inference in underwater environments. We designed a device that
can harvest energy from underwater sound, power up an ultra-low-power
microcontroller and on-board sensor, perform local inference on sensed
measurements using a lightweight Deep Neural Network, and communicate the
inference result via backscatter to a receiver. We tested our prototype in an
emulated marine bioacoustics application, demonstrating the potential to
recognize underwater animal sounds without batteries. Through this exploration,
we highlight the challenges and opportunities for making underwater
battery-free inference and machine learning ubiquitous.
","[{'version': 'v1', 'created': 'Wed, 16 Feb 2022 16:26:02 GMT'}]",2022-02-17,"[['Zhao', 'Yuchen', ''], ['Afzal', 'Sayed Saad', ''], ['Akbar', 'Waleed', ''], ['Rodriguez', 'Osvy', ''], ['Mo', 'Fan', ''], ['Boyle', 'David', ''], ['Adib', 'Fadel', ''], ['Haddadi', 'Hamed', '']]","['battery-free networking', 'machine learning', 'underwater sensing']"
9932,2205.09682,Igor Sfiligoi,"Emily A. Belli, Jeff Candy, Igor Sfiligoi and Frank W\""urthwein","Comparing single-node and multi-node performance of an important fusion
  HPC code benchmark","6 pages, 1 table, 1 figure, to be published in proceedings of PEARC22","PEARC '22: Practice and Experience in Advanced Research Computing
  (2022) 10 1-4",10.1145/3491418.3535130,,cs.DC physics.plasm-ph,http://creativecommons.org/licenses/by-sa/4.0/,"  Fusion simulations have traditionally required the use of leadership scale
High Performance Computing (HPC) resources in order to produce advances in
physics. The impressive improvements in compute and memory capacity of many-GPU
compute nodes are now allowing for some problems that once required a
multi-node setup to be also solvable on a single node. When possible, the
increased interconnect bandwidth can result in order of magnitude higher
science throughput, especially for communication-heavy applications. In this
paper we analyze the performance of the fusion simulation tool CGYRO, an
Eulerian gyrokinetic turbulence solver designed and optimized for collisional,
electromagnetic, multiscale simulation, which is widely used in the fusion
research community. Due to the nature of the problem, the application has to
work on a large multi-dimensional computational mesh as a whole, requiring
frequent exchange of large amounts of data between the compute processes. In
particular, we show that the average-scale nl03 benchmark CGYRO simulation can
be run at an acceptable speed on a single Google Cloud instance with 16 A100
GPUs, outperforming 8 NERSC Perlmutter Phase1 nodes, 16 ORNL Summit nodes and
256 NERSC Cori nodes. Moving from a multi-node to a single-node GPU setup we
get comparable simulation times using less than half the number of GPUs. Larger
benchmark problems, however, still require a multi-node HPC setup due to GPU
memory capacity needs, since at the time of writing no vendor offers nodes with
a sufficient GPU memory setup. The upcoming external NVSWITCH does however
promise to deliver an almost equivalent solution for up to 256 NVIDIA GPUs.
","[{'version': 'v1', 'created': 'Thu, 19 May 2022 16:40:06 GMT'}]",2022-07-12,"[['Belli', 'Emily A.', ''], ['Candy', 'Jeff', ''], ['Sfiligoi', 'Igor', ''], ['Würthwein', 'Frank', '']]","['High Performance Computing', 'interconnect bandwidth', 'benchmarking', 'Fusion science']"
9933,1506.05690,Diego Amancio Dr.,"Filipi N. Silva, Diego R. Amancio, Maria Bardosova, Osvaldo N.
  Oliveira Jr., Luciano da F. Costa","Using network science and text analytics to produce surveys in a
  scientific topic",,Journal of Informetrics 10 (2016) pp. 487-502,10.1016/j.joi.2016.03.008,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of science to understand its own structure is becoming popular, but
understanding the organization of knowledge areas is still limited because some
patterns are only discoverable with proper computational treatment of
large-scale datasets. In this paper, we introduce a network-based methodology
combined with text analytics to construct the taxonomy of science fields. The
methodology is illustrated with application to two topics: complex networks
(CN) and photonic crystals (PC). We built citation networks using data from the
Web of Science and used a community detection algorithm for partitioning to
obtain science maps of the fields considered. We also created an importance
index for text analytics in order to obtain keywords that define the
communities. A dendrogram of the relatedness among the subtopics was also
obtained. Among the interesting patterns that emerged from the analysis, we
highlight the identification of two well-defined communities in PC area, which
is consistent with the known existence of two distinct communities of
researchers in the area: telecommunication engineers and physicists. With the
methodology, it was also possible to assess the interdisciplinary and time
evolution of subtopics defined by the keywords. The automatic tools described
here are potentially useful not only to provide an overview of scientific areas
but also to assist scientists in performing systematic research on a specific
topic.
","[{'version': 'v1', 'created': 'Thu, 18 Jun 2015 14:20:54 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Mar 2016 14:20:16 GMT'}]",2016-04-25,"[['Silva', 'Filipi N.', ''], ['Amancio', 'Diego R.', ''], ['Bardosova', 'Maria', ''], ['Oliveira', 'Osvaldo N.', 'Jr.'], ['Costa', 'Luciano da F.', '']]","['entropy', 'networks', 'scientific map', 'photonic crystals', 'pattern recognition']"
9934,2104.06913,Igor Sfiligoi,"Igor Sfiligoi, Michael Hare, David Schultz, Frank W\""urthwein,
  Benedikt Riedel, Tom Hutton, Steve Barnet and Vladimir Brik","Managing Cloud networking costs for data-intensive applications by
  provisioning dedicated network links","8 pages, 7 figures, 4 tables, to be published in proceedings of
  PEARC21",,10.1145/3437359.3465563,,cs.NI cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Many scientific high-throughput applications can benefit from the elastic
nature of Cloud resources, especially when there is a need to reduce time to
completion. Cost considerations are usually a major issue in such endeavors,
with networking often a major component; for data-intensive applications,
egress networking costs can exceed the compute costs. Dedicated network links
provide a way to lower the networking costs, but they do add complexity. In
this paper we provide a description of a 100 fp32 PFLOPS Cloud burst in support
of IceCube production compute, that used Internet2 Cloud Connect service to
provision several logically-dedicated network links from the three major Cloud
providers, namely Amazon Web Services, Microsoft Azure and Google Cloud
Platform, that in aggregate enabled approximately 100 Gbps egress capability to
on-prem storage. It provides technical details about the provisioning process,
the benefits and limitations of such a setup and an analysis of the costs
incurred.
","[{'version': 'v1', 'created': 'Wed, 14 Apr 2021 15:03:45 GMT'}]",2021-07-21,"[['Sfiligoi', 'Igor', ''], ['Hare', 'Michael', ''], ['Schultz', 'David', ''], ['Würthwein', 'Frank', ''], ['Riedel', 'Benedikt', ''], ['Hutton', 'Tom', ''], ['Barnet', 'Steve', ''], ['Brik', 'Vladimir', '']]","['Cloud', 'networking', 'astrophysics']"
9935,1602.03995,Alexandre de Siqueira,"Alexandre Fioravante de Siqueira, Wagner Massayuki Nakasuga, Aylton
  Pagamisse, Carlos Alberto Tello Saenz, Aldo Eloizo Job","An automatic method for segmentation of fission tracks in epidote
  crystal photomicrographs","16 pages, 5 figures","Computers & Geosciences, v. 69, pp. 55-61, aug 2014",10.1016/j.cageo.2014.04.008,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Manual identification of fission tracks has practical problems, such as
variation due to observer-observation efficiency. An automatic processing
method that could identify fission tracks in a photomicrograph could solve this
problem and improve the speed of track counting. However, separation of
non-trivial images is one of the most difficult tasks in image processing.
Several commercial and free softwares are available, but these softwares are
meant to be used in specific images. In this paper, an automatic method based
on starlet wavelets is presented in order to separate fission tracks in mineral
photomicrographs. Automatization is obtained by Matthews correlation
coefficient, and results are evaluated by precision, recall and accuracy. This
technique is an improvement of a method aimed at segmentation of scanning
electron microscopy images. This method is applied in photomicrographs of
epidote phenocrystals, in which accuracy higher than 89% was obtained in
fission track segmentation, even for difficult images. Algorithms corresponding
to the proposed method are available for download. Using the method presented
here, an user could easily determine fission tracks in photomicrographs of
mineral samples.
","[{'version': 'v1', 'created': 'Fri, 12 Feb 2016 10:05:24 GMT'}]",2016-02-15,"[['de Siqueira', 'Alexandre Fioravante', ''], ['Nakasuga', 'Wagner Massayuki', ''], ['Pagamisse', 'Aylton', ''], ['Saenz', 'Carlos Alberto Tello', ''], ['Job', 'Aldo Eloizo', '']]","['Epidote', 'Fission Track', 'Image Processing', 'Optical Microscopy', 'Wavelets']"
9936,2008.04176,Triet Le,"Triet H. M. Le, Roland Croft, David Hin, M. Ali Babar","A Large-scale Study of Security Vulnerability Support on Developer Q&A
  Websites","Accepted for publication at the 25th International Conference on
  Evaluation and Assessment in Software Engineering (EASE 2021)",,10.1145/3463274.3463331,,cs.SE cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Context: Security Vulnerabilities (SVs) pose many serious threats to software
systems. Developers usually seek solutions to addressing these SVs on developer
Question and Answer (Q&A) websites. However, there is still little known about
on-going SV-specific discussions on different developer Q&A sites. Objective:
We present a large-scale empirical study to understand developers' SV
discussions and how these discussions are being supported by Q&A sites. Method:
We first curate 71,329 SV posts from two large Q&A sites, namely Stack Overflow
(SO) and Security StackExchange (SSE). We then use topic modeling to uncover
the topics of SV-related discussions and analyze the popularity, difficulty,
and level of expertise for each topic. We also perform a qualitative analysis
to identify the types of solutions to SV-related questions. Results: We
identify 13 main SV discussion topics on Q&A sites. Many topics do not follow
the distributions and trends in expert-based security sources such as Common
Weakness Enumeration (CWE) and Open Web Application Security Project (OWASP).
We also discover that SV discussions attract more experts to answer than many
other domains, but some difficult SV topics (e.g., Vulnerability Scanning
Tools) still receive quite limited support from experts. Moreover, we identify
seven key types of answers given to SV questions on Q&A sites, in which SO
often provides code and instructions, while SSE usually gives experience-based
advice and explanations. Conclusion: Our findings provide support for
researchers and practitioners to effectively acquire, share and leverage SV
knowledge on Q&A sites.
","[{'version': 'v1', 'created': 'Mon, 10 Aug 2020 14:58:23 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Apr 2021 13:55:45 GMT'}]",2021-09-10,"[['Le', 'Triet H. M.', ''], ['Croft', 'Roland', ''], ['Hin', 'David', ''], ['Babar', 'M. Ali', '']]","['Security Vulnerability', 'Natural Language Processing', 'Topic Modeling', 'Mining Software Repositories', 'Developer Discussions']"
9937,2004.08959,James Trimble,James Trimble,An Algorithm for the Exact Treedepth Problem,"14 pages, 6 figures, 2 tables. This is an extended version of a paper
  to appear in the proceedings of SEA 2020. The arXiv version is the conference
  version plus Appendix A (a correctness proof)",,10.4230/LIPIcs.SEA.2020.19,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a novel algorithm for the minimum-depth elimination tree problem,
which is equivalent to the optimal treedepth decomposition problem. Our
algorithm makes use of two cheaply-computed lower bound functions to prune the
search tree, along with symmetry-breaking and domination rules. We present an
empirical study showing that the algorithm outperforms the current
state-of-the-art solver (which is based on a SAT encoding) by orders of
magnitude on a range of graph classes.
","[{'version': 'v1', 'created': 'Sun, 19 Apr 2020 20:47:39 GMT'}]",2020-06-18,"[['Trimble', 'James', '']]","['Treedepth', 'Elimination Tree', 'Graph Algorithms']"
9938,2003.00869,Fateme Sarkohaki,"Fatemeh Sarkohaki, Reza Fotohi, Vahab Ashrafian","An Efficient Routing Protocol in Mobile Ad-hoc Networks by using
  Artificial Immune System","8 pages, 10 figures, journal","International Journal of Advanced Computer Science and
  Applications (IJACSA), 8(4), 554-561 (2017)",10.14569/IJACSA.2017.080473,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Characteristics of the mobile ad-hoc networks such as nodes high mobility and
limited energy are regarded as the routing challenges in these networks. OLSR
protocol is one of the routing protocols in mobile ad hoc network that selects
the shortest route between source and destination through Dijkstra's algorithm.
However, OLSR suffers from a major problem. It does not consider parameters
such as nodes energy level and links length in its route processing. This paper
employs the artificial immune system (AIS) to enhance efficiency of OLSR
routing protocol. The proposed algorithm, called AIS-OLSR, considers hop count,
remaining energy in the intermediate nodes, and distance among node, which is
realized by negative selection and ClonalG algorithms of AIS. Widespread packet
- level simulation in ns-2 environment, shows that AIS-OLSR outperforms OLSR
and EA-OLSR in terms of packet delivery ratio, throughput, end-end delay and
lifetime.
","[{'version': 'v1', 'created': 'Mon, 24 Feb 2020 15:56:08 GMT'}]",2020-03-03,"[['Sarkohaki', 'Fatemeh', ''], ['Fotohi', 'Reza', ''], ['Ashrafian', 'Vahab', '']]","['AIS-OLSR', 'Routing protocol', 'Mobile ad hoc']"
9939,2107.11636,Tanguy Gernot,Tanguy Gernot and Patrick Lacharme,Biometric Masterkeys,,,10.1016/j.cose.2022.102642,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Biometric authentication is used to secure digital or physical access. Such
an authentication system uses a biometric database, where data are sometimes
protected by cancelable transformations. This paper introduces the notion of
biometric masterkeys. A masterkey is a feature vector such that the
corresponding template matches with a significant number of templates stored in
a cancelable biometric database. Such a masterkey is directly researched from a
cancelable biometric database, but we also investigate another scenario in
which the masterkey is fixed before the creation of the cancelable biometric
database, providing additional access rights in the system for the masterkey's
owner. Experimental results on the fingerprint database FVC and the face image
database LFW show the effectiveness and the efficiency of such masterkeys in
both scenarios. In particular, from any given feature vector, we are able to
construct a cancelable database, for which the biometric template matches with
all the templates of the database.
","[{'version': 'v1', 'created': 'Sat, 24 Jul 2021 15:38:44 GMT'}]",2022-02-08,"[['Gernot', 'Tanguy', ''], ['Lacharme', 'Patrick', '']]","['Biometric Authentication', 'Cancelable Biometric Transformation', 'Masterkey']"
9940,1604.05865,Decebal Constantin Mocanu,"Decebal Constantin Mocanu, Haitham Bou Ammar, Luis Puig, Eric Eaton
  and Antonio Liotta","Estimating 3D Trajectories from 2D Projections via Disjunctive Factored
  Four-Way Conditional Restricted Boltzmann Machines","Pattern Recognition, ISSN 0031-3203, Elsevier, 2017",,10.1016/j.patcog.2017.04.017,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Estimation, recognition, and near-future prediction of 3D trajectories based
on their two dimensional projections available from one camera source is an
exceptionally difficult problem due to uncertainty in the trajectories and
environment, high dimensionality of the specific trajectory states, lack of
enough labeled data and so on. In this article, we propose a solution to solve
this problem based on a novel deep learning model dubbed Disjunctive Factored
Four-Way Conditional Restricted Boltzmann Machine (DFFW-CRBM). Our method
improves state-of-the-art deep learning techniques for high dimensional
time-series modeling by introducing a novel tensor factorization capable of
driving forth order Boltzmann machines to considerably lower energy levels, at
no computational costs. DFFW-CRBMs are capable of accurately estimating,
recognizing, and performing near-future prediction of three-dimensional
trajectories from their 2D projections while requiring limited amount of
labeled data. We evaluate our method on both simulated and real-world data,
showing its effectiveness in predicting and classifying complex ball
trajectories and human activities.
","[{'version': 'v1', 'created': 'Wed, 20 Apr 2016 09:08:50 GMT'}, {'version': 'v2', 'created': 'Sat, 29 Apr 2017 06:11:10 GMT'}]",2017-05-02,"[['Mocanu', 'Decebal Constantin', ''], ['Ammar', 'Haitham Bou', ''], ['Puig', 'Luis', ''], ['Eaton', 'Eric', ''], ['Liotta', 'Antonio', '']]","['Deep learning', 'restricted Boltzmann machines', '3D trajectories estimation', 'activity recognition']"
9941,2009.11429,Xiaokang Liu,"Xiaokang Liu, Haijun Song","Automatic identification of fossils and abiotic grains during carbonate
  microfacies analysis using deep convolutional neural networks",This preprint has been accepted by Sedimentary Geology,,10.1016/j.sedgeo.2020.105790,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Petrographic analysis based on microfacies identification in thin sections is
widely used in sedimentary environment interpretation and paleoecological
reconstruction. Fossil recognition from microfacies is an essential procedure
for petrographers to complete this task. Distinguishing the morphological and
microstructural diversity of skeletal fragments requires extensive prior
knowledge of fossil morphotypes in microfacies and long training sessions under
the microscope. This requirement engenders certain challenges for
sedimentologists and paleontologists, especially novices. However, a machine
classifier can help address this challenge. In this study, we collected a
microfacies image dataset comprising both public data from 1,149 references and
our own materials (including 30,815 images of 22 fossil and abiotic grain
groups). We employed a high-performance workstation to implement four classic
deep convolutional neural networks (DCNNs), which have proven to be highly
efficient in computer vision over the last several years. Our framework uses a
transfer learning technique, which reuses the pre-trained parameters that are
trained on a larger ImageNet dataset as initialization for the network to
achieve high accuracy with low computing costs. We obtained up to 95% of the
top one and 99% of the top three test accuracies in the Inception ResNet v2
architecture. The machine classifier exhibited 0.99 precision on minerals, such
as dolomite and pyrite. Although it had some difficulty on samples having
similar morphologies, such as the bivalve, brachiopod, and ostracod, it
nevertheless obtained 0.88 precision. Our machine learning framework
demonstrated high accuracy with reproducibility and bias avoidance that was
comparable to those of human classifiers. Its application can thus eliminate
much of the tedious, manually intensive efforts by human experts conducting
routine identification.
","[{'version': 'v1', 'created': 'Thu, 24 Sep 2020 00:58:48 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Nov 2020 02:04:02 GMT'}]",2020-11-05,"[['Liu', 'Xiaokang', ''], ['Song', 'Haijun', '']]","['Microfossils', 'Minerals', 'Sedimentary structures', 'Machine learning', 'Transfer learning']"
9942,1910.11184,Yajun Zhao,"Yajun Zhao, Juan Liu, Saijin Xie","Cubic Metric Reduction for Repetitive CAZAC Sequences in frequency
  domain","20 pages, 12 figures, CIC","China Communications, 2021, 18(12): 196-207.
  http://www.cic-chinacommunications.cn/EN/Y2021/V18/I12/196",10.23919/JCC.2021.12.012,,cs.IT cs.PF math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In NR-based Access to Unlicensed Spectrum (NR-U) of 5G system, to satisfy the
rules of Occupied Channel Bandwidth (OCB) of unlicensed spectrum, the channels
of PRACH and PUCCH have to use some sequence repetition mechanisms in frequency
domain. These repetition mechanisms will cause serious cubic metric(CM)
problems for these channels, although these two types of channels are composed
of Constant Amplitude Zero Auto-correlation(CAZAC) sequences.. Based on the
characteristics of CAZAC sequences, which are used for PRACH and PUCCH (refer
to PUCCH format 0 and format 1) in 5G NR, in this paper, we propose some new
mechanisms of CM reduction for these two types of channels considering the
design principles to ensure the sequence performance of the auto-correlation
and cross-correlation. Then the proposed CM schemes are evaluated and the
optimized parameters are further provided considering CM performance and the
complexity.
","[{'version': 'v1', 'created': 'Mon, 21 Oct 2019 23:55:52 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Jan 2020 06:28:57 GMT'}, {'version': 'v3', 'created': 'Sat, 2 Oct 2021 04:38:23 GMT'}, {'version': 'v4', 'created': 'Mon, 3 Jan 2022 11:54:45 GMT'}]",2022-01-04,"[['Zhao', 'Yajun', ''], ['Liu', 'Juan', ''], ['Xie', 'Saijin', '']]","['5G', 'OFDM', 'Cubic Metric', 'NR-U', 'Occupied Channel Bandwidth', 'CAZAC', 'Zadoff-Chu Sequence']"
9943,1604.04207,James Ross,"David A. Richie, James A. Ross","Advances in Run-Time Performance and Interoperability for the Adapteva
  Epiphany Coprocessor","11 pages, 3 figures, accepted to ICCS'16 ALCHEMY workshop",,10.1016/j.procs.2016.05.478,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The energy-efficient Adapteva Epiphany architecture exhibits massive
many-core scalability in a physically compact 2D array of RISC cores with a
fast network-on-chip (NoC). The architecture presents many features and
constraints which contribute to software design challenges for the application
developer. Addressing these challenges within the software stack that supports
application development is critical to improving productivity and expanding the
range of applications for the architecture. We report here on advances that
have been made in the COPRTHR-2 software stack targeting the Epiphany
architecture that address critical issues identified in previous work.
Specifically, we describe improvements that bring greater control and precision
to the design of compact compiled binary programs in the context of the limited
per-core local memory of the architecture. We describe a new design for
run-time support that has been implemented to dramatically improve the program
load and execute performance and capabilities. Finally, we describe
developments that advance host-coprocessor interoperability to expand the
functionality available to the application developer.
","[{'version': 'v1', 'created': 'Thu, 14 Apr 2016 16:24:10 GMT'}]",2017-01-18,"[['Richie', 'David A.', ''], ['Ross', 'James A.', '']]","['Adapteva Epiphany', 'many-core', 'NoC']"
9944,1712.01978,Debojyoti Ghosh,"Milo R. Dorr and Phillip Colella and Mikhail A. Dorf and Debojyoti
  Ghosh and Jeffrey A. F. Hittinger and Peter O. Schwartz","High-order Discretization of a Gyrokinetic Vlasov Model in Edge Plasma
  Geometry",,,10.1016/j.jcp.2018.07.008,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a high-order spatial discretization of a continuum gyrokinetic
Vlasov model in axisymmetric tokamak edge plasma geometries. Such models
describe the phase space advection of plasma species distribution functions in
the absence of collisions. The gyrokinetic model is posed in a four-dimensional
phase space, upon which a grid is imposed when discretized. To mitigate the
computational cost associated with high-dimensional grids, we employ a
high-order discretization to reduce the grid size needed to achieve a given
level of accuracy relative to lower-order methods. Strong anisotropy induced by
the magnetic field motivates the use of mapped coordinate grids aligned with
magnetic flux surfaces. The natural partitioning of the edge geometry by the
separatrix between the closed and open field line regions leads to the
consideration of multiple mapped blocks, in what is known as a mapped
multiblock (MMB) approach. We describe the specialization of a more general
formalism that we have developed for the construction of high-order,
finite-volume discretizations on MMB grids, yielding the accurate evaluation of
the gyrokinetic Vlasov operator, the metric factors resulting from the MMB
coordinate mappings, and the interaction of blocks at adjacent boundaries. Our
conservative formulation of the gyrokinetic Vlasov model incorporates the fact
that the phase space velocity has zero divergence, which must be preserved
discretely to avoid truncation error accumulation. We describe an approach for
the discrete evaluation of the gyrokinetic phase space velocity that preserves
the divergence-free property to machine precision.
","[{'version': 'v1', 'created': 'Wed, 6 Dec 2017 00:29:03 GMT'}]",2018-08-15,"[['Dorr', 'Milo R.', ''], ['Colella', 'Phillip', ''], ['Dorf', 'Mikhail A.', ''], ['Ghosh', 'Debojyoti', ''], ['Hittinger', 'Jeffrey A. F.', ''], ['Schwartz', 'Peter O.', '']]","['gyrokinetic', 'tokamak edge plasma', 'high-order', 'mapped-multiblock', 'finite-volume']"
9945,2209.10610,Igor Sedl\'ar,Igor Sedl\'ar and Johann J. Wannenburg,"Embedding Kozen-Tiuryn Logic into Residuated One-Sorted Kleene Algebra
  with Tests",,"I. Sedl\'ar and J.J.~Wannenburg: Embedding Kozen-Tiuryn Logic into
  Residuated One-Sorted Kleene Algebra with Tests. In: A. Ciabattoni, E.
  Pimentel, R. de Queiroz (Eds.): Proc. WoLLIC 2022, pp. 221-236. LNCS 13468.
  Springer, 2022",10.1007/978-3-031-15298-6_14,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  Kozen and Tiuryn have introduced the substructural logic $\mathsf{S}$ for
reasoning about correctness of while programs (ACM TOCL, 2003). The logic
$\mathsf{S}$ distinguishes between tests and partial correctness assertions,
representing the latter by special implicational formulas. Kozen and Tiuryn's
logic extends Kleene altebra with tests, where partial correctness assertions
are represented by equations, not terms. Kleene algebra with codomain,
$\mathsf{KAC}$, is a one-sorted alternative to Kleene algebra with tests that
expands Kleene algebra with an operator that allows to construct a Boolean
subalgebra of tests. In this paper we show that Kozen and Tiuryn's logic embeds
into the equational theory of the expansion of $\mathsf{KAC}$ with residuals of
Kleene algebra multiplication and the upper adjoint of the codomain operator.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2022 19:14:11 GMT'}]",2022-09-23,"[['Sedlár', 'Igor', ''], ['Wannenburg', 'Johann J.', '']]","['Hoare logic', 'Kleene algebra with codomain', 'Kleene algebra withtests', 'Partial correctness', 'Substructural logic']"
9946,2104.09227,Rafael Melo,"Rusl\'an G. Marzo, Rafael A. Melo, Celso C. Ribeiro, Marcio C. Santos","New formulations and branch-and-cut procedures for the longest induced
  path problem",,,10.1016/j.cor.2021.105627,,cs.DM math.OC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Given an undirected graph $G=(V,E)$, the longest induced path problem (LIPP)
consists of obtaining a maximum cardinality subset $W\subseteq V$ such that $W$
induces a simple path in $G$. In this paper, we propose two new formulations
with an exponential number of constraints for the problem, together with
effective branch-and-cut procedures for its solution. While the first
formulation (cec) is based on constraints that explicitly eliminate cycles, the
second one (cut) ensures connectivity via cutset constraints. We compare, both
theoretically and experimentally, the newly proposed approaches with a
state-of-the-art formulation recently proposed in the literature. More
specifically, we show that the polyhedra defined by formulation cut and that of
the formulation available in the literature are the same. Besides, we show that
these two formulations are stronger in theory than cec. We also propose a new
branch-and-cut procedure using the new formulations. Computational experiments
show that the newly proposed formulation cec, although less strong from a
theoretical point of view, is the best performing approach as it can solve all
but one of the 1065 benchmark instances used in the literature within the given
time limit. In addition, our newly proposed approaches outperform the
state-of-the-art formulation when it comes to the median times to solve the
instances to optimality. Furthermore, we perform extended computational
experiments considering more challenging and hard-to-solve larger instances and
evaluate the impacts on the results when offering initial feasible solutions
(warm starts) to the formulations.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2021 11:51:59 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Dec 2021 11:19:05 GMT'}]",2021-12-28,"[['Marzo', 'Ruslán G.', ''], ['Melo', 'Rafael A.', ''], ['Ribeiro', 'Celso C.', ''], ['Santos', 'Marcio C.', '']]","['combinatorial optimization', 'integer programming', 'longest induced path', 'maximum induced subgraphs', 'maximum cardinality']"
9947,2108.01978,Nils Kurbis,"Nils K\""urbis",Definite Descriptions in Intuitionist Positive Free Logic,,Logic and Logical Philosophy 30/2 (2021): 327-358,10.12775/LLP.2020.024,,cs.LO math.LO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper presents rules of inference for a binary quantifier $I$ for the
formalisation of sentences containing definite descriptions within intuitionist
positive free logic. $I$ binds one variable and forms a formula from two
formulas. $Ix[F, G]$ means `The $F$ is $G$'. The system is shown to have
desirable proof-theoretic properties: it is proved that deductions in it can be
brought into normal form. The discussion is rounded up by comparisons between
the approach to the formalisation of definite descriptions recommended here and
the more usual approach that uses a term-forming operator $\iota$, where $\iota
xF$ means `the F'.
","[{'version': 'v1', 'created': 'Wed, 4 Aug 2021 11:36:15 GMT'}]",2021-08-12,"[['Kürbis', 'Nils', '']]","['free logic', 'definite descriptions', 'proof theory', 'normalisation', 'intuitionist logic', 'binary quantifiers', 'term forming operators']"
9948,1707.02102,Milan Hlad\'ik,Milan Hlad\'ik,AE regularity of interval matrices,,,10.13001/1081-3810.3705,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consider a linear system of equations with interval coefficients, and each
interval coefficient is associated with either a universal or an existential
quantifier. The AE solution set and AE solvability of the system is defined by
$\forall\exists$-quantification.
  Herein, we deal with the problem what properties must the coefficient matrix
have in order that there is guaranteed an existence of an AE solution. Based on
this motivation, we introduce a concept of AE regularity, which implies that
the AE solution set is nonempty and the system is AE solvable for every
right-hand side. We discuss characterization of AE regularity, and we also
focus on various classes of matrices that are implicitly AE regular. Some of
these classes are polynomially decidable, and therefore give an efficient way
for checking AE regularity. We also state open problems related to
computational complexity and characterization.
","[{'version': 'v1', 'created': 'Fri, 7 Jul 2017 09:47:13 GMT'}]",2019-05-28,"[['Hladík', 'Milan', '']]","['Interval computation', 'quantified systems', 'linear equations', 'intervalsystems']"
9949,1904.06886,Muhammad Ali Siddiqi,Muhammad Ali Siddiqi and Christos Strydis,IMD Security vs. Energy: Are We Tilting at Windmills?: POSTER,"3 pages, 3 figures, Proceedings of the 16th conference on Computing
  Frontiers (CF '19), April 30-May 2, 2019, Alghero, Italy",,10.1145/3310273.3323421,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Implantable Medical Devices (IMDs) such as pacemakers and neurostimulators
are highly constrained in terms of energy. In addition, the
wireless-communication facilities of these devices also impose security
requirements considering their life-critical nature. However, security
solutions that provide considerable coverage are generally considered to be too
taxing on an IMD battery. Consequently, there has been a tendency to adopt
ultra-lightweight security primitives for IMDs in literature. In this work, we
demonstrate that the recent advances in embedded computing in fact enable the
IMDs to use more mainstream security primitives, which do not need to
compromise significantly on security for fear of impacting IMD autonomy.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2019 07:42:48 GMT'}, {'version': 'v2', 'created': 'Sat, 11 May 2019 18:13:31 GMT'}, {'version': 'v3', 'created': 'Thu, 13 Jun 2019 07:42:28 GMT'}, {'version': 'v4', 'created': 'Thu, 29 Aug 2019 09:12:15 GMT'}]",2019-08-30,"[['Siddiqi', 'Muhammad Ali', ''], ['Strydis', 'Christos', '']]","['Implantable medical device', 'IMD security', 'lightweight cryptography', 'denial-of-service attack', 'battery DoS']"
9950,2003.03172,Tapajit Dey,"Tapajit Dey, Sara Mousavi, Eduardo Ponce, Tanner Fry, Bogdan
  Vasilescu, Anna Filippova, Audris Mockus",Detecting and Characterizing Bots that Commit Code,"Preprint of the paper accepted in MSR, 2020 conference",,10.1145/3379597.3387478,,cs.SE cs.CR cs.LG cs.SI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Some developer activity traditionally performed manually, such as
making code commits, opening, managing, or closing issues is increasingly
subject to automation in many OSS projects. Specifically, such activity is
often performed by tools that react to events or run at specific times. We
refer to such automation tools as bots and, in many software mining scenarios
related to developer productivity or code quality it is desirable to identify
bots in order to separate their actions from actions of individuals. Aim: Find
an automated way of identifying bots and code committed by these bots, and to
characterize the types of bots based on their activity patterns. Method and
Result: We propose BIMAN, a systematic approach to detect bots using author
names, commit messages, files modified by the commit, and projects associated
with the ommits. For our test data, the value for AUC-ROC was 0.9. We also
characterized these bots based on the time patterns of their code commits and
the types of files modified, and found that they primarily work with
documentation files and web pages, and these files are most prevalent in HTML
and JavaScript ecosystems. We have compiled a shareable dataset containing
detailed information about 461 bots we found (all of whom have more than 1000
commits) and 13,762,430 commits they created.
","[{'version': 'v1', 'created': 'Mon, 2 Mar 2020 21:54:07 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Mar 2020 01:28:42 GMT'}, {'version': 'v3', 'created': 'Fri, 27 Mar 2020 20:47:56 GMT'}]",2020-03-31,"[['Dey', 'Tapajit', ''], ['Mousavi', 'Sara', ''], ['Ponce', 'Eduardo', ''], ['Fry', 'Tanner', ''], ['Vasilescu', 'Bogdan', ''], ['Filippova', 'Anna', ''], ['Mockus', 'Audris', '']]","['bots', 'automated commits', 'random forest', 'ensemble model', 'socialcoding platforms', 'software engineering']"
9951,2202.12559,Xiuling Shan,"Honglian Shen, Xiuling Shan, Zihong Tian","A new chaotic image encryption algorithm based on transversals in a
  Latin square","added one reference for section 1, corrected the first author's name
  in Metadata, added the author's name in reference [28]",,10.3390/e24111574,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are some good combinatorial structures suitable for image encryption.
In this study, a new chaotic image encryption algorithm based on transversals
in a Latin square is proposed. By means of an n-transversal of a Latin square,
we can permutate an image data group by group for the first time, then use two
Latin squares for auxiliary diffusion on the basis of a chaotic sequence,
finally make use of a pair of orthogonal Latin squares to do the second
scrambling. As a whole, the encryption process of
""scrambling-diffusion-scrambling"" is formed. The experimental results indicate
that this algorithm achieves a secure and fast encryption effect. The final
information entropy is very close to 8, and the correlation coefficient is
approximate to 0. All these tests verify the robustness and practicability of
this proposed algorithm.
","[{'version': 'v1', 'created': 'Fri, 25 Feb 2022 08:44:24 GMT'}, {'version': 'v2', 'created': 'Sat, 12 Mar 2022 02:39:22 GMT'}]",2022-11-23,"[['Shen', 'Honglian', ''], ['Shan', 'Xiuling', ''], ['Tian', 'Zihong', '']]","['Image encryption', 'Chaotic', 'Latin square', 'Transversals']"
9952,1710.05193,Zutao Jiang,"Zutao Jiang, Jihua Zhu, Georgios D. Evangelidis, Changqing Zhang,
  Shanmin Pang, Yaochen Li","K-means clustering for efficient and robust registration of multi-view
  point sets",,,10.1016/j.ins.2019.03.024,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Generally, there are three main factors that determine the practical
usability of registration, i.e., accuracy, robustness, and efficiency. In
real-time applications, efficiency and robustness are more important. To
promote these two abilities, we cast the multi-view registration into a
clustering task. All the centroids are uniformly sampled from the initially
aligned point sets involved in the multi-view registration, which makes it
rather efficient and effective for the clustering. Then, each point is assigned
to a single cluster and each cluster centroid is updated accordingly.
Subsequently, the shape comprised by all cluster centroids is used to
sequentially estimate the rigid transformation for each point set. For accuracy
and stability, clustering and transformation estimation are alternately and
iteratively applied to all point sets. We tested our proposed approach on
several benchmark datasets and compared it with state-of-the-art approaches.
Experimental results validate its efficiency and robustness for the
registration of multi-view point sets.
","[{'version': 'v1', 'created': 'Sat, 14 Oct 2017 14:29:14 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Oct 2017 07:52:11 GMT'}, {'version': 'v3', 'created': 'Wed, 28 Mar 2018 13:15:15 GMT'}, {'version': 'v4', 'created': 'Mon, 30 Apr 2018 08:42:34 GMT'}]",2019-03-21,"[['Jiang', 'Zutao', ''], ['Zhu', 'Jihua', ''], ['Evangelidis', 'Georgios D.', ''], ['Zhang', 'Changqing', ''], ['Pang', 'Shanmin', ''], ['Li', 'Yaochen', '']]","['Multi-view registration', 'point sets', 'K-means clustering', 'Iterative closest']"
9953,2012.00102,Aqeeb Iqbal Arka,"Aqeeb Iqbal Arka, Biresh Kumar Joardar, Ryan Gary Kim, Dae Hyun Kim,
  Janardhan Rao Doppa, and Partha Pratim Pande","HeM3D: Heterogeneous Manycore Architecture Based on Monolithic 3D
  Vertical Integration","This work has been accepted in ACM Transactions on Design Automation
  of Electronic Systems",,10.1145/3424239,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Heterogeneous manycore architectures are the key to efficiently execute
compute- and data-intensive applications. Through silicon via (TSV)-based 3D
manycore system is a promising solution in this direction as it enables
integration of disparate computing cores on a single system. However, the
achievable performance of conventional through-silicon-via (TSV)-based 3D
systems is ultimately bottlenecked by the horizontal wires (wires in each
planar die). Moreover, current TSV 3D architectures suffer from thermal
limitations. Hence, TSV-based architectures do not realize the full potential
of 3D integration. Monolithic 3D (M3D) integration, a breakthrough technology
to achieve - More Moore and More Than Moore - and opens up the possibility of
designing cores and associated network routers using multiple layers by
utilizing monolithic inter-tier vias (MIVs) and hence, reducing the effective
wire length. Compared to TSV-based 3D ICs, M3D offers the true benefits of
vertical dimension for system integration: the size of a MIV used in M3D is
over 100x smaller than a TSV. In this work, we demonstrate how M3D-enabled
vertical core and uncore elements offer significant performance and thermal
improvements in manycore heterogeneous architectures compared to its TSV-based
counterpart. To overcome the difficult optimization challenges due to the large
design space and complex interactions among the heterogeneous components (CPU,
GPU, Last Level Cache, etc.) in an M3D-based manycore chip, we leverage novel
design-space exploration algorithms to trade-off different objectives. The
proposed M3D-enabled heterogeneous architecture, called HeM3D, outperforms its
state-of-the-art TSV-equivalent counterpart by up to 18.3% in execution time
while being up to 19 degrees Celcius cooler.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2020 21:23:41 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Dec 2020 02:07:11 GMT'}]",2020-12-09,"[['Arka', 'Aqeeb Iqbal', ''], ['Joardar', 'Biresh Kumar', ''], ['Kim', 'Ryan Gary', ''], ['Kim', 'Dae Hyun', ''], ['Doppa', 'Janardhan Rao', ''], ['Pande', 'Partha Pratim', '']]","['Heterogeneous manycore', 'NoC', 'M3D', 'performance', 'execution time', 'temperature', 'multi-tier']"
9954,1902.04694,Thomas Gabor,"Thomas Gabor, Marie Kiermeier, Andreas Sedlmeier, Bernhard Kempter,
  Cornel Klein, Horst Sauer, Reiner Schmid, Jan Wieghardt","Adapting Quality Assurance to Adaptive Systems: The Scenario Coevolution
  Paradigm","17 pages, published at ISOLA 2018","International Symposium on Leveraging Applications of Formal
  Methods (ISOLA). Springer, 2018",10.1007/978-3-030-03424-5_10,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  From formal and practical analysis, we identify new challenges that
self-adaptive systems pose to the process of quality assurance. When tackling
these, the effort spent on various tasks in the process of software engineering
is naturally re-distributed. We claim that all steps related to testing need to
become self-adaptive to match the capabilities of the self-adaptive
system-under-test. Otherwise, the adaptive system's behavior might elude
traditional variants of quality assurance. We thus propose the paradigm of
scenario coevolution, which describes a pool of test cases and other
constraints on system behavior that evolves in parallel to the (in part
autonomous) development of behavior in the system-under-test. Scenario
coevolution offers a simple structure for the organization of adaptive testing
that allows for both human-controlled and autonomous intervention, supporting
software engineering for adaptive systems on a procedural as well as technical
level.
","[{'version': 'v1', 'created': 'Wed, 13 Feb 2019 01:27:18 GMT'}]",2019-02-14,"[['Gabor', 'Thomas', ''], ['Kiermeier', 'Marie', ''], ['Sedlmeier', 'Andreas', ''], ['Kempter', 'Bernhard', ''], ['Klein', 'Cornel', ''], ['Sauer', 'Horst', ''], ['Schmid', 'Reiner', ''], ['Wieghardt', 'Jan', '']]","['self-adaptive system', 'software engineering', 'quality assurance', 'software evolution']"
9955,2005.07638,Anastasios Nentidis,"Anastasios Nentidis, Anastasia Krithara, Grigorios Tsoumakas, Georgios
  Paliouras","Beyond MeSH: Fine-Grained Semantic Indexing of Biomedical Literature
  based on Weak Supervision","36 pages, 8 figures; Dictionary-based baselines added and conclusions
  updated",Information Processing and Management 57 (2020) 102282,10.1016/j.ipm.2020.102282,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we propose a method for the automated refinement of subject
annotations in biomedical literature at the level of concepts. Semantic
indexing and search of biomedical articles in MEDLINE/PubMed are based on
semantic subject annotations with MeSH descriptors that may correspond to
several related but distinct biomedical concepts. Such semantic annotations do
not adhere to the level of detail available in the domain knowledge and may not
be sufficient to fulfil the information needs of experts in the domain. To this
end, we propose a new method that uses weak supervision to train a concept
annotator on the literature available for a particular disease. We test this
method on the MeSH descriptors for two diseases: Alzheimer's Disease and
Duchenne Muscular Dystrophy. The results indicate that concept-occurrence is a
strong heuristic for automated subject annotation refinement and its use as
weak supervision can lead to improved concept-level annotations. The
fine-grained semantic annotations can enable more precise literature retrieval,
sustain the semantic integration of subject annotations with other domain
resources and ease the maintenance of consistent subject annotations, as new
more detailed entries are added in the MeSH thesaurus over time.
","[{'version': 'v1', 'created': 'Fri, 15 May 2020 16:52:25 GMT'}, {'version': 'v2', 'created': 'Mon, 18 May 2020 13:39:05 GMT'}]",2020-05-26,"[['Nentidis', 'Anastasios', ''], ['Krithara', 'Anastasia', ''], ['Tsoumakas', 'Grigorios', ''], ['Paliouras', 'Georgios', '']]","['semantic indexing', 'MeSH', 'biomedical literature', 'weak supervision']"
9956,2008.09561,Martin Menchon,"Martin Menchon, Estefania Talavera, Jose M Massa and Petia Radeva","Behavioural pattern discovery from collections of egocentric
  photo-streams",,,10.1007/978-3-030-66823-5_28,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The automatic discovery of behaviour is of high importance when aiming to
assess and improve the quality of life of people. Egocentric images offer a
rich and objective description of the daily life of the camera wearer. This
work proposes a new method to identify a person's patterns of behaviour from
collected egocentric photo-streams. Our model characterizes time-frames based
on the context (place, activities and environment objects) that define the
images composition. Based on the similarity among the time-frames that describe
the collected days for a user, we propose a new unsupervised greedy method to
discover the behavioural pattern set based on a novel semantic clustering
approach. Moreover, we present a new score metric to evaluate the performance
of the proposed algorithm. We validate our method on 104 days and more than
100k images extracted from 7 users. Results show that behavioural patterns can
be discovered to characterize the routine of individuals and consequently their
lifestyle.
","[{'version': 'v1', 'created': 'Fri, 21 Aug 2020 16:05:45 GMT'}]",2021-01-06,"[['Menchon', 'Martin', ''], ['Talavera', 'Estefania', ''], ['Massa', 'Jose M', ''], ['Radeva', 'Petia', '']]","['behaviour analysis', 'pattern discovery', 'egocentric vision', 'datamining', 'lifelogging']"
9957,2012.10232,Bata Vasic Dr,"Iva Vasic, Bata Vasic, and Zorica Nikolic",Artificial Intelligence ordered 3D vertex importance,"8 pages, 4 figures","FBIM Transactions, Vol. 8 No. 2, pp. 193-201, 2020",10.12709/fbim.08.08.02.21,,cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Ranking vertices of multidimensional networks is crucial in many areas of
research, including selecting and determining the importance of decisions. Some
decisions are significantly more important than others, and their weight
categorization is also imortant. This paper defines a completely new method for
determining the weight decisions using artificial intelligence for importance
ranking of three-dimensional network vertices, improving the existing Ordered
Statistics Vertex Extraction and Tracking Algorithm (OSVETA) based on
modulation of quantized indices (QIM) and error correction codes. The technique
we propose in this paper offers significant improvements the efficiency of
determination the importance of network vertices in relation to statistical
OSVETA criteria, replacing heuristic methods with methods of precise prediction
of modern neural networks. The new artificial intelligence technique enables a
significantly better definition of the 3D meshes and a better assessment of
their topological features. The new method contributions result in a greater
precision in defining stable vertices, significantly reducing the probability
of deleting mesh vertices.
","[{'version': 'v1', 'created': 'Thu, 17 Dec 2020 06:54:59 GMT'}]",2020-12-21,"[['Vasic', 'Iva', ''], ['Vasic', 'Bata', ''], ['Nikolic', 'Zorica', '']]","['Artificial intelligence', '3D geometry', 'Information theory', 'Hiding information']"
9958,1910.03644,Clint D. Lombard Dr,"Clint D. Lombard, Corn\'e E. van Daalen","Stochastic triangular mesh mapping: A terrain mapping technique for
  autonomous mobile robots",,Robotics and Autonomous Systems (2020),10.1016/j.robot.2020.103449,,cs.RO cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For mobile robots to operate autonomously in general environments, perception
is required in the form of a dense metric map. For this purpose, we present the
stochastic triangular mesh (STM) mapping technique: a 2.5-D representation of
the surface of the environment using a continuous mesh of triangular surface
elements, where each surface element models the mean plane and roughness of the
underlying surface. In contrast to existing mapping techniques, a STM map
models the structure of the environment by ensuring a continuous model, while
also being able to be incrementally updated with linear computational cost in
the number of measurements. We reduce the effect of uncertainty in the robot
pose (position and orientation) by using landmark-relative submaps. The
uncertainty in the measurements and robot pose are accounted for by the use of
Bayesian inference techniques during the map update. We demonstrate that a STM
map can be used with sensors that generate point measurements, such as light
detection and ranging (LiDAR) sensors and stereo cameras. We show that a STM
map is a more accurate model than the only comparable online surface mapping
technique$\unicode{x2014}$a standard elevation map$\unicode{x2014}$and we also
provide qualitative results on practical datasets.
","[{'version': 'v1', 'created': 'Tue, 8 Oct 2019 19:06:05 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Feb 2020 15:33:35 GMT'}]",2020-03-03,"[['Lombard', 'Clint D.', ''], ['van Daalen', 'Corné E.', '']]","['dense mapping', 'submapping', 'perception', 'triangular mesh', 'probabilistic graphical model', 'stereo cameras', 'LiDAR']"
9959,1707.09718,Phung Manh Duong,"Van Truong Hoang, Ansu Man Singh, Manh Duong Phung and Quang Ha","Adaptive Second-order Sliding Mode Control of UAVs for Civil
  Applications","in Proceeding of The 34th International Symposium on Automation and
  Robotics in Construction (ISARC), pp. 823-829, Taipei, Taiwan, 2017",,10.22260/ISARC2017/0114,,cs.SY cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quadcopters, as unmanned aerial vehicles (UAVs), have great potential in
civil applications such as surveying, building monitoring, and infrastructure
condition assessment. Quadcopters, however, are relatively sensitive to noises
and disturbances so that their performance may be quickly downgraded in the
case of inadequate control, system uncertainties and/or external disturbances.
In this study, we deal with the quadrotor low-level control by proposing a
robust scheme named the adaptive second-order quasi-continuous sliding mode
control (adaptive 2-QCSM). The ultimate objective is for robust attitude
control of the UAV in monitoring and inspection of built infrastructure. First,
the mathematical model of the quadcopter is derived considering nonlinearity,
strong coupling, uncertain dynamics and external disturbances. The control
design includes the selection of the sliding manifold and the development of
quasi-continuous second-order sliding mode controller with an adaptive gain.
Stability of the overall control system is analysed by using a global Lyapunov
function for convergence of both the sliding dynamics and adaptation scheme.
Extensive simulations have been carried out for evaluation. Results show that
the proposed controller can achieve robustness against disturbances or
parameter variations and has better tracking performance in comparison with
experimental responses of a UAV in a real-time monitoring task.
","[{'version': 'v1', 'created': 'Mon, 31 Jul 2017 04:24:03 GMT'}]",2019-01-04,"[['Hoang', 'Van Truong', ''], ['Singh', 'Ansu Man', ''], ['Phung', 'Manh Duong', ''], ['Ha', 'Quang', '']]","['Quadcopter', 'robustness', 'adaptation', 'quasi-continuoussecond-order sliding mode control', 'monitoring system']"
9960,2208.03261,Manuel Rebol,"Manuel Rebol, Colton Hood, Claudia Ranniger, Adam Rutenberg, Neal
  Sikka, Erin Maria Horan, Christian G\""utl, Krzysztof Pietroszek",Remote Assistance with Mixed Reality for Procedural Tasks,"Published in: 2021 IEEE Conference on Virtual Reality and 3D User
  Interfaces Abstracts and Workshops (VRW)","2021 IEEE Conference on Virtual Reality and 3D User Interfaces
  Abstracts and Workshops (VRW), 2021, pp. 653-654",10.1109/VRW52623.2021.00209,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  We present a volumetric communication system that is designed for remote
assistance of procedural tasks. The system allows a remote expert to visually
guide a local operator. The two parties share a view that is spatially
identical, but for the local operator it is of the object on which they
operate, while for the remote expert, the object is presented as a mixed
reality ""hologram"". Guidance is provided by voice, gestures, and annotations
performed directly on the object of interest or its hologram. At each end of
the communication, spatial is visualized using mixed-reality glasses.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2022 16:29:43 GMT'}]",2022-08-08,"[['Rebol', 'Manuel', ''], ['Hood', 'Colton', ''], ['Ranniger', 'Claudia', ''], ['Rutenberg', 'Adam', ''], ['Sikka', 'Neal', ''], ['Horan', 'Erin Maria', ''], ['Gütl', 'Christian', ''], ['Pietroszek', 'Krzysztof', '']]","['Remote Procedure', 'Augmented Reality', 'Virtual Presence']"
9961,1810.01872,Alban Laflaqui\`ere Dr,"Alban Laflaqui\`ere, J.Kevin O'Regan, Sylvain Argentieri, Bruno Gas,
  Alexander V. Terekhov",Learning agent's spatial configuration from sensorimotor invariants,"26 pages, 5 images, published in Robotics and Autonomous Systems","Robotics and Autonomous Systems, Volume 71, September 2015, Pages
  49-59",10.1016/j.robot.2015.01.003,,cs.LG cs.RO stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The design of robotic systems is largely dictated by our purely human
intuition about how we perceive the world. This intuition has been proven
incorrect with regard to a number of critical issues, such as visual change
blindness. In order to develop truly autonomous robots, we must step away from
this intuition and let robotic agents develop their own way of perceiving. The
robot should start from scratch and gradually develop perceptual notions, under
no prior assumptions, exclusively by looking into its sensorimotor experience
and identifying repetitive patterns and invariants. One of the most fundamental
perceptual notions, space, cannot be an exception to this requirement. In this
paper we look into the prerequisites for the emergence of simplified spatial
notions on the basis of a robot's sensorimotor flow. We show that the notion of
space as environment-independent cannot be deduced solely from exteroceptive
information, which is highly variable and is mainly determined by the contents
of the environment. The environment-independent definition of space can be
approached by looking into the functions that link the motor commands to
changes in exteroceptive inputs. In a sufficiently rich environment, the
kernels of these functions correspond uniquely to the spatial configuration of
the agent's exteroceptors. We simulate a redundant robotic arm with a retina
installed at its end-point and show how this agent can learn the configuration
space of its retina. The resulting manifold has the topology of the Cartesian
product of a plane and a circle, and corresponds to the planar position and
orientation of the retina.
","[{'version': 'v1', 'created': 'Wed, 3 Oct 2018 13:48:43 GMT'}]",2018-10-05,"[['Laflaquière', 'Alban', ''], [""O'Regan"", 'J. Kevin', ''], ['Argentieri', 'Sylvain', ''], ['Gas', 'Bruno', ''], ['Terekhov', 'Alexander V.', '']]","['space', 'perception', 'robotics', 'learning', 'developmental robotics', 'sensorimotortheory']"
9962,2104.05456,Marek \v{S}uppa,"Marek \v{S}uppa, Ondrej Jariabka, Adri\'an Matejov, and Marek Nagy","TermAdventure: Interactively Teaching UNIX Command Line, Text Adventure
  Style",Accepted at ITiCSE 2021,,10.1145/3430665.3456387,,cs.CY cs.HC cs.OS,http://creativecommons.org/licenses/by-sa/4.0/,"  Introductory UNIX courses are typically organized as lectures, accompanied by
a set of exercises, whose solutions are submitted to and reviewed by the
lecturers. While this arrangement has become standard practice, it often
requires the use of an external tool or interface for submission and does not
automatically check its correctness. That in turn leads to increased workload
and makes it difficult to deal with potential plagiarism.
  In this work we present TermAdventure (TA), a suite of tools for creating
interactive UNIX exercises. These resemble text adventure games, which immerse
the user in a text environment and let them interact with it using textual
commands. In our case the ''adventure'' takes place inside a UNIX system and
the user interaction happens via the standard UNIX command line. The adventure
is a set of exercises, which are presented and automatically evaluated by the
system, all from within the command line environment. The suite is released
under an open source license, has minimal dependencies and can be used either
on a UNIX-style server or a desktop computer running any major OS platform
through Docker.
  We also reflect on our experience of using the presented suite as the primary
teaching tool for an introductory UNIX course for Data Scientists and discuss
the implications of its deployment in similar courses. The suite is released
under the terms of an open-source license at
\url{https://github.com/NaiveNeuron/TermAdventure}.
","[{'version': 'v1', 'created': 'Mon, 12 Apr 2021 13:23:58 GMT'}]",2021-04-13,"[['Šuppa', 'Marek', ''], ['Jariabka', 'Ondrej', ''], ['Matejov', 'Adrián', ''], ['Nagy', 'Marek', '']]","['UNIX', 'terminal', 'command-line', 'text adventure', 'interactive instruction', 'auto-grading']"
9963,2104.05522,Kin Gutierrez Olivares,"Kin G. Olivares and Cristian Challu and Grzegorz Marcjasz and Rafa{\l}
  Weron and Artur Dubrawski","Neural basis expansion analysis with exogenous variables: Forecasting
  electricity prices with NBEATSx","30 pages, 7 figures, 4 tables",International Journal of Forecasting 2022,10.1016/j.ijforecast.2022.03.001,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We extend the neural basis expansion analysis (NBEATS) to incorporate
exogenous factors. The resulting method, called NBEATSx, improves on a well
performing deep learning model, extending its capabilities by including
exogenous variables and allowing it to integrate multiple sources of useful
information. To showcase the utility of the NBEATSx model, we conduct a
comprehensive study of its application to electricity price forecasting (EPF)
tasks across a broad range of years and markets. We observe state-of-the-art
performance, significantly improving the forecast accuracy by nearly 20% over
the original NBEATS model, and by up to 5% over other well established
statistical and machine learning methods specialized for these tasks.
Additionally, the proposed neural network has an interpretable configuration
that can structurally decompose time series, visualizing the relative impact of
trend and seasonal components and revealing the modeled processes' interactions
with exogenous factors. To assist related work we made the code available in
https://github.com/cchallu/nbeatsx.
","[{'version': 'v1', 'created': 'Mon, 12 Apr 2021 14:47:55 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Apr 2021 14:36:36 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Apr 2021 20:38:24 GMT'}, {'version': 'v4', 'created': 'Fri, 23 Apr 2021 12:48:00 GMT'}, {'version': 'v5', 'created': 'Thu, 27 Jan 2022 17:12:11 GMT'}, {'version': 'v6', 'created': 'Mon, 4 Apr 2022 14:13:29 GMT'}]",2022-08-10,"[['Olivares', 'Kin G.', ''], ['Challu', 'Cristian', ''], ['Marcjasz', 'Grzegorz', ''], ['Weron', 'Rafał', ''], ['Dubrawski', 'Artur', '']]","['Deep Learning', 'NBEATS and NBEATSx models', 'Interpretable neuralnetwork', 'Time series decomposition', 'Fourier series', 'Electricity price forecasting']"
9964,2111.11141,Yi-Jun Cao,"Yijun Cao, Xianshi Zhang, Fuya Luo, Peng Peng, Yongjie Li","Learning Generalized Visual Odometry Using Position-Aware Optical Flow
  and Geometric Bundle Adjustment","35 pages, 6 figures",,10.1016/j.patcog.2022.109262,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent visual odometry (VO) methods incorporating geometric algorithm into
deep-learning architecture have shown outstanding performance on the
challenging monocular VO task. Despite encouraging results are shown, previous
methods ignore the requirement of generalization capability under noisy
environment and various scenes. To address this challenging issue, this work
first proposes a novel optical flow network (PANet). Compared with previous
methods that predict optical flow as a direct regression task, our PANet
computes optical flow by predicting it into the discrete position space with
optical flow probability volume, and then converting it to optical flow. Next,
we improve the bundle adjustment module to fit the self-supervised training
pipeline by introducing multiple sampling, ego-motion initialization, dynamic
damping factor adjustment, and Jacobi matrix weighting. In addition, a novel
normalized photometric loss function is advanced to improve the depth
estimation accuracy. The experiments show that the proposed system not only
achieves comparable performance with other state-of-the-art self-supervised
learning-based methods on the KITTI dataset, but also significantly improves
the generalization capability compared with geometry-based, learning-based and
hybrid VO systems on the noisy KITTI and the challenging outdoor (KAIST)
scenes.
","[{'version': 'v1', 'created': 'Mon, 22 Nov 2021 12:05:27 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Dec 2022 11:42:51 GMT'}]",2022-12-22,"[['Cao', 'Yijun', ''], ['Zhang', 'Xianshi', ''], ['Luo', 'Fuya', ''], ['Peng', 'Peng', ''], ['Li', 'Yongjie', '']]","['visual odometry', 'self-supervise learning', 'optical flow', 'monocular']"
9965,1712.03361,Farid Feyzi,"Farid Feyzi, Saeed Parsa","Inforence: Effective Fault Localization Based on Information-Theoretic
  Analysis and Statistical Causal Inference","Frontiers of Computer Science, 2018",,10.1007/s11704-017-6512-z,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a novel approach, Inforence, is proposed to isolate the
suspicious codes that likely contain faults. Inforence employs a feature
selection method, based on mutual information, to identify those bug-related
statements that may cause the program to fail. Because the majority of a
program faults may be revealed as undesired joint effect of the program
statements on each other and on program termination state, unlike the
state-of-the-art methods, Inforence tries to identify and select groups of
interdependent statements which altogether may affect the program failure. The
interdependence amongst the statements is measured according to their mutual
effect on each other and on the program termination state. To provide the
context of failure, the selected bug-related statements are chained to each
other, considering the program static structure. Eventually, the resultant
cause-effect chains are ranked according to their combined causal effect on
program failure. To validate Inforence, the results of our experiments with
seven sets of programs include Siemens suite, gzip, grep, sed, space, make and
bash are presented. The experimental results are then compared with those
provided by different fault localization techniques for the both single-fault
and multi-fault programs. The experimental results prove the outperformance of
the proposed method compared to the state-of-the-art techniques.
","[{'version': 'v1', 'created': 'Sat, 9 Dec 2017 09:23:54 GMT'}]",2017-12-12,"[['Feyzi', 'Farid', ''], ['Parsa', 'Saeed', '']]","['Fault Localization', 'Debugging', 'BackwardDynamic Slice', 'Mutual Information', 'Feature Selection']"
9966,1801.08206,Zhijin Qin,"Zhijin Qin, Jiancun Fan, Yuanwei Liu, Yue Gao, and Geoffrey Ye Li","Sparse Representation for Wireless Communications: A Compressive Sensing
  Approach","This paper has been accepted by IEEE Signal Processing Magazine.
  Please cite the format version of this paper, which can be found by
  https://ieeexplore.ieee.org/document/8350399/","Z. Qin, J. Fan, Y. Liu, Y. Gao and G. Y. Li, ""Sparse
  Representation for Wireless Communications: A Compressive Sensing Approach,""
  in IEEE Signal Processing Magazine, vol. 35, no. 3, pp. 40-58, May 2018",10.1109/MSP.2018.2789521,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sparse representation can efficiently model signals in different applications
to facilitate processing. In this article, we will discuss various applications
of sparse representation in wireless communications, with focus on the most
recent compressive sensing (CS) enabled approaches. With the help of the
sparsity property, CS is able to enhance the spectrum efficiency and energy
efficiency for the fifth generation (5G) networks and Internet of Things (IoT)
networks. This article starts from a comprehensive overview of CS principles
and different sparse domains potentially used in 5G and IoT networks. Then
recent research progress on applying CS to address the major opportunities and
challenges in 5G and IoT networks is introduced, including wideband spectrum
sensing in cognitive radio networks, data collection in IoT networks, and
channel estimation and feedback in massive MIMO systems. Moreover, other
potential applications and research challenges on sparse representation for 5G
and IoT networks are identified. This article will provide readers a clear
picture of how to exploit the sparsity properties to process wireless signals
in different applications.
","[{'version': 'v1', 'created': 'Wed, 24 Jan 2018 21:27:37 GMT'}, {'version': 'v2', 'created': 'Sun, 24 Jun 2018 12:30:36 GMT'}]",2018-06-26,"[['Qin', 'Zhijin', ''], ['Fan', 'Jiancun', ''], ['Liu', 'Yuanwei', ''], ['Gao', 'Yue', ''], ['Li', 'Geoffrey Ye', '']]","['Wireless communications', 'compressive sensing', 'sparsity property', '5G', 'Internet of Things']"
9967,2202.02587,Mohammad Ridwan Kabir,"Shahed Anzarus Sabab (1, 2, 3, 4, and 5), Mohammad Ridwan Kabir (1, 2,
  and 3), Sayed Rizban Hussain (1, 2, and 3), Hasan Mahmud (1, 2, and 3), Md.
  Kamrul Hasan (1, 2, and 3), Husne Ara Rubaiyeat (6) ((1) Systems and Software
  Lab (SSL), (2) Department of Computer Science and Engineering, (3) Islamic
  University of Technology (IUT), Gazipur, Bangladesh, (4) Department of
  Computer Science, (5) University of Manitoba, Winnipeg, Canada, (6) National
  University, Bangladesh.)",VIS-iTrack: Visual Intention through Gaze Tracking using Low-Cost Webcam,"15 pages, 9 figures, 4 tables",,10.1109/ACCESS.2022.3187969,,cs.HC cs.CV cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Human intention is an internal, mental characterization for acquiring desired
information. From interactive interfaces containing either textual or graphical
information, intention to perceive desired information is subjective and
strongly connected with eye gaze. In this work, we determine such intention by
analyzing real-time eye gaze data with a low-cost regular webcam. We extracted
unique features (e.g., Fixation Count, Eye Movement Ratio) from the eye gaze
data of 31 participants to generate a dataset containing 124 samples of visual
intention for perceiving textual or graphical information, labeled as either
TEXT or IMAGE, having 48.39% and 51.61% distribution, respectively. Using this
dataset, we analyzed 5 classifiers, including Support Vector Machine (SVM)
(Accuracy: 92.19%). Using the trained SVM, we investigated the variation of
visual intention among 30 participants, distributed in 3 age groups, and found
out that young users were more leaned towards graphical contents whereas older
adults felt more interested in textual ones. This finding suggests that
real-time eye gaze data can be a potential source of identifying visual
intention, analyzing which intention aware interactive interfaces can be
designed and developed to facilitate human cognition.
","[{'version': 'v1', 'created': 'Sat, 5 Feb 2022 16:00:03 GMT'}]",2022-07-07,"[['Sabab', 'Shahed Anzarus', '', '1, 2, 3, 4, and 5'], ['Kabir', 'Mohammad Ridwan', '', '1, 2,\n  and 3'], ['Hussain', 'Sayed Rizban', '', '1, 2, and 3'], ['Mahmud', 'Hasan', '', '1, 2, and 3'], ['Hasan', 'Md. Kamrul', '', '1, 2, and 3'], ['Rubaiyeat', 'Husne Ara', '']]","['Human-Computer Interaction', 'Visual Intention Detection', 'Eye Gaze', 'Kalman Filtering', 'Saccades', 'Fixation', 'Support']"
9968,2208.06479,Xugui Zhou,"Xugui Zhou, Maxfield Kouzel, Haotian Ren, Homa Alemzadeh","Design and Validation of an Open-Source Closed-Loop Testbed for
  Artificial Pancreas Systems","12 pages, 12 figures, in the IEEE/ACM International Conference on
  Connected Health: Applications, Systems and Engineering Technologies (CHASE),
  2022",,10.1145/3551455.3559151,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The development of a fully autonomous artificial pancreas system (APS) to
independently regulate the glucose levels of a patient with Type 1 diabetes has
been a long-standing goal of diabetes research. A significant barrier to
progress is the difficulty of testing new control algorithms and safety
features, since clinical trials are time- and resource-intensive. To facilitate
ease of validation, we propose an open-source APS testbed by integrating APS
controllers with two state-of-the-art glucose simulators and a novel fault
injection engine. The testbed is able to reproduce the blood glucose
trajectories of real patients from a clinical trial conducted over six months.
We evaluate the performance of two closed-loop control algorithms (OpenAPS and
Basal Bolus) using the testbed and find that more advanced control algorithms
are able to keep blood glucose in a safe region 93.49% and 79.46% of the time
on average, compared with 66.18% of the time for the clinical trial. The fault
injection engine simulates the real recalls and adverse events reported to the
U.S. Food and Drug Administration (FDA) and demonstrates the resilience of the
controller in hazardous conditions. We used the testbed to generate 25 years of
synthetic data representing 20 different patient profiles with realistic
adverse event scenarios, which would have been expensive and risky to collect
in a clinical trial. The proposed testbed is a valid tool that can be used by
the research community to demonstrate the effectiveness of different control
algorithms and safety features for APS.
","[{'version': 'v1', 'created': 'Fri, 12 Aug 2022 19:50:28 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Sep 2022 14:37:57 GMT'}, {'version': 'v3', 'created': 'Mon, 10 Oct 2022 15:24:07 GMT'}, {'version': 'v4', 'created': 'Wed, 14 Dec 2022 05:02:43 GMT'}]",2022-12-15,"[['Zhou', 'Xugui', ''], ['Kouzel', 'Maxfield', ''], ['Ren', 'Haotian', ''], ['Alemzadeh', 'Homa', '']]","['Validity Assessment', 'Artificial Pancreas System', 'Testbed', 'AdverseEvent', 'Safety', 'Glucose Simulation', 'Diabetes']"
9969,2011.06134,Nam Chu,"Nam H. Chu, Dinh Thai Hoang, Diep N. Nguyen, Nguyen Van Huynh, and
  Eryk Dutkiewicz","Fast or Slow: An Autonomous Speed Control Approach for UAV-assisted IoT
  Data Collection Networks",,,10.1109/WCNC49053.2021.9417563,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Unmanned Aerial Vehicles (UAVs) have been emerging as an effective solution
for IoT data collection networks thanks to their outstanding flexibility,
mobility, and low operation costs. However, due to the limited energy and
uncertainty from the data collection process, speed control is one of the most
important factors to optimize the energy usage efficiency and performance for
UAV collectors. This work aims to develop a novel autonomous speed control
approach to address this issue. To that end, we first formulate the dynamic
speed control task of a UAV as a Markov decision process taking into account
its energy status and location. In this way, the Q-learning algorithm can be
adopted to obtain the optimal speed control policy for the UAV. To further
improve the system performance, we develop an highly-effective deep dueling
double Q-learning algorithm utilizing outstanding features of the deep neural
networks as well as advanced dueling architecture to quickly stabilize the
learning process and obtain the optimal policy. Through simulation results, we
show that our proposed solution can achieve up to 40% greater performance
compared with other conventional methods. Importantly, the simulation results
also reveal significant impacts of UAV's energy and charging time on the system
performance.
","[{'version': 'v1', 'created': 'Thu, 12 Nov 2020 00:38:36 GMT'}]",2021-06-22,"[['Chu', 'Nam H.', ''], ['Hoang', 'Dinh Thai', ''], ['Nguyen', 'Diep N.', ''], ['Van Huynh', 'Nguyen', ''], ['Dutkiewicz', 'Eryk', '']]","['IoT', 'UAV', 'data collection', 'speed control', 'deepQ-learning', 'MDP', 'deep dueling']"
9970,2107.03963,Igor Sfiligoi,"Igor Sfiligoi, Shava Smallen, Frank W\""urthwein, Nicole Wolter, David
  Schultz and Benedikt Riedel",Expanding IceCube GPU computing into the Clouds,"2 pages, 2 figures, to be published in proceedings of eScience 2021","2021 IEEE 17th International Conference on eScience (eScience),
  2021, pp. 227-228",10.1109/eScience51609.2021.00034,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  The IceCube collaboration relies on GPU compute for many of its needs,
including ray tracing simulation and machine learning activities. GPUs are
however still a relatively scarce commodity in the scientific resource provider
community, so we expanded the available resource pool with GPUs provisioned
from the commercial Cloud providers. The provisioned resources were fully
integrated into the normal IceCube workload management system through the Open
Science Grid (OSG) infrastructure and used CloudBank for budget management. The
result was an approximate doubling of GPU wall hours used by IceCube over a
period of 2 weeks, adding over 3.1 fp32 EFLOP hours for a price tag of about
$58k. This paper describes the setup used and the operational experience.
","[{'version': 'v1', 'created': 'Thu, 8 Jul 2021 16:42:27 GMT'}]",2021-11-02,"[['Sfiligoi', 'Igor', ''], ['Smallen', 'Shava', ''], ['Würthwein', 'Frank', ''], ['Wolter', 'Nicole', ''], ['Schultz', 'David', ''], ['Riedel', 'Benedikt', '']]","['cloud', 'distributed computing', 'gpus']"
9971,2102.00783,Andreas Kofler,"Andreas Kofler, Markus Haltmeier, Tobias Schaeffter and Christoph
  Kolbitsch","An End-To-End-Trainable Iterative Network Architecture for Accelerated
  Radial Multi-Coil 2D Cine MR Image Reconstruction",,,10.1002/mp.14809,,cs.LG cs.CV eess.IV,http://creativecommons.org/licenses/by/4.0/,"  Purpose: Iterative Convolutional Neural Networks (CNNs) which resemble
unrolled learned iterative schemes have shown to consistently deliver
state-of-the-art results for image reconstruction problems across different
imaging modalities. However, because these methodes include the forward model
in the architecture, their applicability is often restricted to either
relatively small reconstruction problems or to problems with operators which
are computationally cheap to compute. As a consequence, they have so far not
been applied to dynamic non-Cartesian multi-coil reconstruction problems.
Methods: In this work, we propose a CNN-architecture for image reconstruction
of accelerated 2D radial cine MRI with multiple receiver coils. The network is
based on a computationally light CNN-component and a subsequent conjugate
gradient (CG) method which can be jointly trained end-to-end using an efficient
training strategy. We investigate the proposed training-strategy and compare
our method to other well-known reconstruction techniques with learned and
non-learned regularization methods. Results: Our proposed method outperforms
all other methods based on non-learned regularization. Further, it performs
similar or better than a CNN-based method employing a 3D U-Net and a method
using adaptive dictionary learning. In addition, we empirically demonstrate
that even by training the network with only iteration, it is possible to
increase the length of the network at test time and further improve the
results. Conclusions: End-to-end training allows to highly reduce the number of
trainable parameters of and stabilize the reconstruction network. Further,
because it is possible to change the length of the network at test time, the
need to find a compromise between the complexity of the CNN-block and the
number of iterations in each CG-block becomes irrelevant.
","[{'version': 'v1', 'created': 'Mon, 1 Feb 2021 11:42:04 GMT'}]",2022-03-07,"[['Kofler', 'Andreas', ''], ['Haltmeier', 'Markus', ''], ['Schaeffter', 'Tobias', ''], ['Kolbitsch', 'Christoph', '']]","['Deep Learning', 'Neural Networks', 'Inverse Problems', 'Magnetic Resonance Imaging']"
9972,2203.08199,Asia Biega,Niall Docherty and Asia J. Biega,(Re)Politicizing Digital Well-Being: Beyond User Engagements,Published in Proceedings of CHI '22,,10.1145/3491102.3501857,,cs.CY cs.HC cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The psychological costs of the attention economy are often considered through
the binary of harmful design and healthy use, with digital well-being chiefly
characterised as a matter of personal responsibility. This article adopts an
interdisciplinary approach to highlight the empirical, ideological, and
political limits of embedding this individualised perspective in computational
discourses and designs of digital well-being measurement. We will reveal
well-being to be a culturally specific and environmentally conditioned concept
and will problematize user engagement as a universal proxy for well-being.
Instead, the contributing factors of user well-being will be located in
environing social, cultural, and political conditions far beyond the control of
individual users alone. In doing so, we hope to reinvigorate the issue of
digital well-being measurement as a nexus point of political concern, through
which multiple disciplines can study experiences of digital ill as symptomatic
of wider social inequalities and (capitalist) relations of power.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2022 18:55:33 GMT'}]",2022-03-17,"[['Docherty', 'Niall', ''], ['Biega', 'Asia J.', '']]","['well-being', 'user engagement', 'measurement', 'time well-spent', 'power']"
9973,1909.08982,Vasileios Iosifidis,Vasileios Iosifidis and Eirini Ntoutsi,AdaFair: Cumulative Fairness Adaptive Boosting,"10 pages, to appear in proceedings of the 28th ACM International
  Conference on Information and Knowledge Management (CIKM)",,10.1145/3357384.3357974,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The widespread use of ML-based decision making in domains with high societal
impact such as recidivism, job hiring and loan credit has raised a lot of
concerns regarding potential discrimination. In particular, in certain cases it
has been observed that ML algorithms can provide different decisions based on
sensitive attributes such as gender or race and therefore can lead to
discrimination. Although, several fairness-aware ML approaches have been
proposed, their focus has been largely on preserving the overall classification
accuracy while improving fairness in predictions for both protected and
non-protected groups (defined based on the sensitive attribute(s)). The overall
accuracy however is not a good indicator of performance in case of class
imbalance, as it is biased towards the majority class. As we will see in our
experiments, many of the fairness-related datasets suffer from class imbalance
and therefore, tackling fairness requires also tackling the imbalance problem.
  To this end, we propose AdaFair, a fairness-aware classifier based on
AdaBoost that further updates the weights of the instances in each boosting
round taking into account a cumulative notion of fairness based upon all
current ensemble members, while explicitly tackling class-imbalance by
optimizing the number of ensemble members for balanced classification error.
Our experiments show that our approach can achieve parity in true positive and
true negative rates for both protected and non-protected groups, while it
significantly outperforms existing fairness-aware methods up to 25% in terms of
balanced error.
","[{'version': 'v1', 'created': 'Tue, 17 Sep 2019 10:09:05 GMT'}]",2020-01-24,"[['Iosifidis', 'Vasileios', ''], ['Ntoutsi', 'Eirini', '']]","['fairness-aware classifcation', 'boosting', 'class imbalance']"
9974,1905.13716,Beatrice {\AA}kerblom,"Beatrice \~A kerblom (Stockholm University, Sweden), Elias Castegren
  (KTH Royal Institute of Technology, Sweden), Tobias Wrigstad (Uppsala
  University, Sweden)",Reference Capabilities for Safe Parallel Array Programming,,"The Art, Science, and Engineering of Programming, 2020, Vol. 4,
  Issue 1, Article 1",10.22152/programming-journal.org/2020/4/1,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The array is a fundamental data structure that provides an efficient way to
store and retrieve non-sparse data contiguous in memory. Arrays are important
for the performance of many memory-intensive applications due to the design of
modern memory hierarchies: contiguous storage facilitates spatial locality and
predictive access patterns which enables prefetching. Operations on large
arrays often lend themselves well to parallelisation, such as a fork-join style
divide-and-conquer algorithm for sorting. For parallel operations on arrays to
be deterministic, data-race freedom must be guaranteed. For operations on
arrays of primitive data, data-race freedom is obtained by coordinating
accesses so that no two threads operate on the same array indices. This is
however not enough for arrays of non-primitives due to aliasing: accesses of
separate array elements may return pointers to the same object, or overlapping
structures. Reference capabilities have been used successfully in the past to
statically guarantee the absence of data-races in object-oriented programs.
This paper presents the first extension of reference capabilities -- called
array capabilities -- that support concurrent and parallel operations on arrays
of both primitive and non-primitive values. In addition to element access,
array capabilities support the abstract manipulation of arrays, logical
splitting of arrays into subarrays, and merging subarrays. These operations
allow expressing a wide range of array use cases. This paper presents the array
capability design space and show how it applies to a number of array use cases.
The core ideas are formalised and proven sound in a simple calculus, along with
a proof that shows that well-typed programs with array capabilities are free
from data-races.
","[{'version': 'v1', 'created': 'Fri, 31 May 2019 16:53:22 GMT'}, {'version': 'v2', 'created': 'Mon, 5 Aug 2019 09:41:12 GMT'}]",2019-08-06,"[['kerblom', 'Beatrice Ã', '', 'Stockholm University, Sweden'], ['Castegren', 'Elias', '', 'KTH Royal Institute of Technology, Sweden'], ['Wrigstad', 'Tobias', '', 'Uppsala\n  University, Sweden']]","['Type systems', 'Capabilities', 'Parallelism', 'Arrays']"
9975,2008.04556,Tianhao Zhang,"Tianhao Zhang, Hung-Yu Tseng, Lu Jiang, Weilong Yang, Honglak Lee,
  Irfan Essa",Text as Neural Operator: Image Manipulation by Text Instruction,,,10.1145/3474085.3475343,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, text-guided image manipulation has gained increasing
attention in the multimedia and computer vision community. The input to
conditional image generation has evolved from image-only to multimodality. In
this paper, we study a setting that allows users to edit an image with multiple
objects using complex text instructions to add, remove, or change the objects.
The inputs of the task are multimodal including (1) a reference image and (2)
an instruction in natural language that describes desired modifications to the
image. We propose a GAN-based method to tackle this problem. The key idea is to
treat text as neural operators to locally modify the image feature. We show
that the proposed model performs favorably against recent strong baselines on
three public datasets. Specifically, it generates images of greater fidelity
and semantic relevance, and when used as a image query, leads to better
retrieval performance.
","[{'version': 'v1', 'created': 'Tue, 11 Aug 2020 07:07:10 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Aug 2020 02:35:11 GMT'}, {'version': 'v3', 'created': 'Sun, 18 Oct 2020 08:39:15 GMT'}, {'version': 'v4', 'created': 'Mon, 29 Nov 2021 16:48:56 GMT'}]",2021-11-30,"[['Zhang', 'Tianhao', ''], ['Tseng', 'Hung-Yu', ''], ['Jiang', 'Lu', ''], ['Yang', 'Weilong', ''], ['Lee', 'Honglak', ''], ['Essa', 'Irfan', '']]","['Deep Neural Networks', 'Generative Adversarial Network', 'Multimodal Content Creation', 'Natural Language', 'Multimedia Retrieval']"
9976,2210.06858,Jonas Fritzsch,"Jonas Fritzsch, Justus Bogner, Markus Haug, Ana Cristina Franco da
  Silva, Carolin Rubner, Matthias Saft, Horst Sauer, Stefan Wagner","Adopting Microservices and DevOps in the Cyber-Physical Systems Domain:
  A Rapid Review and Case Study","10 pages, 8 figures, accepted for publication at ""Software: Practice
  and Experience - Wiley Online Library""",,10.1002/spe.3169,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The domain of cyber-physical systems (CPS) has recently seen strong growth,
e.g., due to the rise of the Internet of Things (IoT) in industrial domains,
commonly referred to as ""Industry 4.0"". However, CPS challenges like the strong
hardware focus can impact modern software development practices, especially in
the context of modernizing legacy systems. While microservices and DevOps have
been widely studied for enterprise applications, there is insufficient coverage
for the CPS domain. Our goal is therefore to analyze the peculiarities of such
systems regarding challenges and practices for using and migrating towards
microservices and DevOps. We conducted a rapid review based on 146 scientific
papers, and subsequently validated our findings in an interview-based case
study with 9 CPS professionals in different business units at Siemens AG. The
combined results picture the specifics of microservices and DevOps in the CPS
domain. While several differences were revealed that may require adapted
methods, many challenges and practices are shared with typical enterprise
applications. Our study supports CPS researchers and practitioners with a
summary of challenges, practices to address them, and research opportunities.
","[{'version': 'v1', 'created': 'Thu, 13 Oct 2022 09:18:45 GMT'}]",2022-11-22,"[['Fritzsch', 'Jonas', ''], ['Bogner', 'Justus', ''], ['Haug', 'Markus', ''], ['da Silva', 'Ana Cristina Franco', ''], ['Rubner', 'Carolin', ''], ['Saft', 'Matthias', ''], ['Sauer', 'Horst', ''], ['Wagner', 'Stefan', '']]","['microservices', 'DevOps', 'cyber-physical systems', 'rapid review', 'case study', 'interviews']"
9977,1704.05143,Joost Huizinga,"Joost Huizinga, Kenneth O. Stanley, and Jeff Clune","The Emergence of Canalization and Evolvability in an Open-Ended,
  Interactive Evolutionary System",SI can be found at: http://www.evolvingai.org/files/SI_0.zip,"Artificial life, 24(3), pp.157-181 (2018)",10.1162/artl_a_00263,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Natural evolution has produced a tremendous diversity of functional
organisms. Many believe an essential component of this process was the
evolution of evolvability, whereby evolution speeds up its ability to innovate
by generating a more adaptive pool of offspring. One hypothesized mechanism for
evolvability is developmental canalization, wherein certain dimensions of
variation become more likely to be traversed and others are prevented from
being explored (e.g. offspring tend to have similarly sized legs, and mutations
affect the length of both legs, not each leg individually). While ubiquitous in
nature, canalization almost never evolves in computational simulations of
evolution. Not only does that deprive us of in silico models in which to study
the evolution of evolvability, but it also raises the question of which
conditions give rise to this form of evolvability. Answering this question
would shed light on why such evolvability emerged naturally and could
accelerate engineering efforts to harness evolution to solve important
engineering challenges. In this paper we reveal a unique system in which
canalization did emerge in computational evolution. We document that genomes
entrench certain dimensions of variation that were frequently explored during
their evolutionary history. The genetic representation of these organisms also
evolved to be highly modular and hierarchical, and we show that these
organizational properties correlate with increased fitness. Interestingly, the
type of computational evolutionary experiment that produced this evolvability
was very different from traditional digital evolution in that there was no
objective, suggesting that open-ended, divergent evolutionary processes may be
necessary for the evolution of evolvability.
","[{'version': 'v1', 'created': 'Mon, 17 Apr 2017 22:50:04 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Feb 2019 18:46:48 GMT'}]",2019-02-15,"[['Huizinga', 'Joost', ''], ['Stanley', 'Kenneth O.', ''], ['Clune', 'Jeff', '']]","['Generative encoding', 'interactive evolutionary computation', 'canalization', 'structural organization', 'divergent search']"
9978,2009.11799,Jiwon Seo,"Sanghyun Kim, Jongmin Park, Jae-Kwan Yun, and Jiwon Seo","Motion Planning by Reinforcement Learning for an Unmanned Aerial Vehicle
  in Virtual Open Space with Static Obstacles",Submitted to ICCAS 2020,"2020 20th International Conference on Control, Automation and
  Systems (ICCAS)",10.23919/ICCAS50221.2020.9268253,,cs.RO cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, we applied reinforcement learning based on the proximal policy
optimization algorithm to perform motion planning for an unmanned aerial
vehicle (UAV) in an open space with static obstacles. The application of
reinforcement learning through a real UAV has several limitations such as time
and cost; thus, we used the Gazebo simulator to train a virtual quadrotor UAV
in a virtual environment. As the reinforcement learning progressed, the mean
reward and goal rate of the model were increased. Furthermore, the test of the
trained model shows that the UAV reaches the goal with an 81% goal rate using
the simple reward function suggested in this work.
","[{'version': 'v1', 'created': 'Thu, 24 Sep 2020 16:42:56 GMT'}]",2020-12-17,"[['Kim', 'Sanghyun', ''], ['Park', 'Jongmin', ''], ['Yun', 'Jae-Kwan', ''], ['Seo', 'Jiwon', '']]","['motion planning', 'unmanned aerial vehicle (UAV)', 'reinforcement learning', 'proximal policy optimization (PPO)']"
9979,2206.01496,Hristo Petkov,"Hristo Petkov, Colin Hanley and Feng Dong",Causality Learning With Wasserstein Generative Adversarial Networks,arXiv admin note: substantial text overlap with arXiv:2204.00387,,10.5121/ijaia.2022.13301,,cs.LG cs.AI stat.ME,http://creativecommons.org/licenses/by/4.0/,"  Conventional methods for causal structure learning from data face significant
challenges due to combinatorial search space. Recently, the problem has been
formulated into a continuous optimization framework with an acyclicity
constraint to learn Directed Acyclic Graphs (DAGs). Such a framework allows the
utilization of deep generative models for causal structure learning to better
capture the relations between data sample distributions and DAGs. However, so
far no study has experimented with the use of Wasserstein distance in the
context of causal structure learning. Our model named DAG-WGAN combines the
Wasserstein-based adversarial loss with an acyclicity constraint in an
auto-encoder architecture. It simultaneously learns causal structures while
improving its data generation capability. We compare the performance of
DAG-WGAN with other models that do not involve the Wasserstein metric in order
to identify its contribution to causal structure learning. Our model performs
better with high cardinality data according to our experiments.
","[{'version': 'v1', 'created': 'Fri, 3 Jun 2022 10:45:47 GMT'}]",2022-06-06,"[['Petkov', 'Hristo', ''], ['Hanley', 'Colin', ''], ['Dong', 'Feng', '']]","['Generative Adversarial Networks', 'Wasserstein Distance', 'Bayesian Networks', 'Causal Structure Learning', 'Directed Acyclic Graphs']"
9980,2002.11621,Adriano Fazzone,"Giorgio Barnab\`o and Adriano Fazzone and Stefano Leonardi and Chris
  Schwiegelshohn",Algorithms for Fair Team Formation in Online Labour Marketplaces,"Accepted at ""FATES 2019 : 1st Workshop on Fairness, Accountability,
  Transparency, Ethics, and Society on the Web"" (http://fates19.isti.cnr.it)","""Companion Proceedings of The 2019 World Wide Web Conference"",
  2019, pages 484-490",10.1145/3308560.3317587,,cs.CY cs.LG cs.SI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As freelancing work keeps on growing almost everywhere due to a sharp
decrease in communication costs and to the widespread of Internet-based labour
marketplaces (e.g., guru.com, feelancer.com, mturk.com, upwork.com), many
researchers and practitioners have started exploring the benefits of
outsourcing and crowdsourcing. Since employers often use these platforms to
find a group of workers to complete a specific task, researchers have focused
their efforts on the study of team formation and matching algorithms and on the
design of effective incentive schemes. Nevertheless, just recently, several
concerns have been raised on possibly unfair biases introduced through the
algorithms used to carry out these selection and matching procedures. For this
reason, researchers have started studying the fairness of algorithms related to
these online marketplaces, looking for intelligent ways to overcome the
algorithmic bias that frequently arises. Broadly speaking, the aim is to
guarantee that, for example, the process of hiring workers through the use of
machine learning and algorithmic data analysis tools does not discriminate,
even unintentionally, on grounds of nationality or gender. In this short paper,
we define the Fair Team Formation problem in the following way: given an online
labour marketplace where each worker possesses one or more skills, and where
all workers are divided into two or more not overlapping classes (for examples,
men and women), we want to design an algorithm that is able to find a team with
all the skills needed to complete a given task, and that has the same number of
people from all classes. We provide inapproximability results for the Fair Team
Formation problem together with four algorithms for the problem itself. We also
tested the effectiveness of our algorithmic solutions by performing experiments
using real data from an online labor marketplace.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 11:33:35 GMT'}]",2020-02-27,"[['Barnabò', 'Giorgio', ''], ['Fazzone', 'Adriano', ''], ['Leonardi', 'Stefano', ''], ['Schwiegelshohn', 'Chris', '']]","['Fairness', 'Team Formation', 'Fair Set Cover', 'Outsourcing', 'Crowdsourcing']"
9981,1910.00772,Gang Wang,"Gang Wang, Yanyuan Qin","MAC Protocols for Wireless Mesh Networks with Multi-beam Antennas: A
  Survey","22 pages, 6 figures, Future of Information and Communication
  Conference (FICC) 2019, https://doi.org/10.1007/978-3-030-12388-8_9",Future of Information and Communication Conference (FICC) 2019,10.1007/978-3-030-12388-8_9,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-beam antenna technologies have provided lots of promising solutions to
many current challenges faced in wireless mesh networks. The antenna can
establish several beamformings simultaneously and initiate concurrent
transmissions or receptions using multiple beams, thereby increasing the
overall throughput of the network transmission. Multi-beam antenna has the
ability to increase the spatial reuse, extend the transmission range, improve
the transmission reliability, as well as save the power consumption.
Traditional Medium Access Control (MAC) protocols for wireless network largely
relied on the IEEE 802.11 Distributed Coordination Function(DCF) mechanism,
however, IEEE 802.11 DCF cannot take the advantages of these unique
capabilities provided by multi-beam antennas. This paper surveys the MAC
protocols for wireless mesh networks with multi-beam antennas. The paper first
discusses some basic information in designing multi-beam antenna system and MAC
protocols, and then presents the main challenges for the MAC protocols in
wireless mesh networks compared with the traditional MAC protocols. A
qualitative comparison of the existing MAC protocols is provided to highlight
their novel features, which provides a reference for designing the new MAC
protocols. To provide some insights on future research, several open issues of
MAC protocols are discussed for wireless mesh networks using multi-beam
antennas.
","[{'version': 'v1', 'created': 'Wed, 2 Oct 2019 04:24:34 GMT'}]",2019-10-03,"[['Wang', 'Gang', ''], ['Qin', 'Yanyuan', '']]","['MAC Protocols', 'Wireless Mesh Networks', 'Multi-beam Antennas']"
9982,2004.11282,Emil Je\v{r}\'abek,Emil Je\v{r}\'abek,On the proof complexity of logics of bounded branching,60 pages,"Annals of Pure and Applied Logic 174 (2023), no. 1, article no.
  103181",10.1016/j.apal.2022.103181,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the proof complexity of extended Frege (EF) systems for basic
transitive modal logics (K4, S4, GL, ...) augmented with the bounded branching
axioms $\mathbf{BB}_k$. First, we study feasibility of the disjunction property
and more general extension rules in EF systems for these logics: we show that
the corresponding decision problems reduce to total coNP search problems (or
equivalently, disjoint NP pairs, in the binary case); more precisely, the
decision problem for extension rules is equivalent to a certain special case of
interpolation for the classical EF system. Next, we use this characterization
to prove superpolynomial (or even exponential, with stronger hypotheses)
separations between EF and substitution Frege (SF) systems for all transitive
logics contained in $\mathbf{S4.2GrzBB_2}$ or $\mathbf{GL.2BB_2}$ under some
assumptions weaker than $\mathrm{PSPACE \ne NP}$. We also prove analogous
results for superintuitionistic logics: we characterize the decision complexity
of multi-conclusion Visser's rules in EF systems for Gabbay--de Jongh logics
$\mathbf T_k$, and we show conditional separations between EF and SF for all
intermediate logics contained in $\mathbf{T_2 + KC}$.
","[{'version': 'v1', 'created': 'Thu, 23 Apr 2020 16:11:12 GMT'}, {'version': 'v2', 'created': 'Mon, 16 May 2022 12:29:12 GMT'}]",2022-08-18,"[['Jeřábek', 'Emil', '']]","['proof complexity', 'modal logic', 'intermediate logic', 'extended Frege system', 'disjunction property']"
9983,1904.11243,Juan Pedro Dominguez-Morales,"Daniel Gutierrez-Galan, Juan Pedro Dominguez-Morales, Fernando
  Perez-Pena, Alejandro Linares-Barranco",NeuroPod: a real-time neuromorphic spiking CPG applied to robotics,,,10.1016/j.neucom.2019.11.007,,cs.RO cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Initially, robots were developed with the aim of making our life easier,
carrying out repetitive or dangerous tasks for humans. Although they were able
to perform these tasks, the latest generation of robots are being designed to
take a step further, by performing more complex tasks that have been carried
out by smart animals or humans up to date. To this end, inspiration needs to be
taken from biological examples. For instance, insects are able to optimally
solve complex environment navigation problems, and many researchers have
started to mimic how these insects behave. Recent interest in neuromorphic
engineering has motivated us to present a real-time, neuromorphic, spike-based
Central Pattern Generator of application in neurorobotics, using an
arthropod-like robot. A Spiking Neural Network was designed and implemented on
SpiNNaker. The network models a complex, online-change capable Central Pattern
Generator which generates three gaits for a hexapod robot locomotion.
Reconfigurable hardware was used to manage both the motors of the robot and the
real-time communication interface with the Spiking Neural Networks. Real-time
measurements confirm the simulation results, and locomotion tests show that
NeuroPod can perform the gaits without any balance loss or added delay.
","[{'version': 'v1', 'created': 'Thu, 25 Apr 2019 09:55:50 GMT'}]",2019-12-04,"[['Gutierrez-Galan', 'Daniel', ''], ['Dominguez-Morales', 'Juan Pedro', ''], ['Perez-Pena', 'Fernando', ''], ['Linares-Barranco', 'Alejandro', '']]","['Neurorobotics', 'SpiNNaker', 'Central Pattern Generator', 'SpikingNeural Network', 'Neuromorphic Hardware', 'FPGA']"
9984,2009.12966,Bruno Klaus de Aquino Afonso,"Bruno Klaus de Aquino Afonso, Lilian Berton",Analysis of label noise in graph-based semi-supervised learning,,,10.1145/3341105.3374013,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In machine learning, one must acquire labels to help supervise a model that
will be able to generalize to unseen data. However, the labeling process can be
tedious, long, costly, and error-prone. It is often the case that most of our
data is unlabeled. Semi-supervised learning (SSL) alleviates that by making
strong assumptions about the relation between the labels and the input data
distribution. This paradigm has been successful in practice, but most SSL
algorithms end up fully trusting the few available labels. In real life, both
humans and automated systems are prone to mistakes; it is essential that our
algorithms are able to work with labels that are both few and also unreliable.
Our work aims to perform an extensive empirical evaluation of existing
graph-based semi-supervised algorithms, like Gaussian Fields and Harmonic
Functions, Local and Global Consistency, Laplacian Eigenmaps, Graph
Transduction Through Alternating Minimization. To do that, we compare the
accuracy of classifiers while varying the amount of labeled data and label
noise for many different samples. Our results show that, if the dataset is
consistent with SSL assumptions, we are able to detect the noisiest instances,
although this gets harder when the number of available labels decreases. Also,
the Laplacian Eigenmaps algorithm performed better than label propagation when
the data came from high-dimensional clusters.
","[{'version': 'v1', 'created': 'Sun, 27 Sep 2020 22:13:20 GMT'}]",2020-09-29,"[['Afonso', 'Bruno Klaus de Aquino', ''], ['Berton', 'Lilian', '']]","['Machine learning', 'semi-supervised learning', 'graph-based algorithms', 'classification', 'label noise']"
9985,1909.11573,Thanh Thi Nguyen,"Thanh Thi Nguyen, Quoc Viet Hung Nguyen, Dung Tien Nguyen, Duc Thanh
  Nguyen, Thien Huynh-The, Saeid Nahavandi, Thanh Tam Nguyen, Quoc-Viet Pham,
  Cuong M. Nguyen",Deep Learning for Deepfakes Creation and Detection: A Survey,,"Computer Vision and Image Understanding, 223 (2022) 103525",10.1016/j.cviu.2022.103525,,cs.CV cs.LG eess.IV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Deep learning has been successfully applied to solve various complex problems
ranging from big data analytics to computer vision and human-level control.
Deep learning advances however have also been employed to create software that
can cause threats to privacy, democracy and national security. One of those
deep learning-powered applications recently emerged is deepfake. Deepfake
algorithms can create fake images and videos that humans cannot distinguish
them from authentic ones. The proposal of technologies that can automatically
detect and assess the integrity of digital visual media is therefore
indispensable. This paper presents a survey of algorithms used to create
deepfakes and, more importantly, methods proposed to detect deepfakes in the
literature to date. We present extensive discussions on challenges, research
trends and directions related to deepfake technologies. By reviewing the
background of deepfakes and state-of-the-art deepfake detection methods, this
study provides a comprehensive overview of deepfake techniques and facilitates
the development of new and more robust methods to deal with the increasingly
challenging deepfakes.
","[{'version': 'v1', 'created': 'Wed, 25 Sep 2019 16:03:45 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Jul 2020 17:54:11 GMT'}, {'version': 'v3', 'created': 'Mon, 26 Apr 2021 05:23:48 GMT'}, {'version': 'v4', 'created': 'Sun, 6 Feb 2022 06:58:58 GMT'}, {'version': 'v5', 'created': 'Thu, 11 Aug 2022 09:56:02 GMT'}]",2022-08-12,"[['Nguyen', 'Thanh Thi', ''], ['Nguyen', 'Quoc Viet Hung', ''], ['Nguyen', 'Dung Tien', ''], ['Nguyen', 'Duc Thanh', ''], ['Huynh-The', 'Thien', ''], ['Nahavandi', 'Saeid', ''], ['Nguyen', 'Thanh Tam', ''], ['Pham', 'Quoc-Viet', ''], ['Nguyen', 'Cuong M.', '']]","['deepfakes', 'face manipulation', 'artificial intelligence', 'deep learning', 'autoencoders', 'GAN', 'forensics', 'survey']"
9986,2301.05897,Erik Isai Valle Salgado,"Erik Isai Valle Salgado, Haoxin Yan, Yue Hong, Peiyuan Zhu, Shidong
  Zhu, Chengwei Liao, Yanxiang Wen, Xiu Li, Xiang Qian, Xiaohao Wang, Xinghui
  Li","Model-based Transfer Learning for Automatic Optical Inspection based on
  domain discrepancy","This is a fix of the published paper ""Relational-based transfer
  learning for automatic optical inspection based on domain discrepancy""","Proc. SPIE 12317, Optoelectronic Imaging and Multimedia Technology
  IXMultimedia Technology IX, 2023",10.1117/12.2644087 10.1117/12.2644087,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Transfer learning is a promising method for AOI applications since it can
significantly shorten sample collection time and improve efficiency in today's
smart manufacturing. However, related research enhanced the network models by
applying TL without considering the domain similarity among datasets, the data
long-tailedness of a source dataset, and mainly used linear transformations to
mitigate the lack of samples. This research applies model-based TL via domain
similarity to improve the overall performance and data augmentation in both
target and source domains to enrich the data quality and reduce the imbalance.
Given a group of source datasets from similar industrial processes, we define
which group is the most related to the target through the domain discrepancy
score and the number of samples each has. Then, we transfer the chosen
pre-trained backbone weights to train and fine-tune the target network. Our
research suggests increases in the F1 score and the PR curve up to 20% compared
with TL using benchmark datasets.
","[{'version': 'v1', 'created': 'Sat, 14 Jan 2023 11:32:39 GMT'}]",2023-01-18,"[['Salgado', 'Erik Isai Valle', ''], ['Yan', 'Haoxin', ''], ['Hong', 'Yue', ''], ['Zhu', 'Peiyuan', ''], ['Zhu', 'Shidong', ''], ['Liao', 'Chengwei', ''], ['Wen', 'Yanxiang', ''], ['Li', 'Xiu', ''], ['Qian', 'Xiang', ''], ['Wang', 'Xiaohao', ''], ['Li', 'Xinghui', '']]","['machine vision', 'automatic optical inspection (AOI)', 'transfer learning', 'domain similarity', 'data augmentation', 'supervised learning', 'domain discrepancy']"
9987,2103.02598,Nikolay Nikitin,"Nikolay O. Nikitin, Ilia Revin, Alexander Hvatov, Pavel Vychuzhanin,
  Anna V. Kalyuzhnaya","Hybrid and Automated Machine Learning Approaches for Oil Fields
  Development: the Case Study of Volve Field, North Sea",30 pages,,10.1016/j.cageo.2022.105061,,cs.LG physics.geo-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper describes the usage of intelligent approaches for field development
tasks that may assist a decision-making process. We focused on the problem of
wells location optimization and two tasks within it: improving the quality of
oil production estimation and estimation of reservoir characteristics for
appropriate wells allocation and parametrization, using machine learning
methods. For oil production estimation, we implemented and investigated the
quality of forecasting models: physics-based, pure data-driven, and hybrid one.
The CRMIP model was chosen as a physics-based approach. We compare it with the
machine learning and hybrid methods in a frame of oil production forecasting
task. In the investigation of reservoir characteristics for wells location
choice, we automated the seismic analysis using evolutionary identification of
convolutional neural network for the reservoir detection. The Volve oil field
dataset was used as a case study to conduct the experiments. The implemented
approaches can be used to analyze different oil fields or adapted to similar
physics-related problems.
","[{'version': 'v1', 'created': 'Wed, 3 Mar 2021 18:51:46 GMT'}, {'version': 'v2', 'created': 'Mon, 24 May 2021 19:46:45 GMT'}, {'version': 'v3', 'created': 'Thu, 24 Feb 2022 20:03:09 GMT'}]",2022-02-28,"[['Nikitin', 'Nikolay O.', ''], ['Revin', 'Ilia', ''], ['Hvatov', 'Alexander', ''], ['Vychuzhanin', 'Pavel', ''], ['Kalyuzhnaya', 'Anna V.', '']]","['Machine learning', 'CRM', 'Hybrid model', 'Oil productionforecasting', 'Seismic analysis', 'CNN', 'composite AI']"
9988,1704.02402,Yuhang Wu,"Yuhang Wu, Shishir K. Shah, Ioannis A. Kakadiaris","GoDP: Globally optimized dual pathway system for facial landmark
  localization in-the-wild","Accepted by Image and Vision Computing in December, 2017","Image and Vision Computing, 2018",10.1016/j.imavis.2017.12.002,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Facial landmark localization is a fundamental module for pose-invariant face
recognition. The most common approach for facial landmark detection is cascaded
regression, which is composed of two steps: feature extraction and facial shape
regression. Recent methods employ deep convolutional networks to extract robust
features for each step, while the whole system could be regarded as a deep
cascaded regression architecture. In this work, instead of employing a deep
regression network, a Globally Optimized Dual-Pathway (GoDP) deep architecture
is proposed to identify the target pixels through solving a cascaded pixel
labeling problem without resorting to high-level inference models or complex
stacked architecture. The proposed end-to-end system relies on distance-aware
softmax functions and dual-pathway proposal-refinement architecture. Results
show that it outperforms the state-of-the-art cascaded regression-based methods
on multiple in-the-wild face alignment databases. The model achieves 1.84
normalized mean error (NME) on the AFLW database, which outperforms 3DDFA by
61.8%. Experiments on face identification demonstrate that GoDP, coupled with
DPM-headhunter, is able to improve rank-1 identification rate by 44.2% compared
to Dlib toolbox on a challenging database.
","[{'version': 'v1', 'created': 'Fri, 7 Apr 2017 23:39:29 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Dec 2017 15:14:18 GMT'}]",2018-04-04,"[['Wu', 'Yuhang', ''], ['Shah', 'Shishir K.', ''], ['Kakadiaris', 'Ioannis A.', '']]","['Deep Learning', 'facial landmark localization', 'face alignment', 'face']"
9989,2107.10164,Vassilis Zafeiris Dr,"Katerina Paltoglou, Vassilis E. Zafeiris, N. A. Diamantidis, E. A.
  Giakoumakis",Automated Refactoring of Legacy JavaScript Code to ES6 Modules,Accepted to Journal of Systems and Software,Journal of Systems and Software 181 (2021),10.1016/j.jss.2021.111049,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The JavaScript language did not specify, until ECMAScript 6 (ES6), native
features for streamlining encapsulation and modularity. Developer community
filled the gap with a proliferation of design patterns and module formats, with
impact on code reusability, portability and complexity of build configurations.
This work studies the automated refactoring of legacy ES5 code to ES6 modules
with fine-grained reuse of module contents through the named import/export
language constructs. The focus is on reducing the coupling of refactored
modules through destructuring exported module objects to fine-grained module
features and enhancing module dependencies by leveraging the ES6 syntax. We
employ static analysis to construct a model of a JavaScript project, the Module
Dependence Graph (MDG), that represents modules and their dependencies. On the
basis of MDG we specify the refactoring procedure for module migration to ES6.
A prototype implementation has been empirically evaluated on 19 open source
projects. Results highlight the relevance of the refactoring with a developer
intent for fine-grained reuse. The analysis of refactored code shows an
increase in the number of reusable elements per project and reduction in the
coupling of refactored modules. The soundness of the refactoring is empirically
validated through code inspection and execution of projects' test suites.
","[{'version': 'v1', 'created': 'Wed, 21 Jul 2021 15:48:48 GMT'}]",2022-05-10,"[['Paltoglou', 'Katerina', ''], ['Zafeiris', 'Vassilis E.', ''], ['Diamantidis', 'N. A.', ''], ['Giakoumakis', 'E. A.', '']]","['Refactoring', 'Code migration', 'Module object destructuring', 'ES6modules', 'AMD/CommonJS']"
9990,1801.07438,David Cerna,David M. Cerna and Temur Kutsia,Higher-Order Equational Pattern Anti-Unification [Preprint],Submitted to FSCD 2018,,10.4230/LIPIcs.FSCD.2018.12,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider anti-unification for simply typed lambda terms in associative,
commutative, and associative-commutative theories and develop a sound and
complete algorithm which takes two lambda terms and computes their
generalizations in the form of higher-order patterns. The problem is finitary:
the minimal complete set of generalizations contains finitely many elements. We
define the notion of optimal solution and investigate special fragments of the
problem for which the optimal solution can be computed in linear or polynomial
time.
","[{'version': 'v1', 'created': 'Tue, 23 Jan 2018 08:44:54 GMT'}]",2022-08-02,"[['Cerna', 'David M.', ''], ['Kutsia', 'Temur', '']]","['Simply typed lambda calculus', 'anti-unification', 'equational theories']"
9991,2106.07356,Zhenhui Xu,"Zhenhui Xu, Meng Zhao, Liqun Liu, Lei Xiao, Xiaopeng Zhang and Bifeng
  Zhang","Mixture of Virtual-Kernel Experts for Multi-Objective User Profile
  Modeling","11 pages, accepted by SIGKDD'2022",,10.1145/3534678.3539062,AMSDM00,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In industrial applications like online advertising and recommendation
systems, diverse and accurate user profiles can greatly help improve
personalization. Deep learning is widely applied to mine expressive tags to
users from their historical interactions in the system, e.g., click, conversion
action in the advertising chain. The usual approach is to take a certain action
as the objective, and introduce multiple independent Two-Tower models to
predict the possibility of users' action on tags (known as CTR or CVR
prediction). The predicted users' high probably attractive tags are to
represent their preferences. However, the single-action models cannot learn
complementarily and support effective training on data-sparse actions. Besides,
limited by the lack of information fusion between the two towers, the model
learns insufficiently to represent users' preferences on various tag
\textbf{topics} well. This paper introduces a novel multi-task model called
Mixture of Virtual-Kernel Experts (MVKE) to learn user preferences on various
actions and topics unitedly. In MVKE, we propose a concept of Virtual-Kernel
Expert, which focuses on modeling one particular facet of the user's
preferences, and all of them learn coordinately. Besides, the gate-based
structure used in MVKE builds an information fusion bridge between two towers,
improving the model's capability and maintaining high efficiency. We apply the
model in Tencent Advertising System, where both online and offline evaluations
show that our method has a significant improvement compared with the existing
ones and brings about an obvious lift to actual advertising revenue.
","[{'version': 'v1', 'created': 'Fri, 4 Jun 2021 07:52:52 GMT'}, {'version': 'v2', 'created': 'Tue, 31 May 2022 04:30:44 GMT'}]",2022-06-01,"[['Xu', 'Zhenhui', ''], ['Zhao', 'Meng', ''], ['Liu', 'Liqun', ''], ['Xiao', 'Lei', ''], ['Zhang', 'Xiaopeng', ''], ['Zhang', 'Bifeng', '']]","['multi-task learning', 'feature interaction', 'user profiling', 'online advertising', 'personalization']"
9992,2005.04717,Xueyuan Han,"Xueyuan Han, James Mickens, Ashish Gehani, Margo Seltzer, Thomas
  Pasquier",Xanthus: Push-button Orchestration of Host Provenance Data Collection,"6 pages, 1 figure, 7 listings, 1 table, workshop",,10.1145/3391800.3398175,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Host-based anomaly detectors generate alarms by inspecting audit logs for
suspicious behavior. Unfortunately, evaluating these anomaly detectors is hard.
There are few high-quality, publicly-available audit logs, and there are no
pre-existing frameworks that enable push-button creation of realistic system
traces. To make trace generation easier, we created Xanthus, an automated tool
that orchestrates virtual machines to generate realistic audit logs. Using
Xanthus' simple management interface, administrators select a base VM image,
configure a particular tracing framework to use within that VM, and define
post-launch scripts that collect and save trace data. Once data collection is
finished, Xanthus creates a self-describing archive, which contains the VM, its
configuration parameters, and the collected trace data. We demonstrate that
Xanthus hides many of the tedious (yet subtle) orchestration tasks that humans
often get wrong; Xanthus avoids mistakes that lead to non-replicable
experiments.
","[{'version': 'v1', 'created': 'Sun, 10 May 2020 17:19:30 GMT'}]",2020-05-12,"[['Han', 'Xueyuan', ''], ['Mickens', 'James', ''], ['Gehani', 'Ashish', ''], ['Seltzer', 'Margo', ''], ['Pasquier', 'Thomas', '']]","['computer security', 'data provenance', 'data replicability']"
9993,2202.00245,Yunjiang Jiang,"Dadong Miao, Yanan Wang, Guoyu Tang, Lin Liu, Sulong Xu, Bo Long, Yun
  Xiao, Lingfei Wu, Yunjiang Jiang",Sequential Search with Off-Policy Reinforcement Learning,"10 pages, 7 figures, CIKM 2021",,10.1145/3459637.3481954,,cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Recent years have seen a significant amount of interests in Sequential
Recommendation (SR), which aims to understand and model the sequential user
behaviors and the interactions between users and items over time. Surprisingly,
despite the huge success Sequential Recommendation has achieved, there is
little study on Sequential Search (SS), a twin learning task that takes into
account a user's current and past search queries, in addition to behavior on
historical query sessions. The SS learning task is even more important than the
counterpart SR task for most of E-commence companies due to its much larger
online serving demands as well as traffic volume.
  To this end, we propose a highly scalable hybrid learning model that consists
of an RNN learning framework leveraging all features in short-term user-item
interactions, and an attention model utilizing selected item-only features from
long-term interactions. As a novel optimization step, we fit multiple short
user sequences in a single RNN pass within a training batch, by solving a
greedy knapsack problem on the fly. Moreover, we explore the use of off-policy
reinforcement learning in multi-session personalized search ranking.
Specifically, we design a pairwise Deep Deterministic Policy Gradient model
that efficiently captures users' long term reward in terms of pairwise
classification error. Extensive ablation experiments demonstrate significant
improvement each component brings to its state-of-the-art baseline, on a
variety of offline and online metrics.
","[{'version': 'v1', 'created': 'Tue, 1 Feb 2022 06:52:40 GMT'}]",2022-02-02,"[['Miao', 'Dadong', ''], ['Wang', 'Yanan', ''], ['Tang', 'Guoyu', ''], ['Liu', 'Lin', ''], ['Xu', 'Sulong', ''], ['Long', 'Bo', ''], ['Xiao', 'Yun', ''], ['Wu', 'Lingfei', ''], ['Jiang', 'Yunjiang', '']]","['sequential-search', 'RNN', 'reinforcement-learning', 'actor-critic']"
9994,2204.03397,Diksha Goel,"Diksha Goel, Max Ward, Aneta Neumann, Frank Neumann, Hung Nguyen,
  Mingyu Guo","Defending Active Directory by Combining Neural Network based Dynamic
  Program and Evolutionary Diversity Optimisation","Added reference [12] on page 3 and 4. Corrected spelling EVC to VEC
  on page 10","Proceedings of the Genetic and Evolutionary Computation
  Conference, 2022, Pages 1191 to 1199",10.1145/3512290.3528729,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Active Directory (AD) is the default security management system for Windows
domain networks. We study a Stackelberg game model between one attacker and one
defender on an AD attack graph. The attacker initially has access to a set of
entry nodes. The attacker can expand this set by strategically exploring edges.
Every edge has a detection rate and a failure rate. The attacker aims to
maximize their chance of successfully reaching the destination before getting
detected. The defender's task is to block a constant number of edges to
decrease the attacker's chance of success. We show that the problem is #P-hard
and, therefore, intractable to solve exactly. We convert the attacker's problem
to an exponential sized Dynamic Program that is approximated by a Neural
Network (NN). Once trained, the NN provides an efficient fitness function for
the defender's Evolutionary Diversity Optimisation (EDO). The diversity
emphasis on the defender's solution provides a diverse set of training samples,
which improves the training accuracy of our NN for modelling the attacker. We
go back and forth between NN training and EDO. Experimental results show that
for R500 graph, our proposed EDO based defense is less than 1% away from the
optimal defense.
","[{'version': 'v1', 'created': 'Thu, 7 Apr 2022 12:36:11 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Apr 2022 06:29:48 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Jan 2023 12:39:30 GMT'}]",2023-01-05,"[['Goel', 'Diksha', ''], ['Ward', 'Max', ''], ['Neumann', 'Aneta', ''], ['Neumann', 'Frank', ''], ['Nguyen', 'Hung', ''], ['Guo', 'Mingyu', '']]","['Attack graph', 'evolutionary diversity optimisation', 'neural networks']"
9995,1710.08247,Tilman Wekel,"Amir R. Zamir, Tilman Wekel, Pulkit Argrawal, Colin Weil, Jitendra
  Malik, Silvio Savarese",Generic 3D Representation via Pose Estimation and Matching,"Published in ECCV16. See the project website
  http://3drepresentation.stanford.edu/ and dataset website
  https://github.com/amir32002/3D_Street_View",ECCV 2016 535-553,10.1007/978-3-319-46487-9_33,,cs.CV cs.LG cs.NE cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Though a large body of computer vision research has investigated developing
generic semantic representations, efforts towards developing a similar
representation for 3D has been limited. In this paper, we learn a generic 3D
representation through solving a set of foundational proxy 3D tasks:
object-centric camera pose estimation and wide baseline feature matching. Our
method is based upon the premise that by providing supervision over a set of
carefully selected foundational tasks, generalization to novel tasks and
abstraction capabilities can be achieved. We empirically show that the internal
representation of a multi-task ConvNet trained to solve the above core problems
generalizes to novel 3D tasks (e.g., scene layout estimation, object pose
estimation, surface normal estimation) without the need for fine-tuning and
shows traits of abstraction abilities (e.g., cross-modality pose estimation).
In the context of the core supervised tasks, we demonstrate our representation
achieves state-of-the-art wide baseline feature matching results without
requiring apriori rectification (unlike SIFT and the majority of learned
features). We also show 6DOF camera pose estimation given a pair local image
patches. The accuracy of both supervised tasks come comparable to humans.
Finally, we contribute a large-scale dataset composed of object-centric street
view scenes along with point correspondences and camera pose information, and
conclude with a discussion on the learned representation and open research
questions.
","[{'version': 'v1', 'created': 'Mon, 23 Oct 2017 13:01:05 GMT'}]",2017-10-24,"[['Zamir', 'Amir R.', ''], ['Wekel', 'Tilman', ''], ['Argrawal', 'Pulkit', ''], ['Weil', 'Colin', ''], ['Malik', 'Jitendra', ''], ['Savarese', 'Silvio', '']]","['Generic Vision', 'Representation', 'Descriptor Learning', 'PoseEstimation', 'Wide-Baseline Matching', 'Street View']"
9996,2205.02510,Bihui Zou,"Bihui Zou, Chao Song, Zipeng He, Jaehyung Ju","Encoding of direct 4D printing of isotropic single-material system for
  double-curvature and multimodal morphing",,Extreme Mech. Lett. 54 (2022) 101779,10.1016/j.eml.2022.101779,,cs.GR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The ability to morph flat sheets into complex 3D shapes is extremely useful
for fast manufacturing and saving materials while also allowing volumetrically
efficient storage and shipment and a functional use. Direct 4D printing is a
compelling method to morph complex 3D shapes out of as-printed 2D plates.
However, most direct 4D printing methods require multi-material systems
involving costly machines. Moreover, most works have used an open-cell design
for shape shifting by encoding a collection of 1D rib deformations, which
cannot remain structurally stable. Here, we demonstrate the direct 4D printing
of an isotropic single-material system to morph 2D continuous bilayer plates
into doubly curved and multimodal 3D complex shapes whose geometry can also be
locked after deployment. We develop an inverse-design algorithm that integrates
extrusion-based 3D printing of a single-material system to directly morph a raw
printed sheet into complex 3D geometries such as a doubly curved surface with
shape locking. Furthermore, our inverse-design tool encodes the localized
shape-memory anisotropy during the process, providing the processing conditions
for a target 3D morphed geometry. Our approach could be used for conventional
extrusion-based 3D printing for various applications including biomedical
devices, deployable structures, smart textiles, and pop-up Kirigami structures.
","[{'version': 'v1', 'created': 'Thu, 5 May 2022 08:38:47 GMT'}]",2022-06-13,"[['Zou', 'Bihui', ''], ['Song', 'Chao', ''], ['He', 'Zipeng', ''], ['Ju', 'Jaehyung', '']]","['direct 4D printing', 'doubly curved surfaces', 'self-actuation', 'inverse design']"
9997,2010.02575,Wojciech Kozlowski,"Wojciech Kozlowski, Axel Dahlberg, Stephanie Wehner",Designing a Quantum Network Protocol,,"In Proceedings of the 16th International Conference on emerging
  Networking EXperiments and Technologies (CoNEXT '20). Association for
  Computing Machinery, New York, NY, USA, 1-16. (2020)",10.1145/3386367.3431293,,cs.NI quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The second quantum revolution brings with it the promise of a quantum
internet. As the first quantum network hardware prototypes near completion new
challenges emerge. A functional network is more than just the physical
hardware, yet work on scalable quantum network systems is in its infancy. In
this paper we present a quantum network protocol designed to enable end-to-end
quantum communication in the face of the new fundamental and technical
challenges brought by quantum mechanics. We develop a quantum data plane
protocol that enables end-to-end quantum communication and can serve as a
building block for more complex services. One of the key challenges in
near-term quantum technology is decoherence -- the gradual decay of quantum
information -- which imposes extremely stringent limits on storage times. Our
protocol is designed to be efficient in the face of short quantum memory
lifetimes. We demonstrate this using a simulator for quantum networks and show
that the protocol is able to deliver its service even in the face of
significant losses due to decoherence. Finally, we conclude by showing that the
protocol remains functional on the extremely resource limited hardware that is
being developed today underlining the timeliness of this work.
","[{'version': 'v1', 'created': 'Tue, 6 Oct 2020 09:41:14 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Dec 2020 13:13:12 GMT'}]",2020-12-02,"[['Kozlowski', 'Wojciech', ''], ['Dahlberg', 'Axel', ''], ['Wehner', 'Stephanie', '']]","['quantum internet', 'quantum networks', 'quantum communication']"
9998,1710.05199,Mohammad Mehdi Keikha,"Mohammad Mehdi Keikha, Maseud Rahgozar, Masoud Asadpour",Community Aware Random Walk for Network Embedding,"17 pages, 3 figures, 4 Tables","Knowledge-Based Systems Volume 148, 15 May 2018, Pages 47-54",10.1016/j.knosys.2018.02.028,,cs.SI cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social network analysis provides meaningful information about behavior of
network members that can be used for diverse applications such as
classification, link prediction. However, network analysis is computationally
expensive because of feature learning for different applications. In recent
years, many researches have focused on feature learning methods in social
networks. Network embedding represents the network in a lower dimensional
representation space with the same properties which presents a compressed
representation of the network. In this paper, we introduce a novel algorithm
named ""CARE"" for network embedding that can be used for different types of
networks including weighted, directed and complex. Current methods try to
preserve local neighborhood information of nodes, whereas the proposed method
utilizes local neighborhood and community information of network nodes to cover
both local and global structure of social networks. CARE builds customized
paths, which are consisted of local and global structure of network nodes, as a
basis for network embedding and uses the Skip-gram model to learn
representation vector of nodes. Subsequently, stochastic gradient descent is
applied to optimize our objective function and learn the final representation
of nodes. Our method can be scalable when new nodes are appended to network
without information loss. Parallelize generation of customized random walks is
also used for speeding up CARE. We evaluate the performance of CARE on multi
label classification and link prediction tasks. Experimental results on various
networks indicate that the proposed method outperforms others in both Micro and
Macro-f1 measures for different size of training data.
","[{'version': 'v1', 'created': 'Sat, 14 Oct 2017 15:37:07 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Feb 2018 15:57:36 GMT'}]",2018-07-30,"[['Keikha', 'Mohammad Mehdi', ''], ['Rahgozar', 'Maseud', ''], ['Asadpour', 'Masoud', '']]","['Representation learning', 'Network embedding', 'Community detection', 'Skip-gram model', 'Link prediction']"
9999,2007.02081,Amirhossein Sayyadabdi,Amirhossein Sayyadabdi and Mohsen Sharifi,Avoiding Register Overflow in the Bakery Algorithm,"To be presented at the international workshop on Scheduling and
  Resource Management for Parallel and Distributed Systems (SRMPDS '20)",,10.1145/3409390.3409411,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer systems are designed to make resources available to users and users
may be interested in some resources more than others, therefore, a coordination
scheme is required to satisfy the users' requirements. This scheme may
implement certain policies such as ""never allocate more than X units of
resource Z"". One policy that is of particular interest is the inability of
users to access a single resource at the same time, which is called the problem
of mutual exclusion. Resource management concerns the coordination and
collaboration of users, and it is usually based on making a decision. In the
case of mutual exclusion, that decision is about granting access to a resource.
Therefore, mutual exclusion is useful for supporting resource access
management. The first true solution to the mutual exclusion problem is known as
the Bakery algorithm that does not rely on any lower-lever mutual exclusion. We
examine the problem of register overflow in real-world implementations of the
Bakery algorithm and present a variant algorithm named Bakery++ that prevents
overflows from ever happening. Bakery++ avoids overflows without allowing a
process to write into other processes' memory and without using additional
memory or complex arithmetic or redefining the operations and functions used in
Bakery. Bakery++ is almost as simple as Bakery and it is straightforward to
implement in real systems. With Bakery++, there is no reason to keep
implementing Bakery in real computers because Bakery++ eliminates the
probability of overflows and hence it is more practical than Bakery. Previous
approaches to circumvent the problem of register overflow included introducing
new variables or redefining the operations or functions used in the original
Bakery algorithm, while Bakery++ avoids overflows by using simple conditional
statements. (the abstract does not end here.)
","[{'version': 'v1', 'created': 'Sat, 4 Jul 2020 12:19:58 GMT'}]",2020-07-07,"[['Sayyadabdi', 'Amirhossein', ''], ['Sharifi', 'Mohsen', '']]","['Mutual exclusion', 'Bakery algorithm', 'Overflow']"
10000,2201.10154,Jiang Zhang,Jiang Zhang and Kaiwei Liu,Neural Information Squeezer for Causal Emergence,"33 pages, 9 figures",,10.3390/e25010026,,cs.LG physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  The classic studies of causal emergence have revealed that in some Markovian
dynamical systems, far stronger causal connections can be found on the
higher-level descriptions than the lower-level of the same systems if we
coarse-grain the system states in an appropriate way. However, identifying this
emergent causality from the data is still a hard problem that has not been
solved because the correct coarse-graining strategy can not be found easily.
This paper proposes a general machine learning framework called Neural
Information Squeezer to automatically extract the effective coarse-graining
strategy and the macro-state dynamics, as well as identify causal emergence
directly from the time series data. By decomposing a coarse-graining operation
into two processes: information conversion and information dropping out, we can
not only exactly control the width of the information channel, but also can
derive some important properties analytically including the exact expression of
the effective information of a macro-dynamics. We also show how our framework
can extract the dynamics on different levels and identify causal emergence from
the data on several exampled systems.
","[{'version': 'v1', 'created': 'Tue, 25 Jan 2022 07:55:06 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Oct 2022 13:25:30 GMT'}]",2023-01-11,"[['Zhang', 'Jiang', ''], ['Liu', 'Kaiwei', '']]","['Causal Emergence', 'Coarse-graining', 'Invertible Neural Network']"
10001,1602.06979,Ethan Fast,"Ethan Fast, Binbin Chen, Michael Bernstein",Empath: Understanding Topic Signals in Large-Scale Text,CHI: ACM Conference on Human Factors in Computing Systems 2016,,10.1145/2858036.2858535,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human language is colored by a broad range of topics, but existing text
analysis tools only focus on a small number of them. We present Empath, a tool
that can generate and validate new lexical categories on demand from a small
set of seed terms (like ""bleed"" and ""punch"" to generate the category violence).
Empath draws connotations between words and phrases by deep learning a neural
embedding across more than 1.8 billion words of modern fiction. Given a small
set of seed words that characterize a category, Empath uses its neural
embedding to discover new related terms, then validates the category with a
crowd-powered filter. Empath also analyzes text across 200 built-in,
pre-validated categories we have generated from common topics in our web
dataset, like neglect, government, and social media. We show that Empath's
data-driven, human validated categories are highly correlated (r=0.906) with
similar categories in LIWC.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2016 21:47:43 GMT'}]",2016-02-24,"[['Fast', 'Ethan', ''], ['Chen', 'Binbin', ''], ['Bernstein', 'Michael', '']]","['social computing', 'computational social science', 'fiction']"
10002,2004.09210,Yuqing Wang,"Yuqing Wang and Mika V. M\""antyl\""a and Serge Demeyer and Kristian
  Wiklund and Sigrid Eldh and Tatu Kairi","Software Test Automation Maturity -- A Survey of the State of the
  Practice",,,10.5220/0009766800270038,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The software industry has seen an increasing interest in test automation. In
this paper, we present a test automation maturity survey serving as a
self-assessment for practitioners. Based on responses of 151 practitioners
coming from above 101 organizations in 25 countries, we make observations
regarding the state of the practice of test automation maturity: a) The level
of test automation maturity in different organizations is differentiated by the
practices they adopt; b) Practitioner reported the quite diverse situation with
respect to different practices, e.g., 85\% practitioners agreed that their test
teams have enough test automation expertise and skills, while 47\% of
practitioners admitted that there is lack of guidelines on designing and
executing automated tests; c) Some practices are strongly correlated and/or
closely clustered; d) The percentage of automated test cases and the use of
Agile and/or DevOps development models are good indicators for a higher test
automation maturity level; (e) The roles of practitioners may affect response
variation, e.g., QA engineers give the most optimistic answers, consultants
give the most pessimistic answers. Our results give an insight into present
test automation processes and practices and indicate chances for further
improvement in the present industry.
","[{'version': 'v1', 'created': 'Mon, 20 Apr 2020 11:24:18 GMT'}]",2020-09-18,"[['Wang', 'Yuqing', ''], ['Mäntylä', 'Mika V.', ''], ['Demeyer', 'Serge', ''], ['Wiklund', 'Kristian', ''], ['Eldh', 'Sigrid', ''], ['Kairi', 'Tatu', '']]","['Software', 'Test automation', 'Maturity', 'Improvement', 'Assessment', 'Best practice']"
10003,2201.05829,Jian-Wei Liu,"Run-kun Lu, Jian-wei Liu, Si-ming Lian, Xin Zuo",Multi-View representation learning in Multi-Task Scene,32 pages,Neural Computing and Applications(2020),10.1007/s00521-019-04577-z,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Over recent decades have witnessed considerable progress in whether
multi-task learning or multi-view learning, but the situation that consider
both learning scenes simultaneously has received not too much attention. How to
utilize multiple views latent representation of each single task to improve
each learning task performance is a challenge problem. Based on this, we
proposed a novel semi-supervised algorithm, termed as Multi-Task Multi-View
learning based on Common and Special Features (MTMVCSF). In general,
multi-views are the different aspects of an object and every view includes the
underlying common or special information of this object. As a consequence, we
will mine multiple views jointly latent factor of each learning task which
consists of each view special feature and the common feature of all views. By
this way, the original multi-task multi-view data has degenerated into
multi-task data, and exploring the correlations among multiple tasks enables to
make an improvement on the performance of learning algorithm. Another obvious
advantage of this approach is that we get latent representation of the set of
unlabeled instances by the constraint of regression task with labeled
instances. The performance of classification and semi-supervised clustering
task in these latent representations perform obviously better than it in raw
data. Furthermore, an anti-noise multi-task multi-view algorithm called
AN-MTMVCSF is proposed, which has a strong adaptability to noise labels. The
effectiveness of these algorithms is proved by a series of well-designed
experiments on both real world and synthetic data.
","[{'version': 'v1', 'created': 'Sat, 15 Jan 2022 11:26:28 GMT'}]",2022-01-19,"[['Lu', 'Run-kun', ''], ['Liu', 'Jian-wei', ''], ['Lian', 'Si-ming', ''], ['Zuo', 'Xin', '']]","['multi-view', 'multi-task', 'latent representation', 'special feature', 'common feature']"
10004,2106.09967,Benjamin Smith,"Jes\'us-Javier Chi-Dom\'inguez (CINVESTAV-IPN), Francisco
  Rodr\'iguez-Henr\'iquez (CINVESTAV-IPN), Benjamin Smith (GRACE, LIX)",Extending the GLS endomorphism to speed up GHS Weil descent using Magma,"Finite Fields and Their Applications, Elsevier, In press, 75",,10.1016/j.ffa.2021.101891,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $q = 2^n$, and let $E / \mathbb{F}_{q^{\ell}}$ be a generalized
Galbraith--Lin--Scott (GLS) binary curve, with $\ell \ge 2$ and $(\ell, n) =
1$.We show that the GLS endomorphism on $E / \mathbb{F}_{q^{\ell}}$ induces an
efficient endomorphism on the Jacobian $J_H(\mathbb{F}_q)$ of the genus-$g$
hyperelliptic curve $H$ corresponding to the image of the GHS Weil-descent
attack applied to $E/\mathbb{F}_{q^\ell}$, and that this endomorphism yields a
factor-$n$ speedup when using standard index-calculus procedures for solving
the Discrete Logarithm Problem (DLP) on $J_H(\mathbb{F}_q)$. Our analysis is
backed up by the explicit computation of a discrete logarithm defined on a
prime-order subgroup of a GLS elliptic curve over the field
$\mathbb{F}_{2^{5\cdot 31}}$. A Magma implementation of our algorithm finds the
aforementioned discrete logarithm in about $1,035$ CPU-days.
","[{'version': 'v1', 'created': 'Fri, 18 Jun 2021 07:44:26 GMT'}]",2021-06-21,"[['Chi-Domínguez', 'Jesús-Javier', '', 'CINVESTAV-IPN'], ['Rodríguez-Henríquez', 'Francisco', '', 'CINVESTAV-IPN'], ['Smith', 'Benjamin', '', 'GRACE, LIX']]","['GHS Weil descent', 'extended GLS endomorphism', 'index-calculusalgorithm']"
10005,1506.09032,Hosny Abbas,"Hosny Ahmed Abbas, Samir Ibrahim Shaheen, Mohammed Hussein Amin",Organization of Multi-Agent Systems: An Overview,12 pages,"Journal of Intelligent Information Systems. Vol. 4, No. 3, 2015,
  pp. 46-57",10.11648/j.ijiis.20150403.11,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In complex, open, and heterogeneous environments, agents must be able to
reorganize towards the most appropriate organizations to adapt unpredictable
environment changes within Multi-Agent Systems (MAS). Types of reorganization
can be seen from two different levels. The individual agents level
(micro-level) in which an agent changes its behaviors and interactions with
other agents to adapt its local environment. And the organizational level
(macro-level) in which the whole system changes it structure by adding or
removing agents. This chapter is dedicated to overview different aspects of
what is called MAS Organization including its motivations, paradigms, models,
and techniques adopted for statically or dynamically organizing agents in MAS.
","[{'version': 'v1', 'created': 'Tue, 30 Jun 2015 11:11:58 GMT'}]",2015-08-19,"[['Abbas', 'Hosny Ahmed', ''], ['Shaheen', 'Samir Ibrahim', ''], ['Amin', 'Mohammed Hussein', '']]","['Multi-Agent Systems', 'Organization', 'Organizational Models', 'Dynamic Reorganization', 'Self-Organization']"
10006,2204.12670,Simone Venturi,Simone Venturi and Tiernan Casey,"SVD Perspectives for Augmenting DeepONet Flexibility and
  Interpretability",,Comput. Methods Appl. Mech. Engrg. 403 (2023) 115718,10.1016/j.cma.2022.115718,SAND2022-5433 O,cs.LG math.AP physics.comp-ph physics.data-an,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Deep operator networks (DeepONets) are powerful architectures for fast and
accurate emulation of complex dynamics. As their remarkable generalization
capabilities are primarily enabled by their projection-based attribute, we
investigate connections with low-rank techniques derived from the singular
value decomposition (SVD). We demonstrate that some of the concepts behind
proper orthogonal decomposition (POD)-neural networks can improve DeepONet's
design and training phases. These ideas lead us to a methodology extension that
we name SVD-DeepONet. Moreover, through multiple SVD analyses, we find that
DeepONet inherits from its projection-based attribute strong inefficiencies in
representing dynamics characterized by symmetries. Inspired by the work on
shifted-POD, we develop flexDeepONet, an architecture enhancement that relies
on a pre-transformation network for generating a moving reference frame and
isolating the rigid components of the dynamics. In this way, the physics can be
represented on a latent space free from rotations, translations, and stretches,
and an accurate projection can be performed to a low-dimensional basis. In
addition to flexibility and interpretability, the proposed perspectives
increase DeepONet's generalization capabilities and computational efficiencies.
For instance, we show flexDeepONet can accurately surrogate the dynamics of 19
variables in a combustion chemistry application by relying on 95% less
trainable parameters than the ones of the vanilla architecture. We argue that
DeepONet and SVD-based methods can reciprocally benefit from each other. In
particular, the flexibility of the former in leveraging multiple data sources
and multifidelity knowledge in the form of both unstructured data and
physics-informed constraints has the potential to greatly extend the
applicability of methodologies such as POD and PCA.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2022 02:31:33 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Oct 2022 02:54:12 GMT'}, {'version': 'v3', 'created': 'Sun, 6 Nov 2022 02:32:41 GMT'}]",2022-11-15,"[['Venturi', 'Simone', ''], ['Casey', 'Tiernan', '']]","['Scientific machine learning', 'Neural operators', 'DeepONet', 'SVD', 'POD with symmetries', 'Combustion']"
10007,2112.02875,Ike Kunze,"Ike Kunze and Constantin Sander and Klaus Wehrle and Jan R\""uth",Tracking the QUIC Spin Bit on Tofino,,,10.1145/3488660.3493804,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  QUIC offers security and privacy for modern web traffic by closely
integrating encryption into its transport functionality. In this process, it
hides transport layer information often used for network monitoring, thus
obsoleting traditional measurement concepts. To still enable passive RTT
estimations, QUIC introduces a dedicated measurement bit - the spin bit. While
simple in its design, tracking the spin bit at line-rate can become challenging
for software-based solutions. Dedicated hardware trackers are also unsuitable
as the spin bit is not invariant and can change in the future. Thus, this paper
investigates whether P4-programmable hardware, such as the Intel Tofino, can
effectively track the spin bit at line-rate. We find that the core
functionality of the spin bit can be realized easily, and our prototype has an
accuracy close to software-based trackers. Our prototype further protects
against faulty measurements caused by reordering and prepares the data
according to the needs of network operators, e.g., by classifying samples into
pre-defined RTT classes. Still, distinct concepts in QUIC, such as its
connection ID, are challenging with current hardware capabilities.
","[{'version': 'v1', 'created': 'Mon, 6 Dec 2021 09:04:47 GMT'}]",2021-12-07,"[['Kunze', 'Ike', ''], ['Sander', 'Constantin', ''], ['Wehrle', 'Klaus', ''], ['Rüth', 'Jan', '']]","['In-Network Telemetry', 'RTT measurements', 'QUIC Spin Bit', 'P4']"
10008,2204.10413,Juan M. Bello-Rivas,"Juan M. Bello-Rivas, Anastasia Georgiou, John Guckenheimer, Ioannis G.
  Kevrekidis","Staying the course: Locating equilibria of dynamical systems on
  Riemannian manifolds defined by point-clouds",,,10.1007/s10910-022-01425-9,,cs.LG cs.NA math.DG math.DS math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a method to successively locate equilibria (steady states) of
dynamical systems on Riemannian manifolds. The manifolds need not be
characterized by an a priori known atlas or by the zeros of a smooth map.
Instead, they can be defined by point-clouds and sampled as needed through an
iterative process. If the manifold is an Euclidean space, our method follows
isoclines, curves along which the direction of the vector field $X$ is
constant. For a generic vector field $X$, isoclines are smooth curves and every
equilibrium lies on isoclines. We generalize the definition of isoclines to
Riemannian manifolds through the use of parallel transport: generalized
isoclines are curves along which the directions of $X$ are parallel transports
of each other. As in the Euclidean case, generalized isoclines of generic
vector fields $X$ are smooth curves that connect equilibria of $X$. Our
algorithm can be regarded as an extension of the method of Newton trajectories
to the manifold setting when the manifold is unknown.
  This work is motivated by computational statistical mechanics, specifically
high dimensional (stochastic) differential equations that model the dynamics of
molecular systems. Often, these dynamics concentrate near low-dimensional
manifolds and have transitions (saddle points with a single unstable direction)
between metastable equilibria. We employ iteratively sampled data and isoclines
to locate these saddle points. Coupling a black-box sampling scheme (e.g.,
Markov chain Monte Carlo) with manifold learning techniques (diffusion maps in
the case presented here), we show that our method reliably locates equilibria
of $X$.
","[{'version': 'v1', 'created': 'Thu, 21 Apr 2022 21:26:11 GMT'}, {'version': 'v2', 'created': 'Sat, 12 Nov 2022 19:29:38 GMT'}]",2022-12-15,"[['Bello-Rivas', 'Juan M.', ''], ['Georgiou', 'Anastasia', ''], ['Guckenheimer', 'John', ''], ['Kevrekidis', 'Ioannis G.', '']]","['dynamical systems', 'Riemannian geometry', 'manifold learning', 'statistical mechanics', 'transition states']"
10009,1606.03191,Ai Munandar Tb,"Tb. Ai Munandar, Retantyo Wardoyo","Fuzzy-Klassen Model for Development Disparities Analysis based on Gross
  Regional Domestic Product Sector of a Region","6 Pages, 1 Figures, 5 Tables",,10.5120/ijca2015905389,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Analysis of regional development imbalances quadrant has a very important
meaning in order to see the extent of achievement of the development of certain
areas as well as the difference. Factors that could be used as a tool to
measure the inequality of development is to look at the average growth and
development contribution of each sector of Gross Regional Domestic Product
(GRDP) based on the analyzed region and the reference region. This study
discusses the development of a model to determine the regional development
imbalances using fuzzy approach system, and the rules of typology Klassen. The
model is then called fuzzy-Klassen. Implications Product Mamdani fuzzy system
is used in the model as an inference engine to generate output after
defuzzyfication process. Application of MATLAB is used as a tool of analysis in
this study. The test a result of Kota Cilegon is shows that there are
significant differences between traditional Klassen typology analyses with the
results of the model developed. Fuzzy model-Klassen shows GRDP sector
inequality Cilegon City is dominated by Quadrant I (K4), where status is the
sector forward and grows exponentially. While the traditional Klassen typology,
half of GRDP sector is dominated by Quadrant IV (K4) with a sector that is
lagging relative status.
","[{'version': 'v1', 'created': 'Fri, 10 Jun 2016 05:55:56 GMT'}]",2016-06-13,"[['Munandar', 'Tb. Ai', ''], ['Wardoyo', 'Retantyo', '']]","['Inequality of regional development', 'GDP', 'Klassen typology', 'fuzzy systems', 'Mamdani product']"
10010,2110.03442,Anthony Gruber,"Anthony Gruber, Max Gunzburger, Lili Ju, Zhu Wang","A Comparison of Neural Network Architectures for Data-Driven
  Reduced-Order Modeling",,,10.1016/j.cma.2022.114764,,cs.LG cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The popularity of deep convolutional autoencoders (CAEs) has engendered new
and effective reduced-order models (ROMs) for the simulation of large-scale
dynamical systems. Despite this, it is still unknown whether deep CAEs provide
superior performance over established linear techniques or other network-based
methods in all modeling scenarios. To elucidate this, the effect of autoencoder
architecture on its associated ROM is studied through the comparison of deep
CAEs against two alternatives: a simple fully connected autoencoder, and a
novel graph convolutional autoencoder. Through benchmark experiments, it is
shown that the superior autoencoder architecture for a given ROM application is
highly dependent on the size of the latent space and the structure of the
snapshot data, with the proposed architecture demonstrating benefits on data
with irregular connectivity when the latent space is sufficiently large.
","[{'version': 'v1', 'created': 'Tue, 5 Oct 2021 23:42:09 GMT'}, {'version': 'v2', 'created': 'Sun, 6 Feb 2022 22:00:19 GMT'}, {'version': 'v3', 'created': 'Tue, 8 Feb 2022 22:31:36 GMT'}]",2022-03-14,"[['Gruber', 'Anthony', ''], ['Gunzburger', 'Max', ''], ['Ju', 'Lili', ''], ['Wang', 'Zhu', '']]","['Reduced-order modeling', 'parametric PDEs', 'graph convolution', 'convolutional autoencoder', 'nonlinear dimensionality reduction']"
10011,2211.12893,Ningning Li,"Ningning Li, Qunwei Li, Xichen Ding, Shaohu Chen, Wenliang Zhong","Prototypical Contrastive Learning and Adaptive Interest Selection for
  Candidate Generation in Recommendations",,,10.1145/3511808.3557674,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep Candidate Generation plays an important role in large-scale recommender
systems. It takes user history behaviors as inputs and learns user and item
latent embeddings for candidate generation. In the literature, conventional
methods suffer from two problems. First, a user has multiple embeddings to
reflect various interests, and such number is fixed. However, taking into
account different levels of user activeness, a fixed number of interest
embeddings is sub-optimal. For example, for less active users, they may need
fewer embeddings to represent their interests compared to active users. Second,
the negative samples are often generated by strategies with unobserved
supervision, and similar items could have different labels. Such a problem is
termed as class collision. In this paper, we aim to advance the typical
two-tower DNN candidate generation model. Specifically, an Adaptive Interest
Selection Layer is designed to learn the number of user embeddings adaptively
in an end-to-end way, according to the level of their activeness. Furthermore,
we propose a Prototypical Contrastive Learning Module to tackle the class
collision problem introduced by negative sampling. Extensive experimental
evaluations show that the proposed scheme remarkably outperforms competitive
baselines on multiple benchmarks.
","[{'version': 'v1', 'created': 'Wed, 23 Nov 2022 11:53:20 GMT'}]",2022-11-24,"[['Li', 'Ningning', ''], ['Li', 'Qunwei', ''], ['Ding', 'Xichen', ''], ['Chen', 'Shaohu', ''], ['Zhong', 'Wenliang', '']]","['Candidate Generation', 'Contrastive Learning', 'Interest Selection']"
10012,2006.09293,Reza Fotohi,"Reza Fotohi, Eslam Nazemi, Fereidoon Shams Aliee","An agent-based self-protective method to secure communication between
  UAVs in unmanned aerial vehicle networks","35 pages, 12 figures, 14 tables, Journal",Vehicular Communications. 2020 May 28:100267,10.1016/j.vehcom.2020.100267,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  UAVNs (unmanned aerial vehicle networks) may become vulnerable to threats and
attacks due to their characteristic features such as highly dynamic network
topology, open-air wireless environments, and high mobility. Since previous
work has focused on classical and metaheuristic-based approaches, none of these
approaches have a self-adaptive approach. In this paper, the challenges and
weaknesses of previous methods are examined in the form of a table.
Furthermore, we propose an agent-based self-protective method (ASP-UAVN) for
UAVNs that is based on the Human Immune System (HIS). In ASP-UAS, the safest
route from the source UAV to the destination UAV is chosen according to a
self-protective system. In this method, a multi-agent system using an
Artificial Immune System (AIS) is employed to detect the attacking UAV and
choose the safest route. In the proposed ASP-UAVN, the route request packet
(RREQ) is initially transmitted from the source UAV to the destination UAV to
detect the existing routes. Then, once the route reply packet (RREP) is
received, a self-protective method using agents and the knowledge base is
employed to choose the safest route and detect the attacking UAVs. The proposed
ASP-UAVN has been validated and evaluated in two ways: simulation and
theoretical analysis. The results of simulation evaluation and theory analysis
showed that the ASP-UAS increases the Packet Delivery Rate (PDR) by more than
17.4, 20.8, and 25.91%, and detection rate by more than 17.2, 23.1, and 29.3%,
and decreases the Packet Loss Rate (PLR) by more than 14.4, 16.8, and 20.21%,
the false-positive and false-negative rate by more than 16.5, 25.3, and 31.21%
those of SUAS-HIS, SFA and BRUIDS methods, respectively.
","[{'version': 'v1', 'created': 'Wed, 3 Jun 2020 10:12:37 GMT'}]",2020-06-17,"[['Fotohi', 'Reza', ''], ['Nazemi', 'Eslam', ''], ['Aliee', 'Fereidoon Shams', '']]","['Unmanned aerial vehicle networks (UAVNs)', 'Secure communication', 'Agent-based selfprotective', 'Self-adaptive', 'UAV']"
10013,2203.00746,Jiaxin Cao,"Jiaxin Cao, Bo Yang, Shanying Zhu, Chi Yung Chung, Xinping Guan","Multi-level Coordinated Energy Management for Energy Hub in Hybrid
  Markets with Distributionally Robust Scheduling",,Applied Energy 311 (2022): 118639,10.1016/j.apenergy.2022.118639,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Maintaining energy balance and economical operation is significant for
multi-energy systems such as the energy hub. However, it is usually challenged
by the frequently changing and unpredictable uncertainties at different
timescales. Under this scope, this paper investigates the coordinated energy
management problem for day-ahead and intra-day conditions considering
uncertainties of source-load and market prices concurrently. Note that the
precise knowledge of distributions about uncertainties may be unaccessible
before the decision-making in day-ahead phase. A two-stage chance-constrained
model based on distributionally robust approach with ambiguous moment
information is proposed to immunize scheduling strategies against the
worst-case probability distributions. The first stage is dedicated to obtaining
more energy arbitrage and operation flexibility by optimizing bidding
strategies in day-ahead power, natural gas and carbon markets. The second stage
focuses on the optimization of worst-case expected operation cost. It provides
a robust energy equipment and load scheduling strategy for the reference of
subsequent intra-day arrangements. With respect to different variations of
electrical and thermal components, an intra-day two-timescale coordination is
implemented step by step. The energy scheduling is re-dispatched circularly to
minimize the operation and penalty costs. The possible energy imbalance is also
compensated by this way. As the energy management program is nonlinear,
chance-constrained and multi-stage, linearization and dual transformation
techniques are designed to enhance tractability of programs. Experimental
results show that the developed multi-level framework results in a carbon
emission decrease of 37%, and reduces energy cost averagely 3% compared with
corresponding contrasting cases. The obtained strategy validates a good
tradeoff between robustness and optimality.
","[{'version': 'v1', 'created': 'Tue, 1 Mar 2022 21:09:20 GMT'}]",2022-03-03,"[['Cao', 'Jiaxin', ''], ['Yang', 'Bo', ''], ['Zhu', 'Shanying', ''], ['Chung', 'Chi Yung', ''], ['Guan', 'Xinping', '']]","['Energy hub', 'chance-constrained energy management', 'multi-timescale', 'hybrid energy']"
10014,2103.14060,Nathan P. Lawrence,"Daniel G. McClement, Nathan P. Lawrence, Philip D. Loewen, Michael G.
  Forbes, Johan U. Backstr\""om, R. Bhushan Gopaluni",A Meta-Reinforcement Learning Approach to Process Control,ADCHEM 2021; Keynote Paper,,10.1016/j.ifacol.2021.08.321,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Meta-learning is a branch of machine learning which aims to quickly adapt
models, such as neural networks, to perform new tasks by learning an underlying
structure across related tasks. In essence, models are being trained to learn
new tasks effectively rather than master a single task. Meta-learning is
appealing for process control applications because the perturbations to a
process required to train an AI controller can be costly and unsafe.
Additionally, the dynamics and control objectives are similar across many
different processes, so it is feasible to create a generalizable controller
through meta-learning capable of quickly adapting to different systems. In this
work, we construct a deep reinforcement learning (DRL) based controller and
meta-train the controller using a latent context variable through a separate
embedding neural network. We test our meta-algorithm on its ability to adapt to
new process dynamics as well as different control objectives on the same
process. In both cases, our meta-learning algorithm adapts very quickly to new
tasks, outperforming a regular DRL controller trained from scratch.
Meta-learning appears to be a promising approach for constructing more
intelligent and sample-efficient controllers.
","[{'version': 'v1', 'created': 'Thu, 25 Mar 2021 18:20:56 GMT'}]",2021-11-16,"[['McClement', 'Daniel G.', ''], ['Lawrence', 'Nathan P.', ''], ['Loewen', 'Philip D.', ''], ['Forbes', 'Michael G.', ''], ['Backström', 'Johan U.', ''], ['Gopaluni', 'R. Bhushan', '']]","['Adaptive control by neural networks', 'reinforcement learning control', 'meta-learning', 'process control']"
10015,2202.04586,Alberto Bacchelli,"Larissa Braz and Christian Aeberhard and G\""ul \c{C}alikli and Alberto
  Bacchelli","Less is More: Supporting Developers in Vulnerability Detection during
  Code Review","This paper has been accepted at ICSE 2022 (44th ACM/IEEE
  International Conference on Software Engineering). This version of the paper
  uses a different title to match the one used for ICSE 2022",,10.1145/3510003.3511560,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Reviewing source code from a security perspective has proven to be a
difficult task. Indeed, previous research has shown that developers often miss
even popular and easy-to-detect vulnerabilities during code review. Initial
evidence suggests that a significant cause may lie in the reviewers' mental
attitude and common practices. In this study, we investigate whether and how
explicitly asking developers to focus on security during a code review affects
the detection of vulnerabilities. Furthermore, we evaluate the effect of
providing a security checklist to guide the security review. To this aim, we
conduct an online experiment with 150 participants, of which 71% report to have
three or more years of professional development experience. Our results show
that simply asking reviewers to focus on security during the code review
increases eight times the probability of vulnerability detection. The presence
of a security checklist does not significantly improve the outcome further,
even when the checklist is tailored to the change under review and the existing
vulnerabilities in the change. These results provide evidence supporting the
mental attitude hypothesis and call for further work on security checklists'
effectiveness and design. Data and materials:
https://doi.org/10.5281/zenodo.6026291
","[{'version': 'v1', 'created': 'Wed, 9 Feb 2022 17:32:12 GMT'}, {'version': 'v2', 'created': 'Sat, 12 Feb 2022 08:46:23 GMT'}]",2022-02-15,"[['Braz', 'Larissa', ''], ['Aeberhard', 'Christian', ''], ['Çalikli', 'Gül', ''], ['Bacchelli', 'Alberto', '']]","['code review', 'security vulnerability', 'checklist', 'mental attitude']"
10016,2210.15837,Rui Fan,"Rui Fan, Erick Delage",Risk-Aware Bid Optimization for Online Display Advertisement,Accepted for CIKM '22,,10.1145/3511808.3557436,,cs.LG cs.GT cs.IR math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This research focuses on the bid optimization problem in the real-time
bidding setting for online display advertisements, where an advertiser, or the
advertiser's agent, has access to the features of the website visitor and the
type of ad slots, to decide the optimal bid prices given a predetermined total
advertisement budget. We propose a risk-aware data-driven bid optimization
model that maximizes the expected profit for the advertiser by exploiting
historical data to design upfront a bidding policy, mapping the type of
advertisement opportunity to a bid price, and accounting for the risk of
violating the budget constraint during a given period of time. After employing
a Lagrangian relaxation, we derive a parametrized closed-form expression for
the optimal bidding strategy. Using a real-world dataset, we demonstrate that
our risk-averse method can effectively control the risk of overspending the
budget while achieving a competitive level of profit compared with the
risk-neutral model and a state-of-the-art data-driven risk-aware bidding
approach.
","[{'version': 'v1', 'created': 'Fri, 28 Oct 2022 02:14:33 GMT'}]",2022-10-31,"[['Fan', 'Rui', ''], ['Delage', 'Erick', '']]","['Risk-aware Bidding policy', 'Risk Aversion', 'Display Advertising', 'Machine Learning', 'Entropic Risk Measure', 'Lagrangian Relaxation', 'Real-Time Bidding']"
10017,2301.05196,Taufik Abrao PhD,"Giovanni Maciel Ferreira Silva, Taufik Abr\~ao","Multi-Power Level $Q$-Learning Algorithm for Random Access in NOMA mMTC
  Systems","13 pages, 9 figures, ETT-Wiley publication","Transactions on Emerging Telecommunications Technologies, v. 33,
  p. e4509, 2022",10.1002/ett.4509,,cs.NI cs.LG cs.SY eess.SP eess.SY,http://creativecommons.org/licenses/by/4.0/,"  The massive machine-type communications (mMTC) service will be part of new
services planned to integrate the fifth generation of wireless communication
(B5G). In mMTC, thousands of devices sporadically access available resource
blocks on the network. In this scenario, the massive random access (RA) problem
arises when two or more devices collide when selecting the same resource block.
There are several techniques to deal with this problem. One of them deploys
$Q$-learning (QL), in which devices store in their $Q$-table the rewards sent
by the central node that indicate the quality of the transmission performed.
The device learns the best resource blocks to select and transmit to avoid
collisions. We propose a multi-power level QL (MPL-QL) algorithm that uses
non-orthogonal multiple access (NOMA) transmit scheme to generate transmission
power diversity and allow {accommodate} more than one device in the same
time-slot as long as the signal-to-interference-plus-noise ratio (SINR) exceeds
a threshold value. The numerical results reveal that the best
performance-complexity trade-off is obtained by using a {higher {number of}
power levels, typically eight levels}. The proposed MPL-QL {can deliver} better
throughput and lower latency compared to other recent QL-based algorithms found
in the literature
","[{'version': 'v1', 'created': 'Thu, 12 Jan 2023 18:31:00 GMT'}]",2023-01-13,"[['Silva', 'Giovanni Maciel Ferreira', ''], ['Abrão', 'Taufik', '']]","['NOMA', 'mMTC', 'Q-Learning; random access; power allocation']"
10018,2210.06160,Yu Wei Tan,"Yu Wei Tan, Nicholas Chua, Clarence Koh and Anand Bhojan","RTSDF: Real-time Signed Distance Fields for Soft Shadow Approximation in
  Games",,,10.5220/0010996200003124,,cs.GR,http://creativecommons.org/licenses/by/4.0/,"  Signed distance fields (SDFs) are a form of surface representation widely
used in computer graphics, having applications in rendering, collision
detection and modelling. In interactive media such as games, high-resolution
SDFs are commonly produced offline and subsequently loaded into the
application, representing rigid meshes only. This work develops a novel
technique that combines jump flooding and ray tracing to generate approximate
SDFs in real-time. Our approach can produce relatively accurate scene
representation for rendering soft shadows while maintaining interactive frame
rates. We extend our previous work with details on the design and
implementation as well as visual quality and performance evaluation of the
technique.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2022 11:47:12 GMT'}]",2022-10-13,"[['Tan', 'Yu Wei', ''], ['Chua', 'Nicholas', ''], ['Koh', 'Clarence', ''], ['Bhojan', 'Anand', '']]","['Real-time', 'Signed Distance Field', 'Jump Flooding', 'Ray Tracing', 'Soft Shadow', 'Rendering', 'Games']"
10019,1905.08773,Issam Damaj,"Marwa Kandil (1), Reem AlBaghdadi (1), Fatemah AlAttar (1), Issam
  Damaj (2) ((1) American University of Kuwait, (2) Rafik Hariri University)",AmIE: An Ambient Intelligent Environment for Assisted Living,"6 pages, 8 figures, 1 table","The 2nd Eng Innovations in Healthcare International Conference,
  IEEE, Dubai, UAE, March 26-27, (2019) 1-6",10.1109/ICASET.2019.8714499,,cs.CY cs.HC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the modern world of technology Internet-of-things (IoT) systems strives to
provide an extensive interconnected and automated solutions for almost every
life aspect. This paper proposes an IoT context-aware system to present an
Ambient Intelligence (AmI) environment; such as an apartment, house, or a
building; to assist blind, visually-impaired, and elderly people. The proposed
system aims at providing an easy-to-utilize voice-controlled system to locate,
navigate and assist users indoors. The main purpose of the system is to provide
indoor positioning, assisted navigation, outside weather information, room
temperature, people availability, phone calls and emergency evacuation when
needed. The system enhances the user's awareness of the surrounding environment
by feeding them with relevant information through a wearable device to assist
them. In addition, the system is voice-controlled in both English and Arabic
languages and the information are displayed as audio messages in both
languages. The system design, implementation, and evaluation consider the
constraints in common types of premises in Kuwait and in challenges, such as
the training needed by the users. This paper presents cost-effective
implementation options by the adoption of a Raspberry Pi microcomputer,
Bluetooth Low Energy devices and an Android smart watch.
","[{'version': 'v1', 'created': 'Sat, 18 May 2019 13:57:31 GMT'}]",2019-05-22,"[['Kandil', 'Marwa', '', 'American University of Kuwait'], ['AlBaghdadi', 'Reem', '', 'American University of Kuwait'], ['AlAttar', 'Fatemah', '', 'American University of Kuwait'], ['Damaj', 'Issam', '', 'Rafik Hariri University']]","['Internet of Things', 'context aware', 'ambient']"
10020,2203.08263,Enzo Rucci,Andr\'es Milla and Enzo Rucci,"Performance Comparison of Python Translators for a Multi-threaded
  CPU-bound Application","In: Pesado, P., Gil, G. (eds). Computer Science - CACIC 2021.
  Springer Communications in Computer and Information Science, vol 1584",,10.1007/978-3-031-05903-2_2,,cs.DC cs.PL,http://creativecommons.org/licenses/by/4.0/,"  Currently, Python is one of the most widely used languages in various
application areas. However, it has limitations when it comes to optimizing and
parallelizing applications due to the nature of its official CPython
interpreter, especially for CPU-bound applications. To solve this problem,
several alternative translators have emerged, each with a different approach
and its own cost-performance ratio. Due to the absence of comparative studies,
we have carried out a performance comparison of these translators using N-Body
as a case study (a well-known problem with high computational demand). The
results obtained show that CPython and PyPy presented poor performance due to
their limitations when it comes to parallelizing algorithms; while Numba and
Cython achieved significantly higher performance, proving to be viable options
to speed up numerical algorithms.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2022 21:29:52 GMT'}, {'version': 'v2', 'created': 'Mon, 23 May 2022 16:02:12 GMT'}]",2022-05-24,"[['Milla', 'Andrés', ''], ['Rucci', 'Enzo', '']]","['Numba', 'Cython', 'N-body', 'CPU-bound', 'Parallel computing']"
10021,2204.05726,Maxime Allard,"Maxime Allard, Sim\'on C. Smith, Konstantinos Chatzilygeroudis,
  Antoine Cully",Hierarchical Quality-Diversity for Online Damage Recovery,Accepted at GECCO 2022,,10.1145/3512290.3528751,,cs.RO cs.AI cs.LG cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Adaptation capabilities, like damage recovery, are crucial for the deployment
of robots in complex environments. Several works have demonstrated that using
repertoires of pre-trained skills can enable robots to adapt to unforeseen
mechanical damages in a few minutes. These adaptation capabilities are directly
linked to the behavioural diversity in the repertoire. The more alternatives
the robot has to execute a skill, the better are the chances that it can adapt
to a new situation. However, solving complex tasks, like maze navigation,
usually requires multiple different skills. Finding a large behavioural
diversity for these multiple skills often leads to an intractable exponential
growth of the number of required solutions. In this paper, we introduce the
Hierarchical Trial and Error algorithm, which uses a hierarchical behavioural
repertoire to learn diverse skills and leverages them to make the robot more
adaptive to different situations. We show that the hierarchical decomposition
of skills enables the robot to learn more complex behaviours while keeping the
learning of the repertoire tractable. The experiments with a hexapod robot show
that our method solves maze navigation tasks with 20% less actions in the most
challenging scenarios than the best baseline while having 57% less complete
failures.
","[{'version': 'v1', 'created': 'Tue, 12 Apr 2022 11:44:01 GMT'}]",2022-04-13,"[['Allard', 'Maxime', ''], ['Smith', 'Simón C.', ''], ['Chatzilygeroudis', 'Konstantinos', ''], ['Cully', 'Antoine', '']]","['Hierarchical Learning', 'Quality-Diversity', 'Robotics']"
10022,2207.13867,Ping Wei,"Ping Wei, Sheng Li, Xinpeng Zhang, Ge Luo, Zhenxing Qian, Qing Zhou",Generative Steganography Network,,,10.1145/3503161.3548217,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Steganography usually modifies cover media to embed secret data. A new
steganographic approach called generative steganography (GS) has emerged
recently, in which stego images (images containing secret data) are generated
from secret data directly without cover media. However, existing GS schemes are
often criticized for their poor performances. In this paper, we propose an
advanced generative steganography network (GSN) that can generate realistic
stego images without using cover images. We firstly introduce the mutual
information mechanism in GS, which helps to achieve high secret extraction
accuracy. Our model contains four sub-networks, i.e., an image generator ($G$),
a discriminator ($D$), a steganalyzer ($S$), and a data extractor ($E$). $D$
and $S$ act as two adversarial discriminators to ensure the visual quality and
security of generated stego images. $E$ is to extract the hidden secret from
generated stego images. The generator $G$ is flexibly constructed to synthesize
either cover or stego images with different inputs. It facilitates covert
communication by concealing the function of generating stego images in a normal
generator. A module named secret block is designed to hide secret data in the
feature maps during image generation, with which high hiding capacity and image
fidelity are achieved. In addition, a novel hierarchical gradient decay (HGD)
skill is developed to resist steganalysis detection. Experiments demonstrate
the superiority of our work over existing methods.
","[{'version': 'v1', 'created': 'Thu, 28 Jul 2022 03:34:37 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Jul 2022 05:09:59 GMT'}, {'version': 'v3', 'created': 'Sun, 14 Aug 2022 11:55:42 GMT'}]",2022-08-16,"[['Wei', 'Ping', ''], ['Li', 'Sheng', ''], ['Zhang', 'Xinpeng', ''], ['Luo', 'Ge', ''], ['Qian', 'Zhenxing', ''], ['Zhou', 'Qing', '']]","['Steganography', 'Generative steganography', 'Data hiding', 'GANs']"
10023,2007.07220,Nicolas A. Barriga,"Gabriel K. Sepulveda, Felipe Besoain, and Nicolas A. Barriga",Exploring Dynamic Difficulty Adjustment in Videogames,,,10.1109/CHILECON47746.2019.8988068,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Videogames are nowadays one of the biggest entertainment industries in the
world. Being part of this industry means competing against lots of other
companies and developers, thus, making fanbases of vital importance. They are a
group of clients that constantly support your company because your video games
are fun. Videogames are most entertaining when the difficulty level is a good
match for the player's skill, increasing the player engagement. However, not
all players are equally proficient, so some kind of difficulty selection is
required. In this paper, we will present Dynamic Difficulty Adjustment (DDA), a
recently arising research topic, which aims to develop an automated difficulty
selection mechanism that keeps the player engaged and properly challenged,
neither bored nor overwhelmed. We will present some recent research addressing
this issue, as well as an overview of how to implement it. Satisfactorily
solving the DDA problem directly affects the player's experience when playing
the game, making it of high interest to any game developer, from independent
ones, to 100 billion dollar businesses, because of the potential impacts in
player retention and monetization.
","[{'version': 'v1', 'created': 'Mon, 6 Jul 2020 15:05:20 GMT'}]",2020-07-15,"[['Sepulveda', 'Gabriel K.', ''], ['Besoain', 'Felipe', ''], ['Barriga', 'Nicolas A.', '']]","['Dynamic Difficulty Adjustment', 'Videogames', 'Artificial Intelligence']"
10024,2202.03384,Jinpeng Wang,"Jinpeng Wang, Bin Chen, Dongliang Liao, Ziyun Zeng, Gongfu Li, Shu-Tao
  Xia, Jin Xu",Hybrid Contrastive Quantization for Efficient Cross-View Video Retrieval,"Accepted to The Web Conference 2022 (WWW'22). 11 pages, 5 tables, 6
  figures",,10.1145/3485447.3512022,,cs.IR cs.CV cs.LG cs.MM cs.SI,http://creativecommons.org/licenses/by/4.0/,"  With the recent boom of video-based social platforms (e.g., YouTube and
TikTok), video retrieval using sentence queries has become an important demand
and attracts increasing research attention. Despite the decent performance,
existing text-video retrieval models in vision and language communities are
impractical for large-scale Web search because they adopt brute-force search
based on high-dimensional embeddings. To improve efficiency, Web search engines
widely apply vector compression libraries (e.g., FAISS) to post-process the
learned embeddings. Unfortunately, separate compression from feature encoding
degrades the robustness of representations and incurs performance decay. To
pursue a better balance between performance and efficiency, we propose the
first quantized representation learning method for cross-view video retrieval,
namely Hybrid Contrastive Quantization (HCQ). Specifically, HCQ learns both
coarse-grained and fine-grained quantizations with transformers, which provide
complementary understandings for texts and videos and preserve comprehensive
semantic information. By performing Asymmetric-Quantized Contrastive Learning
(AQ-CL) across views, HCQ aligns texts and videos at coarse-grained and
multiple fine-grained levels. This hybrid-grained learning strategy serves as
strong supervision on the cross-view video quantization model, where
contrastive learning at different levels can be mutually promoted. Extensive
experiments on three Web video benchmark datasets demonstrate that HCQ achieves
competitive performance with state-of-the-art non-compressed retrieval methods
while showing high efficiency in storage and computation. Code and
configurations are available at https://github.com/gimpong/WWW22-HCQ.
","[{'version': 'v1', 'created': 'Mon, 7 Feb 2022 18:04:10 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Feb 2022 01:30:08 GMT'}]",2022-02-11,"[['Wang', 'Jinpeng', ''], ['Chen', 'Bin', ''], ['Liao', 'Dongliang', ''], ['Zeng', 'Ziyun', ''], ['Li', 'Gongfu', ''], ['Xia', 'Shu-Tao', ''], ['Xu', 'Jin', '']]","['cross-view video retrieval', 'learning to hash', 'deep quantization', 'index compression', 'contrastive learning']"
10025,2202.05317,Xuyang Wu,"Xuyang Wu, Alessandro Magnani, Suthee Chaidaroon, Ajit
  Puthenputhussery, Ciya Liao, Yi Fang",A Multi-task Learning Framework for Product Ranking with BERT,accepted by WWW22,,10.1145/3485447.3511977,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Product ranking is a crucial component for many e-commerce services. One of
the major challenges in product search is the vocabulary mismatch between query
and products, which may be a larger vocabulary gap problem compared to other
information retrieval domains. While there is a growing collection of neural
learning to match methods aimed specifically at overcoming this issue, they do
not leverage the recent advances of large language models for product search.
On the other hand, product ranking often deals with multiple types of
engagement signals such as clicks, add-to-cart, and purchases, while most of
the existing works are focused on optimizing one single metric such as
click-through rate, which may suffer from data sparsity. In this work, we
propose a novel end-to-end multi-task learning framework for product ranking
with BERT to address the above challenges. The proposed model utilizes
domain-specific BERT with fine-tuning to bridge the vocabulary gap and employs
multi-task learning to optimize multiple objectives simultaneously, which
yields a general end-to-end learning framework for product search. We conduct a
set of comprehensive experiments on a real-world e-commerce dataset and
demonstrate significant improvement of the proposed approach over the
state-of-the-art baseline methods.
","[{'version': 'v1', 'created': 'Thu, 10 Feb 2022 20:44:34 GMT'}, {'version': 'v2', 'created': 'Thu, 31 Mar 2022 22:06:52 GMT'}]",2022-04-04,"[['Wu', 'Xuyang', ''], ['Magnani', 'Alessandro', ''], ['Chaidaroon', 'Suthee', ''], ['Puthenputhussery', 'Ajit', ''], ['Liao', 'Ciya', ''], ['Fang', 'Yi', '']]","['Product Search', 'Multi-task Learning', 'Neural Information Retrieval']"
10026,1812.09878,Kavya Gupta,"Kavya Gupta, Brojeshwar Bhowmick and Angshul Majumdar","Coupled Analysis Dictionary Learning to inductively learn inversion:
  Application to real-time reconstruction of Biomedical signals","2018 International Joint Conference on Neural Networks (IJCNN)(July
  2018)",,10.1109/IJCNN.2018.8489148,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This work addresses the problem of reconstructing biomedical signals from
their lower dimensional projections. Traditionally Compressed Sensing (CS)
based techniques have been employed for this task. These are transductive
inversion processes, the problem with these approaches is that the inversion is
time-consuming and hence not suitable for real-time applications. With the
recent advent of deep learning, Stacked Sparse Denoising Autoencoder (SSDAE)
has been used for learning inversion in an inductive setup. The training period
for inductive learning is large but is very fast during application -- capable
of real-time speed. This work proposes a new approach for inductive learning of
the inversion process. It is based on Coupled Analysis Dictionary Learning.
Results on Biomedical signal reconstruction show that our proposed approach is
very fast and yields result far better than CS and SSDAE.
","[{'version': 'v1', 'created': 'Mon, 24 Dec 2018 10:17:20 GMT'}]",2018-12-27,"[['Gupta', 'Kavya', ''], ['Bhowmick', 'Brojeshwar', ''], ['Majumdar', 'Angshul', '']]","['inverse problem', 'reconstruction', 'inductive']"
10027,2009.01122,Carlos Novo,Carlos Novo and Ricardo Morla (University of Porto and INESC TEC),"Flow-based detection and proxy-based evasion of encrypted malware C2
  traffic","9 pages, 6 figures",,10.1145/3411508.3421379,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  State of the art deep learning techniques are known to be vulnerable to
evasion attacks where an adversarial sample is generated from a malign sample
and misclassified as benign. Detection of encrypted malware command and control
traffic based on TCP/IP flow features can be framed as a learning task and is
thus vulnerable to evasion attacks. However, unlike e.g. in image processing
where generated adversarial samples can be directly mapped to images, going
from flow features to actual TCP/IP packets requires crafting the sequence of
packets, with no established approach for such crafting and a limitation on the
set of modifiable features that such crafting allows. In this paper we discuss
learning and evasion consequences of the gap between generated and crafted
adversarial samples. We exemplify with a deep neural network detector trained
on a public C2 traffic dataset, white-box adversarial learning, and a
proxy-based approach for crafting longer flows. Our results show 1) the high
evasion rate obtained by using generated adversarial samples on the detector
can be significantly reduced when using crafted adversarial samples; 2)
robustness against adversarial samples by model hardening varies according to
the crafting approach and corresponding set of modifiable features that the
attack allows for; 3) incrementally training hardened models with adversarial
samples can produce a level playing field where no detector is best against all
attacks and no attack is best against all detectors, in a given set of attacks
and detectors. To the best of our knowledge this is the first time that level
playing field feature set- and iteration-hardening are analyzed in encrypted C2
malware traffic detection.
","[{'version': 'v1', 'created': 'Wed, 2 Sep 2020 15:00:41 GMT'}]",2020-11-10,"[['Novo', 'Carlos', '', 'University of Porto and INESC TEC'], ['Morla', 'Ricardo', '', 'University of Porto and INESC TEC']]","['Malware command and control', 'intrusion detection', 'adversariallearning']"
10028,2203.13190,Alberto Nogales,"Alvaro J. Garcia-Tejedor, Alberto Nogales",GEMA: An open-source Python library for self-organizing-maps,,,10.1016/j.simpa.2022.100280,,cs.NE cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Organizations have realized the importance of data analysis and its benefits.
This in combination with Machine Learning algorithms has allowed to solve
problems more easily, making these processes less time-consuming. Neural
networks are the Machine Learning technique that is recently obtaining very
good best results. This paper describes an open-source Python library called
GEMA developed to work with a type of neural network model called
Self-Organizing-Maps. GEMA is freely available under GNU General Public License
at GitHub (https://github.com/ufvceiec/GEMA). The library has been evaluated in
different a particular use case obtaining accurate results.
","[{'version': 'v1', 'created': 'Thu, 17 Feb 2022 10:49:01 GMT'}]",2022-04-19,"[['Garcia-Tejedor', 'Alvaro J.', ''], ['Nogales', 'Alberto', '']]","['Machine learning', 'Neural networks', 'Self-organizing maps']"
10029,2211.08047,George Drettakis,"Siddhant Prakash and Gilles Rainer and Adrien Bousseau and George
  Drettakis",Deep scene-scale material estimation from multi-view indoor captures,17 pages,"Computers & Graphics, vol 109, pp 15-29, Dec. 2022",10.1016/j.cag.2022.09.010,,cs.GR cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The movie and video game industries have adopted photogrammetry as a way to
create digital 3D assets from multiple photographs of a real-world scene. But
photogrammetry algorithms typically output an RGB texture atlas of the scene
that only serves as visual guidance for skilled artists to create material maps
suitable for physically-based rendering. We present a learning-based approach
that automatically produces digital assets ready for physically-based
rendering, by estimating approximate material maps from multi-view captures of
indoor scenes that are used with retopologized geometry. We base our approach
on a material estimation Convolutional Neural Network (CNN) that we execute on
each input image. We leverage the view-dependent visual cues provided by the
multiple observations of the scene by gathering, for each pixel of a given
image, the color of the corresponding point in other images. This image-space
CNN provides us with an ensemble of predictions, which we merge in texture
space as the last step of our approach. Our results demonstrate that the
recovered assets can be directly used for physically-based rendering and
editing of real indoor scenes from any viewpoint and novel lighting. Our method
generates approximate material maps in a fraction of time compared to the
closest previous solutions.
","[{'version': 'v1', 'created': 'Tue, 15 Nov 2022 10:58:28 GMT'}]",2022-11-16,"[['Prakash', 'Siddhant', ''], ['Rainer', 'Gilles', ''], ['Bousseau', 'Adrien', ''], ['Drettakis', 'George', '']]","['Material estimation', 'Deeplearning', 'Indoor scenes', 'Photogrammetry', 'Synthetic dataset', 'Digital 3D assets']"
10030,2205.07116,Akihito Yoshii,"Akihito Yoshii, Susumu Tokumoto, Fuyuki Ishikawa",Practical Insights of Repairing Model Problems on Image Classification,,,10.1145/3522664.3528608,,cs.LG cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Additional training of a deep learning model can cause negative effects on
the results, turning an initially positive sample into a negative one
(degradation). Such degradation is possible in real-world use cases due to the
diversity of sample characteristics. That is, a set of samples is a mixture of
critical ones which should not be missed and less important ones. Therefore, we
cannot understand the performance by accuracy alone. While existing research
aims to prevent a model degradation, insights into the related methods are
needed to grasp their benefits and limitations. In this talk, we will present
implications derived from a comparison of methods for reducing degradation.
Especially, we formulated use cases for industrial settings in terms of
arrangements of a data set. The results imply that a practitioner should care
about better method continuously considering dataset availability and life
cycle of an AI system because of a trade-off between accuracy and preventing
degradation.
","[{'version': 'v1', 'created': 'Sat, 14 May 2022 19:28:55 GMT'}]",2022-05-19,"[['Yoshii', 'Akihito', ''], ['Tokumoto', 'Susumu', ''], ['Ishikawa', 'Fuyuki', '']]","['AI', 'machine learning', 'deep learning', 'image classification']"
10031,2212.09503,Alexander Braylan,"Alexander Braylan, Omar Alonso, Matthew Lease","Measuring Annotator Agreement Generally across Complex Structured,
  Multi-object, and Free-text Annotation Tasks",,,10.1145/3485447.3512242,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When annotators label data, a key metric for quality assurance is
inter-annotator agreement (IAA): the extent to which annotators agree on their
labels. Though many IAA measures exist for simple categorical and ordinal
labeling tasks, relatively little work has considered more complex labeling
tasks, such as structured, multi-object, and free-text annotations.
Krippendorff's alpha, best known for use with simpler labeling tasks, does have
a distance-based formulation with broader applicability, but little work has
studied its efficacy and consistency across complex annotation tasks.
  We investigate the design and evaluation of IAA measures for complex
annotation tasks, with evaluation spanning seven diverse tasks: image bounding
boxes, image keypoints, text sequence tagging, ranked lists, free text
translations, numeric vectors, and syntax trees. We identify the difficulty of
interpretability and the complexity of choosing a distance function as key
obstacles in applying Krippendorff's alpha generally across these tasks. We
propose two novel, more interpretable measures, showing they yield more
consistent IAA measures across tasks and annotation distance functions.
","[{'version': 'v1', 'created': 'Thu, 15 Dec 2022 20:12:48 GMT'}]",2022-12-20,"[['Braylan', 'Alexander', ''], ['Alonso', 'Omar', ''], ['Lease', 'Matthew', '']]","['annotation', 'labeling', 'inter-annotator agreement', 'quality assurance']"
10032,2007.13534,Longbing Cao,Longbing Cao,Coupling Learning of Complex Interactions,,"Journal of Information Processing and Management, 51(2): 167-186
  (2015)",10.1016/j.ipm.2014.08.007,,cs.LG cs.AI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Complex applications such as big data analytics involve different forms of
coupling relationships that reflect interactions between factors related to
technical, business (domain-specific) and environmental (including
socio-cultural and economic) aspects. There are diverse forms of couplings
embedded in poor-structured and ill-structured data. Such couplings are
ubiquitous, implicit and/or explicit, objective and/or subjective,
heterogeneous and/or homogeneous, presenting complexities to existing learning
systems in statistics, mathematics and computer sciences, such as typical
dependency, association and correlation relationships. Modeling and learning
such couplings thus is fundamental but challenging. This paper discusses the
concept of coupling learning, focusing on the involvement of coupling
relationships in learning systems. Coupling learning has great potential for
building a deep understanding of the essence of business problems and handling
challenges that have not been addressed well by existing learning theories and
tools. This argument is verified by several case studies on coupling learning,
including handling coupling in recommender systems, incorporating couplings
into coupled clustering, coupling document clustering, coupled recommender
algorithms and coupled behavior analysis for groups.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2020 11:04:25 GMT'}]",2020-07-28,"[['Cao', 'Longbing', '']]","['Coupling learning', 'coupling relationship', 'interaction learning', 'non-IIDness learning', 'invisibility learning']"
10033,2209.03097,Hartmut Surmann HaSu,"Christian Jestel and Hartmut Surmann and Jonas Stenzel and Oliver
  Urbann and Marius Brehler","Obtaining Robust Control and Navigation Policies for Multi-Robot
  Navigation via Deep Reinforcement Learning",13 pages,,10.1109/ICARA51699.2021.9376457,,cs.RO,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Multi-robot navigation is a challenging task in which multiple robots must be
coordinated simultaneously within dynamic environments. We apply deep
reinforcement learning (DRL) to learn a decentralized end-to-end policy which
maps raw sensor data to the command velocities of the agent. In order to enable
the policy to generalize, the training is performed in different environments
and scenarios. The learned policy is tested and evaluated in common multi-robot
scenarios like switching a place, an intersection and a bottleneck situation.
This policy allows the agent to recover from dead ends and to navigate through
complex environments.
","[{'version': 'v1', 'created': 'Wed, 7 Sep 2022 12:17:31 GMT'}]",2022-09-08,"[['Jestel', 'Christian', ''], ['Surmann', 'Hartmut', ''], ['Stenzel', 'Jonas', ''], ['Urbann', 'Oliver', ''], ['Brehler', 'Marius', '']]","['Deep Reinforcement Learning', 'Navigation', 'Multi-Agent']"
10034,1712.03076,Anh Nguyen Duc,"Anh Nguyen Duc, Pekka Abrahamsson","Exploring the outsourcing relationship in software startups: A multiple
  case study","This is the author's version of the work. Copyright owner's version
  can be accessed at https://doi.org/10.1145/3084226.3084248",,10.1145/3084226.3084248,,cs.CY cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software startups are becoming increasingly popular in software industry as
well as other sectors of economy. Startups that lack necessary competences
often seek for external resources from outsourcing partners. Little is known
how this outsourcing relationship works and whether it makes sense to outsource
the technical competence to an external party. This is among the first
investigations on the outsourcing relationships in software startups. By
conducting exploratory case studies at six startups, we found a mixed
experience with outsourcing. The experimental nature of an early product
development makes outsourcing a feasible option, although startups often suffer
from its uncertainty and managing commitments from partners. Results further
propose that early contract-based activities could be transformed into a
long-term partnership by adopting a startup boundary spanner s role,
establishing an inter-personal relationship and maintaining a mutual
commitment.
","[{'version': 'v1', 'created': 'Sat, 2 Dec 2017 22:25:24 GMT'}]",2017-12-11,"[['Duc', 'Anh Nguyen', ''], ['Abrahamsson', 'Pekka', '']]","['outsourcing partnership', 'outsourcing startup', 'global']"
10035,1708.01473,Alberto Pettorossi,"Emanuele De Angelis (1), Fabio Fioravanti (1), Alberto Pettorossi (2),
  Maurizio Proietti (3) ((1) DEC, University G. D'Annunzio, Pescara, Italy, (2)
  DICII, Universita' di Roma Tor Vergata, Roma, Italy, (3) CNR-IASI, Roma,
  Italy)",Predicate Pairing for Program Verification,Published in Theory and Practice of Logic Programming (TPLP),"DE ANGELIS, E., FIORAVANTI, F., PETTOROSSI, A., & PROIETTI, M.
  (2018). Predicate Pairing for program verification. Theory and Practice of
  Logic Programming, 18(2), pages 126-166",10.1017/S1471068417000497,,cs.LO cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is well-known that the verification of partial correctness properties of
imperative programs can be reduced to the satisfiability problem for
constrained Horn clauses (CHCs). However, state-of-the-art solvers for CHCs
(CHC solvers) based on predicate abstraction are sometimes unable to verify
satisfiability because they look for models that are definable in a given class
A of constraints, called A-definable models. We introduce a transformation
technique, called Predicate Pairing (PP), which is able, in many interesting
cases, to transform a set of clauses into an equisatisfiable set whose
satisfiability can be proved by finding an A-definable model, and hence can be
effectively verified by CHC solvers. We prove that, under very general
conditions on A, the unfold/fold transformation rules preserve the existence of
an A-definable model, i.e., if the original clauses have an A-definable model,
then the transformed clauses have an A-definable model. The converse does not
hold in general, and we provide suitable conditions under which the transformed
clauses have an A-definable model iff the original ones have an A-definable
model. Then, we present the PP strategy which guides the application of the
transformation rules with the objective of deriving a set of clauses whose
satisfiability can be proved by looking for A-definable models. PP introduces a
new predicate defined by the conjunction of two predicates together with some
constraints. We show through some examples that an A-definable model may exist
for the new predicate even if it does not exist for its defining atomic
conjuncts. We also present some case studies showing that PP plays a crucial
role in the verification of relational properties of programs (e.g., program
equivalence and non-interference). Finally, we perform an experimental
evaluation to assess the effectiveness of PP in increasing the power of CHC
solving.
","[{'version': 'v1', 'created': 'Fri, 4 Aug 2017 12:24:22 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Jun 2018 20:39:52 GMT'}]",2018-06-29,"[['De Angelis', 'Emanuele', ''], ['Fioravanti', 'Fabio', ''], ['Pettorossi', 'Alberto', ''], ['Proietti', 'Maurizio', '']]","['Program Verification', 'Constrained Horn Clauses', 'Constraint Logic Programming', 'Program Transformation', 'Relational Properties of Programs']"
10036,1606.03192,Shaohua Li,"Shaohua Li, Jun Zhu, Chunyan Miao",PSDVec: a Toolbox for Incremental and Scalable Word Embedding,"12 pages, accepted by Neurocomputing, Software Track on Original
  Software Publications",,10.1016/j.neucom.2016.05.093,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  PSDVec is a Python/Perl toolbox that learns word embeddings, i.e. the mapping
of words in a natural language to continuous vectors which encode the
semantic/syntactic regularities between the words. PSDVec implements a word
embedding learning method based on a weighted low-rank positive semidefinite
approximation. To scale up the learning process, we implement a blockwise
online learning algorithm to learn the embeddings incrementally. This strategy
greatly reduces the learning time of word embeddings on a large vocabulary, and
can learn the embeddings of new words without re-learning the whole vocabulary.
On 9 word similarity/analogy benchmark sets and 2 Natural Language Processing
(NLP) tasks, PSDVec produces embeddings that has the best average performance
among popular word embedding tools. PSDVec provides a new option for NLP
practitioners.
","[{'version': 'v1', 'created': 'Fri, 10 Jun 2016 05:55:58 GMT'}]",2016-07-05,"[['Li', 'Shaohua', ''], ['Zhu', 'Jun', ''], ['Miao', 'Chunyan', '']]","['word embedding', 'matrix factorization', 'incremental learning']"
10037,2210.11843,Rui Xie,"Rui Xie, Tianxiang Hu, Wei Ye, Shikun Zhang",Low-Resources Project-Specific Code Summarization,Accepted by ASE 2022,,10.1145/3551349.3556909,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Code summarization generates brief natural language descriptions of source
code pieces, which can assist developers in understanding code and reduce
documentation workload. Recent neural models on code summarization are trained
and evaluated on large-scale multi-project datasets consisting of independent
code-summary pairs. Despite the technical advances, their effectiveness on a
specific project is rarely explored. In practical scenarios, however,
developers are more concerned with generating high-quality summaries for their
working projects. And these projects may not maintain sufficient documentation,
hence having few historical code-summary pairs. To this end, we investigate
low-resource project-specific code summarization, a novel task more consistent
with the developers' requirements. To better characterize project-specific
knowledge with limited training samples, we propose a meta transfer learning
method by incorporating a lightweight fine-tuning mechanism into a
meta-learning framework. Experimental results on nine real-world projects
verify the superiority of our method over alternative ones and reveal how the
project-specific knowledge is learned.
","[{'version': 'v1', 'created': 'Fri, 21 Oct 2022 09:44:01 GMT'}]",2022-10-24,"[['Xie', 'Rui', ''], ['Hu', 'Tianxiang', ''], ['Ye', 'Wei', ''], ['Zhang', 'Shikun', '']]","['low-resources project-specific code summarization', 'parameter efficient transfer learning', 'meta learning']"
10038,1708.04804,"Tobias B\""ottger","Tobias B\""ottger, Christina Eisenhofer",Efficiently Tracking Homogeneous Regions in Multichannel Images,to be published in ICPRS 2017 proceedings,,10.1049/cp.2017.0143,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a method for tracking Maximally Stable Homogeneous Regions (MSHR)
in images with an arbitrary number of channels. MSHR are conceptionally very
similar to Maximally Stable Extremal Regions (MSER) and Maximally Stable Color
Regions (MSCR), but can also be applied to hyperspectral and color images while
remaining extremely efficient. The presented approach makes use of the
edge-based component-tree which can be calculated in linear time. In the
tracking step, the MSHR are localized by matching them to the nodes in the
component-tree. We use rotationally invariant region and gray-value features
that can be calculated through first and second order moments at low
computational complexity. Furthermore, we use a weighted feature vector to
improve the data association in the tracking step. The algorithm is evaluated
on a collection of different tracking scenes from the literature. Furthermore,
we present two different applications: 2D object tracking and the 3D
segmentation of organs.
","[{'version': 'v1', 'created': 'Wed, 16 Aug 2017 08:30:47 GMT'}]",2018-07-27,"[['Böttger', 'Tobias', ''], ['Eisenhofer', 'Christina', '']]","['Object Tracking', 'Multispectral Images', 'MSER', 'Component-trees']"
10039,2003.04578,Ren\'e van Bevern,Ren\'e van Bevern and Pavel V. Smirnov,"Optimal-size problem kernels for $d$-Hitting Set in linear time and
  space","More detailed algorithm descriptions, extended experimental section","Information Processing Letters 163:105998, 2020",10.1016/j.ipl.2020.105998,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The known linear-time kernelizations for $d$-Hitting Set guarantee linear
worst-case running times using a quadratic-size data structure (that is not
fully initialized). Getting rid of this data structure, we show that problem
kernels of asymptotically optimal size $O(k^d)$ for $d$-Hitting Set are
computable in linear time and space. Additionally, we experimentally compare
the linear-time kernelizations for $d$-Hitting Set to each other and to a
classical data reduction algorithm due to Weihe.
","[{'version': 'v1', 'created': 'Tue, 10 Mar 2020 08:41:17 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Jun 2020 14:11:21 GMT'}]",2021-01-14,"[['van Bevern', 'René', ''], ['Smirnov', 'Pavel V.', '']]","['combinatorial optimization', 'NP-hard problem', 'data reduction', 'parameterized complexity', 'kernelization']"
10040,1911.08202,Christian Meske,"Christian Meske, Ireti Amojo","Status Quo, Critical Reflection and Road Ahead of Digital Nudging in
  Information Systems Research -- A Discussion with Markus Weinmann and Alexey
  Voinov",,"Communications of the Association for Information Systems (Volume
  46, Article 17), 04/2020",10.17705/1CAIS.04617,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Research on Digital Nudging has become increasingly popular in the
Information Systems (IS) community. This paper presents an overview of the
current progress, a critical reflection and an outlook to further research
regarding Digital Nudging in IS. For this purpose, we conducted a comprehensive
literature review as well as an interview with Markus Weinmann from Rotterdam
School of Management at Erasmus University, one of the first scholars who
introduced Digital Nudging to the IS community, and Alexey Voinov, director of
the Centre on Persuasive Systems for Wise Adaptive Living at University of
Technology Sydney. The findings uncover a gap between what we know about what
constitutes Digital Nudging and how consequent requirements can actually be put
into practice. In this context, the original concept of Nudging bears inherent
challenges, e.g. regarding the focus on the individuals' welfare, which hence
also apply to Digital Nudging. Moreover, we need a better understanding of how
Nudging in digital choice environments differs from that in the offline world.
To further distinguish itself from other disciplines that already tested
various nudges in many different domains, Digital Nudging Research in IS may
benefit from a strong Design Science perspective, going beyond the test of
effectiveness and providing specific design principles for the different types
of digital nudges.
","[{'version': 'v1', 'created': 'Tue, 19 Nov 2019 10:44:27 GMT'}, {'version': 'v2', 'created': 'Fri, 22 May 2020 04:38:28 GMT'}]",2020-05-25,"[['Meske', 'Christian', ''], ['Amojo', 'Ireti', '']]","['Digital Nudging', 'Persuasion', 'Persuasive Technology', 'Ethics', 'Manipulation']"
10041,2108.11561,Yonchanok Khaokaew,"Yonchanok Khaokaew, Mohammad Saiedur Rahaman, Ryen W. White, Flora D.
  Salim",CoSEM: Contextual and Semantic Embedding for App Usage Prediction,"5 pages, short paper in Proceedings of the 30th ACM International
  Conference on Information and Knowledge Management (CIKM '21)",,10.1145/3459637.3482076,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  App usage prediction is important for smartphone system optimization to
enhance user experience. Existing modeling approaches utilize historical app
usage logs along with a wide range of semantic information to predict the app
usage; however, they are only effective in certain scenarios and cannot be
generalized across different situations. This paper address this problem by
developing a model called Contextual and Semantic Embedding model for App Usage
Prediction (CoSEM) for app usage prediction that leverages integration of 1)
semantic information embedding and 2) contextual information embedding based on
historical app usage of individuals. Extensive experiments show that the
combination of semantic information and history app usage information enables
our model to outperform the baselines on three real-world datasets, achieving
an MRR score over 0.55,0.57,0.86 and Hit rate scores of more than 0.71, 0.75,
and 0.95, respectively.
","[{'version': 'v1', 'created': 'Thu, 26 Aug 2021 02:38:44 GMT'}]",2021-08-27,"[['Khaokaew', 'Yonchanok', ''], ['Rahaman', 'Mohammad Saiedur', ''], ['White', 'Ryen W.', ''], ['Salim', 'Flora D.', '']]","['App usage prediction', 'semantic embedding', 'profile embedding']"
10042,1802.00688,Malika Bendechache,"Malika Bendechache, Nhien-An Le-Khac and M-Tahar Kechadi","Hierarchical Aggregation Approach for Distributed clustering of spatial
  datasets","6 pages. arXiv admin note: substantial text overlap with
  arXiv:1704.03421",,10.1109/ICDMW.2016.0158,,cs.DB cs.DC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a new approach of distributed clustering for
spatial datasets, based on an innovative and efficient aggregation technique.
This distributed approach consists of two phases: 1) local clustering phase,
where each node performs a clustering on its local data, 2) aggregation phase,
where the local clusters are aggregated to produce global clusters. This
approach is characterised by the fact that the local clusters are represented
in a simple and efficient way. And The aggregation phase is designed in such a
way that the final clusters are compact and accurate while the overall process
is efficient in both response time and memory allocation. We evaluated the
approach with different datasets and compared it to well-known clustering
techniques. The experimental results show that our approach is very promising
and outperforms all those algorithms
","[{'version': 'v1', 'created': 'Thu, 1 Feb 2018 12:50:59 GMT'}]",2018-02-05,"[['Bendechache', 'Malika', ''], ['Le-Khac', 'Nhien-An', ''], ['Kechadi', 'M-Tahar', '']]","['Big Data', 'spatial data', 'clustering', 'distributed mining', 'data analysis', 'k-means', 'DBSCAN', 'balance vector']"
10043,2112.02183,Grischa Fraumann,"Grischa Fraumann, Rogerio Mugnaini, Elias Sanz-Casado",International Conferences of Bibliometrics,"In book: Handbook Bibliometrics | Edition: De Gruyter Reference |
  Chapter: 1.6 | Publisher: De Gruyter Saur",,10.1515/9783110646610-008,,cs.DL cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Conferences are deeply connected to research fields, in this case
bibliometrics. As such, they are a venue to present and discuss current and
innovative research, and play an important role for the scholarly community. In
this article, we provide an overview on the history of conferences in
bibliometrics. We conduct an analysis to list the most prominent conferences
that were announced in the newsletter by ISSI, the International Society for
Scientometrics and Informetrics. Furthermore, we describe how conferences are
connected to learned societies and journals. Finally, we provide an outlook on
how conferences might change in future.
","[{'version': 'v1', 'created': 'Fri, 3 Dec 2021 22:28:18 GMT'}]",2021-12-07,"[['Fraumann', 'Grischa', ''], ['Mugnaini', 'Rogerio', ''], ['Sanz-Casado', 'Elias', '']]","['international conferences', 'bibliometrics', 'scientometrics', 'informetrics', 'altmetrics', 'history', 'learned societies', 'ISSI']"
10044,2101.10074,Setareh Maghsudi,"Setareh Maghsudi, Andrew Lan, Jie Xu, and Mihaela van der Schaar",Personalized Education in the AI Era: What to Expect Next?,,,10.1109/MSP.2021.3055032,,cs.CY cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The objective of personalized learning is to design an effective knowledge
acquisition track that matches the learner's strengths and bypasses her
weaknesses to ultimately meet her desired goal. This concept emerged several
years ago and is being adopted by a rapidly-growing number of educational
institutions around the globe. In recent years, the boost of artificial
intelligence (AI) and machine learning (ML), together with the advances in big
data analysis, has unfolded novel perspectives to enhance personalized
education in numerous dimensions. By taking advantage of AI/ML methods, the
educational platform precisely acquires the student's characteristics. This is
done, in part, by observing the past experiences as well as analyzing the
available big data through exploring the learners' features and similarities.
It can, for example, recommend the most appropriate content among numerous
accessible ones, advise a well-designed long-term curriculum, connect
appropriate learners by suggestion, accurate performance evaluation, and the
like. Still, several aspects of AI-based personalized education remain
unexplored. These include, among others, compensating for the adverse effects
of the absence of peers, creating and maintaining motivations for learning,
increasing diversity, removing the biases induced by the data and algorithms,
and the like. In this paper, while providing a brief review of state-of-the-art
research, we investigate the challenges of AI/ML-based personalized education
and discuss potential solutions.
","[{'version': 'v1', 'created': 'Tue, 19 Jan 2021 12:23:32 GMT'}]",2021-02-16,"[['Maghsudi', 'Setareh', ''], ['Lan', 'Andrew', ''], ['Xu', 'Jie', ''], ['van der Schaar', 'Mihaela', '']]","['Artificial intelligence', 'Learning platform', 'Machine learning', 'Personalized education']"
10045,2002.10973,Paulina Paraponiari,Vagia Karyoti and Paulina Paraponiari,Weighted PCL over product valuation monoids,"22 pages, 3 figures. arXiv admin note: text overlap with
  arXiv:1704.04969",,10.1007/978-3-030-50029-0_19,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a weighted propositional configuration logic over a product
valuation monoid. Our logic is intended to serve as a specification language
for software architectures with quantitative features such as the average of
all interactions' costs of the architecture and the maximum cost among all
costs occurring most frequently within a specific number of components in an
architecture. We provide formulas of our logic which describe well-known
architectures equipped with quantitative characteristics. Moreover, we prove an
efficient construction of a full normal form which leads to decidability of
equivalence of formulas in this logic.
","[{'version': 'v1', 'created': 'Tue, 25 Feb 2020 15:36:18 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Apr 2020 18:06:00 GMT'}]",2021-09-15,"[['Karyoti', 'Vagia', ''], ['Paraponiari', 'Paulina', '']]","['Software architectures', 'configuration logics', 'product valuation monoids', 'weightedconfiguration logics', 'quantitative features']"
10046,1907.03843,Manuel Lopes,"Pedro Fernandes, Francisco C. Santos, Manuel Lopes","Norms for Beneficial A.I.: A Computational Analysis of the Societal
  Value Alignment Problem",,"AI Communications, vol. 33, no. 3-6, pp. 155-171, 2020",10.3233/AIC-201502,,cs.CY cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rise of artificial intelligence (A.I.) based systems is already offering
substantial benefits to the society as a whole. However, these systems may also
enclose potential conflicts and unintended consequences. Notably, people will
tend to adopt an A.I. system if it confers them an advantage, at which point
non-adopters might push for a strong regulation if that advantage for adopters
is at a cost for them. Here we propose an agent-based game-theoretical model
for these conflicts, where agents may decide to resort to A.I. to use and
acquire additional information on the payoffs of a stochastic game, striving to
bring insights from simulation to what has been, hitherto, a mostly
philosophical discussion. We frame our results under the current discussion on
ethical A.I. and the conflict between individual and societal gains: the
societal value alignment problem. We test the arising equilibria in the
adoption of A.I. technology under different norms followed by artificial
agents, their ensuing benefits, and the emergent levels of wealth inequality.
We show that without any regulation, purely selfish A.I. systems will have the
strongest advantage, even when a utilitarian A.I. provides significant benefits
for the individual and the society. Nevertheless, we show that it is possible
to develop A.I. systems following human conscious policies that, when
introduced in society, lead to an equilibrium where the gains for the adopters
are not at a cost for non-adopters, thus increasing the overall wealth of the
population and lowering inequality. However, as shown, a self-organised
adoption of such policies would require external regulation.
","[{'version': 'v1', 'created': 'Wed, 26 Jun 2019 10:18:19 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Dec 2020 18:11:35 GMT'}]",2020-12-23,"[['Fernandes', 'Pedro', ''], ['Santos', 'Francisco C.', ''], ['Lopes', 'Manuel', '']]","['AI ethics', 'Game theoretical analysis', 'AI regulation', 'Social Simulation']"
10047,1910.06097,Bernhard Kragl,"Thomas Ferr\`ere, Thomas A. Henzinger, Bernhard Kragl",Monitoring Event Frequencies,"This is an extended version of a paper presented at the 28th EACSL
  Annual Conference on Computer Science Logic (CSL 2020), which provides
  missing proofs in the appendix",,10.4230/LIPIcs.CSL.2020.20,,cs.LO cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The monitoring of event frequencies can be used to recognize behavioral
anomalies, to identify trends, and to deduce or discard hypotheses about the
underlying system. For example, the performance of a web server may be
monitored based on the ratio of the total count of requests from the least and
most active clients. Exact frequency monitoring, however, can be prohibitively
expensive; in the above example it would require as many counters as there are
clients. In this paper, we propose the efficient probabilistic monitoring of
common frequency properties, including the mode (i.e., the most common event)
and the median of an event sequence. We define a logic to express composite
frequency properties as a combination of atomic frequency properties. Our main
contribution is an algorithm that, under suitable probabilistic assumptions,
can be used to monitor these important frequency properties with four counters,
independent of the number of different events. Our algorithm samples longer and
longer subwords of an infinite event sequence. We prove the almost-sure
convergence of our algorithm by generalizing ergodic theory from
increasing-length prefixes to increasing-length subwords of an infinite
sequence. A similar algorithm could be used to learn a connected Markov chain
of a given structure from observing its outputs, to arbitrary precision, for a
given confidence.
","[{'version': 'v1', 'created': 'Mon, 14 Oct 2019 12:35:04 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Jan 2020 13:59:43 GMT'}]",2020-01-13,"[['Ferrère', 'Thomas', ''], ['Henzinger', 'Thomas A.', ''], ['Kragl', 'Bernhard', '']]","['monitoring', 'frequency property', 'Markov chain']"
10048,2011.00550,Xinyi Dai,"Xinyi Dai, Jiawei Hou, Qing Liu, Yunjia Xi, Ruiming Tang, Weinan
  Zhang, Xiuqiang He, Jun Wang, Yong Yu",U-rank: Utility-oriented Learning to Rank with Implicit Feedback,,,10.1145/3340531.3412756,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning to rank with implicit feedback is one of the most important tasks in
many real-world information systems where the objective is some specific
utility, e.g., clicks and revenue. However, we point out that existing methods
based on probabilistic ranking principle do not necessarily achieve the highest
utility. To this end, we propose a novel ranking framework called U-rank that
directly optimizes the expected utility of the ranking list. With a
position-aware deep click-through rate prediction model, we address the
attention bias considering both query-level and item-level features. Due to the
item-specific attention bias modeling, the optimization for expected utility
corresponds to a maximum weight matching on the item-position bipartite graph.
We base the optimization of this objective in an efficient Lambdaloss
framework, which is supported by both theoretical and empirical analysis. We
conduct extensive experiments for both web search and recommender systems over
three benchmark datasets and two proprietary datasets, where the performance
gain of U-rank over state-of-the-arts is demonstrated. Moreover, our proposed
U-rank has been deployed on a large-scale commercial recommender and a large
improvement over the production baseline has been observed in an online A/B
testing.
","[{'version': 'v1', 'created': 'Sun, 1 Nov 2020 16:29:05 GMT'}]",2020-11-03,"[['Dai', 'Xinyi', ''], ['Hou', 'Jiawei', ''], ['Liu', 'Qing', ''], ['Xi', 'Yunjia', ''], ['Tang', 'Ruiming', ''], ['Zhang', 'Weinan', ''], ['He', 'Xiuqiang', ''], ['Wang', 'Jun', ''], ['Yu', 'Yong', '']]","['Learning to Rank', 'Utility Maximization', 'Position Bias', 'Implicit Feedback']"
10049,1803.09163,Tegjyot Singh Sethi,"Tegjyot Singh Sethi, Mehmed Kantardzic, Joung Woo Ryu","Security Theater: On the Vulnerability of Classifiers to Exploratory
  Attacks","Pacific-Asia Workshop on Intelligence and Security Informatics.
  Springer, Cham, 2017",,10.1007/978-3-319-57463-9_4,,cs.LG cs.CR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing scale and sophistication of cyberattacks has led to the
adoption of machine learning based classification techniques, at the core of
cybersecurity systems. These techniques promise scale and accuracy, which
traditional rule or signature based methods cannot. However, classifiers
operating in adversarial domains are vulnerable to evasion attacks by an
adversary, who is capable of learning the behavior of the system by employing
intelligently crafted probes. Classification accuracy in such domains provides
a false sense of security, as detection can easily be evaded by carefully
perturbing the input samples. In this paper, a generic data driven framework is
presented, to analyze the vulnerability of classification systems to black box
probing based attacks. The framework uses an exploration exploitation based
strategy, to understand an adversary's point of view of the attack defense
cycle. The adversary assumes a black box model of the defender's classifier and
can launch indiscriminate attacks on it, without information of the defender's
model type, training data or the domain of application. Experimental evaluation
on 10 real world datasets demonstrates that even models having high perceived
accuracy (>90%), by a defender, can be effectively circumvented with a high
evasion rate (>95%, on average). The detailed attack algorithms, adversarial
model and empirical evaluation, serve.
","[{'version': 'v1', 'created': 'Sat, 24 Mar 2018 21:10:00 GMT'}]",2018-03-28,"[['Sethi', 'Tegjyot Singh', ''], ['Kantardzic', 'Mehmed', ''], ['Ryu', 'Joung Woo', '']]","['adversary', 'reverse engineering', 'classification', 'cybersecurity']"
10050,2004.09044,Chi Zhang,"Yixin Zhu, Tao Gao, Lifeng Fan, Siyuan Huang, Mark Edmonds, Hangxin
  Liu, Feng Gao, Chi Zhang, Siyuan Qi, Ying Nian Wu, Joshua B. Tenenbaum,
  Song-Chun Zhu","Dark, Beyond Deep: A Paradigm Shift to Cognitive AI with Humanlike
  Common Sense","For high quality figures, please refer to
  http://wellyzhang.github.io/attach/dark.pdf","Engineering, Feb, 2020",10.1016/j.eng.2020.01.011,,cs.AI cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent progress in deep learning is essentially based on a ""big data for
small tasks"" paradigm, under which massive amounts of data are used to train a
classifier for a single narrow task. In this paper, we call for a shift that
flips this paradigm upside down. Specifically, we propose a ""small data for big
tasks"" paradigm, wherein a single artificial intelligence (AI) system is
challenged to develop ""common sense"", enabling it to solve a wide range of
tasks with little training data. We illustrate the potential power of this new
paradigm by reviewing models of common sense that synthesize recent
breakthroughs in both machine and human vision. We identify functionality,
physics, intent, causality, and utility (FPICU) as the five core domains of
cognitive AI with humanlike common sense. When taken as a unified concept,
FPICU is concerned with the questions of ""why"" and ""how"", beyond the dominant
""what"" and ""where"" framework for understanding vision. They are invisible in
terms of pixels but nevertheless drive the creation, maintenance, and
development of visual scenes. We therefore coin them the ""dark matter"" of
vision. Just as our universe cannot be understood by merely studying observable
matter, we argue that vision cannot be understood without studying FPICU. We
demonstrate the power of this perspective to develop cognitive AI systems with
humanlike common sense by showing how to observe and apply FPICU with little
training data to solve a wide range of challenging tasks, including tool use,
planning, utility inference, and social learning. In summary, we argue that the
next generation of AI must embrace ""dark"" humanlike common sense for solving
novel tasks.
","[{'version': 'v1', 'created': 'Mon, 20 Apr 2020 04:07:28 GMT'}]",2020-04-21,"[['Zhu', 'Yixin', ''], ['Gao', 'Tao', ''], ['Fan', 'Lifeng', ''], ['Huang', 'Siyuan', ''], ['Edmonds', 'Mark', ''], ['Liu', 'Hangxin', ''], ['Gao', 'Feng', ''], ['Zhang', 'Chi', ''], ['Qi', 'Siyuan', ''], ['Wu', 'Ying Nian', ''], ['Tenenbaum', 'Joshua B.', ''], ['Zhu', 'Song-Chun', '']]","['Computer Vision', 'Artificial Intelligence', 'Causality', 'Intuitive Physics', 'Functionality', 'Perceived Intent', 'Utility']"
10051,1906.10238,Bin Zhao,Bin Zhao,"Mapping System Level Behaviors with Android APIs via System Call
  Dependence Graphs","14 pages, 6 figures","12th International Conference on Security and its Applications
  (CNSA 2019), Volume 9, Number 6, May 2019, pp. 139-152, 2019",10.5121/csit.2019.90612,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Due to Android's open source feature and low barriers to entry for
developers, millions of developers and third-party organizations have been
attracted into the Android ecosystem. However, over 90 percent of mobile
malware are found targeted on Android. Though Android provides multiple
security features and layers to protect user data and system resources, there
are still some over-privileged applications in Google Play Store or third-party
Android app stores at wild. In this paper, we proposed an approach to map
system level behavior and Android APIs, based on the observation that system
level behaviors cannot be avoided but sensitive Android APIs could be evaded.
To the best of our knowledge, our approach provides the first work to map
system level behavior and Android APIs through System Call Dependence Graphs.
The study also shows that our approach can effectively identify potential
permission abusing, with almost negligible performance impact.
","[{'version': 'v1', 'created': 'Mon, 24 Jun 2019 21:20:28 GMT'}]",2019-06-26,"[['Zhao', 'Bin', '']]","['Behavior Mapping', 'System Call Dependence Graph', 'Privilege Escalation', 'Android APIs']"
10052,2106.14191,Dominika Woszczyk,Dominika Woszczyk and Alvin Lee and Soteris Demetriou,"Open, Sesame! Introducing Access Control to Voice Services","6 pages, to appear in the 1st Workshop on Security and Privacy for
  Mobile AI (MAISP'21) - co-located with ACM MobiSys 2021",,10.1145/3469261.3469405,,cs.CR cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  Personal voice assistants (VAs) are shown to be vulnerable against
record-and-replay, and other acoustic attacks which allow an adversary to gain
unauthorized control of connected devices within a smart home. Existing
defenses either lack detection and management capabilities or are too
coarse-grained to enable flexible policies on par with other computing
interfaces. In this work, we present Sesame, a lightweight framework for edge
devices which is the first to enable fine-grained access control of smart-home
voice commands. Sesame combines three components: Automatic Speech Recognition,
Natural Language Understanding (NLU) and a Policy module. We implemented Sesame
on Android devices and demonstrate that our system can enforce security
policies for both Alexa and Google Home in real-time (362ms end-to-end
inference time), with a lightweight (<25MB) NLU model which exhibits minimal
accuracy loss compared to its non-compact equivalent.
","[{'version': 'v1', 'created': 'Sun, 27 Jun 2021 10:34:48 GMT'}]",2021-06-29,"[['Woszczyk', 'Dominika', ''], ['Lee', 'Alvin', ''], ['Demetriou', 'Soteris', '']]","['access control', 'voice services', 'alexa', 'google home', 'smart home']"
10053,1912.11160,Ilya Shenbin,"Ilya Shenbin, Anton Alekseev, Elena Tutubalina, Valentin Malykh,
  Sergey I. Nikolenko","RecVAE: a New Variational Autoencoder for Top-N Recommendations with
  Implicit Feedback","In The Thirteenth ACM International Conference on Web Search and Data
  Mining (WSDM '20), February 3-7, 2020, Houston, TX, USA. ACM, New York, NY,
  USA, 9 pages",,10.1145/3336191.3371831,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent research has shown the advantages of using autoencoders based on deep
neural networks for collaborative filtering. In particular, the recently
proposed Mult-VAE model, which used the multinomial likelihood variational
autoencoders, has shown excellent results for top-N recommendations. In this
work, we propose the Recommender VAE (RecVAE) model that originates from our
research on regularization techniques for variational autoencoders. RecVAE
introduces several novel ideas to improve Mult-VAE, including a novel composite
prior distribution for the latent codes, a new approach to setting the $\beta$
hyperparameter for the $\beta$-VAE framework, and a new approach to training
based on alternating updates. In experimental evaluation, we show that RecVAE
significantly outperforms previously proposed autoencoder-based models,
including Mult-VAE and RaCT, across classical collaborative filtering datasets,
and present a detailed ablation study to assess our new developments. Code and
models are available at https://github.com/ilya-shenbin/RecVAE.
","[{'version': 'v1', 'created': 'Tue, 24 Dec 2019 01:07:08 GMT'}]",2019-12-25,"[['Shenbin', 'Ilya', ''], ['Alekseev', 'Anton', ''], ['Tutubalina', 'Elena', ''], ['Malykh', 'Valentin', ''], ['Nikolenko', 'Sergey I.', '']]","['deep learning', 'collaborative filtering', 'variational autoencoders']"
10054,2106.11197,Binzong Geng,"Binzong Geng, Min Yang, Fajie Yuan, Shupeng Wang, Xiang Ao, Ruifeng Xu","Iterative Network Pruning with Uncertainty Regularization for Lifelong
  Sentiment Classification","Accepted by the 44th International ACM SIGIR Conference on Research
  and Development in Information Retrieval (SIGIR), 2021",,10.1145/3404835.3462902,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lifelong learning capabilities are crucial for sentiment classifiers to
process continuous streams of opinioned information on the Web. However,
performing lifelong learning is non-trivial for deep neural networks as
continually training of incrementally available information inevitably results
in catastrophic forgetting or interference. In this paper, we propose a novel
iterative network pruning with uncertainty regularization method for lifelong
sentiment classification (IPRLS), which leverages the principles of network
pruning and weight regularization. By performing network pruning with
uncertainty regularization in an iterative manner, IPRLS can adapta single BERT
model to work with continuously arriving data from multiple domains while
avoiding catastrophic forgetting and interference. Specifically, we leverage an
iterative pruning method to remove redundant parameters in large deep networks
so that the freed-up space can then be employed to learn new tasks, tackling
the catastrophic forgetting problem. Instead of keeping the old-tasks fixed
when learning new tasks, we also use an uncertainty regularization based on the
Bayesian online learning framework to constrain the update of old tasks weights
in BERT, which enables positive backward transfer, i.e. learning new tasks
improves performance on past tasks while protecting old knowledge from being
lost. In addition, we propose a task-specific low-dimensional residual function
in parallel to each layer of BERT, which makes IPRLS less prone to losing the
knowledge saved in the base BERT network when learning a new task. Extensive
experiments on 16 popular review corpora demonstrate that the proposed IPRLS
method sig-nificantly outperforms the strong baselines for lifelong sentiment
classification. For reproducibility, we submit the code and data
at:https://github.com/siat-nlp/IPRLS.
","[{'version': 'v1', 'created': 'Mon, 21 Jun 2021 15:34:13 GMT'}]",2021-06-22,"[['Geng', 'Binzong', ''], ['Yang', 'Min', ''], ['Yuan', 'Fajie', ''], ['Wang', 'Shupeng', ''], ['Ao', 'Xiang', ''], ['Xu', 'Ruifeng', '']]","['Lifelong learning', 'sentiment classification', 'network pruning', 'uncertainty regularization']"
10055,1403.0406,Akihisa Yamada,"Akihisa Yamada, Sarah Winkler, Nao Hirokawa, and Aart Middeldorp",AC-KBO Revisited,"31 pages, To appear in Theory and Practice of Logic Programming
  (TPLP) special issue for the 12th International Symposium on Functional and
  Logic Programming (FLOPS 2014)",Theory and Practice of Logic Programming 16 (2016) 163-188,10.1017/S1471068415000083,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Equational theories that contain axioms expressing associativity and
commutativity (AC) of certain operators are ubiquitous. Theorem proving methods
in such theories rely on well-founded orders that are compatible with the AC
axioms. In this paper we consider various definitions of AC-compatible
Knuth-Bendix orders. The orders of Steinbach and of Korovin and Voronkov are
revisited. The former is enhanced to a more powerful version, and we modify the
latter to amend its lack of monotonicity on non-ground terms. We further
present new complexity results. An extension reflecting the recent proposal of
subterm coefficients in standard Knuth-Bendix orders is also given. The various
orders are compared on problems in termination and completion.
","[{'version': 'v1', 'created': 'Mon, 3 Mar 2014 12:13:04 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Mar 2015 08:19:49 GMT'}]",2020-02-19,"[['Yamada', 'Akihisa', ''], ['Winkler', 'Sarah', ''], ['Hirokawa', 'Nao', ''], ['Middeldorp', 'Aart', '']]","['Term Rewriting', 'Termination', 'Associative-Commutative Theory', 'KnuthBendix Order']"
10056,2104.12192,Peng Liang,"Muhammad Waseem, Peng Liang, Mojtaba Shahin, Aakash Ahmad, Ali Rezaei
  Nasab","On the Nature of Issues in Five Open Source Microservices Systems: An
  Empirical Study","The 25th International Conference on Evaluation and Assessment in
  Software Engineering (EASE)",,10.1145/3463274.3463337,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Due to its enormous benefits, the research and industry communities have
shown an increasing interest in the Microservices Architecture (MSA) style over
the last few years. Despite this, there is a limited evidence-based and
thorough understanding of the types of issues (e.g., faults, errors, failures,
mistakes) faced by microservices system developers and causes that trigger the
issues. Such evidence-based understanding of issues and causes is vital for
long-term, impactful, and quality research and practice in the MSA style. To
that end, we conducted an empirical study on 1,345 issue discussions extracted
from five open source microservices systems hosted on GitHub. Our analysis led
to the first of its kind taxonomy of the types of issues in open source
microservices systems, informing that the problems originating from Technical
debt (321, 23.86%), Build (145, 10.78%), Security (137, 10.18%), and Service
execution and communication (119, 8.84%) are prominent. We identified that
""General programming errors"", ""Poor security management"", ""Invalid
configuration and communication"", and ""Legacy versions, compatibility and
dependency"" are the predominant causes for the leading four issue categories.
Study results streamline a taxonomy of issues, their mapping with underlying
causes, and present empirical findings that could facilitate research and
development on emerging and next-generation microservices systems.
","[{'version': 'v1', 'created': 'Sun, 25 Apr 2021 16:10:05 GMT'}, {'version': 'v2', 'created': 'Tue, 4 May 2021 16:56:29 GMT'}]",2021-05-05,"[['Waseem', 'Muhammad', ''], ['Liang', 'Peng', ''], ['Shahin', 'Mojtaba', ''], ['Ahmad', 'Aakash', ''], ['Nasab', 'Ali Rezaei', '']]","['Microservice', 'Open Source Software', 'Microservices Architecture', 'Issue', 'Empirical Study']"
10057,2206.06430,Hao Bai,Hao Bai,A Training Method For VideoPose3D With Ideology of Action Recognition,"Published by IEEE, on conference CONF-SPML",,10.1109/CONF-SPML54095.2021.00041,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Action recognition and pose estimation from videos are closely related to
understand human motions, but more literature focuses on how to solve pose
estimation tasks alone from action recognition. This research shows a faster
and more flexible training method for VideoPose3D which is based on action
recognition. This model is fed with the same type of action as the type that
will be estimated, and different types of actions can be trained separately.
Evidence has shown that, for common pose-estimation tasks, this model requires
a relatively small amount of data to carry out similar results with the
original research, and for action-oriented tasks, it outperforms the original
research by 4.5% with a limited receptive field size and training epoch on
Velocity Error of MPJPE. This model can handle both action-oriented and common
pose-estimation problems.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2022 19:25:27 GMT'}]",2022-06-15,"[['Bai', 'Hao', '']]","['computer vision', 'pose estimation', 'action']"
10058,2104.00099,Hudson Bruno,Hudson M. S. Bruno and Esther L. Colombini,LIFT-SLAM: a deep-learning feature-based monocular visual SLAM method,"30 pages, Published in Neurocomputing",,10.1016/j.neucom.2021.05.027,,cs.CV cs.AI cs.RO,http://creativecommons.org/licenses/by/4.0/,"  The Simultaneous Localization and Mapping (SLAM) problem addresses the
possibility of a robot to localize itself in an unknown environment and
simultaneously build a consistent map of this environment. Recently, cameras
have been successfully used to get the environment's features to perform SLAM,
which is referred to as visual SLAM (VSLAM). However, classical VSLAM
algorithms can be easily induced to fail when either the motion of the robot or
the environment is too challenging. Although new approaches based on Deep
Neural Networks (DNNs) have achieved promising results in VSLAM, they still are
unable to outperform traditional methods. To leverage the robustness of deep
learning to enhance traditional VSLAM systems, we propose to combine the
potential of deep learning-based feature descriptors with the traditional
geometry-based VSLAM, building a new VSLAM system called LIFT-SLAM. Experiments
conducted on KITTI and Euroc datasets show that deep learning can be used to
improve the performance of traditional VSLAM systems, as the proposed approach
was able to achieve results comparable to the state-of-the-art while being
robust to sensorial noise. We enhance the proposed VSLAM pipeline by avoiding
parameter tuning for specific datasets with an adaptive approach while
evaluating how transfer learning can affect the quality of the features
extracted.
","[{'version': 'v1', 'created': 'Wed, 31 Mar 2021 20:35:10 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Jun 2021 13:44:22 GMT'}]",2021-06-02,"[['Bruno', 'Hudson M. S.', ''], ['Colombini', 'Esther L.', '']]","['Mobile Robots', 'Visual SLAM', 'Deep Neural Networks', 'Learnedfeatures']"
10059,2111.00629,Avijit Shah,"Avijit Shah, Topojoy Biswas, Sathish Ramadoss, Deven Santosh Shah","Distantly Supervised Semantic Text Detection and Recognition for
  Broadcast Sports Videos Understanding","9 pages, 7 figures and 6 tables. To be published in the proceedings
  of ACM Multimedia 21, Industrial Track, held from October 20-24 in China",,10.1145/3474085.3481543,,cs.MM cs.CV cs.IR cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Comprehensive understanding of key players and actions in multiplayer sports
broadcast videos is a challenging problem. Unlike in news or finance videos,
sports videos have limited text. While both action recognition for multiplayer
sports and detection of players has seen robust research, understanding
contextual text in video frames still remains one of the most impactful avenues
of sports video understanding. In this work we study extremely accurate
semantic text detection and recognition in sports clocks, and challenges
therein. We observe unique properties of sports clocks, which makes it hard to
utilize general-purpose pre-trained detectors and recognizers, so that text can
be accurately understood to the degree of being used to align to external
knowledge. We propose a novel distant supervision technique to automatically
build sports clock datasets. Along with suitable data augmentations, combined
with any state-of-the-art text detection and recognition model architectures,
we extract extremely accurate semantic text. Finally, we share our
computational architecture pipeline to scale this system in industrial setting
and proposed a robust dataset for the same to validate our results.
","[{'version': 'v1', 'created': 'Sun, 31 Oct 2021 23:59:29 GMT'}]",2021-11-02,"[['Shah', 'Avijit', ''], ['Biswas', 'Topojoy', ''], ['Ramadoss', 'Sathish', ''], ['Shah', 'Deven Santosh', '']]","['datasets', 'neural networks', 'text detection', 'text recognition', 'eventdetection']"
10060,2104.14424,Ziliang Kang,"Ziliang Kang, Daniel A. Tortorelli, Kai A. James","Parallel Projection---An Improved Return Mapping Algorithm for Finite
  Element Modeling of Shape Memory Alloys",,"Computer Methods in Applied Mechanics and Engineering, 389 (2022),
  p.114364",10.1016/j.cma.2021.114364,,cs.CE cs.NA math.NA,http://creativecommons.org/licenses/by/4.0/,"  We present a novel finite element analysis of inelastic structures containing
Shape Memory Alloys (SMAs). Phenomenological constitutive models for SMAs lead
to material nonlinearities, that require substantial computational effort to
resolve. Finite element analysis methods, which rely on Gauss quadrature
integration schemes, must solve two sets of coupled differential equations: one
at the global level and the other at the local, i.e. Gauss point level. In
contrast to the conventional return mapping algorithm, which solves these two
sets of coupled differential equations separately using a nested Newton
procedure, we propose a scheme to solve the local and global differential
equations simultaneously. In the process we also derive closed-form expressions
used to update the internal/constitutive state variables, and unify the popular
closest-point and cutting plane methods with our formulas. Numerical testing
indicates that our method allows for larger thermomechanical loading steps and
provides increased computational efficiency, over the standard return mapping
algorithm.
","[{'version': 'v1', 'created': 'Thu, 29 Apr 2021 15:44:09 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Jan 2022 04:37:04 GMT'}]",2022-01-05,"[['Kang', 'Ziliang', ''], ['Tortorelli', 'Daniel A.', ''], ['James', 'Kai A.', '']]","['shape-memory alloys', 'computational inelasticity', 'finite element analysis', 'returnmapping algorithm', 'parallel projection algorithm']"
10061,cs/0603047,Simone Severini,Stefano Mancini and Simone Severini,The Quantum Separability Problem for Gaussian States,8 pages,"Electronic Notes in Theoretical Computer Science, Volume 169 ,
  March 2007, pp. 121-131",10.1016/j.entcs.2006.07.034,,cs.CC quant-ph,,"  Determining whether a quantum state is separable or entangled is a problem of
fundamental importance in quantum information science. This is a brief review
in which we consider the problem for states in infinite dimensional Hilbert
spaces. We show how the problem becomes tractable for a class of Gaussian
states.
","[{'version': 'v1', 'created': 'Sun, 12 Mar 2006 14:33:41 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Mar 2006 12:38:49 GMT'}]",2007-05-23,"[['Mancini', 'Stefano', ''], ['Severini', 'Simone', '']]","['Quantum Entanglement', 'Quantum Algorithms', 'Quantum Complexity']"
10062,1604.04006,P Balasubramanian,"P Balasubramanian, S Yamashita","Area/latency optimized early output asynchronous full adders and
  relative-timed ripple carry adders",,"SpringerPlus, vol. 5:440, pages 26, April 2016",10.1186/s40064-016-2074-z,,cs.AR,http://creativecommons.org/licenses/by/4.0/,"  This article presents two area/latency optimized gate level asynchronous full
adder designs which correspond to early output logic. The proposed full adders
are constructed using the delay-insensitive dual-rail code and adhere to the
four-phase return-to-zero handshaking. For an asynchronous ripple carry adder
(RCA) constructed using the proposed early output full adders, the
relative-timing assumption becomes necessary and the inherent advantages of the
relative-timed RCA are: (1) computation with valid inputs, i.e., forward
latency is data-dependent, and (2) computation with spacer inputs involves a
bare minimum constant reverse latency of just one full adder delay, thus
resulting in the optimal cycle time. With respect to different 32-bit RCA
implementations, and in comparison with the optimized strong-indication,
weak-indication, and early output full adder designs, one of the proposed early
output full adders achieves respective reductions in latency by 67.8, 12.3 and
6.1 %, while the other proposed early output full adder achieves corresponding
reductions in area by 32.6, 24.6 and 6.9 %, with practically no power penalty.
Further, the proposed early output full adders based asynchronous RCAs enable
minimum reductions in cycle time by 83.4, 15, and 8.8 % when considering
carry-propagation over the entire RCA width of 32-bits, and maximum reductions
in cycle time by 97.5, 27.4, and 22.4 % for the consideration of a typical
carry chain length of 4 full adder stages, when compared to the least of the
cycle time estimates of various strong-indication, weak-indication, and early
output asynchronous RCAs of similar size. All the asynchronous full adders and
RCAs were realized using standard cells in a semi-custom design fashion based
on a 32/28 nm CMOS process technology.
","[{'version': 'v1', 'created': 'Thu, 14 Apr 2016 01:01:41 GMT'}]",2016-04-15,"[['Balasubramanian', 'P', ''], ['Yamashita', 'S', '']]","['Asynchronous design', 'Full adder', 'Indication', 'Early output', 'Relative-timing', 'RCA', 'Standard cells']"
10063,2007.05848,Claudia Flores-Saviaga,"Claudia Flores-Saviaga, Saiph Savage","Fighting Disaster Misinformation in Latin America: The #19S Mexican
  Earthquake Case Study",,Springer - Personal and Ubiquitous Computing 2020,10.1007/s00779-020-01411-5,,cs.HC cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media platforms have been extensively used during natural disasters.
However, most prior work has lacked focus on studying their usage during
disasters in the Global South, where Internet access and social media
utilization differs from developing countries. In this paper, we study how
social media was used in the aftermath of the 7.1-magnitude earthquake that hit
Mexico on September 19 of 2017 (known as the #19S earthquake). We conduct an
analysis of how participants utilized social media platforms in the #19S
aftermath. Our research extends investigations of crisis informatics by: 1)
examining how participants used different social media platforms in the
aftermath of a natural disaster in a Global South country; 2) uncovering how
individuals developed their own processes to verify news reports using an
on-the-ground citizen approach; 3) revealing how people developed their own
mechanisms to deal with outdated information. For this, we surveyed 356 people.
Additionally, we analyze one month of activity from: Facebook (12,606 posts),
Twitter (2,909,109 tweets), Slack (28,782 messages), and GitHub (2,602
commits). This work offers a multi-platform view on user behavior to coordinate
relief efforts, reduce the spread of misinformation and deal with obsolete
information which seems to have been essential to help in the coordination and
efficiency of relief efforts. Finally, based on our findings, we make
recommendations for technology design to improve the effectiveness of social
media use during crisis response efforts and mitigate the spread of
misinformation across social media platforms.
","[{'version': 'v1', 'created': 'Sat, 11 Jul 2020 20:37:14 GMT'}]",2020-07-14,"[['Flores-Saviaga', 'Claudia', ''], ['Savage', 'Saiph', '']]","['Online Communities', 'Social Media Analysis · Crisis Informatics', '·Latin America']"
10064,2201.02280,Nora Horanyi,"Nora Horanyi, Kedi Xia, Kwang Moo Yi, Abhishake Kumar Bojja, Ales
  Leonardis, Hyung Jin Chang","Repurposing Existing Deep Networks for Caption and Aesthetic-Guided
  Image Cropping",,"Pattern Recognition, 2022, 108485, ISSN 0031-3203",10.1016/j.patcog.2021.108485,,cs.CV cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel optimization framework that crops a given image based on
user description and aesthetics. Unlike existing image cropping methods, where
one typically trains a deep network to regress to crop parameters or cropping
actions, we propose to directly optimize for the cropping parameters by
repurposing pre-trained networks on image captioning and aesthetic tasks,
without any fine-tuning, thereby avoiding training a separate network.
Specifically, we search for the best crop parameters that minimize a combined
loss of the initial objectives of these networks. To make the optimization
table, we propose three strategies: (i) multi-scale bilinear sampling, (ii)
annealing the scale of the crop region, therefore effectively reducing the
parameter space, (iii) aggregation of multiple optimization results. Through
various quantitative and qualitative evaluations, we show that our framework
can produce crops that are well-aligned to intended user descriptions and
aesthetically pleasing.
","[{'version': 'v1', 'created': 'Fri, 7 Jan 2022 00:23:40 GMT'}]",2022-01-10,"[['Horanyi', 'Nora', ''], ['Xia', 'Kedi', ''], ['Yi', 'Kwang Moo', ''], ['Bojja', 'Abhishake Kumar', ''], ['Leonardis', 'Ales', ''], ['Chang', 'Hyung Jin', '']]","['Image cropping', 'Aesthetics', 'Deep network']"
10065,2111.01975,Damiano Perri,"Damiano Perri, Marco Simonetti, Andrea Lombardi, Noelia Faginas-Lago,
  Osvaldo Gervasi",Binary classification of proteins by a Machine Learning approach,"International Conference on Computational Science and Its
  Applications, ICCSA 2020","LNCS, volume 12255, 2020",10.1007/978-3-030-58820-5_41,,cs.LG q-bio.BM,http://creativecommons.org/licenses/by/4.0/,"  In this work we present a system based on a Deep Learning approach, by using
a Convolutional Neural Network, capable of classifying protein chains of amino
acids based on the protein description contained in the Protein Data Bank. Each
protein is fully described in its chemical-physical-geometric properties in a
file in XML format. The aim of the work is to design a prototypical Deep
Learning machinery for the collection and management of a huge amount of data
and to validate it through its application to the classification of a sequences
of amino acids. We envisage applying the described approach to more general
classification problems in biomolecules, related to structural properties and
similarities.
","[{'version': 'v1', 'created': 'Wed, 3 Nov 2021 01:58:16 GMT'}]",2021-11-04,"[['Perri', 'Damiano', ''], ['Simonetti', 'Marco', ''], ['Lombardi', 'Andrea', ''], ['Faginas-Lago', 'Noelia', ''], ['Gervasi', 'Osvaldo', '']]","['Machine Learning', 'Computational Chemistry', 'Protein Data Bank']"
10066,2004.08349,George De Ath,George De Ath and Jonathan E. Fieldsend and Richard M. Everson,What do you Mean? The Role of the Mean Function in Bayesian Optimisation,"Genetic and Evolutionary Computation Conference Companion 2020 (GECCO
  '20 Companion). 9 pages (main paper) + 4 pages (supplementary material). Code
  avaliable at http://github.com/georgedeath/bomean",,10.1145/3377929.3398118,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bayesian optimisation is a popular approach for optimising expensive
black-box functions. The next location to be evaluated is selected via
maximising an acquisition function that balances exploitation and exploration.
Gaussian processes, the surrogate models of choice in Bayesian optimisation,
are often used with a constant prior mean function equal to the arithmetic mean
of the observed function values. We show that the rate of convergence can
depend sensitively on the choice of mean function. We empirically investigate 8
mean functions (constant functions equal to the arithmetic mean, minimum,
median and maximum of the observed function evaluations, linear, quadratic
polynomials, random forests and RBF networks), using 10 synthetic test problems
and two real-world problems, and using the Expected Improvement and Upper
Confidence Bound acquisition functions. We find that for design dimensions
$\ge5$ using a constant mean function equal to the worst observed quality value
is consistently the best choice on the synthetic problems considered. We argue
that this worst-observed-quality function promotes exploitation leading to more
rapid convergence. However, for the real-world tasks the more complex mean
functions capable of modelling the fitness landscape may be effective, although
there is no clearly optimum choice.
","[{'version': 'v1', 'created': 'Fri, 17 Apr 2020 17:10:17 GMT'}, {'version': 'v2', 'created': 'Fri, 8 May 2020 11:54:38 GMT'}]",2020-05-11,"[['De Ath', 'George', ''], ['Fieldsend', 'Jonathan E.', ''], ['Everson', 'Richard M.', '']]","['Bayesian optimisation', 'Surrogate modelling', 'Gaussian process', 'Meanfunction', 'acquisition function']"
10067,1807.10440,Ali Dehghantanha,"Omar M. K. Alhawi, James Baldwin, Ali Dehghantanha","Leveraging Machine Learning Techniques for Windows Ransomware Network
  Traffic Detection",11 Pages,,10.1007/978-3-319-73951-9_5,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Ransomware has become a significant global threat with the
ransomware-as-a-service model enabling easy availability and deployment, and
the potential for high revenues creating a viable criminal business model.
Individuals, private companies or public service providers e.g. healthcare or
utilities companies can all become victims of ransomware attacks and
consequently suffer severe disruption and financial loss. Although machine
learning algorithms are already being used to detect ransomware, variants are
being developed to specifically evade detection when using dynamic machine
learning techniques. In this paper, we introduce NetConverse, a machine
learning analysis of Windows ransomware network traffic to achieve a high,
consistent detection rate. Using a dataset created from conversation-based
network traffic features we achieved a true positive detection rate of 97.1%
using the Decision Tree (J48) classifier.
","[{'version': 'v1', 'created': 'Fri, 27 Jul 2018 05:32:53 GMT'}]",2018-07-30,"[['Alhawi', 'Omar M. K.', ''], ['Baldwin', 'James', ''], ['Dehghantanha', 'Ali', '']]","['Ransomware', 'Malware detection', 'Machine learning', 'Network traffic', 'Intrusion detection']"
10068,1806.06143,Radu Grigore,Radu Grigore and Stefan Kiefer,Selective Monitoring,CONCUR 2018,,10.4230/LIPIcs.CONCUR.2018.20,,cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study selective monitors for labelled Markov chains. Monitors observe the
outputs that are generated by a Markov chain during its run, with the goal of
identifying runs as correct or faulty. A monitor is selective if it skips
observations in order to reduce monitoring overhead. We are interested in
monitors that minimize the expected number of observations. We establish an
undecidability result for selectively monitoring general Markov chains. On the
other hand, we show for non-hidden Markov chains (where any output identifies
the state the Markov chain is in) that simple optimal monitors exist and can be
computed efficiently, based on DFA language equivalence. These monitors do not
depend on the precise transition probabilities in the Markov chain. We report
on experiments where we compute these monitors for several open-source Java
projects.
","[{'version': 'v1', 'created': 'Fri, 15 Jun 2018 22:08:38 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Jul 2018 10:48:57 GMT'}]",2018-07-03,"[['Grigore', 'Radu', ''], ['Kiefer', 'Stefan', '']]","['runtime monitoring', 'probabilistic systems', 'Markov chains', 'automata', 'language equivalence']"
10069,2111.08380,Shangzhe Di,"Shangzhe Di, Zeren Jiang, Si Liu, Zhaokai Wang, Leyan Zhu, Zexin He,
  Hongming Liu, Shuicheng Yan",Video Background Music Generation with Controllable Music Transformer,"Accepted to ACM Multimedia 2021. Project website at
  https://wzk1015.github.io/cmt/",,10.1145/3474085.3475195,,cs.MM cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  In this work, we address the task of video background music generation. Some
previous works achieve effective music generation but are unable to generate
melodious music tailored to a particular video, and none of them considers the
video-music rhythmic consistency. To generate the background music that matches
the given video, we first establish the rhythmic relations between video and
background music. In particular, we connect timing, motion speed, and motion
saliency from video with beat, simu-note density, and simu-note strength from
music, respectively. We then propose CMT, a Controllable Music Transformer that
enables local control of the aforementioned rhythmic features and global
control of the music genre and instruments. Objective and subjective
evaluations show that the generated background music has achieved satisfactory
compatibility with the input videos, and at the same time, impressive music
quality. Code and models are available at
https://github.com/wzk1015/video-bgm-generation.
","[{'version': 'v1', 'created': 'Tue, 16 Nov 2021 11:28:31 GMT'}]",2021-11-17,"[['Di', 'Shangzhe', ''], ['Jiang', 'Zeren', ''], ['Liu', 'Si', ''], ['Wang', 'Zhaokai', ''], ['Zhu', 'Leyan', ''], ['He', 'Zexin', ''], ['Liu', 'Hongming', ''], ['Yan', 'Shuicheng', '']]","['Video background music generation', 'Transformer', 'Music representation']"
10070,2211.06477,Ron Fulbright,Ron Fulbright,On Measuring Cognition and Cognitive Augmentation,"15 pages, 4 figures, multiple equations","Human Interface and the Management of Information. Information in
  Applications and Services 2018; Lecture Notes in Computer Science book series
  (LNISA,volume 10905)",10.1007/978-3-319-92046-7_41,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We are at the beginning of a new age in which artificial entities will
perform significant amounts of high-level cognitive processing rivaling and
even surpassing human thinking. The future belongs to those who can best
collaborate with artificial cognitive entities achieving a high degree of
cognitive augmenta-tion. However, we currently lack theoretically grounded
fundamental metrics able to describe human or artificial cognition much less
augmented and combined cognition. How do we measure thinking, cognition,
information, and knowledge in an implementation-independent way? How can we
tell how much thinking an artificial entity does and how much is done by a
human? How can we measure the combined and possible even emergent effect of
humans working together with intelligent artificial entities? These are some of
the challenges for research-ers in this field. We first define a cognitive
process as the transformation of data, information, knowledge, and wisdom. We
then review several existing and emerging information metrics based on entropy,
processing effort, quantum physics, emergent capacity, and human concept
learning. We then discuss how these fail to answer the above questions and
provide guidelines for future re-search.
","[{'version': 'v1', 'created': 'Fri, 11 Nov 2022 20:37:45 GMT'}]",2022-11-15,"[['Fulbright', 'Ron', '']]","['information theory', 'representational information', 'cognitive work', 'cognitive power', 'cognitive augmentation', 'cognitive systems', 'cognitive computing']"
10071,2203.08060,Dong Huang,"Xiaosha Cai, Dong Huang, Guang-Yu Zhang, Chang-Dong Wang","Seeking Commonness and Inconsistencies: A Jointly Smoothed Approach to
  Multi-view Subspace Clustering",To appear in Information Fusion,,10.1016/j.inffus.2022.10.020,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Multi-view subspace clustering aims to discover the hidden subspace
structures from multiple views for robust clustering, and has been attracting
considerable attention in recent years. Despite significant progress, most of
the previous multi-view subspace clustering algorithms are still faced with two
limitations. First, they usually focus on the consistency (or commonness) of
multiple views, yet often lack the ability to capture the cross-view
inconsistencies in subspace representations. Second, many of them overlook the
local structures of multiple views and cannot jointly leverage multiple local
structures to enhance the subspace representation learning. To address these
two limitations, in this paper, we propose a jointly smoothed multi-view
subspace clustering (JSMC) approach. Specifically, we simultaneously
incorporate the cross-view commonness and inconsistencies into the subspace
representation learning. The view-consensus grouping effect is presented to
jointly exploit the local structures of multiple views to regularize the
view-commonness representation, which is further associated with the low-rank
constraint via the nuclear norm to strengthen its cluster structure. Thus the
cross-view commonness and inconsistencies, the view-consensus grouping effect,
and the low-rank representation are seamlessly incorporated into a unified
objective function, upon which an alternating optimization algorithm is
performed to achieve a robust subspace representation for clustering.
Experimental results on a variety of real-world multi-view datasets confirm the
superiority of our approach. Code available:
https://github.com/huangdonghere/JSMC.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2022 16:52:15 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Oct 2022 17:38:17 GMT'}, {'version': 'v3', 'created': 'Mon, 31 Oct 2022 17:14:24 GMT'}]",2022-11-01,"[['Cai', 'Xiaosha', ''], ['Huang', 'Dong', ''], ['Zhang', 'Guang-Yu', ''], ['Wang', 'Chang-Dong', '']]","['Data clustering', 'Multi-view clustering', 'Multi-view subspaceclustering', 'View-consensus grouping effect', 'Smooth regularization']"
10072,2108.03555,Cheng Jiang,"Cheng Jiang, Abhishek Bhattacharya, Joseph Linzey, Rushikesh S. Joshi,
  Sung Jik Cha, Sudharsan Srinivasan, Daniel Alber, Akhil Kondepudi, Esteban
  Urias, Balaji Pandian, Wajd Al-Holou, Steve Sullivan, B. Gregory Thompson,
  Jason Heth, Chris Freudiger, Siri Khalsa, Donato Pacione, John G. Golfinos,
  Sandra Camelo-Piragua, Daniel A. Orringer, Honglak Lee, Todd Hollon","Rapid Automated Analysis of Skull Base Tumor Specimens Using
  Intraoperative Optical Imaging and Artificial Intelligence",Published as journal article,"Neurosurgery 90 (6), 758-767, 2022",10.1227/neu.0000000000001929,,cs.CV cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Accurate diagnosis of skull base tumors is essential for
providing personalized surgical treatment strategies. Intraoperative diagnosis
can be challenging due to tumor diversity and lack of intraoperative pathology
resources.
  Objective: To develop an independent and parallel intraoperative pathology
workflow that can provide rapid and accurate skull base tumor diagnoses using
label-free optical imaging and artificial intelligence.
  Method: We used a fiber laser-based, label-free, non-consumptive,
high-resolution microscopy method ($<$ 60 sec per 1 $\times$ 1 mm$^\text{2}$),
called stimulated Raman histology (SRH), to image a consecutive, multicenter
cohort of skull base tumor patients. SRH images were then used to train a
convolutional neural network (CNN) model using three representation learning
strategies: cross-entropy, self-supervised contrastive learning, and supervised
contrastive learning. Our trained CNN models were tested on a held-out,
multicenter SRH dataset.
  Results: SRH was able to image the diagnostic features of both benign and
malignant skull base tumors. Of the three representation learning strategies,
supervised contrastive learning most effectively learned the distinctive and
diagnostic SRH image features for each of the skull base tumor types. In our
multicenter testing set, cross-entropy achieved an overall diagnostic accuracy
of 91.5%, self-supervised contrastive learning 83.9%, and supervised
contrastive learning 96.6%. Our trained model was able to identify tumor-normal
margins and detect regions of microscopic tumor infiltration in whole-slide SRH
images.
  Conclusion: SRH with trained artificial intelligence models can provide rapid
and accurate intraoperative analysis of skull base tumor specimens to inform
surgical decision-making.
","[{'version': 'v1', 'created': 'Sun, 8 Aug 2021 02:49:29 GMT'}, {'version': 'v2', 'created': 'Sun, 19 Jun 2022 06:10:55 GMT'}]",2022-06-22,"[['Jiang', 'Cheng', ''], ['Bhattacharya', 'Abhishek', ''], ['Linzey', 'Joseph', ''], ['Joshi', 'Rushikesh S.', ''], ['Cha', 'Sung Jik', ''], ['Srinivasan', 'Sudharsan', ''], ['Alber', 'Daniel', ''], ['Kondepudi', 'Akhil', ''], ['Urias', 'Esteban', ''], ['Pandian', 'Balaji', ''], ['Al-Holou', 'Wajd', ''], ['Sullivan', 'Steve', ''], ['Thompson', 'B. Gregory', ''], ['Heth', 'Jason', ''], ['Freudiger', 'Chris', ''], ['Khalsa', 'Siri', ''], ['Pacione', 'Donato', ''], ['Golfinos', 'John G.', ''], ['Camelo-Piragua', 'Sandra', ''], ['Orringer', 'Daniel A.', ''], ['Lee', 'Honglak', ''], ['Hollon', 'Todd', '']]","['Skull base tumors', 'contrastive learning', 'artificial intelligence', 'stimulated Raman histology', 'automateddiagnosis', 'tumor margin delineation']"
10073,2006.11465,Junpei Zhong,Junpei Zhong and Angelo Cangelosi and Stefan Wermter,"Towards a self-organizing pre-symbolic neural model representing
  sensorimotor primitives",,"Frontiers in behavioral neuroscience, 8, 22 (2014)",10.3389/fnbeh.2014.00022,,cs.NE cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The acquisition of symbolic and linguistic representations of sensorimotor
behavior is a cognitive process performed by an agent when it is executing
and/or observing own and others' actions. According to Piaget's theory of
cognitive development, these representations develop during the sensorimotor
stage and the pre-operational stage. We propose a model that relates the
conceptualization of the higher-level information from visual stimuli to the
development of ventral/dorsal visual streams. This model employs neural network
architecture incorporating a predictive sensory module based on an RNNPB
(Recurrent Neural Network with Parametric Biases) and a horizontal product
model. We exemplify this model through a robot passively observing an object to
learn its features and movements. During the learning process of observing
sensorimotor primitives, i.e. observing a set of trajectories of arm movements
and its oriented object features, the pre-symbolic representation is
self-organized in the parametric units. These representational units act as
bifurcation parameters, guiding the robot to recognize and predict various
learned sensorimotor primitives. The pre-symbolic representation also accounts
for the learning of sensorimotor primitives in a latent learning context.
","[{'version': 'v1', 'created': 'Sat, 20 Jun 2020 01:58:28 GMT'}, {'version': 'v2', 'created': 'Sun, 12 Jul 2020 04:30:56 GMT'}]",2020-07-14,"[['Zhong', 'Junpei', ''], ['Cangelosi', 'Angelo', ''], ['Wermter', 'Stefan', '']]","['Pre-symbolic Communication', 'Sensorimotor Integration', 'Recurrent Neural Networks', 'ParametricBiases', 'Horizontal Product']"
10074,2206.12678,"G\""unce Keziban Orman","G\""unce Keziban Orman, Nadir T\""ure, Selim Balcisoy, Hasan Alp Boz",Finding Proper Time Intervals for Dynamic Network Extraction,"19 pages, 12 figures",J. Stat. Mech. (2021) 033414,10.1088/1742-5468/abed45,,cs.SI math.PR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Extracting a proper dynamic network for modelling a time-dependent complex
system is an important issue. Building a correct model is related to finding
out critical time points where a system exhibits considerable change. In this
work, we propose to measure network similarity to detect proper time intervals.
We develop three similarity metrics, node, link, and neighborhood similarities,
for any consecutive snapshots of a dynamic network. Rather than a label or a
user-defined threshold, we use statistically expected values of proposed
similarities under a null-model to state whether the system changes critically.
We experimented on two different data sets with different temporal dynamics:
The Wi-Fi access points logs of a university campus and Enron emails. Results
show that, first, proposed similarities reflect similar signal trends with
network topological properties with less noisy signals, and their scores are
scale invariant. Second, proposed similarities generate better signals than
adjacency correlation with optimal noise and diversity. Third, using
statistically expected values allows us to find different time intervals for a
system, leading to the extraction of non-redundant snapshots for dynamic
network modelling.
","[{'version': 'v1', 'created': 'Sat, 25 Jun 2022 15:58:58 GMT'}]",2022-06-28,"[['Orman', 'Günce Keziban', ''], ['Türe', 'Nadir', ''], ['Balcisoy', 'Selim', ''], ['Boz', 'Hasan Alp', '']]","['Dynamic Networks', 'Network Extraction', 'Window Size', 'Proper TimeInterval', 'Network Similarity']"
10075,2105.00227,Cory Merkel,"Micah Gorsline, James Smith, Cory Merkel",On the Adversarial Robustness of Quantized Neural Networks,,,10.1145/3453688.3461755,,cs.LG cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reducing the size of neural network models is a critical step in moving AI
from a cloud-centric to an edge-centric (i.e. on-device) compute paradigm. This
shift from cloud to edge is motivated by a number of factors including reduced
latency, improved security, and higher flexibility of AI algorithms across
several application domains (e.g. transportation, healthcare, defense, etc.).
However, it is currently unclear how model compression techniques may affect
the robustness of AI algorithms against adversarial attacks. This paper
explores the effect of quantization, one of the most common compression
techniques, on the adversarial robustness of neural networks. Specifically, we
investigate and model the accuracy of quantized neural networks on
adversarially-perturbed images. Results indicate that for simple gradient-based
attacks, quantization can either improve or degrade adversarial robustness
depending on the attack strength.
","[{'version': 'v1', 'created': 'Sat, 1 May 2021 11:46:35 GMT'}]",2022-01-24,"[['Gorsline', 'Micah', ''], ['Smith', 'James', ''], ['Merkel', 'Cory', '']]","['Adversarial machine learning', 'neural networks', 'quantization']"
10076,2004.12504,Raz Saremi,"Mostaan Lotfalian Saremi, Razieh Saremi, Denisse Martinez-Mejorado","How Much Should I Pay? An Empirical Analysis on Monetary Prize in
  TopCoder","8 pages, 5 figures, 3 tables, HIC International 2020","C. Stephanidis and M. Antona (Eds.): HCII 2020, CCIS 1226, pp.
  202-208, 2020",10.1007/978-3-030-50732-9,,cs.SE cs.HC cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is reported that task monetary prize is one of the most important
motivating factors to attract crowd workers. While using expert-based methods
to price Crowdsourcing tasks is a common practice, the challenge of validating
the associated prices across different tasks is a constant issue. To address
this issue, three different classifications of multiple linear regression,
logistic regression, and K-nearest neighbor were compared to find the most
accurate predicted price, using a dataset from the TopCoder website. The result
of comparing chosen algorithms showed that the logistics regression model will
provide the highest accuracy of 90% to predict the associated price to tasks
and KNN ranked the second with an accuracy of 64% for K = 7. Also, applying PCA
wouldn't lead to any better prediction accuracy as data components are not
correlated.
","[{'version': 'v1', 'created': 'Sun, 26 Apr 2020 23:26:32 GMT'}]",2020-07-29,"[['Saremi', 'Mostaan Lotfalian', ''], ['Saremi', 'Razieh', ''], ['Martinez-Mejorado', 'Denisse', '']]","['Monetary Prize', 'Crowdsourced Software Development', 'Crowd Software Worker', 'TopCoder']"
10077,2008.06249,Martin Zaefferer,Martin Zaefferer and Frederik Rehbach,Continuous Optimization Benchmarks by Simulation,,,10.1007/978-3-030-58112-1_19,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Benchmark experiments are required to test, compare, tune, and understand
optimization algorithms. Ideally, benchmark problems closely reflect real-world
problem behavior. Yet, real-world problems are not always readily available for
benchmarking. For example, evaluation costs may be too high, or resources are
unavailable (e.g., software or equipment). As a solution, data from previous
evaluations can be used to train surrogate models which are then used for
benchmarking. The goal is to generate test functions on which the performance
of an algorithm is similar to that on the real-world objective function.
However, predictions from data-driven models tend to be smoother than the
ground-truth from which the training data is derived. This is especially
problematic when the training data becomes sparse. The resulting benchmarks may
not reflect the landscape features of the ground-truth, are too easy, and may
lead to biased conclusions. To resolve this, we use simulation of Gaussian
processes instead of estimation (or prediction). This retains the covariance
properties estimated during model training. While previous research suggested a
decomposition-based approach for a small-scale, discrete problem, we show that
the spectral simulation method enables simulation for continuous optimization
problems. In a set of experiments with an artificial ground-truth, we
demonstrate that this yields more accurate benchmarks than simply predicting
with the Gaussian process model.
","[{'version': 'v1', 'created': 'Fri, 14 Aug 2020 08:50:57 GMT'}]",2020-08-17,"[['Zaefferer', 'Martin', ''], ['Rehbach', 'Frederik', '']]","['Simulation', 'Benchmarking', 'Test Function', 'Continuous Optimization', 'Gaussian Process Regression', 'Kriging']"
10078,2204.02104,Farah Ferdaus,"Farah Ferdaus, B. M. S. Bahar Talukder, and Md Tauhidur Rahman",Watermarked ReRAM: A Technique to Prevent Counterfeit Memory Chips,,,10.1145/3526241.3530341,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Electronic counterfeiting is a longstanding problem with adverse long-term
effects for many sectors, remaining on the rise. This article presents a novel
low-cost technique to embed watermarking in devices with resistive-RAM (ReRAM)
by manipulating its analog physical characteristics through switching
(set/reset) operation to prevent counterfeiting. We develop a system-level
framework to control memory cells' physical properties for imprinting
irreversible watermarks into commercial ReRAMs that will be retrieved by
sensing the changes in cells' physical properties. Experimental results show
that our proposed ReRAM watermarking is robust against temperature variation
and acceptably fast with ~0.6bit/min of imprinting and ~15.625bits/s of
retrieval rates.
","[{'version': 'v1', 'created': 'Tue, 5 Apr 2022 10:53:42 GMT'}]",2022-04-06,"[['Ferdaus', 'Farah', ''], ['Talukder', 'B. M. S. Bahar', ''], ['Rahman', 'Md Tauhidur', '']]","['Watermarking', 'ReRAM', 'Counterfeiting', 'Supply-chain Security']"
10079,2108.00871,Kotaro Kikuchi,"Kotaro Kikuchi, Edgar Simo-Serra, Mayu Otani, Kota Yamaguchi",Constrained Graphic Layout Generation via Latent Optimization,Accepted by ACM Multimedia 2021,,10.1145/3474085.3475497,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is common in graphic design humans visually arrange various elements
according to their design intent and semantics. For example, a title text
almost always appears on top of other elements in a document. In this work, we
generate graphic layouts that can flexibly incorporate such design semantics,
either specified implicitly or explicitly by a user. We optimize using the
latent space of an off-the-shelf layout generation model, allowing our approach
to be complementary to and used with existing layout generation models. Our
approach builds on a generative layout model based on a Transformer
architecture, and formulates the layout generation as a constrained
optimization problem where design constraints are used for element alignment,
overlap avoidance, or any other user-specified relationship. We show in the
experiments that our approach is capable of generating realistic layouts in
both constrained and unconstrained generation tasks with a single model. The
code is available at https://github.com/ktrk115/const_layout .
","[{'version': 'v1', 'created': 'Mon, 2 Aug 2021 13:04:11 GMT'}]",2021-08-03,"[['Kikuchi', 'Kotaro', ''], ['Simo-Serra', 'Edgar', ''], ['Otani', 'Mayu', ''], ['Yamaguchi', 'Kota', '']]","['layout generation', 'generative adversarial network', 'constrained optimization', 'latent space exploration']"
10080,2010.01202,John Sigman PhD.,"John B. Sigman, Gregory P. Spell, Kevin J Liang, and Lawrence Carin","Background Adaptive Faster R-CNN for Semi-Supervised Convolutional
  Object Detection of Threats in X-Ray Images",,"Proc. SPIE 11404, Anomaly Detection and Imaging with X-Rays (ADIX)
  V, 1140404 (26 May 2020)",10.1117/12.2558542,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Recently, progress has been made in the supervised training of Convolutional
Object Detectors (e.g. Faster R-CNN) for threat recognition in carry-on luggage
using X-ray images. This is part of the Transportation Security
Administration's (TSA's) mission to protect air travelers in the United States.
While more training data with threats may reliably improve performance for this
class of deep algorithm, it is expensive to stage in realistic contexts. By
contrast, data from the real world can be collected quickly with minimal cost.
In this paper, we present a semi-supervised approach for threat recognition
which we call Background Adaptive Faster R-CNN. This approach is a training
method for two-stage object detectors which uses Domain Adaptation methods from
the field of deep learning. The data sources described earlier make two
""domains"": a hand-collected data domain of images with threats, and a
real-world domain of images assumed without threats. Two domain discriminators,
one for discriminating object proposals and one for image features, are
adversarially trained to prevent encoding domain-specific information. Without
this penalty a Convolutional Neural Network (CNN) can learn to identify domains
based on superficial characteristics, and minimize a supervised loss function
without improving its ability to recognize objects. For the hand-collected
data, only object proposals and image features from backgrounds are used. The
losses for these domain-adaptive discriminators are added to the Faster R-CNN
losses of images from both domains. This can reduce threat detection false
alarm rates by matching the statistics of extracted features from
hand-collected backgrounds to real world data. Performance improvements are
demonstrated on two independently-collected datasets of labeled threats.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2020 21:05:13 GMT'}]",2020-10-06,"[['Sigman', 'John B.', ''], ['Spell', 'Gregory P.', ''], ['Liang', 'Kevin J', ''], ['Carin', 'Lawrence', '']]","['Deep Learning', 'Threat Recognition', 'Security Screening', 'Convolutional Neural Networks', 'MachineLearning', 'Computer Vision', 'Object Detection']"
10081,2209.03230,Thanh Le-Cong Le-Cong Thanh,"Thanh Le-Cong, Hong Jin Kang, Truong Giang Nguyen, Stefanus Agus
  Haryono, David Lo, Xuan-Bach D. Le, Huynh Quyet Thang",AutoPruner: Transformer-Based Call Graph Pruning,"Accepted to ESEC/FSE 2022, Research Track",,10.1145/3540250.3549175,,cs.SE cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Constructing a static call graph requires trade-offs between soundness and
precision. Program analysis techniques for constructing call graphs are
unfortunately usually imprecise. To address this problem, researchers have
recently proposed call graph pruning empowered by machine learning to
post-process call graphs constructed by static analysis. A machine learning
model is built to capture information from the call graph by extracting
structural features for use in a random forest classifier. It then removes
edges that are predicted to be false positives. Despite the improvements shown
by machine learning models, they are still limited as they do not consider the
source code semantics and thus often are not able to effectively distinguish
true and false positives. In this paper, we present a novel call graph pruning
technique, AutoPruner, for eliminating false positives in call graphs via both
statistical semantic and structural analysis. Given a call graph constructed by
traditional static analysis tools, AutoPruner takes a Transformer-based
approach to capture the semantic relationships between the caller and callee
functions associated with each edge in the call graph. To do so, AutoPruner
fine-tunes a model of code that was pre-trained on a large corpus to represent
source code based on descriptions of its semantics. Next, the model is used to
extract semantic features from the functions related to each edge in the call
graph. AutoPruner uses these semantic features together with the structural
features extracted from the call graph to classify each edge via a feed-forward
neural network. Our empirical evaluation on a benchmark dataset of real-world
programs shows that AutoPruner outperforms the state-of-the-art baselines,
improving on F-measure by up to 13% in identifying false-positive edges in a
static call graph.
","[{'version': 'v1', 'created': 'Wed, 7 Sep 2022 15:35:28 GMT'}]",2022-09-08,"[['Le-Cong', 'Thanh', ''], ['Kang', 'Hong Jin', ''], ['Nguyen', 'Truong Giang', ''], ['Haryono', 'Stefanus Agus', ''], ['Lo', 'David', ''], ['Le', 'Xuan-Bach D.', ''], ['Thang', 'Huynh Quyet', '']]","['Call Graph Pruning', 'Static Analysis', 'Pretrained Language Model', 'Transformer']"
10082,1909.06662,"Christian G\""ottel","Christian G\""ottel, Pascal Felber and Valerio Schiavoni","iperfTZ: Understanding Network Bottlenecks for TrustZone-based Trusted
  Applications","European Commission Project: LEGaTO - Low Energy Toolset for
  Heterogeneous Computing (EC-H2020-780681)","In: M. Ghaffari, M. Nesterenko, S. Tixeuil, S. Tucci, Y. Yamauchi
  (eds) SSS 2019. Lecture Notes in Computer Science, vol 11914. Springer, Cham",10.1007/978-3-030-34992-9_15,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The growing availability of hardware-based trusted execution environments
(TEEs) in commodity processors has recently advanced support (i.e., design,
implementation and deployment frameworks) for network-based secure services.
Examples of such TEEs include ARM TrustZone or Intel SGX, largely available in
embedded, mobile and server-grade processors. TEEs shield services from
compromised hosts, malicious users or powerful attackers. TEE-enabled devices
are largely being deployed on the edge of the network, paving the way for
large-scale deployments of trusted applications. These applications allow
processing and disseminating sensitive data without having to trust cloud
providers. However, uncovering network performance limitations of such trusted
applications is difficult and currently lacking, despite the interest and
reliance by developers and system deployers. iperfTZ is an open-source tool to
uncover network performance bottlenecks rooted at the design and implementation
of trusted applications for ARM TrustZone and underlying runtime systems. Our
evaluation based on micro-benchmarks shows current trade-offs for trusted
applications, both from a network as well as an energy perspective; an often
overlooked yet relevant aspect for edge-based deployments.
","[{'version': 'v1', 'created': 'Sat, 14 Sep 2019 19:38:43 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Dec 2019 15:53:03 GMT'}]",2019-12-24,"[['Göttel', 'Christian', ''], ['Felber', 'Pascal', ''], ['Schiavoni', 'Valerio', '']]","['network', 'performance', 'bottleneck', 'measurement', 'ARM TrustZone', 'OP-TEE']"
10083,1907.04098,Simon Duque Anton,"Simon D. Duque Anton, Daniel Fraunholz, and Hans Dieter Schotten","Using Temporal and Topological Features for Intrusion Detection in
  Operational Networks",Preprint of a work accepted but not published yet at the ARES 2019,,10.1145/3339252.3341476,,cs.CR cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Until two decades ago, industrial networks were deemed secure due to physical
separation from public networks. An abundance of successful attacks proved that
assumption wrong. Intrusion detection solutions for industrial application need
to meet certain requirements that differ from home- and office-environments,
such as working without feedback to the process and compatibility with legacy
systems. Industrial systems are commonly used for several decades, updates are
often difficult and expensive. Furthermore, most industrial protocols do not
have inherent authentication or encryption mechanisms, allowing for easy
lateral movement of an intruder once the perimeter is breached. In this work,
an algorithm for motif discovery in time series, Matrix Profiles, is used to
detect outliers in the timing behaviour of an industrial process. This process
was monitored in an experimental environment, containing ground truth labels
after attacks were performed. Furthermore, the graph representations of a
different industrial data set that has been emulated are used to detect
malicious activities. These activities can be derived from anomalous
communication patterns, represented as edges in the graph. Finally, an
integration concept for both methods is proposed.
","[{'version': 'v1', 'created': 'Tue, 9 Jul 2019 11:46:55 GMT'}]",2019-07-10,"[['Anton', 'Simon D. Duque', ''], ['Fraunholz', 'Daniel', ''], ['Schotten', 'Hans Dieter', '']]","['Machine Learning', 'Graph', 'IT-Security', 'Industrial Process', 'TimeSeries']"
10084,2003.04755,Jailton Coelho,"Jailton Coelho and Marco Tulio Valente and Luciano Milen and Luciana
  L. Silva","Is this GitHub Project Maintained? Measuring the Level of Maintenance
  Activity of Open-Source Projects",arXiv admin note: substantial text overlap with arXiv:1809.04041,,10.1016/j.infsof.2020.106274,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: GitHub hosts an impressive number of high-quality OSS projects.
However, selecting ""the right tool for the job"" is a challenging task, because
we do not have precise information about those high-quality projects.
Objective: In this paper, we propose a data-driven approach to measure the
level of maintenance activity of GitHub projects. Our goal is to alert users
about the risks of using unmaintained projects and possibly motivate other
developers to assume the maintenance of such projects. Method: We train machine
learning models to define a metric to express the level of maintenance activity
of GitHub projects. Next, we analyze the historical evolution of 2,927 active
projects in the time frame of one year. Results: From 2,927 active projects,
16% become unmaintained in the interval of one year. We also found that
Objective-C projects tend to have lower maintenance activity than projects
implemented in other languages. Finally, software tools---such as compilers and
editors---have the highest maintenance activity over time. Conclusions: A
metric about the level of maintenance activity of GitHub projects can help
developers to select open source projects.
","[{'version': 'v1', 'created': 'Mon, 9 Mar 2020 14:40:18 GMT'}]",2020-03-11,"[['Coelho', 'Jailton', ''], ['Valente', 'Marco Tulio', ''], ['Milen', 'Luciano', ''], ['Silva', 'Luciana L.', '']]","['Unmaintained Projects', 'GitHub', 'Open Source Software']"
10085,2205.04275,Luyu Gao,"Luyu Gao, Jamie Callan",Long Document Re-ranking with Modular Re-ranker,SIGIR 22,,10.1145/3477495.3531860,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Long document re-ranking has been a challenging problem for neural re-rankers
based on deep language models like BERT. Early work breaks the documents into
short passage-like chunks. These chunks are independently mapped to scalar
scores or latent vectors, which are then pooled into a final relevance score.
These encode-and-pool methods however inevitably introduce an information
bottleneck: the low dimension representations. In this paper, we propose
instead to model full query-to-document interaction, leveraging the attention
operation and modular Transformer re-ranker framework. First, document chunks
are encoded independently with an encoder module. An interaction module then
encodes the query and performs joint attention from the query to all document
chunk representations. We demonstrate that the model can use this new degree of
freedom to aggregate important information from the entire document. Our
experiments show that this design produces effective re-ranking on two
classical IR collections Robust04 and ClueWeb09, and a large-scale supervised
collection MS-MARCO document ranking.
","[{'version': 'v1', 'created': 'Mon, 9 May 2022 13:44:02 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Jun 2022 06:58:44 GMT'}]",2022-06-07,"[['Gao', 'Luyu', ''], ['Callan', 'Jamie', '']]","['Neural IR', 'Document Re-ranking', 'Deep Learning']"
10086,2111.01616,Qiang Liu,Qiang Liu and Nakjung Choi and Tao Han,OnSlicing: Online End-to-End Network Slicing with Reinforcement Learning,This paper is accepted by CoNEXT 2021,,10.1145/3485983.3494850,,cs.NI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network slicing allows mobile network operators to virtualize infrastructures
and provide customized slices for supporting various use cases with
heterogeneous requirements. Online deep reinforcement learning (DRL) has shown
promising potential in solving network problems and eliminating the
simulation-to-reality discrepancy. Optimizing cross-domain resources with
online DRL is, however, challenging, as the random exploration of DRL violates
the service level agreement (SLA) of slices and resource constraints of
infrastructures. In this paper, we propose OnSlicing, an online end-to-end
network slicing system, to achieve minimal resource usage while satisfying
slices' SLA. OnSlicing allows individualized learning for each slice and
maintains its SLA by using a novel constraint-aware policy update method and
proactive baseline switching mechanism. OnSlicing complies with resource
constraints of infrastructures by using a unique design of action modification
in slices and parameter coordination in infrastructures. OnSlicing further
mitigates the poor performance of online learning during the early learning
stage by offline imitating a rule-based solution. Besides, we design four new
domain managers to enable dynamic resource configuration in radio access,
transport, core, and edge networks, respectively, at a timescale of subseconds.
We implement OnSlicing on an end-to-end slicing testbed designed based on
OpenAirInterface with both 4G LTE and 5G NR, OpenDayLight SDN platform, and
OpenAir-CN core network. The experimental results show that OnSlicing achieves
61.3% usage reduction as compared to the rule-based solution and maintains
nearly zero violation (0.06%) throughout the online learning phase. As online
learning is converged, OnSlicing reduces 12.5% usage without any violations as
compared to the state-of-the-art online DRL solution.
","[{'version': 'v1', 'created': 'Tue, 2 Nov 2021 14:25:58 GMT'}]",2021-11-03,"[['Liu', 'Qiang', ''], ['Choi', 'Nakjung', ''], ['Han', 'Tao', '']]","['End-to-End Network Slicing', 'Resource Orchestration', 'Online DeepReinforcement Learning']"
10087,2104.14909,Giovanni Iacca Prof.,"Kateryna Konotopska, Giovanni Iacca",Graph-Aware Evolutionary Algorithms for Influence Maximization,"To be published in the proceedings of ACM Genetic and Evolutionary
  Computation Conference (GECCO) Companion 2021",,10.1145/3449726.3463138,,cs.NE cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Social networks represent nowadays in many contexts the main source of
information transmission and the way opinions and actions are influenced. For
instance, generic advertisements are way less powerful than suggestions from
our contacts. However, this process hugely depends on the influence of people
who disseminate these suggestions. Therefore modern marketing often involves
paying some targeted users, or influencers, for advertising products or ideas.
Finding the set of nodes in a social network that lead to the highest
information spread -- the so-called Influence Maximization (IM) problem -- is
therefore a pressing question and as such it has recently attracted a great
research interest. In particular, several approaches based on Evolutionary
Algorithms (EAs) have been proposed, although they are known to scale poorly
with the graph size. In this paper, we tackle this limitation in two ways.
Firstly, we use approximate fitness functions to speed up the EA. Secondly, we
include into the EA various graph-aware mechanisms, such as smart
initialization, custom mutations and node filtering, to facilitate the EA
convergence. Our experiments show that the proposed modifications allow to
obtain a relevant runtime gain and also improve, in some cases, the spread
results.
","[{'version': 'v1', 'created': 'Fri, 30 Apr 2021 11:15:39 GMT'}]",2021-05-03,"[['Konotopska', 'Kateryna', ''], ['Iacca', 'Giovanni', '']]","['Social Network', 'Influence Maximization', 'Evolutionary Algorithm', 'Graph Theory', 'Combinatorial Optimization']"
10088,2112.15338,Trieu Hai Nguyen,"Trieu Hai Nguyen, Thi-Kim-Ngoan Pham, Thi-Hong-Minh Bui,
  Thanh-Quynh-Chau Nguyen","Clustering Vietnamese Conversations From Facebook Page To Build Training
  Dataset For Chatbot","Preprint submitted to JJCIT (Revised version, December 10, 2021)","Jordanian Journal of Computers and Information Technology (JJCIT)
  8-01 (2022), 1-17",10.5455/jjcit.71-1632557439,,cs.CL,http://creativecommons.org/licenses/by-sa/4.0/,"  The biggest challenge of building chatbots is training data. The required
data must be realistic and large enough to train chatbots. We create a tool to
get actual training data from Facebook messenger of a Facebook page. After text
preprocessing steps, the newly obtained dataset generates FVnC and Sample
dataset. We use the Retraining of BERT for Vietnamese (PhoBERT) to extract
features of our text data. K-Means and DBSCAN clustering algorithms are used
for clustering tasks based on output embeddings from PhoBERT$_{base}$. We apply
V-measure score and Silhouette score to evaluate the performance of clustering
algorithms. We also demonstrate the efficiency of PhoBERT compared to other
models in feature extraction on the Sample dataset and wiki dataset. A
GridSearch algorithm that combines both clustering evaluations is also proposed
to find optimal parameters. Thanks to clustering such a number of
conversations, we save a lot of time and effort to build data and storylines
for training chatbot.
","[{'version': 'v1', 'created': 'Fri, 31 Dec 2021 07:56:12 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Jan 2022 01:59:49 GMT'}]",2022-03-03,"[['Nguyen', 'Trieu Hai', ''], ['Pham', 'Thi-Kim-Ngoan', ''], ['Bui', 'Thi-Hong-Minh', ''], ['Nguyen', 'Thanh-Quynh-Chau', '']]","['BERT', 'Clustering', 'Language models', 'Feature Extraction', 'Word Embeddings']"
10089,2001.06386,Mikhail Hushchyn,Mikhail Hushchyn and Andrey Ustyuzhanin,"Generalization of Change-Point Detection in Time Series Data Based on
  Direct Density Ratio Estimation",,,10.1016/j.jocs.2021.101385,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  The goal of the change-point detection is to discover changes of time series
distribution. One of the state of the art approaches of the change-point
detection are based on direct density ratio estimation. In this work we show
how existing algorithms can be generalized using various binary classification
and regression models. In particular, we show that the Gradient Boosting over
Decision Trees and Neural Networks can be used for this purpose. The algorithms
are tested on several synthetic and real-world datasets. The results show that
the proposed methods outperform classical RuLSIF algorithm. Discussion of cases
where the proposed algorithms have advantages over existing methods are also
provided.
","[{'version': 'v1', 'created': 'Fri, 17 Jan 2020 15:45:38 GMT'}]",2022-06-22,"[['Hushchyn', 'Mikhail', ''], ['Ustyuzhanin', 'Andrey', '']]","['time series', 'change-point detection', 'machine learning', 'neuralnetworks', 'density ratio']"
10090,2101.08146,Panagiotis Kourtesis P.K.,"Panagiotis Kourtesis, Simona Collina, Leonidas A.A. Doumas, and Sarah
  E. MacPherson","Validation of the Virtual Reality Neuroscience Questionnaire: Maximum
  Duration of Immersive Virtual Reality Sessions Without the Presence of
  Pertinent Adverse Symptomatology",Published in Frontier in Human Neuroscience,"2019.Frontiers in human neuroscience, 13, p.417",10.3389/fnhum.2019.00417,,cs.HC cs.CY cs.MM,http://creativecommons.org/licenses/by/4.0/,"  Research suggests that the duration of a VR session modulates the presence
and intensity of VRISE, but there are no suggestions regarding the appropriate
maximum duration of VR sessions. The implementation of high-end VR HMDs in
conjunction with ergonomic VR software seems to mitigate the presence of VRISE
substantially. However, a brief tool does not currently exist to appraise and
report both the quality of software features and VRISE intensity
quantitatively. The VRNQ was developed to assess the quality of VR software in
terms of user experience, game mechanics, in-game assistance, and VRISE. Forty
participants aged between 28 and 43 years were recruited (18 gamers and 22
non-gamers) for the study. They participated in 3 different VR sessions until
they felt weary or discomfort and subsequently filled in the VRNQ. Our results
demonstrated that VRNQ is a valid tool for assessing VR software as it has good
convergent, discriminant, and construct validity. The maximum duration of VR
sessions should be between 55-70 minutes when the VR software meets or exceeds
the parsimonious cut-offs of the VRNQ and the users are familiarized with the
VR system. Also. the gaming experience does not seem to affect how long VR
sessions should last. Also, while the quality of VR software substantially
modulates the maximum duration of VR sessions, age and education do not.
Finally, deeper immersion, better quality of graphics and sound, and more
helpful in-game instructions and prompts were found to reduce VRISE intensity.
The VRNQ facilitates the brief assessment and reporting of the quality of VR
software features and/or the intensity of VRISE, while its minimum and
parsimonious cut-offs may appraise the suitability of VR software. The findings
of this study contribute to the establishment of rigorous VR methods that are
crucial for the viability of immersive VR as a research and clinical tool.
","[{'version': 'v1', 'created': 'Wed, 20 Jan 2021 14:10:44 GMT'}]",2021-01-21,"[['Kourtesis', 'Panagiotis', ''], ['Collina', 'Simona', ''], ['Doumas', 'Leonidas A. A.', ''], ['MacPherson', 'Sarah E.', '']]","['Virtual Reality1', 'VRISE2', 'VR Sickness3', 'Cybersickness4', 'Neuroscience5', 'Neuropsychology6', 'Psychology7', 'Motion Sickness8']"
10091,1810.00769,Suthee Ruangwises,"Suthee Ruangwises, Toshiya Itoh",AND Protocols Using Only Uniform Shuffles,This paper has appeared at CSR 2019,,10.1007/978-3-030-19955-5_30,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Secure multi-party computation using a deck of playing cards has been a
subject of research since the ""five-card trick"" introduced by den Boer in 1989.
One of the main problems in card-based cryptography is to design
committed-format protocols to compute a Boolean AND operation subject to
different runtime and shuffle restrictions by using as few cards as possible.
In this paper, we introduce two AND protocols that use only uniform shuffles.
The first one requires four cards and is a restart-free Las Vegas protocol with
finite expected runtime. The second one requires five cards and always
terminates in finite time.
","[{'version': 'v1', 'created': 'Mon, 1 Oct 2018 15:46:43 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Jul 2019 09:29:19 GMT'}]",2019-07-31,"[['Ruangwises', 'Suthee', ''], ['Itoh', 'Toshiya', '']]","['card-based cryptography', 'secure multi-party computation', 'uniformshuffle', 'AND protocol']"
10092,2004.06559,Eneko Osaba,"Eneko Osaba, Aritz D. Martinez, Akemi Galvez, Andres Iglesias, Javier
  Del Ser","dMFEA-II: An Adaptive Multifactorial Evolutionary Algorithm for
  Permutation-based Discrete Optimization Problems","7 pages, 0 figures, Camera-ready version of the paper accepted for
  presentation in The Genetic and Evolutionary Computation Conference 2020
  (GECCO 2020)",,10.1145/3377929.3398084,,cs.AI cs.DM cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The emerging research paradigm coined as multitasking optimization aims to
solve multiple optimization tasks concurrently by means of a single search
process. For this purpose, the exploitation of complementarities among the
tasks to be solved is crucial, which is often achieved via the transfer of
genetic material, thereby forging the Transfer Optimization field. In this
context, Evolutionary Multitasking addresses this paradigm by resorting to
concepts from Evolutionary Computation. Within this specific branch, approaches
such as the Multifactorial Evolutionary Algorithm (MFEA) has lately gained a
notable momentum when tackling multiple optimization tasks. This work
contributes to this trend by proposing the first adaptation of the recently
introduced Multifactorial Evolutionary Algorithm II (MFEA-II) to
permutation-based discrete optimization environments. For modeling this
adaptation, some concepts cannot be directly applied to discrete search spaces,
such as parent-centric interactions. In this paper we entirely reformulate such
concepts, making them suited to deal with permutation-based search spaces
without loosing the inherent benefits of MFEA-II. The performance of the
proposed solver has been assessed over 5 different multitasking setups,
composed by 8 datasets of the well-known Traveling Salesman (TSP) and
Capacitated Vehicle Routing Problems (CVRP). The obtained results and their
comparison to those by the discrete version of the MFEA confirm the good
performance of the developed dMFEA-II, and concur with the insights drawn in
previous studies for continuous optimization.
","[{'version': 'v1', 'created': 'Tue, 14 Apr 2020 14:42:47 GMT'}, {'version': 'v2', 'created': 'Mon, 4 May 2020 14:28:56 GMT'}, {'version': 'v3', 'created': 'Wed, 13 May 2020 15:35:08 GMT'}]",2020-05-14,"[['Osaba', 'Eneko', ''], ['Martinez', 'Aritz D.', ''], ['Galvez', 'Akemi', ''], ['Iglesias', 'Andres', ''], ['Del Ser', 'Javier', '']]","['Transfer Optimization', 'Evolutionary Multitasking', 'MultifactorialOptimization', 'Discrete Optimization', 'Traveling Salesman Problem']"
10093,2107.02398,Shang Li,"Shang Li, Guixuan Zhang, Zhengxiong Luo, Jie Liu, Zhi Zeng, Shuwu
  Zhang",From General to Specific: Online Updating for Blind Super-Resolution,Accepted by Pattern Recognition,"Pattern Recognition, Volume 127, July 2022, 108613",10.1016/j.patcog.2022.108613,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Most deep learning-based super-resolution (SR) methods are not
image-specific: 1) They are trained on samples synthesized by predefined
degradations (e.g. bicubic downsampling), regardless of the domain gap between
training and testing data. 2) During testing, they super-resolve all images by
the same set of model weights, ignoring the degradation variety. As a result,
most previous methods may suffer a performance drop when the degradations of
test images are unknown and various (i.e. the case of blind SR). To address
these issues, we propose an online SR (ONSR) method. It does not rely on
predefined degradations and allows the model weights to be updated according to
the degradation of the test image. Specifically, ONSR consists of two branches,
namely internal branch (IB) and external branch (EB). IB could learn the
specific degradation of the given test LR image, and EB could learn to super
resolve images degraded by the learned degradation. In this way, ONSR could
customize a specific model for each test image, and thus get more robust to
various degradations. Extensive experiments on both synthesized and real-world
images show that ONSR can generate more visually favorable SR results and
achieve state-of-the-art performance in blind SR.
","[{'version': 'v1', 'created': 'Tue, 6 Jul 2021 05:25:16 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Mar 2022 06:58:02 GMT'}]",2022-03-16,"[['Li', 'Shang', ''], ['Zhang', 'Guixuan', ''], ['Luo', 'Zhengxiong', ''], ['Liu', 'Jie', ''], ['Zeng', 'Zhi', ''], ['Zhang', 'Shuwu', '']]","['blind super-resolution', 'online updating', 'internal learning', 'external learning']"
10094,2109.14470,Ishaan Desai,"Gerasimos Chourdakis, Kyle Davis, Benjamin Rodenberg, Miriam Schulte,
  Fr\'ed\'eric Simonis, Benjamin Uekermann, Georg Abrams, Hans-Joachim
  Bungartz, Lucia Cheung Yau, Ishaan Desai, Konrad Eder, Richard Hertrich,
  Florian Lindner, Alexander Rusch, Dmytro Sashko, David Schneider, Amin
  Totounferoush, Dominik Volland, Peter Vollmer, Oguz Ziya Koseomur",preCICE v2: A Sustainable and User-Friendly Coupling Library,"added missing author, added author contributions, changed license",,10.12688/openreseurope.14445.1,,cs.MS,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  preCICE is a free/open-source coupling library. It enables creating
partitioned multi-physics simulations by gluing together separate software
packages. This paper summarizes the development efforts in preCICE of the past
five years. During this time span, we have turned the software from a working
prototype -- sophisticated numerical coupling methods and scalability on ten
thousands of compute cores -- to a sustainable and user-friendly software
project with a steadily-growing community. Today, we know through forum
discussions, conferences, workshops, and publications of more than 100 research
groups using preCICE. We cover the fundamentals of the software alongside a
performance and accuracy analysis of different data mapping methods.
Afterwards, we describe ready-to-use integration with widely-used external
simulation software packages, tests and continuous integration from unit to
system level, and community building measures, drawing an overview of the
current preCICE ecosystem.
","[{'version': 'v1', 'created': 'Wed, 29 Sep 2021 15:01:34 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Sep 2021 09:42:19 GMT'}]",2022-05-25,"[['Chourdakis', 'Gerasimos', ''], ['Davis', 'Kyle', ''], ['Rodenberg', 'Benjamin', ''], ['Schulte', 'Miriam', ''], ['Simonis', 'Frédéric', ''], ['Uekermann', 'Benjamin', ''], ['Abrams', 'Georg', ''], ['Bungartz', 'Hans-Joachim', ''], ['Yau', 'Lucia Cheung', ''], ['Desai', 'Ishaan', ''], ['Eder', 'Konrad', ''], ['Hertrich', 'Richard', ''], ['Lindner', 'Florian', ''], ['Rusch', 'Alexander', ''], ['Sashko', 'Dmytro', ''], ['Schneider', 'David', ''], ['Totounferoush', 'Amin', ''], ['Volland', 'Dominik', ''], ['Vollmer', 'Peter', ''], ['Koseomur', 'Oguz Ziya', '']]","['multiphysics', 'multiphysics coupling', 'co-simulation', 'fluid-structure interaction', 'conjugate heat transfer', 'computer simulation']"
10095,1907.01241,Nicolas Grelier,"Nicolas Grelier, Saeed Gh. Ilchi, Tillmann Miltzow, Shakhar
  Smorodinsky",On the VC-dimension of half-spaces with respect to convex sets,,"Discrete Mathematics & Theoretical Computer Science, vol. 23, no.
  3, Combinatorics (August 19, 2021) dmtcs:8376",10.46298/dmtcs.6631,,cs.CG cs.DM cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A family S of convex sets in the plane defines a hypergraph H = (S, E) as
follows. Every subfamily S' of S defines a hyperedge of H if and only if there
exists a halfspace h that fully contains S' , and no other set of S is fully
contained in h. In this case, we say that h realizes S'. We say a set S is
shattered, if all its subsets are realized. The VC-dimension of a hypergraph H
is the size of the largest shattered set. We show that the VC-dimension for
pairwise disjoint convex sets in the plane is bounded by 3, and this is tight.
In contrast, we show the VC-dimension of convex sets in the plane (not
necessarily disjoint) is unbounded. We provide a quadratic lower bound in the
number of pairs of intersecting sets in a shattered family of convex sets in
the plane. We also show that the VC-dimension is unbounded for pairwise
disjoint convex sets in R^d , for d > 2. We focus on, possibly intersecting,
segments in the plane and determine that the VC-dimension is always at most 5.
And this is tight, as we construct a set of five segments that can be
shattered. We give two exemplary applications. One for a geometric set cover
problem and one for a range-query data structure problem, to motivate our
findings.
","[{'version': 'v1', 'created': 'Tue, 2 Jul 2019 08:53:20 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Jul 2020 15:27:34 GMT'}, {'version': 'v3', 'created': 'Wed, 27 Jan 2021 13:50:48 GMT'}, {'version': 'v4', 'created': 'Fri, 25 Jun 2021 15:18:03 GMT'}, {'version': 'v5', 'created': 'Wed, 18 Aug 2021 11:39:10 GMT'}]",2021-10-04,"[['Grelier', 'Nicolas', ''], ['Ilchi', 'Saeed Gh.', ''], ['Miltzow', 'Tillmann', ''], ['Smorodinsky', 'Shakhar', '']]","['VC-dimension', 'epsilon nets', 'convex sets', 'halfplanes']"
10096,2112.09438,Anastasia-Maria Leventi-Peetz,"A.-M. Leventi-Peetz, J\""org-Volker Peetz, Martina Rohde",ML Supported Predictions for SAT Solvers Performance,Presented at the Future Technologies Conference (FTC) 2019,"Arai K., Bhatia R., Kapoor S. (eds) Proceedings of the Future
  Technologies Conference (FTC) 2019. FTC 2019. Advances in Intelligent Systems
  and Computing, vol 1069. Springer, Cham",10.1007/978-3-030-32520-6_7,,cs.AI cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to classify the indeterministic termination behavior of the open
source SAT solver CryptoMiniSat in multi-threading mode while processing hard
to solve boolean satisfiability problem instances, internal solver runtime
parameters have been collected and analyzed. A subset of these parameters has
been selected and employed as features vector to successfully create a machine
learning model for the binary classification of the solver's termination
behavior with any single new solving run of a not yet solved instance. The
model can be used for the early estimation of a solving attempt as belonging or
not belonging to the class of candidates with good chances for a fast
termination. In this context a combination of active profiles of runtime
characteristics appear to mirror the influence of the solver's momentary
heuristics on the immediate quality of the solver's resolution process. Because
runtime parameters of already the first two solving iterations are enough to
forecast termination of the attempt with good success scores, the results of
the present work deliver a promising basis which can be further developed in
order to enrich CryptoMiniSat or generally any modern SAT solver with AI
abilities.
","[{'version': 'v1', 'created': 'Fri, 17 Dec 2021 11:17:29 GMT'}]",2021-12-20,"[['Leventi-Peetz', 'A. -M.', ''], ['Peetz', 'Jörg-Volker', ''], ['Rohde', 'Martina', '']]","['AI', 'artificial intelligence', 'ML', 'machine learning', 'SAT solver', 'security']"
10097,2007.04678,Timothy Callemein,"Timothy Callemein, Kristof Van Beeck, and Toon Goedem\'e","How low can you go? Privacy-preserving people detection with an
  omni-directional camera",,,10.5220/0007573206300637,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we use a ceiling-mounted omni-directional camera to detect
people in a room. This can be used as a sensor to measure the occupancy of
meeting rooms and count the amount of flex-desk working spaces available. If
these devices can be integrated in an embedded low-power sensor, it would form
an ideal extension of automated room reservation systems in office
environments. The main challenge we target here is ensuring the privacy of the
people filmed. The approach we propose is going to extremely low image
resolutions, such that it is impossible to recognise people or read potentially
confidential documents. Therefore, we retrained a single-shot low-resolution
person detection network with automatically generated ground truth. In this
paper, we prove the functionality of this approach and explore how low we can
go in resolution, to determine the optimal trade-off between recognition
accuracy and privacy preservation. Because of the low resolution, the result is
a lightweight network that can potentially be deployed on embedded hardware.
Such embedded implementation enables the development of a decentralised smart
camera which only outputs the required meta-data (i.e. the number of persons in
the meeting room).
","[{'version': 'v1', 'created': 'Thu, 9 Jul 2020 10:10:23 GMT'}]",2020-07-10,"[['Callemein', 'Timothy', ''], ['Van Beeck', 'Kristof', ''], ['Goedemé', 'Toon', '']]","['Privacy sensitive', 'omni-directional camera', 'low resolution', 'knowledge distillation']"
10098,2009.04827,Liam Jordon,"Liam Jordon, Philippe Moser",A Normal Sequence Compressed by PPM$^*$ but not by Lempel-Ziv 78,,,10.1007/978-3-030-67731-2_28,,cs.DS cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we compare the difference in performance of two of the
Prediction by Partial Matching (PPM) family of compressors (PPM$^*$ and the
original Bounded PPM algorithm) and the Lempel-Ziv 78 (LZ) algorithm. We
construct an infinite binary sequence whose worst-case compression ratio for
PPM$^*$ is $0$, while Bounded PPM's and LZ's best-case compression ratios are
at least $1/2$ and $1$ respectively. This sequence is an enumeration of all
binary strings in order of length, i.e. all strings of length $1$ followed by
all strings of length $2$ and so on. It is therefore normal, and is built using
repetitions of de Bruijn strings of increasing order
","[{'version': 'v1', 'created': 'Thu, 10 Sep 2020 12:56:00 GMT'}]",2021-01-21,"[['Jordon', 'Liam', ''], ['Moser', 'Philippe', '']]","['compression algorithms', 'Lempel-Ziv algorithm', 'Prediction by Partial Matchingalgorithms', 'normality']"
10099,1905.08108,Xiang Wang,"Xiang Wang, Xiangnan He, Meng Wang, Fuli Feng, Tat-Seng Chua",Neural Graph Collaborative Filtering,"SIGIR 2019; the latest version of NGCF paper, which is distinct from
  the version published in ACM Digital Library",,10.1145/3331184.3331267,,cs.IR cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning vector representations (aka. embeddings) of users and items lies at
the core of modern recommender systems. Ranging from early matrix factorization
to recently emerged deep learning based methods, existing efforts typically
obtain a user's (or an item's) embedding by mapping from pre-existing features
that describe the user (or the item), such as ID and attributes. We argue that
an inherent drawback of such methods is that, the collaborative signal, which
is latent in user-item interactions, is not encoded in the embedding process.
As such, the resultant embeddings may not be sufficient to capture the
collaborative filtering effect.
  In this work, we propose to integrate the user-item interactions -- more
specifically the bipartite graph structure -- into the embedding process. We
develop a new recommendation framework Neural Graph Collaborative Filtering
(NGCF), which exploits the user-item graph structure by propagating embeddings
on it. This leads to the expressive modeling of high-order connectivity in
user-item graph, effectively injecting the collaborative signal into the
embedding process in an explicit manner. We conduct extensive experiments on
three public benchmarks, demonstrating significant improvements over several
state-of-the-art models like HOP-Rec and Collaborative Memory Network. Further
analysis verifies the importance of embedding propagation for learning better
user and item representations, justifying the rationality and effectiveness of
NGCF. Codes are available at
https://github.com/xiangwang1223/neural_graph_collaborative_filtering.
","[{'version': 'v1', 'created': 'Mon, 20 May 2019 13:41:16 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Jul 2020 15:24:44 GMT'}]",2020-07-06,"[['Wang', 'Xiang', ''], ['He', 'Xiangnan', ''], ['Wang', 'Meng', ''], ['Feng', 'Fuli', ''], ['Chua', 'Tat-Seng', '']]","['Collaborative Filtering', 'Recommendation', 'High-order Connectivity', 'Embedding Propagation', 'Graph Neural Network']"
10100,2211.14779,Zhengjie Huang,"Zhengjie Huang, Zhenguang Liu, Jianhai Chen, Qinming He, Shuang Wu,
  Lei Zhu, Meng Wang","Who is Gambling? Finding Cryptocurrency Gamblers Using Multi-modal
  Retrieval Methods",,"International Journal of Multimedia Information Retrieval (2022):
  1-13",10.1007/s13735-022-00264-3,,cs.CR cs.LG q-fin.ST,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the popularity of cryptocurrencies and the remarkable development of
blockchain technology, decentralized applications emerged as a revolutionary
force for the Internet. Meanwhile, decentralized applications have also
attracted intense attention from the online gambling community, with more and
more decentralized gambling platforms created through the help of smart
contracts. Compared with conventional gambling platforms, decentralized
gambling have transparent rules and a low participation threshold, attracting a
substantial number of gamblers. In order to discover gambling behaviors and
identify the contracts and addresses involved in gambling, we propose a tool
termed ETHGamDet. The tool is able to automatically detect the smart contracts
and addresses involved in gambling by scrutinizing the smart contract code and
address transaction records. Interestingly, we present a novel LightGBM model
with memory components, which possesses the ability to learn from its own
misclassifications. As a side contribution, we construct and release a
large-scale gambling dataset at
https://github.com/AwesomeHuang/Bitcoin-Gambling-Dataset to facilitate future
research in this field. Empirically, ETHGamDet achieves a F1-score of 0.72 and
0.89 in address classification and contract classification respectively, and
offers novel and interesting insights.
","[{'version': 'v1', 'created': 'Sun, 27 Nov 2022 10:07:13 GMT'}]",2022-11-29,"[['Huang', 'Zhengjie', ''], ['Liu', 'Zhenguang', ''], ['Chen', 'Jianhai', ''], ['He', 'Qinming', ''], ['Wu', 'Shuang', ''], ['Zhu', 'Lei', ''], ['Wang', 'Meng', '']]","['Gambling detection', 'Multi-modal', 'Blockchain', 'Smart contract', 'Ethereum']"
10101,2209.01841,Chengzhi Zhang,Chenglei Qin and Chengzhi Zhang,"Which structure of academic articles do referees pay more attention to?:
  perspective of peer review and full-text of academic articles",,,10.1108/AJIM-05-2022-0244,,cs.CL cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Purpose
  The purpose of this paper is to explore which structures of academic articles
referees would pay more attention to, what specific content referees focus on,
and whether the distribution of PRC is related to the citations.
Design/methodology/approach
  Firstly, utilizing the feature words of section title and hierarchical
attention network model (HAN) to identify the academic article structures.
Secondly, analyzing the distribution of PRC in different structures according
to the position information extracted by rules in PRC. Thirdly, analyzing the
distribution of feature words of PRC extracted by the Chi-square test and
TF-IDF in different structures. Finally, four correlation analysis methods are
used to analyze whether the distribution of PRC in different structures is
correlated to the citations. Findings
  The count of PRC distributed in Materials and Methods and Results section is
significantly more than that in the structure of Introduction and Discussion,
indicating that referees pay more attention to the Material and Methods and
Results. The distribution of feature words of PRC in different structures is
obviously different, which can reflect the content of referees' concern. There
is no correlation between the distribution of PRC in different structures and
the citations. Research limitations/implications
  Due to the differences in the way referees write peer review reports, the
rules used to extract position information cannot cover all PRC.
Originality/value
  The paper finds a pattern in the distribution of PRC in different academic
article structures proving the long-term empirical understanding. It also
provides insight into academic article writing: researchers should ensure the
scientificity of methods and the reliability of results when writing academic
article to obtain a high degree of recognition from referees.
","[{'version': 'v1', 'created': 'Mon, 5 Sep 2022 08:56:43 GMT'}]",2022-09-07,"[['Qin', 'Chenglei', ''], ['Zhang', 'Chengzhi', '']]","['Peer review', 'Distribution of peer review comments', 'IMRaD', 'Citations Paper type Research paper']"
10102,2105.13036,Andrea Fronzetti Colladon PhD,"P. Gloor, A. Fronzetti Colladon, J. M. de Oliveira, P. Rovelli","Put your money where your mouth is: Using deep learning to identify
  consumer tribes from word usage",,"International Journal of Information Management 51, 101924 (2020)",10.1016/j.ijinfomgt.2019.03.011,,cs.CL cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Internet and social media offer firms novel ways of managing their marketing
strategy and gain competitive advantage. The groups of users expressing
themselves on the Internet about a particular topic, product, or brand are
frequently called a virtual tribe or E-tribe. However, there are no automatic
tools for identifying and studying the characteristics of these virtual tribes.
Towards this aim, this paper presents Tribefinder, a system to reveal Twitter
users' tribal affiliations, by analyzing their tweets and language use. To show
the potential of this instrument, we provide an example considering three
specific tribal macro-categories: alternative realities, lifestyle, and
recreation. In addition, we discuss the different characteristics of each
identified tribe, in terms of use of language and social interaction metrics.
Tribefinder illustrates the importance of adopting a new lens for studying
virtual tribes, which is crucial for firms to properly design their marketing
strategy, and for scholars to extend prior marketing research.
","[{'version': 'v1', 'created': 'Thu, 27 May 2021 10:06:56 GMT'}]",2021-05-28,"[['Gloor', 'P.', ''], ['Colladon', 'A. Fronzetti', ''], ['de Oliveira', 'J. M.', ''], ['Rovelli', 'P.', '']]","['Virtual tribes', 'marketing', 'Twitter', 'text mining', 'social network analysis']"
10103,2012.12831,Stasys Jukna,Stasys Jukna and Hannes Seiwert,Approximation Limitations of Pure Dynamic Programming,,SIAM J. on Computing 49:1 (2020) 170-207,10.1137/18M1196339,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove the first, even super-polynomial, lower bounds on the size of
tropical (min,+) and (max,+) circuits approximating given optimization
problems. Many classical dynamic programming (DP) algorithms for optimization
problems are pure in that they only use the basic min, max, + operations in
their recursion equations. Tropical circuits constitute a rigorous mathematical
model for this class of algorithms. An algorithmic consequence of our lower
bounds for tropical circuits is that the approximation powers of pure DP
algorithms and greedy algorithms are incomparable. That pure DP algorithms can
hardly beat greedy in approximation, is long known. New in this consequence is
that also the converse holds.
","[{'version': 'v1', 'created': 'Wed, 23 Dec 2020 17:50:02 GMT'}]",2020-12-24,"[['Jukna', 'Stasys', ''], ['Seiwert', 'Hannes', '']]","['dynamic programming', 'greedy algorithm', 'approximation', 'lower bounds']"
10104,2203.16107,Marcos Faundez-Zanuy,"Marcos Faundez-Zanuy, Xavier Font Aragones, Jiri Mekyska",Preliminary experiments on thermal emissivity adjustment for face images,"8 pages, published in: Esposito, A., Faundez-Zanuy, M., Morabito, F.,
  Pasero, E. (eds) Progresses in Artificial Intelligence and Neural Systems.
  Smart Innovation, Systems and Technologies, vol 184. Springer, Singapore","in Esposito, A., Faundez-Zanuy, M., Morabito, F., Pasero, E. (eds)
  Progresses in Artificial Intelligence and Neural Systems. Smart Innovation,
  Systems and Technologies, vol 184. Springer, Singapore 2021",10.1007/978-981-15-5093-5_15,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this paper we summarize several applications based on thermal imaging. We
emphasize the importance of emissivity adjustment for a proper temperature
measurement. A new set of face images acquired at different emissivity values
with steps of 0.01 is also presented and will be distributed for free for
research purposes. Among the utilities, we can mention: a) the possibility to
apply corrections once an image is acquired with a wrong emissivity value and
it is not possible to acquire a new one; b) privacy protection in thermal
images, which can be obtained with a low emissivity factor, which is still
suitable for several applications, but hides the identity of a user; c) image
processing for improving temperature detection in scenes containing objects of
different emissivity.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2022 07:28:27 GMT'}]",2022-03-31,"[['Faundez-Zanuy', 'Marcos', ''], ['Aragones', 'Xavier Font', ''], ['Mekyska', 'Jiri', '']]","['thermal imaging', 'emissivity', 'image processing']"
10105,2007.00752,Ana Nora Evans,"Ana Nora Evans, Bradford Campbell, Mary Lou Soffa",Is Rust Used Safely by Software Developers?,,,10.1145/3377811.3380413,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rust, an emerging programming language with explosive growth, provides a
robust type system that enables programmers to write memory-safe and data-race
free code. To allow access to a machine's hardware and to support low-level
performance optimizations, a second language, Unsafe Rust, is embedded in Rust.
It contains support for operations that are difficult to statically check, such
as C-style pointers for access to arbitrary memory locations and mutable global
variables. When a program uses these features, the compiler is unable to
statically guarantee the safety properties Rust promotes. In this work, we
perform a large-scale empirical study to explore how software developers are
using Unsafe Rust in real-world Rust libraries and applications. Our results
indicate that software engineers use the keyword unsafe in less than 30% of
Rust libraries, but more than half cannot be entirely statically checked by the
Rust compiler because of Unsafe Rust hidden somewhere in a library's call
chain. We conclude that although the use of the keyword unsafe is limited, the
propagation of unsafeness offers a challenge to the claim of Rust as a
memory-safe language. Furthermore, we recommend changes to the Rust compiler
and to the central Rust repository's interface to help Rust software developers
be aware of when their Rust code is unsafe.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2020 21:00:25 GMT'}]",2020-07-03,"[['Evans', 'Ana Nora', ''], ['Campbell', 'Bradford', ''], ['Soffa', 'Mary Lou', '']]","['are green', 'bolded while the safe', 'unsafe conditions are italicized']"
10106,1909.01519,Mahammad Humayoo,Mahammad Humayoo and Xueqi Cheng,"Parameter Estimation with the Ordered $\ell_{2}$ Regularization via an
  Alternating Direction Method of Multipliers",,Applied Sciences (ISSN 2076-3417; CODEN: ASPCC7),10.3390/app9204291,,cs.LG math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Regularization is a popular technique in machine learning for model
estimation and avoiding overfitting. Prior studies have found that modern
ordered regularization can be more effective in handling highly correlated,
high-dimensional data than traditional regularization. The reason stems from
the fact that the ordered regularization can reject irrelevant variables and
yield an accurate estimation of the parameters. How to scale up the ordered
regularization problems when facing the large-scale training data remains an
unanswered question. This paper explores the problem of parameter estimation
with the ordered $\ell_{2}$-regularization via Alternating Direction Method of
Multipliers (ADMM), called ADMM-O$\ell_{2}$. The advantages of ADMM-O$\ell_{2}$
include (i) scaling up the ordered $\ell_{2}$ to a large-scale dataset, (ii)
predicting parameters correctly by excluding irrelevant variables
automatically, and (iii) having a fast convergence rate. Experiment results on
both synthetic data and real data indicate that ADMM-O$\ell_{2}$ can perform
better than or comparable to several state-of-the-art baselines.
","[{'version': 'v1', 'created': 'Wed, 4 Sep 2019 01:58:08 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Oct 2019 01:15:52 GMT'}, {'version': 'v3', 'created': 'Thu, 31 Oct 2019 08:33:34 GMT'}]",2019-11-01,"[['Humayoo', 'Mahammad', ''], ['Cheng', 'Xueqi', '']]","['ADMM', 'big data', 'feature selection', 'optimization', 'ridge regression', 'ordered regularization', 'elastic net']"
10107,2204.11527,Gjorgjina Cenikj,"Gjorgjina Cenikj, Ryan Dieter Lang, Andries Petrus Engelbrecht, Carola
  Doerr, Peter Koro\v{s}ec and Tome Eftimov","SELECTOR: Selecting a Representative Benchmark Suite for Reproducible
  Statistical Comparison","10 pages, 6 figures",,10.1145/3512290.3528809,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fair algorithm evaluation is conditioned on the existence of high-quality
benchmark datasets that are non-redundant and are representative of typical
optimization scenarios. In this paper, we evaluate three heuristics for
selecting diverse problem instances which should be involved in the comparison
of optimization algorithms in order to ensure robust statistical algorithm
performance analysis. The first approach employs clustering to identify similar
groups of problem instances and subsequent sampling from each cluster to
construct new benchmarks, while the other two approaches use graph algorithms
for identifying dominating and maximal independent sets of nodes. We
demonstrate the applicability of the proposed heuristics by performing a
statistical performance analysis of five portfolios consisting of three
optimization algorithms on five of the most commonly used optimization
benchmarks. The results indicate that the statistical analyses of the
algorithms' performance, conducted on each benchmark separately, produce
conflicting outcomes, which can be used to give a false indication of the
superiority of one algorithm over another. On the other hand, when the analysis
is conducted on the problem instances selected with the proposed heuristics,
which uniformly cover the problem landscape, the statistical outcomes are
robust and consistent.
","[{'version': 'v1', 'created': 'Mon, 25 Apr 2022 09:38:43 GMT'}]",2022-04-26,"[['Cenikj', 'Gjorgjina', ''], ['Lang', 'Ryan Dieter', ''], ['Engelbrecht', 'Andries Petrus', ''], ['Doerr', 'Carola', ''], ['Korošec', 'Peter', ''], ['Eftimov', 'Tome', '']]","['benchmarking', 'black-box optimization', 'single-objective optimization', 'optimization algorithm performance evaluation']"
10108,2101.01870,Hee-Seung Moon,Hee-Seung Moon and Jiwon Seo,"Optimal Action-based or User Prediction-based Haptic Guidance: Can You
  Do Even Better?","Accepted to ACM 2021 CHI Conference on Human Factors in Computing
  Systems (CHI 2021)",,10.1145/3411764.3445115,,cs.HC cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The recently advanced robotics technology enables robots to assist users in
their daily lives. Haptic guidance (HG) improves users' task performance
through physical interaction between robots and users. It can be classified
into optimal action-based HG (OAHG), which assists users with an optimal
action, and user prediction-based HG (UPHG), which assists users with their
next predicted action. This study aims to understand the difference between
OAHG and UPHG and propose a combined HG (CombHG) that achieves optimal
performance by complementing each HG type, which has important implications for
HG design. We propose implementation methods for each HG type using deep
learning-based approaches. A user study (n=20) in a haptic task environment
indicated that UPHG induces better subjective evaluations, such as naturalness
and comfort, than OAHG. In addition, the CombHG that we proposed further
decreases the disagreement between the user intention and HG, without reducing
the objective and subjective scores.
","[{'version': 'v1', 'created': 'Wed, 6 Jan 2021 04:59:19 GMT'}]",2021-01-07,"[['Moon', 'Hee-Seung', ''], ['Seo', 'Jiwon', '']]","['Haptic guidance', 'Physical human–robot interaction (pHRI)', 'Useradaptation', 'Deep learning']"
10109,2110.09758,Sascha El-Sharkawy,"Christian Kr\""oher, Sascha El-Sharkawy, Klaus Schmid",KernelHaven -- An Open Infrastructure for Product Line Analysis,,"Proceedings of the 22nd International Systems and Software Product
  Line Conference (SPLC '18) - Volume 2, 2018, pages 5-10",10.1145/3236405.3236410,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  KernelHaven is an open infrastructure for Software Product Line (SPL)
analysis. It is intended both as a production-quality analysis tool set as well
as a research support tool, e.g., to support researchers in systematically
exploring research hypothesis. For flexibility and ease of experimentation
KernelHaven components are plug-ins for extracting certain information from SPL
artifacts and processing this information, e.g., to check the correctness and
consistency of variability information or to apply metrics. A
configuration-based setup along with automatic documentation functionality
allows different experiments and supports their easy reproduction. Here, we
describe KernelHaven as a product line analysis research tool and highlight its
basic approach as well as its fundamental capabilities. In particular, we
describe available information extraction and processing plug-ins and how to
combine them. On this basis, researchers and interested professional users can
rapidly conduct a first set of experiments. Further, we describe the concepts
for extending KernelHaven by new plug-ins, which reduces development effort
when realizing new experiments.
","[{'version': 'v1', 'created': 'Tue, 19 Oct 2021 06:20:52 GMT'}]",2021-10-20,"[['Kröher', 'Christian', ''], ['El-Sharkawy', 'Sascha', ''], ['Schmid', 'Klaus', '']]","['Software product line analysis', 'variability extraction', 'static analysis', 'empirical software engineering']"
10110,2203.10553,Yuntao Wang,"Yuntao Wang, Jiexin Ding, Ishan Chatterjee, Farshid Salemi Parizi,
  Yuzhou Zhuang, Yukang Yan, Shwetak Patel, Yuanchun Shi","FaceOri: Tracking Head Position and Orientation Using Ultrasonic Ranging
  on Earphones","CHI Conference on Human Factors in Computing Systems (CHI'22), 12
  pages",,10.1145/3491102.3517698,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Face orientation can often indicate users' intended interaction target. In
this paper, we propose FaceOri, a novel face tracking technique based on
acoustic ranging using earphones. FaceOri can leverage the speaker on a
commodity device to emit an ultrasonic chirp, which is picked up by the set of
microphones on the user's earphone, and then processed to calculate the
distance from each microphone to the device. These measurements are used to
derive the user's face orientation and distance with respect to the device. We
conduct a ground truth comparison and user study to evaluate FaceOri's
performance. The results show that the system can determine whether the user
orients to the device at a 93.5% accuracy within a 1.5 meters range.
Furthermore, FaceOri can continuously track the user's head orientation with a
median absolute error of 10.9 mm in the distance, 3.7 degrees in yaw, and 5.8
degrees in pitch. FaceOri can allow for convenient hands-free control of
devices and produce more intelligent context-aware interaction.
","[{'version': 'v1', 'created': 'Sun, 20 Mar 2022 13:46:26 GMT'}]",2022-03-22,"[['Wang', 'Yuntao', ''], ['Ding', 'Jiexin', ''], ['Chatterjee', 'Ishan', ''], ['Parizi', 'Farshid Salemi', ''], ['Zhuang', 'Yuzhou', ''], ['Yan', 'Yukang', ''], ['Patel', 'Shwetak', ''], ['Shi', 'Yuanchun', '']]","['Acoustic ranging', 'head orientation', 'earphone', 'head pose estimation']"
10111,1806.04563,Michael Hellwig,Michael Hellwig and Hans-Georg Beyer,"Benchmarking Evolutionary Algorithms For Single Objective Real-valued
  Constrained Optimization - A Critical Review","This manuscript is a preprint version of an article published in
  Swarm and Evolutionary Computation, Elsevier, 2018. Number of pages: 45",,10.1016/j.swevo.2018.10.002,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Benchmarking plays an important role in the development of novel search
algorithms as well as for the assessment and comparison of contemporary
algorithmic ideas. This paper presents common principles that need to be taken
into account when considering benchmarking problems for constrained
optimization. Current benchmark environments for testing Evolutionary
Algorithms are reviewed in the light of these principles. Along with this line,
the reader is provided with an overview of the available problem domains in the
field of constrained benchmarking. Hence, the review supports algorithms
developers with information about the merits and demerits of the available
frameworks.
","[{'version': 'v1', 'created': 'Tue, 12 Jun 2018 14:42:07 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Oct 2018 10:27:50 GMT'}]",2018-10-08,"[['Hellwig', 'Michael', ''], ['Beyer', 'Hans-Georg', '']]","['Benchmarking', 'Constrained Optimization', 'EvolutionaryAlgorithms', 'Continuous Optimization']"
10112,1909.11048,Piotr Koniusz,"Arian Prabowo, Piotr Koniusz, Wei Shao, Flora D. Salim",COLTRANE: ConvolutiOnaL TRAjectory NEtwork for Deep Map Inference,BuildSys 2019,BuildSys 2019,10.1145/3360322.3360853,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The process of automatic generation of a road map from GPS trajectories,
called map inference, remains a challenging task to perform on a geospatial
data from a variety of domains as the majority of existing studies focus on
road maps in cities. Inherently, existing algorithms are not guaranteed to work
on unusual geospatial sites, such as an airport tarmac, pedestrianized paths
and shortcuts, or animal migration routes, etc. Moreover, deep learning has not
been explored well enough for such tasks. This paper introduces COLTRANE,
ConvolutiOnaL TRAjectory NEtwork, a novel deep map inference framework which
operates on GPS trajectories collected in various environments. This framework
includes an Iterated Trajectory Mean Shift (ITMS) module to localize road
centerlines, which copes with noisy GPS data points. Convolutional Neural
Network trained on our novel trajectory descriptor is then introduced into our
framework to detect and accurately classify junctions for refinement of the
road maps. COLTRANE yields up to 37% improvement in F1 scores over existing
methods on two distinct real-world datasets: city roads and airport tarmac.
","[{'version': 'v1', 'created': 'Tue, 24 Sep 2019 16:59:33 GMT'}]",2019-09-25,"[['Prabowo', 'Arian', ''], ['Koniusz', 'Piotr', ''], ['Shao', 'Wei', ''], ['Salim', 'Flora D.', '']]","['Map Inference', 'GPS', 'Road Network', 'Spatial', 'Trajectory', 'Airport']"
10113,1704.05905,Carla Mouradian,"Carla Mouradian, Jagruti Sahoo, Roch H. Glitho, Monique J. Morrow, and
  Paul A. Polakos","A Coalition Formation Algorithm for Multi-Robot Task Allocation in
  Large-Scale Natural Disasters",,,10.1109/IWCMC.2017.7986575,,cs.MA cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In large-scale natural disasters, humans are likely to fail when they attempt
to reach high-risk sites or act in search and rescue operations. Robots,
however, outdo their counterparts in surviving the hazards and handling the
search and rescue missions due to their multiple and diverse sensing and
actuation capabilities. The dynamic formation of optimal coalition of these
heterogeneous robots for cost efficiency is very challenging and research in
the area is gaining more and more attention. In this paper, we propose a novel
heuristic. Since the population of robots in large-scale disaster settings is
very large, we rely on Quantum Multi-Objective Particle Swarm Optimization
(QMOPSO). The problem is modeled as a multi-objective optimization problem.
Simulations with different test cases and metrics, and comparison with other
algorithms such as NSGA-II and SPEA-II are carried out. The experimental
results show that the proposed algorithm outperforms the existing algorithms
not only in terms of convergence but also in terms of diversity and processing
time.
","[{'version': 'v1', 'created': 'Wed, 19 Apr 2017 19:25:55 GMT'}]",2017-10-17,"[['Mouradian', 'Carla', ''], ['Sahoo', 'Jagruti', ''], ['Glitho', 'Roch H.', ''], ['Morrow', 'Monique J.', ''], ['Polakos', 'Paul A.', '']]","['Coalition Formation', 'Multi-robot', 'Particle Swarm']"
10114,1410.5024,Yuantao Gu,"Shuyang Jiang, Yuantao Gu","Block-Sparsity-Induced Adaptive Filter for Multi-Clustering System
  Identification","29 pages, 11 figure, journal manuscript",,10.1109/TSP.2015.2453133,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to improve the performance of least mean square (LMS)-based adaptive
filtering for identifying block-sparse systems, a new adaptive algorithm called
block-sparse LMS (BS-LMS) is proposed in this paper. The basis of the proposed
algorithm is to insert a penalty of block-sparsity, which is a mixed \$l_{2,
0}\$ norm of adaptive tap-weights with equal group partition sizes, into the
cost function of traditional LMS algorithm. To describe a block-sparse system
response, we first propose a Markov-Gaussian model, which can generate a kind
of system responses of arbitrary average sparsity and arbitrary average block
length using given parameters. Then we present theoretical expressions of the
steady-state misadjustment and transient convergence behavior of BS-LMS with an
appropriate group partition size for white Gaussian input data. Based on the
above results, we theoretically demonstrate that BS-LMS has much better
convergence behavior than \$l_0\$-LMS with the same small level of
misadjustment. Finally, numerical experiments verify that all of the
theoretical analysis agrees well with simulation results in a large range of
parameters.
","[{'version': 'v1', 'created': 'Sun, 19 Oct 2014 01:45:06 GMT'}]",2015-10-28,"[['Jiang', 'Shuyang', ''], ['Gu', 'Yuantao', '']]","['adaptive filtering', 'block-sparse system identification', 'convergence behavior', 'performance analysis', 'Markov-Gaussian model']"
10115,1902.02771,S.H. Shabbeer Basha,"S.H. Shabbeer Basha, Shiv Ram Dubey, Viswanath Pulabaigari, Snehasis
  Mukherjee","Impact of Fully Connected Layers on Performance of Convolutional Neural
  Networks for Image Classification",This paper is accepted for publication in Neurocomputing Journal,,10.1016/j.neucom.2019.10.008,,cs.CV cs.LG cs.NE eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Convolutional Neural Networks (CNNs), in domains like computer vision,
mostly reduced the need for handcrafted features due to its ability to learn
the problem-specific features from the raw input data. However, the selection
of dataset-specific CNN architecture, which mostly performed by either
experience or expertise is a time-consuming and error-prone process. To
automate the process of learning a CNN architecture, this paper attempts at
finding the relationship between Fully Connected (FC) layers with some of the
characteristics of the datasets. The CNN architectures, and recently datasets
also, are categorized as deep, shallow, wide, etc. This paper tries to
formalize these terms along with answering the following questions. (i) What is
the impact of deeper/shallow architectures on the performance of the CNN w.r.t.
FC layers?, (ii) How the deeper/wider datasets influence the performance of CNN
w.r.t. FC layers?, and (iii) Which kind of architecture (deeper/ shallower) is
better suitable for which kind of (deeper/ wider) datasets. To address these
findings, we have performed experiments with three CNN architectures having
different depths. The experiments are conducted by varying the number of FC
layers. We used four widely used datasets including CIFAR-10, CIFAR-100, Tiny
ImageNet, and CRCHistoPhenotypes to justify our findings in the context of the
image classification problem. The source code of this research is available at
https://github.com/shabbeersh/Impact-of-FC-layers.
","[{'version': 'v1', 'created': 'Mon, 21 Jan 2019 07:42:26 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Mar 2019 04:35:05 GMT'}, {'version': 'v3', 'created': 'Tue, 19 Nov 2019 05:28:01 GMT'}]",2019-11-20,"[['Basha', 'S. H. Shabbeer', ''], ['Dubey', 'Shiv Ram', ''], ['Pulabaigari', 'Viswanath', ''], ['Mukherjee', 'Snehasis', '']]","['Convolutional Neural Networks', 'Fully Connected Layers', 'Image']"
10116,2012.11330,Vasilis Krokos,"Vasilis Krokos, Viet Bui Xuan, St\'ephane P. A. Bordas, Philippe
  Young, Pierre Kerfriden","A Bayesian multiscale CNN framework to predict local stress fields in
  structures with microscale features","50 pages, 42 figures; corrected typos; clarifications",,10.1007/s00466-021-02112-3,,cs.CE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multiscale computational modelling is challenging due to the high
computational cost of direct numerical simulation by finite elements. To
address this issue, concurrent multiscale methods use the solution of cheaper
macroscale surrogates as boundary conditions to microscale sliding windows. The
microscale problems remain a numerically challenging operation both in terms of
implementation and cost. In this work we propose to replace the local
microscale solution by an Encoder-Decoder Convolutional Neural Network that
will generate fine-scale stress corrections to coarse predictions around
unresolved microscale features, without prior parametrisation of local
microscale problems. We deploy a Bayesian approach providing credible intervals
to evaluate the uncertainty of the predictions, which is then used to
investigate the merits of a selective learning framework. We will demonstrate
the capability of the approach to predict equivalent stress fields in porous
structures using linearised and finite strain elasticity theories.
","[{'version': 'v1', 'created': 'Thu, 17 Dec 2020 14:08:22 GMT'}, {'version': 'v2', 'created': 'Mon, 5 Apr 2021 15:59:43 GMT'}, {'version': 'v3', 'created': 'Thu, 22 Jul 2021 15:30:11 GMT'}, {'version': 'v4', 'created': 'Wed, 19 Jan 2022 10:44:48 GMT'}]",2022-01-20,"[['Krokos', 'Vasilis', ''], ['Xuan', 'Viet Bui', ''], ['Bordas', 'Stéphane P. A.', ''], ['Young', 'Philippe', ''], ['Kerfriden', 'Pierre', '']]","['Multiscale stress analysis', 'Convolutional neural network', 'Surrogate modelling', 'Bayesianmachine learning']"
10117,2109.03014,Gueltoum Bendiab,"Richard Brown, Gueltoum Bendiab, Stavros Shiaeles, and Bogdan Ghita","A Novel Multimodal Biometric Authentication System using Machine
  Learning and Blockchain",,"INC 2020: 12th International Network Conference 2020, Rhodes,
  Greece, 19-21 September 2020",10.1007/978-3-030-64758-2_3,"13 pages, 8 figures, 3 tables",cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional authentication systems that rely on simple passwords, PIN numbers
or tokens have many security issues, like easily guessed passwords, PIN numbers
written on the back of cards, etc. Thus, biometric authentication methods that
rely on physical and behavioural characteristics have been proposed as an
alternative for those systems. In real-world applications, authentication
systems that involve a single biometric faced many issues, especially lack of
accuracy and noisy data, which boost the research community to create
multibiometric systems that involve a variety of biometrics. Those systems
provide better performance and higher accuracy compared to other authentication
methods. However, most of them are inconvenient and requires complex
interactions from the user. Thus, in this paper, we introduce a novel
multimodal authentication system that relies on machine learning and
blockchain, with the aim of providing a more secure, transparent, and
convenient authentication mechanism. The proposed system combines four
important biometrics, fingerprint, face, age, and gender. The supervised
learning algorithm Decision Tree has been used to combine the results of the
biometrics verification process and produce a confidence level related to the
user. The initial experimental results show the efficiency and robustness of
the proposed multimodal systems.
","[{'version': 'v1', 'created': 'Mon, 6 Sep 2021 13:45:16 GMT'}]",2021-09-08,"[['Brown', 'Richard', ''], ['Bendiab', 'Gueltoum', ''], ['Shiaeles', 'Stavros', ''], ['Ghita', 'Bogdan', '']]","['Authentication', 'Machine Learning', 'Blockchain', 'Multimodal', 'Security']"
10118,2210.15459,Yanwu Yang,Huiran Li and Yanwu Yang,"Keyword Targeting Optimization in Sponsored Search Advertising:
  Combining Selection and Matching","38 pages, 4 figures, 5 tables","Electronic Commerce Research and Applications, 56, 101209 (2022)",10.1016/j.elerap.2022.101209,,cs.IR cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In sponsored search advertising (SSA), advertisers need to select keywords
and determine matching types for selected keywords simultaneously, i.e.,
keyword targeting. An optimal keyword targeting strategy guarantees reaching
the right population effectively. This paper aims to address the keyword
targeting problem, which is a challenging task because of the incomplete
information of historical advertising performance indices and the high
uncertainty in SSA environments. First, we construct a data distribution
estimation model and apply a Markov Chain Monte Carlo method to make inference
about unobserved indices (i.e., impression and click-through rate) over three
keyword matching types (i.e., broad, phrase and exact). Second, we formulate a
stochastic keyword targeting model (BB-KSM) combining operations of keyword
selection and keyword matching to maximize the expected profit under the chance
constraint of the budget, and develop a branch-and-bound algorithm
incorporating a stochastic simulation process for our keyword targeting model.
Finally, based on a realworld dataset collected from field reports and logs of
past SSA campaigns, computational experiments are conducted to evaluate the
performance of our keyword targeting strategy. Experimental results show that,
(a) BB-KSM outperforms seven baselines in terms of profit; (b) BB-KSM shows its
superiority as the budget increases, especially in situations with more
keywords and keyword combinations; (c) the proposed data distribution
estimation approach can effectively address the problem of incomplete
performance indices over the three matching types and in turn significantly
promotes the performance of keyword targeting decisions. This research makes
important contributions to the SSA literature and the results offer critical
insights into keyword management for SSA advertisers.
","[{'version': 'v1', 'created': 'Wed, 19 Oct 2022 03:37:32 GMT'}]",2022-10-28,"[['Li', 'Huiran', ''], ['Yang', 'Yanwu', '']]","['simultaneously', 'i.e', 'keyword targeting']"
10119,2202.10872,Adnan Theerens,"Adnan Theerens, Oliver Urs Lenz, Chris Cornelis",Choquet-Based Fuzzy Rough Sets,,,10.1016/j.ijar.2022.04.006,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fuzzy rough set theory can be used as a tool for dealing with inconsistent
data when there is a gradual notion of indiscernibility between objects. It
does this by providing lower and upper approximations of concepts. In classical
fuzzy rough sets, the lower and upper approximations are determined using the
minimum and maximum operators, respectively. This is undesirable for machine
learning applications, since it makes these approximations sensitive to
outlying samples. To mitigate this problem, ordered weighted average (OWA)
based fuzzy rough sets were introduced. In this paper, we show how the
OWA-based approach can be interpreted intuitively in terms of vague
quantification, and then generalize it to Choquet-based fuzzy rough sets
(CFRS). This generalization maintains desirable theoretical properties, such as
duality and monotonicity. Furthermore, it provides more flexibility for machine
learning applications. In particular, we show that it enables the seamless
integration of outlier detection algorithms, to enhance the robustness of
machine learning algorithms based on fuzzy rough sets.
","[{'version': 'v1', 'created': 'Tue, 22 Feb 2022 13:10:16 GMT'}]",2022-05-03,"[['Theerens', 'Adnan', ''], ['Lenz', 'Oliver Urs', ''], ['Cornelis', 'Chris', '']]","['Fuzzy rough sets', 'Non-additive measures', 'Choquet integral', 'Machine learning', 'Outlier detection']"
10120,2002.01543,Christian Meske,"Christian Meske, Enrico Bunde","Transparency and Trust in Human-AI-Interaction: The Role of
  Model-Agnostic Explanations in Computer Vision-Based Decision Support",,,10.1007/978-3-030-50334-5_4,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer Vision, and hence Artificial Intelligence-based extraction of
information from images, has increasingly received attention over the last
years, for instance in medical diagnostics. While the algorithms' complexity is
a reason for their increased performance, it also leads to the ""black box""
problem, consequently decreasing trust towards AI. In this regard, ""Explainable
Artificial Intelligence"" (XAI) allows to open that black box and to improve the
degree of AI transparency. In this paper, we first discuss the theoretical
impact of explainability on trust towards AI, followed by showcasing how the
usage of XAI in a health-related setting can look like. More specifically, we
show how XAI can be applied to understand why Computer Vision, based on deep
learning, did or did not detect a disease (malaria) on image data (thin blood
smear slide images). Furthermore, we investigate, how XAI can be used to
compare the detection strategy of two different deep learning models often used
for Computer Vision: Convolutional Neural Network and Multi-Layer Perceptron.
Our empirical results show that i) the AI sometimes used questionable or
irrelevant data features of an image to detect malaria (even if correctly
predicted), and ii) that there may be significant discrepancies in how
different deep learning models explain the same prediction. Our theoretical
discussion highlights that XAI can support trust in Computer Vision systems,
and AI systems in general, especially through an increased understandability
and predictability.
","[{'version': 'v1', 'created': 'Tue, 4 Feb 2020 21:19:56 GMT'}, {'version': 'v2', 'created': 'Sun, 12 Jul 2020 20:17:07 GMT'}]",2020-07-14,"[['Meske', 'Christian', ''], ['Bunde', 'Enrico', '']]","['Explainability', 'Artificial Intelligence', 'Deep Learning', 'Computer Vision', 'Trust', 'Healthcare']"
10121,2107.13233,Christos Kyrkou,Christos Kyrkou,"C^3Net: End-to-End deep learning for efficient real-time visual active
  camera control","Journal of Real-Time Image Processing , 2021. Real-time active
  vision, Smart camera, Deep learning, End-to-end learning
  https://www.youtube.com/watch?v=UuepDtWUpsg&ab_channel=ChristosKyrkou. arXiv
  admin note: text overlap with arXiv:2012.06428",,10.1007/s11554-021-01077-z,,cs.CV cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The need for automated real-time visual systems in applications such as smart
camera surveillance, smart environments, and drones necessitates the
improvement of methods for visual active monitoring and control. Traditionally,
the active monitoring task has been handled through a pipeline of modules such
as detection, filtering, and control. However, such methods are difficult to
jointly optimize and tune their various parameters for real-time processing in
resource constraint systems. In this paper a deep Convolutional Camera
Controller Neural Network is proposed to go directly from visual information to
camera movement to provide an efficient solution to the active vision problem.
It is trained end-to-end without bounding box annotations to control a camera
and follow multiple targets from raw pixel values. Evaluation through both a
simulation framework and real experimental setup, indicate that the proposed
solution is robust to varying conditions and able to achieve better monitoring
performance than traditional approaches both in terms of number of targets
monitored as well as in effective monitoring time. The advantage of the
proposed approach is that it is computationally less demanding and can run at
over 10 FPS (~4x speedup) on an embedded smart camera providing a practical and
affordable solution to real-time active monitoring.
","[{'version': 'v1', 'created': 'Wed, 28 Jul 2021 09:31:46 GMT'}]",2021-07-29,"[['Kyrkou', 'Christos', '']]","['Real-Time Active Vision', 'Smart Camera', 'Deep Learning', 'End-to-End Learning']"
10122,2202.05257,Gaurav Verma,"Manoj Niverthi, Gaurav Verma, Srijan Kumar","Characterizing, Detecting, and Predicting Online Ban Evasion",Accepted full paper at The ACM WebConf 2022,,10.1145/3485447.3512133,,cs.SI cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Moderators and automated methods enforce bans on malicious users who engage
in disruptive behavior. However, malicious users can easily create a new
account to evade such bans. Previous research has focused on other forms of
online deception, like the simultaneous operation of multiple accounts by the
same entities (sockpuppetry), impersonation of other individuals, and studying
the effects of de-platforming individuals and communities. Here we conduct the
first data-driven study of ban evasion, i.e., the act of circumventing bans on
an online platform, leading to temporally disjoint operation of accounts by the
same user.
  We curate a novel dataset of 8,551 ban evasion pairs (parent, child)
identified on Wikipedia and contrast their behavior with benign users and
non-evading malicious users. We find that evasion child accounts demonstrate
similarities with respect to their banned parent accounts on several behavioral
axes - from similarity in usernames and edited pages to similarity in content
added to the platform and its psycholinguistic attributes. We reveal key
behavioral attributes of accounts that are likely to evade bans. Based on the
insights from the analyses, we train logistic regression classifiers to detect
and predict ban evasion at three different points in the ban evasion lifecycle.
Results demonstrate the effectiveness of our methods in predicting future
evaders (AUC = 0.78), early detection of ban evasion (AUC = 0.85), and matching
child accounts with parent accounts (MRR = 0.97). Our work can aid moderators
by reducing their workload and identifying evasion pairs faster and more
efficiently than current manual and heuristic-based approaches. Dataset is
available $\href{https://github.com/srijankr/ban_evasion}{\text{here}}$.
","[{'version': 'v1', 'created': 'Thu, 10 Feb 2022 18:58:19 GMT'}]",2022-02-11,"[['Niverthi', 'Manoj', ''], ['Verma', 'Gaurav', ''], ['Kumar', 'Srijan', '']]","['ban evasion', 'malicious users', 'deception detection', 'online communities', 'Wikipedia']"
10123,cs/0009028,Alex Brodsky,"Alex Brodsky, Stephane Durocher, Ellen Gethner","Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper
  Bounds, and Asymptotics",13 Pages,Discrete Mathematics. 262(1-3):59-77. 2003,10.1016/S0012-365X(02)00491-0,,cs.DM cs.CG math.CO,,"  Scheinerman and Wilf (1994) assert that `an important open problem in the
study of graph embeddings is to determine the rectilinear crossing number of
the complete graph K_n.' A rectilinear drawing of K_n is an arrangement of n
vertices in the plane, every pair of which is connected by an edge that is a
line segment. We assume that no three vertices are collinear, and that no three
edges intersect in a point unless that point is an endpoint of all three. The
rectilinear crossing number of K_n is the fewest number of edge crossings
attainable over all rectilinear drawings of K_n.
  For each n we construct a rectilinear drawing of K_n that has the fewest
number of edge crossings and the best asymptotics known to date. Moreover, we
give some alternative infinite families of drawings of K_n with good
asymptotics. Finally, we mention some old and new open problems.
","[{'version': 'v1', 'created': 'Thu, 28 Sep 2000 16:33:06 GMT'}]",2011-10-04,"[['Brodsky', 'Alex', ''], ['Durocher', 'Stephane', ''], ['Gethner', 'Ellen', '']]","['crossing number', 'rectilinear', 'complete graph']"
10124,2101.04173,Reza Fotohi,"Monir Shaker, Fereidoon Shams Aliee and Reza Fotohi","Online rating system development using blockchain-based distributed
  ledger technology","25 figures, 5 tables, Journal Wireless Netw (2021)",,10.1007/s11276-020-02514-w,,cs.CR cs.CY,http://creativecommons.org/licenses/by/4.0/,"  In most websites, the online rating system provides the ratings of products
and services to users. Lack of trust in data integrity and its manipulation has
hindered fulfilling user satisfaction. Since existing online rating systems
deal with a central server, all rating data is stored on the central server.
Therefore, all rating data can be removed, modified, and manipulated by the
system manager to change the ratings in favor of the service or product
provider. In this paper, an online rating system using distributed ledger
technologies has been presented as the proposed system to solve all the
weaknesses of current systems. Distributed ledger technologies are completely
decentralized and there is no centralization on them by any institution.
Distributed ledger technologies have different variants. Among distributed
ledger technologies, blockchain technology has been used in the proposed rating
system because of its support for smart contracts. In the proposed online
rating system, the Ethereum platform has been chosen from different blockchain
platforms that have a public permission network. In this system, the raters
cannot rate unless they submit a request to the system and be authorized to
take part in the online product rating process. The important feature of the
Ethereum platform is its support for smart contracts, which can be used to
write the rating contract in the Solidity language. Also, using Proof of
Authority consensus mechanisms, all rating transactions are approved by the
surveyors. Since in the real Ethereum system, each rating transaction is sent
to the network by the raters, some gas must be paid for each rating
transaction. However, since this method is expensive, TestNet blockchain can be
used in the rating system. Finally, the proposed rating system was used for
rating the restaurants of a website and its features were tested.
","[{'version': 'v1', 'created': 'Mon, 11 Jan 2021 20:23:05 GMT'}]",2021-01-13,"[['Shaker', 'Monir', ''], ['Aliee', 'Fereidoon Shams', ''], ['Fotohi', 'Reza', '']]","['Online Rating System', 'Distributed Ledger Technology', 'Blockchain', 'Proof of Authority (PoA); TestNe']"
10125,2010.16322,Francesco Salvetti,"Vittorio Mazzia, Francesco Salvetti, Diego Aghi and Marcello Chiaberge",DeepWay: a Deep Learning Waypoint Estimator for Global Path Generation,Submitted to Computers and Electronics in Agriculture,"Volume 184, May 2021, 106091",10.1016/j.compag.2021.106091,,cs.RO cs.AI cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Agriculture 3.0 and 4.0 have gradually introduced service robotics and
automation into several agricultural processes, mostly improving crops quality
and seasonal yield. Row-based crops are the perfect settings to test and deploy
smart machines capable of monitoring and manage the harvest. In this context,
global path generation is essential either for ground or aerial vehicles, and
it is the starting point for every type of mission plan. Nevertheless, little
attention has been currently given to this problem by the research community
and global path generation automation is still far to be solved. In order to
generate a viable path for an autonomous machine, the presented research
proposes a feature learning fully convolutional model capable of estimating
waypoints given an occupancy grid map. In particular, we apply the proposed
data-driven methodology to the specific case of row-based crops with the
general objective to generate a global path able to cover the extension of the
crop completely. Extensive experimentation with a custom made synthetic dataset
and real satellite-derived images of different scenarios have proved the
effectiveness of our methodology and demonstrated the feasibility of an
end-to-end and completely autonomous global path planner.
","[{'version': 'v1', 'created': 'Fri, 30 Oct 2020 15:27:42 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Jan 2021 17:01:14 GMT'}]",2021-03-30,"[['Mazzia', 'Vittorio', ''], ['Salvetti', 'Francesco', ''], ['Aghi', 'Diego', ''], ['Chiaberge', 'Marcello', '']]","['Deep Learning', 'Unmanned Ground Vehicles', 'Precision Agriculture', 'Global Path Planning']"
10126,1411.0100,Bakthavachalam Elango,"Bakthavachalam Elango, Lutz Bornmann, Subramaniam Shankar",Study of Citation Networks in Tribology Research,Submitted to the journal Scientometrics,,10.1080/09737766.2016.1177940,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CitNetExplorer has been used to study the citation networks among the
scientific publications on tribology during the 15 years period from 1998-2012.
Three data sets from Web of Science have been analyzed: (1) Core publications
of tribology research, (2) publications on nanotribology and (3) publications
of Bharat Bhushan (a top-contributor to nanotribology research). Based on this
study, some suggestions are made to improve the CitNetExplorer.
","[{'version': 'v1', 'created': 'Sat, 1 Nov 2014 11:01:24 GMT'}]",2016-08-03,"[['Elango', 'Bakthavachalam', ''], ['Bornmann', 'Lutz', ''], ['Shankar', 'Subramaniam', '']]","['CitNetExplorer', 'Citation Networks', 'Clustering', 'Tribology', 'Nanotribology', 'Bharat Bhushan', 'Web of Science']"
10127,2010.03608,Yuquan Fu,"Yuquan Fu (Indiana University, USA), Sam Tobin-Hochstadt (Indiana
  University, USA)",Type Checking Extracted Methods,,"The Art, Science, and Engineering of Programming, 2022, Vol. 6,
  Issue 2, Article 6",10.22152/programming-journal.org/2022/6/6,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many object-oriented dynamic languages allow programmers to _extract methods_
from objects and treat them as functions. This allows for flexible programming
patterns, but presents challenges for type systems. In particular, a simple
treatment of method extraction would require methods to be contravariant in the
receiver type, making overriding all-but-impossible. We present a detailed
investigation of this problem, as well as an implemented and evaluated
solution. Method extraction is a feature of many dynamically-typed and
gradually-typed languages, ranging from Python and PHP to Flow and TypeScript.
In these languages, the underlying representation of objects as records of
procedures can be accessed, and the procedures that implement methods can be
reified as functions that can be called independently. In many of these
languages, the programmer can then explicitly specify the `this` value to be
used when the method implementation is called. Unfortunately, as we show,
existing gradual type systems such as TypeScript and Flow are unsound in the
presence of method extraction. The problem for typing any such system is that
the flexibility it allows must be tamed by requiring a connection between the
object the method was extracted from, and the function value that is later
called. In Racket, where a method extraction-like facility, dubbed ""structure
type properties"", is fundamental to classes, generic methods, and other APIs,
these same challenges arise, and must be solved to support this feature in
Typed Racket. We show how to combine two existing type system features --
existential types and occurrence typing -- to produce a sound approach to
typing method extraction. We formalize our design, extending an existing formal
model of the Typed Racket type system, and prove that our extension is sound.
Our design is also implemented in the released version of Racket, and is
compatible with all existing Typed Racket packages, many of which already used
a previous version of this feature.
","[{'version': 'v1', 'created': 'Wed, 7 Oct 2020 19:05:51 GMT'}, {'version': 'v2', 'created': 'Fri, 30 Jul 2021 19:51:02 GMT'}, {'version': 'v3', 'created': 'Fri, 19 Nov 2021 20:18:26 GMT'}]",2021-11-23,"[['Fu', 'Yuquan', '', 'Indiana University, USA'], ['Tobin-Hochstadt', 'Sam', '', 'Indiana\n  University, USA']]","['methods', 'types', 'gradual typing']"
10128,2111.02115,Shatrughan Modi,"Shatrughan Modi, Jhilik Bhattacharya, Prasenjit Basak","Multistep traffic speed prediction: A deep learning based approach using
  latent space mapping considering spatio-temporal dependencies",,,10.1016/j.eswa.2021.116140,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Traffic management in a city has become a major problem due to the increasing
number of vehicles on roads. Intelligent Transportation System (ITS) can help
the city traffic managers to tackle the problem by providing accurate traffic
forecasts. For this, ITS requires a reliable traffic prediction algorithm that
can provide accurate traffic prediction at multiple time steps based on past
and current traffic data. In recent years, a number of different methods for
traffic prediction have been proposed which have proved their effectiveness in
terms of accuracy. However, most of these methods have either considered
spatial information or temporal information only and overlooked the effect of
other. In this paper, to address the above problem a deep learning based
approach has been developed using both the spatial and temporal dependencies.
To consider spatio-temporal dependencies, nearby road sensors at a particular
instant are selected based on the attributes like traffic similarity and
distance. Two pre-trained deep auto-encoders were cross-connected using the
concept of latent space mapping and the resultant model was trained using the
traffic data from the selected nearby sensors as input. The proposed deep
learning based approach was trained using the real-world traffic data collected
from loop detector sensors installed on different highways of Los Angeles and
Bay Area. The traffic data is freely available from the web portal of the
California Department of Transportation Performance Measurement System (PeMS).
The effectiveness of the proposed approach was verified by comparing it with a
number of machine/deep learning approaches. It has been found that the proposed
approach provides accurate traffic prediction results even for 60-min ahead
prediction with least error than other techniques.
","[{'version': 'v1', 'created': 'Wed, 3 Nov 2021 10:17:48 GMT'}]",2021-11-04,"[['Modi', 'Shatrughan', ''], ['Bhattacharya', 'Jhilik', ''], ['Basak', 'Prasenjit', '']]","['Traffic Speed Prediction', 'Deep Learning', 'Latent Space Mapping', 'Cross ConnectedDeep Auto-Encoders']"
10129,1802.00554,Andrew Lensen,"Andrew Lensen, Bing Xue, and Mengjie Zhang","Generating Redundant Features with Unsupervised Multi-Tree Genetic
  Programming","16 pages, preprint for EuroGP '18",,10.1007/978-3-319-77553-1_6,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, feature selection has become an increasingly important area of
research due to the surge in high-dimensional datasets in all areas of modern
life. A plethora of feature selection algorithms have been proposed, but it is
difficult to truly analyse the quality of a given algorithm. Ideally, an
algorithm would be evaluated by measuring how well it removes known bad
features. Acquiring datasets with such features is inherently difficult, and so
a common technique is to add synthetic bad features to an existing dataset.
While adding noisy features is an easy task, it is very difficult to
automatically add complex, redundant features. This work proposes one of the
first approaches to generating redundant features, using a novel genetic
programming approach. Initial experiments show that our proposed method can
automatically create difficult, redundant features which have the potential to
be used for creating high-quality feature selection benchmark datasets.
","[{'version': 'v1', 'created': 'Fri, 2 Feb 2018 04:19:04 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Mar 2018 06:35:56 GMT'}]",2019-10-24,"[['Lensen', 'Andrew', ''], ['Xue', 'Bing', ''], ['Zhang', 'Mengjie', '']]","['Genetic Programming', 'Feature Creation', 'Feature Construction', 'Feature Selection', 'Mutual Information', 'Evolutionary Computation']"
10130,2111.07009,Riddhish Bhalodia,"Riddhish Bhalodia, Shireen Elhabian, Ladislav Kavan, Ross Whitaker","Leveraging Unsupervised Image Registration for Discovery of Landmark
  Shape Descriptor",Published in Medical Image Analysis,,10.1016/j.media.2021.102157,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In current biological and medical research, statistical shape modeling (SSM)
provides an essential framework for the characterization of anatomy/morphology.
Such analysis is often driven by the identification of a relatively small
number of geometrically consistent features found across the samples of a
population. These features can subsequently provide information about the
population shape variation. Dense correspondence models can provide ease of
computation and yield an interpretable low-dimensional shape descriptor when
followed by dimensionality reduction. However, automatic methods for obtaining
such correspondences usually require image segmentation followed by significant
preprocessing, which is taxing in terms of both computation as well as human
resources. In many cases, the segmentation and subsequent processing require
manual guidance and anatomy specific domain expertise. This paper proposes a
self-supervised deep learning approach for discovering landmarks from images
that can directly be used as a shape descriptor for subsequent analysis. We use
landmark-driven image registration as the primary task to force the neural
network to discover landmarks that register the images well. We also propose a
regularization term that allows for robust optimization of the neural network
and ensures that the landmarks uniformly span the image domain. The proposed
method circumvents segmentation and preprocessing and directly produces a
usable shape descriptor using just 2D or 3D images. In addition, we also
propose two variants on the training loss function that allows for prior shape
information to be integrated into the model. We apply this framework on several
2D and 3D datasets to obtain their shape descriptors, and analyze their utility
for various applications.
","[{'version': 'v1', 'created': 'Sat, 13 Nov 2021 01:02:10 GMT'}]",2021-11-16,"[['Bhalodia', 'Riddhish', ''], ['Elhabian', 'Shireen', ''], ['Kavan', 'Ladislav', ''], ['Whitaker', 'Ross', '']]","['Self-Supervised Learning', 'Machine Learning', 'Statistical Shape Modeling', 'Image Registration']"
10131,1710.02475,Nabeel Abdur Rehman,"Nabeel Abdur Rehman, Kunal Relia, Rumi Chunara","Creating Full Individual-level Location Timelines from Sparse Social
  Media Data","10 pages, 8 figures, 2 tables",,10.1145/3274895.3274982,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many domain applications, a continuous timeline of human locations is
critical; for example for understanding possible locations where a disease may
spread, or the flow of traffic. While data sources such as GPS trackers or Call
Data Records are temporally-rich, they are expensive, often not publicly
available or garnered only in select locations, restricting their wide use.
Conversely, geo-located social media data are publicly and freely available,
but present challenges especially for full timeline inference due to their
sparse nature. We propose a stochastic framework, Intermediate Location
Computing (ILC) which uses prior knowledge about human mobility patterns to
predict every missing location from an individual's social media timeline. We
compare ILC with a state-of-the-art RNN baseline as well as methods that are
optimized for next-location prediction only. For three major cities, ILC
predicts the top 1 location for all missing locations in a timeline, at 1 and
2-hour resolution, with up to 77.2% accuracy (up to 6% better accuracy than all
compared methods). Specifically, ILC also outperforms the RNN in settings of
low data; both cases of very small number of users (under 50), as well as
settings with more users, but with sparser timelines. In general, the RNN model
needs a higher number of users to achieve the same performance as ILC. Overall,
this work illustrates the tradeoff between prior knowledge of heuristics and
more data, for an important societal problem of filling in entire timelines
using freely available, but sparse social media data.
","[{'version': 'v1', 'created': 'Fri, 6 Oct 2017 16:09:59 GMT'}, {'version': 'v2', 'created': 'Sun, 24 Feb 2019 17:08:11 GMT'}, {'version': 'v3', 'created': 'Fri, 22 Nov 2019 19:23:01 GMT'}]",2019-11-26,"[['Rehman', 'Nabeel Abdur', ''], ['Relia', 'Kunal', ''], ['Chunara', 'Rumi', '']]","['Spatial Information and Society', 'social media', 'sparse data']"
10132,2007.11353,Andreas Hinterreiter,"Michael P\""uhringer, Andreas Hinterreiter, Marc Streit","InstanceFlow: Visualizing the Evolution of Classifier Confusion on the
  Instance Level","conditionally accepted for IEEE VIS 2020 short paper track; minor
  revisions compared to original version",,10.1109/VIS47514.2020.00065,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classification is one of the most important supervised machine learning
tasks. During the training of a classification model, the training instances
are fed to the model multiple times (during multiple epochs) in order to
iteratively increase the classification performance. The increasing complexity
of models has led to a growing demand for model interpretability through
visualizations. Existing approaches mostly focus on the visual analysis of the
final model performance after training and are often limited to aggregate
performance measures. In this paper we introduce InstanceFlow, a novel
dual-view visualization tool that allows users to analyze the learning behavior
of classifiers over time on the instance-level. A Sankey diagram visualizes the
flow of instances throughout epochs, with on-demand detailed glyphs and traces
for individual instances. A tabular view allows users to locate interesting
instances by ranking and filtering. In this way, InstanceFlow bridges the gap
between class-level and instance-level performance evaluation while enabling
users to perform a full temporal analysis of the training process.
","[{'version': 'v1', 'created': 'Wed, 22 Jul 2020 11:59:28 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Aug 2020 22:01:56 GMT'}]",2021-03-03,"[['Pühringer', 'Michael', ''], ['Hinterreiter', 'Andreas', ''], ['Streit', 'Marc', '']]","['Classification', 'Performance analysis', 'Time seriesvisualization']"
10133,2011.13692,Mingfu Xue,"Mingfu Xue, Chengxiang Yuan, Can He, Jian Wang, Weiqiang Liu","NaturalAE: Natural and Robust Physical Adversarial Examples for Object
  Detectors",,"Journal of Information Security and Applications 57 (2021) 102694,
  1-12",10.1016/j.jisa.2020.102694,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a natural and robust physical adversarial example
attack method targeting object detectors under real-world conditions. The
generated adversarial examples are robust to various physical constraints and
visually look similar to the original images, thus these adversarial examples
are natural to humans and will not cause any suspicions. First, to ensure the
robustness of the adversarial examples in real-world conditions, the proposed
method exploits different image transformation functions, to simulate various
physical changes during the iterative optimization of the adversarial examples
generation. Second, to construct natural adversarial examples, the proposed
method uses an adaptive mask to constrain the area and intensities of the added
perturbations, and utilizes the real-world perturbation score (RPS) to make the
perturbations be similar to those real noises in physical world. Compared with
existing studies, our generated adversarial examples can achieve a high success
rate with less conspicuous perturbations. Experimental results demonstrate
that, the generated adversarial examples are robust under various indoor and
outdoor physical conditions, including different distances, angles,
illuminations, and photographing. Specifically, the attack success rate of
generated adversarial examples indoors and outdoors is high up to 73.33% and
82.22%, respectively. Meanwhile, the proposed method ensures the naturalness of
the generated adversarial example, and the size of added perturbations is much
smaller than the perturbations in the existing works. Further, the proposed
physical adversarial attack method can be transferred from the white-box models
to other object detection models.
","[{'version': 'v1', 'created': 'Fri, 27 Nov 2020 12:03:53 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Mar 2021 08:47:26 GMT'}]",2021-03-18,"[['Xue', 'Mingfu', ''], ['Yuan', 'Chengxiang', ''], ['He', 'Can', ''], ['Wang', 'Jian', ''], ['Liu', 'Weiqiang', '']]","['Physical adversarial examples', 'Artificial intelligence security', 'Deep learning', 'Object detectors']"
10134,1905.10982,Hazrat Ali,"Sulaiman Khan, Hazrat Ali, Zia Ullah, Mohammad Farhad Bulbul",An Intelligent Monitoring System of Vehicles on Highway Traffic,5 pages,"2018 12th International Conference on Open Source Systems and
  Technologies (ICOSST), Lahore, Pakistan, 2018, pp. 71-75",10.1109/ICOSST.2018.8632192,,cs.CV cs.AI cs.LG eess.SP,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Vehicle speed monitoring and management of highways is the critical problem
of the road in this modern age of growing technology and population. A poor
management results in frequent traffic jam, traffic rules violation and fatal
road accidents. Using traditional techniques of RADAR, LIDAR and LASAR to
address this problem is time-consuming, expensive and tedious. This paper
presents an efficient framework to produce a simple, cost efficient and
intelligent system for vehicle speed monitoring. The proposed method uses an HD
(High Definition) camera mounted on the road side either on a pole or on a
traffic signal for recording video frames. On the basis of these frames, a
vehicle can be tracked by using radius growing method, and its speed can be
calculated by calculating vehicle mask and its displacement in consecutive
frames. The method uses pattern recognition, digital image processing and
mathematical techniques for vehicle detection, tracking and speed calculation.
The validity of the proposed model is proved by testing it on different
highways.
","[{'version': 'v1', 'created': 'Mon, 27 May 2019 05:45:56 GMT'}]",2019-05-28,"[['Khan', 'Sulaiman', ''], ['Ali', 'Hazrat', ''], ['Ullah', 'Zia', ''], ['Bulbul', 'Mohammad Farhad', '']]","['Radius growing method', 'displacement', 'vehicle']"
10135,2008.07898,Martin Kucera,"Martin Ku\v{c}era, Ond\v{r}ej Such\'y","Minimum Eccentricity Shortest Path Problem with Respect to Structural
  Parameters",,,10.1007/978-3-030-79987-8_31,,cs.DS cs.CC,http://creativecommons.org/licenses/by/4.0/,"  The Minimum Eccentricity Shortest Path Problem consists in finding a shortest
path with minimum eccentricity in a given undirected graph. The problem is
known to be NP-complete and W[2]-hard with respect to the desired eccentricity.
We present fpt-algorithms for the problem parameterized by the modular width,
distance to cluster graph, the combination of treewidth with the desired
eccentricity, and maximum leaf number.
","[{'version': 'v1', 'created': 'Tue, 18 Aug 2020 12:56:02 GMT'}, {'version': 'v2', 'created': 'Sun, 27 Jun 2021 19:58:26 GMT'}, {'version': 'v3', 'created': 'Thu, 21 Jul 2022 18:53:29 GMT'}]",2022-07-25,"[['Kučera', 'Martin', ''], ['Suchý', 'Ondřej', '']]","['graph theory', 'minimum eccentricity shortest path', 'parameterizedcomplexity', 'fixed-parameter tractable']"
10136,2003.10623,Daisuke Ishii,"Daisuke Ishii, Tomohito Yabu",Computer-Assisted Verification of Four Interval Arithmetic Operators,"15 pages, 5 figures, 2 tables","Journal of Computational and Applied Mathematics 377, 112893
  (2020)",10.1016/j.cam.2020.112893,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interval arithmetic libraries provide the four elementary arithmetic
operators for operand intervals bounded by floating-point numbers. Actual
implementations need to make a large case analysis that considers, e.g.,
magnitude relations between all pairs of argument bounds, positional relations
between the arguments and zero, and handling of the special values, infinities
and NaN. Their correctness is not obvious as they are implemented by human
hands, which comes to be critical for the reliability. This work provides a
mechanically-verified interval arithmetic library. For this purpose, we utilize
the Why3 platform equipped with a specification language for annotated programs
and back-end theorem provers. We conduct several proof tasks for each of three
properties of the target code: validity, soundness, and tightness; zero
division exception handling is also verified for the division code. To
accomplish the proof, we propose several techniques for
specification/verification. First, we specify additional lemmas that support
deductions made by back-end SMT solvers, which enable to discharge proof
obligations in floating-point arithmetic containing nonlinear terms. Second, we
examine the annotation of tightness, which requires to assume that a
computation may result in NaN; we propose specific extremum operators for this
purpose. In the experiments, applying the techniques in conjunction with the
Alt-Ergo SMT solver and the Coq proof assistant proved the entire code.
","[{'version': 'v1', 'created': 'Tue, 24 Mar 2020 02:31:57 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Apr 2020 23:50:46 GMT'}]",2020-04-10,"[['Ishii', 'Daisuke', ''], ['Yabu', 'Tomohito', '']]","['Interval Arithmetic', 'Floating-Point Numbers', 'Program Verification', 'SMT Solvers', 'Proof Assistants']"
10137,2008.07939,Van-Hoang Nguyen,"Van-Hoang Nguyen and Kazunari Sugiyama and Preslav Nakov and Min-Yen
  Kan","FANG: Leveraging Social Context for Fake News Detection Using Graph
  Representation",To appear in CIKM 2020,,10.1145/3340531.3412046,,cs.SI cs.CL cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose Factual News Graph (FANG), a novel graphical social context
representation and learning framework for fake news detection. Unlike previous
contextual models that have targeted performance, our focus is on
representation learning. Compared to transductive models, FANG is scalable in
training as it does not have to maintain all nodes, and it is efficient at
inference time, without the need to re-process the entire graph. Our
experimental results show that FANG is better at capturing the social context
into a high fidelity representation, compared to recent graphical and
non-graphical models. In particular, FANG yields significant improvements for
the task of fake news detection, and it is robust in the case of limited
training data. We further demonstrate that the representations learned by FANG
generalize to related tasks, such as predicting the factuality of reporting of
a news medium.
","[{'version': 'v1', 'created': 'Tue, 18 Aug 2020 14:05:16 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Oct 2020 11:45:23 GMT'}]",2020-10-09,"[['Nguyen', 'Van-Hoang', ''], ['Sugiyama', 'Kazunari', ''], ['Nakov', 'Preslav', ''], ['Kan', 'Min-Yen', '']]","['Disinformation', 'Fake News', 'Social Networks', 'Graph Neural Networks', 'Representation Learning']"
10138,2007.05046,Sahar Mehrpour,"Sahar Mehrpour, Thomas D. LaToza, Hamed Sarvari",RulePad: Interactive Authoring of Checkable Design Rules,,,10.1145/3368089.3409751,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Good documentation offers the promise of enabling developers to easily
understand design decisions. Unfortunately, in practice, design documents are
often rarely updated, becoming inaccurate, incomplete, and untrustworthy. A
better solution is to enable developers to write down design rules which are
checked against code for consistency. But existing rule checkers require
learning specialized query languages or program analysis frameworks, creating a
barrier to writing project-specific rules. We introduce two new techniques for
authoring design rules: snippet-based authoring and semi-natural-language
authoring. In snippet-based authoring, developers specify characteristics of
elements to match by writing partial code snippets. In semi-natural language
authoring, a textual representation offers a representation for understanding
design rules and resolving ambiguities. We implemented these approaches in
RulePad. To evaluate RulePad, we conducted a between-subjects study with 14
participants comparing RulePad to the PMD Designer, a utility for writing rules
in a popular rule checker. We found that those with RulePad were able to
successfully author 13 times more query elements in significantly less time and
reported being significantly more willing to use RulePad in their everyday
work.
","[{'version': 'v1', 'created': 'Thu, 9 Jul 2020 19:54:49 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Nov 2021 23:05:48 GMT'}]",2021-11-25,"[['Mehrpour', 'Sahar', ''], ['LaToza', 'Thomas D.', ''], ['Sarvari', 'Hamed', '']]","['design rules', 'documentation', 'programming tools', 'bug finding', 'staticanalysis']"
10139,2003.08137,Jinfeng Li,Xinyi Guo and Jinfeng Li,"A Novel Twitter Sentiment Analysis Model with Baseline Correlation for
  Financial Market Prediction with Improved Efficiency","2019 Sixth IEEE International Conference on Social Networks Analysis,
  Management and Security (SNAMS)","Proceedings of 2019 Sixth IEEE International Conference on Social
  Networks Analysis, Management and Security (SNAMS), Granada, Spain, 2019, pp.
  472-477",10.1109/SNAMS.2019.8931720,,cs.SI cs.LG q-fin.ST,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel social networks sentiment analysis model is proposed based on Twitter
sentiment score (TSS) for real-time prediction of the future stock market price
FTSE 100, as compared with conventional econometric models of investor
sentiment based on closed-end fund discount (CEFD). The proposed TSS model
features a new baseline correlation approach, which not only exhibits a decent
prediction accuracy, but also reduces the computation burden and enables a fast
decision making without the knowledge of historical data. Polynomial
regression, classification modelling and lexicon-based sentiment analysis are
performed using R. The obtained TSS predicts the future stock market trend in
advance by 15 time samples (30 working hours) with an accuracy of 67.22% using
the proposed baseline criterion without referring to historical TSS or market
data. Specifically, TSS's prediction performance of an upward market is found
far better than that of a downward market. Under the logistic regression and
linear discriminant analysis, the accuracy of TSS in predicting the upward
trend of the future market achieves 97.87%.
","[{'version': 'v1', 'created': 'Wed, 18 Mar 2020 10:33:23 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Apr 2020 22:42:13 GMT'}]",2020-04-23,"[['Guo', 'Xinyi', ''], ['Li', 'Jinfeng', '']]","['Twitter sentiment', 'financial prediction', 'closed']"
10140,1805.01881,Valmir C. Barbosa,"Guilherme I. Ricardo, Jos\'e F. de Rezende, Valmir C. Barbosa","Scheduling wireless links in the physical interference model by
  fractional edge coloring",This version updates metadata,"IEEE Wireless Communications Letters 9 (2020), 528-532",10.1109/LWC.2019.2961361,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of scheduling the links of wireless mesh networks for
capacity maximization in the physical interference model. We represent such a
network by an undirected graph $G$, with vertices standing for network nodes
and edges for links. We define network capacity to be
$1/\chi'^*_\mathrm{phys}(G)$, where $\chi'^*_\mathrm{phys}(G)$ is a novel
edge-chromatic indicator of $G$, one that modifies the notion of $G$'s
fractional chromatic index. This index asks that the edges of $G$ be covered by
matchings in a certain optimal way. The new indicator does the same, but
requires additionally that the matchings used be all feasible in the sense of
the physical interference model. Sometimes the resulting optimal covering of
$G$'s edge set by feasible matchings is simply a partition of the edge set. In
such cases, the index $\chi'^*_\mathrm{phys}(G)$ becomes the particular case
that we denote by $\chi'_\mathrm{phys}(G)$, a similar modification of $G$'s
well-known chromatic index. We formulate the exact computation of
$\chi'^*_\mathrm{phys}(G)$ as a linear programming problem, which we solve for
an extensive collection of random geometric graphs used to instantiate networks
in the physical interference model. We have found that, depending on node
density (number of nodes per unit deployment area), often $G$ is such that
$\chi'^*_\mathrm{phys}(G)<\chi'_\mathrm{phys}(G)$. This bespeaks the
possibility of increased network capacity by virtue of simply defining it so
that edges are colored in the fractional, rather than the integer, sense.
","[{'version': 'v1', 'created': 'Fri, 4 May 2018 17:52:21 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Aug 2018 10:20:30 GMT'}, {'version': 'v3', 'created': 'Wed, 14 Nov 2018 09:09:53 GMT'}, {'version': 'v4', 'created': 'Fri, 31 May 2019 12:15:53 GMT'}, {'version': 'v5', 'created': 'Wed, 26 Jun 2019 17:49:17 GMT'}, {'version': 'v6', 'created': 'Thu, 12 Dec 2019 17:43:21 GMT'}]",2020-09-04,"[['Ricardo', 'Guilherme I.', ''], ['de Rezende', 'José F.', ''], ['Barbosa', 'Valmir C.', '']]","['Wireless mesh networks', 'Link scheduling', 'Physical interference model', 'Edge coloring', 'Fractional edge coloring']"
10141,1807.09766,Mariya Shyshkina,Mariya Shyshkina,"The General Model of the Cloud-based Learning and Research Environment
  of Educational Personnel Training",arXiv admin note: text overlap with arXiv:1807.08560,"This is a preprint of a paper published in: Teaching and Learning
  in a Digital World. - Proceedings of ICL2017. - Eds: M.E.Auer, D.Guralnick,
  I.Simonics. The final version at:
  https://doi.org/10.1007/978-3-319-73210-7_94",10.1007/978-3-319-73210-7_94,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The article highlights the promising ways of providing access to the
cloud-based learning and research software in higher educational institutions.
It is emphasized that the cloud computing services implementation is the actual
trend of modern ICT pedagogical systems development. The analysis and
evaluation of existing experience and educational research of different types
of software packages use are proposed. The general model of formation and
development of the cloud-based learning and research environment of educational
personnel training is substantiated. The reasonable ways of methods selection
on the basis of the proposed model are considered and the prospects for their
use in educational systems of higher education are described. The analysis and
assessment of the prospects of the cloud-based educational and research
environment development is fulfilled.
","[{'version': 'v1', 'created': 'Wed, 25 Jul 2018 15:40:53 GMT'}]",2018-07-27,"[['Shyshkina', 'Mariya', '']]","['Cloud computing', 'cloud-based learning environment', 'cloud services', 'design', 'model', 'openness', 'flexibility']"
10142,1911.04559,Anirban Das,Anirban Das and Thomas Brunschwiler,"Privacy is What We Care About: Experimental Investigation of Federated
  Learning on Edge Devices","Accepted in ACM AIChallengeIoT 2019, New York, USA",,10.1145/3363347.3363365,,cs.LG cs.DC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Federated Learning enables training of a general model through edge devices
without sending raw data to the cloud. Hence, this approach is attractive for
digital health applications, where data is sourced through edge devices and
users care about privacy. Here, we report on the feasibility to train deep
neural networks on the Raspberry Pi4s as edge devices. A CNN, a LSTM and a MLP
were successfully trained on the MNIST data-set. Further, federated learning is
demonstrated experimentally on IID and non-IID samples in a parametric study,
to benchmark the model convergence. The weight updates from the workers are
shared with the cloud to train the general model through federated learning.
With the CNN and the non-IID samples a test-accuracy of up to 85% could be
achieved within a training time of 2 minutes, while exchanging less than $10$
MB data per device. In addition, we discuss federated learning from an use-case
standpoint, elaborating on privacy risks and labeling requirements for the
application of emotion detection from sound. Based on the experimental
findings, we discuss possible research directions to improve model and system
performance. Finally, we provide best practices for a practitioner, considering
the implementation of federated learning.
","[{'version': 'v1', 'created': 'Mon, 11 Nov 2019 20:44:03 GMT'}]",2019-11-13,"[['Das', 'Anirban', ''], ['Brunschwiler', 'Thomas', '']]","['federated learning', 'privacy preserving', 'edge computing']"
10143,2106.10776,Matthias Grabmair,"Zihan Huang, Charles Low, Mengqiu Teng, Hongyi Zhang, Daniel E. Ho,
  Mark S. Krass, Matthias Grabmair",Context-Aware Legal Citation Recommendation using Deep Learning,"10 pages published in Proceedings of ICAIL 2021; link to data here:
  https://reglab.stanford.edu/data/bva-case-citation-dataset ; code available
  here: https://github.com/TUMLegalTech/bva-citation-prediction",,10.1145/3462757.3466066,,cs.IR cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Lawyers and judges spend a large amount of time researching the proper legal
authority to cite while drafting decisions. In this paper, we develop a
citation recommendation tool that can help improve efficiency in the process of
opinion drafting. We train four types of machine learning models, including a
citation-list based method (collaborative filtering) and three context-based
methods (text similarity, BiLSTM and RoBERTa classifiers). Our experiments show
that leveraging local textual context improves recommendation, and that deep
neural models achieve decent performance. We show that non-deep text-based
methods benefit from access to structured case metadata, but deep models only
benefit from such access when predicting from context of insufficient length.
We also find that, even after extensive training, RoBERTa does not outperform a
recurrent neural model, despite its benefits of pretraining. Our behavior
analysis of the RoBERTa model further shows that predictive performance is
stable across time and citation classes.
","[{'version': 'v1', 'created': 'Sun, 20 Jun 2021 23:23:11 GMT'}]",2021-06-22,"[['Huang', 'Zihan', ''], ['Low', 'Charles', ''], ['Teng', 'Mengqiu', ''], ['Zhang', 'Hongyi', ''], ['Ho', 'Daniel E.', ''], ['Krass', 'Mark S.', ''], ['Grabmair', 'Matthias', '']]","['citation recommendation', 'citation normalization', 'legal text', 'legalopinion drafting', 'neural natural language processing']"
10144,2207.01137,Eleanor Loh,"Eleanor Loh, Jalaj Khandelwal, Brian Regan, Duncan A. Little","Promotheus: An End-to-End Machine Learning Framework for Optimizing
  Markdown in Online Fashion E-commerce",11 pages; Accepted at KDD 2022,,10.1145/3534678.3539148,,cs.AI econ.GN q-fin.EC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Managing discount promotional events (""markdown"") is a significant part of
running an e-commerce business, and inefficiencies here can significantly
hamper a retailer's profitability. Traditional approaches for tackling this
problem rely heavily on price elasticity modelling. However, the partial
information nature of price elasticity modelling, together with the
non-negotiable responsibility for protecting profitability, mean that machine
learning practitioners must often go through great lengths to define strategies
for measuring offline model quality. In the face of this, many retailers fall
back on rule-based methods, thus forgoing significant gains in profitability
that can be captured by machine learning. In this paper, we introduce two novel
end-to-end markdown management systems for optimising markdown at different
stages of a retailer's journey. The first system, ""Ithax"", enacts a rational
supply-side pricing strategy without demand estimation, and can be usefully
deployed as a ""cold start"" solution to collect markdown data while maintaining
revenue control. The second system, ""Promotheus"", presents a full framework for
markdown optimization with price elasticity. We describe in detail the specific
modelling and validation procedures that, within our experience, have been
crucial to building a system that performs robustly in the real world. Both
markdown systems achieve superior profitability compared to decisions made by
our experienced operations teams in a controlled online test, with improvements
of 86% (Promotheus) and 79% (Ithax) relative to manual strategies. These
systems have been deployed to manage markdown at ASOS.com, and both systems can
be fruitfully deployed for price optimization across a wide variety of retail
e-commerce settings.
","[{'version': 'v1', 'created': 'Sun, 3 Jul 2022 22:38:01 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Aug 2022 11:53:24 GMT'}]",2022-08-15,"[['Loh', 'Eleanor', ''], ['Khandelwal', 'Jalaj', ''], ['Regan', 'Brian', ''], ['Little', 'Duncan A.', '']]","['Dynamic pricing', 'e-commerce', 'markdown optimization']"
10145,1806.03674,Ofer Shir,Ofer M. Shir and Amir Yehudayoff,On the Covariance-Hessian Relation in Evolution Strategies,,,10.1016/j.tcs.2019.09.002,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider Evolution Strategies operating only with isotropic Gaussian
mutations on positive quadratic objective functions, and investigate the
covariance matrix when constructed out of selected individuals by truncation.
We prove that the covariance matrix over $(1,\lambda)$-selected decision
vectors becomes proportional to the inverse of the landscape Hessian as the
population-size $\lambda$ increases. This generalizes a previous result that
proved an equivalent phenomenon when sampling was assumed to take place in the
vicinity of the optimum. It further confirms the classical hypothesis that
statistical learning of the landscape is an inherent characteristic of standard
Evolution Strategies, and that this distinguishing capability stems only from
the usage of isotropic Gaussian mutations and rank-based selection. We provide
broad numerical validation for the proven results, and present empirical
evidence for its generalization to $(\mu,\lambda)$-selection.
","[{'version': 'v1', 'created': 'Sun, 10 Jun 2018 15:30:10 GMT'}, {'version': 'v2', 'created': 'Sun, 27 Oct 2019 16:51:45 GMT'}]",2019-10-29,"[['Shir', 'Ofer M.', ''], ['Yehudayoff', 'Amir', '']]","['Theory of evolution strategies', 'statistical learning', 'landscape Hessian', 'covariance matrix', 'inverserelation']"
10146,2204.10631,Julio A. Placed Perales,Julio A. Placed and Jos\'e A. Castellanos,"Enough is Enough: Towards Autonomous Uncertainty-driven Stopping
  Criteria",11th IFAC Symposium on Intelligent Autonomous Vehicles,,10.1016/j.ifacol.2022.07.594,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autonomous robotic exploration has long attracted the attention of the
robotics community and is a topic of high relevance. Deploying such systems in
the real world, however, is still far from being a reality. In part, it can be
attributed to the fact that most research is directed towards improving
existing algorithms and testing novel formulations in simulation environments
rather than addressing practical issues of real-world scenarios. This is the
case of the fundamental problem of autonomously deciding when exploration has
to be terminated or changed (stopping criteria), which has not received any
attention recently. In this paper, we discuss the importance of using
appropriate stopping criteria and analyse the behaviour of a novel criterion
based on the evolution of optimality criteria in active graph-SLAM.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2022 10:53:42 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Aug 2022 07:22:07 GMT'}]",2022-08-17,"[['Placed', 'Julio A.', ''], ['Castellanos', 'José A.', '']]","['Active SLAM', 'autonomous exploration', 'stopping criteria', 'decision making', 'graph-SLAM']"
10147,2005.06598,Amir Javadpour,Amir Javadpour,"An Optimize-Aware Target Tracking Method with Combine MAC layer and
  Active Nodes in Wireless Sensor Networks",,,10.1007/s11277-019-06425-8,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless Sensor Network WSN is consisted of nodes with different sizes and a
specific goal. Tracking applications are very important in WSNs. This study
proposes a method for reducing energy consumption in WSNs, considering target
tracking. A prediction method is also presented with the help of MAC Medium
Access Control layer in which a few number of nodes are in active mode to track
the target while the rest of the nodes are switched into sleeping mode. Energy
consumption was reduced by decreasing the number of nodes involved in target
tracking and activating merely a limited number of necessary nodes. The
conducted experiments suggest that the proposed algorithm has a much better
performance compared to similar algorithms in different conditions, including
energy consumption in different communication ranges, effect of the number of
nodes on energy consumption, the number of nodes involved in tracking in terms
of communication range, and losing the target. This means the proposed method
is superior and more efficient. When the target enters the simulation area,
nodes of the network identify the target node through the proposed method
(which is the optimum method) and track it as long as it is inside the
simulation area. Performance criteria, including energy, other nodes, and
throughput were used in simulation. The results showed that the proposed method
has the optimum performance and reduces energy consumption of the network
during tracking. The results of the simulation showed that the proposed method
reduces energy consumption to an acceptable extent, compared to previous
methods, in addition to increasing the accuracy of target tracking. Keywords:
Active nodes, MAC layer, Energy efficiency, Target tracking, Wireless sensor
networks, Target tracking.
","[{'version': 'v1', 'created': 'Tue, 21 Apr 2020 00:57:06 GMT'}]",2020-05-15,"[['Javadpour', 'Amir', '']]","['Active nodes', 'MAC layer', 'Energy efficiency', 'Target tracking', 'Wireless sensor networks', 'Target tracking']"
10148,2104.03829,Abhijit Guha Roy,"Abhijit Guha Roy, Jie Ren, Shekoofeh Azizi, Aaron Loh, Vivek
  Natarajan, Basil Mustafa, Nick Pawlowski, Jan Freyberg, Yuan Liu, Zach
  Beaver, Nam Vo, Peggy Bui, Samantha Winter, Patricia MacWilliams, Greg S.
  Corrado, Umesh Telang, Yun Liu, Taylan Cemgil, Alan Karthikesalingam, Balaji
  Lakshminarayanan, Jim Winkens","Does Your Dermatology Classifier Know What It Doesn't Know? Detecting
  the Long-Tail of Unseen Conditions","Under Review, 19 Pages",Medical Image Analysis (2022),10.1016/j.media.2021.102274,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  We develop and rigorously evaluate a deep learning based system that can
accurately classify skin conditions while detecting rare conditions for which
there is not enough data available for training a confident classifier. We
frame this task as an out-of-distribution (OOD) detection problem. Our novel
approach, hierarchical outlier detection (HOD) assigns multiple abstention
classes for each training outlier class and jointly performs a coarse
classification of inliers vs. outliers, along with fine-grained classification
of the individual classes. We demonstrate the effectiveness of the HOD loss in
conjunction with modern representation learning approaches (BiT, SimCLR, MICLe)
and explore different ensembling strategies for further improving the results.
We perform an extensive subgroup analysis over conditions of varying risk
levels and different skin types to investigate how the OOD detection
performance changes over each subgroup and demonstrate the gains of our
framework in comparison to baselines. Finally, we introduce a cost metric to
approximate downstream clinical impact. We use this cost metric to compare the
proposed method against a baseline system, thereby making a stronger case for
the overall system effectiveness in a real-world deployment scenario.
","[{'version': 'v1', 'created': 'Thu, 8 Apr 2021 15:15:22 GMT'}]",2022-03-31,"[['Roy', 'Abhijit Guha', ''], ['Ren', 'Jie', ''], ['Azizi', 'Shekoofeh', ''], ['Loh', 'Aaron', ''], ['Natarajan', 'Vivek', ''], ['Mustafa', 'Basil', ''], ['Pawlowski', 'Nick', ''], ['Freyberg', 'Jan', ''], ['Liu', 'Yuan', ''], ['Beaver', 'Zach', ''], ['Vo', 'Nam', ''], ['Bui', 'Peggy', ''], ['Winter', 'Samantha', ''], ['MacWilliams', 'Patricia', ''], ['Corrado', 'Greg S.', ''], ['Telang', 'Umesh', ''], ['Liu', 'Yun', ''], ['Cemgil', 'Taylan', ''], ['Karthikesalingam', 'Alan', ''], ['Lakshminarayanan', 'Balaji', ''], ['Winkens', 'Jim', '']]","['Deep learning', 'dermatology', 'ensembles', 'long-tailed recognition', 'out-of-distribution detection', 'outlierexposure', 'representation learning']"
10149,2111.07145,Ajoy Mondal Dr.,Ajoy Mondal,New Performance Measures for Object Tracking under Complex Environments,,,10.1007/s00530-021-00775-9.pdf,,cs.CV cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Various performance measures based on the ground truth and without ground
truth exist to evaluate the quality of a developed tracking algorithm. The
existing popular measures - average center location error (ACLE) and average
tracking accuracy (ATA) based on ground truth, may sometimes create confusion
to quantify the quality of a developed algorithm for tracking an object under
some complex environments (e.g., scaled or oriented or both scaled and oriented
object). In this article, we propose three new auxiliary performance measures
based on ground truth information to evaluate the quality of a developed
tracking algorithm under such complex environments. Moreover, one performance
measure is developed by combining both two existing measures ACLE and ATA and
three new proposed measures for better quantifying the developed tracking
algorithm under such complex conditions. Some examples and experimental results
conclude that the proposed measure is better than existing measures to quantify
one developed algorithm for tracking objects under such complex environments.
","[{'version': 'v1', 'created': 'Sat, 13 Nov 2021 16:32:42 GMT'}]",2021-11-16,"[['Mondal', 'Ajoy', '']]","['Tracking', 'evaluation', 'performance measure', 'scale', 'orientation andcomplex environment']"
10150,1910.08462,Damien Rohmer,"Adrien Nivaggioli (LIX), Damien Rohmer (LIX)",Animation Synthesis Triggered by Vocal Mimics,,"Motion, Interaction and Games, Oct 2019, Newcastle, United Kingdom",10.1145/3359566.3360067,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a method leveraging the naturally time-related expressivity of our
voice to control an animation composed of a set of short events. The user
records itself mimicking onomatopoeia sounds such as ""Tick"", ""Pop"", or ""Chhh""
which are associated with specific animation events. The recorded soundtrack is
automatically analyzed to extract every instant and types of sounds. We finally
synthesize an animation where each event type and timing correspond with the
soundtrack. In addition to being a natural way to control animation timing, we
demonstrate that multiple stories can be efficiently generated by recording
different voice sequences. Also, the use of more than one soundtrack allows us
to control different characters with overlapping actions.
","[{'version': 'v1', 'created': 'Fri, 18 Oct 2019 15:15:09 GMT'}]",2019-10-21,"[['Nivaggioli', 'Adrien', '', 'LIX'], ['Rohmer', 'Damien', '', 'LIX']]","['Sound-Driven Animation', 'Voice', 'Timing']"
10151,2001.02659,Paul He,"Yannick Zakowski, Paul He, Chung-Kil Hur, Steve Zdancewic","An Equational Theory for Weak Bisimulation via Generalized Parameterized
  Coinduction",To be published in CPP 2020,,10.1145/3372885.3373813,,cs.PL cs.LO,http://creativecommons.org/licenses/by/4.0/,"  Coinductive reasoning about infinitary structures such as streams is widely
applicable. However, practical frameworks for developing coinductive proofs and
finding reasoning principles that help structure such proofs remain a
challenge, especially in the context of machine-checked formalization.
  This paper gives a novel presentation of an equational theory for reasoning
about structures up to weak bisimulation. The theory is both compositional,
making it suitable for defining general-purpose lemmas, and also incremental,
meaning that the bisimulation can be created interactively. To prove the
theory's soundness, this paper also introduces generalized parameterized
coinduction, which addresses expressivity problems of earlier works and
provides a practical framework for coinductive reasoning. The paper presents
the resulting equational theory for streams, but the technique applies to other
structures too.
  All of the results in this paper have been proved in Coq, and the generalized
parameterized coinduction framework is available as a Coq library.
","[{'version': 'v1', 'created': 'Wed, 8 Jan 2020 18:03:10 GMT'}]",2020-01-13,"[['Zakowski', 'Yannick', ''], ['He', 'Paul', ''], ['Hur', 'Chung-Kil', ''], ['Zdancewic', 'Steve', '']]","['Coq', 'coinduction', 'up-to techniques', 'weak bisimulation', 'equational theory']"
10152,2111.11213,Zhiqiang Cai,Zhiqiang Cai and Ling Lin and Xiang Zhou,Learn Quasi-stationary Distributions of Finite State Markov Chain,"18 pages, 5 figures","Entropy, 2022, 24(1): 133",10.3390/e24010133,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  We propose a reinforcement learning (RL) approach to compute the expression
of quasi-stationary distribution. Based on the fixed-point formulation of
quasi-stationary distribution, we minimize the KL-divergence of two Markovian
path distributions induced by the candidate distribution and the true target
distribution. To solve this challenging minimization problem by gradient
descent, we apply the reinforcement learning technique by introducing the
reward and value functions. We derive the corresponding policy gradient theorem
and design an actor-critic algorithm to learn the optimal solution and the
value function. The numerical examples of finite state Markov chain are tested
to demonstrate the new method.
","[{'version': 'v1', 'created': 'Fri, 19 Nov 2021 02:56:34 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Jan 2022 02:53:38 GMT'}]",2022-09-14,"[['Cai', 'Zhiqiang', ''], ['Lin', 'Ling', ''], ['Zhou', 'Xiang', '']]","['quasi-stationary distribution', 'reinforcement learning', 'KL-divergence', 'actor-critic algorithm']"
10153,2104.12760,Alexander Rucker,"Alexander Rucker, Matthew Vilim, Tian Zhao, Yaqi Zhang, Raghu
  Prabhakar, Kunle Olukotun",Capstan: A Vector RDA for Sparsity,,,10.1145/3466752.3480047,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes Capstan: a scalable, parallel-patterns-based,
reconfigurable dataflow accelerator (RDA) for sparse and dense tensor
applications. Instead of designing for one application, we start with common
sparse data formats, each of which supports multiple applications. Using a
declarative programming model, Capstan supports application-independent sparse
iteration and memory primitives that can be mapped to vectorized,
high-performance hardware. We optimize random-access sparse memories with
configurable out-of-order execution to increase SRAM random-access throughput
from 32% to 80%.
  For a variety of sparse applications, Capstan with DDR4 memory is 18x faster
than a multi-core CPU baseline, while Capstan with HBM2 memory is 16x faster
than an Nvidia V100 GPU. For sparse applications that can be mapped to
Plasticine, a recent dense RDA, Capstan is 7.6x to 365x faster and only 16%
larger.
","[{'version': 'v1', 'created': 'Mon, 26 Apr 2021 17:52:23 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Sep 2021 01:10:59 GMT'}]",2021-09-24,"[['Rucker', 'Alexander', ''], ['Vilim', 'Matthew', ''], ['Zhao', 'Tian', ''], ['Zhang', 'Yaqi', ''], ['Prabhakar', 'Raghu', ''], ['Olukotun', 'Kunle', '']]","['reconfigurable dataflow accelerator', 'RDA', 'CGRA', 'parallel patterns', 'sparsity', 'sparse iteration', 'vectorization']"
10154,1908.10172,"Mert B\""ulent Sar{\i}y{\i}ld{\i}z","Mert B\""ulent Sar{\i}y{\i}ld{\i}z, Ramazan G\""okberk Cinbi\c{s}, Erman
  Ayday",Key Protected Classification for Collaborative Learning,Accepted to Pattern Recognition,,10.1016/j.patcog.2020.107327,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Large-scale datasets play a fundamental role in training deep learning
models. However, dataset collection is difficult in domains that involve
sensitive information. Collaborative learning techniques provide a
privacy-preserving solution, by enabling training over a number of private
datasets that are not shared by their owners. However, recently, it has been
shown that the existing collaborative learning frameworks are vulnerable to an
active adversary that runs a generative adversarial network (GAN) attack. In
this work, we propose a novel classification model that is resilient against
such attacks by design. More specifically, we introduce a key-based
classification model and a principled training scheme that protects class
scores by using class-specific private keys, which effectively hide the
information necessary for a GAN attack. We additionally show how to utilize
high dimensional keys to improve the robustness against attacks without
increasing the model complexity. Our detailed experiments demonstrate the
effectiveness of the proposed technique. Source code is available at
https://github.com/mbsariyildiz/key-protected-classification.
","[{'version': 'v1', 'created': 'Tue, 27 Aug 2019 13:00:30 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Apr 2020 09:31:45 GMT'}]",2020-04-23,"[['Sarıyıldız', 'Mert Bülent', ''], ['Cinbiş', 'Ramazan Gökberk', ''], ['Ayday', 'Erman', '']]","['privacy-preserving machine learning', 'collaborative learning', 'classification', 'generative adversarial networks']"
10155,1702.05723,Daniel M\'endez Fern\'andez,Marco Kuhrmann and Daniel M\'endez Fern\'andez,"From Pragmatic to Systematic Software Process Improvement: An Evaluated
  Approach","IET Software, 2015",,10.1049/iet-sen.2014.0190,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software processes improvement (SPI) is a challenging task, as many different
stakeholders, project settings, and contexts and goals need to be considered.
SPI projects are often operated in a complex and volatile environment and,
thus, require a sound management that is resource-intensive requiring many
stakeholders to contribute to the process assessment, analysis, design,
realisation, and deployment. Although there exist many valuable SPI approaches,
none address the needs of both process engineers and project managers. This
article presents an Artefact-based Software Process Improvement & Management
approach (ArSPI) that closes this gap. ArSPI was developed and tested across
several SPI projects in large organisations in Germany and Eastern Europe. The
approach further encompasses a template for initiating, performing, and
managing SPI projects by defining a set of 5 key artefacts and 24 support
artefacts. We present ArSPI and discus results of its validation indicating
ArSPI to be a helpful instrument to set up and steer SPI projects.
","[{'version': 'v1', 'created': 'Sun, 19 Feb 2017 08:43:07 GMT'}]",2017-02-21,"[['Kuhrmann', 'Marco', ''], ['Fernández', 'Daniel Méndez', '']]","['Software Process Improvement', 'Software Process Management', 'Artefact Orientation']"
10156,2008.02769,Philipp Schepper,Philipp Schepper,"Fine-Grained Complexity of Regular Expression Pattern Matching and
  Membership","Full version of the paper accepted at ESA 2020; v2: typos and
  reference to conference version corrected",,10.4230/LIPIcs.ESA.2020.80,,cs.CC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The currently fastest algorithm for regular expression pattern matching and
membership improves the classical O(nm) time algorithm by a factor of about
log^{3/2}n. Instead of focussing on general patterns we analyse homogeneous
patterns of bounded depth in this work. For them a classification splitting the
types in easy (strongly sub-quadratic) and hard (essentially quadratic time
under SETH) is known. We take a very fine-grained look at the hard pattern
types from this classification and show a dichotomy: few types allow
super-poly-logarithmic improvements while the algorithms for the other pattern
types can only be improved by a constant number of log-factors, assuming the
Formula-SAT Hypothesis.
","[{'version': 'v1', 'created': 'Thu, 6 Aug 2020 17:13:58 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Sep 2020 15:02:20 GMT'}]",2020-09-22,"[['Schepper', 'Philipp', '']]","['Fine-Grained Complexity', 'Regular Expression', 'Pattern Matching', 'Dichotomy']"
10157,2203.06498,Jessica Hullman,"Jessica Hullman, Sayash Kapoor, Priyanka Nanayakkara, Andrew Gelman,
  and Arvind Narayanan","The worst of both worlds: A comparative analysis of errors in learning
  from data in psychology and machine learning",,,10.1145/3514094.3534196,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Recent arguments that machine learning (ML) is facing a reproducibility and
replication crisis suggest that some published claims in ML research cannot be
taken at face value. These concerns inspire analogies to the replication crisis
affecting the social and medical sciences. They also inspire calls for the
integration of statistical approaches to causal inference and predictive
modeling. A deeper understanding of what reproducibility concerns in supervised
ML research have in common with the replication crisis in experimental science
puts the new concerns in perspective, and helps researchers avoid ""the worst of
both worlds,"" where ML researchers begin borrowing methodologies from
explanatory modeling without understanding their limitations and vice versa. We
contribute a comparative analysis of concerns about inductive learning that
arise in causal attribution as exemplified in psychology versus predictive
modeling as exemplified in ML. We identify themes that re-occur in reform
discussions, like overreliance on asymptotic theory and non-credible beliefs
about real-world data generating processes. We argue that in both fields,
claims from learning are implied to generalize outside the specific environment
studied (e.g., the input dataset or subject sample, modeling implementation,
etc.) but are often impossible to refute due to undisclosed sources of variance
in the learning pipeline. In particular, errors being acknowledged in ML expose
cracks in long-held beliefs that optimizing predictive accuracy using huge
datasets absolves one from having to consider a true data generating process or
formally represent uncertainty in performance claims. We conclude by discussing
risks that arise when sources of errors are misdiagnosed and the need to
acknowledge the role of human inductive biases in learning and reform.
","[{'version': 'v1', 'created': 'Sat, 12 Mar 2022 18:26:24 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Mar 2022 14:47:19 GMT'}, {'version': 'v3', 'created': 'Sun, 27 Mar 2022 18:17:43 GMT'}, {'version': 'v4', 'created': 'Wed, 6 Apr 2022 17:14:08 GMT'}, {'version': 'v5', 'created': 'Fri, 15 Apr 2022 19:41:11 GMT'}, {'version': 'v6', 'created': 'Sun, 22 May 2022 17:44:57 GMT'}, {'version': 'v7', 'created': 'Tue, 24 May 2022 18:34:56 GMT'}, {'version': 'v8', 'created': 'Thu, 2 Jun 2022 16:26:22 GMT'}]",2022-06-03,"[['Hullman', 'Jessica', ''], ['Kapoor', 'Sayash', ''], ['Nanayakkara', 'Priyanka', ''], ['Gelman', 'Andrew', ''], ['Narayanan', 'Arvind', '']]","['Machine learning', 'replication', 'science reform', 'generalizability']"
10158,2207.01201,Fernando Giner Mr.,Fernando Giner,On the Effect of Ranking Axioms on IR Evaluation Metrics,"10 pages. Part of proceedings of the 2022 ACM SIGIR International
  Conference on the Theory of Information Retrieval",,10.1145/3539813.3545153,,cs.IR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The study of IR evaluation metrics through axiomatic analysis enables a
better understanding of their numerical properties. Some works have modelled
the effectiveness of retrieval metrics with axioms that capture desirable
properties on the set of rankings of documents. This paper formally explores
the effect of these ranking axioms on the numerical values of some IR
evaluation metrics. It focuses on the set of ranked lists of documents with
multigrade relevance. The possible orderings in this set are derived from three
commonly accepted ranking axioms on retrieval metrics; then, they are
classified by their latticial properties. When relevant documents are
prioritised, a subset of document rankings are identified: the join-irreducible
elements, which have some resemblance to the concept of basis in vector space.
It is possible to compute the precision, recall, RBP or DCG values of any
ranking from their values in the join-irreducible elements. However this is not
the case when the swapping of documents is considered.
","[{'version': 'v1', 'created': 'Mon, 4 Jul 2022 05:06:40 GMT'}]",2022-07-05,"[['Giner', 'Fernando', '']]","['information retrieval', 'evaluation metric', 'lattice theory']"
10159,2212.14569,Prafful Kumar Khoba,"Prafful Kumar Khoba, Chirag Parikh, Rohit Saluja, Ravi Kiran
  Sarvadevabhatla, C. V. Jawahar",A Fine-Grained Vehicle Detection (FGVD) Dataset for Unconstrained Roads,,,10.1145/3571600.3571626,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The previous fine-grained datasets mainly focus on classification and are
often captured in a controlled setup, with the camera focusing on the objects.
We introduce the first Fine-Grained Vehicle Detection (FGVD) dataset in the
wild, captured from a moving camera mounted on a car. It contains 5502 scene
images with 210 unique fine-grained labels of multiple vehicle types organized
in a three-level hierarchy. While previous classification datasets also include
makes for different kinds of cars, the FGVD dataset introduces new class labels
for categorizing two-wheelers, autorickshaws, and trucks. The FGVD dataset is
challenging as it has vehicles in complex traffic scenarios with intra-class
and inter-class variations in types, scale, pose, occlusion, and lighting
conditions. The current object detectors like yolov5 and faster RCNN perform
poorly on our dataset due to a lack of hierarchical modeling. Along with
providing baseline results for existing object detectors on FGVD Dataset, we
also present the results of a combination of an existing detector and the
recent Hierarchical Residual Network (HRN) classifier for the FGVD task.
Finally, we show that FGVD vehicle images are the most challenging to classify
among the fine-grained datasets.
","[{'version': 'v1', 'created': 'Fri, 30 Dec 2022 06:50:15 GMT'}]",2023-01-02,"[['Khoba', 'Prafful Kumar', ''], ['Parikh', 'Chirag', ''], ['Saluja', 'Rohit', ''], ['Sarvadevabhatla', 'Ravi Kiran', ''], ['Jawahar', 'C. V.', '']]","['Fine-grained', 'detection', 'dataset', 'unconstrained roads', 'gradcam']"
10160,2007.10903,Sebastian Dunzer,"Sebastian Dunzer, Matthias Stierle, Martin Matzner, Stephan Baier",Conformance checking: A state-of-the-art literature review,,,10.1145/3329007.3329014,,cs.SE cs.IR,http://creativecommons.org/licenses/by-sa/4.0/,"  Conformance checking is a set of process mining functions that compare
process instances with a given process model. It identifies deviations between
the process instances' actual behaviour (""as-is"") and its modelled behaviour
(""to-be""). Especially in the context of analyzing compliance in organizations,
it is currently gaining momentum -- e.g. for auditors. Researchers have
proposed a variety of conformance checking techniques that are geared towards
certain process model notations or specific applications such as process model
evaluation. This article reviews a set of conformance checking techniques
described in 37 scholarly publications. It classifies the techniques along the
dimensions ""modelling language"", ""algorithm type"", ""quality metric"", and
""perspective"" using a concept matrix so that the techniques can be better
accessed by practitioners and researchers. The matrix highlights the dimensions
where extant research concentrates and where blind spots exist. For instance,
process miners use declarative process modelling languages often, but
applications in conformance checking are rare. Likewise, process mining can
investigate process roles or process metrics such as duration, but conformance
checking techniques narrow on analyzing control-flow. Future research may
construct techniques that support these neglected approaches to conformance
checking.
","[{'version': 'v1', 'created': 'Tue, 21 Jul 2020 15:48:41 GMT'}]",2020-07-22,"[['Dunzer', 'Sebastian', ''], ['Stierle', 'Matthias', ''], ['Matzner', 'Martin', ''], ['Baier', 'Stephan', '']]","['process mining', 'conformance checking', 'modelling languages', 'business process management', 'literature review']"
10161,2210.13013,Yu Jiang,"Yu Jiang, Tian Min, Sizheng Fan, Rongqi Tao, Wei Cai","Towards Understanding Player Behavior in Blockchain Games: A Case Study
  of Aavegotchi",,,10.1145/3555858.3555883,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Blockchain games introduce unique gameplay and incentive mechanisms by
allowing players to be rewarded with in-game assets or tokens through financial
activities. However, most blockchain games are not comparable to traditional
games in terms of lifespan and player engagement. In this paper, we try to see
the big picture in a small way to explore and determine the impact of gameplay
and financial factors on player behavior in blockchain games. Taking Aavegotchi
as an example, we collect one year of operation data to build player profiles.
We perform an in-depth analysis of player behavior from the macroscopic data
and apply an unsupervised clustering method to distinguish the attraction of
the gameplay and incentives. Our results reveal that the whole game is held up
by a small number of players with high-frequent interaction or vast amounts of
funds invested. Financial incentives are indispensable for blockchain games for
they provide attraction and optional ways for players to engage with the game.
However, financial services are tightly linked to the free market. The game
will face an irreversible loss of players when the market experiences
depression. For blockchain games, well-designed gameplay should be the
fundamental basis for the long-lasting retention of players.
","[{'version': 'v1', 'created': 'Mon, 24 Oct 2022 08:01:34 GMT'}]",2022-10-25,"[['Jiang', 'Yu', ''], ['Min', 'Tian', ''], ['Fan', 'Sizheng', ''], ['Tao', 'Rongqi', ''], ['Cai', 'Wei', '']]","['Blockchain games', 'player behavior', 'empirical study']"
10162,2301.07310,Jiangtao Gong,"Yudan Wu, Shanhe You, Zixuan Guo, Xiangyang Li, Guyue Zhou, Jiangtao
  Gong","MR.Brick: Designing A Remote Mixed-reality Educational Game System for
  Promoting Children's Social & Collaborative Skills","14 pages, 9 figures",CHI2023,10.1145/3544548.3581041,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Children are one of the groups most influenced by COVID-19-related social
distancing, and a lack of contact with peers can limit their opportunities to
develop social and collaborative skills. However, remote socialization and
collaboration as an alternative approach is still a great challenge for
children. This paper presents MR.Brick, a Mixed Reality (MR) educational game
system that helps children adapt to remote collaboration. A controlled
experimental study involving 24 children aged six to ten was conducted to
compare MR.Brick with the traditional video game by measuring their social and
collaborative skills and analyzing their multi-modal playing behaviours. The
results showed that MR.Brick was more conducive to children's remote
collaboration experience than the traditional video game. Given the lack of
training systems designed for children to collaborate remotely, this study may
inspire interaction design and educational research in related fields.
","[{'version': 'v1', 'created': 'Wed, 18 Jan 2023 05:14:57 GMT'}]",2023-01-19,"[['Wu', 'Yudan', ''], ['You', 'Shanhe', ''], ['Guo', 'Zixuan', ''], ['Li', 'Xiangyang', ''], ['Zhou', 'Guyue', ''], ['Gong', 'Jiangtao', '']]","['mixed reality', 'tangible user interface', 'remote collaboration', 'children', 'educational game', 'social and collaborative skill']"
10163,2201.09750,Bilge Celik,Bilge Celik and Prabhant Singh and Joaquin Vanschoren,Online AutoML: An adaptive AutoML framework for online learning,"25 pages, 8 figures. Machine Learning S.I.: Automating Data Science
  (2022)",,10.1007/s10994-022-06262-0,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated Machine Learning (AutoML) has been used successfully in settings
where the learning task is assumed to be static. In many real-world scenarios,
however, the data distribution will evolve over time, and it is yet to be shown
whether AutoML techniques can effectively design online pipelines in dynamic
environments. This study aims to automate pipeline design for online learning
while continuously adapting to data drift. For this purpose, we design an
adaptive Online Automated Machine Learning (OAML) system, searching the
complete pipeline configuration space of online learners, including
preprocessing algorithms and ensembling techniques. This system combines the
inherent adaptation capabilities of online learners with the fast automated
pipeline (re)optimization capabilities of AutoML. Focusing on optimization
techniques that can adapt to evolving objectives, we evaluate asynchronous
genetic programming and asynchronous successive halving to optimize these
pipelines continually. We experiment on real and artificial data streams with
varying types of concept drift to test the performance and adaptation
capabilities of the proposed system. The results confirm the utility of OAML
over popular online learning algorithms and underscore the benefits of
continuous pipeline redesign in the presence of data drift.
","[{'version': 'v1', 'created': 'Mon, 24 Jan 2022 15:37:20 GMT'}, {'version': 'v2', 'created': 'Tue, 10 May 2022 08:57:15 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Dec 2022 10:21:57 GMT'}]",2022-12-08,"[['Celik', 'Bilge', ''], ['Singh', 'Prabhant', ''], ['Vanschoren', 'Joaquin', '']]","['online automl', 'automated online learning', 'concept drift', 'automated drift adaptation']"
10164,2010.00354,Artur Sterz,"Artur Sterz, Matthias Eichholz, Ragnar Mogk, Lars Baumg\""artner, Pablo
  Graubner, Matthias Hollick, Mira Mezini, Bernd Freisleben",ReactiFi: Reactive Programming of Wi-Fi Firmware on Mobile Devices,,"The Art, Science, and Engineering of Programming, 2021, Vol. 5,
  Issue 2, Article 4",10.22152/programming-journal.org/2021/5/4,,cs.PL cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network programmability will be required to handle future increased network
traffic and constantly changing application needs. However, there is currently
no way of using a high-level, easy to use programming language to program Wi-Fi
firmware. This impedes rapid prototyping and deployment of novel network
services/applications and hinders continuous performance optimization in Wi-Fi
networks, since expert knowledge is required for both the used hardware
platforms and the Wi-Fi domain. In this paper, we present ReactiFi, a
high-level reactive programming language to program Wi-Fi chips on mobile
consumer devices. ReactiFi enables programmers to implement extensions of PHY,
MAC, and IP layer mechanisms without requiring expert knowledge of Wi-Fi chips,
allowing for novel applications and network protocols. ReactiFi programs are
executed directly on the Wi-Fi chip, improving performance and power
consumption compared to execution on the main CPU. ReactiFi is conceptually
similar to functional reactive languages, but is dedicated to the
domain-specific needs of Wi-Fi firmware. First, it handles low-level
platform-specific details without interfering with the core functionality of
Wi-Fi chips. Second, it supports static reasoning about memory usage of
applications, which is important for typically memory-constrained Wi-Fi chips.
Third, it limits dynamic changes of dependencies between computations to
dynamic branching, in order to enable static reasoning about the order of
computations. We evaluate ReactiFi empirically in two real-world case studies.
Our results show that throughput, latency, and power consumption are
significantly improved when executing applications on the Wi-Fi chip rather
than in the operating system kernel or in user space. Moreover, we show that
the high-level programming abstractions of ReactiFi have no performance
overhead compared to manually written C code.
","[{'version': 'v1', 'created': 'Thu, 1 Oct 2020 12:43:15 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Oct 2020 10:46:53 GMT'}, {'version': 'v3', 'created': 'Fri, 30 Oct 2020 14:54:30 GMT'}, {'version': 'v4', 'created': 'Thu, 4 Mar 2021 10:24:25 GMT'}]",2021-03-05,"[['Sterz', 'Artur', ''], ['Eichholz', 'Matthias', ''], ['Mogk', 'Ragnar', ''], ['Baumgärtner', 'Lars', ''], ['Graubner', 'Pablo', ''], ['Hollick', 'Matthias', ''], ['Mezini', 'Mira', ''], ['Freisleben', 'Bernd', '']]","['Wi-Fi Programming', 'Reactive Programming', 'Network Programming']"
10165,2201.13232,Rog\'erio Rossi,Rogerio Rossi and Pollyana Notagiarcomo,EXSeQETIC: Expert System to Support the Implementation of eQETIC Model,in Portuguese,"IEEE LATIN AMERICA TRANSACTIONS VOL. 13, NO. 9, SEPTEMBER 2015",10.1109/TLA.2015.7350059,,cs.CY cs.AI,http://creativecommons.org/licenses/by/4.0/,"  The digital educational solutions are increasingly used demanding high
quality functionalities. In this sense, standards and models are made available
by governments, associations, and researchers being most used in quality
control and assessment sessions. The eQETIC model was built according to the
approach of continuous process improvement favoring the quality management for
development and maintenance of digital educational solutions. This article
presents two expert systems to support the implementation of eQETIC model and
demonstrates that such systems are able to support users during the model
implementation. Developed according to two types of shells (SINTA/UFC and
e2gLite/eXpertise2go), the systems were used by a professional who develops
these type of solutions and showed positive results regarding the support
offered by them in implementing the rules proposed by eQETIC model.
","[{'version': 'v1', 'created': 'Sat, 15 Jan 2022 22:52:20 GMT'}]",2022-02-01,"[['Rossi', 'Rogerio', ''], ['Notagiarcomo', 'Pollyana', '']]","['Decision Support Systems', 'Digital Educational Solution', 'Educational Processes', 'eQETIC Model', 'Expert Systems']"
10166,2201.04756,Tianya Zhang Dr.,Tianya Zhang and Peter J. Jin,"Roadside Lidar Vehicle Detection and Tracking Using Range And Intensity
  Background Subtraction",,"Journal of Advanced Transportation, 2022",10.1155/2022/2771085,,cs.CV eess.SP,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we developed the solution of roadside LiDAR object detection
using a combination of two unsupervised learning algorithms. The 3D point
clouds are firstly converted into spherical coordinates and filled into the
elevation-azimuth matrix using a hash function. After that, the raw LiDAR data
were rearranged into new data structures to store the information of range,
azimuth, and intensity. Then, the Dynamic Mode Decomposition method is applied
to decompose the LiDAR data into low-rank backgrounds and sparse foregrounds
based on intensity channel pattern recognition. The Coarse Fine Triangle
Algorithm (CFTA) automatically finds the dividing value to separate the moving
targets from static background according to range information. After intensity
and range background subtraction, the foreground moving objects will be
detected using a density-based detector and encoded into the state-space model
for tracking. The output of the proposed solution includes vehicle trajectories
that can enable many mobility and safety applications. The method was validated
at both path and point levels and outperformed the state-of-the-art. In
contrast to the previous methods that process directly on the scattered and
discrete point clouds, the dynamic classification method can establish the less
sophisticated linear relationship of the 3D measurement data, which captures
the spatial-temporal structure that we often desire.
","[{'version': 'v1', 'created': 'Thu, 13 Jan 2022 00:54:43 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Jan 2022 22:38:22 GMT'}, {'version': 'v3', 'created': 'Sat, 12 Feb 2022 23:21:53 GMT'}, {'version': 'v4', 'created': 'Tue, 8 Mar 2022 18:20:39 GMT'}, {'version': 'v5', 'created': 'Wed, 8 Jun 2022 01:54:56 GMT'}]",2022-06-14,"[['Zhang', 'Tianya', ''], ['Jin', 'Peter J.', '']]","['LiDAR Detection and Tracking', 'Dynamic Mode Decomposition', 'Triangle Thresholding']"
10167,2206.11834,A. Feder Cooper,A. Feder Cooper and Jonathan Frankle and Christopher De Sa,Non-Determinism and the Lawlessness of Machine Learning Code,"Proceedings of the 2022 Symposium on Computer Science and Law (CSLAW
  '22)",,10.1145/3511265.3550446,,cs.CY cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Legal literature on machine learning (ML) tends to focus on harms, and thus
tends to reason about individual model outcomes and summary error rates. This
focus has masked important aspects of ML that are rooted in its reliance on
randomness -- namely, stochasticity and non-determinism. While some recent work
has begun to reason about the relationship between stochasticity and
arbitrariness in legal contexts, the role of non-determinism more broadly
remains unexamined. In this paper, we clarify the overlap and differences
between these two concepts, and show that the effects of non-determinism, and
consequently its implications for the law, become clearer from the perspective
of reasoning about ML outputs as distributions over possible outcomes. This
distributional viewpoint accounts for randomness by emphasizing the possible
outcomes of ML. Importantly, this type of reasoning is not exclusive with
current legal reasoning; it complements (and in fact can strengthen) analyses
concerning individual, concrete outcomes for specific automated decisions. By
illuminating the important role of non-determinism, we demonstrate that ML code
falls outside of the cyberlaw frame of treating ``code as law,'' as this frame
assumes that code is deterministic. We conclude with a brief discussion of what
work ML can do to constrain the potentially harm-inducing effects of
non-determinism, and we indicate where the law must do work to bridge the gap
between its current individual-outcome focus and the distributional approach
that we recommend.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2022 17:05:34 GMT'}, {'version': 'v2', 'created': 'Sun, 21 Aug 2022 22:01:37 GMT'}, {'version': 'v3', 'created': 'Wed, 5 Oct 2022 18:44:16 GMT'}]",2022-10-07,"[['Cooper', 'A. Feder', ''], ['Frankle', 'Jonathan', ''], ['De Sa', 'Christopher', '']]","['machine learning', 'non-determinism', 'stochasticity', 'arbitrariness']"
10168,1602.04339,Alexander Maletzky,Alexander Maletzky,Mathematical Theory Exploration in Theorema: Reduction Rings,"submitted to CICM 2015 (Conference on Intelligent Computer
  Mathematics)",,10.1007/978-3-319-42547-4_1,,cs.SC cs.LO math.AC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present the first-ever computer formalization of the theory
of Gr\""obner bases in reduction rings, which is an important theory in
computational commutative algebra, in Theorema. Not only the formalization, but
also the formal verification of all results has already been fully completed by
now; this, in particular, includes the generic implementation and correctness
proof of Buchberger's algorithm in reduction rings. Thanks to the seamless
integration of proving and computing in Theorema, this implementation can now
be used to compute Gr\""obner bases in various different domains directly within
the system. Moreover, a substantial part of our formalization is made up solely
by ""elementary theories"" such as sets, numbers and tuples that are themselves
independent of reduction rings and may therefore be used as the foundations of
future theory explorations in Theorema.
  In addition, we also report on two general-purpose Theorema tools we
developed for an efficient and convenient exploration of mathematical theories:
an interactive proving strategy and a ""theory analyzer"" that already proved
extremely useful when creating large structured knowledge bases.
","[{'version': 'v1', 'created': 'Sat, 13 Feb 2016 14:32:18 GMT'}]",2016-07-22,"[['Maletzky', 'Alexander', '']]","['Gröbner bases', 'reduction rings', 'computer-supported theory exploration', 'automated reasoning', 'Theorema']"
10169,1906.04800,Chaomei Chen,Chaomei Chen and Min Song,"Visualizing a Field of Research: A Methodology of Systematic
  Scientometric Reviews","17 figures, 3 tables",PLoS ONE 14(10): e0223994 (2019),10.1371/journal.pone.0223994,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Systematic scientometric reviews, empowered by scientometric and visual
analytic techniques, offer opportunities to improve the timeliness,
accessibility, and reproducibility of conventional systematic reviews. While
increasingly accessible science mapping tools enable end users to visualize the
structure and dynamics of a research field, a common bottleneck in the current
practice is the construction of a collection of scholarly publications as the
input of the subsequent scientometric analysis and visualization. End users
often have to face a dilemma in the preparation process: the more they know
about a knowledge domain, the easier it is for them to find the relevant data
to meet their needs adequately; the little they know, the harder the problem
is. What can we do to avoid missing something valuable but beyond our initial
description? In this article, we introduce a flexible and generic methodology,
cascading citation expansion, to increase the quality of constructing a
bibliographic dataset for systematic reviews. Furthermore, the methodology
simplifies the conceptualization of globalism and localism in science mapping
and unifies them on a consistent and continuous spectrum. We demonstrate an
application of the methodology to the research of literature-based discovery
and compare five datasets constructed based on three use scenarios, namely a
conventional keyword-based search (one dataset), an expansion process starting
with a groundbreaking article of the knowledge domain (two datasets), and an
expansion process starting with a recently published review article by a
prominent expert in the domain (two datasets). The unique coverage of each of
the datasets is inspected through network visualization overlays with reference
to other datasets in a broad and integrated context.
","[{'version': 'v1', 'created': 'Tue, 11 Jun 2019 20:22:13 GMT'}]",2020-12-24,"[['Chen', 'Chaomei', ''], ['Song', 'Min', '']]","['cascading citation expansion', 'systematic reviews', 'scientometrics', 'literature-based discovery', 'CiteSpace']"
10170,2001.05157,Runyu Zhang,"Jiaqi Dong, Runyu Zhang, Chaoshu Yang, Yujuan Tan, and Duo Liu","An Efficient and Wear-Leveling-Aware Frequent-Pattern Mining on
  Non-Volatile Memory",,,10.1088/1742-6596/1570/1/012087,,cs.DB cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Frequent-pattern mining is a common approach to reveal the valuable hidden
trends behind data. However, existing frequent-pattern mining algorithms are
designed for DRAM, instead of persistent memories (PMs), which can lead to
severe performance and energy overhead due to the utterly different
characteristics between DRAM and PMs when they are running on PMs. In this
paper, we propose an efficient and Wear-leveling-aware Frequent-Pattern Mining
scheme, WFPM, to solve this problem. The proposed WFPM is evaluated by a series
of experiments based on realistic datasets from diversified application
scenarios, where WFPM achieves 32.0% performance improvement and prolongs the
NVM lifetime of header table by 7.4x over the EvFP-Tree.
","[{'version': 'v1', 'created': 'Wed, 15 Jan 2020 07:21:11 GMT'}]",2020-08-26,"[['Dong', 'Jiaqi', ''], ['Zhang', 'Runyu', ''], ['Yang', 'Chaoshu', ''], ['Tan', 'Yujuan', ''], ['Liu', 'Duo', '']]","['Frequent-pattern mining', 'NVM', 'Wear-leveling']"
10171,2007.04666,Timothy Callemein,"Steven Puttemans, Timothy Callemein and Toon Goedem\'e","Building Robust Industrial Applicable Object Detection Models Using
  Transfer Learning and Single Pass Deep Learning Architectures",,,10.5220/0006562002090217,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The uprising trend of deep learning in computer vision and artificial
intelligence can simply not be ignored. On the most diverse tasks, from
recognition and detection to segmentation, deep learning is able to obtain
state-of-the-art results, reaching top notch performance. In this paper we
explore how deep convolutional neural networks dedicated to the task of object
detection can improve our industrial-oriented object detection pipelines, using
state-of-the-art open source deep learning frameworks, like Darknet. By using a
deep learning architecture that integrates region proposals, classification and
probability estimation in a single run, we aim at obtaining real-time
performance. We focus on reducing the needed amount of training data
drastically by exploring transfer learning, while still maintaining a high
average precision. Furthermore we apply these algorithms to two industrially
relevant applications, one being the detection of promotion boards in eye
tracking data and the other detecting and recognizing packages of warehouse
products for augmented advertisements.
","[{'version': 'v1', 'created': 'Thu, 9 Jul 2020 09:50:45 GMT'}]",2020-07-10,"[['Puttemans', 'Steven', ''], ['Callemein', 'Timothy', ''], ['Goedemé', 'Toon', '']]","['Deep Learning', 'Object Detection', 'Industrial Specific Solutions']"
10172,2112.08839,Takayuki Yamada,"Takayuki Yamada, Yuki Noguchi","Topology optimization with a closed cavity exclusion constraint for
  additive manufacturing based on the fictitious physical model approach","29 pages, 14 figures","Additive Manufacturing, Volume 52, April 2022, 102630",10.1016/j.addma.2022.102630,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a topology optimization method that considers the
geometric constraint of no closed cavities to improve the effectiveness of
additive manufacturing based on the fictitious physical model approach. First,
the basic topology optimization concept and level set-based method are
introduced. Next, the fictitious physical model for a geometric constraint in
the topology optimization framework is discussed. Then, a model for the
geometric constraint of no closed cavities for additive manufacturing is
proposed. Numerical examples are provided to validate the proposed model. In
addition, topology optimization considering the geometric constraint is
formulated, and topology optimization algorithms are constructed using the
finite element method. Finally, optimization examples are provided to validate
the proposed topology optimization method.
","[{'version': 'v1', 'created': 'Thu, 16 Dec 2021 12:45:05 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Feb 2022 02:14:40 GMT'}]",2022-02-10,"[['Yamada', 'Takayuki', ''], ['Noguchi', 'Yuki', '']]","['Topology optimization', 'Additive manufacturing', 'Hollow exclusion constraint', 'Partial']"
10173,1412.0193,Sebastian Wild,"Sebastian Wild, Markus E. Nebel, Conrado Mart\'inez",Analysis of Pivot Sampling in Dual-Pivot Quicksort,"This article is identical (up to typograhical details) to the
  Algorithmica version available from Springerlink (see DOI). It is an extended
  and improved version of our corresponding article at the AofA 2014 conference
  [arXiv:1403.6602]",,10.1007/s00453-015-0041-7,,cs.DS math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The new dual-pivot Quicksort by Vladimir Yaroslavskiy - used in Oracle's Java
runtime library since version 7 - features intriguing asymmetries. They make a
basic variant of this algorithm use less comparisons than classic single-pivot
Quicksort. In this paper, we extend the analysis to the case where the two
pivots are chosen as fixed order statistics of a random sample. Surprisingly,
dual-pivot Quicksort then needs more comparisons than a corresponding version
of classic Quicksort, so it is clear that counting comparisons is not
sufficient to explain the running time advantages observed for Yaroslavskiy's
algorithm in practice. Consequently, we take a more holistic approach and give
also the precise leading term of the average number of swaps, the number of
executed Java Bytecode instructions and the number of scanned elements, a new
simple cost measure that approximates I/O costs in the memory hierarchy. We
determine optimal order statistics for each of the cost measures. It turns out
that the asymmetries in Yaroslavskiy's algorithm render pivots with a
systematic skew more efficient than the symmetric choice. Moreover, we finally
have a convincing explanation for the success of Yaroslavskiy's algorithm in
practice: Compared with corresponding versions of classic single-pivot
Quicksort, dual-pivot Quicksort needs significantly less I/Os, both with and
without pivot sampling.
","[{'version': 'v1', 'created': 'Sun, 30 Nov 2014 07:49:11 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Aug 2015 07:03:08 GMT'}]",2015-08-11,"[['Wild', 'Sebastian', ''], ['Nebel', 'Markus E.', ''], ['Martínez', 'Conrado', '']]","['Quicksort', 'dual-pivot', 'Yaroslavskiy’s partitioning method', 'median of three', 'average-case analysis', 'I/O operations', 'external-memory model']"
10174,1912.10597,Pedro Sandoval Segura,"Pedro Sandoval Segura, Julius Lauw, Daniel Bashir, Kinjal Shah, Sonia
  Sehra, Dominique Macias, and George Montanez","The Labeling Distribution Matrix (LDM): A Tool for Estimating Machine
  Learning Algorithm Capacity","Accepted to 12th International Conference on Agents and Artificial
  Intelligence (ICAART 2020), 7 pages including references",,10.5220/0009178209800986,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Algorithm performance in supervised learning is a combination of
memorization, generalization, and luck. By estimating how much information an
algorithm can memorize from a dataset, we can set a lower bound on the amount
of performance due to other factors such as generalization and luck. With this
goal in mind, we introduce the Labeling Distribution Matrix (LDM) as a tool for
estimating the capacity of learning algorithms. The method attempts to
characterize the diversity of possible outputs by an algorithm for different
training datasets, using this to measure algorithm flexibility and
responsiveness to data. We test the method on several supervised learning
algorithms, and find that while the results are not conclusive, the LDM does
allow us to gain potentially valuable insight into the prediction behavior of
algorithms. We also introduce the Label Recorder as an additional tool for
estimating algorithm capacity, with more promising initial results.
","[{'version': 'v1', 'created': 'Mon, 23 Dec 2019 03:07:00 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Jan 2020 02:35:08 GMT'}]",2020-03-19,"[['Segura', 'Pedro Sandoval', ''], ['Lauw', 'Julius', ''], ['Bashir', 'Daniel', ''], ['Shah', 'Kinjal', ''], ['Sehra', 'Sonia', ''], ['Macias', 'Dominique', ''], ['Montanez', 'George', '']]","['Machine Learning', 'Model Complexity', 'Algorithm Capacity', 'VC Dimension', 'Label Recorder']"
10175,2110.05162,David Brayford,"David Brayford, John Brennan, Momme Allalen, Kenneth Hanley, Luigi
  Iapichino, Lee ORiordan, Niall Moran","Deploying Containerized QuantEx Quantum Simulation Software on HPC
  Systems",,"2021 3rd International Workshop on Containers and New
  Orchestration Paradigms for Isolated Environments in HPC (CANOPIE-HPC)",10.1109/CANOPIEHPC54579.2021.00005.,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  The simulation of quantum circuits using the tensor network method is very
computationally demanding and requires significant High Performance Computing
(HPC) resources to find an efficient contraction order and to perform the
contraction of the large tensor networks. In addition, the researchers want a
workflow that is easy to customize, reproduce and migrate to different HPC
systems. In this paper, we discuss the issues associated with the deployment of
the QuantEX quantum computing simulation software within containers on
different HPC systems. Also, we compare the performance of the containerized
software with the software running on bare metal.
","[{'version': 'v1', 'created': 'Mon, 11 Oct 2021 11:13:12 GMT'}]",2022-01-25,"[['Brayford', 'David', ''], ['Brennan', 'John', ''], ['Allalen', 'Momme', ''], ['Hanley', 'Kenneth', ''], ['Iapichino', 'Luigi', ''], ['ORiordan', 'Lee', ''], ['Moran', 'Niall', '']]","['Containers', 'quantum computing', 'software devel']"
10176,2208.00496,Michael Xieyang Liu,"Michael Xieyang Liu, Andrew Kuznetsov, Yongsung Kim, Joseph Chee
  Chang, Aniket Kittur, Brad A. Myers",Wigglite: Low-cost Information Collection and Triage,,,10.1145/3526113.3545661,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Consumers conducting comparison shopping, researchers making sense of
competitive space, and developers looking for code snippets online all face the
challenge of capturing the information they find for later use without
interrupting their current flow. In addition, during many learning and
exploration tasks, people need to externalize their mental context, such as
estimating how urgent a topic is to follow up on, or rating a piece of evidence
as a ""pro"" or ""con,"" which helps scaffold subsequent deeper exploration.
However, current approaches incur a high cost, often requiring users to select,
copy, context switch, paste, and annotate information in a separate document
without offering specific affordances that capture their mental context. In
this work, we explore a new interaction technique called ""wiggling,"" which can
be used to fluidly collect, organize, and rate information during early
sensemaking stages with a single gesture. Wiggling involves rapid
back-and-forth movements of a pointer or up-and-down scrolling on a smartphone,
which can indicate the information to be collected and its valence, using a
single, light-weight gesture that does not interfere with other interactions
that are already available. Through implementation and user evaluation, we
found that wiggling helped participants accurately collect information and
encode their mental context with a 58% reduction in operational cost while
being 24% faster compared to a common baseline.
","[{'version': 'v1', 'created': 'Sun, 31 Jul 2022 19:23:59 GMT'}]",2022-08-02,"[['Liu', 'Michael Xieyang', ''], ['Kuznetsov', 'Andrew', ''], ['Kim', 'Yongsung', ''], ['Chang', 'Joseph Chee', ''], ['Kittur', 'Aniket', ''], ['Myers', 'Brad A.', '']]","['Sensemaking', 'Mental models', 'Interaction technique']"
10177,1710.05705,Leon Bungert,"Leon Bungert, David A. Coomes, Matthias J. Ehrhardt, Jennifer Rasch,
  Rafael Reisenhofer, Carola-Bibiane Sch\""onlieb","Blind Image Fusion for Hyperspectral Imaging with the Directional Total
  Variation","24 pages, 18 figures, published in Inverse Problems, typo corrected,
  figure added","Inverse Problems, 34(4), 044003, 2018",10.1088/1361-6420/aaaf63,,cs.CV cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hyperspectral imaging is a cutting-edge type of remote sensing used for
mapping vegetation properties, rock minerals and other materials. A major
drawback of hyperspectral imaging devices is their intrinsic low spatial
resolution. In this paper, we propose a method for increasing the spatial
resolution of a hyperspectral image by fusing it with an image of higher
spatial resolution that was obtained with a different imaging modality. This is
accomplished by solving a variational problem in which the regularization
functional is the directional total variation. To accommodate for possible
mis-registrations between the two images, we consider a non-convex blind
super-resolution problem where both a fused image and the corresponding
convolution kernel are estimated. Using this approach, our model can realign
the given images if needed. Our experimental results indicate that the
non-convexity is negligible in practice and that reliable solutions can be
computed using a variety of different optimization algorithms. Numerical
results on real remote sensing data from plant sciences and urban monitoring
show the potential of the proposed method and suggests that it is robust with
respect to the regularization parameters, mis-registration and the shape of the
kernel.
","[{'version': 'v1', 'created': 'Wed, 4 Oct 2017 15:18:13 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Dec 2017 13:50:06 GMT'}, {'version': 'v3', 'created': 'Sun, 17 Dec 2017 23:10:45 GMT'}, {'version': 'v4', 'created': 'Mon, 9 Apr 2018 14:40:20 GMT'}]",2022-08-16,"[['Bungert', 'Leon', ''], ['Coomes', 'David A.', ''], ['Ehrhardt', 'Matthias J.', ''], ['Rasch', 'Jennifer', ''], ['Reisenhofer', 'Rafael', ''], ['Schönlieb', 'Carola-Bibiane', '']]","['remote sensing', 'super-resolution', 'pansharpening', 'blind deconvolution', 'hyperspectral imaging']"
10178,2209.12318,Donghan Hu,"Donghan Hu, Sang Won Lee","Scrapbook: Screenshot-Based Bookmarks for Effective Digital Resource
  Curation across Applications",,,10.1145/3526113.3545678,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Modern knowledge workers typically need to use multiple resources, such as
documents, web pages, and applications, at the same time. This complexity in
their computing environments forces workers to restore various resources in the
course of their work. However, conventional curation methods like bookmarks,
recent document histories, and file systems place limitations on effective
retrieval. Such features typically work only for resources of one type within
one application, ignoring the interdependency between resources needed for a
single task. In addition, text-based handles do not provide rich cues for users
to recognize their associated resources. Hence, the need to locate and reopen
relevant resources can significantly hinder knowledge workers' productivity. To
address these issues, we designed and developed Scrapbook, a novel application
for digital resource curation across applications that uses screenshot-based
bookmarks. Scrapbook extracts and stores all the metadata (URL, file location,
and application name) of windows visible in a captured screenshot to facilitate
restoring them later. A week-long field study indicated that screenshot-based
bookmarks helped participants curate digital resources. Additionally,
participants reported that multimodal -- visual and textual -- data helped them
recall past computer activities and reconstruct working contexts efficiently.
","[{'version': 'v1', 'created': 'Sun, 25 Sep 2022 20:53:25 GMT'}]",2022-09-27,"[['Hu', 'Donghan', ''], ['Lee', 'Sang Won', '']]","['Curation', 'Productivity', 'Task resumption', 'Self-tracking', 'Screenshot', 'Interactive tool']"
10179,2101.07993,Crystal Lee,"Crystal Lee, Tanya Yang, Gabrielle Inchoco, Graham M. Jones, Arvind
  Satyanarayan","Viral Visualizations: How Coronavirus Skeptics Use Orthodox Data
  Practices to Promote Unorthodox Science Online","To appear in ACM CHI 2021; 18 pages, 4 figures, 1 table",,10.1145/3411764.3445211,,cs.HC cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Controversial understandings of the coronavirus pandemic have turned data
visualizations into a battleground. Defying public health officials,
coronavirus skeptics on US social media spent much of 2020 creating data
visualizations showing that the government's pandemic response was excessive
and that the crisis was over. This paper investigates how pandemic
visualizations circulated on social media, and shows that people who mistrust
the scientific establishment often deploy the same rhetorics of data-driven
decision-making used by experts, but to advocate for radical policy changes.
Using a quantitative analysis of how visualizations spread on Twitter and an
ethnographic approach to analyzing conversations about COVID data on Facebook,
we document an epistemological gap that leads pro- and anti-mask groups to draw
drastically different inferences from similar data. Ultimately, we argue that
the deployment of COVID data visualizations reflect a deeper sociopolitical
rift regarding the place of science in public life.
","[{'version': 'v1', 'created': 'Wed, 20 Jan 2021 06:36:47 GMT'}]",2021-01-21,"[['Lee', 'Crystal', ''], ['Yang', 'Tanya', ''], ['Inchoco', 'Gabrielle', ''], ['Jones', 'Graham M.', ''], ['Satyanarayan', 'Arvind', '']]","['digital ethnography', 'network analysis', 'Twitter', 'Facebook', 'data literacy', 'data visualization']"
10180,2201.02229,Aparna Elangovan,"Aparna Elangovan, Yuan Li, Douglas E. V. Pires, Melissa J. Davis and
  Karin Verspoor","Large-scale protein-protein post-translational modification extraction
  with distant supervision and confidence calibrated BioBERT",BMC BioInformatics,"BMC Bioinformatics 23, 4 (2022)",10.1186/s12859?021?04504?x,,cs.LG cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Protein-protein interactions (PPIs) are critical to normal cellular function
and are related to many disease pathways. However, only 4% of PPIs are
annotated with PTMs in biological knowledge databases such as IntAct, mainly
performed through manual curation, which is neither time nor cost-effective. We
use the IntAct PPI database to create a distant supervised dataset annotated
with interacting protein pairs, their corresponding PTM type, and associated
abstracts from the PubMed database. We train an ensemble of BioBERT models -
dubbed PPI-BioBERT-x10 to improve confidence calibration. We extend the use of
ensemble average confidence approach with confidence variation to counteract
the effects of class imbalance to extract high confidence predictions. The
PPI-BioBERT-x10 model evaluated on the test set resulted in a modest F1-micro
41.3 (P =5 8.1, R = 32.1). However, by combining high confidence and low
variation to identify high quality predictions, tuning the predictions for
precision, we retained 19% of the test predictions with 100% precision. We
evaluated PPI-BioBERT-x10 on 18 million PubMed abstracts and extracted 1.6
million (546507 unique PTM-PPI triplets) PTM-PPI predictions, and filter ~ 5700
(4584 unique) high confidence predictions. Of the 5700, human evaluation on a
small randomly sampled subset shows that the precision drops to 33.7% despite
confidence calibration and highlights the challenges of generalisability beyond
the test set even with confidence calibration. We circumvent the problem by
only including predictions associated with multiple papers, improving the
precision to 58.8%. In this work, we highlight the benefits and challenges of
deep learning-based text mining in practice, and the need for increased
emphasis on confidence calibration to facilitate human curation efforts.
","[{'version': 'v1', 'created': 'Thu, 6 Jan 2022 19:59:14 GMT'}]",2022-01-10,"[['Elangovan', 'Aparna', ''], ['Li', 'Yuan', ''], ['Pires', 'Douglas E. V.', ''], ['Davis', 'Melissa J.', ''], ['Verspoor', 'Karin', '']]","['Protein-protein interaction', 'Post-translational modifications', 'BioBERT', 'Natural language processing', 'Deep learning', 'Distant supervision']"
10181,2009.04215,Francisco Cruz,"Ruben Contreras, Angel Ayala, Francisco Cruz","Unmanned Aerial Vehicle Control Through Domain-based Automatic Speech
  Recognition",Submitted to Computers,,10.3390/computers9030075,,cs.RO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Currently, unmanned aerial vehicles, such as drones, are becoming a part of
our lives and reaching out to many areas of society, including the
industrialized world. A common alternative to control the movements and actions
of the drone is through unwired tactile interfaces, for which different remote
control devices can be found. However, control through such devices is not a
natural, human-like communication interface, which sometimes is difficult to
master for some users. In this work, we present a domain-based speech
recognition architecture to effectively control an unmanned aerial vehicle such
as a drone. The drone control is performed using a more natural, human-like way
to communicate the instructions. Moreover, we implement an algorithm for
command interpretation using both Spanish and English languages, as well as to
control the movements of the drone in a simulated domestic environment. The
conducted experiments involve participants giving voice commands to the drone
in both languages in order to compare the effectiveness of each of them,
considering the mother tongue of the participants in the experiment.
Additionally, different levels of distortion have been applied to the voice
commands in order to test the proposed approach when facing noisy input
signals. The obtained results show that the unmanned aerial vehicle is capable
of interpreting user voice instructions achieving an improvement in
speech-to-action recognition for both languages when using phoneme matching in
comparison to only using the cloud-based algorithm without domain-based
instructions. Using raw audio inputs, the cloud-based approach achieves 74.81%
and 97.04% accuracy for English and Spanish instructions respectively, whereas
using our phoneme matching approach the results are improved achieving 93.33%
and 100.00% accuracy for English and Spanish languages.
","[{'version': 'v1', 'created': 'Wed, 9 Sep 2020 11:17:45 GMT'}]",2020-09-22,"[['Contreras', 'Ruben', ''], ['Ayala', 'Angel', ''], ['Cruz', 'Francisco', '']]","['Drone control', 'automatic speech recognition', 'robot simulator']"
10182,2111.11481,Nelson Diaz,Nelson Diaz and Omar Gallo and Jhon Caceres and Hernan Porras,"Real-time ground filtering algorithm of cloud points acquired using
  Terrestrial Laser Scanner (TLS)","25 pages, 7 figures",,10.1016/j.jag.2021.102629,,cs.CV cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  3D modeling based on point clouds requires ground-filtering algorithms that
separate ground from non-ground objects. This study presents two ground
filtering algorithms. The first one is based on normal vectors. It has two
variants depending on the procedure to compute the k-nearest neighbors. The
second algorithm is based on transforming the cloud points into a voxel
structure. To evaluate them, the two algorithms are compared according to their
execution time, effectiveness and efficiency. Results show that the ground
filtering algorithm based on the voxel structure is faster in terms of
execution time, effectiveness, and efficiency than the normal vector ground
filtering.
","[{'version': 'v1', 'created': 'Mon, 22 Nov 2021 19:18:32 GMT'}]",2021-11-25,"[['Diaz', 'Nelson', ''], ['Gallo', 'Omar', ''], ['Caceres', 'Jhon', ''], ['Porras', 'Hernan', '']]","['Ground filter', 'normal vector', 'PCA', 'TLS', 'voxel']"
10183,1810.00952,Jared Roesch,"Jared Roesch, Steven Lyubomirsky, Logan Weber, Josh Pollock, Marisa
  Kirisame, Tianqi Chen, Zachary Tatlock",Relay: A New IR for Machine Learning Frameworks,,,10.1145/3211346.3211348,,cs.PL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning powers diverse services in industry including search,
translation, recommendation systems, and security. The scale and importance of
these models require that they be efficient, expressive, and portable across an
array of heterogeneous hardware devices. These constraints are often at odds;
in order to better accommodate them we propose a new high-level intermediate
representation (IR) called Relay. Relay is being designed as a
purely-functional, statically-typed language with the goal of balancing
efficient compilation, expressiveness, and portability. We discuss the goals of
Relay and highlight its important design constraints. Our prototype is part of
the open source NNVM compiler framework, which powers Amazon's deep learning
framework MxNet.
","[{'version': 'v1', 'created': 'Wed, 26 Sep 2018 00:09:54 GMT'}]",2018-10-03,"[['Roesch', 'Jared', ''], ['Lyubomirsky', 'Steven', ''], ['Weber', 'Logan', ''], ['Pollock', 'Josh', ''], ['Kirisame', 'Marisa', ''], ['Chen', 'Tianqi', ''], ['Tatlock', 'Zachary', '']]","['intermediate representation', 'machine learning', 'compilers', 'differentiable programming']"
10184,1412.2564,Vincent Delos,"Vincent Delos (I2M), Denis Teissandier (I2M)",Minkowski Sum of Polytopes Defined by Their Vertices,,"Journal of Applied Mathematics and Physics (JAMP), Scientific
  Research Publishing, 2015, 3 (1), pp.62-67",10.4236/jamp.2015.31008,,cs.CG cs.MS physics.class-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Minkowski sums are of theoretical interest and have applications in fields
related to industrial backgrounds. In this paper we focus on the specific case
of summing polytopes as we want to solve the tolerance analysis problem
described in [1]. Our approach is based on the use of linear programming and is
solvable in polynomial time. The algorithm we developed can be implemented and
parallelized in a very easy way.
","[{'version': 'v1', 'created': 'Mon, 8 Dec 2014 13:57:21 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Jun 2015 09:39:04 GMT'}]",2015-06-17,"[['Delos', 'Vincent', '', 'I2M'], ['Teissandier', 'Denis', '', 'I2M']]","['Computational Geometry', 'Polytope', 'Minkowski Sum', 'Linear Programming', 'Convex Hull']"
10185,2012.12181,Poorna Talkad Sukumar,"Poorna Talkad Sukumar, Thomas Breideband, Gonzalo Martinez, Megan
  Caruso, Sierra Rose, Cooper Steputis, Sidney D'Mello, Gloria Mark, Aaron
  Striegel","Designing an Interactive Visualization System for Monitoring Participant
  Compliance in a Large-Scale, Longitudinal Study","8 pages, 4 figures",,10.1145/3411763.3443436,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Frequent monitoring of participant compliance is necessary when conducting
large-scale, longitudinal studies to ensure that the collected data is of
sufficiently high quality. While the need for achieving high compliance has
been underscored and there are discussions on incentives and factors affecting
compliance, little is shared about the actual processes and tools used for
monitoring compliance in such studies. Monitoring participant compliance with
respect to multi-modal data can be a tedious process, especially if there are
only a few personnel involved. In this case study, we describe the iterative
design of an interactive visualization system we developed for monitoring
compliance and refined based on changing requirements in an ongoing study. We
find that the visualization system, leveraging the digital medium, both
facilitates the exploratory tasks of monitoring participant compliance and
supports asynchronous collaboration among non-co-located researchers. Our
documented requirements for checking participant compliance as well as the
design of the visualization system can help inform the compliance-monitoring
process in future studies.
","[{'version': 'v1', 'created': 'Tue, 22 Dec 2020 17:20:48 GMT'}]",2020-12-23,"[['Sukumar', 'Poorna Talkad', ''], ['Breideband', 'Thomas', ''], ['Martinez', 'Gonzalo', ''], ['Caruso', 'Megan', ''], ['Rose', 'Sierra', ''], ['Steputis', 'Cooper', ''], [""D'Mello"", 'Sidney', ''], ['Mark', 'Gloria', ''], ['Striegel', 'Aaron', '']]","['compliance', 'longitudinal studies', 'sensing', 'visualization design', 'exploratory', 'tabular visualizations']"
10186,2011.09821,Jerry Swan,"Jerry Swan, Steven Adriaensen, Alexander E. I. Brownlee, Kevin
  Hammond, Colin G. Johnson, Ahmed Kheiri, Faustyna Krawiec, J. J. Merelo,
  Leandro L. Minku, Ender \""Ozcan, Gisele L. Pappa, Pablo Garc\'ia-S\'anchez,
  Kenneth S\""orensen, Stefan Vo{\ss}, Markus Wagner, David R. White","Metaheuristics ""In the Large""",,,10.1016/j.ejor.2021.05.042,,cs.NE cs.AI,http://creativecommons.org/publicdomain/zero/1.0/,"  Following decades of sustained improvement, metaheuristics are one of the
great success stories of optimization research. However, in order for research
in metaheuristics to avoid fragmentation and a lack of reproducibility, there
is a pressing need for stronger scientific and computational infrastructure to
support the development, analysis and comparison of new approaches. We argue
that, via principled choice of infrastructure support, the field can pursue a
higher level of scientific enquiry. We describe our vision and report on
progress, showing how the adoption of common protocols for all metaheuristics
can help liberate the potential of the field, easing the exploration of the
design space of metaheuristics.
","[{'version': 'v1', 'created': 'Thu, 19 Nov 2020 13:49:05 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Nov 2020 20:24:40 GMT'}, {'version': 'v3', 'created': 'Fri, 18 Dec 2020 10:52:28 GMT'}, {'version': 'v4', 'created': 'Thu, 3 Jun 2021 11:04:10 GMT'}]",2021-08-31,"[['Swan', 'Jerry', ''], ['Adriaensen', 'Steven', ''], ['Brownlee', 'Alexander E. I.', ''], ['Hammond', 'Kevin', ''], ['Johnson', 'Colin G.', ''], ['Kheiri', 'Ahmed', ''], ['Krawiec', 'Faustyna', ''], ['Merelo', 'J. J.', ''], ['Minku', 'Leandro L.', ''], ['Özcan', 'Ender', ''], ['Pappa', 'Gisele L.', ''], ['García-Sánchez', 'Pablo', ''], ['Sörensen', 'Kenneth', ''], ['Voß', 'Stefan', ''], ['Wagner', 'Markus', ''], ['White', 'David R.', '']]","['Evolutionary Computation', 'Operational Research', 'Heuristicdesign', 'Heuristic methods', 'Architecture', 'Frameworks', 'Interoperability']"
10187,2206.02886,Gang Liu,"Gang Liu, Tong Zhao, Jiaxin Xu, Tengfei Luo, Meng Jiang",Graph Rationalization with Environment-based Augmentations,Accepted by KDD 2022,,10.1145/3534678.3539347,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Rationale is defined as a subset of input features that best explains or
supports the prediction by machine learning models. Rationale identification
has improved the generalizability and interpretability of neural networks on
vision and language data. In graph applications such as molecule and polymer
property prediction, identifying representative subgraph structures named as
graph rationales plays an essential role in the performance of graph neural
networks. Existing graph pooling and/or distribution intervention methods
suffer from lack of examples to learn to identify optimal graph rationales. In
this work, we introduce a new augmentation operation called environment
replacement that automatically creates virtual data examples to improve
rationale identification. We propose an efficient framework that performs
rationale-environment separation and representation learning on the real and
augmented examples in latent spaces to avoid the high complexity of explicit
graph decoding and encoding. Comparing against recent techniques, experiments
on seven molecular and four polymer real datasets demonstrate the effectiveness
and efficiency of the proposed augmentation-based graph rationalization
framework.
","[{'version': 'v1', 'created': 'Mon, 6 Jun 2022 20:23:30 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Sep 2022 15:54:42 GMT'}]",2022-09-27,"[['Liu', 'Gang', ''], ['Zhao', 'Tong', ''], ['Xu', 'Jiaxin', ''], ['Luo', 'Tengfei', ''], ['Jiang', 'Meng', '']]","['Graph Learning', 'Graph Neural Network', 'Molecule Property', 'DataAugmentation', 'Rationalization']"
10188,2004.11698,Kai Zhou,Kai Zhou and Jiong Tang,"Structural Model Updating Using Adaptive Multi-Response Gaussian Process
  Meta-modeling",,,10.1016/j.ymssp.2020.107121,,cs.CE eess.SP stat.CO stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finite element model updating utilizing frequency response functions as
inputs is an important procedure in structural analysis, design and control.
This paper presents a highly efficient framework that is built upon Gaussian
process emulation to inversely identify model parameters through sampling. In
particular, a multi-response Gaussian process (MRGP) meta-modeling approach is
formulated that can accurately construct the error response surface, i.e., the
discrepancies between the frequency response predictions and actual
measurement. In order to reduce the computational cost of repeated finite
element simulations, an adaptive sampling strategy is established, where the
search of unknown parameters is guided by the response surface features.
Meanwhile, the information of previously sampled model parameters and the
corresponding errors is utilized as additional training data to refine the MRGP
meta-model. Two stochastic optimization techniques, i.e., particle swarm and
simulated annealing, are employed to train the MRGP meta-model for comparison.
Systematic case studies are conducted to examine the accuracy and robustness of
the new framework of model updating.
","[{'version': 'v1', 'created': 'Thu, 16 Apr 2020 13:26:33 GMT'}]",2020-08-26,"[['Zhou', 'Kai', ''], ['Tang', 'Jiong', '']]","['Model updating', 'frequency responses', 'error response surface', 'multi-response Gaussian']"
10189,1704.01944,Paul Thaddeus Kazibudzki,Paul Thaddeus Kazibudzki,"The quality of priority ratios estimation in relation to a selected
  prioritization procedure and consistency measure for a Pairwise Comparison
  Matrix","30 pages, 11 tables, 3 figures",https://www.hindawi.com/journals/aor/2019/3574263/,10.1155/2019/3574263,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An overview of current debates and contemporary research devoted to the
modeling of decision making processes and their facilitation directs attention
to the Analytic Hierarchy Process (AHP). At the core of the AHP are various
prioritization procedures (PPs) and consistency measures (CMs) for a Pairwise
Comparison Matrix (PCM) which, in a sense, reflects preferences of decision
makers. Certainly, when judgments about these preferences are perfectly
consistent (cardinally transitive), all PPs coincide and the quality of the
priority ratios (PRs) estimation is exemplary. However, human judgments are
very rarely consistent, thus the quality of PRs estimation may significantly
vary. The scale of these variations depends on the applied PP and utilized CM
for a PCM. This is why it is important to find out which PPs and which CMs for
a PCM lead directly to an improvement of the PRs estimation accuracy. The main
goal of this research is realized through the properly designed, coded and
executed seminal and sophisticated simulation algorithms in Wolfram Mathematica
8.0. These research results convince that the embedded in the AHP and commonly
applied, both genuine PP and CM for PCM may significantly deteriorate the
quality of PRs estimation; however, solutions proposed in this paper can
significantly improve the methodology.
","[{'version': 'v1', 'created': 'Thu, 6 Apr 2017 17:25:39 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Jun 2017 23:18:34 GMT'}]",2020-06-05,"[['Kazibudzki', 'Paul Thaddeus', '']]","['pairwise comparisons', 'priority ratios', 'consistency', 'AHP', 'Monte Carlo simulations']"
10190,1909.07694,V\'aclav Barto\v{s},"Vaclav Bartos, Martin Zadnik, Sheikh Mahbub Habib, Emmanouil
  Vasilomanolakis",Network entity characterization and attack prediction,"30 pages, 8 figures",Future Generation Computer Systems 97 (2019) 674-686,10.1016/j.future.2019.03.016,,cs.CR cs.LG cs.NI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The devastating effects of cyber-attacks, highlight the need for novel attack
detection and prevention techniques. Over the last years, considerable work has
been done in the areas of attack detection as well as in collaborative defense.
However, an analysis of the state of the art suggests that many challenges
exist in prioritizing alert data and in studying the relation between a
recently discovered attack and the probability of it occurring again. In this
article, we propose a system that is intended for characterizing network
entities and the likelihood that they will behave maliciously in the future.
Our system, namely Network Entity Reputation Database System (NERDS), takes
into account all the available information regarding a network entity (e. g. IP
address) to calculate the probability that it will act maliciously. The latter
part is achieved via the utilization of machine learning. Our experimental
results show that it is indeed possible to precisely estimate the probability
of future attacks from each entity using information about its previous
malicious behavior and other characteristics. Ranking the entities by this
probability has practical applications in alert prioritization, assembly of
highly effective blacklists of a limited length and other use cases.
","[{'version': 'v1', 'created': 'Tue, 17 Sep 2019 10:12:55 GMT'}]",2019-09-18,"[['Bartos', 'Vaclav', ''], ['Zadnik', 'Martin', ''], ['Habib', 'Sheikh Mahbub', ''], ['Vasilomanolakis', 'Emmanouil', '']]","['network security', 'alert sharing', 'reputation database', 'attackprediction', 'alert prioritization', 'machine learning']"
10191,2101.00215,Ginni Garg,Ginni Garg and Mantosh Biswas,Improved Neural Network based Plant Diseases Identification,"12 pages, 7 Tables, 5 figures",,10.1007/978-981-15-5341-7_6,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The agriculture sector is essential for every country because it provides a
basic income to a large number of people and food as well, which is a
fundamental requirement to survive on this planet. We see as time passes,
significant changes come in the present era, which begins with Green
Revolution. Due to improper knowledge of plant diseases, farmers use
fertilizers in excess, which ultimately degrade the quality of food. Earlier
farmers use experts to determine the type of plant disease, which was expensive
and time-consuming. In today time, Image processing is used to recognize and
catalog plant diseases using the lesion region of plant leaf, and there are
different modus-operandi for plant disease scent from leaf using Neural
Networks (NN), Support Vector Machine (SVM), and others. In this paper, we
improving the architecture of the Neural Networking by working on ten different
types of training algorithms and the proper choice of neurons in the concealed
layer. Our proposed approach gives 98.30% accuracy on general plant leaf
disease and 100% accuracy on specific plant leaf disease based on Bayesian
regularization, automation of cluster and without over-fitting on considered
plant diseases over various other implemented methods.
","[{'version': 'v1', 'created': 'Fri, 1 Jan 2021 11:49:56 GMT'}]",2021-01-05,"[['Garg', 'Ginni', ''], ['Biswas', 'Mantosh', '']]","['Plant Diseases', 'Color transformation', 'Image segmentation', 'Feature extraction', 'Classification']"
10192,1903.04827,Gianni Bianchini,Gianni Bianchini and Daniele Pepe and Antonio Vicino,"Estimation of Photovoltaic Generation Forecasting Models using Limited
  Information",,"Automatica, 2019",10.1016/j.automatica.2019.108688,,cs.SY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This work deals with the problem of estimating a photovoltaic generation
forecasting model in scenarios where measurements of meteorological variables
(i.e. solar irradiance and temperature) at the plant site are not available. A
novel algorithm for the estimation of the parameters of the well-known PVUSA
model of a photovoltaic plant is proposed. Such a method is characterized by a
low computational complexity, and efficiently exploits only power generation
measurements, a theoretical clear-sky irradiance model, and temperature
forecasts provided by a meteorological service. An extensive experimental
validation of the proposed method on real data is also presented.
","[{'version': 'v1', 'created': 'Tue, 12 Mar 2019 10:33:18 GMT'}]",2019-11-07,"[['Bianchini', 'Gianni', ''], ['Pepe', 'Daniele', ''], ['Vicino', 'Antonio', '']]","['Energy systems', 'Model fitting', 'Forecasting', 'Photovoltaic generation']"
10193,2010.14934,Hugo Hadjur,"Hugo Hadjur (AVALON), Doreid Ammar, Laurent Lef\`evre (AVALON)",Analysis of Energy Consumption in a Precision Beekeeping System,"IoT '20: 10th International Conference on the Internet of Things, Oct
  2020, Malm{\""o}, Sweden",,10.1145/3410992.3411010,,cs.AR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Honey bees have been domesticated by humans for several thousand years and
mainly provide honey and pollination, which is fundamental for plant
reproduction. Nowadays, the work of beekeepers is constrained by external
factors that stress their production (parasites and pesticides among others).
Taking care of large numbers of beehives is time-consuming, so integrating
sensors to track their status can drastically simplify the work of beekeepers.
Precision bee-keeping complements beekeepers' work thanks to the In-ternet of
Things (IoT) technology. If used correctly, data can help to make the right
diagnosis for honey bees colony, increase honey production and decrease bee
mortality. Providing enough energy for on-hive and in-hive sensors is a
challenge. Some solutions rely on energy harvesting, others target usage of
large batteries. Either way, it is mandatory to analyze the energy usage of
embedded equipment in order to design an energy efficient and autonomous bee
monitoring system. This paper relies on a fully autonomous IoT framework that
collects environmental and image data of a beehive. It consists of a data
collecting node (environmental data sensors, camera, Raspberry Pi and Arduino)
and a solar energy supplying node. Supported services are analyzed task by task
from an energy profiling and efficiency standpoint , in order to identify the
highly pressured areas of the framework. This first step will guide our goal of
designing a sustainable precision beekeeping system, both technically and
energy-wise.
","[{'version': 'v1', 'created': 'Wed, 28 Oct 2020 12:44:09 GMT'}]",2020-10-29,"[['Hadjur', 'Hugo', '', 'AVALON'], ['Ammar', 'Doreid', '', 'AVALON'], ['Lefèvre', 'Laurent', '', 'AVALON']]","['internet of things', 'energy consumption', 'benchmarking', 'smart agriculture', 'precision beekeeping']"
10194,1401.3376,Guohua Wu,Guohua Wu,Across neighbourhood search for numerical optimization,,"Guohua Wu , Across neighbourhood search for numerical
  optimization, Information Sciences (2015), doi: 10.1016/j.ins.2015.09.051",10.1016/j.ins.2015.09.051,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Population-based search algorithms (PBSAs), including swarm intelligence
algorithms (SIAs) and evolutionary algorithms (EAs), are competitive
alternatives for solving complex optimization problems and they have been
widely applied to real-world optimization problems in different fields. In this
study, a novel population-based across neighbourhood search (ANS) is proposed
for numerical optimization. ANS is motivated by two straightforward assumptions
and three important issues raised in improving and designing efficient PBSAs.
In ANS, a group of individuals collaboratively search the solution space for an
optimal solution of the optimization problem considered. A collection of
superior solutions found by individuals so far is maintained and updated
dynamically. At each generation, an individual directly searches across the
neighbourhoods of multiple superior solutions with the guidance of a Gaussian
distribution. This search manner is referred to as across neighbourhood search.
The characteristics of ANS are discussed and the concept comparisons with other
PBSAs are given. The principle behind ANS is simple. Moreover, ANS is easy for
implementation and application with three parameters being required to tune.
Extensive experiments on 18 benchmark optimization functions of different types
show that ANS has well balanced exploration and exploitation capabilities and
performs competitively compared with many efficient PBSAs (Related Matlab codes
used in the experiments are available from
http://guohuawunudt.gotoip2.com/publications.html).
","[{'version': 'v1', 'created': 'Tue, 14 Jan 2014 22:35:48 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Dec 2014 12:20:04 GMT'}, {'version': 'v3', 'created': 'Mon, 19 Oct 2015 16:21:24 GMT'}]",2015-10-20,"[['Wu', 'Guohua', '']]","['Across neighbourhood search', 'evolutionary computation', 'swarm intelligence', 'numerical']"
10195,1909.05098,Jinao Zhang,"Jinao Zhang, Sunita Chauhan","Real-time computation of bio-heat transfer in the fast explicit dynamics
  finite element algorithm (FED-FEM) framework","Published in Numerical Heat Transfer, Part B: Fundamentals. arXiv
  admin note: text overlap with arXiv:1909.03355","Numerical Heat Transfer, Part B: Fundamentals, vol. 75, no. 4, pp.
  217-238, 2019",10.1080/10407790.2019.1627812,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  Real-time analysis of bio-heat transfer is very beneficial in improving
clinical outcomes of hyperthermia and thermal ablative treatments but
challenging to achieve due to large computational costs. This paper presents a
fast numerical algorithm well suited for real-time solutions of bio-heat
transfer, and it achieves real-time computation via the (i) computationally
efficient explicit dynamics in the temporal domain, (ii) element-level thermal
load computation, (iii) computationally efficient finite elements, (iv)
explicit formulation for unknown nodal temperature, and (v) pre-computation of
constant simulation matrices and parameters, all of which lead to a significant
reduction in computation time for fast run-time computation. The proposed
methodology considers temperature-dependent thermal properties for nonlinear
characteristics of bio-heat transfer in soft tissue. Utilising a parallel
execution, the proposed method achieves computation time reduction of 107.71
and 274.57 times compared to those of with and without parallelisation of the
commercial finite element codes if temperature-dependent thermal properties are
considered, and 303.07 and 772.58 times if temperature-independent thermal
properties are considered, far exceeding the computational performance of the
commercial finite element codes, presenting great potential in real-time
predictive analysis of tissue temperature for planning, optimisation and
evaluation of thermo-therapeutic treatments. The source code is available at
https://github.com/jinaojakezhang/FEDFEMBioheat.
","[{'version': 'v1', 'created': 'Sun, 8 Sep 2019 01:13:51 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Dec 2021 13:38:22 GMT'}]",2021-12-30,"[['Zhang', 'Jinao', ''], ['Chauhan', 'Sunita', '']]","['Bio-heat transfer', 'real-time computation', 'fast explicit dynamics finite element analysis', 'parallel computation', 'thermal therapy']"
10196,2007.08265,Christoph Matthies,"Christoph Matthies, Franziska Dobrigkeit, Guenter Hesse","Mining for Process Improvements: Analyzing Software Repositories in
  Agile Retrospectives","In IEEE/ACM 42nd International Conference on Software Engineering
  Workshops (ICSEW'20)",,10.1145/3387940.3392168,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software Repositories contain knowledge on how software engineering teams
work, communicate, and collaborate. It can be used to develop a data-informed
view of a team's development process, which in turn can be employed for process
improvement initiatives. In modern, Agile development methods, process
improvement takes place in Retrospective meetings, in which the last
development iteration is discussed. However, previously proposed activities
that take place in these meetings often do not rely on project data, instead
depending solely on the perceptions of team members. We propose new
Retrospective activities, based on mining the software repositories of
individual teams, to complement existing approaches with more objective,
data-informed process views.
","[{'version': 'v1', 'created': 'Thu, 16 Jul 2020 11:32:30 GMT'}]",2020-07-17,"[['Matthies', 'Christoph', ''], ['Dobrigkeit', 'Franziska', ''], ['Hesse', 'Guenter', '']]","['Agile Software Development', 'Software Process Improvement', 'Mining Software Repositories', 'Retrospective']"
10197,1809.06121,Amir Abdi,"Amir H. Abdi, Pramit Saha, Praneeth Srungarapu, Sidney Fels","Muscle Excitation Estimation in Biomechanical Simulation Using NAF
  Reinforcement Learning","9 pages, 3 figures. Computational Biomechanics for Medicine. MICCAI
  2019. Springer, Cham",,10.1007/978-3-030-15923-8_11,,cs.LG cs.RO stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motor control is a set of time-varying muscle excitations which generate
desired motions for a biomechanical system. Muscle excitations cannot be
directly measured from live subjects. An alternative approach is to estimate
muscle activations using inverse motion-driven simulation. In this article, we
propose a deep reinforcement learning method to estimate the muscle excitations
in simulated biomechanical systems. Here, we introduce a custom-made reward
function which incentivizes faster point-to-point tracking of target motion.
Moreover, we deploy two new techniques, namely, episode-based hard update and
dual buffer experience replay, to avoid feedback training loops. The proposed
method is tested in four simulated 2D and 3D environments with 6 to 24 axial
muscles. The results show that the models were able to learn muscle excitations
for given motions after nearly 100,000 simulated steps. Moreover, the root mean
square error in point-to-point reaching of the target across experiments was
less than 1% of the length of the domain of motion. Our reinforcement learning
method is far from the conventional dynamic approaches as the muscle control is
derived functionally by a set of distributed neurons. This can open paths for
neural activity interpretation of this phenomenon.
","[{'version': 'v1', 'created': 'Mon, 17 Sep 2018 10:38:20 GMT'}, {'version': 'v2', 'created': 'Fri, 3 May 2019 21:12:12 GMT'}]",2019-10-29,"[['Abdi', 'Amir H.', ''], ['Saha', 'Pramit', ''], ['Srungarapu', 'Praneeth', ''], ['Fels', 'Sidney', '']]","['Deep reinforcement learning', 'Muscle excitation', 'Inverse motiondriven simulation', 'Normalized advantage function', 'Deep Q-network']"
10198,1911.04326,Francesco Calimeri,"Francesco Calimeri, Wolfgang Faber, Martin Gebser, Giovambattista
  Ianni, Roland Kaminski, Thomas Krennwallner, Nicola Leone, Marco Maratea,
  Francesco Ricca, Torsten Schaub",ASP-Core-2 Input Language Format,,Theory and Practice of Logic Programming 20 (2020) 294-309,10.1017/S1471068419000450,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Standardization of solver input languages has been a main driver for the
growth of several areas within knowledge representation and reasoning,
fostering the exploitation in actual applications. In this document we present
the ASP-Core-2 standard input language for Answer Set Programming, which has
been adopted in ASP Competition events since 2013.
","[{'version': 'v1', 'created': 'Mon, 11 Nov 2019 15:14:00 GMT'}]",2020-02-19,"[['Calimeri', 'Francesco', ''], ['Faber', 'Wolfgang', ''], ['Gebser', 'Martin', ''], ['Ianni', 'Giovambattista', ''], ['Kaminski', 'Roland', ''], ['Krennwallner', 'Thomas', ''], ['Leone', 'Nicola', ''], ['Maratea', 'Marco', ''], ['Ricca', 'Francesco', ''], ['Schaub', 'Torsten', '']]","['Answer Set Programming', 'Standard Language', 'Knowledge Representation and Reasoning', 'Standardization']"
10199,2111.08978,Pavel Telegin,"E.A. Kiselev, P.N. Telegin, B.M. Shabanov","An energy-efficient scheduling algorithm for shared facility
  supercomputer centers","8 pages, 4 figures",,10.1134/S1995080221110147,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The evolution of high-performance computing is associated with the growth of
energy consumption. Performance of cluster computes (is increased via rising in
performance and the number of used processors, GPUs, and coprocessors. An
increment in the number of computing elements results in significant growth of
energy consumption. Power grids limits for supercomputer centers (SCC) are
driving the transition to more energy-efficient solutions. Often upgrade of
computing resources is done step-by-step, i.e. parts of older supercomputers
are removed from service and replaced with newer ones. A single SCC at any time
can operate several computing systems with different performance and power
consumption. That is why the problem of scheduling parallel programs execution
on SCC resources to optimize energy consumption and minimize the increase in
execution time (energy-efficient scheduling) is important. The goal of the
presented work was the development of a new energy-efficient algorithm for
scheduling computing resources at SCC. To reach the goal the authors analyzed
methods of scheduling computing resources in a shared facility, including
energy consumption minimizing methods. The study made it possible to formulate
the problem of energy-efficient scheduling for a set of CCs and propose an
algorithm for its solution. Experiments on NPB benchmarks allowed achieving
significant reduction in energy consumption with a minor increase of runtime.
","[{'version': 'v1', 'created': 'Wed, 17 Nov 2021 08:54:45 GMT'}]",2022-12-23,"[['Kiselev', 'E. A.', ''], ['Telegin', 'P. N.', ''], ['Shabanov', 'B. M.', '']]","['energy efficiency', 'energy consumption profile', 'parallel programs', 'supercomputer', 'NAS Parallel Benchmarks']"
10200,2107.02278,R.Stuart Geiger,"R. Stuart Geiger, Dominique Cope, Jamie Ip, Marsha Lotosh, Aayush
  Shah, Jenny Weng, Rebekah Tang","""Garbage In, Garbage Out"" Revisited: What Do Machine Learning
  Application Papers Report About Human-Labeled Training Data?",,Quantitative Science Studies 2:2 (2021),10.1162/qss_a_00144,,cs.LG cs.CY cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Supervised machine learning, in which models are automatically derived from
labeled training data, is only as good as the quality of that data. This study
builds on prior work that investigated to what extent 'best practices' around
labeling training data were followed in applied ML publications within a single
domain (social media platforms). In this paper, we expand by studying
publications that apply supervised ML in a far broader spectrum of disciplines,
focusing on human-labeled data. We report to what extent a random sample of ML
application papers across disciplines give specific details about whether best
practices were followed, while acknowledging that a greater range of
application fields necessarily produces greater diversity of labeling and
annotation methods. Because much of machine learning research and education
only focuses on what is done once a ""ground truth"" or ""gold standard"" of
training data is available, it is especially relevant to discuss issues around
the equally-important aspect of whether such data is reliable in the first
place. This determination becomes increasingly complex when applied to a
variety of specialized fields, as labeling can range from a task requiring
little-to-no background knowledge to one that must be performed by someone with
career expertise.
","[{'version': 'v1', 'created': 'Mon, 5 Jul 2021 21:24:02 GMT'}]",2021-07-07,"[['Geiger', 'R. Stuart', ''], ['Cope', 'Dominique', ''], ['Ip', 'Jamie', ''], ['Lotosh', 'Marsha', ''], ['Shah', 'Aayush', ''], ['Weng', 'Jenny', ''], ['Tang', 'Rebekah', '']]","['machine learning', 'training data', 'bias', 'documentation', 'data reporting', 'researchreporting']"
10201,1604.04334,Deepak Ghimire,"Deepak Ghimire, Joonwhoan Lee, Ze-Nian Li, Sunghwan Jeong","Recognition of facial expressions based on salient geometric features
  and support vector machines","Facial points, Geometric features, AdaBoost, Extreme learning
  machine, Support vector machines, Facial expression recognitions",Multimedia Tools and Applications (2016): 1-26,10.1007/s11042-016-3428-9,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Facial expressions convey nonverbal cues which play an important role in
interpersonal relations, and are widely used in behavior interpretation of
emotions, cognitive science, and social interactions. In this paper we analyze
different ways of representing geometric feature and present a fully automatic
facial expression recognition (FER) system using salient geometric features. In
geometric feature-based FER approach, the first important step is to initialize
and track dense set of facial points as the expression evolves over time in
consecutive frames. In the proposed system, facial points are initialized using
elastic bunch graph matching (EBGM) algorithm and tracking is performed using
Kanade-Lucas-Tomaci (KLT) tracker. We extract geometric features from point,
line and triangle composed of tracking results of facial points. The most
discriminative line and triangle features are extracted using feature selective
multi-class AdaBoost with the help of extreme learning machine (ELM)
classification. Finally the geometric features for FER are extracted from the
boosted line, and triangles composed of facial points. The recognition accuracy
using features from point, line and triangle are analyzed independently. The
performance of the proposed FER system is evaluated on three different data
sets: namely CK+, MMI and MUG facial expression data sets.
","[{'version': 'v1', 'created': 'Fri, 15 Apr 2016 02:18:11 GMT'}]",2016-04-18,"[['Ghimire', 'Deepak', ''], ['Lee', 'Joonwhoan', ''], ['Li', 'Ze-Nian', ''], ['Jeong', 'Sunghwan', '']]","['facial points', 'geometric features', 'AdaBoost', 'extreme learning machine', 'support vector machines', 'facial expression recognitions']"
10202,1905.13157,Emil Je\v{r}\'abek,Emil Je\v{r}\'abek,Rules with parameters in modal logic II,67 pages,"Annals of Pure and Applied Logic 171 (2020), no. 10, article no.
  102829",10.1016/j.apal.2020.102829,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze the computational complexity of admissibility and unifiability
with parameters in transitive modal logics. The class of cluster-extensible
(clx) logics was introduced in the first part of this series of papers. We
completely classify the complexity of unifiability or inadmissibility in any
clx logic as being complete for one of $\Sigma^{\exp}_2$, NEXP, coNEXP, PSPACE,
or $\Pi^p_2$. In addition to the main case where arbitrary parameters are
allowed, we consider restricted problems with the number of parameters bounded
by a constant, and the parameter-free case. Our upper bounds are specific to
clx logics, but we also include similar results for logics of bounded depth and
width. In contrast, our lower bounds are very general: they apply each to a
class of all transitive logics whose frames allow occurrence of certain finite
subframes. We also discuss the baseline problem of complexity of derivability:
it is coNP-complete or PSPACE-complete for each clx logic. In particular, we
prove PSPACE-hardness of derivability for a broad class of transitive logics
that includes all logics with the disjunction property.
","[{'version': 'v1', 'created': 'Thu, 30 May 2019 16:27:12 GMT'}, {'version': 'v2', 'created': 'Sun, 3 May 2020 17:18:21 GMT'}]",2020-09-04,"[['Jeřábek', 'Emil', '']]","['modal logic', 'computational complexity', 'admissible rule', 'equational unification']"
10203,2203.10925,Zhengming Zhou,Zhengming Zhou and Qiulei Dong,"Learning Occlusion-Aware Coarse-to-Fine Depth Map for Self-supervised
  Monocular Depth Estimation",Accepted at ACM Multimedia 2022,,10.1145/3503161.3548381,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Self-supervised monocular depth estimation, aiming to learn scene depths from
single images in a self-supervised manner, has received much attention
recently. In spite of recent efforts in this field, how to learn accurate scene
depths and alleviate the negative influence of occlusions for self-supervised
depth estimation, still remains an open problem. Addressing this problem, we
firstly empirically analyze the effects of both the continuous and discrete
depth constraints which are widely used in the training process of many
existing works. Then inspired by the above empirical analysis, we propose a
novel network to learn an Occlusion-aware Coarse-to-Fine Depth map for
self-supervised monocular depth estimation, called OCFD-Net. Given an arbitrary
training set of stereo image pairs, the proposed OCFD-Net does not only employ
a discrete depth constraint for learning a coarse-level depth map, but also
employ a continuous depth constraint for learning a scene depth residual,
resulting in a fine-level depth map. In addition, an occlusion-aware module is
designed under the proposed OCFD-Net, which is able to improve the capability
of the learnt fine-level depth map for handling occlusions. Experimental
results on KITTI demonstrate that the proposed method outperforms the
comparative state-of-the-art methods under seven commonly used metrics in most
cases. In addition, experimental results on Make3D demonstrate the
effectiveness of the proposed method in terms of the cross-dataset
generalization ability under four commonly used metrics. The code is available
at https://github.com/ZM-Zhou/OCFD-Net_pytorch.
","[{'version': 'v1', 'created': 'Mon, 21 Mar 2022 12:43:42 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Sep 2022 06:46:13 GMT'}]",2022-09-16,"[['Zhou', 'Zhengming', ''], ['Dong', 'Qiulei', '']]","['Monocular depth estimation', 'self-supervised learning', 'neural network']"
10204,2203.06463,Jeovane Hon\'orio Alves,"Paulo Ricardo Lisboa de Almeida, Jeovane Hon\'orio Alves, Rafael Stubs
  Parpinelli and Jean Paul Barddal","A Systematic Review on Computer Vision-Based Parking Lot Management
  Applied on Public Datasets",Paper accepted at Expert Systems with Applications (ESWA),,10.1016/j.eswa.2022.116731,,cs.CV cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Computer vision-based parking lot management methods have been extensively
researched upon owing to their flexibility and cost-effectiveness. To evaluate
such methods authors often employ publicly available parking lot image
datasets. In this study, we surveyed and compared robust publicly available
image datasets specifically crafted to test computer vision-based methods for
parking lot management approaches and consequently present a systematic and
comprehensive review of existing works that employ such datasets. The
literature review identified relevant gaps that require further research, such
as the requirement of dataset-independent approaches and methods suitable for
autonomous detection of position of parking spaces. In addition, we have
noticed that several important factors such as the presence of the same cars
across consecutive images, have been neglected in most studies, thereby
rendering unrealistic assessment protocols. Furthermore, the analysis of the
datasets also revealed that certain features that should be present when
developing new benchmarks, such as the availability of video sequences and
images taken in more diverse conditions, including nighttime and snow, have not
been incorporated.
","[{'version': 'v1', 'created': 'Sat, 12 Mar 2022 15:35:29 GMT'}]",2022-03-15,"[['de Almeida', 'Paulo Ricardo Lisboa', ''], ['Alves', 'Jeovane Honório', ''], ['Parpinelli', 'Rafael Stubs', ''], ['Barddal', 'Jean Paul', '']]","['Parking lot', 'dataset', 'benchmark', 'machine learning', 'image']"
10205,2009.06965,Renming Liu,"Renming Liu (1), Siyu Chen (2), Yu Jiang (1), Ravi Seshadri (3), Moshe
  E. Ben-Akiva (2), Carlos Lima Azevedo (1) ((1) DTU Management, Technical
  University of Denmark, Denmark, (2) CEE, Massachusetts Institute of
  Technology, United States, (3) Singapore-MIT Alliance for Research and
  Technology, Singapore)","Managing network congestion with a tradable credit scheme: a trip-based
  MFD approach","44 pages, 11 figures",,10.1080/21680566.2022.2083034,,cs.GT cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study investigates the efficiency and effectiveness of an area-based
tradable credit scheme (TCS) using the trip-based Macroscopic Fundamental
Diagram model for the morning commute problem. In the proposed TCS, the
regulator distributes initial credits to all travelers and designs a
time-varying and trip length specific credit tariff. Credits are traded between
travelers and the regulator via a credit market, and the credit price is
determined by the demand and supply of credits. The heterogeneity of travelers
is considered in terms of desired arrival time, trip length and departure-time
choice preferences. The TCS is incorporated into a day-to-day modelling
framework to examine the travelers' learning process, the evolution of network,
and the properties of the credit market. The existence of an equilibrium
solution and the uniqueness of the credit price at the equilibrium state are
established analytically. Furthermore, an open-source simulation framework is
developed to validate the analytical properties of the proposed TCS and compare
it with alternative control strategies in terms of mobility, network
performance, and social welfare. Bayesian optimization is then adopted to
optimize the credit toll scheme. The numerical results demonstrate that the
proposed TCS outperforms the no-control case and matches the performance of the
time-of-day pricing strategy, while maintaining revenue-neutral nature.
","[{'version': 'v1', 'created': 'Tue, 15 Sep 2020 10:15:23 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Jan 2021 10:25:05 GMT'}]",2022-06-06,"[['Liu', 'Renming', ''], ['Chen', 'Siyu', ''], ['Jiang', 'Yu', ''], ['Seshadri', 'Ravi', ''], ['Ben-Akiva', 'Moshe E.', ''], ['Azevedo', 'Carlos Lima', '']]","['Tradable Credits', 'Trip-based Macroscopic FundamentalDiagram', 'Demand Management', 'Day-to-day dynamics', 'Bayesianoptimization']"
10206,2010.13496,Laura De Lorenzis,"Moritz Flaschel, Siddhant Kumar, Laura De Lorenzis",Unsupervised discovery of interpretable hyperelastic constitutive laws,,"Computer Methods in Applied Mechanics and Engineering, 381,
  113852, 2021",10.1016/j.cma.2021.113852,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new approach for data-driven automated discovery of isotropic
hyperelastic constitutive laws. The approach is unsupervised, i.e., it requires
no stress data but only displacement and global force data, which are
realistically available through mechanical testing and digital image
correlation techniques; it delivers interpretable models, i.e., models that are
embodied by parsimonious mathematical expressions discovered through sparse
regression of a large catalogue of candidate functions; it is one-shot, i.e.,
discovery only needs one experiment - but can use more if available. The
problem of unsupervised discovery is solved by enforcing equilibrium
constraints in the bulk and at the loaded boundary of the domain. Sparsity of
the solution is achieved by l_p regularization combined with thresholding,
which calls for a non-linear optimization scheme. The ensuing fully automated
algorithm leverages physics-based constraints for the automatic determination
of the penalty parameter in the regularization term. Using numerically
generated data including artificial noise, we demonstrate the ability of the
approach to accurately discover five hyperelastic models of different
complexity. We also show that, if a ""true"" feature is missing in the function
library, the proposed approach is able to surrogate it in such a way that the
actual response is still accurately predicted.
","[{'version': 'v1', 'created': 'Mon, 26 Oct 2020 11:38:51 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Dec 2020 10:28:52 GMT'}, {'version': 'v3', 'created': 'Tue, 6 Apr 2021 14:49:28 GMT'}]",2021-04-30,"[['Flaschel', 'Moritz', ''], ['Kumar', 'Siddhant', ''], ['De Lorenzis', 'Laura', '']]","['unsupervised learning', 'automated discovery', 'constitutive models', 'hyperelasticity', 'interpretable models', 'sparse regression', 'inverse problems']"
10207,2007.09946,Kees Middelburg,C. A. Middelburg,Program algebra for random access machine programs,"27 pages, revision of v2 with presentation improved. arXiv admin
  note: substantial text overlap with arXiv:1901.08840, arXiv:1808.04264",Scientific Annals of Computer Science 32(2):285-319 (2022),10.7561/SACS.2022.2.285,,cs.PL cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an algebraic theory of instruction sequences with
instructions for a random access machine (RAM) as basic instructions, the
behaviours produced by the instruction sequences concerned under execution, and
the interaction between such behaviours and RAM memories. This theory provides
a setting for the development of theory in areas such as computational
complexity and analysis of algorithms that distinguishes itself by offering the
possibility of equational reasoning to establish whether an instruction
sequence computes a given function and being more general than the setting
provided by any known version of the RAM model of computation. In this setting,
a semi-realistic version of the RAM model of computation and a bit-oriented
time complexity measure for this version are introduced. Under the time measure
concerned, semi-realistic RAMs can be simulated by multi-tape Turing machines
with quadratic time overhead.
","[{'version': 'v1', 'created': 'Mon, 20 Jul 2020 08:50:21 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Sep 2021 12:42:35 GMT'}, {'version': 'v3', 'created': 'Tue, 22 Nov 2022 15:11:13 GMT'}]",2023-01-26,"[['Middelburg', 'C. A.', '']]","['program algebra', 'thread algebra', 'random access machine', 'semi-realistic RAM program', 'bit-oriented time complexity']"
10208,2011.12265,Yingxue Fu,Yingxue Fu and Elaine Ui Dhonnchadha,"A Pattern-mining Driven Study on Differences of Newspapers in Expressing
  Temporal Information",19 pages,"David C. Wyld et al. (Eds): NLP, JSE, MLTEC, DMS, NeTIOT, ITCS,
  SIP, CST, ARIA - 2020 pp. 111-129, 2020. CS & IT - CSCP 2020",10.5121/csit.2020.101409,,cs.CL,http://creativecommons.org/licenses/by-sa/4.0/,"  This paper studies the differences between different types of newspapers in
expressing temporal information, which is a topic that has not received much
attention. Techniques from the fields of temporal processing and pattern mining
are employed to investigate this topic. First, a corpus annotated with temporal
information is created by the author. Then, sequences of temporal information
tags mixed with part-of-speech tags are extracted from the corpus. The TKS
algorithm is used to mine skip-gram patterns from the sequences. With these
patterns, the signatures of the four newspapers are obtained. In order to make
the signatures uniquely characterize the newspapers, we revise the signatures
by removing reference patterns. Through examining the number of patterns in the
signatures and revised signatures, the proportion of patterns containing
temporal information tags and the specific patterns containing temporal
information tags, it is found that newspapers differ in ways of expressing
temporal information.
","[{'version': 'v1', 'created': 'Tue, 24 Nov 2020 18:20:24 GMT'}]",2020-11-25,"[['Fu', 'Yingxue', ''], ['Dhonnchadha', 'Elaine Ui', '']]","['Pattern Mining', 'TKS algorithm', 'Temporal Annotation', 'Tabloids and  Broadsheets']"
10209,2207.04716,Martin Serror,"Sven Zemanek and Immanuel Hacker and Konrad Wolsing and Eric Wagner
  and Martin Henze and Martin Serror",PowerDuck: A GOOSE Data Set of Cyberattacks in Substations,Cyber Security Experimentation and Test Workshop (CSET 2022),,10.1145/3546096.3546102,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Power grids worldwide are increasingly victims of cyberattacks, where
attackers can cause immense damage to critical infrastructure. The growing
digitalization and networking in power grids combined with insufficient
protection against cyberattacks further exacerbate this trend. Hence, security
engineers and researchers must counter these new risks by continuously
improving security measures. Data sets of real network traffic during
cyberattacks play a decisive role in analyzing and understanding such attacks.
Therefore, this paper presents PowerDuck, a publicly available security data
set containing network traces of GOOSE communication in a physical substation
testbed. The data set includes recordings of various scenarios with and without
the presence of attacks. Furthermore, all network packets originating from the
attacker are clearly labeled to facilitate their identification. We thus
envision PowerDuck improving and complementing existing data sets of
substations, which are often generated synthetically, thus enhancing the
security of power grids.
","[{'version': 'v1', 'created': 'Mon, 11 Jul 2022 08:58:02 GMT'}]",2022-07-12,"[['Zemanek', 'Sven', ''], ['Hacker', 'Immanuel', ''], ['Wolsing', 'Konrad', ''], ['Wagner', 'Eric', ''], ['Henze', 'Martin', ''], ['Serror', 'Martin', '']]","['data sets', 'network traffic', 'smart grid security', 'IDS']"
10210,2210.05959,Jian Kang,"Jian Kang, Qinghai Zhou, Hanghang Tong","JuryGCN: Quantifying Jackknife Uncertainty on Graph Convolutional
  Networks",Accepted to KDD'22,,10.1145/3534678.3539286,,cs.LG cs.AI cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph Convolutional Network (GCN) has exhibited strong empirical performance
in many real-world applications. The vast majority of existing works on GCN
primarily focus on the accuracy while ignoring how confident or uncertain a GCN
is with respect to its predictions. Despite being a cornerstone of trustworthy
graph mining, uncertainty quantification on GCN has not been well studied and
the scarce existing efforts either fail to provide deterministic quantification
or have to change the training procedure of GCN by introducing additional
parameters or architectures. In this paper, we propose the first
frequentist-based approach named JuryGCN in quantifying the uncertainty of GCN,
where the key idea is to quantify the uncertainty of a node as the width of
confidence interval by a jackknife estimator. Moreover, we leverage the
influence functions to estimate the change in GCN parameters without
re-training to scale up the computation. The proposed JuryGCN is capable of
quantifying uncertainty deterministically without modifying the GCN
architecture or introducing additional parameters. We perform extensive
experimental evaluation on real-world datasets in the tasks of both active
learning and semi-supervised node classification, which demonstrate the
efficacy of the proposed method.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2022 06:56:35 GMT'}]",2022-10-13,"[['Kang', 'Jian', ''], ['Zhou', 'Qinghai', ''], ['Tong', 'Hanghang', '']]","['Graph neural networks', 'uncertainty quantification', 'jackknife']"
10211,2004.05868,Amir Javadpour,"Amir Javadpour, Guojun Wang, Samira Rezaei and Kuan Ching Li","Detecting Straggler MapReduce Tasks in Big Data Processing
  Infrastructure by Neural Network",,,10.1007/s11227-019-03136-6,,cs.DC cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Straggler task detection is one of the main challenges in applying MapReduce
for parallelizing and distributing large-scale data processing. It is defined
as detecting running tasks on weak nodes. Considering two stages in the Map
phase copy, combine and three stages of Reduce shuffle, sort and reduce, the
total execution time is the total sum of the execution time of these five
stages. Estimating the correct execution time in each stage that results in
correct total execution time is the primary purpose of this paper. The proposed
method is based on the application of a backpropagation Neural Network NN on
the Hadoop for the detection of straggler tasks, to estimate the remaining
execution time of tasks that is very important in straggler task detection.
Results achieved have been compared with popular algorithms in this domain such
as LATE, ESAMR and the real remaining time for WordCount and Sort benchmarks,
and shown able to detect straggler tasks and estimate execution time
accurately. Besides, it supports to accelerate task execution time.
","[{'version': 'v1', 'created': 'Mon, 13 Apr 2020 11:15:00 GMT'}]",2020-04-14,"[['Javadpour', 'Amir', ''], ['Wang', 'Guojun', ''], ['Rezaei', 'Samira', ''], ['Li', 'Kuan Ching', '']]","['Hadoop', 'Speculative execution', 'Straggler tasks', 'MapReduce', 'artificial neural network']"
10212,1410.4305,EPTCS,"Muhammad Sabir Idrees (Institut Mines-T\'el\'ecom, T\'el\'ecom
  Bretagne, France), Yves Roudier (Institut EURECOM, France), Ludovic Apvrille
  (Institut Mines-T\'el\'ecom, T\'el\'ecom ParisTech, France)","Model the System from Adversary Viewpoint: Threats Identification and
  Modeling","In Proceedings AIDP 2014, arXiv:1410.3226","EPTCS 165, 2014, pp. 45-58",10.4204/EPTCS.165.4,,cs.CR cs.SE cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security attacks are hard to understand, often expressed with unfriendly and
limited details, making it difficult for security experts and for security
analysts to create intelligible security specifications. For instance, to
explain Why (attack objective), What (i.e., system assets, goals, etc.), and
How (attack method), adversary achieved his attack goals. We introduce in this
paper a security attack meta-model for our SysML-Sec framework, developed to
improve the threat identification and modeling through the explicit
representation of security concerns with knowledge representation techniques.
Our proposed meta-model enables the specification of these concerns through
ontological concepts which define the semantics of the security artifacts and
introduced using SysML-Sec diagrams. This meta-model also enables representing
the relationships that tie several such concepts together. This representation
is then used for reasoning about the knowledge introduced by system designers
as well as security experts through the graphical environment of the SysML-Sec
framework.
","[{'version': 'v1', 'created': 'Thu, 16 Oct 2014 05:54:08 GMT'}]",2014-10-17,"[['Idrees', 'Muhammad Sabir', '', 'Institut Mines-Télécom, Télécom\n  Bretagne, France'], ['Roudier', 'Yves', '', 'Institut EURECOM, France'], ['Apvrille', 'Ludovic', '', 'Institut Mines-Télécom, Télécom ParisTech, France']]","['Computer Security', 'Network Security', 'Software Engineering', 'Meta-Models']"
10213,2008.05759,Tadej \v{S}kvorc,"Tadej \v{S}kvorc, Polona Gantar, Marko Robnik-\v{S}ikonja",MICE: Mining Idioms with Contextual Embeddings,,,10.1016/j.knosys.2021.107606,,cs.CL cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Idiomatic expressions can be problematic for natural language processing
applications as their meaning cannot be inferred from their constituting words.
A lack of successful methodological approaches and sufficiently large datasets
prevents the development of machine learning approaches for detecting idioms,
especially for expressions that do not occur in the training set. We present an
approach, called MICE, that uses contextual embeddings for that purpose. We
present a new dataset of multi-word expressions with literal and idiomatic
meanings and use it to train a classifier based on two state-of-the-art
contextual word embeddings: ELMo and BERT. We show that deep neural networks
using both embeddings perform much better than existing approaches, and are
capable of detecting idiomatic word use, even for expressions that were not
present in the training set. We demonstrate cross-lingual transfer of developed
models and analyze the size of the required dataset.
","[{'version': 'v1', 'created': 'Thu, 13 Aug 2020 08:56:40 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Nov 2021 11:20:28 GMT'}]",2021-11-11,"[['Škvorc', 'Tadej', ''], ['Gantar', 'Polona', ''], ['Robnik-Šikonja', 'Marko', '']]","['Machine learning', 'Natural language processing', 'Idiomatic']"
10214,2205.09296,Amirhossein Farzam,"Amirhossein Farzam, Parham Moradi, Saeedeh Mohammadi, Zahra Padar,
  Alexandra A. Siegel",Opinion Manipulation on Farsi Twitter,"21 pages, 9 figures, two appendices","Sci Rep 13, 333 (2023)",10.1038/s41598-022-26921-5,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  For Iranians and the Iranian diaspora, the Farsi Twittersphere provides an
important alternative to state media and an outlet for political discourse. But
this understudied online space has become an opinion manipulation battleground,
with diverse actors using inauthentic accounts to advance their goals and shape
online narratives. Examining trending discussions crossing social cleavages in
Iran, we explore how the dynamics of opinion manipulation differ across diverse
issue areas. Our analysis suggests that opinion manipulation by inauthentic
accounts is more prevalent in divisive political discussions than non-divisive
or apolitical discussions. We show how Twitter's network structures help to
reinforce the content propagated by clusters of inauthentic accounts in
divisive political discussions. Analyzing both the content and structure of
online discussions in the Iranian Twittersphere, this work contributes to a
growing body of literature exploring the dynamics of online opinion
manipulation, while improving our understanding of how information is
controlled in the digital age.
","[{'version': 'v1', 'created': 'Thu, 19 May 2022 02:51:58 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Jun 2022 03:18:28 GMT'}]",2023-01-10,"[['Farzam', 'Amirhossein', ''], ['Moradi', 'Parham', ''], ['Mohammadi', 'Saeedeh', ''], ['Padar', 'Zahra', ''], ['Siegel', 'Alexandra A.', '']]","['Political communication', 'Farsi Twitter', 'Opinion Manipulation', 'Inauthentic Activity', 'Polarization']"
10215,1912.12667,Yi Mei,"Yuzhou Zhang, Yi Mei, Buzhong Zhang, Keqin Jiang","Divide-and-Conquer Large Scale Capacitated Arc Routing Problems with
  Route Cutting Off Decomposition",,,10.1016/j.ins.2020.11.011,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The capacitated arc routing problem is a very important problem with many
practical applications. This paper focuses on the large scale capacitated arc
routing problem. Traditional solution optimization approaches usually fail
because of their poor scalability. The divide-and-conquer strategy has achieved
great success in solving large scale optimization problems by decomposing the
original large problem into smaller sub-problems and solving them separately.
For arc routing, a commonly used divide-and-conquer strategy is to divide the
tasks into subsets, and then solve the sub-problems induced by the task subsets
separately. However, the success of a divide-and-conquer strategy relies on a
proper task division, which is non-trivial due to the complex interactions
between the tasks. This paper proposes a novel problem decomposition operator,
named the route cutting off operator, which considers the interactions between
the tasks in a sophisticated way. To examine the effectiveness of the route
cutting off operator, we integrate it with two state-of-the-art
divide-and-conquer algorithms, and compared with the original counterparts on a
wide range of benchmark instances. The results show that the route cutting off
operator can improve the effectiveness of the decomposition, and lead to
significantly better results especially when the problem size is very large and
the time budget is very tight.
","[{'version': 'v1', 'created': 'Sun, 29 Dec 2019 14:52:21 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Dec 2020 10:30:17 GMT'}]",2020-12-11,"[['Zhang', 'Yuzhou', ''], ['Mei', 'Yi', ''], ['Zhang', 'Buzhong', ''], ['Jiang', 'Keqin', '']]","['Capacitated arc routing problem', 'route cutting off', 'large scale optimization', 'divide-and-conquer']"
10216,2105.03239,Bilal Abu-Salih,"Bilal Abu-Salih,Pornpit Wongthongtham, Dengya Zhu, Kit Yan Chan, Amit
  Rudra",Semantic data discovery from Social Big Data,arXiv admin note: substantial text overlap with arXiv:1801.01624,,10.1007/978-981-33-6652-7_4,,cs.DB,http://creativecommons.org/licenses/by/4.0/,"  Due to the large volume of data and information generated by a multitude of
social data sources, it is a huge challenge to manage and extract useful
knowledge, especially given the different forms of data, streaming data and
uncertainty and ambiguity of data. Hence, there are still challenges in this
area of BD analytics research to capture, store, process, visualise, query, and
manipulate datasets to derive meaningful information that is specific to an
application's domain. This chapter attempts to address this problem by studying
Semantic Analytics and domain knowledge modelling, and to what extent these
technologies can be utilised toward better understanding to the social textual
contents. In particular, the chapter gives an overview of semantic analysis and
domain ontology followed by shedding light on domain knowledge modelling,
inference, semantic storage, and publicly available semantic tools and APIs.
Also, the theoretical notion of Knowledge Graphs is reported and their
interlinking with SBD is discussed. The utility of the semantic analytics is
demonstrated and evaluated through a case study on social data in the context
of politics domain.
","[{'version': 'v1', 'created': 'Wed, 21 Apr 2021 19:24:34 GMT'}]",2021-05-10,"[['Abu-Salih', 'Bilal', ''], ['Wongthongtham', 'Pornpit', ''], ['Zhu', 'Dengya', ''], ['Chan', 'Kit Yan', ''], ['Rudra', 'Amit', '']]","['Semantic Analytics', 'Semantic Modelling', 'Sematic Inference and Interlinking', 'Knowledge Graphs', 'Twitter Mining']"
10217,1606.00234,Luc  Dartois,"Luc Dartois and Emmanuel Filiot and Pierre-Alain Reynier and Jean-Marc
  Talbot",Two-Way Visibly Pushdown Automata and Transducers,,,10.1145/2933575.2935315,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automata-logic connections are pillars of the theory of regular languages.
Such connections are harder to obtain for transducers, but important results
have been obtained recently for word-to-word transformations, showing that the
three following models are equivalent: deterministic two-way transducers,
monadic second-order (MSO) transducers, and deterministic one-way automata
equipped with a finite number of registers. Nested words are words with a
nesting structure, allowing to model unranked trees as their depth-first-search
linearisations. In this paper, we consider transformations from nested words to
words, allowing in particular to produce unranked trees if output words have a
nesting structure. The model of visibly pushdown transducers allows to describe
such transformations, and we propose a simple deterministic extension of this
model with two-way moves that has the following properties: i) it is a simple
computational model, that naturally has a good evaluation complexity; ii) it is
expressive: it subsumes nested word-to-word MSO transducers, and the exact
expressiveness of MSO transducers is recovered using a simple syntactic
restriction; iii) it has good algorithmic/closure properties: the model is
closed under composition with a unambiguous one-way letter-to-letter transducer
which gives closure under regular look-around, and has a decidable equivalence
problem.
","[{'version': 'v1', 'created': 'Wed, 1 Jun 2016 11:32:35 GMT'}]",2016-06-02,"[['Dartois', 'Luc', ''], ['Filiot', 'Emmanuel', ''], ['Reynier', 'Pierre-Alain', ''], ['Talbot', 'Jean-Marc', '']]","['Transductions', 'Pushdown automata', 'Logic']"
10218,2104.02291,Chainarong Amornbunchornvej,Chainarong Amornbunchornvej and Tanya Berger-Wolf,"Framework for Inferring Leadership Dynamics of Complex Movement from
  Time Series","This paper was appeared in the proceeding of the 2018 SIAM
  International Conference on Data Mining (SDM). The R package is available at
  https://github.com/DarkEyes/mFLICA","Proceedings of the 2018 SIAM International Conference on Data
  Mining (SDM)",10.1137/1.9781611975321.62,,cs.SI cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Leadership plays a key role in social animals, including humans,
decision-making and coalescence in coordinated activities such as hunting,
migration, sport, diplomatic negotiation etc. In these coordinated activities,
leadership is a process that organizes interactions among members to make a
group achieve collective goals. Understanding initiation of coordinated
activities allows scientists to gain more insight into social species
behaviors. However, by using only time series of activities data, inferring
leadership as manifested by the initiation of coordinated activities faces many
challenging issues. First, coordinated activities are dynamic and are changing
over time. Second, several different coordinated activities might occur
simultaneously among subgroups. Third, there is no fundamental concept to
describe these activities computationally. In this paper, we formalize Faction
Initiator Inference Problem and propose a leadership inference framework as a
solution of this problem. The framework makes no assumption about the
characteristics of a leader or the parameters of the coordination process. The
framework performs better than our non-trivial baseline in both simulated and
biological datasets (schools of fish). Moreover, we demonstrate the application
of our framework as a tool to study group merging and splitting dynamics on
another biological dataset of trajectories of wild baboons. In addition, our
problem formalization and framework enable opportunities for scientists to
analyze coordinated activities and generate scientific hypotheses about
collective behaviors that can be tested statistically and in the field.
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2021 05:14:32 GMT'}]",2021-04-07,"[['Amornbunchornvej', 'Chainarong', ''], ['Berger-Wolf', 'Tanya', '']]","['leadership', 'coordination', 'time series', 'influence', 'collective behavior']"
10219,2109.02079,Liang-Jian Deng,Jin-Fan Hu and Ting-Zhu Huang and Liang-Jian Deng,"Fusformer: A Transformer-based Fusion Approach for Hyperspectral Image
  Super-resolution",,,10.1109/LGRS.2022.3194257,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Hyperspectral image has become increasingly crucial due to its abundant
spectral information. However, It has poor spatial resolution with the
limitation of the current imaging mechanism. Nowadays, many convolutional
neural networks have been proposed for the hyperspectral image super-resolution
problem. However, convolutional neural network (CNN) based methods only
consider the local information instead of the global one with the limited
kernel size of receptive field in the convolution operation. In this paper, we
design a network based on the transformer for fusing the low-resolution
hyperspectral images and high-resolution multispectral images to obtain the
high-resolution hyperspectral images. Thanks to the representing ability of the
transformer, our approach is able to explore the intrinsic relationships of
features globally. Furthermore, considering the LR-HSIs hold the main spectral
structure, the network focuses on the spatial detail estimation releasing from
the burden of reconstructing the whole data. It reduces the mapping space of
the proposed network, which enhances the final performance. Various experiments
and quality indexes show our approach's superiority compared with other
state-of-the-art methods.
","[{'version': 'v1', 'created': 'Sun, 5 Sep 2021 14:00:34 GMT'}]",2022-10-05,"[['Hu', 'Jin-Fan', ''], ['Huang', 'Ting-Zhu', ''], ['Deng', 'Liang-Jian', '']]","['Hyperspectral image super-resolution', 'Image fusion', 'Transformer']"
10220,2206.01062,Michele Dolfi,"Birgit Pfitzmann, Christoph Auer, Michele Dolfi, Ahmed S Nassar, Peter
  W J Staar",DocLayNet: A Large Human-Annotated Dataset for Document-Layout Analysis,"9 pages, 6 figures, 5 tables. Accepted paper at SIGKDD 2022
  conference",,10.1145/3534678.3539043,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate document layout analysis is a key requirement for high-quality PDF
document conversion. With the recent availability of public, large ground-truth
datasets such as PubLayNet and DocBank, deep-learning models have proven to be
very effective at layout detection and segmentation. While these datasets are
of adequate size to train such models, they severely lack in layout variability
since they are sourced from scientific article repositories such as PubMed and
arXiv only. Consequently, the accuracy of the layout segmentation drops
significantly when these models are applied on more challenging and diverse
layouts. In this paper, we present \textit{DocLayNet}, a new, publicly
available, document-layout annotation dataset in COCO format. It contains 80863
manually annotated pages from diverse data sources to represent a wide
variability in layouts. For each PDF page, the layout annotations provide
labelled bounding-boxes with a choice of 11 distinct classes. DocLayNet also
provides a subset of double- and triple-annotated pages to determine the
inter-annotator agreement. In multiple experiments, we provide baseline
accuracy scores (in mAP) for a set of popular object detection models. We also
demonstrate that these models fall approximately 10\% behind the
inter-annotator agreement. Furthermore, we provide evidence that DocLayNet is
of sufficient size. Lastly, we compare models trained on PubLayNet, DocBank and
DocLayNet, showing that layout predictions of the DocLayNet-trained models are
more robust and thus the preferred choice for general-purpose document-layout
analysis.
","[{'version': 'v1', 'created': 'Thu, 2 Jun 2022 14:25:12 GMT'}]",2022-08-18,"[['Pfitzmann', 'Birgit', ''], ['Auer', 'Christoph', ''], ['Dolfi', 'Michele', ''], ['Nassar', 'Ahmed S', ''], ['Staar', 'Peter W J', '']]","['PDF document conversion', 'layout segmentation', 'object-detection', 'data set', 'Machine Learning']"
10221,2208.08097,Ziyi Ye,"Ziyi Ye, Xiaohui Xie, Yiqun Liu, Zhihong Wang, Xuesong Chen, Min
  Zhang, Shaoping Ma","Brain Topography Adaptive Network for Satisfaction Modeling in
  Interactive Information Access System",Accepted by Multimedia 2022 (MM'22) as a full paper,,10.1145/3503161.3548258,,cs.HC cs.IR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the growth of information on the Web, most users heavily rely on
information access systems (e.g., search engines, recommender systems, etc.) in
their daily lives. During this procedure, modeling users' satisfaction status
plays an essential part in improving their experiences with the systems. In
this paper, we aim to explore the benefits of using Electroencephalography
(EEG) signals for satisfaction modeling in interactive information access
system design. Different from existing EEG classification tasks, the arisen of
satisfaction involves multiple brain functions, such as arousal,
prototypicality, and appraisals, which are related to different brain
topographical areas. Thus modeling user satisfaction raises great challenges to
existing solutions. To address this challenge, we propose BTA, a Brain
Topography Adaptive network with a multi-centrality encoding module and a
spatial attention mechanism module to capture cognitive connectivities in
different spatial distances. We explore the effectiveness of BTA for
satisfaction modeling in two popular information access scenarios, i.e., search
and recommendation. Extensive experiments on two real-world datasets verify the
effectiveness of introducing brain topography adaptive strategy in satisfaction
modeling. Furthermore, we also conduct search result re-ranking task and video
rating prediction task based on the satisfaction inferred from brain signals on
search and recommendation scenarios, respectively. Experimental results show
that brain signals extracted with BTA help improve the performance of
interactive information access systems significantly.
","[{'version': 'v1', 'created': 'Wed, 17 Aug 2022 06:22:35 GMT'}]",2022-08-18,"[['Ye', 'Ziyi', ''], ['Xie', 'Xiaohui', ''], ['Liu', 'Yiqun', ''], ['Wang', 'Zhihong', ''], ['Chen', 'Xuesong', ''], ['Zhang', 'Min', ''], ['Ma', 'Shaoping', '']]","['Satisfaction Modeling', 'EEG signal processing', 'Search', 'Recommendation']"
10222,1912.07794,Shimin Gong,"Shimin Gong, Xiao Lu, Dinh Thai Hoang, Dusit Niyato, Lei Shu, Dong In
  Kim, and Ying-Chang Liang","Towards Smart Wireless Communications via Intelligent Reflecting
  Surfaces: A Contemporary Survey","31 pages, 10 figures, 6 tables, 203 references","IEEE Communications Surveys & Tutorials, June 2020",10.1109/COMST.2020.3004197,,cs.IT cs.ET math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a literature review on recent applications and design
aspects of the intelligent reflecting surface (IRS) in the future wireless
networks. Conventionally, the network optimization has been limited to
transmission control at two endpoints, i.e., end users and network controller.
The fading wireless channel is uncontrollable and becomes one of the main
limiting factors for performance improvement. The IRS is composed of a large
array of scattering elements, which can be individually configured to generate
additional phase shifts to the signal reflections. Hence, it can actively
control the signal propagation properties in favor of signal reception, and
thus realize the notion of a smart radio environment. As such, the IRS's phase
control, combined with the conventional transmission control, can potentially
bring performance gain compared to wireless networks without IRS. In this
survey, we first introduce basic concepts of the IRS and the realizations of
its reconfigurability. Then, we focus on applications of the IRS in wireless
communications. We overview different performance metrics and analytical
approaches to characterize the performance improvement of IRS-assisted wireless
networks. To exploit the performance gain, we discuss the joint optimization of
the IRS's phase control and the transceivers' transmission control in different
network design problems, e.g.,~rate maximization and power minimization
problems. Furthermore, we extend the discussion of IRS-assisted wireless
networks to some emerging use cases. Finally, we highlight important practical
challenges and future research directions for realizing IRS-assisted wireless
networks in beyond 5G communications.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2019 02:54:31 GMT'}, {'version': 'v2', 'created': 'Tue, 19 May 2020 04:09:57 GMT'}]",2020-07-28,"[['Gong', 'Shimin', ''], ['Lu', 'Xiao', ''], ['Hoang', 'Dinh Thai', ''], ['Niyato', 'Dusit', ''], ['Shu', 'Lei', ''], ['Kim', 'Dong In', ''], ['Liang', 'Ying-Chang', '']]","['Intelligent reflecting surface', 'smart radio environment', 'passive beamforming', 'IRS-assisted wireless networks']"
10223,1604.06030,Paul Attie,Paul C. Attie and Nancy A. Lynch,"Dynamic Input/Output Automata: a Formal and Compositional Model for
  Dynamic Systems","65 pages, 11 figures, Information and Computation, Available online
  21 March 2016",,10.1016/j.ic.2016.03.008,,cs.DC cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present dynamic I/O automata (DIOA), a compositional model of dynamic
systems. In DIOA, automata can be created and destroyed dynamically, as
computation proceeds, and an automaton can dynamically change its signature,
i.e., the set of actions in which it can participate.
  DIOA features operators for parallel composition, action hiding, action
renaming, a notion of automaton creation, and a notion of behavioral subtyping
by means of trace inclusion. DIOA can model mobility, using signature
modification, and is hierarchical: a dynamically changing system of interacting
automata is itself modeled as a single automaton.
  We also show that parallel composition, action hiding, action renaming, and
(subject to some technical conditions) automaton creation are all monotonic
with respect to trace inclusion: if one component is replaced by another whose
traces are a subset of the former, then the set of traces of the system as a
whole can only be reduced.
","[{'version': 'v1', 'created': 'Wed, 20 Apr 2016 16:49:32 GMT'}]",2016-04-21,"[['Attie', 'Paul C.', ''], ['Lynch', 'Nancy A.', '']]","['dynamic systems', 'formal methods', 'semantics', 'automata', 'process creation', 'mobility']"
10224,1907.05548,Priyanka Mukhopadhyay Dr,Priyanka Mukhopadhyay,"The Projection Games Conjecture and the Hardness of Approximation of
  super-SAT and related problems",Compared to v2 : Revised version. Slightly changed title,"Journal of Computer and System Sciences, 123 (2022) 186-201",10.1016/j.jcss.2021.09.002,,cs.CC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The Super-SAT or SSAT problem was introduced by Dinur et al.(2002,2003) to
prove the NP-hardness of approximation of two popular lattice problems -
Shortest Vector Problem(SVP) and Closest Vector Problem(CVP). They conjectured
that SSAT is NP-hard to approximate to within a factor of $n^c$ ($c>0$ is
constant), where $n$ is the size of the SSAT instance. In this paper we prove
this conjecture assuming the Projection Games Conjecture(PGC), given by
Moshkovitz (2012). This implies hardness of approximation of SVP and CVP within
polynomial factors, assuming PGC. We also reduce SSAT to the Nearest Codeword
Problem(NCP) and Learning Halfspace Problem(LHP), as considered by Arora et
al.(1997). This proves that both these problems are NP-hard to approximate
within a factor of $N^{c'/\log\log n}$($c'>0$ is constant) where $N$ is the
size of the instances of the respective problems. Assuming PGC these problems
are proved to be NP-hard to approximate within polynomial factors.
","[{'version': 'v1', 'created': 'Fri, 12 Jul 2019 02:12:57 GMT'}, {'version': 'v2', 'created': 'Sun, 3 Nov 2019 23:46:07 GMT'}, {'version': 'v3', 'created': 'Tue, 5 Oct 2021 15:46:13 GMT'}]",2021-10-06,"[['Mukhopadhyay', 'Priyanka', '']]","['Projection Games Conjecture', 'Inapproximability', 'Shortest Vector Problem', 'Closest Vector']"
10225,2108.06289,Gordon Fraser,"Florian Oberm\""uller, Lena Bloch, Luisa Greifenstein, Ute Heuer,
  Gordon Fraser",Code Perfumes: Reporting Good Code to Encourage Learners,"To be published in the proceedings of the 16th Workshop in Primary
  and Secondary Computing Education (WIPSCE)",,10.1145/3481312.3481346,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Block-based programming languages like Scratch enable children to be creative
while learning to program. Even though the block-based approach simplifies the
creation of programs, learning to program can nevertheless be challenging.
Automated tools such as linters therefore support learners by providing
feedback about potential bugs or code smells in their programs. Even when this
feedback is elaborate and constructive, it still represents purely negative
criticism and by construction ignores what learners have done correctly in
their programs. In this paper we introduce an orthogonal approach to linting:
We complement the criticism produced by a linter with positive feedback. We
introduce the concept of code perfumes as the counterpart to code smells,
indicating the correct application of programming practices considered to be
good. By analysing not only what learners did wrong but also what they did
right we hope to encourage learners, to provide teachers and students a better
understanding of learners' progress, and to support the adoption of automated
feedback tools. Using a catalogue of 25 code perfumes for Scratch, we
empirically demonstrate that these represent frequent practices in Scratch, and
we find that better programs indeed contain more code perfumes.
","[{'version': 'v1', 'created': 'Fri, 13 Aug 2021 15:36:50 GMT'}]",2021-08-16,"[['Obermüller', 'Florian', ''], ['Bloch', 'Lena', ''], ['Greifenstein', 'Luisa', ''], ['Heuer', 'Ute', ''], ['Fraser', 'Gordon', '']]","['Scratch', 'Block-based programming', 'Linting', 'Code quality']"
10226,2205.07781,Luiz Capretz Dr.,"Luiz Fernando Capretz, Jingdong Jia, Pradeep Waychal, Shuib Basri",Social Aspects of Software Testing: Comparative Studies in Asia,"10 pages. arXiv admin note: substantial text overlap with
  arXiv:1906.11015","10th World Conference on Information Systems and Technologies
  (WorldCIST 2022), Budva, Montenegro, Lecture Notes in Networks and Systems
  (LNNS), Volume 468, pp. 346-355, Springer, 2022",10.1007/978-3-031-04826-5_34,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  This study attempts to understand motivators and de-motivators that influence
the decisions of software students to take up and sustain software testing
careers across three different Asian countries, i.e., China, India, and
Malaysia. The re-search question can be framed as How many software students
across different Asian geographies are keen to take up testing careers, and
what are the reasons for their choices? Towards an answer, we developed a
cross-sectional but simple survey-based instrument. In this work, we
investigated how software students perceived the software testing role. The
results from China and India revealed that students are not very keen on taking
up a software tester career, but the Malaysia students show a more positive
attitude towards software testing. The study also pointed out the importance of
considering software testing activities as a set of human-dependent tasks and
emphasized the need for further re-search that examines critically individual
assessments of software testers about software testing activities. This
investigation can academics involved in software testing courses to understand
the impacting factors on the motivation and de-motivators of their students, as
well as to try convey positive view of testing as challenging and requires
critical thinking and innovative ideas.
","[{'version': 'v1', 'created': 'Mon, 16 May 2022 16:13:25 GMT'}]",2022-05-17,"[['Capretz', 'Luiz Fernando', ''], ['Jia', 'Jingdong', ''], ['Waychal', 'Pradeep', ''], ['Basri', 'Shuib', '']]","['Social Aspects of Software Testing', 'Human Factors in Software Engineering', 'Software Testing', 'Software Careers', 'Cross-Cultural Study']"
10227,2101.06166,Marcos Eduardo Valle,Guilherme Vieira and Marcos Eduardo Valle,A General Framework for Hypercomplex-valued Extreme Learning Machines,,"Journal of Computational Mathematics and Data Science, Volume 3,
  June 2022. Article 100032",10.1016/j.jcmds.2022.100032,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper aims to establish a framework for extreme learning machines (ELMs)
on general hypercomplex algebras. Hypercomplex neural networks are machine
learning models that feature higher-dimension numbers as parameters, inputs,
and outputs. Firstly, we review broad hypercomplex algebras and show a
framework to operate in these algebras through real-valued linear algebra
operations in a robust manner. We proceed to explore a handful of well-known
four-dimensional examples. Then, we propose the hypercomplex-valued ELMs and
derive their learning using a hypercomplex-valued least-squares problem.
Finally, we compare real and hypercomplex-valued ELM models' performance in an
experiment on time-series prediction and another on color image auto-encoding.
The computational experiments highlight the excellent performance of
hypercomplex-valued ELMs to treat high-dimensional data, including models based
on unusual hypercomplex algebras.
","[{'version': 'v1', 'created': 'Fri, 15 Jan 2021 15:22:05 GMT'}]",2022-05-27,"[['Vieira', 'Guilherme', ''], ['Valle', 'Marcos Eduardo', '']]","['Feedforward neural network', 'extreme learning machine', 'hypercomplex number system', 'color image auto-encoding', 'time-series prediction']"
10228,1307.0201,Magnus Lie Hetland,Magnus Lie Hetland,Simulating Ability: Representing Skills in Games,,"Serious Games Development and Applications. Lecture Notes in
  Computer Science Volume 8101, 2013, pp 226-238",10.1007/978-3-642-40790-1_22,,cs.GT cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Throughout the history of games, representing the abilities of the various
agents acting on behalf of the players has been a central concern. With
increasingly sophisticated games emerging, these simulations have become more
realistic, but the underlying mechanisms are still, to a large extent, of an ad
hoc nature. This paper proposes using a logistic model from psychometrics as a
unified mechanism for task resolution in simulation-oriented games.
","[{'version': 'v1', 'created': 'Sun, 30 Jun 2013 13:10:01 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Jul 2013 08:43:46 GMT'}]",2013-10-04,"[['Hetland', 'Magnus Lie', '']]","['games', 'characters', 'skills', 'task resolution', 'simulation', 'psychometrics']"
10229,2007.15385,Rahman Salim Zengin,"Rahman Salim Zengin (1), Volkan Sezer (1) ((1) Istanbul Technical
  University)","A Novel Point Inclusion Test for Convex Polygons Based on Voronoi
  Tessellations","8 pages, 6 figures, ""for the source code, see
  https://github.com/volimpro/voronoi_pip""","Applied Mathematics and Computation, Volume 399, 2021, 126001",10.1016/j.amc.2021.126001,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The point inclusion tests for polygons, in other words the point-in-polygon
(PIP) algorithms, are fundamental tools for many scientific fields related to
computational geometry, and they have been studied for a long time. The PIP
algorithms get direct or indirect geometric definition of a polygonal entity,
and validate its containment of a given point. The PIP algorithms, which are
working directly on the geometric entities, derive linear boundary definitions
for the edges of the polygons. Moreover, almost all direct test methods rely on
the two-point form of the line equation to partition the space into
half-spaces. Voronoi tessellations use an alternate approach for half-space
partitioning. Instead of line equation, distance comparison between generator
points is used to accomplish the same task. Voronoi tessellations consist of
convex polygons, which are defined between generator points. Therefore, Voronoi
tessellations have become an inspiration for us to develop a new approach of
the PIP testing, specialized for convex polygons. The equations, essential to
the conversion of a convex polygon to a Voronoi polygon, are derived. As a
reference, a very standard convex PIP testing algorithm, \textit{the sign of
offset}, is selected for comparison. For generalization of the comparisons,
\textit{the ray crossing} algorithm is used as another reference. All
algorithms are implemented as vector and matrix operations without any
branching. This enabled us to benefit from the CPU optimizations of the
underlying linear algebra libraries. Experimentation showed that, our proposed
algorithm can have comparable performance characteristics with the reference
algorithms. Moreover, it has simplicity, both from a geometric representation
and the mental model.
","[{'version': 'v1', 'created': 'Thu, 30 Jul 2020 11:23:44 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Aug 2020 17:35:27 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Jan 2021 21:12:03 GMT'}]",2021-02-03,"[['Zengin', 'Rahman Salim', ''], ['Sezer', 'Volkan', '']]","['point inclusion test', 'point in polygon', 'convex polygon', 'Voronoi tessellations']"
10230,2208.09292,Hiba Arnaout,"Hiba Arnaout, Simon Razniewski, Gerhard Weikum, Jeff Z. Pan",UnCommonSense: Informative Negative Knowledge about Everyday Concepts,,,10.1145/3511808.3557484,,cs.AI cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Commonsense knowledge about everyday concepts is an important asset for AI
applications, such as question answering and chatbots. Recently, we have seen
an increasing interest in the construction of structured commonsense knowledge
bases (CSKBs). An important part of human commonsense is about properties that
do not apply to concepts, yet existing CSKBs only store positive statements.
Moreover, since CSKBs operate under the open-world assumption, absent
statements are considered to have unknown truth rather than being invalid. This
paper presents the UNCOMMONSENSE framework for materializing informative
negative commonsense statements. Given a target concept, comparable concepts
are identified in the CSKB, for which a local closed-world assumption is
postulated. This way, positive statements about comparable concepts that are
absent for the target concept become seeds for negative statement candidates.
The large set of candidates is then scrutinized, pruned and ranked by
informativeness. Intrinsic and extrinsic evaluations show that our method
significantly outperforms the state-of-the-art. A large dataset of informative
negations is released as a resource for future research.
","[{'version': 'v1', 'created': 'Fri, 19 Aug 2022 12:14:02 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Aug 2022 07:42:33 GMT'}, {'version': 'v3', 'created': 'Mon, 5 Sep 2022 07:02:33 GMT'}]",2022-09-07,"[['Arnaout', 'Hiba', ''], ['Razniewski', 'Simon', ''], ['Weikum', 'Gerhard', ''], ['Pan', 'Jeff Z.', '']]","['Knowledge Bases', 'Negation', 'Commonsense']"
10231,2204.01303,Junseok Lee,"Junseok Lee, Yunhak Oh, Yeonjun In, Namkyeong Lee, Dongmin Hyun,
  Chanyoung Park","GraFN: Semi-Supervised Node Classification on Graph with Few Labels via
  Non-Parametric Distribution Assignment",SIGIR 2022(Short Paper),,10.1145/3477495.3531838,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the success of Graph Neural Networks (GNNs) on various applications,
GNNs encounter significant performance degradation when the amount of
supervision signals, i.e., number of labeled nodes, is limited, which is
expected as GNNs are trained solely based on the supervision obtained from the
labeled nodes. On the other hand,recent self-supervised learning paradigm aims
to train GNNs by solving pretext tasks that do not require any labeled nodes,
and it has shown to even outperform GNNs trained with few labeled nodes.
However, a major drawback of self-supervised methods is that they fall short of
learning class discriminative node representations since no labeled information
is utilized during training. To this end, we propose a novel semi-supervised
method for graphs, GraFN, that leverages few labeled nodes to ensure nodes that
belong to the same class to be grouped together, thereby achieving the best of
both worlds of semi-supervised and self-supervised methods. Specifically, GraFN
randomly samples support nodes from labeled nodes and anchor nodes from the
entire graph. Then, it minimizes the difference between two predicted class
distributions that are non-parametrically assigned by anchor-supports
similarity from two differently augmented graphs. We experimentally show that
GraFN surpasses both the semi-supervised and self-supervised methods in terms
of node classification on real-world graphs. The source code for GraFN is
available at https://github.com/Junseok0207/GraFN.
","[{'version': 'v1', 'created': 'Mon, 4 Apr 2022 08:22:30 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Apr 2022 05:16:33 GMT'}, {'version': 'v3', 'created': 'Wed, 27 Apr 2022 21:57:05 GMT'}]",2022-04-29,"[['Lee', 'Junseok', ''], ['Oh', 'Yunhak', ''], ['In', 'Yeonjun', ''], ['Lee', 'Namkyeong', ''], ['Hyun', 'Dongmin', ''], ['Park', 'Chanyoung', '']]","['Semi-Supervised', 'Graph Neural Networks', 'Node Classification', 'Graph Representation Learning', 'Few Label']"
10232,2103.16399,Pawe{\l} W. Wo\'zniak,"Marit Bentvelzen and Jasmin Niess and Miko{\l}aj P. Wo\'zniak and
  Pawe{\l} W. Wo\'zniak","The Development and Validation of the Technology-Supported Reflection
  Inventory","CHI Conference on Human Factors in Computing Systems (CHI '21), May
  8--13, 2021, Yokohama, Japan",,10.1145/3411764.3445673,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reflection is an often addressed design goal in Human-Computer Interaction
(HCI) research. An increasing number of artefacts for reflection have been
developed in recent years. However, evaluating if and how an interactive
technology helps a user reflect is still complex. This makes it difficult to
compare artefacts (or prototypes) for reflection, impeding future design
efforts. To address this issue, we developed the \emph{Technology-Supported
Reflection Inventory} (TSRI), which is a scale that evaluates how effectively a
system supports reflection. We first created a list of possible scale items
based on past work in defining reflection. The items were then reviewed by
experts. Next, we performed exploratory factor analysis to reduce the scale to
its final length of nine items. Subsequently, we confirmed test-retest validity
of our instrument, as well as its construct validity. The TSRI enables
researchers and practitioners to compare prototypes designed to support
reflection.
","[{'version': 'v1', 'created': 'Tue, 30 Mar 2021 14:48:42 GMT'}]",2021-03-31,"[['Bentvelzen', 'Marit', ''], ['Niess', 'Jasmin', ''], ['Woźniak', 'Mikołaj P.', ''], ['Woźniak', 'Paweł W.', '']]","['personal informatics', 'reflection', 'tracking', 'construal']"
10233,1812.10334,Sergey Belim,"S.V. Belim, S.Yu. Belim","Implementation of Simplex Channels in the Blom's Keys Pre-Distribution
  Scheme",,,10.1088/1742-6596/1210/1/012008,,cs.CR cs.DS cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In article the modification of the Blom's keys preliminary distribution
scheme, considering the direction of information streams is suggested. For this
modification it is necessary to use function from three variables. Function of
formation of key materials will be the asymmetrical. The exponential form of
this function which does not increase the volume of key materials is suggested.
","[{'version': 'v1', 'created': 'Wed, 26 Dec 2018 14:56:48 GMT'}]",2019-05-22,"[['Belim', 'S. V.', ''], ['Belim', 'S. Yu.', '']]","['keys pre-distribution scheme', 'Blom’s scheme', 'security model', 'ID-based cryp']"
10234,1910.13875,Vasisht Duddu,"Vasisht Duddu, N. Rajesh Pillai, D. Vijay Rao, Valentina E. Balas",Fault Tolerance of Neural Networks in Adversarial Settings,,Journal of Intelligent and Fuzzy Systems (JIFS) 2020,10.3233/JIFS-179677,,cs.CR cs.DC cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Artificial Intelligence systems require a through assessment of different
pillars of trust, namely, fairness, interpretability, data and model privacy,
reliability (safety) and robustness against against adversarial attacks. While
these research problems have been extensively studied in isolation, an
understanding of the trade-off between different pillars of trust is lacking.
To this extent, the trade-off between fault tolerance, privacy and adversarial
robustness is evaluated for the specific case of Deep Neural Networks, by
considering two adversarial settings under a security and a privacy threat
model. Specifically, this work studies the impact of the fault tolerance of the
Neural Network on training the model by adding noise to the input (Adversarial
Robustness) and noise to the gradients (Differential Privacy). While training
models with noise to inputs, gradients or weights enhances fault tolerance, it
is observed that adversarial robustness and fault tolerance are at odds with
each other. On the other hand, ($\epsilon,\delta$)-Differentially Private
models enhance the fault tolerance, measured using generalisation error,
theoretically has an upper bound of $e^{\epsilon} - 1 + \delta$. This novel
study of the trade-off between different elements of trust is pivotal for
training a model which satisfies the requirements for different pillars of
trust simultaneously.
","[{'version': 'v1', 'created': 'Wed, 30 Oct 2019 14:22:22 GMT'}, {'version': 'v2', 'created': 'Sat, 7 Mar 2020 16:21:15 GMT'}]",2020-03-10,"[['Duddu', 'Vasisht', ''], ['Pillai', 'N. Rajesh', ''], ['Rao', 'D. Vijay', ''], ['Balas', 'Valentina E.', '']]","['Trustworthy Machine Learning', 'Differential Privacy', 'Fault Tolerance', 'Adversarial Robustness', 'Deep Learning']"
10235,2005.01992,Milad Moradi,"Milad Moradi, Matthias Samwald",Post-hoc explanation of black-box classifiers using confident itemsets,,"Expert Systems with Applications, vol. 165, p. 113941, 2021",10.1016/j.eswa.2020.113941,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Black-box Artificial Intelligence (AI) methods, e.g. deep neural networks,
have been widely utilized to build predictive models that can extract complex
relationships in a dataset and make predictions for new unseen data records.
However, it is difficult to trust decisions made by such methods since their
inner working and decision logic is hidden from the user. Explainable
Artificial Intelligence (XAI) refers to systems that try to explain how a
black-box AI model produces its outcomes. Post-hoc XAI methods approximate the
behavior of a black-box by extracting relationships between feature values and
the predictions. Perturbation-based and decision set methods are among commonly
used post-hoc XAI systems. The former explanators rely on random perturbations
of data records to build local or global linear models that explain individual
predictions or the whole model. The latter explanators use those feature values
that appear more frequently to construct a set of decision rules that produces
the same outcomes as the target black-box. However, these two classes of XAI
methods have some limitations. Random perturbations do not take into account
the distribution of feature values in different subspaces, leading to
misleading approximations. Decision sets only pay attention to frequent feature
values and miss many important correlations between features and class labels
that appear less frequently but accurately represent decision boundaries of the
model. In this paper, we address the above challenges by proposing an
explanation method named Confident Itemsets Explanation (CIE). We introduce
confident itemsets, a set of feature values that are highly correlated to a
specific class label. CIE utilizes confident itemsets to discretize the whole
decision space of a model to smaller subspaces.
","[{'version': 'v1', 'created': 'Tue, 5 May 2020 08:11:24 GMT'}, {'version': 'v2', 'created': 'Sun, 20 Sep 2020 21:24:58 GMT'}]",2020-09-22,"[['Moradi', 'Milad', ''], ['Samwald', 'Matthias', '']]","['Explainable artificial intelligence', 'Machine learning', 'Post-hoc explanation', 'Confident']"
10236,2206.10924,John Ortega,John E. Ortega,Enhancing Networking Cipher Algorithms with Natural Language,"12 pages, David C. Wyld et al. (Eds): CONEDU, CSITA, MLCL, ISPR,
  NATAP, ARIN - 2022 pp. 43-54, 2022. CS & IT - CSCP 2022 DOI:
  10.5121/csit.2022.121013","David C. Wyld et al. (Eds): CONEDU, CSITA, MLCL, ISPR, NATAP, ARIN
  - 2022, pp. 43-54, 2022. CS & IT",10.5121/csit.2022.121013,,cs.CL cs.CR cs.NI,http://creativecommons.org/licenses/by/4.0/,"  This work provides a survey of several networking cipher algorithms and
proposes a method for integrating natural language processing (NLP) as a
protective agent for them. Two main proposals are covered for the use of NLP in
networking. First, NLP is considered as the weakest link in a networking
encryption model; and, second, as a hefty deterrent when combined as an extra
layer over what could be considered a strong type of encryption -- the stream
cipher. This paper summarizes how languages can be integrated into symmetric
encryption as a way to assist in the encryption of vulnerable streams that may
be found under attack due to the natural frequency distribution of letters or
words in a local language stream.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2022 09:05:52 GMT'}]",2022-06-23,"[['Ortega', 'John E.', '']]","['Networking', 'Natural Language Processing', 'Security', 'Stream Ciphers']"
10237,1801.06726,Dmitrii Ustiugov,"Dmitrii Ustiugov, Alexandros Daglis, Javier Picorel, Mark Sutherland,
  Edouard Bugnion, Babak Falsafi, Dionisios Pnevmatikatos",Design Guidelines for High-Performance SCM Hierarchies,Published at MEMSYS'18,,10.1145/3240302.3240310,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With emerging storage-class memory (SCM) nearing commercialization, there is
evidence that it will deliver the much-anticipated high density and access
latencies within only a few factors of DRAM. Nevertheless, the
latency-sensitive nature of memory-resident services makes seamless integration
of SCM in servers questionable. In this paper, we ask the question of how best
to introduce SCM for such servers to improve overall performance/cost over
existing DRAM-only architectures. We first show that even with the most
optimistic latency projections for SCM, the higher memory access latency
results in prohibitive performance degradation. However, we find that
deployment of a modestly sized high-bandwidth 3D stacked DRAM cache makes the
performance of an SCM-mostly memory system competitive. The high degree of
spatial locality that memory-resident services exhibit not only simplifies the
DRAM cache's design as page-based, but also enables the amortization of
increased SCM access latencies and the mitigation of SCM's read/write latency
disparity.
  We identify the set of memory hierarchy design parameters that plays a key
role in the performance and cost of a memory system combining an SCM technology
and a 3D stacked DRAM cache. We then introduce a methodology to drive
provisioning for each of these design parameters under a target
performance/cost goal. Finally, we use our methodology to derive concrete
results for specific SCM technologies. With PCM as a case study, we show that a
two bits/cell technology hits the performance/cost sweet spot, reducing the
memory subsystem cost by 40% while keeping performance within 3% of the best
performing DRAM-only system, whereas single-level and triple-level cell
organizations are impractical for use as memory replacements.
","[{'version': 'v1', 'created': 'Sat, 20 Jan 2018 20:42:49 GMT'}, {'version': 'v2', 'created': 'Tue, 8 May 2018 13:18:32 GMT'}, {'version': 'v3', 'created': 'Fri, 11 May 2018 17:52:18 GMT'}, {'version': 'v4', 'created': 'Thu, 7 Mar 2019 19:03:49 GMT'}]",2019-03-11,"[['Ustiugov', 'Dmitrii', ''], ['Daglis', 'Alexandros', ''], ['Picorel', 'Javier', ''], ['Sutherland', 'Mark', ''], ['Bugnion', 'Edouard', ''], ['Falsafi', 'Babak', ''], ['Pnevmatikatos', 'Dionisios', '']]","['Storage-class memory', 'heterogeneous memory hierarchy', '3D stacked DRAM']"
10238,2103.07662,Jeremy Straub,Jeremy Straub,"Defining, Evaluating, Preparing for and Responding to a Cyber Pearl
  Harbor",,Technology in Society 65 (2021),10.1016/j.techsoc.2021.101599,,cs.CR cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Despite not having a clear meaning, public perception and awareness makes the
term cyber Pearl Harbor an important part of the public discourse. This paper
considers what the term has meant and proposes its decomposition based on three
different aspects of the historical Pearl Harbor attack, allowing the lessons
from Pearl Harbor to be applied to threats and subjects that may not align with
all aspects of the 1941 attack. Using these three definitions, prior attacks
and current threats are assessed and preparation for and response to cyber
Pearl Harbor events is discussed.
","[{'version': 'v1', 'created': 'Sat, 13 Mar 2021 09:15:27 GMT'}]",2021-04-28,"[['Straub', 'Jeremy', '']]","['cyber Pearl Harbor', 'cyber warfare', 'information warfare', 'influence warfare', 'multi-modal warfare']"
10239,2101.06310,Daniel Osaku,"D. Osaku, C. F. Cuba, Celso T.N. Suzuki, J.F. Gomes, A.X. Falc\~ao","Automated Diagnosis of Intestinal Parasites: A new hybrid approach and
  its benefits","18 pages, 11 figures","Computers in Biology and Medicine, Volume 123, August 2020, 103917",10.1016/j.compbiomed.2020.103917,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intestinal parasites are responsible for several diseases in human beings. In
order to eliminate the error-prone visual analysis of optical microscopy
slides, we have investigated automated, fast, and low-cost systems for the
diagnosis of human intestinal parasites. In this work, we present a hybrid
approach that combines the opinion of two decision-making systems with
complementary properties: ($DS_1$) a simpler system based on very fast
handcrafted image feature extraction and support vector machine classification
and ($DS_2$) a more complex system based on a deep neural network, Vgg-16, for
image feature extraction and classification. $DS_1$ is much faster than $DS_2$,
but it is less accurate than $DS_2$. Fortunately, the errors of $DS_1$ are not
the same of $DS_2$. During training, we use a validation set to learn the
probabilities of misclassification by $DS_1$ on each class based on its
confidence values. When $DS_1$ quickly classifies all images from a microscopy
slide, the method selects a number of images with higher chances of
misclassification for characterization and reclassification by $DS_2$. Our
hybrid system can improve the overall effectiveness without compromising
efficiency, being suitable for the clinical routine -- a strategy that might be
suitable for other real applications. As demonstrated on large datasets, the
proposed system can achieve, on average, 94.9%, 87.8%, and 92.5% of Cohen's
Kappa on helminth eggs, helminth larvae, and protozoa cysts, respectively.
","[{'version': 'v1', 'created': 'Thu, 7 Jan 2021 05:11:01 GMT'}]",2021-01-19,"[['Osaku', 'D.', ''], ['Cuba', 'C. F.', ''], ['Suzuki', 'Celso T. N.', ''], ['Gomes', 'J. F.', ''], ['Falcão', 'A. X.', '']]","['Image classification', 'Microscopy image analysis', 'Automated diagnosisof intestinal parasites', 'Support vector machines', 'Deep neural networks']"
10240,1904.09268,Mohammad Riyaz Belgaum,"Zainab Alansari, Nor Badrul Anuar, Amirrudin Kamsin, Safeeullah Soomro
  and Mohammad Riyaz Belgaum","Evaluation of IoT-Based Computational Intelligence Tools for DNA
  Sequence Analysis in Bioinformatics",,,10.1007/978-981-13-0224-4_31,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In contemporary age, Computational Intelligence (CI) performs an essential
role in the interpretation of big biological data considering that it could
provide all of the molecular biology and DNA sequencing computations. For this
purpose, many researchers have attempted to implement different tools in this
field and have competed aggressively. Hence, determining the best of them among
the enormous number of available tools is not an easy task, selecting the one
which accomplishes big data in the concise time and with no error can
significantly improve the scientist's contribution in the bioinformatics field.
This study uses different analysis and methods such as Fuzzy, Dempster-Shafer,
Murphy and Entropy Shannon to provide the most significant and reliable
evaluation of IoT-based computational intelligence tools for DNA sequence
analysis. The outcomes of this study can be advantageous to the bioinformatics
community, researchers and experts in big biological data.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2019 09:47:52 GMT'}]",2020-10-02,"[['Alansari', 'Zainab', ''], ['Anuar', 'Nor Badrul', ''], ['Kamsin', 'Amirrudin', ''], ['Soomro', 'Safeeullah', ''], ['Belgaum', 'Mohammad Riyaz', '']]","['Internet of Things', 'Computational Intelligence', 'DNA Sequence Analysis', 'Bioinformatics', 'Big Data', 'Entropy Analysis']"
10241,2103.08924,Ang Jia,"Ang Jia, Ming Fan, Xi Xu, Di Cui, Wenying Wei, Zijiang Yang, Kai Ye,
  Ting Liu",From Innovations to Prospects: What Is Hidden Behind Cryptocurrencies?,10 pages,"MSR '20: 17th International Conference on Mining Software
  Repositories Seoul Republic of Korea June, 2020",10.1145/3379597.3387439,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The great influence of Bitcoin has promoted the rapid development of
blockchain-based digital currencies, especially the altcoins, since 2013.
However, most altcoins share similar source codes, resulting in concerns about
code innovations. In this paper, an empirical study on existing altcoins is
carried out to offer a thorough understanding of various aspects associated
with altcoin innovations. Firstly, we construct the dataset of altcoins,
including source code repositories, GitHub fork relations, and market
capitalizations (cap). Then, we analyze the altcoin innovations from the
perspective of source code similarities. The results demonstrate that more than
85% of altcoin repositories present high code similarities. Next, a temporal
clustering algorithm is proposed to mine the inheritance relationship among
various altcoins. The family pedigrees of altcoin are constructed, in which the
altcoin presents similar evolution features as biology, such as power-law in
family size, variety in family evolution, etc. Finally, we investigate the
correlation between code innovations and market capitalization. Although we
fail to predict the price of altcoins based on their code similarities, the
results show that altcoins with higher innovations reflect better market
prospects.
","[{'version': 'v1', 'created': 'Tue, 16 Mar 2021 09:08:57 GMT'}]",2021-03-17,"[['Jia', 'Ang', ''], ['Fan', 'Ming', ''], ['Xu', 'Xi', ''], ['Cui', 'Di', ''], ['Wei', 'Wenying', ''], ['Yang', 'Zijiang', ''], ['Ye', 'Kai', ''], ['Liu', 'Ting', '']]","['Altcoins', 'Innovations', 'Relation', 'Prospects']"
10242,2204.02462,Joshua Barnett,Joshua Barnett and Charbel Farhat,"Quadratic Approximation Manifold for Mitigating the Kolmogorov Barrier
  in Nonlinear Projection-Based Model Order Reduction",,,10.1016/j.jcp.2022.111348,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A quadratic approximation manifold is presented for performing nonlinear,
projection-based, model order reduction (PMOR). It constitutes a departure from
the traditional affine subspace approximation that is aimed at mitigating the
Kolmogorov barrier for nonlinear PMOR, particularly for convection-dominated
transport problems. It builds on the data-driven approach underlying the
traditional construction of projection-based reduced-order models (PROMs); is
application-independent; is linearization-free; and therefore is robust for
highly nonlinear problems. Most importantly, this approximation leads to
quadratic PROMs that deliver the same accuracy as their traditional
counterparts using however a much smaller dimension -- typically, $n_2 \sim
\sqrt n_1$, where $n_2$ and $n_1$ denote the dimensions of the quadratic and
traditional PROMs, respectively. The computational advantages of the proposed
high-order approach to nonlinear PMOR over the traditional approach are
highlighted for the detached-eddy simulation-based prediction of the Ahmed body
turbulent wake flow, which is a popular CFD benchmark problem in the automotive
industry. For a fixed accuracy level, these advantages include: a reduction of
the total offline computational cost by a factor greater than five; a reduction
of its online wall clock time by a factor greater than 32; and a reduction of
the wall clock time of the underlying high-dimensional model by a factor
greater than two orders of magnitude.
","[{'version': 'v1', 'created': 'Tue, 5 Apr 2022 19:37:15 GMT'}]",2022-06-15,"[['Barnett', 'Joshua', ''], ['Farhat', 'Charbel', '']]","['Ahmed body', 'Kolmogorov n-width', 'Machine learning', 'Model reduction', 'Petrov-Galerkin', 'Proper orthogonal decomposition', 'Quadratic manifold']"
10243,2109.06969,D. M. Anisuzzaman,"D. M. Anisuzzaman, Yash Patel, Behrouz Rostami, Jeffrey Niezgoda,
  Sandeep Gopalakrishnan, and Zeyun Yu","Multi-modal Wound Classification using Wound Image and Location by Deep
  Neural Network","30 pages, 10 figures, 15 tables","Sci Rep 12, 20057 (2022)",10.1038/s41598-022-21813-0,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wound classification is an essential step of wound diagnosis. An efficient
classifier can assist wound specialists in classifying wound types with less
financial and time costs and help them decide an optimal treatment procedure.
This study developed a deep neural network-based multi-modal classifier using
wound images and their corresponding locations to categorize wound images into
multiple classes, including diabetic, pressure, surgical, and venous ulcers. A
body map is also developed to prepare the location data, which can help wound
specialists tag wound locations more efficiently. Three datasets containing
images and their corresponding location information are designed with the help
of wound specialists. The multi-modal network is developed by concatenating the
image-based and location-based classifier's outputs with some other
modifications. The maximum accuracy on mixed-class classifications (containing
background and normal skin) varies from 77.33% to 100% on different
experiments. The maximum accuracy on wound-class classifications (containing
only diabetic, pressure, surgical, and venous) varies from 72.95% to 98.08% on
different experiments. The proposed multi-modal network also shows a
significant improvement in results from the previous works of literature.
","[{'version': 'v1', 'created': 'Tue, 14 Sep 2021 21:00:30 GMT'}]",2022-12-06,"[['Anisuzzaman', 'D. M.', ''], ['Patel', 'Yash', ''], ['Rostami', 'Behrouz', ''], ['Niezgoda', 'Jeffrey', ''], ['Gopalakrishnan', 'Sandeep', ''], ['Yu', 'Zeyun', '']]","['wound multimodality classification', 'wound location classification', 'body map', 'deep learning', 'transfer learning']"
10244,1905.12409,Hefeng Wu,"Hefeng Wu, Yafei Hu, Keze Wang, Hanhui Li, Lin Nie, Hui Cheng","Instance-Aware Representation Learning and Association for Online
  Multi-Person Tracking",accepted by Pattern Recognition,,10.1016/j.patcog.2019.04.018,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-Person Tracking (MPT) is often addressed within the
detection-to-association paradigm. In such approaches, human detections are
first extracted in every frame and person trajectories are then recovered by a
procedure of data association (usually offline). However, their performances
usually degenerate in presence of detection errors, mutual interactions and
occlusions. In this paper, we present a deep learning based MPT approach that
learns instance-aware representations of tracked persons and robustly online
infers states of the tracked persons. Specifically, we design a multi-branch
neural network (MBN), which predicts the classification confidences and
locations of all targets by taking a batch of candidate regions as input. In
our MBN architecture, each branch (instance-subnet) corresponds to an
individual to be tracked and new branches can be dynamically created for
handling newly appearing persons. Then based on the output of MBN, we construct
a joint association matrix that represents meaningful states of tracked persons
(e.g., being tracked or disappearing from the scene) and solve it by using the
efficient Hungarian algorithm. Moreover, we allow the instance-subnets to be
updated during tracking by online mining hard examples, accounting to person
appearance variations over time. We comprehensively evaluate our framework on a
popular MPT benchmark, demonstrating its excellent performance in comparison
with recent online MPT methods.
","[{'version': 'v1', 'created': 'Wed, 29 May 2019 13:16:12 GMT'}]",2019-05-30,"[['Wu', 'Hefeng', ''], ['Hu', 'Yafei', ''], ['Wang', 'Keze', ''], ['Li', 'Hanhui', ''], ['Nie', 'Lin', ''], ['Cheng', 'Hui', '']]","['Representation Learning', 'Online Tracking', 'Multi-Person Tracking', 'Data Association']"
10245,1812.10668,\'Alvaro L\'opez Garc\'ia,"\'Alvaro L\'opez Garc\'ia, Enol Fern\'andez-del-Castillo, Isabel
  Campos Plasencia",An efficient cloud scheduler design supporting preemptible instances,,Future Generation Computer Systems (2019),10.1016/j.future.2018.12.057,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Maximizing resource utilization by performing an efficient resource
provisioning is a key factor for any cloud provider: commercial actors can
maximize their revenues, whereas scientific and non-commercial providers can
maximize their infrastructure utilization. Traditionally, batch systems have
allowed data centers to fill their resources as much as possible by using
backfilling and similar techniques. However, in an IaaS cloud, where virtual
machines are supposed to live indefinitely, or at least as long as the user is
able to pay for them, these policies are not easily implementable. In this work
we present a new scheduling algorithm for IaaS providers that is able to
support preemptible instances, that can be stopped by higher priority requests
without introducing large modifications in the current cloud schedulers. This
scheduler enables the implementation of new cloud usage and payment models that
allow more efficient usage of the resources and potential new revenue sources
for commercial providers. We also study the correctness and the performace
overhead of the proposed scheduler agains existing solutions.
","[{'version': 'v1', 'created': 'Thu, 27 Dec 2018 09:14:37 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Jan 2019 10:10:37 GMT'}, {'version': 'v3', 'created': 'Tue, 28 Jan 2020 08:42:41 GMT'}]",2020-01-29,"[['García', 'Álvaro López', ''], ['Fernández-del-Castillo', 'Enol', ''], ['Plasencia', 'Isabel Campos', '']]","['Cloud computing', 'scheduling', 'preemptible instances', 'Spot Instances', 'resource allocation']"
10246,2102.01273,Samuel Reinders,"Matthew Butler, Leona Holloway, Samuel Reinders, Cagatay Goncu, Kim
  Marriott","Technology Developments in Touch-Based Accessible Graphics: A Systematic
  Review of Research 2010-2020","To appear in ACM CHI Conference on Human Factors in Computing Systems
  (CHI '21), May 8-13, 2021, Yokohama, Japan",,10.1145/3411764.3445207,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a systematic literature review of 292 publications from
97 unique venues on touch-based graphics for people who are blind or have low
vision, from 2010 to mid-2020. It is the first review of its kind on
touch-based accessible graphics. It is timely because it allows us to assess
the impact of new technologies such as commodity 3D printing and low-cost
electronics on the production and presentation of accessible graphics. As
expected our review shows an increase in publications from 2014 that we can
attribute to these developments. It also reveals the need to: broaden
application areas, especially to the workplace; broaden end-user participation
throughout the full design process; and conduct more in situ evaluation. This
work is linked to an online living resource to be shared with the wider
community.
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2021 03:13:49 GMT'}]",2021-02-03,"[['Butler', 'Matthew', ''], ['Holloway', 'Leona', ''], ['Reinders', 'Samuel', ''], ['Goncu', 'Cagatay', ''], ['Marriott', 'Kim', '']]","['Systematic Literature Review', 'Assistive Technology', 'Tactile Graphics', 'Blind', 'Low Vision']"
10247,1904.12149,Laurenz Aldu Cornelissen Mr.,"Laurenz A Cornelissen, Petrus Schoonwinkel, Richard J Barnett","A Socio-Informatic Approach to Automated Account Classification on
  Social Media",International Conference on Social Media and Society,,10.1145/3328529.3328541,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated accounts on social media have become increasingly problematic. We
propose a key feature in combination with existing methods to improve machine
learning algorithms for bot detection. We successfully improve classification
performance through including the proposed feature.
","[{'version': 'v1', 'created': 'Sat, 27 Apr 2019 11:50:14 GMT'}]",2019-04-30,"[['Cornelissen', 'Laurenz A', ''], ['Schoonwinkel', 'Petrus', ''], ['Barnett', 'Richard J', '']]","['Automated agent classification', 'supervised ensemble learning', 'social network analysis', 'information repertoire']"
10248,1704.00979,Artem Sevastopolsky,Artem Sevastopolsky,"Optic Disc and Cup Segmentation Methods for Glaucoma Detection with
  Modification of U-Net Convolutional Neural Network","accepted for publication in ""Pattern Recognition and Image Analysis:
  Advances in Mathematical Theory and Applications"" journal, ISSN 1054-6618",,10.1134/S1054661817030269,,cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Glaucoma is the second leading cause of blindness all over the world, with
approximately 60 million cases reported worldwide in 2010. If undiagnosed in
time, glaucoma causes irreversible damage to the optic nerve leading to
blindness. The optic nerve head examination, which involves measurement of
cup-to-disc ratio, is considered one of the most valuable methods of structural
diagnosis of the disease. Estimation of cup-to-disc ratio requires segmentation
of optic disc and optic cup on eye fundus images and can be performed by modern
computer vision algorithms. This work presents universal approach for automatic
optic disc and cup segmentation, which is based on deep learning, namely,
modification of U-Net convolutional neural network. Our experiments include
comparison with the best known methods on publicly available databases
DRIONS-DB, RIM-ONE v.3, DRISHTI-GS. For both optic disc and cup segmentation,
our method achieves quality comparable to current state-of-the-art methods,
outperforming them in terms of the prediction time.
","[{'version': 'v1', 'created': 'Tue, 4 Apr 2017 12:28:12 GMT'}]",2018-05-01,"[['Sevastopolsky', 'Artem', '']]","['glaucoma detection', 'eye fundus', 'image segmentation', 'computer vision', 'optic']"
10249,2204.03625,Satwik Kundu,Satwik Kundu and Swaroop Ghosh,"Security Aspects of Quantum Machine Learning: Opportunities, Threats and
  Defenses","6 pages, GLSVLSI'22 Special Session",,10.1145/3526241.3530833,,cs.CR cs.LG quant-ph,http://creativecommons.org/licenses/by-sa/4.0/,"  In the last few years, quantum computing has experienced a growth spurt. One
exciting avenue of quantum computing is quantum machine learning (QML) which
can exploit the high dimensional Hilbert space to learn richer representations
from limited data and thus can efficiently solve complex learning tasks.
Despite the increased interest in QML, there have not been many studies that
discuss the security aspects of QML. In this work, we explored the possible
future applications of QML in the hardware security domain. We also expose the
security vulnerabilities of QML and emerging attack models, and corresponding
countermeasures.
","[{'version': 'v1', 'created': 'Thu, 7 Apr 2022 17:44:22 GMT'}]",2022-04-08,"[['Kundu', 'Satwik', ''], ['Ghosh', 'Swaroop', '']]","['Quantum Computing', 'Hardware Security', 'Quantum Neural Network', 'Attacks & Defenses']"
10250,1708.03352,Muaz Niazi,"Noreen Akhtar, Muaz A. Niazi, Farah Mustafa, Amir Hussain","A discrete event system specification (DEVS)-based model of
  consanguinity","41 pages, 10 figures","Journal of theoretical biology, 285(1), 103-112 (2011)",10.1016/j.jtbi.2011.05.038,,cs.SI cs.CY cs.DM q-bio.PE q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consanguinity or inter-cousin marriage is a phenomenon quite prevalent in
certain regions around the globe. Consanguineous parents have a higher risk of
having offspring with congenital disorders. It is difficult to model large
scale consanguineous parental populations because of disparate cultural issues
unique to regions and cultures across the globe. Although consanguinity, as a
social problem has been studied previously, consanguinity from a biological
perspective has yet to be modeled. Discrete Event System Specification (DEVS)
formalism is a powerful modeling formalism for the study of intricate details
of real-world complex systems. In this article, we develop a DEVS model to get
an insight into the role of consanguineous marriages in the evolution of
congenital disorders in a population. As proof-of-concept, we develop a
consanguinity simulation model in Simio simulation software. Our results show
the effectiveness of DEVS in the modeling of consanguinity effects in causing
congenital defects.
","[{'version': 'v1', 'created': 'Thu, 10 Aug 2017 18:28:04 GMT'}]",2017-08-14,"[['Akhtar', 'Noreen', ''], ['Niazi', 'Muaz A.', ''], ['Mustafa', 'Farah', ''], ['Hussain', 'Amir', '']]","['Consanguineous Marriages', 'Simulation', 'Congenital Disorder', 'Modeling', 'DEVS Formalism']"
10251,2205.12403,Chloe LeGendre,"Chloe LeGendre, Lukas Lepicovsky, Paul Debevec","Jointly Optimizing Color Rendition and In-Camera Backgrounds in an RGB
  Virtual Production Stage",DigiPro 2022,,10.1145/3543664.3543681,,cs.CV cs.GR,http://creativecommons.org/licenses/by/4.0/,"  While the LED panels used in virtual production systems can display vibrant
imagery with a wide color gamut, they produce problematic color shifts when
used as lighting due to their peaky spectral output from narrow-band red,
green, and blue LEDs. In this work, we present an improved color calibration
process for virtual production stages which ameliorates this color rendition
problem while also passing through accurate in-camera background colors. We do
this by optimizing linear color correction transformations for 1) the LED panel
pixels visible in the field of view of the camera, 2) the pixels outside the
field of view of the camera illuminating the subjects, and, as a post-process,
3) the pixel values recorded by the camera. The result is that footage shot in
an RGB LED panel virtual production stage can exhibit more accurate skin tones
and costume colors while still reproducing the desired colors of the in-camera
background.
","[{'version': 'v1', 'created': 'Tue, 24 May 2022 23:23:40 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Jul 2022 18:01:19 GMT'}]",2022-07-05,"[['LeGendre', 'Chloe', ''], ['Lepicovsky', 'Lukas', ''], ['Debevec', 'Paul', '']]","['virtual production', 'image-based lighting', 'color rendition']"
10252,2205.00189,Katie Seaborn,"Takane Ueno, Yuto Sawa, Yeongdae Kim, Jacqueline Urakami, Hiroki Oura,
  Katie Seaborn","Trust in Human-AI Interaction: Scoping Out Models, Measures, and Methods",Accepted at CHI EA '22,"CHI EA '22: CHI Conference on Human Factors in Computing Systems
  Extended Abstracts, April 2022, Article No.: 254",10.1145/3491101.3519772,,cs.HC cs.AI cs.RO,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Trust has emerged as a key factor in people's interactions with AI-infused
systems. Yet, little is known about what models of trust have been used and for
what systems: robots, virtual characters, smart vehicles, decision aids, or
others. Moreover, there is yet no known standard approach to measuring trust in
AI. This scoping review maps out the state of affairs on trust in human-AI
interaction (HAII) from the perspectives of models, measures, and methods.
Findings suggest that trust is an important and multi-faceted topic of study
within HAII contexts. However, most work is under-theorized and under-reported,
generally not using established trust models and missing details about methods,
especially Wizard of Oz. We offer several targets for systematic review work as
well as a research agenda for combining the strengths and addressing the
weaknesses of the current literature.
","[{'version': 'v1', 'created': 'Sat, 30 Apr 2022 07:34:19 GMT'}]",2022-05-03,"[['Ueno', 'Takane', ''], ['Sawa', 'Yuto', ''], ['Kim', 'Yeongdae', ''], ['Urakami', 'Jacqueline', ''], ['Oura', 'Hiroki', ''], ['Seaborn', 'Katie', '']]","['Artificial intelligence', 'Automation', 'Robots', 'Trust', 'Decision aids', 'Scoping review']"
10253,2101.10865,Jonathan Spring,"Jonathan M. Spring and April Galyardt and Allen D. Householder and
  Nathan VanHoudnos",On managing vulnerabilities in AI/ML systems,16 pages. New Security Paradigms Workshop,,10.1145/3442167.3442177,,cs.CR cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper explores how the current paradigm of vulnerability management
might adapt to include machine learning systems through a thought experiment:
what if flaws in machine learning (ML) were assigned Common Vulnerabilities and
Exposures (CVE) identifiers (CVE-IDs)? We consider both ML algorithms and model
objects. The hypothetical scenario is structured around exploring the changes
to the six areas of vulnerability management: discovery, report intake,
analysis, coordination, disclosure, and response. While algorithm flaws are
well-known in the academic research community, there is no apparent clear line
of communication between this research community and the operational
communities that deploy and manage systems that use ML. The thought experiments
identify some ways in which CVE-IDs may establish some useful lines of
communication between these two communities. In particular, it would start to
introduce the research community to operational security concepts, which
appears to be a gap left by existing efforts.
","[{'version': 'v1', 'created': 'Fri, 22 Jan 2021 21:59:44 GMT'}]",2021-01-27,"[['Spring', 'Jonathan M.', ''], ['Galyardt', 'April', ''], ['Householder', 'Allen D.', ''], ['VanHoudnos', 'Nathan', '']]","['vulnerability management', 'machine learning', 'CVE-ID', 'prioritization']"
10254,2207.01090,Minh Nguyen,Minh Nguyen and Nicolas Wu,Folding over Neural Networks,,,10.1007/978-3-031-16912-0_5,,cs.PL cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Neural networks are typically represented as data structures that are
traversed either through iteration or by manual chaining of method calls.
However, a deeper analysis reveals that structured recursion can be used
instead, so that traversal is directed by the structure of the network itself.
This paper shows how such an approach can be realised in Haskell, by encoding
neural networks as recursive data types, and then their training as recursion
scheme patterns. In turn, we promote a coherent implementation of neural
networks that delineates between their structure and semantics, allowing for
compositionality in both how they are built and how they are trained.
","[{'version': 'v1', 'created': 'Sun, 3 Jul 2022 18:20:05 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Jul 2022 11:49:55 GMT'}]",2022-09-30,"[['Nguyen', 'Minh', ''], ['Wu', 'Nicolas', '']]","['Recursion schemes', 'neural networks', 'data structures', 'embeddeddomain-specific languages', 'functional programming']"
10255,1810.03173,Saed Moradi,"Saed Moradi, Payman Moallem, Mohamad Farzan Sabahi","Fast and Robust Small Infrared Target Detection Using Absolute
  Directional Mean Difference Algorithm",The Final version (Accepted in Signal Processing journal),,10.1016/j.sigpro.2020.107727,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Infrared small target detection in an infrared search and track (IRST) system
is a challenging task. This situation becomes more complicated when high
gray-intensity structural backgrounds appear in the field of view (FoV) of the
infrared seeker. While the majority of the infrared small target detection
algorithms neglect directional information, in this paper, a directional
approach is presented to suppress structural backgrounds and develop a more
effective detection algorithm. To this end, a similar concept to the average
absolute gray difference (AAGD) is utilized to construct a novel directional
small target detection algorithm called absolute directional mean difference
(ADMD). Also, an efficient implementation procedure is presented for the
proposed algorithm. The proposed algorithm effectively enhances the target area
and eliminates background clutter. Simulation results on real infrared images
prove the significant effectiveness of the proposed algorithm.
","[{'version': 'v1', 'created': 'Sun, 7 Oct 2018 16:16:42 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Dec 2018 17:14:17 GMT'}, {'version': 'v3', 'created': 'Wed, 26 Dec 2018 16:28:58 GMT'}, {'version': 'v4', 'created': 'Wed, 29 Jul 2020 03:44:00 GMT'}]",2022-09-20,"[['Moradi', 'Saed', ''], ['Moallem', 'Payman', ''], ['Sabahi', 'Mohamad Farzan', '']]","['small infrared target detection', 'directional mean difference', 'average absolutegray difference', 'structural background', 'real-time implementation']"
10256,1909.10153,Robert Grupp,"Robert Grupp, Hsin-Hong Chiang, Yoshito Otake, Ryan Murphy, Chad
  Gordon, Mehran Armand, Russell Taylor",Smooth Extrapolation of Unknown Anatomy via Statistical Shape Models,SPIE Medical Imaging Conference 2015 Paper,"In Medical Imaging 2015: Image-Guided Procedures, Robotic
  Interventions, and Modeling 2015 Mar 18 (Vol. 9415, p. 941524). International
  Society for Optics and Photonics",10.1117/12.2081310,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several methods to perform extrapolation of unknown anatomy were evaluated.
The primary application is to enhance surgical procedures that may use partial
medical images or medical images of incomplete anatomy. Le Fort-based,
face-jaw-teeth transplant is one such procedure. From CT data of 36 skulls and
21 mandibles separate Statistical Shape Models of the anatomical surfaces were
created. Using the Statistical Shape Models, incomplete surfaces were projected
to obtain complete surface estimates. The surface estimates exhibit non-zero
error in regions where the true surface is known; it is desirable to keep the
true surface and seamlessly merge the estimated unknown surface. Existing
extrapolation techniques produce non-smooth transitions from the true surface
to the estimated surface, resulting in additional error and a less
aesthetically pleasing result. The three extrapolation techniques evaluated
were: copying and pasting of the surface estimate (non-smooth baseline), a
feathering between the patient surface and surface estimate, and an estimate
generated via a Thin Plate Spline trained from displacements between the
surface estimate and corresponding vertices of the known patient surface.
Feathering and Thin Plate Spline approaches both yielded smooth transitions.
However, feathering corrupted known vertex values. Leave-one-out analyses were
conducted, with 5% to 50% of known anatomy removed from the left-out patient
and estimated via the proposed approaches. The Thin Plate Spline approach
yielded smaller errors than the other two approaches, with an average vertex
error improvement of 1.46 mm and 1.38 mm for the skull and mandible
respectively, over the baseline approach.
","[{'version': 'v1', 'created': 'Mon, 23 Sep 2019 04:40:10 GMT'}]",2019-10-31,"[['Grupp', 'Robert', ''], ['Chiang', 'Hsin-Hong', ''], ['Otake', 'Yoshito', ''], ['Murphy', 'Ryan', ''], ['Gordon', 'Chad', ''], ['Armand', 'Mehran', ''], ['Taylor', 'Russell', '']]","['statistical shape model', 'anatomical atlas', 'extrapolation', 'model completion']"
10257,1909.08876,Daniel Hienert,Dagmar Kern and Daniel Hienert,Understanding the Information needs of Social Scientists in Germany,,"In Proceedings of Association for Information Science and
  Technology (ASIS&T 2018), 234-243",10.1002/pra2.2018.14505501026,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The information needs of social science researchers are manifold and almost
studied in every decade since the 1950s. With this paper, we contribute to this
series and present the results of three studies. We asked 367 social science
researchers in Germany for their information needs and identified needs in
different categories: literature, research data, measurement instruments,
support for data analysis, support for data collection, variables in research
data, software support, networking/cooperation, and illustrative material.
Thereby, the search for literature and research data is still the main
information need with more than three-quarter of our participants expressing
needs in these categories. With comprehensive lists of altogether 154 concrete
information needs, even those that are only expressed by one participant, we
contribute to the holistic understanding of the information needs of social
science researchers of today.
","[{'version': 'v1', 'created': 'Thu, 19 Sep 2019 09:10:59 GMT'}]",2019-09-20,"[['Kern', 'Dagmar', ''], ['Hienert', 'Daniel', '']]","['Information needs', 'social science', 'user study']"
10258,1605.02206,Henning Basold,"Henning Basold, Herman Geuvers",Type Theory based on Dependent Inductive and Coinductive Types,"10 pages as to appear with small changes at LICS 2016 + 5 pages of
  examples and proofs",,10.1145/2933575.2934514,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop a dependent type theory that is based purely on inductive and
coinductive types, and the corresponding recursion and corecursion principles.
This results in a type theory with a small set of rules, while still being
fairly expressive. For example, all well-known basic types and type formers
that are needed for using this type theory as a logic are definable:
propositional connectives, like falsity, conjunction, disjunction, and function
space, dependent function space, existential quantification, equality, natural
numbers, vectors etc. The reduction relation on terms consists solely of a rule
for recursion and a rule for corecursion. The reduction relations for
well-known types arise from that. To further support the introduction of this
new type theory, we also prove fundamental properties of its term calculus.
Most importantly, we prove subject reduction and strong normalisation of the
reduction relation, which gives computational meaning to the terms.
  The presented type theory is based on ideas from categorical logic that have
been investigated before by the first author, and it extends Hagino's
categorical data types to a dependently typed setting. By basing the type
theory on concepts from category theory we maintain the duality between
inductive and coinductive types, and it allows us to describe, for example, the
function space as a coinductive type.
","[{'version': 'v1', 'created': 'Sat, 7 May 2016 15:52:14 GMT'}]",2016-05-10,"[['Basold', 'Henning', ''], ['Geuvers', 'Herman', '']]","['Dependent Types', 'Inductive Types', 'Coinductive Types', 'Fibrations']"
10259,1906.06851,Sheng Yang,"Mosharaf Chowdhury, Samir Khuller, Manish Purohit, Sheng Yang, Jie You",Near Optimal Coflow Scheduling in Networks,,,10.1145/3323165.3323179,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The coflow scheduling problem has emerged as a popular abstraction in the
last few years to study data communication problems within a data center. In
this basic framework, each coflow has a set of communication demands and the
goal is to schedule many coflows in a manner that minimizes the total weighted
completion time. A coflow is said to complete when all its communication needs
are met. This problem has been extremely well studied for the case of complete
bipartite graphs that model a data center with full bisection bandwidth and
several approximation algorithms and effective heuristics have been proposed
recently.
  In this work, we study a slightly different model of coflow scheduling in
general graphs (to capture traffic between data centers) and develop practical
and efficient approximation algorithms for it. Our main result is a randomized
2 approximation algorithm for the single path and free path model,
significantly improving prior work. In addition, we demonstrate via extensive
experiments that the algorithm is practical, easy to implement and performs
well in practice.
","[{'version': 'v1', 'created': 'Mon, 17 Jun 2019 05:51:33 GMT'}]",2019-06-18,"[['Chowdhury', 'Mosharaf', ''], ['Khuller', 'Samir', ''], ['Purohit', 'Manish', ''], ['Yang', 'Sheng', ''], ['You', 'Jie', '']]","['coflow', 'scheduling', 'LP relaxation', 'network flow', 'LP rounding', 'cloudcomputing']"
10260,2106.04993,Yinan Zhang,"Yinan Zhang, Boyang Li, Yong Liu, Hao Wang, Chunyan Miao","Initialization Matters: Regularizing Manifold-informed Initialization
  for Neural Recommendation Systems",,,10.1145/3447548.3467338,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Proper initialization is crucial to the optimization and the generalization
of neural networks. However, most existing neural recommendation systems
initialize the user and item embeddings randomly. In this work, we propose a
new initialization scheme for user and item embeddings called Laplacian
Eigenmaps with Popularity-based Regularization for Isolated Data (LEPORID).
LEPORID endows the embeddings with information regarding multi-scale
neighborhood structures on the data manifold and performs adaptive
regularization to compensate for high embedding variance on the tail of the
data distribution. Exploiting matrix sparsity, LEPORID embeddings can be
computed efficiently. We evaluate LEPORID in a wide range of neural
recommendation models. In contrast to the recent surprising finding that the
simple K-nearest-neighbor (KNN) method often outperforms neural recommendation
systems, we show that existing neural systems initialized with LEPORID often
perform on par or better than KNN. To maximize the effects of the
initialization, we propose the Dual-Loss Residual Recommendation (DLR2)
network, which, when initialized with LEPORID, substantially outperforms both
traditional and state-of-the-art neural recommender systems.
","[{'version': 'v1', 'created': 'Wed, 9 Jun 2021 11:26:18 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Aug 2021 12:45:40 GMT'}]",2021-08-13,"[['Zhang', 'Yinan', ''], ['Li', 'Boyang', ''], ['Liu', 'Yong', ''], ['Wang', 'Hao', ''], ['Miao', 'Chunyan', '']]","['network initialization', 'recommender systems', 'manifold learning']"
10261,2209.11123,Nathan P. Lawrence,"R. Bhushan Gopaluni, Aditya Tulsyan, Benoit Chachuat, Biao Huang, Jong
  Min Lee, Faraz Amjad, Seshu Kumar Damarla, Jong Woo Kim, Nathan P. Lawrence","Modern Machine Learning Tools for Monitoring and Control of Industrial
  Processes: A Survey",IFAC World Congress 2020,,10.1016/j.ifacol.2020.12.126,,cs.LG cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Over the last ten years, we have seen a significant increase in industrial
data, tremendous improvement in computational power, and major theoretical
advances in machine learning. This opens up an opportunity to use modern
machine learning tools on large-scale nonlinear monitoring and control
problems. This article provides a survey of recent results with applications in
the process industry.
","[{'version': 'v1', 'created': 'Thu, 22 Sep 2022 16:08:34 GMT'}]",2022-09-23,"[['Gopaluni', 'R. Bhushan', ''], ['Tulsyan', 'Aditya', ''], ['Chachuat', 'Benoit', ''], ['Huang', 'Biao', ''], ['Lee', 'Jong Min', ''], ['Amjad', 'Faraz', ''], ['Damarla', 'Seshu Kumar', ''], ['Kim', 'Jong Woo', ''], ['Lawrence', 'Nathan P.', '']]","['statistical machine learning', 'deep learning', 'reinforcement learning', 'monitoring', 'control']"
10262,1911.02403,Yousef Abuseta,Yousef Abuseta,"A Fog Computing Based Architecture for IoT Services and Applications
  Development","7 pages, 6 figures, Published with International Journal of Computer
  Trends and Technology (IJCTT)","International Journal of Engineering Trends and Technology 67.10
  (2019):92-98",10.14445/22312803/IJCTT-V67I10P116,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  IoT paradigm exploits the Cloud Computing platform to extend its scope and
service provisioning capabilities. However, due to the location of the
underlying IoT devices which is far away from the cloud, some services cannot
tolerate the possible latency resulted from this issue. To overcome the latency
consequences that might affect the functionality of IoT services and
applications, the Fog Computing has been proposed. Fog Computing paradigm
utilizes local computing resources locating at the network edge instead of
those residing at the cloud for processing data collected from sensors linked
to physical devices in an IoT platform. The major benefits of such paradigm
include low latency, real-time decision making and an optimal utilization of
available bandwidth. In this paper, we offer a review of the Fog computing
paradigm and in particular its impact on the IoT application development
process. We also propose an architecture for Fog Computing based IoT services
and applications.
","[{'version': 'v1', 'created': 'Wed, 6 Nov 2019 14:06:43 GMT'}]",2019-11-07,"[['Abuseta', 'Yousef', '']]","['IoT', 'Fog computing', 'Cloud computing', 'Control loop', 'Autonomic systems']"
10263,1812.09073,Yilong Yang,"Zhuyifan Ye, Yilong Yang, Xiaoshan Li, Dongsheng Cao, Defang Ouyang","An Integrated Transfer Learning and Multitask Learning Approach for
  Pharmacokinetic Parameter Prediction",,,10.1021/acs.molpharmaceut.8b00816,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Pharmacokinetic evaluation is one of the key processes in drug
discovery and development. However, current absorption, distribution,
metabolism, excretion prediction models still have limited accuracy. Aim: This
study aims to construct an integrated transfer learning and multitask learning
approach for developing quantitative structure-activity relationship models to
predict four human pharmacokinetic parameters. Methods: A pharmacokinetic
dataset included 1104 U.S. FDA approved small molecule drugs. The dataset
included four human pharmacokinetic parameter subsets (oral bioavailability,
plasma protein binding rate, apparent volume of distribution at steady-state
and elimination half-life). The pre-trained model was trained on over 30
million bioactivity data. An integrated transfer learning and multitask
learning approach was established to enhance the model generalization. Results:
The pharmacokinetic dataset was split into three parts (60:20:20) for training,
validation and test by the improved Maximum Dissimilarity algorithm with the
representative initial set selection algorithm and the weighted distance
function. The multitask learning techniques enhanced the model predictive
ability. The integrated transfer learning and multitask learning model
demonstrated the best accuracies, because deep neural networks have the general
feature extraction ability, transfer learning and multitask learning improved
the model generalization. Conclusions: The integrated transfer learning and
multitask learning approach with the improved dataset splitting algorithm was
firstly introduced to predict the pharmacokinetic parameters. This method can
be further employed in drug discovery and development.
","[{'version': 'v1', 'created': 'Fri, 21 Dec 2018 12:16:50 GMT'}]",2018-12-27,"[['Ye', 'Zhuyifan', ''], ['Yang', 'Yilong', ''], ['Li', 'Xiaoshan', ''], ['Cao', 'Dongsheng', ''], ['Ouyang', 'Defang', '']]","['ADME', 'pharmacokinetic parameters', 'deep learning', 'multitask learning', 'transfer learning']"
10264,2112.13197,Jiayan Guo,"Jiayan Guo and Yaming Yang and Xiangchen Song and Yuan Zhang and
  Yujing Wang and Jing Bai and Yan Zhang","Learning Multi-granularity User Intent Unit for Session-based
  Recommendation",,,10.1145/3488560.3498524,,cs.IR cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Session-based recommendation aims to predict a user's next action based on
previous actions in the current session. The major challenge is to capture
authentic and complete user preferences in the entire session. Recent work
utilizes graph structure to represent the entire session and adopts Graph
Neural Network to encode session information. This modeling choice has been
proved to be effective and achieved remarkable results. However, most of the
existing studies only consider each item within the session independently and
do not capture session semantics from a high-level perspective. Such limitation
often leads to severe information loss and increases the difficulty of
capturing long-range dependencies within a session. Intuitively, compared with
individual items, a session snippet, i.e., a group of locally consecutive
items, is able to provide supplemental user intents which are hardly captured
by existing methods. In this work, we propose to learn multi-granularity
consecutive user intent unit to improve the recommendation performance.
Specifically, we creatively propose Multi-granularity Intent Heterogeneous
Session Graph which captures the interactions between different granularity
intent units and relieves the burden of long-dependency. Moreover, we propose
the Intent Fusion Ranking module to compose the recommendation results from
various granularity user intents. Compared with current methods that only
leverage intents from individual items, IFR benefits from different granularity
user intents to generate more accurate and comprehensive session
representation, thus eventually boosting recommendation performance. We conduct
extensive experiments on five session-based recommendation datasets and the
results demonstrate the effectiveness of our method.
","[{'version': 'v1', 'created': 'Sat, 25 Dec 2021 07:25:55 GMT'}, {'version': 'v2', 'created': 'Sun, 2 Jan 2022 00:36:30 GMT'}, {'version': 'v3', 'created': 'Mon, 10 Jan 2022 14:04:14 GMT'}]",2022-01-11,"[['Guo', 'Jiayan', ''], ['Yang', 'Yaming', ''], ['Song', 'Xiangchen', ''], ['Zhang', 'Yuan', ''], ['Wang', 'Yujing', ''], ['Bai', 'Jing', ''], ['Zhang', 'Yan', '']]","['Recommender System', 'Session-based Recommendation', 'GraphNeural Networks']"
10265,2005.05872,Antonio J. Pe\v{n}a,"Harald Servat and Jes\'us Labarta and Hans-Christian Hoppe and Judit
  Gim\'enez and Antonio J. Pe\~na",Understanding Memory Access Patterns Using the BSC Performance Tools,,"H. Servat, J. Labarta, H. C. Hoppe, J. Gim\'enez, and A. J.
  Pe\~na, ""Understanding memory access patterns using the BSC performance
  tools"", Parallel Computing, Elsevier, vol. 78, pp. 1-14, Oct. 2018",10.1016/j.parco.2018.06.007,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The growing gap between processor and memory speeds results in complex memory
hierarchies as processors evolve to mitigate such divergence by taking
advantage of the locality of reference. In this direction, the BSC performance
analysis tools have been recently extended to provide insight relative to the
application memory accesses depicting their temporal and spatial
characteristics, correlating with the source-code and the achieved performance
simultaneously. These extensions rely on the Precise Event-Based Sampling
(PEBS) mechanism available in recent Intel processors to capture information
regarding the application memory accesses. The sampled information is later
combined with the Folding technique to represent a detailed temporal evolution
of the memory accesses and in conjunction with the achieved performance and the
source-code counterpart. The results obtained from the combination of these
tools help not only application developers but also processor architects to
understand better how the application behaves and how the system performs. In
this paper, we describe a tighter integration of the sampling mechanism into
the monitoring package. We also demonstrate the value of the complete workflow
by exploring already optimized state--of--the--art benchmarks, providing
detailed insight of their memory access behavior. We have taken advantage of
this insight to apply small modifications that improve the applications'
performance.
","[{'version': 'v1', 'created': 'Tue, 12 May 2020 15:44:02 GMT'}, {'version': 'v2', 'created': 'Thu, 28 May 2020 22:19:17 GMT'}]",2020-06-01,"[['Servat', 'Harald', ''], ['Labarta', 'Jesús', ''], ['Hoppe', 'Hans-Christian', ''], ['Giménez', 'Judit', ''], ['Peña', 'Antonio J.', '']]","['performance analysis', 'memory references', 'sampling', 'instrumentation']"
10266,2201.02726,Weiqi He,"Xinyi Yu, Weiqi He, Xuecheng Qian, Yang Yang, Linlin Ou",Real-time Rail Recognition Based on 3D Point Clouds,,,10.1088/1361-6501/ac750c,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate rail location is a crucial part in the railway support driving
system for safety monitoring. LiDAR can obtain point clouds that carry 3D
information for the railway environment, especially in darkness and terrible
weather conditions. In this paper, a real-time rail recognition method based on
3D point clouds is proposed to solve the challenges, such as disorderly, uneven
density and large volume of the point clouds. A voxel down-sampling method is
first presented for density balanced of railway point clouds, and pyramid
partition is designed to divide the 3D scanning area into the voxels with
different volumes. Then, a feature encoding module is developed to find the
nearest neighbor points and to aggregate their local geometric features for the
center point. Finally, a multi-scale neural network is proposed to generate the
prediction results of each voxel and the rail location. The experiments are
conducted under 9 sequences of 3D point cloud data for the railway. The results
show that the method has good performance in detecting straight, curved and
other complex topologies rails.
","[{'version': 'v1', 'created': 'Sat, 8 Jan 2022 01:42:02 GMT'}]",2022-08-10,"[['Yu', 'Xinyi', ''], ['He', 'Weiqi', ''], ['Qian', 'Xuecheng', ''], ['Yang', 'Yang', ''], ['Ou', 'Linlin', '']]","['Rail recognition', 'railway safety', 'deep learning', 'LiDAR 3D point clouds']"
10267,1903.06985,Guchong Li,"Guchong Li, Giorgio Battistelli, Wei Yi, Lingjiang Kong","Distributed Multi-sensor Multi-view Fusion based on Generalized
  Covariance Intersection","13 pages, 5 figures",,10.1016/j.sigpro.2019.107246,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed multi-target tracking (DMTT) is addressed for sensors having
different fields of view (FoVs). The proposed approach is based on the idea of
fusing the posterior Probability Hypotheses Densities (PHDs) generated by the
sensors on the basis of the local measurements. An efficient and robust
distributed fusion algorithm combining the Generalized Covariance Intersection
(GCI) rule with a suitable Clustering Algorithm (CA) is proposed. The CA is
used to decompose each posterior PHD into well-separated components (clusters).
For the commonly detected targets, an efficient parallelized GCI fusion
strategy is proposed and analyzed in terms of $L_1$ error. For the remaining
targets, a suitable compensation strategy is adopted so as to counteract the
GCI sensitivity to independent detections while reducing the occurrence of
false targets. Detailed implementation steps using a Gaussian Mixture (GM)
representation of the PHDs are provided. Numerical experiments clearly confirms
the effectiveness of the proposed CA-GCI fusion algorithm.
","[{'version': 'v1', 'created': 'Sat, 16 Mar 2019 21:12:27 GMT'}]",2019-08-28,"[['Li', 'Guchong', ''], ['Battistelli', 'Giorgio', ''], ['Yi', 'Wei', ''], ['Kong', 'Lingjiang', '']]","['Multi-target tracking', 'multi-view sensors', 'fields-of-view', 'GCI fusion', 'clustering algorithm', 'GM-PHD filter']"
10268,2206.11574,Alexander Nikitin,Alexander Nikitin and Samuel Kaski,Human-in-the-Loop Large-Scale Predictive Maintenance of Workstations,,,10.1145/3534678.3539196,,cs.LG cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Predictive maintenance (PdM) is the task of scheduling maintenance operations
based on a statistical analysis of the system's condition. We propose a
human-in-the-loop PdM approach in which a machine learning system predicts
future problems in sets of workstations (computers, laptops, and servers). Our
system interacts with domain experts to improve predictions and elicit their
knowledge. In our approach, domain experts are included in the loop not only as
providers of correct labels, as in traditional active learning, but as a source
of explicit decision rule feedback. The system is automated and designed to be
easily extended to novel domains, such as maintaining workstations of several
organizations. In addition, we develop a simulator for reproducible experiments
in a controlled environment and deploy the system in a large-scale case of
real-life workstations PdM with thousands of workstations for dozens of
companies.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2022 09:40:46 GMT'}]",2022-06-24,"[['Nikitin', 'Alexander', ''], ['Kaski', 'Samuel', '']]","['machine learning', 'human-in-the-loop', 'predictive maintenance', 'Bayesian optimization', 'applications']"
10269,1904.04890,Francis Williams,"Francis Williams, Alexander Bock, Harish Doraiswamy, Cassandra
  Donatelli, Kayla Hall, Adam Summers, Daniele Panozzo, Cl\'audio T. Silva",Unwind: Interactive Fish Straightening,,,10.1145/3313831.3376846,,cs.GR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ScanAllFish project is a large-scale effort to scan all the world's
33,100 known species of fishes. It has already generated thousands of
volumetric CT scans of fish species which are available on open access
platforms such as the Open Science Framework. To achieve a scanning rate
required for a project of this magnitude, many specimens are grouped together
into a single tube and scanned all at once. The resulting data contain many
fish which are often bent and twisted to fit into the scanner. Our system,
Unwind, is a novel interactive visualization and processing tool which
extracts, unbends, and untwists volumetric images of fish with minimal user
interaction. Our approach enables scientists to interactively unwarp these
volumes to remove the undesired torque and bending using a piecewise-linear
skeleton extracted by averaging isosurfaces of a harmonic function connecting
the head and tail of each fish. The result is a volumetric dataset of a
individual, straight fish in a canonical pose defined by the marine biologist
expert user. We have developed Unwind in collaboration with a team of marine
biologists: Our system has been deployed in their labs, and is presently being
used for dataset construction, biomechanical analysis, and the generation of
figures for scientific publication.
","[{'version': 'v1', 'created': 'Tue, 9 Apr 2019 20:07:24 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Feb 2020 18:55:13 GMT'}]",2020-02-06,"[['Williams', 'Francis', ''], ['Bock', 'Alexander', ''], ['Doraiswamy', 'Harish', ''], ['Donatelli', 'Cassandra', ''], ['Hall', 'Kayla', ''], ['Summers', 'Adam', ''], ['Panozzo', 'Daniele', ''], ['Silva', 'Cláudio T.', '']]","['CT Scan Data', 'Volumetric Deformation', 'Interactive System']"
10270,2103.15816,Vladimir Ivanov,V. K. Ivanov,"Some Results of Experimental Check of The Model of the Object
  Innovativeness Quantitative Evaluation","10 pages, in Russian","Information and Innovations. 2020. Vol. 15, N 3",10.31432/1994-2443-2020-15-3-27-36,,cs.DB,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The paper presents the results of the experiments that were conducted to
confirm the main ideas of the proposed approach to determining the objects
innovativeness. This approach assumed that the product life cycle of whose
descriptions are placed in different data warehouses is adequate. The proposed
formal model allows us to calculate the quantitative value of the additive
evaluation criterion of objects innovativeness. The obtained experimental data
make it possible to evaluate the adopted approach correctness.
","[{'version': 'v1', 'created': 'Sat, 27 Mar 2021 08:26:45 GMT'}]",2021-03-31,"[['Ivanov', 'V. K.', '']]","['Data Warehouse', 'Innovation', 'Additive Criterion', 'Utility Function', 'Search Query']"
10271,2112.05438,Thomas Palmeira Ferraz,"Thomas Palmeira Ferraz, Alexandre Alcoforado, Enzo Bustos, Andr\'e
  Seidel Oliveira, Rodrigo Gerber, Na\'ide M\""uller, Andr\'e Corr\^ea
  d'Almeida, Bruno Miguel Veloso, Anna Helena Reali Costa",DEBACER: a method for slicing moderated debates,"Accepted on The 18th National Meeting on Artificial and Computational
  Intelligence (ENIAC 2021)","in Anais do XVIII Encontro Nacional de Intelig\^encia Artificial e
  Computacional, Evento Online, 2021, pp. 667-678",10.5753/eniac.2021.18293,,cs.AI cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Subjects change frequently in moderated debates with several participants,
such as in parliamentary sessions, electoral debates, and trials. Partitioning
a debate into blocks with the same subject is essential for understanding.
Often a moderator is responsible for defining when a new block begins so that
the task of automatically partitioning a moderated debate can focus solely on
the moderator's behavior. In this paper, we (i) propose a new algorithm,
DEBACER, which partitions moderated debates; (ii) carry out a comparative study
between conventional and BERTimbau pipelines; and (iii) validate DEBACER
applying it to the minutes of the Assembly of the Republic of Portugal. Our
results show the effectiveness of DEBACER. Keywords: Natural Language
Processing, Political Documents, Spoken Text Processing, Speech Split, Dialogue
Partitioning.
","[{'version': 'v1', 'created': 'Fri, 10 Dec 2021 10:39:07 GMT'}]",2022-01-06,"[['Ferraz', 'Thomas Palmeira', ''], ['Alcoforado', 'Alexandre', ''], ['Bustos', 'Enzo', ''], ['Oliveira', 'André Seidel', ''], ['Gerber', 'Rodrigo', ''], ['Müller', 'Naíde', ''], [""d'Almeida"", 'André Corrêa', ''], ['Veloso', 'Bruno Miguel', ''], ['Costa', 'Anna Helena Reali', '']]","['identifying the audience’s state', 'then apply the TextPro', 'SentiWordNet to computethe persuasive impact of the speech']"
10272,2106.13954,Mahardhika Pratama Dr,"Mao Fubing, Weng Weiwei, Mahardhika Pratama, Edward Yapp Kien Yee",Continual Learning via Inter-Task Synaptic Mapping,This paper has been published in Knowledge-based Systems,"Knowledge-based Systems, 2021",10.1016/j.knosys.2021.106947,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Learning from streaming tasks leads a model to catastrophically erase unique
experiences it absorbs from previous episodes. While regularization techniques
such as LWF, SI, EWC have proven themselves as an effective avenue to overcome
this issue by constraining important parameters of old tasks from changing when
accepting new concepts, these approaches do not exploit common information of
each task which can be shared to existing neurons. As a result, they do not
scale well to large-scale problems since the parameter importance variables
quickly explode. An Inter-Task Synaptic Mapping (ISYANA) is proposed here to
underpin knowledge retention for continual learning. ISYANA combines
task-to-neuron relationship as well as concept-to-concept relationship such
that it prevents a neuron to embrace distinct concepts while merely accepting
relevant concept. Numerical study in the benchmark continual learning problems
has been carried out followed by comparison against prominent continual
learning algorithms. ISYANA exhibits competitive performance compared to state
of the arts. Codes of ISYANA is made available in
\url{https://github.com/ContinualAL/ISYANAKBS}.
","[{'version': 'v1', 'created': 'Sat, 26 Jun 2021 06:30:43 GMT'}]",2021-06-29,"[['Fubing', 'Mao', ''], ['Weiwei', 'Weng', ''], ['Pratama', 'Mahardhika', ''], ['Yee', 'Edward Yapp Kien', '']]","['continual learning', 'lifelong learning', 'catastrophic forgetting']"
10273,2206.01691,Shiva Omrani Sabbaghi,"Shiva Omrani Sabbaghi, Aylin Caliskan","Measuring Gender Bias in Word Embeddings of Gendered Languages Requires
  Disentangling Grammatical Gender Signals",,,10.1145/3514094.3534176,,cs.CY cs.AI cs.CL cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Does the grammatical gender of a language interfere when measuring the
semantic gender information captured by its word embeddings? A number of
anomalous gender bias measurements in the embeddings of gendered languages
suggest this possibility. We demonstrate that word embeddings learn the
association between a noun and its grammatical gender in grammatically gendered
languages, which can skew social gender bias measurements. Consequently, word
embedding post-processing methods are introduced to quantify, disentangle, and
evaluate grammatical gender signals. The evaluation is performed on five
gendered languages from the Germanic, Romance, and Slavic branches of the
Indo-European language family. Our method reduces the strength of grammatical
gender signals, which is measured in terms of effect size (Cohen's d), by a
significant average of d = 1.3 for French, German, and Italian, and d = 0.56
for Polish and Spanish. Once grammatical gender is disentangled, the
association between over 90% of 10,000 inanimate nouns and their assigned
grammatical gender weakens, and cross-lingual bias results from the Word
Embedding Association Test (WEAT) become more congruent with country-level
implicit bias measurements. The results further suggest that disentangling
grammatical gender signals from word embeddings may lead to improvement in
semantic machine learning tasks.
","[{'version': 'v1', 'created': 'Fri, 3 Jun 2022 17:11:00 GMT'}]",2022-06-06,"[['Sabbaghi', 'Shiva Omrani', ''], ['Caliskan', 'Aylin', '']]","['grammatical gender', 'bias', 'word embeddings']"
10274,2112.05322,Roopak Sinha,"Shereen Afifi, Hamid GholamHosseini, Roopak Sinha",Dynamic hardware system for cascade SVM classification of melanoma,"Journal paper, 9 pages, 4 figures, 4 tables",Neural Computing & Applications 32 (2020) pp.1777-1788,10.1007/s00521-018-3656-1,,cs.AR cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Melanoma is the most dangerous form of skin cancer, which is responsible for
the majority of skin cancer-related deaths. Early diagnosis of melanoma can
significantly reduce mortality rates and treatment costs. Therefore, skin
cancer specialists are using image-based diagnostic tools for detecting
melanoma earlier. We aim to develop a handheld device featured with low cost
and high performance to enhance early detection of melanoma at the primary
healthcare. But, developing this device is very challenging due to the
complicated computations required by the embedded diagnosis system. Thus, we
aim to exploit the recent hardware technology in reconfigurable computing to
achieve a high-performance embedded system at low cost. Support vector machine
(SVM) is a common classifier that shows high accuracy for classifying melanoma
within the diagnosis system and is considered as the most compute-intensive
task in the system. In this paper, we propose a dynamic hardware system for
implementing a cascade SVM classifier on FPGA for early melanoma detection. A
multi-core architecture is proposed to implement a two-stage cascade classifier
using two classifiers with accuracies of 98% and 73%. The hardware
implementation results were optimized by using the dynamic partial
reconfiguration technology, where very low resource utilization of 1% slices
and power consumption of 1.5 W were achieved. Consequently, the implemented
dynamic hardware system meets vital embedded system constraints of high
performance and low cost, resource utilization, and power consumption, while
achieving efficient classification with high accuracy.
","[{'version': 'v1', 'created': 'Fri, 10 Dec 2021 03:56:35 GMT'}]",2021-12-13,"[['Afifi', 'Shereen', ''], ['GholamHosseini', 'Hamid', ''], ['Sinha', 'Roopak', '']]","['SVM', 'Cascade classifier', 'Melanoma', 'FPGA', 'DPR', 'Embedded system']"
10275,2110.03818,Nimrah Mustafa,"Nimrah Mustafa, Imdadullah Khan, Muhammad Asad Khan and Zartash Afzal
  Uzmi",Social Groups Based Content Caching in Wireless Networks,"To appear in Proceedings of the 19th ACM International Symposium on
  Mobility Management (MobiWac '21)",,10.1145/3479241.3486694,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  The unprecedented growth of wireless mobile traffic, mainly due to multimedia
traffic over online social platforms has strained the resources in the mobile
backhaul network. A promising approach to reduce the backhaul load is to
proactively cache content at the network edge, taking into account the overlaid
social network. Known caching schemes require complete knowledge of the social
graph and mainly focus on one-to-one interactions forgoing the prevalent mode
of content sharing among circles of 'friends'. We propose Bingo, a proactive
content caching scheme that leverages the presence of interest groups in online
social networks. The mobile network operator (MNO) can choose to incrementally
deploy Bingo at select network nodes (base stations, packet core, data center)
based on user profiles and revenue numbers. We approximate the group
memberships of users using the available user-content request logs without any
prior knowledge of the overlaid social graph. Bingo can cater to the evolving
nature of online social groups and file popularity distribution for making
caching decisions. We use synthetically generated group structures and simulate
user requests at the base station for empirical evaluation against traditional
and recent caching schemes. Bingo achieves up to 30%-34% gain over the best
baseline.
","[{'version': 'v1', 'created': 'Thu, 7 Oct 2021 22:41:39 GMT'}]",2021-10-11,"[['Mustafa', 'Nimrah', ''], ['Khan', 'Imdadullah', ''], ['Khan', 'Muhammad Asad', ''], ['Uzmi', 'Zartash Afzal', '']]","['Caching', 'Wireless networks', 'Mobile Social Networks']"
10276,2101.00146,Leibo Liu,"Leibo Liu, Oscar Perez-Concha, Anthony Nguyen, Vicki Bennett, Louisa
  Jorm","De-identifying Australian Hospital Discharge Summaries: An End-to-End
  Framework using Ensemble of Deep Learning Models",,Journal of Biomedical Informatics 135 (2022) 104215,10.1016/j.jbi.2022.104215,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Electronic Medical Records (EMRs) contain clinical narrative text that is of
great potential value to medical researchers. However, this information is
mixed with Personally Identifiable Information (PII) that presents risks to
patient and clinician confidentiality. This paper presents an end-to-end
deidentification framework to automatically remove PII from Australian hospital
discharge summaries. Our corpus included 600 hospital discharge summaries which
were extracted from the EMRs of two principal referral hospitals in Sydney,
Australia. Our end-to-end de-identification framework consists of three
components: 1) Annotation: labelling of PII in the 600 hospital discharge
summaries using five pre-defined categories: person, address, date of birth,
individual identification number, phone/fax number; 2) Modelling: training six
named entity recognition (NER) deep learning base-models on balanced and
imbalanced datasets; and evaluating ensembles that combine all six base-models,
the three base-models with the best F1 scores and the three base-models with
the best recall scores respectively, using token-level majority voting and
stacking methods; and 3) De-identification: removing PII from the hospital
discharge summaries. Our results showed that the ensemble model combined using
the stacking Support Vector Machine (SVM) method on the three base-models with
the best F1 scores achieved excellent results with a F1 score of 99.16% on the
test set of our corpus. We also evaluated the robustness of our modelling
component on the 2014 i2b2 de-identification dataset. Our ensemble model, which
uses the token-level majority voting method on all six basemodels, achieved the
highest F1 score of 96.24% at strict entity matching and the highest F1 score
of 98.64% at binary token-level matching compared to two state-of-the-art
methods.
","[{'version': 'v1', 'created': 'Fri, 1 Jan 2021 03:09:31 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Aug 2021 06:04:21 GMT'}, {'version': 'v3', 'created': 'Fri, 3 Dec 2021 14:12:01 GMT'}, {'version': 'v4', 'created': 'Tue, 4 Oct 2022 00:46:47 GMT'}]",2022-10-05,"[['Liu', 'Leibo', ''], ['Perez-Concha', 'Oscar', ''], ['Nguyen', 'Anthony', ''], ['Bennett', 'Vicki', ''], ['Jorm', 'Louisa', '']]","['De-identification', 'Hospital discharge summaries', 'Natural language processing', 'Deep']"
10277,2012.00073,Pedro Saleiro,"Jo\~ao Bento, Pedro Saleiro, Andr\'e F. Cruz, M\'ario A.T. Figueiredo,
  Pedro Bizarro",TimeSHAP: Explaining Recurrent Models through Sequence Perturbations,Accepted at KDD 2021,,10.1145/3447548.3467166,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although recurrent neural networks (RNNs) are state-of-the-art in numerous
sequential decision-making tasks, there has been little research on explaining
their predictions. In this work, we present TimeSHAP, a model-agnostic
recurrent explainer that builds upon KernelSHAP and extends it to the
sequential domain. TimeSHAP computes feature-, timestep-, and cell-level
attributions. As sequences may be arbitrarily long, we further propose a
pruning method that is shown to dramatically decrease both its computational
cost and the variance of its attributions. We use TimeSHAP to explain the
predictions of a real-world bank account takeover fraud detection RNN model,
and draw key insights from its explanations: i) the model identifies important
features and events aligned with what fraud analysts consider cues for account
takeover; ii) positive predicted sequences can be pruned to only 10% of the
original length, as older events have residual attribution values; iii) the
most recent input event of positive predictions only contributes on average to
41% of the model's score; iv) notably high attribution to client's age,
suggesting a potential discriminatory reasoning, later confirmed as higher
false positive rates for older clients.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2020 19:48:57 GMT'}, {'version': 'v2', 'created': 'Sat, 26 Jun 2021 09:59:18 GMT'}]",2021-06-29,"[['Bento', 'João', ''], ['Saleiro', 'Pedro', ''], ['Cruz', 'André F.', ''], ['Figueiredo', 'Mário A. T.', ''], ['Bizarro', 'Pedro', '']]","['TimeSHAP', 'RNN', 'SHAP', 'Shapley Values', 'XAI', 'Explainability']"
10278,2210.02853,Kexin Pei,"Kexin Pei, Dongdong She, Michael Wang, Scott Geng, Zhou Xuan, Yaniv
  David, Junfeng Yang, Suman Jana, Baishakhi Ray",NeuDep: Neural Binary Memory Dependence Analysis,ESEC/FSE 2022,,10.1145/3540250.3549147,,cs.CR cs.LG cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Determining whether multiple instructions can access the same memory location
is a critical task in binary analysis. It is challenging as statically
computing precise alias information is undecidable in theory. The problem
aggravates at the binary level due to the presence of compiler optimizations
and the absence of symbols and types. Existing approaches either produce
significant spurious dependencies due to conservative analysis or scale poorly
to complex binaries.
  We present a new machine-learning-based approach to predict memory
dependencies by exploiting the model's learned knowledge about how binary
programs execute. Our approach features (i) a self-supervised procedure that
pretrains a neural net to reason over binary code and its dynamic value flows
through memory addresses, followed by (ii) supervised finetuning to infer the
memory dependencies statically. To facilitate efficient learning, we develop
dedicated neural architectures to encode the heterogeneous inputs (i.e., code,
data values, and memory addresses from traces) with specific modules and fuse
them with a composition learning strategy.
  We implement our approach in NeuDep and evaluate it on 41 popular software
projects compiled by 2 compilers, 4 optimizations, and 4 obfuscation passes. We
demonstrate that NeuDep is more precise (1.5x) and faster (3.5x) than the
current state-of-the-art. Extensive probing studies on security-critical
reverse engineering tasks suggest that NeuDep understands memory access
patterns, learns function signatures, and is able to match indirect calls. All
these tasks either assist or benefit from inferring memory dependencies.
Notably, NeuDep also outperforms the current state-of-the-art on these tasks.
","[{'version': 'v1', 'created': 'Tue, 4 Oct 2022 04:59:36 GMT'}]",2022-10-07,"[['Pei', 'Kexin', ''], ['She', 'Dongdong', ''], ['Wang', 'Michael', ''], ['Geng', 'Scott', ''], ['Xuan', 'Zhou', ''], ['David', 'Yaniv', ''], ['Yang', 'Junfeng', ''], ['Jana', 'Suman', ''], ['Ray', 'Baishakhi', '']]","['Memory Dependence Analysis', 'Reverse Engineering', 'Large Language Models', 'Machine Learning for Program Analysis']"
10279,2001.01126,Alexander Ruch,Alexander Ruch,"Can x2vec Save Lives? Integrating Graph and Language Embeddings for
  Automatic Mental Health Classification","25 pages (23 body, 2 supplemental material), 12 figures (10 body, 2
  supplemental material), 5 tables",J. Phys. Complex. 1 035005 (2020),10.1088/2632-072X/aba83d,,cs.SI cs.AI cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph and language embedding models are becoming commonplace in large scale
analyses given their ability to represent complex sparse data densely in
low-dimensional space. Integrating these models' complementary relational and
communicative data may be especially helpful if predicting rare events or
classifying members of hidden populations - tasks requiring huge and sparse
datasets for generalizable analyses. For example, due to social stigma and
comorbidities, mental health support groups often form in amorphous online
groups. Predicting suicidality among individuals in these settings using
standard network analyses is prohibitive due to resource limits (e.g., memory),
and adding auxiliary data like text to such models exacerbates complexity- and
sparsity-related issues. Here, I show how merging graph and language embedding
models (metapath2vec and doc2vec) avoids these limits and extracts unsupervised
clustering data without domain expertise or feature engineering. Graph and
language distances to a suicide support group have little correlation (\r{ho} <
0.23), implying the two models are not embedding redundant information. When
used separately to predict suicidality among individuals, graph and language
data generate relatively accurate results (69% and 76%, respectively); however,
when integrated, both data produce highly accurate predictions (90%, with 10%
false-positives and 12% false-negatives). Visualizing graph embeddings
annotated with predictions of potentially suicidal individuals shows the
integrated model could classify such individuals even if they are positioned
far from the support group. These results extend research on the importance of
simultaneously analyzing behavior and language in massive networks and efforts
to integrate embedding models for different kinds of data when predicting and
classifying, particularly when they involve rare events.
","[{'version': 'v1', 'created': 'Sat, 4 Jan 2020 20:56:21 GMT'}]",2022-01-19,"[['Ruch', 'Alexander', '']]","['graph embeddings', 'language embeddings', 'information networks', 'social media', 'mental health']"
10280,2104.01327,Antonios Katsarakis,"Antonios Katsarakis (1), Yijun Ma (2), Zhaowei Tan (3), Andrew
  Bainbridge (4), Matthew Balkwill (4), Aleksandar Dragojevic (4), Boris Grot
  (1), Bozidar Radunovic (4), Yongguang Zhang (4) ((1) University of Edinburgh,
  (2) Fudan University, (3) UCLA, (4) Microsoft Research)",Zeus: Locality-aware Distributed Transactions,Sixteenth European Conference on Computer Systems,,10.1145/3447786.3456234,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  State-of-the-art distributed in-memory datastores (FaRM, FaSST, DrTM) provide
strongly-consistent distributed transactions with high performance and
availability. Transactions in those systems are fully general; they can
atomically manipulate any set of objects in the store, regardless of their
location. To achieve this, these systems use complex distributed transactional
protocols. Meanwhile, many workloads have a high degree of locality. For such
workloads, distributed transactions are an overkill as most operations only
access objects located on the same server -- if sharded appropriately.
  In this paper, we show that for these workloads, a single-node transactional
protocol combined with dynamic object re-sharding and asynchronously pipelined
replication can provide the same level of generality with better performance,
simpler protocols, and lower developer effort. We present Zeus, an in-memory
distributed datastore that provides general transactions by acquiring all
objects involved in the transaction to the same server and executing a
single-node transaction on them. Zeus is fault-tolerant and
strongly-consistent. At the heart of Zeus is a reliable dynamic object sharding
protocol that can move 250K objects per second per server, allowing Zeus to
process millions of transactions per second and outperform more traditional
distributed transactions on a wide range of workloads that exhibit locality.
","[{'version': 'v1', 'created': 'Sat, 3 Apr 2021 07:10:57 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Apr 2021 13:28:53 GMT'}]",2021-04-07,"[['Katsarakis', 'Antonios', ''], ['Ma', 'Yijun', ''], ['Tan', 'Zhaowei', ''], ['Bainbridge', 'Andrew', ''], ['Balkwill', 'Matthew', ''], ['Dragojevic', 'Aleksandar', ''], ['Grot', 'Boris', ''], ['Radunovic', 'Bozidar', ''], ['Zhang', 'Yongguang', '']]","['locality', 'transactions', 'dynamic sharding', 'replication', 'availability', 'strict serializability', 'pipelining']"
10281,2010.04827,Jiahao Chen,Eren Kurshan and Hongda Shen and Jiahao Chen,"Towards Self-Regulating AI: Challenges and Opportunities of AI Model
  Governance in Financial Services","8 pages, 7 figures","Proceedings of the 1st International Conference on AI in Finance
  (ICAIF '20), October 15-16, 2020, New York",10.1145/3383455.3422564,,cs.LG cs.AI q-fin.GN stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  AI systems have found a wide range of application areas in financial
services. Their involvement in broader and increasingly critical decisions has
escalated the need for compliance and effective model governance. Current
governance practices have evolved from more traditional financial applications
and modeling frameworks. They often struggle with the fundamental differences
in AI characteristics such as uncertainty in the assumptions, and the lack of
explicit programming. AI model governance frequently involves complex review
flows and relies heavily on manual steps. As a result, it faces serious
challenges in effectiveness, cost, complexity, and speed. Furthermore, the
unprecedented rate of growth in the AI model complexity raises questions on the
sustainability of the current practices. This paper focuses on the challenges
of AI model governance in the financial services industry. As a part of the
outlook, we present a system-level framework towards increased self-regulation
for robustness and compliance. This approach aims to enable potential solution
opportunities through increased automation and the integration of monitoring,
management, and mitigation capabilities. The proposed framework also provides
model governance and risk management improved capabilities to manage model risk
during deployment.
","[{'version': 'v1', 'created': 'Fri, 9 Oct 2020 22:12:22 GMT'}]",2020-10-13,"[['Kurshan', 'Eren', ''], ['Shen', 'Hongda', ''], ['Chen', 'Jiahao', '']]","['Financial services', 'model governance', 'model risk management', 'machine learning', 'artificial intelligence']"
10282,2004.07601,Shaoxiong Ji,"Shaoxiong Ji, Xue Li, Zi Huang, and Erik Cambria","Suicidal Ideation and Mental Disorder Detection with Attentive Relation
  Networks",,"Neural Computing and Applications, 2021",10.1007/s00521-021-06208-y,,cs.CL cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mental health is a critical issue in modern society, and mental disorders
could sometimes turn to suicidal ideation without effective treatment. Early
detection of mental disorders and suicidal ideation from social content
provides a potential way for effective social intervention. However,
classifying suicidal ideation and other mental disorders is challenging as they
share similar patterns in language usage and sentimental polarity. This paper
enhances text representation with lexicon-based sentiment scores and latent
topics and proposes using relation networks to detect suicidal ideation and
mental disorders with related risk indicators. The relation module is further
equipped with the attention mechanism to prioritize more critical relational
features. Through experiments on three real-world datasets, our model
outperforms most of its counterparts.
","[{'version': 'v1', 'created': 'Thu, 16 Apr 2020 11:18:55 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Nov 2020 08:42:30 GMT'}, {'version': 'v3', 'created': 'Tue, 8 Jun 2021 17:54:28 GMT'}]",2021-09-27,"[['Ji', 'Shaoxiong', ''], ['Li', 'Xue', ''], ['Huang', 'Zi', ''], ['Cambria', 'Erik', '']]","['Suicidal ideation', 'mental disorder', 'attentive relation networks']"
10283,2202.02392,Sai Sidhardh,"Sai Sidhardh, Sansit Patnaik, Fabio Semperlotti","Fractional-Order Shell Theory: Formulation and Application to the
  Analysis of Nonlocal Cylindrical Panels",,,10.1115/1.4054677,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  We present a theoretical and computational framework based on fractional
calculus for the analysis of the nonlocal static response of cylindrical shell
panels. The differ-integral nature of fractional derivatives allows an
efficient and accurate methodology to account for the effect of long-range
(nonlocal) interactions in curved structures. More specifically, the use of
frame-invariant fractional-order kinematic relations enables a physically,
mathematically, and thermodynamically consistent formulation to model the
nonlocal elastic interactions. In order to evaluate the response of these
nonlocal shells under practical scenarios involving generalized loads and
boundary conditions, the fractional-Finite Element Method (f-FEM) is extended
to incorporate shell elements based on the first-order shear-deformable
displacement theory. Finally, numerical studies are performed exploring both
the linear and the geometrically nonlinear static response of nonlocal
cylindrical shell panels. This study is intended to provide a general
foundation to investigate the nonlocal behavior of curved structures by means
of fractional order models.
","[{'version': 'v1', 'created': 'Wed, 2 Feb 2022 04:28:57 GMT'}]",2022-06-29,"[['Sidhardh', 'Sai', ''], ['Patnaik', 'Sansit', ''], ['Semperlotti', 'Fabio', '']]","['Fractional calculus', 'Nonlocal shells', 'Cylindrical panels', 'Geometric nonlinearity']"
10284,2104.12000,Hadi Jahanshahi,"Hadi Jahanshahi, Aysun Bozanta, Mucahit Cevik, Eray Mert Kavuk,
  Ay\c{s}e Tosun, Sibel B. Sonuc, Bilgin Kosucu, Ay\c{s}e Ba\c{s}ar",A Deep Reinforcement Learning Approach for the Meal Delivery Problem,"Keywords: meal delivery, courier assignment, reinforcement learning,
  DQN, DDQN",Knowledge-Based Systems (2022),10.1016/j.knosys.2022.108489,https://www.sciencedirect.com/science/article/pii/S0950705122002088,cs.LG cs.AI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a meal delivery service fulfilling dynamic customer requests
given a set of couriers over the course of a day. A courier's duty is to
pick-up an order from a restaurant and deliver it to a customer. We model this
service as a Markov decision process and use deep reinforcement learning as the
solution approach. We experiment with the resulting policies on synthetic and
real-world datasets and compare those with the baseline policies. We also
examine the courier utilization for different numbers of couriers. In our
analysis, we specifically focus on the impact of the limited available
resources in the meal delivery problem. Furthermore, we investigate the effect
of intelligent order rejection and re-positioning of the couriers. Our
numerical experiments show that, by incorporating the geographical locations of
the restaurants, customers, and the depot, our model significantly improves the
overall service quality as characterized by the expected total reward and the
delivery times. Our results present valuable insights on both the courier
assignment process and the optimal number of couriers for different order
frequencies on a given day. The proposed model also shows a robust performance
under a variety of scenarios for real-world implementation.
","[{'version': 'v1', 'created': 'Sat, 24 Apr 2021 19:01:59 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Feb 2022 16:33:54 GMT'}]",2022-03-01,"[['Jahanshahi', 'Hadi', ''], ['Bozanta', 'Aysun', ''], ['Cevik', 'Mucahit', ''], ['Kavuk', 'Eray Mert', ''], ['Tosun', 'Ayşe', ''], ['Sonuc', 'Sibel B.', ''], ['Kosucu', 'Bilgin', ''], ['Başar', 'Ayşe', '']]","['meal delivery', 'courier assignment', 'reinforcement learning', 'DQN', 'DDQN']"
10285,2104.03010,Thomas Mildner,Thomas Mildner and Gian-Luca Savino,"Ethical User Interfaces: Exploring the Effects of Dark Patterns on
  Facebook",,,10.1145/3411763.3451659,,cs.HC,http://creativecommons.org/publicdomain/zero/1.0/,"  Many researchers have been concerned with whether social media has a negative
impact on the well-being of their audience. With the popularity of social
networking sites (SNS) steadily increasing, psychological and social sciences
have shown great interest in their effects and consequences on humans. In this
work, we investigate Facebook using the tools of HCI to find connections
between interface features and the concerns raised by these domains. Using an
empirical design analysis, we identify interface interferences impacting users'
online privacy. Through a subsequent survey (n=116), we find usage behaviour
changes due to increased privacy concerns and report individual cases of
addiction and mental health issues. These observations are the results of a
rapidly changing SNS creating a gap of understanding between users'
interactions with the platform and future consequences. We explore how HCI can
help close this gap and work towards more ethical user interfaces in the
future.
","[{'version': 'v1', 'created': 'Wed, 7 Apr 2021 09:31:24 GMT'}]",2021-04-08,"[['Mildner', 'Thomas', ''], ['Savino', 'Gian-Luca', '']]","['SNS', 'social media', 'Facebook', 'interface design', 'dark patterns', 'wellbeing', 'ethical interfaces']"
10286,2203.16788,Srishti Mehra,"Srishti Mehra, Robert Louka, Yixun Zhang","ESGBERT: Language Model to Help with Classification Tasks Related to
  Companies Environmental, Social, and Governance Practices",,"pp. 183-190, 2022. CS & IT - CSCP 2022",10.5121/csit.2022.120616,,cs.CL cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Environmental, Social, and Governance (ESG) are non-financial factors that
are garnering attention from investors as they increasingly look to apply these
as part of their analysis to identify material risks and growth opportunities.
Some of this attention is also driven by clients who, now more aware than ever,
are demanding for their money to be managed and invested responsibly. As the
interest in ESG grows, so does the need for investors to have access to
consumable ESG information. Since most of it is in text form in reports,
disclosures, press releases, and 10-Q filings, we see a need for sophisticated
NLP techniques for classification tasks for ESG text. We hypothesize that an
ESG domain-specific pre-trained model will help with such and study building of
the same in this paper. We explored doing this by fine-tuning BERTs pre-trained
weights using ESG specific text and then further fine-tuning the model for a
classification task. We were able to achieve accuracy better than the original
BERT and baseline models in environment-specific classification tasks.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2022 04:22:44 GMT'}]",2022-04-01,"[['Mehra', 'Srishti', ''], ['Louka', 'Robert', ''], ['Zhang', 'Yixun', '']]","['ESG', 'NLP', 'BERT', 'Universal Sentence Encoder', 'Deep Averaging Network']"
10287,2002.10333,Yaser Ebazadeh,"Reza Fotohi, Yaser Ebazadeh, Mohammad Seyyar Geshlag","A New Approach for Improvement Security against DoS Attacks in Vehicular
  Ad-hoc Network","7 pages, 12 figures, 2 tables, 4 equation, journal","Int J Adv Comput Sci Appl, 7(7), 10-16 (2016)",10.14569/IJACSA.2016.070702,,cs.CR cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vehicular Ad-Hoc Networks (VANET) are a proper subset of mobile wireless
networks, where nodes are revulsive, the vehicles are armed with special
electronic devices on the motherboard OBU (On Board Unit) which enables them to
trasmit and receive messages from other vehicles in the VANET. Furthermore the
communication between the vehicles, the VANET interface is donated by the
contact points with road infrastructure. VANET is a subgroup of MANETs. Unlike
the MANETs nodes, VANET nodes are moving very fast. Impound a permanent route
for the dissemination of emergency messages and alerts from a danger zone is a
very challenging task. Therefore, routing plays a significant duty in VANETs.
decreasing network overhead, avoiding network congestion, increasing traffic
congestion and packet delivery ratio are the most important issues associated
with routing in VANETs. In addition, VANET network is subject to various
security attacks. In base VANET systems, an algorithm is used to dicover
attacks at the time of confirmation in which overhead delay occurs. This paper
proposes (P-Secure) approach which is used for the detection of DoS attacks
before the confirmation time. This reduces the overhead delays for processing
and increasing the security in VANETs. Simulation results show that the
P-Secure approach, is more efficient than OBUmodelVaNET approach in terms of
PDR, e2e_delay, throughput and drop packet rate.
","[{'version': 'v1', 'created': 'Mon, 24 Feb 2020 16:01:36 GMT'}]",2020-02-25,"[['Fotohi', 'Reza', ''], ['Ebazadeh', 'Yaser', ''], ['Geshlag', 'Mohammad Seyyar', '']]","['component; VANET', 'P-Secure Protocol', 'DoS']"
10288,1910.03534,Leonid Boytsov,"Leonid Boytsov, Eric Nyberg","Accurate and Fast Retrieval for Complex Non-metric Data via Neighborhood
  Graphs",,,10.1007/978-3-030-32047-8_12,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We demonstrate that a graph-based search algorithm-relying on the
construction of an approximate neighborhood graph-can directly work with
challenging non-metric and/or non-symmetric distances without resorting to
metric-space mapping and/or distance symmetrization, which, in turn, lead to
substantial performance degradation. Although the straightforward metrization
and symmetrization is usually ineffective, we find that constructing an index
using a modified, e.g., symmetrized, distance can improve performance. This
observation paves a way to a new line of research of designing index-specific
graph-construction distance functions.
","[{'version': 'v1', 'created': 'Tue, 8 Oct 2019 16:45:20 GMT'}]",2019-10-09,"[['Boytsov', 'Leonid', ''], ['Nyberg', 'Eric', '']]","['k-NN search', 'non-metric distance', 'neighborhood graph']"
10289,1811.08269,Tomislav Petkovi\'c,"Tomislav Petkovi\'c, David Puljiz, Ivan Markovi\'c, Bj\""orn Hein","Human Intention Estimation based on Hidden Markov Model Motion
  Validation for Safe Flexible Robotized Warehouses",,Robotics and Computer-Integrated Manufacturing 57 (2019): 182-196,10.1016/j.rcim.2018.11.004,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the substantial growth of logistics businesses the need for larger
warehouses and their automation arises, thus using robots as assistants to
human workers is becoming a priority. In order to operate efficiently and
safely, robot assistants or the supervising system should recognize human
intentions in real-time. Theory of mind (ToM) is an intuitive human conception
of other humans' mental state, i.e., beliefs and desires, and how they cause
behavior. In this paper we propose a ToM based human intention estimation
algorithm for flexible robotized warehouses. We observe human's, i.e., worker's
motion and validate it with respect to the goal locations using generalized
Voronoi diagram based path planning. These observations are then processed by
the proposed hidden Markov model framework which estimates worker intentions in
an online manner, capable of handling changing environments. To test the
proposed intention estimation we ran experiments in a real-world laboratory
warehouse with a worker wearing Microsoft Hololens augmented reality glasses.
Furthermore, in order to demonstrate the scalability of the approach to larger
warehouses, we propose to use virtual reality digital warehouse twins in order
to realistically simulate worker behavior. We conducted intention estimation
experiments in the larger warehouse digital twin with up to 24 running robots.
We demonstrate that the proposed framework estimates warehouse worker
intentions precisely and in the end we discuss the experimental results.
","[{'version': 'v1', 'created': 'Tue, 20 Nov 2018 14:32:31 GMT'}]",2019-01-11,"[['Petković', 'Tomislav', ''], ['Puljiz', 'David', ''], ['Marković', 'Ivan', ''], ['Hein', 'Björn', '']]","['human intention estimation', 'hidden Markov model', 'virtual reality', 'Theory of Mind']"
10290,1810.02537,Mostafa Zaman Chowdhury,Kazi Nawshad Azam and Mostafa Zaman Chowdhury,"Intelligent Interference Management Based on On-Demand Service
  Connectivity for Femtocellular Networks","of International Conference on Informatics, Electronics & Vision
  (ICIEV), May 2013, Dhaka, Bangladesh",,10.1109/ICIEV.2013.6572598,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The femto-access-point (FAP), a low power small cellular base station
provides better signal quality for the indoor users as to provide high
data-rate communications with improved coverage, access network capacity and
quality of service. Highly dense femtocellular deployments-the ultimate goal of
the femtocellular technology-will require significant degree of
selforganization in lieu of manual configuration as to mitigate unwanted
handovers and interference effects. The deployment of femtocells with our
proposed on-demand scheme in the multistoried building or home environment can
solve the low level signal-to-noise plus interference ratio and throughput
problems. In this paper, we propose new application of the femtocell technology
with a new idea of femto-idle-mode and femto-active-mode system. The
signal-to-noise plus interference ratio level and throughput are analyzed. The
simulation results show that the proposed on-demand scheme in femtocell
deployment significantly enhances the signal-to-noise plus interference ratio
level and throughput in the multistoried building or home environment.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 06:48:38 GMT'}]",2018-10-08,"[['Azam', 'Kazi Nawshad', ''], ['Chowdhury', 'Mostafa Zaman', '']]","['Femto-access-point', 'on-demand', 'femto-activemode', 'femto-idle-mode', 'interference management']"
10291,1704.06037,Erel Segal-Halevi,Mor Nitzan and Shmuel Nitzan and Erel Segal-Halevi,"Flexible Level-1 Consensus Ensuring Stable Social Choice: Analysis and
  Algorithms",,"Social Choice and Welfare, 2/11/2017, pages 1-23",10.1007/s00355-017-1092-2,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Level-1 Consensus is a property of a preference-profile. Intuitively, it
means that there exists a preference relation which induces an ordering of all
other preferences such that frequent preferences are those that are more
similar to it. This is a desirable property, since it enhances the stability of
social choice by guaranteeing that there exists a Condorcet winner and it is
elected by all scoring rules.
  In this paper, we present an algorithm for checking whether a given
preference profile exhibits level-1 consensus. We apply this algorithm to a
large number of preference profiles, both real and randomly-generated, and find
that level-1 consensus is very improbable. We support these empirical findings
theoretically, by showing that, under the impartial culture assumption, the
probability of level-1 consensus approaches zero when the number of individuals
approaches infinity.
  Motivated by these observations, we show that the level-1 consensus property
can be weakened while retaining its stability implications. We call this weaker
property Flexible Consensus. We show, both empirically and theoretically, that
it is considerably more probable than the original level-1 consensus. In
particular, under the impartial culture assumption, the probability for
Flexible Consensus converges to a positive number when the number of
individuals approaches infinity.
","[{'version': 'v1', 'created': 'Thu, 20 Apr 2017 07:54:10 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Dec 2017 10:23:34 GMT'}]",2017-12-20,"[['Nitzan', 'Mor', ''], ['Nitzan', 'Shmuel', ''], ['Segal-Halevi', 'Erel', '']]","['domain restrictions', 'level-1 consensus', 'single peakedness']"
10292,2204.10686,Sylvain Sen\'e,"Jacques Demongeot, Tarek Melliti, Mathilde Noual, Damien Regnault and
  Sylvain Sen\'e",Boolean automata isolated cycles and tangential double-cycles dynamics,,"Springer Series on Emergence, Complexity and Computation, vol. 42,
  pp. 145-178, 2022",10.1007/978-3-030-92551-2_11,,cs.DM,http://creativecommons.org/licenses/by/4.0/,"  Our daily social and political life is more and more impacted by social
networks. The functioning of our living bodies is deeply dependent on
biological regulation networks such as neural, genetic, and protein networks.
And the physical world in which we evolve, is also structured by systems of
interacting particles. Interaction networks can be seen in all spheres of
existence that concern us, and yet, our understanding of interaction networks
remains severely limited by our present lack of both theoretical and applied
insight into their clockworks. In the past, efforts at understanding
interaction networks have mostly been directed towards applications. This has
happened at the expense of developing understanding of the generic and
fundamental aspects of interaction networks. Intrinsic properties of
interaction networks (eg the ways in which they transmit information along
entities, their ability to produce this or that kind of global dynamical
behaviour depending on local interactions) are thus still not well understood.
Lack of fundamental knowledge tends to limit the innovating power of
applications. Without more theoretical fundamental knowledge, applications
cannot evolve deeply and become more impacting. Hence, it is necessary to
better apprehend and comprehend the intrinsic properties of interaction
networks, notably the relations between their architecture and their dynamics
and how they are affected by and set in time. In this chapter, we use the
elementary mathematical model of Boolean automata networks as a formal
archetype of interaction networks. We survey results concerning the role of
feedback cycles and the role of intersections between feedback cycles, in
shaping the asymptotic dynamical behaviours of interaction networks.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2022 13:04:53 GMT'}]",2022-04-25,"[['Demongeot', 'Jacques', ''], ['Melliti', 'Tarek', ''], ['Noual', 'Mathilde', ''], ['Regnault', 'Damien', ''], ['Sené', 'Sylvain', '']]","['Discrete dynamical systems', 'Boolean networks', 'Boolean cycles', 'updating modes', 'dynamics and combinatorics']"
10293,1506.04189,Babak Fotouhi,Babak Fotouhi and Naghmeh Momeni,"Multiplex Networks with Intrinsic Fitness: Modeling the Merit-Fame
  Interplay via Latent Layers",,"Chaos, Solitons & Fractals 80 (2015): 83-89",10.1016/j.chaos.2015.06.004,,cs.SI cond-mat.stat-mech cs.MA physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of growing multiplex networks with intrinsic fitness
and inter-layer coupling. The model comprises two layers; one that incorporates
fitness and another in which attachments are preferential. In the first layer,
attachment probabilities are proportional to fitness values, and in the second
layer, proportional to the sum of degrees in both layers. We provide analytical
closed-form solutions for the joint distributions of fitness and degrees. We
also derive closed-form expressions for the expected value of the degree as a
function of fitness. The model alleviates two shortcomings that are present in
the current models of growing multiplex networks: homogeneity of connections,
and homogeneity of fitness. In this paper, we posit and analyze a growth model
that is heterogeneous in both senses.
","[{'version': 'v1', 'created': 'Fri, 12 Jun 2015 21:59:18 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Jun 2015 17:37:51 GMT'}, {'version': 'v3', 'created': 'Sat, 20 Jun 2015 14:29:59 GMT'}]",2015-12-14,"[['Fotouhi', 'Babak', ''], ['Momeni', 'Naghmeh', '']]","['multiplex networks', 'intrinsic fitness', 'growing networks', 'preferential attachment', 'Stirling numbers']"
10294,1911.03883,Jiarui Qin,"Jiarui Qin, Kan Ren, Yuchen Fang, Weinan Zhang, Yong Yu","Sequential Recommendation with Dual Side Neighbor-based Collaborative
  Relation Modeling",WSDM 2020,,10.1145/3336191.3371842,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sequential recommendation task aims to predict user preference over items in
the future given user historical behaviors. The order of user behaviors implies
that there are resourceful sequential patterns embedded in the behavior history
which reveal the underlying dynamics of user interests. Various sequential
recommendation methods are proposed to model the dynamic user behaviors.
However, most of the models only consider the user's own behaviors and
dynamics, while ignoring the collaborative relations among users and items,
i.e., similar tastes of users or analogous properties of items. Without
modeling collaborative relations, those methods suffer from the lack of
recommendation diversity and thus may have worse performance. Worse still, most
existing methods only consider the user-side sequence and ignore the temporal
dynamics on the item side. To tackle the problems of the current sequential
recommendation models, we propose Sequential Collaborative Recommender (SCoRe)
which effectively mines high-order collaborative information using
cross-neighbor relation modeling and, additionally utilizes both user-side and
item-side historical sequences to better capture user and item dynamics.
Experiments on three real-world yet large-scale datasets demonstrate the
superiority of the proposed model over strong baselines.
","[{'version': 'v1', 'created': 'Sun, 10 Nov 2019 09:28:20 GMT'}]",2019-11-12,"[['Qin', 'Jiarui', ''], ['Ren', 'Kan', ''], ['Fang', 'Yuchen', ''], ['Zhang', 'Weinan', ''], ['Yu', 'Yong', '']]","['Sequential Recommendation', 'Collaborative Filtering', 'Co-Attention']"
10295,2104.08781,Antonios Liapis,Konstantinos Sfikas and Antonios Liapis and Georgios N. Yannakakis,"Monte Carlo Elites: Quality-Diversity Selection as a Multi-Armed Bandit
  Problem","Proceedings of the Genetic and Evolutionary Computation Conference, 9
  pages, 6 figures, 3 tables",,10.1145/3449639.3459321,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A core challenge of evolutionary search is the need to balance between
exploration of the search space and exploitation of highly fit regions.
Quality-diversity search has explicitly walked this tightrope between a
population's diversity and its quality. This paper extends a popular
quality-diversity search algorithm, MAP-Elites, by treating the selection of
parents as a multi-armed bandit problem. Using variations of the
upper-confidence bound to select parents from under-explored but potentially
rewarding areas of the search space can accelerate the discovery of new regions
as well as improve its archive's total quality. The paper tests an indirect
measure of quality for parent selection: the survival rate of a parent's
offspring. Results show that maintaining a balance between exploration and
exploitation leads to the most diverse and high-quality set of solutions in
three different testbeds.
","[{'version': 'v1', 'created': 'Sun, 18 Apr 2021 09:11:48 GMT'}]",2021-04-20,"[['Sfikas', 'Konstantinos', ''], ['Liapis', 'Antonios', ''], ['Yannakakis', 'Georgios N.', '']]","['evolutionary algorithms', 'parent selection', 'quality diversity', 'multiarmed bandit problem', 'mazes']"
10296,2104.07807,Jan Smeddinck,"Jack Holt, James Nicholson, Jan David Smeddinck","From Personal Data to Digital Legacy: Exploring Conflicts in the
  Sharing, Security and Privacy of Post-mortem Data",WWW '21,,10.1145/3442381.3450030,,cs.CR cs.HC,http://creativecommons.org/licenses/by/4.0/,"  As digital technologies become more prevalent there is a growing awareness of
the importance of good security and privacy practices. The tools and techniques
used to achieve this are typically designed with the living user in mind, with
little consideration of how they should or will perform after the user has
died. We report on two workshops carried out with users of password managers to
explore their views on the post-mortem sharing, security and privacy of a range
of common digital assets. We discuss a post-mortem privacy paradox where users
recognise value in planning for their digital legacy, yet avoid actively doing
so. Importantly, our findings highlight a tension between the use of
recommended security tools during life and facilitating appropriate post-mortem
access to chosen assets. We offer design recommendations to facilitate and
encourage digital legacy planning while promoting good security habits during
life.
","[{'version': 'v1', 'created': 'Thu, 15 Apr 2021 22:32:39 GMT'}]",2021-04-19,"[['Holt', 'Jack', ''], ['Nicholson', 'James', ''], ['Smeddinck', 'Jan David', '']]","['Digital Legacy', 'Post-mortem Privacy', 'Password Management', 'Usable Security']"
10297,2004.01792,Aayush Chaudhary,Aayush K Chaudhary and Jeff B. Pelz,Privacy-Preserving Eye Videos using Rubber Sheet Model,"Will be published in ETRA 20 Short Papers, June 2-5, 2020, Stuttgart,
  Germany Copyright 2020 Association for Computing Machinery",,10.1145/3379156.3391375,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video-based eye trackers estimate gaze based on eye images/videos. As
security and privacy concerns loom over technological advancements, tackling
such challenges is crucial. We present a new approach to handle privacy issues
in eye videos by replacing the current identifiable iris texture with a
different iris template in the video capture pipeline based on the Rubber Sheet
Model. We extend to image blending and median-value representations to
demonstrate that videos can be manipulated without significantly degrading
segmentation and pupil detection accuracy.
","[{'version': 'v1', 'created': 'Fri, 3 Apr 2020 21:59:38 GMT'}]",2020-04-07,"[['Chaudhary', 'Aayush K', ''], ['Pelz', 'Jeff B.', '']]","['Privacy', 'Security', 'Eye tracking', 'Iris Recognition', 'Rubber SheetModel', 'Eye Segmentation']"
10298,1906.04497,Artur Strzelecki,Artur Strzelecki and Paulina Rutecka,The Snippets Taxonomy in Web Search Engines,"12 pages, 3 tables",Perspectives in Business Informatics Research 2019,10.1007/978-3-030-31143-8_13,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper authors analyzed 50 000 keywords results collected from
localized Polish Google search engine. We proposed a taxonomy for snippets
displayed in search results as regular, rich, news, featured and entity types
snippets. We observed some correlations between overlapping snippets in the
same keywords. Results show that commercial keywords do not cause results
having rich or entity types snippets, whereas keywords resulting with snippets
are not commercial nature. We found that significant number of snippets are
scholarly articles and rich cards carousel. We conclude our findings with
conclusion and research limitations.
","[{'version': 'v1', 'created': 'Tue, 11 Jun 2019 11:06:26 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Oct 2019 21:22:28 GMT'}]",2019-10-25,"[['Strzelecki', 'Artur', ''], ['Rutecka', 'Paulina', '']]","['Rich Snippets', 'Rich Results', 'Search engines', 'Google', 'Bing']"
10299,2111.00479,Daiki Miyagawa,"Daiki Miyagawa, Azumi Mamiya, and Genki Ichinose","Adapting paths against zero-determinant strategies in repeated
  prisoner's dilemma games","28 pages, 11 figures, and 6 tables",,10.1016/j.jtbi.2022.111211,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Long-term cooperation, competition, or exploitation among individuals can be
modeled through repeated games. In repeated games, Press and Dyson discovered
zero-determinant (ZD) strategies that enforce a special relationship between
two players. This special relationship implies that a ZD player can
unilaterally impose a linear payoff relationship to the opponent regardless of
the opponent's strategies. A ZD player also has a property that can lead the
opponent to an unconditional cooperation if the opponent tries to improve its
payoff. This property has been mathematically confirmed by Chen and Zinger.
Humans often underestimate a payoff obtained in the future. However, such
discounting was not considered in their analysis. Here, we mathematically
explored whether a ZD player can lead the opponent to an unconditional
cooperation even if a discount factor is incorporated. Specifically, we
represented the expected payoff with a discount factor as the form of
determinants and calculated whether the values obtained by partially
differentiating each factor in the strategy vector become positive. As a
result, we proved that the strategy vector ends up as an unconditional
cooperation even when starting from any initial strategy. This result was
confirmed through numerical calculations. We extended the applicability of ZD
strategies to real world problems.
","[{'version': 'v1', 'created': 'Sun, 31 Oct 2021 12:19:09 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Jul 2022 15:27:33 GMT'}]",2022-07-18,"[['Miyagawa', 'Daiki', ''], ['Mamiya', 'Azumi', ''], ['Ichinose', 'Genki', '']]","['Prisoner’s dilemma', 'repeated games', 'discount factor', 'zero-determinant strategies', 'adaptive player', 'adaptingpath']"
10300,1812.08868,Tom Hanika,Tom Hanika and Maren Koyda and Gerd Stumme,Relevant Attributes in Formal Contexts,"14 pages, 5 figures",,10.1007/978-3-030-23182-8_8,,cs.AI cs.IT cs.LG math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computing conceptual structures, like formal concept lattices, is in the age
of massive data sets a challenging task. There are various approaches to deal
with this, e.g., random sampling, parallelization, or attribute extraction. A
so far not investigated method in the realm of formal concept analysis is
attribute selection, as done in machine learning. Building up on this we
introduce a method for attribute selection in formal contexts. To this end, we
propose the notion of relevant attributes which enables us to define a relative
relevance function, reflecting both the order structure of the concept lattice
as well as distribution of objects on it. Finally, we overcome computational
challenges for computing the relative relevance through an approximation
approach based on information entropy.
","[{'version': 'v1', 'created': 'Thu, 20 Dec 2018 22:07:16 GMT'}]",2020-02-28,"[['Hanika', 'Tom', ''], ['Koyda', 'Maren', ''], ['Stumme', 'Gerd', '']]","['Formal Concept Analysis', 'Relvevant Features', 'Attribute Selection', 'Entropy', 'Label Function']"
10301,1708.03346,Edward Raff,"Edward Raff, Charles K. Nicholas","Lempel-Ziv Jaccard Distance, an Effective Alternative to Ssdeep and
  Sdhash",,,10.1016/j.diin.2017.12.004,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent work has proposed the Lempel-Ziv Jaccard Distance (LZJD) as a method
to measure the similarity between binary byte sequences for malware
classification. We propose and test LZJD's effectiveness as a similarity digest
hash for digital forensics. To do so we develop a high performance Java
implementation with the same command-line arguments as sdhash, making it easy
to integrate into existing workflows. Our testing shows that LZJD is effective
for this task, and significantly outperforms sdhash and ssdeep in its ability
to match related file fragments and files corrupted with random noise. In
addition, LZJD is up to 60x faster than sdhash at comparison time.
","[{'version': 'v1', 'created': 'Thu, 10 Aug 2017 18:19:29 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Feb 2018 13:49:43 GMT'}]",2018-02-16,"[['Raff', 'Edward', ''], ['Nicholas', 'Charles K.', '']]","['LZJD', 'sdhash', 'ssdeep', 'bytewise approximate matching']"
10302,2101.06143,Fritz Lekschas,"Fritz Lekschas, Spyridon Ampanavos, Pao Siangliulue, Hanspeter
  Pfister, Krzysztof Z. Gajos","Ask Me or Tell Me? Enhancing the Effectiveness of Crowdsourced Design
  Feedback",,,10.1145/3411764.3445507,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Crowdsourced design feedback systems are emerging resources for getting large
amounts of feedback in a short period of time. Traditionally, the feedback
comes in the form of a declarative statement, which often contains positive or
negative sentiment. Prior research has shown that overly negative or positive
sentiment can strongly influence the perceived usefulness and acceptance of
feedback and, subsequently, lead to ineffective design revisions. To enhance
the effectiveness of crowdsourced design feedback, we investigate a new
approach for mitigating the effects of negative or positive feedback by
combining open-ended and thought-provoking questions with declarative feedback
statements. We conducted two user studies to assess the effects of
question-based feedback on the sentiment and quality of design revisions in the
context of graphic design. We found that crowdsourced question-based feedback
contains more neutral sentiment than statement-based feedback. Moreover, we
provide evidence that presenting feedback as questions followed by statements
leads to better design revisions than question- or statement-based feedback
alone.
","[{'version': 'v1', 'created': 'Fri, 15 Jan 2021 14:41:04 GMT'}]",2021-01-18,"[['Lekschas', 'Fritz', ''], ['Ampanavos', 'Spyridon', ''], ['Siangliulue', 'Pao', ''], ['Pfister', 'Hanspeter', ''], ['Gajos', 'Krzysztof Z.', '']]","['crowdsourced design feedback', 'feedback framing', 'sentiment', 'questioning']"
10303,2205.02041,Songheng (Alexander) Zhang,"Songheng Zhang, Yong Wang, Haotian Li, Wanyu Zhang","Who Will Support My Project? Interactive Search of Potential
  Crowdfunding Investors Through InSearch",,CHI EA 2022,10.1145/3491101.3519725,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crowdfunding provides project founders with a convenient way to reach online
investors. However, it is challenging for founders to find the most potential
investors and successfully raise money for their projects on crowdfunding
platforms. A few machine learning based methods have been proposed to recommend
investors' interest in a specific crowdfunding project, but they fail to
provide project founders with explanations in detail for these recommendations,
thereby leading to an erosion of trust in predicted investors. To help
crowdfunding founders find truly interested investors, we conducted
semi-structured interviews with four crowdfunding experts and presents
inSearch, a visual analytic system. inSearch allows founders to search for
investors interactively on crowdfunding platforms. It supports an effective
overview of potential investors by leveraging a Graph Neural Network to model
investor preferences. Besides, it enables interactive exploration and
comparison of the temporal evolution of different investors' investment
details.
","[{'version': 'v1', 'created': 'Wed, 4 May 2022 12:59:00 GMT'}, {'version': 'v2', 'created': 'Thu, 5 May 2022 01:43:49 GMT'}]",2022-05-06,"[['Zhang', 'Songheng', ''], ['Wang', 'Yong', ''], ['Li', 'Haotian', ''], ['Zhang', 'Wanyu', '']]","['Visual Analytics', 'Crowdfunding', 'Comparative Analysis']"
10304,1508.06124,Kuang Zhou,"Kuang Zhou (DRUID), Arnaud Martin (DRUID), Quan Pan","A similarity-based community detection method with multiple prototype
  representation",,"Physica A: Statistical Mechanics and its Applications, 2015,
  pp.519-531",10.1016/j.physa.2015.07.016,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Communities are of great importance for understanding graph structures in
social networks. Some existing community detection algorithms use a single
prototype to represent each group. In real applications, this may not
adequately model the different types of communities and hence limits the
clustering performance on social networks. To address this problem, a
Similarity-based Multi-Prototype (SMP) community detection approach is proposed
in this paper. In SMP, vertices in each community carry various weights to
describe their degree of representativeness. This mechanism enables each
community to be represented by more than one node. The centrality of nodes is
used to calculate prototype weights, while similarity is utilized to guide us
to partitioning the graph. Experimental results on computer generated and
real-world networks clearly show that SMP performs well for detecting
communities. Moreover, the method could provide richer information for the
inner structure of the detected communities with the help of prototype weights
compared with the existing community detection models.
","[{'version': 'v1', 'created': 'Tue, 25 Aug 2015 12:08:41 GMT'}]",2015-08-26,"[['Zhou', 'Kuang', '', 'DRUID'], ['Martin', 'Arnaud', '', 'DRUID'], ['Pan', 'Quan', '']]","['Multiple prototype', 'node similarity', 'community detection', 'prototype weights']"
10305,2007.02472,Fang Liu,"Fang Liu, Wei-Guo Zhang",A modified axiomatic foundation of the analytic hierarchy process,28 pages; 3 figures; submitted to a journal,Expert Systems With Applications (2021),10.1016/j.eswa.2021.115427,,cs.IT cs.AI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper reports a modified axiomatic foundation of the analytic hierarchy
process (AHP), where the reciprocal property of paired comparisons is broken.
The novel concept of reciprocal symmetry breaking is proposed to characterize
the considered situation without reciprocal property. It is found that the
uncertainty experienced by the decision maker can be naturally incorporated
into the modified axioms. Some results are derived from the new axioms
involving the new concept of approximate consistency and the method of
eliciting priorities. The phenomenon of ranking reversal is revisited from a
theoretical viewpoint under the modified axiomatic foundation. The situations
without ranking reversal are addressed and called ranking equilibrium. The
likelihood of ranking reversal is captured by introducing a possibility degree
index based on the Kendall's coefficient of concordance. The modified axioms
and the derived facts form a novel operational basis of the AHP choice model
under some uncertainty. The observations reveal that a more flexible expression
of decision information could be accepted as compared to the judgments with
reciprocal property.
","[{'version': 'v1', 'created': 'Mon, 6 Jul 2020 00:03:44 GMT'}]",2021-08-05,"[['Liu', 'Fang', ''], ['Zhang', 'Wei-Guo', '']]","['Analytic hierarchy process (AHP)', 'modified axiomatic foundation', 'reciprocalsymmetry breaking', 'ranking equilibrium', 'possibility degree']"
10306,1907.02818,"Jan H\""uckelheim","Jan H\""uckelheim, Navjot Kukreja, Sri Hari Krishna Narayanan, Fabio
  Luporini, Gerard Gorman, Paul Hovland",Automatic Differentiation for Adjoint Stencil Loops,ICPP 2019,,10.1145/3337821.3337906,,cs.DC cs.LG cs.PF cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stencil loops are a common motif in computations including convolutional
neural networks, structured-mesh solvers for partial differential equations,
and image processing. Stencil loops are easy to parallelise, and their fast
execution is aided by compilers, libraries, and domain-specific languages.
Reverse-mode automatic differentiation, also known as algorithmic
differentiation, autodiff, adjoint differentiation, or back-propagation, is
sometimes used to obtain gradients of programs that contain stencil loops.
Unfortunately, conventional automatic differentiation results in a memory
access pattern that is not stencil-like and not easily parallelisable.
  In this paper we present a novel combination of automatic differentiation and
loop transformations that preserves the structure and memory access pattern of
stencil loops, while computing fully consistent derivatives. The generated
loops can be parallelised and optimised for performance in the same way and
using the same tools as the original computation. We have implemented this new
technique in the Python tool PerforAD, which we release with this paper along
with test cases derived from seismic imaging and computational fluid dynamics
applications.
","[{'version': 'v1', 'created': 'Fri, 5 Jul 2019 13:33:34 GMT'}]",2019-07-08,"[['Hückelheim', 'Jan', ''], ['Kukreja', 'Navjot', ''], ['Narayanan', 'Sri Hari Krishna', ''], ['Luporini', 'Fabio', ''], ['Gorman', 'Gerard', ''], ['Hovland', 'Paul', '']]","['Automatic Differentiation', 'Stencil Computation', 'Loop-Transformation', 'Shared-Memory Parallel', 'Discrete Adjoints', 'Back-Propagation']"
10307,2109.03375,Gueltoum Bendiab,"Robert Shire, Stavros Shiaeles, Keltoum Bendiab, Bogdan Ghita,
  Nicholas Kolokotronis","Malware Squid: A Novel IoT Malware Traffic Analysis Framework using
  Convolutional Neural Network and Binary Visualisation","8 pages, 7 figures, 4 tables","NEW2AN 2019, ruSMART 2019: Internet of Things, Smart Spaces, and
  Next Generation Networks and Systems pp 65-76",10.1007/978-3-030-30859-9_6,,cs.CR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet of Things devices have seen a rapid growth and popularity in recent
years with many more ordinary devices gaining network capability and becoming
part of the ever growing IoT network. With this exponential growth and the
limitation of resources, it is becoming increasingly harder to protect against
security threats such as malware due to its evolving faster than the defence
mechanisms can handle with. The traditional security systems are not able to
detect unknown malware as they use signature-based methods. In this paper, we
aim to address this issue by introducing a novel IoT malware traffic analysis
approach using neural network and binary visualisation. The prime motivation of
the proposed approach is to faster detect and classify new malware (zero-day
malware). The experiment results show that our method can satisfy the accuracy
requirement of practical application.
","[{'version': 'v1', 'created': 'Wed, 8 Sep 2021 00:21:45 GMT'}]",2021-09-09,"[['Shire', 'Robert', ''], ['Shiaeles', 'Stavros', ''], ['Bendiab', 'Keltoum', ''], ['Ghita', 'Bogdan', ''], ['Kolokotronis', 'Nicholas', '']]","['Traffic analysis', 'Neural network', 'Binary visualization', 'Network anomaly detection', 'Intrusion detection system']"
10308,2008.01938,Susumu Matsumae,Susumu Matsumae and Makoto Miyazaki,Solving Dynamic Programming Problem by Pipeline Implementation on GPU,,"International Journal of Advanced Computer Science and
  Applications(IJACSA), Volume 9 Issue 12, 2018",10.14569/IJACSA.2018.091272,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we show the effectiveness of a pipeline implementation of
Dynamic Programming (DP) on GPU. As an example, we explain how to solve a
matrix-chain multiplication (MCM) problem by DP on GPU. This problem can be
sequentially solved in $O(n^3)$ steps by DP where $n$ is the number of
matrices, because its solution table is of size $n \times n$ and each element
of the table can be computed in $O(n)$ steps. A typical speedup strategy for
this is to parallelize the $O(n)$ step computation of each element, which can
be easily achieved by parallel prefix computation, i.e., an $O(\log n)$ step
computation with $n$ threads in a tournament fashion. By such a standard
parallelizing method, we can solve the MCM problem in $O(n^2 \log n)$ steps
with $n$ threads. In our approach, we solve the MCM problem on GPU in a
pipeline fashion, i.e., we use GPU cores for supporting pipeline-stages so that
many elements of the solution table are partially computed in parallel at one
time. Our implementation determines one output value per one computational step
with $n$ threads in a pipeline fashion and constructs the solution table
totally in $O(n^2)$ steps with $n$ threads.
","[{'version': 'v1', 'created': 'Wed, 5 Aug 2020 05:15:00 GMT'}]",2020-08-06,"[['Matsumae', 'Susumu', ''], ['Miyazaki', 'Makoto', '']]","['Dynamic Programming', 'Pipeline Implementation', 'GPGPU']"
10309,1809.05820,Baoyu Jing,"Baoyu Jing, Chenwei Lu, Deqing Wang, Fuzhen Zhuang, Cheng Niu",Cross-Domain Labeled LDA for Cross-Domain Text Classification,ICDM 2018,,10.1109/ICDM.2018.00034,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cross-domain text classification aims at building a classifier for a target
domain which leverages data from both source and target domain. One promising
idea is to minimize the feature distribution differences of the two domains.
Most existing studies explicitly minimize such differences by an exact
alignment mechanism (aligning features by one-to-one feature alignment,
projection matrix etc.). Such exact alignment, however, will restrict models'
learning ability and will further impair models' performance on classification
tasks when the semantic distributions of different domains are very different.
To address this problem, we propose a novel group alignment which aligns the
semantics at group level. In addition, to help the model learn better semantic
groups and semantics within these groups, we also propose a partial supervision
for model's learning in source domain. To this end, we embed the group
alignment and a partial supervision into a cross-domain topic model, and
propose a Cross-Domain Labeled LDA (CDL-LDA). On the standard 20Newsgroup and
Reuters dataset, extensive quantitative (classification, perplexity etc.) and
qualitative (topic detection) experiments are conducted to show the
effectiveness of the proposed group alignment and partial supervision.
","[{'version': 'v1', 'created': 'Sun, 16 Sep 2018 06:02:37 GMT'}]",2019-01-07,"[['Jing', 'Baoyu', ''], ['Lu', 'Chenwei', ''], ['Wang', 'Deqing', ''], ['Zhuang', 'Fuzhen', ''], ['Niu', 'Cheng', '']]","['Cross Domain Text Classification', 'Topic Modeling', 'Group Alignment', 'Partial Supervision']"
10310,2103.10635,Atanu Barai,"Atanu Barai, Gopinath Chennupati, Nandakishore Santhi, Abdel-Hameed
  Badawy, Yehia Arafa, Stephan Eidenbenz","PPT-SASMM: Scalable Analytical Shared Memory Model: Predicting the
  Performance of Multicore Caches from a Single-Threaded Execution Trace","11 pages, 5 figures. arXiv admin note: text overlap with
  arXiv:1907.12666",,10.1145/3422575.3422806,,cs.DC cs.PF,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Performance modeling of parallel applications on multicore processors remains
a challenge in computational co-design due to multicore processors' complex
design. Multicores include complex private and shared memory hierarchies. We
present a Scalable Analytical Shared Memory Model (SASMM). SASMM can predict
the performance of parallel applications running on a multicore. SASMM uses a
probabilistic and computationally-efficient method to predict the reuse
distance profiles of caches in multicores. SASMM relies on a stochastic, static
basic block-level analysis of reuse profiles. The profiles are calculated from
the memory traces of applications that run sequentially rather than using
multi-threaded traces. The experiments show that our model can predict private
L1 cache hit rates with 2.12% and shared L2 cache hit rates with about 1.50%
error rate.
","[{'version': 'v1', 'created': 'Fri, 19 Mar 2021 05:10:39 GMT'}]",2021-03-26,"[['Barai', 'Atanu', ''], ['Chennupati', 'Gopinath', ''], ['Santhi', 'Nandakishore', ''], ['Badawy', 'Abdel-Hameed', ''], ['Arafa', 'Yehia', ''], ['Eidenbenz', 'Stephan', '']]","['Performance modeling', 'Parallel application', 'Shared cache', 'Reusedistance analysis', 'Probabilistic model', 'LLVM basic block']"
10311,1803.09160,Tegjyot Singh Sethi,"Tegjyot Singh Sethi, Mehmed Kantardzic",Handling Adversarial Concept Drift in Streaming Data,Journal paper,Expert Systems with Applications 97 (2018): 18-40,10.1016/j.eswa.2017.12.022,,cs.LG cs.CR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classifiers operating in a dynamic, real world environment, are vulnerable to
adversarial activity, which causes the data distribution to change over time.
These changes are traditionally referred to as concept drift, and several
approaches have been developed in literature to deal with the problem of drift
handling and detection. However, most concept drift handling techniques,
approach it as a domain independent task, to make them applicable to a wide
gamut of reactive systems. These techniques were developed from an adversarial
agnostic perspective, where they are naive and assume that drift is a benign
change, which can be fixed by updating the model. However, this is not the case
when an active adversary is trying to evade the deployed classification system.
In such an environment, the properties of concept drift are unique, as the
drift is intended to degrade the system and at the same time designed to avoid
detection by traditional concept drift detection techniques. This special
category of drift is termed as adversarial drift, and this paper analyzes its
characteristics and impact, in a streaming environment. A novel framework for
dealing with adversarial concept drift is proposed, called the Predict-Detect
streaming framework. Experimental evaluation of the framework, on generated
adversarial drifting data streams, demonstrates that this framework is able to
provide reliable unsupervised indication of drift, and is able to recover from
drifts swiftly. While traditional partially labeled concept drift detection
methodologies fail to detect adversarial drifts, the proposed framework is able
to detect such drifts and operates with <6% labeled data, on average. Also, the
framework provides benefits for active learning over imbalanced data streams,
by innately providing for feature space honeypots, where minority class
adversarial samples may be captured.
","[{'version': 'v1', 'created': 'Sat, 24 Mar 2018 20:30:50 GMT'}]",2018-03-28,"[['Sethi', 'Tegjyot Singh', ''], ['Kantardzic', 'Mehmed', '']]","['Adversarial machine learning', 'Concept drift', 'Streaming data', 'Limited labeling', 'Active learning', 'Classification']"
10312,1906.08125,Mihkel Veske,"Mihkel Veske, Andreas Kyritsakis, Kyrre Ness Sjobak, Vahur Zadin, Alvo
  Aabloo and Flyura Djurabekova",Dynamic coupling between particle-in-cell and atomistic simulations,"15 pages, 12 figures","Phys. Rev. E 101, 053307 (2020)",10.1103/PhysRevE.101.053307,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a method to directly couple molecular dynamics, finite element
method and particle-in-cell techniques to simulate metal surface response to
high electric fields. We use this method to simulate the evolution of a field
emitting tip under thermal runaway by fully including the 3D space-charge
effects. We also present a comparison of the runaway process between the two
tip geometries of different widths. The results show with high statistical
significance that in case of sufficiently narrow field emitters, the thermal
runaway occurs in cycles where intensive neutral evaporation alternates with
the cooling periods. The comparison with previous works shows, that the
evaporation rate in the regime of intensive evaporation is sufficient to ignite
a plasma arc above the simulated field emitters.
","[{'version': 'v1', 'created': 'Wed, 19 Jun 2019 14:49:05 GMT'}, {'version': 'v2', 'created': 'Sun, 24 May 2020 21:22:07 GMT'}]",2020-05-27,"[['Veske', 'Mihkel', ''], ['Kyritsakis', 'Andreas', ''], ['Sjobak', 'Kyrre Ness', ''], ['Zadin', 'Vahur', ''], ['Aabloo', 'Alvo', ''], ['Djurabekova', 'Flyura', '']]","['vacuum arc', 'vacuum breakdown', 'electron emission', 'plasma initiation', 'thermal runaway', 'metal nanotip', 'multiscale-multiphysics simulation']"
10313,2008.04869,Daniel Archambault,"Helen C. Purchase, Daniel Archambault, Stephen Kobourov, Martin
  N\""ollenburg, Sergey Pupyrev, Hsiang-Yun Wu",The Turing Test for Graph Drawing Algorithms,"Appears in the Proceedings of the 28th International Symposium on
  Graph Drawing and Network Visualization (GD 2020)",,10.1007/978-3-030-68766-3_36,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Do algorithms for drawing graphs pass the Turing Test? That is, are their
outputs indistinguishable from graphs drawn by humans? We address this question
through a human-centred experiment, focusing on `small' graphs, of a size for
which it would be reasonable for someone to choose to draw the graph manually.
Overall, we find that hand-drawn layouts can be distinguished from those
generated by graph drawing algorithms, although this is not always the case for
graphs drawn by force-directed or multi-dimensional scaling algorithms, making
these good candidates for Turing Test success. We show that, in general,
hand-drawn graphs are judged to be of higher quality than automatically
generated ones, although this result varies with graph size and algorithm.
","[{'version': 'v1', 'created': 'Tue, 11 Aug 2020 17:20:48 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Aug 2020 17:12:58 GMT'}, {'version': 'v3', 'created': 'Tue, 18 Aug 2020 14:38:30 GMT'}, {'version': 'v4', 'created': 'Wed, 19 Aug 2020 08:52:49 GMT'}]",2021-05-11,"[['Purchase', 'Helen C.', ''], ['Archambault', 'Daniel', ''], ['Kobourov', 'Stephen', ''], ['Nöllenburg', 'Martin', ''], ['Pupyrev', 'Sergey', ''], ['Wu', 'Hsiang-Yun', '']]","['Empirical studies', 'Graph Drawing Algorithms', 'Turing Test']"
10314,2208.07553,Ali Can Demiralp,"Ali Can Demiralp, Dirk Norbert Helmrich, Joachim Protze, Torsten
  Wolfgang Kuhlen, Tim Gerrits","Performance Assessment of Diffusive Load Balancing for Distributed
  Particle Advection",,Computer Science Research Notes 3201 (2022) 6-15,10.24132/CSRN.3201.2,,cs.DC cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Particle advection is the approach for extraction of integral curves from
vector fields. Efficient parallelization of particle advection is a challenging
task due to the problem of load imbalance, in which processes are assigned
unequal workloads, causing some of them to idle as the others are performing
compute. Various approaches to load balancing exist, yet they all involve
trade-offs such as increased inter-process communication, or the need for
central control structures. In this work, we present two local load balancing
methods for particle advection based on the family of diffusive load balancing.
Each process has access to the blocks of its neighboring processes, which
enables dynamic sharing of the particles based on a metric defined by the
workload of the neighborhood. The approaches are assessed in terms of strong
and weak scaling as well as load imbalance. We show that the methods reduce the
total run-time of advection and are promising with regard to scaling as they
operate locally on isolated process neighborhoods.
","[{'version': 'v1', 'created': 'Tue, 16 Aug 2022 06:02:21 GMT'}]",2022-08-17,"[['Demiralp', 'Ali Can', ''], ['Helmrich', 'Dirk Norbert', ''], ['Protze', 'Joachim', ''], ['Kuhlen', 'Torsten Wolfgang', ''], ['Gerrits', 'Tim', '']]","['Particle Advection', 'Distributed Algorithms', 'Load Balancing']"
10315,1902.03297,Nikolaj Tatti,Nikolaj Tatti,Probably the Best Itemsets,,,10.1145/1835804.1835843,,cs.DB cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the main current challenges in itemset mining is to discover a small
set of high-quality itemsets. In this paper we propose a new and general
approach for measuring the quality of itemsets. The method is solidly founded
in Bayesian statistics and decreases monotonically, allowing for efficient
discovery of all interesting itemsets. The measure is defined by connecting
statistical models and collections of itemsets. This allows us to score
individual itemsets with the probability of them occuring in random models
built on the data.
  As a concrete example of this framework we use exponential models. This class
of models possesses many desirable properties. Most importantly, Occam's razor
in Bayesian model selection provides a defence for the pattern explosion. As
general exponential models are infeasible in practice, we use decomposable
models; a large sub-class for which the measure is solvable. For the actual
computation of the score we sample models from the posterior distribution using
an MCMC approach.
  Experimentation on our method demonstrates the measure works in practice and
results in interpretable and insightful itemsets for both synthetic and
real-world data.
","[{'version': 'v1', 'created': 'Thu, 7 Feb 2019 18:51:59 GMT'}]",2019-02-12,"[['Tatti', 'Nikolaj', '']]","['Itemset mining', 'exponential models', 'decomposable models', 'junction trees', 'Bayesian model selection', 'MCMC']"
10316,2210.00472,Quan Li,"Yun Tian, He Wang, Laixin Xie, Xiaojuan Ma, and Quan Li","VFLens: Co-design the Modeling Process for Efficient Vertical Federated
  Learning via Visualization","The Tenth International Symposium of Chinese CHI (Chinese CHI 2022),
  October 22--23, 2022, Guangzhou, China and Online, China",,10.1145/3565698.3565765,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  As a decentralized training approach, federated learning enables multiple
organizations to jointly train a model without exposing their private data.
This work investigates vertical federated learning (VFL) to address scenarios
where collaborating organizations have the same set of users but with different
features, and only one party holds the labels. While VFL shows good
performance, practitioners often face uncertainty when preparing
non-transparent, internal/external features and samples for the VFL training
phase. Moreover, to balance the prediction accuracy and the resource
consumption of model inference, practitioners require to know which subset of
prediction instances is genuinely needed to invoke the VFL model for inference.
To this end, we co-design the VFL modeling process by proposing an interactive
real-time visualization system, VFLens, to help practitioners with feature
engineering, sample selection, and inference. A usage scenario, a quantitative
experiment, and expert feedback suggest that VFLens helps practitioners boost
VFL efficiency at a lower cost with sufficient confidence.
","[{'version': 'v1', 'created': 'Sun, 2 Oct 2022 09:47:00 GMT'}]",2022-10-04,"[['Tian', 'Yun', ''], ['Wang', 'He', ''], ['Xie', 'Laixin', ''], ['Ma', 'Xiaojuan', ''], ['Li', 'Quan', '']]","['Federated Learning', 'Visual Analytics', 'Feature Interpretation', 'Sample Selection']"
10317,2211.13958,Hamed Nemati,"Ahmad Ibrahim, Hamed Nemati, Till Schl\""uter, Nils Ole Tippenhauer,
  Christian Rossow","Microarchitectural Leakage Templates and Their Application to
  Cache-Based Side Channels",,,10.1145/3548606.3560613,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  The complexity of modern processor architectures has given rise to
sophisticated interactions among their components. Such interactions may result
in potential attack vectors in terms of side channels, possibly available to
user-land exploits to leak secret data. Exploitation and countering of such
side channels require a detailed understanding of the target component.
However, such detailed information is commonly unpublished for many CPUs.
  In this paper, we introduce the concept of Leakage Templates to abstractly
describe specific side channels and identify their occurrences in binary
applications. We design and implement Plumber, a framework to derive the
generic Leakage Templates from individual code sequences that are known to
cause leakage (e.g., found by prior work). Plumber uses a combination of
instruction fuzzing, instructions' operand mutation and statistical analysis to
explore undocumented behavior of microarchitectural optimizations and derive
sufficient conditions on vulnerable code inputs that, if hold can trigger a
distinguishing behavior. Using Plumber we identified novel leakage primitives
based on Leakage Templates (for ARM Cortex-A53 and -A72 cores), in particular
related to previction (a new premature cache eviction), and prefetching
behavior. We show the utility of Leakage Templates by re-identifying a
prefetcher-based vulnerability in OpenSSL 1.1.0g first reported by Shin et al.
[40].
","[{'version': 'v1', 'created': 'Fri, 25 Nov 2022 08:42:13 GMT'}]",2022-11-28,"[['Ibrahim', 'Ahmad', ''], ['Nemati', 'Hamed', ''], ['Schlüter', 'Till', ''], ['Tippenhauer', 'Nils Ole', ''], ['Rossow', 'Christian', '']]","['microarchitecture', 'side channel', 'leakage templates']"
10318,2112.01740,Bowen Li,"Bowen Li, Chen Wang, Pranay Reddy, Seungchan Kim, Sebastian Scherer","AirDet: Few-Shot Detection without Fine-tuning for Autonomous
  Exploration","23 pages, 9 figures",2022 17th European Conference on Computer Vision (ECCV),10.1007/978-3-031-19842-7_25,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Few-shot object detection has attracted increasing attention and rapidly
progressed in recent years. However, the requirement of an exhaustive offline
fine-tuning stage in existing methods is time-consuming and significantly
hinders their usage in online applications such as autonomous exploration of
low-power robots. We find that their major limitation is that the little but
valuable information from a few support images is not fully exploited. To solve
this problem, we propose a brand new architecture, AirDet, and surprisingly
find that, by learning class-agnostic relation with the support images in all
modules, including cross-scale object proposal network, shots aggregation
module, and localization network, AirDet without fine-tuning achieves
comparable or even better results than many fine-tuned methods, reaching up to
30-40% improvements. We also present solid results of onboard tests on
real-world exploration data from the DARPA Subterranean Challenge, which
strongly validate the feasibility of AirDet in robotics. To the best of our
knowledge, AirDet is the first feasible few-shot detection method for
autonomous exploration of low-power robots. The code and pre-trained models are
released at https://github.com/Jaraxxus-Me/AirDet.
","[{'version': 'v1', 'created': 'Fri, 3 Dec 2021 06:41:07 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Mar 2022 02:43:56 GMT'}, {'version': 'v3', 'created': 'Sat, 23 Jul 2022 13:32:32 GMT'}]",2022-11-15,"[['Li', 'Bowen', ''], ['Wang', 'Chen', ''], ['Reddy', 'Pranay', ''], ['Kim', 'Seungchan', ''], ['Scherer', 'Sebastian', '']]","['Few-shot object detection', 'Online', 'Robot exploration']"
10319,1907.05525,Yingjun Guan,"Yingjun Guan, Jing Du, Vetle I. Torvik",Geographical Distribution of Biomedical Research in the USA and China,,,10.1145/3127526.3127534,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze nearly 20 million geocoded PubMed articles with author
affiliations. Using K-means clustering for the lower 48 US states and mainland
China, we find that the average published paper is within a relatively short
distance of a few centroids. These centroids have shifted very little over the
past 30 years, and the distribution of distances to these centroids has not
changed much either. The overall country centroids have gradually shifted south
(about 0.2{\deg} for the USA and 1.7{\deg} for China), while the longitude has
not moved significantly. These findings indicate that there are few large
scientific hubs in the USA and China and the typical investigator is within
geographical reach of one such hub. This sets the stage to study centralization
of biomedical research at national and regional levels across the globe, and
over time.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2019 23:56:36 GMT'}]",2019-07-15,"[['Guan', 'Yingjun', ''], ['Du', 'Jing', ''], ['Torvik', 'Vetle I.', '']]","['Geocoding', 'author affiliation', 'bibliographic databases', 'clustering']"
10320,2002.07491,Romain Jacob,"Romain Jacob, Licong Zhang, Marco Zimmerling, Jan Beutel, Samarjit
  Chakraborty, Lothar Thiele",The Time-Triggered Wireless Architecture,Accepted at ECRTS 2020,,10.4230/LIPIcs.ECRTS.2020.19,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  Wirelessly interconnected sensors, actuators, and controllers promise greater
flexibility, lower installation and maintenance costs, and higher robustness in
harsh conditions than wired solutions. However, to facilitate the adoption of
wireless communication in cyber-physical systems (CPS), the functional and
non-functional properties must be similar to those known from wired
architectures. We thus present Time-Triggered Wireless (TTW), a wireless
architecture for multi-mode CPS that offers reliable communication with
guarantees on end-to-end delays among distributed applications executing on
low-cost, low-power embedded devices. We achieve this by exploiting the high
reliability and deterministic behavior of a synchronous transmission based
communication stack we design, and by coupling the timings of distributed task
executions and message exchanges across the wireless network by solving a novel
co-scheduling problem. While some of the concepts in TTW have existed for some
time and TTW has already been successfully applied for feedback control and
coordination of multiple mechanical systems with closed-loop stability
guarantees, this paper presents the key algorithmic, scheduling, and networking
mechanisms behind TTW, along with their experimental evaluation, which have not
been known so far. TTW is open source and ready to use: ttw.ethz.ch
","[{'version': 'v1', 'created': 'Tue, 18 Feb 2020 11:17:26 GMT'}, {'version': 'v2', 'created': 'Wed, 20 May 2020 08:51:28 GMT'}]",2020-05-21,"[['Jacob', 'Romain', ''], ['Zhang', 'Licong', ''], ['Zimmerling', 'Marco', ''], ['Beutel', 'Jan', ''], ['Chakraborty', 'Samarjit', ''], ['Thiele', 'Lothar', '']]","['Time-triggered architecture', 'wireless bus', 'synchronous transmissions']"
10321,2107.12532,Matthew Guzdial,"Kynan Sorochan, Jerry Chen, Yakun Yu, and Matthew Guzdial",Generating Lode Runner Levels by Learning Player Paths with LSTMs,"7 pages, 6 figures, Workshop on Procedural Content Generation","Proceedings of the Twelfth Workshop on Procedural Content
  Generation 2021",10.1145/3472538.3472602,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning has been a popular tool in many different fields, including
procedural content generation. However, procedural content generation via
machine learning (PCGML) approaches can struggle with controllability and
coherence. In this paper, we attempt to address these problems by learning to
generate human-like paths, and then generating levels based on these paths. We
extract player path data from gameplay video, train an LSTM to generate new
paths based on this data, and then generate game levels based on this path
data. We demonstrate that our approach leads to more coherent levels for the
game Lode Runner in comparison to an existing PCGML approach.
","[{'version': 'v1', 'created': 'Tue, 27 Jul 2021 00:48:30 GMT'}]",2021-07-28,"[['Sorochan', 'Kynan', ''], ['Chen', 'Jerry', ''], ['Yu', 'Yakun', ''], ['Guzdial', 'Matthew', '']]","['datasets', 'neural networks', 'path learning', 'path detection']"
10322,2202.13556,Kun Zhou,"Kun Zhou, Hui Yu, Wayne Xin Zhao and Ji-Rong Wen",Filter-enhanced MLP is All You Need for Sequential Recommendation,"12 pages, Accepted by WWW 2022",,10.1145/3485447.3512111,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, deep neural networks such as RNN, CNN and Transformer have been
applied in the task of sequential recommendation, which aims to capture the
dynamic preference characteristics from logged user behavior data for accurate
recommendation. However, in online platforms, logged user behavior data is
inevitable to contain noise, and deep recommendation models are easy to overfit
on these logged data. To tackle this problem, we borrow the idea of filtering
algorithms from signal processing that attenuates the noise in the frequency
domain. In our empirical experiments, we find that filtering algorithms can
substantially improve representative sequential recommendation models, and
integrating simple filtering algorithms (eg Band-Stop Filter) with an all-MLP
architecture can even outperform competitive Transformer-based models.
Motivated by it, we propose \textbf{FMLP-Rec}, an all-MLP model with learnable
filters for sequential recommendation task. The all-MLP architecture endows our
model with lower time complexity, and the learnable filters can adaptively
attenuate the noise information in the frequency domain. Extensive experiments
conducted on eight real-world datasets demonstrate the superiority of our
proposed method over competitive RNN, CNN, GNN and Transformer-based methods.
Our code and data are publicly available at the link:
\textcolor{blue}{\url{https://github.com/RUCAIBox/FMLP-Rec}}.
","[{'version': 'v1', 'created': 'Mon, 28 Feb 2022 05:49:35 GMT'}]",2022-03-01,"[['Zhou', 'Kun', ''], ['Yu', 'Hui', ''], ['Zhao', 'Wayne Xin', ''], ['Wen', 'Ji-Rong', '']]","['Sequential Recommendation', 'All-MLP Model', 'Filtering Algorithm']"
10323,2010.13585,Reza Marzban,"Reza Marzban, Christopher John Crick",Interpreting convolutional networks trained on textual data,"9 pages, 6 figures, 5 tables",,10.5220/0010205901960203,,cs.CL cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There have been many advances in the artificial intelligence field due to the
emergence of deep learning. In almost all sub-fields, artificial neural
networks have reached or exceeded human-level performance. However, most of the
models are not interpretable. As a result, it is hard to trust their decisions,
especially in life and death scenarios. In recent years, there has been a
movement toward creating explainable artificial intelligence, but most work to
date has concentrated on image processing models, as it is easier for humans to
perceive visual patterns. There has been little work in other fields like
natural language processing. In this paper, we train a convolutional model on
textual data and analyze the global logic of the model by studying its filter
values. In the end, we find the most important words in our corpus to our
models logic and remove the rest (95%). New models trained on just the 5% most
important words can achieve the same performance as the original model while
reducing training time by more than half. Approaches such as this will help us
to understand NLP models, explain their decisions according to their word
choices, and improve them by finding blind spots and biases.
","[{'version': 'v1', 'created': 'Tue, 20 Oct 2020 20:12:05 GMT'}]",2021-03-19,"[['Marzban', 'Reza', ''], ['Crick', 'Christopher John', '']]","['Explainable Artificial Intelligence', 'Natural Language Processing', 'Deep Learning', 'Artificial Neural Networks', 'Convolutional Networks']"
10324,2006.10831,Vlad Coroama PhD,"Vlad C. Coroam\u{a}, Pernilla Bergmark, Mattias H\""ojer, Jens Malmodin","A Methodology for Assessing the Environmental Effects Induced by ICT
  Services. Part I: Single Services","10 pages, 4 figures, The 7th International Conference on ICT for
  Sustainability (ICT4S 2020)",,10.1145/3401335.3401716,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information and communication technologies (ICT) are increasingly seen as key
enablers for climate change mitigation measures. They can make existing
products and activities more efficient or substitute them altogether.
Consequently, different initiatives have started to estimate the environmental
effects of ICT services. Such assessments, however, lack scientific rigor and
often rely on crude assumptions and methods, leading to inaccurate or even
misleading results. The few methodological attempts that exist do not address
several crucial aspects, and are thus insufficient to foster good as-sessment
practice. Starting from such a high level standard from the European
Telecommunication Standardisation Institute (ETSI) and the International
Telecommunication Union (ITU), this article identifies the shortcomings of
existing methodologies and proposes solutions. It addresses several aspects for
the assessment of single ICT services: the goal and scope definition (analyzing
differences between ICT substitution and optimization, the time perspective of
the assessment, the challenge of a hypothetical baseline for the situation
without the ICT solution, and the differences between modelling and case
studies) as well as the often ignored influence of rebound effects and the
difficult extrapolation from case studies to larger populations.
","[{'version': 'v1', 'created': 'Thu, 18 Jun 2020 19:55:23 GMT'}]",2020-06-22,"[['Coroamă', 'Vlad C.', ''], ['Bergmark', 'Pernilla', ''], ['Höjer', 'Mattias', ''], ['Malmodin', 'Jens', '']]","['Induced effect', 'enabling effect', 'enablement', 'abatement', 'avoided emissions', 'digital services', 'digitization']"
10325,2103.11388,Antonios Liapis,Konstantinos Sfikas and Antonios Liapis,Collaborative Agent Gameplay in the Pandemic Board Game,11 pages,"Proceedings of the Foundations of Digital Games Conference, 2020",10.1145/3402942.3402943,,cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While artificial intelligence has been applied to control players' decisions
in board games for over half a century, little attention is given to games with
no player competition. Pandemic is an exemplar collaborative board game where
all players coordinate to overcome challenges posed by events occurring during
the game's progression. This paper proposes an artificial agent which controls
all players' actions and balances chances of winning versus risk of losing in
this highly stochastic environment. The agent applies a Rolling Horizon
Evolutionary Algorithm on an abstraction of the game-state that lowers the
branching factor and simulates the game's stochasticity. Results show that the
proposed algorithm can find winning strategies more consistently in different
games of varying difficulty. The impact of a number of state evaluation metrics
is explored, balancing between optimistic strategies that favor winning and
pessimistic strategies that guard against losing.
","[{'version': 'v1', 'created': 'Sun, 21 Mar 2021 13:18:20 GMT'}]",2021-03-23,"[['Sfikas', 'Konstantinos', ''], ['Liapis', 'Antonios', '']]","['Agent control', 'rolling horizon evolutionary algorithm', 'forwardmodel', 'collaborative board games', 'Pandemic']"
10326,2008.10733,Chandra Thapa,Chandra Thapa and Seyit Camtepe,"Precision Health Data: Requirements, Challenges and Existing Techniques
  for Data Security and Privacy","35 pages, 3 figures, 7 tables",Computers in Biology and Medicine 129 (2021) 104130,10.1016/j.compbiomed.2020.104130,,cs.CR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Precision health leverages information from various sources, including omics,
lifestyle, environment, social media, medical records, and medical insurance
claims to enable personalized care, prevent and predict illness, and precise
treatments. It extensively uses sensing technologies (e.g., electronic health
monitoring devices), computations (e.g., machine learning), and communication
(e.g., interaction between the health data centers). As health data contain
sensitive private information, including the identity of patient and carer and
medical conditions of the patient, proper care is required at all times.
Leakage of these private information affects the personal life, including
bullying, high insurance premium, and loss of job due to the medical history.
Thus, the security, privacy of and trust on the information are of utmost
importance. Moreover, government legislation and ethics committees demand the
security and privacy of healthcare data. Herein, in the light of precision
health data security, privacy, ethical and regulatory requirements, finding the
best methods and techniques for the utilization of the health data, and thus
precision health is essential. In this regard, firstly, this paper explores the
regulations, ethical guidelines around the world, and domain-specific needs.
Then it presents the requirements and investigates the associated challenges.
Secondly, this paper investigates secure and privacy-preserving machine
learning methods suitable for the computation of precision health data along
with their usage in relevant health projects. Finally, it illustrates the best
available techniques for precision health data security and privacy with a
conceptual system model that enables compliance, ethics clearance, consent
management, medical innovations, and developments in the health domain.
","[{'version': 'v1', 'created': 'Mon, 24 Aug 2020 22:17:32 GMT'}]",2022-02-18,"[['Thapa', 'Chandra', ''], ['Camtepe', 'Seyit', '']]","['Precision health', 'legal requirements', 'ethical guidelines', 'security', 'privacy', 'artificial intelligence']"
10327,1709.10255,Victor Rivera,"Kizilov Mikhail, Antonio Bucchiarone, Manuel Mazzara, Larisa Safina,
  Victor Rivera",Domain Objects and Microservices for Systems Development: a roadmap,,"Advances in Intelligent Systems and Computing, 2018",10.1007/978-3-319-70578-1_10,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses a roadmap to investigate Domain Objects being an
adequate formalism to capture the peculiarity of microservice architecture, and
to support Software development since the early stages. It provides a survey of
both Microservices and Domain Objects, and it discusses plans and reflections
on how to investigate whether a modeling approach suited to adaptable
service-based components can also be applied with success to the microservice
scenario.
","[{'version': 'v1', 'created': 'Fri, 29 Sep 2017 07:04:08 GMT'}]",2019-04-22,"[['Mikhail', 'Kizilov', ''], ['Bucchiarone', 'Antonio', ''], ['Mazzara', 'Manuel', ''], ['Safina', 'Larisa', ''], ['Rivera', 'Victor', '']]","['Microservices', 'Domain Objects', 'Software Modeling']"
10328,2107.01616,Stephen MacDonell,"Michael Franklin Bosu, Stephen G. MacDonell and Peter A. Whigham","Analyzing the Stationarity Process in Software Effort Estimation
  Datasets","Journal paper, 16 pages, 3 tables, 12 figures. arXiv admin note:
  substantial text overlap with arXiv:2012.08692","International Journal of Software Engineering and Knowledge
  Engineering30(11&12)(2020). pp.1607-1640",10.1142/S0218194020400239,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software effort estimation models are typically developed based on an
underlying assumption that all data points are equally relevant to the
prediction of effort for future projects. The dynamic nature of several aspects
of the software engineering process could mean that this assumption does not
hold in at least some cases. This study employs three kernel estimator
functions to test the stationarity assumption in five software engineering
datasets that have been used in the construction of software effort estimation
models. The kernel estimators are used in the generation of nonuniform weights
which are subsequently employed in weighted linear regression modeling. In each
model, older projects are assigned smaller weights while the more recently
completed projects are assigned larger weights, to reflect their potentially
greater relevance to present or future projects that need to be estimated.
Prediction errors are compared to those obtained from uniform models. Our
results indicate that, for the datasets that exhibit underlying nonstationary
processes, uniform models are more accurate than the nonuniform models; that
is, models based on kernel estimator functions are worse than the models where
no weighting was applied. In contrast, the accuracies of uniform and nonuniform
models for datasets that exhibited stationary processes were essentially
equivalent. Our analysis indicates that as the heterogeneity of a dataset
increases, the effect of stationarity is overridden. The results of our study
also confirm prior findings that the accuracy of effort estimation models is
independent of the type of kernel estimator function used in model development.
","[{'version': 'v1', 'created': 'Sun, 4 Jul 2021 13:12:57 GMT'}]",2021-07-06,"[['Bosu', 'Michael Franklin', ''], ['MacDonell', 'Stephen G.', ''], ['Whigham', 'Peter A.', '']]","['Software effort estimation', 'software processes', 'stationarity', 'kernel estimators', 'weighted linear regression']"
10329,2201.02260,Fabio Miranda,Maryam Hosseini and Fabio Miranda and Jianzhe Lin and Claudio Silva,CitySurfaces: City-Scale Semantic Segmentation of Sidewalk Materials,"Sustainable Cities and Society journal (accepted); Model:
  https://github.com/VIDA-NYU/city-surfaces",,10.1016/j.scs.2021.103630,,cs.CV cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  While designing sustainable and resilient urban built environment is
increasingly promoted around the world, significant data gaps have made
research on pressing sustainability issues challenging to carry out. Pavements
are known to have strong economic and environmental impacts; however, most
cities lack a spatial catalog of their surfaces due to the cost-prohibitive and
time-consuming nature of data collection. Recent advancements in computer
vision, together with the availability of street-level images, provide new
opportunities for cities to extract large-scale built environment data with
lower implementation costs and higher accuracy. In this paper, we propose
CitySurfaces, an active learning-based framework that leverages computer vision
techniques for classifying sidewalk materials using widely available
street-level images. We trained the framework on images from New York City and
Boston and the evaluation results show a 90.5% mIoU score. Furthermore, we
evaluated the framework using images from six different cities, demonstrating
that it can be applied to regions with distinct urban fabrics, even outside the
domain of the training data. CitySurfaces can provide researchers and city
agencies with a low-cost, accurate, and extensible method to collect sidewalk
material data which plays a critical role in addressing major sustainability
issues, including climate change and surface water management.
","[{'version': 'v1', 'created': 'Thu, 6 Jan 2022 21:58:37 GMT'}]",2022-01-10,"[['Hosseini', 'Maryam', ''], ['Miranda', 'Fabio', ''], ['Lin', 'Jianzhe', ''], ['Silva', 'Claudio', '']]","['Sustainable built environment', 'Surface materials', 'Urban heat island', 'Semantic segmentation', 'Sidewalkassessment', 'Urban analytics', 'Computervision']"
10330,1807.08289,Daniel Roche,Daniel S. Roche,What Can (and Can't) we Do with Sparse Polynomials?,"Tutorial at ISSAC 2018, Pages 25-30 of proceedings, In Proc. 43rd
  International Symposium on Symbolic and Algebraic Computation, ISSAC '18.
  ACM, New York, NY, 2018",,10.1145/3208976.3209027,,cs.SC,http://creativecommons.org/publicdomain/zero/1.0/,"  Simply put, a sparse polynomial is one whose zero coefficients are not
explicitly stored. Such objects are ubiquitous in exact computing, and so
naturally we would like to have efficient algorithms to handle them. However,
with this compact storage comes new algorithmic challenges, as fast algorithms
for dense polynomials may no longer be efficient. In this tutorial we examine
the state of the art for sparse polynomial algorithms in three areas:
arithmetic, interpolation, and factorization. The aim is to highlight recent
progress both in theory and in practice, as well as opportunities for future
work.
","[{'version': 'v1', 'created': 'Sun, 22 Jul 2018 14:40:34 GMT'}]",2018-07-24,"[['Roche', 'Daniel S.', '']]","['sparse polynomial', 'interpolation', 'arithmetic', 'factorization']"
10331,2204.09828,Luca Grillotti,Luca Grillotti and Antoine Cully,"Relevance-guided Unsupervised Discovery of Abilities with
  Quality-Diversity Algorithms",Accepted at GECCO 2022,,10.1145/3512290.3528837,,cs.NE cs.AI cs.LG cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Quality-Diversity algorithms provide efficient mechanisms to generate large
collections of diverse and high-performing solutions, which have shown to be
instrumental for solving downstream tasks. However, most of those algorithms
rely on a behavioural descriptor to characterise the diversity that is
hand-coded, hence requiring prior knowledge about the considered tasks. In this
work, we introduce Relevance-guided Unsupervised Discovery of Abilities; a
Quality-Diversity algorithm that autonomously finds a behavioural
characterisation tailored to the task at hand. In particular, our method
introduces a custom diversity metric that leads to higher densities of
solutions near the areas of interest in the learnt behavioural descriptor
space. We evaluate our approach on a simulated robotic environment, where the
robot has to autonomously discover its abilities based on its full sensory
data. We evaluated the algorithms on three tasks: navigation to random targets,
moving forward with a high velocity, and performing half-rolls. The
experimental results show that our method manages to discover collections of
solutions that are not only diverse, but also well-adapted to the considered
downstream task.
","[{'version': 'v1', 'created': 'Thu, 21 Apr 2022 00:29:38 GMT'}]",2022-04-22,"[['Grillotti', 'Luca', ''], ['Cully', 'Antoine', '']]","['Quality-Diversity Optimisation', 'Unsupervised Learning', 'Robotics']"
10332,1905.06138,"Jarkko Peltom\""aki","Jarkko Peltom\""aki",Abelian periods of factors of Sturmian words,"27 pages, 3 figures","Journal of Number Theory, Vol. 214, 251-285 (2020)",10.1016/j.jnt.2020.04.007,,cs.FL math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the abelian period sets of Sturmian words, which are codings of
irrational rotations on a one-dimensional torus. The main result states that
the minimum abelian period of a factor of a Sturmian word of angle $\alpha$
with continued fraction expansion $[0; a_1, a_2, \ldots]$ is either $tq_k$ with
$1 \leq t \leq a_{k+1}$ (a multiple of a denominator $q_k$ of a convergent of
$\alpha$) or $q_{k,\ell}$ (a denominator $q_{k,\ell}$ of a semiconvergent of
$\alpha$). This result generalizes a result of Fici et. al stating that the
abelian period set of the Fibonacci word is the set of Fibonacci numbers. A
characterization of the Fibonacci word in terms of its abelian period set is
obtained as a corollary.
","[{'version': 'v1', 'created': 'Wed, 15 May 2019 12:33:32 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Jan 2020 12:16:32 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Apr 2020 10:53:55 GMT'}]",2020-07-27,"[['Peltomäki', 'Jarkko', '']]","['Sturmian word', 'continued fraction', 'abelian equivalence', 'abelian period', 'singular word']"
10333,2110.14863,Bolian Li,"Bolian Li, Baoyu Jing and Hanghang Tong",Graph Communal Contrastive Learning,Proceedings of The Web Conference 2022,,10.1145/3485447.3512208,,cs.SI cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Graph representation learning is crucial for many real-world applications
(e.g. social relation analysis). A fundamental problem for graph representation
learning is how to effectively learn representations without human labeling,
which is usually costly and time-consuming. Graph contrastive learning (GCL)
addresses this problem by pulling the positive node pairs (or similar nodes)
closer while pushing the negative node pairs (or dissimilar nodes) apart in the
representation space. Despite the success of the existing GCL methods, they
primarily sample node pairs based on the node-level proximity yet the community
structures have rarely been taken into consideration. As a result, two nodes
from the same community might be sampled as a negative pair. We argue that the
community information should be considered to identify node pairs in the same
communities, where the nodes insides are semantically similar. To address this
issue, we propose a novel Graph Communal Contrastive Learning (gCooL) framework
to jointly learn the community partition and learn node representations in an
end-to-end fashion. Specifically, the proposed gCooL consists of two
components: a Dense Community Aggregation (DeCA) algorithm for community
detection and a Reweighted Self-supervised Cross-contrastive (ReSC) training
scheme to utilize the community information. Additionally, the real-world
graphs are complex and often consist of multiple views. In this paper, we
demonstrate that the proposed gCooL can also be naturally adapted to multiplex
graphs. Finally, we comprehensively evaluate the proposed gCooL on a variety of
real-world graphs. The experimental results show that the gCooL outperforms the
state-of-the-art methods.
","[{'version': 'v1', 'created': 'Thu, 28 Oct 2021 02:57:54 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Feb 2022 14:05:53 GMT'}]",2022-02-15,"[['Li', 'Bolian', ''], ['Jing', 'Baoyu', ''], ['Tong', 'Hanghang', '']]","['self-supervised learning', 'graph contrastive learning', 'communitydetection']"
10334,2203.13525,Nicolo Pollini,Nicol\`o Pollini,Topology optimization of wind farm layouts,,,10.1016/j.renene.2022.06.019,,cs.CE math.OC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A novel approach for the solution of the wind farm layout optimization
problem is presented. The annual energy production is maximized with
constraints on the minimum and maximum number of wind turbines placed, and on
the minimum spacing between the wind turbines. The proposed approach relies on
a density-based topology optimization method, where continuous density
variables varying between zero and one are assigned to each potential wind
turbine location. A wind turbine exists if its associated variable equals one,
otherwise it does not exist if the associated variable is zero. Intermediate
values of the density variables are penalized with interpolation schemes
traditionally used in the context of multi-material structural topology
optimization. The penalized intermediate values of the design variables become
uneconomical and the optimization algorithm is implicitly pushed towards a
preference of crisp 0-1 final values. The optimization problem is solved with a
gradient-based algorithm based on first-order information. Because of the
proposed problem formulation, the functions involved are formulated explicitly
in terms of the design variables and their analytical gradients can be
calculated directly. The numerical results highlight the capability of the
proposed approach in finding far from intuitive wind farm layouts with small
computational resources and time.
","[{'version': 'v1', 'created': 'Fri, 25 Mar 2022 09:22:27 GMT'}]",2022-06-20,"[['Pollini', 'Nicolò', '']]","['topology optimization', 'wind farm', 'layout optimization', 'interpolation scheme']"
10335,2105.14500,Boxiang Wang,"Boxiang Wang, Qifan Xu, Zhengda Bian, Yang You",Tesseract: Parallelize the Tensor Parallelism Efficiently,,,10.1145/3545008.3545087,,cs.DC cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Together with the improvements in state-of-the-art accuracies of various
tasks, deep learning models are getting significantly larger. However, it is
extremely difficult to implement these large models because limited GPU memory
makes it impossible to fit large models into a single GPU or even a GPU server.
Besides, it is highly necessary to reduce the training time for large models.
Previous methods like Megatron-LM implemented a 1-Dimensional distributed
method to use GPUs to speed up the training. However, these methods have a high
communication overhead and a low scaling efficiency on large-scale clusters. To
solve these problems, we propose Tesseract, a highly scalable tensor
parallelism with a novel design. It increases efficiency by reducing
communication overhead and lowers the memory required for each GPU. By
introducing the novel dimension into tensor parallelism, Tesseract greatly
increases the memory capacity of tensor parallelism. Concretely, this new
dimension furthermore increases the degree of tensor parallelism. Compared to
previous 1-D and 2-D methods, Tesseract manages to reduce the communication
cost on each layer, resulting in speedups of 1.38x and 1.53x respectively with
strong scaling. In weak scaling experiments, Tesseract achieves a maximum of
4.0/1.7 times inference speedup and 3.4/1.7 times throughput improvement
compared to 1-D/2-D methods, respectively. By introducing Tesseract, we offer a
more efficient and scalable way to implement large deep learning models with
limited GPU resources.
","[{'version': 'v1', 'created': 'Sun, 30 May 2021 11:06:49 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Sep 2022 04:49:37 GMT'}]",2022-09-02,"[['Wang', 'Boxiang', ''], ['Xu', 'Qifan', ''], ['Bian', 'Zhengda', ''], ['You', 'Yang', '']]","['Parallelism', 'Machine Learning', 'MLsys']"
10336,2002.10231,Matthew R Kuhn,"Matthew R. Kuhn, Kiichi Suzuki, Ali Daouadji","Linear-frictional contact model for 3D discrete element simulations of
  granular systems",6 figures,"Int J Numer Methods Eng. 2020, 121(3), 560-569",10.1002/nme.6216,,cs.CE cond-mat.soft,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The linear-frictional contact model is the most commonly used contact
mechanism for discrete element (DEM) simulations of granular materials. Linear
springs with a frictional slider are used for modeling interactions in
directions normal and tangential to the contact surface. Although the model is
simple in two dimensions, its implementation in 3D faces certain subtle
challenges, and the particle interactions that occur within a single time-step
require careful modeling with a robust algorithm. The paper details a 3D
algorithm that accounts for the changing direction of the tangential force
within a time-step, the transition from elastic to slip behavior within a
time-step, possible contact sliding during only part of a time-step, and
twirling and rotation of the tangential force during a time-step. Without three
of these adjustments, errors are introduced in the incremental stiffness of an
assembly. Without the fourth adjustment, the resulting stress tensor is not
only incorrect, it is no longer a tensor. The algorithm also computes the work
increments during a time-step, both elastic and dissipative.
","[{'version': 'v1', 'created': 'Thu, 9 Jan 2020 00:09:53 GMT'}]",2020-02-25,"[['Kuhn', 'Matthew R.', ''], ['Suzuki', 'Kiichi', ''], ['Daouadji', 'Ali', '']]","['friction', 'granular material', 'tangential force', 'algorithm']"
10337,2103.03827,Mathieu Labb\'e,Mathieu Labb\'e and Fran\c{c}ois Michaud,"Multi-Session Visual SLAM for Illumination Invariant Re-Localization in
  Indoor Environments","20 pages, 7 figures","M. Labb\'e and F. Michaud, Multi-Session Visual SLAM for
  Illumination-Invariant Re-Localization in Indoor Environments, in Frontiers
  in Robotics and AI, vol. 9, 2022",10.3389/frobt.2022.801886,,cs.RO cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For robots navigating using only a camera, illumination changes in indoor
environments can cause re-localization failures during autonomous navigation.
In this paper, we present a multi-session visual SLAM approach to create a map
made of multiple variations of the same locations in different illumination
conditions. The multi-session map can then be used at any hour of the day for
improved re-localization capability. The approach presented is independent of
the visual features used, and this is demonstrated by comparing re-localization
performance between multi-session maps created using the RTAB-Map library with
SURF, SIFT, BRIEF, BRISK, KAZE, DAISY and SuperPoint visual features. The
approach is tested on six mapping and six localization sessions recorded at 30
minute intervals during sunset using a Google Tango phone in a real apartment.
","[{'version': 'v1', 'created': 'Fri, 5 Mar 2021 17:41:27 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jun 2022 15:32:16 GMT'}]",2022-06-30,"[['Labbé', 'Mathieu', ''], ['Michaud', 'François', '']]","['Localization', 'Visual SLAM', 'Feature Matching', 'Mobile Robotics']"
10338,2206.05457,Quang-Hung Luu,"Quang-Hung Luu, Huai Liu, Tsong Yueh Chen and Hai L. Vu",Testing Ocean Software with Metamorphic Testing,"7 pages, 3 tables",,10.1145/3524846.3527341,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Advancing ocean science has a significant impact to the development of the
world, from operating a safe navigation for vessels to maintaining a healthy
and diverse ocean ecosystem. Various ocean software systems have been
extensively adopted for different purposes, for instance, predicting hourly sea
level elevation across shorelines, simulating large-scale ocean circulations,
as well as integrating into Earth system models for weather forecasts and
climate projections. Regardless of their significance, guaranteeing the
trustworthiness of ocean software and modelling systems is a long-standing
challenge. The testing of ocean software suffers a lot from the so-called
oracle problem, which refers to the absence of test oracles mainly due to the
nonlinear interactions of multiple physical variables and the high complexity
in computation. In the ocean, observed tidal signals are distorted by
non-deterministic physical variables, hindering us from knowing the ""true""
astronomical tidal constituents existing in the timeseries. In this paper, we
present how to test tidal analysis and prediction (TAP) software based on
metamorphic testing (MT), a simple yet effective testing approach to the oracle
problem. In particular, we construct metamorphic relations from the periodic
property of astronomical tide, and then use them to successfully detect a
real-life defect in an open-source TAP software. We also conduct a series of
experiments to further demonstrate the applicability and effectiveness of MT in
the testing of TAP software. Our study not only justifies the potential of MT
in testing more complex ocean software and modelling systems, but also can be
expanded to assess and improve the quality of a broader range of scientific
simulation software systems.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2022 08:06:11 GMT'}]",2022-06-14,"[['Luu', 'Quang-Hung', ''], ['Liu', 'Huai', ''], ['Chen', 'Tsong Yueh', ''], ['Vu', 'Hai L.', '']]","['Metamorphic testing', 'metamorphic relation', 'ocean software', 'scientific simulation', 'tidal analysis and prediction']"
10339,2202.08409,Aiden Bai,Aiden Bai,Million.js: A Fast Compiler-Augmented Virtual DOM for the Web,"8 pages, 12 figures. Accepted to ACM SAC",,10.1145/3555776.3577683,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Interactive web applications created with declarative JavaScript User
Interface (UI) libraries have increasingly dominated the modern internet.
However, existing libraries are primarily made for run-time execution, and rely
on the user to load and render web applications. This led us to create
Million.js, a fast compiler-augmented virtual Document Object Model (DOM) for
the web. Million.js reduces load time and time-to-interactive by creating a
compiler to compute interactive regions of a web application before the user
visits the page. The virtual DOM run-time optimizes interactive content through
compiler flags, compute batching, scheduling, and reactive data primitives to
achieve optimal performance. When benchmarked against the most popular virtual
DOM libraries, Million.js resulted in 133% to 300% faster rendering and 2347\%
faster load. In a real-world web application with both comparative benchmarks
and an informal user study, Million.js loaded 35.11% faster after migrating
from React. The findings show that web applications have the potential to be
orders of magnitude faster through JavaScript UI libraries that use Million.js.
","[{'version': 'v1', 'created': 'Thu, 17 Feb 2022 02:17:42 GMT'}, {'version': 'v2', 'created': 'Wed, 31 Aug 2022 08:49:14 GMT'}, {'version': 'v3', 'created': 'Mon, 26 Sep 2022 01:54:32 GMT'}, {'version': 'v4', 'created': 'Sat, 22 Oct 2022 19:24:52 GMT'}, {'version': 'v5', 'created': 'Sun, 1 Jan 2023 09:11:30 GMT'}]",2023-01-04,"[['Bai', 'Aiden', '']]","['Web technologies', 'Web Frameworks', 'JavaScript', 'User interface (UI)', 'Virtual DOM', 'Compilers', 'Optimization']"
10340,2006.11403,Soroush Vosoughi Dr,"Lili Wang, Ruibo Liu, and Soroush Vosoughi","Salienteye: Maximizing Engagement While Maintaining Artistic Style on
  Instagram Using Deep Neural Networks","Proceedings of the 2020 International Conference on Multimedia
  Retrieval. 2020",,10.1145/3372278.3390736,,cs.CV cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Instagram has become a great venue for amateur and professional photographers
alike to showcase their work. It has, in other words, democratized photography.
Generally, photographers take thousands of photos in a session, from which they
pick a few to showcase their work on Instagram. Photographers trying to build a
reputation on Instagram have to strike a balance between maximizing their
followers' engagement with their photos, while also maintaining their artistic
style. We used transfer learning to adapt Xception, which is a model for object
recognition trained on the ImageNet dataset, to the task of engagement
prediction and utilized Gram matrices generated from VGG19, another object
recognition model trained on ImageNet, for the task of style similarity
measurement on photos posted on Instagram. Our models can be trained on
individual Instagram accounts to create personalized engagement prediction and
style similarity models. Once trained on their accounts, users can have new
photos sorted based on predicted engagement and style similarity to their
previous work, thus enabling them to upload photos that not only have the
potential to maximize engagement from their followers but also maintain their
style of photography. We trained and validated our models on several Instagram
accounts, showing it to be adept at both tasks, also outperforming several
baseline models and human annotators.
","[{'version': 'v1', 'created': 'Sat, 13 Jun 2020 01:58:02 GMT'}]",2020-06-23,"[['Wang', 'Lili', ''], ['Liu', 'Ruibo', ''], ['Vosoughi', 'Soroush', '']]","['Personalization', 'Engagement Prediction', 'Style Analysis', 'Instagram', 'Photography', 'Deep Learning', 'Convolutional Neural Networks']"
10341,2001.04232,Takeshi Terui,"Takeshi Terui, Yasuyuki Minamiyama, Kazutsuna Yamaji","Possibility and prevention of inappropriate data manipulation in Polar
  Data Journal","5 pages, 1 figure, 1 table","2019 8th International Congress on Advanced Applied Informatics
  (IIAI-AAI)",10.1109/IIAI-AAI.2019.00087,,cs.CR cs.DL cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  Stakeholders in the scientific field must always maintain transparency in the
process of publishing research results in journals. Unfortunately, although
research misconduct has stopped, certain forms of manipulation continue to
appear in other forms. As new techniques of scientific publishing develop,
science stakeholders need to examine the possibility of inappropriate activity
in these new platforms. The National Institute of Polar Research in Japan
launched a new data journal Polar Data Journal (PDJ) in 2017 to review the
quality of data obtained in the polar region. To maintain transparency in this
new data journal, we investigated the possibility of inappropriate data
manipulation in peer reviews before the inception of this journal. We clarified
inappropriate activity for the data in the peer review and considered
preventive measures. We designed a specific workflow for PDJ. This included two
measures: (i) the comparison of hash values in the review process and (ii) open
peer review report publishing. Using the hash value comparison, we detected two
instances of inappropriate data manipulation after the start of the journal.
This research will help improve workflow in data journals and data
repositories.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2020 13:29:34 GMT'}]",2020-01-22,"[['Terui', 'Takeshi', ''], ['Minamiyama', 'Yasuyuki', ''], ['Yamaji', 'Kazutsuna', '']]","['Fraud Prevention', 'Hash Value', 'Peer Review Report']"
10342,2111.00926,Zongtao Liu,"Zongtao Liu, Bin Ma, Quan Liu, Jian Xu, Bo Zheng",Heterogeneous Graph Neural Networks for Large-Scale Bid Keyword Matching,10 pages,,10.1145/3459637.3481926,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Digital advertising is a critical part of many e-commerce platforms such as
Taobao and Amazon. While in recent years a lot of attention has been drawn to
the consumer side including canonical problems like ctr/cvr prediction, the
advertiser side, which directly serves advertisers by providing them with
marketing tools, is now playing a more and more important role. When speaking
of sponsored search, bid keyword recommendation is the fundamental service.
This paper addresses the problem of keyword matching, the primary step of
keyword recommendation. Existing methods for keyword matching merely consider
modeling relevance based on a single type of relation among ads and keywords,
such as query clicks or text similarity, which neglects rich heterogeneous
interactions hidden behind them. To fill this gap, the keyword matching problem
faces several challenges including: 1) how to learn enriched and robust
embeddings from complex interactions among various types of objects; 2) how to
conduct high-quality matching for new ads that usually lack sufficient data.
  To address these challenges, we develop a
heterogeneous-graph-neural-network-based model for keyword matching named
HetMatch, which has been deployed both online and offline at the core sponsored
search platform of Alibaba Group. To extract enriched and robust embeddings
among rich relations, we design a hierarchical structure to fuse and enhance
the relevant neighborhood patterns both on the micro and the macro level.
Moreover, by proposing a multi-view framework, the model is able to involve
more positive samples for cold-start ads. Experimental results on a large-scale
industrial dataset as well as online AB tests exhibit the effectiveness of
HetMatch.
","[{'version': 'v1', 'created': 'Mon, 1 Nov 2021 13:22:32 GMT'}]",2021-11-02,"[['Liu', 'Zongtao', ''], ['Ma', 'Bin', ''], ['Liu', 'Quan', ''], ['Xu', 'Jian', ''], ['Zheng', 'Bo', '']]","['online advertisement', 'keyword recommendation', 'graph neural networks']"
10343,2206.00960,Jianhong Han,"Jianhong Han, Zhaoyi Wan, Zhe Liu, Jie Feng, Bingfeng Zhou",SparseDet: Towards End-to-End 3D Object Detection,,"Proceedings of the 17th International Joint Conference on Computer
  Vision, Imaging and Computer Graphics Theory and Applications - Volume 4:
  VISAPP, pp. 781- 792. Feb. 6-8, 2022",10.5220/0010918000003124,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose SparseDet for end-to-end 3D object detection from
point cloud. Existing works on 3D object detection rely on dense object
candidates over all locations in a 3D or 2D grid following the mainstream
methods for object detection in 2D images. However, this dense paradigm
requires expertise in data to fulfill the gap between label and detection. As a
new detection paradigm, SparseDet maintains a fixed set of learnable proposals
to represent latent candidates and directly perform classification and
localization for 3D objects through stacked transformers. It demonstrates that
effective 3D object detection can be achieved with none of post-processing such
as redundant removal and non-maximum suppression. With a properly designed
network, SparseDet achieves highly competitive detection accuracy while running
with a more efficient speed of 34.5 FPS. We believe this end-to-end paradigm of
SparseDet will inspire new thinking on the sparsity of 3D object detection.
","[{'version': 'v1', 'created': 'Thu, 2 Jun 2022 09:49:53 GMT'}]",2022-06-03,"[['Han', 'Jianhong', ''], ['Wan', 'Zhaoyi', ''], ['Liu', 'Zhe', ''], ['Feng', 'Jie', ''], ['Zhou', 'Bingfeng', '']]","['3D Deep Learning', 'Object Detection', 'Point Clouds', 'Scene and Object Understanding']"
10344,2112.08033,Thi Hong Hanh Tran,"Tran Thi Hong Hanh, Antoine Doucet, Nicolas Sidere, Jose G. Moreno,
  and Senja Pollak","Named entity recognition architecture combining contextual and global
  features",,,10.1007/978-3-030-91669-5_21,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Named entity recognition (NER) is an information extraction technique that
aims to locate and classify named entities (e.g., organizations, locations,...)
within a document into predefined categories. Correctly identifying these
phrases plays a significant role in simplifying information access. However, it
remains a difficult task because named entities (NEs) have multiple forms and
they are context-dependent. While the context can be represented by contextual
features, global relations are often misrepresented by those models. In this
paper, we propose the combination of contextual features from XLNet and global
features from Graph Convolution Network (GCN) to enhance NER performance.
Experiments over a widely-used dataset, CoNLL 2003, show the benefits of our
strategy, with results competitive with the state of the art (SOTA).
","[{'version': 'v1', 'created': 'Wed, 15 Dec 2021 10:54:36 GMT'}]",2021-12-16,"[['Hanh', 'Tran Thi Hong', ''], ['Doucet', 'Antoine', ''], ['Sidere', 'Nicolas', ''], ['Moreno', 'Jose G.', ''], ['Pollak', 'Senja', '']]","['NER', 'XLNet', 'GCN', 'contextual embeddings', 'global embeddings']"
10345,2201.03746,Shunli Wang,"Shunli Wang, Dingkang Yang, Peng Zhai, Chixiao Chen, Lihua Zhang",TSA-Net: Tube Self-Attention Network for Action Quality Assessment,"9 pages, 7 figures, conference paper",,10.1145/3474085.3475438,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, assessing action quality from videos has attracted growing
attention in computer vision community and human computer interaction. Most
existing approaches usually tackle this problem by directly migrating the model
from action recognition tasks, which ignores the intrinsic differences within
the feature map such as foreground and background information. To address this
issue, we propose a Tube Self-Attention Network (TSA-Net) for action quality
assessment (AQA). Specifically, we introduce a single object tracker into AQA
and propose the Tube Self-Attention Module (TSA), which can efficiently
generate rich spatio-temporal contextual information by adopting sparse feature
interactions. The TSA module is embedded in existing video networks to form
TSA-Net. Overall, our TSA-Net is with the following merits: 1) High
computational efficiency, 2) High flexibility, and 3) The state-of-the art
performance. Extensive experiments are conducted on popular action quality
assessment datasets including AQA-7 and MTL-AQA. Besides, a dataset named Fall
Recognition in Figure Skating (FR-FS) is proposed to explore the basic action
assessment in the figure skating scene.
","[{'version': 'v1', 'created': 'Tue, 11 Jan 2022 02:25:27 GMT'}]",2022-01-12,"[['Wang', 'Shunli', ''], ['Yang', 'Dingkang', ''], ['Zhai', 'Peng', ''], ['Chen', 'Chixiao', ''], ['Zhang', 'Lihua', '']]","['Action Quality Assessment', 'Self-attention Mechanism', 'Video Action Analysis']"
10346,1411.0087,Kaoutar Ben Ahmed,"Kaoutar Ben Ahmed, Mohammed Bouhorma, Mohamed Ben Ahmed",Age of Big Data and Smart Cities: Privacy Trade-Off,"7 pages, 1 figure, ""Published with International Journal of
  Engineering Trends and Technology (IJETT)""","International Journal of Engineering Trends and Technology
  (IJETT), V16(6),298-304 Oct 2014. ISSN:2231-5381",10.14445/22315381/IJETT-V16P258,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Data will soon become one of the most precious treasures we have ever had, 43
trillion gigabytes of data will be created by 2020 according to a study made by
Mckinsey Global Institute, it is estimated that 2.3 trillion gigabytes of data
is created each day and most companies in the US have 100.000 gigabytes of data
stored. Data is recorded, stored and analyzed to enable technology and services
that the world relies on every day, this technology is getting smarter and we
will be soon living in a world of smart services or what is called smart
cities. This article presents an overview of the topic pointing to its actual
status and forecasting the crucial roles it will play in the future, we will
define big data analytics and smart cities and talk about their potential
contributions in changing our way of living and finally we will discuss the
possible down side of this upcoming technologies and how it can fool us,
violate our privacy and turn us into puppets or technology slaves.
","[{'version': 'v1', 'created': 'Sat, 1 Nov 2014 09:23:41 GMT'}]",2014-11-04,"[['Ahmed', 'Kaoutar Ben', ''], ['Bouhorma', 'Mohammed', ''], ['Ahmed', 'Mohamed Ben', '']]","['big data', 'smart cities', 'decision support systems', 'privacy']"
10347,2005.07473,Fabricio Murai,"B\'arbara Silveira, Henrique S. Silva, Fabricio Murai, Ana Paula Couto
  da Silva",Predicting User Emotional Tone in Mental Disorder Online Communities,"8 pages, 3 figures, 3 tables","Future Generation Computer Systems, Volume 125, 2021, Pages
  641-651, ISSN 0167-739X",10.1016/j.future.2021.07.014,,cs.LG cs.CL cs.SI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, Online Social Networks have become an important medium for
people who suffer from mental disorders to share moments of hardship, and
receive emotional and informational support. In this work, we analyze how
discussions in Reddit communities related to mental disorders can help improve
the health conditions of their users. Using the emotional tone of users'
writing as a proxy for emotional state, we uncover relationships between user
interactions and state changes. First, we observe that authors of negative
posts often write rosier comments after engaging in discussions, indicating
that users' emotional state can improve due to social support. Second, we build
models based on SOTA text embedding techniques and RNNs to predict shifts in
emotional tone. This differs from most of related work, which focuses primarily
on detecting mental disorders from user activity. We demonstrate the
feasibility of accurately predicting the users' reactions to the interactions
experienced in these platforms, and present some examples which illustrate that
the models are correctly capturing the effects of comments on the author's
emotional tone. Our models hold promising implications for interventions to
provide support for people struggling with mental illnesses.
","[{'version': 'v1', 'created': 'Fri, 15 May 2020 11:25:08 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Jul 2021 12:48:29 GMT'}]",2021-07-28,"[['Silveira', 'Bárbara', ''], ['Silva', 'Henrique S.', ''], ['Murai', 'Fabricio', ''], ['da Silva', 'Ana Paula Couto', '']]","['Emotional tone', 'Sentiment analysis', 'Mental health disorders', 'Reddit', 'Online communities', 'Emotional tone prediction']"
10348,1601.03528,Florian Bock,"Florian Bock, Daniel Homm, Sebastian Siegl, Reinhard German","A Taxonomy for Tools, Processes and Languages in Automotive Software
  Engineering","16 pages, 11 figures, conference paper",,10.5121/csit.2016.60121,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Within the growing domain of software engineering in the automotive sector,
the number of used tools, processes, methods and languages has increased
distinctly in the past years. To be able to choose proper methods for
particular development use cases, factors like the intended use, key-features
and possible limitations have to be evaluated. This requires a taxonomy that
aids the decision making. An analysis of the main existing taxonomies revealed
two major deficiencies: the lack of the automotive focus and the limitation to
particular engineering method types. To face this, a graphical taxonomy is
proposed based on two well-established engineering approaches and enriched with
additional classification information. It provides a self-evident and
-explanatory overview and comparison technique for engineering methods in the
automotive domain. The taxonomy is applied to common automotive engineering
methods. The resulting diagram classifies each method and enables the reader to
select appropriate solutions for given project requirements.
","[{'version': 'v1', 'created': 'Thu, 14 Jan 2016 09:46:06 GMT'}]",2016-01-15,"[['Bock', 'Florian', ''], ['Homm', 'Daniel', ''], ['Siegl', 'Sebastian', ''], ['German', 'Reinhard', '']]","['Software Engineering', 'Processes & Tools & Languages', 'Comparison', 'Taxonomy', 'Classification']"
10349,2008.10454,Sebastiano Verde,"Sebastiano Verde, Paolo Bestagini, Simone Milani, Giancarlo Calvagno
  and Stefano Tubaro","FOCAL: A Forgery Localization Framework based on Video Coding
  Self-Consistency",,,10.1109/OJSP.2021.3074298,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Forgery operations on video contents are nowadays within the reach of anyone,
thanks to the availability of powerful and user-friendly editing software.
Integrity verification and authentication of videos represent a major interest
in both journalism (e.g., fake news debunking) and legal environments dealing
with digital evidence (e.g., a court of law). While several strategies and
different forensics traces have been proposed in recent years, latest solutions
aim at increasing the accuracy by combining multiple detectors and features.
This paper presents a video forgery localization framework that verifies the
self-consistency of coding traces between and within video frames, by fusing
the information derived from a set of independent feature descriptors. The
feature extraction step is carried out by means of an explainable convolutional
neural network architecture, specifically designed to look for and classify
coding artifacts. The overall framework was validated in two typical forgery
scenarios: temporal and spatial splicing. Experimental results show an
improvement to the state-of-the-art on temporal splicing localization and also
promising performance in the newly tackled case of spatial splicing, on both
synthetic and real-world videos.
","[{'version': 'v1', 'created': 'Mon, 24 Aug 2020 13:55:14 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Sep 2020 07:55:11 GMT'}]",2021-06-04,"[['Verde', 'Sebastiano', ''], ['Bestagini', 'Paolo', ''], ['Milani', 'Simone', ''], ['Calvagno', 'Giancarlo', ''], ['Tubaro', 'Stefano', '']]","['Forgery Detection', 'Video Splicing', 'Content Integrity', 'Feature Fusion', 'Multimedia Forensics']"
10350,2010.07152,Kai Wang,"Kai Wang, Yu Liu, Qian Ma, Quan Z. Sheng","MulDE: Multi-teacher Knowledge Distillation for Low-dimensional
  Knowledge Graph Embeddings",Accepted for publication at the Web Conference 2021,,10.1145/3442381.3449898,,cs.AI cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Link prediction based on knowledge graph embeddings (KGE) aims to predict new
triples to automatically construct knowledge graphs (KGs). However, recent KGE
models achieve performance improvements by excessively increasing the embedding
dimensions, which may cause enormous training costs and require more storage
space. In this paper, instead of training high-dimensional models, we propose
MulDE, a novel knowledge distillation framework, which includes multiple
low-dimensional hyperbolic KGE models as teachers and two student components,
namely Junior and Senior. Under a novel iterative distillation strategy, the
Junior component, a low-dimensional KGE model, asks teachers actively based on
its preliminary prediction results, and the Senior component integrates
teachers' knowledge adaptively to train the Junior component based on two
mechanisms: relation-specific scaling and contrast attention. The experimental
results show that MulDE can effectively improve the performance and training
speed of low-dimensional KGE models. The distilled 32-dimensional model is
competitive compared to the state-of-the-art high-dimensional methods on
several widely-used datasets.
","[{'version': 'v1', 'created': 'Wed, 14 Oct 2020 15:09:27 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Oct 2020 09:33:41 GMT'}, {'version': 'v3', 'created': 'Sat, 27 Mar 2021 14:29:34 GMT'}, {'version': 'v4', 'created': 'Thu, 1 Apr 2021 08:09:33 GMT'}]",2021-04-02,"[['Wang', 'Kai', ''], ['Liu', 'Yu', ''], ['Ma', 'Qian', ''], ['Sheng', 'Quan Z.', '']]","['Knowledge graph embeddings', 'link prediction', 'knowledge distillation', 'knowledge graph']"
10351,1702.06451,Jakub Sochor,"Jakub Sochor, Roman Jur\'anek, Adam Herout","Traffic Surveillance Camera Calibration by 3D Model Bounding Box
  Alignment for Accurate Vehicle Speed Measurement",accepted to CVIU,,10.1016/j.cviu.2017.05.015,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we focus on fully automatic traffic surveillance camera
calibration, which we use for speed measurement of passing vehicles. We improve
over a recent state-of-the-art camera calibration method for traffic
surveillance based on two detected vanishing points. More importantly, we
propose a novel automatic scene scale inference method. The method is based on
matching bounding boxes of rendered 3D models of vehicles with detected
bounding boxes in the image. The proposed method can be used from arbitrary
viewpoints, since it has no constraints on camera placement. We evaluate our
method on the recent comprehensive dataset for speed measurement BrnoCompSpeed.
Experiments show that our automatic camera calibration method by detection of
two vanishing points reduces error by 50% (mean distance ratio error reduced
from 0.18 to 0.09) compared to the previous state-of-the-art method. We also
show that our scene scale inference method is more precise, outperforming both
state-of-the-art automatic calibration method for speed measurement (error
reduction by 86% -- 7.98km/h to 1.10km/h) and manual calibration (error
reduction by 19% -- 1.35km/h to 1.10km/h). We also present qualitative results
of the proposed automatic camera calibration method on video sequences obtained
from real surveillance cameras in various places, and under different lighting
conditions (night, dawn, day).
","[{'version': 'v1', 'created': 'Tue, 21 Feb 2017 15:50:10 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Jun 2017 11:57:49 GMT'}]",2017-06-02,"[['Sochor', 'Jakub', ''], ['Juránek', 'Roman', ''], ['Herout', 'Adam', '']]","['speed measurement', 'camera calibration', 'fully automatic', 'trafficsurveillance', 'bounding box alignment', 'vanishing point detection']"
10352,2208.13451,Gordon Fraser,"Florian Oberm\""uller, Robert Pernerstorfer, Lisa Bailey, Ute Heuer,
  Gordon Fraser",Common Patterns in Block-Based Robot Programs,"To be published in the Proceedings of the 17th Workshop in Primary
  and Secondary Computing Education (WIPSCE'22)",,10.1145/3556787.3556859,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Programmable robots are engaging and fun to play with, interact with the real
world, and are therefore well suited to introduce young learners to
programming. Introductory robot programming languages often extend existing
block-based languages such as Scratch. While teaching programming with such
languages is well established, the interaction with the real world in robot
programs leads to specific challenges, for which learners and educators may
require assistance and feedback. A practical approach to provide this feedback
is by identifying and pointing out patterns in the code that are indicative of
good or bad solutions. While such patterns have been defined for regular
block-based programs, robot-specific programming aspects have not been
considered so far. The aim of this paper is therefore to identify patterns
specific to robot programming for the Scratch-based mBlock programming
language, which is used for the popular mBot and Codey Rocky robots. We
identify: (1) 26 bug patterns, which indicate erroneous code; (2) three code
smells, which indicate code that may work but is written in a confusing or
difficult to understand way; and (3) 18 code perfumes, which indicate aspects
of code that are likely good. We extend the LitterBox analysis framework to
automatically identify these patterns in mBlock programs. Evaluated on a
dataset of 3,540 mBlock programs, we find a total of 6,129 instances of bug
patterns, 592 code smells and 14,495 code perfumes. This demonstrates the
potential of our approach to provide feedback and assistance to learners and
educators alike for their mBlock robot programs.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2022 09:35:24 GMT'}]",2022-08-30,"[['Obermüller', 'Florian', ''], ['Pernerstorfer', 'Robert', ''], ['Bailey', 'Lisa', ''], ['Heuer', 'Ute', ''], ['Fraser', 'Gordon', '']]","['mBlock', 'Robot', 'Block-based programming', 'Linting', 'Code quality']"
10353,1507.00043,Athanasios N. Nikolakopoulos,Athanasios N. Nikolakopoulos and John D. Garofalakis,Top-N recommendations in the presence of sparsity: An NCD-based approach,To appear in the Web Intelligence Journal as a regular paper,,10.3233/WEB-150324,,cs.IR cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Making recommendations in the presence of sparsity is known to present one of
the most challenging problems faced by collaborative filtering methods. In this
work we tackle this problem by exploiting the innately hierarchical structure
of the item space following an approach inspired by the theory of
Decomposability. We view the itemspace as a Nearly Decomposable system and we
define blocks of closely related elements and corresponding indirect proximity
components. We study the theoretical properties of the decomposition and we
derive sufficient conditions that guarantee full item space coverage even in
cold-start recommendation scenarios. A comprehensive set of experiments on the
MovieLens and the Yahoo!R2Music datasets, using several widely applied
performance metrics, support our model's theoretically predicted properties and
verify that NCDREC outperforms several state-of-the-art algorithms, in terms of
recommendation accuracy, diversity and sparseness insensitivity.
","[{'version': 'v1', 'created': 'Tue, 30 Jun 2015 21:34:53 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Jul 2015 13:55:35 GMT'}]",2015-12-10,"[['Nikolakopoulos', 'Athanasios N.', ''], ['Garofalakis', 'John D.', '']]","['Recommender Systems', 'Collaborative Filtering', 'Sparsity', 'Decomposability', 'Markov Chain Models', 'Long-TailRecommendation']"
10354,2003.03332,Jori Bomanson,"Jori Bomanson (1) and Tomi Janhunen (1 and 2) ((1) Aalto University,
  (2) Tampere University)",Boosting Answer Set Optimization with Weighted Comparator Networks,36 pages,Theory and Practice of Logic Programming 20 (2020) 512-551,10.1017/S147106842000006X,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Answer set programming (ASP) is a paradigm for modeling knowledge intensive
domains and solving challenging reasoning problems. In ASP solving, a typical
strategy is to preprocess problem instances by rewriting complex rules into
simpler ones. Normalization is a rewriting process that removes extended rule
types altogether in favor of normal rules. Recently, such techniques led to
optimization rewriting in ASP, where the goal is to boost answer set
optimization by refactoring the optimization criteria of interest. In this
paper, we present a novel, general, and effective technique for optimization
rewriting based on comparator networks, which are specific kinds of circuits
for reordering the elements of vectors. The idea is to connect an ASP encoding
of a comparator network to the literals being optimized and to redistribute the
weights of these literals over the structure of the network. The encoding
captures information about the weight of an answer set in auxiliary atoms in a
structured way that is proven to yield exponential improvements during
branch-and-bound optimization on an infinite family of example programs. The
used comparator network can be tuned freely, e.g., to find the best size for a
given benchmark class. Experiments show accelerated optimization performance on
several benchmark problems.
","[{'version': 'v1', 'created': 'Fri, 6 Mar 2020 17:59:34 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Nov 2020 17:03:42 GMT'}]",2020-11-09,"[['Bomanson', 'Jori', '', '1 and 2'], ['Janhunen', 'Tomi', '', '1 and 2']]","['answer set programming', 'comparator network', 'normalization', 'optimization rewriting', 'translation']"
10355,2010.09249,Albert Weichselbraun,"Albert Weichselbraun and Philipp Kuntschik and Sandro H\""orler","Improving Company Valuations with Automated Knowledge Discovery,
  Extraction and Fusion","English translation of the article: ""Optimierung von
  Unternehmensbewertungen durch automatisierte Wissensidentifikation,
  -extraktion und -integration"". Information - Wissenschaft und Praxis 71
  (5-6):1-5, https://doi.org/10.1515/iwp-2020-2119",,10.1515/iwp-2020-2119,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Performing company valuations within the domain of biotechnology, pharmacy
and medical technology is a challenging task, especially when considering the
unique set of risks biotech start-ups face when entering new markets. Companies
specialized in global valuation services, therefore, combine valuation models
and past experience with heterogeneous metrics and indicators that provide
insights into a company's performance. This paper illustrates how automated
knowledge discovery, extraction and data fusion can be used to (i) obtain
additional indicators that provide insights into the success of a company's
product development efforts, and (ii) support labor-intensive data curation
processes. We apply deep web knowledge acquisition methods to identify and
harvest data on clinical trials that is hidden behind proprietary search
interfaces and integrate the extracted data into the industry partner's company
valuation ontology. In addition, focused Web crawls and shallow semantic
parsing yield information on the company's key personnel and respective contact
data, notifying domain experts of relevant changes that get then incorporated
into the industry partner's company data.
","[{'version': 'v1', 'created': 'Mon, 19 Oct 2020 06:33:12 GMT'}]",2020-10-20,"[['Weichselbraun', 'Albert', ''], ['Kuntschik', 'Philipp', ''], ['Hörler', 'Sandro', '']]","['Company Valuation', 'Deep Web', 'Web Intelligence', 'Biotech companies', 'knowledge acquisition', 'knowledge extraction', 'shallow semantic parsing']"
10356,2004.13491,Malte Renken,"Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken,
  Philipp Zschoche",As Time Goes By: Reflections on Treewidth for Temporal Graphs,,,10.1007/978-3-030-42071-0_6,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Treewidth is arguably the most important structural graph parameter leading
to algorithmically beneficial graph decompositions. Triggered by a strongly
growing interest in temporal networks (graphs where edge sets change over
time), we discuss fresh algorithmic views on temporal tree decompositions and
temporal treewidth. We review and explain some of the recent work together with
some encountered pitfalls, and we point out challenges for future research.
","[{'version': 'v1', 'created': 'Tue, 28 Apr 2020 13:26:15 GMT'}]",2020-04-29,"[['Fluschnik', 'Till', ''], ['Molter', 'Hendrik', ''], ['Niedermeier', 'Rolf', ''], ['Renken', 'Malte', ''], ['Zschoche', 'Philipp', '']]","['Network science', 'time-evolving network', 'link stream', 'NP-hardness', 'parameterized complexity', 'tree decomposition', 'monadic second-order logic (MSO)']"
10357,2209.09946,Soheil Human,"Victor Morel, Cristiana Santos, Yvonne Lintao, Soheil Human","Your Consent Is Worth 75 Euros A Year -- Measurement and Lawfulness of
  Cookie Paywalls",,,10.1145/3559613.3563205,,cs.CY cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Most websites offer their content for free, though this gratuity often comes
with a counterpart: personal data is collected to finance these websites by
resorting, mostly, to tracking and thus targeted advertising. Cookie walls and
paywalls, used to retrieve consent, recently generated interest from EU DPAs
and seemed to have grown in popularity. However, they have been overlooked by
scholars. We present in this paper 1) the results of an exploratory study
conducted on 2800 Central European websites to measure the presence and
practices of cookie paywalls, and 2) a framing of their lawfulness amidst the
variety of legal decisions and guidelines.
","[{'version': 'v1', 'created': 'Tue, 20 Sep 2022 18:43:50 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Sep 2022 16:40:18 GMT'}, {'version': 'v3', 'created': 'Mon, 26 Sep 2022 16:49:49 GMT'}]",2022-09-27,"[['Morel', 'Victor', ''], ['Santos', 'Cristiana', ''], ['Lintao', 'Yvonne', ''], ['Human', 'Soheil', '']]","['paywalls', 'tracking', 'dark patterns', 'adtech', 'consent', 'GDPR', 'ePD']"
10358,2002.01893,Houpu Yao,"Houpu Yao, Yi Gao, Yongming Liu","FEA-Net: A Physics-guided Data-driven Model for Efficient Mechanical
  Response Prediction",,,10.1016/j.cma.2020.112892,,cs.CE cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An innovative physics-guided learning algorithm for predicting the mechanical
response of materials and structures is proposed in this paper. The key concept
of the proposed study is based on the fact that physics models are governed by
Partial Differential Equation (PDE), and its loading/ response mapping can be
solved using Finite Element Analysis (FEA). Based on this, a special type of
deep convolutional neural network (DCNN) is proposed that takes advantage of
our prior knowledge in physics to build data-driven models whose architectures
are of physics meaning. This type of network is named as FEA-Net and is used to
solve the mechanical response under external loading. Thus, the identification
of a mechanical system parameters and the computation of its responses are
treated as the learning and inference of FEA-Net, respectively. Case studies on
multi-physics (e.g., coupled mechanical-thermal analysis) and multi-phase
problems (e.g., composite materials with random micro-structures) are used to
demonstrate and verify the theoretical and computational advantages of the
proposed method.
","[{'version': 'v1', 'created': 'Fri, 31 Jan 2020 09:37:44 GMT'}]",2020-04-22,"[['Yao', 'Houpu', ''], ['Gao', 'Yi', ''], ['Liu', 'Yongming', '']]","['Physics-guided Learning', 'Data-driven Model', 'Convolutional Neural Networks', 'Finite Element Analysis']"
10359,2209.06389,Ziyue Li Dr,"Zhenyu Mao, Ziyue Li, Dedong Li, Lei Bai, Rui Zhao","Jointly Contrastive Representation Learning on Road Network and
  Trajectory",Accepted in CIKM 2022,,10.1145/3511808.3557370,,cs.LG cs.AI cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Road network and trajectory representation learning are essential for traffic
systems since the learned representation can be directly used in various
downstream tasks (e.g., traffic speed inference, and travel time estimation).
However, most existing methods only contrast within the same scale, i.e.,
treating road network and trajectory separately, which ignores valuable
inter-relations. In this paper, we aim to propose a unified framework that
jointly learns the road network and trajectory representations end-to-end. We
design domain-specific augmentations for road-road contrast and
trajectory-trajectory contrast separately, i.e., road segment with its
contextual neighbors and trajectory with its detour replaced and dropped
alternatives, respectively. On top of that, we further introduce the
road-trajectory cross-scale contrast to bridge the two scales by maximizing the
total mutual information. Unlike the existing cross-scale contrastive learning
methods on graphs that only contrast a graph and its belonging nodes, the
contrast between road segment and trajectory is elaborately tailored via novel
positive sampling and adaptive weighting strategies. We conduct prudent
experiments based on two real-world datasets with four downstream tasks,
demonstrating improved performance and effectiveness. The code is available at
https://github.com/mzy94/JCLRNT.
","[{'version': 'v1', 'created': 'Wed, 14 Sep 2022 03:08:20 GMT'}]",2022-09-15,"[['Mao', 'Zhenyu', ''], ['Li', 'Ziyue', ''], ['Li', 'Dedong', ''], ['Bai', 'Lei', ''], ['Zhao', 'Rui', '']]","['contrastive learning', 'representation learning', 'road network', 'trajectory', 'self-supervised learning', 'smart mobility']"
10360,2211.05227,Benjamin Paassen,"Anastasia Kovalkov and Benjamin Paa{\ss}en and Avi Segal and Niels
  Pinkwart and Kobi Gal",Automatic Creativity Measurement in Scratch Programs Across Modalities,,IEEE Transactions on Learning Technologies 14(6) (2021) 740-753,10.1109/TLT.2022.3144442,,cs.HC cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Promoting creativity is considered an important goal of education, but
creativity is notoriously hard to measure.In this paper, we make the journey
fromdefining a formal measure of creativity that is efficientlycomputable to
applying the measure in a practical domain. The measure is general and relies
on coretheoretical concepts in creativity theory, namely fluency, flexibility,
and originality, integratingwith prior cognitive science literature. We adapted
the general measure for projects in the popular visual programming language
Scratch.We designed a machine learning model for predicting the creativity of
Scratch projects, trained and evaluated on human expert creativity assessments
in an extensive user study. Our results show that opinions about creativity in
Scratch varied widely across experts. The automatic creativity assessment
aligned with the assessment of the human experts more than the experts agreed
with each other. This is a first step in providing computational models for
measuring creativity that can be applied to educational technologies, and to
scale up the benefit of creativity education in schools.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2022 10:43:36 GMT'}]",2022-11-11,"[['Kovalkov', 'Anastasia', ''], ['Paaßen', 'Benjamin', ''], ['Segal', 'Avi', ''], ['Pinkwart', 'Niels', ''], ['Gal', 'Kobi', '']]","['Creativity', 'distances', 'Scratch', 'computer science education', 'automatic assessment tools']"
10361,2007.14936,Mirko Lai,Mirko Lai and Viviana Patti and Giancarlo Ruffo and Paolo Rosso,"#Brexit: Leave or Remain? The Role of User's Community and Diachronic
  Evolution on Stance Detection",To appear in Journal of Intelligent & Fuzzy Systems,,10.3233/JIFS-179895,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interest has grown around the classification of stance that users assume
within online debates in recent years. Stance has been usually addressed by
considering users posts in isolation, while social studies highlight that
social communities may contribute to influence users' opinion. Furthermore,
stance should be studied in a diachronic perspective, since it could help to
shed light on users' opinion shift dynamics that can be recorded during the
debate. We analyzed the political discussion in UK about the BREXIT referendum
on Twitter, proposing a novel approach and annotation schema for stance
detection, with the main aim of investigating the role of features related to
social network community and diachronic stance evolution. Classification
experiments show that such features provide very useful clues for detecting
stance.
","[{'version': 'v1', 'created': 'Wed, 29 Jul 2020 16:19:02 GMT'}]",2020-07-30,"[['Lai', 'Mirko', ''], ['Patti', 'Viviana', ''], ['Ruffo', 'Giancarlo', ''], ['Rosso', 'Paolo', '']]","['Stance Detection', 'Twitter', 'Brexit', 'NLP', 'Community Detection']"
10362,1707.00838,Sebastian Baltes,Sebastian Baltes and Stephan Diehl,Worse Than Spam: Issues In Sampling Software Developers,"6 pages, 2 figures, Proceedings of the 2016 ACM/IEEE International
  Symposium on Empirical Software Engineering and Measurement (ESEM 2016), ACM,
  2016",,10.1145/2961111.2962628,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Reaching out to professional software developers is a crucial
part of empirical software engineering research. One important method to
investigate the state of practice is survey research. As drawing a random
sample of professional software developers for a survey is rarely possible,
researchers rely on various sampling strategies. Objective: In this paper, we
report on our experience with different sampling strategies we employed,
highlight ethical issues, and motivate the need to maintain a collection of key
demographics about software developers to ease the assessment of the external
validity of studies. Method: Our report is based on data from two studies we
conducted in the past. Results: Contacting developers over public media proved
to be the most effective and efficient sampling strategy. However, we not only
describe the perspective of researchers who are interested in reaching goals
like a large number of participants or a high response rate, but we also shed
light onto ethical implications of different sampling strategies. We present
one specific ethical guideline and point to debates in other research
communities to start a discussion in the software engineering research
community about which sampling strategies should be considered ethical.
","[{'version': 'v1', 'created': 'Tue, 4 Jul 2017 07:48:09 GMT'}]",2017-07-05,"[['Baltes', 'Sebastian', ''], ['Diehl', 'Stephan', '']]","['Empirical Research', 'Sampling', 'Software Developers', 'Ethics']"
10363,2110.03298,Jia Huei Tan,"Jia Huei Tan, Chee Seng Chan, Joon Huang Chuah",End-to-End Supermask Pruning: Learning to Prune Image Captioning Models,Pattern Recognition; In Press,,10.1016/j.patcog.2021.108366,,cs.CV cs.CL cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  With the advancement of deep models, research work on image captioning has
led to a remarkable gain in raw performance over the last decade, along with
increasing model complexity and computational cost. However, surprisingly works
on compression of deep networks for image captioning task has received little
to no attention. For the first time in image captioning research, we provide an
extensive comparison of various unstructured weight pruning methods on three
different popular image captioning architectures, namely Soft-Attention,
Up-Down and Object Relation Transformer. Following this, we propose a novel
end-to-end weight pruning method that performs gradual sparsification based on
weight sensitivity to the training loss. The pruning schemes are then extended
with encoder pruning, where we show that conducting both decoder pruning and
training simultaneously prior to the encoder pruning provides good overall
performance. Empirically, we show that an 80% to 95% sparse network (up to 75%
reduction in model size) can either match or outperform its dense counterpart.
The code and pre-trained models for Up-Down and Object Relation Transformer
that are capable of achieving CIDEr scores >120 on the MS-COCO dataset but with
only 8.7 MB and 14.5 MB in model size (size reduction of 96% and 94%
respectively against dense versions) are publicly available at
https://github.com/jiahuei/sparse-image-captioning.
","[{'version': 'v1', 'created': 'Thu, 7 Oct 2021 09:34:00 GMT'}]",2021-10-08,"[['Tan', 'Jia Huei', ''], ['Chan', 'Chee Seng', ''], ['Chuah', 'Joon Huang', '']]","['image captioning', 'deep network compression', 'deep learning']"
10364,1803.09162,Tegjyot Singh Sethi,"Tegjyot Singh Sethi, Mehmed Kantardzic, Lingyu Lyua, Jiashun Chen","A Dynamic-Adversarial Mining Approach to the Security of Machine
  Learning","Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery.
  2018",,10.1002/widm.1245,,cs.LG cs.CR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Operating in a dynamic real world environment requires a forward thinking and
adversarial aware design for classifiers, beyond fitting the model to the
training data. In such scenarios, it is necessary to make classifiers - a)
harder to evade, b) easier to detect changes in the data distribution over
time, and c) be able to retrain and recover from model degradation. While most
works in the security of machine learning has concentrated on the evasion
resistance (a) problem, there is little work in the areas of reacting to
attacks (b and c). Additionally, while streaming data research concentrates on
the ability to react to changes to the data distribution, they often take an
adversarial agnostic view of the security problem. This makes them vulnerable
to adversarial activity, which is aimed towards evading the concept drift
detection mechanism itself. In this paper, we analyze the security of machine
learning, from a dynamic and adversarial aware perspective. The existing
techniques of Restrictive one class classifier models, Complex learning models
and Randomization based ensembles, are shown to be myopic as they approach
security as a static task. These methodologies are ill suited for a dynamic
environment, as they leak excessive information to an adversary, who can
subsequently launch attacks which are indistinguishable from the benign data.
Based on empirical vulnerability analysis against a sophisticated adversary, a
novel feature importance hiding approach for classifier design, is proposed.
The proposed design ensures that future attacks on classifiers can be detected
and recovered from. The proposed work presents motivation, by serving as a
blueprint, for future work in the area of Dynamic-Adversarial mining, which
combines lessons learned from Streaming data mining, Adversarial learning and
Cybersecurity.
","[{'version': 'v1', 'created': 'Sat, 24 Mar 2018 20:55:20 GMT'}]",2018-03-28,"[['Sethi', 'Tegjyot Singh', ''], ['Kantardzic', 'Mehmed', ''], ['Lyua', 'Lingyu', ''], ['Chen', 'Jiashun', '']]","['Adversarial machine learning', 'Streaming data', 'Concept drift', 'Ensemble', 'Feature information hiding', 'Evasion']"
10365,2012.01325,Navod Thilakarathne,"Navod Neranjan Thilakarathne, Mohan Krishna Kagita and W.D Madhuka
  Priyashan","Green Internet of Things: The Next Generation Energy Efficient Internet
  of Things",,,10.1007/978-981-16-2008-9_38,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Internet of Things (IoT) is seen as a novel technical paradigm aimed at
enabling connectivity between billions of interconnected devices all around the
world. This IoT is being served in various domains, such as smart healthcare,
traffic surveillance, smart homes, smart cities, and various industries. IoT's
main functionality includes sensing the surrounding environment, collecting
data from the surrounding, and transmitting those data to the remote data
centers or the cloud. This sharing of vast volumes of data between billions of
IoT devices generates a large energy demand and increases energy wastage in the
form of heat. The Green IoT envisages reducing the energy consumption of IoT
devices and keeping the environment safe and clean. Inspired by achieving a
sustainable next-generation IoT ecosystem and guiding us toward making a
healthy green planet, we first offer an overview of Green IoT (GIoT), and then
the challenges and the future directions regarding the GIoT are presented in
our study.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2020 16:52:18 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Jul 2021 11:50:31 GMT'}]",2021-07-23,"[['Thilakarathne', 'Navod Neranjan', ''], ['Kagita', 'Mohan Krishna', ''], ['Priyashan', 'W. D Madhuka', '']]","['IoT', 'Green IoT', 'GIoT', 'Green Computing', 'Green IT']"
10366,2003.05720,Eleni Maria Kalogeraki,"Spyridon Papastergiou, Haralambos Mouratidis, Eleni-Maria Kalogeraki","Cyber Security Incident Handling, Warning and Response System for the
  European Critical Information Infrastructures (CyberSANE)",,"Engineering Applications of Neural Networks -20th International
  Conference (EANN2019) Proceedings. Communications in Computer and Information
  Science (vol.1000) 476-487 Springer Cham",10.1007/978-3-030-20257-6_41,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper aims to enhance the security and resilience of Critical
Information Infrastructures (CIIs) by providing a dynamic collaborative,
warning and response system (CyberSANE system) supporting and guiding security
officers and operators (e.g. Incident Response professionals) to recognize,
identify, dynamically analyse, forecast, treat and respond to their threats and
risks and handle their daily cyber incidents. The proposed solution provides a
first of a kind approach for handling cyber security incidents in the digital
environments with highly interconnected, complex and diverse nature.
","[{'version': 'v1', 'created': 'Wed, 11 Mar 2020 15:25:40 GMT'}]",2020-03-13,"[['Papastergiou', 'Spyridon', ''], ['Mouratidis', 'Haralambos', ''], ['Kalogeraki', 'Eleni-Maria', '']]","['Incident handling', 'Web mining', 'Data Fusion', 'Risk Assessment']"
10367,2101.01899,Maitree Leekha,"Vidit Jain, Maitree Leekha, Rajiv Ratn Shah, Jainendra Shukla",Exploring Semi-Supervised Learning for Predicting Listener Backchannels,Accepted at CHI 2021,,10.1145/3411764.3445449,,cs.HC cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Developing human-like conversational agents is a prime area in HCI research
and subsumes many tasks. Predicting listener backchannels is one such
actively-researched task. While many studies have used different approaches for
backchannel prediction, they all have depended on manual annotations for a
large dataset. This is a bottleneck impacting the scalability of development.
To this end, we propose using semi-supervised techniques to automate the
process of identifying backchannels, thereby easing the annotation process. To
analyze our identification module's feasibility, we compared the backchannel
prediction models trained on (a) manually-annotated and (b) semi-supervised
labels. Quantitative analysis revealed that the proposed semi-supervised
approach could attain 95% of the former's performance. Our user-study findings
revealed that almost 60% of the participants found the backchannel responses
predicted by the proposed model more natural. Finally, we also analyzed the
impact of personality on the type of backchannel signals and validated our
findings in the user-study.
","[{'version': 'v1', 'created': 'Wed, 6 Jan 2021 07:30:38 GMT'}]",2021-01-07,"[['Jain', 'Vidit', ''], ['Leekha', 'Maitree', ''], ['Shah', 'Rajiv Ratn', ''], ['Shukla', 'Jainendra', '']]","['Conversational Agents', 'Backchanneling', 'Multimodal analysis']"
10368,2204.08176,Menglin Yang,"Menglin Yang, Min Zhou, Jiahong Liu, Defu Lian, Irwin King","HRCF: Enhancing Collaborative Filtering via Hyperbolic Geometric
  Regularization","Proceedings of the ACM Web Conference 2022 (WWW '22); fixed some
  typos",,10.1145/3485447.3512118,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In large-scale recommender systems, the user-item networks are generally
scale-free or expand exponentially. The latent features (also known as
embeddings) used to describe the user and item are determined by how well the
embedding space fits the data distribution. Hyperbolic space offers a spacious
room to learn embeddings with its negative curvature and metric properties,
which can well fit data with tree-like structures. Recently, several hyperbolic
approaches have been proposed to learn high-quality representations for the
users and items. However, most of them concentrate on developing the hyperbolic
similitude by designing appropriate projection operations, whereas many
advantageous and exciting geometric properties of hyperbolic space have not
been explicitly explored. For example, one of the most notable properties of
hyperbolic space is that its capacity space increases exponentially with the
radius, which indicates the area far away from the hyperbolic origin is much
more embeddable. Regarding the geometric properties of hyperbolic space, we
bring up a Hyperbolic Regularization powered Collaborative Filtering(HRCF) and
design a geometric-aware hyperbolic regularizer. Specifically, the proposal
boosts optimization procedure via the root alignment and origin-aware penalty,
which is simple yet impressively effective. Through theoretical analysis, we
further show that our proposal is able to tackle the over-smoothing problem
caused by hyperbolic aggregation and also brings the models a better
discriminative ability. We conduct extensive empirical analysis, comparing our
proposal against a large set of baselines on several public benchmarks. The
empirical results show that our approach achieves highly competitive
performance and surpasses both the leading Euclidean and hyperbolic baselines
by considerable margins.
","[{'version': 'v1', 'created': 'Mon, 18 Apr 2022 06:11:44 GMT'}, {'version': 'v2', 'created': 'Mon, 30 May 2022 12:00:23 GMT'}]",2022-05-31,"[['Yang', 'Menglin', ''], ['Zhou', 'Min', ''], ['Liu', 'Jiahong', ''], ['Lian', 'Defu', ''], ['King', 'Irwin', '']]","['Recommender system', 'collaborative filtering', 'hyperbolic space', 'graph neural network', 'regularization']"
10369,1904.05247,Linus W. Dietz,Rinita Roy and Linus W. Dietz,"A Model for Using Physiological Conditions for Proactive Tourist
  Recommendations",,"ABIS '2019 Proceedings of the 23rd International Workshop on
  Personalization and Recommendation on the Web and Beyond",10.1145/3345002.3349289,,cs.HC cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Mobile proactive tourist recommender systems can support tourists by
recommending the best choice depending on different contexts related to herself
and the environment. In this paper, we propose to utilize wearable sensors to
gather health information about a tourist and use them for recommending tourist
activities. We discuss a range of wearable devices, sensors to infer
physiological conditions of the users, and exemplify the feasibility using a
popular self-quantification mobile app. Our main contribution then comprises a
data model to derive relations between the parameters measured by the wearable
sensors, such as heart rate, body temperature, blood pressure, and use them to
infer the physiological condition of a user. This model can then be used to
derive classes of tourist activities that determine which items should be
recommended.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2019 15:37:28 GMT'}]",2019-12-17,"[['Roy', 'Rinita', ''], ['Dietz', 'Linus W.', '']]","['wearable devices', 'user modeling', 'proactive recommender systems', 'context modeling', 'machine learning']"
10370,2202.09076,Yuqing Wang,"Yuqing Wang and Mika V.M\""antyl\""a and Zihao Liu and Jouni Markkula
  and P\""aivi Raulamo-jurvanen",Improving Test Automation Maturity: a Multivocal Literature Review,"Journal of Software: Testing, Verification and Reliability (2022)",,10.1002/stvr.1804,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Mature test automation is key for achieving software quality at speed. In
this paper, we present a multivocal literature review with the objective to
survey and synthesize the guidelines given in the literature for improving test
automation maturity. We selected and reviewed 81 primary studies, consisting of
26 academic literature and 55 grey literature sources. From primary studies, we
extracted 26 test automation best practices (e.g., Define an effective test
automation strategy, Set up good test environments, Develop high-quality test
scripts) and collected many pieces of advice (e.g., in forms of
implementation/improvement approaches, technical techniques, concepts,
experience-based heuristics) on how to conduct these best practices. We made
main observations: (1) There are only 6 best practices whose positive effect on
maturity improvement have been evaluated by academic studies using formal
empirical methods; (2) Several technical related best practices in this MLR
were not presented in test maturity models; (3) Some best practices can be
linked to success factors and maturity impediments proposed by other scholars;
(4) Most pieces of advice on how to conduct proposed best practices were
identified from experience studies and their effectiveness need to be further
evaluated with cross-site empirical evidence using formal empirical methods;
(5) In the literature, some advice on how to conduct certain best practices are
conflicting, and some advice on how to conduct certain best practices still
need further qualitative analysis.
","[{'version': 'v1', 'created': 'Fri, 18 Feb 2022 08:33:36 GMT'}]",2022-02-21,"[['Wang', 'Yuqing', ''], ['Mäntylä', 'Mika V.', ''], ['Liu', 'Zihao', ''], ['Markkula', 'Jouni', ''], ['Raulamo-jurvanen', 'Päivi', '']]","['software', 'test automation', 'maturity', 'improvement', 'practice', 'systematic literature review']"
10371,2007.06888,Zeyu Hu,"Zeyu Hu, Mingmin Zhen, Xuyang Bai, Hongbo Fu and Chiew-lan Tai","JSENet: Joint Semantic Segmentation and Edge Detection Network for 3D
  Point Clouds","Accepted to ECCV 2020, supplementary materials included",,10.1007/978-3-030-58565-5_14,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semantic segmentation and semantic edge detection can be seen as two dual
problems with close relationships in computer vision. Despite the fast
evolution of learning-based 3D semantic segmentation methods, little attention
has been drawn to the learning of 3D semantic edge detectors, even less to a
joint learning method for the two tasks. In this paper, we tackle the 3D
semantic edge detection task for the first time and present a new two-stream
fully-convolutional network that jointly performs the two tasks. In particular,
we design a joint refinement module that explicitly wires region information
and edge information to improve the performances of both tasks. Further, we
propose a novel loss function that encourages the network to produce semantic
segmentation results with better boundaries. Extensive evaluations on S3DIS and
ScanNet datasets show that our method achieves on par or better performance
than the state-of-the-art methods for semantic segmentation and outperforms the
baseline methods for semantic edge detection. Code release:
https://github.com/hzykent/JSENet
","[{'version': 'v1', 'created': 'Tue, 14 Jul 2020 08:00:35 GMT'}]",2021-07-30,"[['Hu', 'Zeyu', ''], ['Zhen', 'Mingmin', ''], ['Bai', 'Xuyang', ''], ['Fu', 'Hongbo', ''], ['Tai', 'Chiew-lan', '']]","['Semantic Segmentation', 'Semantic Edge Detection', '3D PointClouds', '3D Scene Understanding']"
10372,1908.08503,Sara Rouhani,"Sara Rouhani, Ralph Deters",Blockchain based access control systems: State of the art and challenges,accepted in IEEE/WIC/ACM International Conference on Web Intelligence,,10.1145/3350546.3352561,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Access to the system resources. The current access control systems face many
problems, such as the presence of the third-party, inefficiency, and lack of
privacy. These problems can be addressed by blockchain, the technology that
received major attention in recent years and has many potentials. In this
study, we overview the problems of the current access control systems, and
then, we explain how blockchain can help to solve them. We also present an
overview of access control studies and proposed platforms in different domains.
This paper presents the state of the art and the challenges of blockchain-based
access control systems.
","[{'version': 'v1', 'created': 'Thu, 22 Aug 2019 17:21:43 GMT'}]",2019-08-23,"[['Rouhani', 'Sara', ''], ['Deters', 'Ralph', '']]","['blockchain', 'access control', 'distributed', 'privacy']"
10373,1711.11550,Kevin Carlberg,"Kevin Carlberg, Youngsoo Choi, Syuzanna Sargsyan",Conservative model reduction for finite-volume models,Submitted of Journal of Computational Physics,,10.1016/j.jcp.2018.05.019,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work proposes a method for model reduction of finite-volume models that
guarantees the resulting reduced-order model is conservative, thereby
preserving the structure intrinsic to finite-volume discretizations. The
proposed reduced-order models associate with optimization problems
characterized by a minimum-residual objective function and nonlinear equality
constraints that explicitly enforce conservation over subdomains. Conservative
Galerkin projection arises from formulating this optimization problem at the
time-continuous level, while conservative least-squares Petrov--Galerkin (LSPG)
projection associates with a time-discrete formulation. We equip these
approaches with hyper-reduction techniques in the case of nonlinear flux and
source terms, and also provide approaches for handling infeasibility. In
addition, we perform analyses that include deriving conditions under which
conservative Galerkin and conservative LSPG are equivalent, as well as deriving
a posteriori error bounds. Numerical experiments performed on a parameterized
quasi-1D Euler equation demonstrate the ability of the proposed method to
ensure not only global conservation, but also significantly lower state-space
errors than nonconservative reduced-order models such as standard Galerkin and
LSPG projection.
","[{'version': 'v1', 'created': 'Thu, 30 Nov 2017 18:12:50 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Dec 2017 19:05:59 GMT'}, {'version': 'v3', 'created': 'Tue, 27 Mar 2018 16:36:53 GMT'}]",2018-07-04,"[['Carlberg', 'Kevin', ''], ['Choi', 'Youngsoo', ''], ['Sargsyan', 'Syuzanna', '']]","['nonlinear model reduction', 'structure preservation', 'finite-volume method', 'Galerkin projection', 'least-squares Petrov–Galerkin projection', 'conservative schemes']"
10374,2208.13215,Dhasarathy Parthasarathy,"Dhasarathy Parthasarathy, Cecilia Ekelin, Anjali Karri, Jiapeng Sun,
  Panagiotis Moraitis","Measuring design compliance using neural language models -- an
  automotive case study",To appear in PROMISE '22,,10.1145/3558489.3559067,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As the modern vehicle becomes more software-defined, it is beginning to take
significant effort to avoid serious regression in software design. This is
because automotive software architects rely largely upon manual review of code
to spot deviations from specified design principles. Such an approach is both
inefficient and prone to error. In recent days, neural language models
pre-trained on source code are beginning to be used for automating a variety of
programming tasks. In this work, we extend the application of such a
Programming Language Model (PLM) to automate the assessment of design
compliance. Using a PLM, we construct a system that assesses whether a set of
query programs comply with Controller-Handler, a design pattern specified to
ensure hardware abstraction in automotive control software. The assessment is
based upon measuring whether the geometrical arrangement of query program
embeddings, extracted from the PLM, aligns with that of a set of known
implementations of the pattern. The level of alignment is then transformed into
an interpretable measure of compliance. Using a controlled experiment, we
demonstrate that our technique determines compliance with a precision of 92%.
Also, using expert review to calibrate the automated assessment, we introduce a
protocol to determine the nature of the violation, helping eventual
refactoring. Results from this work indicate that neural language models can
provide valuable assistance to human architects in assessing and fixing
violations in automotive software design.
","[{'version': 'v1', 'created': 'Sun, 28 Aug 2022 13:03:06 GMT'}]",2022-08-30,"[['Parthasarathy', 'Dhasarathy', ''], ['Ekelin', 'Cecilia', ''], ['Karri', 'Anjali', ''], ['Sun', 'Jiapeng', ''], ['Moraitis', 'Panagiotis', '']]","['neural programming language models', 'language model evaluation', 'software design patterns']"
10375,2006.08498,Edoardo di Napoli,"Xiao Zhang (1), Sebastian Achilles (2 and 3), Jan Winkelmann (3),
  Roland Haas (1), Andr\'e Schleife (1) and Edoardo Di Napoli (2) ((1)
  University of Illinois at Urbana-Champaign, (2) Forschungszentrum J\""ulich,
  (3) RWTH Aachen University)",Solving the Bethe-Salpeter equation on massively parallel architectures,"17 Pages plus 7 pages of supplemental information, 6 figures and 3
  tables. To be submitted to Computer Physics Communications",,10.1016/j.cpc.2021.108081,,cs.CE cs.DC physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The last ten years have witnessed fast spreading of massively parallel
computing clusters, from leading supercomputing facilities down to the average
university computing center. Many companies in the private sector have
undergone a similar evolution. In this scenario, the seamless integration of
software and middleware libraries is a key ingredient to ensure portability of
scientific codes and guarantees them an extended lifetime. In this work, we
describe the integration of the ChASE library, a modern parallel eigensolver,
into an existing legacy code for the first-principles computation of optical
properties of materials via solution of the Bethe-Salpeter equation for the
optical polarization function. Our numerical tests show that, as a result of
integrating ChASE and parallelizing the reading routine, the code experiences a
remarkable speedup and greatly improved scaling behavior on both multi- and
many-core architectures. We demonstrate that such a modernized BSE code will,
by fully exploiting parallel computing architectures and file systems, enable
domain scientists to accurately study complex material systems that were not
accessible before.
","[{'version': 'v1', 'created': 'Mon, 15 Jun 2020 15:55:52 GMT'}]",2021-07-28,"[['Zhang', 'Xiao', '', '2 and 3'], ['Achilles', 'Sebastian', '', '2 and 3'], ['Winkelmann', 'Jan', ''], ['Haas', 'Roland', ''], ['Schleife', 'André', ''], ['Di Napoli', 'Edoardo', '']]","['Eigensolver', 'exciton Hamiltonian', 'parallel computing', 'high-performance computing', 'codemodernization']"
10376,2001.09896,Vinicius Carid\'a,"Amir Jalilifard, Vinicius F. Carid\'a, Alex F. Mansano, Rogers S.
  Cristo, Felipe Penhorate C. da Fonseca",Semantic Sensitive TF-IDF to Determine Word Relevance in Documents,"11 pages, 2 figures, 22 references",,10.1007/978-981-33-6977-1,,cs.IR cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Keyword extraction has received an increasing attention as an important
research topic which can lead to have advancements in diverse applications such
as document context categorization, text indexing and document classification.
In this paper we propose STF-IDF, a novel semantic method based on TF-IDF, for
scoring word importance of informal documents in a corpus. A set of nearly four
million documents from health-care social media was collected and was trained
in order to draw semantic model and to find the word embeddings. Then, the
features of semantic space were utilized to rearrange the original TF-IDF
scores through an iterative solution so as to improve the moderate performance
of this algorithm on informal texts. After testing the proposed method with 200
randomly chosen documents, our method managed to decrease the TF-IDF mean error
rate by a factor of 50% and reaching the mean error of 13.7%, as opposed to
27.2% of the original TF-IDF.
","[{'version': 'v1', 'created': 'Mon, 6 Jan 2020 00:23:11 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Jan 2021 23:52:07 GMT'}]",2021-01-27,"[['Jalilifard', 'Amir', ''], ['Caridá', 'Vinicius F.', ''], ['Mansano', 'Alex F.', ''], ['Cristo', 'Rogers S.', ''], ['da Fonseca', 'Felipe Penhorate C.', '']]","['Semantic sensitive TF-IDF', 'Keyword extraction', 'word relevance', 'semantic similarity', 'TF-IDF']"
10377,2201.04618,Lutz Bornmann Dr.,Lutz Bornmann and Robin Haunschild,"Empirical analysis of recent temporal dynamics of research fields:
  Annual publications in chemistry and related areas as an example",,"Journal of Informetrics, 2022",10.1016/j.joi.2022.101253,,cs.DL stat.ME,http://creativecommons.org/licenses/by/4.0/,"  Changes in the number of publications in a certain field might reflect the
dynamic of scientific progress in this field, since an increase in the number
of publications can be interpreted as an increase in the field-specific
knowledge. In this paper, we present a methodological approach to analyse the
dynamics of science on lower aggregation levels, i.e., the level of research
fields. Our trend analysis approach is able to uncover very recent trends, and
the methods used to study the trends are simple to understand for the possible
recipients of the results. In order to demonstrate the trend analysis approach,
we focused in this study on the annual number of publications (and patents) in
chemistry (and related areas) between 2014 and 2020 identifying those fields in
chemistry with the highest dynamics (largest rates of change in publication
counts). The study is based on the mono-disciplinary literature database
CAplus. Our results reveal that the number of publications in the CAplus
database is increasing since many years. Research regarding optical phenomena
and electrochemical technologies was found to be among the emerging topics in
recent years.
","[{'version': 'v1', 'created': 'Wed, 12 Jan 2022 18:53:15 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Aug 2022 14:54:02 GMT'}]",2022-08-31,"[['Bornmann', 'Lutz', ''], ['Haunschild', 'Robin', '']]","['scientometrics', 'bibliometrics', 'dynamics of research fields', 'chemistry', 'CA sections', 'CAplus']"
10378,2209.08217,Haipeng Liu,"Haipeng Liu, Yang Wang, Meng Wang, Yong Rui",Delving Globally into Texture and Structure for Image Inpainting,"9 pages, 10 figures, accepted by ACM Multimedia 2022",,10.1145/3503161.3548265,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image inpainting has achieved remarkable progress and inspired abundant
methods, where the critical bottleneck is identified as how to fulfill the
high-frequency structure and low-frequency texture information on the masked
regions with semantics. To this end, deep models exhibit powerful superiority
to capture them, yet constrained on the local spatial regions. In this paper,
we delve globally into texture and structure information to well capture the
semantics for image inpainting. As opposed to the existing arts trapped on the
independent local patches, the texture information of each patch is
reconstructed from all other patches across the whole image, to match the
coarsely filled information, specially the structure information over the
masked regions. Unlike the current decoder-only transformer within the pixel
level for image inpainting, our model adopts the transformer pipeline paired
with both encoder and decoder. On one hand, the encoder captures the texture
semantic correlations of all patches across image via self-attention module. On
the other hand, an adaptive patch vocabulary is dynamically established in the
decoder for the filled patches over the masked regions. Building on this, a
structure-texture matching attention module anchored on the known regions comes
up to marry the best of these two worlds for progressive inpainting via a
probabilistic diffusion process. Our model is orthogonal to the fashionable
arts, such as Convolutional Neural Networks (CNNs), Attention and Transformer
model, from the perspective of texture and structure information for image
inpainting. The extensive experiments over the benchmarks validate its
superiority. Our code is available at
https://github.com/htyjers/DGTS-Inpainting.
","[{'version': 'v1', 'created': 'Sat, 17 Sep 2022 02:19:26 GMT'}]",2022-09-20,"[['Liu', 'Haipeng', ''], ['Wang', 'Yang', ''], ['Wang', 'Meng', ''], ['Rui', 'Yong', '']]","['Image inpainting', 'Global texture reference', 'Transformer']"
10379,2112.10063,Guansong Pang,"Rongrong Ma, Guansong Pang, Ling Chen, Anton van den Hengel",Deep Graph-level Anomaly Detection by Glocal Knowledge Distillation,Accepted to WSDM 2022,,10.1145/3488560.3498473,,cs.CV cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph-level anomaly detection (GAD) describes the problem of detecting graphs
that are abnormal in their structure and/or the features of their nodes, as
compared to other graphs. One of the challenges in GAD is to devise graph
representations that enable the detection of both locally- and
globally-anomalous graphs, i.e., graphs that are abnormal in their fine-grained
(node-level) or holistic (graph-level) properties, respectively. To tackle this
challenge we introduce a novel deep anomaly detection approach for GAD that
learns rich global and local normal pattern information by joint random
distillation of graph and node representations. The random distillation is
achieved by training one GNN to predict another GNN with randomly initialized
network weights. Extensive experiments on 16 real-world graph datasets from
diverse domains show that our model significantly outperforms seven
state-of-the-art models. Code and datasets are available at
https://git.io/GLocalKD.
","[{'version': 'v1', 'created': 'Sun, 19 Dec 2021 05:04:53 GMT'}]",2021-12-21,"[['Ma', 'Rongrong', ''], ['Pang', 'Guansong', ''], ['Chen', 'Ling', ''], ['Hengel', 'Anton van den', '']]","['Graph-level anomaly detection', 'Graph neural networks', 'Knowledgedistillation', 'Deep learning']"
10380,2107.08217,Joseph Chow,"Qi Liu, Joseph Y. J. Chow","A congested schedule-based dynamic transit passenger flow estimator
  using stop count data",,Transportmetrica B: Transport Dynamics (2022),10.1080/21680566.2022.2060370,,cs.CY math.OC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A dynamic transit flow estimation model based on congested schedule-based
transit equilibrium assignment is proposed using observations from stop count
data. A solution algorithm is proposed for the mathematical program with
schedule-based transit equilibrium constraints (MPEC) with polynomial
computational complexity. The equilibrium constraints corresponding to the
schedule-based hyperpath flow are modified from the literature to fit into an
estimation problem. Computational experiments are conducted first to verify the
methodology with two synthetic data sets (one of which is Sioux Falls),
followed by a validation of the method using bus data from Qingpu District in
Shanghai, China, with 4 bus lines, 120 segments, 55 bus stops, and 120
one-minute intervals. The estimation model converged to 0.005 tolerance of
relative change in 10 iterations. The estimated average of segment flows are
only 2.5% off from the average of the observed segment flows; relative errors
among segments are 42.5%.
","[{'version': 'v1', 'created': 'Sat, 17 Jul 2021 10:52:57 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Aug 2021 16:04:51 GMT'}]",2022-09-14,"[['Liu', 'Qi', ''], ['Chow', 'Joseph Y. J.', '']]","['public transit', 'flow estimation', 'OD estimation', 'schedule-based assignment', 'MPEC']"
10381,2005.02022,Jessica Cauchard,"Anna Wojciechowska, Foad Hamidi, Andr\'es Lucero, Jessica R. Cauchard","Chasing Lions: Co-Designing Human-Drone Interaction in Sub-Saharan
  Africa","To be published in the ACM conference on Designing Interactive
  Systems (DIS '20)",,10.1145/3357236.3395481,,cs.HC cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Drones are an exciting technology that is quickly being adopted in the global
consumer market. Africa has become a center of deployment with the first drone
airport established in Rwanda and drones currently being used for applications
such as medical deliveries, agriculture, and wildlife monitoring. Despite this
increasing presence of drones, there is a lack of research on stakeholders'
perspectives from this region. We ran a human-drone interaction user study
(N=15) with experts from several sub-Saharan countries using a co-design
methodology. Participants described novel applications and identified important
design aspects for the integration of drones in this context. Our results
highlight the potential of drones to address real world problems, the need for
them to be culturally situated, and the importance of considering the social
aspects of their interaction with humans. This research highlights the need for
diverse perspectives in the human-drone interaction design process.
","[{'version': 'v1', 'created': 'Tue, 5 May 2020 09:33:41 GMT'}, {'version': 'v2', 'created': 'Sun, 17 May 2020 13:53:55 GMT'}]",2020-05-19,"[['Wojciechowska', 'Anna', ''], ['Hamidi', 'Foad', ''], ['Lucero', 'Andrés', ''], ['Cauchard', 'Jessica R.', '']]","['Human-Drone Interaction', 'Co-Design', 'HCI4D', 'SocialRobotics', 'Drone', 'UAV', 'Design']"
10382,1904.09108,Eric Laporte,"Maria Jos\'e Finatto (UFRGS), Oto Vale (UFSCar), Eric Laporte (LIGM)","Recognizing the vocabulary of Brazilian popular newspapers with a
  free-access computational dictionary","English version, p. 67-85. Vers{\~a}o em portugu{\^e}s, p. 63-80","Alfa Revista de Linguistica, 2019, 63 (1), pp.67-85",10.1590/1981-5794-1904-3,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We report an experiment to check the identification of a set of words in
popular written Portuguese with two versions of a computational dictionary of
Brazilian Portuguese, DELAF PB 2004 and DELAF PB 2015. This dictionary is
freely available for use in linguistic analyses of Brazilian Portuguese and
other researches, which justifies critical study. The vocabulary comes from the
PorPopular corpus, made of popular newspapers Di{\'a}rio Ga{\'u}cho (DG) and
Massa! (MA). From DG, we retained a set of texts with 984.465 words (tokens),
published in 2008, with the spelling used before the Portuguese Language
Orthographic Agreement adopted in 2009. From MA, we examined papers of 2012,
2014 e 2015, with 215.776 words (tokens), all with the new spelling. The
checking involved: a) generating lists of words (types) occurring in DG and MA;
b) comparing them with the entry lists of both versions of DELAF PB; c)
assessing the coverage of this vocabulary; d) proposing ways of incorporating
the items not covered. The results of the work show that an average of 19% of
the types in DG were not found in DELAF PB 2004 or 2015. In MA, this average is
13%. Switching versions of the dictionary affected slightly the performance in
recognizing the words.
","[{'version': 'v1', 'created': 'Fri, 19 Apr 2019 07:59:25 GMT'}]",2019-04-22,"[['Finatto', 'Maria José', '', 'UFRGS'], ['Vale', 'Oto', '', 'UFSCar'], ['Laporte', 'Eric', '', 'LIGM']]","['Popular newspapers', 'Lexis', 'Vocabulary', 'NLP dictionary', 'Lexical coverage', 'Word recognition', 'Brazilian Portuguese']"
10383,2009.06704,Alberto Nogales,"Alberto Nogales, Rodrigo D\'iaz Mor\'on, \'Alvaro J. Garc\'ia-Tejedor","Food safety risk prediction with Deep Learning models using categorical
  embeddings on European Union data","20 pages,8 figures, 15 tables",,10.1016/j.foodcont.2021.108697,,cs.LG cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The world is becoming more globalized every day and people can buy products
from almost every country in the world in their local stores. Given the
different food and feed safety laws from country to country, the European Union
began to register in 1977 all irregularities related to traded products to
ensure cross-border monitoring of information and a quick reaction when risks
to public health are detected in the food chain. This information has also an
enormous potential as a preventive tool, in order to warn actors involved in
food safety and optimize their resources. In this paper, a set of data related
to food issues was scraped and analysed with Machine Learning techniques to
predict some features of future notifications, so that pre-emptive measures can
be taken. The novelty of the work relies on two points: the use of categorical
embeddings with Deep Learning models (Multilayer Perceptron and 1-Dimension
Convolutional Neural Networks) and its application to solve the problem of
predicting food issues in the European Union. The models allow several features
to be predicted: product category, hazard category and finally the proper
action to be taken. Results show that the system can predict these features
with an accuracy ranging from 74.08% to 93.06%.
","[{'version': 'v1', 'created': 'Mon, 14 Sep 2020 19:36:58 GMT'}]",2022-02-16,"[['Nogales', 'Alberto', ''], ['Morón', 'Rodrigo Díaz', ''], ['García-Tejedor', 'Álvaro J.', '']]","['Food and Feed Safety', 'Deep Learning', 'Categorical embedding', 'Prediction']"
10384,2012.05582,Radu Horaud P,"Yves Dufournaud, Cordelia Schmid, and Radu Horaud",Image Matching with Scale Adjustment,,"Computer Vision and Image Understanding, volume 93, 2004",10.1016/j.cviu.2003.07.003,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  In this paper we address the problem of matching two images with two
different resolutions: a high-resolution image and a low-resolution one. The
difference in resolution between the two images is not known and without loss
of generality one of the images is assumed to be the high-resolution one. On
the premise that changes in resolution act as a smoothing equivalent to changes
in scale, a scale-space representation of the high-resolution image is
produced. Hence the one-to-one classical image matching paradigm becomes
one-to-many because the low-resolution image is compared with all the
scale-space representations of the high-resolution one. Key to the success of
such a process is the proper representation of the features to be matched in
scale-space. We show how to represent and extract interest points at variable
scales and we devise a method allowing the comparison of two images at two
different resolutions. The method comprises the use of photometric- and
rotation-invariant descriptors, a geometric model mapping the high-resolution
image onto a low-resolution image region, and an image matching strategy based
on local constraints and on the robust estimation of this geometric model.
Extensive experiments show that our matching method can be used for scale
changes up to a factor of 6.
","[{'version': 'v1', 'created': 'Thu, 10 Dec 2020 11:03:25 GMT'}]",2020-12-11,"[['Dufournaud', 'Yves', ''], ['Schmid', 'Cordelia', ''], ['Horaud', 'Radu', '']]","['image matching', 'scale-space', 'points of interest', 'matching constraints', 'rotation-invariant descriptors']"
10385,1708.02052,Fabrizio Pastore,"Fabrizio Pastore, Leonardo Mariani",VART: A Tool for the Automatic Detection of Regression Faults,,,10.1145/3106237.3122819,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present VART, a tool for automatically revealing regression
faults missed by regression test suites. Interestingly, VART is not limited to
faults causing crashing or exceptions, but can reveal faults that cause the
violation of application-specific correctness properties. VART achieves this
goal by combining static and dynamic program analysis.
","[{'version': 'v1', 'created': 'Mon, 7 Aug 2017 09:43:54 GMT'}]",2017-08-08,"[['Pastore', 'Fabrizio', ''], ['Mariani', 'Leonardo', '']]","['Regression testing', 'dynamic analysis', 'static analysis']"
10386,1904.08383,Tamara Radivilova A,"Tamara Radivilova and Lyudmyla Kirichenko and Dmytro Ageyev and Maxim
  Tawalbeh and Vitalii Bulakh",Decrypting SSL/TLS traffic for hidden threats detection,"4 pages, 1 table, 1 figure","2018 IEEE 9th International Conference on Dependable Systems,
  Services and Technologies (DESSERT)",10.1109/DESSERT.2018.8409116,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents an analysis of the main mechanisms of decryption of
SSL/TLS traffic. Methods and technologies for detecting malicious activity in
encrypted traffic that are used by leading companies are also considered. Also,
the approach for intercepting and decrypting traffic transmitted over SSL/TLS
is developed, tested and proposed. The developed approach has been automated
and can be used for remote listening of the network, which will allow to
decrypt transmitted data in a mode close to real time.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2019 11:39:32 GMT'}]",2019-04-18,"[['Radivilova', 'Tamara', ''], ['Kirichenko', 'Lyudmyla', ''], ['Ageyev', 'Dmytro', ''], ['Tawalbeh', 'Maxim', ''], ['Bulakh', 'Vitalii', '']]","['SSL/TLS protocol', 'vulnerability', 'attacks', 'network intrusion detection system', 'decryption approach']"
10387,2210.08274,Xixi Wu,"Xixi Wu, Yun Xiong, Yao Zhang, Yizhu Jiao, Caihua Shan, Yiheng Sun,
  Yangyong Zhu, and Philip S. Yu",CLARE: A Semi-supervised Community Detection Algorithm,Accepted by KDD'2022,,10.1145/3534678.3539370,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Community detection refers to the task of discovering closely related
subgraphs to understand the networks. However, traditional community detection
algorithms fail to pinpoint a particular kind of community. This limits its
applicability in real-world networks, e.g., distinguishing fraud groups from
normal ones in transaction networks. Recently, semi-supervised community
detection emerges as a solution. It aims to seek other similar communities in
the network with few labeled communities as training data. Existing works can
be regarded as seed-based: locate seed nodes and then develop communities
around seeds. However, these methods are quite sensitive to the quality of
selected seeds since communities generated around a mis-detected seed may be
irrelevant. Besides, they have individual issues, e.g., inflexibility and high
computational overhead. To address these issues, we propose CLARE, which
consists of two key components, Community Locator and Community Rewriter. Our
idea is that we can locate potential communities and then refine them.
Therefore, the community locator is proposed for quickly locating potential
communities by seeking subgraphs that are similar to training ones in the
network. To further adjust these located communities, we devise the community
rewriter. Enhanced by deep reinforcement learning, it suggests intelligent
decisions, such as adding or dropping nodes, to refine community structures
flexibly. Extensive experiments verify both the effectiveness and efficiency of
our work compared with prior state-of-the-art approaches on multiple real-world
datasets.
","[{'version': 'v1', 'created': 'Sat, 15 Oct 2022 12:37:46 GMT'}]",2022-10-18,"[['Wu', 'Xixi', ''], ['Xiong', 'Yun', ''], ['Zhang', 'Yao', ''], ['Jiao', 'Yizhu', ''], ['Shan', 'Caihua', ''], ['Sun', 'Yiheng', ''], ['Zhu', 'Yangyong', ''], ['Yu', 'Philip S.', '']]","['semi-supervised community detection', 'subgraph matching', 'reinforcement learning']"
10388,1910.10187,Robert Grupp,"Robert Grupp, Ryan Murphy, Rachel Hegeman, Clayton Alexander, Mathias
  Unberath, Yoshito Otake, Benjamin McArthur, Mehran Armand, Russell Taylor","Fast and Automatic Periacetabular Osteotomy Fragment Pose Estimation
  Using Intraoperatively Implanted Fiducials and Single-View Fluoroscopy","Revised article to address reviewer comments. Under review for
  Physics in Medicine and Biology. Supplementary video at
  https://youtu.be/0E0U9G81q8g",2020 Phys. Med. Biol. 65 245019,10.1088/1361-6560/aba089,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate and consistent mental interpretation of fluoroscopy to determine the
position and orientation of acetabular bone fragments in 3D space is difficult.
We propose a computer assisted approach that uses a single fluoroscopic view
and quickly reports the pose of an acetabular fragment without any user input
or initialization. Intraoperatively, but prior to any osteotomies, two
constellations of metallic ball-bearings (BBs) are injected into the wing of a
patient's ilium and lateral superior pubic ramus. One constellation is located
on the expected acetabular fragment, and the other is located on the remaining,
larger, pelvis fragment. The 3D locations of each BB are reconstructed using
three fluoroscopic views and 2D/3D registrations to a preoperative CT scan of
the pelvis. The relative pose of the fragment is established by estimating the
movement of the two BB constellations using a single fluoroscopic view taken
after osteotomy and fragment relocation. BB detection and inter-view
correspondences are automatically computed throughout the processing pipeline.
The proposed method was evaluated on a multitude of fluoroscopic images
collected from six cadaveric surgeries performed bilaterally on three
specimens. Mean fragment rotation error was 2.4 +/- 1.0 degrees, mean
translation error was 2.1 +/- 0.6 mm, and mean 3D lateral center edge angle
error was 1.0 +/- 0.5 degrees. The average runtime of the single-view pose
estimation was 0.7 +/- 0.2 seconds. The proposed method demonstrates accuracy
similar to other state of the art systems which require optical tracking
systems or multiple-view 2D/3D registrations with manual input. The errors
reported on fragment poses and lateral center edge angles are within the
margins required for accurate intraoperative evaluation of femoral head
coverage.
","[{'version': 'v1', 'created': 'Tue, 22 Oct 2019 18:15:44 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Mar 2020 14:56:53 GMT'}, {'version': 'v3', 'created': 'Fri, 12 Jun 2020 19:47:18 GMT'}]",2021-02-25,"[['Grupp', 'Robert', ''], ['Murphy', 'Ryan', ''], ['Hegeman', 'Rachel', ''], ['Alexander', 'Clayton', ''], ['Unberath', 'Mathias', ''], ['Otake', 'Yoshito', ''], ['McArthur', 'Benjamin', ''], ['Armand', 'Mehran', ''], ['Taylor', 'Russell', '']]","['Periacetabular Osteotomy', '2D/3D Registration', 'Computer Assisted Surgery', 'X-rayNavigation', 'Orthopaedics']"
10389,2104.04685,Andreea Danielescu,"Andreea Danielescu, David Piorkowski","Iterative Design of Gestures During Elicitation: Understanding the Role
  of Increased Production",25 pages,,10.1145/3491102.3501962,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Previous gesture elicitation studies have found that user proposals are
influenced by legacy bias which may inhibit users from proposing gestures that
are most appropriate for an interaction. Increasing production during
elicitation studies has shown promise moving users beyond legacy gestures.
However, variety decreases as more symbols are produced. While several studies
have used increased production since its introduction, little research has
focused on understanding the effect on the proposed gesture quality, on why
variety decreases, and on whether increased production should be limited. In
this paper, we present a gesture elicitation study aimed at understanding the
impact of increased production. We show that users refine the most promising
gestures and that how long it takes to find promising gestures varies by
participant. We also show that gestural refinements provide insight into the
gestural features that matter for users to assign semantic meaning and discuss
implications for training gesture classifiers.
","[{'version': 'v1', 'created': 'Sat, 10 Apr 2021 05:26:43 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Jan 2022 16:12:32 GMT'}]",2022-01-05,"[['Danielescu', 'Andreea', ''], ['Piorkowski', 'David', '']]","['Gesture elicitation', 'user’s mental models', 'full-body gestures', 'free-space gestures', 'walk-up-and-use displays', 'public displays', 'fatigue']"
10390,2208.06709,Xinyue Pan,Xinyue Pan and Jiangpeng He and Andrew Peng and Fengqing Zhu,"Simulating Personal Food Consumption Patterns using a Modified Markov
  Chain","9 pages, 6 figures,In Proceedings of the 7th International Workshop
  on Multimedia Assisted Dietary Management (MADiMa 22)",,10.1145/3552484.3555747,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Food image classification serves as the foundation of image-based dietary
assessment to predict food categories. Since there are many different food
classes in real life, conventional models cannot achieve sufficiently high
accuracy. Personalized classifiers aim to largely improve the accuracy of food
image classification for each individual. However, a lack of public personal
food consumption data proves to be a challenge for training such models. To
address this issue, we propose a novel framework to simulate personal food
consumption data patterns, leveraging the use of a modified Markov chain model
and self-supervised learning. Our method is capable of creating an accurate
future data pattern from a limited amount of initial data, and our simulated
data patterns can be closely correlated with the initial data pattern.
Furthermore, we use Dynamic Time Warping distance and Kullback-Leibler
divergence as metrics to evaluate the effectiveness of our method on the public
Food-101 dataset. Our experimental results demonstrate promising performance
compared with random simulation and the original Markov chain method.
","[{'version': 'v1', 'created': 'Sat, 13 Aug 2022 18:50:23 GMT'}]",2022-08-16,"[['Pan', 'Xinyue', ''], ['He', 'Jiangpeng', ''], ['Peng', 'Andrew', ''], ['Zhu', 'Fengqing', '']]","['Food Image Classification', 'Personalized Classifier', 'Image Clustering']"
10391,2101.04030,Seba Susan,"Ritam Mallick, Seba Susan, Vaibhaw Agrawal, Rizul Garg, Prateek Rawal","Context- and Sequence-Aware Convolutional Recurrent Encoder for Neural
  Machine Translation",Accepted in 36th ACM/SIGAPP Symposium On Applied Computing 2021,,10.1145/3412841.3442099,,cs.CL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Neural Machine Translation model is a sequence-to-sequence converter based on
neural networks. Existing models use recurrent neural networks to construct
both the encoder and decoder modules. In alternative research, the recurrent
networks were substituted by convolutional neural networks for capturing the
syntactic structure in the input sentence and decreasing the processing time.
We incorporate the goodness of both approaches by proposing a
convolutional-recurrent encoder for capturing the context information as well
as the sequential information from the source sentence. Word embedding and
position embedding of the source sentence is performed prior to the
convolutional encoding layer which is basically a n-gram feature extractor
capturing phrase-level context information. The rectified output of the
convolutional encoding layer is added to the original embedding vector, and the
sum is normalized by layer normalization. The normalized output is given as a
sequential input to the recurrent encoding layer that captures the temporal
information in the sequence. For the decoder, we use the attention-based
recurrent neural network. Translation task on the German-English dataset
verifies the efficacy of the proposed approach from the higher BLEU scores
achieved as compared to the state of the art.
","[{'version': 'v1', 'created': 'Mon, 11 Jan 2021 17:03:52 GMT'}, {'version': 'v2', 'created': 'Sun, 21 Mar 2021 07:55:51 GMT'}]",2021-05-04,"[['Mallick', 'Ritam', ''], ['Susan', 'Seba', ''], ['Agrawal', 'Vaibhaw', ''], ['Garg', 'Rizul', ''], ['Rawal', 'Prateek', '']]","['Neural machine translation', 'convolutional', 'recurrent', 'encoder', 'decoder', 'context', 'sequence-to-sequence model']"
10392,2109.13452,Alexander Zech,Alexander Zech and Timur Bazhirov,"CateCom: a practical data-centric approach to categorization of
  computational models","21 pages, 4 figures, 2 tables",,10.1021/acs.jcim.2c00112,,cs.DB cond-mat.mtrl-sci cs.CE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The advent of data-driven science in the 21st century brought about the need
for well-organized structured data and associated infrastructure able to
facilitate the applications of Artificial Intelligence and Machine Learning. We
present an effort aimed at organizing the diverse landscape of physics-based
and data-driven computational models in order to facilitate the storage of
associated information as structured data. We apply object-oriented design
concepts and outline the foundations of an open-source collaborative framework
that is: (1) capable of uniquely describing the approaches in structured data,
(2) flexible enough to cover the majority of widely used models, and (3)
utilizes collective intelligence through community contributions. We present
example database schemas and corresponding data structures and explain how
these are deployed in software at the time of this writing.
","[{'version': 'v1', 'created': 'Tue, 28 Sep 2021 02:59:40 GMT'}]",2022-03-03,"[['Zech', 'Alexander', ''], ['Bazhirov', 'Timur', '']]","['data structures', 'data standards', 'artificial intelligence', 'machine learning']"
10393,1904.11711,Davood Zabihzadeh,"Sumia Abdulhussien Razooqi Al-Obaidi, Davood Zabihzadeh, and Hamideh
  Hajiabadi",Robust Metric Learning based on the Rescaled Hinge Loss,,"Robust metric learning based on the rescaled hinge loss.
  International Journal of Machine Learning and Cybernetics 11 (2020):
  2515-2528",10.1007/s13042-020-01137-z,https://link.springer.com/article/10.1007/s13042-020-01137-z,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distance/Similarity learning is a fundamental problem in machine learning.
For example, kNN classifier or clustering methods are based on a
distance/similarity measure. Metric learning algorithms enhance the efficiency
of these methods by learning an optimal distance function from data. Most
metric learning methods need training information in the form of pair or
triplet sets. Nowadays, this training information often is obtained from the
Internet via crowdsourcing methods. Therefore, this information may contain
label noise or outliers leading to the poor performance of the learned metric.
It is even possible that the learned metric functions perform worse than the
general metrics such as Euclidean distance. To address this challenge, this
paper presents a new robust metric learning method based on the Rescaled Hinge
loss. This loss function is a general case of the popular Hinge loss and
initially introduced in (Xu et al. 2017) to develop a new robust SVM algorithm.
In this paper, we formulate the metric learning problem using the Rescaled
Hinge loss function and then develop an efficient algorithm based on HQ
(Half-Quadratic) to solve the problem. Experimental results on a variety of
both real and synthetic datasets confirm that our new robust algorithm
considerably outperforms state-of-the-art metric learning methods in the
presence of label noise and outliers.
","[{'version': 'v1', 'created': 'Fri, 26 Apr 2019 08:20:59 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Jan 2020 14:36:54 GMT'}]",2021-08-13,"[['Al-Obaidi', 'Sumia Abdulhussien Razooqi', ''], ['Zabihzadeh', 'Davood', ''], ['Hajiabadi', 'Hamideh', '']]","['Metric Learning', 'Rescaled Hinge loss', 'Robust Algorithm', 'Label noise', 'Outlier', 'Half Quadratic (HQ) optimization']"
10394,2111.05412,Manuela Nayantara Jeyaraj,"Manuela Nayantara Jeyaraj, Dharshana Kasthurirathna","MNet-Sim: A Multi-layered Semantic Similarity Network to Evaluate
  Sentence Similarity",,"International Journal of Engineering Trends and Technology
  69.7(2021):181-189",10.14445/22315381/IJETT-V69I7P225,,cs.LG cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Similarity is a comparative-subjective measure that varies with the domain
within which it is considered. In several NLP applications such as document
classification, pattern recognition, chatbot question-answering, sentiment
analysis, etc., identifying an accurate similarity score for sentence pairs has
become a crucial area of research. In the existing models that assess
similarity, the limitation of effectively computing this similarity based on
contextual comparisons, the localization due to the centering theory, and the
lack of non-semantic textual comparisons have proven to be drawbacks. Hence,
this paper presents a multi-layered semantic similarity network model built
upon multiple similarity measures that render an overall sentence similarity
score based on the principles of Network Science, neighboring weighted
relational edges, and a proposed extended node similarity computation formula.
The proposed multi-layered network model was evaluated and tested against
established state-of-the-art models and is shown to have demonstrated better
performance scores in assessing sentence similarity.
","[{'version': 'v1', 'created': 'Tue, 9 Nov 2021 20:43:18 GMT'}]",2021-11-11,"[['Jeyaraj', 'Manuela Nayantara', ''], ['Kasthurirathna', 'Dharshana', '']]","['multi-layer network', 'network science', 'semantic similarity']"
10395,1910.13002,Jeroen Groen,"Jeroen Groen, Florian Stutz, Niels Aage, J. Andreas B{\ae}rentzen and
  Ole Sigmund",De-homogenization of optimal multi-scale 3D topologies,"Preprint submitted to Computer Methods in Applied Mechanics and
  Engineering",,10.1016/j.cma.2020.112979,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a highly efficient method to obtain high-resolution,
near-optimal 3D topologies optimized for minimum compliance on a standard PC.
Using an implicit geometry description we derive a single-scale interpretation
of optimal multi-scale designs on a very fine mesh (de-homogenization). By
performing homogenization-based topology optimization, optimal multi-scale
designs are obtained on a relatively coarse mesh resulting in a low
computational cost. As microstructure parameterization we use orthogonal rank-3
microstructures, which are known to be optimal for a single loading case.
Furthermore, a method to get explicit control of the minimum feature size and
complexity of the final shapes will be discussed. Numerical examples show
excellent performance of these fine-scale designs resulting in objective values
similar to the homogenization-based designs. Comparisons with well-established
density-based topology optimization methods show a reduction in computational
cost of 3 orders of magnitude, paving the way for giga-scale designs on a
standard PC.
","[{'version': 'v1', 'created': 'Mon, 28 Oct 2019 23:00:19 GMT'}]",2020-04-22,"[['Groen', 'Jeroen', ''], ['Stutz', 'Florian', ''], ['Aage', 'Niels', ''], ['Bærentzen', 'J. Andreas', ''], ['Sigmund', 'Ole', '']]","['optimal microstructures', 'giga-scale topology optimization', 'numerical efficiency', 'length-scaleenforcement', 'de-homogenization']"
10396,2006.11534,Hamid Zafar,"Hamid Zafar, Mohnish Dubey, Jens Lehmann, Elena Demidova","IQA: Interactive Query Construction in Semantic Question Answering
  Systems",,"Journal of Web Semantics Volume 64, October 2020, 100586",10.1016/j.websem.2020.100586,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semantic Question Answering (SQA) systems automatically interpret user
questions expressed in a natural language in terms of semantic queries. This
process involves uncertainty, such that the resulting queries do not always
accurately match the user intent, especially for more complex and less common
questions. In this article, we aim to empower users in guiding SQA systems
towards the intended semantic queries through interaction. We introduce IQA -
an interaction scheme for SQA pipelines. This scheme facilitates seamless
integration of user feedback in the question answering process and relies on
Option Gain - a novel metric that enables efficient and intuitive user
interaction. Our evaluation shows that using the proposed scheme, even a small
number of user interactions can lead to significant improvements in the
performance of SQA systems.
","[{'version': 'v1', 'created': 'Sat, 20 Jun 2020 10:02:20 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Jun 2020 07:41:43 GMT'}, {'version': 'v3', 'created': 'Thu, 25 Jun 2020 05:17:03 GMT'}]",2020-06-26,"[['Zafar', 'Hamid', ''], ['Dubey', 'Mohnish', ''], ['Lehmann', 'Jens', ''], ['Demidova', 'Elena', '']]","['User Interaction', 'Question Answering', 'Knowledge Graphs', 'Option Gain']"
10397,2206.07919,Stephen MacDonell,"Kwabena Ebo Bennin, Amjed Tahir, Stephen G. MacDonell, J\""urgen
  B\""orstler","An Empirical Study on the Effectiveness of Data Resampling Approaches
  for Cross-Project Software Defect Prediction","Journal article, 14 pages, 5 tables, 4 figures","An empirical study on the effectiveness of data resampling
  approaches for cross-project software defect prediction. IET Software.
  16(2)(2022), pp 185-199",10.1049/sfw2.12052,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crossp-roject defect prediction (CPDP), where data from different software
projects are used to predict defects, has been proposed as a way to provide
data for software projects that lack historical data. Evaluations of CPDP
models using the Nearest Neighbour (NN) Filter approach have shown promising
results in recent studies. A key challenge with defect-prediction datasets is
class imbalance, that is highly skewed datasets where non buggy modules
dominate the buggy modules. In the past, data resampling approaches have been
applied to within-projects defect prediction models to help alleviate the
negative effects of class imbalance in the datasets. To address the class
imbalance issue in CPDP, the authors assess the impact of data resampling
approaches on CPDP models after the NN Filter is applied. The impact on
prediction performance of five oversampling approaches (MAHAKIL, SMOTE,
Borderline-SMOTE, Random Oversampling, and ADASYN) and three undersampling
approaches (Random Undersampling, Tomek Links, and Onesided selection) is
investigated and results are compared to approaches without data resampling.
The authors' examined six defect prediction models on 34 datasets extracted
from the PROMISE repository. The authors results show that there is a
significant positive effect of data resampling on CPDP performance, suggesting
that software quality teams and researchers should consider applying data
resampling approaches for improved recall (pd) and g-measure prediction
performance. However if the goal is to improve precision and reduce false alarm
(pf) then data resampling approaches should be avoided.
","[{'version': 'v1', 'created': 'Thu, 16 Jun 2022 04:45:25 GMT'}]",2022-06-17,"[['Bennin', 'Kwabena Ebo', ''], ['Tahir', 'Amjed', ''], ['MacDonell', 'Stephen G.', ''], ['Börstler', 'Jürgen', '']]","['Class Imbalance', 'Defect Prediction', 'Software Metrics', 'Software Quality']"
10398,2101.03730,Jiakun Liu,"Jiakun Liu, Qiao Huang, Xin Xia, Emad Shihab, David Lo, Shanping Li","An Exploratory Study on the Introduction and Removal of Different Types
  of Technical Debt",,,10.1007/s10664-020-09917-5,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  To complete tasks faster, developers often have to sacrifice the quality of
the software. Such compromised practice results in the increasing burden to
developers in future development. The metaphor, technical debt, describes such
practice. Prior research has illustrated the negative impact of technical debt,
and many researchers investigated how developers deal with a certain type of
technical debt. However, few studies focused on the removal of different types
of technical debt in practice.
  To fill this gap, we use the introduction and removal of different types of
self-admitted technical debt (i.e., SATD) in 7 deep learning frameworks as an
example. This is because deep learning frameworks are some of the most
important software systems today due to their prevalent use in life-impacting
deep learning applications. Moreover, the field of the development of different
deep learning frameworks is the same, which enables us to find common behaviors
on the removal of different types of technical debt across projects. By mining
the file history of these frameworks, we find that design debt is introduced
the most along the development process. As for the removal of technical debt,
we find that requirement debt is removed the most, and design debt is removed
the fastest. Most of test debt, design debt, and requirement debt are removed
by the developers who introduced them. Based on the introduction and removal of
different types of technical debt, we discuss the evolution of the frequencies
of different types of technical debt to depict the unresolved sub-optimal
trade-offs or decisions that are confronted by developers along the development
process. We also discuss the removal patterns of different types of technical
debt, highlight future research directions, and provide recommendations for
practitioners.
","[{'version': 'v1', 'created': 'Mon, 11 Jan 2021 07:27:13 GMT'}]",2022-02-15,"[['Liu', 'Jiakun', ''], ['Huang', 'Qiao', ''], ['Xia', 'Xin', ''], ['Shihab', 'Emad', ''], ['Lo', 'David', ''], ['Li', 'Shanping', '']]","['Self-admitted Technical Debt', 'Deep Learning', 'Categorization', 'Empirical Study']"
10399,1805.00619,Tianchi Huang,"Tianchi Huang, Rui-Xiao Zhang, Chao Zhou, and Lifeng Sun","Delay-Constrained Rate Control for Real-Time Video Streaming with
  Bounded Neural Network",,,10.1145/3210445.3210446,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rate control is widely adopted during video streaming to provide both high
video qualities and low latency under various network conditions. However,
despite that many work have been proposed, they fail to tackle one major
problem: previous methods determine a future transmission rate as a single for
value which will be used in an entire time-slot, while real-world network
conditions, unlike lab setup, often suffer from rapid and stochastic changes,
resulting in the failures of predictions.
  In this paper, we propose a delay-constrained rate control approach based on
end-to-end deep learning. The proposed model predicts future bit rate not as a
single value, but as possible bit rate ranges using target delay gradient, with
which the transmission delay is guaranteed. We collect a large scale of
real-world live streaming data to train our model, and as a result, it
automatically learns the correlation between throughput and target delay
gradient. We build a testbed to evaluate our approach. Compared with the
state-of-the-art methods, our approach demonstrates a better performance in
bandwidth utilization. In all considered scenarios, a range based rate control
approach outperforms the one without range by 19% to 35% in average QoE
improvement.
","[{'version': 'v1', 'created': 'Wed, 2 May 2018 04:24:27 GMT'}]",2018-10-29,"[['Huang', 'Tianchi', ''], ['Zhang', 'Rui-Xiao', ''], ['Zhou', 'Chao', ''], ['Sun', 'Lifeng', '']]","['Real-time Video Streaming', 'Rate Control', 'Deep Learning', 'DelayConstrained']"
10400,2202.03984,Yue He,"Yue He, Zimu Wang, Peng Cui, Hao Zou, Yafeng Zhang, Qiang Cui, Yong
  Jiang","CausPref: Causal Preference Learning for Out-of-Distribution
  Recommendation",WWW '22: The ACM Web Conference Proceedings,,10.1145/3485447.3511969,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In spite of the tremendous development of recommender system owing to the
progressive capability of machine learning recently, the current recommender
system is still vulnerable to the distribution shift of users and items in
realistic scenarios, leading to the sharp decline of performance in testing
environments. It is even more severe in many common applications where only the
implicit feedback from sparse data is available. Hence, it is crucial to
promote the performance stability of recommendation method in different
environments. In this work, we first make a thorough analysis of implicit
recommendation problem from the viewpoint of out-of-distribution (OOD)
generalization. Then under the guidance of our theoretical analysis, we propose
to incorporate the recommendation-specific DAG learner into a novel causal
preference-based recommendation framework named CausPref, mainly consisting of
causal learning of invariant user preference and anti-preference negative
sampling to deal with implicit feedback. Extensive experimental results from
real-world datasets clearly demonstrate that our approach surpasses the
benchmark models significantly under types of out-of-distribution settings, and
show its impressive interpretability.
","[{'version': 'v1', 'created': 'Tue, 8 Feb 2022 16:42:03 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Feb 2022 04:06:02 GMT'}]",2022-02-10,"[['He', 'Yue', ''], ['Wang', 'Zimu', ''], ['Cui', 'Peng', ''], ['Zou', 'Hao', ''], ['Zhang', 'Yafeng', ''], ['Cui', 'Qiang', ''], ['Jiang', 'Yong', '']]","['out-of-distribution recommendation', 'stable recommender system', 'causal structure learning', 'user preference']"
10401,1909.01241,Chansup Byun,"Chansup Byun, Jeremy Kepner, William Arcand, David Bestor, Bill
  Bergeron, Vijay Gadepally, Michael Houle, Matthew Hubbell, Michael Jones,
  Anna Klein, Peter Michaleas, Julie Mullen, Andrew Prout, Antonio Rosa,
  Siddharth Samsi, Charles Yee, Albert Reuther",Large Scale Parallelization Using File-Based Communications,,,10.1109/HPEC.2019.8916221,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a novel and new file-based communication
architecture using the local filesystem for large scale parallelization. This
new approach eliminates the issues with filesystem overload and resource
contention when using the central filesystem for large parallel jobs. The new
approach incurs additional overhead due to inter-node message file transfers
when both the sending and receiving processes are not on the same node.
However, even with this additional overhead cost, its benefits are far greater
for the overall cluster operation in addition to the performance enhancement in
message communications for large scale parallel jobs. For example, when running
a 2048-process parallel job, it achieved about 34 times better performance with
MPI_Bcast() when using the local filesystem. Furthermore, since the security
for transferring message files is handled entirely by using the secure copy
protocol (scp) and the file system permissions, no additional security measures
or ports are required other than those that are typically required on an HPC
system.
","[{'version': 'v1', 'created': 'Tue, 3 Sep 2019 15:13:06 GMT'}]",2021-09-08,"[['Byun', 'Chansup', ''], ['Kepner', 'Jeremy', ''], ['Arcand', 'William', ''], ['Bestor', 'David', ''], ['Bergeron', 'Bill', ''], ['Gadepally', 'Vijay', ''], ['Houle', 'Michael', ''], ['Hubbell', 'Matthew', ''], ['Jones', 'Michael', ''], ['Klein', 'Anna', ''], ['Michaleas', 'Peter', ''], ['Mullen', 'Julie', ''], ['Prout', 'Andrew', ''], ['Rosa', 'Antonio', ''], ['Samsi', 'Siddharth', ''], ['Yee', 'Charles', ''], ['Reuther', 'Albert', '']]","['large scale', 'parallelization', 'file-based communication', 'scp', 'filesystem permission', 'security']"
10402,2205.14693,Xintong Yu,"Xintong Yu, Hongming Zhang, Ruixin Hong, Yangqiu Song, Changshui Zhang",VD-PCR: Improving Visual Dialog with Pronoun Coreference Resolution,"The manuscript version of the paper. The published version is
  available at https://doi.org/10.1016/j.patcog.2022.108540 . The data, code
  and models are available at: https://github.com/HKUST- KnowComp/VD-PCR","Pattern Recognition, 125, 108540 (2022)",10.1016/j.patcog.2022.108540,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The visual dialog task requires an AI agent to interact with humans in
multi-round dialogs based on a visual environment. As a common linguistic
phenomenon, pronouns are often used in dialogs to improve the communication
efficiency. As a result, resolving pronouns (i.e., grounding pronouns to the
noun phrases they refer to) is an essential step towards understanding dialogs.
In this paper, we propose VD-PCR, a novel framework to improve Visual Dialog
understanding with Pronoun Coreference Resolution in both implicit and explicit
ways. First, to implicitly help models understand pronouns, we design novel
methods to perform the joint training of the pronoun coreference resolution and
visual dialog tasks. Second, after observing that the coreference relationship
of pronouns and their referents indicates the relevance between dialog rounds,
we propose to explicitly prune the irrelevant history rounds in visual dialog
models' input. With pruned input, the models can focus on relevant dialog
history and ignore the distraction in the irrelevant one. With the proposed
implicit and explicit methods, VD-PCR achieves state-of-the-art experimental
results on the VisDial dataset.
","[{'version': 'v1', 'created': 'Sun, 29 May 2022 15:29:50 GMT'}]",2022-05-31,"[['Yu', 'Xintong', ''], ['Zhang', 'Hongming', ''], ['Hong', 'Ruixin', ''], ['Song', 'Yangqiu', ''], ['Zhang', 'Changshui', '']]","['Vision and Language', 'Visual Dialog', 'Pronoun Coreference Resolution']"
10403,2207.06414,Yuxi Liu,"Yuxi Liu, Zhenhao Zhang, Antonio Jimeno Yepes, Flora D. Salim","Modeling Long-term Dependencies and Short-term Correlations in Patient
  Journey Data with Temporal Attention Networks for Health Prediction","10 pages, 4 figures, accepted at ACM BCB 2022",,10.1145/3535508.3545535,,cs.LG cs.AI cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Building models for health prediction based on Electronic Health Records
(EHR) has become an active research area. EHR patient journey data consists of
patient time-ordered clinical events/visits from patients. Most existing
studies focus on modeling long-term dependencies between visits, without
explicitly taking short-term correlations between consecutive visits into
account, where irregular time intervals, incorporated as auxiliary information,
are fed into health prediction models to capture latent progressive patterns of
patient journeys. We present a novel deep neural network with four modules to
take into account the contributions of various variables for health prediction:
i) the Stacked Attention module strengthens the deep semantics in clinical
events within each patient journey and generates visit embeddings, ii) the
Short-Term Temporal Attention module models short-term correlations between
consecutive visit embeddings while capturing the impact of time intervals
within those visit embeddings, iii) the Long-Term Temporal Attention module
models long-term dependencies between visit embeddings while capturing the
impact of time intervals within those visit embeddings, iv) and finally, the
Coupled Attention module adaptively aggregates the outputs of Short-Term
Temporal Attention and Long-Term Temporal Attention modules to make health
predictions. Experimental results on MIMIC-III demonstrate superior predictive
accuracy of our model compared to existing state-of-the-art methods, as well as
the interpretability and robustness of this approach. Furthermore, we found
that modeling short-term correlations contributes to local priors generation,
leading to improved predictive modeling of patient journeys.
","[{'version': 'v1', 'created': 'Wed, 13 Jul 2022 09:15:26 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Jul 2022 06:38:06 GMT'}]",2022-07-18,"[['Liu', 'Yuxi', ''], ['Zhang', 'Zhenhao', ''], ['Yepes', 'Antonio Jimeno', ''], ['Salim', 'Flora D.', '']]","['Electronic Health Records', 'Deep Learning', 'Natural Language Processing', 'Patient Representation']"
10404,2110.05060,Youngkyu Lee,"Youngkyu Lee, Jongho Park and Chang-Ock Lee",Two-level Group Convolution,,Neural Netw. 154 (2022) 323--332,10.1016/j.neunet.2022.07.024,,cs.LG cs.NA math.NA,http://creativecommons.org/licenses/by/4.0/,"  Group convolution has been widely used in order to reduce the computation
time of convolution, which takes most of the training time of convolutional
neural networks. However, it is well known that a large number of groups
significantly reduce the performance of group convolution. In this paper, we
propose a new convolution methodology called ``two-level'' group convolution
that is robust with respect to the increase of the number of groups and
suitable for multi-GPU parallel computation. We first observe that the group
convolution can be interpreted as a one-level block Jacobi approximation of the
standard convolution, which is a popular notion in the field of numerical
analysis. In numerical analysis, there have been numerous studies on the
two-level method that introduces an intergroup structure that resolves the
performance degradation issue without disturbing parallel computation.
Motivated by these, we introduce a coarse-level structure which promotes
intergroup communication without being a bottleneck in the group convolution.
We show that all the additional work induced by the coarse-level structure can
be efficiently processed in a distributed memory system. Numerical results that
verify the robustness of the proposed method with respect to the number of
groups are presented. Moreover, we compare the proposed method to various
approaches for group convolution in order to highlight the superiority of the
proposed method in terms of execution time, memory efficiency, and performance.
","[{'version': 'v1', 'created': 'Mon, 11 Oct 2021 07:54:49 GMT'}]",2022-09-09,"[['Lee', 'Youngkyu', ''], ['Park', 'Jongho', ''], ['Lee', 'Chang-Ock', '']]","['Group convolution', 'Parallel computation', 'Block Jacobi']"
10405,2205.15714,Maximilian Felde,Maximilian Felde and Gerd Stumme,Attribute Exploration with Multiple Contradicting Partial Experts,22 pages (14 pages + 8 pages appendix),,10.1007/978-3-031-16663-1_5,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Attribute exploration is a method from Formal Concept Analysis (FCA) that
helps a domain expert discover structural dependencies in knowledge domains
which can be represented as formal contexts (cross tables of objects and
attributes). In this paper we present an extension of attribute exploration
that allows for a group of domain experts and explores their shared views. Each
expert has their own view of the domain and the views of multiple experts may
contain contradicting information.
","[{'version': 'v1', 'created': 'Tue, 31 May 2022 12:00:55 GMT'}]",2022-09-21,"[['Felde', 'Maximilian', ''], ['Stumme', 'Gerd', '']]","['Formal Concept Analysis', 'Attribute Exploration', 'Incomplete Information', 'Multiple Experts']"
10406,1810.00057,Zhi-Yong Zhang Prof.,"Chun-Ming Yuan, Zhi-Yong Zhang",New bounds and efficient algorithm for sparse difference resultant,22 pages,Journal of Symbolic Computation 2021,10.1016/j.jsc.2021.04.002,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The sparse difference resultant introduced in \citep{gao-2015} is a basic
concept in difference elimination theory.
  In this paper, we show that the sparse difference resultant of a generic
Laurent transformally essential system can be computed via the sparse resultant
of a simple algebraic system arising from the difference system. Moreover, new
order bounds of sparse difference resultant are found. Then we propose an
efficient algorithm to compute sparse difference resultant which is the
quotient of two determinants whose elements are the coefficients of the
polynomials in the algebraic system.
  The complexity of the algorithm is analyzed and experimental results show the
efficiency of the algorithm.
","[{'version': 'v1', 'created': 'Fri, 21 Sep 2018 12:24:29 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Oct 2018 09:12:44 GMT'}, {'version': 'v3', 'created': 'Tue, 20 Apr 2021 02:54:50 GMT'}]",2021-04-21,"[['Yuan', 'Chun-Ming', ''], ['Zhang', 'Zhi-Yong', '']]","['Sparse difference resultant', 'Laurent transformally essential system', 'Sparse resultant', 'Complexity']"
10407,2112.01210,"Jan P\""oppel","Jan P\""oppel and Sebastian Kahl and Stefan Kopp","Resonating Minds -- Emergent Collaboration Through Hierarchical Active
  Inference","This version of the article has been accepted for publication, after
  peer review but is not the Version of Record and does not reflect
  post-acceptance improvements, or any corrections. The Version of Record is
  available online at: http://dx.doi.org/10.1007/s12559-021-09960-4, Cogn
  Comput (2021)",,10.1007/s12559-021-09960-4,,cs.MA cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Working together on complex collaborative tasks requires agents to coordinate
their actions. Doing this explicitly or completely prior to the actual
interaction is not always possible nor sufficient. Agents also need to
continuously understand the current actions of others and quickly adapt their
own behavior appropriately. Here we investigate how efficient, automatic
coordination processes at the level of mental states (intentions, goals), which
we call belief resonance, can lead to collaborative situated problem-solving.
We present a model of hierarchical active inference for collaborative agents
(HAICA). It combines efficient Bayesian Theory of Mind processes with a
perception-action system based on predictive processing and active inference.
Belief resonance is realized by letting the inferred mental states of one agent
influence another agent's predictive beliefs about its own goals and
intentions. This way, the inferred mental states influence the agent's own task
behavior without explicit collaborative reasoning. We implement and evaluate
this model in the Overcooked domain, in which two agents with varying degrees
of belief resonance team up to fulfill meal orders. Our results demonstrate
that agents based on HAICA achieve a team performance comparable to recent
state of the art approaches, while incurring much lower computational costs. We
also show that belief resonance is especially beneficial in settings were the
agents have asymmetric knowledge about the environment. The results indicate
that belief resonance and active inference allow for quick and efficient agent
coordination, and thus can serve as a building block for collaborative
cognitive agents.
","[{'version': 'v1', 'created': 'Thu, 2 Dec 2021 13:23:44 GMT'}]",2021-12-03,"[['Pöppel', 'Jan', ''], ['Kahl', 'Sebastian', ''], ['Kopp', 'Stefan', '']]","['Multi-Agent Collaboration', 'Theory of Mind', 'Predictive Processing', 'Cognitive Model']"
10408,2007.07803,Anant Khandelwal,Anant Khandelwal,Fine-Tune Longformer for Jointly Predicting Rumor Stance and Veracity,"10 pages, 2 figures, 6 tables; Accepted at ACM CoDS-COMAD 2021",,10.1145/3430984.3431007,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Increased usage of social media caused the popularity of news and events
which are not even verified, resulting in spread of rumors allover the web. Due
to widely available social media platforms and increased usage caused the data
to be available in huge amounts.The manual methods to process such large data
is costly and time-taking, so there has been an increased attention to process
and verify such content automatically for the presence of rumors. A lot of
research studies reveal that to identify the stances of posts in the discussion
thread of such events and news is an important preceding step before identify
the rumor veracity. In this paper,we propose a multi-task learning framework
for jointly predicting rumor stance and veracity on the dataset released at
SemEval 2019 RumorEval: Determining rumor veracity and support for
rumors(SemEval 2019 Task 7), which includes social media rumors stem from a
variety of breaking news stories from Reddit as well as Twit-ter. Our framework
consists of two parts: a) The bottom part of our framework classifies the
stance for each post in the conversation thread discussing a rumor via
modelling the multi-turn conversation and make each post aware of its
neighboring posts. b) The upper part predicts the rumor veracity of the
conversation thread with stance evolution obtained from the bottom part.
Experimental results on SemEval 2019 Task 7 dataset show that our method
outperforms previous methods on both rumor stance classification and veracity
prediction
","[{'version': 'v1', 'created': 'Wed, 15 Jul 2020 17:09:17 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Oct 2020 11:25:20 GMT'}]",2020-10-23,"[['Khandelwal', 'Anant', '']]","['Rumor Stance', 'Rumor Veracity', 'Longformer', 'Roberta', 'Transformer', 'Multi-turn Conversation', 'Model Averaging']"
10409,2112.04255,Ewelina Rupnik,"Lulin Zhang, Ewelina Rupnik, Marc Pierrot-Deseilligny",Feature matching for multi-epoch historical aerial images,34 pages,"ISPRS Journal of Photogrammetry and Remote Sensing, 2021",10.1016/j.isprsjprs.2021.10.008,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Historical imagery is characterized by high spatial resolution and
stereo-scopic acquisitions, providing a valuable resource for recovering 3D
land-cover information. Accurate geo-referencing of diachronic historical
images by means of self-calibration remains a bottleneck because of the
difficulty to find sufficient amount of feature correspondences under evolving
landscapes. In this research, we present a fully automatic approach to
detecting feature correspondences between historical images taken at different
times (i.e., inter-epoch), without auxiliary data required. Based on relative
orientations computed within the same epoch (i.e., intra-epoch), we obtain DSMs
(Digital Surface Model) and incorporate them in a rough-to-precise matching.
The method consists of: (1) an inter-epoch DSMs matching to roughly co-register
the orientations and DSMs (i.e, the 3D Helmert transformation), followed by (2)
a precise inter-epoch feature matching using the original RGB images. The
innate ambiguity of the latter is largely alleviated by narrowing down the
search space using the co-registered data. With the inter-epoch features, we
refine the image orientations and quantitatively evaluate the results (1) with
DoD (Difference of DSMs), (2) with ground check points, and (3) by quantifying
ground displacement due to an earthquake. We demonstrate that our method: (1)
can automatically georeference diachronic historical images; (2) can
effectively mitigate systematic errors induced by poorly estimated camera
parameters; (3) is robust to drastic scene changes. Compared to the
state-of-the-art, our method improves the image georeferencing accuracy by a
factor of 2. The proposed methods are implemented in MicMac, a free,
open-source photogrammetric software.
","[{'version': 'v1', 'created': 'Wed, 8 Dec 2021 12:28:24 GMT'}]",2021-12-09,"[['Zhang', 'Lulin', ''], ['Rupnik', 'Ewelina', ''], ['Pierrot-Deseilligny', 'Marc', '']]","['Feature matching', 'Historical images', 'Multi-epoch', 'Poseestimation', 'Self-calibration']"
10410,1412.0057,David Howey,"Ross Drummond, David A. Howey, Stephen R. Duncan","Low-Order Mathematical Modelling of Electric Double Layer
  Supercapacitors Using Spectral Methods",Pre-print submitted to Journal of Power Sources,,10.1016/j.jpowsour.2014.11.116,,cs.SY physics.chem-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work investigates two physics-based models that simulate the non-linear
partial differential algebraic equations describing an electric double layer
supercapacitor. In one model the linear dependence between electrolyte
concentration and conductivity is accounted for, while in the other model it is
not. A spectral element method is used to discretise the model equations and it
is found that the error convergence rate with respect to the number of elements
is faster compared to a finite difference method. The increased accuracy of the
spectral element approach means that, for a similar level of solution accuracy,
the model simulation computing time is approximately 50% of that of the finite
difference method. This suggests that the spectral element model could be used
for control and state estimation purposes. For a typical supercapacitor
charging profile, the numerical solutions from both models closely match
experimental voltage and current data. However, when the electrolyte is dilute
or where there is a long charging time, a noticeable difference between the
numerical solutions of the two models is observed. Electrical impedance
spectroscopy simulations show that the capacitance of the two models rapidly
decreases when the frequency of the perturbation current exceeds an upper
threshold.
","[{'version': 'v1', 'created': 'Sat, 29 Nov 2014 01:28:35 GMT'}]",2014-12-09,"[['Drummond', 'Ross', ''], ['Howey', 'David A.', ''], ['Duncan', 'Stephen R.', '']]","['Supercapacitor', 'physics based modelling', 'low-order models', 'spectral methods']"
10411,2005.04531,Zhong Sun,"Zhong Sun, Giacomo Pedretti, Elia Ambrosi, Alessandro Bricalli,
  Daniele Ielmini",In-memory eigenvector computation in time O(1),Accepted by Adv. Intell. Syst,Advanced Intelligent Systems (2020),10.1002/aisy.202000042,,cs.CC cs.ET cs.NA math.NA,http://creativecommons.org/licenses/by/4.0/,"  In-memory computing with crosspoint resistive memory arrays has gained
enormous attention to accelerate the matrix-vector multiplication in the
computation of data-centric applications. By combining a crosspoint array and
feedback amplifiers, it is possible to compute matrix eigenvectors in one step
without algorithmic iterations. In this work, time complexity of the
eigenvector computation is investigated, based on the feedback analysis of the
crosspoint circuit. The results show that the computing time of the circuit is
determined by the mismatch degree of the eigenvalues implemented in the
circuit, which controls the rising speed of output voltages. For a dataset of
random matrices, the time for computing the dominant eigenvector in the circuit
is constant for various matrix sizes, namely the time complexity is O(1). The
O(1) time complexity is also supported by simulations of PageRank of real-world
datasets. This work paves the way for fast, energy-efficient accelerators for
eigenvector computation in a wide range of practical applications.
","[{'version': 'v1', 'created': 'Sat, 9 May 2020 23:54:23 GMT'}]",2020-05-12,"[['Sun', 'Zhong', ''], ['Pedretti', 'Giacomo', ''], ['Ambrosi', 'Elia', ''], ['Bricalli', 'Alessandro', ''], ['Ielmini', 'Daniele', '']]","['in-memory computing', 'eigenvector', 'time complexity', 'resistive memory', 'O(1)']"
10412,2009.01511,Tristan Vaccon,"Xavier Dahan, Tristan Vaccon (XLIM)",On a non-archimedean broyden method,,"ISSAC '20: International Symposium on Symbolic and Algebraic
  Computation, Jul 2020, Kalamata Greece, France. pp.114-121",10.1145/3373207.3404045,,cs.SC cs.NA math.NA math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Newton's method is an ubiquitous tool to solve equations, both in the
archimedean and non-archimedean settings -- for which it does not really
differ. Broyden was the instigator of what is called ""quasi-Newton methods"".
These methods use an iteration step where one does not need to compute a
complete Jacobian matrix nor its inverse. We provide an adaptation of Broyden's
method in a general non-archimedean setting, compatible with the lack of inner
product, and study its Q and R convergence. We prove that our adapted method
converges at least Q-linearly and R-superlinearly with R-order
$2^{\frac{1}{2m}}$ in dimension m. Numerical data are provided.
","[{'version': 'v1', 'created': 'Thu, 3 Sep 2020 08:28:04 GMT'}]",2020-09-04,"[['Dahan', 'Xavier', '', 'XLIM'], ['Vaccon', 'Tristan', '', 'XLIM']]","['System of equations', 'Broyden’s method', 'Quasi-Newton', 'p-adicapproximation', 'Power series', 'Symbolic-numeric', 'p-adic algorithm']"
10413,1912.11762,Rory Bunker,"Rory Bunker (1), Teo Susnjak (2) ((1) Nagoya Institute of Technology,
  Japan, (2) Massey University, Auckland, New Zealand)","The Application of Machine Learning Techniques for Predicting Results in
  Team Sport: A Review","48 pages, 10 figures","Journal of Artificial Intelligence Research (Vol. 73 2022)
  1285-1322",10.1613/jair.1.13509,,cs.LG stat.AP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the past two decades, Machine Learning (ML) techniques have been
increasingly utilized for the purpose of predicting outcomes in sport. In this
paper, we provide a review of studies that have used ML for predicting results
in team sport, covering studies from 1996 to 2019. We sought to answer five key
research questions while extensively surveying papers in this field. This paper
offers insights into which ML algorithms have tended to be used in this field,
as well as those that are beginning to emerge with successful outcomes. Our
research highlights defining characteristics of successful studies and
identifies robust strategies for evaluating accuracy results in this
application domain. Our study considers accuracies that have been achieved
across different sports and explores the notion that outcomes of some team
sports could be inherently more difficult to predict than others. Finally, our
study uncovers common themes of future research directions across all surveyed
papers, looking for gaps and opportunities, while proposing recommendations for
future researchers in this domain.
","[{'version': 'v1', 'created': 'Thu, 26 Dec 2019 03:12:21 GMT'}]",2022-04-19,"[['Bunker', 'Rory', ''], ['Susnjak', 'Teo', '']]","['Machine Learning', 'Sport Result Prediction', 'Literature Review', 'Expert System', 'Team Sport']"
10414,1909.06209,Ciriaco Andrea D'Angelo,"Giovanni Abramo, Ciriaco Andrea D'Angelo, Emanuela Reale","Peer review vs bibliometrics: which method better predicts the scholarly
  impact of publications?",,"Scientometrics, 121(1), 537-554 (2019)",10.1007/s11192-019-03184-y,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we try to answer the question of which method, peer review vs
bibliometrics, better predicts the future overall scholarly impact of
scientific publications. We measure the agreement between peer review
evaluations of Web of Science indexed publications submitted to the first
Italian research assessment exercise and long-term citations of the same
publications. We do the same for an early citation-based indicator. We find
that the latter shows stronger predictive power, i.e., it more reliably
predicts late citations in all the disciplinary areas examined, and for any
citation time window starting one year after publication.
","[{'version': 'v1', 'created': 'Fri, 13 Sep 2019 13:11:19 GMT'}]",2019-09-16,"[['Abramo', 'Giovanni', ''], [""D'Angelo"", 'Ciriaco Andrea', ''], ['Reale', 'Emanuela', '']]","['Research evaluation', 'scientometrics', 'publication quality', 'scientific advancement']"
10415,1805.02334,Damiano Spina,"Enrique Amig\'o, Damiano Spina and Jorge Carrillo-de-Albornoz","An Axiomatic Analysis of Diversity Evaluation Metrics: Introducing the
  Rank-Biased Utility Metric","Original version: 10 pages. Preprint of full paper to appear at
  SIGIR'18: The 41st International ACM SIGIR Conference on Research &
  Development in Information Retrieval, July 8-12, 2018, Ann Arbor, MI, USA.
  ACM, New York, NY, USA",,10.1145/3209978.3210024,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many evaluation metrics have been defined to evaluate the effectiveness
ad-hoc retrieval and search result diversification systems. However, it is
often unclear which evaluation metric should be used to analyze the performance
of retrieval systems given a specific task. Axiomatic analysis is an
informative mechanism to understand the fundamentals of metrics and their
suitability for particular scenarios. In this paper, we define a
constraint-based axiomatic framework to study the suitability of existing
metrics in search result diversification scenarios. The analysis informed the
definition of Rank-Biased Utility (RBU) -- an adaptation of the well-known
Rank-Biased Precision metric -- that takes into account redundancy and the user
effort associated to the inspection of documents in the ranking. Our
experiments over standard diversity evaluation campaigns show that the proposed
metric captures quality criteria reflected by different metrics, being suitable
in the absence of knowledge about particular features of the scenario under
study.
","[{'version': 'v1', 'created': 'Mon, 7 May 2018 03:50:11 GMT'}, {'version': 'v2', 'created': 'Fri, 18 May 2018 02:22:55 GMT'}, {'version': 'v3', 'created': 'Sun, 19 Aug 2018 07:38:20 GMT'}]",2018-08-21,"[['Amigó', 'Enrique', ''], ['Spina', 'Damiano', ''], ['Carrillo-de-Albornoz', 'Jorge', '']]","['Evaluation', 'Search result diversification', 'Axiomatic analysis']"
10416,2110.05828,Sascha El-Sharkawy,"Sascha El-Sharkawy, Adam Krafczyk, Klaus Schmid",An Empirical Study of Configuration Mismatches in Linux,,"Proceedings of the 21st International Systems and Software Product
  Line Conference (SPLC '17) - Volume A, 2017, pages 19-28",10.1145/3106195.3106208,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ideally the variability of a product line is represented completely and
correctly by its variability model. However, in practice additional variability
is often represented on the level of the build system or in the code. Such a
situation may lead to inconsistencies, where the actually realized variability
does not fully correspond to the one described by the variability model. In
this paper we focus on configuration mismatches, i.e., cases where the
effective variability differs from the variability as it is represented by the
variability model. While previous research has already shown that these
situations still exist even today in well-analyzed product lines like Linux, so
far it was unclear under what circumstances such issues occur in reality. In
particular, it is open what types of configuration mismatches occur and how
severe they are. Here, our contribution is to close this gap by presenting a
detailed manual analysis of 80 configuration mismatches in the Linux 4.4.1
kernel and assess their criticality. We identify various categories of
configuration issues and show that about two-thirds of the configuration
mismatches may actually lead to kernel misconfigurations.
","[{'version': 'v1', 'created': 'Tue, 12 Oct 2021 08:45:50 GMT'}]",2021-10-13,"[['El-Sharkawy', 'Sascha', ''], ['Krafczyk', 'Adam', ''], ['Schmid', 'Klaus', '']]","['Software product lines', 'variability modeling', 'confguration mismatches', 'Linux', 'Kconfg', 'static analysis', 'empirical software engineering']"
10417,2009.01698,Radek O\v{s}lej\v{s}ek,"Michal Beran and Frantisek Hrdina and Daniel Kouril and Radek Oslejsek
  and Kristina Zakopcanova","Exploratory Analysis of File System Metadata for Rapid Investigation of
  Security Incidents",,,10.1109/VizSec51108.2020.00008,,cs.HC cs.CR,http://creativecommons.org/licenses/by-sa/4.0/,"  Investigating cybersecurity incidents requires in-depth knowledge from the
analyst. Moreover, the whole process is demanding due to the vast data volumes
that need to be analyzed. While various techniques exist nowadays to help with
particular tasks of the analysis, the process as a whole still requires a lot
of manual activities and expert skills. We propose an approach that allows the
analysis of disk snapshots more efficiently and with lower demands on expert
knowledge. Following a user-centered design methodology, we implemented an
analytical tool to guide analysts during security incident investigations. The
viability of the solution was validated by an evaluation conducted with members
of different security teams.
","[{'version': 'v1', 'created': 'Thu, 3 Sep 2020 14:23:22 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Mar 2021 08:11:47 GMT'}]",2021-03-08,"[['Beran', 'Michal', ''], ['Hrdina', 'Frantisek', ''], ['Kouril', 'Daniel', ''], ['Oslejsek', 'Radek', ''], ['Zakopcanova', 'Kristina', '']]","['incident investigation', 'digital evidence', 'file systemmetadata', 'data analysis']"
10418,1709.09093,R.Stuart Geiger,R. Stuart Geiger,"Beyond opening up the black box: Investigating the role of algorithmic
  systems in Wikipedian organizational culture","14 pages, typo fixed in v2",Big Data & Society 4(2). 2017,10.1177/2053951717730735,,cs.CY cs.AI cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Scholars and practitioners across domains are increasingly concerned with
algorithmic transparency and opacity, interrogating the values and assumptions
embedded in automated, black-boxed systems, particularly in user-generated
content platforms. I report from an ethnography of infrastructure in Wikipedia
to discuss an often understudied aspect of this topic: the local, contextual,
learned expertise involved in participating in a highly automated
social-technical environment. Today, the organizational culture of Wikipedia is
deeply intertwined with various data-driven algorithmic systems, which
Wikipedians rely on to help manage and govern the ""anyone can edit""
encyclopedia at a massive scale. These bots, scripts, tools, plugins, and
dashboards make Wikipedia more efficient for those who know how to work with
them, but like all organizational culture, newcomers must learn them if they
want to fully participate. I illustrate how cultural and organizational
expertise is enacted around algorithmic agents by discussing two
autoethnographic vignettes, which relate my personal experience as a veteran in
Wikipedia. I present thick descriptions of how governance and gatekeeping
practices are articulated through and in alignment with these automated
infrastructures. Over the past 15 years, Wikipedian veterans and administrators
have made specific decisions to support administrative and editorial workflows
with automation in particular ways and not others. I use these cases of
Wikipedia's bot-supported bureaucracy to discuss several issues in the fields
of critical algorithms studies, critical data studies, and fairness,
accountability, and transparency in machine learning -- most principally
arguing that scholarship and practice must go beyond trying to ""open up the
black box"" of such systems and also examine sociocultural processes like
newcomer socialization.
","[{'version': 'v1', 'created': 'Tue, 26 Sep 2017 15:38:26 GMT'}, {'version': 'v2', 'created': 'Sun, 1 Oct 2017 15:24:56 GMT'}]",2017-10-03,"[['Geiger', 'R. Stuart', '']]","['Organizational culture', 'automation', 'bots', 'peer production', 'online communities', 'ethnography']"
10419,2002.09085,Han Hu,"Qing Zhu, Zhendong Wang, Han Hu, Linfu Xie, Xuming Ge, Yeting Zhang","Leveraging Photogrammetric Mesh Models for Aerial-Ground Feature Point
  Matching Toward Integrated 3D Reconstruction","Accepted for publication in ISPRS Journal of Photogrammetry and
  Remote Sensing",,10.1016/j.isprsjprs.2020.05.024,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Integration of aerial and ground images has been proved as an efficient
approach to enhance the surface reconstruction in urban environments. However,
as the first step, the feature point matching between aerial and ground images
is remarkably difficult, due to the large differences in viewpoint and
illumination conditions. Previous studies based on geometry-aware image
rectification have alleviated this problem, but the performance and convenience
of this strategy is limited by several flaws, e.g. quadratic image pairs,
segregated extraction of descriptors and occlusions. To address these problems,
we propose a novel approach: leveraging photogrammetric mesh models for
aerial-ground image matching. The methods of this proposed approach have linear
time complexity with regard to the number of images, can explicitly handle low
overlap using multi-view images and can be directly injected into off-the-shelf
structure-from-motion (SfM) and multi-view stereo (MVS) solutions. First,
aerial and ground images are reconstructed separately and initially
co-registered through weak georeferencing data. Second, aerial models are
rendered to the initial ground views, in which the color, depth and normal
images are obtained. Then, the synthesized color images and the corresponding
ground images are matched by comparing the descriptors, filtered by local
geometrical information, and then propagated to the aerial views using depth
images and patch-based matching. Experimental evaluations using various
datasets confirm the superior performance of the proposed methods in
aerial-ground image matching. In addition, incorporation of the existing SfM
and MVS solutions into these methods enables more complete and accurate models
to be directly obtained.
","[{'version': 'v1', 'created': 'Fri, 21 Feb 2020 01:47:59 GMT'}, {'version': 'v2', 'created': 'Thu, 28 May 2020 07:41:15 GMT'}]",2020-11-24,"[['Zhu', 'Qing', ''], ['Wang', 'Zhendong', ''], ['Hu', 'Han', ''], ['Xie', 'Linfu', ''], ['Ge', 'Xuming', ''], ['Zhang', 'Yeting', '']]","['Aerial-ground Integration', 'Feature Matching', '3D Reconstruction', 'Multi-ViewStereo', 'Structure-from-Motion']"
10420,1402.6515,Atul  Singh Kushwah Mr.,Atul Singh Kushwah,"Performance Analysis of 2*4 MIMO-MC-CDMA in Rayleigh Fading Channel
  Using ZF-Decoder","4 pages, 2 figures, 2 tables Published with International Journal of
  Engineering Trends and Technology (IJETT) Volume-8 Number-4 Year of
  Publication : 2014","International Journal of Engineering Trends and Technology(IJETT),
  V8(4),204-207 February 2014. ISSN:2231-5381",10.14445/22315381/IJETT-V8P237,,cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we analyze the performance of 2*4 MIMO-MC-CDMA system in MATLAB
which highly reduces BER. In this paper we combine MIMO and MC-CDMA system to
reduce bit error rate in which MC-CDMA is multi user and multiple access
schemes which is used to increase the data rate of the system. MC-CDMA system
is a single wideband frequency selective carrier which converts frequency
selective to parallel narrowband flat fading multiple sub-carriers to enhance
the performance of system. Now MC-CDMA system further improved by grouping with
2*4 MIMO system which uses ZF (Zero Forcing) decoder at the receiver to
decrease BER with half rate convolutionally encoded Alamouti STBC block code is
used as transmit diversity of MIMO through multiple transmit antenna.
Importance of using MIMO-MC-CDMA using convolution code is firstly to reduce
the complexity of system secondary to reduce BER and lastly to increase gain.
In this paper we examine system performance in diverse modulation techniques
like, 8-PSK, 16-QAM, QPSK, 32-QAM, 8-QAM and 64-QAM in Rayleigh fading channel
using MATLAB.
","[{'version': 'v1', 'created': 'Wed, 26 Feb 2014 12:36:45 GMT'}]",2014-02-27,"[['Kushwah', 'Atul Singh', '']]","['OFDM', 'CDMA', 'MIMO and MIMO-MC-CDMA']"
10421,1904.12589,Ran Bakalo,"Ran Bakalo, Jacob Goldberger and Rami Ben-Ari","Weakly and Semi Supervised Detection in Medical Imaging via Deep Dual
  Branch Net",,"Neurocomputing, Volume 421, 15 January 2021, Pages 15-25",10.1016/j.neucom.2020.09.037,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This study presents a novel deep learning architecture for multi-class
classification and localization of abnormalities in medical imaging illustrated
through experiments on mammograms. The proposed network combines two learning
branches. One branch is for region classification with a newly added
normal-region class. Second branch is region detection branch for ranking
regions relative to one another. Our method enables detection of abnormalities
at full mammogram resolution for both weakly and semi-supervised settings. A
novel objective function allows for the incorporation of local annotations into
the model. We present the impact of our schemes on several performance measures
for classification and localization, to evaluate the cost effectiveness of the
lesion annotation effort. Our evaluation was primarily conducted over a large
multi-center mammography dataset of $\sim$3,000 mammograms with various
findings. The results for weakly supervised learning showed significant
improvement compared to previous approaches. We show that the time consuming
local annotations involved in supervised learning can be addressed by a weakly
supervised method that can leverage a subset of locally annotated data. Weakly
and semi-supervised methods coupled with detection can produce a cost effective
and explainable model to be adopted by radiologists in the field.
","[{'version': 'v1', 'created': 'Mon, 29 Apr 2019 12:16:45 GMT'}, {'version': 'v2', 'created': 'Wed, 8 May 2019 09:44:49 GMT'}, {'version': 'v3', 'created': 'Thu, 19 Mar 2020 08:30:08 GMT'}]",2020-10-14,"[['Bakalo', 'Ran', ''], ['Goldberger', 'Jacob', ''], ['Ben-Ari', 'Rami', '']]","['weakly supervised detection', 'semi-supervised detection', 'deep learning', 'abnormality detection', 'mammography', 'breastradiology']"
10422,1812.08558,"Uwe K\""ocher","Uwe K\""ocher, Marius Paul Bruchh\""auser, Markus Bause","Efficient and scalable data structures and algorithms for goal-oriented
  adaptivity of space-time FEM codes",,,10.1016/j.softx.2019.100239,,cs.MS cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The cost- and memory-efficient numerical simulation of coupled volume-based
multi-physics problems like flow, transport, wave propagation and others
remains a challenging task with finite element method (FEM) approaches.
Goal-oriented space and time adaptive methods derived from the dual weighted
residual (DWR) method appear to be a shiny key technology to generate optimal
space-time meshes to minimise costs. Current implementations for challenging
problems of numerical screening tools including the DWR technology broadly
suffer in their extensibility to other problems, in high memory consumption or
in missing system solver technologies. This work contributes to the efficient
embedding of DWR space-time adaptive methods into numerical screening tools for
challenging problems of physically relevance with a new approach of flexible
data structures and algorithms on them, a modularised and complete
implementation as well as illustrative examples to show the performance and
efficiency.
","[{'version': 'v1', 'created': 'Thu, 20 Dec 2018 13:43:20 GMT'}]",2019-05-01,"[['Köcher', 'Uwe', ''], ['Bruchhäuser', 'Marius Paul', ''], ['Bause', 'Markus', '']]","['goal-oriented adaptivity', 'dual weighted residual method', 'space-time finite elements', 'efficient data structures']"
10423,2007.10951,Francesca Noardo,"Francesca Noardo, Thomas Krijnen, Ken Arroyo Ohori, Filip Biljecki,
  Claire Ellul, Lars Harrie, Helen Eriksson, Lorenzo Polia, Nebras Salheb,
  Helga Tauscher, Jordi van Liempt, Hendrik Goerne, Dean Hintz, Tim Kaiser,
  Cristina Leoni, Artur Warchol, Jantien Stoter","Reference study of IFC software support: the GeoBIM benchmark 2019 --
  Part I","Pre-print of the paper. arXiv admin note: text overlap with
  arXiv:2007.10938","Transactions in GIS, 2021",10.1111/tgis.12709,,cs.DB,http://creativecommons.org/licenses/by/4.0/,"  IFC, buildingSMART open standard for Building Information Models, is
underused with respect to its promising potential, since, according to the
experience of practitioners and researchers working with BIM, issues in the
standard's implementation and use prevent its effective use. Nevertheless, a
systematic investigation of these issues has never been performed, and there is
thus insufficient evidence for tackling the problems. The GeoBIM benchmark
project is aimed at finding such evidence by involving external volunteers,
reporting on tools behaviour about relevant aspects (geometry, semantics,
georeferencing, functionalities), analysed and described in this paper.
Interestingly, few patterns are detectable about the behaviour of different
software with standardised data, and significant issues are found in their
support of the standards, probably due to the very high complexity of the
standard data model. This paper is in tandem with Part II, describing the
results of the benchmark related to CityGML, counterpart of IFC within
geoinformation.
","[{'version': 'v1', 'created': 'Tue, 21 Jul 2020 17:11:21 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jan 2021 17:47:04 GMT'}]",2021-01-08,"[['Noardo', 'Francesca', ''], ['Krijnen', 'Thomas', ''], ['Ohori', 'Ken Arroyo', ''], ['Biljecki', 'Filip', ''], ['Ellul', 'Claire', ''], ['Harrie', 'Lars', ''], ['Eriksson', 'Helen', ''], ['Polia', 'Lorenzo', ''], ['Salheb', 'Nebras', ''], ['Tauscher', 'Helga', ''], ['van Liempt', 'Jordi', ''], ['Goerne', 'Hendrik', ''], ['Hintz', 'Dean', ''], ['Kaiser', 'Tim', ''], ['Leoni', 'Cristina', ''], ['Warchol', 'Artur', ''], ['Stoter', 'Jantien', '']]","['Industry Foundation Classes', 'Building Information Models', 'open standards', 'software']"
10424,1908.11769,\'Oscar Mart\'in,"\'Oscar Mart\'in, Alberto Verdejo, Narciso Mart\'i-Oliet",Compositional specification in rewriting logic,"Changes in this revision: Removed last sentence from abstract (on the
  paper being considered for publication). Added note before abstract (on the
  paper being published)","Theory and Practice of Logic Programming, 20(1), 44-98, 2020",10.1017/S1471068419000425,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rewriting logic is naturally concurrent: several subterms of the state term
can be rewritten simultaneously. But state terms are global, which makes
compositionality difficult to achieve. Compositionality here means being able
to decompose a complex system into its functional components and code each as
an isolated and encapsulated system. Our goal is to help bringing
compositionality to system specification in rewriting logic. The base of our
proposal is the operation that we call synchronous composition. We discuss the
motivations and implications of our proposal, formalize it for rewriting logic
and also for transition structures, to be used as semantics, and show the power
of our approach with some examples. This paper is under consideration in Theory
and Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Fri, 30 Aug 2019 14:49:36 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Sep 2019 16:45:42 GMT'}, {'version': 'v3', 'created': 'Thu, 30 Jan 2020 12:17:57 GMT'}]",2020-01-31,"[['Martín', 'Óscar', ''], ['Verdejo', 'Alberto', ''], ['Martí-Oliet', 'Narciso', '']]","['compositional specification', 'rewriting logic', 'modularity', 'synchronous product']"
10425,2211.08206,Vittorio Lippi,Vittorio Lippi and Raphael Deimel,"Phase Distribution in Probabilistic Movement Primitives, Representing
  Time Variability for the Recognition and Reproduction of Human Movements",,"ICINCO 2019, ISBN 978-989-758-380-3; ISSN 2184-2809, pp 571-578",10.5220/0007750205710578,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Probabilistic Movement Primitives (ProMPs) are a widely used representation
of movements for human-robot interaction. They also facilitate the
factorization of temporal and spatial structure of movements. In this work we
investigate a method to temporally align observations so that when learning
ProMPs, information in the spatial structure of the observed motion is
maximized while maintaining a smooth phase velocity. We apply the method on
recordings of hand trajectories in a two-dimensional reaching task. A system
for simultaneous recognition of movement and phase is proposed and performance
of movement recognition and movement reproduction is discussed.
","[{'version': 'v1', 'created': 'Tue, 15 Nov 2022 15:15:27 GMT'}]",2022-11-16,"[['Lippi', 'Vittorio', ''], ['Deimel', 'Raphael', '']]","['ProMP', 'Human Movement', 'Prediction', 'Recognition', 'Time Warping', 'Phase']"
10426,1910.06710,Tiffany Callahan,"Tiffany J. Callahan (1), Harrison Pielke-Lombardo (1), Ignacio J.
  Tripodi (1 and 2), and Lawrence E. Hunter (1) ((1) Computational Bioscience
  Program, Department of Pharmacology, University of Colorado Denver Anschutz
  Medical Campus, (2) Computer Science, University of Colorado Boulder)",Knowledge-based Biomedical Data Science 2019,"Manuscript 43 pages with 3 tables; Supplemental material 43 pages
  with 3 tables",Annual Review of Biomedical Data Science. 2020 Jul 20;3:23-41,10.1146/annurev-biodatasci-010820-091627,,cs.AI cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Knowledge-based biomedical data science (KBDS) involves the design and
implementation of computer systems that act as if they knew about biomedicine.
Such systems depend on formally represented knowledge in computer systems,
often in the form of knowledge graphs. Here we survey the progress in the last
year in systems that use formally represented knowledge to address data science
problems in both clinical and biological domains, as well as on approaches for
creating knowledge graphs. Major themes include the relationships between
knowledge graphs and machine learning, the use of natural language processing,
and the expansion of knowledge-based approaches to novel domains, such as
Chinese Traditional Medicine and biodiversity.
","[{'version': 'v1', 'created': 'Tue, 8 Oct 2019 17:28:16 GMT'}]",2022-09-13,"[['Callahan', 'Tiffany J.', '', '1 and 2'], ['Pielke-Lombardo', 'Harrison', '', '1 and 2'], ['Tripodi', 'Ignacio J.', '', '1 and 2'], ['Hunter', 'Lawrence E.', '']]","['Knowledge Graph', 'Ontology', 'Natural Language Processing', 'Knowledge Discovery', 'Semantic Web', 'Knowledge Graph Embeddings']"
10427,1506.03949,Jos Uiterwijk,Jos Uiterwijk and Michael Barton,"New Results for Domineering from Combinatorial Game Theory Endgame
  Databases",,,10.1016/j.tcs.2015.05.017,,cs.AI cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We have constructed endgame databases for all single-component positions up
to 15 squares for Domineering, filled with exact Combinatorial Game Theory
(CGT) values in canonical form. The most important findings are as follows.
  First, as an extension of Conway's [8] famous Bridge Splitting Theorem for
Domineering, we state and prove another theorem, dubbed the Bridge Destroying
Theorem for Domineering. Together these two theorems prove very powerful in
determining the CGT values of large positions as the sum of the values of
smaller fragments, but also to compose larger positions with specified values
from smaller fragments. Using the theorems, we then prove that for any dyadic
rational number there exist Domineering positions with that value.
  Second, we investigate Domineering positions with infinitesimal CGT values,
in particular ups and downs, tinies and minies, and nimbers. In the databases
we find many positions with single or double up and down values, but no ups and
downs with higher multitudes. However, we prove that such single-component ups
and downs easily can be constructed. Further, we find Domineering positions
with 11 different tinies and minies values. For each we give an example. Next,
for nimbers we find many Domineering positions with values up to *3. This is
surprising, since Drummond-Cole [10] suspected that no *2 and *3 positions in
standard Domineering would exist. We show and characterize many *2 and *3
positions. Finally, we give some Domineering positions with values interesting
for other reasons.
  Third, we have investigated the temperature of all positions in our
databases. There appears to be exactly one position with temperature 2 (as
already found before) and no positions with temperature larger than 2. This
supports Berlekamp's conjecture that 2 is the highest possible temperature in
Domineering.
","[{'version': 'v1', 'created': 'Fri, 12 Jun 2015 09:20:42 GMT'}]",2015-06-15,"[['Uiterwijk', 'Jos', ''], ['Barton', 'Michael', '']]","['Domineering', 'Combinatorial Game Theory', 'Numbers', 'Infinitesimals', 'Ups and Downs', 'Tinies and Minies', 'Nimbers including *2 and*3', 'Temperatures']"
10428,1910.02057,Siddharth Gupta,"Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth
  Gupta","C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual
  Carving-Width","Extended version of the paper ""C-Planarity Testing of Embedded
  Clustered Graphs with Bounded Dual Carving-Width"" to appear in the
  Proceedings of the 14th International Symposium on Parameterized and Exact
  Computation (IPEC 2019)","Algorithmica 83 (8): 2471-2502, 2021",10.1007/s00453-021-00839-2,,cs.DS cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For a clustered graph, i.e, a graph whose vertex set is recursively
partitioned into clusters, the C-Planarity Testing problem asks whether it is
possible to find a planar embedding of the graph and a representation of each
cluster as a region homeomorphic to a closed disk such that 1. the subgraph
induced by each cluster is drawn in the interior of the corresponding disk, 2.
each edge intersects any disk at most once, and 3. the nesting between clusters
is reflected by the representation, i.e., child clusters are properly contained
in their parent cluster. The computational complexity of this problem, whose
study has been central to the theory of graph visualization since its
introduction in 1995 [Qing-Wen Feng, Robert F. Cohen, and Peter Eades.
Planarity for clustered graphs. ESA'95], has only been recently settled
[Radoslav Fulek and Csaba D. T\'oth. Atomic Embeddability, Clustered Planarity,
and Thickenability. To appear at SODA'20]. Before such a breakthrough, the
complexity question was still unsolved even when the graph has a prescribed
planar embedding, i.e, for embedded clustered graphs.
  We show that the C-Planarity Testing problem admits a single-exponential
single-parameter FPT algorithm for embedded clustered graphs, when
parameterized by the carving-width of the dual graph of the input. This is the
first FPT algorithm for this long-standing open problem with respect to a
single notable graph-width parameter. Moreover, in the general case, the
polynomial dependency of our FPT algorithm is smaller than the one of the
algorithm by Fulek and T\'oth. To further strengthen the relevance of this
result, we show that the C-Planarity Testing problem retains its computational
complexity when parameterized by several other graph-width parameters, which
may potentially lead to faster algorithms.
","[{'version': 'v1', 'created': 'Fri, 4 Oct 2019 17:32:37 GMT'}]",2021-08-18,"[['Da Lozzo', 'Giordano', ''], ['Eppstein', 'David', ''], ['Goodrich', 'Michael T.', ''], ['Gupta', 'Siddharth', '']]","['Clustered planarity', 'carving-width', 'non-crossing partitions', 'fixed-parametertractability']"
10429,2010.08889,Elaine Wong,"Christoph Koutschan, Elaine Wong",Creative Telescoping on Multiple Sums,"22 pages; Supplementary material at
  https://wongey.github.io/digital-nets-walsh/","Mathematics in Computer Science, Vol. 15(3), Pages 483-498 (2021)",10.1007/s11786-021-00514-3,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We showcase a collection of practical strategies to deal with a problem
arising from an analysis of integral estimators derived via quasi-Monte Carlo
methods. The problem reduces to a triple binomial sum, thereby enabling us to
open up the holonomic toolkit, which contains tools such as creative
telescoping that can be used to deduce a recurrence satisfied by the sum. While
applying these techniques, a host of issues arose that partly needed to be
resolved by hand. In other words, no creative telescoping implementation
currently exists that can resolve all these issues automatically. Thus, we felt
the need to compile the different strategies we tried and the difficulties that
we encountered along the way. In particular, we highlight the necessity of the
certificate in these computations and how its complexity can greatly influence
the computation time.
","[{'version': 'v1', 'created': 'Sun, 18 Oct 2020 00:00:02 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Mar 2021 08:51:17 GMT'}]",2021-07-27,"[['Koutschan', 'Christoph', ''], ['Wong', 'Elaine', '']]","['Symbolic Summation', 'Creative Telescoping', 'Holonomic Function', 'Hypergeometric Series']"
10430,2010.04390,Emilio Mart\'inez-Pa\~neda,"Marlini Simoes, Emilio Mart\'inez-Pa\~neda",Phase field modelling of fracture and fatigue in Shape Memory Alloys,,Computer Methods in Applied Mechanics and Engineering (2001),10.1016/j.cma.2020.113504,,cs.CE cs.NA math.NA physics.app-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new phase field framework for modelling fracture and fatigue in
Shape Memory Alloys (SMAs). The constitutive model captures the superelastic
behaviour of SMAs and damage is driven by the elastic and transformation strain
energy densities. We consider both the assumption of a constant fracture energy
and the case of a fracture energy dependent on the martensitic volume fraction.
The framework is implemented in an implicit time integration scheme, with both
monolithic and staggered solution strategies. The potential of this formulation
is showcased by modelling a number of paradigmatic problems. First, a boundary
layer model is used to examine crack tip fields and compute crack growth
resistance curves (R-curves). We show that the model is able to capture the
main fracture features associated with SMAs, including the toughening effect
associated with stress-induced phase transformation. Insight is gained into the
role of temperature, material strength, crack density function and fracture
energy homogenisation. Secondly, several 2D and 3D boundary value problems are
addressed, demonstrating the capabilities of the model in capturing complex
cracking phenomena in SMAs, such as unstable crack growth, mixed-mode fracture
or the interaction between several cracks. Finally, the model is extended to
fatigue and used to capture crack nucleation and propagation in biomedical
stents, a paradigmatic application of nitinol SMAs.
","[{'version': 'v1', 'created': 'Fri, 9 Oct 2020 06:51:48 GMT'}]",2020-12-02,"[['Simoes', 'Marlini', ''], ['Martínez-Pañeda', 'Emilio', '']]","['Phase field', 'Shape Memory Alloys', 'Fracture', 'Fatigue', 'Finite element']"
10431,2112.02581,Jiayi Chen,"Jiayi Chen, Wen Wu, Wei Zheng, Liang He",Long-Tail Session-based Recommendation from Calibration,,,10.1007/s10489-022-03718-7,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate predictions in session-based recommendations have progressed, but a
few studies have focused on skewed recommendation lists caused by popularity
bias. Existing models for mitigating popularity bias have attempted to reduce
the overconcentration of popular items by amplifying scores of less popular
items. However, they normally ignore the users' different preferences toward
long-tail items. Thus, we incorporate calibration, where calibrated
recommendations reflect the users' interests in recommendation lists with
appropriate proportions, to mitigate the popularity bias from the user's
perspective. Specifically, we propose a calibration module to predict the ratio
of tail items in the recommendation list from the session representation, and
align it to the ongoing session. Additionally, we utilize a two-stage
curriculum training strategy to improve prediction in the calibration module.
Experiments on benchmark datasets show that our model can both achieve the
competitive accuracy of recommendation and provide more tail items.
","[{'version': 'v1', 'created': 'Sun, 5 Dec 2021 14:30:56 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Dec 2021 15:07:54 GMT'}, {'version': 'v3', 'created': 'Wed, 15 Dec 2021 16:15:01 GMT'}, {'version': 'v4', 'created': 'Fri, 17 Dec 2021 16:01:38 GMT'}, {'version': 'v5', 'created': 'Sun, 2 Jan 2022 11:45:15 GMT'}, {'version': 'v6', 'created': 'Fri, 11 Mar 2022 08:29:24 GMT'}, {'version': 'v7', 'created': 'Mon, 2 May 2022 12:47:39 GMT'}]",2022-10-24,"[['Chen', 'Jiayi', ''], ['Wu', 'Wen', ''], ['Zheng', 'Wei', ''], ['He', 'Liang', '']]","['Session-based Recommendation', 'Long-tail', 'Popularity bias', 'Calibration']"
10432,2209.15165,Aamir Mustafa,"Aamir Mustafa, Param Hanji and Rafal K. Mantiuk","Distilling Style from Image Pairs for Global Forward and Inverse Tone
  Mapping","Published in European Conference on Visual Media Production (CVMP
  '22)",,10.1145/3565516.3565520,,cs.CV,http://creativecommons.org/publicdomain/zero/1.0/,"  Many image enhancement or editing operations, such as forward and inverse
tone mapping or color grading, do not have a unique solution, but instead a
range of solutions, each representing a different style. Despite this, existing
learning-based methods attempt to learn a unique mapping, disregarding this
style. In this work, we show that information about the style can be distilled
from collections of image pairs and encoded into a 2- or 3-dimensional vector.
This gives us not only an efficient representation but also an interpretable
latent space for editing the image style. We represent the global color mapping
between a pair of images as a custom normalizing flow, conditioned on a
polynomial basis of the pixel color. We show that such a network is more
effective than PCA or VAE at encoding image style in low-dimensional space and
lets us obtain an accuracy close to 40 dB, which is about 7-10 dB improvement
over the state-of-the-art methods.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2022 01:26:16 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Oct 2022 16:10:28 GMT'}]",2022-10-05,"[['Mustafa', 'Aamir', ''], ['Hanji', 'Param', ''], ['Mantiuk', 'Rafal K.', '']]","['tone mapping', 'inverse tone mapping', 'color mapping', 'normalizingflows', 'dimensionality reduction']"
10433,2202.13403,Gerald Schwiebert,"Gerald Schwiebert, Cornelius Weber, Leyuan Qu, Henrique Siqueira,
  Stefan Wermter","A Multimodal German Dataset for Automatic Lip Reading Systems and
  Transfer Learning",Accepted to LREC 2022,"Proceedings of the 13th Conference on Language Resources and
  Evaluation (LREC 2022), pages 6829-6836",10.25592/uhhfdm.10047,,cs.CV cs.CL cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Large datasets as required for deep learning of lip reading do not exist in
many languages. In this paper we present the dataset GLips (German Lips)
consisting of 250,000 publicly available videos of the faces of speakers of the
Hessian Parliament, which was processed for word-level lip reading using an
automatic pipeline. The format is similar to that of the English language LRW
(Lip Reading in the Wild) dataset, with each video encoding one word of
interest in a context of 1.16 seconds duration, which yields compatibility for
studying transfer learning between both datasets. By training a deep neural
network, we investigate whether lip reading has language-independent features,
so that datasets of different languages can be used to improve lip reading
models. We demonstrate learning from scratch and show that transfer learning
from LRW to GLips and vice versa improves learning speed and performance, in
particular for the validation set.
","[{'version': 'v1', 'created': 'Sun, 27 Feb 2022 17:37:35 GMT'}, {'version': 'v2', 'created': 'Thu, 5 May 2022 13:41:55 GMT'}, {'version': 'v3', 'created': 'Wed, 11 May 2022 10:21:56 GMT'}]",2022-07-12,"[['Schwiebert', 'Gerald', ''], ['Weber', 'Cornelius', ''], ['Qu', 'Leyuan', ''], ['Siqueira', 'Henrique', ''], ['Wermter', 'Stefan', '']]","['Audio-visual', 'Dataset', 'Lip reading', 'Automatic Speech Recognition', 'Deep Learning', 'Transfer Learning', 'Computer Vision']"
10434,1410.7254,"Bj\""orn Gmeiner","B. Gmeiner, T. Gradl, F. Gaspar, U. R\""ude","Optimization of the Multigrid-Convergence Rate on Semi-structured Meshes
  by Local Fourier Analysis",,"Computers & Mathematics with Applications, 65(4), 694-711 (2013)",10.1016/j.camwa.2012.12.006,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper a local Fourier analysis for multigrid methods on tetrahedral
grids is presented. Different smoothers for the discretization of the Laplace
operator by linear finite elements on such grids are analyzed. A four-color
smoother is presented as an efficient choice for regular tetrahedral grids,
whereas line and plane relaxations are needed for poorly shaped tetrahedra. A
novel partitioning of the Fourier space is proposed to analyze the four-color
smoother. Numerical test calculations validate the theoretical predictions. A
multigrid method is constructed in a block-wise form, by using different
smoothers and different numbers of pre- and post-smoothing steps in each
tetrahedron of the coarsest grid of the domain. Some numerical experiments are
presented to illustrate the efficiency of this multigrid algorithm.
","[{'version': 'v1', 'created': 'Mon, 27 Oct 2014 14:30:19 GMT'}]",2014-10-28,"[['Gmeiner', 'B.', ''], ['Gradl', 'T.', ''], ['Gaspar', 'F.', ''], ['Rüde', 'U.', '']]","['multigrid', 'local Fourier analysis', 'convergence rate', 'smoothers']"
10435,2208.06756,Tareque Rahman Ornob,"Md Moniruzzaman Emon, Tareque Rahman Ornob, Moqsadur Rahman",Predicting skull fractures via CNN with classification algorithms,,ICCA 2022: 2nd International Conference on Computing Advancements,10.1145/3542954.3543017,,cs.CV cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Computer Tomography (CT) images have become quite important to diagnose
diseases. CT scan slice contains a vast amount of data that may not be properly
examined with the requisite precision and speed using normal visual inspection.
A computer-assisted skull fracture classification expert system is needed to
assist physicians. Convolutional Neural Networks (CNNs) are the most
extensively used deep learning models for image categorization since most often
time they outperform other models in terms of accuracy and results. The CNN
models were then developed and tested, and several convolutional neural network
(CNN) architectures were compared. ResNet50, which was used for feature
extraction combined with a gradient boosted decision tree machine learning
algorithm to act as a classifier for the categorization of skull fractures from
brain CT scans into three fracture categories, had the best overall F1-score of
96%, Hamming Score of 95%, Balanced accuracy Score of 94% & ROC AUC curve of
96% for the classification of skull fractures.
","[{'version': 'v1', 'created': 'Sun, 14 Aug 2022 01:37:23 GMT'}]",2022-08-18,"[['Emon', 'Md Moniruzzaman', ''], ['Ornob', 'Tareque Rahman', ''], ['Rahman', 'Moqsadur', '']]","['Skull fracture', 'Deep learning', 'Convolutional Neural Network', 'Medical Image Analysis', 'Computer vision']"
10436,2107.00593,Lucius Bynum,"Lucius E. J. Bynum, Joshua R. Loftus, Julia Stoyanovich",Disaggregated Interventions to Reduce Inequality,,,10.1145/3465416.3483286,,cs.LG cs.AI cs.CY stat.AP stat.ML,http://creativecommons.org/licenses/by-sa/4.0/,"  A significant body of research in the data sciences considers unfair
discrimination against social categories such as race or gender that could
occur or be amplified as a result of algorithmic decisions. Simultaneously,
real-world disparities continue to exist, even before algorithmic decisions are
made. In this work, we draw on insights from the social sciences brought into
the realm of causal modeling and constrained optimization, and develop a novel
algorithmic framework for tackling pre-existing real-world disparities. The
purpose of our framework, which we call the ""impact remediation framework,"" is
to measure real-world disparities and discover the optimal intervention
policies that could help improve equity or access to opportunity for those who
are underserved with respect to an outcome of interest. We develop a
disaggregated approach to tackling pre-existing disparities that relaxes the
typical set of assumptions required for the use of social categories in
structural causal models. Our approach flexibly incorporates counterfactuals
and is compatible with various ontological assumptions about the nature of
social categories. We demonstrate impact remediation with a hypothetical case
study and compare our disaggregated approach to an existing state-of-the-art
approach, comparing its structure and resulting policy recommendations. In
contrast to most work on optimal policy learning, we explore disparity
reduction itself as an objective, explicitly focusing the power of algorithms
on reducing inequality.
","[{'version': 'v1', 'created': 'Thu, 1 Jul 2021 16:35:12 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Sep 2021 18:40:22 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Dec 2022 22:39:36 GMT'}]",2022-12-09,"[['Bynum', 'Lucius E. J.', ''], ['Loftus', 'Joshua R.', ''], ['Stoyanovich', 'Julia', '']]","['causal modeling', 'fairness', 'inequality', 'social categories']"
10437,2103.10699,Aleksandr Petiushko,"Maksim Dzabraev, Maksim Kalashnikov, Stepan Komkov, Aleksandr
  Petiushko",MDMMT: Multidomain Multimodal Transformer for Video Retrieval,,CVPR Workshops 2021: 3354-3363,10.1109/CVPRW53098.2021.00374,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new state-of-the-art on the text to video retrieval task on
MSRVTT and LSMDC benchmarks where our model outperforms all previous solutions
by a large margin. Moreover, state-of-the-art results are achieved with a
single model on two datasets without finetuning. This multidomain
generalisation is achieved by a proper combination of different video caption
datasets. We show that training on different datasets can improve test results
of each other. Additionally we check intersection between many popular datasets
and found that MSRVTT has a significant overlap between the test and the train
parts, and the same situation is observed for ActivityNet.
","[{'version': 'v1', 'created': 'Fri, 19 Mar 2021 09:16:39 GMT'}]",2021-11-09,"[['Dzabraev', 'Maksim', ''], ['Kalashnikov', 'Maksim', ''], ['Komkov', 'Stepan', ''], ['Petiushko', 'Aleksandr', '']]","['video', 'language', 'retrieval', 'multi-modal', 'cross-modal', 'temporality', 'transformer', 'attention']"
10438,2202.09231,"Nathana\""elle Courant","Nathana\""elle Courant (Inria, France), Julien Lepiller (Yale
  University, USA), Gabriel Scherer (Inria, France)",Debootstrapping without Archeology: Stacked Implementations in Camlboot,,"The Art, Science, and Engineering of Programming, 2022, Vol. 6,
  Issue 3, Article 13",10.22152/programming-journal.org/2022/6/13,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: It is common for programming languages that their reference
implementation is implemented in the language itself. This requires a
""bootstrap"": a copy of a previous version of the implementation is provided
along with the sources, to be able to run the implementation itself. Those
bootstrap files are opaque binaries; they could contain bugs, or even malicious
changes that could reproduce themselves when running the source version of the
language implementation -- this is called the ""trusting trust attack"". For this
reason, a collective project called Bootstrappable was launched in 2016 to
remove those bootstraps, providing alternative build paths that do not rely on
opaque binaries.
  Inquiry: Debootstrapping generally combines a mix of two approaches. The
""archaeological"" approach works by locating old versions of systems, or legacy
alternative implementations, that do not need the bootstrap, and by preserving
or restoring the ability to run them. The ""tailored"" approach re-implements a
new, non-bootstrapped implementation of the system to debootstrap. Currently,
the ""tailored"" approach is dominant for low-level system components (C,
coreutils), and the ""archaeological"" approach is dominant among the few
higher-level languages that were debootstrapped.
  Approach: We advocate for the benefits of ""tailored"" debootstrapping
implementations of high-level languages. The new implementation needs not be
production-ready, it suffices that it is able to run the reference
implementation correctly. We argue that this is feasible with a reasonable
development effort, with several side benefits besides debootstrapping.
  Knowledge: We propose a specific design of composing/stacking several
implementations: a reference interpreter for the language of interest,
implemented in a small subset of the language, and a compiler for this small
subset (in another language). Developing a reference interpreter is valuable
independently of debootstrapping: it may help clarify the language semantics,
and can be reused for other purposes such as differential testing of the other
implementations.
  Grounding: We present Camlboot, our project to debootstrap the OCaml
compiler, version 4.07. Once we converged on this final design, the last
version of Camlboot took about a person-month of implementation effort,
demonstrating feasibility. Using diverse double-compilation, we were able to
prove the absence of trusting trust attack in the existing bootstrap of the
standard OCaml implementation.
  Importance: To our knowledge, this document is the first scholarly discussion
of ""tailored"" debootstrapping for high-level programming languages.
Debootstrapping is an interesting problem which recently grew an active
community of free software contributors, but so far the interactions with the
programming-language research community have been minimal. We share our
experience on Camlboot, trying to highlight aspects that are of interest to
other language designers and implementors; we hope to foster stronger ties
between the Bootstrappable project and relevant academic communities. In
particular, the debootstrapping experience has been an interesting reflection
on OCaml design and implementation, and we hope that other language
implementors would find it equally valuable.
","[{'version': 'v1', 'created': 'Fri, 18 Feb 2022 14:55:14 GMT'}]",2022-02-21,"[['Courant', 'Nathanaëlle', '', 'Inria, France'], ['Lepiller', 'Julien', '', 'Yale\n  University, USA'], ['Scherer', 'Gabriel', '', 'Inria, France']]","['programming language', 'compilation', 'bootstrap', 'ocaml']"
10439,cs/0408063,Alexander Haubold,"Alexander Haubold, John R. Kender","Analysis and Visualization of Index Words from Audio Transcripts of
  Instructional Videos","2004 IEEE International Workshop on Multimedia Content-based Analysis
  and Retrieval; 20 pages, 8 figures, 7 tables",,10.1109/MMSE.2004.27,,cs.IR cs.MM,,"  We introduce new techniques for extracting, analyzing, and visualizing
textual contents from instructional videos of low production quality. Using
Automatic Speech Recognition, approximate transcripts (H75% Word Error Rate)
are obtained from the originally highly compressed videos of university
courses, each comprising between 10 to 30 lectures. Text material in the form
of books or papers that accompany the course are then used to filter meaningful
phrases from the seemingly incoherent transcripts. The resulting index into the
transcripts is tied together and visualized in 3 experimental graphs that help
in understanding the overall course structure and provide a tool for localizing
certain topics for indexing. We specifically discuss a Transcript Index Map,
which graphically lays out key phrases for a course, a Textbook Chapter to
Transcript Match, and finally a Lecture Transcript Similarity graph, which
clusters semantically similar lectures. We test our methods and tools on 7 full
courses with 230 hours of video and 273 transcripts. We are able to extract up
to 98 unique key terms for a given transcript and up to 347 unique key terms
for an entire course. The accuracy of the Textbook Chapter to Transcript Match
exceeds 70% on average. The methods used can be applied to genres of video in
which there are recurrent thematic words (news, sports, meetings,...)
","[{'version': 'v1', 'created': 'Fri, 27 Aug 2004 20:45:32 GMT'}]",2016-11-15,"[['Haubold', 'Alexander', ''], ['Kender', 'John R.', '']]","['audio transcript', 'ASR', 'textbook index', 'key word', 'key phrase', 'university course', 'lecture', 'video']"
10440,2111.13149,Jo\~ao Vitorino,"Jo\~ao Vitorino, Rui Andrade, Isabel Pra\c{c}a, Orlando Sousa, Eva
  Maia","A Comparative Analysis of Machine Learning Techniques for IoT Intrusion
  Detection","16 pages, 12 tables, 4 figures, FPS 2021 conference",,10.1007/978-3-031-08147-7_13,,cs.CR cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The digital transformation faces tremendous security challenges. In
particular, the growing number of cyber-attacks targeting Internet of Things
(IoT) systems restates the need for a reliable detection of malicious network
activity. This paper presents a comparative analysis of supervised,
unsupervised and reinforcement learning techniques on nine malware captures of
the IoT-23 dataset, considering both binary and multi-class classification
scenarios. The developed models consisted of Support Vector Machine (SVM),
Extreme Gradient Boosting (XGBoost), Light Gradient Boosting Machine
(LightGBM), Isolation Forest (iForest), Local Outlier Factor (LOF) and a Deep
Reinforcement Learning (DRL) model based on a Double Deep Q-Network (DDQN),
adapted to the intrusion detection context. The most reliable performance was
achieved by LightGBM. Nonetheless, iForest displayed good anomaly detection
results and the DRL model demonstrated the possible benefits of employing this
methodology to continuously improve the detection. Overall, the obtained
results indicate that the analyzed techniques are well suited for IoT intrusion
detection.
","[{'version': 'v1', 'created': 'Thu, 25 Nov 2021 16:14:54 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Dec 2021 12:27:02 GMT'}, {'version': 'v3', 'created': 'Wed, 1 Jun 2022 12:40:59 GMT'}]",2022-06-02,"[['Vitorino', 'João', ''], ['Andrade', 'Rui', ''], ['Praça', 'Isabel', ''], ['Sousa', 'Orlando', ''], ['Maia', 'Eva', '']]","['internet of things', 'intrusion detection', 'supervised learning', 'unsupervised learning', 'reinforcement learning']"
10441,2205.02711,Xin Chen,"Xin Chen, Qingtao Tang, Ke Hu, Yue Xu, Shihang Qiu, Jia Cheng, Jun Lei","Hybrid CNN Based Attention with Category Prior for User Image Behavior
  Modeling",Accepted by SIGIR 2022,,10.1145/3477495.3531854,,cs.CV cs.AI,http://creativecommons.org/licenses/by/4.0/,"  User historical behaviors are proved useful for Click Through Rate (CTR)
prediction in online advertising system. In Meituan, one of the largest
e-commerce platform in China, an item is typically displayed with its image and
whether a user clicks the item or not is usually influenced by its image, which
implies that user's image behaviors are helpful for understanding user's visual
preference and improving the accuracy of CTR prediction. Existing user image
behavior models typically use a two-stage architecture, which extracts visual
embeddings of images through off-the-shelf Convolutional Neural Networks (CNNs)
in the first stage, and then jointly trains a CTR model with those visual
embeddings and non-visual features. We find that the two-stage architecture is
sub-optimal for CTR prediction. Meanwhile, precisely labeled categories in
online ad systems contain abundant visual prior information, which can enhance
the modeling of user image behaviors. However, off-the-shelf CNNs without
category prior may extract category unrelated features, limiting CNN's
expression ability. To address the two issues, we propose a hybrid CNN based
attention module, unifying user's image behaviors and category prior, for CTR
prediction. Our approach achieves significant improvements in both online and
offline experiments on a billion scale real serving dataset.
","[{'version': 'v1', 'created': 'Thu, 5 May 2022 15:31:47 GMT'}]",2022-05-06,"[['Chen', 'Xin', ''], ['Tang', 'Qingtao', ''], ['Hu', 'Ke', ''], ['Xu', 'Yue', ''], ['Qiu', 'Shihang', ''], ['Cheng', 'Jia', ''], ['Lei', 'Jun', '']]","['online advertising', 'user modeling', 'image behavior']"
10442,1910.09437,Tahar M Kechadi,"M-Tahar Kechadi, Kok Seng Low, G.Goncalves",Recurrent neural network approach for cyclic job shop scheduling problem,"Journal of Manufacturing Systems, Volume 32, Issue 4, October 2013,
  Pages 689-699",,10.1016/j.jmsy.2013.02.001,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While cyclic scheduling is involved in numerous real-world applications,
solving the derived problem is still of exponential complexity. This paper
focuses specifically on modelling the manufacturing application as a cyclic job
shop problem and we have developed an efficient neural network approach to
minimise the cycle time of a schedule. Our approach introduces an interesting
model for a manufacturing production, and it is also very efficient, adaptive
and flexible enough to work with other techniques. Experimental results
validated the approach and confirmed our hypotheses about the system model and
the efficiency of neural networks for such a class of problems.
","[{'version': 'v1', 'created': 'Mon, 21 Oct 2019 15:13:48 GMT'}]",2019-10-22,"[['Kechadi', 'M-Tahar', ''], ['Low', 'Kok Seng', ''], ['Goncalves', 'G.', '']]","['Neural networks', 'Cyclic job scheduling', 'Manufacturing processes', 'Unconstrained optimisation problem']"
10443,2001.01680,Mingyuan Meng,"Mingyuan Meng, Xingyu Yang, Lei Bi, Jinman Kim, Shanlin Xiao, and
  Zhiyi Yu","High-parallelism Inception-like Spiking Neural Networks for Unsupervised
  Feature Learning",Published at Neurocomputing,"Neurocomputing, vol. 441, pp. 92-104, 2021",10.1016/j.neucom.2021.02.027,,cs.NE cs.LG q-bio.NC stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Spiking Neural Networks (SNNs) are brain-inspired, event-driven machine
learning algorithms that have been widely recognized in producing
ultra-high-energy-efficient hardware. Among existing SNNs, unsupervised SNNs
based on synaptic plasticity, especially Spike-Timing-Dependent Plasticity
(STDP), are considered to have great potential in imitating the learning
process of the biological brain. Nevertheless, the existing STDP-based SNNs
have limitations in constrained learning capability and/or slow learning speed.
Most STDP-based SNNs adopted a slow-learning Fully-Connected (FC) architecture
and used a sub-optimal vote-based scheme for spike decoding. In this paper, we
overcome these limitations with: 1) a design of high-parallelism network
architecture, inspired by the Inception module in Artificial Neural Networks
(ANNs); 2) use of a Vote-for-All (VFA) decoding layer as a replacement to the
standard vote-based spike decoding scheme, to reduce the information loss in
spike decoding and, 3) a proposed adaptive repolarization (resetting) mechanism
that accelerates SNNs' learning by enhancing spiking activities. Our
experimental results on two established benchmark datasets (MNIST/EMNIST) show
that our network architecture resulted in superior performance compared to the
widely used FC architecture and a more advanced Locally-Connected (LC)
architecture, and that our SNN achieved competitive results with
state-of-the-art unsupervised SNNs (95.64%/80.11% accuracy on the MNIST/EMNISE
dataset) while having superior learning efficiency and robustness against
hardware damage. Our SNN achieved great classification accuracy with only
hundreds of training iterations, and random destruction of large numbers of
synapses or neurons only led to negligible performance degradation.
","[{'version': 'v1', 'created': 'Mon, 2 Dec 2019 17:19:17 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Jan 2020 17:53:25 GMT'}, {'version': 'v3', 'created': 'Sun, 12 Apr 2020 14:25:23 GMT'}, {'version': 'v4', 'created': 'Thu, 4 Jun 2020 16:05:09 GMT'}, {'version': 'v5', 'created': 'Tue, 9 Mar 2021 04:00:23 GMT'}]",2022-09-20,"[['Meng', 'Mingyuan', ''], ['Yang', 'Xingyu', ''], ['Bi', 'Lei', ''], ['Kim', 'Jinman', ''], ['Xiao', 'Shanlin', ''], ['Yu', 'Zhiyi', '']]","['Spiking Neural Network (SNN)', 'Unsupervised Learning', 'Inception Module', 'Learning Efficiency', 'Robustness']"
10444,2008.03649,Edward Pantridge,"Edward Pantridge, Lee Spector",Code Building Genetic Programming,"Proceedings of the 2020 Genetic and Evolutionary Computation
  Conference, Genetic Programming Track",,10.1145/3377930.3390239,,cs.PL cs.NE cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years the field of genetic programming has made significant
advances towards automatic programming. Research and development of
contemporary program synthesis methods, such as PushGP and Grammar Guided
Genetic Programming, can produce programs that solve problems typically
assigned in introductory academic settings. These problems focus on a narrow,
predetermined set of simple data structures, basic control flow patterns, and
primitive, non-overlapping data types (without, for example, inheritance or
composite types). Few, if any, genetic programming methods for program
synthesis have convincingly demonstrated the capability of synthesizing
programs that use arbitrary data types, data structures, and specifications
that are drawn from existing codebases. In this paper, we introduce Code
Building Genetic Programming (CBGP) as a framework within which this can be
done, by leveraging programming language features such as reflection and
first-class specifications. CBGP produces a computational graph that can be
executed or translated into source code of a host language. To demonstrate the
novel capabilities of CBGP, we present results on new benchmarks that use
non-primitive, polymorphic data types as well as some standard program
synthesis benchmarks.
","[{'version': 'v1', 'created': 'Sun, 9 Aug 2020 04:33:04 GMT'}]",2020-08-11,"[['Pantridge', 'Edward', ''], ['Spector', 'Lee', '']]","['automatic programming', 'genetic programming', 'inductive programsynthesis']"
10445,2101.06283,Young-Ho Kim,"Young-Ho Kim, Bongshin Lee, Arjun Srinivasan, Eun Kyoung Choe","Data@Hand: Fostering Visual Exploration of Personal Data on Smartphones
  Leveraging Speech and Touch Interaction","To appear in ACM CHI 2021 Conference on Human Factors in Computing
  Systems; 16 pages, 6 figures, 5 tables","In CHI Conference on Human Factors in Computing Systems (CHI '21),
  May 8-13, 2021, Yokohama, Japan",10.1145/3411764.3445421,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most mobile health apps employ data visualization to help people view their
health and activity data, but these apps provide limited support for visual
data exploration. Furthermore, despite its huge potential benefits, mobile
visualization research in the personal data context is sparse. This work aims
to empower people to easily navigate and compare their personal health data on
smartphones by enabling flexible time manipulation with speech. We designed and
developed Data@Hand, a mobile app that leverages the synergy of two
complementary modalities: speech and touch. Through an exploratory study with
13 long-term Fitbit users, we examined how multimodal interaction helps
participants explore their own health data. Participants successfully adopted
multimodal interaction (i.e., speech and touch) for convenient and fluid data
exploration. Based on the quantitative and qualitative findings, we discuss
design implications and opportunities with multimodal interaction for better
supporting visual data exploration on mobile devices.
","[{'version': 'v1', 'created': 'Fri, 15 Jan 2021 19:28:42 GMT'}]",2021-01-19,"[['Kim', 'Young-Ho', ''], ['Lee', 'Bongshin', ''], ['Srinivasan', 'Arjun', ''], ['Choe', 'Eun Kyoung', '']]","['Personal informatics', 'data visualization', 'multimodal interaction', 'speech', 'smartphone']"
10446,2110.15130,Felix Soldner,"Felix Soldner, Bennett Kleinberg, Shane Johnson","Confounds and Overestimations in Fake Review Detection: Experimentally
  Controlling for Product-Ownership and Data-Origin",,,10.1371/journal.pone.0277869,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  The popularity of online shopping is steadily increasing. At the same time,
fake product reviewsare published widely and have the potential to affect
consumer purchasing behavior. In response,previous work has developed automated
methods for the detection of deceptive product reviews.However, studies vary
considerably in terms of classification performance, and many use data
thatcontain potential confounds, which makes it difficult to determine their
validity. Two possibleconfounds are data-origin (i.e., the dataset is composed
of more than one source) and productownership (i.e., reviews written by
individuals who own or do not own the reviewed product). Inthe present study,
we investigate the effect of both confounds for fake review detection. Using
anexperimental design, we manipulate data-origin, product ownership, review
polarity, and veracity.Supervised learning analysis suggests that review
veracity (60.26 - 69.87%) is somewhat detectablebut reviews additionally
confounded with product-ownership (66.19 - 74.17%), or with data-origin(84.44 -
86.94%) are easier to classify. Review veracity is most easily classified if
confounded withproduct-ownership and data-origin combined (87.78 - 88.12%),
suggesting overestimations of thetrue performance in other work. These findings
are moderated by review polarity.
","[{'version': 'v1', 'created': 'Thu, 28 Oct 2021 14:04:03 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Dec 2022 10:53:51 GMT'}]",2023-01-11,"[['Soldner', 'Felix', ''], ['Kleinberg', 'Bennett', ''], ['Johnson', 'Shane', '']]","['Machine learning', 'Data bias', 'Deception detection', 'smartphone reviews']"
10447,2007.01017,Xabier Echeberria-Barrio,"Xabier Echeberria-Barrio, Amaia Gil-Lerchundi, Ines
  Goicoechea-Telleria and Raul Orduna-Urrutia","Deep Learning Defenses Against Adversarial Examples for Dynamic Risk
  Assessment","11 pages, 10 figures, CISIS2020 conference",,10.1007/978-3-030-57805-3_30,,cs.LG cs.CR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep Neural Networks were first developed decades ago, but it was not until
recently that they started being extensively used, due to their computing power
requirements. Since then, they are increasingly being applied to many fields
and have undergone far-reaching advancements. More importantly, they have been
utilized for critical matters, such as making decisions in healthcare
procedures or autonomous driving, where risk management is crucial. Any
mistakes in the diagnostics or decision-making in these fields could entail
grave accidents, and even death. This is preoccupying, because it has been
repeatedly reported that it is straightforward to attack this type of models.
Thus, these attacks must be studied to be able to assess their risk, and
defenses need to be developed to make models more robust. For this work, the
most widely known attack was selected (adversarial attack) and several defenses
were implemented against it (i.e. adversarial training, dimensionality reduc
tion and prediction similarity). The obtained outcomes make the model more
robust while keeping a similar accuracy. The idea was developed using a breast
cancer dataset and a VGG16 and dense neural network model, but the solutions
could be applied to datasets from other areas and different convolutional and
dense deep neural network models.
","[{'version': 'v1', 'created': 'Thu, 2 Jul 2020 11:01:27 GMT'}]",2022-07-20,"[['Echeberria-Barrio', 'Xabier', ''], ['Gil-Lerchundi', 'Amaia', ''], ['Goicoechea-Telleria', 'Ines', ''], ['Orduna-Urrutia', 'Raul', '']]","['Adversarial attacks', 'Adversarial defenses', 'Dynamic risk']"
10448,2106.02426,Zekun Luo,"Zekun Luo, Zheng Fang, Sixiao Zheng, Yabiao Wang, Yanwei Fu","NMS-Loss: Learning with Non-Maximum Suppression for Crowded Pedestrian
  Detection",ICMR2021 camera ready version,,10.1145/3460426.3463588,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Non-Maximum Suppression (NMS) is essential for object detection and affects
the evaluation results by incorporating False Positives (FP) and False
Negatives (FN), especially in crowd occlusion scenes. In this paper, we raise
the problem of weak connection between the training targets and the evaluation
metrics caused by NMS and propose a novel NMS-Loss making the NMS procedure can
be trained end-to-end without any additional network parameters. Our NMS-Loss
punishes two cases when FP is not suppressed and FN is wrongly eliminated by
NMS. Specifically, we propose a pull loss to pull predictions with the same
target close to each other, and a push loss to push predictions with different
targets away from each other. Experimental results show that with the help of
NMS-Loss, our detector, namely NMS-Ped, achieves impressive results with Miss
Rate of 5.92% on Caltech dataset and 10.08% on CityPersons dataset, which are
both better than state-of-the-art competitors.
","[{'version': 'v1', 'created': 'Fri, 4 Jun 2021 12:06:46 GMT'}]",2021-06-07,"[['Luo', 'Zekun', ''], ['Fang', 'Zheng', ''], ['Zheng', 'Sixiao', ''], ['Wang', 'Yabiao', ''], ['Fu', 'Yanwei', '']]","['pedestrian detection', 'loss function', 'Non-Maximum suppression']"
10449,2106.09399,Antti Rousi Dr.,"Antti Mikael Rousi (Research services, Aalto University)","Using current research information systems to investigate data
  acquisition and data sharing practices of computer scientists",e-pub ahead of print version,"Journal of Librarianship and Information Science, 2022",10.1177/09610006221093049,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Without sufficient information about research data practices occurring in a
particular research organisation, there is a risk of mismatching research data
service efforts with the needs of its researchers. This study describes how
data acquiring and data sharing occurring within a particular research
organisation can be investigated by using current research information system
publication data. A sample of 193 journal articles published by researchers in
the computer science department of the case study's university during 2019 were
extracted for scrutiny from the current research information system. For these
193 articles, a classification of the main study types was developed to
accommodate the multidisciplinary nature of the case department's research
agenda. Furthermore, a coding framework was developed to capture the key
elements of data acquiring and data sharing. The articles representing life
sciences and computational research relatively frequently reused open data,
whereas data acquisition of experimental research, human interaction studies
and human intervention studies often relied on collecting original data. Data
sharing also differed between the computationally intensive study types of life
sciences and computational research and the study types relying on collection
of original data. Research data were not available for reuse in only a minority
of life science (n= 2; 7%) and computational research (n = 15; 14%) studies.
The study types of experimental research, human interaction studies and human
intervention studies less frequently made their data available for reuse. This
study demonstrates that analyses of publications listed in current research
information systems provide detailed descriptions how the affiliated
researchers acquire and share research data.
","[{'version': 'v1', 'created': 'Thu, 17 Jun 2021 11:34:26 GMT'}, {'version': 'v2', 'created': 'Wed, 11 May 2022 10:49:57 GMT'}]",2022-05-12,"[['Rousi', 'Antti Mikael', '', 'Research services, Aalto University']]","['Computer science', 'current research information systems', 'data sharing', 'FAIR data', 'open science', 'research data management']"
10450,2106.12343,Arthur Drichel,"Arthur Drichel, Vincent Drury, Justus von Brandt, Ulrike Meyer","Finding Phish in a Haystack: A Pipeline for Phishing Classification on
  Certificate Transparency Logs","Accepted at The 16th International Conference on Availability,
  Reliability and Security (ARES 2021)",,10.1145/3465481.3470111,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current popular phishing prevention techniques mainly utilize reactive
blocklists, which leave a ``window of opportunity'' for attackers during which
victims are unprotected. One possible approach to shorten this window aims to
detect phishing attacks earlier, during website preparation, by monitoring
Certificate Transparency (CT) logs. Previous attempts to work with CT log data
for phishing classification exist, however they lack evaluations on actual CT
log data. In this paper, we present a pipeline that facilitates such
evaluations by addressing a number of problems when working with CT log data.
The pipeline includes dataset creation, training, and past or live
classification of CT logs. Its modular structure makes it possible to easily
exchange classifiers or verification sources to support ground truth labeling
efforts and classifier comparisons. We test the pipeline on a number of new and
existing classifiers, and find a general potential to improve classifiers for
this scenario in the future. We publish the source code of the pipeline and the
used datasets along with this paper
(https://gitlab.com/rwth-itsec/ctl-pipeline), thus making future research in
this direction more accessible.
","[{'version': 'v1', 'created': 'Wed, 23 Jun 2021 12:24:19 GMT'}]",2021-06-24,"[['Drichel', 'Arthur', ''], ['Drury', 'Vincent', ''], ['von Brandt', 'Justus', ''], ['Meyer', 'Ulrike', '']]","['Phishing detection', 'certificate transparency', 'machine learning']"
10451,2106.11770,Raviraj Joshi,"Prutha Gaherwar, Shraddha Joshi, Raviraj Joshi, Rahul Khengare",SISA: Securing Images by Selective Alteration,Accepted at ICTCS 2020,,10.1007/978-981-16-0739-4_69,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With an increase in mobile and camera devices' popularity, digital content in
the form of images has increased drastically. As personal life is being
continuously documented in pictures, the risk of losing it to eavesdroppers is
a matter of grave concern. Secondary storage is the most preferred medium for
the storage of personal and other images. Our work is concerned with the
security of such images. While encryption is the best way to ensure image
security, full encryption and decryption is a computationally-intensive
process. Moreover, as cameras are getting better every day, image quality, and
thus, the pixel density has increased considerably. The increased pixel density
makes encryption and decryption more expensive. We, therefore, delve into
selective encryption and selective blurring based on the region of interest.
Instead of encrypting or blurring the entire photograph, we only encode
selected regions of the image. We present a comparative analysis of the partial
and full encryption of the photos. This kind of encoding will help us lower the
encryption overhead without compromising security. The applications utilizing
this technique will become more usable due to the reduction in the decryption
time. Additionally, blurred images being more readable than encrypted ones,
allowed us to define the level of security. We leverage the machine learning
algorithms like Mask-RCNN (Region-based convolutional neural network) and YOLO
(You Only Look Once) to select the region of interest. These algorithms have
set new benchmarks for object recognition. We develop an end to end system to
demonstrate our idea of selective encryption.
","[{'version': 'v1', 'created': 'Sun, 20 Jun 2021 05:31:47 GMT'}]",2021-07-28,"[['Gaherwar', 'Prutha', ''], ['Joshi', 'Shraddha', ''], ['Joshi', 'Raviraj', ''], ['Khengare', 'Rahul', '']]","['Image Processing', 'Image Security', 'Encryption', 'Decryption', 'Deep Learning', 'Blurring']"
10452,2104.13248,Mohamed Wahib,"Peng Chen, Mohamed Wahib, Xiao Wang, Shinichiro Takizawa, Takahiro
  Hirofuchi, Hirotaka Ogawa, Satoshi Matsuoka","Performance Portable Back-projection Algorithms on CPUs: Agnostic Data
  Locality and Vectorization Optimizations",ACM International Conference on Supercomputing 2021 (ICS'21),,10.1145/3447818.3460353,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Computed Tomography (CT) is a key 3D imaging technology that fundamentally
relies on the compute-intense back-projection operation to generate 3D volumes.
GPUs are typically used for back-projection in production CT devices. However,
with the rise of power-constrained micro-CT devices, and also the emergence of
CPUs comparable in performance to GPUs, back-projection for CPUs could become
favorable. Unlike GPUs, extracting parallelism for back-projection algorithms
on CPUs is complex given that parallelism and locality are not explicitly
defined and controlled by the programmer, as is the case when using CUDA for
instance. We propose a collection of novel back-projection algorithms that
reduce the arithmetic computation, robustly enable vectorization, enforce a
regular memory access pattern, and maximize the data locality. We also
implement the novel algorithms as efficient back-projection kernels that are
performance portable over a wide range of CPUs. Performance evaluation using a
variety of CPUs from different vendors and generations demonstrates that our
back-projection implementation achieves on average 5.2x speedup over the
multi-threaded implementation of the most widely used, and optimized, open
library. With a state-of-the-art CPU, we reach performance that rivals
top-performing GPUs.
","[{'version': 'v1', 'created': 'Tue, 27 Apr 2021 15:01:12 GMT'}]",2021-04-28,"[['Chen', 'Peng', ''], ['Wahib', 'Mohamed', ''], ['Wang', 'Xiao', ''], ['Takizawa', 'Shinichiro', ''], ['Hirofuchi', 'Takahiro', ''], ['Ogawa', 'Hirotaka', ''], ['Matsuoka', 'Satoshi', '']]","['Computed Tomography', 'Data Locality', 'Vectorization']"
10453,cs/0610066,Frederic Blanqui,"Fr\'ed\'eric Blanqui (LRI), Jean-Pierre Jouannaud (LRI), Mitsuhiro
  Okada",Inductive-data-type Systems,Theoretical Computer Science (2002),,10.1016/S0304-3975(00)00347-9,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a previous work (""Abstract Data Type Systems"", TCS 173(2), 1997), the last
two authors presented a combined language made of a (strongly normalizing)
algebraic rewrite system and a typed lambda-calculus enriched by
pattern-matching definitions following a certain format, called the ""General
Schema"", which generalizes the usual recursor definitions for natural numbers
and similar ""basic inductive types"". This combined language was shown to be
strongly normalizing. The purpose of this paper is to reformulate and extend
the General Schema in order to make it easily extensible, to capture a more
general class of inductive types, called ""strictly positive"", and to ease the
strong normalization proof of the resulting system. This result provides a
computation model for the combination of an algebraic specification language
based on abstract data types and of a strongly typed functional language with
strictly positive inductive types.
","[{'version': 'v1', 'created': 'Wed, 11 Oct 2006 13:54:42 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Sep 2013 17:40:37 GMT'}]",2013-09-17,"[['Blanqui', 'Frédéric', '', 'LRI'], ['Jouannaud', 'Jean-Pierre', '', 'LRI'], ['Okada', 'Mitsuhiro', '']]","['Higher-order rewriting', 'Strong normalization', 'Inductive types', 'Recursive definitions', 'Typed lambda-calculus']"
10454,2201.06796,Mina Lee,"Mina Lee, Percy Liang, Qian Yang","CoAuthor: Designing a Human-AI Collaborative Writing Dataset for
  Exploring Language Model Capabilities",Published as a conference paper at CHI 2022,,10.1145/3491102.3502030,,cs.HC cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Large language models (LMs) offer unprecedented language generation
capabilities and exciting opportunities for interaction design. However, their
highly context-dependent capabilities are difficult to grasp and are often
subjectively interpreted. In this paper, we argue that by curating and
analyzing large interaction datasets, the HCI community can foster more
incisive examinations of LMs' generative capabilities. Exemplifying this
approach, we present CoAuthor, a dataset designed for revealing GPT-3's
capabilities in assisting creative and argumentative writing. CoAuthor captures
rich interactions between 63 writers and four instances of GPT-3 across 1445
writing sessions. We demonstrate that CoAuthor can address questions about
GPT-3's language, ideation, and collaboration capabilities, and reveal its
contribution as a writing ""collaborator"" under various definitions of good
collaboration. Finally, we discuss how this work may facilitate a more
principled discussion around LMs' promises and pitfalls in relation to
interaction design. The dataset and an interface for replaying the writing
sessions are publicly available at https://coauthor.stanford.edu.
","[{'version': 'v1', 'created': 'Tue, 18 Jan 2022 07:51:57 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Jan 2022 05:29:58 GMT'}]",2022-01-26,"[['Lee', 'Mina', ''], ['Liang', 'Percy', ''], ['Yang', 'Qian', '']]","['Human-AI collaborative writing', 'GPT-3', 'language models', 'dataset', 'crowdsourcing', 'natural language generation', 'writing assistants']"
10455,2207.08320,Noyan Evirgen,"Noyan Evirgen, Xiang 'Anthony' Chen","GANzilla: User-Driven Direction Discovery in Generative Adversarial
  Networks",,,10.1145/3526113.3545638,,cs.HC cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Generative Adversarial Network (GAN) is widely adopted in numerous
application areas, such as data preprocessing, image editing, and creativity
support. However, GAN's 'black box' nature prevents non-expert users from
controlling what data a model generates, spawning a plethora of prior work that
focused on algorithm-driven approaches to extract editing directions to control
GAN. Complementarily, we propose a GANzilla: a user-driven tool that empowers a
user with the classic scatter/gather technique to iteratively discover
directions to meet their editing goals. In a study with 12 participants,
GANzilla users were able to discover directions that (i) edited images to match
provided examples (closed-ended tasks) and that (ii) met a high-level goal,
e.g., making the face happier, while showing diversity across individuals
(open-ended tasks).
","[{'version': 'v1', 'created': 'Sun, 17 Jul 2022 23:55:40 GMT'}, {'version': 'v2', 'created': 'Sat, 13 Aug 2022 06:15:23 GMT'}]",2022-08-16,"[['Evirgen', 'Noyan', ''], ['Chen', ""Xiang 'Anthony'"", '']]","['Generative Adversarial Networks', 'Direction Discovery', 'InteractiveSystems', 'Explainable-AI']"
10456,2005.07849,Jim Samuel,"Cherilyn Conner, Jim Samuel, Andrey Kretinin, Yana Samuel and Lee
  Nadeau",A Picture for the Words! Textual Visualization in Big Data Analytics,"Early stage output for ongoing work on Textual Analytics, Subsequent
  Book Chapter accepted, Journal Manuscript ongoing",,10.13140/RG.2.2.25351.83360,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data Visualization has become an important aspect of big data analytics and
has grown in sophistication and variety. We specifically identify the need for
an analytical framework for data visualization with textual information. Data
visualization is a powerful mechanism to represent data, but the usage of
specific graphical representations needs to be better understood and classified
to validate appropriate representation in the contexts of textual data and
avoid distorted depictions of underlying textual data. We identify prominent
textual data visualization approaches and discuss their characteristics. We
discuss the use of multiple graph types in textual data visualization,
including the use of quantity, sense, trend and context textual data
visualization. We create an explanatory classification framework to position
textual data visualization in a unique way so as to provide insights and assist
in appropriate method or graphical representation classification.
","[{'version': 'v1', 'created': 'Sat, 16 May 2020 02:53:58 GMT'}]",2020-05-19,"[['Conner', 'Cherilyn', ''], ['Samuel', 'Jim', ''], ['Kretinin', 'Andrey', ''], ['Samuel', 'Yana', ''], ['Nadeau', 'Lee', '']]","['Data Visualization', 'Big Data Analytics', 'Textual Visualization']"
10457,1712.02223,Arkaitz Zubiaga,"Arkaitz Zubiaga, Elena Kochkina, Maria Liakata, Rob Procter, Michal
  Lukasik, Kalina Bontcheva, Trevor Cohn, Isabelle Augenstein","Discourse-Aware Rumour Stance Classification in Social Media Using
  Sequential Classifiers",,"Information Processing & Management, Volume 54, Issue 2, March
  2018, Pages 273-290",10.1016/j.ipm.2017.11.009,,cs.CL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rumour stance classification, defined as classifying the stance of specific
social media posts into one of supporting, denying, querying or commenting on
an earlier post, is becoming of increasing interest to researchers. While most
previous work has focused on using individual tweets as classifier inputs, here
we report on the performance of sequential classifiers that exploit the
discourse features inherent in social media interactions or 'conversational
threads'. Testing the effectiveness of four sequential classifiers -- Hawkes
Processes, Linear-Chain Conditional Random Fields (Linear CRF), Tree-Structured
Conditional Random Fields (Tree CRF) and Long Short Term Memory networks (LSTM)
-- on eight datasets associated with breaking news stories, and looking at
different types of local and contextual features, our work sheds new light on
the development of accurate stance classifiers. We show that sequential
classifiers that exploit the use of discourse properties in social media
conversations while using only local features, outperform non-sequential
classifiers. Furthermore, we show that LSTM using a reduced set of features can
outperform the other sequential classifiers; this performance is consistent
across datasets and across types of stances. To conclude, our work also
analyses the different features under study, identifying those that best help
characterise and distinguish between stances, such as supporting tweets being
more likely to be accompanied by evidence than denying tweets. We also set
forth a number of directions for future research.
","[{'version': 'v1', 'created': 'Wed, 6 Dec 2017 15:15:21 GMT'}]",2017-12-07,"[['Zubiaga', 'Arkaitz', ''], ['Kochkina', 'Elena', ''], ['Liakata', 'Maria', ''], ['Procter', 'Rob', ''], ['Lukasik', 'Michal', ''], ['Bontcheva', 'Kalina', ''], ['Cohn', 'Trevor', ''], ['Augenstein', 'Isabelle', '']]","['stance classification', 'social media', 'breaking news', 'veracityclassification']"
10458,2106.16003,Andreas Kassler,"Marcus Pieska, Alexander Rabitsch, Anna Brunstrom, Andreas Kassler,
  Markus Amend","Adaptive Cheapest Path First Scheduling in a Transport-Layer Multi-Path
  Tunnel Context",To appear at Applied Networking Research Workshop (ANRW 2021),,10.1145/3472305.3472316,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bundling multiple access technologies increases capacity, resiliency and
robustness of network connections. Multi-access is currently being standardized
in the ATSSS framework in 3GPP, supporting different access bundling
strategies. Within ATSSS, a multipath scheduler needs to decide which path to
use for each user packet based on path characteristics. The Cheapest Path First
(CPF) scheduler aims to utilize the cheapest path (e.g. WiFi) before sending
packets over other paths (e.g. cellular). In this paper, we demonstrate that
using CPF with an MP-DCCP tunnel may lead to sub-optimal performance. This is
due to adverse interactions between the scheduler and end-to-end and tunnel
congestion control. Hence, we design the Adaptive Cheapest Path First (ACPF)
scheduler that limits queue buildup in the primary bottleneck and moves traffic
to the secondary path earlier. We implement ACPF over both TCP and DCCP
congestion controlled tunnels. Our evaluation shows that ACPF improves the
average throughput over CPF between 24% to 86%.
","[{'version': 'v1', 'created': 'Wed, 30 Jun 2021 11:52:03 GMT'}]",2021-07-01,"[['Pieska', 'Marcus', ''], ['Rabitsch', 'Alexander', ''], ['Brunstrom', 'Anna', ''], ['Kassler', 'Andreas', ''], ['Amend', 'Markus', '']]","['Heterogeneous Wireless Access', '5G', 'ATSSS', 'Multi-Path', 'Unreliable Traffic', 'MP-DCCP', 'Transport Layer']"
10459,2204.09484,Yongchun Zhu,"Yongchun Zhu, Qiang Sheng, Juan Cao, Shuokai Li, Danding Wang, Fuzhen
  Zhuang","Generalizing to the Future: Mitigating Entity Bias in Fake News
  Detection",Accepted by SIGIR 2022,,10.1145/3477495.3531816,,cs.CL cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The wide dissemination of fake news is increasingly threatening both
individuals and society. Fake news detection aims to train a model on the past
news and detect fake news of the future. Though great efforts have been made,
existing fake news detection methods overlooked the unintended entity bias in
the real-world data, which seriously influences models' generalization ability
to future data. For example, 97\% of news pieces in 2010-2017 containing the
entity `Donald Trump' are real in our data, but the percentage falls down to
merely 33\% in 2018. This would lead the model trained on the former set to
hardly generalize to the latter, as it tends to predict news pieces about
`Donald Trump' as real for lower training loss. In this paper, we propose an
entity debiasing framework (\textbf{ENDEF}) which generalizes fake news
detection models to the future data by mitigating entity bias from a
cause-effect perspective. Based on the causal graph among entities, news
contents, and news veracity, we separately model the contribution of each cause
(entities and contents) during training. In the inference stage, we remove the
direct effect of the entities to mitigate entity bias. Extensive offline
experiments on the English and Chinese datasets demonstrate that the proposed
framework can largely improve the performance of base fake news detectors, and
online tests verify its superiority in practice. To the best of our knowledge,
this is the first work to explicitly improve the generalization ability of fake
news detection models to the future data. The code has been released at
https://github.com/ICTMCG/ENDEF-SIGIR2022.
","[{'version': 'v1', 'created': 'Wed, 20 Apr 2022 14:32:34 GMT'}]",2022-04-21,"[['Zhu', 'Yongchun', ''], ['Sheng', 'Qiang', ''], ['Cao', 'Juan', ''], ['Li', 'Shuokai', ''], ['Wang', 'Danding', ''], ['Zhuang', 'Fuzhen', '']]","['Fake News Detection', 'Debias', 'Generalization']"
10460,2202.04966,Lorenzo Vaquero,"Lorenzo Vaquero, V\'ictor M. Brea, Manuel Mucientes",Real-Time Siamese Multiple Object Tracker with Enhanced Proposals,"Accepted at Pattern Recognition. Code available at
  https://github.com/lorenzovaquero/SiamMOTION",,10.1016/j.patcog.2022.109141,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Maintaining the identity of multiple objects in real-time video is a
challenging task, as it is not always feasible to run a detector on every
frame. Thus, motion estimation systems are often employed, which either do not
scale well with the number of targets or produce features with limited semantic
information. To solve the aforementioned problems and allow the tracking of
dozens of arbitrary objects in real-time, we propose SiamMOTION. SiamMOTION
includes a novel proposal engine that produces quality features through an
attention mechanism and a region-of-interest extractor fed by an inertia module
and powered by a feature pyramid network. Finally, the extracted tensors enter
a comparison head that efficiently matches pairs of exemplars and search areas,
generating quality predictions via a pairwise depthwise region proposal network
and a multi-object penalization module. SiamMOTION has been validated on five
public benchmarks, achieving leading performance against current
state-of-the-art trackers. Code available at:
https://github.com/lorenzovaquero/SiamMOTION
","[{'version': 'v1', 'created': 'Thu, 10 Feb 2022 11:41:27 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Nov 2022 10:33:32 GMT'}]",2022-11-09,"[['Vaquero', 'Lorenzo', ''], ['Brea', 'Víctor M.', ''], ['Mucientes', 'Manuel', '']]","['multiple visual object tracking', 'Siamese CNN', 'motion estimation']"
10461,2111.14463,Eneko Osaba,"Eneko Osaba, Javier Del Ser and Ponnuthurai N. Suganthan","Evolutionary Multitask Optimization: Fundamental Research Questions,
  Practices, and Directions for the Future","17 pages, 3 figures. This papers has been accepted and published in
  Swarm and Evolutionary Computation under this DOI:
  10.1016/j.swevo.2022.101203",,10.1016/j.swevo.2022.101203,,cs.NE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Transfer Optimization has gained a remarkable attention from the Swarm and
Evolutionary Computation community in the recent years. It is undeniable that
the concepts underlying Transfer Optimization are formulated on solid grounds.
However, evidences observed in recent contributions confirm that there are
critical aspects that are not properly addressed to date. This short
communication aims to engage the readership around a reflection on these
issues, and to provide rationale why they remain unsolved. Specifically, we
emphasize on three critical points of Evolutionary Multitasking Optimization:
i) the plausibility and practical applicability of this paradigm; ii) the
novelty of some proposed multitasking methods; and iii) the methodologies used
for evaluating newly proposed multitasking algorithms. As a result of this
research, we conclude that some important efforts should be directed by the
community in order to keep the future of this promising field on the right
track. Our ultimate purpose is to unveil gaps in the current literature, so
that prospective works can attempt to fix these gaps, avoiding to stumble on
the same stones and eventually achieve valuable advances in the area.
","[{'version': 'v1', 'created': 'Mon, 29 Nov 2021 11:23:51 GMT'}, {'version': 'v2', 'created': 'Mon, 16 May 2022 15:00:23 GMT'}, {'version': 'v3', 'created': 'Fri, 11 Nov 2022 09:40:50 GMT'}]",2022-11-14,"[['Osaba', 'Eneko', ''], ['Del Ser', 'Javier', ''], ['Suganthan', 'Ponnuthurai N.', '']]","['Transfer Optimization', 'Multitasking Optimization', 'Evolutionary Multitasking', 'Multifactorial Evolutionary Algorithm']"
10462,2005.14313,Alwyn Mathew,"Alwyn Mathew, Aditya Prakash Patra, Jimson Mathew","Self-Attention Dense Depth Estimation Network for Unrectified Video
  Sequences",,,10.1109/ICIP40778.2020.9190764,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The dense depth estimation of a 3D scene has numerous applications, mainly in
robotics and surveillance. LiDAR and radar sensors are the hardware solution
for real-time depth estimation, but these sensors produce sparse depth maps and
are sometimes unreliable. In recent years research aimed at tackling depth
estimation using single 2D image has received a lot of attention. The deep
learning based self-supervised depth estimation methods from the rectified
stereo and monocular video frames have shown promising results. We propose a
self-attention based depth and ego-motion network for unrectified images. We
also introduce non-differentiable distortion of the camera into the training
pipeline. Our approach performs competitively when compared to other
established approaches that used rectified images for depth estimation.
","[{'version': 'v1', 'created': 'Thu, 28 May 2020 21:53:53 GMT'}]",2021-03-02,"[['Mathew', 'Alwyn', ''], ['Patra', 'Aditya Prakash', ''], ['Mathew', 'Jimson', '']]","['Monocular depth estimation', 'Stereo viewsynthesis', 'unrectified image']"
10463,1812.08402,Shi Luo,"Shi Luo, Xiongfei Li, Rui Zhu, Xiaoli Zhang",SFA: Small Faces Attention Face Detector,"10 pages, 0 figures, 0 tables, 41 references",IEEE Access 2019,10.1109/ACCESS.2019.2955757,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent year, tremendous strides have been made in face detection thanks to
deep learning. However, most published face detectors deteriorate dramatically
as the faces become smaller. In this paper, we present the Small Faces
Attention (SFA) face detector to better detect faces with small scale. First,
we propose a new scale-invariant face detection architecture which pays more
attention to small faces, including 4-branch detection architecture and small
faces sensitive anchor design. Second, feature maps fusion strategy is applied
in SFA by partially combining high-level features into low-level features to
further improve the ability of finding hard faces. Third, we use multi-scale
training and testing strategy to enhance face detection performance in
practice. Comprehensive experiments show that SFA significantly improves face
detection performance, especially on small faces. Our real-time SFA face
detector can run at 5 FPS on a single GPU as well as maintain high performance.
Besides, our final SFA face detector achieves state-of-the-art detection
performance on challenging face detection benchmarks, including WIDER FACE and
FDDB datasets, with competitive runtime speed. Both our code and models will be
available to the research community.
","[{'version': 'v1', 'created': 'Thu, 20 Dec 2018 07:46:23 GMT'}]",2019-12-02,"[['Luo', 'Shi', ''], ['Li', 'Xiongfei', ''], ['Zhu', 'Rui', ''], ['Zhang', 'Xiaoli', '']]","['Face detection', 'Small face', 'Convolutional neural network', 'Deep learning']"
10464,2101.11278,Elodie Bouzbib,"Elodie Bouzbib, Gilles Bailly, Sinan Haliyo, Pascal Frey","""Can I Touch This?"": Survey of Virtual Reality Interactions via Haptic
  Solutions",,,10.1145/3450522.3451323,"32e Conf\'erence Francophone sur l'Interaction Homme-Machine (IHM
  '20.21), April 13--16, 2021, Virtual Event, France",cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Haptic feedback has become crucial to enhance the user experiences in Virtual
Reality (VR). This justifies the sudden burst of novel haptic solutions
proposed these past years in the HCI community. This article is a survey of
Virtual Reality interactions, relying on haptic devices. We propose two
dimensions to describe and compare the current haptic solutions: their degree
of physicality, as well as their degree of actuation. We depict a compromise
between the user and the designer, highlighting how the range of required or
proposed stimulation in VR is opposed to the haptic interfaces flexibility and
their deployment in real-life use-cases. This paper (1) outlines the variety of
haptic solutions and provides a novel perspective for analysing their
associated interactions, (2) highlights the limits of the current evaluation
criteria regarding these interactions, and finally (3) reflects the
interaction, operation and conception potentials of ""encountered-type of haptic
devices"".
","[{'version': 'v1', 'created': 'Wed, 27 Jan 2021 09:16:17 GMT'}]",2021-02-19,"[['Bouzbib', 'Elodie', ''], ['Bailly', 'Gilles', ''], ['Haliyo', 'Sinan', ''], ['Frey', 'Pascal', '']]","['haptics', 'Virtual Reality', 'human factors', 'haptic devices']"
10465,2204.05448,Saeed Abdullah,"Johnna Blair, Jeff Brozena, Mark Matthews, Thomas Richardson, Saeed
  Abdullah","Financial technologies (FinTech) for mental health: The potential of
  objective financial data to better understand the relationships between
  financial behavior and mental health","Published in Frontiers Research Topic (Financial Difficulties and
  Mental Health Problems):
  https://www.frontiersin.org/articles/10.3389/fpsyt.2022.810057",Frontiers in Psychiatry 13 (2022),10.3389/fpsyt.2022.810057,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we present novel research methods for collecting and analyzing
personal financial data alongside mental health factors, illustrated through a
N=1 case study using data from one individual with bipolar disorder. While we
have not found statistically significant trends nor our findings are
generalizable beyond this case, our approach provides an insight into the
challenges of accessing objective financial data. We outline what data is
currently available, what can be done with it, and what factors to consider
when working with financial data. More specifically, using these methods
researchers might be able to identify symptomatic traces of mental ill health
in personal financial data such as identifying early warning signs and thereby
enable preemptive care for individuals with serious mental illnesses. Based on
this work, we have also explored future directions for developing interventions
to support financial wellbeing. Furthermore, we have described the technical,
ethical, and equity challenges for financial data-driven assessments and
intervention methods, as well as provided a broad research agenda to address
these challenges. By leveraging objective, personalized financial data in a
privacy-preserving and ethical manner help lead to a shift in mental health
care.
","[{'version': 'v1', 'created': 'Mon, 11 Apr 2022 23:56:09 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Apr 2022 18:15:27 GMT'}, {'version': 'v3', 'created': 'Wed, 17 Aug 2022 23:17:49 GMT'}, {'version': 'v4', 'created': 'Mon, 9 Jan 2023 22:30:51 GMT'}]",2023-01-11,"[['Blair', 'Johnna', ''], ['Brozena', 'Jeff', ''], ['Matthews', 'Mark', ''], ['Richardson', 'Thomas', ''], ['Abdullah', 'Saeed', '']]","['Mental Health', 'Financial technologies', 'FinTech', 'Open banking', 'Intervention', 'Impulsive spending', 'Privacy preserving']"
10466,2112.12180,Michal Balazia,"Tanay Agrawal, Dhruv Agarwal, Michal Balazia, Neelabh Sinha, Francois
  Bremond","Multimodal Personality Recognition using Cross-Attention Transformer and
  Behaviour Encoding","Preprint. Final paper accepted at the 17th International Conference
  on Computer Vision Theory and Applications (VISAPP), virtual, February, 2022.
  8 pages",,10.5220/0010841400003124,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Personality computing and affective computing have gained recent interest in
many research areas. The datasets for the task generally have multiple
modalities like video, audio, language and bio-signals. In this paper, we
propose a flexible model for the task which exploits all available data. The
task involves complex relations and to avoid using a large model for video
processing specifically, we propose the use of behaviour encoding which boosts
performance with minimal change to the model. Cross-attention using
transformers has become popular in recent times and is utilised for fusion of
different modalities. Since long term relations may exist, breaking the input
into chunks is not desirable, thus the proposed model processes the entire
input together. Our experiments show the importance of each of the above
contributions
","[{'version': 'v1', 'created': 'Wed, 22 Dec 2021 19:14:55 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Dec 2022 22:18:25 GMT'}, {'version': 'v3', 'created': 'Thu, 12 Jan 2023 15:01:11 GMT'}]",2023-01-13,"[['Agrawal', 'Tanay', ''], ['Agarwal', 'Dhruv', ''], ['Balazia', 'Michal', ''], ['Sinha', 'Neelabh', ''], ['Bremond', 'Francois', '']]","['Multimodal Transformer', 'Multimodal Data', 'Feature Engineering', 'Personality Recognition']"
10467,2005.00863,Pranab K. Muhuri Dr.,"Zubair Ashraf, Pranab K. Muhuri, Q. M. Danish Lohani, and Mukul L. Roy","Type-2 fuzzy reliability redundancy allocation problem and its solution
  using particle swarm optimization algorithm",,"Granular Computing, 4(2), 145-166 (2019)",10.1007/s41066-018-0106-5,,cs.NE cs.AI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the fuzzy multi-objective reliability redundancy allocation
problem (FMORRAP) is proposed, which maximizes the system reliability while
simultaneously minimizing the system cost under the type 2 fuzzy uncertainty.
In the proposed formulation, the higher order uncertainties (such as
parametric, manufacturing, environmental, and designers uncertainty) associated
with the system are modeled with interval type 2 fuzzy sets (IT2 FS). The
footprint of uncertainty of the interval type 2 membership functions (IT2 MFs)
accommodates these uncertainties by capturing the multiple opinions from
several system experts. We consider IT2 MFs to represent the subsystem
reliability and cost, which are to be further aggregated using extension
principle to evaluate the total system reliability and cost according to their
configurations, i.e., series parallel and parallel series. We proposed a
particle swarm optimization (PSO) based novel solution approach to solve the
FMORRAP. To demonstrate the applicability of two formulations, namely, series
parallel FMORRAP and parallel series FMORRAP, we performed experimental
simulations on various numerical data sets. The decision makers/system experts
assign different importance to the objectives (system reliability and cost),
and these preferences are represented by sets of weights. The optimal results
are obtained from our solution approach, and the Pareto optimal front is
established using these different weight sets. The genetic algorithm (GA) was
implemented to compare the results obtained from our proposed solution
approach. A statistical analysis was conducted between PSO and GA, and it was
found that the PSO based Pareto solution outperforms the GA.
","[{'version': 'v1', 'created': 'Sat, 2 May 2020 15:39:54 GMT'}]",2020-06-28,"[['Ashraf', 'Zubair', ''], ['Muhuri', 'Pranab K.', ''], ['Lohani', 'Q. M. Danish', ''], ['Roy', 'Mukul L.', '']]","['Multi-objective reliability allocation problem', 'Parallel-series and Series-parallel system', 'Type-2']"
10468,2106.05158,Bilen Emek Abali,"Hua Yang, Bilen Emek Abali, Wolfgang H. M\""uller, Salma Barboura, Jia
  Li","Verification of asymptotic homogenization method developed for periodic
  architected materials in strain gradient continuum",,,10.1016/j.ijsolstr.2021.111386,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Strain gradient theory is an accurate model for capturing the size effect and
localization phenomena. However, the challenge in identification of
corresponding constitutive parameters limits the practical application of the
theory. We present and utilize asymptotic homogenization herein. All parameters
in rank four, five, and six tensors are determined with the demonstrated
computational approach. Examples for epoxy carbon fiber composite, metal matrix
composite, and aluminum foam illustrate the effectiveness and versatility of
the proposed method. The influences of volume fraction of matrix, the stack of
RVEs, and the varying unit cell lengths on the identified parameters are
investigated. The homogenization computational tool is applicable to a wide
class materials and makes use of open-source codes in FEniCS. We make all of
the codes publicly available in order to encourage a transparent scientific
exchange.
","[{'version': 'v1', 'created': 'Wed, 9 Jun 2021 16:02:59 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Dec 2021 19:31:44 GMT'}]",2021-12-30,"[['Yang', 'Hua', ''], ['Abali', 'Bilen Emek', ''], ['Müller', 'Wolfgang H.', ''], ['Barboura', 'Salma', ''], ['Li', 'Jia', '']]","['Strain gradient elasticity', 'Asymptotic homogenization method', 'Finite element method', 'constitutive parameters identification']"
10469,1905.00630,Juergen Lerner,"J\""urgen Lerner and Alessandro Lomi","Reliability of relational event model estimates under sampling: how to
  fit a relational event model to 360 million dyadic events",,,10.1017/nws.2019.57,,cs.SI stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We assess the reliability of relational event model parameters estimated
under two sampling schemes: (1) uniform sampling from the observed events and
(2) case-control sampling which samples non-events, or null dyads (""controls""),
from a suitably defined risk set. We experimentally determine the variability
of estimated parameters as a function of the number of sampled events and
controls per event, respectively. Results suggest that relational event models
can be reliably fitted to networks with more than 12 million nodes connected by
more than 360 million dyadic events by analyzing a sample of some tens of
thousands of events and a small number of controls per event. Using data that
we collected on the Wikipedia editing network, we illustrate how network
effects commonly included in empirical studies based on relational event models
need widely different sample sizes to be estimated reliably. For our analysis
we use an open-source software which implements the two sampling schemes,
allowing analysts to fit and analyze relational event models to the same or
other data that may be collected in different empirical settings, varying
sample parameters or model specification.
","[{'version': 'v1', 'created': 'Thu, 2 May 2019 09:13:12 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Nov 2019 16:00:30 GMT'}]",2021-12-21,"[['Lerner', 'Jürgen', ''], ['Lomi', 'Alessandro', '']]","['relational event models', 'dynamic networks', 'large networks', 'parameter estimation', 'sampling', 'Wikipedia']"
10470,1809.11160,Tom Hanika,Maximilian Felde and Tom Hanika,Formal Context Generation using Dirichlet Distributions,"16 pages, 7 figures",,10.1007/978-3-030-23182-8_5,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We suggest an improved way to randomly generate formal contexts based on
Dirichlet distributions. For this purpose we investigate the predominant way to
generate formal contexts, a coin-tossing model, recapitulate some of its
shortcomings and examine its stochastic model. Building up on this we propose
our Dirichlet model and develop an algorithm employing this idea. By comparing
our generation model to a coin-tossing model we show that our approach is a
significant improvement with respect to the variety of contexts generated.
Finally, we outline a possible application in null model generation for formal
contexts.
","[{'version': 'v1', 'created': 'Fri, 28 Sep 2018 17:48:15 GMT'}]",2020-02-28,"[['Felde', 'Maximilian', ''], ['Hanika', 'Tom', '']]","['Formal Concept Analysis', 'Dirichlet Distribution', 'Random Context']"
10471,2009.01772,Erik Rye,Erik Rye and Jeremy Blackburn and Robert Beverly,Reading In-Between the Lines: An Analysis of Dissenter,Accepted at IMC 2020,,10.1145/3419394.3423615,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efforts by content creators and social networks to enforce legal and
policy-based norms, e.g. blocking hate speech and users, has driven the rise of
unrestricted communication platforms. One such recent effort is Dissenter, a
browser and web application that provides a conversational overlay for any web
page. These conversations hide in plain sight - users of Dissenter can see and
participate in this conversation, whereas visitors using other browsers are
oblivious to their existence. Further, the website and content owners have no
power over the conversation as it resides in an overlay outside their control.
  In this work, we obtain a history of Dissenter comments, users, and the
websites being discussed, from the initial release of Dissenter in Feb. 2019
through Apr. 2020 (14 months). Our corpus consists of approximately 1.68M
comments made by 101k users commenting on 588k distinct URLs. We first analyze
macro characteristics of the network, including the user-base, comment
distribution, and growth. We then use toxicity dictionaries, Perspective API,
and a Natural Language Processing model to understand the nature of the
comments and measure the propensity of particular websites and content to
elicit hateful and offensive Dissenter comments. Using curated rankings of
media bias, we examine the conditional probability of hateful comments given
left and right-leaning content. Finally, we study Dissenter as a social
network, and identify a core group of users with high comment toxicity.
","[{'version': 'v1', 'created': 'Thu, 3 Sep 2020 16:25:28 GMT'}, {'version': 'v2', 'created': 'Sat, 26 Sep 2020 15:16:59 GMT'}]",2021-12-21,"[['Rye', 'Erik', ''], ['Blackburn', 'Jeremy', ''], ['Beverly', 'Robert', '']]","['Dissenter', 'Social Networks', 'Toxicity']"
10472,1908.04564,Nils Rottmann,"Nils Rottmann, Ralf Bruder, Achim Schweikard and Elmar Rueckert","Cataglyphis ant navigation strategies solve the global localization
  problem in robots with binary sensors",Accepted to BIOSIGNALS 2019,"BIOSIGNALS, ISBN 978-989-758-353-7, pages 214-223 (2019)",10.5220/0007556102140223,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Low cost robots, such as vacuum cleaners or lawn mowers, employ simplistic
and often random navigation policies. Although a large number of sophisticated
localization and planning approaches exist, they require additional sensors
like LIDAR sensors, cameras or time of flight sensors. In this work, we propose
a global localization method biologically inspired by simple insects, such as
the ant Cataglyphis that is able to return from distant locations to its nest
in the desert without any or with limited perceptual cues. Like in Cataglyphis,
the underlying idea of our localization approach is to first compute a pose
estimate from pro-prioceptual sensors only, using land navigation, and
thereafter refine the estimate through a systematic search in a particle filter
that integrates the rare visual feedback. In simulation experiments in multiple
environments, we demonstrated that this bioinspired principle can be used to
compute accurate pose estimates from binary visual cues only. Such intelligent
localization strategies can improve the performance of any robot with limited
sensing capabilities such as household robots or toys.
","[{'version': 'v1', 'created': 'Tue, 13 Aug 2019 09:40:26 GMT'}]",2019-08-14,"[['Rottmann', 'Nils', ''], ['Bruder', 'Ralf', ''], ['Schweikard', 'Achim', ''], ['Rueckert', 'Elmar', '']]","['Global Localization', 'Binary Measurements', 'Land Navigation', 'Path Integration', 'Cataglyphis']"
10473,2008.01535,Kwadwo Osei Bonsu,Kwadwo Osei Bonsu,"Weighted Accuracy Algorithmic Approach In Counteracting Fake News And
  Disinformation",,,10.2478/ers-2021-0007,,cs.CL cs.SI econ.GN q-fin.EC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As the world is becoming more dependent on the internet for information
exchange, some overzealous journalists, hackers, bloggers, individuals and
organizations tend to abuse the gift of free information environment by
polluting it with fake news, disinformation and pretentious content for their
own agenda. Hence, there is the need to address the issue of fake news and
disinformation with utmost seriousness. This paper proposes a methodology for
fake news detection and reporting through a constraint mechanism that utilizes
the combined weighted accuracies of four machine learning algorithms.
","[{'version': 'v1', 'created': 'Thu, 30 Jul 2020 08:56:51 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Aug 2020 01:53:01 GMT'}]",2021-04-02,"[['Bonsu', 'Kwadwo Osei', '']]","['Fake News', 'Disinformation', 'Digital Revolution', 'Artificial Intelligence', 'Natural Language Processing', 'Machine Learning Algorithm']"
10474,2209.03473,Alexandre Duval,"Alexandre Duval, Fragkiskos Malliaros",Higher-order Clustering and Pooling for Graph Neural Networks,CIKM 2022,,10.1145/3511808.3557353,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Graph Neural Networks achieve state-of-the-art performance on a plethora of
graph classification tasks, especially due to pooling operators, which
aggregate learned node embeddings hierarchically into a final graph
representation. However, they are not only questioned by recent work showing on
par performance with random pooling, but also ignore completely higher-order
connectivity patterns. To tackle this issue, we propose HoscPool, a
clustering-based graph pooling operator that captures higher-order information
hierarchically, leading to richer graph representations. In fact, we learn a
probabilistic cluster assignment matrix end-to-end by minimising relaxed
formulations of motif spectral clustering in our objective function, and we
then extend it to a pooling operator. We evaluate HoscPool on graph
classification tasks and its clustering component on graphs with ground-truth
community structure, achieving best performance. Lastly, we provide a deep
empirical analysis of pooling operators' inner functioning.
","[{'version': 'v1', 'created': 'Fri, 2 Sep 2022 09:17:10 GMT'}]",2022-09-09,"[['Duval', 'Alexandre', ''], ['Malliaros', 'Fragkiskos', '']]","['Graph Neural Networks (GNNs)', 'Graph Pooling', 'Clustering']"
10475,1602.05920,Kamran Kowsari,"Kamran Kowsari, Manal H. Alassaf",Weighted Unsupervised Learning for 3D Object Detection,IJACSA,,10.14569/IJACSA.2016.070180,,cs.CV cs.GR cs.LG cs.MM cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a novel weighted unsupervised learning for object
detection using an RGB-D camera. This technique is feasible for detecting the
moving objects in the noisy environments that are captured by an RGB-D camera.
The main contribution of this paper is a real-time algorithm for detecting each
object using weighted clustering as a separate cluster. In a preprocessing
step, the algorithm calculates the pose 3D position X, Y, Z and RGB color of
each data point and then it calculates each data point's normal vector using
the point's neighbor. After preprocessing, our algorithm calculates k-weights
for each data point; each weight indicates membership. Resulting in clustered
objects of the scene.
","[{'version': 'v1', 'created': 'Thu, 18 Feb 2016 19:40:26 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Jun 2018 23:51:27 GMT'}]",2018-10-24,"[['Kowsari', 'Kamran', ''], ['Alassaf', 'Manal H.', '']]","['Weighted Unsupervised Learning', 'Object Detection', 'RGB-D camera', 'Kinect']"
10476,2108.06167,Haoming Li,"Haoming Li, Feiyang Pan, Xiang Ao, Zhao Yang, Min Lu, Junwei Pan,
  Dapeng Liu, Lei Xiao, Qing He","Follow the Prophet: Accurate Online Conversion Rate Prediction in the
  Face of Delayed Feedback","In Proceedings of the 44th International ACM SIGIR Conference on
  Research and Development in Information Retrieval (SIGIR '21), July 11--15,
  2021, Virtual Event, Canada. ACM, New York, NY, USA, 5 pages.
  https://doi.org/10.1145/3404835.3463045",,10.1145/3404835.3463045,,cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  The delayed feedback problem is one of the imperative challenges in online
advertising, which is caused by the highly diversified feedback delay of a
conversion varying from a few minutes to several days. It is hard to design an
appropriate online learning system under these non-identical delay for
different types of ads and users. In this paper, we propose to tackle the
delayed feedback problem in online advertising by ""Following the Prophet"" (FTP
for short). The key insight is that, if the feedback came instantly for all the
logged samples, we could get a model without delayed feedback, namely the
""prophet"". Although the prophet cannot be obtained during online learning, we
show that we could predict the prophet's predictions by an aggregation policy
on top of a set of multi-task predictions, where each task captures the
feedback patterns of different periods. We propose the objective and
optimization approach for the policy, and use the logged data to imitate the
prophet. Extensive experiments on three real-world advertising datasets show
that our method outperforms the previous state-of-the-art baselines.
","[{'version': 'v1', 'created': 'Fri, 13 Aug 2021 10:51:09 GMT'}]",2021-08-16,"[['Li', 'Haoming', ''], ['Pan', 'Feiyang', ''], ['Ao', 'Xiang', ''], ['Yang', 'Zhao', ''], ['Lu', 'Min', ''], ['Pan', 'Junwei', ''], ['Liu', 'Dapeng', ''], ['Xiao', 'Lei', ''], ['He', 'Qing', '']]","['online advertising', 'conversion rate prediction', 'delayed feedback']"
10477,2003.07969,Ankit Vora,"Siddharth Agarwal, Ankit Vora, Gaurav Pandey, Wayne Williams, Helen
  Kourous and James McBride",Ford Multi-AV Seasonal Dataset,"7 pages, 7 figures, Submitted to International Journal of Robotics
  Research (IJRR), Visit website at https://avdata.ford.com","IJRR, Volume: 39 issue: 12 (2020), page(s): 1367-1376",10.1177/0278364920961451,,cs.RO cs.CV cs.MA,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper presents a challenging multi-agent seasonal dataset collected by a
fleet of Ford autonomous vehicles at different days and times during 2017-18.
The vehicles traversed an average route of 66 km in Michigan that included a
mix of driving scenarios such as the Detroit Airport, freeways, city-centers,
university campus and suburban neighbourhoods, etc. Each vehicle used in this
data collection is a Ford Fusion outfitted with an Applanix POS-LV GNSS system,
four HDL-32E Velodyne 3D-lidar scanners, 6 Point Grey 1.3 MP Cameras arranged
on the rooftop for 360-degree coverage and 1 Pointgrey 5 MP camera mounted
behind the windshield for the forward field of view. We present the seasonal
variation in weather, lighting, construction and traffic conditions experienced
in dynamic urban environments. This dataset can help design robust algorithms
for autonomous vehicles and multi-agent systems. Each log in the dataset is
time-stamped and contains raw data from all the sensors, calibration values,
pose trajectory, ground truth pose, and 3D maps. All data is available in
Rosbag format that can be visualized, modified and applied using the
open-source Robot Operating System (ROS). We also provide the output of
state-of-the-art reflectivity-based localization for bench-marking purposes.
The dataset can be freely downloaded at our website.
","[{'version': 'v1', 'created': 'Tue, 17 Mar 2020 22:33:38 GMT'}]",2021-01-26,"[['Agarwal', 'Siddharth', ''], ['Vora', 'Ankit', ''], ['Pandey', 'Gaurav', ''], ['Williams', 'Wayne', ''], ['Kourous', 'Helen', ''], ['McBride', 'James', '']]","['Autonomous Agents', 'Field and Service Robotics', 'Mobile and Distributed Robotics SLAM', 'Localization', 'Mapping', 'Sensing', 'Perception Computer Vision']"
10478,2206.12866,Yuxuan Lu,"Yuxuan Lu, Jingya Yan, Zhixuan Qi, Zhongzheng Ge, Yongping Du","Contextual embedding and model weighting by fusing domain knowledge on
  Biomedical Question Answering",,,10.1145/3535508.3545508,,cs.CL cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Biomedical Question Answering aims to obtain an answer to the given question
from the biomedical domain. Due to its high requirement of biomedical domain
knowledge, it is difficult for the model to learn domain knowledge from limited
training data. We propose a contextual embedding method that combines
open-domain QA model \aoa and \biobert model pre-trained on biomedical domain
data. We adopt unsupervised pre-training on large biomedical corpus and
supervised fine-tuning on biomedical question answering dataset. Additionally,
we adopt an MLP-based model weighting layer to automatically exploit the
advantages of two models to provide the correct answer. The public dataset
\biomrc constructed from PubMed corpus is used to evaluate our method.
Experimental results show that our model outperforms state-of-the-art system by
a large margin.
","[{'version': 'v1', 'created': 'Sun, 26 Jun 2022 12:47:38 GMT'}]",2022-06-29,"[['Lu', 'Yuxuan', ''], ['Yan', 'Jingya', ''], ['Qi', 'Zhixuan', ''], ['Ge', 'Zhongzheng', ''], ['Du', 'Yongping', '']]","['biomedical question answering', 'contextual embedding', 'modelweighting', 'domain knowledge']"
10479,2110.09238,Charlotte Stix,Charlotte Stix,"Foundations for the Future: Institution building for the purpose of
  Artificial Intelligence governance",,AI and Ethics (2021),10.1007/s43681-021-00093-w,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Governance efforts for artificial intelligence (AI) are taking on
increasingly more concrete forms, drawing on a variety of approaches and
instruments from hard regulation to standardisation efforts, aimed at
mitigating challenges from high-risk AI systems. To implement these and other
efforts, new institutions will need to be established on a national and
international level. This paper sketches a blueprint of such institutions, and
conducts in-depth investigations of three key components of any future AI
governance institutions, exploring benefits and associated drawbacks: (1)
purpose, relating to the institution's overall goals and scope of work or
mandate; (2) geography, relating to questions of participation and the reach of
jurisdiction; and (3) capacity, the infrastructural and human make-up of the
institution. Subsequently, the paper highlights noteworthy aspects of various
institutional roles specifically around questions of institutional purpose, and
frames what these could look like in practice, by placing these debates in a
European context and proposing different iterations of a European AI Agency.
Finally, conclusions and future research directions are proposed.
","[{'version': 'v1', 'created': 'Fri, 1 Oct 2021 10:45:04 GMT'}]",2021-10-19,"[['Stix', 'Charlotte', '']]","['artificial intelligence ethics', 'artificial intelligence policy', 'artificialintelligence governance', 'institutional design']"
10480,2205.02446,Fan Zhang,"Fan Zhang, Qiuying Peng, Yulin Wu, Zheng Pan, Rong Zeng, Da Lin, Yue
  Qi","Multi-Graph based Multi-Scenario Recommendation in Large-scale Online
  Video Services",Accepted to WWW 2022 Graph Learning workshop,,10.1145/3487553.3524729,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, industrial recommendation services have been boosted by the
continual upgrade of deep learning methods. However, they still face de-biasing
challenges such as exposure bias and cold-start problem, where circulations of
machine learning training on human interaction history leads algorithms to
repeatedly suggest exposed items while ignoring less-active ones. Additional
problems exist in multi-scenario platforms, e.g. appropriate data fusion from
subsidiary scenarios, which we observe could be alleviated through graph
structured data integration via message passing.
  In this paper, we present a multi-graph structured multi-scenario
recommendation solution, which encapsulates interaction data across scenarios
with multi-graph and obtains representation via graph learning. Extensive
offline and online experiments on real-world datasets are conducted where the
proposed method demonstrates an increase of 0.63% and 0.71% in CTR and Video
Views per capita on new users over deployed set of baselines and outperforms
regular method in increasing the number of outer-scenario videos by 25% and
video watches by 116%, validating its superiority in activating cold videos and
enriching target recommendation.
","[{'version': 'v1', 'created': 'Thu, 5 May 2022 05:33:01 GMT'}]",2022-05-06,"[['Zhang', 'Fan', ''], ['Peng', 'Qiuying', ''], ['Wu', 'Yulin', ''], ['Pan', 'Zheng', ''], ['Zeng', 'Rong', ''], ['Lin', 'Da', ''], ['Qi', 'Yue', '']]","['Graph Neural Networks', 'Multi-Scenario Recommendation', 'Recommender Systems']"
10481,2010.00995,Ylva Ferstl,"Ylva Ferstl, Michael Neff, Rachel McDonnell","Understanding the Predictability of Gesture Parameters from Speech and
  their Perceptual Importance","To be published in the Proceedings of the 20th ACM International
  Conference on Intelligent Virtual Agents (IVA 20)",,10.1145/3383652.3423882,,cs.HC cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Gesture behavior is a natural part of human conversation. Much work has
focused on removing the need for tedious hand-animation to create embodied
conversational agents by designing speech-driven gesture generators. However,
these generators often work in a black-box manner, assuming a general
relationship between input speech and output motion. As their success remains
limited, we investigate in more detail how speech may relate to different
aspects of gesture motion. We determine a number of parameters characterizing
gesture, such as speed and gesture size, and explore their relationship to the
speech signal in a two-fold manner. First, we train multiple recurrent networks
to predict the gesture parameters from speech to understand how well gesture
attributes can be modeled from speech alone. We find that gesture parameters
can be partially predicted from speech, and some parameters, such as path
length, being predicted more accurately than others, like velocity. Second, we
design a perceptual study to assess the importance of each gesture parameter
for producing motion that people perceive as appropriate for the speech.
Results show that a degradation in any parameter was viewed negatively, but
some changes, such as hand shape, are more impactful than others. A video
summarization can be found at https://youtu.be/aw6-_5kmLjY.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2020 13:43:33 GMT'}]",2020-10-05,"[['Ferstl', 'Ylva', ''], ['Neff', 'Michael', ''], ['McDonnell', 'Rachel', '']]","['speech gestures', 'machine learning', 'perception', 'gesture modelling']"
10482,cs/0403008,Dmitrii V. Pasechnik,"Dima Grigoriev, Dmitrii V. Pasechnik","Polynomial-time computing over quadratic maps I: sampling in real
  algebraic sets","34 pages, LaTeX (Computational Complexity (cc.cls) class used);
  updated version, to appear in Comp. Complexity",Computational Complexity 14(2005) 20-52,10.1007/s00037-005-0189-7,,cs.SC cs.CG math.AG,,"  Given a quadratic map Q : K^n -> K^k defined over a computable subring D of a
real closed field K, and a polynomial p(Y_1,...,Y_k) of degree d, we consider
the zero set Z=Z(p(Q(X)),K^n) of the polynomial p(Q(X_1,...,X_n)). We present a
procedure that computes, in (dn)^O(k) arithmetic operations in D, a set S of
(real univariate representations of) sampling points in K^n that intersects
nontrivially each connected component of Z. As soon as k=o(n), this is faster
than the standard methods that all have exponential dependence on n in the
complexity. In particular, our procedure is polynomial-time for constant k. In
contrast, the best previously known procedure (due to A.Barvinok) is only
capable of deciding in n^O(k^2) operations the nonemptiness (rather than
constructing sampling points) of the set Z in the case of p(Y)=sum_i Y_i^2 and
homogeneous Q.
  A by-product of our procedure is a bound (dn)^O(k) on the number of connected
components of Z.
  The procedure consists of exact symbolic computations in D and outputs
vectors of algebraic numbers. It involves extending K by infinitesimals and
subsequent limit computation by a novel procedure that utilizes knowledge of an
explicit isomorphism between real algebraic sets.
","[{'version': 'v1', 'created': 'Sat, 6 Mar 2004 08:20:38 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Mar 2004 01:36:03 GMT'}, {'version': 'v3', 'created': 'Fri, 31 Dec 2004 15:41:14 GMT'}]",2007-05-23,"[['Grigoriev', 'Dima', ''], ['Pasechnik', 'Dmitrii V.', '']]","['symbolic computation', 'complexity', 'semialgebraic set', 'quadratic map', 'univariate representation', 'infinitesimal deformation.Subject classification']"
10483,2210.15835,Yu Wei Tan,"Yu Wei Tan, Alden Tan, Nicholas Nge and Anand Bhojan",DHR: Distributed Hybrid Rendering for Metaverse Experiences,,,10.1145/3552483.3556455,,cs.GR,http://creativecommons.org/licenses/by/4.0/,"  Classically, rasterization techniques are performed for real-time rendering
to meet the constraint of interactive frame rates. However, such techniques do
not produce realistic results as compared to ray tracing approaches. Hence,
hybrid rendering has emerged to improve the graphics fidelity of rasterization
with ray tracing in real-time. We explore the approach of distributed rendering
in incorporating real-time hybrid rendering into metaverse experiences for
immersive graphics. In standalone extended reality (XR) devices, such ray
tracing-enabled graphics is only feasible through pure cloud-based remote
rendering systems that rely on low-latency networks to transmit real-time
ray-traced data in response to interactive user input. Under high network
latency conditions, remote rendering might not be able to maintain interactive
frame rates for the client, adversely affecting the user experience. We adopt
hybrid rendering via a distributed rendering approach by integrating ray
tracing on powerful remote hardware with raster-based rendering on user access
devices. With this hybrid approach, our technique can help standalone XR
devices achieve ray tracing-incorporated graphics and maintain interactive
frame rates even under high-latency conditions.
","[{'version': 'v1', 'created': 'Fri, 28 Oct 2022 02:01:13 GMT'}]",2022-10-31,"[['Tan', 'Yu Wei', ''], ['Tan', 'Alden', ''], ['Nge', 'Nicholas', ''], ['Bhojan', 'Anand', '']]","['real-time', 'ray tracing', 'hybrid rendering', 'distributed rendering', 'interactive applications', 'metaverse']"
10484,2008.13640,Anthony Labarre,Anthony Labarre,Sorting by Prefix Block-Interchanges,"15 pages, to appear in ISAAC 2020",,10.4230/LIPIcs.ISAAC.2020.55,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  We initiate the study of sorting permutations using prefix
block-interchanges, which exchange any prefix of a permutation with another
non-intersecting interval. The goal is to transform a given permutation into
the identity permutation using as few such operations as possible. We give a
2-approximation algorithm for this problem, show how to obtain improved lower
and upper bounds on the corresponding distance, and determine the largest
possible value for that distance.
","[{'version': 'v1', 'created': 'Mon, 31 Aug 2020 14:25:08 GMT'}]",2022-08-29,"[['Labarre', 'Anthony', '']]","['permutations', 'genome rearrangements', 'interconnection network', 'sorting', 'edit distance', 'prefix block-interchange']"
10485,2204.08046,Ivan Sekulic,"Ivan Sekuli\'c, Mohammad Aliannejadi, Fabio Crestani","Evaluating Mixed-initiative Conversational Search Systems via User
  Simulation",,,10.1145/3488560.3498440,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clarifying the underlying user information need by asking clarifying
questions is an important feature of modern conversational search system.
However, evaluation of such systems through answering prompted clarifying
questions requires significant human effort, which can be time-consuming and
expensive. In this paper, we propose a conversational User Simulator, called
USi, for automatic evaluation of such conversational search systems. Given a
description of an information need, USi is capable of automatically answering
clarifying questions about the topic throughout the search session. Through a
set of experiments, including automated natural language generation metrics and
crowdsourcing studies, we show that responses generated by USi are both inline
with the underlying information need and comparable to human-generated answers.
Moreover, we make the first steps towards multi-turn interactions, where
conversational search systems asks multiple questions to the (simulated) user
with a goal of clarifying the user need. To this end, we expand on currently
available datasets for studying clarifying questions, i.e., Qulac and ClariQ,
by performing a crowdsourcing-based multi-turn data acquisition. We show that
our generative, GPT2-based model, is capable of providing accurate and natural
answers to unseen clarifying questions in the single-turn setting and discuss
capabilities of our model in the multi-turn setting. We provide the code, data,
and the pre-trained model to be used for further research on the topic.
","[{'version': 'v1', 'created': 'Sun, 17 Apr 2022 16:27:33 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Apr 2022 09:33:46 GMT'}]",2022-04-21,"[['Sekulić', 'Ivan', ''], ['Aliannejadi', 'Mohammad', ''], ['Crestani', 'Fabio', '']]","['Conversational Search', 'Mixed-initiative Search', 'User Simulation']"
10486,1910.02150,Stefan Klus,"Stefan Klus, Patrick Gel{\ss}",Tensor-based algorithms for image classification,,"Algorithms, 12(11), 240, 2019",10.3390/a12110240,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The interest in machine learning with tensor networks has been growing
rapidly in recent years. We show that tensor-based methods developed for
learning the governing equations of dynamical systems from data can, in the
same way, be used for supervised learning problems and propose two novel
approaches for image classification. One is a kernel-based reformulation of the
previously introduced MANDy (multidimensional approximation of nonlinear
dynamics), the other an alternating ridge regression in the tensor-train
format. We apply both methods to the MNIST and fashion MNIST data set and show
that the approaches are competitive with state-of-the-art neural network-based
classifiers.
","[{'version': 'v1', 'created': 'Fri, 4 Oct 2019 21:16:33 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Nov 2019 22:31:02 GMT'}]",2019-12-02,"[['Klus', 'Stefan', ''], ['Gelß', 'Patrick', '']]","['quantum machine learning', 'image classification', 'tensor-train format', 'kernel-based methods', 'ridge regression']"
10487,2212.12343,Lucas Benevide Viana De Amorim,"Lucas B.V. de Amorim, George D.C. Cavalcanti and Rafael M.O. Cruz",The choice of scaling technique matters for classification performance,,"Applied Soft Computing, Volume 133, January 2023, 109924",10.1016/j.asoc.2022.109924,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Dataset scaling, also known as normalization, is an essential preprocessing
step in a machine learning pipeline. It is aimed at adjusting attributes scales
in a way that they all vary within the same range. This transformation is known
to improve the performance of classification models, but there are several
scaling techniques to choose from, and this choice is not generally done
carefully. In this paper, we execute a broad experiment comparing the impact of
5 scaling techniques on the performances of 20 classification algorithms among
monolithic and ensemble models, applying them to 82 publicly available datasets
with varying imbalance ratios. Results show that the choice of scaling
technique matters for classification performance, and the performance
difference between the best and the worst scaling technique is relevant and
statistically significant in most cases. They also indicate that choosing an
inadequate technique can be more detrimental to classification performance than
not scaling the data at all. We also show how the performance variation of an
ensemble model, considering different scaling techniques, tends to be dictated
by that of its base model. Finally, we discuss the relationship between a
model's sensitivity to the choice of scaling technique and its performance and
provide insights into its applicability on different model deployment
scenarios. Full results and source code for the experiments in this paper are
available in a GitHub
repository.\footnote{https://github.com/amorimlb/scaling\_matters}
","[{'version': 'v1', 'created': 'Fri, 23 Dec 2022 13:51:45 GMT'}]",2022-12-26,"[['de Amorim', 'Lucas B. V.', ''], ['Cavalcanti', 'George D. C.', ''], ['Cruz', 'Rafael M. O.', '']]","['Classification', 'Normalization', 'Standardization', 'Scaling', 'Preprocessing', 'Ensemble of classifiers', 'Multiple Classifier System']"
10488,2203.11520,Lioba Heimbach,"Lioba Heimbach, Roger Wattenhofer","SoK: Preventing Transaction Reordering Manipulations in Decentralized
  Finance",,,10.1145/3558535.3559784,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  User transactions on Ethereum's peer-to-peer network are at risk of being
attacked. The smart contracts building decentralized finance (DeFi) have
introduced a new transaction ordering dependency to the Ethereum blockchain. As
a result, attackers can profit from front- and back-running transactions.
Multiple approaches to mitigate transaction reordering manipulations have
surfaced recently. However, the success of individual approaches in mitigating
such attacks and their impact on the entire blockchain remains largely
unstudied.
  In this systematization of knowledge (SoK), we categorize and analyze
state-of-the-art transaction reordering manipulation mitigation schemes.
Instead of restricting our analysis to a scheme's success at preventing
transaction reordering attacks, we evaluate its full impact on the blockchain.
Therefore, we are able to provide a complete picture of the strengths and
weaknesses of current mitigation schemes. We find that currently no scheme
fully meets all the demands of the blockchain ecosystem. In fact, all
approaches demonstrate unsatisfactory performance in at least one area relevant
to the blockchain ecosystem.
","[{'version': 'v1', 'created': 'Tue, 22 Mar 2022 07:50:00 GMT'}, {'version': 'v2', 'created': 'Wed, 18 May 2022 12:51:56 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Sep 2022 18:03:04 GMT'}]",2022-09-23,"[['Heimbach', 'Lioba', ''], ['Wattenhofer', 'Roger', '']]","['Ethereum', 'smart contracts', 'decentralized finance', 'fair ordering', 'front-running']"
10489,1908.08645,Laura Blumenschein,"Joseph D. Greer, Laura H. Blumenschein, Ron Alterovitz, Elliot W.
  Hawkes, and Allison M. Okamura","Robust Navigation of a Soft Growing Robot by Exploiting Contact with the
  Environment","15 pages, 18 figures, supplementary video included and higher
  resolution available at https://youtu.be/XdTdFLz2TWU","The International Journal of Robotics Research.
  2020;39(14):1724-1738",10.1177/0278364920903774,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Navigation and motion control of a robot to a destination are tasks that have
historically been performed with the assumption that contact with the
environment is harmful. This makes sense for rigid-bodied robots where obstacle
collisions are fundamentally dangerous. However, because many soft robots have
bodies that are low-inertia and compliant, obstacle contact is inherently safe.
As a result, constraining paths of the robot to not interact with the
environment is not necessary and may be limiting. In this paper, we
mathematically formalize interactions of a soft growing robot with a planar
environment in an empirical kinematic model. Using this interaction model, we
develop a method to plan paths for the robot to a destination. Rather than
avoiding contact with the environment, the planner exploits obstacle contact
when beneficial for navigation. We find that a planner that takes into account
and capitalizes on environmental contact produces paths that are more robust to
uncertainty than a planner that avoids all obstacle contact.
","[{'version': 'v1', 'created': 'Fri, 23 Aug 2019 03:05:09 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Feb 2021 16:37:45 GMT'}]",2021-02-10,"[['Greer', 'Joseph D.', ''], ['Blumenschein', 'Laura H.', ''], ['Alterovitz', 'Ron', ''], ['Hawkes', 'Elliot W.', ''], ['Okamura', 'Allison M.', '']]","['Path Planning for Manipulators', 'Biologically-Inspired Robots', 'Contact Modelling']"
10490,2005.09348,Yong Kiam Tan,"Andrew Sogokon, Stefan Mitsch, Yong Kiam Tan, Katherine Cordwell,
  Andr\'e Platzer",Pegasus: Sound Continuous Invariant Generation,"Extended version of FM'19 conference paper
  (https://doi.org/10.1007/978-3-030-30942-8_10), to appear in FMSD",,10.1007/s10703-020-00355-z,,cs.SC cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Continuous invariants are an important component in deductive verification of
hybrid and continuous systems. Just like discrete invariants are used to reason
about correctness in discrete systems without having to unroll their loops,
continuous invariants are used to reason about differential equations without
having to solve them. Automatic generation of continuous invariants remains one
of the biggest practical challenges to the automation of formal proofs of
safety for hybrid systems. There are at present many disparate methods
available for generating continuous invariants; however, this wealth of diverse
techniques presents a number of challenges, with different methods having
different strengths and weaknesses. To address some of these challenges, we
develop Pegasus: an automatic continuous invariant generator which allows for
combinations of various methods, and integrate it with the KeYmaera X theorem
prover for hybrid systems. We describe some of the architectural aspects of
this integration, comment on its methods and challenges, and present an
experimental evaluation on a suite of benchmarks.
","[{'version': 'v1', 'created': 'Tue, 19 May 2020 10:19:14 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Sep 2020 13:15:45 GMT'}]",2021-02-09,"[['Sogokon', 'Andrew', ''], ['Mitsch', 'Stefan', ''], ['Tan', 'Yong Kiam', ''], ['Cordwell', 'Katherine', ''], ['Platzer', 'André', '']]","['invariant generation', 'continuous invariants', 'ordinary differentialequations', 'theorem proving']"
10491,cs/0407024,Ioannis Athanasiadis,Ioannis N Athanasiadis and Pericles A Mitkas,An agent-based intelligent environmental monitoring system,"Multi-Agent Systems, Intelligent Applications, Data Mining, Inductive
  Agents, Air-Quality Monitoring","Management of Environmental Quality, 15(3):238-249, May 2004",10.1108/14777830410531216,,cs.MA cs.CE,,"  Fairly rapid environmental changes call for continuous surveillance and
on-line decision making. There are two main areas where IT technologies can be
valuable. In this paper we present a multi-agent system for monitoring and
assessing air-quality attributes, which uses data coming from a meteorological
station. A community of software agents is assigned to monitor and validate
measurements coming from several sensors, to assess air-quality, and, finally,
to fire alarms to appropriate recipients, when needed. Data mining techniques
have been used for adding data-driven, customized intelligence into agents. The
architecture of the developed system, its domain ontology, and typical agent
interactions are presented. Finally, the deployment of a real-world test case
is demonstrated.
","[{'version': 'v1', 'created': 'Sat, 10 Jul 2004 11:06:57 GMT'}]",2007-05-23,"[['Athanasiadis', 'Ioannis N', ''], ['Mitkas', 'Pericles A', '']]","['Multi-Agent Systems', 'Intelligent Applications', 'Data Mining', 'Inductive']"
10492,2010.15606,Unnikrishnan Menon,Unnikrishnan Menon and Divyani Panda,Design and Evaluation of Electric Bus Systems for Metropolitan Cities,"8 pages, 5 figures, 3 tables","SSRG International Journal of Mechanical Engineering 7(10), 16-23
  (2020)",10.14445/23488360/IJME-V7I10P104,IJME-V7I10P104,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the past decade, most of the metropolitan cities across the world have
been witnessing a degrading trend in air quality index. Exhaust emission data
observations show that promotion of public transport could be a potential way
out of this gridlock. Due to environmental concerns, numerous public transport
authorities harbor a great interest in introducing zero emission electric
buses. A shift from conventional diesel buses to electric buses comes with
several benefits in terms of reduction in local pollution, noise, and fuel
consumption. This paper proposes the relevant vehicle technologies, powertrain,
and charging systems, which, in combination, provides a comprehensive
methodology to design an Electric Bus that can be deployed in metropolitan
cities to mitigate emission concerns.
","[{'version': 'v1', 'created': 'Mon, 26 Oct 2020 12:49:35 GMT'}]",2020-10-30,"[['Menon', 'Unnikrishnan', ''], ['Panda', 'Divyani', '']]","['Electric Vehicles', 'Public Transport', 'Motor Specification', 'Powertrain', 'LTO Battery', 'Power']"
10493,1802.01025,Anton V. Proskurnikov,"Anton V. Proskurnikov, Manuel Mazo Jr",Lyapunov Design for Event-Triggered Exponential Stabilization,accepted by ACM HSCC 2018 conference,,10.1145/3178126.3178142,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Control Lyapunov Functions (CLF) method gives a constructive tool for
stabilization of nonlinear systems. To find a CLF, many methods have been
proposed in the literature, e.g. backstepping for cascaded systems and sum of
squares (SOS) programming for polynomial systems. Dealing with continuous-time
systems, the CLF-based controller is also continuous-time, whereas practical
implementation on a digital platform requires sampled-time control. In this
paper, we show that if the continuous-time controller provides exponential
stabilization, then an exponentially stabilizing event-triggered control
strategy exists with the convergence rate arbitrarily close to the rate of the
continuous-time system.
","[{'version': 'v1', 'created': 'Sat, 3 Feb 2018 20:45:52 GMT'}]",2019-04-04,"[['Proskurnikov', 'Anton V.', ''], ['Mazo', 'Manuel', 'Jr']]","['Event-triggered control', 'Stability', 'Control Lyapunov Function']"
10494,2107.11697,Hridoy Sankar Dutta,"Hridoy Sankar Dutta, Kartik Aggarwal and Tanmoy Chakraborty","DECIFE: Detecting Collusive Users Involved in Blackmarket Following
  Services on Twitter",,,10.1145/3465336.3475108,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  The popularity of Twitter has fostered the emergence of various fraudulent
user activities - one such activity is to artificially bolster the social
reputation of Twitter profiles by gaining a large number of followers within a
short time span. Many users want to gain followers to increase the visibility
and reach of their profiles to wide audiences. This has provoked several
blackmarket services to garner huge attention by providing artificial followers
via the network of agreeable and compromised accounts in a collusive manner.
Their activity is difficult to detect as the blackmarket services shape their
behavior in such a way that users who are part of these services disguise
themselves as genuine users.
  In this paper, we propose DECIFE, a framework to detect collusive users
involved in producing 'following' activities through blackmarket services with
the intention to gain collusive followers in return. We first construct a
heterogeneous user-tweet-topic network to leverage the follower/followee
relationships and linguistic properties of a user. The heterogeneous network is
then decomposed to form four different subgraphs that capture the semantic
relations between the users. An attention-based subgraph aggregation network is
proposed to learn and combine the node representations from each subgraph. The
combined representation is finally passed on to a hypersphere learning
objective to detect collusive users. Comprehensive experiments on our curated
dataset are conducted to validate the effectiveness of DECIFE by comparing it
with other state-of-the-art approaches. To our knowledge, this is the first
attempt to detect collusive users involved in blackmarket 'following services'
on Twitter.
","[{'version': 'v1', 'created': 'Sat, 24 Jul 2021 23:09:41 GMT'}]",2021-07-27,"[['Dutta', 'Hridoy Sankar', ''], ['Aggarwal', 'Kartik', ''], ['Chakraborty', 'Tanmoy', '']]","['Followers', 'collusion', 'blackmarket', 'Twitter', 'OSNs']"
10495,2301.04614,David Rivest-H\'enault,Mohammad Karami and Herv\'e Lombaert and David Rivest-H\'enault,"Real-time simulation of viscoelastic tissue behavior with physics-guided
  deep learning",,"Real-time simulation of viscoelastic tissue behavior with
  physics-guided deep learning, Computerized Medical Imaging and Graphics,
  Volume 104, 2023, 102165, ISSN 0895-6111",10.1016/j.compmedimag.2022.102165,,cs.LG cond-mat.soft physics.comp-ph q-bio.TO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Finite element methods (FEM) are popular approaches for simulation of soft
tissues with elastic or viscoelastic behavior. However, their usage in
real-time applications, such as in virtual reality surgical training, is
limited by computational cost. In this application scenario, which typically
involves transportable simulators, the computing hardware severely constrains
the size or the level of details of the simulated scene. To address this
limitation, data-driven approaches have been suggested to simulate mechanical
deformations by learning the mapping rules from FEM generated datasets. Herein,
we propose a deep learning method for predicting displacement fields of soft
tissues with viscoelastic properties. The main contribution of this work is the
use of a physics-guided loss function for the optimization of the deep learning
model parameters. The proposed deep learning model is based on convolutional
(CNN) and recurrent layers (LSTM) to predict spatiotemporal variations. It is
augmented with a mass conservation law in the lost function to prevent the
generation of physically inconsistent results. The deep learning model is
trained on a set of FEM datasets that are generated from a commercially
available state-of-the-art numerical neurosurgery simulator. The use of the
physics-guided loss function in a deep learning model has led to a better
generalization in the prediction of deformations in unseen simulation cases.
Moreover, the proposed method achieves a better accuracy over the conventional
CNN models, where improvements were observed in unseen tissue from 8% to 30%
depending on the magnitude of external forces. It is hoped that the present
investigation will help in filling the gap in applying deep learning in virtual
reality simulators, hence improving their computational performance (compared
to FEM simulations) and ultimately their usefulness.
","[{'version': 'v1', 'created': 'Wed, 11 Jan 2023 18:17:10 GMT'}]",2023-01-12,"[['Karami', 'Mohammad', ''], ['Lombaert', 'Hervé', ''], ['Rivest-Hénault', 'David', '']]","['Physics-guided deep learning', 'Real-time simulation', 'Viscoelastic material', 'Finite element method']"
10496,2103.15942,Chenghong Wang,"Chenghong Wang, Johes Bater, Kartik Nayak, Ashwin Machanavajjhala","DP-Sync: Hiding Update Patterns in Secure Outsourced Databases with
  Differential Privacy",,,10.1145/3448016.3457306,,cs.CR cs.DB,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we have introduced a new type of leakage associated with
modern encrypted databases called update pattern leakage. We formalize the
definition and security model of DP-Sync with DP update patterns. We also
proposed the framework DP-Sync, which extends existing encrypted database
schemes to DP-Sync with DP update patterns. DP-Sync guarantees that the entire
data update history over the outsourced data structure is protected by
differential privacy. This is achieved by imposing differentially-private
strategies that dictate the data owner's synchronization of local~data.
","[{'version': 'v1', 'created': 'Mon, 29 Mar 2021 20:36:59 GMT'}, {'version': 'v2', 'created': 'Wed, 31 Mar 2021 01:56:15 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Apr 2021 02:45:27 GMT'}]",2021-04-08,"[['Wang', 'Chenghong', ''], ['Bater', 'Johes', ''], ['Nayak', 'Kartik', ''], ['Machanavajjhala', 'Ashwin', '']]","['update pattern', 'encrypted database', 'differential privacy']"
10497,2006.06966,Usman A. Fiaz,"Mohamed Abdelkader, Usman A. Fiaz, Noureddine Toumi, Mohamed A.
  Mabrok, Jeff S. Shamma",RISCuer: A Reliable Multi-UAV Search and Rescue Testbed,"Book chapter: 41 pages, 27 figures (Minor revision: Corrected
  references)","Unmanned Aerial Systems, 2021",10.1016/B978-0-12-820276-0.00021-2,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the Robotics Intelligent Systems & Control (RISC) Lab multiagent
testbed for reliable search and rescue and aerial transport in outdoor
environments. The system consists of a team of three multirotor unmanned aerial
vehicles (UAVs), which are capable of autonomously searching, picking up, and
transporting randomly distributed objects in an outdoor field. The method
involves vision based object detection and localization, passive aerial
grasping with our novel design, GPS based UAV navigation, and safe release of
the objects at the drop zone. Our cooperative strategy ensures safe spatial
separation between UAVs at all times and we prevent any conflicts at the drop
zone using communication enabled consensus. All computation is performed
onboard each UAV. We describe the complete software and hardware architecture
for the system and demonstrate its reliable performance using comprehensive
outdoor experiments, and by comparing our results with some recent, similar
works.
","[{'version': 'v1', 'created': 'Fri, 12 Jun 2020 06:43:38 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Aug 2020 01:04:09 GMT'}, {'version': 'v3', 'created': 'Mon, 28 Sep 2020 22:21:58 GMT'}, {'version': 'v4', 'created': 'Tue, 7 Dec 2021 12:39:51 GMT'}]",2021-12-08,"[['Abdelkader', 'Mohamed', ''], ['Fiaz', 'Usman A.', ''], ['Toumi', 'Noureddine', ''], ['Mabrok', 'Mohamed A.', ''], ['Shamma', 'Jeff S.', '']]","['Search and rescue', 'multiagent systems', 'unmanned aerial vehicles']"
10498,2206.03944,Anna Trella,"Anna L. Trella, Kelly W. Zhang, Inbal Nahum-Shani, Vivek Shetty,
  Finale Doshi-Velez, Susan A. Murphy","Designing Reinforcement Learning Algorithms for Digital Interventions:
  Pre-implementation Guidelines",,,10.3390/a15080255,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Online reinforcement learning (RL) algorithms are increasingly used to
personalize digital interventions in the fields of mobile health and online
education. Common challenges in designing and testing an RL algorithm in these
settings include ensuring the RL algorithm can learn and run stably under
real-time constraints, and accounting for the complexity of the environment,
e.g., a lack of accurate mechanistic models for the user dynamics. To guide how
one can tackle these challenges, we extend the PCS (Predictability,
Computability, Stability) framework, a data science framework that incorporates
best practices from machine learning and statistics in supervised learning (Yu
and Kumbier, 2020), to the design of RL algorithms for the digital
interventions setting. Further, we provide guidelines on how to design
simulation environments, a crucial tool for evaluating RL candidate algorithms
using the PCS framework. We illustrate the use of the PCS framework for
designing an RL algorithm for Oralytics, a mobile health study aiming to
improve users' tooth-brushing behaviors through the personalized delivery of
intervention messages. Oralytics will go into the field in late 2022.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2022 15:05:28 GMT'}, {'version': 'v2', 'created': 'Sun, 17 Jul 2022 18:02:52 GMT'}, {'version': 'v3', 'created': 'Thu, 18 Aug 2022 15:26:25 GMT'}]",2022-09-01,"[['Trella', 'Anna L.', ''], ['Zhang', 'Kelly W.', ''], ['Nahum-Shani', 'Inbal', ''], ['Shetty', 'Vivek', ''], ['Doshi-Velez', 'Finale', ''], ['Murphy', 'Susan A.', '']]","['reinforcement learning (RL)', 'online learning; mobile health', 'algorithm design', 'algorithmevaluation']"
10499,2104.14859,Roberto Gorrieri,Arnaldo Cesco and Roberto Gorrieri,"A Decidable Equivalence for a Turing-complete, Distributed Model of
  Computation",arXiv admin note: substantial text overlap with arXiv:2104.01392,"46th International Symposium on Mathematical Foundations of
  Computer Science (MFCS 2021), 28:1--28:18, Leibniz International Proceedings
  in Informatics (LIPIcs),2021",10.4230/LIPIcs.MFCS.2021.28,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  Place/Transition Petri nets with inhibitor arcs (PTI nets for short), which
are a well-known Turing-complete, distributed model of computation, are
equipped with a decidable, behavioral equivalence, called pti-place
bisimilarity, that conservatively extends place bisimilarity defined over
Place/Transition nets (without inhibitor arcs). We prove that pti-place
bisimilarity is sensible, as it respects the causal semantics of PTI nets.
","[{'version': 'v1', 'created': 'Fri, 30 Apr 2021 09:23:41 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Nov 2022 08:52:16 GMT'}]",2022-11-03,"[['Cesco', 'Arnaldo', ''], ['Gorrieri', 'Roberto', '']]","['Petri nets', 'Inhibitor arc', 'Behavioral equivalence', 'Bisimulation', 'Decidability']"
10500,2207.05584,Yuhao Yang,"Yuhao Yang, Chao Huang, Lianghao Xia, Yuxuan Liang, Yanwei Yu,
  Chenliang Li","Multi-Behavior Hypergraph-Enhanced Transformer for Sequential
  Recommendation",Published as a KDD'22 full paper,,10.1145/3534678.3539342,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning dynamic user preference has become an increasingly important
component for many online platforms (e.g., video-sharing sites, e-commerce
systems) to make sequential recommendations. Previous works have made many
efforts to model item-item transitions over user interaction sequences, based
on various architectures, e.g., recurrent neural networks and self-attention
mechanism. Recently emerged graph neural networks also serve as useful backbone
models to capture item dependencies in sequential recommendation scenarios.
Despite their effectiveness, existing methods have far focused on item sequence
representation with singular type of interactions, and thus are limited to
capture dynamic heterogeneous relational structures between users and items
(e.g., page view, add-to-favorite, purchase). To tackle this challenge, we
design a Multi-Behavior Hypergraph-enhanced Transformer framework (MBHT) to
capture both short-term and long-term cross-type behavior dependencies.
Specifically, a multi-scale Transformer is equipped with low-rank
self-attention to jointly encode behavior-aware sequential patterns from
fine-grained and coarse-grained levels. Additionally, we incorporate the global
multi-behavior dependency into the hypergraph neural architecture to capture
the hierarchical long-range item correlations in a customized manner.
Experimental results demonstrate the superiority of our MBHT over various
state-of-the-art recommendation solutions across different settings. Further
ablation studies validate the effectiveness of our model design and benefits of
the new MBHT framework. Our implementation code is released at:
https://github.com/yuh-yang/MBHT-KDD22.
","[{'version': 'v1', 'created': 'Tue, 12 Jul 2022 15:07:21 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Sep 2022 06:42:24 GMT'}]",2022-09-21,"[['Yang', 'Yuhao', ''], ['Huang', 'Chao', ''], ['Xia', 'Lianghao', ''], ['Liang', 'Yuxuan', ''], ['Yu', 'Yanwei', ''], ['Li', 'Chenliang', '']]","['Sequential Recommendation', 'Graph Neural Networks', 'HypergraphLearning', 'Multi-Behavior Recommendation']"
10501,2106.09665,Zhichao Xu,"Zhichao Xu, Hansi Zeng, Qingyao Ai","Understanding the Effectiveness of Reviews in E-commerce Top-N
  Recommendation",in proceedings of ICTIR 2021,,10.1145/3471158.3472258,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Modern E-commerce websites contain heterogeneous sources of information, such
as numerical ratings, textual reviews and images. These information can be
utilized to assist recommendation. Through textual reviews, a user explicitly
express her affinity towards the item. Previous researchers found that by using
the information extracted from these reviews, we can better profile the users'
explicit preferences as well as the item features, leading to the improvement
of recommendation performance. However, most of the previous algorithms were
only utilizing the review information for explicit-feedback problem i.e. rating
prediction, and when it comes to implicit-feedback ranking problem such as
top-N recommendation, the usage of review information has not been fully
explored. Seeing this gap, in this work, we investigate the effectiveness of
textual review information for top-N recommendation under E-commerce settings.
We adapt several SOTA review-based rating prediction models for top-N
recommendation tasks and compare them to existing top-N recommendation models
from both performance and efficiency. We find that models utilizing only review
information can not achieve better performances than vanilla implicit-feedback
matrix factorization method. When utilizing review information as a regularizer
or auxiliary information, the performance of implicit-feedback matrix
factorization method can be further improved. However, the optimal model
structure to utilize textual reviews for E-commerce top-N recommendation is yet
to be determined.
","[{'version': 'v1', 'created': 'Thu, 17 Jun 2021 17:15:45 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Jun 2021 05:49:55 GMT'}, {'version': 'v3', 'created': 'Tue, 29 Jun 2021 17:21:57 GMT'}, {'version': 'v4', 'created': 'Thu, 12 Aug 2021 18:54:52 GMT'}, {'version': 'v5', 'created': 'Fri, 20 Aug 2021 19:37:42 GMT'}, {'version': 'v6', 'created': 'Sun, 29 Aug 2021 05:09:14 GMT'}, {'version': 'v7', 'created': 'Sun, 19 Sep 2021 21:16:21 GMT'}]",2021-09-21,"[['Xu', 'Zhichao', ''], ['Zeng', 'Hansi', ''], ['Ai', 'Qingyao', '']]","['Recommender System', 'Top-N Recommendation', 'Implicit Feedback', 'Reproducibility']"
10502,2205.08395,Sara Lafia,"Sara Lafia, Lizhou Fan, Andrea Thomer, Libby Hemphill","Subdivisions and Crossroads: Identifying Hidden Community Structures in
  a Data Archive's Citation Network","30 pages, 7 tables, 4 figures",,10.1162/qss_a_00209,,cs.DL cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Data archives are an important source of high quality data in many fields,
making them ideal sites to study data reuse. By studying data reuse through
citation networks, we are able to learn how hidden research communities - those
that use the same scientific datasets - are organized. This paper analyzes the
community structure of an authoritative network of datasets cited in academic
publications, which have been collected by a large, social science data
archive: the Interuniversity Consortium for Political and Social Research
(ICPSR). Through network analysis, we identified communities of social science
datasets and fields of research connected through shared data use. We argue
that communities of exclusive data reuse form subdivisions that contain
valuable disciplinary resources, while datasets at a ""crossroads"" broadly
connect research communities. Our research reveals the hidden structure of data
reuse and demonstrates how interdisciplinary research communities organize
around datasets as shared scientific inputs. These findings contribute new ways
of describing scientific communities in order to understand the impacts of
research data reuse.
","[{'version': 'v1', 'created': 'Tue, 17 May 2022 14:18:49 GMT'}]",2022-10-21,"[['Lafia', 'Sara', ''], ['Fan', 'Lizhou', ''], ['Thomer', 'Andrea', ''], ['Hemphill', 'Libby', '']]","['archival science', 'community detection', 'data citation', 'data reuse', 'network analysis']"
10503,1806.06553,Chang Li Mr.,"Chang Li, Maarten de Rijke",Incremental Sparse Bayesian Ordinal Regression,,,10.1016/j.neunet.2018.07.015,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ordinal Regression (OR) aims to model the ordering information between
different data categories, which is a crucial topic in multi-label learning. An
important class of approaches to OR models the problem as a linear combination
of basis functions that map features to a high dimensional non-linear space.
However, most of the basis function-based algorithms are time consuming. We
propose an incremental sparse Bayesian approach to OR tasks and introduce an
algorithm to sequentially learn the relevant basis functions in the ordinal
scenario. Our method, called Incremental Sparse Bayesian Ordinal Regression
(ISBOR), automatically optimizes the hyper-parameters via the type-II maximum
likelihood method. By exploiting fast marginal likelihood optimization, ISBOR
can avoid big matrix inverses, which is the main bottleneck in applying basis
function-based algorithms to OR tasks on large-scale datasets. We show that
ISBOR can make accurate predictions with parsimonious basis functions while
offering automatic estimates of the prediction uncertainty. Extensive
experiments on synthetic and real word datasets demonstrate the efficiency and
effectiveness of ISBOR compared to other basis function-based OR approaches.
","[{'version': 'v1', 'created': 'Mon, 18 Jun 2018 08:55:20 GMT'}]",2019-10-21,"[['Li', 'Chang', ''], ['de Rijke', 'Maarten', '']]","['Ordinal regression', 'sparse Bayesian learning', 'basis function-based method']"
10504,1809.05530,Eduardo Martins Hargreaves,"Eduardo Hargreaves, Claudio Agosti, Daniel Menasch\'e, Giovanni
  Neglia, Alexandre Reiffers-Masson, Eitan Altman","Fairness in Online Social Network Timelines: Measurements, Models and
  Mechanism Design","IFIP Perfomance 2018 - 36th International Symposium on Computer
  Performance, Modeling, Measurements and Evaluation","Performance Evaluation, 129, 15-39 (2019)",10.1016/j.peva.2018.09.009,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Facebook News Feed personalization algorithm has a significant impact, on a
daily basis, on the lifestyle, mood and opinion of millions of Internet users.
Nonetheless, the behavior of such algorithm lacks transparency, motivating
measurements, modeling and analysis in order to understand and improve its
properties. In this paper, we propose a reproducible methodology encompassing
measurements, an analytical model and a fairness-based News Feed design. The
model leverages the versatility and analytical tractability of time-to-live
(TTL) counters to capture the visibility and occupancy of publishers over a
News Feed. Measurements are used to parameterize and to validate the expressive
power of the proposed model. Then, we conduct a what-if analysis to assess the
visibility and occupancy bias incurred by users against a baseline derived from
the model. Our results indicate that a significant bias exists and it is more
prominent at the top position of the News Feed. In addition, we find that the
bias is non-negligible even for users that are deliberately set as neutral with
respect to their political views, motivating the proposal of a novel and more
transparent fairness-based News Feed design.
","[{'version': 'v1', 'created': 'Tue, 11 Sep 2018 21:00:50 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Oct 2018 22:57:58 GMT'}]",2019-03-07,"[['Hargreaves', 'Eduardo', ''], ['Agosti', 'Claudio', ''], ['Menasché', 'Daniel', ''], ['Neglia', 'Giovanni', ''], ['Reiffers-Masson', 'Alexandre', ''], ['Altman', 'Eitan', '']]","['Facebook', 'measurements', 'social networks', 'timelines', 'bias', 'fairness']"
10505,1909.00133,Gong Cheng,"Ke Li, Gang Wan, Gong Cheng, Liqiu Meng, Junwei Han","Object Detection in Optical Remote Sensing Images: A Survey and A New
  Benchmark",,"ISPRS Journal of Photogrammetry and Remote Sensing, 159: 296-307,
  2020",10.1016/j.isprsjprs.2019.11.023,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Substantial efforts have been devoted more recently to presenting various
methods for object detection in optical remote sensing images. However, the
current survey of datasets and deep learning based methods for object detection
in optical remote sensing images is not adequate. Moreover, most of the
existing datasets have some shortcomings, for example, the numbers of images
and object categories are small scale, and the image diversity and variations
are insufficient. These limitations greatly affect the development of deep
learning based object detection methods. In the paper, we provide a
comprehensive review of the recent deep learning based object detection
progress in both the computer vision and earth observation communities. Then,
we propose a large-scale, publicly available benchmark for object DetectIon in
Optical Remote sensing images, which we name as DIOR. The dataset contains
23463 images and 192472 instances, covering 20 object classes. The proposed
DIOR dataset 1) is large-scale on the object categories, on the object instance
number, and on the total image number; 2) has a large range of object size
variations, not only in terms of spatial resolutions, but also in the aspect of
inter- and intra-class size variability across objects; 3) holds big variations
as the images are obtained with different imaging conditions, weathers,
seasons, and image quality; and 4) has high inter-class similarity and
intra-class diversity. The proposed benchmark can help the researchers to
develop and validate their data-driven methods. Finally, we evaluate several
state-of-the-art approaches on our DIOR dataset to establish a baseline for
future research.
","[{'version': 'v1', 'created': 'Sat, 31 Aug 2019 05:36:15 GMT'}, {'version': 'v2', 'created': 'Sun, 22 Sep 2019 02:13:30 GMT'}]",2019-12-06,"[['Li', 'Ke', ''], ['Wan', 'Gang', ''], ['Cheng', 'Gong', ''], ['Meng', 'Liqiu', ''], ['Han', 'Junwei', '']]","['Object\xa0 detection', 'Deep\xa0 learning', 'Convolutional\xa0 Neural\xa0 Network\xa0 (CNN)', 'Benchmark\xa0 Dataset', 'Optical\xa0remote\xa0sensing\xa0images1']"
10506,2002.10018,Ami Paz,"Pierre Fraigniaud, Fran\c{c}ois Le Gall, Harumichi Nishimura, Ami Paz",Distributed Quantum Proofs for Replicated Data,To be presented in ITCS 2021,"Proceedings of the 12th Innovations in Theoretical Computer
  Science Conference (ITCS2021), pp. 28:1-28:20, 2021",10.4230/LIPIcs.ITCS.2021.28,,cs.DC quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper tackles the issue of $\textit{checking}$ that all copies of a large
data set replicated at several nodes of a network are identical. The fact that
the replicas may be located at distant nodes prevents the system from verifying
their equality locally, i.e., by having each node consult only nodes in its
vicinity. On the other hand, it remains possible to assign
$\textit{certificates}$ to the nodes, so that verifying the consistency of the
replicas can be achieved locally. However, we show that, as the data set is
large, classical certification mechanisms, including distributed Merlin-Arthur
protocols, cannot guarantee good completeness and soundness simultaneously,
unless they use very large certificates. The main result of this paper is a
distributed $\textit{quantum}$ Merlin-Arthur protocol enabling the nodes to
collectively check the consistency of the replicas, based on small
certificates, and in a single round of message exchange between neighbors, with
short messages. In particular, the certificate-size is logarithmic in the size
of the data set, which gives an exponential advantage over classical
certification mechanisms.
","[{'version': 'v1', 'created': 'Mon, 24 Feb 2020 00:09:55 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Nov 2020 09:16:19 GMT'}]",2021-10-05,"[['Fraigniaud', 'Pierre', ''], ['Gall', 'François Le', ''], ['Nishimura', 'Harumichi', ''], ['Paz', 'Ami', '']]","['Quantum Computing', 'Distributed Network Computing', 'Algorithmic Aspectsof Networks']"
10507,2112.09045,Paul Bergmann,"Paul Bergmann, Xin Jin, David Sattlegger, Carsten Steger","The MVTec 3D-AD Dataset for Unsupervised 3D Anomaly Detection and
  Localization",Accepted for presentation at VISAPP 2022,,10.5220/0010865000003124,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the first comprehensive 3D dataset for the task of unsupervised
anomaly detection and localization. It is inspired by real-world visual
inspection scenarios in which a model has to detect various types of defects on
manufactured products, even if it is trained only on anomaly-free data. There
are defects that manifest themselves as anomalies in the geometric structure of
an object. These cause significant deviations in a 3D representation of the
data. We employed a high-resolution industrial 3D sensor to acquire depth scans
of 10 different object categories. For all object categories, we present a
training and validation set, each of which solely consists of scans of
anomaly-free samples. The corresponding test sets contain samples showing
various defects such as scratches, dents, holes, contaminations, or
deformations. Precise ground-truth annotations are provided for every anomalous
test sample. An initial benchmark of 3D anomaly detection methods on our
dataset indicates a considerable room for improvement.
","[{'version': 'v1', 'created': 'Thu, 16 Dec 2021 17:35:51 GMT'}]",2022-02-25,"[['Bergmann', 'Paul', ''], ['Jin', 'Xin', ''], ['Sattlegger', 'David', ''], ['Steger', 'Carsten', '']]","['Anomaly Detection', 'Dataset', 'Unsupervised Learning', 'Visual Inspection', '3D Computer Vision']"
10508,1712.02657,Darren Engwirda,Darren Engwirda,Generalised primal-dual grids for unstructured co-volume schemes,,,10.1016/j.jcp.2018.07.025,,cs.CG cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The generation of high-quality staggered unstructured grids is considered,
leading to the development of a new optimisation-based strategy designed to
construct weighted `Regular-Power' tessellations appropriate for co-volume type
numerical discretisation techniques. This new framework aims to extend the
conventional Delaunay-Voronoi primal-dual structure; seeking to assemble
generalised orthogonal tessellations with enhanced geometric quality. The
construction of these grids is motivated by the desire to improve the
performance and accuracy of numerical methods based on unstructured co-volume
type schemes, including various staggered grid techniques for the simulation of
fluid dynamics and hyperbolic transport. In this study, a new hybrid
optimisation strategy is proposed; seeking to optimise the geometry, topology
and weights associated with general, two-dimensional Regular-Power
tessellations using a combination of gradient-ascent and energy-based
techniques. The performance of this new method is tested experimentally, with a
range of complex, multi-resolution primal-dual grids generated for various
coastal and regional ocean modelling applications.
","[{'version': 'v1', 'created': 'Sun, 3 Dec 2017 17:56:05 GMT'}, {'version': 'v2', 'created': 'Thu, 31 May 2018 22:19:15 GMT'}]",2018-09-26,"[['Engwirda', 'Darren', '']]","['Mesh generation', 'Mesh optimisation', 'Primal-dual pairs', 'Power diagrams', 'Voronoi diagrams', 'Co-volume discretisation']"
10509,2104.00508,Valmir C. Barbosa,"Raphael M. Guedes, Jos\'e F. de Rezende, Valmir C. Barbosa","Integrated optimization of heterogeneous-network management and the
  elusive role of macrocells",This version updates metadata,"IEEE Access 9 (2021), 149552-149559",10.1109/ACCESS.2021.3125240,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider heterogeneous wireless networks in the physical interference
model and introduce a new formulation of the mixed-integer nonlinear
programming problem that addresses base-station activation and many-to-many
associations while minimizing power consumption. We also introduce HetNetGA, a
genetic algorithm that can tackle the problem without any approximations.
Though unsuitable for practical deployment, HetNetGA enables the investigation
of such networks' true possibilities. Results for scenarios involving both
macrocells and picocells often align with what is expected, but sometimes are
unexpected and essentially point to the need to better understand the role of
macrocells in helping provide capacity while remaining energetically
advantageous.
","[{'version': 'v1', 'created': 'Thu, 1 Apr 2021 15:06:48 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Jun 2021 12:44:05 GMT'}, {'version': 'v3', 'created': 'Tue, 20 Jul 2021 11:25:39 GMT'}]",2022-01-26,"[['Guedes', 'Raphael M.', ''], ['de Rezende', 'José F.', ''], ['Barbosa', 'Valmir C.', '']]","['Heterogeneous wireless networks', 'physical interference model', 'capacity allocation', 'power optimization']"
10510,2104.01160,Wenjie Luo Mr,"Wenjie Luo, Zhenyu Yan, Qun Song, Rui Tan","PhyAug: Physics-Directed Data Augmentation for Deep Sensing Model
  Transfer in Cyber-Physical Systems",,,10.1145/3412382.3458255,,cs.SD cs.HC eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Run-time domain shifts from training-phase domains are common in sensing
systems designed with deep learning. The shifts can be caused by sensor
characteristic variations and/or discrepancies between the design-phase model
and the actual model of the sensed physical process. To address these issues,
existing transfer learning techniques require substantial target-domain data
and thus incur high post-deployment overhead. This paper proposes to exploit
the first principle governing the domain shift to reduce the demand on
target-domain data. Specifically, our proposed approach called PhyAug uses the
first principle fitted with few labeled or unlabeled source/target-domain data
pairs to transform the existing source-domain training data into augmented data
for updating the deep neural networks. In two case studies of keyword spotting
and DeepSpeech2-based automatic speech recognition, with 5-second unlabeled
data collected from the target microphones, PhyAug recovers the recognition
accuracy losses due to microphone characteristic variations by 37% to 72%. In a
case study of seismic source localization with TDoA fngerprints, by exploiting
the frst principle of signal propagation in uneven media, PhyAug only requires
3% to 8% of labeled TDoA measurements required by the vanilla fingerprinting
approach in achieving the same localization accuracy.
","[{'version': 'v1', 'created': 'Wed, 31 Mar 2021 13:49:45 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Apr 2021 12:42:02 GMT'}]",2021-04-20,"[['Luo', 'Wenjie', ''], ['Yan', 'Zhenyu', ''], ['Song', 'Qun', ''], ['Tan', 'Rui', '']]","['Cyber-physical system', 'neural networks', 'data augmentation', 'domain adaptation']"
10511,2108.05005,Adel Nikfarjam,"Adel Nikfarjam, Jakob Bossek, Aneta Neumann, and Frank Neumann","Computing Diverse Sets of High Quality TSP Tours by EAX-Based
  Evolutionary Diversity Optimisation",To appear at FOGA 2021,,10.1145/3450218.3477310,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evolutionary algorithms based on edge assembly crossover (EAX) constitute
some of the best performing incomplete solvers for the well-known traveling
salesperson problem (TSP). Often, it is desirable to compute not just a single
solution for a given problem, but a diverse set of high quality solutions from
which a decision maker can choose one for implementation. Currently, there are
only a few approaches for computing a diverse solution set for the TSP.
Furthermore, almost all of them assume that the optimal solution is known. In
this paper, we introduce evolutionary diversity optimisation (EDO) approaches
for the TSP that find a diverse set of tours when the optimal tour is known or
unknown. We show how to adopt EAX to not only find a high-quality solution but
also to maximise the diversity of the population. The resulting EAX-based EDO
approach, termed EAX-EDO is capable of obtaining diverse high-quality tours
when the optimal solution for the TSP is known or unknown. A comparison to
existing approaches shows that they are clearly outperformed by EAX-EDO.
","[{'version': 'v1', 'created': 'Wed, 11 Aug 2021 03:16:11 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Aug 2021 01:07:35 GMT'}]",2021-08-13,"[['Nikfarjam', 'Adel', ''], ['Bossek', 'Jakob', ''], ['Neumann', 'Aneta', ''], ['Neumann', 'Frank', '']]","['Evolutionary algorithms', 'edge assembly crossover (EAX)', 'traveling salesperson problem (TSP)', 'evolutionary diversity optimisation (EDO)']"
10512,2101.01270,Taha Yasseri,Annika Breu and Taha Yasseri,"What drives passion? An empirical examination on the impact of
  personality trait interactions and job environments on work passion",To Appear in Current Psychology,Curr Psychol (2022),10.1007/s12144-022-02717-8,,cs.SI stat.AP,http://creativecommons.org/licenses/by/4.0/,"  Passionate employees are essential for organisational success as they foster
higher performance and exhibit lower turnover or absenteeism. While a large
body of research has investigated the consequences of passion, we know only
little about its antecedents. Integrating trait interaction theory with trait
activation theory, this paper examines how personality traits, i.e.
conscientiousness, agreeableness, and neuroticism impact passion at work across
different job situations. Passion has been conceptualized as a two-dimensional
construct, consisting of harmonious work passion (HWP) and obsessive work
passion (OWP). Our study is based on a sample of N = 824 participants from the
myPersonality project. We find a positive relationship between neuroticism and
OWP in enterprising environments. Further, we find a three-way interaction
between conscientiousness, agreeableness, and enterprising environment in
predicting OWP. Our findings imply that the impact of personality
configurations on different forms of passion is contingent on the job
environment. Moreover, in line with self-regulation theory, the results reveal
agreeableness as a ""cool influencer"" and neuroticism as a ""hot influencer"" of
the relationship between conscientiousness and work passion. We derive
practical implications for organisations on how to foster work passion,
particularly HWP, in organisations.
","[{'version': 'v1', 'created': 'Mon, 4 Jan 2021 22:56:57 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Jan 2021 18:59:37 GMT'}, {'version': 'v3', 'created': 'Tue, 4 Jan 2022 18:01:35 GMT'}]",2023-01-05,"[['Breu', 'Annika', ''], ['Yasseri', 'Taha', '']]","['Big Five', 'work passion', 'trait interaction', 'trait activation', 'self-regulation  INTRODUCTION']"
10513,1709.02559,EPTCS,Maike Schwammberger (University of Oldenburg),Imperfect Knowledge in Autonomous Urban Traffic Manoeuvres,"In Proceedings FVAV 2017, arXiv:1709.02126","EPTCS 257, 2017, pp. 59-74",10.4204/EPTCS.257.7,,cs.LO cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Urban Multi-lane Spatial Logic (UMLSL) was introduced in [13] for proving
safety (collision freedom) in autonomous urban traffic manoeuvres with perfect
knowledge. We now consider a concept of imperfect knowledge, where cars have
less information about other cars. To this end, we introduce the concept of a
multi-view and propose crossing controllers using broadcast communication with
data constraints for turning manoeuvres at intersections.
","[{'version': 'v1', 'created': 'Fri, 8 Sep 2017 06:36:10 GMT'}]",2017-09-11,"[['Schwammberger', 'Maike', '', 'University of Oldenburg']]","['Urban traffic', 'autonomous cars', 'collision freedom', 'imperfect knowledge', 'broadcast communication', 'multi-view', 'timed automata', 'multi-dimensional spatial logic']"
10514,2101.09509,Donlapark Ponnoprat,Donlapark Ponnoprat,"Short-term daily precipitation forecasting with seasonally-integrated
  autoencoder","35 pages, 13 figures","Applied Soft Computing, 102, 107083 (2021)",10.1016/j.asoc.2021.107083,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Short-term precipitation forecasting is essential for planning of human
activities in multiple scales, ranging from individuals' planning, urban
management to flood prevention. Yet the short-term atmospheric dynamics are
highly nonlinear that it cannot be easily captured with classical time series
models. On the other hand, deep learning models are good at learning nonlinear
interactions, but they are not designed to deal with the seasonality in time
series. In this study, we aim to develop a forecasting model that can both
handle the nonlinearities and detect the seasonality hidden within the daily
precipitation data. To this end, we propose a seasonally-integrated autoencoder
(SSAE) consisting of two long short-term memory (LSTM) autoencoders: one for
learning short-term dynamics, and the other for learning the seasonality in the
time series. Our experimental results show that not only does the SSAE
outperform various time series models regardless of the climate type, but it
also has low output variance compared to other deep learning models. The
results also show that the seasonal component of the SSAE helped improve the
correlation between the forecast and the actual values from 4% at horizon 1 to
37% at horizon 3.
","[{'version': 'v1', 'created': 'Sat, 23 Jan 2021 14:19:56 GMT'}]",2021-01-26,"[['Ponnoprat', 'Donlapark', '']]","['precipitation', 'forecast', 'time-series', 'LSTM', 'deep learning']"
10515,cs/0605011,Vida Dujmovi\'c,"Prosenjit Bose, Vida Dujmovi\'c, Danny Krizanc, Stefan Langerman, Pat
  Morin, David R. Wood, Stefanie Wuhrer",A Characterization of the Degree Sequences of 2-Trees,"17 pages, 5 figures","The Journal of Graph Theory, 58(3):191-209, 2008",10.1002/jgt.20302,,cs.DM math.CO,,"  A graph G is a 2-tree if G=K_3, or G has a vertex v of degree 2, whose
neighbours are adjacent, and G\v{i}s a 2-tree. A characterization of the degree
sequences of 2-trees is given. This characterization yields a linear-time
algorithm for recognizing and realizing degree sequences of 2-trees.
","[{'version': 'v1', 'created': 'Wed, 3 May 2006 16:57:21 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Jun 2006 15:37:20 GMT'}]",2012-10-23,"[['Bose', 'Prosenjit', ''], ['Dujmović', 'Vida', ''], ['Krizanc', 'Danny', ''], ['Langerman', 'Stefan', ''], ['Morin', 'Pat', ''], ['Wood', 'David R.', ''], ['Wuhrer', 'Stefanie', '']]","['degree sequence', 'graphical degree sequence', '2-tree', 'k-tree', 'series-parallel graph', 'treewidth']"
10516,2301.08051,Mohammad Ali Khoshkholghi,"Mohammad Ali Khoshkholghi, Toktam Mahmoodi, Subhankar Pal, Subhash
  Chopra, Mayuri Tendulkar, Sandip Sarkar",xURLCC in 6g with meshed RAN,,"ITU Journal on Future and Evolving Technologies, Volume 3 (2022),
  Issue 3, Pages 612-622",10.52953/JTPE9471,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  5G Ultra-Reliable Low Latency Communications Technology (URLLC) will not be
able to provide extremely reliable low latency services to the complex networks
in 6G. Moreover, URLLC that began with 5G has to be refined and improved in 6G
to provide xURLCC (extreme URLCC) with sub-millisecond latency, for supporting
diverse mission-critical applications. This paper aims to highlight the
importance of peer-to-peer mesh connectivity for services that require xURLLC.
Deploying mesh connectivity among RAN nodes would add significant value to the
current 5G New Radio (5G NR) enabling 6G to increase flexibility and
reliability of the networks while reducing the inherent latency introduced by
the core network. To provide a mesh connectivity in RAN, the nodes should be
able to communicate with each other directly and be independent from the mobile
core network so that data can be directly exchanged between base stations
(gNBs) whereas certain aspects of signalling procedure including data session
establishment will be managed by RAN itself. In this paper, we introduce
several architectural choices for a mesh network topology that could
potentially be crucial to a number of applications. In addition, three possible
options to create mesh connectivity in RAN are provided, and their pros and
cons are discussed in detail.
","[{'version': 'v1', 'created': 'Thu, 19 Jan 2023 12:54:06 GMT'}]",2023-01-20,"[['Khoshkholghi', 'Mohammad Ali', ''], ['Mahmoodi', 'Toktam', ''], ['Pal', 'Subhankar', ''], ['Chopra', 'Subhash', ''], ['Tendulkar', 'Mayuri', ''], ['Sarkar', 'Sandip', '']]","['6G', 'mesh connectivity', 'RAN', 'xURLCC']"
10517,1904.05303,Tamara Radivilova A,Tamara Radivilova and Lyudmyla Kirichenko and Oleksandra Yeremenko,"Calculation of routing value in MPLS network according to traffic
  fractal properties",4 pages,"2017 2nd International Conference on Advanced Information and
  Communication Technologies (AICT), Lviv, 2017, pp. 250-253",10.1109/AIACT.2017.8020112,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Method for calculating routing cost of MPLS network is presented in the work.
This method allows to minimize routing cost, taking into account traffic
fractal properties, choice of traffic transmission path and quality of service
requirements. The method uses values of the Hurst parameter and value of
normalized spread of traffic values, which makes it possible to apply it to
self-similar and multifractal data streams.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2019 17:09:50 GMT'}]",2019-04-11,"[['Radivilova', 'Tamara', ''], ['Kirichenko', 'Lyudmyla', ''], ['Yeremenko', 'Oleksandra', '']]","['Multiprotocol Label Switching', 'self-similar traffic', 'routing', 'calculation of routing cost']"
10518,2004.14010,Laura Zabawa,"Laura Zabawa, Anna Kicherer, Lasse Klingbeil, Reinhard T\""opfer,
  Heiner Kuhlmann, Ribana Roscher","Counting of Grapevine Berries in Images via Semantic Segmentation using
  Convolutional Neural Networks",,"Journal of Photogrammetry and Remote Sensing, vol. 164,
  pp.73-83,2020",10.1016/j.isprsjprs.2020.04.002,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The extraction of phenotypic traits is often very time and labour intensive.
Especially the investigation in viticulture is restricted to an on-site
analysis due to the perennial nature of grapevine. Traditionally skilled
experts examine small samples and extrapolate the results to a whole plot.
Thereby different grapevine varieties and training systems, e.g. vertical shoot
positioning (VSP) and semi minimal pruned hedges (SMPH) pose different
challenges. In this paper we present an objective framework based on automatic
image analysis which works on two different training systems. The images are
collected semi automatic by a camera system which is installed in a modified
grape harvester. The system produces overlapping images from the sides of the
plants. Our framework uses a convolutional neural network to detect single
berries in images by performing a semantic segmentation. Each berry is then
counted with a connected component algorithm. We compare our results with the
Mask-RCNN, a state-of-the-art network for instance segmentation and with a
regression approach for counting. The experiments presented in this paper show
that we are able to detect green berries in images despite of different
training systems. We achieve an accuracy for the berry detection of 94.0% in
the VSP and 85.6% in the SMPH.
","[{'version': 'v1', 'created': 'Wed, 29 Apr 2020 08:10:19 GMT'}]",2020-04-30,"[['Zabawa', 'Laura', ''], ['Kicherer', 'Anna', ''], ['Klingbeil', 'Lasse', ''], ['Töpfer', 'Reinhard', ''], ['Kuhlmann', 'Heiner', ''], ['Roscher', 'Ribana', '']]","['Deep Learning', 'Semantic Segmentation', 'Geoinformation', 'High-throughput Analysis', 'Plant Phenotyping', 'Vitis']"
10519,2005.00263,Rohit Zambre,"Rohit Zambre, Aparna Chandramowlishwaran, Pavan Balaji",How I Learned to Stop Worrying About User-Visible Endpoints and Love MPI,"In Proceedings of the 34th ACM International Conference on
  Supercomputing (ICS), Barcelona, Spain, June 2020",,10.1145/3392717.3392773,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  MPI+threads is gaining prominence as an alternative to the traditional MPI
everywhere model in order to better handle the disproportionate increase in the
number of cores compared with other on-node resources. However, the
communication performance of MPI+threads can be 100x slower than that of MPI
everywhere. Both MPI users and developers are to blame for this slowdown.
Typically, MPI users do not expose logical communication parallelism.
Consequently, MPI libraries use conservative approaches, such as a global
critical section, to maintain MPI's ordering constraints for MPI+threads, thus
serializing access to parallel network resources and hurting performance.
  To enhance MP+threads' communication performance, researchers have proposed
MPI Endpoints as a user-visible extension to MPI-3.1. MPI Endpoints allows a
single process to create multiple MPI ranks within a communicator. This could
allow each thread to have a dedicated communication path to the network and
improve performance. The onus of mapping threads to endpoints, however, would
then be on domain scientists. We play the role of devil's advocate and question
the need for user-visible endpoints. We certainly agree that dedicated
communication channels are critical. To what extent, however, can we hide these
channels inside the MPI library without modifying the MPI standard and thus
unburden the user? More important, what functionality would we lose through
such abstraction? This paper answers these questions through a new MPI-3.1
implementation that uses virtual communication interfaces (VCIs). VCIs abstract
underlying network contexts. When users expose parallelism through existing MPI
mechanisms, the MPI library maps that parallelism to the VCIs, relieving domain
scientists from endpoints. We identify cases where VCIs perform as well as
user-visible endpoints, as well as cases where such abstraction hurts
performance.
","[{'version': 'v1', 'created': 'Fri, 1 May 2020 07:54:11 GMT'}]",2020-05-04,"[['Zambre', 'Rohit', ''], ['Chandramowlishwaran', 'Aparna', ''], ['Balaji', 'Pavan', '']]","['MPI+threads', 'MPI+OpenMP', 'MPI_THREAD_MULTIPLE', 'exascaleMPI', 'high-performance communication', 'MPI Endpoints']"
10520,2108.10248,Sejoon Oh,"Sejoon Oh, Sungchul Kim, Ryan A. Rossi, Srijan Kumar",Influence-guided Data Augmentation for Neural Tensor Completion,"Accepted for publication at 30th ACM International Conference on
  Information and Knowledge Management (ACM CIKM 2021). Code and data:
  https://github.com/srijankr/DAIN",,10.1145/3459637.3482267,,cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  How can we predict missing values in multi-dimensional data (or tensors) more
accurately? The task of tensor completion is crucial in many applications such
as personalized recommendation, image and video restoration, and link
prediction in social networks. Many tensor factorization and neural
network-based tensor completion algorithms have been developed to predict
missing entries in partially observed tensors. However, they can produce
inaccurate estimations as real-world tensors are very sparse, and these methods
tend to overfit on the small amount of data. Here, we overcome these
shortcomings by presenting a data augmentation technique for tensors. In this
paper, we propose DAIN, a general data augmentation framework that enhances the
prediction accuracy of neural tensor completion methods. Specifically, DAIN
first trains a neural model and finds tensor cell importances with influence
functions. After that, DAIN aggregates the cell importance to calculate the
importance of each entity (i.e., an index of a dimension). Finally, DAIN
augments the tensor by weighted sampling of entity importances and a value
predictor. Extensive experimental results show that DAIN outperforms all data
augmentation baselines in terms of enhancing imputation accuracy of neural
tensor completion on four diverse real-world tensors. Ablation studies of DAIN
substantiate the effectiveness of each component of DAIN. Furthermore, we show
that DAIN scales near linearly to large datasets.
","[{'version': 'v1', 'created': 'Mon, 23 Aug 2021 15:38:59 GMT'}]",2021-08-24,"[['Oh', 'Sejoon', ''], ['Kim', 'Sungchul', ''], ['Rossi', 'Ryan A.', ''], ['Kumar', 'Srijan', '']]","['Tensor', 'Tensor Completion', 'Neural Network', 'Data Augmentation', 'Data Influence', 'Recommender System', 'Deep Learning']"
10521,2008.01175,Renato Cordeiro de Amorim,Renato Cordeiro de Amorim and Carlos David Lopez Ruiz,Identifying meaningful clusters in malware data,,,10.1016/j.eswa.2021.114971,,cs.CR cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Finding meaningful clusters in drive-by-download malware data is a
particularly difficult task. Malware data tends to contain overlapping clusters
with wide variations of cardinality. This happens because there can be
considerable similarity between malware samples (some are even said to belong
to the same family), and these tend to appear in bursts. Clustering algorithms
are usually applied to normalised data sets. However, the process of
normalisation aims at setting features with different range values to have a
similar contribution to the clustering. It does not favour more meaningful
features over those that are less meaningful, an effect one should perhaps
expect of the data pre-processing stage.
  In this paper we introduce a method to deal precisely with the problem above.
This is an iterative data pre-processing method capable of aiding to increase
the separation between clusters. It does so by calculating the within-cluster
degree of relevance of each feature, and then it uses these as a data rescaling
factor. By repeating this until convergence our malware data was separated in
clear clusters, leading to a higher average silhouette width.
","[{'version': 'v1', 'created': 'Fri, 31 Jul 2020 12:36:08 GMT'}]",2021-04-26,"[['de Amorim', 'Renato Cordeiro', ''], ['Ruiz', 'Carlos David Lopez', '']]","['feature rescaling', 'drive-by-download malware', 'clustering']"
10522,2009.09935,Christine Bauer,"Markus Schedl, Christine Bauer, Wolfgang Reisinger, Dominik Kowald,
  Elisabeth Lex","Listener Modeling and Context-aware Music Recommendation Based on
  Country Archetypes","30 pages, 3 tables, 12 figures",,10.3389/frai.2020.508725,,cs.IR cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Music preferences are strongly shaped by the cultural and socio-economic
background of the listener, which is reflected, to a considerable extent, in
country-specific music listening profiles. Previous work has already identified
several country-specific differences in the popularity distribution of music
artists listened to. In particular, what constitutes the ""music mainstream""
strongly varies between countries. To complement and extend these results, the
article at hand delivers the following major contributions: First, using
state-of-the-art unsupervised learning techniques, we identify and thoroughly
investigate (1) country profiles of music preferences on the fine-grained level
of music tracks (in contrast to earlier work that relied on music preferences
on the artist level) and (2) country archetypes that subsume countries sharing
similar patterns of listening preferences. Second, we formulate four user
models that leverage the user's country information on music preferences. Among
others, we propose a user modeling approach to describe a music listener as a
vector of similarities over the identified country clusters or archetypes.
Third, we propose a context-aware music recommendation system that leverages
implicit user feedback, where context is defined via the four user models. More
precisely, it is a multi-layer generative model based on a variational
autoencoder, in which contextual features can influence recommendations through
a gating mechanism. Fourth, we thoroughly evaluate the proposed recommendation
system and user models on a real-world corpus of more than one billion
listening records of users around the world (out of which we use 369 million in
our experiments) and show its merits vis-a-vis state-of-the-art algorithms that
do not exploit this type of context information.
","[{'version': 'v1', 'created': 'Fri, 11 Sep 2020 17:59:04 GMT'}]",2021-02-08,"[['Schedl', 'Markus', ''], ['Bauer', 'Christine', ''], ['Reisinger', 'Wolfgang', ''], ['Kowald', 'Dominik', ''], ['Lex', 'Elisabeth', '']]","['music', 'recommender system', 'culture', 'country', 'clustering', 'context', 'user modeling', 'music preferences']"
10523,1707.01888,Jonathan D. Gammell,Jonathan D. Gammell and Timothy D. Barfoot and Siddhartha S. Srinivasa,"Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime
  Search","International Journal of Robotics Research (IJRR). 32 Pages. 16
  Figures","The International Journal of Robotics Research (IJRR), 39(5):
  543-567, 2020",10.1177/0278364919890396,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Path planning in robotics often requires finding high-quality solutions to
continuously valued and/or high-dimensional problems. These problems are
challenging and most planning algorithms instead solve simplified
approximations. Popular approximations include graphs and random samples, as
respectively used by informed graph-based searches and anytime sampling-based
planners. Informed graph-based searches, such as A*, traditionally use
heuristics to search a priori graphs in order of potential solution quality.
This makes their search efficient but leaves their performance dependent on the
chosen approximation. If its resolution is too low then they may not find a
(suitable) solution but if it is too high then they may take a prohibitively
long time to do so. Anytime sampling-based planners, such as RRT*,
traditionally use random sampling to approximate the problem domain
incrementally. This allows them to increase resolution until a suitable
solution is found but makes their search dependent on the order of
approximation. Arbitrary sequences of random samples approximate the problem
domain in every direction simultaneously and but may be prohibitively
inefficient at containing a solution. This paper unifies and extends these two
approaches to develop Batch Informed Trees (BIT*), an informed, anytime
sampling-based planner. BIT* solves continuous path planning problems
efficiently by using sampling and heuristics to alternately approximate and
search the problem domain. Its search is ordered by potential solution quality,
as in A*, and its approximation improves indefinitely with additional
computational time, as in RRT*. It is shown analytically to be almost-surely
asymptotically optimal and experimentally to outperform existing sampling-based
planners, especially on high-dimensional planning problems.
","[{'version': 'v1', 'created': 'Thu, 6 Jul 2017 17:43:20 GMT'}, {'version': 'v2', 'created': 'Tue, 8 May 2018 22:05:17 GMT'}, {'version': 'v3', 'created': 'Fri, 23 Aug 2019 07:51:52 GMT'}, {'version': 'v4', 'created': 'Mon, 27 Jan 2020 20:11:16 GMT'}]",2020-04-20,"[['Gammell', 'Jonathan D.', ''], ['Barfoot', 'Timothy D.', ''], ['Srinivasa', 'Siddhartha S.', '']]","['path planning', 'sampling-based planning', 'optimal path planning', 'heuristic search', 'informed search']"
10524,1704.05782,Milan Hlad\'ik,Milan Hlad\'ik,"Positive Semidefiniteness and Positive Definiteness of a Linear
  Parametric Interval Matrix",,,10.1007/978-3-319-61753-4_11,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a symmetric matrix, the entries of which depend linearly on some
parameters. The domains of the parameters are compact real intervals. We
investigate the problem of checking whether for each (or some) setting of the
parameters, the matrix is positive definite (or positive semidefinite). We
state a characterization in the form of equivalent conditions, and also propose
some computationally cheap sufficient\,/\,necessary conditions. Our results
extend the classical results on positive (semi-)definiteness of interval
matrices. They may be useful for checking convexity or non-convexity in global
optimization methods based on branch and bound framework and using interval
techniques.
","[{'version': 'v1', 'created': 'Wed, 19 Apr 2017 15:42:23 GMT'}, {'version': 'v2', 'created': 'Thu, 31 Aug 2017 10:30:18 GMT'}]",2019-05-28,"[['Hladík', 'Milan', '']]","['Interval computation', 'interval matrix', 'parametric matrix', 'positive semidefiniteness', 'positive definiteness', 'global optimization']"
10525,2103.16670,Alexis Perakis,"Alexis Perakis, Ali Gorji, Samriddhi Jain, Krishna Chaitanya, Simone
  Rizza, Ender Konukoglu","Contrastive Learning of Single-Cell Phenotypic Representations for
  Treatment Classification","12 pages, 2 figures, 7 tables. This article is a pre-print and is
  currently under review at a conference","In: Lian C., Cao X., Rekik I., Xu X., Yan P. (eds) Machine
  Learning in Medical Imaging. MLMI 2021. Lecture Notes in Computer Science,
  vol 12966. Springer, Cham",10.1007/978-3-030-87589-3_58,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning robust representations to discriminate cell phenotypes based on
microscopy images is important for drug discovery. Drug development efforts
typically analyse thousands of cell images to screen for potential treatments.
Early works focus on creating hand-engineered features from these images or
learn such features with deep neural networks in a fully or weakly-supervised
framework. Both require prior knowledge or labelled datasets. Therefore,
subsequent works propose unsupervised approaches based on generative models to
learn these representations. Recently, representations learned with
self-supervised contrastive loss-based methods have yielded state-of-the-art
results on various imaging tasks compared to earlier unsupervised approaches.
In this work, we leverage a contrastive learning framework to learn appropriate
representations from single-cell fluorescent microscopy images for the task of
Mechanism-of-Action classification. The proposed work is evaluated on the
annotated BBBC021 dataset, and we obtain state-of-the-art results in NSC, NCSB
and drop metrics for an unsupervised approach. We observe an improvement of 10%
in NCSB accuracy and 11% in NSC-NSCB drop over the previously best unsupervised
method. Moreover, the performance of our unsupervised approach ties with the
best supervised approach. Additionally, we observe that our framework performs
well even without post-processing, unlike earlier methods. With this, we
conclude that one can learn robust cell representations with contrastive
learning.
","[{'version': 'v1', 'created': 'Tue, 30 Mar 2021 20:29:04 GMT'}]",2021-12-28,"[['Perakis', 'Alexis', ''], ['Gorji', 'Ali', ''], ['Jain', 'Samriddhi', ''], ['Chaitanya', 'Krishna', ''], ['Rizza', 'Simone', ''], ['Konukoglu', 'Ender', '']]","['Fluorescent microscopy', 'phenotypes', 'profiling', 'cell images', 'cell representations', 'unsupervised learning', 'contrastive learning']"
10526,1911.05188,Zheng Lian,"Zheng Lian, Ya Li, Jian-Hua Tao, Jian Huang, Ming-Yue Niu",Expression Analysis Based on Face Regions in Read-world Conditions,International Journal of Automation and Computing 2018,,10.1007/s11633-019-1176-9,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Facial emotion recognition is an essential and important aspect of the field
of human-machine interaction. Past research on facial emotion recognition
focuses on the laboratory environment. However, it faces many challenges in
real-world conditions, i.e., illumination changes, large pose variations and
partial or full occlusions. Those challenges lead to different face areas with
different degrees of sharpness and completeness. Inspired by this fact, we
focus on the authenticity of predictions generated by different <emotion,
region> pairs. For example, if only the mouth areas are available and the
emotion classifier predicts happiness, then there is a question of how to judge
the authenticity of predictions. This problem can be converted into the
contribution of different face areas to different emotions. In this paper, we
divide the whole face into six areas: nose areas, mouth areas, eyes areas, nose
to mouth areas, nose to eyes areas and mouth to eyes areas. To obtain more
convincing results, our experiments are conducted on three different databases:
facial expression recognition + ( FER+), real-world affective faces database
(RAF-DB) and expression in-the-wild (ExpW) dataset. Through analysis of the
classification accuracy, the confusion matrix and the class activation map
(CAM), we can establish convincing results. To sum up, the contributions of
this paper lie in two areas: 1) We visualize concerned areas of human faces in
emotion recognition; 2) We analyze the contribution of different face areas to
different emotions in real-world conditions through experimental analysis. Our
findings can be combined with findings in psychology to promote the
understanding of emotional expressions.
","[{'version': 'v1', 'created': 'Wed, 23 Oct 2019 16:04:21 GMT'}]",2019-11-14,"[['Lian', 'Zheng', ''], ['Li', 'Ya', ''], ['Tao', 'Jian-Hua', ''], ['Huang', 'Jian', ''], ['Niu', 'Ming-Yue', '']]","['facial emotion analysis', 'face areas', 'class activation map', 'confusion matrix', 'concerned area']"
10527,2103.04812,Georgios Zervakis,"Sami Salamin, Georgios Zervakis, Ourania Spantidi, Iraklis
  Anagnostopoulos, J\""org Henkel, Hussam Amrouch",Reliability-Aware Quantization for Anti-Aging NPUs,"Accepted for publication at the 24th Design Automation and Test in
  Europe Conference (DATE) 2021",,10.23919/DATE51398.2021.9474094,,cs.AR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transistor aging is one of the major concerns that challenges designers in
advanced technologies. It profoundly degrades the reliability of circuits
during its lifetime as it slows down transistors resulting in errors due to
timing violations unless large guardbands are included, which leads to
considerable performance losses. When it comes to Neural Processing Units
(NPUs), where increasing the inference speed is the primary goal, such
performance losses cannot be tolerated. In this work, we are the first to
propose a reliability-aware quantization to eliminate aging effects in NPUs
while completely removing guardbands. Our technique delivers a graceful
inference accuracy degradation over time while compensating for the
aging-induced delay increase of the NPU. Our evaluation, over ten
state-of-the-art neural network architectures trained on the ImageNet dataset,
demonstrates that for an entire lifetime of 10 years, the average accuracy loss
is merely 3%. In the meantime, our technique achieves 23% higher performance
due to the elimination of the aging guardband.
","[{'version': 'v1', 'created': 'Mon, 8 Mar 2021 15:13:02 GMT'}]",2022-03-16,"[['Salamin', 'Sami', ''], ['Zervakis', 'Georgios', ''], ['Spantidi', 'Ourania', ''], ['Anagnostopoulos', 'Iraklis', ''], ['Henkel', 'Jörg', ''], ['Amrouch', 'Hussam', '']]","['Approximate Computing', 'Adaptive Approximation', 'Aging', 'Neural Networks', 'Quantization', 'Reliability']"
10528,2107.08908,Tarik A. Rashid,"Aram Ahmed, Tarik A. Rashid and Soran Saeed",Dynamic Cat Swarm Optimization Algorithm for Backboard Wiring Problem,22 pages,"Neural Computing and Applications, 2021",10.1007/s00521-021-06041-3,,cs.NE cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper presents a powerful swarm intelligence meta-heuristic optimization
algorithm called Dynamic Cat Swarm Optimization. The formulation is through
modifying the existing Cat Swarm Optimization. The original Cat Swarm
Optimization suffers from the shortcoming of 'premature convergence', which is
the possibility of entrapment in local optima which usually happens due to the
off-balance between exploration and exploitation phases. Therefore, the
proposed algorithm suggests a new method to provide a proper balance between
these phases by modifying the selection scheme and the seeking mode of the
algorithm. To evaluate the performance of the proposed algorithm, 23 classical
test functions, 10 modern test functions (CEC 2019) and a real world scenario
are used. In addition, the Dimension-wise diversity metric is used to measure
the percentage of the exploration and exploitation phases. The optimization
results show the effectiveness of the proposed algorithm, which ranks first
compared to several well-known algorithms available in the literature.
Furthermore, statistical methods and graphs are also used to further confirm
the outperformance of the algorithm. Finally, the conclusion as well as future
directions to further improve the algorithm are discussed.
","[{'version': 'v1', 'created': 'Tue, 27 Apr 2021 19:41:27 GMT'}]",2021-07-20,"[['Ahmed', 'Aram', ''], ['Rashid', 'Tarik A.', ''], ['Saeed', 'Soran', '']]","['Dynamic Cat Swarm Optimization', 'Cat Swarm Optimization', 'Exploration and exploitation phases', 'Metaheuristics', 'Optimization']"
10529,2212.09031,Tao Yang,"Tao Yang, Zhichao Xu, Zhenduo Wang, Anh Tran, Qingyao Ai",Marginal-Certainty-aware Fair Ranking Algorithm,"10 pages, 5 figures",,10.1145/3539597.3570474,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Ranking systems are ubiquitous in modern Internet services, including online
marketplaces, social media, and search engines. Traditionally, ranking systems
only focus on how to get better relevance estimation. When relevance estimation
is available, they usually adopt a user-centric optimization strategy where
ranked lists are generated by sorting items according to their estimated
relevance. However, such user-centric optimization ignores the fact that item
providers also draw utility from ranking systems. It has been shown in existing
research that such user-centric optimization will cause much unfairness to item
providers, followed by unfair opportunities and unfair economic gains for item
providers.
  To address ranking fairness, many fair ranking methods have been proposed.
However, as we show in this paper, these methods could be suboptimal as they
directly rely on the relevance estimation without being aware of the
uncertainty (i.e., the variance of the estimated relevance). To address this
uncertainty, we propose a novel Marginal-Certainty-aware Fair algorithm named
MCFair. MCFair jointly optimizes fairness and user utility, while relevance
estimation is constantly updated in an online manner.
  In MCFair, we first develop a ranking objective that includes uncertainty,
fairness, and user utility. Then we directly use the gradient of the ranking
objective as the ranking score. We theoretically prove that MCFair based on
gradients is optimal for the aforementioned ranking objective. Empirically, we
find that on semi-synthesized datasets, MCFair is effective and practical and
can deliver superior performance compared to state-of-the-art fair ranking
methods. To facilitate reproducibility, we release our code
https://github.com/Taosheng-ty/WSDM22-MCFair.
","[{'version': 'v1', 'created': 'Sun, 18 Dec 2022 07:44:33 GMT'}]",2022-12-20,"[['Yang', 'Tao', ''], ['Xu', 'Zhichao', ''], ['Wang', 'Zhenduo', ''], ['Tran', 'Anh', ''], ['Ai', 'Qingyao', '']]","['Fair Ranking', 'Position Bias', 'Exposure', 'Amortized Fairness']"
10530,2203.09056,Chixiang Ma,"Chixiang Ma, Weihong Lin, Lei Sun, Qiang Huo","Robust Table Detection and Structure Recognition from Heterogeneous
  Document Images",Accepted by Pattern Recognition on 27 Aug. 2022,,10.1016/j.patcog.2022.109006,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a new table detection and structure recognition approach named
RobusTabNet to detect the boundaries of tables and reconstruct the cellular
structure of each table from heterogeneous document images. For table
detection, we propose to use CornerNet as a new region proposal network to
generate higher quality table proposals for Faster R-CNN, which has
significantly improved the localization accuracy of Faster R-CNN for table
detection. Consequently, our table detection approach achieves state-of-the-art
performance on three public table detection benchmarks, namely cTDaR TrackA,
PubLayNet and IIIT-AR-13K, by only using a lightweight ResNet-18 backbone
network. Furthermore, we propose a new split-and-merge based table structure
recognition approach, in which a novel spatial CNN based separation line
prediction module is proposed to split each detected table into a grid of
cells, and a Grid CNN based cell merging module is applied to recover the
spanning cells. As the spatial CNN module can effectively propagate contextual
information across the whole table image, our table structure recognizer can
robustly recognize tables with large blank spaces and geometrically distorted
(even curved) tables. Thanks to these two techniques, our table structure
recognition approach achieves state-of-the-art performance on three public
benchmarks, including SciTSR, PubTabNet and cTDaR TrackB2-Modern. Moreover, we
have further demonstrated the advantages of our approach in recognizing tables
with complex structures, large blank spaces, as well as geometrically distorted
or even curved shapes on a more challenging in-house dataset.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2022 03:35:12 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Sep 2022 06:11:50 GMT'}]",2022-09-19,"[['Ma', 'Chixiang', ''], ['Lin', 'Weihong', ''], ['Sun', 'Lei', ''], ['Huo', 'Qiang', '']]","['Table detection', 'Table structure recognition', 'Corner detection', 'Spatial CNN', 'Grid CNN', 'Split-and-merge']"
10531,1907.04713,Riccardo Aragona,"Riccardo Aragona, Francesca Marzi, Filippo Mignosi, Matteo Spezialetti","Entropy and Compression: A simple proof of an inequality of
  Khinchin-Ornstein-Shields","Compared to version 1, in version 2 we added a simpler proof than the
  one given by Shields of a more general theorem (Theorem 4, pg. 7) presented
  by Ornstein and Shields. Consequently we also modified the title of the
  paper. In version 3 we have reordered the sections of the paper, simplified
  the proof of Theorem 4 (now Theorem 3) and significantly reduced the proof of
  Theorem 3 (now Theorem 4)","Problems of Information Transmission, Vo.l 56 No. 1, 2020. A
  view-only published version here: https://rdcu.be/b3Cco",10.1134/S0032946020010020,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper concerns the folklore statement that ``entropy is a lower bound
for compression''. More precisely we derive from the entropy theorem a simple
proof of a pointwise inequality firstly stated by Ornstein and Shields and
which is the almost-sure version of an average inequality firstly stated by
Khinchin in 1953. We further give an elementary proof of original Khinchin
inequality that can be used as an exercise for Information Theory students and
we conclude by giving historical and technical notes of such inequality.
","[{'version': 'v1', 'created': 'Wed, 10 Jul 2019 13:34:13 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Jul 2019 08:48:00 GMT'}, {'version': 'v3', 'created': 'Thu, 29 Aug 2019 15:13:17 GMT'}, {'version': 'v4', 'created': 'Wed, 22 Apr 2020 16:28:47 GMT'}]",2022-05-25,"[['Aragona', 'Riccardo', ''], ['Marzi', 'Francesca', ''], ['Mignosi', 'Filippo', ''], ['Spezialetti', 'Matteo', '']]","['Ergodic sources', 'Entropy', 'Lossless Data Compression', 'One-to-One CodeSequence', 'Shannon-McMillan Theorem']"
10532,2206.12858,Alexey Vasilev,"Yan-Martin Tamm, Rinchin Damdinov, Alexey Vasilev","Quality Metrics in Recommender Systems: Do We Calculate Metrics
  Consistently?",,,10.1145/3460231.3478848,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Offline evaluation is a popular approach to determine the best algorithm in
terms of the chosen quality metric. However, if the chosen metric calculates
something unexpected, this miscommunication can lead to poor decisions and
wrong conclusions. In this paper, we thoroughly investigate quality metrics
used for recommender systems evaluation. We look at the practical aspect of
implementations found in modern RecSys libraries and at the theoretical aspect
of definitions in academic papers. We find that Precision is the only metric
universally understood among papers and libraries, while other metrics may have
different interpretations. Metrics implemented in different libraries sometimes
have the same name but measure different things, which leads to different
results given the same input. When defining metrics in an academic paper,
authors sometimes omit explicit formulations or give references that do not
contain explanations either. In 47% of cases, we cannot easily know how the
metric is defined because the definition is not clear or absent. These findings
highlight yet another difficulty in recommender system evaluation and call for
a more detailed description of evaluation protocols.
","[{'version': 'v1', 'created': 'Sun, 26 Jun 2022 12:28:18 GMT'}]",2022-06-28,"[['Tamm', 'Yan-Martin', ''], ['Damdinov', 'Rinchin', ''], ['Vasilev', 'Alexey', '']]","['recommender systems', 'metrics', 'offline evaluation']"
10533,2007.10433,Benjamin Wassermann,"Benjamin Wassermann, Nina Korshunova, Stefan Kollmannsberger, Ernst
  Rank and Gershon Elber","Finite Cell Method for functionally graded materials based on V-models
  and homogenized microstructures","Preprint submitted to Advanced Modeling and Simulation in Engineering
  Sciences",,10.1186/s40323-020-00182-1,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  This paper proposes an extension of the finite cell method (FCM) to V-rep
models, a novel geometric framework for volumetric representations. This
combination of an embedded domain approach (FCM) and a new modeling framework
(V-rep) forms the basis for an efficient and accurate simulation of mechanical
artifacts, which are not only characterized by complex shapes but also by their
non-standard interior structure. These objects gain more and more interest in
the context of the new design opportunities opened by additive manufacturing,
mainly when graded or micro-structured material is applied. Two different types
of functionally graded materials (FGM) are considered: The first one,
multi-material FGM, is described using the V-rep models' inherent property to
assign different properties throughout the interior of a domain. The second,
single-material FGM -- which is heterogeneously micro-structured --
characterizes the effective material behavior of representative volume elements
by homogenization and performs large-scale simulations using the embedded
domain approach.
","[{'version': 'v1', 'created': 'Mon, 20 Jul 2020 19:46:56 GMT'}]",2020-12-04,"[['Wassermann', 'Benjamin', ''], ['Korshunova', 'Nina', ''], ['Kollmannsberger', 'Stefan', ''], ['Rank', 'Ernst', ''], ['Elber', 'Gershon', '']]","['Functionally Graded Material', 'V-Reps', 'V-Models', 'Finite Cell Method', 'Direct Simulation', 'AdditiveManufacturing', 'Homogenization']"
10534,2006.12166,Rens van de Schoot,"Rens van de Schoot, Jonathan de Bruin, Raoul Schram, Parisa Zahedi,
  Jan de Boer, Felix Weijdema, Bianca Kramer, Martijn Huijts, Maarten
  Hoogerwerf, Gerbrich Ferdinands, Albert Harkema, Joukje Willemsen, Yongchao
  Ma, Qixiang Fang, Sybren Hindriks, Lars Tummers, Daniel Oberski",Open Source Software for Efficient and Transparent Reviews,"All code for the software ASReview is available under an Apache-2.0
  license at Github: https://github.com/asreview",,10.1038/s42256-020-00287-7,,cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  To help researchers conduct a systematic review or meta-analysis as
efficiently and transparently as possible, we designed a tool (ASReview) to
accelerate the step of screening titles and abstracts. For many tasks -
including but not limited to systematic reviews and meta-analyses - the
scientific literature needs to be checked systematically. Currently, scholars
and practitioners screen thousands of studies by hand to determine which
studies to include in their review or meta-analysis. This is error prone and
inefficient because of extremely imbalanced data: only a fraction of the
screened studies is relevant. The future of systematic reviewing will be an
interaction with machine learning algorithms to deal with the enormous increase
of available text. We therefore developed an open source machine learning-aided
pipeline applying active learning: ASReview. We demonstrate by means of
simulation studies that ASReview can yield far more efficient reviewing than
manual reviewing, while providing high quality. Furthermore, we describe the
options of the free and open source research software and present the results
from user experience tests. We invite the community to contribute to open
source projects such as our own that provide measurable and reproducible
improvements over current practice.
","[{'version': 'v1', 'created': 'Mon, 22 Jun 2020 11:57:10 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Oct 2020 07:00:47 GMT'}, {'version': 'v3', 'created': 'Fri, 4 Dec 2020 08:25:18 GMT'}]",2021-06-07,"[['van de Schoot', 'Rens', ''], ['de Bruin', 'Jonathan', ''], ['Schram', 'Raoul', ''], ['Zahedi', 'Parisa', ''], ['de Boer', 'Jan', ''], ['Weijdema', 'Felix', ''], ['Kramer', 'Bianca', ''], ['Huijts', 'Martijn', ''], ['Hoogerwerf', 'Maarten', ''], ['Ferdinands', 'Gerbrich', ''], ['Harkema', 'Albert', ''], ['Willemsen', 'Joukje', ''], ['Ma', 'Yongchao', ''], ['Fang', 'Qixiang', ''], ['Hindriks', 'Sybren', ''], ['Tummers', 'Lars', ''], ['Oberski', 'Daniel', '']]","['Active Learning', 'Machine Learning', 'Researcher-in-the-loop', 'Open Science', 'Systematic']"
10535,2211.05934,Parvathy Sobha,Parvathy Sobha,Decarbonizing Indian Electricity Grid,,"Innovations in Electrical and Electronic Engineering. ICEEE 2022.
  Lecture Notes in Electrical Engineering, vol 893. Springer, Singapore (2022)",10.1007/978-981-19-1742-4_26,,cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  India, being one of the fastest growing economies of the world, must take a
sustainable path for development. India is responsible for 7 percent of global
CO2 emissions. The electricity sector accounts for nearly 35 percent of
emissions from the country. The switch from fossil fuels to renewable sources
is the key in decarbonizing this sector and is considered as the crucial step
for climate mitigation. This research investigates the potential of renewable
energy sources; wind, solar and hydro. The optimization model developed in this
study analyzes various scenarios for the transition to a sustainable future.
The results show that India aims to achieve 450 GW of installed capacity from
RES is far from a Net Zero future. Results confirm that India has the potential
to meet 100 percent of electricity demand in 2030 from RES including wind,
solar and hydro. Introducing Social Cost of Carbon is a viable option to reduce
emissions in India. However, due to the low cost of coal, high coal taxes do
not lead to reduced emissions.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2022 16:51:50 GMT'}]",2022-11-14,"[['Sobha', 'Parvathy', '']]","['Optimization Model', 'Renewable Integration', 'Scenario Analysis', 'Energy Transition', 'Energy Mix']"
10536,2207.02506,Evangelos Bitsikas,"Evangelos Bitsikas and Christina P\""opper",You have been warned: Abusing 5G's Warning and Emergency Systems,,,10.1145/3564625.3568000,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Public Warning System (PWS) is an essential part of cellular networks and
a country's civil protection. Warnings can notify users of hazardous events
(e.g., floods, earthquakes) and crucial national matters that require immediate
attention. PWS attacks disseminating fake warnings or concealing precarious
events can have a serious impact, causing fraud, panic, physical harm, or
unrest to users within an affected area. In this work, we conduct the first
comprehensive investigation of PWS security in 5G networks. We demonstrate five
practical attacks that may impact the security of 5G-based Commercial Mobile
Alert System (CMAS) as well as Earthquake and Tsunami Warning System (ETWS)
alerts. Additional to identifying the vulnerabilities, we investigate two PWS
spoofing and three PWS suppression attacks, with or without a man-in-the-middle
(MitM) attacker. We discover that MitM-based attacks have more severe impact
than their non-MitM counterparts. Our PWS barring attack is an effective
technique to eliminate legitimate warning messages. We perform a rigorous
analysis of the roaming aspect of the PWS, incl. its potentially secure
version, and report the implications of our attacks on other emergency features
(e.g., 911 SIP calls). We discuss possible countermeasures and note that
eradicating the attacks necessitates a scrupulous reevaluation of the PWS
design and a secure implementation.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2022 08:15:12 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Oct 2022 14:29:19 GMT'}]",2022-10-31,"[['Bitsikas', 'Evangelos', ''], ['Pöpper', 'Christina', '']]","['5G', 'Public Warning System', 'spoofing', 'suppression', 'MitM attacks']"
10537,2101.10539,Mohammed Mustafa Abdelgwad,"Mohammed M.Abdelgwad, Taysir Hassan A Soliman, Ahmed I.Taloba, Mohamed
  Fawzy Farghaly","Arabic aspect based sentiment analysis using bidirectional GRU based
  models",,"Journal of King Saud University - Computer and Information
  Sciences (2021)",10.1016/j.jksuci.2021.08.030,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aspect-based Sentiment analysis (ABSA) accomplishes a fine-grained analysis
that defines the aspects of a given document or sentence and the sentiments
conveyed regarding each aspect. This level of analysis is the most detailed
version that is capable of exploring the nuanced viewpoints of the reviews. The
bulk of study in ABSA focuses on English with very little work available in
Arabic. Most previous work in Arabic has been based on regular methods of
machine learning that mainly depends on a group of rare resources and tools for
analyzing and processing Arabic content such as lexicons, but the lack of those
resources presents another challenge. In order to address these challenges,
Deep Learning (DL)-based methods are proposed using two models based on Gated
Recurrent Units (GRU) neural networks for ABSA. The first is a DL model that
takes advantage of word and character representations by combining
bidirectional GRU, Convolutional Neural Network (CNN), and Conditional Random
Field (CRF) making up the (BGRU-CNN-CRF) model to extract the main opinionated
aspects (OTE). The second is an interactive attention network based on
bidirectional GRU (IAN-BGRU) to identify sentiment polarity toward extracted
aspects. We evaluated our models using the benchmarked Arabic hotel reviews
dataset. The results indicate that the proposed methods are better than
baseline research on both tasks having 39.7% enhancement in F1-score for
opinion target extraction (T2) and 7.58% in accuracy for aspect-based sentiment
polarity classification (T3). Achieving F1 score of 70.67% for T2, and accuracy
of 83.98% for T3.
","[{'version': 'v1', 'created': 'Sat, 23 Jan 2021 02:54:30 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Feb 2021 05:01:16 GMT'}, {'version': 'v3', 'created': 'Sun, 7 Mar 2021 10:32:15 GMT'}, {'version': 'v4', 'created': 'Wed, 6 Oct 2021 23:31:30 GMT'}]",2021-10-08,"[['Abdelgwad', 'Mohammed M.', ''], ['Soliman', 'Taysir Hassan A', ''], ['Taloba', 'Ahmed I.', ''], ['Farghaly', 'Mohamed Fawzy', '']]","['Aspect-based sentiment analysis (ABSA)', 'deep learning', 'opinion target extraction (OTE)', 'aspect sentiment polarity classification', 'BGRU-CNN-CRF and IAN-BGRU']"
10538,2006.01508,Cyrus Mostajeran Dr,"Graham W. Van Goffrier, Cyrus Mostajeran, Rodolphe Sepulchre",Inductive Geometric Matrix Midranges,,,10.1016/j.ifacol.2021.06.120,,cs.LG math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Covariance data as represented by symmetric positive definite (SPD) matrices
are ubiquitous throughout technical study as efficient descriptors of
interdependent systems. Euclidean analysis of SPD matrices, while
computationally fast, can lead to skewed and even unphysical interpretations of
data. Riemannian methods preserve the geometric structure of SPD data at the
cost of expensive eigenvalue computations. In this paper, we propose a
geometric method for unsupervised clustering of SPD data based on the Thompson
metric. This technique relies upon a novel ""inductive midrange"" centroid
computation for SPD data, whose properties are examined and numerically
confirmed. We demonstrate the incorporation of the Thompson metric and
inductive midrange into X-means and K-means++ clustering algorithms.
","[{'version': 'v1', 'created': 'Tue, 2 Jun 2020 10:18:31 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Apr 2021 21:23:36 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Jul 2021 01:31:31 GMT'}]",2021-07-22,"[['Van Goffrier', 'Graham W.', ''], ['Mostajeran', 'Cyrus', ''], ['Sepulchre', 'Rodolphe', '']]","['Classification', 'Clustering', 'Covariance Matrices', 'Differential Geometry', 'IterativeMethods']"
10539,2208.06646,Xiaoliang Lei,"Xiaoliang Lei, Hao Mei, Bin Shi, Hua Wei",Modeling Network-level Traffic Flow Transitions on Sparse Data,9 pages + 3 pages appendix. Accepted by SIGKDD 2022,,10.1145/3534678.3539236,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Modeling how network-level traffic flow changes in the urban environment is
useful for decision-making in transportation, public safety and urban planning.
The traffic flow system can be viewed as a dynamic process that transits
between states (e.g., traffic volumes on each road segment) over time. In the
real-world traffic system with traffic operation actions like traffic signal
control or reversible lane changing, the system's state is influenced by both
the historical states and the actions of traffic operations. In this paper, we
consider the problem of modeling network-level traffic flow under a real-world
setting, where the available data is sparse (i.e., only part of the traffic
system is observed). We present DTIGNN, an approach that can predict
network-level traffic flows from sparse data. DTIGNN models the traffic system
as a dynamic graph influenced by traffic signals, learns the transition models
grounded by fundamental transition equations from transportation, and predicts
future traffic states with imputation in the process. Through comprehensive
experiments, we demonstrate that our method outperforms state-of-the-art
methods and can better support decision-making in transportation.
","[{'version': 'v1', 'created': 'Sat, 13 Aug 2022 13:30:35 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Nov 2022 11:26:38 GMT'}]",2022-11-22,"[['Lei', 'Xiaoliang', ''], ['Mei', 'Hao', ''], ['Shi', 'Bin', ''], ['Wei', 'Hua', '']]","['Traffic state modeling', 'traffic flow prediction', 'urban computing']"
10540,1905.09816,Jim Basney,"Alex Withers (NCSA), Brian Bockelman (Morgridge Institute for
  Research), Derek Weitzel (University of Nebraska-Lincoln), Duncan Brown
  (Syracuse University), Jason Patton (University of Wisconsin-Madison), Jeff
  Gaynor (NCSA), Jim Basney (NCSA), Todd Tannenbaum (University of
  Wisconsin-Madison), You Alex Gao (University of Illinois), Zach Miller
  (University of Wisconsin-Madison)","SciTokens: Demonstrating Capability-Based Access to Remote Scientific
  Data using HTCondor","8 pages, 3 figures, PEARC '19: Practice and Experience in Advanced
  Research Computing, July 28-August 1, 2019, Chicago, IL, USA. arXiv admin
  note: substantial text overlap with arXiv:1807.04728",,10.1145/3332186.3333258,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The management of security credentials (e.g., passwords, secret keys) for
computational science workflows is a burden for scientists and information
security officers. Problems with credentials (e.g., expiration, privilege
mismatch) cause workflows to fail to fetch needed input data or store valuable
scientific results, distracting scientists from their research by requiring
them to diagnose the problems, re-run their computations, and wait longer for
their results. SciTokens introduces a capabilities-based authorization
infrastructure for distributed scientific computing, to help scientists manage
their security credentials more reliably and securely. SciTokens uses
IETF-standard OAuth JSON Web Tokens for capability-based secure access to
remote scientific data. These access tokens convey the specific authorizations
needed by the workflows, rather than general-purpose authentication
impersonation credentials, to address the risks of scientific workflows running
on distributed infrastructure including NSF resources (e.g., LIGO Data Grid,
Open Science Grid, XSEDE) and public clouds (e.g., Amazon Web Services, Google
Cloud, Microsoft Azure). By improving the interoperability and security of
scientific workflows, SciTokens 1) enables use of distributed computing for
scientific domains that require greater data protection and 2) enables use of
more widely distributed computing resources by reducing the risk of credential
abuse on remote systems.
  In this extended abstract, we present the results over the past year of our
open source implementation of the SciTokens model and its deployment in the
Open Science Grid, including new OAuth support added in the HTCondor 8.8
release series.
","[{'version': 'v1', 'created': 'Wed, 22 May 2019 18:55:11 GMT'}]",2019-05-27,"[['Withers', 'Alex', '', 'NCSA'], ['Bockelman', 'Brian', '', 'Morgridge Institute for\n  Research'], ['Weitzel', 'Derek', '', 'University of Nebraska-Lincoln'], ['Brown', 'Duncan', '', 'Syracuse University'], ['Patton', 'Jason', '', 'University of Wisconsin-Madison'], ['Gaynor', 'Jeff', '', 'NCSA'], ['Basney', 'Jim', '', 'NCSA'], ['Tannenbaum', 'Todd', '', 'University of\n  Wisconsin-Madison'], ['Gao', 'You Alex', '', 'University of Illinois'], ['Miller', 'Zach', '', 'University of Wisconsin-Madison']]","['OAuth', 'capabilities', 'distributed computing']"
10541,2109.05373,Olivier Lampron,"O. Lampron, D. Therriault, M. L\'evesque","An efficient and robust monolithic approach to phase-field quasi-static
  brittle fracture using a modified Newton method","Accepted manuscript: Added references, added Armijo algorithm, more
  details on modified Newton algorithm, added mesh sensitivity analysis,
  comparison with original extrapolated scheme in Annex","Comput Methods Appl Mech Eng, 386, 114091 (2021)",10.1016/j.cma.2021.114091,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Variational phase-field methods have been shown powerful for the modeling of
complex crack propagation without a priori knowledge of the crack path or ad
hoc criteria. However, phase-field models suffer from their energy functional
being non-linear and non-convex, while requiring a very fine mesh to capture
the damage gradient. This implies a high computational cost, limiting concrete
engineering applications of the method. In this work, we propose an efficient
and robust fully monolithic solver for phase-field fracture using a modified
Newton method with inertia correction and an energy line-search. To illustrate
the gains in efficiency obtained with our approach, we compare it to two
popular methods for phase-field fracture, namely the alternating minimization
and the quasi-monolithic schemes. To facilitate the evaluation of the time step
dependent quasi-monolithic scheme, we couple the latter with an extrapolation
correction loop controlled by a damage-based criteria. Finally, we show through
four benchmark tests that the modified Newton method we propose is
straightforward, robust, and leads to identical solutions, while offering a
reduction in computation time by factors of up to 12 and 6 when compared to the
alternating minimization and quasi-monolithic schemes.
","[{'version': 'v1', 'created': 'Sat, 11 Sep 2021 21:13:54 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Sep 2021 16:39:40 GMT'}]",2021-09-15,"[['Lampron', 'O.', ''], ['Therriault', 'D.', ''], ['Lévesque', 'M.', '']]","['Phase-field', 'Fracture', 'Staggered Solver', 'Modified Newton method', 'Monolithic solver', 'Benchmarking']"
10542,2007.03363,Francisco Cruz,"Ithan Moreira, Javier Rivas, Francisco Cruz, Richard Dazeley, Angel
  Ayala, Bruno Fernandes","Deep Reinforcement Learning with Interactive Feedback in a Human-Robot
  Environment",In press journal Applied Sciences,,10.3390/app10165574,,cs.AI cs.MA cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robots are extending their presence in domestic environments every day, being
more common to see them carrying out tasks in home scenarios. In the future,
robots are expected to increasingly perform more complex tasks and, therefore,
be able to acquire experience from different sources as quickly as possible. A
plausible approach to address this issue is interactive feedback, where a
trainer advises a learner on which actions should be taken from specific states
to speed up the learning process. Moreover, deep reinforcement learning has
been recently widely utilized in robotics to learn the environment and acquire
new skills autonomously. However, an open issue when using deep reinforcement
learning is the excessive time needed to learn a task from raw input images. In
this work, we propose a deep reinforcement learning approach with interactive
feedback to learn a domestic task in a human-robot scenario. We compare three
different learning methods using a simulated robotic arm for the task of
organizing different objects; the proposed methods are (i) deep reinforcement
learning (DeepRL); (ii) interactive deep reinforcement learning using a
previously trained artificial agent as an advisor (agent-IDeepRL); and (iii)
interactive deep reinforcement learning using a human advisor (human-IDeepRL).
We demonstrate that interactive approaches provide advantages for the learning
process. The obtained results show that a learner agent, using either
agent-IDeepRL or human-IDeepRL, completes the given task earlier and has fewer
mistakes compared to the autonomous DeepRL approach.
","[{'version': 'v1', 'created': 'Tue, 7 Jul 2020 11:55:27 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Aug 2020 11:04:58 GMT'}]",2020-09-22,"[['Moreira', 'Ithan', ''], ['Rivas', 'Javier', ''], ['Cruz', 'Francisco', ''], ['Dazeley', 'Richard', ''], ['Ayala', 'Angel', ''], ['Fernandes', 'Bruno', '']]","['Robotics', 'interactive deep reinforcement learning', 'deep reinforcement learning', 'domestic scenario']"
10543,2205.01004,Igor Sfiligoi,"Igor Sfiligoi, Thomas DeFanti and Frank W\""urthwein",Auto-scaling HTCondor pools using Kubernetes compute resources,"6 pages, 3 figures, to be published in proceedings of PEARC22","PEARC '22: Practice and Experience in Advanced Research Computing
  (2022) 57 1-4",10.1145/3491418.3535123,,cs.DC,http://creativecommons.org/licenses/by-sa/4.0/,"  HTCondor has been very successful in managing globally distributed,
pleasantly parallel scientific workloads, especially as part of the Open
Science Grid. HTCondor system design makes it ideal for integrating compute
resources provisioned from anywhere, but it has very limited native support for
autonomously provisioning resources managed by other solutions. This work
presents a solution that allows for autonomous, demand-driven provisioning of
Kubernetes-managed resources. A high-level overview of the employed
architectures is presented, paired with the description of the setups used in
both on-prem and Cloud deployments in support of several Open Science Grid
communities. The experience suggests that the described solution should be
generally suitable for contributing Kubernetes-based resources to existing
HTCondor pools.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 16:05:27 GMT'}]",2022-07-11,"[['Sfiligoi', 'Igor', ''], ['DeFanti', 'Thomas', ''], ['Würthwein', 'Frank', '']]","['provisioning', 'auto scaling', 'HTCondor', 'Kubernetes']"
10544,1908.06475,John Klein,"Mahmoud Albardan, John Klein and Olivier Colot","SPOCC: Scalable POssibilistic Classifier Combination -- toward robust
  aggregation of classifiers",,,10.1016/j.eswa.2020.113332,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate a problem in which each member of a group of learners is
trained separately to solve the same classification task. Each learner has
access to a training dataset (possibly with overlap across learners) but each
trained classifier can be evaluated on a validation dataset. We propose a new
approach to aggregate the learner predictions in the possibility theory
framework. For each classifier prediction, we build a possibility distribution
assessing how likely the classifier prediction is correct using frequentist
probabilities estimated on the validation set. The possibility distributions
are aggregated using an adaptive t-norm that can accommodate dependency and
poor accuracy of the classifier predictions. We prove that the proposed
approach possesses a number of desirable classifier combination robustness
properties.
","[{'version': 'v1', 'created': 'Sun, 18 Aug 2019 16:48:37 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Feb 2020 22:19:29 GMT'}]",2020-03-03,"[['Albardan', 'Mahmoud', ''], ['Klein', 'John', ''], ['Colot', 'Olivier', '']]","['robust classifier combination', 'agnostic aggregation', 'information fusion', 'classification', 'possibility theory']"
10545,2101.03225,Patrick Sol\'e,"Alexis Bonnecaze, Patrick Sol\'e",The extended binary quadratic residue code of length 42 holds a 3-design,6 pages. Second version,"Journal of Combinatorial Designs, (2021)",10.1002/jcd.21782,,cs.IT math.CO math.IT,http://creativecommons.org/licenses/by/4.0/,"  The codewords of weight $10$ of the $[42,21,10]$ extended binary quadratic
residue code are shown to hold a design of parameters $3-(42,10,18).$ Its
automorphism group is isomorphic to $PSL(2,41)$. Its existence can be explained
neither by a transitivity argument, nor by the Assmus-Mattson theorem.
","[{'version': 'v1', 'created': 'Fri, 8 Jan 2021 21:21:27 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Jan 2021 16:38:15 GMT'}, {'version': 'v3', 'created': 'Thu, 6 May 2021 09:52:03 GMT'}]",2021-05-07,"[['Bonnecaze', 'Alexis', ''], ['Solé', 'Patrick', '']]","['designs', 'quadratic residue codes', 'Assmus-Mattson theorem']"
10546,1904.08562,Jonathan Sterling,"Jonathan Sterling, Carlo Angiuli, Daniel Gratzer",Cubical Syntax for Reflection-Free Extensional Equality,"Extended version; International Conference on Formal Structures for
  Computation and Deduction (FSCD), 2019",,10.4230/LIPIcs.FSCD.2019.31,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We contribute XTT, a cubical reconstruction of Observational Type Theory
which extends Martin-L\""of's intensional type theory with a dependent equality
type that enjoys function extensionality and a judgmental version of the
unicity of identity types principle (UIP): any two elements of the same
equality type are judgmentally equal. Moreover, we conjecture that the typing
relation can be decided in a practical way. In this paper, we establish an
algebraic canonicity theorem using a novel cubical extension (independently
proposed by Awodey) of the logical families or categorical gluing argument
inspired by Coquand and Shulman: every closed element of boolean type is
derivably equal to either 'true' or 'false'.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2019 01:52:13 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Jun 2019 19:43:41 GMT'}]",2021-04-20,"[['Sterling', 'Jonathan', ''], ['Angiuli', 'Carlo', ''], ['Gratzer', 'Daniel', '']]","['Dependent type theory', 'extensional equality', 'cubical type theory', 'categoricalgluing', 'canonicity']"
10547,2209.09578,"Philipp M\""uller","Philipp M\""uller, Michael Dietz, Dominik Schiller, Dominike Thomas,
  Hali Lindsay, Patrick Gebhard, Elisabeth Andr\'e, Andreas Bulling","MultiMediate '22: Backchannel Detection and Agreement Estimation in
  Group Interactions",ACM Multimedia 2022,,10.1145/3503161.3551589,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Backchannels, i.e. short interjections of the listener, serve important
meta-conversational purposes like signifying attention or indicating agreement.
Despite their key role, automatic analysis of backchannels in group
interactions has been largely neglected so far. The MultiMediate challenge
addresses, for the first time, the tasks of backchannel detection and agreement
estimation from backchannels in group conversations. This paper describes the
MultiMediate challenge and presents a novel set of annotations consisting of
7234 backchannel instances for the MPIIGroupInteraction dataset. Each
backchannel was additionally annotated with the extent by which it expresses
agreement towards the current speaker. In addition to a an analysis of the
collected annotations, we present baseline results for both challenge tasks.
","[{'version': 'v1', 'created': 'Tue, 20 Sep 2022 09:49:47 GMT'}]",2022-09-21,"[['Müller', 'Philipp', ''], ['Dietz', 'Michael', ''], ['Schiller', 'Dominik', ''], ['Thomas', 'Dominike', ''], ['Lindsay', 'Hali', ''], ['Gebhard', 'Patrick', ''], ['André', 'Elisabeth', ''], ['Bulling', 'Andreas', '']]","['challenge', 'dataset', 'backchannel detection', 'agreement estimation']"
10548,2008.06254,Ye Liu,"Ye Liu, Junsong Yuan, Chang Wen Chen","ConsNet: Learning Consistency Graph for Zero-Shot Human-Object
  Interaction Detection","Accepted to Proceedings of the 28th ACM International Conference on
  Multimedia (MM 2020)",,10.1145/3394171.3413600,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of Human-Object Interaction (HOI) Detection, which
aims to locate and recognize HOI instances in the form of <human, action,
object> in images. Most existing works treat HOIs as individual interaction
categories, thus can not handle the problem of long-tail distribution and
polysemy of action labels. We argue that multi-level consistencies among
objects, actions and interactions are strong cues for generating semantic
representations of rare or previously unseen HOIs. Leveraging the compositional
and relational peculiarities of HOI labels, we propose ConsNet, a
knowledge-aware framework that explicitly encodes the relations among objects,
actions and interactions into an undirected graph called consistency graph, and
exploits Graph Attention Networks (GATs) to propagate knowledge among HOI
categories as well as their constituents. Our model takes visual features of
candidate human-object pairs and word embeddings of HOI labels as inputs, maps
them into visual-semantic joint embedding space and obtains detection results
by measuring their similarities. We extensively evaluate our model on the
challenging V-COCO and HICO-DET datasets, and results validate that our
approach outperforms state-of-the-arts under both fully-supervised and
zero-shot settings. Code is available at https://github.com/yeliudev/ConsNet.
","[{'version': 'v1', 'created': 'Fri, 14 Aug 2020 09:11:18 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Sep 2020 05:35:03 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Apr 2021 20:38:46 GMT'}, {'version': 'v4', 'created': 'Sun, 27 Mar 2022 07:49:43 GMT'}]",2022-03-29,"[['Liu', 'Ye', ''], ['Yuan', 'Junsong', ''], ['Chen', 'Chang Wen', '']]","['Human-Object Interaction Detection', 'Graph Neural Networks', 'ZeroShot Learning']"
10549,2205.05907,Louise Bloch,Louise Bloch and Christoph M. Friedrich,"Machine Learning Workflow to Explain Black-box Models for Early
  Alzheimer's Disease Classification Evaluated for Multiple Datasets",,SN Computer Science 3 (6) (2022),10.1007/s42979-022-01371-y,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose: Hard-to-interpret Black-box Machine Learning (ML) were often used
for early Alzheimer's Disease (AD) detection.
  Methods: To interpret eXtreme Gradient Boosting (XGBoost), Random Forest
(RF), and Support Vector Machine (SVM) black-box models a workflow based on
Shapley values was developed. All models were trained on the Alzheimer's
Disease Neuroimaging Initiative (ADNI) dataset and evaluated for an independent
ADNI test set, as well as the external Australian Imaging and Lifestyle
flagship study of Ageing (AIBL), and Open Access Series of Imaging Studies
(OASIS) datasets. Shapley values were compared to intuitively interpretable
Decision Trees (DTs), and Logistic Regression (LR), as well as natural and
permutation feature importances. To avoid the reduction of the explanation
validity caused by correlated features, forward selection and aspect
consolidation were implemented.
  Results: Some black-box models outperformed DTs and LR. The forward-selected
features correspond to brain areas previously associated with AD. Shapley
values identified biologically plausible associations with moderate to strong
correlations with feature importances. The most important RF features to
predict AD conversion were the volume of the amygdalae, and a cognitive test
score. Good cognitive test performances and large brain volumes decreased the
AD risk. The models trained using cognitive test scores significantly
outperformed brain volumetric models ($p<0.05$). Cognitive Normal (CN) vs. AD
models were successfully transferred to external datasets.
  Conclusion: In comparison to previous work, improved performances for ADNI
and AIBL were achieved for CN vs. Mild Cognitive Impairment (MCI)
classification using brain volumes. The Shapley values and the feature
importances showed moderate to strong correlations.
","[{'version': 'v1', 'created': 'Thu, 12 May 2022 06:58:11 GMT'}, {'version': 'v2', 'created': 'Sat, 5 Nov 2022 11:37:20 GMT'}]",2022-11-08,"[['Bloch', 'Louise', ''], ['Friedrich', 'Christoph M.', '']]","['Interpretable Machine Learning', 'Early Alzheimer’s DiseaseDetection', 'Shapley Values']"
10550,2111.11872,Tongya Zheng,"Tongya Zheng, Gang Chen, Xinyu Wang, Chun Chen, Xingen Wang, Sihui Luo","Real-time intelligent big data processing: technology, platform, and
  applications","13 pages, 8 figures, Accpeted 13 February 2019 by Science China
  Information Sciences",Science China Information Sciences 62.8 (2019): 1-12,10.1007/s11432-018-9834-8,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human beings keep exploring the physical space using information means. Only
recently, with the rapid development of information technologies and the
increasing accumulation of data, human beings can learn more about the unknown
world with data-driven methods. Given data timeliness, there is a growing
awareness of the importance of real-time data. There are two categories of
technologies accounting for data processing: batching big data and streaming
processing, which have not been integrated well. Thus, we propose an innovative
incremental processing technology named after Stream Cube to process both big
data and stream data. Also, we implement a real-time intelligent data
processing system, which is based on real-time acquisition, real-time
processing, real-time analysis, and real-time decision-making. The real-time
intelligent data processing technology system is equipped with a batching big
data platform, data analysis tools, and machine learning models. Based on our
applications and analysis, the real-time intelligent data processing system is
a crucial solution to the problems of the national society and economy.
","[{'version': 'v1', 'created': 'Tue, 23 Nov 2021 13:40:22 GMT'}]",2021-11-24,"[['Zheng', 'Tongya', ''], ['Chen', 'Gang', ''], ['Wang', 'Xinyu', ''], ['Chen', 'Chun', ''], ['Wang', 'Xingen', ''], ['Luo', 'Sihui', '']]","['batching big data', 'streaming processing technology', 'real-time data processing', 'incrementalcomputation', 'intelligent data processing system']"
10551,2201.10620,Isobel Seabrook,"Isobel Seabrook, Paolo Barucca, Fabio Caccioli","Structural importance and evolution: an application to financial
  transaction networks",,,10.1016/j.physa.2022.128203,,cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A fundamental problem in the study of networks is the identification of
important nodes. This is typically achieved using centrality metrics, which
rank nodes in terms of their position in the network. This approach works well
for static networks, that do not change over time, but does not consider the
dynamics of the network. Here we propose instead to measure the importance of a
node based on how much a change to its strength will impact the global
structure of the network, which we measure in terms of the spectrum of its
adjacency matrix. We apply our method to the identification of important nodes
in equity transaction networks, and we show that, while it can still be
computed from a static network, our measure is a good predictor of nodes
subsequently transacting. This implies that static representations of temporal
networks can contain information about their dynamics.
","[{'version': 'v1', 'created': 'Tue, 25 Jan 2022 20:43:39 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Jun 2022 10:53:31 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Sep 2022 19:25:07 GMT'}]",2022-10-19,"[['Seabrook', 'Isobel', ''], ['Barucca', 'Paolo', ''], ['Caccioli', 'Fabio', '']]","['Temporal network', 'spectral perturbation', 'node predictability']"
10552,2107.04741,Kien-Tuan Ngo,"Kien-Tuan Ngo, Thu-Trang Nguyen, Son Nguyen, and Hieu Dinh Vo",Variability Fault Localization: A Benchmark,"Published in Proceedings of the 25th ACM International Systems and
  Software Product Line Conference - Volume A (SPLC '21)",,10.1145/3461001.3473058,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Software fault localization is one of the most expensive, tedious, and
time-consuming activities in program debugging. This activity becomes even much
more challenging in Software Product Line (SPL) systems due to the variability
of failures in SPL systems. These unexpected behaviors are caused by
variability faults which can only be exposed under some combinations of system
features. Although localizing bugs in non-configurable code has been
investigated in-depth, variability fault localization in SPL systems still
remains mostly unexplored. To approach this challenge, we propose a benchmark
for variability fault localization with a large set of 1,570 buggy versions of
six SPL systems and baseline variability fault localization performance
results. Our hope is to engage the community to propose new and better
approaches to the problem of variability fault localization in SPL systems.
","[{'version': 'v1', 'created': 'Sat, 10 Jul 2021 03:09:00 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Sep 2021 13:16:45 GMT'}]",2021-09-22,"[['Ngo', 'Kien-Tuan', ''], ['Nguyen', 'Thu-Trang', ''], ['Nguyen', 'Son', ''], ['Vo', 'Hieu Dinh', '']]","['variability bug', 'variability fault localization', 'benchmark']"
10553,1906.07637,David Gotz,"Bryce Morrow, Trevor Manz, Arlene E. Chung, Nils Gehlenborg, David
  Gotz",Periphery Plots for Contextualizing Heterogeneous Time-Based Charts,"To Appear in IEEE VIS 2019 Short Papers. Open source software and
  other materials available on github:
  https://github.com/PrecisionVISSTA/PeripheryPlots Video figure available on
  Vimeo: https://vimeo.com/349678146",,10.1109/VISUAL.2019.8933582,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Patterns in temporal data can often be found across different scales, such as
days, weeks, and months, making effective visualization of time-based data
challenging. Here we propose a new approach for providing focus and context in
time-based charts to enable interpretation of patterns across time scales. Our
approach employs a focus zone with a time and a second axis, that can either
represent quantities or categories, as well as a set of adjacent periphery
plots that can aggregate data along the time, value, or both dimensions. We
present a framework for periphery plots and describe two use cases that
demonstrate the utility of our approach.
","[{'version': 'v1', 'created': 'Tue, 18 Jun 2019 15:17:52 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Aug 2019 15:19:02 GMT'}]",2020-06-16,"[['Morrow', 'Bryce', ''], ['Manz', 'Trevor', ''], ['Chung', 'Arlene E.', ''], ['Gehlenborg', 'Nils', ''], ['Gotz', 'David', '']]","['Time-based data', 'Focus + context techniques', 'Healthinformatics', 'mHealth', 'Patient-generated health data']"
10554,2101.06715,Niloy Sikder,"Niloy Sikder, Abu Shamim Mohammad Arif, Abdullah-Al Nahid","Heterogeneous Hand Guise Classification Based on Surface
  Electromyographic Signals Using Multichannel Convolutional Neural Network","10 pages, 2019 22nd International Conference of Computer and
  Information Technology (ICCIT), 18-20 December, 2019",,10.1109/ICCIT48885.2019.9038173,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Electromyography (EMG) is a way of measuring the bioelectric activities that
take place inside the muscles. EMG is usually performed to detect abnormalities
within the nerves or muscles of a target area. The recent developments in the
field of Machine Learning allow us to use EMG signals to teach machines the
complex properties of human movements. Modern machines are capable of detecting
numerous human activities and distinguishing among them solely based on the EMG
signals produced by those activities. However, success in accomplishing this
task mostly depends on the learning technique used by the machine to analyze
EMG signals; and even the latest algorithms do not result in flawless
classification. In this study, a novel classification method has been described
employing a multichannel Convolutional Neural Network (CNN) that interprets
surface EMG signals by the properties they exhibit in the power domain. The
proposed method was tested on a well-established EMG dataset, and the result
yields very high classification accuracy. This learning model will help
researchers to develop prosthetic arms capable of detecting various hand
gestures to mimic them afterwards.
","[{'version': 'v1', 'created': 'Sun, 17 Jan 2021 17:02:04 GMT'}]",2021-01-19,"[['Sikder', 'Niloy', ''], ['Arif', 'Abu Shamim Mohammad', ''], ['Nahid', 'Abdullah-Al', '']]","['electromyography', 'surface EMG', 'hand movements classification', 'multichannel CNN', 'burg’s method', 'signal processing', 'feature extraction', 'machine learning']"
10555,2109.11289,Valerio Luconi,"Gloria Ciavarrini, Valerio Luconi, Alessio Vecchio",Smartphone-based geolocation of Internet hosts,,Computer Networks 116 (2017) 22-32,10.1016/j.comnet.2017.02.006,,cs.NI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The location of Internet hosts is frequently used in distributed applications
and networking services. Examples include customized advertising, distribution
of content, and position-based security. Unfortunately the relationship between
an IP address and its position is in general very weak. This motivates the
study of measurement-based IP geolocation techniques, where the position of the
target host is actively estimated using the delays between a number of
landmarks and the target itself. This paper discusses an IP geolocation method
based on crowdsourcing where the smartphones of users operate as landmarks.
Since smartphones rely on wireless connections, a specific delay-distance model
was derived to capture the characteristics of this novel operating scenario.
","[{'version': 'v1', 'created': 'Thu, 23 Sep 2021 10:50:53 GMT'}]",2021-09-24,"[['Ciavarrini', 'Gloria', ''], ['Luconi', 'Valerio', ''], ['Vecchio', 'Alessio', '']]","['IP geolocation', 'smartphone', 'crowdsourcing', 'network measurement']"
10556,2204.07211,Jakub Ber\'anek,"Jakub Ber\'anek, Stanislav B\""ohm, Vojt\v{e}ch Cima",Analysis of Workflow Schedulers in Simulated Distributed Environments,,,10.1007/s11227-022-04438-y,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Task graphs provide a simple way to describe scientific workflows (sets of
tasks with dependencies) that can be executed on both HPC clusters and in the
cloud. An important aspect of executing such graphs is the used scheduling
algorithm. Many scheduling heuristics have been proposed in existing works;
nevertheless, they are often tested in oversimplified environments. We provide
an extensible simulation environment designed for prototyping and benchmarking
task schedulers, which contains implementations of various scheduling
algorithms and is open-sourced, in order to be fully reproducible. We use this
environment to perform a comprehensive analysis of workflow scheduling
algorithms with a focus on quantifying the effect of scheduling challenges that
have so far been mostly neglected, such as delays between scheduler invocations
or partially unknown task durations. Our results indicate that network models
used by many previous works might produce results that are off by an order of
magnitude in comparison to a more realistic model. Additionally, we show that
certain implementation details of scheduling algorithms which are often
neglected can have a large effect on the scheduler's performance, and they
should thus be described in great detail to enable proper evaluation.
","[{'version': 'v1', 'created': 'Thu, 14 Apr 2022 20:22:21 GMT'}]",2022-04-18,"[['Beránek', 'Jakub', ''], ['Böhm', 'Stanislav', ''], ['Cima', 'Vojtěch', '']]","['Distributed Computing', 'DAG Scheduling', 'Task Scheduling', 'Network Models']"
10557,2204.08807,Ding Zou,"Ding Zou, Wei Wei, Xian-Ling Mao, Ziyang Wang, Minghui Qiu, Feida Zhu,
  Xin Cao","Multi-level Cross-view Contrastive Learning for Knowledge-aware
  Recommender System",Accepted to SIGIR2022,,10.1145/3477495.3532025,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge graph (KG) plays an increasingly important role in recommender
systems. Recently, graph neural networks (GNNs) based model has gradually
become the theme of knowledge-aware recommendation (KGR). However, there is a
natural deficiency for GNN-based KGR models, that is, the sparse supervised
signal problem, which may make their actual performance drop to some extent.
Inspired by the recent success of contrastive learning in mining supervised
signals from data itself, in this paper, we focus on exploring the contrastive
learning in KG-aware recommendation and propose a novel multi-level cross-view
contrastive learning mechanism, named MCCLK. Different from traditional
contrastive learning methods which generate two graph views by uniform data
augmentation schemes such as corruption or dropping, we comprehensively
consider three different graph views for KG-aware recommendation, including
global-level structural view, local-level collaborative and semantic views.
Specifically, we consider the user-item graph as a collaborative view, the
item-entity graph as a semantic view, and the user-item-entity graph as a
structural view. MCCLK hence performs contrastive learning across three views
on both local and global levels, mining comprehensive graph feature and
structure information in a self-supervised manner. Besides, in semantic view, a
k-Nearest-Neighbor (kNN) item-item semantic graph construction module is
proposed, to capture the important item-item semantic relation which is usually
ignored by previous work. Extensive experiments conducted on three benchmark
datasets show the superior performance of our proposed method over the
state-of-the-arts. The implementations are available at:
https://github.com/CCIIPLab/MCCLK.
","[{'version': 'v1', 'created': 'Tue, 19 Apr 2022 11:07:30 GMT'}]",2022-04-20,"[['Zou', 'Ding', ''], ['Wei', 'Wei', ''], ['Mao', 'Xian-Ling', ''], ['Wang', 'Ziyang', ''], ['Qiu', 'Minghui', ''], ['Zhu', 'Feida', ''], ['Cao', 'Xin', '']]","['Graph Neural Network', 'Contrastive Learning', 'Knowledge Graph', 'Recommender System', 'Multi-view Graph Learning']"
10558,2101.00295,Ali Tourani,"Ali Tourani, Sajjad Soroori, Asadollah Shahbahrami, and Alireza
  Akoushideh",Iranis: A Large-scale Dataset of Farsi License Plate Characters,"9 pages, 4 figures, 2 tables",,10.1109/IPRIA53572.2021.9483461,,cs.CV cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Providing huge amounts of data is a fundamental demand when dealing with Deep
Neural Networks (DNNs). Employing these algorithms to solve computer vision
problems resulted in the advent of various image datasets to feed the most
common visual imagery deep structures, known as Convolutional Neural Networks
(CNNs). In this regard, some datasets can be found that contain hundreds or
even thousands of images for license plate detection and optical character
recognition purposes. However, no publicly available image dataset provides
such data for the recognition of Farsi characters used in car license plates.
The gap has to be filled due to the numerous advantages of developing accurate
deep learning-based systems for law enforcement and surveillance purposes. This
paper introduces a large-scale dataset that includes images of numbers and
characters used in Iranian car license plates. The dataset, named Iranis,
contains more than 83,000 images of Farsi numbers and letters collected from
real-world license plate images captured by various cameras. The variety of
instances in terms of camera shooting angle, illumination, resolution, and
contrast make the dataset a proper choice for training DNNs. Dataset images are
manually annotated for object detection and image classification. Finally, and
to build a baseline for Farsi character recognition, the paper provides a
performance analysis using a YOLO v.3 object detector.
","[{'version': 'v1', 'created': 'Fri, 1 Jan 2021 18:54:44 GMT'}]",2021-08-02,"[['Tourani', 'Ali', ''], ['Soroori', 'Sajjad', ''], ['Shahbahrami', 'Asadollah', ''], ['Akoushideh', 'Alireza', '']]","['dataset', 'Iranian license plate', 'deep learning', 'Farsi/Arabic character']"
10559,1704.03016,Nathan Hartmann,"Nathan Siegle Hartmann and Magali Sanches Duran and Sandra Maria
  Alu\'isio","Automatic semantic role labeling on non-revised syntactic trees of
  journalistic texts","PROPOR International Conference on the Computational Processing of
  Portuguese, 2016, 8 pages","PROPOR 2016. Springer. Lecture Notes in Computer Science volume
  9727 (2016) pgs. 202-212",10.1007/978-3-319-41552-9_20,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semantic Role Labeling (SRL) is a Natural Language Processing task that
enables the detection of events described in sentences and the participants of
these events. For Brazilian Portuguese (BP), there are two studies recently
concluded that perform SRL in journalistic texts. [1] obtained F1-measure
scores of 79.6, using the PropBank.Br corpus, which has syntactic trees
manually revised, [8], without using a treebank for training, obtained
F1-measure scores of 68.0 for the same corpus. However, the use of manually
revised syntactic trees for this task does not represent a real scenario of
application. The goal of this paper is to evaluate the performance of SRL on
revised and non-revised syntactic trees using a larger and balanced corpus of
BP journalistic texts. First, we have shown that [1]'s system also performs
better than [8]'s system on the larger corpus. Second, the SRL system trained
on non-revised syntactic trees performs better over non-revised trees than a
system trained on gold-standard data.
","[{'version': 'v1', 'created': 'Mon, 10 Apr 2017 19:02:18 GMT'}]",2017-04-12,"[['Hartmann', 'Nathan Siegle', ''], ['Duran', 'Magali Sanches', ''], ['Aluísio', 'Sandra Maria', '']]","['Semantic role labeling', 'Non-revised syntactic trees', 'Brazilian Portuguese']"
10560,2011.00449,Suyu Ge,"Suyu Ge, Lu Cheng, Huan Liu",Improving Cyberbully Detection with User Interaction,The Web Conference 2021,,10.1145/3442381.3449828,,cs.CL cs.AI cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Cyberbullying, identified as intended and repeated online bullying behavior,
has become increasingly prevalent in the past few decades. Despite the
significant progress made thus far, the focus of most existing work on
cyberbullying detection lies in the independent content analysis of different
comments within a social media session. We argue that such leading notions of
analysis suffer from three key limitations: they overlook the temporal
correlations among different comments; they only consider the content within a
single comment rather than the topic coherence across comments; they remain
generic and exploit limited interactions between social media users. In this
work, we observe that user comments in the same session may be inherently
related, e.g., discussing similar topics, and their interaction may evolve over
time. We also show that modeling such topic coherence and temporal interaction
are critical to capture the repetitive characteristics of bullying behavior,
thus leading to better predicting performance. To achieve the goal, we first
construct a unified temporal graph for each social media session. Drawing on
recent advances in graph neural network, we then propose a principled
graph-based approach for modeling the temporal dynamics and topic coherence
throughout user interactions. We empirically evaluate the effectiveness of our
approach with the tasks of session-level bullying detection and comment-level
case study. Our code is released to public.
","[{'version': 'v1', 'created': 'Sun, 1 Nov 2020 08:47:33 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Feb 2021 03:16:57 GMT'}]",2021-02-12,"[['Ge', 'Suyu', ''], ['Cheng', 'Lu', ''], ['Liu', 'Huan', '']]","['Cyberbullying Detection', 'User Interaction', 'Temporal Dynamics', 'Topic Coherence', 'Graph Attention Network']"
10561,2204.04160,Pantea Kiaei,"Pantea Kiaei, Zhenyuan Liu, Patrick Schaumont","Leverage the Average: Averaged Sampling in Pre-Silicon Side-Channel
  Leakage Assessment",,"Proceedings of the Great Lakes Symposium on VLSI 2022 (GLSVLSI
  '22), June 6--8, 2022, Irvine, CA, USA",10.1145/3526241.3530337,,cs.AR cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Pre-silicon side-channel leakage assessment is a useful tool to identify
hardware vulnerabilities at design time, but it requires many high-resolution
power traces and increases the power simulation cost of the design. By
downsampling and averaging these high-resolution traces, we show that the power
simulation cost can be considerably reduced without significant loss of
side-channel leakage assessment quality. We introduce a theoretical basis for
our claims. Our results demonstrate up to 6.5-fold power-simulation speed
improvement on a gate-level side-channel leakage assessment of a RISC-V SoC.
Furthermore, we clarify the conditions under which the averaged sampling
technique can be successfully used.
","[{'version': 'v1', 'created': 'Fri, 8 Apr 2022 16:09:55 GMT'}]",2022-04-11,"[['Kiaei', 'Pantea', ''], ['Liu', 'Zhenyuan', ''], ['Schaumont', 'Patrick', '']]","['Pre-silicon Leakage Assessment', 'Power Side-Channel', 'Power Simulation', 'ASIC']"
10562,2109.00895,Yushan Zhu,"Yushan Zhu, Huaixiao Tou, Wen Zhang, Ganqiang Ye, Hui Chen, Ningyu
  Zhang and Huajun Chen",Knowledge Perceived Multi-modal Pretraining in E-commerce,Accepted to ACM MM 2021,,10.1145/3474085.3475648,,cs.CV cs.AI cs.CL,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we address multi-modal pretraining of product data in the
field of E-commerce. Current multi-modal pretraining methods proposed for image
and text modalities lack robustness in the face of modality-missing and
modality-noise, which are two pervasive problems of multi-modal product data in
real E-commerce scenarios. To this end, we propose a novel method, K3M, which
introduces knowledge modality in multi-modal pretraining to correct the noise
and supplement the missing of image and text modalities. The modal-encoding
layer extracts the features of each modality. The modal-interaction layer is
capable of effectively modeling the interaction of multiple modalities, where
an initial-interactive feature fusion model is designed to maintain the
independence of image modality and text modality, and a structure aggregation
module is designed to fuse the information of image, text, and knowledge
modalities. We pretrain K3M with three pretraining tasks, including masked
object modeling (MOM), masked language modeling (MLM), and link prediction
modeling (LPM). Experimental results on a real-world E-commerce dataset and a
series of product-based downstream tasks demonstrate that K3M achieves
significant improvements in performances than the baseline and state-of-the-art
methods when modality-noise or modality-missing exists.
","[{'version': 'v1', 'created': 'Fri, 20 Aug 2021 08:01:28 GMT'}]",2021-09-03,"[['Zhu', 'Yushan', ''], ['Tou', 'Huaixiao', ''], ['Zhang', 'Wen', ''], ['Ye', 'Ganqiang', ''], ['Chen', 'Hui', ''], ['Zhang', 'Ningyu', ''], ['Chen', 'Huajun', '']]","['knowledge graph', 'multi-modal pretraining', 'modality missing', 'modality noise']"
10563,1506.05154,Andre Filipe De Moraes Batista,Andre Filipe de Moraes Batista and Maria das Gra\c{c}as Bruno Marietto,SNA-based reasoning for multiagent team composition,10 pages,"International Journal of Artificial Intelligence & Applications
  (IJAIA) Vol. 6, No. 3, May 2015",10.5121/ijaia.2015.6305,,cs.MA cs.AI cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The social network analysis (SNA), branch of complex systems can be used in
the construction of multiagent systems. This paper proposes a study of how
social network analysis can assist in modeling multiagent systems, while
addressing similarities and differences between the two theories. We built a
prototype of multi-agent systems for resolution of tasks through the formation
of teams of agents that are formed on the basis of the social network
established between agents. Agents make use of performance indicators to assess
when should change their social network to maximize the participation in teams
","[{'version': 'v1', 'created': 'Tue, 16 Jun 2015 21:17:05 GMT'}]",2015-06-18,"[['Batista', 'Andre Filipe de Moraes', ''], ['Marietto', 'Maria das Graças Bruno', '']]","['Multi-Agent Systems', 'Social Network Analysis', 'Complex Systems', 'Reasoning', 'Task Resolvers  1']"
10564,2203.13607,Juraj Gazda,"Marek Ru\v{z}i\v{c}ka, Marcel Volo\v{s}in, Juraj Gazda, Taras
  Maksymyuk, Longzhe Han, Mischa Dohler","Fast and computationally efficient generative adversarial network
  algorithm for unmanned aerial vehicle-based network coverage optimization",International Journal of Distributed Sensor Networks. 2022,,10.1177/15501477221075544,,cs.LG cs.NI,http://creativecommons.org/licenses/by-sa/4.0/,"  The challenge of dynamic traffic demand in mobile networks is tackled by
moving cells based on unmanned aerial vehicles. Considering the tremendous
potential of unmanned aerial vehicles in the future, we propose a new heuristic
algorithm for coverage optimization. The proposed algorithm is implemented
based on a conditional generative adversarial neural network, with a unique
multilayer sum-pooling loss function. To assess the performance of the proposed
approach, we compare it with the optimal core-set algorithm and quasi-optimal
spiral algorithm. Simulation results show that the proposed approach converges
to the quasi-optimal solution with a negligible difference from the global
optimum while maintaining a quadratic complexity regardless of the number of
users.
","[{'version': 'v1', 'created': 'Fri, 25 Mar 2022 12:13:21 GMT'}]",2022-03-28,"[['Ružička', 'Marek', ''], ['Vološin', 'Marcel', ''], ['Gazda', 'Juraj', ''], ['Maksymyuk', 'Taras', ''], ['Han', 'Longzhe', ''], ['Dohler', 'Mischa', '']]","['Generative adversarial network', 'unmanned aerial vehicle', 'algorithm optimization', 'coverage', 'machine learning']"
10565,2203.17112,Sohil Lal Shrestha,"Sohil Lal Shrestha, Shafiul Azam Chowdhury and Christoph Csallner",SLNET: A Redistributable Corpus of 3rd-party Simulink Models,"Published in Mining Software Repositories 2022 - Data and Tool
  Showcase Track",,10.1145/3524842.3528001,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  MATLAB/Simulink is widely used for model-based design. Engineers create
Simulink models and compile them to embedded code, often to control
safety-critical cyber-physical systems in automotive, aerospace, and healthcare
applications. Despite Simulink's importance, there are few large-scale
empirical Simulink studies, perhaps because there is no large readily available
corpus of third-party open-source Simulink models. To enable empirical Simulink
studies, this paper introduces SLNET, the largest corpus of freely available
third-party Simulink models. SLNET has several advantages over earlier
collections. Specifically, SLNET is 8 times larger than the largest previous
corpus of Simulink models, includes fine-grained metadata, is constructed
automatically, is self-contained, and allows redistribution. SLNET is available
under permissive open-source licenses and contains all of its collection and
analysis tools.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2022 15:33:39 GMT'}]",2022-04-01,"[['Shrestha', 'Sohil Lal', ''], ['Chowdhury', 'Shafiul Azam', ''], ['Csallner', 'Christoph', '']]","['Simulink', 'mining software repositories', 'open-source']"
10566,2010.05584,Oliviero Riganelli,"Oliviero Riganelli, Simone Paolo Mottadelli, Claudio Rota, Daniela
  Micucci, Leonardo Mariani","Data Loss Detector: Automatically Revealing Data Loss Bugs in Android
  Apps","for associated video presentation, see https://youtu.be/s6XZ7F8L3nY
  for associated slides, see
  https://www.slideshare.net/OlivieroRiganelli/oliviero-riganelli-data-loss-detector-automatically-revealing-data-loss-bugs-in-android-apps
  . In Proc. of the International Symposium on Software Testing and Analysis
  (ISSTA 2020)",,10.1145/3395363.3397379,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Android apps must work correctly even if their execution is interrupted by
external events. For instance, an app must work properly even if a phone call
is received, or after its layout is redrawn because the smartphone has been
rotated. Since these events may require destroying, when the execution is
interrupted, and recreating, when the execution is resumed, the foreground
activity of the app, the only way to prevent the loss of state information is
saving and restoring it. This behavior must be explicitly implemented by app
developers, who often miss to implement it properly, releasing apps affected by
data loss problems, that is, apps that may lose state information when their
execution is interrupted. Although several techniques can be used to
automatically generate test cases for Android apps, the obtained test cases
seldom include the interactions and the checks necessary to exercise and reveal
data loss faults. To address this problem, this paper presents Data Loss
Detector (DLD), a test case generation technique that integrates an exploration
strategy, data-loss-revealing actions, and two customized oracle strategies for
the detection of data loss failures. DLD has been able to reveal 75% of the
faults in a benchmark of 54 Android app releases affected by 110 known data
loss faults. DLD also revealed unknown data loss problems, outperforming
competing approaches.
","[{'version': 'v1', 'created': 'Mon, 12 Oct 2020 10:19:31 GMT'}]",2020-10-13,"[['Riganelli', 'Oliviero', ''], ['Mottadelli', 'Simone Paolo', ''], ['Rota', 'Claudio', ''], ['Micucci', 'Daniela', ''], ['Mariani', 'Leonardo', '']]","['Android', 'data loss', 'test case generation', 'validation', 'mobile apps']"
10567,1811.07087,Snehashis Roy,Dzung L. Pham and Snehashis Roy,"Alternating Segmentation and Simulation for Contrast Adaptive Tissue
  Classification","Proceedings Volume 10578, Medical Imaging 2018: Biomedical
  Applications in Molecular, Structural, and Functional Imaging; SPIE Medical
  Imaging 2018",,10.1117/12.2295047,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  A key feature of magnetic resonance (MR) imaging is its ability to manipulate
how the intrinsic tissue parameters of the anatomy ultimately contribute to the
contrast properties of the final, acquired image. This flexibility, however,
can lead to substantial challenges for segmentation algorithms, particularly
supervised methods. These methods require atlases or training data, which are
composed of MR image and labeled image pairs. In most cases, the training data
are obtained with a fixed acquisition protocol, leading to suboptimal
performance when an input data set that requires segmentation has differing
contrast properties. This drawback is increasingly significant with the recent
movement towards multi-center research studies involving multiple scanners and
acquisition protocols. In this work, we propose a new framework for supervised
segmentation approaches that is robust to contrast differences between the
training MR image and the input image. Our approach uses a generative
simulation model within the segmentation process to compensate for the contrast
differences. We allow the contrast of the MR image in the training data to vary
by simulating a new contrast from the corresponding label image. The model
parameters are optimized by a cost function measuring the consistency between
the input MR image and its simulation based on a current estimate of the
segmentation labels. We provide a proof of concept of this approach by
combining a supervised classifier with a simple simulation model, and apply the
resulting algorithm to synthetic images and actual MR images.
","[{'version': 'v1', 'created': 'Sat, 17 Nov 2018 03:28:50 GMT'}]",2018-11-20,"[['Pham', 'Dzung L.', ''], ['Roy', 'Snehashis', '']]","['magnetic resonance imaging', 'machine learning', 'contrast adaptation', 'segmentation', 'simulation']"
10568,2101.00078,Anjalie Field,"Anjalie Field, Chan Young Park, Kevin Z. Lin, Yulia Tsvetkov",Controlled Analyses of Social Biases in Wikipedia Bios,Accepted to the Web Conference 2022 (WWW '22),,10.1145/3485447.3512134,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social biases on Wikipedia, a widely-read global platform, could greatly
influence public opinion. While prior research has examined man/woman gender
bias in biography articles, possible influences of other demographic attributes
limit conclusions. In this work, we present a methodology for analyzing
Wikipedia pages about people that isolates dimensions of interest (e.g.,
gender), from other attributes (e.g., occupation). Given a target corpus for
analysis (e.g.~biographies about women), we present a method for constructing a
comparison corpus that matches the target corpus in as many attributes as
possible, except the target one. We develop evaluation metrics to measure how
well the comparison corpus aligns with the target corpus and then examine how
articles about gender and racial minorities (cis. women, non-binary people,
transgender women, and transgender men; African American, Asian American, and
Hispanic/Latinx American people) differ from other articles. In addition to
identifying suspect social biases, our results show that failing to control for
covariates can result in different conclusions and veil biases. Our
contributions include methodology that facilitates further analyses of bias in
Wikipedia articles, findings that can aid Wikipedia editors in reducing biases,
and a framework and evaluation metrics to guide future work in this area.
","[{'version': 'v1', 'created': 'Thu, 31 Dec 2020 21:27:12 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Oct 2021 21:12:04 GMT'}, {'version': 'v3', 'created': 'Sat, 5 Feb 2022 01:25:00 GMT'}, {'version': 'v4', 'created': 'Wed, 9 Feb 2022 06:34:38 GMT'}]",2022-02-10,"[['Field', 'Anjalie', ''], ['Park', 'Chan Young', ''], ['Lin', 'Kevin Z.', ''], ['Tsvetkov', 'Yulia', '']]","['Wikipedia', 'NLP', 'gender bias', 'racial bias', 'matching']"
10569,2009.11811,Bruno Klaus De Aquino Afonso,"Bruno Klaus de Aquino Afonso, Lilian Berton","Identifying noisy labels with a transductive semi-supervised
  leave-one-out filter",,"Pattern Recognition Letters, 2020, ISSN 0167-8655",10.1016/j.patrec.2020.09.024,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Obtaining data with meaningful labels is often costly and error-prone. In
this situation, semi-supervised learning (SSL) approaches are interesting, as
they leverage assumptions about the unlabeled data to make up for the limited
amount of labels. However, in real-world situations, we cannot assume that the
labeling process is infallible, and the accuracy of many SSL classifiers
decreases significantly in the presence of label noise. In this work, we
introduce the LGC_LVOF, a leave-one-out filtering approach based on the Local
and Global Consistency (LGC) algorithm. Our method aims to detect and remove
wrong labels, and thus can be used as a preprocessing step to any SSL
classifier. Given the propagation matrix, detecting noisy labels takes O(cl)
per step, with c the number of classes and l the number of labels. Moreover,
one does not need to compute the whole propagation matrix, but only an $l$ by
$l$ submatrix corresponding to interactions between labeled instances. As a
result, our approach is best suited to datasets with a large amount of
unlabeled data but not many labels. Results are provided for a number of
datasets, including MNIST and ISOLET. LGCLVOF appears to be equally or more
precise than the adapted gradient-based filter. We show that the best-case
accuracy of the embedding of LGCLVOF into LGC yields performance comparable to
the best-case of $\ell_1$-based classifiers designed to be robust to label
noise. We provide a heuristic to choose the number of removed instances.
","[{'version': 'v1', 'created': 'Thu, 24 Sep 2020 16:50:06 GMT'}]",2020-09-25,"[['Afonso', 'Bruno Klaus de Aquino', ''], ['Berton', 'Lilian', '']]","['Semi-supervised learning', 'classification', 'graph-based', 'filter', 'label noise']"
10570,2101.01151,Ji\v{r}\'i \v{S}\'ima,Ji\v{r}\'i \v{S}\'ima and Stanislav \v{Z}\'ak,"A polynomial-time construction of a hitting set for read-once branching
  programs of width 3","48 pages, 10 figures","Fundamenta Informaticae, Volume 184, Issue 4 (March 10, 2022)
  fi:9057",10.3233/FI-2021-2101,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, an interest in constructing pseudorandom or hitting set generators
for restricted branching programs has increased, which is motivated by the
fundamental issue of derandomizing space-bounded computations. Such
constructions have been known only in the case of width 2 and in very
restricted cases of bounded width. In this paper, we characterize the hitting
sets for read-once branching programs of width 3 by a so-called richness
condition. Namely, we show that such sets hit the class of read-once
conjunctions of DNF and CNF (i.e. the weak richness). Moreover, we prove that
any rich set extended with all strings within Hamming distance of 3 is a
hitting set for read-once branching programs of width 3. Then, we show that any
almost $O(\log n)$-wise independent set satisfies the richness condition. By
using such a set due to Alon et al. (1992) our result provides an explicit
polynomial-time construction of a hitting set for read-once branching programs
of width 3 with acceptance probability $\varepsilon>5/6$. We announced this
result at conferences more than ten years ago, including only proof sketches,
which motivated a number of subsequent results on pseudorandom generators for
restricted read-once branching programs. This paper contains our original
detailed proof that has not been published yet.
","[{'version': 'v1', 'created': 'Mon, 4 Jan 2021 18:31:07 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Sep 2021 11:46:37 GMT'}, {'version': 'v3', 'created': 'Mon, 7 Feb 2022 15:25:41 GMT'}]",2022-03-14,"[['Šíma', 'Jiří', ''], ['Žák', 'Stanislav', '']]","['derandomization', 'hitting set', 'read-once branching program', 'bounded width', 'almostk-wise independent set']"
10571,2301.08613,Bruno Oliveira,"B. Oliveira, C. T. Lopes","The Evolution of Web Search User Interfaces -- An Archaeological
  Analysis of Google Search Engine Result Pages","10 pages, Full Paper of CHIIR 2023",,10.1145/3576840.3578320,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web search engines have marked everyone's life by transforming how one
searches and accesses information. Search engines give special attention to the
user interface, especially search engine result pages (SERP). The well-known
''10 blue links'' list has evolved into richer interfaces, often personalized
to the search query, the user, and other aspects. More than 20 years later, the
literature has not adequately portrayed this development. We present a study on
the evolution of SERP interfaces during the last two decades using Google
Search as a case study. We used the most searched queries by year to extract a
sample of SERP from the Internet Archive. Using this dataset, we analyzed how
SERP evolved in content, layout, design (e.g., color scheme, text styling,
graphics), navigation, and file size. We have also analyzed the user interface
design patterns associated with SERP elements. We found that SERP are becoming
more diverse in terms of elements, aggregating content from different verticals
and including more features that provide direct answers. This systematic
analysis portrays evolution trends in search engine user interfaces and, more
generally, web design. We expect this work will trigger other, more specific
studies that can take advantage of our dataset.
","[{'version': 'v1', 'created': 'Fri, 20 Jan 2023 14:52:38 GMT'}]",2023-01-23,"[['Oliveira', 'B.', ''], ['Lopes', 'C. T.', '']]","['Search engines', 'SERP features', 'Web interfaces', 'Web design', 'Evolution']"
10572,2009.02637,Zheng Gao,"Zheng Gao, Hongsong Li, Zhuoren Jiang, Xiaozhong Liu","Detecting User Community in Sparse Domain via Cross-Graph Pairwise
  Learning","10 pages, 5 figures",SIGIR 2020,10.1145/3397271.3401055,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cyberspace hosts abundant interactions between users and different kinds of
objects, and their relations are often encapsulated as bipartite graphs.
Detecting user community in such heterogeneous graphs is an essential task to
uncover user information needs and to further enhance recommendation
performance. While several main cyber domains carrying high-quality graphs,
unfortunately, most others can be quite sparse. However, as users may appear in
multiple domains (graphs), their high-quality activities in the main domains
can supply community detection in the sparse ones, e.g., user behaviors on
Google can help thousands of applications to locate his/her local community
when s/he uses Google ID to login those applications. In this paper, our model,
Pairwise Cross-graph Community Detection (PCCD), is proposed to cope with the
sparse graph problem by involving external graph knowledge to learn user
pairwise community closeness instead of detecting direct communities.
Particularly in our model, to avoid taking excessive propagated information, a
two-level filtering module is utilized to select the most informative
connections through both community and node level filters. Subsequently, a
Community Recurrent Unit (CRU) is designed to estimate pairwise user community
closeness. Extensive experiments on two real-world graph datasets validate our
model against several strong alternatives. Supplementary experiments also
validate its robustness on graphs with varied sparsity scales.
","[{'version': 'v1', 'created': 'Sun, 6 Sep 2020 02:51:06 GMT'}]",2020-09-08,"[['Gao', 'Zheng', ''], ['Li', 'Hongsong', ''], ['Jiang', 'Zhuoren', ''], ['Liu', 'Xiaozhong', '']]","['cross graph', 'community detection', 'pairwise learning']"
10573,1412.0129,Bernhard von Stengel,Bernhard von Stengel,Recursive Inspection Games,"final version for Mathematics of Operations Research, new Theorem 2","Mathematics of Operations Research 43:3 (2016), 935-952",10.1287/moor.2015.0762,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a sequential inspection game where an inspector uses a limited
number of inspections over a larger number of time periods to detect a
violation (an illegal act) of an inspectee. Compared with earlier models, we
allow varying rewards to the inspectee for successful violations. As one
possible example, the most valuable reward may be the completion of a sequence
of thefts of nuclear material needed to build a nuclear bomb. The inspectee can
observe the inspector, but the inspector can only determine if a violation
happens during a stage where he inspects, which terminates the game; otherwise
the game continues. Under reasonable assumptions for the payoffs, the
inspector's strategy is independent of the number of successful violations.
This allows to apply a recursive description of the game, even though this
normally assumes fully informed players after each stage. The resulting
recursive equation in three variables for the equilibrium payoff of the game,
which generalizes several other known equations of this kind, is solved
explicitly in terms of sums of binomial coefficients. We also extend this
approach to non-zero-sum games and, similar to Maschler (1966), ""inspector
leadership"" where the inspector commits to (the same) randomized inspection
schedule, but the inspectee acts legally (rather than mixes as in the
simultaneous game) as long as inspections remain.
","[{'version': 'v1', 'created': 'Sat, 29 Nov 2014 17:45:21 GMT'}, {'version': 'v2', 'created': 'Sun, 7 Feb 2016 03:01:59 GMT'}]",2016-08-24,"[['von Stengel', 'Bernhard', '']]","['inspection game', 'multistage game', 'recursive game', 'Stackelberg leadership', 'binomial coefficients']"
10574,1910.06715,Jin Zhang,"Jin Zhang, Jingyue Li","Testing and verification of neural-network-based safety-critical control
  software: A systematic literature review","This paper had been submitted to Journal of Information and Software
  Technology on April 20, 2019,Revised 5 December 2019, Accepted 6 March 2020,
  Available online 7 March 2020",,10.1016/j.infsof.2020.106296,,cs.LG cs.SE cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Neural Network (NN) algorithms have been successfully adopted in a
number of Safety-Critical Cyber-Physical Systems (SCCPSs). Testing and
Verification (T&V) of NN-based control software in safety-critical domains are
gaining interest and attention from both software engineering and safety
engineering researchers and practitioners. Objective: With the increase in
studies on the T&V of NN-based control software in safety-critical domains, it
is important to systematically review the state-of-the-art T&V methodologies,
to classify approaches and tools that are invented, and to identify challenges
and gaps for future studies. Method: We retrieved 950 papers on the T&V of
NN-based Safety-Critical Control Software (SCCS). To reach our result, we
filtered 83 primary papers published between 2001 and 2018, applied the
thematic analysis approach for analyzing the data extracted from the selected
papers, presented the classification of approaches, and identified challenges.
Conclusion: The approaches were categorized into five high-order themes:
assuring robustness of NNs, assuring safety properties of NN-based control
software, improving the failure resilience of NNs, measuring and ensuring test
completeness, and improving the interpretability of NNs. From the industry
perspective, improving the interpretability of NNs is a crucial need in
safety-critical applications. We also investigated nine safety integrity
properties within four major safety lifecycle phases to investigate the
achievement level of T&V goals in IEC 61508-3. Results show that correctness,
completeness, freedom from intrinsic faults, and fault tolerance have drawn
most attention from the research community. However, little effort has been
invested in achieving repeatability; no reviewed study focused on precisely
defined testing configuration or on defense against common cause failure.
","[{'version': 'v1', 'created': 'Sat, 5 Oct 2019 03:54:05 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Mar 2020 05:17:59 GMT'}]",2020-03-23,"[['Zhang', 'Jin', ''], ['Li', 'Jingyue', '']]","['Software testing and verification', 'Neural network', 'Safety-critical control software', 'Systematic literaturereview']"
10575,1910.02675,Nico Lang,"Steve Branson, Jan Dirk Wegner, David Hall, Nico Lang, Konrad
  Schindler, Pietro Perona",From Google Maps to a Fine-Grained Catalog of Street trees,,"ISPRS Journal of Photogrammetry and Remote Sensing, Volume 135,
  January 2018, Pages 13-30",10.1016/j.isprsjprs.2017.11.008,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Up-to-date catalogs of the urban tree population are important for
municipalities to monitor and improve quality of life in cities. Despite much
research on automation of tree mapping, mainly relying on dedicated airborne
LiDAR or hyperspectral campaigns, trees are still mostly mapped manually in
practice. We present a fully automated tree detection and species recognition
pipeline to process thousands of trees within a few hours using publicly
available aerial and street view images of Google MapsTM. These data provide
rich information (viewpoints, scales) from global tree shapes to bark textures.
Our work-flow is built around a supervised classification that automatically
learns the most discriminative features from thousands of trees and
corresponding, public tree inventory data. In addition, we introduce a change
tracker to keep urban tree inventories up-to-date. Changes of individual trees
are recognized at city-scale by comparing street-level images of the same tree
location at two different times. Drawing on recent advances in computer vision
and machine learning, we apply convolutional neural networks (CNN) for all
classification tasks. We propose the following pipeline: download all available
panoramas and overhead images of an area of interest, detect trees per image
and combine multi-view detections in a probabilistic framework, adding prior
knowledge; recognize fine-grained species of detected trees. In a later,
separate module, track trees over time and identify the type of change. We
believe this is the first work to exploit publicly available image data for
fine-grained tree mapping at city-scale, respectively over many thousands of
trees. Experiments in the city of Pasadena, California, USA show that we can
detect > 70% of the street trees, assign correct species to > 80% for 40
different species, and correctly detect and classify changes in > 90% of the
cases.
","[{'version': 'v1', 'created': 'Mon, 7 Oct 2019 08:52:50 GMT'}]",2019-10-08,"[['Branson', 'Steve', ''], ['Wegner', 'Jan Dirk', ''], ['Hall', 'David', ''], ['Lang', 'Nico', ''], ['Schindler', 'Konrad', ''], ['Perona', 'Pietro', '']]","['deep learning', 'image interpretation', 'urban areas', 'street trees', 'very highresolution']"
10576,2110.06064,Martin Alain PhD,Martin Alain and Aljosa Smolic,Spectral analysis of re-parameterized light fields,,Signal Processing: Image Communication 2022,10.1016/j.image.2022.116751,,cs.CV physics.optics,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this paper, we study the spectral properties of re-parameterized light
field. Following previous studies of the light field spectrum, which notably
provided sampling guidelines, we focus on the two plane parameterization of the
light field. However, we introduce additional flexibility by allowing the image
plane to be tilted and not only parallel. A formal theoretical analysis is
first presented, which shows that more flexible sampling guidelines (i.e. wider
camera baselines) can be used to sample the light field when adapting the image
plane orientation to the scene geometry. We then present our simulations and
results to support these theoretical findings. While the work introduced in
this paper is mostly theoretical, we believe these new findings open exciting
avenues for more practical application of light fields, such as view synthesis
or compact representation.
","[{'version': 'v1', 'created': 'Tue, 12 Oct 2021 15:05:36 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Sep 2022 17:10:15 GMT'}]",2022-09-08,"[['Alain', 'Martin', ''], ['Smolic', 'Aljosa', '']]","['Light field imaging', 'plenoptic sampling', 'image-based rendering']"
10577,1410.8581,"Dilek K\""u\c{c}\""uk","Dilek K\""u\c{c}\""uk and Yusuf Arslan","Semi-Automatic Construction of a Domain Ontology for Wind Energy Using
  Wikipedia Articles",,"Renewable Energy, Volume 62, pp. 484-489, February 2014",10.1016/j.renene.2013.08.002,,cs.CL cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Domain ontologies are important information sources for knowledge-based
systems. Yet, building domain ontologies from scratch is known to be a very
labor-intensive process. In this study, we present our semi-automatic approach
to building an ontology for the domain of wind energy which is an important
type of renewable energy with a growing share in electricity generation all
over the world. Related Wikipedia articles are first processed in an automated
manner to determine the basic concepts of the domain together with their
properties and next the concepts, properties, and relationships are organized
to arrive at the ultimate ontology. We also provide pointers to other
engineering ontologies which could be utilized together with the proposed wind
energy ontology in addition to its prospective application areas. The current
study is significant as, to the best of our knowledge, it proposes the first
considerably wide-coverage ontology for the wind energy domain and the ontology
is built through a semi-automatic process which makes use of the related Web
resources, thereby reducing the overall cost of the ontology building process.
","[{'version': 'v1', 'created': 'Thu, 30 Oct 2014 22:38:11 GMT'}]",2014-11-03,"[['Küçük', 'Dilek', ''], ['Arslan', 'Yusuf', '']]","['wind energy', 'wind power', 'domain ontology', 'text mining', 'Web mining']"
10578,1710.03395,Diptarama Hendrian,"Diptarama Hendrian and Shunsuke Inenaga and Ryo Yoshinaka and Ayumi
  Shinohara",Efficient Dynamic Dictionary Matching with DAWGs and AC-automata,"20 pages, 4 figures",,10.1016/j.tcs.2018.04.016,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The dictionary matching is a task to find all occurrences of patterns in a
set $D$ (called a dictionary) on a text $T$. The Aho-Corasick-automaton
(AC-automaton) is a data structure which enables us to solve the dictionary
matching problem in $O(d\log\sigma)$ preprocessing time and
$O(n\log\sigma+occ)$ matching time, where $d$ is the total length of the
patterns in $D$, $n$ is the length of the text, $\sigma$ is the alphabet size,
and $occ$ is the total number of occurrences of all the patterns in the text.
The dynamic dictionary matching is a variant where patterns may dynamically be
inserted into and deleted from $D$. This problem is called semi-dynamic
dictionary matching if only insertions are allowed. In this paper, we propose
two efficient algorithms. For a pattern of length $m$, our first algorithm
supports insertions in $O(m\log\sigma+\log d/\log\log d)$ time and pattern
matching in $O(n\log\sigma+occ)$ time for the semi-dynamic setting and supports
both insertions and deletions in $O(\sigma m+\log d/\log\log d)$ time and
pattern matching in $O(n(\log d/\log\log d+\log\sigma)+occ(\log d/\log\log d))$
time for the dynamic setting by some modifications. This algorithm is based on
the directed acyclic word graph. Our second algorithm, which is based on the
AC-automaton, supports insertions in $O(m\log \sigma+u_f+u_o)$ time for the
semi-dynamic setting and supports both insertions and deletions in $O(\sigma
m+u_f+u_o)$ time for the dynamic setting, where $u_f$ and $u_o$ respectively
denote the numbers of states in which the failure function and the output
function need to be updated. This algorithm performs pattern matching in
$O(n\log\sigma+occ)$ time for both settings. Our algorithm achieves optimal
update time for AC-automaton based methods over constant-size alphabets, since
any algorithm which explicitly maintains the AC-automaton requires
$\Omega(m+u_f+u_o)$ update time.
","[{'version': 'v1', 'created': 'Tue, 10 Oct 2017 03:56:33 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Apr 2018 02:14:28 GMT'}, {'version': 'v3', 'created': 'Tue, 10 Apr 2018 00:58:47 GMT'}, {'version': 'v4', 'created': 'Thu, 21 Feb 2019 03:29:53 GMT'}]",2019-02-22,"[['Hendrian', 'Diptarama', ''], ['Inenaga', 'Shunsuke', ''], ['Yoshinaka', 'Ryo', ''], ['Shinohara', 'Ayumi', '']]","['Dynamic dictionary matching', 'AC-automaton', 'DAWG']"
10579,2012.11805,Zijian Li,"Zhifeng Hao, Di Lv, Zijian Li, Ruichu Cai, Wen Wen, Boyan Xu","Semi-Supervised Disentangled Framework for Transferable Named Entity
  Recognition",,,10.1016/j.neunet.2020.11.017,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Named entity recognition (NER) for identifying proper nouns in unstructured
text is one of the most important and fundamental tasks in natural language
processing. However, despite the widespread use of NER models, they still
require a large-scale labeled data set, which incurs a heavy burden due to
manual annotation. Domain adaptation is one of the most promising solutions to
this problem, where rich labeled data from the relevant source domain are
utilized to strengthen the generalizability of a model based on the target
domain. However, the mainstream cross-domain NER models are still affected by
the following two challenges (1) Extracting domain-invariant information such
as syntactic information for cross-domain transfer. (2) Integrating
domain-specific information such as semantic information into the model to
improve the performance of NER. In this study, we present a semi-supervised
framework for transferable NER, which disentangles the domain-invariant latent
variables and domain-specific latent variables. In the proposed framework, the
domain-specific information is integrated with the domain-specific latent
variables by using a domain predictor. The domain-specific and domain-invariant
latent variables are disentangled using three mutual information regularization
terms, i.e., maximizing the mutual information between the domain-specific
latent variables and the original embedding, maximizing the mutual information
between the domain-invariant latent variables and the original embedding, and
minimizing the mutual information between the domain-specific and
domain-invariant latent variables. Extensive experiments demonstrated that our
model can obtain state-of-the-art performance with cross-domain and
cross-lingual NER benchmark data sets.
","[{'version': 'v1', 'created': 'Tue, 22 Dec 2020 02:55:04 GMT'}]",2020-12-23,"[['Hao', 'Zhifeng', ''], ['Lv', 'Di', ''], ['Li', 'Zijian', ''], ['Cai', 'Ruichu', ''], ['Wen', 'Wen', ''], ['Xu', 'Boyan', '']]","['Named Entity Recognition', 'Semi-supervised Learning', 'Transfer']"
10580,1806.06530,Sergiu Deitsch,"Sergiu Deitsch, Claudia Buerhop-Lutz, Evgenii Sovetkin, Ansgar
  Steland, Andreas Maier, Florian Gallwitz, Christian Riess","Segmentation of Photovoltaic Module Cells in Uncalibrated
  Electroluminescence Images",,,10.1007/s00138-021-01191-9,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  High resolution electroluminescence (EL) images captured in the infrared
spectrum allow to visually and non-destructively inspect the quality of
photovoltaic (PV) modules. Currently, however, such a visual inspection
requires trained experts to discern different kinds of defects, which is
time-consuming and expensive. Automated segmentation of cells is therefore a
key step in automating the visual inspection workflow. In this work, we propose
a robust automated segmentation method for extraction of individual solar cells
from EL images of PV modules. This enables controlled studies on large amounts
of data to understanding the effects of module degradation over time-a process
not yet fully understood. The proposed method infers in several steps a
high-level solar module representation from low-level edge features. An
important step in the algorithm is to formulate the segmentation problem in
terms of lens calibration by exploiting the plumbline constraint. We evaluate
our method on a dataset of various solar modules types containing a total of
408 solar cells with various defects. Our method robustly solves this task with
a median weighted Jaccard index of 94.47% and an $F_1$ score of 97.62%, both
indicating a very high similarity between automatically segmented and ground
truth solar cell masks.
","[{'version': 'v1', 'created': 'Mon, 18 Jun 2018 07:38:55 GMT'}, {'version': 'v2', 'created': 'Sun, 9 Dec 2018 20:07:25 GMT'}, {'version': 'v3', 'created': 'Tue, 22 Sep 2020 17:45:11 GMT'}, {'version': 'v4', 'created': 'Mon, 24 May 2021 20:46:34 GMT'}]",2021-05-26,"[['Deitsch', 'Sergiu', ''], ['Buerhop-Lutz', 'Claudia', ''], ['Sovetkin', 'Evgenii', ''], ['Steland', 'Ansgar', ''], ['Maier', 'Andreas', ''], ['Gallwitz', 'Florian', ''], ['Riess', 'Christian', '']]","['PV modules', 'EL imaging', 'visual inspection', 'lens distortion', 'solar cell extraction', 'pixelwiseclassification']"
10581,2009.06027,Mohammad Hadi,Mohammad Abdul Hadi and Fatemeh H Fard,"ReviewViz: Assisting Developers Perform Empirical Study on Energy
  Consumption Related Reviews for Mobile Applications","4 pages, 5 figures",,10.1145/3387905.3388605,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Improving the energy efficiency of mobile applications is a topic that has
gained a lot of attention recently. It has been addressed in a number of ways
such as identifying energy bugs and developing a catalog of energy patterns.
Previous work shows that users discuss the battery-related issues (energy
inefficiency or energy consumption) of the apps in their reviews. However,
there is no work that addresses the automatic extraction of battery-related
issues from users' feedback. In this paper, we report on a visualization tool
that is developed to empirically study machine learning algorithms and text
features to automatically identify the energy consumption specific reviews with
the highest accuracy. Other than the common machine learning algorithms, we
utilize deep learning models with different word embeddings to compare the
results. Furthermore, to help the developers extract the main topics that are
discussed in the reviews, two states of the art topic modeling algorithms are
applied. The visualizations of the topics represent the keywords that are
extracted for each topic along with a comparison with the results of string
matching. The developed web-browser based interactive visualization tool is a
novel framework developed with the intention of giving the app developers
insights about running time and accuracy of machine learning and deep learning
models as well as extracted topics. The tool makes it easier for the developers
to traverse through the extensive result set generated by the text
classification and topic modeling algorithms. The dynamic-data structure used
for the tool stores the baseline-results of the discussed approaches and is
updated when applied on new datasets. The tool is open-sourced to replicate the
research results.
","[{'version': 'v1', 'created': 'Sun, 13 Sep 2020 15:47:46 GMT'}, {'version': 'v2', 'created': 'Sat, 20 Mar 2021 00:26:10 GMT'}]",2021-03-23,"[['Hadi', 'Mohammad Abdul', ''], ['Fard', 'Fatemeh H', '']]","['App review analysis', 'Energy consumption', 'Data-visualization', 'Machine learning', 'Neural networks', 'Topic modeling']"
10582,2105.02420,Joshua Daymude,Joshua J. Daymude and Andr\'ea W. Richa and Christian Scheideler,The Canonical Amoebot Model: Algorithms and Concurrency Control,"48 pages, 7 figures, 2 tables",,10.4230/LIPIcs.DISC.2021.20,,cs.DC cs.ET cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The amoebot model abstracts active programmable matter as a collection of
simple computational elements called amoebots that interact locally to
collectively achieve tasks of coordination and movement. Since its introduction
at SPAA 2014, a growing body of literature has adapted its assumptions for a
variety of problems; however, without a standardized hierarchy of assumptions,
precise systematic comparison of results under the amoebot model is difficult.
We propose the canonical amoebot model, an updated formalization that
distinguishes between core model features and families of assumption variants.
A key improvement addressed by the canonical amoebot model is concurrency. Much
of the existing literature implicitly assumes amoebot actions are isolated and
reliable, reducing analysis to the sequential setting where at most one amoebot
is active at a time. However, real programmable matter systems are concurrent.
The canonical amoebot model formalizes all amoebot communication as message
passing, leveraging adversarial activation models of concurrent executions.
Under this granular treatment of time, we take two complementary approaches to
concurrent algorithm design. We first establish a set of sufficient conditions
for algorithm correctness under any concurrent execution, embedding concurrency
control directly in algorithm design. We then present a concurrency control
framework that uses locks to convert amoebot algorithms that terminate in the
sequential setting and satisfy certain conventions into algorithms that exhibit
equivalent behavior in the concurrent setting. As a case study, we demonstrate
both approaches using a simple algorithm for hexagon formation. Together, the
canonical amoebot model and these complementary approaches to concurrent
algorithm design open new directions for distributed computing research on
programmable matter.
","[{'version': 'v1', 'created': 'Thu, 6 May 2021 03:36:25 GMT'}, {'version': 'v2', 'created': 'Sat, 17 Sep 2022 17:16:59 GMT'}]",2022-09-20,"[['Daymude', 'Joshua J.', ''], ['Richa', 'Andréa W.', ''], ['Scheideler', 'Christian', '']]","['Programmable matter', 'self-organization', 'distributed algorithms', 'concurrency']"
10583,2108.01815,Takao Miki,"Takao Miki, Shinji Nishiwaki","Topology optimization of the support structure for heat dissipation in
  additive manufacturing","29 pages, 12 figures",,10.1016/j.finel.2021.103708,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A support structure is required to successfully create structural parts in
the powder bed fusion process for additive manufacturing. In this study, we
present the topology optimization of a support structure that improves the heat
dissipation in the building process. First, we construct a numerical method
that obtains the temperature field in the building process, represented by the
transient heat conduction phenomenon with the volume heat flux. Next, we
formulate an optimization problem for maximizing heat dissipation and develop
an optimization algorithm that incorporates a level-set-based topology
optimization. A sensitivity of the objective function is derived using the
adjoint variable method. Finally, several numerical examples are provided to
demonstrate the effectiveness and validity of the proposed method.
","[{'version': 'v1', 'created': 'Wed, 4 Aug 2021 02:30:42 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Jan 2022 13:21:56 GMT'}]",2022-01-19,"[['Miki', 'Takao', ''], ['Nishiwaki', 'Shinji', '']]","['Topology optimization', 'Level set method', 'Laser powder bedfusion additive manufacturing', 'Support structure', 'Heat dissipation']"
10584,2208.02629,Johan Lin{\aa}ker,"Johan Lin{\aa}ker, Krzysztof Wnuk",Requirements Analysis and Management for Benefiting Openness,,,10.1109/REW.2016.062,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Requirements Engineering has recently been greatly influenced by the way how
firms use Open Source Software (OSS) and Software Ecosystems (SECOs) as a part
of their product development and business models. This is further emphasized by
the paradigm of Open Innovation, which highlights how firms should strive to
use both internal and external resources to advance their internal innovation
and technology capabilities. The evolution from market-driven requirements
engineering and management processes, has reshaped the understanding of what a
requirement is, and how it is documented and used. In this work, we suggest a
model for analyzing and managing requirements that is designed in the context
of OSS and SECOs, including the advances and challenges that it brings. The
model clarifies how the main stages of requirements engineering and management
processes can be adjusted to benefit from the openness that the new context
offers. We believe that the model is a first step towards the inevitable
adaptation of requirements engineering to an open and informal arena, where
processes and collaboration are decentralized, transparency and governance are
the key success factors.
","[{'version': 'v1', 'created': 'Sun, 31 Jul 2022 19:52:24 GMT'}]",2022-08-05,"[['Linåker', 'Johan', ''], ['Wnuk', 'Krzysztof', '']]","['Open Innovation', 'Open Source Software', 'SoftwareEcosystem', 'Requirements Engineering', 'Requirements Management', 'Software product management']"
10585,2105.00305,Andreas Hessenthaler,"Andreas Hessenthaler, Robert D. Falgout, Jacob B. Schroder, Adelaide
  de Vecchi, David Nordsletten, Oliver R\""ohrle","Time-periodic steady-state solution of fluid-structure interaction and
  cardiac flow problems through multigrid-reduction-in-time",29 pages; 7 pages Supplementary Materials,,10.1016/j.cma.2021.114368,LLNL-JRNL-820515,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a time-periodic MGRIT algorithm is proposed as a means to
reduce the time-to-solution of numerical algorithms by exploiting the time
periodicity inherent to many applications in science and engineering. The
time-periodic MGRIT algorithm is applied to a variety of linear and nonlinear
single- and multiphysics problems that are periodic-in-time. It is demonstrated
that the proposed parallel-in-time algorithm can obtain the same time-periodic
steady-state solution as sequential time-stepping. It is shown that the
required number of MGRIT iterations can be estimated a priori and that the new
MGRIT variant can significantly and consistently reduce the time-to-solution
compared to sequential time-stepping, irrespective of the number of dimensions,
linear or nonlinear PDE models, single-physics or coupled problems and the
employed computing resources. The numerical experiments demonstrate that the
time-periodic MGRIT algorithm enables a greater level of parallelism yielding
faster turnaround, and thus, facilitating more complex and more realistic
problems to be solved.
","[{'version': 'v1', 'created': 'Sat, 1 May 2021 17:13:58 GMT'}, {'version': 'v2', 'created': 'Sun, 9 May 2021 19:25:55 GMT'}, {'version': 'v3', 'created': 'Sun, 14 Nov 2021 16:38:14 GMT'}]",2022-01-12,"[['Hessenthaler', 'Andreas', ''], ['Falgout', 'Robert D.', ''], ['Schroder', 'Jacob B.', ''], ['de Vecchi', 'Adelaide', ''], ['Nordsletten', 'David', ''], ['Röhrle', 'Oliver', '']]","['Time-periodic parallel-in-time solver', 'Multigrid-reduction-in-time (MGRIT)', 'Speedup', 'Fluid-Structure Interaction', 'Analytic Solutions', 'Cardiac flow']"
10586,2106.08024,Max Maass,Max Maass and Marc-Pascal Clement and Matthias Hollick,"Snail Mail Beats Email Any Day: On Effective Operator Security
  Notifications in the Internet","Accepted at The 16th International Conference on Availability,
  Reliability and Security (ARES '21). Code and data:
  https://doi.org/10.5281/zenodo.4817463",,10.1145/3465481.3465743,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the era of large-scale internet scanning, misconfigured websites are a
frequent cause of data leaks and security incidents. Previous research has
investigated sending automated email notifications to operators of insecure or
compromised websites, but has often met with limited success due to challenges
in address data quality, spam filtering, and operator distrust and disinterest.
While several studies have investigated the design and phrasing of notification
emails in a bid to increase their effectiveness, the use of other contact
channels has remained almost completely unexplored due to the required effort
and cost. In this paper, we investigate two methods to increase notification
success: the use of letters as an alternative delivery medium, and the
description of attack scenarios to incentivize remediation. We evaluate these
factors as part of a notification campaign utilizing manually-collected address
information from 1359 German website operators and focusing on unintentional
information leaks from web servers. We find that manually collected addresses
lead to large increases in delivery rates compared to previous work, and
letters were markedly more effective than emails, increasing remediation rates
by up to 25 percentage points. Counterintuitively, providing detailed
descriptions of possible attacks can actually *decrease* remediation rates,
highlighting the need for more research into how notifications are perceived by
recipients.
","[{'version': 'v1', 'created': 'Tue, 15 Jun 2021 10:17:59 GMT'}]",2021-06-16,"[['Maass', 'Max', ''], ['Clement', 'Marc-Pascal', ''], ['Hollick', 'Matthias', '']]","['web security', 'notification study', 'information leakage']"
10587,2203.14278,Shuo Zhang,"Mohamed Trabelsi and Zhiyu Chen and Shuo Zhang and Brian D. Davison
  and Jeff Heflin",StruBERT: Structure-aware BERT for Table Search and Matching,The Proceddings of The ACM Web Conference 2022,,10.1145/3485447.3511972,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A large amount of information is stored in data tables. Users can search for
data tables using a keyword-based query. A table is composed primarily of data
values that are organized in rows and columns providing implicit structural
information. A table is usually accompanied by secondary information such as
the caption, page title, etc., that form the textual information. Understanding
the connection between the textual and structural information is an important
yet neglected aspect in table retrieval as previous methods treat each source
of information independently. In addition, users can search for data tables
that are similar to an existing table, and this setting can be seen as a
content-based table retrieval. In this paper, we propose StruBERT, a
structure-aware BERT model that fuses the textual and structural information of
a data table to produce context-aware representations for both textual and
tabular content of a data table. StruBERT features are integrated in a new
end-to-end neural ranking model to solve three table-related downstream tasks:
keyword- and content-based table retrieval, and table similarity. We evaluate
our approach using three datasets, and we demonstrate substantial improvements
in terms of retrieval and classification metrics over state-of-the-art methods.
","[{'version': 'v1', 'created': 'Sun, 27 Mar 2022 11:24:22 GMT'}]",2022-03-29,"[['Trabelsi', 'Mohamed', ''], ['Chen', 'Zhiyu', ''], ['Zhang', 'Shuo', ''], ['Davison', 'Brian D.', ''], ['Heflin', 'Jeff', '']]","['table matching', 'table search', 'table similarity']"
10588,2101.10473,Kunihiro Wasa,"Kazuhiro Kurita, Kunihiro Wasa",Constant Amortized Time Enumeration of Eulerian trails,,"Theoretical Computer Science,vol. 923, pp. 1--12, 2022",10.1016/j.tcs.2022.04.048,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we consider enumeration problems for edge-distinct and
vertex-distinct Eulerian trails. Here, two Eulerian trails are
\emph{edge-distinct} if the edge sequences are not identical, and they are
\emph{vertex-distinct} if the vertex sequences are not identical. As the main
result, we propose optimal enumeration algorithms for both problems, that is,
these algorithm runs in $\mathcal{O}(N)$ total time, where $N$ is the number of
solutions. Our algorithms are based on the reverse search technique introduced
by [Avis and Fukuda, DAM 1996], and the push out amortization technique
introduced by [Uno, WADS 2015].
","[{'version': 'v1', 'created': 'Mon, 25 Jan 2021 23:36:19 GMT'}]",2023-01-24,"[['Kurita', 'Kazuhiro', ''], ['Wasa', 'Kunihiro', '']]","['Eulerian trail', 'Enumeration algorithm', 'Output-sensitive algorithm', 'Constant Amortized Time']"
10589,1812.10266,Fahri Wisnu Murti,"Fahri Wisnu Murti, Rahmat Faddli Siregar, Muhammad Royyan, Soo Young
  Shin","Exploiting non-orthogonal multiple access in downlink coordinated
  multipoint transmission with the presence of imperfect channel state
  information",Minor Revision Wiley International Journal of Communication Systems,International Journal of Communication Systems. 2020,10.1002/dac.4533,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the impact of imperfect channel state information (CSI) on a
downlink coordinated multipoint (CoMP) transmission system with non-orthogonal
multiple access (NOMA) is investigated since perfect knowledge of a channel can
not be guaranteed in practice. Furthermore, the channel estimation error is
applied to estimate the channel information wherein its priori of variance is
assumed to be known. The impact of the number of coordinated base stations
(BSs) on downlink CoMP NOMA is investigated. Users are classified into one of
two groups according to their position within the cell, namely cell-center user
(CCU) and cell-edge user (CEU). In this paper, ergodic capacity and sum
capacity for both CCU and CEU are derived as closed form. In addition, various
experiments are conducted with different parameters such as SNR, error
variance, and power allocation to show their impact on the CoMP method. The
results show that CoMP NOMA outperforms the CoMP orthogonal multiple access
(OMA) wherein the condition of the channel impacts the performance of CoMP NOMA
less. It is worth noting that a higher number of coordinated BSs enhances the
total capacity of CoMP NOMA. Finally, the performance analysis is validated due
to the close accordance between the analytical and simulation results.
","[{'version': 'v1', 'created': 'Wed, 26 Dec 2018 09:27:16 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Feb 2020 15:06:01 GMT'}]",2020-07-16,"[['Murti', 'Fahri Wisnu', ''], ['Siregar', 'Rahmat Faddli', ''], ['Royyan', 'Muhammad', ''], ['Shin', 'Soo Young', '']]","['CoMP', 'NOMA', 'Ergodic Capacity', 'Perfect CSI', 'Imperfect CSI', 'Channel Estimation Error']"
10590,2012.05397,Dengya Zhu,"Dengya Zhu, Shastri Lakshman Nimmagadda, Torsten Reiners and Amit
  Rudra","An Integrated Search Framework for Leveraging the Knowledge-Based Web
  Ecosystem",,"Australasian Journal of Information Systems, 2020, Vol 24,
  Research Article, pp. 1-24",10.3127/ajis.v24i0.2331,,cs.IR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The explosion of information constrains the judgement of search terms
associated with Knowledge-Based Web Ecosystem (KBWE), making the retrieval of
relevant information and its knowledge management challenging. The existing
information retrieval (IR) tools and their fusion in a framework need
attention, in which search results can effectively be managed. In this article,
we demonstrate the effective use of information retrieval services by a variety
of users and agents in various KBWE scenarios. An innovative Integrated Search
Framework (ISF) is proposed, which utilises crawling strategies, web search
technologies and traditional database search methods. Besides, ISF offers
comprehensive, dynamic, personalized, and organization-oriented information
retrieval services, ranging from the Internet, extranet, intranet, to personal
desktop. In this empirical research, experiments are carried out demonstrating
the improvements in the search process, as discerned in the conceptual ISF. The
experimental results show improved precision compared with other popular search
engines.
","[{'version': 'v1', 'created': 'Thu, 10 Dec 2020 01:32:33 GMT'}]",2020-12-11,"[['Zhu', 'Dengya', ''], ['Nimmagadda', 'Shastri Lakshman', ''], ['Reiners', 'Torsten', ''], ['Rudra', 'Amit', '']]","['integrated search framework', 'information retrieval', 'search engine', 'text classification', 'digital ecosystem', 'information management', 'crawler']"
10591,1704.00801,Luiz Capretz Dr.,Pradeep Waychal and Luiz Fernando Capretz,Need for a Soft Dimension,"3rd International Conference on Software Engineering, Geneva,
  Switzerland, March 2017",,10.5121/csit.2017.70414,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is impossible to separate the human factors from software engineering
expertise during software development, because software is developed by people
and for people. The intangible nature of software has made it a difficult
product to successfully create, and an examination of the many reasons for
major software system failures show that the reasons for failures eventually
come down to human issues. Software developers, immersed as they are in the
technological aspect of the product, can quickly learn lessons from
technological failures and readily come up with solutions to avoid them in the
future, yet they do not learn lessons from human aspects in software
engineering. Dealing with human errors is much more difficult for developers
and often this aspect is overlooked in the evaluation process as developers
move on to issues that they are more comfortable solving. A major reason for
this oversight is that software psychology (the softer side) has not developed
as extensively.
","[{'version': 'v1', 'created': 'Mon, 3 Apr 2017 20:38:25 GMT'}]",2017-04-05,"[['Waychal', 'Pradeep', ''], ['Capretz', 'Luiz Fernando', '']]","['Human Factors in Software Engineering', 'Human Aspects of Engineering', 'Engineering Accreditation']"
10592,2301.08620,Lewin Stein,"Mathias Lemke, Lewin Stein","Adjoint-Based Identification of Sound Sources for Sound Reinforcement
  and Source Localization",,"Notes on Numerical Fluid Mechanics and Multidisciplinary Design,
  vol 145. Springer (2021)",10.1007/978-3-030-52429-6_17,,cs.SD eess.AS physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The identification of sound sources is a common problem in acoustics.
Different parameters are sought, among these are signal and position of the
sources. We present an adjoint-based approach for sound source identification,
which employs computational aeroacoustic techniques. Two different applications
are presented as a proof-of-concept: optimization of a sound reinforcement
setup and the localization of (moving) sound sources.
","[{'version': 'v1', 'created': 'Fri, 20 Jan 2023 15:01:46 GMT'}]",2023-01-23,"[['Lemke', 'Mathias', ''], ['Stein', 'Lewin', '']]","['Computational Aeroacoustics', 'Adjoint Equations', 'SourceIdentification', 'Sound Reinforcement', 'Source Localization']"
10593,2206.00273,Emilio Ancillotti,"Emilio Ancillotti, Carlo Vallati, Raffaele Bruno, Enzo Mingozzi","A reinforcement learning-based link quality estimation strategy for RPL
  and its impact on topology management",,,10.1016/j.comcom.2017.08.005,,cs.NI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Over the last few years, standardisation efforts are consolidating the role
of the Routing Protocol for LowPower and Lossy Networks (RPL) as the standard
routing protocol for IPv6 based Wireless Sensor Networks (WSNs). Although many
core functionalities are well defined, others are left implementation
dependent. Among them, the definition of an efficient link quality estimation
(LQE) strategy is of paramount importance, as it influences significantly both
the quality of the selected network routes and nodes' energy consumption. In
this paper, we present RLProbe, a novel strategy for link quality monitoring in
RPL, which accurately measures link quality with minimal overhead and energy
waste. To achieve this goal, RLProbe leverages both synchronous and
asynchronous monitoring schemes to maintain up-to-date information on link
quality and to promptly react to sudden topology changes, e.g. due to mobility.
Our solution relies on a reinforcement learning model to drive the monitoring
procedures in order to minimise the overhead caused by active probing
operations. The performance of the proposed solution is assessed by means of
simulations and real experiments. Results demonstrated that RLProbe helps in
effectively improving packet loss rates, allowing nodes to promptly react to
link quality variations as well as to link failures due to node mobility.
","[{'version': 'v1', 'created': 'Wed, 1 Jun 2022 07:04:13 GMT'}]",2022-06-02,"[['Ancillotti', 'Emilio', ''], ['Vallati', 'Carlo', ''], ['Bruno', 'Raffaele', ''], ['Mingozzi', 'Enzo', '']]","['RPL', 'topology and mobility management', 'link quality estimation', 'experimental evaluation']"
10594,2107.04521,Pooja Rani,"Pooja Rani, Sebastiano Panichella, Manuel Leuenberger, Andrea Di
  Sorbo, and Oscar Nierstrasz","How to Identify Class Comment Types? A Multi-language Approach for Class
  Comment Classification","25 pages, 10 figures, 8 tables",,10.1016/j.jss.2021.111047,,cs.SE cs.PL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Most software maintenance and evolution tasks require developers to
understand the source code of their software systems. Software developers
usually inspect class comments to gain knowledge about program behavior,
regardless of the programming language they are using. Unfortunately, (i)
different programming languages present language-specific code commenting
notations/guidelines; and (ii) the source code of software projects often lacks
comments that adequately describe the class behavior, which complicates program
comprehension and evolution activities.
  To handle these challenges, this paper investigates the different
language-specific class commenting practices of three programming languages:
Python, Java, and Smalltalk. In particular, we systematically analyze the
similarities and differences of the information types found in class comments
of projects developed in these languages.
  We propose an approach that leverages two techniques, namely Natural Language
Processing and Text Analysis, to automatically identify various types of
information from class comments i.e., the specific types of semantic
information found in class comments. To the best of our knowledge, no previous
work has provided a comprehensive taxonomy of class comment types for these
three programming languages with the help of a common automated approach. Our
results confirm that our approach can classify frequent class comment
information types with high accuracy for Python, Java, and Smalltalk
programming languages. We believe this work can help to monitor and assess the
quality and evolution of code comments in different program languages, and thus
support maintenance and evolution tasks.
","[{'version': 'v1', 'created': 'Fri, 9 Jul 2021 16:12:39 GMT'}, {'version': 'v2', 'created': 'Sun, 25 Jul 2021 11:56:10 GMT'}]",2021-07-27,"[['Rani', 'Pooja', ''], ['Panichella', 'Sebastiano', ''], ['Leuenberger', 'Manuel', ''], ['Di Sorbo', 'Andrea', ''], ['Nierstrasz', 'Oscar', '']]","['Natural Language Processing Technique', 'Code Comment Analysis', 'Software Documentation']"
10595,1401.1460,Jan Rochel,Clemens Grabmayer and Jan Rochel,Maximal Sharing in the Lambda Calculus with letrec,"18 pages, plus 19 pages appendix",,10.1145/2628136.2628148,,cs.PL,http://creativecommons.org/licenses/publicdomain/,"  Increasing sharing in programs is desirable to compactify the code, and to
avoid duplication of reduction work at run-time, thereby speeding up execution.
We show how a maximal degree of sharing can be obtained for programs expressed
as terms in the lambda calculus with letrec. We introduce a notion of `maximal
compactness' for lambda-letrec-terms among all terms with the same infinite
unfolding. Instead of defined purely syntactically, this notion is based on a
graph semantics. lambda-letrec-terms are interpreted as first-order term graphs
so that unfolding equivalence between terms is preserved and reflected through
bisimilarity of the term graph interpretations. Compactness of the term graphs
can then be compared via functional bisimulation.
  We describe practical and efficient methods for the following two problems:
transforming a lambda-letrec-term into a maximally compact form; and deciding
whether two lambda-letrec-terms are unfolding-equivalent. The transformation of
a lambda-letrec-term $L$ into maximally compact form $L_0$ proceeds in three
steps:
  (i) translate L into its term graph $G = [[ L ]]$; (ii) compute the maximally
shared form of $G$ as its bisimulation collapse $G_0$; (iii) read back a
lambda-letrec-term $L_0$ from the term graph $G_0$ with the property $[[ L_0 ]]
= G_0$. This guarantees that $L_0$ and $L$ have the same unfolding, and that
$L_0$ exhibits maximal sharing.
  The procedure for deciding whether two given lambda-letrec-terms $L_1$ and
$L_2$ are unfolding-equivalent computes their term graph interpretations $[[
L_1 ]]$ and $[[ L_2 ]]$, and checks whether these term graphs are bisimilar.
  For illustration, we also provide a readily usable implementation.
","[{'version': 'v1', 'created': 'Tue, 7 Jan 2014 18:01:41 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Jan 2014 14:42:02 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Apr 2014 12:46:41 GMT'}, {'version': 'v4', 'created': 'Thu, 17 Apr 2014 13:05:03 GMT'}, {'version': 'v5', 'created': 'Mon, 23 Jun 2014 21:41:15 GMT'}]",2015-12-04,"[['Grabmayer', 'Clemens', ''], ['Rochel', 'Jan', '']]","['Lambda Calculus with letrec', 'unfolding semantics', 'subterm sharing', 'maximal sharing', 'higher-order term graphs']"
10596,2212.00891,Ian McQuillan,"Oscar H. Ibarra, Jozef Jir\'asek, Ian McQuillan, and Luca Prigioniero",Space Complexity of Stack Automata Models,"23 pages, 1 figure, 2 tables","International Journal of Foundations of Computer Science, 32 (6),
  801--823 (2021)",10.1142/S0129054121420090,,cs.FL,http://creativecommons.org/licenses/by/4.0/,"  This paper examines several measures of space complexity of variants of stack
automata: non-erasing stack automata and checking stack automata. These
measures capture the minimum stack size required to accept every word in the
language of the automaton (weak measure), the maximum stack size used in any
accepting computation on any accepted word (accept measure),and the maximum
stack size used in any computation (strong measure). We give a detailed
characterization of the accept and strong space complexity measures for
checking stack automata. Exactly one of three cases can occur: the complexity
is either bounded by a constant, behaves like a linear function, or it can not
be bounded by any function of the length of the input word (and it is decidable
which case occurs). However, this result does not hold for non-erasing stack
automata; we provide an example where the space complexity grows proportionally
to the square root of the length of the input. Furthermore, we study the
complexity bounds of machines which accept a given language, and decidability
of space complexity properties.
","[{'version': 'v1', 'created': 'Thu, 1 Dec 2022 22:16:42 GMT'}]",2022-12-05,"[['Ibarra', 'Oscar H.', ''], ['Jirásek', 'Jozef', ''], ['McQuillan', 'Ian', ''], ['Prigioniero', 'Luca', '']]","['checking stack automata', 'stack automata', 'pushdown automata', 'space complexity', 'machine models']"
10597,2107.07301,Yudai Tanabe,"Yudai Tanabe (Tokyo Institute of Technology, Japan), Luthfan Anshar
  Lubis (Tokyo Institute of Technology, Japan), Tomoyuki Aotani (Mamezou,
  Japan), Hidehiko Masuhara (Tokyo Institute of Technology, Japan)",A Functional Programming Language with Versions,,"The Art, Science, and Engineering of Programming, 2022, Vol. 6,
  Issue 1, Article 5",10.22152/programming-journal.org/2022/6/5,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While modern software development heavily uses versioned packages,
programming languages rarely support the concept of versions in their
semantics, which makes software updates more bulky and unsafe. This paper
proposes a programming language that intrinsically supports versions. The main
goals are to design core language features to support multiple versions in one
program and establish a proper notion of type safety with those features. The
proposed core calculus, called Lambda VL, has versioned values, each containing
different values under different versions. We show the construction of the type
system as an extension of coeffect calculus by mapping versions to
computational resources. The type system guarantees the existence of a valid
combination of versions for a program. The calculus enables programming
languages to use multiple versions of a package within a program. It will serve
as a basis for designing advanced language features like module systems and
semantic versioning.
","[{'version': 'v1', 'created': 'Thu, 15 Jul 2021 13:05:54 GMT'}]",2021-07-16,"[['Tanabe', 'Yudai', '', 'Tokyo Institute of Technology, Japan'], ['Lubis', 'Luthfan Anshar', '', 'Tokyo Institute of Technology, Japan'], ['Aotani', 'Tomoyuki', '', 'Mamezou,\n  Japan'], ['Masuhara', 'Hidehiko', '', 'Tokyo Institute of Technology, Japan']]","['program evolution', 'dependencies', 'software product lines', 'graded modal types', 'coefects']"
10598,2106.11227,Lanyu Shang,"Lanyu Shang, Yang Zhang, Daniel Zhang, Dong Wang","FauxWard: A Graph Neural Network Approach to Fauxtography Detection
  Using Social Media Comments",,"Soc. Netw. Anal. Min. 10, 76 (2020)",10.1007/s13278-020-00689-w,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Online social media has been a popular source for people to consume and share
news content. More recently, the spread of misinformation online has caused
widespread concerns. In this work, we focus on a critical task of detecting
fauxtography on social media where the image and associated text together
convey misleading information. Many efforts have been made to mitigate
misinformation online, but we found that the fauxtography problem has not been
fully addressed by existing work. Solutions focusing on detecting fake images
or misinformed texts alone on social media often fail to identify the
misinformation delivered together by the image and the associated text of a
fauxtography post. In this paper, we develop FauxWard, a novel graph
convolutional neural network framework that explicitly explores the complex
information extracted from a user comment network of a social media post to
effectively identify fauxtography. FauxWard is content-free in the sense that
it does not analyze the visual or textual contents of the post itself, which
makes it robust against sophisticated fauxtography uploaders who intentionally
craft image-centric posts by editing either the text or image content. We
evaluate FauxWard on two real-world datasets collected from mainstream social
media platforms (i.e., Reddit and Twitter). The results show that FauxWard is
both effective and efficient in identifying fauxtography posts on social media.
","[{'version': 'v1', 'created': 'Mon, 21 Jun 2021 16:13:44 GMT'}]",2021-06-22,"[['Shang', 'Lanyu', ''], ['Zhang', 'Yang', ''], ['Zhang', 'Daniel', ''], ['Wang', 'Dong', '']]","['Fauxtography', 'Misinformation', 'Social Media', 'Fake News', 'GraphNeural Network']"
10599,2212.11471,Yali Du,"Yali Du, Yinwei Wei, Wei Ji, Fan Liu, Xin Luo and Liqiang Nie",Multi-queue Momentum Contrast for Microvideo-Product Retrieval,"Proceedings of the Sixteenth ACM International Conference on Web
  Search and Data Mining (WSDM '23), February 27-March 3, 2023, Singapore,
  Singapore",,10.1145/3539597.3570405,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The booming development and huge market of micro-videos bring new e-commerce
channels for merchants. Currently, more micro-video publishers prefer to embed
relevant ads into their micro-videos, which not only provides them with
business income but helps the audiences to discover their interesting products.
However, due to the micro-video recording by unprofessional equipment,
involving various topics and including multiple modalities, it is challenging
to locate the products related to micro-videos efficiently, appropriately, and
accurately. We formulate the microvideo-product retrieval task, which is the
first attempt to explore the retrieval between the multi-modal and multi-modal
instances.
  A novel approach named Multi-Queue Momentum Contrast (MQMC) network is
proposed for bidirectional retrieval, consisting of the uni-modal feature and
multi-modal instance representation learning. Moreover, a discriminative
selection strategy with a multi-queue is used to distinguish the importance of
different negatives based on their categories. We collect two large-scale
microvideo-product datasets (MVS and MVS-large) for evaluation and manually
construct the hierarchical category ontology, which covers sundry products in
daily life. Extensive experiments show that MQMC outperforms the
state-of-the-art baselines. Our replication package (including code, dataset,
etc.) is publicly available at https://github.com/duyali2000/MQMC.
","[{'version': 'v1', 'created': 'Thu, 22 Dec 2022 03:47:14 GMT'}]",2022-12-23,"[['Du', 'Yali', ''], ['Wei', 'Yinwei', ''], ['Ji', 'Wei', ''], ['Liu', 'Fan', ''], ['Luo', 'Xin', ''], ['Nie', 'Liqiang', '']]","['Datasets', 'Momentum Contrast', 'Multi-Modal Retrieval', 'MicrovideoProduct', 'Multi-Queue']"
10600,2001.05961,Sagar Joglekar,"Sagar Joglekar, Daniele Quercia, Miriam Redi, Luca Maria Aiello,
  Tobias Kauer, Nishanth Sastry",FaceLift: A transparent deep learning framework to beautify urban scenes,,,10.1098/rsos.190987,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  In the area of computer vision, deep learning techniques have recently been
used to predict whether urban scenes are likely to be considered beautiful: it
turns out that these techniques are able to make accurate predictions. Yet they
fall short when it comes to generating actionable insights for urban design. To
support urban interventions, one needs to go beyond predicting beauty, and
tackle the challenge of recreating beauty. Unfortunately, deep learning
techniques have not been designed with that challenge in mind. Given their
""black-box nature"", these models cannot be directly used to explain why a
particular urban scene is deemed to be beautiful. To partly fix that, we
propose a deep learning framework called Facelift, that is able to both
beautify existing urban scenes (Google Street views) and explain which urban
elements make those transformed scenes beautiful. To quantitatively evaluate
our framework, we cannot resort to any existing metric (as the research problem
at hand has never been tackled before) and need to formulate new ones. These
new metrics should ideally capture the presence/absence of elements that make
urban spaces great. Upon a review of the urban planning literature, we identify
five main metrics: walkability, green spaces, openness, landmarks and visual
complexity. We find that, across all the five metrics, the beautified scenes
meet the expectations set by the literature on what great spaces tend to be
made of. This result is further confirmed by a 20-participant expert survey in
which FaceLift have been found to be effective in promoting citizen
participation. All this suggests that, in the future, as our framework's
components are further researched and become better and more sophisticated, it
is not hard to imagine technologies that will be able to accurately and
efficiently support architects and planners in the design of spaces we
intuitively love.
","[{'version': 'v1', 'created': 'Thu, 16 Jan 2020 17:48:24 GMT'}]",2020-01-17,"[['Joglekar', 'Sagar', ''], ['Quercia', 'Daniele', ''], ['Redi', 'Miriam', ''], ['Aiello', 'Luca Maria', ''], ['Kauer', 'Tobias', ''], ['Sastry', 'Nishanth', '']]","['Deep learning', 'Urban Design', 'Generative models', 'Urban beauty', 'Explainable models']"
10601,1712.03366,Panagiotis Michailidis,Panagiotis D. Michailidis,"An Efficient Multi-core Implementation of the Jaya Optimisation
  Algorithm","This is an Accepted Manuscript of an article published by Taylor &
  Francis Group in the International Journal of Parallel, Emergent &
  Distributed Systems",,10.1080/17445760.2017.1416387,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this work, we propose a hybrid parallel Jaya optimisation algorithm for a
multi-core environment with the aim of solving large-scale global optimisation
problems. The proposed algorithm is called HHCPJaya, and combines the
hyper-population approach with the hierarchical cooperation search mechanism.
The HHCPJaya algorithm divides the population into many small subpopulations,
each of which focuses on a distinct block of the original population
dimensions. In the hyper-population approach, we increase the small
subpopulations by assigning more than one subpopulation to each core, and each
subpopulation evolves independently to enhance the explorative and exploitative
nature of the population. We combine this hyper-population approach with the
two-level hierarchical cooperative search scheme to find global solutions from
all subpopulations. Furthermore, we incorporate an additional updating phase on
the respective subpopulations based on global solutions, with the aim of
further improving the convergence rate and the quality of solutions. Several
experiments applying the proposed parallel algorithm in different settings
prove that it demonstrates sufficient promise in terms of the quality of
solutions and the convergence rate. Furthermore, a relatively small
computational effort is required to solve complex and large-scale optimisation
problems.
","[{'version': 'v1', 'created': 'Sat, 9 Dec 2017 09:50:59 GMT'}]",2017-12-25,"[['Michailidis', 'Panagiotis D.', '']]","['parallel computing', 'Jaya algorithm', 'global optimisation', 'stochasticoptimisation', 'OpenMP']"
10602,2008.02078,Mahesh Chandra,Mahesh Chandra,"A Novel Method for Scalable VLSI Implementation of Hyperbolic Tangent
  Function","arXiv admin note: text overlap with arXiv:2007.11976 and
  arXiv:2007.13516",IEEE Design and Test; 2021,10.1109/MDAT.2021.3063308,,cs.AR eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hyperbolic tangent and Sigmoid functions are used as non-linear activation
units in the artificial and deep neural networks. Since, these networks are
computationally expensive, customized accelerators are designed for achieving
the required performance at lower cost and power. The activation function and
MAC units are the key building blocks of these neural networks. A low
complexity and accurate hardware implementation of the activation function is
required to meet the performance and area targets of such neural network
accelerators. Moreover, a scalable implementation is required as the recent
studies show that the DNNs may use different precision in different layers.
This paper presents a novel method based on trigonometric expansion properties
of the hyperbolic function for hardware implementation which can be easily
tuned for different accuracy and precision requirements.
","[{'version': 'v1', 'created': 'Mon, 27 Jul 2020 04:57:08 GMT'}]",2021-03-05,"[['Chandra', 'Mahesh', '']]","['Neural network', 'Hyperbolic tangent', 'nonlinear']"
10603,2106.11916,Akram Alofi,"Akram Alofi, Mahmoud A. Bokhari, Robert Hendley, Rami Bahsoon","Selecting Miners within Blockchain-based Systems Using Evolutionary
  Algorithms for Energy Optimisation","To appear in 2021 Genetic and Evolutionary Computation Conference
  Companion (GECCO '21 Companion), July 10--14, 2021, Lille, France",,10.1145/3449726.3459558,,cs.NE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this paper, we represent the problem of selecting miners within a
blockchain-based system as a subset selection problem. We formulate the problem
of minimising blockchain energy consumption as an optimisation problem with two
conflicting objectives: energy consumption and trust. The proposed model is
compared across different algorithms to demonstrate its performance.
","[{'version': 'v1', 'created': 'Sun, 6 Jun 2021 00:00:41 GMT'}]",2021-06-23,"[['Alofi', 'Akram', ''], ['Bokhari', 'Mahmoud A.', ''], ['Hendley', 'Robert', ''], ['Bahsoon', 'Rami', '']]","['Blockchain', 'Mining', 'Optimisation', 'Evolutionary Algorithms']"
10604,1908.08020,Leo Cazenille Dr,Leo Cazenille,"Comparing reliability of grid-based Quality-Diversity algorithms using
  artificial landscapes","3 pages, 2 figures","Genetic and Evolutionary Computation Conference Companion (GECCO
  '19 Companion), July 13--17, 2019, Prague, Czech Republic",10.1145/3319619.3321895,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quality-Diversity (QD) algorithms are a recent type of optimisation methods
that search for a collection of both diverse and high performing solutions.
They can be used to effectively explore a target problem according to features
defined by the user. However, the field of QD still does not possess extensive
methodologies and reference benchmarks to compare these algorithms. We propose
a simple benchmark to compare the reliability of QD algorithms by optimising
the Rastrigin function, an artificial landscape function often used to test
global optimisation methods.
","[{'version': 'v1', 'created': 'Tue, 23 Jul 2019 03:08:08 GMT'}]",2019-08-22,"[['Cazenille', 'Leo', '']]","['Quality-Diversity', 'Unconstrained Optimisation', 'Exploration', 'MAP-Elites']"
10605,2103.03809,Xuezixiang Li,"Xuezixiang Li, Qu Yu, Heng Yin",PalmTree: Learning an Assembly Language Model for Instruction Embedding,,,10.1145/3460120.3484587,,cs.LG cs.AI cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning has demonstrated its strengths in numerous binary analysis
tasks, including function boundary detection, binary code search, function
prototype inference, value set analysis, etc. When applying deep learning to
binary analysis tasks, we need to decide what input should be fed into the
neural network model. More specifically, we need to answer how to represent an
instruction in a fixed-length vector. The idea of automatically learning
instruction representations is intriguing, however the existing schemes fail to
capture the unique characteristics of disassembly. These schemes ignore the
complex intra-instruction structures and mainly rely on control flow in which
the contextual information is noisy and can be influenced by compiler
optimizations.
  In this paper, we propose to pre-train an assembly language model called
PalmTree for generating general-purpose instruction embeddings by conducting
self-supervised training on large-scale unlabeled binary corpora. PalmTree
utilizes three pre-training tasks to capture various characteristics of
assembly language. These training tasks overcome the problems in existing
schemes, thus can help to generate high-quality representations. We conduct
both intrinsic and extrinsic evaluations, and compare PalmTree with other
instruction embedding schemes. PalmTree has the best performance for intrinsic
metrics, and outperforms the other instruction embedding schemes for all
downstream tasks.
","[{'version': 'v1', 'created': 'Thu, 21 Jan 2021 22:30:01 GMT'}, {'version': 'v2', 'created': 'Fri, 7 May 2021 19:48:48 GMT'}, {'version': 'v3', 'created': 'Tue, 14 Sep 2021 04:15:28 GMT'}]",2021-09-15,"[['Li', 'Xuezixiang', ''], ['Yu', 'Qu', ''], ['Yin', 'Heng', '']]","['Deep Learning', 'Binary Analysis', 'Language Model', 'RepresentationLearning']"
10606,cs/0703147,Maurice Margenstern,Maurice Margenstern,The finite tiling problem is undecidable in the hyperbolic plane,,"The Finite Tiling Problem Is Undecidable in the Hyperbolic Plane,
  International Journal of Foundations of Computer Science, 19(4), (2008),
  971-982",10.1142/S0129054108006078,,cs.CG cs.DM,,"  In this paper, we consider the finite tiling problem which was proved
undecidable in the Euclidean plane by Jarkko Kari in 1994. Here, we prove that
the same problem for the hyperbolic plane is also undecidable.
","[{'version': 'v1', 'created': 'Thu, 29 Mar 2007 14:23:59 GMT'}]",2009-07-07,"[['Margenstern', 'Maurice', '']]","['hyperbolic plane', 'tilings', 'finite tiling problem']"
10607,2204.01787,Zhenyu Tang,"Zhenyu Tang, Rohith Aralikatti, Anton Ratnarajah, Dinesh Manocha",GWA: A Large High-Quality Acoustic Dataset for Audio Processing,,,10.1145/3528233.3530731,,cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the Geometric-Wave Acoustic (GWA) dataset, a large-scale audio
dataset of about 2 million synthetic room impulse responses (IRs) and their
corresponding detailed geometric and simulation configurations. Our dataset
samples acoustic environments from over 6.8K high-quality diverse and
professionally designed houses represented as semantically labeled 3D meshes.
We also present a novel real-world acoustic materials assignment scheme based
on semantic matching that uses a sentence transformer model. We compute
high-quality impulse responses corresponding to accurate low-frequency and
high-frequency wave effects by automatically calibrating geometric acoustic
ray-tracing with a finite-difference time-domain wave solver. We demonstrate
the higher accuracy of our IRs by comparing with recorded IRs from complex
real-world environments. Moreover, we highlight the benefits of GWA on audio
deep learning tasks such as automated speech recognition, speech enhancement,
and speech separation. This dataset is the first data with accurate wave
acoustic simulations in complex scenes. Codes and data are available at
https://gamma.umd.edu/pro/sound/gwa.
","[{'version': 'v1', 'created': 'Mon, 4 Apr 2022 18:34:33 GMT'}, {'version': 'v2', 'created': 'Sun, 8 May 2022 22:09:39 GMT'}, {'version': 'v3', 'created': 'Mon, 20 Jun 2022 22:14:38 GMT'}]",2022-06-22,"[['Tang', 'Zhenyu', ''], ['Aralikatti', 'Rohith', ''], ['Ratnarajah', 'Anton', ''], ['Manocha', 'Dinesh', '']]","['Acoustic simulation', 'geometric sound propagation', 'audio dataset']"
10608,2110.13187,Igor Sfiligoi,"Igor Sfiligoi, Frank W\""urthwein and Diego Davila",Data intensive physics analysis in Azure cloud,"11 pages, 5 figures, to be published in proceedings of ICOCBI 2021","Lecture Notes on Data Engineering and Communications Technologies,
  vol 117. Springer, Singapore. 2022",10.1007/978-981-19-0898-9_20,,cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The Compact Muon Solenoid (CMS) experiment at the Large Hadron Collider (LHC)
is one of the largest data producers in the scientific world, with standard
data products centrally produced, and then used by often competing teams within
the collaboration. This work is focused on how a local institution, University
of California San Diego (UCSD), partnered with the Open Science Grid (OSG) to
use Azure cloud resources to augment its available computing to accelerate time
to results for multiple analyses pursued by a small group of collaborators. The
OSG is a federated infrastructure allowing many independent resource providers
to serve many independent user communities in a transparent manner.
Historically the resources would come from various research institutions,
spanning small universities to large HPC centers, based on either community
needs or grant allocations, so adding commercial clouds as resource providers
is a natural evolution. The OSG technology allows for easy integration of cloud
resources, but the data-intensive nature of CMS compute jobs required the
deployment of additional data caching infrastructure to ensure high efficiency.
","[{'version': 'v1', 'created': 'Mon, 25 Oct 2021 18:11:43 GMT'}]",2022-12-20,"[['Sfiligoi', 'Igor', ''], ['Würthwein', 'Frank', ''], ['Davila', 'Diego', '']]","['Cloud', 'OSG', 'data caching', 'physics']"
10609,2110.02691,Dongho Lee,"Dongho Lee, Valentin Perrelle, Beno\^it Valiron and Zhaowei Xu","Concrete Categorical Model of a Quantum Circuit Description Language
  with Measurement",accepted for publication in FSTTCS 2021,,10.4230/LIPIcs.FSTTCS.2021.51,,cs.LO quant-ph,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we introduce dynamic lifting to a quantum circuit-description
language, following the Proto-Quipper language approach. Dynamic lifting allows
programs to transfer the result of measuring quantum data -- qubits -- into
classical data -- booleans -- . We propose a type system and an operational
semantics for the language and we state safety properties. Next, we introduce a
concrete categorical semantics for the proposed language, basing our approach
on a recent model from Rios\&Selinger for Proto-Quipper-M. Our approach is to
construct on top of a concrete category of circuits with measurements a Kleisli
category, capturing as a side effect the action of retrieving classical content
out of a quantum memory. We then show a soundness result for this semantics.
","[{'version': 'v1', 'created': 'Wed, 6 Oct 2021 12:29:03 GMT'}]",2022-02-04,"[['Lee', 'Dongho', ''], ['Perrelle', 'Valentin', ''], ['Valiron', 'Benoît', ''], ['Xu', 'Zhaowei', '']]","['Categorical semantics', 'Operational semantics', 'Quantum circuit descriptionlanguage']"
10610,2201.02460,Christian Ponte-Fern\'andez,"Christian Ponte-Fern\'andez (1), Jorge Gonz\'alez-Dom\'inguez (1) and
  Mar\'ia J. Mart\'in (1) ((1) Universidade da Coru\~na, CITIC, Computer
  Architecture Group, 15071 A Coru\~na, Spain)","A SIMD algorithm for the detection of epistatic interactions of any
  order","Submitted to Future Generation Computer Systems. Codes used are
  available at https://github.com/UDC-GAC/fiuncho",Future Generation Computer Systems 132 (2022) 108-123,10.1016/j.future.2022.02.009,,cs.DC cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Epistasis is a phenomenon in which a phenotype outcome is determined by the
interaction of genetic variation at two or more loci and it cannot be
attributed to the additive combination of effects corresponding to the
individual loci. Although it has been more than 100 years since William Bateson
introduced this concept, it still is a topic under active research. Locating
epistatic interactions is a computationally expensive challenge that involves
analyzing an exponentially growing number of combinations. Authors in this
field have resorted to a multitude of hardware architectures in order to speed
up the search, but little to no attention has been paid to the vector
instructions that current CPUs include in their instruction sets. This work
extends an existing third-order exhaustive algorithm to support the search of
epistasis interactions of any order and discusses multiple SIMD implementations
of the different functions that compose the search using Intel AVX Intrinsics.
Results using the GCC and the Intel compiler show that the 512-bit explicit
vector implementation proposed here performs the best out of all of the other
implementations evaluated. The proposed 512-bit vectorization accelerates the
original implementation of the algorithm by an average factor of 7 and 12, for
GCC and the Intel Compiler, respectively, in the scenarios tested.
","[{'version': 'v1', 'created': 'Fri, 7 Jan 2022 14:18:40 GMT'}]",2022-03-03,"[['Ponte-Fernández', 'Christian', ''], ['González-Domínguez', 'Jorge', ''], ['Martín', 'María J.', '']]","['Epistasis', 'Genetic Interaction', 'SIMD', 'Vectorization', 'AVX']"
10611,2108.04343,Maryem Rhanoui,Siham Yousfi and Maryem Rhanoui and Dalila Chiadmi,"Towards a Generic Multimodal Architecture for Batch and Streaming Big
  Data Integration",,"Journal of Computer Science, Volume 15 No. 1, 2019, 207-220",10.3844/jcssp.2019.207.220,,cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Big Data are rapidly produced from various heterogeneous data sources. They
are of different types (text, image, video or audio) and have different levels
of reliability and completeness. One of the most interesting architectures that
deal with the large amount of emerging data at high velocity is called the
lambda architecture. In fact, it combines two different processing layers
namely batch and speed layers, each providing specific views of data while
ensuring robustness, fast and scalable data processing. However, most papers
dealing with the lambda architecture are focusing one single type of data
generally produced by a single data source. Besides, the layers of the
architecture are implemented independently, or, at best, are combined to
perform basic processing without assessing either the data reliability or
completeness. Therefore, inspired by the lambda architecture, we propose in
this paper a generic multimodal architecture that combines both batch and
streaming processing in order to build a complete, global and accurate insight
in near-real-time based on the knowledge extracted from multiple heterogeneous
Big Data sources. Our architecture uses batch processing to analyze the data
structures and contents, build the learning models and calculate the
reliability index of the involved sources, while the streaming processing uses
the built-in models of the batch layer to immediately process incoming data and
rapidly provide results. We validate our architecture in the context of urban
traffic management systems in order to detect congestions.
","[{'version': 'v1', 'created': 'Mon, 9 Aug 2021 20:50:01 GMT'}]",2021-08-11,"[['Yousfi', 'Siham', ''], ['Rhanoui', 'Maryem', ''], ['Chiadmi', 'Dalila', '']]","['Big Data Integration', 'Lambda Architecture', 'Heterogeneous Data', 'Urban Traffic Management Systems']"
10612,2106.15166,Taekho You,"Taekho You, Jinseo Park, June Young Lee, Jinhyuk Yun, Woo-Sung Jung",Disturbance of questionable publishing to academia,"16 pages of main text including 4 figures + 42 pages of supplementary
  information including 38 supplementary figures","Journal of Informetrics, 2022, 16(2), 101294",10.1016/j.joi.2022.101294,,cs.DL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Questionable publications have been accused of ""greedy"" practices; however,
their influence on academia has not been gauged. Here, we probe the impact of
questionable publications through a systematic and comprehensive analysis with
various participants from academia and compare the results with those of their
unaccused counterparts using billions of citation records, including liaisons,
i.e., journals and publishers, and prosumers, i.e., authors. Questionable
publications attribute publisher-level self-citations to their journals while
limiting journal-level self-citations; yet, conventional journal-level metrics
are unable to detect these publisher-level self-citations. We propose a hybrid
journal-publisher metric for detecting self-favouring citations among QJs from
publishers. Additionally, we demonstrate that the questionable publications
were less disruptive and influential than their counterparts. Our findings
indicate an inflated citation impact of suspicious academic publishers. The
findings provide a basis for actionable policy-making against questionable
publications.
","[{'version': 'v1', 'created': 'Tue, 29 Jun 2021 08:26:39 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Jul 2021 07:42:56 GMT'}, {'version': 'v3', 'created': 'Mon, 7 Mar 2022 02:41:34 GMT'}, {'version': 'v4', 'created': 'Tue, 19 Apr 2022 13:18:20 GMT'}]",2022-05-10,"[['You', 'Taekho', ''], ['Park', 'Jinseo', ''], ['Lee', 'June Young', ''], ['Yun', 'Jinhyuk', ''], ['Jung', 'Woo-Sung', '']]","['predatory', 'greedy publishing', 'controlled experiment', 'citation impact', 'scienceof science']"
10613,1601.03271,Andr\'es Ezequiel Viso,"Andr\'es Viso, Eduardo Bonelli, Mauricio Ayala-Rinc\'on",Type Soundness for Path Polymorphism,,,10.1016/j.entcs.2016.06.015,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Path polymorphism is the ability to define functions that can operate
uniformly over arbitrary recursively specified data structures. Its essence is
captured by patterns of the form $x\,y$ which decompose a compound data
structure into its parts. Typing these kinds of patterns is challenging since
the type of a compound should determine the type of its components. We propose
a static type system (i.e. no run-time analysis) for a pattern calculus that
captures this feature. Our solution combines type application, constants as
types, union types and recursive types. We address the fundamental properties
of Subject Reduction and Progress that guarantee a well-behaved dynamics. Both
these results rely crucially on a notion of pattern compatibility and also on a
coinductive characterisation of subtyping.
","[{'version': 'v1', 'created': 'Wed, 13 Jan 2016 14:47:49 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Apr 2016 15:12:12 GMT'}]",2020-06-30,"[['Viso', 'Andrés', ''], ['Bonelli', 'Eduardo', ''], ['Ayala-Rincón', 'Mauricio', '']]","['λ-Calculus', 'Pattern Matching', 'Path Polymorphism', 'Static Typing']"
10614,2010.07027,Chaoyang Wang,"Chaoyang Wang, Zhiqiang Guo, Guohui Li, Jianjun Li, Peng Pan, Ke Liu","A Light Heterogeneous Graph Collaborative Filtering Model using Textual
  Information",Accepted by Knowledge-Based Systems,Knowledge-Based Systems (2021),10.1016/j.knosys.2021.107602,,cs.IR cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Due to the development of graph neural networks, graph-based representation
learning methods have made great progress in recommender systems. However, data
sparsity is still a challenging problem that most graph-based recommendation
methods are confronted with. Recent works try to address this problem by
utilizing side information. In this paper, we exploit the relevant and easily
accessible textual information by advanced natural language processing (NLP)
models and propose a light RGCN-based (RGCN, relational graph convolutional
network) collaborative filtering method on heterogeneous graphs. Specifically,
to incorporate rich textual knowledge, we utilize a pre-trained NLP model to
initialize the embeddings of text nodes. Afterward, by performing a simplified
RGCN-based node information propagation on the constructed heterogeneous graph,
the embeddings of users and items can be adjusted with textual knowledge, which
effectively alleviates the negative effects of data sparsity. Moreover, the
matching function used by most graph-based representation learning methods is
the inner product, which is not appropriate for the obtained embeddings that
contain complex semantics. We design a predictive network that combines
graph-based representation learning with neural matching function learning, and
demonstrate that this architecture can bring a significant performance
improvement. Extensive experiments are conducted on three publicly available
datasets, and the results verify the superior performance of our method over
several baselines.
","[{'version': 'v1', 'created': 'Sun, 4 Oct 2020 11:10:37 GMT'}, {'version': 'v2', 'created': 'Thu, 6 May 2021 15:22:51 GMT'}, {'version': 'v3', 'created': 'Thu, 14 Oct 2021 14:22:29 GMT'}, {'version': 'v4', 'created': 'Fri, 15 Oct 2021 00:49:52 GMT'}, {'version': 'v5', 'created': 'Fri, 22 Oct 2021 07:26:03 GMT'}]",2021-10-25,"[['Wang', 'Chaoyang', ''], ['Guo', 'Zhiqiang', ''], ['Li', 'Guohui', ''], ['Li', 'Jianjun', ''], ['Pan', 'Peng', ''], ['Liu', 'Ke', '']]","['Recommender system', 'Collaborative filtering', 'Textual information', 'Heterogeneous graph', 'Graph neural network', 'Matching function']"
10615,2103.04668,Rion Brattig Correia,Tiago Simas and Rion Brattig Correia and Luis M. Rocha,The distance backbone of complex networks,To appear in the Journal of Complex Networks,"Journal of Complex Networks, Volume 9, Issue 6, December 2021,
  cnab021",10.1093/comnet/cnab021,,cs.SI cs.DS cs.IR q-bio.QM,http://creativecommons.org/licenses/by-sa/4.0/,"  Redundancy needs more precise characterization as it is a major factor in the
evolution and robustness of networks of multivariate interactions. We
investigate the complexity of such interactions by inferring a connection
transitivity that includes all possible measures of path length for weighted
graphs. The result, without breaking the graph into smaller components, is a
distance backbone subgraph sufficient to compute all shortest paths. This is
important for understanding the dynamics of spread and communication phenomena
in real-world networks. The general methodology we formally derive yields a
principled graph reduction technique and provides a finer characterization of
the triangular geometry of all edges -- those that contribute to shortest paths
and those that do not but are involved in other network phenomena. We
demonstrate that the distance backbone is very small in large networks across
domains ranging from air traffic to the human brain connectome, revealing that
network robustness to attacks and failures seems to stem from surprisingly vast
amounts of redundancy.
","[{'version': 'v1', 'created': 'Mon, 8 Mar 2021 11:08:59 GMT'}, {'version': 'v2', 'created': 'Tue, 11 May 2021 16:24:33 GMT'}]",2021-10-25,"[['Simas', 'Tiago', ''], ['Correia', 'Rion Brattig', ''], ['Rocha', 'Luis M.', '']]","['Complex Systems', 'Network Backbones', 'Redundancy', 'Shortest Paths']"
10616,2202.06588,Rui Wu,"Rui Wu, Zhaopeng Qiu, Jiacheng Jiang, Guilin Qi, Xian Wu",Conditional Generation Net for Medication Recommendation,11 pages. To be published at The Web Conference 2022 (WWW 2022),,10.1145/3485447.3511936,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Medication recommendation targets to provide a proper set of medicines
according to patients' diagnoses, which is a critical task in clinics.
Currently, the recommendation is manually conducted by doctors. However, for
complicated cases, like patients with multiple diseases at the same time, it's
difficult to propose a considerate recommendation even for experienced doctors.
This urges the emergence of automatic medication recommendation which can help
treat the diagnosed diseases without causing harmful drug-drug interactions.Due
to the clinical value, medication recommendation has attracted growing research
interests.Existing works mainly formulate medication recommendation as a
multi-label classification task to predict the set of medicines. In this paper,
we propose the Conditional Generation Net (COGNet) which introduces a novel
copy-or-predict mechanism to generate the set of medicines. Given a patient,
the proposed model first retrieves his or her historical diagnoses and
medication recommendations and mines their relationship with current diagnoses.
Then in predicting each medicine, the proposed model decides whether to copy a
medicine from previous recommendations or to predict a new one. This process is
quite similar to the decision process of human doctors. We validate the
proposed model on the public MIMIC data set, and the experimental results show
that the proposed model can outperform state-of-the-art approaches.
","[{'version': 'v1', 'created': 'Mon, 14 Feb 2022 10:16:41 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Feb 2022 03:28:06 GMT'}]",2022-02-21,"[['Wu', 'Rui', ''], ['Qiu', 'Zhaopeng', ''], ['Jiang', 'Jiacheng', ''], ['Qi', 'Guilin', ''], ['Wu', 'Xian', '']]","['medication recommendation', 'electronic health record', 'generation']"
10617,2109.05078,Muhammad Monjurul Karim,"Muhammad Monjurul Karim, Ruwen Qin, Zhaozheng Yin, Genda Chen","A semi-supervised self-training method to develop assistive intelligence
  for segmenting multiclass bridge elements from inspection videos",Published in Structural Health Monitoring,"Structural Health Monitoring, May 2021",10.1177/14759217211010422,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Bridge inspection is an important step in preserving and rehabilitating
transportation infrastructure for extending their service lives. The
advancement of mobile robotic technology allows the rapid collection of a large
amount of inspection video data. However, the data are mainly images of complex
scenes, wherein a bridge of various structural elements mix with a cluttered
background. Assisting bridge inspectors in extracting structural elements of
bridges from the big complex video data, and sorting them out by classes, will
prepare inspectors for the element-wise inspection to determine the condition
of bridges. This paper is motivated to develop an assistive intelligence model
for segmenting multiclass bridge elements from inspection videos captured by an
aerial inspection platform. With a small initial training dataset labeled by
inspectors, a Mask Region-based Convolutional Neural Network (Mask R-CNN)
pre-trained on a large public dataset was transferred to the new task of
multiclass bridge element segmentation. Besides, the temporal coherence
analysis attempts to recover false negatives and identify the weakness that the
neural network can learn to improve. Furthermore, a semi-supervised
self-training (S$^3$T) method was developed to engage experienced inspectors in
refining the network iteratively. Quantitative and qualitative results from
evaluating the developed deep neural network demonstrate that the proposed
method can utilize a small amount of time and guidance from experienced
inspectors (3.58 hours for labeling 66 images) to build the network of
excellent performance (91.8% precision, 93.6% recall, and 92.7% f1-score).
Importantly, the paper illustrates an approach to leveraging the domain
knowledge and experiences of bridge professionals into computational
intelligence models to efficiently adapt the models to varied bridges in the
National Bridge Inventory.
","[{'version': 'v1', 'created': 'Fri, 10 Sep 2021 19:22:45 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Sep 2021 01:16:09 GMT'}]",2021-09-15,"[['Karim', 'Muhammad Monjurul', ''], ['Qin', 'Ruwen', ''], ['Yin', 'Zhaozheng', ''], ['Chen', 'Genda', '']]","['Transfer learning', 'temporal coherence', 'self-training', 'active learning', 'human-in-the-loop', 'AI-human collaboration', 'bridgeinspection', 'multiclass segmentation']"
10618,2010.14211,Laksh Bhatia,"Laksh Bhatia, Michael Breza, Ramona Marfievici, Julie A. McCann",Dataset: LoED: The LoRaWAN at the Edge Dataset,"Accepted for publication at The 3rd International SenSys+BuildSys
  Workshop on Data: Acquisition to Analysis (DATA '20)",,10.1145/3419016.3431491,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the LoRaWAN at the Edge Dataset (LoED), an open LoRaWAN
packet dataset collected at gateways. Real-world LoRaWAN datasets are important
for repeatable sensor-network and communications research and evaluation as, if
carefully collected, they provide realistic working assumptions. LoED data is
collected from nine gateways over a four month period in a dense urban
environment. The dataset contains packet header information and all physical
layer properties reported by gateways such as the CRC, RSSI, SNR and spreading
factor. Files are provided to analyse the data and get aggregated statistics.
The dataset is available at: doi.org/10.5281/zenodo.4121430
","[{'version': 'v1', 'created': 'Tue, 27 Oct 2020 11:40:33 GMT'}]",2020-10-28,"[['Bhatia', 'Laksh', ''], ['Breza', 'Michael', ''], ['Marfievici', 'Ramona', ''], ['McCann', 'Julie A.', '']]","['datasets', 'lorawan', 'gateways', 'urban environment']"
10619,2109.02993,Shahroz Tariq,Hasam Khalid and Minha Kim and Shahroz Tariq and Simon S. Woo,"Evaluation of an Audio-Video Multimodal Deepfake Dataset using Unimodal
  and Multimodal Detectors","2 Figures, 2 Tables, Accepted for publication at the 1st Workshop on
  Synthetic Multimedia - Audiovisual Deepfake Generation and Detection (ADGD
  '21) at ACM MM 2021",,10.1145/3476099.3484315,,cs.CV cs.MM cs.SD eess.AS eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Significant advancements made in the generation of deepfakes have caused
security and privacy issues. Attackers can easily impersonate a person's
identity in an image by replacing his face with the target person's face.
Moreover, a new domain of cloning human voices using deep-learning technologies
is also emerging. Now, an attacker can generate realistic cloned voices of
humans using only a few seconds of audio of the target person. With the
emerging threat of potential harm deepfakes can cause, researchers have
proposed deepfake detection methods. However, they only focus on detecting a
single modality, i.e., either video or audio. On the other hand, to develop a
good deepfake detector that can cope with the recent advancements in deepfake
generation, we need to have a detector that can detect deepfakes of multiple
modalities, i.e., videos and audios. To build such a detector, we need a
dataset that contains video and respective audio deepfakes. We were able to
find a most recent deepfake dataset, Audio-Video Multimodal Deepfake Detection
Dataset (FakeAVCeleb), that contains not only deepfake videos but synthesized
fake audios as well. We used this multimodal deepfake dataset and performed
detailed baseline experiments using state-of-the-art unimodal, ensemble-based,
and multimodal detection methods to evaluate it. We conclude through detailed
experimentation that unimodals, addressing only a single modality, video or
audio, do not perform well compared to ensemble-based methods. Whereas purely
multimodal-based baselines provide the worst performance.
","[{'version': 'v1', 'created': 'Tue, 7 Sep 2021 11:00:20 GMT'}]",2021-09-08,"[['Khalid', 'Hasam', ''], ['Kim', 'Minha', ''], ['Tariq', 'Shahroz', ''], ['Woo', 'Simon S.', '']]","['Datasets', 'Measurement', 'Deepfakes', 'Multimodal', 'Media Forensics']"
10620,1506.04849,Vandana Jindal,"Vandana Jindal, A.K.Verma and Seema Bawa","Green WSN- Optimization of Energy Use Through Reduction in Communication
  Workload","11 pages, 6 Figures, 3 Tables","IJFCST ISSN: 1839-7662 May 2015, Volume 5, Number 3 pg 57-69",10.5121/ijfcst.2015.5305,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Applications of Wireless Sensor Networks (WSNs) are growing day by day due to
the ease of deployment, reduction in costs to affordable levels and versatility
of these networks. Besides developing advanced micro fabrication technologies
means are being devised to reduce energy consumption to bring the network setup
and operational costs down. With increasing applications amount of energy
consumed in these networks is enormous. Even a small savings in energy
consumption will result in huge benefits in energy consumption globally. Bulk
of the energy is consumed in communication activity of these networks. It is
our endeavor to optimize this activity to make these networks energy efficient
and thereby reducing their impact on the overall environment in line with the
principle Go Green.
","[{'version': 'v1', 'created': 'Tue, 16 Jun 2015 06:46:42 GMT'}]",2015-06-17,"[['Jindal', 'Vandana', ''], ['Verma', 'A. K.', ''], ['Bawa', 'Seema', '']]","['Wireless Sensor Network (WSN)', 'Query Optimization', 'MEMS', 'one shot queries', 'continuous queries', 'epoch', 'static variables']"
10621,2011.12445,Jing Yang,"Jing Yang, Chun Ouyang, Wil M.P. van der Aalst, Arthur H.M. ter
  Hofstede, Yang Yu","OrgMining 2.0: A Novel Framework for Organizational Model Mining from
  Event Logs","Manuscript initially submitted for review on 13/5/2020 with 38 pages,
  10 figures, 11 tables","Decision Support Systems, 158, 113771 (2022)",10.1016/j.dss.2022.113771,,cs.DB cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Providing appropriate structures around human resources can streamline
operations and thus facilitate the competitiveness of an organization. To
achieve this goal, modern organizations need to acquire an accurate and timely
understanding of human resource grouping while faced with an ever-changing
environment. The use of process mining offers a promising way to help address
the need through utilizing event log data stored in information systems. By
extracting knowledge about the actual behavior of resources participating in
business processes from event logs, organizational models can be constructed,
which facilitate the analysis of the de facto grouping of human resources
relevant to process execution. Nevertheless, open research gaps remain to be
addressed when applying the state-of-the-art process mining to analyze resource
grouping. For one, the discovery of organizational models has only limited
connections with the context of process execution. For another, a rigorous
solution that evaluates organizational models against event log data is yet to
be proposed. In this paper, we aim to tackle these research challenges by
developing a novel framework built upon a richer definition of organizational
models coupling resource grouping with process execution knowledge. By
introducing notions of conformance checking for organizational models, the
framework allows effective evaluation of organizational models, and therefore
provides a foundation for analyzing and improving resource grouping based on
event logs. We demonstrate the feasibility of this framework by proposing an
approach underpinned by the framework for organizational model discovery, and
also conduct experiments on real-life event logs to discover and evaluate
organizational models.
","[{'version': 'v1', 'created': 'Tue, 24 Nov 2020 23:46:47 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Nov 2020 02:15:39 GMT'}]",2022-08-05,"[['Yang', 'Jing', ''], ['Ouyang', 'Chun', ''], ['van der Aalst', 'Wil M. P.', ''], ['ter Hofstede', 'Arthur H. M.', ''], ['Yu', 'Yang', '']]","['event log', 'organizational model', 'process mining', 'conformance checking']"
10622,1910.11097,Neofytos Dimitriou,"Neofytos Dimitriou, Ognjen Arandjelovi\'c, Peter D Caie",Deep Learning for Whole Slide Image Analysis: An Overview,,,10.3389/fmed.2019.00264,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The widespread adoption of whole slide imaging has increased the demand for
effective and efficient gigapixel image analysis. Deep learning is at the
forefront of computer vision, showcasing significant improvements over previous
methodologies on visual understanding. However, whole slide images have
billions of pixels and suffer from high morphological heterogeneity as well as
from different types of artefacts. Collectively, these impede the conventional
use of deep learning. For the clinical translation of deep learning solutions
to become a reality, these challenges need to be addressed. In this paper, we
review work on the interdisciplinary attempt of training deep neural networks
using whole slide images, and highlight the different ideas underlying these
methodologies.
","[{'version': 'v1', 'created': 'Fri, 18 Oct 2019 17:53:42 GMT'}]",2021-12-14,"[['Dimitriou', 'Neofytos', ''], ['Arandjelović', 'Ognjen', ''], ['Caie', 'Peter D', '']]","['digital pathology', 'computer vision', 'oncology', 'cancer', 'machine learning', 'personalised pathology', 'image analysis']"
10623,2103.02777,Shoko Imaizumi,"Kotoko Hiraoka, Kensuke Fukumoto, Takashi Yamazoe, Norimichi Tsumura,
  Satoshi Kaneko, Wataru Arai, Shoko Imaizumi","Application of Reversible Data Hiding for Printing with Special Color
  Inks to Preserve Compatibility with Normal Printing",8 pages,"IEEJ Trans. Electr. Inf. & Syst., vol.141, no.2, pp.155-162,
  February 2021",10.1541/ieejeiss.141.155,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an efficient framework with compatibility between normal printing
and printing with special color inks in this paper. Special color inks can be
used for printing to represent some particular colors and specific optical
properties, which are difficult to express using only CMYK inks. Special color
layers are required in addition to the general color layer for printing with
special color inks. We introduce a reversible data hiding (RDH) method to embed
the special color layers into the general color layer without visible
artifacts. The proposed method can realize both normal printing and printing
with special color inks by using a single layer. Our experimental results show
that the quality of the marked image is virtually identical to that of the
original image, i.e., the general color layer.
","[{'version': 'v1', 'created': 'Thu, 4 Mar 2021 00:58:53 GMT'}]",2021-03-05,"[['Hiraoka', 'Kotoko', ''], ['Fukumoto', 'Kensuke', ''], ['Yamazoe', 'Takashi', ''], ['Tsumura', 'Norimichi', ''], ['Kaneko', 'Satoshi', ''], ['Arai', 'Wataru', ''], ['Imaizumi', 'Shoko', '']]","['Printing with special color ink', 'compatibility', 'reversible data hiding', 'histogram shifting', 'JBIG2 compression']"
10624,2006.08481,Ahmet-Serdar Karakaya,"Ahmet-Serdar Karakaya, Jonathan Hasenburg and David Bermbach","SimRa: Using Crowdsourcing to Identify Near Miss Hotspots in Bicycle
  Traffic",Accepted for publication in Elsevier Pervasive and Mobile Computing,,10.1016/j.pmcj.2020.101197,,cs.CY cs.DC cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  An increased modal share of bicycle traffic is a key mechanism to reduce
emissions and solve traffic-related problems. However, a lack of (perceived)
safety keeps people from using their bikes more frequently. To improve safety
in bicycle traffic, city planners need an overview of accidents, near miss
incidents, and bike routes. Such information, however, is currently not
available. In this paper, we describe SimRa, a platform for collecting data on
bicycle routes and near miss incidents using smartphone-based crowdsourcing. We
also describe how we identify dangerous near miss hotspots based on the
collected data and propose a scoring model.
","[{'version': 'v1', 'created': 'Mon, 15 Jun 2020 15:29:52 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Jul 2020 07:46:40 GMT'}]",2020-07-07,"[['Karakaya', 'Ahmet-Serdar', ''], ['Hasenburg', 'Jonathan', ''], ['Bermbach', 'David', '']]","['Bicycle safety', 'Bicycle traffic', 'Crowdsourcing', 'Near missincident']"
10625,1703.10861,Kazuhiro Ichikawa,"Kazuhiro Ichikawa (The University of Tokyo, Japan), Shigeru Chiba (The
  University of Tokyo, Japan)","User-Defined Operators Including Name Binding for New Language
  Constructs",,"The Art, Science, and Engineering of Programming, 2017, Vol. 1,
  Issue 2, Article 15",10.22152/programming-journal.org/2017/1/15,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  User-defined syntax extensions are useful to implement an embedded domain
specific language (EDSL) with good code-readability. They allow EDSL authors to
define domain-natural notation, which is often different from the host language
syntax. Nowadays, there are several research works of powerful user-defined
syntax extensions. One promising approach uses user-defined operators. A
user-defined operator is a function with user-defined syntax. It can be
regarded as a syntax extension implemented without macros. An advantage of
user-defined operators is that an operator can be statically typed. The
compiler can find type errors in the definition of an operator before the
operator is used. In addition, the compiler can resolve syntactic ambiguities
by using static types. However, user-defined operators are difficult to
implement language constructs involving static name binding. Name binding is
association between names and values (or memory locations). Our inquiry is
whether we can design a system for user-defined operators involving a new
custom name binding. This paper proposes a module system for user-defined
operators named a dsl class. A dsl class is similar to a normal class in Java
but it contains operators instead of methods. We use operators for implementing
custom name binding. For example, we use a nullary operator for emulating a
variable name. An instance of a dsl class, called a dsl object, reifies an
environment that expresses name binding. Programmers can control a scope of
instance operators by specifying where the dsl object is active. We extend the
host type system so that it can express the activation of a dsl object. In our
system, a bound name is propagated through a type parameter to a dsl object.
This enables us to implement user-defined language constructs involving static
name binding. A contribution of this paper is that we reveal we can integrate a
system for managing names and their scopes with a module and type system of an
object-oriented language like Java. This allows us to implement a proposed
system by adopting eager disambiguation based on expected types so that the
compilation time will be acceptable. Eager disambiguation, which prunes out
semantically invalid abstract parsing trees (ASTs) while a parser is running,
is needed because the parser may generate a huge number of potentially valid
ASTs for the same source code. We have implemented ProteaJ2, which is a
programming language based on Java and it supports our proposal. We describe a
parsing method that adopts eager disambiguation for fast parsing and discuss
its time complexity. To show the practicality of our proposal, we have
conducted two micro benchmarks to see the performance of our compiler. We also
show several use cases of dsl classes for demonstrating dsl classes can express
various language constructs. Our ultimate goal is to let programmers add any
kind of new language construct to a host language. To do this, programmers
should be able to define new syntax, name binding, and type system within the
host language. This paper shows programmers can define the former two: their
own syntax and name binding.
","[{'version': 'v1', 'created': 'Fri, 31 Mar 2017 11:46:39 GMT'}]",2017-04-03,"[['Ichikawa', 'Kazuhiro', '', 'The University of Tokyo, Japan'], ['Chiba', 'Shigeru', '', 'The\n  University of Tokyo, Japan']]","['user-defined operators', 'syntaxtic extensions', 'language constructs']"
10626,2104.13196,Sotirios Katsikeas,"Sotirios Katsikeas, Pontus Johnson, Mathias Ekstedt, Robert
  Lagerstr\""om","Research Communities in cyber security: A Comprehensive Literature
  Review",arXiv admin note: text overlap with arXiv:0803.0476 by other authors,,10.1016/j.cosrev.2021.100431,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In order to provide a coherent overview of cyber security research, the
Scopus academic abstract and citation database was mined to create a citation
graph of 98,373 authors active in the field between 1949 and early 2020. The
Louvain community detection algorithm was applied to the graph in order to
identify existing research communities. The analysis discovered twelve
top-level communities: access control, authentication, biometrics, cryptography
(I & II), cyber-physical systems, information hiding, intrusion detection,
malwares, quantum cryptography, sensor networks, and usable security. These
top-level communities were in turn composed of a total of 80 sub-communities.
The analysis results are presented for each community in descriptive text,
sub-community graphs, and tables with, for example, the most-cited papers and
authors. A comparison between the detected communities and topical areas
defined by other related work, is also presented, demonstrating a greater
researcher emphasis on cryptography, quantum cryptography, information hiding
and biometrics, at the expense of laws and regulation, risk management and
governance, and security software lifecycle.
","[{'version': 'v1', 'created': 'Thu, 22 Apr 2021 14:53:01 GMT'}]",2022-06-08,"[['Katsikeas', 'Sotirios', ''], ['Johnson', 'Pontus', ''], ['Ekstedt', 'Mathias', ''], ['Lagerström', 'Robert', '']]","['Security', 'Clustering', 'Community', 'Systematic Literature']"
10627,1506.06021,Emilio Ferrara,"Emilio Ferrara, Zeyao Yang",Measuring Emotional Contagion in Social Media,"10 pages, 5 figures","PloS one, 10(11), e0142390. 2015",10.1371/journal.pone.0142390,,cs.SI cs.LG physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media are used as main discussion channels by millions of individuals
every day. The content individuals produce in daily social-media-based
micro-communications, and the emotions therein expressed, may impact the
emotional states of others. A recent experiment performed on Facebook
hypothesized that emotions spread online, even in absence of non-verbal cues
typical of in-person interactions, and that individuals are more likely to
adopt positive or negative emotions if these are over-expressed in their social
network. Experiments of this type, however, raise ethical concerns, as they
require massive-scale content manipulation with unknown consequences for the
individuals therein involved. Here, we study the dynamics of emotional
contagion using Twitter. Rather than manipulating content, we devise a null
model that discounts some confounding factors (including the effect of
emotional contagion). We measure the emotional valence of content the users are
exposed to before posting their own tweets. We determine that on average a
negative post follows an over-exposure to 4.34% more negative content than
baseline, while positive posts occur after an average over-exposure to 4.50%
more positive contents. We highlight the presence of a linear relationship
between the average emotional valence of the stimuli users are exposed to, and
that of the responses they produce. We also identify two different classes of
individuals: highly and scarcely susceptible to emotional contagion. Highly
susceptible users are significantly less inclined to adopt negative emotions
than the scarcely susceptible ones, but equally likely to adopt positive
emotions. In general, the likelihood of adopting positive emotions is much
greater than that of negative emotions.
","[{'version': 'v1', 'created': 'Fri, 19 Jun 2015 14:29:24 GMT'}]",2017-03-07,"[['Ferrara', 'Emilio', ''], ['Yang', 'Zeyao', '']]","['computational social science', 'social media', 'sentiment analysis', 'emotional contagion']"
10628,1907.03709,Alberto F. Mart\'in,"Santiago Badia, Alberto F. Mart\'in, Eric Neiva, Francesc Verdugo","A generic finite element framework on parallel tree-based adaptive
  meshes",,,10.1137/20M1328786,,cs.MS cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we formally derive and prove the correctness of the algorithms
and data structures in a parallel, distributed-memory, generic finite element
framework that supports h-adaptivity on computational domains represented as
forest-of-trees. The framework is grounded on a rich representation of the
adaptive mesh suitable for generic finite elements that is built on top of a
low-level, light-weight forest-of-trees data structure handled by a
specialized, highly parallel adaptive meshing engine, for which we have
identified the requirements it must fulfill to be coupled into our framework.
Atop this two-layered mesh representation, we build the rest of data structures
required for the numerical integration and assembly of the discrete system of
linear equations. We consider algorithms that are suitable for both
subassembled and fully-assembled distributed data layouts of linear system
matrices. The proposed framework has been implemented within the FEMPAR
scientific software library, using p4est as a practical forest-of-octrees
demonstrator. A strong scaling study of this implementation when applied to
Poisson and Maxwell problems reveals remarkable scalability up to 32.2K CPU
cores and 482.2M degrees of freedom. Besides, a comparative performance study
of FEMPAR and the state-of-the-art deal.ii finite element software shows at
least comparative performance, and at most factor 2-3 improvements in the
h-adaptive approximation of a Poisson problem with first- and second-order
Lagrangian finite elements, respectively.
","[{'version': 'v1', 'created': 'Mon, 8 Jul 2019 16:30:39 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Apr 2020 15:06:02 GMT'}]",2021-09-30,"[['Badia', 'Santiago', ''], ['Martín', 'Alberto F.', ''], ['Neiva', 'Eric', ''], ['Verdugo', 'Francesc', '']]","['Partial Differential Equations', 'Finite Elements', 'Adaptive Mesh Refinement', 'Forest of Trees', 'Parallelalgorithms', 'Scientific Software']"
10629,1904.08166,Julian Stier,"Julian Stier, Gabriele Gianini, Michael Granitzer, Konstantin Ziegler",Analysing Neural Network Topologies: a Game Theoretic Approach,,Procedia Computer Science 126 (2018): 234-243,10.1016/j.procs.2018.07.257,,cs.AI cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Artificial Neural Networks have shown impressive success in very different
application cases. Choosing a proper network architecture is a critical
decision for a network's success, usually done in a manual manner. As a
straightforward strategy, large, mostly fully connected architectures are
selected, thereby relying on a good optimization strategy to find proper
weights while at the same time avoiding overfitting. However, large parts of
the final network are redundant. In the best case, large parts of the network
become simply irrelevant for later inferencing. In the worst case, highly
parameterized architectures hinder proper optimization and allow the easy
creation of adverserial examples fooling the network. A first step in removing
irrelevant architectural parts lies in identifying those parts, which requires
measuring the contribution of individual components such as neurons. In
previous work, heuristics based on using the weight distribution of a neuron as
contribution measure have shown some success, but do not provide a proper
theoretical understanding. Therefore, in our work we investigate game theoretic
measures, namely the Shapley value (SV), in order to separate relevant from
irrelevant parts of an artificial neural network. We begin by designing a
coalitional game for an artificial neural network, where neurons form
coalitions and the average contributions of neurons to coalitions yield to the
Shapley value. In order to measure how well the Shapley value measures the
contribution of individual neurons, we remove low-contributing neurons and
measure its impact on the network performance. In our experiments we show that
the Shapley value outperforms other heuristics for measuring the contribution
of neurons.
","[{'version': 'v1', 'created': 'Wed, 17 Apr 2019 10:28:21 GMT'}]",2019-04-18,"[['Stier', 'Julian', ''], ['Gianini', 'Gabriele', ''], ['Granitzer', 'Michael', ''], ['Ziegler', 'Konstantin', '']]","['Neural networks', 'Shapley value', 'Topology optimization', 'Neural network pruning']"
10630,2009.12115,Mario Kahlhofer,"Mario Kahlhofer, Michael H\""olzl, Andreas Berger","Towards Reconstructing Multi-Step Cyber Attacks in Modern Cloud
  Environments with Tripwires","To be published in European Interdisciplinary Cybersecurity
  Conference (EICC 2020)",,10.1145/3424954.3424968,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rapidly-changing cloud environments that consist of heavily interconnected
components are difficult to secure. Existing solutions often try to correlate
many weak indicators to identify and reconstruct multi-step cyber attacks. The
lack of a true, causal link between most of these indicators still leaves
administrators with a lot of false-positives to browse through. We argue that
cyber deception can improve the precision of attack detection systems, if used
in a structured, and automatic way, i.e., in the form of so-called tripwires
that ultimately span an attack graph, which assists attack reconstruction
algorithms. This paper proposes an idea for a framework that combines cyber
deception, automatic tripwire injection and attack graphs, which eventually
enables us to reconstruct multi-step cyber attacks in modern cloud
environments.
","[{'version': 'v1', 'created': 'Fri, 25 Sep 2020 10:33:02 GMT'}]",2020-09-28,"[['Kahlhofer', 'Mario', ''], ['Hölzl', 'Michael', ''], ['Berger', 'Andreas', '']]","['multi-step cyber attacks', 'intrusion detection', 'cyber deception', 'cyberkill-chain', 'attack graphs', 'honeypots', 'honeytokens', 'tripwires']"
10631,2208.02498,Jose Gonz\'alez-Abad,"Jose Gonz\'alez-Abad, \'Alvaro L\'opez Garc\'ia, Valentin Y. Kozlov","A Container-Based Workflow for Distributed Training of Deep Learning
  Algorithms in HPC Clusters","This version of the article has been accepted for publication but is
  not the Version of Record and does not reflect post-acceptance improvements,
  or any corrections. The Version of Record is available online at:
  https://doi.org/10.1007/s10586-022-03798-7",,10.1007/s10586-022-03798-7,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Deep learning has been postulated as a solution for numerous problems in
different branches of science. Given the resource-intensive nature of these
models, they often need to be executed on specialized hardware such graphical
processing units (GPUs) in a distributed manner. In the academic field,
researchers get access to this kind of resources through High Performance
Computing (HPC) clusters. This kind of infrastructures make the training of
these models difficult due to their multi-user nature and limited user
permission. In addition, different HPC clusters may possess different
peculiarities that can entangle the research cycle (e.g., libraries
dependencies). In this paper we develop a workflow and methodology for the
distributed training of deep learning models in HPC clusters which provides
researchers with a series of novel advantages. It relies on udocker as
containerization tool and on Horovod as library for the distribution of the
models across multiple GPUs. udocker does not need any special permission,
allowing researchers to run the entire workflow without relying on any
administrator. Horovod ensures the efficient distribution of the training
independently of the deep learning framework used. Additionally, due to
containerization and specific features of the workflow, it provides researchers
with a cluster-agnostic way of running their models. The experiments carried
out show that the workflow offers good scalability in the distributed training
of the models and that it easily adapts to different clusters.
","[{'version': 'v1', 'created': 'Thu, 4 Aug 2022 07:13:28 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Nov 2022 09:22:46 GMT'}]",2022-11-15,"[['González-Abad', 'Jose', ''], ['García', 'Álvaro López', ''], ['Kozlov', 'Valentin Y.', '']]","['Distributed Training', 'Deep Learning', 'High PerformanceComputing', 'udocker', 'Docker', 'Horovod']"
10632,2203.00003,Minglang Yin,Minglang Yin and Enrui Zhang and Yue Yu and George Em Karniadakis,"Interfacing Finite Elements with Deep Neural Operators for Fast
  Multiscale Modeling of Mechanics Problems",,,10.1016/j.cma.2022.115027,,cs.CE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multiscale modeling is an effective approach for investigating multiphysics
systems with largely disparate size features, where models with different
resolutions or heterogeneous descriptions are coupled together for predicting
the system's response. The solver with lower fidelity (coarse) is responsible
for simulating domains with homogeneous features, whereas the expensive
high-fidelity (fine) model describes microscopic features with refined
discretization, often making the overall cost prohibitively high, especially
for time-dependent problems. In this work, we explore the idea of multiscale
modeling with machine learning and employ DeepONet, a neural operator, as an
efficient surrogate of the expensive solver. DeepONet is trained offline using
data acquired from the fine solver for learning the underlying and possibly
unknown fine-scale dynamics. It is then coupled with standard PDE solvers for
predicting the multiscale systems with new boundary/initial conditions in the
coupling stage. The proposed framework significantly reduces the computational
cost of multiscale simulations since the DeepONet inference cost is negligible,
facilitating readily the incorporation of a plurality of interface conditions
and coupling schemes. We present various benchmarks to assess accuracy and
speedup, and in particular we develop a coupling algorithm for a time-dependent
problem, and we also demonstrate coupling of a continuum model (finite element
methods, FEM) with a neural operator representation of a particle system
(Smoothed Particle Hydrodynamics, SPH) for a uniaxial tension problem with
hyperelastic material. What makes this approach unique is that a well-trained
over-parametrized DeepONet can generalize well and make predictions at a
negligible cost.
","[{'version': 'v1', 'created': 'Fri, 25 Feb 2022 20:46:08 GMT'}]",2022-12-07,"[['Yin', 'Minglang', ''], ['Zhang', 'Enrui', ''], ['Yu', 'Yue', ''], ['Karniadakis', 'George Em', '']]","['Machine Learning', 'Neural Operator', 'DeepONet', 'Concurrent Multiscale Coupling', 'Finite Ele']"
10633,1810.02959,Ryan Rossi,"Aldo G. Carranza, Ryan A. Rossi, Anup Rao, Eunyee Koh",Higher-order Spectral Clustering for Heterogeneous Graphs,,,10.1145/3394486.3403045,,cs.SI cs.LG math.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Higher-order connectivity patterns such as small induced sub-graphs called
graphlets (network motifs) are vital to understand the important components
(modules/functional units) governing the configuration and behavior of complex
networks. Existing work in higher-order clustering has focused on simple
homogeneous graphs with a single node/edge type. However, heterogeneous graphs
consisting of nodes and edges of different types are seemingly ubiquitous in
the real-world. In this work, we introduce the notion of typed-graphlet that
explicitly captures the rich (typed) connectivity patterns in heterogeneous
networks. Using typed-graphlets as a basis, we develop a general principled
framework for higher-order clustering in heterogeneous networks. The framework
provides mathematical guarantees on the optimality of the higher-order
clustering obtained. The experiments demonstrate the effectiveness of the
framework quantitatively for three important applications including (i)
clustering, (ii) link prediction, and (iii) graph compression. In particular,
the approach achieves a mean improvement of 43x over all methods and graphs for
clustering while achieving a 18.7% and 20.8% improvement for link prediction
and graph compression, respectively.
","[{'version': 'v1', 'created': 'Sat, 6 Oct 2018 08:34:07 GMT'}]",2020-09-15,"[['Carranza', 'Aldo G.', ''], ['Rossi', 'Ryan A.', ''], ['Rao', 'Anup', ''], ['Koh', 'Eunyee', '']]","['Clustering', 'higher-order clustering', 'heterogeneous networks', 'typedgraphlets', 'network motifs', 'spectral clustering', 'node embedding', 'graph mining']"
10634,2203.16280,Caihua Shan,"Shifu Yan, Caihua Shan, Wenyi Yang, Bixiong Xu, Dongsheng Li, Lili
  Qiu, Jie Tong, Qi Zhang",CMMD: Cross-Metric Multi-Dimensional Root Cause Analysis,,,10.1145/3534678.3539109,,cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In large-scale online services, crucial metrics, a.k.a., key performance
indicators (KPIs), are monitored periodically to check their running statuses.
Generally, KPIs are aggregated along multiple dimensions and derived by complex
calculations among fundamental metrics from the raw data. Once abnormal KPI
values are observed, root cause analysis (RCA) can be applied to identify the
reasons for anomalies, so that we can troubleshoot quickly. Recently, several
automatic RCA techniques were proposed to localize the related dimensions (or a
combination of dimensions) to explain the anomalies. However, their analyses
are limited to the data on the abnormal metric and ignore the data of other
metrics which may be also related to the anomalies, leading to imprecise or
even incorrect root causes. To this end, we propose a cross-metric
multi-dimensional root cause analysis method, named CMMD, which consists of two
key components: 1) relationship modeling, which utilizes graph neural network
(GNN) to model the unknown complex calculation among metrics and aggregation
function among dimensions from historical data; 2) root cause localization,
which adopts the genetic algorithm to efficiently and effectively dive into the
raw data and localize the abnormal dimension(s) once the KPI anomalies are
detected. Experiments on synthetic datasets, public datasets and online
production environment demonstrate the superiority of our proposed CMMD method
compared with baselines. Currently, CMMD is running as an online service in
Microsoft Azure.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2022 13:17:19 GMT'}]",2022-09-02,"[['Yan', 'Shifu', ''], ['Shan', 'Caihua', ''], ['Yang', 'Wenyi', ''], ['Xu', 'Bixiong', ''], ['Li', 'Dongsheng', ''], ['Qiu', 'Lili', ''], ['Tong', 'Jie', ''], ['Zhang', 'Qi', '']]","['Root cause analysis', 'graph neural network', 'genetic algorithm']"
10635,2205.05953,Jesus Gutierrez,"Pablo P\'erez and Ester Gonzalez-Sosa and Jes\'us Guti\'errez and
  Narciso Garc\'ia","Emerging Immersive Communication Systems: Overview, Taxonomy, and Good
  Practises for QoE Assessment",Frontiers in Signal Processing,Front. Signal Process. (2022),10.3389/frsip.2022.917684,,cs.HC cs.MM,http://creativecommons.org/licenses/by/4.0/,"  Several technological and scientific advances have been achieved recently in
the fields of immersive systems, which are offering new possibilities to
applications and services in different communication domains, such as
entertainment, virtual conferencing, working meetings, social relations,
healthcare, and industry. Users of these immersive technologies can explore and
experience the stimuli in a more interactive and personalized way than previous
technologies. Thus, considering the new technological challenges related to
these systems and the new perceptual dimensions and interaction behaviors
involved, a deep understanding of the users' Quality of Experience is required
to satisfy their demands and expectations. In this sense, it is essential to
foster the research on evaluating the QoE of immersive communication systems,
since this will provide useful outcomes to optimize them and to identify the
factors that can deteriorate the user experience. With this aim, subjective
tests are usually performed following standard methodologies, which are
designed for specific technologies and services. Although numerous user studies
have been already published, there are no recommendations or standards that
define common testing methodologies to be applied to evaluate immersive
communication systems, such as those developed for images and video. Therefore,
a revision of the QoE evaluation methods designed for previous technologies is
required to develop robust and reliable methodologies for immersive
communication systems. Thus, the objective of this paper is to provide an
overview of existing immersive communication systems and related user studies,
which can help on the definition of basic guidelines and testing methodologies
to be used when performing user tests of immersive communication systems, such
as 360-degree video-based telepresence, avatar-based social VR, cooperative AR,
etc.
","[{'version': 'v1', 'created': 'Thu, 12 May 2022 08:40:53 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Sep 2022 09:12:12 GMT'}]",2022-09-02,"[['Pérez', 'Pablo', ''], ['Gonzalez-Sosa', 'Ester', ''], ['Gutiérrez', 'Jesús', ''], ['García', 'Narciso', '']]","['immersive', 'communication', 'systems', 'quality of experience', 'evaluation', 'virtual reality', 'augmented reality', 'telepresence']"
10636,2012.01204,Francisco J. Castellanos,"Francisco J. Castellanos, Antonio-Javier Gallego, Jorge Calvo-Zaragoza",Unsupervised Neural Domain Adaptation for Document Image Binarization,,"Pattern Recognition, 2021, Vol. 119, p. 108099",10.1016/j.patcog.2021.108099,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Binarization is a well-known image processing task, whose objective is to
separate the foreground of an image from the background. One of the many tasks
for which it is useful is that of preprocessing document images in order to
identify relevant information, such as text or symbols. The wide variety of
document types, alphabets, and formats makes binarization challenging. There
are multiple proposals with which to solve this problem, from classical
manually-adjusted methods, to more recent approaches based on machine learning.
The latter techniques require a large amount of training data in order to
obtain good results; however, labeling a portion of each existing collection of
documents is not feasible in practice. This is a common problem in supervised
learning, which can be addressed by using the so-called Domain Adaptation (DA)
techniques. These techniques take advantage of the knowledge learned in one
domain, for which labeled data are available, to apply it to other domains for
which there are no labeled data. This paper proposes a method that combines
neural networks and DA in order to carry out unsupervised document
binarization. However, when both the source and target domains are very
similar, this adaptation could be detrimental. Our methodology, therefore,
first measures the similarity between domains in an innovative manner in order
to determine whether or not it is appropriate to apply the adaptation process.
The results reported in the experimentation, when evaluating up to 20 possible
combinations among five different domains, show that our proposal successfully
deals with the binarization of new document domains without the need for
labeled data.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2020 13:42:38 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Jul 2021 09:44:37 GMT'}]",2021-07-02,"[['Castellanos', 'Francisco J.', ''], ['Gallego', 'Antonio-Javier', ''], ['Calvo-Zaragoza', 'Jorge', '']]","['Binarization', 'Machine Learning', 'Domain Adaptation', 'Adversarial training']"
10637,2001.00484,Markus Konkol,"Markus Konkol, Daniel N\""ust, Laura Goulier","Publishing computational research -- A review of infrastructures for
  reproducible and transparent scholarly communication","8 pages, 2 tables","Res Integr Peer Rev 5, 10 (2020)",10.1186/s41073-020-00095-y,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  The trend toward open science increases the pressure on authors to provide
access to the source code and data they used to compute the results reported in
their scientific papers. Since sharing materials reproducibly is challenging,
several projects have developed solutions to support the release of executable
analyses alongside articles. We reviewed 11 applications that can assist
researchers in adhering to reproducibility principles. The applications were
found through a literature search and interactions with the reproducible
research community. An application was included in our analysis if it was
actively maintained at the time the data for this paper was collected, supports
the publication of executable code and data, is connected to the scholarly
publication process. By investigating the software documentation and published
articles, we compared the applications across 19 criteria, e.g. features that
support authors in creating and readers in studying executable papers. From the
11 applications, eight allow publishers to self-host the system for free,
whereas three provide paid services. Authors can submit an executable analysis
using Jupyter Notebooks or R Markdown documents (10 applications support these
formats). All approaches provide features to assist readers in studying the
materials, e.g., one-click reproducible results or tools for manipulating the
analysis parameters. Six applications allow for modifying materials after
publication. The applications support authors to publish reproducible research
predominantly with literate programming. Concerning readers, most applications
provide user interfaces to inspect and manipulate the computational analysis.
","[{'version': 'v1', 'created': 'Thu, 2 Jan 2020 15:16:54 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Jul 2020 08:11:13 GMT'}]",2020-07-15,"[['Konkol', 'Markus', ''], ['Nüst', 'Daniel', ''], ['Goulier', 'Laura', '']]","['Open reproducible research', 'Open science', 'Computational statistics', 'Scholarly communication']"
10638,2210.10698,Quan Li,"Laixin Xie, Ziming Wu, Peng Xu, Wei Li, Xiaojuan Ma, and Quan Li","RoleSeer: Understanding Informal Social Role Changes in MMORPGs via
  Visual Analytics","CHI Conference on Human Factors in Computing Systems (CHI '22), April
  29-May 5, 2022, New Orleans, LA, USA",,10.1145/3491102.3517712,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Massively multiplayer online role-playing games create virtual communities
that support heterogeneous ""social roles"" determined by gameplay interaction
behaviors under a specific social context. For all social roles, formal roles
are pre-defined, obvious, and explicitly ascribed to the people holding the
roles, whereas informal roles are not well-defined and unspoken. Identifying
the informal roles and understanding their subtle changes are critical to
designing sociability mechanisms. However, it is nontrivial to understand the
existence and evolution of such roles due to their loosely defined,
interconvertible, and dynamic characteristics. We propose a visual analytics
system, RoleSeer, to investigate informal roles from the perspectives of
behavioral interactions and depict their dynamic interconversions and
transitions. Two cases, experts' feedback, and a user study suggest that
RoleSeer helps interpret the identified informal roles and explore the patterns
behind role changes. We see our approach's potential in investigating informal
roles in a broader range of social games.
","[{'version': 'v1', 'created': 'Wed, 19 Oct 2022 16:24:41 GMT'}]",2022-10-20,"[['Xie', 'Laixin', ''], ['Wu', 'Ziming', ''], ['Xu', 'Peng', ''], ['Li', 'Wei', ''], ['Ma', 'Xiaojuan', ''], ['Li', 'Quan', '']]","['social role', 'social network', 'graph embedding', 'gameplay']"
10639,2203.03048,Yibo Yang,"Yibo Yang, Georgios Kissas, Paris Perdikaris","Scalable Uncertainty Quantification for Deep Operator Networks using
  Randomized Priors","23 pages, 11 figures",,10.1016/j.cma.2022.115399,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  We present a simple and effective approach for posterior uncertainty
quantification in deep operator networks (DeepONets); an emerging paradigm for
supervised learning in function spaces. We adopt a frequentist approach based
on randomized prior ensembles, and put forth an efficient vectorized
implementation for fast parallel inference on accelerated hardware. Through a
collection of representative examples in computational mechanics and climate
modeling, we show that the merits of the proposed approach are fourfold. (1) It
can provide more robust and accurate predictions when compared against
deterministic DeepONets. (2) It shows great capability in providing reliable
uncertainty estimates on scarce data-sets with multi-scale function pairs. (3)
It can effectively detect out-of-distribution and adversarial examples. (4) It
can seamlessly quantify uncertainty due to model bias, as well as noise
corruption in the data. Finally, we provide an optimized JAX library called
{\em UQDeepONet} that can accommodate large model architectures, large ensemble
sizes, as well as large data-sets with excellent parallel performance on
accelerated hardware, thereby enabling uncertainty quantification for DeepONets
in realistic large-scale applications.
","[{'version': 'v1', 'created': 'Sun, 6 Mar 2022 20:48:16 GMT'}]",2022-08-17,"[['Yang', 'Yibo', ''], ['Kissas', 'Georgios', ''], ['Perdikaris', 'Paris', '']]","['Deep learning', 'Uncertainty quantification', 'Operator learning']"
10640,2209.00892,Xiaobin Rui,"Lichao Sun, Xiaobin Rui, Wei Chen",Scalable Adversarial Attack Algorithms on Influence Maximization,"11 pages, 2 figures",,10.1145/3539597.3570416,,cs.SI cs.DS physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the adversarial attacks on influence maximization
under dynamic influence propagation models in social networks. In particular,
given a known seed set S, the problem is to minimize the influence spread from
S by deleting a limited number of nodes and edges. This problem reflects many
application scenarios, such as blocking virus (e.g. COVID-19) propagation in
social networks by quarantine and vaccination, blocking rumor spread by
freezing fake accounts, or attacking competitor's influence by incentivizing
some users to ignore the information from the competitor. In this paper, under
the linear threshold model, we adapt the reverse influence sampling approach
and provide efficient algorithms of sampling valid reverse reachable paths to
solve the problem. We present three different design choices on reverse
sampling, which all guarantee $1/2 - \varepsilon$ approximation (for any small
$\varepsilon >0$) and an efficient running time.
","[{'version': 'v1', 'created': 'Fri, 2 Sep 2022 09:01:33 GMT'}, {'version': 'v2', 'created': 'Sat, 17 Dec 2022 18:03:46 GMT'}]",2022-12-20,"[['Sun', 'Lichao', ''], ['Rui', 'Xiaobin', ''], ['Chen', 'Wei', '']]","['influence maximization', 'triggering model', 'greedy algorithm']"
10641,1908.04530,Chen Wu,"Jiangnan Xia, Chen Wu, Ming Yan","Incorporating Relation Knowledge into Commonsense Reading Comprehension
  with Multi-task Learning","Accepted at CIKM'19, 4 pages",,10.1145/3357384.3358165,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper focuses on how to take advantage of external relational knowledge
to improve machine reading comprehension (MRC) with multi-task learning. Most
of the traditional methods in MRC assume that the knowledge used to get the
correct answer generally exists in the given documents. However, in real-world
task, part of knowledge may not be mentioned and machines should be equipped
with the ability to leverage external knowledge. In this paper, we integrate
relational knowledge into MRC model for commonsense reasoning. Specifically,
based on a pre-trained language model (LM). We design two auxiliary
relation-aware tasks to predict if there exists any commonsense relation and
what is the relation type between two words, in order to better model the
interactions between document and candidate answer option. We conduct
experiments on two multi-choice benchmark datasets: the SemEval-2018 Task 11
and the Cloze Story Test. The experimental results demonstrate the
effectiveness of the proposed method, which achieves superior performance
compared with the comparable baselines on both datasets.
","[{'version': 'v1', 'created': 'Tue, 13 Aug 2019 08:28:05 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Sep 2019 09:35:42 GMT'}]",2019-09-06,"[['Xia', 'Jiangnan', ''], ['Wu', 'Chen', ''], ['Yan', 'Ming', '']]","['machine reading comprehension', 'commonsense reasoning', 'multitask learning']"
10642,1605.02265,Michael Hucka,Michael Hucka and Matthew J. Graham,"Software search is not a science, even among scientists: A survey of how
  scientists and engineers find software",,"Journal of Systems and Software, 141:171-191, 2018",10.1016/j.jss.2018.03.047,,cs.CY cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Improved software discovery is a prerequisite for greater software reuse:
after all, if someone cannot find software for a particular task, they cannot
reuse it. Understanding people's approaches and preferences when they look for
software could help improve facilities for software discovery. We surveyed
people working in several scientific and engineering fields to better
understand their approaches and selection criteria. We found that even among
highly-trained people, the rudimentary approaches of relying on general Web
searches, the opinions of colleagues, and the literature were still the most
commonly used. However, those who were involved in software development
differed from nondevelopers in their use of social help sites, software project
repositories, software catalogs, and organization-specific mailing lists or
forums. For example, software developers in our sample were more likely to
search in community sites such as Stack Overflow even when seeking ready-to-run
software rather than source code, and likewise, asking colleagues was
significantly more important when looking for ready-to-run software. Our survey
also provides insight into the criteria that matter most to people when they
are searching for ready-to-run software. Finally, our survey also identifies
some factors that can prevent people from finding software.
","[{'version': 'v1', 'created': 'Sun, 8 May 2016 02:31:35 GMT'}, {'version': 'v2', 'created': 'Mon, 28 May 2018 21:02:15 GMT'}]",2018-05-30,"[['Hucka', 'Michael', ''], ['Graham', 'Matthew J.', '']]","['software search', 'software reuse', 'software catalogues', 'survey']"
10643,2111.08295,Zeynep Tuna Deger,"Berkay Topaloglu, Gulsen Taskin Kaya, Fatih Sutcu, Zeynep Tuna Deger
  (Istanbul Technical University)",Machine Learning-Based Assessment of Energy Behavior of RC Shear Walls,"21 pages, 10 figures, 4 Tables. Submitted to Elsevier",Structures 2022,10.1016/j.istruc.2022.08.114,,cs.CE cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Current seismic design codes primarily rely on the strength and displacement
capacity of structural members and do not account for the influence of the
ground motion duration or the hysteretic behavior characteristics. The
energy-based approach serves as a supplemental index to response quantities and
includes the effect of repeated loads in seismic performance. The design
philosophy suggests that the seismic demands are met by the energy dissipation
capacity of the structural members. Therefore, the energy dissipation behavior
of the structural members should be well understood to achieve an effective
energy-based design approach. This study focuses on the energy dissipation
capacity of reinforced concrete (RC) shear walls that are widely used in high
seismic regions as they provide significant stiffness and strength to resist
lateral forces. A machine learning (Gaussian Process Regression (GPR))-based
predictive model for energy dissipation capacity of shear walls is developed as
a function of wall design parameters. Eighteen design parameters are shown to
influence energy dissipation, whereas the most important ones are determined by
applying sequential backward elimination and by using feature selection methods
to reduce the complexity of the predictive model. The ability of the proposed
model to make robust and accurate predictions is validated based on novel data
with a prediction accuracy (the ratio of predicted/actual values) of around
1.00 and a coefficient of determination (R2) of 0.93. The outcomes of this
study are believed to contribute to the energy-based approach by (i) defining
the most influential wall properties on the seismic energy dissipation capacity
of shear walls and (ii) providing predictive models that can enable comparisons
of different wall design configurations to achieve higher energy dissipation
capacity.
","[{'version': 'v1', 'created': 'Tue, 16 Nov 2021 08:38:42 GMT'}]",2022-09-30,"[['Topaloglu', 'Berkay', '', 'Istanbul Technical University'], ['Kaya', 'Gulsen Taskin', '', 'Istanbul Technical University'], ['Sutcu', 'Fatih', '', 'Istanbul Technical University'], ['Deger', 'Zeynep Tuna', '', 'Istanbul Technical University']]","['cumulative dissipated energy', 'energy-based design approach', 'feature selection', 'machine learning', 'predictive models', 'reinforced concrete shear walls']"
10644,2011.12762,Samuel Rivera,"Samuel Rivera, Olga Mendoza-Schrock, Ashley Diehl","Transfer Learning for Aided Target Recognition: Comparing Deep Learning
  to other Machine Learning Approaches",,,10.1117/12.2514753,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aided target recognition (AiTR), the problem of classifying objects from
sensor data, is an important problem with applications across industry and
defense. While classification algorithms continue to improve, they often
require more training data than is available or they do not transfer well to
settings not represented in the training set. These problems are mitigated by
transfer learning (TL), where knowledge gained in a well-understood source
domain is transferred to a target domain of interest. In this context, the
target domain could represents a poorly-labeled dataset, a different sensor, or
an altogether new set of classes to identify.
  While TL for classification has been an active area of machine learning (ML)
research for decades, transfer learning within a deep learning framework
remains a relatively new area of research. Although deep learning (DL) provides
exceptional modeling flexibility and accuracy on recent real world problems,
open questions remain regarding how much transfer benefit is gained by using DL
versus other ML architectures. Our goal is to address this shortcoming by
comparing transfer learning within a DL framework to other ML approaches across
transfer tasks and datasets. Our main contributions are: 1) an empirical
analysis of DL and ML algorithms on several transfer tasks and domains
including gene expressions and satellite imagery, and 2) a discussion of the
limitations and assumptions of TL for aided target recognition -- both for DL
and ML in general. We close with a discussion of future directions for DL
transfer.
","[{'version': 'v1', 'created': 'Wed, 25 Nov 2020 14:25:49 GMT'}]",2020-11-26,"[['Rivera', 'Samuel', ''], ['Mendoza-Schrock', 'Olga', ''], ['Diehl', 'Ashley', '']]","['Deep learning', 'Machine learning', 'transfer learning', 'adversarial networks']"
10645,1604.04730,Victor Sanchez-Anguix Dr.,"Victor Sanchez-Anguix, Soledad Valero, Vicente Julian, Vicente Botti
  and Ana Garcia-Fornes","Evolutionary-aided negotiation model for bilateral bargaining in Ambient
  Intelligence domains with complex utility functions","Information Sciences, 2013",,10.1016/j.ins.2010.11.018,,cs.MA cs.AI cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ambient Intelligence aims to offer personalized services and easier ways of
interaction between people and systems. Since several users and systems may
coexist in these environments, it is quite possible that entities with opposing
preferences need to cooperate to reach their respective goals. Automated
negotiation is pointed as one of the mechanisms that may provide a solution to
this kind of problems. In this article, a multi-issue bilateral bargaining
model for Ambient Intelligence domains is presented where it is assumed that
agents have computational bounded resources and do not know their opponents'
preferences. The main goal of this work is to provide negotiation models that
obtain efficient agreements while maintaining the computational cost low. A
niching genetic algorithm is used before the negotiation process to sample
one's own utility function (self-sampling). During the negotiation process,
genetic operators are applied over the opponent's and one's own offers in order
to sample new offers that are interesting for both parties. Results show that
the proposed model is capable of outperforming similarity heuristics which only
sample before the negotiation process and of obtaining similar results to
similarity heuristics which have access to all of the possible offers.
","[{'version': 'v1', 'created': 'Sat, 16 Apr 2016 11:53:46 GMT'}]",2016-04-19,"[['Sanchez-Anguix', 'Victor', ''], ['Valero', 'Soledad', ''], ['Julian', 'Vicente', ''], ['Botti', 'Vicente', ''], ['Garcia-Fornes', 'Ana', '']]","['Automated Negotiation', 'Bilateral Bargaining', 'AgreementTechnologies', 'Evolutionary Computation', 'Multi-agent Systems']"
10646,2202.07453,Amir Belder,"Amir Belder, Gal Yefet, Ran Ben Izhak, Ayellet Tal",Random Walks for Adversarial Meshes,,,10.1145/3528233.3530710,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A polygonal mesh is the most-commonly used representation of surfaces in
computer graphics. Therefore, it is not surprising that a number of mesh
classification networks have recently been proposed. However, while adversarial
attacks are wildly researched in 2D, the field of adversarial meshes is under
explored. This paper proposes a novel, unified, and general adversarial attack,
which leads to misclassification of several state-of-the-art mesh
classification neural networks. Our attack approach is black-box, i.e. it has
access only to the network's predictions, but not to the network's full
architecture or gradients. The key idea is to train a network to imitate a
given classification network. This is done by utilizing random walks along the
mesh surface, which gather geometric information. These walks provide insight
onto the regions of the mesh that are important for the correct prediction of
the given classification network. These mesh regions are then modified more
than other regions in order to attack the network in a manner that is barely
visible to the naked eye.
","[{'version': 'v1', 'created': 'Tue, 15 Feb 2022 14:31:17 GMT'}, {'version': 'v2', 'created': 'Thu, 26 May 2022 12:14:18 GMT'}]",2022-05-30,"[['Belder', 'Amir', ''], ['Yefet', 'Gal', ''], ['Izhak', 'Ran Ben', ''], ['Tal', 'Ayellet', '']]","['mesh', 'neural networks', 'geometry', '3d adversarial attacks']"
10647,1908.07060,Thanh Pham Dinh,Huynh Thi Thanh Binh and Pham Dinh Thanh and Ta Bao Thang,"New Approach for Solving The Clustered Shortest-Path Tree Problem Based
  on Reducing The Search Space of Evolutionary Algorithm","27 pages, 7 figures",,10.1016/j.knosys.2019.05.015,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Along with the development of manufacture and services, the problem of
distribution network optimization has been growing in importance, thus
receiving much attention from the research community. One of the most recently
introduced network optimization problems is the Clustered Shortest-Path Tree
Problem (CluSTP). Since the problem is NP-Hard, recent approaches often prefer
to use approximation algorithms to solve it, several of which used Evolutionary
Algorithms (EAs) and have been proven to be effective. However, most of the
prior studies directly applied EAs to the whole CluSTP problem, which leads to
a great amount of resource consumption, especially when the problem size is
large. To overcome these limitations, this paper suggests a method for reducing
the search space of the EAs applied to CluSTP by decomposing the original
problem into two sub-problems, the solution to one of which is found by an EAs
and that to the other is found by another method. The goal of the first
sub-problem is to determine a spanning tree which connects among the clusters,
while the goal of the second sub-problem is to determine the best spanning tree
for each cluster. In addition, this paper proposes a new EAs, which can be
applied to solve the first sub-problem and suggests using the Dijkstra's
algorithm to solve the second sub-problem. The proposed approach is
comprehensively experimented and compared with existing methods. Experimental
results prove that our method is more efficient and more importantly, it can
obtain results which are close to the optimal results.
","[{'version': 'v1', 'created': 'Mon, 10 Jun 2019 03:56:17 GMT'}]",2019-08-21,"[['Binh', 'Huynh Thi Thanh', ''], ['Thanh', 'Pham Dinh', ''], ['Thang', 'Ta Bao', '']]","['Genetic Algorithm', 'Clustered Shortest-Path Tree Problem', 'Evolutionary Algorithms']"
10648,1710.07014,Suryanto Nugroho,"Suryanto Nugroho, Sigit Hadi Waluyo, Luqman Hakim","Comparative Analysis of Software Development Methods between Parallel,
  V-Shaped and Iterative",5 pages,,10.5120/ijca2017914605,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Any organization that will develop software is faced with a difficult choice
of choosing the right software development method. Whereas the software
development methods used, play a significant role in the overall software
development process. Software development methods are needed so that the
software development process can be systematic so that it is not only completed
within the right time frame but also must have good quality. There are various
methods of software development in System Development Lyfe Cycle (SDLC). Each
SDLC method provides a general guiding line about different software
development and has different characteristics. Each method of software
development has its drawbacks and advantages so that the selection of software
development methods should be compatible with the capacity of the software
developed. This paper will compare three different software development
methods: V-Shaped Model, Parallel Development Model, and Iterative Model with
the aim of providing an understanding of software developers to choose the
right method.
","[{'version': 'v1', 'created': 'Thu, 19 Oct 2017 06:11:06 GMT'}]",2017-10-20,"[['Nugroho', 'Suryanto', ''], ['Waluyo', 'Sigit Hadi', ''], ['Hakim', 'Luqman', '']]","['Iterative Model', 'Parallel Development Model', 'System Development Life Cycle', 'V-Shaped Model']"
10649,1604.03308,Somaiyeh Mahmoud Zadeh,"Somaiyeh Mahmoud Zadeh, David M.W Powers, Karl Sammut, Amir Mehdi
  Yazdani","A Novel Versatile Architecture for Autonomous Underwater Vehicle's
  Motion Planning and Task Assignment",arXiv admin note: text overlap with arXiv:1604.03303,,10.1007/s00500-016-2433-2,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Expansion of today's underwater scenarios and missions necessitates the
requestion for robust decision making of the Autonomous Underwater Vehicle
(AUV); hence, design an efficient decision making framework is essential for
maximizing the mission productivity in a restricted time. This paper focuses on
developing a deliberative conflict-free-task assignment architecture
encompassing a Global Route Planner (GRP) and a Local Path Planner (LPP) to
provide consistent motion planning encountering both environmental dynamic
changes and a priori knowledge of the terrain, so that the AUV is reactively
guided to the target of interest in the context of an unknown underwater
environment. The architecture involves three main modules: The GRP module at
the top level deals with the task priority assignment, mission time management,
and determination of a feasible route between start and destination point in a
large scale environment. The LPP module at the lower level deals with safety
considerations and generates collision-free optimal trajectory between each
specific pair of waypoints listed in obtained global route. Re-planning module
tends to promote robustness and reactive ability of the AUV with respect to the
environmental changes. The experimental results for different simulated
missions, demonstrate the inherent robustness and drastic efficiency of the
proposed scheme in enhancement of the vehicles autonomy in terms of mission
productivity, mission time management, and vehicle safety.
","[{'version': 'v1', 'created': 'Tue, 12 Apr 2016 08:55:44 GMT'}, {'version': 'v2', 'created': 'Sun, 17 Apr 2016 08:57:50 GMT'}, {'version': 'v3', 'created': 'Tue, 26 Apr 2016 03:12:41 GMT'}, {'version': 'v4', 'created': 'Wed, 15 Jun 2016 23:12:25 GMT'}]",2016-12-06,"[['Zadeh', 'Somaiyeh Mahmoud', ''], ['Powers', 'David M. W', ''], ['Sammut', 'Karl', ''], ['Yazdani', 'Amir Mehdi', '']]","['Autonomous underwater vehicles', 'Autonomy', 'Decision making', 'Motion planning', 'Task assignment', 'Time management', 'Mission management']"
10650,2201.03153,Derek Weber,Derek Weber and Lucia Falzon and Lewis Mitchell and Mehwish Nasim,"Promoting and countering misinformation during Australia's 2019-2020
  bushfires: A case study of polarisation","80 pages, 29 figures. Submitted to the International Journal of
  Social Network Analysis and Mining (SNAM) expanding upon
  DOI:10.1007/978-3-030-61841-4_11. arXiv admin note: text overlap with
  arXiv:2004.00742",,10.1007/s13278-022-00892-x,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During Australia's unprecedented bushfires in 2019-2020, misinformation
blaming arson resurfaced on Twitter using #ArsonEmergency. The extent to which
bots were responsible for disseminating and amplifying this misinformation has
received scrutiny in the media and academic research. Here we study Twitter
communities spreading this misinformation during the population-level event,
and investigate the role of online communities and bots. Our in-depth
investigation of the dynamics of the discussion uses a phased approach --
before and after reporting of bots promoting the hashtag was broadcast by the
mainstream media. Though we did not find many bots, the most bot-like accounts
were social bots, which present as genuine humans. Further, we distilled
meaningful quantitative differences between two polarised communities in the
Twitter discussion, resulting in the following insights. First, Supporters of
the arson narrative promoted misinformation by engaging others directly with
replies and mentions using hashtags and links to external sources. In response,
Opposers retweeted fact-based articles and official information. Second,
Supporters were embedded throughout their interaction networks, but Opposers
obtained high centrality more efficiently despite their peripheral positions.
By the last phase, Opposers and unaffiliated accounts appeared to coordinate,
potentially reaching a broader audience. Finally, unaffiliated accounts shared
the same URLs as Opposers over Supporters by a ratio of 9:1 in the last phase,
having shared mostly Supporter URLs in the first phase. This foiled Supporters'
efforts, highlighting the value of exposing misinformation campaigns. We
speculate that the communication strategies observed here could be discoverable
in other misinformation-related discussions and could inform
counter-strategies.
","[{'version': 'v1', 'created': 'Mon, 10 Jan 2022 03:44:31 GMT'}]",2022-06-28,"[['Weber', 'Derek', ''], ['Falzon', 'Lucia', ''], ['Mitchell', 'Lewis', ''], ['Nasim', 'Mehwish', '']]","['social media', 'information campaigns', 'polarisation', 'misinformation', 'crisis', 'Twitter']"
10651,2106.07833,Zhongyuan Hau,"Chengzeng You, Zhongyuan Hau, Soteris Demetriou","Temporal Consistency Checks to Detect LiDAR Spoofing Attacks on
  Autonomous Vehicle Perception","Accepted in 1st Workshop on Security and Privacy for Mobile AI (MAISP
  2021)",,10.1145/3469261.3469406,,cs.CR cs.CV,http://creativecommons.org/licenses/by/4.0/,"  LiDAR sensors are used widely in Autonomous Vehicles for better perceiving
the environment which enables safer driving decisions. Recent work has
demonstrated serious LiDAR spoofing attacks with alarming consequences. In
particular, model-level LiDAR spoofing attacks aim to inject fake depth
measurements to elicit ghost objects that are erroneously detected by 3D Object
Detectors, resulting in hazardous driving decisions. In this work, we explore
the use of motion as a physical invariant of genuine objects for detecting such
attacks. Based on this, we propose a general methodology, 3D Temporal
Consistency Check (3D-TC2), which leverages spatio-temporal information from
motion prediction to verify objects detected by 3D Object Detectors. Our
preliminary design and implementation of a 3D-TC2 prototype demonstrates very
promising performance, providing more than 98% attack detection rate with a
recall of 91% for detecting spoofed Vehicle (Car) objects, and is able to
achieve real-time detection at 41Hz
","[{'version': 'v1', 'created': 'Tue, 15 Jun 2021 01:36:40 GMT'}]",2021-06-16,"[['You', 'Chengzeng', ''], ['Hau', 'Zhongyuan', ''], ['Demetriou', 'Soteris', '']]","['Autonomous Vehicle', 'LiDAR', '3D Object Detection', 'Spoofing Attack', 'Attack Detection', 'Temporal Consistency']"
10652,2210.06845,Karolina Okrasa,"Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa,
  Kirill Simonov","The Fine-Grained Complexity of Graph Homomorphism Parameterized by
  Clique-Width","21 pages, 2 figures. arXiv admin note: text overlap with
  arXiv:1804.07975 by other authors",,10.4230/LIPIcs.ICALP.2022.66,,cs.CC,http://creativecommons.org/licenses/by/4.0/,"  The generic homomorphism problem, which asks whether an input graph $G$
admits a homomorphism into a fixed target graph $H$, has been widely studied in
the literature. In this article, we provide a fine-grained complexity
classification of the running time of the homomorphism problem with respect to
the clique-width of $G$ (denoted $\operatorname{cw}$) for virtually all choices
of $H$ under the Strong Exponential Time Hypothesis. In particular, we identify
a property of $H$ called the signature number $s(H)$ and show that for each
$H$, the homomorphism problem can be solved in time
$\mathcal{O}^*(s(H)^{\operatorname{cw}})$. Crucially, we then show that this
algorithm can be used to obtain essentially tight upper bounds. Specifically,
we provide a reduction that yields matching lower bounds for each $H$ that is
either a projective core or a graph admitting a factorization with additional
properties -- allowing us to cover all possible target graphs under
long-standing conjectures.
","[{'version': 'v1', 'created': 'Thu, 13 Oct 2022 08:56:52 GMT'}]",2022-10-14,"[['Ganian', 'Robert', ''], ['Hamm', 'Thekla', ''], ['Korchemna', 'Viktoriia', ''], ['Okrasa', 'Karolina', ''], ['Simonov', 'Kirill', '']]","['homomorphism', 'clique-width', 'fine-grained complexity']"
10653,2111.11859,Brian Subirana,Jordi Laguarta Soler and Brian Subirana,Longitudinal Speech Biomarkers for Automated Alzheimer's Detection,,"Frontiers in Computer Science, 08 April 2021",10.3389/fcomp.2021.624694,,cs.SD eess.AS q-bio.QM,http://creativecommons.org/licenses/by/4.0/,"  We introduce a novel audio processing architecture, the Open Voice Brain
Model (OVBM), improving detection accuracy for Alzheimer's (AD) longitudinal
discrimination from spontaneous speech. We also outline the OVBM design
methodology leading us to such architecture, which in general can incorporate
multimodal biomarkers and target simultaneously several diseases and other AI
tasks. Key in our methodology is the use of multiple biomarkers complementing
each other, and when two of them uniquely identify different subjects in a
target disease we say they are orthogonal. We illustrate the methodology by
introducing 16 biomarkers, three of which are orthogonal, demonstrating
simultaneous above state-of-the-art discrimination for apparently unrelated
diseases such as AD and COVID-19. Inspired by research conducted at the MIT
Center for Brain Minds and Machines, OVBM combines biomarker implementations of
the four modules of intelligence: The brain OS chunks and overlaps audio
samples and aggregates biomarker features from the sensory stream and cognitive
core creating a multi-modal graph neural network of symbolic compositional
models for the target task. We apply it to AD, achieving above state-of-the-art
accuracy of 93.8% on raw audio, while extracting a subject saliency map that
longitudinally tracks relative disease progression using multiple biomarkers,
16 in the reported AD task. The ultimate aim is to help medical practice by
detecting onset and treatment impact so that intervention options can be
longitudinally tested. Using the OBVM design methodology, we introduce a novel
lung and respiratory tract biomarker created using 200,000+ cough samples to
pre-train a model discriminating cough cultural origin. This cough dataset sets
a new benchmark as the largest audio health dataset with 30,000+ subjects
participating in April 2020, demonstrating for the first-time cough cultural
bias.
","[{'version': 'v1', 'created': 'Mon, 22 Nov 2021 18:38:14 GMT'}]",2021-11-24,"[['Soler', 'Jordi Laguarta', ''], ['Subirana', 'Brian', '']]","['multimodal deep learning', 'transfer learning', 'explainable speech recognition', 'brain model', 'graphneural-networks', 'AI diagnostics']"
10654,2108.08797,Samuel Raymond,"Samuel J. Raymond, Nicholas J. Cecchi, Hossein Vahid Alizadeh, Ashlyn
  A. Callan, Eli Rice, Yuzhe Liu, Zhou Zhou, Michael Zeineh, David B. Camarillo",Physics-informed machine learning improves detection of head impacts,,,10.1007/s10439-022-02911-6,,cs.CE,http://creativecommons.org/licenses/by-sa/4.0/,"  In this work we present a new physics-informed machine learning model that
can be used to analyze kinematic data from an instrumented mouthguard and
detect impacts to the head. Monitoring player impacts is vitally important to
understanding and protecting from injuries like concussion. Typically, to
analyze this data, a combination of video analysis and sensor data is used to
ascertain the recorded events are true impacts and not false positives. In
fact, due to the nature of using wearable devices in sports, false positives
vastly outnumber the true positives. Yet, manual video analysis is
time-consuming. This imbalance leads traditional machine learning approaches to
exhibit poor performance in both detecting true positives and preventing false
negatives. Here, we show that by simulating head impacts numerically using a
standard Finite Element head-neck model, a large dataset of synthetic impacts
can be created to augment the gathered, verified, impact data from mouthguards.
This combined physics-informed machine learning impact detector reported
improved performance on test datasets compared to traditional impact detectors
with negative predictive value and positive predictive values of 88% and 87%
respectively. Consequently, this model reported the best results to date for an
impact detection algorithm for American Football, achieving an F1 score of
0.95. In addition, this physics-informed machine learning impact detector was
able to accurately detect true and false impacts from a test dataset at a rate
of 90% and 100% relative to a purely manual video analysis workflow. Saving
over 12 hours of manual video analysis for a modest dataset, at an overall
accuracy of 92%, these results indicate that this model could be used in place
of, or alongside, traditional video analysis to allow for larger scale and more
efficient impact detection in sports such as American Football.
","[{'version': 'v1', 'created': 'Thu, 19 Aug 2021 17:11:05 GMT'}]",2022-03-21,"[['Raymond', 'Samuel J.', ''], ['Cecchi', 'Nicholas J.', ''], ['Alizadeh', 'Hossein Vahid', ''], ['Callan', 'Ashlyn A.', ''], ['Rice', 'Eli', ''], ['Liu', 'Yuzhe', ''], ['Zhou', 'Zhou', ''], ['Zeineh', 'Michael', ''], ['Camarillo', 'David B.', '']]","['instrumented mouthguard', 'traumatic brain injury', 'American football', 'concussion', 'deep learning', 'physics-informed machine learning']"
10655,2205.00862,Jason Gross,"Jason Gross and Andres Erbsen and Jade Philipoom and Miraya
  Poddar-Agrawal and Adam Chlipala","Accelerating Verified-Compiler Development with a Verified Rewriting
  Engine","13th International Conference on Interactive Theorem Proving (ITP
  2022)",,10.4230/LIPIcs.ITP.2022.17,,cs.PL,http://creativecommons.org/licenses/by/4.0/,"  Compilers are a prime target for formal verification, since compiler bugs
invalidate higher-level correctness guarantees, but compiler changes may become
more labor-intensive to implement, if they must come with proof patches. One
appealing approach is to present compilers as sets of algebraic rewrite rules,
which a generic engine can apply efficiently. Now each rewrite rule can be
proved separately, with no need to revisit past proofs for other parts of the
compiler. We present the first realization of this idea, in the form of a
framework for the Coq proof assistant. Our new Coq command takes normal proved
theorems and combines them automatically into fast compilers with proofs. We
applied our framework to improve the Fiat Cryptography toolchain for generating
cryptographic arithmetic, producing an extracted command-line compiler that is
about 1000$\times$ faster while actually featuring simpler compiler-specific
proofs.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 12:45:57 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Jul 2022 17:55:52 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Jul 2022 17:28:17 GMT'}]",2022-07-19,"[['Gross', 'Jason', ''], ['Erbsen', 'Andres', ''], ['Philipoom', 'Jade', ''], ['Poddar-Agrawal', 'Miraya', ''], ['Chlipala', 'Adam', '']]","['compiler verification', 'rewriting engines', 'cryptography']"
10656,2012.03746,Mojtaba Shahin,"Mojtaba Shahin, Olivia Ilic, Chris Gonsalvez, Jon Whittle","The Impact of a STEM-based Entrepreneurship Program on the
  Entrepreneurial Intention of Secondary School Female Students","20 Pages, Accepted to appear in International Entrepreneurship and
  Management Journal (IEMJ), Springer, 2020",International Entrepreneurship and Management Journal (2021),10.1007/s11365-020-00713-7,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite dedicated effort and research in the last two decades, the
entrepreneurship field is still limited by little evidence-based knowledge of
the impacts of entrepreneurship programs on the entrepreneurial intention of
students in pre-university levels of study. Further, gender equity continues to
be an issue in the entrepreneurial sector, particularly in STEM-focused
entrepreneurship. In this context, this study was designed to explore the
effects of a one-day female-focused STEM-based entrepreneurship program (for
brevity, we call it the OzGirlsEntrepreneurship program) on the entrepreneurial
intention of secondary school female students. The study collected data from
two surveys completed by 193 secondary school female students, aged 14-16
years, who participated in the OzGirlsEntrepreneurship program. This program
encouraged girls to develop and implement creative computational solutions to
socially relevant problems, with an Internet of Things (IoT) component using
the micro:bit device. The findings reveal that a key factor in the development
of entrepreneurial attitudes in young female students is associated with
soft-skills development, particularly in the areas of creative thinking,
risk-taking, problem-solving, and leadership development. The importance of
meaningful human connections, including positive role modelling and peer to
peer learning were also important factors in fostering entrepreneurial intent.
With these factors in mind, our findings highlight that the
OzGirlsEntrepreneurship program substantially increased the entrepreneurial
intention of secondary school female students. In addition, this study offers
actionable implications and recommendations to develop and deliver
entrepreneurship education programs for secondary school level students.
","[{'version': 'v1', 'created': 'Fri, 4 Dec 2020 15:18:37 GMT'}, {'version': 'v2', 'created': 'Sun, 17 Jan 2021 02:06:13 GMT'}]",2021-01-19,"[['Shahin', 'Mojtaba', ''], ['Ilic', 'Olivia', ''], ['Gonsalvez', 'Chris', ''], ['Whittle', 'Jon', '']]","['Entrepreneurial intention', 'Entrepreneurship education', 'learning', 'inspiration', 'secondary school female students', 'female entrepreneurs']"
10657,2211.11859,Aleksey Gvozdarev S.,Aleksey S. Gvozdarev,"Capacity Analysis of the Fluctuating Double-Rayleigh with Line-of-Sight
  Fading Channel",,"Physical Communication, Vol. 55, 2022, 101939",10.1016/j.phycom.2022.101939,,cs.IT eess.SP math.IT,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The proposed research performs the capacity analysis of the wireless channel
described by the fluctuating double-Rayleigh with the line-of-sight model. The
closed-form analytical expressions for the conditional capacity (in the case of
arbitrary noninteger fading parameter) and the ergodic capacity (in the case of
the integer fading parameter) are derived in terms of the extended generalized
bivariate Meijer G-function. The exact solutions are succeeded by the
approximating expressions deduced for the cases of small and large ratios
between the Rician K-factor and the fading parameter. The performed numeric
simulation verifies the correctness of the derived results and analyzes the
proposed capacity approximation quality performance.
","[{'version': 'v1', 'created': 'Mon, 21 Nov 2022 21:28:55 GMT'}]",2022-11-23,"[['Gvozdarev', 'Aleksey S.', '']]","['Fading channel', 'double-Rayleigh', 'line-of-sight', 'shadowing', 'capacity']"
10658,2108.03744,Shiguang Deng,"Shiguang Deng, Carl Soderhjelm, Diran Apelian, Krishnan Suresh","Estimation of elastic behaviors of metal components containing process
  induced porosity",,,10.1016/j.compstruc.2021.106558,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  Significant progress has been made for assessing the influence of porosity on
the performance metrics for cast components through various modeling
techniques. However, a computationally efficient framework to account for
porosity with various shapes and sizes is still lacking. The main contribution
of this work is to address this limitation. Specifically, a novel porosity
sensitivity method is proposed, which integrates the merits of topological
sensitivity and shape sensitivity. While topological sensitivity approximates
the first order change on the quantity of interest when an infinitesimally
small spherical pore is inserted into a dense (no pore) structure, shape
sensitivity estimates the subsequent change in the quantity when the small pore
boundary is continuously perturbed to resemble the geometry reconstructed from
tomography characterization data. In this method, an exterior problem is solved
to explicitly formulate pore stress and strain fields as functions of shape
scaling parameters. By neglecting higher order pore-to-pore interaction terms,
the influence of multiple pores can be estimated through a linear
approximation. The proposed method is first studied on a benchmark example to
establish the impact of different pore parameters on the estimation accuracy.
The method is then applied onto case studies where the pore geometry is either
from tomography reconstruction or computer-generated representations.
Efficiency and accuracy of the method are finally demonstrated using a
commercial 3D application. The proposed method can be extended to other
manufacturing (e.g., additive manufacturing) induced porosity problems.
","[{'version': 'v1', 'created': 'Sun, 8 Aug 2021 22:08:48 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Mar 2022 17:27:32 GMT'}, {'version': 'v3', 'created': 'Wed, 30 Mar 2022 17:09:57 GMT'}, {'version': 'v4', 'created': 'Sat, 2 Apr 2022 03:23:46 GMT'}]",2022-04-05,"[['Deng', 'Shiguang', ''], ['Soderhjelm', 'Carl', ''], ['Apelian', 'Diran', ''], ['Suresh', 'Krishnan', '']]","['Cast porosity', 'design sensitivity', 'finite element analysis', 'boundary element method', 'tomography']"
10659,1711.10304,Sobia Arshad,"Sobia Arshad, Muhammad Awais Azam, Syed Hassan Ahmed, Prof. Jonathan
  Loo","Towards Information-Centric Networking (ICN) Naming for Internet of
  Things (IoT):The Case of Smart Campus","6 Pages,3 Figs",,10.1145/3102304.3102345,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information-Centric Networking (ICN) specifically Name Data Networking (NDN)
is the name-base (content-base) networking and takes named-contents as ""first
class citizen"", being considered as the ideal candidate to form the Future
Internet basis. NDN striking features like named-data self-secured contents,
name-base-forwarding, in-network caching and mobility support suits the
Internet of Things (IoT) environment, which aims to enable communication among
smart devices and to combine all Internet-based smart applications under the
one roof. With these aims, IoT put many research challenges regarding its
network architecture as it should support heterogeneous devices and offer
scalability. IoT may depend on the names and addresses of billions of the
devices and should smartly manage the bulk of data produced every second. IoT
application smart campus has gained a lot of attention in both industry and
academia due to many reasons. Therefore, to design NDN for IoT, a sophisticated
naming scheme is needed to explore and it is the main motivation for this work.
In this paper, we study NDN-IoT smart campus (in terms of connected devices and
contents) and find that it lacks in a reasonable naming and addressing
mechanism; and thus we propose NDN based Hybrid Naming Scheme (NDN-HNS) for IoT
based Smart Campus (IoTSC).
","[{'version': 'v1', 'created': 'Tue, 28 Nov 2017 14:21:08 GMT'}]",2017-11-29,"[['Arshad', 'Sobia', ''], ['Azam', 'Muhammad Awais', ''], ['Ahmed', 'Syed Hassan', ''], ['Loo', 'Prof. Jonathan', '']]","['IoT', 'NDN', 'ICN', 'Naming Scheme', 'Hybrid Naming Scheme', 'SmartCampus']"
10660,cs/0701134,Wenbing Zhao,Wenbing Zhao,Byzantine Fault Tolerance for Nondeterministic Applications,"To appear in the proceedings of the 3rd IEEE International Symposium
  on Dependable, Autonomic and Secure Computing, 2007",,10.1109/DASC.2007.11,,cs.DC,,"  All practical applications contain some degree of nondeterminism. When such
applications are replicated to achieve Byzantine fault tolerance (BFT), their
nondeterministic operations must be controlled to ensure replica consistency.
To the best of our knowledge, only the most simplistic types of replica
nondeterminism have been dealt with. Furthermore, there lacks a systematic
approach to handling common types of nondeterminism. In this paper, we propose
a classification of common types of replica nondeterminism with respect to the
requirement of achieving Byzantine fault tolerance, and describe the design and
implementation of the core mechanisms necessary to handle such nondeterminism
within a Byzantine fault tolerance framework.
","[{'version': 'v1', 'created': 'Sun, 21 Jan 2007 20:44:52 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Aug 2007 04:51:53 GMT'}]",2016-11-15,"[['Zhao', 'Wenbing', '']]","['Byzantine Fault Tolerance', 'Intrusion Tolerance', 'Replica Nondeterminism', 'Security', 'Fault Tolerance Middleware']"
10661,2009.09300,Thyagharajan K K,"S. Kavitha, K.K. Thyagharajan","Features based Mammogram Image Classification using Weighted Feature
  Support Vector Machine","9 pages, 3 figures, ""submitted to International Conference on
  Computing and Communication Systems""","Vol. 270, 2012, 320-329",10.1007/978-3-642-29216-3_35,,cs.CV cs.AI cs.LG cs.MM eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the existing research of mammogram image classification, either clinical
data or image features of a specific type is considered along with the
supervised classifiers such as Neural Network (NN) and Support Vector Machine
(SVM). This paper considers automated classification of breast tissue type as
benign or malignant using Weighted Feature Support Vector Machine (WFSVM)
through constructing the precomputed kernel function by assigning more weight
to relevant features using the principle of maximizing deviations. Initially,
MIAS dataset of mammogram images is divided into training and test set, then
the preprocessing techniques such as noise removal and background removal are
applied to the input images and the Region of Interest (ROI) is identified. The
statistical features and texture features are extracted from the ROI and the
clinical features are obtained directly from the dataset. The extracted
features of the training dataset are used to construct the weighted features
and precomputed linear kernel for training the WFSVM, from which the training
model file is created. Using this model file the kernel matrix of test samples
is classified as benign or malignant. This analysis shows that the texture
features have resulted in better accuracy than the other features with WFSVM
and SVM. However, the number of support vectors created in WFSVM is less than
the SVM classifier.
","[{'version': 'v1', 'created': 'Sat, 19 Sep 2020 21:28:31 GMT'}]",2020-09-22,"[['Kavitha', 'S.', ''], ['Thyagharajan', 'K. K.', '']]","['Mammogram images', 'Texture features', 'Statistical features', 'Clinical features', 'Support Vector Machine', 'Weighted Feature Support Vector Machine']"
10662,2208.11552,Michael Weiss,Michael Weiss,CheapET-3: Cost-Efficient Use of Remote DNN Models,"Research Abstract. Contact me for a pre-print of the full paper
  (currently not yet published)",,10.1145/3540250.3559082,,cs.SE cs.AI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  On complex problems, state of the art prediction accuracy of Deep Neural
Networks (DNN) can be achieved using very large-scale models, consisting of
billions of parameters. Such models can only be run on dedicated servers,
typically provided by a 3rd party service, which leads to a substantial
monetary cost for every prediction. We propose a new software architecture for
client-side applications, where a small local DNN is used alongside a remote
large-scale model, aiming to make easy predictions locally at negligible
monetary cost, while still leveraging the benefits of a large model for
challenging inputs. In a proof of concept we reduce prediction cost by up to
50% without negatively impacting system accuracy.
","[{'version': 'v1', 'created': 'Wed, 24 Aug 2022 13:54:27 GMT'}]",2022-08-25,"[['Weiss', 'Michael', '']]","['neural networks', 'software architecture', 'network supervision']"
10663,2206.03905,Fadi Mohsen,"Fadi Mohsen, Dimka Karastoyanova, and George Azzopardi","To remove or not remove Mobile Apps? A data-driven predictive model
  approach",,,10.1016/j.sasc.2022.200045,,cs.CR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Mobile app stores are the key distributors of mobile applications. They
regularly apply vetting processes to the deployed apps. Yet, some of these
vetting processes might be inadequate or applied late. The late removal of
applications might have unpleasant consequences for developers and users alike.
Thus, in this work we propose a data-driven predictive approach that determines
whether the respective app will be removed or accepted. It also indicates the
features' relevance that help the stakeholders in the interpretation. In turn,
our approach can support developers in improving their apps and users in
downloading the ones that are less likely to be removed. We focus on the Google
App store and we compile a new data set of 870,515 applications, 56% of which
have actually been removed from the market. Our proposed approach is a
bootstrap aggregating of multiple XGBoost machine learning classifiers. We
propose two models: user-centered using 47 features, and developer-centered
using 37 features, the ones only available before deployment. We achieve the
following Areas Under the ROC Curves (AUCs) on the test set: user-centered =
0.792, developer-centered = 0.762.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2022 14:00:53 GMT'}]",2022-10-05,"[['Mohsen', 'Fadi', ''], ['Karastoyanova', 'Dimka', ''], ['Azzopardi', 'George', '']]","['Third-party apps', 'Mobile apps', 'App stores', 'Actions', 'Broadcast']"
10664,1904.10007,Ren\'e B{\o}dker Christensen,"Ren\'e B{\o}dker Christensen, Olav Geil",Steane-Enlargement of Quantum Codes from the Hermitian Curve,11 pages,,10.1007/s10623-019-00709-7,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the construction of quantum codes by applying
Steane-enlargement to codes from the Hermitian curve. We cover
Steane-enlargement of both usual one-point Hermitian codes and of order bound
improved Hermitian codes. In particular, the paper contains two constructions
of quantum codes whose parameters are described by explicit formulae, and we
show that these codes compare favourably to existing, comparable constructions
in the literature.
","[{'version': 'v1', 'created': 'Mon, 22 Apr 2019 18:02:53 GMT'}]",2020-02-13,"[['Christensen', 'René Bødker', ''], ['Geil', 'Olav', '']]","['Algebraic geometric code', 'Quantum code', 'Steane-enlargement', 'Hermitian curve']"
10665,2205.05126,Patrick Hemmer,"Max Schemmer and Patrick Hemmer and Maximilian Nitsche and Niklas
  K\""uhl and Michael V\""ossing","A Meta-Analysis of the Utility of Explainable Artificial Intelligence in
  Human-AI Decision-Making","AAAI/ACM Conference on AI, Ethics, and Society (AIES'22)",,10.1145/3514094.3534128,,cs.HC cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Research in artificial intelligence (AI)-assisted decision-making is
experiencing tremendous growth with a constantly rising number of studies
evaluating the effect of AI with and without techniques from the field of
explainable AI (XAI) on human decision-making performance. However, as tasks
and experimental setups vary due to different objectives, some studies report
improved user decision-making performance through XAI, while others report only
negligible effects. Therefore, in this article, we present an initial synthesis
of existing research on XAI studies using a statistical meta-analysis to derive
implications across existing research. We observe a statistically positive
impact of XAI on users' performance. Additionally, the first results indicate
that human-AI decision-making tends to yield better task performance on text
data. However, we find no effect of explanations on users' performance compared
to sole AI predictions. Our initial synthesis gives rise to future research
investigating the underlying causes and contributes to further developing
algorithms that effectively benefit human decision-makers by providing
meaningful explanations.
","[{'version': 'v1', 'created': 'Tue, 10 May 2022 19:08:10 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Jun 2022 05:37:50 GMT'}]",2022-06-02,"[['Schemmer', 'Max', ''], ['Hemmer', 'Patrick', ''], ['Nitsche', 'Maximilian', ''], ['Kühl', 'Niklas', ''], ['Vössing', 'Michael', '']]","['Explainable Artificial Intelligence', 'Decision-Making', 'Empirical Studies', 'Meta-Analysis']"
10666,2012.05017,Maurizio Canavari,"Marco Medici and S{\o}ren Marcus Pedersen and Maurizio Canavari and
  Thomas Anken and Panagiotis Stamatelopoulos and Zisis Tsiropoulos and Alex
  Zotos and Ghasem Tohidloo","A web-tool for calculating the economic performance of precision
  agriculture technology",,,10.1016/j.compag.2020.105930,,cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  To develop precision agriculture (PA) to its full potential and make
agriculture progress toward sustainability and resilience, appropriate criteria
for the economic assessment are recognised as being one of the most significant
issues requiring urgent and ongoing attention. In this work, we develop a
web-tool supporting the assessment of the net economic benefits of integrating
precision farming technologies in different contexts. The methodological
approach of the tool is accessible to any agricultural stakeholder through a
guided process that allows to evaluate and compare precision agriculture
technologies with conventional systems, leading the final user to assess the
financial viability and environmental impact resulting from the potential
implementation of various precision agriculture technologies in his farm. The
web-tool is designed to provide guidelines for farmers over their decisions to
invest in selected PA technologies, by increasing the knowledge level about
novel technologies characteristics and the related benefits. Possible input
reduction also offers the possibility to investigate the mitigation of
environmental impacts.
","[{'version': 'v1', 'created': 'Wed, 9 Dec 2020 12:51:15 GMT'}]",2021-02-05,"[['Medici', 'Marco', ''], ['Pedersen', 'Søren Marcus', ''], ['Canavari', 'Maurizio', ''], ['Anken', 'Thomas', ''], ['Stamatelopoulos', 'Panagiotis', ''], ['Tsiropoulos', 'Zisis', ''], ['Zotos', 'Alex', ''], ['Tohidloo', 'Ghasem', '']]","['precision agriculture (PA)', 'technology', 'adoption', 'cost-benefit analysis', 'economic']"
10667,2108.00705,Zhongwei Xie,"Zhongwei Xie, Ling Liu, Lin Li, Luo Zhong","Efficient Deep Feature Calibration for Cross-Modal Joint Embedding
  Learning",accepted by ACM ICMI 2021 conference,,10.1145/3462244.3479892,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a two-phase deep feature calibration framework for
efficient learning of semantics enhanced text-image cross-modal joint
embedding, which clearly separates the deep feature calibration in data
preprocessing from training the joint embedding model. We use the Recipe1M
dataset for the technical description and empirical validation. In
preprocessing, we perform deep feature calibration by combining deep feature
engineering with semantic context features derived from raw text-image input
data. We leverage LSTM to identify key terms, NLP methods to produce ranking
scores for key terms before generating the key term feature. We leverage
wideResNet50 to extract and encode the image category semantics to help
semantic alignment of the learned recipe and image embeddings in the joint
latent space. In joint embedding learning, we perform deep feature calibration
by optimizing the batch-hard triplet loss function with soft-margin and double
negative sampling, also utilizing the category-based alignment loss and
discriminator-based alignment loss. Extensive experiments demonstrate that our
SEJE approach with the deep feature calibration significantly outperforms the
state-of-the-art approaches.
","[{'version': 'v1', 'created': 'Mon, 2 Aug 2021 08:16:58 GMT'}, {'version': 'v2', 'created': 'Sun, 8 Aug 2021 12:50:28 GMT'}]",2021-08-10,"[['Xie', 'Zhongwei', ''], ['Liu', 'Ling', ''], ['Li', 'Lin', ''], ['Zhong', 'Luo', '']]","['cross-modal retrieval', 'deep feature calibration', 'multi-modal learning']"
10668,2204.05972,Hadi Jahanshahi,"Hadi Jahanshahi, Mucahit Cevik","S-DABT: Schedule and Dependency-Aware Bug Triage in Open-Source Bug
  Tracking Systems","An extension of ""DABT: A Dependency-aware Bug Triaging Method""
  arXiv:2104.12744","Information and Software Technology, 28 July 2022, 107025",10.1016/j.infsof.2022.107025,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fixing bugs in a timely manner lowers various potential costs in software
maintenance. However, manual bug fixing scheduling can be time-consuming,
cumbersome, and error-prone. In this paper, we propose the Schedule and
Dependency-aware Bug Triage (S-DABT), a bug triaging method that utilizes
integer programming and machine learning techniques to assign bugs to suitable
developers. Unlike prior works that largely focus on a single component of the
bug reports, our approach takes into account the textual data, bug fixing
costs, and bug dependencies. We further incorporate the schedule of developers
in our formulation to have a more comprehensive model for this multifaceted
problem. As a result, this complete formulation considers developers' schedules
and the blocking effects of the bugs while covering the most significant
aspects of the previously proposed methods. Our numerical study on four
open-source software systems, namely, EclipseJDT, LibreOffice, GCC, and
Mozilla, shows that taking into account the schedules of the developers
decreases the average bug fixing times. We find that S-DABT leads to a high
level of developer utilization through a fair distribution of the tasks among
the developers and efficient use of the free spots in their schedules. Via the
simulation of the issue tracking system, we also show how incorporating the
schedule in the model formulation reduces the bug fixing time, improves the
assignment accuracy, and utilizes the capability of each developer without much
comprising in the model run times. We find that S-DABT decreases the complexity
of the bug dependency graph by prioritizing blocking bugs and effectively
reduces the infeasible assignment ratio due to bug dependencies. Consequently,
we recommend considering developers' schedules while automating bug triage.
","[{'version': 'v1', 'created': 'Tue, 12 Apr 2022 17:36:43 GMT'}]",2022-08-01,"[['Jahanshahi', 'Hadi', ''], ['Cevik', 'Mucahit', '']]","['bug triage', 'optimization', 'bug dependency graph', 'repository mining', 'issue tracking']"
10669,2111.11719,Mojtaba Forghani,"Mojtaba Forghani, Yizhou Qian, Jonghyun Lee, Matthew Farthing, Tyler
  Hesser, Peter K. Kitanidis, and Eric F. Darve","Variational encoder geostatistical analysis (VEGAS) with an application
  to large scale riverine bathymetry",,,10.1016/j.advwatres.2022.104323,,cs.LG physics.geo-ph,http://creativecommons.org/licenses/by/4.0/,"  Estimation of riverbed profiles, also known as bathymetry, plays a vital role
in many applications, such as safe and efficient inland navigation, prediction
of bank erosion, land subsidence, and flood risk management. The high cost and
complex logistics of direct bathymetry surveys, i.e., depth imaging, have
encouraged the use of indirect measurements such as surface flow velocities.
However, estimating high-resolution bathymetry from indirect measurements is an
inverse problem that can be computationally challenging. Here, we propose a
reduced-order model (ROM) based approach that utilizes a variational
autoencoder (VAE), a type of deep neural network with a narrow layer in the
middle, to compress bathymetry and flow velocity information and accelerate
bathymetry inverse problems from flow velocity measurements. In our
application, the shallow-water equations (SWE) with appropriate boundary
conditions (BCs), e.g., the discharge and/or the free surface elevation,
constitute the forward problem, to predict flow velocity. Then, ROMs of the
SWEs are constructed on a nonlinear manifold of low dimensionality through a
variational encoder. Estimation with uncertainty quantification (UQ) is
performed on the low-dimensional latent space in a Bayesian setting. We have
tested our inversion approach on a one-mile reach of the Savannah River, GA,
USA. Once the neural network is trained (offline stage), the proposed technique
can perform the inversion operation orders of magnitude faster than traditional
inversion methods that are commonly based on linear projections, such as
principal component analysis (PCA), or the principal component geostatistical
approach (PCGA). Furthermore, tests show that the algorithm can estimate the
bathymetry with good accuracy even with sparse flow velocity measurements.
","[{'version': 'v1', 'created': 'Tue, 23 Nov 2021 08:27:48 GMT'}]",2022-11-23,"[['Forghani', 'Mojtaba', ''], ['Qian', 'Yizhou', ''], ['Lee', 'Jonghyun', ''], ['Farthing', 'Matthew', ''], ['Hesser', 'Tyler', ''], ['Kitanidis', 'Peter K.', ''], ['Darve', 'Eric F.', '']]","['deep learning', 'inverse modeling', 'reduced-order models', 'riverine bathymetry', 'variational encoder', 'Bayesian estimation']"
10670,2009.01328,Shuyue Guan,"Shuyue Guan, Murray Loew","An Internal Cluster Validity Index Using a Distance-based Separability
  Measure","8 pages, 4 figures. Accepted by IEEE ICTAI 2020 (Long Paper & Oral
  Presentation)","IEEE 32nd International Conference on Tools with Artificial
  Intelligence (ICTAI), 2020, pp. 827-834",10.1109/ICTAI50040.2020.00131,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To evaluate clustering results is a significant part of cluster analysis.
There are no true class labels for clustering in typical unsupervised learning.
Thus, a number of internal evaluations, which use predicted labels and data,
have been created. They are also named internal cluster validity indices
(CVIs). Without true labels, to design an effective CVI is not simple because
it is similar to create a clustering method. And, to have more CVIs is crucial
because there is no universal CVI that can be used to measure all datasets, and
no specific method for selecting a proper CVI for clusters without true labels.
Therefore, to apply more CVIs to evaluate clustering results is necessary. In
this paper, we propose a novel CVI - called Distance-based Separability Index
(DSI), based on a data separability measure. We applied the DSI and eight other
internal CVIs including early studies from Dunn (1974) to most recent studies
CVDD (2019) as comparison. We used an external CVI as ground truth for
clustering results of five clustering algorithms on 12 real and 97 synthetic
datasets. Results show DSI is an effective, unique, and competitive CVI to
other compared CVIs. In addition, we summarized the general process to evaluate
CVIs and created a new method - rank difference - to compare the results of
CVIs.
","[{'version': 'v1', 'created': 'Wed, 2 Sep 2020 20:20:29 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Jan 2021 21:22:03 GMT'}]",2021-01-06,"[['Guan', 'Shuyue', ''], ['Loew', 'Murray', '']]","['cluster validity', 'cluster validity index evaluation', 'clustering analysis', 'separability measure', 'distance-based separability index', 'sequence comparison']"
10671,2103.16683,Roza Goscien,R\'o\.za Go\'scie\'n,"On the Efficient Design of Network Resilient to Electro-Magnetic Pulse
  Attack -- Elastic Optical Network Case Study",,"Computer Communications 179, pp. 272-284, 2021",10.1016/j.comcom.2021.08.025,,cs.NI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The telecommunication networks have become an indispensable part of our
everyday life, providing support for such important areas as business,
education, health care, finances, entertainment and social life. Alongside
their continuous and uninterrupted operation is required while numerous new
threats and attack scenarios emerge. The international security organisations
warn against increasing likelihood of nuclear weapon or electro-magnetic pulse
(EMP) attacks, which can be extremely harmful also for transport networks. On
that background, we study efficient design of network resilient to EMP attack
wherein the required protection level is provided by the application of
multipath routing and military grade bunkers (advanced electro-magnetic
radiation resilient approaches protecting whole network node) implementation.
Formally, we define and study problem of bunkers location, routing and spectrum
allocation (BLRSA) in elastic optical network (EON). In the problem objective
we address two criteria - network resilience (measured by the average lost flow
per potential attack) and spectrum usage. For that problem we propose integer
linear programming (ILP) model and two dedicated heuristics - 1S-RSA and
2S-RSA. Then, we perform extensive numerical experiments divided into three
parts: (i) tuning of the proposed approaches, (ii) comparison with reference
methods, (iii) realistic case study - efficient EMP-resilient network design.
In the case study we analyze benefits and costs of the proposed protection
scheme. Moreover, we also analyze vulnerabilities of three realistic network
topologies to EMP attacks and identify their critical nodes. The investigation
proves high efficiency of the proposed approaches and shows that they allow to
save up to 90% of traffic lost in the case of no protection against these types
of attacks.
","[{'version': 'v1', 'created': 'Tue, 30 Mar 2021 21:11:40 GMT'}]",2021-11-10,"[['Goścień', 'Róża', '']]","['network design', 'network protection', 'multipath routing', 'elastic optical network', 'electromagnetic pulse', 'large scale disaster']"
10672,1909.01167,Abraham Glasser,"Abraham Glasser, Kesavan Kushalnagar, Raja Kushalnagar","Feasibility of Using Automatic Speech Recognition with Voices of Deaf
  and Hard-of-Hearing Individuals","2 pages, 3 figures",,10.1145/3132525.3134819,,cs.HC cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many personal devices have transitioned from visual-controlled interfaces to
speech-controlled interfaces to reduce device costs and interactive friction.
This transition has been hastened by the increasing capabilities of
speech-controlled interfaces, e.g., Amazon Echo or Apple's Siri. A consequence
is that people who are deaf or hard of hearing (DHH) may be unable to use these
speech-controlled devices. We show that deaf speech has a high error rate
compared to hearing speech, in commercial speech-controlled interfaces. Deaf
speech had approximately a 78% word error rate (WER) compared to a hearing
speech 18% WER. Our findings show that current speech-controlled interfaces are
not usable by deaf and hard of hearing people. Therefore, it might be wise to
pursue other methods for deaf persons to deliver natural commands to computers.
","[{'version': 'v1', 'created': 'Tue, 3 Sep 2019 13:33:25 GMT'}]",2019-09-04,"[['Glasser', 'Abraham', ''], ['Kushalnagar', 'Kesavan', ''], ['Kushalnagar', 'Raja', '']]","['Automatic Speech Recognition', 'Deaf Speech', 'Hearing Speech', 'Word Error Rate', 'Deaf', 'Hearing']"
10673,2011.11263,Raviraj Joshi,"Ramchandra Joshi, Raviraj Joshi","Evaluating Input Representation for Language Identification in
  Hindi-English Code Mixed Text",Accepted at ICDSMLA 2020,,10.1007/978-981-16-3690-5_73,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Natural language processing (NLP) techniques have become mainstream in the
recent decade. Most of these advances are attributed to the processing of a
single language. More recently, with the extensive growth of social media
platforms focus has shifted to code-mixed text. The code-mixed text comprises
text written in more than one language. People naturally tend to combine local
language with global languages like English. To process such texts, current NLP
techniques are not sufficient. As a first step, the text is processed to
identify the language of the words in the text. In this work, we focus on
language identification in code-mixed sentences for Hindi-English mixed text.
The task of language identification is formulated as a token classification
task. In the supervised setting, each word in the sentence has an associated
language label. We evaluate different deep learning models and input
representation combinations for this task. Mainly, character, sub-word, and
word embeddings are considered in combination with CNN and LSTM based models.
We show that sub-word representation along with the LSTM model gives the best
results. In general sub-word representations perform significantly better than
other input representations. We report the best accuracy of 94.52% using a
single layer LSTM model on the standard SAIL ICON 2017 test set.
","[{'version': 'v1', 'created': 'Mon, 23 Nov 2020 08:08:09 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Nov 2020 13:22:04 GMT'}]",2022-01-12,"[['Joshi', 'Ramchandra', ''], ['Joshi', 'Raviraj', '']]","['code mixing', 'language identification', 'sub word representation', 'convolutional neural networks', 'long short term memory']"
10674,2209.06557,Ahmed Fraz Baig,Ahmed Fraz Baig and Sigurd Eskeland,"A Generic Privacy-Preserving Protocol For Keystroke Dynamics-Based
  Continuous Authentication","Baig, A. and Eskeland, S. A Generic Privacy-preserving Protocol for
  Keystroke Dynamics-based Continuous Authentication.In Proceedings of the 19th
  International Conference on Security and Cryptography (SECRYPT 2022), pages
  491-498 ISBN: 978-989-758-590-6; ISSN: 2184-7711","In Proceedings of the 19th International Conference on Security
  and Cryptography (SECRYPT 2022), pages 491-498 ISBN: 978-989-758-590-6; ISSN:
  2184-7711",10.5220/0011141400003283,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Continuous authentication utilizes automatic recognition of certain user
features for seamless and passive authentication without requiring user
attention. Such features can be divided into categories of physiological
biometrics and behavioral biometrics. Keystroke dynamics is proposed for
behavioral biometrics-oriented authentication by recognizing users by means of
their typing patterns. However, it has been pointed out that continuous
authentication using physiological biometrics and behavior biometrics incur
privacy risks, revealing personal characteristics and activities. In this
paper, we consider a previously proposed keystroke dynamics-based
authentication scheme that has no privacy-preserving properties. In this
regard, we propose a generic privacy-preserving version of this authentication
scheme in which all user features are encrypted -- preventing disclosure of
those to the authentication server. Our scheme is generic in the sense that it
assumes homomorphic cryptographic primitives. Authentication is conducted on
the basis of encrypted data due to the homomorphic cryptographic properties of
our protocol.
","[{'version': 'v1', 'created': 'Wed, 14 Sep 2022 11:27:53 GMT'}]",2022-09-15,"[['Baig', 'Ahmed Fraz', ''], ['Eskeland', 'Sigurd', '']]","['Continuous Authentication', 'Homomorphic Encryption', 'Keystroke dynamics', 'Behavioral biometrics']"
10675,1804.00656,Claudio Sanhueza,"Claudio Sanhueza, Francia Jim\'enez, Regina Berretta and Pablo Moscato","mQAPViz: A divide-and-conquer multi-objective optimization algorithm to
  compute large data visualizations","Proceeding GECCO 18 Proceedings of the Genetic and Evolutionary
  Computation Conference. Pages 737-744 Kyoto, Japan - July 15 - 19, 2018",,10.1145/3205455.3205457,,cs.HC cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Algorithms for data visualizations are essential tools for transforming data
into useful narratives. Unfortunately, very few visualization algorithms can
handle the large datasets of many real-world scenarios. In this study, we
address the visualization of these datasets as a Multi-Objective Optimization
Problem. We propose mQAPViz, a divide-and-conquer multi-objective optimization
algorithm to compute large-scale data visualizations. Our method employs the
Multi-Objective Quadratic Assignment Problem (mQAP) as the mathematical
foundation to solve the visualization task at hand. The algorithm applies
advanced sampling techniques originating from the field of machine learning and
efficient data structures to scale to millions of data objects. The algorithm
allocates objects onto a 2D grid layout. Experimental results on real-world and
large datasets demonstrate that mQAPViz is a competitive alternative to
existing techniques.
","[{'version': 'v1', 'created': 'Mon, 2 Apr 2018 09:55:10 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Jun 2018 07:01:14 GMT'}, {'version': 'v3', 'created': 'Tue, 30 Oct 2018 03:10:30 GMT'}]",2018-10-31,"[['Sanhueza', 'Claudio', ''], ['Jiménez', 'Francia', ''], ['Berretta', 'Regina', ''], ['Moscato', 'Pablo', '']]","['Multi-Objective Optimization', 'Visualization', 'Large Datasets']"
10676,2007.08277,Martin Krejca,Benjamin Doerr and Martin S. Krejca,"The Univariate Marginal Distribution Algorithm Copes Well With Deception
  and Epistasis",,Evolutionary Computation (2021) 29 (4): 543-563,10.1162/evco_a_00293,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In their recent work, Lehre and Nguyen (FOGA 2019) show that the univariate
marginal distribution algorithm (UMDA) needs time exponential in the parent
populations size to optimize the DeceptiveLeadingBlocks (DLB) problem. They
conclude from this result that univariate EDAs have difficulties with deception
and epistasis.
  In this work, we show that this negative finding is caused by an unfortunate
choice of the parameters of the UMDA. When the population sizes are chosen
large enough to prevent genetic drift, then the UMDA optimizes the DLB problem
with high probability with at most $\lambda(\frac{n}{2} + 2 e \ln n)$ fitness
evaluations. Since an offspring population size $\lambda$ of order $n \log n$
can prevent genetic drift, the UMDA can solve the DLB problem with $O(n^2 \log
n)$ fitness evaluations. In contrast, for classic evolutionary algorithms no
better run time guarantee than $O(n^3)$ is known (which we prove to be tight
for the ${(1+1)}$ EA), so our result rather suggests that the UMDA can cope
well with deception and epistatis.
  From a broader perspective, our result shows that the UMDA can cope better
with local optima than evolutionary algorithms; such a result was previously
known only for the compact genetic algorithm. Together with the lower bound of
Lehre and Nguyen, our result for the first time rigorously proves that running
EDAs in the regime with genetic drift can lead to drastic performance losses.
","[{'version': 'v1', 'created': 'Thu, 16 Jul 2020 12:07:09 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Nov 2020 09:19:31 GMT'}]",2022-04-28,"[['Doerr', 'Benjamin', ''], ['Krejca', 'Martin S.', '']]","['Estimation-of-distribution algorithm', 'univariate marginal distribution algorithm', 'runtime analysis', 'epistasis', 'theory']"
10677,2208.03288,Soumyajit Karmakar,"Soumyajit Karmakar, Abeer Banerjee, Prashant Sadashiv Gidde, Sumeet
  Saurav, Sanjay Singh",Convolutional Ensembling based Few-Shot Defect Detection Technique,"7 pages, 7 images",,10.1145/3571600.3571607,,cs.CV cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Over the past few years, there has been a significant improvement in the
domain of few-shot learning. This learning paradigm has shown promising results
for the challenging problem of anomaly detection, where the general task is to
deal with heavy class imbalance. Our paper presents a new approach to few-shot
classification, where we employ the knowledge-base of multiple pre-trained
convolutional models that act as the backbone for our proposed few-shot
framework. Our framework uses a novel ensembling technique for boosting the
accuracy while drastically decreasing the total parameter count, thus paving
the way for real-time implementation. We perform an extensive hyperparameter
search using a power-line defect detection dataset and obtain an accuracy of
92.30% for the 5-way 5-shot task. Without further tuning, we evaluate our model
on competing standards with the existing state-of-the-art methods and
outperform them.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2022 17:29:14 GMT'}, {'version': 'v2', 'created': 'Sun, 21 Aug 2022 10:33:41 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Nov 2022 12:06:50 GMT'}]",2022-11-24,"[['Karmakar', 'Soumyajit', ''], ['Banerjee', 'Abeer', ''], ['Gidde', 'Prashant Sadashiv', ''], ['Saurav', 'Sumeet', ''], ['Singh', 'Sanjay', '']]","['Few-Shot Classification', 'Anomaly Detection', 'Ensemling Strategy']"
10678,2004.05628,Reena Nair,Reena Nair and Tony Field,"GAPP: A Fast Profiler for Detecting Serialization Bottlenecks in
  Parallel Linux Applications",8 pages,,10.1145/3358960.3379136,,cs.PF cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a parallel profiling tool, GAPP, that identifies serialization
bottlenecks in parallel Linux applications arising from load imbalance or
contention for shared resources . It works by tracing kernel context switch
events using kernel probes managed by the extended Berkeley Packet Filter
(eBPF) framework. The overhead is thus extremely low (an average 4% run time
overhead for the applications explored), the tool requires no program
instrumentation and works for a variety of serialization bottlenecks. We
evaluate GAPP using the Parsec3.0 benchmark suite and two large open-source
projects: MySQL and Nektar++ (a spectral/hp element framework). We show that
GAPP is able to reveal a wide range of bottleneck-related performance issues,
for example arising from synchronization primitives, busy-wait loops, memory
operations, thread imbalance and resource contention.
","[{'version': 'v1', 'created': 'Sun, 12 Apr 2020 15:01:04 GMT'}]",2020-04-14,"[['Nair', 'Reena', ''], ['Field', 'Tony', '']]","['Bottlenecks', 'Multithreaded', 'Parallel', 'Profiler', 'Kernel Tracing', 'eBPF', 'Context-switch']"
10679,1712.03714,Yann Strozecki,Arnaud Mary and Yann Strozecki,Efficient enumeration of solutions produced by closure operations,"30 pages, 1 figure. Long version of the article arXiv:1509.05623 of
  the same name which appeared in STACS 2016. Final version for DMTCS journal","Discrete Mathematics & Theoretical Computer Science, Vol. 21 no. 3
  , Discrete Algorithms (June 13, 2019) dmtcs:5549",10.23638/DMTCS-21-3-22,,cs.CC cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we address the problem of generating all elements obtained by
the saturation of an initial set by some operations. More precisely, we prove
that we can generate the closure of a boolean relation (a set of boolean
vectors) by polymorphisms with a polynomial delay. Therefore we can compute
with polynomial delay the closure of a family of sets by any set of ""set
operations"": union, intersection, symmetric difference, subsets, supersets
$\dots$). To do so, we study the $Membership_{\mathcal{F}}$ problem: for a set
of operations $\mathcal{F}$, decide whether an element belongs to the closure
by $\mathcal{F}$ of a family of elements. In the boolean case, we prove that
$Membership_{\mathcal{F}}$ is in P for any set of boolean operations
$\mathcal{F}$. When the input vectors are over a domain larger than two
elements, we prove that the generic enumeration method fails, since
$Membership_{\mathcal{F}}$ is NP-hard for some $\mathcal{F}$. We also study the
problem of generating minimal or maximal elements of closures and prove that
some of them are related to well known enumeration problems such as the
enumeration of the circuits of a matroid or the enumeration of maximal
independent sets of a hypergraph. This article improves on previous works of
the same authors.
","[{'version': 'v1', 'created': 'Mon, 11 Dec 2017 10:52:13 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Sep 2018 19:59:50 GMT'}, {'version': 'v3', 'created': 'Thu, 18 Apr 2019 10:24:03 GMT'}, {'version': 'v4', 'created': 'Wed, 5 Jun 2019 12:49:09 GMT'}]",2019-11-20,"[['Mary', 'Arnaud', ''], ['Strozecki', 'Yann', '']]","['enumeration', 'set saturation', 'incremental polynomial time', 'polynomial delay', 'Post’s lattice', 'maximalindependent sets']"
10680,1905.01963,Junxin Liu,"Junxin Liu, Fangzhao Wu, Chuhan Wu, Yongfeng Huang, Xing Xie","Neural Chinese Word Segmentation with Lexicon and Unlabeled Data via
  Posterior Regularization","7 pages, 11 figures, accepted by the 2019 World Wide Web Conference
  (WWW '19)",,10.1145/3308558.3313437,,cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing methods for CWS usually rely on a large number of labeled sentences
to train word segmentation models, which are expensive and time-consuming to
annotate. Luckily, the unlabeled data is usually easy to collect and many
high-quality Chinese lexicons are off-the-shelf, both of which can provide
useful information for CWS. In this paper, we propose a neural approach for
Chinese word segmentation which can exploit both lexicon and unlabeled data.
Our approach is based on a variant of posterior regularization algorithm, and
the unlabeled data and lexicon are incorporated into model training as indirect
supervision by regularizing the prediction space of CWS models. Extensive
experiments on multiple benchmark datasets in both in-domain and cross-domain
scenarios validate the effectiveness of our approach.
","[{'version': 'v1', 'created': 'Fri, 26 Apr 2019 08:21:08 GMT'}]",2019-05-07,"[['Liu', 'Junxin', ''], ['Wu', 'Fangzhao', ''], ['Wu', 'Chuhan', ''], ['Huang', 'Yongfeng', ''], ['Xie', 'Xing', '']]","['Chinese word segmentation', 'Lexicon', 'Neural network']"
10681,cs/0606025,Xiaowen Zhang,"Xiaowen Zhang, Li Shu, Ke Tang",A Chaotic Cipher Mmohocc and Its Security Analysis,"14 pages, 4 figures, 4 tables",,10.1117/12.717682,,cs.CR,,"  In this paper we introduce a new chaotic stream cipher Mmohocc which utilizes
the fundamental chaos characteristics. The designs of the major components of
the cipher are given. Its cryptographic properties of period, auto- and
cross-correlations, and the mixture of Markov processes and spatiotemporal
effects are investigated. The cipher is resistant to the related-key-IV
attacks, Time/Memory/Data tradeoff attacks, algebraic attacks, and chosen-text
attacks. The keystreams successfully passed two batteries of statistical tests
and the encryption speed is comparable with RC4.
","[{'version': 'v1', 'created': 'Tue, 6 Jun 2006 17:42:56 GMT'}]",2009-11-11,"[['Zhang', 'Xiaowen', ''], ['Shu', 'Li', ''], ['Tang', 'Ke', '']]","['chaos', 'chaotic map and orbit', 'stream cipher', 'security analysis']"
10682,2104.09936,Zhenning Li,"Zhenning Li, Hao Yu, Guohui Zhang, Shangjia Dong, Cheng-Zhong Xu","Network-wide traffic signal control optimization using a multi-agent
  deep reinforcement learning",,"Transportation Research Part C: Emerging Technologies Volume 125,
  April 2021, 103059",10.1016/j.trc.2021.103059,,cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Inefficient traffic control may cause numerous problems such as traffic
congestion and energy waste. This paper proposes a novel multi-agent
reinforcement learning method, named KS-DDPG (Knowledge Sharing Deep
Deterministic Policy Gradient) to achieve optimal control by enhancing the
cooperation between traffic signals. By introducing the knowledge-sharing
enabled communication protocol, each agent can access to the collective
representation of the traffic environment collected by all agents. The proposed
method is evaluated through two experiments respectively using synthetic and
real-world datasets. The comparison with state-of-the-art reinforcement
learning-based and conventional transportation methods demonstrate the proposed
KS-DDPG has significant efficiency in controlling large-scale transportation
networks and coping with fluctuations in traffic flow. In addition, the
introduced communication mechanism has also been proven to speed up the
convergence of the model without significantly increasing the computational
burden.
","[{'version': 'v1', 'created': 'Tue, 20 Apr 2021 12:53:08 GMT'}]",2021-07-14,"[['Li', 'Zhenning', ''], ['Yu', 'Hao', ''], ['Zhang', 'Guohui', ''], ['Dong', 'Shangjia', ''], ['Xu', 'Cheng-Zhong', '']]","['Multi-agent reinforcement learning', 'Knowledge sharing', 'Adaptive trafficsignal control', 'Deep learning', 'Transportation network']"
10683,2203.02486,Thomas Dietterich,"Thomas G. Dietterich, Alexander Guyer","The Familiarity Hypothesis: Explaining the Behavior of Deep Open Set
  Methods","Accepted for publication in Pattern Recognition. This version
  corrects minor typos",,10.1016/j.patcog.2022.108931,,cs.CV cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In many object recognition applications, the set of possible categories is an
open set, and the deployed recognition system will encounter novel objects
belonging to categories unseen during training. Detecting such ""novel category""
objects is usually formulated as an anomaly detection problem. Anomaly
detection algorithms for feature-vector data identify anomalies as outliers,
but outlier detection has not worked well in deep learning. Instead, methods
based on the computed logits of visual object classifiers give state-of-the-art
performance. This paper proposes the Familiarity Hypothesis that these methods
succeed because they are detecting the absence of familiar learned features
rather than the presence of novelty. This distinction is important, because
familiarity-based detection will fail in many situations where novelty is
present. For example when an image contains both a novel object and a familiar
one, the familiarity score will be high, so the novel object will not be
noticed. The paper reviews evidence from the literature and presents additional
evidence from our own experiments that provide strong support for this
hypothesis. The paper concludes with a discussion of whether familiarity-based
detection is an inevitable consequence of representation learning.
","[{'version': 'v1', 'created': 'Fri, 4 Mar 2022 18:32:58 GMT'}, {'version': 'v2', 'created': 'Fri, 27 May 2022 21:48:59 GMT'}, {'version': 'v3', 'created': 'Fri, 24 Jun 2022 23:45:35 GMT'}, {'version': 'v4', 'created': 'Wed, 27 Jul 2022 22:12:29 GMT'}]",2022-07-29,"[['Dietterich', 'Thomas G.', ''], ['Guyer', 'Alexander', '']]","['Anomaly Detection', 'Open Set Learning', 'Computer Vision', 'Object Recognition', 'Novel Category Detection', 'Representation Learning', 'Deep Learning']"
10684,2005.10295,Jos\'e Dihego,Jos\'e Dihego and Augusto Sampaio and Marcel Oliveira,"A refinement checking based strategy for component-based systems
  evolution",The Journal of Systems and Software,,10.1016/j.jss.2020.110598,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose inheritance and refinement relations for a CSP-based component
model (BRIC), which supports a constructive design based on composition rules
that preserve classical concurrency properties such as deadlock freedom. The
proposed relations allow extension of functionality, whilst preserving
behavioural properties. A notion of extensibility is defined on top of a
behavioural relation called convergence, which distinguishes inputs from
outputs and the context where they are communicated, allowing extensions to
reuse existing events with different purposes. We mechanise the strategy for
extensibility verification using the FDR4 tool, and illustrate our results with
an autonomous healthcare robot case study.
","[{'version': 'v1', 'created': 'Wed, 20 May 2020 18:18:07 GMT'}]",2020-05-22,"[['Dihego', 'José', ''], ['Sampaio', 'Augusto', ''], ['Oliveira', 'Marcel', '']]","['component extensibility', 'correctness by construction', 'behavioural']"
10685,1805.04246,Tomohiko Mizutani,Tomohiko Mizutani,Convex Programming Based Spectral Clustering,32 pages,"Machine Learning, volume 110, pages 933-964 (2021)",10.1007/s10994-020-05940-1,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering is a fundamental task in data analysis, and spectral clustering
has been recognized as a promising approach to it. Given a graph describing the
relationship between data, spectral clustering explores the underlying cluster
structure in two stages. The first stage embeds the nodes of the graph in real
space, and the second stage groups the embedded nodes into several clusters.
The use of the $k$-means method in the grouping stage is currently standard
practice. We present a spectral clustering algorithm that uses convex
programming in the grouping stage and study how well it works. This algorithm
is designed based on the following observation. If a graph is well-clustered,
then the nodes with the largest degree in each cluster can be found by
computing an enclosing ellipsoid of the nodes embedded in real space, and the
clusters can be identified by using those nodes. We show that, for
well-clustered graphs, the algorithm can find clusters of nodes with minimal
conductance. We also give an experimental assessment of the algorithm's
performance.
","[{'version': 'v1', 'created': 'Fri, 11 May 2018 06:11:03 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Apr 2020 15:58:21 GMT'}, {'version': 'v3', 'created': 'Tue, 22 Dec 2020 06:21:33 GMT'}]",2021-09-08,"[['Mizutani', 'Tomohiko', '']]","['spectral clustering', 'Laplacian', 'conductance', 'convex programming']"
10686,2108.04979,Kazuhiro Takemoto,"Kazuki Koga, Kazuhiro Takemoto","Simple black-box universal adversarial attacks on medical image
  classification based on deep neural networks","19 pages, 3 figures, 2 tables","Algorithms 15(5), 144 (2022)",10.3390/a15050144,,cs.CV cs.CR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Universal adversarial attacks, which hinder most deep neural network (DNN)
tasks using only a small single perturbation called a universal adversarial
perturbation (UAP), is a realistic security threat to the practical application
of a DNN. In particular, such attacks cause serious problems in medical
imaging. Given that computer-based systems are generally operated under a
black-box condition in which only queries on inputs are allowed and outputs are
accessible, the impact of UAPs seems to be limited because well-used algorithms
for generating UAPs are limited to a white-box condition in which adversaries
can access the model weights and loss gradients. Nevertheless, we demonstrate
that UAPs are easily generatable using a relatively small dataset under
black-box conditions. In particular, we propose a method for generating UAPs
using a simple hill-climbing search based only on DNN outputs and demonstrate
the validity of the proposed method using representative DNN-based medical
image classifications. Black-box UAPs can be used to conduct both non-targeted
and targeted attacks. Overall, the black-box UAPs showed high attack success
rates (40% to 90%), although some of them had relatively low success rates
because the method only utilizes limited information to generate UAPs. The
vulnerability of black-box UAPs was observed in several model architectures.
The results indicate that adversaries can also generate UAPs through a simple
procedure under the black-box condition to foil or control DNN-based medical
image diagnoses, and that UAPs are a more realistic security threat.
","[{'version': 'v1', 'created': 'Wed, 11 Aug 2021 00:59:34 GMT'}]",2022-04-26,"[['Koga', 'Kazuki', ''], ['Takemoto', 'Kazuhiro', '']]","['deep neural networks', 'medical imaging', 'adversarial attacks', 'security and privacy']"
10687,1909.09767,Zehui Yao,"Zehui Yao, Boyan Zhang, Zhiyong Wang, Wanli Ouyang, Dong Xu, Dagan
  Feng","IntersectGAN: Learning Domain Intersection for Generating Images with
  Multiple Attributes",,,10.1145/3343031.3350908,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generative adversarial networks (GANs) have demonstrated great success in
generating various visual content. However, images generated by existing GANs
are often of attributes (e.g., smiling expression) learned from one image
domain. As a result, generating images of multiple attributes requires many
real samples possessing multiple attributes which are very resource expensive
to be collected. In this paper, we propose a novel GAN, namely IntersectGAN, to
learn multiple attributes from different image domains through an intersecting
architecture. For example, given two image domains $X_1$ and $X_2$ with certain
attributes, the intersection $X_1 \cap X_2$ denotes a new domain where images
possess the attributes from both $X_1$ and $X_2$ domains. The proposed
IntersectGAN consists of two discriminators $D_1$ and $D_2$ to distinguish
between generated and real samples of different domains, and three generators
where the intersection generator is trained against both discriminators. And an
overall adversarial loss function is defined over three generators. As a
result, our proposed IntersectGAN can be trained on multiple domains of which
each presents one specific attribute, and eventually eliminates the need of
real sample images simultaneously possessing multiple attributes. By using the
CelebFaces Attributes dataset, our proposed IntersectGAN is able to produce
high quality face images possessing multiple attributes (e.g., a face with
black hair and a smiling expression). Both qualitative and quantitative
evaluations are conducted to compare our proposed IntersectGAN with other
baseline methods. Besides, several different applications of IntersectGAN have
been explored with promising results.
","[{'version': 'v1', 'created': 'Sat, 21 Sep 2019 03:40:02 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Oct 2019 10:18:21 GMT'}]",2019-10-04,"[['Yao', 'Zehui', ''], ['Zhang', 'Boyan', ''], ['Wang', 'Zhiyong', ''], ['Ouyang', 'Wanli', ''], ['Xu', 'Dong', ''], ['Feng', 'Dagan', '']]","['Image generation', 'Deep learning', 'Generative adversarial networks']"
10688,1507.05819,Joss Wright,"Joss Wright, Alexander Darer, Oliver Farnan","On Identifying Anomalies in Tor Usage with Applications in Detecting
  Internet Censorship",To appear in ACM WebSci 2018,,10.1145/3201064.3201093,,cs.CY cs.LG cs.NI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We develop a means to detect ongoing per-country anomalies in the daily usage
metrics of the Tor anonymous communication network, and demonstrate the
applicability of this technique to identifying likely periods of internet
censorship and related events. The presented approach identifies contiguous
anomalous periods, rather than daily spikes or drops, and allows anomalies to
be ranked according to deviation from expected behaviour.
  The developed method is implemented as a running tool, with outputs published
daily by mailing list. This list highlights per-country anomalous Tor usage,
and produces a daily ranking of countries according to the level of detected
anomalous behaviour. This list has been active since August 2016, and is in use
by a number of individuals, academics, and NGOs as an early warning system for
potential censorship events.
  We focus on Tor, however the presented approach is more generally applicable
to usage data of other services, both individually and in combination. We
demonstrate that combining multiple data sources allows more specific
identification of likely Tor blocking events. We demonstrate the our approach
in comparison to existing anomaly detection tools, and against both known
historical internet censorship events and synthetic datasets. Finally, we
detail a number of significant recent anomalous events and behaviours
identified by our tool.
","[{'version': 'v1', 'created': 'Tue, 21 Jul 2015 13:17:24 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Aug 2016 22:02:03 GMT'}, {'version': 'v3', 'created': 'Thu, 12 Apr 2018 15:54:04 GMT'}]",2018-04-13,"[['Wright', 'Joss', ''], ['Darer', 'Alexander', ''], ['Farnan', 'Oliver', '']]","['information controls', 'censorship', 'filtering', 'anomaly detection']"
10689,2101.03733,Nevin Vunka Jungum,"Nevin Vunka Jungum, Nawaz Mohamudally and Nimal Nissanke","A Fault Tolerant Mechanism for Partitioning and Offloading Framework in
  Pervasive Environments",,"International Journal of Computer Science Issues, Vol 17, Issue 6,
  November 2020",10.5281/zenodo.4431214,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Application partitioning and code offloading are being researched extensively
during the past few years. Several frameworks for code offloading have been
proposed. However, fewer works attempted to address issues occurred with its
implementation in pervasive environments such as frequent network disconnection
due to high mobility of users. Thus, in this paper, we proposed a fault
tolerant algorithm that helps in consolidating the efficiency and robustness of
application partitioning and offloading frameworks. To permit the usage of
different fault tolerant policies such as replication and checkpointing, the
devices are grouped into high and low reliability clusters. Experimental
results shown that the fault tolerant algorithm can easily adapt to different
execution conditions while incurring minimum overhead.
","[{'version': 'v1', 'created': 'Mon, 11 Jan 2021 07:33:56 GMT'}, {'version': 'v2', 'created': 'Sun, 19 Sep 2021 11:09:22 GMT'}]",2021-09-21,"[['Jungum', 'Nevin Vunka', ''], ['Mohamudally', 'Nawaz', ''], ['Nissanke', 'Nimal', '']]","['application partitioning and offloading', 'mobile codes', 'fault tolerant', 'pervasive environment']"
10690,2212.11868,Xiaoyu Zhang,"Xiaoyu Zhang, Xin Xin, Dongdong Li, Wenxuan Liu, Pengjie Ren, Zhumin
  Chen, Jun Ma, Zhaochun Ren","Variational Reasoning over Incomplete Knowledge Graphs for
  Conversational Recommendation",,,10.1145/3539597.3570426,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Conversational recommender systems (CRSs) often utilize external knowledge
graphs (KGs) to introduce rich semantic information and recommend relevant
items through natural language dialogues. However, original KGs employed in
existing CRSs are often incomplete and sparse, which limits the reasoning
capability in recommendation. Moreover, only few of existing studies exploit
the dialogue context to dynamically refine knowledge from KGs for better
recommendation. To address the above issues, we propose the Variational
Reasoning over Incomplete KGs Conversational Recommender (VRICR). Our key idea
is to incorporate the large dialogue corpus naturally accompanied with CRSs to
enhance the incomplete KGs; and perform dynamic knowledge reasoning conditioned
on the dialogue context. Specifically, we denote the dialogue-specific
subgraphs of KGs as latent variables with categorical priors for adaptive
knowledge graphs refactor. We propose a variational Bayesian method to
approximate posterior distributions over dialogue-specific subgraphs, which not
only leverages the dialogue corpus for restructuring missing entity relations
but also dynamically selects knowledge based on the dialogue context. Finally,
we infuse the dialogue-specific subgraphs to decode the recommendation and
responses. We conduct experiments on two benchmark CRSs datasets. Experimental
results confirm the effectiveness of our proposed method.
","[{'version': 'v1', 'created': 'Thu, 22 Dec 2022 17:02:21 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Dec 2022 06:41:01 GMT'}]",2022-12-26,"[['Zhang', 'Xiaoyu', ''], ['Xin', 'Xin', ''], ['Li', 'Dongdong', ''], ['Liu', 'Wenxuan', ''], ['Ren', 'Pengjie', ''], ['Chen', 'Zhumin', ''], ['Ma', 'Jun', ''], ['Ren', 'Zhaochun', '']]","['Conversational recommender systems', 'Knowledge graph enhancement', 'Variational inference', 'Knowledge refinement']"
10691,2207.01298,Jingyao Zhang,"Jingyao Zhang, Hoda Naghibijouybari, Elaheh Sadredini","Sealer: In-SRAM AES for High-Performance and Low-Overhead Memory
  Encryption","6 pages, ISLPED 2022",,10.1145/3531437.3539699,,cs.CR cs.AR,http://creativecommons.org/licenses/by/4.0/,"  To provide data and code confidentiality and reduce the risk of information
leak from memory or memory bus, computing systems are enhanced with encryption
and decryption engine. Despite massive efforts in designing hardware
enhancements for data and code protection, existing solutions incur significant
performance overhead as the encryption/decryption is on the critical path. In
this paper, we present Sealer, a high-performance and low-overhead in-SRAM
memory encryption engine by exploiting the massive parallelism and bitline
computational capability of SRAM subarrays. Sealer encrypts data before sending
it off-chip and decrypts it upon receiving the memory blocks, thus, providing
data confidentiality. Our proposed solution requires only minimal modifications
to the existing SRAM peripheral circuitry. Sealer can achieve up to two orders
of magnitude throughput-per-area improvement while consuming 3x less energy
compared to the prior solutions.
","[{'version': 'v1', 'created': 'Mon, 4 Jul 2022 10:04:05 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Aug 2022 07:39:19 GMT'}]",2022-08-17,"[['Zhang', 'Jingyao', ''], ['Naghibijouybari', 'Hoda', ''], ['Sadredini', 'Elaheh', '']]","['computer architecture', 'SRAM', 'AES']"
10692,cs/0107030,Gilles Van Assche,"G. Van Assche (1), J. Cardinal (1) and N. J. Cerf (1 and 2) ((1) ULB,
  (2) JPL/Caltech)",Reconciliation of a Quantum-Distributed Gaussian Key,"8 pages, 4 figures. Submitted to the IEEE for possible publication.
  Revised version to improve its clarity","IEEE Trans. Inform. Theory, vol. 50, p. 394, Feb. 2004",10.1109/TIT.2003.822618,,cs.CR quant-ph,,"  Two parties, Alice and Bob, wish to distill a binary secret key out of a list
of correlated variables that they share after running a quantum key
distribution protocol based on continuous-spectrum quantum carriers. We present
a novel construction that allows the legitimate parties to get equal bit
strings out of correlated variables by using a classical channel, with as few
leaked information as possible. This opens the way to securely correcting
non-binary key elements. In particular, the construction is refined to the case
of Gaussian variables as it applies directly to recent continuous-variable
protocols for quantum key distribution.
","[{'version': 'v1', 'created': 'Fri, 20 Jul 2001 15:59:40 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Jul 2001 09:22:50 GMT'}, {'version': 'v3', 'created': 'Tue, 24 Dec 2002 14:28:02 GMT'}]",2007-05-23,"[['Van Assche', 'G.', '', '1 and 2'], ['Cardinal', 'J.', '', '1 and 2'], ['Cerf', 'N. J.', '', '1 and 2']]","['Cryptography', 'secret-key agreement', 'privacyamplification', 'quantum secret key distribution']"
10693,1704.01143,Tobias Bornakke,"Jakob Baek Kristensen, Thomas Albrechtsen, Emil Dahlgaard, Michael
  Jensen, Magnus Skovrind, Tobias Bornakke","Parsimonious Data: How a single Facebook like predicts voting behaviour
  in multiparty systems",,,10.1371/journal.pone.0184562,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, two influential PNAS papers have shown how our preferences for
'Hello Kitty' and 'Harley Davidson', obtained through Facebook likes, can
accurately predict details about our personality, religiosity, political
attitude and sexual orientation (Konsinski et al. 2013; Youyou et al 2015). In
this paper, we make the claim that though the wide variety of Facebook likes
might predict such personal traits, even more accurate and generalizable
results can be reached through applying a contexts-specific, parsimonious data
strategy. We built this claim by predicting present day voter intention based
solely on likes directed toward posts from political actors. Combining the
online and offline, we join a subsample of surveyed respondents to their public
Facebook activity and apply machine learning classifiers to explore the link
between their political liking behaviour and actual voting intention. Through
this work, we show how even a single well-chosen Facebook like, can reveal as
much about our political voter intention as hundreds of random likes. Further,
by including the entire political like history of the respondents, our model
reaches prediction accuracies above previous multiparty studies (60-70%). We
conclude the paper by discussing how a parsimonious data strategy applied, with
some limitations, allow us to generalize our findings to the 1,4 million Danes
with at least one political like and even to other political multiparty
systems.
","[{'version': 'v1', 'created': 'Tue, 4 Apr 2017 18:22:36 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Apr 2017 19:39:50 GMT'}]",2017-11-01,"[['Kristensen', 'Jakob Baek', ''], ['Albrechtsen', 'Thomas', ''], ['Dahlgaard', 'Emil', ''], ['Jensen', 'Michael', ''], ['Skovrind', 'Magnus', ''], ['Bornakke', 'Tobias', '']]","['Voting\tbehavior', 'Big\tdata', 'Computational\tsocial\tscience', 'Social\tMedia']"
10694,2010.10783,Jiancan Wu,"Jiancan Wu, Xiang Wang, Fuli Feng, Xiangnan He, Liang Chen, Jianxun
  Lian, and Xing Xie",Self-supervised Graph Learning for Recommendation,"11 pages, 7 figures, 5 tables. Accepted by SIGIR 2021",,10.1145/3404835.3462862,,cs.IR cs.LG,http://creativecommons.org/publicdomain/zero/1.0/,"  Representation learning on user-item graph for recommendation has evolved
from using single ID or interaction history to exploiting higher-order
neighbors. This leads to the success of graph convolution networks (GCNs) for
recommendation such as PinSage and LightGCN. Despite effectiveness, we argue
that they suffer from two limitations: (1) high-degree nodes exert larger
impact on the representation learning, deteriorating the recommendations of
low-degree (long-tail) items; and (2) representations are vulnerable to noisy
interactions, as the neighborhood aggregation scheme further enlarges the
impact of observed edges.
  In this work, we explore self-supervised learning on user-item graph, so as
to improve the accuracy and robustness of GCNs for recommendation. The idea is
to supplement the classical supervised task of recommendation with an auxiliary
self-supervised task, which reinforces node representation learning via
self-discrimination. Specifically, we generate multiple views of a node,
maximizing the agreement between different views of the same node compared to
that of other nodes. We devise three operators to generate the views -- node
dropout, edge dropout, and random walk -- that change the graph structure in
different manners. We term this new learning paradigm as
\textit{Self-supervised Graph Learning} (SGL), implementing it on the
state-of-the-art model LightGCN. Through theoretical analyses, we find that SGL
has the ability of automatically mining hard negatives. Empirical studies on
three benchmark datasets demonstrate the effectiveness of SGL, which improves
the recommendation accuracy, especially on long-tail items, and the robustness
against interaction noises. Our implementations are available at
\url{https://github.com/wujcan/SGL}.
","[{'version': 'v1', 'created': 'Wed, 21 Oct 2020 06:35:26 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Apr 2021 06:58:32 GMT'}, {'version': 'v3', 'created': 'Tue, 18 May 2021 02:15:00 GMT'}, {'version': 'v4', 'created': 'Fri, 18 Jun 2021 11:56:37 GMT'}]",2021-06-21,"[['Wu', 'Jiancan', ''], ['Wang', 'Xiang', ''], ['Feng', 'Fuli', ''], ['He', 'Xiangnan', ''], ['Chen', 'Liang', ''], ['Lian', 'Jianxun', ''], ['Xie', 'Xing', '']]","['Collaborative filtering', 'Graph Neural Network', 'Self-supervisedLearning', 'Long-tail Recommendation']"
10695,2004.09735,Tatsuya Akutsu,"Avraham A. Melkman, Sini Guo, Wai-Ki Ching, Pengyu Liu, Tatsuya Akutsu",On the Compressive Power of Boolean Threshold Autoencoders,"13 pages, 3 figures, 1 table","IEEE Transactions on Neural Networks and Learning Systems, 2021",10.1109/TNNLS.2021.3104646,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An autoencoder is a layered neural network whose structure can be viewed as
consisting of an encoder, which compresses an input vector of dimension $D$ to
a vector of low dimension $d$, and a decoder which transforms the
low-dimensional vector back to the original input vector (or one that is very
similar). In this paper we explore the compressive power of autoencoders that
are Boolean threshold networks by studying the numbers of nodes and layers that
are required to ensure that the numbers of nodes and layers that are required
to ensure that each vector in a given set of distinct input binary vectors is
transformed back to its original. We show that for any set of $n$ distinct
vectors there exists a seven-layer autoencoder with the smallest possible
middle layer, (i.e., its size is logarithmic in $n$), but that there is a set
of $n$ vectors for which there is no three-layer autoencoder with a middle
layer of the same size. In addition we present a kind of trade-off: if a
considerably larger middle layer is permissible then a five-layer autoencoder
does exist. We also study encoding by itself. The results we obtain suggest
that it is the decoding that constitutes the bottleneck of autoencoding. For
example, there always is a three-layer Boolean threshold encoder that
compresses $n$ vectors into a dimension that is reduced to twice the logarithm
of $n$.
","[{'version': 'v1', 'created': 'Tue, 21 Apr 2020 03:21:43 GMT'}]",2021-08-26,"[['Melkman', 'Avraham A.', ''], ['Guo', 'Sini', ''], ['Ching', 'Wai-Ki', ''], ['Liu', 'Pengyu', ''], ['Akutsu', 'Tatsuya', '']]","['Neural networks', 'Boolean functions', 'threshold functions', 'autoencoders']"
10696,1906.07556,Bilen Emek Abali,"H. Yang, B. E. Abali, W. H. M\""uller, D. Timofeev","Determination of Metamaterial Parameters by Means of a Homogenization
  Approach Based on Asymptotic Analysis",,,10.1007/s00161-019-00837-4,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Owing to additive manufacturing techniques, a structure at millimeter length
scale (macroscale) can be produced by using a lattice substructure at
micrometer length scale (microscale). Such a system is called a metamaterial at
the macroscale as the mechanical characteristics deviate from the
characteristics at the microscale. As a remedy, metamaterial is modeled by
using additional parameters; we intend to determine them. A homogenization
approach based on the asymptotic analysis establishes a connection between
these different characteristics at micro- and macroscales. A linear elastic
first order theory at the microscale is related to a linear elastic second
order theory at the macroscale. Relation for parameters at the macroscale is
derived by using the equivalence of energy at macro- and microscales within a
so-called Representative Volume Element (RVE). Determination of parameters are
succeeded by solving a boundary value problem with the Finite Element Method
(FEM). The proposed approach guarantees that the additional parameters vanish
if the material is purely homogeneous, in other words, it is fully compatible
with conventional homogenization schemes based on spatial averaging techniques.
Moreover, the proposed approach is reliable as it ensures that such resolved
additional parameters are not sensitive to choices of RVE consisting in the
repetition of smaller RVEs but depend upon the intrinsic size of the structure.
","[{'version': 'v1', 'created': 'Tue, 18 Jun 2019 13:29:08 GMT'}]",2019-11-25,"[['Yang', 'H.', ''], ['Abali', 'B. E.', ''], ['Müller', 'W. H.', ''], ['Timofeev', 'D.', '']]","['Metamaterial', 'Homogenization', 'Strain gradient theory', 'Elasticity', 'Asymptotic analysis']"
10697,1712.03223,Majdi Mafarja Dr.,Majdi Mafarja and Seyedali Mirjalili,"S-Shaped vs. V-Shaped Transfer Functions for Antlion Optimization
  Algorithm in Feature Selection Problems",7 pages,"Majdi Mafarja, Derar Eleyan, Salwani Abdullah, and Seyedali
  Mirjalili. 2017. S-Shaped vs. V-Shaped Transfer Functions for Ant Lion
  Optimization Algorithm in Feature Selection Problem. In Proceedings of ICFNDS
  '17",10.1145/3102304.3102325,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feature selection is an important preprocessing step for classification
problems. It deals with selecting near optimal features in the original
dataset. Feature selection is an NP-hard problem, so meta-heuristics can be
more efficient than exact methods. In this work, Ant Lion Optimizer (ALO),
which is a recent metaheuristic algorithm, is employed as a wrapper feature
selection method. Six variants of ALO are proposed where each employ a transfer
function to map a continuous search space to a discrete search space. The
performance of the proposed approaches is tested on eighteen UCI datasets and
compared to a number of existing approaches in the literature: Particle Swarm
Optimization, Gravitational Search Algorithm, and two existing ALO-based
approaches. Computational experiments show that the proposed approaches
efficiently explore the feature space and select the most informative features,
which help to improve the classification accuracy.
","[{'version': 'v1', 'created': 'Wed, 6 Dec 2017 05:17:12 GMT'}]",2017-12-12,"[['Mafarja', 'Majdi', ''], ['Mirjalili', 'Seyedali', '']]","['Antlion Optimization Algorithm', 'Transfer Functions', 'Feature Selection', 'Classification', 'Optimization']"
10698,2104.12840,Yushun Dong,"Yushun Dong, Kaize Ding, Brian Jalaian, Shuiwang Ji, Jundong Li",AdaGNN: Graph Neural Networks with Adaptive Frequency Response Filter,Published as a conference paper at CIKM 2021,,10.1145/3459637.3482226,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph Neural Networks have recently become a prevailing paradigm for various
high-impact graph analytical problems. Existing efforts can be mainly
categorized as spectral-based and spatial-based methods. The major challenge
for the former is to find an appropriate graph filter to distill discriminative
information from input signals for learning. Recently, myriads of explorations
are made to achieve better graph filters, e.g., Graph Convolutional Network
(GCN), which leverages Chebyshev polynomial truncation to seek an approximation
of graph filters and bridge these two families of methods. Nevertheless, it has
been shown in recent studies that GCN and its variants are essentially
employing fixed low-pass filters to perform information denoising. Thus their
learning capability is rather limited and may over-smooth node representations
at deeper layers. To tackle these problems, we develop a novel graph neural
network framework AdaGNN with a well-designed adaptive frequency response
filter. At its core, AdaGNN leverages a simple but elegant trainable filter
that spans across multiple layers to capture the varying importance of
different frequency components for node representation learning. The inherent
differences among different feature channels are also well captured by the
filter. As such, it empowers AdaGNN with stronger expressiveness and naturally
alleviates the over-smoothing problem. We empirically validate the
effectiveness of the proposed framework on various benchmark datasets.
Theoretical analysis is also provided to show the superiority of the proposed
AdaGNN. The open-source implementation of AdaGNN can be found here:
https://github.com/yushundong/AdaGNN.
","[{'version': 'v1', 'created': 'Mon, 26 Apr 2021 19:31:21 GMT'}, {'version': 'v2', 'created': 'Sun, 29 Aug 2021 19:03:36 GMT'}, {'version': 'v3', 'created': 'Sat, 19 Feb 2022 08:45:02 GMT'}]",2022-02-22,"[['Dong', 'Yushun', ''], ['Ding', 'Kaize', ''], ['Jalaian', 'Brian', ''], ['Ji', 'Shuiwang', ''], ['Li', 'Jundong', '']]","['Graph neural networks', 'frequency response', 'adaptive filter']"
10699,2202.08081,Thierry Denoeux,Thierry Denoeux,"Reasoning with fuzzy and uncertain evidence using epistemic random fuzzy
  sets: general framework and practical models",,"Fuzzy Sets and Systems, Vol. 453, Pages 1-36, 2023",10.1016/j.fss.2022.06.004,,cs.AI stat.ME,http://creativecommons.org/licenses/by/4.0/,"  We introduce a general theory of epistemic random fuzzy sets for reasoning
with fuzzy or crisp evidence. This framework generalizes both the
Dempster-Shafer theory of belief functions, and possibility theory. Independent
epistemic random fuzzy sets are combined by the generalized
product-intersection rule, which extends both Dempster's rule for combining
belief functions, and the product conjunctive combination of possibility
distributions. We introduce Gaussian random fuzzy numbers and their
multi-dimensional extensions, Gaussian random fuzzy vectors, as practical
models for quantifying uncertainty about scalar or vector quantities.
Closed-form expressions for the combination, projection and vacuous extension
of Gaussian random fuzzy numbers and vectors are derived.
","[{'version': 'v1', 'created': 'Wed, 16 Feb 2022 14:06:05 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Apr 2022 08:44:37 GMT'}, {'version': 'v3', 'created': 'Fri, 16 Dec 2022 09:20:58 GMT'}]",2023-01-02,"[['Denoeux', 'Thierry', '']]","['Belief functions', 'evidence theory', 'possibility theory', 'random sets', 'uncertainty']"
10700,2002.05411,Juan Camilo Vasquez Correa J. C. Vasquez-Correa,"C. D. Rios-Urrego, J. C. V\'asquez-Correa, J. F. Vargas-Bonilla, E.
  N\""oth, F. Lopera, J. R. Orozco-Arroyave","Analysis and Evaluation of Handwriting in Patients with Parkinson's
  Disease Using kinematic, Geometrical, and Non-linear Features",,"Computer methods and programs in biomedicine, 173, 43-52 (2019)",10.1016/j.cmpb.2019.03.005,,cs.LG cs.CY stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Background and objectives: Parkinson's disease is a neurological disorder
that affects the motor system producing lack of coordination, resting tremor,
and rigidity. Impairments in handwriting are among the main symptoms of the
disease. Handwriting analysis can help in supporting the diagnosis and in
monitoring the progress of the disease. This paper aims to evaluate the
importance of different groups of features to model handwriting deficits that
appear due to Parkinson's disease; and how those features are able to
discriminate between Parkinson's disease patients and healthy subjects.
  Methods: Features based on kinematic, geometrical and non-linear dynamics
analyses were evaluated to classify Parkinson's disease and healthy subjects.
Classifiers based on K-nearest neighbors, support vector machines, and random
forest were considered.
  Results: Accuracies of up to $93.1\%$ were obtained in the classification of
patients and healthy control subjects. A relevance analysis of the features
indicated that those related to speed, acceleration, and pressure are the most
discriminant. The automatic classification of patients in different stages of
the disease shows $\kappa$ indexes between $0.36$ and $0.44$. Accuracies of up
to $83.3\%$ were obtained in a different dataset used only for validation
purposes.
  Conclusions: The results confirmed the negative impact of aging in the
classification process when we considered different groups of healthy subjects.
In addition, the results reported with the separate validation set comprise a
step towards the development of automated tools to support the diagnosis
process in clinical practice.
","[{'version': 'v1', 'created': 'Thu, 13 Feb 2020 09:54:41 GMT'}]",2020-02-14,"[['Rios-Urrego', 'C. D.', ''], ['Vásquez-Correa', 'J. C.', ''], ['Vargas-Bonilla', 'J. F.', ''], ['Nöth', 'E.', ''], ['Lopera', 'F.', ''], ['Orozco-Arroyave', 'J. R.', '']]","['Parkinson’s disease', 'Handwriting', 'kinematic features', 'Geometrical features', 'Non-linear dynamics']"
10701,2111.07508,Feras Batarseh,"Feras A. Batarseh, Munisamy Gopinath, Anderson Monken, Zhengrong Gu","Public Policymaking for International Agricultural Trade using
  Association Rules and Ensemble Machine Learning","Paper published at Elsevier's Journal of Machine Learning with
  Applications
  https://www.sciencedirect.com/science/article/pii/S2666827021000232","Machine Learning with Applications, Volume 5, 2021, 100046, ISSN
  2666-8270",10.1016/j.mlwa.2021.100046,,cs.LG cs.AI econ.GN q-fin.EC,http://creativecommons.org/licenses/by/4.0/,"  International economics has a long history of improving our understanding of
factors causing trade, and the consequences of free flow of goods and services
across countries. The recent shocks to the free trade regime, especially trade
disputes among major economies, as well as black swan events, such as trade
wars and pandemics, raise the need for improved predictions to inform policy
decisions. AI methods are allowing economists to solve such prediction problems
in new ways. In this manuscript, we present novel methods that predict and
associate food and agricultural commodities traded internationally. Association
Rules (AR) analysis has been deployed successfully for economic scenarios at
the consumer or store level, such as for market basket analysis. In our work
however, we present analysis of imports and exports associations and their
effects on commodity trade flows. Moreover, Ensemble Machine Learning methods
are developed to provide improved agricultural trade predictions, outlier
events' implications, and quantitative pointers to policy makers.
","[{'version': 'v1', 'created': 'Mon, 15 Nov 2021 02:58:03 GMT'}]",2021-11-16,"[['Batarseh', 'Feras A.', ''], ['Gopinath', 'Munisamy', ''], ['Monken', 'Anderson', ''], ['Gu', 'Zhengrong', '']]","['International Trade', 'Association Rules', 'Ensemble Machine Learning', 'Country']"
10702,1712.03158,Thijs Laarhoven,Thijs Laarhoven,Graph-based time-space trade-offs for approximate near neighbors,"26 pages, 4 figures","34th International Symposium on Computational Geometry (SoCG), pp.
  57:1-57:14, 2018",10.4230/LIPIcs.SoCG.2018.57,,cs.DS cs.CC cs.CG cs.CR cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We take a first step towards a rigorous asymptotic analysis of graph-based
approaches for finding (approximate) nearest neighbors in high-dimensional
spaces, by analyzing the complexity of (randomized) greedy walks on the
approximate near neighbor graph. For random data sets of size $n = 2^{o(d)}$ on
the $d$-dimensional Euclidean unit sphere, using near neighbor graphs we can
provably solve the approximate nearest neighbor problem with approximation
factor $c > 1$ in query time $n^{\rho_q + o(1)}$ and space $n^{1 + \rho_s +
o(1)}$, for arbitrary $\rho_q, \rho_s \geq 0$ satisfying \begin{align} (2c^2 -
1) \rho_q + 2 c^2 (c^2 - 1) \sqrt{\rho_s (1 - \rho_s)} \geq c^4. \end{align}
Graph-based near neighbor searching is especially competitive with hash-based
methods for small $c$ and near-linear memory, and in this regime the asymptotic
scaling of a greedy graph-based search matches the recent optimal hash-based
trade-offs of Andoni-Laarhoven-Razenshteyn-Waingarten [SODA'17]. We further
study how the trade-offs scale when the data set is of size $n =
2^{\Theta(d)}$, and analyze asymptotic complexities when applying these results
to lattice sieving.
","[{'version': 'v1', 'created': 'Fri, 8 Dec 2017 16:26:22 GMT'}]",2019-10-04,"[['Laarhoven', 'Thijs', '']]","['(approximate) nearest neighbor problem', 'near neighbor graphs', 'localitysensitive hashing', 'locality-sensitive filters', 'similarity search']"
10703,2010.09847,Namwoo Kang,"Seongsin Kim, Ungki Lee, Ikjin Lee, Namwoo Kang","Idle Vehicle Relocation Strategy through Deep Learning for Shared
  Autonomous Electric Vehicle System Optimization",,"Journal of Cleaner Production, 333, 130055 (2022)",10.1016/j.jclepro.2021.130055,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In optimization of a shared autonomous electric vehicle (SAEV) system, idle
vehicle relocation strategies are important to reduce operation costs and
customers' wait time. However, for an on-demand service, continuous
optimization for idle vehicle relocation is computationally expensive, and
thus, not effective. This study proposes a deep learning-based algorithm that
can instantly predict the optimal solution to idle vehicle relocation problems
under various traffic conditions. The proposed relocation process comprises
three steps. First, a deep learning-based passenger demand prediction model
using taxi big data is built. Second, idle vehicle relocation problems are
solved based on predicted demands, and optimal solution data are collected.
Finally, a deep learning model using the optimal solution data is built to
estimate the optimal strategy without solving relocation. In addition, the
proposed idle vehicle relocation model is validated by applying it to optimize
the SAEV system. We present an optimal service system including the design of
SAEV vehicles and charging stations. Further, we demonstrate that the proposed
strategy can drastically reduce operation costs and wait times for on-demand
services.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2020 05:06:58 GMT'}]",2022-10-04,"[['Kim', 'Seongsin', ''], ['Lee', 'Ungki', ''], ['Lee', 'Ikjin', ''], ['Kang', 'Namwoo', '']]","['Idle vehicle relocation', 'deep learning', 'shared autonomous electric vehicle (SAEV)', 'demand prediction', 'system optimization']"
10704,1710.05733,Sobhan Moosavi,"Sobhan Moosavi, Behrooz Omidvar-Tehrani, R. Bruce Craig, Arnab Nandi,
  Rajiv Ramnath",Characterizing Driving Context from Driver Behavior,"Accepted to be published at The 25th ACM SIGSPATIAL International
  Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL
  2017)",,10.1145/3139958.3139992,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Because of the increasing availability of spatiotemporal data, a variety of
data-analytic applications have become possible. Characterizing driving
context, where context may be thought of as a combination of location and time,
is a new challenging application. An example of such a characterization is
finding the correlation between driving behavior and traffic conditions. This
contextual information enables analysts to validate observation-based
hypotheses about the driving of an individual. In this paper, we present
DriveContext, a novel framework to find the characteristics of a context, by
extracting significant driving patterns (e.g., a slow-down), and then
identifying the set of potential causes behind patterns (e.g., traffic
congestion). Our experimental results confirm the feasibility of the framework
in identifying meaningful driving patterns, with improvements in comparison
with the state-of-the-art. We also demonstrate how the framework derives
interesting characteristics for different contexts, through real-world
examples.
","[{'version': 'v1', 'created': 'Fri, 13 Oct 2017 17:34:11 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Nov 2017 23:42:05 GMT'}]",2017-11-21,"[['Moosavi', 'Sobhan', ''], ['Omidvar-Tehrani', 'Behrooz', ''], ['Craig', 'R. Bruce', ''], ['Nandi', 'Arnab', ''], ['Ramnath', 'Rajiv', '']]","['Driver Behavior', 'Segmentation', 'Driving Pattern', 'Driving Context']"
10705,2109.01419,Zhipeng He,"Bemali Wickramanayake, Zhipeng He, Chun Ouyang, Catarina Moreira, Yue
  Xu, Renuka Sindhgatta","Building Interpretable Models for Business Process Prediction using
  Shared and Specialised Attention Mechanisms","Accepted manuscripts; 40 pages, 22 figures, 13 tables",,10.1016/j.knosys.2022.108773,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we address the ""black-box"" problem in predictive process
analytics by building interpretable models that are capable to inform both what
and why is a prediction. Predictive process analytics is a newly emerged
discipline dedicated to providing business process intelligence in modern
organisations. It uses event logs, which capture process execution traces in
the form of multi-dimensional sequence data, as the key input to train
predictive models. These predictive models, often built upon deep learning
techniques, can be used to make predictions about the future states of business
process execution. We apply attention mechanism to achieve model
interpretability. We propose i) two types of attentions: event attention to
capture the impact of specific process events on a prediction, and attribute
attention to reveal which attribute(s) of an event influenced the prediction;
and ii) two attention mechanisms: shared attention mechanism and specialised
attention mechanism to reflect different design decisions in when to construct
attribute attention on individual input features (specialised) or using the
concatenated feature tensor of all input feature vectors (shared). These lead
to two distinct attention-based models, and both are interpretable models that
incorporate interpretability directly into the structure of a process
predictive model. We conduct experimental evaluation of the proposed models
using real-life dataset, and comparative analysis between the models for
accuracy and interpretability, and draw insights from the evaluation and
analysis results.
","[{'version': 'v1', 'created': 'Fri, 3 Sep 2021 10:17:05 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Apr 2022 08:51:23 GMT'}]",2022-04-26,"[['Wickramanayake', 'Bemali', ''], ['He', 'Zhipeng', ''], ['Ouyang', 'Chun', ''], ['Moreira', 'Catarina', ''], ['Xu', 'Yue', ''], ['Sindhgatta', 'Renuka', '']]","['Explainable AI', 'attention mechanism', 'business process prediction', 'event log', 'LSTM']"
10706,1910.06474,Jinzheng Cai,"Jinzheng Cai, Yingda Xia, Dong Yang, Daguang Xu, Lin Yang and Holger
  Roth","End-to-End Adversarial Shape Learning for Abdomen Organ Deep
  Segmentation","Accepted to International Workshop on Machine Learning in Medical
  Imaging (MLMI2019)",,10.1007/978-3-030-32692-0_15,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic segmentation of abdomen organs using medical imaging has many
potential applications in clinical workflows. Recently, the state-of-the-art
performance for organ segmentation has been achieved by deep learning models,
i.e., convolutional neural network (CNN). However, it is challenging to train
the conventional CNN-based segmentation models that aware of the shape and
topology of organs. In this work, we tackle this problem by introducing a novel
end-to-end shape learning architecture -- organ point-network. It takes deep
learning features as inputs and generates organ shape representations as points
that located on organ surface. We later present a novel adversarial shape
learning objective function to optimize the point-network to capture shape
information better. We train the point-network together with a CNN-based
segmentation model in a multi-task fashion so that the shared network
parameters can benefit from both shape learning and segmentation tasks. We
demonstrate our method with three challenging abdomen organs including liver,
spleen, and pancreas. The point-network generates surface points with
fine-grained details and it is found critical for improving organ segmentation.
Consequently, the deep segmentation model is improved by the introduced shape
learning as significantly better Dice scores are observed for spleen and
pancreas segmentation.
","[{'version': 'v1', 'created': 'Tue, 15 Oct 2019 01:48:29 GMT'}]",2019-10-16,"[['Cai', 'Jinzheng', ''], ['Xia', 'Yingda', ''], ['Yang', 'Dong', ''], ['Xu', 'Daguang', ''], ['Yang', 'Lin', ''], ['Roth', 'Holger', '']]","['Abdomen Organ Segmentation', 'Shape Learning', 'SurfacePoint Generation', 'Adversarial Learning']"
10707,2005.03523,Robert Scheffler,"Jesse Beisegel, Ekkehard K\""ohler, Robert Scheffler, Martin Strehler",Linear Time LexDFS on Chordal Graphs,,"28th Annual European Symposium on Algorithms (ESA 2020). LIPIcs
  vol. 173, 2020, p. 13:1-13:13",10.4230/LIPIcs.ESA.2020.13,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lexicographic Depth First Search (LexDFS) is a special variant of a Depth
First Search (DFS), which was introduced by Corneil and Krueger in 2008. While
this search has been used in various applications, in contrast to other graph
searches, no general linear time implementation is known to date. In 2014,
K\""ohler and Mouatadid achieved linear running time to compute some special
LexDFS orders for cocomparability graphs. In this paper, we present a linear
time implementation of LexDFS for chordal graphs. Our algorithm is able to find
any LexDFS order for this graph class. To the best of our knowledge this is the
first unrestricted linear time implementation of LexDFS on a non-trivial graph
class. In the algorithm we use a search tree computed by Lexicographic Breadth
First Search (LexBFS).
","[{'version': 'v1', 'created': 'Thu, 7 May 2020 14:42:44 GMT'}]",2020-11-24,"[['Beisegel', 'Jesse', ''], ['Köhler', 'Ekkehard', ''], ['Scheffler', 'Robert', ''], ['Strehler', 'Martin', '']]","['LexDFS', 'chordal graphs', 'linear time implementation', 'search trees', 'LexBFS']"
10708,2106.03371,Waqas Ahmed,"Sheikh Muhamad Hizam, Waqas Ahmed, Muhammad Fahad, Habiba Akter, Ilham
  Sentosa, Jawad Ali","User Behavior Assessment Towards Biometric Facial Recognition System: A
  SEM-Neural Network Approach","15 Pages, 04 Figures, 05 Tables, FICC-2021 Conference 29-30 April
  2021, Vancouver, Canada","2021 - Advances in Intelligent Systems and Computing book series
  (AISC, volume 1364)",10.1007/978-3-030-73103-8_75,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A smart home is grounded on the sensors that endure automation, safety, and
structural integration. The security mechanism in digital setup possesses
vibrant prominence and the biometric facial recognition system is novel
addition to accrue the smart home features. Understanding the implementation of
such technology is the outcome of user behavior modeling. However, there is the
paucity of empirical research that explains the role of cognitive, functional,
and social aspects of end-users acceptance behavior towards biometric facial
recognition systems at homes. Therefore, a causal research survey was conducted
to comprehend the behavioral intention towards the use of a biometric facial
recognition system. Technology Acceptance Model (TAM)was implied with Perceived
System Quality (PSQ) and Social Influence (SI)to hypothesize the conceptual
framework. Data was collected from 475respondents through online
questionnaires. Structural Equation Modeling(SEM) and Artificial Neural Network
(ANN) were employed to analyze the surveyed data. The results showed that all
the variables of the proposed framework significantly affected the behavioral
intention to use the system. The PSQ appeared as the noteworthy predictor
towards biometric facial recognition system usability through regression and
sensitivity analyses. A multi-analytical approach towards understanding the
technology user behavior will support the efficient decision-making process in
Human-centric computing.
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2021 06:52:26 GMT'}]",2021-06-08,"[['Hizam', 'Sheikh Muhamad', ''], ['Ahmed', 'Waqas', ''], ['Fahad', 'Muhammad', ''], ['Akter', 'Habiba', ''], ['Sentosa', 'Ilham', ''], ['Ali', 'Jawad', '']]","['Facial Recognition', 'SEM-Neural', 'Technology Acceptance']"
10709,2112.08453,Amy McGovern,"Amy McGovern and Imme Ebert-Uphoff and David John Gagne II and Ann
  Bostrom","The Need for Ethical, Responsible, and Trustworthy Artificial
  Intelligence for Environmental Sciences",,,10.1017/eds.2022.5,,cs.CY cs.AI cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  Given the growing use of Artificial Intelligence (AI) and machine learning
(ML) methods across all aspects of environmental sciences, it is imperative
that we initiate a discussion about the ethical and responsible use of AI. In
fact, much can be learned from other domains where AI was introduced, often
with the best of intentions, yet often led to unintended societal consequences,
such as hard coding racial bias in the criminal justice system or increasing
economic inequality through the financial system. A common misconception is
that the environmental sciences are immune to such unintended consequences when
AI is being used, as most data come from observations, and AI algorithms are
based on mathematical formulas, which are often seen as objective. In this
article, we argue the opposite can be the case. Using specific examples, we
demonstrate many ways in which the use of AI can introduce similar consequences
in the environmental sciences. This article will stimulate discussion and
research efforts in this direction. As a community, we should avoid repeating
any foreseeable mistakes made in other domains through the introduction of AI.
In fact, with proper precautions, AI can be a great tool to help {\it reduce}
climate and environmental injustice. We primarily focus on weather and climate
examples but the conclusions apply broadly across the environmental sciences.
","[{'version': 'v1', 'created': 'Wed, 15 Dec 2021 19:57:38 GMT'}]",2022-04-14,"[['McGovern', 'Amy', ''], ['Ebert-Uphoff', 'Imme', ''], ['Gagne', 'David John', 'II'], ['Bostrom', 'Ann', '']]","['ethics', 'artificial intelligence', 'weather', 'climate']"
10710,2103.13196,Samuel Olatunji,"Samuel Olatunji, Noa Markfeld, Dana Gutman, Shay Givati, Vardit
  Sarne-Fleischmann, Tal Oron-Gilad, Yael Edan","Improving the interaction of Older Adults with Socially Assistive Robots
  for Table setting",,"Proceedings of the International Conference on Social Robotics (pp
  568-577), 11876 LNAI Lecture Notes in Computer Science. Springer
  International Publishing. 2019",10.1007/978-3-030-35888-4_53,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  This study provides user-studies aimed at exploring factors influencing the
interaction between older adults and a robotic table setting assistant. The
in-fluence of the level of automation (LOA) and level of transparency (LOT) on
the quality of the interaction was considered. Results revealed that the
interaction effect of LOA and LOT significantly influenced the interaction. A
lower LOA which required the user to control some of the actions of the robot
influenced the older adults to participate more in the interaction when the LOT
was low com-pared to situations with higher LOT (more information) and higher
LOA (more robot autonomy). Even though the higher LOA influenced more fluency
in the interaction, the lower LOA encouraged a more collaborative form of
interaction which is a priority in the design of robotic aids for older adult
users. The results provide some insights into shared control designs which
accommodates the preferences of the older adult users as they interact with
robotic aids such as the table setting robot used in this study.
","[{'version': 'v1', 'created': 'Wed, 24 Mar 2021 13:52:49 GMT'}]",2021-03-25,"[['Olatunji', 'Samuel', ''], ['Markfeld', 'Noa', ''], ['Gutman', 'Dana', ''], ['Givati', 'Shay', ''], ['Sarne-Fleischmann', 'Vardit', ''], ['Oron-Gilad', 'Tal', ''], ['Edan', 'Yael', '']]","['Shared control', 'Levels of automation', 'transparency', 'collaborative robots', 'human-robot interaction']"
10711,2204.09287,Jorge Ejarque,"Jorge Ejarque, Rosa M. Badia, Lo\""ic Albertin, Giovanni Aloisio,
  Enrico Baglione, Yolanda Becerra, Stefan Boschert, Julian R. Berlin,
  Alessandro D'Anca, Donatello Elia, Fran\c{c}ois Exertier, Sandro Fiore,
  Jos\'e Flich, Arnau Folch, Steven J Gibbons, Nikolay Koldunov, Francesc
  Lordan, Stefano Lorito, Finn L{\o}vholt, Jorge Mac\'ias, Fabrizio Marozzo,
  Alberto Michelini, Marisol Monterrubio-Velasco, Marta Pienkowska, Josep de la
  Puente, Anna Queralt, Enrique S. Quintana-Ort\'i, Juan E. Rodr\'iguez,
  Fabrizio Romano, Riccardo Rossi, Jedrzej Rybicki, Miroslaw Kupczyk, Jacopo
  Selva, Domenico Talia, Roberto Tonini, Paolo Trunfio, Manuela Volp","Enabling Dynamic and Intelligent Workflows for HPC, Data Analytics, and
  AI Convergence",,"Future Generation Computer Systems, Volume 134, Pages 414-429,
  ISSN 0167-739X, Elsevier, 2022",10.1016/j.future.2022.04.014,,cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The evolution of High-Performance Computing (HPC) platforms enables the
design and execution of progressively larger and more complex workflow
applications in these systems. The complexity comes not only from the number of
elements that compose the workflows but also from the type of computations they
perform. While traditional HPC workflows target simulations and modelling of
physical phenomena, current needs require in addition data analytics (DA) and
artificial intelligence (AI) tasks. However, the development of these workflows
is hampered by the lack of proper programming models and environments that
support the integration of HPC, DA, and AI, as well as the lack of tools to
easily deploy and execute the workflows in HPC systems. To progress in this
direction, this paper presents use cases where complex workflows are required
and investigates the main issues to be addressed for the HPC/DA/AI convergence.
Based on this study, the paper identifies the challenges of a new workflow
platform to manage complex workflows. Finally, it proposes a development
approach for such a workflow platform addressing these challenges in two
directions: first, by defining a software stack that provides the
functionalities to manage these complex workflows; and second, by proposing the
HPC Workflow as a Service (HPCWaaS) paradigm, which leverages the software
stack to facilitate the reusability of complex workflows in federated HPC
infrastructures. Proposals presented in this work are subject to study and
development as part of the EuroHPC eFlows4HPC project.
","[{'version': 'v1', 'created': 'Wed, 20 Apr 2022 08:10:14 GMT'}, {'version': 'v2', 'created': 'Fri, 13 May 2022 12:42:10 GMT'}]",2022-05-16,"[['Ejarque', 'Jorge', ''], ['Badia', 'Rosa M.', ''], ['Albertin', 'Loïc', ''], ['Aloisio', 'Giovanni', ''], ['Baglione', 'Enrico', ''], ['Becerra', 'Yolanda', ''], ['Boschert', 'Stefan', ''], ['Berlin', 'Julian R.', ''], [""D'Anca"", 'Alessandro', ''], ['Elia', 'Donatello', ''], ['Exertier', 'François', ''], ['Fiore', 'Sandro', ''], ['Flich', 'José', ''], ['Folch', 'Arnau', ''], ['Gibbons', 'Steven J', ''], ['Koldunov', 'Nikolay', ''], ['Lordan', 'Francesc', ''], ['Lorito', 'Stefano', ''], ['Løvholt', 'Finn', ''], ['Macías', 'Jorge', ''], ['Marozzo', 'Fabrizio', ''], ['Michelini', 'Alberto', ''], ['Monterrubio-Velasco', 'Marisol', ''], ['Pienkowska', 'Marta', ''], ['de la Puente', 'Josep', ''], ['Queralt', 'Anna', ''], ['Quintana-Ortí', 'Enrique S.', ''], ['Rodríguez', 'Juan E.', ''], ['Romano', 'Fabrizio', ''], ['Rossi', 'Riccardo', ''], ['Rybicki', 'Jedrzej', ''], ['Kupczyk', 'Miroslaw', ''], ['Selva', 'Jacopo', ''], ['Talia', 'Domenico', ''], ['Tonini', 'Roberto', ''], ['Trunfio', 'Paolo', ''], ['Volp', 'Manuela', '']]","['High Performance Computing', 'Distributed Computing', 'ParallelProgramming', 'HPC-DA-AI Convergence', 'Workflow Development', 'WorkflowOrchestration']"
10712,2010.13364,Tian Tong,"Tian Tong, Cong Ma, Yuejie Chi","Low-Rank Matrix Recovery with Scaled Subgradient Methods: Fast and
  Robust Convergence Without the Condition Number",Accepted to IEEE Transaction on Signal Processing,,10.1109/TSP.2021.3071560,,cs.LG cs.IT eess.SP math.IT math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many problems in data science can be treated as estimating a low-rank matrix
from highly incomplete, sometimes even corrupted, observations. One popular
approach is to resort to matrix factorization, where the low-rank matrix
factors are optimized via first-order methods over a smooth loss function, such
as the residual sum of squares. While tremendous progresses have been made in
recent years, the natural smooth formulation suffers from two sources of
ill-conditioning, where the iteration complexity of gradient descent scales
poorly both with the dimension as well as the condition number of the low-rank
matrix. Moreover, the smooth formulation is not robust to corruptions. In this
paper, we propose scaled subgradient methods to minimize a family of nonsmooth
and nonconvex formulations -- in particular, the residual sum of absolute
errors -- which is guaranteed to converge at a fast rate that is almost
dimension-free and independent of the condition number, even in the presence of
corruptions. We illustrate the effectiveness of our approach when the
observation operator satisfies certain mixed-norm restricted isometry
properties, and derive state-of-the-art performance guarantees for a variety of
problems such as robust low-rank matrix sensing and quadratic sampling.
","[{'version': 'v1', 'created': 'Mon, 26 Oct 2020 06:21:14 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Apr 2021 15:09:42 GMT'}]",2021-04-23,"[['Tong', 'Tian', ''], ['Ma', 'Cong', ''], ['Chi', 'Yuejie', '']]","['low-rank matrix recovery', 'nonsmooth and nonconvex optimization', 'residual sum of absoluteerrors', 'scaled subgradient methods']"
10713,2108.05830,Cynthia P. Quinteros,"Fabrizio Di Francesco, Gabriel A. Sanca, Cynthia P. Quinteros","Spatio-temporal evolution of resistance state in simulated memristive
  networks","Supplementary information comprises animated sequences of resistive
  maps corresponding to the internal state of each unit within the array both
  for the cycling experiment (Fig. 2 of the main text) and the sensitization
  one (Fig. 3 of the main) and is available upon request","Appl. Phys. Lett. 119, 193502 (2021)",10.1063/5.0067048,,cs.ET cond-mat.dis-nn physics.comp-ph,http://creativecommons.org/licenses/by/4.0/,"  Originally studied for their suitability to store information compactly,
memristive networks are now being analysed as implementations of neuromorphic
circuits. An extremely high number of elements is thus mandatory. To surpass
the limited achievable connectivity - due to the featuring size - exploiting
self-assemblies has been proposed as an alternative, in turn posing more
challenges. In an attempt for offering insight on what to expect when
characterizing the collective electrical response of switching assemblies, in
this work, networks of memristive elements are simulated. Collective electrical
behaviour and maps of resistance states are characterized upon different
electrical stimuli. By comparing the response of homogeneous and heterogeneous
networks, we delineate differences that might be experimentally observed when
the number of memristive units is scaled up and disorder arises as an
inevitable feature.
","[{'version': 'v1', 'created': 'Thu, 12 Aug 2021 16:26:50 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Nov 2021 13:53:37 GMT'}]",2021-11-30,"[['Di Francesco', 'Fabrizio', ''], ['Sanca', 'Gabriel A.', ''], ['Quinteros', 'Cynthia P.', '']]","['memristive network', 'self-assembly', 'collective behaviour']"
10714,1807.09829,Zeliang Liu,"Zeliang Liu, C.T. Wu, M. Koishi","A deep material network for multiscale topology learning and accelerated
  nonlinear modeling of heterogeneous materials","33 pages, 19 figures",,10.1016/j.cma.2018.09.020,,cs.CE physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a new data-driven multiscale material modeling method, which
we refer to as deep material network, is developed based on mechanistic
homogenization theory of representative volume element (RVE) and advanced
machine learning techniques. We propose to use a collection of connected
mechanistic building blocks with analytical homogenization solutions which
avoids the loss of essential physics in generic neural networks, and this
concept is demonstrated for 2-dimensional RVE problems and network depth up to
7. Based on linear elastic RVE data from offline direct numerical simulations,
the material network can be effectively trained using stochastic gradient
descent with backpropagation algorithm, enhanced by model compression methods.
Importantly, the trained network is valid for any local material laws without
the need for additional calibration or micromechanics assumption. Its
extrapolations to unknown material and loading spaces for a wide range of
problems are validated through numerical experiments, including linear
elasticity with high contrast of phase properties, nonlinear history-dependent
plasticity and finite-strain hyperelasticity under large deformations.
  By discovering a proper topological representation of RVE with fewer degrees
of freedom, this intelligent material model is believed to open new
possibilities of high-fidelity efficient concurrent simulations for a
large-scale heterogeneous structure. It also provides a mechanistic
understanding of structure-property relations across material length scales and
enables the development of parameterized microstructural database for material
design and manufacturing.
","[{'version': 'v1', 'created': 'Wed, 25 Jul 2018 19:14:37 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Sep 2018 18:50:15 GMT'}, {'version': 'v3', 'created': 'Tue, 25 Sep 2018 13:41:24 GMT'}, {'version': 'v4', 'created': 'Wed, 24 Oct 2018 15:57:02 GMT'}]",2019-01-04,"[['Liu', 'Zeliang', ''], ['Wu', 'C. T.', ''], ['Koishi', 'M.', '']]","['Material network', 'building blocks', 'machine learning', 'nonlinear plasticity', 'large deformations']"
10715,2008.03638,Feng Xia,"Hayat Dino Bedru, Shuo Yu, Xinru Xiao, Da Zhang, Liangtian Wan, He
  Guo, Feng Xia",Big Networks: A Survey,"69 pages, 4 figures","Computer Science Review, Volume 37, August 2020, 100247",10.1016/j.cosrev.2020.100247,,cs.SI cs.LG physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A network is a typical expressive form of representing complex systems in
terms of vertices and links, in which the pattern of interactions amongst
components of the network is intricate. The network can be static that does not
change over time or dynamic that evolves through time. The complication of
network analysis is different under the new circumstance of network size
explosive increasing. In this paper, we introduce a new network science concept
called big network. Big networks are generally in large-scale with a
complicated and higher-order inner structure. This paper proposes a guideline
framework that gives an insight into the major topics in the area of network
science from the viewpoint of a big network. We first introduce the structural
characteristics of big networks from three levels, which are micro-level,
meso-level, and macro-level. We then discuss some state-of-the-art advanced
topics of big network analysis. Big network models and related approaches,
including ranking methods, partition approaches, as well as network embedding
algorithms are systematically introduced. Some typical applications in big
networks are then reviewed, such as community detection, link prediction,
recommendation, etc. Moreover, we also pinpoint some critical open issues that
need to be investigated further.
","[{'version': 'v1', 'created': 'Sun, 9 Aug 2020 03:40:20 GMT'}]",2020-08-11,"[['Bedru', 'Hayat Dino', ''], ['Yu', 'Shuo', ''], ['Xiao', 'Xinru', ''], ['Zhang', 'Da', ''], ['Wan', 'Liangtian', ''], ['Guo', 'He', ''], ['Xia', 'Feng', '']]","['Network Science', 'Network Analysis', 'Big Networks', 'Complex']"
10716,2005.07475,Martin Uhrin,Martin Uhrin and Sebastiaan P. Huber,"kiwiPy: Robust, high-volume, messaging for big-data and computational
  science workflows",,Journal of Open Source Software 5 2351 (2020),10.21105/joss.02351,,cs.DC,http://creativecommons.org/licenses/by-sa/4.0/,"  In this work we present kiwiPy, a Python library designed to support robust
message based communication for high-throughput, big-data, applications while
being general enough to be useful wherever high-volumes of messages need to be
communicated in a predictable manner. KiwiPy relies on the RabbitMQ protocol,
an industry standard message broker, while providing a simple and intuitive
interface that can be used in both multithreaded and coroutine based
applications. To demonstrate some of kiwiPy's functionality we give examples
from AiiDA, a high-throughput simulation platform, where kiwiPy is used as a
key component of the workflow engine.
","[{'version': 'v1', 'created': 'Fri, 15 May 2020 11:34:35 GMT'}]",2020-11-18,"[['Uhrin', 'Martin', ''], ['Huber', 'Sebastiaan P.', '']]","['robust communications', 'RabbitMQ', 'workflows', 'high-throughput', 'big-data', 'computational science', 'AiiDA']"
10717,2101.08143,Wanyue Xu,"Wanyue Xu, Qi Bao, Zhongzhi Zhang",Fast Evaluation for Relevant Quantities of Opinion Dynamics,,"Proceedings of The Web Conference 2021, pp.2037-2045",10.1145/3442381.3449812,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the main subjects in the field of social networks is to quantify
conflict, disagreement, controversy, and polarization, and some quantitative
indicators have been developed to quantify these concepts. However, direct
computation of these indicators involves the operations of matrix inversion and
multiplication, which make it computationally infeasible for large-scale graphs
with millions of nodes. In this paper, by reducing the problem of computing
relevant quantities to evaluating $\ell_2$ norms of some vectors, we present a
nearly linear time algorithm to estimate all these quantities. Our algorithm is
based on the Laplacian solvers, and has a proved theoretical guarantee of error
for each quantity. We execute extensive numerical experiments on a variety of
real networks, which demonstrate that our approximation algorithm is efficient
and effective, scalable to large graphs having millions of nodes.
","[{'version': 'v1', 'created': 'Wed, 20 Jan 2021 14:07:38 GMT'}, {'version': 'v2', 'created': 'Sat, 12 Jun 2021 15:19:51 GMT'}]",2021-06-15,"[['Xu', 'Wanyue', ''], ['Bao', 'Qi', ''], ['Zhang', 'Zhongzhi', '']]","['Opinion dynamics', 'social network', 'multi-agent system', 'polarization', 'disagreement', 'conflict', 'controversy', 'Laplacian solver']"
10718,2301.08835,Alexis Morris Ph.D.,"Jie Guan, Jay Irizawa, Alexis Morris","Extended Reality and Internet of Things for Hyper-Connected Metaverse
  Environments","In Proceedings of 2022 IEEE Conference on Virtual Reality and 3D User
  Interfaces Abstracts and Workshops (VRW), Christchurch, New Zealand, 2022",,10.1109/VRW55335.2022.00043,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Metaverse encompasses technologies related to the internet, virtual and
augmented reality, and other domains toward smart interfaces that are
hyper-connected, immersive, and engaging. However, Metaverse applications face
inherent disconnects between virtual and physical components and interfaces.
This work explores how an Extended Metaverse framework can be used to increase
the seamless integration of interoperable agents between virtual and physical
environments. It contributes an early theory and practice toward the synthesis
of virtual and physical smart environments anticipating future designs and
their potential for connected experiences.
","[{'version': 'v1', 'created': 'Sat, 21 Jan 2023 00:28:03 GMT'}]",2023-01-24,"[['Guan', 'Jie', ''], ['Irizawa', 'Jay', ''], ['Morris', 'Alexis', '']]","['Metaverse', 'mixed reality', 'internet-of-things', 'agents']"
10719,2010.00732,Muhammad Marwan Muhammad Fuad,Muhammad Marwan Muhammad Fuad,"Extreme-SAX: Extreme Points Based Symbolic Representation for Time
  Series Classification","International Conference on Big Data Analytics and Knowledge
  Discovery - DaWaK 2020: Big Data Analytics and Knowledge Discovery pp 122-130","Lecture Notes in Computer Science 12393, Springer 2020,",10.1007/978-3-030-59065-9_10,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Time series classification is an important problem in data mining with
several applications in different domains. Because time series data are usually
high dimensional, dimensionality reduction techniques have been proposed as an
efficient approach to lower their dimensionality. One of the most popular
dimensionality reduction techniques of time series data is the Symbolic
Aggregate Approximation (SAX), which is inspired by algorithms from text mining
and bioinformatics. SAX is simple and efficient because it uses precomputed
distances. The disadvantage of SAX is its inability to accurately represent
important points in the time series. In this paper we present Extreme-SAX
(E-SAX), which uses only the extreme points of each segment to represent the
time series. E-SAX has exactly the same simplicity and efficiency of the
original SAX, yet it gives better results in time series classification than
the original SAX, as we show in extensive experiments on a variety of time
series datasets.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2020 00:17:08 GMT'}]",2020-10-05,"[['Fuad', 'Muhammad Marwan Muhammad', '']]","['Extreme-SAX', 'Symbolic Aggregate Approximation (SAX)', 'Time Series Classification']"
10720,2208.13358,Kunpeng Li,"Kunpeng Li, Guangcui Shao, Naijun Yang, Xiao Fang, Yang Song","Billion-user Customer Lifetime Value Prediction: An Industrial-scale
  Solution from Kuaishou","Accepted by CIKM 2022, 9 pages",,10.1145/3511808.3557152,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Customer Life Time Value (LTV) is the expected total revenue that a single
user can bring to a business. It is widely used in a variety of business
scenarios to make operational decisions when acquiring new customers. Modeling
LTV is a challenging problem, due to its complex and mutable data distribution.
Existing approaches either directly learn from posterior feature distributions
or leverage statistical models that make strong assumption on prior
distributions, both of which fail to capture those mutable distributions. In
this paper, we propose a complete set of industrial-level LTV modeling
solutions. Specifically, we introduce an Order Dependency Monotonic Network
(ODMN) that models the ordered dependencies between LTVs of different time
spans, which greatly improves model performance. We further introduce a Multi
Distribution Multi Experts (MDME) module based on the Divide-and-Conquer idea,
which transforms the severely imbalanced distribution modeling problem into a
series of relatively balanced sub-distribution modeling problems hence greatly
reduces the modeling complexity. In addition, a novel evaluation metric Mutual
Gini is introduced to better measure the distribution difference between the
estimated value and the ground-truth label based on the Lorenz Curve. The ODMN
framework has been successfully deployed in many business scenarios of
Kuaishou, and achieved great performance. Extensive experiments on real-world
industrial data demonstrate the superiority of the proposed methods compared to
state-of-the-art baselines including ZILN and Two-Stage XGBoost models.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2022 04:05:21 GMT'}]",2022-08-30,"[['Li', 'Kunpeng', ''], ['Shao', 'Guangcui', ''], ['Yang', 'Naijun', ''], ['Fang', 'Xiao', ''], ['Song', 'Yang', '']]","['LTV', 'ODMN', 'MDME', 'Mutual Gini']"
10721,1908.10805,Paul Vitanyi,Paul MB Vitanyi,"Logical depth for reversible Turing machines with an application to the
  rate of decrease in logical depth for general Turing machines",Latex 4 pages,"Theor. Comput. Sci., 778(2019), 78-80",10.1016/j.tcs.2019.01.031,,cs.CC cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The logical depth of a {\em reversible} Turing machine equals the shortest
running time of a shortest program for it. This is applied to show that the
result in L.F. Antunes, A. Souto, and P.M.B. Vit\'anyi, On the Rate of Decrease
in Logical Depth, Theor. Comput. Sci., 702(2017), 60--64 is valid
notwithstanding the error noted in Corrigendum P.M.B. Vit\'anyi, Corrigendum to
""On the rate of decrease in logical depth"" by L.F. Antunes, A. Souto, and
P.M.B. Vit\'anyi [Theoret. Comput. Sci. 702 (2017) 60--64], {\em Theoret.
Comput. Sci.}, https://doi.org/10.1016/j.tcs.2018.07.009 . /
","[{'version': 'v1', 'created': 'Wed, 28 Aug 2019 16:14:04 GMT'}]",2019-08-29,"[['Vitanyi', 'Paul MB', '']]","['Logical depth', 'Kolmogorov complexity', 'compression']"
10722,1410.3863,Andrea Del Prete Dr,"Andrea Del Prete, Francesco Nori, Giorgio Metta, Lorenzo Natale","Prioritized motion-force control of constrained fully-actuated robots:
  ""Task Space Inverse Dynamics""","Pre-print submitted to ""Robotics and Autonomous Systems""","A. Del Prete, et al., Prioritized motion-force control of
  constrained fully-actuated robots: ""Task Space Inverse Dynamics"", Robotics
  and Autonomous Systems (2014)",10.1016/j.robot.2014.08.016,,cs.RO,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We present a new framework for prioritized multi-task motion-force control of
fully-actuated robots. This work is established on a careful review and
comparison of the state of the art. Some control frameworks are not optimal,
that is they do not find the optimal solution for the secondary tasks. Other
frameworks are optimal, but they tackle the control problem at kinematic level,
hence they neglect the robot dynamics and they do not allow for force control.
Still other frameworks are optimal and consider force control, but they are
computationally less efficient than ours. Our final claim is that, for
fully-actuated robots, computing the operational-space inverse dynamics is
equivalent to computing the inverse kinematics (at acceleration level) and then
the joint-space inverse dynamics. Thanks to this fact, our control framework
can efficiently compute the optimal solution by decoupling kinematics and
dynamics of the robot. We take into account: motion and force control, soft and
rigid contacts, free and constrained robots. Tests in simulation validate our
control framework, comparing it with other state-of-the-art equivalent
frameworks and showing remarkable improvements in optimality and efficiency.
","[{'version': 'v1', 'created': 'Tue, 14 Oct 2014 20:42:02 GMT'}]",2014-10-16,"[['Del Prete', 'Andrea', ''], ['Nori', 'Francesco', ''], ['Metta', 'Giorgio', ''], ['Natale', 'Lorenzo', '']]","['prioritized control', 'hierarchical control', 'inverse dynamics', 'forcecontrol', 'operational space', 'task space']"
10723,1912.07650,Alexander Hayes,"Alexander L. Hayes and Mayukh Das and Phillip Odom and Sriraam
  Natarajan","User Friendly Automatic Construction of Background Knowledge: Mode
  Construction from ER Diagrams","8 pages. Published in Proceedings of the Knowledge Capture
  Conference, 2017",Proceedings of the Knowledge Capture Conference (2017) 30:1-30:8,10.1145/3148011.3148027,,cs.AI cs.DB cs.LG stat.ML,http://creativecommons.org/licenses/by-sa/4.0/,"  One of the key advantages of Inductive Logic Programming systems is the
ability of the domain experts to provide background knowledge as modes that
allow for efficient search through the space of hypotheses. However, there is
an inherent assumption that this expert should also be an ILP expert to provide
effective modes. We relax this assumption by designing a graphical user
interface that allows the domain expert to interact with the system using
Entity Relationship diagrams. These interactions are used to construct modes
for the learning system. We evaluate our algorithm on a probabilistic logic
learning system where we demonstrate that the user is able to construct
effective background knowledge on par with the expert-encoded knowledge on five
data sets.
","[{'version': 'v1', 'created': 'Mon, 16 Dec 2019 19:30:57 GMT'}]",2019-12-18,"[['Hayes', 'Alexander L.', ''], ['Das', 'Mayukh', ''], ['Odom', 'Phillip', ''], ['Natarajan', 'Sriraam', '']]","['Feature selection', 'Logical and relational learning', 'Entity relationship models', 'Interaction paradigms']"
10724,1710.00105,Ning Li,"Ning Li, Jose-Fernan Martinez-Ortega, Vicente Hernandez Diaz","Cross-layer Balanced and Reliable Opportunistic Routing Algorithm for
  Mobile Ad Hoc Networks","14 pages, 17 figures, 31 formulas, IEEE Sensors Journal, 2018",,10.1109/JSEN.2018.2838023,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For improving the efficiency and the reliability of the opportunistic routing
algorithm, in this paper, we propose the cross-layer and reliable opportunistic
routing algorithm (CBRT) for Mobile Ad Hoc Networks, which introduces the
improved efficiency fuzzy logic and humoral regulation inspired topology
control into the opportunistic routing algorithm. In CBRT, the inputs of the
fuzzy logic system are the relative variance (rv) of the metrics rather than
the values of the metrics, which reduces the number of fuzzy rules
dramatically. Moreover, the number of fuzzy rules does not increase when the
number of inputs increases. For reducing the control cost, in CBRT, the node
degree in the candidate relays set is a range rather than a constant number.
The nodes are divided into different categories based on their node degree in
the candidate relays set. The nodes adjust their transmission range based on
which categories that they belong to. Additionally, for investigating the
effection of the node mobility on routing performance, we propose a link
lifetime prediction algorithm which takes both the moving speed and moving
direction into account. In CBRT, the source node determines the relaying
priorities of the relaying nodes based on their utilities. The relaying node
which the utility is large will have high priority to relay the data packet. By
these innovations, the network performance in CBRT is much better than that in
ExOR, however, the computation complexity is not increased in CBRT.
","[{'version': 'v1', 'created': 'Fri, 29 Sep 2017 21:52:25 GMT'}, {'version': 'v2', 'created': 'Sat, 19 May 2018 10:57:49 GMT'}]",2018-05-22,"[['Li', 'Ning', ''], ['Martinez-Ortega', 'Jose-Fernan', ''], ['Diaz', 'Vicente Hernandez', '']]","['Cross-layer', 'fuzzy logic', 'topology control', 'opportunistic routing']"
10725,2201.12523,Ahmed E. Helal,"Andy Nguyen, Ahmed E. Helal, Fabio Checconi, Jan Laukemann, Jesmin
  Jahan Tithi, Yongseok Soh, Teresa Ranadive, Fabrizio Petrini, Jee W. Choi","Efficient, Out-of-Memory Sparse MTTKRP on Massively Parallel
  Architectures",Accepted to ICS 2022,,10.1145/3524059.3532363,,cs.DC cs.DS cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tensor decomposition (TD) is an important method for extracting latent
information from high-dimensional (multi-modal) sparse data. This study
presents a novel framework for accelerating fundamental TD operations on
massively parallel GPU architectures. In contrast to prior work, the proposed
Blocked Linearized Coordinate (BLCO) format enables efficient out-of-memory
computation of tensor algorithms using a unified implementation that works on a
single tensor copy. Our adaptive blocking and linearization strategies not only
meet the resource constraints of GPU devices, but also accelerate data
indexing, eliminate control-flow and memory-access irregularities, and reduce
kernel launching overhead. To address the substantial synchronization cost on
GPUs, we introduce an opportunistic conflict resolution algorithm, in which
threads collaborate instead of contending on memory access to discover and
resolve their conflicting updates on-the-fly, without keeping any auxiliary
information or storing non-zero elements in specific mode orientations. As a
result, our framework delivers superior in-memory performance compared to prior
state-of-the-art, and is the only framework capable of processing out-of-memory
tensors. On the latest Intel and NVIDIA GPUs, BLCO achieves 2.12-2.6X
geometric-mean speedup (with up to 33.35X speedup) over the state-of-the-art
mixed-mode compressed sparse fiber (MM-CSF) on a range of real-world sparse
tensors.
","[{'version': 'v1', 'created': 'Sat, 29 Jan 2022 08:01:45 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Jun 2022 23:40:22 GMT'}]",2022-06-29,"[['Nguyen', 'Andy', ''], ['Helal', 'Ahmed E.', ''], ['Checconi', 'Fabio', ''], ['Laukemann', 'Jan', ''], ['Tithi', 'Jesmin Jahan', ''], ['Soh', 'Yongseok', ''], ['Ranadive', 'Teresa', ''], ['Petrini', 'Fabrizio', ''], ['Choi', 'Jee W.', '']]","['Tensor decomposition', 'MTTKRP', 'sparse tensors', 'sparse formats', 'parallel performance', 'GPU']"
10726,1906.01285,AKM Bahalul Haque,AKM Bahalul Haque,"Need for Critical Cyber Defence, Security Strategy and Privacy Policy in
  Bangladesh - Hype or Reality?","14 Pages, 8 Figures , 1 Table","International Journal of Managing Information Technology (IJMIT)
  Vol.11, No.1,February 2019",10.5121/ijmit.2019.11103,,cs.SI cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Cyber security is one of the burning issues in modern world. Increased IT
infrastructure has given rise to enormous chances of security breach.
Bangladesh being a relatively new member of cyber security arena has its own
demand and appeal. Digitalization is happening in Bangladesh for last few years
at an appreciable rate. People are being connected to the worldwide web
community with their smart devices. These devices have their own vulnerability
issues as well as the data shared over the internet has a very good chances of
getting breached. Common vulnerability issues like infecting the device with
malware, Trojan, virus are on the rise. Moreover, a lack of proper cyber
security policy and strategy might make the existing situation at the
vulnerable edge of tipping point. Hence the upcoming new infrastructures will
be at a greater risk if the issues are not dealt with at an early age. In this
paper common vulnerability issues including their recent attacks on cyber space
of Bangladesh, cyber security strategy and need for data privacy policy is
discussed and analysed briefly.
","[{'version': 'v1', 'created': 'Tue, 4 Jun 2019 09:06:40 GMT'}]",2019-06-05,"[['Haque', 'AKM Bahalul', '']]","['CyberSecurity', 'Cyberdefence', 'Security Policy', 'Vulnerability', 'Cyber Threat', 'Security Strategy    1']"
10727,1803.11280,Birgitta Dresp-Langley,"AU Batmaz, M de Mathelin and Birgitta Dresp-Langley","Getting nowhere fast: trade-off between speed and precision in training
  to execute image-guided hand-tool movements",,"2016, BMC Psychology, 4, 55",10.1186/s40359-016-0161-0,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: The speed and precision with which objects are moved by hand or
hand-tool interaction under image guidance depend on a specific type of visual
and spatial sensorimotor learning. Novices have to learn to optimally control
what their hands are doing in a real-world environment while looking at an
image representation of the scene on a video monitor. Previous research has
shown slower task execution times and lower performance scores under
image-guidance compared with situations of direct action viewing. The cognitive
processes for overcoming this drawback by training are not yet understood.
Methods: We investigated the effects of training on the time and precision of
direct view versus image guided object positioning on targets of a Real-world
Action Field (RAF). Two men and two women had to learn to perform the task as
swiftly and as precisely as possible with their dominant hand, using a tool or
not and wearing a glove or not. Individuals were trained in sessions of mixed
trial blocks with no feed-back. Results: As predicted, image-guidance produced
significantly slower times and lesser precision in all trainees and
sessionscompared with direct viewing. With training, all trainees get faster in
all conditions, but only one of them gets reliably more precise in the
image-guided conditions. Speed-accuracy trade-offs in the individual
performance data show that the highest precision scores and steepest learning
curve, for time and precision, were produced by the slowest
starter.Conclusions: Performance evolution towards optimal precision is
compromised when novices start by going as fast as they can. The findings have
direct implications for individual skill monitoring in training programmes for
image-guided technology applications with human operators.
","[{'version': 'v1', 'created': 'Thu, 29 Mar 2018 23:07:19 GMT'}]",2018-04-02,"[['Batmaz', 'AU', ''], ['de Mathelin', 'M', ''], ['Dresp-Langley', 'Birgitta', '']]","['Image-guided technology', 'Human operator', 'Simulator training', 'Tool-mediated object manipulation', 'Time', 'Precision']"
10728,2202.10897,Marco Spanghero,"M.Lenhart, M. Spanghero, P. Papadimitratos",DEMO: Relay/Replay Attacks on GNSS signals,,,10.1145/3448300.3468256,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Global Navigation Satellite Systems (GNSS) are ubiquitously relied upon for
positioning and timing. Detection and prevention of attacks against GNSS have
been researched over the last decades, but many of these attacks and
countermeasures were evaluated based on simulation. This work contributes to
the experimental investigation of GNSS vulnerabilities, implementing a
relay/replay attack with off-the-shelf hardware. Operating at the signal level,
this attack type is not hindered by cryptographically protected transmissions,
such as Galileo's Open Signals Navigation Message Authentication (OS-NMA). The
attack we investigate involves two colluding adversaries, relaying signals over
large distances, to effectively spoof a GNSS receiver. We demonstrate the
attack using off-the-shelf hardware, we investigate the requirements for such
successful colluding attacks, and how they can be enhanced, e.g., allowing for
finer adversarial control over the victim receiver.
","[{'version': 'v1', 'created': 'Tue, 22 Feb 2022 13:54:22 GMT'}]",2022-02-23,"[['Lenhart', 'M.', ''], ['Spanghero', 'M.', ''], ['Papadimitratos', 'P.', '']]","['Global Navigation Satellite Systems (GNSS)', 'spoofing', 'meaconing', 'replay/relay attack', 'off-the-shelf hardware']"
10729,2006.04660,Rajdeep Mukherjee,"Rajdeep Mukherjee, Hari Chandana Peruri, Uppada Vishnu, Pawan Goyal,
  Sourangshu Bhattacharya, Niloy Ganguly","Read what you need: Controllable Aspect-based Opinion Summarization of
  Tourist Reviews","4 pages, accepted in the Proceedings of the 43rd International ACM
  SIGIR Conference on Research and Development in Information Retrieval
  (SIGIR), 2020",,10.1145/3397271.3401269,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Manually extracting relevant aspects and opinions from large volumes of
user-generated text is a time-consuming process. Summaries, on the other hand,
help readers with limited time budgets to quickly consume the key ideas from
the data. State-of-the-art approaches for multi-document summarization,
however, do not consider user preferences while generating summaries. In this
work, we argue the need and propose a solution for generating personalized
aspect-based opinion summaries from large collections of online tourist
reviews. We let our readers decide and control several attributes of the
summary such as the length and specific aspects of interest among others.
Specifically, we take an unsupervised approach to extract coherent aspects from
tourist reviews posted on TripAdvisor. We then propose an Integer Linear
Programming (ILP) based extractive technique to select an informative subset of
opinions around the identified aspects while respecting the user-specified
values for various control parameters. Finally, we evaluate and compare our
summaries using crowdsourcing and ROUGE-based metrics and obtain competitive
results.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2020 15:03:38 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Jun 2020 07:22:48 GMT'}]",2020-06-11,"[['Mukherjee', 'Rajdeep', ''], ['Peruri', 'Hari Chandana', ''], ['Vishnu', 'Uppada', ''], ['Goyal', 'Pawan', ''], ['Bhattacharya', 'Sourangshu', ''], ['Ganguly', 'Niloy', '']]","['Controllable summarization', 'Aspect-based opinion mining', 'Unsupervised extractive opinion summarization', 'Personalization', 'Tourism']"
10730,2004.09169,Andrei-Timotei Ardelean,"Andrei-Timotei Ardelean, Lucian Mircea Sasu",Pose Manipulation with Identity Preservation,"9 pages, journal article","International Journal of Computers Communications & Control, Vol
  15, Nr 2, 3862, 2020",10.15837/ijccc.2020.2.3862,,cs.CV cs.GR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a new model which generates images in novel poses e.g.
by altering face expression and orientation, from just a few instances of a
human subject. Unlike previous approaches which require large datasets of a
specific person for training, our approach may start from a scarce set of
images, even from a single image. To this end, we introduce Character Adaptive
Identity Normalization GAN (CainGAN) which uses spatial characteristic features
extracted by an embedder and combined across source images. The identity
information is propagated throughout the network by applying conditional
normalization. After extensive adversarial training, CainGAN receives figures
of faces from a certain individual and produces new ones while preserving the
person's identity. Experimental results show that the quality of generated
images scales with the size of the input set used during inference.
Furthermore, quantitative measurements indicate that CainGAN performs better
compared to other methods when training data is limited.
","[{'version': 'v1', 'created': 'Mon, 20 Apr 2020 09:51:31 GMT'}]",2020-04-21,"[['Ardelean', 'Andrei-Timotei', ''], ['Sasu', 'Lucian Mircea', '']]","['pose manipulation', 'image generation', 'adaptive normalization', 'Generative Adversarial Network']"
10731,2201.11851,Matija \v{S}ipek,"M. Sipek, D. Muharemagic, B. Mihaljevic, and A. Radovan","Enhancing Performance of Cloud-based Software Applications with GraalVM
  and Quarkus","6 pages, 5 figures, 1 table","43rd International Convention on Information, Communication and
  Electronic Technology (MIPRO), Opatija, Croatia, 2020, pp. 1746-1751",10.23919/MIPRO48935.2020.9245290,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Increased complexity of network-based software solutions and the ever-rising
number of concurrent users forced a shift of the IT industry to cloud
computing. Conventional network software systems commonly based on monolithic
application stack running on costly physical single-purpose servers are
affected by significant problems of resource management, computing power
distribution, and scalability.Such implementation is restricting applications
to be reduced to smaller, independent services that can be more easily
deployed, managed, and scaled dynamically; therefore, embellishing
environmental uniformity across development, testing, and production. Current
cloud-based infrastructure frequently runs on containers placed in Kubernetes
or Docker-based cluster, and the system configuration is considerably different
compared to the environment prevailed with common virtualizations. This paper
discusses the usage of GraalVM, a polyglot high-performance virtual machine for
JVM-based and other languages, combined with new Kubernetes native Java
tailored stacked framework named Quarkus, formed from enhanced Java libraries.
Moreover, our research explores GraalVMs creation of native images using
Ahead-Of-Time (AOT) compilation and Quarkus deployment to Kubernetes.
Furthermore, we examined the architectures of given systems, various
performance variables, and differing memory usage cases within our academic
testing environment and presented the comparison results of selected
performance measures with other traditional and contemporary solutions
","[{'version': 'v1', 'created': 'Wed, 15 Dec 2021 16:58:00 GMT'}]",2022-01-31,"[['Sipek', 'M.', ''], ['Muharemagic', 'D.', ''], ['Mihaljevic', 'B.', ''], ['Radovan', 'A.', '']]","['GraalVM', 'Kubernetes', 'Quarkus', 'Cloud']"
10732,2010.04811,Bruce Collie,"Bruce Collie, Jackson Woodruff, Michael F.P. O'Boyle",Modeling Black-Box Components with Probabilistic Synthesis,Accepted to GPCE 2020,,10.1145/3425898.3426952,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is concerned with synthesizing programs based on black-box
oracles: we are interested in the case where there exists an executable
implementation of a component or library, but its internal structure is
unknown. We are provided with just an API or function signature, and aim to
synthesize a program with equivalent behavior.
  To attack this problem, we detail Presyn: a program synthesizer designed for
flexible interoperation with existing programs and compiler toolchains. Presyn
uses high-level imperative control-flow structures and a pair of cooperating
predictive models to efficiently narrow the space of potential programs. These
models can be trained effectively on small corpora of synthesized examples.
  We evaluate Presyn against five leading program synthesizers on a collection
of 112 synthesis benchmarks collated from previous studies and real-world
software libraries. We show that Presyn is able to synthesize a wider range of
programs than each of them with less human input. We demonstrate the
application of our approach to real-world code and software engineering
problems with two case studies: accelerator library porting and detection of
duplicated library reimplementations.
","[{'version': 'v1', 'created': 'Fri, 9 Oct 2020 21:17:03 GMT'}]",2020-10-13,"[['Collie', 'Bruce', ''], ['Woodruff', 'Jackson', ''], [""O'Boyle"", 'Michael F. P.', '']]","['program synthesis', 'black box oracle', 'probabilisticmodel']"
10733,2205.14631,Jean Dupuy,"Jean Dupuy, Adrien Guille and Julien Jacques",Anchor Prediction: A Topic Modeling Approach,"14 pages, correct typo and \citep",,10.1145/3487553.3524927,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Networks of documents connected by hyperlinks, such as Wikipedia, are
ubiquitous. Hyperlinks are inserted by the authors to enrich the text and
facilitate the navigation through the network. However, authors tend to insert
only a fraction of the relevant hyperlinks, mainly because this is a time
consuming task. In this paper we address an annotation, which we refer to as
anchor prediction. Even though it is conceptually close to link prediction or
entity linking, it is a different task that require developing a specific
method to solve it. Given a source document and a target document, this task
consists in automatically identifying anchors in the source document, i.e words
or terms that should carry a hyperlink pointing towards the target document. We
propose a contextualized relational topic model, CRTM, that models directed
links between documents as a function of the local context of the anchor in the
source document and the whole content of the target document. The model can be
used to predict anchors in a source document, given the target document,
without relying on a dictionary of previously seen mention or title, nor any
external knowledge graph. Authors can benefit from CRTM, by letting it
automatically suggest hyperlinks, given a new document and the set of target
document to connect to. It can also benefit to readers, by dynamically
inserting hyperlinks between the documents they're reading. Experiments
conducted on several Wikipedia corpora (in English, Italian and German)
highlight the practical usefulness of anchor prediction and demonstrate the
relevancy of our approach.
","[{'version': 'v1', 'created': 'Sun, 29 May 2022 11:26:52 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Jun 2022 07:38:36 GMT'}]",2022-06-02,"[['Dupuy', 'Jean', ''], ['Guille', 'Adrien', ''], ['Jacques', 'Julien', '']]","['Anchor prediction', 'Topic modeling', 'Annotation', 'Document network']"
10734,2111.09626,Daniel Gibert,"Daniel Gibert and Matt Fredrikson and Carles Mateu and Jordi Planes
  and Quan Le","Enhancing the Insertion of NOP Instructions to Obfuscate Malware via
  Deep Reinforcement Learning",,"Journal Computers & Security, Volume 113, 2022, 102543",10.1016/j.cose.2021.102543,0167-4048,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Current state-of-the-art research for tackling the problem of malware
detection and classification is centered on the design, implementation and
deployment of systems powered by machine learning because of its ability to
generalize to never-before-seen malware families and polymorphic mutations.
However, it has been shown that machine learning models, in particular deep
neural networks, lack robustness against crafted inputs (adversarial examples).
In this work, we have investigated the vulnerability of a state-of-the-art
shallow convolutional neural network malware classifier against the dead code
insertion technique. We propose a general framework powered by a Double
Q-network to induce misclassification over malware families. The framework
trains an agent through a convolutional neural network to select the optimal
positions in a code sequence to insert dead code instructions so that the
machine learning classifier mislabels the resulting executable. The experiments
show that the proposed method significantly drops the classification accuracy
of the classifier to 56.53% while having an evasion rate of 100% for the
samples belonging to the Kelihos_ver3, Simda, and Kelihos_ver1 families. In
addition, the average number of instructions needed to mislabel malware in
comparison to a random agent decreased by 33%.
","[{'version': 'v1', 'created': 'Thu, 18 Nov 2021 11:10:28 GMT'}]",2022-06-14,"[['Gibert', 'Daniel', ''], ['Fredrikson', 'Matt', ''], ['Mateu', 'Carles', ''], ['Planes', 'Jordi', ''], ['Le', 'Quan', '']]","['Malware Classification', 'Assembly Language Source Code', 'Obfuscation', 'Reinforcement Learning', 'Deep Q-Network']"
10735,1807.08109,Mirko Leomanni,"Mirko Leomanni, Andrea Garulli, Antonio Giannitrapani, Fabrizio
  Scortecci","An Adaptive Groundtrack Maintenance Scheme for Spacecraft with Electric
  Propulsion",,"Acta Astronautica, Vol. 167, 2020",10.1016/j.actaastro.2019.11.035,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the repeat-groundtrack orbit maintenance problem is addressed
for spacecraft driven by electric propulsion. An adaptive solution is proposed,
which combines an hysteresis controller and a recursive least squares filter.
The controller provides a pulse-width modulated command to the thruster, in
compliance with the peculiarities of the electric propulsion technology. The
filter takes care of estimating a set of environmental disturbance parameters,
from inertial position and velocity measurements. The resulting control scheme
is able to compensate for the groundtrack drift due to atmospheric drag, in a
fully autonomous manner. A numerical study of a low Earth orbit mission
confirms the effectiveness of the proposed method.
","[{'version': 'v1', 'created': 'Sat, 21 Jul 2018 08:51:17 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Jun 2019 11:06:53 GMT'}]",2021-01-22,"[['Leomanni', 'Mirko', ''], ['Garulli', 'Andrea', ''], ['Giannitrapani', 'Antonio', ''], ['Scortecci', 'Fabrizio', '']]","['Ground Track Maintenance', 'Electric Propulsion', 'Low Earth Orbit']"
10736,2110.01981,David Walton,"David R. Walton, Koray Kavakl{\i}, Rafael Kuffner dos Anjos, David
  Swapp, Tim Weyrich, Hakan Urey, Anthony Steed, Tobias Ritschel, and Kaan
  Ak\c{s}it",Metameric Varifocal Holography,,"2022 IEEE Conference on Virtual Reality and 3D User Interfaces
  (VR)",10.1109/VR51125.2022.00096,,cs.GR physics.optics,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Computer-Generated Holography (CGH) offers the potential for genuine,
high-quality three-dimensional visuals. However, fulfilling this potential
remains a practical challenge due to computational complexity and visual
quality issues. We propose a new CGH method that exploits gaze-contingency and
perceptual graphics to accelerate the development of practical holographic
display systems. Firstly, our method infers the user's focal depth and
generates images only at their focus plane without using any moving parts.
Second, the images displayed are metamers; in the user's peripheral vision,
they need only be statistically correct and blend with the fovea seamlessly.
Unlike previous methods, our method prioritises and improves foveal visual
quality without causing perceptually visible distortions at the periphery. To
enable our method, we introduce a novel metameric loss function that robustly
compares the statistics of two given images for a known gaze location. In
parallel, we implement a model representing the relation between holograms and
their image reconstructions. We couple our differentiable loss function and
model to metameric varifocal holograms using a stochastic gradient descent
solver. We evaluate our method with an actual proof-of-concept holographic
display, and we show that our CGH method leads to practical and perceptually
three-dimensional image reconstructions.
","[{'version': 'v1', 'created': 'Tue, 5 Oct 2021 12:20:21 GMT'}, {'version': 'v2', 'created': 'Mon, 16 May 2022 08:29:04 GMT'}]",2022-05-17,"[['Walton', 'David R.', ''], ['Kavaklı', 'Koray', ''], ['Anjos', 'Rafael Kuffner dos', ''], ['Swapp', 'David', ''], ['Weyrich', 'Tim', ''], ['Urey', 'Hakan', ''], ['Steed', 'Anthony', ''], ['Ritschel', 'Tobias', ''], ['Akşit', 'Kaan', '']]","['Computer-Generated Holography', 'Foveated Rendering', 'Metamerisation', 'Varifocal Near-Eye Displays', 'Virtual Reality', 'Augmented Reality']"
10737,2201.05861,Chengqiang Lu,"Chengqiang Lu, Mingyang Yin, Shuheng Shen, Luo Ji, Qi Liu, Hongxia
  Yang",Deep Unified Representation for Heterogeneous Recommendation,"12 pages, 4 figures, accepted by the ACM Web Conference 2022 (WWW
  '22)",,10.1145/3485447.3512087,,cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Recommendation system has been a widely studied task both in academia and
industry. Previous works mainly focus on homogeneous recommendation and little
progress has been made for heterogeneous recommender systems. However,
heterogeneous recommendations, e.g., recommending different types of items
including products, videos, celebrity shopping notes, among many others, are
dominant nowadays. State-of-the-art methods are incapable of leveraging
attributes from different types of items and thus suffer from data sparsity
problems. And it is indeed quite challenging to represent items with different
feature spaces jointly. To tackle this problem, we propose a kernel-based
neural network, namely deep unified representation (or DURation) for
heterogeneous recommendation, to jointly model unified representations of
heterogeneous items while preserving their original feature space topology
structures. Theoretically, we prove the representation ability of the proposed
model. Besides, we conduct extensive experiments on real-world datasets.
Experimental results demonstrate that with the unified representation, our
model achieves remarkable improvement (e.g., 4.1% ~ 34.9% lift by AUC score and
3.7% lift by online CTR) over existing state-of-the-art models.
","[{'version': 'v1', 'created': 'Sat, 15 Jan 2022 14:33:28 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Jan 2022 08:17:10 GMT'}]",2022-01-27,"[['Lu', 'Chengqiang', ''], ['Yin', 'Mingyang', ''], ['Shen', 'Shuheng', ''], ['Ji', 'Luo', ''], ['Liu', 'Qi', ''], ['Yang', 'Hongxia', '']]","['Recommendation System', 'Representation Learning', 'HeterogeneousRecommendation']"
10738,1401.5878,"J\""urgen M\""unch","Adam Trendowicz, J\""urgen M\""unch, Ross Jeffery","State of the Practice in Software Effort Estimation: A Survey and
  Literature Review","14 pages. The final publication is available at
  http://link.springer.com/chapter/10.1007/978-3-642-22386-0_18","Software Engineering Techniques, Proceedings of the 3rd IFIP TC2
  Central and Eastern European Conference on Software Engineering Techniques
  (CEE-SET 2008), pages 232-245, 2008",10.1007/978-3-642-22386-0_18,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Effort estimation is a key factor for software project success, defined as
delivering software of agreed quality and functionality within schedule and
budget. Traditionally, effort estimation has been used for planning and
tracking project resources. Effort estimation methods founded on those goals
typically focus on providing exact estimates and usually do not support
objectives that have recently become important within the software industry,
such as systematic and reliable analysis of causal effort dependencies. This
article presents the results of a study of software effort estimation from an
industrial perspective. The study surveys industrial objectives, the abilities
of software organizations to apply certain estimation methods, and actually
applied practices of software effort estimation. Finally, requirements for
effort estimation methods identified in the survey are compared against
existing estimation methods.
","[{'version': 'v1', 'created': 'Thu, 23 Jan 2014 06:42:05 GMT'}]",2014-01-24,"[['Trendowicz', 'Adam', ''], ['Münch', 'Jürgen', ''], ['Jeffery', 'Ross', '']]","['software', 'project management', 'effort estimation', 'survey', 'state of the practice', 'state of the art']"
10739,1904.07694,Avraham Trahtman N,A.N. Trahtman,Matrix approach to synchronizing automata,"19-pages.3 figures An error removed. arXiv admin note: text overlap
  with arXiv:1405.2435, arXiv:1202.4626",,10.13140/RG.2.2.12464.66566,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A word $w$ of letters on edges of underlying graph $\Gamma$ of deterministic
finite automaton (DFA) is called synchronizing if $w$ sends all states of the
automaton to a unique state. J. \v{C}erny discovered in 1964 a sequence of
$n$-state complete DFA possessing a minimal synchronizing word of length
$(n-1)^2$. The hypothesis, well known today as \v{C}erny conjecture, claims
that $(n-1)^2$ is a precise upper bound on the length of such a word over
alphabet $\Sigma$ of letters on edges of $\Gamma$ for every complete $n$-state
DFA. The hypothesis was formulated distinctly in 1966 by Starke. A special
classes of matrices induced by words in the alphabet of labels on edges of the
underlying graph of DFA are used for the study of synchronizing automata.
","[{'version': 'v1', 'created': 'Sat, 13 Apr 2019 10:43:47 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Jul 2019 13:16:43 GMT'}, {'version': 'v3', 'created': 'Sat, 2 Nov 2019 07:26:09 GMT'}, {'version': 'v4', 'created': 'Mon, 11 Nov 2019 13:48:31 GMT'}]",2019-11-12,"[['Trahtman', 'A. N.', '']]","['deterministic finite automata', 'synchronizing word', 'ˇCerny conjecture']"
10740,2010.08091,Hongru Liang,"Hongru Liang, Wenqiang Lei, Paul Yaozhu Chan, Zhenglu Yang, Maosong
  Sun, Tat-Seng Chua","PiRhDy: Learning Pitch-, Rhythm-, and Dynamics-aware Embeddings for
  Symbolic Music",ACM Multimedia 2020 -- best paper,,10.1145/3394171.3414032,,cs.SD cs.MM eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Definitive embeddings remain a fundamental challenge of computational
musicology for symbolic music in deep learning today. Analogous to natural
language, music can be modeled as a sequence of tokens. This motivates the
majority of existing solutions to explore the utilization of word embedding
models to build music embeddings. However, music differs from natural languages
in two key aspects: (1) musical token is multi-faceted -- it comprises of
pitch, rhythm and dynamics information; and (2) musical context is
two-dimensional -- each musical token is dependent on both melodic and harmonic
contexts. In this work, we provide a comprehensive solution by proposing a
novel framework named PiRhDy that integrates pitch, rhythm, and dynamics
information seamlessly. PiRhDy adopts a hierarchical strategy which can be
decomposed into two steps: (1) token (i.e., note event) modeling, which
separately represents pitch, rhythm, and dynamics and integrates them into a
single token embedding; and (2) context modeling, which utilizes melodic and
harmonic knowledge to train the token embedding. A thorough study was made on
each component and sub-strategy of PiRhDy. We further validate our embeddings
in three downstream tasks -- melody completion, accompaniment suggestion, and
genre classification. Results indicate a significant advancement of the neural
approach towards symbolic music as well as PiRhDy's potential as a pretrained
tool for a broad range of symbolic music applications.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2020 01:25:48 GMT'}]",2020-10-19,"[['Liang', 'Hongru', ''], ['Lei', 'Wenqiang', ''], ['Chan', 'Paul Yaozhu', ''], ['Yang', 'Zhenglu', ''], ['Sun', 'Maosong', ''], ['Chua', 'Tat-Seng', '']]","['Symbolic Music', 'Representation Learning', 'Embeddings']"
10741,2111.09961,Yao Li,"Yao Li, Minhao Cheng, Cho-Jui Hsieh, Thomas C. M. Lee",A Review of Adversarial Attack and Defense for Classification Methods,,The American Statistician. 0 (2021) 1-44,10.1080/00031305.2021.2006781,,cs.CR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Despite the efficiency and scalability of machine learning systems, recent
studies have demonstrated that many classification methods, especially deep
neural networks (DNNs), are vulnerable to adversarial examples; i.e., examples
that are carefully crafted to fool a well-trained classification model while
being indistinguishable from natural data to human. This makes it potentially
unsafe to apply DNNs or related methods in security-critical areas. Since this
issue was first identified by Biggio et al. (2013) and Szegedy et al.(2014),
much work has been done in this field, including the development of attack
methods to generate adversarial examples and the construction of defense
techniques to guard against such examples. This paper aims to introduce this
topic and its latest developments to the statistical community, primarily
focusing on the generation and guarding of adversarial examples. Computing
codes (in python and R) used in the numerical experiments are publicly
available for readers to explore the surveyed methods. It is the hope of the
authors that this paper will encourage more statisticians to work on this
important and exciting field of generating and defending against adversarial
examples.
","[{'version': 'v1', 'created': 'Thu, 18 Nov 2021 22:13:43 GMT'}]",2021-11-22,"[['Li', 'Yao', ''], ['Cheng', 'Minhao', ''], ['Hsieh', 'Cho-Jui', ''], ['Lee', 'Thomas C. M.', '']]","['adversarial examples', 'adversarial training', 'deep neural networks', 'defense robustness']"
10742,2001.07688,Mengqiao Xu,"Mengqiao Xu, Qian Pan, Haoxiang Xia, Naoki Masuda","Estimating international trade status of countries from global liner
  shipping networks","2 figures, 3 tables, SI with 1 figure and 6 tables",R. Soc. Open Sci. 7: 200386 (2020),10.1098/rsos.200386,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Maritime shipping is a backbone of international trade and, thus, the world
economy. Cargo-loaded vessels travel from one country's port to another via an
underlying port-to-port transport network, contributing to international trade
values of countries en route. We hypothesize that ports that involve
trans-shipment activities serve as a third-party broker to mediate trade
between two foreign countries and contribute to the corresponding country's
status in international trade. We test this hypothesis using a port-level
dataset of global liner shipping services. We propose two indices that quantify
the importance of countries in the global liner shipping network and show that
they explain a large amount of variation in individual countries' international
trade values and related measures. These results support a long-standing view
in maritime economics, which has yet to be directly tested, that countries that
are strongly integrated into the global maritime transportation network have
enhanced access to global markets and trade opportunities.
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2020 18:42:21 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Oct 2020 09:44:26 GMT'}]",2020-10-26,"[['Xu', 'Mengqiao', ''], ['Pan', 'Qian', ''], ['Xia', 'Haoxiang', ''], ['Masuda', 'Naoki', '']]","['complex network', 'maritime transportation', 'international trade']"
10743,1906.00759,Abu Sufian,"A. Sufian, A. Banerjee, P.Dutta","Fuzzy-Controlled Scheduling of Route-Request Packets (FSRR) in Mobile Ad
  Hoc Networks","6 pages, 4 figures","Indian Journal of Science and Technology, Vol 9(43), November 2016",10.17485/ijst/2016/v9i43/104384,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In ad hoc networks, the scheduling of route-request packets should be
different from that of message packets, because during transmission of message
packets the location of the destination is known whereas in route discovery
this is not known in most of the cases. The router has to depend upon the last
known location, if any, of the destination to determine the center and radius
of the circle that embeds all possible current position of the destination.
Route-request packets generated from the source are directed towards this
circle i.e., directional route discovery can be applied. Otherwise, when no
earlier location of the destination is known the route-requested has to be
broadcast in the whole network consuming a significant amount of time than
directional route discovery. The present article proposes fuzzy controlled
scheduling of route-request packets in particular that greatly reduces the
average delay in route discovery in ad hoc networks.
","[{'version': 'v1', 'created': 'Sun, 26 May 2019 06:58:49 GMT'}]",2019-06-04,"[['Sufian', 'A.', ''], ['Banerjee', 'A.', ''], ['Dutta', 'P.', '']]","['Ad Hoc Networks', 'Delay', 'Embedding Circle', 'Route-Request', 'Scheduling']"
10744,2011.12288,Srinivasan Sridharan,Srinivasan Sridharan,"Machine Learning (ML) In a 5G Standalone (SA) Self Organizing Network
  (SON)","5G, Machine learning (ML), Self-organizing Networks (SONs), 5G
  Standalone, Artificial Intelligence (AI)",,10.14445/22312803/IJCTT-V68I11P105,,cs.NI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning (ML) is included in Self-organizing Networks (SONs) that are
key drivers for enhancing the Operations, Administration, and Maintenance (OAM)
activities. It is included in the 5G Standalone (SA) system is one of the 5G
communication tracks that transforms 4G networking to next-generation
technology that is based on mobile applications. The research's main aim is to
an overview of machine learning (ML) in 5G standalone core networks. 5G
Standalone is considered a key enabler by the service providers as it improves
the efficacy of the throughput that edges the network. It also assists in
advancing new cellular use cases like ultra-reliable low latency communications
(URLLC) that supports combinations of frequencies.
","[{'version': 'v1', 'created': 'Tue, 24 Nov 2020 18:57:40 GMT'}]",2020-11-25,"[['Sridharan', 'Srinivasan', '']]","['5G', 'machine learning (ML)', 'Self-organizing Networks (SONs)', '5G Standalone', 'Artificial Intelligence (AI)']"
10745,2301.03720,Rachid EL Mokadem,"Rachid EL Mokadem, Yann Ben Maissa and Zineb El Akkaoui","Federated Learning for Energy Constrained IoT devices: A systematic
  mapping study",27 pages,"El Mokadem, R., Ben Maissa, Y., & El Akkaoui, Z. (2022). Federated
  learning for energy constrained devices: a systematic mapping study. Cluster
  Computing, 1-24",10.1007/s10586-022-03763-4,,cs.LG cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Federated Machine Learning (Fed ML) is a new distributed machine learning
technique applied to collaboratively train a global model using clients local
data without transmitting it. Nodes only send parameter updates (e.g., weight
updates in the case of neural networks), which are fused together by the server
to build the global model. By not divulging node data, Fed ML guarantees its
confidentiality, a crucial aspect of network security, which enables it to be
used in the context of data-sensitive Internet of Things (IoT) and mobile
applications, such as smart Geo-location and the smart grid. However, most IoT
devices are particularly energy constrained, which raises the need to optimize
the Fed ML process for efficient training tasks and optimized power
consumption. In this paper, we conduct, to the best of our knowledge, the first
Systematic Mapping Study (SMS) on Fed ML optimization techniques for
energy-constrained IoT devices. From a total of more than 800 papers, we select
67 that satisfy our criteria and give a structured overview of the field using
a set of carefully chosen research questions. Finally, we attempt to provide an
analysis of the energy-constrained Fed ML state of the art and try to outline
some potential recommendations for the research community.
","[{'version': 'v1', 'created': 'Mon, 9 Jan 2023 23:30:32 GMT'}]",2023-01-11,"[['Mokadem', 'Rachid EL', ''], ['Maissa', 'Yann Ben', ''], ['Akkaoui', 'Zineb El', '']]","['Federated Machine Learning', 'Energy Optimization', 'Internet of Things', 'Edge and Mobile Computing', 'On-device Intelligence']"
10746,1904.06197,Andrea Mendizabal,"Andrea Mendizabal, Pablo M\'arquez-Neila, St\'ephane Cotin",Simulation of hyperelastic materials in real-time using Deep Learning,,"Medical Image Analysis, Volume 59, January 2020, 101569",10.1016/j.media.2019.101569,,cs.CE cs.LG physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The finite element method (FEM) is among the most commonly used numerical
methods for solving engineering problems. Due to its computational cost,
various ideas have been introduced to reduce computation times, such as domain
decomposition, parallel computing, adaptive meshing, and model order reduction.
In this paper we present U-Mesh: a data-driven method based on a U-Net
architecture that approximates the non-linear relation between a contact force
and the displacement field computed by a FEM algorithm. We show that deep
learning, one of the latest machine learning methods based on artificial neural
networks, can enhance computational mechanics through its ability to encode
highly non-linear models in a compact form. Our method is applied to two
benchmark examples: a cantilever beam and an L-shape subject to moving punctual
loads. A comparison between our method and proper orthogonal decomposition
(POD) is done through the paper. The results show that U-Mesh can perform very
fast simulations on various geometries, mesh resolutions and number of input
forces with very small errors.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2019 17:30:28 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Nov 2019 14:04:58 GMT'}]",2019-11-07,"[['Mendizabal', 'Andrea', ''], ['Márquez-Neila', 'Pablo', ''], ['Cotin', 'Stéphane', '']]","['Real-time simulation', 'Deep neural networks', 'Physics-based simulation', 'Finiteelement method', 'Hyperelasticity', 'Reduced order model']"
10747,2110.14228,Muhammad Nasir,"Muhammad Nasir, Naveed Ikram, Zakia Jalil",Usability Inspection: Novice Crowd Inspectors versus Expert,,,10.1016/j.jss.2021.111122,,cs.SE cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Objective: This research study aims to investigate the use of novice crowd
inspectors for usability inspection with respect to time spent and the cost
incurred. This study compares the results of the novice crowd usability
inspection guided by a single expert's heuristic usability inspection (novice
crowd usability inspection henceforth) with the expert heuristic usability
inspection. Background: Traditional usability evaluation methods are time
consuming and expensive. Crowdsourcing has emerged as a cost effective and
quick means of software usability evaluation. Method: In this regard, we
designed an experiment to evaluate the usability of two websites and a web
dashboard. Results: The results of the experiment show that novice crowd
usability inspection guided by a single expert's heuristic usability
inspection: a). Finds the same usability issues (w.r.t. content & quantity) as
expert heuristic usability inspection. b). Is cost effective than expert
heuristic usability inspection employing less time duration. Conclusion: Based
on the findings of this research study, we can conclude that the novice crowd
usability inspection guided by a single expert's heuristic usability inspection
and expert heuristic usability inspection, on average, gives the same results
in terms of issues identified.
","[{'version': 'v1', 'created': 'Wed, 27 Oct 2021 07:24:50 GMT'}]",2021-10-28,"[['Nasir', 'Muhammad', ''], ['Ikram', 'Naveed', ''], ['Jalil', 'Zakia', '']]","['crowdsourcing', 'usability inspection', 'heuristic evaluations', 'empirical studies in visualizations']"
10748,1604.03200,Ilias Flaounas,"Ricardo \~Nanculef, Ilias Flaounas, Nello Cristianini",Efficient Classification of Multi-Labelled Text Streams by Clashing,,,10.1016/j.eswa.2014.02.017,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a method for the classification of multi-labelled text documents
explicitly designed for data stream applications that require to process a
virtually infinite sequence of data using constant memory and constant
processing time. Our method is composed of an online procedure used to
efficiently map text into a low-dimensional feature space and a partition of
this space into a set of regions for which the system extracts and keeps
statistics used to predict multi-label text annotations. Documents are fed into
the system as a sequence of words, mapped to a region of the partition, and
annotated using the statistics computed from the labelled instances colliding
in the same region. This approach is referred to as clashing. We illustrate the
method in real-world text data, comparing the results with those obtained using
other text classifiers. In addition, we provide an analysis about the effect of
the representation space dimensionality on the predictive performance of the
system. Our results show that the online embedding indeed approximates the
geometry of the full corpus-wise TF and TF-IDF space. The model obtains
competitive F measures with respect to the most accurate methods, using
significantly fewer computational resources. In addition, the method achieves a
higher macro-averaged F measure than methods with similar running time.
Furthermore, the system is able to learn faster than the other methods from
partially labelled streams.
","[{'version': 'v1', 'created': 'Tue, 12 Apr 2016 01:52:38 GMT'}]",2016-04-13,"[['Ñanculef', 'Ricardo', ''], ['Flaounas', 'Ilias', ''], ['Cristianini', 'Nello', '']]","['Text Classification', 'Data Streams', 'Multi-label Classification', 'FeatureHashing', 'Massive Data Mining']"
10749,1807.07718,Andrey Savchenko,Andrey V. Savchenko,"Efficient Facial Representations for Age, Gender and Identity
  Recognition in Organizing Photo Albums using Multi-output CNN","19 pages, 2 figures, 8 tables",PeerJ Computer Science 5:e197 (2019),10.7717/peerj-cs.197,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is focused on the automatic extraction of persons and their
attributes (gender, year of born) from album of photos and videos. We propose
the two-stage approach, in which, firstly, the convolutional neural network
simultaneously predicts age/gender from all photos and additionally extracts
facial representations suitable for face identification. We modified the
MobileNet, which is preliminarily trained to perform face recognition, in order
to additionally recognize age and gender. In the second stage of our approach,
extracted faces are grouped using hierarchical agglomerative clustering
techniques. The born year and gender of a person in each cluster are estimated
using aggregation of predictions for individual photos. We experimentally
demonstrated that our facial clustering quality is competitive with the
state-of-the-art neural networks, though our implementation is much
computationally cheaper. Moreover, our approach is characterized by more
accurate video-based age/gender recognition when compared to the publicly
available models.
","[{'version': 'v1', 'created': 'Fri, 20 Jul 2018 07:12:36 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Aug 2018 13:28:20 GMT'}, {'version': 'v3', 'created': 'Thu, 13 Jun 2019 07:59:42 GMT'}]",2019-06-18,"[['Savchenko', 'Andrey V.', '']]","['Face identification', 'age and gender recognition', 'face clustering', 'convolutional neural network (CNN)']"
10750,1903.06579,Cl\'ement Dallard,"Cristina Bazgan, Janka Chleb\'ikov\'a, Cl\'ement Dallard, Thomas
  Pontoizeau","Proportionally dense subgraph of maximum size: complexity and
  approximation",,"Discrete Applied Mathematics, Volume 270, 2019, Pages 25-36",10.1016/j.dam.2019.07.010,,cs.CC cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We define a proportionally dense subgraph (PDS) as an induced subgraph of a
graph with the property that each vertex in the PDS is adjacent to
proportionally as many vertices in the subgraph as in the graph. We prove that
the problem of finding a PDS of maximum size is APX-hard on split graphs, and
NP-hard on bipartite graphs. We also show that deciding if a PDS is
inclusion-wise maximal is co-NP-complete on bipartite graphs. Nevertheless, we
present a simple polynomial-time $(2-\frac{2}{\Delta+1})$-approximation
algorithm for the problem, where $\Delta$ is the maximum degree of the graph.
Finally, we show that all Hamiltonian cubic graphs with $n$ vertices (except
two) have a PDS of size $\lfloor \frac{2n+1}{3} \rfloor$, which we prove to be
an upper bound on the size of a PDS in cubic graphs.
","[{'version': 'v1', 'created': 'Fri, 15 Mar 2019 14:42:10 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Apr 2019 14:22:32 GMT'}, {'version': 'v3', 'created': 'Wed, 8 May 2019 10:28:25 GMT'}, {'version': 'v4', 'created': 'Wed, 3 Jul 2019 11:11:51 GMT'}]",2020-06-11,"[['Bazgan', 'Cristina', ''], ['Chlebíková', 'Janka', ''], ['Dallard', 'Clément', ''], ['Pontoizeau', 'Thomas', '']]","['dense subgraph', 'approximation', 'complexity', 'Hamiltonian cubic graphs']"
10751,2001.01837,Jawad Ali,"Jawad Ali, Toqeer Ali, Shahrulniza Musa, Ali Zahrani","Towards Secure IoT Communication with Smart Contracts in a Blockchain
  Infrastructure","9 pages, 4 Figures, 2 tables","International Journal of Advanced Computer Sciences and
  Applications, Volume 9, Issue 10, 2018",10.14569/IJACSA.2018.091070,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  The Internet of Things (IoT) is undergoing rapid growth in the IT industry,
but, it continues to be associated with several security and privacy concerns
as a result of its massive scale, decentralised topology, and
resource-constrained devices. Blockchain (BC), a distributed ledger technology
used in cryptocurrency has attracted significant attention in the realm of IoT
security and privacy. However, adopting BC to IoT is not straightforward in
most cases, due to overheads and delays caused by BC operations. In this paper,
we apply a BC technology known as Hyperledgder Fabric, to an IoT network. This
technology introduces an execute-order technique for transactions that
separates the transaction execution from consensus, resulting in increased
efficiency. We demonstrate that our proposed IoT-BC architecture is
sufficiently secure with regard to fundamental security goals i.e.,
confidentiality, integrity, and availability. Finally, the simulation results
are highlighted that shows the performance overheads associated with our
approach are as minimal as those associated with the Hyperledger Fabric
framework and negligible in terms of security and privacy.
","[{'version': 'v1', 'created': 'Mon, 6 Jan 2020 12:22:23 GMT'}]",2020-01-08,"[['Ali', 'Jawad', ''], ['Ali', 'Toqeer', ''], ['Musa', 'Shahrulniza', ''], ['Zahrani', 'Ali', '']]","['IoT', 'Blockchain Authorization', 'Hyperledger Fabric', 'BC', 'Blockchain Integrity']"
10752,2208.08166,Finn Behrendt,"Finn Behrendt, Debayan Bhattacharya, Julia Kr\""uger, Roland Opfer,
  Alexander Schlaefer","Data-Efficient Vision Transformers for Multi-Label Disease
  Classification on Chest Radiographs",Accepted at CURAC22 Conference,,10.1515/cdbme-2022-0009,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Radiographs are a versatile diagnostic tool for the detection and assessment
of pathologies, for treatment planning or for navigation and localization
purposes in clinical interventions. However, their interpretation and
assessment by radiologists can be tedious and error-prone. Thus, a wide variety
of deep learning methods have been proposed to support radiologists
interpreting radiographs. Mostly, these approaches rely on convolutional neural
networks (CNN) to extract features from images. Especially for the multi-label
classification of pathologies on chest radiographs (Chest X-Rays, CXR), CNNs
have proven to be well suited. On the Contrary, Vision Transformers (ViTs) have
not been applied to this task despite their high classification performance on
generic images and interpretable local saliency maps which could add value to
clinical interventions. ViTs do not rely on convolutions but on patch-based
self-attention and in contrast to CNNs, no prior knowledge of local
connectivity is present. While this leads to increased capacity, ViTs typically
require an excessive amount of training data which represents a hurdle in the
medical domain as high costs are associated with collecting large medical data
sets. In this work, we systematically compare the classification performance of
ViTs and CNNs for different data set sizes and evaluate more data-efficient ViT
variants (DeiT). Our results show that while the performance between ViTs and
CNNs is on par with a small benefit for ViTs, DeiTs outperform the former if a
reasonably large data set is available for training.
","[{'version': 'v1', 'created': 'Wed, 17 Aug 2022 09:07:45 GMT'}]",2022-08-18,"[['Behrendt', 'Finn', ''], ['Bhattacharya', 'Debayan', ''], ['Krüger', 'Julia', ''], ['Opfer', 'Roland', ''], ['Schlaefer', 'Alexander', '']]","['Deep Learning', 'Chest Radiograph', 'Vision Transformer', 'Convolutional Neural Network', 'CheXpert']"
10753,2112.12490,Luca Marzari,"Luca Marzari, Davide Corsi, Enrico Marchesini and Alessandro Farinelli",Curriculum Learning for Safe Mapless Navigation,"8 pages, 5 figures. The poster version of this paper has been
  accepted by The 37th ACM/SIGAPP Symposium on Applied Computing Proceedings
  (SAC IRMAS 2022)",,10.1145/3477314.3507182,,cs.AI cs.LG cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work investigates the effects of Curriculum Learning (CL)-based
approaches on the agent's performance. In particular, we focus on the safety
aspect of robotic mapless navigation, comparing over a standard end-to-end
(E2E) training strategy. To this end, we present a CL approach that leverages
Transfer of Learning (ToL) and fine-tuning in a Unity-based simulation with the
Robotnik Kairos as a robotic agent. For a fair comparison, our evaluation
considers an equal computational demand for every learning approach (i.e., the
same number of interactions and difficulty of the environments) and confirms
that our CL-based method that uses ToL outperforms the E2E methodology. In
particular, we improve the average success rate and the safety of the trained
policy, resulting in 10% fewer collisions in unseen testing scenarios. To
further confirm these results, we employ a formal verification tool to quantify
the number of correct behaviors of Reinforcement Learning policies over desired
specifications.
","[{'version': 'v1', 'created': 'Thu, 23 Dec 2021 12:30:36 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Dec 2021 17:19:40 GMT'}]",2021-12-30,"[['Marzari', 'Luca', ''], ['Corsi', 'Davide', ''], ['Marchesini', 'Enrico', ''], ['Farinelli', 'Alessandro', '']]","['Deep Reinforcement Learning (DRL)', 'Curriculum Learning (CL)', 'Transfer of Learning (ToL)', 'Fine-tuning', 'Mapless Navigation', 'Formal verification']"
10754,2205.11805,Morad Behandish,"George P. Harabin, Morad Behandish",Hybrid Manufacturing Process Planning for Arbitrary Part and Tool Shapes,Special Issue on symposium on Solid and Physical Modeling (SPM'2022),"Journal of Computer-Aided Design, 2022",10.1016/j.cad.2022.103299,103299,cs.CG cs.AI cs.CE cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Hybrid manufacturing (HM) technologies combine additive and subtractive
manufacturing (AM/SM) capabilities in multi-modal process plans that leverage
the strengths of each. Despite the growing interest in HM technologies,
software tools for process planning have not caught up with advances in
hardware and typically impose restrictions that limit the design and
manufacturing engineers' ability to systematically explore the full design and
process planning spaces. We present a general framework for identifying AM/SM
actions that make up an HM process plan based on accessibility and support
requirements, using morphological operations that allow for arbitrary part and
tool geometries to be considered. To take advantage of multi-modality, we
define the actions to allow for temporary excessive material deposition or
removal, with an understanding that subsequent actions can correct for them,
unlike the case in unimodal (AM-only or SM-only) process plans that are
monotonic. We use this framework to generate a combinatorial space of valid,
potentially non-monotonic, process plans for a given part of arbitrary shape, a
collection of AM/SM tools of arbitrary shapes, and a set of relative rotations
(fixed for each action) between them, representing build/fixturing directions
on $3-$axis machines. Finally, we use define a simple objective function
quantifying the cost of materials and operating time in terms of
deposition/removal volumes and use a search algorithm to explore the
exponentially large space of valid process plans to find ""cost-optimal""
solutions. We demonstrate the effectiveness of our method on 3D examples.
","[{'version': 'v1', 'created': 'Tue, 24 May 2022 06:01:22 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Jun 2022 21:46:28 GMT'}]",2022-06-06,"[['Harabin', 'George P.', ''], ['Behandish', 'Morad', '']]","['Hybrid Manufacturing', 'Process Planning', 'Spatial Reasoning', 'Additive Manufacturing', 'Machining']"
10755,1909.06399,Omar Elharrouss,"Omar Elharrouss, Noor Almaadeed, Somaya Al-Maadeed, Younes Akbari",Image inpainting: A review,,,10.1007/s11063-019-10163-0,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although image inpainting, or the art of repairing the old and deteriorated
images, has been around for many years, it has gained even more popularity
because of the recent development in image processing techniques. With the
improvement of image processing tools and the flexibility of digital image
editing, automatic image inpainting has found important applications in
computer vision and has also become an important and challenging topic of
research in image processing. This paper is a brief review of the existing
image inpainting approaches we first present a global vision on the existing
methods for image inpainting. We attempt to collect most of the existing
approaches and classify them into three categories, namely, sequential-based,
CNN-based and GAN-based methods. In addition, for each category, a list of
methods for the different types of distortion on the images is presented.
Furthermore, collect a list of the available datasets and discuss these in our
paper. This is a contribution for digital image inpainting researchers trying
to look for the available datasets because there is a lack of datasets
available for image inpainting. As the final step in this overview, we present
the results of real evaluations of the three categories of image inpainting
methods performed on the datasets used, for the different types of image
distortion. In the end, we also present the evaluations metrics and discuss the
performance of these methods in terms of these metrics. This overview can be
used as a reference for image inpainting researchers, and it can also
facilitate the comparison of the methods as well as the datasets used. The main
contribution of this paper is the presentation of the three categories of image
inpainting methods along with a list of available datasets that the researchers
can use to evaluate their proposed methodology against.
","[{'version': 'v1', 'created': 'Fri, 13 Sep 2019 18:33:38 GMT'}]",2019-12-11,"[['Elharrouss', 'Omar', ''], ['Almaadeed', 'Noor', ''], ['Al-Maadeed', 'Somaya', ''], ['Akbari', 'Younes', '']]","['image inpainting', 'CNN', 'GAN']"
10756,2203.09379,Martin Florian,"Marcel Gregoriadis, Robert Muth, Martin Florian",Analysis of Arbitrary Content on Blockchain-Based Systems using BigQuery,"Accepted at 1st International Cryptoasset Analytics Workshop (CAAW),
  ACM TheWebConf 2022",,10.1145/3487553.3524628,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Blockchain-based systems have gained immense popularity as enablers of
independent asset transfers and smart contract functionality. They have also,
since as early as the first Bitcoin blocks, been used for storing arbitrary
contents such as texts and images. On-chain data storage functionality is
useful for a variety of legitimate use cases. It does, however, also pose a
systematic risk. If abused, for example by posting illegal contents on a public
blockchain, data storage functionality can lead to legal consequences for
operators and users that need to store and distribute the blockchain, thereby
threatening the operational availability of entire blockchain ecosystems. In
this paper, we develop and apply a cloud-based approach for quickly discovering
and classifying content on public blockchains. Our method can be adapted to
different blockchain systems and offers insights into content-related usage
patterns and potential cases of abuse. We apply our method on the two most
prominent public blockchain systems - Bitcoin and Ethereum - and discuss our
results. To the best of our knowledge, the presented study is the first to
systematically analyze non-financial content stored on the Ethereum blockchain
and the first to present a side-by-side comparison between different
blockchains in terms of the quality and quantity of stored data.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2022 15:12:38 GMT'}]",2022-03-18,"[['Gregoriadis', 'Marcel', ''], ['Muth', 'Robert', ''], ['Florian', 'Martin', '']]","['Blockchain', 'Cryptocurrency', 'Ethereum', 'Bitcoin', 'BigQuery']"
10757,2006.01855,Reid McIlroy-Young,"Reid McIlroy-Young and Siddhartha Sen and Jon Kleinberg and Ashton
  Anderson",Aligning Superhuman AI with Human Behavior: Chess as a Model System,"11 pages, 11 figure, Proceedings of the 25th ACM SIGKDD international
  conference on Knowledge discovery and data mining, Virtual 2020",,10.1145/3394486.3403219,,cs.AI cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As artificial intelligence becomes increasingly intelligent---in some cases,
achieving superhuman performance---there is growing potential for humans to
learn from and collaborate with algorithms. However, the ways in which AI
systems approach problems are often different from the ways people do, and thus
may be uninterpretable and hard to learn from. A crucial step in bridging this
gap between human and artificial intelligence is modeling the granular actions
that constitute human behavior, rather than simply matching aggregate human
performance.
  We pursue this goal in a model system with a long history in artificial
intelligence: chess. The aggregate performance of a chess player unfolds as
they make decisions over the course of a game. The hundreds of millions of
games played online by players at every skill level form a rich source of data
in which these decisions, and their exact context, are recorded in minute
detail. Applying existing chess engines to this data, including an open-source
implementation of AlphaZero, we find that they do not predict human moves well.
  We develop and introduce Maia, a customized version of Alpha-Zero trained on
human chess games, that predicts human moves at a much higher accuracy than
existing engines, and can achieve maximum accuracy when predicting decisions
made by players at a specific skill level in a tuneable way. For a dual task of
predicting whether a human will make a large mistake on the next move, we
develop a deep neural network that significantly outperforms competitive
baselines. Taken together, our results suggest that there is substantial
promise in designing artificial intelligence systems with human collaboration
in mind by first accurately modeling granular human decision-making.
","[{'version': 'v1', 'created': 'Tue, 2 Jun 2020 18:12:52 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Jun 2020 17:24:52 GMT'}, {'version': 'v3', 'created': 'Tue, 14 Jul 2020 17:57:37 GMT'}]",2020-07-15,"[['McIlroy-Young', 'Reid', ''], ['Sen', 'Siddhartha', ''], ['Kleinberg', 'Jon', ''], ['Anderson', 'Ashton', '']]","['Human-AI collaboration', 'Action Prediction', 'Chess']"
10758,2109.09530,Stavros Shiaeles Dr,"Christos Constantinides, Stavros Shiaeles, Bogdan Ghita, Nicholas
  Kolokotronis",A Novel Online Incremental Learning Intrusion Prevention System,6 pages,,10.1109/NTMS.2019.8763842,,cs.CR cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Attack vectors are continuously evolving in order to evade Intrusion
Detection systems. Internet of Things (IoT) environments, while beneficial for
the IT ecosystem, suffer from inherent hardware limitations, which restrict
their ability to implement comprehensive security measures and increase their
exposure to vulnerability attacks. This paper proposes a novel Network
Intrusion Prevention System that utilises a SelfOrganizing Incremental Neural
Network along with a Support Vector Machine. Due to its structure, the proposed
system provides a security solution that does not rely on signatures or rules
and is capable to mitigate known and unknown attacks in real-time with high
accuracy. Based on our experimental results with the NSL KDD dataset, the
proposed framework can achieve on-line updated incremental learning, making it
suitable for efficient and scalable industrial applications.
","[{'version': 'v1', 'created': 'Mon, 20 Sep 2021 13:30:11 GMT'}]",2021-09-21,"[['Constantinides', 'Christos', ''], ['Shiaeles', 'Stavros', ''], ['Ghita', 'Bogdan', ''], ['Kolokotronis', 'Nicholas', '']]","['Intrusion Detection', 'Machine Learning', 'Self']"
10759,1906.04403,Claus Aranha,"Icaro Marcelino Miranda, Claus Aranha, Marcelo Ladeira","Classification of EEG Signals using Genetic Programming for Feature
  Construction","9 pages, accepted to the GECCO 2019 conference",,10.1145/3321707.3321737,,cs.NE eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The analysis of electroencephalogram (EEG) waves is of critical importance
for the diagnosis of sleep disorders, such as sleep apnea and insomnia, besides
that, seizures, epilepsy, head injuries, dizziness, headaches and brain tumors.
In this context, one important task is the identification of visible structures
in the EEG signal, such as sleep spindles and K-complexes. The identification
of these structures is usually performed by visual inspection from human
experts, a process that can be error prone and susceptible to biases. Therefore
there is interest in developing technologies for the automated analysis of EEG.
In this paper, we propose a new Genetic Programming (GP) framework for feature
construction and dimensionality reduction from EEG signals. We use these
features to automatically identify spindles and K-complexes on data from the
DREAMS project. Using 5 different classifiers, the set of attributes produced
by GP obtained better AUC scores than those obtained from PCA or the full set
of attributes. Also, the results obtained from the proposed framework obtained
a better balance of Specificity and Recall than other models recently proposed
in the literature. Analysis of the features most used by GP also suggested
improvements for data acquisition protocols in future EEG examinations.
","[{'version': 'v1', 'created': 'Tue, 11 Jun 2019 05:59:32 GMT'}]",2019-06-12,"[['Miranda', 'Icaro Marcelino', ''], ['Aranha', 'Claus', ''], ['Ladeira', 'Marcelo', '']]","['Classification', 'EEG', 'Dimensionality Reduction', 'Feature Construction', 'Feature Selection', 'Genetic Programming', 'K Complex', 'SleepSpindles']"
10760,2012.00428,Jure Brence,Jure Brence and Ljup\v{c}o Todorovski and Sa\v{s}o D\v{z}eroski,Probabilistic Grammars for Equation Discovery,"Submitted to Knowledge-Based Systems, Elsevier. 28 pages + 13 pages
  appendix. 7 figures",,10.1016/j.knosys.2021.107077,,cs.LG cs.FL stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Equation discovery, also known as symbolic regression, is a type of automated
modeling that discovers scientific laws, expressed in the form of equations,
from observed data and expert knowledge. Deterministic grammars, such as
context-free grammars, have been used to limit the search spaces in equation
discovery by providing hard constraints that specify which equations to
consider and which not. In this paper, we propose the use of probabilistic
context-free grammars in equation discovery. Such grammars encode soft
constraints, specifying a prior probability distribution on the space of
possible equations. We show that probabilistic grammars can be used to
elegantly and flexibly formulate the parsimony principle, that favors simpler
equations, through probabilities attached to the rules in the grammars. We
demonstrate that the use of probabilistic, rather than deterministic grammars,
in the context of a Monte-Carlo algorithm for grammar-based equation discovery,
leads to more efficient equation discovery. Finally, by specifying prior
probability distributions over equation spaces, the foundations are laid for
Bayesian approaches to equation discovery.
","[{'version': 'v1', 'created': 'Tue, 1 Dec 2020 11:59:19 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Mar 2021 10:53:27 GMT'}]",2021-04-29,"[['Brence', 'Jure', ''], ['Todorovski', 'Ljupčo', ''], ['Džeroski', 'Sašo', '']]","['equation discovery', 'symbolic regression', 'automated modeling', 'grammar', 'probabilistic context-free grammar', 'Monte-Carlo']"
10761,1912.10293,Raghav Sardana,"Raghav Sardana (1), Rahul Kottath (1 and 2), Vinod Karar (1 and 2),
  Shashi Poddar (1) ((1) CSIR-Central Scientific Instruments Organisation, (2)
  Academy of Scientific & Innovative Research)",Joint Forward-Backward Visual Odometry for Stereo Cameras,Accepted to Advances in Robotics 2019,,10.1145/3352593.3352651,,cs.RO cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visual odometry is a widely used technique in the field of robotics and
automation to keep a track on the location of a robot using visual cues alone.
In this paper, we propose a joint forward backward visual odometry framework by
combining both, the forward motion and backward motion estimated from stereo
cameras. The basic framework of LIBVIOS2 is used here for pose estimation as it
can run in real-time on standard CPUs. The complementary nature of errors in
the forward and backward mode of visual odometry helps in providing a refined
motion estimation upon combining these individual estimates. In addition, two
reliability measures, that is, forward-backward relative pose error and
forward-backward absolute pose error have been proposed for evaluating visual
odometry frameworks on its own without the requirement of any ground truth
data. The proposed scheme is evaluated on the KITTI visual odometry dataset.
The experimental results demonstrate improved accuracy of the proposed scheme
over the traditional odometry pipeline without much increase in the system
overload.
","[{'version': 'v1', 'created': 'Sat, 21 Dec 2019 16:40:01 GMT'}]",2020-02-03,"[['Sardana', 'Raghav', '', '1 and 2'], ['Kottath', 'Rahul', '', '1 and 2'], ['Karar', 'Vinod', '', '1 and 2'], ['Poddar', 'Shashi', '']]","['Visual Odometry', 'Navigation', 'Motion Estimation', 'Joint Forward Backward VO']"
10762,2004.11322,David Benton Dr,David M Benton,"Developing Concurrent Coding: An unconventional encoding scheme applied
  to visible light communications",,"Opt. Eng. 59(4), 046107 (2020)",10.1117/1.OE.59.4.046107,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An unconventional encoding scheme called concurrent coding, has recently been
demonstrated and shown to offer interesting features and benefits in comparison
to conventional techniques, e.g. robustness against burst errors and improved
efficiency of transmitted power. This concept has been demonstrated for the
first time with optical communications where standard light emitting diodes
(LEDs) have been used to transmit information encoded with concurrent coding.
The technique successfully transmits and decodes data despite unpredictable
interruptions to the transmission causing significant drop-outs to the detected
signal. The technique also shows how it is possible to send a single block of
data in isolation with no pre-synchronisation required between transmitter and
receiver, and no specific synchronisation sequence appended to the
transmission. This work also demonstrates for the first time the successful use
of multithreaded (overlaid) concurrent codes
","[{'version': 'v1', 'created': 'Thu, 23 Apr 2020 17:14:39 GMT'}]",2020-06-29,"[['Benton', 'David M', '']]","['Encoding', 'free space optics', 'visible light communication E-mail d.benton@aston.ac']"
10763,1807.08084,Renato J Cintra,"D. F. G. Coelho, R. J. Cintra, A. C. Frery, V. S. Dimitrov","Fast Matrix Inversion and Determinant Computation for Polarimetric
  Synthetic Aperture Radar","7 pages, 1 figure","Computers and Geosciences, no. 119 (2018), pages 109-114",10.1016/j.cageo.2018.07.002,,cs.NA cs.DS eess.SP math.NA stat.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a fast algorithm for simultaneous inversion and
determinant computation of small sized matrices in the context of fully
Polarimetric Synthetic Aperture Radar (PolSAR) image processing and analysis.
The proposed fast algorithm is based on the computation of the adjoint matrix
and the symmetry of the input matrix. The algorithm is implemented in a general
purpose graphical processing unit (GPGPU) and compared to the usual approach
based on Cholesky factorization. The assessment with simulated observations and
data from an actual PolSAR sensor show a speedup factor of about two when
compared to the usual Cholesky factorization. Moreover, the expressions
provided here can be implemented in any platform.
","[{'version': 'v1', 'created': 'Sat, 21 Jul 2018 04:52:06 GMT'}]",2018-07-24,"[['Coelho', 'D. F. G.', ''], ['Cintra', 'R. J.', ''], ['Frery', 'A. C.', ''], ['Dimitrov', 'V. S.', '']]","['PolSAR', 'Matrix inversion', 'Determinant', 'Fast algorithms']"
10764,1904.12039,Elisa Claire Alem\'an Carre\'on,"Elisa Claire Alem\'an Carre\'on, Tetsuro Ito, Hirofumi Nonaka, Minoru
  Kumano, Toru Hiraoka and Masaharu Hirota","Causal relationship between eWOM topics and profit of rural tourism at
  Japanese Roadside Stations ""MICHINOEKI""",,"In Proceedings of the 10th International Conference on Management
  of Emergent Digital EcoSystems (MEDES'18). pp. 212 - 218. Tokyo, Japan.
  September 25-28, 2018",10.1145/3281375.3281395,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Affected by urbanization, centralization and the decrease of overall
population, Japan has been making efforts to revitalize the rural areas across
the country. One particular effort is to increase tourism to these rural areas
via regional branding, using local farm products as tourist attractions across
Japan. Particularly, a program subsidized by the government called Michinoeki,
which stands for 'roadside station', was created 20 years ago and it strives to
provide a safe and comfortable space for cultural interaction between road
travelers and the local community, as well as offering refreshment, and
relevant information to travelers. However, despite its importance in the
revitalization of the Japanese economy, studies with newer technologies and
methodologies are lacking. Using sales data from establishments in the Kyushu
area of Japan, we used Support Vector to classify content from Twitter into
relevant topics and studied their causal relationship to the sales for each
establishment using LiNGAM, a linear non-gaussian acyclic model built for
causal structure analysis, to perform an improved market analysis considering
more than just correlation. Under the hypotheses stated by the LiNGAM model, we
discovered a positive causal relationship between the number of tweets
mentioning those establishments, specially mentioning deserts, a need for
better access and traf^ic options, and a potentially untapped customer base in
motorcycle biker groups.
","[{'version': 'v1', 'created': 'Thu, 25 Apr 2019 07:11:26 GMT'}, {'version': 'v2', 'created': 'Wed, 1 May 2019 05:05:43 GMT'}]",2019-05-02,"[['Carreón', 'Elisa Claire Alemán', ''], ['Ito', 'Tetsuro', ''], ['Nonaka', 'Hirofumi', ''], ['Kumano', 'Minoru', ''], ['Hiraoka', 'Toru', ''], ['Hirota', 'Masaharu', '']]","['Tourism', 'Rural Tourism', 'Entropy', 'Machine Learning', 'Support']"
10765,2004.02569,Jyri Kimari,"Jussi M\""a\""att\""a, Viacheslav Bazaliy, Jyri Kimari, Flyura
  Djurabekova, Kai Nordlund, Teemu Roos","Gradient-Based Training and Pruning of Radial Basis Function Networks
  with an Application in Materials Physics",,"Neural Networks 133, 123 (2021)",10.1016/j.neunet.2020.10.002,,cs.LG cond-mat.mtrl-sci physics.comp-ph stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Many applications, especially in physics and other sciences, call for easily
interpretable and robust machine learning techniques. We propose a fully
gradient-based technique for training radial basis function networks with an
efficient and scalable open-source implementation. We derive novel closed-form
optimization criteria for pruning the models for continuous as well as binary
data which arise in a challenging real-world material physics problem. The
pruned models are optimized to provide compact and interpretable versions of
larger models based on informed assumptions about the data distribution.
Visualizations of the pruned models provide insight into the atomic
configurations that determine atom-level migration processes in solid matter;
these results may inform future research on designing more suitable descriptors
for use with machine learning algorithms.
","[{'version': 'v1', 'created': 'Mon, 6 Apr 2020 11:32:37 GMT'}]",2022-09-30,"[['Määttä', 'Jussi', ''], ['Bazaliy', 'Viacheslav', ''], ['Kimari', 'Jyri', ''], ['Djurabekova', 'Flyura', ''], ['Nordlund', 'Kai', ''], ['Roos', 'Teemu', '']]","['radial basis function networks', 'pruning', 'interpretability', 'materials']"
10766,2008.06266,"Jacob K\""onig","Jacob K\""onig, Mark Jenkins, Mike Mannion, Peter Barrie, Gordon
  Morison",Optimized Deep Encoder-Decoder Methods for Crack Segmentation,Accepted Manuscript at Digital Signal Processing (Elsevier),,10.1016/j.dsp.2020.102907,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Surface crack segmentation poses a challenging computer vision task as
background, shape, colour and size of cracks vary. In this work we propose
optimized deep encoder-decoder methods consisting of a combination of
techniques which yield an increase in crack segmentation performance.
Specifically we propose a decoder-part for an encoder-decoder based deep
learning architecture for semantic segmentation and study its components to
achieve increased performance. We also examine the use of different encoder
strategies and introduce a data augmentation policy to increase the amount of
available training data. The performance evaluation of our method is carried
out on four publicly available crack segmentation datasets. Additionally, we
introduce two techniques into the field of surface crack segmentation,
previously not used there: Generating results using test-time-augmentation and
performing a statistical result analysis over multiple training runs. The
former approach generally yields increased performance results, whereas the
latter allows for more reproducible and better representability of a methods
results. Using those aforementioned strategies with our proposed
encoder-decoder architecture we are able to achieve new state of the art
results in all datasets.
","[{'version': 'v1', 'created': 'Fri, 14 Aug 2020 09:43:43 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Aug 2021 09:57:55 GMT'}]",2021-08-27,"[['König', 'Jacob', ''], ['Jenkins', 'Mark', ''], ['Mannion', 'Mike', ''], ['Barrie', 'Peter', ''], ['Morison', 'Gordon', '']]","['Crack Segmentation', 'Convolutional Neural Network', 'DeepLearning', 'Semantic Segmentation']"
10767,1910.12968,Rokas Jurevi\v{c}ius,"Rokas Jurevi\v{c}ius, Virginijus Marcinkevi\v{c}ius","A data set of aerial imagery from robotics simulator for map-based
  localization systems benchmark","Accepted for publication in International Journal of Intelligent
  Unmanned Systems",,10.1108/IJIUS-12-2018-0035,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose: This paper presents a new dataset of Aerial Imagery from Robotics
simulator (abbr. AIR). AIR dataset aims to provide a starting point for
localization system development and to become a typical benchmark for accuracy
comparison of map-based localization algorithms, visual odometry, and SLAM for
high altitude flights.
  Design/methodology/approach: The presented dataset contains over 100 thousand
aerial images captured from Gazebo robotics simulator using orthophoto maps as
a ground plane. Flights with 3 different trajectories are performed on maps
from urban and forest environment at different altitudes, totaling over 33
kilometers of flight distance.
  Findings: The review of previous researches shows, that the presented dataset
is the largest currently available public dataset with downward facing camera
imagery.
  Originality/value: This paper presents the problem of missing publicly
available datasets for high altitude (100--3000 meters) UAV flights, the
current state-of-the-art researches performed to develop map-based localization
system for UAVs, depend on real-life test flights and custom simulated datasets
for accuracy evaluation of the algorithms. The presented new dataset solves
this problem and aims to help the researchers to improve and benchmark new
algorithms for high-altitude flights.
","[{'version': 'v1', 'created': 'Mon, 28 Oct 2019 20:56:02 GMT'}]",2019-10-30,"[['Jurevičius', 'Rokas', ''], ['Marcinkevičius', 'Virginijus', '']]","['Aerial Imagery', 'Localization', 'Simulated Dataset', 'Visual Odometry', 'ImageProcessing', 'UAV']"
10768,2011.06075,Joseph Friedman,"Wesley H. Brigner, Naimul Hassan, Xuan Hu, Christopher H. Bennett,
  Felipe Garcia-Sanchez, Can Cui, Alvaro Velasquez, Matthew J. Marinella, Jean
  Anne C. Incorvia, Joseph S. Friedman","Domain Wall Leaky Integrate-and-Fire Neurons with Shape-Based
  Configurable Activation Functions",,,10.1109/TED.2022.3159508,,cs.NE cond-mat.mes-hall cs.ET physics.app-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Complementary metal oxide semiconductor (CMOS) devices display volatile
characteristics, and are not well suited for analog applications such as
neuromorphic computing. Spintronic devices, on the other hand, exhibit both
non-volatile and analog features, which are well-suited to neuromorphic
computing. Consequently, these novel devices are at the forefront of
beyond-CMOS artificial intelligence applications. However, a large quantity of
these artificial neuromorphic devices still require the use of CMOS, which
decreases the efficiency of the system. To resolve this, we have previously
proposed a number of artificial neurons and synapses that do not require CMOS
for operation. Although these devices are a significant improvement over
previous renditions, their ability to enable neural network learning and
recognition is limited by their intrinsic activation functions. This work
proposes modifications to these spintronic neurons that enable configuration of
the activation functions through control of the shape of a magnetic domain wall
track. Linear and sigmoidal activation functions are demonstrated in this work,
which can be extended through a similar approach to enable a wide variety of
activation functions.
","[{'version': 'v1', 'created': 'Wed, 11 Nov 2020 21:07:02 GMT'}]",2022-04-04,"[['Brigner', 'Wesley H.', ''], ['Hassan', 'Naimul', ''], ['Hu', 'Xuan', ''], ['Bennett', 'Christopher H.', ''], ['Garcia-Sanchez', 'Felipe', ''], ['Cui', 'Can', ''], ['Velasquez', 'Alvaro', ''], ['Marinella', 'Matthew J.', ''], ['Incorvia', 'Jean Anne C.', ''], ['Friedman', 'Joseph S.', '']]","['Artificial neural network', 'Neuromorphic computing', 'Leaky integrate-and-fire neuron', 'Multilayer perceptron']"
10769,2212.07179,Ahnaf Lodhi,"Ahnaf Hannan Lodhi, Bar{\i}\c{s} Akg\""un, \""Oznur \""Ozkasap","FLAGS Framework for Comparative Analysis of Federated Learning
  Algorithms","39 pages, 10 figures. Accepted for publication in Elsevier 'Internet
  of Things'","Internet of Things Volume 20, November 2022, 100638",10.1016/j.iot.2022.100638,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Federated Learning (FL) has become a key choice for distributed machine
learning. Initially focused on centralized aggregation, recent works in FL have
emphasized greater decentralization to adapt to the highly heterogeneous
network edge. Among these, Hierarchical, Device-to-Device and Gossip Federated
Learning (HFL, D2DFL \& GFL respectively) can be considered as foundational FL
algorithms employing fundamental aggregation strategies. A number of FL
algorithms were subsequently proposed employing multiple fundamental
aggregation schemes jointly. Existing research, however, subjects the FL
algorithms to varied conditions and gauges the performance of these algorithms
mainly against Federated Averaging (FedAvg) only. This work consolidates the FL
landscape and offers an objective analysis of the major FL algorithms through a
comprehensive cross-evaluation for a wide range of operating conditions. In
addition to the three foundational FL algorithms, this work also analyzes six
derived algorithms. To enable a uniform assessment, a multi-FL framework named
FLAGS: Federated Learning AlGorithms Simulation has been developed for rapid
configuration of multiple FL algorithms. Our experiments indicate that fully
decentralized FL algorithms achieve comparable accuracy under multiple
operating conditions, including asynchronous aggregation and the presence of
stragglers. Furthermore, decentralized FL can also operate in noisy
environments and with a comparably higher local update rate. However, the
impact of extremely skewed data distributions on decentralized FL is much more
adverse than on centralized variants. The results indicate that it may not be
necessary to restrict the devices to a single FL algorithm; rather, multi-FL
nodes may operate with greater efficiency.
","[{'version': 'v1', 'created': 'Wed, 14 Dec 2022 12:08:30 GMT'}]",2022-12-15,"[['Lodhi', 'Ahnaf Hannan', ''], ['Akgün', 'Barış', ''], ['Özkasap', 'Öznur', '']]","['Federated Learning', 'Hierarchical', 'Device-to-Device (D2D)', 'Gossip', 'Cluster', 'Framework']"
10770,2003.01061,Xiangyu Y Hu,Zhe Ji and Lin Fu and Xiangyu Hu and Nikolaus Adams,A Feature-aware SPH for Isotropic Unstructured Mesh Generation,54 pages and 22 figures,,10.1016/j.cma.2020.113634,,cs.GR physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a feature-aware SPH method for the concurrent and
automated isotropic unstructured mesh generation. Two additional objectives are
achieved with the proposed method compared to the original SPH-based mesh
generator (Fu et al., 2019). First, a feature boundary correction term is
introduced to address the issue of incomplete kernel support at the boundary
vicinity. The mesh generation of feature curves, feature surfaces and volumes
can be handled concurrently without explicitly following a dimensional
sequence. Second, a two-phase model is proposed to characterize the
mesh-generation procedure by a feature-size-adaptation phase and a
mesh-quality-optimization phase. By proposing a new error measurement criterion
and an adaptive control system with two sets of simulation parameters, the
objectives of faster feature-size adaptation and local mesh-quality improvement
are merged into a consistent framework. The proposed method is validated with a
set of 2D and 3D numerical tests with different complexities and scales. The
results demonstrate that high-quality meshes are generated with a significant
speedup of convergence.
","[{'version': 'v1', 'created': 'Thu, 27 Feb 2020 13:35:07 GMT'}]",2021-02-03,"[['Ji', 'Zhe', ''], ['Fu', 'Lin', ''], ['Hu', 'Xiangyu', ''], ['Adams', 'Nikolaus', '']]","['Unstructured Mesh', 'Smoothing Particle Hydrodynamics', 'Delaunay']"
10771,2110.15552,Yixuan Ma,"Yixuan Ma, Shuang Liu, Jiajun Jiang, Guanhong Chen, Keqiu Li","A Comprehensive Study on Learning-Based PE Malware Family Classification
  Methods","12 pages, 3 figures, conference",,10.1145/3468264.3473925,,cs.CR cs.LG cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Driven by the high profit, Portable Executable (PE) malware has been
consistently evolving in terms of both volume and sophistication. PE malware
family classification has gained great attention and a large number of
approaches have been proposed. With the rapid development of machine learning
techniques and the exciting results they achieved on various tasks, machine
learning algorithms have also gained popularity in the PE malware family
classification task. Three mainstream approaches that use learning based
algorithms, as categorized by the input format the methods take, are
image-based, binary-based and disassembly-based approaches. Although a large
number of approaches are published, there is no consistent comparisons on those
approaches, especially from the practical industry adoption perspective.
Moreover, there is no comparison in the scenario of concept drift, which is a
fact for the malware classification task due to the fast evolving nature of
malware. In this work, we conduct a thorough empirical study on learning-based
PE malware classification approaches on 4 different datasets and consistent
experiment settings. Based on the experiment results and an interview with our
industry partners, we find that (1) there is no individual class of methods
that significantly outperforms the others; (2) All classes of methods show
performance degradation on concept drift (by an average F1-score of 32.23%);
and (3) the prediction time and high memory consumption hinder existing
approaches from being adopted for industry usage.
","[{'version': 'v1', 'created': 'Fri, 29 Oct 2021 05:32:28 GMT'}]",2021-11-01,"[['Ma', 'Yixuan', ''], ['Liu', 'Shuang', ''], ['Jiang', 'Jiajun', ''], ['Chen', 'Guanhong', ''], ['Li', 'Keqiu', '']]","['Malware Classification', 'Deep Learning', 'Concept Drift']"
10772,2110.12377,Haoyi Xiong,"Kafeng Wang and Haoyi Xiong and Jie Zhang and Hongyang Chen and Dejing
  Dou and Cheng-Zhong Xu","SenseMag: Enabling Low-Cost Traffic Monitoring using Non-invasive
  Magnetic Sensing",Accepted by IEEE Internet of Things Journal,,10.1109/JIOT.2021.3074907,,cs.LG eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The operation and management of intelligent transportation systems (ITS),
such as traffic monitoring, relies on real-time data aggregation of vehicular
traffic information, including vehicular types (e.g., cars, trucks, and buses),
in the critical roads and highways. While traditional approaches based on
vehicular-embedded GPS sensors or camera networks would either invade drivers'
privacy or require high deployment cost, this paper introduces a low-cost
method, namely SenseMag, to recognize the vehicular type using a pair of
non-invasive magnetic sensors deployed on the straight road section. SenseMag
filters out noises and segments received magnetic signals by the exact time
points that the vehicle arrives or departs from every sensor node. Further,
SenseMag adopts a hierarchical recognition model to first estimate the
speed/velocity, then identify the length of vehicle using the predicted speed,
sampling cycles, and the distance between the sensor nodes. With the vehicle
length identified and the temporal/spectral features extracted from the
magnetic signals, SenseMag classify the types of vehicles accordingly. Some
semi-automated learning techniques have been adopted for the design of filters,
features, and the choice of hyper-parameters. Extensive experiment based on
real-word field deployment (on the highways in Shenzhen, China) shows that
SenseMag significantly outperforms the existing methods in both classification
accuracy and the granularity of vehicle types (i.e., 7 types by SenseMag versus
4 types by the existing work in comparisons). To be specific, our field
experiment results validate that SenseMag is with at least $90\%$ vehicle type
classification accuracy and less than 5\% vehicle length classification error.
","[{'version': 'v1', 'created': 'Sun, 24 Oct 2021 07:47:43 GMT'}]",2021-10-26,"[['Wang', 'Kafeng', ''], ['Xiong', 'Haoyi', ''], ['Zhang', 'Jie', ''], ['Chen', 'Hongyang', ''], ['Dou', 'Dejing', ''], ['Xu', 'Cheng-Zhong', '']]","['Magnetic Sensing', 'Traffic Monitoring', 'VehicleType Classification', 'Internet of Vehicles (IoV)']"
10773,1910.06691,Lisa Hug,"Lisa Hug, Stefan Kollmannsberger, Zohar Yosibash, Ernst Rank",A 3D benchmark problem for crack propagation in brittle fracture,,,10.1016/j.cma.2020.112905,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a full 3D benchmark problem for brittle fracture based on
experiments as well as a validation in the context of phase-field models. The
example consists of a series of four-point bending tests on graphite specimens
with sharp V-notches at different inclination angles. This simple setup leads
to a mixed mode (I + II + III) loading which results in complex yet stably
reproducible crack surfaces. The proposed problem is well suited for
benchmarking numerical methods for brittle fracture and allows for a
quantitative comparison of failure loads and propagation paths as well as
initiation angles and the fracture surface. For evaluation of the crack
surfaces image-based 3D models of the fractured specimen are provided along
with experimental and numerical results. In addition, measured failure loads
and computed load-displacement curves are given. To demonstrate the
applicability of the benchmark problem, we show that for a phase-field model
based on the Finite Cell Method and multi-level hp-refinement the complex crack
surface as well as the failure loads can be well reproduced.
","[{'version': 'v1', 'created': 'Tue, 15 Oct 2019 12:54:12 GMT'}]",2020-04-22,"[['Hug', 'Lisa', ''], ['Kollmannsberger', 'Stefan', ''], ['Yosibash', 'Zohar', ''], ['Rank', 'Ernst', '']]","['Brittle fracture', 'benchmark', 'verification and validation', 'phase-field modeling', 'multi-levelhp-adaptivity', 'Finite Cell Method']"
10774,2007.10066,"Ga\""el \'Ecorchard","Ga\""el \'Ecorchard and Karel Ko\v{s}nar and Libor P\v{r}eu\v{c}il",Wearable camera-based human absolute localization in large warehouses,"Conference paper presented at Twelfth International Conference on
  Machine Vision, 2019","Twelfth International Conference on Machine Vision, 2019",10.1117/12.2559424,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a robotised warehouse, as in any place where robots move autonomously, a
major issue is the localization or detection of human operators during their
intervention in the work area of the robots. This paper introduces a wearable
human localization system for large warehouses, which utilize preinstalled
infrastructure used for localization of automated guided vehicles (AGVs). A
monocular down-looking camera is detecting ground nodes, identifying them and
computing the absolute position of the human to allow safe cooperation and
coexistence of humans and AGVs in the same workspace. A virtual safety area
around the human operator is set up and any AGV in this area is immediately
stopped. In order to avoid triggering an emergency stop because of the short
distance between robots and human operators, the trajectories of the robots
have to be modified so that they do not interfere with the human. The purpose
of this paper is to demonstrate an absolute visual localization method working
in the challenging environment of an automated warehouse with low intensity of
light, massively changing environment and using solely monocular camera placed
on the human body.
","[{'version': 'v1', 'created': 'Mon, 20 Jul 2020 12:57:37 GMT'}]",2020-07-21,"[['Écorchard', 'Gaël', ''], ['Košnar', 'Karel', ''], ['Přeučil', 'Libor', '']]","['Human Localization', 'Camera-based Localization', 'Warehouse Systems']"
10775,1910.10484,Carl Nordlund,Carl Nordlund,"Direct blockmodeling of valued and binary networks: a
  dichotomization-free approach",,,10.1016/j.socnet.2019.10.004,,cs.SI physics.soc-ph stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A long-standing open problem with direct blockmodeling is that it is
explicitly intended for binary, not valued, networks. The underlying dilemma is
how empirical valued blocks can be compared with ideal binary blocks, an
intrinsic problem in the direct approach where partitions are solely determined
through such comparisons. Addressing this dilemma, valued networks have either
been dichotomized into binary versions, or novel types of ideal valued blocks
have been introduced. Both these workarounds are problematic in terms of
interpretability, unwanted data reduction, and the often arbitrary setting of
model parameters.
  This paper proposes a direct blockmodeling approach that effectively bypasses
the dilemma with blockmodeling of valued networks. By introducing an adaptive
weighted correlation-based criteria function, the proposed approach is directly
applicable to both binary and valued networks, without any form of
dichotomization or transformation of the valued (or binary) data at any point
in the analysis, while still using the conventional set of ideal binary blocks
from structural, regular and generalized blockmodeling.
  The approach is demonstrated by structural, regular and generalized
blockmodeling applications of six classical binary and valued networks. Finding
feasible and intuitive optimal solutions in both the binary and valued
examples, the approach is proposed not only as a practical,
dichotomization-free heuristic for blockmodeling of valued networks but also,
through its additional benefits, as an alternative to the conventional direct
approach to blockmodeling.
","[{'version': 'v1', 'created': 'Fri, 18 Oct 2019 13:30:32 GMT'}]",2020-01-28,"[['Nordlund', 'Carl', '']]","['Blockmodeling', 'Valued networks', 'Goodness-of-fit functions', 'Weighted correlation coefficient', 'Dichotomization']"
10776,2103.08590,Adrianna Janik,"Adrianna Janik, Jonathan Dodd, Georgiana Ifrim, Kris Sankaran,
  Kathleen Curran","Interpretability of a Deep Learning Model in the Application of Cardiac
  MRI Segmentation with an ACDC Challenge Dataset",,,10.1117/12.2582227,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Cardiac Magnetic Resonance (CMR) is the most effective tool for the
assessment and diagnosis of a heart condition, which malfunction is the world's
leading cause of death. Software tools leveraging Artificial Intelligence
already enhance radiologists and cardiologists in heart condition assessment
but their lack of transparency is a problem. This project investigates if it is
possible to discover concepts representative for different cardiac conditions
from the deep network trained to segment crdiac structures: Left Ventricle
(LV), Right Ventricle (RV) and Myocardium (MYO), using explainability methods
that enhances classification system by providing the score-based values of
qualitative concepts, along with the key performance metrics. With introduction
of a need of explanations in GDPR explainability of AI systems is necessary.
This study applies Discovering and Testing with Concept Activation Vectors
(D-TCAV), an interpretaibilty method to extract underlying features important
for cardiac disease diagnosis from MRI data. The method provides a quantitative
notion of concept importance for disease classified. In previous studies, the
base method is applied to the classification of cardiac disease and provides
clinically meaningful explanations for the predictions of a black-box deep
learning classifier. This study applies a method extending TCAV with a
Discovering phase (D-TCAV) to cardiac MRI analysis. The advantage of the D-TCAV
method over the base method is that it is user-independent. The contribution of
this study is a novel application of the explainability method D-TCAV for
cardiac MRI anlysis. D-TCAV provides a shorter pre-processing time for
clinicians than the base method.
","[{'version': 'v1', 'created': 'Mon, 15 Mar 2021 17:57:40 GMT'}]",2021-03-16,"[['Janik', 'Adrianna', ''], ['Dodd', 'Jonathan', ''], ['Ifrim', 'Georgiana', ''], ['Sankaran', 'Kris', ''], ['Curran', 'Kathleen', '']]","['explainable ML', 'semantic segmentation', 'deep learning']"
10777,2207.02522,David Rau,"David Rau, Jaap Kamps",The Role of Complex NLP in Transformers for Text Ranking?,"Proceedings of the 2022 ACM SIGIR International Conference on the
  Theory of Information Retrieval (ICTIR '22)",,10.1145/3539813.3545144,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Even though term-based methods such as BM25 provide strong baselines in
ranking, under certain conditions they are dominated by large pre-trained
masked language models (MLMs) such as BERT. To date, the source of their
effectiveness remains unclear. Is it their ability to truly understand the
meaning through modeling syntactic aspects? We answer this by manipulating the
input order and position information in a way that destroys the natural
sequence order of query and passage and shows that the model still achieves
comparable performance. Overall, our results highlight that syntactic aspects
do not play a critical role in the effectiveness of re-ranking with BERT. We
point to other mechanisms such as query-passage cross-attention and richer
embeddings that capture word meanings based on aggregated context regardless of
the word order for being the main attributions for its superior performance.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2022 08:54:18 GMT'}]",2022-07-07,"[['Rau', 'David', ''], ['Kamps', 'Jaap', '']]","['NLP in Ranking', 'Analysis', 'Neural Re-Ranking', 'Transformers', 'Neural Bag-of-Words']"
10778,2202.13200,Wen-Jie Tseng,"Wen-Jie Tseng, Elise Bonnail, Mark McGill, Mohamed Khamis, Eric
  Lecolinet, Samuel Huron and Jan Gugenheimer",The Dark Side of Perceptual Manipulations in Virtual Reality,"15 pages, 7 figures",,10.1145/3491102.3517728,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  ""Virtual-Physical Perceptual Manipulations"" (VPPMs) such as redirected
walking and haptics expand the user's capacity to interact with Virtual Reality
(VR) beyond what would ordinarily physically be possible. VPPMs leverage
knowledge of the limits of human perception to effect changes in the user's
physical movements, becoming able to (perceptibly and imperceptibly) nudge
their physical actions to enhance interactivity in VR. We explore the risks
posed by the malicious use of VPPMs. First, we define, conceptualize and
demonstrate the existence of VPPMs. Next, using speculative design workshops,
we explore and characterize the threats/risks posed, proposing mitigations and
preventative recommendations against the malicious use of VPPMs. Finally, we
implement two sample applications to demonstrate how existing VPPMs could be
trivially subverted to create the potential for physical harm. This paper aims
to raise awareness that the current way we apply and publish VPPMs can lead to
malicious exploits of our perceptual vulnerabilities.
","[{'version': 'v1', 'created': 'Sat, 26 Feb 2022 17:45:34 GMT'}]",2022-03-01,"[['Tseng', 'Wen-Jie', ''], ['Bonnail', 'Elise', ''], ['McGill', 'Mark', ''], ['Khamis', 'Mohamed', ''], ['Lecolinet', 'Eric', ''], ['Huron', 'Samuel', ''], ['Gugenheimer', 'Jan', '']]","['virtual-physical perceptual manipulation', 'VPPM', 'physical harm', 'VR security']"
10779,2008.03892,Juan Quiroz,"Juan C. Quiroz, Tristan Bongolan, Kiran Ijaz","Alexa Depression and Anxiety Self-tests: A Preliminary Analysis of User
  Experience and Trust",Mental Health Sensing & Intervention Workshop - UbiComp 2020,,10.1145/3410530.3414374,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mental health resources available via websites and mobile apps provide
support such as advice, journaling, and elements from cognitive behavioral
therapy. The proliferation of spoken conversational agents, such as Alexa,
Siri, and Google Home, has led to an increasing interest in developing mental
health apps for these devices. We present the pilot study outcomes of an Alexa
Skill that allows users to conduct depression and anxiety self-tests. Ten
participants were given access to the Alexa Skill for two-weeks, followed by an
online evaluation of the Skill's usability and trust. Our preliminary
evaluation suggests that participants trusted the Skill and scored the
usability and user experience as average. Usage of the Skill was low, with most
participants using the Skill only once. In view of work-in-progress, we also
present a discussion of implementation and study design challenges to guide the
current literature on designing spoken conversational agents for mental health
applications.
","[{'version': 'v1', 'created': 'Mon, 10 Aug 2020 04:12:40 GMT'}]",2020-08-11,"[['Quiroz', 'Juan C.', ''], ['Bongolan', 'Tristan', ''], ['Ijaz', 'Kiran', '']]","['mental health', 'conversational agent', 'depression', 'anxiety', 'Alexa']"
10780,1602.07199,Taha Yasseri,"Aslak Wegner Eide, J. Brian Pickering, Taha Yasseri, George Bravos,
  Asbj{\o}rn F{\o}lstad, Vegard Engen, Milena Tsvetkova, Eric T. Meyer, Paul
  Walland, Marika L\""uders",Human-Machine Networks: Towards a Typology and Profiling Framework,"Pre-print; To be presented at the 18th International Conference on
  Human-Computer Interaction International, Toronto, Canada, 17 - 22 July 2016",,10.1007/978-3-319-39510-4_2,,cs.HC cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we outline an initial typology and framework for the purpose of
profiling human-machine networks, that is, collective structures where humans
and machines interact to produce synergistic effects. Profiling a human-machine
network along the dimensions of the typology is intended to facilitate access
to relevant design knowledge and experience. In this way the profiling of an
envisioned or existing human-machine network will both facilitate relevant
design discussions and, more importantly, serve to identify the network type.
We present experiences and results from two case trials: a crisis management
system and a peer-to-peer reselling network. Based on the lessons learnt from
the case trials we suggest potential benefits and challenges, and point out
needed future work.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2016 15:34:59 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Mar 2016 16:48:20 GMT'}]",2023-01-05,"[['Eide', 'Aslak Wegner', ''], ['Pickering', 'J. Brian', ''], ['Yasseri', 'Taha', ''], ['Bravos', 'George', ''], ['Følstad', 'Asbjørn', ''], ['Engen', 'Vegard', ''], ['Tsvetkova', 'Milena', ''], ['Meyer', 'Eric T.', ''], ['Walland', 'Paul', ''], ['Lüders', 'Marika', '']]","['human-machine networks', 'typology', 'network profiling', 'humancentred design', 'case trials', 'human-computer interaction']"
10781,1809.05822,Wenhui Yu,"Wenhui Yu, Huidi Zhang, Xiangnan He, Xu Chen, Li Xiong, Zheng Qin",Aesthetic-based Clothing Recommendation,WWW 2018,,10.1145/3178876.3186146,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, product images have gained increasing attention in clothing
recommendation since the visual appearance of clothing products has a
significant impact on consumers' decision. Most existing methods rely on
conventional features to represent an image, such as the visual features
extracted by convolutional neural networks (CNN features) and the
scale-invariant feature transform algorithm (SIFT features), color histograms,
and so on. Nevertheless, one important type of features, the \emph{aesthetic
features}, is seldom considered. It plays a vital role in clothing
recommendation since a users' decision depends largely on whether the clothing
is in line with her aesthetics, however the conventional image features cannot
portray this directly. To bridge this gap, we propose to introduce the
aesthetic information, which is highly relevant with user preference, into
clothing recommender systems. To achieve this, we first present the aesthetic
features extracted by a pre-trained neural network, which is a brain-inspired
deep structure trained for the aesthetic assessment task. Considering that the
aesthetic preference varies significantly from user to user and by time, we
then propose a new tensor factorization model to incorporate the aesthetic
features in a personalized manner. We conduct extensive experiments on
real-world datasets, which demonstrate that our approach can capture the
aesthetic preference of users and significantly outperform several
state-of-the-art recommendation methods.
","[{'version': 'v1', 'created': 'Sun, 16 Sep 2018 06:20:36 GMT'}]",2018-09-18,"[['Yu', 'Wenhui', ''], ['Zhang', 'Huidi', ''], ['He', 'Xiangnan', ''], ['Chen', 'Xu', ''], ['Xiong', 'Li', ''], ['Qin', 'Zheng', '']]","['Clothing recommendation', 'side information', 'aesthetic features', 'tensor factorization', 'dynamic collaborative filtering']"
10782,2106.01343,Toni Mancini,Stefano Sinisi and Vadim Alimguzhin and Toni Mancini and Enrico Tronci,"Reconciling interoperability with efficient Verification and Validation
  within open source simulation environments",Abridged abstract. This article is 29 pages long,"Simulation Modelling Practice and Theory, 109, 102277 (2021)",10.1016/j.simpat.2021.102277,,cs.SE cs.SY eess.SY q-bio.QM,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A Cyber-Physical System (CPS) comprises physical as well as software
subsystems. Simulation-based approaches are typically used to support design
and Verification and Validation (V&V) of CPSs in several domains such as:
aerospace, defence, automotive, smart grid and healthcare. Accordingly, many
simulation-based tools are available, and this poses huge interoperability
challenges. To overcome them, in 2010 the Functional Mock-up Interface (FMI)
was proposed as an open standard to support both Model Exchange (ME) and
Co-Simulation (CS). Models adhering to such a standard are called Functional
Mock-up Units (FMUs). FMUs play an essential role in defining complex CPSs
through, e.g., the SSP standard. Simulation-based V&V of CPSs typically
requires exploring different scenarios (i.e., exogenous CPS input sequences),
many of them showing a shared prefix. Accordingly, the simulator state at the
end of a shared prefix is saved and then restored and used as a start state for
the simulation of the next scenario. In this context, an important FMI feature
is the capability to save and restore the internal FMU state on demand.
Unfortunately, the implementation of this feature is not mandatory and it is
available only within some commercial software. This motivates developing such
a feature for open-source CPS simulation environments. In this paper, we focus
on JModelica, an open-source modelling and simulation environment for CPSs
defined in the Modelica language. We describe how we have endowed JModelica
with our open-source implementation of the FMI 2.0 functions to save and
restore internal states of FMUs for ME. Furthermore, we present results
evaluating, through 934 benchmark models, correctness and efficiency of our
extended JModelica. Our results show that simulation-based V&V is, on average,
22 times faster with our get/set functionality than without it.
","[{'version': 'v1', 'created': 'Tue, 1 Jun 2021 00:20:59 GMT'}]",2021-06-03,"[['Sinisi', 'Stefano', ''], ['Alimguzhin', 'Vadim', ''], ['Mancini', 'Toni', ''], ['Tronci', 'Enrico', '']]","['Simulation', 'Verification and Validation', 'Interoperability', 'FMI/FMU', 'Model Exchange', 'Cyber-Physical Systems']"
10783,2103.13527,Francesco Osborne,"Angelo A. Salatino, Francesco Osborne, Aliaksandr Birukou and Enrico
  Motta",Improving Editorial Workflow and Metadata Quality at Springer Nature,"In: The Semantic Web - ISWC 2019. Lecture Notes in Computer Science,
  vol 11779. Springer, Cham",,10.1007/978-3-030-30796-7_31,,cs.DL cs.AI cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Identifying the research topics that best describe the scope of a scientific
publication is a crucial task for editors, in particular because the quality of
these annotations determine how effectively users are able to discover the
right content in online libraries. For this reason, Springer Nature, the
world's largest academic book publisher, has traditionally entrusted this task
to their most expert editors. These editors manually analyse all new books,
possibly including hundreds of chapters, and produce a list of the most
relevant topics. Hence, this process has traditionally been very expensive,
time-consuming, and confined to a few senior editors. For these reasons, back
in 2016 we developed Smart Topic Miner (STM), an ontology-driven application
that assists the Springer Nature editorial team in annotating the volumes of
all books covering conference proceedings in Computer Science. Since then STM
has been regularly used by editors in Germany, China, Brazil, India, and Japan,
for a total of about 800 volumes per year. Over the past three years the
initial prototype has iteratively evolved in response to feedback from the
users and evolving requirements. In this paper we present the most recent
version of the tool and describe the evolution of the system over the years,
the key lessons learnt, and the impact on the Springer Nature workflow. In
particular, our solution has drastically reduced the time needed to annotate
proceedings and significantly improved their discoverability, resulting in 9.3
million additional downloads. We also present a user study involving 9 editors,
which yielded excellent results in term of usability, and report an evaluation
of the new topic classifier used by STM, which outperforms previous versions in
recall and F-measure.
","[{'version': 'v1', 'created': 'Wed, 24 Mar 2021 23:23:59 GMT'}]",2021-03-26,"[['Salatino', 'Angelo A.', ''], ['Osborne', 'Francesco', ''], ['Birukou', 'Aliaksandr', ''], ['Motta', 'Enrico', '']]","['Scholarly Data', 'Bibliographic Metadata', 'Topic Classification', 'Topic Detection', 'Scholarly Ontologies', 'Data Mining']"
10784,2008.00993,Wenceslao Arroyo-Machado,"Ana Gallego-Cui\~nas, Esteban Romero-Fr\'ias, Wenceslao Arroyo-Machado","Independent publishers and social networks in the 21st century: the
  balance of power in the transatlantic Spanish-language book market",,,10.1108/OIR-10-2019-0342,,cs.SI cs.DL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The present paper uses Twitter to analyze the current state of the worldwide,
Spanish-language, independent publishing market. The main purposes are to
determine whether certain Latin American Spanish-language independent
publishers function as gatekeepers of World Literature and to analyze the
geopolitical structure of this global market, addressing both the
Europe-America dialectic and neocolonial practices. After selecting the sample
of publishers, we conducted a search for their Twitter profiles and located
131; we then downloaded data from the corresponding Twitter APIs. Finally, we
applied social network analysis to study the presence of and interaction
between our sample of independent publishers on this social media. Our results
provide data-based evidence supporting the hypothesis of some literary critics
who suggest that in Latin America, certain publishers act as gatekeepers to the
mainstream book market. Therefore, Twitter could be considered a valid source
of information to address the independent book market in Spanish. By extension,
this approach could be applied to other cultural industries in which small and
medium-sized agents develop a digital presence in social media. This paper
combines social network analysis and literary criticism to provide new evidence
about the Spanish-language book market. It helps validate the aforementioned
hypothesis, proposed by literary critics, and opens up new paths along which to
pursue an interpretative, comparative analysis.
","[{'version': 'v1', 'created': 'Mon, 3 Aug 2020 16:26:03 GMT'}]",2020-08-04,"[['Gallego-Cuiñas', 'Ana', ''], ['Romero-Frías', 'Esteban', ''], ['Arroyo-Machado', 'Wenceslao', '']]","['\u200b decolonial studies', 'digital humanities', 'independent publishers', 'social network analysis', 'Twitter', 'transatlantic studies']"
10785,2203.07980,Georg Hess,"Georg Hess, Christoffer Petersson, Lennart Svensson",Object Detection as Probabilistic Set Prediction,,European Conference on Computer Vision (ECCV). (2022) 550-566,10.1007/978-3-031-20080-9_32,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Accurate uncertainty estimates are essential for deploying deep object
detectors in safety-critical systems. The development and evaluation of
probabilistic object detectors have been hindered by shortcomings in existing
performance measures, which tend to involve arbitrary thresholds or limit the
detector's choice of distributions. In this work, we propose to view object
detection as a set prediction task where detectors predict the distribution
over the set of objects. Using the negative log-likelihood for random finite
sets, we present a proper scoring rule for evaluating and training
probabilistic object detectors. The proposed method can be applied to existing
probabilistic detectors, is free from thresholds, and enables fair comparison
between architectures. Three different types of detectors are evaluated on the
COCO dataset. Our results indicate that the training of existing detectors is
optimized toward non-probabilistic metrics. We hope to encourage the
development of new object detectors that can accurately estimate their own
uncertainty. Code available at https://github.com/georghess/pmb-nll.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2022 15:13:52 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Mar 2022 15:54:13 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Jul 2022 17:10:35 GMT'}]",2022-12-09,"[['Hess', 'Georg', ''], ['Petersson', 'Christoffer', ''], ['Svensson', 'Lennart', '']]","['Probabilistic object detection', 'random finite sets', 'properscoring rules', 'uncertainty estimation']"
10786,2112.11931,Attila Makai,Attila Lajos Makai,Startup Ecosystem Rankings,,"HUNGARIAN STATISTICAL REVIEW: JOURNAL OF THE HUNGARIAN CENTRAL
  STATISTICAL OFFICE 4 : 2 pp. 70-94. , 25 p. (2021)",10.35618/hsr2021.02.en070,,cs.DL econ.GN q-fin.EC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The number, importance, and popularity of rankings measuring innovation
performance and the strength and resources of ecosystems that provide its
spatial framework are on an increasing trend globally. In addition to
influencing the specific decisions taken by economic actors, these rankings
significantly impact the development of innovation-related policies at
regional, national, and international levels. The importance of startup
ecosystems is proven by the growing scientific interest, which is demonstrated
by the increasing number of related scientific articles. The concept of the
startup ecosystem is a relatively new category, the application of which in
everyday and scientific life has been gaining ground since the end of the
2000s. In parallel, of course, the demand for measurability and comparability
has emerged among decision-makers and scholars. This demand is met by startup
ecosystem rankings, which now measure and rank the performance of individual
ecosystems on a continental and global scale. However, while the number of
scientific publications examining rankings related to higher education,
economic performance, or even innovation, can be measured in the order of
thousands, scientific research has so far rarely or tangentially addressed the
rankings of startup ecosystems. This study and the related research intend to
fill this gap by presenting and analysing the characteristics of global
rankings and identifying possible future research directions.
","[{'version': 'v1', 'created': 'Tue, 21 Dec 2021 17:22:19 GMT'}]",2021-12-23,"[['Makai', 'Attila Lajos', '']]","['rankings', 'startup ecosystem', 'innovation indicator']"
10787,2212.00492,Maria Maistro,"Maria Maistro, Lucas Chaves Lima, Jakob Grue Simonsen, Christina Lioma",Principled Multi-Aspect Evaluation Measures of Rankings,,,10.1145/3459637.3482287,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Information Retrieval evaluation has traditionally focused on defining
principled ways of assessing the relevance of a ranked list of documents with
respect to a query. Several methods extend this type of evaluation beyond
relevance, making it possible to evaluate different aspects of a document
ranking (e.g., relevance, usefulness, or credibility) using a single measure
(multi-aspect evaluation). However, these methods either are (i) tailor-made
for specific aspects and do not extend to other types or numbers of aspects, or
(ii) have theoretical anomalies, e.g. assign maximum score to a ranking where
all documents are labelled with the lowest grade with respect to all aspects
(e.g., not relevant, not credible, etc.).
  We present a theoretically principled multi-aspect evaluation method that can
be used for any number, and any type, of aspects. A thorough empirical
evaluation using up to 5 aspects and a total of 425 runs officially submitted
to 10 TREC tracks shows that our method is more discriminative than the
state-of-the-art and overcomes theoretical limitations of the state-of-the-art.
","[{'version': 'v1', 'created': 'Thu, 1 Dec 2022 13:40:24 GMT'}]",2022-12-02,"[['Maistro', 'Maria', ''], ['Lima', 'Lucas Chaves', ''], ['Simonsen', 'Jakob Grue', ''], ['Lioma', 'Christina', '']]","['Evaluation', 'ranking', 'multiple aspects', 'partial order']"
10788,2201.02192,Mohsen Jafarzadeh,"Mohsen Jafarzadeh, Stephen Brooks, Shimeng Yu, Balakrishnan
  Prabhakaran, Yonas Tadesse","A wearable sensor vest for social humanoid robots with GPGPU, IoT, and
  modular software architecture","This is the preprint version. The final version is published in
  Robotics and Autonomous Systems, Volume 139, 2021, Page 103536, ISSN
  0921-8890, https://doi.org/10.1016/j.robot.2020.103536","Robotics and Autonomous Systems, vol 139, page 103536, year 2021",10.1016/j.robot.2020.103536,,cs.RO cs.AI cs.HC cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Currently, most social robots interact with their surroundings and humans
through sensors that are integral parts of the robots, which limits the
usability of the sensors, human-robot interaction, and interchangeability. A
wearable sensor garment that fits many robots is needed in many applications.
This article presents an affordable wearable sensor vest, and an open-source
software architecture with the Internet of Things (IoT) for social humanoid
robots. The vest consists of touch, temperature, gesture, distance, vision
sensors, and a wireless communication module. The IoT feature allows the robot
to interact with humans locally and over the Internet. The designed
architecture works for any social robot that has a general-purpose graphics
processing unit (GPGPU), I2C/SPI buses, Internet connection, and the Robotics
Operating System (ROS). The modular design of this architecture enables
developers to easily add/remove/update complex behaviors. The proposed software
architecture provides IoT technology, GPGPU nodes, I2C and SPI bus mangers,
audio-visual interaction nodes (speech to text, text to speech, and image
understanding), and isolation between behavior nodes and other nodes. The
proposed IoT solution consists of related nodes in the robot, a RESTful web
service, and user interfaces. We used the HTTP protocol as a means of two-way
communication with the social robot over the Internet. Developers can easily
edit or add nodes in C, C++, and Python programming languages. Our architecture
can be used for designing more sophisticated behaviors for social humanoid
robots.
","[{'version': 'v1', 'created': 'Thu, 6 Jan 2022 18:57:35 GMT'}]",2022-01-07,"[['Jafarzadeh', 'Mohsen', ''], ['Brooks', 'Stephen', ''], ['Yu', 'Shimeng', ''], ['Prabhakaran', 'Balakrishnan', ''], ['Tadesse', 'Yonas', '']]","['Social Robot', 'Internet of Things', 'GPGPU', 'Human Robot Interaction', 'Software Architecture', 'Senor Vest']"
10789,2209.06131,Ahmed J. Obaid Dr.,Niran A. Abdulhussein and Ahmed J Obaid,User recommendation system based on MIND dataset,,"International Journal of Nonlinear Analysis and Applications
  (2022)",10.22075/ijnaa.2022.6857,,cs.IR cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  Nowadays, it's a very significant way for researchers and other individuals
to achieve their interests because it provides short solutions to satisfy their
demands. Because there are so many pieces of information on the internet, news
recommendation systems allow us to filter content and deliver it to the user in
proportion to his desires and interests. RSs have three techniques:
content-based filtering, collaborative filtering, and hybrid filtering. We will
use the MIND dataset with our system, which was collected in 2019, the big
challenge in this dataset because there is a lot of ambiguity and complex text
processing. In this paper, will present our proposed recommendation system. The
core of our system we have used the GloVe algorithm for word embeddings and
representation. Besides, the Multi-head Attention Layer calculates the
attention of words, to generate a list of recommended news. Finally, we achieve
good results more than some other related works in AUC 71.211, MRR 35.72,
nDCG@5 38.05, and nDCG@10 44.45.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2022 22:25:36 GMT'}]",2022-09-14,"[['Abdulhussein', 'Niran A.', ''], ['Obaid', 'Ahmed J', '']]","['News Recommendation System', 'Click Behavior', 'MIND Dataset', 'MIND-large', 'GloVe', 'NRMS.   1']"
10790,2004.05851,Luca Traini,"Vittorio Cortellessa, Luca Traini",Detecting Latency Degradation Patterns in Service-based Systems,,,10.1145/3358960.3379126,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Performance in heterogeneous service-based systems shows non-determistic
trends. Even for the same request type, latency may vary from one request to
another. These variations can occur due to several reasons on different levels
of the software stack: operating system, network, software libraries,
application code or others. Furthermore, a request may involve several Remote
Procedure Calls (RPC), where each call can be subject to performance variation.
Performance analysts inspect distributed traces and seek for recurrent patterns
in trace attributes, such as RPCs execution time, in order to cluster traces in
which variations may be induced by the same cause. Clustering ""similar"" traces
is a prerequisite for effective performance debugging. Given the scale of the
problem, such activity can be tedious and expensive. In this paper, we present
an automated approach that detects relevant RPCs execution time patterns
associated to request latency degradation, i.e. latency degradation patterns.
The presented approach is based on a genetic search algorithm driven by an
information retrieval relevance metric and an optimized fitness evaluation.
Each latency degradation pattern identifies a cluster of requests subject to
latency degradation with similar patterns in RPCs execution time. We show on a
microservice-based application case study that the proposed approach can
effectively detect clusters identified by artificially injected latency
degradation patterns. Experimental results show that our approach outperforms
in terms of F-score a state-of-art approach for latency profile analysis and
widely popular machine learning clustering algorithms. We also show how our
approach can be easily extended to trace attributes other than RPC execution
time (e.g. HTTP headers, execution node, etc.).
","[{'version': 'v1', 'created': 'Mon, 13 Apr 2020 10:10:39 GMT'}]",2020-04-14,"[['Cortellessa', 'Vittorio', ''], ['Traini', 'Luca', '']]","['Software performance', 'Performance debugging', 'Distributed systems', 'Search-based software engineering', 'Traces analysis']"
10791,2107.13641,Emanuela Guerriero Prof,"Tommaso Adamo and Gianpaolo Ghiani and Pierpaolo Greco and Emanuela
  Guerriero",Learned upper bounds for the Time-Dependent Travelling Salesman Problem,arXiv admin note: text overlap with arXiv:2009.07588,,10.1109/ACCESS.2022.3233852,,cs.AI math.OC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Given a graph whose arc traversal times vary over time, the Time-Dependent
Travelling Salesman Problem consists in finding a Hamiltonian tour of least
total duration covering the vertices of the graph. The main goal of this work
is to define tight upper bounds for this problem by reusing the information
gained when solving instances with similar features. This is customary in
distribution management, where vehicle routes have to be generated over and
over again with similar input data. To this aim, we devise an upper bounding
technique based on the solution of a classical (and simpler) time-independent
Asymmetric Travelling Salesman Problem, where the constant arc costs are
suitably defined by the combined use of a Linear Program and a mix of
unsupervised and supervised Machine Learning techniques. The effectiveness of
this approach has been assessed through a computational campaign on the real
travel time functions of two European cities: Paris and London. The overall
average gap between our heuristic and the best-known solutions is about
0.001\%. For 31 instances, new best solutions have been obtained.
","[{'version': 'v1', 'created': 'Wed, 28 Jul 2021 20:54:59 GMT'}]",2023-01-05,"[['Adamo', 'Tommaso', ''], ['Ghiani', 'Gianpaolo', ''], ['Greco', 'Pierpaolo', ''], ['Guerriero', 'Emanuela', '']]","['time-dependent routing', 'path ranking invariance', 'machine learning', 'travelling salesman']"
10792,1903.05361,Matthias Volk,"Majdi Ghadhab, Sebastian Junges, Joost-Pieter Katoen, Matthias Kuntz,
  Matthias Volk",Safety Analysis for Vehicle Guidance Systems with Dynamic Fault Trees,Accepted in RESS,,10.1016/j.ress.2019.02.005,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the design-phase safety analysis of vehicle guidance
systems. The proposed approach constructs dynamic fault trees (DFTs) to model a
variety of safety concepts and E/E architectures for drive automation. The
fault trees can be used to evaluate various quantitative measures by means of
model checking. The approach is accompanied by a large-scale evaluation: The
resulting DFTs with up to 300 elements constitute larger-than-before DFTs, yet
the concepts and architectures can be evaluated in a matter of minutes.
","[{'version': 'v1', 'created': 'Wed, 13 Mar 2019 08:48:32 GMT'}]",2019-03-14,"[['Ghadhab', 'Majdi', ''], ['Junges', 'Sebastian', ''], ['Katoen', 'Joost-Pieter', ''], ['Kuntz', 'Matthias', ''], ['Volk', 'Matthias', '']]","['Model Checking', 'Hardware Partitioning', 'Dynamic Fault Trees']"
10793,2007.11218,Araz Taeihagh,"Mikolaj firlej, Araz Taeihagh",Regulating human control over autonomous systems,,Regulation and Governance (2020),10.1111/rego.12344,,cs.CY cs.AI cs.HC cs.RO cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, many sectors have experienced significant progress in
automation, associated with the growing advances in artificial intelligence and
machine learning. There are already automated robotic weapons, which are able
to evaluate and engage with targets on their own, and there are already
autonomous vehicles that do not need a human driver. It is argued that the use
of increasingly autonomous systems (AS) should be guided by the policy of human
control, according to which humans should execute a certain significant level
of judgment over AS. While in the military sector there is a fear that AS could
mean that humans lose control over life and death decisions, in the
transportation domain, on the contrary, there is a strongly held view that
autonomy could bring significant operational benefits by removing the need for
a human driver. This article explores the notion of human control in the United
States in the two domains of defense and transportation. The operationalization
of emerging policies of human control results in the typology of direct and
indirect human controls exercised over the use of AS. The typology helps to
steer the debate away from the linguistic complexities of the term autonomy. It
identifies instead where human factors are undergoing important changes and
ultimately informs about more detailed rules and standards formulation, which
differ across domains, applications, and sectors.
","[{'version': 'v1', 'created': 'Wed, 22 Jul 2020 06:05:41 GMT'}]",2020-07-23,"[['firlej', 'Mikolaj', ''], ['Taeihagh', 'Araz', '']]","['artificial intelligence', 'autonomous system', 'autonomous vehicle', 'autonomous weapon', 'governance', 'regulation']"
10794,2110.03774,Adrian Buganza Tepole,"Vahidullah Tac, Francisco S. Costabal, Adrian Buganza Tepole","Data-driven Tissue Mechanics with Polyconvex Neural Ordinary
  Differential Equations","17 pages (including references and appendix), 8 figures. Code
  available at https://github.com/tajtac/NODE",,10.1016/j.cma.2022.115248,,cs.CE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data-driven methods are becoming an essential part of computational mechanics
due to their unique advantages over traditional material modeling. Deep neural
networks are able to learn complex material response without the constraints of
closed-form approximations. However, imposing the physics-based mathematical
requirements that any material model must comply with is not straightforward
for data-driven approaches. In this study, we use a novel class of neural
networks, known as neural ordinary differential equations (N-ODEs), to develop
data-driven material models that automatically satisfy polyconvexity of the
strain energy function with respect to the deformation gradient, a condition
needed for the existence of minimizers for boundary value problems in
elasticity. We take advantage of the properties of ordinary differential
equations to create monotonic functions that approximate the derivatives of the
strain energy function with respect to the invariants of the right Cauchy-Green
deformation tensor. The monotonicity of the derivatives guarantees the
convexity of the energy. The N-ODE material model is able to capture synthetic
data generated from closed-form material models, and it outperforms
conventional models when tested against experimental data on skin, a highly
nonlinear and anisotropic material. We also showcase the use of the N-ODE
material model in finite element simulations. The framework is general and can
be used to model a large class of materials. Here we focus on hyperelasticity,
but polyconvex strain energies are a core building block for other problems in
elasticity such as viscous and plastic deformations. We therefore expect our
methodology to further enable data-driven methods in computational mechanics
","[{'version': 'v1', 'created': 'Sun, 3 Oct 2021 13:11:43 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Mar 2022 21:20:57 GMT'}]",2022-07-27,"[['Tac', 'Vahidullah', ''], ['Costabal', 'Francisco S.', ''], ['Tepole', 'Adrian Buganza', '']]","['Machine learning', 'Constitutive modeling', 'Nonlinear finiteelements', 'Skin mechanics']"
10795,2107.06165,Albert Matveev,"Albert Matveev, Alexey Artemov, Denis Zorin and Evgeny Burnaev",3D Parametric Wireframe Extraction Based on Distance Fields,,,10.1145/3488933.3488982,,cs.CV cs.GR,http://creativecommons.org/licenses/by/4.0/,"  We present a pipeline for parametric wireframe extraction from densely
sampled point clouds. Our approach processes a scalar distance field that
represents proximity to the nearest sharp feature curve. In intermediate
stages, it detects corners, constructs curve segmentation, and builds a
topological graph fitted to the wireframe. As an output, we produce parametric
spline curves that can be edited and sampled arbitrarily. We evaluate our
method on 50 complex 3D shapes and compare it to the novel deep learning-based
technique, demonstrating superior quality.
","[{'version': 'v1', 'created': 'Tue, 13 Jul 2021 15:25:14 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Apr 2022 12:11:24 GMT'}]",2022-04-21,"[['Matveev', 'Albert', ''], ['Artemov', 'Alexey', ''], ['Zorin', 'Denis', ''], ['Burnaev', 'Evgeny', '']]","['sharp features', 'distance fields', 'spline fitting']"
10796,1401.8172,Pablo Rauzy,"Pablo Rauzy (LTCI), Sylvain Guilley","Formal Analysis of CRT-RSA Vigilant's Countermeasure Against the
  BellCoRe Attack: A Pledge for Formal Methods in the Field of Implementation
  Security",arXiv admin note: substantial text overlap with arXiv:1401.8170,"Program Protection and Reverse Engineering Workshop 2014, San
  Diego, CA : United States (2014)",10.1145/2556464.2556466,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In our paper at PROOFS 2013, we formally studied a few known countermeasures
to protect CRT-RSA against the BellCoRe fault injection attack. However, we
left Vigilant's countermeasure and its alleged repaired version by Coron et al.
as future work, because the arithmetical framework of our tool was not
sufficiently powerful. In this paper we bridge this gap and then use the same
methodology to formally study both versions of the countermeasure. We obtain
surprising results, which we believe demonstrate the importance of formal
analysis in the field of implementation security. Indeed, the original version
of Vigilant's countermeasure is actually broken, but not as much as Coron et
al. thought it was. As a consequence, the repaired version they proposed can be
simplified. It can actually be simplified even further as two of the nine
modular verifications happen to be unnecessary. Fortunately, we could formally
prove the simplified repaired version to be resistant to the BellCoRe attack,
which was considered a ""challenging issue"" by the authors of the countermeasure
themselves.
","[{'version': 'v1', 'created': 'Fri, 31 Jan 2014 14:19:33 GMT'}, {'version': 'v2', 'created': 'Fri, 23 May 2014 18:13:10 GMT'}]",2014-05-26,"[['Rauzy', 'Pablo', '', 'LTCI'], ['Guilley', 'Sylvain', '']]","['RSA (Rivest', 'Shamir', 'Adleman)', 'CRT (Chinese Remainder Theorem)', 'fault injection', 'BellCoRe (Bell Communications Research) attack', 'formal proof', 'OCaml']"
10797,1909.11404,Mohsen Ahmadvand,"Mohsen Ahmadvand, Daniel Below, Sebastian Banescu, and Alexander
  Pretschner",VirtSC: Combining Virtualization Obfuscation with Self-Checksumming,,,10.1145/3338503.3357723,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-checksumming (SC) is a tamper-proofing technique that ensures certain
program segments (code) in memory hash to known values at runtime. SC has few
restrictions on application and hence can protect a vast majority of programs.
The code verification in SC requires computation of the expected hashes after
compilation, as the machine-code is not known before. This means the expected
hash values need to be adjusted in the binary executable, hence combining SC
with other protections is limited due to this adjustment step. However,
obfuscation protections are often necessary, as SC protections can be otherwise
easily detected and disabled via pattern matching. In this paper, we present a
layered protection using virtualization obfuscation, yielding an
architecture-agnostic SC protection that requires no post-compilation
adjustment. We evaluate the performance of our scheme using a dataset of 25
real-world programs (MiBench and 3 CLI games). Our results show that the SC
scheme induces an average overhead of 43% for a complete protection (100%
coverage). The overhead is tolerable for less CPU-intensive programs (e.g.
games) and when only parts of programs (e.g. license checking) are protected.
However, large overheads stemming from the virtualization obfuscation were
encountered.
","[{'version': 'v1', 'created': 'Wed, 25 Sep 2019 11:00:36 GMT'}]",2019-09-26,"[['Ahmadvand', 'Mohsen', ''], ['Below', 'Daniel', ''], ['Banescu', 'Sebastian', ''], ['Pretschner', 'Alexander', '']]","['Virtualization', 'Self-checksumming', 'Man-At-The-End (MATE)', 'Software protection', 'Integrity protection']"
10798,2202.04171,Eladio Montero,"Eladio Montero-Porras, Jelena Grujic, Elias Fernandez-Domingos and Tom
  Lenaerts","Inferring Strategies from Observations in Long Iterated Prisoner's
  Dilemma Experiments",,,10.1038/s41598-022-11654-2,,cs.GT,http://creativecommons.org/licenses/by/4.0/,"  While many theoretical studies have revealed the strategies that could lead
to and maintain cooperation in the Iterated Prisoner's Dilemma, less is known
about what human participants actually do in this game and how strategies
change when being confronted with anonymous partners in each round. Previous
attempts used short experiments, made different assumptions of possible
strategies, and led to very different conclusions. We present here two long
treatments that differ in the partner matching strategy used, i.e. fixed or
shuffled partners. Here we use unsupervised methods to cluster the players
based on their actions and then Hidden Markov Model to infer what are those
strategies in each cluster. Analysis of the inferred strategies reveals that
fixed partner interaction leads to a behavioral self-organization. Shuffled
partners generate subgroups of strategies that remain entangled, apparently
blocking the self-selection process that leads to fully cooperating
participants in the fixed partner treatment. Analyzing the latter in more
detail shows that AllC, AllD, TFT- and WSLS-like behavior can be observed. This
study also reveals that long treatments are needed as experiments less than 25
rounds capture mostly the learning phase participants go through in these kinds
of experiments.
","[{'version': 'v1', 'created': 'Tue, 8 Feb 2022 22:09:49 GMT'}]",2022-07-21,"[['Montero-Porras', 'Eladio', ''], ['Grujic', 'Jelena', ''], ['Fernandez-Domingos', 'Elias', ''], ['Lenaerts', 'Tom', '']]","['Iterated Prisoner’s Dilemma', 'Strategies', 'Behavioral Experiments']"
10799,2009.10878,EPTCS,"Can Ba\c{s}kent (Department of Computer Science, Middlesex University,
  London)",A Game Theoretical Semantics for Logics of Nonsense,"In Proceedings GandALF 2020, arXiv:2009.09360","EPTCS 326, 2020, pp. 66-81",10.4204/EPTCS.326.5,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Logics of non-sense allow a third truth value to express propositions that
are \emph{nonsense}. These logics are ideal formalisms to understand how errors
are handled in programs and how they propagate throughout the programs once
they appear. In this paper, we give a Hintikkan game semantics for logics of
non-sense and prove its correctness. We also discuss how a known solution
method in game theory, the iterated elimination of strictly dominated
strategies, relates to semantic games for logics of nonsense. Finally, we
extend the logics of nonsense only by means of semantic games, developing a new
logic of nonsense, and propose a new game semantics for Priest's Logic of
Paradox.
","[{'version': 'v1', 'created': 'Wed, 23 Sep 2020 01:24:56 GMT'}]",2020-09-24,"[['Başkent', 'Can', '', 'Department of Computer Science, Middlesex University,\n  London']]","['Game semantics', 'logics of nonsense', 'logic of paradox', 'iterated elimination of strictlydominated strategies']"
10800,2007.04295,Denys Malyshev,"Mariia Drozdova, Anton Broilovskiy, Andrey Ustyuzhanin, Denys Malyshev","A study of Neural networks point source extraction on simulated
  Fermi/LAT Telescope images",Accepted to Astronomische Nachrichten,,10.1002/asna.202013788,,cs.CV astro-ph.HE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Astrophysical images in the GeV band are challenging to analyze due to the
strong contribution of the background and foreground astrophysical diffuse
emission and relatively broad point spread function of modern space-based
instruments. In certain cases, even finding of point sources on the image
becomes a non-trivial task. We present a method for point sources extraction
using a convolution neural network (CNN) trained on our own artificial data set
which imitates images from the Fermi Large Area Telescope. These images are raw
count photon maps of 10x10 degrees covering energies from 1 to 10 GeV. We
compare different CNN architectures that demonstrate accuracy increase by ~15%
and reduces the inference time by at least the factor of 4 accuracy improvement
with respect to a similar state of the art models.
","[{'version': 'v1', 'created': 'Wed, 8 Jul 2020 17:47:31 GMT'}]",2020-12-09,"[['Drozdova', 'Mariia', ''], ['Broilovskiy', 'Anton', ''], ['Ustyuzhanin', 'Andrey', ''], ['Malyshev', 'Denys', '']]","['gamma rays observations', 'techniques image processing', 'telescopes', 'methods data analysis', 'catalogs']"
10801,2006.01367,Jiabao Wang,"Jiabao Wang, Yang Li, Yangshuo Zhang, Zhuang Miao, Rui Zhang","A heterogeneous branch and multi-level classification network for person
  re-identification",,Neurocomputing 404(2020)61-69,10.1016/j.neucom.2020.05.007,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convolutional neural networks with multiple branches have recently been
proved highly effective in person re-identification (re-ID). Researchers design
multi-branch networks using part models, yet they always attribute the
effectiveness to multiple parts. In addition, existing multi-branch networks
always have isomorphic branches, which lack structural diversity. In order to
improve this problem, we propose a novel Heterogeneous Branch and Multi-level
Classification Network (HBMCN), which is designed based on the pre-trained
ResNet-50 model. A new heterogeneous branch, SE-Res-Branch, is proposed based
on the SE-Res module, which consists of the Squeeze-and-Excitation block and
the residual block. Furthermore, a new multi-level classification joint
objective function is proposed for the supervised learning of HBMCN, whereby
multi-level features are extracted from multiple high-level layers and
concatenated to represent a person. Based on three public person re-ID
benchmarks (Market1501, DukeMTMC-reID and CUHK03), experimental results show
that the proposed HBMCN reaches 94.4%, 85.7% and 73.8% in Rank-1, and 85.7%,
74.6% and 69.0% in mAP, achieving a state-of-the-art performance. Further
analysis demonstrates that the specially designed heterogeneous branch performs
better than an isomorphic branch, and multi-level classification provides more
discriminative features compared to single-level classification. As a result,
HBMCN provides substantial further improvements in person re-ID tasks.
","[{'version': 'v1', 'created': 'Tue, 2 Jun 2020 03:34:50 GMT'}]",2020-06-03,"[['Wang', 'Jiabao', ''], ['Li', 'Yang', ''], ['Zhang', 'Yangshuo', ''], ['Miao', 'Zhuang', ''], ['Zhang', 'Rui', '']]","['Person re-identification', 'convolutional neural networks', 'feature representation', 'heterogeneous']"
10802,2103.14781,Stephen MacDonell,"Amjed Tahir, Steve Counsell and Stephen G. MacDonell","An empirical study into the relationship between class features and test
  smells","Conference paper, 9 pages, 4 figures, 6 tables","Proceedings of the 23rd Asia-Pacific Software Engineering
  Conference (APSEC2016). Hamilton, New Zealand, IEEE, pp.137-144",10.1109/APSEC.2016.34,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While a substantial body of prior research has investigated the form and
nature of production code, comparatively little attention has examined
characteristics of test code, and, in particular, test smells in that code. In
this paper, we explore the relationship between production code properties (at
the class level) and a set of test smells, in five open source systems.
Specifically, we examine whether complexity properties of a production class
can be used as predictors of the presence of test smells in the associated unit
test. Our results, derived from the analysis of 975 production class-unit test
pairs, show that the Cyclomatic Complexity (CC) and Weighted Methods per Class
(WMC) of production classes are strong indicators of the presence of smells in
their associated unit tests. The Lack of Cohesion of Methods in a production
class (LCOM) also appears to be a good indicator of the presence of test
smells. Perhaps more importantly, all three metrics appear to be good
indicators of particular test smells, especially Eager Test and Duplicated
Code. The Depth of the Inheritance Tree (DIT), on the other hand, was not found
to be significantly related to the incidence of test smells. The results have
important implications for large-scale software development, particularly in a
context where organizations are increasingly using, adopting or adapting open
source code as part of their development strategy and need to ensure that
classes and methods are kept as simple as possible.
","[{'version': 'v1', 'created': 'Sat, 27 Mar 2021 01:03:51 GMT'}]",2021-03-30,"[['Tahir', 'Amjed', ''], ['Counsell', 'Steve', ''], ['MacDonell', 'Stephen G.', '']]","['test smells', 'OO metrics', 'software testing', 'empirical study']"
10803,2202.08175,Vibhor Agarwal,"Vibhor Agarwal, Sagar Joglekar, Anthony P. Young, Nishanth Sastry","GraphNLI: A Graph-based Natural Language Inference Model for Polarity
  Prediction in Online Debates",To appear at The ACM Web Conference 2022,,10.1145/3485447.3512144,,cs.CL cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  Online forums that allow participatory engagement between users have been
transformative for public discussion of important issues. However, debates on
such forums can sometimes escalate into full blown exchanges of hate or
misinformation. An important tool in understanding and tackling such problems
is to be able to infer the argumentative relation of whether a reply is
supporting or attacking the post it is replying to. This so called polarity
prediction task is difficult because replies may be based on external context
beyond a post and the reply whose polarity is being predicted. We propose
GraphNLI, a novel graph-based deep learning architecture that uses graph walk
techniques to capture the wider context of a discussion thread in a principled
fashion. Specifically, we propose methods to perform root-seeking graph walks
that start from a post and captures its surrounding context to generate
additional embeddings for the post. We then use these embeddings to predict the
polarity relation between a reply and the post it is replying to. We evaluate
the performance of our models on a curated debate dataset from Kialo, an online
debating platform. Our model outperforms relevant baselines, including S-BERT,
with an overall accuracy of 83%.
","[{'version': 'v1', 'created': 'Wed, 16 Feb 2022 16:26:21 GMT'}]",2022-02-17,"[['Agarwal', 'Vibhor', ''], ['Joglekar', 'Sagar', ''], ['Young', 'Anthony P.', ''], ['Sastry', 'Nishanth', '']]","['Online debates', 'argument mining', 'polarity prediction', 'Kialo']"
10804,2207.09908,Mostafa Mobasher,"Panos Pantidis, Mostafa E. Mobasher","Integrated Finite Element Neural Network (I-FENN) for non-local
  continuum damage mechanics",,"Computer Methods in Applied Mechanics and Engineering, Volume 404,
  2023, 115766, ISSN 0045-7825",10.1016/j.cma.2022.115766,,cs.CE physics.app-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new Integrated Finite Element Neural Network framework (I-FENN),
with the objective to accelerate the numerical solution of nonlinear
computational mechanics problems. We leverage the swift predictive capability
of neural networks (NNs) and we embed them inside the finite element stiffness
function, to compute element-level state variables and their derivatives within
a nonlinear, iterative numerical solution. This process is conducted jointly
with conventional finite element methods that involve shape functions: the NN
receives input data that resembles the material point deformation and its
output is used to construct element-level field variables such as the element
Jacobian matrix and residual vector. Here we introduce I-FENN to the continuum
damage analysis of quasi-brittle materials, and we establish a new non-local
gradient-based damage framework which operates at the cost of a local damage
approach. First, we develop a physics informed neural network (PINN) to
resemble the non-local gradient model and then we train the neural network
offline. The network learns to predict the non-local equivalent strain at each
material point, as well as its derivative with respect to the local strain.
Then, the PINN is integrated in the element stiffness definition and conducts
the local to non-local strain transformation, whereas the two PINN outputs are
used to construct the element Jacobian matrix and residual vector. This process
is carried out within the nonlinear solver, until numerical convergence is
achieved. The resulting method bears the computational cost of the conventional
local damage approach, but ensures mesh-independent results and a diffused
non-local strain and damage profile. As a result, the proposed method tackles
the vital drawbacks of both the local and non-local gradient method,
respectively being the mesh-dependence and additional computational cost.
","[{'version': 'v1', 'created': 'Thu, 14 Jul 2022 05:32:21 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Nov 2022 19:48:01 GMT'}]",2022-12-02,"[['Pantidis', 'Panos', ''], ['Mobasher', 'Mostafa E.', '']]","['I-FENN', 'finite element method', 'neural networks', 'continuum damage mechanics', 'non-local']"
10805,1710.02271,Aravind Sankar,"Adit Krishnan, Aravind Sankar, Shi Zhi, Jiawei Han","Unsupervised Extraction of Representative Concepts from Scientific
  Literature",Published as a conference paper at CIKM 2017,,10.1145/3132847.3133023,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies the automated categorization and extraction of scientific
concepts from titles of scientific articles, in order to gain a deeper
understanding of their key contributions and facilitate the construction of a
generic academic knowledgebase. Towards this goal, we propose an unsupervised,
domain-independent, and scalable two-phase algorithm to type and extract key
concept mentions into aspects of interest (e.g., Techniques, Applications,
etc.). In the first phase of our algorithm we propose PhraseType, a
probabilistic generative model which exploits textual features and limited POS
tags to broadly segment text snippets into aspect-typed phrases. We extend this
model to simultaneously learn aspect-specific features and identify academic
domains in multi-domain corpora, since the two tasks mutually enhance each
other. In the second phase, we propose an approach based on adaptor grammars to
extract fine grained concept mentions from the aspect-typed phrases without the
need for any external resources or human effort, in a purely data-driven
manner. We apply our technique to study literature from diverse scientific
domains and show significant gains over state-of-the-art concept extraction
techniques. We also present a qualitative analysis of the results obtained.
","[{'version': 'v1', 'created': 'Fri, 6 Oct 2017 04:04:43 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Oct 2017 20:58:20 GMT'}, {'version': 'v3', 'created': 'Thu, 9 Nov 2017 04:54:52 GMT'}]",2017-11-10,"[['Krishnan', 'Adit', ''], ['Sankar', 'Aravind', ''], ['Zhi', 'Shi', ''], ['Han', 'Jiawei', '']]","['Concept extraction', 'Probabilistic model', 'Adaptor grammar']"
10806,2202.04301,Van-Hoang Le,Van-Hoang Le and Hongyu Zhang,Log-based Anomaly Detection with Deep Learning: How Far Are We?,"Accepted by The 44th International Conference on Software Engineering
  (ICSE 2022)",,10.1145/3510003.3510155,,cs.SE cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Software-intensive systems produce logs for troubleshooting purposes.
Recently, many deep learning models have been proposed to automatically detect
system anomalies based on log data. These models typically claim very high
detection accuracy. For example, most models report an F-measure greater than
0.9 on the commonly-used HDFS dataset. To achieve a profound understanding of
how far we are from solving the problem of log-based anomaly detection, in this
paper, we conduct an in-depth analysis of five state-of-the-art deep
learning-based models for detecting system anomalies on four public log
datasets. Our experiments focus on several aspects of model evaluation,
including training data selection, data grouping, class distribution, data
noise, and early detection ability. Our results point out that all these
aspects have significant impact on the evaluation, and that all the studied
models do not always work well. The problem of log-based anomaly detection has
not been solved yet. Based on our findings, we also suggest possible future
work.
","[{'version': 'v1', 'created': 'Wed, 9 Feb 2022 06:27:11 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Feb 2022 02:26:15 GMT'}]",2022-02-16,"[['Le', 'Van-Hoang', ''], ['Zhang', 'Hongyu', '']]","['Anomaly Detection', 'Log Analysis', 'Log Parsing', 'Deep Learning']"
10807,2203.11022,Nikhil Garg,"Nikhil Garg, Ismael Balafrej, Terrence C. Stewart, Jean Michel Portal,
  Marc Bocquet, Damien Querlioz, Dominique Drouin, Jean Rouat, Yann Beilliard,
  Fabien Alibart","Voltage-Dependent Synaptic Plasticity (VDSP): Unsupervised probabilistic
  Hebbian plasticity rule based on neurons membrane potential","Front. Neurosci., 21 October 2022 Sec. Neuromorphic Engineering",Front. Neurosci. 16:983950 (2022),10.3389/fnins.2022.983950,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study proposes voltage-dependent-synaptic plasticity (VDSP), a novel
brain-inspired unsupervised local learning rule for the online implementation
of Hebb's plasticity mechanism on neuromorphic hardware. The proposed VDSP
learning rule updates the synaptic conductance on the spike of the postsynaptic
neuron only, which reduces by a factor of two the number of updates with
respect to standard spike-timing-dependent plasticity (STDP). This update is
dependent on the membrane potential of the presynaptic neuron, which is readily
available as part of neuron implementation and hence does not require
additional memory for storage. Moreover, the update is also regularized on
synaptic weight and prevents explosion or vanishing of weights on repeated
stimulation. Rigorous mathematical analysis is performed to draw an equivalence
between VDSP and STDP. To validate the system-level performance of VDSP, we
train a single-layer spiking neural network (SNN) for the recognition of
handwritten digits. We report 85.01 $ \pm $ 0.76% (Mean $ \pm $ S.D.) accuracy
for a network of 100 output neurons on the MNIST dataset. The performance
improves when scaling the network size (89.93 $ \pm $ 0.41% for 400 output
neurons, 90.56 $ \pm $ 0.27 for 500 neurons), which validates the applicability
of the proposed learning rule for spatial pattern recognition tasks. Future
work will consider more complicated tasks. Interestingly, the learning rule
better adapts than STDP to the frequency of input signal and does not require
hand-tuning of hyperparameters
","[{'version': 'v1', 'created': 'Mon, 21 Mar 2022 14:39:02 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Mar 2022 16:01:35 GMT'}, {'version': 'v3', 'created': 'Thu, 14 Apr 2022 11:08:48 GMT'}, {'version': 'v4', 'created': 'Fri, 1 Jul 2022 09:47:31 GMT'}, {'version': 'v5', 'created': 'Mon, 5 Sep 2022 22:10:37 GMT'}, {'version': 'v6', 'created': 'Sat, 22 Oct 2022 08:59:58 GMT'}]",2022-10-25,"[['Garg', 'Nikhil', ''], ['Balafrej', 'Ismael', ''], ['Stewart', 'Terrence C.', ''], ['Portal', 'Jean Michel', ''], ['Bocquet', 'Marc', ''], ['Querlioz', 'Damien', ''], ['Drouin', 'Dominique', ''], ['Rouat', 'Jean', ''], ['Beilliard', 'Yann', ''], ['Alibart', 'Fabien', '']]","['Spiking neural networks', 'Hebbian plasticity', 'STDP', 'Unsupervised learning', 'Synaptic plasticity', 'MNIST']"
10808,2210.08585,Sajad Fathi Hafshejani,"Sajad Fathi Hafshejani, Zahra Moberfard",A new trigonometric kernel function for support vector machine,,"Iran Journal of Computer Science, 2022",10.1007/s42044-022-00130-9,,cs.LG cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last few years, various types of machine learning algorithms, such as
Support Vector Machine (SVM), Support Vector Regression (SVR), and Non-negative
Matrix Factorization (NMF) have been introduced. The kernel approach is an
effective method for increasing the classification accuracy of machine learning
algorithms. This paper introduces a family of one-parameter kernel functions
for improving the accuracy of SVM classification. The proposed kernel function
consists of a trigonometric term and differs from all existing kernel
functions. We show this function is a positive definite kernel function.
Finally, we evaluate the SVM method based on the new trigonometric kernel, the
Gaussian kernel, the polynomial kernel, and a convex combination of the new
kernel function and the Gaussian kernel function on various types of datasets.
Empirical results show that the SVM based on the new trigonometric kernel
function and the mixed kernel function achieve the best classification
accuracy. Moreover, some numerical results of performing the SVR based on the
new trigonometric kernel function and the mixed kernel function are presented.
","[{'version': 'v1', 'created': 'Sun, 16 Oct 2022 17:10:52 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Nov 2022 05:44:06 GMT'}, {'version': 'v3', 'created': 'Thu, 15 Dec 2022 02:56:29 GMT'}]",2022-12-16,"[['Hafshejani', 'Sajad Fathi', ''], ['Moberfard', 'Zahra', '']]","['Support vector machine', 'Kernel-method', 'Trigonometric kernelfunction']"
10809,2207.12236,Qi Yang,"Qi Yang, Sergey Nikolenko, Alfred Huang, Aleksandr Farseev",Personality-Driven Social Multimedia Content Recommendation,,,10.1145/3503161.3548769,,cs.IR cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Social media marketing plays a vital role in promoting brand and product
values to wide audiences. In order to boost their advertising revenues, global
media buying platforms such as Facebook Ads constantly reduce the reach of
branded organic posts, pushing brands to spend more on paid media ads. In order
to run organic and paid social media marketing efficiently, it is necessary to
understand the audience, tailoring the content to fit their interests and
online behaviours, which is impossible to do manually at a large scale. At the
same time, various personality type categorization schemes such as the
Myers-Briggs Personality Type indicator make it possible to reveal the
dependencies between personality traits and user content preferences on a wider
scale by categorizing audience behaviours in a unified and structured manner.
This problem is yet to be studied in depth by the research community, while the
level of impact of different personality traits on content recommendation
accuracy has not been widely utilised and comprehensively evaluated so far.
Specifically, in this work we investigate the impact of human personality
traits on the content recommendation model by applying a novel
personality-driven multi-view content recommender system called Personality
Content Marketing Recommender Engine, or PersiC. Our experimental results and
real-world case study demonstrate not just PersiC's ability to perform
efficient human personality-driven multi-view content recommendation, but also
allow for actionable digital ad strategy recommendations, which when deployed
are able to improve digital advertising efficiency by over 420% as compared to
the original human-guided approach.
","[{'version': 'v1', 'created': 'Mon, 25 Jul 2022 14:37:18 GMT'}]",2022-07-26,"[['Yang', 'Qi', ''], ['Nikolenko', 'Sergey', ''], ['Huang', 'Alfred', ''], ['Farseev', 'Aleksandr', '']]","['User Profiling', 'Multimedia Retrieval', 'Machine Learning', 'Recommender System', 'Deep Learning']"
10810,2201.10811,Anastasiia Tkalich,"Anastasiia Tkalich, Nils Brede Moe, Rasmus Ulfsnes","Making Internal Software Startups Work: How to Innovate Like a Venture
  Builder?",International Conference on Software Business,,10.1007/978-3-030-91983-2_12,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  With the increasing availability of software usage and the influence of the
Lean Startup mindset, more and more companies choose to innovate through
internal software startups. Such startups aim at developing new business models
while at the same time relying on the resources from the companies where they
emerged. The evidence from both researchers and practitioners indicates that
driving internal software startups is challenging. This paper seeks to address
this problem by asking the research question: how to make internal software
startups work? We examined a unique case of a venture builder, a company
primarily focusing on building internal software startups and launching them as
independent companies. Applying a Grounded Theory approach, we analyzed data on
four internal software startups at the case company. The results suggest that
four strategies drive the examined startups, cultural, financial, personnel,
and venture arrangement. We interpret our results by drawing on earlier
literature on intrapreneurship and internal ventures and suggest four
recommendations to succeed with internal software startups 1 establish shared
arenas for the employees, 2 provide necessary resources for experimentation in
the initial phase and increase them incrementally, 3 build up in-house product
management competence through coaching, and 4 harness employees own motivation
to develop their own ideas.
","[{'version': 'v1', 'created': 'Wed, 26 Jan 2022 08:32:25 GMT'}]",2022-01-27,"[['Tkalich', 'Anastasiia', ''], ['Moe', 'Nils Brede', ''], ['Ulfsnes', 'Rasmus', '']]","['Intrapreneurship', 'Internal Venture', 'Internal Software Startup', 'Internal Startup', 'Lean Startup', 'Innovation Strategy', 'Venture Builder']"
10811,2205.10120,Riccardo Taiello,"Riccardo Taiello, Melek \""Onen, Olivier Humbert and Marco Lorenzi",Privacy Preserving Image Registration,,"Medical Image Computing and Computer Assisted Intervention (2022)
  130-140",10.1007/978-3-031-16446-0_13,,cs.CV cs.AI cs.CR eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image registration is a key task in medical imaging applications, allowing to
represent medical images in a common spatial reference frame. Current
literature on image registration is generally based on the assumption that
images are usually accessible to the researcher, from which the spatial
transformation is subsequently estimated. This common assumption may not be met
in current practical applications, since the sensitive nature of medical images
may ultimately require their analysis under privacy constraints, preventing to
share the image content in clear form. In this work, we formulate the problem
of image registration under a privacy preserving regime, where images are
assumed to be confidential and cannot be disclosed in clear. We derive our
privacy preserving image registration framework by extending classical
registration paradigms to account for advanced cryptographic tools, such as
secure multi-party computation and homomorphic encryption, that enable the
execution of operations without leaking the underlying data. To overcome the
problem of performance and scalability of cryptographic tools in high
dimensions, we first propose to optimize the underlying image registration
operations using gradient approximations. We further revisit the use of
homomorphic encryption and use a packing method to allow the encryption and
multiplication of large matrices more efficiently. We demonstrate our privacy
preserving framework in linear and non-linear registration problems, evaluating
its accuracy and scalability with respect to standard image registration. Our
results show that privacy preserving image registration is feasible and can be
adopted in sensitive medical imaging applications.
","[{'version': 'v1', 'created': 'Tue, 17 May 2022 14:00:58 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Jul 2022 12:00:05 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Jul 2022 07:14:16 GMT'}, {'version': 'v4', 'created': 'Thu, 14 Jul 2022 09:22:50 GMT'}, {'version': 'v5', 'created': 'Sun, 18 Sep 2022 05:54:04 GMT'}]",2022-09-20,"[['Taiello', 'Riccardo', ''], ['Önen', 'Melek', ''], ['Humbert', 'Olivier', ''], ['Lorenzi', 'Marco', '']]","['Image Registration', 'ImageRegistration', 'Trustworthiness']"
10812,1702.05455,Marek Szyku{\l}a,Marek Szyku{\l}a,Improving the upper bound on the length of the shortest reset words,STACS 2018 version with the open problems section extended,"In Symposium on Theoretical Aspects of Computer Science (STACS
  2018), volume 96 of LIPIcs, pages 56:1--56:13, 2018",10.4230/LIPIcs.STACS.2018.56,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We improve the best known upper bound on the length of the shortest reset
words of synchronizing automata. The new bound is slightly better than $114 n^3
/ 685 + O(n^2)$. The \v{C}ern\'y conjecture states that $(n-1)^2$ is an upper
bound. So far, the best general upper bound was $(n^3-n)/6-1$ obtained by
J.-E.~Pin and P.~Frankl in 1982. Despite a number of efforts, it remained
unchanged for about 35 years.
  To obtain the new upper bound we utilize avoiding words. A word is avoiding
for a state $q$ if after reading the word the automaton cannot be in $q$. We
obtain upper bounds on the length of the shortest avoiding words, and using the
approach of Trahtman from 2011 combined with the well known Frankl theorem from
1982, we improve the general upper bound on the length of the shortest reset
words. For all the bounds, there exist polynomial algorithms finding a word of
length not exceeding the bound.
","[{'version': 'v1', 'created': 'Fri, 17 Feb 2017 17:46:16 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Apr 2017 10:43:40 GMT'}, {'version': 'v3', 'created': 'Fri, 1 Sep 2017 12:16:59 GMT'}, {'version': 'v4', 'created': 'Mon, 27 Nov 2017 12:51:02 GMT'}, {'version': 'v5', 'created': 'Thu, 29 Mar 2018 21:26:15 GMT'}]",2018-04-02,"[['Szykuła', 'Marek', '']]","['avoiding word', 'ˇCern´y conjecture', 'reset length', 'reset threshold', 'reset word', 'synchronizing automaton', 'synchronizing word']"
10813,1810.05727,Julia Noothout,"Julia M. H. Noothout, Bob D. de Vos, Jelmer M. Wolterink, Ivana Isgum",Automatic Segmentation of Thoracic Aorta Segments in Low-Dose Chest CT,,"SPIE Medical Imaging, 2018, vol. 10574, pp. 105741S",10.1117/12.2293114,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Morphological analysis and identification of pathologies in the aorta are
important for cardiovascular diagnosis and risk assessment in patients. Manual
annotation is time-consuming and cumbersome in CT scans acquired without
contrast enhancement and with low radiation dose. Hence, we propose an
automatic method to segment the ascending aorta, the aortic arch and the
thoracic descending aorta in low-dose chest CT without contrast enhancement.
Segmentation was performed using a dilated convolutional neural network (CNN),
with a receptive field of 131X131 voxels, that classified voxels in axial,
coronal and sagittal image slices. To obtain a final segmentation, the obtained
probabilities of the three planes were averaged per class, and voxels were
subsequently assigned to the class with the highest class probability. Two-fold
cross-validation experiments were performed where ten scans were used to train
the network and another ten to evaluate the performance. Dice coefficients of
0.83, 0.86 and 0.88, and Average Symmetrical Surface Distances (ASSDs) of 2.44,
1.56 and 1.87 mm were obtained for the ascending aorta, the aortic arch, and
the descending aorta, respectively. The results indicate that the proposed
method could be used in large-scale studies analyzing the anatomical location
of pathology and morphology of the thoracic aorta.
","[{'version': 'v1', 'created': 'Tue, 9 Oct 2018 13:31:10 GMT'}]",2018-10-16,"[['Noothout', 'Julia M. H.', ''], ['de Vos', 'Bob D.', ''], ['Wolterink', 'Jelmer M.', ''], ['Isgum', 'Ivana', '']]","['Aorta segmentation', 'ascending aorta', 'aortic arch', 'descending aorta', 'dilated convolutional neuralnetwork', 'low-dose chest CT']"
10814,2107.01886,Bi'an Du,"Bi'an Du, Xiang Gao, Wei Hu, Xin Li","Self-Contrastive Learning with Hard Negative Sampling for
  Self-supervised Point Cloud Learning",Accepted to ACM MM 2021,,10.1145/3474085.3475458,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Point clouds have attracted increasing attention. Significant progress has
been made in methods for point cloud analysis, which often requires costly
human annotation as supervision. To address this issue, we propose a novel
self-contrastive learning for self-supervised point cloud representation
learning, aiming to capture both local geometric patterns and nonlocal semantic
primitives based on the nonlocal self-similarity of point clouds. The
contributions are two-fold: on the one hand, instead of contrasting among
different point clouds as commonly employed in contrastive learning, we exploit
self-similar point cloud patches within a single point cloud as positive
samples and otherwise negative ones to facilitate the task of contrastive
learning. On the other hand, we actively learn hard negative samples that are
close to positive samples for discriminative feature learning. Experimental
results show that the proposed method achieves state-of-the-art performance on
widely used benchmark datasets for self-supervised point cloud segmentation and
transfer learning for classification.
","[{'version': 'v1', 'created': 'Mon, 5 Jul 2021 09:17:45 GMT'}, {'version': 'v2', 'created': 'Sun, 29 Aug 2021 18:10:15 GMT'}]",2021-08-31,"[['Du', ""Bi'an"", ''], ['Gao', 'Xiang', ''], ['Hu', 'Wei', ''], ['Li', 'Xin', '']]","['Contrastive learning', 'nonlocal self-similarity', 'point clouds', 'selfsupervised learning', 'hard negative sampling']"
10815,2009.03809,Dimitrios Thilikos,"Stratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos",Edge Degeneracy: Algorithmic and Structural Results,"The paper has appeared as ""Stratis Limnios, Christophe Paul, Joanny
  Perret, Dimitrios M. Thilikos: Edge degeneracy: Algorithmic and structural
  results. Theor. Comput. Sci. 839: 164-175 (2020)"". This is a new version
  where a typo has been corrected. In particular, ""$1,2,3$"" is now ""$1,2$"" and
  ""$\Bbb{N}_{\geq 4}$"" is now ""$\Bbb{N}_{\geq 3}$""",Theoretical Computer Science 839:164-175 (2020),10.1016/j.tcs.2020.06.006,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a cops and robber game where the cops are blocking edges of a
graph, while the robber occupies its vertices. At each round of the game, the
cops choose some set of edges to block and right after the robber is obliged to
move to another vertex traversing at most $s$ unblocked edges ($s$ can be seen
as the speed of the robber). Both parts have complete knowledge of the
opponent's moves and the cops win when they occupy all edges incident to the
robbers position. We introduce the capture cost on $G$ against a robber of
speed $s$. This defines a hierarchy of invariants, namely $\delta^{1}_{\rm
e},\delta^{2}_{\rm e},\ldots,\delta^{\infty}_{\rm e}$, where
$\delta^{\infty}_{\rm e}$ is an edge-analogue of the admissibility graph
invariant, namely the {\em edge-admissibility} of a graph. We prove that the
problem asking wether $\delta^{s}_{\rm e}(G)\leq k$, is polynomially solvable
when $s\in \{1,2,\infty\}$ while, otherwise, it is NP-complete. Our main result
is a structural theorem for graphs of bounded edge-admissibility. We prove that
every graph of edge-admissibility at most $k$ can be constructed using $(\leq
k)$-edge-sums, starting from graphs whose all vertices, except possibly from
one, have degree at most $k$. Our structural result is approximately tight in
the sense that graphs generated by this construction always have
edge-admissibility at most $2k-1$. Our proofs are based on a precise structural
characterization of the graphs that do not contain $\theta_{r}$ as an
immersion, where $\theta_{r}$ is the graph on two vertices and $r$ parallel
edges.
","[{'version': 'v1', 'created': 'Tue, 8 Sep 2020 15:04:33 GMT'}]",2020-09-09,"[['Limnios', 'Stratis', ''], ['Paul', 'Christophe', ''], ['Perret', 'Joanny', ''], ['Thilikos', 'Dimitrios M.', '']]","['Graph Admissibility', 'Graph degeneracy', 'Graph Searching', 'Cops and robber games', 'Graph decomposition theorems']"
10816,2210.14871,Eric Schares,Eric Schares,"Impact of the 2022 OSTP Memo: A Bibliometric Analysis of U.S. Federally
  Funded Publications, 2017-2021","30 pages, including Appendix. 11 figures, 6 tables. Accepted for
  publication in Quantitative Science Studies",,10.1162/qss_a_00237,,cs.DL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  On August 25, 2022, the White House Office of Science and Technology Policy
(OSTP) released a memo regarding public access to scientific research. Signed
by Director Alondra Nelson, this updated guidance eliminated the 12-month
embargo period on publications arising from U.S. federal funding that had been
allowed from a previous 2013 OSTP memo.
  While reactions to this updated federal guidance have been plentiful, to date
there has not been a detailed analysis of the publications which would fall
under this new framework. The OSTP released a companion report along with the
memo, but it only provided a broad estimate of total numbers affected per year.
  Therefore, this study seeks to more deeply investigate the characteristics of
U.S. federally funded research over a 5-year period from 2017-2021 to better
understand the updated guidance's impact. It uses a manually created custom
filter in the Dimensions database to return only publications that arise from
U.S. federal funding.
  Results show that an average of 265,000 articles were published each year
that acknowledge U.S. federal funding agencies, and these research outputs are
further examined by publisher, journal title, institutions, and Open Access
status.
  Interactive versions of the graphs are available online at
https://ostp.lib.iastate.edu/.
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2022 17:22:16 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Nov 2022 17:05:19 GMT'}, {'version': 'v3', 'created': 'Mon, 19 Dec 2022 16:09:33 GMT'}]",2023-01-19,"[['Schares', 'Eric', '']]","['OSTP memo', 'Open Access', 'federally funded research', 'public access', 'embargo', 'Dimensions']"
10817,2112.00699,Dalcimar Casanova,Eliane Maria De Bortoli F\'avero and Dalcimar Casanova,"BERT_SE: A Pre-trained Language Representation Model for Software
  Engineering",,"In D. C. Wyld and D. Nagamalai (Ed.), NLPTA 2021. v.11, n.19,
  2021, 115-130",10.5121/csit.2021.111909,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  The application of Natural Language Processing (NLP) has achieved a high
level of relevance in several areas. In the field of software engineering (SE),
NLP applications are based on the classification of similar texts (e.g.
software requirements), applied in tasks of estimating software effort,
selection of human resources, etc. Classifying software requirements has been a
complex task, considering the informality and complexity inherent in the texts
produced during the software development process. The pre-trained embedding
models are shown as a viable alternative when considering the low volume of
textual data labeled in the area of software engineering, as well as the lack
of quality of these data. Although there is much research around the
application of word embedding in several areas, to date, there is no knowledge
of studies that have explored its application in the creation of a specific
model for the domain of the SE area. Thus, this article presents the proposal
for a contextualized embedding model, called BERT_SE, which allows the
recognition of specific and relevant terms in the context of SE. The assessment
of BERT_SE was performed using the software requirements classification task,
demonstrating that this model has an average improvement rate of 13% concerning
the BERT_base model, made available by the authors of BERT. The code and
pre-trained models are available at https://github.com/elianedb.
","[{'version': 'v1', 'created': 'Wed, 1 Dec 2021 18:22:04 GMT'}]",2021-12-02,"[['Fávero', 'Eliane Maria De Bortoli', ''], ['Casanova', 'Dalcimar', '']]","['Word embedding', 'Software engineering', 'Domain-specific Model', 'Contextualized pre-trained model', 'BERT']"
10818,2007.01954,Esam Alkaldy Dr.,"Ali H. Majeed, Esam Alkaldy, Mohd S. Zainal, and Danial MD. Nor",Novel Memory Structures in QCA Nano Technology,,"The 3rd Scientific Conference of Electrical and Electronic
  Engineering Researches (SCEEER) | (15-16) JUNE 2020 | BASRAH / IRAQ",10.37917/ijeee.sceeer.3rd.17,,cs.ET cond-mat.other,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quantum-dot Cellular Automata (QCA) is a new emerging technology for
designing electronic circuits in nanoscale. QCA technology comes to overcome
the CMOS limitation and to be a good alternative as it can work in
ultra-high-speed. QCA brought researchers attention due to many features such
as low power consumption, small feature size in addition to high frequency.
Designing circuits in QCA technology with minimum costs such as cells count and
the area is very important. This paper presents novel structures of D-latch and
D-Flip Flop with the lower area and cell count. The proposed Flip-Flop has SET
and RESET ability. The proposed latch and Flip-Flop have lower complexity
compared with counterparts in terms of cell counts by 32% and 26% respectively.
The proposed circuits are designed and simulated in QCADesigner software.
","[{'version': 'v1', 'created': 'Fri, 3 Jul 2020 22:21:59 GMT'}]",2020-07-07,"[['Majeed', 'Ali H.', ''], ['Alkaldy', 'Esam', ''], ['Zainal', 'Mohd S.', ''], ['Nor', 'Danial MD.', '']]","['QCA technology', 'D Flip-Flop', 'Memory unit', 'Nanotechnology']"
10819,2007.15919,Jan Philipp Thoma,"Jan Philipp Thoma, Jakob Feldtkeller, Markus Krausz, Tim G\""uneysu,
  Daniel J. Bernstein",BasicBlocker: ISA Redesign to Make Spectre-Immune CPUs Faster,Preprint,,10.1145/3471621.3471857,,cs.CR cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent research has revealed an ever-growing class of microarchitectural
attacks that exploit speculative execution, a standard feature in modern
processors. Proposed and deployed countermeasures involve a variety of compiler
updates, firmware updates, and hardware updates. None of the deployed
countermeasures have convincing security arguments, and many of them have
already been broken.
  The obvious way to simplify the analysis of speculative-execution attacks is
to eliminate speculative execution. This is normally dismissed as being
unacceptably expensive, but the underlying cost analyses consider only software
written for current instruction-set architectures, so they do not rule out the
possibility of a new instruction-set architecture providing acceptable
performance without speculative execution. A new ISA requires compiler and
hardware updates, but these are happening in any case.
  This paper introduces BasicBlocker, a generic ISA modification that works for
all common ISAs and that allows non-speculative CPUs to obtain most of the
performance benefit that would have been provided by speculative execution. To
demonstrate the feasibility of BasicBlocker, this paper defines a variant of
the RISC-V ISA called BBRISC-V and provides a thorough evaluation on both a
5-stage in-order soft core and a superscalar out-of-order processor using an
associated compiler and a variety of benchmark programs.
","[{'version': 'v1', 'created': 'Fri, 31 Jul 2020 09:30:45 GMT'}, {'version': 'v2', 'created': 'Wed, 5 May 2021 10:37:33 GMT'}]",2022-08-17,"[['Thoma', 'Jan Philipp', ''], ['Feldtkeller', 'Jakob', ''], ['Krausz', 'Markus', ''], ['Güneysu', 'Tim', ''], ['Bernstein', 'Daniel J.', '']]","['Spectre', 'Hardware', 'RISC-V']"
10820,2109.00794,Attaullah Sahito,"Attaullah Sahito, Eibe Frank, and Bernhard Pfahringer",Semi-Supervised Learning using Siamese Networks,added link of GitHub repository,"In AI 2019: Advances in Artificial Intelligence. AI 2019 . Lecture
  Notes in Computer Science, vol 11919. Springer, Cham",10.1007/978-3-030-35288-2_47,,cs.LG cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Neural networks have been successfully used as classification models yielding
state-of-the-art results when trained on a large number of labeled samples.
These models, however, are more difficult to train successfully for
semi-supervised problems where small amounts of labeled instances are available
along with a large number of unlabeled instances. This work explores a new
training method for semi-supervised learning that is based on similarity
function learning using a Siamese network to obtain a suitable embedding. The
learned representations are discriminative in Euclidean space, and hence can be
used for labeling unlabeled instances using a nearest-neighbor classifier.
Confident predictions of unlabeled instances are used as true labels for
retraining the Siamese network on the expanded training set. This process is
applied iteratively. We perform an empirical study of this iterative
self-training algorithm. For improving unlabeled predictions, local learning
with global consistency [22] is also evaluated.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2021 09:06:35 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Sep 2021 22:22:08 GMT'}]",2021-09-13,"[['Sahito', 'Attaullah', ''], ['Frank', 'Eibe', ''], ['Pfahringer', 'Bernhard', '']]","['Semi-supervised learning', 'Siamese networks', 'Triplet loss', 'LLGC']"
10821,1712.06742,Henry Leopold,"Henry A Leopold, Jeff Orchard, John S Zelek and Vasudevan
  Lakshminarayanan","PixelBNN: Augmenting the PixelCNN with batch normalization and the
  presentation of a fast architecture for retinal vessel segmentation","Manuscript accepted into SPIE Journal of Medical Imaging special
  section on Radiomics and Deep Learning",,10.3390/jimaging5020026,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Analysis of retinal fundus images is essential for eye-care physicians in the
diagnosis, care and treatment of patients. Accurate fundus and/or retinal
vessel maps give rise to longitudinal studies able to utilize multimedia image
registration and disease/condition status measurements, as well as applications
in surgery preparation and biometrics. The segmentation of retinal morphology
has numerous applications in assessing ophthalmologic and cardiovascular
disease pathologies. The early detection of many such conditions is often the
most effective method for reducing patient risk. Computer aided segmentation of
the vasculature has proven to be a challenge, mainly due to inconsistencies
such as noise and variations in hue and brightness that can greatly reduce the
quality of fundus images. This paper presents PixelBNN, a highly efficient deep
method for automating the segmentation of fundus morphologies. The model was
trained, tested and cross tested on the DRIVE, STARE and CHASE\_DB1 retinal
vessel segmentation datasets. Performance was evaluated using G-mean, Mathews
Correlation Coefficient and F1-score. The network was 8.5 times faster than the
current state-of-the-art at test time and performed comparatively well,
considering a 5 to 19 times reduction in information from resizing images
during preprocessing.
","[{'version': 'v1', 'created': 'Tue, 19 Dec 2017 01:30:11 GMT'}]",2019-12-02,"[['Leopold', 'Henry A', ''], ['Orchard', 'Jeff', ''], ['Zelek', 'John S', ''], ['Lakshminarayanan', 'Vasudevan', '']]","['convolutional networks', 'deep learning', 'retinal vessels', 'image segmentation']"
10822,2103.00221,Mahsa Ghorbani,"Mahsa Ghorbani, Anees Kazi, Mahdieh Soleymani Baghshah, Hamid R.
  Rabiee, Nassir Navab","RA-GCN: Graph Convolutional Network for Disease Prediction Problems with
  Imbalanced Data",,,10.1016/j.media.2021.102272,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Disease prediction is a well-known classification problem in medical
applications. GCNs provide a powerful tool for analyzing the patients' features
relative to each other. This can be achieved by modeling the problem as a graph
node classification task, where each node is a patient. Due to the nature of
such medical datasets, class imbalance is a prevalent issue in the field of
disease prediction, where the distribution of classes is skewed. When the class
imbalance is present in the data, the existing graph-based classifiers tend to
be biased towards the major class(es) and neglect the samples in the minor
class(es). On the other hand, the correct diagnosis of the rare positive cases
among all the patients is vital in a healthcare system. In conventional
methods, such imbalance is tackled by assigning appropriate weights to classes
in the loss function which is still dependent on the relative values of
weights, sensitive to outliers, and in some cases biased towards the minor
class(es). In this paper, we propose a Re-weighted Adversarial Graph
Convolutional Network (RA-GCN) to prevent the graph-based classifier from
emphasizing the samples of any particular class. This is accomplished by
associating a graph-based neural network to each class, which is responsible
for weighting the class samples and changing the importance of each sample for
the classifier. Therefore, the classifier adjusts itself and determines the
boundary between classes with more attention to the important samples. The
parameters of the classifier and weighting networks are trained by an
adversarial approach. We show experiments on synthetic and three publicly
available medical datasets. RA-GCN demonstrates the superiority compared to
recent methods in identifying the patient's status on all three datasets. The
detailed analysis is provided as quantitative and qualitative experiments on
synthetic datasets.
","[{'version': 'v1', 'created': 'Sat, 27 Feb 2021 14:06:27 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Mar 2021 11:54:28 GMT'}, {'version': 'v3', 'created': 'Sun, 7 Nov 2021 15:36:09 GMT'}]",2021-11-09,"[['Ghorbani', 'Mahsa', ''], ['Kazi', 'Anees', ''], ['Baghshah', 'Mahdieh Soleymani', ''], ['Rabiee', 'Hamid R.', ''], ['Navab', 'Nassir', '']]","['Disease prediction', 'Graphs', 'Graph convolutionalnetworks', 'Node classification', 'Imbalanced classification']"
10823,1909.05289,Baptiste Barreau,"Baptiste Barreau, Laurent Carlier, Damien Challet",Deep Prediction of Investor Interest: a Supervised Clustering Approach,,"Algorithmic Finance, vol. 8, no. 3-4, pp. 77-89, 2020",10.3233/AF-200296,,cs.LG q-fin.CP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel deep learning architecture suitable for the prediction of
investor interest for a given asset in a given time frame. This architecture
performs both investor clustering and modelling at the same time. We first
verify its superior performance on a synthetic scenario inspired by real data
and then apply it to two real-world databases, a publicly available dataset
about the position of investors in Spanish stock market and proprietary data
from BNP Paribas Corporate and Institutional Banking.
","[{'version': 'v1', 'created': 'Wed, 11 Sep 2019 18:32:06 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Nov 2019 06:56:22 GMT'}, {'version': 'v3', 'created': 'Fri, 26 Feb 2021 13:28:01 GMT'}]",2021-03-01,"[['Barreau', 'Baptiste', ''], ['Carlier', 'Laurent', ''], ['Challet', 'Damien', '']]","['investor activity prediction', 'deep learning', 'neural networks', 'mixture of experts', 'clustering']"
10824,1710.04476,Ketan Bacchuwar,"Ketan Bacchuwar (GE Healthcare, LIGM), Jean Cousty (LIGM), R\'egis
  Vaillant (GE Healthcare), Laurent Najman (LIGM)","VOIDD: automatic vessel of intervention dynamic detection in PCI
  procedures",,"CVII-Stent Workshop MICCAI 2017, Sep 2017, Quebec City, Canada. 26
  (6), pp.136 - 157, 2009",10.1109/MSP.2009.934154,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, we present the work towards improving the overall workflow
of the Percutaneous Coronary Interventions (PCI) procedures by capacitating the
imaging instruments to precisely monitor the steps of the procedure. In the
long term, such capabilities can be used to optimize the image acquisition to
reduce the amount of dose or contrast media employed during the procedure. We
present the automatic VOIDD algorithm to detect the vessel of intervention
which is going to be treated during the procedure by combining information from
the vessel image with contrast agent injection and images acquired during
guidewire tip navigation. Due to the robust guidewire tip segmentation method,
this algorithm is also able to automatically detect the sequence corresponding
to guidewire navigation. We present an evaluation methodology which
characterizes the correctness of the guide wire tip detection and correct
identification of the vessel navigated during the procedure. On a dataset of
2213 images from 8 sequences of 4 patients, VOIDD identifies
vessel-of-intervention with accuracy in the range of 88% or above and absence
of tip with accuracy in range of 98% or above depending on the test case.
","[{'version': 'v1', 'created': 'Thu, 12 Oct 2017 12:40:29 GMT'}]",2019-04-29,"[['Bacchuwar', 'Ketan', '', 'GE Healthcare, LIGM'], ['Cousty', 'Jean', '', 'LIGM'], ['Vaillant', 'Régis', '', 'GE Healthcare'], ['Najman', 'Laurent', '', 'LIGM']]","['Interventional cardiology', 'PCI procedure modeling', 'Imagefusion', 'coronary roadmap']"
10825,2110.11815,Neeraj Bokde PhD,"Mayur Kishor Shende and Andres E. Feijoo-Lorenzo and Neeraj Dhanraj
  Bokde","cleanTS: Automated (AutoML) Tool to Clean Univariate Time Series at
  Microscales","The cleanTS package is available in CRAN
  (https://cran.r-project.org/package=cleanTS)",,10.1016/j.neucom.2022.05.057,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data cleaning is one of the most important tasks in data analysis processes.
One of the perennial challenges in data analytics is the detection and handling
of non-valid data. Failing to do so can result in inaccurate analytics and
unreliable decisions. The process of properly cleaning such data takes much
time. Errors are prevalent in time series data. It is usually found that real
world data is unclean and requires some pre-processing. The analysis of large
amounts of data is difficult. This paper is intended to provide an easy to use
and reliable system which automates the cleaning process of univariate time
series data. Automating the process greatly reduces the time required.
Visualizing a large amount of data at once is not very effective. To tackle
this issue, an R package cleanTS is proposed. The proposed system provides a
way to analyze data on different scales and resolutions. Also, it provides
users with tools and a benchmark system for comparing various techniques used
in data cleaning.
","[{'version': 'v1', 'created': 'Fri, 22 Oct 2021 14:40:36 GMT'}]",2022-05-24,"[['Shende', 'Mayur Kishor', ''], ['Feijoo-Lorenzo', 'Andres E.', ''], ['Bokde', 'Neeraj Dhanraj', '']]","['Time Series Analysis', 'Time Series Cleaning', 'Data Cleaning', 'AutoML', 'Machine Learning']"
10826,2012.09542,Novanto Yudistira,"Novanto Yudistira, Muthu Subash Kavitha, Takio Kurita","Weakly-Supervised Action Localization and Action Recognition using
  Global-Local Attention of 3D CNN",,"International Journal of Computer Vision, 2022",10.1007/s11263-022-01649-x,,cs.CV cs.AI cs.NE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  3D Convolutional Neural Network (3D CNN) captures spatial and temporal
information on 3D data such as video sequences. However, due to the convolution
and pooling mechanism, the information loss seems unavoidable. To improve the
visual explanations and classification in 3D CNN, we propose two approaches; i)
aggregate layer-wise global to local (global-local) discrete gradients using
trained 3DResNext network, and ii) implement attention gating network to
improve the accuracy of the action recognition. The proposed approach intends
to show the usefulness of every layer termed as global-local attention in 3D
CNN via visual attribution, weakly-supervised action localization, and action
recognition. Firstly, the 3DResNext is trained and applied for action
classification using backpropagation concerning the maximum predicted class.
The gradients and activations of every layer are then up-sampled. Later,
aggregation is used to produce more nuanced attention, which points out the
most critical part of the predicted class's input videos. We use contour
thresholding of final attention for final localization. We evaluate spatial and
temporal action localization in trimmed videos using fine-grained visual
explanation via 3DCam. Experimental results show that the proposed approach
produces informative visual explanations and discriminative attention.
Furthermore, the action recognition via attention gating on each layer produces
better classification results than the baseline model.
","[{'version': 'v1', 'created': 'Thu, 17 Dec 2020 12:29:16 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Nov 2021 04:25:01 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Aug 2022 06:57:11 GMT'}]",2022-08-17,"[['Yudistira', 'Novanto', ''], ['Kavitha', 'Muthu Subash', ''], ['Kurita', 'Takio', '']]","['3D CNN', 'spatio-temporal attribution', 'visual attribution', 'weakly-supervised localization', 'action recognition']"
10827,2001.09094,Yuan Li,"Yuan Li, Frank Ingram and Huaming Zhang",Certificate complexity and symmetry of nested canalizing functions,14 pages,"Discrete Mathematics & Theoretical Computer Science, vol. 23, no.
  3, Combinatorics (November 26, 2021) dmtcs:8754",10.46298/dmtcs.6191,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Boolean nested canalizing functions (NCFs) have important applications in
molecular regulatory networks, engineering and computer science. In this paper,
we study their certificate complexity. For both Boolean values $b\in\{0,1\}$,
we obtain a formula for $b$-certificate complexity and consequently, we develop
a direct proof of the certificate complexity formula of an NCF. Symmetry is
another interesting property of Boolean functions and we significantly simplify
the proofs of some recent theorems about partial symmetry of NCFs. We also
describe the algebraic normal form of $s$-symmetric NCFs. We obtain the general
formula of the cardinality of the set of $n$-variable $s$-symmetric Boolean
NCFs for $s=1,\dots,n$. In particular, we enumerate the strongly asymmetric
Boolean NCFs.
","[{'version': 'v1', 'created': 'Fri, 24 Jan 2020 16:59:31 GMT'}, {'version': 'v2', 'created': 'Sat, 7 Mar 2020 18:44:44 GMT'}, {'version': 'v3', 'created': 'Mon, 27 Jul 2020 20:05:23 GMT'}, {'version': 'v4', 'created': 'Fri, 19 Feb 2021 21:08:11 GMT'}, {'version': 'v5', 'created': 'Sat, 14 Aug 2021 14:50:32 GMT'}, {'version': 'v6', 'created': 'Tue, 23 Nov 2021 21:30:25 GMT'}]",2021-12-11,"[['Li', 'Yuan', ''], ['Ingram', 'Frank', ''], ['Zhang', 'Huaming', '']]","['Boolean Function', 'Nested Canalizing Function', 'Layer Structure', 'Sensitivity', 'Certificate Complexity', 'Symmetry', 'Partial Symmetry']"
10828,2201.07986,Sixiao Zhang,"Sixiao Zhang, Hongxu Chen, Xiangguo Sun, Yicong Li, Guandong Xu","Unsupervised Graph Poisoning Attack via Contrastive Loss
  Back-propagation",,,10.1145/3485447.3512179,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph contrastive learning is the state-of-the-art unsupervised graph
representation learning framework and has shown comparable performance with
supervised approaches. However, evaluating whether the graph contrastive
learning is robust to adversarial attacks is still an open problem because most
existing graph adversarial attacks are supervised models, which means they
heavily rely on labels and can only be used to evaluate the graph contrastive
learning in a specific scenario. For unsupervised graph representation methods
such as graph contrastive learning, it is difficult to acquire labels in
real-world scenarios, making traditional supervised graph attack methods
difficult to be applied to test their robustness. In this paper, we propose a
novel unsupervised gradient-based adversarial attack that does not rely on
labels for graph contrastive learning. We compute the gradients of the
adjacency matrices of the two views and flip the edges with gradient ascent to
maximize the contrastive loss. In this way, we can fully use multiple views
generated by the graph contrastive learning models and pick the most
informative edges without knowing their labels, and therefore can promisingly
support our model adapted to more kinds of downstream tasks. Extensive
experiments show that our attack outperforms unsupervised baseline attacks and
has comparable performance with supervised attacks in multiple downstream tasks
including node classification and link prediction. We further show that our
attack can be transferred to other graph representation models as well.
","[{'version': 'v1', 'created': 'Thu, 20 Jan 2022 03:32:21 GMT'}, {'version': 'v2', 'created': 'Sat, 22 Jan 2022 09:38:15 GMT'}, {'version': 'v3', 'created': 'Thu, 27 Jan 2022 01:38:00 GMT'}]",2022-01-28,"[['Zhang', 'Sixiao', ''], ['Chen', 'Hongxu', ''], ['Sun', 'Xiangguo', ''], ['Li', 'Yicong', ''], ['Xu', 'Guandong', '']]","['Graph Representation Learning', 'Graph Contrastive Learning', 'Adversarial Attack']"
10829,2204.06934,Michael Beukman,Michael Beukman and Christopher W Cleghorn and Steven James,"Procedural Content Generation using Neuroevolution and Novelty Search
  for Diverse Video Game Levels","Accepted to the Genetic and Evolutionary Computation Conference
  (GECCO '22), July 9--13, 2022, Boston, MA, USA. Code is located at
  https://github.com/Michael-Beukman/PCGNN",,10.1145/3512290.3528701,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Procedurally generated video game content has the potential to drastically
reduce the content creation budget of game developers and large studios.
However, adoption is hindered by limitations such as slow generation, as well
as low quality and diversity of content. We introduce an evolutionary
search-based approach for evolving level generators using novelty search to
procedurally generate diverse levels in real time, without requiring training
data or detailed domain-specific knowledge. We test our method on two domains,
and our results show an order of magnitude speedup in generation time compared
to existing methods while obtaining comparable metric scores. We further
demonstrate the ability to generalise to arbitrary-sized levels without
retraining.
","[{'version': 'v1', 'created': 'Thu, 14 Apr 2022 12:54:32 GMT'}]",2022-04-15,"[['Beukman', 'Michael', ''], ['Cleghorn', 'Christopher W', ''], ['James', 'Steven', '']]","['Neuroevolution', 'Novelty Search', 'Procedural Content Generation']"
10830,1506.04205,\'Eric Tanter,\'Eric Tanter and Nicolas Tabareau,Gradual Certified Programming in Coq,"DLS'15 final version, Proceedings of the ACM Dynamic Languages
  Symposium (DLS 2015)",,10.1145/2816707.2816710,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Expressive static typing disciplines are a powerful way to achieve
high-quality software. However, the adoption cost of such techniques should not
be under-estimated. Just like gradual typing allows for a smooth transition
from dynamically-typed to statically-typed programs, it seems desirable to
support a gradual path to certified programming. We explore gradual certified
programming in Coq, providing the possibility to postpone the proofs of
selected properties, and to check ""at runtime"" whether the properties actually
hold. Casts can be integrated with the implicit coercion mechanism of Coq to
support implicit cast insertion a la gradual typing. Additionally, when
extracting Coq functions to mainstream languages, our encoding of casts
supports lifting assumed properties into runtime checks. Much to our surprise,
it is not necessary to extend Coq in any way to support gradual certified
programming. A simple mix of type classes and axioms makes it possible to bring
gradual certified programming to Coq in a straightforward manner.
","[{'version': 'v1', 'created': 'Sat, 13 Jun 2015 00:45:35 GMT'}, {'version': 'v2', 'created': 'Sat, 22 Aug 2015 12:51:40 GMT'}]",2015-08-25,"[['Tanter', 'Éric', ''], ['Tabareau', 'Nicolas', '']]","['Certified programming', 'refinements', 'subset types', 'gradual typing', 'casts', 'program extraction', 'Coq']"
10831,2201.08005,Giulia Preti,"Giulia Preti, Gianmarco De Francisci Morales, Francesco Bonchi",FreSCo: Mining Frequent Patterns in Simplicial Complexes,To appear at The Web Conference 2022,,10.1145/3485447.3512191,,cs.DS cs.SI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Simplicial complexes are a generalization of graphs that model higher-order
relations. In this paper, we introduce simplicial patterns -- that we call
simplets -- and generalize the task of frequent pattern mining from the realm
of graphs to that of simplicial complexes. Our task is particularly challenging
due to the enormous search space and the need for higher-order isomorphism. We
show that finding the occurrences of simplets in a complex can be reduced to a
bipartite graph isomorphism problem, in linear time and at most quadratic
space. We then propose an anti-monotonic frequency measure that allows us to
start the exploration from small simplets and stop expanding a simplet as soon
as its frequency falls below the minimum frequency threshold. Equipped with
these ideas and a clever data structure, we develop a memory-conscious
algorithm that, by carefully exploiting the relationships among the simplices
in the complex and among the simplets, achieves efficiency and scalability for
our complex mining task. Our algorithm, FreSCo, comes in two flavors: it can
compute the exact frequency of the simplets or, more quickly, it can determine
whether a simplet is frequent, without having to compute the exact frequency.
Experimental results prove the ability of FreSCo to mine frequent simplets in
complexes of various size and dimension, and the significance of the simplets
with respect to the traditional graph patterns.
","[{'version': 'v1', 'created': 'Thu, 20 Jan 2022 05:16:03 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Jan 2022 10:11:26 GMT'}]",2022-01-27,"[['Preti', 'Giulia', ''], ['Morales', 'Gianmarco De Francisci', ''], ['Bonchi', 'Francesco', '']]","['Frequent pattern mining', 'simplicial complex', 'higher order patterns']"
10832,2110.12477,Xinyu Liu,"Xinyu Liu, Baopu Li, Zhen Chen, Yixuan Yuan",Exploring Gradient Flow Based Saliency for DNN Model Compression,ACM Multimedia 2021 (ACM MM'21),,10.1145/3474085.3475474,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Model pruning aims to reduce the deep neural network (DNN) model size or
computational overhead. Traditional model pruning methods such as l-1 pruning
that evaluates the channel significance for DNN pay too much attention to the
local analysis of each channel and make use of the magnitude of the entire
feature while ignoring its relevance to the batch normalization (BN) and ReLU
layer after each convolutional operation. To overcome these problems, we
propose a new model pruning method from a new perspective of gradient flow in
this paper. Specifically, we first theoretically analyze the channel's
influence based on Taylor expansion by integrating the effects of BN layer and
ReLU activation function. Then, the incorporation of the first-order Talyor
polynomial of the scaling parameter and the shifting parameter in the BN layer
is suggested to effectively indicate the significance of a channel in a DNN.
Comprehensive experiments on both image classification and image denoising
tasks demonstrate the superiority of the proposed novel theory and scheme. Code
is available at https://github.com/CityU-AIM-Group/GFBS.
","[{'version': 'v1', 'created': 'Sun, 24 Oct 2021 16:09:40 GMT'}]",2021-10-26,"[['Liu', 'Xinyu', ''], ['Li', 'Baopu', ''], ['Chen', 'Zhen', ''], ['Yuan', 'Yixuan', '']]","['model pruning', 'convolutional neural networks', 'channel saliency']"
10833,2009.14452,Marco Pegoraro,"Marco Pegoraro, Merih Seran Uysal, Wil M.P. van der Aalst",Conformance Checking over Uncertain Event Data,"39 pages, 12 figures, 10 tables, 44 references. arXiv admin note:
  text overlap with arXiv:1910.00089",Information Systems 102 (2021) 101810,10.1016/j.is.2021.101810,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The strong impulse to digitize processes and operations in companies and
enterprises have resulted in the creation and automatic recording of an
increasingly large amount of process data in information systems. These are
made available in the form of event logs. Process mining techniques enable the
process-centric analysis of data, including automatically discovering process
models and checking if event data conform to a given model. In this paper, we
analyze the previously unexplored setting of uncertain event logs. In such
event logs uncertainty is recorded explicitly, i.e., the time, activity and
case of an event may be unclear or imprecise. In this work, we define a
taxonomy of uncertain event logs and models, and we examine the challenges that
uncertainty poses on process discovery and conformance checking. Finally, we
show how upper and lower bounds for conformance can be obtained by aligning an
uncertain trace onto a regular process model.
","[{'version': 'v1', 'created': 'Tue, 29 Sep 2020 14:27:30 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Nov 2020 10:33:21 GMT'}, {'version': 'v3', 'created': 'Fri, 8 Apr 2022 09:16:02 GMT'}]",2022-04-11,"[['Pegoraro', 'Marco', ''], ['Uysal', 'Merih Seran', ''], ['van der Aalst', 'Wil M. P.', '']]","['Process Mining', 'Uncertain Data', 'Partial Order']"
10834,1703.10674,Arnaud Blouin,Arnaud Blouin and Val\'eria Lelli and Benoit Baudry and Fabien Coulon,"User Interface Design Smell: Automatic Detection and Refactoring of Blob
  Listeners",18 pages. arXiv admin note: text overlap with arXiv:1703.08803,"Information and Software Technology, 2018",10.1016/j.infsof.2018.05.005,,cs.SE cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  User Interfaces (UIs) intensively rely on event-driven programming: widgets
send UI events, which capture users' interactions, to dedicated objects called
controllers. Controllers use several UI listeners that handle these events to
produce UI commands. First, we reveal the presence of design smells in the code
that describes and controls UIs. Second, we demonstrate that specific code
analyses are necessary to analyze and refactor UI code, because of its coupling
with the rest of the code. We conducted an empirical study on four large Java
Swing and SWT open-source software systems. We study to what extent the number
of UI commands that a UI listener can produce has an impact on the change- and
fault-proneness of the UI listener code. We develop a static code analysis for
detecting UI commands in the code. We identify a new type of design smell,
called Blob Listener that characterizes UI listeners that can produce more than
two UI commands. We propose a systematic static code analysis procedure that
searches for Blob Listeners that we implement in InspectorGuidget. We conducted
experiments on the four software systems for which we manually identified 53
instances of Blob Listener. InspectorGuidget successfully detected 52 Blob
Listeners out of 53. The results exhibit a precision of 81.25% and a recall of
98.11%. We then developed a semi-automatically and behavior-preserving
refactoring process to remove Blob Listeners. 49.06% of the 53 Blob Listeners
were automatically refactored. Patches for JabRef, and FreeCol have been
accepted and merged. Discussions with developers of the four software systems
assess the relevance of the Blob Listener. This work shows that UI code also
suffers from design smells that have to be identified and characterized. We
argue that studies have to be conducted to find other UI design smells and
tools that analyze UI code must be developed.
","[{'version': 'v1', 'created': 'Thu, 30 Mar 2017 21:01:22 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Apr 2017 08:31:05 GMT'}, {'version': 'v3', 'created': 'Fri, 25 May 2018 07:36:50 GMT'}]",2018-05-29,"[['Blouin', 'Arnaud', ''], ['Lelli', 'Valéria', ''], ['Baudry', 'Benoit', ''], ['Coulon', 'Fabien', '']]","['User interface', 'Event Handling', 'Design smell', 'Software maintenance', 'Code refactoring', 'Empirical software engineering']"
10835,1806.07705,Zuzana Majdisova,Zuzana Majdisova and Vaclav Skala,Radial Basis Function Approximations: Comparison and Applications,,"Applied Mathematical Modelling, Vol.51, pp.728-743, ISSN
  0307-904X, Elsevier, November 2017",10.1016/j.apm.2017.07.033,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Approximation of scattered data is often a task in many engineering problems.
The Radial Basis Function (RBF) approximation is appropriate for large
scattered (unordered) datasets in d-dimensional space. This approach is useful
for a higher dimension d>2, because the other methods require the conversion of
a scattered dataset to an ordered dataset (i.e. a semi-regular mesh is obtained
by using some tessellation techniques), which is computationally expensive. The
RBF approximation is non-separable, as it is based on the distance between two
points. This method leads to a solution of Linear System of Equations (LSE)
Ac=h.
  In this paper several RBF approximation methods are briefly introduced and a
comparison of those is made with respect to the stability and accuracy of
computation. The proposed RBF approximation offers lower memory requirements
and better quality of approximation.
","[{'version': 'v1', 'created': 'Wed, 20 Jun 2018 13:06:35 GMT'}]",2018-06-21,"[['Majdisova', 'Zuzana', ''], ['Skala', 'Vaclav', '']]","['radial basis function', 'RBF', 'approximation', 'Lagrange multipliers']"
10836,2207.01674,Sibo Dong,"Sibo Dong, Justin Goldstein, Grace Hui Yang","GazBy: Gaze-Based BERT Model to Incorporate Human Attention in Neural
  Information Retrieval",,,10.1145/3539813.3545129,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is interested in investigating whether human gaze signals can be
leveraged to improve state-of-the-art search engine performance and how to
incorporate this new input signal marked by human attention into existing
neural retrieval models. In this paper, we propose GazBy ({\bf Gaz}e-based {\bf
B}ert model for document relevanc{\bf y}), a light-weight joint model that
integrates human gaze fixation estimation into transformer models to predict
document relevance, incorporating more nuanced information about cognitive
processing into information retrieval (IR). We evaluate our model on the Text
Retrieval Conference (TREC) Deep Learning (DL) 2019 and 2020 Tracks. Our
experiments show encouraging results and illustrate the effective and
ineffective entry points for using human gaze to help with transformer-based
neural retrievers. With the rise of virtual reality (VR) and augmented reality
(AR), human gaze data will become more available. We hope this work serves as a
first step exploring using gaze signals in modern neural search engines.
","[{'version': 'v1', 'created': 'Mon, 4 Jul 2022 18:50:48 GMT'}]",2022-07-06,"[['Dong', 'Sibo', ''], ['Goldstein', 'Justin', ''], ['Yang', 'Grace Hui', '']]","['Neural information retrieval', 'Gaze', 'Human attention', 'BERT', 'Transformer']"
10837,1908.05823,Meng Tang S,"Meng Tang, Yimin Liu, Louis J. Durlofsky","A deep-learning-based surrogate model for data assimilation in dynamic
  subsurface flow problems",,,10.1016/j.jcp.2020.109456,,cs.LG physics.comp-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A deep-learning-based surrogate model is developed and applied for predicting
dynamic subsurface flow in channelized geological models. The surrogate model
is based on deep convolutional and recurrent neural network architectures,
specifically a residual U-Net and a convolutional long short term memory
recurrent network. Training samples entail global pressure and saturation maps,
at a series of time steps, generated by simulating oil-water flow in many (1500
in our case) realizations of a 2D channelized system. After training, the
`recurrent R-U-Net' surrogate model is shown to be capable of accurately
predicting dynamic pressure and saturation maps and well rates (e.g.,
time-varying oil and water rates at production wells) for new geological
realizations. Assessments demonstrating high surrogate-model accuracy are
presented for an individual geological realization and for an ensemble of 500
test geomodels. The surrogate model is then used for the challenging problem of
data assimilation (history matching) in a channelized system. For this study,
posterior reservoir models are generated using the randomized maximum
likelihood method, with the permeability field represented using the recently
developed CNN-PCA parameterization. The flow responses required during the data
assimilation procedure are provided by the recurrent R-U-Net. The overall
approach is shown to lead to substantial reduction in prediction uncertainty.
High-fidelity numerical simulation results for the posterior geomodels
(generated by the surrogate-based data assimilation procedure) are shown to be
in essential agreement with the recurrent R-U-Net predictions. The accuracy and
dramatic speedup provided by the surrogate model suggest that it may eventually
enable the application of more formal posterior sampling methods in realistic
problems.
","[{'version': 'v1', 'created': 'Fri, 16 Aug 2019 03:02:34 GMT'}]",2020-05-20,"[['Tang', 'Meng', ''], ['Liu', 'Yimin', ''], ['Durlofsky', 'Louis J.', '']]","['surrogate model', 'deep-learning', 'reservoir simulation', 'history matching', 'inverse']"
10838,2102.00881,"G\""ul\c{s}en Eryi\u{g}it","G\""ul\c{s}en Eryi\u{g}it, Ali \c{S}enta\c{s}, Johanna Monti",Gamified Crowdsourcing for Idiom Corpora Construction,"25 pages, 8 figures, 6 tables","Natural Language Engineering, Cambridge Press, 2022",10.1017/S1351324921000401,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning idiomatic expressions is seen as one of the most challenging stages
in second language learning because of their unpredictable meaning. A similar
situation holds for their identification within natural language processing
applications such as machine translation and parsing. The lack of high-quality
usage samples exacerbates this challenge not only for humans but also for
artificial intelligence systems. This article introduces a gamified
crowdsourcing approach for collecting language learning materials for idiomatic
expressions; a messaging bot is designed as an asynchronous multiplayer game
for native speakers who compete with each other while providing idiomatic and
nonidiomatic usage examples and rating other players' entries. As opposed to
classical crowdprocessing annotation efforts in the field, for the first time
in the literature, a crowdcreating & crowdrating approach is implemented and
tested for idiom corpora construction. The approach is language independent and
evaluated on two languages in comparison to traditional data preparation
techniques in the field. The reaction of the crowd is monitored under different
motivational means (namely, gamification affordances and monetary rewards). The
results reveal that the proposed approach is powerful in collecting the
targeted materials, and although being an explicit crowdsourcing approach, it
is found entertaining and useful by the crowd. The approach has been shown to
have the potential to speed up the construction of idiom corpora for different
natural languages to be used as second language learning material, training
data for supervised idiom identification systems, or samples for lexicographic
studies.
","[{'version': 'v1', 'created': 'Mon, 1 Feb 2021 14:44:43 GMT'}]",2022-01-21,"[['Eryiğit', 'Gülşen', ''], ['Şentaş', 'Ali', ''], ['Monti', 'Johanna', '']]","['crowdsourcing', 'gamification', 'game with a purpose (GWAP)', 'idiomatic expressions', 'language resources']"
10839,2107.03761,Akhila Sri Manasa Venigalla,"Akhila Sri Manasa Venigalla, Kowndinya Boyalakunta and Sridhar
  Chimalakonda",GitQ- Towards Using Badges as Visual Cues for GitHub Projects,"5 pages, 3 figures",,10.1145/3524610.3527876,,cs.SE cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  GitHub hosts millions of software repositories, facilitating developers to
contribute to many projects in multiple ways. Most of the information about the
repositories is text-based in the form of stars, forks, commits, and so on.
However, developers willing to contribute to projects on GitHub often find it
challenging to select appropriate projects to contribute to or reuse due to the
large number of repositories present on GitHub. Further, obtaining this
required information often becomes a tedious process, as one has to carefully
mine information hidden inside the repository. To alleviate the effort
intensive mining procedures, researchers have proposed npm-badges to outline
information relating to build status of a project. However, these badges are
static and limit their usage to package dependency and build details. Adding
visual cues such as badges to the repositories might reduce the search space
for developers. Hence, we present GitQ, to automatically augment GitHub
repositories with badges representing information about source code and project
maintenance. Presenting GitQ as a browser plugin to GitHub could make it easily
accessible to developers using GitHub. GitQ is evaluated with 15 developers
based on the UTAUT model to understand developer perception towards its
usefulness. We observed that 11 out of 15 developers perceived GitQ to be
useful in identifying the right set of repositories using visual cues such as
generated by GitQ. The source code and tool are available for download on
GitHub at https://github.com/gitq-for-github/plugin, and the demo can be found
at https://youtu.be/c0yohmIat3A.
","[{'version': 'v1', 'created': 'Thu, 8 Jul 2021 11:11:48 GMT'}, {'version': 'v2', 'created': 'Mon, 2 May 2022 17:26:47 GMT'}]",2022-05-03,"[['Venigalla', 'Akhila Sri Manasa', ''], ['Boyalakunta', 'Kowndinya', ''], ['Chimalakonda', 'Sridhar', '']]","['software quality', 'quality badges', 'ck metrics', 'github repositories']"
10840,1606.02617,Aleksander Lodwich,"Aleksander Lodwich, Faisal Shafait and Thomas Breuel",Efficient Estimation of k for the Nearest Neighbors Class of Methods,"Technical Report, 16p, alternative source:
  http://lodwich.net/Science.html",,10.13140/RG.2.1.5045.4649,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The k Nearest Neighbors (kNN) method has received much attention in the past
decades, where some theoretical bounds on its performance were identified and
where practical optimizations were proposed for making it work fairly well in
high dimensional spaces and on large datasets. From countless experiments of
the past it became widely accepted that the value of k has a significant impact
on the performance of this method. However, the efficient optimization of this
parameter has not received so much attention in literature. Today, the most
common approach is to cross-validate or bootstrap this value for all values in
question. This approach forces distances to be recomputed many times, even if
efficient methods are used. Hence, estimating the optimal k can become
expensive even on modern systems. Frequently, this circumstance leads to a
sparse manual search of k. In this paper we want to point out that a systematic
and thorough estimation of the parameter k can be performed efficiently. The
discussed approach relies on large matrices, but we want to argue, that in
practice a higher space complexity is often much less of a problem than
repetitive distance computations.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2016 16:11:53 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Jun 2016 11:34:59 GMT'}]",2016-06-14,"[['Lodwich', 'Aleksander', ''], ['Shafait', 'Faisal', ''], ['Breuel', 'Thomas', '']]","['nearest neighbor', 'optimization', 'benchmarking']"
10841,2104.02262,Qiang Cui,"Qiang Cui, Chenrui Zhang, Yafeng Zhang, Jinpeng Wang, Mingchen Cai","ST-PIL: Spatial-Temporal Periodic Interest Learning for Next
  Point-of-Interest Recommendation",,,10.1145/3459637.3482189,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Point-of-Interest (POI) recommendation is an important task in location-based
social networks. It facilitates the relation modeling between users and
locations. Recently, researchers recommend POIs by long- and short-term
interests and achieve success. However, they fail to well capture the periodic
interest. People tend to visit similar places at similar times or in similar
areas. Existing models try to acquire such kind of periodicity by user's
mobility status or time slot, which limits the performance of periodic
interest. To this end, we propose to learn spatial-temporal periodic interest.
Specifically, in the long-term module, we learn the temporal periodic interest
of daily granularity, then utilize intra-level attention to form long-term
interest. In the short-term module, we construct various short-term sequences
to acquire the spatial-temporal periodic interest of hourly, areal, and
hourly-areal granularities, respectively. Finally, we apply inter-level
attention to automatically integrate multiple interests. Experiments on two
real-world datasets demonstrate the state-of-the-art performance of our method.
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2021 03:08:27 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Sep 2021 11:39:35 GMT'}]",2021-09-17,"[['Cui', 'Qiang', ''], ['Zhang', 'Chenrui', ''], ['Zhang', 'Yafeng', ''], ['Wang', 'Jinpeng', ''], ['Cai', 'Mingchen', '']]","['spatial-temporal', 'periodic', 'point-of-interest']"
10842,2210.03154,Loukas Ilias,"Konstantinos Psychogyios, Loukas Ilias, Dimitris Askounis","Comparison of Missing Data Imputation Methods using the Framingham Heart
  study dataset","2022 IEEE EMBS International Conference on Biomedical & Health
  Informatics (BHI)",,10.1109/BHI56158.2022.9926882,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Cardiovascular disease (CVD) is a class of diseases that involve the heart or
blood vessels and according to World Health Organization is the leading cause
of death worldwide. EHR data regarding this case, as well as medical cases in
general, contain missing values very frequently. The percentage of missingness
may vary and is linked with instrument errors, manual data entry procedures,
etc. Even though the missing rate is usually significant, in many cases the
missing value imputation part is handled poorly either with case-deletion or
with simple statistical approaches such as mode and median imputation. These
methods are known to introduce significant bias, since they do not account for
the relationships between the dataset's variables. Within the medical
framework, many datasets consist of lab tests or patient medical tests, where
these relationships are present and strong. To address these limitations, in
this paper we test and modify state-of-the-art missing value imputation methods
based on Generative Adversarial Networks (GANs) and Autoencoders. The
evaluation is accomplished for both the tasks of data imputation and
post-imputation prediction. Regarding the imputation task, we achieve
improvements of 0.20, 7.00% in normalised Root Mean Squared Error (RMSE) and
Area Under the Receiver Operating Characteristic Curve (AUROC) respectively. In
terms of the post-imputation prediction task, our models outperform the
standard approaches by 2.50% in F1-score.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2022 18:35:08 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Oct 2022 07:22:00 GMT'}]",2022-11-08,"[['Psychogyios', 'Konstantinos', ''], ['Ilias', 'Loukas', ''], ['Askounis', 'Dimitris', '']]","['taspsychogios@gmail.com', '{lilias', 'askous}@epu.ntua']"
10843,2110.05858,Sascha El-Sharkawy,"Christian Kr\""oher, Sascha El-Sharkawy, Klaus Schmid","KernelHaven -- An Experimentation Workbench for Analyzing Software
  Product Lines",Video: https://youtu.be/IbNc-H1NoZU,"Proceedings of the 40th International Conference on Software
  Engineering (ICSE '18) - Companion Proceeedings, 2018, pages 73-76",10.1145/3183440.3183480,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Systematic exploration of hypotheses is a major part of any empirical
research. In software engineering, we often produce unique tools for
experiments and evaluate them independently on different data sets. In this
paper, we present KernelHaven as an experimentation workbench supporting a
significant number of experiments in the domain of static product line analysis
and verification. It addresses the need for extracting information from a
variety of artifacts in this domain by means of an open plug-in infrastructure.
Available plug-ins encapsulate existing tools, which can now be combined
efficiently to yield new analyses. As an experimentation workbench, it provides
configuration-based definitions of experiments, their documentation, and
technical services, like parallelization and caching. Hence, researchers can
abstract from technical details and focus on the algorithmic core of their
research problem.
  KernelHaven supports different types of analyses, like correctness checks,
metrics, etc., in its specific domain. The concepts presented in this paper can
also be transferred to support researchers of other software engineering
domains. The infrastructure is available under Apache 2.0:
https://github.com/KernelHaven. The plug-ins are available under their
individual licenses.
","[{'version': 'v1', 'created': 'Tue, 12 Oct 2021 09:47:08 GMT'}]",2021-10-13,"[['Kröher', 'Christian', ''], ['El-Sharkawy', 'Sascha', ''], ['Schmid', 'Klaus', '']]","['Software product line analysis', 'variability extraction', 'static analysis', 'empirical software engineering']"
10844,2011.05822,Tobias Scheck,"Tobias Scheck, Adarsh Mallandur, Christian Wiede, Gangolf Hirtz",Where to drive: free space detection with one fisheye camera,"Accepted at International Conference on Machine Vision 2019 (ICMV
  2019)","Proceedings Volume 11433, Twelfth International Conference on
  Machine Vision (ICMV 2019); 114332V",10.1117/12.2556380,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The development in the field of autonomous driving goes hand in hand with
ever new developments in the field of image processing and machine learning
methods. In order to fully exploit the advantages of deep learning, it is
necessary to have sufficient labeled training data available. This is
especially not the case for omnidirectional fisheye cameras. As a solution, we
propose in this paper to use synthetic training data based on Unity3D. A
five-pass algorithm is used to create a virtual fisheye camera. This synthetic
training data is evaluated for the application of free space detection for
different deep learning network architectures. The results indicate that
synthetic fisheye images can be used in deep learning context.
","[{'version': 'v1', 'created': 'Wed, 11 Nov 2020 14:36:45 GMT'}]",2020-11-12,"[['Scheck', 'Tobias', ''], ['Mallandur', 'Adarsh', ''], ['Wiede', 'Christian', ''], ['Hirtz', 'Gangolf', '']]","['Free Space Detection', 'Fisheye Camera', 'Deep Learning', 'CNN', 'Synthetic Data Creation']"
10845,2211.14222,Sizhe Yuen,"Sizhe Yuen, Thomas H.G. Ezard, Adam J. Sobey","The Effect of Epigenetic Blocking on Dynamic Multi-Objective
  Optimisation Problems","Published in GECCO '22: Proceedings of the Genetic and Evolutionary
  Computation Conference Companion",,10.1145/3520304.3529022,,cs.NE cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Hundreds of Evolutionary Computation approaches have been reported. From an
evolutionary perspective they focus on two fundamental mechanisms: cultural
inheritance in Swarm Intelligence and genetic inheritance in Evolutionary
Algorithms. Contemporary evolutionary biology looks beyond genetic inheritance,
proposing a so-called ``Extended Evolutionary Synthesis''. Many concepts from
the Extended Evolutionary Synthesis have been left out of Evolutionary
Computation as interest has moved toward specific implementations of the same
general mechanisms. One such concept is epigenetic inheritance, which is
increasingly considered central to evolutionary thinking. Epigenetic mechanisms
allow quick non- or partially-genetic adaptations to environmental changes.
Dynamic multi-objective optimisation problems represent similar circumstances
to the natural world where fitness can be determined by multiple objectives
(traits), and the environment is constantly changing.
  This paper asks if the advantages that epigenetic inheritance provide in the
natural world are replicated in dynamic multi-objective optimisation problems.
Specifically, an epigenetic blocking mechanism is applied to a state-of-the-art
multi-objective genetic algorithm, MOEA/D-DE, and its performance is compared
on three sets of dynamic test functions, FDA, JY, and UDF. The mechanism shows
improved performance on 12 of the 16 test problems, providing initial evidence
that more algorithms should explore the wealth of epigenetic mechanisms seen in
the natural world.
","[{'version': 'v1', 'created': 'Fri, 25 Nov 2022 16:33:05 GMT'}]",2022-11-28,"[['Yuen', 'Sizhe', ''], ['Ezard', 'Thomas H. G.', ''], ['Sobey', 'Adam J.', '']]","['Genetic algorithms', 'multi-objective optimisation', 'dynamic optimisation', 'epigenetics']"
10846,2005.03398,Olaf Ambrozkiewicz,"Olaf Ambrozkiewicz, Benedikt Kriegesmann","Simultaneous topology and fastener layout optimization of assemblies
  considering joint failure",Preprint submitted for review,,10.1002/nme.6538,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper provides a method for the simultaneous topology optimization of
parts and their corresponding joint locations in an assembly. Therein, the
joint locations are not discrete and predefined, but continuously movable. The
underlying coupling equations allow for connecting dissimilar meshes and avoid
the need for remeshing when joint locations change. The presented method models
the force transfer at a joint location not only by using single spring elements
but accounts for the size and type of the joints. When considering riveted or
bolted joints, the local part geometry at the joint location consists of holes
that are surrounded by material. For spot welds, the joint locations are filled
with material and may be smaller than for bolts. The presented method
incorporates these material and clearance zones into the simultaneously running
topology optimization of the parts. Furthermore, failure of joints may be taken
into account at the optimization stage, yielding assemblies connected in a
fail-safe manner.
","[{'version': 'v1', 'created': 'Thu, 7 May 2020 11:57:25 GMT'}]",2020-09-14,"[['Ambrozkiewicz', 'Olaf', ''], ['Kriegesmann', 'Benedikt', '']]","['topology optimization', 'joint optimization', 'fail-safe']"
10847,2101.10087,Will Crichton,"Will Crichton, Georgia Gabriela Sampaio, Pat Hanrahan",Automating Program Structure Classification,To appear at SIGCSE 2021,,10.1145/3408877.3432358,,cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When students write programs, their program structure provides insight into
their learning process. However, analyzing program structure by hand is
time-consuming, and teachers need better tools for computer-assisted
exploration of student solutions. As a first step towards an education-oriented
program analysis toolkit, we show how supervised machine learning methods can
automatically classify student programs into a predetermined set of high-level
structures. We evaluate two models on classifying student solutions to the
Rainfall problem: a nearest-neighbors classifier using syntax tree edit
distance and a recurrent neural network. We demonstrate that these models can
achieve 91% classification accuracy when trained on 108 programs. We further
explore the generality, trade-offs, and failure cases of each model.
","[{'version': 'v1', 'created': 'Fri, 15 Jan 2021 21:24:37 GMT'}]",2021-01-26,"[['Crichton', 'Will', ''], ['Sampaio', 'Georgia Gabriela', ''], ['Hanrahan', 'Pat', '']]","['Program classification', 'machine learning', 'neural networks']"
10848,2109.00198,Benzar Glen Grepon,"Benzar Glen S. Grepon, Ni\~no T. Baran, Kenn Migan Vincent C. Gumonan,
  Aldwin Lester M. Martinez and Mona Liel E. Lacsa","Designing and Implementing e-School Systems: An Information Systems
  Approach to School Management of a Community College in Northern Mindanao,
  Philippines",17 pages,"International Journal of Computing Sciences Research, v.5, n.1,
  Sep. 2021",10.25147/ijcsr.2017.001.1.74,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Colleges and Universities have been established to provide educational
services to the people. Like any other organization, the school has processes
and procedures similar to business or industry that involve admissions,
processing of data, and generation of reports. Those processes are made
possible through a centralized system in storing, processing, and retrieval of
data and information. The absence of a computer system and the complexity of
the transactions of the college which makes the personnel be loaded with paper
works in storing and keeping student records and information is the motivating
factor why the School Management Information System has been designed and
developed for a community college in the northern part of Mindanao. This paper
discusses the Major Functionalities and Modules of the system through its
implementation methodology which is the Agile Model and its impact on the
delivery of services and procedures in the overall operation of the college.
The project has been evaluated based on ISO 25010, a quality model used for
product/software quality evaluation systems. Based on the results of the
evaluation, SMIS has been Functional, Usable, and Reliable with an average for
every criterion above 4.04 indicating very good performance based on a Likert
scale descriptive interpretation. Based on the preceding findings of the study,
the respondents agreed that the developed e-school system was functional and
lifted the transaction process of the school. The overall quality and
performance of the system was very good in terms of functionality, usability,
and reliability. It is recommended that future development such as the
smartphone and tablet-based attendance monitoring should be integrated, a kiosk
for grades and schedule viewing should also be placed inside the campus that is
connected to the database server.
","[{'version': 'v1', 'created': 'Wed, 1 Sep 2021 05:53:35 GMT'}]",2021-09-02,"[['Grepon', 'Benzar Glen S.', ''], ['Baran', 'Niño T.', ''], ['Gumonan', 'Kenn Migan Vincent C.', ''], ['Martinez', 'Aldwin Lester M.', ''], ['Lacsa', 'Mona Liel E.', '']]","['school management system', 'electronic school system', 'management information system', 'higher education institution', 'Philippines']"
10849,2204.01285,Lucas Gren,Lucas Gren and Martin Shepperd,"Problem reports and team maturity in agile automotive software
  development",5 pages,"5th International Conference on Cooperative and Human Aspects of
  Software Engineering (CHASE2022)",10.1145/3528579.3529173,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Background: Volvo Cars is pioneering an agile transformation on a large scale
in the automotive industry. Social psychological aspects of automotive software
development are an under-researched area in general. Few studies on team
maturity or group dynamics can be found specifically in the automotive software
engineering domain. Objective: This study is intended as an initial step to
fill that gap by investigating the connection between issues and problem
reports and team maturity. Method: We conducted a quantitative study with 84
participants from 14 teams and qualitatively validated the result with the
Release Train Engineer having an overview of all the participating teams.
Results: We find that the more mature a team is, the faster they seem to
resolve issues as provided through external feedback, at least in the two
initial team maturity stages. Conclusion: This study suggests that working on
team dynamics might increase productivity in modern automotive software
development departments, but this needs further investigation.
","[{'version': 'v1', 'created': 'Mon, 4 Apr 2022 07:35:20 GMT'}]",2022-04-05,"[['Gren', 'Lucas', ''], ['Shepperd', 'Martin', '']]","['automotive software development', 'teams', 'team maturity', 'problem reports']"
10850,1604.06157,Andrew Connor,"Jacques Foottit, Dave Brown, Stefan Marks and Andy M. Connor",An Intuitive Tangible Game Controller,in Proceedings of the 2014 Conference on Interactive Entertainment,,10.1145/2677758.2677774,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper outlines the development of a sensory feedback device providing a
tangible interface for controlling digital environments, in this example a
flight simulator, where the intention for the device is that it is relatively
low cost, versatile and intuitive. Gesture based input allows for a more
immersive experience, so rather than making the user feel like they are
controlling an aircraft the intuitive interface allows the user to become the
aircraft that is controlled by the movements of the user's hand. The movements
are designed to allow a sense of immersion that would be difficult to achieve
with an alternative interface. A vibrotactile based haptic feedback is
incorporated in the device to further enhance the connection between the user
and the game environment by providing immediate confirmation of game events.
When used for navigating an aircraft simulator, this device invites playful
action and thrill. It bridges new territory on portable, low cost solutions for
haptic devices in gaming contexts.
","[{'version': 'v1', 'created': 'Thu, 21 Apr 2016 01:57:18 GMT'}]",2016-04-22,"[['Foottit', 'Jacques', ''], ['Brown', 'Dave', ''], ['Marks', 'Stefan', ''], ['Connor', 'Andy M.', '']]","['Wearable computing', 'vibrotactile feedback', 'haptic devices', 'game controllers']"
10851,1810.03908,Ravimal Bandara,Ravimal Bandara,"Image Segmentation using Unsupervised Watershed Algorithm with an
  Over-segmentation Reduction Technique","Source code related to this technical report is available at
  www.codeproject.com/Articles/751744/Image-Segmentation-using-Unsupervised-Watershed-Al",,10.13140/RG.2.2.35055.28323,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image segmentation is the process of partitioning an image into meaningful
segments. The meaning of the segments is subjective due to the definition of
homogeneity is varied based on the users perspective hence the automation of
the segmentation is challenging. Watershed is a popular segmentation technique
which assumes topographic map in an image, with the brightness of each pixel
representing its height, and finds the lines that run along the tops of ridges.
The results from the algorithm typically suffer from over segmentation due to
the lack of knowledge of the objects being classified. This paper presents an
approach to reduce the over segmentation of watershed algorithm by assuming
that the different adjacent segments of an object have similar color
distribution. The approach demonstrates an improvement over conventional
watershed algorithm.
","[{'version': 'v1', 'created': 'Tue, 9 Oct 2018 11:02:00 GMT'}]",2018-10-12,"[['Bandara', 'Ravimal', '']]","['Colour similarity', 'Image Segmentation', 'Over-segmentation', 'Watershed']"
10852,1703.10862,Patrick Rein,"Toni Mattis (Hasso Plattner Institute, Germany), Patrick Rein (Hasso
  Plattner Institute, Germany), Robert Hirschfeld (Hasso Plattner Institute,
  Germany)","Edit Transactions: Dynamically Scoped Change Sets for Controlled Updates
  in Live Programming",,"The Art, Science, and Engineering of Programming, 2017, Vol. 1,
  Issue 2, Article 13",10.22152/programming-journal.org/2017/1/13,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Live programming environments enable programmers to edit a running program
and obtain immediate feedback on each individual change. The liveness quality
is valued by programmers to help work in small steps and continuously add or
correct small functionality while maintaining the impression of a direct
connection between each edit and its manifestation at run-time. Such immediacy
may conflict with the desire to perform a combined set of intermediate steps,
such as a refactoring, without immediately taking effect after each individual
edit. This becomes important when an incomplete sequence of small-scale changes
can easily break the running program. State-of-the-art solutions focus on
retroactive recovery mechanisms, such as debugging or version control. In
contrast, we propose a proactive approach: Multiple individual changes to the
program are collected in an Edit Transaction, which can be made effective if
deemed complete. Upon activation, the combined steps become visible together.
Edit Transactions are capable of dynamic scoping, allowing a set of changes to
be tested in isolation before being extended to the running application. This
enables a live programming workflow with full control over change granularity,
immediate feedback on tests, delayed effect on the running application, and
coarse-grained undos. We present an implementation of Edit Transactions along
with Edit-Transaction-aware tools in Squeak/Smalltalk. We asses this
implementation by conducting a case study with and without the new tool
support, comparing programming activities, errors, and detours for implementing
new functionality in a running simulation. We conclude that workflows using
Edit Transactions have the potential to increase confidence in a change, reduce
potential for run-time errors, and eventually make live programming more
predictable and engaging.
","[{'version': 'v1', 'created': 'Fri, 31 Mar 2017 11:46:52 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Apr 2017 21:39:46 GMT'}]",2017-04-05,"[['Mattis', 'Toni', '', 'Hasso Plattner Institute, Germany'], ['Rein', 'Patrick', '', 'Hasso\n  Plattner Institute, Germany'], ['Hirschfeld', 'Robert', '', 'Hasso Plattner Institute,\n  Germany']]","['Live Programming', 'Tool Support', 'Immediate Feedback', 'Squeak/Smalltalk', 'Edit Transactions']"
10853,1807.07627,Daniel Canaday,"Daniel Canaday, Aaron Griffith, Daniel Gauthier",Rapid Time Series Prediction with a Hardware-Based Reservoir Computer,,,10.1063/1.5048199,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reservoir computing is a neural network approach for processing
time-dependent signals that has seen rapid development in recent years.
Physical implementations of the technique using optical reservoirs have
demonstrated remarkable accuracy and processing speed at benchmark tasks.
However, these approaches require an electronic output layer to maintain high
performance, which limits their use in tasks such as time-series prediction,
where the output is fed back into the reservoir. We present here a reservoir
computing scheme that has rapid processing speed both by the reservoir and the
output layer. The reservoir is realized by an autonomous, time-delay, Boolean
network configured on a field-programmable gate array. We investigate the
dynamical properties of the network and observe the fading memory property that
is critical for successful reservoir computing. We demonstrate the utility of
the technique by training a reservoir to learn the short- and long-term
behavior of a chaotic system. We find accuracy comparable to state-of-the-art
software approaches of similar network size, but with a superior real-time
prediction rate up to 160 MHz.
","[{'version': 'v1', 'created': 'Thu, 19 Jul 2018 20:13:03 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Nov 2018 16:33:30 GMT'}]",2019-01-30,"[['Canaday', 'Daniel', ''], ['Griffith', 'Aaron', ''], ['Gauthier', 'Daniel', '']]","['Reservoir computing', 'FPGA', 'time series prediction']"
10854,2003.09114,German I. Parisi,German I. Parisi and Vincenzo Lomonaco,Online Continual Learning on Sequences,"L. Oneto et al. (eds.), Recent Trends in Learning From Data, Studies
  in Computational Intelligence 896",,10.1007/978-3-030-43883-8_8,,cs.LG cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online continual learning (OCL) refers to the ability of a system to learn
over time from a continuous stream of data without having to revisit previously
encountered training samples. Learning continually in a single data pass is
crucial for agents and robots operating in changing environments and required
to acquire, fine-tune, and transfer increasingly complex representations from
non-i.i.d. input distributions. Machine learning models that address OCL must
alleviate \textit{catastrophic forgetting} in which hidden representations are
disrupted or completely overwritten when learning from streams of novel input.
In this chapter, we summarize and discuss recent deep learning models that
address OCL on sequential input through the use (and combination) of synaptic
regularization, structural plasticity, and experience replay. Different
implementations of replay have been proposed that alleviate catastrophic
forgetting in connectionists architectures via the re-occurrence of (latent
representations of) input sequences and that functionally resemble mechanisms
of hippocampal replay in the mammalian brain. Empirical evidence shows that
architectures endowed with experience replay typically outperform architectures
without in (online) incremental learning tasks.
","[{'version': 'v1', 'created': 'Fri, 20 Mar 2020 05:49:31 GMT'}]",2020-03-23,"[['Parisi', 'German I.', ''], ['Lomonaco', 'Vincenzo', '']]","['Continual learning', 'online learning', 'streaming learning', 'catastrophic forgetting', 'experience replay']"
10855,2001.04200,Bernard Yannou,"Tianjun Hou (LGI), Bernard Yannou (LGI), Yann Leroy, Emilie Poirson
  (IRCCyN)","Mining customer product reviews for product development: A summarization
  process",,"Expert Systems with Applications, Elsevier, 2019, 132, pp.141-150",10.1016/j.eswa.2019.04.069,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This research set out to identify and structure from online reviews the words
and expressions related to customers' likes and dislikes to guide product
development. Previous methods were mainly focused on product features. However,
reviewers express their preference not only on product features. In this paper,
based on an extensive literature review in design science, the authors propose
a summarization model containing multiples aspects of user preference, such as
product affordances, emotions, usage conditions. Meanwhile, the linguistic
patterns describing these aspects of preference are discovered and drafted as
annotation guidelines. A case study demonstrates that with the proposed model
and the annotation guidelines, human annotators can structure the online
reviews with high inter-agreement. As high inter-agreement human annotation
results are essential for automatizing the online review summarization process
with the natural language processing, this study provides materials for the
future study of automatization.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2020 13:01:14 GMT'}]",2020-01-14,"[['Hou', 'Tianjun', '', 'LGI'], ['Yannou', 'Bernard', '', 'LGI'], ['Leroy', 'Yann', '', 'IRCCyN'], ['Poirson', 'Emilie', '', 'IRCCyN']]","['knowledge acquisition', 'online reviews', 'user requirement', 'product design', 'decision support']"
10856,1906.11052,Alex Hern\'andez Garc\'ia,"Alex Hern\'andez-Garc\'ia, Peter K\""onig",Further advantages of data augmentation on convolutional neural networks,"Preprint of the manuscript accepted for presentation at the
  International Conference on Artificial Neural Networks (ICANN) 2018. Best
  Paper Award","Artificial Neural Networks and Machine Learning - ICANN 2018.
  ICANN 2018. Lecture Notes in Computer Science, vol 11139. Springer, Cham",10.1007/978-3-030-01418-6_10,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data augmentation is a popular technique largely used to enhance the training
of convolutional neural networks. Although many of its benefits are well known
by deep learning researchers and practitioners, its implicit regularization
effects, as compared to popular explicit regularization techniques, such as
weight decay and dropout, remain largely unstudied. As a matter of fact,
convolutional neural networks for image object classification are typically
trained with both data augmentation and explicit regularization, assuming the
benefits of all techniques are complementary. In this paper, we systematically
analyze these techniques through ablation studies of different network
architectures trained with different amounts of training data. Our results
unveil a largely ignored advantage of data augmentation: networks trained with
just data augmentation more easily adapt to different architectures and amount
of training data, as opposed to weight decay and dropout, which require
specific fine-tuning of their hyperparameters.
","[{'version': 'v1', 'created': 'Wed, 26 Jun 2019 12:50:13 GMT'}]",2019-06-27,"[['Hernández-García', 'Alex', ''], ['König', 'Peter', '']]","['data augmentation', 'regularization', 'CNNs']"
10857,2004.11682,"\""Ozg\""un Ak{\i}n","Ozgun Akin, Halil Faruk Deniz, Dogukan Nefis, Alp Kiziltan and Altan
  Cakir","Enabling Big Data Analytics at Manufacturing Fields of Farplas
  Automotive",8 pages,,10.1007/978-3-030-51156-2_94,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Digitization and data-driven manufacturing process is needed for today's
industry. The term Industry 4.0 stands for today industrial digitization which
is defined as a new level of organization and control over the entire value
chain of the life cycle of products; it is geared towards increasingly
individualized customer's high-quality expectations. However, due to the
increase in the number of connected devices and the variety of data, it has
become difficult to store and analyze data with conventional systems. The
motivation of this paper is to provide an overview of the understanding of the
big data pipeline, providing a real-time on-premise data acquisition, data
compression, data storage and processing with Apache Kafka and Apache Spark
implementation on Apache Ha-doop cluster, and identifying the challenges and
issues occurring with implementation the Farplas manufacturing company, which
is one of the biggest Tier 1 automotive supplier in Turkey, to study the new
trends and streams related to topics via Industry 4.0.
","[{'version': 'v1', 'created': 'Fri, 24 Apr 2020 12:22:27 GMT'}]",2020-07-30,"[['Akin', 'Ozgun', ''], ['Deniz', 'Halil Faruk', ''], ['Nefis', 'Dogukan', ''], ['Kiziltan', 'Alp', ''], ['Cakir', 'Altan', '']]","['Big Data', 'Apache Hadoop', 'Apache Kafka', 'Apache Spark', 'Apache Ni-Fi', 'AI in Manufacturing', 'Industry 4']"
10858,1911.06091,George Plastiras,"George Plastiras, Christos Kyrkou, Theocharis Theocharides","EdgeNet: Balancing Accuracy and Performance for Edge-based Convolutional
  Neural Network Object Detectors","George Plastiras, Christos Kyrkou, and Theocharis Theocharides. 2019.
  EdgeNet: Balancing Accuracy and Performance for Edge-based Convolutional
  Neural Network Object Detectors. In Proceedings of the 13th International
  Conference on Distributed Smart Cameras (ICDSC 2019). ACM, New York, NY, USA,
  Article 8, 6 pages","In Proceedings of the 13th International Conference on Distributed
  Smart Cameras (ICDSC 2019)",10.1145/3349801.3349809,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visual intelligence at the edge is becoming a growing necessity for low
latency applications and situations where real-time decision is vital. Object
detection, the first step in visual data analytics, has enjoyed significant
improvements in terms of state-of-the-art accuracy due to the emergence of
Convolutional Neural Networks (CNNs) and Deep Learning. However, such complex
paradigms intrude increasing computational demands and hence prevent their
deployment on resource-constrained devices. In this work, we propose a
hierarchical framework that enables to detect objects in high-resolution video
frames, and maintain the accuracy of state-of-the-art CNN-based object
detectors while outperforming existing works in terms of processing speed when
targeting a low-power embedded processor using an intelligent data reduction
mechanism. Moreover, a use-case for pedestrian detection from
Unmanned-Areal-Vehicle (UAV) is presented showing the impact that the proposed
approach has on sensitivity, average processing time and power consumption when
is implemented on different platforms. Using the proposed selection process our
framework manages to reduce the processed data by 100x leading to under 4W
power consumption on different edge devices.
","[{'version': 'v1', 'created': 'Thu, 14 Nov 2019 13:49:23 GMT'}]",2019-11-15,"[['Plastiras', 'George', ''], ['Kyrkou', 'Christos', ''], ['Theocharides', 'Theocharis', '']]","['Object Detection', 'Convolutional Neural Networks', 'Aerial Cameras', 'Pedestrian Detection']"
10859,1903.05239,Babak Hosseini,"Babak Hosseini, Barbara Hammer",Non-Negative Local Sparse Coding for Subspace Clustering,"15 pages, IDA 2018 conference",,10.1007/978-3-030-01768-2_12,,cs.LG cs.DS stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Subspace sparse coding (SSC) algorithms have proven to be beneficial to
clustering problems. They provide an alternative data representation in which
the underlying structure of the clusters can be better captured. However, most
of the research in this area is mainly focused on enhancing the sparse coding
part of the problem. In contrast, we introduce a novel objective term in our
proposed SSC framework which focuses on the separability of data points in the
coding space. We also provide mathematical insights into how this
local-separability term improves the clustering result of the SSC framework.
Our proposed non-linear local SSC algorithm (NLSSC) also benefits from the
efficient choice of its sparsity terms and constraints. The NLSSC algorithm is
also formulated in the kernel-based framework (NLKSSC) which can represent the
nonlinear structure of data. In addition, we address the possibility of having
redundancies in sparse coding results and its negative effect on graph-based
clustering problems. We introduce the link-restore post-processing step to
improve the representation graph of non-negative SSC algorithms such as ours.
Empirical evaluations on well-known clustering benchmarks show that our
proposed NLSSC framework results in better clusterings compared to the
state-of-the-art baselines and demonstrate the effectiveness of the
link-restore post-processing in improving the clustering accuracy via
correcting the broken links of the representation graph.
","[{'version': 'v1', 'created': 'Tue, 12 Mar 2019 22:20:10 GMT'}]",2019-03-14,"[['Hosseini', 'Babak', ''], ['Hammer', 'Barbara', '']]","['Machine learning', 'data mining', 'subspace clustering', 'sparse coding']"
10860,2010.02561,Gian-Luca Savino,"Gian-Luca Savino, Niklas Emanuel, Steven Kowalzik, Felix A. Kroll,
  Marvin C. Lange, Matthis Laudan, Rieke Leder, Zhanhua Liang, Dayana
  Markhabayeva, Martin Schmei{\ss}er, Nicolai Sch\""utz, Carolin Stellmacher,
  Zihe Xu, Kerstin Bub, Thorsten Kluss, Jaime Maldonado, Ernst Kruijff,
  Johannes Sch\""oning",Comparing Pedestrian Navigation Methods in Virtual Reality and Real Life,,,10.1145/3340555.3353741,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile navigation apps are among the most used mobile applications and are
often used as a baseline to evaluate new mobile navigation technologies in
field studies. As field studies often introduce external factors that are hard
to control for, we investigate how pedestrian navigation methods can be
evaluated in virtual reality (VR). We present a study comparing navigation
methods in real life (RL) and VR to evaluate if VR environments are a viable
alternative to RL environments when it comes to testing these. In a series of
studies, participants navigated a real and a virtual environment using a paper
map and a navigation app on a smartphone. We measured the differences in
navigation performance, task load and spatial knowledge acquisition between RL
and VR. From these we formulate guidelines for the improvement of pedestrian
navigation systems in VR like improved legibility for small screen devices. We
furthermore discuss appropriate low-cost and low-space VR-locomotion techniques
and discuss more controllable locomotion techniques.
","[{'version': 'v1', 'created': 'Tue, 6 Oct 2020 09:08:23 GMT'}]",2020-10-07,"[['Savino', 'Gian-Luca', ''], ['Emanuel', 'Niklas', ''], ['Kowalzik', 'Steven', ''], ['Kroll', 'Felix A.', ''], ['Lange', 'Marvin C.', ''], ['Laudan', 'Matthis', ''], ['Leder', 'Rieke', ''], ['Liang', 'Zhanhua', ''], ['Markhabayeva', 'Dayana', ''], ['Schmeißer', 'Martin', ''], ['Schütz', 'Nicolai', ''], ['Stellmacher', 'Carolin', ''], ['Xu', 'Zihe', ''], ['Bub', 'Kerstin', ''], ['Kluss', 'Thorsten', ''], ['Maldonado', 'Jaime', ''], ['Kruijff', 'Ernst', ''], ['Schöning', 'Johannes', '']]","['Virtual Reality', 'Navigation', 'Multi-Modal Interaction']"
10861,2110.06085,Franck Davoine,"Fei Yang, Franck Davoine, Huan Wang, Zhong Jin","Continuous Conditional Random Field Convolution for Point Cloud
  Segmentation",20 pages + 8 pages (supplemental material),"Pattern Recognition, Volume 122, February 2022",10.1016/j.patcog.2021.108357,,cs.CV cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Point cloud segmentation is the foundation of 3D environmental perception for
modern intelligent systems. To solve this problem and image segmentation,
conditional random fields (CRFs) are usually formulated as discrete models in
label space to encourage label consistency, which is actually a kind of
postprocessing. In this paper, we reconsider the CRF in feature space for point
cloud segmentation because it can capture the structure of features well to
improve the representation ability of features rather than simply smoothing.
Therefore, we first model the point cloud features with a continuous quadratic
energy model and formulate its solution process as a message-passing graph
convolution, by which it can be easily integrated into a deep network. We
theoretically demonstrate that the message passing in the graph convolution is
equivalent to the mean-field approximation of a continuous CRF model.
Furthermore, we build an encoder-decoder network based on the proposed
continuous CRF graph convolution (CRFConv), in which the CRFConv embedded in
the decoding layers can restore the details of high-level features that were
lost in the encoding stage to enhance the location ability of the network,
thereby benefiting segmentation. Analogous to the CRFConv, we show that the
classical discrete CRF can also work collaboratively with the proposed network
via another graph convolution to further improve the segmentation results.
Experiments on various point cloud benchmarks demonstrate the effectiveness and
robustness of the proposed method. Compared with the state-of-the-art methods,
the proposed method can also achieve competitive segmentation performance.
","[{'version': 'v1', 'created': 'Tue, 12 Oct 2021 15:35:38 GMT'}]",2021-10-13,"[['Yang', 'Fei', ''], ['Davoine', 'Franck', ''], ['Wang', 'Huan', ''], ['Jin', 'Zhong', '']]","['point cloud segmentation', 'conditional random fields', 'message passing', 'graph convolution', 'mean-fieldapproximation']"
10862,1907.02260,Marco Virgolin,"Marco Virgolin, Tanja Alderliesten, Peter A.N. Bosman","On Explaining Machine Learning Models by Evolving Crucial and Compact
  Features","We included more experiments: - A high-dimensional dataset is
  considered - The machine learning algorithm XGBoost is considered We also
  repeated the experiments using the Naive Bayes classifier, because we
  discovered that the implementation we relied on had issues (see
  https://github.com/mlpack/mlpack/issues/2017)",,10.1016/j.swevo.2019.100640,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feature construction can substantially improve the accuracy of Machine
Learning (ML) algorithms. Genetic Programming (GP) has been proven to be
effective at this task by evolving non-linear combinations of input features.
GP additionally has the potential to improve ML explainability since explicit
expressions are evolved. Yet, in most GP works the complexity of evolved
features is not explicitly bound or minimized though this is arguably key for
explainability. In this article, we assess to what extent GP still performs
favorably at feature construction when constructing features that are (1) Of
small-enough number, to enable visualization of the behavior of the ML model;
(2) Of small-enough size, to enable interpretability of the features
themselves; (3) Of sufficient informative power, to retain or even improve the
performance of the ML algorithm. We consider a simple feature construction
scheme using three different GP algorithms, as well as random search, to evolve
features for five ML algorithms, including support vector machines and random
forest. Our results on 21 datasets pertaining to classification and regression
problems show that constructing only two compact features can be sufficient to
rival the use of the entire original feature set. We further find that a modern
GP algorithm, GP-GOMEA, performs best overall. These results, combined with
examples that we provide of readable constructed features and of 2D
visualizations of ML behavior, lead us to positively conclude that GP-based
feature construction still works well when explicitly searching for compact
features, making it extremely helpful to explain ML models.
","[{'version': 'v1', 'created': 'Thu, 4 Jul 2019 07:52:23 GMT'}, {'version': 'v2', 'created': 'Sun, 17 Nov 2019 14:55:31 GMT'}, {'version': 'v3', 'created': 'Fri, 10 Jan 2020 11:21:17 GMT'}]",2020-01-13,"[['Virgolin', 'Marco', ''], ['Alderliesten', 'Tanja', ''], ['Bosman', 'Peter A. N.', '']]","['feature construction', 'interpretable machine learning', 'genetic programming', 'GOMEA']"
10863,2203.09565,Derrik Asher,"Derrik E. Asher, Anjon Basak, Rolando Fernandez, Piyush K. Sharma,
  Erin G. Zaroukian, Christopher D. Hsu, Michael R. Dorothy, Thomas Mahre,
  Gerardo Galindo, Luke Frerichs, John Rogers, and John Fossaceca","Strategic Maneuver and Disruption with Reinforcement Learning Approaches
  for Multi-Agent Coordination","23 pages, 3 figures, 60 references, Review Paper",The Journal of Defense Modeling and Simulation. August 2022,10.1177/15485129221104096,,cs.MA cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Reinforcement learning (RL) approaches can illuminate emergent behaviors that
facilitate coordination across teams of agents as part of a multi-agent system
(MAS), which can provide windows of opportunity in various military tasks.
Technologically advancing adversaries pose substantial risks to a friendly
nation's interests and resources. Superior resources alone are not enough to
defeat adversaries in modern complex environments because adversaries create
standoff in multiple domains against predictable military doctrine-based
maneuvers. Therefore, as part of a defense strategy, friendly forces must use
strategic maneuvers and disruption to gain superiority in complex multi-faceted
domains such as multi-domain operations (MDO). One promising avenue for
implementing strategic maneuver and disruption to gain superiority over
adversaries is through coordination of MAS in future military operations. In
this paper, we present overviews of prominent works in the RL domain with their
strengths and weaknesses for overcoming the challenges associated with
performing autonomous strategic maneuver and disruption in military contexts.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2022 19:02:18 GMT'}]",2022-09-08,"[['Asher', 'Derrik E.', ''], ['Basak', 'Anjon', ''], ['Fernandez', 'Rolando', ''], ['Sharma', 'Piyush K.', ''], ['Zaroukian', 'Erin G.', ''], ['Hsu', 'Christopher D.', ''], ['Dorothy', 'Michael R.', ''], ['Mahre', 'Thomas', ''], ['Galindo', 'Gerardo', ''], ['Frerichs', 'Luke', ''], ['Rogers', 'John', ''], ['Fossaceca', 'John', '']]","['Multi-Agent Systems', 'Reinforcement Learning', 'Multi-Domain Operation', 'Coordination', 'MilitaryScenario', 'Strategic Maneuver']"
10864,2107.06991,Jie Gao,"Zhihao Chen, Jie Gao, Weikai Wang and Zheng Yan","Physics-informed generative neural network: an application to
  troposphere temperature prediction",,,10.1088/1748-9326/abfde9,,cs.LG physics.ao-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The troposphere is one of the atmospheric layers where most weather phenomena
occur. Temperature variations in the troposphere, especially at 500 hPa, a
typical level of the middle troposphere, are significant indicators of future
weather changes. Numerical weather prediction is effective for temperature
prediction, but its computational complexity hinders a timely response. This
paper proposes a novel temperature prediction approach in framework
ofphysics-informed deep learning. The new model, called PGnet, builds upon a
generative neural network with a mask matrix. The mask is designed to
distinguish the low-quality predicted regions generated by the first physical
stage. The generative neural network takes the mask as prior for the
second-stage refined predictions. A mask-loss and a jump pattern strategy are
developed to train the generative neural network without accumulating errors
during making time-series predictions. Experiments on ERA5 demonstrate that
PGnet can generate more refined temperature predictions than the
state-of-the-art.
","[{'version': 'v1', 'created': 'Thu, 8 Jul 2021 09:07:07 GMT'}]",2021-07-16,"[['Chen', 'Zhihao', ''], ['Gao', 'Jie', ''], ['Wang', 'Weikai', ''], ['Yan', 'Zheng', '']]","['physics-informed deep learning', 'temperature prediction', 'generative neuralnetwork', 'video prediction']"
10865,2101.05426,Stephen MacDonell,Martin Shepperd and Stephen G. MacDonell,Evaluating prediction systems in software project estimation,"Journal, 10 pages, 3 figures, 6 tables","Information and Software Technology 54(8) (2012), pp.820-827",10.1016/j.infsof.2011.12.008,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Software engineering has a problem in that when we empirically
evaluate competing prediction systems we obtain conflicting results. Objective:
To reduce the inconsistency amongst validation study results and provide a more
formal foundation to interpret results with a particular focus on continuous
prediction systems. Method: A new framework is proposed for evaluating
competing prediction systems based upon (1) an unbiased statistic, Standardised
Accuracy, (2) testing the result likelihood relative to the baseline technique
of random 'predictions', that is guessing, and (3) calculation of effect sizes.
Results: Previously published empirical evaluations of prediction systems are
re-examined and the original conclusions shown to be unsafe. Additionally, even
the strongest results are shown to have no more than a medium effect size
relative to random guessing. Conclusions: Biased accuracy statistics such as
MMRE are deprecated. By contrast this new empirical validation framework leads
to meaningful results. Such steps will assist in performing future
meta-analyses and in providing more robust and usable recommendations to
practitioners.
","[{'version': 'v1', 'created': 'Thu, 14 Jan 2021 02:31:44 GMT'}]",2021-01-15,"[['Shepperd', 'Martin', ''], ['MacDonell', 'Stephen G.', '']]","['Software engineering', 'Prediction system', 'Empirical validation', 'Randomisation techniques   1']"
10866,1912.10413,Tanay Singhania,"Kartik Sharma, Ashutosh Aggarwal, Tanay Singhania, Deepak Gupta,
  Ashish Khanna",Hiding Data in Images Using Cryptography and Deep Neural Network,"20 pages, 9 figures, 5 tables",,10.33969/AIS.2019.11009,,cs.MM cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Steganography is an art of obscuring data inside another quotidian file of
similar or varying types. Hiding data has always been of significant importance
to digital forensics. Previously, steganography has been combined with
cryptography and neural networks separately. Whereas, this research combines
steganography, cryptography with the neural networks all together to hide an
image inside another container image of the larger or same size. Although the
cryptographic technique used is quite simple, but is effective when convoluted
with deep neural nets. Other steganography techniques involve hiding data
efficiently, but in a uniform pattern which makes it less secure. This method
targets both the challenges and make data hiding secure and non-uniform.
","[{'version': 'v1', 'created': 'Sun, 22 Dec 2019 10:19:44 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Jan 2020 18:51:59 GMT'}]",2020-01-03,"[['Sharma', 'Kartik', ''], ['Aggarwal', 'Ashutosh', ''], ['Singhania', 'Tanay', ''], ['Gupta', 'Deepak', ''], ['Khanna', 'Ashish', '']]","['Image Steganography', 'Cryptography', 'Convolutional Neural Network', 'Deep Learning', 'Digital Data Security']"
10867,2003.07061,Yelena Yuditsky,"Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena
  Yuditsky",The $\epsilon$-$t$-Net Problem,"This is the full version of the paper to appear in the Proceedings of
  the 36th International Symposium on Computational Geometry (SoCG 2020)",,10.4230/LIPIcs.SoCG.2020.5,,cs.DM cs.CG math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study a natural generalization of the classical $\epsilon$-net problem
(Haussler--Welzl 1987), which we call the ""$\epsilon$-$t$-net problem"": Given a
hypergraph on $n$ vertices and parameters $t$ and $\epsilon\geq \frac t n$,
find a minimum-sized family $S$ of $t$-element subsets of vertices such that
each hyperedge of size at least $\epsilon n$ contains a set in $S$. When $t=1$,
this corresponds to the $\epsilon$-net problem.
  We prove that any sufficiently large hypergraph with VC-dimension $d$ admits
an $\epsilon$-$t$-net of size $O(\frac{ (1+\log t)d}{\epsilon} \log
\frac{1}{\epsilon})$. For some families of geometrically-defined hypergraphs
(such as the dual hypergraph of regions with linear union complexity), we prove
the existence of $O(\frac{1}{\epsilon})$-sized $\epsilon$-$t$-nets.
  We also present an explicit construction of $\epsilon$-$t$-nets (including
$\epsilon$-nets) for hypergraphs with bounded VC-dimension. In comparison to
previous constructions for the special case of $\epsilon$-nets (i.e., for
$t=1$), it does not rely on advanced derandomization techniques. To this end we
introduce a variant of the notion of VC-dimension which is of independent
interest.
","[{'version': 'v1', 'created': 'Mon, 16 Mar 2020 07:47:15 GMT'}]",2022-02-08,"[['Alon', 'Noga', ''], ['Jartoux', 'Bruno', ''], ['Keller', 'Chaya', ''], ['Smorodinsky', 'Shakhar', ''], ['Yuditsky', 'Yelena', '']]","['epsilon-nets', 'geometric hypergraphs', 'VC-dimension', 'linear union complexity']"
10868,2109.12470,Isiah Zaplana,Isiah Zaplana and Hugo Hadfield and Joan Lasenby,"Singularities of serial robots: Identification and distance computation
  using geometric algebra","35 pages, 6 figures",,10.3390/math10122068,,cs.RO cs.CG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The singularities of serial robotic manipulators are those configurations in
which the robot loses the ability to move in at least one direction. Hence,
their identification is fundamental to enhance the performance of current
control and motion planning strategies. While classical approaches entail the
computation of the determinant of either a 6x n or nxn matrix for an n degrees
of freedom serial robot, this work addresses a novel singularity identification
method based on modelling the twists defined by the joint axes of the robot as
vectors of the six-dimensional and three-dimensional geometric algebras. In
particular, it consists of identifying which configurations cause the exterior
product of these twists to vanish. In addition, since rotors represent
rotations in geometric algebra, once these singularities have been identified,
a distance function is defined in the configuration space C such that its
restriction to the set of singular configurations S allows us to compute the
distance of any configuration to a given singularity. This distance function is
used to enhance how the singularities are handled in three different scenarios,
namely motion planning, motion control and bilateral teleoperation.
","[{'version': 'v1', 'created': 'Sun, 26 Sep 2021 00:58:42 GMT'}]",2022-06-17,"[['Zaplana', 'Isiah', ''], ['Hadfield', 'Hugo', ''], ['Lasenby', 'Joan', '']]","['Serial robotic manipulators', 'singularity identification', 'geometricalgebra', 'rotor group', 'distance to a singularity']"
10869,2004.11947,Jiri Kubalik,"J. Kubal\'ik, E. Derner, R. Babu\v{s}ka",Symbolic Regression Driven by Training Data and Prior Knowledge,"9 pages, 4 figures, 3 tables",,10.1145/3377930.3390152,,cs.LG cs.AI cs.NE cs.RO stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In symbolic regression, the search for analytic models is typically driven
purely by the prediction error observed on the training data samples. However,
when the data samples do not sufficiently cover the input space, the prediction
error does not provide sufficient guidance toward desired models. Standard
symbolic regression techniques then yield models that are partially incorrect,
for instance, in terms of their steady-state characteristics or local behavior.
If these properties were considered already during the search process, more
accurate and relevant models could be produced. We propose a multi-objective
symbolic regression approach that is driven by both the training data and the
prior knowledge of the properties the desired model should manifest. The
properties given in the form of formal constraints are internally represented
by a set of discrete data samples on which candidate models are exactly
checked. The proposed approach was experimentally evaluated on three test
problems with results clearly demonstrating its capability to evolve realistic
models that fit the training data well while complying with the prior knowledge
of the desired model characteristics at the same time. It outperforms standard
symbolic regression by several orders of magnitude in terms of the mean squared
deviation from a reference model.
","[{'version': 'v1', 'created': 'Fri, 24 Apr 2020 19:15:06 GMT'}]",2020-04-28,"[['Kubalík', 'J.', ''], ['Derner', 'E.', ''], ['Babuška', 'R.', '']]","['symbolic regression', 'genetic programming', 'multi-objective optimization', 'model learning']"
10870,1806.03483,Chengyuan Zhang,"Chengyuan Zhang, Ruipeng Chen, Lei Zhu, Anfeng Liu, Yunwu Lin and Fang
  Huang","Hierarchical Information Quadtree: Efficient Spatial Temporal Image
  Search for Multimedia Stream","Published at Multimedia Tools and Applications. arXiv admin note:
  text overlap with arXiv:1805.02009",,10.1007/s11042-018-6284-y,,cs.MM cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Massive amount of multimedia data that contain times- tamps and geographical
information are being generated at an unprecedented scale in many emerging
applications such as photo sharing web site and social networks applications.
Due to their importance, a large body of work has focused on efficiently
computing various spatial image queries. In this paper,we study the spatial
temporal image query which considers three important constraints during the
search including time recency, spatial proximity and visual relevance. A novel
index structure, namely Hierarchical Information Quadtree(\hiq), to efficiently
insert/delete spatial temporal images with high arrive rates. Base on \hiq an
efficient algorithm is developed to support spatial temporal image query. We
show via extensive experimentation with real spatial databases clearly
demonstrate the efficiency of our methods.
","[{'version': 'v1', 'created': 'Sat, 9 Jun 2018 14:53:07 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Aug 2018 07:53:15 GMT'}]",2018-08-16,"[['Zhang', 'Chengyuan', ''], ['Chen', 'Ruipeng', ''], ['Zhu', 'Lei', ''], ['Liu', 'Anfeng', ''], ['Lin', 'Yunwu', ''], ['Huang', 'Fang', '']]","['Hierarchical information quadtree', 'spatial temporal image search', 'multimedia stream']"
10871,2104.06603,Jennifer Healey,"Namrata Srivastava (1,2,3), Rajiv Jain (2), Jennifer Healey (2), Zoya
  Bylinskii (2) and Tilman Dingler (1) ((1) University of Melbourne (2) Adobe
  (3) Monash University)","Mitigating the Effects of Reading Interruptions by Providing Reviews and
  Previews","6 pages, 4 figures, to appear as a Late Breaking Work in CHI 2021,
  see ""https://chi2021.acm.org/""",,10.1145/3411763.3451610,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As reading on mobile devices is becoming more ubiquitous, content is consumed
in shorter intervals and is punctuated by frequent interruptions. In this work,
we explore the best way to mitigate the effects of reading interruptions on
longer text passages. Our hypothesis is that short summaries of either
previously read content (reviews) or upcoming content (previews) will help the
reader re-engage with the reading task. Our target use case is for students who
study using electronic textbooks and who are frequently mobile. We present a
series of pilot studies that examine the benefits of different types of
summaries and their locations, with respect to variations in text content and
participant cohorts. We find that users prefer reviews after an interruption,
but that previews shown after interruptions have a larger positive influence on
comprehension. Our work is a first step towards smart reading applications that
proactively provide text summaries to mitigate interruptions on the go.
","[{'version': 'v1', 'created': 'Wed, 14 Apr 2021 03:04:39 GMT'}]",2021-04-15,"[['Srivastava', 'Namrata', ''], ['Jain', 'Rajiv', ''], ['Healey', 'Jennifer', ''], ['Bylinskii', 'Zoya', ''], ['Dingler', 'Tilman', '']]","['reading interfaces', 'interruptions', 'mobile reading']"
10872,1810.02570,Mostafa Zaman Chowdhury,Mehek-Moutushy Rahman Mou and Mostafa Zaman Chowdhury,"Service Aware Fuzzy Logic Based Handover Decision in Heterogeneous
  Wireless Networks","International Conference on Electrical, Computer and Communication
  Engineering (ECCE), Feb. 2017, Cox's Bazar, Bangladesh",,10.1109/ECACE.2017.7912992,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ubiquitous services of wireless communication networks are growing
rapidly by the development of wireless communication technologies. While a user
is roaming from one cell to another cell, an intelligent decision mechanism and
network selection is extremely crucial to maintain the quality of service (QoS)
during handover. Handover decision must be made precisely to avoid any
unnecessary phenomenon like ping-pong, corner effect, call blocking, and call
dropping etc. This work considered service types like voice, video, and data
and their QoS requirements for handover decision using fuzzy logic in
heterogeneous network environment. Service is an important factor for the users
and particular service requires respective QoS. This paper provides all the
cases of handover decisions between macrocell and femtocell networks
considering service type. The proposed system models regarding these handover
decisions using fuzzy logic considering several input parameters e.g. received
signal strength indicator (RSSI), data rate, user's velocity, and interference
level (signal-to-noise plus interference ratio) to make handover from femtocell
to macrocell, macrocell to femtocell or femtocell to femtocell. The performance
of different parameters are shown based on service type are analyzed.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 08:49:04 GMT'}]",2018-10-08,"[['Mou', 'Mehek-Moutushy Rahman', ''], ['Chowdhury', 'Mostafa Zaman', '']]","['Handover', 'femtocell', 'quality of service', 'Fuzzy logic']"
10873,2001.06285,Stefan Hickel PhD,Mohamad Fathi and Stefan Hickel,"Rapid multi-component phase-split calculations using volume functions
  and reduction methods",,AIChE Journal 2021; e17174,10.1002/aic.17174,,cs.CE physics.comp-ph physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new family of fast and robust methods for the calculation of the
vapor-liquid equilibrium at isobaric-isothermal (PT-flash),
isochoric-isothermal (VT-flash), isenthalpic-isobaric (HP-flash), and
isoenergetic-isochoric (UV-flash) conditions. The framework is provided by
formulating phase-equilibrium conditions for multi-component mixtures in an
effectively reduced space based on the molar specific value of the recently
introduced volume function derived from the Helmholtz free energy. The proposed
algorithmic implementation can fully exploit the optimum quadratic convergence
of a Newton method with the analytical Jacobian matrix. This paper provides all
required exact analytic expressions for the general cubic equation of state.
Computational results demonstrate the effectivity and efficiency of the new
methods. Compared to conventional methods, the proposed reduced-space iteration
leads to a considerable speed-up as well as to improved robustness and better
convergence behavior near the spinodal and coexistence curves of
multi-component mixtures, where the preconditioning by the reduction method is
most effective.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2020 21:17:57 GMT'}]",2021-01-29,"[['Fathi', 'Mohamad', ''], ['Hickel', 'Stefan', '']]","['vapor-liquid equilibrium', 'reduction method', 'volume function', 'constant volume flash']"
10874,2108.03076,Danil Annenkov,"Danil Annenkov, Martin Elsman",Certified Compilation of Financial Contracts,"Published: Proceedings of the 20th International Symposium on
  Principles and Practice of Declarative Programming (PPDP'18) Coq
  formalisation: https://github.com/annenkov/contracts","20th International Symposium on Principles and Practice of
  Declarative Programming 2018 (PPDP'18)",10.1145/3236950.3236955,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an extension to a certified financial contract management system
that allows for templated declarative financial contracts and for integration
with financial stochastic models through verified compilation into so-called
payoff-expressions. Such expressions readily allow for determining the value of
a contract in a given evaluation context, such as contexts created for
stochastic simulations. The templating mechanism is useful both at the contract
specification level, for writing generic reusable contracts, and for reuse of
code that, without the templating mechanism, needs to be recompiled for
different evaluation contexts. We report on the effect of using the certified
system in the context of a GPGPU-based Monte Carlo simulation engine for
pricing various over-the-counter (OTC) financial contracts. The full
contract-management system, including the payoff-language compilation, is
verified in the Coq proof assistant and certified Haskell code is extracted
from our Coq development along with Futhark code for use in a data-parallel
pricing engine.
","[{'version': 'v1', 'created': 'Fri, 6 Aug 2021 12:22:44 GMT'}]",2021-08-10,"[['Annenkov', 'Danil', ''], ['Elsman', 'Martin', '']]","['financial contracts', 'contract languages', 'domain-specific languages', 'certified programming', 'software correctness', 'Coq']"
10875,2206.13399,Bruno Casella,"Bruno Casella, Alessio Barbaro Chisari, Sebastiano Battiato, Mario
  Valerio Giuffrida",Transfer Learning via Test-Time Neural Networks Aggregation,8 pages,"Proceedings of the 17th international joint conference on computer
  vision, imaging and computer graphics theory and applications, VISIGRAPP
  2022, volume 5: VISAPP, online streaming, february 6-8, 2022, 2022, pp.
  642-649",10.5220/0010907900003124,,cs.LG cs.AI cs.CV,http://creativecommons.org/licenses/by/4.0/,"  It has been demonstrated that deep neural networks outperform traditional
machine learning. However, deep networks lack generalisability, that is, they
will not perform as good as in a new (testing) set drawn from a different
distribution due to the domain shift. In order to tackle this known issue,
several transfer learning approaches have been proposed, where the knowledge of
a trained model is transferred into another to improve performance with
different data. However, most of these approaches require additional training
steps, or they suffer from catastrophic forgetting that occurs when a trained
model has overwritten previously learnt knowledge. We address both problems
with a novel transfer learning approach that uses network aggregation. We train
dataset-specific networks together with an aggregation network in a unified
framework. The loss function includes two main components: a task-specific loss
(such as cross-entropy) and an aggregation loss. The proposed aggregation loss
allows our model to learn how trained deep network parameters can be aggregated
with an aggregation operator. We demonstrate that the proposed approach learns
model aggregation at test time without any further training step, reducing the
burden of transfer learning to a simple arithmetical operation. The proposed
approach achieves comparable performance w.r.t. the baseline. Besides, if the
aggregation operator has an inverse, we will show that our model also
inherently allows for selective forgetting, i.e., the aggregated model can
forget one of the datasets it was trained on, retaining information on the
others.
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2022 15:46:05 GMT'}]",2022-06-28,"[['Casella', 'Bruno', ''], ['Chisari', 'Alessio Barbaro', ''], ['Battiato', 'Sebastiano', ''], ['Giuffrida', 'Mario Valerio', '']]","['parameter aggregation', 'transfer learning', 'selective forgetting']"
10876,1702.04333,Angel Castro Martinez,"Angel Mario Castro Martinez, Sri Harish Mallidi, Bernd T. Meyer","On the Relevance of Auditory-Based Gabor Features for Deep Learning in
  Automatic Speech Recognition",accepted to Computer Speech & Language,,10.1016/j.csl.2017.02.006,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Previous studies support the idea of merging auditory-based Gabor features
with deep learning architectures to achieve robust automatic speech
recognition, however, the cause behind the gain of such combination is still
unknown. We believe these representations provide the deep learning decoder
with more discriminable cues. Our aim with this paper is to validate this
hypothesis by performing experiments with three different recognition tasks
(Aurora 4, CHiME 2 and CHiME 3) and assess the discriminability of the
information encoded by Gabor filterbank features. Additionally, to identify the
contribution of low, medium and high temporal modulation frequencies subsets of
the Gabor filterbank were used as features (dubbed LTM, MTM and HTM
respectively). With temporal modulation frequencies between 16 and 25 Hz, HTM
consistently outperformed the remaining ones in every condition, highlighting
the robustness of these representations against channel distortions, low
signal-to-noise ratios and acoustically challenging real-life scenarios with
relative improvements from 11 to 56% against a Mel-filterbank-DNN baseline. To
explain the results, a measure of similarity between phoneme classes from DNN
activations is proposed and linked to their acoustic properties. We find this
measure to be consistent with the observed error rates and highlight specific
differences on phoneme level to pinpoint the benefit of the proposed features.
","[{'version': 'v1', 'created': 'Tue, 14 Feb 2017 18:46:47 GMT'}]",2017-02-15,"[['Martinez', 'Angel Mario Castro', ''], ['Mallidi', 'Sri Harish', ''], ['Meyer', 'Bernd T.', '']]","['Auditory features', 'spectro-temporal processing', 'deep neural networks', 'automatic speech recognition']"
10877,1810.01291,Yu Chen,"Ronghua Xu, Yu Chen, Erik Blasch, Genshe Chen","An Exploration of Blockchain Enabled Decentralized Capability based
  Access Control Strategy for Space Situation Awareness","Submitted to SPIE Optical Engineering, Special Section on Sensors and
  Systems for Space Applications. arXiv admin note: substantial text overlap
  with arXiv:1804.09267",,10.1117/1.OE.58.4.041609,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Space situation awareness (SSA) includes tracking of active and inactive
resident space objects (RSOs) and assessing the space environment through
sensor data collection and processing. To enhance SSA, the dynamic data-driven
applications systems (DDDAS) framework couples on-line data with off-line
models to enhance system performance. Using feedback control, sensor
management, and communications reliability. For information management, there
is a need for identity authentication and access control to ensure the
integrity of exchanged data as well as to grant authorized entities access
right to data and services. Due to decentralization and heterogeneity of SSA
systems, it is challenging to build an efficient centralized access control
system, which could either be a performance bottleneck or the single point of
failure. Inspired by the blockchain and smart contract technology, this paper
introduces BlendCAC, a decentralized authentication and capability-based access
control mechanism to enable effective protection for devices, services and
information in SSA networks. To achieve secure identity authentication, the
BlendCAC leverages the blockchain to create virtual trust zones and a robust
identity-based capability token management strategy is proposed. A
proof-of-concept prototype has been implemented on both resources-constrained
devices and more powerful computing devices, and is tested on a private
Ethereum blockchain network. The experimental results demonstrate the
feasibility of the BlendCAC scheme to offer a decentralized, scalable,
lightweight and fine-grained access control solution for space system towards
SSA.
","[{'version': 'v1', 'created': 'Mon, 1 Oct 2018 13:20:11 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Dec 2018 16:24:36 GMT'}]",2019-09-04,"[['Xu', 'Ronghua', ''], ['Chen', 'Yu', ''], ['Blasch', 'Erik', ''], ['Chen', 'Genshe', '']]","['Blockchain', 'Smart Contract', 'Decentralized Access Control', 'Dynamic Data-Driven Application System(DDDAS)', 'Space Situation Awareness (SSA)']"
10878,2002.02536,Rose Bohrer,"Rose Bohrer, Andr\'e Platzer",Constructive Hybrid Games,"60 pages, preprint, under review",,10.1007/978-3-030-51074-9_26,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hybrid games are models which combine discrete, continuous, and adversarial
dynamics. Game logic enables proving (classical) existence of winning
strategies. We introduce constructive differential game logic (CdGL) for hybrid
games, where proofs that a player can win the game correspond to computable
winning strategies. This is the logical foundation for synthesis of correct
control and monitoring code for safety-critical cyber-physical systems. Our
contributions include novel static and dynamic semantics as well as soundness
and consistency.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2020 22:19:13 GMT'}]",2022-10-07,"[['Bohrer', 'Rose', ''], ['Platzer', 'André', '']]","['Game Logic', 'Constructive Logic', 'Hybrid Games', 'Dependent Types']"
10879,1710.02546,Xuemei Xie,"Xuemei Xie, Chenye Wang, Shu Chen, Guangming Shi, Zhifu Zhao",Real-Time Illegal Parking Detection System Based on Deep Learning,"5pages,6figures",,10.1145/3094243.3094261,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing illegal parking has become more and more serious. Nowadays the
methods of detecting illegally parked vehicles are based on background
segmentation. However, this method is weakly robust and sensitive to
environment. Benefitting from deep learning, this paper proposes a novel
illegal vehicle parking detection system. Illegal vehicles captured by camera
are firstly located and classified by the famous Single Shot MultiBox Detector
(SSD) algorithm. To improve the performance, we propose to optimize SSD by
adjusting the aspect ratio of default box to accommodate with our dataset
better. After that, a tracking and analysis of movement is adopted to judge the
illegal vehicles in the region of interest (ROI). Experiments show that the
system can achieve a 99% accuracy and real-time (25FPS) detection with strong
robustness in complex environments.
","[{'version': 'v1', 'created': 'Thu, 5 Oct 2017 07:57:29 GMT'}]",2017-10-10,"[['Xie', 'Xuemei', ''], ['Wang', 'Chenye', ''], ['Chen', 'Shu', ''], ['Shi', 'Guangming', ''], ['Zhao', 'Zhifu', '']]","['Single Shot MultiBox Detector', 'Tracking', 'Vehicle detection', 'Real-time', 'Deep learning']"
10880,1908.11291,Maxime Remaud,Simon Martiel and Maxime Remaud,Practical implementation of a quantum backtracking algorithm,"18 pages, 10 figures",,10.1007/978-3-030-38919-2_49,,cs.DM cs.ET quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In previous work, Montanaro presented a method to obtain quantum speedups for
backtracking algorithms, a general meta-algorithm to solve constraint
satisfaction problems (CSPs). In this work, we derive a space efficient
implementation of this method. Assume that we want to solve a CSP with $m$
constraints on $n$ variables and that the union of the domains in which these
variables take their value is of cardinality $d$. Then, we show that the
implementation of Montanaro's backtracking algorithm can be done by using $O(n
\log d)$ data qubits. We detail an implementation of the predicate associated
to the CSP with an additional register of $O(\log m)$ qubits. We explicit our
implementation for graph coloring and SAT problems, and present simulation
results. Finally, we discuss the impact of the usage of static and dynamic
variable ordering heuristics in the quantum setting.
","[{'version': 'v1', 'created': 'Thu, 29 Aug 2019 15:26:48 GMT'}]",2021-06-10,"[['Martiel', 'Simon', ''], ['Remaud', 'Maxime', '']]","['Backtracking Algorithm', 'Quantum Walk', 'CSP', 'GraphColoring', 'SAT']"
10881,2001.01659,Constantin Catalin Dragan,Constantin C\u{a}t\u{a}lin Dr\u{a}gan and Mark Manulis,KYChain: User-Controlled KYC Data Sharing and Certification,,,10.1145/3341105.3373895,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Under Know Your Customer (KYC) regulations, financial institutions are
required to verify the identity and assess the trustworthiness of any new
client during on-boarding, and maintain up-to-date records for risk management.
These processes are time consuming, expensive, typically have sub-par
record-keeping steps, and disadvantage clients with nomad lifestyle. In this
paper, we introduce KYChain as a privacy-preserving certification mechanism
that allows users to share (certified) up-to-date KYC data across multiple
financial institutions. We base KYChain on immutable ledgers and show that it
offers confidentiality and certification compliance of KYC data.
","[{'version': 'v1', 'created': 'Mon, 6 Jan 2020 16:49:07 GMT'}]",2020-01-07,"[['Drăgan', 'Constantin Cătălin', ''], ['Manulis', 'Mark', '']]","['Know Your Customer', 'Privacy-Preserving', 'Distributed Ledger Technology', 'Certifcation']"
10882,2007.11069,Srikar Kasi,Srikar Kasi and Kyle Jamieson,"Towards Quantum Belief Propagation for LDPC Decoding in Wireless
  Networks",,"@inproceedings{10.1145/3372224.3419207, year = {2020}, articleno =
  {50}, numpages = {14}, series = {MobiCom '20} }",10.1145/3372224.3419207,,cs.NI eess.SP quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present Quantum Belief Propagation (QBP), a Quantum Annealing (QA) based
decoder design for Low Density Parity Check (LDPC) error control codes, which
have found many useful applications in Wi-Fi, satellite communications, mobile
cellular systems, and data storage systems. QBP reduces the LDPC decoding to a
discrete optimization problem, then embeds that reduced design onto quantum
annealing hardware. QBP's embedding design can support LDPC codes of block
length up to 420 bits on real state-of-the-art QA hardware with 2,048 qubits.
We evaluate performance on real quantum annealer hardware, performing
sensitivity analyses on a variety of parameter settings. Our design achieves a
bit error rate of $10^{-8}$ in 20 $\mu$s and a 1,500 byte frame error rate of
$10^{-6}$ in 50 $\mu$s at SNR 9 dB over a Gaussian noise wireless channel.
Further experiments measure performance over real-world wireless channels,
requiring 30 $\mu$s to achieve a 1,500 byte 99.99$\%$ frame delivery rate at
SNR 15-20 dB. QBP achieves a performance improvement over an FPGA based soft
belief propagation LDPC decoder, by reaching a bit error rate of $10^{-8}$ and
a frame error rate of $10^{-6}$ at an SNR 2.5--3.5 dB lower. In terms of
limitations, QBP currently cannot realize practical protocol-sized
($\textit{e.g.,}$ Wi-Fi, WiMax) LDPC codes on current QA processors. Our
further studies in this work present future cost, throughput, and QA hardware
trend considerations.
","[{'version': 'v1', 'created': 'Tue, 21 Jul 2020 19:59:16 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Sep 2020 11:48:57 GMT'}]",2020-09-22,"[['Kasi', 'Srikar', ''], ['Jamieson', 'Kyle', '']]","['Wireless Networks', 'Channel Coding', 'LDPC Codes', 'Belief Propagation', 'Quantum Annealing', 'Embedding', 'Quantum Computation']"
10883,2010.00257,Simon Heybrock,"Simon Heybrock, Owen Arnold, Igor Gudich, Daniel Nixon, and Neil
  Vaytet","Scipp: Scientific data handling with labeled multi-dimensional arrays
  for C++ and Python","Proceedings of ICANS-XXIII, 13 pages, 5 figures","Journal of Neutron Research, vol. Pre-press, no. Pre-press, pp.
  1-13, 2020",10.3233/JNR-190131,,cs.MS physics.data-an physics.ins-det,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scipp is heavily inspired by the Python library xarray. It enriches raw
NumPy-like multi-dimensional arrays of data by adding named dimensions and
associated coordinates. Multiple arrays are combined into datasets. On top of
this, scipp introduces (i) implicit handling of physical units, (ii) implicit
propagation of uncertainties, (iii) support for histograms, i.e., bin-edge
coordinate axes, which exceed the data's dimension extent by one, and (iv)
support for event data. In conjunction these features enable a more natural and
more concise user experience. The combination of named dimensions, coordinates,
and units helps to drastically reduce the risk for programming errors. The core
of scipp is written in C++ to open opportunities for performance improvements
that a Python-based solution would not allow for. On top of the C++ core,
scipp's Python components provide functionality for plotting and content
representations, e.g., for use in Jupyter Notebooks. While none of scipp's
concepts in isolation is novel per-se, we are not aware of any project
combining all of these aspects in a single coherent software package.
","[{'version': 'v1', 'created': 'Thu, 1 Oct 2020 08:59:03 GMT'}]",2020-10-02,"[['Heybrock', 'Simon', ''], ['Arnold', 'Owen', ''], ['Gudich', 'Igor', ''], ['Nixon', 'Daniel', ''], ['Vaytet', 'Neil', '']]","['Software', 'Python', 'C++', 'data-processing', 'multi-dimensional']"
10884,1807.08228,Yuanhang Su,"Yuanhang Su, Ruiyuan Lin, C.-C. Jay Kuo","Tree-structured multi-stage principal component analysis (TMPCA): theory
  and applications",,,10.1016/j.eswa.2018.10.020,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A PCA based sequence-to-vector (seq2vec) dimension reduction method for the
text classification problem, called the tree-structured multi-stage principal
component analysis (TMPCA) is presented in this paper. Theoretical analysis and
applicability of TMPCA are demonstrated as an extension to our previous work
(Su, Huang & Kuo). Unlike conventional word-to-vector embedding methods, the
TMPCA method conducts dimension reduction at the sequence level without labeled
training data. Furthermore, it can preserve the sequential structure of input
sequences. We show that TMPCA is computationally efficient and able to
facilitate sequence-based text classification tasks by preserving strong mutual
information between its input and output mathematically. It is also
demonstrated by experimental results that a dense (fully connected) network
trained on the TMPCA preprocessed data achieves better performance than
state-of-the-art fastText and other neural-network-based solutions.
","[{'version': 'v1', 'created': 'Sun, 22 Jul 2018 03:15:44 GMT'}, {'version': 'v2', 'created': 'Sun, 7 Oct 2018 04:26:25 GMT'}]",2018-10-12,"[['Su', 'Yuanhang', ''], ['Lin', 'Ruiyuan', ''], ['Kuo', 'C. -C. Jay', '']]","['dimension reduction', 'principal component analysis', 'mutual']"
10885,2005.09199,Mansoor Ahmed-Rengers,Mansoor Ahmed-Rengers,FrameProv: Towards End-To-End Video Provenance,,"New Security Paradigms Workshop, 2019",10.1145/3368860.3368866,,cs.CR cs.CY cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video feeds are often deliberately used as evidence, as in the case of CCTV
footage; but more often than not, the existence of footage of a supposed event
is perceived as proof of fact in the eyes of the public at large. This reliance
represents a societal vulnerability given the existence of easy-to-use editing
tools and means to fabricate entire video feeds using machine learning. And, as
the recent barrage of fake news and fake porn videos have shown, this isn't
merely an academic concern, it is actively been exploited. I posit that this
exploitation is only going to get more insidious. In this position paper, I
introduce a long term project that aims to mitigate some of the most egregious
forms of manipulation by embedding trustworthy components in the video
transmission chain. Unlike earlier works, I am not aiming to do tamper
detection or other forms of forensics -- approaches I think are bound to fail
in the face of the reality of necessary editing and compression -- instead, the
aim here is to provide a way for the video publisher to prove the integrity of
the video feed as well as make explicit any edits they may have performed. To
do this, I present a novel data structure, a video-edit specification language
and supporting infrastructure that provides end-to-end video provenance, from
the camera sensor to the viewer. I have implemented a prototype of this system
and am in talks with journalists and video editors to discuss the best ways
forward with introducing this idea to the mainstream.
","[{'version': 'v1', 'created': 'Tue, 19 May 2020 03:52:21 GMT'}]",2020-05-20,"[['Ahmed-Rengers', 'Mansoor', '']]","['video provenance', 'video editing', 'tamper evidence']"
10886,2010.01577,Dan Overholt,Dan Overholt,The MATRIX: A Novel Controller for Musical Expression,"Proceedings of the International Conference on New Interfaces for
  Musical Expression, 2001",,10.5281/zenodo.1176372,,cs.HC cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  The MATRIX (Multipurpose Array of Tactile Rods for Interactive eXpression) is
a new musical interface for amateurs and professionals alike. It gives users a
3- dimensional tangible interface to control music using their hands, and can
be used in conjunction with a traditional musical instrument and a microphone,
or as a stand-alone gestural input device. The surface of the MATRIX acts as a
real-time interface that can manipulate the parameters of a synthesis engine or
effect algorithm in response to a performer's expressive gestures. One example
is to have the rods of the MATRIX control the individual grains of a granular
synthesizer, thereby ""sonically sculpting"" the microstructure of a sound. In
this way, the MATRIX provides an intuitive method of manip
","[{'version': 'v1', 'created': 'Sun, 4 Oct 2020 12:58:23 GMT'}]",2020-10-06,"[['Overholt', 'Dan', '']]","['Musical controller', 'tangible interface', 'real-time expression', 'audio synthesis', 'effects algorithms', 'signal processing', '3-Dinterface', 'sculptable surface']"
10887,cs/0212021,Peter Turney,Peter D. Turney (National Research Council of Canada),"A Simple Model of Unbounded Evolutionary Versatility as a Largest-Scale
  Trend in Organismal Evolution",32 pages,"Artificial Life, (2000), 6, 109-128",10.1162/106454600568357,NRC-43672,cs.NE cs.CE q-bio.PE,,"  The idea that there are any large-scale trends in the evolution of biological
organisms is highly controversial. It is commonly believed, for example, that
there is a large-scale trend in evolution towards increasing complexity, but
empirical and theoretical arguments undermine this belief. Natural selection
results in organisms that are well adapted to their local environments, but it
is not clear how local adaptation can produce a global trend. In this paper, I
present a simple computational model, in which local adaptation to a randomly
changing environment results in a global trend towards increasing evolutionary
versatility. In this model, for evolutionary versatility to increase without
bound, the environment must be highly dynamic. The model also shows that
unbounded evolutionary versatility implies an accelerating evolutionary pace. I
believe that unbounded increase in evolutionary versatility is a large-scale
trend in evolution. I discuss some of the testable predictions about organismal
evolution that are suggested by the model.
","[{'version': 'v1', 'created': 'Tue, 10 Dec 2002 15:52:43 GMT'}]",2021-06-08,"[['Turney', 'Peter D.', '', 'National Research Council of Canada']]","['evolutionary trends', 'evolutionary progress', 'large-scale trends', 'evolutionary ver']"
10888,2008.11755,Mohammad Zaki Zadeh,"Mohammad Zaki Zadeh, Ashwin Ramesh Babu, Ashish Jaiswal, Fillia
  Makedon","Self-Supervised Human Activity Recognition by Augmenting Generative
  Adversarial Networks",,,10.1145/3453892.3453893,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article proposes a novel approach for augmenting generative adversarial
network (GAN) with a self-supervised task in order to improve its ability for
encoding video representations that are useful in downstream tasks such as
human activity recognition. In the proposed method, input video frames are
randomly transformed by different spatial transformations, such as rotation,
translation and shearing or temporal transformations such as shuffling temporal
order of frames. Then discriminator is encouraged to predict the applied
transformation by introducing an auxiliary loss. Subsequently, results prove
superiority of the proposed method over baseline methods for providing a useful
representation of videos used in human activity recognition performed on
datasets such as KTH, UCF101 and Ball-Drop. Ball-Drop dataset is a specifically
designed dataset for measuring executive functions in children through
physically and cognitively demanding tasks. Using features from proposed method
instead of baseline methods caused the top-1 classification accuracy to
increase by more then 4%. Moreover, ablation study was performed to investigate
the contribution of different transformations on downstream task.
","[{'version': 'v1', 'created': 'Wed, 26 Aug 2020 18:28:17 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Dec 2020 18:45:50 GMT'}]",2021-07-08,"[['Zadeh', 'Mohammad Zaki', ''], ['Babu', 'Ashwin Ramesh', ''], ['Jaiswal', 'Ashish', ''], ['Makedon', 'Fillia', '']]","['cognitive assessment', 'human-computer interaction', 'computer vision', 'deep learning']"
10889,1906.03181,Haibin Zheng,"Jinyin Chen, Mengmeng Su, Shijing Shen, Hui Xiong, Haibin Zheng","POBA-GA: Perturbation Optimized Black-Box Adversarial Attacks via
  Genetic Algorithm",,"Computers and Security, Volume 85, August 2019, Pages 89-106",10.1016/j.cose.2019.04.014,,cs.CR cs.LG cs.NE eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most deep learning models are easily vulnerable to adversarial attacks.
Various adversarial attacks are designed to evaluate the robustness of models
and develop defense model. Currently, adversarial attacks are brought up to
attack their own target model with their own evaluation metrics. And most of
the black-box adversarial attack algorithms cannot achieve the expected success
rate compared with white-box attacks. In this paper, comprehensive evaluation
metrics are brought up for different adversarial attack methods. A novel
perturbation optimized black-box adversarial attack based on genetic algorithm
(POBA-GA) is proposed for achieving white-box comparable attack performances.
Approximate optimal adversarial examples are evolved through evolutionary
operations including initialization, selection, crossover and mutation. Fitness
function is specifically designed to evaluate the example individual in both
aspects of attack ability and perturbation control. Population diversity
strategy is brought up in evolutionary process to promise the approximate
optimal perturbations obtained. Comprehensive experiments are carried out to
testify POBA-GA's performances. Both simulation and application results prove
that our method is better than current state-of-art black-box attack methods in
aspects of attack capability and perturbation control.
","[{'version': 'v1', 'created': 'Wed, 1 May 2019 05:18:53 GMT'}]",2019-06-10,"[['Chen', 'Jinyin', ''], ['Su', 'Mengmeng', ''], ['Shen', 'Shijing', ''], ['Xiong', 'Hui', ''], ['Zheng', 'Haibin', '']]","['Deep learning', 'adversarial attack', 'perturbation optimization', 'genetic algorithm']"
10890,1906.08860,Jason Bernard,"Jason Bernard, Ian McQuillan","Techniques for Inferring Context-Free Lindenmayer Systems With Genetic
  Algorithm","28 pages, 3 figures",,10.1016/j.swevo.2021.100893,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lindenmayer systems (L-systems) are a formal grammar system, where the most
notable feature is a set of rewriting rules that are used to replace every
symbol in a string in parallel; by repeating this process, a sequence of
strings is produced. Some symbols in the strings may be interpreted as
instructions for simulation software. Thus, the sequence can be used to model
the steps of a process. Currently, creating an L-system for a specific process
is done by hand by experts through much effort. The inductive inference problem
attempts to infer an L-system from such a sequence of strings generated by an
unknown system; this can be thought of as an intermediate step to inferring
from a sequence of images. This paper evaluates and analyzes different genetic
algorithm encoding schemes and mathematical properties for the L-system
inductive inference problem. A new tool, the Plant Model Inference Tool for
Context-Free L-systems (PMIT-D0L) is implemented based on these techniques.
PMIT-D0L has been successfully evaluated on 28 known L-systems, with alphabets
up to 31 symbols and a total sum of 281 symbols across the rewriting rules.
PMIT-D0L can infer even the largest of these L-systems in less than a few
seconds.
","[{'version': 'v1', 'created': 'Wed, 15 May 2019 18:48:57 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Apr 2021 14:19:53 GMT'}]",2021-04-30,"[['Bernard', 'Jason', ''], ['McQuillan', 'Ian', '']]","['Lindenmayer systems', 'Plant modelling', 'Inductive inference', 'Genetic Algorithm']"
10891,1909.09200,Daryus Chandra,"Zunaira Babar, Zeynep B. Kaykac Egilmez, Luping Xiang, Daryus Chandra,
  Robert G. Maunder, Soon Xin Ng and Lajos Hanzo",Polar Codes and Their Quantum-Domain Counterparts,"35 pages, accepted for publication in IEEE Communications Surveys and
  Tutorials",,10.1109/COMST.2019.2937923,,cs.IT math.IT quant-ph,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Arikan's polar codes are capable of achieving the Shannon's capacity at a low
encoding and decoding complexity, while inherently supporting rate adaptation.
By virtue of these attractive features, polar codes have provided fierce
competition to both the turbo as well as the Low Density Parity Check (LDPC)
codes, making its way into the 5G New Radio (NR). Realizing the significance of
polar codes, in this paper we provide a comprehensive survey of polar codes,
highlighting the major milestones achieved in the last decade. Furthermore, we
also provide tutorial insights into the polar encoder, decoders as well as the
code construction methods. We also extend our discussions to quantum polar
codes with an emphasis on the underlying quantum-to-classical isomorphism and
the syndrome-based quantum polar codes.
","[{'version': 'v1', 'created': 'Sun, 1 Sep 2019 18:04:31 GMT'}]",2019-09-23,"[['Babar', 'Zunaira', ''], ['Egilmez', 'Zeynep B. Kaykac', ''], ['Xiang', 'Luping', ''], ['Chandra', 'Daryus', ''], ['Maunder', 'Robert G.', ''], ['Ng', 'Soon Xin', ''], ['Hanzo', 'Lajos', '']]","['channel coding', 'channel polarization', 'capacity', 'polarcodes', 'quantum error correction']"
10892,2106.08209,Pedro Miguel Sanchez Sanchez,"Pedro Miguel S\'anchez S\'anchez, Jos\'e Mar\'ia Jorquera Valero,
  Alberto Huertas Celdr\'an, G\'er\^ome Bovet, Manuel Gil P\'erez, Gregorio
  Mart\'inez P\'erez","A methodology to identify identical single-board computers based on
  hardware behavior fingerprinting",,,10.1016/j.jnca.2022.103579,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  The connectivity and resource-constrained nature of single-board devices open
the door to cybersecurity concerns affecting Internet of Things (IoT)
scenarios. One of the most important issues is the presence of unauthorized IoT
devices that want to impersonate legitimate ones by using identical hardware
and software specifications. This situation can provoke sensitive information
leakages, data poisoning, or privilege escalation in IoT scenarios. Combining
behavioral fingerprinting and Machine/Deep Learning (ML/DL) techniques is a
promising approach to identify these malicious spoofing devices by detecting
minor performance differences generated by imperfections in manufacturing.
However, existing solutions are not suitable for single-board devices since
they do not consider their hardware and software limitations, underestimate
critical aspects such as fingerprint stability or context changes, and do not
explore the potential of ML/DL techniques. To improve it, this work first
identifies the essential properties for single-board device identification:
uniqueness, stability, diversity, scalability, efficiency, robustness, and
security. Then, a novel methodology relies on behavioral fingerprinting to
identify identical single-board devices and meet the previous properties. The
methodology leverages the different built-in components of the system and ML/DL
techniques, comparing the device internal behavior with each other to detect
manufacturing variations. The methodology validation has been performed in a
real environment composed of 15 identical Raspberry Pi 4 B and 10 Raspberry Pi
3 B+ devices, obtaining a 91.9% average TPR and identifying all devices by
setting a 50% threshold in the evaluation process. Finally, a discussion
compares the proposed solution with related work, highlighting the fingerprint
properties not met, and provides important lessons learned and limitations.
","[{'version': 'v1', 'created': 'Tue, 15 Jun 2021 15:16:54 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Oct 2021 13:09:05 GMT'}, {'version': 'v3', 'created': 'Tue, 25 Jan 2022 08:46:01 GMT'}, {'version': 'v4', 'created': 'Wed, 22 Jun 2022 13:16:46 GMT'}]",2023-01-06,"[['Sánchez', 'Pedro Miguel Sánchez', ''], ['Valero', 'José María Jorquera', ''], ['Celdrán', 'Alberto Huertas', ''], ['Bovet', 'Gérôme', ''], ['Pérez', 'Manuel Gil', ''], ['Pérez', 'Gregorio Martínez', '']]","['Device Behavior Fingerprinting', 'Device Identification', 'Cyberattack Detection', 'Behavioral Data', 'Hardware Fingerprinting']"
10893,cs/0106010,Aspassia Daskalopulu,Aspassia Daskalopulu,Modelling Legal Contracts as Processes,,"11th International Conference and Workshop on Database and Expert
  Systems Applications, IEEE C. S. Press, pp. 1074-1079, 2000",10.1109/DEXA.2000.875160,,cs.AI cs.LO,,"  This paper concentrates on the representation of the legal relations that
obtain between parties once they have entered a contractual agreement and their
evolution as the agreement progresses through time. Contracts are regarded as
process and they are analysed in terms of the obligations that are active at
various points during their life span. An informal notation is introduced that
summarizes conveniently the states of an agreement as it evolves over time.
Such a representation enables us to determine what the status of an agreement
is, given an event or a sequence of events that concern the performance of
actions by the agents involved. This is useful both in the context of contract
drafting (where parties might wish to preview how their agreement might evolve)
and in the context of contract performance monitoring (where parties might with
to establish what their legal positions are once their agreement is in force).
The discussion is based on an example that illustrates some typical patterns of
contractual obligations.
","[{'version': 'v1', 'created': 'Thu, 7 Jun 2001 14:59:03 GMT'}]",2016-11-17,"[['Daskalopulu', 'Aspassia', '']]","['legal contract representation', 'transition diagrams', 'temporally qualified obligations', 'dynamic system modelling']"
10894,1910.08259,Haotian Zhang,"Haotian Zhang, Gaoang Wang, Zhichao Lei, Jenq-Neng Hwang",Eye in the Sky: Drone-Based Object Tracking and 3D Localization,Accepted to ACMMM2019,,10.1145/3343031.3350933,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Drones, or general UAVs, equipped with a single camera have been widely
deployed to a broad range of applications, such as aerial photography, fast
goods delivery and most importantly, surveillance. Despite the great progress
achieved in computer vision algorithms, these algorithms are not usually
optimized for dealing with images or video sequences acquired by drones, due to
various challenges such as occlusion, fast camera motion and pose variation. In
this paper, a drone-based multi-object tracking and 3D localization scheme is
proposed based on the deep learning based object detection. We first combine a
multi-object tracking method called TrackletNet Tracker (TNT) which utilizes
temporal and appearance information to track detected objects located on the
ground for UAV applications. Then, we are also able to localize the tracked
ground objects based on the group plane estimated from the Multi-View Stereo
technique. The system deployed on the drone can not only detect and track the
objects in a scene, but can also localize their 3D coordinates in meters with
respect to the drone camera. The experiments have proved our tracker can
reliably handle most of the detected objects captured by drones and achieve
favorable 3D localization performance when compared with the state-of-the-art
methods.
","[{'version': 'v1', 'created': 'Fri, 18 Oct 2019 04:44:44 GMT'}]",2019-10-21,"[['Zhang', 'Haotian', ''], ['Wang', 'Gaoang', ''], ['Lei', 'Zhichao', ''], ['Hwang', 'Jenq-Neng', '']]","['drone', 'multi-object tracking', '3D localization', 'Ground Plane']"
10895,2001.06983,Subhayan Mukherjee,"Subhayan Mukherjee, Guan-Ming Su, and Irene Cheng","Adaptive Dithering Using Curved Markov-Gaussian Noise in the Quantized
  Domain for Mapping SDR to HDR Image",2018 International Conference on Smart Multimedia,,10.1007/978-3-030-04375-9_17,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  High Dynamic Range (HDR) imaging is gaining increased attention due to its
realistic content, for not only regular displays but also smartphones. Before
sufficient HDR content is distributed, HDR visualization still relies mostly on
converting Standard Dynamic Range (SDR) content. SDR images are often
quantized, or bit depth reduced, before SDR-to-HDR conversion, e.g. for video
transmission. Quantization can easily lead to banding artefacts. In some
computing and/or memory I/O limited environment, the traditional solution using
spatial neighborhood information is not feasible. Our method includes noise
generation (offline) and noise injection (online), and operates on pixels of
the quantized image. We vary the magnitude and structure of the noise pattern
adaptively based on the luma of the quantized pixel and the slope of the
inverse-tone mapping function. Subjective user evaluations confirm the superior
performance of our technique.
","[{'version': 'v1', 'created': 'Mon, 20 Jan 2020 05:30:16 GMT'}]",2020-01-22,"[['Mukherjee', 'Subhayan', ''], ['Su', 'Guan-Ming', ''], ['Cheng', 'Irene', '']]","['High dynamic range', 'Image coding', 'Image quality', 'Dithering', 'Gaussian noise']"
10896,2203.16743,Hassan Iqbal,"Hassan Iqbal, Usman Mahmood Khan, Hassan Ali Khan, and Muhammad
  Shahzad","A Peek into the Political Biases in Email Spam Filtering Algorithms
  During US Election 2020","10 pages, Published in WWW'22",,10.1145/3485447.3512121,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Email services use spam filtering algorithms (SFAs) to filter emails that are
unwanted by the user. However, at times, the emails perceived by an SFA as
unwanted may be important to the user. Such incorrect decisions can have
significant implications if SFAs treat emails of user interest as spam on a
large scale. This is particularly important during national elections. To study
whether the SFAs of popular email services have any biases in treating the
campaign emails, we conducted a large-scale study of the campaign emails of the
US elections 2020 by subscribing to a large number of Presidential, Senate, and
House candidates using over a hundred email accounts on Gmail, Outlook, and
Yahoo. We analyzed the biases in the SFAs towards the left and the right
candidates and further studied the impact of the interactions (such as reading
or marking emails as spam) of email recipients on these biases. We observed
that the SFAs of different email services indeed exhibit biases towards
different political affiliations. We present this and several other important
observations in this paper.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2022 01:49:31 GMT'}]",2022-04-01,"[['Iqbal', 'Hassan', ''], ['Khan', 'Usman Mahmood', ''], ['Khan', 'Hassan Ali', ''], ['Shahzad', 'Muhammad', '']]","['US Elections', 'Emails', 'Spam', 'Bias', 'Political Bias', 'Algorithm Bias']"
10897,2103.07972,M\'arcia Cappelle,"M\'arcia R. Cappelle, Erika Coelho, Les R. Foulds, Humberto J. Longo","Open-independent, open-locating-dominating sets: structural aspects of
  some classes of graphs","18 pages, 5 figures","Discrete Mathematics & Theoretical Computer Science, vol. 24, no.
  1, Graph Theory (February 7, 2022) dmtcs:9027",10.46298/dmtcs.8440,,cs.DM,http://creativecommons.org/licenses/by/4.0/,"  Let $G=(V(G),E(G))$ be a finite simple undirected graph with vertex set
$V(G)$, edge set $E(G)$ and vertex subset $S\subseteq V(G)$. $S$ is termed
\emph{open-dominating} if every vertex of $G$ has at least one neighbor in $S$,
and \emph{open-independent, open-locating-dominating} (an $OLD_{oind}$-set for
short) if no two vertices in $G$ have the same set of neighbors in $S$, and
each vertex in $S$ is open-dominated exactly once by $S$. The problem of
deciding whether or not $G$ has an $OLD_{oind}$-set has important applications
that have been reported elsewhere. As the problem is known to be
$\mathcal{NP}$-complete, it appears to be notoriously difficult as we show that
its complexity remains the same even for just planar bipartite graphs of
maximum degree five and girth six, and also for planar subcubic graphs of girth
nine. Also, we present characterizations of both $P_4$-tidy graphs and the
complementary prisms of cographs that have an $OLD_{oind}$-set.
","[{'version': 'v1', 'created': 'Sun, 14 Mar 2021 16:50:53 GMT'}, {'version': 'v2', 'created': 'Sat, 28 Aug 2021 17:57:50 GMT'}, {'version': 'v3', 'created': 'Tue, 21 Dec 2021 13:12:20 GMT'}, {'version': 'v4', 'created': 'Mon, 31 Jan 2022 11:04:30 GMT'}]",2022-03-14,"[['Cappelle', 'Márcia R.', ''], ['Coelho', 'Erika', ''], ['Foulds', 'Les R.', ''], ['Longo', 'Humberto J.', '']]","['open-independent', 'open-locating-dominating', 'complementary prism', 'planar', 'bipartite', 'P4-tidy', 'complexity']"
10898,2208.11527,Darshan Ganganna Ravindra,"Darshan Ganganna Ravindra, Laslo Dinges, Al-Hamadi Ayoub, and Vasili
  Baranau","Fast and Precise Binary Instance Segmentation of 2D Objects for
  Automotive Applications","4 pages, 4 figures, WSCG 2022 conference [WSCG 2022 Proceedings, CSRN
  3201, ISSN 2464-4617]","Journal of WSCG, Vol.30, 2022, 302-305 ISSN 1213-6972",10.24132/csrn.3201.38,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this paper, we focus on improving binary 2D instance segmentation to
assist humans in labeling ground truth datasets with polygons. Humans labeler
just have to draw boxes around objects, and polygons are generated
automatically. To be useful, our system has to run on CPUs in real-time. The
most usual approach for binary instance segmentation involves encoder-decoder
networks. This report evaluates state-of-the-art encoder-decoder networks and
proposes a method for improving instance segmentation quality using these
networks. Alongside network architecture improvements, our proposed method
relies upon providing extra information to the network input, so-called extreme
points, i.e. the outermost points on the object silhouette. The user can label
them instead of a bounding box almost as quickly. The bounding box can be
deduced from the extreme points as well. This method produces better IoU
compared to other state-of-the-art encoder-decoder networks and also runs fast
enough when it is deployed on a CPU.
","[{'version': 'v1', 'created': 'Wed, 24 Aug 2022 13:19:34 GMT'}]",2022-08-25,"[['Ravindra', 'Darshan Ganganna', ''], ['Dinges', 'Laslo', ''], ['Ayoub', 'Al-Hamadi', ''], ['Baranau', 'Vasili', '']]","['Extreme points', 'IoU', 'Encoder-Decoder', 'Instance binary segmentation']"
10899,2204.08561,Xinyi Wang,"Xinyi Wang, Paolo Arcaini, Tao Yue, Shaukat Ali",QuSBT: Search-Based Testing of Quantum Programs,,,10.1145/3510454.3516839,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generating a test suite for a quantum program such that it has the maximum
number of failing tests is an optimization problem. For such optimization,
search-based testing has shown promising results in the context of classical
programs. To this end, we present a test generation tool for quantum programs
based on a genetic algorithm, called QuSBT (Search-based Testing of Quantum
Programs). QuSBT automates the testing of quantum programs, with the aim of
finding a test suite having the maximum number of failing test cases. QuSBT
utilizes IBM's Qiskit as the simulation framework for quantum programs. We
present the tool architecture in addition to the implemented methodology (i.e.,
the encoding of the search individual, the definition of the fitness function
expressing the search problem, and the test assessment w.r.t. two types of
failures). Finally, we report results of the experiments in which we tested a
set of faulty quantum programs with QuSBT to assess its effectiveness.
Repository (code and experimental results):
https://github.com/Simula-COMPLEX/qusbt-tool Video:
https://youtu.be/3apRCtluAn4
","[{'version': 'v1', 'created': 'Mon, 18 Apr 2022 21:03:57 GMT'}]",2022-04-20,"[['Wang', 'Xinyi', ''], ['Arcaini', 'Paolo', ''], ['Yue', 'Tao', ''], ['Ali', 'Shaukat', '']]","['Quantum Programs', 'Search-Based Testing', 'Genetic Algorithms']"
10900,2204.02618,Jasmin Bogatinovski,"Jasmin Bogatinovski, Sasho Nedelkoski, Alexander Acker, Jorge Cardoso,
  Odej Kao",Data-Driven Approach for Log Instruction Quality Assessment,"This paper is accepted for publication at the 30th International
  Conference on Program Comprehension under doi: 10.1145/3524610.3527906. The
  copyrights are handled following the corresponding agreement between the
  author and publisher",,10.1145/3524610.3527906,,cs.SE cs.LG,http://creativecommons.org/licenses/by/4.0/,"  In the current IT world, developers write code while system operators run the
code mostly as a black box. The connection between both worlds is typically
established with log messages: the developer provides hints to the (unknown)
operator, where the cause of an occurred issue is, and vice versa, the operator
can report bugs during operation. To fulfil this purpose, developers write log
instructions that are structured text commonly composed of a log level (e.g.,
""info"", ""error""), static text (""IP {} cannot be reached""), and dynamic
variables (e.g. IP {}). However, as opposed to well-adopted coding practices,
there are no widely adopted guidelines on how to write log instructions with
good quality properties. For example, a developer may assign a high log level
(e.g., ""error"") for a trivial event that can confuse the operator and increase
maintenance costs. Or the static text can be insufficient to hint at a specific
issue. In this paper, we address the problem of log quality assessment and
provide the first step towards its automation. We start with an in-depth
analysis of quality log instruction properties in nine software systems and
identify two quality properties: 1) correct log level assignment assessing the
correctness of the log level, and 2) sufficient linguistic structure assessing
the minimal richness of the static text necessary for verbose event
description. Based on these findings, we developed a data-driven approach that
adapts deep learning methods for each of the two properties. An extensive
evaluation on large-scale open-source systems shows that our approach correctly
assesses log level assignments with an accuracy of 0.88, and the sufficient
linguistic structure with an F1 score of 0.99, outperforming the baselines. Our
study shows the potential of the data-driven methods in assessing instructions
quality and aid developers in comprehending and writing better code.
","[{'version': 'v1', 'created': 'Wed, 6 Apr 2022 07:02:23 GMT'}]",2022-04-07,"[['Bogatinovski', 'Jasmin', ''], ['Nedelkoski', 'Sasho', ''], ['Acker', 'Alexander', ''], ['Cardoso', 'Jorge', ''], ['Kao', 'Odej', '']]","['log quality', 'deep learning', 'log analysis', 'program comprehension']"
10901,2110.14239,Constantin Sander,"Constantin Sander, Leo Bl\""ocher, Klaus Wehrle, Jan R\""uth","Sharding and HTTP/2 Connection Reuse Revisited: Why Are There Still
  Redundant Connections?",Accepted at the ACM Internet Measurement Conference 2021 (IMC'21),,10.1145/3487552.3487832,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  HTTP/2 and HTTP/3 avoid concurrent connections but instead multiplex requests
over a single connection. Besides enabling new features, this reduces overhead
and enables fair bandwidth sharing. Redundant connections should hence be a
story of the past with HTTP/2. However, they still exist, potentially hindering
innovation and performance. Thus, we measure their spread and analyze their
causes in this paper. We find that 36% - 72% of the 6.24M HTTP Archive and 78%
of the Alexa Top 100k websites cause Chromium-based webbrowsers to open
superfluous connections. We mainly attribute these to domain sharding, despite
HTTP/2 efforts to revert it, and DNS load balancing, but also the Fetch
Standard.
","[{'version': 'v1', 'created': 'Wed, 27 Oct 2021 07:45:29 GMT'}]",2021-10-28,"[['Sander', 'Constantin', ''], ['Blöcher', 'Leo', ''], ['Wehrle', 'Klaus', ''], ['Rüth', 'Jan', '']]","['HTTP/2', 'Connection Reuse', 'Domain Sharding', 'Fetch Standard']"
10902,2201.09488,Andre Greiner-Petter,"Andr\'e Greiner-Petter and Howard S. Cohl and Abdou Youssef and Moritz
  Schubotz and Avi Trost and Rajen Dey and Akiko Aizawa and Bela Gipp","Comparative Verification of the Digital Library of Mathematical
  Functions and Computer Algebra Systems",,"In: TACAS, Apr. 2022, pp. 87-105",10.1007/978-3-030-99524-9_5,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Digital mathematical libraries assemble the knowledge of years of
mathematical research. Numerous disciplines (e.g., physics, engineering, pure
and applied mathematics) rely heavily on compendia gathered findings. Likewise,
modern research applications rely more and more on computational solutions,
which are often calculated and verified by computer algebra systems. Hence, the
correctness, accuracy, and reliability of both digital mathematical libraries
and computer algebra systems is a crucial attribute for modern research.
  In this paper, we present a novel approach to verify a digital mathematical
library and two computer algebra systems with one another by converting
mathematical expressions from one system to the other. We use our previously
eveloped conversion tool (referred to as LaCASt) to translate formulae from the
NIST Digital Library of Mathematical Functions to the computer algebra systems
Maple and Mathematica. The contributions of our presented work are as follows:
(1) we present the most comprehensive verification of computer algebra systems
and digital mathematical libraries with one another; (2) we significantly
enhance the performance of the underlying translator in terms of coverage and
accuracy; and (3) we provide open access to translations for Maple and
Mathematica of the formulae in the NIST Digital Library of Mathematical
Functions.
","[{'version': 'v1', 'created': 'Mon, 24 Jan 2022 06:51:07 GMT'}, {'version': 'v2', 'created': 'Thu, 31 Mar 2022 09:12:51 GMT'}]",2022-06-10,"[['Greiner-Petter', 'André', ''], ['Cohl', 'Howard S.', ''], ['Youssef', 'Abdou', ''], ['Schubotz', 'Moritz', ''], ['Trost', 'Avi', ''], ['Dey', 'Rajen', ''], ['Aizawa', 'Akiko', ''], ['Gipp', 'Bela', '']]","['Presentation to Computation', 'LaCASt', 'LaTeX', 'Semantic LaTeX', 'Computer Algebra Systems', 'Digital Mathematical Library']"
10903,2107.08465,Luca Martino,"Luca Martino, V\'ictor Elvira, Javier L\'opez-Santiago, Gustau
  Camps-Valls","Compressed particle methods for expensive models with application in
  Astronomy and Remote Sensing",published in IEEE Transactions on Aerospace and Electronic Systems,,10.1109/TAES.2021.3061791,,cs.CE stat.CO stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many inference problems, the evaluation of complex and costly models is
often required. In this context, Bayesian methods have become very popular in
several fields over the last years, in order to obtain parameter inversion,
model selection or uncertainty quantification. Bayesian inference requires the
approximation of complicated integrals involving (often costly) posterior
distributions. Generally, this approximation is obtained by means of Monte
Carlo (MC) methods. In order to reduce the computational cost of the
corresponding technique, surrogate models (also called emulators) are often
employed. Another alternative approach is the so-called Approximate Bayesian
Computation (ABC) scheme. ABC does not require the evaluation of the costly
model but the ability to simulate artificial data according to that model.
Moreover, in ABC, the choice of a suitable distance between real and artificial
data is also required. In this work, we introduce a novel approach where the
expensive model is evaluated only in some well-chosen samples. The selection of
these nodes is based on the so-called compressed Monte Carlo (CMC) scheme. We
provide theoretical results supporting the novel algorithms and give empirical
evidence of the performance of the proposed method in several numerical
experiments. Two of them are real-world applications in astronomy and satellite
remote sensing.
","[{'version': 'v1', 'created': 'Sun, 18 Jul 2021 14:45:23 GMT'}]",2021-07-21,"[['Martino', 'Luca', ''], ['Elvira', 'Víctor', ''], ['López-Santiago', 'Javier', ''], ['Camps-Valls', 'Gustau', '']]","['Numerical Inversion', 'Bayesian inference', 'Particle Filtering', 'Importance']"
10904,1710.09868,Luciano Oliveira,"Luiz Souza, Mauricio Pamplona, Luciano Oliveira and Jo\~ao Papa",How far did we get in face spoofing detection?,,"Engineering Applications of Artificial Intelligence, vol 72, pp.
  368-381, 2018",10.1016/j.engappai.2018.04.013,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The growing use of control access systems based on face recognition shed
light over the need for even more accurate systems to detect face spoofing
attacks. In this paper, an extensive analysis on face spoofing detection works
published in the last decade is presented. The analyzed works are categorized
by their fundamental parts, i.e., descriptors and classifiers. This structured
survey also brings the temporal evolution of the face spoofing detection field,
as well as a comparative analysis of the works considering the most important
public data sets in the field. The methodology followed in this work is
particularly relevant to observe trends in the existing approaches, to discuss
still opened issues, and to propose new perspectives for the future of face
spoofing detection.
","[{'version': 'v1', 'created': 'Thu, 26 Oct 2017 18:49:01 GMT'}, {'version': 'v2', 'created': 'Sat, 29 Sep 2018 18:55:18 GMT'}]",2018-10-02,"[['Souza', 'Luiz', ''], ['Pamplona', 'Mauricio', ''], ['Oliveira', 'Luciano', ''], ['Papa', 'João', '']]","['Face spoofing', 'face recognition', 'survey', 'spoofing attack']"
10905,2104.12663,Henning Schulze,Henning Schulze and Dogucan Yaman and Alexander Waibel,CAGAN: Text-To-Image Generation with Combined Attention GANs,,LNCS 13024 (2021) 392-404,10.1007/978-3-030-92659-5_25,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Generating images according to natural language descriptions is a challenging
task. Prior research has mainly focused to enhance the quality of generation by
investigating the use of spatial attention and/or textual attention thereby
neglecting the relationship between channels. In this work, we propose the
Combined Attention Generative Adversarial Network (CAGAN) to generate
photo-realistic images according to textual descriptions. The proposed CAGAN
utilises two attention models: word attention to draw different sub-regions
conditioned on related words; and squeeze-and-excitation attention to capture
non-linear interaction among channels. With spectral normalisation to stabilise
training, our proposed CAGAN improves the state of the art on the IS and FID on
the CUB dataset and the FID on the more challenging COCO dataset. Furthermore,
we demonstrate that judging a model by a single evaluation metric can be
misleading by developing an additional model adding local self-attention which
scores a higher IS, outperforming the state of the art on the CUB dataset, but
generates unrealistic images through feature repetition.
","[{'version': 'v1', 'created': 'Mon, 26 Apr 2021 15:46:40 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Jun 2021 18:57:03 GMT'}, {'version': 'v3', 'created': 'Wed, 8 Sep 2021 15:48:15 GMT'}, {'version': 'v4', 'created': 'Fri, 14 Jan 2022 16:16:53 GMT'}]",2022-01-17,"[['Schulze', 'Henning', ''], ['Yaman', 'Dogucan', ''], ['Waibel', 'Alexander', '']]","['text-to-image synthesis', 'generative adversarial network (GAN)', 'attention']"
10906,2208.14861,Andrew Kuznetsov,"Andrew Kuznetsov, Joseph Chee Chang, Nathan Hahn, Napol Rachatasumrit,
  Bradley Breneisen, Julina Coupland, Aniket Kittur",Fuse: In-Situ Sensemaking Support in the Browser,,,10.1145/3526113.3545693,,cs.HC cs.IR,http://creativecommons.org/licenses/by/4.0/,"  People spend a significant amount of time trying to make sense of the
internet, collecting content from a variety of sources and organizing it to
make decisions and achieve their goals. While humans are able to fluidly
iterate on collecting and organizing information in their minds, existing tools
and approaches introduce significant friction into the process. We introduce
Fuse, a browser extension that externalizes users' working memory by combining
low-cost collection with lightweight organization of content in a compact
card-based sidebar that is always available. Fuse helps users simultaneously
extract key web content and structure it in a lightweight and visual way. We
discuss how these affordances help users externalize more of their mental model
into the system (e.g., saving, annotating, and structuring items) and support
fast reviewing and resumption of task contexts. Our 22-month public deployment
and follow-up interviews provide longitudinal insights into the structuring
behaviors of real-world users conducting information foraging tasks.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2022 13:43:27 GMT'}]",2022-09-01,"[['Kuznetsov', 'Andrew', ''], ['Chang', 'Joseph Chee', ''], ['Hahn', 'Nathan', ''], ['Rachatasumrit', 'Napol', ''], ['Breneisen', 'Bradley', ''], ['Coupland', 'Julina', ''], ['Kittur', 'Aniket', '']]","['Sensemaking Support Systems', 'Mental Models', 'In-Situ Systems']"
10907,2205.14374,Md Rafiqul Islam Rabin,"Md Rafiqul Islam Rabin, Aftab Hussain, Mohammad Amin Alipour","Syntax-Guided Program Reduction for Understanding Neural Code
  Intelligence Models","The 6th ACM SIGPLAN International Symposium on Machine Programming
  (MAPS'22); Related to arXiv:2202.06474",,10.1145/3520312.3534869,,cs.SE cs.LG cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural code intelligence (CI) models are opaque black-boxes and offer little
insight on the features they use in making predictions. This opacity may lead
to distrust in their prediction and hamper their wider adoption in
safety-critical applications. Recently, input program reduction techniques have
been proposed to identify key features in the input programs to improve the
transparency of CI models. However, this approach is syntax-unaware and does
not consider the grammar of the programming language. In this paper, we apply a
syntax-guided program reduction technique that considers the grammar of the
input programs during reduction. Our experiments on multiple models across
different types of input programs show that the syntax-guided program reduction
technique is faster and provides smaller sets of key tokens in reduced
programs. We also show that the key tokens could be used in generating
adversarial examples for up to 65% of the input programs.
","[{'version': 'v1', 'created': 'Sat, 28 May 2022 09:04:57 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Jun 2022 05:07:38 GMT'}]",2022-06-15,"[['Rabin', 'Md Rafiqul Islam', ''], ['Hussain', 'Aftab', ''], ['Alipour', 'Mohammad Amin', '']]","['Neural Models of Source Code', 'Program Reduction', 'Feature Engineering', 'Transparency', 'Interpretability']"
10908,2011.13849,Reza Maalek,Reza Maalek and Derek Lichti,"Robust Detection of Non-overlapping Ellipses from Points with
  Applications to Circular Target Extraction in Images and Cylinder Detection
  in Point Clouds",,,10.1016/j.isprsjprs.2021.04.010,,cs.CV cs.CG cs.LG,http://creativecommons.org/licenses/by/4.0/,"  This manuscript provides a collection of new methods for the automated
detection of non-overlapping ellipses from edge points. The methods introduce
new developments in: (i) robust Monte Carlo-based ellipse fitting to
2-dimensional (2D) points in the presence of outliers; (ii) detection of
non-overlapping ellipse from 2D edge points; and (iii) extraction of cylinder
from 3D point clouds. The proposed methods were thoroughly compared with
established state-of-the-art methods, using simulated and real-world datasets,
through the design of four sets of original experiments. It was found that the
proposed robust ellipse detection was superior to four reliable robust methods,
including the popular least median of squares, in both simulated and real-world
datasets. The proposed process for detecting non-overlapping ellipses achieved
F-measure of 99.3% on real images, compared to F-measures of 42.4%, 65.6%, and
59.2%, obtained using the methods of Fornaciari, Patraucean, and Panagiotakis,
respectively. The proposed cylinder extraction method identified all detectable
mechanical pipes in two real-world point clouds, obtained under laboratory, and
industrial construction site conditions. The results of this investigation show
promise for the application of the proposed methods for automatic extraction of
circular targets from images and pipes from point clouds.
","[{'version': 'v1', 'created': 'Thu, 19 Nov 2020 21:56:02 GMT'}, {'version': 'v2', 'created': 'Sun, 20 Dec 2020 15:07:21 GMT'}, {'version': 'v3', 'created': 'Tue, 30 Mar 2021 17:56:30 GMT'}]",2021-05-03,"[['Maalek', 'Reza', ''], ['Lichti', 'Derek', '']]","['non-overlapping ellipse detection', 'cylinder extraction', 'point cloud pipe detection', 'circular target extraction', 'smartphone camera calibration']"
10909,2009.00672,Ilia Rushkin,Ilia Rushkin,Document Similarity from Vector Space Densities,"12 pages, 3 figures","In: Arai K., Kapoor S., Bhatia R. (eds) Intelligent Systems and
  Applications. IntelliSys 2020. Advances in Intelligent Systems and Computing,
  vol 1251. Springer, Cham",10.1007/978-3-030-55187-2_14,,cs.CL cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a computationally light method for estimating similarities between
text documents, which we call the density similarity (DS) method. The method is
based on a word embedding in a high-dimensional Euclidean space and on kernel
regression, and takes into account semantic relations among words. We find that
the accuracy of this method is virtually the same as that of a state-of-the-art
method, while the gain in speed is very substantial. Additionally, we introduce
generalized versions of the top-k accuracy metric and of the Jaccard metric of
agreement between similarity models.
","[{'version': 'v1', 'created': 'Tue, 1 Sep 2020 19:28:51 GMT'}]",2020-09-03,"[['Rushkin', 'Ilia', '']]","['document retrieval', 'text similarity', 'kernel regression', 'word embedding']"
10910,2212.13524,Fabrice Rossi,"Valentina Zelaya Mendiz\'abal (SAMM), Marc Boull\'e, Fabrice Rossi
  (CEREMADE)",Fast and fully-automated histograms for large-scale data sets,,"Computational Statistics and Data Analysis, 2023, 180, pp.107668",10.1016/j.csda.2022.107668,,cs.LG math.ST stat.ML stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  G-Enum histograms are a new fast and fully automated method for irregular
histogram construction. By framing histogram construction as a density
estimation problem and its automation as a model selection task, these
histograms leverage the Minimum Description Length principle (MDL) to derive
two different model selection criteria. Several proven theoretical results
about these criteria give insights about their asymptotic behavior and are used
to speed up their optimisation. These insights, combined to a greedy search
heuristic, are used to construct histograms in linearithmic time rather than
the polynomial time incurred by previous works. The capabilities of the
proposed MDL density estimation method are illustrated with reference to other
fully automated methods in the literature, both on synthetic and large
real-world data sets.
","[{'version': 'v1', 'created': 'Tue, 27 Dec 2022 15:37:10 GMT'}]",2022-12-29,"[['Mendizábal', 'Valentina Zelaya', '', 'SAMM'], ['Boullé', 'Marc', '', 'CEREMADE'], ['Rossi', 'Fabrice', '', 'CEREMADE']]","['Density estimation', 'Histograms', 'Model selection', 'Minimum description length']"
10911,2301.03532,Arshiya Khan,"Arshiya Khan, Chase Cotton","Efficient Attack Detection in IoT Devices using Feature Engineering-Less
  Machine Learning",,"International Journal of Computer Science and Information
  Technology, vol. 14, no. 6, 2022, pp. 47-64",10.5121/ijcsit.2022.14605,,cs.CR cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Through the generalization of deep learning, the research community has
addressed critical challenges in the network security domain, like malware
identification and anomaly detection. However, they have yet to discuss
deploying them on Internet of Things (IoT) devices for day-to-day operations.
IoT devices are often limited in memory and processing power, rendering the
compute-intensive deep learning environment unusable. This research proposes a
way to overcome this barrier by bypassing feature engineering in the deep
learning pipeline and using raw packet data as input. We introduce a feature
engineering-less machine learning (ML) process to perform malware detection on
IoT devices. Our proposed model, ""Feature engineering-less-ML (FEL-ML),"" is a
lighter-weight detection algorithm that expends no extra computations on
""engineered"" features. It effectively accelerates the low-powered IoT edge. It
is trained on unprocessed byte-streams of packets. Aside from providing better
results, it is quicker than traditional feature-based methods. FEL-ML
facilitates resource-sensitive network traffic security with the added benefit
of eliminating the significant investment by subject matter experts in feature
engineering.
","[{'version': 'v1', 'created': 'Mon, 9 Jan 2023 17:26:37 GMT'}]",2023-01-10,"[['Khan', 'Arshiya', ''], ['Cotton', 'Chase', '']]","['Feature engineering-less', 'AI-enabled security', '1D-CNN', 'Internet-of-Things', 'Botnet Attack']"
10912,1905.01960,Tamara Radivilova A,"Tamara Radivilova and Lyudmyla Kirichenko and Dmytro Ageiev and
  Vitalii Bulakh","The Methods to Improve Quality of Service by Accounting Secure
  Parameters","10 pages, 1 figure, 1 equation, 1 table. arXiv admin note: text
  overlap with arXiv:1904.05202","In: Hu Z., Petoukhov S., Dychka I., He M. (eds) Advances in
  Computer Science for Engineering and Education II. ICCSEEA 2019. Advances in
  Intelligent Systems and Computing, vol 938, pp 346-355. 2020. Springer, Cham",10.1007/978-3-030-16621-2_32,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A solution to the problem of ensuring quality of service, providing a greater
number of services with higher efficiency taking into account network security
is proposed. In this paper, experiments were conducted to analyze the effect of
self-similarity and attacks on the quality of service parameters. Method of
buffering and control of channel capacity and calculating of routing cost
method in the network, which take into account the parameters of traffic
multifractality and the probability of detecting attacks in telecommunications
networks were proposed. The both proposed methods accounting the given
restrictions on the delay time and the number of lost packets for every type
quality of service traffic. During simulation the parameters of transmitted
traffic (self-similarity, intensity) and the parameters of network (current
channel load, node buffer size) were changed and the maximum allowable load of
network was determined. The results of analysis show that occurrence of
overload when transmitting traffic over a switched channel associated with
multifractal traffic characteristics and presence of attack. It was shown that
proposed methods can reduce the lost data and improve the efficiency of network
resources.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2019 11:49:37 GMT'}]",2019-05-07,"[['Radivilova', 'Tamara', ''], ['Kirichenko', 'Lyudmyla', ''], ['Ageiev', 'Dmytro', ''], ['Bulakh', 'Vitalii', '']]","['Self-similarity', 'Attack Detection', 'Quality of Service', 'Buffering', 'Routing', 'Fractality', 'Traffic Management']"
10913,2204.01202,Sara Rouhani Dr.,"Evan Madill, Ben Nguyen, Carson K. Leung, Sara Rouhani",ScaleSFL: A Sharding Solution for Blockchain-Based Federated Learning,,,10.1145/3494106.3528680,,cs.DC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Blockchain-based federated learning has gained significant interest over the
last few years with the increasing concern for data privacy, advances in
machine learning, and blockchain innovation. However, gaps in security and
scalability hinder the development of real-world applications. In this study,
we propose ScaleSFL, which is a scalable blockchain-based sharding solution for
federated learning. ScaleSFL supports interoperability by separating the
off-chain federated learning component in order to verify model updates instead
of controlling the entire federated learning flow. We implemented ScaleSFL as a
proof-of-concept prototype system using Hyperledger Fabric to demonstrate the
feasibility of the solution. We present a performance evaluation of results
collected through Hyperledger Caliper benchmarking tools conducted on model
creation. Our evaluation results show that sharding can improve validation
performance linearly while remaining efficient and secure.
","[{'version': 'v1', 'created': 'Mon, 4 Apr 2022 01:50:35 GMT'}]",2022-04-05,"[['Madill', 'Evan', ''], ['Nguyen', 'Ben', ''], ['Leung', 'Carson K.', ''], ['Rouhani', 'Sara', '']]","['Blockchain', 'Consensus', 'Privacy', 'Federated Learning', 'Edge Computing', 'Sharding', 'Hyperledger Fabric']"
10914,1911.02715,Johann Gaebler,"William Cai, Johann Gaebler, Nikhil Garg, Sharad Goel",Fair Allocation through Selective Information Acquisition,"To appear in Proceedings of the 2020 AAAI/ACM Conference on AI,
  Ethics, and Society (AIES). Update: Fully specified the definition of
  threshold policies",,10.1145/3375627.3375823,,cs.CY cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Public and private institutions must often allocate scare resources under
uncertainty. Banks, for example, extend credit to loan applicants based in part
on their estimated likelihood of repaying a loan. But when the quality of
information differs across candidates (e.g., if some applicants lack
traditional credit histories), common lending strategies can lead to
disparities across groups. Here we consider a setting in which decision makers
-- before allocating resources -- can choose to spend some of their limited
budget further screening select individuals. We present a computationally
efficient algorithm for deciding whom to screen that maximizes a standard
measure of social welfare. Intuitively, decision makers should screen
candidates on the margin, for whom the additional information could plausibly
alter the allocation. We formalize this idea by showing the problem can be
reduced to solving a series of linear programs. Both on synthetic and
real-world datasets, this strategy improves utility, illustrating the value of
targeted information acquisition in such decisions. Further, when there is
social value for distributing resources to groups for whom we have a priori
poor information -- like those without credit scores -- our approach can
substantially improve the allocation of limited assets.
","[{'version': 'v1', 'created': 'Thu, 7 Nov 2019 02:09:06 GMT'}, {'version': 'v2', 'created': 'Sat, 28 Dec 2019 17:18:39 GMT'}, {'version': 'v3', 'created': 'Wed, 30 Sep 2020 03:05:05 GMT'}]",2021-10-11,"[['Cai', 'William', ''], ['Gaebler', 'Johann', ''], ['Garg', 'Nikhil', ''], ['Goel', 'Sharad', '']]","['Algorithmic fairness', 'lending', 'information acquisition']"
10915,1806.06258,Joberto Martins Prof. Dr.,"Rafael Freitas Reale, Romildo Martins da S. Bezerra and Joberto S. B.
  Martins",Applying Autonomy with Bandwidth Allocation Models,,"International Journal of Communication Systems, Volume 29, Issue
  13, 10 September 2016, pages 2028 - 2040",10.5281/zenodo.1287913,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Bandwidth Allocation Models (BAMs) are resource allocation methods used for
networks in general. BAMs are currently applied for handling resources such as
bandwidth allocation in MPLS DS-TE networks (LSP setup). In general, BAMs
defines resource restrictions by class and allocate the available resources on
demand. This is frequently necessary to manage large and complex systems like
routing networks. GBAM is a new generalized BAM that, by configuration,
incorporates the behavior of existing BAMs (MAM, RDM, G-RDM and
AllocTC-Sharing). In effect, any current available BAM behavior is reproduced
by G-BAM by simply adjusting its configuration parameters. This paper focuses
on investigating the applicability of using autonomy together with Bandwidth
Allocation Models (BAMs) for improve performance and facilitating the
management of MPLS DS-TE networks. It is investigated the applicability of BAM
switching using a framework with autonomic characteristics. In brief, it is
investigated the switching among BAM behaviors and BAM reconfiguration with
distinct network traffic scenarios by using GBAM. Simulation results suggest
that the autonomic switching of BAM behaviors based on high-level management
rules (SLAs, QoS or other police) may result in improving overall network
management and operational parameters such as link utilization and preemption.
","[{'version': 'v1', 'created': 'Sat, 16 Jun 2018 16:06:10 GMT'}]",2018-06-19,"[['Reale', 'Rafael Freitas', ''], ['Bezerra', 'Romildo Martins da S.', ''], ['Martins', 'Joberto S. B.', '']]","['Bandwidth Allocation Models -BAM', 'Dynamic Resource Management', 'G-BAM', 'BAM Switching']"
10916,2001.09332,Amedeo Buonanno,"Giovanni Di Gennaro, Amedeo Buonanno, Antonio Di Girolamo, Armando
  Ospedale, Francesco A.N. Palmieri, Gianfranco Fedele",An Analysis of Word2Vec for the Italian Language,"Presented at the 2019 Italian Workshop on Neural Networks (WIRN'19) -
  June 2019","Progresses in Artificial Intelligence and Neural Systems. Smart
  Innovation, Systems and Technologies, vol 184. Springer, Singapore - First
  Online: July 2020",10.1007/978-981-15-5093-5_13,,cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Word representation is fundamental in NLP tasks, because it is precisely from
the coding of semantic closeness between words that it is possible to think of
teaching a machine to understand text. Despite the spread of word embedding
concepts, still few are the achievements in linguistic contexts other than
English. In this work, analysing the semantic capacity of the Word2Vec
algorithm, an embedding for the Italian language is produced. Parameter setting
such as the number of epochs, the size of the context window and the number of
negatively backpropagated samples is explored.
","[{'version': 'v1', 'created': 'Sat, 25 Jan 2020 15:12:01 GMT'}]",2020-08-11,"[['Di Gennaro', 'Giovanni', ''], ['Buonanno', 'Amedeo', ''], ['Di Girolamo', 'Antonio', ''], ['Ospedale', 'Armando', ''], ['Palmieri', 'Francesco A. N.', ''], ['Fedele', 'Gianfranco', '']]","['Word2Vec', 'Word Embedding', 'NLP']"
10917,2008.04720,Andy King,"Ed Robbins, Andy King and Jacob M. Howe",Backjumping is Exception Handling,,Theory and Practice of Logic Programming 21 (2021) 125-144,10.1017/S1471068420000435,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  ISO Prolog provides catch and throw to realise the control flow of exception
handling. This pearl demonstrates that catch and throw are inconspicuously
amenable to the implementation of backjumping. In fact, they have precisely the
semantics required: rewinding the search to a specific point, and carrying of a
preserved term to that point. The utility of these properties is demonstrated
through an implementation of graph colouring with backjumping and a backjumping
SAT solver that applies Conflict Driven Clause Learning.
","[{'version': 'v1', 'created': 'Tue, 11 Aug 2020 14:27:22 GMT'}]",2021-07-01,"[['Robbins', 'Ed', ''], ['King', 'Andy', ''], ['Howe', 'Jacob M.', '']]","['Backjumping', 'Exception handling', 'Conflict Driven Clause Learning', 'SAT']"
10918,2106.15342,Leon Abdillah,"Adellia, Leon Andretti Abdillah","Analisis Kualitas Layanan Website E-Commerce Bukalapak Terhadap Kepuasan
  Pengguna Mahasiswa Universitas Bina Darma Menggunakan Metode Webqual 4.0","16 pages, Indonesian language","J. Softw. Eng. Ampera, vol. 1, no. 3, 2020",10.51519/journalsea.v1i3.52,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The growth of new technology, motivates some product marketing to be done
online. One of the factors that support online development is online buying and
selling sites or Electronic Commerce. One of the supporting factors for
Electronic Commerce is using a website. Website or also commonly called the web
is a form of media that can be interpreted as a collection of pages that
display various kinds of text information, data, still or moving images,
animation data, sound, video, both static and dynamic. Electronic Commerce
companies interact with consumers through the web, one of which is the
Bukalapak website, which is an online site provider for buying and selling
products to be marketed. To determine the quality of a website, it is necessary
to measure. By measuring the quality of a website, it can be seen the user's
perception of the website. In this study using the Webqual 4.0 method which
consists of 3 dimensions, namely usability, information quality and interaction
quality on user satisfaction. The data used is primary data which is a source
of data obtained directly from the original source by distributing
questionnaires. The total data obtained are 104 respondents. Respondents in
this study were Bina Darma University students who were expected to provide an
objective assessment of the website to be analyzed.
","[{'version': 'v1', 'created': 'Wed, 23 Jun 2021 10:57:04 GMT'}]",2021-06-30,"[['Adellia', '', ''], ['Abdillah', 'Leon Andretti', '']]","['E-Commerce', 'Kuesioner', 'SPSS', 'Website', 'WebQual 4']"
10919,2204.01305,Imran Daud,"Malik Imran-Daud, Muhammad Shaheen, Abbas Ahmed",Multivariate Microaggregation of Set-Valued Data,,"Information Technology and Control, 51(1), 104-125, 2022",10.5755/j01.itc.51.1.29826,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Data controllers manage immense data, and occasionally, it is released
publically to help the researchers to conduct their studies. However, this
publically shared data may hold personally identifiable information (PII) that
can be collected to re-identify a person. Therefore, an effective anonymization
mechanism is required to anonymize such data before it is released publically.
Microaggregation is one of the Statistical Disclosure Control (SDC) methods
that are widely used by many researchers. This method adapts the k-anonymity
principle to generate k-indistinguishable records in the same clusters to
preserve the privacy of the individuals. However, in these methods, the size of
the clusters is fixed (i.e., k records), and the clusters generated through
these methods may hold non-homogeneous records. By considering these issues, we
propose an adaptive size clustering technique that aggregates homogeneous
records in similar clusters, and the size of the clusters is determined after
the semantic analysis of the records. To achieve this, we extend the MDAV
microaggregation algorithm to semantically analyze the unstructured records by
relying on the taxonomic databases (i.e., WordNet), and then aggregating them
in homogeneous clusters. Furthermore, we propose a distance measure that
determines the extent to which the records differ from each other, and based on
this, homogeneous adaptive clusters are constructed. In experiments, we
measured the cohesiveness of the clusters in order to gauge the homogeneity of
records. In addition, a method is proposed to measure information loss caused
by the redaction method. In experiments, the results show that the proposed
mechanism outperforms the existing state-of-the-art solutions.
","[{'version': 'v1', 'created': 'Mon, 4 Apr 2022 08:24:55 GMT'}]",2022-04-05,"[['Imran-Daud', 'Malik', ''], ['Shaheen', 'Muhammad', ''], ['Ahmed', 'Abbas', '']]","['Microaggregation', 'Anonymization', 'MDAV', 'Clusters', 'Privacy']"
10920,2208.08482,Huaishu Peng,"Jiasheng Li, Zeyu Yan, Ebrima Jarjue, Ashrith Shetty, Huaishu Peng",TangibleGrid: Tangible Web Layout Design for Blind Users,,"UIST '22, October 29-November 2, 2022, Bend, OR, USA",10.1145/3526113.3545627,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present TangibleGrid, a novel device that allows blind users to understand
and design the layout of a web page with real-time tangible feedback. We
conducted semi-structured interviews and a series of co-design sessions with
blind users to elicit insights that guided the design of TangibleGrid. Our
final prototype contains shape-changing brackets representing the web elements
and a baseboard representing the web page canvas. Blind users can design a web
page layout through creating and editing web elements by snapping or adjusting
tangible brackets on top of the baseboard. The baseboard senses the brackets'
type, size, and location, verbalizes the information, and renders the web page
on the client browser. Through a formative user study, we found that blind
users could understand a web page layout through TangibleGrid. They were also
able to design a new web layout from scratch without the help of sighted
people.
","[{'version': 'v1', 'created': 'Wed, 17 Aug 2022 18:51:18 GMT'}, {'version': 'v2', 'created': 'Sat, 27 Aug 2022 21:14:18 GMT'}]",2022-08-30,"[['Li', 'Jiasheng', ''], ['Yan', 'Zeyu', ''], ['Jarjue', 'Ebrima', ''], ['Shetty', 'Ashrith', ''], ['Peng', 'Huaishu', '']]","['Accessible web design', 'tactile feedback', 'tangible user interface', 'visual impairment', 'accessibility']"
10921,1902.04882,Matthew England Dr,"R. Bradford, J.H. Davenport, M. England, H. Errami, V. Gerdt, D.
  Grigoriev, C. Hoyt, M. Kosta, O. Radulescu, T. Sturm, and A. Weber","Identifying the Parametric Occurrence of Multiple Steady States for some
  Biological Networks","60 pages - author preprint. Accepted in the Journal of Symbolic
  Computation","Journal of Symbolic Computation, volume 98, pp. 84 - 119, Elsevier
  2020",10.1016/j.jsc.2019.07.008,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a problem from biological network analysis of determining regions
in a parameter space over which there are multiple steady states for positive
real values of variables and parameters. We describe multiple approaches to
address the problem using tools from Symbolic Computation. We describe how
progress was made to achieve semi-algebraic descriptions of the
multistationarity regions of parameter space, and compare symbolic results to
numerical methods. The biological networks studied are models of the
mitogen-activated protein kinases (MAPK) network which has already consumed
considerable effort using special insights into its structure of corresponding
models. Our main example is a model with 11 equations in 11 variables and 19
parameters, 3 of which are of interest for symbolic treatment. The model also
imposes positivity conditions on all variables and parameters.
  We apply combinations of symbolic computation methods designed for mixed
equality/inequality systems, specifically virtual substitution, lazy real
triangularization and cylindrical algebraic decomposition, as well as a
simplification technique adapted from Gaussian elimination and graph theory. We
are able to determine multistationarity of our main example over a
2-dimensional parameter space. We also study a second MAPK model and a symbolic
grid sampling technique which can locate such regions in 3-dimensional
parameter space.
","[{'version': 'v1', 'created': 'Wed, 13 Feb 2019 13:12:34 GMT'}]",2019-11-25,"[['Bradford', 'R.', ''], ['Davenport', 'J. H.', ''], ['England', 'M.', ''], ['Errami', 'H.', ''], ['Gerdt', 'V.', ''], ['Grigoriev', 'D.', ''], ['Hoyt', 'C.', ''], ['Kosta', 'M.', ''], ['Radulescu', 'O.', ''], ['Sturm', 'T.', ''], ['Weber', 'A.', '']]","['Mixed Equation / Inequality Solving', 'Real QuantifierElimination', 'Biological Networks', 'Signaling Pathways', 'MAPK']"
10922,2205.01351,Willy Scheibel,"Fabian Heseding, Willy Scheibel, J\""urgen D\""ollner",Tooling for Time- and Space-efficient git Repository Mining,,,10.1145/3524842.3528503,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software projects under version control grow with each commit, accumulating
up to hundreds of thousands of commits per repository. Especially for such
large projects, the traversal of a repository and data extraction for static
source code analysis poses a trade-off between granularity and speed. We
showcase the command-line tool pyrepositoryminer that combines a set of
optimization approaches for efficient traversal and data extraction from git
repositories while being adaptable to third-party and custom software metrics
and data extractions. The tool is written in Python and combines bare
repository access, in-memory storage, parallelization, caching, change-based
analysis, and optimized communication between the traversal and custom data
extraction components. The tool allows for both metrics written in Python and
external programs for data extraction. A single-thread performance evaluation
based on a basic mining use case shows a mean speedup of 15.6x to other freely
available tools across four mid-sized open source projects. A multi-threaded
execution allows for load distribution among cores and, thus, a mean speedup up
to 86.9x using 12 threads.
","[{'version': 'v1', 'created': 'Tue, 3 May 2022 07:25:59 GMT'}]",2022-05-04,"[['Heseding', 'Fabian', ''], ['Scheibel', 'Willy', ''], ['Döllner', 'Jürgen', '']]","['Mining Software Repositories', 'Python', 'Git']"
10923,2010.01240,Kesha Hietala,"Kesha Hietala, Robert Rand, Shih-Han Hung, Liyi Li and Michael Hicks",Proving Quantum Programs Correct,"version 4 updated DOI (paper content is the same); version 3 (final
  version) has updated formatting and improved writing; version 2 includes
  updated acknowledgments and a new appendix with simple SQIR example programs",,10.4230/LIPIcs.ITP.2021.21,,cs.PL quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As quantum computing progresses steadily from theory into practice,
programmers will face a common problem: How can they be sure that their code
does what they intend it to do? This paper presents encouraging results in the
application of mechanized proof to the domain of quantum programming in the
context of the SQIR development. It verifies the correctness of a range of a
quantum algorithms including Grover's algorithm and quantum phase estimation, a
key component of Shor's algorithm. In doing so, it aims to highlight both the
successes and challenges of formal verification in the quantum context and
motivate the theorem proving community to target quantum computing as an
application domain.
","[{'version': 'v1', 'created': 'Sat, 3 Oct 2020 00:55:41 GMT'}, {'version': 'v2', 'created': 'Sun, 27 Dec 2020 22:00:20 GMT'}, {'version': 'v3', 'created': 'Tue, 20 Apr 2021 21:00:09 GMT'}, {'version': 'v4', 'created': 'Tue, 13 Jul 2021 18:50:44 GMT'}]",2021-07-15,"[['Hietala', 'Kesha', ''], ['Rand', 'Robert', ''], ['Hung', 'Shih-Han', ''], ['Li', 'Liyi', ''], ['Hicks', 'Michael', '']]","['Formal Verification', 'Quantum Computing', 'Proof Engineering']"
10924,2003.09177,Morten Hannemose,Morten Hannemose and Jakob Wilm and Jeppe Revall Frisvad,Superaccurate Camera Calibration via Inverse Rendering,"10 pages, 6 figures",,10.1117/12.2531769,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The most prevalent routine for camera calibration is based on the detection
of well-defined feature points on a purpose-made calibration artifact. These
could be checkerboard saddle points, circles, rings or triangles, often printed
on a planar structure. The feature points are first detected and then used in a
nonlinear optimization to estimate the internal camera parameters.We propose a
new method for camera calibration using the principle of inverse rendering.
Instead of relying solely on detected feature points, we use an estimate of the
internal parameters and the pose of the calibration object to implicitly render
a non-photorealistic equivalent of the optical features. This enables us to
compute pixel-wise differences in the image domain without interpolation
artifacts. We can then improve our estimate of the internal parameters by
minimizing pixel-wise least-squares differences. In this way, our model
optimizes a meaningful metric in the image space assuming normally distributed
noise characteristic for camera sensors.We demonstrate using synthetic and real
camera images that our method improves the accuracy of estimated camera
parameters as compared with current state-of-the-art calibration routines. Our
method also estimates these parameters more robustly in the presence of noise
and in situations where the number of calibration images is limited.
","[{'version': 'v1', 'created': 'Fri, 20 Mar 2020 10:26:16 GMT'}]",2020-03-23,"[['Hannemose', 'Morten', ''], ['Wilm', 'Jakob', ''], ['Frisvad', 'Jeppe Revall', '']]","['camera calibration', 'inverse rendering', 'camera intrinsics']"
10925,2206.05355,Manuel Gentile,Agnese Augello and Manuel Gentile and Frank Dignum,Social Practices for Social Driven Conversations in Serious Games,,,10.1007/978-3-319-50182-6_12,,cs.AI cs.HC,http://creativecommons.org/licenses/by/4.0/,"  This paper describes the model of social practice as a theoretical framework
to manage conversation with the specific goal of training physicians in
communicative skills. To this aim, the domain reasoner that manages the
conversation in the Communicate! \cite{jeuring} serious game is taken as a
basis. Because the choice of a specific Social Practice to follow in a
situation is non-trivial we use a probabilistic model for the selection of
social practices as a step toward the implementation of an agent architecture
compliant with the social practice model.
","[{'version': 'v1', 'created': 'Fri, 10 Jun 2022 20:56:24 GMT'}]",2022-06-14,"[['Augello', 'Agnese', ''], ['Gentile', 'Manuel', ''], ['Dignum', 'Frank', '']]","['Social practice', 'Serious Games', 'Physicians Training', 'Communicative Skills']"
10926,1910.05243,Md. Mirajul Islam,"Sharmin Akther Purabi, Rayhan Rashed, Md. Mirajul Islam, Md. Nahiyan
  Uddin, Mahmuda Naznin, and A. B. M. Alim Al Islam","As You Are, So Shall You Move Your Head: A System-Level Analysis between
  Head Movements and Corresponding Traits and Emotions","9 pages, 7 figures, NSysS 2019",,10.1145/3362966.3362985,,cs.HC cs.IR cs.LG cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identifying physical traits and emotions based on system-sensed physical
activities is a challenging problem in the realm of human-computer interaction.
Our work contributes in this context by investigating an underlying connection
between head movements and corresponding traits and emotions. To do so, we
utilize a head movement measuring device called eSense, which gives
acceleration and rotation of a head. Here, first, we conduct a thorough study
over head movement data collected from 46 persons using eSense while inducing
five different emotional states over them in isolation. Our analysis reveals
several new head movement based findings, which in turn, leads us to a novel
unified solution for identifying different human traits and emotions through
exploiting machine learning techniques over head movement data. Our analysis
confirms that the proposed solution can result in high accuracy over the
collected data. Accordingly, we develop an integrated unified solution for
real-time emotion and trait identification using head movement data leveraging
outcomes of our analysis.
","[{'version': 'v1', 'created': 'Fri, 11 Oct 2019 15:22:37 GMT'}]",2019-10-14,"[['Purabi', 'Sharmin Akther', ''], ['Rashed', 'Rayhan', ''], ['Islam', 'Md. Mirajul', ''], ['Uddin', 'Md. Nahiyan', ''], ['Naznin', 'Mahmuda', ''], ['Islam', 'A. B. M. Alim Al', '']]","['head movement', 'emotion', 'machine learning', 'traits', 'ubiquitous']"
10927,1810.02486,Mostafa Zaman Chowdhury,"Mostafa Zaman Chowdhury, Yeong Min Jang, and Zygmunt J. Haas","Interference Mitigation Using Dynamic Frequency Re-use for Dense
  Femtocell Network Architectures","International Conference on Ubiquitous and Future Networks (ICUFN),
  June 2010, Jeju, Korea, pp. 256-261",,10.1109/ICUFN.2010.5547193,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The next generation network aims to efficiently deploy low cost and low power
cellular base station in the subscriber's home environment. For the femtocell
deployment, frequency allocation among femtocells and macrocell is big concern
to mitigate the interference, and to ensure the best use of the expensive
spectrum. There are many sources of interference in integrated
femtocell/macrocell networks. Lagging in proper management of interference
reduces the system capacity, increases the outage probability, and finally
users feel bad quality of experience (QoE). The cost effective interference
management technique depends on the size of femtocells deployment. In this
paper, firstly we present deployable various possible femtocell network
scenarios. We propose the dynamic frequency re-use scheme to mitigate
interference for femtocell deployment. For highly dense femtocells, we propose
the functionalities of self organizing network (SON) based femtocell network
architecture. The outage probability of a femtocell user is analyzed in
details. The performances of the proposed schemes for various femtocell
deployments are performed using numerical analysis.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 01:38:23 GMT'}]",2018-10-08,"[['Chowdhury', 'Mostafa Zaman', ''], ['Jang', 'Yeong Min', ''], ['Haas', 'Zygmunt J.', '']]","['⎯ Femtocell', 'macrocell', 'interference management', 'frequency allocation', 'SON', 'outage probability']"
10928,1909.13670,Se Kwon Lee,"Se Kwon Lee, Jayashree Mohan, Sanidhya Kashyap, Taesoo Kim, Vijay
  Chidambaram",RECIPE : Converting Concurrent DRAM Indexes to Persistent-Memory Indexes,3pages: Added one more reference,,10.1145/3341301.3359635,,cs.DC cs.DB cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present Recipe, a principled approach for converting concurrent DRAM
indexes into crash-consistent indexes for persistent memory (PM). The main
insight behind Recipe is that isolation provided by a certain class of
concurrent in-memory indexes can be translated with small changes to
crash-consistency when the same index is used in PM. We present a set of
conditions that enable the identification of this class of DRAM indexes, and
the actions to be taken to convert each index to be persistent. Based on these
conditions and conversion actions, we modify five different DRAM indexes based
on B+ trees, tries, radix trees, and hash tables to their crash-consistent PM
counterparts. The effort involved in this conversion is minimal, requiring
30-200 lines of code. We evaluated the converted PM indexes on Intel DC
Persistent Memory, and found that they outperform state-of-the-art,
hand-crafted PM indexes in multi-threaded workloads by up-to 5.2x. For example,
we built P-CLHT, our PM implementation of the CLHT hash table by modifying only
30 LOC. When running YCSB workloads, P-CLHT performs up to 2.4x better than
Cacheline-Conscious Extendible Hashing (CCEH), the state-of-the-art PM hash
table.
","[{'version': 'v1', 'created': 'Mon, 23 Sep 2019 02:21:18 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Oct 2019 16:59:31 GMT'}, {'version': 'v3', 'created': 'Wed, 6 Nov 2019 04:03:04 GMT'}, {'version': 'v4', 'created': 'Fri, 8 Nov 2019 18:23:08 GMT'}]",2019-11-11,"[['Lee', 'Se Kwon', ''], ['Mohan', 'Jayashree', ''], ['Kashyap', 'Sanidhya', ''], ['Kim', 'Taesoo', ''], ['Chidambaram', 'Vijay', '']]","['Persistent Memory', 'Data Structures', 'Indexing', 'Crash Consistency', 'Concurrency', 'Isolation']"
10929,2201.05461,Hamed Malek,"Maryam Sajde, Hamed Malek, Mehran Mohsenzadeh","RecoMed: A Knowledge-Aware Recommender System for Hypertension
  Medications",,"Informatics in Medicine Unlocked, vol. 30, p. 100950, Jan. 2022",10.1016/j.imu.2022.100950,,cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Background and Objective High medicine diversity has always been a
significant challenge for prescription, causing confusion or doubt in
physicians' decision-making process. This paper aims to develop a medicine
recommender system called RecoMed to aid the physician in the prescription
process of hypertension by providing information about what medications have
been prescribed by other doctors and figuring out what other medicines can be
recommended in addition to the one in question. Methods There are two steps to
the developed method: First, association rule mining algorithms are employed to
find medicine association rules. The second step entails graph mining and
clustering to present an enriched recommendation via ATC code, which itself
comprises several steps. First, the initial graph is constructed from
historical prescription data. Then, data pruning is performed in the second
step, after which the medicines with a high repetition rate are removed at the
discretion of a general medical practitioner. Next, the medicines are matched
to a well-known medicine classification system called the ATC code to provide
an enriched recommendation. And finally, the DBSCAN and Louvain algorithms
cluster medicines in the final step. Results A list of recommended medicines is
provided as the system's output, and physicians can choose one or more of the
medicines based on the patient's clinical symptoms. Only the medicines of class
2, related to high blood pressure medications, are used to assess the system's
performance. The results obtained from this system have been reviewed and
confirmed by an expert in this field.
","[{'version': 'v1', 'created': 'Sun, 9 Jan 2022 08:01:41 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Jun 2022 14:40:57 GMT'}]",2022-06-10,"[['Sajde', 'Maryam', ''], ['Malek', 'Hamed', ''], ['Mohsenzadeh', 'Mehran', '']]","['Medicine recommender systems', 'Healthcare system', 'Hypertension', 'ATC code']"
10930,2101.10602,Shengchen Zhang,"Shengchen Zhang, Zixuan Wang, Chaoran Chen, Yi Dai, Lyumanshan Ye,
  Xiaohua Sun","Patterns for Representing Knowledge Graphs to Communicate Situational
  Knowledge of Service Robots","12 pages, 13 figures. Published in CHI 2021",,10.1145/3411764.3445767,,cs.HC cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Service robots are envisioned to be adaptive to their working environment
based on situational knowledge. Recent research focused on designing visual
representation of knowledge graphs for expert users. However, how to generate
an understandable interface for non-expert users remains to be explored. In
this paper, we use knowledge graphs (KGs) as a common ground for knowledge
exchange and develop a pattern library for designing KG interfaces for
non-expert users. After identifying the types of robotic situational knowledge
from the literature, we present a formative study in which participants used
cards to communicate the knowledge for given scenarios. We iteratively coded
the results and identified patterns for representing various types of
situational knowledge. To derive design recommendations for applying the
patterns, we prototyped a lab service robot and conducted Wizard-of-Oz testing.
The patterns and recommendations could provide useful guidance in designing
knowledge-exchange interfaces for robots.
","[{'version': 'v1', 'created': 'Tue, 26 Jan 2021 07:30:49 GMT'}]",2021-01-27,"[['Zhang', 'Shengchen', ''], ['Wang', 'Zixuan', ''], ['Chen', 'Chaoran', ''], ['Dai', 'Yi', ''], ['Ye', 'Lyumanshan', ''], ['Sun', 'Xiaohua', '']]","['Design Patterns', 'Interface Design', 'Knowledge Graph', 'Human-RobotInteraction']"
10931,1601.06206,Jose Moura,"Jose Moura, Carlos Serrao",Security and Privacy Issues of Big Data,"In book Handbook of Research on Trends and Future Directions in Big
  Data and Web Intelligence, IGI Global, 2015",,10.4018/978-1-4666-8505-5.ch002,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This chapter revises the most important aspects in how computing
infrastructures should be configured and intelligently managed to fulfill the
most notably security aspects required by Big Data applications. One of them is
privacy. It is a pertinent aspect to be addressed because users share more and
more personal data and content through their devices and computers to social
networks and public clouds. So, a secure framework to social networks is a very
hot topic research. This last topic is addressed in one of the two sections of
the current chapter with case studies. In addition, the traditional mechanisms
to support security such as firewalls and demilitarized zones are not suitable
to be applied in computing systems to support Big Data. SDN is an emergent
management solution that could become a convenient mechanism to implement
security in Big Data systems, as we show through a second case study at the end
of the chapter. This also discusses current relevant work and identifies open
issues.
","[{'version': 'v1', 'created': 'Fri, 22 Jan 2016 23:33:09 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Jan 2016 18:12:42 GMT'}]",2016-01-28,"[['Moura', 'Jose', ''], ['Serrao', 'Carlos', '']]","['Big Data', 'Security', 'Privacy', 'Data Ownership', 'Cloud', 'Social Applications', 'Intrusion Detection', 'Intrusion Prevention']"
10932,2112.01921,Saikat Ray Majumder,"Sarah Felix, Saikat Ray Majumder, H. Kirk Mathews, Michael Lexa,
  Gabriel Lipsa, Xiaohu Ping, Subhrajit Roychowdhury, Thomas Spears","In situ process quality monitoring and defect detection for direct metal
  laser melting","16 pages, 4 figures","Sci Rep 12, 8503 (2022)",10.1038/s41598-022-12381-4,,cs.LG cs.SY eess.SY physics.data-an physics.ins-det,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Quality control and quality assurance are challenges in Direct Metal Laser
Melting (DMLM). Intermittent machine diagnostics and downstream part
inspections catch problems after undue cost has been incurred processing
defective parts. In this paper we demonstrate two methodologies for in-process
fault detection and part quality prediction that can be readily deployed on
existing commercial DMLM systems with minimal hardware modification. Novel
features were derived from the time series of common photodiode sensors along
with standard machine control signals. A Bayesian approach attributes
measurements to one of multiple process states and a least squares regression
model predicts severity of certain material defects.
","[{'version': 'v1', 'created': 'Fri, 3 Dec 2021 14:05:31 GMT'}]",2022-06-20,"[['Felix', 'Sarah', ''], ['Majumder', 'Saikat Ray', ''], ['Mathews', 'H. Kirk', ''], ['Lexa', 'Michael', ''], ['Lipsa', 'Gabriel', ''], ['Ping', 'Xiaohu', ''], ['Roychowdhury', 'Subhrajit', ''], ['Spears', 'Thomas', '']]","['Additive Manufacturing', 'Process monitoring', 'Direct Metal Laser Melting', 'Defect Classification']"
10933,2003.05238,Farah Karim Ms,"Farah Karim and Maria-Esther Vidal and S\""oren Auer",Compacting Frequent Star Patterns in RDF Graphs,,,10.1007/s10844-020-00595-9,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge graphs have become a popular formalism for representing entities
and their properties using a graph data model, e.g., the Resource Description
Framework (RDF). An RDF graph comprises entities of the same type connected to
objects or other entities using labeled edges annotated with properties. RDF
graphs usually contain entities that share the same objects in a certain group
of properties, i.e., they match star patterns composed of these properties and
objects. In case the number of these entities or properties in these star
patterns is large, the size of the RDF graph and query processing are
negatively impacted; we refer these star patterns as frequent star patterns. We
address the problem of identifying frequent star patterns in RDF graphs and
devise the concept of factorized RDF graphs, which denote compact
representations of RDF graphs where the number of frequent star patterns is
minimized. We also develop computational methods to identify frequent star
patterns and generate a factorized RDF graph, where compact RDF molecules
replace frequent star patterns. A compact RDF molecule of a frequent star
pattern denotes an RDF subgraph that instantiates the corresponding star
pattern. Instead of having all the entities matching the original frequent star
pattern, a surrogate entity is added and related to the properties of the
frequent star pattern; it is linked to the entities that originally match the
frequent star pattern. We evaluate the performance of our factorization
techniques on several RDF graph benchmarks and compare with a baseline built on
top of gSpan, a state-of-the-art algorithm to detect frequent patterns. The
outcomes evidence the efficiency of proposed approach and show that our
techniques are able to reduce execution time of the baseline approach in at
least three orders of magnitude reducing the RDF graph size by up to 66.56%.
","[{'version': 'v1', 'created': 'Wed, 11 Mar 2020 11:55:37 GMT'}]",2020-03-12,"[['Karim', 'Farah', ''], ['Vidal', 'Maria-Esther', ''], ['Auer', 'Sören', '']]","['Semantic Web', 'RDF Compaction', 'Linked Data', 'Knowledge Graph']"
10934,2201.10527,Andr\'e Beck,"Gustavo Assis da Silva, Eduardo Lenz Cardoso, Andre T. Beck","Comparison of robust, reliability-based and non-probabilistic topology
  optimization under uncertain loads and stress constraints","16 pages, 5 figures",Probabilistic Engineering Mechanics 59 (2020) 103039,10.1016/j.probengmech.2020.103039,,cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  It is nowadays widely acknowledged that optimal structural design should be
robust with respect to the uncertainties in loads and material parameters.
However, there are several alternatives to consider such uncertainties in
structural optimization problems. This paper presents a comprehensive
comparison between the results of three different approaches to topology
optimization under uncertain loading, considering stress constraints: 1) the
robust formulation, which requires only the mean and standard deviation of
stresses at each element; 2) the reliability-based formulation, which imposes a
reliability constraint on computed stresses; 3) the non-probabilistic
formulation, which considers a worst-case scenario for the stresses caused by
uncertain loads. The information required by each method, regarding the
uncertain loads, and the uncertainty propagation approach used in each case is
quite different. The robust formulation requires only mean and standard
deviation of uncertain loads; stresses are computed via a first-order
perturbation approach. The reliability-based formulation requires full
probability distributions of random loads, reliability constraints are computed
via a first-order performance measure approach. The non-probabilistic
formulation is applicable for bounded uncertain loads; only lower and upper
bounds are used, and worst-case stresses are computed via a nested optimization
with anti-optimization. The three approaches are quite different in the
handling of uncertainties; however, the basic topology optimization framework
is the same: the traditional density approach is employed for material
parameterization, while the augmented Lagrangian method is employed to solve
the resulting problem, in order to handle the large number of stress
constraints.
","[{'version': 'v1', 'created': 'Tue, 25 Jan 2022 18:31:16 GMT'}]",2022-01-26,"[['da Silva', 'Gustavo Assis', ''], ['Cardoso', 'Eduardo Lenz', ''], ['Beck', 'Andre T.', '']]","['Topology optimization', 'Robust design optimization', 'Reliability-based design optimization', 'Anti-optimization', 'Stress constraints']"
10935,2205.05498,Erik Fredericks,"Erik M. Fredericks, Byron DeVries, Jared M. Moore",Towards Self-Adaptive Game Logic,,,10.1145/3524494.3527625,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-adaptive systems (SAS) can reconfigure at run time in response to
changing situations to express acceptable behaviors in the face of uncertainty.
With respect to game design, such situations may include user input, emergent
behaviors, performance concerns, and combinations thereof. Typically an SAS is
modeled as a feedback loop that functions within an existing system, with
operations including monitoring, analyzing, planning, and executing (i.e.,
MAPE-K) to enable online reconfiguration. This paper presents a conceptual
approach for extending software engineering artifacts to be self-adaptive
within the context of game design. We have modified a game developed for
creative coding education to include a MAPE-K self-adaptive feedback loop,
comprising run-time adaptation capabilities and the software artifacts required
to support adaptation.
","[{'version': 'v1', 'created': 'Wed, 11 May 2022 13:39:13 GMT'}]",2022-05-12,"[['Fredericks', 'Erik M.', ''], ['DeVries', 'Byron', ''], ['Moore', 'Jared M.', '']]","['self-adaptive systems', 'software engineering', 'creative coding', 'gamedesign']"
10936,2209.05773,Zijie Wang,"Zijie Wang, Aichun Zhu, Jingyi Xue, Xili Wan, Chao Liu, Tian Wang,
  Yifeng Li","CAIBC: Capturing All-round Information Beyond Color for Text-based
  Person Retrieval",Accepted on ACM MM '22,,10.1145/3503161.3548057,,cs.CV cs.IR cs.MM,http://creativecommons.org/licenses/by/4.0/,"  Given a natural language description, text-based person retrieval aims to
identify images of a target person from a large-scale person image database.
Existing methods generally face a \textbf{color over-reliance problem}, which
means that the models rely heavily on color information when matching
cross-modal data. Indeed, color information is an important decision-making
accordance for retrieval, but the over-reliance on color would distract the
model from other key clues (e.g. texture information, structural information,
etc.), and thereby lead to a sub-optimal retrieval performance. To solve this
problem, in this paper, we propose to \textbf{C}apture \textbf{A}ll-round
\textbf{I}nformation \textbf{B}eyond \textbf{C}olor (\textbf{CAIBC}) via a
jointly optimized multi-branch architecture for text-based person retrieval.
CAIBC contains three branches including an RGB branch, a grayscale (GRS) branch
and a color (CLR) branch. Besides, with the aim of making full use of all-round
information in a balanced and effective way, a mutual learning mechanism is
employed to enable the three branches which attend to varied aspects of
information to communicate with and learn from each other. Extensive
experimental analysis is carried out to evaluate our proposed CAIBC method on
the CUHK-PEDES and RSTPReid datasets in both \textbf{supervised} and
\textbf{weakly supervised} text-based person retrieval settings, which
demonstrates that CAIBC significantly outperforms existing methods and achieves
the state-of-the-art performance on all the three tasks.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2022 07:10:58 GMT'}]",2022-09-14,"[['Wang', 'Zijie', ''], ['Zhu', 'Aichun', ''], ['Xue', 'Jingyi', ''], ['Wan', 'Xili', ''], ['Liu', 'Chao', ''], ['Wang', 'Tian', ''], ['Li', 'Yifeng', '']]","['Text-based Person Retrieval', 'Person Re-identification', 'Cross-modalRetrieval', 'Multi-branch', 'Color Information', 'Mutual Learning']"
10937,2004.12482,Damian Kowalczyk,"Christoffer Riis, Damian Konrad Kowalczyk, Lars Kai Hansen","On the Limits to Multi-Modal Popularity Prediction on Instagram -- A New
  Robust, Efficient and Explainable Baseline",Presented at ICAART 2021,"Proceedings of the 13th International Conference on Agents and
  Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-484-8, pages
  1200-1209, 2021",10.5220/0010377112001209,,cs.CV cs.SI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Our global population contributes visual content on platforms like Instagram,
attempting to express themselves and engage their audiences, at an
unprecedented and increasing rate. In this paper, we revisit the popularity
prediction on Instagram. We present a robust, efficient, and explainable
baseline for population-based popularity prediction, achieving strong ranking
performance. We employ the latest methods in computer vision to maximize the
information extracted from the visual modality. We use transfer learning to
extract visual semantics such as concepts, scenes, and objects, allowing a new
level of scrutiny in an extensive, explainable ablation study. We inform
feature selection towards a robust and scalable model, but also illustrate
feature interactions, offering new directions for further inquiry in
computational social science. Our strongest models inform a lower limit to
population-based predictability of popularity on Instagram. The models are
immediately applicable to social media monitoring and influencer
identification.
","[{'version': 'v1', 'created': 'Sun, 26 Apr 2020 21:21:50 GMT'}, {'version': 'v2', 'created': 'Sat, 20 Feb 2021 13:39:45 GMT'}]",2021-02-23,"[['Riis', 'Christoffer', ''], ['Kowalczyk', 'Damian Konrad', ''], ['Hansen', 'Lars Kai', '']]","['Visual', 'Popularity', 'Explainable', 'Instagram', 'Social']"
10938,1506.08781,Richard Preen,Richard J. Preen and Larry Bull,On Design Mining: Coevolution and Surrogate Models,,"Artificial Life (2017), 23(2):186-205",10.1162/ARTL_a_00225,,cs.NE cs.AI cs.CE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Design mining is the use of computational intelligence techniques to
iteratively search and model the attribute space of physical objects evaluated
directly through rapid prototyping to meet given objectives. It enables the
exploitation of novel materials and processes without formal models or complex
simulation. In this paper, we focus upon the coevolutionary nature of the
design process when it is decomposed into concurrent sub-design threads due to
the overall complexity of the task. Using an abstract, tuneable model of
coevolution we consider strategies to sample sub-thread designs for whole
system testing and how best to construct and use surrogate models within the
coevolutionary scenario. Drawing on our findings, the paper then describes the
effective design of an array of six heterogeneous vertical-axis wind turbines.
","[{'version': 'v1', 'created': 'Mon, 29 Jun 2015 18:57:34 GMT'}, {'version': 'v2', 'created': 'Sat, 25 Jul 2015 14:05:42 GMT'}, {'version': 'v3', 'created': 'Fri, 31 Jul 2015 17:29:20 GMT'}, {'version': 'v4', 'created': 'Mon, 15 Feb 2016 14:43:39 GMT'}, {'version': 'v5', 'created': 'Wed, 26 Oct 2016 22:09:08 GMT'}, {'version': 'v6', 'created': 'Wed, 23 Nov 2016 20:24:17 GMT'}]",2022-12-05,"[['Preen', 'Richard J.', ''], ['Bull', 'Larry', '']]","['3D printing', 'coevolution', 'shape optimisation', 'surrogate models', 'turbine', 'wind energy']"
10939,2005.00397,Brighter Agyemang,"Brighter Agyemang and Wei-Ping Wu and Michael Yelpengne Kpiebaareh and
  Zhihua Lei and Ebenezer Nanor and Lei Chen","Multi-View Self-Attention for Interpretable Drug-Target Interaction
  Prediction",,,10.1016/j.jbi.2020.103547,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The drug discovery stage is a vital aspect of the drug development process
and forms part of the initial stages of the development pipeline. In recent
times, machine learning-based methods are actively being used to model
drug-target interactions for rational drug discovery due to the successful
application of these methods in other domains. In machine learning approaches,
the numerical representation of molecules is critical to the performance of the
model. While significant progress has been made in molecular representation
engineering, this has resulted in several descriptors for both targets and
compounds. Also, the interpretability of model predictions is a vital feature
that could have several pharmacological applications. In this study, we propose
a self-attention-based multi-view representation learning approach for modeling
drug-target interactions. We evaluated our approach using three benchmark
kinase datasets and compared the proposed method to some baseline models. Our
experimental results demonstrate the ability of our method to achieve
competitive prediction performance and offer biologically plausible drug-target
interaction interpretations.
","[{'version': 'v1', 'created': 'Fri, 1 May 2020 14:28:17 GMT'}, {'version': 'v2', 'created': 'Sun, 23 Aug 2020 14:49:47 GMT'}]",2020-09-02,"[['Agyemang', 'Brighter', ''], ['Wu', 'Wei-Ping', ''], ['Kpiebaareh', 'Michael Yelpengne', ''], ['Lei', 'Zhihua', ''], ['Nanor', 'Ebenezer', ''], ['Chen', 'Lei', '']]","['Drug-Target Interactions', 'Machine Learning', 'Representation']"
10940,2106.06054,Sumon Biswas,Sumon Biswas and Hridesh Rajan,"Fair Preprocessing: Towards Understanding Compositional Fairness of Data
  Transformers in Machine Learning Pipeline","ESEC/FSE'2021: The 29th ACM Joint European Software Engineering
  Conference and Symposium on the Foundations of Software Engineering, Athens,
  Greece, August 23-28, 2021",Proceedings of the ESEC/FSE 2021,10.1145/3468264.3468536,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  In recent years, many incidents have been reported where machine learning
models exhibited discrimination among people based on race, sex, age, etc.
Research has been conducted to measure and mitigate unfairness in machine
learning models. For a machine learning task, it is a common practice to build
a pipeline that includes an ordered set of data preprocessing stages followed
by a classifier. However, most of the research on fairness has considered a
single classifier based prediction task. What are the fairness impacts of the
preprocessing stages in machine learning pipeline? Furthermore, studies showed
that often the root cause of unfairness is ingrained in the data itself, rather
than the model. But no research has been conducted to measure the unfairness
caused by a specific transformation made in the data preprocessing stage. In
this paper, we introduced the causal method of fairness to reason about the
fairness impact of data preprocessing stages in ML pipeline. We leveraged
existing metrics to define the fairness measures of the stages. Then we
conducted a detailed fairness evaluation of the preprocessing stages in 37
pipelines collected from three different sources. Our results show that certain
data transformers are causing the model to exhibit unfairness. We identified a
number of fairness patterns in several categories of data transformers.
Finally, we showed how the local fairness of a preprocessing stage composes in
the global fairness of the pipeline. We used the fairness composition to choose
appropriate downstream transformer that mitigates unfairness in the machine
learning pipeline.
","[{'version': 'v1', 'created': 'Wed, 2 Jun 2021 20:39:52 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Jun 2021 17:22:22 GMT'}, {'version': 'v3', 'created': 'Fri, 18 Jun 2021 06:35:12 GMT'}, {'version': 'v4', 'created': 'Thu, 8 Jul 2021 17:51:55 GMT'}, {'version': 'v5', 'created': 'Tue, 20 Jul 2021 00:12:17 GMT'}]",2021-07-21,"[['Biswas', 'Sumon', ''], ['Rajan', 'Hridesh', '']]","['fairness', 'machine learning', 'preprocessing', 'pipeline', 'models']"
10941,2103.11218,Amin Jalali,Amin Jalali,Evaluating Perceived Usefulness and Ease of Use of CMMN and DCR,,,10.1007/978-3-030-79186-5_10,,cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Case Management has been gradually evolving to support Knowledge-intensive
business process management, which resulted in developing different modeling
languages, e.g., Declare, Dynamic Condition Response (DCR), and Case Management
Model and Notation (CMMN). A language will die if users do not accept and use
it in practice - similar to extinct human languages. Thus, it is important to
evaluate how users perceive languages to determine if there is a need for
improvement. Although some studies have investigated how the process designers
perceived Declare and DCR, there is a lack of research on how they perceive
CMMN. Therefore, this study investigates how the process designers perceive the
usefulness and ease of use of CMMN and DCR based on the Technology Acceptance
Model. DCR is included to enable comparing the study result with previous ones.
The study is performed by educating master level students with these languages
over eight weeks by giving feedback on their assignments to reduce perceptions
biases. The students' perceptions are collected through questionnaires before
and after sending feedback on their final practice in the exam. Thus, the
result shows how the perception of participants can change by receiving
feedback - despite being well trained. The reliability of responses is tested
using Cronbach's alpha, and the result indicates that both languages have an
acceptable level for both perceived usefulness and ease of use.
","[{'version': 'v1', 'created': 'Sat, 20 Mar 2021 17:57:19 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Mar 2021 19:41:14 GMT'}, {'version': 'v3', 'created': 'Mon, 3 May 2021 10:22:36 GMT'}]",2022-02-10,"[['Jalali', 'Amin', '']]","['business process modeling', 'knowledge-intensive', 'case management', 'CMMN', 'DCR']"
10942,2011.02242,Ming Qian,"Ming Qian, Congyu Qiao, Jiamin Lin, Zhenyu Guo, Chenghua Li, Cong
  Leng, Jian Cheng","BGGAN: Bokeh-Glass Generative Adversarial Network for Rendering
  Realistic Bokeh",accepted by ECCV workshop 2020,"Proceedings of the European Conference on Computer Vision
  Workshops. 2020: 229-244",10.1007/978-3-030-67070-2_14,2020: 229-244,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A photo captured with bokeh effect often means objects in focus are sharp
while the out-of-focus areas are all blurred. DSLR can easily render this kind
of effect naturally. However, due to the limitation of sensors, smartphones
cannot capture images with depth-of-field effects directly. In this paper, we
propose a novel generator called Glass-Net, which generates bokeh images not
relying on complex hardware. Meanwhile, the GAN-based method and perceptual
loss are combined for rendering a realistic bokeh effect in the stage of
finetuning the model. Moreover, Instance Normalization(IN) is reimplemented in
our network, which ensures our tflite model with IN can be accelerated on
smartphone GPU. Experiments show that our method is able to render a
high-quality bokeh effect and process one $1024 \times 1536$ pixel image in 1.9
seconds on all smartphone chipsets. This approach ranked First in AIM 2020
Rendering Realistic Bokeh Challenge Track 1 \& Track 2.
","[{'version': 'v1', 'created': 'Wed, 4 Nov 2020 11:56:34 GMT'}]",2021-04-13,"[['Qian', 'Ming', ''], ['Qiao', 'Congyu', ''], ['Lin', 'Jiamin', ''], ['Guo', 'Zhenyu', ''], ['Li', 'Chenghua', ''], ['Leng', 'Cong', ''], ['Cheng', 'Jian', '']]","['Bokeh', 'Depth-of-field', 'Smartphone GPU', 'GAN']"
10943,1710.07476,Alexander Pilz,Alexander Pilz,Planar 3-SAT with a Clause/Variable Cycle,Implementing style of DMTCS journal,"Discrete Mathematics & Theoretical Computer Science, Vol. 21 no. 3
  , Discrete Algorithms (June 5, 2019) dmtcs:5521",10.23638/DMTCS-21-3-18,,cs.CC cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the Planar 3-SAT problem, we are given a 3-SAT formula together with its
incidence graph, which is planar, and are asked whether this formula is
satisfiable. Since Lichtenstein's proof that this problem is NP-complete, it
has been used as a starting point for a large number of reductions. In the
course of this research, different restrictions on the incidence graph of the
formula have been devised, for which the problem also remains hard.
  In this paper, we investigate the restriction in which we require that the
incidence graph can be augmented by the edges of a Hamiltonian cycle that first
passes through all variables and then through all clauses, in a way that the
resulting graph is still planar. We show that the problem of deciding
satisfiability of a 3-SAT formula remains NP-complete even if the incidence
graph is restricted in that way and the Hamiltonian cycle is given. This
complements previous results demanding cycles only through either the variables
or clauses.
  The problem remains hard for monotone formulas, as well as for instances with
exactly three distinct variables per clause. In the course of this
investigation, we show that monotone instances of Planar 3-SAT with exactly
three distinct variables per clause are always satisfiable, thus settling the
question by Darmann, D\""ocker, and Dorn on the complexity of this problem
variant in a surprising way.
","[{'version': 'v1', 'created': 'Fri, 20 Oct 2017 10:39:42 GMT'}, {'version': 'v2', 'created': 'Mon, 7 May 2018 12:16:52 GMT'}, {'version': 'v3', 'created': 'Wed, 25 Jul 2018 11:07:44 GMT'}, {'version': 'v4', 'created': 'Tue, 22 Jan 2019 19:02:40 GMT'}, {'version': 'v5', 'created': 'Sun, 28 Apr 2019 16:15:25 GMT'}, {'version': 'v6', 'created': 'Mon, 27 May 2019 19:15:18 GMT'}]",2019-11-20,"[['Pilz', 'Alexander', '']]","['3-SAT', 'planar graph', 'Hamiltonian cycle']"
10944,2007.10573,Fan Zhou,"Fan Zhou, Zhuqing Jiang, Changjian Shui, Boyu Wang and Brahim
  Chaib-draa","Domain Generalization via Optimal Transport with Metric Similarity
  Learning",,Neurocomputing 456 (2021) 469-480,10.1016/j.neucom.2020.09.091,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generalizing knowledge to unseen domains, where data and labels are
unavailable, is crucial for machine learning models. We tackle the domain
generalization problem to learn from multiple source domains and generalize to
a target domain with unknown statistics. The crucial idea is to extract the
underlying invariant features across all the domains. Previous domain
generalization approaches mainly focused on learning invariant features and
stacking the learned features from each source domain to generalize to a new
target domain while ignoring the label information, which will lead to
indistinguishable features with an ambiguous classification boundary. For this,
one possible solution is to constrain the label-similarity when extracting the
invariant features and to take advantage of the label similarities for
class-specific cohesion and separation of features across domains. Therefore we
adopt optimal transport with Wasserstein distance, which could constrain the
class label similarity, for adversarial training and also further deploy a
metric learning objective to leverage the label information for achieving
distinguishable classification boundary. Empirical results show that our
proposed method could outperform most of the baselines. Furthermore, ablation
studies also demonstrate the effectiveness of each component of our method.
","[{'version': 'v1', 'created': 'Tue, 21 Jul 2020 02:56:05 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Apr 2022 22:31:36 GMT'}]",2022-04-06,"[['Zhou', 'Fan', ''], ['Jiang', 'Zhuqing', ''], ['Shui', 'Changjian', ''], ['Wang', 'Boyu', ''], ['Chaib-draa', 'Brahim', '']]","['Domain Generalization', 'Adversarial Learning', 'Metric Learning']"
10945,2107.02052,"Mathias L\""owe","Mathias L\""owe, Jennifer Villareale, Evan Freed, Aleksanteri Sladek,
  Jichen Zhu, Sebastian Risi","Dealing with Adversarial Player Strategies in the Neural Network Game
  iNNk through Ensemble Learning","10 pages, 4 Figures. Accepted for publishing at the 16th
  International Conference on the Foundations of Digital Games (FDG) 2021",,10.1145/3472538.3472540,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Applying neural network (NN) methods in games can lead to various new and
exciting game dynamics not previously possible. However, they also lead to new
challenges such as the lack of large, clean datasets, varying player skill
levels, and changing gameplay strategies. In this paper, we focus on the
adversarial player strategy aspect in the game iNNk, in which players try to
communicate secret code words through drawings with the goal of not being
deciphered by a NN. Some strategies exploit weaknesses in the NN that
consistently trick it into making incorrect classifications, leading to
unbalanced gameplay. We present a method that combines transfer learning and
ensemble methods to obtain a data-efficient adaptation to these strategies.
This combination significantly outperforms the baseline NN across all
adversarial player strategies despite only being trained on a limited set of
adversarial examples. We expect the methods developed in this paper to be
useful for the rapidly growing field of NN-based games, which will require new
approaches to deal with unforeseen player creativity.
","[{'version': 'v1', 'created': 'Mon, 5 Jul 2021 14:25:44 GMT'}]",2021-07-06,"[['Löwe', 'Mathias', ''], ['Villareale', 'Jennifer', ''], ['Freed', 'Evan', ''], ['Sladek', 'Aleksanteri', ''], ['Zhu', 'Jichen', ''], ['Risi', 'Sebastian', '']]","['neural networks', 'ensemble methods', 'transfer learning', 'games', 'adversarial attacks']"
10946,1909.07158,Kristian Miok,"Kristian Miok, Dong Nguyen-Doan, Bla\v{z} \v{S}krlj, Daniela Zaharie
  and Marko Robnik-\v{S}ikonja",Prediction Uncertainty Estimation for Hate Speech Classification,"The final authenticated publication is available online at
  https://doi.org/10.1007/978-3-030-31372-2_24",Statistical Language and Speech Processing 2019 Proceedings,10.1007/978-3-030-31372-2_24,,cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As a result of social network popularity, in recent years, hate speech
phenomenon has significantly increased. Due to its harmful effect on minority
groups as well as on large communities, there is a pressing need for hate
speech detection and filtering. However, automatic approaches shall not
jeopardize free speech, so they shall accompany their decisions with
explanations and assessment of uncertainty. Thus, there is a need for
predictive machine learning models that not only detect hate speech but also
help users understand when texts cross the line and become unacceptable. The
reliability of predictions is usually not addressed in text classification. We
fill this gap by proposing the adaptation of deep neural networks that can
efficiently estimate prediction uncertainty. To reliably detect hate speech, we
use Monte Carlo dropout regularization, which mimics Bayesian inference within
neural networks. We evaluate our approach using different text embedding
methods. We visualize the reliability of results with a novel technique that
aids in understanding the classification reliability and errors.
","[{'version': 'v1', 'created': 'Mon, 16 Sep 2019 12:43:17 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Nov 2019 14:29:59 GMT'}, {'version': 'v3', 'created': 'Thu, 12 Dec 2019 11:59:54 GMT'}]",2019-12-13,"[['Miok', 'Kristian', ''], ['Nguyen-Doan', 'Dong', ''], ['Škrlj', 'Blaž', ''], ['Zaharie', 'Daniela', ''], ['Robnik-Šikonja', 'Marko', '']]","['prediction uncertainty estimation', 'hate speech classification', 'MonteCarlo dropout method', 'visualization of classification errors']"
10947,2301.00904,Habtamu Hailemichael,"Habtamu Hailemichael, Beshah Ayalew, Lindsey Kerbel, Andrej Ivanco,
  Keith Loiselle","Safe Reinforcement Learning for an Energy-Efficient Driver Assistance
  System",,"IFAC-PapersOnLine, Volume 55, Issue 37, 2022, Pages 615-620",10.1016/j.ifacol.2022.11.250,,cs.RO cs.LG cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reinforcement learning (RL)-based driver assistance systems seek to improve
fuel consumption via continual improvement of powertrain control actions
considering experiential data from the field. However, the need to explore
diverse experiences in order to learn optimal policies often limits the
application of RL techniques in safety-critical systems like vehicle control.
In this paper, an exponential control barrier function (ECBF) is derived and
utilized to filter unsafe actions proposed by an RL-based driver assistance
system. The RL agent freely explores and optimizes the performance objectives
while unsafe actions are projected to the closest actions in the safe domain.
The reward is structured so that driver's acceleration requests are met in a
manner that boosts fuel economy and doesn't compromise comfort. The optimal
gear and traction torque control actions that maximize the cumulative reward
are computed via the Maximum a Posteriori Policy Optimization (MPO) algorithm
configured for a hybrid action space. The proposed safe-RL scheme is trained
and evaluated in car following scenarios where it is shown that it effectively
avoids collision both during training and evaluation while delivering on the
expected fuel economy improvements for the driver assistance system.
","[{'version': 'v1', 'created': 'Tue, 3 Jan 2023 00:25:00 GMT'}]",2023-01-04,"[['Hailemichael', 'Habtamu', ''], ['Ayalew', 'Beshah', ''], ['Kerbel', 'Lindsey', ''], ['Ivanco', 'Andrej', ''], ['Loiselle', 'Keith', '']]","['RL driver-assist', 'Safe reinforcement learning', 'Safety filtering', 'Control barrierfunctions']"
10948,1709.00913,Bilen Emek Abali,Bilen Emek Abali,"An accurate finite element method for the numerical solution of
  isothermal and incompressible flow of viscous fluid",,,10.3390/fluids4010005,,cs.CE math.NA physics.comp-ph physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite its numerical challenges, finite element method is used to compute
viscous fluid flow. A consensus on the cause of numerical problems has been
reached; however, general algorithms---allowing a robust and accurate
simulation for any process---are still missing. Either a very high
computational cost is necessary for a direct numerical solution (DNS) or some
limiting procedure is used by adding artificial dissipation to the system.
These stabilization methods are useful; however, they are often applied
relative to the element size such that a local monotonous convergence is
challenging to acquire. We need a computational strategy for solving viscous
fluid flow using solely the balance equations. In this work, we present a
general procedure solving fluid mechanics problems without use of any
stabilization or splitting schemes. Hence, its generalization to multiphysics
applications is straightforward. We discuss emerging numerical problems and
present the methodology rigorously. Implementation is achieved by using
open-source packages and the accuracy as well as the robustness is demonstrated
by comparing results to the closed-form solutions and also by solving
well-known benchmarking problems.
","[{'version': 'v1', 'created': 'Mon, 4 Sep 2017 12:21:10 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Mar 2018 20:15:42 GMT'}, {'version': 'v3', 'created': 'Fri, 26 Oct 2018 19:40:19 GMT'}, {'version': 'v4', 'created': 'Sat, 8 Dec 2018 13:37:46 GMT'}]",2019-02-05,"[['Abali', 'Bilen Emek', '']]","['Finite element method', 'Fluid dynamics', 'Computation', 'Viscous fluid flow']"
10949,2212.14050,Ali Raza,"Ali Raza, Kim Phuc Tran, Ludovic Koehl, Shujun Li","Proof of Swarm Based Ensemble Learning for Federated Learning
  Applications","This is the full edition of a 4-page poster paper published at the
  Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing (SAC '23)
  which can be accessed via the following DOI link:
  https://doi.org/10.1145/3555776.3578601",,10.1145/3555776.3578601,,cs.LG cs.AI eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ensemble learning combines results from multiple machine learning models in
order to provide a better and optimised predictive model with reduced bias,
variance and improved predictions. However, in federated learning it is not
feasible to apply centralised ensemble learning directly due to privacy
concerns. Hence, a mechanism is required to combine results of local models to
produce a global model. Most distributed consensus algorithms, such as
Byzantine fault tolerance (BFT), do not normally perform well in such
applications. This is because, in such methods predictions of some of the peers
are disregarded, so a majority of peers can win without even considering other
peers' decisions. Additionally, the confidence score of the result of each peer
is not normally taken into account, although it is an important feature to
consider for ensemble learning. Moreover, the problem of a tie event is often
left un-addressed by methods such as BFT. To fill these research gaps, we
propose PoSw (Proof of Swarm), a novel distributed consensus algorithm for
ensemble learning in a federated setting, which was inspired by particle swarm
based algorithms for solving optimisation problems. The proposed algorithm is
theoretically proved to always converge in a relatively small number of steps
and has mechanisms to resolve tie events while trying to achieve sub-optimum
solutions. We experimentally validated the performance of the proposed
algorithm using ECG classification as an example application in healthcare,
showing that the ensemble learning model outperformed all local models and even
the FL-based global model. To the best of our knowledge, the proposed algorithm
is the first attempt to make consensus over the output results of distributed
models trained using federated learning.
","[{'version': 'v1', 'created': 'Wed, 28 Dec 2022 13:53:34 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Jan 2023 13:15:35 GMT'}]",2023-01-03,"[['Raza', 'Ali', ''], ['Tran', 'Kim Phuc', ''], ['Koehl', 'Ludovic', ''], ['Li', 'Shujun', '']]","['Privacy', 'federated learning', 'ensemble', 'consensus protocol', 'evolutionary computing', 'swarm algorithms', 'healthcare']"
10950,2205.02950,Gunnar Kudrjavets,"Gunnar Kudrjavets (University of Groningen), Jeff Thomas (Meta
  Platforms, Inc.), and Nachiappan Nagappan (Meta Platforms, Inc.)",The Evolving Landscape of Software Performance Engineering,"2 pages. To be published in The International Conference on
  Evaluation and Assessment in Software Engineering 2022 (EASE 2022), June
  13-15, 2022, Gothenburg, Sweden",,10.1145/3530019.3534977,,cs.SE cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Satisfactory software performance is essential for the adoption and the
success of a product. In organizations that follow traditional software
development models (e.g., waterfall), Software Performance Engineering (SPE)
involves time-consuming experimental modeling and performance testing outside
the actual production environment. Such existing SPE methods, however, are not
optimized for environments utilizing Continuous Integration (CI) and Continuous
Delivery (CD) that result in high frequency and high volume of code changes. We
present a summary of lessons learned and propose improvements to the SPE
process in the context of CI/CD. Our findings are based on SPE work on products
A and B conducted over 5 years at an online services company X. We find that
(a) SPE has mainly become a post hoc activity based on data from the production
environment, (b) successful application of SPE techniques require frequent
re-evaluation of priorities, and (c) engineers working on SPE require a broader
skill set than one traditionally possessed by engineers working on performance.
","[{'version': 'v1', 'created': 'Thu, 5 May 2022 22:17:58 GMT'}]",2022-05-09,"[['Kudrjavets', 'Gunnar', '', 'University of Groningen'], ['Thomas', 'Jeff', '', 'Meta\n  Platforms, Inc.'], ['Nagappan', 'Nachiappan', '', 'Meta Platforms, Inc.']]","['Performance analysis', 'software performance engineering', 'SPE']"
10951,1712.03360,Abhinav Sinha,Abhinav Sinha and Rajiv Kumar Mishra,"Control of a nonlinear continuous stirred tank reactor via event
  triggered sliding modes","Author (final) version of accepted manuscript accepted in Chemical
  Engineering Science. Current status: in press","Chemical Engineering Science, April 2018",10.1016/j.ces.2018.04.057,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Continuous Stirred Tank Reactors (CSTR) are the most important and central
equipment in many chemical and biochemical industry that exhibit second order
complex nonlinear dynamics. The nonlinear dynamics of CSTR poses many design
and control challenges. The proposed controller guarantees a stable closed loop
behavior over multiple operating points even in presence of disturbances and
parametric uncertainties. An event driven sliding mode control is presented in
this work to regulate the temperature and concentration very close to the
equilibrium points of CSTR. The control is executed only when a predefined
condition gets violated and hence the controller is relaxed when the system is
operating under tolerable limits in terms of closed loop performance. A novel
dynamic event triggering rule is presented to maintain desired performance with
minimum computational cost. The inter event execution time is shown to be lower
bounded by a finite positive quantity to exclude Zeno behavior. Sliding mode
control (SMC) combined with event triggering scheme retains the inherent
robustness of traditional SMC and aids in reducing computational load on the
controller involved. Simulation results validate the efficiency of the proposed
controller.
","[{'version': 'v1', 'created': 'Sat, 9 Dec 2017 09:07:17 GMT'}, {'version': 'v2', 'created': 'Tue, 1 May 2018 18:29:39 GMT'}]",2018-05-03,"[['Sinha', 'Abhinav', ''], ['Mishra', 'Rajiv Kumar', '']]","['CSTR', 'event-based sliding mode control', 'Riemann sampling', 'Lebesgue sampling', 'event']"
10952,1912.12790,R Jaberi,Raed Jaberi,Computing $2$-twinless blocks,,Discrete Mathematics Letters (DML) 5 (2021) 29-33,10.47443/dml.2020.0037,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $G=(V,E))$ be a directed graph. A $2$-twinless block in $G$ is a maximal
vertex set $B\subseteq V$ of size at least $2$ such that for each pair of
distinct vertices $x,y \in B$, and for each vertex $w\in V\setminus\left\lbrace
x,y \right\rbrace $, the vertices $x,y$ are in the same twinless strongly
connected component of $G\setminus\left \lbrace w \right\rbrace $.
  In this paper we present algorithms for computing the $2$-twinless blocks of
a directed graph.
","[{'version': 'v1', 'created': 'Mon, 30 Dec 2019 02:56:47 GMT'}, {'version': 'v2', 'created': 'Sun, 31 Jan 2021 22:35:17 GMT'}]",2022-05-10,"[['Jaberi', 'Raed', '']]","['Directed graphs', 'Connectivity', 'Graph algorithms', '2-blocks', 'Twinless strongly connected graphs']"
10953,2002.09854,Huanneng Qiu,"Huanneng Qiu, Matthew Garratt, David Howard and Sreenatha Anavatti",Towards Crossing the Reality Gap with Evolved Plastic Neurocontrollers,GECCO2020,,10.1145/3377930.3389843,,cs.RO cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A critical issue in evolutionary robotics is the transfer of controllers
learned in simulation to reality. This is especially the case for small
Unmanned Aerial Vehicles (UAVs), as the platforms are highly dynamic and
susceptible to breakage. Previous approaches often require simulation models
with a high level of accuracy, otherwise significant errors may arise when the
well-designed controller is being deployed onto the targeted platform. Here we
try to overcome the transfer problem from a different perspective, by designing
a spiking neurocontroller which uses synaptic plasticity to cross the reality
gap via online adaptation. Through a set of experiments we show that the
evolved plastic spiking controller can maintain its functionality by
self-adapting to model changes that take place after evolutionary training, and
consequently exhibit better performance than its non-plastic counterpart.
","[{'version': 'v1', 'created': 'Sun, 23 Feb 2020 07:44:42 GMT'}, {'version': 'v2', 'created': 'Fri, 8 May 2020 03:57:21 GMT'}]",2020-05-11,"[['Qiu', 'Huanneng', ''], ['Garratt', 'Matthew', ''], ['Howard', 'David', ''], ['Anavatti', 'Sreenatha', '']]","['evolutionary robotics', 'spiking neural networks', 'Hebbian plasticity', 'neuroevolution', 'UAV control']"
10954,2201.08987,Mohammad Ridwan Kabir,"Ishrak Jahan Ratul, Ummay Habiba Wani, Mirza Muntasir Nishat, Abdullah
  Al-Monsur, Abrar Mohammad Ar-Rafi, Fahim Faisal, and Mohammad Ridwan Kabir","Survival Prediction of Children Undergoing Hematopoietic Stem Cell
  Transplantation Using Different Machine Learning Classifiers by Performing
  Chi-squared Test and Hyper-parameter Optimization: A Retrospective Analysis","25 pages, 14 figures, 38 tables",,10.1155/2022/9391136,9391136,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Bone Marrow Transplant, a gradational rescue for a wide range of disorders
emanating from the bone marrow, is an efficacious surgical treatment. Several
risk factors, such as post-transplant illnesses, new malignancies, and even
organ damage, can impair long-term survival. Therefore, technologies like
Machine Learning are deployed for investigating the survival prediction of BMT
receivers along with the influences that limit their resilience. In this study,
an efficient survival classification model is presented in a comprehensive
manner, incorporating the Chi-squared feature selection method to address the
dimensionality problem and Hyper Parameter Optimization (HPO) to increase
accuracy. A synthetic dataset is generated by imputing the missing values,
transforming the data using dummy variable encoding, and compressing the
dataset from 59 features to the 11 most correlated features using Chi-squared
feature selection. The dataset was split into train and test sets at a ratio of
80:20, and the hyperparameters were optimized using Grid Search
Cross-Validation. Several supervised ML methods were trained in this regard,
like Decision Tree, Random Forest, Logistic Regression, K-Nearest Neighbors,
Gradient Boosting Classifier, Ada Boost, and XG Boost. The simulations have
been performed for both the default and optimized hyperparameters by using the
original and reduced synthetic dataset. After ranking the features using the
Chi-squared test, it was observed that the top 11 features with HPO, resulted
in the same accuracy of prediction (94.73%) as the entire dataset with default
parameters. Moreover, this approach requires less time and resources for
predicting the survivability of children undergoing BMT. Hence, the proposed
approach may aid in the development of a computer-aided diagnostic system with
satisfactory accuracy and minimal computation time by utilizing medical data
records.
","[{'version': 'v1', 'created': 'Sat, 22 Jan 2022 08:01:22 GMT'}]",2022-10-04,"[['Ratul', 'Ishrak Jahan', ''], ['Wani', 'Ummay Habiba', ''], ['Nishat', 'Mirza Muntasir', ''], ['Al-Monsur', 'Abdullah', ''], ['Ar-Rafi', 'Abrar Mohammad', ''], ['Faisal', 'Fahim', ''], ['Kabir', 'Mohammad Ridwan', '']]","['Bone Marrow Transplant', 'Chi-squared Test', 'Hematopoietic Stem Cell', 'Hyper-parameter Optimization']"
10955,2109.06045,Nadica Miljkovi\'c,"Nadica Miljkovi\'c, Ana Trisovic and Limor Peer",Towards FAIR Principles for Open Hardware,"12 pages, 3 figures, 2 tables",,10.5281/zenodo.5524414,,cs.DL cs.SE,http://creativecommons.org/licenses/by/4.0/,"  The lack of scientific openness is identified as one of the key challenges of
computational reproducibility. In addition to Open Data, Free and Open-source
Software (FOSS) and Open Hardware (OH) can address this challenge by
introducing open policies, standards, and recommendations. However, while both
FOSS and OH are free to use, study, modify, and redistribute, there are
significant differences in sharing and reusing these artifacts. FOSS is
increasingly supported with software repositories, but support for OH is
lacking, potentially due to the complexity of its digital format and licensing.
This paper proposes leveraging FAIR principles to make OH findable, accessible,
interoperable, and reusable. We define what FAIR means for OH, how it differs
from FOSS, and present examples of unique demands. Also, we evaluate
dissemination platforms currently used for OH and provide recommendations.
","[{'version': 'v1', 'created': 'Mon, 13 Sep 2021 15:11:59 GMT'}]",2021-09-28,"[['Miljković', 'Nadica', ''], ['Trisovic', 'Ana', ''], ['Peer', 'Limor', '']]","['computational reproducibility', 'FAIR', 'free software', 'FOSS', 'open data', 'open hardware', 'openscience', 'open-source']"
10956,2208.01876,Md Shahriar Tasjid,"Md Shahriar Tasjid, Ahmed Al Marouf","Leveraging Smartphone Sensors for Detecting Abnormal Gait for Smart
  Wearable Mobile Technologies",,"International Journal of Interactive Mobile Technologies (iJIM);
  Volume 15 Number 24; Page 167-175; 2021",10.3991/ijim.v15i24.25891.,,cs.HC cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Walking is one of the most common modes of terrestrial locomotion for humans.
Walking is essential for humans to perform most kinds of daily activities. When
a person walks, there is a pattern in it, and it is known as gait. Gait
analysis is used in sports and healthcare. We can analyze this gait in
different ways, like using video captured by the surveillance cameras or depth
image cameras in the lab environment. It also can be recognized by wearable
sensors. e.g., accelerometer, force sensors, gyroscope, flexible goniometer,
magneto resistive sensors, electromagnetic tracking system, force sensors, and
electromyography (EMG). Analysis through these sensors required a lab
condition, or users must wear these sensors. For detecting abnormality in gait
action of a human, we need to incorporate the sensors separately. We can know
about one's health condition by abnormal human gait after detecting it.
Understanding a regular gait vs. abnormal gait may give insights to the health
condition of the subject using the smart wearable technologies. Therefore, in
this paper, we proposed a way to analyze abnormal human gait through smartphone
sensors. Though smart devices like smartphones and smartwatches are used by
most of the person nowadays. So, we can track down their gait using sensors of
these intelligent wearable devices.
","[{'version': 'v1', 'created': 'Wed, 3 Aug 2022 07:00:16 GMT'}]",2022-08-04,"[['Tasjid', 'Md Shahriar', ''], ['Marouf', 'Ahmed Al', '']]","['human gait detection', 'abnormal gait', 'machine learning', 'deep learning', 'sensors', 'accelerometer', 'gyroscope']"
10957,2202.06620,Lin Li,"Kaixi Hu, Lin Li, Qing Xie, Jianquan Liu, Xiaohui Tao","What is Next when Sequential Prediction Meets Implicitly Hard
  Interaction?","10 pages; 4 figures; Proceedings of the 30th ACM International
  Conference on Information and Knowledge Management (CIKM '21), November 1--5,
  2021, Virtual Event, QLD, Australia",,10.1145/3459637.3482492,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Hard interaction learning between source sequences and their next targets is
challenging, which exists in a myriad of sequential prediction tasks. During
the training process, most existing methods focus on explicitly hard
interactions caused by wrong responses. However, a model might conduct correct
responses by capturing a subset of learnable patterns, which results in
implicitly hard interactions with some unlearned patterns. As such, its
generalization performance is weakened. The problem gets more serious in
sequential prediction due to the interference of substantial similar candidate
targets.
  To this end, we propose a Hardness Aware Interaction Learning framework
(HAIL) that mainly consists of two base sequential learning networks and mutual
exclusivity distillation (MED). The base networks are initialized differently
to learn distinctive view patterns, thus gaining different training
experiences. The experiences in the form of the unlikelihood of correct
responses are drawn from each other by MED, which provides mutual exclusivity
knowledge to figure out implicitly hard interactions. Moreover, we deduce that
the unlikelihood essentially introduces additional gradients to push the
pattern learning of correct responses. Our framework can be easily extended to
more peer base networks. Evaluation is conducted on four datasets covering
cyber and physical spaces. The experimental results demonstrate that our
framework outperforms several state-of-the-art methods in terms of top-k based
metrics.
","[{'version': 'v1', 'created': 'Mon, 14 Feb 2022 11:15:28 GMT'}]",2022-02-15,"[['Hu', 'Kaixi', ''], ['Li', 'Lin', ''], ['Xie', 'Qing', ''], ['Liu', 'Jianquan', ''], ['Tao', 'Xiaohui', '']]","['sequential prediction', 'hard interaction', 'unlikelihood', 'knowledgedistillation']"
10958,2004.01449,Wenceslao Arroyo-Machado,"Daniel Torres-Salinas, Wenceslao Arroyo-Machado, Nicol\'as
  Robinson-Garc\'ia","An alternative analysis on the scientific output of Spanish Sociology
  What can altmetrics tell us?","in Spanish, Cap\'itulo aceptado para su publicaci\'on en una
  monograf\'ia de la editorial CIS-Centro de Investigaci\'on Sociol\'ogicas",,10.5281/zenodo.3739011,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  In recent years, new indicators known as altmetrics have been introduced to
measure the impact of scientific activity. These indicators are obtained
through the mentions realised from different social media, existing several
aggregators of these data that collect several of them in the same database,
being Altmetric.com the most popular. However, in spite of the popularization
of these metrics, several limitations in their use have been manifested. For
this reason, rhe objective of this work is twofold: (1) to show the
possibilities of altimetric techniques applied to the Spanish social sciences
in general and sociology in particular; (2) to critically analyse the results
to observe the limitations of these indicators; (3) to check whether they can
really add useful information that can be used to describe a scientific field
and (4) to see the reasons why altmetrics cannot be applied in these fields.
","[{'version': 'v1', 'created': 'Fri, 3 Apr 2020 09:43:48 GMT'}]",2020-04-06,"[['Torres-Salinas', 'Daniel', ''], ['Arroyo-Machado', 'Wenceslao', ''], ['Robinson-García', 'Nicolás', '']]","['\u200b Sociology', 'Social Sciences', 'altmetrics', 'Altmetric']"
10959,2002.12126,Tarik A. Rashid,"Chnoor M. Rahman, Tarik A. Rashid, Abeer Alsadoon, Nebojsa Bacanin,
  Polla Fattah, Seyedali Mirjalili",A survey on dragonfly algorithm and its applications in engineering,26 pages. arXiv admin note: text overlap with arXiv:2001.02292,"Evolutionary Intelligence, 2021",10.1007/s12065-021-00659-x,,cs.NE,http://creativecommons.org/licenses/by-sa/4.0/,"  The dragonfly algorithm was developed in 2016. It is one of the algorithms
used by researchers to optimize an extensive series of uses and applications in
various areas. At times, it offers superior performance compared to the most
well-known optimization techniques. However, this algorithm faces several
difficulties when it is utilized to enhance complex optimization problems. This
work addressed the robustness of the method to solve real-world optimization
issues, and its deficiency to improve complex optimization problems. This
review paper shows a comprehensive investigation of the dragonfly algorithm in
the engineering area. First, an overview of the algorithm is discussed.
Besides, we also examined the modifications of the algorithm. The merged forms
of this algorithm with different techniques and the modifications that have
been done to make the algorithm perform better are addressed. Additionally, a
survey on applications in the engineering area that used the dragonfly
algorithm is offered. The utilized engineering applications are the
applications in the field of mechanical engineering problems, electrical
engineering problems, optimal parameters, economic load dispatch, and loss
reduction. The algorithm is tested and evaluated against particle swarm
optimization algorithm and firefly algorithm. To evaluate the ability of the
dragonfly algorithm and other participated algorithms a set of traditional
benchmarks (TF1-TF23) were utilized. Moreover, to examine the ability of the
algorithm to optimize large-scale optimization problems CEC-C2019 benchmarks
were utilized. A comparison is made between the algorithm and other
metaheuristic techniques to show its ability to enhance various problems.
","[{'version': 'v1', 'created': 'Wed, 19 Feb 2020 20:23:26 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Sep 2020 11:08:30 GMT'}, {'version': 'v3', 'created': 'Sat, 28 Aug 2021 07:54:25 GMT'}]",2021-08-31,"[['Rahman', 'Chnoor M.', ''], ['Rashid', 'Tarik A.', ''], ['Alsadoon', 'Abeer', ''], ['Bacanin', 'Nebojsa', ''], ['Fattah', 'Polla', ''], ['Mirjalili', 'Seyedali', '']]","['Dragonfly Algorithm', 'Swarm Intelligence', 'Metaheuristic Algorithm', 'Optimization Algorithm', 'Single and Multi-objective optimization', 'DA']"
10960,2104.05744,Tarik A. Rashid,"Sagar Chhetri, Abeer Alsadoon, Thair Al Dala in, P. W. C. Prasad,
  Tarik A. Rashid, Angelika Maag","Deep Learning for Vision-Based Fall Detection System: Enhanced Optical
  Dynamic Flow",16 pages,"Computational Intelligence, 2020",10.1111/coin.12428,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Accurate fall detection for the assistance of older people is crucial to
reduce incidents of deaths or injuries due to falls. Meanwhile, a vision-based
fall detection system has shown some significant results to detect falls.
Still, numerous challenges need to be resolved. The impact of deep learning has
changed the landscape of the vision-based system, such as action recognition.
The deep learning technique has not been successfully implemented in
vision-based fall detection systems due to the requirement of a large amount of
computation power and the requirement of a large amount of sample training
data. This research aims to propose a vision-based fall detection system that
improves the accuracy of fall detection in some complex environments such as
the change of light condition in the room. Also, this research aims to increase
the performance of the pre-processing of video images. The proposed system
consists of the Enhanced Dynamic Optical Flow technique that encodes the
temporal data of optical flow videos by the method of rank pooling, which
thereby improves the processing time of fall detection and improves the
classification accuracy in dynamic lighting conditions. The experimental
results showed that the classification accuracy of the fall detection improved
by around 3% and the processing time by 40 to 50ms. The proposed system
concentrates on decreasing the processing time of fall detection and improving
classification accuracy. Meanwhile, it provides a mechanism for summarizing a
video into a single image by using a dynamic optical flow technique, which
helps to increase the performance of image pre-processing steps.
","[{'version': 'v1', 'created': 'Thu, 18 Mar 2021 08:14:25 GMT'}]",2021-04-14,"[['Chhetri', 'Sagar', ''], ['Alsadoon', 'Abeer', ''], ['in', 'Thair Al Dala', ''], ['Prasad', 'P. W. C.', ''], ['Rashid', 'Tarik A.', ''], ['Maag', 'Angelika', '']]","['Fall detection', 'Deep Learning', 'Convolution Neural Network', 'Optical Flow', 'Optical Dynamic Flow Images']"
10961,2011.05602,Zheng Zhu,"Jintao Ke, Siyuan Feng, Zheng Zhu, Hai Yang, Jieping Ye","Joint predictions of multi-modal ride-hailing demands: a deep multi-task
  multigraph learning-based approach",,,10.1016/j.trc.2021.103063,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Ride-hailing platforms generally provide various service options to
customers, such as solo ride services, shared ride services, etc. It is
generally expected that demands for different service modes are correlated, and
the prediction of demand for one service mode can benefit from historical
observations of demands for other service modes. Moreover, an accurate joint
prediction of demands for multiple service modes can help the platforms better
allocate and dispatch vehicle resources. Although there is a large stream of
literature on ride-hailing demand predictions for one specific service mode,
little efforts have been paid towards joint predictions of ride-hailing demands
for multiple service modes. To address this issue, we propose a deep multi-task
multi-graph learning approach, which combines two components: (1) multiple
multi-graph convolutional (MGC) networks for predicting demands for different
service modes, and (2) multi-task learning modules that enable knowledge
sharing across multiple MGC networks. More specifically, two multi-task
learning structures are established. The first one is the regularized
cross-task learning, which builds cross-task connections among the inputs and
outputs of multiple MGC networks. The second one is the multi-linear
relationship learning, which imposes a prior tensor normal distribution on the
weights of various MGC networks. Although there are no concrete bridges between
different MGC networks, the weights of these networks are constrained by each
other and subject to a common prior distribution. Evaluated with the
for-hire-vehicle datasets in Manhattan, we show that our propose approach
outperforms the benchmark algorithms in prediction accuracy for different
ride-hailing modes.
","[{'version': 'v1', 'created': 'Wed, 11 Nov 2020 07:10:50 GMT'}]",2022-04-27,"[['Ke', 'Jintao', ''], ['Feng', 'Siyuan', ''], ['Zhu', 'Zheng', ''], ['Yang', 'Hai', ''], ['Ye', 'Jieping', '']]","['ride-hailing', 'demand prediction', 'deep multi-task learning', 'multi-graph convolutionalnetwork']"
10962,2106.15397,Nikolay Nikitin,"Nikolay O. Nikitin, Pavel Vychuzhanin, Mikhail Sarafanov, Iana S.
  Polonskaia, Ilia Revin, Irina V. Barabanova, Gleb Maximov, Anna V.
  Kalyuzhnaya, Alexander Boukhanovsky","Automated Evolutionary Approach for the Design of Composite Machine
  Learning Pipelines",,,10.1016/j.future.2021.08.022,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The effectiveness of the machine learning methods for real-world tasks
depends on the proper structure of the modeling pipeline. The proposed approach
is aimed to automate the design of composite machine learning pipelines, which
is equivalent to computation workflows that consist of models and data
operations. The approach combines key ideas of both automated machine learning
and workflow management systems. It designs the pipelines with a customizable
graph-based structure, analyzes the obtained results, and reproduces them. The
evolutionary approach is used for the flexible identification of pipeline
structure. The additional algorithms for sensitivity analysis, atomization, and
hyperparameter tuning are implemented to improve the effectiveness of the
approach. Also, the software implementation on this approach is presented as an
open-source framework. The set of experiments is conducted for the different
datasets and tasks (classification, regression, time series forecasting). The
obtained results confirm the correctness and effectiveness of the proposed
approach in the comparison with the state-of-the-art competitors and baseline
solutions.
","[{'version': 'v1', 'created': 'Sat, 26 Jun 2021 23:19:06 GMT'}]",2021-09-09,"[['Nikitin', 'Nikolay O.', ''], ['Vychuzhanin', 'Pavel', ''], ['Sarafanov', 'Mikhail', ''], ['Polonskaia', 'Iana S.', ''], ['Revin', 'Ilia', ''], ['Barabanova', 'Irina V.', ''], ['Maximov', 'Gleb', ''], ['Kalyuzhnaya', 'Anna V.', ''], ['Boukhanovsky', 'Alexander', '']]","['AutoML', 'workflow', 'composite pipeline', 'machine learning', 'evolutionary algorithms', 'WMS']"
10963,2209.03341,Arminda Estrada,"Ivan Kawaminami, Arminda Estrada, Youssef Elsakkary, Hayden Jananthan,
  Ayd{\i}n Bulu\c{c}, Tim Davis, Daniel Grant, Michael Jones, Chad Meiners,
  Andrew Morris, Sandeep Pisharody, Jeremy Kepner","Large Scale Enrichment and Statistical Cyber Characterization of Network
  Traffic (Enriquecimiento a gran escala y caracterizaci\'on cibern\'etica
  estad\'istica del tr\'afico de red)","17 pages, 16 figures, HPEC, Spanish version",,10.1109/HPEC55821.2022.9926397,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern network sensors continuously produce enormous quantities of raw data
that are beyond the capacity of human analysts. Cross-correlation of network
sensors increases this challenge by enriching every network event with
additional metadata. These large volumes of enriched network data present
opportunities to statistically characterize network traffic and quickly answer
a key question: ""What are the primary cyber characteristics of my network
data?"" The Python GraphBLAS and PyD4M analysis frameworks enable anonymized
statistical analysis to be performed quickly and efficiently on very large
network data sets. This approach is tested using billions of anonymized network
data samples from the largest Internet observatory (CAIDA Telescope) and tens
of millions of anonymized records from the largest commercially available
background enrichment capability (GreyNoise). The analysis confirms that most
of the enriched variables follow expected heavy-tail distributions and that a
large fraction of the network traffic is due to a small number of cyber
activities. This information can simplify the cyber analysts' task by enabling
prioritization of cyber activities based on statistical prevalence.
  -- Los sensores de red modernos producen enormes cantidades de datos sin
procesar que est\'an m\'as all\'a de la capacidad del an\'alisis humano. Una
correlaci\'on cruzada de sensores de red se convierte en un desaf\'io al
enriquecer cada evento de red con metadatos adicionales. Estos grandes
vol\'umenes de datos de red enriquecidos presentan una oportunidad para
caracterizar estad\'isticamente el tr\'afico de red y responder a la pregunta:
""?Cu\'ales son las principales caracter\'isticas cibern\'eticas de mis datos de
red?"" Los esquemas de an\'alisis de Python GraphBLAS y D4M permiten realizar
an\'alisis estad\'isticos an\'onimos, r\'apidos y eficientes en conjuntos
grandes de datos de red. Este enfoque se prueba utilizando miles de millones de
muestras de datos de red an\'onimos del observatorio de Internet m\'as grande
(Telescopio CAIDA) y decenas de millones de registros an\'onimos del fondo
comercial con la mayor capacidad de enriquecimiento (GreyNoise). El an\'alisis
confirma que la mayor\'ia de las variables enriquecidas siguen las
distribuciones de cola pesada y que una gran fracci\'on del tr\'afico de red se
debe a una peque\`na cantidad de actividades cibern\'eticas. Esta informaci\'on
puede simplificar la tarea de los analistas cibern\'eticos al permitir la
priorizaci\'on de las actividades cibern\'eticas en funci\'on de la prevalencia
estad\'istica.
","[{'version': 'v1', 'created': 'Wed, 7 Sep 2022 17:57:07 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Dec 2022 19:28:02 GMT'}]",2022-12-05,"[['Kawaminami', 'Ivan', ''], ['Estrada', 'Arminda', ''], ['Elsakkary', 'Youssef', ''], ['Jananthan', 'Hayden', ''], ['Buluç', 'Aydın', ''], ['Davis', 'Tim', ''], ['Grant', 'Daniel', ''], ['Jones', 'Michael', ''], ['Meiners', 'Chad', ''], ['Morris', 'Andrew', ''], ['Pisharody', 'Sandeep', ''], ['Kepner', 'Jeremy', '']]","['Cybersecurity', 'High Performing Computing', 'Big Data', 'Networks Scanning', 'Dimensional Analysis', 'Internet Modeling', 'Packet Capture', 'Streaming Graphs']"
10964,2008.08416,JooYeol Yun,"JooYeol Yun, JungWoo Oh, and IlDong Yun","Gradually Applying Weakly Supervised and Active Learning for Mass
  Detection in Breast Ultrasound Images",,"Appl. Sci. 2020, 10(13), 4519",10.3390/app10134519,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a method for effectively utilizing weakly annotated image data in
an object detection tasks of breast ultrasound images. Given the problem
setting where a small, strongly annotated dataset and a large, weakly annotated
dataset with no bounding box information are available, training an object
detection model becomes a non-trivial problem. We suggest a controlled weight
for handling the effect of weakly annotated images in a two stage object
detection model. We~also present a subsequent active learning scheme for safely
assigning weakly annotated images a strong annotation using the trained model.
Experimental results showed a 24\% point increase in correct localization
(CorLoc) measure, which is the ratio of correctly localized and classified
images, by assigning the properly controlled weight. Performing active learning
after a model is trained showed an additional increase in CorLoc. We tested the
proposed method on the Stanford Dog datasets to assure that it can be applied
to general cases, where strong annotations are insufficient to obtain
resembling results. The presented method showed that higher performance is
achievable with lesser annotation effort.
","[{'version': 'v1', 'created': 'Wed, 19 Aug 2020 13:09:00 GMT'}]",2020-08-20,"[['Yun', 'JooYeol', ''], ['Oh', 'JungWoo', ''], ['Yun', 'IlDong', '']]","['active learning', 'breast ultrasound', 'convolutional neural networks', 'mass classification', 'object detection', 'weakly supervised learning']"
10965,2005.06834,Sarah Spiekermann,"Alessandro Acquisti, Sarah Spiekermann","Do Interruptions Pay Off? Effects of Interruptive Ads on Consumers
  Willingness to Pay","Advertising, Attention, Privacy, Willingness to Pay, Electronic
  commerce. Electronic copy",,10.1016/j.intmar.2011.04.003,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the results of a study designed to measure the impact of
interruptive advertising on consumers willingness to pay for products bearing
the advertiser's brand. Subjects participating in a controlled experiment were
exposed to ads that diverted their attention from a computer game they were
testing. We found that ads significantly lowered subjects willingness to pay
for a good associated with the advertised brand. We did not find conclusive
evidence that providing some level of user control over the appearance of ads
mitigated the negative impact of ad interruption. Our results contribute to the
research on the economic impact of advertising, and introduce a method of
measuring actual (as opposed to self-reported) willingness to pay in
experimental marketing research.
","[{'version': 'v1', 'created': 'Thu, 14 May 2020 09:26:57 GMT'}]",2020-05-15,"[['Acquisti', 'Alessandro', ''], ['Spiekermann', 'Sarah', '']]","['Advertising', 'Attention', 'Privacy', 'Willingness to Pay', 'Electronic commerce']"
10966,2209.02577,Yixue Zhao,"Yixue Zhao, Saghar Talebipour, Kesina Baral, Hyojae Park, Leon Yee,
  Safwat Ali Khan, Yuriy Brun, Nenad Medvidovic, Kevin Moran","Avgust: Automating Usage-Based Test Generation from Videos of App
  Executions",,ESEC/FSE 2022,10.1145/3540250.3549134,,cs.SE cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Writing and maintaining UI tests for mobile apps is a time-consuming and
tedious task. While decades of research have produced automated approaches for
UI test generation, these approaches typically focus on testing for crashes or
maximizing code coverage. By contrast, recent research has shown that
developers prefer usage-based tests, which center around specific uses of app
features, to help support activities such as regression testing. Very few
existing techniques support the generation of such tests, as doing so requires
automating the difficult task of understanding the semantics of UI screens and
user inputs. In this paper, we introduce Avgust, which automates key steps of
generating usage-based tests. Avgust uses neural models for image understanding
to process video recordings of app uses to synthesize an app-agnostic
state-machine encoding of those uses. Then, Avgust uses this encoding to
synthesize test cases for a new target app. We evaluate Avgust on 374 videos of
common uses of 18 popular apps and show that 69% of the tests Avgust generates
successfully execute the desired usage, and that Avgust's classifiers
outperform the state of the art.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2022 15:36:03 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Oct 2022 23:03:31 GMT'}, {'version': 'v3', 'created': 'Mon, 31 Oct 2022 15:56:55 GMT'}, {'version': 'v4', 'created': 'Tue, 1 Nov 2022 18:52:39 GMT'}]",2022-11-03,"[['Zhao', 'Yixue', ''], ['Talebipour', 'Saghar', ''], ['Baral', 'Kesina', ''], ['Park', 'Hyojae', ''], ['Yee', 'Leon', ''], ['Khan', 'Safwat Ali', ''], ['Brun', 'Yuriy', ''], ['Medvidovic', 'Nenad', ''], ['Moran', 'Kevin', '']]","['Test Generation', 'UI Understanding', 'AI/ML', 'Mobile Application']"
10967,1606.02020,EPTCS,"Nafi Diallo (NJIT, USA), Wided Ghardallou (FST, Tunisia), Jules
  Desharnais (Laval University, Canada), Ali Mili (NJIT, USA)",Program Derivation by Correctness Enhacements,"In Proceedings Refine'15, arXiv:1606.01344","EPTCS 209, 2016, pp. 57-70",10.4204/EPTCS.209.5,,cs.LO cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Relative correctness is the property of a program to be more-correct than
another program with respect to a given specification. Among the many
properties of relative correctness, that which we found most intriguing is the
property that program P' refines program P if and only if P' is more-correct
than P with respect to any specification. This inspires us to reconsider
program derivation by successive refinements: each step of this process
mandates that we transform a program P into a program P' that refines P, i.e.
P' is more-correct than P with respect to any specification. This raises the
question: why should we want to make P' more-correct than P with respect to any
specification, when we only have to satisfy specification R? In this paper, we
discuss a process of program derivation that replaces traditional sequence of
refinement-based correctness-preserving transformations starting from
specification R by a sequence of relative correctness-based
correctness-enhancing transformations starting from abort.
","[{'version': 'v1', 'created': 'Tue, 7 Jun 2016 04:09:28 GMT'}]",2016-06-08,"[['Diallo', 'Nafi', '', 'NJIT, USA'], ['Ghardallou', 'Wided', '', 'FST, Tunisia'], ['Desharnais', 'Jules', '', 'Laval University, Canada'], ['Mili', 'Ali', '', 'NJIT, USA']]","['Absolute correctness', 'relative correctness', 'program refinement', 'program derivation', 'correctnesspreservation', 'correctness enhancement']"
10968,2003.03350,Kyrylo Malakhov,"Oleksandr Palagin, Vitalii Velychko, Kyrylo Malakhov and Oleksandr
  Shchurov","Distributional semantic modeling: a revised technique to train term/word
  vector space models applying the ontology-related approach","In English, 9 pages, 2 figures. Not published yet. Prepared for
  special issue (UkrPROG 2020 conference) of the scientific journal ""Problems
  in programming"" (Founder: National Academy of Sciences of Ukraine, Institute
  of Software Systems of NAS Ukraine)","Problems in programming 2-3, pp 341-351, 2020 / Proceedings of the
  12th International Scientific and Practical Conference of Programming
  (UkrPROG 2020), Kyiv, Ukraine, September 15-16, 2020., Vol-2866 of CEUR
  Workshop Proceedings",10.15407/pp2020.02-03.341,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We design a new technique for the distributional semantic modeling with a
neural network-based approach to learn distributed term representations (or
term embeddings) - term vector space models as a result, inspired by the recent
ontology-related approach (using different types of contextual knowledge such
as syntactic knowledge, terminological knowledge, semantic knowledge, etc.) to
the identification of terms (term extraction) and relations between them
(relation extraction) called semantic pre-processing technology - SPT. Our
method relies on automatic term extraction from the natural language texts and
subsequent formation of the problem-oriented or application-oriented (also
deeply annotated) text corpora where the fundamental entity is the term
(includes non-compositional and compositional terms). This gives us an
opportunity to changeover from distributed word representations (or word
embeddings) to distributed term representations (or term embeddings). This
transition will allow to generate more accurate semantic maps of different
subject domains (also, of relations between input terms - it is useful to
explore clusters and oppositions, or to test your hypotheses about them). The
semantic map can be represented as a graph using Vec2graph - a Python library
for visualizing word embeddings (term embeddings in our case) as dynamic and
interactive graphs. The Vec2graph library coupled with term embeddings will not
only improve accuracy in solving standard NLP tasks, but also update the
conventional concept of automated ontology development. The main practical
result of our work is the development kit (set of toolkits represented as web
service APIs and web application), which provides all necessary routines for
the basic linguistic pre-processing and the semantic pre-processing of the
natural language texts in Ukrainian for future training of term vector space
models.
","[{'version': 'v1', 'created': 'Fri, 6 Mar 2020 18:27:39 GMT'}]",2022-01-04,"[['Palagin', 'Oleksandr', ''], ['Velychko', 'Vitalii', ''], ['Malakhov', 'Kyrylo', ''], ['Shchurov', 'Oleksandr', '']]","['distributional semantics', 'vector space model', 'word embedding', 'term extraction', 'term embedding', 'ontology', 'ontology engineering']"
10969,1906.00094,Nahil Sobh,"Diab W. Abueidda, Mohammad Almasri, Rami Ammourah, Umberto Ravaioli,
  Iwona M. Jasiuk, Nahil A. Sobh","Prediction and optimization of mechanical properties of composites using
  convolutional neural networks",,Composite Structures 2019,10.1016/j.compstruct.2019.111264,,cs.LG physics.comp-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we develop a convolutional neural network model to predict the
mechanical properties of a two-dimensional checkerboard composite
quantitatively. The checkerboard composite possesses two phases, one phase is
soft and ductile while the other is stiff and brittle. The ground-truth data
used in the training process are obtained from finite element analyses under
the assumption of plane stress. Monte Carlo simulations and central limit
theorem are used to find the size of the dataset needed. Once the training
process is completed, the developed model is validated using data unseen during
training. The developed neural network model captures the stiffness, strength,
and toughness of checkerboard composites with high accuracy. Also, we integrate
the developed model with a genetic algorithm (GA) optimizer to identify the
optimal microstructural designs. The genetic algorithm optimizer adopted here
has several operators, selection, crossover, mutation, and elitism. The
optimizer converges to configurations with highly enhanced properties. For the
case of the modulus and starting from randomly-initialized generation, the GA
optimizer converges to the global maximum which involves no soft elements.
Also, the GA optimizers, when used to maximize strength and toughness, tend
towards having soft elements in the region next to the crack tip.
","[{'version': 'v1', 'created': 'Fri, 31 May 2019 21:56:45 GMT'}]",2020-02-03,"[['Abueidda', 'Diab W.', ''], ['Almasri', 'Mohammad', ''], ['Ammourah', 'Rami', ''], ['Ravaioli', 'Umberto', ''], ['Jasiuk', 'Iwona M.', ''], ['Sobh', 'Nahil A.', '']]","['Machine learning', 'Convolutional neural networks', 'Mechanical']"
10970,2010.11614,Jos\'e Mar\'ia Mart\'inez-Otzeta,"Unai Zabala, Igor Rodriguez, Jos\'e Mar\'ia Mart\'inez-Otzeta, Itziar
  Irigoien, Elena Lazkano",Quantitative analysis of robot gesticulation behavior,,Auton Robot (2021),10.1007/s10514-020-09958-1,,cs.RO cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social robot capabilities, such as talking gestures, are best produced using
data driven approaches to avoid being repetitive and to show trustworthiness.
However, there is a lack of robust quantitative methods that allow to compare
such methods beyond visual evaluation. In this paper a quantitative analysis is
performed that compares two Generative Adversarial Networks based gesture
generation approaches. The aim is to measure characteristics such as fidelity
to the original training data, but at the same time keep track of the degree of
originality of the produced gestures. Principal Coordinate Analysis and
procrustes statistics are performed and a new Fr\'echet Gesture Distance is
proposed by adapting the Fr\'echet Inception Distance to gestures. These three
techniques are taken together to asses the fidelity/originality of the
generated gestures.
","[{'version': 'v1', 'created': 'Thu, 22 Oct 2020 11:17:18 GMT'}]",2021-01-06,"[['Zabala', 'Unai', ''], ['Rodriguez', 'Igor', ''], ['Martínez-Otzeta', 'José María', ''], ['Irigoien', 'Itziar', ''], ['Lazkano', 'Elena', '']]","['Social robots', 'Motion capturing and imitation', 'Generative Adversarial Networks', 'Gesture Generation', 'Principal CoordinateAnalysis', 'procrustes statistics', 'FID']"
10971,2201.12175,Philipp Scholl,"Philipp Scholl, Felix Dietrich, Clemens Otte, Steffen Udluft",Safe Policy Improvement Approaches on Discrete Markov Decision Processes,"12 pages, International Conference on Agents and Artificial
  Intelligence 2022",,10.5220/0010786600003116,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Safe Policy Improvement (SPI) aims at provable guarantees that a learned
policy is at least approximately as good as a given baseline policy. Building
on SPI with Soft Baseline Bootstrapping (Soft-SPIBB) by Nadjahi et al., we
identify theoretical issues in their approach, provide a corrected theory, and
derive a new algorithm that is provably safe on finite Markov Decision
Processes (MDP). Additionally, we provide a heuristic algorithm that exhibits
the best performance among many state of the art SPI algorithms on two
different benchmarks. Furthermore, we introduce a taxonomy of SPI algorithms
and empirically show an interesting property of two classes of SPI algorithms:
while the mean performance of algorithms that incorporate the uncertainty as a
penalty on the action-value is higher, actively restricting the set of policies
more consistently produces good policies and is, thus, safer.
","[{'version': 'v1', 'created': 'Fri, 28 Jan 2022 15:16:54 GMT'}]",2022-08-02,"[['Scholl', 'Philipp', ''], ['Dietrich', 'Felix', ''], ['Otte', 'Clemens', ''], ['Udluft', 'Steffen', '']]","['Risk-Sensitive Reinforcement Learning', 'Safe Policy Improvement', 'Markov Decision Processes']"
10972,1704.01282,Tamaghna Acharya,"Amrita Mukherjee, Tamaghna Acharya, Muhammad R. A. Khandaker","Outage Analysis for SWIPT-Enabled Two-Way Cognitive Cooperative
  Communications","15 pages, 5 figures, Submitted to IEEE Transactions on Vehicular
  Technology",,10.1109/TVT.2018.2840140,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study a cooperative cognitive radio network (CCRN) where
the secondary user-transmitter (SU-Tx) assists bi-directional communication
between a pair of primary users (PUs) following the principle of two-way
relaying. In return, it gets access to the spectrum of the PUs to enable its
own transmission to SU-receiver (SU-Rx). Further, in order to support
sustainable operation of the network, SU-Tx is assumed to harvest energy from
the RF signals received from the PUs, using the technique of simultaneous
wireless information and power transfer (SWIPT). Assuming a decode-and-forward
behaviour and power-splitting based relaying protocol at SU-Tx, closed form
expressions for outage probability of PU and SU are obtained. Simulation
results validate our analytical results and illustrate spectrum-efficiency and
energy-efficiency advantages of the proposed system over one-way relaying.
","[{'version': 'v1', 'created': 'Wed, 5 Apr 2017 06:47:25 GMT'}]",2019-04-03,"[['Mukherjee', 'Amrita', ''], ['Acharya', 'Tamaghna', ''], ['Khandaker', 'Muhammad R. A.', '']]","['Cooperative cognitive radio network', 'simultaneous wireless information and power transfer', 'two-way relaying', 'decode-and']"
10973,2008.08985,Aleksei Kondratev,Bas J. Dietzenbacher and Aleksei Y. Kondratev,Fair and consistent prize allocation in competitions,"35 pages, 1 figure. Management Science (2022)",,10.1287/mnsc.2022.4520,,cs.GT,http://creativecommons.org/licenses/by/4.0/,"  Given the final ranking of a competition, how should the total prize
endowment be allocated among the competitors? We study consistent prize
allocation rules satisfying elementary solidarity and fairness principles. In
particular, we axiomatically characterize several families of rules satisfying
anonymity, order preservation, and endowment monotonicity, which all fall
between the Equal Division rule and the Winner-Takes-All rule. Specific
characterizations of rules and subfamilies are directly obtained. To our
knowledge, this paper is the first that develops and motivates prize allocation
rules for rank-order competitions directly from axioms.
","[{'version': 'v1', 'created': 'Thu, 20 Aug 2020 14:19:40 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Jul 2021 18:37:58 GMT'}]",2022-09-09,"[['Dietzenbacher', 'Bas J.', ''], ['Kondratev', 'Aleksei Y.', '']]","['fair allocation', 'rank-order tournament', 'prize structure', 'tournament design', 'axiomatic analysis', 'consistency']"
10974,1403.0334,Sanjaya Kumar Panda,"Sourav Kumar Bhoi, Sanjaya Kumar Panda, Imran Hossain Faruk","Design and Performance Evaluation of an Optimized Disk Scheduling
  Algorithm (ODSA)","8 pages, 26 figures",International Journal of Computer Applications 2012,"10.5120/5010-7329 10.5120/5010-7329 10.5120/5010-7329 10.5120/5010-7329
  10.5120/5010-7329",pxc3877329,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Management of disk scheduling is a very important aspect of operating system.
Performance of the disk scheduling completely depends on how efficient is the
scheduling algorithm to allocate services to the request in a better manner.
Many algorithms (FIFO, SSTF, SCAN, C-SCAN, LOOK, etc.) are developed in the
recent years in order to optimize the system disk I/O performance. By reducing
the average seek time and transfer time, we can improve the performance of disk
I/O operation. In our proposed algorithm, Optimize Disk Scheduling Algorithm
(ODSA) is taking less average seek time and transfer time as compare to other
disk scheduling algorithms (FIFO, SSTF, SCAN, C-SCAN, LOOK, etc.), which
enhances the efficiency of the disk performance in a better manner.
","[{'version': 'v1', 'created': 'Mon, 3 Mar 2014 08:13:29 GMT'}]",2014-03-04,"[['Bhoi', 'Sourav Kumar', ''], ['Panda', 'Sanjaya Kumar', ''], ['Faruk', 'Imran Hossain', '']]","['Disk Scheduling', 'Sorting', 'Seek Time', 'Transfer Time', 'Average Seek Time']"
10975,1801.10476,Bruno Escoffier,"Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis",Parameterized Power Vertex Cover,"Short version presented at the conference WG 2016, Graph-Theoretic
  Concepts in Computer Science, LNCS 9941","Discrete Mathematics & Theoretical Computer Science, vol. 20 no.
  2, Discrete Algorithms (October 8, 2018) dmtcs:4873",10.23638/DMTCS-20-2-10,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study a recently introduced generalization of the Vertex Cover (VC)
problem, called Power Vertex Cover (PVC). In this problem, each edge of the
input graph is supplied with a positive integer demand. A solution is an
assignment of (power) values to the vertices, so that for each edge one of its
endpoints has value as high as the demand, and the total sum of power values
assigned is minimized. We investigate how this generalization affects the
parameterized complexity of Vertex Cover. On the positive side, when
parameterized by the value of the optimal P, we give an O*(1.274^P)-time
branching algorithm (O* is used to hide factors polynomial in the input size),
and also an O*(1.325^P)-time algorithm for the more general asymmetric case of
the problem, where the demand of each edge may differ for its two endpoints.
When the parameter is the number of vertices k that receive positive value, we
give O*(1.619^k) and O*(k^k)-time algorithms for the symmetric and asymmetric
cases respectively, as well as a simple quadratic kernel for the asymmetric
case. We also show that PVC becomes significantly harder than classical VC when
parameterized by the graph's treewidth t. More specifically, we prove that
unless the ETH is false, there is no n^o(t)-time algorithm for PVC. We give a
method to overcome this hardness by designing an FPT approximation scheme which
gives a (1+epsilon)-approximation to the optimal solution in time FPT in
parameters t and 1/epsilon.
","[{'version': 'v1', 'created': 'Wed, 31 Jan 2018 15:09:10 GMT'}, {'version': 'v2', 'created': 'Mon, 28 May 2018 07:32:09 GMT'}, {'version': 'v3', 'created': 'Thu, 20 Sep 2018 07:49:19 GMT'}, {'version': 'v4', 'created': 'Thu, 4 Oct 2018 08:39:20 GMT'}]",2019-03-14,"[['Angel', 'Eric', ''], ['Bampis', 'Evripidis', ''], ['Escoffier', 'Bruno', ''], ['Lampis', 'Michael', '']]","['Power vertex cover', 'Parameterized complexity', 'Treewidth', 'Parameterized approximation']"
10976,2206.07091,Breno Costa,"Breno Costa, Joao Bachiega Jr, Leonardo Reboucas de Carvalho, Michel
  Rosa, Aleteia Araujo","Monitoring Fog Computing: a Review, Taxonomy and Open Challenges",,,10.1016/j.comnet.2022.109189,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Fog computing is a distributed paradigm that provides computational resources
in the users' vicinity. Fog orchestration is a set of functionalities that
coordinate the dynamic infrastructure and manage the services to guarantee the
Service Level Agreements. Monitoring is an orchestration functionality of prime
importance. It is the basis for resource management actions, collecting status
of resource and service and delivering updated data to the orchestrator. There
are several cloud monitoring solutions and tools, but none of them comply with
fog characteristics and challenges. Fog monitoring solutions are scarce, and
they may not be prepared to compose an orchestration service. This paper
updates the knowledge base about fog monitoring, assessing recent subjects in
this context like observability, data standardization and instrumentation
domains. We propose a novel taxonomy of fog monitoring solutions, supported by
a systematic review of the literature. Fog monitoring proposals are analyzed
and categorized by this new taxonomy, offering researchers a comprehensive
overview. This work also highlights the main challenges and open research
questions.
","[{'version': 'v1', 'created': 'Fri, 13 May 2022 17:27:21 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Jun 2022 21:41:23 GMT'}]",2022-08-05,"[['Costa', 'Breno', ''], ['Bachiega', 'Joao', 'Jr'], ['de Carvalho', 'Leonardo Reboucas', ''], ['Rosa', 'Michel', ''], ['Araujo', 'Aleteia', '']]","['monitoring', 'orchestration', 'fog computing', 'taxonomy', 'fog monitoring']"
10977,2208.06231,Pino Caballero-Gil,"C\'andido Caballero-Gil, Pino Caballero-Gil, Jezabel Molina-Gil",Mutual authentication in self-organized VANETs,,"Computer Standards & Interfaces 36 (4), 704-710, 2014",10.1016/j.csi.2013.12.005,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The practical deployment of vehicular networks is still a pending issue. In
this paper we describe a new self-organized method of authentication for
VANETs, which allows their widespread, fast and secure implementation. Our
proposal does not involve any central certification authority because the nodes
themselves certify the validity of public keys of the other nodes. On the one
hand we propose an algorithm that each node must use to choose the public key
certificates for its local store. On the other hand, we also describe a new
node authentication method based on a cryptographic protocol including a
zero-knowledge proof that each node must use to convince another node on the
possession of certain secret without revealing anything about it, which allows
non-encrypted communication during authentication. Thanks to the combination of
the aforementioned tools, the cooperation among vehicles can be used for
developing several practical applications of VANETs, such as detection and
warning about abnormal traffic conditions. One of the most interesting aspects
of our proposal is that it only requires existing devices such as smartphones,
because the designed schemes are fully distributed and self-organized. In this
work we include an analysis of both an NS-2 simulation and a real device
implementation of the proposed algorithms, which enables us to extract
promising conclusions and several possible improvements and open questions for
further research.
","[{'version': 'v1', 'created': 'Fri, 12 Aug 2022 11:54:21 GMT'}]",2022-08-15,"[['Caballero-Gil', 'Cándido', ''], ['Caballero-Gil', 'Pino', ''], ['Molina-Gil', 'Jezabel', '']]","['vehicular ad-hoc network', 'authentication', 'security', 'self-organization', 'wireless communication']"
10978,2107.12479,Jianwen Luo,"Hongwu Zhu, Dong Wang, Nathan Boyd, Ziyi Zhou, Lecheng Ruan, Aidong
  Zhang, Ning Ding, Ye Zhao, Jianwen Luo","Terrain-perception-free Quadrupedal Spinning Locomotion on Versatile
  Terrains: Modeling, Analysis, and Experimental Validation",,Frontier in Robotics and AI. 2021,10.3389/frobt.2021.724138,,cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Dynamic quadrupedal locomotion over rough terrains reveals remarkable
progress over the last few decades. Small-scale quadruped robots are adequately
flexible and adaptable to traverse uneven terrains along sagittal direction,
such as slopes and stairs. To accomplish autonomous locomotion navigation in
complex environments, spinning is a fundamental yet indispensable functionality
for legged robots. However, spinning behaviors of quadruped robots on uneven
terrain often exhibit position drifts. Motivated by this problem, this study
presents an algorithmic method to enable accurate spinning motions over uneven
terrain and constrain the spinning radius of the Center of Mass (CoM) to be
bounded within a small range to minimize the drift risks. A modified spherical
foot kinematics representation is proposed to improve the foot kinematic model
and rolling dynamics of the quadruped during locomotion. A CoM planner is
proposed to generate stable spinning motion based on projected stability
margins. Accurate motion tracking is accomplished with Linear Quadratic
Regulator (LQR) to bound the position drift during the spinning movement.
Experiments are conducted on a small-scale quadruped robot and the
effectiveness of the proposed method is verified on versatile terrains
including flat ground, stairs and slopes.
","[{'version': 'v1', 'created': 'Mon, 26 Jul 2021 21:05:54 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Aug 2021 04:25:53 GMT'}, {'version': 'v3', 'created': 'Thu, 5 Aug 2021 13:22:08 GMT'}, {'version': 'v4', 'created': 'Tue, 26 Oct 2021 12:13:52 GMT'}]",2021-10-27,"[['Zhu', 'Hongwu', ''], ['Wang', 'Dong', ''], ['Boyd', 'Nathan', ''], ['Zhou', 'Ziyi', ''], ['Ruan', 'Lecheng', ''], ['Zhang', 'Aidong', ''], ['Ding', 'Ning', ''], ['Zhao', 'Ye', ''], ['Luo', 'Jianwen', '']]","['quadruped robot', 'turning gait', 'spinning locomotion', 'trajectory tracking control', 'versatile terrains']"
10979,2210.10010,Yanan Xin,"Yanan Xin, Natasa Tagasovska, Fernando Perez-Cruz, Martin Raubal","Vision Paper: Causal Inference for Interpretable and Robust Machine
  Learning in Mobility Analysis",accepted by ACM SIGSPATIAL 2022 Conference,,10.1145/3557915.3561473,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Artificial intelligence (AI) is revolutionizing many areas of our lives,
leading a new era of technological advancement. Particularly, the
transportation sector would benefit from the progress in AI and advance the
development of intelligent transportation systems. Building intelligent
transportation systems requires an intricate combination of artificial
intelligence and mobility analysis. The past few years have seen rapid
development in transportation applications using advanced deep neural networks.
However, such deep neural networks are difficult to interpret and lack
robustness, which slows the deployment of these AI-powered algorithms in
practice. To improve their usability, increasing research efforts have been
devoted to developing interpretable and robust machine learning methods, among
which the causal inference approach recently gained traction as it provides
interpretable and actionable information. Moreover, most of these methods are
developed for image or sequential data which do not satisfy specific
requirements of mobility data analysis. This vision paper emphasizes research
challenges in deep learning-based mobility analysis that require
interpretability and robustness, summarizes recent developments in using causal
inference for improving the interpretability and robustness of machine learning
methods, and highlights opportunities in developing causally-enabled machine
learning models tailored for mobility analysis. This research direction will
make AI in the transportation sector more interpretable and reliable, thus
contributing to safer, more efficient, and more sustainable future
transportation systems.
","[{'version': 'v1', 'created': 'Tue, 18 Oct 2022 17:28:58 GMT'}]",2022-10-19,"[['Xin', 'Yanan', ''], ['Tagasovska', 'Natasa', ''], ['Perez-Cruz', 'Fernando', ''], ['Raubal', 'Martin', '']]","['causal inference', 'mobility analysis', 'interpretability', 'robustness', 'machine learning']"
10980,2010.01570,Matthew Wright,David Wessel and Matthew Wright,Problems and Prospects for Intimate Musical Control of Computers,"Proceedings of the International Conference on New Interfaces for
  Musical Expression, 2001",,10.5281/zenodo.1176382,,cs.HC cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  In this paper we describe our efforts towards the development of live
performance computer-based musical instrumentation. Our design criteria include
initial ease of use coupled with a long term potential for virtuosity, minimal
and low variance latency, and clear and simple strategies for programming the
relationship between gesture and musical result. We present custom controllers
and unique adaptations of standard gestural interfaces, a programmable
connectivity processor, a communications protocol called Open Sound Control
(OSC), and a variety of metaphors for musical control. We further describe
applications of our technology to a variety of real musical performances and
directions for future research.
","[{'version': 'v1', 'created': 'Sun, 4 Oct 2020 12:55:43 GMT'}]",2020-10-06,"[['Wessel', 'David', ''], ['Wright', 'Matthew', '']]","['Gestural controllers', 'communications protocols', 'musicalsignal processing', 'latency', 'reactive computing']"
10981,2206.00288,Jan Tobias Muehlberg,Jan Tobias Muehlberg,"Sustaining Security and Safety in ICT: A Quest for Terminology,
  Objectives, and Limits",,"LIMITS '22: Workshop on Computing within Limits, June 21--22, 2022",10.21428/bf6fb269.58c3a89d,,cs.CR cs.CY,http://creativecommons.org/licenses/by-sa/4.0/,"  Security and safety are intertwined concepts in the world of computing. In
recent years, the terms ""sustainable security"" and ""sustainable safety"" came
into fashion and are being used referring to a variety of systems properties
ranging from efficiency to profitability, and sometimes meaning that a product
or service is good for people and planet. This leads to confusing perceptions
of products where customers might expect a sustainable product to be developed
without child labour, while the producer uses the term to signify that their
new product uses marginally less power than the previous generation of that
products. Even in research on sustainably safe and secure ICT, these different
notions of terminology are prevalent. As researchers we often work towards
optimising our subject of study towards one specific sustainability metric -
let's say energy consumption - while being blissfully unaware of, e.g., social
impacts, life-cycle impacts, or rebound effects of such optimisations.
  In this paper I dissect the idea of sustainable safety and security, starting
from the questions of what we want to sustain, and for whom we want to sustain
it. I believe that a general ""people and planet"" answer is inadequate here
because this form of sustainability cannot be the property of a single industry
sector but must be addressed by society as a whole. However, with sufficient
understanding of life-cycle impacts we may very well be able to devise research
and development efforts, and inform decision making processes towards the use
of integrated safety and security solutions that help us to address societal
challenges in the context of the climate and ecological crises, and that are
aligned with concepts such as intersectionality and climate justice. Of course,
these solutions can only be effective if they are embedded in societal and
economic change towards more frugal uses of data and ICT.
","[{'version': 'v1', 'created': 'Wed, 1 Jun 2022 07:46:17 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Jul 2022 14:01:19 GMT'}, {'version': 'v3', 'created': 'Tue, 15 Nov 2022 16:35:12 GMT'}]",2022-11-16,"[['Muehlberg', 'Jan Tobias', '']]","['safety', 'security', 'sustainability', 'planetary boundaries']"
10982,2208.00682,Marek Bolanowski,"Marek Bolanowski, Kamil \.Zak, Andrzej Paszkiewicz, Maria Ganzha,
  Marcin Paprzycki, Piotr Sowi\'nski, Ignacio Lacalle, Carlos E. Palau","Eficiency of REST and gRPC realizing communication tasks in
  microservice-based ecosystems","Accepted for the conference -- The 21st International Conference on
  Intelligent Software Methodologies, Tools, and Techniques (SOMET 2022)",,10.3233/FAIA220242,,cs.PF cs.DC cs.NI,http://creativecommons.org/licenses/by/4.0/,"  The aim of this contribution is to analyse practical aspects of the use of
REST APIs and gRPC to realize communication tasks in applications in
microservice-based ecosystems. On the basis of performed experiments, classes
of communication tasks, for which given technology performs data transfer more
efficiently, have been established. This, in turn, allows formulation of
criteria for the selection of appropriate communication methods for
communication tasks to be performed in an application using microservices-based
architecture.
","[{'version': 'v1', 'created': 'Mon, 1 Aug 2022 08:30:25 GMT'}]",2022-10-17,"[['Bolanowski', 'Marek', ''], ['Żak', 'Kamil', ''], ['Paszkiewicz', 'Andrzej', ''], ['Ganzha', 'Maria', ''], ['Paprzycki', 'Marcin', ''], ['Sowiński', 'Piotr', ''], ['Lacalle', 'Ignacio', ''], ['Palau', 'Carlos E.', '']]","['REST', 'gRPC', 'NET', 'distributed systems', 'IoT', 'microservices', 'adaptive networks']"
10983,2205.05661,Divya Ramesh,"Divya Ramesh, Vaishnav Kameswaran, Ding Wang, Nithya Sambasivan","How Platform-User Power Relations Shape Algorithmic Accountability: A
  Case Study of Instant Loan Platforms and Financially Stressed Users in India",To appear at FAccT 2022,,10.1145/3531146.3533237,,cs.HC cs.AI cs.CY cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Accountability, a requisite for responsible AI, can be facilitated through
transparency mechanisms such as audits and explainability. However, prior work
suggests that the success of these mechanisms may be limited to Global North
contexts; understanding the limitations of current interventions in varied
socio-political conditions is crucial to help policymakers facilitate wider
accountability. To do so, we examined the mediation of accountability in the
existing interactions between vulnerable users and a 'high-risk' AI system in a
Global South setting. We report on a qualitative study with 29
financially-stressed users of instant loan platforms in India. We found that
users experienced intense feelings of indebtedness for the 'boon' of instant
loans, and perceived huge obligations towards loan platforms. Users fulfilled
obligations by accepting harsh terms and conditions, over-sharing sensitive
data, and paying high fees to unknown and unverified lenders. Users
demonstrated a dependence on loan platforms by persisting with such behaviors
despite risks of harms such as abuse, recurring debts, discrimination, privacy
harms, and self-harm to them. Instead of being enraged with loan platforms,
users assumed responsibility for their negative experiences, thus releasing the
high-powered loan platforms from accountability obligations. We argue that
accountability is shaped by platform-user power relations, and urge caution to
policymakers in adopting a purely technical approach to fostering algorithmic
accountability. Instead, we call for situated interventions that enhance agency
of users, enable meaningful transparency, reconfigure designer-user relations,
and prompt a critical reflection in practitioners towards wider accountability.
We conclude with implications for responsibly deploying AI in FinTech
applications in India and beyond.
","[{'version': 'v1', 'created': 'Wed, 11 May 2022 17:43:12 GMT'}]",2022-05-12,"[['Ramesh', 'Divya', ''], ['Kameswaran', 'Vaishnav', ''], ['Wang', 'Ding', ''], ['Sambasivan', 'Nithya', '']]","['algorithmic accountability', 'algorithmic fairness', 'human-ai interaction', 'instant loans', 'socio-technical systems']"
10984,2103.04330,"\.Ilker \""Oz\c{c}elik","Ilker Ozcelik, Sai Medury, Justin Broaddus and Anthony Skjellum",An Overview of Cryptographic Accumulators,"Note: This is an extended version of a paper published In Proceedings
  of the 7th International Conference on Information Systems Security and
  Privacy (ICISSP 2021), pages 661-669",,10.5220/0010337806610669,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  This paper is a primer on cryptographic accumulators and how to apply them
practically. A cryptographic accumulator is a space- and time-efficient data
structure used for set-membership tests. Since it is possible to represent any
computational problem where the answer is yes or no as a set-membership
problem, cryptographic accumulators are invaluable data structures in computer
science and engineering. But, to the best of our knowledge, there is neither a
concise survey comparing and contrasting various types of accumulators nor a
guide for how to apply the most appropriate one for a given application.
Therefore, we address that gap by describing cryptographic accumulators while
presenting their fundamental and so-called optional properties. We discuss the
effects of each property on the given accumulator's performance in terms of
space and time complexity, as well as communication overhead.
","[{'version': 'v1', 'created': 'Sun, 7 Mar 2021 11:51:28 GMT'}]",2021-03-09,"[['Ozcelik', 'Ilker', ''], ['Medury', 'Sai', ''], ['Broaddus', 'Justin', ''], ['Skjellum', 'Anthony', '']]","['Cryptographic accumulator', 'Membership Test', 'RSA', 'Merkle Tree']"
10985,2206.05963,M\'aty\'as Sz\'ant\'o,"M\'aty\'as Sz\'ant\'o, Gy\""orgy R. Bog\'ar, L\'aszl\'o Vajta","ATDN vSLAM: An all-through Deep Learning-Based Solution for Visual
  Simultaneous Localization and Mapping",Published in Periodica Polytechnica Electrical Engineering 11 pages,"Periodica Polytechnica Electrical Engineering and Computer
  Science, 66(3), pp. 236-247, 2022",10.3311/PPee.20437,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  In this paper, a novel solution is introduced for visual Simultaneous
Localization and Mapping (vSLAM) that is built up of Deep Learning components.
The proposed architecture is a highly modular framework in which each component
offers state of the art results in their respective fields of vision-based deep
learning solutions. The paper shows that with the synergic integration of these
individual building blocks, a functioning and efficient all-through deep neural
(ATDN) vSLAM system can be created. The Embedding Distance Loss function is
introduced and using it the ATDN architecture is trained. The resulting system
managed to achieve 4.4% translation and 0.0176 deg/m rotational error on a
subset of the KITTI dataset. The proposed architecture can be used for
efficient and low-latency autonomous driving (AD) aiding database creation as
well as a basis for autonomous vehicle (AV) control.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2022 08:19:54 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Jun 2022 17:18:33 GMT'}, {'version': 'v3', 'created': 'Fri, 15 Jul 2022 14:34:17 GMT'}]",2022-07-18,"[['Szántó', 'Mátyás', ''], ['Bogár', 'György R.', ''], ['Vajta', 'László', '']]","['visual SLAM', 'Deep Learning', 'Deep Neural SLAM', 'autonomous driving']"
10986,2202.09648,Scott Lowe,"Scott C. Lowe, Louise P. McGarry, Jessica Douglas, Jason Newport,
  Sageev Oore, Christopher Whidden and Daniel J. Hasselman","Echofilter: A Deep Learning Segmentation Model Improves the Automation,
  Standardization, and Timeliness for Post-Processing Echosounder Data in Tidal
  Energy Streams",,Front. Mar. Sci. 9:867857 (2022),10.3389/fmars.2022.867857,,cs.LG cs.CV eess.SP,http://creativecommons.org/licenses/by/4.0/,"  Understanding the abundance and distribution of fish in tidal energy streams
is important to assess risks presented by introducing tidal energy devices to
the habitat. However tidal current flows suitable for tidal energy are often
highly turbulent, complicating the interpretation of echosounder data. The
portion of the water column contaminated by returns from entrained air must be
excluded from data used for biological analyses. Application of a single
conventional algorithm to identify the depth-of-penetration of entrained air is
insufficient for a boundary that is discontinuous, depth-dynamic, porous, and
varies with tidal flow speed.
  Using a case study at a tidal energy demonstration site in the Bay of Fundy,
we describe the development and application of a deep machine learning model
with a U-Net based architecture. Our model, Echofilter, was highly responsive
to the dynamic range of turbulence conditions and sensitive to the fine-scale
nuances in the boundary position, producing an entrained-air boundary line with
an average error of 0.33m on mobile downfacing and 0.5-1.0m on stationary
upfacing data, less than half that of existing algorithmic solutions. The
model's overall annotations had a high level of agreement with the human
segmentation, with an intersection-over-union score of 99% for mobile
downfacing recordings and 92-95% for stationary upfacing recordings. This
resulted in a 50% reduction in the time required for manual edits when compared
to the time required to manually edit the line placement produced by the
currently available algorithms. Because of the improved initial automated
placement, the implementation of the models permits an increase in the
standardization and repeatability of line placement.
","[{'version': 'v1', 'created': 'Sat, 19 Feb 2022 17:26:46 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Aug 2022 22:41:59 GMT'}]",2022-08-22,"[['Lowe', 'Scott C.', ''], ['McGarry', 'Louise P.', ''], ['Douglas', 'Jessica', ''], ['Newport', 'Jason', ''], ['Oore', 'Sageev', ''], ['Whidden', 'Christopher', ''], ['Hasselman', 'Daniel J.', '']]","['machine learning', 'deep learning', 'hydroacoustics', 'entrained air', 'marine renewable energy', 'tidal energy', 'environmental']"
10987,1812.10541,Himanshu Sharma,Himanshu Sharma and Umesh Vaidya and Baskar Ganapathysubramanian,"A Transfer Operator Methodology for Optimal Sensor Placement Accounting
  for Uncertainty",,"Building and Environment, 155,2019,334--349",10.1016/j.buildenv.2019.03.054,,cs.SY math.DS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sensors in buildings are used for a wide variety of applications such as
monitoring air quality, contaminants, indoor temperature, and relative
humidity. These are used for accessing and ensuring indoor air quality, and
also for ensuring safety in the event of chemical and biological attacks. It
follows that optimal placement of sensors become important to accurately
monitor contaminant levels in the indoor environment. However, contaminant
transport inside the indoor environment is governed by the indoor flow
conditions which are affected by various uncertainties associated with the
building systems including occupancy and boundary fluxes. Therefore, it is
important to account for all associated uncertainties while designing the
sensor layout. The transfer operator based framework provides an effective way
to identify optimal placement of sensors. Previous work has been limited to
sensor placements under deterministic scenarios. In this work we extend the
transfer operator based approach for optimal sensor placement while accounting
for building systems uncertainties. The methodology provides a probabilistic
metric to gauge coverage under uncertain conditions. We illustrate the
capabilities of the framework with examples exhibiting boundary flux
uncertainty.
","[{'version': 'v1', 'created': 'Wed, 26 Dec 2018 21:18:47 GMT'}]",2019-06-17,"[['Sharma', 'Himanshu', ''], ['Vaidya', 'Umesh', ''], ['Ganapathysubramanian', 'Baskar', '']]","['CFD', 'Uncertainty', 'Optimal Sensor placements', 'Perron-Forbenious Operator']"
10988,2208.10061,Ding Zou,"Ding Zou, Wei Wei, Ziyang Wang, Xian-Ling Mao, Feida Zhu, Rui Fang and
  Dangyang Chen","Improving Knowledge-aware Recommendation with Multi-level Interactive
  Contrastive Learning",Accepted to CIKM 2022,,10.1145/3511808.3557358,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Incorporating Knowledge Graphs (KG) into recommeder system has attracted
considerable attention. Recently, the technical trend of Knowledge-aware
Recommendation (KGR) is to develop end-to-end models based on graph neural
networks (GNNs). However, the extremely sparse user-item interactions
significantly degrade the performance of the GNN-based models, as: 1) the
sparse interaction, means inadequate supervision signals and limits the
supervised GNN-based models; 2) the combination of sparse interactions (CF
part) and redundant KG facts (KG part) results in an unbalanced information
utilization. Besides, the GNN paradigm aggregates local neighbors for node
representation learning, while ignoring the non-local KG facts and making the
knowledge extraction insufficient. Inspired by the recent success of
contrastive learning in mining supervised signals from data itself, in this
paper, we focus on exploring contrastive learning in KGR and propose a novel
multi-level interactive contrastive learning mechanism. Different from
traditional contrastive learning methods which contrast nodes of two generated
graph views, interactive contrastive mechanism conducts layer-wise
self-supervised learning by contrasting layers of different parts within
graphs, which is also an ""interaction"" action. Specifically, we first construct
local and non-local graphs for user/item in KG, exploring more KG facts for
KGR. Then an intra-graph level interactive contrastive learning is performed
within each graph, which contrasts layers of the CF and KG parts, for more
consistent information leveraging. Besides, an inter-graph level interactive
contrastive learning is performed between the local and non-local graphs, for
sufficiently and coherently extracting non-local KG signals. Extensive
experiments conducted on three benchmark datasets show the superior performance
of our proposed method over the state-of-the-arts.
","[{'version': 'v1', 'created': 'Mon, 22 Aug 2022 05:35:46 GMT'}]",2022-08-23,"[['Zou', 'Ding', ''], ['Wei', 'Wei', ''], ['Wang', 'Ziyang', ''], ['Mao', 'Xian-Ling', ''], ['Zhu', 'Feida', ''], ['Fang', 'Rui', ''], ['Chen', 'Dangyang', '']]","['Knowledge Graph', 'Recommendation', 'Contrastive Learning']"
10989,2107.00042,Jaume Baixeries,"Neus Catal\`a, Jaume Baixeries, Ramon Ferrer-Cancho, Llu\'is Padr\'o
  and Antoni Hern\'andez-Fern\'andez",Zipf's laws of meaning in Catalan,"21 pages, 11 figures",,10.1371/journal.pone.0260849,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In his pioneering research, G. K. Zipf formulated a couple of statistical
laws on the relationship between the frequency of a word with its number of
meanings: the law of meaning distribution, relating the frequency of a word and
its frequency rank, and the meaning-frequency law, relating the frequency of a
word with its number of meanings. Although these laws were formulated more than
half a century ago, they have been only investigated in a few languages. Here
we present the first study of these laws in Catalan.
  We verify these laws in Catalan via the relationship among their exponents
and that of the rank-frequency law. We present a new protocol for the analysis
of these Zipfian laws that can be extended to other languages. We report the
first evidence of two marked regimes for these laws in written language and
speech, paralleling the two regimes in Zipf's rank-frequency law in large
multi-author corpora discovered in early 2000s. Finally, the implications of
these two regimes will be discussed.
","[{'version': 'v1', 'created': 'Wed, 30 Jun 2021 18:06:06 GMT'}]",2022-01-19,"[['Català', 'Neus', ''], ['Baixeries', 'Jaume', ''], ['Ferrer-Cancho', 'Ramon', ''], ['Padró', 'Lluís', ''], ['Hernández-Fernández', 'Antoni', '']]","['Law of meaning distribution', 'meaning-frequency law', 'Zipf’srank-frequency law', 'Catalan', 'DIEC2', 'CTILC corpus', 'Glissando Corpus']"
10990,2106.00050,Lukas Hedegaard,Lukas Hedegaard and Alexandros Iosifidis,"Continual 3D Convolutional Neural Networks for Real-time Processing of
  Videos","22 pages, 9 figures, 7 tables",ECCV 2022,10.1007/978-3-031-19772-7_22,vol. 13664,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce Continual 3D Convolutional Neural Networks (Co3D CNNs), a new
computational formulation of spatio-temporal 3D CNNs, in which videos are
processed frame-by-frame rather than by clip. In online tasks demanding
frame-wise predictions, Co3D CNNs dispense with the computational redundancies
of regular 3D CNNs, namely the repeated convolutions over frames, which appear
in overlapping clips. We show that Continual 3D CNNs can reuse preexisting
3D-CNN weights to reduce the per-prediction floating point operations (FLOPs)
in proportion to the temporal receptive field while retaining similar memory
requirements and accuracy. This is validated with multiple models on
Kinetics-400 and Charades with remarkable results: CoX3D models attain
state-of-the-art complexity/accuracy trade-offs on Kinetics-400 with 12.1-15.3x
reductions of FLOPs and 2.3-3.8% improvements in accuracy compared to regular
X3D models while reducing peak memory consumption by up to 48%. Moreover, we
investigate the transient response of Co3D CNNs at start-up and perform
extensive benchmarks of on-hardware processing characteristics for publicly
available 3D CNNs.
","[{'version': 'v1', 'created': 'Mon, 31 May 2021 18:30:52 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Feb 2022 08:51:21 GMT'}, {'version': 'v3', 'created': 'Tue, 5 Jul 2022 07:42:04 GMT'}]",2023-01-25,"[['Hedegaard', 'Lukas', ''], ['Iosifidis', 'Alexandros', '']]","['3D CNN', 'Human Activity Recognition', 'Efficient', 'StreamProcessing', 'Online Inference', 'Continual Inference Network']"
10991,2210.02795,Robin Cugny,"Robin Cugny, Julien Aligon, Max Chevalier, Geoffrey Roman Jimenez and
  Olivier Teste","Why Should I Choose You? AutoXAI: A Framework for Selecting and Tuning
  eXplainable AI Solutions","16 pages, 7 figures, to be published in CIKM2022",,10.1145/3511808.3557247,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, a large number of XAI (eXplainable Artificial Intelligence)
solutions have been proposed to explain existing ML (Machine Learning) models
or to create interpretable ML models. Evaluation measures have recently been
proposed and it is now possible to compare these XAI solutions. However,
selecting the most relevant XAI solution among all this diversity is still a
tedious task, especially when meeting specific needs and constraints. In this
paper, we propose AutoXAI, a framework that recommends the best XAI solution
and its hyperparameters according to specific XAI evaluation metrics while
considering the user's context (dataset, ML model, XAI needs and constraints).
It adapts approaches from context-aware recommender systems and strategies of
optimization and evaluation from AutoML (Automated Machine Learning). We apply
AutoXAI to two use cases, and show that it recommends XAI solutions adapted to
the user's needs with the best hyperparameters matching the user's constraints.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2022 10:12:58 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Oct 2022 13:18:42 GMT'}]",2022-10-11,"[['Cugny', 'Robin', ''], ['Aligon', 'Julien', ''], ['Chevalier', 'Max', ''], ['Jimenez', 'Geoffrey Roman', ''], ['Teste', 'Olivier', '']]","['Explainable machine learning', 'Evaluation of explainability', 'Quality of explanation', 'Evaluation metrics', 'AutoML', 'Recommender system', 'Information system']"
10992,2111.06150,Michael Mesarcik,"Michael Mesarcik, Elena Ranguelova, Albert-Jan Boonstra and Rob V. van
  Nieuwpoort","Improving Novelty Detection using the Reconstructions of Nearest
  Neighbours",,,10.1016/j.array.2022.100182,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  We show that using nearest neighbours in the latent space of autoencoders
(AE) significantly improves performance of semi-supervised novelty detection in
both single and multi-class contexts. Autoencoding methods detect novelty by
learning to differentiate between the non-novel training class(es) and all
other unseen classes. Our method harnesses a combination of the reconstructions
of the nearest neighbours and the latent-neighbour distances of a given input's
latent representation. We demonstrate that our nearest-latent-neighbours (NLN)
algorithm is memory and time efficient, does not require significant data
augmentation, nor is reliant on pre-trained networks. Furthermore, we show that
the NLN-algorithm is easily applicable to multiple datasets without
modification. Additionally, the proposed algorithm is agnostic to autoencoder
architecture and reconstruction error method. We validate our method across
several standard datasets for a variety of different autoencoding architectures
such as vanilla, adversarial and variational autoencoders using either
reconstruction, residual or feature consistent losses. The results show that
the NLN algorithm grants up to a 17% increase in Area Under the Receiver
Operating Characteristics (AUROC) curve performance for the multi-class case
and 8% for single-class novelty detection.
","[{'version': 'v1', 'created': 'Thu, 11 Nov 2021 11:09:44 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Jan 2022 09:39:19 GMT'}]",2022-10-12,"[['Mesarcik', 'Michael', ''], ['Ranguelova', 'Elena', ''], ['Boonstra', 'Albert-Jan', ''], ['van Nieuwpoort', 'Rob V.', '']]","['Anomaly detection', 'Autoencoders', 'Semi-supervised Learning']"
10993,2002.02758,Parth Shah,"Parth Shah, Vishvajit Bakrola","Neural Machine Translation System of Indic Languages -- An Attention
  based Approach",,"2019 Second International Conference on Advanced Computational and
  Communication Paradigms (ICACCP), Gangtok, India, 2019, pp. 1-5",10.1109/ICACCP.2019.8882969,,cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural machine translation (NMT) is a recent and effective technique which
led to remarkable improvements in comparison of conventional machine
translation techniques. Proposed neural machine translation model developed for
the Gujarati language contains encoder-decoder with attention mechanism. In
India, almost all the languages are originated from their ancestral language -
Sanskrit. They are having inevitable similarities including lexical and named
entity similarity. Translating into Indic languages is always be a challenging
task. In this paper, we have presented the neural machine translation system
(NMT) that can efficiently translate Indic languages like Hindi and Gujarati
that together covers more than 58.49 percentage of total speakers in the
country. We have compared the performance of our NMT model with automatic
evaluation matrices such as BLEU, perplexity and TER matrix. The comparison of
our network with Google translate is also presented where it outperformed with
a margin of 6 BLEU score on English-Gujarati translation.
","[{'version': 'v1', 'created': 'Sun, 2 Feb 2020 07:15:18 GMT'}]",2020-02-10,"[['Shah', 'Parth', ''], ['Bakrola', 'Vishvajit', '']]","['Deep Neural Network', 'Machine Translation', 'Indic Language Translation', 'Natural Language Processing (NLP)', 'English-Gujarati Neural Machine Translation', 'NMT']"
10994,1811.07531,Aurelien Pelissier,"Aurelien Pelissier, Atsuyoshi Nakamura, Koji Tabata","Feature selection as Monte-Carlo Search in Growing Single Rooted
  Directed Acyclic Graph by Best Leaf Identification",,"Proceedings of the 2019 SIAM International Conference on Data
  Mining. 2019, 450-458",10.1137/1.9781611975673.51,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Monte Carlo tree search (MCTS) has received considerable interest due to its
spectacular success in the difficult problem of computer Go and also proved
beneficial in a range of other domains. A major issue that has received little
attention in the MCTS literature is the fact that, in most games, different
actions can lead to the same state, that may lead to a high degree of
redundancy in tree representation and unnecessary additional computational
cost. We extend MCTS to single rooted directed acyclic graph (SR-DAG), and
consider the Best Arm Identification (BAI) and the Best Leaf Identification
(BLI) problem of an expanding SR-DAG of arbitrary depth. We propose algorithms
that are (epsilon, delta)-correct in the fixed confidence setting, and prove an
asymptotic upper bounds of sample complexity for our BAI algorithm. As a major
application for our BLI algorithm, a novel approach for Feature Selection is
proposed by representing the feature set space as a SR-DAG and repeatedly
evaluating feature subsets until a candidate for the best leaf is returned, a
proof of concept is shown on benchmark data sets.
","[{'version': 'v1', 'created': 'Mon, 19 Nov 2018 07:29:51 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Apr 2019 17:57:17 GMT'}]",2019-05-10,"[['Pelissier', 'Aurelien', ''], ['Nakamura', 'Atsuyoshi', ''], ['Tabata', 'Koji', '']]","['DAG', 'MCTS', 'BAI', 'BLI', 'Feature Selection']"
10995,2109.12307,Xirong Li,"Xirong Li and Yang Zhou and Jie Wang and Hailan Lin and Jianchun Zhao
  and Dayong Ding and Weihong Yu and Youxin Chen",Multi-Modal Multi-Instance Learning for Retinal Disease Recognition,Accepted by ACM Multimedia 2021 (Main Track),,10.1145/3474085.3475418,,cs.CV cs.AI cs.MM,http://creativecommons.org/licenses/by/4.0/,"  This paper attacks an emerging challenge of multi-modal retinal disease
recognition. Given a multi-modal case consisting of a color fundus photo (CFP)
and an array of OCT B-scan images acquired during an eye examination, we aim to
build a deep neural network that recognizes multiple vision-threatening
diseases for the given case. As the diagnostic efficacy of CFP and OCT is
disease-dependent, the network's ability of being both selective and
interpretable is important. Moreover, as both data acquisition and manual
labeling are extremely expensive in the medical domain, the network has to be
relatively lightweight for learning from a limited set of labeled multi-modal
samples. Prior art on retinal disease recognition focuses either on a single
disease or on a single modality, leaving multi-modal fusion largely
underexplored. We propose in this paper Multi-Modal Multi-Instance Learning
(MM-MIL) for selectively fusing CFP and OCT modalities. Its lightweight
architecture (as compared to current multi-head attention modules) makes it
suited for learning from relatively small-sized datasets. For an effective use
of MM-MIL, we propose to generate a pseudo sequence of CFPs by over sampling a
given CFP. The benefits of this tactic include well balancing instances across
modalities, increasing the resolution of the CFP input, and finding out regions
of the CFP most relevant with respect to the final diagnosis. Extensive
experiments on a real-world dataset consisting of 1,206 multi-modal cases from
1,193 eyes of 836 subjects demonstrate the viability of the proposed model.
","[{'version': 'v1', 'created': 'Sat, 25 Sep 2021 08:16:47 GMT'}]",2021-09-28,"[['Li', 'Xirong', ''], ['Zhou', 'Yang', ''], ['Wang', 'Jie', ''], ['Lin', 'Hailan', ''], ['Zhao', 'Jianchun', ''], ['Ding', 'Dayong', ''], ['Yu', 'Weihong', ''], ['Chen', 'Youxin', '']]","['Retinal disease recognition', 'multi-modal retinal imaging', 'multimodal feature fusion', 'deep multi-instance learning']"
10996,2112.02346,Erwei Wang,"Erwei Wang, James J. Davis, Georgios-Ilias Stavrou, Peter Y. K.
  Cheung, George A. Constantinides, Mohamed S. Abdelfattah","Logic Shrinkage: Learned FPGA Netlist Sparsity for Efficient Neural
  Network Inference",Accepted manuscript uploaded 04/12/21. DOA 22/11/21,,10.1145/3490422.3502360,,cs.LG cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  FPGA-specific DNN architectures using the native LUTs as independently
trainable inference operators have been shown to achieve favorable
area-accuracy and energy-accuracy tradeoffs. The first work in this area,
LUTNet, exhibited state-of-the-art performance for standard DNN benchmarks. In
this paper, we propose the learned optimization of such LUT-based topologies,
resulting in higher-efficiency designs than via the direct use of
off-the-shelf, hand-designed networks. Existing implementations of this class
of architecture require the manual specification of the number of inputs per
LUT, K. Choosing appropriate K a priori is challenging, and doing so at even
high granularity, e.g. per layer, is a time-consuming and error-prone process
that leaves FPGAs' spatial flexibility underexploited. Furthermore, prior works
see LUT inputs connected randomly, which does not guarantee a good choice of
network topology. To address these issues, we propose logic shrinkage, a
fine-grained netlist pruning methodology enabling K to be automatically learned
for every LUT in a neural network targeted for FPGA inference. By removing LUT
inputs determined to be of low importance, our method increases the efficiency
of the resultant accelerators. Our GPU-friendly solution to LUT input removal
is capable of processing large topologies during their training with negligible
slowdown. With logic shrinkage, we better the area and energy efficiency of the
best-performing LUTNet implementation of the CNV network classifying CIFAR-10
by 1.54x and 1.31x, respectively, while matching its accuracy. This
implementation also reaches 2.71x the area efficiency of an equally accurate,
heavily pruned BNN. On ImageNet with the Bi-Real Net architecture, employment
of logic shrinkage results in a post-synthesis area reduction of 2.67x vs
LUTNet, allowing for implementation that was previously impossible on today's
largest FPGAs.
","[{'version': 'v1', 'created': 'Sat, 4 Dec 2021 14:23:24 GMT'}, {'version': 'v2', 'created': 'Sun, 2 Jan 2022 12:19:38 GMT'}]",2022-01-04,"[['Wang', 'Erwei', ''], ['Davis', 'James J.', ''], ['Stavrou', 'Georgios-Ilias', ''], ['Cheung', 'Peter Y. K.', ''], ['Constantinides', 'George A.', ''], ['Abdelfattah', 'Mohamed S.', '']]","['LUT-based neural networks', 'binary neural networks', 'pruning']"
10997,2203.14253,Amir Reza Asadi,"Amir Reza Asadi, Reza Hemadi",Understanding Currencies in Video Games: A Review,"""Published"" 1st International Digital Games Research Conference:
  Trends, Technologies, and Applications (DGRC)",,10.1109/DGRC.2018.8712047,,cs.CY cs.HC,http://creativecommons.org/licenses/by/4.0/,"  This paper presents a review of the status of currencies in video games. The
business of video games is a multibillion-dollar industry, and its internal
economy design is an important field to investigate. In this study, we have
distinguished virtual currencies in terms of game mechanics and virtual
currency schema, and we have examined 11 games that have used virtual
currencies in a significant way and have provided insight for game designers on
the internal game economy by showing tangible examples of game mechanics
presented in our model
","[{'version': 'v1', 'created': 'Sun, 27 Mar 2022 09:16:39 GMT'}]",2022-03-29,"[['Asadi', 'Amir Reza', ''], ['Hemadi', 'Reza', '']]","['in-game currency', 'Virtual Currency', 'Game Mechanics', 'Virtual Economy']"
10998,1907.01841,Hacer Yalim Keles,Yahya Dogan and Hacer Yalim Keles,"Semi-supervised Image Attribute Editing using Generative Adversarial
  Networks","This paper is the preprint of the accepted manuscript in
  Neurocomputing Journal. To visualize the Figures in the manuscript in high
  quality, please check the version at this URL:
  https://github.com/yahyadogan72/CRG",,10.1016/j.neucom.2020.03.071,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image attribute editing is a challenging problem that has been recently
studied by many researchers using generative networks. The challenge is in the
manipulation of selected attributes of images while preserving the other
details. The method to achieve this goal is to find an accurate latent vector
representation of an image and a direction corresponding to the attribute.
Almost all the works in the literature use labeled datasets in a supervised
setting for this purpose. In this study, we introduce an architecture called
Cyclic Reverse Generator (CRG), which allows learning the inverse function of
the generator accurately via an encoder in an unsupervised setting by utilizing
cyclic cost minimization. Attribute editing is then performed using the CRG
models for finding desired attribute representations in the latent space. In
this work, we use two arbitrary reference images, with and without desired
attributes, to compute an attribute direction for editing. We show that the
proposed approach performs better in terms of image reconstruction compared to
the existing end-to-end generative models both quantitatively and
qualitatively. We demonstrate state-of-the-art results on both real images and
generated images in CelebA dataset.
","[{'version': 'v1', 'created': 'Wed, 3 Jul 2019 10:38:56 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Apr 2020 17:18:48 GMT'}]",2020-04-14,"[['Dogan', 'Yahya', ''], ['Keles', 'Hacer Yalim', '']]","['Image attribute editing', 'generative models', 'generative adversarial networks', 'deeplearning', 'convolutional neural networks']"
10999,2004.11783,Barry De Bruin,"Barry de Bruin, Zoran Zivkovic, Henk Corporaal","Quantization of Deep Neural Networks for Accumulator-constrained
  Processors","20 pages, 13 figures","Microprocessors and Microsystems Volume 72, February 2020, 102872",10.1016/j.micpro.2019.102872,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce an Artificial Neural Network (ANN) quantization methodology for
platforms without wide accumulation registers. This enables fixed-point model
deployment on embedded compute platforms that are not specifically designed for
large kernel computations (i.e. accumulator-constrained processors). We
formulate the quantization problem as a function of accumulator size, and aim
to maximize the model accuracy by maximizing bit width of input data and
weights. To reduce the number of configurations to consider, only solutions
that fully utilize the available accumulator bits are being tested. We
demonstrate that 16-bit accumulators are able to obtain a classification
accuracy within 1\% of the floating-point baselines on the CIFAR-10 and
ILSVRC2012 image classification benchmarks. Additionally, a near-optimal
$2\times$ speedup is obtained on an ARM processor, by exploiting 16-bit
accumulators for image classification on the All-CNN-C and AlexNet networks.
","[{'version': 'v1', 'created': 'Fri, 24 Apr 2020 14:47:14 GMT'}]",2020-04-27,"[['de Bruin', 'Barry', ''], ['Zivkovic', 'Zoran', ''], ['Corporaal', 'Henk', '']]","['quantization', 'fixed-point', 'efficient inference', 'narrow accumulators', 'convolutional neuralnetworks']"
11000,2011.03155,Hock Hung Chieng,"Hock Hung Chieng, Noorhaniza Wahid and Pauline Ong","Parametric Flatten-T Swish: An Adaptive Non-linear Activation Function
  For Deep Learning",19 pages,"Journal of Information and Communication Technology, 20(1), 21-39,
  2021",10.32890/jict.20.1.2021.9267.,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Activation function is a key component in deep learning that performs
non-linear mappings between the inputs and outputs. Rectified Linear Unit
(ReLU) has been the most popular activation function across the deep learning
community. However, ReLU contains several shortcomings that can result in
inefficient training of the deep neural networks, these are: 1) the negative
cancellation property of ReLU tends to treat negative inputs as unimportant
information for the learning, resulting in a performance degradation; 2) the
inherent predefined nature of ReLU is unlikely to promote additional
flexibility, expressivity, and robustness to the networks; 3) the mean
activation of ReLU is highly positive and leads to bias shift effect in network
layers; and 4) the multilinear structure of ReLU restricts the non-linear
approximation power of the networks. To tackle these shortcomings, this paper
introduced Parametric Flatten-T Swish (PFTS) as an alternative to ReLU. By
taking ReLU as a baseline method, the experiments showed that PFTS improved
classification accuracy on SVHN dataset by 0.31%, 0.98%, 2.16%, 17.72%, 1.35%,
0.97%, 39.99%, and 71.83% on DNN-3A, DNN-3B, DNN-4, DNN- 5A, DNN-5B, DNN-5C,
DNN-6, and DNN-7, respectively. Besides, PFTS also achieved the highest mean
rank among the comparison methods. The proposed PFTS manifested higher
non-linear approximation power during training and thereby improved the
predictive performance of the networks.
","[{'version': 'v1', 'created': 'Fri, 6 Nov 2020 01:50:46 GMT'}, {'version': 'v2', 'created': 'Sat, 26 Feb 2022 12:50:20 GMT'}]",2022-03-01,"[['Chieng', 'Hock Hung', ''], ['Wahid', 'Noorhaniza', ''], ['Ong', 'Pauline', '']]","['Activation function', 'deep learning', 'Flatten-T Swish', 'non-linearity', 'ReLU']"
11001,2209.01734,Hui Gao,"Hui Gao, Hongyu Kuang, Kexin Sun, Xiaoxing Ma, Alexander Egyed,
  Patrick M\""ader, Guoping Rong, Dong Shao, He Zhang","Using Consensual Biterms from Text Structures of Requirements and Code
  to Improve IR-Based Traceability Recovery","Accepted by the 37th IEEE/ACM International Conference on Automated
  Software Engineering (ASE 2022)",,10.1145/3551349.3556948,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traceability approves trace links among software artifacts based on whether
two artifacts are related by system functionalities. The traces are valuable
for software development, but are difficult to obtain manually. To cope with
the costly and fallible manual recovery, automated approaches are proposed to
recover traces through textual similarities among software artifacts, such as
those based on Information Retrieval (IR). However, the low quality & quantity
of artifact texts negatively impact the calculated IR values, thus greatly
hindering the performance of IR-based approaches. In this study, we propose to
extract co-occurred word pairs from the text structures of both requirements
and code (i.e., consensual biterms) to improve IR-based traceability recovery.
We first collect a set of biterms based on the part-of-speech of requirement
texts, and then filter them through the code texts. We then use these
consensual biterms to both enrich the input corpus for IR techniques and
enhance the calculations of IR values. A nine-system-based evaluation shows
that in general, when solely used to enhance IR techniques, our approach can
outperform pure IR-based approaches and another baseline by 21.9% & 21.8% in
AP, and 9.3% & 7.2% in MAP, respectively. Moreover, when used to collaborate
with another enhancing strategy from different perspectives, it can outperform
this baseline by 5.9% in AP and 4.8% in MAP.
","[{'version': 'v1', 'created': 'Mon, 5 Sep 2022 02:45:43 GMT'}]",2022-09-07,"[['Gao', 'Hui', ''], ['Kuang', 'Hongyu', ''], ['Sun', 'Kexin', ''], ['Ma', 'Xiaoxing', ''], ['Egyed', 'Alexander', ''], ['Mäder', 'Patrick', ''], ['Rong', 'Guoping', ''], ['Shao', 'Dong', ''], ['Zhang', 'He', '']]","['traceability recovery', 'text structures', 'biterm', 'information retrieval']"
11002,2111.03488,Husam Suleiman,Husam Suleiman and Otman Basir,"SLA-Driven Load Scheduling in Multi-Tier Cloud Computing: Financial
  Impact Considerations",arXiv admin note: substantial text overlap with arXiv:2004.05695,"Volume 10, Number 1/2, pp. 1-24, April 2020",10.5121/ijccsa.2020.10201,,cs.PF cs.DC cs.NI,http://creativecommons.org/licenses/by/4.0/,"  A cloud service provider strives to provide a high Quality of Service (QoS)
to client jobs. Such jobs vary in computational and Service-Level-Agreement
(SLA) obligations, as well as differ with respect to tolerating delays and SLA
violations. The job scheduling plays a critical role in servicing cloud demands
by allocating appropriate resources to execute client jobs. The response to
such jobs is optimized by the cloud provider on a multi-tier cloud computing
environment. Typically, the complex and dynamic nature of multi-tier
environments incurs difficulties in meeting such demands, because tiers are
dependent on each other which in turn makes bottlenecks of a tier shift to
escalate in subsequent tiers. However, the optimization process of existing
approaches produces single-tier-driven schedules that do not employ the
differential impact of SLA violations in executing client jobs. Furthermore,
the impact of schedules optimized at the tier level on the performance of
schedules formulated in subsequent tiers tends to be ignored, resulting in a
less than optimal performance when measured at the multi-tier level. Thus,
failing in committing job obligations incurs SLA penalties that often take the
form of either financial compensations, or losing future interests and
motivations of unsatisfied clients in the service provided. In this paper, a
scheduling and allocation approach is proposed to formulate schedules that
account for differential impacts of SLA violation penalties and, thus, produce
schedules that are optimal in financial performance. A queue virtualization
scheme is designed to facilitate the formulation of optimal schedules at the
tier and multi-tier levels of the cloud environment. Because the scheduling
problem is NP-hard, a biologically inspired approach is proposed to mitigate
the complexity of finding optimal schedules.
","[{'version': 'v1', 'created': 'Fri, 5 Nov 2021 13:18:47 GMT'}]",2021-11-08,"[['Suleiman', 'Husam', ''], ['Basir', 'Otman', '']]","['Cloud Computing', 'Task Scheduling and Balancing', 'QoS Optimization', 'Resource Allocation', 'Genetic Algorithms']"
11003,2212.11737,Fabrice Rossi,"A. Chatzimparmpas, R. Martins, I. Jusufi, K. Kucher, Fabrice Rossi
  (CEREMADE), A. Kerren","The State of the Art in Enhancing Trust in Machine Learning Models with
  the Use of Visualizations",,"Computer Graphics Forum, 2020, 39 (3), pp.713-756",10.1111/cgf.14034,,cs.LG cs.HC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning (ML) models are nowadays used in complex applications in
various domains, such as medicine, bioinformatics, and other sciences. Due to
their black box nature, however, it may sometimes be hard to understand and
trust the results they provide. This has increased the demand for reliable
visualization tools related to enhancing trust in ML models, which has become a
prominent topic of research in the visualization community over the past
decades. To provide an overview and present the frontiers of current research
on the topic, we present a State-of-the-Art Report (STAR) on enhancing trust in
ML models with the use of interactive visualization. We define and describe the
background of the topic, introduce a categorization for visualization
techniques that aim to accomplish this goal, and discuss insights and
opportunities for future research directions. Among our contributions is a
categorization of trust against different facets of interactive ML, expanded
and improved from previous research. Our results are investigated from
different analytical perspectives: (a) providing a statistical overview, (b)
summarizing key findings, (c) performing topic analyses, and (d) exploring the
data sets used in the individual papers, all with the support of an interactive
web-based survey browser. We intend this survey to be beneficial for
visualization researchers whose interests involve making ML models more
trustworthy, as well as researchers and practitioners from other disciplines in
their search for effective visualization techniques suitable for solving their
tasks with confidence and conveying meaning to their data.
","[{'version': 'v1', 'created': 'Thu, 22 Dec 2022 14:29:43 GMT'}]",2022-12-23,"[['Chatzimparmpas', 'A.', '', 'CEREMADE'], ['Martins', 'R.', '', 'CEREMADE'], ['Jusufi', 'I.', '', 'CEREMADE'], ['Kucher', 'K.', '', 'CEREMADE'], ['Rossi', 'Fabrice', '', 'CEREMADE'], ['Kerren', 'A.', '']]","['trustworthy machine learning', 'visualization', 'interpretable machine learning', 'explainable machine learning']"
11004,2204.00764,Milind Chabbi,Milind Chabbi and Murali Krishna Ramanathan,A Study of Real-World Data Races in Golang,"To appear in the proceedings of the 43rd Programming Language Design
  and Implementation (PLDI 2022)",,10.1145/3519939.3523720,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  The concurrent programming literature is rich with tools and techniques for
data race detection. Less, however, has been known about real-world,
industry-scale deployment, experience, and insights about data races. Golang
(Go for short) is a modern programming language that makes concurrency a
first-class citizen. Go offers both message passing and shared memory for
communicating among concurrent threads. Go is gaining popularity in modern
microservice-based systems. Data races in Go stand in the face of its emerging
popularity.
  In this paper, using our industrial codebase as an example, we demonstrate
that Go developers embrace concurrency and show how the abundance of
concurrency alongside language idioms and nuances make Go programs highly
susceptible to data races. Google's Go distribution ships with a built-in
dynamic data race detector based on ThreadSanitizer. However, dynamic race
detectors pose scalability and flakiness challenges; we discuss various
software engineering trade-offs to make this detector work effectively at
scale. We have deployed this detector in Uber's 46 million lines of Go codebase
hosting 2100 distinct microservices, found over 2000 data races, and fixed over
1000 data races, spanning 790 distinct code patches submitted by 210 unique
developers over a six-month period. Based on a detailed investigation of these
data race patterns in Go, we make seven high-level observations relating to the
complex interplay between the Go language paradigm and data races.
","[{'version': 'v1', 'created': 'Sat, 2 Apr 2022 05:13:38 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Apr 2022 19:17:54 GMT'}]",2022-04-07,"[['Chabbi', 'Milind', ''], ['Ramanathan', 'Murali Krishna', '']]","['Data race', 'Golang', 'Dynamic analysis']"
11005,2108.10661,Bogdan Burlacu,"Bogdan Burlacu, Michael Affenzeller, Michael Kommenda",On the Effectiveness of Genetic Operations in Symbolic Regression,"International Conference on Computer Aided Systems Theory, Eurocast
  2015, pp 367-374","In: Moreno-D\'iaz R. et al (eds) Computer Aided Systems Theory,
  EUROCAST 2015. Lecture Notes in Computer Science, Vol. 9520. Springer (2015)",10.1007/978-3-319-27340-2_46,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a methodology for analyzing the evolutionary dynamics of
genetic programming (GP) using genealogical information, diversity measures and
information about the fitness variation from parent to offspring. We introduce
a new subtree tracing approach for identifying the origins of genes in the
structure of individuals, and we show that only a small fraction of ancestor
individuals are responsible for the evolvement of the best solutions in the
population.
","[{'version': 'v1', 'created': 'Tue, 24 Aug 2021 11:59:52 GMT'}]",2021-08-25,"[['Burlacu', 'Bogdan', ''], ['Affenzeller', 'Michael', ''], ['Kommenda', 'Michael', '']]","['Genetic programming', 'evolutionary dynamics', 'algorithm analysis', 'symbolic regression']"
11006,1803.09823,Ra'Fat AL-Msie'deen Dr.,Ra'Fat Al-Msie'deen and Anas H. Blasi,"The Impact of the Object-Oriented Software Evolution on Software
  Metrics: The Iris Approach","8 pages, 3 figures, 6 tables, ""Indian Journal of Science and
  Technology"". Keywords: Object-Oriented Software, Software Variants, Reverse
  Engineering, Software Engineering, Software Evolution, Software Metrics,
  Software Complexity","Indian Journal of Science and Technology, 11(8), 1-8, 2018",10.17485/ijst/2018/v11i8/121148,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Object-Oriented (OO) software system evolves over the time to meet the
new requirements. Based on the initial release of software, the continuous
modification of software code leads to software evolution. Software needs to
evolve over the time to meet the new user's requirements. Software companies
often develop variant software of the original one depends on customers' needs.
The main hypothesis of this paper states that the software when it evolves over
the time, its code continues to grow, change and become more complex. This
paper proposes an automatic approach (Iris) to examine the proposed hypothesis.
Originality of this approach is the exploiting of the software variants to
study the impact of software evolution on the software metrics. This paper
presents the results of experiments conducted on three releases of drawing
shapes software, sixteen releases of rhino software, eight releases of mobile
media software and ten releases of ArgoUML software. Based on the extracted
software metrics, It has been found that Iris hypothesis is supported by the
computed metrics.
","[{'version': 'v1', 'created': 'Thu, 15 Mar 2018 12:33:34 GMT'}]",2018-03-28,"[[""Al-Msie'deen"", ""Ra'Fat"", ''], ['Blasi', 'Anas H.', '']]","['Object-Oriented Software', 'Software Variants', 'Reverse Engineering', 'Software Engineering', 'Software Evolution', 'Software Metrics', 'Software Complexity']"
11007,2104.14281,Yongzhen Wang,"Yongzhen Wang, Xiaozhong Liu, Katy B\""orner, Jun Lin, Yingnan Ju,
  Changlong Sun, Luo Si","Leveraging Online Shopping Behaviors as a Proxy for Personal Lifestyle
  Choices: New Insights into Chronic Disease Prevention Literacy","58 pages with appendices, 5 figures, 17 tables",,10.1177/20552076221089092,,cs.CY cs.LG stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Objective: Ubiquitous internet access is reshaping the way we live, but it is
accompanied by unprecedented challenges in preventing chronic diseases that are
usually planted by long exposure to unhealthy lifestyles. This paper proposes
leveraging online shopping behaviors as a proxy for personal lifestyle choices
to improve chronic disease prevention literacy, targeted for times when
e-commerce user experience has been assimilated into most people's everyday
lives.
  Methods: Longitudinal query logs and purchase records from 15 million online
shoppers were accessed, constructing a broad spectrum of lifestyle features
covering various product categories and buyer personas. Using the
lifestyle-related information preceding online shoppers' first purchases of
specific prescription drugs, we could determine associations between their past
lifestyle choices and whether they suffered from a particular chronic disease.
  Results: Novel lifestyle risk factors were discovered in two
exemplars--depression and type 2 diabetes, most of which showed reasonable
consistency with existing healthcare knowledge. Further, such empirical
findings could be adopted to locate online shoppers at higher risk of these
chronic diseases with decent accuracy [i.e., (area under the receiver operating
characteristic curve) AUC=0.68 for depression and AUC=0.70 for type 2
diabetes], closely matching the performance of screening surveys benchmarked
against medical diagnosis.
  Conclusions: Mining online shopping behaviors can point medical experts to a
series of lifestyle issues associated with chronic diseases that are less
explored to date. Hopefully, unobtrusive chronic disease surveillance via
e-commerce sites can grant consenting individuals a privilege to be connected
more readily with the medical profession and sophistication.
","[{'version': 'v1', 'created': 'Thu, 29 Apr 2021 12:05:16 GMT'}, {'version': 'v2', 'created': 'Fri, 30 Apr 2021 00:54:23 GMT'}, {'version': 'v3', 'created': 'Mon, 12 Jul 2021 12:08:12 GMT'}, {'version': 'v4', 'created': 'Tue, 31 Aug 2021 13:56:34 GMT'}, {'version': 'v5', 'created': 'Wed, 9 Mar 2022 08:25:25 GMT'}, {'version': 'v6', 'created': 'Thu, 10 Mar 2022 02:07:16 GMT'}]",2022-03-15,"[['Wang', 'Yongzhen', ''], ['Liu', 'Xiaozhong', ''], ['Börner', 'Katy', ''], ['Lin', 'Jun', ''], ['Ju', 'Yingnan', ''], ['Sun', 'Changlong', ''], ['Si', 'Luo', '']]","['online shopping behavior', 'lifestyle risk factor', 'chronic disease risk prediction', 'depression', 'type 2']"
11008,1811.06877,Cornelius Steinbrink,"Cornelius Steinbrink, Arjen A. van der Meer, Milos Cvetkovic, Davood
  Babazadeh, Sebastian Rohjans, Peter Palensky, Sebastian Lehnhoff",Smart Grid Co-Simulation with MOSAIK and HLA: A Comparison Study,,Computer Science-Research and Development (2018),10.1007/s00450-017-0379-y,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evaluating new technological developments for energy systems is becoming more
and more complex. The overall application environment is a continuously growing
and interconnected cyber-physical system so that analytical assessment is
practically impossible to realize. Consequently, new solutions must be
evaluated in simulation studies. Due to the interdisciplinarity of the
simulation scenarios, various heterogeneous tools must be connected. This
approach is known as co-simulation. During the last years, different approaches
have been developed or adapted for applications in energy systems. In this
paper, two co-simulation approaches are compared that follow generic, versatile
concepts. The tool mosaik, which has been explicitly developed for the purpose
of co-simulation in complex energy systems, is compared to the High Level
Architecture (HLA), which possesses a domain-independent scope but is often
employed in the energy domain. The comparison is twofold, considering the
tools' conceptual architectures as well as results from the simulation of
representative test cases. It suggests that mosaik may be the better choice for
entry-level, prototypical co-simulation while HLA is more suited for complex
and extensive studies.
","[{'version': 'v1', 'created': 'Thu, 15 Nov 2018 08:25:29 GMT'}]",2018-11-19,"[['Steinbrink', 'Cornelius', ''], ['van der Meer', 'Arjen A.', ''], ['Cvetkovic', 'Milos', ''], ['Babazadeh', 'Davood', ''], ['Rohjans', 'Sebastian', ''], ['Palensky', 'Peter', ''], ['Lehnhoff', 'Sebastian', '']]","['Co-simulation', 'mosaik', 'HLA', 'Cyber-physical energy systems']"
11009,2207.01117,Guangji Bai,"Guangji Bai, Liang Zhao",Saliency-Regularized Deep Multi-Task Learning,"10 pages, 7 Figures, KDD 2022",,10.1145/3534678.3539442,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multitask learning is a framework that enforces multiple learning tasks to
share knowledge to improve their generalization abilities. While shallow
multitask learning can learn task relations, it can only handle predefined
features. Modern deep multitask learning can jointly learn latent features and
task sharing, but they are obscure in task relation. Also, they predefine which
layers and neurons should share across tasks and cannot learn adaptively. To
address these challenges, this paper proposes a new multitask learning
framework that jointly learns latent features and explicit task relations by
complementing the strength of existing shallow and deep multitask learning
scenarios. Specifically, we propose to model the task relation as the
similarity between task input gradients, with a theoretical analysis of their
equivalency. In addition, we innovatively propose a multitask learning
objective that explicitly learns task relations by a new regularizer.
Theoretical analysis shows that the generalizability error has been reduced
thanks to the proposed regularizer. Extensive experiments on several multitask
learning and image classification benchmarks demonstrate the proposed method
effectiveness, efficiency as well as reasonableness in the learned task
relation patterns.
","[{'version': 'v1', 'created': 'Sun, 3 Jul 2022 20:26:44 GMT'}]",2022-07-05,"[['Bai', 'Guangji', ''], ['Zhao', 'Liang', '']]","['Multi-task Learning', 'Task Relation', 'Saliency Detection']"
11010,2201.02866,Ievgen Kabin,"Ievgen Kabin, Zoya Dyka, Dan Klann and Peter Langendoerfer","Horizontal DPA Attacks against ECC: Impact of Implemented Field
  Multiplication Formula","Author's version accepted for DTIS-2019; the final publication is
  available at https://ieeexplore.ieee.org/document/8735011. arXiv admin note:
  text overlap with arXiv:2201.02868",,10.1109/DTIS.2019.8735011,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Due to the nature of applications such as critical infrastructure and the
Internet of Things etc. side channel analysis attacks are becoming a serious
threat. Side channel analysis attacks take advantage from the fact that the
behavior of crypto implementations can be observed and provides hints that
simplify revealing keys. A new type of SCA are the so called horizontal SCAs.
Well known randomization based countermeasures are effective means against
vertical DPA attacks but they are not effective against horizontal DPA attacks.
In this paper we investigate how the formula used to implement the
multiplication of $GF(2^n)$-elements influences the results of horizontal DPA
attacks against a Montgomery kP implementation. We implemented 5 designs with
different partial multipliers, i.e. based on different multiplication formulae.
We used two different technologies, i.e. a 130 and a 250 nm technology, to
simulate power traces for our analysis. We show that the implemented
multiplication formula influences the success of horizontal attacks
significantly, but we also learned that its impact differs from technology to
technology. Our analysis also reveals that the use of different multiplication
formulae as the single countermeasure is not sufficient to protect
cryptographic designs against horizontal DPA attacks.
","[{'version': 'v1', 'created': 'Sat, 8 Jan 2022 17:39:35 GMT'}]",2022-01-11,"[['Kabin', 'Ievgen', ''], ['Dyka', 'Zoya', ''], ['Klann', 'Dan', ''], ['Langendoerfer', 'Peter', '']]","['field multiplication', 'power traces', 'countermeasure against side channel analysis (SCA) attacks']"
11011,2107.00422,Stefan Becker,"Stefan Becker and Ronny Hug and Wolfgang H\""ubner and Michael Arens
  and Brendan T. Morris","Generating Synthetic Training Data for Deep Learning-Based UAV
  Trajectory Prediction","Accepted at the International Conference on Robotics, Computer Vision
  and Intelligent Systems (ROBOVIS) 2021",,10.5220/0010621400003061,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning-based models, such as recurrent neural networks (RNNs), have
been applied to various sequence learning tasks with great success. Following
this, these models are increasingly replacing classic approaches in object
tracking applications for motion prediction. On the one hand, these models can
capture complex object dynamics with less modeling required, but on the other
hand, they depend on a large amount of training data for parameter tuning.
Towards this end, we present an approach for generating synthetic trajectory
data of unmanned-aerial-vehicles (UAVs) in image space. Since UAVs, or rather
quadrotors are dynamical systems, they can not follow arbitrary trajectories.
With the prerequisite that UAV trajectories fulfill a smoothness criterion
corresponding to a minimal change of higher-order motion, methods for planning
aggressive quadrotors flights can be utilized to generate optimal trajectories
through a sequence of 3D waypoints. By projecting these maneuver trajectories,
which are suitable for controlling quadrotors, to image space, a versatile
trajectory data set is realized. To demonstrate the applicability of the
synthetic trajectory data, we show that an RNN-based prediction model solely
trained on the generated data can outperform classic reference models on a
real-world UAV tracking dataset. The evaluation is done on the publicly
available ANTI-UAV dataset.
","[{'version': 'v1', 'created': 'Thu, 1 Jul 2021 13:08:31 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Nov 2021 08:52:25 GMT'}]",2021-11-02,"[['Becker', 'Stefan', ''], ['Hug', 'Ronny', ''], ['Hübner', 'Wolfgang', ''], ['Arens', 'Michael', ''], ['Morris', 'Brendan T.', '']]","['Unmanned-Aerial-Vehicle (UAV)', 'Synthetic Data Generation', 'Trajectory Prediction', 'Deep-Learning', 'Recurrent Neural Networks (RNNs)', 'Training Data', 'Quadrotors']"
11012,1908.04511,Ruslan Nikolaev,Ruslan Nikolaev,"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue",,33rd International Symposium on Distributed Computing (DISC 2019),10.4230/LIPIcs.DISC.2019.28,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new lock-free multiple-producer and multiple-consumer (MPMC)
FIFO queue design which is scalable and, unlike existing high-performant
queues, very memory efficient. Moreover, the design is ABA safe and does not
require any external memory allocators or safe memory reclamation techniques,
typically needed by other scalable designs. In fact, this queue itself can be
leveraged for object allocation and reclamation, as in data pools. We use FAA
(fetch-and-add), a specialized and more scalable than CAS (compare-and-set)
instruction, on the most contended hot spots of the algorithm. However, unlike
prior attempts with FAA, our queue is both lock-free and linearizable.
  We propose a general approach, SCQ, for bounded queues. This approach can
easily be extended to support unbounded FIFO queues which can store an
arbitrary number of elements. SCQ is portable across virtually all existing
architectures and flexible enough for a wide variety of uses. We measure the
performance of our algorithm on the x86-64 and PowerPC architectures. Our
evaluation validates that our queue has exceptional memory efficiency compared
to other algorithms and its performance is often comparable to, or exceeding
that of state-of-the-art scalable algorithms.
","[{'version': 'v1', 'created': 'Tue, 13 Aug 2019 06:34:10 GMT'}]",2019-08-14,"[['Nikolaev', 'Ruslan', '']]","['FIFO', 'queue', 'ring bufer', 'lock-free', 'non-blocking']"
11013,1807.10543,Neslihan Suzen,"Neslihan Suzen, Alexander Gorban, Jeremy Levesley and Evgeny Mirkes",Automatic Short Answer Grading and Feedback Using Text Mining Methods,27 pages; added questions for section 6; correction of typos,"Procedia Computer Science 169 (2020), 726-743",10.1016/j.procs.2020.02.171,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Automatic grading is not a new approach but the need to adapt the latest
technology to automatic grading has become very important. As the technology
has rapidly became more powerful on scoring exams and essays, especially from
the 1990s onwards, partially or wholly automated grading systems using
computational methods have evolved and have become a major area of research. In
particular, the demand of scoring of natural language responses has created a
need for tools that can be applied to automatically grade these responses. In
this paper, we focus on the concept of automatic grading of short answer
questions such as are typical in the UK GCSE system, and providing useful
feedback on their answers to students. We present experimental results on a
dataset provided from the introductory computer science class in the University
of North Texas. We first apply standard data mining techniques to the corpus of
student answers for the purpose of measuring similarity between the student
answers and the model answer. This is based on the number of common words. We
then evaluate the relation between these similarities and marks awarded by
scorers. We then consider an approach that groups student answers into
clusters. Each cluster would be awarded the same mark, and the same feedback
given to each answer in a cluster. In this manner, we demonstrate that clusters
indicate the groups of students who are awarded the same or the similar scores.
Words in each cluster are compared to show that clusters are constructed based
on how many and which words of the model answer have been used. The main
novelty in this paper is that we design a model to predict marks based on the
similarities between the student answers and the model answer.
","[{'version': 'v1', 'created': 'Fri, 27 Jul 2018 12:00:21 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Jun 2019 17:21:46 GMT'}, {'version': 'v3', 'created': 'Thu, 19 Dec 2019 20:48:35 GMT'}]",2020-04-20,"[['Suzen', 'Neslihan', ''], ['Gorban', 'Alexander', ''], ['Levesley', 'Jeremy', ''], ['Mirkes', 'Evgeny', '']]","['automatic grading', 'machine learning', 'text mining', 'similarity measures', 'clustering', 'k-means']"
11014,2206.05533,Harsh Vardhan,"Harsh Vardhan, Janos Sztipanovits",Rare event failure test case generation in Learning-Enabled-Controllers,,2021 6th International Conference on Machine Learning Technologies,10.1145/3468891.3468897,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Machine learning models have prevalent applications in many real-world
problems, which increases the importance of correctness in the behaviour of
these trained models. Finding a good test case that can reveal the potential
failure in these trained systems can help to retrain these models to increase
their correctness. For a well-trained model, the occurrence of a failure is
rare. Consequently, searching these rare scenarios by evaluating each sample in
input search space or randomized search would be costly and sometimes
intractable due to large search space, limited computational resources, and
available time. In this paper, we tried to address this challenge of finding
these failure scenarios faster than traditional randomized search. The central
idea of our approach is to separate the input data space in region of high
failure probability and region of low/minimal failure probability based on the
observation made by training data, data drawn from real-world statistics, and
knowledge from a domain expert. Using these information, we can design a
generative model from which we can generate scenarios that have a high
likelihood to reveal the potential failure. We evaluated this approach on two
different experimental scenarios and able to speed up the discovery of such
failures a thousand-fold faster than the traditional randomized search.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2022 13:50:59 GMT'}]",2022-06-14,"[['Vardhan', 'Harsh', ''], ['Sztipanovits', 'Janos', '']]","['Machine learning', 'failure test scenarios', 'reinforcementlearning', 'generative model', 'rare event failure']"
11015,2211.09025,Jennifer Andreoli-Fang,"Jennifer Andreoli-Fang, John T Chapman",Latency Reduction for Mobile Backhaul by Pipelining LTE and DOCSIS,"IEEE Global Communications Conference (GLOBECOM), 2017. arXiv admin
  note: substantial text overlap with arXiv:2211.08292; text overlap with
  arXiv:2211.08298",,10.1109/GLOCOM.2017.8254974,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The small cell market has been growing. To backhaul wireless traffic from
small cells, the mobile network operators (MNOs) are looking into economically
viable solutions, specifically the hybrid fiber coaxial networks (HFC), in
addition to the traditional choice of fiber. When the latencies from both the
wireless and the HFC networks are added together, it can result in noticeable
end-to-end system latency, particularly under network congestion. If the two
networks could somehow coordinate with each other, it would be possible to
decrease the total system latency and increase system performance. In this
paper, we propose a method to improve upstream user-to-mobile core latency by
coordinating the LTE and HFC scheduling. The method reduces the impact on
system latency from the HFC network's request-grant-data loop, which is the
main contributor of backhaul upstream latency. Through simulation, we show that
coordinated scheduling improves overall system latency.
","[{'version': 'v1', 'created': 'Wed, 16 Nov 2022 16:32:38 GMT'}]",2022-11-17,"[['Andreoli-Fang', 'Jennifer', ''], ['Chapman', 'John T', '']]","['backhaul', 'small cell', 'hybrid fiber coaxial', 'DOCSIS', 'latency', 'access network architecture', 'scheduler', 'pipelining']"
11016,1904.09959,Greg Anderson,"Greg Anderson, Shankara Pailoor, Isil Dillig, Swarat Chaudhuri","Optimization and Abstraction: A Synergistic Approach for Analyzing
  Neural Network Robustness",,,10.1145/3314221.3314614,,cs.PL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, the notion of local robustness (or robustness for short) has
emerged as a desirable property of deep neural networks. Intuitively,
robustness means that small perturbations to an input do not cause the network
to perform misclassifications. In this paper, we present a novel algorithm for
verifying robustness properties of neural networks. Our method synergistically
combines gradient-based optimization methods for counterexample search with
abstraction-based proof search to obtain a sound and ({\delta}-)complete
decision procedure. Our method also employs a data-driven approach to learn a
verification policy that guides abstract interpretation during proof search. We
have implemented the proposed approach in a tool called Charon and
experimentally evaluated it on hundreds of benchmarks. Our experiments show
that the proposed approach significantly outperforms three state-of-the-art
tools, namely AI^2 , Reluplex, and Reluval.
","[{'version': 'v1', 'created': 'Mon, 22 Apr 2019 17:21:52 GMT'}, {'version': 'v2', 'created': 'Wed, 1 May 2019 15:25:46 GMT'}]",2019-05-02,"[['Anderson', 'Greg', ''], ['Pailoor', 'Shankara', ''], ['Dillig', 'Isil', ''], ['Chaudhuri', 'Swarat', '']]","['Machine learning', 'Abstract Interpretation', 'Optimization', 'Robustness']"
11017,2002.07775,Jeena Kleenankandy,"Jeena Kleenankandy, K. A. Abdul Nazeer (Department of Computer Science
  and Engineering, National Institute of Technology Calicut, Kerala, India)","An enhanced Tree-LSTM architecture for sentence semantic modeling using
  typed dependencies","Accepted manuscript submitted to Journal of Information Processing
  and Management ( Elsevier ) on June 11, 2020","Information Processing & Management, Elsevier (2020)",10.1016/j.ipm.2020.102362,,cs.CL cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tree-based Long short term memory (LSTM) network has become state-of-the-art
for modeling the meaning of language texts as they can effectively exploit the
grammatical syntax and thereby non-linear dependencies among words of the
sentence. However, most of these models cannot recognize the difference in
meaning caused by a change in semantic roles of words or phrases because they
do not acknowledge the type of grammatical relations, also known as typed
dependencies, in sentence structure. This paper proposes an enhanced LSTM
architecture, called relation gated LSTM, which can model the relationship
between two inputs of a sequence using a control input. We also introduce a
Tree-LSTM model called Typed Dependency Tree-LSTM that uses the sentence
dependency parse structure as well as the dependency type to embed sentence
meaning into a dense vector. The proposed model outperformed its type-unaware
counterpart in two typical NLP tasks - Semantic Relatedness Scoring and
Sentiment Analysis, in a lesser number of training epochs. The results were
comparable or competitive with other state-of-the-art models. Qualitative
analysis showed that changes in the voice of sentences had little effect on the
model's predicted scores, while changes in nominal (noun) words had a more
significant impact. The model recognized subtle semantic relationships in
sentence pairs. The magnitudes of learned typed dependencies embeddings were
also in agreement with human intuitions. The research findings imply the
significance of grammatical relations in sentence modeling. The proposed models
would serve as a base for future researches in this direction.
","[{'version': 'v1', 'created': 'Tue, 18 Feb 2020 18:10:03 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Sep 2020 09:45:26 GMT'}]",2020-09-28,"[['Kleenankandy', 'Jeena', '', 'Department of Computer Science\n  and Engineering, National Institute of Technology Calicut, Kerala, India'], ['Nazeer', 'K. A. Abdul', '', 'Department of Computer Science\n  and Engineering, National Institute of Technology Calicut, Kerala, India']]","['Sentence Representation Learning', 'Universal Dependencies', 'SemanticRelatedness Scoring', 'Sentiment Analysis']"
11018,2202.13260,Mariam Guizani,"Mariam Guizani, Bianca Trinkenreich, Aileen Abril Castro-Guzman, Igor
  Steinmacher, Marco Gerosa, Anita Sarma",Perceptions of the State of D&I and D&I Initiative in the ASF,"13 pages, Accepted at ICSE SEIS 2022",,10.1145/3510458.3513008,,cs.SE cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Open Source Software (OSS) Foundations and projects are investing in creating
Diversity and Inclusion (D&I) initiatives. However, little is known about
contributors' perceptions about the usefulness and success of such initiatives.
We aim to close this gap by investigating how contributors perceive the state
of D&I in their community. In collaboration with the Apache Software Foundation
(ASF), we surveyed 600+ OSS contributors and conducted 11 follow-up interviews.
We used mixed methods to analyze our data-quantitative analysis of Likert-scale
questions and qualitative analysis of open-ended survey question and the
interviews to understand contributors' perceptions and critiques of the D&I
initiative and how to improve it. Our results indicate that the ASF
contributors felt that the state of D&I was still lacking, especially regarding
gender, seniority, and English proficiency. Regarding the D&I initiative, some
participants felt that the effort was unnecessary, while others agreed with the
effort but critiqued its implementation. These findings show that D&I
initiatives in OSS communities are a good start, but there is room for
improvements. Our results can inspire the creation of new and the refinement of
current initiatives.
","[{'version': 'v1', 'created': 'Sun, 27 Feb 2022 01:16:29 GMT'}]",2022-03-01,"[['Guizani', 'Mariam', ''], ['Trinkenreich', 'Bianca', ''], ['Castro-Guzman', 'Aileen Abril', ''], ['Steinmacher', 'Igor', ''], ['Gerosa', 'Marco', ''], ['Sarma', 'Anita', '']]","['Diversity', 'D&I initiative', 'Open Source Software']"
11019,2109.09476,Junya Morita,"Junya Morita, Thanakit Pitakchokchai, Giri Basanta Raj, Yusuke
  Yamamoto, Hiroyasu Yuhashi and Teppei Koguchi","Regulating Ruminative Web-browsing Based on the Counterbalance Modeling
  Approach",,"Frontiers in Artificial Intelligence, 2022",10.3389/frai.2022.741610,,cs.HC cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Even though the web environment facilitates daily life, emotional problems
caused by its incompatibility with human cognition are becoming increasingly
serious. To alleviate negative emotions during web use, we developed a browser
extension that presents memorized product images to users, in the form of web
advertisements. This system utilizes the cognitive architecture Adaptive
Control of Thought-Rational (ACT-R) as a model of memory and emotion. A heart
rate sensor modulates the ACT-R model parameters: The emotional states of the
model are synchronized or counterbalanced with the physiological state of the
user. An experiment demonstrates that the counterbalance model suppresses
negative ruminative web browsing. The authors claim that this approach is
advantageous in terms of explainability.
","[{'version': 'v1', 'created': 'Mon, 20 Sep 2021 12:31:03 GMT'}]",2022-08-16,"[['Morita', 'Junya', ''], ['Pitakchokchai', 'Thanakit', ''], ['Raj', 'Giri Basanta', ''], ['Yamamoto', 'Yusuke', ''], ['Yuhashi', 'Hiroyasu', ''], ['Koguchi', 'Teppei', '']]","['Web browsing', 'cognitive modeling', 'ACT-R', 'heart rate', 'ruminative thinking']"
11020,1801.05958,Vivek Shandilya,"Vivek Shandilya, Sajjan Shiva",On a Generic Security Game Model,31 pages,"Shandilya, V. and Shiva, S. (2017) On a Generic Security Game
  Model. Int. J. Communications , Network and System Sciences , 10, 142-172",10.4236/ijcns.2017.107008,,cs.CR cs.GT,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  To protect the systems exposed to the Internet against attacks, a security
system with the capability to engage with the attacker is needed. There have
been attempts to model the engagement/interactions between users, both benign
and malicious, and network administrators as games. Building on such works, we
present a game model which is generic enough to capture various modes of such
interactions. The model facilitates stochastic games with imperfect
information. The information is imperfect due to erroneous sensors leading to
incorrect perception of the current state by the players. To model this error
in perception distributed over other multiple states, we use Euclidean
distances between the outputs of the sensors. We build a 5-state game to
represent the interaction of the administrator with the user. The states
correspond to 1) the user being out of the system in the Internet, and after
logging in to the system; 2) having low privileges; 3) having high privileges;
4) when he successfully attacks and 5) gets trapped in a honeypot by the
administrator. Each state has its own action set. We present the game with a
distinct perceived action set corresponding to each distinct information set of
these states. The model facilitates stochastic games with imperfect
information. The imperfect information is due to erroneous sensors leading to
incorrect perception of the current state by the players. To model this error
in perception distributed over the states, we use Euclidean distances between
outputs of the sensors. A numerical simulation of an example game is presented
to show the evaluation of rewards to the players and the preferred strategies.
We also present the conditions for formulating the strategies when dealing with
more than one attacker and making collaborations.
","[{'version': 'v1', 'created': 'Thu, 18 Jan 2018 07:38:13 GMT'}]",2018-01-19,"[['Shandilya', 'Vivek', ''], ['Shiva', 'Sajjan', '']]","['Security System Architecture', 'Stochastic Game', 'General Sum Game', 'Imperfect Information', 'Numerical Simulation']"
11021,1606.03073,"Ya\u{g}mur G\""u\c{c}l\""ut\""urk","Ya\u{g}mur G\""u\c{c}l\""ut\""urk, Umut G\""u\c{c}l\""u, Rob van Lier,
  Marcel A. J. van Gerven",Convolutional Sketch Inversion,,,10.1007/978-3-319-46604-0_56,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we use deep neural networks for inverting face sketches to
synthesize photorealistic face images. We first construct a semi-simulated
dataset containing a very large number of computer-generated face sketches with
different styles and corresponding face images by expanding existing
unconstrained face data sets. We then train models achieving state-of-the-art
results on both computer-generated sketches and hand-drawn sketches by
leveraging recent advances in deep learning such as batch normalization, deep
residual learning, perceptual losses and stochastic optimization in combination
with our new dataset. We finally demonstrate potential applications of our
models in fine arts and forensic arts. In contrast to existing patch-based
approaches, our deep-neural-network-based approach can be used for synthesizing
photorealistic face images by inverting face sketches in the wild.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2016 19:27:41 GMT'}]",2016-10-25,"[['Güçlütürk', 'Yağmur', ''], ['Güçlü', 'Umut', ''], ['van Lier', 'Rob', ''], ['van Gerven', 'Marcel A. J.', '']]","['deep neural network', 'face synthesis', 'face recognition', 'finearts', 'forensic arts', 'sketch inversion', 'sketch recognition']"
11022,2011.12984,Cody Balos,"Cody J. Balos and David J. Gardner and Carol S. Woodward and Daniel R.
  Reynolds","Enabling GPU Accelerated Computing in the SUNDIALS Time Integration
  Library",,"Parallel Computing, Volume 108, 2021, 102836, ISSN 0167-8191",10.1016/j.parco.2021.102836,,cs.DC cs.MS,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  As part of the Exascale Computing Project (ECP), a recent focus of
development efforts for the SUite of Nonlinear and DIfferential/ALgebraic
equation Solvers (SUNDIALS) has been to enable GPU-accelerated time integration
in scientific applications at extreme scales. This effort has resulted in
several new GPU-enabled implementations of core SUNDIALS data structures,
support for programming paradigms which are aware of the heterogeneous
architectures, and the introduction of utilities to provide new points of
flexibility. In this paper, we discuss our considerations, both internal and
external, when designing these new features and present the features
themselves. We also present performance results for several of the features on
the Summit supercomputer and early access hardware for the Frontier
supercomputer, which demonstrate negligible performance overhead resulting from
the additional infrastructure and significant speedups when using both NVIDIA
and AMD GPUs.
","[{'version': 'v1', 'created': 'Wed, 25 Nov 2020 19:09:12 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Dec 2021 19:34:40 GMT'}]",2023-01-04,"[['Balos', 'Cody J.', ''], ['Gardner', 'David J.', ''], ['Woodward', 'Carol S.', ''], ['Reynolds', 'Daniel R.', '']]","['Exascale Computing', 'GPU Accelerators', 'Time Integration', 'Numerical Software']"
11023,2101.08046,Jack Ratcliffe,"Jack Ratcliffe, Francesco Soave, Nick Bryan-Kinns, Laurissa Tokarchuk,
  Ildar Farkhatdinov","Extended Reality (XR) Remote Research: a Survey of Drawbacks and
  Opportunities",,,10.1145/3411764.3445170,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Extended Reality (XR) technology - such as virtual and augmented reality - is
now widely used in Human Computer Interaction (HCI), social science and
psychology experimentation. However, these experiments are predominantly
deployed in-lab with a co-present researcher. Remote experiments, without
co-present researchers, have not flourished, despite the success of remote
approaches for non-XR investigations. This paper summarises findings from a
30-item survey of 46 XR researchers to understand perceived limitations and
benefits of remote XR experimentation. Our thematic analysis identifies
concerns common with non-XR remote research, such as participant recruitment,
as well as XR-specific issues, including safety and hardware variability. We
identify potential positive affordances of XR technology, including leveraging
data collection functionalities builtin to HMDs (e.g. hand, gaze tracking) and
the portability and reproducibility of an experimental setting. We suggest that
XR technology could be conceptualised as an interactive technology and a
capable data-collection device suited for remote experimentation.
","[{'version': 'v1', 'created': 'Wed, 20 Jan 2021 10:02:29 GMT'}]",2021-01-21,"[['Ratcliffe', 'Jack', ''], ['Soave', 'Francesco', ''], ['Bryan-Kinns', 'Nick', ''], ['Tokarchuk', 'Laurissa', ''], ['Farkhatdinov', 'Ildar', '']]","['Extended Reality', 'Virtual Reality', 'Augmented Reality', 'literaturereview', 'expert interviews']"
11024,1904.06009,Aloni Cohen,"Aloni Cohen, Kobbi Nissim",Towards Formalizing the GDPR's Notion of Singling Out,,"Proceedings of the National Academy of Sciences 117(15), 2020",10.1073/pnas.1914598117,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a significant conceptual gap between legal and mathematical thinking
around data privacy. The effect is uncertainty as to which technical offerings
adequately match expectations expressed in legal standards. The uncertainty is
exacerbated by a litany of successful privacy attacks, demonstrating that
traditional statistical disclosure limitation techniques often fall short of
the sort of privacy envisioned by legal standards.
  We define predicate singling out, a new type of privacy attack intended to
capture the concept of singling out appearing in the General Data Protection
Regulation (GDPR). Informally, an adversary predicate singles out a dataset $X$
using the output of a data release mechanism $M(X)$ if it manages to find a
predicate $p$ matching exactly one row $x \in X$ with probability much better
than a statistical baseline. A data release mechanism that precludes such
attacks is secure against predicate singling out (PSO secure).
  We argue that PSO security is a mathematical concept with legal consequences.
Any data release mechanism that purports to ""render anonymous"" personal data
under the GDPR must be secure against singling out, and hence must be PSO
secure. We then analyze PSO security, showing that it fails to self-compose.
Namely, a combination of $\omega(\log n)$ exact counts, each individually PSO
secure, enables an attacker to predicate single out. In fact, the composition
of just two PSO-secure mechanisms can fail to provide PSO security.
  Finally, we ask whether differential privacy and $k$-anonymity are PSO
secure. Leveraging a connection to statistical generalization, we show that
differential privacy implies PSO security. However, $k$-anonymity does not:
there exists a simple and general predicate singling out attack under mild
assumptions on the $k$-anonymizer and the data distribution.
","[{'version': 'v1', 'created': 'Fri, 12 Apr 2019 02:29:37 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Dec 2020 20:13:43 GMT'}]",2020-12-21,"[['Cohen', 'Aloni', ''], ['Nissim', 'Kobbi', '']]","['GDPR', 'singling out', 'differential privacy', 'k-anonymity']"
11025,1710.01751,Jie Luo,"Yanru Tang, Faeze Heydaryan, and Jie Luo",Distributed Multiple Access with A General Link Layer Channel,"Ad Hoc Networks, Vol. 85, pp. 120-130, 2019",,10.1016/j.adhoc.2018.10.013,,cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates the problem of distributed medium access control in a
time slotted wireless multiple access network with an unknown finite number of
homogeneous users. Assume that each user has a single transmission option. In
each time slot, a user chooses either to idle or to transmit a packet. Under a
general channel model, a distributed medium access control framework is
proposed to adapt transmission probabilities of all users to a value that
maximizes an arbitrarily chosen symmetric network utility. Probability target
of each user in the proposed algorithm is calculated based upon a channel
contention measure, which is defined as the success probability of a virtual
packet. It is shown that the proposed algorithm falls into the classical
stochastic approximation framework with guaranteed convergence when the
contention measure can be directly obtained from the receiver. On the other
hand, when the contention measure is not directly available, computer
simulations show that a revised medium access control algorithm can still help
the system to converge to the same designed equilibrium.
","[{'version': 'v1', 'created': 'Wed, 4 Oct 2017 18:13:46 GMT'}, {'version': 'v2', 'created': 'Mon, 7 May 2018 14:58:38 GMT'}, {'version': 'v3', 'created': 'Tue, 27 Nov 2018 04:10:46 GMT'}]",2018-11-28,"[['Tang', 'Yanru', ''], ['Heydaryan', 'Faeze', ''], ['Luo', 'Jie', '']]","['wireless networking', 'medium access control', 'distributed systems']"
11026,1702.06028,Andrea Cerone,"Andrea Cerone, Alexey Gotsman, Hongseok Yang",Algebraic Laws for Weak Consistency (Extended Version),Extended Version of the CONCUR'17 paper,,10.4230/LIPIcs.CONCUR.2017.22,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern distributed systems often rely on so called weakly-consistent
databases, which achieve scalability by sacrificing the consistency guarantee
of distributed transaction processing. Such databases have been formalised in
two different styles, one based on abstract executions and the other based on
dependency graphs. The choice between these styles has been made according to
intended applications: the former has been used to specify and verify the
implementation of these databases, and the latter to prove properties of
programs running on top of the databases. In this paper, we present a set of
novel algebraic laws (i.e. inequations) that connect these two styles of
specifications; the laws relate binary relations used in a specification based
on abstract executions, to those used in a specification based on dependency
graphs. We then show that this algebraic connection gives rise to so called
robustness criteria, conditions which ensures that a program running on top of
a weakly-consistent database does not exhibit anomalous behaviours due to this
weak consistency. These criteria make it easy to reason about programs running
on top of these databases, and may become a basis for dynamic or static program
analyses. For a certain class of consistency models specifications, we prove a
full abstraction result that connects the two styles of specifications.
","[{'version': 'v1', 'created': 'Mon, 20 Feb 2017 15:55:20 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Apr 2017 00:11:58 GMT'}, {'version': 'v3', 'created': 'Thu, 4 May 2017 18:36:07 GMT'}, {'version': 'v4', 'created': 'Tue, 1 Aug 2017 15:47:01 GMT'}]",2017-08-02,"[['Cerone', 'Andrea', ''], ['Gotsman', 'Alexey', ''], ['Yang', 'Hongseok', '']]","['Weak Consistency Models', 'Distributed Databases', 'Dependency Graphs']"
11027,2007.07287,Salvador Barbosa,Salvador E. Barbosa,Using Holographically Compressed Embeddings in Question Answering,"12 pages, 6 figures, 1 table, 9th International Conference on
  Advanced Information Technologies and Applications (ICAITA 2020), July 11~12,
  2020, Toronto, Canada, Advanced Natural Language Processing Sub-Conference
  (AdNLP 2020)",,10.5121/csit.2020.100919,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Word vector representations are central to deep learning natural language
processing models. Many forms of these vectors, known as embeddings, exist,
including word2vec and GloVe. Embeddings are trained on large corpora and learn
the word's usage in context, capturing the semantic relationship between words.
However, the semantics from such training are at the level of distinct words
(known as word types), and can be ambiguous when, for example, a word type can
be either a noun or a verb. In question answering, parts-of-speech and named
entity types are important, but encoding these attributes in neural models
expands the size of the input. This research employs holographic compression of
pre-trained embeddings, to represent a token, its part-of-speech, and named
entity type, in the same dimension as representing only the token. The
implementation, in a modified question answering recurrent deep learning
network, shows that semantic relationships are preserved, and yields strong
performance.
","[{'version': 'v1', 'created': 'Tue, 14 Jul 2020 18:29:49 GMT'}]",2020-07-16,"[['Barbosa', 'Salvador E.', '']]","['Question Answering', 'Vector Embeddings', 'Holographic Reduced Representations', 'DrQA', 'SQuAD']"
11028,2103.13209,Samuel Olatunji,"Samuel Olatunji, Tal Oron-Gilad, Vardit Sarne-Fleischmann, Yael Edan","User-centered Feedback Design in Person-following Robots for Older
  Adults",,"Paladyn, Journal of Behavioral Robotics, 11(1), 86-103, 2020",10.1515/pjbr-2020-0007,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Feedback design is an important aspect of person-following robots for older
adults. This paper presents a user-centred design approach to ensure the design
is focused on the needs and preferences of the users. A sequence of user
studies with a total of 35 older adults (aged 62 years and older) was conducted
to explore their preferences regarding feedback parameters for a socially
assistive person-following robot. The preferred level of robot transparency and
the desired content for the feedback was first explored. This was followed by
an assessment of the preferred mode and timing of feedback. The chosen feedback
parameters were then implemented and evaluated in a final experiment to
evaluate the effectiveness of the design. Results revealed that older adults
preferred to receive only basic status information. They preferred voice
feedback overtone, and at a continuous rate to keep them constantly aware of
the state and actions of the robot. The outcome of the study is a further step
towards feedback design guidelines that could improve interaction quality for
person-following robots for older adults.
","[{'version': 'v1', 'created': 'Wed, 24 Mar 2021 14:09:43 GMT'}]",2021-03-25,"[['Olatunji', 'Samuel', ''], ['Oron-Gilad', 'Tal', ''], ['Sarne-Fleischmann', 'Vardit', ''], ['Edan', 'Yael', '']]","['Feedback design', 'person-following', 'socially']"
11029,2202.05959,Koundinya Vajjha,"Koundinya Vajjha, Barry Trager, Avraham Shinnar, Vasily Pestun",Formalization of a Stochastic Approximation Theorem,17 pages,,10.4230/LIPIcs.ITP.2022.31,,cs.LO cs.LG cs.PL math.PR,http://creativecommons.org/licenses/by/4.0/,"  Stochastic approximation algorithms are iterative procedures which are used
to approximate a target value in an environment where the target is unknown and
direct observations are corrupted by noise. These algorithms are useful, for
instance, for root-finding and function minimization when the target function
or model is not directly known. Originally introduced in a 1951 paper by
Robbins and Monro, the field of Stochastic approximation has grown enormously
and has come to influence application domains from adaptive signal processing
to artificial intelligence. As an example, the Stochastic Gradient Descent
algorithm which is ubiquitous in various subdomains of Machine Learning is
based on stochastic approximation theory. In this paper, we give a formal proof
(in the Coq proof assistant) of a general convergence theorem due to Aryeh
Dvoretzky, which implies the convergence of important classical methods such as
the Robbins-Monro and the Kiefer-Wolfowitz algorithms. In the process, we build
a comprehensive Coq library of measure-theoretic probability theory and
stochastic processes.
","[{'version': 'v1', 'created': 'Sat, 12 Feb 2022 02:31:14 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Aug 2022 21:09:24 GMT'}]",2022-08-10,"[['Vajjha', 'Koundinya', ''], ['Trager', 'Barry', ''], ['Shinnar', 'Avraham', ''], ['Pestun', 'Vasily', '']]","['Formal Verification', 'Stochastic Approximation', 'Stochastic Processes', 'Probability Theory', 'Optimization Algorithms']"
11030,2001.02609,Stephen Chou,"Stephen Chou, Fredrik Kjolstad, Saman Amarasinghe","Automatic Generation of Efficient Sparse Tensor Format Conversion
  Routines",Presented at PLDI 2020,,10.1145/3385412.3385963,,cs.MS cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper shows how to generate code that efficiently converts sparse
tensors between disparate storage formats (data layouts) such as CSR, DIA, ELL,
and many others. We decompose sparse tensor conversion into three logical
phases: coordinate remapping, analysis, and assembly. We then develop a
language that precisely describes how different formats group together and
order a tensor's nonzeros in memory. This lets a compiler emit code that
performs complex remappings of nonzeros when converting between formats. We
also develop a query language that can extract statistics about sparse tensors,
and we show how to emit efficient analysis code that computes such queries.
Finally, we define an abstract interface that captures how data structures for
storing a tensor can be efficiently assembled given specific statistics about
the tensor. Disparate formats can implement this common interface, thus letting
a compiler emit optimized sparse tensor conversion code for arbitrary
combinations of many formats without hard-coding for any specific combination.
  Our evaluation shows that the technique generates sparse tensor conversion
routines with performance between 1.00 and 2.01$\times$ that of hand-optimized
versions in SPARSKIT and Intel MKL, two popular sparse linear algebra
libraries. And by emitting code that avoids materializing temporaries, which
both libraries need for many combinations of source and target formats, our
technique outperforms those libraries by 1.78 to 4.01$\times$ for CSC/COO to
DIA/ELL conversion.
","[{'version': 'v1', 'created': 'Wed, 8 Jan 2020 16:43:35 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Apr 2020 22:51:30 GMT'}, {'version': 'v3', 'created': 'Tue, 30 Jun 2020 02:09:40 GMT'}]",2020-07-01,"[['Chou', 'Stephen', ''], ['Kjolstad', 'Fredrik', ''], ['Amarasinghe', 'Saman', '']]","['sparse tensor conversion', 'sparse tensor assembly', 'sparse tensor algebra', 'sparse tensor formats', 'coordinateremapping notation', 'attribute query language']"
11031,1910.10334,Zhilei Liu,"Zhilei Liu, Jiahui Dong, Cuicui Zhang, Longbiao Wang, Jianwu Dang","Relation Modeling with Graph Convolutional Networks for Facial Action
  Unit Detection",Accepted by MMM2020,,10.1007/978-3-030-37734-2_40,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most existing AU detection works considering AU relationships are relying on
probabilistic graphical models with manually extracted features. This paper
proposes an end-to-end deep learning framework for facial AU detection with
graph convolutional network (GCN) for AU relation modeling, which has not been
explored before. In particular, AU related regions are extracted firstly,
latent representations full of AU information are learned through an
auto-encoder. Moreover, each latent representation vector is feed into GCN as a
node, the connection mode of GCN is determined based on the relationships of
AUs. Finally, the assembled features updated through GCN are concatenated for
AU detection. Extensive experiments on BP4D and DISFA benchmarks demonstrate
that our framework significantly outperforms the state-of-the-art methods for
facial AU detection. The proposed framework is also validated through a series
of ablation studies.
","[{'version': 'v1', 'created': 'Wed, 23 Oct 2019 03:57:52 GMT'}]",2020-01-03,"[['Liu', 'Zhilei', ''], ['Dong', 'Jiahui', ''], ['Zhang', 'Cuicui', ''], ['Wang', 'Longbiao', ''], ['Dang', 'Jianwu', '']]","['AU detection', 'Graph Convolutional Network', 'Multi-labelprediction']"
11032,1906.09463,Lucas Gren,"Emanuel Mellblom, Isar Arason, Lucas Gren and Richard Torkar","The Connection Between Burnout and Personality Types in Software
  Developers",,"IEEE Software, 36(5), 2019",10.1109/MS.2019.2924769,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper examines the connection between the Five Factor Model personality
traits and burnout in software developers. This study aims to validate
generalizations of findings in other fields. An online survey consisting of a
miniaturized International Personality Item Pool questionnaire for measuring
the Five Factor Model personality traits, and the Shirom-Melamed Burnout
Measure for measuring burnout, were distributed to open source developer
mailing lists, obtaining 47 valid responses. The results from a Bayesian Linear
Regression analysis indicate a strong link between neuroticism and burnout
confirming previous work, while the other Five Factor Model traits were not
adding power to the model. It is important to note that we did not investigate
the quality of work in connection to personality, nor did we take any other
confounding factors into account like, for example, teamwork. Nonetheless,
employers could be aware of, and support, software developers with high
neuroticism.
","[{'version': 'v1', 'created': 'Sat, 22 Jun 2019 15:40:54 GMT'}]",2019-06-25,"[['Mellblom', 'Emanuel', ''], ['Arason', 'Isar', ''], ['Gren', 'Lucas', ''], ['Torkar', 'Richard', '']]","['burnout', 'personality', 'five factor model', 'software developers']"
11033,2108.04659,Himanshu Gupta,"Himanshu Gupta, Tanmay G. Kulkarni, Lov Kumar, Lalita Bhanu Murthy
  Neti and Aneesh Krishna","An Empirical Study on Predictability of Software Code Smell Using Deep
  Learning Models","12 pages, 6 Figures, 3 Tables, Accepted in the 35th International
  Conference on Advanced Information Networking and Applications (AINA-2021)","Lecture Notes in Networks and Systems, vol 226. Springer, Cham. 27
  April 2021, pages 120-132",10.1007/978-3-030-75075-6_10,,cs.SE cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Code Smell, similar to a bad smell, is a surface indication of something
tainted but in terms of software writing practices. This metric is an
indication of a deeper problem lies within the code and is associated with an
issue which is prominent to experienced software developers with acceptable
coding practices. Recent studies have often observed that codes having code
smells are often prone to a higher probability of change in the software
development cycle. In this paper, we developed code smell prediction models
with the help of features extracted from source code to predict eight types of
code smell. Our work also presents the application of data sampling techniques
to handle class imbalance problem and feature selection techniques to find
relevant feature sets. Previous studies had made use of techniques such as
Naive - Bayes and Random forest but had not explored deep learning methods to
predict code smell. A total of 576 distinct Deep Learning models were trained
using the features and datasets mentioned above. The study concluded that the
deep learning models which used data from Synthetic Minority Oversampling
Technique gave better results in terms of accuracy, AUC with the accuracy of
some models improving from 88.47 to 96.84.
","[{'version': 'v1', 'created': 'Sun, 8 Aug 2021 12:36:23 GMT'}]",2021-08-11,"[['Gupta', 'Himanshu', ''], ['Kulkarni', 'Tanmay G.', ''], ['Kumar', 'Lov', ''], ['Neti', 'Lalita Bhanu Murthy', ''], ['Krishna', 'Aneesh', '']]","['Code Smell', 'Data Sampling Techniques', 'Software metrics', 'Feature selection']"
11034,2008.04826,Simon Porcher,Simon Porcher and Thomas Renault,Social Distancing Beliefs and Human Mobility: Evidence from Twitter,,,10.1371/journal.pone.0246949,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  We construct a novel database containing hundreds of thousands geotagged
messages related to the COVID-19 pandemic sent on Twitter. We create a daily
index of social distancing -- at the state level -- to capture social
distancing beliefs by analyzing the number of tweets containing keywords such
as ""stay home"", ""stay safe"", ""wear mask"", ""wash hands"" and ""social distancing"".
We find that an increase in the Twitter index of social distancing on day t-1
is associated with a decrease in mobility on day t. We also find that state
orders, an increase in the number of COVID cases, precipitation and temperature
contribute to reducing human mobility. Republican states are also less likely
to enforce social distancing. Beliefs shared on social networks could both
reveal the behavior of individuals and influence the behavior of others. Our
findings suggest that policy makers can use geotagged Twitter data -- in
conjunction with mobility data -- to better understand individual voluntary
social distancing actions.
","[{'version': 'v1', 'created': 'Mon, 10 Aug 2020 13:17:02 GMT'}]",2021-06-09,"[['Porcher', 'Simon', ''], ['Renault', 'Thomas', '']]","['such as ”stay home”', '”stay safe”', '”wear']"
11035,2210.12246,Liam Walsh,"Liam Walsh, Juergen Dingel, Karim Jahed","A General Architecture for Client-Agnostic Hybrid Model Editors as a
  Service",,,10.1145/3550356.3563131,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we propose a general architecture for designing language
servers for hybrid modeling languages, that is, modeling languages that contain
both textual and graphical representations. The architecture consists of a
textual language server, a graphical language server, and a client that
communicates with the two servers. The servers are implemented using the
Language Server Protocol (LSP) and the Graphical Language Server Protocol
(GLSP) and are based on a shared abstract syntax of the hybrid language. This
means that only static resources need to be common between the graphical and
textual language servers. The servers' separation allows each to be developed
and maintained independently, while also enabling forward-compatibility with
their respective dependencies.
  We describe a prototype implementation of our architecture in the form of a
hybrid editor for the UML-RT language. The evaluation of the architecture via
this prototype gives us useful insight into further generalization of the
architecture and the way it is used. We then sketch a suitable extension of the
architecture to enable support for multiple diagram types and, thus, multiple
graphical views.
","[{'version': 'v1', 'created': 'Fri, 21 Oct 2022 21:01:08 GMT'}]",2022-10-25,"[['Walsh', 'Liam', ''], ['Dingel', 'Juergen', ''], ['Jahed', 'Karim', '']]","['Hybrid', 'LSP', 'UML-RT', 'Graphical Modeling', 'Language Server']"
11036,2209.10151,Radhwan Adnan Student,Radhwan Adnan Dakhil and Ali Retha Hasoon Khayeat,Review On Deep Learning Technique For Underwater Object Detection,"15 pages, with 9 figures,3rd International Conference on Data Science
  and Machine Learning (DSML 2022)","David C. Wyld et al. (Eds): ARIA, SIPR, SOFEA, CSEN, DSML, NLP,
  EDTECH, NCWC - 2022 pp. 49-63, 2022. CS & IT - CSCP 2022",10.5121/csit.2022.121505,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Repair and maintenance of underwater structures as well as marine science
rely heavily on the results of underwater object detection, which is a crucial
part of the image processing workflow. Although many computer vision-based
approaches have been presented, no one has yet developed a system that reliably
and accurately detects and categorizes objects and animals found in the deep
sea. This is largely due to obstacles that scatter and absorb light in an
underwater setting. With the introduction of deep learning, scientists have
been able to address a wide range of issues, including safeguarding the marine
ecosystem, saving lives in an emergency, preventing underwater disasters, and
detecting, spooring, and identifying underwater targets. However, the benefits
and drawbacks of these deep learning systems remain unknown. Therefore, the
purpose of this article is to provide an overview of the dataset that has been
utilized in underwater object detection and to present a discussion of the
advantages and disadvantages of the algorithms employed for this purpose.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2022 07:10:44 GMT'}]",2022-09-22,"[['Dakhil', 'Radhwan Adnan', ''], ['Khayeat', 'Ali Retha Hasoon', '']]","['Underwater Object Detection', 'Deep Learning', 'Convolutional Neural Network (CNN)', 'Underwater Imaging']"
11037,2208.00301,Chen Chen,"Yichen Han, Christopher Bo Han, Chen Chen, Peng Wei Lee, Michael
  Hogarth, Alison A. Moore, Nadir Weibel, Emilia Farcas","Towards Visualization of Time-Series Ecological Momentary Assessment
  (EMA) Data on Standalone Voice-First Virtual Assistants","4 pages, The 24th International ACM SIGACCESS Conference on Computers
  and Accessibility",,10.1145/3517428.3550398,,cs.HC cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Population aging is an increasingly important consideration for health care
in the 21th century, and continuing to have access and interact with digital
health information is a key challenge for aging populations. Voice-based
Intelligent Virtual Assistants (IVAs) are promising to improve the Quality of
Life (QoL) of older adults, and coupled with Ecological Momentary Assessments
(EMA) they can be effective to collect important health information from older
adults, especially when it comes to repeated time-based events. However, this
same EMA data is hard to access for the older adult: although the newest IVAs
are equipped with a display, the effectiveness of visualizing time-series based
EMA data on standalone IVAs has not been explored. To investigate the potential
opportunities for visualizing time-series based EMA data on standalone IVAs, we
designed a prototype system, where older adults are able to query and examine
the time-series EMA data on Amazon Echo Show - a widely used commercially
available standalone screen-based IVA. We conducted a preliminary
semi-structured interview with a geriatrician and an older adult, and
identified three findings that should be carefully considered when designing
such visualizations.
","[{'version': 'v1', 'created': 'Sat, 30 Jul 2022 20:03:15 GMT'}]",2022-08-02,"[['Han', 'Yichen', ''], ['Han', 'Christopher Bo', ''], ['Chen', 'Chen', ''], ['Lee', 'Peng Wei', ''], ['Hogarth', 'Michael', ''], ['Moore', 'Alison A.', ''], ['Weibel', 'Nadir', ''], ['Farcas', 'Emilia', '']]","['Gerontechnology', 'Accessibility', 'Health – Well-being', 'User Experience Design', 'Older Adults', 'Voice User Interfaces', 'EMA']"
11038,1507.05877,Emanuele De Angelis,"Emanuele De Angelis (1), Fabio Fioravanti (1), Alberto Pettorossi (2),
  Maurizio Proietti (3) ((1) DEC, University G. d'Annunzio, Pescara, Italy, (2)
  DICII, Universita' di Roma Tor Vergata, Roma, Italy, (3) CNR-IASI, Roma,
  Italy)","Proving Correctness of Imperative Programs by Linearizing Constrained
  Horn Clauses","To appear in Theory and Practice of Logic Programming (TPLP),
  Proceedings of ICLP 2015",Theory and Practice of Logic Programming 15 (2015) 635-650,10.1017/S1471068415000289,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a method for verifying the correctness of imperative programs
which is based on the automated transformation of their specifications. Given a
program prog, we consider a partial correctness specification of the form
$\{\varphi\}$ prog $\{\psi\}$, where the assertions $\varphi$ and $\psi$ are
predicates defined by a set Spec of possibly recursive Horn clauses with linear
arithmetic (LA) constraints in their premise (also called constrained Horn
clauses). The verification method consists in constructing a set PC of
constrained Horn clauses whose satisfiability implies that $\{\varphi\}$ prog
$\{\psi\}$ is valid. We highlight some limitations of state-of-the-art
constrained Horn clause solving methods, here called LA-solving methods, which
prove the satisfiability of the clauses by looking for linear arithmetic
interpretations of the predicates. In particular, we prove that there exist
some specifications that cannot be proved valid by any of those LA-solving
methods. These specifications require the proof of satisfiability of a set PC
of constrained Horn clauses that contain nonlinear clauses (that is, clauses
with more than one atom in their premise). Then, we present a transformation,
called linearization, that converts PC into a set of linear clauses (that is,
clauses with at most one atom in their premise). We show that several
specifications that could not be proved valid by LA-solving methods, can be
proved valid after linearization. We also present a strategy for performing
linearization in an automatic way and we report on some experimental results
obtained by using a preliminary implementation of our method.
","[{'version': 'v1', 'created': 'Tue, 21 Jul 2015 15:40:25 GMT'}]",2020-02-19,"[['De Angelis', 'Emanuele', ''], ['Fioravanti', 'Fabio', ''], ['Pettorossi', 'Alberto', ''], ['Proietti', 'Maurizio', '']]","['Program verification', 'Partial correctness specifications', 'Horn clauses', 'Constraint Logic Programming', 'Program transformation']"
11039,2105.00682,Leo Cazenille,Leo Cazenille,"Ensemble Feature Extraction for Multi-Container Quality-Diversity
  Algorithms","Draft version. 10 pages, 4 figures, 4 tables, Accepted at the
  GECCO2021 Conference",,10.1145/3449639.3459392,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quality-Diversity algorithms search for large collections of diverse and
high-performing solutions, rather than just for a single solution like typical
optimisation methods. They are specially adapted for multi-modal problems that
can be solved in many different ways, such as complex reinforcement learning or
robotics tasks. However, these approaches are highly dependent on the choice of
feature descriptors (FDs) quantifying the similarity in behaviour of the
solutions. While FDs usually needs to be hand-designed, recent studies have
proposed ways to define them automatically by using feature extraction
techniques, such as PCA or Auto-Encoders, to learn a representation of the
problem from previously explored solutions. Here, we extend these approaches to
more complex problems which cannot be efficiently explored by relying only on a
single representation but require instead a set of diverse and complementary
representations. We describe MC-AURORA, a Quality-Diversity approach that
optimises simultaneously several collections of solutions, each with a
different set of FDs, which are, in turn, defined automatically by an ensemble
of modular auto-encoders. We show that this approach produces solutions that
are more diverse than those produced by single-representation approaches.
","[{'version': 'v1', 'created': 'Mon, 3 May 2021 08:35:00 GMT'}]",2021-05-04,"[['Cazenille', 'Leo', '']]","['Quality-Diversity algorithms', 'AURORA', 'Evolutionary Robotics', 'Ensemble representation learning', 'Auto-encoders', 'Deep Learning']"
11040,2008.13064,Md Rafiqul Islam Rabin,"Md Rafiqul Islam Rabin, Arjun Mukherjee, Omprakash Gnawali, Mohammad
  Amin Alipour",Towards Demystifying Dimensions of Source Code Embeddings,"1st ACM SIGSOFT International Workshop on Representation Learning for
  Software Engineering and Program Languages, Co-located with ESEC/FSE
  (RL+SE&PL'20)",,10.1145/3416506.3423580,,cs.LG cs.PL cs.SE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Source code representations are key in applying machine learning techniques
for processing and analyzing programs. A popular approach in representing
source code is neural source code embeddings that represents programs with
high-dimensional vectors computed by training deep neural networks on a large
volume of programs. Although successful, there is little known about the
contents of these vectors and their characteristics. In this paper, we present
our preliminary results towards better understanding the contents of code2vec
neural source code embeddings. In particular, in a small case study, we use the
code2vec embeddings to create binary SVM classifiers and compare their
performance with the handcrafted features. Our results suggest that the
handcrafted features can perform very close to the highly-dimensional code2vec
embeddings, and the information gains are more evenly distributed in the
code2vec embeddings compared to the handcrafted features. We also find that the
code2vec embeddings are more resilient to the removal of dimensions with low
information gains than the handcrafted features. We hope our results serve a
stepping stone toward principled analysis and evaluation of these code
representations.
","[{'version': 'v1', 'created': 'Sat, 29 Aug 2020 21:59:11 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Sep 2020 03:53:21 GMT'}, {'version': 'v3', 'created': 'Tue, 29 Sep 2020 00:19:28 GMT'}]",2022-06-17,"[['Rabin', 'Md Rafiqul Islam', ''], ['Mukherjee', 'Arjun', ''], ['Gnawali', 'Omprakash', ''], ['Alipour', 'Mohammad Amin', '']]","['Code Representation', 'Code Embeddings', 'Models of Code']"
11041,2103.15624,Gabriel Kronberger,"Gabriel Kronberger and Fabricio Olivetti de Fran\c{c}a and Bogdan
  Burlacu and Christian Haider and Michael Kommenda","Shape-constrained Symbolic Regression -- Improving Extrapolation with
  Prior Knowledge",,,10.1162/evco_a_00294,,cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the addition of constraints on the function image and its
derivatives for the incorporation of prior knowledge in symbolic regression.
The approach is called shape-constrained symbolic regression and allows us to
enforce e.g. monotonicity of the function over selected inputs. The aim is to
find models which conform to expected behaviour and which have improved
extrapolation capabilities. We demonstrate the feasibility of the idea and
propose and compare two evolutionary algorithms for shape-constrained symbolic
regression: i) an extension of tree-based genetic programming which discards
infeasible solutions in the selection step, and ii) a two population
evolutionary algorithm that separates the feasible from the infeasible
solutions. In both algorithms we use interval arithmetic to approximate bounds
for models and their partial derivatives. The algorithms are tested on a set of
19 synthetic and four real-world regression problems. Both algorithms are able
to identify models which conform to shape constraints which is not the case for
the unmodified symbolic regression algorithms. However, the predictive accuracy
of models with constraints is worse on the training set and the test set.
Shape-constrained polynomial regression produces the best results for the test
set but also significantly larger models.
","[{'version': 'v1', 'created': 'Mon, 29 Mar 2021 14:04:18 GMT'}, {'version': 'v2', 'created': 'Mon, 31 May 2021 09:56:48 GMT'}]",2021-06-01,"[['Kronberger', 'Gabriel', ''], ['de França', 'Fabricio Olivetti', ''], ['Burlacu', 'Bogdan', ''], ['Haider', 'Christian', ''], ['Kommenda', 'Michael', '']]","['Symbolic regression', 'Genetic programming', 'Shape-constrained regression']"
11042,2006.02933,Ibon Merino,"Ibon Merino, Jon Azpiazu, Anthony Remazeilles, Basilio Sierra",2D Image Features Detector And Descriptor Selection Expert System,"10 pages, 5 figures, 5 tables","in 8th International Conference on Natural Language Processing
  (NLP 2019), Sep. 2019, pp. 51-61",10.5121/csit.2019.91206,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detection and description of keypoints from an image is a well-studied
problem in Computer Vision. Some methods like SIFT, SURF or ORB are
computationally really efficient. This paper proposes a solution for a
particular case study on object recognition of industrial parts based on
hierarchical classification. Reducing the number of instances leads to better
performance, indeed, that is what the use of the hierarchical classification is
looking for. We demonstrate that this method performs better than using just
one method like ORB, SIFT or FREAK, despite being fairly slower.
","[{'version': 'v1', 'created': 'Thu, 4 Jun 2020 15:18:18 GMT'}]",2020-06-05,"[['Merino', 'Ibon', ''], ['Azpiazu', 'Jon', ''], ['Remazeilles', 'Anthony', ''], ['Sierra', 'Basilio', '']]","['Computer vision', 'Descriptors', 'Feature-based object recognition', 'Expert system']"
11043,2109.01527,Jozef Michal Mintal,"Jozef Michal Mintal, Michal Kalman, Karol Fabi\'an","Hide and seek in Slovakia: utilizing tracking code data to uncover
  untrustworthy website networks",,,10.1007/978-3-030-87031-7_7,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  The proliferation of misleading or false information spread by untrustworthy
websites has emerged as a significant concern on the public agenda in many
countries, including Slovakia. Despite the influence ascribed to such websites,
their transparency and accountability remain an issue in most cases, with
published work on mapping the administrators and connections of untrustworthy
websites remaining limited. This article contributes to this body of knowledge
(i) by providing an effective open-source tool to uncover untrustworthy website
networks based on the utilization of the same Google Analytics/AdSense IDs,
with the added ability to expose networks based on historical data, and (ii) by
providing insight into the Slovak untrustworthy website landscape through
delivering a first of its kind mapping of Slovak untrustworthy website
networks. Our approach is based on a mix-method design employing a qualitative
exploration of data collected in a two wave study conducted in 2019 and 2021,
utilizing a custom-coded tool to uncover website connections. Overall, the
study succeeds in exposing multiple novel website ties. Our findings indicate
that while some untrustworthy website networks have been found to operate in
the Slovak infosphere, most researched websites appear to be run by multiple
mutually unconnected administrators. The resulting data also demonstrates that
untrustworthy Slovak websites display a high content diversity in terms of
connected websites, ranging from websites of local NGOs, an e-shop selling
underwear to a matchmaking portal.
","[{'version': 'v1', 'created': 'Fri, 3 Sep 2021 13:51:46 GMT'}]",2021-09-16,"[['Mintal', 'Jozef Michal', ''], ['Kalman', 'Michal', ''], ['Fabián', 'Karol', '']]","['Untrustworthy websites', 'Wayback machine', 'Slovakia', 'Google Analytics', 'AdSense', 'Website networks']"
11044,2109.06382,Joseph Zuckerman,"Joseph Zuckerman, Davide Giri, Jihye Kwon, Paolo Mantovani, and Luca
  P. Carloni","Cohmeleon: Learning-Based Orchestration of Accelerator Coherence in
  Heterogeneous SoCs","To appear in the 54th IEEE/ACM Symposium on Microarchitecture (MICRO
  2021)",,10.1145/3466752.3480065,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the most critical aspects of integrating loosely-coupled accelerators
in heterogeneous SoC architectures is orchestrating their interactions with the
memory hierarchy, especially in terms of navigating the various cache-coherence
options: from accelerators accessing off-chip memory directly, bypassing the
cache hierarchy, to accelerators having their own private cache. By running
real-size applications on FPGA-based prototypes of many-accelerator multi-core
SoCs, we show that the best cache-coherence mode for a given accelerator varies
at runtime, depending on the accelerator's characteristics, the workload size,
and the overall SoC status.
  Cohmeleon applies reinforcement learning to select the best coherence mode
for each accelerator dynamically at runtime, as opposed to statically at design
time. It makes these selections adaptively, by continuously observing the
system and measuring its performance. Cohmeleon is accelerator-agnostic,
architecture-independent, and it requires minimal hardware support. Cohmeleon
is also transparent to application programmers and has a negligible software
overhead. FPGA-based experiments show that our runtime approach offers, on
average, a 38% speedup with a 66% reduction of off-chip memory accesses
compared to state-of-the-art design-time approaches. Moreover, it can match
runtime solutions that are manually tuned for the target architecture.
","[{'version': 'v1', 'created': 'Tue, 14 Sep 2021 01:13:08 GMT'}]",2021-09-15,"[['Zuckerman', 'Joseph', ''], ['Giri', 'Davide', ''], ['Kwon', 'Jihye', ''], ['Mantovani', 'Paolo', ''], ['Carloni', 'Luca P.', '']]","['cache coherence', 'hardware accelerators', 'q-learning', 'system-on-chip']"
11045,2111.00197,Lujia Shen,"Lujia Shen, Shouling Ji, Xuhong Zhang, Jinfeng Li, Jing Chen, Jie Shi,
  Chengfang Fang, Jianwei Yin, Ting Wang",Backdoor Pre-trained Models Can Transfer to All,,,10.1145/3460120.3485370,,cs.CL cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pre-trained general-purpose language models have been a dominating component
in enabling real-world natural language processing (NLP) applications. However,
a pre-trained model with backdoor can be a severe threat to the applications.
Most existing backdoor attacks in NLP are conducted in the fine-tuning phase by
introducing malicious triggers in the targeted class, thus relying greatly on
the prior knowledge of the fine-tuning task. In this paper, we propose a new
approach to map the inputs containing triggers directly to a predefined output
representation of the pre-trained NLP models, e.g., a predefined output
representation for the classification token in BERT, instead of a target label.
It can thus introduce backdoor to a wide range of downstream tasks without any
prior knowledge. Additionally, in light of the unique properties of triggers in
NLP, we propose two new metrics to measure the performance of backdoor attacks
in terms of both effectiveness and stealthiness. Our experiments with various
types of triggers show that our method is widely applicable to different
fine-tuning tasks (classification and named entity recognition) and to
different models (such as BERT, XLNet, BART), which poses a severe threat.
Furthermore, by collaborating with the popular online model repository Hugging
Face, the threat brought by our method has been confirmed. Finally, we analyze
the factors that may affect the attack performance and share insights on the
causes of the success of our backdoor attack.
","[{'version': 'v1', 'created': 'Sat, 30 Oct 2021 07:11:24 GMT'}]",2021-11-02,"[['Shen', 'Lujia', ''], ['Ji', 'Shouling', ''], ['Zhang', 'Xuhong', ''], ['Li', 'Jinfeng', ''], ['Chen', 'Jing', ''], ['Shi', 'Jie', ''], ['Fang', 'Chengfang', ''], ['Yin', 'Jianwei', ''], ['Wang', 'Ting', '']]","['backdoor attack', 'pre-trained model', 'natural language processing']"
11046,2301.02971,Md. Ahsan Habib Nayan,"Md. Ahsan Habib, M. A. H. Akhand and Md. Abdus Samad Kamal","Emotion Recognition from Microblog Managing Emoticon with Text and
  Classifying using 1D CNN","9 pages, 3 figures, 5 tables, journal paper","Journal of Computer Science, 18(12), 1170-1178 (2022)",10.3844/jcssp.2022.1170.1178,,cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  Microblog, an online-based broadcast medium, is a widely used forum for
people to share their thoughts and opinions. Recently, Emotion Recognition (ER)
from microblogs is an inspiring research topic in diverse areas. In the machine
learning domain, automatic emotion recognition from microblogs is a challenging
task, especially, for better outcomes considering diverse content. Emoticon
becomes very common in the text of microblogs as it reinforces the meaning of
content. This study proposes an emotion recognition scheme considering both the
texts and emoticons from microblog data. Emoticons are considered unique
expressions of the users' emotions and can be changed by the proper emotional
words. The succession of emoticons appearing in the microblog data is preserved
and a 1D Convolutional Neural Network (CNN) is employed for emotion
classification. The experimental result shows that the proposed emotion
recognition scheme outperforms the other existing methods while tested on
Twitter data.
","[{'version': 'v1', 'created': 'Sun, 8 Jan 2023 04:04:44 GMT'}]",2023-01-10,"[['Habib', 'Md. Ahsan', ''], ['Akhand', 'M. A. H.', ''], ['Kamal', 'Md. Abdus Samad', '']]","['Deep Learning', 'CNN', 'Emotion Recognition', 'Emoticons']"
11047,2010.13890,Eman AlOmar,"Eman Abdullah AlOmar, Anthony Peruma, Mohamed Wiem Mkaouer, Christian
  Newman, Ali Ouni, Marouane Kessentini","How We Refactor and How We Document it? On the Use of Supervised Machine
  Learning Algorithms to Classify Refactoring Documentation",,Expert Systems with Applications. 167 (2021) 114176,10.1016/j.eswa.2020.114176,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Refactoring is the art of improving the design of a system without altering
its external behavior. Refactoring has become a well established and
disciplined software engineering practice that has attracted a significant
amount of research presuming that refactoring is primarily motivated by the
need to improve system structures. However, recent studies have shown that
developers may incorporate refactorings in other development activities that go
beyond improving the design. Unfortunately, these studies are limited to
developer interviews and a reduced set of projects. To cope with the
above-mentioned limitations, we aim to better understand what motivates
developers to apply refactoring by mining and classifying a large set of
111,884 commits containing refactorings, extracted from 800 Java projects. We
trained a multi-class classifier to categorize these commits into 3 categories,
namely, Internal QA, External QA, and Code Smell Resolution, along with the
traditional BugFix and Functional categories. This classification challenges
the original definition of refactoring, being exclusive to improving the design
and fixing code smells. Further, to better understand our classification
results, we analyzed commit messages to extract textual patterns that
developers regularly use to describe their refactorings. The results show that
(1) fixing code smells is not the main driver for developers to refactoring
their codebases. Refactoring is solicited for a wide variety of reasons, going
beyond its traditional definition; (2) the distribution of refactorings differs
between production and test files; (3) developers use several patterns to
purposefully target refactoring; (4) the textual patterns, extracted from
commit messages, provide better coverage for how developers document their
refactorings.
","[{'version': 'v1', 'created': 'Mon, 26 Oct 2020 20:33:17 GMT'}]",2021-03-26,"[['AlOmar', 'Eman Abdullah', ''], ['Peruma', 'Anthony', ''], ['Mkaouer', 'Mohamed Wiem', ''], ['Newman', 'Christian', ''], ['Ouni', 'Ali', ''], ['Kessentini', 'Marouane', '']]","['Refactoring', 'Software Quality', 'Software Engineering', 'MachineLearning']"
11048,1910.04273,Ayush Kumar,"Ayush Kumar, Rudolf Netzel, Michael Burch, Daniel Weiskopf, and Klaus
  Mueller",Visual Multi-Metric Grouping of Eye-Tracking Data,"17 pages, 15 figures","Journal of Eye Movement Research, 2018",10.16910/jemr.10.5.10,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an algorithmic and visual grouping of participants and
eye-tracking metrics derived from recorded eye-tracking data. Our method
utilizes two well-established visualization concepts. First, parallel
coordinates are used to provide an overview of the used metrics, their
interactions, and similarities, which helps select suitable metrics that
describe characteristics of the eye-tracking data. Furthermore, parallel
coordinates plots enable an analyst to test the effects of creating a
combination of a subset of metrics resulting in a newly derived eye-tracking
metric. Second, a similarity matrix visualization is used to visually represent
the affine combination of metrics utilizing an algorithmic grouping of subjects
that leads to distinct visual groups of similar behavior. To keep the diagrams
of the matrix visualization simple and understandable, we visually encode our
eye-tracking data into the cells of a similarity matrix of participants. The
algorithmic grouping is performed with a clustering based on the affine
combination of metrics, which is also the basis for the similarity value
computation of the similarity matrix. To illustrate the usefulness of our
visualization, we applied it to an eye-tracking data set involving the reading
behavior of metro maps of up to 40 participants. Finally, we discuss
limitations and scalability issues of the approach focusing on visual and
perceptual issues.
","[{'version': 'v1', 'created': 'Wed, 9 Oct 2019 21:52:20 GMT'}]",2020-07-24,"[['Kumar', 'Ayush', ''], ['Netzel', 'Rudolf', ''], ['Burch', 'Michael', ''], ['Weiskopf', 'Daniel', ''], ['Mueller', 'Klaus', '']]","['Eye movement', 'metrics', 'eye tracking', 'visualization', 'parallel coordinates', 'saccades', 'scanpath', 'similarity']"
11049,1911.06217,Tobias Skovgaard Jepsen,"Tobias Skovgaard Jepsen, Christian S. Jensen, Thomas Dyhre Nielsen","On Network Embedding for Machine Learning on Road Networks: A Case Study
  on the Danish Road Network","Best Paper at the 3rd IEEE International Workshop on Big Spatial Data
  (BSD 2018)","2018 IEEE International Conference on Big Data (Big Data), 2018,
  pp. 3422-3431",10.1109/BigData.2018.8622416,,cs.LG cs.DB stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Road networks are a type of spatial network, where edges may be associated
with qualitative information such as road type and speed limit. Unfortunately,
such information is often incomplete; for instance, OpenStreetMap only has
speed limits for 13% of all Danish road segments. This is problematic for
analysis tasks that rely on such information for machine learning. To enable
machine learning in such circumstances, one may consider the application of
network embedding methods to extract structural information from the network.
However, these methods have so far mostly been used in the context of social
networks, which differ significantly from road networks in terms of, e.g., node
degree and level of homophily (which are key to the performance of many network
embedding methods). We analyze the use of network embedding methods,
specifically node2vec, for learning road segment embeddings in road networks.
Due to the often limited availability of information on other relevant road
characteristics, the analysis focuses on leveraging the spatial network
structure. Our results suggest that network embedding methods can indeed be
used for deriving relevant network features (that may, e.g, be used for
predicting speed limits), but that the qualities of the embeddings differ from
embeddings for social networks.
","[{'version': 'v1', 'created': 'Thu, 14 Nov 2019 16:18:36 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Nov 2019 10:51:56 GMT'}]",2019-11-18,"[['Jepsen', 'Tobias Skovgaard', ''], ['Jensen', 'Christian S.', ''], ['Nielsen', 'Thomas Dyhre', '']]","['road network', 'machine learning', 'feature learning', 'network embedding']"
11050,2101.06021,Pei Wang,"Pei Wang, Wei Sun, Qingsen Yan, Axi Niu, Rui Li, Yu Zhu, Jinqiu Sun,
  Yanning Zhang",Non-uniform Motion Deblurring with Blurry Component Divided Guidance,,"Pattern Recognition,Volume 120, December 2021, 108082",10.1016/j.patcog.2021.108082,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Blind image deblurring is a fundamental and challenging computer vision
problem, which aims to recover both the blur kernel and the latent sharp image
from only a blurry observation. Despite the superiority of deep learning
methods in image deblurring have displayed, there still exists major challenge
with various non-uniform motion blur. Previous methods simply take all the
image features as the input to the decoder, which handles different degrees
(e.g. large blur, small blur) simultaneously, leading to challenges for sharp
image generation. To tackle the above problems, we present a deep two-branch
network to deal with blurry images via a component divided module, which
divides an image into two components based on the representation of blurry
degree. Specifically, two component attentive blocks are employed to learn
attention maps to exploit useful deblurring feature representations on both
large and small blurry regions. Then, the blur-aware features are fed into
two-branch reconstruction decoders respectively. In addition, a new feature
fusion mechanism, orientation-based feature fusion, is proposed to merge sharp
features of the two branches. Both qualitative and quantitative experimental
results show that our method performs favorably against the state-of-the-art
approaches.
","[{'version': 'v1', 'created': 'Fri, 15 Jan 2021 09:10:35 GMT'}]",2021-10-22,"[['Wang', 'Pei', ''], ['Sun', 'Wei', ''], ['Yan', 'Qingsen', ''], ['Niu', 'Axi', ''], ['Li', 'Rui', ''], ['Zhu', 'Yu', ''], ['Sun', 'Jinqiu', ''], ['Zhang', 'Yanning', '']]","['Non-uiniform deblurring', 'component divided', 'attention mechanism']"
11051,2208.13632,Gordon Fraser,"Patric Feldmeier, Gordon Fraser",Neuroevolution-Based Generation of Tests and Oracles for Games,"To appear at the 37th IEEE/ACM International Conference on Automated
  Software Engineering (ASE'2022)",,10.1145/3551349.3556939,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Game-like programs have become increasingly popular in many software
engineering domains such as mobile apps, web applications, or programming
education. However, creating tests for programs that have the purpose of
challenging human players is a daunting task for automatic test generators.
Even if test generation succeeds in finding a relevant sequence of events to
exercise a program, the randomized nature of games means that it may neither be
possible to reproduce the exact program behavior underlying this sequence, nor
to create test assertions checking if observed randomized game behavior is
correct. To overcome these problems, we propose Neatest, a novel test generator
based on the NeuroEvolution of Augmenting Topologies (NEAT) algorithm. Neatest
systematically explores a program's statements, and creates neural networks
that operate the program in order to reliably reach each statement -- that is,
Neatest learns to play the game in a way to reliably cover different parts of
the code. As the networks learn the actual game behavior, they can also serve
as test oracles by evaluating how surprising the observed behavior of a program
under test is compared to a supposedly correct version of the program. We
evaluate this approach in the context of Scratch, an educational programming
environment. Our empirical study on 25 non-trivial Scratch games demonstrates
that our approach can successfully train neural networks that are not only far
more resilient to random influences than traditional test suites consisting of
static input sequences, but are also highly effective with an average mutation
score of more than 65%.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2022 14:27:21 GMT'}]",2022-08-30,"[['Feldmeier', 'Patric', ''], ['Fraser', 'Gordon', '']]","['Neuroevolution', 'Game Testing', 'Automated Testing', 'Scratch']"
11052,1905.12898,Anpei Chen,"Ziheng Zhang, Anpei Chen, Ling Xie, Jingyi Yu, Shenghua Gao","Learning Semantics-aware Distance Map with Semantics Layering Network
  for Amodal Instance Segmentation",This paper is submitted to ACMMM19,,10.1145/3343031.3350911,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we demonstrate yet another approach to tackle the amodal
segmentation problem. Specifically, we first introduce a new representation,
namely a semantics-aware distance map (sem-dist map), to serve as our target
for amodal segmentation instead of the commonly used masks and heatmaps. The
sem-dist map is a kind of level-set representation, of which the different
regions of an object are placed into different levels on the map according to
their visibility. It is a natural extension of masks and heatmaps, where modal,
amodal segmentation, as well as depth order information, are all
well-described. Then we also introduce a novel convolutional neural network
(CNN) architecture, which we refer to as semantic layering network, to estimate
sem-dist maps layer by layer, from the global-level to the instance-level, for
all objects in an image. Extensive experiments on the COCOA and D2SA datasets
have demonstrated that our framework can predict amodal segmentation, occlusion
and depth order with state-of-the-art performance.
","[{'version': 'v1', 'created': 'Thu, 30 May 2019 07:46:54 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Aug 2019 17:34:05 GMT'}]",2019-08-23,"[['Zhang', 'Ziheng', ''], ['Chen', 'Anpei', ''], ['Xie', 'Ling', ''], ['Yu', 'Jingyi', ''], ['Gao', 'Shenghua', '']]","['amodal perception', 'image segmentation', 'convolutional neural networks']"
11053,1810.06258,Karen Bodie,"Karen Bodie, Zachary Taylor, Mina Kamel, Roland Siegwart",Towards Efficient Full Pose Omnidirectionality with Overactuated MAVs,"10 pages, 6 figures, ISER 2018 conference submission","ISER 2018: Proceedings of the 2018 International Symposium on
  Experimental Robotics, pp 85-95",10.1007/978-3-030-33950-0_8,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Omnidirectional MAVs are a growing field, with demonstrated advantages for
aerial interaction and uninhibited observation. While systems with complete
pose omnidirectionality and high hover efficiency have been developed
independently, a robust system that combines the two has not been demonstrated
to date. This paper presents VoliroX: a novel omnidirectional vehicle that can
exert a wrench in any orientation while maintaining efficient flight
configurations. The system design is presented, and a 6 DOF geometric control
that is robust to singularities. Flight experiments further demonstrate and
verify its capabilities.
","[{'version': 'v1', 'created': 'Mon, 15 Oct 2018 10:19:32 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Jul 2019 13:57:25 GMT'}, {'version': 'v3', 'created': 'Mon, 6 Apr 2020 09:06:12 GMT'}]",2020-04-07,"[['Bodie', 'Karen', ''], ['Taylor', 'Zachary', ''], ['Kamel', 'Mina', ''], ['Siegwart', 'Roland', '']]","['overactuated', 'omnidirectional MAV', 'geometric control']"
11054,2012.07274,Stephen MacDonell,"Jil Kl\""under, Dzejlana Karajic, Paolo Tell, Oliver Karras, Christian
  M\""unkel, J\""urgen M\""unch, Stephen G. MacDonell, Regina Hebig, and Marco
  Kuhrmann","Determining Context Factors for Hybrid Development Methods with Trained
  Models","11 pages, Conference, 5 figures, 9 tables","Proceedings of the International Conference on Software and
  Systems Process (ICSSP2020). Seoul, South Korea, IEEE Computer Society Press,
  pp.61-70",10.1145/3379177.3388898,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Selecting a suitable development method for a specific project context is one
of the most challenging activities in process design. Every project is unique
and, thus, many context factors have to be considered. Recent research took
some initial steps towards statistically constructing hybrid development
methods, yet, paid little attention to the peculiarities of context factors
influencing method and practice selection. In this paper, we utilize
exploratory factor analysis and logistic regression analysis to learn such
context factors and to identify methods that are correlated with these factors.
Our analysis is based on 829 data points from the HELENA dataset. We provide
five base clusters of methods consisting of up to 10 methods that lay the
foundation for devising hybrid development methods. The analysis of the five
clusters using trained models reveals only a few context factors, e.g.,
project/product size and target application domain, that seem to significantly
influence the selection of methods. An extended descriptive analysis of these
practices in the context of the identified method clusters also suggests a
consolidation of the relevant practice sets used in specific project contexts.
","[{'version': 'v1', 'created': 'Mon, 14 Dec 2020 05:46:36 GMT'}]",2020-12-15,"[['Klünder', 'Jil', ''], ['Karajic', 'Dzejlana', ''], ['Tell', 'Paolo', ''], ['Karras', 'Oliver', ''], ['Münkel', 'Christian', ''], ['Münch', 'Jürgen', ''], ['MacDonell', 'Stephen G.', ''], ['Hebig', 'Regina', ''], ['Kuhrmann', 'Marco', '']]","['Agile software development', 'software process', 'hybrid development method', 'exploratory factor analysis', 'logistical regression analysis  1']"
11055,2005.10545,Zhihong Chen,"Zhihong Chen, Rong Xiao, Chenliang Li, Gangfeng Ye, Haochuan Sun,
  Hongbo Deng","ESAM: Discriminative Domain Adaptation with Non-Displayed Items to
  Improve Long-Tail Performance",Accept by SIGIR-2020,,10.1145/3397271.3401043,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most of ranking models are trained only with displayed items (most are hot
items), but they are utilized to retrieve items in the entire space which
consists of both displayed and non-displayed items (most are long-tail items).
Due to the sample selection bias, the long-tail items lack sufficient records
to learn good feature representations, i.e. data sparsity and cold start
problems. The resultant distribution discrepancy between displayed and
non-displayed items would cause poor long-tail performance. To this end, we
propose an entire space adaptation model (ESAM) to address this problem from
the perspective of domain adaptation (DA). ESAM regards displayed and
non-displayed items as source and target domains respectively. Specifically, we
design the attribute correlation alignment that considers the correlation
between high-level attributes of the item to achieve distribution alignment.
Furthermore, we introduce two effective regularization strategies, i.e.
\textit{center-wise clustering} and \textit{self-training} to improve DA
process. Without requiring any auxiliary information and auxiliary domains,
ESAM transfers the knowledge from displayed items to non-displayed items for
alleviating the distribution inconsistency. Experiments on two public datasets
and a large-scale industrial dataset collected from Taobao demonstrate that
ESAM achieves state-of-the-art performance, especially in the long-tail space.
Besides, we deploy ESAM to the Taobao search engine, leading to significant
improvement on online performance. The code is available at
\url{https://github.com/A-bone1/ESAM.git}
","[{'version': 'v1', 'created': 'Thu, 21 May 2020 09:58:07 GMT'}]",2020-05-22,"[['Chen', 'Zhihong', ''], ['Xiao', 'Rong', ''], ['Li', 'Chenliang', ''], ['Ye', 'Gangfeng', ''], ['Sun', 'Haochuan', ''], ['Deng', 'Hongbo', '']]","['Domain Adaptation', 'Ranking Model', 'Non-displayed Items']"
11056,2010.15052,Ryan Steed,Ryan Steed and Aylin Caliskan,"Image Representations Learned With Unsupervised Pre-Training Contain
  Human-like Biases","10 pages, 3 figures. Replaced example image completions of real
  people with completions of artificial people",,10.1145/3442188.3445932,,cs.CY cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Recent advances in machine learning leverage massive datasets of unlabeled
images from the web to learn general-purpose image representations for tasks
from image classification to face recognition. But do unsupervised computer
vision models automatically learn implicit patterns and embed social biases
that could have harmful downstream effects? We develop a novel method for
quantifying biased associations between representations of social concepts and
attributes in images. We find that state-of-the-art unsupervised models trained
on ImageNet, a popular benchmark image dataset curated from internet images,
automatically learn racial, gender, and intersectional biases. We replicate 8
previously documented human biases from social psychology, from the innocuous,
as with insects and flowers, to the potentially harmful, as with race and
gender. Our results closely match three hypotheses about intersectional bias
from social psychology. For the first time in unsupervised computer vision, we
also quantify implicit human biases about weight, disabilities, and several
ethnicities. When compared with statistical patterns in online image datasets,
our findings suggest that machine learning models can automatically learn bias
from the way people are stereotypically portrayed on the web.
","[{'version': 'v1', 'created': 'Wed, 28 Oct 2020 15:55:49 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Jan 2021 20:51:57 GMT'}, {'version': 'v3', 'created': 'Wed, 27 Jan 2021 18:48:10 GMT'}]",2021-01-28,"[['Steed', 'Ryan', ''], ['Caliskan', 'Aylin', '']]","['implicit bias', 'unsupervised learning', 'computer vision']"
11057,2004.13629,Masahiro Oda Dr.,"Masahiro Oda, Holger R. Roth, Takayuki Kitasaka, Kazuhiro Furukawa,
  Ryoji Miyahara, Yoshiki Hirooka, Hidemi Goto, Nassir Navab, Kensaku Mori","Colon Shape Estimation Method for Colonoscope Tracking using Recurrent
  Neural Networks","Accepted paper as a poster presentation at MICCAI 2018 (International
  Conference on Medical Image Computing and Computer-Assisted Intervention),
  Granada, Spain","Published in Proceedings of MICCAI 2018, LNCS 11073, pp 176-184",10.1007/978-3-030-00937-3_21,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an estimation method using a recurrent neural network (RNN) of the
colon's shape where deformation was occurred by a colonoscope insertion.
Colonoscope tracking or a navigation system that navigates physician to polyp
positions is needed to reduce such complications as colon perforation. Previous
tracking methods caused large tracking errors at the transverse and sigmoid
colons because these areas largely deform during colonoscope insertion. Colon
deformation should be taken into account in tracking processes. We propose a
colon deformation estimation method using RNN and obtain the colonoscope shape
from electromagnetic sensors during its insertion into the colon. This method
obtains positional, directional, and an insertion length from the colonoscope
shape. From its shape, we also calculate the relative features that represent
the positional and directional relationships between two points on a
colonoscope. Long short-term memory is used to estimate the current colon shape
from the past transition of the features of the colonoscope shape. We performed
colon shape estimation in a phantom study and correctly estimated the colon
shapes during colonoscope insertion with 12.39 (mm) estimation error.
","[{'version': 'v1', 'created': 'Mon, 20 Apr 2020 04:43:58 GMT'}]",2020-04-29,"[['Oda', 'Masahiro', ''], ['Roth', 'Holger R.', ''], ['Kitasaka', 'Takayuki', ''], ['Furukawa', 'Kazuhiro', ''], ['Miyahara', 'Ryoji', ''], ['Hirooka', 'Yoshiki', ''], ['Goto', 'Hidemi', ''], ['Navab', 'Nassir', ''], ['Mori', 'Kensaku', '']]","['Colon', 'Shape estimation', 'Recurrent neural network', 'LSTM']"
11058,2207.03834,Carlos Lassance,Carlos Lassance and St\'ephane Clinchant,An Efficiency Study for SPLADE Models,"Accepted at SIGIR 2022 and ReNeuIR. Huggingface models available at
  https://huggingface.co/naver and code at https://github.com/naver/splade",,10.1145/3477495.3531833,,cs.IR cs.CL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Latency and efficiency issues are often overlooked when evaluating IR models
based on Pretrained Language Models (PLMs) in reason of multiple hardware and
software testing scenarios. Nevertheless, efficiency is an important part of
such systems and should not be overlooked.
  In this paper, we focus on improving the efficiency of the SPLADE model since
it has achieved state-of-the-art zero-shot performance and competitive results
on TREC collections. SPLADE efficiency can be controlled via a regularization
factor, but solely controlling this regularization has been shown to not be
efficient enough. In order to reduce the latency gap between SPLADE and
traditional retrieval systems, we propose several techniques including L1
regularization for queries, a separation of document/query encoders, a
FLOPS-regularized middle-training, and the use of faster query encoders. Our
benchmark demonstrates that we can drastically improve the efficiency of these
models while increasing the performance metrics on in-domain data. To our
knowledge, {we propose the first neural models that, under the same computing
constraints, \textit{achieve similar latency (less than 4ms difference) as
traditional BM25}, while having \textit{similar performance (less than 10\%
MRR@10 reduction)} as the state-of-the-art single-stage neural rankers on
in-domain data}.
","[{'version': 'v1', 'created': 'Fri, 8 Jul 2022 11:42:05 GMT'}]",2022-07-11,"[['Lassance', 'Carlos', ''], ['Clinchant', 'Stéphane', '']]","['latency', 'information retrieval', 'splade', 'sparse representations']"
11059,2206.12701,Norman Knyazev,Norman Knyazev and Harrie Oosterhuis,The Bandwagon Effect: Not Just Another Bias,"In Proceedings of the 2022 ACM SIGIR International Conference on the
  Theory of Information Retrieval (ICTIR '22), July 11-12, 2022, Madrid, Spain.
  ACM, New York, NY, USA, 11 pages. https://doi.org/10.1145/3539813.3545142 ACM
  ISBN 978-1-4503-9412-3/22/07",,10.1145/3539813.3545142,,cs.IR stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Optimizing recommender systems based on user interaction data is mainly seen
as a problem of dealing with selection bias, where most existing work assumes
that interactions from different users are independent. However, it has been
shown that in reality user feedback is often influenced by earlier interactions
of other users, e.g. via average ratings, number of views or sales per item,
etc. This phenomenon is known as the bandwagon effect. In contrast with
previous literature, we argue that the bandwagon effect should not be seen as a
problem of statistical bias. In fact, we prove that this effect leaves both
individual interactions and their sample mean unbiased. Nevertheless, we show
that it can make estimators inconsistent, introducing a distinct set of
problems for convergence in relevance estimation. Our theoretical analysis
investigates the conditions under which the bandwagon effect poses a
consistency problem and explores several approaches for mitigating these
issues. This work aims to show that the bandwagon effect poses an
underinvestigated open problem that is fundamentally distinct from the
well-studied selection bias in recommendation.
","[{'version': 'v1', 'created': 'Sat, 25 Jun 2022 17:24:35 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Jul 2022 15:42:50 GMT'}]",2022-07-04,"[['Knyazev', 'Norman', ''], ['Oosterhuis', 'Harrie', '']]","['Bandwagon Effect', 'Consistency', 'Statistical Bias', 'Recommendation']"
11060,2001.11846,Marcos Eduardo Valle,Marcos Eduardo Valle and Rodolfo Anibal Lobo,"Quaternion-Valued Recurrent Projection Neural Networks on Unit
  Quaternions",arXiv admin note: substantial text overlap with arXiv:1909.09227,,10.1016/j.tcs.2020.08.033,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hypercomplex-valued neural networks, including quaternion-valued neural
networks, can treat multi-dimensional data as a single entity. In this paper,
we present the quaternion-valued recurrent projection neural networks (QRPNNs).
Briefly, QRPNNs are obtained by combining the non-local projection learning
with the quaternion-valued recurrent correlation neural network (QRCNNs). We
show that QRPNNs overcome the cross-talk problem of QRCNNs. Thus, they are
appropriate to implement associative memories. Furthermore, computational
experiments reveal that QRPNNs exhibit greater storage capacity and noise
tolerance than their corresponding QRCNNs.
","[{'version': 'v1', 'created': 'Thu, 30 Jan 2020 11:25:45 GMT'}]",2020-09-14,"[['Valle', 'Marcos Eduardo', ''], ['Lobo', 'Rodolfo Anibal', '']]","['Recurrent neural network', 'Hopfield network', 'associative memory', 'quaternion-valued neural network']"
11061,2110.00070,Cagri Toraman,"Cagri Toraman, Furkan \c{S}ahinu\c{c}, Eyup Halit Yilmaz","BlackLivesMatter 2020: An Analysis of Deleted and Suspended Users in
  Twitter","Published at the 14th International ACM Conference on Web Science in
  2022 (WebSci 2022)",,10.1145/3501247.3531539,,cs.SI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  After George Floyd's death in May 2020, the volume of discussion in social
media increased dramatically. A series of protests followed this tragic event,
called as the 2020 BlackLivesMatter movement. Eventually, many user accounts
are deleted by their owners or suspended due to violating the rules of social
media platforms. In this study, we analyze what happened in Twitter before and
after the event triggers with respect to deleted and suspended users. We create
a novel dataset that includes approximately 500k users sharing 20m tweets, half
of whom actively participated in the 2020 BlackLivesMatter discussion, but some
of them were deleted or suspended later. We particularly examine the factors
for undesirable behavior in terms of spamming, negative language, hate speech,
and misinformation spread. We find that the users who participated to the 2020
BlackLivesMatter discussion have more negative and undesirable tweets, compared
to the users who did not. Furthermore, the number of new accounts in Twitter
increased significantly after the trigger event occurred, yet new users are
more oriented to have undesirable tweets, compared to old ones.
","[{'version': 'v1', 'created': 'Thu, 30 Sep 2021 20:00:18 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Jul 2022 14:23:20 GMT'}]",2022-07-07,"[['Toraman', 'Cagri', ''], ['Şahinuç', 'Furkan', ''], ['Yilmaz', 'Eyup Halit', '']]","['BlackLivesMatter', 'deleted user', 'tweet', 'suspended user']"
11062,1906.11600,Etienne Decenciere,"Etienne Decenci\`ere, Santiago Velasco-Forero, Fu Min, Juanjuan Chen,
  H\'el\`ene Burdin, Gervais Gauthier, Bruno La\""y, Thomas Bornschloegl,
  Th\'er\`ese Baldeweck","Dealing with Topological Information within a Fully Convolutional Neural
  Network","International Conference on Advanced Concepts for Intelligent Vision
  Systems (ACIVS 2018)","Advanced Concepts for Intelligent Vision Systems. ACIVS 2018.
  Lecture Notes in Computer Science, vol 11182. Springer, Cham",10.1007/978-3-030-01449-0_39,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A fully convolutional neural network has a receptive field of limited size
and therefore cannot exploit global information, such as topological
information. A solution is proposed in this paper to solve this problem, based
on pre-processing with a geodesic operator. It is applied to the segmentation
of histological images of pigmented reconstructed epidermis acquired via Whole
Slide Imaging.
","[{'version': 'v1', 'created': 'Thu, 27 Jun 2019 13:05:48 GMT'}]",2019-06-28,"[['Decencière', 'Etienne', ''], ['Velasco-Forero', 'Santiago', ''], ['Min', 'Fu', ''], ['Chen', 'Juanjuan', ''], ['Burdin', 'Hélène', ''], ['Gauthier', 'Gervais', ''], ['Laÿ', 'Bruno', ''], ['Bornschloegl', 'Thomas', ''], ['Baldeweck', 'Thérèse', '']]","['Histological image segmentation', 'Convolutional neural network', 'geodesic operators', 'Mathematical morphology']"
11063,2104.04206,Sin Yong Tan,"Sin Yong Tan, Homagni Saha, Margarite Jacoby, Gregor P. Henze, Soumik
  Sarkar","Granger Causality Based Hierarchical Time Series Clustering for State
  Estimation","6 pages, 6 figures, 1 table",IFAC-PapersOnLine 53 (2020) 524-529,10.1016/j.ifacol.2020.12.324,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Clustering is an unsupervised learning technique that is useful when working
with a large volume of unlabeled data. Complex dynamical systems in real life
often entail data streaming from a large number of sources. Although it is
desirable to use all source variables to form accurate state estimates, it is
often impractical due to large computational power requirements, and
sufficiently robust algorithms to handle these cases are not common. We propose
a hierarchical time series clustering technique based on symbolic dynamic
filtering and Granger causality, which serves as a dimensionality reduction and
noise-rejection tool. Our process forms a hierarchy of variables in the
multivariate time series with clustering of relevant variables at each level,
thus separating out noise and less relevant variables. A new distance metric
based on Granger causality is proposed and used for the time series clustering,
as well as validated on empirical data sets. Experimental results from
occupancy detection and building temperature estimation tasks show fidelity to
the empirical data sets while maintaining state-prediction accuracy with
substantially reduced data dimensionality.
","[{'version': 'v1', 'created': 'Fri, 9 Apr 2021 06:14:54 GMT'}]",2021-05-20,"[['Tan', 'Sin Yong', ''], ['Saha', 'Homagni', ''], ['Jacoby', 'Margarite', ''], ['Henze', 'Gregor P.', ''], ['Sarkar', 'Soumik', '']]","['Time series clustering', 'time series state estimation', 'occupancy detection', 'dimensionality reduction']"
11064,2012.00192,Anand Jayarajan,"Anand Jayarajan, Kimberly Hau, Andrew Goodwin, Gennady Pekhimenko","LifeStream: A High-Performance Stream Processing Engine for Periodic
  Streams",,,10.1145/3445814.3446725,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Hospitals around the world collect massive amounts of physiological data from
their patients every day. Recently, there has been an increase in research
interest to subject this data to statistical analysis to gain more insights and
provide improved medical diagnoses. Such analyses require complex computations
on large volumes of data, demanding efficient data processing systems. This
paper shows that currently available data processing solutions either fail to
meet the performance requirements or lack simple and flexible programming
interfaces. To address this problem, we propose \emph{LifeStream}, a
high-performance stream processing engine for physiological data. LifeStream
hits the sweet spot between ease of programming by providing a rich temporal
query language support and performance by employing optimizations that exploit
the periodic nature of physiological data. We demonstrate that LifeStream
achieves end-to-end performance up to $7.5\times$ higher than state-of-the-art
streaming engines and $3.2\times$ than hand-optimized numerical libraries on
real-world datasets and workloads.
","[{'version': 'v1', 'created': 'Tue, 1 Dec 2020 00:54:57 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Mar 2021 01:44:53 GMT'}]",2021-03-04,"[['Jayarajan', 'Anand', ''], ['Hau', 'Kimberly', ''], ['Goodwin', 'Andrew', ''], ['Pekhimenko', 'Gennady', '']]","['stream data analytics', 'temporal query processing', 'physiologicaldata', 'locality tracing', 'event lineage tracking', 'targeted query processing']"
11065,2205.00235,Shengyao Zhuang,"Hang Li, Shuai Wang, Shengyao Zhuang, Ahmed Mourad, Xueguang Ma, Jimmy
  Lin, Guido Zuccon","To Interpolate or not to Interpolate: PRF, Dense and Sparse Retrievers","Short research paper, accepted at SIGIR2022",,10.1145/3477495.3531884,,cs.IR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Current pre-trained language model approaches to information retrieval can be
broadly divided into two categories: sparse retrievers (to which belong also
non-neural approaches such as bag-of-words methods, e.g., BM25) and dense
retrievers. Each of these categories appears to capture different
characteristics of relevance. Previous work has investigated how relevance
signals from sparse retrievers could be combined with those from dense
retrievers via interpolation. Such interpolation would generally lead to higher
retrieval effectiveness. In this paper we consider the problem of combining the
relevance signals from sparse and dense retrievers in the context of Pseudo
Relevance Feedback (PRF). This context poses two key challenges: (1) When
should interpolation occur: before, after, or both before and after the PRF
process? (2) Which sparse representation should be considered: a zero-shot
bag-of-words model (BM25), or a learnt sparse representation? To answer these
questions we perform a thorough empirical evaluation considering an effective
and scalable neural PRF approach (Vector-PRF), three effective dense retrievers
(ANCE, TCTv2, DistillBERT), and one state-of-the-art learnt sparse retriever
(uniCOIL). The empirical findings from our experiments suggest that, regardless
of sparse representation and dense retriever, interpolation both before and
after PRF achieves the highest effectiveness across most datasets and metrics.
","[{'version': 'v1', 'created': 'Sat, 30 Apr 2022 11:02:58 GMT'}]",2022-05-03,"[['Li', 'Hang', ''], ['Wang', 'Shuai', ''], ['Zhuang', 'Shengyao', ''], ['Mourad', 'Ahmed', ''], ['Ma', 'Xueguang', ''], ['Lin', 'Jimmy', ''], ['Zuccon', 'Guido', '']]","['Pseudo-Relevance Feedback', 'Dense and sparse retrieval interpolation', 'Neural IR']"
11066,2006.05372,Tobias Welz,"Tobias Welz, Matthias Stuermer","Sustainability of ICT hardware procurement in Switzerland -- A
  status-quo analysis of the public procurement sector","11 pages, 9 Figures. Accepted to be presented at the ICT4S 2020
  Conference",,10.1145/3401335.3401352,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Sustainable procurement requires organizations to align their purchasing
behavior with regard to broader goals linked to resource efficiency, climate
change, social responsibility and other sustainability criteria. The level of
sustainability in Information and Communication Technology (ICT) hardware
procurement is analyzed for two reasons: First, ICT hardware belongs to the six
key product groups in sustainable procurement. Second, ICT in general is
expected to be an important enabler for low-carbon economies, providing
solutions to reduce Green-House Gas (GHG) emissions. While the advantages of
sustainable procurement are obvious, certain barriers hinder the adoption in
day-to-day procurement. This case study on ICT hardware discusses the three
important barriers ""lack of clear definitions per product group"", ""missing
market intelligence about sustainable products"" and ""inflexible procedures and
attitudes as barriers for innovative approaches"" based on an in-depth analysis
of sustainable procurement of ICT hardware by the public sector in Switzerland.
To this end, tender data published on the national procurement platform
simap.ch is screened for sustainability criteria using the Common Procurement
Vocabulary (CPV) nomenclature to identify relevant ICT projects. The results
reveal to which extent such criteria as well as their determinants are
currently included in public tenders. Using two different approaches, only a
small number of tenders were found containing sustainability criteria of a wide
range from basic to comprehensive. The overall performance of Swiss public
procurement is benchmarked by comparing the identified sustainability criteria
with available criteria from international key actors in sustainable
procurement. Thus, this analysis provides novel insights on how public agencies
today take sustainability into account when procuring ICT hardware.
","[{'version': 'v1', 'created': 'Tue, 9 Jun 2020 16:04:36 GMT'}]",2020-06-11,"[['Welz', 'Tobias', ''], ['Stuermer', 'Matthias', '']]","['ICT hardware', 'sustainable procurement', 'low-carbon economies', 'Life-Cycle management', 'Common Procurement Vocabulary']"
11067,2201.11332,Ningyu Zhang,"Hongbin Ye, Ningyu Zhang, Shumin Deng, Xiang Chen, Hui Chen, Feiyu
  Xiong, Xi Chen, Huajun Chen",Ontology-enhanced Prompt-tuning for Few-shot Learning,Accepted by WWW2022,,10.1145/3485447.3511921,,cs.CL cs.AI cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Few-shot Learning (FSL) is aimed to make predictions based on a limited
number of samples. Structured data such as knowledge graphs and ontology
libraries has been leveraged to benefit the few-shot setting in various tasks.
However, the priors adopted by the existing methods suffer from challenging
knowledge missing, knowledge noise, and knowledge heterogeneity, which hinder
the performance for few-shot learning. In this study, we explore knowledge
injection for FSL with pre-trained language models and propose
ontology-enhanced prompt-tuning (OntoPrompt). Specifically, we develop the
ontology transformation based on the external knowledge graph to address the
knowledge missing issue, which fulfills and converts structure knowledge to
text. We further introduce span-sensitive knowledge injection via a visible
matrix to select informative knowledge to handle the knowledge noise issue. To
bridge the gap between knowledge and text, we propose a collective training
algorithm to optimize representations jointly. We evaluate our proposed
OntoPrompt in three tasks, including relation extraction, event extraction, and
knowledge graph completion, with eight datasets. Experimental results
demonstrate that our approach can obtain better few-shot performance than
baselines.
","[{'version': 'v1', 'created': 'Thu, 27 Jan 2022 05:41:36 GMT'}]",2023-01-27,"[['Ye', 'Hongbin', ''], ['Zhang', 'Ningyu', ''], ['Deng', 'Shumin', ''], ['Chen', 'Xiang', ''], ['Chen', 'Hui', ''], ['Xiong', 'Feiyu', ''], ['Chen', 'Xi', ''], ['Chen', 'Huajun', '']]","['Few-shot Learning', 'Ontology', 'Prompt-tuning', 'Relation Extraction', 'Event Extraction', 'Knowledge Graph Completion']"
11068,1508.05028,Yuncheng Li,"Yuncheng Li, Jifei Huang, Jiebo Luo","Using User Generated Online Photos to Estimate and Monitor Air Pollution
  in Major Cities",ICIMCS '15,,10.1145/2808492.2808564,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rapid development of economy in China over the past decade, air
pollution has become an increasingly serious problem in major cities and caused
grave public health concerns in China. Recently, a number of studies have dealt
with air quality and air pollution. Among them, some attempt to predict and
monitor the air quality from different sources of information, ranging from
deployed physical sensors to social media. These methods are either too
expensive or unreliable, prompting us to search for a novel and effective way
to sense the air quality. In this study, we propose to employ the state of the
art in computer vision techniques to analyze photos that can be easily acquired
from online social media. Next, we establish the correlation between the haze
level computed directly from photos with the official PM 2.5 record of the
taken city at the taken time. Our experiments based on both synthetic and real
photos have shown the promise of this image-based approach to estimating and
monitoring air pollution.
","[{'version': 'v1', 'created': 'Thu, 20 Aug 2015 16:20:35 GMT'}]",2015-08-21,"[['Li', 'Yuncheng', ''], ['Huang', 'Jifei', ''], ['Luo', 'Jiebo', '']]","['Air Quality', 'Haze Level', 'User Generated Photos', 'Image Analytics']"
11069,1802.03478,Bing Li,Bing Li,Programming Requests/Responses with GreatFree in the Cloud Environment,"20 pages, 16 listings, 4 figures, 4 tables, International Journal of
  Distributed and Parallel Systems, 2018",,10.5121/ijdps.2018.9101,,cs.PL cs.DC cs.SE,http://creativecommons.org/publicdomain/zero/1.0/,"  Programming request with GreatFree is an efficient programming technique to
implement distributed polling in the cloud computing environment. GreatFree is
a distributed programming environment through which diverse distributed systems
can be established through programming rather than configuring or scripting.
GreatFree emphasizes the importance of programming since it offers developers
the opportunities to leverage their distributed knowledge and programming
skills. Additionally, programming is the unique way to construct creative,
adaptive and flexible systems to accommodate various distributed computing
environments. With the support of GreatFree code-level Distributed
Infrastructure Patterns, Distributed Operation Patterns and APIs, the difficult
procedure is accomplished in a programmable, rapid and highly-patterned manner,
i.e., the programming behaviors are simplified as the repeatable operation of
Copy-Paste-Replace. Since distributed polling is one of the fundamental
techniques to construct distributed systems, GreatFree provides developers with
relevant APIs and patterns to program requests/responses in the novel
programming environment.
","[{'version': 'v1', 'created': 'Fri, 9 Feb 2018 23:48:44 GMT'}]",2018-02-13,"[['Li', 'Bing', '']]","['Code-Level Design Patterns', 'Cloud Programming', 'Distributed Systems', 'Highly-Patterned Development Environment']"
11070,2101.12346,Jiansheng Fang,"Jiansheng Fang, Huazhu Fu, Jiang Liu",Deep Triplet Hashing Network for Case-based Medical Image Retrieval,"12 pages, 6 figures, MedIA Journal",,10.1016/j.media.2021.101981,,cs.CV cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep hashing methods have been shown to be the most efficient approximate
nearest neighbor search techniques for large-scale image retrieval. However,
existing deep hashing methods have a poor small-sample ranking performance for
case-based medical image retrieval. The top-ranked images in the returned query
results may be as a different class than the query image. This ranking problem
is caused by classification, regions of interest (ROI), and small-sample
information loss in the hashing space. To address the ranking problem, we
propose an end-to-end framework, called Attention-based Triplet Hashing (ATH)
network, to learn low-dimensional hash codes that preserve the classification,
ROI, and small-sample information. We embed a spatial-attention module into the
network structure of our ATH to focus on ROI information. The spatial-attention
module aggregates the spatial information of feature maps by utilizing
max-pooling, element-wise maximum, and element-wise mean operations jointly
along the channel axis. The triplet cross-entropy loss can help to map the
classification information of images and similarity between images into the
hash codes. Extensive experiments on two case-based medical datasets
demonstrate that our proposed ATH can further improve the retrieval performance
compared to the state-of-the-art deep hashing methods and boost the ranking
performance for small samples. Compared to the other loss methods, the triplet
cross-entropy loss can enhance the classification performance and hash
code-discriminability
","[{'version': 'v1', 'created': 'Fri, 29 Jan 2021 01:35:46 GMT'}]",2021-02-05,"[['Fang', 'Jiansheng', ''], ['Fu', 'Huazhu', ''], ['Liu', 'Jiang', '']]","['MedicalImageRetrieval', 'Deep Hashing Methods', 'Spatial Attention', 'Region of Interest', 'Triplet Labels']"
11071,1601.04105,Mohsen Taheriyan,"Mohsen Taheriyan, Craig A. Knoblock, Pedro Szekely, Jose Luis Ambite",Learning the Semantics of Structured Data Sources,"Web Semantics: Science, Services and Agents on the World Wide Web,
  2016",,10.1016/j.websem.2015.12.003,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information sources such as relational databases, spreadsheets, XML, JSON,
and Web APIs contain a tremendous amount of structured data that can be
leveraged to build and augment knowledge graphs. However, they rarely provide a
semantic model to describe their contents. Semantic models of data sources
represent the implicit meaning of the data by specifying the concepts and the
relationships within the data. Such models are the key ingredients to
automatically publish the data into knowledge graphs. Manually modeling the
semantics of data sources requires significant effort and expertise, and
although desirable, building these models automatically is a challenging
problem. Most of the related work focuses on semantic annotation of the data
fields (source attributes). However, constructing a semantic model that
explicitly describes the relationships between the attributes in addition to
their semantic types is critical.
  We present a novel approach that exploits the knowledge from a domain
ontology and the semantic models of previously modeled sources to automatically
learn a rich semantic model for a new source. This model represents the
semantics of the new source in terms of the concepts and relationships defined
by the domain ontology. Given some sample data from the new source, we leverage
the knowledge in the domain ontology and the known semantic models to construct
a weighted graph that represents the space of plausible semantic models for the
new source. Then, we compute the top k candidate semantic models and suggest to
the user a ranked list of the semantic models for the new source. The approach
takes into account user corrections to learn more accurate semantic models on
future data sources. Our evaluation shows that our method generates expressive
semantic models for data sources and services with minimal user input. ...
","[{'version': 'v1', 'created': 'Sat, 16 Jan 2016 00:55:25 GMT'}]",2016-01-19,"[['Taheriyan', 'Mohsen', ''], ['Knoblock', 'Craig A.', ''], ['Szekely', 'Pedro', ''], ['Ambite', 'Jose Luis', '']]","['Knowledge Graph', 'Ontology', 'Semantic Model', 'Source Modeling', 'Semantic Labeling', 'Semantic Web', 'Linked Data']"
11072,2212.09851,Trevor Brown,"Trevor Brown, William Sigouin and Dan Alistarh","PathCAS: An Efficient Middle Ground for Concurrent Search Data
  Structures","Extended version of the conference paper, which appeared at PPoPP'22.
  This work won the PPoPP'22 best artifact award",,10.1145/3503221.3508410,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To maximize the performance of concurrent data structures, researchers have
often turned to highly complex fine-grained techniques, resulting in efficient
and elegant algorithms, which can however be often difficult to understand and
prove correct. While simpler techniques exist, such as transactional memory,
they can have limited performance or portability relative to their fine-grained
counterparts. Approaches at both ends of this complexity-performance spectrum
have been extensively explored, but relatively less is known about the middle
ground: approaches that are willing to sacrifice some performance for
simplicity, while remaining competitive with state-of-the-art handcrafted
designs.
  In this paper, we explore this middle ground, and present PathCAS, a
primitive that combines ideas from multi-word CAS (KCAS) and transactional
memory approaches, while carefully avoiding overhead. We show how PathCAS can
be used to implement efficient search data structures relatively simply, using
an internal binary search tree as an example, then extending this to an AVL
tree. Our best implementations outperform many handcrafted search trees: in
search-heavy workloads, it rivals the BCCO tree [5], the fastest known
concurrent binary tree in terms of search performance [3]. Our results suggest
that PathCAS can yield concurrent data structures that are relatively easy to
build and prove correct, while offering surprisingly high performance.
","[{'version': 'v1', 'created': 'Mon, 19 Dec 2022 20:47:17 GMT'}]",2022-12-21,"[['Brown', 'Trevor', ''], ['Sigouin', 'William', ''], ['Alistarh', 'Dan', '']]","['concurrent data structures', 'search trees', 'nonblocking algorithms', 'lock-free', 'synchronization primitives']"
11073,1812.10395,Demesure Guillaume,"Etienne Valette (CRAN, UL), Bril El-Haouzi (CRAN, UL), Guillaume
  Demesure (CRAN, UL), Vincent Boucinha","Toward an Anthropocentric Approach for Hybrid Control Architectures:
  Case of a Furniture Factory",,"Service Orientation in Holonic and Multi-agent Manufacturing,
  SOHOMA'18, Jun 2018, Bergamo, Italy",10.1007/978-3-030-03003-2_11,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Typology of goods and services' consumption has changed. In order to adapt to
this change, it is relevant for a company to turn toward new ways of production
and management. Slowly, the concept of industry 4.0 starts to set up in
manufacturing companies. Research on hybrid control systems favours achieving
automated and flexible production system through ""jidoka"" (or au-tonomation)
and Just In Time principles. Still, studies stay mainly techno-centred rather
than anthropocentric. Parisot company suffers today of a lack of reactivity to
its market and of a production tool maladjusted to customer's consumption
habits. This article aims to sum up the company's current situation, and to
introduce the project that intends to back it through its economic,
technological and sociological transition toward a flexible, adaptive and
sustainable human-centred manufacturing system.
","[{'version': 'v1', 'created': 'Fri, 14 Dec 2018 10:18:59 GMT'}]",2018-12-27,"[['Valette', 'Etienne', '', 'CRAN, UL'], ['El-Haouzi', 'Bril', '', 'CRAN, UL'], ['Demesure', 'Guillaume', '', 'CRAN, UL'], ['Boucinha', 'Vincent', '']]","['Automated and Flexible Production System', 'Autonomation', 'Control System Hybridization', 'Just In Time Organization']"
11074,2010.00906,Antoine Boutet,"Vasisht Duddu, Antoine Boutet, Virat Shejwalkar",Quantifying Privacy Leakage in Graph Embedding,11 pages,"MobiQuitous 2020 - 17th EAI International Conference on Mobile and
  Ubiquitous Systems: Computing, Networking and Services",10.1145/3448891.3448939,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph embeddings have been proposed to map graph data to low dimensional
space for downstream processing (e.g., node classification or link prediction).
With the increasing collection of personal data, graph embeddings can be
trained on private and sensitive data. For the first time, we quantify the
privacy leakage in graph embeddings through three inference attacks targeting
Graph Neural Networks. We propose a membership inference attack to infer
whether a graph node corresponding to individual user's data was member of the
model's training or not. We consider a blackbox setting where the adversary
exploits the output prediction scores, and a whitebox setting where the
adversary has also access to the released node embeddings. This attack provides
an accuracy up to 28% (blackbox) 36% (whitebox) beyond random guess by
exploiting the distinguishable footprint between train and test data records
left by the graph embedding. We propose a Graph Reconstruction attack where the
adversary aims to reconstruct the target graph given the corresponding graph
embeddings. Here, the adversary can reconstruct the graph with more than 80% of
accuracy and link inference between two nodes around 30% more confidence than a
random guess. We then propose an attribute inference attack where the adversary
aims to infer a sensitive attribute. We show that graph embeddings are strongly
correlated to node attributes letting the adversary inferring sensitive
information (e.g., gender or location).
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2020 10:28:16 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Apr 2021 09:07:40 GMT'}]",2021-09-28,"[['Duddu', 'Vasisht', ''], ['Boutet', 'Antoine', ''], ['Shejwalkar', 'Virat', '']]","['Privacy Leakage', 'Inference Attacks', 'Graph Neural Networks', 'GraphEmbeddings']"
11075,1809.05000,Maarten Schoukens,Maarten Schoukens and Roland T\'oth,"From Nonlinear Identification to Linear Parameter Varying Models:
  Benchmark Examples",,,10.1016/j.ifacol.2018.09.181,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linear parameter-varying (LPV) models form a powerful model class to analyze
and control a (nonlinear) system of interest. Identifying a LPV model of a
nonlinear system can be challenging due to the difficulty of selecting the
scheduling variable(s) a priori, which is quite challenging in case a first
principles based understanding of the system is unavailable.
  This paper presents a systematic LPV embedding approach starting from
nonlinear fractional representation models. A nonlinear system is identified
first using a nonlinear block-oriented linear fractional representation (LFR)
model. This nonlinear LFR model class is embedded into the LPV model class by
factorization of the static nonlinear block present in the model. As a result
of the factorization a LPV-LFR or a LPV state-space model with an affine
dependency results. This approach facilitates the selection of the scheduling
variable from a data-driven perspective. Furthermore the estimation is not
affected by measurement noise on the scheduling variables, which is often left
untreated by LPV model identification methods.
  The proposed approach is illustrated on two well-established nonlinear
modeling benchmark examples.
","[{'version': 'v1', 'created': 'Thu, 13 Sep 2018 14:50:14 GMT'}]",2020-05-11,"[['Schoukens', 'Maarten', ''], ['Tóth', 'Roland', '']]","['Nonlinear Systems', 'Linear-Parameter Varying Systems', 'System Identification', 'Embedding', 'Linear Fractional Representation']"
11076,2009.10272,Shivam Handa,"Shivam Handa, Martin Rinard",Inductive Program Synthesis Over Noisy Data,,,10.1145/3368089.3409732,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new framework and associated synthesis algorithms for program
synthesis over noisy data, i.e., data that may contain incorrect/corrupted
input-output examples. This framework is based on an extension of finite tree
automata called {\em weighted finite tree automata}. We show how to apply this
framework to formulate and solve a variety of program synthesis problems over
noisy data. Results from our implemented system running on problems from the
SyGuS 2018 benchmark suite highlight its ability to successfully synthesize
programs in the face of noisy data sets, including the ability to synthesize a
correct program even when every input-output example in the data set is
corrupted.
","[{'version': 'v1', 'created': 'Tue, 22 Sep 2020 01:57:48 GMT'}, {'version': 'v2', 'created': 'Sun, 18 Oct 2020 20:23:13 GMT'}]",2021-03-15,"[['Handa', 'Shivam', ''], ['Rinard', 'Martin', '']]","['Program Synthesis', 'Noisy Data', 'Corrupted Data', 'Machine Learning']"
11077,2202.05751,Hideaki Hata,"Naomichi Shimada, Tao Xiao, Hideaki Hata, Christoph Treude, Kenichi
  Matsumoto",GitHub Sponsors: Exploring a New Way to Contribute to Open Source,"12 pages, ICSE 2022",,10.1145/3510003.3510116,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  GitHub Sponsors, launched in 2019, enables donations to individual open
source software (OSS) developers. Financial support for OSS maintainers and
developers is a major issue in terms of sustaining OSS projects, and the
ability to donate to individuals is expected to support the sustainability of
developers, projects, and community. In this work, we conducted a mixed-methods
study of GitHub Sponsors, including quantitative and qualitative analyses, to
understand the characteristics of developers who are likely to receive
donations and what developers think about donations to individuals. We found
that: (1) sponsored developers are more active than non-sponsored developers,
(2) the possibility to receive donations is related to whether there is someone
in their community who is donating, and (3) developers are sponsoring as a new
way to contribute to OSS. Our findings are the first step towards data-informed
guidance for using GitHub Sponsors, opening up avenues for future work on this
new way of financially sustaining the OSS community.
","[{'version': 'v1', 'created': 'Fri, 11 Feb 2022 16:44:24 GMT'}]",2022-02-14,"[['Shimada', 'Naomichi', ''], ['Xiao', 'Tao', ''], ['Hata', 'Hideaki', ''], ['Treude', 'Christoph', ''], ['Matsumoto', 'Kenichi', '']]","['GitHub Sponsors', 'Open Source', 'Sponsorship']"
11078,2003.00813,Bingquan Zhu,"Bingquan Zhu, Hao Fang, Yanan Sui, Luming Li","Deepfakes for Medical Video De-Identification: Privacy Protection and
  Diagnostic Information Preservation","Accepted for publication at the AAAI/ACM Conference on Artificial
  Intelligence, Ethics, and Society (AIES) 2020",,10.1145/3375627.3375849,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data sharing for medical research has been difficult as open-sourcing
clinical data may violate patient privacy. Traditional methods for face
de-identification wipe out facial information entirely, making it impossible to
analyze facial behavior. Recent advancements on whole-body keypoints detection
also rely on facial input to estimate body keypoints. Both facial and body
keypoints are critical in some medical diagnoses, and keypoints invariability
after de-identification is of great importance. Here, we propose a solution
using deepfake technology, the face swapping technique. While this swapping
method has been criticized for invading privacy and portraiture right, it could
conversely protect privacy in medical video: patients' faces could be swapped
to a proper target face and become unrecognizable. However, it remained an open
question that to what extent the swapping de-identification method could affect
the automatic detection of body keypoints. In this study, we apply deepfake
technology to Parkinson's disease examination videos to de-identify subjects,
and quantitatively show that: face-swapping as a de-identification approach is
reliable, and it keeps the keypoints almost invariant, significantly better
than traditional methods. This study proposes a pipeline for video
de-identification and keypoint preservation, clearing up some ethical
restrictions for medical data sharing. This work could make open-source high
quality medical video datasets more feasible and promote future medical
research that benefits our society.
","[{'version': 'v1', 'created': 'Fri, 7 Feb 2020 22:36:48 GMT'}]",2020-03-03,"[['Zhu', 'Bingquan', ''], ['Fang', 'Hao', ''], ['Sui', 'Yanan', ''], ['Li', 'Luming', '']]","['privacy protection', 'medical data sharing', 'de-identification', 'deepfakes', 'keypoint detection']"
11079,2110.00230,Dejan Lavbi\v{c},"Alja\v{z} Zrnec, Marko Po\v{z}enel and Dejan Lavbi\v{c}","Users' ability to perceive misinformation: An information quality
  assessment approach",,Information Processing & Management 59 (2020),10.1016/j.ipm.2021.102739,,cs.IT math.IT,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Digital information exchange enables quick creation and sharing of
information and thus changes existing habits. Social media is becoming the main
source of news for end-users replacing traditional media. This also enables the
proliferation of fake news, which misinforms readers and is used to serve the
interests of the creators. As a result, automated fake news detection systems
are attracting attention. However, automatic fake news detection presents a
major challenge; content evaluation is increasingly becoming the responsibility
of the end-user. Thus, in the present study we used information quality (IQ) as
an instrument to investigate how users can detect fake news. Specifically, we
examined how users perceive fake news in the form of shorter paragraphs on
individual IQ dimensions. We also investigated which user characteristics might
affect fake news detection. We performed an empirical study with 1123 users,
who evaluated randomly generated stories with statements of various level of
correctness by individual IQ dimensions. The results reveal that IQ can be used
as a tool for fake news detection. Our findings show that (1) domain knowledge
has a positive impact on fake news detection; (2) education in combination with
domain knowledge improves fake news detection; and (3) personality trait
conscientiousness contributes significantly to fake news detection in all
dimensions.
","[{'version': 'v1', 'created': 'Fri, 1 Oct 2021 06:38:19 GMT'}]",2021-10-04,"[['Zrnec', 'Aljaž', ''], ['Poženel', 'Marko', ''], ['Lavbič', 'Dejan', '']]","['Fake news', 'Misinformation', 'Information quality', 'Big Five personality traits', 'Fake news detection', 'Casestudy']"
11080,1712.08289,Kui Zhao,"Kui Zhao, Yuechuan Li, Zhaoqian Shuai, Cheng Yang",Learning and Transferring IDs Representation in E-commerce,"KDD'18, 9 pages",,10.1145/3219819.3219855,,cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Many machine intelligence techniques are developed in E-commerce and one of
the most essential components is the representation of IDs, including user ID,
item ID, product ID, store ID, brand ID, category ID etc. The classical
encoding based methods (like one-hot encoding) are inefficient in that it
suffers sparsity problems due to its high dimension, and it cannot reflect the
relationships among IDs, either homogeneous or heterogeneous ones. In this
paper, we propose an embedding based framework to learn and transfer the
representation of IDs. As the implicit feedbacks of users, a tremendous amount
of item ID sequences can be easily collected from the interactive sessions. By
jointly using these informative sequences and the structural connections among
IDs, all types of IDs can be embedded into one low-dimensional semantic space.
Subsequently, the learned representations are utilized and transferred in four
scenarios: (i) measuring the similarity between items, (ii) transferring from
seen items to unseen items, (iii) transferring across different domains, (iv)
transferring across different tasks. We deploy and evaluate the proposed
approach in Hema App and the results validate its effectiveness.
","[{'version': 'v1', 'created': 'Fri, 22 Dec 2017 02:53:50 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Feb 2018 03:40:19 GMT'}, {'version': 'v3', 'created': 'Mon, 7 May 2018 01:50:57 GMT'}, {'version': 'v4', 'created': 'Tue, 22 May 2018 04:26:46 GMT'}]",2018-05-23,"[['Zhao', 'Kui', ''], ['Li', 'Yuechuan', ''], ['Shuai', 'Zhaoqian', ''], ['Yang', 'Cheng', '']]","['Representation learning', 'Neural networks', 'IDs embedding', 'E-commerce']"
11081,2001.10336,Philipp Mayr,Guillaume Cabanac and Ingo Frommholz and Philipp Mayr,"Bibliometric-enhanced Information Retrieval 10th Anniversary Workshop
  Edition","Overview paper submitted to ECIR 2020, Lisbon, PT. arXiv admin note:
  substantial text overlap with arXiv:1909.04954",,10.1007/978-3-030-45442-5_85,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Bibliometric-enhanced Information Retrieval workshop series (BIR) was
launched at ECIR in 2014 \cite{MayrEtAl2014} and it was held at ECIR each year
since then. This year we organize the 10th iteration of BIR. The workshop
series at ECIR and JCDL/SIGIR tackles issues related to academic search, at the
crossroads between Information Retrieval, Natural Language Processing and
Bibliometrics. In this overview paper, we summarize the past workshops, present
the workshop topics for 2020 and reflect on some future steps for this workshop
series.
","[{'version': 'v1', 'created': 'Mon, 20 Jan 2020 13:16:12 GMT'}]",2020-05-15,"[['Cabanac', 'Guillaume', ''], ['Frommholz', 'Ingo', ''], ['Mayr', 'Philipp', '']]","['Academic Search', 'Information Retrieval', 'Digital Libraries', 'Bibliometrics', 'Scientometrics', 'Multidisciplinary']"
11082,2205.15138,Raven Beutner,"Raven Beutner, David Carral, Bernd Finkbeiner, Jana Hofmann, Markus
  Kr\""otzsch",Deciding Hyperproperties Combined with Functional Specifications,LICS 2022,,10.1145/3531130.3533369,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  We study satisfiability for HyperLTL with a $\forall^*\exists^*$ quantifier
prefix, known to be highly undecidable in general. HyperLTL can express system
properties that relate multiple traces (so-called hyperproperties), which are
often combined with trace properties that specify functional behavior on single
traces. Following this conceptual split, we first define several safety and
liveness fragments of $\forall^*\exists^*$ HyperLTL, and characterize the
complexity of their (often much easier) satisfiability problem. We then add LTL
trace properties as functional specifications. Though (highly) undecidable in
many cases, this way of combining ""simple"" HyperLTL and arbitrary LTL also
leads to interesting new decidable fragments. This systematic study of
$\forall^*\exists^*$ fragments is complemented by a new (incomplete) algorithm
for $\forall\exists^*$-HyperLTL satisfiability.
","[{'version': 'v1', 'created': 'Mon, 30 May 2022 14:31:45 GMT'}]",2022-05-31,"[['Beutner', 'Raven', ''], ['Carral', 'David', ''], ['Finkbeiner', 'Bernd', ''], ['Hofmann', 'Jana', ''], ['Krötzsch', 'Markus', '']]","['Hyperproperties', 'HyperLTL', 'Satisfiability']"
11083,2208.10162,Jae-Hyeon Park,Jae-Hyeon Park and Dong Eui Chang,"Unscented Kalman filter with stable embedding for simple, accurate and
  computationally efficient state estimation of systems on manifolds in
  Euclidean space","This paper is published in International Journal of Robust and
  Nonliner Control",International Journal of Robust and Nonlinear Control (2022),10.1002/rnc.6514,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  This paper proposes a simple, accurate and computationally efficient method
to apply the ordinary unscented Kalman filter developed in Euclidean space to
systems whose dynamics evolve on manifolds.We use the mathematical theory
called stable embedding to make a variant of unscented Kalman filter that keeps
state estimates in closeproximity to the manifold while exhibiting excellent
estimation performance. We confirm the performance of our devised filter by
applying it to the satellite system model and comparing the performance with
other unscented Kalman filters devised specifically for systems on manifolds.
Our devised filter has a low estimation error, keeps the state estimates in
close proximity to the manifold as expected, and consumes a minor amount of
computation time. Also our devised filter is simple and easy to use because our
filter directly employs the off-the-shelf standard unscented Kalman filter
devised in Euclidean space without any particular manifold-structure-preserving
discretization method or coordinate transformation.
","[{'version': 'v1', 'created': 'Mon, 22 Aug 2022 09:19:09 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Nov 2022 08:33:33 GMT'}]",2022-12-01,"[['Park', 'Jae-Hyeon', ''], ['Chang', 'Dong Eui', '']]","['stable embedding', 'unscented Kalman filter', 'attitude estimation', 'satellite', 'manifold']"
11084,1906.11877,Matthew Guzdial,"Zijin Luo, Matthew Guzdial, and Mark Riedl",Making CNNs for Video Parsing Accessible,"11 pages, 6 figures, Foundations of Digital Games 2018",,10.1145/3337722.3337755,,cs.CV cs.AI cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ability to extract sequences of game events for high-resolution e-sport
games has traditionally required access to the game's engine. This serves as a
barrier to groups who don't possess this access. It is possible to apply deep
learning to derive these logs from gameplay video, but it requires
computational power that serves as an additional barrier. These groups would
benefit from access to these logs, such as small e-sport tournament organizers
who could better visualize gameplay to inform both audience and commentators.
In this paper we present a combined solution to reduce the required
computational resources and time to apply a convolutional neural network (CNN)
to extract events from e-sport gameplay videos. This solution consists of
techniques to train a CNN faster and methods to execute predictions more
quickly. This expands the types of machines capable of training and running
these models, which in turn extends access to extracting game logs with this
approach. We evaluate the approaches in the domain of DOTA2, one of the most
popular e-sports. Our results demonstrate our approach outperforms standard
backpropagation baselines.
","[{'version': 'v1', 'created': 'Mon, 10 Jun 2019 16:00:40 GMT'}]",2019-07-01,"[['Luo', 'Zijin', ''], ['Guzdial', 'Matthew', ''], ['Riedl', 'Mark', '']]","['DOTA2', 'Machine Learning', 'Computer Vision']"
11085,2111.04473,Fanny Silavong,"Fran Silavong, Sean Moran, Antonios Georgiadis, Rohan Saphal, Robert
  Otter",Senatus -- A Fast and Accurate Code-to-Code Recommendation Engine,Accepted to MSR 2022,,10.1145/3524842.3527947,,cs.SE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning on source code (MLOnCode) is a popular research field that
has been driven by the availability of large-scale code repositories and the
development of powerful probabilistic and deep learning models for mining
source code. Code-to-code recommendation is a task in MLOnCode that aims to
recommend relevant, diverse and concise code snippets that usefully extend the
code currently being written by a developer in their development environment
(IDE). Code-to-code recommendation engines hold the promise of increasing
developer productivity by reducing context switching from the IDE and
increasing code-reuse. Existing code-to-code recommendation engines do not
scale gracefully to large codebases, exhibiting a linear growth in query time
as the code repository increases in size. In addition, existing code-to-code
recommendation engines fail to account for the global statistics of code
repositories in the ranking function, such as the distribution of code snippet
lengths, leading to sub-optimal retrieval results. We address both of these
weaknesses with \emph{Senatus}, a new code-to-code recommendation engine. At
the core of Senatus is \emph{De-Skew} LSH a new locality sensitive hashing
(LSH) algorithm that indexes the data for fast (sub-linear time) retrieval
while also counteracting the skewness in the snippet length distribution using
novel abstract syntax tree-based feature scoring and selection algorithms. We
evaluate Senatus and find the recommendations to be of higher quality than
competing baselines, while achieving faster search. For example on the
CodeSearchNet dataset Senatus improves performance by 31.21\% F1 and
147.9\emph{x} faster query time compared to Facebook Aroma. Senatus also
outperforms standard MinHash LSH by 29.2\% F1 and 51.02\emph{x} faster query
time.
","[{'version': 'v1', 'created': 'Fri, 5 Nov 2021 16:56:28 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Apr 2022 09:46:42 GMT'}]",2022-04-27,"[['Silavong', 'Fran', ''], ['Moran', 'Sean', ''], ['Georgiadis', 'Antonios', ''], ['Saphal', 'Rohan', ''], ['Otter', 'Robert', '']]","['Locality sensitive hashing', 'MinHash LSH', 'machine learning onsource code', 'Code-to-code recommendation']"
11086,2008.11839,Changwan Hong,"Changwan Hong, Laxman Dhulipala, Julian Shun","Exploring the Design Space of Static and Incremental Graph Connectivity
  Algorithms on GPUs",,"Proceedings of the 2020 International Conference on Parallel
  Architectures and Compilation Techniques",10.1145/3410463.3414657,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Connected components and spanning forest are fundamental graph algorithms due
to their use in many important applications, such as graph clustering and image
segmentation. GPUs are an ideal platform for graph algorithms due to their high
peak performance and memory bandwidth. While there exist several GPU
connectivity algorithms in the literature, many design choices have not yet
been explored. In this paper, we explore various design choices in GPU
connectivity algorithms, including sampling, linking, and tree compression, for
both the static as well as the incremental setting. Our various design choices
lead to over 300 new GPU implementations of connectivity, many of which
outperform state-of-the-art. We present an experimental evaluation, and show
that we achieve an average speedup of 2.47x speedup over existing static
algorithms. In the incremental setting, we achieve a throughput of up to 48.23
billion edges per second. Compared to state-of-the-art CPU implementations on a
72-core machine, we achieve a speedup of 8.26--14.51x for static connectivity
and 1.85--13.36x for incremental connectivity using a Tesla V100 GPU.
","[{'version': 'v1', 'created': 'Wed, 26 Aug 2020 21:50:11 GMT'}]",2020-08-28,"[['Hong', 'Changwan', ''], ['Dhulipala', 'Laxman', ''], ['Shun', 'Julian', '']]","['Connected components', 'Graph algorithms', 'GPU algorithms', 'Spanning forest']"
11087,1801.09526,Christian Schilling,"Sergiy Bogomolov, Marcelo Forets, Goran Frehse, Andreas Podelski,
  Christian Schilling, Fr\'ed\'eric Viry","Reach Set Approximation through Decomposition with Low-dimensional Sets
  and High-dimensional Matrices",,HSCC 2018,10.1145/3178126.3178128,,cs.SY math.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Approximating the set of reachable states of a dynamical system is an
algorithmic yet mathematically rigorous way to reason about its safety.
Although progress has been made in the development of efficient algorithms for
affine dynamical systems, available algorithms still lack scalability to ensure
their wide adoption in the industrial setting. While modern linear algebra
packages are efficient for matrices with tens of thousands of dimensions,
set-based image computations are limited to a few hundred. We propose to
decompose reach set computations such that set operations are performed in low
dimensions, while matrix operations like exponentiation are carried out in the
full dimension. Our method is applicable both in dense- and discrete-time
settings. For a set of standard benchmarks, it shows a speed-up of up to two
orders of magnitude compared to the respective state-of-the art tools, with
only modest losses in accuracy. For the dense-time case, we show an experiment
with more than 10.000 variables, roughly two orders of magnitude higher than
possible with previous approaches.
","[{'version': 'v1', 'created': 'Mon, 29 Jan 2018 14:36:23 GMT'}]",2022-05-03,"[['Bogomolov', 'Sergiy', ''], ['Forets', 'Marcelo', ''], ['Frehse', 'Goran', ''], ['Podelski', 'Andreas', ''], ['Schilling', 'Christian', ''], ['Viry', 'Frédéric', '']]","['reachability analysis', 'safety verification', 'linear time-invariant systems', 'set recurrence relation']"
11088,2010.14108,Mingjun Zhao,"Mingjun Zhao, Shengli Yan, Bang Liu, Xinwang Zhong, Qian Hao, Haolan
  Chen, Di Niu, Bowei Long and Weidong Guo","QBSUM: a Large-Scale Query-Based Document Summarization Dataset from
  Real-world Applications",accepted by Computer Speech & Language,,10.1016/j.csl.2020.101166,,cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Query-based document summarization aims to extract or generate a summary of a
document which directly answers or is relevant to the search query. It is an
important technique that can be beneficial to a variety of applications such as
search engines, document-level machine reading comprehension, and chatbots.
Currently, datasets designed for query-based summarization are short in numbers
and existing datasets are also limited in both scale and quality. Moreover, to
the best of our knowledge, there is no publicly available dataset for Chinese
query-based document summarization. In this paper, we present QBSUM, a
high-quality large-scale dataset consisting of 49,000+ data samples for the
task of Chinese query-based document summarization. We also propose multiple
unsupervised and supervised solutions to the task and demonstrate their
high-speed inference and superior performance via both offline experiments and
online A/B tests. The QBSUM dataset is released in order to facilitate future
advancement of this research field.
","[{'version': 'v1', 'created': 'Tue, 27 Oct 2020 07:30:04 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Oct 2020 08:39:51 GMT'}]",2020-10-29,"[['Zhao', 'Mingjun', ''], ['Yan', 'Shengli', ''], ['Liu', 'Bang', ''], ['Zhong', 'Xinwang', ''], ['Hao', 'Qian', ''], ['Chen', 'Haolan', ''], ['Niu', 'Di', ''], ['Long', 'Bowei', ''], ['Guo', 'Weidong', '']]","['Query-based Summarization', 'Natural Language Generation', 'Information Retrieval']"
11089,1906.01365,Manuel Bravo,Manuel Bravo and Alexey Gotsman,Reconfigurable Atomic Transaction Commit (Extended Version),"Extended version of the PODC' 19 paper: Reconfigurable Atomic
  Transaction Commit",,10.1145/3293611.3331590,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern data stores achieve scalability by partitioning data into shards and
fault-tolerance by replicating each shard across several servers. A key
component of such systems is a Transaction Certification Service (TCS), which
atomically commits a transaction spanning multiple shards. Existing TCS
protocols require 2f+1 crash-stop replicas per shard to tolerate f failures. In
this paper we present atomic commit protocols that require only f+1 replicas
and reconfigure the system upon failures using an external reconfiguration
service. We furthermore rigorously prove that these protocols correctly
implement a recently proposed TCS specification. We present protocols in two
different models--the standard asynchronous message-passing model and a model
with Remote Direct Memory Access (RDMA), which allows a machine to access the
memory of another machine over the network without involving the latter's CPU.
Our protocols are inspired by a recent FARM system for RDMA-based transaction
processing. Our work codifies the core ideas of FARM as distributed TCS
protocols, rigorously proves them correct and highlights the trade-offs
required by the use of RDMA.
","[{'version': 'v1', 'created': 'Tue, 4 Jun 2019 12:07:26 GMT'}]",2019-06-05,"[['Bravo', 'Manuel', ''], ['Gotsman', 'Alexey', '']]","['Atomic commit', 'vertical Paxos', 'RDMA']"
11090,2206.09346,Ziwei Wu,"Ziwei Wu, Jingrui He",Fairness-aware Model-agnostic Positive and Unlabeled Learning,,,10.1145/3531146.3533225,,cs.LG cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the increasing application of machine learning in high-stake
decision-making problems, potential algorithmic bias towards people from
certain social groups poses negative impacts on individuals and our society at
large. In the real-world scenario, many such problems involve positive and
unlabeled data such as medical diagnosis, criminal risk assessment and
recommender systems. For instance, in medical diagnosis, only the diagnosed
diseases will be recorded (positive) while others will not (unlabeled). Despite
the large amount of existing work on fairness-aware machine learning in the
(semi-)supervised and unsupervised settings, the fairness issue is largely
under-explored in the aforementioned Positive and Unlabeled Learning (PUL)
context, where it is usually more severe. In this paper, to alleviate this
tension, we propose a fairness-aware PUL method named FairPUL. In particular,
for binary classification over individuals from two populations, we aim to
achieve similar true positive rates and false positive rates in both
populations as our fairness metric. Based on the analysis of the optimal fair
classifier for PUL, we design a model-agnostic post-processing framework,
leveraging both the positive examples and unlabeled ones. Our framework is
proven to be statistically consistent in terms of both the classification error
and the fairness metric. Experiments on the synthetic and real-world data sets
demonstrate that our framework outperforms state-of-the-art in both PUL and
fair classification.
","[{'version': 'v1', 'created': 'Sun, 19 Jun 2022 08:04:23 GMT'}]",2022-06-22,"[['Wu', 'Ziwei', ''], ['He', 'Jingrui', '']]","['Fairness', 'Machine Learning', 'Positive', 'Unlabeled Learning']"
11091,1909.00704,Giancarlo Ruffo,"Francesco Bergadano, Roberto Bertilone, Daniela Paolotti, Giancarlo
  Ruffo","Learning Real Estate Automated Valuation Models from Heterogeneous Data
  Sources","14 pages, 7 figures","International Journal of Real Estate Studies, 15(1), 2021",10.11113/intrest.v15n1.10,,cs.CY cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real estate appraisal is a complex and important task, that can be made more
precise and faster with the help of automated valuation tools. Usually the
value of some property is determined by taking into account both structural and
geographical characteristics. However, while geographical information is easily
found, obtaining significant structural information requires the intervention
of a real estate expert, a professional appraiser. In this paper we propose a
Web data acquisition methodology, and a Machine Learning model, that can be
used to automatically evaluate real estate properties. This method uses data
from previous appraisal documents, from the advertised prices of similar
properties found via Web crawling, and from open data describing the
characteristics of a corresponding geographical area. We describe a case study,
applicable to the whole Italian territory, and initially trained on a data set
of individual homes located in the city of Turin, and analyze prediction and
practical applicability.
","[{'version': 'v1', 'created': 'Mon, 2 Sep 2019 13:16:51 GMT'}]",2021-09-17,"[['Bergadano', 'Francesco', ''], ['Bertilone', 'Roberto', ''], ['Paolotti', 'Daniela', ''], ['Ruffo', 'Giancarlo', '']]","['Real Estate Automated Valuation Models', 'Data Mining', 'Open Data', 'Ensemble Learning', 'Web Crawling']"
11092,2204.03096,Shuai Wang,"Shuai Wang, Harrisen Scells, Justin Clark, Bevan Koopman, Guido Zuccon","From Little Things Big Things Grow: A Collection with Seed Studies for
  Medical Systematic Review Literature Search",Accepted and To be appeared in SIGIR 2022 proceeding,,10.1145/3477495.3531748,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Medical systematic review query formulation is a highly complex task done by
trained information specialists. Complexity comes from the reliance on lengthy
Boolean queries, which express a detailed research question. To aid query
formulation, information specialists use a set of exemplar documents, called
`seed studies', prior to query formulation. Seed studies help verify the
effectiveness of a query prior to the full assessment of retrieved studies.
Beyond this use of seeds, specific IR methods can exploit seed studies for
guiding both automatic query formulation and new retrieval models. One major
limitation of work to date is that these methods exploit `pseudo seed studies'
through retrospective use of included studies (i.e., relevance assessments).
However, we show pseudo seed studies are not representative of real seed
studies used by information specialists. Hence, we provide a test collection
with real world seed studies used to assist with the formulation of queries. To
support our collection, we provide an analysis, previously not possible, on how
seed studies impact retrieval and perform several experiments using seed-study
based methods to compare the effectiveness of using seed studies versus pseudo
seed studies. We make our test collection and the results of all of our
experiments and analysis available at
http://github.com/ielab/sysrev-seed-collection
","[{'version': 'v1', 'created': 'Wed, 6 Apr 2022 21:23:08 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Apr 2022 00:58:53 GMT'}]",2022-04-26,"[['Wang', 'Shuai', ''], ['Scells', 'Harrisen', ''], ['Clark', 'Justin', ''], ['Koopman', 'Bevan', ''], ['Zuccon', 'Guido', '']]","['Systematic Reviews', 'Test Collection', 'Seed Studies']"
11093,2202.06562,Philipp Straubinger,"Philipp Straubinger, Gordon Fraser",Gamekins: Gamifying Software Testing in Jenkins,,,10.1145/3510454.3516862,,cs.SE,http://creativecommons.org/licenses/by-sa/4.0/,"  Developers have to write thorough tests for their software in order to find
bugs and to prevent regressions. Writing tests, however, is not every
developer's favourite occupation, and if a lack of motivation leads to a lack
of tests, then this may have dire consequences, such as programs with poor
quality or even project failures. This paper introduces Gamekins, a tool that
uses gamification to motivate developers to write more and better tests.
Gamekins is integrated into the Jenkins continuous integration platform where
game elements are based on commits to the source code repository: Developers
can earn points for completing test challenges and quests posed by Gamekins,
compete with other developers or developer teams on a leaderboard, and are
rewarded for their test-related achievements.
","[{'version': 'v1', 'created': 'Mon, 14 Feb 2022 09:00:58 GMT'}]",2022-02-15,"[['Straubinger', 'Philipp', ''], ['Fraser', 'Gordon', '']]","['Software Testing', 'Gamification', 'Continuous Integration', 'Motivation']"
11094,2002.09925,Yue Jiang,"Yue Jiang, Wolfgang Stuerzlinger, Matthias Zwicker, Christof Lutteroth","ORCSolver: An Efficient Solver for Adaptive GUI Layout with
  OR-Constraints",Published at CHI2020,,10.1145/3313831.3376610,,cs.HC cs.AI cs.DS cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  OR-constrained (ORC) graphical user interface layouts unify conventional
constraint-based layouts with flow layouts, which enables the definition of
flexible layouts that adapt to screens with different sizes, orientations, or
aspect ratios with only a single layout specification. Unfortunately, solving
ORC layouts with current solvers is time-consuming and the needed time
increases exponentially with the number of widgets and constraints. To address
this challenge, we propose ORCSolver, a novel solving technique for adaptive
ORC layouts, based on a branch-and-bound approach with heuristic preprocessing.
We demonstrate that ORCSolver simplifies ORC specifications at runtime and our
approach can solve ORC layout specifications efficiently at near-interactive
rates.
","[{'version': 'v1', 'created': 'Sun, 23 Feb 2020 15:46:59 GMT'}]",2022-02-23,"[['Jiang', 'Yue', ''], ['Stuerzlinger', 'Wolfgang', ''], ['Zwicker', 'Matthias', ''], ['Lutteroth', 'Christof', '']]","['GUI builder', 'layout manager', 'constraint-based layout', 'visualinterface design', 'visual programming', 'optimization']"
11095,2107.09225,Shaohao Lu,"Shaohao Lu, Yuqiao Xian, Ke Yan, Yi Hu, Xing Sun, Xiaowei Guo, Feiyue
  Huang, Wei-Shi Zheng",Discriminator-Free Generative Adversarial Attack,"9 pages, 6 figures, 4 tables",,10.1145/3474085.3475290,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The Deep Neural Networks are vulnerable toadversarial exam-ples(Figure 1),
making the DNNs-based systems collapsed byadding the inconspicuous
perturbations to the images. Most of the existing works for adversarial attack
are gradient-based and suf-fer from the latency efficiencies and the load on
GPU memory. Thegenerative-based adversarial attacks can get rid of this
limitation,and some relative works propose the approaches based on GAN.However,
suffering from the difficulty of the convergence of train-ing a GAN, the
adversarial examples have either bad attack abilityor bad visual quality. In
this work, we find that the discriminatorcould be not necessary for
generative-based adversarial attack, andpropose theSymmetric Saliency-based
Auto-Encoder (SSAE)to generate the perturbations, which is composed of the
saliencymap module and the angle-norm disentanglement of the featuresmodule.
The advantage of our proposed method lies in that it is notdepending on
discriminator, and uses the generative saliency map to pay more attention to
label-relevant regions. The extensive exper-iments among the various tasks,
datasets, and models demonstratethat the adversarial examples generated by SSAE
not only make thewidely-used models collapse, but also achieves good visual
quality.The code is available at https://github.com/BravoLu/SSAE.
","[{'version': 'v1', 'created': 'Tue, 20 Jul 2021 01:55:21 GMT'}]",2021-07-21,"[['Lu', 'Shaohao', ''], ['Xian', 'Yuqiao', ''], ['Yan', 'Ke', ''], ['Hu', 'Yi', ''], ['Sun', 'Xing', ''], ['Guo', 'Xiaowei', ''], ['Huang', 'Feiyue', ''], ['Zheng', 'Wei-Shi', '']]","['adversarial attack', 'image classification', 'person re-identification']"
11096,2007.14769,Zijun Wu,"Zijun Wu, Rolf H. Moehring, Chunying Ren and Dachuan Xu","A convergence analysis of the price of anarchy in atomic congestion
  games",57 pages,"Mathematical Programming, 2022",10.1007/s10107-022-01853-0,,cs.GT econ.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper provides a comprehensive convergence analysis of the PoA of both
pure and mixed Nash equilibria in atomic congestion games with unsplittable
demands.
","[{'version': 'v1', 'created': 'Tue, 28 Jul 2020 04:31:43 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Jul 2021 12:05:03 GMT'}, {'version': 'v3', 'created': 'Thu, 9 Dec 2021 00:41:46 GMT'}]",2022-06-24,"[['Wu', 'Zijun', ''], ['Moehring', 'Rolf H.', ''], ['Ren', 'Chunying', ''], ['Xu', 'Dachuan', '']]","['atomic congestion games', 'pure and mixed Nash equilibria', 'price of anarchy']"
11097,1909.05136,Haijun Yu,"Bo Li, Shanshan Tang and Haijun Yu","PowerNet: Efficient Representations of Polynomials and Smooth Functions
  by Deep Neural Networks with Rectified Power Units","22 pages, 3 figures. arXiv admin note: text overlap with
  arXiv:1903.05858","J. Math. Study Vol. 53, No. 2, pp. 159-191, 2020",10.4208/jms.v53n2.20.03,,cs.LG cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural network with rectified linear units (ReLU) is getting more and
more popular recently. However, the derivatives of the function represented by
a ReLU network are not continuous, which limit the usage of ReLU network to
situations only when smoothness is not required. In this paper, we construct
deep neural networks with rectified power units (RePU), which can give better
approximations for smooth functions. Optimal algorithms are proposed to
explicitly build neural networks with sparsely connected RePUs, which we call
PowerNets, to represent polynomials with no approximation error. For general
smooth functions, we first project the function to their polynomial
approximations, then use the proposed algorithms to construct corresponding
PowerNets. Thus, the error of best polynomial approximation provides an upper
bound of the best RePU network approximation error. For smooth functions in
higher dimensional Sobolev spaces, we use fast spectral transforms for
tensor-product grid and sparse grid discretization to get polynomial
approximations. Our constructive algorithms show clearly a close connection
between spectral methods and deep neural networks: a PowerNet with $n$ layers
can exactly represent polynomials up to degree $s^n$, where $s$ is the power of
RePUs. The proposed PowerNets have potential applications in the situations
where high-accuracy is desired or smoothness is required.
","[{'version': 'v1', 'created': 'Mon, 9 Sep 2019 05:21:49 GMT'}]",2020-12-03,"[['Li', 'Bo', ''], ['Tang', 'Shanshan', ''], ['Yu', 'Haijun', '']]","['deep neural network', 'rectified linear unit', 'rectified power unit', 'sparse grid', 'PowerNet']"
11098,2108.06259,Frederik Dennig,"Frederik L. Dennig, Eren Cakmak, Henrik Plate, Daniel A. Keim","VulnEx: Exploring Open-Source Software Vulnerabilities in Large
  Development Organizations to Understand Risk Exposure","5 pages, 3 figures, LaTeX; corrected typos and wording; added DOI",2021 IEEE Symposium on Visualization for Cyber Security (VizSec),10.1109/VizSec53666.2021.00014,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The prevalent usage of open-source software (OSS) has led to an increased
interest in resolving potential third-party security risks by fixing common
vulnerabilities and exposures (CVEs). However, even with automated code
analysis tools in place, security analysts often lack the means to obtain an
overview of vulnerable OSS reuse in large software organizations. In this
design study, we propose VulnEx (Vulnerability Explorer), a tool to audit
entire software development organizations. We introduce three complementary
table-based representations to identify and assess vulnerability exposures due
to OSS, which we designed in collaboration with security analysts. The
presented tool allows examining problematic projects and applications
(repositories), third-party libraries, and vulnerabilities across a software
organization. We show the applicability of our tool through a use case and
preliminary expert feedback.
","[{'version': 'v1', 'created': 'Fri, 13 Aug 2021 14:17:15 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Sep 2021 12:16:07 GMT'}, {'version': 'v3', 'created': 'Tue, 15 Nov 2022 12:14:21 GMT'}]",2022-11-16,"[['Dennig', 'Frederik L.', ''], ['Cakmak', 'Eren', ''], ['Plate', 'Henrik', ''], ['Keim', 'Daniel A.', '']]","['Software security visualization', 'application security', 'open-source', 'vulnerability exposure analysis', 'software auditing']"
11099,1702.06398,Nitish Prajapati,"Ayub Khan, Dinesh Khattar, Nitish Prajapati","Dual combination combination multi switching synchronization of eight
  chaotic systems","19 pages, 7 figures",,10.1016/j.cjph.2017.06.002,,cs.SY math.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a novel scheme for synchronizing four drive and four response
systems is proposed by the authors. The idea of multi switching and dual
combination synchronization is extended to dual combination-combination multi
switching synchronization involving eight chaotic systems and is a first of its
kind. Due to the multiple combination of chaotic systems and multi switching
the resultant dynamic behaviour is so complex that, in communication theory,
transmission and security of the resultant signal is more effective. Using
Lyapunov stability theory, sufficient conditions are achieved and suitable
controllers are designed to realise the desired synchronization. Corresponding
theoretical analysis is presented and numerical simulations performed to
demonstrate the effectiveness of the proposed scheme.
","[{'version': 'v1', 'created': 'Fri, 17 Feb 2017 11:32:47 GMT'}]",2017-08-02,"[['Khan', 'Ayub', ''], ['Khattar', 'Dinesh', ''], ['Prajapati', 'Nitish', '']]","['Chaos synchronization', 'multi switching synchronization', 'combination combination synchronization', 'dual synchronization', 'nonlinearcontrol']"
11100,2108.03788,Zhongwei Xie,"Zhongwei Xie, Ling Liu, Lin Li, Luo Zhong","Learning Joint Embedding with Modality Alignments for Cross-Modal
  Retrieval of Recipes and Food Images","accepted by CIKM 2021. arXiv admin note: substantial text overlap
  with arXiv:2108.00705",,10.1145/3459637.3482270,,cs.CV cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a three-tier modality alignment approach to learning
text-image joint embedding, coined as JEMA, for cross-modal retrieval of
cooking recipes and food images. The first tier improves recipe text embedding
by optimizing the LSTM networks with term extraction and ranking enhanced
sequence patterns, and optimizes the image embedding by combining the
ResNeXt-101 image encoder with the category embedding using wideResNet-50 with
word2vec. The second tier modality alignment optimizes the textual-visual joint
embedding loss function using a double batch-hard triplet loss with soft-margin
optimization. The third modality alignment incorporates two types of
cross-modality alignments as the auxiliary loss regularizations to further
reduce the alignment errors in the joint learning of the two modality-specific
embedding functions. The category-based cross-modal alignment aims to align the
image category with the recipe category as a loss regularization to the joint
embedding. The cross-modal discriminator-based alignment aims to add the
visual-textual embedding distribution alignment to further regularize the joint
embedding loss. Extensive experiments with the one-million recipes benchmark
dataset Recipe1M demonstrate that the proposed JEMA approach outperforms the
state-of-the-art cross-modal embedding methods for both image-to-recipe and
recipe-to-image retrievals.
","[{'version': 'v1', 'created': 'Mon, 9 Aug 2021 03:11:54 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Aug 2021 07:11:14 GMT'}]",2021-08-19,"[['Xie', 'Zhongwei', ''], ['Liu', 'Ling', ''], ['Li', 'Lin', ''], ['Zhong', 'Luo', '']]","['cross-modal retrieval', 'modality alignment', 'multi-modal learning']"
11101,2111.04282,Danni Peng,"Danni Peng, Sinno Jialin Pan, Jie Zhang and Anxiang Zeng","Learning an Adaptive Meta Model-Generator for Incrementally Updating
  Recommender Systems","11 pages, 6 figures, accepted by RecSys 2021",,10.1145/3460231.3474239,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender Systems (RSs) in real-world applications often deal with billions
of user interactions daily. To capture the most recent trends effectively, it
is common to update the model incrementally using only the newly arrived data.
However, this may impede the model's ability to retain long-term information
due to the potential overfitting and forgetting issues. To address this
problem, we propose a novel Adaptive Sequential Model Generation (ASMG)
framework, which generates a better serving model from a sequence of historical
models via a meta generator. For the design of the meta generator, we propose
to employ Gated Recurrent Units (GRUs) to leverage its ability to capture the
long-term dependencies. We further introduce some novel strategies to apply
together with the GRU meta generator, which not only improve its computational
efficiency but also enable more accurate sequential modeling. By instantiating
the model-agnostic framework on a general deep learning-based RS model, we
demonstrate that our method achieves state-of-the-art performance on three
public datasets and one industrial dataset.
","[{'version': 'v1', 'created': 'Mon, 8 Nov 2021 05:54:46 GMT'}]",2021-11-09,"[['Peng', 'Danni', ''], ['Pan', 'Sinno Jialin', ''], ['Zhang', 'Jie', ''], ['Zeng', 'Anxiang', '']]","['Incremental Training', 'Continual Learning', 'Meta Learning']"
11102,2001.08298,Zana Bu\c{c}inca,"Zana Bu\c{c}inca, Phoebe Lin, Krzysztof Z. Gajos, Elena L. Glassman","Proxy Tasks and Subjective Measures Can Be Misleading in Evaluating
  Explainable AI Systems",,,10.1145/3377325.3377498,,cs.AI cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Explainable artificially intelligent (XAI) systems form part of
sociotechnical systems, e.g., human+AI teams tasked with making decisions. Yet,
current XAI systems are rarely evaluated by measuring the performance of
human+AI teams on actual decision-making tasks. We conducted two online
experiments and one in-person think-aloud study to evaluate two currently
common techniques for evaluating XAI systems: (1) using proxy, artificial tasks
such as how well humans predict the AI's decision from the given explanations,
and (2) using subjective measures of trust and preference as predictors of
actual performance. The results of our experiments demonstrate that evaluations
with proxy tasks did not predict the results of the evaluations with the actual
decision-making tasks. Further, the subjective measures on evaluations with
actual decision-making tasks did not predict the objective performance on those
same tasks. Our results suggest that by employing misleading evaluation
methods, our field may be inadvertently slowing its progress toward developing
human+AI teams that can reliably perform better than humans or AIs alone.
","[{'version': 'v1', 'created': 'Wed, 22 Jan 2020 22:14:28 GMT'}]",2020-01-24,"[['Buçinca', 'Zana', ''], ['Lin', 'Phoebe', ''], ['Gajos', 'Krzysztof Z.', ''], ['Glassman', 'Elena L.', '']]","['explanations', 'artifcial intelligence', 'trust']"
11103,2002.08434,Vikram Shree,"Vikram Shree, Wei-Lun Chao and Mark Campbell",Interactive Natural Language-based Person Search,"8 pages, 12 figures, Published in IEEE Robotics and Automation
  Letters (RA-L), ""Dataset at:
  https://github.com/vikshree/QA_PersonSearchLanguageData"" , Video attachment
  at: https://www.youtube.com/watch?v=Yyxu8uVUREE&feature=youtu.be","in IEEE Robotics and Automation Letters, vol. 5, no. 2, pp.
  1851-1858, April 2020",10.1109/LRA.2020.2969921,,cs.RO cs.CL cs.CV cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we consider the problem of searching people in an unconstrained
environment, with natural language descriptions. Specifically, we study how to
systematically design an algorithm to effectively acquire descriptions from
humans. An algorithm is proposed by adapting models, used for visual and
language understanding, to search a person of interest (POI) in a principled
way, achieving promising results without the need to re-design another
complicated model. We then investigate an iterative question-answering (QA)
strategy that enable robots to request additional information about the POI's
appearance from the user. To this end, we introduce a greedy algorithm to rank
questions in terms of their significance, and equip the algorithm with the
capability to dynamically adjust the length of human-robot interaction
according to model's uncertainty. Our approach is validated not only on
benchmark datasets but on a mobile robot, moving in a dynamic and crowded
environment.
","[{'version': 'v1', 'created': 'Wed, 19 Feb 2020 20:42:19 GMT'}]",2020-02-21,"[['Shree', 'Vikram', ''], ['Chao', 'Wei-Lun', ''], ['Campbell', 'Mark', '']]","['AI-based Methods', 'HumanDetection and Tracking', 'Cognitive Human-Robot Interaction']"
11104,2005.08874,Tobias Huber,"Tobias Huber, Katharina Weitz, Elisabeth Andr\'e, Ofra Amir","Local and Global Explanations of Agent Behavior: Integrating Strategy
  Summaries with Saliency Maps",,,10.1016/j.artint.2021.103571,,cs.LG cs.AI cs.HC cs.NE stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  With advances in reinforcement learning (RL), agents are now being developed
in high-stakes application domains such as healthcare and transportation.
Explaining the behavior of these agents is challenging, as the environments in
which they act have large state spaces, and their decision-making can be
affected by delayed rewards, making it difficult to analyze their behavior. To
address this problem, several approaches have been developed. Some approaches
attempt to convey the $\textit{global}$ behavior of the agent, describing the
actions it takes in different states. Other approaches devised $\textit{local}$
explanations which provide information regarding the agent's decision-making in
a particular state. In this paper, we combine global and local explanation
methods, and evaluate their joint and separate contributions, providing (to the
best of our knowledge) the first user study of combined local and global
explanations for RL agents. Specifically, we augment strategy summaries that
extract important trajectories of states from simulations of the agent with
saliency maps which show what information the agent attends to. Our results
show that the choice of what states to include in the summary (global
information) strongly affects people's understanding of agents: participants
shown summaries that included important states significantly outperformed
participants who were presented with agent behavior in a randomly set of chosen
world-states. We find mixed results with respect to augmenting demonstrations
with saliency maps (local information), as the addition of saliency maps did
not significantly improve performance in most cases. However, we do find some
evidence that saliency maps can help users better understand what information
the agent relies on in its decision making, suggesting avenues for future work
that can further improve explanations of RL agents.
","[{'version': 'v1', 'created': 'Mon, 18 May 2020 16:44:55 GMT'}, {'version': 'v2', 'created': 'Tue, 19 May 2020 17:34:10 GMT'}, {'version': 'v3', 'created': 'Fri, 29 May 2020 17:54:59 GMT'}]",2022-02-03,"[['Huber', 'Tobias', ''], ['Weitz', 'Katharina', ''], ['André', 'Elisabeth', ''], ['Amir', 'Ofra', '']]","['Explainable AI', 'Strategy Summarization', 'Saliency Maps', 'Reinforcement Learning', 'Deep Learning']"
11105,2106.00583,Aitor Arjona,"Aitor Arjona, Pedro Garc\'ia-L\'opez, Josep Samp\'e, Aleksander
  Slominski and Lionel Villard",Triggerflow: Trigger-based Orchestration of Serverless Workflows,"17 pages, 17 figures, preprint submitted to Future Generation
  Computer Systems. arXiv admin note: substantial text overlap with
  arXiv:2006.08654","Future Generation Computer Systems, Volume 124, November 2021,
  Pages 215-229",10.1016/j.future.2021.06.004,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  As more applications are being moved to the Cloud thanks to serverless
computing, it is increasingly necessary to support the native life cycle
execution of those applications in the data center. But existing cloud
orchestration systems either focus on short-running workflows (like IBM
Composer or Amazon Step Functions Express Workflows) or impose considerable
overheads for synchronizing massively parallel jobs (Azure Durable Functions,
Amazon Step Functions). None of them are open systems enabling extensible
interception and optimization of custom workflows. We present Triggerflow: an
extensible Trigger-based Orchestration architecture for serverless workflows.
We demonstrate that Triggerflow is a novel serverless building block capable of
constructing different reactive orchestrators (State Machines, Directed Acyclic
Graphs, Workflow as code, Federated Learning orchestrator). We also validate
that it can support high-volume event processing workloads, auto-scale on
demand with scale down to zero when not used, and transparently guarantee fault
tolerance and efficient resource usage when orchestrating long running
scientific workflows.
","[{'version': 'v1', 'created': 'Tue, 1 Jun 2021 15:50:22 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Jun 2021 08:30:08 GMT'}]",2021-06-23,"[['Arjona', 'Aitor', ''], ['García-López', 'Pedro', ''], ['Sampé', 'Josep', ''], ['Slominski', 'Aleksander', ''], ['Villard', 'Lionel', '']]","['Event-Based', 'Orchestration', 'Serverless']"
11106,2004.08333,Alireza Borjali,"Alireza Borjali, Martin Magneli, David Shin, Henrik Malchau, Orhun K.
  Muratoglu, Kartik M. Varadarajan","Natural Language Processing with Deep Learning for Medical Adverse Event
  Detection from Free-Text Medical Narratives: A Case Study of Detecting Total
  Hip Replacement Dislocation",,,10.1016/j.compbiomed.2020.104140,,cs.CL cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate and timely detection of medical adverse events (AEs) from free-text
medical narratives is challenging. Natural language processing (NLP) with deep
learning has already shown great potential for analyzing free-text data, but
its application for medical AE detection has been limited. In this study we
proposed deep learning based NLP (DL-NLP) models for efficient and accurate hip
dislocation AE detection following total hip replacement from standard
(radiology notes) and non-standard (follow-up telephone notes) free-text
medical narratives. We benchmarked these proposed models with a wide variety of
traditional machine learning based NLP (ML-NLP) models, and also assessed the
accuracy of International Classification of Diseases (ICD) and Current
Procedural Terminology (CPT) codes in capturing these hip dislocation AEs in a
multi-center orthopaedic registry. All DL-NLP models out-performed all of the
ML-NLP models, with a convolutional neural network (CNN) model achieving the
best overall performance (Kappa = 0.97 for radiology notes, and Kappa = 1.00
for follow-up telephone notes). On the other hand, the ICD/CPT codes of the
patients who sustained a hip dislocation AE were only 75.24% accurate, showing
the potential of the proposed model to be used in largescale orthopaedic
registries for accurate and efficient hip dislocation AE detection to improve
the quality of care and patient outcome.
","[{'version': 'v1', 'created': 'Fri, 17 Apr 2020 16:25:36 GMT'}, {'version': 'v2', 'created': 'Sun, 26 Apr 2020 18:54:36 GMT'}]",2020-11-26,"[['Borjali', 'Alireza', ''], ['Magneli', 'Martin', ''], ['Shin', 'David', ''], ['Malchau', 'Henrik', ''], ['Muratoglu', 'Orhun K.', ''], ['Varadarajan', 'Kartik M.', '']]","['Medical Adverse Event', 'Natural Language Processing', 'Deep learning', 'Hip Dislocation', 'Electronic Medical Records', 'CNN', 'RNN', 'LSTM']"
11107,2005.00463,George Awad,"Keith Curtis, George Awad, Shahzad Rajput, and Ian Soboroff","HLVU : A New Challenge to Test Deep Understanding of Movies the Way
  Humans do",,,10.1145/3372278.3390742,,cs.AI cs.CL cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a new evaluation challenge and direction in the area
of High-level Video Understanding. The challenge we are proposing is designed
to test automatic video analysis and understanding, and how accurately systems
can comprehend a movie in terms of actors, entities, events and their
relationship to each other. A pilot High-Level Video Understanding (HLVU)
dataset of open source movies were collected for human assessors to build a
knowledge graph representing each of them. A set of queries will be derived
from the knowledge graph to test systems on retrieving relationships among
actors, as well as reasoning and retrieving non-visual concepts. The objective
is to benchmark if a computer system can ""understand"" non-explicit but obvious
relationships the same way humans do when they watch the same movies. This is
long-standing problem that is being addressed in the text domain and this
project moves similar research to the video domain. Work of this nature is
foundational to future video analytics and video understanding technologies.
This work can be of interest to streaming services and broadcasters hoping to
provide more intuitive ways for their customers to interact with and consume
video content.
","[{'version': 'v1', 'created': 'Fri, 1 May 2020 15:58:13 GMT'}]",2020-09-15,"[['Curtis', 'Keith', ''], ['Awad', 'George', ''], ['Rajput', 'Shahzad', ''], ['Soboroff', 'Ian', '']]","['video understanding', 'multimedia', 'information retrieval', 'video ontology']"
11108,2105.00714,Feng Xia,"Dongyu Zhang, Minghao Zhang, Ciyuan Peng, Jason J. Jung, Feng Xia",Metaphor Research in the 21st Century: A Bibliographic Analysis,"19 pages, 14 figures","Computer Science and Information Systems. 18(1):303-321, 2021",10.2298/CSIS201109059Z,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Metaphor is widely used in human communication. The cohort of scholars
studying metaphor in various fields is continuously growing, but very few work
has been done in bibliographical analysis of metaphor research. This paper
examines the advancements in metaphor research from 2000 to 2017. Using data
retrieved from Microsoft Academic Graph and Web of Science, this paper makes a
macro analysis of metaphor research, and expounds the underlying patterns of
its development. Taking into consideration sub-fields of metaphor research, the
internal analysis of metaphor research is carried out from a micro perspective
to reveal the evolution of research topics and the inherent relationships among
them. This paper provides novel insights into the current state of the art of
metaphor research as well as future trends in this field, which may spark new
research interests in metaphor from both linguistic and interdisciplinary
perspectives.
","[{'version': 'v1', 'created': 'Mon, 3 May 2021 09:45:41 GMT'}]",2021-05-04,"[['Zhang', 'Dongyu', ''], ['Zhang', 'Minghao', ''], ['Peng', 'Ciyuan', ''], ['Jung', 'Jason J.', ''], ['Xia', 'Feng', '']]","['metaphor', 'literature analysis', 'statistical analysis', 'scholarly big data']"
11109,2006.14553,Danielle Gonzalez,"Danielle Gonzalez, Michael Rath, Mehdi Mirakhorli",Did You Remember to Test Your Tokens?,"In 17th International Conference on Mining Software Repositories
  (MSR) 2020, Technical Track, Virtual. 11 pages",,10.1145/3379597.3387471,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Authentication is a critical security feature for confirming the identity of
a system's users, typically implemented with help from frameworks like Spring
Security. It is a complex feature which should be robustly tested at all stages
of development. Unit testing is an effective technique for fine-grained
verification of feature behaviors that is not widely-used to test
authentication. Part of the problem is that resources to help developers unit
test security features are limited. Most security testing guides recommend test
cases in a ""black box"" or penetration testing perspective. These resources are
not easily applicable to developers writing new unit tests, or who want a
security-focused perspective on coverage.
  In this paper, we address these issues by applying a grounded theory-based
approach to identify common (unit) test cases for token authentication through
analysis of 481 JUnit tests exercising Spring Security-based authentication
implementations from 53 open source Java projects. The outcome of this study is
a developer-friendly unit testing guide organized as a catalog of 53 test cases
for token authentication, representing unique combinations of 17 scenarios, 40
conditions, and 30 expected outcomes learned from the data set in our analysis.
We supplement the test guide with common test smells to avoid. To verify the
accuracy and usefulness of our testing guide, we sought feedback from selected
developers, some of whom authored unit tests in our dataset.
","[{'version': 'v1', 'created': 'Thu, 25 Jun 2020 16:52:33 GMT'}]",2020-06-26,"[['Gonzalez', 'Danielle', ''], ['Rath', 'Michael', ''], ['Mirakhorli', 'Mehdi', '']]","['Repository Mining', 'Unit Test', 'Java', 'Authentication', 'Security Test']"
11110,2009.06756,Justin Harris,Justin D. Harris,Analysis of Models for Decentralized and Collaborative AI on Blockchain,Accepted to ICBC 2020,,10.1007/978-3-030-59638-5_10,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning has recently enabled large advances in artificial
intelligence, but these results can be highly centralized. The large datasets
required are generally proprietary; predictions are often sold on a per-query
basis; and published models can quickly become out of date without effort to
acquire more data and maintain them. Published proposals to provide models and
data for free for certain tasks include Microsoft Research's Decentralized and
Collaborative AI on Blockchain. The framework allows participants to
collaboratively build a dataset and use smart contracts to share a continuously
updated model on a public blockchain. The initial proposal gave an overview of
the framework omitting many details of the models used and the incentive
mechanisms in real world scenarios. In this work, we evaluate the use of
several models and configurations in order to propose best practices when using
the Self-Assessment incentive mechanism so that models can remain accurate and
well-intended participants that submit correct data have the chance to profit.
We have analyzed simulations for each of three models: Perceptron, Na\""ive
Bayes, and a Nearest Centroid Classifier, with three different datasets:
predicting a sport with user activity from Endomondo, sentiment analysis on
movie reviews from IMDB, and determining if a news article is fake. We compare
several factors for each dataset when models are hosted in smart contracts on a
public blockchain: their accuracy over time, balances of a good and bad user,
and transaction costs (or gas) for deploying, updating, collecting refunds, and
collecting rewards. A free and open source implementation for the Ethereum
blockchain and simulations written in Python is provided at
https://github.com/microsoft/0xDeCA10B. This version has updated gas costs
using newer optimizations written after the original publication.
","[{'version': 'v1', 'created': 'Mon, 14 Sep 2020 21:38:55 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Sep 2020 03:14:47 GMT'}]",2020-09-23,"[['Harris', 'Justin D.', '']]","['decentralized AI', 'blockchain', 'ethereum', 'crowdsourcing', 'incremental learning']"
11111,2101.09576,Efe Bozkir,"Hong Gao, Efe Bozkir, Lisa Hasenbein, Jens-Uwe Hahn, Richard
  G\""ollner, Enkelejda Kasneci",Digital Transformations of Classrooms in Virtual Reality,CHI Conference on Human Factors in Computing Systems (CHI '21),,10.1145/3411764.3445596,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With rapid developments in consumer-level head-mounted displays and computer
graphics, immersive VR has the potential to take online and remote learning
closer to real-world settings. However, the effects of such digital
transformations on learners, particularly for VR, have not been evaluated in
depth. This work investigates the interaction-related effects of sitting
positions of learners, visualization styles of peer-learners and teachers, and
hand-raising behaviors of virtual peer-learners on learners in an immersive VR
classroom, using eye tracking data. Our results indicate that learners sitting
in the back of the virtual classroom may have difficulties extracting
information. Additionally, we find indications that learners engage with
lectures more efficiently if virtual avatars are visualized with realistic
styles. Lastly, we find different eye movement behaviors towards different
performance levels of virtual peer-learners, which should be investigated
further. Our findings present an important baseline for design decisions for VR
classrooms.
","[{'version': 'v1', 'created': 'Sat, 23 Jan 2021 20:15:17 GMT'}, {'version': 'v2', 'created': 'Fri, 7 May 2021 14:55:33 GMT'}]",2021-05-10,"[['Gao', 'Hong', ''], ['Bozkir', 'Efe', ''], ['Hasenbein', 'Lisa', ''], ['Hahn', 'Jens-Uwe', ''], ['Göllner', 'Richard', ''], ['Kasneci', 'Enkelejda', '']]","['immersive virtual reality', 'eye tracking', 'education', 'perception', 'avatars']"
11112,2007.09483,Emma Rocheteau,Emma Rocheteau and Pietro Li\`o and Stephanie Hyland,"Temporal Pointwise Convolutional Networks for Length of Stay Prediction
  in the Intensive Care Unit","ACM CHIL 2021 Proceedings. arXiv admin note: substantial text overlap
  with arXiv:2006.16109",,10.1145/3450439.3451860,,cs.LG cs.AI stat.ML,http://creativecommons.org/licenses/by/4.0/,"  The pressure of ever-increasing patient demand and budget restrictions make
hospital bed management a daily challenge for clinical staff. Most critical is
the efficient allocation of resource-heavy Intensive Care Unit (ICU) beds to
the patients who need life support. Central to solving this problem is knowing
for how long the current set of ICU patients are likely to stay in the unit. In
this work, we propose a new deep learning model based on the combination of
temporal convolution and pointwise (1x1) convolution, to solve the length of
stay prediction task on the eICU and MIMIC-IV critical care datasets. The model
- which we refer to as Temporal Pointwise Convolution (TPC) - is specifically
designed to mitigate common challenges with Electronic Health Records, such as
skewness, irregular sampling and missing data. In doing so, we have achieved
significant performance benefits of 18-68% (metric and dataset dependent) over
the commonly used Long-Short Term Memory (LSTM) network, and the multi-head
self-attention network known as the Transformer. By adding mortality prediction
as a side-task, we can improve performance further still, resulting in a mean
absolute deviation of 1.55 days (eICU) and 2.28 days (MIMIC-IV) on predicting
remaining length of stay.
","[{'version': 'v1', 'created': 'Sat, 18 Jul 2020 17:30:10 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Oct 2020 16:27:09 GMT'}, {'version': 'v3', 'created': 'Fri, 30 Oct 2020 15:34:14 GMT'}, {'version': 'v4', 'created': 'Wed, 24 Feb 2021 12:10:39 GMT'}]",2021-02-25,"[['Rocheteau', 'Emma', ''], ['Liò', 'Pietro', ''], ['Hyland', 'Stephanie', '']]","['Patient Outcome Prediction', 'Length of Stay', 'Mortality', 'IntensiveCare Unit', 'Temporal Convolution']"
11113,2212.11132,Enrico Zardini,"Andrea Bonomi, Thomas De Min, Enrico Zardini, Enrico Blanzieri, Valter
  Cavecchia, Davide Pastorello",Quantum Annealing Learning Search Implementations,"26 pages, 1 figure",Quantum Information and Computation 22 3-4 (2022) 181-208,10.26421/QIC22.3-4-1,,cs.ET quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the details and testing of two implementations (in C++
and Python) of the hybrid quantum-classical algorithm Quantum Annealing
Learning Search (QALS) on a D-Wave quantum annealer. QALS was proposed in 2019
as a novel technique to solve general QUBO problems that cannot be directly
represented into the hardware architecture of a D-Wave machine. Repeated calls
to the quantum machine within a classical iterative structure and a related
convergence proof originate a learning mechanism to find an encoding of a given
problem into the quantum architecture. The present work considers the Number
Partitioning Problem (NPP) and the Travelling Salesman Problem (TSP) for the
testing of QALS. The results turn out to be quite unexpected, with QALS not
being able to perform as well as the other considered methods, especially in
NPP, where classical methods outperform quantum annealing in general.
Nevertheless, looking at the TSP tests, QALS has fulfilled its primary goal,
i.e., processing QUBO problems not directly mappable to the QPU topology.
","[{'version': 'v1', 'created': 'Wed, 21 Dec 2022 15:57:16 GMT'}]",2022-12-22,"[['Bonomi', 'Andrea', ''], ['De Min', 'Thomas', ''], ['Zardini', 'Enrico', ''], ['Blanzieri', 'Enrico', ''], ['Cavecchia', 'Valter', ''], ['Pastorello', 'Davide', '']]","['Quantum Annealing', 'Quantum-Classical Hybrid Algorithm', 'Binary Optimization', 'Quantum Software', 'Empirical Evaluation']"
11114,2012.14237,Thomas Vogel,Thomas Vogel and Chinh Tran and Lars Grunske,"A Comprehensive Empirical Evaluation of Generating Test Suites for
  Mobile Applications with Diversity","Accepted Manuscript. arXiv admin note: text overlap with
  arXiv:1906.08142","Information and Software Technology, Volume 130, February 2021,
  106436",10.1016/j.infsof.2020.106436,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Context: In search-based software engineering we often use popular heuristics
with default configurations, which typically lead to suboptimal results, or we
perform experiments to identify configurations on a trial-and-error basis,
which may lead to better results for a specific problem. We consider the
problem of generating test suites for mobile applications (apps) and rely on
\Sapienz, a state-of-the-art approach to this problem that uses a popular
heuristic (NSGA-II) with a default configuration. Objective: We want to achieve
better results in generating test suites with \Sapienz while avoiding
trial-and-error experiments to identify a more suitable configuration of
\Sapienz. Method: We conducted a fitness landscape analysis of \Sapienz to
analytically understand the search problem, which allowed us to make informed
decisions about the heuristic and configuration of \Sapienz when developing
\SapienzDiv. We comprehensively evaluated \SapienzDiv in a head-to-head
comparison with \Sapienz on 34 apps. Results: Analyzing the fitness landscape
of \Sapienz, we observed a lack of diversity of the evolved test suites and a
stagnation of the search after 25 generations. \SapienzDiv realizes mechanisms
that preserve the diversity of the test suites being evolved. The evaluation
showed that \SapienzDiv achieves better or at least similar test results than
\Sapienz concerning coverage and the number of revealed faults. However,
\SapienzDiv typically produces longer test sequences and requires more
execution time than \Sapienz. Conclusions: The understanding of the search
problem obtained by the fitness landscape analysis helped us to find a more
suitable configuration of \Sapienz without trial-and-error experiments. By
promoting diversity of test suites during the search, improved or at least
similar test results in terms of faults and coverage can be achieved.
","[{'version': 'v1', 'created': 'Mon, 28 Dec 2020 14:11:48 GMT'}]",2020-12-29,"[['Vogel', 'Thomas', ''], ['Tran', 'Chinh', ''], ['Grunske', 'Lars', '']]","['Fitness Landscape Analysis', 'Diversity', 'Test Generation']"
11115,2003.07859,Saif Jabari,"Yue Wang, Esha Sarkar, Wenqing Li, Michail Maniatakos, Saif Eddin
  Jabari","Stop-and-Go: Exploring Backdoor Attacks on Deep Reinforcement
  Learning-based Traffic Congestion Control Systems",,"IEEE Transactions on Information Forensics and Security, 2021",10.1109/TIFS.2021.3114024,2021,cs.CR cs.LG cs.SY eess.SY physics.soc-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent work has shown that the introduction of autonomous vehicles (AVs) in
traffic could help reduce traffic jams. Deep reinforcement learning methods
demonstrate good performance in complex control problems, including autonomous
vehicle control, and have been used in state-of-the-art AV controllers.
However, deep neural networks (DNNs) render automated driving vulnerable to
machine learning-based attacks. In this work, we explore the
backdooring/trojanning of DRL-based AV controllers. We develop a trigger design
methodology that is based on well-established principles of traffic physics.
The malicious actions include vehicle deceleration and acceleration to cause
stop-and-go traffic waves to emerge (congestion attacks) or AV acceleration
resulting in the AV crashing into the vehicle in front (insurance attack). We
test our attack on single-lane and two-lane circuits. Our experimental results
show that the backdoored model does not compromise normal operation
performance, with the maximum decrease in cumulative rewards being 1%. Still,
it can be maliciously activated to cause a crash or congestion when the
corresponding triggers appear.
","[{'version': 'v1', 'created': 'Tue, 17 Mar 2020 08:20:43 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Jun 2020 10:47:54 GMT'}, {'version': 'v3', 'created': 'Sun, 7 Mar 2021 09:19:00 GMT'}, {'version': 'v4', 'created': 'Thu, 26 Aug 2021 10:42:36 GMT'}]",2021-09-28,"[['Wang', 'Yue', ''], ['Sarkar', 'Esha', ''], ['Li', 'Wenqing', ''], ['Maniatakos', 'Michail', ''], ['Jabari', 'Saif Eddin', '']]","['Autonomous vehicle controller', 'deep reinforcement learning', 'backdoor in neural network']"
11116,2203.14629,Mayank Patwari,"Maaynk Patwari, Panagiotis Chazistergos, Lakshmi Sundar, Nachiappan
  Chockalingam, Ambadi Ramachandran, Roozbeh Naemi","A quantitative comparison of plantar soft tissue strainability
  distribution and homogeneity between ulcerated and non-ulcerated patients
  using strain elastography","16 pages, 8 figures, 1 table, 1 appendix","Proceedings of the Institution of Mechanical Engineers, Part H:
  Journal of Engineering in Medicine. February 2022",10.1177/09544119221074786,,cs.CV cs.RO,http://creativecommons.org/licenses/by/4.0/,"  The primary objective of this study was to develop a method that allows
accurate quantification of plantar soft tissue stiffness distribution and
homogeneity. The secondary aim of this study is to investigate if the
differences in soft tissue stiffness distribution and homogeneity can be
detected between ulcerated and non-ulcerated foot. Novel measures of individual
pixel stiffness, named as quantitative strainability (QS) and relative
strainability (RS) were developed. SE data obtained from 39 (9 with active
diabetic foot ulcers) patients with diabetic neuropathy. The patients with
active diabetic foot ulcer had wound in parts of the foot other than the first
metatarsal head and the heel where the elastography measures were conducted. RS
was used to measure changes and gradients in the stiffness distribution of
plantar soft tissues in participants with and without active diabetic foot
ulcer. The plantar soft tissue homogeneity in superior-inferior direction in
the left forefoot was significantly (p<0.05) higher in ulcerated group compared
to non-ulcerated group. The assessment of homogeneity showed potentials to
further explain the nature of the change in tissue that can increase internal
stress . This can have implications in assessing the vulnerability to soft
tissue damage and ulceration in diabetes.
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2022 10:31:44 GMT'}]",2022-03-29,"[['Patwari', 'Maaynk', ''], ['Chazistergos', 'Panagiotis', ''], ['Sundar', 'Lakshmi', ''], ['Chockalingam', 'Nachiappan', ''], ['Ramachandran', 'Ambadi', ''], ['Naemi', 'Roozbeh', '']]","['diabetes', 'elastography', 'homogeneity', 'plantar tissue', 'quantitative', 'strainability', 'strain elastography']"
11117,2207.14139,James Cheney,James Cheney and Maribel Fern\'andez,Nominal Matching Logic,"To appear, PPDP 2022",,10.1145/3551357.3551375,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce Nominal Matching Logic (NML) as an extension of Matching Logic
with names and binding following the Gabbay-Pitts nominal approach. Matching
logic is the foundation of the $\mathbb{K}$ framework, used to specify
programming languages and automatically derive associated tools (compilers,
debuggers, model checkers, program verifiers). Matching logic does not include
a primitive notion of name binding, though binding operators can be represented
via an encoding that internalises the graph of a function from bound names to
expressions containing bound names. This approach is sufficient to represent
computations involving binding operators, but has not been reconciled with
support for inductive reasoning over syntax with binding (e.g., reasoning over
$\lambda$-terms). Nominal logic is a formal system for reasoning about names
and binding, which provides well-behaved and powerful principles for inductive
reasoning over syntax with binding, and NML inherits these principles. We
discuss design alternatives for the syntax and the semantics of NML, prove
meta-theoretical properties and give examples to illustrate its expressive
power. In particular, we show how induction principles for $\lambda$-terms
($\alpha$-structural induction) can be defined and used to prove standard
properties of the $\lambda$-calculus.
","[{'version': 'v1', 'created': 'Thu, 28 Jul 2022 14:59:29 GMT'}]",2022-07-29,"[['Cheney', 'James', ''], ['Fernández', 'Maribel', '']]","['Binding operator', 'Matching Logic', 'Nominal Logic', 'Lambda-Calculus', 'Verification']"
11118,2111.12122,Osmar Luiz De Carvalho,"Osmar Luiz Ferreira de Carvalho, Osmar Ab\'ilio de Carvalho J\'unior,
  Anesmar Olino de Albuquerque, Nickolas Castro Santana, Dibio Leandro Borges,
  Roberto Arnaldo Trancoso Gomes, Renato Fontes Guimar\~aes","Bounding Box-Free Instance Segmentation Using Semi-Supervised Learning
  for Generating a City-Scale Vehicle Dataset","38 pages, 10 figures, submitted to journal",,10.1109/JSTARS.2022.3169128,,cs.CV cs.AI cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vehicle classification is a hot computer vision topic, with studies ranging
from ground-view up to top-view imagery. In remote sensing, the usage of
top-view images allows for understanding city patterns, vehicle concentration,
traffic management, and others. However, there are some difficulties when
aiming for pixel-wise classification: (a) most vehicle classification studies
use object detection methods, and most publicly available datasets are designed
for this task, (b) creating instance segmentation datasets is laborious, and
(c) traditional instance segmentation methods underperform on this task since
the objects are small. Thus, the present research objectives are: (1) propose a
novel semi-supervised iterative learning approach using GIS software, (2)
propose a box-free instance segmentation approach, and (3) provide a city-scale
vehicle dataset. The iterative learning procedure considered: (1) label a small
number of vehicles, (2) train on those samples, (3) use the model to classify
the entire image, (4) convert the image prediction into a polygon shapefile,
(5) correct some areas with errors and include them in the training data, and
(6) repeat until results are satisfactory. To separate instances, we considered
vehicle interior and vehicle borders, and the DL model was the U-net with the
Efficient-net-B7 backbone. When removing the borders, the vehicle interior
becomes isolated, allowing for unique object identification. To recover the
deleted 1-pixel borders, we proposed a simple method to expand each prediction.
The results show better pixel-wise metrics when compared to the Mask-RCNN (82%
against 67% in IoU). On per-object analysis, the overall accuracy, precision,
and recall were greater than 90%. This pipeline applies to any remote sensing
target, being very efficient for segmentation and generating datasets.
","[{'version': 'v1', 'created': 'Tue, 23 Nov 2021 19:42:12 GMT'}]",2022-05-04,"[['de Carvalho', 'Osmar Luiz Ferreira', ''], ['Júnior', 'Osmar Abílio de Carvalho', ''], ['de Albuquerque', 'Anesmar Olino', ''], ['Santana', 'Nickolas Castro', ''], ['Borges', 'Dibio Leandro', ''], ['Gomes', 'Roberto Arnaldo Trancoso', ''], ['Guimarães', 'Renato Fontes', '']]","['deep learning', 'semantic segmentation', 'instance segmentation', 'object detection']"
11119,1807.07752,Shaunak Joshi,Shaunak Joshi and Deepali Deshpande,Twitter Sentiment Analysis System,5 pages,International Journal of Computer Applications (2018),10.5120/ijca2018917319,,cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media is increasingly used by humans to express their feelings and
opinions in the form of short text messages. Detecting sentiments in the text
has a wide range of applications including identifying anxiety or depression of
individuals and measuring well-being or mood of a community. Sentiments can be
expressed in many ways that can be seen such as facial expression and gestures,
speech and by written text. Sentiment Analysis in text documents is essentially
a content-based classification problem involving concepts from the domains of
Natural Language Processing as well as Machine Learning. In this paper,
sentiment recognition based on textual data and the techniques used in
sentiment analysis are discussed.
","[{'version': 'v1', 'created': 'Fri, 20 Jul 2018 09:19:08 GMT'}]",2018-07-23,"[['Joshi', 'Shaunak', ''], ['Deshpande', 'Deepali', '']]","['Machine Learning', 'Python', 'Social Media', 'Sentiment Analysis']"
11120,1908.06412,Riccardo Coppola,"Riccardo Coppola, Luca Ardito, Marco Torchiano","Characterizing the transition to Kotlin of Android apps: a study on
  F-Droid, Play Store and GitHub","Pre-print of paper sent to 3rd International Workshop on App Market
  Analytics, WAMA 2019",,10.1145/3340496.3342759,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Kotlin is a novel language that represents an alternative to Java, and has
been recently adopted as a first-class programming language for Android
applications. Kotlin is achieving a significant diffusion among developers, and
several studies have highlighted various advantages of the language when
compared to Java.
  The objective of this paper is to analyze a set of open-source Android apps,
to evaluate their transition to the Kotlin programming language throughout
their lifespan and understand whether the adoption of Kotlin has impacts on the
success of Android apps.
  We mined all the projects from the F-Droid repository of Android open-source
applications, and we found the corresponding projects on the official Google
Play Store and on the GitHub platform. We defined a set of eight metrics to
quantify the relevance of Kotlin code in the latest update and through all
releases of an application. Then, we statistically analyzed the correlation
between the presence of Kotlin code in a project and popularity metrics mined
from the platforms where the apps were released.
  Of a set of 1232 projects that were updated after October 2017, near 20%
adopted Kotlin and about 12% had more Kotlin code than Java; most of the
projects that adopted Kotlin quickly transitioned from Java to the new
language. The projects featuring Kotlin had on average higher popularity
metrics; a statistically significant correlation has been found between the
presence of Kotlin and the number of stars on the GitHub repository.
  The Kotlin language seems able to guarantee a seamless migration from Java
for Android developers. With an inspection on a large set of open-source
Android apps, we observed that the adoption of the Kotlin language is rapid
(when compared to the average lifespan of an Android project) and seems to come
at no cost in terms of popularity among the users and other developers.
","[{'version': 'v1', 'created': 'Sun, 18 Aug 2019 09:46:36 GMT'}]",2019-08-20,"[['Coppola', 'Riccardo', ''], ['Ardito', 'Luca', ''], ['Torchiano', 'Marco', '']]","['App Market Analytics', 'Mobile Development', 'Kotlin', 'Java', 'SoftwareMaintenance', 'Empirical Software Engineering']"
11121,1907.00657,Jonathan Dong,"Jonathan Dong, Mushegh Rafayelyan, Florent Krzakala, Sylvain Gigan","Optical Reservoir Computing using multiple light scattering for chaotic
  systems prediction",,"IEEE Journal of Selected Topics in Quantum Electronics ( Volume:
  26 , Issue: 1 , Jan.-Feb. 2020 )",10.1109/JSTQE.2019.2936281,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reservoir Computing is a relatively recent computational framework based on a
large Recurrent Neural Network with fixed weights. Many physical
implementations of Reservoir Computing have been proposed to improve speed and
energy efficiency. In this study, we report new advances in Optical Reservoir
Computing using multiple light scattering to accelerate the recursive
computation of the reservoir states. Two different spatial light modulation
technologies, namely, phase or binary amplitude modulations, are compared.
Phase modulation is a promising direction already employed in other photonic
implementations of Reservoir Computing. Additionally, we report a
Digital-Micromirror-based Reservoir Computing at up to 640 Hz, more than double
the previously reported frequency using a remotely controlled optical device
developed by LightOn, and present new binarization strategies to improve the
performance of binarized Reservoir Computing.
","[{'version': 'v1', 'created': 'Mon, 1 Jul 2019 11:11:41 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Aug 2019 17:42:23 GMT'}]",2019-09-10,"[['Dong', 'Jonathan', ''], ['Rafayelyan', 'Mushegh', ''], ['Krzakala', 'Florent', ''], ['Gigan', 'Sylvain', '']]","['Optical Computing', 'Reservoir Computing', 'Optical neural networks', 'Light scattering', 'Chaotic time series', 'Network quantization']"
11122,2202.08946,Fred Hohman,"Alex B\""auerle, \'Angel Alexander Cabrera, Fred Hohman, Megan Maher,
  David Koski, Xavier Suau, Titus Barik, Dominik Moritz",Symphony: Composing Interactive Interfaces for Machine Learning,"Proceedings of the 2022 CHI Conference on Human Factors in Computing
  Systems",,10.1145/3491102.3502102,,cs.HC cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Interfaces for machine learning (ML), information and visualizations about
models or data, can help practitioners build robust and responsible ML systems.
Despite their benefits, recent studies of ML teams and our interviews with
practitioners (n=9) showed that ML interfaces have limited adoption in
practice. While existing ML interfaces are effective for specific tasks, they
are not designed to be reused, explored, and shared by multiple stakeholders in
cross-functional teams. To enable analysis and communication between different
ML practitioners, we designed and implemented Symphony, a framework for
composing interactive ML interfaces with task-specific, data-driven components
that can be used across platforms such as computational notebooks and web
dashboards. We developed Symphony through participatory design sessions with 10
teams (n=31), and discuss our findings from deploying Symphony to 3 production
ML projects at Apple. Symphony helped ML practitioners discover previously
unknown issues like data duplicates and blind spots in models while enabling
them to share insights with other stakeholders.
","[{'version': 'v1', 'created': 'Fri, 18 Feb 2022 00:27:30 GMT'}]",2022-02-21,"[['Bäuerle', 'Alex', ''], ['Cabrera', 'Ángel Alexander', ''], ['Hohman', 'Fred', ''], ['Maher', 'Megan', ''], ['Koski', 'David', ''], ['Suau', 'Xavier', ''], ['Barik', 'Titus', ''], ['Moritz', 'Dominik', '']]","['Machine learning', 'AI', 'visualization', 'documentation', 'interactiveprogramming', 'computational notebooks']"
11123,2209.07219,Bernhard Bermeitinger,"Tomas Hrycej, Bernhard Bermeitinger, Siegfried Handschuh",Training Neural Networks in Single vs Double Precision,,,10.5220/0011577900003335,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The commitment to single-precision floating-point arithmetic is widespread in
the deep learning community. To evaluate whether this commitment is justified,
the influence of computing precision (single and double precision) on the
optimization performance of the Conjugate Gradient (CG) method (a second-order
optimization algorithm) and RMSprop (a first-order algorithm) has been
investigated. Tests of neural networks with one to five fully connected hidden
layers and moderate or strong nonlinearity with up to 4 million network
parameters have been optimized for Mean Square Error (MSE). The training tasks
have been set up so that their MSE minimum was known to be zero. Computing
experiments have disclosed that single-precision can keep up (with superlinear
convergence) with double-precision as long as line search finds an improvement.
First-order methods such as RMSprop do not benefit from double precision.
However, for moderately nonlinear tasks, CG is clearly superior. For strongly
nonlinear tasks, both algorithm classes find only solutions fairly poor in
terms of mean square error as related to the output variance. CG with double
floating-point precision is superior whenever the solutions have the potential
to be useful for the application goal.
","[{'version': 'v1', 'created': 'Thu, 15 Sep 2022 11:20:53 GMT'}]",2022-11-01,"[['Hrycej', 'Tomas', ''], ['Bermeitinger', 'Bernhard', ''], ['Handschuh', 'Siegfried', '']]","['Optimization', 'Conjugate Gradient', 'RMSprop', 'Machine Precision']"
11124,cs/0309044,Valmir Barbosa,V. C. Barbosa,The combinatorics of resource sharing,"R. Correa et alii (eds.), Models for Parallel and Distributed
  Computation, pp. 27-52. Kluwer Academic Publishers, Dordrecht, The
  Netherlands, 2002",,10.1007/978-1-4757-3609-0_2,,cs.OS cs.DC,,"  We discuss general models of resource-sharing computations, with emphasis on
the combinatorial structures and concepts that underlie the various deadlock
models that have been proposed, the design of algorithms and deadlock-handling
policies, and concurrency issues. These structures are mostly graph-theoretic
in nature, or partially ordered sets for the establishment of priorities among
processes and acquisition orders on resources. We also discuss graph-coloring
concepts as they relate to resource sharing.
","[{'version': 'v1', 'created': 'Tue, 23 Sep 2003 13:57:01 GMT'}]",2016-09-14,"[['Barbosa', 'V. C.', '']]","['Deadlock models', 'deadlock detection', 'deadlock prevention', 'concurrency measures']"
11125,2209.11197,Mousa Jari,Mousa Jari,"An Overview of Phishing Victimization: Human Factors, Training and the
  Role of Emotions",,,10.5121/csit.2022.121319,,cs.CR cs.CY cs.GL cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Phishing is a form of cybercrime and a threat that allows criminals,
phishers, to deceive end users in order to steal their confidential and
sensitive information. Attackers usually attempt to manipulate the psychology
and emotions of victims. The increasing threat of phishing has made its study
worthwhile and much research has been conducted into the issue. This paper
explores the emotional factors that have been reported in previous studies to
be significant in phishing victimization. In addition, we compare what security
organizations and researchers have highlighted in terms of phishing types and
categories as well as training in tackling the problem, in a literature review
which takes into account all major credible and published sources.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2022 12:51:20 GMT'}]",2022-09-23,"[['Jari', 'Mousa', '']]","['Phishing', 'emotion', 'information', 'victimization', 'training']"
11126,2206.05066,Javier Cremona,Javier Cremona and Rom\'an Comelli and Taih\'u Pire,"Experimental Evaluation of Visual-Inertial Odometry Systems for Arable
  Farming","This paper has been accepted for publication in Journal of Field
  Robotics",,10.1002/rob.22099,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The farming industry constantly seeks the automation of different processes
involved in agricultural production, such as sowing, harvesting and weed
control. The use of mobile autonomous robots to perform those tasks is of great
interest. Arable lands present hard challenges for Simultaneous Localization
and Mapping (SLAM) systems, key for mobile robotics, given the visual
difficulty due to the highly repetitive scene and the crop leaves movement
caused by the wind.
  In recent years, several Visual-Inertial Odometry (VIO) and SLAM systems have
been developed. They have proved to be robust and capable of achieving high
accuracy in indoor and outdoor urban environments. However, they were not
properly assessed in agricultural fields. In this work we assess the most
relevant state-of-the-art VIO systems in terms of accuracy and processing time
on arable lands in order to better understand how they behave on these
environments. In particular, the evaluation is carried out on a collection of
sensor data recorded by our wheeled robot in a soybean field, which was
publicly released as the Rosario Dataset. The evaluation shows that the highly
repetitive appearance of the environment, the strong vibration produced by the
rough terrain and the movement of the leaves caused by the wind, expose the
limitations of the current state-of-the-art VIO and SLAM systems. We analyze
the systems failures and highlight the observed drawbacks, including
initialization failures, tracking loss and sensitivity to IMU saturation.
Finally, we conclude that even though certain systems like ORB-SLAM3 and
S-MSCKF show good results with respect to others, more improvements should be
done to make them reliable in agricultural fields for certain applications such
as soil tillage of crop rows and pesticide spraying.
","[{'version': 'v1', 'created': 'Fri, 10 Jun 2022 12:51:52 GMT'}, {'version': 'v2', 'created': 'Mon, 31 Oct 2022 20:07:09 GMT'}]",2022-11-02,"[['Cremona', 'Javier', ''], ['Comelli', 'Román', ''], ['Pire', 'Taihú', '']]","['Visual-Inertial Odometry', 'SLAM', 'Agricultural Robotics', 'Precision Agriculture']"
11127,1910.11509,Wassim Bouachir,"Imanne El Maachi, Guillaume-Alexandre Bilodeau, Wassim Bouachir","Deep 1D-Convnet for accurate Parkinson disease detection and severity
  prediction from gait","Source code available at
  https://github.com/imanneelmaachi/Parkinson-disease-detection-and-severity-prediction-from-gait","Expert Systems with Applications, 113075 (2019)",10.1016/j.eswa.2019.113075,,cs.LG cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Diagnosing Parkinson's disease is a complex task that requires the evaluation
of several motor and non-motor symptoms. During diagnosis, gait abnormalities
are among the important symptoms that physicians should consider. However, gait
evaluation is challenging and relies on the expertise and subjectivity of
clinicians. In this context, the use of an intelligent gait analysis algorithm
may assist physicians in order to facilitate the diagnosis process. This paper
proposes a novel intelligent Parkinson detection system based on deep learning
techniques to analyze gait information. We used 1D convolutional neural network
(1D-Convnet) to build a Deep Neural Network (DNN) classifier. The proposed
model processes 18 1D-signals coming from foot sensors measuring the vertical
ground reaction force (VGRF). The first part of the network consists of 18
parallel 1D-Convnet corresponding to system inputs. The second part is a fully
connected network that connects the concatenated outputs of the 1D-Convnets to
obtain a final classification. We tested our algorithm in Parkinson's detection
and in the prediction of the severity of the disease with the Unified
Parkinson's Disease Rating Scale (UPDRS). Our experiments demonstrate the high
efficiency of the proposed method in the detection of Parkinson disease based
on gait data. The proposed algorithm achieved an accuracy of 98.7 %. To our
knowledge, this is the state-of-the-start performance in Parkinson's gait
recognition. Furthermore, we achieved an accuracy of 85.3 % in Parkinson's
severity prediction. To the best of our knowledge, this is the first algorithm
to perform a severity prediction based on the UPDRS. Our results show that the
model is able to learn intrinsic characteristics from gait data and to
generalize to unseen subjects, which could be helpful in a clinical diagnosis.
","[{'version': 'v1', 'created': 'Fri, 25 Oct 2019 03:14:54 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Oct 2019 02:03:44 GMT'}, {'version': 'v3', 'created': 'Fri, 22 Nov 2019 02:23:21 GMT'}, {'version': 'v4', 'created': 'Sat, 16 May 2020 18:50:52 GMT'}]",2020-05-19,"[['Maachi', 'Imanne El', ''], ['Bilodeau', 'Guillaume-Alexandre', ''], ['Bouachir', 'Wassim', '']]","['1D-Convnet', 'Parkinson', 'gait', 'Classification', 'Deep learning']"
11128,1811.07818,Amarnath R,"BV Divyashree, Amarnath R, Naveen M, G Hemantha Kumar","Novel approach to locate region of interest in mammograms for Breast
  cancer","ROI, breast cancer, mammographic images, segmentation, entropy, quad
  tree","International Journal of Intelligent Systems and Applications in
  Engineering.(ISSN:2147-6799) Vol 6, No 3 (2018)",10.18201/ijisae.2018644775,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Locating region of interest for breast cancer masses in the mammographic
image is a challenging problem in medical image processing. In this research
work, the keen idea is to efficiently extract suspected mass region for further
examination. In particular to this fact breast boundary segmentation on sliced
rgb image using modified intensity based approach followed by quad tree based
division to spot out suspicious area are proposed in the paper. To evaluate the
performance DDSM standard dataset are experimented and achieved acceptable
accuracy.
","[{'version': 'v1', 'created': 'Thu, 1 Nov 2018 11:01:40 GMT'}]",2018-11-20,"[['Divyashree', 'BV', ''], ['R', 'Amarnath', ''], ['M', 'Naveen', ''], ['Kumar', 'G Hemantha', '']]","['ROI', 'breast cancer', 'mammographic images', 'segmentation', 'entropy', 'quad tree']"
11129,2112.02582,Haobo Yuan,"Haobo Yuan, Xiangtai Li, Yibo Yang, Guangliang Cheng, Jing Zhang,
  Yunhai Tong, Lefei Zhang, Dacheng Tao","PolyphonicFormer: Unified Query Learning for Depth-aware Video Panoptic
  Segmentation",Accepted by ECCV 2022,,10.1007/978-3-031-19812-0_34,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Depth-aware Video Panoptic Segmentation (DVPS) is a new challenging
vision problem that aims to predict panoptic segmentation and depth in a video
simultaneously. The previous work solves this task by extending the existing
panoptic segmentation method with an extra dense depth prediction and instance
tracking head. However, the relationship between the depth and panoptic
segmentation is not well explored -- simply combining existing methods leads to
competition and needs carefully weight balancing. In this paper, we present
PolyphonicFormer, a vision transformer to unify these sub-tasks under the DVPS
task and lead to more robust results. Our principal insight is that the depth
can be harmonized with the panoptic segmentation with our proposed new paradigm
of predicting instance level depth maps with object queries. Then the
relationship between the two tasks via query-based learning is explored. From
the experiments, we demonstrate the benefits of our design from both depth
estimation and panoptic segmentation aspects. Since each thing query also
encodes the instance-wise information, it is natural to perform tracking
directly with appearance learning. Our method achieves state-of-the-art results
on two DVPS datasets (Semantic KITTI, Cityscapes), and ranks 1st on the
ICCV-2021 BMTT Challenge video + depth track. Code is available at
https://github.com/HarborYuan/PolyphonicFormer .
","[{'version': 'v1', 'created': 'Sun, 5 Dec 2021 14:31:47 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Apr 2022 10:07:16 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Jul 2022 03:37:23 GMT'}, {'version': 'v4', 'created': 'Wed, 28 Dec 2022 03:26:33 GMT'}]",2022-12-29,"[['Yuan', 'Haobo', ''], ['Li', 'Xiangtai', ''], ['Yang', 'Yibo', ''], ['Cheng', 'Guangliang', ''], ['Zhang', 'Jing', ''], ['Tong', 'Yunhai', ''], ['Zhang', 'Lefei', ''], ['Tao', 'Dacheng', '']]","['Depth-aware Video Panoptic Segmentation', 'Scene Understanding', 'Multi-Task Learning']"
11130,2107.12506,Matthew Guzdial,Emily Halina and Matthew Guzdial,TaikoNation: Patterning-focused Chart Generation for Rhythm Action Games,"10 pages, 5 figures, Procedural Content Generation Workshop","Proceedings of the Twelfth Workshop on Procedural Content
  Generation 2021",10.1145/3472538.3472589,,cs.LG cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generating rhythm game charts from songs via machine learning has been a
problem of increasing interest in recent years. However, all existing systems
struggle to replicate human-like patterning: the placement of game objects in
relation to each other to form congruent patterns based on events in the song.
Patterning is a key identifier of high quality rhythm game content, seen as a
necessary component in human rankings. We establish a new approach for chart
generation that produces charts with more congruent, human-like patterning than
seen in prior work.
","[{'version': 'v1', 'created': 'Mon, 26 Jul 2021 22:55:57 GMT'}]",2021-07-28,"[['Halina', 'Emily', ''], ['Guzdial', 'Matthew', '']]","['rhythm games', 'neural networks', 'procedural content generation']"
11131,2207.14791,Aleksey Gvozdarev S.,Aleksey S. Gvozdarev,"The Novel Approach to the Closed-Form Average Bit Error Rate Calculation
  for the Nakagami-m Fading Channel",,,10.1016/j.dsp.2022.103563,,cs.IT eess.SP math.IT,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The research presents a procedure of the closed-form average bit error rate
evaluation for wireless communication systems in the presence of multipath
fading. A generalization of the classical moment generating function is
applied, and a connection between the Hankel-type contour-integral
representation of the Marcum Q-function and Gauss Q-function is obtained and
applied to the analytic derivation of the quadrature amplitude modulated signal
average bit error rate in the presence of Nakagami-m fading. The correctness of
the obtained solution was verified, and its computational efficiency (in terms
of accuracy and time gain), compared with the prevailing approximation, was
demonstrated. The proposed methodology can be extended to a wide variety of
composite channels.
","[{'version': 'v1', 'created': 'Fri, 29 Jul 2022 17:16:15 GMT'}]",2022-08-01,"[['Gvozdarev', 'Aleksey S.', '']]","['Gaussian Q-function', 'contour integral', 'closed-form', 'average bit error rate', 'Nakagami-m', 'multipathfading channel']"
11132,1712.08342,Michael Borkowski,"Michael Borkowski, Walid Fdhila, Matteo Nardelli, Stefanie
  Rinderle-Ma, Stefan Schulte",Event-based Failure Prediction in Distributed Business Processes,,,10.1016/j.is.2017.12.005,,cs.DC cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Traditionally, research in Business Process Management has put a strong focus
on centralized and intra-organizational processes. However, today's business
processes are increasingly distributed, deviating from a centralized layout,
and therefore calling for novel methodologies of detecting and responding to
unforeseen events, such as errors occurring during process runtime. In this
article, we demonstrate how to employ event-based failure prediction in
business processes. This approach allows to make use of the best of both
traditional Business Process Management Systems and event-based systems. Our
approach employs machine learning techniques and considers various types of
events. We evaluate our solution using two business process data sets,
including one from a real-world event log, and show that we are able to detect
errors and predict failures with high accuracy.
","[{'version': 'v1', 'created': 'Fri, 22 Dec 2017 08:45:55 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Jan 2018 11:56:16 GMT'}]",2018-01-10,"[['Borkowski', 'Michael', ''], ['Fdhila', 'Walid', ''], ['Nardelli', 'Matteo', ''], ['Rinderle-Ma', 'Stefanie', ''], ['Schulte', 'Stefan', '']]","['failure prediction', 'event-based systems', 'business process management', 'machine learning']"
11133,2204.02773,Jinsheng Ba,"Jinsheng Ba, Gregory J. Duck, Abhik Roychoudhury",Efficient Greybox Fuzzing to Detect Memory Errors,"37th IEEE/ACM International Conference on Automated Software
  Engineering",,10.1145/3551349.3561161,,cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Greybox fuzzing is a proven and effective testing method for the detection of
security vulnerabilities and other bugs in modern software systems. Greybox
fuzzing can also be used in combination with a sanitizer, such as
AddressSanitizer (ASAN), to further enhance the detection of certain classes of
bugs such as buffer overflow and use-after-free errors. However, sanitizers
also introduce additional performance overheads, and this can degrade the
performance of greybox mode fuzzing -- measured in the order of 2.36X for
fuzzing with ASAN -- partially negating the benefit of using a sanitizer in the
first place. Recent research attributes the extra overhead to program
startup/teardown costs that can dominate fork-mode fuzzing.
  In this paper, we present a new memory error sanitizer design that is
specifically optimized for fork-mode fuzzing. The basic idea is to mark object
boundaries using randomized tokens rather than disjoint metadata (as used by
traditional sanitizer designs). All read/write operations are then instrumented
to check for the token, and if present, a memory error will be detected. Since
our design does not use a disjoint metadata, it is also very lightweight,
meaning that program startup and teardown costs are minimized for the benefit
of fork-mode fuzzing. We implement our design in the form of the ReZZan tool,
and show an improved fuzzing performance overhead of 1.14-1.27X, depending on
the configuration.
","[{'version': 'v1', 'created': 'Wed, 6 Apr 2022 12:39:10 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Sep 2022 11:21:28 GMT'}]",2022-09-07,"[['Ba', 'Jinsheng', ''], ['Duck', 'Gregory J.', ''], ['Roychoudhury', 'Abhik', '']]","['Fuzz testing', 'greybox fuzzing', 'memory errors', 'sanitizers']"
11134,1708.04378,Ziming Li,"Ziming Li, Julia Kiseleva, Maarten de Rijke, Artem Grotov",Towards Learning Reward Functions from User Interactions,5 pages,,10.1145/3121050.3121098,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the physical world, people have dynamic preferences, e.g., the same
situation can lead to satisfaction for some humans and to frustration for
others. Personalization is called for. The same observation holds for online
behavior with interactive systems. It is natural to represent the behavior of
users who are engaging with interactive systems such as a search engine or a
recommender system, as a sequence of actions where each next action depends on
the current situation and the user reward of taking a particular action. By and
large, current online evaluation metrics for interactive systems such as search
engines or recommender systems, are static and do not reflect differences in
user behavior. They rarely capture or model the reward experienced by a user
while interacting with an interactive system. We argue that knowing a user's
reward function is essential for an interactive system as both for learning and
evaluation. We propose to learn users' reward functions directly from observed
interaction traces. In particular, we present how users' reward functions can
be uncovered directly using inverse reinforcement learning techniques. We also
show how to incorporate user features into the learning process. Our main
contribution is a novel and dynamic approach to restore a user's reward
function. We present an analytic approach to this problem and complement it
with initial experiments using the interaction logs of a cultural heritage
institution that demonstrate the feasibility of the approach by uncovering
different reward functions for different user groups.
","[{'version': 'v1', 'created': 'Tue, 15 Aug 2017 01:53:12 GMT'}]",2017-08-16,"[['Li', 'Ziming', ''], ['Kiseleva', 'Julia', ''], ['de Rijke', 'Maarten', ''], ['Grotov', 'Artem', '']]","['Inverse reinforcement learning', 'online evaluation', 'interactive systems']"
11135,2006.03493,Elena Di Lavore,"Elena Di Lavore, Jules Hedges and Pawe{\l} Soboci\'nski",Compositional modelling of network games,Published in CSL'21,,10.4230/LIPIcs.CSL.2021.30,,cs.GT math.CT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The analysis of games played on graph-like structures is of increasing
importance due to the prevalence of social networks, both virtual and physical,
in our daily life. As well as being relevant in computer science, mathematical
analysis and computer simulations of such distributed games are vital
methodologies in economics, politics and epidemiology, amongst other fields.
Our contribution is to give compositional semantics of a family of such games
as a well-behaved mapping, a strict monoidal functor, from a category of open
graphs (syntax) to a category of open games (semantics). As well as introducing
the theoretical framework, we identify some applications of compositionality.
","[{'version': 'v1', 'created': 'Fri, 5 Jun 2020 14:50:41 GMT'}, {'version': 'v2', 'created': 'Mon, 16 May 2022 12:17:08 GMT'}]",2022-05-17,"[['Di Lavore', 'Elena', ''], ['Hedges', 'Jules', ''], ['Sobociński', 'Paweł', '']]","['game theory', 'category theory', 'network games', 'open games', 'open graphs', 'compositionality']"
11136,1908.10009,Peng Gao,"Peng Gao, Qiquan Zhang, Fei Wang, Liyi Xiao, Hamido Fujita, Yan Zhang","Learning Reinforced Attentional Representation for End-to-End Visual
  Tracking",Accepted by Information Sciences,,10.1016/j.ins.2019.12.084,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although numerous recent tracking approaches have made tremendous advances in
the last decade, achieving high-performance visual tracking remains a
challenge. In this paper, we propose an end-to-end network model to learn
reinforced attentional representation for accurate target object discrimination
and localization. We utilize a novel hierarchical attentional module with long
short-term memory and multi-layer perceptrons to leverage both inter- and
intra-frame attention to effectively facilitate visual pattern emphasis.
Moreover, we incorporate a contextual attentional correlation filter into the
backbone network to make our model trainable in an end-to-end fashion. Our
proposed approach not only takes full advantage of informative geometries and
semantics but also updates correlation filters online without fine-tuning the
backbone network to enable the adaptation of variations in the target object's
appearance. Extensive experiments conducted on several popular benchmark
datasets demonstrate that our proposed approach is effective and
computationally efficient.
","[{'version': 'v1', 'created': 'Tue, 27 Aug 2019 03:55:17 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Aug 2019 00:39:16 GMT'}, {'version': 'v3', 'created': 'Thu, 2 Jan 2020 01:07:09 GMT'}]",2020-01-03,"[['Gao', 'Peng', ''], ['Zhang', 'Qiquan', ''], ['Wang', 'Fei', ''], ['Xiao', 'Liyi', ''], ['Fujita', 'Hamido', ''], ['Zhang', 'Yan', '']]","['Visual tracking', 'reinforced representation', 'attentive learning', 'correlation filter']"
11137,2006.14858,"David K\""ugler","David K\""ugler, Marc Uecker, Arjan Kuijper, Anirban Mukhopadhyay","AutoSNAP: Automatically Learning Neural Architectures for Instrument
  Pose Estimation","Accepted at MICCAI 2020 Preparing code for release at
  https://github.com/MECLabTUDA/AutoSNAP",,10.1007/978-3-030-59716-0_36,,cs.CV cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  Despite recent successes, the advances in Deep Learning have not yet been
fully translated to Computer Assisted Intervention (CAI) problems such as pose
estimation of surgical instruments. Currently, neural architectures for
classification and segmentation tasks are adopted ignoring significant
discrepancies between CAI and these tasks. We propose an automatic framework
(AutoSNAP) for instrument pose estimation problems, which discovers and learns
the architectures for neural networks. We introduce 1)~an efficient testing
environment for pose estimation, 2)~a powerful architecture representation
based on novel Symbolic Neural Architecture Patterns (SNAPs), and 3)~an
optimization of the architecture using an efficient search scheme. Using
AutoSNAP, we discover an improved architecture (SNAPNet) which outperforms both
the hand-engineered i3PosNet and the state-of-the-art architecture search
method DARTS.
","[{'version': 'v1', 'created': 'Fri, 26 Jun 2020 08:34:47 GMT'}]",2022-08-15,"[['Kügler', 'David', ''], ['Uecker', 'Marc', ''], ['Kuijper', 'Arjan', ''], ['Mukhopadhyay', 'Anirban', '']]","['Neural Architecture Search', 'Instrument Pose Estimation', 'AutoML']"
11138,2211.06716,Linshan Jiang,"Linshan Jiang, Qun Song, Rui Tan, Mo Li","PriMask: Cascadable and Collusion-Resilient Data Masking for Mobile
  Cloud Inference","13 pages, best paper candidate, Sensys 2022",,10.1145/3560905.3568531,,cs.CR cs.DC cs.LG cs.NI,http://creativecommons.org/licenses/by/4.0/,"  Mobile cloud offloading is indispensable for inference tasks based on
large-scale deep models. However, transmitting privacy-rich inference data to
the cloud incurs concerns. This paper presents the design of a system called
PriMask, in which the mobile device uses a secret small-scale neural network
called MaskNet to mask the data before transmission. PriMask significantly
weakens the cloud's capability to recover the data or extract certain private
attributes. The MaskNet is em cascadable in that the mobile can opt in to or
out of its use seamlessly without any modifications to the cloud's inference
service. Moreover, the mobiles use different MaskNets, such that the collusion
between the cloud and some mobiles does not weaken the protection for other
mobiles. We devise a {\em split adversarial learning} method to train a neural
network that generates a new MaskNet quickly (within two seconds) at run time.
We apply PriMask to three mobile sensing applications with diverse modalities
and complexities, i.e., human activity recognition, urban environment
crowdsensing, and driver behavior recognition. Results show PriMask's
effectiveness in all three applications.
","[{'version': 'v1', 'created': 'Sat, 12 Nov 2022 17:54:13 GMT'}]",2022-11-15,"[['Jiang', 'Linshan', ''], ['Song', 'Qun', ''], ['Tan', 'Rui', ''], ['Li', 'Mo', '']]","['Privacy-preserving techniques', 'Cloud inference', 'Dynamic neuralnetworks']"
11139,2210.06190,Michael Bonfert,"Michael Bonfert, Anke V. Reinschluessel, Susanne Putze, Yenchin Lai,
  Dmitry Alexandrovsky, Rainer Malaka, Tanja D\""oring","""Seeing the Faces Is So Important"" -- Experiences From Online Team
  Meetings on Commercial Virtual Reality Platforms","This article has been published at Frontiers in Virtual Reality,
  Research Topic ""Everyday Virtual and Augmented Reality: Methods and
  Applications, Volume II"": https://doi.org/10.3389/frvir.2022.945791","Front. Virtual Real. 3:945791, 11 January 2023, Sec. Technologies
  for VR",10.3389/frvir.2022.945791,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  During the Covid-19 pandemic, online meetings became common for daily
teamwork in the home office. To understand the opportunities and challenges of
meeting in virtual reality (VR) compared to video conferences, we conducted the
weekly team meetings of our human-computer interaction research lab on five
off-the-shelf online meeting platforms over four months. After each of the 12
meetings, we asked the participants (N = 32) to share their experiences,
resulting in 200 completed online questionnaires. We evaluated the ratings of
the overall meeting experience and conducted an exploratory factor analysis of
the quantitative data to compare VR meetings and video calls in terms of
meeting involvement and co-presence. In addition, a thematic analysis of the
qualitative data revealed genuine insights covering five themes: spatial
aspects, meeting atmosphere, expression of emotions, meeting productivity, and
user needs. We reflect on our findings gained under authentic working
conditions, derive lessons learned for running successful team meetings in VR
supporting different kinds of meeting formats, and discuss the team's long-term
platform choice.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2022 13:19:26 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Jan 2023 16:37:29 GMT'}]",2023-01-24,"[['Bonfert', 'Michael', ''], ['Reinschluessel', 'Anke V.', ''], ['Putze', 'Susanne', ''], ['Lai', 'Yenchin', ''], ['Alexandrovsky', 'Dmitry', ''], ['Malaka', 'Rainer', ''], ['Döring', 'Tanja', '']]","['CSCW', 'Virtual reality', 'Social VR', 'Remote collaboration', 'Virtual meetings', 'Video conferencing', 'Autoethnography', 'Case']"
11140,2301.08091,William Seymour,"William Seymour, Mark Cote, Jose Such","Legal Obligation and Ethical Best Practice: Towards Meaningful Verbal
  Consent for Voice Assistants","To appear in the Proceedings of the 2023 CHI Conference on Human
  Factors in Computing Systems (CHI '23)",,10.1145/3544548.3580967,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To improve user experience, Alexa now allows users to consent to data sharing
via voice rather than directing them to the companion smartphone app. While
verbal consent mechanisms for voice assistants (VAs) can increase usability,
they can also undermine principles core to informed consent. We conducted a
Delphi study with experts from academia, industry, and the public sector on
requirements for verbal consent in VAs. Candidate requirements were drawn from
the literature, regulations, and research ethics guidelines that participants
rated based on their relevance to the consent process, actionability by
platforms, and usability by end-users, discussing their reasoning as the study
progressed. We highlight key areas of (dis)agreement between experts, deriving
recommendations for regulators, skill developers, and VA platforms towards
crafting meaningful verbal consent mechanisms. Key themes include approaching
permissions according to the user's ability to opt-out, minimising consent
decisions, and ensuring platforms follow established consent principles.
","[{'version': 'v1', 'created': 'Thu, 19 Jan 2023 14:22:44 GMT'}]",2023-01-20,"[['Seymour', 'William', ''], ['Cote', 'Mark', ''], ['Such', 'Jose', '']]","['Voice Assistants', 'Consent', 'Verbal Consent', 'Informed Consent', 'GDPR', 'Alexa', 'Conversational User Interfaces', 'Permissions']"
11141,2007.05924,Vivek Kumar Singh Ph.D.,"Mousumi Karmakar, Sumit Kumar Banshal, Vivek Kumar Singh","Does presence of social media plugins in a journal website result in
  higher social media attention of its research publications",in press,"Scientometrics, 2020",10.1007/s11192-020-03574-7,,cs.DL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media platforms have now emerged as an important medium for wider
dissemination of research articles; with authors, readers and publishers
creating different kinds of social media activity about the article. Some
research studies have even shown that articles that get more social media
attention may get higher visibility and citations. These factors are now
persuading journal publishers to integrate social media plugins in their
webpages to facilitate sharing and dissemination of articles in social media
platforms. Many past studies have analyzed several factors (like journal impact
factor, open access, collaboration etc.) that may impact social media attention
of scholarly articles. However, there are no studies to analyze whether the
presence of social media plugin in a journal could result in higher social
media attention of articles published in the journal. This paper aims to bridge
this gap in knowledge by analyzing a sufficiently large-sized sample of 99,749
articles from 100 different journals. Results obtained show that journals that
have social media plugins integrated in their webpages get significantly higher
social media mentions and shares for their articles as compared to journals
that do not provide such plugins. Authors and readers visiting journal webpages
appear to be a major contributor to social media activity around articles
published in such journals. The results suggest that publishing houses should
actively provide social media plugin integration in their journal webpages to
increase social media visibility (altmetric impact) of their articles.
","[{'version': 'v1', 'created': 'Sun, 12 Jul 2020 06:35:26 GMT'}]",2020-07-14,"[['Karmakar', 'Mousumi', ''], ['Banshal', 'Sumit Kumar', ''], ['Singh', 'Vivek Kumar', '']]","['Altmetrics', 'Science Communication', 'Social Media Attention', 'Social Media Plugin']"
11142,2205.02851,Chukwuma Okolie,"Iyke Maduako, Elijah Ebinne, Victus Uzodinma, Chukwuma Okolie,
  Emmanuel Chiemelu",Computing Traffic Accident High-Risk Locations Using Graph Analytics,,Spatial Information Research (2022),10.1007/s41324-022-00448-3,,cs.SI cs.DB,http://creativecommons.org/licenses/by/4.0/,"  Analysis of the dynamic relationship between traffic accident events and road
network topology based on connectivity and graph analytics offers a new
approach to identifying, ranking and profiling traffic accident high
risk-locations at different levels of space and time granularities. Previous
studies on traffic accident hot spots have mostly adopted spatial statistics
and Geographic Information Systems (GIS) where spatial point patterns are
discovered based only on spatial dependence with no recognition of the temporal
dependence of the events. A limitation arises from the fact that the results
are either under or over-estimated because of the temporal aggregation of the
events to an absolute time point. Furthermore, the existing methods apart from
the Network Kernel Density Estimation (NETKDE), consider traffic accident
events as events randomly on a 2-D geographic space. However, traffic accident
events are network constrained events that happens majorly on the road network
space. Therefore, in this paper, we adopt the connectivity of graph on a
network space approach that identifies accident high risk-locations based on
space-time-varying connectivity between traffic accident events and the road
network geometry. A simple but extensible traffic accident space time-varying
graph (STVG) model is developed and implemented for this study. Traffic
accident high risk-locations are identified and ranked in space and time using
time-dependent degree centrality and PageRank centrality graph metrics
respectively through time-incremental graph queries. This study offers urban
traffic accident analysts with a new and efficient approach to identify, rank
and profile accident-prone areas in space and time at different scales.
","[{'version': 'v1', 'created': 'Thu, 5 May 2022 21:52:33 GMT'}]",2022-05-09,"[['Maduako', 'Iyke', ''], ['Ebinne', 'Elijah', ''], ['Uzodinma', 'Victus', ''], ['Okolie', 'Chukwuma', ''], ['Chiemelu', 'Emmanuel', '']]","['Traffic Accident Hot Spots', 'Space-Time-Varying Graph Data Model', 'Degree']"
11143,1906.01545,Ramon Ferrer i Cancho,"Ramon Ferrer-i-Cancho, Christian Bentz and Caio Seguin",Optimal coding and the origins of Zipfian laws,"in press in the Journal of Quantitative Linguistics; definition of
  concordant pair corrected, proofs polished, references updated",,10.1080/09296174.2020.1778387,,cs.CL cs.IT math.IT physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of compression in standard information theory consists of
assigning codes as short as possible to numbers. Here we consider the problem
of optimal coding -- under an arbitrary coding scheme -- and show that it
predicts Zipf's law of abbreviation, namely a tendency in natural languages for
more frequent words to be shorter. We apply this result to investigate optimal
coding also under so-called non-singular coding, a scheme where unique
segmentation is not warranted but codes stand for a distinct number. Optimal
non-singular coding predicts that the length of a word should grow
approximately as the logarithm of its frequency rank, which is again consistent
with Zipf's law of abbreviation. Optimal non-singular coding in combination
with the maximum entropy principle also predicts Zipf's rank-frequency
distribution. Furthermore, our findings on optimal non-singular coding
challenge common beliefs about random typing. It turns out that random typing
is in fact an optimal coding process, in stark contrast with the common
assumption that it is detached from cost cutting considerations. Finally, we
discuss the implications of optimal coding for the construction of a compact
theory of Zipfian laws and other linguistic laws.
","[{'version': 'v1', 'created': 'Tue, 4 Jun 2019 16:03:18 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Jul 2019 06:29:57 GMT'}, {'version': 'v3', 'created': 'Thu, 19 Dec 2019 16:09:39 GMT'}, {'version': 'v4', 'created': 'Fri, 29 May 2020 16:32:11 GMT'}]",2020-09-24,"[['Ferrer-i-Cancho', 'Ramon', ''], ['Bentz', 'Christian', ''], ['Seguin', 'Caio', '']]","['Zipf’s law for word frequencies', 'Zipf’s law of abbreviation', 'optimal coding', 'maximum entropy principle']"
11144,2208.01739,Jin-Zhu Yu,"Jin-Zhu Yu, Mincheng Wu, Gisela Bichler, Felipe Aros-Vera, Jianxi Gao","Reconstructing Sparse Multiplex Networks with Application to Covert
  Networks",,"Entropy 25, 1 (2023)",10.3390/e25010142,,cs.SI cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  Network structure provides critical information for understanding the dynamic
behavior of networks. However, the complete structure of real-world networks is
often unavailable, thus it is crucially important to develop approaches to
infer a more complete structure of networks. In this paper, we integrate the
configuration model for generating random networks into an
Expectation-Maximization-Aggregation (EMA) framework to reconstruct the
complete structure of multiplex networks. We validate the proposed EMA
framework against the random model on several real-world multiplex networks,
including both covert and overt ones. It is found that the EMA framework
generally achieves the best predictive accuracy compared to the EM framework
and the random model. As the number of layers increases, the performance
improvement of EMA over EM decreases. The inferred multiplex networks can be
leveraged to inform the decision-making on monitoring covert networks as well
as allocating limited resources for collecting additional information to
improve reconstruction accuracy. For law enforcement agencies, the inferred
complete network structure can be used to develop more effective strategies for
covert network interdiction.
","[{'version': 'v1', 'created': 'Fri, 29 Jul 2022 16:06:50 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Nov 2022 02:29:12 GMT'}, {'version': 'v3', 'created': 'Tue, 10 Jan 2023 17:59:49 GMT'}]",2023-01-11,"[['Yu', 'Jin-Zhu', ''], ['Wu', 'Mincheng', ''], ['Bichler', 'Gisela', ''], ['Aros-Vera', 'Felipe', ''], ['Gao', 'Jianxi', '']]","['Multiplex networks', 'Partially observable networks', 'Interlayer dependency', 'Network completion', 'Expectation-maximization']"
11145,2004.14753,Paolo Cignoni,"Andrea Maggiordomo, Federico Ponchio, Paolo Cignoni, Marco Tarini","Real-World Textured Things: a Repository of Textured Models Generated
  with Modern Photo-Reconstruction Tools",,"Computer Aided Geometric Design Volume 83, November 2020, 101943",10.1016/j.cagd.2020.101943,,cs.GR,http://creativecommons.org/licenses/by-sa/4.0/,"  We are witnessing a proliferation of textured 3D models captured from the
real world with automatic photo-reconstruction tools. Digital 3D models of this
class come with a unique set of characteristics and defects -- especially
concerning their parametrization -- setting them starkly apart from 3D models
originating from other, more traditional, sources. We study this class of 3D
models by collecting a significant number of representatives and quantitatively
evaluating their quality according to several metrics. These include a new
invariant metric we design to assess the fragmentation of the UV map, one of
the main weaknesses hindering the usability of these models. Our results back
the widely shared notion that such models are not fit for direct use in
downstream applications (such as videogames), and require challenging
processing steps. Regrettably, existing automatic geometry processing tools are
not always up to the task: for example, we verify that available tools for UV
optimization often fail due mesh inconsistencies, geometric and topological
noise, excessive resolution, or other factors; moreover, even when an output is
produced, it is rarely a significant improvement over the input (according to
the aforementioned measures). Therefore, we argue that further advancements are
required specifically targeted at this class of models. Towards this goal, we
share the models we collected in the form of a new public repository,
Real-World Textured Things (RWTT), a benchmark to systematic field-test and
compare algorithms. RWTT consists of 568 carefully selected textured 3D models
representative of all the main modern off-the-shelf photo-reconstruction tools.
The repository is available at http://texturedmesh.isti.cnr.it/ and is
browsable by metadata collected during experiments, and comes with a tool,
TexMetro, providing the same set of measures for generic UV mapped datasets.
","[{'version': 'v1', 'created': 'Thu, 30 Apr 2020 13:20:14 GMT'}]",2020-12-29,"[['Maggiordomo', 'Andrea', ''], ['Ponchio', 'Federico', ''], ['Cignoni', 'Paolo', ''], ['Tarini', 'Marco', '']]","['Benchmarks', 'Photo-reconstruction', '3D Acquisition', 'Quality Measures', 'SurfaceParametrization', 'UV maps', 'Textures', 'Real-World Models']"
11146,2112.00668,Jinting Zhu,"Jinting Zhu and Julian Jang-Jaccard and Amardeep Singh and Ian Welch
  and Harith AI-Sahaf and Seyit Camtepe","A Few-Shot Meta-Learning based Siamese Neural Network using Entropy
  Features for Ransomware Classification",,"Computers & Security,Volume 117, June 2022, 102691",10.1016/j.cose.2022.102691,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Ransomware defense solutions that can quickly detect and classify different
ransomware classes to formulate rapid response plans have been in high demand
in recent years. Though the applicability of adopting deep learning techniques
to provide automation and self-learning provision has been proven in many
application domains, the lack of data available for ransomware (and other
malware)samples has been raised as a barrier to developing effective deep
learning-based solutions. To address this concern, we propose a few-shot
meta-learning based Siamese Neural Network that not only detects ransomware
attacks but is able to classify them into different classes. Our proposed model
utilizes the entropy feature directly extracted from ransomware binary files to
retain more fine-grained features associated with different ransomware
signatures. These entropy features are used further to train and optimize our
model using a pre-trained network (e.g. VGG-16) in a meta-learning fashion.
This approach generates more accurate weight factors, compared to feature
images are used, to avoid the bias typically associated with a model trained
with a limited number of training samples. Our experimental results show that
our proposed model is highly effective in providing a weighted F1-score
exceeding the rate>86% compared
","[{'version': 'v1', 'created': 'Wed, 1 Dec 2021 17:31:14 GMT'}, {'version': 'v2', 'created': 'Sun, 10 Apr 2022 04:55:54 GMT'}]",2022-04-12,"[['Zhu', 'Jinting', ''], ['Jang-Jaccard', 'Julian', ''], ['Singh', 'Amardeep', ''], ['Welch', 'Ian', ''], ['AI-Sahaf', 'Harith', ''], ['Camtepe', 'Seyit', '']]","['Ransomware Classification', 'Siamese Neural Network', 'Few-Shot']"
11147,cs/0108020,David Eppstein,"Marshall Bern, David Eppstein, Jeff Erickson",Flipping Cubical Meshes,"20 pages, 24 figures. Expanded journal version of paper from 10th
  International Meshing Roundtable. This version removes some unwanted
  paragraph breaks from the previous version; the text is unchanged","Engineering with Computers 18(3):173-187, 2002",10.1007/s003660200016,,cs.CG,,"  We define and examine flip operations for quadrilateral and hexahedral
meshes, similar to the flipping transformations previously used in triangular
and tetrahedral mesh generation.
","[{'version': 'v1', 'created': 'Mon, 27 Aug 2001 20:24:51 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Jun 2002 18:01:18 GMT'}, {'version': 'v3', 'created': 'Wed, 24 Jul 2002 20:26:40 GMT'}]",2010-01-21,"[['Bern', 'Marshall', ''], ['Eppstein', 'David', ''], ['Erickson', 'Jeff', '']]","['quadrilateral meshing', 'hexahedral meshing', 'flip graph connectivity', 'mesh improvement']"
11148,2207.05641,Yuhua Sun,"Yuhua Sun, Tailai Zhang, Xingjun Ma, Pan Zhou, Jian Lou, Zichuan Xu,
  Xing Di, Yu Cheng, and Lichao",Backdoor Attacks on Crowd Counting,"To appear in ACMMM 2022. 10pages, 6 figures and 2 tables",,10.1145/3503161.3548296,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crowd counting is a regression task that estimates the number of people in a
scene image, which plays a vital role in a range of safety-critical
applications, such as video surveillance, traffic monitoring and flow control.
In this paper, we investigate the vulnerability of deep learning based crowd
counting models to backdoor attacks, a major security threat to deep learning.
A backdoor attack implants a backdoor trigger into a target model via data
poisoning so as to control the model's predictions at test time. Different from
image classification models on which most of existing backdoor attacks have
been developed and tested, crowd counting models are regression models that
output multi-dimensional density maps, thus requiring different techniques to
manipulate.
  In this paper, we propose two novel Density Manipulation Backdoor Attacks
(DMBA$^{-}$ and DMBA$^{+}$) to attack the model to produce arbitrarily large or
small density estimations. Experimental results demonstrate the effectiveness
of our DMBA attacks on five classic crowd counting models and four types of
datasets. We also provide an in-depth analysis of the unique challenges of
backdooring crowd counting models and reveal two key elements of effective
attacks: 1) full and dense triggers and 2) manipulation of the ground truth
counts or density maps. Our work could help evaluate the vulnerability of crowd
counting models to potential backdoor attacks.
","[{'version': 'v1', 'created': 'Tue, 12 Jul 2022 16:17:01 GMT'}]",2022-07-13,"[['Sun', 'Yuhua', ''], ['Zhang', 'Tailai', ''], ['Ma', 'Xingjun', ''], ['Zhou', 'Pan', ''], ['Lou', 'Jian', ''], ['Xu', 'Zichuan', ''], ['Di', 'Xing', ''], ['Cheng', 'Yu', ''], ['Lichao', '', '']]","['Crowd Counting', 'Backdoor Attack', 'Deep Neural Networks']"
11149,2103.05213,Mingyuan Meng,"Mingyuan Meng, Lei Bi, Michael Fulham, David Dagan Feng, and Jinman
  Kim",Enhancing Medical Image Registration via Appearance Adjustment Networks,Published at NeuroImage,"NeuroImage, vol. 259, pp. 119444, 2022",10.1016/j.neuroimage.2022.119444,,cs.CV cs.AI eess.IV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Deformable image registration is fundamental for many medical image analyses.
A key obstacle for accurate image registration lies in image appearance
variations such as the variations in texture, intensities, and noise. These
variations are readily apparent in medical images, especially in brain images
where registration is frequently used. Recently, deep learning-based
registration methods (DLRs), using deep neural networks, have shown
computational efficiency that is several orders of magnitude faster than
traditional optimization-based registration methods (ORs). DLRs rely on a
globally optimized network that is trained with a set of training samples to
achieve faster registration. DLRs tend, however, to disregard the
target-pair-specific optimization inherent in ORs and thus have degraded
adaptability to variations in testing samples. This limitation is severe for
registering medical images with large appearance variations, especially since
few existing DLRs explicitly take into account appearance variations. In this
study, we propose an Appearance Adjustment Network (AAN) to enhance the
adaptability of DLRs to appearance variations. Our AAN, when integrated into a
DLR, provides appearance transformations to reduce the appearance variations
during registration. In addition, we propose an anatomy-constrained loss
function through which our AAN generates anatomy-preserving transformations.
Our AAN has been purposely designed to be readily inserted into a wide range of
DLRs and can be trained cooperatively in an unsupervised and end-to-end manner.
We evaluated our AAN with three state-of-the-art DLRs on three well-established
public datasets of 3D brain magnetic resonance imaging (MRI). The results show
that our AAN consistently improved existing DLRs and outperformed
state-of-the-art ORs on registration accuracy, while adding a fractional
computational load to existing DLRs.
","[{'version': 'v1', 'created': 'Tue, 9 Mar 2021 04:24:48 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Jul 2022 03:10:24 GMT'}]",2022-09-20,"[['Meng', 'Mingyuan', ''], ['Bi', 'Lei', ''], ['Fulham', 'Michael', ''], ['Feng', 'David Dagan', ''], ['Kim', 'Jinman', '']]","['Image Registration', 'Deep Learning', 'Appearance Transformation.  1']"
11150,1712.04747,Galymzhan Nauryzbayev,"Sultangali Arzykulov, Galymzhan Nauryzbayev, Theodoros A. Tsiftsis,
  Mohamed Abdallah","On the Capacity of Wireless Powered Cognitive Relay Network with
  Interference Alignment","14 pages, 4 figures, To appear in IEEE Global Communications
  Conference 2017, Singapore, December 2017",,10.1109/GLOCOM.2017.8254223,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a two-hop decode-and-forward cognitive radio system with
deployed interference alignment is considered. The relay node is
energy-constrained and scavenges the energy from the interference signals. In
the literature, there are two main energy harvesting protocols, namely,
time-switching relaying and power-splitting relaying. We first demonstrate how
to design the beamforming matrices for the considered primary and secondary
networks. Then, the system capacity under perfect and imperfect channel state
information scenarios, considering different portions of time-switching and
power-splitting protocols, is estimated.
","[{'version': 'v1', 'created': 'Wed, 13 Dec 2017 13:01:06 GMT'}]",2018-03-12,"[['Arzykulov', 'Sultangali', ''], ['Nauryzbayev', 'Galymzhan', ''], ['Tsiftsis', 'Theodoros A.', ''], ['Abdallah', 'Mohamed', '']]","['Decode-and-forward (DF)', 'energy-harvesting (EH)', 'capacity', 'cognitive radio (CR)', 'interference alignment (IA)']"
11151,2009.10807,Fatima Zahra Yamani,"Fatima Zahra Yamani, Mohamed El Merouani","A Model-Driven Architecture Approach for Developing Healthcare ERP: Case
  study in Morocco",,"IJCSI International Journal of Computer Science Issues, Volume 17,
  Issue 1, January 2020",10.5281/zenodo.3987098,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, there are many problems in the Enterprise Resource Planning (ERP)
implemented in the majority of hospitals in Morocco such as the difficulty of
adaptation by the different users, the lack of several functionalities, errors
that block the daily work, etc. All these problems require frequent
modifications in the code, which implies a high effort to develop healthcare
ERP as one of complex systems. In this paper, we are going to present a
model-driven approach for developing healthcare ERP based on class diagram.
First, we constitute the independent model using UML, define the transformation
rules then apply them on our source model class to generate at the end an XML
file that will be necessary for the ERP code. Our approach will not only
resolve the above problems, but also improve the efficiency of software
development through the automatically generated code.
","[{'version': 'v1', 'created': 'Tue, 22 Sep 2020 20:46:22 GMT'}]",2020-09-24,"[['Yamani', 'Fatima Zahra', ''], ['Merouani', 'Mohamed El', '']]","['Healthcare ERP', 'UML', 'Model Driven Architecture (MDA)', 'transformation by modeling', 'PIM', 'MOF 2.0 QVT']"
11152,2203.14889,Jinhan Xin,"Jinhan Xin, Kai Hwang, Zhibin Yu","LOCAT: Low-Overhead Online Configuration Auto-Tuning of Spark SQL
  Applications","16 pages, 21 figures, SIGMOD '22. This arxiv version is an extended
  version of the SIGMOD '22 paper with same title, allowed by conference chairs",,10.1145/3514221.3526157,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spark SQL has been widely deployed in industry but it is challenging to tune
its performance. Recent studies try to employ machine learning (ML) to solve
this problem, but suffer from two drawbacks. First, it takes a long time (high
overhead) to collect training samples. Second, the optimal configuration for
one input data size of the same application might not be optimal for others. To
address these issues, we propose a novel Bayesian Optimization (BO) based
approach named LOCAT to automatically tune the configurations of Spark SQL
applications online. LOCAT innovates three techniques. The first technique,
named QCSA, eliminates the configuration-insensitive queries by Query
Configuration Sensitivity Analysis (QCSA) when collecting training samples. The
second technique, dubbed DAGP, is a Datasize-Aware Gaussian Process (DAGP)
which models the performance of an application as a distribution of functions
of configuration parameters as well as input data size. The third technique,
called IICP, Identifies Important Configuration Parameters (IICP) with respect
to performance and only tunes the important ones. As such, LOCAT can tune the
configurations of a Spark SQL application with low overhead and adapt to
different input data sizes. We employ Spark SQL applications from benchmark
suites TPC-DS, TPC-H, and HiBench running on two significantly different
clusters, a four-node ARM cluster and an eight-node x86 cluster, to evaluate
LOCAT. The experimental results on the ARM cluster show that LOCAT accelerates
the optimization procedures of the state-of-the-art approaches by at least 4.1x
and up to 9.7x; moreover, LOCAT improves the application performance by at
least 1.9x and up to 2.4x. On the x86 cluster, LOCAT shows similar results to
those on the ARM cluster.
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2022 16:46:33 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Apr 2022 08:27:32 GMT'}, {'version': 'v3', 'created': 'Sun, 15 May 2022 12:50:11 GMT'}, {'version': 'v4', 'created': 'Mon, 7 Nov 2022 20:10:01 GMT'}]",2022-11-09,"[['Xin', 'Jinhan', ''], ['Hwang', 'Kai', ''], ['Yu', 'Zhibin', '']]","['big data', 'in-memory computing', 'Spark', 'Spark SQL']"
11153,2108.12188,Martin Karp,"Martin Karp, Artur Podobas, Tobias Kenter, Niclas Jansson, Christian
  Plessl, Philipp Schlatter, and Stefano Markidis","A High-Fidelity Flow Solver for Unstructured Meshes on
  Field-Programmable Gate Arrays","12 pages, 3 figures, 3 tables, Accepted to HPC Asia 2022",,10.1145/3492805.3492808,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The impending termination of Moore's law motivates the search for new forms
of computing to continue the performance scaling we have grown accustomed to.
Among the many emerging Post-Moore computing candidates, perhaps none is as
salient as the Field-Programmable Gate Array (FPGA), which offers the means of
specializing and customizing the hardware to the computation at hand.
  In this work, we design a custom FPGA-based accelerator for a computational
fluid dynamics (CFD) code. Unlike prior work -- which often focuses on
accelerating small kernels -- we target the entire Poisson solver on
unstructured meshes based on the high-fidelity spectral element method (SEM)
used in modern state-of-the-art CFD systems. We model our accelerator using an
analytical performance model based on the I/O cost of the algorithm. We
empirically evaluate our accelerator on a state-of-the-art Intel Stratix 10
FPGA in terms of performance and power consumption and contrast it against
existing solutions on general-purpose processors (CPUs). Finally, we propose a
data movement-reducing technique where we compute geometric factors on the fly,
which yields significant (700+ Gflop/s) single-precision performance and an
upwards of 2x reduction in runtime for the local evaluation of the Laplace
operator.
  We end the paper by discussing the challenges and opportunities of using
reconfigurable architecture in the future, particularly in the light of
emerging (not yet available) technologies.
","[{'version': 'v1', 'created': 'Fri, 27 Aug 2021 09:15:08 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Aug 2021 14:56:39 GMT'}, {'version': 'v3', 'created': 'Tue, 2 Nov 2021 15:35:13 GMT'}]",2021-11-03,"[['Karp', 'Martin', ''], ['Podobas', 'Artur', ''], ['Kenter', 'Tobias', ''], ['Jansson', 'Niclas', ''], ['Plessl', 'Christian', ''], ['Schlatter', 'Philipp', ''], ['Markidis', 'Stefano', '']]","['Spectral element method', 'Field-programmable gate array', 'Conjugate gradient method', 'High-level synthesis']"
11154,2203.13962,Da Xu,"Da Xu, Chuanwei Ruan","Tutorial: Modern Theoretical Tools for Understanding and Designing
  Next-generation Information Retrieval System",,,10.1145/3488560.3501394,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the relatively short history of machine learning, the subtle balance
between engineering and theoretical progress has been proved critical at
various stages. The most recent wave of AI has brought to the IR community
powerful techniques, particularly for pattern recognition. While many benefits
from the burst of ideas as numerous tasks become algorithmically feasible, the
balance is tilting toward the application side. The existing theoretical tools
in IR can no longer explain, guide, and justify the newly-established
methodologies.
  The consequences can be suffering: in stark contrast to how the IR industry
has envisioned modern AI making life easier, many are experiencing increased
confusion and costs in data manipulation, model selection, monitoring,
censoring, and decision making. This reality is not surprising: without handy
theoretical tools, we often lack principled knowledge of the pattern
recognition model's expressivity, optimization property, generalization
guarantee, and our decision-making process has to rely on over-simplified
assumptions and human judgments from time to time.
  Time is now to bring the community a systematic tutorial on how we
successfully adapt those tools and make significant progress in understanding,
designing, and eventually productionize impactful IR systems. We emphasize
systematicity because IR is a comprehensive discipline that touches upon
particular aspects of learning, causal inference analysis, interactive (online)
decision-making, etc. It thus requires systematic calibrations to render the
actual usefulness of the imported theoretical tools to serve IR problems, as
they usually exhibit unique structures and definitions. Therefore, we plan this
tutorial to systematically demonstrate our learning and successful experience
of using advanced theoretical tools for understanding and designing IR systems.
","[{'version': 'v1', 'created': 'Sat, 26 Mar 2022 01:36:23 GMT'}]",2022-03-29,"[['Xu', 'Da', ''], ['Ruan', 'Chuanwei', '']]","['Information retrieval', 'Theory', 'Machine Learning', 'Pattern Recognition', 'Decision making', 'Causal inference', 'Bandit', 'Reinforcementlearning']"
11155,2111.07441,Athanasios Kapoutsis Ch.,"Athanasios Ch. Kapoutsis, Savvas A. Chatzichristofis and Elias B.
  Kosmatopoulos","A distributed, plug-n-play algorithm for multi-robot applications with a
  priori non-computable objective functions",,"The International Journal of Robotics Research, (2019), Volume: 38
  issue: 7, page(s): 813-832",10.1177/0278364919845054,,cs.RO cs.AI cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a distributed algorithm applicable to a wide range of
practical multi-robot applications. In such multi-robot applications, the
user-defined objectives of the mission can be cast as a general optimization
problem, without explicit guidelines of the subtasks per different robot. Owing
to the unknown environment, unknown robot dynamics, sensor nonlinearities,
etc., the analytic form of the optimization cost function is not available a
priori. Therefore, standard gradient-descent-like algorithms are not applicable
to these problems. To tackle this, we introduce a new algorithm that carefully
designs each robot's subcost function, the optimization of which can accomplish
the overall team objective. Upon this transformation, we propose a distributed
methodology based on the cognitive-based adaptive optimization (CAO) algorithm,
that is able to approximate the evolution of each robot's cost function and to
adequately optimize its decision variables (robot actions). The latter can be
achieved by online learning only the problem-specific characteristics that
affect the accomplishment of mission objectives. The overall, low-complexity
algorithm can straightforwardly incorporate any kind of operational constraint,
is fault-tolerant, and can appropriately tackle time-varying cost functions. A
cornerstone of this approach is that it shares the same convergence
characteristics as those of block coordinate descent algorithms. The proposed
algorithm is evaluated in three heterogeneous simulation set-ups under multiple
scenarios, against both general-purpose and problem-specific algorithms. Source
code is available at
https://github.com/athakapo/A-distributed-plug-n-play-algorithm-for-multi-robot-applications.
","[{'version': 'v1', 'created': 'Sun, 14 Nov 2021 20:40:00 GMT'}, {'version': 'v2', 'created': 'Sat, 25 Dec 2021 11:27:19 GMT'}]",2021-12-28,"[['Kapoutsis', 'Athanasios Ch.', ''], ['Chatzichristofis', 'Savvas A.', ''], ['Kosmatopoulos', 'Elias B.', '']]","['Distributed Robot Systems', 'Learning and Adaptive Systems', 'Cognitive Robotics', 'Surveillance Systems', 'AutonomousAgents']"
11156,1410.7182,Leon Derczynski,"Leon Derczynski, Diana Maynard, Giuseppe Rizzo, Marieke van Erp,
  Genevieve Gorrell, Rapha\""el Troncy, Johann Petrak, Kalina Bontcheva",Analysis of Named Entity Recognition and Linking for Tweets,"35 pages, accepted to journal Information Processing and Management","Information Processing & Management 51 (2), 32-49, 2014",10.1016/j.ipm.2014.10.006,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Applying natural language processing for mining and intelligent information
access to tweets (a form of microblog) is a challenging, emerging research
area. Unlike carefully authored news text and other longer content, tweets pose
a number of new challenges, due to their short, noisy, context-dependent, and
dynamic nature. Information extraction from tweets is typically performed in a
pipeline, comprising consecutive stages of language identification,
tokenisation, part-of-speech tagging, named entity recognition and entity
disambiguation (e.g. with respect to DBpedia). In this work, we describe a new
Twitter entity disambiguation dataset, and conduct an empirical analysis of
named entity recognition and disambiguation, investigating how robust a number
of state-of-the-art systems are on such noisy texts, what the main sources of
error are, and which problems should be further investigated to improve the
state of the art.
","[{'version': 'v1', 'created': 'Mon, 27 Oct 2014 11:09:36 GMT'}]",2014-11-26,"[['Derczynski', 'Leon', ''], ['Maynard', 'Diana', ''], ['Rizzo', 'Giuseppe', ''], ['van Erp', 'Marieke', ''], ['Gorrell', 'Genevieve', ''], ['Troncy', 'Raphaël', ''], ['Petrak', 'Johann', ''], ['Bontcheva', 'Kalina', '']]","['information extraction', 'named entity recognition', 'entitydisambiguation', 'microblogs', 'Twitter']"
11157,1712.04748,Galymzhan Nauryzbayev,"Galymzhan Nauryzbayev, Khaled M. Rabie, Mohamed Abdallah, Bamidele
  Adebisi","Ergodic Capacity Analysis of Wireless Powered AF Relaying Systems over
  $\alpha$-$\mu$ Fading Channels","14 pages, 7 figures, To appear in IEEE Global Communications
  Conference (IEEE Globecom), Singapore, December 2017",,10.1109/GLOCOM.2017.8254222,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider a two-hop amplify-and-forward (AF) relaying
system, where the relay node is energy-constrained and harvests energy from the
source node. In the literature, there are three main energy-harvesting (EH)
protocols, namely, time-switching relaying (TSR), power-splitting (PS) relaying
(PSR) and ideal relaying receiver (IRR). Unlike the existing studies, in this
paper, we consider $\alpha$-$\mu$ fading channels. In this respect, we derive
accurate unified analytical expressions for the ergodic capacity for the
aforementioned protocols over independent but not identically distributed
(i.n.i.d) $\alpha$-$\mu$ fading channels. Three special cases of the
$\alpha$-$\mu$ model, namely, Rayleigh, Nakagami-mandWeibull fading channels
were investigated. Our analysis is verified through numerical and simulation
results. It is shown that finding the optimal value of the PS factor for the
PSR protocol and the EH time fraction for the TSR protocol is a crucial step in
achieving the best network performance.
","[{'version': 'v1', 'created': 'Wed, 13 Dec 2017 13:05:28 GMT'}]",2018-03-12,"[['Nauryzbayev', 'Galymzhan', ''], ['Rabie', 'Khaled M.', ''], ['Abdallah', 'Mohamed', ''], ['Adebisi', 'Bamidele', '']]","['Ergodic capacity (EC)', 'amplify-and-forward (AF) relaying', 'energy-harvesting (EH)', 'α-µ fading', 'wireless power']"
11158,1905.08772,Sergio Gast\'on Burdisso,"Sergio G. Burdisso, Marcelo Errecalde, Manuel Montes-y-G\'omez","A Text Classification Framework for Simple and Effective Early
  Depression Detection Over Social Media Streams","Highlights: (*) A novel text classifier having the ability to
  visually explain its rationale; (*) Domain-independent classification that
  does not require feature engineering; (*) Support for incremental learning
  and text classification over streams; (*) Efficient framework for addressing
  early risk detection problems; (*) State-of-the-art performance on early
  depression detection task","18 May 2019, Volume 133, Expert Systems With Applications,
  Elsevier",10.1016/j.eswa.2019.05.023,,cs.CY cs.CL cs.IR cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rise of the Internet, there is a growing need to build intelligent
systems that are capable of efficiently dealing with early risk detection (ERD)
problems on social media, such as early depression detection, early rumor
detection or identification of sexual predators. These systems, nowadays mostly
based on machine learning techniques, must be able to deal with data streams
since users provide their data over time. In addition, these systems must be
able to decide when the processed data is sufficient to actually classify
users. Moreover, since ERD tasks involve risky decisions by which people's
lives could be affected, such systems must also be able to justify their
decisions. However, most standard and state-of-the-art supervised machine
learning models (such as SVM, MNB, Neural Networks, etc.) are not well suited
to deal with this scenario. This is due to the fact that they either act as
black boxes or do not support incremental classification/learning. In this
paper we introduce SS3, a novel supervised learning model for text
classification that naturally supports these aspects. SS3 was designed to be
used as a general framework to deal with ERD problems. We evaluated our model
on the CLEF's eRisk2017 pilot task on early depression detection. Most of the
30 contributions submitted to this competition used state-of-the-art methods.
Experimental results show that our classifier was able to outperform these
models and standard classifiers, despite being less computationally expensive
and having the ability to explain its rationale.
","[{'version': 'v1', 'created': 'Sat, 18 May 2019 15:46:38 GMT'}]",2019-05-24,"[['Burdisso', 'Sergio G.', ''], ['Errecalde', 'Marcelo', ''], ['Montes-y-Gómez', 'Manuel', '']]","['Early Text Classification', 'Early Depression Detection', 'Incremental Classification', 'SS3', 'Interpretability', 'Explainability']"
11159,2208.09846,Xinyu Ma,"Xinyu Ma, Ruqing Zhang, Jiafeng Guo, Yixing Fan and Xueqi Cheng","A Contrastive Pre-training Approach to Learn Discriminative Autoencoder
  for Dense Retrieval",Accepted by CIKM2022,,10.1145/3511808.3557527,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dense retrieval (DR) has shown promising results in information retrieval. In
essence, DR requires high-quality text representations to support effective
search in the representation space. Recent studies have shown that pre-trained
autoencoder-based language models with a weak decoder can provide high-quality
text representations, boosting the effectiveness and few-shot ability of DR
models. However, even a weak autoregressive decoder has the bypass effect on
the encoder. More importantly, the discriminative ability of learned
representations may be limited since each token is treated equally important in
decoding the input texts. To address the above problems, in this paper, we
propose a contrastive pre-training approach to learn a discriminative
autoencoder with a lightweight multi-layer perception (MLP) decoder. The basic
idea is to generate word distributions of input text in a non-autoregressive
fashion and pull the word distributions of two masked versions of one text
close while pushing away from others. We theoretically show that our
contrastive strategy can suppress the common words and highlight the
representative words in decoding, leading to discriminative representations.
Empirical results show that our method can significantly outperform the
state-of-the-art autoencoder-based language models and other pre-trained models
for dense retrieval.
","[{'version': 'v1', 'created': 'Sun, 21 Aug 2022 08:46:18 GMT'}]",2022-08-23,"[['Ma', 'Xinyu', ''], ['Zhang', 'Ruqing', ''], ['Guo', 'Jiafeng', ''], ['Fan', 'Yixing', ''], ['Cheng', 'Xueqi', '']]","['Dense Retrieval', 'Discriminative Autoencoder', 'Contrastive Pre-training']"
11160,2010.03496,Daniel Daza,"Daniel Daza, Michael Cochez, Paul Groth",Inductive Entity Representations from Text via Link Prediction,,,10.1145/3442381.3450141,,cs.CL cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge Graphs (KG) are of vital importance for multiple applications on
the web, including information retrieval, recommender systems, and metadata
annotation. Regardless of whether they are built manually by domain experts or
with automatic pipelines, KGs are often incomplete. Recent work has begun to
explore the use of textual descriptions available in knowledge graphs to learn
vector representations of entities in order to preform link prediction.
However, the extent to which these representations learned for link prediction
generalize to other tasks is unclear. This is important given the cost of
learning such representations. Ideally, we would prefer representations that do
not need to be trained again when transferring to a different task, while
retaining reasonable performance.
  In this work, we propose a holistic evaluation protocol for entity
representations learned via a link prediction objective. We consider the
inductive link prediction and entity classification tasks, which involve
entities not seen during training. We also consider an information retrieval
task for entity-oriented search. We evaluate an architecture based on a
pretrained language model, that exhibits strong generalization to entities not
observed during training, and outperforms related state-of-the-art methods (22%
MRR improvement in link prediction on average). We further provide evidence
that the learned representations transfer well to other tasks without
fine-tuning. In the entity classification task we obtain an average improvement
of 16% in accuracy compared with baselines that also employ pre-trained models.
In the information retrieval task, we obtain significant improvements of up to
8.8% in NDCG@10 for natural language queries. We thus show that the learned
representations are not limited KG-specific tasks, and have greater
generalization properties than evaluated in previous work.
","[{'version': 'v1', 'created': 'Wed, 7 Oct 2020 16:04:06 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Feb 2021 10:36:23 GMT'}, {'version': 'v3', 'created': 'Wed, 14 Apr 2021 09:38:45 GMT'}]",2021-04-15,"[['Daza', 'Daniel', ''], ['Cochez', 'Michael', ''], ['Groth', 'Paul', '']]","['knowledge graphs', 'entity representations', 'link prediction', 'entityclassification', 'information retrieval']"
11161,2202.12186,Gabriel Borrageiro Mr,Gabriel Borrageiro,Sequential asset ranking in nonstationary time series,,,10.1145/3533271.3561666,,cs.CE cs.LG q-fin.TR,http://creativecommons.org/licenses/by/4.0/,"  We create a ranking algorithm, the naive Bayes asset ranker. Our algorithm
computes the posterior probability that individual assets will be ranked higher
than other portfolio constituents. Unlike earlier algorithms, such as the
weighted majority, our algorithm allows poor-performing experts to have
increased weight when they start performing well. We outperform the long-only
holding of the S&P 500 index and a regress-then-rank baseline.
","[{'version': 'v1', 'created': 'Thu, 24 Feb 2022 16:39:30 GMT'}, {'version': 'v2', 'created': 'Sat, 11 Jun 2022 11:23:02 GMT'}, {'version': 'v3', 'created': 'Fri, 28 Oct 2022 07:24:39 GMT'}]",2022-10-31,"[['Borrageiro', 'Gabriel', '']]","['online learning', 'prediction with expertadvice', 'learning to rank', 'transfer learning', 'radial basis function networks', 'multivariate regression shrinkage']"
11162,1805.02081,Rahul Goel,"Rahul Goel, Anurag Singh and Fakhteh Ghanbarnejad",Modelling Competitive marketing strategies in Social Networks,,"Physica A: Statistical Mechanics and its Applications, Volume 518
  (2019) 50-70",10.1016/j.physa.2018.11.035,,cs.SI cs.GT cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a competitive marketing, there are a large number of players which produce
the same product. Each firm aims to diffuse its product information widely so
that it's product will become popular among potential buyers. The more popular
is a product of a firm, the higher is the revenue for the firm. A model is
developed in which two players compete to spread information in the large
network. Players choose their initial seed nodes simultaneously and the
information is diffused according to Independent Cascade model (ICM). The main
aim of the player is to choose the seed nodes such that they will spread its
information to as many nodes as possible in a social network. The rate of
spreading of information also plays a very important role in information
diffusion process. Any node in a social network will get influenced by none or
one or more than one information. We also analyzed how much fraction of nodes
in different compartment changes by changing the rate of spreading of
information. Finally, a game theory model is developed to obtain the Nash
equilibrium based on best response function of the players. This model is based
on Hotelling's model of electoral competition.
","[{'version': 'v1', 'created': 'Sat, 5 May 2018 16:57:35 GMT'}]",2019-01-01,"[['Goel', 'Rahul', ''], ['Singh', 'Anurag', ''], ['Ghanbarnejad', 'Fakhteh', '']]","['Information Diffusion', 'Social Networks', 'Independent Cascade model', 'Rank Degree method', 'Game Theory', 'Centrality']"
11163,2211.13462,Probir Mondal,Probir Mondal,"Estimation of Similarity between DNA Sequences and Its Graphical
  Representation","8 pages, 13 Figures, 4 Tables","International Journal of Recent Technology and Engineering (IJRTE)
  ISSN: 2277-3878 (Online), Volume-9 Issue-1, May 2020",10.35940/ijrte.F9389.059120,,cs.DS,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Bioinformatics, which is now a well known field of study, originated in the
context of biological sequence analysis. Recently graphical representation
takes place for the research on DNA sequence. Research in biological sequence
is mainly based on the function and its structure. Bioinformatics finds wide
range of applications specifically in the domain of molecular biology which
focuses on the analysis of molecules viz. DNA, RNA, Protein etc. In this
review, we mainly deal with the similarity analysis between sequences and
graphical representation of DNA sequence.
","[{'version': 'v1', 'created': 'Thu, 24 Nov 2022 07:57:46 GMT'}]",2022-11-28,"[['Mondal', 'Probir', '']]","['DNA sequence', 'Gene expression', 'Graphical']"
11164,2203.05045,Gunnar Kudrjavets,"Gunnar Kudrjavets (University of Groningen), Nachiappan Nagappan (Meta
  Platforms, Inc.), Ayushi Rastogi (University of Groningen)","Do Small Code Changes Merge Faster? A Multi-Language Empirical
  Investigation","12 pages. To be published in Proceedings of MSR '22: Proceedings of
  the 19th International Conference on Mining Software Repositories (MSR 2022).
  ACM, New York, NY, USA",,10.1145/3524842.3528448,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Code velocity, or the speed with which code changes are integrated into a
production environment, plays a crucial role in Continuous Integration and
Continuous Deployment. Many studies report factors influencing code velocity.
However, solutions to increase code velocity are unclear. Meanwhile, the
industry continues to issue guidelines on ""ideal"" code change size, believing
it increases code velocity despite lacking evidence validating the practice.
Surprisingly, this fundamental question has not been studied to date. This
study investigates the practicality of improving code velocity by optimizing
pull request size and composition (ratio of insertions, deletions, and
modifications). We start with a hypothesis that a moderate correlation exists
between pull request size and time-to-merge. We selected 100 most popular,
actively developed projects from 10 programming languages on GitHub. We
analyzed our dataset of 845,316 pull requests by size, composition, and context
to explore its relationship to time-to-merge - a proxy to measure code
velocity. Our study shows that pull request size and composition do not relate
to time-to-merge. Regardless of the contextual factors that can influence pull
request size or composition (e.g., programming language), the observation
holds. Pull request data from two other platforms: Gerrit and Phabricator
(401,790 code reviews) confirms the lack of relationship. This negative result
as in ""... eliminate useless hypotheses ..."" challenges a widespread belief by
showing that small code changes do not merge faster to increase code velocity.
","[{'version': 'v1', 'created': 'Wed, 9 Mar 2022 21:00:56 GMT'}]",2022-12-01,"[['Kudrjavets', 'Gunnar', '', 'University of Groningen'], ['Nagappan', 'Nachiappan', '', 'Meta\n  Platforms, Inc.'], ['Rastogi', 'Ayushi', '', 'University of Groningen']]","['Pull request', 'code review velocity', 'pull request size', 'GitHub']"
11165,2011.02307,Kaicong Sun,Kaicong Sun and Sven Simon,FDRN: A Fast Deformable Registration Network for Medical Images,,,10.1002/mp.15011,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deformable image registration is a fundamental task in medical imaging. Due
to the large computational complexity of deformable registration of volumetric
images, conventional iterative methods usually face the tradeoff between the
registration accuracy and the computation time in practice. In order to boost
the registration performance in both accuracy and runtime, we propose a fast
convolutional neural network. Specially, to efficiently utilize the memory
resources and enlarge the model capacity, we adopt additive forwarding instead
of channel concatenation and deepen the network in each encoder and decoder
stage. To facilitate the learning efficiency, we leverage skip connection
within the encoder and decoder stages to enable residual learning and employ an
auxiliary loss at the bottom layer with lowest resolution to involve deep
supervision. Particularly, the low-resolution auxiliary loss is weighted by an
exponentially decayed parameter during the training phase. In conjunction with
the main loss in high-resolution grid, a coarse-to-fine learning strategy is
achieved. Last but not least, we introduce an auxiliary loss based on the
segmentation prior to improve the registration performance in Dice score.
Comparing to the auxiliary loss using average Dice score, the proposed
multi-label segmentation loss does not induce additional memory cost in the
training phase and can be employed on images with arbitrary amount of
categories. In the experiments, we show FDRN outperforms the existing
state-of-the-art registration methods for brain MR images by resorting to the
compact network structure and efficient learning. Besides, FDRN is a
generalized framework for image registration which is not confined to a
particular type of medical images or anatomy.
","[{'version': 'v1', 'created': 'Wed, 4 Nov 2020 14:09:51 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Mar 2021 21:42:08 GMT'}, {'version': 'v3', 'created': 'Wed, 14 Apr 2021 20:38:55 GMT'}, {'version': 'v4', 'created': 'Wed, 23 Jun 2021 18:43:32 GMT'}]",2022-01-19,"[['Sun', 'Kaicong', ''], ['Simon', 'Sven', '']]","['Deformable image registration', 'brain MRI registration', 'multi-labelsegmentation loss', 'deep supervision', 'encoder-decoder network', 'coarse-to-fine learning']"
11166,1709.08990,Daniel Lemire,"Daniel Lemire, Nathan Kurz, Christoph Rupp",Stream VByte: Faster Byte-Oriented Integer Compression,,"Information Processing Letters 130, February 2018, Pages 1-6",10.1016/j.ipl.2017.09.011,,cs.IR cs.DB,http://creativecommons.org/licenses/by/4.0/,"  Arrays of integers are often compressed in search engines. Though there are
many ways to compress integers, we are interested in the popular byte-oriented
integer compression techniques (e.g., VByte or Google's Varint-GB). They are
appealing due to their simplicity and engineering convenience. Amazon's
varint-G8IU is one of the fastest byte-oriented compression technique published
so far. It makes judicious use of the powerful single-instruction-multiple-data
(SIMD) instructions available in commodity processors. To surpass varint-G8IU,
we present Stream VByte, a novel byte-oriented compression technique that
separates the control stream from the encoded data. Like varint-G8IU, Stream
VByte is well suited for SIMD instructions. We show that Stream VByte decoding
can be up to twice as fast as varint-G8IU decoding over real data sets. In this
sense, Stream VByte establishes new speed records for byte-oriented integer
compression, at times exceeding the speed of the memcpy function. On a 3.4GHz
Haswell processor, it decodes more than 4 billion differentially-coded integers
per second from RAM to L1 cache.
","[{'version': 'v1', 'created': 'Mon, 25 Sep 2017 14:45:20 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Sep 2017 19:53:20 GMT'}]",2017-10-11,"[['Lemire', 'Daniel', ''], ['Kurz', 'Nathan', ''], ['Rupp', 'Christoph', '']]","['Data compression', 'Indexing', 'Vectorization', 'SIMD Instructions']"
11167,1710.05311,Sayan Nag,Sayan Nag,"Vector Quantization using the Improved Differential Evolution Algorithm
  for Image Compression",11 pages,,10.17605/OSF.IO/M9RNZ,,cs.CV cs.MM cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vector Quantization, VQ is a popular image compression technique with a
simple decoding architecture and high compression ratio. Codebook designing is
the most essential part in Vector Quantization. LindeBuzoGray, LBG is a
traditional method of generation of VQ Codebook which results in lower PSNR
value. A Codebook affects the quality of image compression, so the choice of an
appropriate codebook is a must. Several optimization techniques have been
proposed for global codebook generation to enhance the quality of image
compression. In this paper, a novel algorithm called IDE-LBG is proposed which
uses Improved Differential Evolution Algorithm coupled with LBG for generating
optimum VQ Codebooks. The proposed IDE works better than the traditional DE
with modifications in the scaling factor and the boundary control mechanism.
The IDE generates better solutions by efficient exploration and exploitation of
the search space. Then the best optimal solution obtained by the IDE is
provided as the initial Codebook for the LBG. This approach produces an
efficient Codebook with less computational time and the consequences include
excellent PSNR values and superior quality reconstructed images. It is observed
that the proposed IDE-LBG find better VQ Codebooks as compared to IPSO-LBG,
BA-LBG and FA-LBG.
","[{'version': 'v1', 'created': 'Sun, 15 Oct 2017 10:31:52 GMT'}]",2017-10-17,"[['Nag', 'Sayan', '']]","['Image Compression', 'Vector Quantization', 'Codebook', 'Improved Differential Evolution (IDE)']"
11168,2008.12843,Charalambos Konstantinou,"Jim Stright, Peter Cheetham, Charalambos Konstantinou",Defensive Cost-Benefit Analysis of Smart Grid Digital Functionalities,,International Journal of Critical Infrastructure Protection (2021),10.1016/j.ijcip.2021.100489,,cs.CR cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern smart grids offer several types of digital control and monitoring of
electric power transmission and distribution that enable greater efficiency and
integrative functionality than traditional power grids. These benefits,
however, introduce greater complexity and greatly disrupt and expand the threat
landscape. The number of vulnerabilities is increasing as grid-connected
devices proliferate. The potential costs to society of these vulnerabilities
are difficult to determine, as are their likelihoods of successful
exploitation. In this article, we present a method for comparing the net
economic benefits and costs of the various cyber-functionalities associated
with smart grids from the perspective of cyberattack vulnerabilities and
defending against them. The economic considerations of cyber defense spending
suggest the existence of optimal levels of expenditures, which might vary among
digital functionalities. We illustrate hypothetical case studies on how digital
functionalities can be assessed and compared with respect to the costs of
defending them from cyberattacks.
","[{'version': 'v1', 'created': 'Fri, 28 Aug 2020 20:55:23 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Oct 2021 06:39:57 GMT'}]",2021-10-14,"[['Stright', 'Jim', ''], ['Cheetham', 'Peter', ''], ['Konstantinou', 'Charalambos', '']]","['Smart grid', 'cost-benefit analysis', 'security management']"
11169,2207.12566,Xiaoyan Zhou,"Xiaoyan Zhou, Adam S. Williams, Francisco R. Ortega","Eliciting Multimodal Gesture+Speech Interactions in a Multi-Object
  Augmented Reality Environment",,,10.1145/3562939.3565637,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  As augmented reality technology and hardware become more mature and
affordable, researchers have been exploring more intuitive and discoverable
interaction techniques for immersive environments. In this paper, we
investigate multimodal interaction for 3D object manipulation in a multi-object
virtual environment. To identify the user-defined gestures, we conducted an
elicitation study involving 24 participants for 22 referents with an augmented
reality headset. It yielded 528 proposals and generated a winning gesture set
with 25 gestures after binning and ranking all gesture proposals. We found that
for the same task, the same gesture was preferred for both one and two object
manipulation, although both hands were used in the two object scenario. We
presented the gestures and speech results, and the differences compared to
similar studies in a single object virtual environment. The study also explored
the association between speech expressions and gesture stroke during object
manipulation, which could improve the recognizer efficiency in augmented
reality headsets.
","[{'version': 'v1', 'created': 'Mon, 25 Jul 2022 22:51:40 GMT'}]",2022-12-02,"[['Zhou', 'Xiaoyan', ''], ['Williams', 'Adam S.', ''], ['Ortega', 'Francisco R.', '']]","['elicitation', 'multimodal interaction', 'augmented reality', 'gesture andspeech interaction', 'multi-object virtual environment']"
11170,2001.03515,Francesco Del Duchetto,"Francesco Del Duchetto, Paul Baxter, Marc Hanheide","Are you still with me? Continuous Engagement Assessment from a Robot's
  Point of View",,Front. Robot. AI 7:116 (2020),10.3389/frobt.2020.00116,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Continuously measuring the engagement of users with a robot in a Human-Robot
Interaction (HRI) setting paves the way towards in-situ reinforcement learning,
improve metrics of interaction quality, and can guide interaction design and
behaviour optimisation. However, engagement is often considered very
multi-faceted and difficult to capture in a workable and generic computational
model that can serve as an overall measure of engagement. Building upon the
intuitive ways humans successfully can assess situation for a degree of
engagement when they see it, we propose a novel regression model (utilising CNN
and LSTM networks) enabling robots to compute a single scalar engagement during
interactions with humans from standard video streams, obtained from the point
of view of an interacting robot. The model is based on a long-term dataset from
an autonomous tour guide robot deployed in a public museum, with continuous
annotation of a numeric engagement assessment by three independent coders. We
show that this model not only can predict engagement very well in our own
application domain but show its successful transfer to an entirely different
dataset (with different tasks, environment, camera, robot and people). The
trained model and the software is available to the HRI community as a tool to
measure engagement in a variety of settings.
","[{'version': 'v1', 'created': 'Fri, 10 Jan 2020 15:38:07 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Jan 2020 09:32:05 GMT'}, {'version': 'v3', 'created': 'Sat, 15 May 2021 14:44:38 GMT'}]",2021-05-18,"[['Del Duchetto', 'Francesco', ''], ['Baxter', 'Paul', ''], ['Hanheide', 'Marc', '']]","['engagement', 'machine learning', 'tools for HRI', 'long-term autonomy']"
11171,1904.10283,Abolghasem Daeichian,Abolghasem Daeichian and Elham Honarvar,"Modified Covariance Intersection for Data Fusion in Distributed
  Non-homogeneous Monitoring Systems Network",12 pages; 8 figures,"International Journal of Robust and Nonlinear Control 28.4 (2018):
  1413-1424",10.1002/rnc.3964,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Monitoring networks contain monitoring nodes which observe an area of
interest to detect any possible existing object and estimate its states. Each
node has characteristics such as probability of detection and clutter density
which may have different values for distinct nodes in non-homogeneous
monitoring networks. This paper proposes a modified covariance intersection
method for data fusion in such networks. It is derived by formulating a mixed
game model between neighbor monitoring nodes as players and considering inverse
of the trace of fused covariance matrix as players' utility function.
Monitoring nodes estimate the states of any possible existing object by
applying joint target detection and tracking filter on their own observations.
Processing nodes fuse the estimated states received from neighbor monitoring
nodes by the proposed modified covariance intersection. It is validated by
simulating target detection and tracking problem in two situations: one-target
and unknown number of targets.
","[{'version': 'v1', 'created': 'Tue, 23 Apr 2019 12:40:22 GMT'}]",2019-04-24,"[['Daeichian', 'Abolghasem', ''], ['Honarvar', 'Elham', '']]","['data fusion', 'covariance intersection', 'target detection and tracking', 'game theory']"
11172,1907.00297,Grzegorz Krzy\.zanowski,"Grzegorz Krzy\.zanowski, Marcin Magdziarz, {\L}ukasz P{\l}ociniczak",A weighted finite difference method for subdiffusive Black Scholes Model,,Computers & Mathematics with Applications 80.5 (2020): 653-670,10.1016/j.camwa.2020.04.029,,cs.CE cs.NA math.NA q-fin.CP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we focus on the subdiffusive Black Scholes model. The main part
of our work consists of the finite difference method as a numerical approach to
the option pricing in the considered model. We derive the governing fractional
differential equation and the related weighted numerical scheme being a
generalization of the classical Crank-Nicolson scheme. The proposed method has
$2-\alpha$ order of accuracy with respect to time where $\alpha\in(0,1)$ is the
subdiffusion parameter, and $2$ with respect to space. Further, we provide the
stability and convergence analysis. Finally, we present some numerical results.
","[{'version': 'v1', 'created': 'Sat, 29 Jun 2019 23:40:07 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Dec 2019 23:25:45 GMT'}, {'version': 'v3', 'created': 'Sun, 5 Apr 2020 13:24:41 GMT'}, {'version': 'v4', 'created': 'Wed, 29 Apr 2020 00:27:56 GMT'}]",2021-04-19,"[['Krzyżanowski', 'Grzegorz', ''], ['Magdziarz', 'Marcin', ''], ['Płociniczak', 'Łukasz', '']]","['Weighted finite difference method', 'subdiffusion', 'time fractional Black-Scholes model', 'European option', 'Caputo fractional derivative']"
11173,2006.06052,Denis Demidov,"Denis Demidov, Lin Mu, Bin Wang",Accelerating linear solvers for Stokes problems with C++ metaprogramming,,,10.1016/j.jocs.2020.101285,,cs.MS cs.DC cs.DS physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The efficient solution of large sparse saddle point systems is very important
in computational fluid mechanics. The discontinuous Galerkin finite element
methods have become increasingly popular for incompressible flow problems but
their application is limited due to high computational cost. We describe the
C++ programming techniques that may help to accelerate linear solvers for such
problems. The approach is based on the policy-based design pattern and partial
template specialization, and is implemented in the open source AMGCL library.
The efficiency is demonstrated with the example of accelerating an iterative
solver of a discontinuous Galerkin finite element method for the Stokes
problem. The implementation allows selecting algorithmic components of the
solver by adjusting template parameters without any changes to the codebase. It
is possible to switch the system matrix to use small statically sized blocks to
store the nonzero values, or use a mixed precision solution, which results in
up to 4 times speedup, and reduces the memory footprint of the algorithm by
about 40\%. We evaluate both monolithic and composite preconditioning
strategies for the 3 benchmark problems. The performance of the proposed
solution is compared with a multithreaded direct Pardiso solver and a parallel
iterative PETSc solver.
","[{'version': 'v1', 'created': 'Wed, 10 Jun 2020 20:20:05 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Nov 2020 15:39:23 GMT'}, {'version': 'v3', 'created': 'Tue, 22 Dec 2020 06:02:43 GMT'}]",2021-01-18,"[['Demidov', 'Denis', ''], ['Mu', 'Lin', ''], ['Wang', 'Bin', '']]","['Stokes problem', 'C++ metaprogramming', 'algebraic multigrid', 'scalability']"
11174,1902.03306,Andrea Apicella,"Andrea Apicella, Francesco Isgr\`o, Roberto Prevete",A simple and efficient architecture for trainable activation functions,,Neurocomputing 370 (2019) 1-15,10.1016/j.neucom.2019.08.065,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning automatically the best activation function for the task is an active
topic in neural network research. At the moment, despite promising results, it
is still difficult to determine a method for learning an activation function
that is at the same time theoretically simple and easy to implement. Moreover,
most of the methods proposed so far introduce new parameters or adopt different
learning techniques. In this work we propose a simple method to obtain trained
activation function which adds to the neural network local subnetworks with a
small amount of neurons. Experiments show that this approach could lead to
better result with respect to using a pre-defined activation function, without
introducing a large amount of extra parameters that need to be learned.
","[{'version': 'v1', 'created': 'Fri, 8 Feb 2019 22:13:54 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Feb 2019 14:13:06 GMT'}]",2019-10-29,"[['Apicella', 'Andrea', ''], ['Isgrò', 'Francesco', ''], ['Prevete', 'Roberto', '']]","['neural networks', 'machine learning', 'activation functions', 'adaptive activation functions']"
11175,1806.05528,Jeremy Youngquist,"Meera Sitharam, Jeremy Youngquist, Maxwell Nolan, J\""org Peters",Corner-Sharing Tetrahedra for Modeling Micro-Structure,,,10.1016/j.cad.2019.05.015,,cs.CG cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  State-of-the-art representations of volumetric multi-scale shape and
structure can be classified into three broad categories: continuous,
continuous-from-discrete, and discrete representations. We propose modeling
micro-structure with a class of discrete Corner-Sharing Tetrahedra (CoSTs).
CoSTs can represent bar-joint, tensegrity, line-incidence, and similar
constraint systems that capture local physical constraints and global
multi-scale properties for design and analysis. The paper develops a palette of
simple geometry processing operations on CoSTs including graph manipulation,
hierarchical refinement, randomization, and generating associated continuous
representations.
","[{'version': 'v1', 'created': 'Fri, 1 Jun 2018 03:02:33 GMT'}]",2020-05-15,"[['Sitharam', 'Meera', ''], ['Youngquist', 'Jeremy', ''], ['Nolan', 'Maxwell', ''], ['Peters', 'Jörg', '']]","['Isostatic', '3d Printing', 'Micro-Mechanics']"
11176,2109.07815,Pawel Trajdos,"Pawel Trajdos, Robert Burduk",Probability-driven scoring functions in combining linear classifiers,,,10.3897/jucs.80747,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Although linear classifiers are one of the oldest methods in machine
learning, they are still very popular in the machine learning community. This
is due to their low computational complexity and robustness to overfitting.
Consequently, linear classifiers are often used as base classifiers of multiple
ensemble classification systems. This research is aimed at building a new
fusion method dedicated to the ensemble of linear classifiers. The fusion
scheme uses both measurement space and geometrical space. Namely, we proposed a
probability-driven scoring function which shape depends on the orientation of
the decision hyperplanes generated by the base classifiers. The proposed fusion
method is compared with the reference method using multiple benchmark datasets
taken from the KEEL repository. The comparison is done using multiple quality
criteria. The statistical analysis of the obtained results is also performed.
The experimental study shows that, under certain conditions, some improvement
may be obtained.
","[{'version': 'v1', 'created': 'Thu, 16 Sep 2021 08:58:32 GMT'}]",2022-03-29,"[['Trajdos', 'Pawel', ''], ['Burduk', 'Robert', '']]","['Linear Classifier', 'Potential Function', 'Ensemble of Classifiers', 'Score Function']"
11177,2002.06620,Shuai Zhao,"Shuai Zhao, Achir Kalra, Cristian Borcea and Yi Chen","To be Tough or Soft: Measuring the Impact of Counter-Ad-blocking
  Strategies on User Engagement",In Proceedings of The Web Conference 2020 (WWW 20),,10.1145/3366423.3380025,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  The fast growing ad-blocker usage results in large revenue decrease for
ad-supported online websites. Facing this problem, many online publishers
choose either to cooperate with ad-blocker software companies to show
acceptable ads or to build a wall that requires users to whitelist the site for
content access. However, there is lack of studies on the impact of these two
counter-ad-blocking strategies on user behaviors. To address this issue, we
conduct a randomized field experiment on the website of Forbes Media, a major
US media publisher. The ad-blocker users are divided into a treatment group,
which receives the wall strategy, and a control group, which receives the
acceptable ads strategy. We utilize the difference-in-differences method to
estimate the causal effects. Our study shows that the wall strategy has an
overall negative impact on user engagements. However, it has no statistically
significant effect on high-engaged users as they would view the pages no matter
what strategy is used. It has a big impact on low-engaged users, who have no
loyalty to the site. Our study also shows that revisiting behavior decreases
over time, but the ratio of session whitelisting increases over time as the
remaining users have relatively high loyalty and high engagement. The paper
concludes with discussions of managerial insights for publishers when
determining counter-ad-blocking strategies.
","[{'version': 'v1', 'created': 'Sun, 16 Feb 2020 17:04:27 GMT'}]",2020-02-18,"[['Zhao', 'Shuai', ''], ['Kalra', 'Achir', ''], ['Borcea', 'Cristian', ''], ['Chen', 'Yi', '']]","['Ad Blocking', 'Randomized Field Experiment', 'Difference-In-Differences', 'User Studies', 'Online Advertising']"
11178,2110.00415,Michael Kommenda,"Michael Kommenda, Johannes Karder, Andreas Beham, Bogdan Burlacu,
  Gabriel Kronberger, Stefan Wagner, Michael Affenzeller",Optimization Networks for Integrated Machine Learning,"International Conference on Computer Aided Systems Theory, Eurocast
  2017, pp 392-399","In: Moreno-D\'iaz R. et al (eds) Computer Aided Systems Theory,
  Eurocast 2017. Lecture Notes in Computer Science, Vol. 10671. Springer (2018)",10.1007/978-3-319-74718-7_47,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optimization networks are a new methodology for holistically solving
interrelated problems that have been developed with combinatorial optimization
problems in mind. In this contribution we revisit the core principles of
optimization networks and demonstrate their suitability for solving machine
learning problems. We use feature selection in combination with linear model
creation as a benchmark application and compare the results of optimization
networks to ordinary least squares with optional elastic net regularization.
Based on this example we justify the advantages of optimization networks by
adapting the network to solve other machine learning problems. Finally,
optimization analysis is presented, where optimal input values of a system have
to be found to achieve desired output values. Optimization analysis can be
divided into three subproblems: model creation to describe the system, model
selection to choose the most appropriate one and parameter optimization to
obtain the input values. Therefore, optimization networks are an obvious choice
for handling optimization analysis tasks.
","[{'version': 'v1', 'created': 'Wed, 1 Sep 2021 08:25:01 GMT'}]",2021-10-04,"[['Kommenda', 'Michael', ''], ['Karder', 'Johannes', ''], ['Beham', 'Andreas', ''], ['Burlacu', 'Bogdan', ''], ['Kronberger', 'Gabriel', ''], ['Wagner', 'Stefan', ''], ['Affenzeller', 'Michael', '']]","['Optimization Networks', 'Machine Learning', 'Feature Selection', 'Optimization Analysis']"
11179,2212.04355,Birgit Vogel-Heuser Prof. Dr.-Ing.,"Sebastian Ulewicz, Birgit Vogel-Heuser",Increasing System Test Coverage in Production Automation Systems,,Control Engineering Practice 73 (2018) 1,10.1016/j.conengprac.2018.01.010,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  An approach is introduced, which supports a testing technician in the
identification of possibly untested behavior of control software of fully
integrated automated production systems (aPS). Based on an approach for guided
semi-automatic system testing, execution traces are recorded during testing,
allowing a subsequent coverage assessment. As the behavior of an aPS is highly
dependent on the software, omitted system behavior can be identified and
assessed for criticality. Through close cooperation with industry, this
approach represents the first coverage assessment approach for system testing
in production automation to be applied on real industrial objects and evaluated
by industrial experts.
","[{'version': 'v1', 'created': 'Wed, 7 Dec 2022 13:55:00 GMT'}]",2022-12-12,"[['Ulewicz', 'Sebastian', ''], ['Vogel-Heuser', 'Birgit', '']]","['Automated production system', 'system testing', 'programmable logic controller', 'test coverage assessment', 'code instrumentation']"
11180,2008.10040,Taisuke Kobayashi,Taisuke Kobayashi,"Adaptive and Multiple Time-scale Eligibility Traces for Online Deep
  Reinforcement Learning","13 pages, 13 figures","Robotics and Autonomous Systems, 2022",10.1016/j.robot.2021.104019,,cs.RO cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep reinforcement learning (DRL) is one promising approach to teaching
robots to perform complex tasks. Because methods that directly reuse the stored
experience data cannot follow the change of the environment in robotic problems
with a time-varying environment, online DRL is required. The eligibility traces
method is well known as an online learning technique for improving sample
efficiency in traditional reinforcement learning with linear regressors rather
than DRL. The dependency between parameters of deep neural networks would
destroy the eligibility traces, which is why they are not integrated with DRL.
Although replacing the gradient with the most influential one rather than
accumulating the gradients as the eligibility traces can alleviate this
problem, the replacing operation reduces the number of reuses of previous
experiences. To address these issues, this study proposes a new eligibility
traces method that can be used even in DRL while maintaining high sample
efficiency. When the accumulated gradients differ from those computed using the
latest parameters, the proposed method takes into account the divergence
between the past and latest parameters to adaptively decay the eligibility
traces. Bregman divergences between outputs computed by the past and latest
parameters are exploited due to the infeasible computational cost of the
divergence between the past and latest parameters. In addition, a generalized
method with multiple time-scale traces is designed for the first time. This
design allows for the replacement of the most influential adaptively
accumulated (decayed) eligibility traces.
","[{'version': 'v1', 'created': 'Sun, 23 Aug 2020 13:35:50 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Jan 2022 00:51:09 GMT'}]",2022-01-26,"[['Kobayashi', 'Taisuke', '']]","['Deep reinforcement learning', 'Online learning', 'Eligibility traces']"
11181,2112.15439,Peng Zheng,"Deng-Ping Fan, Ziling Huang, Peng Zheng, Hong Liu, Xuebin Qin, and Luc
  Van Gool",Facial-Sketch Synthesis: A New Challenge,Accepted to Machine Intelligence Research (MIR),,10.1007/s11633-022-1349-9,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  This paper aims to conduct a comprehensive study on facial-sketch synthesis
(FSS). However, due to the high costs of obtaining hand-drawn sketch datasets,
there lacks a complete benchmark for assessing the development of FSS
algorithms over the last decade. We first introduce a high-quality dataset for
FSS, named FS2K, which consists of 2,104 image-sketch pairs spanning three
types of sketch styles, image backgrounds, lighting conditions, skin colors,
and facial attributes. FS2K differs from previous FSS datasets in difficulty,
diversity, and scalability and should thus facilitate the progress of FSS
research. Second, we present the largest-scale FSS investigation by reviewing
89 classical methods, including 25 handcrafted feature-based facial-sketch
synthesis approaches, 29 general translation methods, and 35 image-to-sketch
approaches. Besides, we elaborate comprehensive experiments on the existing 19
cutting-edge models. Third, we present a simple baseline for FSS, named FSGAN.
With only two straightforward components, i.e., facial-aware masking and
style-vector expansion, FSGAN surpasses the performance of all previous
state-of-the-art models on the proposed FS2K dataset by a large margin.
Finally, we conclude with lessons learned over the past years and point out
several unsolved challenges. Our code is available at
https://github.com/DengPingFan/FSGAN.
","[{'version': 'v1', 'created': 'Fri, 31 Dec 2021 13:19:21 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Jan 2022 01:09:03 GMT'}, {'version': 'v3', 'created': 'Wed, 30 Mar 2022 12:30:05 GMT'}, {'version': 'v4', 'created': 'Mon, 23 May 2022 10:30:22 GMT'}, {'version': 'v5', 'created': 'Wed, 15 Jun 2022 13:44:27 GMT'}, {'version': 'v6', 'created': 'Mon, 11 Jul 2022 22:07:30 GMT'}]",2022-07-13,"[['Fan', 'Deng-Ping', ''], ['Huang', 'Ziling', ''], ['Zheng', 'Peng', ''], ['Liu', 'Hong', ''], ['Qin', 'Xuebin', ''], ['Van Gool', 'Luc', '']]","['Facial sketch synthesis', 'facial sketch dataset', 'benchmark', 'attribute', 'style transfer']"
11182,1706.09772,Ferrucio De Franco Rosa,"Ferrucio de Franco Rosa, Rodrigo Bonacin and Mario Jino",The Security Assessment Domain: A Survey of Taxonomies and Ontologies,,,10.13140/RG.2.2.12437.73441,PRJ04.35 -- H1 14/01088 TRT0049417,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of ontologies and taxonomies contributes by providing means to define
concepts, minimize the ambiguity, improve the interoperability and manage
knowledge of the security domain. Thus, this paper presents a literature survey
on ontologies and taxonomies concerning the Security Assessment domain. We
carried out it to uncover initiatives that aim at formalizing concepts from the
Information Security and Test and Assessment fields of research. We applied a
systematic review approach in seven scientific databases. 138 papers were
identified and divided into categories according to their main contributions,
namely: Ontology, Taxonomy and Survey. Based on their contents, we selected 47
papers on ontologies, 22 papers on taxonomies, and 11 papers on surveys. A
taxonomy has been devised to be used in the evaluation of the papers.
Summaries, tables, and a preliminary analysis of the selected works are
presented. Our main contributions are: 1) an updated literature review,
describing key characteristics, results, research issues, and application
domains of the papers; and 2) the taxonomy for the evaluation process. We have
also detected gaps in the Security Assessment literature that could be the
subject of further studies in the field. This work is meant to be useful for
security researchers who wish to adopt a formal approach in their methods and
techniques.
","[{'version': 'v1', 'created': 'Thu, 29 Jun 2017 14:29:24 GMT'}]",2017-06-30,"[['Rosa', 'Ferrucio de Franco', ''], ['Bonacin', 'Rodrigo', ''], ['Jino', 'Mario', '']]","['− Ontology', 'Taxonomy', 'Security Assessment']"
11183,1506.06024,Vitaly Perevoshchikov,Manfred Droste and Vitaly Perevoshchikov,Multi-weighted Automata and MSO Logic,"The final version appeared in the Proceedings of the 8th
  International Computer Science Symposium in Russia (CSR 2013)",,10.1007/978-3-642-38536-0_36,,cs.LO cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Weighted automata are non-deterministic automata where the transitions are
equipped with weights. They can model quantitative aspects of systems like
costs or energy consumption. The value of a run can be computed, for example,
as the maximum, limit average, or discounted sum of transition weights. In
multi-weighted automata, transitions carry several weights and can model, for
example, the ratio between rewards and costs, or the efficiency of use of a
primary resource under some upper bound constraint on a secondary resource.
Here, we introduce a general model for multi-weighted automata as well as a
multiweighted MSO logic. In our main results, we show that this multi-weighted
MSO logic and multi-weighted automata are expressively equivalent both for
finite and infinite words. The translation process is effective, leading to
decidability results for our multi-weighted MSO logic.
","[{'version': 'v1', 'created': 'Fri, 19 Jun 2015 14:39:15 GMT'}]",2015-06-22,"[['Droste', 'Manfred', ''], ['Perevoshchikov', 'Vitaly', '']]","['Multi-priced automata', 'quantitative logic', 'average behavior', 'powerseries']"
11184,2005.04593,Ritam Guha Mr.,"Ritam Guha, Manosij Ghosh, Shyok Mutsuddi, Ram Sarkar, Seyedali
  Mirjalili","Embedded Chaotic Whale Survival Algorithm for Filter-Wrapper Feature
  Selection","28 pages, 6 figures, submitted a minor revision to Soft Computing,
  Springer",,10.1007/s00500-020-05183-1,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classification accuracy provided by a machine learning model depends a lot on
the feature set used in the learning process. Feature Selection (FS) is an
important and challenging pre-processing technique which helps to identify only
the relevant features from a dataset thereby reducing the feature dimension as
well as improving the classification accuracy at the same time. The binary
version of Whale Optimization Algorithm (WOA) is a popular FS technique which
is inspired from the foraging behavior of humpback whales. In this paper, an
embedded version of WOA called Embedded Chaotic Whale Survival Algorithm
(ECWSA) has been proposed which uses its wrapper process to achieve high
classification accuracy and a filter approach to further refine the selected
subset with low computation cost. Chaos has been introduced in the ECWSA to
guide selection of the type of movement followed by the whales while searching
for prey. A fitness-dependent death mechanism has also been introduced in the
system of whales which is inspired from the real-life scenario in which whales
die if they are unable to catch their prey. The proposed method has been
evaluated on 18 well-known UCI datasets and compared with its predecessors as
well as some other popular FS methods.
","[{'version': 'v1', 'created': 'Sun, 10 May 2020 07:01:18 GMT'}]",2020-09-01,"[['Guha', 'Ritam', ''], ['Ghosh', 'Manosij', ''], ['Mutsuddi', 'Shyok', ''], ['Sarkar', 'Ram', ''], ['Mirjalili', 'Seyedali', '']]","['Whale Optimization Algorithm', 'Feature Selection', 'Embedded Systems', 'Chaotic Mapping', 'UCI dataset']"
11185,2004.03481,Lijun Sun Mr,"Lijun Sun, Xinyu Chen, Zhaocheng He and Luis F. Miranda-Moreno","Routine pattern discovery and anomaly detection in individual travel
  behavior",,Networks and Spatial Economics (2021),10.1007/s11067-021-09542-9,,cs.SI cs.CY stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Discovering patterns and detecting anomalies in individual travel behavior is
a crucial problem in both research and practice. In this paper, we address this
problem by building a probabilistic framework to model individual
spatiotemporal travel behavior data (e.g., trip records and trajectory data).
We develop a two-dimensional latent Dirichlet allocation (LDA) model to
characterize the generative mechanism of spatiotemporal trip records of each
traveler. This model introduces two separate factor matrices for the spatial
dimension and the temporal dimension, respectively, and use a two-dimensional
core structure at the individual level to effectively model the joint
interactions and complex dependencies. This model can efficiently summarize
travel behavior patterns on both spatial and temporal dimensions from very
sparse trip sequences in an unsupervised way. In this way, complex travel
behavior can be modeled as a mixture of representative and interpretable
spatiotemporal patterns. By applying the trained model on future/unseen
spatiotemporal records of a traveler, we can detect her behavior anomalies by
scoring those observations using perplexity. We demonstrate the effectiveness
of the proposed modeling framework on a real-world license plate recognition
(LPR) data set. The results confirm the advantage of statistical learning
methods in modeling sparse individual travel behavior data. This type of
pattern discovery and anomaly detection applications can provide useful
insights for traffic monitoring, law enforcement, and individual travel
behavior profiling.
","[{'version': 'v1', 'created': 'Sun, 5 Apr 2020 14:28:26 GMT'}]",2021-06-15,"[['Sun', 'Lijun', ''], ['Chen', 'Xinyu', ''], ['He', 'Zhaocheng', ''], ['Miranda-Moreno', 'Luis F.', '']]","['Travel behavior', 'Pattern recognition', 'Anomaly detection', 'Spatiotemporal modeling', 'License platerecognition data']"
11186,1904.04271,Matthias Niedermaier,"Matthias Niedermaier, Thomas Hanka, Sven Plaga, Alexander von Bodisco,
  Dominik Merli","Efficient Passive ICS Device Discovery and Identification by MAC Address
  Correlation",http://dx.doi.org/10.14236/ewic/ICS2018.3,,10.14236/ewic/ICS2018.3,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Owing to a growing number of attacks, the assessment of Industrial Control
Systems (ICSs) has gained in importance. An integral part of an assessment is
the creation of a detailed inventory of all connected devices, enabling
vulnerability evaluations. For this purpose, scans of networks are crucial.
Active scanning, which generates irregular traffic, is a method to get an
overview of connected and active devices. Since such additional traffic may
lead to an unexpected behavior of devices, active scanning methods should be
avoided in critical infrastructure networks. In such cases, passive network
monitoring offers an alternative, which is often used in conjunction with
complex deep-packet inspection techniques. There are very few publications on
lightweight passive scanning methodologies for industrial networks. In this
paper, we propose a lightweight passive network monitoring technique using an
efficient Media Access Control (MAC) address-based identification of industrial
devices. Based on an incomplete set of known MAC address to device
associations, the presented method can guess correct device and vendor
information. Proving the feasibility of the method, an implementation is also
introduced and evaluated regarding its efficiency. The feasibility of
predicting a specific device/vendor combination is demonstrated by having
similar devices in the database. In our ICS testbed, we reached a host
discovery rate of 100% at an identification rate of more than 66%,
outperforming the results of existing tools.
","[{'version': 'v1', 'created': 'Mon, 8 Apr 2019 18:01:19 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Aug 2019 18:17:16 GMT'}]",2019-08-14,"[['Niedermaier', 'Matthias', ''], ['Hanka', 'Thomas', ''], ['Plaga', 'Sven', ''], ['von Bodisco', 'Alexander', ''], ['Merli', 'Dominik', '']]","['industrial control systems', 'vulnerability scanner', 'programmable logic controllers', 'security assessment']"
11187,2207.12768,Mia Mohammad Imran,"Mia Mohammad Imran, Kostadin Damevski",Using clarification questions to improve software developers' Web search,,,10.1016/j.infsof.2022.107021,,cs.SE cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Context: Recent research indicates that Web queries written by software
developers are not very successful in retrieving relevant results, performing
measurably worse compared to general purpose Web queries. Most approaches up to
this point have addressed this problem with software engineering-specific
automated query reformulation techniques, which work without developer
involvement but are limited by the content of the original query. In other
words, these techniques automatically improve the existing query but can not
contribute new, previously unmentioned, concepts.
  Objective: In this paper, we propose a technique to guide software developers
in manually improving their own Web search queries. We examine a conversational
approach that follows unsuccessful queries with a clarification question aimed
at eliciting additional query terms, thus providing to the developer a clear
dimension along which the query could be improved.
  Methods: We describe a set of clarification questions derived from a corpus
of software developer queries and a neural approach to recommending them for a
newly issued query.
  Results: Our evaluation indicates that the recommendation technique is
accurate, predicting a valid clarification question 80% of the time and
outperforms simple baselines, as well as, state-of-the-art Learning To Rank
(LTR) baselines.
  Conclusion: As shown in the experimental results, the described approach is
capable at recommending appropriate clarification questions to software
developers and considered useful by a sample of developers ranging from novices
to experienced professionals.
","[{'version': 'v1', 'created': 'Tue, 26 Jul 2022 09:23:06 GMT'}]",2022-07-27,"[['Imran', 'Mia Mohammad', ''], ['Damevski', 'Kostadin', '']]","['software engineering-related search', 'clarification questions', 'query']"
11188,1912.06850,Wishnu Prasetya,"Tanja E.J. Vos, I.S.W.B. Prasetya, Gordon Fraser, Ivan Martinez-Ortiz,
  Ivan Perez-Colado, Rui Prada, Jose Rocha, Antonio Rito Silva","IMPRESS: Improving Engagement in Software Engineering Courses through
  Gamification",,"Proceedings of the 20th International Conference on
  Product-Focused Software Process Improvement (PROFES), 2019",10.1007/978-3-030-35333-9_47,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Software Engineering courses play an important role for preparing students
with the right knowledge and attitude for software development in practice. The
implication is far reaching, as the quality of the software that we use
ultimately depends on the quality of the people that make them. Educating
Software Engineering, however, is quite challenging, as the subject is not
considered as most exciting by students, while teachers often have to deal with
exploding number of students. The EU project IMPRESS seeks to explore the use
of gamification in educating software engineering at the university level to
improve students' engagement and hence their appreciation for the taught
subjects. This paper presents the project, its objectives, and its current
progress.
","[{'version': 'v1', 'created': 'Sat, 14 Dec 2019 14:09:15 GMT'}]",2019-12-17,"[['Vos', 'Tanja E. J.', ''], ['Prasetya', 'I. S. W. B.', ''], ['Fraser', 'Gordon', ''], ['Martinez-Ortiz', 'Ivan', ''], ['Perez-Colado', 'Ivan', ''], ['Prada', 'Rui', ''], ['Rocha', 'Jose', ''], ['Silva', 'Antonio Rito', '']]","['software engineering education', 'gamification in education', 'gamification in software engineering education']"
11189,2202.03104,Jun Xia,"Jun Xia, Lirong Wu, Jintao Chen, Bozhen Hu, Stan Z.Li","SimGRACE: A Simple Framework for Graph Contrastive Learning without Data
  Augmentation",Accepted by The Web Conference 2022 (WWW 2022),The Web Conference 2022,10.1145/3485447.3512156,,cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph contrastive learning (GCL) has emerged as a dominant technique for
graph representation learning which maximizes the mutual information between
paired graph augmentations that share the same semantics. Unfortunately, it is
difficult to preserve semantics well during augmentations in view of the
diverse nature of graph data. Currently, data augmentations in GCL that are
designed to preserve semantics broadly fall into three unsatisfactory ways.
First, the augmentations can be manually picked per dataset by
trial-and-errors. Second, the augmentations can be selected via cumbersome
search. Third, the augmentations can be obtained by introducing expensive
domain-specific knowledge as guidance. All of these limit the efficiency and
more general applicability of existing GCL methods. To circumvent these crucial
issues, we propose a \underline{Sim}ple framework for \underline{GRA}ph
\underline{C}ontrastive l\underline{E}arning, \textbf{SimGRACE} for brevity,
which does not require data augmentations. Specifically, we take original graph
as input and GNN model with its perturbed version as two encoders to obtain two
correlated views for contrast. SimGRACE is inspired by the observation that
graph data can preserve their semantics well during encoder perturbations while
not requiring manual trial-and-errors, cumbersome search or expensive domain
knowledge for augmentations selection. Also, we explain why SimGRACE can
succeed. Furthermore, we devise adversarial training scheme, dubbed
\textbf{AT-SimGRACE}, to enhance the robustness of graph contrastive learning
and theoretically explain the reasons. Albeit simple, we show that SimGRACE can
yield competitive or better performance compared with state-of-the-art methods
in terms of generalizability, transferability and robustness, while enjoying
unprecedented degree of flexibility and efficiency.
","[{'version': 'v1', 'created': 'Mon, 7 Feb 2022 12:33:14 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Feb 2022 15:26:05 GMT'}]",2022-02-14,"[['Xia', 'Jun', ''], ['Wu', 'Lirong', ''], ['Chen', 'Jintao', ''], ['Hu', 'Bozhen', ''], ['Li', 'Stan Z.', '']]","['Graph neural networks', 'graph self-supervised learning', 'contrastivelearning', 'graph representation learning', 'robustness']"
11190,1710.03953,Bilal Khan,"Bilal Khan, Hsuan-Wei Lee, Ian Fellows, Kirk Dombrowski","One-step Estimation of Networked Population Size: Respondent-Driven
  Capture-Recapture with Anonymity",,,10.1371/journal.pone.0195959,,cs.SI math.CO stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Population size estimates for hidden and hard-to-reach populations are
particularly important when members are known to suffer from disproportion
health issues or to pose health risks to the larger ambient population in which
they are embedded. Efforts to derive size estimates are often frustrated by a
range of factors that preclude conventional survey strategies, including social
stigma associated with group membership or members' involvement in illegal
activities.
  This paper extends prior research on the problem of network population size
estimation, building on established survey/sampling methodologies commonly used
with hard-to-reach groups. Three novel one-step, network-based population size
estimators are presented, to be used in the context of uniform random sampling,
respondent-driven sampling, and when networks exhibit significant clustering
effects. Provably sufficient conditions for the consistency of these estimators
(in large configuration networks) are given. Simulation experiments across a
wide range of synthetic network topologies validate the performance of the
estimators, which are seen to perform well on a real-world location-based
social networking data set with significant clustering. Finally, the proposed
schemes are extended to allow them to be used in settings where participant
anonymity is required. Systematic experiments show favorable tradeoffs between
anonymity guarantees and estimator performance.
  Taken together, we demonstrate that reasonable population estimates can be
derived from anonymous respondent driven samples of 250-750 individuals, within
ambient populations of 5,000-40,000. The method thus represents a novel and
cost-effective means for health planners and those agencies concerned with
health and disease surveillance to estimate the size of hidden populations.
Limitations and future work are discussed in the concluding section.
","[{'version': 'v1', 'created': 'Wed, 11 Oct 2017 08:21:00 GMT'}]",2018-07-04,"[['Khan', 'Bilal', ''], ['Lee', 'Hsuan-Wei', ''], ['Fellows', 'Ian', ''], ['Dombrowski', 'Kirk', '']]","['capture-recapture', 'population size estimation', 'respondent driven sampling']"
11191,2110.00827,Lvzhou Li,"Zekun Ye, Lvzhou Li",Deterministic Algorithms for the Hidden Subgroup Problem,,"Information and Computation.Available online 14 October 2022,
  104975",10.1016/j.ic.2022.104975,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  We consider deterministic algorithms for the well-known hidden subgroup
problem ($\mathsf{HSP}$): for a finite group $G$ and a finite set $X$, given a
function $f:G \to X$ and the promise that for any $g_1, g_2 \in G, f(g_1) =
f(g_2)$ iff $g_1H=g_2H$ for a subgroup $H \le G$, the goal of the decision
version is to determine whether $H$ is trivial or not, and the goal of the
identification version is to identify $H$. An algorithm for the problem should
query $f(g)$ for $g\in G$ at least as possible. Nayak asked whether there exist
deterministic algorithms with $O(\sqrt{\frac{|G|}{|H|}})$ query complexity for
$\mathsf{HSP}$. We answer this problem by proving the following results, which
also extend the main results of Ref. [30], since here the algorithms do not
rely on any prior knowledge of $H$. (i)When $G$ is a general finite Abelian
group, there exist an algorithm with $O(\sqrt{\frac{|G|}{|H|}})$ queries to
decide the triviality of $H$ and an algorithm to identify $H$ with
$O(\sqrt{\frac{|G|}{|H|}\log |H|}+\log |H|)$ queries. (ii)In general there is
no deterministic algorithm for the identification version of $\mathsf{HSP}$
with query complexity of $O(\sqrt{\frac{|G|}{|H|}})$, since there exists an
instance of $\mathsf{HSP}$ that needs $\omega(\sqrt{\frac{|G|}{|H|}})$ queries
to identify $H$. $f(x)$ is said to be $\omega(g(x))$ if for every positive
constant $C$, there exists a positive constant $N$ such that for $x>N$,
$f(x)\ge C\cdot g(x)$, which means $g$ is a strict lower bound for $f$. On the
other hand, there exist instances of $\mathsf{HSP}$ with query complexity far
smaller than $O(\sqrt{\frac{|G|}{|H|}})$, whose query complexity is $O(\log
\frac{|G|}{|H|})$ and even $O(1)$.
","[{'version': 'v1', 'created': 'Sat, 2 Oct 2021 15:50:27 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Nov 2022 12:18:24 GMT'}]",2022-11-22,"[['Ye', 'Zekun', ''], ['Li', 'Lvzhou', '']]","['Hidden subgroup problem', 'deterministic algorithm', 'querycomplexity', 'quantum computing']"
11192,2112.04549,Hang Zhou,Claire Mathieu and Hang Zhou,A Simple Algorithm for Graph Reconstruction,,,10.4230/LIPIcs.ESA.2021.68,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  How efficiently can we find an unknown graph using distance queries between
its vertices? We assume that the unknown graph is connected, unweighted, and
has bounded degree. The goal is to find every edge in the graph. This problem
admits a reconstruction algorithm based on multi-phase Voronoi-cell
decomposition and using $\tilde O(n^{3/2})$ distance queries.
  In our work, we analyze a simple reconstruction algorithm. We show that, on
random $\Delta$-regular graphs, our algorithm uses $\tilde O(n)$ distance
queries. As by-products, we can reconstruct those graphs using $O(\log^2 n)$
queries to an all-distances oracle or $\tilde O(n)$ queries to a betweenness
oracle, and we bound the metric dimension of those graphs by $\log^2 n$.
  Our reconstruction algorithm has a very simple structure, and is highly
parallelizable. On general graphs of bounded degree, our reconstruction
algorithm has subquadratic query complexity.
","[{'version': 'v1', 'created': 'Wed, 8 Dec 2021 19:47:08 GMT'}]",2021-12-14,"[['Mathieu', 'Claire', ''], ['Zhou', 'Hang', '']]","['reconstruction', 'network topology', 'random regular graphs', 'metric dimension']"
11193,1412.2220,Zahra Vali,"Zahra Vali, Massoud Reza Hashemi, Neda Moghim",An Adaptive Load Balancing to Provide Quality of Service,,,10.7321/jscse.v3.n7.1,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to utilize network resources and provide a more reliable delivery of
information, multipath routing algorithms are used with a higher priority than
single path routing. But providing the quality of service (QoS) requirements
while load balancing is done among multiple paths is still a challenge. In this
paper a new load balancing algorithm is proposed by using an explicit endpoint
admission control (EEAC) to achieve a dynamic load balancing algorithm, with
the ability to guarantee the end-to-end QoS for a variety of service classes.
The simulation results for non deterministic network conditions show that the
proposed algorithm increases the utilization of network resources and also
decreases the end-to-end delay.
","[{'version': 'v1', 'created': 'Sat, 6 Dec 2014 10:57:06 GMT'}]",2014-12-09,"[['Vali', 'Zahra', ''], ['Hashemi', 'Massoud Reza', ''], ['Moghim', 'Neda', '']]","['multipath routing', 'load balancing', 'quality of service', 'admission control']"
11194,2203.12622,Youngmin Kim,"Youngmin Kim, Richard Allmendinger, Manuel L\'opez-Ib\'a\~nez",Are Evolutionary Algorithms Safe Optimizers?,"To be published in proceedings of Genetic and Evolutionary
  Computation Conference (GECCO 22), July 9-13, 2022, Boston, MA, USA. ACM, New
  York, NY, USA, 9 pages. https://doi.org/10.1145/3512290.3528818",,10.1145/3512290.3528818,,cs.NE cs.LG cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a type of constrained optimization problem, where the violation
of a constraint leads to an irrevocable loss, such as breakage of a valuable
experimental resource/platform or loss of human life. Such problems are
referred to as safe optimization problems (SafeOPs). While SafeOPs have
received attention in the machine learning community in recent years, there was
little interest in the evolutionary computation (EC) community despite some
early attempts between 2009 and 2011. Moreover, there is a lack of acceptable
guidelines on how to benchmark different algorithms for SafeOPs, an area where
the EC community has significant experience in. Driven by the need for more
efficient algorithms and benchmark guidelines for SafeOPs, the objective of
this paper is to reignite the interest of this problem class in the EC
community. To achieve this we (i) provide a formal definition of SafeOPs and
contrast it to other types of optimization problems that the EC community is
familiar with, (ii) investigate the impact of key SafeOP parameters on the
performance of selected safe optimization algorithms, (iii) benchmark EC
against state-of-the-art safe optimization algorithms from the machine learning
community, and (iv) provide an open-source Python framework to replicate and
extend our work.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2022 17:11:36 GMT'}, {'version': 'v2', 'created': 'Fri, 6 May 2022 21:09:01 GMT'}]",2022-05-10,"[['Kim', 'Youngmin', ''], ['Allmendinger', 'Richard', ''], ['López-Ibáñez', 'Manuel', '']]","['safe optimization', 'safety constraints', 'constrained optimization', 'Bayesian optimization', 'benchmarking']"
11195,2008.12736,Shalini Pandey,"Shalini Pandey, Jaideep Srivastava",RKT : Relation-Aware Self-Attention for Knowledge Tracing,,,10.1145/3340531.3411994,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The world has transitioned into a new phase of online learning in response to
the recent Covid19 pandemic. Now more than ever, it has become paramount to
push the limits of online learning in every manner to keep flourishing the
education system. One crucial component of online learning is Knowledge Tracing
(KT). The aim of KT is to model student's knowledge level based on their
answers to a sequence of exercises referred as interactions. Students acquire
their skills while solving exercises and each such interaction has a distinct
impact on student ability to solve a future exercise. This \textit{impact} is
characterized by 1) the relation between exercises involved in the interactions
and 2) student forget behavior. Traditional studies on knowledge tracing do not
explicitly model both the components jointly to estimate the impact of these
interactions. In this paper, we propose a novel Relation-aware self-attention
model for Knowledge Tracing (RKT). We introduce a relation-aware self-attention
layer that incorporates the contextual information. This contextual information
integrates both the exercise relation information through their textual content
as well as student performance data and the forget behavior information through
modeling an exponentially decaying kernel function. Extensive experiments on
three real-world datasets, among which two new collections are released to the
public, show that our model outperforms state-of-the-art knowledge tracing
methods. Furthermore, the interpretable attention weights help visualize the
relation between interactions and temporal patterns in the human learning
process.
","[{'version': 'v1', 'created': 'Fri, 28 Aug 2020 16:47:03 GMT'}]",2020-08-31,"[['Pandey', 'Shalini', ''], ['Srivastava', 'Jaideep', '']]","['Educational Data Mining', 'Knowledge Tracing', 'Relation-aware model', 'Attention Networks']"
11196,2101.11720,Federico Turrin,Luca Attanasio and Mauro Conti and Denis Donadel and Federico Turrin,MiniV2G: An Electric Vehicle Charging Emulator,,,10.1145/3457339.3457980,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The impact of global warming and the imperative to limit climate change have
stimulated the need to develop new solutions based on renewable energy sources.
One of the emerging trends in this endeavor are the Electric Vehicles (EVs),
which use electricity instead of traditional fossil fuels as a power source,
relying on the Vehicle-to-Grid (V2G) paradigm. The novelty of such a paradigm
requires careful analysis to avoid malicious attempts. An attacker can exploit
several surfaces, such as the remote connection between the Distribution Grid
and Charging Supply or the authentication system between the charging Supply
Equipment and the Electric Vehicles. However, V2G architecture's high cost and
complexity in implementation can restrain this field's research capability. In
this paper, we approach this limitation by proposing MiniV2G, an open-source
emulator to simulate Electric Vehicle Charging (EVC) built on top of Mininet
and RiseV2G. MiniV2G is particularly suitable for security researchers to study
and test real V2G charging scenarios. MiniV2G can reproduce with high fidelity
a V2G architecture to easily simulate an EV charging process. Finally, we
present a MiniV2G application and show how MiniV2G can be used to study V2G
communication and develop attacks and countermeasures that can be applied to
real systems. Since we believe our tool can be of great help for research in
this field, we also made it freely available.
","[{'version': 'v1', 'created': 'Wed, 27 Jan 2021 22:14:27 GMT'}]",2021-07-06,"[['Attanasio', 'Luca', ''], ['Conti', 'Mauro', ''], ['Donadel', 'Denis', ''], ['Turrin', 'Federico', '']]","['Mininet', 'Simulation', 'Electric Vehicle Supply Equipment', 'ElectricVehicle', 'Electric Charging']"
11197,1704.00617,James Cheney,James Cheney and Alberto Momigliano,$\alpha$Check: A mechanized metatheory model-checker,"Under consideration for publication in Theory and Practice of Logic
  Programming (TPLP)","Theory and Practice of Logic Programming, 17(3), 311-352 (2017)",10.1017/S1471068417000035,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of mechanically formalizing and proving metatheoretic properties
of programming language calculi, type systems, operational semantics, and
related formal systems has received considerable attention recently. However,
the dual problem of searching for errors in such formalizations has attracted
comparatively little attention. In this article, we present $\alpha$Check, a
bounded model-checker for metatheoretic properties of formal systems specified
using nominal logic. In contrast to the current state of the art for metatheory
verification, our approach is fully automatic, does not require expertise in
theorem proving on the part of the user, and produces counterexamples in the
case that a flaw is detected. We present two implementations of this technique,
one based on negation-as-failure and one based on negation elimination, along
with experimental results showing that these techniques are fast enough to be
used interactively to debug systems as they are developed.
","[{'version': 'v1', 'created': 'Mon, 3 Apr 2017 14:31:24 GMT'}]",2017-05-29,"[['Cheney', 'James', ''], ['Momigliano', 'Alberto', '']]","['nominal logic', 'model checking', 'counterexample search', 'negation elimination']"
11198,2006.09570,Clayton Miller,"Tapeesh Sood, Patrick Janssen, and Clayton Miller","Spacematch: Using environmental preferences to match occupants to
  suitable activity-based workspaces",,Front. Built Environ. 6:113 (2020),10.3389/fbuil.2020.00113,,cs.CY stat.ML,http://creativecommons.org/licenses/by/4.0/,"  The activity-based workspace (ABW) paradigm is becoming more popular in
commercial office spaces. In this strategy, occupants are given a choice of
spaces to do their work and personal activities on a day-to-day basis. This
paper shows the implementation and testing of the Spacematch platform that was
designed to improve the allocation and management of ABW. An experiment was
implemented to test the ability to characterize the preferences of occupants to
match them with suitable environmentally-comfortable and spatially-efficient
flexible workspaces. This approach connects occupants with a catalog of
available work desks using a web-based mobile application and enables them to
provide real-time environmental feedback. In this work, we tested the ability
for this feedback data to be merged with indoor environmental values from
Internet-of-Things (IoT) sensors to optimize space and energy use by grouping
occupants with similar preferences. This paper outlines a case study
implementation of this platform on two office buildings. This deployment
collected 1,182 responses from 25 field-based research participants over a
30-day study. From this initial data set, the results show that the ABW
occupants can be segmented into specific types of users based on their
accumulated preference data, and matching preferences can be derived to build a
recommendation platform.
","[{'version': 'v1', 'created': 'Wed, 17 Jun 2020 00:00:21 GMT'}]",2020-08-12,"[['Sood', 'Tapeesh', ''], ['Janssen', 'Patrick', ''], ['Miller', 'Clayton', '']]","['IoT -Internet of Things', 'Thermal comfort', 'Space utilisation', 'Flexible work arrangement', 'Activity-based workspaces']"
11199,2202.09228,Sam Van den Vonder,"Sam Van den Vonder (Vrije Universiteit Brussel, Belgium), Thierry
  Renaux (Vrije Universiteit Brussel, Belgium), Wolfgang De Meuter (Vrije
  Universiteit Brussel, Belgium)","Topology-Level Reactivity in Distributed Reactive Programs: Reactive
  Acquaintance Management using Flocks",,"The Art, Science, and Engineering of Programming, 2022, Vol. 6,
  Issue 3, Article 14",10.22152/programming-journal.org/2022/6/14,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reactive programming is a popular paradigm to program event-driven
applications, and it is often proposed as a paradigm to write distributed
applications. One such type of application is *prosumer* applications, which
are distributed applications that both produce and consume many events. We
analyse the problems that occur when using a reactive programming language or
framework to implement prosumer applications. We find that the assumption of an
open network, which means prosumers of various types spontaneously join and
leave the network, can cause a lot of code complexity or run-time inefficiency.
At the basis of these issues lies *acquaintance management*: the ability to
discover prosumers as they join and leave the network, and correctly
maintaining this state throughout the reactive program. Most existing reactive
programming languages and frameworks have limited support for managing
acquaintances, resulting in accidental complexity of the code or inefficient
computations.
  In this paper we present acquaintance management for reactive programs.
First, we design an *acquaintance discovery* mechanism to create a *flock* that
automatically discovers prosumers on the network. An important aspect of flocks
is their integration with reactive programs, such that a reactive program can
correctly and efficiently maintain its state. To this end we design an
*acquaintance maintenance* mechanism: a new type of operator for functional
reactive programming languages that we call `deploy-*`. The `deploy-*` operator
enables correct and efficient reactions to time-varying collections of
discovered prosumers. The proposed mechanisms are implemented in a reactive
programming language called Stella, which serves as a linguistic vehicle to
demonstrate the ideas of our approach. Our implementation of acquaintance
management results in computationally efficient and idiomatic reactive code.
  We evaluate our approach quantitatively via benchmarks that show that our
implementation is efficient: computations will efficiently update whenever a
new prosumer is discovered, or a connected prosumer is dropped. To evaluate the
distributed capabilities of our prototype implementation, we implement a
use-case that simulates the bike-sharing infrastructure of Brussels, and we run
it on a Raspberry Pi cluster computer. We consider our work to be an important
step to use functional reactive programming to build distributed systems for
open networks, in other words, distributed reactive programs that involve many
prosumer devices and sensors that spontaneously join and leave the network.
","[{'version': 'v1', 'created': 'Fri, 18 Feb 2022 14:54:22 GMT'}]",2022-02-21,"[['Vonder', 'Sam Van den', '', 'Vrije Universiteit Brussel, Belgium'], ['Renaux', 'Thierry', '', 'Vrije Universiteit Brussel, Belgium'], ['De Meuter', 'Wolfgang', '', 'Vrije\n  Universiteit Brussel, Belgium']]","['functional reactive programming', 'reactive streams', 'distributed programming', 'actors', 'reactors']"
11200,1710.03158,Marcelo Forets M. Forets,"Alexandre Rocca, Marcelo Forets, Victor Magron, Eric Fanchon, Thao
  Dang","Occupation measure methods for modelling and analysis of biological
  hybrid automata","11 pages with appendix 2 figures submitted to conference alphabetic
  order",,10.1016/j.ifacol.2018.08.031,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mechanistic models in biology often involve numerous parameters about which
we do not have direct experimental information. The traditional approach is to
fit these parameters using extensive numerical simulations (e.g. by the
Monte-Carlo method), and eventually revising the model if the predictions do
not correspond to the actual measurements. In this work we propose a
methodology for hybrid automaton model revision, when new type of functions are
needed to capture time varying parameters. To this end, we formulate a hybrid
optimal control problem with intermediate points as successive
infinite-dimensional linear programs (LP) on occupation measures. Then, these
infinite-dimensional LPs are solved using a hierarchy of semidefinite
relaxations. The whole procedure is exposed on a recent model for haemoglobin
production in erythrocytes.
","[{'version': 'v1', 'created': 'Mon, 9 Oct 2017 15:50:23 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Mar 2018 14:06:10 GMT'}]",2022-01-10,"[['Rocca', 'Alexandre', ''], ['Forets', 'Marcelo', ''], ['Magron', 'Victor', ''], ['Fanchon', 'Eric', ''], ['Dang', 'Thao', '']]","['biological modelling', 'hybrid dynamical system', 'optimal control problem', 'semidefinite optimization', 'occupation measures']"
11201,2201.01294,Trung-Hieu Tran,"Trung-Hieu Tran, Jan Berberich, Sven Simon","3DVSR: 3D EPI Volume-based Approach for Angular and Spatial Light field
  Image Super-resolution",,,10.1016/j.sigpro.2021.108373,,cs.CV cs.LG eess.IV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Light field (LF) imaging, which captures both spatial and angular information
of a scene, is undoubtedly beneficial to numerous applications. Although
various techniques have been proposed for LF acquisition, achieving both
angularly and spatially high-resolution LF remains a technology challenge. In
this paper, a learning-based approach applied to 3D epipolar image (EPI) is
proposed to reconstruct high-resolution LF. Through a 2-stage super-resolution
framework, the proposed approach effectively addresses various LF
super-resolution (SR) problems, i.e., spatial SR, angular SR, and
angular-spatial SR. While the first stage provides flexible options to
up-sample EPI volume to the desired resolution, the second stage, which
consists of a novel EPI volume-based refinement network (EVRN), substantially
enhances the quality of the high-resolution EPI volume. An extensive evaluation
on 90 challenging synthetic and real-world light field scenes from 7 published
datasets shows that the proposed approach outperforms state-of-the-art methods
to a large extend for both spatial and angular super-resolution problem, i.e.,
an average peak signal to noise ratio improvement of more than 2.0 dB, 1.4 dB,
and 3.14 dB in spatial SR $\times 2$, spatial SR $\times 4$, and angular SR
respectively. The reconstructed 4D light field demonstrates a balanced
performance distribution across all perspective images and presents superior
visual quality compared to the previous works.
","[{'version': 'v1', 'created': 'Tue, 4 Jan 2022 18:57:00 GMT'}]",2022-01-05,"[['Tran', 'Trung-Hieu', ''], ['Berberich', 'Jan', ''], ['Simon', 'Sven', '']]","['3D-EPI volume', 'angular super-resolution', 'deep learning', 'light field', 'spatial super-resolution']"
11202,1911.04397,Nikos Mavrakis,Nikos Mavrakis and Rustam Stolkin,"Estimation and Exploitation of Objects' Inertial Parameters in Robotic
  Grasping and Manipulation: A Survey","To be published in Robotics and Autonomous Systems, Elsevier",,10.1016/j.robot.2019.103374,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Inertial parameters characterise an object's motion under applied forces, and
can provide strong priors for planning and control of robotic actions to
manipulate the object. However, these parameters are not available a-priori in
situations where a robot encounters new objects. In this paper, we describe and
categorise the ways that a robot can identify an object's inertial parameters.
We also discuss grasping and manipulation methods in which knowledge of
inertial parameters is exploited in various ways. We begin with a discussion of
literature which investigates how humans estimate the inertial parameters of
objects, to provide background and motivation for this area of robotics
research. We frame our discussion of the robotics literature in terms of three
categories of estimation methods, according to the amount of interaction with
the object: purely visual, exploratory, and fixed-object. Each category is
analysed and discussed. To demonstrate the usefulness of inertial estimation
research, we describe a number of grasping and manipulation applications that
make use of the inertial parameters of objects. The aim of the paper is to
thoroughly review and categorise existing work in an important, but
under-explored, area of robotics research, present its background and
applications, and suggest future directions. Note that this paper does not
examine methods of identification of the robot's inertial parameters, but
rather the identification of inertial parameters of other objects which the
robot is tasked with manipulating.
","[{'version': 'v1', 'created': 'Mon, 11 Nov 2019 17:09:41 GMT'}]",2019-11-26,"[['Mavrakis', 'Nikos', ''], ['Stolkin', 'Rustam', '']]","['robot identification', 'inertial parameters', 'object dynamics', 'robot grasping', 'manipulation']"
11203,2207.00012,Kuan Li,"Kuan Li, Yang Liu, Xiang Ao, Jianfeng Chi, Jinghua Feng, Hao Yang,
  Qing He","Reliable Representations Make A Stronger Defender: Unsupervised
  Structure Refinement for Robust GNN",Accepted in KDD2022,,10.1145/3534678.3539484,,cs.LG cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Benefiting from the message passing mechanism, Graph Neural Networks (GNNs)
have been successful on flourish tasks over graph data. However, recent studies
have shown that attackers can catastrophically degrade the performance of GNNs
by maliciously modifying the graph structure. A straightforward solution to
remedy this issue is to model the edge weights by learning a metric function
between pairwise representations of two end nodes, which attempts to assign low
weights to adversarial edges. The existing methods use either raw features or
representations learned by supervised GNNs to model the edge weights. However,
both strategies are faced with some immediate problems: raw features cannot
represent various properties of nodes (e.g., structure information), and
representations learned by supervised GNN may suffer from the poor performance
of the classifier on the poisoned graph. We need representations that carry
both feature information and as mush correct structure information as possible
and are insensitive to structural perturbations. To this end, we propose an
unsupervised pipeline, named STABLE, to optimize the graph structure. Finally,
we input the well-refined graph into a downstream classifier. For this part, we
design an advanced GCN that significantly enhances the robustness of vanilla
GCN without increasing the time complexity. Extensive experiments on four
real-world graph benchmarks demonstrate that STABLE outperforms the
state-of-the-art methods and successfully defends against various attacks.
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2022 10:02:32 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Sep 2022 03:26:56 GMT'}, {'version': 'v3', 'created': 'Tue, 27 Sep 2022 09:38:07 GMT'}]",2022-09-28,"[['Li', 'Kuan', ''], ['Liu', 'Yang', ''], ['Ao', 'Xiang', ''], ['Chi', 'Jianfeng', ''], ['Feng', 'Jinghua', ''], ['Yang', 'Hao', ''], ['He', 'Qing', '']]","['Graph Neural Network', 'Graph Adversarial Attack', 'Structure Learning']"
11204,1905.13131,Mathias Kraus,"Mathias Kraus, Stefan Feuerriegel","Personalized Purchase Prediction of Market Baskets with
  Wasserstein-Based Sequence Matching","Accepted for oral presentation at 25th ACM SIGKDD Conference on
  Knowledge Discovery and Data Mining (KDD 2019)",,10.1145/3292500.3330791,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Personalization in marketing aims at improving the shopping experience of
customers by tailoring services to individuals. In order to achieve this,
businesses must be able to make personalized predictions regarding the next
purchase. That is, one must forecast the exact list of items that will comprise
the next purchase, i.e., the so-called market basket. Despite its relevance to
firm operations, this problem has received surprisingly little attention in
prior research, largely due to its inherent complexity. In fact,
state-of-the-art approaches are limited to intuitive decision rules for pattern
extraction. However, the simplicity of the pre-coded rules impedes performance,
since decision rules operate in an autoregressive fashion: the rules can only
make inferences from past purchases of a single customer without taking into
account the knowledge transfer that takes place between customers. In contrast,
our research overcomes the limitations of pre-set rules by contributing a novel
predictor of market baskets from sequential purchase histories: our predictions
are based on similarity matching in order to identify similar purchase habits
among the complete shopping histories of all customers. Our contributions are
as follows: (1) We propose similarity matching based on subsequential dynamic
time warping (SDTW) as a novel predictor of market baskets. Thereby, we can
effectively identify cross-customer patterns. (2) We leverage the Wasserstein
distance for measuring the similarity among embedded purchase histories. (3) We
develop a fast approximation algorithm for computing a lower bound of the
Wasserstein distance in our setting. An extensive series of computational
experiments demonstrates the effectiveness of our approach. The accuracy of
identifying the exact market baskets based on state-of-the-art decision rules
from the literature is outperformed by a factor of 4.0.
","[{'version': 'v1', 'created': 'Fri, 24 May 2019 10:08:18 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Jun 2019 16:05:25 GMT'}]",2019-09-12,"[['Kraus', 'Mathias', ''], ['Feuerriegel', 'Stefan', '']]","['purchase prediction', 'market basket', 'dynamic time warping', 'sequence matching', 'Wasserstein distance', 'product embeddings']"
11205,1907.05827,Ayon Borthakur Mr,"Ayon Borthakur, Thomas A. Cleland",Signal Conditioning for Learning in the Wild,"Neuro-inspired Computational Elements Workshop(NICE 19), March 26-28,
  2019, Albany, NY, USA. ACM, New York, NY, USA, 11 pages",,10.1145/3320288.3320293,,cs.NE q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The mammalian olfactory system learns rapidly from very few examples,
presented in unpredictable online sequences, and then recognizes these learned
odors under conditions of substantial interference without exhibiting
catastrophic forgetting. We have developed a brain-mimetic algorithm that
replicates these properties, provided that sensory inputs adhere to a common
statistical structure. However, in natural, unregulated environments, this
constraint cannot be assured. We here present a series of signal conditioning
steps, inspired by the mammalian olfactory system, that transform diverse
sensory inputs into a regularized statistical structure to which the learning
network can be tuned. This pre-processing enables a single instantiated network
to be applied to widely diverse classification tasks and datasets - here
including gas sensor data, remote sensing from spectral characteristics, and
multi-label hierarchical identification of wild species - without adjusting
network hyperparameters.
","[{'version': 'v1', 'created': 'Fri, 12 Jul 2019 16:25:50 GMT'}]",2019-07-15,"[['Borthakur', 'Ayon', ''], ['Cleland', 'Thomas A.', '']]","['Machine olfaction', 'remote sensing', 'mel frequency cepstral coefficients', 'catastrophic forgetting', 'few-shot learning', 'spiking neuralnetworks']"
11206,2209.01045,Sourav Ghosh,"Anupam Khan, Sourav Ghosh, Soumya K. Ghosh",eDWaaS: A Scalable Educational Data Warehouse as a Service,"17th International Conference on Intelligent Systems Design and
  Applications (ISDA 2017). Advances in Intelligent Systems and Computing, vol
  736. Springer, Cham. 7th World Congress on Information and Communication
  Technologies (WICT 2017). December 14-16, 2017. \copyright 2018 Springer
  International Publishing AG, part of Springer Nature","Intelligent Systems Design and Applications. ISDA 2017. Advances
  in Intelligent Systems and Computing, vol 736. Springer, Cham. pp. 998-1007",10.1007/978-3-319-76348-4_96,,cs.DB,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The university management is perpetually in the process of innovating
policies to improve the quality of service. Intellectual growth of the
students, the popularity of university are some of the major areas that
management strives to improve upon. Relevant historical data is needed in
support of taking any decision. Furthermore, providing data to various
university ranking frameworks is a frequent activity in recent years. The
format of such requirement changes frequently which requires efficient manual
effort. Maintaining a data warehouse can be a solution to this problem.
However, both in-house and outsourced implementation of a dedicated data
warehouse may not be a cost-effective and smart solution. This work proposes an
educational data warehouse as a service (eDWaaS) model to store historical data
for multiple universities. The proposed multi-tenant schema facilitates the
universities to maintain their data warehouse in a cost-effective solution. It
also addresses the scalability issues in implementing such data warehouse as a
service model.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2022 09:57:58 GMT'}]",2022-09-05,"[['Khan', 'Anupam', ''], ['Ghosh', 'Sourav', ''], ['Ghosh', 'Soumya K.', '']]","['Educational data management', 'data warehouse', 'service-orientedarchitecture', 'scalability']"
11207,1907.01930,Seyyedali Hosseinalipour,Seyyedali Hosseinalipour and Ali Rahmati and Huaiyu Dai,"Interference Avoidance Position Planning in Dual-hop and Multi-hop UAV
  Relay Networks","16 pages, 13 figures. arXiv admin note: substantial text overlap with
  arXiv:1903.01428","IEEE Transactions on Wireless Communications, 2020",10.1109/TWC.2020.3007766,,cs.NI cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider unmanned aerial vehicle (UAV)-assisted wireless communication
employing UAVs as relay nodes to increase the throughput between a pair of
transmitter and receiver. We focus on developing effective methods to position
the UAV(s) in the sky in the presence of interference in the environment, the
existence of which makes the problem non-trivial and our methodology different
from the current art. We study the optimal position planning, which aims to
maximize the (average) signal-to-interference-ratio (SIR) of the system, in the
presence of: i) one major source of interference, ii) stochastic interference.
For each scenario, we first consider utilizing a single UAV in the dual-hop
relay mode and determine its optimal position. Afterward, multiple UAVs in the
multi-hop relay mode are considered, for which we investigate two novel
problems concerned with determining the optimal number of required UAVs and
developing an optimal fully distributed position alignment method.
Subsequently, we propose a cost-effective method that simultaneously minimizes
the number of UAVs and determines their optimal positions to guarantee a
certain (average) SIR of the system. Alternatively, for a given number of UAVs,
we develop a fully distributed placement algorithm along with its performance
guarantee. Numerical simulations are provided to evaluate the performance of
our proposed methods.
","[{'version': 'v1', 'created': 'Tue, 2 Jul 2019 16:51:54 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Jul 2019 15:44:10 GMT'}, {'version': 'v3', 'created': 'Tue, 11 Feb 2020 02:15:42 GMT'}, {'version': 'v4', 'created': 'Mon, 27 Apr 2020 16:17:03 GMT'}, {'version': 'v5', 'created': 'Fri, 8 May 2020 03:00:51 GMT'}]",2020-07-21,"[['Hosseinalipour', 'Seyyedali', ''], ['Rahmati', 'Ali', ''], ['Dai', 'Huaiyu', '']]","['UAV', 'relay networks', 'interference avoidance', 'position planning', 'interference mitigation']"
11208,1806.07573,Heri Ramampiaro,{\O}ystein Repp and Heri Ramampiaro,Extracting News Events from Microblogs,,"In Journal of Statistics and Management Systems, 21(4), pp.
  695-723. Taylor & Francis",10.1080/09720510.2018.1486273,,cs.CL cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Twitter stream has become a large source of information for many people, but
the magnitude of tweets and the noisy nature of its content have made
harvesting the knowledge from Twitter a challenging task for researchers for a
long time. Aiming at overcoming some of the main challenges of extracting the
hidden information from tweet streams, this work proposes a new approach for
real-time detection of news events from the Twitter stream. We divide our
approach into three steps. The first step is to use a neural network or deep
learning to detect news-relevant tweets from the stream. The second step is to
apply a novel streaming data clustering algorithm to the detected news tweets
to form news events. The third and final step is to rank the detected events
based on the size of the event clusters and growth speed of the tweet
frequencies. We evaluate the proposed system on a large, publicly available
corpus of annotated news events from Twitter. As part of the evaluation, we
compare our approach with a related state-of-the-art solution. Overall, our
experiments and user-based evaluation show that our approach on detecting
current (real) news events delivers a state-of-the-art performance.
","[{'version': 'v1', 'created': 'Wed, 20 Jun 2018 06:54:17 GMT'}]",2018-06-21,"[['Repp', 'Øystein', ''], ['Ramampiaro', 'Heri', '']]","['Text mining', 'Deep Learning', 'Word Embedding', 'Information Extraction', 'Event Detection', 'Social Media']"
11209,1508.05804,Bernardo Gon\c{c}alves,"Bernardo Gon\c{c}alves, Fabio Porto",A note on the complexity of the causal ordering problem,"25 pages, 4 figures","Artificial Intelligence 238:154-65, 2016",10.1016/j.artint.2016.06.004,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this note we provide a concise report on the complexity of the causal
ordering problem, originally introduced by Simon to reason about causal
dependencies implicit in systems of mathematical equations. We show that
Simon's classical algorithm to infer causal ordering is NP-Hard---an
intractability previously guessed but never proven. We present then a detailed
account based on Nayak's suggested algorithmic solution (the best available),
which is dominated by computing transitive closure---bounded in time by
$O(|\mathcal V|\cdot |\mathcal S|)$, where $\mathcal S(\mathcal E, \mathcal V)$
is the input system structure composed of a set $\mathcal E$ of equations over
a set $\mathcal V$ of variables with number of variable appearances (density)
$|\mathcal S|$. We also comment on the potential of causal ordering for
emerging applications in large-scale hypothesis management and analytics.
","[{'version': 'v1', 'created': 'Mon, 24 Aug 2015 13:56:32 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Jun 2016 02:54:54 GMT'}]",2016-07-26,"[['Gonçalves', 'Bernardo', ''], ['Porto', 'Fabio', '']]","['Causal ordering', 'Causal reasoning', 'Structural equations', 'Hypothesis management']"
11210,2108.01977,Nils Kurbis,"Nils K\""urbis","Two Treatments of Definite Descriptions in Intuitionist Negative Free
  Logic",,Bulletin of the Section of Logic 48/4 (2019): 299-317,10.18778/0138-0680.48.4.04,,cs.LO math.LO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Sentences containing definite descriptions, expressions of the form `The
$F$', can be formalised using a binary quantifier $\iota$ that forms a formula
out of two predicates, where $\iota x[F, G]$ is read as `The $F$ is $G$'. This
is an innovation over the usual formalisation of definite descriptions with a
term forming operator. The present paper compares the two approaches. After a
brief overview of the system $\mathbf{INF}^\iota$ of intuitionist negative free
logic extended by such a quantifier, which was presented in
\citep{kurbisiotaI}, $\mathbf{INF}^\iota$ is first compared to a system of
Tennant's and an axiomatic treatment of a term forming $\iota$ operator within
intuitionist negative free logic. Both systems are shown to be equivalent to
the subsystem of $\mathbf{INF}^\iota$ in which the $G$ of $\iota x[F, G]$ is
restricted to identity. $\mathbf{INF}^\iota$ is then compared to an
intuitionist version of a system of Lambert's which in addition to the term
forming operator has an operator for predicate abstraction for indicating scope
distinctions. The two systems will be shown to be equivalent through a
translation between their respective languages. Advantages of the present
approach over the alternatives are indicated in the discussion.
","[{'version': 'v1', 'created': 'Wed, 4 Aug 2021 11:35:50 GMT'}]",2021-08-12,"[['Kürbis', 'Nils', '']]","['definite descriptions', 'binary quantifier', 'term forming operator', 'Lambert’s Law', 'intuitionist negative free logic', 'natural deduction']"
11211,1911.00385,Joseph Tassarotti,"Joseph Tassarotti, Koundinya Vajjha, Anindya Banerjee, Jean-Baptiste
  Tristan",A Formal Proof of PAC Learnability for Decision Stumps,"13 pages, appeared in Certified Programs and Proofs (CPP) 2021",,10.1145/3437992.3439917,,cs.LG cs.LO stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a formal proof in Lean of probably approximately correct (PAC)
learnability of the concept class of decision stumps. This classic result in
machine learning theory derives a bound on error probabilities for a simple
type of classifier. Though such a proof appears simple on paper, analytic and
measure-theoretic subtleties arise when carrying it out fully formally. Our
proof is structured so as to separate reasoning about deterministic properties
of a learning function from proofs of measurability and analysis of
probabilities.
","[{'version': 'v1', 'created': 'Fri, 1 Nov 2019 14:02:39 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Nov 2019 14:37:47 GMT'}, {'version': 'v3', 'created': 'Thu, 7 Jan 2021 22:38:00 GMT'}]",2021-01-11,"[['Tassarotti', 'Joseph', ''], ['Vajjha', 'Koundinya', ''], ['Banerjee', 'Anindya', ''], ['Tristan', 'Jean-Baptiste', '']]","['interactive theorem proving', 'probably approximately correct', 'decision stumps']"
11212,2207.00151,Yiming Huo,Yiming Huo,Space Broadband Access: The Race Has Just Begun,"8 pages, 3 figures, 2 tables. Accepted by IEEE Magazine
  (https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2)",,10.1109/MC.2022.3160472,,cs.NI cs.ET cs.SY eess.SP eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent years have witnessed an exponential growth of the commercial space
industry, including rocket launch, satellite network deployment, private space
travel, and even extraterrestrial colonization. Several trends are predicted in
this unprecedented transition to an era of space-enabled broadband access.
","[{'version': 'v1', 'created': 'Fri, 6 May 2022 19:27:08 GMT'}]",2022-07-04,"[['Huo', 'Yiming', '']]","['satellite constellation', 'broadband access', 'space network', 'space industry', 'spacetraffic', 'multi-planetary']"
11213,2011.08225,Noy Cohen-Shapira,Noy Cohen-Shapira and Lior Rokach,"Automatic selection of clustering algorithms using supervised graph
  embedding",,"Information Sciences, Volume 577,2021,Pages 824-851,ISSN 0020-0255",10.1016/j.ins.2021.08.028,,cs.LG cs.IR stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The widespread adoption of machine learning (ML) techniques and the extensive
expertise required to apply them have led to increased interest in automated ML
solutions that reduce the need for human intervention. One of the main
challenges in applying ML to previously unseen problems is algorithm selection
- the identification of high-performing algorithm(s) for a given dataset, task,
and evaluation measure. This study addresses the algorithm selection challenge
for data clustering, a fundamental task in data mining that is aimed at
grouping similar objects. We present MARCO-GE, a novel meta-learning approach
for the automated recommendation of clustering algorithms. MARCO-GE first
transforms datasets into graphs and then utilizes a graph convolutional neural
network technique to extract their latent representation. Using the embedding
representations obtained, MARCO-GE trains a ranking meta-model capable of
accurately recommending top-performing algorithms for a new dataset and
clustering evaluation measure. Extensive evaluation on 210 datasets, 13
clustering algorithms, and 10 clustering measures demonstrates the
effectiveness of our approach and its superiority in terms of predictive and
generalization performance over state-of-the-art clustering meta-learning
approaches.
","[{'version': 'v1', 'created': 'Mon, 16 Nov 2020 19:13:20 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Jun 2021 19:09:22 GMT'}, {'version': 'v3', 'created': 'Mon, 13 Sep 2021 07:26:54 GMT'}]",2021-09-15,"[['Cohen-Shapira', 'Noy', ''], ['Rokach', 'Lior', '']]","['Meta-learning', 'Algorithm selection', 'Clustering', 'AutoML', 'Algorithm ranking']"
11214,2207.08389,Amir Ashouri,"Amir H. Ashouri, Mostafa Elhoushi, Yuzhe Hua, Xiang Wang, Muhammad
  Asif Manzoor, Bryan Chan and Yaoqing Gao",MLGOPerf: An ML Guided Inliner to Optimize Performance,"Version 2: Added the missing Table 6. The short version of this work
  is accepted at ACM/IEEE CASES 2022",,10.1109/CASES55004.2022.00008,,cs.PL cs.AI cs.LG cs.NE cs.PF,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  For the past 25 years, we have witnessed an extensive application of Machine
Learning to the Compiler space; the selection and the phase-ordering problem.
However, limited works have been upstreamed into the state-of-the-art
compilers, i.e., LLVM, to seamlessly integrate the former into the optimization
pipeline of a compiler to be readily deployed by the user. MLGO was among the
first of such projects and it only strives to reduce the code size of a binary
with an ML-based Inliner using Reinforcement Learning.
  This paper presents MLGOPerf; the first end-to-end framework capable of
optimizing performance using LLVM's ML-Inliner. It employs a secondary ML model
to generate rewards used for training a retargeted Reinforcement learning
agent, previously used as the primary model by MLGO. It does so by predicting
the post-inlining speedup of a function under analysis and it enables a fast
training framework for the primary model which otherwise wouldn't be practical.
The experimental results show MLGOPerf is able to gain up to 1.8% and 2.2% with
respect to LLVM's optimization at O3 when trained for performance on SPEC
CPU2006 and Cbench benchmarks, respectively. Furthermore, the proposed approach
provides up to 26% increased opportunities to autotune code regions for our
benchmarks which can be translated into an additional 3.7% speedup value.
","[{'version': 'v1', 'created': 'Mon, 18 Jul 2022 05:47:29 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Jul 2022 15:07:17 GMT'}]",2023-01-18,"[['Ashouri', 'Amir H.', ''], ['Elhoushi', 'Mostafa', ''], ['Hua', 'Yuzhe', ''], ['Wang', 'Xiang', ''], ['Manzoor', 'Muhammad Asif', ''], ['Chan', 'Bryan', ''], ['Gao', 'Yaoqing', '']]","['Compilers', 'Reinforcement Learning', 'Deep Learning', 'LLVM', 'Inlining']"
11215,2106.00837,Mohammad Mahdi Dehshibi Dr.,"Mohammad Mahdi Dehshibi, Alessandro Chiolerio, Anna Nikolaidou,
  Richard Mayne, Antoni Gandia, Mona Ashtari, Andrew Adamatzky",On stimulating fungi $Pleurotus~ostreatus$ with Cortisol,,,10.1021/acsbiomaterials.1c00752,,cs.ET,http://creativecommons.org/licenses/by/4.0/,"  Fungi cells are capable of sensing extracellular cues through reception,
transduction and response systems which allow them to communicate with their
host and adapt to their environment. They display effective regulatory protein
expressions which enhance and regulate their response and adaptation to a
variety of triggers such as stress, hormones, light, chemicals and host
factors. In our recent studies, we have shown that $Pleurotus$ oyster fungi
generate electrical potential impulses in the form of spike events as a result
of their exposure to environmental, mechanical and chemical triggers,
demonstrating that it is possible to discern the nature of stimuli from the
fungi electrical responses. Harnessing the power of fungi sensing and
intelligent capabilities, we explored the communication protocols of fungi as
reporters of human chemical secretions such as hormones, addressing the
question if fungi can sense human signals. We exposed $Pleurotus$ oyster fungi
to cortisol, directly applied to a surface of a hemp shavings substrate
colonised by fungi, and recorded the electrical activity of fungi. The response
of fungi to cortisol was also supplementary studied through the application of
X-ray to identify changes in the fungi tissue, where receiving cortisol by the
substrate can inhibit the flow of calcium and, in turn, reduce its
physiological changes. This study could pave the way for future research on
adaptive fungal wearables capable for detecting physiological states of humans
and biosensors made of living fungi.
","[{'version': 'v1', 'created': 'Tue, 1 Jun 2021 22:31:17 GMT'}]",2021-11-02,"[['Dehshibi', 'Mohammad Mahdi', ''], ['Chiolerio', 'Alessandro', ''], ['Nikolaidou', 'Anna', ''], ['Mayne', 'Richard', ''], ['Gandia', 'Antoni', ''], ['Ashtari', 'Mona', ''], ['Adamatzky', 'Andrew', '']]","['fungi', 'cortisol', 'biosensor', 'electrical activity']"
11216,2104.14978,Gaigai Tang,"Gaigai Tang, Lianxiao Meng, Shuangyin Ren, Weipeng Cao, Qiang Wang,
  Lin Yang","A comparative study of neural network techniques for automatic software
  vulnerability detection","This paper has been published at April 28,2021. However, there are
  some experimental data issues in the published manuscript, which are caused
  by the calculation error of indicators. This paper is a revised version",,10.1109/TASE49443.2020.00010,,cs.SE cs.CR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Software vulnerabilities are usually caused by design flaws or implementation
errors, which could be exploited to cause damage to the security of the system.
At present, the most commonly used method for detecting software
vulnerabilities is static analysis. Most of the related technologies work based
on rules or code similarity (source code level) and rely on manually defined
vulnerability features. However, these rules and vulnerability features are
difficult to be defined and designed accurately, which makes static analysis
face many challenges in practical applications. To alleviate this problem, some
researchers have proposed to use neural networks that have the ability of
automatic feature extraction to improve the intelligence of detection. However,
there are many types of neural networks, and different data preprocessing
methods will have a significant impact on model performance. It is a great
challenge for engineers and researchers to choose a proper neural network and
data preprocessing method for a given problem. To solve this problem, we have
conducted extensive experiments to test the performance of the two most typical
neural networks (i.e., Bi-LSTM and RVFL) with the two most classical data
preprocessing methods (i.e., the vector representation and the program
symbolization methods) on software vulnerability detection problems and
obtained a series of interesting research conclusions, which can provide
valuable guidelines for researchers and engineers. Specifically, we found that
1) the training speed of RVFL is always faster than BiLSTM, but the prediction
accuracy of Bi-LSTM model is higher than RVFL; 2) using doc2vec for vector
representation can make the model have faster training speed and generalization
ability than using word2vec; and 3) multi-level symbolization is helpful to
improve the precision of neural network models.
","[{'version': 'v1', 'created': 'Thu, 29 Apr 2021 01:47:30 GMT'}]",2021-05-03,"[['Tang', 'Gaigai', ''], ['Meng', 'Lianxiao', ''], ['Ren', 'Shuangyin', ''], ['Cao', 'Weipeng', ''], ['Wang', 'Qiang', ''], ['Yang', 'Lin', '']]","['software vulnerability', 'neural network', 'machinelearning', 'Bi-LSTM', 'RVFL']"
11217,1905.07518,Pengbo Bo,Pengbo Bo and Yujian Zheng and Caiming Zhang,Smooth quasi-developable surfaces bounded by smooth curves,18 pages,Computer Aided Geometric Design 2020,10.1016/j.cagd.2020.101863,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computing a quasi-developable strip surface bounded by design curves finds
wide industrial applications. Existing methods compute discrete surfaces
composed of developable lines connecting sampling points on input curves which
are not adequate for generating smooth quasi-developable surfaces. We propose
the first method which is capable of exploring the full solution space of
continuous input curves to compute a smooth quasi-developable ruled surface
with as large developability as possible. The resulting surface is exactly
bounded by the input smooth curves and is guaranteed to have no
self-intersections. The main contribution is a variational approach to compute
a continuous mapping of parameters of input curves by minimizing a function
evaluating surface developability. Moreover, we also present an algorithm to
represent a resulting surface as a B-spline surface when input curves are
B-spline curves.
","[{'version': 'v1', 'created': 'Sat, 18 May 2019 01:37:38 GMT'}]",2022-12-19,"[['Bo', 'Pengbo', ''], ['Zheng', 'Yujian', ''], ['Zhang', 'Caiming', '']]","['Surface design', 'B-spline developable surface', 'Quasi-developable surfaces', 'Parametrizationmapping function']"
11218,2208.07570,Jingyao Zhang,"Jingyao Zhang, Elaheh Sadredini","Inhale: Enabling High-Performance and Energy-Efficient In-SRAM
  Cryptographic Hash for IoT","9 pages, ICCAD 2022",,10.1145/3508352.3549381,,cs.CR cs.AR,http://creativecommons.org/licenses/by/4.0/,"  In the age of big data, information security has become a major issue of
debate, especially with the rise of the Internet of Things (IoT), where
attackers can effortlessly obtain physical access to edge devices. The hash
algorithm is the current foundation for data integrity and authentication.
However, it is challenging to provide a high-performance, high-throughput, and
energy-efficient solution on resource-constrained edge devices. In this paper,
we propose Inhale, an in-SRAM architecture to effectively compute hash
algorithms with innovative data alignment and efficient read/write strategies
to implicitly execute data shift operations through the in-situ controller. We
present two variations of Inhale: Inhale-Opt, which is optimized for latency,
throughput, and area-overhead; and Inhale-Flex, which offers flexibility in
repurposing a part of last-level caches for hash computation. We thoroughly
evaluate our proposed architectures on both SRAM and ReRAM memories and compare
them with the state-of-the-art in-memory and ASIC accelerators. Our performance
evaluation confirms that Inhale can achieve 1.4x - 14.5x higher
throughput-per-area and about two-orders-of-magnitude higher
throughput-per-area-per-energy compared to the state-of-the-art solutions.
","[{'version': 'v1', 'created': 'Tue, 16 Aug 2022 07:29:36 GMT'}]",2022-08-17,"[['Zhang', 'Jingyao', ''], ['Sadredini', 'Elaheh', '']]","['In-SRAM computing', 'processing in memory', 'cryptographic hash']"
11219,2112.03500,Meng Xia,"Meng Xia, Yankun Zhao, Mehmet Hamza Erol, Jihyeong Hong, Juho Kim",Understanding Distributed Tutorship in Online Language Tutoring,"Accepted as a full paper in the 12th International Conference on
  Learning Analytics and Knowledge (LAK '22)",,10.1145/3491102.3502054,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rise of the gig economy, online language tutoring platforms are
becoming increasingly popular. They provide temporary and flexible jobs for
native speakers as tutors and allow language learners to have one-on-one
speaking practices on demand. However, the lack of stable relationships hinders
tutors and learners from building long-term trust. ""Distributed tutorship"" --
temporally discontinuous learning experience with different tutors -- has been
underexplored yet has many implications for modern learning platforms. In this
paper, we analyzed tutorship sequences of 15,959 learners and found that around
40% of learners change to new tutors every session; 44% learners change to new
tutors while reverting to previous tutors sometimes; only 16% learners change
to new tutors and then fix on one tutor. We also found suggestive evidence that
higher distributedness -- higher diversity and lower continuity in tutorship --
is correlated to slower improvements in speaking performance scores with a
similar number of sessions. We further surveyed 519 and interviewed 40 learners
and found that more learners preferred fixed tutorship while some do not have
it due to various reasons. Finally, we conducted semi-structured interviews
with three tutors and one product manager to discuss the implications for
improving the continuity in learning under distributed tutorship.
","[{'version': 'v1', 'created': 'Tue, 7 Dec 2021 05:19:35 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Dec 2021 12:18:19 GMT'}, {'version': 'v3', 'created': 'Mon, 27 Dec 2021 15:11:38 GMT'}, {'version': 'v4', 'created': 'Fri, 14 Jan 2022 20:41:38 GMT'}]",2022-01-19,"[['Xia', 'Meng', ''], ['Zhao', 'Yankun', ''], ['Erol', 'Mehmet Hamza', ''], ['Hong', 'Jihyeong', ''], ['Kim', 'Juho', '']]","['distributed tutorship', 'online tutoring platforms', 'language learning', 'learning analytics', 'lifelong learning']"
11220,2204.00718,Shengyao Zhuang,"Shengyao Zhuang, Hang Li and Guido Zuccon",Implicit Feedback for Dense Passage Retrieval: A Counterfactual Approach,"Full paper, accepted at SGIR2022",,10.1145/3477495.3531994,,cs.IR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this paper we study how to effectively exploit implicit feedback in Dense
Retrievers (DRs). We consider the specific case in which click data from a
historic click log is available as implicit feedback. We then exploit such
historic implicit interactions to improve the effectiveness of a DR. A key
challenge that we study is the effect that biases in the click signal, such as
position bias, have on the DRs. To overcome the problems associated with the
presence of such bias, we propose the Counterfactual Rocchio (CoRocchio)
algorithm for exploiting implicit feedback in Dense Retrievers. We demonstrate
both theoretically and empirically that dense query representations learnt with
CoRocchio are unbiased with respect to position bias and lead to higher
retrieval effectiveness. We make available the implementations of the proposed
methods and the experimental framework, along with all results at
https://github.com/ielab/Counterfactual-DR.
","[{'version': 'v1', 'created': 'Fri, 1 Apr 2022 23:29:43 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Apr 2022 02:28:40 GMT'}]",2022-05-02,"[['Zhuang', 'Shengyao', ''], ['Li', 'Hang', ''], ['Zuccon', 'Guido', '']]","['Dense passage retrieval', 'Implicit feedback', 'Counterfactual learning']"
11221,1903.04767,Nicholas Kolokotronis,"Keltoum Bendiab, Nicholas Kolokotronis, Stavros Shiaeles, Samia
  Boucherkha",A Novel Blockchain-based Trust Model for Cloud Identity Management,,"16th IEEE International Conference on Dependable, Autonomic and
  Secure Computing (DASC 2018)",10.1109/DASC/PiCom/DataCom/CyberSciTec.2018.00126,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Secure and reliable management of identities has become one of the greatest
challenges facing cloud computing today, mainly due to the huge number of new
cloud-based applications generated by this model, which means more user
accounts, passwords, and personal information to provision, monitor, and
secure. Currently, identity federation is the most useful solution to overcome
the aforementioned issues and simplify the user experience by allowing
efficient authentication mechanisms and use of identity information from data
distributed across multiple domains. However, this approach creates
considerable complexity in managing trust relationships for both the cloud
service providers and their clients. Poor management of trust in federated
identity management systems brings with it many security, privacy and
interoperability issues, which contributes to the reluctance of organizations
to move their critical identity data to the cloud. In this paper, we aim to
address these issues by introducing a novel trust and identity management model
based on the Blockchain for cloud identity management with security and privacy
improvements.
","[{'version': 'v1', 'created': 'Tue, 12 Mar 2019 07:49:38 GMT'}]",2019-03-13,"[['Bendiab', 'Keltoum', ''], ['Kolokotronis', 'Nicholas', ''], ['Shiaeles', 'Stavros', ''], ['Boucherkha', 'Samia', '']]","['Blockchain', 'cloud computing', 'security', 'identity']"
11222,2206.14091,Raphael Mosaner,"Raphael Mosaner (JKU Linz, Austria), David Leopoldseder (Oracle Labs
  Vienna, Austria), Wolfgang Kisling (JKU Linz, Austria), Lukas Stadler (Oracle
  Labs Linz, Austria), Hanspeter M\""ossenb\""ock (JKU Linz, Austria)","Compilation Forking: A Fast and Flexible Way of Generating Data for
  Compiler-Internal Machine Learning Tasks",,"The Art, Science, and Engineering of Programming, 2023, Vol. 7,
  Issue 1, Article 3",10.22152/programming-journal.org/2023/7/3,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Compiler optimization decisions are often based on hand-crafted heuristics
centered around a few established benchmark suites. Alternatively, they can be
learned from feature and performance data produced during compilation. However,
data-driven compiler optimizations based on machine learning models require
large sets of quality data for training in order to match or even outperform
existing human-crafted heuristics. In static compilation setups, related work
has addressed this problem with iterative compilation. However, a dynamic
compiler may produce different data depending on dynamically-chosen compilation
strategies, which aggravates the generation of comparable data. We propose
compilation forking, a technique for generating consistent feature and
performance data from arbitrary, dynamically-compiled programs. Different
versions of program parts with the same profiling and compilation history are
executed within single program runs to minimize noise stemming from dynamic
compilation and the runtime environment. Our approach facilitates large-scale
performance evaluations of compiler optimization decisions. Additionally,
compilation forking supports creating domain-specific compilation strategies
based on machine learning by providing the data for model training. We
implemented compilation forking in the GraalVM compiler in a
programming-language-agnostic way. To assess the quality of the generated data,
we trained several machine learning models to replace compiler heuristics for
loop-related optimizations. The trained models perform equally well to the
highly-tuned compiler heuristics when comparing the geometric means of
benchmark suite performances. Larger impacts on few single benchmarks range
from speedups of 20% to slowdowns of 17%. The presented approach can be
implemented in any dynamic compiler. We believe that it can help to analyze
compilation decisions and leverage the use of machine learning into dynamic
compilation.
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2022 15:37:33 GMT'}]",2022-06-29,"[['Mosaner', 'Raphael', '', 'JKU Linz, Austria'], ['Leopoldseder', 'David', '', 'Oracle Labs\n  Vienna, Austria'], ['Kisling', 'Wolfgang', '', 'JKU Linz, Austria'], ['Stadler', 'Lukas', '', 'Oracle\n  Labs Linz, Austria'], ['Mössenböck', 'Hanspeter', '', 'JKU Linz, Austria']]","['Dynamic Compiler', 'Optimization', 'Performance', 'Data Generation', 'Neural Network']"
11223,1709.01683,Abhinav Shukla,"Abhinav Shukla, Shruti Shriya Gullapuram, Harish Katti, Karthik
  Yadati, Mohan Kankanhalli, Ramanathan Subramanian",Affect Recognition in Ads with Application to Computational Advertising,"Accepted at the ACM International Conference on Multimedia (ACM MM)
  2017",,10.1145/3123266.3123444,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advertisements (ads) often include strongly emotional content to leave a
lasting impression on the viewer. This work (i) compiles an affective ad
dataset capable of evoking coherent emotions across users, as determined from
the affective opinions of five experts and 14 annotators; (ii) explores the
efficacy of convolutional neural network (CNN) features for encoding emotions,
and observes that CNN features outperform low-level audio-visual emotion
descriptors upon extensive experimentation; and (iii) demonstrates how enhanced
affect prediction facilitates computational advertising, and leads to better
viewing experience while watching an online video stream embedded with ads
based on a study involving 17 users. We model ad emotions based on subjective
human opinions as well as objective multimodal features, and show how
effectively modeling ad emotions can positively impact a real-life application.
","[{'version': 'v1', 'created': 'Wed, 6 Sep 2017 06:16:52 GMT'}]",2017-09-07,"[['Shukla', 'Abhinav', ''], ['Gullapuram', 'Shruti Shriya', ''], ['Katti', 'Harish', ''], ['Yadati', 'Karthik', ''], ['Kankanhalli', 'Mohan', ''], ['Subramanian', 'Ramanathan', '']]","['Affect Recognition', 'Advertisements', 'Human and ComputationalPerception', 'Convolutional Neural Networks (CNNs)', 'Multimodal', 'Computational Advertising']"
11224,2007.09367,Eloise Berson,"Elo\""ise Berson, Catherine Soladi\'e, Vincent Barrielle, Nicolas
  Stoiber",A Robust Interactive Facial Animation Editing System,,"Motion, Interaction and Games (MIG '19), October 28--30, 2019,
  Newcastle upon Tyne, United Kingdom",10.1145/3359566.3360076,,cs.GR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the past few years, the automatic generation of facial animation for
virtual characters has garnered interest among the animation research and
industry communities. Recent research contributions leverage machine-learning
approaches to enable impressive capabilities at generating plausible facial
animation from audio and/or video signals. However, these approaches do not
address the problem of animation edition, meaning the need for correcting an
unsatisfactory baseline animation or modifying the animation content itself. In
facial animation pipelines, the process of editing an existing animation is
just as important and time-consuming as producing a baseline. In this work, we
propose a new learning-based approach to easily edit a facial animation from a
set of intuitive control parameters. To cope with high-frequency components in
facial movements and preserve a temporal coherency in the animation, we use a
resolution-preserving fully convolutional neural network that maps control
parameters to blendshapes coefficients sequences. We stack an additional
resolution-preserving animation autoencoder after the regressor to ensure that
the system outputs natural-looking animation. The proposed system is robust and
can handle coarse, exaggerated edits from non-specialist users. It also retains
the high-frequency motion of the facial animation.
","[{'version': 'v1', 'created': 'Sat, 18 Jul 2020 08:31:02 GMT'}]",2020-07-21,"[['Berson', 'Eloïse', ''], ['Soladié', 'Catherine', ''], ['Barrielle', 'Vincent', ''], ['Stoiber', 'Nicolas', '']]","['Facial animation', 'interactive motion edition', 'learning-based approach', 'dataset']"
11225,2206.03289,Ahmad Chaddad,"Ahmad Chaddad, Yousef Katib, Lama Hassan",Future Artificial Intelligence tools and perspectives in medicine,,Curr Opin Urol. 2021 Jul 1;31(4):371-377,10.1097/MOU.0000000000000884,,cs.LG eess.IV q-bio.QM,http://creativecommons.org/licenses/by/4.0/,"  Purpose of review: Artificial intelligence (AI) has become popular in medical
applications, specifically as a clinical support tool for computer-aided
diagnosis. These tools are typically employed on medical data (i.e., image,
molecular data, clinical variables, etc.) and used the statistical and machine
learning methods to measure the model performance. In this review, we
summarized and discussed the most recent radiomic pipeline used for clinical
analysis. Recent findings:Currently, limited management of cancers benefits
from artificial intelligence, mostly related to a computer-aided diagnosis that
avoids a biopsy analysis that presents additional risks and costs. Most AI
tools are based on imaging features, known as radiomic analysis that can be
refined into predictive models in non-invasively acquired imaging data. This
review explores the progress of AI-based radiomic tools for clinical
applications with a brief description of necessary technical steps. Explaining
new radiomic approaches based on deep learning techniques will explain how the
new radiomic models (deep radiomic analysis) can benefit from deep
convolutional neural networks and be applied on limited data sets. Summary: To
consider the radiomic algorithms, further investigations are recommended to
involve deep learning in radiomic models with additional validation steps on
various cancer types.
","[{'version': 'v1', 'created': 'Sat, 4 Jun 2022 11:27:43 GMT'}]",2022-06-08,"[['Chaddad', 'Ahmad', ''], ['Katib', 'Yousef', ''], ['Hassan', 'Lama', '']]","['AI', 'radiomic', 'deep learning', 'cancer']"
11226,1703.10864,Kapil Arya,"Kapil Arya (Northeastern University, USA), Tyler Denniston (MIT, USA),
  Ariel Rabkin (Cloudera, USA), Gene Cooperman (Northeastern University, USA)",Transition Watchpoints: Teaching Old Debuggers New Tricks,arXiv admin note: text overlap with arXiv:1212.5204,"The Art, Science, and Engineering of Programming, 2017, Vol. 1,
  Issue 2, Article 16",10.22152/programming-journal.org/2017/1/16,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reversible debuggers and process replay have been developed at least since
1970. This vision enables one to execute backwards in time under a debugger.
Two important problems in practice are that, first, current reversible
debuggers are slow when reversing over long time periods, and, second, after
building one reversible debugger, it is difficult to transfer that achievement
to a new programming environment. The user observes a bug when arriving at an
error. Searching backwards for the corresponding fault may require many reverse
steps. Ultimately, the user prefers to write an expression that will transition
to false upon arriving at the fault. The solution is an expression-transition
watchpoint facility based on top of snapshots and record/replay.
Expression-transition watch- points are implemented as binary search through
the timeline of a program execution, while using the snapshots as landmarks
within that timeline. This allows for debugging of subtle bugs that appear only
after minutes or more of program execution. When a bug occurs within seconds of
program startup, repeated debugging sessions suffice. Reversible debugging is
preferred for bugs seen only after minutes. This architecture allows for an
efficient and easy-to-write snapshot-based reversibe debugger on top of a
conventional debugger. The validity of this approach was tested by developing
four personalities (for GDB, MATLAB, Perl, and Python), with each personality
typically requiring just 100 lines of code.
","[{'version': 'v1', 'created': 'Fri, 31 Mar 2017 11:47:28 GMT'}]",2017-04-03,"[['Arya', 'Kapil', '', 'Northeastern University, USA'], ['Denniston', 'Tyler', '', 'MIT, USA'], ['Rabkin', 'Ariel', '', 'Cloudera, USA'], ['Cooperman', 'Gene', '', 'Northeastern University, USA']]","['checkpointing', 'debugging', 'reversibility']"
11227,2204.01028,Wenqing Zhu,"Wenqing Zhu, Norihiro Yoshida, Toshihiro Kamiya, Eunjong Choi, Hiroaki
  Takada","MSCCD: Grammar Pluggable Clone Detection Based on ANTLR Parser
  Generation",ICPC2022,,10.1145/3524610.3529161,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  For various reasons, programming languages continue to multiply and evolve.
It has become necessary to have a multilingual clone detection tool that can
easily expand supported programming languages and detect various code clones is
needed. However, research on multilingual code clone detection has not received
sufficient attention. In this study, we propose MSCCD (Multilingual Syntactic
Code Clone Detector), a grammar pluggable code clone detection tool that uses a
parser generator to generate a code block extractor for the target language.
The extractor then extracts the semantic code blocks from a parse tree. MSCCD
can detect Type-3 clones at various granularities. We evaluated MSCCD's
language extensibility by applying MSCCD to 20 modern languages. Sixteen
languages were perfectly supported, and the remaining four were provided with
the same detection capabilities at the expense of execution time. We evaluated
MSCCD's recall by using BigCloneEval and conducted a manual experiment to
evaluate precision. MSCCD achieved equivalent detection performance equivalent
to state-of-the-art tools.
","[{'version': 'v1', 'created': 'Sun, 3 Apr 2022 08:31:07 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Apr 2022 06:27:40 GMT'}]",2022-04-07,"[['Zhu', 'Wenqing', ''], ['Yoshida', 'Norihiro', ''], ['Kamiya', 'Toshihiro', ''], ['Choi', 'Eunjong', ''], ['Takada', 'Hiroaki', '']]","['Code Clone', 'Parser Generator', 'Clone Detection', 'Syntactic Analysis', 'Programming Language']"
11228,2002.06163,Stella Giannakopoulou,"Stella Giannakopoulou, Manos Karpathiotakis, Anastasia Ailamaki",Cleaning Denial Constraint Violations through Relaxation,To appear in SIGMOD 2020 proceedings,,10.1145/3318464.3389775,,cs.DB,http://creativecommons.org/licenses/by/4.0/,"  Data cleaning is a time-consuming process that depends on the data analysis
that users perform. Existing solutions treat data cleaning as a separate
offline process that takes place before analysis begins. Applying data cleaning
before analysis assumes a priori knowledge of the inconsistencies and the query
workload, thereby requiring effort on understanding and cleaning the data that
is unnecessary for the analysis. We propose an approach that performs
probabilistic repair of denial constraint violations on-demand, driven by the
exploratory analysis that users perform. We introduce Daisy, a system that
seamlessly integrates data cleaning into the analysis by relaxing query
results. Daisy executes analytical query-workloads over dirty data by weaving
cleaning operators into the query plan. Our evaluation shows that Daisy adapts
to the workload and outperforms traditional offline cleaning on both synthetic
and real-world workloads.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 18:27:37 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Feb 2020 23:43:47 GMT'}, {'version': 'v3', 'created': 'Mon, 24 Feb 2020 20:29:10 GMT'}, {'version': 'v4', 'created': 'Tue, 31 Mar 2020 17:56:34 GMT'}, {'version': 'v5', 'created': 'Sun, 12 Apr 2020 09:50:48 GMT'}, {'version': 'v6', 'created': 'Wed, 15 Apr 2020 22:47:40 GMT'}]",2020-04-17,"[['Giannakopoulou', 'Stella', ''], ['Karpathiotakis', 'Manos', ''], ['Ailamaki', 'Anastasia', '']]","['data cleaning', 'denial constraints', 'adaptive cleaning']"
11229,2106.15225,Nilupulee Gunathilake,"Nilupulee A. Gunathilake, Ahmed Al-Dubai, William J. Buchanan, Owen Lo",Electromagnetic Analysis of an Ultra-Lightweight Cipher: PRESENT,20 pages,"10th international conference on Cryptography and Information
  Security 2021",10.1521/csit.2021.110915,Volume 11 Number 09,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Side-channel attacks are an unpredictable risk factor in cryptography.
Therefore, continuous observations of physical leakages are essential to
minimise vulnerabilities associated with cryptographic functions. Lightweight
cryptography is a novel approach in progress towards internet-of-things (IoT)
security. Thus, it would provide sufficient data and privacy protection in such
a constrained ecosystem. IoT devices are resource-limited in terms of data
rates (in kbps), power maintainability (battery) as well as hardware and
software footprints (physical size, internal memory, RAM/ROM). Due to the
difficulty in handling conventional cryptographic algorithms, lightweight
ciphers consist of small key sizes, block sizes and few operational rounds.
Unlike in the past, affordability to perform side-channel attacks using
inexpensive electronic circuitries is becoming a reality. Hence, cryptanalysis
of physical leakage in these emerging ciphers is crucial. Among existing
studies, power analysis seems to have enough attention in research, whereas
other aspects such as electromagnetic, timing, cache and optical attacks
continue to be appropriately evaluated to play a role in forensic analysis.
  As a result, we started analysing electromagnetic emission leakage of an
ultra-lightweight block cipher, PRESENT. According to the literature, PRESENT
promises to be adequate for IoT devices, and there still seems not to exist any
work regarding correlation electromagnetic analysis (CEMA) of it. Firstly, we
conducted simple electromagnetic analysis in both time and frequency domains
and then proceeded towards CEMA attack modelling. This paper provides a summary
of the related literature (IoT, lightweight cryptography, side-channel attacks
and EMA), our methodology, current outcomes and future plans for the optimised
results.
","[{'version': 'v1', 'created': 'Tue, 29 Jun 2021 10:20:20 GMT'}]",2021-06-30,"[['Gunathilake', 'Nilupulee A.', ''], ['Al-Dubai', 'Ahmed', ''], ['Buchanan', 'William J.', ''], ['Lo', 'Owen', '']]","['Side-channel attacks', 'electromagnetic analysis', 'lightweight cryptography', 'PRESENT and IoT']"
11230,2207.02853,Ken Miyajima,"Ken Miyajima, Yuki Noguchi and Takayuki Yamada","Optimal design of compliant displacement magnification mechanisms using
  stress-constrained topology optimization based on effective energy","38 pages, 23 figures","Finite Elements in Analysis and Design, Volume 216, 2023, 103892",10.1016/j.finel.2022.103892,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  In this paper, stress-constrained topology optimization is applied to the
design of compliant displacement magnification mechanisms. By formulating the
objective function based on the concept of effective energy, it is not
necessary to place artificial spring components at the boundaries of the output
and input ports as in previous methods. This makes it possible to design
mechanisms that do not receive a reaction force at the output port, such as
sensors. Furthermore, by imposing a constraint on the maximum stress evaluated
in terms of the p-norm of the von Mises equivalent stress, problems such as
stress concentration can be avoided. Several numerical examples of displacement
magnification mechanisms are provided to demonstrate the effectiveness of the
proposed method.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2022 06:50:15 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Jan 2023 01:11:55 GMT'}]",2023-01-19,"[['Miyajima', 'Ken', ''], ['Noguchi', 'Yuki', ''], ['Yamada', 'Takayuki', '']]","['Topology optimization', 'Compliant mechanisms', 'Displacementmagnification mechanisms', 'Stress constraints']"
11231,2111.02801,Lu Lu,"Jeremy Yu, Lu Lu, Xuhui Meng, George Em Karniadakis","Gradient-enhanced physics-informed neural networks for forward and
  inverse PDE problems",,,10.1016/j.cma.2022.114823,,cs.LG physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning has been shown to be an effective tool in solving partial
differential equations (PDEs) through physics-informed neural networks (PINNs).
PINNs embed the PDE residual into the loss function of the neural network, and
have been successfully employed to solve diverse forward and inverse PDE
problems. However, one disadvantage of the first generation of PINNs is that
they usually have limited accuracy even with many training points. Here, we
propose a new method, gradient-enhanced physics-informed neural networks
(gPINNs), for improving the accuracy and training efficiency of PINNs. gPINNs
leverage gradient information of the PDE residual and embed the gradient into
the loss function. We tested gPINNs extensively and demonstrated the
effectiveness of gPINNs in both forward and inverse PDE problems. Our numerical
results show that gPINN performs better than PINN with fewer training points.
Furthermore, we combined gPINN with the method of residual-based adaptive
refinement (RAR), a method for improving the distribution of training points
adaptively during training, to further improve the performance of gPINN,
especially in PDEs with solutions that have steep gradients.
","[{'version': 'v1', 'created': 'Mon, 1 Nov 2021 18:01:38 GMT'}]",2022-04-06,"[['Yu', 'Jeremy', ''], ['Lu', 'Lu', ''], ['Meng', 'Xuhui', ''], ['Karniadakis', 'George Em', '']]","['deep learning', 'partial differential equations', 'physics-informed neural networks', 'gradient-enhanced', 'residual-based adaptive refinement']"
11232,2006.06730,Joseph Romano,"Joseph D. Romano, Trang T. Le, Weixuan Fu, and Jason H. Moore",Is deep learning necessary for simple classification tasks?,"14 pages, 5 figures, 3 tables",,10.1007/s10710-021-09401-z,,cs.LG cs.NE stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Automated machine learning (AutoML) and deep learning (DL) are two
cutting-edge paradigms used to solve a myriad of inductive learning tasks. In
spite of their successes, little guidance exists for when to choose one
approach over the other in the context of specific real-world problems.
Furthermore, relatively few tools exist that allow the integration of both
AutoML and DL in the same analysis to yield results combining both of their
strengths. Here, we seek to address both of these issues, by (1.) providing a
head-to-head comparison of AutoML and DL in the context of binary
classification on 6 well-characterized public datasets, and (2.) evaluating a
new tool for genetic programming-based AutoML that incorporates deep
estimators. Our observations suggest that AutoML outperforms simple DL
classifiers when trained on similar datasets for binary classification but
integrating DL into AutoML improves classification performance even further.
However, the substantial time needed to train AutoML+DL pipelines will likely
outweigh performance advantages in many applications.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2020 18:41:47 GMT'}]",2021-10-25,"[['Romano', 'Joseph D.', ''], ['Le', 'Trang T.', ''], ['Fu', 'Weixuan', ''], ['Moore', 'Jason H.', '']]","['Automated Machine Learning', 'Genetic Programming', 'Evolutionary Algorithms', 'Deep Learning', 'Pareto optimization']"
11233,2012.02308,Jessica Schrouff,"Diana Mincu, Eric Loreaux, Shaobo Hou, Sebastien Baur, Ivan Protsyuk,
  Martin G Seneviratne, Anne Mottram, Nenad Tomasev, Alan Karthikesanlingam and
  Jessica Schrouff",Concept-based model explanations for Electronic Health Records,,"CHIL '21: Proceedings of the Conference on Health, Inference, and
  Learning, 2021",10.1145/3450439.3451858,,cs.LG cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Recurrent Neural Networks (RNNs) are often used for sequential modeling of
adverse outcomes in electronic health records (EHRs) due to their ability to
encode past clinical states. These deep, recurrent architectures have displayed
increased performance compared to other modeling approaches in a number of
tasks, fueling the interest in deploying deep models in clinical settings. One
of the key elements in ensuring safe model deployment and building user trust
is model explainability. Testing with Concept Activation Vectors (TCAV) has
recently been introduced as a way of providing human-understandable
explanations by comparing high-level concepts to the network's gradients. While
the technique has shown promising results in real-world imaging applications,
it has not been applied to structured temporal inputs. To enable an application
of TCAV to sequential predictions in the EHR, we propose an extension of the
method to time series data. We evaluate the proposed approach on an open EHR
benchmark from the intensive care unit, as well as synthetic data where we are
able to better isolate individual effects.
","[{'version': 'v1', 'created': 'Thu, 3 Dec 2020 22:18:24 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Mar 2021 10:30:50 GMT'}]",2021-04-22,"[['Mincu', 'Diana', ''], ['Loreaux', 'Eric', ''], ['Hou', 'Shaobo', ''], ['Baur', 'Sebastien', ''], ['Protsyuk', 'Ivan', ''], ['Seneviratne', 'Martin G', ''], ['Mottram', 'Anne', ''], ['Tomasev', 'Nenad', ''], ['Karthikesanlingam', 'Alan', ''], ['Schrouff', 'Jessica', '']]","['Explainability', 'time series', 'human-understandable concepts', 'electronic health records (EHR)']"
11234,2209.02930,Paschal Amusuo,"Paschal C. Amusuo (1), Aishwarya Sharma (1), Siddharth R. Rao (1),
  Abbey Vincent (1), James C. Davis (1) ((1) Purdue University, USA)",Reflections on Software Failure Analysis,"6 pages, 4 figures To be published in: Proceedings of the 30th ACM
  Joint European Software Engineering Conference and Symposium on the
  Foundations of Software Engineering (ESEC/FSE '22)",,10.1145/3540250.3560879,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Failure studies are important in revealing the root causes, behaviors, and
life cycle of defects in software systems. These studies either focus on
understanding the characteristics of defects in specific classes of systems or
the characteristics of a specific type of defect in the systems it manifests
in. Failure studies have influenced various software engineering research
directions, especially in the area of software evolution, defect detection, and
program repair.
  In this paper, we reflect on the conduct of failure studies in software
engineering. We reviewed a sample of 52 failure study papers. We identified
several recurring problems in these studies, some of which hinder the ability
of the engineering community to trust or replicate the results. Based on our
findings, we suggest future research directions, including identifying and
analyzing failure causal chains, standardizing the conduct of failure studies,
and tool support for faster defect analysis.
","[{'version': 'v1', 'created': 'Wed, 7 Sep 2022 04:51:34 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Sep 2022 03:02:43 GMT'}]",2022-09-23,"[['Amusuo', 'Paschal C.', '', 'Purdue University, USA'], ['Sharma', 'Aishwarya', '', 'Purdue University, USA'], ['Rao', 'Siddharth R.', '', 'Purdue University, USA'], ['Vincent', 'Abbey', '', 'Purdue University, USA'], ['Davis', 'James C.', '', 'Purdue University, USA']]","['Failure analysis', 'software defects', 'empirical software engineering']"
11235,2003.01092,Dimitrios Chamzas,Dimitrios Chamzas and Konstantinos Moustakas,3D Augmented Reality Tangible User Interface using Commodity Hardware,"15th International Joint Conference on Computer Vision, Imaging and
  Computer Graphics Theory and Applications (GRAPP), Valletta, Malta, 25-27
  February 2020",,10.5220/0009173303840391,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During the last years, the emerging field of Augmented and Virtual Reality
(AR-VR) has seen tremendous growth. An interface that has also become very
popular for the AR systems is the tangible interface or passive-haptic
interface. Specifically, an interface where users can manipulate digital
information with input devices that are physical objects. This work presents a
low cost Augmented Reality system with a tangible interface that offers
interaction between the real and the virtual world. The system estimates in
real-time the 3D position of a small colored ball (input device), it maps it to
the 3D virtual world and then uses it to control the AR application that runs
in a mobile device. Using the 3D position of our ""input"" device, it allows us
to implement more complicated interactivity compared to a 2D input device.
Finally, we present a simple, fast and robust algorithm that can estimate the
corners of a convex quadrangle. The proposed algorithm is suitable for the fast
registration of markers and significantly improves performance compared to the
state of the art.
","[{'version': 'v1', 'created': 'Mon, 2 Mar 2020 18:29:58 GMT'}]",2021-04-20,"[['Chamzas', 'Dimitrios', ''], ['Moustakas', 'Konstantinos', '']]","['Augmented reality environments', '3D tracking', '3D registration', 'Convex Polygon Corner Detection']"
11236,2003.01182,Martin Shepperd,Jingxiu Yao and Martin Shepperd,"Assessing Software Defection Prediction Performance: Why Using the
  Matthews Correlation Coefficient Matters","EASE 2020, April 15--17, 2020, Trondheim, Norway",,10.1145/3383219.3383232,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: There is considerable diversity in the range and design of
computational experiments to assess classifiers for software defect prediction.
This is particularly so, regarding the choice of classifier performance
metrics. Unfortunately some widely used metrics are known to be biased, in
particular F1. Objective: We want to understand the extent to which the
widespread use of the F1 renders empirical results in software defect
prediction unreliable. Method: We searched for defect prediction studies that
report both F1 and the Matthews correlation coefficient (MCC). This enabled us
to determine the proportion of results that are consistent between both metrics
and the proportion that change. Results: Our systematic review identifies 8
studies comprising 4017 pairwise results. Of these results, the direction of
the comparison changes in 23% of the cases when the unbiased MCC metric is
employed. Conclusion: We find compelling reasons why the choice of
classification performance metric matters, specifically the biased and
misleading F1 metric should be deprecated.
","[{'version': 'v1', 'created': 'Mon, 2 Mar 2020 20:48:54 GMT'}]",2020-03-04,"[['Yao', 'Jingxiu', ''], ['Shepperd', 'Martin', '']]","['Sofware engineering experimentation', 'Sofware defect prediction', 'Classifcation metrics']"
11237,2009.06009,Jan Novotny,"Karel Ad\'amek, Jan Novotn\'y, Jeyarajan Thiyagalingam, Wesley Armour","Efficiency Near the Edge: Increasing the Energy Efficiency of FFTs on
  GPUs for Real-time Edge Computing",published in IEEE Access,"in IEEE Access, vol. 9, pp. 18167-18182, 2021",10.1109/ACCESS.2021.3053409,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Square Kilometre Array (SKA) is an international initiative for
developing the world's largest radio telescope with a total collecting area of
over a million square meters. The scale of the operation, combined with the
remote location of the telescope, requires the use of energy-efficient
computational algorithms. This, along with the extreme data rates that will be
produced by the SKA and the requirement for a real-time observing capability,
necessitates in-situ data processing in an edge style computing solution. More
generally, energy efficiency in the modern computing landscape is becoming of
paramount concern. Whether it be the power budget that can limit some of the
world's largest supercomputers, or the limited power available to the smallest
Internet-of-Things devices. In this paper, we study the impact of hardware
frequency scaling on the energy consumption and execution time of the Fast
Fourier Transform (FFT) on NVIDIA GPUs using the cuFFT library. The FFT is used
in many areas of science and it is one of the key algorithms used in radio
astronomy data processing pipelines. Through the use of frequency scaling, we
show that we can lower the power consumption of the NVIDIA V100 GPU when
computing the FFT by up to 60% compared to the boost clock frequency, with less
than a 10% increase in the execution time. Furthermore, using one common core
clock frequency for all tested FFT lengths, we show on average a 50% reduction
in power consumption compared to the boost core clock frequency with an
increase in the execution time still below 10%. We demonstrate how these
results can be used to lower the power consumption of existing data processing
pipelines. These savings, when considered over years of operation, can yield
significant financial savings, but can also lead to a significant reduction of
greenhouse gas emissions.
","[{'version': 'v1', 'created': 'Sun, 13 Sep 2020 14:48:16 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Nov 2021 21:13:56 GMT'}]",2021-11-11,"[['Adámek', 'Karel', ''], ['Novotný', 'Jan', ''], ['Thiyagalingam', 'Jeyarajan', ''], ['Armour', 'Wesley', '']]","['Energy efficiency', 'Green computing', 'High performance computing', 'Real-time systems', 'Parallel architectures']"
11238,1709.01313,Amir Varasteh,"Farzad Tashtarian, Amir Varasteh, Ahmadreza Montazerolghaem, Wolfgang
  Kellerer","Distributed VNF Scaling in Large-scale Datacenters: An ADMM-based
  Approach","IEEE International Conference on Communication Technology (ICCT),
  Chengdu, China, 2017",,10.1109/ICCT.2017.8359682,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network Functions Virtualization (NFV) is a promising network architecture
where network functions are virtualized and decoupled from proprietary
hardware. In modern datacenters, user network traffic requires a set of Virtual
Network Functions (VNFs) as a service chain to process traffic demands. Traffic
fluctuations in Large-scale DataCenters (LDCs) could result in overload and
underload phenomena in service chains. In this paper, we propose a distributed
approach based on Alternating Direction Method of Multipliers (ADMM) to jointly
load balance the traffic and horizontally scale up and down VNFs in LDCs with
minimum deployment and forwarding costs. Initially we formulate the targeted
optimization problem as a Mixed Integer Linear Programming (MILP) model, which
is NP-complete. Secondly, we relax it into two Linear Programming (LP) models
to cope with over and underloaded service chains. In the case of small or
medium size datacenters, LP models could be run in a central fashion with a low
time complexity. However, in LDCs, increasing the number of LP variables
results in additional time consumption in the central algorithm. To mitigate
this, our study proposes a distributed approach based on ADMM. The
effectiveness of the proposed mechanism is validated in different scenarios.
","[{'version': 'v1', 'created': 'Tue, 5 Sep 2017 09:53:16 GMT'}]",2018-07-27,"[['Tashtarian', 'Farzad', ''], ['Varasteh', 'Amir', ''], ['Montazerolghaem', 'Ahmadreza', ''], ['Kellerer', 'Wolfgang', '']]","['Network function virtualization', 'datacenters', 'VNFscaling', 'service chaining', 'distributed optimization', 'alternating direction method of multipliers (ADMM)']"
11239,2206.09765,Justin Edwards,"Helin Cihan, Yunhan Wu, Paola Pe\~na, Justin Edwards, Benjamin Cowan","Bilingual by default: Voice Assistants and the role of code-switching in
  creating a bilingual user experience",,"4th Conference on Conversational User Interfaces 4th Conference on
  Conversational User Interfaces (CUI 2022)",10.1145/3543829.3544511,,cs.HC cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Conversational User Interfaces such as Voice Assistants are hugely popular.
Yet they are designed to be monolingual by default, lacking support for, or
sensitivity to, the bilingual dialogue experience. In this provocation paper,
we highlight the language production challenges faced in VA interaction for
bilingual users. We argue that, by facilitating phenomena seen in bilingual
interaction, such as code-switching, we can foster a more inclusive and
improved user experience for bilingual users. We also explore ways that this
might be achieved, through the support of multiple language recognition as well
as being sensitive to the preferences of code-switching in speech output.
","[{'version': 'v1', 'created': 'Mon, 20 Jun 2022 13:26:48 GMT'}]",2022-06-22,"[['Cihan', 'Helin', ''], ['Wu', 'Yunhan', ''], ['Peña', 'Paola', ''], ['Edwards', 'Justin', ''], ['Cowan', 'Benjamin', '']]","['speech interface', 'voice user interface', 'intelligent personal assistants', 'non-native speakers', 'code-switching']"
11240,2202.08506,Beihao Xia,"Beihao Xia, Conghao Wong, Qinmu Peng, Wei Yuan, and Xinge You","CSCNet: Contextual Semantic Consistency Network for Trajectory
  Prediction in Crowded Spaces",Accepted by Pattern Recognition,,10.1016/j.patcog.2022.108552,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Trajectory prediction aims to predict the movement trend of the agents like
pedestrians, bikers, vehicles. It is helpful to analyze and understand human
activities in crowded spaces and widely applied in many areas such as
surveillance video analysis and autonomous driving systems. Thanks to the
success of deep learning, trajectory prediction has made significant progress.
The current methods are dedicated to studying the agents' future trajectories
under the social interaction and the sceneries' physical constraints. Moreover,
how to deal with these factors still catches researchers' attention. However,
they ignore the \textbf{Semantic Shift Phenomenon} when modeling these
interactions in various prediction sceneries. There exist several kinds of
semantic deviations inner or between social and physical interactions, which we
call the ""\textbf{Gap}"". In this paper, we propose a \textbf{C}ontextual
\textbf{S}emantic \textbf{C}onsistency \textbf{Net}work (\textbf{CSCNet}) to
predict agents' future activities with powerful and efficient context
constraints. We utilize a well-designed context-aware transfer to obtain the
intermediate representations from the scene images and trajectories. Then we
eliminate the differences between social and physical interactions by aligning
activity semantics and scene semantics to cross the Gap. Experiments
demonstrate that CSCNet performs better than most of the current methods
quantitatively and qualitatively.
","[{'version': 'v1', 'created': 'Thu, 17 Feb 2022 08:20:58 GMT'}]",2022-02-18,"[['Xia', 'Beihao', ''], ['Wong', 'Conghao', ''], ['Peng', 'Qinmu', ''], ['Yuan', 'Wei', ''], ['You', 'Xinge', '']]","['Trajectory Prediction', 'The Context-aware Transfer', 'The']"
11241,2209.00334,Michael Chuah,"Garen Haddeler, Meng Yee (Michael) Chuah, Yangwei You, Jianle Chan,
  Albertus H. Adiwahono, Wei Yun Yau, Chee-Meng Chew","Traversability analysis with vision and terrain probing for safe legged
  robot navigation",,,10.3389/frobt.2022.887910,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Inspired by human behavior when traveling over unknown terrain, this study
proposes the use of probing strategies and integrates them into a
traversability analysis framework to address safe navigation on unknown rough
terrain. Our framework integrates collapsibility information into our existing
traversability analysis, as vision and geometric information alone could be
misled by unpredictable non-rigid terrains such as soft soil, bush area, or
water puddles. With the new traversability analysis framework, our robot has a
more comprehensive assessment of unpredictable terrain, which is critical for
its safety in outdoor environments. The pipeline first identifies the terrain's
geometric and semantic properties using an RGB-D camera and desired probing
locations on questionable terrains. These regions are probed using a force
sensor to determine the risk of terrain collapsing when the robot steps over
it. This risk is formulated as a collapsibility metric, which estimates an
unpredictable region's ground collapsibility. Thereafter, the collapsibility
metric, together with geometric and semantic spatial data, is combined and
analyzed to produce global and local traversability grid maps. These
traversability grid maps tell the robot whether it is safe to step over
different regions of the map. The grid maps are then utilized to generate
optimal paths for the robot to safely navigate to its goal. Our approach has
been successfully verified on a quadrupedal robot in both simulation and
real-world experiments.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2022 10:04:16 GMT'}]",2022-09-02,"[['Haddeler', 'Garen', '', 'Michael'], ['Yee', 'Meng', '', 'Michael'], ['Chuah', '', ''], ['You', 'Yangwei', ''], ['Chan', 'Jianle', ''], ['Adiwahono', 'Albertus H.', ''], ['Yau', 'Wei Yun', ''], ['Chew', 'Chee-Meng', '']]","['legged robots', 'traversability analysis', 'terrain probing', 'physical interaction planning', 'unknown environment navigation']"
11242,2204.05476,Amir Mosavi Prof,"Weibin Chen, Danial Sharifrazi, Guoxi Liang, Shahab S. Band, Kwok Wing
  Chau, Amir Mosavi","Accurate Discharge Coefficient Prediction of Streamlined Weirs by
  Coupling Linear Regression and Deep Convolutional Gated Recurrent Unit","28 pages, 7 figures","Engineering Applications of Computational Fluid Mechanics, 2022",10.1080/19942060.2022.2053786,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Streamlined weirs which are a nature-inspired type of weir have gained
tremendous attention among hydraulic engineers, mainly owing to their
established performance with high discharge coefficients. Computational fluid
dynamics (CFD) is considered as a robust tool to predict the discharge
coefficient. To bypass the computational cost of CFD-based assessment, the
present study proposes data-driven modeling techniques, as an alternative to
CFD simulation, to predict the discharge coefficient based on an experimental
dataset. To this end, after splitting the dataset using a k fold cross
validation technique, the performance assessment of classical and hybrid
machine learning deep learning (ML DL) algorithms is undertaken. Among ML
techniques linear regression (LR) random forest (RF) support vector machine
(SVM) k-nearest neighbor (KNN) and decision tree (DT) algorithms are studied.
In the context of DL, long short-term memory (LSTM) convolutional neural
network (CNN) and gated recurrent unit (GRU) and their hybrid forms such as
LSTM GRU, CNN LSTM and CNN GRU techniques, are compared using different error
metrics. It is found that the proposed three layer hierarchical DL algorithm
consisting of a convolutional layer coupled with two subsequent GRU levels,
which is also hybridized with the LR method, leads to lower error metrics. This
paper paves the way for data-driven modeling of streamlined weirs.
","[{'version': 'v1', 'created': 'Tue, 12 Apr 2022 01:59:36 GMT'}]",2022-04-13,"[['Chen', 'Weibin', ''], ['Sharifrazi', 'Danial', ''], ['Liang', 'Guoxi', ''], ['Band', 'Shahab S.', ''], ['Chau', 'Kwok Wing', ''], ['Mosavi', 'Amir', '']]","['Streamlined weirs', 'discharge prediction', 'deep learning', 'machine learning', 'deep convolutional neural network', 'gated recurrent unit']"
11243,2108.09141,Luo Ji,Luo Ji and Qin Qi and Bingqing Han and Hongxia Yang,"Reinforcement Learning to Optimize Lifetime Value in Cold-Start
  Recommendation",Accepted by CIKM 2021,,10.1145/3459637.348229,,cs.IR cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Recommender system plays a crucial role in modern E-commerce platform. Due to
the lack of historical interactions between users and items, cold-start
recommendation is a challenging problem. In order to alleviate the cold-start
issue, most existing methods introduce content and contextual information as
the auxiliary information. Nevertheless, these methods assume the recommended
items behave steadily over time, while in a typical E-commerce scenario, items
generally have very different performances throughout their life period. In
such a situation, it would be beneficial to consider the long-term return from
the item perspective, which is usually ignored in conventional methods.
Reinforcement learning (RL) naturally fits such a long-term optimization
problem, in which the recommender could identify high potential items,
proactively allocate more user impressions to boost their growth, therefore
improve the multi-period cumulative gains. Inspired by this idea, we model the
process as a Partially Observable and Controllable Markov Decision Process
(POC-MDP), and propose an actor-critic RL framework (RL-LTV) to incorporate the
item lifetime values (LTV) into the recommendation. In RL-LTV, the critic
studies historical trajectories of items and predict the future LTV of fresh
item, while the actor suggests a score-based policy which maximizes the future
LTV expectation. Scores suggested by the actor are then combined with classical
ranking scores in a dual-rank framework, therefore the recommendation is
balanced with the LTV consideration. Our method outperforms the strong live
baseline with a relative improvement of 8.67% and 18.03% on IPV and GMV of
cold-start items, on one of the largest E-commerce platform.
","[{'version': 'v1', 'created': 'Fri, 20 Aug 2021 12:26:37 GMT'}]",2021-08-23,"[['Ji', 'Luo', ''], ['Qi', 'Qin', ''], ['Han', 'Bingqing', ''], ['Yang', 'Hongxia', '']]","['Cold-Start Recommendation', 'Reinforcement Learning', 'Actor-CriticModel', 'POC-MDP', 'Lifetime Value']"
11244,2111.01484,I\~nigo Martinez,"I\~nigo Martinez, Jan L. Bruse, Ane M. Florez-Tapia, Elisabeth Viles,
  Igor G. Olaizola","ArchABM: an agent-based simulator of human interaction with the built
  environment. $CO_2$ and viral load analysis for indoor air quality","28 pages, 15 figures, 5 tables. Accepted on Building and Environment
  Journal, Special Issue on Human interaction with the built environment","Building and Environment Volume 207, Part B, January 2022, 108495",10.1016/j.buildenv.2021.108495,,cs.MA cs.AI cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Recent evidence suggests that SARS-CoV-2, which is the virus causing a global
pandemic in 2020, is predominantly transmitted via airborne aerosols in indoor
environments. This calls for novel strategies when assessing and controlling a
building's indoor air quality (IAQ). IAQ can generally be controlled by
ventilation and/or policies to regulate human-building-interaction. However, in
a building, occupants use rooms in different ways, and it may not be obvious
which measure or combination of measures leads to a cost- and energy-effective
solution ensuring good IAQ across the entire building. Therefore, in this
article, we introduce a novel agent-based simulator, ArchABM, designed to
assist in creating new or adapt existing buildings by estimating adequate room
sizes, ventilation parameters and testing the effect of policies while taking
into account IAQ as a result of complex human-building interaction patterns. A
recently published aerosol model was adapted to calculate time-dependent carbon
dioxide ($CO_2$) and virus quanta concentrations in each room and inhaled
$CO_2$ and virus quanta for each occupant over a day as a measure of
physiological response. ArchABM is flexible regarding the aerosol model and the
building layout due to its modular architecture, which allows implementing
further models, any number and size of rooms, agents, and actions reflecting
human-building interaction patterns. We present a use case based on a real
floor plan and working schedules adopted in our research center. This study
demonstrates how advanced simulation tools can contribute to improving IAQ
across a building, thereby ensuring a healthy indoor environment.
","[{'version': 'v1', 'created': 'Tue, 2 Nov 2021 10:38:29 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Jan 2022 11:24:58 GMT'}]",2022-01-17,"[['Martinez', 'Iñigo', ''], ['Bruse', 'Jan L.', ''], ['Florez-Tapia', 'Ane M.', ''], ['Viles', 'Elisabeth', ''], ['Olaizola', 'Igor G.', '']]","['agent-based modeling', 'indoor air quality', 'building ventilation', 'aerosol model', 'building design', 'simulation']"
11245,2202.03493,Eliska Kloberdanz,"E. Kloberdanz, K. G. Kloberdanz, W. Le","DeepStability: A Study of Unstable Numerical Methods and Their Solutions
  in Deep Learning",to be published in ICSE (2022),,10.1145/3510003.3510095,,cs.LG cs.NA math.NA,http://creativecommons.org/licenses/by/4.0/,"  Deep learning (DL) has become an integral part of solutions to various
important problems, which is why ensuring the quality of DL systems is
essential. One of the challenges of achieving reliability and robustness of DL
software is to ensure that algorithm implementations are numerically stable. DL
algorithms require a large amount and a wide variety of numerical computations.
A naive implementation of numerical computation can lead to errors that may
result in incorrect or inaccurate learning and results. A numerical algorithm
or a mathematical formula can have several implementations that are
mathematically equivalent, but have different numerical stability properties.
Designing numerically stable algorithm implementations is challenging, because
it requires an interdisciplinary knowledge of software engineering, DL, and
numerical analysis. In this paper, we study two mature DL libraries PyTorch and
Tensorflow with the goal of identifying unstable numerical methods and their
solutions. Specifically, we investigate which DL algorithms are numerically
unstable and conduct an in-depth analysis of the root cause, manifestation, and
patches to numerical instabilities. Based on these findings, we launch, the
first database of numerical stability issues and solutions in DL. Our findings
and provide future references to developers and tool builders to prevent,
detect, localize and fix numerically unstable algorithm implementations. To
demonstrate that, using {\it DeepStability} we have located numerical stability
issues in Tensorflow, and submitted a fix which has been accepted and merged
in.
","[{'version': 'v1', 'created': 'Mon, 7 Feb 2022 20:15:30 GMT'}]",2022-02-09,"[['Kloberdanz', 'E.', ''], ['Kloberdanz', 'K. G.', ''], ['Le', 'W.', '']]","['numerical stability', 'deep learning', 'numerical algorithms']"
11246,2004.08131,Shreshth Tuli,"Sukhpal Singh Gill, Shreshth Tuli, Adel Nadjaran Toosi, Felix
  Cuadrado, Peter Garraghan, Rami Bahsoon, Hanan Lutfiyya, Rizos Sakellariou,
  Omer Rana, Schahram Dustdar and Rajkumar Buyya","ThermoSim: Deep Learning based Framework for Modeling and Simulation of
  Thermal-aware Resource Management for Cloud Computing Environments",Accepted in Journal of Systems and Software,,10.1016/j.jss.2020.110596,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current cloud computing frameworks host millions of physical servers that
utilize cloud computing resources in the form of different virtual machines
(VM). Cloud Data Center (CDC) infrastructures require significant amounts of
energy to deliver large scale computational services. Computing nodes generate
large volumes of heat, requiring cooling units in turn to eliminate the effect
of this heat. Thus, the overall energy consumption of the CDC increases
tremendously for servers as well as for cooling units. However, current
workload allocation policies do not take into account the effect on temperature
and it is challenging to simulate the thermal behavior of CDCs. There is a need
for a thermal-aware framework to simulate and model the behavior of nodes and
measure the important performance parameters which can be affected by its
temperature. In this paper, we propose a lightweight framework, ThermoSim, for
modeling and simulation of thermal-aware resource management for cloud
computing environments. This work presents a Recurrent Neural Network based
deep learning temperature predictor for CDCs which is utilized by ThermoSim for
lightweight resource management in constrained cloud environments. ThermoSim
extends the CloudSim toolkit helping to analyze the performance of various key
parameters such as energy consumption, SLA violation rate, number of VM
migrations and temperature during the management of cloud resources for
execution of workloads. Further, different energy-aware and thermal-aware
resource management techniques are tested using the proposed ThermoSim
framework in order to validate it against the existing framework. The
experimental results demonstrate the proposed framework is capable of modeling
and simulating the thermal behavior of a CDC and the ThermoSim framework is
better than Thas in terms of energy consumption, cost, time, memory usage &
prediction accuracy.
","[{'version': 'v1', 'created': 'Fri, 17 Apr 2020 09:14:26 GMT'}, {'version': 'v2', 'created': 'Fri, 8 May 2020 16:33:59 GMT'}]",2020-05-11,"[['Gill', 'Sukhpal Singh', ''], ['Tuli', 'Shreshth', ''], ['Toosi', 'Adel Nadjaran', ''], ['Cuadrado', 'Felix', ''], ['Garraghan', 'Peter', ''], ['Bahsoon', 'Rami', ''], ['Lutfiyya', 'Hanan', ''], ['Sakellariou', 'Rizos', ''], ['Rana', 'Omer', ''], ['Dustdar', 'Schahram', ''], ['Buyya', 'Rajkumar', '']]","['Cloud Computing', 'Resource Management', 'Thermal-aware', 'Simulation', 'Deep Learning', 'Energy']"
11247,2006.16642,Erion \c{C}ano,Erion \c{C}ano and Maurizio Morisio,A Data-driven Neural Network Architecture for Sentiment Analysis,"18 pages, 4 tables, 7 figures","Data Technologies and Applications, Vol. 53, No. 1, pp. 2-19, 2019",10.1108/DTA-03-2018-0017,,cs.CL cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The fabulous results of convolution neural networks in image-related tasks,
attracted attention of text mining, sentiment analysis and other text analysis
researchers. It is however difficult to find enough data for feeding such
networks, optimize their parameters, and make the right design choices when
constructing network architectures. In this paper we present the creation steps
of two big datasets of song emotions. We also explore usage of convolution and
max-pooling neural layers on song lyrics, product and movie review text
datasets. Three variants of a simple and flexible neural network architecture
are also compared. Our intention was to spot any important patterns that can
serve as guidelines for parameter optimization of similar models. We also
wanted to identify architecture design choices which lead to high performing
sentiment analysis models. To this end, we conducted a series of experiments
with neural architectures of various configurations. Our results indicate that
parallel convolutions of filter lengths up to three are usually enough for
capturing relevant text features. Also, max-pooling region size should be
adapted to the length of text documents for producing the best feature maps.
Top results we got are obtained with feature maps of lengths 6 to 18. An
improvement on future neural network models for sentiment analysis, could be
generating sentiment polarity prediction of documents using aggregation of
predictions on smaller excerpt of the entire text.
","[{'version': 'v1', 'created': 'Tue, 30 Jun 2020 10:08:36 GMT'}]",2020-07-01,"[['Çano', 'Erion', ''], ['Morisio', 'Maurizio', '']]","['Sentiment Analysis', 'Convolution Neural Networks', 'Text Dataset Properties', 'DeepLearning Architectures']"
11248,2012.02925,Weicheng Xue,"Weicheng Xue, Charles W. Jackson and Christoper J. Roy","An Improved Framework of GPU Computing for CFD Applications on
  Structured Grids using OpenACC","43 pages, 27 figures",,10.1016/j.jpdc.2021.05.010,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is focused on improving multi-GPU performance of a research CFD
code on structured grids. MPI and OpenACC directives are used to scale the code
up to 16 GPUs. This paper shows that using 16 P100 GPUs and 16 V100 GPUs can be
30$\times$ and 70$\times$ faster than 16 Xeon CPU E5-2680v4 cores for three
different test cases, respectively. A series of performance issues related to
the scaling for the multi-block CFD code are addressed by applying various
optimizations. Performance optimizations such as the pack/unpack message
method, removing temporary arrays as arguments to procedure calls, allocating
global memory for limiters and connected boundary data, reordering non-blocking
MPI I\_send/I\_recv and Wait calls, reducing unnecessary implicit derived type
member data movement between the host and the device and the use of GPUDirect
can improve the compute utilization, memory throughput, and asynchronous
progression in the multi-block CFD code using modern programming features.
","[{'version': 'v1', 'created': 'Sat, 5 Dec 2020 02:25:56 GMT'}]",2021-06-10,"[['Xue', 'Weicheng', ''], ['Jackson', 'Charles W.', ''], ['Roy', 'Christoper J.', '']]","['MPI', 'OpenACC', 'Multi-GPU', 'CFD', 'Performance Optimization', 'Structured Grid']"
11249,2107.12322,Anton Khritankov,"Anton Khritankov, Nikita Pershin, Nikita Ukhov and Artem Ukhov",MLDev: Data Science Experiment Automation and Reproducibility Software,"11 pages, 2 figures","DAMDID/RCDL-2021, CCIS vol. 1620 (2022), Springer Cham, 3-18",10.1007/978-3-031-12285-9_1,,cs.LG cs.MS cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we explore the challenges of automating experiments in data
science. We propose an extensible experiment model as a foundation for
integration of different open source tools for running research experiments. We
implement our approach in a prototype open source MLDev software package and
evaluate it in a series of experiments yielding promising results. Comparison
with other state-of-the-art tools signifies novelty of our approach.
","[{'version': 'v1', 'created': 'Mon, 26 Jul 2021 16:51:44 GMT'}]",2022-09-21,"[['Khritankov', 'Anton', ''], ['Pershin', 'Nikita', ''], ['Ukhov', 'Nikita', ''], ['Ukhov', 'Artem', '']]","['experiment automation', 'data science', 'reproducibility']"
11250,2108.03100,Loris Bozzato,"Loris Bozzato, Thomas Eiter, Rafael Kiesel","Reasoning on Multi-Relational Contextual Hierarchies via Answer Set
  Programming with Algebraic Measures","Paper presented at the 37th International Conference on Logic
  Programming (ICLP 2021). 32 pages, 17 pages are appendix. (v2 updates:
  updated acknowledgements, added journal reference and DOI)","Theory and Practice of Logic Programming, 21(5):593-609, 2021",10.1017/S1471068421000284,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dealing with context dependent knowledge has led to different formalizations
of the notion of context. Among them is the Contextualized Knowledge Repository
(CKR) framework, which is rooted in description logics but links on the
reasoning side strongly to logic programs and Answer Set Programming (ASP) in
particular. The CKR framework caters for reasoning with defeasible axioms and
exceptions in contexts, which was extended to knowledge inheritance across
contexts in a coverage (specificity) hierarchy. However, the approach supports
only this single type of contextual relation and the reasoning procedures work
only for restricted hierarchies, due to non-trivial issues with model
preference under exceptions. In this paper, we overcome these limitations and
present a generalization of CKR hierarchies to multiple contextual relations,
along with their interpretation of defeasible axioms and preference. To support
reasoning, we use ASP with algebraic measures, which is a recent extension of
ASP with weighted formulas over semirings that allows one to associate
quantities with interpretations depending on the truth values of propositional
atoms. Notably, we show that for a relevant fragment of CKR hierarchies with
multiple contextual relations, query answering can be realized with the popular
asprin framework. The algebraic measures approach is more powerful and enables
e.g. reasoning with epistemic queries over CKRs, which opens interesting
perspectives for the use of quantitative ASP extensions in other applications.
","[{'version': 'v1', 'created': 'Fri, 6 Aug 2021 13:06:45 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Dec 2021 21:24:52 GMT'}]",2021-12-23,"[['Bozzato', 'Loris', ''], ['Eiter', 'Thomas', ''], ['Kiesel', 'Rafael', '']]","['Defeasible Knowledge', 'Description Logics', 'ASP', 'Algebraic Measures', 'Justifiable Exceptions']"
11251,2103.16345,Nicolas Moes,Nicolas Moes and Nicolas Chevaugeon,"Lipschitz regularization for softening material models: the Lip-field
  approach",21 pages,"Comptes Rendus. M\'ecanique, Tome 349 (2021) no. 2, pp. 415-434",10.5802/crmeca.91,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  Softening material models are known to trigger spurious localizations.This
may be shown theoretically by the existence of solutions with zero dissipation
when localization occurs and numerically with spurious mesh dependency and
localization in a single layer of elements. We introduce in this paper a new
way to avoid spurious localization. The idea is to enforce a Lipschitz
regularity on the internal variables responsible for the material softening.
The regularity constraint introduces the needed length scale in the material
formulation. Moreover, we prove bounds on the domain affected by this
constraint. A first one-dimensional finite element implementation is proposed
for softening elasticity and softening plasticity.
","[{'version': 'v1', 'created': 'Tue, 30 Mar 2021 13:43:05 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Jul 2021 12:40:26 GMT'}]",2021-08-10,"[['Moes', 'Nicolas', ''], ['Chevaugeon', 'Nicolas', '']]","['softening', 'localization', 'damage', 'plasticity', 'Lipschitz', 'Lip-field']"
11252,2211.14382,Jeremie Lagraviere,"Sudeep Kanur, Georgios Georgakarakos, Antti Siiril\""a, J\'er\'emie
  Lagravi\`ere, Kristian Nybom, S\'ebastien Lafond, Johan Lilius",Parallel decoder for Low Density Parity Check Codes: A MPSoC study,"2013 International Conference on High Performance Computing &
  Simulation (HPCS)",,10.1109/HPCSim.2013.6641414,,cs.DC cs.PF,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The near channel performance of Low Density Parity Check Codes (LDPC) has
motivated its wide applications. Iterative decoding of LDPC codes provides
significant implementation challenges as the complexity grows with the code
size. Recent trends in integrating Multiprocessor System on Chip (MPSoC) with
Network on Chip (NoC) gives a modular platform for parallel implementation.
This paper presents an implementation platform for decoding LDPC codes based on
HeMPS, an open source MPSoC framework based on NoC communication fabric.
Reduced minimum sum algorithm is used for decoding LDPC codes and simulations
are performed using HeMPS tool. The data rate and speedup factor measured for
decoding a rate 1/2 LDPC code characterised by 252x504 parity matrix is
presented
","[{'version': 'v1', 'created': 'Fri, 25 Nov 2022 21:46:07 GMT'}]",2022-11-29,"[['Kanur', 'Sudeep', ''], ['Georgakarakos', 'Georgios', ''], ['Siirilä', 'Antti', ''], ['Lagravière', 'Jérémie', ''], ['Nybom', 'Kristian', ''], ['Lafond', 'Sébastien', ''], ['Lilius', 'Johan', '']]","['Low Density Parity Check codes (LDPC)', 'Minimumsum decoding algorithm', 'HeMPS', 'MPSoC', 'NoC', 'Message passinginterface (MPI)']"
11253,2012.02899,Reza Maalek,Reza Maalek and Derek Lichti,"Automated Calibration of Mobile Cameras for 3D Reconstruction of
  Mechanical Pipes",,,10.1111/phor.12364,,cs.CV cs.CG,http://creativecommons.org/licenses/by/4.0/,"  This manuscript provides a new framework for calibration of optical
instruments, in particular mobile cameras, using large-scale circular black and
white target fields. New methods were introduced for (i) matching targets
between images; (ii) adjusting the systematic eccentricity error of target
centers; and (iii) iteratively improving the calibration solution through a
free-network self-calibrating bundle adjustment. It was observed that the
proposed target matching effectively matched circular targets in 270 mobile
phone images from a complete calibration laboratory with robustness to Type II
errors. The proposed eccentricity adjustment, which requires only camera
projective matrices from two views, behaved synonymous to available closed-form
solutions, which require several additional object space target information a
priori. Finally, specifically for the case of the mobile devices, the
calibration parameters obtained using our framework was found superior compared
to in-situ calibration for estimating the 3D reconstructed radius of a
mechanical pipe (approximately 45% improvement).
","[{'version': 'v1', 'created': 'Fri, 4 Dec 2020 23:41:25 GMT'}]",2021-05-03,"[['Maalek', 'Reza', ''], ['Lichti', 'Derek', '']]","['mobile camera calibration', 'ellipse eccentricity correction', 'circular target extraction and matching', '3D reconstruction of pipes']"
11254,2106.03669,Joshua Pearce,"Kanlayanee Kaweesinsakul, Siranee Nuchitprasitchai and Joshua M.
  Pearce","Open source disease analysis system of cactus by artificial intelligence
  and image processing",Preprint for IAIT2021,,10.1145/3468784.3469075,,cs.CV cs.AI,http://creativecommons.org/licenses/by-sa/4.0/,"  There is a growing interest in cactus cultivation because of numerous cacti
uses from houseplants to food and medicinal applications. Various diseases
impact the growth of cacti. To develop an automated model for the analysis of
cactus disease and to be able to quickly treat and prevent damage to the
cactus. The Faster R-CNN and YOLO algorithm technique were used to analyze
cactus diseases automatically distributed into six groups: 1) anthracnose, 2)
canker, 3) lack of care, 4) aphid, 5) rusts and 6) normal group. Based on the
experimental results the YOLOv5 algorithm was found to be more effective at
detecting and identifying cactus disease than the Faster R-CNN algorithm. Data
training and testing with YOLOv5S model resulted in a precision of 89.7% and an
accuracy (recall) of 98.5%, which is effective enough for further use in a
number of applications in cactus cultivation. Overall the YOLOv5 algorithm had
a test time per image of only 26 milliseconds. Therefore, the YOLOv5 algorithm
was found to suitable for mobile applications and this model could be further
developed into a program for analyzing cactus disease.
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2021 14:46:23 GMT'}]",2021-06-08,"[['Kaweesinsakul', 'Kanlayanee', ''], ['Nuchitprasitchai', 'Siranee', ''], ['Pearce', 'Joshua M.', '']]","['Cactus disease', 'Disease detection', 'YOLO', 'AI', 'Faster R-CNN']"
11255,cs/0507018,Youngchul Sung,"Youngchul Sung, Lang Tong and H. Vincent Poor","Optimal and Suboptimal Detection of Gaussian Signals in Noise:
  Asymptotic Relative Efficiency","To appear in the Proceedings of the SPIE Conference on Advanced
  Signal Processing Algorithms, Architectures and Implementations XV, San
  Diego, CA, Jul. 1 - Aug. 4, 2005",,10.1117/12.620177,,cs.IT math.IT,,"  The performance of Bayesian detection of Gaussian signals using noisy
observations is investigated via the error exponent for the average error
probability. Under unknown signal correlation structure or limited processing
capability it is reasonable to use the simple quadratic detector that is
optimal in the case of an independent and identically distributed (i.i.d.)
signal. Using the large deviations principle, the performance of this detector
(which is suboptimal for non-i.i.d. signals) is compared with that of the
optimal detector for correlated signals via the asymptotic relative efficiency
defined as the ratio between sample sizes of two detectors required for the
same performance in the large-sample-size regime. The effects of SNR on the ARE
are investigated. It is shown that the asymptotic efficiency of the simple
quadratic detector relative to the optimal detector converges to one as the SNR
increases without bound for any bounded spectrum, and that the simple quadratic
detector performs as well as the optimal detector for a wide range of the
correlation values at high SNR.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2005 19:05:09 GMT'}]",2009-11-11,"[['Sung', 'Youngchul', ''], ['Tong', 'Lang', ''], ['Poor', 'H. Vincent', '']]","['Quadratic detector', 'error exponent', 'large deviations principle', 'asymptotic relative efficiency (ARE)']"
11256,2212.07476,Niklas Deckers,"Niklas Deckers, Maik Fr\""obe, Johannes Kiesel, Gianluca Pandolfo,
  Christopher Schr\""oder, Benno Stein, Martin Potthast","The Infinite Index: Information Retrieval on Generative Text-To-Image
  Models",Final version for CHIIR 2023,,10.1145/3576840.3578327,,cs.IR cs.CL cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Conditional generative models such as DALL-E and Stable Diffusion generate
images based on a user-defined text, the prompt. Finding and refining prompts
that produce a desired image has become the art of prompt engineering.
Generative models do not provide a built-in retrieval model for a user's
information need expressed through prompts. In light of an extensive literature
review, we reframe prompt engineering for generative models as interactive
text-based retrieval on a novel kind of ""infinite index"". We apply these
insights for the first time in a case study on image generation for game design
with an expert. Finally, we envision how active learning may help to guide the
retrieval of generated images.
","[{'version': 'v1', 'created': 'Wed, 14 Dec 2022 19:50:35 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Jan 2023 18:16:14 GMT'}]",2023-01-24,"[['Deckers', 'Niklas', ''], ['Fröbe', 'Maik', ''], ['Kiesel', 'Johannes', ''], ['Pandolfo', 'Gianluca', ''], ['Schröder', 'Christopher', ''], ['Stein', 'Benno', ''], ['Potthast', 'Martin', '']]","['case study', 'evaluation', 'generative models', 'image retrieval']"
11257,2003.12006,Christof Beierle,"Christof Beierle, Marcus Brinkmann, Gregor Leander",Linearly Self-Equivalent APN Permutations in Small Dimension,"30 pages. This is the version accepted to IEEE Transactions on
  Information Theory. The final published version is going to appear and can be
  found under the provided DOI",IEEE Trans. Inf. Theory 67(7): 4863-4875 (2021),10.1109/TIT.2021.3071533,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  All almost perfect nonlinear (APN) permutations that we know to date admit a
special kind of linear self-equivalence, i.e., there exists a permutation $G$
in their CCZ-equivalence class and two linear permutations $A$ and $B$, such
that $G \circ A = B \circ G$. After providing a survey on the known APN
functions with a focus on the existence of self-equivalences, we search for APN
permutations in dimension 6, 7, and 8 that admit such a linear
self-equivalence. In dimension six, we were able to conduct an exhaustive
search and obtain that there is only one such APN permutation up to
CCZ-equivalence. In dimensions 7 and 8, we performed an exhaustive search for
all but a few classes of linear self-equivalences and we did not find any new
APN permutation. As one interesting result in dimension 7, we obtain that all
APN permutation polynomials with coefficients in $\mathbb{F}_2$ must be (up to
CCZ-equivalence) monomial functions.
","[{'version': 'v1', 'created': 'Thu, 26 Mar 2020 16:17:36 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Sep 2020 13:34:57 GMT'}, {'version': 'v3', 'created': 'Tue, 6 Apr 2021 07:36:24 GMT'}]",2021-06-28,"[['Beierle', 'Christof', ''], ['Brinkmann', 'Marcus', ''], ['Leander', 'Gregor', '']]","['APN permutations', 'differential cryptanalysis', 'self-equivalence', 'automorphism', 'CCZ-equivalence', 'exhaustive search']"
11258,1810.03670,Emadeldin Abbas Mazied Abdrabou,"EmadelDin A. Mazied, Mustafa Y. ElNainay, Mohammad J. Abdel-Rahman,
  Scott F. Midkiff, Mohamed R. M. Rizk, Hesham A. Rakha, and Allen B. MacKenzie","The Wireless Control Plane: An Overview and Directions for Future
  Research","This paper has been accepted to appear in Elsevier Journal of
  Networks and Computer Applications. It has 34 pages, 8 figures, and two
  tables",,10.1016/j.jnca.2018.09.017,,cs.NI,http://creativecommons.org/publicdomain/zero/1.0/,"  Software-defined networking (SDN), which has been successfully deployed in
the management of complex data centers, has recently been incorporated into a
myriad of 5G networks to intelligently manage a wide range of heterogeneous
wireless devices, software systems, and wireless access technologies. Thus, the
SDN control plane needs to communicate wirelessly with the wireless data plane
either directly or indirectly. The uncertainties in the wireless SDN control
plane (WCP) make its design challenging. Both WCP schemes (direct WCP, D-WCP,
and indirect WCP, I-WCP) have been incorporated into recent 5G networks;
however, a discussion of their design principles and their design limitations
is missing. This paper introduces an overview of the WCP design (I-WCP and
D-WCP) and discusses its intricacies by reviewing its deployment in recent 5G
networks. Furthermore, to facilitate synthesizing a robust WCP, this paper
proposes a generic WCP framework using deep reinforcement learning (DRL)
principles and presents a roadmap for future research.
","[{'version': 'v1', 'created': 'Mon, 8 Oct 2018 19:22:39 GMT'}]",2018-10-15,"[['Mazied', 'EmadelDin A.', ''], ['ElNainay', 'Mustafa Y.', ''], ['Abdel-Rahman', 'Mohammad J.', ''], ['Midkiff', 'Scott F.', ''], ['Rizk', 'Mohamed R. M.', ''], ['Rakha', 'Hesham A.', ''], ['MacKenzie', 'Allen B.', '']]","['Software-defined networks', 'wireless control plane', 'wireless SDN controller', 'deepreinforcement learning']"
11259,2009.00304,"S\""oren Henning","S\""oren Henning, Wilhelm Hasselbring","Theodolite: Scalability Benchmarking of Distributed Stream Processing
  Engines in Microservice Architectures",28 pages,Big Data Research 25 (2021),10.1016/j.bdr.2021.100209,,cs.SE cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed stream processing engines are designed with a focus on
scalability to process big data volumes in a continuous manner. We present the
Theodolite method for benchmarking the scalability of distributed stream
processing engines. Core of this method is the definition of use cases that
microservices implementing stream processing have to fulfill. For each use
case, our method identifies relevant workload dimensions that might affect the
scalability of a use case. We propose to design one benchmark per use case and
relevant workload dimension. We present a general benchmarking framework, which
can be applied to execute the individual benchmarks for a given use case and
workload dimension. Our framework executes an implementation of the use case's
dataflow architecture for different workloads of the given dimension and
various numbers of processing instances. This way, it identifies how resources
demand evolves with increasing workloads. Within the scope of this paper, we
present 4 identified use cases, derived from processing Industrial Internet of
Things data, and 7 corresponding workload dimensions. We provide
implementations of 4 benchmarks with Kafka Streams and Apache Flink as well as
an implementation of our benchmarking framework to execute scalability
benchmarks in cloud environments. We use both for evaluating the Theodolite
method and for benchmarking Kafka Streams' and Flink's scalability for
different deployment options.
","[{'version': 'v1', 'created': 'Tue, 1 Sep 2020 09:13:16 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Dec 2020 14:45:35 GMT'}, {'version': 'v3', 'created': 'Thu, 11 Feb 2021 14:30:56 GMT'}]",2021-02-12,"[['Henning', 'Sören', ''], ['Hasselbring', 'Wilhelm', '']]","['Stream Processing', 'Microservices', 'Benchmarking', 'Scalability']"
11260,1911.08350,Juan Banda,Toqi Tahamid Sarker and Juan M. Banda,"Solar Event Tracking with Deep Regression Networks: A Proof of Concept
  Evaluation","8 pages, 5 figures, this has been submitted and accepted for
  publication at IEEE Big Data 2019 - SABID Workshop",2019 IEEE International Conference on Big Data (Big Data),10.1109/BigData47090.2019.9006273,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the advent of deep learning for computer vision tasks, the need for
accurately labeled data in large volumes is vital for any application. The
increasingly available large amounts of solar image data generated by the Solar
Dynamic Observatory (SDO) mission make this domain particularly interesting for
the development and testing of deep learning systems. The currently available
labeled solar data is generated by the SDO mission's Feature Finding Team's
(FFT) specialized detection modules. The major drawback of these modules is
that detection and labeling is performed with a cadence of every 4 to 12 hours,
depending on the module. Since SDO image data products are created every 10
seconds, there is a considerable gap between labeled observations and the
continuous data stream. In order to address this shortcoming, we trained a deep
regression network to track the movement of two solar phenomena: Active Region
and Coronal Hole events. To the best of our knowledge, this is the first
attempt of solar event tracking using a deep learning approach. Since it is
impossible to fully evaluate the performance of the suggested event tracks with
the original data (only partial ground truth is available), we demonstrate with
several metrics the effectiveness of our approach. With the purpose of
generating continuously labeled solar image data, we present this feasibility
analysis showing the great promise of deep regression networks for this task.
","[{'version': 'v1', 'created': 'Tue, 19 Nov 2019 15:32:10 GMT'}]",2020-04-01,"[['Sarker', 'Toqi Tahamid', ''], ['Banda', 'Juan M.', '']]","['deep learning', 'object tracking', 'solar event tracking', 'computer vision', 'deep regression networks']"
11261,2208.04096,Zhichao Zhou,"Zhichao Zhou, Yuming Zhou, Chunrong Fang, Zhenyu Chen, Yutian Tang","Selectively Combining Multiple Coverage Goals in Search-Based Unit Test
  Generation",,,10.1145/3551349.3556902,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Unit testing is a critical part of software development process, ensuring the
correctness of basic programming units in a program (e.g., a method).
Search-based software testing (SBST) is an automated approach to generating
test cases. SBST generates test cases with genetic algorithms by specifying the
coverage criterion (e.g., branch coverage). However, a good test suite must
have different properties, which cannot be captured by using an individual
coverage criterion. Therefore, the state-of-the-art approach combines multiple
criteria to generate test cases. As combining multiple coverage criteria brings
multiple objectives for optimization, it hurts the test suites' coverage for
certain criteria compared with using the single criterion. To cope with this
problem, we propose a novel approach named \textbf{smart selection}. Based on
the coverage correlations among criteria and the coverage goals' subsumption
relationships, smart selection selects a subset of coverage goals to reduce the
number of optimization objectives and avoid missing any properties of all
criteria. We conduct experiments to evaluate smart selection on $400$ Java
classes with three state-of-the-art genetic algorithms. On average, smart
selection outperforms combining all goals on $65.1\%$ of the classes having
significant differences between the two approaches.
","[{'version': 'v1', 'created': 'Mon, 8 Aug 2022 12:30:25 GMT'}]",2023-01-10,"[['Zhou', 'Zhichao', ''], ['Zhou', 'Yuming', ''], ['Fang', 'Chunrong', ''], ['Chen', 'Zhenyu', ''], ['Tang', 'Yutian', '']]","['SBST', 'software testing', 'test generation']"
11262,2102.00625,Gabriel Lima,"Gabriel Lima, Nina Grgi\'c-Hla\v{c}a, Meeyoung Cha","Human Perceptions on Moral Responsibility of AI: A Case Study in
  AI-Assisted Bail Decision-Making","17 Pages, 5 Figures, ACM CHI 2021",,10.1145/3411764.3445260,,cs.CY cs.AI cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  How to attribute responsibility for autonomous artificial intelligence (AI)
systems' actions has been widely debated across the humanities and social
science disciplines. This work presents two experiments ($N$=200 each) that
measure people's perceptions of eight different notions of moral responsibility
concerning AI and human agents in the context of bail decision-making. Using
real-life adapted vignettes, our experiments show that AI agents are held
causally responsible and blamed similarly to human agents for an identical
task. However, there was a meaningful difference in how people perceived these
agents' moral responsibility; human agents were ascribed to a higher degree of
present-looking and forward-looking notions of responsibility than AI agents.
We also found that people expect both AI and human decision-makers and advisors
to justify their decisions regardless of their nature. We discuss policy and
HCI implications of these findings, such as the need for explainable AI in
high-stakes scenarios.
","[{'version': 'v1', 'created': 'Mon, 1 Feb 2021 04:07:38 GMT'}]",2021-02-02,"[['Lima', 'Gabriel', ''], ['Grgić-Hlača', 'Nina', ''], ['Cha', 'Meeyoung', '']]","['AI', 'Moral Responsibility', 'Responsibility', 'Moral Judgment', 'Blame', 'Liability', 'COMPAS', 'Bail Decision-Making']"
11263,2205.02414,Avijit Ghosh,"Avijit Ghosh, Matthew Jagielski, Christo Wilson",Subverting Fair Image Search with Generative Adversarial Perturbations,"Accepted as a full paper at the 2022 ACM Conference on Fairness,
  Accountability, and Transparency (FAccT 22)",,10.1145/3531146.3533128,,cs.LG cs.CY,http://creativecommons.org/licenses/by/4.0/,"  In this work we explore the intersection fairness and robustness in the
context of ranking: when a ranking model has been calibrated to achieve some
definition of fairness, is it possible for an external adversary to make the
ranking model behave unfairly without having access to the model or training
data? To investigate this question, we present a case study in which we develop
and then attack a state-of-the-art, fairness-aware image search engine using
images that have been maliciously modified using a Generative Adversarial
Perturbation (GAP) model. These perturbations attempt to cause the fair
re-ranking algorithm to unfairly boost the rank of images containing people
from an adversary-selected subpopulation.
  We present results from extensive experiments demonstrating that our attacks
can successfully confer significant unfair advantage to people from the
majority class relative to fairly-ranked baseline search results. We
demonstrate that our attacks are robust across a number of variables, that they
have close to zero impact on the relevance of search results, and that they
succeed under a strict threat model. Our findings highlight the danger of
deploying fair machine learning algorithms in-the-wild when (1) the data
necessary to achieve fairness may be adversarially manipulated, and (2) the
models themselves are not robust against attacks.
","[{'version': 'v1', 'created': 'Thu, 5 May 2022 03:05:34 GMT'}, {'version': 'v2', 'created': 'Fri, 6 May 2022 19:54:48 GMT'}]",2022-05-10,"[['Ghosh', 'Avijit', ''], ['Jagielski', 'Matthew', ''], ['Wilson', 'Christo', '']]","['Information Retrieval', 'Fair Ranking', 'Adversarial Machine Learning', 'Demographic Inference']"
11264,1604.04737,Victor Sanchez-Anguix Dr.,"Victor Sanchez-Anguix, Vicente Julian, Vicente Botti and Ana
  Garcia-Fornes","Studying the impact of negotiation environments on negotiation teams'
  performance","Information Sciences, 2013",,10.1016/j.ins.2012.07.017,,cs.MA cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article we study the impact of the negotiation environment on the
performance of several intra-team strategies (team dynamics) for agent-based
negotiation teams that negotiate with an opponent. An agent-based negotiation
team is a group of agents that joins together as a party because they share
common interests in the negotiation at hand. It is experimentally shown how
negotiation environment conditions like the deadline of both parties, the
concession speed of the opponent, similarity among team members, and team size
affect performance metrics like the minimum utility of team members, the
average utility of team members, and the number of negotiation rounds. Our goal
is identifying which intra-team strategies work better in different
environmental conditions in order to provide useful knowledge for team members
to select appropriate intra-team strategies according to environmental
conditions.
","[{'version': 'v1', 'created': 'Sat, 16 Apr 2016 12:13:02 GMT'}]",2016-04-19,"[['Sanchez-Anguix', 'Victor', ''], ['Julian', 'Vicente', ''], ['Botti', 'Vicente', ''], ['Garcia-Fornes', 'Ana', '']]","['Negotiation Teams', 'Agreement Technologies', 'AutomatedNegotiation', 'Collective Decision Making', 'Multi-agent Systems']"
11265,1909.11185,Hayoung Chung,"Hayoung Chung, Oded Amir, H. Alicia Kim",Level-set topology optimization considering nonlinear thermoelasticity,,,10.1016/j.cma.2019.112735,,cs.CE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  At elevated temperature environments, elastic structures experience a change
of the stress-free state of the body that can strongly influence the optimal
topology of the structure. This work presents level-set based topology
optimization of structures undergoing large deformations due to thermal and
mechanical loads. The nonlinear analysis model is constructed by
multiplicatively decomposing thermal and mechanical effects and introducing an
intermediate stress-free state between the undeformed and deformed coordinates.
By incorporating the thermoelastic nonlinearity into the level-set topology
optimization scheme, wider design spaces can be explored with the consideration
of both mechanical and thermal loads. Four numerical examples are presented
that demonstrate how temperature changes affect the optimal design of
large-deforming structures. In particular, we show how optimization can
manipulate the material layout in order to create a counteracting effect
between thermal and mechanical loads, even up to a degree that buckling and
snap-through are suppressed. Hence the consideration of large deformations in
conjunction with thermoelasticity opens many new possibilities for controlling
and manipulating the thermo-mechanical response via topology optimization.
","[{'version': 'v1', 'created': 'Sat, 21 Sep 2019 07:11:09 GMT'}]",2020-02-19,"[['Chung', 'Hayoung', ''], ['Amir', 'Oded', ''], ['Kim', 'H. Alicia', '']]","['Nonlinearity', 'Thermoelasticity', 'Topology Optimization', 'Level-set']"
11266,1410.7484,Tianfei Zhou,"Tianfei Zhou and Yao Lu and Feng Lv and Huijun Di and Qingjie Zhao and
  Jian Zhang","Abrupt Motion Tracking via Nearest Neighbor Field Driven Stochastic
  Sampling",submitted to Elsevier Neurocomputing,,10.1016/j.neucom.2015.03.024,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stochastic sampling based trackers have shown good performance for abrupt
motion tracking so that they have gained popularity in recent years. However,
conventional methods tend to use a two-stage sampling paradigm, in which the
search space needs to be uniformly explored with an inefficient preliminary
sampling phase. In this paper, we propose a novel sampling-based method in the
Bayesian filtering framework to address the problem. Within the framework,
nearest neighbor field estimation is utilized to compute the importance
proposal probabilities, which guide the Markov chain search towards promising
regions and thus enhance the sampling efficiency; given the motion priors, a
smoothing stochastic sampling Monte Carlo algorithm is proposed to approximate
the posterior distribution through a smoothing weight-updating scheme.
Moreover, to track the abrupt and the smooth motions simultaneously, we develop
an abrupt-motion detection scheme which can discover the presence of abrupt
motions during online tracking. Extensive experiments on challenging image
sequences demonstrate the effectiveness and the robustness of our algorithm in
handling the abrupt motions.
","[{'version': 'v1', 'created': 'Tue, 28 Oct 2014 01:38:23 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Jan 2015 05:47:13 GMT'}]",2015-03-11,"[['Zhou', 'Tianfei', ''], ['Lu', 'Yao', ''], ['Lv', 'Feng', ''], ['Di', 'Huijun', ''], ['Zhao', 'Qingjie', ''], ['Zhang', 'Jian', '']]","['Visual tracking', 'abrupt motion', 'stochastic sampling', 'nearest']"
11267,1707.00409,Jiayun Wang,"Jiayun Wang, Sanping Zhou, Jinjun Wang, Qiqi Hou","Deep Ranking Model by Large Adaptive Margin Learning for Person
  Re-identification",Accepted to Pattern Recognition,,10.1016/j.patcog.2017.09.024,PR-D-17-00433,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Person re-identification aims to match images of the same person across
disjoint camera views, which is a challenging problem in video surveillance.
The major challenge of this task lies in how to preserve the similarity of the
same person against large variations caused by complex backgrounds, mutual
occlusions and different illuminations, while discriminating the different
individuals. In this paper, we present a novel deep ranking model with feature
learning and fusion by learning a large adaptive margin between the intra-class
distance and inter-class distance to solve the person re-identification
problem. Specifically, we organize the training images into a batch of pairwise
samples. Treating these pairwise samples as inputs, we build a novel part-based
deep convolutional neural network (CNN) to learn the layered feature
representations by preserving a large adaptive margin. As a result, the final
learned model can effectively find out the matched target to the anchor image
among a number of candidates in the gallery image set by learning
discriminative and stable feature representations. Overcoming the weaknesses of
conventional fixed-margin loss functions, our adaptive margin loss function is
more appropriate for the dynamic feature space. On four benchmark datasets,
PRID2011, Market1501, CUHK01 and 3DPeS, we extensively conduct comparative
evaluations to demonstrate the advantages of the proposed method over the
state-of-the-art approaches in person re-identification.
","[{'version': 'v1', 'created': 'Mon, 3 Jul 2017 05:58:46 GMT'}, {'version': 'v2', 'created': 'Sun, 17 Sep 2017 05:38:21 GMT'}]",2017-09-26,"[['Wang', 'Jiayun', ''], ['Zhou', 'Sanping', ''], ['Wang', 'Jinjun', ''], ['Hou', 'Qiqi', '']]","['Person Re-identification', 'Deep Ranking Model', 'Metric Learning']"
11268,1905.10077,Lixin Su,"Lixin Su, Jiafeng Guo, Yixing Fan, Yanyan Lan, and Xueqi Cheng",Controlling Risk of Web Question Answering,"42nd International ACM SIGIR Conference on Research and Development
  in Information Retrieval",,10.1145/3331184.3331261,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web question answering (QA) has become an indispensable component in modern
search systems, which can significantly improve users' search experience by
providing a direct answer to users' information need. This could be achieved by
applying machine reading comprehension (MRC) models over the retrieved passages
to extract answers with respect to the search query. With the development of
deep learning techniques, state-of-the-art MRC performances have been achieved
by recent deep methods. However, existing studies on MRC seldom address the
predictive uncertainty issue, i.e., how likely the prediction of an MRC model
is wrong, leading to uncontrollable risks in real-world Web QA applications. In
this work, we first conduct an in-depth investigation over the risk of Web QA.
We then introduce a novel risk control framework, which consists of a qualify
model for uncertainty estimation using the probe idea, and a decision model for
selectively output. For evaluation, we introduce risk-related metrics, rather
than the traditional EM and F1 in MRC, for the evaluation of risk-aware Web QA.
The empirical results over both the real-world Web QA dataset and the academic
MRC benchmark collection demonstrate the effectiveness of our approach.
","[{'version': 'v1', 'created': 'Fri, 24 May 2019 07:55:42 GMT'}, {'version': 'v2', 'created': 'Mon, 27 May 2019 02:24:32 GMT'}, {'version': 'v3', 'created': 'Thu, 11 Jul 2019 05:10:47 GMT'}]",2019-07-12,"[['Su', 'Lixin', ''], ['Guo', 'Jiafeng', ''], ['Fan', 'Yixing', ''], ['Lan', 'Yanyan', ''], ['Cheng', 'Xueqi', '']]","['risk control', 'predictive uncertainty', 'Web QA']"
11269,2101.02527,Christian Hesch,"Ustim Khristenko, Stefan Schu{\ss}, Melanie Kr\""uger, Felix Schmidt,
  Barbara Wohlmuth, Christian Hesch","Multidimensional coupling: A variationally consistent approach to
  fiber-reinforced materials",,,10.1016/j.cma.2021.113869,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel mathematical model for fiber-reinforced materials is proposed. It is
based on a 1-dimensional beam model for the thin fiber structures, a flexible
and general 3-dimensional elasticity model for the matrix and an overlapping
domain decomposition approach. From a computational point of view, this is
motivated by the fact that matrix and fibers can easily meshed independently.
Our main interest is in fiber reinforce polymers where the Young's modulus are
quite different. Thus the modeling error from the overlapping approach is of no
significance. The coupling conditions acknowledge both, the forces and the
moments of the beam model and transfer them to the background material. A
suitable static condensation procedure is applied to remove the beam balance
equations. The condensed system then forms our starting point for a numerical
approximation in terms of isogeometric analysis. The choice of our discrete
basis functions of higher regularity is motivated by the fact, that as a result
of the static condensation, we obtain second gradient terms in fiber direction.
Eventually, a series of benchmark tests demonstrate the flexibility and
robustness of the proposed methodology. As a proof-of-concept, we show that our
new model is able to capture bending, torsion and shear dominated situations.
","[{'version': 'v1', 'created': 'Thu, 7 Jan 2021 13:03:03 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Feb 2021 14:29:01 GMT'}, {'version': 'v3', 'created': 'Sat, 10 Apr 2021 06:42:55 GMT'}]",2021-05-12,"[['Khristenko', 'Ustim', ''], ['Schuß', 'Stefan', ''], ['Krüger', 'Melanie', ''], ['Schmidt', 'Felix', ''], ['Wohlmuth', 'Barbara', ''], ['Hesch', 'Christian', '']]","['1D-3D coupling', 'overlapping domain decomposition', 'nonlinear beam model', 'condensation', 'second gradient material']"
11270,2112.07045,Ahmad Hassanat,"Ahmad B. Hassanat, Ghada A. Altarawneh, and Ahmad S. Tarawneh, David
  Carfi, Abdullah Almuhaimeed",Fuzzy Win-Win: A Novel Approach to Quantify Win-Win Using Fuzzy Logic,"25 pages, 5 figures","Mathematics, 10, 2022, 884",10.3390/math10060884,,cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The classic win-win has a key flaw in that it cannot offer the parties the
right amounts of winning because each party believes they are winners. In
reality, one party may win more than the other. This strategy is not limited to
a single product or negotiation; it may be applied to a variety of situations
in life. We present a novel way to measure the win-win situation in this paper.
The proposed method employs Fuzzy logic to create a mathematical model that
aids negotiators in quantifying their winning percentages. The model is put to
the test on real-life negotiations scenarios such as the Iraqi-Jordanian oil
deal, and the iron ore negotiation (2005-2009). The presented model has shown
to be a useful tool in practice and can be easily generalized to be utilized in
other domains as well.
","[{'version': 'v1', 'created': 'Mon, 13 Dec 2021 22:17:43 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Feb 2022 13:25:50 GMT'}]",2022-03-18,"[['Hassanat', 'Ahmad B.', ''], ['Altarawneh', 'Ghada A.', ''], ['Tarawneh', 'Ahmad S.', ''], ['Carfi', 'David', ''], ['Almuhaimeed', 'Abdullah', '']]","['Fuzzy logic', 'Economics', 'Win-win situation', 'Win-win negotiations']"
11271,2204.08593,Eng Lieh Ouh,"Eng Lieh Ouh, Benjamin Kok Siew Gan, David Lo","ITSS: Interactive Web-Based Authoring and Playback Integrated
  Environment for Programming Tutorials",,,10.1145/3510456.3514142,,cs.SE cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Video-based programming tutorials are a popular form of tutorial used by
authors to guide learners to code. Still, the interactivity of these videos is
limited primarily to control video flow. There are existing works with
increased interactivity that are shown to improve the learning experience.
Still, these solutions require setting up a custom recording environment and
are not well-integrated with the playback environment. This paper describes our
integrated ITSS environment and evaluates the ease of authoring and playback of
our interactive programming tutorials. Our environment is designed to run
within the browser sandbox and is less intrusive to record interactivity
actions. We develop a recording approach that tracks the author's interactivity
actions (e.g., typing code, highlighting words, scrolling panels) on the
browser and stored in text and audio formats. We replay these actions using the
recorded artefacts for learners to have a more interactive, integrated and
realistic playback of the author's actions instead of watching video frames.
Our design goals are 1) efficient recording and playback, 2) extensible
interactivity features to help students learn better, and 3) a scalable
web-based environment. Our first user study of 20 participants who carry out
the author tasks agree that it is efficient and easy to author interactive
videos in our environment with no additional software needed. Our second user
study of 84 students using the environment agrees that the increased
interactivity can help them learn better over a video-based tutorial. Our
performance test shows that the environment can scale to support up to 500
concurrent users. We hope our open-source environment enable more educators to
create interactive programming tutorials.
","[{'version': 'v1', 'created': 'Tue, 19 Apr 2022 00:16:10 GMT'}]",2022-04-20,"[['Ouh', 'Eng Lieh', ''], ['Gan', 'Benjamin Kok Siew', ''], ['Lo', 'David', '']]","['video tutorial', 'programming', 'interactive learning', 'web-based', 'integrated environment']"
11272,2208.12807,Xuefeng Jiang,"Xuefeng Jiang, Sheng Sun, Yuwei Wang, and Min Liu","Towards Federated Learning against Noisy Labels via Local
  Self-Regularization",To appear in ACM CIKM 2022,,10.1145/3511808.3557475,,cs.LG cs.AI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Federated learning (FL) aims to learn joint knowledge from a large scale of
decentralized devices with labeled data in a privacy-preserving manner.
However, since high-quality labeled data require expensive human intelligence
and efforts, data with incorrect labels (called noisy labels) are ubiquitous in
reality, which inevitably cause performance degradation. Although a lot of
methods are proposed to directly deal with noisy labels, these methods either
require excessive computation overhead or violate the privacy protection
principle of FL. To this end, we focus on this issue in FL with the purpose of
alleviating performance degradation yielded by noisy labels meanwhile
guaranteeing data privacy. Specifically, we propose a Local Self-Regularization
method, which effectively regularizes the local training process via implicitly
hindering the model from memorizing noisy labels and explicitly narrowing the
model output discrepancy between original and augmented instances using self
distillation. Experimental results demonstrate that our proposed method can
achieve notable resistance against noisy labels in various noise levels on
three benchmark datasets. In addition, we integrate our method with existing
state-of-the-arts and achieve superior performance on the real-world dataset
Clothing1M. The code is available at https://github.com/Sprinter1999/FedLSR.
","[{'version': 'v1', 'created': 'Thu, 25 Aug 2022 04:03:12 GMT'}]",2022-08-30,"[['Jiang', 'Xuefeng', ''], ['Sun', 'Sheng', ''], ['Wang', 'Yuwei', ''], ['Liu', 'Min', '']]","['Federated learning', 'data with noisy labels', 'privacy protection']"
11273,1902.05464,Daco Harkes,"Daco Harkes (Delft University of Technology, Netherlands)","We should Stop Claiming Generality in our Domain-Specific Language
  Papers",,"The Art, Science, and Engineering of Programming, 2019, Vol. 3,
  Essays, Article 18",10.22152/programming-journal.org/2019/3/18,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our community believes that new domain-specific languages should be as
general as possible to increase their impact. However, I argue in this essay
that we should stop claiming generality for new domain-specific languages. More
general domain-specific languages induce more boilerplate code. Moreover,
domain-specific languages are co-developed with their applications in practice,
and tend to be specific for these applications. Thus, I argue we should stop
claiming generality in favor of documenting how domain-specific language based
software development is beneficial to the overall software development process.
The acceptance criteria for scientific literature should make the same shift:
accepting good domain-specific language engineering practice, instead of the
next language to rule them all.
","[{'version': 'v1', 'created': 'Thu, 14 Feb 2019 15:57:22 GMT'}]",2019-02-15,"[['Harkes', 'Daco', '', 'Delft University of Technology, Netherlands']]","['Domain-specific languages', 'domain-specific language engineering', 'scientific rhetoric']"
11274,2011.00444,Keyu Chen,"Keyu Chen, Di Zhuang, J. Morris Chang","Discriminative Adversarial Domain Generalization with Meta-learning
  based Cross-domain Validation",,"Neurocomputing Volume 467, 7 January 2022, Pages 418-426",10.1016/j.neucom.2021.09.046,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The generalization capability of machine learning models, which refers to
generalizing the knowledge for an ""unseen"" domain via learning from one or
multiple seen domain(s), is of great importance to develop and deploy machine
learning applications in the real-world conditions. Domain Generalization (DG)
techniques aim to enhance such generalization capability of machine learning
models, where the learnt feature representation and the classifier are two
crucial factors to improve generalization and make decisions. In this paper, we
propose Discriminative Adversarial Domain Generalization (DADG) with
meta-learning-based cross-domain validation. Our proposed framework contains
two main components that work synergistically to build a domain-generalized DNN
model: (i) discriminative adversarial learning, which proactively learns a
generalized feature representation on multiple ""seen"" domains, and (ii)
meta-learning based cross-domain validation, which simulates train/test domain
shift via applying meta-learning techniques in the training process. In the
experimental evaluation, a comprehensive comparison has been made among our
proposed approach and other existing approaches on three benchmark datasets.
The results shown that DADG consistently outperforms a strong baseline DeepAll,
and outperforms the other existing DG algorithms in most of the evaluation
cases.
","[{'version': 'v1', 'created': 'Sun, 1 Nov 2020 07:48:16 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Feb 2022 01:23:31 GMT'}]",2022-02-17,"[['Chen', 'Keyu', ''], ['Zhuang', 'Di', ''], ['Chang', 'J. Morris', '']]","['Convolutional neural network', 'Domain generalization', 'Discriminativeadversarial learning', 'Meta-learning']"
11275,cs/0606049,Alexandros Dimakis,"Alexandros G. Dimakis, Vinod Prabhakaran, Kannan Ramchandran",Decentralized Erasure Codes for Distributed Networked Storage,"to appear in IEEE Transactions on Information Theory, Special Issue:
  Networking and Information Theory",,10.1109/TIT.2006.874535,,cs.IT cs.NI math.IT,,"  We consider the problem of constructing an erasure code for storage over a
network when the data sources are distributed. Specifically, we assume that
there are n storage nodes with limited memory and k<n sources generating the
data. We want a data collector, who can appear anywhere in the network, to
query any k storage nodes and be able to retrieve the data. We introduce
Decentralized Erasure Codes, which are linear codes with a specific randomized
structure inspired by network coding on random bipartite graphs. We show that
decentralized erasure codes are optimally sparse, and lead to reduced
communication, storage and computation cost over random linear coding.
","[{'version': 'v1', 'created': 'Mon, 12 Jun 2006 15:35:01 GMT'}]",2016-11-15,"[['Dimakis', 'Alexandros G.', ''], ['Prabhakaran', 'Vinod', ''], ['Ramchandran', 'Kannan', '']]","['Decentralized Erasure Codes', 'Wireless Networks', 'Network Coding', 'Distributed Storage']"
11276,2204.06722,EPTCS,"Yaroslav Petrukhin (Department of Logic, University of Lodz)",Normalisation for Some Infectious Logics and Their Relatives,"In Proceedings NCL 2022, arXiv:2204.06359","EPTCS 358, 2022, pp. 12-24",10.4204/EPTCS.358.2,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  We consider certain infectious logics (Sfde, dSfde, K3w, and PWK) and several
their non-infectious modifications, including two new logics, reformulate
previously constructed natural deduction systems for them (or present such
systems from scratch for the case of new logics) in way such that the proof of
normalisation theorem becomes possible for these logics. We present such a
proof and establish the negation subformula property for the logics in
question.
","[{'version': 'v1', 'created': 'Thu, 14 Apr 2022 03:23:47 GMT'}]",2022-04-15,"[['Petrukhin', 'Yaroslav', '', 'Department of Logic, University of Lodz']]","['natural deduction', 'normalisation', 'infectious logic', 'four-valued logic', 'three-valued logic']"
11277,2201.10599,Gunnar Kudrjavets,"Gunnar Kudrjavets (University of Groningen), Aditya Kumar (Snap,
  Inc.), Nachiappan Nagappan (Microsoft Research), Ayushi Rastogi (University
  of Groningen)",The Unexplored Terrain of Compiler Warnings,"2 pages. To be published in 44nd International Conference on Software
  Engineering: Software Engineering in Practice (ICSE-SEIP '22), May 21-29,
  2022, Pittsburgh, PA, USA",,10.1145/3510457.3513057,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The authors' industry experiences suggest that compiler warnings, a
lightweight version of program analysis, are valuable early bug detection
tools. Significant costs are associated with patches and security bulletins for
issues that could have been avoided if compiler warnings were addressed. Yet,
the industry's attitude towards compiler warnings is mixed. Practices range
from silencing all compiler warnings to having a zero-tolerance policy as to
any warnings. Current published data indicates that addressing compiler
warnings early is beneficial. However, support for this value theory stems from
grey literature or is anecdotal. Additional focused research is needed to truly
assess the cost-benefit of addressing warnings.
","[{'version': 'v1', 'created': 'Tue, 25 Jan 2022 19:46:14 GMT'}]",2022-01-27,"[['Kudrjavets', 'Gunnar', '', 'University of Groningen'], ['Kumar', 'Aditya', '', 'Snap,\n  Inc.'], ['Nagappan', 'Nachiappan', '', 'Microsoft Research'], ['Rastogi', 'Ayushi', '', 'University\n  of Groningen']]","['Defect prevention', 'compiler warning', 'Clang', 'GCC', 'MSVC']"
11278,1912.13375,Jakob Maljaars,"Jakob M. Maljaars, Chris N. Richardson, Nathan Sime",LEoPart: a particle library for FEniCS,"35 pages, 13 figures",,10.1016/j.camwa.2020.04.023,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces LEoPart, an add-on for the open source finite element
software library FEniCS to seamlessly integrate Lagrangian particle
functionality with (Eulerian) mesh-based finite element (FE) approaches.
LEoPart - which is so much as to say: `Lagrangian-Eulerian on Particles' -
contains tools for efficient, accurate and scalable advection of Lagrangian
particles on arbitrary polyhedral meshes. In addition, LEoPart comes with
several projection operators for exchanging information between the scattered
particles and the mesh and \textit{vice versa}. These projection operators are
based on a variational framework, which allows extension to high-order
accuracy. In particular, by implementing a dedicated PDE-constrained
particle-mesh projection operator, LEoPart provides all the tools for
diffusion-free advection, while simultaneously achieving optimal convergence
and ensuring conservation of the projected particle quantities on the
underlying mesh. A range of numerical examples that are prototypical to passive
and active tracer methods highlight the properties and the parallel performance
of the different tools in LEoPart. Finally, future developments are identified.
The source code for LEoPart is actively maintained and available under an open
source license at https://bitbucket.org/jakob_maljaars/leopart.
","[{'version': 'v1', 'created': 'Mon, 23 Dec 2019 21:26:49 GMT'}, {'version': 'v2', 'created': 'Fri, 29 May 2020 07:37:53 GMT'}]",2020-06-01,"[['Maljaars', 'Jakob M.', ''], ['Richardson', 'Chris N.', ''], ['Sime', 'Nathan', '']]","['particle-in-cell', 'Finite Elements', 'PDE-constrained optimization', 'particle tracking', 'open-source']"
11279,2107.01596,Ashad Kabir,"Sadia Tasnuva Pritha, Rahnuma Tasnim, Muhammad Ashad Kabir, Sumaiya
  Amin, Anik Das","A Systematic Review of Mobile Apps for Child Sexual Abuse Education:
  Limitations and Design Guidelines","International Journal of Mobile Learning and Organisation, 2022",,10.1504/IJMLO.2023.10049097,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The objectives of this study are understanding the requirements of a CSA
education app, identifying the limitations of existing apps, and providing a
guideline for better app design. An electronic search across three major app
stores(Google Play, Apple, and Microsoft) is conducted and the selected apps
are rated by three independent raters. Total 191 apps are found and finally, 14
apps are selected for review based on defined inclusion and exclusion criteria.
An app rating scale for CSA education apps is devised by modifying existing
scales and used to evaluate the selected 14 apps. Our rating scale evaluates
essential features, criteria, and software quality characteristics that are
necessary for CSA education apps, and determined their effectiveness for
potential use as CSA education programs for children. The internal consistency
of the rating scale and the inter and intra-rater reliability among the raters
are also calculated. User comments from the app stores are collected and
analyzed to understand their expectations and views. After analyzing the
feasibility of reviewed apps, CSA app design considerations are proposed that
highlight game-based teaching approaches. Evaluation results showed that most
of the reviewed apps are not suitable for being used as CSA education programs.
While a few may be able to teach children and parents individually, only the
apps ""Child Abuse Prevention"" (rate 3.89 out of 5) and ""Orbit Rescue"" (rate
3.92 out of 5) could be deemed suitable for a school-based CSA education
program. However, all those apps need to be improved both their software
qualities and CSA-specific features for being considered as potential CSA
education programs. This study provides the necessary knowledge to developers
and individuals regarding essential features and software quality
characteristics for designing and developing CSA education apps.
","[{'version': 'v1', 'created': 'Sun, 4 Jul 2021 11:25:02 GMT'}]",2022-08-05,"[['Pritha', 'Sadia Tasnuva', ''], ['Tasnim', 'Rahnuma', ''], ['Kabir', 'Muhammad Ashad', ''], ['Amin', 'Sumaiya', ''], ['Das', 'Anik', '']]","['Mobile app', 'child sexual abuse', 'education', 'design considerations', 'app rating scale', 'apps review']"
11280,2203.07045,Davide Bazzanella,"Davide Bazzanella, Stefano Biasi, Mattia Mancinelli, and Lorenzo
  Pavesi","A Microring as a Reservoir Computing Node: Memory/Nonlinear Tasks and
  Effect of Input Non-ideality","11 pages, 8 figures",,10.1109/JLT.2022.3183694,,cs.ET physics.optics,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The nonlinear response of an optical microresonator is used in a time
multiplexed reservoir computing neural network. Within a virtual node approach
combined with an offline training through ridge regression, we solved linear
and nonlinear logic operations. We analyzed the nonlinearity of the
microresonator as a memory between bits and/or as a neural activation function.
This is made possible by controlling both the distance between bits subject to
the logical operation and the number of bits supplied to the ridge regression.
We show that the optical microresonator exhibits up to two bits of memory in
linear tasks and that it allows solving nonlinear tasks providing both memory
and nonlinearity. Finally, we demonstrate that the virtual node approach always
requires a comparison of the reservoir's performance with the results obtained
by applying the same training process on the input signal.
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2022 15:50:00 GMT'}]",2022-09-07,"[['Bazzanella', 'Davide', ''], ['Biasi', 'Stefano', ''], ['Mancinelli', 'Mattia', ''], ['Pavesi', 'Lorenzo', '']]","['Optical neural systems', 'Neural networks', 'Nonlinear optics', 'Integrated optics', 'Silicon microresonators']"
11281,1909.03332,Zenon Gniazdowski,Zenon Gniazdowski and Dawid Kaliszewski,On the clustering of correlated random variables,"70 pages, 32 figures","Zeszyty Naukowe WWSI, No 18, Vol. 12, 2018, pp. 45-114",10.26348/znwwsi.18.45,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, the possibility of clustering correlated random variables was
examined, both because of their mutual similarity and because of their
similarity to the principal components. The k-means algorithm and spectral
algorithms were used for clustering. For spectral methods, the similarity
matrix was both the matrix of relation established on the level of correlation
and the matrix of coefficients of determination. For four different sets of
data, different ways of measuring the disimilarity of variables were analyzed,
and the impact of the diversity of initial points on the efficiency of the
k-means algorithm was analyzed.
","[{'version': 'v1', 'created': 'Sat, 7 Sep 2019 20:27:40 GMT'}]",2019-09-10,"[['Gniazdowski', 'Zenon', ''], ['Kaliszewski', 'Dawid', '']]","['similarity of variables', 'clustering of variables', 'vertical clustering']"
11282,2007.07517,Vivek Kumar Singh Ph.D.,"Vivek Kumar Singh, Rajesh Piryani, Satya Swarup Srichandan","The Case of Significant Variations in Gold-Green and Black Open Access:
  Evidence from Indian Research Output",,Scientometrics Vol. 124 No. 01 2020,10.1007/s11192-020-03472-y,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Open Access has emerged as an important movement worldwide during the last
decade. There are several initiatives now that persuade researchers to publish
in open access journals and to archive their pre- or post-print versions of
papers in repositories. Institutions and funding agencies are also promoting
ways to make research outputs available as open access. This paper looks at
open access levels and patterns in research output from India by
computationally analyzing research publication data obtained from Web of
Science for India for the last five years (2014-2018). The corresponding data
from other connected platforms -- Unpaywall and Sci-Hub -- are also obtained
and analyzed. The results obtained show that about 24% of research output from
India, during last five years, is available in legal forms of open access as
compared to world average of about 30%. More articles are available in gold
open access as compared to green and bronze. On the contrary, more than 90% of
the research output from India is available for free download in Sci-Hub. We
also found disciplinary differentiation in open access, but surprisingly these
patterns are different for gold-green and black open access forms. Sci-Hub
appears to be complementing the legal gold-green open access for less covered
disciplines in them. The central institutional repositories in India are found
to have low volume of research papers deposited.
","[{'version': 'v1', 'created': 'Wed, 15 Jul 2020 07:31:24 GMT'}]",2020-07-16,"[['Singh', 'Vivek Kumar', ''], ['Piryani', 'Rajesh', ''], ['Srichandan', 'Satya Swarup', '']]","['Gold Open Access', 'Green Open Access', 'Open Access', 'Paywall', 'Scholarly Articles', 'Sci-Hub']"
11283,1710.01995,Qi Liao,"Qi Liao, Paolo Baracca, David Lopez-Perez, Lorenzo Galati Giordano","Resource Scheduling for Mixed Traffic Types with Scalable TTI in Dynamic
  TDD Systems","7 pages, 9 figures, GLOBECOM 2016 ET5G Workshop",,10.1109/GLOCOMW.2016.7849029,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper analyses the performance benefits of a user-centric scheduling
approach, exploiting the flexibility of both dynamic time division duplex (TDD)
and a variable transmission time interval (TTI), where the downlink to uplink
ratio and TTI duration can be adapted to the traffic load. The formulation of
the joint optimisation problem takes into consideration the individual
requirements of each single user in terms of sustainable latency and desired
throughput, thus implementing a real user-centric scheduling approach.
Moreover, the developed solution is evaluated in a scenario with mixed traffic
types, mobile broadband (MBB) and mission critical communications (MCC),
showing remarkable performance enhancement of the proposed scheme over baseline
dynamic TDD schemes with a fixed TTI in terms of both achievable throughput of
the MBB users and guaranteed latency for the MCC users.
","[{'version': 'v1', 'created': 'Mon, 11 Sep 2017 13:09:23 GMT'}]",2017-10-06,"[['Liao', 'Qi', ''], ['Baracca', 'Paolo', ''], ['Lopez-Perez', 'David', ''], ['Giordano', 'Lorenzo Galati', '']]","['5G', 'dynamic TDD', 'scalable TTI', 'user-centricscheduler', 'mixed traffic types']"
11284,2004.01573,Sina Mohammadi,"Mehrdad Noori, Sina Mohammadi, Sina Ghofrani Majelan, Ali Bahri,
  Mohammad Havaei","DFNet: Discriminative feature extraction and integration network for
  salient object detection","Accepted by Engineering Applications of Artificial Intelligence. 22
  pages, 8 figures","Engineering Applications of Artificial Intelligence, Volume 89,
  2020, 103419, ISSN 0952-1976",10.1016/j.engappai.2019.103419,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the powerful feature extraction capability of Convolutional Neural
Networks, there are still some challenges in saliency detection. In this paper,
we focus on two aspects of challenges: i) Since salient objects appear in
various sizes, using single-scale convolution would not capture the right size.
Moreover, using multi-scale convolutions without considering their importance
may confuse the model. ii) Employing multi-level features helps the model use
both local and global context. However, treating all features equally results
in information redundancy. Therefore, there needs to be a mechanism to
intelligently select which features in different levels are useful. To address
the first challenge, we propose a Multi-scale Attention Guided Module. This
module not only extracts multi-scale features effectively but also gives more
attention to more discriminative feature maps corresponding to the scale of the
salient object. To address the second challenge, we propose an Attention-based
Multi-level Integrator Module to give the model the ability to assign different
weights to multi-level feature maps. Furthermore, our Sharpening Loss function
guides our network to output saliency maps with higher certainty and less
blurry salient objects, and it has far better performance than the
Cross-entropy loss. For the first time, we adopt four different backbones to
show the generalization of our method. Experiments on five challenging datasets
prove that our method achieves the state-of-the-art performance. Our approach
is fast as well and can run at a real-time speed.
","[{'version': 'v1', 'created': 'Fri, 3 Apr 2020 13:56:41 GMT'}]",2020-04-10,"[['Noori', 'Mehrdad', ''], ['Mohammadi', 'Sina', ''], ['Majelan', 'Sina Ghofrani', ''], ['Bahri', 'Ali', ''], ['Havaei', 'Mohammad', '']]","['Salient object detection', 'Deep convolutional neural networks', 'Fully convolutional neural']"
11285,2009.11920,David Guillermo Fajardo Ortiz Dr.,"David Fajardo-Ortiz, Stefan Hornbostel, Maywa Montenegro-de-Wit, Annie
  Shattuck","Funding CRISPR: Understanding the role of government and philanthropic
  institutions in supporting academic research within the CRISPR innovation
  system","Peer review available at:
  https://publons.com/publon/10.1162/qss_a_00187/",Quantitative Science Studies (2022) 3 (2): 443-456,10.1162/qss_a_00187,,cs.DL cs.SI,http://creativecommons.org/licenses/by/4.0/,"  CRISPR/Cas has the potential to revolutionize medicine, agriculture, and
biology. Understanding the trajectory of CRISPR research, how it is influenced
and who pays for it, is an essential research policy question. We use a
combination of methods to map, via quantitative content analysis of CRISPR
papers, the research funding profile of major government agencies and
organizations philanthropic, and the networks involved in supporting key stages
of high-influence research, namely basic biological research and technological
development. The results of the content analysis show how the research
supported by the main US government agencies focus both on the study of CRISPR
as a biological phenomenon and on its technological development and use as a
biomedical research tool. US philanthropic organizations with the exception of
HHMI, tend, by contrast, to specialize in funding CRISPR as a genome editing
technology. We present a model of co-funding networks at the two most prominent
institutions for CRISPR/Cas research, the University of California and the
Harvard/MIT/Broad Institute, to illuminate how philanthropic organizations have
articulated with government agencies to co-finance the discovery and
development of CRISPR/Cas. Our results raise fundamental questions about the
role of the state and the influence of philanthropy over the trajectory of
transformative technologies.
","[{'version': 'v1', 'created': 'Thu, 24 Sep 2020 19:29:34 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Sep 2020 19:13:03 GMT'}, {'version': 'v3', 'created': 'Mon, 19 Oct 2020 21:13:32 GMT'}, {'version': 'v4', 'created': 'Tue, 1 Jun 2021 15:25:12 GMT'}, {'version': 'v5', 'created': 'Mon, 11 Apr 2022 20:09:15 GMT'}, {'version': 'v6', 'created': 'Fri, 1 Jul 2022 08:55:08 GMT'}]",2022-07-04,"[['Fajardo-Ortiz', 'David', ''], ['Hornbostel', 'Stefan', ''], ['Montenegro-de-Wit', 'Maywa', ''], ['Shattuck', 'Annie', '']]","['funding of science', 'genome editing technology', 'philanthropy', 'U.S']"
11286,2106.08298,Jason R.C. Nurse Dr,Suraj Sharma and Joseph Brennan and Jason R. C. Nurse,"StockBabble: A Conversational Financial Agent to support Stock Market
  Investors",CUI 2021 - 3rd Conference on Conversational User Interfaces,,10.1145/3469595.3469620,,cs.HC cs.AI cs.CL cs.CY,http://creativecommons.org/licenses/by/4.0/,"  We introduce StockBabble, a conversational agent designed to support
understanding and engagement with the stock market. StockBabble's value and
novelty is in its ability to empower retail investors -- many of which may be
new to investing -- and supplement their informational needs using a
user-friendly agent. Users have the ability to query information on companies
to retrieve a general and financial overview of a stock, including accessing
the latest news and trading recommendations. They can also request charts which
contain live prices and technical investment indicators, and add shares to a
personal portfolio to allow performance monitoring over time. To evaluate our
agent's potential, we conducted a user study with 15 participants. In total,
73% (11/15) of respondents said that they felt more confident in investing
after using StockBabble, and all 15 would consider recommending it to others.
These results are encouraging and suggest a wider appeal for such agents.
Moreover, we believe this research can help to inform the design and
development of future intelligent, financial personal assistants.
","[{'version': 'v1', 'created': 'Tue, 15 Jun 2021 17:19:30 GMT'}]",2021-06-16,"[['Sharma', 'Suraj', ''], ['Brennan', 'Joseph', ''], ['Nurse', 'Jason R. C.', '']]","['Chatbot', 'conversational agent', 'stock market', 'trading', 'finance', 'investment', 'FinBot']"
11287,2208.10949,Guangyi Zhang,Guangyi Zhang and Aristides Gionis,"Regularized impurity reduction: Accurate decision trees with complexity
  guarantees",,Data Mining and Knowledge Discovery (2022),10.1007/s10618-022-00884-7,,cs.LG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Decision trees are popular classification models, providing high accuracy and
intuitive explanations. However, as the tree size grows the model
interpretability deteriorates. Traditional tree-induction algorithms, such as
C4.5 and CART, rely on impurity-reduction functions that promote the
discriminative power of each split. Thus, although these traditional methods
are accurate in practice, there has been no theoretical guarantee that they
will produce small trees. In this paper, we justify the use of a general family
of impurity functions, including the popular functions of entropy and
Gini-index, in scenarios where small trees are desirable, by showing that a
simple enhancement can equip them with complexity guarantees. We consider a
general setting, where objects to be classified are drawn from an arbitrary
probability distribution, classification can be binary or multi-class, and
splitting tests are associated with non-uniform costs. As a measure of tree
complexity, we adopt the expected cost to classify an object drawn from the
input distribution, which, in the uniform-cost case, is the expected number of
tests. We propose a tree-induction algorithm that gives a logarithmic
approximation guarantee on the tree complexity. This approximation factor is
tight up to a constant factor under mild assumptions. The algorithm recursively
selects a test that maximizes a greedy criterion defined as a weighted sum of
three components. The first two components encourage the selection of tests
that improve the balance and the cost-efficiency of the tree, respectively,
while the third impurity-reduction component encourages the selection of more
discriminative tests. As shown in our empirical evaluation, compared to the
original heuristics, the enhanced algorithms strike an excellent balance
between predictive accuracy and tree complexity.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2022 13:15:19 GMT'}]",2022-11-29,"[['Zhang', 'Guangyi', ''], ['Gionis', 'Aristides', '']]","['Decision trees', 'Impurity functions', 'Submodularity', 'Treecomplexity', 'Approximation algorithms']"
11288,2009.11368,Peter Turney,Peter D. Turney,Evolution of Autopoiesis and Multicellularity in the Game of Life,,"Artificial Life, 27(1), 26-43 (2021)",10.1162/artl_a_00334,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently we introduced a model of symbiosis, Model-S, based on the evolution
of seed patterns in Conway's Game of Life. In the model, the fitness of a seed
pattern is measured by one-on-one competitions in the Immigration Game, a
two-player variation of the Game of Life. Our previous article showed that
Model-S can serve as a highly abstract, simplified model of biological life:
(1) The initial seed pattern is analogous to a genome. (2) The changes as the
game runs are analogous to the development of the phenome. (3) Tournament
selection in Model-S is analogous to natural selection in biology. (4) The
Immigration Game in Model-S is analogous to competition in biology. (5) The
first three layers in Model-S are analogous to biological reproduction. (6) The
fusion of seed patterns in Model-S is analogous to symbiosis. The current
article takes this analogy two steps further: (7) Autopoietic structures in the
Game of Life (still lifes, oscillators, and spaceships -- collectively known as
ashes) are analogous to cells in biology. (8) The seed patterns in the Game of
Life give rise to multiple, diverse, cooperating autopoietic structures,
analogous to multicellular biological life. We use the apgsearch software (Ash
Pattern Generator Search), developed by Adam Goucher for the study of ashes, to
analyze autopoiesis and multicellularity in Model-S. We find that the fitness
of evolved seed patterns in Model-S is highly correlated with the diversity and
quantity of multicellular autopoietic structures.
","[{'version': 'v1', 'created': 'Wed, 23 Sep 2020 20:26:28 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Jan 2021 19:23:58 GMT'}]",2021-06-11,"[['Turney', 'Peter D.', '']]","['Evolution', 'autopoiesis', 'multicellularity', 'cellular automata', 'diversity', 'symbiosis']"
11289,2007.04868,Filippo Mantovani,"Filippo Mantovani, Marta Garcia-Gasulla, Jos\'e Gracia, Esteban
  Stafford, Fabio Banchelli, Marc Josep-Fabrego, Joel Criado-Ledesma, Mathias
  Nachtmann","Performance and energy consumption of HPC workloads on a cluster based
  on Arm ThunderX2 CPU",,"Future Generation Computer Systems, 2020",10.1016/j.future.2020.06.033,,cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we analyze the performance and energy consumption of an
Arm-based high-performance computing (HPC) system developed within the European
project Mont-Blanc 3. This system, called Dibona, has been integrated by
ATOS/Bull, and it is powered by the latest Marvell's CPU, ThunderX2. This CPU
is the same one that powers the Astra supercomputer, the first Arm-based
supercomputer entering the Top500 in November 2018. We study from
micro-benchmarks up to large production codes. We include an interdisciplinary
evaluation of three scientific applications (a finite-element fluid dynamics
code, a smoothed particle hydrodynamics code, and a lattice Boltzmann code) and
the Graph 500 benchmark, focusing on parallel and energy efficiency as well as
studying their scalability up to thousands of Armv8 cores. For comparison, we
run the same tests on state-of-the-art x86 nodes included in Dibona and the
Tier-0 supercomputer MareNostrum4. Our experiments show that the ThunderX2 has
a 25% lower performance on average, mainly due to its small vector unit yet
somewhat compensated by its 30% wider links between the CPU and the main
memory. We found that the software ecosystem of the Armv8 architecture is
comparable to the one available for Intel. Our results also show that ThunderX2
delivers similar or better energy-to-solution and scalability, proving that
Arm-based chips are legitimate contenders in the market of next-generation HPC
systems.
","[{'version': 'v1', 'created': 'Thu, 9 Jul 2020 15:12:51 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Jul 2020 05:44:13 GMT'}]",2020-07-13,"[['Mantovani', 'Filippo', ''], ['Garcia-Gasulla', 'Marta', ''], ['Gracia', 'José', ''], ['Stafford', 'Esteban', ''], ['Banchelli', 'Fabio', ''], ['Josep-Fabrego', 'Marc', ''], ['Criado-Ledesma', 'Joel', ''], ['Nachtmann', 'Mathias', '']]","['HPC Applications', 'CFD', 'Benchmarks', 'ThunderX2', 'Scalability', 'Energy']"
11290,1802.04580,Martin Shepperd,Martin Shepperd,Replication studies considered harmful,4 pages,,10.1145/3183399.3183423,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CONTEXT: There is growing interest in establishing software engineering as an
evidence-based discipline. To that end, replication is often used to gain
confidence in empirical findings, as opposed to reproduction where the goal is
showing the correctness, or validity of the published results. OBJECTIVE: To
consider what is required for a replication study to confirm the original
experiment and apply this understanding in software engineering. METHOD:
Simulation is used to demonstrate why the prediction interval for confirmation
can be surprisingly wide. This analysis is applied to three recent
replications. RESULTS: It is shown that because the prediction intervals are
wide, almost all replications are confirmatory, so in that sense there is no
'replication crisis', however, the contributions to knowledge are negligible.
CONCLUSIONS: Replicating empirical software engineering experiments,
particularly if they are under-powered or under-reported, is a waste of
scientific resources. By contrast, meta-analysis is strongly advocated so that
all relevant experiments are combined to estimate the population effect.
","[{'version': 'v1', 'created': 'Tue, 13 Feb 2018 12:12:09 GMT'}]",2018-02-14,"[['Shepperd', 'Martin', '']]","['Software engineering', 'empirical study', 'replication', 'evidence']"
11291,2108.13389,Omkar Phadke,"Omkar Phadke, Jayatika Sakhuja, Vivek Saraswat, Udayan Ganguly","Exploiting the Electrothermal Timescale in PrMnO3 RRAM for a compact,
  clock-less neuron exhibiting biological spiking patterns",,,10.1088/1361-6641/ac24e8,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spiking Neural Networks (SNNs) are gaining widespread momentum in the field
of neuromorphic computing. These network systems integrated with neurons and
synapses provide computational efficiency by mimicking the human brain. It is
desired to incorporate the biological neuronal dynamics, including complex
spiking patterns which represent diverse brain activities within the neural
networks. Earlier hardware realization of neurons was (1) area intensive
because of large capacitors in the circuit design, (2) neuronal spiking
patterns were demonstrated with clocked neurons at the device level. To achieve
more realistic biological neuron spiking behavior, emerging memristive devices
are considered promising alternatives. In this paper, we propose, PrMnO3(PMO)
-RRAM device-based neuron. The voltage-controlled electrothermal timescales of
the compact PMO RRAM device replace the electrical timescales of charging a
large capacitor. The electrothermal timescale is used to implement an
integration block with multiple voltage-controlled timescales coupled with a
refractory block to generate biological neuronal dynamics. Here, first, a
Verilog-A implementation of the thermal device model is demonstrated, which
captures the current-temperature dynamics of the PMO device. Second, a driving
circuitry is designed to mimic different spiking patterns of cortical neurons,
including Intrinsic bursting (IB) and Chattering (CH). Third, a neuron circuit
model is simulated, which includes the PMO RRAM device model and the driving
circuitry to demonstrate the asynchronous neuron behavior. Finally, a
hardware-software hybrid analysis is done in which the PMO RRAM device is
experimentally characterized to mimic neuron spiking dynamics. The work
presents a realizable and more biologically comparable hardware-efficient
solution for large-scale SNNs.
","[{'version': 'v1', 'created': 'Mon, 30 Aug 2021 17:17:44 GMT'}]",2021-10-27,"[['Phadke', 'Omkar', ''], ['Sakhuja', 'Jayatika', ''], ['Saraswat', 'Vivek', ''], ['Ganguly', 'Udayan', '']]","['PrMnO3 (PMO)', 'RRAM', 'Neuron Spiking Patterns', 'Spiking Neural Network (SNN)']"
11292,1905.09217,Zhuyun Dai,Zhuyun Dai and Jamie Callan,"Deeper Text Understanding for IR with Contextual Neural Language
  Modeling",In proceedings of SIGIR 2019,,10.1145/3331184.3331303,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural networks provide new possibilities to automatically learn complex
language patterns and query-document relations. Neural IR models have achieved
promising results in learning query-document relevance patterns, but few
explorations have been done on understanding the text content of a query or a
document. This paper studies leveraging a recently-proposed contextual neural
language model, BERT, to provide deeper text understanding for IR. Experimental
results demonstrate that the contextual text representations from BERT are more
effective than traditional word embeddings. Compared to bag-of-words retrieval
models, the contextual language model can better leverage language structures,
bringing large improvements on queries written in natural languages. Combining
the text understanding ability with search knowledge leads to an enhanced
pre-trained BERT model that can benefit related search tasks where training
data are limited.
","[{'version': 'v1', 'created': 'Wed, 22 May 2019 16:11:47 GMT'}]",2019-05-23,"[['Dai', 'Zhuyun', ''], ['Callan', 'Jamie', '']]","['Neural-IR', 'Text Understanding', 'Neural Language Models']"
11293,1909.11022,Claudio Gallicchio,"Claudio Gallicchio, Alessio Micheli",Reservoir Topology in Deep Echo State Networks,Preprint of the paper published in the proceedings of ICANN 2019,,10.1007/978-3-030-30493-5_6,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep Echo State Networks (DeepESNs) recently extended the applicability of
Reservoir Computing (RC) methods towards the field of deep learning. In this
paper we study the impact of constrained reservoir topologies in the
architectural design of deep reservoirs, through numerical experiments on
several RC benchmarks. The major outcome of our investigation is to show the
remarkable effect, in terms of predictive performance gain, achieved by the
synergy between a deep reservoir construction and a structured organization of
the recurrent units in each layer. Our results also indicate that a
particularly advantageous architectural setting is obtained in correspondence
of DeepESNs where reservoir units are structured according to a permutation
recurrent matrix.
","[{'version': 'v1', 'created': 'Tue, 24 Sep 2019 16:15:16 GMT'}]",2019-09-25,"[['Gallicchio', 'Claudio', ''], ['Micheli', 'Alessio', '']]","['Deep Echo State Networks', 'Deep Reservoir Computing', 'Reservoir Topology']"
11294,2112.06833,Peter Henderson,"Peter Henderson, Ben Chugg, Brandon Anderson, Daniel E. Ho","Beyond Ads: Sequential Decision-Making Algorithms in Law and Public
  Policy","Version 1 presented at Causal Inference Challenges in Sequential
  Decision Making: Bridging Theory and Practice (2021), a NeurIPS 2021
  Workshop; Version 2 presented at the 2nd ACM Symposium on Computer Science
  and Law (2022) (DOI: https://dl.acm.org/doi/10.1145/3511265.3550439)",,10.1145/3511265.3550439,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore the promises and challenges of employing sequential
decision-making algorithms -- such as bandits, reinforcement learning, and
active learning -- in law and public policy. While such algorithms have
well-characterized performance in the private sector (e.g., online
advertising), the tendency to naively apply algorithms motivated by one domain,
often online advertisements, can be called the ""advertisement fallacy."" Our
main thesis is that law and public policy pose distinct methodological
challenges that the machine learning community has not yet addressed. Machine
learning will need to address these methodological problems to move ""beyond
ads."" Public law, for instance, can pose multiple objectives, necessitate
batched and delayed feedback, and require systems to learn rational, causal
decision-making policies, each of which presents novel questions at the
research frontier. We discuss a wide range of potential applications of
sequential decision-making algorithms in regulation and governance, including
public health, environmental protection, tax administration, occupational
safety, and benefits adjudication. We use these examples to highlight research
needed to render sequential decision making policy-compliant, adaptable, and
effective in the public sector. We also note the potential risks of such
deployments and describe how sequential decision systems can also facilitate
the discovery of harms. We hope our work inspires more investigation of
sequential decision making in law and public policy, which provide unique
challenges for machine learning researchers with potential for significant
social benefit.
","[{'version': 'v1', 'created': 'Mon, 13 Dec 2021 17:45:21 GMT'}, {'version': 'v2', 'created': 'Tue, 3 May 2022 17:19:06 GMT'}, {'version': 'v3', 'created': 'Tue, 29 Nov 2022 08:45:50 GMT'}]",2022-11-30,"[['Henderson', 'Peter', ''], ['Chugg', 'Ben', ''], ['Anderson', 'Brandon', ''], ['Ho', 'Daniel E.', '']]","['Sequential Decision-making', 'Reinforcement Learning', 'Bandits', 'Active Learning', 'AI and Society', 'Law and AI', 'Responsible AI']"
11295,2007.06706,Boyang Lyu,"Boyang Lyu, Thao Pham, Giles Blaney, Zachary Haga, Angelo Sassaroli,
  Sergio Fantini, Shuchin Aeron","Domain Adaptation for Robust Workload Level Alignment Between Sessions
  and Subjects using fNIRS",,,10.1117/1.JBO.26.2.022908,,cs.CV cs.LG q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Significance: We demonstrated the potential of using domain adaptation on
functional Near-Infrared Spectroscopy (fNIRS) data to classify different levels
of n-back tasks that involve working memory. Aim: Domain shift in fNIRS data is
a challenge in the workload level alignment across different experiment
sessions and subjects. In order to address this problem, two domain adaptation
approaches -- Gromov-Wasserstein (G-W) and Fused Gromov-Wasserstein (FG-W) were
used. Approach: Specifically, we used labeled data from one session or one
subject to classify trials in another session (within the same subject) or
another subject. We applied G-W for session-by-session alignment and FG-W for
subject-by-subject alignment to fNIRS data acquired during different n-back
task levels. We compared these approaches with three supervised methods:
multi-class Support Vector Machine (SVM), Convolutional Neural Network (CNN),
and Recurrent Neural Network (RNN). Results: In a sample of six subjects, G-W
resulted in an alignment accuracy of 68 $\pm$ 4 % (weighted mean $\pm$ standard
error) for session-by-session alignment, FG-W resulted in an alignment accuracy
of 55 $\pm$ 2 % for subject-by-subject alignment. In each of these cases, 25 %
accuracy represents chance. Alignment accuracy results from both G-W and FG-W
are significantly greater than those from SVM, CNN and RNN. We also showed that
removal of motion artifacts from the fNIRS data plays an important role in
improving alignment performance. Conclusions: Domain adaptation has potential
for session-by-session and subject-by-subject alignment of mental workload by
using fNIRS data.
","[{'version': 'v1', 'created': 'Thu, 2 Jul 2020 18:03:50 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Nov 2020 01:52:13 GMT'}]",2021-04-14,"[['Lyu', 'Boyang', ''], ['Pham', 'Thao', ''], ['Blaney', 'Giles', ''], ['Haga', 'Zachary', ''], ['Sassaroli', 'Angelo', ''], ['Fantini', 'Sergio', ''], ['Aeron', 'Shuchin', '']]","['fNIRS', 'n-back task', 'machine learning', 'Gromov-Wasserstein (G-W)', 'Fused Gromov-Wasserstein (FG-W)', 'Transient Artifact Reduction Algorithm (TARA)']"
11296,1905.08031,Farzad Eskandanian,"Farzad Eskandanian, Nasim Sonboli, Bamshad Mobasher","Power of the Few: Analyzing the Impact of Influential Users in
  Collaborative Recommender Systems",,,10.1145/3320435.3320464,,cs.SI cs.IR cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Like other social systems, in collaborative filtering a small number of
""influential"" users may have a large impact on the recommendations of other
users, thus affecting the overall behavior of the system. Identifying
influential users and studying their impact on other users is an important
problem because it provides insight into how small groups can inadvertently or
intentionally affect the behavior of the system as a whole. Modeling these
influences can also shed light on patterns and relationships that would
otherwise be difficult to discern, hopefully leading to more transparency in
how the system generates personalized content. In this work we first formalize
the notion of ""influence"" in collaborative filtering using an Influence
Discrimination Model. We then empirically identify and characterize influential
users and analyze their impact on the system under different underlying
recommendation algorithms and across three different recommendation domains:
job, movie and book recommendations. Insights from these experiments can help
in designing systems that are not only optimized for accuracy, but are also
tuned to mitigate the impact of influential users when it might lead to
potential imbalance or unfairness in the system's outcomes.
","[{'version': 'v1', 'created': 'Tue, 14 May 2019 19:57:06 GMT'}]",2019-05-21,"[['Eskandanian', 'Farzad', ''], ['Sonboli', 'Nasim', ''], ['Mobasher', 'Bamshad', '']]","['Recommender Systems', 'Collaborative Filtering', 'Matrix Factorization', 'Influential Users']"
11297,2207.04093,Akanksha Gupta,Akanksha Gupta,An Integrated Framework for DevSecOps Adoption,,"International Journal of Computer Trends and Technology Volume 70
  Issue 6, 19-23, June 2022. ISSN: 2231-2803",10.14445/22312803/IJCTT-V70I6P102,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Introduction of DevOps into the software development life cycle represents a
cultural shift in the IT culture, amalgamating development and operations to
improve delivery speed in a rapid and maintainable manner. At the same time,
security threats and breaches are expected to grow as more enterprises move to
new agile frameworks for rapid product delivery. Meanwhile, DevSecOps is a
mindset change that revolutionizes software development by embedding security
at each step of the software cycle, leading to resilient software. This paper
discusses a framework organization can use to embed DevSecOps swiftly and
efficiently into the general IT culture.
","[{'version': 'v1', 'created': 'Thu, 7 Jul 2022 17:23:59 GMT'}]",2022-07-12,"[['Gupta', 'Akanksha', '']]","['Agile framework', 'Continuous Deployment', 'DevOps', 'Mean time to Acknowledge (MTTA)', 'Mean time to Resolution(MTTR)']"
11298,1905.07689,Zhiqing Sun,"Zhiqing Sun, Jian Tang, Pan Du, Zhi-Hong Deng, Jian-Yun Nie","DivGraphPointer: A Graph Pointer Network for Extracting Diverse
  Keyphrases",Accepted to SIGIR 2019,,10.1145/3331184.3331219,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Keyphrase extraction from documents is useful to a variety of applications
such as information retrieval and document summarization. This paper presents
an end-to-end method called DivGraphPointer for extracting a set of diversified
keyphrases from a document. DivGraphPointer combines the advantages of
traditional graph-based ranking methods and recent neural network-based
approaches. Specifically, given a document, a word graph is constructed from
the document based on word proximity and is encoded with graph convolutional
networks, which effectively capture document-level word salience by modeling
long-range dependency between words in the document and aggregating multiple
appearances of identical words into one node. Furthermore, we propose a
diversified point network to generate a set of diverse keyphrases out of the
word graph in the decoding process. Experimental results on five benchmark data
sets show that our proposed method significantly outperforms the existing
state-of-the-art approaches.
","[{'version': 'v1', 'created': 'Sun, 19 May 2019 05:17:12 GMT'}]",2019-05-21,"[['Sun', 'Zhiqing', ''], ['Tang', 'Jian', ''], ['Du', 'Pan', ''], ['Deng', 'Zhi-Hong', ''], ['Nie', 'Jian-Yun', '']]","['graph neural networks', 'keyphrase extraction', 'diversified pointernetwork', 'document-level word salience']"
11299,2010.11490,Christophe Cerisara,"Christophe Cerisara (SYNALP), Pavel Kral, Ladislav Lenc","On the Effects of Using word2vec Representations in Neural Networks for
  Dialogue Act Recognition",,"Computer Speech and Language, Elsevier, 2018, 47, pp.175 - 193",10.1016/j.csl.2017.07.009,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dialogue act recognition is an important component of a large number of
natural language processing pipelines. Many research works have been carried
out in this area, but relatively few investigate deep neural networks and word
embeddings. This is surprising, given that both of these techniques have proven
exceptionally good in most other language-related domains. We propose in this
work a new deep neural network that explores recurrent models to capture word
sequences within sentences, and further study the impact of pretrained word
embeddings. We validate this model on three languages: English, French and
Czech. The performance of the proposed approach is consistent across these
languages and it is comparable to the state-of-the-art results in English. More
importantly, we confirm that deep neural networks indeed outperform a Maximum
Entropy classifier, which was expected. However , and this is more surprising,
we also found that standard word2vec em-beddings do not seem to bring valuable
information for this task and the proposed model, whatever the size of the
training corpus is. We thus further analyse the resulting embeddings and
conclude that a possible explanation may be related to the mismatch between the
type of lexical-semantic information captured by the word2vec embeddings, and
the kind of relations between words that is the most useful for the dialogue
act recognition task.
","[{'version': 'v1', 'created': 'Thu, 22 Oct 2020 07:21:17 GMT'}]",2020-10-23,"[['Cerisara', 'Christophe', '', 'SYNALP'], ['Kral', 'Pavel', ''], ['Lenc', 'Ladislav', '']]","['dialogue act', 'deep learning', 'LSTM', 'word embeddings', 'word2vec']"
11300,2205.11139,Xu Chen,"Xu Chen, Qiu Qiu, Changshan Li, Kunqing Xie","GraphAD: A Graph Neural Network for Entity-Wise Multivariate Time-Series
  Anomaly Detection",SIGIR'22 Short Paper,,10.1145/3477495.3531848,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, the emergence and development of third-party platforms have
greatly facilitated the growth of the Online to Offline (O2O) business.
However, the large amount of transaction data raises new challenges for
retailers, especially anomaly detection in operating conditions. Thus,
platforms begin to develop intelligent business assistants with embedded
anomaly detection methods to reduce the management burden on retailers.
Traditional time-series anomaly detection methods capture underlying patterns
from the perspectives of time and attributes, ignoring the difference between
retailers in this scenario. Besides, similar transaction patterns extracted by
the platforms can also provide guidance to individual retailers and enrich
their available information without privacy issues. In this paper, we pose an
entity-wise multivariate time-series anomaly detection problem that considers
the time-series of each unique entity. To address this challenge, we propose
GraphAD, a novel multivariate time-series anomaly detection model based on the
graph neural network. GraphAD decomposes the Key Performance Indicator (KPI)
into stable and volatility components and extracts their patterns in terms of
attributes, entities and temporal perspectives via graph neural networks. We
also construct a real-world entity-wise multivariate time-series dataset from
the business data of Ele.me. The experimental results on this dataset show that
GraphAD significantly outperforms existing anomaly detection methods.
","[{'version': 'v1', 'created': 'Mon, 23 May 2022 08:59:42 GMT'}]",2022-05-24,"[['Chen', 'Xu', ''], ['Qiu', 'Qiu', ''], ['Li', 'Changshan', ''], ['Xie', 'Kunqing', '']]","['graph neural networks', 'anomaly detection', 'time-series', 'O2O business']"
11301,2207.07340,Yuxi Mi,"Yuxi Mi, Yuge Huang, Jiazhen Ji, Hongquan Liu, Xingkun Xu, Shouhong
  Ding, Shuigeng Zhou","DuetFace: Collaborative Privacy-Preserving Face Recognition via Channel
  Splitting in the Frequency Domain",Accepted to ACM Multimedia 2022,,10.1145/3503161.3548303,,cs.CV cs.AI cs.CR,http://creativecommons.org/licenses/by/4.0/,"  With the wide application of face recognition systems, there is rising
concern that original face images could be exposed to malicious intents and
consequently cause personal privacy breaches. This paper presents DuetFace, a
novel privacy-preserving face recognition method that employs collaborative
inference in the frequency domain. Starting from a counterintuitive discovery
that face recognition can achieve surprisingly good performance with only
visually indistinguishable high-frequency channels, this method designs a
credible split of frequency channels by their cruciality for visualization and
operates the server-side model on non-crucial channels. However, the model
degrades in its attention to facial features due to the missing visual
information. To compensate, the method introduces a plug-in interactive block
to allow attention transfer from the client-side by producing a feature mask.
The mask is further refined by deriving and overlaying a facial region of
interest (ROI). Extensive experiments on multiple datasets validate the
effectiveness of the proposed method in protecting face images from undesired
visual inspection, reconstruction, and identification while maintaining high
task availability and performance. Results show that the proposed method
achieves a comparable recognition accuracy and computation cost to the
unprotected ArcFace and outperforms the state-of-the-art privacy-preserving
methods. The source code is available at
https://github.com/Tencent/TFace/tree/master/recognition/tasks/duetface.
","[{'version': 'v1', 'created': 'Fri, 15 Jul 2022 08:35:44 GMT'}]",2022-07-18,"[['Mi', 'Yuxi', ''], ['Huang', 'Yuge', ''], ['Ji', 'Jiazhen', ''], ['Liu', 'Hongquan', ''], ['Xu', 'Xingkun', ''], ['Ding', 'Shouhong', ''], ['Zhou', 'Shuigeng', '']]","['face recognition', 'data privacy', 'deep learning', 'channel splitting']"
11302,1912.09237,Carola Doerr,"Carola Doerr and Furong Ye and Naama Horesh and Hao Wang and Ofer M.
  Shir and Thomas B\""ack",Benchmarking Discrete Optimization Heuristics with IOHprofiler,,"Applied Soft Computing. Volume 88, March 2020, 106027",10.1016/j.asoc.2019.106027,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated benchmarking environments aim to support researchers in
understanding how different algorithms perform on different types of
optimization problems. Such comparisons provide insights into the strengths and
weaknesses of different approaches, which can be leveraged into designing new
algorithms and into the automation of algorithm selection and configuration.
With the ultimate goal to create a meaningful benchmark set for iterative
optimization heuristics, we have recently released IOHprofiler, a software
built to create detailed performance comparisons between iterative optimization
heuristics.
  With this present work we demonstrate that IOHprofiler provides a suitable
environment for automated benchmarking. We compile and assess a selection of 23
discrete optimization problems that subscribe to different types of fitness
landscapes. For each selected problem we compare performances of twelve
different heuristics, which are as of now available as baseline algorithms in
IOHprofiler.
  We also provide a new module for IOHprofiler which extents the fixed-target
and fixed-budget results for the individual problems by ECDF results, which
allows one to derive aggregated performance statistics for groups of problems.
","[{'version': 'v1', 'created': 'Thu, 19 Dec 2019 14:53:39 GMT'}, {'version': 'v2', 'created': 'Sun, 31 Jan 2021 14:55:29 GMT'}]",2021-02-02,"[['Doerr', 'Carola', ''], ['Ye', 'Furong', ''], ['Horesh', 'Naama', ''], ['Wang', 'Hao', ''], ['Shir', 'Ofer M.', ''], ['Bäck', 'Thomas', '']]","['combinatorial optimization', 'black-box optimization', 'randomized search heuristics', 'benchmarking', 'evolutionary computation']"
11303,2204.07485,Ravil Mussabayev,"Rustam Mussabayev, Nenad Mladenovic, Ravil Mussabayev, Bassem Jarboui",Big-means: Less is More for K-means Clustering,,,10.1016/j.patcog.2022.109269,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  K-means clustering plays a vital role in data mining. However, its
performance drastically drops when applied to huge amounts of data. We propose
a new heuristic that is built on the basis of regular K-means for faster and
more accurate big data clustering using the ""less is more"" and decomposition
approaches. The main advantage of the proposed algorithm is that it naturally
turns the K-means local search into global one through the process of
decomposition of the minimum sum-of-squares clustering (MSSC) problem. On one
hand, decomposition of the MSSC problem into smaller subproblems reduces the
computational complexity and allows for their parallel processing. On the other
hand, the MSSC decomposition provides a new method for the natural data-driven
shaking of the incumbent solution while introducing a new neighborhood
structure for the solution of the MSSC problem. The proposed algorithm is
scalable, fast, and accurate. The scalability of the algorithm can be easily
adjusted by choosing the appropriate number of subproblems and their size. In
our experiments it outperforms all recent state-of-the-art algorithms for the
MSSC in both in time and the solution quality.
","[{'version': 'v1', 'created': 'Thu, 14 Apr 2022 08:18:01 GMT'}, {'version': 'v2', 'created': 'Fri, 27 May 2022 06:09:03 GMT'}]",2023-01-16,"[['Mussabayev', 'Rustam', ''], ['Mladenovic', 'Nenad', ''], ['Mussabayev', 'Ravil', ''], ['Jarboui', 'Bassem', '']]","['big data', 'clustering', 'K-means', 'K-means++', '“less is more” approach', 'LIMA', 'minimum']"
11304,2301.00072,Shaobo Li,"Jinghan Sun, Shaobo Li, Yunxin Sun, Chao Sun, Dejan Vucinic, and Jian
  Huang",LeaFTL: A Learning-Based Flash Translation Layer for Solid-State Drives,"This paper is accepted at the 28th Conference on Architectural
  Support for Programming Languages and Operating Systems (ASPLOS 2023)",,10.1145/3575693.3575744,,cs.OS,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In modern solid-state drives (SSDs), the indexing of flash pages is a
critical component in their storage controllers. It not only affects the data
access performance, but also determines the efficiency of the precious
in-device DRAM resource. A variety of address mapping schemes and optimization
techniques have been proposed. However, most of them were developed with
human-driven heuristics. They cannot automatically capture diverse data access
patterns at runtime in SSD controllers, which leaves a large room for
improvement. In this paper, we present a learning-based flash translation layer
(FTL), named LeaFTL, which learns the address mapping to tolerate dynamic data
access patterns via linear regression at runtime. By grouping a large set of
mapping entries into a learned segment, it significantly reduces the memory
footprint of the address mapping table, which further benefits the data caching
in SSD controllers. LeaFTL also employs various optimization techniques,
including out-of-band metadata verification to tolerate mispredictions,
optimized flash allocation, and dynamic compaction of learned index segments.
We implement LeaFTL with an SSD simulator and evaluate it with various storage
workloads. LeaFTL saves the memory consumption of the mapping table by 2.9x on
average and improves the storage performance by 1.4x on average, in comparison
with state-of-the-art FTL schemes.
","[{'version': 'v1', 'created': 'Fri, 30 Dec 2022 23:37:39 GMT'}]",2023-01-03,"[['Sun', 'Jinghan', ''], ['Li', 'Shaobo', ''], ['Sun', 'Yunxin', ''], ['Sun', 'Chao', ''], ['Vucinic', 'Dejan', ''], ['Huang', 'Jian', '']]","['Learning-Based Storage', 'Flash Translation Layer', 'Solid-State Drive']"
11305,2212.06430,Jari Peeperkorn,Jari Peeperkorn and Seppe vanden Broucke and Jochen De Weerdt,Can recurrent neural networks learn process model structure?,,Journal of Intelligent Information Systems 2022,10.1007/s10844-022-00765-x,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Various methods using machine and deep learning have been proposed to tackle
different tasks in predictive process monitoring, forecasting for an ongoing
case e.g. the most likely next event or suffix, its remaining time, or an
outcome-related variable. Recurrent neural networks (RNNs), and more
specifically long short-term memory nets (LSTMs), stand out in terms of
popularity. In this work, we investigate the capabilities of such an LSTM to
actually learn the underlying process model structure of an event log. We
introduce an evaluation framework that combines variant-based resampling and
custom metrics for fitness, precision and generalization. We evaluate 4
hypotheses concerning the learning capabilities of LSTMs, the effect of
overfitting countermeasures, the level of incompleteness in the training set
and the level of parallelism in the underlying process model. We confirm that
LSTMs can struggle to learn process model structure, even with simplistic
process data and in a very lenient setup. Taking the correct anti-overfitting
measures can alleviate the problem. However, these measures did not present
themselves to be optimal when selecting hyperparameters purely on predicting
accuracy. We also found that decreasing the amount of information seen by the
LSTM during training, causes a sharp drop in generalization and precision
scores. In our experiments, we could not identify a relationship between the
extent of parallelism in the model and the generalization capability, but they
do indicate that the process' complexity might have impact.
","[{'version': 'v1', 'created': 'Tue, 13 Dec 2022 08:40:01 GMT'}]",2022-12-14,"[['Peeperkorn', 'Jari', ''], ['Broucke', 'Seppe vanden', ''], ['De Weerdt', 'Jochen', '']]","['Process Mining', 'Predictive Process Analytics', 'LSTM', 'Fitness', 'Precision', 'generalization']"
11306,2101.12001,Thanasis Vergoulis,"Thanasis Vergoulis, Ilias Kanellos, Claudio Atzori, Andrea Mannocci,
  Serafeim Chatzopoulos, Sandro La Bruzzo, Natalia Manola, Paolo Manghi",BIP! DB: A Dataset of Impact Measures for Scientific Publications,,WWW (Companion Volume) 2021: 456-460,10.1145/3442442.3451369,,cs.DL cs.IR,http://creativecommons.org/licenses/by/4.0/,"  The growth rate of the number of scientific publications is constantly
increasing, creating important challenges in the identification of valuable
research and in various scholarly data management applications, in general. In
this context, measures which can effectively quantify the scientific impact
could be invaluable. In this work, we present BIP! DB, an open dataset that
contains a variety of impact measures calculated for a large collection of more
than 100 million scientific publications from various disciplines.
","[{'version': 'v1', 'created': 'Thu, 28 Jan 2021 13:59:55 GMT'}, {'version': 'v2', 'created': 'Fri, 6 May 2022 13:03:19 GMT'}]",2022-05-09,"[['Vergoulis', 'Thanasis', ''], ['Kanellos', 'Ilias', ''], ['Atzori', 'Claudio', ''], ['Mannocci', 'Andrea', ''], ['Chatzopoulos', 'Serafeim', ''], ['La Bruzzo', 'Sandro', ''], ['Manola', 'Natalia', ''], ['Manghi', 'Paolo', '']]","['scientometrics', 'impact', 'research assessment']"
11307,2005.13969,Linda Erlenhov,"Linda Erlenhov, Francisco Gomes de Oliveira Neto, Philipp Leitner","An Empirical Study of Bots in Software Development -- Characteristics
  and Challenges from a Practitioner's Perspective","To be published at the ACM Joint European Software Engineering
  Conference and Symposium on the Foundations of Software Engineering
  (ESEC/FSE)",,10.1145/3368089.3409680,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software engineering bots - automated tools that handle tedious tasks - are
increasingly used by industrial and open source projects to improve developer
productivity. Current research in this area is held back by a lack of consensus
of what software engineering bots (DevBots) actually are, what characteristics
distinguish them from other tools, and what benefits and challenges are
associated with DevBot usage. In this paper we report on a mixed-method
empirical study of DevBot usage in industrial practice. We report on findings
from interviewing 21 and surveying a total of 111 developers. We identify three
different personas among DevBot users (focusing on autonomy, chat interfaces,
and ""smartness""), each with different definitions of what a DevBot is, why
developers use them, and what they struggle with. We conclude that future
DevBot research should situate their work within our framework, to clearly
identify what type of bot the work targets, and what advantages practitioners
can expect. Further, we find that there currently is a lack of general purpose
""smart"" bots that go beyond simple automation tools or chat interfaces. This is
problematic, as we have seen that such bots, if available, can have a
transformative effect on the projects that use them.
","[{'version': 'v1', 'created': 'Thu, 28 May 2020 13:17:43 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Oct 2020 11:34:53 GMT'}]",2020-10-30,"[['Erlenhov', 'Linda', ''], ['Neto', 'Francisco Gomes de Oliveira', ''], ['Leitner', 'Philipp', '']]","['Software bot', 'Empirical study', 'Software engineering']"
11308,2204.00155,Isabella Ferreira,"Isabella Ferreira, Bram Adams, Jinghui Cheng",How heated is it? Understanding GitHub locked issues,,"In 19th International Conference on Mining Software Repositories
  (MSR'22), May 23-24, 2022, Pittsburgh, PA, USA",10.1145/3524842.3527957,,cs.SE cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although issues of open source software are created to discuss and solve
technical problems, conversations can become heated, with discussants getting
angry and/or agitated for a variety of reasons, such as poor suggestions or
violation of community conventions. To prevent and mitigate discussions from
getting heated, tools like GitHub have introduced the ability to lock issue
discussions that violate the code of conduct or other community guidelines.
Despite some early research on locked issues, there is a lack of understanding
of how communities use this feature and of potential threats to validity for
researchers relying on a dataset of locked issues as an oracle for heated
discussions. To address this gap, we (i) quantitatively analyzed 79 GitHub
projects that have at least one issue locked as too heated, and (ii)
qualitatively analyzed all issues locked as too heated of the 79 projects, a
total of 205 issues comprising 5,511 comments. We found that projects have
different behaviors when locking issues: while 54 locked less than 10% of their
closed issues, 14 projects locked more than 90% of their closed issues.
Additionally, locked issues tend to have a similar number of comments,
participants, and emoji reactions to non-locked issues. For the 205 issues
locked as too heated, we found that one-third do not contain any uncivil
discourse, and only 8.82% of the analyzed comments are actually uncivil.
Finally, we found that the locking justifications provided by maintainers do
not always match the label used to lock the issue. Based on our results, we
identified three pitfalls to avoid when using the GitHub locked issues data and
we provide recommendations for researchers and practitioners.
","[{'version': 'v1', 'created': 'Fri, 1 Apr 2022 01:39:19 GMT'}]",2022-04-04,"[['Ferreira', 'Isabella', ''], ['Adams', 'Bram', ''], ['Cheng', 'Jinghui', '']]","['github locked issues', 'heated discussions', 'incivility', 'civility']"
11309,2004.06518,Kamran Kowsari,"Kamran Kowsari, Mojtaba Heidarysafa, Tolu Odukoya, Philip Potter,
  Laura E. Barnes, Donald E. Brown",Gender Detection on Social Networks using Ensemble Deep Learning,,,10.1007/978-3-030-63128-4_26,,cs.SI cs.AI cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Analyzing the ever-increasing volume of posts on social media sites such as
Facebook and Twitter requires improved information processing methods for
profiling authorship. Document classification is central to this task, but the
performance of traditional supervised classifiers has degraded as the volume of
social media has increased. This paper addresses this problem in the context of
gender detection through ensemble classification that employs multi-model deep
learning architectures to generate specialized understanding from different
feature spaces.
","[{'version': 'v1', 'created': 'Mon, 13 Apr 2020 15:08:49 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Aug 2020 17:25:00 GMT'}, {'version': 'v3', 'created': 'Wed, 9 Sep 2020 21:54:34 GMT'}]",2020-11-19,"[['Kowsari', 'Kamran', ''], ['Heidarysafa', 'Mojtaba', ''], ['Odukoya', 'Tolu', ''], ['Potter', 'Philip', ''], ['Barnes', 'Laura E.', ''], ['Brown', 'Donald E.', '']]","['Text Mining', 'Document Classification', 'Deep Neural Networks', 'Gender Detection', 'Social Media']"
11310,2006.11483,Le Yu,"Le Yu, Leilei Sun, Bowen Du, Chuanren Liu, Hui Xiong, Weifeng Lv",Predicting Temporal Sets with Deep Neural Networks,"9 pages, 6 figures, Proceedings of the 26th ACM SIGKDD Conference on
  Knowledge Discovery and Data Mining (KDD '2020)",,10.1145/3394486.3403152,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a sequence of sets, where each set contains an arbitrary number of
elements, the problem of temporal sets prediction aims to predict the elements
in the subsequent set. In practice, temporal sets prediction is much more
complex than predictive modelling of temporal events and time series, and is
still an open problem. Many possible existing methods, if adapted for the
problem of temporal sets prediction, usually follow a two-step strategy by
first projecting temporal sets into latent representations and then learning a
predictive model with the latent representations. The two-step approach often
leads to information loss and unsatisfactory prediction performance. In this
paper, we propose an integrated solution based on the deep neural networks for
temporal sets prediction. A unique perspective of our approach is to learn
element relationship by constructing set-level co-occurrence graph and then
perform graph convolutions on the dynamic relationship graphs. Moreover, we
design an attention-based module to adaptively learn the temporal dependency of
elements and sets. Finally, we provide a gated updating mechanism to find the
hidden shared patterns in different sequences and fuse both static and dynamic
information to improve the prediction performance. Experiments on real-world
data sets demonstrate that our approach can achieve competitive performances
even with a portion of the training data and can outperform existing methods
with a significant margin.
","[{'version': 'v1', 'created': 'Sat, 20 Jun 2020 03:29:02 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Jun 2020 03:00:44 GMT'}, {'version': 'v3', 'created': 'Thu, 2 Jul 2020 05:43:43 GMT'}, {'version': 'v4', 'created': 'Wed, 8 Jul 2020 01:58:42 GMT'}]",2020-07-09,"[['Yu', 'Le', ''], ['Sun', 'Leilei', ''], ['Du', 'Bowen', ''], ['Liu', 'Chuanren', ''], ['Xiong', 'Hui', ''], ['Lv', 'Weifeng', '']]","['Temporal Sets', 'Temporal Data', 'Graph Convolutions', 'SequenceLearning']"
11311,2206.00449,Bo Xiong,"Bo Xiong, Shichao Zhu, Mojtaba Nayyeri, Chengjin Xu, Shirui Pan, Chuan
  Zhou, and Steffen Staab",Ultrahyperbolic Knowledge Graph Embeddings,Accepted to SIGKDD'22,,10.1145/3534678.3539333,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Recent knowledge graph (KG) embeddings have been advanced by hyperbolic
geometry due to its superior capability for representing hierarchies. The
topological structures of real-world KGs, however, are rather heterogeneous,
i.e., a KG is composed of multiple distinct hierarchies and non-hierarchical
graph structures. Therefore, a homogeneous (either Euclidean or hyperbolic)
geometry is not sufficient for fairly representing such heterogeneous
structures. To capture the topological heterogeneity of KGs, we present an
ultrahyperbolic KG embedding (UltraE) in an ultrahyperbolic (or
pseudo-Riemannian) manifold that seamlessly interleaves hyperbolic and
spherical manifolds. In particular, we model each relation as a
pseudo-orthogonal transformation that preserves the pseudo-Riemannian bilinear
form. The pseudo-orthogonal transformation is decomposed into various operators
(i.e., circular rotations, reflections and hyperbolic rotations), allowing for
simultaneously modeling heterogeneous structures as well as complex relational
patterns. Experimental results on three standard KGs show that UltraE
outperforms previous Euclidean- and hyperbolic-based approaches.
","[{'version': 'v1', 'created': 'Wed, 1 Jun 2022 12:31:26 GMT'}]",2022-06-02,"[['Xiong', 'Bo', ''], ['Zhu', 'Shichao', ''], ['Nayyeri', 'Mojtaba', ''], ['Xu', 'Chengjin', ''], ['Pan', 'Shirui', ''], ['Zhou', 'Chuan', ''], ['Staab', 'Steffen', '']]","['knowledge graph embeddings', 'knowledge graph completion', 'ultrahyperbolic manifold']"
11312,2201.03346,Martin Weyssow,"Martin Weyssow, Houari Sahraoui and Bang Liu","Better Modeling the Programming World with Code Concept Graphs-augmented
  Multi-modal Learning",4+1 pages,"44th International Conference on Software Engineering, 2022, New
  Ideas and Emerging Results (ICSE-NIER)",10.1145/3510455.3512771,,cs.SE cs.IR cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The progress made in code modeling has been tremendous in recent years thanks
to the design of natural language processing learning approaches based on
state-of-the-art model architectures. Nevertheless, we believe that the current
state-of-the-art does not focus enough on the full potential that data may
bring to a learning process in software engineering. Our vision articulates on
the idea of leveraging multi-modal learning approaches to modeling the
programming world. In this paper, we investigate one of the underlying idea of
our vision whose objective based on concept graphs of identifiers aims at
leveraging high-level relationships between domain concepts manipulated through
particular language constructs. In particular, we propose to enhance an
existing pretrained language model of code by joint-learning it with a graph
neural network based on our concept graphs. We conducted a preliminary
evaluation that shows gain of effectiveness of the models for code search using
a simple joint-learning method and prompts us to further investigate our
research vision.
","[{'version': 'v1', 'created': 'Mon, 10 Jan 2022 13:57:26 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Feb 2022 02:59:39 GMT'}]",2022-02-22,"[['Weyssow', 'Martin', ''], ['Sahraoui', 'Houari', ''], ['Liu', 'Bang', '']]","['code modeling', 'multi-modal learning', 'concept graphs', 'code search']"
11313,2010.01087,Giuseppe Cota,"Giuseppe Cota and Riccardo Zese and Elena Bellodi and Evelina Lamma
  and Fabrizio Riguzzi",A Framework for Reasoning on Probabilistic Description Logics,,,10.3233/SSW200040,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While there exist several reasoners for Description Logics, very few of them
can cope with uncertainty. BUNDLE is an inference framework that can exploit
several OWL (non-probabilistic) reasoners to perform inference over
Probabilistic Description Logics.
  In this chapter, we report the latest advances implemented in BUNDLE. In
particular, BUNDLE can now interface with the reasoners of the TRILL system,
thus providing a uniform method to execute probabilistic queries using
different settings. BUNDLE can be easily extended and can be used either as a
standalone desktop application or as a library in OWL API-based applications
that need to reason over Probabilistic Description Logics.
  The reasoning performance heavily depends on the reasoner and method used to
compute the probability. We provide a comparison of the different reasoning
settings on several datasets.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2020 16:41:06 GMT'}]",2022-02-04,"[['Cota', 'Giuseppe', ''], ['Zese', 'Riccardo', ''], ['Bellodi', 'Elena', ''], ['Lamma', 'Evelina', ''], ['Riguzzi', 'Fabrizio', '']]","['Probabilistic Description Logic', 'Semantic Web', 'Reasoner']"
11314,2008.11872,Wenceslao Villegas Marset,"Wenceslao Villegas Marset, Diego Sebasti\'an P\'erez, Carlos Ariel
  D\'iaz and Facundo Bromberg","Towards Practical 2D Grapevine Bud Detection with Fully Convolutional
  Networks","Revised version submitted to Journal of Computers and Electronics in
  Agriculture November 13, 2020","Computers and Electronics in Agriculture, Volume 182, 2021,105947,
  ISSN 0168-1699",10.1016/j.compag.2020.105947,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Viticulture, visual inspection of the plant is a necessary task for
measuring relevant variables. In many cases, these visual inspections are
susceptible to automation through computer vision methods. Bud detection is one
such visual task, central for the measurement of important variables such as:
measurement of bud sunlight exposure, autonomous pruning, bud counting,
type-of-bud classification, bud geometric characterization, internode length,
bud area, and bud development stage, among others. This paper presents a
computer method for grapevine bud detection based on a Fully Convolutional
Networks MobileNet architecture (FCN-MN). To validate its performance, this
architecture was compared in the detection task with a strong method for bud
detection, Scanning Windows (SW) based on a patch classifier, showing
improvements over three aspects of detection: segmentation, correspondence
identification and localization. The best version of FCN-MN showed a detection
F1-measure of $88.6\%$ (for true positives defined as detected components whose
intersection-over-union with the true bud is above $0.5$), and false positives
that are small and near the true bud. Splits -- false positives overlapping the
true bud -- showed a mean segmentation precision of $89.3\% (21.7)$, while
false alarms -- false positives not overlapping the true bud -- showed a mean
pixel area of only $8\%$ the area of a true bud, and a distance (between mass
centers) of $1.1$ true bud diameters. The paper concludes by discussing how
these results for FCN-MN would produce sufficiently accurate measurements of
bud variables such as bud number, bud area, and internode length, suggesting a
good performance in a practical setup.
","[{'version': 'v1', 'created': 'Thu, 27 Aug 2020 00:46:03 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Feb 2021 03:26:16 GMT'}]",2021-02-08,"[['Marset', 'Wenceslao Villegas', ''], ['Pérez', 'Diego Sebastián', ''], ['Díaz', 'Carlos Ariel', ''], ['Bromberg', 'Facundo', '']]","['Computer vision', 'Fully Convolutional Network', 'Grapevine bud']"
11315,cs/0612083,Wenbing Zhao,Wenbing Zhao,A Byzantine Fault Tolerant Distributed Commit Protocol,"To appear in the proceedings of the 3rd IEEE International Symposium
  on Dependable, Autonomic and Secure Computing, 2007",,10.1109/DASC.2007.10,,cs.DC cs.DB,,"  In this paper, we present a Byzantine fault tolerant distributed commit
protocol for transactions running over untrusted networks. The traditional
two-phase commit protocol is enhanced by replicating the coordinator and by
running a Byzantine agreement algorithm among the coordinator replicas. Our
protocol can tolerate Byzantine faults at the coordinator replicas and a subset
of malicious faults at the participants. A decision certificate, which includes
a set of registration records and a set of votes from participants, is used to
facilitate the coordinator replicas to reach a Byzantine agreement on the
outcome of each transaction. The certificate also limits the ways a faulty
replica can use towards non-atomic termination of transactions, or semantically
incorrect transaction outcomes.
","[{'version': 'v1', 'created': 'Mon, 18 Dec 2006 09:31:43 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Jan 2007 17:27:10 GMT'}, {'version': 'v3', 'created': 'Wed, 1 Aug 2007 04:54:38 GMT'}]",2016-11-17,"[['Zhao', 'Wenbing', '']]","['Distributed Transaction', 'Two Phase Commit', 'Fault Tolerance', 'Byzantine Agreement', 'Web Services']"
11316,2002.11618,Till Koebe,Till Koebe,"Better coverage, better outcomes? Mapping mobile network data to
  official statistics using satellite imagery and radio propagation modelling",,,10.1371/journal.pone.0241981,,cs.CY stat.CO stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile sensing data has become a popular data source for geo-spatial
analysis, however, mapping it accurately to other sources of information such
as statistical data remains a challenge. Popular mapping approaches such as
point allocation or voronoi tessellation provide only crude approximations of
the mobile network coverage as they do not consider holes, overlaps and
within-cell heterogeneity. More elaborate mapping schemes often require
additional proprietary data operators are highly reluctant to share. In this
paper, I use human settlement information extracted from publicly available
satellite imagery in combination with stochastic radio propagation modelling
techniques to account for that. I investigate in a simulation study and a
real-world application on unemployment estimates in Senegal whether better
coverage approximations lead to better outcome predictions. The good news is:
it does not have to be complicated.
","[{'version': 'v1', 'created': 'Thu, 20 Feb 2020 14:19:19 GMT'}]",2020-11-12,"[['Koebe', 'Till', '']]","['mobile networks', 'remote sensing', 'official statistics', 'radio propagation', 'international development']"
11317,2205.15511,Qi Zhang,"Qi Zhang, Jie Zhou, Qin Chen, Qinchun Bai, Liang He",Enhancing Event-Level Sentiment Analysis with Structured Arguments,,,10.1145/3477495.3531784,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Previous studies about event-level sentiment analysis (SA) usually model the
event as a topic, a category or target terms, while the structured arguments
(e.g., subject, object, time and location) that have potential effects on the
sentiment are not well studied. In this paper, we redefine the task as
structured event-level SA and propose an End-to-End Event-level Sentiment
Analysis ($\textit{E}^{3}\textit{SA}$) approach to solve this issue.
Specifically, we explicitly extract and model the event structure information
for enhancing event-level SA. Extensive experiments demonstrate the great
advantages of our proposed approach over the state-of-the-art methods. Noting
the lack of the dataset, we also release a large-scale real-world dataset with
event arguments and sentiment labelling for promoting more
researches\footnote{The dataset is available at
https://github.com/zhangqi-here/E3SA}.
","[{'version': 'v1', 'created': 'Tue, 31 May 2022 02:44:24 GMT'}]",2022-06-01,"[['Zhang', 'Qi', ''], ['Zhou', 'Jie', ''], ['Chen', 'Qin', ''], ['Bai', 'Qinchun', ''], ['He', 'Liang', '']]","['event-level sentiment analysis', 'structured', 'datasets']"
11318,2011.05973,Daniel Park,"Daniel Park and B\""ulent Yener",A survey on practical adversarial examples for malware classifiers,"preprint. to appear in the Reversing and Offensive-oriented Trends
  Symposium(ROOTS) 2020",,10.1145/3433667.3433670,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning based solutions have been very helpful in solving problems
that deal with immense amounts of data, such as malware detection and
classification. However, deep neural networks have been found to be vulnerable
to adversarial examples, or inputs that have been purposefully perturbed to
result in an incorrect label. Researchers have shown that this vulnerability
can be exploited to create evasive malware samples. However, many proposed
attacks do not generate an executable and instead generate a feature vector. To
fully understand the impact of adversarial examples on malware detection, we
review practical attacks against malware classifiers that generate executable
adversarial malware examples. We also discuss current challenges in this area
of research, as well as suggestions for improvement and future research
directions.
","[{'version': 'v1', 'created': 'Fri, 6 Nov 2020 17:07:34 GMT'}]",2020-11-12,"[['Park', 'Daniel', ''], ['Yener', 'Bülent', '']]","['SoK', 'survey', 'malware', 'adversarial examples', 'machine learning']"
11319,2010.02860,Pietro Verzelli,Pietro Verzelli and Cesare Alippi and Lorenzo Livi,"Learn to Synchronize, Synchronize to Learn",,,10.1063/5.0056425,,cs.LG cs.NE nlin.CD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, the machine learning community has seen a continuous growing
interest in research aimed at investigating dynamical aspects of both training
procedures and machine learning models. Of particular interest among recurrent
neural networks we have the Reservoir Computing (RC) paradigm characterized by
conceptual simplicity and a fast training scheme. Yet, the guiding principles
under which RC operates are only partially understood. In this work, we analyze
the role played by Generalized Synchronization (GS) when training a RC to solve
a generic task. In particular, we show how GS allows the reservoir to correctly
encode the system generating the input signal into its dynamics. We also
discuss necessary and sufficient conditions for the learning to be feasible in
this approach. Moreover, we explore the role that ergodicity plays in this
process, showing how its presence allows the learning outcome to apply to
multiple input trajectories. Finally, we show that satisfaction of the GS can
be measured by means of the Mutual False Nearest Neighbors index, which makes
effective to practitioners theoretical derivations.
","[{'version': 'v1', 'created': 'Tue, 6 Oct 2020 16:29:18 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Jan 2021 22:47:38 GMT'}, {'version': 'v3', 'created': 'Tue, 11 May 2021 08:41:51 GMT'}]",2021-09-01,"[['Verzelli', 'Pietro', ''], ['Alippi', 'Cesare', ''], ['Livi', 'Lorenzo', '']]","['Reservoir Computing', 'Echo State Property', 'DynamicalSystems', 'Chaos Synchronization']"
11320,1810.02620,Benjamin Wassermann,"Benjamin Wassermann, Stefan Kollmannsberger, Shuohui Yin, L\'aszl\'o
  Kudela, Ernst Rank","Integrating CAD and Numerical Analysis: 'Dirty Geometry' handling using
  the Finite Cell Method",Accepted Manuscript,"Computer Methods in Applied Mechanics and Engineering 351 (2019)
  808-835",10.1016/j.cma.2019.04.017,,cs.CE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper proposes a computational methodology for the integration of
Computer Aided Design (CAD) and the Finite Cell Method (FCM) for models with
""dirty geometries"". FCM, being a fictitious domain approach based on higher
order finite elements, embeds the physical model into a fictitious domain,
which can be discretized without having to take into account the boundary of
the physical domain. The true geometry is captured by a precise numerical
integration of elements cut by the boundary. Thus, an effective Point
Membership Classification algorithm that determines the inside-outside state of
an integration point with respect to the physical domain is a core operation in
FCM. To treat also ""dirty geometries"", i.e. imprecise or flawed geometric
models, a combination of a segment-triangle intersection algorithm and a flood
fill algorithm being insensitive to most CAD model flaws is proposed to
identify the affiliation of the integration points. The present method thus
allows direct computations on geometrically and topologically flawed models.
The potential and merit for practical applications of the proposed method is
demonstrated by several numerical examples.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 11:31:29 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Apr 2019 11:39:04 GMT'}]",2019-05-01,"[['Wassermann', 'Benjamin', ''], ['Kollmannsberger', 'Stefan', ''], ['Yin', 'Shuohui', ''], ['Kudela', 'László', ''], ['Rank', 'Ernst', '']]","['Computer-Aided Design', 'Dirty geometry', 'Finite Cell Method', 'Flood Fill', 'PointMembership Classification', 'Flawed geometry']"
11321,2107.14047,Sourav Ghosh,"Anupam Khan, Sourav Ghosh, Soumya K. Ghosh","Measuring Domain Knowledge for Early Prediction of Student Performance:
  A Semantic Approach","Published in 2020 IEEE International Conference on Teaching,
  Assessment, and Learning for Engineering (TALE). 8 pages, 5 figures (includes
  16 plots). Accessible at https://ieeexplore.ieee.org/document/9368439","2020 IEEE International Conference on Teaching, Assessment, and
  Learning for Engineering (TALE), Takamatsu, Japan, 2020, pp. 444-451",10.1109/TALE48869.2020.9368439,,cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The growing popularity of data mining catalyses the researchers to explore
various exciting aspects of education. Early prediction of student performance
is an emerging area among them. The researchers have used various predictors in
performance modelling studies. Although prior cognition can affect student
performance, establishing their relationship is still an open research
challenge. Quantifying the knowledge from readily available data is the major
challenge here. We have proposed a semantic approach for this purpose.
Association mining on nearly 0.35 million observations establishes that prior
cognition impacts the student performance. The proposed approach of measuring
domain knowledge can help the early performance modelling studies to use it as
a predictor.
","[{'version': 'v1', 'created': 'Thu, 15 Jul 2021 23:46:27 GMT'}]",2021-07-30,"[['Khan', 'Anupam', ''], ['Ghosh', 'Sourav', ''], ['Ghosh', 'Soumya K.', '']]","['Domain knowledge', 'student performance', 'earlyprediction', 'educational data mining', 'classroom learning']"
11322,2006.10386,Daniele Di Mauro,"Daniele Di Mauro, Antonino Furnari, Giuseppe Patan\`e, Sebastiano
  Battiato, Giovanni Maria Farinella","SceneAdapt: Scene-based domain adaptation for semantic segmentation
  using adversarial learning",,"Pattern Recognition Letters, Volume 136, August 2020, Pages
  175-182",10.1016/j.patrec.2020.06.002,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semantic segmentation methods have achieved outstanding performance thanks to
deep learning. Nevertheless, when such algorithms are deployed to new contexts
not seen during training, it is necessary to collect and label scene-specific
data in order to adapt them to the new domain using fine-tuning. This process
is required whenever an already installed camera is moved or a new camera is
introduced in a camera network due to the different scene layouts induced by
the different viewpoints. To limit the amount of additional training data to be
collected, it would be ideal to train a semantic segmentation method using
labeled data already available and only unlabeled data coming from the new
camera. We formalize this problem as a domain adaptation task and introduce a
novel dataset of urban scenes with the related semantic labels. As a first
approach to address this challenging task, we propose SceneAdapt, a method for
scene adaptation of semantic segmentation algorithms based on adversarial
learning. Experiments and comparisons with state-of-the-art approaches to
domain adaptation highlight that promising performance can be achieved using
adversarial learning both when the two scenes have different but points of
view, and when they comprise images of completely different scenes. To
encourage research on this topic, we made our code available at our web page:
https://iplab.dmi.unict.it/ParkSmartSceneAdaptation/.
","[{'version': 'v1', 'created': 'Thu, 18 Jun 2020 09:43:31 GMT'}]",2020-06-19,"[['Di Mauro', 'Daniele', ''], ['Furnari', 'Antonino', ''], ['Patanè', 'Giuseppe', ''], ['Battiato', 'Sebastiano', ''], ['Farinella', 'Giovanni Maria', '']]","['Semantic Segmentation', 'DomainAdaptation', 'Scene Adaptation', 'Adversarial Learning']"
11323,1306.5615,Chengqing Li,"Chengqing Li, Yuansheng Liu, Leo Yu Zhang, Kwok-wo Wong","Cryptanalyzing a class of image encryption schemes based on Chinese
  Remainder Theorem",7 pages,"Signal Processing: Image Communication, 29(8): 914-920, 2014",10.1016/j.image.2014.06.011,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As a fundamental theorem in number theory, the Chinese Reminder Theorem (CRT)
is widely used to construct cryptographic primitives. This paper investigates
the security of a class of image encryption schemes based on CRT, referred to
as CECRT. Making use of some properties of CRT, the equivalent secret key of
CECRT can be recovered efficiently. The required number of pairs of chosen
plaintext and the corresponding ciphertext is only $(1+\lceil (\log_2L)/l
\rceil)$. The attack complexity is only $O(L)$, where $L$ is the plaintext
length and $l$ is the number of bits representing a plaintext symbol. In
addition, other defects of CECRT such as invalid compression function and low
sensitivity to plaintext, are reported. The work in this paper will help
clarify positive role of CRT in cryptology.
","[{'version': 'v1', 'created': 'Mon, 24 Jun 2013 13:22:19 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Nov 2013 15:57:11 GMT'}, {'version': 'v3', 'created': 'Thu, 29 Sep 2016 06:43:08 GMT'}]",2016-09-30,"[['Li', 'Chengqing', ''], ['Liu', 'Yuansheng', ''], ['Zhang', 'Leo Yu', ''], ['Wong', 'Kwok-wo', '']]","['compression', 'Chinese Remainder Theorem (CRT)', 'cryptanalysis', 'chosen-plaintext attack', 'encryption']"
11324,2107.09533,Rayed AlGhamdi,"Rayed Alghamdi, Seyed M. Buhari, Madini O. Alassafi","From Teaching to Coaching: A Case Study of a Technical Communication
  Course",Conference Paper,"13th annual International Conference of Education, Research and
  Innovation, 2020",10.21125/iceri.2020.0285,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the leading university goals is to provide the students with the
necessary skills for better functioning in their future studies. Gaining and
developing skills, both technical and soft skills, are the critical building
blocks for a successful career. The traditional teaching process, which
includes delivering lectures and conducting exams, emphasizes the upliftment of
technical knowledge rather than building self-esteem and enhancing skills
development among students. Development of non-technical skills like
self-esteem, life-long learning among students is vital for a successful
career. This paper targets to achieve the objective of identifying ways to
empower students with non-technical skills along with technical skills. The
approach adopted in this research work is to transform the delivery of a
faculty-wide course from teaching to coaching. One salient difference between
teaching and coaching is to move students motivation away from grades towards
life-long learning. Thus, university students maximize skills through coaching
like course structure, course delivery, course assessment, and student
involvement. As a case study, the proposed approach was successfully tested and
validated on a course taught in the Faculty of Computing and Information
Technology (FCIT) at King Abdulaziz University (KAU). The outcome of this case
study reveals that there is substantial potential towards enhancement of
self-responsibility. In the future, this approach can be extended for other
courses that aim to develop skills such as English language courses, computer,
and communication skills courses in the preparatory/foundation year.
","[{'version': 'v1', 'created': 'Tue, 20 Jul 2021 14:44:38 GMT'}]",2021-07-21,"[['Alghamdi', 'Rayed', ''], ['Buhari', 'Seyed M.', ''], ['Alassafi', 'Madini O.', '']]","['Skills', 'Technical Communication', 'Higher Education', 'Assessments', 'Blackboard']"
11325,2208.08302,Qingyun Sun,"Qingyun Sun, Jianxin Li, Haonan Yuan, Xingcheng Fu, Hao Peng, Cheng
  Ji, Qian Li, Philip S. Yu","Position-aware Structure Learning for Graph Topology-imbalance by
  Relieving Under-reaching and Over-squashing",Accepted by CIKM 2022,,10.1145/3511808.3557419,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Topology-imbalance is a graph-specific imbalance problem caused by the uneven
topology positions of labeled nodes, which significantly damages the
performance of GNNs. What topology-imbalance means and how to measure its
impact on graph learning remain under-explored. In this paper, we provide a new
understanding of topology-imbalance from a global view of the supervision
information distribution in terms of under-reaching and over-squashing, which
motivates two quantitative metrics as measurements. In light of our analysis,
we propose a novel position-aware graph structure learning framework named
PASTEL, which directly optimizes the information propagation path and solves
the topology-imbalance issue in essence. Our key insight is to enhance the
connectivity of nodes within the same class for more supervision information,
thereby relieving the under-reaching and over-squashing phenomena.
Specifically, we design an anchor-based position encoding mechanism, which
better incorporates relative topology position and enhances the intra-class
inductive bias by maximizing the label influence. We further propose a
class-wise conflict measure as the edge weights, which benefits the separation
of different node classes. Extensive experiments demonstrate the superior
potential and adaptability of PASTEL in enhancing GNNs' power in different data
annotation scenarios.
","[{'version': 'v1', 'created': 'Wed, 17 Aug 2022 14:04:21 GMT'}]",2022-08-18,"[['Sun', 'Qingyun', ''], ['Li', 'Jianxin', ''], ['Yuan', 'Haonan', ''], ['Fu', 'Xingcheng', ''], ['Peng', 'Hao', ''], ['Ji', 'Cheng', ''], ['Li', 'Qian', ''], ['Yu', 'Philip S.', '']]","['graph representation learning', 'graph neural networks', 'imbalancelearning', 'graph structure learning', 'node classification']"
11326,2210.12270,Chen Chen,"Chen Chen, Matin Yarmand, Zhuoqun Xu, Varun Singh, Yang Zhang, Nadir
  Weibel","Investigating Input Modality and Task Geometry on Precision-first 3D
  Drawing in Virtual Reality","C. Chen, M. Yarmand, Z. Xu and V. Singh, Y. Zhang and N. Weibel,
  ""Investigating Input Modality and Task Geometry on Precision-first 3D Drawing
  in Virtual Reality"", 2022 IEEE International Symposium on Mixed and Augmented
  Reality (ISMAR), 2022, pp. 1-10, doi: 10.1109/ISMAR55827.2022.00054",,10.1109/ISMAR55827.2022.00054,,cs.HC cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Accurately drawing non-planar 3D curves in immersive Virtual Reality (VR) is
indispensable for many precise 3D tasks. However, due to lack of physical
support, limited depth perception, and the non-planar nature of 3D curves, it
is challenging to adjust mid-air strokes to achieve high precision. Instead of
creating new interaction techniques, we investigated how task geometric shapes
and input modalities affect precision-first drawing performance in a
within-subject study (n = 12) focusing on 3D target tracing in commercially
available VR headsets. We found that compared to using bare hands, VR
controllers and pens yield nearly 30% of precision gain, and that the tasks
with large curvature, forward-backward or left-right orientations perform best.
We finally discuss opportunities for designing novel interaction techniques for
precise 3D drawing. We believe that our work will benefit future research
aiming to create usable toolboxes for precise 3D drawing.
","[{'version': 'v1', 'created': 'Fri, 21 Oct 2022 21:56:43 GMT'}]",2022-10-25,"[['Chen', 'Chen', ''], ['Yarmand', 'Matin', ''], ['Xu', 'Zhuoqun', ''], ['Singh', 'Varun', ''], ['Zhang', 'Yang', ''], ['Weibel', 'Nadir', '']]","['VR', 'Precise–First 3D Drawing', 'Usability Studies']"
11327,2111.09539,Prabhat Kc,"Prabhat KC, Rongping Zeng, M. Mehdi Farhangi, Kyle J. Myers","Deep neural networks-based denoising models for CT imaging and their
  efficacy","13 pages, 9 figures, SPIE proceeding","Prabhat KC, Rongping Zeng, M. Mehdi Farhangi, Kyle J. Myers, ""Deep
  neural networks-based denoising models for CT imaging and their efficacy,""
  Proc. SPIE 11595, Medical Imaging 2021: Physics of Medical Imaging, 115950H
  (15 February 2021)",10.1117/12.2581418,,cs.CV physics.med-ph,http://creativecommons.org/publicdomain/zero/1.0/,"  Most of the Deep Neural Networks (DNNs) based CT image denoising literature
shows that DNNs outperform traditional iterative methods in terms of metrics
such as the RMSE, the PSNR and the SSIM. In many instances, using the same
metrics, the DNN results from low-dose inputs are also shown to be comparable
to their high-dose counterparts. However, these metrics do not reveal if the
DNN results preserve the visibility of subtle lesions or if they alter the CT
image properties such as the noise texture. Accordingly, in this work, we seek
to examine the image quality of the DNN results from a holistic viewpoint for
low-dose CT image denoising. First, we build a library of advanced DNN
denoising architectures. This library is comprised of denoising architectures
such as the DnCNN, U-Net, Red-Net, GAN, etc. Next, each network is modeled, as
well as trained, such that it yields its best performance in terms of the PSNR
and SSIM. As such, data inputs (e.g. training patch-size, reconstruction
kernel) and numeric-optimizer inputs (e.g. minibatch size, learning rate, loss
function) are accordingly tuned. Finally, outputs from thus trained networks
are further subjected to a series of CT bench testing metrics such as the
contrast-dependent MTF, the NPS and the HU accuracy. These metrics are employed
to perform a more nuanced study of the resolution of the DNN outputs'
low-contrast features, their noise textures, and their CT number accuracy to
better understand the impact each DNN algorithm has on these underlying
attributes of image quality.
","[{'version': 'v1', 'created': 'Thu, 18 Nov 2021 06:18:26 GMT'}]",2021-11-19,"[['KC', 'Prabhat', ''], ['Zeng', 'Rongping', ''], ['Farhangi', 'M. Mehdi', ''], ['Myers', 'Kyle J.', '']]","['CT image denoising', 'deep learning', 'neural networks', 'loss functions', 'image quality']"
11328,2103.07678,Ehsan Farahbakhsh,"Hojat Shirmard, Ehsan Farahbakhsh, R. Dietmar Muller, Rohitash Chandra","A review of machine learning in processing remote sensing data for
  mineral exploration","26 pages, 4 figures, 2 tables","Remote Sensing of Environment, 268, 112750 (2022)",10.1016/j.rse.2021.112750,,cs.LG cs.CV stat.AP,http://creativecommons.org/licenses/by/4.0/,"  The decline of the number of newly discovered mineral deposits and increase
in demand for different minerals in recent years has led exploration geologists
to look for more efficient and innovative methods for processing different data
types at each stage of mineral exploration. As a primary step, various
features, such as lithological units, alteration types, structures, and
indicator minerals, are mapped to aid decision-making in targeting ore
deposits. Different types of remote sensing datasets, such as satellite and
airborne data, make it possible to overcome common problems associated with
mapping geological features. The rapid increase in the volume of remote sensing
data obtained from different platforms has encouraged scientists to develop
advanced, innovative, and robust data processing methodologies. Machine
learning methods can help process a wide range of remote sensing datasets and
determine the relationship between components such as the reflectance continuum
and features of interest. These methods are robust in processing spectral and
ground truth measurements against noise and uncertainties. In recent years,
many studies have been carried out by supplementing geological surveys with
remote sensing datasets, which is now prominent in geoscience research. This
paper provides a comprehensive review of the implementation and adaptation of
some popular and recently established machine learning methods for processing
different types of remote sensing data and investigates their applications for
detecting various ore deposit types. We demonstrate the high capability of
combining remote sensing data and machine learning methods for mapping
different geological features that are critical for providing potential maps.
Moreover, we find there is scope for advanced methods to process the new
generation of remote sensing data for creating improved mineral prospectivity
maps.
","[{'version': 'v1', 'created': 'Sat, 13 Mar 2021 10:36:25 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Dec 2021 07:11:24 GMT'}]",2021-12-07,"[['Shirmard', 'Hojat', ''], ['Farahbakhsh', 'Ehsan', ''], ['Muller', 'R. Dietmar', ''], ['Chandra', 'Rohitash', '']]","['Machine learning', 'remote sensing', 'mineral exploration', 'geological mapping', 'alteration mapping']"
11329,2205.05760,Morad Behandish,"Clinton B. Morris, Morad Behandish","Co-generation of Collision-Free Shapes for Arbitrary One-Parametric
  Motion",Special Issue on symposium on Solid and Physical Modeling (SPM'2022),"Journal of Computer-Aided Design, 2022",10.1016/j.cad.2022.103323,103323,cs.CG cs.CE cs.GR cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Mechanical assemblies can exhibit complex relative motions, during which
collisions between moving parts and their surroundings must be avoided. To
define feasible design spaces for each part's shape, ""maximal"" collision-free
pointsets can be computed using configuration space modeling techniques such as
Minkowski operations and sweep/unsweep. For example, for a pair of parts
undergoing a given relative motion, to make the problem well-posed, the
geometry of one part (chosen arbitrarily) must be fixed to compute the maximal
shape of the other part by an unsweep operation. Making such arbitrary choices
in a multi-component assembly can place unnecessary restrictions on the design
space. A broader family of collision-free pairs of parts can be explored, if
fixing the geometry of a component is not required. In this paper, we formalize
this family of collision-free shapes and introduce a generic method for
generating a broad subset of them. Our procedure, which is an extension of the
unsweep, allows for co-generation of a pair of geometries which are modified
incrementally and simultaneously to avoid collision. We demonstrate the
effectiveness and scalability of our procedure in both 2D and 3D by generating
a variety of collision-free shapes. Notably, we show that our approach can
automatically generate freeform cam and follower profiles, gear teeth, and
screw threads, starting from colliding blocks of materials, solely from a
specification of relative motion and without the use of any feature-informed
heuristics. Moreover, our approach provides continuous measures of collision
that can be incorporated into standard gradient-descent design optimization,
allowing for simultaneous collision-free and physics-informed co-design of
mechanical parts for assembly.
","[{'version': 'v1', 'created': 'Wed, 11 May 2022 20:15:44 GMT'}, {'version': 'v2', 'created': 'Fri, 13 May 2022 01:28:06 GMT'}, {'version': 'v3', 'created': 'Mon, 6 Jun 2022 00:47:02 GMT'}]",2022-06-07,"[['Morris', 'Clinton B.', ''], ['Behandish', 'Morad', '']]","['Automated Design', 'Collision Avoidance', 'Configuration Space', 'Spatial Reasoning', 'Persistent Contact']"
11330,2109.12195,Sukhpal Singh Gill,Sukhpal Singh Gill,"A Manifesto for Modern Fog and Edge Computing: Vision, New Paradigms,
  Opportunities, and Future Directions","27 pages, 4 Figures, Preprint version - Published by EAI/Springer
  Innovations in Communication and Computing. Springer, Cham","in Operationalizing Multi-Cloud Environments. EAI/Springer
  Innovations in Communication and Computing. pp 237-253 (2021)",10.1007/978-3-030-74402-1_13,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  The advancements in the use of Internet of Things (IoT) devices is increasing
continuously and generating huge amounts of data in a fast manner. Cloud
computing is an important paradigm which processes and manages user data
effectively. Further, fog and edge computing paradigms are introduced to
improve user service by reducing latency and response time. This chapter
presents a manifesto for modern fog and edge computing systems based on the
current research trends. Further, architectures and applications of fog and
edge computing are explained. Moreover, research opportunities and promising
future directions are presented with respect to the new paradigms, which will
be helpful for practitioners, researchers, and academicians to continue their
research.
","[{'version': 'v1', 'created': 'Sun, 19 Sep 2021 09:25:18 GMT'}]",2022-03-01,"[['Gill', 'Sukhpal Singh', '']]","['IoT', 'Edge Computing', 'Cloud Computing', 'Manifesto', 'Architecture', 'Fog Computing']"
11331,2206.10273,Justin Edwards,"Sophie Becker, Philip Doyle, Justin Edwards","Embrace your incompetence! Designing appropriate CUI communication
  through an ecological approach",,4th Conference on Conversational User Interfaces (CUI 2022),10.1145/3543829.3544531,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  People form impressions of their dialogue partners, be they other people or
machines, based on cues drawn from their communicative style. Recent work has
suggested that the gulf between people's expectations and the reality of CUI
interaction widens when these impressions are misaligned with the actual
capabilities of conversational user interfaces (CUIs). This has led some to
rally against a perceived overriding concern for naturalness, calling instead
for more representative, or appropriate communicative cues. Indeed, some have
argued for a move away from naturalness as a goal for CUI design and
communication. We contend that naturalness need not be abandoned, if we instead
aim for ecologically grounded design. We also suggest a way this might be
achieved and call on CUI designers to embrace incompetence! By letting CUIs
express uncertainty and embarrassment through ecologically valid and
appropriate cues that are ubiquitous in human communication - CUI designers can
achieve more appropriate communication without turning away from naturalness
entirely.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2022 11:46:26 GMT'}]",2022-06-22,"[['Becker', 'Sophie', ''], ['Doyle', 'Philip', ''], ['Edwards', 'Justin', '']]","['speech interfaces', 'conversational user interfaces', 'appropriateness', 'naturalness', 'uncertainty']"
11332,2106.07767,Jiong Zhu,"Jiong Zhu, Junchen Jin, Donald Loveland, Michael T. Schaub, Danai
  Koutra","How does Heterophily Impact the Robustness of Graph Neural Networks?
  Theoretical Connections and Practical Implications","KDD 2022 camera ready version + full appendix; 20 pages, 2 figures",,10.1145/3534678.3539418,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We bridge two research directions on graph neural networks (GNNs), by
formalizing the relation between heterophily of node labels (i.e., connected
nodes tend to have dissimilar labels) and the robustness of GNNs to adversarial
attacks. Our theoretical and empirical analyses show that for homophilous graph
data, impactful structural attacks always lead to reduced homophily, while for
heterophilous graph data the change in the homophily level depends on the node
degrees. These insights have practical implications for defending against
attacks on real-world graphs: we deduce that separate aggregators for ego- and
neighbor-embeddings, a design principle which has been identified to
significantly improve prediction for heterophilous graph data, can also offer
increased robustness to GNNs. Our comprehensive experiments show that GNNs
merely adopting this design achieve improved empirical and certifiable
robustness compared to the best-performing unvaccinated model. Additionally,
combining this design with explicit defense mechanisms against adversarial
attacks leads to an improved robustness with up to 18.33% performance increase
under attacks compared to the best-performing vaccinated model.
","[{'version': 'v1', 'created': 'Mon, 14 Jun 2021 21:39:36 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Oct 2021 01:17:11 GMT'}, {'version': 'v3', 'created': 'Sat, 11 Jun 2022 02:36:42 GMT'}, {'version': 'v4', 'created': 'Sat, 23 Jul 2022 02:42:48 GMT'}]",2022-07-26,"[['Zhu', 'Jiong', ''], ['Jin', 'Junchen', ''], ['Loveland', 'Donald', ''], ['Schaub', 'Michael T.', ''], ['Koutra', 'Danai', '']]","['graph neural networks', 'adversarial attacks', 'heterophily', 'structuralperturbation', 'robustness', 'relation']"
11333,2212.14884,Hocine Cherifi,"Debayan Chakraborty, Anurag Singh, Hocine Cherifi","Immunization Strategies Based on the Overlapping Nodes in Networks with
  Community Structure",,"In: Nguyen, H., Snasel, V. (eds) Computational Social Networks.
  CSoNet 2016. Lecture Notes in Computer Science(), vol 9795. Springer, Cham",10.1007/978-3-319-42345-6_6,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding how the network topology affects the spread of an epidemic is a
main concern in order to develop efficient immunization strategies. While there
is a great deal of work dealing with the macroscopic topological properties of
the networks, few studies have been devoted to the influence of the community
structure. Furthermore, while in many real-world networks communities may
overlap, in these studies non-overlapping community structures are considered.
In order to gain insight about the influence of the overlapping nodes in the
epidemic process we conduct an empirical evaluation of basic deterministic
immunization strategies based on the overlapping nodes. Using the classical SIR
model on a real-world network with ground truth overlapping community structure
we analyse how immunization based on the membership number of overlapping nodes
(which is the number of communities the node belongs to) affect the largest
connected component size. Comparison with random immunization strategies
designed for networks with non-overlapping community structure show that
overlapping nodes play a major role in the epidemic process.
","[{'version': 'v1', 'created': 'Fri, 30 Dec 2022 18:58:02 GMT'}]",2023-01-02,"[['Chakraborty', 'Debayan', ''], ['Singh', 'Anurag', ''], ['Cherifi', 'Hocine', '']]","['Immunization', 'Diffusion', 'Complex Networks', 'overlappingcommunity', 'membership number']"
11334,2108.09081,Jianlei Yang,"Junyu Luo, Jianlei Yang, Xucheng Ye, Xin Guo, Weisheng Zhao","FedSkel: Efficient Federated Learning on Heterogeneous Systems with
  Skeleton Gradients Update",CIKM 2021,,10.1145/3459637.3482107,,cs.LG cs.AI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Federated learning aims to protect users' privacy while performing data
analysis from different participants. However, it is challenging to guarantee
the training efficiency on heterogeneous systems due to the various
computational capabilities and communication bottlenecks. In this work, we
propose FedSkel to enable computation-efficient and communication-efficient
federated learning on edge devices by only updating the model's essential
parts, named skeleton networks. FedSkel is evaluated on real edge devices with
imbalanced datasets. Experimental results show that it could achieve up to
5.52$\times$ speedups for CONV layers' back-propagation, 1.82$\times$ speedups
for the whole training process, and reduce 64.8% communication cost, with
negligible accuracy loss.
","[{'version': 'v1', 'created': 'Fri, 20 Aug 2021 09:21:58 GMT'}]",2021-08-23,"[['Luo', 'Junyu', ''], ['Yang', 'Jianlei', ''], ['Ye', 'Xucheng', ''], ['Guo', 'Xin', ''], ['Zhao', 'Weisheng', '']]","['Federated learning', 'heterogeneous system', 'distributed learning']"
11335,1812.10450,Sergey Belim,"S.V. Belim, S.Yu. Belim","Use the Keys Pre-Distribution KDP-scheme for Mandatory Access Control
  Implementation",,,10.1088/1742-6596/1210/1/012009,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The possibility of use the keys preliminary distribution KDP-scheme for
mandatory access control realization in the distributed systems with user's
hierarchy is considered. The modified keys preliminary distribution algorithm
is suggested. It is developed a method for creation of subsets family for
solution this task.
","[{'version': 'v1', 'created': 'Wed, 26 Dec 2018 18:31:35 GMT'}]",2019-05-22,"[['Belim', 'S. V.', ''], ['Belim', 'S. Yu.', '']]","['keys pre-distribution scheme', 'KDP-scheme', 'security model', 'mandatory access']"
11336,1807.08526,Sergey Rodionov,"Sergey Rodionov, Alexey Potapov, Hugo Latapie, Enzo Fenoglio, Maxim
  Peterson","Improving Deep Models of Person Re-identification for Cross-Dataset
  Usage","AIAI 2018 (14th International Conference on Artificial Intelligence
  Applications and Innovations) proceeding. The final publication is available
  at link.springer.com",,10.1007/978-3-319-92007-8_7,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Person re-identification (Re-ID) is the task of matching humans across
cameras with non-overlapping views that has important applications in visual
surveillance. Like other computer vision tasks, this task has gained much with
the utilization of deep learning methods. However, existing solutions based on
deep learning are usually trained and tested on samples taken from same
datasets, while in practice one need to deploy Re-ID systems for new sets of
cameras for which labeled data is unavailable. Here, we mitigate this problem
for one state-of-the-art model, namely, metric embedding trained with the use
of the triplet loss function, although our results can be extended to other
models. The contribution of our work consists in developing a method of
training the model on multiple datasets, and a method for its online
practically unsupervised fine-tuning. These methods yield up to 19.1%
improvement in Rank-1 score in the cross-dataset evaluation.
","[{'version': 'v1', 'created': 'Mon, 23 Jul 2018 10:57:54 GMT'}]",2018-07-24,"[['Rodionov', 'Sergey', ''], ['Potapov', 'Alexey', ''], ['Latapie', 'Hugo', ''], ['Fenoglio', 'Enzo', ''], ['Peterson', 'Maxim', '']]","['person re-id', 'deep learning', 'metric embedding', 'triplet loss', 'crossdataset evaluation']"
11337,2203.10918,P.Thanh Tran-Ngoc,"P.Thanh Tran-Ngoc, Leslie Ziqi Lim, Jia Hui Gan, Hong Wang, T.Thang
  Vo-Doan, Hirotaka Sato",A robotic leg inspired from an insect leg,"17 pages, 10 figures",Bioinspir. Biomim. 17 (2022) 056008,10.1088/1748-3190/ac78b5,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  While most insect-inspired robots come with a simple tarsus such as a
hemispherical foot tip, insect legs have complex tarsal structures and claws,
which enable them to walk on complex terrain. Their sharp claws can smoothly
attach and detach on plant surfaces by actuating a single muscle. Thus,
installing insect-inspired tarsus on legged robots would improve their
locomotion on complex terrain. This paper shows that the tendon-driven
ball-socket structure provides the tarsus both flexibility and rigidity, which
is necessary for the beetle to walk on a complex substrate such as a mesh
surface. Disabling the tarsus' rigidity by removing the socket and elastic
membrane of a tarsal joint, the claws could not attach to the mesh securely.
Meanwhile, the beetle struggled to draw the claws out of the substrate when we
turned the tarsus rigid by tubing. We then developed a cable-driven
bio-inspired tarsus structure to validate the function of the tarsus as well as
to show its potential application in the legged robot. With the tarsus, the
robotic leg was able to attach and retract smoothly from the mesh substrate
when performing a walking cycle.
","[{'version': 'v1', 'created': 'Mon, 21 Mar 2022 12:23:19 GMT'}, {'version': 'v2', 'created': 'Wed, 11 May 2022 08:45:16 GMT'}]",2022-10-24,"[['Tran-Ngoc', 'P. Thanh', ''], ['Lim', 'Leslie Ziqi', ''], ['Gan', 'Jia Hui', ''], ['Wang', 'Hong', ''], ['Vo-Doan', 'T. Thang', ''], ['Sato', 'Hirotaka', '']]","['Locomotion', 'bio-inspired robotics', 'robotics', 'beetle', 'tarsus', 'legged robots']"
11338,2106.07233,Thorsten Wi{\ss}mann,Thorsten Wi{\ss}mann,Minimality Notions via Factorization Systems,,,10.4230/LIPIcs.CALCO.2021.24,,cs.FL cs.DM math.CT,http://creativecommons.org/licenses/by/4.0/,"  For the minimization of state-based systems (i.e. the reduction of the number
of states while retaining the system's semantics), there are two obvious
aspects: removing unnecessary states of the system and merging redundant states
in the system. In the present article, we relate the two aspects on coalgebras
by defining an abstract notion of minimality. The abstract notion minimality
and minimization live in a general category with a factorization system. We
will find criteria on the category that ensure uniqueness, existence, and
functoriality of the minimization aspects. The proofs of these results
instantiate to those for reachability and observability minimization in the
standard coalgebra literature. Finally, we will see how the two aspects of
minimization interact and under which criteria they can be sequenced in any
order, like in automata minimization.
","[{'version': 'v1', 'created': 'Mon, 14 Jun 2021 08:40:45 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Sep 2021 17:31:04 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Sep 2021 15:20:09 GMT'}, {'version': 'v4', 'created': 'Mon, 1 Nov 2021 09:39:29 GMT'}]",2021-11-09,"[['Wißmann', 'Thorsten', '']]","['Coalgebra', 'Reachability', 'Observability', 'Minimization', 'Factorization System']"
11339,2110.07039,Arnab Sen Sharma,"Arnab Sen Sharma, Tirtha Roy, Sadique Ahmmod Rifat, Maruf Ahmed Mridul","Presenting a Larger Up-to-date Movie Dataset and Investigating the
  Effects of Pre-released Attributes on Gross Revenue",,"Journal of Computer Science, Volume 17 No. 10, 2021, 870-888",10.3844/jcssp.2021.870.888,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Movie-making has become one of the most costly and risky endeavors in the
entertainment industry. Continuous change in the preference of the audience
makes it harder to predict what kind of movie will be financially successful at
the box office. So, it is no wonder that cautious, intelligent stakeholders and
large production houses will always want to know the probable revenue that will
be generated by a movie before making an investment. Researchers have been
working on finding an optimal strategy to help investors in making the right
decisions. But the lack of a large, up-to-date dataset makes their work harder.
In this work, we introduce an up-to-date, richer, and larger dataset that we
have prepared by scraping IMDb for researchers and data analysts to work with.
The compiled dataset contains the summery data of 7.5 million titles and detail
information of more than 200K movies. Additionally, we perform different
statistical analysis approaches on our dataset to find out how a movie's
revenue is affected by different pre-released attributes such as budget,
runtime, release month, content rating, genre etc. In our analysis, we have
found that having a star cast/director has a positive impact on generated
revenue. We introduce a novel approach for calculating the star power of a
movie. Based on our analysis we select a set of attributes as features and
train different machine learning algorithms to predict a movie's expected
revenue. Based on generated revenue, we classified the movies in 10 categories
and achieved a one-class-away accuracy rate of almost 60% (bingo accuracy of
30%). All the generated datasets and analysis codes are available online. We
also made the source codes of our scraper bots public, so that researchers
interested in extending this work can easily modify these bots as they need and
prepare their own up-to-date datasets.
","[{'version': 'v1', 'created': 'Wed, 13 Oct 2021 21:20:20 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Dec 2021 10:31:52 GMT'}]",2021-12-08,"[['Sharma', 'Arnab Sen', ''], ['Roy', 'Tirtha', ''], ['Rifat', 'Sadique Ahmmod', ''], ['Mridul', 'Maruf Ahmed', '']]","['Movie Dataset', 'Revenue Prediction', 'Statistical Analysis', 'Star Power', 'Ordinal Classification']"
11340,2004.03333,Haotong Qin,"Haotong Qin, Ruihao Gong, Xianglong Liu, Xiao Bai, Jingkuan Song, Nicu
  Sebe",Binary Neural Networks: A Survey,,Pattern Recognition (2020) 107281,10.1016/j.patcog.2020.107281,,cs.NE cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The binary neural network, largely saving the storage and computation, serves
as a promising technique for deploying deep models on resource-limited devices.
However, the binarization inevitably causes severe information loss, and even
worse, its discontinuity brings difficulty to the optimization of the deep
network. To address these issues, a variety of algorithms have been proposed,
and achieved satisfying progress in recent years. In this paper, we present a
comprehensive survey of these algorithms, mainly categorized into the native
solutions directly conducting binarization, and the optimized ones using
techniques like minimizing the quantization error, improving the network loss
function, and reducing the gradient error. We also investigate other practical
aspects of binary neural networks such as the hardware-friendly design and the
training tricks. Then, we give the evaluation and discussions on different
tasks, including image classification, object detection and semantic
segmentation. Finally, the challenges that may be faced in future research are
prospected.
","[{'version': 'v1', 'created': 'Tue, 31 Mar 2020 16:47:20 GMT'}]",2020-04-08,"[['Qin', 'Haotong', ''], ['Gong', 'Ruihao', ''], ['Liu', 'Xianglong', ''], ['Bai', 'Xiao', ''], ['Song', 'Jingkuan', ''], ['Sebe', 'Nicu', '']]","['binary neural network', 'deep learning', 'model compression', 'network']"
11341,1707.01162,Fei Shu,"Wei Quan, Bikun Chen, Fei Shu","Publish or impoverish: An investigation of the monetary reward system of
  science in China (1999-2016)",,"Aslib Journal of Information Management, 69(5), 1-18 (2017)",10.1108/AJIM-01-2017-0014,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose: The purpose of this study is to present the landscape of the
cash-per-publication reward policy in China and reveal its trend since the late
1990s.
  Design/methodology/approach: This study is based on the analysis of 168
university documents regarding the cash-per-publication reward policy at 100
Chinese universities.
  Findings: Chinese universities offer cash rewards from 30 to 165,000 USD for
papers published in journals indexed by Web of Science (WoS), and the average
reward amount has been increasing for the past 10 years.
  Originality/value: The cash-per-publication reward policy in China has never
been systematically studied and investigated before except for in some case
studies. This is the first paper that reveals the landscape of the
cash-per-publication reward policy in China.
","[{'version': 'v1', 'created': 'Tue, 4 Jul 2017 21:46:35 GMT'}]",2017-08-30,"[['Quan', 'Wei', ''], ['Chen', 'Bikun', ''], ['Shu', 'Fei', '']]","['China', 'monetary reward', 'cash-per-publication', 'Chinese university', 'journal publication', 'Web of Science Paper type Research paper']"
11342,1909.04823,Haidong Rong,"Haidong Rong, Yangzihao Wang, Feihu Zhou, Junjie Zhai, Haiyang Wu, Rui
  Lan, Fan Li, Han Zhang, Yuekui Yang, Zhenyu Guo, Di Wang","Distributed Equivalent Substitution Training for Large-Scale Recommender
  Systems","Accepted by SIGIR '2020. Proceedings of the 43rd International ACM
  SIGIR Conference on Research and Development in Information Retrieval. 2020",,10.1145/3397271.3401113,,cs.LG cs.IR stat.ML,http://creativecommons.org/licenses/by/4.0/,"  We present Distributed Equivalent Substitution (DES) training, a novel
distributed training framework for large-scale recommender systems with dynamic
sparse features. DES introduces fully synchronous training to large-scale
recommendation system for the first time by reducing communication, thus making
the training of commercial recommender systems converge faster and reach better
CTR. DES requires much less communication by substituting the weights-rich
operators with the computationally equivalent sub-operators and aggregating
partial results instead of transmitting the huge sparse weights directly
through the network. Due to the use of synchronous training on large-scale Deep
Learning Recommendation Models (DLRMs), DES achieves higher AUC(Area Under
ROC). We successfully apply DES training on multiple popular DLRMs of
industrial scenarios. Experiments show that our implementation outperforms the
state-of-the-art PS-based training framework, achieving up to 68.7%
communication savings and higher throughput compared to other PS-based
recommender systems.
","[{'version': 'v1', 'created': 'Tue, 10 Sep 2019 13:16:26 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Feb 2020 13:38:06 GMT'}, {'version': 'v3', 'created': 'Thu, 23 Apr 2020 12:17:32 GMT'}, {'version': 'v4', 'created': 'Thu, 28 May 2020 10:19:28 GMT'}, {'version': 'v5', 'created': 'Sat, 30 May 2020 07:28:00 GMT'}]",2020-06-02,"[['Rong', 'Haidong', ''], ['Wang', 'Yangzihao', ''], ['Zhou', 'Feihu', ''], ['Zhai', 'Junjie', ''], ['Wu', 'Haiyang', ''], ['Lan', 'Rui', ''], ['Li', 'Fan', ''], ['Zhang', 'Han', ''], ['Yang', 'Yuekui', ''], ['Guo', 'Zhenyu', ''], ['Wang', 'Di', '']]","['recommender systems', 'ranking systems', 'dynamic sparse features', 'synchronous training']"
11343,2009.01554,Dilip Jagadeeshwarswamy Hiremath,"Dilip J. Hiremath, Martin Claus, Wilhelm Hasselbring, Willi Rath","Automated identification of metamorphic test scenarios for an
  ocean-modeling application","Shot paper:2 pages, 2020 IEEE International Conference On Artificial
  Intelligence Testing (AITest)",,10.1109/AITEST49225.2020.00016,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Metamorphic testing seeks to validate software in the absence of test
oracles. Our application domain is ocean modeling, where test oracles often do
not exist, but where symmetries of the simulated physical systems are known. In
this short paper we present work in progress for automated generation of
metamorphic test scenarios using machine learning. Metamorphic testing may be
expressed as f(g(X))=h(f(X)) with f being the application under test, with
input data X, and with the metamorphic relation (g, h). Automatically generated
metamorphic relations can be used for constructing regression tests, and for
comparing different versions of the same software application. Here, we
restrict to h being the identity map. Then, the task of constructing tests
means finding different g which we tackle using machine learning algorithms.
These algorithms typically minimize a cost function. As one possible g is
already known to be the identity map, for finding a second possible g, we
construct the cost function to minimize for g being a metamorphic relation and
to penalize for g being the identity map. After identifying the first
metamorphic relation, the procedure is repeated with a cost function rewarding
g that are orthogonal to previously found metamorphic relations. For
experimental evaluation, two implementations of an ocean-modeling application
will be subjected to the proposed method with the objective of presenting the
use of metamorphic relations to test the implementations of the applications.
","[{'version': 'v1', 'created': 'Thu, 3 Sep 2020 10:03:56 GMT'}]",2020-09-04,"[['Hiremath', 'Dilip J.', ''], ['Claus', 'Martin', ''], ['Hasselbring', 'Wilhelm', ''], ['Rath', 'Willi', '']]","['Metamorphic testing', 'Ocean-modeling applicationtesting', 'Oracle problem', 'Metamorphic relation', 'Test case generation', 'Software testing']"
11344,2206.03719,Nick Brown,"Mark Klaisoongnoen, Nick Brown, Oliver Thomson Brown","Low-power option Greeks: Efficiency-driven market risk analysis using
  FPGAs","Extended preprint of paper accepted to The International Symposium on
  Highly Efficient Accelerators and Reconfigurable Technologies (HEART 2022)","In International Symposium on Highly-Efficient Accelerators and
  Reconfigurable Technologies (HEART2022). Association for Computing Machinery,
  New York, NY, USA, 95 to 101",10.1145/3535044.3535059,,cs.DC cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quantitative finance is the use of mathematical models to analyse financial
markets and securities. Typically requiring significant amounts of computation,
an important question is the role that novel architectures can play in
accelerating these models. In this paper we explore the acceleration of the
industry standard Securities Technology Analysis Center's (STAC) derivatives
risk analysis benchmark STAC-A2\texttrademark{} by porting the Heston
stochastic volatility model and Longstaff and Schwartz path reduction onto a
Xilinx Alveo U280 FPGA with a focus on efficiency-driven computing.
  Describing in detail the steps undertaken to optimise the algorithm for the
FPGA, we then leverage the flexibility provided by the reconfigurable
architecture to explore choices around numerical precision and representation.
Insights gained are then exploited in our final performance and energy
measurements, where for the efficiency improvement metric we achieve between an
8 times and 185 times improvement on the FPGA compared to two 24-core Intel
Xeon Platinum CPUs. The result of this work is not only a show-case for the
market risk analysis workload on FPGAs, but furthermore a set of efficiency
driven techniques and lessons learnt that can be applied to quantitative
finance and computational workloads on reconfigurable architectures more
generally.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2022 07:42:17 GMT'}]",2022-06-22,"[['Klaisoongnoen', 'Mark', ''], ['Brown', 'Nick', ''], ['Brown', 'Oliver Thomson', '']]","['Market risk analysis', 'efficiency-driven computing', 'STAC-A2', 'FPGAs', 'reconfigurable architectures', 'option Greeks']"
11345,2201.00594,Ilja Behnke,"Ilja Behnke, Philipp Wiesner, Robert Danicki, Lauritz Thamsen",A Priority-Aware Multiqueue NIC Design,The 37th ACM/SIGAPP Symposium on Applied Computing (SAC '22),,10.1145/3477314.3507165,,cs.NI cs.AR cs.DC cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Low-level embedded systems are used to control cyber-phyiscal systems in
industrial and autonomous applications. They need to meet hard real-time
requirements as unanticipated controller delays on moving machines can have
devastating effects. Modern developments such as the industrial Internet of
Things and autonomous machines require these devices to connect to large IP
networks. Since Network Interface Controllers (NICs) trigger interrupts for
incoming packets, real-time embedded systems are subject to unpredictable
preemptions when connected to such networks.
  In this work, we propose a priority-aware NIC design to moderate
network-generated interrupts by mapping IP flows to processes and based on
that, consolidates their packets into different queues. These queues apply
priority-dependent interrupt moderation. First experimental evaluations show
that 93% of interrupts can be saved leading to an 80% decrease of processing
delay of critical tasks in the configurations investigated.
","[{'version': 'v1', 'created': 'Mon, 3 Jan 2022 11:39:46 GMT'}]",2022-01-04,"[['Behnke', 'Ilja', ''], ['Wiesner', 'Philipp', ''], ['Danicki', 'Robert', ''], ['Thamsen', 'Lauritz', '']]","['Embedded systems', 'real-time operating systems', 'network interfacecontroller', 'internet of things', 'cyber-physical systems']"
11346,2011.09239,Christian Janiesch,"Christian Janiesch, Marcus Fischer, Axel Winkelmann, Valentin Nentwich","Specifying Autonomy in the Internet of Things: The Autonomy Model and
  Notation",Authors Accepted Manuscript,"Inf Syst E-Bus Manage 17, 159-194 (2019)",10.1007/s10257-018-0379-x,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Driven by digitization in society and industry, automating behavior in an
autonomous way substantially alters industrial value chains in the smart
service world. As processes are enhanced with sensor and actuator technology,
they become digitally interconnected and merge into an Internet of Things (IoT)
to form cyber-physical systems (CPS). Using these automated systems,
enterprises can improve the performance and quality of their operations.
However, currently it is neither feasible nor reasonable to equip any machine
with full autonomy when networking with other machines or people. It is
necessary to specify rules for machine behavior that also determine an adequate
degree of autonomy to realize the potential benefits of the IoT. Yet, there is
a lack of methodologies and guidelines to support the design and implementation
of machines as explicit autonomous agents such that many designs only consider
autonomy implicitly. To address this research gap, we perform a comprehensive
literature review to extract 12 requirements for the design of autonomous
agents in the IoT. We introduce a set of constitutive characteristics for
agents and introduce a classification framework for interactions in multi-agent
systems. We integrate our findings by developing a conceptual modeling language
consisting of a meta model and a notation that facilitates the specification
and design of autonomous agents within the IoT as well as CPS: the Autonomy
Model and Notation. We illustrate and discuss the approach and its limitations.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2020 12:24:27 GMT'}]",2020-11-19,"[['Janiesch', 'Christian', ''], ['Fischer', 'Marcus', ''], ['Winkelmann', 'Axel', ''], ['Nentwich', 'Valentin', '']]","['Autonomy', 'agent', 'Internet of Things', 'cyber-physical systems', 'conceptual modeling language', 'notation']"
11347,2111.10769,Nupur Choudhury,"Nupur Choudhury, Kandarpa Kumar Sarma, Chinmoy Kalita, Aradhana Misra","Design of an Novel Spectrum Sensing Scheme Based on Long Short-Term
  Memory and Experimental Validation",,INTERNATIONAL JOURNAL OF COMMUNICATIONS 2021,10.46300/9107.2021.15.6,,cs.IT cs.AI cs.LG eess.SP math.IT,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Spectrum sensing allows cognitive radio systems to detect relevant signals in
despite the presence of severe interference. Most of the existing spectrum
sensing techniques use a particular signal-noise model with certain assumptions
and derive certain detection performance. To deal with this uncertainty,
learning based approaches are being adopted and more recently deep learning
based tools have become popular. Here, we propose an approach of spectrum
sensing which is based on long short term memory (LSTM) which is a critical
element of deep learning networks (DLN). Use of LSTM facilitates implicit
feature learning from spectrum data. The DLN is trained using several features
and the performance of the proposed sensing technique is validated with the
help of an empirical testbed setup using Adalm Pluto. The testbed is trained to
acquire the primary signal of a real world radio broadcast taking place using
FM. Experimental data show that even at low signal to noise ratio, our approach
performs well in terms of detection and classification accuracies, as compared
to current spectrum sensing methods.
","[{'version': 'v1', 'created': 'Sun, 21 Nov 2021 08:51:48 GMT'}]",2021-12-07,"[['Choudhury', 'Nupur', ''], ['Sarma', 'Kandarpa Kumar', ''], ['Kalita', 'Chinmoy', ''], ['Misra', 'Aradhana', '']]","['Spectrum scarcity', 'spectrum sensing', 'cognitive']"
11348,1604.04337,Deepak Ghimire,"Deepak Ghimire, Sunghwan Jeong, Joonwhoan Lee, Sang Hyun Park","Facial expression recognition based on local region specific features
  and support vector machines","Facial expressions, Local representation, Appearance features,
  Geometric features, Support vector machines","Multimedia Tools and Applications, pp 1-19, Online: 16 March 2016",10.1007/s11042-016-3418-y,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Facial expressions are one of the most powerful, natural and immediate means
for human being to communicate their emotions and intensions. Recognition of
facial expression has many applications including human-computer interaction,
cognitive science, human emotion analysis, personality development etc. In this
paper, we propose a new method for the recognition of facial expressions from
single image frame that uses combination of appearance and geometric features
with support vector machines classification. In general, appearance features
for the recognition of facial expressions are computed by dividing face region
into regular grid (holistic representation). But, in this paper we extracted
region specific appearance features by dividing the whole face region into
domain specific local regions. Geometric features are also extracted from
corresponding domain specific regions. In addition, important local regions are
determined by using incremental search approach which results in the reduction
of feature dimension and improvement in recognition accuracy. The results of
facial expressions recognition using features from domain specific regions are
also compared with the results obtained using holistic representation. The
performance of the proposed facial expression recognition system has been
validated on publicly available extended Cohn-Kanade (CK+) facial expression
data sets.
","[{'version': 'v1', 'created': 'Fri, 15 Apr 2016 02:27:21 GMT'}]",2016-04-18,"[['Ghimire', 'Deepak', ''], ['Jeong', 'Sunghwan', ''], ['Lee', 'Joonwhoan', ''], ['Park', 'Sang Hyun', '']]","['facial expressions', 'local representation', 'appearance features', 'geometric features', 'support']"
11349,2112.11071,Yasunobu Nohara PhD,"Yasunobu Nohara, Koutarou Matsumoto, Hidehisa Soejima and Naoki
  Nakashima","Explanation of Machine Learning Models Using Shapley Additive
  Explanation and Application for Real Data in Hospital",,"Computer Methods and Programs in Biomedicine, Volume 214, February
  2022, 106584",10.1016/j.cmpb.2021.106584,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When using machine learning techniques in decision-making processes, the
interpretability of the models is important. In the present paper, we adopted
the Shapley additive explanation (SHAP), which is based on fair profit
allocation among many stakeholders depending on their contribution, for
interpreting a gradient-boosting decision tree model using hospital data. For
better interpretability, we propose two novel techniques as follows: (1) a new
metric of feature importance using SHAP and (2) a technique termed feature
packing, which packs multiple similar features into one grouped feature to
allow an easier understanding of the model without reconstruction of the model.
We then compared the explanation results between the SHAP framework and
existing methods. In addition, we showed how the A/G ratio works as an
important prognostic factor for cerebral infarction using our hospital data and
proposed techniques.
","[{'version': 'v1', 'created': 'Tue, 21 Dec 2021 10:08:31 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Mar 2022 09:36:31 GMT'}]",2022-03-03,"[['Nohara', 'Yasunobu', ''], ['Matsumoto', 'Koutarou', ''], ['Soejima', 'Hidehisa', ''], ['Nakashima', 'Naoki', '']]","['Shapley additive explanation', 'machine learning', 'interpretability', 'feature importance', 'feature packing']"
11350,1911.03272,David Purser,"Marco Gaboardi, Kobbi Nissim and David Purser",The Complexity of Verifying Loop-Free Programs as Differentially Private,,"47th International Colloquium on Automata, Languages, and
  Programming (ICALP 2020). Volume 168 of LIPIcs, pages 129:1-129:17. Schloss
  Dagstuhl - Leibniz-Zentrum fur Informatik, 2020",10.4230/LIPIcs.ICALP.2020.129,,cs.CC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of verifying differential privacy for loop-free programs
with probabilistic choice. Programs in this class can be seen as randomized
Boolean circuits, which we will use as a formal model to answer two different
questions: first, deciding whether a program satisfies a prescribed level of
privacy; second, approximating the privacy parameters a program realizes. We
show that the problem of deciding whether a program satisfies
$\varepsilon$-differential privacy is $coNP^{\#P}$-complete. In fact, this is
the case when either the input domain or the output range of the program is
large. Further, we show that deciding whether a program is
$(\varepsilon,\delta)$-differentially private is $coNP^{\#P}$-hard, and in
$coNP^{\#P}$ for small output domains, but always in $coNP^{\#P^{\#P}}$.
Finally, we show that the problem of approximating the level of differential
privacy is both $NP$-hard and $coNP$-hard. These results complement previous
results by Murtagh and Vadhan showing that deciding the optimal composition of
differentially private components is $\#P$-complete, and that approximating the
optimal composition of differentially private components is in $P$.
","[{'version': 'v1', 'created': 'Fri, 8 Nov 2019 14:07:30 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Feb 2020 11:14:18 GMT'}, {'version': 'v3', 'created': 'Mon, 29 Jun 2020 10:20:51 GMT'}]",2020-06-30,"[['Gaboardi', 'Marco', ''], ['Nissim', 'Kobbi', ''], ['Purser', 'David', '']]","['differential privacy', 'program verification', 'probabilistic programs']"
11351,1908.06502,Khashayar Etemadi Someoliayi,"Mostafa Mahdieh, Seyed-Hassan Mirian-Hosseinabadi, Khashayar Etemadi,
  Ali Nosrati, Sajad Jalali","Incorporating fault-proneness estimations into coverage-based test case
  prioritization methods",,,10.1016/j.infsof.2020.106269,,cs.SE,http://creativecommons.org/publicdomain/zero/1.0/,"  Context: During the development process of a software program, regression
testing is used to ensure that the correct behavior of the software is retained
after updates to the source code. This regression testing becomes costly over
time as the number of test cases increases and it makes sense to prioritize
test cases in order to execute fault-detecting test cases as soon as possible.
There are many coverage-based test case prioritization (TCP) methods that only
use the code coverage data to prioritize test cases. By incorporating the
fault-proneness estimations of code units into the coverage-based TCP methods,
we can improve such techniques.
  Objective: In this paper, we aim to propose an approach which improves
coverage-based TCP methods by considering the fault-proneness distribution over
code units. Further, we present the results of an empirical study that shows
using our proposed approach significantly improves the additional strategy,
which is a widely used coverage-based TCP method.
  Method: The approach presented in this study uses the bug history of the
software in order to introduce a defect prediction method to learn a neural
network model. This model is then used to estimate fault-proneness of each area
of the source code and then the estimations are incorporated into
coverage-based TCP methods. Our proposed approach is a general idea that can be
applied to many coverage-based methods, such as the additional and total TCP
methods.
  Results: The proposed methods are evaluated on datasets collected from the
development history of five real-world projects including 357 versions in
total. The experiments show that using an appropriate bug history can improve
coverage-based TCP methods.
","[{'version': 'v1', 'created': 'Sun, 18 Aug 2019 19:05:49 GMT'}, {'version': 'v2', 'created': 'Sun, 16 Feb 2020 20:46:05 GMT'}]",2020-02-18,"[['Mahdieh', 'Mostafa', ''], ['Mirian-Hosseinabadi', 'Seyed-Hassan', ''], ['Etemadi', 'Khashayar', ''], ['Nosrati', 'Ali', ''], ['Jalali', 'Sajad', '']]","['Regression testing', 'Test case prioritization', 'Defect prediction', 'Machine learning', 'Bug history']"
11352,1904.10654,Yue Cheng,"Xuan Zhu, Yue Cheng, Jinye Peng, Rongzhi Wang, Mingnan Le, Xin Liu","Super-Resolved Image Perceptual Quality Improvement via Multi-Feature
  Discriminators","18 pages, 10 figures, 6 tables",,10.1117/1.JEI.29.1.013017,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generative adversarial network (GAN) for image super-resolution (SR) has
attracted enormous interests in recent years. However, the GAN-based SR methods
only use image discriminator to distinguish SR images and high-resolution (HR)
images. Image discriminator fails to discriminate images accurately since image
features cannot be fully expressed. In this paper, we design a new GAN-based SR
framework GAN-IMC which includes generator, image discriminator, morphological
component discriminator and color discriminator. The combination of multiple
feature discriminators improves the accuracy of image discrimination.
Adversarial training between the generator and multi-feature discriminators
forces SR images to converge with HR images in terms of data and features
distribution. Moreover, in some cases, feature enhancement of salient regions
is also worth considering. GAN-IMC is further optimized by weighted content
loss (GAN-IMCW), which effectively restores and enhances salient regions in SR
images. The effectiveness and robustness of our method are confirmed by
extensive experiments on public datasets. Compared with state-of-the-art
methods, the proposed method not only achieves competitive Perceptual Index
(PI) and Natural Image Quality Evaluator (NIQE) values but also obtains
pleasant visual perception in image edge, texture, color and salient regions.
","[{'version': 'v1', 'created': 'Wed, 24 Apr 2019 06:28:57 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Aug 2019 07:53:07 GMT'}]",2020-03-18,"[['Zhu', 'Xuan', ''], ['Cheng', 'Yue', ''], ['Peng', 'Jinye', ''], ['Wang', 'Rongzhi', ''], ['Le', 'Mingnan', ''], ['Liu', 'Xin', '']]","['image super-resolution', 'multi-feature discriminators', 'perceptual quality', 'weighted content loss']"
11353,1910.13346,Changxi Liu,"Changxi Liu and Hailong Yang and Xu Liu and Zhongzhi Luan and Depei
  Qian","Intelligent-Unrolling: Exploiting Regular Patterns in Irregular
  Applications",,,10.1145/3545008.3545042,,cs.DC cs.PF cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern optimizing compilers are able to exploit memory access or computation
patterns to generate vectorization codes. However, such patterns in irregular
applications are unknown until runtime due to the input dependence. Thus,
either compiler's static optimization or profile-guided optimization based on
specific inputs cannot predict the patterns for any common input, which leads
to suboptimal code generation. To address this challenge, we develop
Intelligent-Unroll, a framework to automatically optimize irregular
applications with vectorization. Intelligent-Unroll allows the users to depict
the computation task using \textit{code seed} with the memory access and
computation patterns represented in \textit{feature table} and
\textit{information-code tree}, and generates highly efficient codes.
Furthermore, Intelligent-Unroll employs several novel optimization techniques
to optimize reduction operations and gather/scatter instructions. We evaluate
Intelligent-Unroll with sparse matrix-vector multiplication (SpMV) and graph
applications. Experimental results show that Intelligent-Unroll is able to
generate more efficient vectorization codes compared to the state-of-the-art
implementations.
","[{'version': 'v1', 'created': 'Thu, 24 Oct 2019 04:23:49 GMT'}]",2022-10-26,"[['Liu', 'Changxi', ''], ['Yang', 'Hailong', ''], ['Liu', 'Xu', ''], ['Luan', 'Zhongzhi', ''], ['Qian', 'Depei', '']]","['irregular application', 'data access and instruction patern', 'code optimization']"
11354,1908.04832,Kevin Bowden,"Kevin K. Bowden, Jiaqi Wu, Wen Cui, Juraj Juraska, Vrindavan Harrison,
  Brian Schwarzmann, Nicholas Santer, Steve Whittaker, Marilyn Walker","Entertaining and Opinionated but Too Controlling: A Large-Scale User
  Study of an Open Domain Alexa Prize System","To appear in 1st International Conference on Conversational User
  Interfaces (CUI 2019)",,10.1145/3342775.3342792,,cs.CL cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Conversational systems typically focus on functional tasks such as scheduling
appointments or creating todo lists. Instead we design and evaluate SlugBot
(SB), one of 8 semifinalists in the 2018 AlexaPrize, whose goal is to support
casual open-domain social inter-action. This novel application requires both
broad topic coverage and engaging interactive skills. We developed a new
technical approach to meet this demanding situation by crowd-sourcing novel
content and introducing playful conversational strategies based on storytelling
and games. We collected over 10,000 conversations during August 2018 as part of
the Alexa Prize competition. We also conducted an in-lab follow-up qualitative
evaluation. Over-all users found SB moderately engaging; conversations averaged
3.6 minutes and involved 26 user turns. However, users reacted very differently
to different conversation subtypes. Storytelling and games were evaluated
positively; these were seen as entertaining with predictable interactive
structure. They also led users to impute personality and intelligence to SB. In
contrast, search and general Chit-Chat induced coverage problems; here users
found it hard to infer what topics SB could understand, with these
conversations seen as being too system-driven. Theoretical and design
implications suggest a move away from conversational systems that simply
provide factual information. Future systems should be designed to have their
own opinions with personal stories to share, and SB provides an example of how
we might achieve this.
","[{'version': 'v1', 'created': 'Tue, 13 Aug 2019 19:10:36 GMT'}]",2019-08-15,"[['Bowden', 'Kevin K.', ''], ['Wu', 'Jiaqi', ''], ['Cui', 'Wen', ''], ['Juraska', 'Juraj', ''], ['Harrison', 'Vrindavan', ''], ['Schwarzmann', 'Brian', ''], ['Santer', 'Nicholas', ''], ['Whittaker', 'Steve', ''], ['Walker', 'Marilyn', '']]","['Conversational Interfaces', 'Open-Domain', 'Field Trial']"
11355,2002.12364,Jonathan Baxter,Jonathan Baxter,Theoretical Models of Learning to Learn,arXiv admin note: text overlap with arXiv:1106.0245,"in Learning to Learn (edited by Sebastian Thrun and Lorien Pratt),
  159-179 (1998)",10.1007/978-1-4615-5529-2,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Machine can only learn if it is biased in some way. Typically the bias is
supplied by hand, for example through the choice of an appropriate set of
features. However, if the learning machine is embedded within an {\em
environment} of related tasks, then it can {\em learn} its own bias by learning
sufficiently many tasks from the environment. In this paper two models of bias
learning (or equivalently, learning to learn) are introduced and the main
theoretical results presented. The first model is a PAC-type model based on
empirical process theory, while the second is a hierarchical Bayes model.
","[{'version': 'v1', 'created': 'Thu, 27 Feb 2020 13:35:26 GMT'}]",2020-03-02,"[['Baxter', 'Jonathan', '']]","['Learning to Learn', 'Bias Learning', 'Empirical Processes', 'Hierarchical Bayes']"
11356,2106.05022,Stefanos Laskaridis,"Stefanos Laskaridis, Alexandros Kouris, Nicholas D. Lane","Adaptive Inference through Early-Exit Networks: Design, Challenges and
  Directions","Accepted at the 5th Annual International Workshop on Embedded and
  Mobile Deep Learning (EMDL), 2021",,10.1145/3469116.3470012,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  DNNs are becoming less and less over-parametrised due to recent advances in
efficient model design, through careful hand-crafted or NAS-based methods.
Relying on the fact that not all inputs require the same amount of computation
to yield a confident prediction, adaptive inference is gaining attention as a
prominent approach for pushing the limits of efficient deployment.
Particularly, early-exit networks comprise an emerging direction for tailoring
the computation depth of each input sample at runtime, offering complementary
performance gains to other efficiency optimisations. In this paper, we
decompose the design methodology of early-exit networks to its key components
and survey the recent advances in each one of them. We also position
early-exiting against other efficient inference solutions and provide our
insights on the current challenges and most promising future directions for
research in the field.
","[{'version': 'v1', 'created': 'Wed, 9 Jun 2021 12:33:02 GMT'}]",2021-06-10,"[['Laskaridis', 'Stefanos', ''], ['Kouris', 'Alexandros', ''], ['Lane', 'Nicholas D.', '']]","['Early-exit networks', 'Dynamic inference', 'Adaptive computing', 'Deeplearning', 'Mobile systems']"
11357,1904.06893,Muhammad Ali Siddiqi,Muhammad Ali Siddiqi and Christos Strydis,Towards Realistic Battery-DoS Protection of Implantable Medical Devices,"8 pages, 8 figures, Proceedings of the 16th conference on Computing
  Frontiers (CF '19), April 30-May 2, 2019, Alghero, Italy",,10.1145/3310273.3321555,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern Implantable Medical Devices (IMDs) feature wireless connectivity,
which makes them vulnerable to security attacks. Particular to IMDs is the
battery Denial-of-Service attack whereby attackers aim to fully deplete the
battery by occupying the IMD with continuous authentication requests.
Zero-Power Defense (ZPD) based on energy harvesting is known to be an excellent
protection against these attacks. This paper establishes essential design
specifications for employing ZPD techniques in IMDs, offers a critical review
of ZPD techniques found in literature and, subsequently, gives crucial
recommendations for developing comprehensive ZPD solutions.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2019 07:48:21 GMT'}]",2019-04-16,"[['Siddiqi', 'Muhammad Ali', ''], ['Strydis', 'Christos', '']]","['Implantable medical device', 'IMD', 'energy harvesting', 'wireless powertransfer', 'zero-power defense', 'authentication protocol', 'denial-ofservice attack', 'battery DoS']"
11358,2012.13635,Samy Badreddine,"Samy Badreddine and Artur d'Avila Garcez and Luciano Serafini and
  Michael Spranger",Logic Tensor Networks,"68 pages, 28 figures, 6 tables","Artificial Intelligence, Volume 303, February 2022, 103649",10.1016/j.artint.2021.103649,,cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Artificial Intelligence agents are required to learn from their surroundings
and to reason about the knowledge that has been learned in order to make
decisions. While state-of-the-art learning from data typically uses
sub-symbolic distributed representations, reasoning is normally useful at a
higher level of abstraction with the use of a first-order logic language for
knowledge representation. As a result, attempts at combining symbolic AI and
neural computation into neural-symbolic systems have been on the increase. In
this paper, we present Logic Tensor Networks (LTN), a neurosymbolic formalism
and computational model that supports learning and reasoning through the
introduction of a many-valued, end-to-end differentiable first-order logic
called Real Logic as a representation language for deep learning. We show that
LTN provides a uniform language for the specification and the computation of
several AI tasks such as data clustering, multi-label classification,
relational learning, query answering, semi-supervised learning, regression and
embedding learning. We implement and illustrate each of the above tasks with a
number of simple explanatory examples using TensorFlow 2. Keywords:
Neurosymbolic AI, Deep Learning and Reasoning, Many-valued Logic.
","[{'version': 'v1', 'created': 'Fri, 25 Dec 2020 22:30:18 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Jan 2021 07:37:47 GMT'}, {'version': 'v3', 'created': 'Sun, 17 Jan 2021 01:28:44 GMT'}, {'version': 'v4', 'created': 'Thu, 23 Dec 2021 04:14:25 GMT'}]",2021-12-24,"[['Badreddine', 'Samy', ''], ['Garcez', ""Artur d'Avila"", ''], ['Serafini', 'Luciano', ''], ['Spranger', 'Michael', '']]","['Neurosymbolic AI', 'Deep Learning and Reasoning', 'Many-valued Logics']"
11359,2205.13795,Xu Zhao,"Xu Zhao, Yi Ren, Ying Du, Shenzheng Zhang, Nian Wang","Improving Item Cold-start Recommendation via Model-agnostic Conditional
  Variational Autoencoder","6 pages, 2 figures, accepted as SIGIR 2022 short paper",,10.1145/3477495.3531902,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Embedding & MLP has become a paradigm for modern large-scale recommendation
system. However, this paradigm suffers from the cold-start problem which will
seriously compromise the ecological health of recommendation systems. This
paper attempts to tackle the item cold-start problem by generating enhanced
warmed-up ID embeddings for cold items with historical data and limited
interaction records. From the aspect of industrial practice, we mainly focus on
the following three points of item cold-start: 1) How to conduct cold-start
without additional data requirements and make strategy easy to be deployed in
online recommendation scenarios. 2) How to leverage both historical records and
constantly emerging interaction data of new items. 3) How to model the
relationship between item ID and side information stably from interaction data.
To address these problems, we propose a model-agnostic Conditional Variational
Autoencoder based Recommendation(CVAR) framework with some advantages including
compatibility on various backbones, no extra requirements for data, utilization
of both historical data and recent emerging interactions. CVAR uses latent
variables to learn a distribution over item side information and generates
desirable item ID embeddings using a conditional decoder. The proposed method
is evaluated by extensive offline experiments on public datasets and online A/B
tests on Tencent News recommendation platform, which further illustrate the
advantages and robustness of CVAR.
","[{'version': 'v1', 'created': 'Fri, 27 May 2022 07:11:46 GMT'}]",2022-05-30,"[['Zhao', 'Xu', ''], ['Ren', 'Yi', ''], ['Du', 'Ying', ''], ['Zhang', 'Shenzheng', ''], ['Wang', 'Nian', '']]","['Cold-Start Recommendation', 'Conditional Variational Autoencoder', 'Item ID embedding']"
11360,2005.09046,Kevin Moran,"Kevin Moran, David N. Palacio, Carlos Bernal-C\'ardenas, Daniel
  McCrystal, Denys Poshyvanyk, Chris Shenefiel, Jeff Johnson","Improving the Effectiveness of Traceability Link Recovery using
  Hierarchical Bayesian Networks","Accepted in the Proceedings of the 42nd International Conference on
  Software Engineering (ICSE'20), 13 pages",,10.1145/3377811.3380418,,cs.SE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traceability is a fundamental component of the modern software development
process that helps to ensure properly functioning, secure programs. Due to the
high cost of manually establishing trace links, researchers have developed
automated approaches that draw relationships between pairs of textual software
artifacts using similarity measures. However, the effectiveness of such
techniques are often limited as they only utilize a single measure of artifact
similarity and cannot simultaneously model (implicit and explicit)
relationships across groups of diverse development artifacts.
  In this paper, we illustrate how these limitations can be overcome through
the use of a tailored probabilistic model. To this end, we design and implement
a HierarchiCal PrObabilistic Model for SoftwarE Traceability (Comet) that is
able to infer candidate trace links. Comet is capable of modeling relationships
between artifacts by combining the complementary observational prowess of
multiple measures of textual similarity. Additionally, our model can
holistically incorporate information from a diverse set of sources, including
developer feedback and transitive (often implicit) relationships among groups
of software artifacts, to improve inference accuracy. We conduct a
comprehensive empirical evaluation of Comet that illustrates an improvement
over a set of optimally configured baselines of $\approx$14% in the best case
and $\approx$5% across all subjects in terms of average precision. The
comparative effectiveness of Comet in practice, where optimal configuration is
typically not possible, is likely to be higher. Finally, we illustrate Comets
potential for practical applicability in a survey with developers from Cisco
Systems who used a prototype Comet Jenkins plugin.
","[{'version': 'v1', 'created': 'Mon, 18 May 2020 19:38:29 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Apr 2022 15:17:25 GMT'}]",2022-04-12,"[['Moran', 'Kevin', ''], ['Palacio', 'David N.', ''], ['Bernal-Cárdenas', 'Carlos', ''], ['McCrystal', 'Daniel', ''], ['Poshyvanyk', 'Denys', ''], ['Shenefiel', 'Chris', ''], ['Johnson', 'Jeff', '']]","['Software Traceability', 'Probabilistic Modeling', 'Information Retrieval']"
11361,2103.14522,Philipp Mayr,"Fakhri Momeni, Philipp Mayr, Nicholas Fraser, Isabella Peters","What happens when a journal converts to Open Access? A bibliometric
  analysis","16 pages, 5 figures, Accepted in Scientometrics",,10.1007/s11192-021-03972-5,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, increased stakeholder pressure to transition research to
Open Access has led to many journals converting, or 'flipping', from a closed
access (CA) to an open access (OA) publishing model. Changing the publishing
model can influence the decision of authors to submit their papers to a
journal, and increased article accessibility may influence citation behaviour.
In this paper we aimed to understand how flipping a journal to an OA model
influences the journal's future publication volumes and citation impact. We
analysed two independent sets of journals that had flipped to an OA model, one
from the Directory of Open Access Journals (DOAJ) and one from the Open Access
Directory (OAD), and compared their development with two respective control
groups of similar journals. For bibliometric analyses, journals were matched to
the Scopus database. We assessed changes in the number of articles published
over time, as well as two citation metrics at the journal and article level:
the normalised impact factor (IF) and the average relative citations (ARC),
respectively. Our results show that overall, journals that flipped to an OA
model increased their publication output compared to journals that remained
closed. Mean normalised IF and ARC also generally increased following the flip
to an OA model, at a greater rate than was observed in the control groups.
However, the changes appear to vary largely by scientific discipline. Overall,
these results indicate that flipping to an OA publishing model can bring
positive changes to a journal.
","[{'version': 'v1', 'created': 'Fri, 26 Mar 2021 15:20:29 GMT'}]",2021-05-05,"[['Momeni', 'Fakhri', ''], ['Mayr', 'Philipp', ''], ['Fraser', 'Nicholas', ''], ['Peters', 'Isabella', '']]","['Open Access Publishing', 'Scholarly Communication', 'Citation Analysis', 'Scholarly Journals', 'Journal Publishing Models']"
11362,2211.10517,The Anh Han,"Theodor Cimpeanu, Alessandro Di Stefano, Cedric Perret and The Anh Han",Social Diversity Reduces the Complexity and Cost of Fostering Fairness,,,10.1016/j.chaos.2022.113051,,cs.MA cs.AI math.DS math.OC nlin.AO,http://creativecommons.org/licenses/by/4.0/,"  Institutions and investors are constantly faced with the challenge of
appropriately distributing endowments. No budget is limitless and optimising
overall spending without sacrificing positive outcomes has been approached and
resolved using several heuristics. To date, prior works have failed to consider
how to encourage fairness in a population where social diversity is ubiquitous,
and in which investors can only partially observe the population. Herein, by
incorporating social diversity in the Ultimatum game through heterogeneous
graphs, we investigate the effects of several interference mechanisms which
assume incomplete information and flexible standards of fairness. We quantify
the role of diversity and show how it reduces the need for information
gathering, allowing us to relax a strict, costly interference process.
Furthermore, we find that the influence of certain individuals, expressed by
different network centrality measures, can be exploited to further reduce
spending if minimal fairness requirements are lowered. Our results indicate
that diversity changes and opens up novel mechanisms available to institutions
wishing to promote fairness. Overall, our analysis provides novel insights to
guide institutional policies in socially diverse complex systems.
","[{'version': 'v1', 'created': 'Fri, 18 Nov 2022 21:58:35 GMT'}]",2023-01-25,"[['Cimpeanu', 'Theodor', ''], ['Di Stefano', 'Alessandro', ''], ['Perret', 'Cedric', ''], ['Han', 'The Anh', '']]","['fairness', 'cost efficiency', 'decision making', 'ultimatum game', 'social diversity', 'evolutionary game theory']"
11363,2202.13114,Hoang Lam Nguyen,"Hoang Lam Nguyen, Lars Grunske",BeDivFuzz: Integrating Behavioral Diversity into Generator-based Fuzzing,"To appear in the proceedings of the 44th International Conference on
  Software Engineering (ICSE 2022)",,10.1145/3510003.3510182,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A popular metric to evaluate the performance of fuzzers is branch coverage.
However, we argue that focusing solely on covering many different branches
(i.e., the richness) is not sufficient since the majority of the covered
branches may have been exercised only once, which does not inspire a high
confidence in the reliability of the covered code. Instead, the distribution of
the executed branches (i.e., the evenness) should also be considered. That is,
behavioral diversity is only given if the generated inputs not only trigger
many different branches, but also trigger them evenly often with diverse
inputs. We introduce BeDivFuzz, a feedback-driven fuzzing technique for
generator-based fuzzers. BeDivFuzz distinguishes between structure-preserving
and structure-changing mutations in the space of syntactically valid inputs,
and biases its mutation strategy towards validity and behavioral diversity
based on the received program feedback. We have evaluated BeDivFuzz on Ant,
Maven, Rhino, Closure, Nashorn, and Tomcat. The results show that BeDivFuzz
achieves better behavioral diversity than the state of the art, measured by
established biodiversity metrics, namely the Hill numbers, from the field of
ecology.
","[{'version': 'v1', 'created': 'Sat, 26 Feb 2022 11:03:35 GMT'}]",2022-03-01,"[['Nguyen', 'Hoang Lam', ''], ['Grunske', 'Lars', '']]","['Structure-aware fuzzing', 'behavioral diversity', 'random testing']"
11364,1909.04029,Daniel Drzisga,"Daniel Drzisga, Brendan Keith, Barbara Wohlmuth","The surrogate matrix methodology: A reference implementation for
  low-cost assembly in isogeometric analysis",,"MethodsX, 7:100813 (2020)",10.1016/j.mex.2020.100813,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A reference implementation of a new method in isogeometric analysis (IGA) is
presented. It delivers low-cost variable-scale approximations (surrogates) of
the matrices which IGA conventionally requires to be computed by element-scale
quadrature. To generate surrogate matrices, quadrature must only be performed
on a fraction of the elements in the computational domain. In this way,
quadrature determines only a subset of the entries in the final matrix. The
remaining matrix entries are computed by a simple B-spline interpolation
procedure. We present the modifications and extensions required for a reference
implementation in the open-source IGA software library GeoPDEs. The exposition
is fashioned to help facilitate similar modifications in other contemporary
software libraries.
","[{'version': 'v1', 'created': 'Sun, 8 Sep 2019 06:42:21 GMT'}]",2020-04-14,"[['Drzisga', 'Daniel', ''], ['Keith', 'Brendan', ''], ['Wohlmuth', 'Barbara', '']]","['Surrogate numerical methods', 'isogeometric analysis', 'high order', 'reference implementation']"
11365,1402.7015,Fabian Pedregosa,"Fabian Pedregosa (INRIA Saclay - Ile de France, INRIA Paris -
  Rocquencourt), Michael Eickenberg (INRIA Saclay - Ile de France, LNAO),
  Philippe Ciuciu (INRIA Saclay - Ile de France, NEUROSPIN), Bertrand Thirion
  (INRIA Saclay - Ile de France, NEUROSPIN), Alexandre Gramfort (LTCI)",Data-driven HRF estimation for encoding and decoding models,appears in NeuroImage (2015),,10.1016/j.neuroimage.2014.09.060,,cs.CE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the common usage of a canonical, data-independent, hemodynamic
response function (HRF), it is known that the shape of the HRF varies across
brain regions and subjects. This suggests that a data-driven estimation of this
function could lead to more statistical power when modeling BOLD fMRI data.
However, unconstrained estimation of the HRF can yield highly unstable results
when the number of free parameters is large. We develop a method for the joint
estimation of activation and HRF using a rank constraint causing the estimated
HRF to be equal across events/conditions, yet permitting it to be different
across voxels. Model estimation leads to an optimization problem that we
propose to solve with an efficient quasi-Newton method exploiting fast gradient
computations. This model, called GLM with Rank-1 constraint (R1-GLM), can be
extended to the setting of GLM with separate designs which has been shown to
improve decoding accuracy in brain activity decoding experiments. We compare 10
different HRF modeling methods in terms of encoding and decoding score in two
different datasets. Our results show that the R1-GLM model significantly
outperforms competing methods in both encoding and decoding settings,
positioning it as an attractive method both from the points of view of accuracy
and computational efficiency.
","[{'version': 'v1', 'created': 'Thu, 27 Feb 2014 18:50:58 GMT'}, {'version': 'v2', 'created': 'Sun, 6 Apr 2014 06:11:17 GMT'}, {'version': 'v3', 'created': 'Tue, 15 Jul 2014 11:14:00 GMT'}, {'version': 'v4', 'created': 'Mon, 6 Oct 2014 16:39:55 GMT'}, {'version': 'v5', 'created': 'Fri, 31 Oct 2014 13:47:01 GMT'}, {'version': 'v6', 'created': 'Fri, 7 Nov 2014 11:27:19 GMT'}]",2014-11-10,"[['Pedregosa', 'Fabian', '', 'INRIA Saclay - Ile de France, INRIA Paris -\n  Rocquencourt'], ['Eickenberg', 'Michael', '', 'INRIA Saclay - Ile de France, LNAO'], ['Ciuciu', 'Philippe', '', 'INRIA Saclay - Ile de France, NEUROSPIN'], ['Thirion', 'Bertrand', '', 'INRIA Saclay - Ile de France, NEUROSPIN'], ['Gramfort', 'Alexandre', '', 'LTCI']]","['Functional MRI (fMRI)', 'Hemodynamic response function (HRF)', 'machine learning', 'optimization', 'BOLD', 'Finite inpulse response (FIR)', 'decoding', 'encoding']"
11366,2203.06618,Matias Quintana,"Matias Quintana, Till Stoeckmann, June Young Park, Marian Turowski,
  Veit Hagenmeyer, Clayton Miller","ALDI++: Automatic and parameter-less discord and outlier detection for
  building energy load profiles","10 pages, 5 figures, 3 tables",Energy & Buildings. 2022;265: 112096,10.1016/j.enbuild.2022.112096,,cs.LG cs.CE,http://creativecommons.org/licenses/by/4.0/,"  Data-driven building energy prediction is an integral part of the process for
measurement and verification, building benchmarking, and building-to-grid
interaction. The ASHRAE Great Energy Predictor III (GEPIII) machine learning
competition used an extensive meter data set to crowdsource the most accurate
machine learning workflow for whole building energy prediction. A significant
component of the winning solutions was the pre-processing phase to remove
anomalous training data. Contemporary pre-processing methods focus on filtering
statistical threshold values or deep learning methods requiring training data
and multiple hyper-parameters. A recent method named ALDI (Automated Load
profile Discord Identification) managed to identify these discords using matrix
profile, but the technique still requires user-defined parameters. We develop
ALDI++, a method based on the previous work that bypasses user-defined
parameters and takes advantage of discord similarity. We evaluate ALDI++
against a statistical threshold, variational auto-encoder, and the original
ALDI as baselines in classifying discords and energy forecasting scenarios. Our
results demonstrate that while the classification performance improvement over
the original method is marginal, ALDI++ helps achieve the best forecasting
error improving 6% over the winning's team approach with six times less
computation time.
","[{'version': 'v1', 'created': 'Sun, 13 Mar 2022 10:39:11 GMT'}]",2022-08-09,"[['Quintana', 'Matias', ''], ['Stoeckmann', 'Till', ''], ['Park', 'June Young', ''], ['Turowski', 'Marian', ''], ['Hagenmeyer', 'Veit', ''], ['Miller', 'Clayton', '']]","['Smart meter', 'Load profile', 'Matrix profile', 'Discord detection', 'Portfolio analysis']"
11367,2210.06158,Yu Wei Tan,"Yu Wei Tan, Nicholas Chua, Nathan Biette and Anand Bhojan","A Hybrid System for Real-time Rendering of Depth of Field Effect in
  Games",Best Student Paper Award (GRAPP 2022),,10.5220/0010839800003124,,cs.GR,http://creativecommons.org/licenses/by/4.0/,"  Real-time depth of field in game cinematics tends to approximate the
semi-transparent silhouettes of out-of-focus objects through post-processing
techniques. We leverage ray tracing hardware acceleration and spatio-temporal
reconstruction to improve the realism of such semi-transparent regions through
hybrid rendering, while maintaining interactive frame rates for immersive
gaming. This paper extends our previous work with a complete presentation of
our technique and details on its design, implementation, and future work.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2022 14:24:44 GMT'}]",2022-10-13,"[['Tan', 'Yu Wei', ''], ['Chua', 'Nicholas', ''], ['Biette', 'Nathan', ''], ['Bhojan', 'Anand', '']]","['Real-Time', 'Depth of Field', 'Ray Tracing', 'Post-Processing', 'Hybrid Rendering', 'Games']"
11368,2110.13234,Philipp Wiesner,"Philipp Wiesner, Ilja Behnke, Dominik Scheinert, Kordian Gontarska,
  Lauritz Thamsen","Let's Wait Awhile: How Temporal Workload Shifting Can Reduce Carbon
  Emissions in the Cloud","To be published in the proceedings of the 22nd International
  Middleware Conference (Middleware '21), December 6-10, 2021, Virtual Event,
  Canada",,10.1145/3464298.3493399,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Depending on energy sources and demand, the carbon intensity of the public
power grid fluctuates over time. Exploiting this variability is an important
factor in reducing the emissions caused by data centers. However, regional
differences in the availability of low-carbon energy sources make it hard to
provide general best practices for when to consume electricity. Moreover,
existing research in this domain focuses mostly on carbon-aware workload
migration across geo-distributed data centers, or addresses demand response
purely from the perspective of power grid stability and costs.
  In this paper, we examine the potential impact of shifting computational
workloads towards times where the energy supply is expected to be less
carbon-intensive. To this end, we identify characteristics of delay-tolerant
workloads and analyze the potential for temporal workload shifting in Germany,
Great Britain, France, and California over the year 2020. Furthermore, we
experimentally evaluate two workload shifting scenarios in a simulation to
investigate the influence of time constraints, scheduling strategies, and the
accuracy of carbon intensity forecasts. To accelerate research in the domain of
carbon-aware computing and to support the evaluation of novel scheduling
algorithms, our simulation framework and datasets are publicly available.
","[{'version': 'v1', 'created': 'Mon, 25 Oct 2021 19:42:59 GMT'}]",2021-10-27,"[['Wiesner', 'Philipp', ''], ['Behnke', 'Ilja', ''], ['Scheinert', 'Dominik', ''], ['Gontarska', 'Kordian', ''], ['Thamsen', 'Lauritz', '']]","['temporal workload shifting', 'carbon-aware scheduling', 'green computing', 'resource management', 'data center']"
11369,2012.05267,Tom Hanika,Tom Hanika and Johannes Hirth,On the Lattice of Conceptual Measurements,"19 pages, 6 figures","Information Sciences, 613, 2022, 453-468",10.1016/j.ins.2022.09.005,,cs.AI cs.LG cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a novel approach for data set scaling based on scale-measures from
formal concept analysis, i.e., continuous maps between closure systems, and
derive a canonical representation. Moreover, we prove said scale-measures are
lattice ordered with respect to the closure systems. This enables exploring the
set of scale-measures through by the use of meet and join operations.
Furthermore we show that the lattice of scale-measures is isomorphic to the
lattice of sub-closure systems that arises from the original data. Finally, we
provide another representation of scale-measures using propositional logic in
terms of data set features. Our theoretical findings are discussed by means of
examples.
","[{'version': 'v1', 'created': 'Wed, 9 Dec 2020 19:11:50 GMT'}]",2022-09-28,"[['Hanika', 'Tom', ''], ['Hirth', 'Johannes', '']]","['FCA', 'Measurements', 'Data Scaling', 'Lattice', 'Closure System']"
11370,2005.14080,Paolo Torroni,Daniela Loreti and Marco Lippi and Paolo Torroni,Parallelizing Machine Learning as a Service for the End-User,,Future Generation Computer Systems 105 (2020) 275-286,10.1016/j.future.2019.11.042,,cs.DC cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As ML applications are becoming ever more pervasive, fully-trained systems
are made increasingly available to a wide public, allowing end-users to submit
queries with their own data, and to efficiently retrieve results. With
increasingly sophisticated such services, a new challenge is how to scale up to
evergrowing user bases. In this paper, we present a distributed architecture
that could be exploited to parallelize a typical ML system pipeline. We propose
a case study consisting of a text mining service and discuss how the method can
be generalized to many similar applications. We demonstrate the significance of
the computational gain boosted by the distributed architecture by way of an
extensive experimental evaluation.
","[{'version': 'v1', 'created': 'Thu, 28 May 2020 15:22:50 GMT'}, {'version': 'v2', 'created': 'Fri, 29 May 2020 09:13:36 GMT'}]",2020-06-01,"[['Loreti', 'Daniela', ''], ['Lippi', 'Marco', ''], ['Torroni', 'Paolo', '']]","['Machine Learning as a Service', 'Parallelization', 'MapReduce']"
11371,2010.13197,Sriram Krishna,"Sriram Krishna, Nishant Sinha",Gestop : Customizable Gesture Control of Computer Systems,"5 pages, 5 figures, to appear in the proceedings of the 8th ACM IKDD
  CODS and 26th COMAD (CODS-COMAD '21)",,10.1145/3430984.3430993,,cs.HC cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The established way of interfacing with most computer systems is a mouse and
keyboard. Hand gestures are an intuitive and effective touchless way to
interact with computer systems. However, hand gesture based systems have seen
low adoption among end-users primarily due to numerous technical hurdles in
detecting in-air gestures accurately. This paper presents Gestop, a framework
developed to bridge this gap. The framework learns to detect gestures from
demonstrations, is customizable by end-users and enables users to interact in
real-time with computers having only RGB cameras, using gestures.
","[{'version': 'v1', 'created': 'Sun, 25 Oct 2020 19:13:01 GMT'}]",2020-10-27,"[['Krishna', 'Sriram', ''], ['Sinha', 'Nishant', '']]","['hand gesture', 'MediaPipe', 'neural networks', 'pytorch']"
11372,2210.02021,Zhiyuan Zhao,"Zhiyuan Zhao, Qingjie Liu, Yunhong Wang",Exploring Effective Knowledge Transfer for Few-shot Object Detection,"9 pages, 6 figures, accepted by ACM Multimedia 2022",,10.1145/3503161.3548062,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, few-shot object detection~(FSOD) has received much attention from
the community, and many methods are proposed to address this problem from a
knowledge transfer perspective. Though promising results have been achieved,
these methods fail to achieve shot-stable:~methods that excel in low-shot
regimes are likely to struggle in high-shot regimes, and vice versa. We believe
this is because the primary challenge of FSOD changes when the number of shots
varies. In the low-shot regime, the primary challenge is the lack of
inner-class variation. In the high-shot regime, as the variance approaches the
real one, the main hindrance to the performance comes from misalignment between
learned and true distributions. However, these two distinct issues remain
unsolved in most existing FSOD methods. In this paper, we propose to overcome
these challenges by exploiting rich knowledge the model has learned and
effectively transferring them to the novel classes. For the low-shot regime, we
propose a distribution calibration method to deal with the lack of inner-class
variation problem. Meanwhile, a shift compensation method is proposed to
compensate for possible distribution shift during fine-tuning. For the
high-shot regime, we propose to use the knowledge learned from ImageNet as
guidance for the feature learning in the fine-tuning stage, which will
implicitly align the distributions of the novel classes. Although targeted
toward different regimes, these two strategies can work together to further
improve the FSOD performance. Experiments on both the VOC and COCO benchmarks
show that our proposed method can significantly outperform the baseline method
and produce competitive results in both low-shot settings (shot<5) and
high-shot settings (shot>=5). Code is available at
https://github.com/JulioZhao97/EffTrans_Fsdet.git.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2022 04:53:58 GMT'}]",2022-10-06,"[['Zhao', 'Zhiyuan', ''], ['Liu', 'Qingjie', ''], ['Wang', 'Yunhong', '']]","['few-shot object detection', 'knowledge transfer', 'distribution calibration', 'distribution regularization']"
11373,1907.05117,David Orden,"Ivan Marsa-Maestre, Jose Manuel Gimenez-Guzman, David Orden, Enrique
  de la Hoz, Mark Klein","REACT: REActive resilience for critical infrastructures using
  graph-Coloring Techniques","24 pages, 11 figures. Accepted by Journal of Network and Computer
  Applications","Journal of Network and Computer Applicatons 145 (2019), 102402",10.1016/j.jnca.2019.07.003,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays society is more and more dependent on critical infrastructures.
Critical network infrastructures (CNI) are communication networks whose
disruption can create a severe impact. In this paper we propose REACT, a
distributed framework for reactive network resilience, which allows networks to
reconfigure themselves in the event of a security incidents so that the risk of
further damage is mitigated. Our framework takes advantage of a risk model
based on multilayer networks, as well as a graph-coloring problem conversion,
to identify new, more resilient configurations for networks in the event of an
attack. We propose two different solution approaches, and evaluate them from
two different perspectives, with a number of centralized optimization
techniques. Experiments show that our approaches outperform the reference
approaches in terms of risk mitigation and performance.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2019 11:29:04 GMT'}, {'version': 'v2', 'created': 'Sat, 13 Jul 2019 13:46:15 GMT'}]",2020-07-20,"[['Marsa-Maestre', 'Ivan', ''], ['Gimenez-Guzman', 'Jose Manuel', ''], ['Orden', 'David', ''], ['de la Hoz', 'Enrique', ''], ['Klein', 'Mark', '']]","['Network security', 'Network theory (graphs)', 'Optimization', 'Simulated annealing']"
11374,2208.00945,Zijin Wu,"Zijin Wu, Xingyi Li, Juewen Peng, Hao Lu, Zhiguo Cao, Weicai Zhong",DoF-NeRF: Depth-of-Field Meets Neural Radiance Fields,Accepted by ACMMM 2022,,10.1145/3503161.3548088,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural Radiance Field (NeRF) and its variants have exhibited great success on
representing 3D scenes and synthesizing photo-realistic novel views. However,
they are generally based on the pinhole camera model and assume all-in-focus
inputs. This limits their applicability as images captured from the real world
often have finite depth-of-field (DoF). To mitigate this issue, we introduce
DoF-NeRF, a novel neural rendering approach that can deal with shallow DoF
inputs and can simulate DoF effect. In particular, it extends NeRF to simulate
the aperture of lens following the principles of geometric optics. Such a
physical guarantee allows DoF-NeRF to operate views with different focus
configurations. Benefiting from explicit aperture modeling, DoF-NeRF also
enables direct manipulation of DoF effect by adjusting virtual aperture and
focus parameters. It is plug-and-play and can be inserted into NeRF-based
frameworks. Experiments on synthetic and real-world datasets show that,
DoF-NeRF not only performs comparably with NeRF in the all-in-focus setting,
but also can synthesize all-in-focus novel views conditioned on shallow DoF
inputs. An interesting application of DoF-NeRF to DoF rendering is also
demonstrated. The source code will be made available at
https://github.com/zijinwuzijin/DoF-NeRF.
","[{'version': 'v1', 'created': 'Mon, 1 Aug 2022 15:53:14 GMT'}]",2022-08-02,"[['Wu', 'Zijin', ''], ['Li', 'Xingyi', ''], ['Peng', 'Juewen', ''], ['Lu', 'Hao', ''], ['Cao', 'Zhiguo', ''], ['Zhong', 'Weicai', '']]","['neural radiance field', 'depth-of-field', 'novel view synthesis', 'imagebased rendering']"
11375,2209.10833,Haoyu Hu,"Haoyu Hu, Xinyu Yi, Hao Zhang, Jun-Hai Yong, Feng Xu","Physical Interaction: Reconstructing Hand-object Interactions with
  Physics","Accepted to SIGGRAPH Asia 2022, Conference Track",,10.1145/3550469.3555421,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Single view-based reconstruction of hand-object interaction is challenging
due to the severe observation missing caused by occlusions. This paper proposes
a physics-based method to better solve the ambiguities in the reconstruction.
It first proposes a force-based dynamic model of the in-hand object, which not
only recovers the unobserved contacts but also solves for plausible contact
forces. Next, a confidence-based slide prevention scheme is proposed, which
combines both the kinematic confidences and the contact forces to jointly model
static and sliding contact motion. Qualitative and quantitative experiments
show that the proposed technique reconstructs both physically plausible and
more accurate hand-object interaction and estimates plausible contact forces in
real-time with a single RGBD sensor.
","[{'version': 'v1', 'created': 'Thu, 22 Sep 2022 07:41:31 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Oct 2022 11:36:17 GMT'}]",2022-10-20,"[['Hu', 'Haoyu', ''], ['Yi', 'Xinyu', ''], ['Zhang', 'Hao', ''], ['Yong', 'Jun-Hai', ''], ['Xu', 'Feng', '']]","['hand tracking', 'hand-object interaction', 'physics-based interactionmodel', 'single depth camera']"
11376,2107.03833,"Alexander Sch\""afer","Alexander Sch\""afer, Gerd Reis, Didier Stricker",Towards Collaborative Photorealistic VR Meeting Rooms,,,10.1145/3340764.3344466,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When designing 3D applications it is necessary to find a compromise between
cost (e.g. money, time) and achievable realism of the virtual environment.
Reusing existing assets has an impact on the uniqueness of the application and
creating high quality 3D assets is very time consuming and expensive. We aim
for a low cost, high quality and minimal time effort solution to create virtual
environments. This paper's main contribution is a novel way of creating a
virtual meeting application by utilizing augmented spherical images for photo
realistic virtual environments.
","[{'version': 'v1', 'created': 'Thu, 8 Jul 2021 13:22:20 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Jul 2021 05:29:05 GMT'}]",2021-07-13,"[['Schäfer', 'Alexander', ''], ['Reis', 'Gerd', ''], ['Stricker', 'Didier', '']]","['virtual reality', 'augmented reality', 'mixed reality', 'virtual meeting', 'teleconferencing', 'telepresence', 'spherical images']"
11377,2103.02486,Julius Nehring-Wirxel,Julius Nehring-Wirxel and Philip Trettner and Leif Kobbelt,Fast Exact Booleans for Iterated CSG using Octree-Embedded BSPs,,,10.1016/j.cad.2021.103015,,cs.CG cs.GR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We present octree-embedded BSPs, a volumetric mesh data structure suited for
performing a sequence of Boolean operations (iterated CSG) efficiently. At its
core, our data structure leverages a plane-based geometry representation and
integer arithmetics to guarantee unconditionally robust operations. These
typically present considerable performance challenges which we overcome by
using custom-tailored fixed-precision operations and an efficient algorithm for
cutting a convex mesh against a plane. Consequently, BSP Booleans and mesh
extraction are formulated in terms of mesh cutting. The octree is used as a
global acceleration structure to keep modifications local and bound the BSP
complexity. With our optimizations, we can perform up to 2.5 million mesh-plane
cuts per second on a single core, which creates roughly 40-50 million output
BSP nodes for CSG. We demonstrate our system in two iterated CSG settings:
sweep volumes and a milling simulation.
","[{'version': 'v1', 'created': 'Wed, 3 Mar 2021 15:54:50 GMT'}]",2021-03-04,"[['Nehring-Wirxel', 'Julius', ''], ['Trettner', 'Philip', ''], ['Kobbelt', 'Leif', '']]","['Plane-based Geometry', 'CSG', 'Mesh Booleans', 'BSP', 'Octree', 'Integer Arithmetic']"
11378,2203.10565,Xiaojun Ma,"Xiaojun Ma, Hanyue Chen, Guojie Song",LEReg: Empower Graph Neural Networks with Local Energy Regularization,"Proceedings of the 30th ACM International Conference on Information
  and Knowledge Management (CIKM '21), November 1--5, 2021, Virtual Event, QLD,
  Australia. arXiv admin note: text overlap with arXiv:2009.02027 by other
  authors",,10.1145/3459637.3482447,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Researches on analyzing graphs with Graph Neural Networks (GNNs) have been
receiving more and more attention because of the great expressive power of
graphs. GNNs map the adjacency matrix and node features to node representations
by message passing through edges on each convolution layer. However, the
message passed through GNNs is not always beneficial for all parts in a graph.
Specifically, as the data distribution is different over the graph, the
receptive field (the farthest nodes that a node can obtain information from)
needed to gather information is also different. Existing GNNs treat all parts
of the graph uniformly, which makes it difficult to adaptively pass the most
informative message for each unique part. To solve this problem, we propose two
regularization terms that consider message passing locally: (1) Intra-Energy
Reg and (2) Inter-Energy Reg. Through experiments and theoretical discussion,
we first show that the speed of smoothing of different parts varies enormously
and the topology of each part affects the way of smoothing. With Intra-Energy
Reg, we strengthen the message passing within each part, which is beneficial
for getting more useful information. With Inter-Energy Reg, we improve the
ability of GNNs to distinguish different nodes. With the proposed two
regularization terms, GNNs are able to filter the most useful information
adaptively, learn more robustly and gain higher expressiveness. Moreover, the
proposed LEReg can be easily applied to other GNN models with plug-and-play
characteristics. Extensive experiments on several benchmarks verify that GNNs
with LEReg outperform or match the state-of-the-art methods. The effectiveness
and efficiency are also empirically visualized with elaborate experiments.
","[{'version': 'v1', 'created': 'Sun, 20 Mar 2022 14:38:05 GMT'}]",2022-03-22,"[['Ma', 'Xiaojun', ''], ['Chen', 'Hanyue', ''], ['Song', 'Guojie', '']]","['GNNs', 'Graph Regularization', 'Dirichlet Energy', 'Expressiveness', 'Node Classification']"
11379,1811.05768,Shaun D'Souza,Shaun D'Souza,Parser Extraction of Triples in Unstructured Text,,"IAES International Journal of Artificial Intelligence (IJ-AI),
  5(4):143-148, 2017",10.11591/ij-ai.v5.i4.pp143-148,,cs.CL cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The web contains vast repositories of unstructured text. We investigate the
opportunity for building a knowledge graph from these text sources. We generate
a set of triples which can be used in knowledge gathering and integration. We
define the architecture of a language compiler for processing
subject-predicate-object triples using the OpenNLP parser. We implement a
depth-first search traversal on the POS tagged syntactic tree appending
predicate and object information. A parser enables higher precision and higher
recall extractions of syntactic relationships across conjunction boundaries. We
are able to extract 2-2.5 times the correct extractions of ReVerb. The
extractions are used in a variety of semantic web applications and question
answering. We verify extraction of 50,000 triples on the ClueWeb dataset.
","[{'version': 'v1', 'created': 'Tue, 6 Nov 2018 16:12:00 GMT'}]",2018-11-15,"[[""D'Souza"", 'Shaun', '']]","['Open information extraction', 'Relation extraction', 'NLP']"
11380,2110.01711,Christian Schilling,Marcelo Forets and Christian Schilling,LazySets.jl: Scalable Symbolic-Numeric Set Computations,published in the Proceedings of the JuliaCon Conferences 2021,JuliaCon Proceedings (2021),10.21105/jcon.00097,,cs.MS cs.CG cs.NA math.NA,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  LazySets.jl is a Julia library that provides ways to symbolically represent
sets of points as geometric shapes, with a special focus on convex sets and
polyhedral approximations. LazySets provides methods to apply common set
operations, convert between different set representations, and efficiently
compute with sets in high dimensions using specialized algorithms based on the
set types. LazySets is the core library of JuliaReach, a cutting-edge software
addressing the fundamental problem of reachability analysis: computing the set
of states that are reachable by a dynamical system from all initial states and
for all admissible inputs and parameters. While the library was originally
designed for reachability and formal verification, its scope goes beyond such
topics. LazySets is an easy-to-use, general-purpose and scalable library for
computations that mix symbolics and numerics. In this article we showcase the
basic functionality, highlighting some of the key design choices.
","[{'version': 'v1', 'created': 'Mon, 4 Oct 2021 20:50:47 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Dec 2021 17:45:01 GMT'}]",2022-05-04,"[['Forets', 'Marcelo', ''], ['Schilling', 'Christian', '']]","['Set propagation', 'Geometry', 'Reachability analysis', 'Hybrid system', 'Support function', 'Formal verification']"
11381,2104.00819,Asmae Benali,Asmae Benali and Bouchra El Asri,"Towards Rigorous Selection and Configuration of Cloud Services: Research
  Methodology",https://doi.org/10.5281/zenodo.4431076,"Volume 17, Issue 6, November 2020",10.5281/zenodo.4431076,,cs.SE cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing has recently emerged as a major trend in distributed
computing. We proposed a platform for selecting and configuring automatically
an appropriate cloud environment that meets a set of consumer and provider
requirements. It can easily adapt its behavior, either at design-time or
runtime, to the change of the environment in matters of location, time,
activity, interaction abilities, and communication restrictions. The platform
based on the principles of dynamic software product lines (SPL), Agent-oriented
software engineering, and the MAPE-k reference model. We based on the Design
Science Research Methodology to conduct this work. In this article, we present
the steps of our research following this methodology's guidelines.
","[{'version': 'v1', 'created': 'Fri, 2 Apr 2021 00:09:25 GMT'}]",2021-04-05,"[['Benali', 'Asmae', ''], ['Asri', 'Bouchra El', '']]","['Cloud Computing', 'Dynamic Software Product Lines', 'Context-Aware System', 'Autonomic System', 'Design Science Research Methodology']"
11382,2008.12385,Nevin Vunka Jungum,"Nevin Vunka Jungum, Nawaz Mohamudally, Nimal Nissanke","A Dynamic Load Balancing Algorithm for Distributing Mobile Codes in
  Multi-Applications and Multi-Hosts Environment",,"International Journal of Computer Science Issues, Vol 17, Issue 4,
  July 2020",10.5281/zenodo.3991567,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Code offloading refers to partitioning software and migrating the mobile
codes to other computational entities for processing. Often when a large number
of mobile codes need to be distributed to many heterogenous hosts, this can
easily lead to poor system performance if one host gets too many mobile codes
to process while others are almost idle. To resolve such situation, we proposed
a proposed a load balancing algorithm to ensure fairness in the distribution of
the mobile codes. The algorithm is based on the popular Weighted
Least-Connections (WLC) scheduling algorithm while taking into consideration
the dynamic recalculation of the hosts weights and system attributes such as
CPU idle rate and memory idle rate which the WLC algorithm does not take into
consideration. Using simulation, various number of mobile codes were
distributed to the hosts/servers and the proposed algorithm outperform existing
Least-Connections and Weighted Least-Connections scheduling algorithms thus
improving system efficiency.
","[{'version': 'v1', 'created': 'Thu, 27 Aug 2020 22:07:44 GMT'}]",2020-08-31,"[['Jungum', 'Nevin Vunka', ''], ['Mohamudally', 'Nawaz', ''], ['Nissanke', 'Nimal', '']]","['software partitioning', 'mobile codes', 'dynamic load balancing', 'scheduling algorithm']"
11383,2203.12687,Hyesun Choung,"Hyesun Choung, Prabu David, Arun Ross",Trust in AI and Its Role in the Acceptance of AI Technologies,,,10.1080/10447318.2022.2050543,,cs.AI cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As AI-enhanced technologies become common in a variety of domains, there is
an increasing need to define and examine the trust that users have in such
technologies. Given the progress in the development of AI, a correspondingly
sophisticated understanding of trust in the technology is required. This paper
addresses this need by explaining the role of trust on the intention to use AI
technologies. Study 1 examined the role of trust in the use of AI voice
assistants based on survey responses from college students. A path analysis
confirmed that trust had a significant effect on the intention to use AI, which
operated through perceived usefulness and participants' attitude toward voice
assistants. In study 2, using data from a representative sample of the U.S.
population, different dimensions of trust were examined using exploratory
factor analysis, which yielded two dimensions: human-like trust and
functionality trust. The results of the path analyses from Study 1 were
replicated in Study 2, confirming the indirect effect of trust and the effects
of perceived usefulness, ease of use, and attitude on intention to use.
Further, both dimensions of trust shared a similar pattern of effects within
the model, with functionality-related trust exhibiting a greater total impact
on usage intention than human-like trust. Overall, the role of trust in the
acceptance of AI technologies was significant across both studies. This
research contributes to the advancement and application of the TAM in
AI-related applications and offers a multidimensional measure of trust that can
be utilized in the future study of trustworthy AI.
","[{'version': 'v1', 'created': 'Wed, 23 Mar 2022 19:18:19 GMT'}]",2022-03-25,"[['Choung', 'Hyesun', ''], ['David', 'Prabu', ''], ['Ross', 'Arun', '']]","['Artificial intelligence', 'trust in AI', 'technology acceptance model (TAM)']"
11384,1910.12193,Marco Cavallo,"Marco Cavallo, Mishal Dholakia, Matous Havlena, Kenneth Ocheltree,
  Mark Podlaseck","Immersive Insights: A Hybrid Analytics System for Collaborative
  Exploratory Data Analysis",VRST 2019,,10.1145/3359996.3364242,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the past few years, augmented reality (AR) and virtual reality (VR)
technologies have experienced terrific improvements in both accessibility and
hardware capabilities, encouraging the application of these devices across
various domains. While researchers have demonstrated the possible advantages of
AR and VR for certain data science tasks, it is still unclear how these
technologies would perform in the context of exploratory data analysis (EDA) at
large. In particular, we believe it is important to better understand which
level of immersion EDA would concretely benefit from, and to quantify the
contribution of AR and VR with respect to standard analysis workflows.
  In this work, we leverage a Dataspace reconfigurable hybrid reality
environment to study how data scientists might perform EDA in a co-located,
collaborative context. Specifically, we propose the design and implementation
of Immersive Insights, a hybrid analytics system combining high-resolution
displays, table projections, and augmented reality (AR) visualizations of the
data.
  We conducted a two-part user study with twelve data scientists, in which we
evaluated how different levels of data immersion affect the EDA process and
compared the performance of Immersive Insights with a state-of-the-art,
non-immersive data analysis system.
","[{'version': 'v1', 'created': 'Sun, 27 Oct 2019 06:44:30 GMT'}]",2019-10-29,"[['Cavallo', 'Marco', ''], ['Dholakia', 'Mishal', ''], ['Havlena', 'Matous', ''], ['Ocheltree', 'Kenneth', ''], ['Podlaseck', 'Mark', '']]","['Dataspace', 'Hybrid Reality', 'Data Visualization', 'Exploratory DataAnalysis', 'Augmented Reality', 'Virtuality Continuum', 'Clustering']"
11385,1804.00954,Thomas Vogel,"Thomas Vogel (1) ((1) Humboldt-Universit\""at zu Berlin, Germany)","mRUBiS: An Exemplar for Model-Based Architectural Self-Healing and
  Self-Optimization",,"SEAMS'18: 13th International Symposium on Software Engineering for
  Adaptive and Self-Managing Systems, May 28-29, 2018, Gothenburg, Sweden",10.1145/3194133.3194161,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-adaptive software systems are often structured into an adaptation engine
that manages an adaptable software by operating on a runtime model that
represents the architecture of the software (model-based architectural
self-adaptation). Despite the popularity of such approaches, existing exemplars
provide application programming interfaces but no runtime model to develop
adaptation engines. Consequently, there does not exist any exemplar that
supports developing, evaluating, and comparing model-based self-adaptation off
the shelf. Therefore, we present mRUBiS, an extensible exemplar for model-based
architectural self-healing and self-optimization. mRUBiS simulates the
adaptable software and therefore provides and maintains an architectural
runtime model of the software, which can be directly used by adaptation engines
to realize and perform self-adaptation. Particularly, mRUBiS supports injecting
issues into the model, which should be handled by self-adaptation, and
validating the model to assess the self-adaptation. Finally, mRUBiS allows
developers to explore variants of adaptation engines (e.g., event-driven
self-adaptation) and to evaluate the effectiveness, efficiency, and scalability
of the engines.
","[{'version': 'v1', 'created': 'Tue, 3 Apr 2018 13:40:49 GMT'}]",2018-04-04,"[['Vogel', 'Thomas', '', 'Humboldt-Universität zu Berlin, Germany']]","['Self-adaptation', 'architecture', 'runtime models', 'simulator']"
11386,2110.06206,Jinghuan Shang,"Jinghuan Shang and Kumara Kahatapitiya and Xiang Li and Michael S.
  Ryoo","StARformer: Transformer with State-Action-Reward Representations for
  Visual Reinforcement Learning","Accepted to ECCV 2022. Our code is available at
  https://github.com/elicassion/StARformer",,10.1007/978-3-031-19842-7_27,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reinforcement Learning (RL) can be considered as a sequence modeling task:
given a sequence of past state-action-reward experiences, an agent predicts a
sequence of next actions. In this work, we propose State-Action-Reward
Transformer (StARformer) for visual RL, which explicitly models short-term
state-action-reward representations (StAR-representations), essentially
introducing a Markovian-like inductive bias to improve long-term modeling. Our
approach first extracts StAR-representations by self-attending image state
patches, action, and reward tokens within a short temporal window. These are
then combined with pure image state representations -- extracted as
convolutional features, to perform self-attention over the whole sequence. Our
experiments show that StARformer outperforms the state-of-the-art
Transformer-based method on image-based Atari and DeepMind Control Suite
benchmarks, in both offline-RL and imitation learning settings. StARformer is
also more compliant with longer sequences of inputs. Our code is available at
https://github.com/elicassion/StARformer.
","[{'version': 'v1', 'created': 'Tue, 12 Oct 2021 17:55:30 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Jul 2022 15:49:57 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Jan 2023 03:03:22 GMT'}]",2023-01-05,"[['Shang', 'Jinghuan', ''], ['Kahatapitiya', 'Kumara', ''], ['Li', 'Xiang', ''], ['Ryoo', 'Michael S.', '']]","['Reinforcement Learning', 'Transformer', 'Sequence Modeling']"
11387,2204.11793,Heng Lian,Heng Lian and John Scovil Atwood and Bojian Hou and Jian Wu and Yi He,Online Deep Learning from Doubly-Streaming Data,"Have accepted by ACMMM 2022. Legends mistake in Figure 4 has been
  corrected",,10.1145/3503161.3548355,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates a new online learning problem with doubly-streaming
data, where the data streams are described by feature spaces that constantly
evolve, with new features emerging and old features fading away. The challenges
of this problem are two folds: 1) Data samples ceaselessly flowing in may carry
shifted patterns over time, requiring learners to update hence adapt
on-the-fly. 2) Newly emerging features are described by very few samples,
resulting in weak learners that tend to make error predictions. A plausible
idea to overcome the challenges is to establish relationship between the
pre-and-post evolving feature spaces, so that an online learner can leverage
the knowledge learned from the old features to better the learning performance
on the new features. Unfortunately, this idea does not scale up to
high-dimensional media streams with complex feature interplay, which suffers an
tradeoff between onlineness (biasing shallow learners) and
expressiveness(requiring deep learners). Motivated by this, we propose a novel
OLD^3S paradigm, where a shared latent subspace is discovered to summarize
information from the old and new feature spaces, building intermediate feature
mapping relationship. A key trait of OLD^3S is to treat the model capacity as a
learnable semantics, yields optimal model depth and parameters jointly, in
accordance with the complexity and non-linearity of the input data streams in
an online fashion. Both theoretical analyses and empirical studies substantiate
the viability and effectiveness of our proposal.
","[{'version': 'v1', 'created': 'Mon, 25 Apr 2022 17:06:39 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Apr 2022 01:37:33 GMT'}, {'version': 'v3', 'created': 'Sat, 16 Jul 2022 15:18:30 GMT'}, {'version': 'v4', 'created': 'Wed, 14 Sep 2022 04:32:10 GMT'}]",2022-09-15,"[['Lian', 'Heng', ''], ['Atwood', 'John Scovil', ''], ['Hou', 'Bojian', ''], ['Wu', 'Jian', ''], ['He', 'Yi', '']]","['Online Learning', 'Streaming Features', 'Hedge Backpropagation']"
11388,2108.02775,Yuanhao Wei,"Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert,
  Yihan Sun, Yuanhao Wei",Space and Time Bounded Multiversion Garbage Collection,"This is the full version of the paper appearing in the International
  Symposium on Distributed Computing (DISC 2021)",,10.4230/LIPIcs.DISC.2021.12,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a general technique for garbage collecting old versions for
multiversion concurrency control that simultaneously achieves good time and
space complexity. Our technique takes only $O(1)$ time on average to reclaim
each version and maintains only a constant factor more versions than needed
(plus an additive term). It is designed for multiversion schemes using version
lists, which are the most common.
  Our approach uses two components that are of independent interest. First, we
define a novel range-tracking data structure which stores a set of old versions
and efficiently finds those that are no longer needed. We provide a wait-free
implementation in which all operations take amortized constant time. Second, we
represent version lists using a new lock-free doubly-linked list algorithm that
supports efficient (amortized constant time) removals given a pointer to any
node in the list. These two components naturally fit together to solve the
multiversion garbage collection problem--the range-tracker identifies which
versions to remove and our list algorithm can then be used to remove them from
their version lists. We apply our garbage collection technique to generate
end-to-end time and space bounds for the multiversioning system of Wei et al.
(PPoPP 2021).
","[{'version': 'v1', 'created': 'Thu, 5 Aug 2021 17:59:43 GMT'}, {'version': 'v2', 'created': 'Mon, 9 Aug 2021 18:03:09 GMT'}, {'version': 'v3', 'created': 'Thu, 16 Dec 2021 20:49:59 GMT'}]",2021-12-20,"[['Ben-David', 'Naama', ''], ['Blelloch', 'Guy E.', ''], ['Fatourou', 'Panagiota', ''], ['Ruppert', 'Eric', ''], ['Sun', 'Yihan', ''], ['Wei', 'Yuanhao', '']]","['Lock-free', 'data structures', 'memory management', 'snapshot', 'version lists']"
11389,2103.05342,Tianshu Xie,"Tianshu Xie, Xuan Cheng, Minghui Liu, Jiali Deng, Xiaomin Wang, Ming
  Liu","Cut-Thumbnail: A Novel Data Augmentation for Convolutional Neural
  Network",Accepted at ACM MM 2021,,10.1145/3474085.3475302,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel data augmentation strategy named
Cut-Thumbnail, that aims to improve the shape bias of the network. We reduce an
image to a certain size and replace the random region of the original image
with the reduced image. The generated image not only retains most of the
original image information but also has global information in the reduced
image. We call the reduced image as thumbnail. Furthermore, we find that the
idea of thumbnail can be perfectly integrated with Mixed Sample Data
Augmentation, so we put one image's thumbnail on another image while the ground
truth labels are also mixed, making great achievements on various computer
vision tasks. Extensive experiments show that Cut-Thumbnail works better than
state-of-the-art augmentation strategies across classification, fine-grained
image classification, and object detection. On ImageNet classification,
ResNet-50 architecture with our method achieves 79.21\% accuracy, which is more
than 2.8\% improvement on the baseline.
","[{'version': 'v1', 'created': 'Tue, 9 Mar 2021 10:45:55 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Oct 2021 12:51:19 GMT'}]",2021-10-27,"[['Xie', 'Tianshu', ''], ['Cheng', 'Xuan', ''], ['Liu', 'Minghui', ''], ['Deng', 'Jiali', ''], ['Wang', 'Xiaomin', ''], ['Liu', 'Ming', '']]","['classification', 'convolutional neural network', 'thumbnail', 'data augmentation', 'regularization']"
11390,1401.6675,Damien Pous,"Filippo Bonchi (LIP), Daniela Petrisan (LIP), Damien Pous (LIP),
  Jurriaan Rot (LIACS)",Coinduction up to in a fibrational setting,,"CSL-LICS, Vienne : France (2014)",10.1145/2603088.2603149,,cs.LO cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bisimulation up-to enhances the coinductive proof method for bisimilarity,
providing efficient proof techniques for checking properties of different kinds
of systems. We prove the soundness of such techniques in a fibrational setting,
building on the seminal work of Hermida and Jacobs. This allows us to
systematically obtain up-to techniques not only for bisimilarity but for a
large class of coinductive predicates modelled as coalgebras. By tuning the
parameters of our framework, we obtain novel techniques for unary predicates
and nominal automata, a variant of the GSOS rule format for similarity, and a
new categorical treatment of weak bisimilarity.
","[{'version': 'v1', 'created': 'Sun, 26 Jan 2014 18:20:05 GMT'}, {'version': 'v2', 'created': 'Thu, 15 May 2014 18:22:18 GMT'}]",2014-05-16,"[['Bonchi', 'Filippo', '', 'LIP'], ['Petrisan', 'Daniela', '', 'LIP'], ['Pous', 'Damien', '', 'LIP'], ['Rot', 'Jurriaan', '', 'LIACS']]","['fibrations', 'coinductive predicates', 'bisimulation up-to', 'GSOS', 'up-to techniques', 'similarity', 'bialgebras', 'nominal automata']"
11391,2109.02955,Katsuyuki Nakamura,"Katsuyuki Nakamura, Hiroki Ohashi, Mitsuhiro Okada","Sensor-Augmented Egocentric-Video Captioning with Dynamic Modal
  Attention",Accepted to ACM Multimedia (ACMMM) 2021,,10.1145/3474085.3475557,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Automatically describing video, or video captioning, has been widely studied
in the multimedia field. This paper proposes a new task of sensor-augmented
egocentric-video captioning, a newly constructed dataset for it called MMAC
Captions, and a method for the newly proposed task that effectively utilizes
multi-modal data of video and motion sensors, or inertial measurement units
(IMUs). While conventional video captioning tasks have difficulty in dealing
with detailed descriptions of human activities due to the limited view of a
fixed camera, egocentric vision has greater potential to be used for generating
the finer-grained descriptions of human activities on the basis of a much
closer view. In addition, we utilize wearable-sensor data as auxiliary
information to mitigate the inherent problems in egocentric vision: motion
blur, self-occlusion, and out-of-camera-range activities. We propose a method
for effectively utilizing the sensor data in combination with the video data on
the basis of an attention mechanism that dynamically determines the modality
that requires more attention, taking the contextual information into account.
We compared the proposed sensor-fusion method with strong baselines on the MMAC
Captions dataset and found that using sensor data as supplementary information
to the egocentric-video data was beneficial, and that our proposed method
outperformed the strong baselines, demonstrating the effectiveness of the
proposed method.
","[{'version': 'v1', 'created': 'Tue, 7 Sep 2021 09:22:09 GMT'}]",2021-09-08,"[['Nakamura', 'Katsuyuki', ''], ['Ohashi', 'Hiroki', ''], ['Okada', 'Mitsuhiro', '']]","['Video captioning', 'egocentric vision', 'sensor fusion']"
11392,2211.06131,Klaus-Tycho Foerster,"Neta Rozen Schiff and Klaus-Tycho Foerster and Stefan Schmid and David
  Hay","Chopin: Combining Distributed and Centralized Schedulers for
  Self-Adjusting Datacenter Networks",To appear at OPODIS 2022,,10.4230/LIPIcs.OPODIS.2022.4,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The performance of distributed and data-centric applications often critically
depends on the interconnecting network. Emerging reconfigurable datacenter
networks (RDCNs) are a particularly innovative approach to improve datacenter
throughput. Relying on a dynamic optical topology which can be adjusted towards
the workload in a demand-aware manner, RDCNs allow to exploit temporal and
spatial locality in the communication pattern, and to provide topological
shortcuts for frequently communicating racks. The key challenge, however,
concerns how to realize demand-awareness in RDCNs in a scalable fashion.
  This paper presents and evaluates Chopin, a hybrid scheduler for
self-adjusting networks that provides demand-awareness at low overhead, by
combining centralized and distributed approaches. Chopin allocates optical
circuits to elephant flows, through its slower centralized scheduler, utilizing
global information. Chopin's distributed scheduler is orders of magnitude
faster and can swiftly react to changes in the traffic and adjust the optical
circuits accordingly, by using only local information and running at each rack
separately.
","[{'version': 'v1', 'created': 'Fri, 11 Nov 2022 11:22:07 GMT'}]",2022-11-14,"[['Schiff', 'Neta Rozen', ''], ['Foerster', 'Klaus-Tycho', ''], ['Schmid', 'Stefan', ''], ['Hay', 'David', '']]","['reconfigurable optical networks', 'centralized scheduler', 'distributed scheduler']"
11393,2104.03062,Emma Stensby Norstein,"Emma Hjellbrekke Stensby, Kai Olav Ellefsen and Kyrre Glette","Co-optimising Robot Morphology and Controller in a Simulated Open-Ended
  Environment","17 pages, 8 figures",,10.1007/978-3-030-72699-7_3,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Designing robots by hand can be costly and time consuming, especially if the
robots have to be created with novel materials, or be robust to internal or
external changes. In order to create robots automatically, without the need for
human intervention, it is necessary to optimise both the behaviour and the body
design of the robot. However, when co-optimising the morphology and controller
of a locomoting agent the morphology tends to converge prematurely, reaching a
local optimum. Approaches such as explicit protection of morphological
innovation have been used to reduce this problem, but it might also be possible
to increase exploration of morphologies using a more indirect approach. We
explore how changing the environment, where the agent locomotes, affects the
convergence of morphologies. The agents' morphologies and controllers are
co-optimised, while the environments the agents locomote in are evolved
open-endedly with the Paired Open-Ended Trailblazer (POET). We compare the
diversity, fitness and robustness of agents evolving in environments generated
by POET to agents evolved in handcrafted curricula of environments. Our agents
each contain of a population of individuals being evolved with a genetic
algorithm. This population is called the agent-population. We show that
agent-populations evolving in open-endedly evolving environments exhibit larger
morphological diversity than agent-populations evolving in hand crafted
curricula of environments. POET proved capable of creating a curriculum of
environments which encouraged both diversity and quality in the populations.
This suggests that POET may be capable of reducing premature convergence in
co-optimisation of morphology and controllers.
","[{'version': 'v1', 'created': 'Wed, 7 Apr 2021 11:28:23 GMT'}]",2021-04-08,"[['Stensby', 'Emma Hjellbrekke', ''], ['Ellefsen', 'Kai Olav', ''], ['Glette', 'Kyrre', '']]","['Evolutionary algorithms', 'Evolutionary robotics', 'Open-endedness', 'Co-optimisation', 'Environments']"
11394,cs/0702103,Philipp Mayr,"Dirk Lewandowski, Philipp Mayr",Exploring the academic invisible web,"13 pages, 3 figures","Library Hi Tech, 24 (2006) 4. pp. 529-539",10.1108/07378830610715392,,cs.DL,,"  Purpose: To provide a critical review of Bergman's 2001 study on the Deep
Web. In addition, we bring a new concept into the discussion, the Academic
Invisible Web (AIW). We define the Academic Invisible Web as consisting of all
databases and collections relevant to academia but not searchable by the
general-purpose internet search engines. Indexing this part of the Invisible
Web is central to scientific search engines. We provide an overview of
approaches followed thus far. Design/methodology/approach: Discussion of
measures and calculations, estimation based on informetric laws. Literature
review on approaches for uncovering information from the Invisible Web.
Findings: Bergman's size estimate of the Invisible Web is highly questionable.
We demonstrate some major errors in the conceptual design of the Bergman paper.
A new (raw) size estimate is given. Research limitations/implications: The
precision of our estimate is limited due to a small sample size and lack of
reliable data. Practical implications: We can show that no single library alone
will be able to index the Academic Invisible Web. We suggest collaboration to
accomplish this task. Originality/value: Provides library managers and those
interested in developing academic search engines with data on the size and
attributes of the Academic Invisible Web.
","[{'version': 'v1', 'created': 'Sun, 18 Feb 2007 20:56:34 GMT'}]",2019-01-15,"[['Lewandowski', 'Dirk', ''], ['Mayr', 'Philipp', '']]","['Search engines', 'Worldwide Web', 'Indexing', 'Scholarly content', 'Digital library  Paper type Research paper']"
11395,1905.09374,Thomas Helmuth,"Lia Jundt, Thomas Helmuth",Comparing and Combining Lexicase Selection and Novelty Search,,,10.1145/3321707.3321787,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lexicase selection and novelty search, two parent selection methods used in
evolutionary computation, emphasize exploring widely in the search space more
than traditional methods such as tournament selection. However, lexicase
selection is not explicitly driven to select for novelty in the population, and
novelty search suffers from lack of direction toward a goal, especially in
unconstrained, highly-dimensional spaces. We combine the strengths of lexicase
selection and novelty search by creating a novelty score for each test case,
and adding those novelty scores to the normal error values used in lexicase
selection. We use this new novelty-lexicase selection to solve automatic
program synthesis problems, and find it significantly outperforms both novelty
search and lexicase selection. Additionally, we find that novelty search has
very little success in the problem domain of program synthesis. We explore the
effects of each of these methods on population diversity and long-term problem
solving performance, and give evidence to support the hypothesis that
novelty-lexicase selection resists converging to local optima better than
lexicase selection.
","[{'version': 'v1', 'created': 'Wed, 22 May 2019 21:38:00 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Jul 2019 14:28:15 GMT'}]",2019-07-04,"[['Jundt', 'Lia', ''], ['Helmuth', 'Thomas', '']]","['genetic programming', 'lexicase selection', 'novelty search', 'programsynthesis']"
11396,1911.01690,Zhuo Wang,"Zhuo Wang, Runlong Hu, Qian Chen, Pei Gao, and Xiaowei Xu","ColluEagle: Collusive review spammer detection using Markov random
  fields","16 pages, 12 figures","Data mining and knowledge discovery, 2020, 34(6): 1621-1641",10.1007/s10618-020-00693-w,,cs.IR cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Product reviews are extremely valuable for online shoppers in providing
purchase decisions. Driven by immense profit incentives, fraudsters
deliberately fabricate untruthful reviews to distort the reputation of online
products. As online reviews become more and more important, group spamming,
i.e., a team of fraudsters working collaboratively to attack a set of target
products, becomes a new fashion. Previous works use review network effects,
i.e. the relationships among reviewers, reviews, and products, to detect fake
reviews or review spammers, but ignore time effects, which are critical in
characterizing group spamming. In this paper, we propose a novel Markov random
field (MRF)-based method (ColluEagle) to detect collusive review spammers, as
well as review spam campaigns, considering both network effects and time
effects. First we identify co-review pairs, a review phenomenon that happens
between two reviewers who review a common product in a similar way, and then
model reviewers and their co-review pairs as a pairwise-MRF, and use loopy
belief propagation to evaluate the suspiciousness of reviewers. We further
design a high quality yet easy-to-compute node prior for ColluEagle, through
which the review spammer groups can also be subsequently identified.
Experiments show that ColluEagle can not only detect collusive spammers with
high precision, significantly outperforming state-of-the-art baselines ---
FraudEagle and SpEagle, but also identify highly suspicious review spammer
campaigns.
","[{'version': 'v1', 'created': 'Tue, 5 Nov 2019 09:57:36 GMT'}]",2020-10-08,"[['Wang', 'Zhuo', ''], ['Hu', 'Runlong', ''], ['Chen', 'Qian', ''], ['Gao', 'Pei', ''], ['Xu', 'Xiaowei', '']]","['Fake review detection', 'Reviewspammer detection', 'Group spamming', 'Markov random field', 'Loopy belief propagation']"
11397,2005.10033,Nils Gessert,"Nils Gessert, Marcel Bengs, Matthias Schl\""uter, and Alexander
  Schlaefer","Deep learning with 4D spatio-temporal data representations for OCT-based
  force estimation",Accepted for publication in Medical Image Analysis,,10.1016/j.media.2020.101730,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Estimating the forces acting between instruments and tissue is a challenging
problem for robot-assisted minimally-invasive surgery. Recently, numerous
vision-based methods have been proposed to replace electro-mechanical
approaches. Moreover, optical coherence tomography (OCT) and deep learning have
been used for estimating forces based on deformation observed in volumetric
image data. The method demonstrated the advantage of deep learning with 3D
volumetric data over 2D depth images for force estimation. In this work, we
extend the problem of deep learning-based force estimation to 4D
spatio-temporal data with streams of 3D OCT volumes. For this purpose, we
design and evaluate several methods extending spatio-temporal deep learning to
4D which is largely unexplored so far. Furthermore, we provide an in-depth
analysis of multi-dimensional image data representations for force estimation,
comparing our 4D approach to previous, lower-dimensional methods. Also, we
analyze the effect of temporal information and we study the prediction of
short-term future force values, which could facilitate safety features. For our
4D force estimation architectures, we find that efficient decoupling of spatial
and temporal processing is advantageous. We show that using 4D spatio-temporal
data outperforms all previously used data representations with a mean absolute
error of 10.7mN. We find that temporal information is valuable for force
estimation and we demonstrate the feasibility of force prediction.
","[{'version': 'v1', 'created': 'Wed, 20 May 2020 13:30:36 GMT'}]",2020-08-07,"[['Gessert', 'Nils', ''], ['Bengs', 'Marcel', ''], ['Schlüter', 'Matthias', ''], ['Schlaefer', 'Alexander', '']]","['4D Deep Learning', '4D DataRepresentations', 'Optical Coherence Tomography', 'Force Estimation']"
11398,1703.10863,Tomas Petricek,"Tomas Petricek (Alan Turing Institute, United Kingdom)",Miscomputation in software: Learning to live with errors,,"The Art, Science, and Engineering of Programming, 2017, Vol. 1,
  Issue 2, Article 14",10.22152/programming-journal.org/2017/1/14,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer programs do not always work as expected. In fact, ominous warnings
about the desperate state of the software industry continue to be released with
almost ritualistic regularity. In this paper, we look at the 60 years history
of programming and at the different practical methods that software community
developed to live with programming errors. We do so by observing a class of
students discussing different approaches to programming errors. While learning
about the different methods for dealing with errors, we uncover basic
assumptions that proponents of different paradigms follow. We learn about the
mathematical attempt to eliminate errors through formal methods, scientific
method based on testing, a way of building reliable systems through engineering
methods, as well as an artistic approach to live coding that accepts errors as
a creative inspiration. This way, we can explore the differences and
similarities among the different paradigms. By inviting proponents of different
methods into a single discussion, we hope to open potential for new thinking
about errors. When should we use which of the approaches? And what can software
development learn from mathematics, science, engineering and art? When
programming or studying programming, we are often enclosed in small communities
and we take our basic assumptions for granted. Through the discussion in this
paper, we attempt to map the large and rich space of programming ideas and
provide reference points for exploring, perhaps foreign, ideas that can
challenge some of our assumptions.
","[{'version': 'v1', 'created': 'Fri, 31 Mar 2017 11:47:06 GMT'}]",2017-04-03,"[['Petricek', 'Tomas', '', 'Alan Turing Institute, United Kingdom']]","['Miscomputation', 'errors', 'philosophy', 'paradigms']"
11399,2111.00350,Sourya Dipta Das,"Sourya Dipta Das, Ayan Basak, Soumil Mandal, Dipankar Das",AdvCodeMix: Adversarial Attack on Code-Mixed Data,Accepted to CODS-COMAD 2022,,10.1145/3493700.3493705,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Research on adversarial attacks are becoming widely popular in the recent
years. One of the unexplored areas where prior research is lacking is the
effect of adversarial attacks on code-mixed data. Therefore, in the present
work, we have explained the first generalized framework on text perturbation to
attack code-mixed classification models in a black-box setting. We rely on
various perturbation techniques that preserve the semantic structures of the
sentences and also obscure the attacks from the perception of a human user. The
present methodology leverages the importance of a token to decide where to
attack by employing various perturbation strategies. We test our strategies on
various sentiment classification models trained on Bengali-English and
Hindi-English code-mixed datasets, and reduce their F1-scores by nearly 51 %
and 53 % respectively, which can be further reduced if a larger number of
tokens are perturbed in a given sentence.
","[{'version': 'v1', 'created': 'Sat, 30 Oct 2021 22:02:22 GMT'}]",2021-11-02,"[['Das', 'Sourya Dipta', ''], ['Basak', 'Ayan', ''], ['Mandal', 'Soumil', ''], ['Das', 'Dipankar', '']]","['adversarial attack', 'natural language processing', 'deep learning', 'code-mixed data', 'text classification']"
11400,2011.09867,Hanshuang Tong,"Hanshuang Tong, Yun Zhou and Zhen Wang",Exercise Hierarchical Feature Enhanced Knowledge Tracing,"5 pages, 4 figures, Accepted by AIED 2020. In the 21st International
  Conference on Artificial Intelligence in Education (AIED 2020)",,10.1007/978-3-030-52240-7_59,,cs.CY cs.AI cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge tracing is a fundamental task in the computer-aid educational
system. In this paper, we propose a hierarchical exercise feature enhanced
knowledge tracing framework, which could enhance the ability of knowledge
tracing by incorporating knowledge distribution, semantic features, and
difficulty features from exercise text. Extensive experiments show the high
performance of our framework.
","[{'version': 'v1', 'created': 'Fri, 23 Oct 2020 12:16:07 GMT'}]",2020-11-20,"[['Tong', 'Hanshuang', ''], ['Zhou', 'Yun', ''], ['Wang', 'Zhen', '']]","['Knowledge Tracing', 'Intelligent Education', 'Deep Learning']"
11401,1905.01996,Maulik Parmar,"Maulik Parmar, V.Susheela Devi",Neural Machine Translation with Recurrent Highway Networks,"International Conference on Mining Intelligence and Knowledge
  Exploration","In: Groza A., Prasath R. (eds) Mining Intelligence and Knowledge
  Exploration. MIKE 2018. Lecture Notes in Computer Science, vol 11308.
  Springer, Cham",10.1007/978-3-030-05918-7_27,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recurrent Neural Networks have lately gained a lot of popularity in language
modelling tasks, especially in neural machine translation(NMT). Very recent NMT
models are based on Encoder-Decoder, where a deep LSTM based encoder is used to
project the source sentence to a fixed dimensional vector and then another deep
LSTM decodes the target sentence from the vector. However there has been very
little work on exploring architectures that have more than one layer in
space(i.e. in each time step). This paper examines the effectiveness of the
simple Recurrent Highway Networks(RHN) in NMT tasks. The model uses Recurrent
Highway Neural Network in encoder and decoder, with attention .We also explore
the reconstructor model to improve adequacy. We demonstrate the effectiveness
of all three approaches on the IWSLT English-Vietnamese dataset. We see that
RHN performs on par with LSTM based models and even better in some cases.We see
that deep RHN models are easy to train compared to deep LSTM based models
because of highway connections. The paper also investigates the effects of
increasing recurrent depth in each time step.
","[{'version': 'v1', 'created': 'Sun, 28 Apr 2019 08:27:55 GMT'}]",2019-05-07,"[['Parmar', 'Maulik', ''], ['Devi', 'V. Susheela', '']]","['Recurrent Highway Networks', 'Reconstructor', 'Attention', 'EncoderDecoder']"
11402,2109.09489,Michael Kraus,Michael Kraus and Irfan Custovic and Walter Kaufmann,"Struct-MRT: Immersive Learning and Teaching of Design and Verification
  in Structural Civil Engineering using Mixed Reality",,,10.13140/RG.2.2.27661.46563,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Our goal is to transform traditional paper-based instruction into an
immersive lesson. This paper presents the conception, workflow and deployment
of two MR applications for verification of typical yet geometrically complex
structural members: a reinforced concrete corbel and a steel frame. The aim of
this research is threefold: (i) to develop and implement the technological
feasibility of such applications, (ii) to demonstrate possible use cases in the
context of structural engineering lectures and (iii) to evaluate the presented
MR examples and the future potential of such MR applications in structural
engineering lectures through a survey. The workflow and MR teaching
applications were developed with Apple's ARKit. The verification process was
reproduced in the MR applications based on conventional exercises taught on
paper. Users can navigate independently through the applications and review
every single step, including a true-to-scale, spatial representation of the
specific component as well as associated verification formulas in the
respective step. The applications were used to assess the demand and
expectations for immersive teaching techniques among students and instructors
through a survey. The participants were asked to test the MR applications on
their devices or watch pre-recorded video demonstrations, afterwards perception
was elicited through a questionnaire. The results of subsequent data analysis
show generally positive judgement of the MR application over the six questioned
categories (style, usefulness, ease of use, enjoyment, attitude as well as
intention towards using). The statistical analysis revealed (positivity) biases
for users with prior XR experience w.r.t. to usage and navigation, while
inexperienced users underlined increased enjoyment or excitement with this
learning format. The outlook covers identified shortcomings and future
developments in this field.
","[{'version': 'v1', 'created': 'Mon, 20 Sep 2021 12:46:52 GMT'}]",2021-09-21,"[['Kraus', 'Michael', ''], ['Custovic', 'Irfan', ''], ['Kaufmann', 'Walter', '']]","['Mixed Reality (MR)', 'Engineering Education', 'Civil (Structural) Engineering', 'InteractiveLearning Environments', 'Curriculum']"
11403,2005.08748,"Peter Gr\""onquist","Peter Gr\""onquist, Chengyuan Yao, Tal Ben-Nun, Nikoli Dryden, Peter
  Dueben, Shigang Li, Torsten Hoefler",Deep Learning for Post-Processing Ensemble Weather Forecasts,,,10.1098/rsta.2020.0092,,cs.LG eess.SP physics.ao-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quantifying uncertainty in weather forecasts is critical, especially for
predicting extreme weather events. This is typically accomplished with ensemble
prediction systems, which consist of many perturbed numerical weather
simulations, or trajectories, run in parallel. These systems are associated
with a high computational cost and often involve statistical post-processing
steps to inexpensively improve their raw prediction qualities. We propose a
mixed model that uses only a subset of the original weather trajectories
combined with a post-processing step using deep neural networks. These enable
the model to account for non-linear relationships that are not captured by
current numerical models or post-processing methods. Applied to global data,
our mixed models achieve a relative improvement in ensemble forecast skill
(CRPS) of over 14%. Furthermore, we demonstrate that the improvement is larger
for extreme weather events on select case studies. We also show that our
post-processing can use fewer trajectories to achieve comparable results to the
full ensemble. By using fewer trajectories, the computational costs of an
ensemble prediction system can be reduced, allowing it to run at higher
resolution and produce more accurate forecasts.
","[{'version': 'v1', 'created': 'Mon, 18 May 2020 14:23:26 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Sep 2020 11:08:47 GMT'}]",2021-03-17,"[['Grönquist', 'Peter', ''], ['Yao', 'Chengyuan', ''], ['Ben-Nun', 'Tal', ''], ['Dryden', 'Nikoli', ''], ['Dueben', 'Peter', ''], ['Li', 'Shigang', ''], ['Hoefler', 'Torsten', '']]","['Deep Learning', 'Weather Uncertainty Quantification', 'Ensemble Post-Processing', 'Extreme Weather Events']"
11404,2011.14922,Hanwen Miao,"Hanwen Miao, Shengan Zhang, Carol Flannagan","Driver Behavior Extraction from Videos in Naturalistic Driving Datasets
  with 3D ConvNets",,,10.1007/s42421-022-00053-8,,cs.CV cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Naturalistic driving data (NDD) is an important source of information to
understand crash causation and human factors and to further develop crash
avoidance countermeasures. Videos recorded while driving are often included in
such datasets. While there is often a large amount of video data in NDD, only a
small portion of them can be annotated by human coders and used for research,
which underuses all video data. In this paper, we explored a computer vision
method to automatically extract the information we need from videos. More
specifically, we developed a 3D ConvNet algorithm to automatically extract
cell-phone-related behaviors from videos. The experiments show that our method
can extract chunks from videos, most of which (~79%) contain the automatically
labeled cell phone behaviors. In conjunction with human review of the extracted
chunks, this approach can find cell-phone-related driver behaviors much more
efficiently than simply viewing video.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2020 15:53:15 GMT'}]",2022-06-30,"[['Miao', 'Hanwen', ''], ['Zhang', 'Shengan', ''], ['Flannagan', 'Carol', '']]","['cell-phone behaviors', 'video processing', '3D ConvNets']"
11405,2103.07655,Kenji Saito,"Kenji Saito, Satoki Watanabe",Lightweight Selective Disclosure for Verifiable Documents on Blockchain,"10 pages, 4 figures, 1 table","ICT Express, Volume 7, Issue 3, September 2021, Pages 290-294",10.1016/j.icte.2021.08.012,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To achieve lightweight selective disclosure for protecting privacy of
document holders, we propose an XML format for documents that can hide
arbitrary elements using a cryptographic hash function and salts, which allows
to be partially digitally signed and efficiently verified, as well as a JSON
format that can be converted to such XML. The documents can be efficiently
proven to exist by representing multiple such structures as a Merkle tree and
storing its root in blockchain.
  We show that our proposal has advantages over known methods that represent
the document itself as a Merkle tree and partially hide it.
","[{'version': 'v1', 'created': 'Sat, 13 Mar 2021 08:32:45 GMT'}, {'version': 'v2', 'created': 'Sat, 9 Oct 2021 08:22:33 GMT'}]",2021-10-12,"[['Saito', 'Kenji', ''], ['Watanabe', 'Satoki', '']]","['Selective disclosure', 'Content extraction signature', 'Privacy', 'Proof of existence', 'Blockchain']"
11406,1601.03144,Bruce Merry,Bruce Merry,A Performance Comparison of Sort and Scan Libraries for GPUs,"Preprint of an article published in Parallel Processing Letters, 25,
  4, 2015, 1550007 DOI: 10.1142/S0129626415500073 \copyright\ copyright World
  Scientific Publishing Company
  <http://www.worldscientific.com/worldscinet/ppl>","Parallel Processing Letters, 25(4), 2015, p. 1550007",10.1142/S0129626415500073,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sorting and scanning are two fundamental primitives for constructing highly
parallel algorithms. A number of libraries now provide implementations of these
primitives for GPUs, but there is relatively little information about the
performance of these implementations.
  We benchmark seven libraries for 32-bit integer scan and sort, and sorting
32-bit values by 32-bit integer keys. We show that there is a large variation
in performance between the libraries, and that no one library has both optimal
performance and portability.
","[{'version': 'v1', 'created': 'Wed, 13 Jan 2016 06:57:50 GMT'}]",2016-01-14,"[['Merry', 'Bruce', '']]","['benchmark', 'GPU', 'scan', 'sort']"
11407,1906.03037,Vidyasagar Sadhu,"Vidyasagar Sadhu, Gabriel Salles-Loustau, Dario Pompili, Saman Zonouz,
  Vincent Sritapan","Argus: Smartphone-enabled Human Cooperation via Multi-Agent
  Reinforcement Learning for Disaster Situational Awareness",,"2016 IEEE International Conference on Autonomic Computing (ICAC),
  Wurzburg, 2016, pp. 251-256",10.1109/ICAC.2016.43,,cs.CY cs.AI cs.LG cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Argus exploits a Multi-Agent Reinforcement Learning (MARL) framework to
create a 3D mapping of the disaster scene using agents present around the
incident zone to facilitate the rescue operations. The agents can be both human
bystanders at the disaster scene as well as drones or robots that can assist
the humans. The agents are involved in capturing the images of the scene using
their smartphones (or on-board cameras in case of drones) as directed by the
MARL algorithm. These images are used to build real time a 3D map of the
disaster scene. Via both simulations and real experiments, an evaluation of the
framework in terms of effectiveness in tracking random dynamicity of the
environment is presented.
","[{'version': 'v1', 'created': 'Mon, 29 Apr 2019 02:16:32 GMT'}]",2019-06-10,"[['Sadhu', 'Vidyasagar', ''], ['Salles-Loustau', 'Gabriel', ''], ['Pompili', 'Dario', ''], ['Zonouz', 'Saman', ''], ['Sritapan', 'Vincent', '']]","['Disaster response', 'situational awareness', 'multiagent reinforcement learning', 'distributed Q-learning', 'data collection', 'crowdsensing']"
11408,1809.04324,Laksh Bhatia,"Laksh Bhatia, Ivana Tomic, Julie A. McCann","Poster Abstract: LPWA-MAC - a Low Power Wide Area network MAC protocol
  for cyber-physical systems",,,10.1145/3274783.3275183,,cs.SY cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Low-Power Wide-Area Networks (LPWANs) are being successfully used for the
monitoring of large-scale systems that are delay-tolerant and which have
low-bandwidth requirements. The next step would be instrumenting these for the
control of Cyber-Physical Systems (CPSs) distributed over large areas which
require more bandwidth, bounded delays and higher reliability or at least more
rigorous guarantees therein. This paper presents LPWA-MAC, a novel Low Power
Wide-Area network MAC protocol, that ensures bounded end-to-end delays, high
channel utility and supports many of the different traffic patterns and
data-rates typical of CPS.
","[{'version': 'v1', 'created': 'Wed, 12 Sep 2018 09:23:42 GMT'}]",2020-02-06,"[['Bhatia', 'Laksh', ''], ['Tomic', 'Ivana', ''], ['McCann', 'Julie A.', '']]","['Low-Power Wide-Area Networks', 'Cyber-Physical Systems', 'MACprotocol']"
11409,2203.02622,Michael Cochez,Alessandro Generale and Till Blume and Michael Cochez,Scaling R-GCN Training with Graph Summarization,"Companion Proceedings of the Web Conference 2022, April 25-29, 2022",,10.1145/3487553.3524719,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Training of Relational Graph Convolutional Networks (R-GCN) is a memory
intense task. The amount of gradient information that needs to be stored during
training for real-world graphs is often too large for the amount of memory
available on most GPUs. In this work, we experiment with the use of graph
summarization techniques to compress the graph and hence reduce the amount of
memory needed. After training the R-GCN on the graph summary, we transfer the
weights back to the original graph and attempt to perform inference on it. We
obtain reasonable results on the AIFB, MUTAG and AM datasets. Our experiments
show that training on the graph summary can yield a comparable or higher
accuracy to training on the original graphs.Furthermore, if we take the time to
compute the summary out of the equation, we observe that the smaller graph
representations obtained with graph summarization methods reduces the
computational overhead. However, further experiments are needed to evaluate
additional graph summary models and whether our findings also holds true for
very large graphs.
","[{'version': 'v1', 'created': 'Sat, 5 Mar 2022 00:28:43 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Mar 2022 00:16:15 GMT'}]",2022-03-22,"[['Generale', 'Alessandro', ''], ['Blume', 'Till', ''], ['Cochez', 'Michael', '']]","['graph neural network', 'scalability', 'graph summarization']"
11410,2012.02600,Bilal Farooq,Irum Sanaullah and Nael Alsaleh and Shadi Djavadian and Bilal Farooq,"Spatio-Temporal Analysis of On Demand Transit: A Case Study of
  Belleville, Canada",,"Transportation Research Part A: Planning and Policy, 2021, Volume
  145, Pages 284-301",10.1016/j.tra.2021.01.020,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rapid increase in the cyber-physical nature of transportation,
availability of GPS data, mobile applications, and effective communication
technologies have led to the emergence of On-Demand Transit (ODT) systems. In
September 2018, the City of Belleville in Canada started an on-demand public
transit pilot project, where the late-night fixed-route (RT 11) was substituted
with the ODT providing a real-time ride-hailing service. We present an in-depth
analysis of the spatio-temporal demand and supply, level of service, and origin
and destination patterns of Belleville ODT users, based on the data collected
from September 2018 till May 2019. The independent and combined effects of the
demographic characteristics (population density, working-age, and median
income) on the ODT trip production and attraction levels were studied using GIS
and the K-means machine learning clustering algorithm. The results indicate
that ODT trips demand is highest for 11:00 pm-11:45 pm during the weekdays and
8:00 pm-8:30 pm during the weekends. We expect this to be the result of users
returning home from work or shopping. Results showed that 39% of the trips were
found to have a waiting time of smaller than 15 minutes, while 28% of trips had
a waiting time of 15-30 minutes. The dissemination areas with higher population
density, lower median income, or higher working-age percentages tend to have
higher ODT trip attraction levels, except for the dissemination areas that have
highly attractive places like commercial areas.
","[{'version': 'v1', 'created': 'Fri, 4 Dec 2020 13:56:18 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Feb 2022 01:48:53 GMT'}]",2022-02-23,"[['Sanaullah', 'Irum', ''], ['Alsaleh', 'Nael', ''], ['Djavadian', 'Shadi', ''], ['Farooq', 'Bilal', '']]","['On-Demand Transit', 'Ride-hailing', 'Demand Patterns', 'k-means clustering']"
11411,2109.04368,Guangping Li,"Sujoy Bhore, Robert Ganian, Guangping Li, Martin N\""ollenburg, Jules
  Wulms",Worbel: Aggregating Point Labels into Word Clouds,"22 pages, 11 figures (21 subfigures), accepted by sigspatial 2021",,10.1145/3474717.3483959,,cs.CG cs.CC cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Point feature labeling is a classical problem in cartography and GIS that has
been extensively studied for geospatial point data. At the same time, word
clouds are a popular visualization tool to show the most important words in
text data which has also been extended to visualize geospatial data (Buchin et
al. PacificVis 2016).
  In this paper, we study a hybrid visualization, which combines aspects of
word clouds and point labeling. In the considered setting, the input data
consists of a set of points grouped into categories and our aim is to place
multiple disjoint and axis-aligned rectangles, each representing a category,
such that they cover points of (mostly) the same category under some natural
quality constraints. In our visualization, we then place category names inside
the computed rectangles to produce a labeling of the covered points which
summarizes the predominant categories globally (in a word-cloud-like fashion)
while locally avoiding excessive misrepresentation of points (i.e., retaining
the precision of point labeling).
  We show that computing a minimum set of such rectangles is NP-hard. Hence, we
turn our attention to developing heuristics and exact SAT models to compute our
visualizations. We evaluate our algorithms quantitatively, measuring running
time and quality of the produced solutions, on several artificial and
real-world data sets. Our experiments show that the heuristics produce
solutions of comparable quality to the SAT models while running much faster.
","[{'version': 'v1', 'created': 'Thu, 9 Sep 2021 15:55:29 GMT'}]",2021-09-10,"[['Bhore', 'Sujoy', ''], ['Ganian', 'Robert', ''], ['Li', 'Guangping', ''], ['Nöllenburg', 'Martin', ''], ['Wulms', 'Jules', '']]","['labeling', 'word clouds', 'categorical point data']"
11412,2011.04917,Ramaravind Kommiya Mothilal,"Ramaravind Kommiya Mothilal and Divyat Mahajan and Chenhao Tan and
  Amit Sharma","Towards Unifying Feature Attribution and Counterfactual Explanations:
  Different Means to the Same End","15 pages, 10 figures",,10.1145/3461702.3462597,,cs.LG cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feature attributions and counterfactual explanations are popular approaches
to explain a ML model. The former assigns an importance score to each input
feature, while the latter provides input examples with minimal changes to alter
the model's predictions. To unify these approaches, we provide an
interpretation based on the actual causality framework and present two key
results in terms of their use. First, we present a method to generate feature
attribution explanations from a set of counterfactual examples. These feature
attributions convey how important a feature is to changing the classification
outcome of a model, especially on whether a subset of features is necessary
and/or sufficient for that change, which attribution-based methods are unable
to provide. Second, we show how counterfactual examples can be used to evaluate
the goodness of an attribution-based explanation in terms of its necessity and
sufficiency. As a result, we highlight the complementarity of these two
approaches. Our evaluation on three benchmark datasets - Adult-Income,
LendingClub, and German-Credit - confirms the complementarity. Feature
attribution methods like LIME and SHAP and counterfactual explanation methods
like Wachter et al. and DiCE often do not agree on feature importance rankings.
In addition, by restricting the features that can be modified for generating
counterfactual examples, we find that the top-k features from LIME or SHAP are
often neither necessary nor sufficient explanations of a model's prediction.
Finally, we present a case study of different explanation methods on a
real-world hospital triage problem
","[{'version': 'v1', 'created': 'Tue, 10 Nov 2020 05:41:43 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Feb 2021 12:18:19 GMT'}, {'version': 'v3', 'created': 'Sat, 29 May 2021 17:49:39 GMT'}]",2021-06-01,"[['Mothilal', 'Ramaravind Kommiya', ''], ['Mahajan', 'Divyat', ''], ['Tan', 'Chenhao', ''], ['Sharma', 'Amit', '']]","['explanation', 'feature attribution', 'counterfactual examples', 'actualcausality']"
11413,2002.06223,Gene Cooperman,"Gene Cooperman (Northeastern University, United States), Martin
  Quinson (\'Ecole Normale Sup\'erieure Rennes, France)",Sthread: In-Vivo Model Checking of Multithreaded Programs,,"The Art, Science, and Engineering of Programming, 2020, Vol. 4,
  Issue 3, Article 13",10.22152/programming-journal.org/2020/4/13,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work strives to make formal verification of POSIX multithreaded programs
easily accessible to general programmers. Sthread operates directly on
multithreaded C/C++ programs, without the need for an intermediate formal
model. Sthread is in-vivo in that it provides a drop-in replacement for the
pthread library, and operates directly on the compiled target executable and
application libraries. There is no compiler-generated intermediate
representation. The system calls in the application remain unaltered.
Optionally, the programmer can add a small amount of additional native C code
to include assertions based on the user's algorithm, declarations of shared
memory regions, and progress/liveness conditions. The work has two important
motivations: (i) It can be used to verify correctness of a concurrent algorithm
being implemented with multithreading; and (ii) it can also be used
pedagogically to provide immediate feedback to students learning either to
employ POSIX threads system calls or to implement multithreaded algorithms.
  This work represents the first example of in-vivo model checking operating
directly on the standard multithreaded executable and its libraries, without
the aid of a compiler-generated intermediate representation. Sthread leverages
the open-source SimGrid libraries, and will eventually be integrated into
SimGrid. Sthread employs a non-preemptive model in which thread context
switches occur only at multithreaded system calls (e.g., mutex, semaphore) or
before accesses to shared memory regions. The emphasis is on finding
""algorithmic bugs"" (bugs in an original algorithm, implemented as POSIX threads
and shared memory regions. This work is in contrast to Context-Bounded Analysis
(CBA), which assumes a preemptive model for threads, and emphasizes
implementation bugs such as buffer overruns and write-after-free for memory
allocation. In particular, the Sthread in-vivo approach has strong future
potential for pedagogy, by providing immediate feedback to students who are
first learning the correct use of Pthreads system calls in implementation of
concurrent algorithms based on multithreading.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 19:21:42 GMT'}]",2020-02-18,"[['Cooperman', 'Gene', '', 'Northeastern University, United States'], ['Quinson', 'Martin', '', 'École Normale Supérieure Rennes, France']]","['model checking', 'in-vivo model checking', 'debugging', 'formal verification', 'SimGrid']"
11414,2109.00733,Tracy Tam,"Tracy Tam, Asha Rao and Joanne Hall","The Good, The Bad and The Missing: A Narrative Review of Cyber-security
  Implications for Australian Small Businesses",,Computer & Security 109 (2021) 102385,10.1016/j.cose.2021.102385,,cs.CR,http://creativecommons.org/licenses/by-sa/4.0/,"  Small businesses (0-19 employees) are becoming attractive targets for
cyber-criminals, but struggle to implement cyber-security measures that large
businesses routinely deploy. There is an urgent need for effective and suitable
cyber-security solutions for small businesses as they employ a significant
proportion of the workforce.
  In this paper, we consider the small business cyber-security challenges not
currently addressed by research or products, contextualised via an Australian
lens. We also highlight some unique characteristics of small businesses
conducive to cyber-security actions.
  Small business cyber-security discussions to date have been narrow in focus
and lack re-usability beyond specific circumstances. Our study uses global
evidence from industry, government and research communities across multiple
disciplines. We explore the technical and non-technical factors negatively
impacting a small business' ability to safeguard itself, such as resource
constraints, organisational process maturity, and legal structures. Our
research shows that some small business characteristics, such as agility, large
cohort size, and piecemeal IT architecture, could allow for increased
cyber-security.
  We conclude that there is a gap in current research in small business
cyber-security. In addition, legal and policy work are needed to help small
businesses become cyber-resilient.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2021 06:21:52 GMT'}]",2021-09-03,"[['Tam', 'Tracy', ''], ['Rao', 'Asha', ''], ['Hall', 'Joanne', '']]","['Cyber-security', 'Small Business', 'SME', 'Security Culture', 'Literature Review']"
11415,2006.06922,Deqing Yang,Wenjing Meng and Deqing Yang and Yanghua Xiao,"Incorporating User Micro-behaviors and Item Knowledge into Multi-task
  Learning for Session-based Recommendation",,SIGIR 2020,10.1145/3397271.3401098,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Session-based recommendation (SR) has become an important and popular
component of various e-commerce platforms, which aims to predict the next
interacted item based on a given session. Most of existing SR models only focus
on exploiting the consecutive items in a session interacted by a certain user,
to capture the transition pattern among the items. Although some of them have
been proven effective, the following two insights are often neglected. First, a
user's micro-behaviors, such as the manner in which the user locates an item,
the activities that the user commits on an item (e.g., reading comments, adding
to cart), offer fine-grained and deep understanding of the user's preference.
Second, the item attributes, also known as item knowledge, provide side
information to model the transition pattern among interacted items and
alleviate the data sparsity problem. These insights motivate us to propose a
novel SR model MKM-SR in this paper, which incorporates user Micro-behaviors
and item Knowledge into Multi-task learning for Session-based Recommendation.
Specifically, a given session is modeled on micro-behavior level in MKM-SR,
i.e., with a sequence of item-operation pairs rather than a sequence of items,
to capture the transition pattern in the session sufficiently. Furthermore, we
propose a multi-task learning paradigm to involve learning knowledge embeddings
which plays a role as an auxiliary task to promote the major task of SR. It
enables our model to obtain better session representations, resulting in more
precise SR recommendation results. The extensive evaluations on two benchmark
datasets demonstrate MKM-SR's superiority over the state-of-the-art SR models,
justifying the strategy of incorporating knowledge learning.
","[{'version': 'v1', 'created': 'Fri, 12 Jun 2020 03:06:23 GMT'}]",2020-06-19,"[['Meng', 'Wenjing', ''], ['Yang', 'Deqing', ''], ['Xiao', 'Yanghua', '']]","['session-based recommendation', 'micro-behavior', 'multi-task learning', 'knowledge']"
11416,2301.06680,Prateek Chhikara,"Prateek Chhikara, Harshul Kuhar, Anil Goyal, Chirag Sharma",DIGITOUR: Automatic Digital Tours for Real-Estate Properties,Published at CODS-COMAD '23,,10.1145/3570991.3571060,,cs.CV cs.GR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A virtual or digital tour is a form of virtual reality technology which
allows a user to experience a specific location remotely. Currently, these
virtual tours are created by following a 2-step strategy. First, a photographer
clicks a 360 degree equirectangular image; then, a team of annotators manually
links these images for the ""walkthrough"" user experience. The major challenge
in the mass adoption of virtual tours is the time and cost involved in manual
annotation/linking of images. Therefore, this paper presents an end-to-end
pipeline to automate the generation of 3D virtual tours using equirectangular
images for real-estate properties. We propose a novel HSV-based coloring scheme
for paper tags that need to be placed at different locations before clicking
the equirectangular images using 360 degree cameras. These tags have two
characteristics: i) they are numbered to help the photographer for placement of
tags in sequence and; ii) bi-colored, which allows better learning of tag
detection (using YOLOv5 architecture) in an image and digit recognition (using
custom MobileNet architecture) tasks. Finally, we link/connect all the
equirectangular images based on detected tags. We show the efficiency of the
proposed pipeline on a real-world equirectangular image dataset collected from
the Housing.com database.
","[{'version': 'v1', 'created': 'Tue, 17 Jan 2023 03:43:34 GMT'}]",2023-01-18,"[['Chhikara', 'Prateek', ''], ['Kuhar', 'Harshul', ''], ['Goyal', 'Anil', ''], ['Sharma', 'Chirag', '']]","['Computer Vision', 'Real-Estate', 'Virtual Tour', 'Digit Recognition']"
11417,2010.14824,Namwoo Kang,"Soyoung Yoo, Namwoo Kang","Explainable Artificial Intelligence for Manufacturing Cost Estimation
  and Machining Feature Visualization",,"Expert Systems with Applications, 183, 115430 (2021)",10.1016/j.eswa.2021.115430,,cs.CG cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Studies on manufacturing cost prediction based on deep learning have begun in
recent years, but the cost prediction rationale cannot be explained because the
models are still used as a black box. This study aims to propose a
manufacturing cost prediction process for 3D computer-aided design (CAD) models
using explainable artificial intelligence. The proposed process can visualize
the machining features of the 3D CAD model that are influencing the increase in
manufacturing costs. The proposed process consists of (1) data collection and
pre-processing, (2) 3D deep learning architecture exploration, and (3)
visualization to explain the prediction results. The proposed deep learning
model shows high predictability of manufacturing cost for the computer
numerical control (CNC) machined parts. In particular, using 3D
gradient-weighted class activation mapping proves that the proposed model not
only can detect the CNC machining features but also can differentiate the
machining difficulty for the same feature. Using the proposed process, we can
provide a design guidance to engineering designers in reducing manufacturing
costs during the conceptual design phase. We can also provide real-time
quotations and redesign proposals to online manufacturing platform customers.
","[{'version': 'v1', 'created': 'Wed, 28 Oct 2020 08:58:09 GMT'}, {'version': 'v2', 'created': 'Sun, 13 Jun 2021 05:31:01 GMT'}]",2022-10-04,"[['Yoo', 'Soyoung', ''], ['Kang', 'Namwoo', '']]","['Cost estimation', 'Machining feature', 'Deep learning', 'Explainable artificial intelligence (XAI)', '3D CAD', '3D Grad-CAM']"
11418,2201.10510,Christof Beierle,Christof Beierle and Claude Carlet,"Gold Functions and Switched Cube Functions Are Not 0-Extendable in
  Dimension $n > 5$",,,10.1007/s10623-022-01111-6,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the independent works by Kalgin and Idrisova and by Beierle, Leander and
Perrin, it was observed that the Gold APN functions over $\mathbb{F}_{2^5}$
give rise to a quadratic APN function in dimension 6 having maximum possible
linearity of $2^5$ (that is, minimum possible nonlinearity $2^4$). In this
article, we show that the case of $n \leq 5$ is quite special in the sense that
Gold APN functions in dimension $n>5$ cannot be extended to quadratic APN
functions in dimension $n+1$ having maximum possible linearity. In the second
part of this work, we show that this is also the case for APN functions of the
form $x \mapsto x^3 + \mu(x)$ with $\mu$ being a quadratic Boolean function.
","[{'version': 'v1', 'created': 'Tue, 25 Jan 2022 18:11:32 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Feb 2022 15:55:49 GMT'}, {'version': 'v3', 'created': 'Wed, 28 Sep 2022 14:38:00 GMT'}]",2022-09-29,"[['Beierle', 'Christof', ''], ['Carlet', 'Claude', '']]","['Gold function', 'APN', 'linearity', 'nonlinearity', 'trim', 'extension']"
11419,2106.05686,Mattias Nilsson,"Mattias Nilsson, Foteini Liwicki, and Fredrik Sandin","Spatiotemporal Pattern Recognition in Single Mixed-Signal VLSI Neurons
  with Heterogeneous Dynamic Synapses","Accepted for publication in the Proceedings of the 2022 International
  Conference on Neuromorphic Systems (ICONS 2022)",,10.1145/3546790.3546794,,cs.NE cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Mixed-signal neuromorphic processors with brain-like organization and device
physics offer an ultra-low-power alternative to the unsustainable developments
of conventional deep learning and computing. However, realizing the potential
of such neuromorphic hardware requires efficient use of its heterogeneous,
analog neurosynaptic circuitry with neurocomputational methods for sparse,
spike-timing-based encoding and processing. Here, we investigate the use of
balanced excitatory-inhibitory disynaptic lateral connections as a
resource-efficient mechanism for implementing a thalamocortically inspired
Spatiotemporal Correlator (STC) neural network without using dedicated delay
mechanisms. We present hardware-in-the-loop experiments with a DYNAP-SE
neuromorphic processor, in which receptive fields of heterogeneous
coincidence-detection neurons in an STC network with four lateral afferent
connections per column were mapped by random input-sampling. Furthermore, we
demonstrate how such a neuron was tuned to detect a particular spatiotemporal
feature by discrete address-reprogramming of the analog synaptic circuits. The
energy dissipation of the disynaptic connections is one order of magnitude
lower per lateral connection (0.65 nJ vs 9.6 nJ per spike) than in the former
delay-based hardware implementation of the STC.
","[{'version': 'v1', 'created': 'Thu, 10 Jun 2021 12:04:03 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Aug 2022 09:50:13 GMT'}]",2022-08-05,"[['Nilsson', 'Mattias', ''], ['Liwicki', 'Foteini', ''], ['Sandin', 'Fredrik', '']]","['Neuromorphic', 'Spatiotemporal pattern recognition', 'Ultra-low-power', 'Device mismatch', 'Neural heterogeneity', 'Temporal code', 'Excitatory–inhibitory balance']"
11420,2101.07902,Andrew McNutt,"Andrew McNutt, Ravi Chugh",Integrated Visualization Editing via Parameterized Declarative Templates,"14 pages, 8 Figures, and a 4 page supplement with 4 figures and 1
  table","CHI Conference on Human Factors in Computing Systems (CHI '21),
  May 8-13, 2021, Yokohama, Japan",10.1145/3411764.3445356,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interfaces for creating visualizations typically embrace one of several
common forms. Textual specification enables fine-grained control, shelf
building facilitates rapid exploration, while chart choosing promotes immediacy
and simplicity. Ideally these approaches could be unified to integrate the
user- and usage-dependent benefits found in each modality, yet these forms
remain distinct. We propose parameterized declarative templates, a simple
abstraction mechanism over JSON-based visualization grammars, as a foundation
for multimodal visualization editors. We demonstrate how templates can
facilitate organization and reuse by factoring the more than 160 charts that
constitute Vega-Lite's example gallery into approximately 40 templates. We
exemplify the pliability of abstracting over charting grammars by implementing
-- as a template -- the functionality of the shelf builder Polestar (a
simulacra of Tableau) and a set of templates that emulate the Google Sheets
chart chooser. We show how templates support multimodal visualization editing
by implementing a prototype and evaluating it through an approachability study.
","[{'version': 'v1', 'created': 'Tue, 19 Jan 2021 23:56:59 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Jan 2021 16:00:39 GMT'}]",2021-01-27,"[['McNutt', 'Andrew', ''], ['Chugh', 'Ravi', '']]","['Information Visualization', 'Declarative Grammars', 'Templates', 'UserInterfaces', 'Ivy', 'Systems']"
11421,2105.14068,Yongji Wu,"Yongji Wu, Defu Lian, Neil Zhenqiang Gong, Lu Yin, Mingyang Yin,
  Jingren Zhou, Hongxia Yang","Linear-Time Self Attention with Codeword Histogram for Efficient
  Recommendation",11 pages. Accepted by the Web Conference 2021 (WWW '21),,10.1145/3442381.3449946,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-attention has become increasingly popular in a variety of sequence
modeling tasks from natural language processing to recommendation, due to its
effectiveness. However, self-attention suffers from quadratic computational and
memory complexities, prohibiting its applications on long sequences. Existing
approaches that address this issue mainly rely on a sparse attention context,
either using a local window, or a permuted bucket obtained by
locality-sensitive hashing (LSH) or sorting, while crucial information may be
lost. Inspired by the idea of vector quantization that uses cluster centroids
to approximate items, we propose LISA (LInear-time Self Attention), which
enjoys both the effectiveness of vanilla self-attention and the efficiency of
sparse attention. LISA scales linearly with the sequence length, while enabling
full contextual attention via computing differentiable histograms of codeword
distributions. Meanwhile, unlike some efficient attention methods, our method
poses no restriction on casual masking or sequence length. We evaluate our
method on four real-world datasets for sequential recommendation. The results
show that LISA outperforms the state-of-the-art efficient attention methods in
both performance and speed; and it is up to 57x faster and 78x more memory
efficient than vanilla self-attention.
","[{'version': 'v1', 'created': 'Fri, 28 May 2021 19:16:51 GMT'}]",2021-06-01,"[['Wu', 'Yongji', ''], ['Lian', 'Defu', ''], ['Gong', 'Neil Zhenqiang', ''], ['Yin', 'Lu', ''], ['Yin', 'Mingyang', ''], ['Zhou', 'Jingren', ''], ['Yang', 'Hongxia', '']]","['self-attention', 'efficient-attention', 'sequential recommendation', 'quantization']"
11422,2206.03780,"J\""ames M\'en\'etrey","J\""ames M\'en\'etrey, Christian G\""ottel, Anum Khurshid, Marcelo
  Pasin, Pascal Felber, Valerio Schiavoni, Shahid Raza",Attestation Mechanisms for Trusted Execution Environments Demystified,"This publication incorporates results from the VEDLIoT project, which
  received funding from the European Union's Horizon 2020 research and
  innovation programme under grant agreement No 957197. arXiv admin note:
  substantial text overlap with arXiv:2204.06790","DAIS'22: Proceedings of the 22nd IFIP International Conference on
  Distributed Applications and Interoperable Systems, June 2022",10.1007/978-3-031-16092-9_7,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Attestation is a fundamental building block to establish trust over software
systems. When used in conjunction with trusted execution environments, it
guarantees the genuineness of the code executed against powerful attackers and
threats, paving the way for adoption in several sensitive application domains.
This paper reviews remote attestation principles and explains how the modern
and industrially well-established trusted execution environments Intel SGX, Arm
TrustZone and AMD SEV, as well as emerging RISC-V solutions, leverage these
mechanisms.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2022 09:54:21 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Sep 2022 11:30:23 GMT'}]",2022-09-26,"[['Ménétrey', 'Jämes', ''], ['Göttel', 'Christian', ''], ['Khurshid', 'Anum', ''], ['Pasin', 'Marcelo', ''], ['Felber', 'Pascal', ''], ['Schiavoni', 'Valerio', ''], ['Raza', 'Shahid', '']]","['Trusted execution environments', 'Attestation', 'Intel SGX', 'Arm TrustZone', 'AMD SEV', 'RISC-V']"
11423,1911.04788,Carlo Tiseo,"Keyhan Kouhkiloui Babarahmati, Carlo Tiseo, Joshua Smith, Hsiu Chin
  Lin, Mustafa Suphi Erden and Michael Mistry","Fractal Impedance for Passive Controllers: A Framework for Interaction
  Robotics",Nonlinear Dyn (2022). Video Available at https://youtu.be/Ny8zNyPS8AM,,10.1007/s11071-022-07754-3,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is increasing interest in control frameworks capable of moving robots
from industrial cages to unstructured environments and coexisting with humans.
Despite significant improvement in some specific applications (e.g., medical
robotics), there is still the need for a general control framework that
improves interaction robustness and motion dynamics. Passive controllers show
promising results in this direction; however, they often rely on virtual energy
tanks that can guarantee passivity as long as they do not run out of energy. In
this paper, a Fractal Attractor is proposed to implement a variable impedance
controller that can retain passivity without relying on energy tanks. The
controller generates a Fractal Attractor around the desired state using an
asymptotic stable potential field, making the controller robust to
discretization and numerical integration errors. The results prove that it can
accurately track both trajectories and end-effector forces during interaction.
Therefore, these properties make the controller ideal for applications
requiring robust dynamic interaction at the end-effector.
","[{'version': 'v1', 'created': 'Tue, 12 Nov 2019 10:54:20 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Dec 2020 11:42:59 GMT'}, {'version': 'v3', 'created': 'Fri, 28 May 2021 18:36:18 GMT'}, {'version': 'v4', 'created': 'Wed, 27 Jul 2022 17:09:41 GMT'}]",2022-08-30,"[['Babarahmati', 'Keyhan Kouhkiloui', ''], ['Tiseo', 'Carlo', ''], ['Smith', 'Joshua', ''], ['Lin', 'Hsiu Chin', ''], ['Erden', 'Mustafa Suphi', ''], ['Mistry', 'Michael', '']]","['Impedance Control', 'Passive control', 'Compliant control', 'Roboticarms']"
11424,2204.13003,Hao Wang,Hao Wang,"MovieMat: Context-aware Movie Recommendation with Matrix Factorization
  by Matrix Fitting",ICCC 2021,,10.1109/ICCC54389.2021.9674549,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Movie Recommender System is widely applied in commercial environments such as
NetFlix and Tubi. Classic recommender models utilize technologies such as
collaborative filtering, learning to rank, matrix factorization and deep
learning models to achieve lower marketing expenses and higher revenues.
However, audience of movies have different ratings of the same movie in
different contexts. Important movie watching contexts include audience mood,
location, weather, etc. Tobe able to take advantage of contextual information
is of great benefit to recommender builders. However, popular techniques such
as tensor factorization consumes an impractical amount of storage, which
greatly reduces its feasibility in real world environment. In this paper, we
take advantage of the MatMat framework, which factorizes matrices by matrix
fitting to build a context-aware movie recommender system that is superior to
classic matrix factorization and comparable in the fairness metric.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2022 15:18:01 GMT'}]",2022-04-28,"[['Wang', 'Hao', '']]","['MovieMat', 'MatMat', 'recommender system', 'movie']"
11425,2104.02548,Meghna P Ayyar,"Meghna P Ayyar, Jenny Benois-Pineau, Akka Zemmari","White Box Methods for Explanations of Convolutional Neural Networks in
  Image Classification Tasks",Submitted to Journal of Electronic Imaging (JEI),,10.1117/1.JEI.30.5.050901,,cs.CV cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  In recent years, deep learning has become prevalent to solve applications
from multiple domains. Convolutional Neural Networks (CNNs) particularly have
demonstrated state of the art performance for the task of image classification.
However, the decisions made by these networks are not transparent and cannot be
directly interpreted by a human. Several approaches have been proposed to
explain to understand the reasoning behind a prediction made by a network. In
this paper, we propose a topology of grouping these methods based on their
assumptions and implementations. We focus primarily on white box methods that
leverage the information of the internal architecture of a network to explain
its decision. Given the task of image classification and a trained CNN, this
work aims to provide a comprehensive and detailed overview of a set of methods
that can be used to create explanation maps for a particular image, that assign
an importance score to each pixel of the image based on its contribution to the
decision of the network. We also propose a further classification of the white
box methods based on their implementations to enable better comparisons and
help researchers find methods best suited for different scenarios.
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2021 14:40:00 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Sep 2021 16:52:35 GMT'}]",2021-12-01,"[['Ayyar', 'Meghna P', ''], ['Benois-Pineau', 'Jenny', ''], ['Zemmari', 'Akka', '']]","['Explainable AI', 'Deep Learning', 'Convolutional Neural Networks', 'Object Classification', 'Interpretability']"
11426,2011.06766,Balsam Alkouz,"Balsam Alkouz, Athman Bouguettaya",Formation-based Selection of Drone Swarm Services,"9 pages, 10 figures. This is an accepted paper and it is going to
  appear in the Proceedings of the 17th EAI International Conference on Mobile
  and Ubiquitous Systems: Computing, Networking and Services (EAI MobiQuitous
  2020)",,10.1145/3448891.3448899,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Swarm of drones are increasingly being asked to carry out missions that can't
be completed by one drone. Particularly, in delivery, issues arise due to the
swarm's limited flight endurance. Hence, we propose a novel formation-guided
framework for selecting Swarm-based Drone-as-a-Service (SDaaS) for delivery. A
detailed study is carried out to highlight the effect of swarm formations on
energy consumption. Two SDaaS selection approaches, i.e. Fixed and Adaptive,
are designed considering the different formation decisions a swarm can take.
The proposed framework considers extrinsic constraints including wind speed and
direction. We propose SDaaS selection algorithms for each approach.
Experimental results prove the efficiency of the proposed algorithms.
","[{'version': 'v1', 'created': 'Fri, 13 Nov 2020 05:25:58 GMT'}]",2021-08-31,"[['Alkouz', 'Balsam', ''], ['Bouguettaya', 'Athman', '']]","['Drones Swarms', 'Multi-UAV', 'Drone Delivery', 'Formation Flying', 'Service Selection', 'Energy Optimization']"
11427,2103.15004,Carolin Wienrich Prof. Dr.,Carolin Wienrich and Marc Erich Latoschik,"eXtended Artificial Intelligence: New Prospects of Human-AI Interaction
  Research",,"Front. Virtual Real., 06 September 2021, Sec. Virtual Reality and
  Human Behaviour",10.3389/frvir.2021.686783,,cs.AI cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Artificial Intelligence (AI) covers a broad spectrum of computational
problems and use cases. Many of those implicate profound and sometimes
intricate questions of how humans interact or should interact with AIs.
Moreover, many users or future users do have abstract ideas of what AI is,
significantly depending on the specific embodiment of AI applications.
Human-centered-design approaches would suggest evaluating the impact of
different embodiments on human perception of and interaction with AI. An
approach that is difficult to realize due to the sheer complexity of
application fields and embodiments in reality. However, here XR opens new
possibilities to research human-AI interactions. The article's contribution is
twofold: First, it provides a theoretical treatment and model of human-AI
interaction based on an XR-AI continuum as a framework for and a perspective of
different approaches of XR-AI combinations. It motivates XR-AI combinations as
a method to learn about the effects of prospective human-AI interfaces and
shows why the combination of XR and AI fruitfully contributes to a valid and
systematic investigation of human-AI interactions and interfaces. Second, the
article provides two exemplary experiments investigating the aforementioned
approach for two distinct AI-systems. The first experiment reveals an
interesting gender effect in human-robot interaction, while the second
experiment reveals an Eliza effect of a recommender system. Here the article
introduces two paradigmatic implementations of the proposed XR testbed for
human-AI interactions and interfaces and shows how a valid and systematic
investigation can be conducted. In sum, the article opens new perspectives on
how XR benefits human-centered AI design and development.
","[{'version': 'v1', 'created': 'Sat, 27 Mar 2021 22:12:06 GMT'}, {'version': 'v2', 'created': 'Wed, 31 Mar 2021 11:18:14 GMT'}, {'version': 'v3', 'created': 'Mon, 5 Apr 2021 16:10:19 GMT'}]",2022-09-19,"[['Wienrich', 'Carolin', ''], ['Latoschik', 'Marc Erich', '']]","['human-AI interface', 'human-AI interaction', 'XR-AI continuum', 'XR-AI combination', 'research methods', 'human-centered', 'human-robot', 'recommender system']"
11428,1906.09370,Andr\'es Ezequiel Viso,Eduardo Bonelli and Delia Kesner and Andr\'es Viso,Strong Bisimulation for Control Operators,,,10.4230/LIPIcs.CSL.2020.4,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this paper is to identify programs with control operators
whose reduction semantics are in exact correspondence. This is achieved by
introducing a relation $\simeq$, defined over a revised presentation of
Parigot's $\lambda\mu$-calculus we dub $\Lambda M$. Our result builds on two
fundamental ingredients: (1) factorization of $\lambda\mu$-reduction into
multiplicative and exponential steps by means of explicit term operators of
$\Lambda M$, and (2) translation of $\Lambda M$-terms into Laurent's polarized
proof-nets (PPN) such that cut-elimination in PPN simulates our calculus. Our
proposed relation $\simeq$ is shown to characterize structural equivalence in
PPN. Most notably, $\simeq$ is shown to be a strong bisimulation with respect
to reduction in $\Lambda M$, i.e. two $\simeq$-equivalent terms have the exact
same reduction semantics, a result which fails for Regnier's
$\sigma$-equivalence in $\lambda$-calculus as well as for Laurent's
$\sigma$-equivalence in $\lambda\mu$.
","[{'version': 'v1', 'created': 'Sat, 22 Jun 2019 02:35:39 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Oct 2019 15:11:34 GMT'}]",2020-06-30,"[['Bonelli', 'Eduardo', ''], ['Kesner', 'Delia', ''], ['Viso', 'Andrés', '']]","['Lambda-mu calculus', 'proof-nets', 'strong bisimulation']"
11429,2009.03640,Souhila Silmi,"Souhila Silmi, Zouina Doukha, Rebiha Kemcha and Samira Moussaoui",Wireless sensor networks simulators and testbeds,"19 pages 10 figures 6th International Conference on Networks and
  Communications (NCO 2020)","9th International Conference on Advanced Information Technologies
  and Applications ICAITA 2020, July 2020, Toronto, Canada, pages 141",10.5121/csit.2020.100901- 10.5121/csit.2020.100921,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless sensor networks (WSNs) have emerged as one of the most promising
technologies for the current era. Researchers have studied them for several
years ago, but more work still needed to be made since open opportunities to
integrate new technologies are added to this field. One challenging task is WSN
deployment. Yet, this is done by real deployment with testbeds platforms or by
simulation tools when real deployment could be costly and time-consuming. In
this paper, we review the implementation and evaluation process in WSNs. We
then describe relevant testbeds and simulation tools, and their features.
Lastly, we conduct an experimentation study using these testbeds and
simulations to highlight their pro and cons. As a use case, we implement a
localization protocol. This work gives clarity to future-work for better
implementation in order to improve reliability, accuracy and time consumed.
","[{'version': 'v1', 'created': 'Tue, 8 Sep 2020 11:04:06 GMT'}]",2020-09-09,"[['Silmi', 'Souhila', ''], ['Doukha', 'Zouina', ''], ['Kemcha', 'Rebiha', ''], ['Moussaoui', 'Samira', '']]","['Wireless Sensor Network', 'Testbeds', 'Simulation Tools', 'Localization Protocol']"
11430,1711.09074,Taha Yasseri,Sophie Melville and Kathryn Eccles and Taha Yasseri,Topic Modelling of Everyday Sexism Project Entries,"preprint, under review",Front. Digit. Humanit. 5:28 (2019),10.3389/fdigh.2018.00028,,cs.CY cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Everyday Sexism Project documents everyday examples of sexism reported by
volunteer contributors from all around the world. It collected 100,000 entries
in 13+ languages within the first 3 years of its existence. The content of
reports in various languages submitted to Everyday Sexism is a valuable source
of crowdsourced information with great potential for feminist and gender
studies. In this paper, we take a computational approach to analyze the content
of reports. We use topic-modelling techniques to extract emerging topics and
concepts from the reports, and to map the semantic relations between those
topics. The resulting picture closely resembles and adds to that arrived at
through qualitative analysis, showing that this form of topic modeling could be
useful for sifting through datasets that had not previously been subject to any
analysis. More precisely, we come up with a map of topics for two different
resolutions of our topic model and discuss the connection between the
identified topics. In the low resolution picture, for instance, we found Public
space/Street, Online, Work related/Office, Transport, School, Media harassment,
and Domestic abuse. Among these, the strongest connection is between Public
space/Street harassment and Domestic abuse and sexism in personal
relationships.The strength of the relationships between topics illustrates the
fluid and ubiquitous nature of sexism, with no single experience being
unrelated to another.
","[{'version': 'v1', 'created': 'Fri, 24 Nov 2017 18:40:41 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Nov 2017 15:46:42 GMT'}, {'version': 'v3', 'created': 'Thu, 5 Apr 2018 13:58:32 GMT'}]",2023-01-05,"[['Melville', 'Sophie', ''], ['Eccles', 'Kathryn', ''], ['Yasseri', 'Taha', '']]","['sexism', 'gender', 'everyday sexism', 'topic modeling', 'content analysis']"
11431,2301.02773,Heeyoul Choi,"Richard Kimera, Daniela N. Rim, Heeyoul Choi","Building a Parallel Corpus and Training Translation Models Between
  Luganda and English",,"Journal of KIISE, Vol. 49, No. 11, pp. 1009-1016, 2022. 11",10.5626/JOK.2022.49.11.1009,,cs.CL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Neural machine translation (NMT) has achieved great successes with large
datasets, so NMT is more premised on high-resource languages. This continuously
underpins the low resource languages such as Luganda due to the lack of
high-quality parallel corpora, so even 'Google translate' does not serve
Luganda at the time of this writing. In this paper, we build a parallel corpus
with 41,070 pairwise sentences for Luganda and English which is based on three
different open-sourced corpora. Then, we train NMT models with hyper-parameter
search on the dataset. Experiments gave us a BLEU score of 21.28 from Luganda
to English and 17.47 from English to Luganda. Some translation examples show
high quality of the translation. We believe that our model is the first
Luganda-English NMT model. The bilingual dataset we built will be available to
the public.
","[{'version': 'v1', 'created': 'Sat, 7 Jan 2023 03:26:09 GMT'}]",2023-01-10,"[['Kimera', 'Richard', ''], ['Rim', 'Daniela N.', ''], ['Choi', 'Heeyoul', '']]","['Luganda', 'neural machine translation', 'Transformer', 'hyper-parameter']"
11432,2001.02114,Yunfeng Zhang,"Yunfeng Zhang, Q. Vera Liao, Rachel K. E. Bellamy","Effect of Confidence and Explanation on Accuracy and Trust Calibration
  in AI-Assisted Decision Making",,,10.1145/3351095.3372852,,cs.AI cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today, AI is being increasingly used to help human experts make decisions in
high-stakes scenarios. In these scenarios, full automation is often
undesirable, not only due to the significance of the outcome, but also because
human experts can draw on their domain knowledge complementary to the model's
to ensure task success. We refer to these scenarios as AI-assisted decision
making, where the individual strengths of the human and the AI come together to
optimize the joint decision outcome. A key to their success is to appropriately
\textit{calibrate} human trust in the AI on a case-by-case basis; knowing when
to trust or distrust the AI allows the human expert to appropriately apply
their knowledge, improving decision outcomes in cases where the model is likely
to perform poorly. This research conducts a case study of AI-assisted decision
making in which humans and AI have comparable performance alone, and explores
whether features that reveal case-specific model information can calibrate
trust and improve the joint performance of the human and AI. Specifically, we
study the effect of showing confidence score and local explanation for a
particular prediction. Through two human experiments, we show that confidence
score can help calibrate people's trust in an AI model, but trust calibration
alone is not sufficient to improve AI-assisted decision making, which may also
depend on whether the human can bring in enough unique knowledge to complement
the AI's errors. We also highlight the problems in using local explanation for
AI-assisted decision making scenarios and invite the research community to
explore new approaches to explainability for calibrating human trust in AI.
","[{'version': 'v1', 'created': 'Tue, 7 Jan 2020 15:33:48 GMT'}]",2020-01-08,"[['Zhang', 'Yunfeng', ''], ['Liao', 'Q. Vera', ''], ['Bellamy', 'Rachel K. E.', '']]","['decision support', 'trust', 'confidence', 'explainable AI']"
11433,2206.05169,Harald Willmann,"Harald Willmann, Jonas Nitzler, Sebastian Brandstaeter, Wolfgang A.
  Wall","Bayesian calibration of coupled computational mechanics models under
  uncertainty based on interface deformation",,,10.1186/s40323-022-00237-5,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Calibration or parameter identification is used with computational mechanics
models related to observed data of the modeled process to find model parameters
such that good similarity between model prediction and observation is achieved.
We present a Bayesian calibration approach for surface coupled problems in
computational mechanics based on measured deformation of an interface when no
displacement data of material points is available. The interpretation of such a
calibration problem as a statistical inference problem, in contrast to
deterministic model calibration, is computationally more robust and allows the
analyst to find a posterior distribution over possible solutions rather than a
single point estimate. The proposed framework also enables the consideration of
unavoidable uncertainties that are present in every experiment and are expected
to play an important role in the model calibration process. To mitigate the
computational costs of expensive forward model evaluations, we propose to learn
the log-likelihood function from a controllable amount of parallel simulation
runs using Gaussian process regression. We introduce and specifically study the
effect of three different discrepancy measures for deformed interfaces between
reference data and simulation. We show that a statistically based discrepancy
measure results in the most expressive posterior distribution. We further apply
the approach to numerical examples in higher model parameter dimensions and
interpret the resulting posterior under uncertainty. In the examples, we
investigate coupled multi-physics models of fluid-structure interaction effects
in biofilms and find that the model parameters affect the results in a coupled
manner.
","[{'version': 'v1', 'created': 'Fri, 10 Jun 2022 15:04:45 GMT'}]",2022-12-26,"[['Willmann', 'Harald', ''], ['Nitzler', 'Jonas', ''], ['Brandstaeter', 'Sebastian', ''], ['Wall', 'Wolfgang A.', '']]","['Bayesian calibration', 'inverse analysis', 'coupled problems', 'fluid-structure interaction', 'interface shape', 'biofilm']"
11434,2203.12960,Joao Pedro Dias,"Miguel Duarte and Jo\~ao Pedro Dias and Hugo Sereno Ferreira and
  Andr\'e Restivo","Evaluation of IoT Self-healing Mechanisms using Fault-Injection in
  Message Brokers",8 pages,,10.1145/3528227.3528567,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The widespread use of Internet-of-Things (IoT) across different application
domains leads to an increased concern regarding their dependability, especially
as the number of potentially mission-critical systems becomes considerable.
Fault-tolerance has been used to reduce the impact of faults in systems, and
their adoption in IoT is becoming a necessity. This work focuses on how to
exercise fault-tolerance mechanisms by deliberately provoking its malfunction.
We start by describing a proof-of-concept fault-injection add-on to a commonly
used publish/subscribe broker. We then present several experiments mimicking
real-world IoT scenarios, focusing on injecting faults in systems with (and
without) active self-healing mechanisms and comparing their behavior to the
baseline without faults. We observe evidence that fault-injection can be used
to (a) exercise in-place fault-tolerance apparatus, and (b) detect when these
mechanisms are not performing nominally, providing insights into enhancing
in-place fault-tolerance techniques.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2022 09:43:20 GMT'}]",2022-03-25,"[['Duarte', 'Miguel', ''], ['Dias', 'João Pedro', ''], ['Ferreira', 'Hugo Sereno', ''], ['Restivo', 'André', '']]","['IoT', 'fault-injection', 'self-healing', 'dependability', 'fault-tolerance', 'middleware']"
11435,2112.11176,Hisham Ihshaish,"Ryan Fellows, Hisham Ihshaish, Steve Battle, Ciaran Haines, Peter
  Mayhew, J. Ignacio Deza","Task-oriented Dialogue Systems: performance vs. quality-optima, a review",,"David C. Wyld et al. (Eds): SIPP, NLPCL, BIGML, SOEN, AISC, NCWMC,
  CCSIT - 2022 pp. 69-87, 2022. CS & IT - CSCP 2022",10.5121/csit.2022.121306,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Task-oriented dialogue systems (TODS) are continuing to rise in popularity as
various industries find ways to effectively harness their capabilities, saving
both time and money. However, even state-of-the-art TODS are not yet reaching
their full potential. TODS typically have a primary design focus on completing
the task at hand, so the metric of task-resolution should take priority. Other
conversational quality attributes that may point to the success, or otherwise,
of the dialogue, may be ignored. This can cause interactions between human and
dialogue system that leave the user dissatisfied or frustrated. This paper
explores the literature on evaluative frameworks of dialogue systems and the
role of conversational quality attributes in dialogue systems, looking at if,
how, and where they are utilised, and examining their correlation with the
performance of the dialogue system.
","[{'version': 'v1', 'created': 'Tue, 21 Dec 2021 13:16:24 GMT'}]",2022-09-07,"[['Fellows', 'Ryan', ''], ['Ihshaish', 'Hisham', ''], ['Battle', 'Steve', ''], ['Haines', 'Ciaran', ''], ['Mayhew', 'Peter', ''], ['Deza', 'J. Ignacio', '']]","['Dialogue Systems', 'Chatbot', 'Conversational Agents', 'AI', 'Natural Language Processing', 'Quality Attributes']"
11436,2110.08331,Francisco Valente,"Francisco Valente, Jorge Henriques, Sim\~ao Paredes, Teresa Rocha,
  Paulo de Carvalho, Jo\~ao Morais","A New Approach for Interpretability and Reliability in Clinical Risk
  Prediction: Acute Coronary Syndrome Scenario","Accepted for publication in the Artificial Intelligence in Medicine
  journal. Abstract abridged to respect the arXiv's characters limit","Artificial Intelligence in Medicine, Volume 117, 2021",10.1016/j.artmed.2021.102113,,cs.LG stat.AP stat.ME,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We intend to create a new risk assessment methodology that combines the best
characteristics of both risk score and machine learning models. More
specifically, we aim to develop a method that, besides having a good
performance, offers a personalized model and outcome for each patient, presents
high interpretability, and incorporates an estimation of the prediction
reliability which is not usually available. By combining these features in the
same approach we expect that it can boost the confidence of physicians to use
such a tool in their daily activity. In order to achieve the mentioned goals, a
three-step methodology was developed: several rules were created by
dichotomizing risk factors; such rules were trained with a machine learning
classifier to predict the acceptance degree of each rule (the probability that
the rule is correct) for each patient; that information was combined and used
to compute the risk of mortality and the reliability of such prediction. The
methodology was applied to a dataset of patients admitted with any type of
acute coronary syndromes (ACS), to assess the 30-days all-cause mortality risk.
The performance was compared with state-of-the-art approaches: logistic
regression (LR), artificial neural network (ANN), and clinical risk score model
(Global Registry of Acute Coronary Events - GRACE). The proposed approach
achieved testing results identical to the standard LR, but offers superior
interpretability and personalization; it also significantly outperforms the
GRACE risk model and the standard ANN model. The calibration curve also
suggests a very good generalization ability of the obtained model as it
approaches the ideal curve. Finally, the reliability estimation of individual
predictions presented a great correlation with the misclassifications rate.
Those properties may have a beneficial application in other clinical scenarios
as well. [abridged]
","[{'version': 'v1', 'created': 'Fri, 15 Oct 2021 19:33:46 GMT'}]",2021-10-19,"[['Valente', 'Francisco', ''], ['Henriques', 'Jorge', ''], ['Paredes', 'Simão', ''], ['Rocha', 'Teresa', ''], ['de Carvalho', 'Paulo', ''], ['Morais', 'João', '']]","['reliability estimation', 'interpretable predictions', 'clinical riskprediction', 'clinical decision support system', 'acute coronary syndrome']"
11437,2209.00559,Tim Gorichanaz,Tim Gorichanaz,Being at Home in the Metaverse? Prospectus for a Social Imaginary,,AI & Ethics (2022),10.1007/s43681-022-00198-w,,cs.CY cs.HC,http://creativecommons.org/licenses/by/4.0/,"  The metaverse has seen growing corporate and popular interest over the past
few years. While visions vary, the metaverse is generally seen as an extension
of the internet that may be developed through advances in a number of digital
technologies, such as augmented and virtual reality, as well as new technical
infrastructure and standards. The metaverse constitutes an emerging social
imaginary, a way of both understanding and directing our shared existence. This
paper examines this emerging social imaginary through the phenomenological
concept of dwelling, or being at home in the world, as developed by Martin
Heidegger. To examine in depth one influential articulation of this social
imaginary, this paper focuses on the metaverse as envisioned by Mark
Zuckerberg, CEO of Meta (formerly Facebook). The paper presents a thematic
analysis of Zuckerberg's public statements regarding the metaverse to provide a
close reading of this particular vision. Then, through the lens of Heidegger's
philosophy of dwelling, this paper identifies numerous threats to dwelling
posed by the metaverse social imaginary. This paper explains these threats and
their prognoses, and it closes with some considerations for how the metaverse
could be designed to better facilitate human dwelling.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2022 16:03:16 GMT'}]",2022-09-02,"[['Gorichanaz', 'Tim', '']]","['metaverse', 'social imaginary', 'Facebook', 'Meta', 'Heidegger', 'Arendt']"
11438,2204.07210,Anas Nadeem,Anas Nadeem and Muhammad Zubair Malik,A Case for Microservices Orchestration Using Workflow Engines,"5 pages, International Conference on Software Engineering 2022 (NIER)
  Track",,10.1145/3510455.3512777,,cs.SE cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Microservices have become the de-facto software architecture for cloud-native
applications. A contentious architectural decision in microservices is to
compose them using choreography or orchestration. In choreography, every
service works independently, whereas, in orchestration, there is a controller
that coordinates service interactions. This paper makes a case for
orchestration. The promise of microservices is that each microservice can be
independently developed, deployed, tested, upgraded, and scaled. This makes
them suitable for systems running on cloud infrastructures. However,
microservice-based systems become complicated due to the complex interactions
of various services, concurrent events, failing components, developers' lack of
global view, and configurations of the environment. This makes maintaining and
debugging such systems very challenging. We hypothesize that orchestrated
services are easier to debug and to test this we ported the largest publicly
available microservices' benchmark TrainTicket, which is implemented using
choreography, to a fault-oblivious stateful workflow framework Temporal. We
report our experience in porting the code from traditional choreographed
microservice architecture to one orchestrated by Temporal and present our
initial findings of time to debug the 22 bugs present in the benchmark. Our
findings suggest that an effort towards making a transition to orchestrated
approach is worthwhile, making the ported code easier to debug.
","[{'version': 'v1', 'created': 'Thu, 14 Apr 2022 20:13:12 GMT'}]",2022-10-21,"[['Nadeem', 'Anas', ''], ['Malik', 'Muhammad Zubair', '']]","['microservices', 'orchestration', 'debugging', 'workflows', 'fault-tolerance']"
11439,2106.05452,Timo Koch,Timo Koch and Hanchuan Wu and Martin Schneider,"Nonlinear mixed-dimension model for embedded tubular networks with
  application to root water uptake","34 pages, 16 figures",,10.1016/j.jcp.2021.110823,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a numerical scheme for the solution of nonlinear mixed-dimensional
PDEs describing coupled processes in embedded tubular network system in
exchange with a bulk domain. Such problems arise in various biological and
technical applications such as in the modeling of root-water uptake, heat
exchangers, or geothermal wells. The nonlinearity appears in form of
solution-dependent parameters such as pressure-dependent permeability or
temperature-dependent thermal conductivity. We derive and analyse a numerical
scheme based on distributing the bulk-network coupling source term by a
smoothing kernel with local support. By the use of local analytical solutions,
interface unknowns and fluxes at the bulk-network interface can be accurately
reconstructed from coarsely resolved numerical solutions in the bulk domain.
Numerical examples give confidence in the robustness of the method and show the
results in comparison to previously published methods. The new method
outperforms these existing methods in accuracy and efficiency. In a root water
uptake scenario, we accurately estimate the transpiration rate using only a few
thousand 3D mesh cells and a structured cube grid whereas other
state-of-the-art numerical schemes require millions of cells and local grid
refinement to reach comparable accuracy.
","[{'version': 'v1', 'created': 'Thu, 10 Jun 2021 01:45:13 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Jun 2021 18:14:41 GMT'}]",2021-11-23,"[['Koch', 'Timo', ''], ['Wu', 'Hanchuan', ''], ['Schneider', 'Martin', '']]","['mixed-dimension method', 'embedded networks', '1d-3d coupling', 'root water uptake', 'smoothing kernel', 'nonlinear elliptic equations']"
11440,2008.10583,Johannes Zink,"Julian Walter, Johannes Zink, Joachim Baumeister, Alexander Wolff",Layered Drawing of Undirected Graphs with Generalized Port Constraints,,"Computational Geometry: Theory and Applications, 105-106:101886
  (2022)",10.1016/j.comgeo.2022.101886,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of this research is a practical method to draw cable plans of complex
machines. Such plans consist of electronic components and cables connecting
specific ports of the components. Since the machines are configured for each
client individually, cable plans need to be drawn automatically. The drawings
must be well readable so that technicians can use them to debug the machines.
In order to model plug sockets, we introduce port groups; within a group, ports
can change their position (which we use to improve the aesthetics of the
layout), but together the ports of a group must form a contiguous block.
  We approach the problem of drawing such cable plans by extending the
well-known Sugiyama framework such that it incorporates ports and port groups.
Since the framework assumes directed graphs, we propose several ways to orient
the edges of the given undirected graph. We compare these methods
experimentally, both on real-world data and synthetic data that carefully
simulates real-world data. We measure the aesthetics of the resulting drawings
by counting bends and crossings. Using these metrics, we experimentally compare
our approach to Kieler [JVLC 2014], a library for drawing graphs in the
presence of port constraints. Our method produced 10--30 % fewer crossings,
while it performed equally well or slightly worse than Kieler with respect to
the number of bends and the time used to compute a drawing.
","[{'version': 'v1', 'created': 'Mon, 24 Aug 2020 17:47:52 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Aug 2020 23:35:31 GMT'}, {'version': 'v3', 'created': 'Tue, 8 Feb 2022 12:46:49 GMT'}]",2022-09-23,"[['Walter', 'Julian', ''], ['Zink', 'Johannes', ''], ['Baumeister', 'Joachim', ''], ['Wolff', 'Alexander', '']]","['Sugiyama framework', 'port constraints', 'experimental evaluation']"
11441,2210.00808,Giovanni Pasqualino,Giovanni Pasqualino and Antonino Furnari and Giovanni Maria Farinella,"A Multi Camera Unsupervised Domain Adaptation Pipeline for Object
  Detection in Cultural Sites through Adversarial Learning and Self-Training",,,10.1016/j.cviu.2022.103487,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Object detection algorithms allow to enable many interesting applications
which can be implemented in different devices, such as smartphones and wearable
devices. In the context of a cultural site, implementing these algorithms in a
wearable device, such as a pair of smart glasses, allow to enable the use of
augmented reality (AR) to show extra information about the artworks and enrich
the visitors' experience during their tour. However, object detection
algorithms require to be trained on many well annotated examples to achieve
reasonable results. This brings a major limitation since the annotation process
requires human supervision which makes it expensive in terms of time and costs.
A possible solution to reduce these costs consist in exploiting tools to
automatically generate synthetic labeled images from a 3D model of the site.
However, models trained with synthetic data do not generalize on real images
acquired in the target scenario in which they are supposed to be used.
Furthermore, object detectors should be able to work with different wearable
devices or different mobile devices, which makes generalization even harder. In
this paper, we present a new dataset collected in a cultural site to study the
problem of domain adaptation for object detection in the presence of multiple
unlabeled target domains corresponding to different cameras and a labeled
source domain obtained considering synthetic images for training purposes. We
present a new domain adaptation method which outperforms current
state-of-the-art approaches combining the benefits of aligning the domains at
the feature and pixel level with a self-training process. We release the
dataset at the following link https://iplab.dmi.unict.it/OBJ-MDA/ and the code
of the proposed architecture at https://github.com/fpv-iplab/STMDA-RetinaNet.
","[{'version': 'v1', 'created': 'Mon, 3 Oct 2022 10:40:58 GMT'}]",2022-10-04,"[['Pasqualino', 'Giovanni', ''], ['Furnari', 'Antonino', ''], ['Farinella', 'Giovanni Maria', '']]","['Object Detection', 'Cultural Sites', 'First Person Vision', 'Unsupervised Domain Adaptation']"
11442,2005.02126,Masaki Waga,Masaki Waga,"Falsification of Cyber-Physical Systems with Robustness-Guided Black-Box
  Checking",Accepted to HSCC 2020,,10.1145/3365365.3382193,,cs.LO cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For exhaustive formal verification, industrial-scale cyber-physical systems
(CPSs) are often too large and complex, and lightweight alternatives (e.g.,
monitoring and testing) have attracted the attention of both industrial
practitioners and academic researchers. Falsification is one popular testing
method of CPSs utilizing stochastic optimization. In state-of-the-art
falsification methods, the result of the previous falsification trials is
discarded, and we always try to falsify without any prior knowledge. To
concisely memorize such prior information on the CPS model and exploit it, we
employ Black-box checking (BBC), which is a combination of automata learning
and model checking. Moreover, we enhance BBC using the robust semantics of STL
formulas, which is the essential gadget in falsification. Our experiment
results suggest that our robustness-guided BBC outperforms a state-of-the-art
falsification tool.
","[{'version': 'v1', 'created': 'Fri, 24 Apr 2020 09:51:49 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Nov 2021 05:18:05 GMT'}]",2021-11-10,"[['Waga', 'Masaki', '']]","['cyber-physical systems', 'falsification', 'black-box checking', 'automata learning', 'model checking', 'signal temporal logic', 'robust semantics']"
11443,2208.06594,Pino Caballero-Gil,"V Mora-Afonso, Pino Caballero-Gil",Using identity-based cryptography in mobile applications,arXiv admin note: substantial text overlap with arXiv:2208.03541,"International Joint Conference SOCO CISIS ICEUTE, 527-536, 2014",10.1007/978-3-319-01854-6_54,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This work includes a review of two cases study of mobile applications that
use Identity-Based Cryptography (IBC) to protect communications. It also
describes a proposal of a new mobile application that combines the use of IBC
for Wi-Fi or Bluetooth communication between smartphones, with the promising
Near Field Communication (NFC) technology for secure authentication. The
proposed scheme involves NFC pairing to establish as public key a piece of
information linked to the device, such as the phone number, so that this
information is then used in an IBC scheme for peer-to-peer communication. This
is a work in progress, so the implementation of a prototype based on
smartphones is still being improved.
","[{'version': 'v1', 'created': 'Sat, 13 Aug 2022 08:23:12 GMT'}]",2022-08-16,"[['Mora-Afonso', 'V', ''], ['Caballero-Gil', 'Pino', '']]","['Identity-Based Cryptography', 'Mobile Application', 'Near Field Communication']"
11444,1410.6960,Vilem Vychodil,Vilem Vychodil,"Parameterizing the semantics of fuzzy attribute implications by systems
  of isotone Galois connections",,IEEE Trans. Fuzzy Systems 24(3): 645-660 (2016),10.1109/TFUZZ.2015.2470530,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the semantics of fuzzy if-then rules called fuzzy attribute
implications parameterized by systems of isotone Galois connections. The rules
express dependencies between fuzzy attributes in object-attribute incidence
data. The proposed parameterizations are general and include as special cases
the parameterizations by linguistic hedges used in earlier approaches. We
formalize the general parameterizations, propose bivalent and graded notions of
semantic entailment of fuzzy attribute implications, show their
characterization in terms of least models and complete axiomatization, and
provide characterization of bases of fuzzy attribute implications derived from
data.
","[{'version': 'v1', 'created': 'Sat, 25 Oct 2014 20:53:10 GMT'}]",2016-06-22,"[['Vychodil', 'Vilem', '']]","['attribute implication', 'complete axiomatization', 'data dependency', 'formal concept anal']"
11445,1909.12301,Jingwei Ma,"Jingwei Ma, Jiahui Wen, Mingyang Zhong, Liangchen Liu, Chaojie Li,
  Weitong Chen, Yin Yang, Honghui Tu, Xue Li",DBRec: Dual-Bridging Recommendation via Discovering Latent Groups,"10 pages, 16 figures, The 28th ACM International Conference on
  Information and Knowledge Management (CIKM '19)",,10.1145/3357384.3357892,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recommender systems, the user-item interaction data is usually sparse and
not sufficient for learning comprehensive user/item representations for
recommendation. To address this problem, we propose a novel dual-bridging
recommendation model (DBRec). DBRec performs latent user/item group discovery
simultaneously with collaborative filtering, and interacts group information
with users/items for bridging similar users/items. Therefore, a user's
preference over an unobserved item, in DBRec, can be bridged by the users
within the same group who have rated the item, or the user-rated items that
share the same group with the unobserved item. In addition, we propose to
jointly learn user-user group (item-item group) hierarchies, so that we can
effectively discover latent groups and learn compact user/item representations.
We jointly integrate collaborative filtering, latent group discovering and
hierarchical modelling into a unified framework, so that all the model
parameters can be learned toward the optimization of the objective function. We
validate the effectiveness of the proposed model with two real datasets, and
demonstrate its advantage over the state-of-the-art recommendation models with
extensive experiments.
","[{'version': 'v1', 'created': 'Fri, 27 Sep 2019 03:58:03 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Oct 2019 14:19:23 GMT'}]",2019-10-17,"[['Ma', 'Jingwei', ''], ['Wen', 'Jiahui', ''], ['Zhong', 'Mingyang', ''], ['Liu', 'Liangchen', ''], ['Li', 'Chaojie', ''], ['Chen', 'Weitong', ''], ['Yang', 'Yin', ''], ['Tu', 'Honghui', ''], ['Li', 'Xue', '']]","['Recommendation', 'Dual-Bridging', 'Latent group discovery']"
11446,2201.10972,Mehmet Kerim Yucel,"Mehmet Kerim Yucel, Ramazan Gokberk Cinbis, Pinar Duygulu",How Robust are Discriminatively Trained Zero-Shot Learning Models?,,,10.1016/j.imavis.2022.104392,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data shift robustness has been primarily investigated from a fully supervised
perspective, and robustness of zero-shot learning (ZSL) models have been
largely neglected. In this paper, we present novel analyses on the robustness
of discriminative ZSL to image corruptions. We subject several ZSL models to a
large set of common corruptions and defenses. In order to realize the
corruption analysis, we curate and release the first ZSL corruption robustness
datasets SUN-C, CUB-C and AWA2-C. We analyse our results by taking into account
the dataset characteristics, class imbalance, class transitions between seen
and unseen classes and the discrepancies between ZSL and GZSL performances. Our
results show that discriminative ZSL suffers from corruptions and this trend is
further exacerbated by the severe class imbalance and model weakness inherent
in ZSL methods. We then combine our findings with those based on adversarial
attacks in ZSL, and highlight the different effects of corruptions and
adversarial examples, such as the pseudo-robustness effect present under
adversarial attacks. We also obtain new strong baselines for both models with
the defense methods. Finally, our experiments show that although existing
methods to improve robustness somewhat work for ZSL models, they do not produce
a tangible effect.
","[{'version': 'v1', 'created': 'Wed, 26 Jan 2022 14:41:10 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Jan 2022 08:55:00 GMT'}]",2022-04-11,"[['Yucel', 'Mehmet Kerim', ''], ['Cinbis', 'Ramazan Gokberk', ''], ['Duygulu', 'Pinar', '']]","['Zero-Shot Learning', 'Robust Generalization', 'Adversarial Robustness']"
11447,1903.06056,Vishal Srivastava Dr,Neeru Singla and Vishal Srivastava,"Deep learning enabled multi-wavelength spatial coherence microscope for
  the classification of malaria-infected stages with limited labelled data size",,,10.1016/j.optlastec.2020.106335,,cs.CV physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Malaria is a life-threatening mosquito-borne blood disease, hence early
detection is very crucial for health. The conventional method for the detection
is a microscopic examination of Giemsa-stained blood smears, which needs a
highly trained skilled technician. Automated classifications of different
stages of malaria still a challenging task, especially having poor sensitivity
in detecting the early trophozoite and late trophozoite or schizont stage with
limited labelled datasize. The study aims to develop a fast, robust and fully
automated system for the classification of different stages of malaria with
limited data size by using the pre-trained convolutional neural networks (CNNs)
as a classifier and multi-wavelength to increase the sample size. We also
compare our customized CNN with other well-known CNNs and shows that our
network have a comparable performance with less computational time. We believe
that our proposed method can be applied to other limited labelled biological
datasets.
","[{'version': 'v1', 'created': 'Thu, 14 Mar 2019 14:51:42 GMT'}]",2020-06-24,"[['Singla', 'Neeru', ''], ['Srivastava', 'Vishal', '']]","['Malaria', 'red blood cells', 'quantitative phase imaging', 'machine learning', 'transfer learning', 'deep convolutional neural network']"
11448,1702.05747,Geert Litjens,"Geert Litjens, Thijs Kooi, Babak Ehteshami Bejnordi, Arnaud Arindra
  Adiyoso Setio, Francesco Ciompi, Mohsen Ghafoorian, Jeroen A.W.M. van der
  Laak, Bram van Ginneken, Clara I. S\'anchez",A Survey on Deep Learning in Medical Image Analysis,"Revised survey includes expanded discussion section and reworked
  introductory section on common deep architectures. Added missed papers from
  before Feb 1st 2017",Med Image Anal. (2017) 42:60-88,10.1016/j.media.2017.07.005,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning algorithms, in particular convolutional networks, have rapidly
become a methodology of choice for analyzing medical images. This paper reviews
the major deep learning concepts pertinent to medical image analysis and
summarizes over 300 contributions to the field, most of which appeared in the
last year. We survey the use of deep learning for image classification, object
detection, segmentation, registration, and other tasks and provide concise
overviews of studies per application area. Open challenges and directions for
future research are discussed.
","[{'version': 'v1', 'created': 'Sun, 19 Feb 2017 13:02:28 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Jun 2017 10:21:55 GMT'}]",2019-01-31,"[['Litjens', 'Geert', ''], ['Kooi', 'Thijs', ''], ['Bejnordi', 'Babak Ehteshami', ''], ['Setio', 'Arnaud Arindra Adiyoso', ''], ['Ciompi', 'Francesco', ''], ['Ghafoorian', 'Mohsen', ''], ['van der Laak', 'Jeroen A. W. M.', ''], ['van Ginneken', 'Bram', ''], ['Sánchez', 'Clara I.', '']]","['deep learning', 'convolutional neural networks', 'medical imaging', 'survey']"
11449,2108.12973,Zheng Bao,"Songhe Wang, Zheng Bao, Jingtong E",Armor: A Benchmark for Meta-evaluation of Artificial Music,"To appear at ACM Multimedia 2021 (8 pages, 5 figures)",,10.1145/3474085.3475700,,cs.SD cs.MM eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Objective evaluation (OE) is essential to artificial music, but it's often
very hard to determine the quality of OEs. Hitherto, subjective evaluation (SE)
remains reliable and prevailing but suffers inevitable disadvantages that OEs
may overcome. Therefore, a meta-evaluation system is necessary for designers to
test the effectiveness of OEs. In this paper, we present Armor, a complex and
cross-domain benchmark dataset that serves for this purpose. Since OEs should
correlate with human judgment, we provide music as test cases for OEs and human
judgment scores as touchstones. We also provide two meta-evaluation scenarios
and their corresponding testing methods to assess the effectiveness of OEs. To
the best of our knowledge, Armor is the first comprehensive and rigorous
framework that future works could follow, take example by, and improve upon for
the task of evaluating computer-generated music and the field of computational
music as a whole. By analyzing different OE methods on our dataset, we observe
that there is still a huge gap between SE and OE, meaning that hard-coded
algorithms are far from catching human's judgment to the music.
","[{'version': 'v1', 'created': 'Mon, 30 Aug 2021 03:09:15 GMT'}]",2021-08-31,"[['Wang', 'Songhe', ''], ['Bao', 'Zheng', ''], ['E', 'Jingtong', '']]","['datasets', 'neural model', 'music evaluation', 'music information retrieval']"
11450,2209.13459,Yichen Ding,"Yichen Ding, Ziming Zhang, Yanhua Li, Xun Zhou","EgoSpeed-Net: Forecasting Speed-Control in Driver Behavior from
  Egocentric Video Data","In Proceedings of the 30th ACM SIGSPATIAL, International Conference
  on Advances in Geographic Information Systems (2022) [accepted as a full
  paper]",,10.1145/3557915.3560946,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Speed-control forecasting, a challenging problem in driver behavior analysis,
aims to predict the future actions of a driver in controlling vehicle speed
such as braking or acceleration. In this paper, we try to address this
challenge solely using egocentric video data, in contrast to the majority of
works in the literature using either third-person view data or extra vehicle
sensor data such as GPS, or both. To this end, we propose a novel graph
convolutional network (GCN) based network, namely, EgoSpeed-Net. We are
motivated by the fact that the position changes of objects over time can
provide us very useful clues for forecasting the speed change in future. We
first model the spatial relations among the objects from each class, frame by
frame, using fully-connected graphs, on top of which GCNs are applied for
feature extraction. Then we utilize a long short-term memory network to fuse
such features per class over time into a vector, concatenate such vectors and
forecast a speed-control action using a multilayer perceptron classifier. We
conduct extensive experiments on the Honda Research Institute Driving Dataset
and demonstrate the superior performance of EgoSpeed-Net.
","[{'version': 'v1', 'created': 'Tue, 27 Sep 2022 15:25:57 GMT'}]",2022-09-28,"[['Ding', 'Yichen', ''], ['Zhang', 'Ziming', ''], ['Li', 'Yanhua', ''], ['Zhou', 'Xun', '']]","['Driver Behavior', 'Egocentric Video', 'Deep Learning']"
11451,1906.02077,Stefan Kollmannsberger,"L\'aszl\'o Kudela and Stefan Kollmannsberger and Umut Almac and Ernst
  Rank",Direct structural analysis of domains defined by point clouds,,,10.1016/j.cma.2019.112581,,cs.CE cs.CG math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This contribution presents a method that aims at the numerical analysis of
solids represented by oriented point clouds. The proposed approach is based on
the Finite Cell Method, a high-order immersed boundary technique that computes
on a regular background grid of finite elements and requires only
inside-outside information from the geometric model. It is shown that oriented
point clouds provide sufficient information for these point-membership
classifications. Further, we address a tessellation-free formulation of contour
integrals that allows to apply Neumann boundary conditions on point clouds
without having to recover the underlying surface. Two-dimensional linear
elastic benchmark examples demonstrate that the method is able to provide the
same accuracy as those computed with conventional, continuous surface
descriptions, because the associated error can be controlled by the density of
the cloud. Three-dimensional examples computed on point clouds of historical
structures show how the method can be employed to establish seamless
connections between digital shape measurement techniques and numerical
analyses.
","[{'version': 'v1', 'created': 'Wed, 5 Jun 2019 15:37:39 GMT'}]",2020-12-16,"[['Kudela', 'László', ''], ['Kollmannsberger', 'Stefan', ''], ['Almac', 'Umut', ''], ['Rank', 'Ernst', '']]","['finite cell method', 'point clouds', 'image-based structural analysis']"
11452,1702.05218,Hanrui Zhang,"Wei Chen, Hanrui Zhang","Complete Submodularity Characterization in the Comparative Independent
  Cascade Model",Theoret. Comput. Sci. (2018),,10.1016/j.tcs.2018.03.026,,cs.SI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the propagation of comparative ideas or items in social networks. A
full characterization for submodularity in the comparative independent cascade
(Com-IC) model of two-idea cascade is given, for competing ideas and
complementary ideas respectively, with or without reconsideration. We further
introduce One-Shot model where agents show less patience toward ideas, and show
that in One-Shot model, only the strongest idea spreads with submodularity.
","[{'version': 'v1', 'created': 'Fri, 17 Feb 2017 04:11:08 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Jun 2017 12:53:12 GMT'}, {'version': 'v3', 'created': 'Sat, 30 Sep 2017 19:07:58 GMT'}, {'version': 'v4', 'created': 'Tue, 3 Oct 2017 13:23:20 GMT'}, {'version': 'v5', 'created': 'Mon, 9 Apr 2018 00:37:33 GMT'}, {'version': 'v6', 'created': 'Wed, 14 Nov 2018 16:05:52 GMT'}]",2018-11-15,"[['Chen', 'Wei', ''], ['Zhang', 'Hanrui', '']]","['influence submodularity', 'comparative independent cascade', 'influence maximization']"
11453,2205.15068,Bingxin Zhou,"Bingxin Zhou, Xuebin Zheng, Yu Guang Wang, Ming Li, Junbin Gao",Embedding Graphs on Grassmann Manifold,,,10.1016/j.neunet.2022.05.001,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Learning efficient graph representation is the key to favorably addressing
downstream tasks on graphs, such as node or graph property prediction. Given
the non-Euclidean structural property of graphs, preserving the original graph
data's similarity relationship in the embedded space needs specific tools and a
similarity metric. This paper develops a new graph representation learning
scheme, namely EGG, which embeds approximated second-order graph
characteristics into a Grassmann manifold. The proposed strategy leverages
graph convolutions to learn hidden representations of the corresponding
subspace of the graph, which is then mapped to a Grassmann point of a low
dimensional manifold through truncated singular value decomposition (SVD). The
established graph embedding approximates denoised correlationship of node
attributes, as implemented in the form of a symmetric matrix space for
Euclidean calculation. The effectiveness of EGG is demonstrated using both
clustering and classification tasks at the node level and graph level. It
outperforms baseline models on various benchmarks.
","[{'version': 'v1', 'created': 'Mon, 30 May 2022 12:56:24 GMT'}]",2022-05-31,"[['Zhou', 'Bingxin', ''], ['Zheng', 'Xuebin', ''], ['Wang', 'Yu Guang', ''], ['Li', 'Ming', ''], ['Gao', 'Junbin', '']]","['Grassmann Manifold', 'Graph Neural Network', 'Projection']"
11454,2205.10218,Jie Wang,"Rui Yang, Jie Wang, Zijie Geng, Mingxuan Ye, Shuiwang Ji, Bin Li, Feng
  Wu","Learning Task-relevant Representations for Generalization via
  Characteristic Functions of Reward Sequence Distributions",Accepted to KDD 2022,,10.1145/3534678.3539391,,cs.LG cs.AI cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generalization across different environments with the same tasks is critical
for successful applications of visual reinforcement learning (RL) in real
scenarios. However, visual distractions -- which are common in real scenes --
from high-dimensional observations can be hurtful to the learned
representations in visual RL, thus degrading the performance of generalization.
To tackle this problem, we propose a novel approach, namely Characteristic
Reward Sequence Prediction (CRESP), to extract the task-relevant information by
learning reward sequence distributions (RSDs), as the reward signals are
task-relevant in RL and invariant to visual distractions. Specifically, to
effectively capture the task-relevant information via RSDs, CRESP introduces an
auxiliary task -- that is, predicting the characteristic functions of RSDs --
to learn task-relevant representations, because we can well approximate the
high-dimensional distributions by leveraging the corresponding characteristic
functions. Experiments demonstrate that CRESP significantly improves the
performance of generalization on unseen environments, outperforming several
state-of-the-arts on DeepMind Control tasks with different visual distractions.
","[{'version': 'v1', 'created': 'Fri, 20 May 2022 14:52:03 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Jun 2022 13:21:47 GMT'}, {'version': 'v3', 'created': 'Thu, 30 Jun 2022 14:08:02 GMT'}]",2022-07-01,"[['Yang', 'Rui', ''], ['Wang', 'Jie', ''], ['Geng', 'Zijie', ''], ['Ye', 'Mingxuan', ''], ['Ji', 'Shuiwang', ''], ['Li', 'Bin', ''], ['Wu', 'Feng', '']]","['Task-relevant representation learning', 'reward sequence', 'characteristic function', 'generalization', 'visual reinforcement learning']"
11455,2208.06233,Simone Mueller,"Simone M\""uller and Dieter Kranzlm\""uller",Dynamic Sensor Matching based on Geomagnetic Inertial Navigation,Page 16-25,"Journal of WSCG, 2022, Vol.30., No.1-2, ISSN 1213-6972",10.24132/JWSCG.2022.3,,cs.RO cs.AI cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Optical sensors can capture dynamic environments and derive depth information
in near real-time. The quality of these digital reconstructions is determined
by factors like illumination, surface and texture conditions, sensing speed and
other sensor characteristics as well as the sensor-object relations.
Improvements can be obtained by using dynamically collected data from multiple
sensors. However, matching the data from multiple sensors requires a shared
world coordinate system. We present a concept for transferring multi-sensor
data into a commonly referenced world coordinate system: the earth's magnetic
field. The steady presence of our planetary magnetic field provides a reliable
world coordinate system, which can serve as a reference for a position-defined
reconstruction of dynamic environments. Our approach is evaluated using
magnetic field sensors of the ZED 2 stereo camera from Stereolabs, which
provides orientation relative to the North Pole similar to a compass. With the
help of inertial measurement unit informations, each camera's position data can
be transferred into the unified world coordinate system. Our evaluation reveals
the level of quality possible using the earth magnetic field and allows a basis
for dynamic and real-time-based applications of optical multi-sensors for
environment detection.
","[{'version': 'v1', 'created': 'Fri, 12 Aug 2022 12:04:04 GMT'}]",2022-08-15,"[['Müller', 'Simone', ''], ['Kranzlmüller', 'Dieter', '']]","['Dynamic Matching', 'Multi-Sensor', 'Magnetic Inertial Navigation', 'Real-Time', 'Computer Vision']"
11456,2010.14891,Mayuko Kori,"Mayuko Kori, Takeshi Tsukada and Naoki Kobayashi",A Cyclic Proof System for HFLN,27 pages,,10.4230/LIPIcs.CSL.2021.29,,cs.LO cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A cyclic proof system allows us to perform inductive reasoning without
explicit inductions. We propose a cyclic proof system for HFLN, which is a
higher-order predicate logic with natural numbers and alternating fixed-points.
Ours is the first cyclic proof system for a higher-order logic, to our
knowledge. Due to the presence of higher-order predicates and alternating
fixed-points, our cyclic proof system requires a more delicate global condition
on cyclic proofs than the original system of Brotherston and Simpson. We prove
the decidability of checking the global condition and soundness of this system,
and also prove a restricted form of standard completeness for an infinitary
variant of our cyclic proof system. A potential application of our cyclic proof
system is semi-automated verification of higher-order programs, based on
Kobayashi et al.'s recent work on reductions from program verification to HFLN
validity checking.
","[{'version': 'v1', 'created': 'Wed, 28 Oct 2020 11:19:53 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Jan 2021 02:17:08 GMT'}, {'version': 'v3', 'created': 'Thu, 12 Aug 2021 07:22:03 GMT'}]",2021-08-13,"[['Kori', 'Mayuko', ''], ['Tsukada', 'Takeshi', ''], ['Kobayashi', 'Naoki', '']]","['Cyclic proof', 'higher-order logic', 'fixed-point logic', 'sequent calculus']"
11457,1905.09763,Leo Torres,"Leo Torres, Kevin S Chan, Tina Eliassi-Rad",GLEE: Geometric Laplacian Eigenmap Embedding,,,10.1093/comnet/cnaa007,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph embedding seeks to build a low-dimensional representation of a graph G.
This low-dimensional representation is then used for various downstream tasks.
One popular approach is Laplacian Eigenmaps, which constructs a graph embedding
based on the spectral properties of the Laplacian matrix of G. The intuition
behind it, and many other embedding techniques, is that the embedding of a
graph must respect node similarity: similar nodes must have embeddings that are
close to one another. Here, we dispose of this distance-minimization
assumption. Instead, we use the Laplacian matrix to find an embedding with
geometric properties instead of spectral ones, by leveraging the so-called
simplex geometry of G. We introduce a new approach, Geometric Laplacian
Eigenmap Embedding (or GLEE for short), and demonstrate that it outperforms
various other techniques (including Laplacian Eigenmaps) in the tasks of graph
reconstruction and link prediction.
","[{'version': 'v1', 'created': 'Thu, 23 May 2019 16:35:23 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Jan 2020 15:49:28 GMT'}]",2020-03-10,"[['Torres', 'Leo', ''], ['Chan', 'Kevin S', ''], ['Eliassi-Rad', 'Tina', '']]","['Graph embedding', 'graph Laplacian', 'simplex geometry']"
11458,2203.09129,Dong Yao,"Dong Yao, Zhou Zhao, Shengyu Zhang, Jieming Zhu, Yudong Zhu, Rui
  Zhang, Xiuqiang He","Contrastive Learning with Positive-Negative Frame Mask for Music
  Representation",Accepted by WWW2022,,10.1145/3485447.3512011,,cs.SD cs.LG eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Self-supervised learning, especially contrastive learning, has made an
outstanding contribution to the development of many deep learning research
fields. Recently, researchers in the acoustic signal processing field noticed
its success and leveraged contrastive learning for better music representation.
Typically, existing approaches maximize the similarity between two distorted
audio segments sampled from the same music. In other words, they ensure a
semantic agreement at the music level. However, those coarse-grained methods
neglect some inessential or noisy elements at the frame level, which may be
detrimental to the model to learn the effective representation of music.
Towards this end, this paper proposes a novel Positive-nEgative frame mask for
Music Representation based on the contrastive learning framework, abbreviated
as PEMR. Concretely, PEMR incorporates a Positive-Negative Mask Generation
module, which leverages transformer blocks to generate frame masks on the
Log-Mel spectrogram. We can generate self-augmented negative and positive
samples by masking important components or inessential components,
respectively. We devise a novel contrastive learning objective to accommodate
both self-augmented positives/negatives sampled from the same music. We conduct
experiments on four public datasets. The experimental results of two
music-related downstream tasks, music classification, and cover song
identification, demonstrate the generalization ability and transferability of
music representation learned by PEMR.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2022 07:11:42 GMT'}, {'version': 'v2', 'created': 'Sun, 3 Apr 2022 04:06:18 GMT'}]",2022-04-05,"[['Yao', 'Dong', ''], ['Zhao', 'Zhou', ''], ['Zhang', 'Shengyu', ''], ['Zhu', 'Jieming', ''], ['Zhu', 'Yudong', ''], ['Zhang', 'Rui', ''], ['He', 'Xiuqiang', '']]","['Contrastive Learning', 'Music Representation', 'Representation Learning', 'Attention']"
11459,2009.00416,Yannick Forster,Yannick Forster,Church's thesis and related axioms in Coq's type theory,,,10.4230/LIPIcs.CSL.2021.21,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  ""Church's thesis"" ($\mathsf{CT}$) as an axiom in constructive logic states
that every total function of type $\mathbb{N} \to \mathbb{N}$ is computable,
i.e. definable in a model of computation. $\mathsf{CT}$ is inconsistent in both
classical mathematics and in Brouwer's intuitionism since it contradicts Weak
K\""onig's Lemma and the fan theorem, respectively. Recently, $\mathsf{CT}$ was
proved consistent for (univalent) constructive type theory.
  Since neither Weak K\""onig's Lemma nor the fan theorem are a consequence of
just logical axioms or just choice-like axioms assumed in constructive logic,
it seems likely that $\mathsf{CT}$ is inconsistent only with a combination of
classical logic and choice axioms. We study consequences of $\mathsf{CT}$ and
its relation to several classes of axioms in Coq's type theory, a constructive
type theory with a universe of propositions which does neither prove classical
logical axioms nor strong choice axioms.
  We thereby provide a partial answer to the question which axioms may preserve
computational intuitions inherent to type theory, and which certainly do not.
The paper can also be read as a broad survey of axioms in type theory, with all
results mechanised in the Coq proof assistant.
","[{'version': 'v1', 'created': 'Tue, 1 Sep 2020 13:42:30 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Nov 2020 18:01:58 GMT'}]",2022-12-09,"[['Forster', 'Yannick', '']]","['Church’s thesis', 'constructive type theory', 'constructive reverse mathematics', 'synthetic computability theory', 'Coq']"
11460,1711.10188,Emilio Mart\'inez-Pa\~neda,"George Papazafeiropoulos, Miguel Mu\~niz-Calvente, Emilio
  Mart\'inez-Pa\~neda",Abaqus2Matlab: A suitable tool for finite element post-processing,,"Advances in Engineering Software 105, pp. 9-16 (2017)",10.1016/j.advengsoft.2017.01.006,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A suitable piece of software is presented to connect Abaqus, a sophisticated
finite element package, with Matlab, the most comprehensive program for
mathematical analysis. This interface between these well-known codes not only
benefits from the image processing and the integrated graph-plotting features
of Matlab but also opens up new opportunities in results post-processing,
statistical analysis and mathematical optimization, among many other
possibilities. The software architecture and usage are appropriately described
and two problems of particular engineering significance are addressed to
demonstrate its capabilities. Firstly, the software is employed to assess
cleavage fracture through a novel 3-parameter Weibull probabilistic framework.
Then, its potential to create and train neural networks is used to identify
damage parameters through a hybrid experimental-numerical scheme, and model
crack propagation in structural materials by means of a cohesive zone approach.
The source code, detailed documentation and a large number of tutorials can be
freely downloaded from www.abaqus2matlab.com.
","[{'version': 'v1', 'created': 'Tue, 28 Nov 2017 09:06:44 GMT'}]",2017-11-29,"[['Papazafeiropoulos', 'George', ''], ['Muñiz-Calvente', 'Miguel', ''], ['Martínez-Pañeda', 'Emilio', '']]","['Abaqus2Matlab', 'Post-processing', 'Finite Element Method', 'Weibull stressmodel', 'Inverse analysis']"
11461,1907.04934,Isaac Oscar Gariano,"Isaac Oscar Gariano, James Noble and Marco Servetto",CallE: An Effect System for Method Calls,,,10.1145/3359591.3359731,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Effect systems are used to statically reason about the effects an expression
may have when evaluated. In the literature, such effects include various
behaviours as diverse as memory accesses and exception throwing. Here we
present CallE, an object-oriented language that takes a flexible approach where
effects are just method calls: this works well because ordinary methods often
model things like I/O operations, access to global state, or primitive language
operations such as thread creation. CallE supports both flexible and
fine-grained control over such behaviour, in a way designed to minimise the
complexity of annotations.
  CallE's effect system can be used to prevent OO code from performing
privileged operations, such as querying a database, modifying GUI widgets,
exiting the program, or performing network communication. It can also be used
to ensure determinism, by preventing methods from (indirectly) calling
non-deterministic primitives like random number generation or file reading.
","[{'version': 'v1', 'created': 'Wed, 10 Jul 2019 21:26:49 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Sep 2019 01:28:03 GMT'}, {'version': 'v3', 'created': 'Thu, 5 Sep 2019 23:48:07 GMT'}]",2019-09-09,"[['Gariano', 'Isaac Oscar', ''], ['Noble', 'James', ''], ['Servetto', 'Marco', '']]","['object oriented languages', 'type and effect systems', 'side effects', 'static type systems']"
11462,2209.04252,Mohammed Alghamdi,"Mohammed M. Alghamdi, He Wang, Andrew J. Bulpitt, David C. Hogg",Talking Head from Speech Audio using a Pre-trained Image Generator,"Accepted at ACM Multimedia 2022. The Project webpage can found at
  https://mohammedalghamdi.github.io/talking-heads-acm-mm",,10.1145/3503161.3548101,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  We propose a novel method for generating high-resolution videos of
talking-heads from speech audio and a single 'identity' image. Our method is
based on a convolutional neural network model that incorporates a pre-trained
StyleGAN generator. We model each frame as a point in the latent space of
StyleGAN so that a video corresponds to a trajectory through the latent space.
Training the network is in two stages. The first stage is to model trajectories
in the latent space conditioned on speech utterances. To do this, we use an
existing encoder to invert the generator, mapping from each video frame into
the latent space. We train a recurrent neural network to map from speech
utterances to displacements in the latent space of the image generator. These
displacements are relative to the back-projection into the latent space of an
identity image chosen from the individuals depicted in the training dataset. In
the second stage, we improve the visual quality of the generated videos by
tuning the image generator on a single image or a short video of any chosen
identity. We evaluate our model on standard measures (PSNR, SSIM, FID and LMD)
and show that it significantly outperforms recent state-of-the-art methods on
one of two commonly used datasets and gives comparable performance on the
other. Finally, we report on ablation experiments that validate the components
of the model. The code and videos from experiments can be found at
https://mohammedalghamdi.github.io/talking-heads-acm-mm
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2022 11:20:37 GMT'}]",2022-09-12,"[['Alghamdi', 'Mohammed M.', ''], ['Wang', 'He', ''], ['Bulpitt', 'Andrew J.', ''], ['Hogg', 'David C.', '']]","['talking head generation', 'video generation', 'audio-driven synthesis']"
11463,2203.17166,Maliheh Izadi,"Maliheh Izadi, Matin Nili Ahmadabadi",On the Evaluation of NLP-based Models for Software Engineering,"To appear in the Proceedings of the 1sth International Workshop on
  Natural Language-based Software Engineering (NLBSE), co-located with ICSE,
  2022",,10.1145/3528588.3528665,,cs.SE cs.CL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  NLP-based models have been increasingly incorporated to address SE problems.
These models are either employed in the SE domain with little to no change, or
they are greatly tailored to source code and its unique characteristics. Many
of these approaches are considered to be outperforming or complementing
existing solutions. However, an important question arises here: ""Are these
models evaluated fairly and consistently in the SE community?"". To answer this
question, we reviewed how NLP-based models for SE problems are being evaluated
by researchers. The findings indicate that currently there is no consistent and
widely-accepted protocol for the evaluation of these models. While different
aspects of the same task are being assessed in different studies, metrics are
defined based on custom choices, rather than a system, and finally, answers are
collected and interpreted case by case. Consequently, there is a dire need to
provide a methodological way of evaluating NLP-based models to have a
consistent assessment and preserve the possibility of fair and efficient
comparison.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2022 16:42:19 GMT'}]",2022-04-01,"[['Izadi', 'Maliheh', ''], ['Ahmadabadi', 'Matin Nili', '']]","['Evaluation', 'Natural Language Processing', 'Software Engineering']"
11464,2202.12704,Tim van der Velden,"Tim van der Velden, Stephan Ritzert, Stefanie Reese, Johanna Waimann",Modeling moving boundary value problems in electrochemical machining,,Int. J. Numer. Methods Eng. (2023),10.1002/nme.7190,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work presents a new approach to efficiently model the cathode in the
moving boundary value problem of electrochemical machining. Until recently, the
process simulation with finite elements had the drawback of remeshing required
by the changing surface geometries. This disadvantage was overcome by a novel
model formulation for the anodic dissolution that utilizes effective material
parameters as well as the dissolution level as an internal variable and,
thereby, does not require remeshing. Now, we extend this concept to model
arbitrarily shaped and moving cathodes. Two methodologies are investigated to
describe the time varying position of the cathode. In the first approach, we
change the electric conductivity of elements within the cathode and, in a
second approach, we apply Dirichlet boundary conditions on the nodes of
corresponding elements. For both methods, elements on the cathode's surface are
treated with effective material parameters. This procedure allows for the
efficient simulation of industrially relevant, complex geometries without mesh
adaptation. The model's performance is validated by means of analytical,
numerical and experimental results from the literature. The short computation
times make the approach interesting for industrial applications.
","[{'version': 'v1', 'created': 'Fri, 25 Feb 2022 14:02:38 GMT'}]",2023-01-12,"[['van der Velden', 'Tim', ''], ['Ritzert', 'Stephan', ''], ['Reese', 'Stefanie', ''], ['Waimann', 'Johanna', '']]","['Electrochemical machining', 'Finite element method', 'Moving boundary value problem']"
11465,2001.05209,Rohan Saphal Mr,"Rohan Saphal, Balaraman Ravindran, Dheevatsa Mudigere, Sasikanth
  Avancha, Bharat Kaul",SEERL: Sample Efficient Ensemble Reinforcement Learning,"Accepted at Proceedings of the 20th International Conference on
  Autonomous Agents and MultiAgent Systems",,10.5555/3463952.3464080,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ensemble learning is a very prevalent method employed in machine learning.
The relative success of ensemble methods is attributed to their ability to
tackle a wide range of instances and complex problems that require different
low-level approaches. However, ensemble methods are relatively less popular in
reinforcement learning owing to the high sample complexity and computational
expense involved in obtaining a diverse ensemble. We present a novel training
and model selection framework for model-free reinforcement algorithms that use
ensembles of policies obtained from a single training run. These policies are
diverse in nature and are learned through directed perturbation of the model
parameters at regular intervals. We show that learning and selecting an
adequately diverse set of policies is required for a good ensemble while
extreme diversity can prove detrimental to overall performance. Selection of an
adequately diverse set of policies is done through our novel policy selection
framework. We evaluate our approach on challenging discrete and continuous
control tasks and also discuss various ensembling strategies. Our framework is
substantially sample efficient, computationally inexpensive and is seen to
outperform state-of-the-art (SOTA) scores in Atari 2600 and Mujoco.
","[{'version': 'v1', 'created': 'Wed, 15 Jan 2020 10:12:00 GMT'}, {'version': 'v2', 'created': 'Sun, 16 May 2021 13:35:02 GMT'}]",2021-05-18,"[['Saphal', 'Rohan', ''], ['Ravindran', 'Balaraman', ''], ['Mudigere', 'Dheevatsa', ''], ['Avancha', 'Sasikanth', ''], ['Kaul', 'Bharat', '']]","['Deep Reinforcement Learning', 'Ensemble methods', 'Combining policies']"
11466,1708.02676,Shinya Nawata Dr,"Shinya Nawata, Atsuto Maki and Takashi Hikihara",Power packet transferability via symbol propagation matrix,"Submitted to Proceedings of the Royal Society A: Mathematical,
  Physical and Engineering Sciences",,10.1098/rspa.2017.0552,,cs.SY cs.DM math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Power packet is a unit of electric power transferred by a power pulse with an
information tag. In Shannon's information theory, messages are represented by
symbol sequences in a digitized manner. Referring to this formulation, we
define symbols in power packetization as a minimum unit of power transferred by
a tagged pulse. Here, power is digitized and quantized. In this paper, we
consider packetized power in networks for a finite duration, giving symbols and
their energies to the networks. A network structure is defined using a graph
whose nodes represent routers, sources, and destinations. First, we introduce
symbol propagation matrix (SPM) in which symbols are transferred at links
during unit times. Packetized power is described as a network flow in a
spatio-temporal structure. Then, we study the problem of selecting an SPM in
terms of transferability, that is, the possibility to represent given energies
at sources and destinations during the finite duration. To select an SPM, we
consider a network flow problem of packetized power. The problem is formulated
as an M-convex submodular flow problem which is known as generalization of the
minimum cost flow problem and solvable. Finally, through examples, we verify
that this formulation provides reasonable packetized power.
","[{'version': 'v1', 'created': 'Tue, 8 Aug 2017 23:33:52 GMT'}]",2018-07-04,"[['Nawata', 'Shinya', ''], ['Maki', 'Atsuto', ''], ['Hikihara', 'Takashi', '']]","['power packet', 'router', 'network flow problem', 'electrical energy network']"
11467,1506.07867,Martin Becker,"Martin Becker and Markus Neumair and Alexander S\""ohn and Samarjit
  Chakraborty","Approaches for Software Verification of an Emergency Recovery System for
  Micro Air Vehicles","12 pages, 34th International Conference on Computer Safety,
  Reliability and Security (SAFECOMP)",,10.1007/978-3-319-24249-1_32,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the development and verification of a competitive
parachute system for Micro Air Vehicles, in particular focusing on verification
of the embedded software. We first introduce the overall solution including a
system level failure analysis, and then show how we minimized the influence of
faulty software. This paper demonstrates that with careful abstraction and
little overapproximation, the entire code running on a microprocessor can be
verified using bounded model checking, and that this is a useful approach for
resource-constrained embedded systems. he resulting Emergency Recovery System
is to our best knowledge the first of its kind that passed formal verification,
and furthermore is superior to all other existing solutions (including
commercially available ones) from an operational point of view.
","[{'version': 'v1', 'created': 'Wed, 24 Jun 2015 18:34:06 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Jun 2017 18:36:48 GMT'}]",2017-06-12,"[['Becker', 'Martin', ''], ['Neumair', 'Markus', ''], ['Söhn', 'Alexander', ''], ['Chakraborty', 'Samarjit', '']]","['remotely-piloted aircraft systems', 'multicopter', 'safety', 'parachute', 'software verification', 'formal analysis']"
11468,2011.00057,Nishant Raj,Harshit Jain and Nishant Raj and Suyash Mishra,"A Sui Generis QA Approach using RoBERTa for Adverse Drug Event
  Identification",,"BMC Bioinformatics 22, 330 (2021)",10.1186/s12859-021-04249-7,,cs.CL cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Extraction of adverse drug events from biomedical literature and other
textual data is an important component to monitor drug-safety and this has
attracted attention of many researchers in healthcare. Existing works are more
pivoted around entity-relation extraction using bidirectional long short term
memory networks (Bi-LSTM) which does not attain the best feature
representations. In this paper, we introduce a question answering framework
that exploits the robustness, masking and dynamic attention capabilities of
RoBERTa by a technique of domain adaptation and attempt to overcome the
aforementioned limitations. Our model outperforms the prior work by 9.53%
F1-Score.
","[{'version': 'v1', 'created': 'Fri, 30 Oct 2020 19:09:48 GMT'}]",2021-10-22,"[['Jain', 'Harshit', ''], ['Raj', 'Nishant', ''], ['Mishra', 'Suyash', '']]","['adverse drug event', 'RoBERTa', 'question-answering', 'entity-relation extraction', 'healthcare']"
11469,1805.01375,Tim Kuipers,"Tim Kuipers, Willemijn Elkhuizen, Jouke Verlinden, Eugeni Doubrovski","Hatching for 3D prints: line-based halftoning for dual extrusion fused
  deposition modeling","12 pages, 14 figures",,10.1016/j.cag.2018.04.006,,cs.GR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This work presents a halftoning technique to manufacture 3D objects with the
appearance of continuous grayscale imagery for Fused Deposition Modeling (FDM)
printers. While droplet-based dithering is a common halftoning technique, this
is not applicable to FDM printing, since FDM builds up objects by extruding
material in semi-continuous paths. The line-based halftoning principle called
'hatching' is applied to the line patterns naturally occuring in FDM prints,
which are built up in a layer-by-layer fashion. The proposed halftoning
technique isn't limited by the challenges existing techniques face; existing
FDM coloring techniques greatly influence the surface geometry and deteriorate
with surface slopes deviating from vertical or greatly influence the basic
parameters of the printing process and thereby the structural properties of the
resulting product. Furthermore, the proposed technique has little effect on
printing time. Experiments on a dual-nozzle FDM printer show promising results.
Future work is required to calibrate the perceived tone.
","[{'version': 'v1', 'created': 'Thu, 3 May 2018 15:28:50 GMT'}, {'version': 'v2', 'created': 'Fri, 4 May 2018 08:52:05 GMT'}]",2018-05-09,"[['Kuipers', 'Tim', ''], ['Elkhuizen', 'Willemijn', ''], ['Verlinden', 'Jouke', ''], ['Doubrovski', 'Eugeni', '']]","['Fused Deposition Modeling', '3D printing', 'color', 'grayscale', 'halftone', 'hatching']"
11470,2101.05028,Giulia Perugia Dr.,"Giulia Perugia, Maike Paetzel-Pr\""usmann, Madelene Alanenp\""a\""a, and
  Ginevra Castellano","I Can See it in Your Eyes: Gaze as an Implicit Cue of Uncanniness and
  Task Performance in Repeated Interactions","29 pages, 7 figures plus Appendix. This work has been submitted to
  Frontiers in Robotics and AI (Human-Robot Interaction) and is currently under
  review","Frontiers in Robotics and AI, 8, 78 (2021)",10.3389/frobt.2021.645956,,cs.RO cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the past years, extensive research has been dedicated to developing
robust platforms and data-driven dialog models to support long-term human-robot
interactions. However, little is known about how people's perception of robots
and engagement with them develop over time and how these can be accurately
assessed through implicit and continuous measurement techniques. In this paper,
we explore this by involving participants in three interaction sessions with
multiple days of zero exposure in between. Each session consists of a joint
task with a robot as well as two short social chats with it before and after
the task. We measure participants' gaze patterns with a wearable eye-tracker
and gauge their perception of the robot and engagement with it and the joint
task using questionnaires. Results disclose that aversion of gaze in a social
chat is an indicator of a robot's uncanniness and that the more people gaze at
the robot in a joint task, the worse they perform. In contrast with most HRI
literature, our results show that gaze towards an object of shared attention,
rather than gaze towards a robotic partner, is the most meaningful predictor of
engagement in a joint task. Furthermore, the analyses of gaze patterns in
repeated interactions disclose that people's mutual gaze in a social chat
develops congruently with their perceptions of the robot over time. These are
key findings for the HRI community as they entail that gaze behavior can be
used as an implicit measure of people's perception of robots in a social chat
and of their engagement and task performance in a joint task.
","[{'version': 'v1', 'created': 'Wed, 13 Jan 2021 12:20:12 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Feb 2021 13:52:04 GMT'}]",2021-04-08,"[['Perugia', 'Giulia', ''], ['Paetzel-Prüsmann', 'Maike', ''], ['Alanenpää', 'Madelene', ''], ['Castellano', 'Ginevra', '']]","['Perception of Robots', 'Long-term Interaction', 'Mutual Gaze', 'Gaze Detection', 'Engagement', 'Uncanny Valley']"
11471,1912.10447,Vincent Vajnovszki,"Jean-Luc Baril, Carine Khalil, Vincent Vajnovszki",Catalan words avoiding pairs of length three patterns,,"Discrete Mathematics & Theoretical Computer Science, vol. 22 no.
  2, Permutation Patterns 2019, Special issues (April 16, 2021) dmtcs:7369",10.46298/dmtcs.6002,,cs.DM math.CO,http://creativecommons.org/licenses/by/4.0/,"  Catalan words are particular growth-restricted words counted by the eponymous
integer sequence. In this article we consider Catalan words avoiding a pair of
patterns of length 3, pursuing the recent initiating work of the first and last
authors and of S. Kirgizov where (among other things) the enumeration of
Catalan words avoiding a patterns of length 3 is completed. More precisely, we
explore systematically the structural properties of the sets of words under
consideration and give enumerating results by means of recursive decomposition,
constructive bijections or bivariate generating functions with respect to the
length and descent number. Some of the obtained enumerating sequences are
known, and thus the corresponding results establish new combinatorial
interpretations for them.
","[{'version': 'v1', 'created': 'Sun, 22 Dec 2019 13:39:54 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Mar 2021 21:30:47 GMT'}, {'version': 'v3', 'created': 'Wed, 14 Apr 2021 15:19:36 GMT'}]",2021-10-04,"[['Baril', 'Jean-Luc', ''], ['Khalil', 'Carine', ''], ['Vajnovszki', 'Vincent', '']]","['Catalan/pattern-avoiding words', 'enumeration', 'constructive bijections', '(bivariate) generating functions']"
11472,1910.04997,Sebastian Zambal,"Sebastian Zambal, Christoph Heindl, Christian Eitzinger, Josef
  Scharinger","End-to-End Defect Detection in Automated Fiber Placement Based on
  Artificially Generated Data","Presented at Quality Control by Artificial Vision (QCAV), 2019",,10.1117/12.2521739,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated fiber placement (AFP) is an advanced manufacturing technology that
increases the rate of production of composite materials. At the same time, the
need for adaptable and fast inline control methods of such parts raises.
Existing inspection systems make use of handcrafted filter chains and feature
detectors, tuned for a specific measurement methods by domain experts. These
methods hardly scale to new defects or different measurement devices. In this
paper, we propose to formulate AFP defect detection as an image segmentation
problem that can be solved in an end-to-end fashion using artificially
generated training data. We employ a probabilistic graphical model to generate
training images and annotations. We then train a deep neural network based on
recent architectures designed for image segmentation. This leads to an
appealing method that scales well with new defect types and measurement devices
and requires little real world data for training.
","[{'version': 'v1', 'created': 'Fri, 11 Oct 2019 07:10:24 GMT'}]",2019-10-14,"[['Zambal', 'Sebastian', ''], ['Heindl', 'Christoph', ''], ['Eitzinger', 'Christian', ''], ['Scharinger', 'Josef', '']]","['AFP', 'deep learning', 'probabilistic graphical model', 'segmentation', 'end-to-end']"
11473,2202.00845,Josh Johnston,Josh Johnston and Tim Andersen,Random Processes with High Variance Produce Scale Free Networks,"Submitted to Physica A. 13 pages, 1 figure",,10.1016/j.physa.2022.127588,,cs.DM physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  Real-world networks tend to be scale free, having heavy-tailed degree
distributions with more hubs than predicted by classical random graph
generation methods. Preferential attachment and growth are the most commonly
accepted mechanisms leading to these networks and are incorporated in the
Barab\'asi-Albert (BA) model. We provide an alternative model using a randomly
stopped linking process inspired by a generalized Central Limit Theorem (CLT)
for geometric distributions with widely varying parameters. The common
characteristic of both the BA model and our randomly stopped linking model is
the mixture of widely varying geometric distributions, suggesting the critical
characteristic of scale free networks is high variance, not growth or
preferential attachment. The limitation of classical random graph models is low
variance in parameters, while scale free networks are the natural, expected
result of real-world variance.
","[{'version': 'v1', 'created': 'Wed, 2 Feb 2022 01:36:33 GMT'}]",2022-07-20,"[['Johnston', 'Josh', ''], ['Andersen', 'Tim', '']]","['network science', 'graph', 'scale free', 'power laws', 'preferential attachment', 'central limit theorem']"
11474,2005.03812,Martina Toshevska,"Martina Toshevska, Frosina Stojanovska and Jovan Kalajdjieski",Comparative Analysis of Word Embeddings for Capturing Word Similarities,"Part of the 6th International Conference on Natural Language
  Processing (NATP 2020)","6th International Conference on Natural Language Processing (NATP
  2020)",10.5121/csit.2020.100402,,cs.CL cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Distributed language representation has become the most widely used technique
for language representation in various natural language processing tasks. Most
of the natural language processing models that are based on deep learning
techniques use already pre-trained distributed word representations, commonly
called word embeddings. Determining the most qualitative word embeddings is of
crucial importance for such models. However, selecting the appropriate word
embeddings is a perplexing task since the projected embedding space is not
intuitive to humans. In this paper, we explore different approaches for
creating distributed word representations. We perform an intrinsic evaluation
of several state-of-the-art word embedding methods. Their performance on
capturing word similarities is analysed with existing benchmark datasets for
word pairs similarities. The research in this paper conducts a correlation
analysis between ground truth word similarities and similarities obtained by
different word embedding methods.
","[{'version': 'v1', 'created': 'Fri, 8 May 2020 01:16:03 GMT'}]",2020-05-11,"[['Toshevska', 'Martina', ''], ['Stojanovska', 'Frosina', ''], ['Kalajdjieski', 'Jovan', '']]","['Word Embeddings', 'Distributed Word Representation', 'Word Similarity']"
11475,2212.08166,Nathan Goulet,"Nathan Goulet, Qian Wang, Beshah Ayalew","Probabilistic Constraint Tightening Techniques for Trajectory Planning
  with Predictive Control",,"Journal of the Franklin Institute, Volume 359, Issue 12, August
  2022, Pages 6142-6172",10.1016/j.jfranklin.2022.06.005,,cs.RO cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In order for automated mobile vehicles to navigate in the real world with
minimal collision risks, it is necessary for their planning algorithms to
consider uncertainties from measurements and environmental disturbances. In
this paper, we consider analytical solutions for a conservative approximation
of the mutual probability of collision between two robotic vehicles in the
presence of such uncertainties. Therein, we present two methods, which we call
unitary scaling and principal axes rotation, for decoupling the bivariate
integral required for efficient approximation of the probability of collision
between two vehicles including orientation effects. We compare the conservatism
of these methods analytically and numerically. By closing a control loop
through a model predictive guidance scheme, we observe through Monte-Carlo
simulations that directly implementing collision avoidance constraints from the
conservative approximations remains infeasible for real-time planning. We then
propose and implement a convexification approach based on the tightened
collision constraints that significantly improves the computational efficiency
and robustness of the predictive guidance scheme.
","[{'version': 'v1', 'created': 'Thu, 15 Dec 2022 22:01:15 GMT'}]",2022-12-19,"[['Goulet', 'Nathan', ''], ['Wang', 'Qian', ''], ['Ayalew', 'Beshah', '']]","['probabilistic collision criteria', 'constraint tightening', 'chanceconstraints', 'motion trajectory planning', 'predictive control']"
11476,1601.03128,Anand Mishra Mr.,Anand Mishra and Karteek Alahari and C. V. Jawahar,"Enhancing Energy Minimization Framework for Scene Text Recognition with
  Top-Down Cues",,,10.1016/j.cviu.2016.01.002,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recognizing scene text is a challenging problem, even more so than the
recognition of scanned documents. This problem has gained significant attention
from the computer vision community in recent years, and several methods based
on energy minimization frameworks and deep learning approaches have been
proposed. In this work, we focus on the energy minimization framework and
propose a model that exploits both bottom-up and top-down cues for recognizing
cropped words extracted from street images. The bottom-up cues are derived from
individual character detections from an image. We build a conditional random
field model on these detections to jointly model the strength of the detections
and the interactions between them. These interactions are top-down cues
obtained from a lexicon-based prior, i.e., language statistics. The optimal
word represented by the text image is obtained by minimizing the energy
function corresponding to the random field model. We evaluate our proposed
algorithm extensively on a number of cropped scene text benchmark datasets,
namely Street View Text, ICDAR 2003, 2011 and 2013 datasets, and IIIT 5K-word,
and show better performance than comparable methods. We perform a rigorous
analysis of all the steps in our approach and analyze the results. We also show
that state-of-the-art convolutional neural network features can be integrated
in our framework to further improve the recognition performance.
","[{'version': 'v1', 'created': 'Wed, 13 Jan 2016 04:47:28 GMT'}]",2016-03-24,"[['Mishra', 'Anand', ''], ['Alahari', 'Karteek', ''], ['Jawahar', 'C. V.', '']]","['Scene text understanding', 'text recognition', 'lexicon priors', 'character recognition', 'random field models']"
11477,1906.04491,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",Using Hoare logic in a process algebra setting,"24 pages; presentation improved, examples added","Fundamenta Informaticae 179(4):321--344, 2021",10.3233/FI-2021-2026,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper concerns the relation between process algebra and Hoare logic. We
investigate the question whether and how a Hoare logic can be used for
reasoning about how data change in the course of a process when reasoning
equationally about that process. We introduce an extension of ACP (Algebra of
Communicating Processes) with features that are relevant to processes in which
data are involved, present a Hoare logic for the processes considered in this
process algebra, and discuss the use of this Hoare logic as a complement to
pure equational reasoning with the equational axioms of the process algebra.
","[{'version': 'v1', 'created': 'Tue, 11 Jun 2019 10:50:01 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Dec 2019 10:37:00 GMT'}, {'version': 'v3', 'created': 'Tue, 13 Oct 2020 11:23:52 GMT'}]",2021-05-18,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['process algebra', 'data parameterized action', 'assignment action', 'guarded command', 'asserted process', 'Hoare logic']"
11478,1910.01789,Akshay L Chandra,"Akshay L Chandra, Sai Vikas Desai, Vineeth N Balasubramanian, Seishi
  Ninomiya, Wei Guo","Active Learning with Point Supervision for Cost-Effective Panicle
  Detection in Cereal Crops",Accepted as a journal paper at BMC Plant Methods (February 2020),,10.1186/S13007-020-00575-8,,cs.CV q-bio.QM,http://creativecommons.org/licenses/by/4.0/,"  Panicle density of cereal crops such as wheat and sorghum is one of the main
components for plant breeders and agronomists in understanding the yield of
their crops. To phenotype the panicle density effectively, researchers agree
there is a significant need for computer vision-based object detection
techniques. Especially in recent times, research in deep learning-based object
detection shows promising results in various agricultural studies. However,
training such systems usually requires a lot of bounding-box labeled data.
Since crops vary by both environmental and genetic conditions, acquisition of
huge amount of labeled image datasets for each crop is expensive and
time-consuming. Thus, to catalyze the widespread usage of automatic object
detection for crop phenotyping, a cost-effective method to develop such
automated systems is essential. We propose a point supervision based active
learning approach for panicle detection in cereal crops. In our approach, the
model constantly interacts with a human annotator by iteratively querying the
labels for only the most informative images, as opposed to all images in a
dataset. Our query method is specifically designed for cereal crops which
usually tend to have panicles with low variance in appearance. Our method
reduces labeling costs by intelligently leveraging low-cost weak labels (object
centers) for picking the most informative images for which strong labels
(bounding boxes) are required. We show promising results on two publicly
available cereal crop datasets - Sorghum and Wheat. On Sorghum, 6 variants of
our proposed method outperform the best baseline method with more than 55%
savings in labeling time. Similarly, on Wheat, 3 variants of our proposed
methods outperform the best baseline method with more than 50% of savings in
labeling time.
","[{'version': 'v1', 'created': 'Fri, 4 Oct 2019 02:56:43 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Oct 2019 09:06:44 GMT'}, {'version': 'v3', 'created': 'Fri, 17 Apr 2020 07:26:02 GMT'}]",2020-04-20,"[['Chandra', 'Akshay L', ''], ['Desai', 'Sai Vikas', ''], ['Balasubramanian', 'Vineeth N', ''], ['Ninomiya', 'Seishi', ''], ['Guo', 'Wei', '']]","['Plant phenotyping', 'Crop detection', 'Deep learning', 'Active learning', 'Weak supervision', 'Point supervision', 'Faster R-CNN']"
11479,2007.03486,Simon Yusuf Enoch,Simon Yusuf Enoch and Jin B. Hong and Mengmeng Ge and Dong Seong Kim,Composite Metrics for Network Security Analysis,21 pages journal,"Software Networking, 2018(1), 137-160",10.13052/jsn2445-9739.2017.007,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security metrics present the security level of a system or a network in both
qualitative and quantitative ways. In general, security metrics are used to
assess the security level of a system and to achieve security goals. There are
a lot of security metrics for security analysis, but there is no systematic
classification of security metrics that are based on network reachability
information. To address this, we propose a systematic classification of
existing security metrics based on network reachability information. Mainly, we
classify the security metrics into host-based and network-based metrics. The
host-based metrics are classified into metrics ``without probability"" and ""with
probability"", while the network-based metrics are classified into ""path-based""
and ""non-path based"". Finally, we present and describe an approach to develop
composite security metrics and it's calculations using a Hierarchical Attack
Representation Model (HARM) via an example network. Our novel classification of
security metrics provides a new methodology to assess the security of a system.
","[{'version': 'v1', 'created': 'Tue, 7 Jul 2020 14:18:31 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Jul 2020 23:44:40 GMT'}]",2021-05-19,"[['Enoch', 'Simon Yusuf', ''], ['Hong', 'Jin B.', ''], ['Ge', 'Mengmeng', ''], ['Kim', 'Dong Seong', '']]","['Attack Graphs', 'Cyber Security', 'Graphical Security Model', 'Security Assessment', 'Attack Trees']"
11480,2101.08747,Yuwei Cao,"Yuwei Cao, Hao Peng, Jia Wu, Yingtong Dou, Jianxin Li, Philip S. Yu","Knowledge-Preserving Incremental Social Event Detection via
  Heterogeneous GNNs",This work has been accepted to The Web Conference 2021,In Proceedings of the Web Conference 2021. 3383-3395,10.1145/3442381.3449834,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social events provide valuable insights into group social behaviors and
public concerns and therefore have many applications in fields such as product
recommendation and crisis management. The complexity and streaming nature of
social messages make it appealing to address social event detection in an
incremental learning setting, where acquiring, preserving, and extending
knowledge are major concerns. Most existing methods, including those based on
incremental clustering and community detection, learn limited amounts of
knowledge as they ignore the rich semantics and structural information
contained in social data. Moreover, they cannot memorize previously acquired
knowledge. In this paper, we propose a novel Knowledge-Preserving Incremental
Heterogeneous Graph Neural Network (KPGNN) for incremental social event
detection. To acquire more knowledge, KPGNN models complex social messages into
unified social graphs to facilitate data utilization and explores the
expressive power of GNNs for knowledge extraction. To continuously adapt to the
incoming data, KPGNN adopts contrastive loss terms that cope with a changing
number of event classes. It also leverages the inductive learning ability of
GNNs to efficiently detect events and extends its knowledge from previously
unseen data. To deal with large social streams, KPGNN adopts a mini-batch
subgraph sampling strategy for scalable training, and periodically removes
obsolete data to maintain a dynamic embedding space. KPGNN requires no feature
engineering and has few hyperparameters to tune. Extensive experiment results
demonstrate the superiority of KPGNN over various baselines.
","[{'version': 'v1', 'created': 'Thu, 21 Jan 2021 17:56:57 GMT'}, {'version': 'v2', 'created': 'Sat, 13 Feb 2021 17:49:54 GMT'}]",2021-08-31,"[['Cao', 'Yuwei', ''], ['Peng', 'Hao', ''], ['Wu', 'Jia', ''], ['Dou', 'Yingtong', ''], ['Li', 'Jianxin', ''], ['Yu', 'Philip S.', '']]","['Social Event Detection', 'Graph Neural Networks', 'Incremental Learning', 'Contrastive Learning']"
11481,1807.07961,Jianbo Yuan,"Yuxiao Chen, Jianbo Yuan, Quanzeng You, Jiebo Luo","Twitter Sentiment Analysis via Bi-sense Emoji Embedding and
  Attention-based LSTM",,,10.1145/3240508.3240533,,cs.CL cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sentiment analysis on large-scale social media data is important to bridge
the gaps between social media contents and real world activities including
political election prediction, individual and public emotional status
monitoring and analysis, and so on. Although textual sentiment analysis has
been well studied based on platforms such as Twitter and Instagram, analysis of
the role of extensive emoji uses in sentiment analysis remains light. In this
paper, we propose a novel scheme for Twitter sentiment analysis with extra
attention on emojis. We first learn bi-sense emoji embeddings under positive
and negative sentimental tweets individually, and then train a sentiment
classifier by attending on these bi-sense emoji embeddings with an
attention-based long short-term memory network (LSTM). Our experiments show
that the bi-sense embedding is effective for extracting sentiment-aware
embeddings of emojis and outperforms the state-of-the-art models. We also
visualize the attentions to show that the bi-sense emoji embedding provides
better guidance on the attention mechanism to obtain a more robust
understanding of the semantics and sentiments.
","[{'version': 'v1', 'created': 'Fri, 20 Jul 2018 04:09:08 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Aug 2018 01:25:05 GMT'}]",2018-08-08,"[['Chen', 'Yuxiao', ''], ['Yuan', 'Jianbo', ''], ['You', 'Quanzeng', ''], ['Luo', 'Jiebo', '']]","['Sentiment analysis', 'emoji', 'bi-sense embedding', 'attention']"
11482,1702.03890,Oscar Dario Ramos-Cantor,"Oscar D. Ramos-Cantor, Jakob Belschner, Ganapati Hegde and Marius
  Pesavento",Centralized Coordinated Scheduling in LTE-Advanced Networks,"28 pages, 6 figures",,10.1186/s13638-017-0904-5,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work addresses the problem associated with coordinating scheduling
decisions among multiple base stations in an LTE-Advanced downlink network in
order to manage inter-cell interference with a centralized controller. To solve
the coordinated scheduling problem an integer non-linear program is formulated
that, unlike most existing approaches, does not rely on exact channel state
information but only makes use of the specific measurement reports defined in
the 3GPP standard. An equivalent integer linear reformulation of the
coordinated scheduling problem is proposed, which can be efficiently solved by
commercial solvers. Extensive simulations of medium to large-size networks are
carried out to analyze the performance of the proposed coordinated scheduling
approaches, confirming available analytical results reporting fundamental
limitations in the cooperation due to out-of-cluster interference.
Nevertheless, the schemes proposed in this paper show important gains in
average user throughput of the cell-edge users, especially in the case of
heterogeneous networks.
","[{'version': 'v1', 'created': 'Mon, 13 Feb 2017 17:19:18 GMT'}]",2017-07-17,"[['Ramos-Cantor', 'Oscar D.', ''], ['Belschner', 'Jakob', ''], ['Hegde', 'Ganapati', ''], ['Pesavento', 'Marius', '']]","['4G mobile communication', 'scheduling algorithms', 'integerlinear programming']"
11483,2204.09523,Martijn Courteaux,"Martijn Courteaux, Julie Artois, Stijn De Pauw, Peter Lambert, Glenn
  Van Wallendael",SILVR: A Synthetic Immersive Large-Volume Plenoptic Dataset,"In 13th ACM Multimedia Systems Conference (MMSys '22), June 14-17,
  2022, Athlone, Ireland. ACM, New York, NY, USA, 6 pages",,10.1145/3524273.3532890,,cs.GR,http://creativecommons.org/licenses/by/4.0/,"  In six-degrees-of-freedom light-field (LF) experiences, the viewer's freedom
is limited by the extent to which the plenoptic function was sampled. Existing
LF datasets represent only small portions of the plenoptic function, such that
they either cover a small volume, or they have limited field of view.
Therefore, we propose a new LF image dataset ""SILVR"" that allows for
six-degrees-of-freedom navigation in much larger volumes while maintaining full
panoramic field of view. We rendered three different virtual scenes in various
configurations, where the number of views ranges from 642 to 2226. One of these
scenes (called Zen Garden) is a novel scene, and is made publicly available. We
chose to position the virtual cameras closely together in large cuboid and
spherical organisations ($2.2m^3$ to $48m^3$), equipped with 180{\deg} fish-eye
lenses. Every view is rendered to a color image and depth map of 2048px
$\times$ 2048px. Additionally, we present the software used to automate the
multi-view rendering process, as well as a lens-reprojection tool that converts
between images with panoramic or fish-eye projection to a standard rectilinear
(i.e., perspective) projection. Finally, we demonstrate how the proposed
dataset and software can be used to evaluate LF coding/rendering techniques(in
this case for training NeRFs with instant-ngp). As such, we provide the first
publicly-available LF dataset for large volumes of light with full panoramic
field of view
","[{'version': 'v1', 'created': 'Wed, 20 Apr 2022 15:01:05 GMT'}]",2022-04-21,"[['Courteaux', 'Martijn', ''], ['Artois', 'Julie', ''], ['De Pauw', 'Stijn', ''], ['Lambert', 'Peter', ''], ['Van Wallendael', 'Glenn', '']]","['dataset', 'immersive', 'plenoptic', 'light field', '6DoF content']"
11484,2203.02832,Josue Tonelli-Cueto,"Apostolos Chalkis, Christina Katsamaki, Josu\'e Tonelli-Cueto","On the Error of Random Sampling: Uniformly Distributed Random Points on
  Parametric Curves","10 pages, 5 figures, 1 table. 2nd version: New title, major changes","Proceedings of the 2022 International Symposium on Symbolic and
  Algebraic Computation (ISSAC 22). Association for Computing Machinery,
  273-282 (2022)",10.1145/3476446.3536190,,cs.CG cs.CC cs.NA math.NA math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a parametric polynomial curve $\gamma:[a,b]\rightarrow \mathbb{R}^n$,
how can we sample a random point $\mathfrak{x}\in \mathrm{im}(\gamma)$ in such
a way that it is distributed uniformly with respect to the arc-length?
Unfortunately, we cannot sample exactly such a point-even assuming we can
perform exact arithmetic operations. So we end up with the following question:
how does the method we choose affect the quality of the approximate sample we
obtain? In practice, there are many answers. However, in theory, there are
still gaps in our understanding. In this paper, we address this question from
the point of view of complexity theory, providing bounds in terms of the size
of the desired error.
","[{'version': 'v1', 'created': 'Sat, 5 Mar 2022 23:21:32 GMT'}, {'version': 'v2', 'created': 'Tue, 3 May 2022 12:02:14 GMT'}]",2022-09-28,"[['Chalkis', 'Apostolos', ''], ['Katsamaki', 'Christina', ''], ['Tonelli-Cueto', 'Josué', '']]","['parametric curve', 'sampling', 'sampling error', 'Chebyshev', 'approximation']"
11485,2103.03413,Yi-Lin Tsai,"Yi-Lin Tsai (1), Chetanya Rastogi (2), Peter K. Kitanidis (1, 3, and
  4), Christopher B. Field (3, 5, and 6) ((1) Department of Civil and
  Environmental Engineering, Stanford University, Stanford, CA, USA, (2)
  Department of Computer Science, Stanford University, Stanford, CA, USA, (3)
  Woods Institute for the Environment, Stanford University, Stanford, CA, USA,
  (4) Institute for Computational and Mathematical Engineering, Stanford
  University, Stanford, CA, USA, (5) Department of Biology, Stanford
  University, Stanford, CA, USA, (6) Department of Earth System Science,
  Stanford University, Stanford, CA, USA)","Routing algorithms as tools for integrating social distancing with
  emergency evacuation",,"Sci Rep 11, 19623 (2021)",10.1038/s41598-021-98643-z,,cs.AI cs.CY cs.HC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the lessons from the COVID-19 pandemic is the importance of social
distancing, even in challenging circumstances such as pre-hurricane evacuation.
To explore the implications of integrating social distancing with evacuation
operations, we describe this evacuation process as a Capacitated Vehicle
Routing Problem (CVRP) and solve it using a DNN (Deep Neural Network)-based
solution (Deep Reinforcement Learning) and a non-DNN solution (Sweep
Algorithm). A central question is whether Deep Reinforcement Learning provides
sufficient extra routing efficiency to accommodate increased social distancing
in a time-constrained evacuation operation. We found that, in comparison to the
Sweep Algorithm, Deep Reinforcement Learning can provide decision-makers with
more efficient routing. However, the evacuation time saved by Deep
Reinforcement Learning does not come close to compensating for the extra time
required for social distancing, and its advantage disappears as the emergency
vehicle capacity approaches the number of people per household.
","[{'version': 'v1', 'created': 'Fri, 5 Mar 2021 01:12:31 GMT'}, {'version': 'v2', 'created': 'Mon, 3 May 2021 22:43:07 GMT'}, {'version': 'v3', 'created': 'Mon, 10 May 2021 02:26:53 GMT'}, {'version': 'v4', 'created': 'Wed, 13 Oct 2021 18:33:08 GMT'}]",2021-10-15,"[['Tsai', 'Yi-Lin', '', '1, 3, and\n  4'], ['Rastogi', 'Chetanya', '', '1, 3, and\n  4'], ['Kitanidis', 'Peter K.', '', '1, 3, and\n  4'], ['Field', 'Christopher B.', '', '3, 5, and 6']]","['deep reinforcement learning', 'multi-hazard risk mitigation and management', 'compound disaster']"
11486,1911.00093,Rise Ooi,"Rise Ooi, Takeshi Iwashita, Takeshi Fukaya, Akihiro Ida, Rio Yokota","Effect of Mixed Precision Computing on H-Matrix Vector Multiplication in
  BEM Analysis","Accepted manuscript to International Conference on High Performance
  Computing in Asia-Pacific Region (HPCAsia2020), January 15--17, 2020,
  Fukuoka, Japan",,10.1145/3368474.3368479,,cs.MS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hierarchical Matrix (H-matrix) is an approximation technique which splits a
target dense matrix into multiple submatrices, and where a selected portion of
submatrices are low-rank approximated. The technique substantially reduces both
time and space complexity of dense matrix vector multiplication, and hence has
been applied to numerous practical problems.
  In this paper, we aim to accelerate the H-matrix vector multiplication by
introducing mixed precision computing, where we employ both binary64 (FP64) and
binary32 (FP32) arithmetic operations. We propose three methods to introduce
mixed precision computing to H-matrix vector multiplication, and then evaluate
them in a boundary element method (BEM) analysis. The numerical tests examine
the effects of mixed precision computing, particularly on the required
simulation time and rate of convergence of the iterative (BiCG-STAB) linear
solver. We confirm the effectiveness of the proposed methods.
","[{'version': 'v1', 'created': 'Wed, 30 Oct 2019 04:07:52 GMT'}]",2019-11-04,"[['Ooi', 'Rise', ''], ['Iwashita', 'Takeshi', ''], ['Fukaya', 'Takeshi', ''], ['Ida', 'Akihiro', ''], ['Yokota', 'Rio', '']]","['mixed precision computing', 'linear solver', 'hierarchical matrix']"
11487,1910.03213,Wojciech Michal Matkowski,"Wojciech Michal Matkowski, Frodo Kin Sun Chan, Adams Wai Kin Kong",A Study on Wrist Identification for Forensic Investigation,,"Image and Vision Computing, vol. 88, August 2019, pp 96-112",10.1016/j.imavis.2019.05.005,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Criminal and victim identification based on crime scene images is an
important part of forensic investigation. Criminals usually avoid
identification by covering their faces and tattoos in the evidence images,
which are taken in uncontrolled environments. Existing identification methods,
which make use of biometric traits, such as vein, skin mark, height, skin
color, weight, race, etc., are considered for solving this problem. The soft
biometric traits, including skin color, gender, height, weight and race,
provide useful information but not distinctive enough. Veins and skin marks are
limited to high resolution images and some body sites may neither have enough
skin marks nor clear veins. Terrorists and rioters tend to expose their wrists
in a gesture of triumph, greeting or salute, while paedophiles usually show
them when touching victims. However, wrists were neglected by the biometric
community for forensic applications. In this paper, a wrist identification
algorithm, which includes skin segmentation, key point localization, image to
template alignment, large feature set extraction, and classification, is
proposed. The proposed algorithm is evaluated on NTU-Wrist-Image-Database-v1,
which consists of 3945 images from 731 different wrists, including 205 pairs of
wrist images collected from the Internet, taken under uneven illuminations with
different poses and resolutions. The experimental results show that wrist is a
useful clue for criminal and victim identification. Keywords: biometrics,
criminal and victim identification, forensics, wrist.
","[{'version': 'v1', 'created': 'Tue, 8 Oct 2019 05:04:11 GMT'}]",2019-10-09,"[['Matkowski', 'Wojciech Michal', ''], ['Chan', 'Frodo Kin Sun', ''], ['Kong', 'Adams Wai Kin', '']]","['biometrics', 'criminal and victim identification', 'forensics', 'wrist']"
11488,2205.02902,Rambod Mojgani,Rambod Mojgani and Maciej Balajewicz and Pedram Hassanzadeh,"Lagrangian PINNs: A causality-conforming solution to failure modes of
  physics-informed neural networks","15 pages, 12 figures",,10.1016/j.cma.2022.115810,,cs.LG cs.CE cs.NA math.NA physics.comp-ph stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Physics-informed neural networks (PINNs) leverage neural-networks to find the
solutions of partial differential equation (PDE)-constrained optimization
problems with initial conditions and boundary conditions as soft constraints.
These soft constraints are often considered to be the sources of the complexity
in the training phase of PINNs. Here, we demonstrate that the challenge of
training (i) persists even when the boundary conditions are strictly enforced,
and (ii) is closely related to the Kolmogorov n-width associated with problems
demonstrating transport, convection, traveling waves, or moving fronts. Given
this realization, we describe the mechanism underlying the training schemes
such as those used in eXtended PINNs (XPINN), curriculum regularization, and
sequence-to-sequence learning. For an important category of PDEs, i.e.,
governed by non-linear convection-diffusion equation, we propose reformulating
PINNs on a Lagrangian frame of reference, i.e., LPINNs, as a PDE-informed
solution. A parallel architecture with two branches is proposed. One branch
solves for the state variables on the characteristics, and the second branch
solves for the low-dimensional characteristics curves. The proposed
architecture conforms to the causality innate to the convection, and leverages
the direction of travel of the information in the domain. Finally, we
demonstrate that the loss landscapes of LPINNs are less sensitive to the
so-called ""complexity"" of the problems, compared to those in the traditional
PINNs in the Eulerian framework.
","[{'version': 'v1', 'created': 'Thu, 5 May 2022 19:48:05 GMT'}]",2022-12-09,"[['Mojgani', 'Rambod', ''], ['Balajewicz', 'Maciej', ''], ['Hassanzadeh', 'Pedram', '']]","['Deep learning', 'Kolmogorov n–width', 'Partial differential equations', 'Method of characteristics', 'Lagrangian frame of reference', 'Physics-informed neural network']"
11489,2206.07680,Tailin Wu,"Tailin Wu and Qinchen Wang and Yinan Zhang and Rex Ying and Kaidi Cao
  and Rok Sosi\v{c} and Ridwan Jalali and Hassan Hamam and Marko Maucec and
  Jure Leskovec","Learning Large-scale Subsurface Simulations with a Hybrid Graph Network
  Simulator","SIGKDD 2022; 11 pages, 6 figures",,10.1145/3534678.3539045,,cs.LG physics.geo-ph,http://creativecommons.org/licenses/by/4.0/,"  Subsurface simulations use computational models to predict the flow of fluids
(e.g., oil, water, gas) through porous media. These simulations are pivotal in
industrial applications such as petroleum production, where fast and accurate
models are needed for high-stake decision making, for example, for well
placement optimization and field development planning. Classical finite
difference numerical simulators require massive computational resources to
model large-scale real-world reservoirs. Alternatively, streamline simulators
and data-driven surrogate models are computationally more efficient by relying
on approximate physics models, however they are insufficient to model complex
reservoir dynamics at scale. Here we introduce Hybrid Graph Network Simulator
(HGNS), which is a data-driven surrogate model for learning reservoir
simulations of 3D subsurface fluid flows. To model complex reservoir dynamics
at both local and global scale, HGNS consists of a subsurface graph neural
network (SGNN) to model the evolution of fluid flows, and a 3D-U-Net to model
the evolution of pressure. HGNS is able to scale to grids with millions of
cells per time step, two orders of magnitude higher than previous surrogate
models, and can accurately predict the fluid flow for tens of time steps (years
into the future). Using an industry-standard subsurface flow dataset (SPE-10)
with 1.1 million cells, we demonstrate that HGNS is able to reduce the
inference time up to 18 times compared to standard subsurface simulators, and
that it outperforms other learning-based models by reducing long-term
prediction errors by up to 21%.
","[{'version': 'v1', 'created': 'Wed, 15 Jun 2022 17:29:57 GMT'}]",2022-06-16,"[['Wu', 'Tailin', ''], ['Wang', 'Qinchen', ''], ['Zhang', 'Yinan', ''], ['Ying', 'Rex', ''], ['Cao', 'Kaidi', ''], ['Sosič', 'Rok', ''], ['Jalali', 'Ridwan', ''], ['Hamam', 'Hassan', ''], ['Maucec', 'Marko', ''], ['Leskovec', 'Jure', '']]","['subsurface simulations', 'hybrid graph neural network', 'multi-scale', 'large-scale']"
11490,2106.04735,Ashwin Kallingal Joshy,"Ashwin Kallingal Joshy, Xueyuan Chen, Benjamin Steenhoek and Wei Le",Validating Static Warnings via Testing Code Fragments,"In Proceedings of the 30th ACM SIGSOFT International Symposium on
  Software Testing and Analysis July 11 to 17, 2021, Denmark. 13 pages",,10.1145/3460319.3464832,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Static analysis is an important approach for finding bugs and vulnerabilities
in software. However, inspecting and confirming static warnings are challenging
and time-consuming. In this paper, we present a novel solution that
automatically generates test cases based on static warnings to validate true
and false positives. We designed a syntactic patching algorithm that can
generate syntactically valid, semantic preserving executable code fragments
from static warnings. We developed a build and testing system to automatically
test code fragments using fuzzers, KLEE and Valgrind. We evaluated our
techniques using 12 real-world C projects and 1955 warnings from two commercial
static analysis tools. We successfully built 68.5% code fragments and generated
1003 test cases. Through automatic testing, we identified 48 true positives and
27 false positives, and 205 likely false positives. We matched 4 CVE and
real-world bugs using Helium, and they are only triggered by our tool but not
other baseline tools. We found that testing code fragments is scalable and
useful; it can trigger bugs that testing entire programs or testing procedures
failed to trigger.
","[{'version': 'v1', 'created': 'Tue, 8 Jun 2021 23:44:58 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Jun 2021 03:14:16 GMT'}, {'version': 'v3', 'created': 'Mon, 28 Jun 2021 22:07:48 GMT'}]",2021-06-30,"[['Joshy', 'Ashwin Kallingal', ''], ['Chen', 'Xueyuan', ''], ['Steenhoek', 'Benjamin', ''], ['Le', 'Wei', '']]","['Code Fragments', 'Syntactic Patching', 'Testing Static Warnings']"
11491,2106.08557,Hidetoshi Matsuo,"Hidetoshi Matsuo (1), Mizuho Nishio (1), Munenobu Nogami (1), Feibi
  Zeng (1), Takako Kurimoto (2), Sandeep Kaushik (3), Florian Wiesinger (3),
  Atsushi K Kono (1), and Takamichi Murakami (1) ((1) Department of Radiology,
  Kobe University Graduate School of Medicine, Kobe, Japan, (2) GE Healthcare,
  Hino, Japan and (3) GE Healthcare, Munich, Germany)","Unsupervised-learning-based method for chest MRI-CT transformation using
  structure constrained unsupervised generative attention networks","27 pages, 12 figures","Sci Rep 12, 11090 (2022)",10.1038/s41598-022-14677-x,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The integrated positron emission tomography/magnetic resonance imaging
(PET/MRI) scanner facilitates the simultaneous acquisition of metabolic
information via PET and morphological information with high soft-tissue
contrast using MRI. Although PET/MRI facilitates the capture of high-accuracy
fusion images, its major drawback can be attributed to the difficulty
encountered when performing attenuation correction, which is necessary for
quantitative PET evaluation. The combined PET/MRI scanning requires the
generation of attenuation-correction maps from MRI owing to no direct
relationship between the gamma-ray attenuation information and MRIs. While
MRI-based bone-tissue segmentation can be readily performed for the head and
pelvis regions, the realization of accurate bone segmentation via chest CT
generation remains a challenging task. This can be attributed to the
respiratory and cardiac motions occurring in the chest as well as its
anatomically complicated structure and relatively thin bone cortex. This paper
presents a means to minimise the anatomical structural changes without human
annotation by adding structural constraints using a modality-independent
neighbourhood descriptor (MIND) to a generative adversarial network (GAN) that
can transform unpaired images. The results obtained in this study revealed the
proposed U-GAT-IT + MIND approach to outperform all other competing approaches.
The findings of this study hint towards possibility of synthesising clinically
acceptable CT images from chest MRI without human annotation, thereby
minimising the changes in the anatomical structure.
","[{'version': 'v1', 'created': 'Wed, 16 Jun 2021 05:22:27 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Aug 2022 01:29:25 GMT'}]",2022-08-08,"[['Matsuo', 'Hidetoshi', ''], ['Nishio', 'Mizuho', ''], ['Nogami', 'Munenobu', ''], ['Zeng', 'Feibi', ''], ['Kurimoto', 'Takako', ''], ['Kaushik', 'Sandeep', ''], ['Wiesinger', 'Florian', ''], ['Kono', 'Atsushi K', ''], ['Murakami', 'Takamichi', '']]","['Unsupervised learning', 'Deep learning', 'U-GAT-IT', 'MIND', 'Chest MRI–CT transformation', 'PET/MRI']"
11492,1910.06969,Zeki Seskir,"Zeki C. Seskir, Arsev U. Aydinoglu",The Landscape of Academic Literature in Quantum Technologies,"32 pages, 10 figures, draft version of a working paper",,10.1142/S021974992150012X,,cs.DL physics.soc-ph quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, we investigated the academic literature on quantum
technologies (QT) using bibliometric tools. We used a set of 49,823 articles
obtained from the Web of Science (WoS) database using a search query
constructed through expert opinion. Analysis of this revealed that QT is deeply
rooted in physics, and the majority of the articles are published in physics
journals. Keyword analysis revealed that the literature could be clustered into
three distinct sets, which are (i) quantum communication/cryptography, (ii)
quantum computation, and (iii) physical realizations of quantum systems. We
performed a burst analysis that showed the emergence and fading away of certain
key concepts in the literature. This is followed by co-citation analysis on the
highly cited articles provided by the WoS, using these we devised a set of core
corpus of 34 publications. Comparing the most highly cited articles in this set
with respect to the initial set we found that there is a clear difference in
most cited subjects. Finally, we performed co-citation analyses on country and
organization levels to find the central nodes in the literature. Overall, the
analyses of the datasets allowed us to cluster the literature into three
distinct sets, construct the core corpus of the academic literature in QT, and
to identify the key players on country and organization levels, thus offering
insight into the current state of the field. Search queries and access to
figures are provided in the appendix.
","[{'version': 'v1', 'created': 'Tue, 15 Oct 2019 16:26:03 GMT'}, {'version': 'v2', 'created': 'Thu, 14 May 2020 15:33:29 GMT'}]",2021-05-12,"[['Seskir', 'Zeki C.', ''], ['Aydinoglu', 'Arsev U.', '']]","['\u200bquantum technologies', 'bibliometrics', 'quantum information', 'clustering', 'keyword analysis']"
11493,2112.01771,Junming Cao,"Junming Cao, Bihuan Chen, Chao Sun, Longjie Hu, Shuaihong Wu, Xin Peng",Understanding Performance Problems in Deep Learning Systems,Has been accepted by ESEC/FSE 2022,,10.1145/3540250.3549123,,cs.SE cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Deep learning (DL) has been widely applied to many domains. Unique challenges
in engineering DL systems are posed by the programming paradigm shift from
traditional systems to DL systems, and performance is one of the challenges.
Performance problems (PPs) in DL systems can cause severe consequences such as
excessive resource consumption and financial loss. While bugs in DL systems
have been extensively investigated, PPs in DL systems have hardly been
explored. To bridge this gap, we present the first comprehensive study to i)
characterize symptoms, root causes, and introducing and exposing stages of PPs
in DL systems developed in TensorFLow and Keras, with 224 PPs collected from
210 StackOverflow posts, and to ii) assess the capability of existing
performance analysis approaches in tackling PPs, with a constructed benchmark
of 58 PPs in DL systems. Our findings shed light on the implications on
developing high-performance DL systems, and detecting and localizing PPs in DL
systems. To demonstrate the usefulness of our findings, we develop a static
checker Deep-Perf to detect three types of PPs. It has detected 488 new PPs in
130 GitHub projects. 105 and 27 PPs have been confirmed and fixed.
","[{'version': 'v1', 'created': 'Fri, 3 Dec 2021 08:08:52 GMT'}, {'version': 'v2', 'created': 'Sat, 29 Oct 2022 13:13:38 GMT'}]",2022-11-01,"[['Cao', 'Junming', ''], ['Chen', 'Bihuan', ''], ['Sun', 'Chao', ''], ['Hu', 'Longjie', ''], ['Wu', 'Shuaihong', ''], ['Peng', 'Xin', '']]","['performance problems', 'deep learning', 'performance analysis']"
11494,2010.03165,Ayushi Rastogi,"Hennie Huijgens, Ayushi Rastogi, Ernst Mulders, Georgios Gousios, Arie
  van Deursen",Questions for Data Scientists in Software Engineering: A Replication,,,10.1145/3368089.3409717,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 2014, a Microsoft study investigated the sort of questions that data
science applied to software engineering should answer. This resulted in 145
questions that developers considered relevant for data scientists to answer,
thus providing a research agenda to the community. Fast forward to five years,
no further studies investigated whether the questions from the software
engineers at Microsoft hold for other software companies, including
software-intensive companies with different primary focus (to which we refer as
software-defined enterprises). Furthermore, it is not evident that the problems
identified five years ago are still applicable, given the technological
advances in software engineering.
","[{'version': 'v1', 'created': 'Wed, 7 Oct 2020 05:03:30 GMT'}, {'version': 'v2', 'created': 'Sat, 31 Oct 2020 18:47:09 GMT'}, {'version': 'v3', 'created': 'Mon, 4 Jan 2021 19:39:22 GMT'}]",2021-01-06,"[['Huijgens', 'Hennie', ''], ['Rastogi', 'Ayushi', ''], ['Mulders', 'Ernst', ''], ['Gousios', 'Georgios', ''], ['van Deursen', 'Arie', '']]","['Data Science', 'Software Engineering', 'Software Analytics']"
11495,2008.10874,Lixin Su,"Lixin Su, Jiafeng Guo, Ruqing Zhang, Yixing Fan, Yanyan Lan, Xueqi
  Cheng",Continual Domain Adaptation for Machine Reading Comprehension,Accepted by CIKM 2020,,10.1145/3340531.3412047,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine reading comprehension (MRC) has become a core component in a variety
of natural language processing (NLP) applications such as question answering
and dialogue systems. It becomes a practical challenge that an MRC model needs
to learn in non-stationary environments, in which the underlying data
distribution changes over time. A typical scenario is the domain drift, i.e.
different domains of data come one after another, where the MRC model is
required to adapt to the new domain while maintaining previously learned
ability. To tackle such a challenge, in this work, we introduce the
\textit{Continual Domain Adaptation} (CDA) task for MRC. So far as we know,
this is the first study on the continual learning perspective of MRC. We build
two benchmark datasets for the CDA task, by re-organizing existing MRC
collections into different domains with respect to context type and question
type, respectively. We then analyze and observe the catastrophic forgetting
(CF) phenomenon of MRC under the CDA setting. To tackle the CDA task, we
propose several BERT-based continual learning MRC models using either
regularization-based methodology or dynamic-architecture paradigm. We analyze
the performance of different continual learning MRC models under the CDA task
and show that the proposed dynamic-architecture based model achieves the best
performance.
","[{'version': 'v1', 'created': 'Tue, 25 Aug 2020 08:22:22 GMT'}]",2020-08-26,"[['Su', 'Lixin', ''], ['Guo', 'Jiafeng', ''], ['Zhang', 'Ruqing', ''], ['Fan', 'Yixing', ''], ['Lan', 'Yanyan', ''], ['Cheng', 'Xueqi', '']]","['Machine Reading Comprehension', 'Continual Domain Adaptation', 'Dynamic Network']"
11496,2201.08184,Jianxi Luo,Jianxi Luo,Data-Driven Innovation: What Is It,,"IEEE Transactions on Engineering Management, 2022",10.1109/TEM.2022.3145231,,cs.CY cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The future of innovation processes is anticipated to be more data-driven and
empowered by the ubiquitous digitalization, increasing data accessibility and
rapid advances in machine learning, artificial intelligence, and computing
technologies. While the data-driven innovation (DDI) paradigm is emerging, it
has yet been formally defined and theorized and often confused with several
other data-related phenomena. This paper defines and crystalizes ""data-driven
innovation"" as a formal innovation process paradigm, dissects its value
creation, and distinguishes it from data-driven optimization (DDO), data-based
innovation (DBI), and the traditional innovation processes that purely rely on
human intelligence. With real-world examples and theoretical framing, I
elucidate what DDI entails and how it addresses uncertainty and enhance
creativity in the innovation process and present a process-based taxonomy of
different data-driven innovation approaches. On this basis, I recommend the
strategies and actions for innovators, companies, R&D organizations, and
governments to enact data-driven innovation.
","[{'version': 'v1', 'created': 'Wed, 19 Jan 2022 18:04:22 GMT'}, {'version': 'v2', 'created': 'Sat, 22 Jan 2022 00:51:29 GMT'}, {'version': 'v3', 'created': 'Thu, 7 Jul 2022 09:34:39 GMT'}]",2022-07-08,"[['Luo', 'Jianxi', '']]","['Innovation Process', 'Uncertainty', 'Creativity', 'Data Science', 'Machine']"
11497,1905.10895,Serguei Popov,Serguei Popov and William J Buchanan,FPC-BI: Fast Probabilistic Consensus within Byzantine Infrastructures,"30 pages, 4 figures; final version","Journal of Parallel and Distributed Computing, Volume 147, January
  2021, pages 77-86",10.1016/j.jpdc.2020.09.002,,cs.DC math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel leaderless protocol (FPC-BI: Fast Probabilistic
Consensus within Byzantine Infrastructures) with a low communicational
complexity and which allows a set of nodes to come to a consensus on a value of
a single bit. The paper makes the assumption that part of the nodes are
Byzantine, and are thus controlled by an adversary who intends to either delay
the consensus, or break it (this defines that at least a couple of honest nodes
come to different conclusions). We prove that, nevertheless, the protocol works
with high probability when its parameters are suitably chosen. Along this the
paper also provides explicit estimates on the probability that the protocol
finalizes in the consensus state in a given time. This protocol could be
applied to reaching consensus in decentralized cryptocurrency systems. A
special feature of it is that it makes use of a sequence of random numbers
which are either provided by a trusted source or generated by the nodes
themselves using some decentralized random number generating protocol. This
increases the overall trustworthiness of the infrastructure. A core
contribution of the paper is that it uses a very weak consensus to obtain a
strong consensus on the value of a bit, and which can relate to the validity of
a transaction.
","[{'version': 'v1', 'created': 'Sun, 26 May 2019 22:14:10 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Jul 2019 20:10:38 GMT'}, {'version': 'v3', 'created': 'Sun, 13 Sep 2020 08:22:53 GMT'}]",2020-09-15,"[['Popov', 'Serguei', ''], ['Buchanan', 'William J', '']]","['voting', 'consensus', 'decentralized randomness', 'decentralizedcryptocurrency systems']"
11498,2209.07025,Hung-Jui Guo,"Hung-Jui Guo, Jonathan Z. Bakdash, Laura R. Marusich and Balakrishnan
  Prabhakaran",Dynamic X-Ray Vision in Mixed Reality,,,10.1145/3562939.3565675,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  X-ray vision, a technique that allows users to see through walls and other
obstacles, is a popular technique for Augmented Reality (AR) and Mixed Reality
(MR). In this paper, we demonstrate a dynamic X-ray vision window that is
rendered in real-time based on the user's current position and changes with
movement in the physical environment. Moreover, the location and transparency
of the window are also dynamically rendered based on the user's eye gaze. We
build this X-ray vision window for a current state-of-the-art MR Head-Mounted
Device (HMD) -- HoloLens 2 by integrating several different features: scene
understanding, eye tracking, and clipping primitive.
","[{'version': 'v1', 'created': 'Thu, 15 Sep 2022 03:32:10 GMT'}]",2022-11-01,"[['Guo', 'Hung-Jui', ''], ['Bakdash', 'Jonathan Z.', ''], ['Marusich', 'Laura R.', ''], ['Prabhakaran', 'Balakrishnan', '']]","['X-ray vision', 'HoloLens', 'Mixed Reality']"
11499,2207.07216,Diab Abueidda,Junyan He and Diab Abueidda and Seid Koric and Iwona Jasiuk,"On the use of graph neural networks and shape-function-based gradient
  computation in the deep energy method",,,10.1002/nme.7146,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  A graph neural network (GCN) is employed in the deep energy method (DEM)
model to solve the momentum balance equation in 3D for the deformation of
linear elastic and hyperelastic materials due to its ability to handle
irregular domains over the traditional DEM method based on a multilayer
perceptron (MLP) network. Its accuracy and solution time are compared to the
DEM model based on a MLP network. We demonstrate that the GCN-based model
delivers similar accuracy while having a shorter run time through numerical
examples. Two different spatial gradient computation techniques, one based on
automatic differentiation (AD) and the other based on shape function (SF)
gradients, are also accessed. We provide a simple example to demonstrate the
strain localization instability associated with the AD-based gradient
computation and show that the instability exists in more general cases by four
numerical examples. The SF-based gradient computation is shown to be more
robust and delivers an accurate solution even at severe deformations.
Therefore, the combination of the GCN-based DEM model and SF-based gradient
computation is potentially a promising candidate for solving problems involving
severe material and geometric nonlinearities.
","[{'version': 'v1', 'created': 'Thu, 14 Jul 2022 21:53:01 GMT'}]",2022-10-21,"[['He', 'Junyan', ''], ['Abueidda', 'Diab', ''], ['Koric', 'Seid', ''], ['Jasiuk', 'Iwona', '']]","['Automatic differentiation', 'Elasticity', 'Hyperelasticity', 'Partial differential equations', 'Physics-informed neural networks']"
11500,2101.09028,Yitian Yuan,"Yitian Yuan, Xiaohan Lan, Xin Wang, Long Chen, Zhi Wang, Wenwu Zhu","A Closer Look at Temporal Sentence Grounding in Videos: Dataset and
  Metric",,,10.1145/3475723.3484247,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Temporal Sentence Grounding in Videos (TSGV), i.e., grounding a natural
language sentence which indicates complex human activities in a long and
untrimmed video sequence, has received unprecedented attentions over the last
few years. Although each newly proposed method plausibly can achieve better
performance than previous ones, current TSGV models still tend to capture the
moment annotation biases and fail to take full advantage of multi-modal inputs.
Even more incredibly, several extremely simple baselines without training can
also achieve state-of-the-art performance. In this paper, we take a closer look
at the existing evaluation protocols for TSGV, and find that both the
prevailing dataset splits and evaluation metrics are the devils to cause
unreliable benchmarking. To this end, we propose to re-organize two widely-used
TSGV benchmarks (ActivityNet Captions and Charades-STA). Specifically, we
deliberately make the ground-truth moment distribution different in the
training and test splits, i.e., out-of-distribution (OOD) testing. Meanwhile,
we introduce a new evaluation metric dR@n,IoU@m to calibrate the basic IoU
scores by penalizing on the bias-influenced moment predictions and alleviate
the inflating evaluations caused by the dataset annotation biases such as
overlong ground-truth moments. Under our new evaluation protocol, we conduct
extensive experiments and ablation studies on eight state-of-the-art TSGV
methods. All the results demonstrate that the re-organized dataset splits and
new metric can better monitor the progress in TSGV. Our reorganized datsets are
available at https://github.com/yytzsy/grounding_changing_distribution.
","[{'version': 'v1', 'created': 'Fri, 22 Jan 2021 09:59:30 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Jan 2021 07:19:07 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Sep 2021 05:06:17 GMT'}]",2021-09-23,"[['Yuan', 'Yitian', ''], ['Lan', 'Xiaohan', ''], ['Wang', 'Xin', ''], ['Chen', 'Long', ''], ['Wang', 'Zhi', ''], ['Zhu', 'Wenwu', '']]","['temporal sentence grounding in videos', 'dataset bias', 'evaluationmetric', 'dataset re-splitting', 'out-of-distribution testing']"
11501,2006.03736,Aravind Sankar,"Aravind Sankar, Yanhong Wu, Yuhang Wu, Wei Zhang, Hao Yang, Hari
  Sundaram","GroupIM: A Mutual Information Maximization Framework for Neural Group
  Recommendation",SIGIR 2020,,10.1145/3397271.3401116,,cs.IR cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of making item recommendations to ephemeral groups,
which comprise users with limited or no historical activities together.
Existing studies target persistent groups with substantial activity history,
while ephemeral groups lack historical interactions. To overcome group
interaction sparsity, we propose data-driven regularization strategies to
exploit both the preference covariance amongst users who are in the same group,
as well as the contextual relevance of users' individual preferences to each
group.
  We make two contributions. First, we present a recommender
architecture-agnostic framework GroupIM that can integrate arbitrary neural
preference encoders and aggregators for ephemeral group recommendation. Second,
we regularize the user-group latent space to overcome group interaction
sparsity by: maximizing mutual information between representations of groups
and group members; and dynamically prioritizing the preferences of highly
informative members through contextual preference weighting. Our experimental
results on several real-world datasets indicate significant performance
improvements (31-62% relative NDCG@20) over state-of-the-art group
recommendation techniques.
","[{'version': 'v1', 'created': 'Fri, 5 Jun 2020 23:18:19 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Jun 2020 03:13:09 GMT'}]",2021-01-05,"[['Sankar', 'Aravind', ''], ['Wu', 'Yanhong', ''], ['Wu', 'Yuhang', ''], ['Zhang', 'Wei', ''], ['Yang', 'Hao', ''], ['Sundaram', 'Hari', '']]","['Group Recommendation', 'Neural Collaborative Filtering', 'MutualInformation', 'Representation Learning', 'Data Sparsity']"
11502,1401.2731,"J\""urgen M\""unch","Ansgar Lamersdorf, J\""urgen M\""unch, Alicia Fern\'andez-del Viso
  Torre, Carlos Rebate S\'anchez, Markus Heinz, Dieter Rombach","A Rule-based Model for Customized Risk Identification in Distributed
  Software Development Projects","10 pages. The final publication is available at
  http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=5581511","Proceedings of the IEEE International Conference on Global
  Software Engineering (ICGSE 2010), Princeton, USA, August 23-26 2010",10.1109/ICGSE.2010.32,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many project risks in distributed software development are very different
from the ones in collocated development and therefore are often overlooked. At
the same time, they depend to a large extent on project-specific
characteristics. This article presents a model for identifying risks early in a
project. This model systematically captures experiences from past projects and
is based on a set of logical rules describing how project characteristics
influence typical risks in distributed development. Thus, the model is able to
assess risks individually for each project. It was developed by applying
qualitative content analysis to 19 interviews with practitioners. An evaluation
using expert interviews showed that the risks identified by the model matched
the actual experiences in 81% of the cases; of these, 40% have not been
regarded yet at project start. The article describes the concepts of the model,
its instantiation and evaluation, followed by a conclusion and future work.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2014 07:17:20 GMT'}]",2014-01-14,"[['Lamersdorf', 'Ansgar', ''], ['Münch', 'Jürgen', ''], ['Torre', 'Alicia Fernández-del Viso', ''], ['Sánchez', 'Carlos Rebate', ''], ['Heinz', 'Markus', ''], ['Rombach', 'Dieter', '']]","['Global software development', 'task allocation', 'risk']"
11503,2208.10705,Jinghui Cheng,"Banafsheh Mohajeri, Jinghui Cheng","""Inconsistent Performance"": Understanding Concerns of Real-World Users
  on Smart Mobile Health Applications Through Analyzing App Reviews","4 pages, UIST2022 Poster",,10.1145/3526114.3558698,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While smart mobile health apps that adapt to users' progressive individual
needs are proliferating, many of them struggle to fulfill their promises due to
an inferior user experience. Understanding the concerns of real-world users
related to those apps, and their smart components in particular, could help
advance the app design to attract and retain users. In this paper, we target
this issue through a preliminary thematic analysis of 120 user reviews of six
smart health apps. We found that accuracy, customizability, and convenience of
data input are primary concerns raised in real-world user reviews. Many
concerns on the smart components are related to the trust issue of the users
towards the apps. However, several important aspects such as privacy and
fairness were rarely discussed in the reviews. Overall, our study provides
insights that can inspire further investigations to support the design of smart
mobile health apps.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2022 03:12:20 GMT'}]",2022-08-24,"[['Mohajeri', 'Banafsheh', ''], ['Cheng', 'Jinghui', '']]","['Mobile health', 'smart component', 'app review']"
11504,2206.12706,Moshe Sipper,Moshe Sipper,"Binary and Multinomial Classification through Evolutionary Symbolic
  Regression",,"Proceedings of 2022 Genetic and Evolutionary Computation
  Conference Companion",10.1145/3520304.3528922,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present three evolutionary symbolic regression-based classification
algorithms for binary and multinomial datasets: GPLearnClf, CartesianClf, and
ClaSyCo. Tested over 162 datasets and compared to three state-of-the-art
machine learning algorithms -- XGBoost, LightGBM, and a deep neural network --
we find our algorithms to be competitive. Further, we demonstrate how to find
the best method for one's dataset automatically, through the use of a
state-of-the-art hyperparameter optimizer.
","[{'version': 'v1', 'created': 'Sat, 25 Jun 2022 18:38:40 GMT'}]",2022-06-29,"[['Sipper', 'Moshe', '']]","['classification', 'genetic programming', 'symbolic regression']"
11505,1905.13134,Meike Zehlike,"Meike Zehlike, Tom S\""uhr, Carlos Castillo and Ivan Kitanovski",FairSearch: A Tool For Fairness in Ranked Search Results,"4 pages, demo paper","Companion Proceedings of the Web Conference 2020 (WWW '20
  Companion), April 20--24, 2020, Taipei, Taiwan",10.1145/3366424.3383534,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ranked search results and recommendations have become the main mechanism by
which we find content, products, places, and people online. With hiring,
selecting, purchasing, and dating being increasingly mediated by algorithms,
rankings may determine career and business opportunities, educational
placement, access to benefits, and even social and reproductive success. It is
therefore of societal and ethical importance to ask whether search results can
demote, marginalize, or exclude individuals of unprivileged groups or promote
products with undesired features. In this paper we present FairSearch, the
first fair open source search API to provide fairness notions in ranked search
results. We implement two algorithms from the fair ranking literature, namely
FA*IR (Zehlike et al., 2017) and DELTR (Zehlike and Castillo, 2018) and provide
them as stand-alone libraries in Python and Java. Additionally we implement
interfaces to Elasticsearch for both algorithms, that use the aforementioned
Java libraries and are then provided as Elasticsearch plugins. Elasticsearch is
a well-known search engine API based on Apache Lucene. With our plugins we
enable search engine developers who wish to ensure fair search results of
different styles to easily integrate DELTR and FA*IR into their existing
Elasticsearch environment.
","[{'version': 'v1', 'created': 'Mon, 27 May 2019 19:59:45 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Apr 2020 08:52:55 GMT'}]",2020-04-24,"[['Zehlike', 'Meike', ''], ['Sühr', 'Tom', ''], ['Castillo', 'Carlos', ''], ['Kitanovski', 'Ivan', '']]","['Ranking', 'Algorithmic Fairness', 'Disparate Impact']"
11506,1906.02533,Xiaoxing Ma,"Zenan Li, Xiaoxing Ma, Chang Xu, Chun Cao, Jingwei Xu, Jian L\""u",Boosting Operational DNN Testing Efficiency through Conditioning,"Published in the Proceedings of the 27th ACM Joint European Software
  Engineering Conference and Symposium on the Foundations of Software
  Engineering (ESEC/FSE 2019)",,10.1145/3338906.3338930,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the increasing adoption of Deep Neural Network (DNN) models as integral
parts of software systems, efficient operational testing of DNNs is much in
demand to ensure these models' actual performance in field conditions. A
challenge is that the testing often needs to produce precise results with a
very limited budget for labeling data collected in field.
  Viewing software testing as a practice of reliability estimation through
statistical sampling, we re-interpret the idea behind conventional structural
coverages as conditioning for variance reduction. With this insight we propose
an efficient DNN testing method based on the conditioning on the representation
learned by the DNN model under testing. The representation is defined by the
probability distribution of the output of neurons in the last hidden layer of
the model. To sample from this high dimensional distribution in which the
operational data are sparsely distributed, we design an algorithm leveraging
cross entropy minimization.
  Experiments with various DNN models and datasets were conducted to evaluate
the general efficiency of the approach. The results show that, compared with
simple random sampling, this approach requires only about a half of labeled
inputs to achieve the same level of precision.
","[{'version': 'v1', 'created': 'Thu, 6 Jun 2019 11:47:08 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Jun 2019 09:58:21 GMT'}]",2019-06-28,"[['Li', 'Zenan', ''], ['Ma', 'Xiaoxing', ''], ['Xu', 'Chang', ''], ['Cao', 'Chun', ''], ['Xu', 'Jingwei', ''], ['Lü', 'Jian', '']]","['Software testing', 'Neural networks', 'Coverage criteria']"
11507,2301.09545,Jesse Josua Benjamin,"Jesse Josua Benjamin, Heidi Biggs, Arne Berger, Julija Rukanskait\.e,
  Michael Heidt, Nick Merrill, James Pierce, Joseph Lindley","The Entoptic Field Camera as Metaphor-Driven Research-through-Design
  with AI Technologies","To be published in Proceedings of the 2023 CHI Conference on Human
  Factors in Computing Systems (CHI '23), April 23--28, 2023, Hamburg, Germany",,10.1145/3544548.3581175,,cs.HC cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Artificial intelligence (AI) technologies are widely deployed in smartphone
photography; and prompt-based image synthesis models have rapidly become
commonplace. In this paper, we describe a Research-through-Design (RtD) project
which explores this shift in the means and modes of image production via the
creation and use of the Entoptic Field Camera. Entoptic phenomena usually refer
to perceptions of floaters or bright blue dots stemming from the physiological
interplay of the eye and brain. We use the term entoptic as a metaphor to
investigate how the material interplay of data and models in AI technologies
shapes human experiences of reality. Through our case study using first-person
design and a field study, we offer implications for critical, reflective,
more-than-human and ludic design to engage AI technologies; the
conceptualisation of an RtD research space which contributes to AI literacy
discourses; and outline a research trajectory concerning materiality and design
affordances of AI technologies.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2023 17:03:54 GMT'}]",2023-01-24,"[['Benjamin', 'Jesse Josua', ''], ['Biggs', 'Heidi', ''], ['Berger', 'Arne', ''], ['Rukanskaitė', 'Julija', ''], ['Heidt', 'Michael', ''], ['Merrill', 'Nick', ''], ['Pierce', 'James', ''], ['Lindley', 'Joseph', '']]","['research through design', 'artificial intelligence', 'materiality', 'GAN', 'image synthesis', 'technological mediation']"
11508,2205.12512,Akila Ayanthi,D. M. A. Ayanthi and Sarasi Munasinghe,Text-to-Face Generation with StyleGAN2,"16 pages, 5 figures, for conference,
  https://aircconline.com/csit/papers/vol12/csit120805.pdf","David C. Wyld et al. (Eds): FCST, CMIT, SE, SIPM, SAIM, SNLP -
  2022pp. 49-64, 2022. CS & IT - CSCP 2022 May 21~22, 2022, Zurich, Switzerland",10.5121/csit.2022.120805,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Synthesizing images from text descriptions has become an active research area
with the advent of Generative Adversarial Networks. The main goal here is to
generate photo-realistic images that are aligned with the input descriptions.
Text-to-Face generation (T2F) is a sub-domain of Text-to-Image generation (T2I)
that is more challenging due to the complexity and variation of facial
attributes. It has a number of applications mainly in the domain of public
safety. Even though several models are available for T2F, there is still the
need to improve the image quality and the semantic alignment. In this research,
we propose a novel framework, to generate facial images that are well-aligned
with the input descriptions. Our framework utilizes the high-resolution face
generator, StyleGAN2, and explores the possibility of using it in T2F. Here, we
embed text in the input latent space of StyleGAN2 using BERT embeddings and
oversee the generation of facial images using text descriptions. We trained our
framework on attribute-based descriptions to generate images of 1024x1024 in
resolution. The images generated exhibit a 57% similarity to the ground truth
images, with a face semantic distance of 0.92, outperforming
state-of-the-artwork. The generated images have a FID score of 118.097 and the
experimental results show that our model generates promising images.
","[{'version': 'v1', 'created': 'Wed, 25 May 2022 06:02:01 GMT'}]",2022-05-26,"[['Ayanthi', 'D. M. A.', ''], ['Munasinghe', 'Sarasi', '']]","['Text-to-Face Generation', 'StyleGAN2', 'High-Resolution', 'Semantic Alignment', 'Perceptual Loss']"
11509,2212.06956,Brae Webb,"Brae J. Webb, Ian J. Hayes, Mark Utting",Verifying term graph optimizations using Isabelle/HOL,"14 pages, 7 figures, to be published in CPP2023",,10.1145/3573105.3575673,,cs.PL cs.LO,http://creativecommons.org/licenses/by/4.0/,"  Our objective is to formally verify the correctness of the hundreds of
expression optimization rules used within the GraalVM compiler. When defining
the semantics of a programming language, expressions naturally form abstract
syntax trees, or, terms. However, in order to facilitate sharing of common
subexpressions, modern compilers represent expressions as term graphs. Defining
the semantics of term graphs is more complicated than defining the semantics of
their equivalent term representations. More significantly, defining
optimizations directly on term graphs and proving semantics preservation is
considerably more complicated than on the equivalent term representations. On
terms, optimizations can be expressed as conditional term rewriting rules, and
proofs that the rewrites are semantics preserving are relatively
straightforward. In this paper, we explore an approach to using term rewrites
to verify term graph transformations of optimizations within the GraalVM
compiler. This approach significantly reduces the overall verification effort
and allows for simpler encoding of optimization rules.
","[{'version': 'v1', 'created': 'Wed, 14 Dec 2022 00:25:54 GMT'}]",2022-12-15,"[['Webb', 'Brae J.', ''], ['Hayes', 'Ian J.', ''], ['Utting', 'Mark', '']]","['verified code optimizer', 'sea-of-nodes intermediate representation', 'GraalVM compiler', 'Isabelle/HOL']"
11510,2105.13910,Tore Frederiksen,Tore Kasper Frederiksen,"A Holistic Approach to Enhanced Security and Privacy in Digital Health
  Passports","21 pages, to be published at the IWAPS workshop in connection with
  the ARES conference 2021",,10.1145/3465481.3469212,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  As governments around the world decide to deploy digital health passports as
a tool to curb the spread of Covid-19, it becomes increasingly important to
consider how these can be constructed with privacy-by-design.
  In this paper we discuss the privacy and security issues of common approaches
for constructing digital health passports. We then show how to construct, and
deploy, secure and private digital health passports, in a simple and efficient
manner. We do so by using a protocol for distributed password-based token
issuance, secret sharing and by leveraging modern smart phones' secure
hardware.
  Our solution only requires a constant amount of asymmetric cryptographic
operations and a single round of communication between the user and the party
verifying the user's digital health passport, and only two rounds between the
user and the server issuing the digital health passport.
","[{'version': 'v1', 'created': 'Fri, 28 May 2021 15:22:14 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Jun 2021 12:45:45 GMT'}]",2021-06-10,"[['Frederiksen', 'Tore Kasper', '']]","['Digital Heath Passports', 'Distributed Signatures', 'Distributed Cryptography', 'ProtocolDeployment']"
11511,1912.13387,Kasra Babaei,"Kasra Babaei, Zhi Yuan Chen, Tomas Maul","AEGR: A simple approach to gradient reversal in autoencoders for network
  anomaly detection",,,10.1007/s00500-021-06110-8,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Anomaly detection is referred to as a process in which the aim is to detect
data points that follow a different pattern from the majority of data points.
Anomaly detection methods suffer from several well-known challenges that hinder
their performance such as high dimensionality. Autoencoders are unsupervised
neural networks that have been used for the purpose of reducing dimensionality
and also detecting network anomalies in large datasets. The performance of
autoencoders debilitates when the training set contains noise and anomalies. In
this paper, a new gradient-reversal method is proposed to overcome the
influence of anomalies on the training phase for the purpose of detecting
network anomalies. The method is different from other approaches as it does not
require an anomaly-free training set and is based on reconstruction error. Once
latent variables are extracted from the network, Local Outlier Factor is used
to separate normal data points from anomalies. A simple pruning approach and
data augmentation is also added to further improve performance. The
experimental results show that the proposed model can outperform other
well-know approaches.
","[{'version': 'v1', 'created': 'Sat, 21 Dec 2019 09:24:02 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Feb 2020 22:28:56 GMT'}]",2021-08-31,"[['Babaei', 'Kasra', ''], ['Chen', 'Zhi Yuan', ''], ['Maul', 'Tomas', '']]","['network anomaly detection', 'high dimensionality', 'autoencoders (AEs)', 'Local Outlier Factor(LOF)', 'Gradient Reversal']"
11512,1905.05717,Hua Wei,"Hua Wei, Nan Xu, Huichu Zhang, Guanjie Zheng, Xinshi Zang, Chacha
  Chen, Weinan Zhang, Yanmin Zhu, Kai Xu, Zhenhui Li",CoLight: Learning Network-level Cooperation for Traffic Signal Control,"10 pages. Proceedings of the 28th ACM International on Conference on
  Information and Knowledge Management. ACM, 2018",,10.1145/3357384.3357902,,cs.MA cs.GT cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cooperation among the traffic signals enables vehicles to move through
intersections more quickly. Conventional transportation approaches implement
cooperation by pre-calculating the offsets between two intersections. Such
pre-calculated offsets are not suitable for dynamic traffic environments. To
enable cooperation of traffic signals, in this paper, we propose a model,
CoLight, which uses graph attentional networks to facilitate communication.
Specifically, for a target intersection in a network, CoLight can not only
incorporate the temporal and spatial influences of neighboring intersections to
the target intersection, but also build up index-free modeling of neighboring
intersections. To the best of our knowledge, we are the first to use graph
attentional networks in the setting of reinforcement learning for traffic
signal control and to conduct experiments on the large-scale road network with
hundreds of traffic signals. In experiments, we demonstrate that by learning
the communication, the proposed model can achieve superior performance against
the state-of-the-art methods.
","[{'version': 'v1', 'created': 'Sat, 11 May 2019 17:26:11 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Nov 2019 09:17:57 GMT'}]",2019-11-06,"[['Wei', 'Hua', ''], ['Xu', 'Nan', ''], ['Zhang', 'Huichu', ''], ['Zheng', 'Guanjie', ''], ['Zang', 'Xinshi', ''], ['Chen', 'Chacha', ''], ['Zhang', 'Weinan', ''], ['Zhu', 'Yanmin', ''], ['Xu', 'Kai', ''], ['Li', 'Zhenhui', '']]","['Deep reinforcement learning', 'traffic signal control', 'multi-agentsystem']"
11513,2107.09123,Rohit Verma,"Tanmay Jain, Avaneesh, Rohit Verma, Rajeev Shorey","Latency-Memory Optimized Splitting of Convolution Neural Networks for
  Resource Constrained Edge Devices",,,10.1109/COMSNETS53615.2022.9668356,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the increasing reliance of users on smart devices, bringing essential
computation at the edge has become a crucial requirement for any type of
business. Many such computations utilize Convolution Neural Networks (CNNs) to
perform AI tasks, having high resource and computation requirements, that are
infeasible for edge devices. Splitting the CNN architecture to perform part of
the computation on edge and remaining on the cloud is an area of research that
has seen increasing interest in the field. In this paper, we assert that
running CNNs between an edge device and the cloud is synonymous to solving a
resource-constrained optimization problem that minimizes the latency and
maximizes resource utilization at the edge. We formulate a multi-objective
optimization problem and propose the LMOS algorithm to achieve a Pareto
efficient solution. Experiments done on real-world edge devices show that, LMOS
ensures feasible execution of different CNN models at the edge and also
improves upon existing state-of-the-art approaches.
","[{'version': 'v1', 'created': 'Mon, 19 Jul 2021 19:39:56 GMT'}]",2022-01-17,"[['Jain', 'Tanmay', ''], ['Avaneesh', '', ''], ['Verma', 'Rohit', ''], ['Shorey', 'Rajeev', '']]","['edge computing', 'CNNs', 'multi-objective optimization']"
11514,2009.14600,Orestis Zachariadis,"Orestis Zachariadis, Nitin Satpute, Juan G\'omez-Luna, Joaqu\'in
  Olivares",Accelerating Sparse Matrix-Matrix Multiplication with GPU Tensor Cores,Accepted in CAEE,Comput. Electr. Eng. 88 (2020) 106848,10.1016/j.compeleceng.2020.106848,,cs.MS cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sparse general matrix-matrix multiplication (spGEMM) is an essential
component in many scientific and data analytics applications. However, the
sparsity pattern of the input matrices and the interaction of their patterns
make spGEMM challenging. Modern GPUs include Tensor Core Units (TCUs), which
specialize in dense matrix multiplication. Our aim is to re-purpose TCUs for
sparse matrices. The key idea of our spGEMM algorithm, tSparse, is to multiply
sparse rectangular blocks using the mixed precision mode of TCUs. tSparse
partitions the input matrices into tiles and operates only on tiles which
contain one or more elements. It creates a task list of the tiles, and performs
matrix multiplication of these tiles using TCUs. To the best of our knowledge,
this is the first time that TCUs are used in the context of spGEMM. We show
that spGEMM, with our tiling approach, benefits from TCUs. Our approach
significantly improves the performance of spGEMM in comparison to cuSPARSE,
CUSP, RMerge2, Nsparse, AC-SpGEMM and spECK.
","[{'version': 'v1', 'created': 'Tue, 29 Sep 2020 14:10:15 GMT'}]",2020-10-01,"[['Zachariadis', 'Orestis', ''], ['Satpute', 'Nitin', ''], ['Gómez-Luna', 'Juan', ''], ['Olivares', 'Joaquín', '']]","['Sparse Matrix Multiplication', 'GPU', 'Tensor Cores', 'Parallel Computing', 'SpGEMM']"
11515,1907.00829,Jesko Hecking-Harbusch,"Raven Beutner, Bernd Finkbeiner, Jesko Hecking-Harbusch",Translating Asynchronous Games for Distributed Synthesis (Full Version),,,10.4230/LIPIcs.CONCUR.2019.26,,cs.LO cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In distributed synthesis, we generate a set of process implementations that,
together, accomplish an objective against all possible behaviors of the
environment. A lot of recent work has focussed on systems with causal memory,
i.e., sets of asynchronous processes that exchange their causal histories upon
synchronization. Decidability results for this problem have been stated either
in terms of control games, which extend Zielonka's asynchronous automata by
partitioning the actions into controllable and uncontrollable, or in terms of
Petri games, which extend Petri nets by partitioning the tokens into system and
environment players. The precise connection between these two models was so
far, however, an open question. In this paper, we provide the first formal
connection between control games and Petri games. We establish the equivalence
of the two game models based on weak bisimulations between their strategies.
For both directions, we show that a game of one type can be translated into an
equivalent game of the other type. We provide exponential upper and lower
bounds for the translations. Our translations make it possible to transfer and
combine decidability results between the two types of games. Exemplarily, we
translate decidability in acyclic communication architectures, originally
obtained for control games, to Petri games, and decidability in single-process
systems, originally obtained for Petri games, to control games.
","[{'version': 'v1', 'created': 'Mon, 1 Jul 2019 14:42:47 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Dec 2019 10:57:17 GMT'}]",2022-06-01,"[['Beutner', 'Raven', ''], ['Finkbeiner', 'Bernd', ''], ['Hecking-Harbusch', 'Jesko', '']]","['synthesis', 'distributed systems', 'asynchronous systems', 'causal memory', 'Petrigames', 'Petri nets', 'control games asynchronous automata']"
11516,2204.08326,Menghan Wang,"Menghan Wang, Yuchen Guo, Zhenqi Zhao, Guangzheng Hu, Yuming Shen,
  Mingming Gong, Philip Torr","MP2: A Momentum Contrast Approach for Recommendation with Pointwise and
  Pairwise Learning",This paper was accepted at SIGIR 2022,,10.1145/3477495.3531813,,cs.IR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Binary pointwise labels (aka implicit feedback) are heavily leveraged by deep
learning based recommendation algorithms nowadays. In this paper we discuss the
limited expressiveness of these labels may fail to accommodate varying degrees
of user preference, and thus lead to conflicts during model training, which we
call annotation bias. To solve this issue, we find the soft-labeling property
of pairwise labels could be utilized to alleviate the bias of pointwise labels.
To this end, we propose a momentum contrast framework (MP2) that combines
pointwise and pairwise learning for recommendation. MP2 has a three-tower
network structure: one user network and two item networks. The two item
networks are used for computing pointwise and pairwise loss respectively. To
alleviate the influence of the annotation bias, we perform a momentum update to
ensure a consistent item representation. Extensive experiments on real-world
datasets demonstrate the superiority of our method against state-of-the-art
recommendation algorithms.
","[{'version': 'v1', 'created': 'Mon, 18 Apr 2022 14:02:51 GMT'}]",2022-04-19,"[['Wang', 'Menghan', ''], ['Guo', 'Yuchen', ''], ['Zhao', 'Zhenqi', ''], ['Hu', 'Guangzheng', ''], ['Shen', 'Yuming', ''], ['Gong', 'Mingming', ''], ['Torr', 'Philip', '']]","['Recommendation', 'Momentum update', 'Pointwise learning', 'Pairwiselearning']"
11517,1801.08589,Renato J Cintra,"J. Adikari, V. S. Dimitrov, R. J. Cintra",A New Algorithm for Double Scalar Multiplication over Koblitz Curves,"5 pages, 2 figures, 1 table","Circuits and Systems (ISCAS), 2011 IEEE International Symposium on",10.1109/ISCAS.2011.5937664,,cs.CR cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Koblitz curves are a special set of elliptic curves and have improved
performance in computing scalar multiplication in elliptic curve cryptography
due to the Frobenius endomorphism. Double-base number system approach for
Frobenius expansion has improved the performance in single scalar
multiplication. In this paper, we present a new algorithm to generate a sparse
and joint $\tau$-adic representation for a pair of scalars and its application
in double scalar multiplication. The new algorithm is inspired from double-base
number system. We achieve 12% improvement in speed against state-of-the-art
$\tau$-adic joint sparse form.
","[{'version': 'v1', 'created': 'Thu, 25 Jan 2018 20:52:25 GMT'}]",2018-01-29,"[['Adikari', 'J.', ''], ['Dimitrov', 'V. S.', ''], ['Cintra', 'R. J.', '']]","['Elliptic curve cryptography', 'Koblitz curves', 'field programmable gate array', 'τ-adic joint sparse form']"
11518,1904.11663,Hao Ge,"Hao Ge, Randall Berry",Quantized VCG Mechanisms for Polymatroid Environments,,,10.1145/3323679.3326524,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many network resource allocation problems can be viewed as allocating a
divisible resource, where the allocations are constrained to lie in a
polymatroid. We consider market-based mechanisms for such problems. Though the
Vickrey-Clarke-Groves (VCG) mechanism can provide the efficient allocation with
strong incentive properties (namely dominant strategy incentive compatibility),
its well-known high communication requirements can prevent it from being used.
There have been a number of approaches for reducing the communication costs of
VCG by weakening its incentive properties. Here, instead we take a different
approach of reducing communication costs via quantization while maintaining
VCG's dominant strategy incentive properties. The cost for this approach is a
loss in efficiency which we characterize. We first consider quantizing the
resource allocations so that agents need only submit a finite number of bids
instead of full utility function. We subsequently consider quantizing the
agent's bids.
","[{'version': 'v1', 'created': 'Fri, 26 Apr 2019 03:44:27 GMT'}]",2019-04-29,"[['Ge', 'Hao', ''], ['Berry', 'Randall', '']]","['Mechanism design', 'Quantization', 'Worst-case efficiency']"
11519,2001.04457,Natarajan Shankar,Clement Blaudeau and Natarajan Shankar,A Verified Packrat Parser Interpreter for Parsing Expression Grammars,"15 pages, 15 figures, Certified Proofs and Programs",,10.1145/3372885.3373836,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parsing expression grammars (PEGs) offer a natural opportunity for building
verified parser interpreters based on higher-order parsing combinators. PEGs
are expressive, unambiguous, and efficient to parse in a top-down recursive
descent style. We use the rich type system of the PVS specification language
and verification system to formalize the metatheory of PEGs and define a
reference implementation of a recursive parser interpreter for PEGs. In order
to ensure termination of parsing, we define a notion of a well-formed grammar.
Rather than relying on an inductive definition of parsing, we use abstract
syntax trees that represent the computational trace of the parser to provide an
effective proof certificate for correct parsing and ensure that parsing
properties including soundness and completeness are maintained. The correctness
properties are embedded in the types of the operations so that the proofs can
be easily constructed from local proof obligations. Building on the reference
parser interpreter, we define a packrat parser interpreter as well as an
extension that is capable of semantic interpretation. Both these parser
interpreters are proved equivalent to the reference one. All of the parsers are
executable. The proofs are formalized in mathematical terms so that similar
parser interpreters can be defined in any specification language with a type
system similar to PVS.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2020 18:45:14 GMT'}]",2020-01-14,"[['Blaudeau', 'Clement', ''], ['Shankar', 'Natarajan', '']]","['PVS', 'PEG grammar', 'packrat parsing', 'semanticparsing', 'verified parser', 'abstract syntax tree', 'well-formedgrammars']"
11520,1710.06617,Dimosthenis Karatzas,"Dimosthenis Karatzas, Lluis G\'omez, Anguelos Nicolaou, Mar\c{c}al
  Rusi\~nol",The Robust Reading Competition Annotation and Evaluation Platform,"6 pages, accepted to DAS 2018","Proc. of the 13th IAPR Int. W. on Document Analysis Systems (DAS
  2018), IEEE CPS, pp. 61-66, 2018",10.1109/DAS.2018.22,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ICDAR Robust Reading Competition (RRC), initiated in 2003 and
re-established in 2011, has become a de-facto evaluation standard for robust
reading systems and algorithms. Concurrent with its second incarnation in 2011,
a continuous effort started to develop an on-line framework to facilitate the
hosting and management of competitions. This paper outlines the Robust Reading
Competition Annotation and Evaluation Platform, the backbone of the
competitions. The RRC Annotation and Evaluation Platform is a modular
framework, fully accessible through on-line interfaces. It comprises a
collection of tools and services for managing all processes involved with
defining and evaluating a research task, from dataset definition to annotation
management, evaluation specification and results analysis. Although the
framework has been designed with robust reading research in mind, many of the
provided tools are generic by design. All aspects of the RRC Annotation and
Evaluation Framework are available for research use.
","[{'version': 'v1', 'created': 'Wed, 18 Oct 2017 08:27:31 GMT'}, {'version': 'v2', 'created': 'Mon, 21 May 2018 17:10:01 GMT'}]",2018-05-22,"[['Karatzas', 'Dimosthenis', ''], ['Gómez', 'Lluis', ''], ['Nicolaou', 'Anguelos', ''], ['Rusiñol', 'Marçal', '']]","['robust reading', 'performance evaluation', 'onlineplatform', 'data annotation', 'ground truthing;']"
11521,2012.13023,Nurendra Choudhary,"Nurendra Choudhary, Nikhil Rao, Sumeet Katariya, Karthik Subbian,
  Chandan K. Reddy","Self-Supervised Hyperboloid Representations from Logical Queries over
  Knowledge Graphs",Accepted at the Web Conference 2021 (WWW '21),,10.1145/3442381.3449974,,cs.LG cs.CL cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Knowledge Graphs (KGs) are ubiquitous structures for information storagein
several real-world applications such as web search, e-commerce, social
networks, and biology. Querying KGs remains a foundational and challenging
problem due to their size and complexity. Promising approaches to tackle this
problem include embedding the KG units (e.g., entities and relations) in a
Euclidean space such that the query embedding contains the information relevant
to its results. These approaches, however, fail to capture the hierarchical
nature and semantic information of the entities present in the graph.
Additionally, most of these approaches only utilize multi-hop queries (that can
be modeled by simple translation operations) to learn embeddings and ignore
more complex operations such as intersection and union of simpler queries. To
tackle such complex operations, in this paper, we formulate KG representation
learning as a self-supervised logical query reasoning problem that utilizes
translation, intersection and union queries over KGs. We propose Hyperboloid
Embeddings (HypE), a novel self-supervised dynamic reasoning framework, that
utilizes positive first-order existential queries on a KG to learn
representations of its entities and relations as hyperboloids in a Poincar\'e
ball. HypE models the positive first-order queries as geometrical translation,
intersection, and union. For the problem of KG reasoning in real-world
datasets, the proposed HypE model significantly outperforms the state-of-the
art results. We also apply HypE to an anomaly detection task on a popular
e-commerce website product taxonomy as well as hierarchically organized web
articles and demonstrate significant performance improvements compared to
existing baseline methods. Finally, we also visualize the learned HypE
embeddings in a Poincar\'e ball to clearly interpret and comprehend the
representation space.
","[{'version': 'v1', 'created': 'Wed, 23 Dec 2020 23:19:00 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Feb 2021 02:17:31 GMT'}, {'version': 'v3', 'created': 'Wed, 12 May 2021 19:23:14 GMT'}]",2021-05-14,"[['Choudhary', 'Nurendra', ''], ['Rao', 'Nikhil', ''], ['Katariya', 'Sumeet', ''], ['Subbian', 'Karthik', ''], ['Reddy', 'Chandan K.', '']]","['Representation learning', 'knowledge graphs', 'hyperbolic space', 'reasoning queries']"
11522,1602.05852,Kyrill Winkler,"Kyrill Winkler, Manfred Schwarz and Ulrich Schmid",Consensus in Rooted Dynamic Networks with Short-Lived Stability,"14 pages, 2 figures",Distrib. Comput. (2019),10.1007/s00446-019-00348-0,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of solving consensus using deterministic algorithms
in a synchronous dynamic network with unreliable, directional point-to-point
links, which are under the control of a message adversary. In contrast to a
large body of existing work that focuses on oblivious message adversaries where
the communication graphs are picked from a predefined set, we consider message
adversaries where guarantees about stable periods that occur only eventually
can be expressed. We reveal to what extent such eventual stability is necessary
and sufficient, that is, we present the shortest period of stability that
permits solving consensus, a result that should prove quite useful in systems
that exhibit erratic boot-up phases or recover after repeatedly occurring,
massive transient faults. Contrary to the case of longer stability periods,
where we show how standard algorithmic techniques for solving consensus can be
employed, the short-lived nature of the stability phase forces us to use more
unusual algorithmic methods that avoid waiting explicitly for the stability
period to occur.
","[{'version': 'v1', 'created': 'Thu, 18 Feb 2016 16:08:36 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Feb 2017 15:53:31 GMT'}, {'version': 'v3', 'created': 'Fri, 10 Feb 2017 13:57:28 GMT'}]",2019-04-10,"[['Winkler', 'Kyrill', ''], ['Schwarz', 'Manfred', ''], ['Schmid', 'Ulrich', '']]","['Dynamic networks', 'consensus', 'message adversary', 'eventual stability', 'short stability periods', 'rooted directedgraphs']"
11523,2006.12106,Mohanad Al-Mousa,"Mohannad AlMousa, Rachid Benlamri, Richard Khoury","Exploiting Non-Taxonomic Relations for Measuring Semantic Similarity and
  Relatedness in WordNet",,,10.1016/j.knosys.2020.106565,,cs.CL,http://creativecommons.org/publicdomain/zero/1.0/,"  Various applications in the areas of computational linguistics and artificial
intelligence employ semantic similarity to solve challenging tasks, such as
word sense disambiguation, text classification, information retrieval, machine
translation, and document clustering. Previous work on semantic similarity
followed a mono-relational approach using mostly the taxonomic relation ""ISA"".
This paper explores the benefits of using all types of non-taxonomic relations
in large linked data, such as WordNet knowledge graph, to enhance existing
semantic similarity and relatedness measures. We propose a holistic
poly-relational approach based on a new relation-based information content and
non-taxonomic-based weighted paths to devise a comprehensive semantic
similarity and relatedness measure. To demonstrate the benefits of exploiting
non-taxonomic relations in a knowledge graph, we used three strategies to
deploy non-taxonomic relations at different granularity levels. We conducted
experiments on four well-known gold standard datasets, and the results
demonstrated the robustness and scalability of the proposed semantic similarity
and relatedness measure, which significantly improves existing similarity
measures.
","[{'version': 'v1', 'created': 'Mon, 22 Jun 2020 09:59:39 GMT'}]",2021-01-11,"[['AlMousa', 'Mohannad', ''], ['Benlamri', 'Rachid', ''], ['Khoury', 'Richard', '']]","['Semantic Similarity and Relatedness', 'Knowledge graph', 'Information content', 'WordNet']"
11524,2104.05293,Mark Vella,"Simon Joseph Aquilina, Fran Casino, Mark Vella, Joshua Ellul,
  Constantinos Patsakis",EtherClue: Digital investigation of attacks on Ethereum smart contracts,,"Blockchain: Research and Applications,2021,100028,ISSN 2096-7209",10.1016/j.bcra.2021.100028,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Programming errors in Ethereum smart contracts can result in catastrophic
financial losses from stolen cryptocurrency. While vulnerability detectors can
prevent vulnerable contracts from being deployed, this does not mean that such
contracts will not be deployed. Once a vulnerable contract is instantiated on
the blockchain and becomes the target of attacks, the identification of exploit
transactions becomes indispensable in assessing whether it has been actually
exploited and identifying which malicious or subverted accounts were involved.
  In this work, we study the problem of post-factum investigation of Ethereum
attacks using Indicators of Compromise (IoCs) specially crafted for use in the
blockchain. IoC definitions need to capture the side-effects of successful
exploitation in the context of the Ethereum blockchain. Therefore, we define a
model for smart contract execution, comprising multiple abstraction levels that
mirror the multiple views of code execution on a blockchain. Subsequently, we
compare IoCs defined across the different levels in terms of their
effectiveness and practicality through EtherClue, a prototype tool for
investigating Ethereum security incidents. Our results illustrate that
coarse-grained IoCs defined over blocks of transactions can detect exploit
transactions with less computation; however, they are contract-specific and
suffer from false negatives. On the other hand, fine-grained IoCs defined over
virtual machine instructions can avoid these pitfalls at the expense of
increased computation which are nevertheless applicable for practical use.
","[{'version': 'v1', 'created': 'Mon, 12 Apr 2021 08:55:33 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Sep 2021 06:49:00 GMT'}]",2021-09-03,"[['Aquilina', 'Simon Joseph', ''], ['Casino', 'Fran', ''], ['Vella', 'Mark', ''], ['Ellul', 'Joshua', ''], ['Patsakis', 'Constantinos', '']]","['Blockchain Forensics', 'Ethereum Attacks', 'Indicators of Compromise', 'Ethereum Operational Semantics']"
11525,1710.03940,Denis Demidov,Denis Demidov and Riccardo Rossi,"Subdomain Deflation Combined with Local AMG: a Case Study Using AMGCL
  Library","21 pages, 7 figures",,10.1134/S1995080220040071,,cs.DC cs.MS cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper proposes a combination of the subdomain deflation method and local
algebraic multigrid as a scalable distributed memory preconditioner that is
able to solve large linear systems of equations. The implementation of the
algorithm is made available for the community as part of an open source AMGCL
library. The solution targets both homogeneous (CPU-only) and heterogeneous
(CPU/GPU) systems, employing hybrid MPI/OpenMP approach in the former and a
combination of MPI, OpenMP, and CUDA in the latter cases. The use of OpenMP
minimizes the number of MPI processes, thus reducing the communication overhead
of the deflation method and improving both weak and strong scalability of the
preconditioner. The examples of scalar, Poisson-like, systems as well as
non-scalar problems, stemming out of the discretization of the Navier-Stokes
equations, are considered in order to estimate performance of the implemented
algorithm. A comparison with a traditional global AMG preconditioner based on a
well-established Trilinos ML package is provided.
","[{'version': 'v1', 'created': 'Wed, 11 Oct 2017 07:25:16 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Apr 2018 10:54:14 GMT'}, {'version': 'v3', 'created': 'Thu, 24 May 2018 08:19:38 GMT'}, {'version': 'v4', 'created': 'Fri, 26 Oct 2018 06:20:18 GMT'}]",2020-07-31,"[['Demidov', 'Denis', ''], ['Rossi', 'Riccardo', '']]","['Subdomain Deflation', 'Algebraic Multigrid', 'Scalability', 'MPI', 'OpenMP', 'CUDA']"
11526,2205.01733,Huang Ling,"Ling Huang, Su Ruan, Thierry Denoeux",Application of belief functions to medical image segmentation: A review,Accepted by Information fusion,"Information Fusion, Volume 91, March 2023, Pages 737-756",10.1016/j.inffus.2022.11.008,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The investigation of uncertainty is of major importance in risk-critical
applications, such as medical image segmentation. Belief function theory, a
formal framework for uncertainty analysis and multiple evidence fusion, has
made significant contributions to medical image segmentation, especially since
the development of deep learning. In this paper, we provide an introduction to
the topic of medical image segmentation methods using belief function theory.
We classify the methods according to the fusion step and explain how
information with uncertainty or imprecision is modeled and fused with belief
function theory. In addition, we discuss the challenges and limitations of
present belief function-based medical image segmentation and propose
orientations for future research. Future research could investigate both belief
function theory and deep learning to achieve more promising and reliable
segmentation results.
","[{'version': 'v1', 'created': 'Tue, 3 May 2022 19:06:45 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Oct 2022 14:41:31 GMT'}, {'version': 'v3', 'created': 'Tue, 22 Nov 2022 10:42:32 GMT'}, {'version': 'v4', 'created': 'Mon, 5 Dec 2022 21:28:45 GMT'}]",2022-12-07,"[['Huang', 'Ling', ''], ['Ruan', 'Su', ''], ['Denoeux', 'Thierry', '']]","['Belief function theory', 'Medical image segmentation', 'Uncertaintyquantification', 'Information fusion', 'Evidence fusion', 'Reliability', 'Deeplearning']"
11527,2004.01256,Omar Reyad,Faizal Khan and Omar Reyad,"Application of Intelligent Multi Agent Based Systems For E-Healthcare
  Security","6 pages, 3 figures, 1 table, journal",Inf. Sci. Lett. 8(2) 2019,10.18576/isl/080204,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, availability and usage of extensive systems for Electronic
Healthcare Record (EHR) is increased. In medical centers such hospitals and
other laboratories, more health data sets were formed during the treatment
process. In order to enhance the standard of the services provided in
healthcare, these records where shared and can be used by various users depends
on their requirements. As a result, notable issues in the security and privacy
where obtained which should be monitored and removed in order to make the use
of EHR more effectively. Various researches have been done in the past
literature for improving the standards of the security and privacy in E-health
systems. In spite of this, it is not completely enhanced. In this paper, a
comprehensive analysis is done by selecting the existing approaches and models
which were proposed for the security and privacy of the E-healthcare systems.
Also, a novel Intelligent-based Access Control Security Model (IBAC) based on
multi agents is proposed to maintain and support the security and privacy of
E-healthcare systems. This system uses agents in order to maintain security and
privacy while accessing the E-health data between the users.
","[{'version': 'v1', 'created': 'Thu, 2 Apr 2020 20:53:21 GMT'}]",2020-04-06,"[['Khan', 'Faizal', ''], ['Reyad', 'Omar', '']]","['Information Technology', 'Electronic Health Records', 'Agent Based Systems', 'Agents', 'Privacy and Security']"
11528,2011.08513,Marco Trombini,"Marco Trombini, Paolo Borro, Sebastiano Ziola, Silvana Dellepiane","A Digital Image Processing Approach for Hepatic Diseases Staging based
  on the Glisson's Capsule","Paper accepted with content unaltered to publish with IEEE Xplore
  Digital Library - 2020 IEEE Malaysian International Biomedical Conference
  (MIBEC)",,10.1109/ICECIE50279.2020.9309633,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the need for quick and effective treatments for liver diseases, which
are among the most common health problems in the world, staging fibrosis
through non-invasive and economic methods has become of great importance.
Taking inspiration from diagnostic laparoscopy, used in the past for hepatic
diseases, in this paper ultrasound images of the liver are studied, focusing on
a specific region of the organ where the Glisson's capsule is visible. In
ultrasound images, the Glisson's capsule appears in the shape of a line which
can be extracted via classical methods in literature. By making use of a
combination of standard image processing techniques and Convolutional Neural
Network approaches, the scope of this work is to give evidence to the idea that
a great informative potential relies on smoothness of the Glisson's capsule
surface. To this purpose, several classifiers are taken into consideration,
which deal with different type of data, namely ultrasound images, binary images
depicting the Glisson's line, and features vector extracted from the original
image. This is a preliminary study that has been retrospectively conducted,
based on the results of the elastosonography examination.
","[{'version': 'v1', 'created': 'Tue, 17 Nov 2020 09:05:54 GMT'}]",2021-01-08,"[['Trombini', 'Marco', ''], ['Borro', 'Paolo', ''], ['Ziola', 'Sebastiano', ''], ['Dellepiane', 'Silvana', '']]","['ultrasound imaging', 'Glisson’s capsule', 'liver diseases']"
11529,2206.04561,Edward Pantridge,"Edward Pantridge, Thomas Helmuth, Lee Spector",Functional Code Building Genetic Programming,,,10.1145/3512290.3528866,,cs.AI cs.NE cs.PL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  General program synthesis has become an important application area for
genetic programming (GP), and for artificial intelligence more generally. Code
Building Genetic Programming (CBGP) is a recently introduced GP method for
general program synthesis that leverages reflection and first class
specifications to support the evolution of programs that may use arbitrary data
types, polymorphism, and functions drawn from existing codebases. However,
neither a formal description nor a thorough benchmarking of CBGP have yet been
reported. In this work, we formalize the method of CBGP using algorithms from
type theory. Specially, we show that a functional programming language and a
Hindley-Milner type system can be used to evolve type-safe programs using the
process abstractly described in the original CBGP paper. Furthermore, we
perform a comprehensive analysis of the search performance of this functional
variant of CBGP compared to other contemporary GP program synthesis methods.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2022 15:22:33 GMT'}]",2022-06-17,"[['Pantridge', 'Edward', ''], ['Helmuth', 'Thomas', ''], ['Spector', 'Lee', '']]","['automatic programming', 'genetic programming', 'inductive programsynthesis']"
11530,1911.00677,Harvineet Singh,"Harvineet Singh, Rina Singh, Vishwali Mhasawade, Rumi Chunara",Fairness Violations and Mitigation under Covariate Shift,"11 pages main and 7 pages supplementary, To appear at ACM FAccT '21,
  Previous arXiv version arXiv:1911.00677v1 was presented at Workshop on Fair
  ML for Health '19",,10.1145/3442188.3445865,,cs.LG cs.CY stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of learning fair prediction models for unseen test sets
distributed differently from the train set. Stability against changes in data
distribution is an important mandate for responsible deployment of models. The
domain adaptation literature addresses this concern, albeit with the notion of
stability limited to that of prediction accuracy. We identify sufficient
conditions under which stable models, both in terms of prediction accuracy and
fairness, can be learned. Using the causal graph describing the data and the
anticipated shifts, we specify an approach based on feature selection that
exploits conditional independencies in the data to estimate accuracy and
fairness metrics for the test set. We show that for specific fairness
definitions, the resulting model satisfies a form of worst-case optimality. In
context of a healthcare task, we illustrate the advantages of the approach in
making more equitable decisions.
","[{'version': 'v1', 'created': 'Sat, 2 Nov 2019 08:10:58 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Jan 2021 20:03:54 GMT'}]",2021-01-26,"[['Singh', 'Harvineet', ''], ['Singh', 'Rina', ''], ['Mhasawade', 'Vishwali', ''], ['Chunara', 'Rumi', '']]","['algorithmic fairness', 'domain adaptation', 'covariate shift', 'causal inference']"
11531,2201.13230,\'Ad\'am Kov\'acs,"\'Ad\'am Kov\'acs, Kinga G\'emes, Eszter Ikl\'odi, G\'abor Recski",POTATO: exPlainable infOrmation exTrAcTion framewOrk,4 pages,,10.1145/3511808.3557196,,cs.CL cs.LG,http://creativecommons.org/licenses/by/4.0/,"  We present POTATO, a task- and languageindependent framework for
human-in-the-loop (HITL) learning of rule-based text classifiers using
graph-based features. POTATO handles any type of directed graph and supports
parsing text into Abstract Meaning Representations (AMR), Universal
Dependencies (UD), and 4lang semantic graphs. A streamlit-based user interface
allows users to build rule systems from graph patterns, provides real-time
evaluation based on ground truth data, and suggests rules by ranking graph
features using interpretable machine learning models. Users can also provide
patterns over graphs using regular expressions, and POTATO can recommend
refinements of such rules. POTATO is applied in projects across domains and
languages, including classification tasks on German legal text and English
social media data. All components of our system are written in Python, can be
installed via pip, and are released under an MIT License on GitHub.
","[{'version': 'v1', 'created': 'Mon, 31 Jan 2022 13:43:02 GMT'}, {'version': 'v2', 'created': 'Sun, 16 Oct 2022 22:57:26 GMT'}]",2022-10-18,"[['Kovács', 'Ádám', ''], ['Gémes', 'Kinga', ''], ['Iklódi', 'Eszter', ''], ['Recski', 'Gábor', '']]","['exPlainable', 'explainability', 'HITL']"
11532,1909.07438,Emil Pricop,Emil Pricop,"On the design of an innovative solution for increasing hazardous
  materials transportation safety","Paper presented at the 17th International Conference on System
  Theory, Control and Computing (ICSTCC 2013), Sinaia, Romania - 11-13 October
  2013","Proceedings of the 7th International Conference on System Theory,
  Control and Computing (ICSTCC 2013)",10.1109/ICSTCC.2013.6689029,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transportation of hazardous materials represent a high risk operation all
over the world. Flammable substances such as oil, kerosene, hydrocarbons,
ammonium nitrate or toxic products are shipped every day on busy roads by
trucks. An innovative solution for increasing hazardous materials
transportation safety is presented in this paper. The solution integrates three
systems: one mounted on the truck that can alert authorities in case of an
accident, one portable system for quick identification of the carried
substances and intervention method and a component for real-time road
monitoring. The proposed solution is based on RFID card with a special memory
structure presented in this paper
","[{'version': 'v1', 'created': 'Tue, 10 Sep 2019 06:45:51 GMT'}]",2019-09-18,"[['Pricop', 'Emil', '']]","['transportation safety', 'hazardous goods', 'car']"
11533,2101.08048,Reuben Binns Dr,"Nitin Agrawal, Reuben Binns, Max Van Kleek, Kim Laine, Nigel Shadbolt","Exploring Design and Governance Challenges in the Development of
  Privacy-Preserving Computation",,,10.1145/3411764.3445677,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Homomorphic encryption, secure multi-party computation, and differential
privacy are part of an emerging class of Privacy Enhancing Technologies which
share a common promise: to preserve privacy whilst also obtaining the benefits
of computational analysis. Due to their relative novelty, complexity, and
opacity, these technologies provoke a variety of novel questions for design and
governance. We interviewed researchers, developers, industry leaders,
policymakers, and designers involved in their deployment to explore
motivations, expectations, perceived opportunities and barriers to adoption.
This provided insight into several pertinent challenges facing the adoption of
these technologies, including: how they might make a nebulous concept like
privacy computationally tractable; how to make them more usable by developers;
and how they could be explained and made accountable to stakeholders and wider
society. We conclude with implications for the development, deployment, and
responsible governance of these privacy-preserving computation techniques.
","[{'version': 'v1', 'created': 'Wed, 20 Jan 2021 10:07:17 GMT'}]",2021-01-21,"[['Agrawal', 'Nitin', ''], ['Binns', 'Reuben', ''], ['Van Kleek', 'Max', ''], ['Laine', 'Kim', ''], ['Shadbolt', 'Nigel', '']]","['privacy-enhancing technologies', 'expert interview', 'cryptography', 'policy']"
11534,2003.07160,Bingqing Yu,"Bingqing Yu, Jacopo Tagliabue, Ciro Greco and Federico Bianchi","""An Image is Worth a Thousand Features"": Scalable Product
  Representations for In-Session Type-Ahead Personalization",,,10.1145/3366424.3386198,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the problem of personalizing query completion in a digital
commerce setting, in which the bounce rate is typically high and recurring
users are rare. We focus on in-session personalization and improve a standard
noisy channel model by injecting dense vectors computed from product images at
query time. We argue that image-based personalization displays several
advantages over alternative proposals (from data availability to business
scalability), and provide quantitative evidence and qualitative support on the
effectiveness of the proposed methods. Finally, we show how a shared vector
space between similar shops can be used to improve the experience of users
browsing across sites, opening up the possibility of applying zero-shot
unsupervised personalization to increase conversions. This will prove to be
particularly relevant to retail groups that manage multiple brands and/or
websites and to multi-tenant SaaS providers that serve multiple clients in the
same space.
","[{'version': 'v1', 'created': 'Wed, 11 Mar 2020 18:41:56 GMT'}]",2020-03-17,"[['Yu', 'Bingqing', ''], ['Tagliabue', 'Jacopo', ''], ['Greco', 'Ciro', ''], ['Bianchi', 'Federico', '']]","['e-commerce query auto-completion', 'conditional language model', 'neural networks', 'zero-shot learning', 'transfer learning']"
11535,2102.01270,Huanyi Chen,"Huanyi Chen, Paul A.S. Ward",Predicting student performance using data from an auto-grading system,,,10.5555/3370272.3370297,,cs.LG cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As online auto-grading systems appear, information obtained from those
systems can potentially enable researchers to create predictive models to
predict student behaviour and performances. In the University of Waterloo, the
ECE 150 (Fundamentals of Programming) Instructional Team wants to get an
insight into how to allocate the limited teaching resources better to achieve
improved educational outcomes. Currently, the Instructional Team allocates
tutoring time in a reactive basis. They help students ""as-requested"". This
approach serves those students with the wherewithal to request help; however,
many of the students who are struggling do not reach out for assistance.
Therefore, we, as the Research Team, want to explore if we can determine
students which need help by looking into the data from our auto-grading system,
Marmoset.
  In this paper, we conducted experiments building decision-tree and
linear-regression models with various features extracted from the Marmoset
auto-grading system, including passing rate, testcase outcomes, number of
submissions and submission time intervals (the time interval between the
student's first reasonable submission and the deadline). For each feature, we
interpreted the result at the confusion matrix level. Specifically for
poor-performance students, we show that the linear-regression model using
submission time intervals performs the best among all models in terms of
Precision and F-Measure. We also show that for students who are misclassified
into poor-performance students, they have the lowest actual grades in the
linear-regression model among all models. In addition, we show that for the
midterm, the submission time interval of the last assignment before the midterm
predicts the midterm performance the most. However, for the final exam, the
midterm performance contributes the most on the final exam performance.
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2021 03:02:39 GMT'}]",2021-02-03,"[['Chen', 'Huanyi', ''], ['Ward', 'Paul A. S.', '']]","['Data Mining', 'Exploratory Data Analysis', 'Linear regression', 'Decision Tree', 'Student Performance']"
11536,1707.01732,Ran Dong,"Ran Dong, Dongsheng Cai, Nobuyoshi Asai","Nonlinear dance motion analysis and motion editing using Hilbert-Huang
  transform","6 pages, 10 figures, Computer Graphics International 2017, Conference
  short paper",,10.1145/3095140.3095175,Article No. 35,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human motions (especially dance motions) are very noisy, and it is hard to
analyze and edit the motions. To resolve this problem, we propose a new method
to decompose and modify the motions using the Hilbert-Huang transform (HHT).
First, HHT decomposes a chromatic signal into ""monochromatic"" signals that are
the so-called Intrinsic Mode Functions (IMFs) using an Empirical Mode
Decomposition (EMD) [6]. After applying the Hilbert Transform to each IMF, the
instantaneous frequencies of the ""monochromatic"" signals can be obtained. The
HHT has the advantage to analyze non-stationary and nonlinear signals such as
human-joint-motions over FFT or Wavelet transform.
  In the present paper, we propose a new framework to analyze and extract some
new features from a famous Japanese threesome pop singer group called
""Perfume"", and compare it with Waltz and Salsa dance. Using the EMD, their
dance motions can be decomposed into motion (choreographic) primitives or IMFs.
Therefore we can scale, combine, subtract, exchange, and modify those IMFs, and
can blend them into new dance motions self-consistently. Our analysis and
framework can lead to a motion editing and blending method to create a new
dance motion from different dance motions.
","[{'version': 'v1', 'created': 'Thu, 6 Jul 2017 11:18:42 GMT'}]",2017-07-07,"[['Dong', 'Ran', ''], ['Cai', 'Dongsheng', ''], ['Asai', 'Nobuyoshi', '']]","['Dance Motion', 'Motion Analysis', 'Motion Editing and Blending', 'Motion Synthesis']"
11537,1909.07099,Constantinos Patsakis,"Constantinos Patsakis, Fran Casino and Vasilios Katos","Encrypted and Covert DNS Queries for Botnets: Challenges and
  Countermeasures",,,10.1016/j.cose.2019.101614,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a continuous increase in the sophistication that modern malware
exercise in order to bypass the deployed security mechanisms. A typical
approach to evade the identification and potential takedown of a botnet command
and control server is domain fluxing through the use of Domain Generation
Algorithms (DGAs). These algorithms produce a vast amount of domain names that
the infected device tries to communicate with to find the C&C server, yet only
a small fragment of them is actually registered. This allows the botmaster to
pivot the control and make the work of seizing the botnet control rather
difficult.
  Current state of the art and practice considers that the DNS queries
performed by a compromised device are transparent to the network administrator
and therefore can be monitored, analysed, and blocked. In this work, we
showcase that the latter is a strong assumption as malware could efficiently
hide its DNS queries using covert and/or encrypted channels bypassing the
detection mechanisms. To this end, we discuss possible mitigation measures
based on traffic analysis to address the new challenges that arise f
","[{'version': 'v1', 'created': 'Mon, 16 Sep 2019 10:07:15 GMT'}]",2019-09-17,"[['Patsakis', 'Constantinos', ''], ['Casino', 'Fran', ''], ['Katos', 'Vasilios', '']]","['Malware', 'Botnets', 'Domain Generation Algorithm', 'DNS', 'Covert Communication']"
11538,2205.08641,Vipindev Adat Vasudevan,"Vipindev Adat Vasudevan, Muhammad Tayyab, George P. Koudouridis,
  Xavier Gelabert, Ilias Politis","An Integrated Approach for Energy Efficient Handover and Key
  Distribution Protocol for Secure NC-enabled Small Cells",Preprint of the paper accepted at Computer Networks,"Computer Networks, 206 (2022), p. 108806",10.1016/j.comnet.2022.108806,,cs.NI cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Future wireless networks must serve dense mobile networks with high data
rates, keeping energy requirements to a possible minimum. The small cell-based
network architecture and device-to-device (D2D) communication are already being
considered part of 5G networks and beyond. In such environments, network coding
(NC) can be employed to achieve both higher throughput and energy efficiency.
However, NC-enabled systems need to address security challenges specific to NC,
such as pollution attacks. All integrity schemes against pollution attacks
generally require proper key distribution and management to ensure security in
a mobile environment. Additionally, the mobility requirements in small cell
environments are more challenging and demanding in terms of signaling overhead.
This paper proposes a blockchain-assisted key distribution protocol tailored
for MAC-based integrity schemes, which combined with an uplink reference signal
(UL RS) handover mechanism, enables energy efficient secure NC. The performance
analysis of the protocol during handover scenarios indicates its suitability
for ensuring high level of security against pollution attacks in dense small
cell environments with multiple adversaries being present. Furthermore, the
proposed scheme achieves lower bandwidth and signaling overhead during handover
compared to legacy schemes and the signaling cost reduces significantly as the
communication progresses, thus enhancing the network's cumulative energy
efficiency.
","[{'version': 'v1', 'created': 'Tue, 17 May 2022 21:41:59 GMT'}]",2022-05-19,"[['Vasudevan', 'Vipindev Adat', ''], ['Tayyab', 'Muhammad', ''], ['Koudouridis', 'George P.', ''], ['Gelabert', 'Xavier', ''], ['Politis', 'Ilias', '']]","['Network Coding', 'Key management', 'Handover', '5G and Small cells']"
11539,1802.01786,Amir Karami,"Amir Karami, London S. Bennett, Xiaoyun He","Mining Public Opinion about Economic Issues: Twitter and the U.S.
  Presidential Election",,,10.4018/IJSDS.2018010102,,cs.SI cs.CL cs.IR stat.AP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Opinion polls have been the bridge between public opinion and politicians in
elections. However, developing surveys to disclose people's feedback with
respect to economic issues is limited, expensive, and time-consuming. In recent
years, social media such as Twitter has enabled people to share their opinions
regarding elections. Social media has provided a platform for collecting a
large amount of social media data. This paper proposes a computational public
opinion mining approach to explore the discussion of economic issues in social
media during an election. Current related studies use text mining methods
independently for election analysis and election prediction; this research
combines two text mining methods: sentiment analysis and topic modeling. The
proposed approach has effectively been deployed on millions of tweets to
analyze economic concerns of people during the 2012 US presidential election.
","[{'version': 'v1', 'created': 'Tue, 6 Feb 2018 03:55:37 GMT'}]",2018-02-07,"[['Karami', 'Amir', ''], ['Bennett', 'London S.', ''], ['He', 'Xiaoyun', '']]","['Opinion Mining', 'Text Mining', 'Social Media', 'Sentiment Analysis', 'Topic Modeling', 'Economy \t c \xa0\t c \xa0INTRODUCTION']"
11540,2002.06185,Jo\~ao Costa Seco,"Jo\~ao Costa Seco (Universidade NOVA de Lisboa, Portugal), Paulo
  Ferreira (OutSystems, Portugal), Hugo Louren\~A{\S}o (OutSystems, Portugal),
  Carla Ferreira (Universidade NOVA de Lisboa, Portugal), Lucio Ferrao
  (OutSystems, Portugal)",Robust Contract Evolution in a TypeSafe MicroServices Architecture,,"The Art, Science, and Engineering of Programming, 2020, Vol. 4,
  Issue 3, Article 10",10.22152/programming-journal.org/2020/4/10,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Microservices architectures allow for short deployment cycles and immediate
effects but offer no safety mechanisms when service contracts need to be
changed. Maintaining the soundness of microservice architectures is an
error-prone task that is only accessible to the most disciplined development
teams. We present a microservice management system that statically verifies
service interfaces and supports the seamless evolution of compatible
interfaces. We define a compatibility relation that captures real evolution
patterns and embodies known good practices on the evolution of interfaces.
Namely, we allow for the addition, removal, and renaming of data fields of a
producer module without breaking or needing to upgrade consumer services. The
evolution of interfaces is supported by runtime generated proxy components that
dynamically adapt data exchanged between services to match with the statically
checked service code.The model was instantiated in a core language whose
semantics is defined by a labeled transition system and a type system that
prevents breaking changes from being deployed. Standard soundness results for
the core language entail the existence of adapters, hence the absence of
adaptation errors and the correctness of the management model. This adaptive
approach allows for gradual deployment of modules, without halting the whole
system and avoiding losing or misinterpreting data exchanged between system
nodes. Experimental data shows that an average of 69% of deployments that would
require adaptation and recompilation are safe under our approach.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 18:58:26 GMT'}]",2020-02-17,"[['Seco', 'João Costa', '', 'Universidade NOVA de Lisboa, Portugal'], ['Ferreira', 'Paulo', '', 'OutSystems, Portugal'], ['Lourenço', 'Hugo', '', 'OutSystems, Portugal'], ['Ferreira', 'Carla', '', 'Universidade NOVA de Lisboa, Portugal'], ['Ferrao', 'Lucio', '', 'OutSystems, Portugal']]","['microservices', 'software evolution', 'service compatibility', 'type safety']"
11541,2108.13553,Daniel Link,"Daniel Link, Kamonphop Srisopha, Barry Boehm","Study of the Utility of Text Classification Based Software Architecture
  Recovery Method RELAX for Maintenance","To be published in ACM / IEEE International Symposium on Empirical
  Software Engineering and Measurement (ESEM) (ESEM '21)",,10.1145/3475716.3484194,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Background. The software architecture recovery method RELAX produces a
concern-based architectural view of a software system graphically and textually
from that system's source code. The method has been implemented in software
which can be run on subject systems whose source code is written in Java. Aims.
Our aim was to find out whether the availability of architectural views
produced by RELAX can help maintainers who are new to a project in becoming
productive with development tasks sooner, and find out how they felt about
working in such an environment. Method. We conducted a user study with nine
participants. They were subjected to a controlled experiment in which
maintenance success and speed with and without access to RELAX recovery results
were compared to each other. Results. We have observed that employing
architecture views produced by RELAX helped participants reduce time to get
started on maintenance tasks by a factor of 5.38 or more. While most
participants were unable to finish their tasks within the allotted time when
they did not have recovery results available, all of them finished them
successfully when they did. Additionally, participants reported that these
views were easy to understand, helped them to learn the system's structure and
enabled them to compare different versions of the system. Conclusions. In the
speedup experienced to the start of maintenance experienced by the participants
as well as in their experience-based opinions, RELAX has shown itself to be a
valuable help that could form the basis for further tools that specifically
support the development process with a focus on maintenance.
","[{'version': 'v1', 'created': 'Mon, 30 Aug 2021 23:40:29 GMT'}]",2021-09-01,"[['Link', 'Daniel', ''], ['Srisopha', 'Kamonphop', ''], ['Boehm', 'Barry', '']]","['Software Architecture Recovery', 'Text Classification', 'Software Maintenance']"
11542,2010.11289,Wolfgang Kratsch,"Wolfgang Kratsch, Fabian Koenig, Maximilian Roeglinger","Shedding Light on Blind Spots: Developing a Reference Architecture to
  Leverage Video Data for Process Mining",,"Decision Support Systems, 2022",10.1016/j.dss.2022.113794,,cs.CV cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Process mining is one of the most active research streams in business process
management. In recent years, numerous methods have been proposed for analyzing
structured process data. Yet, in many cases, it is only the digitized parts of
processes that are directly captured from process-aware information systems,
and manual activities often result in blind spots. While the use of video
cameras to observe these activities could help to fill this gap, a standardized
approach to extracting event logs from unstructured video data remains lacking.
Here, we propose a reference architecture to bridge the gap between computer
vision and process mining. Various evaluation activities (i.e., competing
artifact analysis, prototyping, and real-world application) ensured that the
proposed reference architecture allows flexible, use-case-driven, and
context-specific instantiations. Our results also show that an exemplary
software prototype instantiation of the proposed reference architecture is
capable of automatically extracting most of the process-relevant events from
unstructured video data.
","[{'version': 'v1', 'created': 'Wed, 21 Oct 2020 20:01:52 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Oct 2021 15:45:26 GMT'}, {'version': 'v3', 'created': 'Mon, 2 May 2022 16:13:28 GMT'}]",2022-05-03,"[['Kratsch', 'Wolfgang', ''], ['Koenig', 'Fabian', ''], ['Roeglinger', 'Maximilian', '']]","['Computer Vision', 'Process Mining', 'Reference Architecture', 'Unstructured Data']"
11543,2001.06509,Dakuo Wang,"Jaimie Drozdal, Justin Weisz, Dakuo Wang, Gaurav Dass, Bingsheng Yao,
  Changruo Zhao, Michael Muller, Lin Ju, Hui Su","Trust in AutoML: Exploring Information Needs for Establishing Trust in
  Automated Machine Learning Systems",IUI 2020,,10.1145/3377325.3377501,,cs.LG cs.CY cs.HC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore trust in a relatively new area of data science: Automated Machine
Learning (AutoML). In AutoML, AI methods are used to generate and optimize
machine learning models by automatically engineering features, selecting
models, and optimizing hyperparameters. In this paper, we seek to understand
what kinds of information influence data scientists' trust in the models
produced by AutoML? We operationalize trust as a willingness to deploy a model
produced using automated methods. We report results from three studies --
qualitative interviews, a controlled experiment, and a card-sorting task -- to
understand the information needs of data scientists for establishing trust in
AutoML systems. We find that including transparency features in an AutoML tool
increased user trust and understandability in the tool; and out of all proposed
features, model performance metrics and visualizations are the most important
information to data scientists when establishing their trust with an AutoML
tool.
","[{'version': 'v1', 'created': 'Fri, 17 Jan 2020 19:50:54 GMT'}]",2020-01-22,"[['Drozdal', 'Jaimie', ''], ['Weisz', 'Justin', ''], ['Wang', 'Dakuo', ''], ['Dass', 'Gaurav', ''], ['Yao', 'Bingsheng', ''], ['Zhao', 'Changruo', ''], ['Muller', 'Michael', ''], ['Ju', 'Lin', ''], ['Su', 'Hui', '']]","['AutoAI', 'AutoML', 'AutoDS', 'Automated Artificial Intelligence', 'Automated Machine Learning', 'Automated Data Science', 'Trust']"
11544,1605.04770,Lamberto Ballan,"Tiberio Uricchio, Lamberto Ballan, Lorenzo Seidenari, Alberto Del
  Bimbo",Automatic Image Annotation via Label Transfer in the Semantic Space,To appear in Pattern Recognition,,10.1016/j.patcog.2017.05.019,,cs.CV cs.IR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic image annotation is among the fundamental problems in computer
vision and pattern recognition, and it is becoming increasingly important in
order to develop algorithms that are able to search and browse large-scale
image collections. In this paper, we propose a label propagation framework
based on Kernel Canonical Correlation Analysis (KCCA), which builds a latent
semantic space where correlation of visual and textual features are well
preserved into a semantic embedding. The proposed approach is robust and can
work either when the training set is well annotated by experts, as well as when
it is noisy such as in the case of user-generated tags in social media. We
report extensive results on four popular datasets. Our results show that our
KCCA-based framework can be applied to several state-of-the-art label transfer
methods to obtain significant improvements. Our approach works even with the
noisy tags of social users, provided that appropriate denoising is performed.
Experiments on a large scale setting show that our method can provide some
benefits even when the semantic space is estimated on a subset of training
images.
","[{'version': 'v1', 'created': 'Mon, 16 May 2016 13:45:15 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Aug 2016 18:24:00 GMT'}, {'version': 'v3', 'created': 'Thu, 1 Jun 2017 13:21:02 GMT'}]",2017-06-02,"[['Uricchio', 'Tiberio', ''], ['Ballan', 'Lamberto', ''], ['Seidenari', 'Lorenzo', ''], ['Del Bimbo', 'Alberto', '']]","['Automatic image annotation', 'Image tagging', 'Label transfer', 'Canonical correlation', 'Semantic space']"
11545,2210.09215,Ashad Kabir,"Md Ekramul Hossain, Muhammad Ashad Kabir, Lihong Zheng, Dave L. Swain,
  Shawn McGrath, Jonathan Medway","A Systematic Review of Machine Learning Techniques for Cattle
  Identification: Datasets, Methods and Future Directions","34 pages, 14 figures","Artificial Intelligence in Agriculture, Volume 6, 2022, Pages
  138-155",10.1016/j.aiia.2022.09.002,,cs.CV cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Increased biosecurity and food safety requirements may increase demand for
efficient traceability and identification systems of livestock in the supply
chain. The advanced technologies of machine learning and computer vision have
been applied in precision livestock management, including critical disease
detection, vaccination, production management, tracking, and health monitoring.
This paper offers a systematic literature review (SLR) of vision-based cattle
identification. More specifically, this SLR is to identify and analyse the
research related to cattle identification using Machine Learning (ML) and Deep
Learning (DL). For the two main applications of cattle detection and cattle
identification, all the ML based papers only solve cattle identification
problems. However, both detection and identification problems were studied in
the DL based papers. Based on our survey report, the most used ML models for
cattle identification were support vector machine (SVM), k-nearest neighbour
(KNN), and artificial neural network (ANN). Convolutional neural network (CNN),
residual network (ResNet), Inception, You Only Look Once (YOLO), and Faster
R-CNN were popular DL models in the selected papers. Among these papers, the
most distinguishing features were the muzzle prints and coat patterns of
cattle. Local binary pattern (LBP), speeded up robust features (SURF),
scale-invariant feature transform (SIFT), and Inception or CNN were identified
as the most used feature extraction methods.
","[{'version': 'v1', 'created': 'Thu, 13 Oct 2022 14:10:12 GMT'}]",2022-10-18,"[['Hossain', 'Md Ekramul', ''], ['Kabir', 'Muhammad Ashad', ''], ['Zheng', 'Lihong', ''], ['Swain', 'Dave L.', ''], ['McGrath', 'Shawn', ''], ['Medway', 'Jonathan', '']]","['Cattle identification', 'cattle detection', 'machine learning', 'deep learning', 'cattle farming']"
11546,2003.06959,Pei Xu,Pei Xu and Ioannis Karamouzas,"PFPN: Continuous Control of Physically Simulated Characters using
  Particle Filtering Policy Network","Motion, Interaction and Games (MIG '21)",,10.1145/3487983.3488301,,cs.LG cs.GR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data-driven methods for physics-based character control using reinforcement
learning have been successfully applied to generate high-quality motions.
However, existing approaches typically rely on Gaussian distributions to
represent the action policy, which can prematurely commit to suboptimal actions
when solving high-dimensional continuous control problems for
highly-articulated characters. In this paper, to improve the learning
performance of physics-based character controllers, we propose a framework that
considers a particle-based action policy as a substitute for Gaussian policies.
We exploit particle filtering to dynamically explore and discretize the action
space, and track the posterior policy represented as a mixture distribution.
The resulting policy can replace the unimodal Gaussian policy which has been
the staple for character control problems, without changing the underlying
model architecture of the reinforcement learning algorithm used to perform
policy optimization. We demonstrate the applicability of our approach on
various motion capture imitation tasks. Baselines using our particle-based
policies achieve better imitation performance and speed of convergence as
compared to corresponding implementations using Gaussians, and are more robust
to external perturbations during character control. Related code is available
at: https://motion-lab.github.io/PFPN.
","[{'version': 'v1', 'created': 'Mon, 16 Mar 2020 00:35:36 GMT'}, {'version': 'v2', 'created': 'Sat, 3 Oct 2020 15:27:37 GMT'}, {'version': 'v3', 'created': 'Tue, 13 Oct 2020 22:49:38 GMT'}, {'version': 'v4', 'created': 'Fri, 1 Oct 2021 14:09:40 GMT'}]",2021-10-06,"[['Xu', 'Pei', ''], ['Karamouzas', 'Ioannis', '']]","['character animation', 'physics-based control', 'reinforcement learning']"
11547,2109.09290,Tianfu He,"Tianfu He, Guochun Chen, Chuishi Meng, Huajun He, Zheyi Pan, Yexin Li,
  Sijie Ruan, Huimin Ren, Ye Yuan, Ruiyuan Li, Junbo Zhang, Jie Bao, Hui He, Yu
  Zheng",POI Alias Discovery in Delivery Addresses using User Locations,,,10.1145/3474717.3483950,,cs.SI cs.DB cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  People often refer to a place of interest (POI) by an alias. In e-commerce
scenarios, the POI alias problem affects the quality of the delivery address of
online orders, bringing substantial challenges to intelligent logistics systems
and market decision-making. Labeling the aliases of POIs involves heavy human
labor, which is inefficient and expensive. Inspired by the observation that the
users' GPS locations are highly related to their delivery address, we propose a
ubiquitous alias discovery framework. Firstly, for each POI name in delivery
addresses, the location data of its associated users, namely Mobility Profile
are extracted. Then, we identify the alias relationship by modeling the
similarity of mobility profiles. Comprehensive experiments on the large-scale
location data and delivery address data from JD logistics validate the
effectiveness.
","[{'version': 'v1', 'created': 'Mon, 20 Sep 2021 04:11:46 GMT'}]",2021-09-21,"[['He', 'Tianfu', ''], ['Chen', 'Guochun', ''], ['Meng', 'Chuishi', ''], ['He', 'Huajun', ''], ['Pan', 'Zheyi', ''], ['Li', 'Yexin', ''], ['Ruan', 'Sijie', ''], ['Ren', 'Huimin', ''], ['Yuan', 'Ye', ''], ['Li', 'Ruiyuan', ''], ['Zhang', 'Junbo', ''], ['Bao', 'Jie', ''], ['He', 'Hui', ''], ['Zheng', 'Yu', '']]","['Logistics', 'E-Commerce', 'Location Data Mining', 'Crowd-sensing', 'Geographic Information System', 'Urban Computing']"
11548,2001.09330,Amedeo Buonanno,"Giovanni Di Gennaro, Amedeo Buonanno, Antonio Di Girolamo, Armando
  Ospedale, Francesco A.N. Palmieri",Intent Classification in Question-Answering Using LSTM Architectures,"Presented at the 2019 Italian Workshop on Neural Networks (WIRN'19) -
  June 2019","Progresses in Artificial Intelligence and Neural Systems. Smart
  Innovation, Systems and Technologies, vol 184. Springer, Singapore - First
  Online: July 2020",10.1007/978-981-15-5093-5_11,,cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Question-answering (QA) is certainly the best known and probably also one of
the most complex problem within Natural Language Processing (NLP) and
artificial intelligence (AI). Since the complete solution to the problem of
finding a generic answer still seems far away, the wisest thing to do is to
break down the problem by solving single simpler parts. Assuming a modular
approach to the problem, we confine our research to intent classification for
an answer, given a question. Through the use of an LSTM network, we show how
this type of classification can be approached effectively and efficiently, and
how it can be properly used within a basic prototype responder.
","[{'version': 'v1', 'created': 'Sat, 25 Jan 2020 15:07:07 GMT'}]",2020-08-11,"[['Di Gennaro', 'Giovanni', ''], ['Buonanno', 'Amedeo', ''], ['Di Girolamo', 'Antonio', ''], ['Ospedale', 'Armando', ''], ['Palmieri', 'Francesco A. N.', '']]","['Deep Learning', 'LSTM', 'Intent classification', 'Question-Answering']"
11549,1911.04680,Evgeny Tsykunov,"Evgeny Tsykunov, Roman Ibrahimov, Derek Vasquez, Dzmitry Tsetserukou","SlingDrone: Mixed Reality System for Pointing and Interaction Using a
  Single Drone",ACM VRST 2019 conference,,10.1145/3359996.3364271,,cs.RO cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose SlingDrone, a novel Mixed Reality interaction paradigm that
utilizes a micro-quadrotor as both pointing controller and interactive robot
with a slingshot motion type. The drone attempts to hover at a given position
while the human pulls it in desired direction using a hand grip and a leash.
Based on the displacement, a virtual trajectory is defined. To allow for
intuitive and simple control, we use virtual reality (VR) technology to trace
the path of the drone based on the displacement input. The user receives force
feedback propagated through the leash. Force feedback from SlingDrone coupled
with visualized trajectory in VR creates an intuitive and user friendly
pointing device. When the drone is released, it follows the trajectory that was
shown in VR. Onboard payload (e.g. magnetic gripper) can perform various
scenarios for real interaction with the surroundings, e.g. manipulation or
sensing. Unlike HTC Vive controller, SlingDrone does not require handheld
devices, thus it can be used as a standalone pointing technology in VR.
","[{'version': 'v1', 'created': 'Tue, 12 Nov 2019 05:30:24 GMT'}]",2019-11-13,"[['Tsykunov', 'Evgeny', ''], ['Ibrahimov', 'Roman', ''], ['Vasquez', 'Derek', ''], ['Tsetserukou', 'Dzmitry', '']]","['human-robot interaction', 'mixed reality', 'quadrotor', 'haptics']"
11550,2106.04405,Vasileios Perifanis,Vasileios Perifanis and Pavlos S. Efraimidis,Federated Neural Collaborative Filtering,,,10.1016/j.knosys.2022.108441,,cs.IR cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we present a federated version of the state-of-the-art Neural
Collaborative Filtering (NCF) approach for item recommendations. The system,
named FedNCF, enables learning without requiring users to disclose or transmit
their raw data. Data localization preserves data privacy and complies with
regulations such as the GDPR. Although federated learning enables model
training without local data dissemination, the transmission of raw clients'
updates raises additional privacy issues. To address this challenge, we
incorporate a privacy-preserving aggregation method that satisfies the security
requirements against an honest but curious entity. We argue theoretically and
experimentally that existing aggregation algorithms are inconsistent with
latent factor model updates. We propose an enhancement by decomposing the
aggregation step into matrix factorization and neural network-based averaging.
Experimental validation shows that FedNCF achieves comparable recommendation
quality to the original NCF system, while our proposed aggregation leads to
faster convergence compared to existing methods. We investigate the
effectiveness of the federated recommender system and evaluate the
privacy-preserving mechanism in terms of computational cost.
","[{'version': 'v1', 'created': 'Wed, 2 Jun 2021 21:05:41 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Feb 2022 07:22:39 GMT'}]",2022-02-17,"[['Perifanis', 'Vasileios', ''], ['Efraimidis', 'Pavlos S.', '']]","['Federated Learning', 'Privacy', 'Collaborative Filtering', 'Matrix Factorization', 'Neural Networks']"
11551,2210.07660,Ge Fan,"Ge Fan, Chaoyun Zhang, Kai Wang, Junyang Chen","MV-HAN: A Hybrid Attentive Networks based Multi-View Learning Model for
  Large-scale Contents Recommendation",accepted by ASE 2022,,10.1145/3551349.3559496,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Industrial recommender systems usually employ multi-source data to improve
the recommendation quality, while effectively sharing information between
different data sources remain a challenge. In this paper, we introduce a novel
Multi-View Approach with Hybrid Attentive Networks (MV-HAN) for contents
retrieval at the matching stage of recommender systems. The proposed model
enables high-order feature interaction from various input features while
effectively transferring knowledge between different types. By employing a
well-placed parameters sharing strategy, the MV-HAN substantially improves the
retrieval performance in sparse types. The designed MV-HAN inherits the
efficiency advantages in the online service from the two-tower model, by
mapping users and contents of different types into the same features space.
This enables fast retrieval of similar contents with an approximate nearest
neighbor algorithm. We conduct offline experiments on several industrial
datasets, demonstrating that the proposed MV-HAN significantly outperforms
baselines on the content retrieval tasks. Importantly, the MV-HAN is deployed
in a real-world matching system. Online A/B test results show that the proposed
method can significantly improve the quality of recommendations.
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2022 09:23:28 GMT'}]",2022-10-17,"[['Fan', 'Ge', ''], ['Zhang', 'Chaoyun', ''], ['Wang', 'Kai', ''], ['Chen', 'Junyang', '']]","['Recommender Systems', 'Transfer Learning', 'Multi-View Learning', 'Deep Learning']"
11552,2107.14290,Antonio Ferrara,"Vito Walter Anelli, Tommaso Di Noia, Eugenio Di Sciascio, Antonio
  Ferrara, Alberto Carlo Maria Mancino","Sparse Feature Factorization for Recommender Systems with Knowledge
  Graphs",,,10.1145/3460231.3474243,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Deep Learning and factorization-based collaborative filtering recommendation
models have undoubtedly dominated the scene of recommender systems in recent
years. However, despite their outstanding performance, these methods require a
training time proportional to the size of the embeddings and it further
increases when also side information is considered for the computation of the
recommendation list. In fact, in these cases we have that with a large number
of high-quality features, the resulting models are more complex and difficult
to train. This paper addresses this problem by presenting KGFlex: a sparse
factorization approach that grants an even greater degree of expressiveness. To
achieve this result, KGFlex analyzes the historical data to understand the
dimensions the user decisions depend on (e.g., movie direction, musical genre,
nationality of book writer). KGFlex represents each item feature as an
embedding and it models user-item interactions as a factorized entropy-driven
combination of the item attributes relevant to the user. KGFlex facilitates the
training process by letting users update only those relevant features on which
they base their decisions. In other words, the user-item prediction is mediated
by the user's personal view that considers only relevant features. An extensive
experimental evaluation shows the approach's effectiveness, considering the
recommendation results' accuracy, diversity, and induced bias. The public
implementation of KGFlex is available at https://split.to/kgflex.
","[{'version': 'v1', 'created': 'Thu, 29 Jul 2021 19:20:54 GMT'}]",2021-08-02,"[['Anelli', 'Vito Walter', ''], ['Di Noia', 'Tommaso', ''], ['Di Sciascio', 'Eugenio', ''], ['Ferrara', 'Antonio', ''], ['Mancino', 'Alberto Carlo Maria', '']]","['feature factorization', 'entropy', 'knowledge graphs']"
11553,2110.13410,Shiori Hironaka,Shiori Hironaka and Mitsuo Yoshida and Kyoji Umemura,"Comparison of Indicators of Location Homophily Using Twitter Follow
  Graph","The 2021 International Conference on Advanced Informatics: Concepts,
  Theory and Applications (ICAICTA 2021)",,10.1109/ICAICTA53211.2021.9640257,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Location homophily is a tendency of Twitter users whose followers tend to be
in the same or nearby areas. Intuitively, although users with a higher number
of follower relationships might have negative homophily indicators, it is worth
consulting actual Twitter data. Moreover, there may be certain functions
regarding the numbers of friends and followers that are more directly
correlated to the homophily. In this study, the ratio of the number of friends
to the number of followers is shown to be a more effective negative indicator
of homophily, and the results for 10 different countries are verified.
","[{'version': 'v1', 'created': 'Tue, 26 Oct 2021 04:44:51 GMT'}]",2022-04-15,"[['Hironaka', 'Shiori', ''], ['Yoshida', 'Mitsuo', ''], ['Umemura', 'Kyoji', '']]","['Homophily', 'location', 'follow ratio', 'social graph', 'social media', 'Twitter']"
11554,2010.08437,Chiayen Chiang,"Chia-Yen Chiang, Chloe Barnes, Plamen Angelov, and Richard Jiang",Deep Learning based Automated Forest Health Diagnosis from Aerial Images,16 pages,"IEEE Access, vol. 8, pp. 144064-144076, 2020",10.1109/ACCESS.2020.3012417.,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Global climate change has had a drastic impact on our environment. Previous
study showed that pest disaster occured from global climate change may cause a
tremendous number of trees died and they inevitably became a factor of forest
fire. An important portent of the forest fire is the condition of forests.
Aerial image-based forest analysis can give an early detection of dead trees
and living trees. In this paper, we applied a synthetic method to enlarge
imagery dataset and present a new framework for automated dead tree detection
from aerial images using a re-trained Mask RCNN (Mask Region-based
Convolutional Neural Network) approach, with a transfer learning scheme. We
apply our framework to our aerial imagery datasets,and compare eight fine-tuned
models. The mean average precision score (mAP) for the best of these models
reaches 54%. Following the automated detection, we are able to automatically
produce and calculate number of dead tree masks to label the dead trees in an
image, as an indicator of forest health that could be linked to the causal
analysis of environmental changes and the predictive likelihood of forest fire.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2020 15:07:56 GMT'}]",2020-10-19,"[['Chiang', 'Chia-Yen', ''], ['Barnes', 'Chloe', ''], ['Angelov', 'Plamen', ''], ['Jiang', 'Richard', '']]","['Deep learning', 'object detection', 'object segmentation', 'forestry', 'biodiversity']"
11555,2106.01900,Luca Mariot,"Mauro Castelli, Luca Manzoni, Luca Mariot, Marco S. Nobile, Andrea
  Tangherloni",Salp Swarm Optimization: a Critical Review,"25 pages, 6 figures. Published in Expert Systems with Applications","Expert Systems with Applications, Volume 189, 2022, 116029",10.1016/j.eswa.2021.116029,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the crowded environment of bio-inspired population-based metaheuristics,
the Salp Swarm Optimization (SSO) algorithm recently appeared and immediately
gained a lot of momentum. Inspired by the peculiar spatial arrangement of salp
colonies, which are displaced in long chains following a leader, this algorithm
seems to provide an interesting optimization performance. However, the original
work was characterized by some conceptual and mathematical flaws, which
influenced all ensuing papers on the subject. In this manuscript, we perform a
critical review of SSO, highlighting all the issues present in the literature
and their negative effects on the optimization process carried out by this
algorithm. We also propose a mathematically correct version of SSO, named
Amended Salp Swarm Optimizer (ASSO) that fixes all the discussed problems. We
benchmarked the performance of ASSO on a set of tailored experiments, showing
that it is able to achieve better results than the original SSO. Finally, we
performed an extensive study aimed at understanding whether SSO and its
variants provide advantages compared to other metaheuristics. The experimental
results, where SSO cannot outperform simple well-known metaheuristics, suggest
that the scientific community can safely abandon SSO.
","[{'version': 'v1', 'created': 'Thu, 3 Jun 2021 14:43:37 GMT'}, {'version': 'v2', 'created': 'Sat, 6 Nov 2021 11:07:58 GMT'}]",2021-11-09,"[['Castelli', 'Mauro', ''], ['Manzoni', 'Luca', ''], ['Mariot', 'Luca', ''], ['Nobile', 'Marco S.', ''], ['Tangherloni', 'Andrea', '']]","['Meta-heuristics', 'Global Optimization', 'Bound Constrained Optimization', 'Shift-Invariant Functions']"
11556,2104.01299,Jonathan Dunn,Jonathan Dunn,"Finding Variants for Construction-Based Dialectometry: A Corpus-Based
  Approach to Regional CxGs",,Cognitive Linguistics (2018),10.1515/cog-2017-0029,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  This paper develops a construction-based dialectometry capable of identifying
previously unknown constructions and measuring the degree to which a given
construction is subject to regional variation. The central idea is to learn a
grammar of constructions (a CxG) using construction grammar induction and then
to use these constructions as features for dialectometry. This offers a method
for measuring the aggregate similarity between regional CxGs without limiting
in advance the set of constructions subject to variation. The learned CxG is
evaluated on how well it describes held-out test corpora while dialectometry is
evaluated on how well it can model regional varieties of English. Themethod is
tested using two distinct datasets: First, the International Corpus of English
representing eight outer circle varieties; Second, a web-crawled corpus
representing five inner circle varieties. Results show that themethod (1)
produces a grammar with stable quality across sub-sets of a single corpus that
is (2) capable of distinguishing between regional varieties of Englishwith a
high degree of accuracy, thus (3) supporting dialectometricmethods formeasuring
the similarity between varieties of English and (4) measuring the degree to
which each construction is subject to regional variation. This is important for
cognitive sociolinguistics because it operationalizes the idea that competition
between constructions is organized at the functional level so that
dialectometry needs to represent as much of the available functional space as
possible.
","[{'version': 'v1', 'created': 'Sat, 3 Apr 2021 02:52:14 GMT'}]",2021-04-06,"[['Dunn', 'Jonathan', '']]","['construction grammar', 'CxG', 'dialectometry', 'dialectology', 'spatial variation']"
11557,2209.14503,Shoffan Saifullah,Shoffan Saifullah,Tourism's trend Ranking on Social Media Data Using Fuzzy-AHP vs. AHP,"7 pages, 5 Tables, 3 figures","JIKO (Jurnal Informatika dan Komputer), 6(2), 2022, 153-159",10.26798/jiko.v6i2.304,,cs.SI,http://creativecommons.org/licenses/by-sa/4.0/,"  Tourism is an exciting thing to be visited by people in the world. Search for
attractive and popular places can be done through social media. Data from
social media or websites can be used as a reference to find current travel
trends and get information about reviews, stories, likes, forums, blogs, and
feedback from a place. However, if the search is done manually one by one, it
takes a long time, and it becomes interesting to do research. So, searching
based on current trends will be easier and faster. For this reason, this study
uses a computer base to search by ranking tourist facilities from social media
data or websites using the multi-criteria decision-making (MCDM) method. The
implementation of the method used in finding the trend is the Fuzzy-AHP method
in comparison with the AHP. The data used is data reviews, stories, likes,
forums, blogs, and feedback from the web or social media. Because with these
components, tourism can be developed according to visitors\'' wishes. The
research aims to rank facilities\'' tourism attractions (trends) and
development priorities. The priority and ranking used the fuzzy-AHP and AHP
method to determine weight criteria and the ranking process. The highest
ranking is on the Parks/Picnic Spots attraction, and make it a priority to
develop. The methods have an average value MSE of all data is \approx 0.0002,
which can be used for this ranking.
","[{'version': 'v1', 'created': 'Thu, 29 Sep 2022 01:40:54 GMT'}]",2022-09-30,"[['Saifullah', 'Shoffan', '']]","['fuzzy-MCDM', 'ranking', 'social media', 'tourism trend']"
11558,2203.01672,Gabriel de Albuquerque Gleizer,"Gabriel de Albuquerque Gleizer and Khushraj Nanik Madnani and Manuel
  Mazo Jr","A Simpler Alternative: Minimizing Transition Systems Modulo Alternating
  Simulation Equivalence",Accepted at HSCC'22,,10.1145/3501710.3519534,,cs.FL cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  This paper studies the reduction (abstraction) of finite-state transition
systems for control synthesis problems. We revisit the notion of alternating
simulation equivalence (ASE), a more relaxed condition than alternating
bisimulations, to relate systems and their abstractions. As with alternating
bisimulations, ASE preserves the property that the existence of a controller
for the abstraction is necessary and sufficient for a controller to exist for
the original system. Moreover, being a less stringent condition, ASE can reduce
systems further to produce smaller abstractions. We provide an algorithm that
produces minimal AS equivalent abstractions. The theoretical results are then
applied to obtain (un)schedulability certificates of periodic event-triggered
control systems sharing a communication channel. A numerical example
illustrates the results.
","[{'version': 'v1', 'created': 'Thu, 3 Mar 2022 12:08:53 GMT'}]",2022-03-04,"[['Gleizer', 'Gabriel de Albuquerque', ''], ['Madnani', 'Khushraj Nanik', ''], ['Mazo', 'Manuel', 'Jr']]","['Alternating simulation', 'minimization', 'combinatorial games', 'controller synthesis', 'event-triggered control', 'scheduling']"
11559,2010.00844,Pawel Trajdos,"Pawel Trajdos, Robert Burduk",Linear Classifier Combination via Multiple Potential Functions,,"Pattern Recognition, 107681 (2020)",10.1016/j.patcog.2020.107681,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A vital aspect of the classification based model construction process is the
calibration of the scoring function. One of the weaknesses of the calibration
process is that it does not take into account the information about the
relative positions of the recognized objects in the feature space. To alleviate
this limitation, in this paper, we propose a novel concept of calculating a
scoring function based on the distance of the object from the decision boundary
and its distance to the class centroid. An important property is that the
proposed score function has the same nature for all linear base classifiers,
which means that outputs of these classifiers are equally represented and have
the same meaning. The proposed approach is compared with other ensemble
algorithms and experiments on multiple Keel datasets demonstrate the
effectiveness of our method. To discuss the results of our experiments, we use
multiple classification performance measures and statistical analysis.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2020 08:11:51 GMT'}]",2020-10-05,"[['Trajdos', 'Pawel', ''], ['Burduk', 'Robert', '']]","['Linear Classifier', 'Potential Function', 'Ensemble of Classifiers', 'Score Function']"
11560,2011.07946,C\'edric Beaulac,"C\'edric Beaulac, Jeffrey S. Rosenthal","Introducing a new high-resolution handwritten digits data set with
  writer characteristics","Data set available here :
  https://drive.google.com/drive/folders/1f2o1kjXLvcxRgtmMMuDkA2PQ5Zato4Or?usp=sharing","SN COMPUT. SCI. 4, 66 (2023)",10.1007/s42979-022-01494-2,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The contributions in this article are two-fold. First, we introduce a new
hand-written digit data set that we collected. It contains high-resolution
images of hand-written The contributions in this article are two-fold. First,
we introduce a new handwritten digit data set that we collected. It contains
high-resolution images of handwritten digits together with various writer
characteristics which are not available in the well-known MNIST database. The
multiple writer characteristics gathered are a novelty of our data set and
create new research opportunities. The data set is publicly available online.
Second, we analyse this new data set. We begin with simple supervised tasks. We
assess the predictability of the writer characteristics gathered, the effect of
using some of those characteristics as predictors in classification task and
the effect of higher resolution images on classification accuracy. We also
explore semi-supervised applications; we can leverage the high quantity of
handwritten digits data sets already existing online to improve the accuracy of
various classifications task with noticeable success. Finally, we also
demonstrate the generative perspective offered by this new data set; we are
able to generate images that mimics the writing style of specific writers. The
data set has unique and distinct features and our analysis establishes
benchmarks and showcases some of the new opportunities made possible with this
new data set.
","[{'version': 'v1', 'created': 'Wed, 4 Nov 2020 18:18:43 GMT'}, {'version': 'v2', 'created': 'Wed, 12 May 2021 18:37:41 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Apr 2022 21:46:00 GMT'}]",2022-11-29,"[['Beaulac', 'Cédric', ''], ['Rosenthal', 'Jeffrey S.', '']]","['Handwritten digit', 'Computer Vision', 'Writer Identification', 'Convolutional Neural']"
11561,2204.13016,Hao Wang,Hao Wang,"RankMat : Matrix Factorization with Calibrated Distributed Embedding and
  Fairness Enhancement",ICCIP 2021,,10.1145/3507971.3507976,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Matrix Factorization is a widely adopted technique in the field of
recommender system. Matrix Factorization techniques range from SVD, LDA, pLSA,
SVD++, MatRec, Zipf Matrix Factorization and Item2Vec. In recent years,
distributed word embeddings have inspired innovation in the area of recommender
systems. Word2vec and GloVe have been especially emphasized in many industrial
application scenario such as Xiaomi's recommender system. In this paper, we
propose a new matrix factorization inspired by the theory of power law and
GloVe. Instead of the exponential nature of GloVe model, we take advantage of
Pareto Distribution to model our loss function. Our method is explainable in
theory and easy-to-implement in practice. In the experiment section, we prove
our approach is superior to vanilla matrix factorization technique and
comparable with GloVe-based model in both accuracy and fairness metrics.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2022 15:42:18 GMT'}]",2022-04-28,"[['Wang', 'Hao', '']]","['GloVe', 'distributed word embedding', 'Pareto distribution', 'recommender system', 'matrix factorization']"
11562,2108.00433,Agi Kurucz,"Stanislav Kikot, Agi Kurucz, Vladimir Podolskii, Michael Zakharyaschev",Deciding boundedness of monadic sirups,,,10.1145/3452021.3458332,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that deciding boundedness (aka FO-rewritability) of monadic single
rule datalog programs (sirups) is 2Exp-hard, which matches the upper bound
known since 1988 and finally settles a long-standing open problem. We obtain
this result as a byproduct of an attempt to classify monadic `disjunctive
sirups' -- Boolean conjunctive queries q with unary and binary predicates
mediated by a disjunctive rule T(x)vF(x) <- A(x) -- according to the data
complexity of their evaluation. Apart from establishing that deciding
FO-rewritability of disjunctive sirups with a dag-shaped q is also 2Exp-hard,
we make substantial progress towards obtaining a complete FO/L-hardness
dichotomy of disjunctive sirups with ditree-shaped q.
","[{'version': 'v1', 'created': 'Sun, 1 Aug 2021 11:20:03 GMT'}]",2021-08-03,"[['Kikot', 'Stanislav', ''], ['Kurucz', 'Agi', ''], ['Podolskii', 'Vladimir', ''], ['Zakharyaschev', 'Michael', '']]","['Boundedness', 'monadic datalog', 'first-order rewritability', 'ontologymediated query']"
11563,2205.07277,Jessica Dai,"Jessica Dai, Sohini Upadhyay, Ulrich Aivodji, Stephen H. Bach,
  Himabindu Lakkaraju","Fairness via Explanation Quality: Evaluating Disparities in the Quality
  of Post hoc Explanations",As presented at AIES 2022,,10.1145/3514094.3534159,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  As post hoc explanation methods are increasingly being leveraged to explain
complex models in high-stakes settings, it becomes critical to ensure that the
quality of the resulting explanations is consistently high across various
population subgroups including the minority groups. For instance, it should not
be the case that explanations associated with instances belonging to a
particular gender subgroup (e.g., female) are less accurate than those
associated with other genders. However, there is little to no research that
assesses if there exist such group-based disparities in the quality of the
explanations output by state-of-the-art explanation methods. In this work, we
address the aforementioned gaps by initiating the study of identifying
group-based disparities in explanation quality. To this end, we first outline
the key properties which constitute explanation quality and where disparities
can be particularly problematic. We then leverage these properties to propose a
novel evaluation framework which can quantitatively measure disparities in the
quality of explanations output by state-of-the-art methods. Using this
framework, we carry out a rigorous empirical analysis to understand if and when
group-based disparities in explanation quality arise. Our results indicate that
such disparities are more likely to occur when the models being explained are
complex and highly non-linear. In addition, we also observe that certain post
hoc explanation methods (e.g., Integrated Gradients, SHAP) are more likely to
exhibit the aforementioned disparities. To the best of our knowledge, this work
is the first to highlight and study the problem of group-based disparities in
explanation quality. In doing so, our work sheds light on previously unexplored
ways in which explanation methods may introduce unfairness in real world
decision making.
","[{'version': 'v1', 'created': 'Sun, 15 May 2022 13:01:20 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Jul 2022 21:12:50 GMT'}]",2022-07-05,"[['Dai', 'Jessica', ''], ['Upadhyay', 'Sohini', ''], ['Aivodji', 'Ulrich', ''], ['Bach', 'Stephen H.', ''], ['Lakkaraju', 'Himabindu', '']]","['explainable machine learning', 'interpretability', 'fairness', 'robustness']"
11564,2101.03022,AKM Bahalul Haque,"A K M Bahalul Haque, Sonia Tasmin",Security Threats and Research Challenges of IoT-A Review,13 pages. 1 table,"Journal of Engineering Advancements Vol. 01(04) 2020, pp 170-182",10.38032/jea.2020.04.008,,cs.CR cs.NI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Internet of things (IoT) is the epitome of sustainable development. It has
facilitated the development of smart systems, industrialization, and the
state-of-the-art quality of life. IoT architecture is one of the essential
baselines of understanding the widespread adoption. Security issues are very
crucial for any technical infrastructure. Since IoT comprises heterogeneous
devices, its security issues are diverse too. Various security attacks can be
responsible for compromising confidentiality, integrity, and availability. In
this paper, at first, the IoT architecture is described briefly. After that,
the components of IoT are explained with perspective to various IoT based
applications and services. Finally, various security issues, including
recommended solutions, are elaborately described and the potential research
challenges and future research directions.
","[{'version': 'v1', 'created': 'Thu, 24 Dec 2020 17:42:05 GMT'}]",2021-01-11,"[['Haque', 'A K M Bahalul', ''], ['Tasmin', 'Sonia', '']]","['IoT', 'Security', 'Privacy', 'Attacks', 'Vulnerability', 'Threats', 'Challenges']"
11565,2111.13981,Dominic Baril,"Dominic Baril, Simon-Pierre Desch\^enes, Olivier Gamache, Maxime
  Vaidis, Damien LaRocque, Johann Laconte, Vladim\'ir Kubelka, Philippe
  Gigu\`ere, Fran\c{c}ois Pomerleau","Kilometer-scale autonomous navigation in subarctic forests: challenges
  and lessons learned",Published in Field Robotics Volume 2. Paper number 50,,10.55417/fr.2022050,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Challenges inherent to autonomous wintertime navigation in forests include
lack of reliable a Global Navigation Satellite System (GNSS) signal, low
feature contrast, high illumination variations and changing environment. This
type of off-road environment is an extreme case of situations autonomous cars
could encounter in northern regions. Thus, it is important to understand the
impact of this harsh environment on autonomous navigation systems. To this end,
we present a field report analyzing teach-and-repeat navigation in a subarctic
forest while subject to fluctuating weather, including light and heavy snow,
rain and drizzle. First, we describe the system, which relies on point cloud
registration to localize a mobile robot through a boreal forest, while
simultaneously building a map. We experimentally evaluate this system in over
18.8 km of autonomous navigation in the teach-and-repeat mode. Over 14 repeat
runs, only four manual interventions were required, three of which were due to
localization failure and another one caused by battery power outage. We show
that dense vegetation perturbs the GNSS signal, rendering it unsuitable for
navigation in forest trails. Furthermore, we highlight the increased
uncertainty related to localizing using point cloud registration in forest
trails. We demonstrate that it is not snow precipitation, but snow
accumulation, that affects our system's ability to localize within the
environment. Finally, we expose some challenges and lessons learned from our
field campaign to support better experimental work in winter conditions. Our
dataset is available online.
","[{'version': 'v1', 'created': 'Sat, 27 Nov 2021 20:39:53 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Jul 2022 20:44:10 GMT'}]",2022-07-28,"[['Baril', 'Dominic', ''], ['Deschênes', 'Simon-Pierre', ''], ['Gamache', 'Olivier', ''], ['Vaidis', 'Maxime', ''], ['LaRocque', 'Damien', ''], ['Laconte', 'Johann', ''], ['Kubelka', 'Vladimír', ''], ['Giguère', 'Philippe', ''], ['Pomerleau', 'François', '']]","['SLAM', 'extreme environments', 'winter', 'navigation', 'GPS-denied operation']"
11566,2209.01244,Ashwin Kallingal Joshy,"Ashwin Kallingal Joshy, Wei Le",FuzzerAid: Grouping Fuzzed Crashes Based On Fault Signatures,"In 37th IEEE/ACM International Conference on Automated Software
  Engineering, October 10 to 14, 2022, Rochester, MI, USA. 12 pages",,10.1145/3551349.35569,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Fuzzing has been an important approach for finding bugs and vulnerabilities
in programs. Many fuzzers deployed in industry run daily and can generate an
overwhelming number of crashes. Diagnosing such crashes can be very challenging
and time-consuming. Existing fuzzers typically employ heuristics such as code
coverage or call stack hashes to weed out duplicate reporting of bugs. While
these heuristics are cheap, they are often imprecise and end up still reporting
many ""unique"" crashes corresponding to the same bug. In this paper, we present
FuzzerAid that uses fault signatures to group crashes reported by the fuzzers.
Fault signature is a small executable program and consists of a selection of
necessary statements from the original program that can reproduce a bug. In our
approach, we first generate a fault signature using a given crash. We then
execute the fault signature with other crash inducing inputs. If the failure is
reproduced, we classify the crashes into the group labeled with the fault
signature; if not, we generate a new fault signature. After all the crash
inducing inputs are classified, we further merge the fault signatures of the
same root cause into a group. We implemented our approach in a tool called
FuzzerAid and evaluated it on 3020 crashes generated from 15 real-world bugs
and 4 large open source projects. Our evaluation shows that we are able to
correctly group 99.1% of the crashes and reported only 17 (+2) ""unique"" bugs,
outperforming the state-of-the-art fuzzers.
","[{'version': 'v1', 'created': 'Fri, 2 Sep 2022 19:15:48 GMT'}]",2022-09-07,"[['Joshy', 'Ashwin Kallingal', ''], ['Le', 'Wei', '']]","['fault signatures', 'grouping crashes', 'fuzzers', 'fault localization', 'deduplication']"
11567,1910.07225,Julian Stier,Julian Stier and Michael Granitzer,Structural Analysis of Sparse Neural Networks,"23rd International Conference on Knowledge-Based and Intelligent
  Information & Engineering Systems","Procedia Computer Science, 2018",10.1016/j.procs.2019.09.165,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sparse Neural Networks regained attention due to their potential for
mathematical and computational advantages. We give motivation to study
Artificial Neural Networks (ANNs) from a network science perspective, provide a
technique to embed arbitrary Directed Acyclic Graphs into ANNs and report study
results on predicting the performance of image classifiers based on the
structural properties of the networks' underlying graph. Results could further
progress neuroevolution and add explanations for the success of distinct
architectures from a structural perspective.
","[{'version': 'v1', 'created': 'Wed, 16 Oct 2019 09:08:42 GMT'}]",2021-12-15,"[['Stier', 'Julian', ''], ['Granitzer', 'Michael', '']]","['artificial neural networks', 'sparse network structures', 'smallworld neural networks', 'scale-free', 'architecture performance estimation']"
11568,2010.03265,Michael Lyons,"Gamhewage C. de Silva, Tamara Smyth, Michael J. Lyons","A Novel Face-tracking Mouth Controller and its Application to
  Interacting with Bioacoustic Models","Proceedings of the International Conference on New Interfaces for
  Musical Expression, 2004 (NIME-04)",,10.5281/zenodo.1176666,,cs.HC cs.CV cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  We describe a simple, computationally light, real-time system for tracking
the lower face and extracting information about the shape of the open mouth
from a video sequence. The system allows unencumbered control of audio
synthesis modules by the action of the mouth. We report work in progress to use
the mouth controller to interact with a physical model of sound production by
the avian syrinx.
","[{'version': 'v1', 'created': 'Wed, 7 Oct 2020 08:36:43 GMT'}]",2020-10-08,"[['de Silva', 'Gamhewage C.', ''], ['Smyth', 'Tamara', ''], ['Lyons', 'Michael J.', '']]","['Mouth Controller', 'Face Tracking', 'Bioacoustics']"
11569,1812.08259,Lovro \v{S}ubelj,"Lovro \v{S}ubelj, Ludo Waltman, Vincent Traag, Nees Jan van Eck",Intermediacy of publications,"19 pages, 7 figures, 2 tables","R. Soc. Open Sci. 7(1), 190207 (2020)",10.1098/rsos.190207,,cs.DL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Citation networks of scientific publications offer fundamental insights into
the structure and development of scientific knowledge. We propose a new
measure, called intermediacy, for tracing the historical development of
scientific knowledge. Given two publications, an older and a more recent one,
intermediacy identifies publications that seem to play a major role in the
historical development from the older to the more recent publication. The
identified publications are important in connecting the older and the more
recent publication in the citation network. After providing a formal definition
of intermediacy, we study its mathematical properties. We then present two
empirical case studies, one tracing historical developments at the interface
between the community detection literature and the scientometric literature and
one examining the development of the literature on peer review. We show both
conceptually and empirically how intermediacy differs from main path analysis,
which is the most popular approach for tracing historical developments in
citation networks. Main path analysis tends to favor longer paths over shorter
ones, whereas intermediacy has the opposite tendency. Compared to main path
analysis, we conclude that intermediacy offers a more principled approach for
tracing the historical development of scientific knowledge.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2018 21:39:52 GMT'}, {'version': 'v2', 'created': 'Sun, 3 Nov 2019 17:46:12 GMT'}]",2020-01-16,"[['Šubelj', 'Lovro', ''], ['Waltman', 'Ludo', ''], ['Traag', 'Vincent', ''], ['van Eck', 'Nees Jan', '']]","['intermediacy', 'publication', 'citation']"
11570,1905.11096,Juli\'an Urbano,"Juli\'an Urbano, Harlley Lima, Alan Hanjalic","Statistical Significance Testing in Information Retrieval: An Empirical
  Analysis of Type I, Type II and Type III Errors","10 pages, 6 figures, SIGIR 2019",,10.1145/3331184.3331259,,cs.IR cs.DL cs.LG stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Statistical significance testing is widely accepted as a means to assess how
well a difference in effectiveness reflects an actual difference between
systems, as opposed to random noise because of the selection of topics.
According to recent surveys on SIGIR, CIKM, ECIR and TOIS papers, the t-test is
the most popular choice among IR researchers. However, previous work has
suggested computer intensive tests like the bootstrap or the permutation test,
based mainly on theoretical arguments. On empirical grounds, others have
suggested non-parametric alternatives such as the Wilcoxon test. Indeed, the
question of which tests we should use has accompanied IR and related fields for
decades now. Previous theoretical studies on this matter were limited in that
we know that test assumptions are not met in IR experiments, and empirical
studies were limited in that we do not have the necessary control over the null
hypotheses to compute actual Type I and Type II error rates under realistic
conditions. Therefore, not only is it unclear which test to use, but also how
much trust we should put in them. In contrast to past studies, in this paper we
employ a recent simulation methodology from TREC data to go around these
limitations. Our study comprises over 500 million p-values computed for a range
of tests, systems, effectiveness measures, topic set sizes and effect sizes,
and for both the 2-tail and 1-tail cases. Having such a large supply of IR
evaluation data with full knowledge of the null hypotheses, we are finally in a
position to evaluate how well statistical significance tests really behave with
IR data, and make sound recommendations for practitioners.
","[{'version': 'v1', 'created': 'Mon, 27 May 2019 10:02:29 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Jun 2019 22:18:34 GMT'}]",2019-06-07,"[['Urbano', 'Julián', ''], ['Lima', 'Harlley', ''], ['Hanjalic', 'Alan', '']]","['Statistical significance', 'Student’s t-test', 'Wilcoxon test', 'Sign test', 'Bootstrap', 'Permutation', 'Simulation', 'Type I and Type II errors']"
11571,1712.07416,Jonas Cleve,Jonas Cleve and Wolfgang Mulzer,Combinatorics of Beacon-based Routing in Three Dimensions,"v1 published in ""LATIN 2018: Theoretical Informatics""; v2 to be
  published in ""Computational Geometry - Theory and Application""","Computational Geometry: Theory and Applications (CGTA), 91, 2020,
  Article 101667",10.1016/j.comgeo.2020.101667,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A beacon is a point-like object which can be enabled to exert a magnetic pull
on other point-like objects in space. Those objects then move towards the
beacon in a greedy fashion until they are either stuck at an obstacle or reach
the beacon's location. Beacons placed inside polyhedra can be used to route
point-like objects from one location to another. A second use case is to cover
a polyhedron such that every point-like object at an arbitrary location in the
polyhedron can reach at least one of the beacons once the latter is activated.
  The notion of beacon-based routing and guarding was introduced by Biro et al.
[FWCG'11] in 2011 and covered in detail by Biro in his PhD thesis [SUNY-SB'13],
which focuses on the two-dimensional case.
  We extend Biro's result to three dimensions by considering beacon routing in
polyhedra. We show that $\lfloor\frac{m+1}{3}\rfloor$ beacons are always
sufficient and sometimes necessary to route between any pair of points in a
given polyhedron $P$, where $m$ is the number of tetrahedra in a tetrahedral
decomposition of $P$. This is one of the first results that show that beacon
routing is also possible in three dimensions.
","[{'version': 'v1', 'created': 'Wed, 20 Dec 2017 11:07:00 GMT'}, {'version': 'v2', 'created': 'Sat, 23 May 2020 11:32:22 GMT'}]",2020-06-09,"[['Cleve', 'Jonas', ''], ['Mulzer', 'Wolfgang', '']]","['beacon routing', 'three dimensions', 'polytopes']"
11572,2207.13066,Jiawei Liu,"Jiawei Liu, Jinkun Lin, Fabian Ruffy, Cheng Tan, Jinyang Li, Aurojit
  Panda, Lingming Zhang","NNSmith: Generating Diverse and Valid Test Cases for Deep Learning
  Compilers",,,10.1145/3575693.3575707,,cs.LG cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep-learning (DL) compilers such as TVM and TensorRT are increasingly being
used to optimize deep neural network (DNN) models to meet performance, resource
utilization and other requirements. Bugs in these compilers can result in
models whose semantics differ from the original ones, producing incorrect
results that corrupt the correctness of downstream applications. However,
finding bugs in these compilers is challenging due to their complexity. In this
work, we propose a new fuzz testing approach for finding bugs in deep-learning
compilers. Our core approach consists of (i) generating diverse yet valid DNN
test models that can exercise a large part of the compiler's transformation
logic using light-weight operator specifications; (ii) performing
gradient-based search to find model inputs that avoid any floating-point
exceptional values during model execution, reducing the chance of missed bugs
or false alarms; and (iii) using differential testing to identify bugs. We
implemented this approach in NNSmith which has found 72 new bugs for TVM,
TensorRT, ONNXRuntime, and PyTorch to date. Of these 58 have been confirmed and
51 have been fixed by their respective project maintainers.
","[{'version': 'v1', 'created': 'Tue, 26 Jul 2022 17:39:51 GMT'}, {'version': 'v2', 'created': 'Fri, 30 Dec 2022 01:06:16 GMT'}]",2023-01-02,"[['Liu', 'Jiawei', ''], ['Lin', 'Jinkun', ''], ['Ruffy', 'Fabian', ''], ['Tan', 'Cheng', ''], ['Li', 'Jinyang', ''], ['Panda', 'Aurojit', ''], ['Zhang', 'Lingming', '']]","['Fuzzing', 'Compiler Testing', 'Deep Learning Compilers']"
11573,1907.04698,Ravin Kumar,Ravin Kumar,"A Theoretical Model For Artificial Learning, Memory Management And
  Decision Making System","3 pages (2 columns per page), 5 figures",,10.31219/osf.io/b4wsr,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human beings are considered as the most intelligent species on Earth. The
ability to think, to create, to innovate, are the key elements which make
humans superior over other existing species on Earth. Machines lack all those
elements, although machines are faster than human in aspects like computing,
equating etc. But humans are still more valuable than machines, due to all
those previously discussed elements. Various models have been developed in last
few years to create models that can think like human beings, but are not
completely successful. This paper presents a new theoretical system for
learning, memory management and decision making that can be used to develop
highly complex systems, and shows the potential to be used for development of
systems that can be used to provide the essential features to the machines to
act like human beings.
","[{'version': 'v1', 'created': 'Tue, 2 Jul 2019 02:51:20 GMT'}]",2019-07-11,"[['Kumar', 'Ravin', '']]","['\xad \xa0 Artificial \xa0 Human', 'Learning \xa0 algorithm', 'ArtificialBrain', 'Artificial\xa0Memory\xa0Management', 'and\xa0Robotics']"
11574,2104.08761,Shaoning Li,"Yipeng Ji, Jingyi Wang, Shaoning Li, Yangyang Li, Shenwen Lin, Xiong
  Li","An Anomaly Event Detection Method Based on GNN Algorithm for Multi-data
  Sources",Accepted by BSCI 2021,,10.1145/3457337.3457846,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Anomaly event detection is crucial for critical infrastructure
security(transportation system, social-ecological sector, insurance service,
government sector etc.) due to its ability to reveal and address the potential
cyber-threats in advance by analysing the data(messages, microblogs, logs etc.)
from digital systems and networks. However, the convenience and applicability
of smart devices and the maturity of connected technology make the social
anomaly events data multi-source and dynamic, which result in the
inadaptability for multi-source data detection and thus affect the critical
infrastructure security. To effectively address the proposed problems, in this
paper, we design a novel anomaly detection method based on multi-source data.
First, we leverage spectral clustering algorithm for feature extraction and
fusion of multiple data sources. Second, by harnessing the power of deep graph
neural network(Deep-GNN), we perform a fine-gained anomaly social event
detection, revealing the threatening events and guarantee the critical
infrastructure security. Experimental results demonstrate that our framework
outperforms other baseline anomaly event detection methods and shows high
tracking accuracy, strong robustness and stability.
","[{'version': 'v1', 'created': 'Sun, 18 Apr 2021 07:50:30 GMT'}]",2021-04-20,"[['Ji', 'Yipeng', ''], ['Wang', 'Jingyi', ''], ['Li', 'Shaoning', ''], ['Li', 'Yangyang', ''], ['Lin', 'Shenwen', ''], ['Li', 'Xiong', '']]","['Secure Critical Infrastructure', 'Graph Neural Networks', 'AnomalyEvent Detection']"
11575,2001.04074,Farhana Sultana,"Farhana Sultana (1), Abu Sufian (1) and Paramartha Dutta (2), ((1)
  Dept. of Computer Science, University of Gour Banga, (2) Dept. of Computer &
  System Sciences, Visva-Bharati University)","Evolution of Image Segmentation using Deep Convolutional Neural Network:
  A Survey","38 pages, 29 figures, 8 tables","journal = ""Knowledge-Based Systems"", volume = ""201-202"", pages =
  ""106062"", year = ""2020""",10.1016/j.knosys.2020.106062,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  From the autonomous car driving to medical diagnosis, the requirement of the
task of image segmentation is everywhere. Segmentation of an image is one of
the indispensable tasks in computer vision. This task is comparatively
complicated than other vision tasks as it needs low-level spatial information.
Basically, image segmentation can be of two types: semantic segmentation and
instance segmentation. The combined version of these two basic tasks is known
as panoptic segmentation. In the recent era, the success of deep convolutional
neural networks (CNN) has influenced the field of segmentation greatly and gave
us various successful models to date. In this survey, we are going to take a
glance at the evolution of both semantic and instance segmentation work based
on CNN. We have also specified comparative architectural details of some
state-of-the-art models and discuss their training details to present a lucid
understanding of hyper-parameter tuning of those models. We have also drawn a
comparison among the performance of those models on different datasets. Lastly,
we have given a glimpse of some state-of-the-art panoptic segmentation models.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2020 06:07:27 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Feb 2020 11:01:02 GMT'}, {'version': 'v3', 'created': 'Fri, 29 May 2020 07:23:43 GMT'}]",2020-06-01,"[['Sultana', 'Farhana', ''], ['Sufian', 'Abu', ''], ['Dutta', 'Paramartha', '']]","['Convolutional Neural Network', 'Deep Learning', 'Semantic Segmentation', 'Instance Segmentation', 'Panoptic Segmentation', 'Survey']"
11576,2211.03285,Hiromu Yakura,"Yuki Koike, Hiroyuki Katsura, Hiromu Yakura, Yuma Kurogome",SLOPT: Bandit Optimization Framework for Mutation-Based Fuzzing,"To appear in Proceedings of the 2022 Annual Computer Security
  Applications Conference (ACSAC '22)",,10.1145/3564625.3564659,,cs.CR cs.LG cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mutation-based fuzzing has become one of the most common vulnerability
discovery solutions over the last decade. Fuzzing can be optimized when
targeting specific programs, and given that, some studies have employed online
optimization methods to do it automatically, i.e., tuning fuzzers for any given
program in a program-agnostic manner. However, previous studies have neither
fully explored mutation schemes suitable for online optimization methods, nor
online optimization methods suitable for mutation schemes. In this study, we
propose an optimization framework called SLOPT that encompasses both a
bandit-friendly mutation scheme and mutation-scheme-friendly bandit algorithms.
The advantage of SLOPT is that it can generally be incorporated into existing
fuzzers, such as AFL and Honggfuzz. As a proof of concept, we implemented
SLOPT-AFL++ by integrating SLOPT into AFL++ and showed that the
program-agnostic optimization delivered by SLOPT enabled SLOPT-AFL++ to achieve
higher code coverage than AFL++ in all of ten real-world FuzzBench programs.
Moreover, we ran SLOPT-AFL++ against several real-world programs from OSS-Fuzz
and successfully identified three previously unknown vulnerabilities, even
though these programs have been fuzzed by AFL++ for a considerable number of
CPU days on OSS-Fuzz.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2022 03:39:00 GMT'}]",2022-11-08,"[['Koike', 'Yuki', ''], ['Katsura', 'Hiroyuki', ''], ['Yakura', 'Hiromu', ''], ['Kurogome', 'Yuma', '']]","['grey-box fuzzing', 'mutation-based fuzzing', 'online optimization']"
11577,2109.11718,Chengqing Li,"Sheng Liu, Chengqing Li, Qiao Hu","Cryptanalyzing two image encryption algorithms based on a first-order
  time-delay system","10 pages, 5 figures, 2 tables","IEEE MultiMedia, 2021",10.1109/MMUL.2021.3114589,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Security is a key problem for the transmission, interchange and storage
process of multimedia systems and applications. In 2018, M. Li et al. proposed
in-depth security analysis on an image encryption algorithm based on a
first-order time-delay system (IEATD) and gave a specific chosen-plaintext
attack on it. Moreover, an enhanced version called as IEACD was designed to fix
the reported security defects. This paper analyzes the essential structures of
the two algorithms and evaluates their real security performances: 1) no
efficient nonlinear operations are adopted to assure the sensibility of
keystream; 2) the equivalent secret key of IEATD can be efficiently recovered
from one known plain-image and the corresponding cipher-image; 3) IEACD can
still be efficiently cracked with a chosen-plaintext attack. Both rigorous
theoretical analyses and detailed experimental results are provided to
demonstrate effectiveness of the advanced cryptanalytic methods.
","[{'version': 'v1', 'created': 'Fri, 24 Sep 2021 02:46:44 GMT'}]",2021-09-27,"[['Liu', 'Sheng', ''], ['Li', 'Chengqing', ''], ['Hu', 'Qiao', '']]","['Chosen-plaintext attack', 'cryptanalysis', 'image encryption', 'chaotic cryptography', 'image privacy']"
11578,1910.11691,Andreas Stolcke,Andreas Stolcke,"Improving Diarization Robustness using Diversification, Randomization
  and the DOVER Algorithm","Revised and expanded. To appear in Proc. Odyssey Speaker and Language
  Recognition Workshop. arXiv admin note: text overlap with arXiv:1909.08090","Proc. Odyssey Speaker and Language Recognition Workshop, May 2020,
  pp. 95-101",10.21437/Odyssey.2020-14,,cs.CL cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Speaker diarization based on bottom-up clustering of speech segments by
acoustic similarity is often highly sensitive to the choice of hyperparameters,
such as the initial number of clusters and feature weighting. Optimizing these
hyperparameters is difficult and often not robust across different data sets.
We recently proposed the DOVER algorithm for combining multiple diarization
hypotheses by voting. Here we propose to mitigate the robustness problem in
diarization by using DOVER to average across different parameter choices. We
also investigate the combination of diverse outputs obtained by following
different merge choices pseudo-randomly in the course of clustering, thereby
mitigating the greediness of best-first clustering. We show on two conference
meeting data sets drawn from NIST evaluations that the proposed methods indeed
yield more robust, and in several cases overall improved, results.
","[{'version': 'v1', 'created': 'Thu, 24 Oct 2019 01:57:34 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Apr 2020 05:03:13 GMT'}]",2022-02-22,"[['Stolcke', 'Andreas', '']]","['Speaker diarization', 'acoustic clustering', 'robustness', 'meeting diarization', 'ensemble classification', 'randomization', 'DOVER']"
11579,2206.05871,Mingjie Li,"Mingjie Li, Zeyan Li, Kanglin Yin, Xiaohui Nie, Wenchi Zhang, Kaixin
  Sui, Dan Pei","Causal Inference-Based Root Cause Analysis for Online Service Systems
  with Intervention Recognition",Accepted at KDD 2022 Applied Data Science Track,,10.1145/3534678.3539041,,cs.SE cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Fault diagnosis is critical in many domains, as faults may lead to safety
threats or economic losses. In the field of online service systems, operators
rely on enormous monitoring data to detect and mitigate failures. Quickly
recognizing a small set of root cause indicators for the underlying fault can
save much time for failure mitigation. In this paper, we formulate the root
cause analysis problem as a new causal inference task named intervention
recognition. We proposed a novel unsupervised causal inference-based method
named Causal Inference-based Root Cause Analysis (CIRCA). The core idea is a
sufficient condition for a monitoring variable to be a root cause indicator,
i.e., the change of probability distribution conditioned on the parents in the
Causal Bayesian Network (CBN). Towards the application in online service
systems, CIRCA constructs a graph among monitoring metrics based on the
knowledge of system architecture and a set of causal assumptions. The
simulation study illustrates the theoretical reliability of CIRCA. The
performance on a real-world dataset further shows that CIRCA can improve the
recall of the top-1 recommendation by 25% over the best baseline method.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2022 01:45:13 GMT'}]",2022-06-14,"[['Li', 'Mingjie', ''], ['Li', 'Zeyan', ''], ['Yin', 'Kanglin', ''], ['Nie', 'Xiaohui', ''], ['Zhang', 'Wenchi', ''], ['Sui', 'Kaixin', ''], ['Pei', 'Dan', '']]","['root cause analysis', 'causal inference', 'intervention recognition', 'online service systems']"
11580,2005.13904,"Sebastian H\""onel","Sebastian H\""onel, Morgan Ericsson, Welf L\""owe, Anna Wingkvist","Using Source Code Density to Improve the Accuracy of Automatic Commit
  Classification into Maintenance Activities","23 pages, to be published in The Journal of Systems and Software",,10.1016/j.jss.2020.110673,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Source code is changed for a reason, e.g., to adapt, correct, or adapt it.
This reason can provide valuable insight into the development process but is
rarely explicitly documented when the change is committed to a source code
repository. Automatic commit classification uses features extracted from
commits to estimate this reason.
  We introduce source code density, a measure of the net size of a commit, and
show how it improves the accuracy of automatic commit classification compared
to previous size-based classifications. We also investigate how preceding
generations of commits affect the class of a commit, and whether taking the
code density of previous commits into account can improve the accuracy further.
  We achieve up to 89% accuracy and a Kappa of 0.82 for the cross-project
commit classification where the model is trained on one project and applied to
other projects. Models trained on single projects yield accuracies of up to 93%
with a Kappa approaching 0.90. The accuracy of the automatic commit
classification has a direct impact on software (process) quality analyses that
exploit the classification, so our improvements to the accuracy will also
improve the confidence in such analyses.
","[{'version': 'v1', 'created': 'Thu, 28 May 2020 11:05:39 GMT'}]",2021-05-03,"[['Hönel', 'Sebastian', ''], ['Ericsson', 'Morgan', ''], ['Löwe', 'Welf', ''], ['Wingkvist', 'Anna', '']]","['Software Quality', 'Commit Classification', 'Source Code Density', 'Maintenance Activities', 'Software Evolution']"
11581,1801.08760,Elena Sibirtseva,"Elena Sibirtseva, Dimosthenis Kontogiorgos, Olov Nykvist, Hakan
  Karaoguz, Iolanda Leite, Joakim Gustafson, Danica Kragic","A Comparison of Visualisation Methods for Disambiguating Verbal Requests
  in Human-Robot Interaction",,,10.1109/ROMAN.2018.8525554,,cs.RO cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Picking up objects requested by a human user is a common task in human-robot
interaction. When multiple objects match the user's verbal description, the
robot needs to clarify which object the user is referring to before executing
the action. Previous research has focused on perceiving user's multimodal
behaviour to complement verbal commands or minimising the number of follow up
questions to reduce task time. In this paper, we propose a system for reference
disambiguation based on visualisation and compare three methods to disambiguate
natural language instructions. In a controlled experiment with a YuMi robot, we
investigated real-time augmentations of the workspace in three conditions --
mixed reality, augmented reality, and a monitor as the baseline -- using
objective measures such as time and accuracy, and subjective measures like
engagement, immersion, and display interference. Significant differences were
found in accuracy and engagement between the conditions, but no differences
were found in task time. Despite the higher error rates in the mixed reality
condition, participants found that modality more engaging than the other two,
but overall showed preference for the augmented reality condition over the
monitor and mixed reality conditions.
","[{'version': 'v1', 'created': 'Fri, 26 Jan 2018 11:24:47 GMT'}]",2019-02-05,"[['Sibirtseva', 'Elena', ''], ['Kontogiorgos', 'Dimosthenis', ''], ['Nykvist', 'Olov', ''], ['Karaoguz', 'Hakan', ''], ['Leite', 'Iolanda', ''], ['Gustafson', 'Joakim', ''], ['Kragic', 'Danica', '']]","['human-robot collaboration', 'language grounding', 'augmented reality', 'mixed reality', 'request disambiguation']"
11582,2203.16604,Jonathan Ariza MEd,"Jonathan \'Alvarez Ariza, Heyson Baez","Understanding the role of single-board computers in engineering and
  computer science education: A systematic literature review",27 pages,"Computer applications in engineering education (2022); vol 30; pp
  304-329",10.1002/cae.22439,,cs.CY cs.PL cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In the last decade, Single-Board Computers (SBCs) have been employed more
frequently in engineering and computer science both to technical and
educational levels. Several factors such as the versatility, the low-cost, and
the possibility to enhance the learning process through technology have
contributed to the educators and students usually employ these devices.
However, the implications, possibilities, and constraints of these devices in
engineering and Computer Science (CS) education have not been explored in
detail. In this systematic literature review, we explore how the SBCs are
employed in engineering and computer science and what educational results are
derived from their usage in the period 2010-2020 at tertiary education. For
that, 154 studies were selected out of n=605 collected from the academic
databases Ei Compendex, ERIC, and Inspec. The analysis was carried-out in two
phases, identifying, e.g., areas of application, learning outcomes, and
students and researchers' perceptions. The results mainly indicate the
following aspects: (1) The areas of laboratories and e-learning, computing
education, robotics, Internet of Things (IoT), and persons with disabilities
gather the studies in the review. (2) Researchers highlight the importance of
the SBCs to transform the curricula in engineering and CS for the students to
learn complex topics through experimentation in hands-on activities. (3) The
typical cognitive learning outcomes reported by the authors are the improvement
of the students' grades and the technical skills regarding the topics in the
courses. Concerning the affective learning outcomes, the increase of interest,
motivation, and engagement are commonly reported by the authors.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2022 18:34:03 GMT'}]",2022-04-01,"[['Ariza', 'Jonathan Álvarez', ''], ['Baez', 'Heyson', '']]","['Single-board computers', 'engineering education', 'computer science education', 'physical computing', 'constructionism']"
11583,1801.06771,Kenji Saito,Kenji Saito and Mitsuru Iwamura,How to Make a Digital Currency on a Blockchain Stable,"27 pages, 13 figures","Future Generation Computer Systems, Volume 100, 2019, Pages 58-69",10.1016/j.future.2019.05.019,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bitcoin and other similar digital currencies on blockchains are not ideal
means for payment, because their prices tend to go up in the long term (thus
people are incentivized to hoard those currencies), and to fluctuate widely in
the short term (thus people would want to avoid risks of losing values). The
reason why those blockchain currencies based on proof of work are unstable may
be found in their designs that the supplies of currencies do not respond to
their positive and negative demand shocks, as the authors have formulated in
our past work. Continuing from our past work, this paper proposes minimal
changes to the design of blockchain currencies so that their market prices are
automatically stabilized, absorbing both positive and negative demand shocks of
the currencies by autonomously controlling their supplies. Those changes are:
1) limiting re-adjustment of proof-of-work targets, 2) making mining rewards
variable according to the observed over-threshold changes of block intervals,
and 3) enforcing negative interests to remove old coins in circulation. We have
made basic design checks and evaluations of these measures through simple
simulations. In addition to stabilization of prices, the proposed measures may
have effects of making those currencies preferred means for payment by
disincentivizing hoarding, and improving sustainability of the currency systems
by making rewards to miners perpetual.
","[{'version': 'v1', 'created': 'Sun, 21 Jan 2018 06:03:01 GMT'}, {'version': 'v2', 'created': 'Thu, 16 May 2019 07:15:15 GMT'}]",2019-05-17,"[['Saito', 'Kenji', ''], ['Iwamura', 'Mitsuru', '']]","['digital currency', 'cryptocurrency', 'Bitcoin', 'blockchain', 'proof ofwork']"
11584,1807.09632,Eduardo Ponce Mojica,"Eduardo Ponce, Brittany Stephenson, Suzanne Lenhart, Judy Day, Gregory
  D. Peterson","PaPaS: A Portable, Lightweight, and Generic Framework for Parallel
  Parameter Studies","8 pages, 6 figures, PEARC '18: Practice and Experience in Advanced
  Research Computing, July 22--26, 2018, Pittsburgh, PA, USA",,10.1145/3219104.3229289,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The current landscape of scientific research is widely based on modeling and
simulation, typically with complexity in the simulation's flow of execution and
parameterization properties. Execution flows are not necessarily
straightforward since they may need multiple processing tasks and iterations.
Furthermore, parameter and performance studies are common approaches used to
characterize a simulation, often requiring traversal of a large parameter
space. High-performance computers offer practical resources at the expense of
users handling the setup, submission, and management of jobs. This work
presents the design of PaPaS, a portable, lightweight, and generic workflow
framework for conducting parallel parameter and performance studies. Workflows
are defined using parameter files based on keyword-value pairs syntax, thus
removing from the user the overhead of creating complex scripts to manage the
workflow. A parameter set consists of any combination of environment variables,
files, partial file contents, and command line arguments. PaPaS is being
developed in Python 3 with support for distributed parallelization using SSH,
batch systems, and C++ MPI. The PaPaS framework will run as user processes, and
can be used in single/multi-node and multi-tenant computing systems. An example
simulation using the BehaviorSpace tool from NetLogo and a matrix multiply
using OpenMP are presented as parameter and performance studies, respectively.
The results demonstrate that the PaPaS framework offers a simple method for
defining and managing parameter studies, while increasing resource utilization.
","[{'version': 'v1', 'created': 'Wed, 25 Jul 2018 14:36:35 GMT'}]",2018-07-26,"[['Ponce', 'Eduardo', ''], ['Stephenson', 'Brittany', ''], ['Lenhart', 'Suzanne', ''], ['Day', 'Judy', ''], ['Peterson', 'Gregory D.', '']]","['workflows', 'parameter studies', 'parallel computing', 'simulation']"
11585,2011.03095,Emil Je\v{r}\'abek,Emil Je\v{r}\'abek,Iterated multiplication in $VTC^0$,59 pages,"Archive for Mathematical Logic 61 (2022), no. 5--6, pp. 705--767",10.1007/s00153-021-00810-6,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that $VTC^0$, the basic theory of bounded arithmetic corresponding to
the complexity class $\mathrm{TC}^0$, proves the $IMUL$ axiom expressing the
totality of iterated multiplication satisfying its recursive definition, by
formalizing a suitable version of the $\mathrm{TC}^0$ iterated multiplication
algorithm by Hesse, Allender, and Barrington. As a consequence, $VTC^0$ can
also prove the integer division axiom, and (by our previous results) the
RSUV-translation of induction and minimization for sharply bounded formulas.
Similar consequences hold for the related theories $\Delta^b_1$-$CR$ and
$C^0_2$.
  As a side result, we also prove that there is a well-behaved $\Delta_0$
definition of modular powering in $I\Delta_0+WPHP(\Delta_0)$.
","[{'version': 'v1', 'created': 'Thu, 5 Nov 2020 21:12:05 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Sep 2021 13:28:37 GMT'}]",2022-07-14,"[['Jeřábek', 'Emil', '']]","['bounded arithmetic', 'integer division', 'iterated multiplication', 'modular powering', 'threshold circuits']"
11586,2103.11648,Lukas Prediger,"Lukas Prediger, Niki Loppi, Samuel Kaski, Antti Honkela","D3p -- A Python Package for Differentially-Private Probabilistic
  Programming",,"Proceedings on Privacy Enhancing Technologies, 2022(2), 407-425",10.2478/popets-2022-0052,,cs.LG cs.CR stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We present d3p, a software package designed to help fielding runtime
efficient widely-applicable Bayesian inference under differential privacy
guarantees. d3p achieves general applicability to a wide range of probabilistic
modelling problems by implementing the differentially private variational
inference algorithm, allowing users to fit any parametric probabilistic model
with a differentiable density function. d3p adopts the probabilistic
programming paradigm as a powerful way for the user to flexibly define such
models. We demonstrate the use of our software on a hierarchical logistic
regression example, showing the expressiveness of the modelling approach as
well as the ease of running the parameter inference. We also perform an
empirical evaluation of the runtime of the private inference on a complex model
and find a $\sim$10 fold speed-up compared to an implementation using
TensorFlow Privacy.
","[{'version': 'v1', 'created': 'Mon, 22 Mar 2021 08:15:58 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Sep 2021 08:50:55 GMT'}]",2022-08-16,"[['Prediger', 'Lukas', ''], ['Loppi', 'Niki', ''], ['Kaski', 'Samuel', ''], ['Honkela', 'Antti', '']]","['differential privacy', 'JAX', 'NumPyro', 'probabilistic programming', 'variational inference']"
11587,2009.13199,Zhihan Zhang,"Zhihan Zhang, Xiubo Geng, Tao Qin, Yunfang Wu, Daxin Jiang",Knowledge-Aware Procedural Text Understanding with Multi-Stage Training,"Published as full paper in Proceedings of the Web Conference 2021
  (WWW'21)",,10.1145/3442381.3450126,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Procedural text describes dynamic state changes during a step-by-step natural
process (e.g., photosynthesis). In this work, we focus on the task of
procedural text understanding, which aims to comprehend such documents and
track entities' states and locations during a process. Although recent
approaches have achieved substantial progress, their results are far behind
human performance. Two challenges, the difficulty of commonsense reasoning and
data insufficiency, still remain unsolved, which require the incorporation of
external knowledge bases. Previous works on external knowledge injection
usually rely on noisy web mining tools and heuristic rules with limited
applicable scenarios. In this paper, we propose a novel KnOwledge-Aware
proceduraL text understAnding (KOALA) model, which effectively leverages
multiple forms of external knowledge in this task. Specifically, we retrieve
informative knowledge triples from ConceptNet and perform knowledge-aware
reasoning while tracking the entities. Besides, we employ a multi-stage
training schema which fine-tunes the BERT model over unlabeled data collected
from Wikipedia before further fine-tuning it on the final model. Experimental
results on two procedural text datasets, ProPara and Recipes, verify the
effectiveness of the proposed methods, in which our model achieves
state-of-the-art performance in comparison to various baselines.
","[{'version': 'v1', 'created': 'Mon, 28 Sep 2020 10:28:40 GMT'}, {'version': 'v2', 'created': 'Sat, 13 Feb 2021 14:28:25 GMT'}]",2021-02-16,"[['Zhang', 'Zhihan', ''], ['Geng', 'Xiubo', ''], ['Qin', 'Tao', ''], ['Wu', 'Yunfang', ''], ['Jiang', 'Daxin', '']]","['Procedural Text Understanding', 'Entity Tracking', 'Knowledge-AwareReasoning', 'Multi-Stage Training']"
11588,2208.08789,Linhao Qu,"Linhao Qu, Siyu Liu, Xiaoyu Liu, Manning Wang, Zhijian Song","Towards Label-efficient Automatic Diagnosis and Analysis: A
  Comprehensive Survey of Advanced Deep Learning-based Weakly-supervised,
  Semi-supervised and Self-supervised Techniques in Histopathological Image
  Analysis","Comprehensive survey for Weakly-supervised, Semi-supervised and
  Self-supervised Techniques in Histopathological Image Analysis (total of 212
  references)",,10.1088/1361-6560/ac910a,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Histopathological images contain abundant phenotypic information and
pathological patterns, which are the gold standards for disease diagnosis and
essential for the prediction of patient prognosis and treatment outcome. In
recent years, computer-automated analysis techniques for histopathological
images have been urgently required in clinical practice, and deep learning
methods represented by convolutional neural networks have gradually become the
mainstream in the field of digital pathology. However, obtaining large numbers
of fine-grained annotated data in this field is a very expensive and difficult
task, which hinders the further development of traditional supervised
algorithms based on large numbers of annotated data. More recent studies have
started to liberate from the traditional supervised paradigm, and the most
representative ones are the studies on weakly supervised learning paradigm
based on weak annotation, semi-supervised learning paradigm based on limited
annotation, and self-supervised learning paradigm based on pathological image
representation learning. These new methods have led a new wave of automatic
pathological image diagnosis and analysis targeted at annotation efficiency.
With a survey of over 130 papers, we present a comprehensive and systematic
review of the latest studies on weakly supervised learning, semi-supervised
learning, and self-supervised learning in the field of computational pathology
from both technical and methodological perspectives. Finally, we present the
key challenges and future trends for these techniques.
","[{'version': 'v1', 'created': 'Thu, 18 Aug 2022 11:49:41 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Aug 2022 12:00:48 GMT'}]",2022-10-26,"[['Qu', 'Linhao', ''], ['Liu', 'Siyu', ''], ['Liu', 'Xiaoyu', ''], ['Wang', 'Manning', ''], ['Song', 'Zhijian', '']]","['histopathological images', 'automatic analysis', 'deep learning']"
11589,2101.08699,Dimitrije Markovic,"Dimitrije Markovic, Hrvoje Stojic, Sarah Schwoebel, and Stefan J.
  Kiebel",An empirical evaluation of active inference in multi-armed bandits,,,10.1016/j.neunet.2021.08.018,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  A key feature of sequential decision making under uncertainty is a need to
balance between exploiting--choosing the best action according to the current
knowledge, and exploring--obtaining information about values of other actions.
The multi-armed bandit problem, a classical task that captures this trade-off,
served as a vehicle in machine learning for developing bandit algorithms that
proved to be useful in numerous industrial applications. The active inference
framework, an approach to sequential decision making recently developed in
neuroscience for understanding human and animal behaviour, is distinguished by
its sophisticated strategy for resolving the exploration-exploitation
trade-off. This makes active inference an exciting alternative to already
established bandit algorithms. Here we derive an efficient and scalable
approximate active inference algorithm and compare it to two state-of-the-art
bandit algorithms: Bayesian upper confidence bound and optimistic Thompson
sampling. This comparison is done on two types of bandit problems: a stationary
and a dynamic switching bandit. Our empirical evaluation shows that the active
inference algorithm does not produce efficient long-term behaviour in
stationary bandits. However, in the more challenging switching bandit problem
active inference performs substantially better than the two state-of-the-art
bandit algorithms. The results open exciting venues for further research in
theoretical and applied machine learning, as well as lend additional
credibility to active inference as a general framework for studying human and
animal behaviour.
","[{'version': 'v1', 'created': 'Thu, 21 Jan 2021 16:20:06 GMT'}, {'version': 'v2', 'created': 'Sat, 23 Jan 2021 13:20:34 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Jul 2021 09:27:56 GMT'}, {'version': 'v4', 'created': 'Wed, 4 Aug 2021 10:08:51 GMT'}]",2021-08-27,"[['Markovic', 'Dimitrije', ''], ['Stojic', 'Hrvoje', ''], ['Schwoebel', 'Sarah', ''], ['Kiebel', 'Stefan J.', '']]","['Decision making', 'Bayesian inference', 'Multi-armed bandits', 'Active Inference', 'Upper confidence bound', 'Thompson sampling']"
11590,2102.00567,Hassan Moussa Mr,Hassan Moussa,Using Recursive KMeans and Dijkstra Algorithm to Solve CVRP,,,10.13140/RG.2.2.20970.85447,,cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Capacitated vehicle routing problem (CVRP) is being one of the most common
optimization problems in our days, considering the wide usage of routing
algorithms in multiple fields such as transportation domain, food delivery,
network routing, ... Capacitated vehicle routing problem is classified as an
NP-Hard problem, hence normal optimization algorithm can't solve it. In our
paper, we discuss a new way to solve the mentioned problem, using a recursive
approach of the most known clustering algorithm ""K-Means"", one of the known
shortest path algorithm ""Dijkstra"", and some mathematical operations. In this
paper, we will show how to implement those methods together in order to get the
nearest solution of the optimal route, since research and development are still
on go, this research paper may be extended with another one, that will involve
the implementational results of this thoric side.
","[{'version': 'v1', 'created': 'Mon, 1 Feb 2021 00:03:03 GMT'}]",2021-12-28,"[['Moussa', 'Hassan', '']]","['VRP', 'CVRP', 'artificial intelligence', 'capacitated vehicle routing problem', 'routing algorithm', 'routing optimization', 'unsupervised machine learning']"
11591,2109.11987,William Schultz,"William Schultz, Ian Dardik, Stavros Tripakis",Formal Verification of a Distributed Dynamic Reconfiguration Protocol,First two authors contributed equally,,10.1145/3497775.3503688,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  We present a formal, machine checked TLA+ safety proof of MongoRaftReconfig,
a distributed dynamic reconfiguration protocol. MongoRaftReconfig was designed
for and implemented in MongoDB, a distributed database whose replication
protocol is derived from the Raft consensus algorithm. We present an inductive
invariant for MongoRaftReconfig that is formalized in TLA+ and formally proved
using the TLA+ proof system (TLAPS). We also present a formal TLAPS proof of
two key safety properties of MongoRaftReconfig, LeaderCompleteness and
StateMachineSafety. To our knowledge, these are the first machine checked
inductive invariant and safety proof of a dynamic reconfiguration protocol for
a Raft based replication system.
","[{'version': 'v1', 'created': 'Fri, 24 Sep 2021 14:18:43 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Dec 2021 21:15:46 GMT'}]",2022-05-17,"[['Schultz', 'William', ''], ['Dardik', 'Ian', ''], ['Tripakis', 'Stavros', '']]","['Formal Verification', 'Theorem Proving', 'TLA+', 'Dynamic Reconfiguration', 'Distributed Systems', 'Raft']"
11592,1810.05725,Dhinaharan Nagamalai,"Marija Prokopijevi\'c, Aleksandar Stan\v{c}i\'c, Jelena Vasiljevi\'c,
  \v{Z}eljko Stojkovi\'c, Goran Dimi\'c, Jelena Sopta, Dalibor Risti\'c and
  Dhinaharan Nagamalai","Neural Network based classification of bone metastasis by primary
  cacinoma","13 pages, 9 figures","Computer Science & Information Technology (CS & IT), 7th
  International Conference on Information Technology Convergence and Services
  (ITCSE 2018), Vienna, Austria, May 26~27, 2018",10.5121/csit.2018.80707,,cs.CV cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Neural networks have been known for a long time as a tool for different types
of classification, but only just in the last decade they have showed their
entire power. Along with appearing of hardware that is capable to support
demanding matrix operations and parallel algorithms, the neural network, as a
universal function approximation framework, turns out to be the most successful
classification method widely used in all fields of science. On the other side,
multifractal (MF) approach is an efficient way for quantitative description of
complex structures [1] such as metastatic carcinoma, which recommends this
method as an accurate tool for medical diagnostics. The only part that is
missing is classification method. The goal of this research is to describe and
apply a feed-forward neural network as an auxiliary diagnostic method for
classification of multifractal parameters in order to determine primary cancer.
","[{'version': 'v1', 'created': 'Mon, 8 Oct 2018 23:44:59 GMT'}]",2018-10-16,"[['Prokopijević', 'Marija', ''], ['Stančić', 'Aleksandar', ''], ['Vasiljević', 'Jelena', ''], ['Stojković', 'Željko', ''], ['Dimić', 'Goran', ''], ['Sopta', 'Jelena', ''], ['Ristić', 'Dalibor', ''], ['Nagamalai', 'Dhinaharan', '']]","['Classification', 'Metastasis', 'Multifractal Analysis', 'Neural Networks']"
11593,2206.10471,Rabindra Lamsal,"Rabindra Lamsal, Aaron Harwood, Maria Rodriguez Read",Twitter conversations predict the daily confirmed COVID-19 cases,Accepted to Applied Soft Computing,"Applied Soft Computing, 109603 (2022)",10.1016/j.asoc.2022.109603,,cs.CL cs.SI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  As of writing this paper, COVID-19 (Coronavirus disease 2019) has spread to
more than 220 countries and territories. Following the outbreak, the pandemic's
seriousness has made people more active on social media, especially on the
microblogging platforms such as Twitter and Weibo. The pandemic-specific
discourse has remained on-trend on these platforms for months now. Previous
studies have confirmed the contributions of such socially generated
conversations towards situational awareness of crisis events. The early
forecasts of cases are essential to authorities to estimate the requirements of
resources needed to cope with the outgrowths of the virus. Therefore, this
study attempts to incorporate the public discourse in the design of forecasting
models particularly targeted for the steep-hill region of an ongoing wave. We
propose a sentiment-involved topic-based latent variables search methodology
for designing forecasting models from publicly available Twitter conversations.
As a use case, we implement the proposed methodology on Australian COVID-19
daily cases and Twitter conversations generated within the country.
Experimental results: (i) show the presence of latent social media variables
that Granger-cause the daily COVID-19 confirmed cases, and (ii) confirm that
those variables offer additional prediction capability to forecasting models.
Further, the results show that the inclusion of social media variables
introduces 48.83--51.38% improvements on RMSE over the baseline models. We also
release the large-scale COVID-19 specific geotagged global tweets dataset,
MegaGeoCOV, to the public anticipating that the geotagged data of this scale
would aid in understanding the conversational dynamics of the pandemic through
other spatial and temporal contexts.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2022 15:31:06 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Sep 2022 04:05:13 GMT'}]",2022-09-14,"[['Lamsal', 'Rabindra', ''], ['Harwood', 'Aaron', ''], ['Read', 'Maria Rodriguez', '']]","['Pandemic forecast', 'Time series analysis', 'Social media analytics', 'Twitter analytics', 'Granger causality', 'ARIMAX models', 'VAR models']"
11594,2011.01040,Sebastian Frischbier,"Sebastian Frischbier, Mario Paic, Alexander Echler, Christian Roth","Poster: A Real-World Distributed Infrastructure for Processing Financial
  Data at Scale","Authors' version of the accepted submission; final version published
  by ACM as part of the proceedings of DEBS '19: The 13th ACM International
  Conference on Distributed and Event-based Systems (DEBS '19); 2 pages, 1
  figure; vwd Vereinigte Wirtschaftsdienste GmbH is by now known as Infront
  Financial Technology GmbH (part of the Infront group)",,10.1145/3328905.3332513,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Financial markets are event- and data-driven to an extremely high degree. For
making decisions and triggering actions stakeholders require notifications
about significant events and reliable background information that meet their
individual requirements in terms of timeliness, accuracy, and completeness. As
one of Europe's leading providers of financial data and regulatory solutions
vwd processes an average of 18 billion event notifications from 500+ data
sources for 30 million symbols per day. Our large-scale distributed event-based
systems handle daily peak rates of 1+ million event notifications per second
and additional load generated by singular pivotal events with global impact. In
this poster we give practical insights into our IT systems. We outline the
infrastructure we operate and the event-driven architecture we apply at vwd. In
particular we showcase the (geo)distributed publish/subscribe broker network we
operate across locations and countries to provide market data to our customers
with varying quality of information (QoI) properties.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2020 13:14:20 GMT'}]",2021-08-23,"[['Frischbier', 'Sebastian', ''], ['Paic', 'Mario', ''], ['Echler', 'Alexander', ''], ['Roth', 'Christian', '']]","['Event-processing', 'stream-processing', 'publish/subscribe', 'financialdata', 'big data', 'quality of information', 'infrastructure', 'broker network']"
11595,2101.01676,Marlo Souza,"Marlo Souza, \'Alvaro Moreira, Renata Vieira","Dynamic Preference Logic meets Iterated Belief Change: Representation
  Results and Postulates Characterization",,,10.1016/j.tcs.2020.12.042,,cs.LO cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  AGM's belief revision is one of the main paradigms in the study of belief
change operations. Recently, several logics for belief and information change
have been proposed in the literature and used to encode belief change
operations in rich and expressive semantic frameworks. While the connections of
AGM-like operations and their encoding in dynamic doxastic logics have been
studied before by the work of Segerberg, most works on the area of Dynamic
Epistemic Logics (DEL) have not, to our knowledge, attempted to use those
logics as tools to investigate mathematical properties of belief change
operators. This work investigates how Dynamic Preference Logic, a logic in the
DEL family, can be used to study properties of dynamic belief change operators,
focusing on well-known postulates of iterated belief change.
","[{'version': 'v1', 'created': 'Tue, 5 Jan 2021 17:47:18 GMT'}]",2021-01-06,"[['Souza', 'Marlo', ''], ['Moreira', 'Álvaro', ''], ['Vieira', 'Renata', '']]","['Dynamic Epistemic Logic', 'Dynamic Preference Logic', 'BeliefRevision']"
11596,1909.04925,Betty van Aken,"Betty van Aken, Benjamin Winter, Alexander L\""oser, Felix A. Gers","How Does BERT Answer Questions? A Layer-Wise Analysis of Transformer
  Representations",Accepted at CIKM 2019,,10.1145/3357384.3358028,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bidirectional Encoder Representations from Transformers (BERT) reach
state-of-the-art results in a variety of Natural Language Processing tasks.
However, understanding of their internal functioning is still insufficient and
unsatisfactory. In order to better understand BERT and other Transformer-based
models, we present a layer-wise analysis of BERT's hidden states. Unlike
previous research, which mainly focuses on explaining Transformer models by
their attention weights, we argue that hidden states contain equally valuable
information. Specifically, our analysis focuses on models fine-tuned on the
task of Question Answering (QA) as an example of a complex downstream task. We
inspect how QA models transform token vectors in order to find the correct
answer. To this end, we apply a set of general and QA-specific probing tasks
that reveal the information stored in each representation layer. Our
qualitative analysis of hidden state visualizations provides additional
insights into BERT's reasoning process. Our results show that the
transformations within BERT go through phases that are related to traditional
pipeline tasks. The system can therefore implicitly incorporate task-specific
information into its token representations. Furthermore, our analysis reveals
that fine-tuning has little impact on the models' semantic abilities and that
prediction errors can be recognized in the vector representations of even early
layers.
","[{'version': 'v1', 'created': 'Wed, 11 Sep 2019 08:55:09 GMT'}]",2019-09-12,"[['van Aken', 'Betty', ''], ['Winter', 'Benjamin', ''], ['Löser', 'Alexander', ''], ['Gers', 'Felix A.', '']]","['neural networks', 'transformers', 'explainability', 'word representation', 'natural language processing', 'question answering']"
11597,2110.02472,John Buczek,"John Buczek, Lorenzo Bertizzolo, Stefano Basagni, Tommaso Melodia",What is A Wireless UAV? A Design Blueprint for 6G Flying Wireless Nodes,"This paper has been accepted at WiNTECH'21: Proceedings of the 15th
  ACM Workshop on Wireless Network Testbeds, Experimental evaluation &
  CHaracterization. Copyright may be transferred without notice",,10.1145/3477086.3480840,,cs.NI cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Wireless Unmanned Aerial Vehicles (UAVs) were introduced in the world of 4th
generation networks (4G) as cellular users, and have attracted the interest of
the wireless community ever since. In~5G, UAVs operate also as flying Base
Stations providing service to ground users. They can also implement independent
off-the-grid UAV networks. In~6G networks, wireless UAVs will connect ground
users to in-orbit wireless infrastructure. As the design and prototyping of
wireless UAVs are on the rise, the time is ripe for introducing a more precise
definition of what is a wireless UAV. In doing so, we revise the major design
challenges in the prototyping of wireless UAVs for future 6G spectrum research.
We then introduce a new wireless UAV prototype that addresses these challenges.
The design of our wireless UAV prototype will be made public and freely
available to other researchers.
","[{'version': 'v1', 'created': 'Wed, 6 Oct 2021 03:07:34 GMT'}]",2021-10-07,"[['Buczek', 'John', ''], ['Bertizzolo', 'Lorenzo', ''], ['Basagni', 'Stefano', ''], ['Melodia', 'Tommaso', '']]","['Wireless Unmanned Aerial Vehicles', 'UAV networks', '6G']"
11598,2009.03777,Simson Garfinkel,Simson L. Garfinkel and Philip Leclerc,Randomness Concerns When Deploying Differential Privacy,12 pages plus 2 pages bibliography,"19th Workshop on Privacy in the Electronic Society (WPES'20),
  November 9, 2020, Virtual Event, USA",10.1145/3411497.3420211,,cs.CR cs.CY,http://creativecommons.org/publicdomain/zero/1.0/,"  The U.S. Census Bureau is using differential privacy (DP) to protect
confidential respondent data collected for the 2020 Decennial Census of
Population & Housing. The Census Bureau's DP system is implemented in the
Disclosure Avoidance System (DAS) and requires a source of random numbers. We
estimate that the 2020 Census will require roughly 90TB of random bytes to
protect the person and household tables. Although there are critical
differences between cryptography and DP, they have similar requirements for
randomness. We review the history of random number generation on deterministic
computers, including von Neumann's ""middle-square"" method, Mersenne Twister
(MT19937) (previously the default NumPy random number generator, which we
conclude is unacceptable for use in production privacy-preserving systems), and
the Linux /dev/urandom device. We also review hardware random number generator
schemes, including the use of so-called ""Lava Lamps"" and the Intel Secure Key
RDRAND instruction. We finally present our plan for generating random bits in
the Amazon Web Services (AWS) environment using AES-CTR-DRBG seeded by mixing
bits from /dev/urandom and the Intel Secure Key RDSEED instruction, a
compromise of our desire to rely on a trusted hardware implementation, the
unease of our external reviewers in trusting a hardware-only implementation,
and the need to generate so many random bits.
","[{'version': 'v1', 'created': 'Sun, 6 Sep 2020 15:28:40 GMT'}]",2020-09-09,"[['Garfinkel', 'Simson L.', ''], ['Leclerc', 'Philip', '']]","['Differential privacy', 'US Census Bureau', 'Randomness', 'RDRAND']"
11599,2202.03055,Anastasiia Grishina,Anastasiia Grishina,"Enabling Automatic Repair of Source Code Vulnerabilities Using
  Data-Driven Methods",Accepted for the ICSE '22 Doctoral Symposium,,10.1145/3510454.3517063,,cs.SE cs.CR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Users around the world rely on software-intensive systems in their day-to-day
activities. These systems regularly contain bugs and security vulnerabilities.
To facilitate bug fixing, data-driven models of automatic program repair use
pairs of buggy and fixed code to learn transformations that fix errors in code.
However, automatic repair of security vulnerabilities remains under-explored.
In this work, we propose ways to improve code representations for vulnerability
repair from three perspectives: input data type, data-driven models, and
downstream tasks. The expected results of this work are improved code
representations for automatic program repair and, specifically, fixing security
vulnerabilities.
","[{'version': 'v1', 'created': 'Mon, 7 Feb 2022 10:47:37 GMT'}]",2022-02-08,"[['Grishina', 'Anastasiia', '']]","['Automatic Program Repair', 'Static Analysis', 'Software Security', 'Natural Language Processing', 'Graph-based Machine Learning', 'ML4Code']"
11600,2104.00948,Angelo Salatino,"Angelo A. Salatino, Francesco Osborne, Thiviyan Thanapalasingam,
  Enrico Motta","The CSO Classifier: Ontology-Driven Detection of Research Topics in
  Scholarly Articles",Conference paper at TPDL 2019,"In Digital Libraries for Open Knowledge. LNCS, vol 11799.
  Springer, Cham (2019)",10.1007/978-3-030-30760-8_26,,cs.IR cs.AI cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Classifying research papers according to their research topics is an
important task to improve their retrievability, assist the creation of smart
analytics, and support a variety of approaches for analysing and making sense
of the research environment. In this paper, we present the CSO Classifier, a
new unsupervised approach for automatically classifying research papers
according to the Computer Science Ontology (CSO), a comprehensive ontology of
re-search areas in the field of Computer Science. The CSO Classifier takes as
input the metadata associated with a research paper (title, abstract, keywords)
and returns a selection of research concepts drawn from the ontology. The
approach was evaluated on a gold standard of manually annotated articles
yielding a significant improvement over alternative methods.
","[{'version': 'v1', 'created': 'Fri, 2 Apr 2021 09:02:32 GMT'}]",2021-04-05,"[['Salatino', 'Angelo A.', ''], ['Osborne', 'Francesco', ''], ['Thanapalasingam', 'Thiviyan', ''], ['Motta', 'Enrico', '']]","['Scholarly Data', 'Digital Libraries', 'Bibliographic Data', 'Ontology', 'Text Mining', 'Topic Detection', 'Word Embeddings', 'Science of Science']"
11601,2101.08345,Giovanna Menardi,Giovanna Menardi,Nonparametric clustering for image segmentation,,"Statistical Analysis and Data Mining, 13(1), 83-97 (2020)",10.1002/sam.11444,,cs.CV eess.IV stat.AP,http://creativecommons.org/licenses/by/4.0/,"  Image segmentation aims at identifying regions of interest within an image,
by grouping pixels according to their properties. This task resembles the
statistical one of clustering, yet many standard clustering methods fail to
meet the basic requirements of image segmentation: segment shapes are often
biased toward predetermined shapes and their number is rarely determined
automatically. Nonparametric clustering is, in principle, free from these
limitations and turns out to be particularly suitable for the task of image
segmentation. This is also witnessed by several operational analogies, as, for
instance, the resort to topological data analysis and spatial tessellation in
both the frameworks. We discuss the application of nonparametric clustering to
image segmentation and provide an algorithm specific for this task. Pixel
similarity is evaluated in terms of density of the color representation and the
adjacency structure of the pixels is exploited to introduce a simple, yet
effective method to identify image segments as disconnected high-density
regions. The proposed method works both to segment an image and to detect its
boundaries and can be seen as a generalization to color images of the class of
thresholding methods.
","[{'version': 'v1', 'created': 'Wed, 20 Jan 2021 22:27:44 GMT'}]",2021-01-22,"[['Menardi', 'Giovanna', '']]","['Image Segmentation', 'Kernel smoothing', 'Mode', 'Nonparametric Density Estimation']"
11602,1905.11751,Simon D. Duque Anton,"Simon Duque Anton, Daniel Fraunholz, Dennis Krummacker, Christoph
  Fischer, Michael Karrenbauer, Hans Dieter Schotten",The Dos and Don'ts of Industrial Network Simulation: A Field Report,"This is a preprint of a work published in the Proceedings of the 2nd
  International Symposium on Computer Science and Intelligent Control (ISCSIC
  2018)",,10.1145/3284557.3284716,,cs.NI cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advances in industrial control lead to increasing incorporation of
intercommunication technologies and embedded devices into the production
environment. In addition to that, the rising complexity of automation tasks
creates demand for extensive solutions. Standardised protocols and commercial
off the shelf devices aid in providing these solutions. Still, setting up
industrial communication networks is a tedious and high effort task. This
justifies the need for simulation environments in the industrial context, as
they provide cost-, resource- and time-efficient evaluation of solution
approaches. In this work, industrial use cases are identified and the according
requirements are derived. Furthermore, available simulation and emulation tools
are analysed. They are mapped onto the requirements of industrial applications,
so that an expressive assignment of solutions to application domains is given.
","[{'version': 'v1', 'created': 'Tue, 28 May 2019 11:31:02 GMT'}]",2019-05-29,"[['Anton', 'Simon Duque', ''], ['Fraunholz', 'Daniel', ''], ['Krummacker', 'Dennis', ''], ['Fischer', 'Christoph', ''], ['Karrenbauer', 'Michael', ''], ['Schotten', 'Hans Dieter', '']]","['Simulation', 'Industrial Internet of Things', 'Survey', 'Industry 4']"
11603,2002.07325,Arash Kalatian,Arash Kalatian and Bilal Farooq,"Decoding pedestrian and automated vehicle interactions using immersive
  virtual reality and interpretable deep learning",,"Transportation Research Part C: Emerging Technologies, 124 (2021)
  pp. 102962",10.1016/j.trc.2020.102962,,cs.HC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To ensure pedestrian friendly streets in the era of automated vehicles,
reassessment of current policies, practices, design, rules and regulations of
urban areas is of importance. This study investigates pedestrian crossing
behaviour, as an important element of urban dynamics that is expected to be
affected by the presence of automated vehicles. For this purpose, an
interpretable machine learning framework is proposed to explore factors
affecting pedestrians' wait time before crossing mid-block crosswalks in the
presence of automated vehicles. To collect rich behavioural data, we developed
a dynamic and immersive virtual reality experiment, with 180 participants from
a heterogeneous population in 4 different locations in the Greater Toronto Area
(GTA). Pedestrian wait time behaviour is then analyzed using a data-driven Cox
Proportional Hazards (CPH) model, in which the linear combination of the
covariates is replaced by a flexible non-linear deep neural network. The
proposed model achieved a 5% improvement in goodness of fit, but more
importantly, enabled us to incorporate a richer set of covariates. A game
theoretic based interpretability method is used to understand the contribution
of different covariates to the time pedestrians wait before crossing. Results
show that the presence of automated vehicles on roads, wider lane widths, high
density on roads, limited sight distance, and lack of walking habits are the
main contributing factors to longer wait times. Our study suggested that, to
move towards pedestrian-friendly urban areas, national level educational
programs for children, enhanced safety measures for seniors, promotion of
active modes of transportation, and revised traffic rules and regulations
should be considered.
","[{'version': 'v1', 'created': 'Tue, 18 Feb 2020 01:30:29 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Jan 2021 20:51:44 GMT'}]",2021-01-07,"[['Kalatian', 'Arash', ''], ['Farooq', 'Bilal', '']]","['Survival analysis', 'deep learning', 'model interpretability', 'virtual reality', 'pedestrian crossing behaviour', 'pedestrian wait time']"
11604,2109.07402,Zichuan Liu,"ZiChuan Liu, Zhaoyang Wu, Meng Wang, Rui Zhang",Multi View Spatial-Temporal Model for Travel Time Estimation,"4 pages, 2 figures",,10.1145/3474717.3488239,,cs.LG cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Taxi arrival time prediction is essential for building intelligent
transportation systems. Traditional prediction methods mainly rely on
extracting features from traffic maps, which cannot model complex situations
and nonlinear spatial and temporal relationships. Therefore, we propose
Multi-View Spatial-Temporal Model (MVSTM) to capture the mutual dependence of
spatial-temporal relations and trajectory features. Specifically, we use
graph2vec to model the spatial view, dual-channel temporal module to model the
trajectory view, and structural embedding to model traffic semantics.
Experiments on large-scale taxi trajectory data have shown that our approach is
more effective than the existing novel methods. The source code can be found at
https://github.com/775269512/SIGSPATIAL-2021-GISCUP-4th-Solution.
","[{'version': 'v1', 'created': 'Wed, 15 Sep 2021 16:11:18 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Sep 2021 05:21:08 GMT'}, {'version': 'v3', 'created': 'Thu, 30 Sep 2021 15:40:11 GMT'}]",2021-10-01,"[['Liu', 'ZiChuan', ''], ['Wu', 'Zhaoyang', ''], ['Wang', 'Meng', ''], ['Zhang', 'Rui', '']]","['multi-view', 'travel time estimation', 'spatial-temporal', 'graph2vec']"
11605,2006.11009,Mohsen Abbasi,"Mohsen Abbasi, Aditya Bhaskara, Suresh Venkatasubramanian",Fair clustering via equitable group representations,"11 pages, 5 figures, ACM Conference on Fairness, Accountability, and
  Transparency (ACM FAccT)",,10.1145/3442188.3445913,,cs.LG cs.DS stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  What does it mean for a clustering to be fair? One popular approach seeks to
ensure that each cluster contains groups in (roughly) the same proportion in
which they exist in the population. The normative principle at play is balance:
any cluster might act as a representative of the data, and thus should reflect
its diversity.
  But clustering also captures a different form of representativeness. A core
principle in most clustering problems is that a cluster center should be
representative of the cluster it represents, by being ""close"" to the points
associated with it. This is so that we can effectively replace the points by
their cluster centers without significant loss in fidelity, and indeed is a
common ""use case"" for clustering. For such a clustering to be fair, the centers
should ""represent"" different groups equally well. We call such a clustering a
group-representative clustering.
  In this paper, we study the structure and computation of group-representative
clusterings. We show that this notion naturally parallels the development of
fairness notions in classification, with direct analogs of ideas like
demographic parity and equal opportunity. We demonstrate how these notions are
distinct from and cannot be captured by balance-based notions of fairness. We
present approximation algorithms for group representative $k$-median clustering
and couple this with an empirical evaluation on various real-world data sets.
","[{'version': 'v1', 'created': 'Fri, 19 Jun 2020 08:16:01 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Jan 2021 23:38:12 GMT'}]",2021-01-29,"[['Abbasi', 'Mohsen', ''], ['Bhaskara', 'Aditya', ''], ['Venkatasubramanian', 'Suresh', '']]","['algorithmic fairness', 'clustering', 'representation', 'facility location']"
11606,2006.07075,Florian Rossmannek,"Patrick Cheridito, Arnulf Jentzen, Florian Rossmannek","Non-convergence of stochastic gradient descent in the training of deep
  neural networks",,J. Complexity 64 (2021),10.1016/j.jco.2020.101540,,cs.LG cs.NA math.NA stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks have successfully been trained in various application
areas with stochastic gradient descent. However, there exists no rigorous
mathematical explanation why this works so well. The training of neural
networks with stochastic gradient descent has four different discretization
parameters: (i) the network architecture; (ii) the amount of training data;
(iii) the number of gradient steps; and (iv) the number of randomly initialized
gradient trajectories. While it can be shown that the approximation error
converges to zero if all four parameters are sent to infinity in the right
order, we demonstrate in this paper that stochastic gradient descent fails to
converge for ReLU networks if their depth is much larger than their width and
the number of random initializations does not increase to infinity fast enough.
","[{'version': 'v1', 'created': 'Fri, 12 Jun 2020 11:00:36 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Jan 2021 08:22:54 GMT'}]",2021-10-13,"[['Cheridito', 'Patrick', ''], ['Jentzen', 'Arnulf', ''], ['Rossmannek', 'Florian', '']]","['Machine learning', 'deep neural networks', 'stochastic gradient descend', 'empirical riskminimization', 'non-convergence']"
11607,2007.07759,Nazareno Bruschi,"Nazareno Bruschi, Angelo Garofalo, Francesco Conti, Giuseppe
  Tagliavini and Davide Rossi","Enabling Mixed-Precision Quantized Neural Networks in Extreme-Edge
  Devices","4 pages, 6 figures, published in 17th ACM International Conference on
  Computing Frontiers (CF '20), May 11--13, 2020, Catania, Italy",,10.1145/3387902.3394038,,cs.AR eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The deployment of Quantized Neural Networks (QNN) on advanced
microcontrollers requires optimized software to exploit digital signal
processing (DSP) extensions of modern instruction set architectures (ISA). As
such, recent research proposed optimized libraries for QNNs (from 8-bit to
2-bit) such as CMSIS-NN and PULP-NN. This work presents an extension to the
PULP-NN library targeting the acceleration of mixed-precision Deep Neural
Networks, an emerging paradigm able to significantly shrink the memory
footprint of deep neural networks with negligible accuracy loss. The library,
composed of 27 kernels, one for each permutation of input feature maps,
weights, and output feature maps precision (considering 8-bit, 4-bit and
2-bit), enables efficient inference of QNN on parallel ultra-low-power (PULP)
clusters of RISC-V based processors, featuring the RV32IMCXpulpV2 ISA. The
proposed solution, benchmarked on an 8-cores GAP-8 PULP cluster, reaches peak
performance of 16 MACs/cycle on 8 cores, performing 21x to 25x faster than an
STM32H7 (powered by an ARM Cortex M7 processor) with 15x to 21x better energy
efficiency.
","[{'version': 'v1', 'created': 'Wed, 15 Jul 2020 15:34:53 GMT'}]",2020-07-16,"[['Bruschi', 'Nazareno', ''], ['Garofalo', 'Angelo', ''], ['Conti', 'Francesco', ''], ['Tagliavini', 'Giuseppe', ''], ['Rossi', 'Davide', '']]","['Embedded Systems', 'Quantized Neural Network', 'Low power Architectures']"
11608,1911.07800,Zongliang Du,"Chang Liu, Zongliang Du, Yichao Zhu, Weisheng Zhang, Xiaoyu Zhang, Xu
  Guo","Optimal design of shell-graded-infill structures by a hybrid MMC-MMV
  approach",,,10.1016/j.cma.2020.113187,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the present work, a hybrid MMC-MMV approach is developed for designing
additive manufacturing-oriented shell-graded-infill structures. The key idea is
to describe the geometry of a shell-graded-infill structure explicitly using
some geometry parameters. To this end, a set of morphable voids is adopted to
describe the boundary of the coating shell, while a set of morphable components
combing with a coordinate perturbation technique are introduced to represent
the graded infill distribution. Under such treatment, both the crisp boundary
of the coating shell and the graded infill can be optimized simultaneously,
with a small number of design variables. Numerical examples demonstrate the
effectiveness of the proposed approach.
","[{'version': 'v1', 'created': 'Mon, 18 Nov 2019 17:55:32 GMT'}]",2020-07-15,"[['Liu', 'Chang', ''], ['Du', 'Zongliang', ''], ['Zhu', 'Yichao', ''], ['Zhang', 'Weisheng', ''], ['Zhang', 'Xiaoyu', ''], ['Guo', 'Xu', '']]","['Topology optimization', 'Additive manufacturing', 'Coated structure', 'Graded']"
11609,2202.01587,Minyoung Choe,"Minyoung Choe, Jaemin Yoo, Geon Lee, Woonsung Baek, U Kang, Kijung
  Shin",MiDaS: Representative Sampling from Real-world Hypergraphs,Accepted to WWW 2022 - The Web Conference 2022,,10.1145/1122445.1122456,,cs.SI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Graphs are widely used for representing pairwise interactions in complex
systems. Since such real-world graphs are large and often evergrowing, sampling
a small representative subgraph is indispensable for various purposes:
simulation, visualization, stream processing, representation learning,
crawling, to name a few. However, many complex systems consist of group
interactions (e.g., collaborations of researchers and discussions on online Q&A
platforms), and thus they can be represented more naturally and accurately by
hypergraphs (i.e., sets of sets) than by ordinary graphs. Motivated by the
prevalence of large-scale hypergraphs, we study the problem of representative
sampling from real-world hypergraphs, aiming to answer (Q1) what a
representative sub-hypergraph is and (Q2) how we can find a representative one
rapidly without an extensive search. Regarding Q1, we propose to measure the
goodness of a sub-hypergraph by comparing it with the entire hypergraph in
terms of ten graph-level, hyperedge-level, and node-level statistics. Regarding
Q2, we first analyze the characteristics of six intuitive approaches in 11
real-world hypergraphs. Then, based on the analysis, we propose MiDaS, which
draws hyperedges with a bias towards those with high-degree nodes. Through
extensive experiments, we demonstrate that MiDaS is (a) Representative: finding
overall the most representative samples among 13 considered approaches, (b)
Fast: several orders of magnitude faster than the strongest competitors, which
performs an extensive search, and (c) Automatic: rapidly searching a proper
degree of bias.
","[{'version': 'v1', 'created': 'Thu, 3 Feb 2022 13:50:23 GMT'}, {'version': 'v2', 'created': 'Sat, 5 Feb 2022 05:36:50 GMT'}]",2022-02-08,"[['Choe', 'Minyoung', ''], ['Yoo', 'Jaemin', ''], ['Lee', 'Geon', ''], ['Baek', 'Woonsung', ''], ['Kang', 'U', ''], ['Shin', 'Kijung', '']]","['Hypergraph', 'Sampling', 'Structural Property']"
11610,1908.09992,Michel Kinsy,"Sahan Bandara, Alan Ehret, Donato Kava and Michel A. Kinsy",BRISC-V: An Open-Source Architecture Design Space Exploration Toolbox,"In Proceedings of the 2019 ACM/SIGDA International Symposium on
  Field-Programmable Gate Arrays (FPGA '19)",,10.1145/3289602.3293991,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we introduce a platform for register-transfer level (RTL)
architecture design space exploration. The platform is an open-source,
parameterized, synthesizable set of RTL modules for designing RISC-V based
single and multi-core architecture systems. The platform is designed with a
high degree of modularity. It provides highly-parameterized, composable RTL
modules for fast and accurate exploration of different RISC-V based core
complexities, multi-level caching and memory organizations, system topologies,
router architectures, and routing schemes. The platform can be used for both
RTL simulation and FPGA based emulation. The hardware modules are implemented
in synthesizable Verilog using no vendor-specific blocks. The platform includes
a RISC-V compiler toolchain to assist in developing software for the cores, a
web-based system configuration graphical user interface (GUI) and a web-based
RISC-V assembly simulator. The platform supports a myriad of RISC-V
architectures, ranging from a simple single cycle processor to a multi-core SoC
with a complex memory hierarchy and a network-on-chip. The modules are designed
to support incremental additions and modifications. The interfaces between
components are particularly designed to allow parts of the processor such as
whole cache modules, cores or individual pipeline stages, to be modified or
replaced without impacting the rest of the system. The platform allows
researchers to quickly instantiate complete working RISC-V multi-core systems
with synthesizable RTL and make targeted modifications to fit their needs. The
complete platform (including Verilog source code) can be downloaded at
https://ascslab.org/research/briscv/explorer/explorer.html.
","[{'version': 'v1', 'created': 'Tue, 27 Aug 2019 02:35:09 GMT'}]",2019-08-28,"[['Bandara', 'Sahan', ''], ['Ehret', 'Alan', ''], ['Kava', 'Donato', ''], ['Kinsy', 'Michel A.', '']]","['Computer architecture design exploration', 'RISC-V', 'FPGA', 'Synthesizable', 'Open Source', 'Verilog']"
11611,2111.06230,Vukosi Marivate,"Mack Makgatho, Vukosi Marivate, Tshephisho Sefara, Valencia Wagner",Training Cross-Lingual embeddings for Setswana and Sepedi,"Accepted (to appear) for the 2nd Workshop on Resources for African
  Indigenous Languages","Vol. 3 No. 03 (2021): Proceedings of the 2nd workshop on Resources
  for African Indigenous Language (RAIL) at DHASA 2021",10.55492/dhasa.v3i03.3822,,cs.CL stat.AP,http://creativecommons.org/licenses/by/4.0/,"  African languages still lag in the advances of Natural Language Processing
techniques, one reason being the lack of representative data, having a
technique that can transfer information between languages can help mitigate
against the lack of data problem. This paper trains Setswana and Sepedi
monolingual word vectors and uses VecMap to create cross-lingual embeddings for
Setswana-Sepedi in order to do a cross-lingual transfer.
  Word embeddings are word vectors that represent words as continuous floating
numbers where semantically similar words are mapped to nearby points in
n-dimensional space. The idea of word embeddings is based on the distribution
hypothesis that states, semantically similar words are distributed in similar
contexts (Harris, 1954).
  Cross-lingual embeddings leverages monolingual embeddings by learning a
shared vector space for two separately trained monolingual vectors such that
words with similar meaning are represented by similar vectors. In this paper,
we investigate cross-lingual embeddings for Setswana-Sepedi monolingual word
vector. We use the unsupervised cross lingual embeddings in VecMap to train the
Setswana-Sepedi cross-language word embeddings. We evaluate the quality of the
Setswana-Sepedi cross-lingual word representation using a semantic evaluation
task. For the semantic similarity task, we translated the WordSim and SimLex
tasks into Setswana and Sepedi. We release this dataset as part of this work
for other researchers. We evaluate the intrinsic quality of the embeddings to
determine if there is improvement in the semantic representation of the word
embeddings.
","[{'version': 'v1', 'created': 'Thu, 11 Nov 2021 14:26:15 GMT'}]",2022-03-01,"[['Makgatho', 'Mack', ''], ['Marivate', 'Vukosi', ''], ['Sefara', 'Tshephisho', ''], ['Wagner', 'Valencia', '']]","['cross-lingual embeddings', 'word embeddings', 'intrinsic evaluation']"
11612,2010.03517,Murilo Santos de Lima,"Steven Chaplick (1), Magn\'us M. Halld\'orsson (2), Murilo S. de Lima
  (3), Tigran Tonoyan (4) ((1) Department of Data Science and Knowledge
  Engineering, Maastricht University, the Netherlands, (2) ICE-TCS, Department
  of Computer Science, Reykjavik University, Iceland, (3) K\'opavogur, Iceland,
  (4) Computer Science Department, Technion Institute of Technology, Israel)",Query Minimization under Stochastic Uncertainty,"To be published in Theoretical Computer Science. Since the previous
  version, the time consumption of the sorting algorithm was improved to
  $\mathrm{O}(n^5)$. Partially supported by Icelandic Research Fund grant
  174484-051 and by EPSRC grant EP/S033483/1. A preliminary version of this
  paper appeared in volume 12118 of LNCS (LATIN 2020), pp. 181--193, 2020. DOI:
  10.1007/978-3-030-61792-9_15",,10.1016/j.tcs.2021.09.032,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study problems with stochastic uncertainty information on intervals for
which the precise value can be queried by paying a cost. The goal is to devise
an adaptive decision tree to find a correct solution to the problem in
consideration while minimizing the expected total query cost. We show that, for
the sorting problem, such a decision tree can be found in polynomial time. For
the problem of finding the data item with minimum value, we have some evidence
for hardness. This contradicts intuition, since the minimum problem is easier
both in the online setting with adversarial inputs and in the offline
verification setting. However, the stochastic assumption can be leveraged to
beat both deterministic and randomized approximation lower bounds for the
online setting.
","[{'version': 'v1', 'created': 'Wed, 7 Oct 2020 16:45:05 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Jun 2021 15:15:13 GMT'}, {'version': 'v3', 'created': 'Tue, 21 Sep 2021 14:31:39 GMT'}]",2021-09-27,"[['Chaplick', 'Steven', ''], ['Halldórsson', 'Magnús M.', ''], ['de Lima', 'Murilo S.', ''], ['Tonoyan', 'Tigran', '']]","['stochastic optimization', 'query minimization', 'sorting', 'selection', 'online algorithms']"
11613,2204.10325,Chinmoy Deka,"Chinmoy Deka, Abhishek Shrivastava, Saurabh Nautiyal, Praveen Chauhan","AI-Based Automated Speech Therapy Tools for persons with Speech Sound
  Disorders: A Systematic Literature Review","19, 12",,10.21203/rs.3.rs-1517404/v1,,cs.HC cs.AI,http://creativecommons.org/licenses/by/4.0/,"  This paper presents a systematic literature review of published studies on
AI-based automated speech therapy tools for persons with speech sound disorders
(SSD). The COVID-19 pandemic has initiated the requirement for automated speech
therapy tools for persons with SSD making speech therapy accessible and
affordable. However, there are no guidelines for designing such automated tools
and their required degree of automation compared to human experts. In this
systematic review, we followed the PRISMA framework to address four research
questions: 1) what types of SSD do AI-based automated speech therapy tools
address, 2) what is the level of autonomy achieved by such tools, 3) what are
the different modes of intervention, and 4) how effective are such tools in
comparison with human experts. An extensive search was conducted on digital
libraries to find research papers relevant to our study from 2007 to 2022. The
results show that AI-based automated speech therapy tools for persons with SSD
are increasingly gaining attention among researchers. Articulation disorders
were the most frequently addressed SSD based on the reviewed papers. Further,
our analysis shows that most researchers proposed fully automated tools without
considering the role of other stakeholders. Our review indicates that
mobile-based and gamified applications were the most frequent mode of
intervention. The results further show that only a few studies compared the
effectiveness of such tools compared to expert Speech-Language Pathologists
(SLP). Our paper presents the state-of-the-art in the field, contributes
significant insights based on the research questions, and provides suggestions
for future research directions.
","[{'version': 'v1', 'created': 'Thu, 21 Apr 2022 13:02:41 GMT'}]",2022-04-25,"[['Deka', 'Chinmoy', ''], ['Shrivastava', 'Abhishek', ''], ['Nautiyal', 'Saurabh', ''], ['Chauhan', 'Praveen', '']]","['AI-based Speech Therapy', 'Speech Sound Disorders', 'AutomaticSpeech Therapy']"
11614,2010.03649,Daniel Seidl,Daniel Thomas Seidl and Brian Neal Granzow,"Calibration of Elastoplastic Constitutive Model Parameters from
  Full-field Data with Automatic Differentiation-based Sensitivities",,Int J Numer Methods Eng. 2021; 1-32,10.1002/nme.6843,SAND2021-13432 J,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a framework for calibration of parameters in elastoplastic
constitutive models that is based on the use of automatic differentiation (AD).
The model calibration problem is posed as a partial differential
equation-constrained optimization problem where a finite element (FE) model of
the coupled equilibrium equation and constitutive model evolution equations
serves as the constraint. The objective function quantifies the mismatch
between the displacement predicted by the FE model and full-field digital image
correlation data, and the optimization problem is solved using gradient-based
optimization algorithms. Forward and adjoint sensitivities are used to compute
the gradient at considerably less cost than its calculation from finite
difference approximations. Through the use of AD, we need only to write the
constraints in terms of AD objects, where all of the derivatives required for
the forward and inverse problems are obtained by appropriately seeding and
evaluating these quantities. We present three numerical examples that verify
the correctness of the gradient, demonstrate the AD approach's parallel
computation capabilities via application to a large-scale FE model, and
highlight the formulation's ease of extensibility to other classes of
constitutive models.
","[{'version': 'v1', 'created': 'Wed, 7 Oct 2020 20:57:15 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Dec 2020 21:07:28 GMT'}, {'version': 'v3', 'created': 'Tue, 18 May 2021 16:05:21 GMT'}, {'version': 'v4', 'created': 'Thu, 15 Jul 2021 21:28:55 GMT'}, {'version': 'v5', 'created': 'Mon, 25 Oct 2021 13:04:38 GMT'}]",2021-10-26,"[['Seidl', 'Daniel Thomas', ''], ['Granzow', 'Brian Neal', '']]","['model calibration', 'automatic differentiation', 'adjoint methods', 'finite deformationelastoplasticity']"
11615,2107.04246,Roopak Sinha,Neenu Varghese and Roopak Sinha,"Can Commercial Testing Automation Tools Work for IoT? A Case Study of
  Selenium and Node-Red","Conference paper, 6 pages, 8 figures","Proceedings of the 46th Annual Conference of the IEEE Industrial
  Electronics Society (IECON2020). Singapore, IEEE Computer Society Press,
  pp.4519-4524",10.1109/IECON43393.2020.9254910.,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Testing IoT software is challenging due to large scale, volume of
data and heterogeneity. Testing automation is a much-needed feature in the
domain. Aims: The first goal of this research is to explore the requirements
and challenges of IoT testing automation. The second goal is to integrate
testing automation tools used in commercial software into the IoT context.
Method: A systematic literature review is carried out to elicit requirements
for testing automation in IoT. A design science approach is followed to build a
testing automation tool for IoT applications written in the Node-Red platform,
using the commercial testing automation tool Selenium. The resulting framework
uses the Selenium Web Driver for browser-based testing automation for IoT
applications. Results: The proposed framework has been functionally tested on
multiple browsers with preliminary evaluation on maintainability, browser
capability and comprehensiveness. Conclusions: The use of commercial tools for
testing automation in IoT is feasible. However, major challenges like high data
volumes and parallel transmission and processing of data need to be addressed
comprehensively for complete integration.
","[{'version': 'v1', 'created': 'Fri, 9 Jul 2021 06:39:16 GMT'}]",2021-07-12,"[['Varghese', 'Neenu', ''], ['Sinha', 'Roopak', '']]","['Internet of Things', 'IoT reference architecture', 'automated testing', 'Selenium', 'testing automation']"
11616,1602.04049,Nicolas Robinson-Garcia,"Nicolas Robinson-Garcia, Alvaro Cabezas-Clavijo and Evaristo
  Jim\'enez-Contreras",Tracking the performance of an R&D programme in the Biomedical Sciences,"Pre-refereed version of paper accepted for publication in Research
  Evaluation (2016). 15 pages, 5 figures, 6 tables. V2 some typos corrected",,10.1093/reseval/rvw003,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper aims at offering an evaluation framework of an Research and
Development programme in the Biomedical Sciences. It showcases the Spanish
Biomedical Research Networking Centres initiative (CIBER) as an example of the
effect of research policy management on performance. For this it focuses on
three specific aspects: its role on the national research output in the
biomedical sciences, its effect on promoting translational research through
internal collaboration between research groups, and the perception of
researchers on the programme as defined by their inclusion of their CIBER
centres in the address field. Research output derived from this programme
represents around 25 per cent of the country's publications in the biomedical
fields. After analysing a seven year period, the programme has enhanced
collaborations between its members, but they do not seem to be sufficiently
strong. With regard to the credit given to the initiative, 54.5 per cent of the
publications mentioned this programme in their address, however an increase on
the share of papers mention it is observed two years after it was launched. We
suggest that by finding the point in which the share of mentions stabilises may
be a good strategy to identify the complete fulfilment of these types of
Research and Development policies.
","[{'version': 'v1', 'created': 'Fri, 12 Feb 2016 13:29:29 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Feb 2016 09:50:06 GMT'}]",2016-02-25,"[['Robinson-Garcia', 'Nicolas', ''], ['Cabezas-Clavijo', 'Alvaro', ''], ['Jiménez-Contreras', 'Evaristo', '']]","['Networking centres', 'biomedical areas', 'Spain', 'collaboration', 'bibliometric indicators', 'address analysis']"
11617,1911.02533,Manolis Antonoyiannakis,Manolis Antonoyiannakis,Impact Factor volatility to a single paper: A comprehensive analysis,"Quantitative Science Studies (accepted). arXiv admin note: text
  overlap with arXiv:1906.02660","Quantitative Science Studies 1, 639 (2020)",10.1162/qss_a_00037,,cs.DL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study how a single paper affects the Impact Factor (IF) by analyzing data
from 3,088,511 papers published in 11639 journals in the 2017 Journal Citation
Reports of Clarivate Analytics. We find that IFs are highly volatile. For
example, the top-cited paper of 381 journals caused their IF to increase by
more than 0.5 points, while for 818 journals the relative increase exceeded
25%. And one in 10 journals had their IF boosted by more than 50% by their top
three cited papers. Because the single-paper effect on the IF is inversely
proportional to journal size, small journals are rewarded much more strongly
than large journals for a highly-cited paper, while they are penalized more for
a low-cited paper, especially if their IF is high. This skewed reward mechanism
incentivizes high-IF journals to stay small, to remain competitive in rankings.
We discuss the implications for breakthrough papers appearing in prestigious
journals. We question the reliability of IF rankings given the high IF
sensitivity to a few papers for thousands of journals.
","[{'version': 'v1', 'created': 'Tue, 5 Nov 2019 05:03:21 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Feb 2020 00:58:35 GMT'}]",2021-04-21,"[['Antonoyiannakis', 'Manolis', '']]","['Science of Science', 'Impact Factor', 'Volatility', 'Citation Distributions', 'Bibliostatistics']"
11618,2109.05738,Vinayak Gupta,Vinayak Gupta and Srikanta Bedathur,Region Invariant Normalizing Flows for Mobility Transfer,CIKM 2021,,10.1145/3459637.3482169,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  There exists a high variability in mobility data volumes across different
regions, which deteriorates the performance of spatial recommender systems that
rely on region-specific data. In this paper, we propose a novel transfer
learning framework called REFORMD, for continuous-time location prediction for
regions with sparse checkin data. Specifically, we model user-specific
checkin-sequences in a region using a marked temporal point process (MTPP) with
normalizing flows to learn the inter-checkin time and geo-distributions. Later,
we transfer the model parameters of spatial and temporal flows trained on a
data-rich origin region for the next check-in and time prediction in a target
region with scarce checkin data. We capture the evolving region-specific
checkin dynamics for MTPP and spatial-temporal flows by maximizing the joint
likelihood of next checkin with three channels (1) checkin-category prediction,
(2) checkin-time prediction, and (3) travel distance prediction. Extensive
experiments on different user mobility datasets across the U.S. and Japan show
that our model significantly outperforms state-of-the-art methods for modeling
continuous-time sequences. Moreover, we also show that REFORMD can be easily
adapted for product recommendations i.e., sequences without any spatial
component.
","[{'version': 'v1', 'created': 'Mon, 13 Sep 2021 06:54:08 GMT'}]",2022-08-29,"[['Gupta', 'Vinayak', ''], ['Bedathur', 'Srikanta', '']]","['Normalizing Flows', 'POI Recommendation', 'Transfer Learning']"
11619,1605.02991,Luis Pablo Borja Rosales,"Prasanna S. Gandhi, Pablo Borja and Romeo Ortega",Energy Shaping Control of an Inverted Flexible Pendulum Fixed to a Cart,"11 pages, 7 figures, extended version of the NOLCOS 2016 paper",,10.1016/j.conengprac.2016.07.010,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Control of compliant mechanical systems is increasingly being researched for
several applications including flexible link robots and ultra-precision
positioning systems. The control problem in these systems is challenging,
especially with gravity coupling and large deformations, because of inherent
underactuation and the combination of lumped and distributed parameters of a
nonlinear system. In this paper we consider an ultra-flexible inverted pendulum
on a cart and propose a new nonlinear energy shaping controller to keep the
pendulum at the upward position with the cart stopped at a desired location.
The design is based on a model, obtained via the constrained Lagrange
formulation, which previously has been validated experimentally. The controller
design consists of a partial feedback linearization step followed by a standard
PID controller acting on two passive outputs. Boundedness of all signals and
(local) asymptotic stability of the desired equilibrium is theoretically
established. Simulations and experimental evidence assess the performance of
the proposed controller.
","[{'version': 'v1', 'created': 'Tue, 10 May 2016 13:15:19 GMT'}]",2020-10-23,"[['Gandhi', 'Prasanna S.', ''], ['Borja', 'Pablo', ''], ['Ortega', 'Romeo', '']]","['Energy shaping', 'compliant systems', 'Lagrangians systems', 'holonomic constraints', 'PID controllers']"
11620,1911.04488,Cody Permann,"Cody J. Permann, Derek R. Gaston, David Andrs, Robert W. Carlsen,
  Fande Kong, Alexander D. Lindsay, Jason M. Miller, John W. Peterson, Andrew
  E. Slaughter, Roy H. Stogner, Richard C. Martineau",MOOSE: Enabling Massively Parallel Multiphysics Simulation,"10 Pages of content, 2 Figures, 30 References",SoftwareX. 11 (2020) 100430,10.1016/j.softx.2020.100430,,cs.MS physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Harnessing modern parallel computing resources to achieve complex
multi-physics simulations is a daunting task. The Multiphysics Object Oriented
Simulation Environment (MOOSE) aims to enable such development by providing
simplified interfaces for specification of partial differential equations,
boundary conditions, material properties, and all aspects of a simulation
without the need to consider the parallel, adaptive, nonlinear, finite-element
solve that is handled internally. Through the use of interfaces and
inheritance, each portion of a simulation becomes reusable and composable in a
manner that allows disparate research groups to share code and create an
ecosystem of growing capability that lowers the barrier for the creation of
multiphysics simulation codes. Included within the framework is a unique
capability for building multiscale, multiphysics simulations through
simultaneous execution of multiple sub-applications with data transfers between
the scales. Other capabilities include automatic differentiation, scaling to a
large number of processors, hybrid parallelism, and mesh adaptivity. To date,
MOOSE-based applications have been created in areas of science and engineering
such as nuclear physics, geothermal science, magneto-hydrodynamics, seismic
events, compressible and incompressible fluid flow, microstructure evolution,
and advanced manufacturing processes.
","[{'version': 'v1', 'created': 'Mon, 11 Nov 2019 18:20:43 GMT'}]",2020-03-10,"[['Permann', 'Cody J.', ''], ['Gaston', 'Derek R.', ''], ['Andrs', 'David', ''], ['Carlsen', 'Robert W.', ''], ['Kong', 'Fande', ''], ['Lindsay', 'Alexander D.', ''], ['Miller', 'Jason M.', ''], ['Peterson', 'John W.', ''], ['Slaughter', 'Andrew E.', ''], ['Stogner', 'Roy H.', ''], ['Martineau', 'Richard C.', '']]","['Framework', 'finite-element', 'parallel', 'multiphysics', 'multiscale']"
11621,2107.08794,Stanly Samuel,"Stanly Samuel, Deepak D'Souza, Raghavan Komondoor","GenSys: A Scalable Fixed-point Engine for Maximal Controller Synthesis
  over Infinite State Spaces",,,10.1145/3468264.3473126,,cs.LO cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The synthesis of maximally-permissive controllers in infinite-state systems
has many practical applications. Such controllers directly correspond to
maximal winning strategies in logically specified infinite-state two-player
games. In this paper, we introduce a tool called GenSys which is a fixed-point
engine for computing maximal winning strategies for players in infinite-state
safety games. A key feature of GenSys is that it leverages the capabilities of
existing off-the-shelf solvers to implement its fixed point engine. GenSys
outperforms state-of-the-art tools in this space by a significant margin. Our
tool has solved some of the challenging problems in this space, is scalable,
and also synthesizes compact controllers. These controllers are comparatively
small in size and easier to comprehend. GenSys is freely available for use and
is available under an open-source license.
","[{'version': 'v1', 'created': 'Thu, 8 Jul 2021 18:58:15 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Aug 2021 22:25:02 GMT'}]",2021-08-18,"[['Samuel', 'Stanly', ''], [""D'Souza"", 'Deepak', ''], ['Komondoor', 'Raghavan', '']]","['reactive synthesis', 'fixed-points', 'logic', 'constraint programming']"
11622,1811.06127,Roman Snytsar,Roman Snytsar,Vectorized Character Counting for Faster Pattern Matching,,,10.5220/0007258201490154,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  Many modern sequence alignment tools implement fast string matching using the
space efficient data structure called FM-index. The succinct nature of this
data structure presents unique challenges for the algorithm designers. In this
paper, we explore the opportunities for parallelization of the exact and
inexact matches and present an efficient SIMD solution for the Occ portion of
the algorithm. Our implementation computes all eight Occ values required for
the inexact match algorithm step in a single pass. We showcase the algorithm
performance in a multi-core genome aligner and discuss effects of the memory
prefetch.
","[{'version': 'v1', 'created': 'Thu, 15 Nov 2018 00:40:26 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Sep 2019 00:48:06 GMT'}]",2019-09-04,"[['Snytsar', 'Roman', '']]","['Parallel Processing', 'Vectorization', 'Bioinformatics', 'FM-Index']"
11623,1412.2502,Thanh Cao,"Cao Thai Phuong Thanh, Ha Hai Nam and Tran Cong Hung",Solving bandwidth-guaranteed routing problem using routing data,"published in The International Journal of Computer Networks &
  Communications (IJCNC), vol. 6, no. 6",,10.5121/ijcnc.2014.6607,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a traffic engineering routing algorithm that aims to
accept as many routing demands as possible on the condition that a certain
amount of bandwidth resource is reserved for each accepted demand. The novel
idea is to select routes based on not only network states but also information
derived from routing data such as probabilities of the ingress egress pairs and
usage frequencies of the links. Experiments with respect to acceptance ratio
and computation time have been conducted against various test sets. Results
indicate that the proposed algorithm has better performance than the existing
popular algorithms including Minimum Interference Routing Algorithm (MIRA) and
Random Race based Algorithm for Traffic Engineering (RRATE).
","[{'version': 'v1', 'created': 'Mon, 8 Dec 2014 10:19:09 GMT'}]",2014-12-09,"[['Thanh', 'Cao Thai Phuong', ''], ['Nam', 'Ha Hai', ''], ['Hung', 'Tran Cong', '']]","['bandwidth-guaranteed routing algorithm', 'traffic engineering', 'history routing data']"
11624,2006.12965,Cristina Olaverri-Monreal,"Aso Validi, Nicole Polasek, Leonie Alabi, Michael Leitner, Cristina
  Olaverri-Monreal","Environmental Impact of Bundling Transport Deliveries Using SUMO:
  Analysis of a cooperative approach in Austria","5 pages, 7 figures, 2 tables, paper accepted for the proceedings of
  the CISTI'2020 - 15th Iberian Conference on Information Systems and
  Technologies",,10.23919/CISTI49556.2020.9141129,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Urban Traffic is recognized as one of the major CO2 contributors that puts a
high burden on the environment. Different attempts have been made for reducing
the impacts ranging from traffic management actions to shared-vehicle concepts
to simply reducing the number of vehicles on the streets. By relying on
cooperative approaches between different logistics companies, such as sharing
and pooling resources for bundling deliveries in the same zone, an increased
environmental benefit can be attained. To quantify this benefit we compare the
CO2 emissions, fuel consumption and total delivery time resulting from
deliveries performed by one cargo truck with two trailers versus by two
single-trailer cargo trucks under real conditions in a simulation scenario in
the city of Linz in Austria. Results showed a fuel consumption and CO2
emissions reduction of 28% and 34% respectively in the scenario in which
resources were bundled in one single truck.
","[{'version': 'v1', 'created': 'Tue, 16 Jun 2020 09:59:08 GMT'}, {'version': 'v2', 'created': 'Sun, 16 Aug 2020 11:57:07 GMT'}]",2020-08-18,"[['Validi', 'Aso', ''], ['Polasek', 'Nicole', ''], ['Alabi', 'Leonie', ''], ['Leitner', 'Michael', ''], ['Olaverri-Monreal', 'Cristina', '']]","['component; transport logistics', 'CO2 emissions', 'fuel']"
11625,1909.12617,Mahdi Sarbazi,"Mahdi Sarbazi, Mehdi SadeghZadeh, seyyed Javad Mir Abedini","Improving Resource Allocation in Software-Defined Networks using
  Clustering","12 pages, 10 figure. 1 table. Cluster Comput (2019)",,10.1007/s10586-019-02985-3,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  Software-defined networks (SDNs) are a huge evolution in simplifying
implementation and network operation which have reduced costs and made the
network programmable. Although SDNs are a suitable option for solving some of
the previous problems, but they have some challenges as any other new
technology. Resource allocation and balance control in network is one of the
main challenges of this technology which is studied in this paper. In this
study, a new approach is proposed for improving memory resource allocation in
network using load distribution clusters. Since in the proposed method,
K-mean++ algorithm is used for clustering, load balancing of clusters can be
used to preserve load balance of the network. In the proposed method, data with
higher recall is transmitted to high-quality clusters in terms of average
number of hubs and lower average delay between server and user. In the proposed
method, by increasing number of clusters, higher memory is created in the
network.
","[{'version': 'v1', 'created': 'Fri, 27 Sep 2019 11:06:39 GMT'}]",2019-10-03,"[['Sarbazi', 'Mahdi', ''], ['SadeghZadeh', 'Mehdi', ''], ['Abedini', 'seyyed Javad Mir', '']]","['Software-Defined Networks', 'Resource Allocation', 'Clustering', 'Load Balancing']"
11626,2111.10297,Giorgio Angelotti,"Giorgio Angelotti, Nicolas Drougard, Caroline P. C. Chanel",Expert-Guided Symmetry Detection in Markov Decision Processes,"Accepted to the 14th International Conference on Agents and
  Artificial Intelligence - ICAART 2022",,10.5220/0010783400003116,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning a Markov Decision Process (MDP) from a fixed batch of trajectories
is a non-trivial task whose outcome's quality depends on both the amount and
the diversity of the sampled regions of the state-action space. Yet, many MDPs
are endowed with invariant reward and transition functions with respect to some
transformations of the current state and action. Being able to detect and
exploit these structures could benefit not only the learning of the MDP but
also the computation of its subsequent optimal control policy. In this work we
propose a paradigm, based on Density Estimation methods, that aims to detect
the presence of some already supposed transformations of the state-action space
for which the MDP dynamics is invariant. We tested the proposed approach in a
discrete toroidal grid environment and in two notorious environments of
OpenAI's Gym Learning Suite. The results demonstrate that the model
distributional shift is reduced when the dataset is augmented with the data
obtained by using the detected symmetries, allowing for a more thorough and
data-efficient learning of the transition functions.
","[{'version': 'v1', 'created': 'Fri, 19 Nov 2021 16:12:30 GMT'}]",2022-03-08,"[['Angelotti', 'Giorgio', ''], ['Drougard', 'Nicolas', ''], ['Chanel', 'Caroline P. C.', '']]","['Offline Reinforcement Learning', 'Batch Reinforcement Learning', 'Markov Decision Processes', 'SymmetryDetection', 'Homomorphism', 'Density Estimation', 'Data Augmenting']"
11627,2210.06023,Tim Schopf,"Tim Schopf, Daniel Braun, Florian Matthes","Lbl2Vec: An Embedding-Based Approach for Unsupervised Document Retrieval
  on Predefined Topics",,"In Proceedings of the 17th International Conference on Web
  Information Systems and Technologies - WEBIST, ISBN 978-989-758-536-4; ISSN
  2184-3252, pages 124-132 (2021)",10.5220/0010710300003058,,cs.CL cs.AI,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we consider the task of retrieving documents with predefined
topics from an unlabeled document dataset using an unsupervised approach. The
proposed unsupervised approach requires only a small number of keywords
describing the respective topics and no labeled document. Existing approaches
either heavily relied on a large amount of additionally encoded world knowledge
or on term-document frequencies. Contrariwise, we introduce a method that
learns jointly embedded document and word vectors solely from the unlabeled
document dataset in order to find documents that are semantically similar to
the topics described by the keywords. The proposed method requires almost no
text preprocessing but is simultaneously effective at retrieving relevant
documents with high probability. When successively retrieving documents on
different predefined topics from publicly available and commonly used datasets,
we achieved an average area under the receiver operating characteristic curve
value of 0.95 on one dataset and 0.92 on another. Further, our method can be
used for multiclass document classification, without the need to assign labels
to the dataset in advance. Compared with an unsupervised classification
baseline, we increased F1 scores from 76.6 to 82.7 and from 61.0 to 75.1 on the
respective datasets. For easy replication of our approach, we make the
developed Lbl2Vec code publicly available as a ready-to-use tool under the
3-Clause BSD license.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2022 08:57:01 GMT'}]",2022-10-13,"[['Schopf', 'Tim', ''], ['Braun', 'Daniel', ''], ['Matthes', 'Florian', '']]","['Natural Language Processing', 'Document Retrieval', 'Unsupervised Document Classification']"
11628,1910.02213,Luke Snyder,"Luke S. Snyder, Morteza Karimzadeh, Ray Chen, and David S. Ebert",City-level Geolocation of Tweets for Real-time Visual Analytics,"4 pages, 2 tables, 1 figure, SIGSPATIAL GeoAI Workshop",,10.1145/3356471.3365243,,cs.SI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real-time tweets can provide useful information on evolving events and
situations. Geotagged tweets are especially useful, as they indicate the
location of origin and provide geographic context. However, only a small
portion of tweets are geotagged, limiting their use for situational awareness.
In this paper, we adapt, improve, and evaluate a state-of-the-art deep learning
model for city-level geolocation prediction, and integrate it with a visual
analytics system tailored for real-time situational awareness. We provide
computational evaluations to demonstrate the superiority and utility of our
geolocation prediction model within an interactive system.
","[{'version': 'v1', 'created': 'Sat, 5 Oct 2019 05:34:40 GMT'}]",2019-10-08,"[['Snyder', 'Luke S.', ''], ['Karimzadeh', 'Morteza', ''], ['Chen', 'Ray', ''], ['Ebert', 'David S.', '']]","['Geolocation prediction', 'twitter', 'deep learning']"
11629,1805.01752,Rafael Pereira Pires,"Aur\'elien Havet, Rafael Pires, Pascal Felber, Marcelo Pasin, Romain
  Rouvoy and Valerio Schiavoni","SecureStreams: A Reactive Middleware Framework for Secure Data Stream
  Processing","Barcelona, Spain, June 19-23, 2017, 10 pages",In Proceedings of DEBS 2017,10.1145/3093742.3093927,,cs.DC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The growing adoption of distributed data processing frameworks in a wide
diversity of application domains challenges end-to-end integration of
properties like security, in particular when considering deployments in the
context of large-scale clusters or multi-tenant Cloud infrastructures. This
paper therefore introduces SecureStreams, a reactive middleware framework to
deploy and process secure streams at scale. Its design combines the high-level
reactive dataflow programming paradigm with Intel's low-level software guard
extensions (SGX) in order to guarantee privacy and integrity of the processed
data. The experimental results of SecureStreams are promising: while offering a
fluent scripting language based on Lua, our middleware delivers high processing
throughput, thus enabling developers to implement secure processing pipelines
in just few lines of code.
","[{'version': 'v1', 'created': 'Fri, 4 May 2018 13:08:39 GMT'}]",2018-05-07,"[['Havet', 'Aurélien', ''], ['Pires', 'Rafael', ''], ['Felber', 'Pascal', ''], ['Pasin', 'Marcelo', ''], ['Rouvoy', 'Romain', ''], ['Schiavoni', 'Valerio', '']]","['Middleware', 'security', 'SGX', 'stream processing']"
11630,2009.09288,Mark Levin Sh.,Mark Sh. Levin,"On combinatorial optimization for dominating sets (literature survey,
  new models)","17 pages, figures 6, table 5",,10.13140/RG.2.2.34919.68006,,cs.DS cs.AI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper focuses on some versions of connected dominating set problems:
basic problems and multicriteria problems. A literature survey on basic problem
formulations and solving approaches is presented. The basic connected
dominating set problems are illustrated by simplifyed numerical examples. New
integer programming formulations of dominating set problems (with multiset
estimates) are suggested.
","[{'version': 'v1', 'created': 'Sat, 19 Sep 2020 19:52:53 GMT'}]",2020-09-22,"[['Levin', 'Mark Sh.', '']]","['combinatorial optimization', 'connected dominating sets', 'multicriteria decision making', 'solving strategy', 'heuristics', 'networking', 'multiset']"
11631,2112.12592,Jeffrey Hyman,"Jeffrey D. Hyman, Matthew R. Sweeney, Carl W. Gable, Daniil Svyatsky,
  Konstantin Lipnikov, J. David Moulton","Flow and Transport in Three-Dimensional Discrete Fracture Matrix Models
  using Mimetic Finite Difference on a Conforming Multi-Dimensional Mesh",,,10.1016/j.jcp.2022.111396,,cs.CE cs.NA math.NA,http://creativecommons.org/licenses/by/4.0/,"  We present a comprehensive workflow to simulate single-phase flow and
transport in fractured porous media using the discrete fracture matrix
approach. The workflow has three primary parts: (1) a method for conforming
mesh generation of and around a three-dimensional fracture network, (2) the
discretization of the governing equations using a second-order mimetic finite
difference method, and (3) implementation of numerical methods for
high-performance computing environments. A method to create a conforming
Delaunay tetrahedralization of the volume surrounding the fracture network,
where the triangular cells of the fracture mesh are faces in the volume mesh,
that addresses pathological cases which commonly arise and degrade mesh quality
is also provided. Our open-source subsurface simulator uses a hierarchy of
process kernels (one kernel per physical process) that allows for both strong
and weak coupling of the fracture and matrix domains. We provide verification
tests based on analytic solutions for flow and transport, as well as numerical
convergence. We also provide multiple expositions of the method in complex
fracture networks. In the first example, we demonstrate that the method is
robust by considering two scenarios where the fracture network acts as a
barrier to flow, as the primary pathway, or offers the same resistance as the
surrounding matrix. In the second test, flow and transport through a
three-dimensional stochastically generated network containing 257 fractures is
presented.
","[{'version': 'v1', 'created': 'Mon, 20 Dec 2021 21:16:27 GMT'}]",2022-07-27,"[['Hyman', 'Jeffrey D.', ''], ['Sweeney', 'Matthew R.', ''], ['Gable', 'Carl W.', ''], ['Svyatsky', 'Daniil', ''], ['Lipnikov', 'Konstantin', ''], ['Moulton', 'J. David', '']]","['Discrete Fracture Matrix', 'Computational Geometry', 'Mimetic Finite Difference', 'High']"
11632,2106.03988,Zohreh Shaghaghian,"Zohreh Shaghaghian, Wei Yan, Dezhen Song","Towards Learning Geometric Transformations through Play: An AR-powered
  approach","10 pages, 5 figures",,10.1145/3463914.3463915,,cs.HC cs.GR,http://creativecommons.org/licenses/by/4.0/,"  Despite the excessive developments of architectural parametric platforms,
parametric design is often interpreted as an architectural style rather than a
computational method. Also, the problem is still a lack of knowledge and skill
about the technical application of parametric design in architectural
modelling. Students often dive into utilizing complex digital modelling without
having a competent pedagogical context to learn algorithmic thinking and the
corresponding logic behind digital and parametric modelling. The insufficient
skills and superficial knowledge often result in utilizing the modelling
software through trial and error, not taking full advantage of what it has to
offer. Geometric transformations as the fundamental functions of parametric
modelling is explored in this study to anchor learning essential components in
parametric modelling. Students need to understand the differences between
variables, parameters, functions and their relations. Fologram, an Augmented
Reality tool, is utilized in this study to learn geometric transformation and
its components in an intuitive way. A LEGO set is used as an editable physical
model to improve spatial skill through hand movement beside an instant feedback
in the physical environment.
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2021 22:09:58 GMT'}]",2021-06-09,"[['Shaghaghian', 'Zohreh', ''], ['Yan', 'Wei', ''], ['Song', 'Dezhen', '']]","['Geometric transformation', 'Augmented Reality', 'Fologram']"
11633,2010.07111,Pablo Ouro,"Pablo Ouro, Unai Lopez-Novoa and Martyn Guest","On the performance of a highly-scalable Computational Fluid Dynamics
  code on AMD, ARM and Intel processors",,,10.1016/j.cpc.2021.108105,,cs.DC physics.flu-dyn,http://creativecommons.org/licenses/by/4.0/,"  No area of computing is hungrier for performance than High Performance
Computing (HPC), the demands of which continue to be a major driver for
processor performance and adoption of accelerators, and also advances in
memory, storage, and networking technologies. A key feature of the Intel
processor domination of the past decade has been the extensive adoption of GPUs
as coprocessors, whilst more recent developments have seen the increased
availability of a number of CPU processors, including the novel ARM-based
chips. This paper analyses the performance and scalability of a
state-of-the-art Computational Fluid Dynamics (CFD) code on three HPC cluster
systems equipped with AMD EPYC-Rome (EPYC, 4096 cores), ARM-based Marvell
ThunderX2 (TX2, 8192 cores) and Intel Skylake (SKL, 8000 cores) processors.
Three benchmark cases are designed with increasing computation-to-communication
ratio and numerical complexity, namely lid-driven cavity flow, Taylor-Green
vortex and a travelling solitary wave using the level-set method, adopted with
$4^{th}$-order central-differences or a $5^{th}$-order WENO scheme. Our results
show that the EPYC cluster delivers the best code performance for all the
setups under consideration. In the first two benchmarks, the SKL cluster
demonstrates faster computing times than the TX2 system, whilst in the solitary
wave simulations, the TX2 cluster achieves good scalability and similar
performance to the EPYC system, both improving on that obtained with the SKL
cluster. These results suggest that while the Intel SKL cores deliver the best
strong scalability, the associated cluster performance is lower compared to the
EPYC system. The TX2 cluster performance is promising considering its recent
addition to the HPC portfolio.
","[{'version': 'v1', 'created': 'Mon, 12 Oct 2020 14:05:04 GMT'}]",2021-08-18,"[['Ouro', 'Pablo', ''], ['Lopez-Novoa', 'Unai', ''], ['Guest', 'Martyn', '']]","['HPC', 'CFD', 'ARM ThunderX2', 'AMD EPYC-Rome', 'IntelSkylake', 'Performance Evaluation', 'Massively parallel implementation']"
11634,2207.09061,Ning Gui Prof. dr.,"Zhifeng Qiu, Wanxin Zeng, Dahua Liao, Ning Gui","A-SFS: Semi-supervised Feature Selection based on Multi-task
  Self-supervision","18 pages, 7 figures, accepted by knowledge-based systems",,10.1016/j.knosys.2022.109449,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Feature selection is an important process in machine learning. It builds an
interpretable and robust model by selecting the features that contribute the
most to the prediction target. However, most mature feature selection
algorithms, including supervised and semi-supervised, fail to fully exploit the
complex potential structure between features. We believe that these structures
are very important for the feature selection process, especially when labels
are lacking and data is noisy.
  To this end, we innovatively introduce a deep learning-based self-supervised
mechanism into feature selection problems, namely batch-Attention-based
Self-supervision Feature Selection(A-SFS). Firstly, a multi-task
self-supervised autoencoder is designed to uncover the hidden structure among
features with the support of two pretext tasks. Guided by the integrated
information from the multi-self-supervised learning model, a batch-attention
mechanism is designed to generate feature weights according to batch-based
feature selection patterns to alleviate the impacts introduced by a handful of
noisy data. This method is compared to 14 major strong benchmarks, including
LightGBM and XGBoost. Experimental results show that A-SFS achieves the highest
accuracy in most datasets. Furthermore, this design significantly reduces the
reliance on labels, with only 1/10 labeled data needed to achieve the same
performance as those state of art baselines. Results show that A-SFS is also
most robust to the noisy and missing data.
","[{'version': 'v1', 'created': 'Tue, 19 Jul 2022 04:22:27 GMT'}]",2022-07-20,"[['Qiu', 'Zhifeng', ''], ['Zeng', 'Wanxin', ''], ['Liao', 'Dahua', ''], ['Gui', 'Ning', '']]","['Feature selection', 'attention mechanism', 'self-supervised', 'autoencoder']"
11635,1903.05256,David Eppstein,David Eppstein,Cubic Planar Graphs that cannot be Drawn on few Lines,"15 pages, 10 figures. To appear in Proceedings of the 35th
  International Symposium on Computational Geometry (SoCG 2019)","J. Computational Geometry 12 (1): 178-197, 2021",10.20382/v12i1a8,,cs.CG,http://creativecommons.org/licenses/by/4.0/,"  For every integer $\ell$, we construct a cubic 3-vertex-connected planar
bipartite graph $G$ with $O(\ell^3)$ vertices such that there is no planar
straight-line drawing of $G$ whose vertices all lie on $\ell$ lines. This
strengthens previous results on graphs that cannot be drawn on few lines, which
constructed significantly larger maximal planar graphs. We also find apex-trees
and cubic bipartite series-parallel graphs that cannot be drawn on a bounded
number of lines.
","[{'version': 'v1', 'created': 'Tue, 12 Mar 2019 23:23:06 GMT'}]",2021-12-23,"[['Eppstein', 'David', '']]","['graph drawing', 'universal point sets', 'collinearity']"
11636,1810.05874,Petteri Teikari,"Petteri Teikari, Raymond P. Najjar, Leopold Schmetterer, Dan Milea","Embedded deep learning in ophthalmology: Making ophthalmic imaging
  smarter","This work has been submitted to ""Therapeutic Advances in
  Ophthalmology"" for possible publication 17 pages, 5 figures",Therapeutic advances in ophthalmology 11 (2019): 2515841419827172,10.1177/2515841419827172,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Deep learning has recently gained high interest in ophthalmology, due to its
ability to detect clinically significant features for diagnosis and prognosis.
Despite these significant advances, little is known about the ability of
various deep learning systems to be embedded within ophthalmic imaging devices,
allowing automated image acquisition. In this work, we will review the existing
and future directions for ""active acquisition"" embedded deep learning, leading
to as high quality images with little intervention by the human operator. In
clinical practice, the improved image quality should translate into more robust
deep learning-based clinical diagnostics. Embedded deep learning will be
enabled by the constantly improving hardware performance with low cost. We will
briefly review possible computation methods in larger clinical systems.
Briefly, they can be included in a three-layer framework composed of edge, fog
and cloud layers, the former being performed at a device-level. Improved edge
layer performance via ""active acquisition"" serves as an automatic data curation
operator translating to better quality data in electronic health records
(EHRs), as well as on the cloud layer, for improved deep learning-based
clinical data mining.
","[{'version': 'v1', 'created': 'Sat, 13 Oct 2018 15:20:32 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Feb 2019 09:17:47 GMT'}]",2019-05-28,"[['Teikari', 'Petteri', ''], ['Najjar', 'Raymond P.', ''], ['Schmetterer', 'Leopold', ''], ['Milea', 'Dan', '']]","['artificial intelligence', 'deep learning', 'embedded devices', 'medical devices', 'ophthalmology', 'ophthalmic devices']"
11637,2110.11611,Luis Larios-C\'ardenas,Luis \'Angel Larios-C\'ardenas and Fr\'ed\'eric Gibou,"Error-correcting neural networks for semi-Lagrangian advection in the
  level-set method",,"J. Comput. Phys., 471:111623, December 2022",10.1016/j.jcp.2022.111623,,cs.LG cs.NA math.NA,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We present a machine learning framework that blends image super-resolution
technologies with passive, scalar transport in the level-set method. Here, we
investigate whether we can compute on-the-fly, data-driven corrections to
minimize numerical viscosity in the coarse-mesh evolution of an interface. The
proposed system's starting point is the semi-Lagrangian formulation. And, to
reduce numerical dissipation, we introduce an error-quantifying multilayer
perceptron. The role of this neural network is to improve the numerically
estimated surface trajectory. To do so, it processes localized level-set,
velocity, and positional data in a single time frame for select vertices near
the moving front. Our main contribution is thus a novel
machine-learning-augmented transport algorithm that operates alongside
selective redistancing and alternates with conventional advection to keep the
adjusted interface trajectory smooth. Consequently, our procedure is more
efficient than full-scan convolutional-based applications because it
concentrates computational effort only around the free boundary. Also, we show
through various tests that our strategy is effective at counteracting both
numerical diffusion and mass loss. In simple advection problems, for example,
our method can achieve the same precision as the baseline scheme at twice the
resolution but at a fraction of the cost. Similarly, our hybrid technique can
produce feasible solidification fronts for crystallization processes. On the
other hand, tangential shear flows and highly deforming simulations can
precipitate bias artifacts and inference deterioration. Likewise, stringent
design velocity constraints can limit our solver's application to problems
involving rapid interface changes. In the latter cases, we have identified
several opportunities to enhance robustness without forgoing our approach's
basic concept.
","[{'version': 'v1', 'created': 'Fri, 22 Oct 2021 06:36:15 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Aug 2022 03:52:18 GMT'}, {'version': 'v3', 'created': 'Fri, 23 Sep 2022 18:48:49 GMT'}, {'version': 'v4', 'created': 'Wed, 28 Sep 2022 04:19:17 GMT'}]",2022-09-29,"[['Larios-Cárdenas', 'Luis Ángel', ''], ['Gibou', 'Frédéric', '']]","['machine learning', 'semi-Lagrangian advection', 'error modeling', 'neural networks', 'level-set method', 'Stefan problem']"
11638,1908.09297,Projjal Gupta,Projjal Gupta,4-Bit High-Speed Binary Ling Adder,"4 pages, 5 Figures",,10.13140/RG.2.2.15095.68002,,cs.AR,http://creativecommons.org/licenses/by/4.0/,"  Binary addition is one of the most primitive and most commonly used
applications in computer arithmetic. A large variety of algorithms and
implementations have been proposed for binary addition. Huey Ling proposed a
simpler form of CLA equations which rely on adjacent pair bits. Along with bit
generate and bit propagate, we introduce another prefix bit, the half sum bit.
Ling adder increases the speed of n-bit binary addition, which is an upgrade
from the existing Carry-Look-Ahead adder. Several variants of the carry
look-ahead equations, like Ling carries, have been presented that simplify
carry computation and can lead to faster structures. Ling adders, make use of
Ling carry and propagate bits, in order to calculate the sum bit. As a result,
dependency on the previous bit addition is reduced; that is, ripple effect is
lowered. This paper provides a comparative study on the implementation of the
above mentioned high-speed adders.
","[{'version': 'v1', 'created': 'Sun, 25 Aug 2019 10:37:29 GMT'}]",2019-08-28,"[['Gupta', 'Projjal', '']]","['Ling Adder', 'High Speed Binary Adder', 'Binary Addition']"
11639,2208.07201,Zepeng Huai,"Zepeng Huai, Zhe Wang, Yifan Zhu, Peng Zhang","AMinerGNN: Heterogeneous Graph Neural Network for Paper Click-through
  Rate Prediction with Fusion Query",,CIKM 2022,10.1145/3511808.3557544,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Paper recommendation with user-generated keyword is to suggest papers that
simultaneously meet user's interests and are relevant to the input keyword.
This is a recommendation task with two queries, a.k.a. user ID and keyword.
However, existing methods focus on recommendation according to one query,
a.k.a. user ID, and are not applicable to solving this problem. In this paper,
we propose a novel click-through rate (CTR) prediction model with heterogeneous
graph neural network, called AMinerGNN, to recommend papers with two queries.
Specifically, AMinerGNN constructs a heterogeneous graph to project user,
paper, and keyword into the same embedding space by graph representation
learning. To process two queries, a novel query attentive fusion layer is
designed to recognize their importances dynamically and then fuse them as one
query to build a unified and end-to-end recommender system. Experimental
results on our proposed dataset and online A/B tests prove the superiority of
AMinerGNN.
","[{'version': 'v1', 'created': 'Mon, 15 Aug 2022 14:04:08 GMT'}]",2022-08-16,"[['Huai', 'Zepeng', ''], ['Wang', 'Zhe', ''], ['Zhu', 'Yifan', ''], ['Zhang', 'Peng', '']]","['Click-Through Rate Prediction', 'Graph Neural Network', 'RecommenderSystem']"
11640,2110.06838,Michele Polese,"Amir Ashtari Gargari, Michele Polese, Michele Zorzi","Full-stack Comparison of Channel Models for Networks Above 100 GHz in an
  Indoor Scenario","Amir Ashtari Gargari, Michele Polese, Michele Zorzi. 2022. Full-stack
  Comparison of Channel Models for Networks Above 100 GHz in an Indoor
  Scenario. In 5th ACM Workshop on Millimeter-Wave and Terahertz Networks and
  Sensing Systems (mmNets '21), January 31-February 4, 2022, New Orleans, LA,
  USA. ACM, New York, NY, USA, 6 pages",,10.1145/3477081.3481677,,cs.NI eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Sixth Generation (6G) of mobile networks is expected to use carrier
frequencies in the spectrum above 100 GHz, to satisfy the demands for higher
data rates and bandwidth of future digital applications. The development of
networking solutions at such high frequencies is challenged by the harsh
propagation environment, and by the need for directional communications and
signal processing at high data rates. A fundamental step in defining and
developing wireless networks above 100 GHz is given by an accurate performance
evaluation. For simulations, this strongly depends on the accuracy of the
modeling of the channel and of the interaction with the higher layers of the
stack. This paper introduces the implementation of two recently proposed
channel models (based on ray tracing and on a fully stochastic model) for the
140 GHz band for the ns-3 TeraSim module, which enables simulation of macro
wireless networks in the sub-terahertz and terahertz spectrum. We also compare
the two channel models with full-stack simulations in an indoor scenario,
highlighting differences and similarities in how they interact with the
protocol stack and antenna model of TeraSim.
","[{'version': 'v1', 'created': 'Wed, 13 Oct 2021 16:24:53 GMT'}]",2021-10-14,"[['Gargari', 'Amir Ashtari', ''], ['Polese', 'Michele', ''], ['Zorzi', 'Michele', '']]","['Terahertz', 'Cellular Networks', 'mmWave', 'channel modeling']"
11641,2001.01618,Sudipta Paul Ms.,Sudipta Paul and Subhankar Mishra,"ARA : Aggregated RAPPOR and Analysis for Centralized Differential
  Privacy",,SN COMPUT. SCI. (2020) 1: 22,10.1007/s42979-019-0023-y,,cs.CR cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Differential privacy(DP) has now become a standard in case of sensitive
statistical data analysis. The two main approaches in DP is local and central.
Both the approaches have a clear gap in terms of data storing,amount of data to
be analyzed, analysis, speed etc. Local wins on the speed. We have tested the
state of the art standard RAPPOR which is a local approach and supported this
gap. Our work completely focuses on that part too. Here, we propose a model
which initially collects RAPPOR reports from multiple clients which are then
pushed to a Tf-Idf estimation model. The Tf-Idf estimation model then estimates
the reports on the basis of the occurrence of ""on bit"" in a particular position
and its contribution to that position. Thus it generates a centralized
differential privacy analysis from multiple clients. Our model successfully and
efficiently analyzed the major truth value every time.
","[{'version': 'v1', 'created': 'Mon, 6 Jan 2020 15:03:35 GMT'}]",2020-01-07,"[['Paul', 'Sudipta', ''], ['Mishra', 'Subhankar', '']]","['Differential Privacy', 'Anonymity', 'Security', 'RAPPOR', 'Tf-Idf']"
11642,2210.10628,Mogan Gim,"Mogan Gim, Donghee Choi, Kana Maruyama, Jihun Choi, Hajung Kim,
  Donghyeon Park and Jaewoo Kang","RecipeMind: Guiding Ingredient Choices from Food Pairing to Recipe
  Completion using Cascaded Set Transformer",Accepted and to be appeared in CIKM-2022,,10.1145/3511808.3557092,,cs.IR cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a computational approach for recipe ideation, a downstream task
that helps users select and gather ingredients for creating dishes. To perform
this task, we developed RecipeMind, a food affinity score prediction model that
quantifies the suitability of adding an ingredient to set of other ingredients.
We constructed a large-scale dataset containing ingredient co-occurrence based
scores to train and evaluate RecipeMind on food affinity score prediction.
Deployed in recipe ideation, RecipeMind helps the user expand an initial set of
ingredients by suggesting additional ingredients. Experiments and qualitative
analysis show RecipeMind's potential in fulfilling its assistive role in
cuisine domain.
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2022 06:35:49 GMT'}]",2022-10-20,"[['Gim', 'Mogan', ''], ['Choi', 'Donghee', ''], ['Maruyama', 'Kana', ''], ['Choi', 'Jihun', ''], ['Kim', 'Hajung', ''], ['Park', 'Donghyeon', ''], ['Kang', 'Jaewoo', '']]","['Recipe Ideation', 'Computational Cooking', 'Ingredient Set Expansion', 'Food A\ue004nity Score', 'Cascaded Set Transformer', 'Recipe Context']"
11643,2010.01571,Nicola Orio,"Nicola Orio, Norbert Schnell, and Marcelo M. Wanderley",Input Devices for Musical Expression: Borrowing Tools from HCI,"Proceedings of the International Conference on New Interfaces for
  Musical Expression, 2001",,10.5281/zenodo.1176370,,cs.HC cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  This paper reviews the existing literature on input device evaluation and
design in human-computer interaction (HCI) and discusses possible applications
of this knowledge to the design and evaluation of new interfaces for musical
expression. Specifically, a set of musical tasks is suggested to allow the
evaluation of different existing controllers.
","[{'version': 'v1', 'created': 'Sun, 4 Oct 2020 12:56:14 GMT'}]",2020-10-06,"[['Orio', 'Nicola', ''], ['Schnell', 'Norbert', ''], ['Wanderley', 'Marcelo M.', '']]","['Input device design', 'gestural control', 'interactive systems']"
11644,1810.04201,Grzegorz Korcyl,Grzegorz Korcyl and Piotr Korcyl,Towards Lattice Quantum Chromodynamics on FPGA devices,"17 pages, 4 figures",,10.1016/j.cpc.2019.107029,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we describe a single-node, double precision Field Programmable
Gate Array (FPGA) implementation of the Conjugate Gradient algorithm in the
context of Lattice Quantum Chromodynamics. As a benchmark of our proposal we
invert numerically the Dirac-Wilson operator on a 4-dimensional grid on three
Xilinx hardware solutions: Zynq Ultrascale+ evaluation board, the Alveo U250
accelerator and the largest device available on the market, the VU13P device.
In our implementation we separate software/hardware parts in such a way that
the entire multiplication by the Dirac operator is performed in hardware, and
the rest of the algorithm runs on the host. We find out that the FPGA
implementation can offer a performance comparable with that obtained using
current CPU or Intel's many core Xeon Phi accelerators. A possible multiple
node FPGA-based system is discussed and we argue that power-efficient High
Performance Computing (HPC) systems can be implemented using FPGA devices only.
","[{'version': 'v1', 'created': 'Mon, 8 Oct 2018 13:03:16 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Dec 2019 07:16:09 GMT'}]",2019-12-05,"[['Korcyl', 'Grzegorz', ''], ['Korcyl', 'Piotr', '']]","['High Performance Computing', 'FPGA devices', 'Lattice QCD Calculations', 'Computer Science andTechnology']"
11645,2202.09827,Vladimir Ivashkin,"Vladimir Ivashkin, Pavel Chebotarev","Dissecting graph measure performance for node clustering in LFR
  parameter space",Preprint Complex Networks and their Applications 2021 | CNA 2021,"International Conference on Complex Networks and Their
  Applications, pp. 328-341. Springer, Cham, 2021",10.1007/978-3-030-93409-5_28,,cs.SI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph measures that express closeness or distance between nodes can be
employed for graph nodes clustering using metric clustering algorithms. There
are numerous measures applicable to this task, and which one performs better is
an open question. We study the performance of 25 graph measures on generated
graphs with different parameters. While usually measure comparisons are limited
to general measure ranking on a particular dataset, we aim to explore the
performance of various measures depending on graph features. Using an LFR graph
generator, we create a dataset of 11780 graphs covering the whole LFR parameter
space. For each graph, we assess the quality of clustering with k-means
algorithm for each considered measure. Based on this, we determine the best
measure for each area of the parameter space. We find that the parameter space
consists of distinct zones where one particular measure is the best. We analyze
the geometry of the resulting zones and describe it with simple criteria. Given
particular graph parameters, this allows us to recommend a particular measure
to use for clustering.
","[{'version': 'v1', 'created': 'Sun, 20 Feb 2022 14:52:52 GMT'}]",2022-02-22,"[['Ivashkin', 'Vladimir', ''], ['Chebotarev', 'Pavel', '']]","['graphs', 'graph measures', 'clustering', 'kernel k-means']"
11646,2006.02775,Salah Harb,"Salah Harb, M. Omair Ahmad, M.N.S Swamy","Design and Hardware Implementation of a Separable Image Steganographic
  Scheme Using Public-key Cryptosystem","14 pages, 5 figures, conference",,10.5121/csit.2020.100521,,cs.CR eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a novel and efficient hardware implementation of
steganographic cryptosystem based on a public-key cryptography is proposed.
Digital images are utilized as carriers of secret data between sender and
receiver parties in the communication channel. The proposed public-key
cryptosystem offers a separable framework that allows to embed or extract
secret data and encrypt or decrypt the carrier using the public-private key
pair, independently. Paillier cryptographic system is adopted to encrypt and
decrypt pixels of the digital image. To achieve efficiency, a proposed
efficient parallel montgomery exponentiation core is designed and implemented
for performing the underlying field operations in the Paillier cryptosystem.
The hardware implementation results of the proposed steganographic cryptosystem
show an efficiency in terms of area (resources), performance (speed) and power
consumption. Our steganographic cryptosystem represents a small footprint
making it well-suited for the embedded systems and real-time processing engines
in applications such as medical scanning devices, autopilot cars and drones.
","[{'version': 'v1', 'created': 'Thu, 4 Jun 2020 11:08:24 GMT'}]",2020-06-05,"[['Harb', 'Salah', ''], ['Ahmad', 'M. Omair', ''], ['Swamy', 'M. N. S', '']]","['Image Steganography', 'Public-Key Cryptography', 'Homomorphic Cryptosystem', 'Montgomery']"
11647,1506.05018,Aleksey Buzmakov,Aleksey Buzmakov and Sergei O. Kuznetsov and Amedeo Napoli,Revisiting Pattern Structure Projections,"16 pages, 4 figures, ICFCA-2015 conference","Formal Concept Analysis. Springer International Publishing, 2015.
  200-215",10.1007/978-3-319-19545-2_13,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Formal concept analysis (FCA) is a well-founded method for data analysis and
has many applications in data mining. Pattern structures is an extension of FCA
for dealing with complex data such as sequences or graphs. However the
computational complexity of computing with pattern structures is high and
projections of pattern structures were introduced for simplifying computation.
In this paper we introduce o-projections of pattern structures, a
generalization of projections which defines a wider class of projections
preserving the properties of the original approach. Moreover, we show that
o-projections form a semilattice and we discuss the correspondence between
o-projections and the representation contexts of o-projected pattern
structures.
  KEYWORDS: formal concept analysis, pattern structures, representation
contexts, projections
","[{'version': 'v1', 'created': 'Tue, 16 Jun 2015 16:13:43 GMT'}]",2015-06-17,"[['Buzmakov', 'Aleksey', ''], ['Kuznetsov', 'Sergei O.', ''], ['Napoli', 'Amedeo', '']]","['formal concept analysis', 'pattern structures', 'representation contexts', 'projections']"
11648,2004.13974,Lutz Bornmann Dr.,"Lutz Bornmann, Robin Haunschild, and Vanash M. Patel","Are papers addressing certain diseases perceived where these diseases
  are prevalent? The proposal to use Twitter data as social-spatial sensors",,,10.1371/journal.pone.0242550,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose to use Twitter data as social-spatial sensors. This study deals
with the question whether research papers on certain diseases are perceived by
people in regions (worldwide) that are especially concerned by the diseases.
Since (some) Twitter data contain location information, it is possible to
spatially map the activity of Twitter users referring to certain papers (e.g.,
dealing with tuberculosis). The resulting maps reveal whether heavy activity on
Twitter is correlated with large numbers of people having certain diseases. In
this study, we focus on tuberculosis, human immunodeficiency virus (HIV), and
malaria, since the World Health Organization ranks these diseases as the top
three causes of death worldwide by a single infectious agent. The results of
the social-spatial Twitter maps (and additionally performed regression models)
reveal the usefulness of the proposed sensor approach. One receives an
impression of how research papers on the diseases have been perceived by people
in regions that are especially concerned by the diseases. Our study
demonstrates a promising approach for using Twitter data for research
evaluation purposes beyond simple counting of tweets.
","[{'version': 'v1', 'created': 'Wed, 29 Apr 2020 06:32:42 GMT'}]",2021-01-27,"[['Bornmann', 'Lutz', ''], ['Haunschild', 'Robin', ''], ['Patel', 'Vanash M.', '']]","['altmetrics', 'Twitter', 'spatial maps', 'malaria', 'human immunodeficiency virus (HIV)', 'tuberculosis']"
11649,1903.05838,Jude Tchaye-Kondi,"Jude Tchaye-Kondi, Yanlong Zhai, Kwei-Jay Lin, Wenjun Tao, and Kai
  Yang","Hadoop Perfect File: A fast access container for small files with direct
  in disc metadata access",,,10.1016/j.jpdc.2021.05.011,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Storing and processing massive small files is one of the major challenges for
the Hadoop Distributed File System (HDFS). In order to provide fast data
access, the NameNode (NN) in HDFS maintains the metadata of all files in its
main-memory. Hadoop performs well with a small number of large files that
require relatively little metadata in the NN s memory. But for a large number
of small files, Hadoop has problems such as NN memory overload caused by the
huge metadata size of these small files. We present a new type of archive file,
Hadoop Perfect File (HPF), to solve HDFS s small files problem by merging small
files into a large file on HDFS. Existing archive files offer limited
functionality and have poor performance when accessing a file in the merged
file due to the fact that during metadata lookup it is necessary to read and
process the entire index file(s). In contrast, HPF file can directly access the
metadata of a particular file from its index file without having to process it
entirely. The HPF index system uses two hash functions: file s metadata are
distributed through index files by using a dynamic hash function and, for each
index file, we build an order preserving perfect hash function that preserves
the position of each file s metadata in the index file. The HPF design will
only read the part of the index file that contains the metadata of the searched
file during its access. HPF file also supports the file appending functionality
after its creation. Our experiments show that HPF can be more than 40% faster
file s access from the original HDFS. If we don t consider the caching effect,
HPF s file access is around 179% faster than MapFile and 11294% faster than HAR
file. If we consider caching effect, HPF is around 35% faster than MapFile and
105% faster than HAR file.
","[{'version': 'v1', 'created': 'Thu, 14 Mar 2019 07:12:48 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Apr 2019 03:59:10 GMT'}]",2021-06-15,"[['Tchaye-Kondi', 'Jude', ''], ['Zhai', 'Yanlong', ''], ['Lin', 'Kwei-Jay', ''], ['Tao', 'Wenjun', ''], ['Yang', 'Kai', '']]","['Hadoop', 'Small files', 'Distributed file system', 'Performance optimization', 'Archive files', 'Fast files access']"
11650,2005.10890,Jessica Diaz,"Jorge P\'erez, Jessica D\'iaz, Javier Garcia-Martin, Bernardo Tabuenca","Systematic Literature Reviews in Software Engineering -- Enhancement of
  the Study Selection Process using Cohen's Kappa Statistic","20 pages, 4 figures, submitted to Journal of Systems and Software",,10.1016/j.jss.2020.110657,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Systematic literature reviews (SLRs) rely on a rigorous and
auditable methodology for minimizing biases and ensuring reliability. A common
kind of bias arises when selecting studies using a set of inclusion/exclusion
criteria. This bias can be decreased through dual revision, which makes the
selection process more time-consuming and remains prone to generating bias
depending on how each researcher interprets the inclusion/exclusion criteria.
Objective: To reduce the bias and time spent in the study selection process,
this paper presents a process for selecting studies based on the use of Cohen's
Kappa statistic. We have defined an iterative process based on the use of this
statistic during which the criteria are refined until obtain almost perfect
agreement (k>0.8). At this point, the two researchers interpret the selection
criteria in the same way, and thus, the bias is reduced. Starting from this
agreement, dual review can be eliminated; consequently, the time spent is
drastically shortened. Method: The feasibility of this iterative process for
selecting studies is demonstrated through a tertiary study in the area of
software engineering on works that were published from 2005 to 2018. Results:
The time saved in the study selection process was 28% (for 152 studies) and if
the number of studies is sufficiently large, the time saved tend asymptotically
to 50%. Conclusions: Researchers and students may take advantage of this
iterative process for selecting studies when conducting SLRs to reduce bias in
the interpretation of inclusion and exclusion criteria. It is especially useful
for research with few resources.
","[{'version': 'v1', 'created': 'Thu, 21 May 2020 20:26:14 GMT'}]",2020-05-28,"[['Pérez', 'Jorge', ''], ['Díaz', 'Jessica', ''], ['Garcia-Martin', 'Javier', ''], ['Tabuenca', 'Bernardo', '']]","['Systematic review', 'Evidence-based practice', 'Cohen’s Kappa']"
11651,2106.06831,Omri Suissa,"Omri Suissa, Avshalom Elmalech, Maayan Zhitomirsky-Geffet",Toward the Optimized Crowdsourcing Strategy for OCR Post-Correction,"25 pages, 12 figures, 1 table","Aslib Journal of Information Management, Vol. 72 No. 2, pp.
  179-197 (2020)",10.1108/AJIM-07-2019-0189,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Digitization of historical documents is a challenging task in many digital
humanities projects. A popular approach for digitization is to scan the
documents into images, and then convert images into text using Optical
Character Recognition (OCR) algorithms. However, the outcome of OCR processing
of historical documents is usually inaccurate and requires post-processing
error correction. This study investigates how crowdsourcing can be utilized to
correct OCR errors in historical text collections, and which crowdsourcing
methodology is the most effective in different scenarios and for various
research objectives. A series of experiments with different micro-task's
structures and text lengths was conducted with 753 workers on the Amazon's
Mechanical Turk platform. The workers had to fix OCR errors in a selected
historical text. To analyze the results, new accuracy and efficiency measures
have been devised. The analysis suggests that in terms of accuracy, the optimal
text length is medium (paragraph-size) and the optimal structure of the
experiment is two-phase with a scanned image. In terms of efficiency, the best
results were obtained when using longer text in the single-stage structure with
no image. The study provides practical recommendations to researchers on how to
build the optimal crowdsourcing task for OCR post-correction. The developed
methodology can also be utilized to create golden standard historical texts for
automatic OCR post-correction. This is the first attempt to systematically
investigate the influence of various factors on crowdsourcing-based OCR
post-correction and propose an optimal strategy for this process.
","[{'version': 'v1', 'created': 'Sat, 12 Jun 2021 18:42:01 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Jun 2022 06:53:28 GMT'}]",2022-06-28,"[['Suissa', 'Omri', ''], ['Elmalech', 'Avshalom', ''], ['Zhitomirsky-Geffet', 'Maayan', '']]","['OCR post-correction', 'historical texts', 'crowdsourcing', 'task optimization', 'task']"
11652,2211.10549,Zhabiz Gharibshah,"Zhabiz Gharibshah, Xingquan Zhu",Local Contrastive Feature learning for Tabular Data,,,10.1145/3511808.3557630,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Contrastive self-supervised learning has been successfully used in many
domains, such as images, texts, graphs, etc., to learn features without
requiring label information. In this paper, we propose a new local contrastive
feature learning (LoCL) framework, and our theme is to learn local
patterns/features from tabular data. In order to create a niche for local
learning, we use feature correlations to create a maximum-spanning tree, and
break the tree into feature subsets, with strongly correlated features being
assigned next to each other. Convolutional learning of the features is used to
learn latent feature space, regulated by contrastive and reconstruction losses.
Experiments on public tabular datasets show the effectiveness of the proposed
method versus state-of-the-art baseline methods.
","[{'version': 'v1', 'created': 'Sat, 19 Nov 2022 00:53:41 GMT'}]",2022-11-22,"[['Gharibshah', 'Zhabiz', ''], ['Zhu', 'Xingquan', '']]","['Contrastive learning', 'self-supervised learning', 'tabular data']"
11653,1508.05373,Yun-Fu Liu,"Yun-Fu Liu, Jing-Ming Guo",Dot-Diffused Halftoning with Improved Homogeneity,Accepted to IEEE Trans. on Image Processing,,10.1109/TIP.2015.2470599,,cs.MM cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Compared to the error diffusion, dot diffusion provides an additional
pixel-level parallelism for digital halftoning. However, even though its
periodic and blocking artifacts had been eased by previous works, it was still
far from satisfactory in terms of the blue noise spectrum perspective. In this
work, we strengthen the relationship among the pixel locations of the same
processing order by an iterative halftoning method, and the results demonstrate
a significant improvement. Moreover, a new approach of deriving the averaged
power spectrum density (APSD) is proposed to avoid the regular sampling of the
well-known Bartlett's procedure which inaccurately presents the halftone
periodicity of certain halftoning techniques with parallelism. As a result, the
proposed dot diffusion is substantially superior to the state-of-the-art
parallel halftoning methods in terms of visual quality and artifact-free
property, and competitive runtime to the theoretical fastest ordered dithering
is offered simultaneously.
","[{'version': 'v1', 'created': 'Fri, 21 Aug 2015 19:06:53 GMT'}]",2015-10-28,"[['Liu', 'Yun-Fu', ''], ['Guo', 'Jing-Ming', '']]","['Dot diffusion', 'halftoning', 'direct binary search', 'power spectrum density', 'ordered dithering']"
11654,2004.12590,"Dominik K\""oppl","Dominik K\""oppl, Daiki Hashimoto, Diptarama Hendrian, and Ayumi
  Shinohara",In-Place Bijective Burrows-Wheeler Transforms,In proceedings of CPM 2020,,10.4230/LIPIcs.CPM.2020.23,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  One of the most well-known variants of the Burrows-Wheeler transform (BWT)
[Burrows and Wheeler, 1994] is the bijective BWT (BBWT) [Gil and Scott, arXiv
2012], which applies the extended BWT (EBWT) [Mantaci et al., TCS 2007] to the
multiset of Lyndon factors of a given text. Since the EBWT is invertible, the
BBWT is a bijective transform in the sense that the inverse image of the EBWT
restores this multiset of Lyndon factors such that the original text can be
obtained by sorting these factors in non-increasing order. In this paper, we
present algorithms constructing or inverting the BBWT in-place using quadratic
time. We also present conversions from the BBWT to the BWT, or vice versa,
either (a) in-place using quadratic time, or (b) in the run-length compressed
setting using $O(n \lg r / \lg \lg r)$ time with $O(r \lg n)$ bits of words,
where $r$ is the sum of character runs in the BWT and the BBWT.
","[{'version': 'v1', 'created': 'Mon, 27 Apr 2020 05:52:58 GMT'}]",2020-04-28,"[['Köppl', 'Dominik', ''], ['Hashimoto', 'Daiki', ''], ['Hendrian', 'Diptarama', ''], ['Shinohara', 'Ayumi', '']]","['In-Place Algorithms', 'Burrows-Wheeler transform', 'Lyndon words']"
11655,2012.07381,Adriano Franci,"Adriano Franci, Maxime Cordy, Martin Gubri, Mike Papadakis, Yves Le
  Traon","Influence-Driven Data Poisoning in Graph-Based Semi-Supervised
  Classifiers",,,10.1145/3522664.3528606,,cs.LG cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Graph-based Semi-Supervised Learning (GSSL) is a practical solution to learn
from a limited amount of labelled data together with a vast amount of
unlabelled data. However, due to their reliance on the known labels to infer
the unknown labels, these algorithms are sensitive to data quality. It is
therefore essential to study the potential threats related to the labelled
data, more specifically, label poisoning. In this paper, we propose a novel
data poisoning method which efficiently approximates the result of label
inference to identify the inputs which, if poisoned, would produce the highest
number of incorrectly inferred labels. We extensively evaluate our approach on
three classification problems under 24 different experimental settings each.
Compared to the state of the art, our influence-driven attack produces an
average increase of error rate 50\% higher, while being faster by multiple
orders of magnitude. Moreover, our method can inform engineers of inputs that
deserve investigation (relabelling them) before training the learning model. We
show that relabelling one-third of the poisoned inputs (selected based on their
influence) reduces the poisoning effect by 50\%.
","[{'version': 'v1', 'created': 'Mon, 14 Dec 2020 10:05:22 GMT'}, {'version': 'v2', 'created': 'Wed, 11 May 2022 13:26:46 GMT'}]",2022-05-12,"[['Franci', 'Adriano', ''], ['Cordy', 'Maxime', ''], ['Gubri', 'Martin', ''], ['Papadakis', 'Mike', ''], ['Traon', 'Yves Le', '']]","['Machine learning', 'semi-supervised learning', 'data poisoning']"
11656,2212.03041,Giorgio Angelotti,Giorgio Angelotti and Natalia D\'iaz-Rodr\'iguez,"Towards a more efficient computation of individual attribute and policy
  contribution for post-hoc explanation of cooperative multi-agent systems
  using Myerson values",Accepted for publication in Elsevier's Knowledge-Based Systems,Knowledge-Based Systems 260 (2023) 110189,10.1016/j.knosys.2022.110189,,cs.AI cs.LG cs.MA,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A quantitative assessment of the global importance of an agent in a team is
as valuable as gold for strategists, decision-makers, and sports coaches. Yet,
retrieving this information is not trivial since in a cooperative task it is
hard to isolate the performance of an individual from the one of the whole
team. Moreover, it is not always clear the relationship between the role of an
agent and his personal attributes. In this work we conceive an application of
the Shapley analysis for studying the contribution of both agent policies and
attributes, putting them on equal footing. Since the computational complexity
is NP-hard and scales exponentially with the number of participants in a
transferable utility coalitional game, we resort to exploiting a-priori
knowledge about the rules of the game to constrain the relations between the
participants over a graph. We hence propose a method to determine a
Hierarchical Knowledge Graph of agents' policies and features in a Multi-Agent
System. Assuming a simulator of the system is available, the graph structure
allows to exploit dynamic programming to assess the importances in a much
faster way. We test the proposed approach in a proof-of-case environment
deploying both hardcoded policies and policies obtained via Deep Reinforcement
Learning. The proposed paradigm is less computationally demanding than
trivially computing the Shapley values and provides great insight not only into
the importance of an agent in a team but also into the attributes needed to
deploy the policy at its best.
","[{'version': 'v1', 'created': 'Tue, 6 Dec 2022 15:15:00 GMT'}]",2022-12-21,"[['Angelotti', 'Giorgio', ''], ['Díaz-Rodríguez', 'Natalia', '']]","['Explainable Multi-Agent Systems', 'Explainable Artificial Intelligence', 'Myerson values', 'Shapley values', 'A-prioriknowledge graphs']"
11657,2203.00350,Vasileios Stamatis,"Vasileios Stamatis, Michail Salampasis",Results Merging in the Patent Domain,5 pages,"ICPS Series ; PCI-2020: 24th Pan-Hellenic Conference on
  Informatics ; Pages 229-232",10.1145/3437120.3437313,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we test machine learning methods for results merging in patent
document retrieval. Specifically, we examine random forest, decision tree,
support vector machine (SVR), linear regression, polynomial regression, and
deep neural networks (DNNs). We use two different methods for results merging,
the multiple models (MM) method and the global model method (GM). Furthermore,
we examine whether the ranking of the document's scores is linearly
explainable. The CLEF-IP 2011 standard test collection was used in our
experiments. The random forest produces the best results in comparison to all
other models, and it fits the data better than linear and polynomial
approaches.
","[{'version': 'v1', 'created': 'Tue, 1 Mar 2022 10:53:45 GMT'}]",2022-03-02,"[['Stamatis', 'Vasileios', ''], ['Salampasis', 'Michail', '']]","['Patent Retrieval', 'Results merging', 'Federated Search']"
11658,2004.03276,Joel Scheuner,"Joel Scheuner, Philipp Leitner","Function-as-a-Service Performance Evaluation: A Multivocal Literature
  Review",improvements including postprint updates,,10.1016/j.jss.2020.110708,,cs.PF cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Function-as-a-Service (FaaS) is one form of the serverless cloud computing
paradigm and is defined through FaaS platforms (e.g., AWS Lambda) executing
event-triggered code snippets (i.e., functions). Many studies that empirically
evaluate the performance of such FaaS platforms have started to appear but we
are currently lacking a comprehensive understanding of the overall domain. To
address this gap, we conducted a multivocal literature review (MLR) covering
112 studies from academic (51) and grey (61) literature. We find that existing
work mainly studies the AWS Lambda platform and focuses on micro-benchmarks
using simple functions to measure CPU speed and FaaS platform overhead (i.e.,
container cold starts). Further, we discover a mismatch between academic and
industrial sources on tested platform configurations, find that function
triggers remain insufficiently studied, and identify HTTP API gateways and
cloud storages as the most used external service integrations. Following
existing guidelines on experimentation in cloud systems, we discover many flaws
threatening the reproducibility of experiments presented in the surveyed
studies. We conclude with a discussion of gaps in literature and highlight
methodological suggestions that may serve to improve future FaaS performance
evaluation studies.
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2020 11:21:47 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Jun 2020 15:31:53 GMT'}, {'version': 'v3', 'created': 'Sun, 19 Jul 2020 16:35:24 GMT'}]",2020-07-21,"[['Scheuner', 'Joel', ''], ['Leitner', 'Philipp', '']]","['Cloud Computing', 'Serverless', 'Function-as-a-Service', 'Performance', 'Benchmarking', 'Multivocal LiteratureReview']"
11659,2112.00967,Wenqiao Zhang,"Wenqiao Zhang, Xin Eric Wang, Siliang Tang, Haizhou Shi, Haocheng Shi,
  Jun Xiao, Yueting Zhuang, William Yang Wang",Relational Graph Learning for Grounded Video Description Generation,"10 pages, 5 figures, ACM MM 2020",,10.1145/3394171.3413746,,cs.CV cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Grounded video description (GVD) encourages captioning models to attend to
appropriate video regions (e.g., objects) dynamically and generate a
description. Such a setting can help explain the decisions of captioning models
and prevents the model from hallucinating object words in its description.
However, such design mainly focuses on object word generation and thus may
ignore fine-grained information and suffer from missing visual concepts.
Moreover, relational words (e.g., ""jump left or right"") are usual
spatio-temporal inference results, i.e., these words cannot be grounded on
certain spatial regions. To tackle the above limitations, we design a novel
relational graph learning framework for GVD, in which a language-refined scene
graph representation is designed to explore fine-grained visual concepts.
Furthermore, the refined graph can be regarded as relational inductive
knowledge to assist captioning models in selecting the relevant information it
needs to generate correct words. We validate the effectiveness of our model
through automatic metrics and human evaluation, and the results indicate that
our approach can generate more fine-grained and accurate description, and it
solves the problem of object hallucination to some extent.
","[{'version': 'v1', 'created': 'Thu, 2 Dec 2021 03:48:45 GMT'}]",2021-12-03,"[['Zhang', 'Wenqiao', ''], ['Wang', 'Xin Eric', ''], ['Tang', 'Siliang', ''], ['Shi', 'Haizhou', ''], ['Shi', 'Haocheng', ''], ['Xiao', 'Jun', ''], ['Zhuang', 'Yueting', ''], ['Wang', 'William Yang', '']]","['grounded video description', 'language refined scene graph', 'objecthallucination', 'fine-grained information']"
11660,1604.03393,Hendrik Barfuss,"Hendrik Barfuss, Christian Huemmer, Andreas Schwarz, Walter Kellermann","Robust coherence-based spectral enhancement for speech recognition in
  adverse real-world environments","21 pages, 5 figures. arXiv admin note: substantial text overlap with
  arXiv:1509.06882, Elsevier Computer Speech & Language (CSL), 2017",,10.1016/j.csl.2017.02.005,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Speech recognition in adverse real-world environments is highly affected by
reverberation and nonstationary background noise. A well-known strategy to
reduce such undesired signal components in multi-microphone scenarios is
spatial filtering of the microphone signals. In this article, we demonstrate
that an additional coherence-based postfilter, which is applied to the
beamformer output signal to remove diffuse interference components from the
latter, is an effective means to further improve the recognition accuracy of
modern deep learning speech recognition systems. To this end, the recently
updated 3rd CHiME Speech Separation and Recognition Challenge (CHiME-3)
baseline speech recognition system is extended by a coherence-based postfilter
and the postfilter's impact on the word error rates is investigated for the
noisy environments provided by CHiME-3. To determine the time- and
frequency-dependent postfilter gains, we use a Direction-of-Arrival
(DOA)-dependent and a DOA-independent estimator of the coherent-to-diffuse
power ratio as an approximation of the short-time signal-to-noise ratio. Our
experiments show that incorporating coherence-based postfiltering into the
CHiME-3 baseline speech recognition system leads to a significant reduction of
the word error rate scores for the noisy and reverberant environments provided
as part of CHiME-3.
","[{'version': 'v1', 'created': 'Tue, 12 Apr 2016 13:11:12 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Apr 2016 06:51:02 GMT'}, {'version': 'v3', 'created': 'Mon, 27 Feb 2017 16:14:45 GMT'}, {'version': 'v4', 'created': 'Mon, 7 Aug 2017 16:25:04 GMT'}]",2017-08-08,"[['Barfuss', 'Hendrik', ''], ['Huemmer', 'Christian', ''], ['Schwarz', 'Andreas', ''], ['Kellermann', 'Walter', '']]","['Robust speech recognition', 'Postfiltering', 'Spectral']"
11661,1906.06496,Shiye Lei,"Tian Wang, Shiye Lei, Youyou Jiang, Choi Chang, Hichem Snoussi,
  Guangcun Shan","Accelerating temporal action proposal generation via high performance
  computing","11 pages, 12 figures","Frontiers of Computer Science volume 16, Article number: 164317
  (2022)",10.1007/s11704-021-0173-7,,cs.CV cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Temporal action recognition always depends on temporal action proposal
generation to hypothesize actions and algorithms usually need to process very
long video sequences and output the starting and ending times of each potential
action in each video suffering from high computation cost. To address this,
based on boundary sensitive network we propose a new temporal convolution
network called Multipath Temporal ConvNet (MTN), which consists of two parts
i.e. Multipath DenseNet and SE-ConvNet. In this work, one novel high
performance ring parallel architecture based on Message Passing Interface (MPI)
is further introduced into temporal action proposal generation, which is a
reliable communication protocol, in order to respond to the requirements of
large memory occupation and a large number of videos. Remarkably, the total
data transmission is reduced by adding a connection between multiple computing
load in the newly developed architecture. It is found that, compared to the
traditional Parameter Server architecture, our parallel architecture has higher
efficiency on temporal action detection task with multiple GPUs, which is
suitable for dealing with the tasks of temporal action proposal generation,
especially for large datasets of millions of videos. We conduct experiments on
ActivityNet-1.3 and THUMOS14, where our method outperforms other state-of-art
temporal action detection methods with high recall and high temporal precision.
In addition, a time metric is further proposed here to evaluate the speed
performance in the distributed training process.
","[{'version': 'v1', 'created': 'Sat, 15 Jun 2019 08:35:34 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Aug 2019 05:12:50 GMT'}, {'version': 'v3', 'created': 'Thu, 12 Sep 2019 10:08:11 GMT'}, {'version': 'v4', 'created': 'Fri, 24 Apr 2020 06:35:10 GMT'}]",2022-03-21,"[['Wang', 'Tian', ''], ['Lei', 'Shiye', ''], ['Jiang', 'Youyou', ''], ['Chang', 'Choi', ''], ['Snoussi', 'Hichem', ''], ['Shan', 'Guangcun', '']]","['temporal convolution', 'temporal action proposalgeneration', 'deep learning']"
11662,2205.02269,Pengmiao Zhang,"Pengmiao Zhang, Ajitesh Srivastava, Anant V. Nori, Rajgopal Kannan,
  Viktor K. Prasanna","Fine-Grained Address Segmentation for Attention-Based Variable-Degree
  Prefetching",,,10.1145/3528416.3530236,,cs.AR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning algorithms have shown potential to improve prefetching
performance by accurately predicting future memory accesses. Existing
approaches are based on the modeling of text prediction, considering
prefetching as a classification problem for sequence prediction. However, the
vast and sparse memory address space leads to large vocabulary, which makes
this modeling impractical. The number and order of outputs for multiple cache
line prefetching are also fundamentally different from text prediction. We
propose TransFetch, a novel way to model prefetching. To reduce vocabulary
size, we use fine-grained address segmentation as input. To predict unordered
sets of future addresses, we use delta bitmaps for multiple outputs. We apply
an attention-based network to learn the mapping between input and output.
Prediction experiments demonstrate that address segmentation achieves 26% - 36%
higher F1-score than delta inputs and 15% - 24% higher F1-score than page &
offset inputs for SPEC 2006, SPEC 2017, and GAP benchmarks. Simulation results
show that TransFetch achieves 38.75% IPC improvement compared with no
prefetching, outperforming the best-performing rule-based prefetcher BOP by
10.44%, and ML-based prefetcher Voyager by 6.64%.
","[{'version': 'v1', 'created': 'Sun, 1 May 2022 05:30:37 GMT'}]",2022-05-06,"[['Zhang', 'Pengmiao', ''], ['Srivastava', 'Ajitesh', ''], ['Nori', 'Anant V.', ''], ['Kannan', 'Rajgopal', ''], ['Prasanna', 'Viktor K.', '']]","['prefetching', 'machine learning', 'attention', 'address segmentation']"
11663,1806.07815,Nicolas Robinson-Garcia,"Nicolas Robinson-Garcia, Cassidy R. Sugimoto, Dakota Murray, Alfredo
  Yegros-Yegros, Vincent Larivi\`ere and Rodrigo Costas","Scientific mobility indicators in practice: International mobility
  profiles at the country level",,"Robinson-Garcia, N. et al. Scientific mobility indicators in
  practice: International mobility profiles at the country level. El
  profesional de la informaci\'on, 27(3), 511-520. doi:10.3145/epi.2018.may.05",10.3145/epi.2018.may.05,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents and describes the methodological opportunities offered by
bibliometric data to produce indicators of scientific mobility. Large
bibliographic datasets of disambiguated authors and their affiliations allow
for the possibility of tracking the affiliation changes of scientists. Using
the Web of Science as data source, we analyze the distribution of types of
mobile scientists for a selection of countries. We explore the possibility of
creating profiles of international mobility at the country level, and discuss
potential interpretations and caveats. Five countries (Canada, The Netherlands,
South Africa, Spain, and the United States) are used as examples. These
profiles enable us to characterize these countries in terms of their strongest
links with other countries. This type of analysis reveals circulation among and
between countries with strong policy implications.
","[{'version': 'v1', 'created': 'Wed, 20 Jun 2018 16:13:37 GMT'}]",2018-06-21,"[['Robinson-Garcia', 'Nicolas', ''], ['Sugimoto', 'Cassidy R.', ''], ['Murray', 'Dakota', ''], ['Yegros-Yegros', 'Alfredo', ''], ['Larivière', 'Vincent', ''], ['Costas', 'Rodrigo', '']]","['Scientific mobility', 'bibliometric indicators', 'international mobility', 'internationalization', 'research policy']"
11664,2001.10049,Marquita Ellis,"Marquita Ellis (1 and 2), Giulia Guidi (1 and 2), Ayd{\i}n Bulu\c{c}
  (1 and 2), Leonid Oliker (2), Katherine Yelick (1 and 2) ((1) University of
  California at Berkeley (2) Lawrence Berkeley National Lab)",diBELLA: Distributed Long Read to Long Read Alignment,"This is the authors' preprint of the article that appears in the
  proceedings of ICPP 2019, the 48th International Conference on Parallel
  Processing","In Proceedings of the 48th International Conference on Parallel
  Processing (ICPP 2019). Association for Computing Machinery, New York, NY,
  USA, Article 70, 1-11",10.1145/3337821.3337919,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a parallel algorithm and scalable implementation for genome
analysis, specifically the problem of finding overlaps and alignments for data
from ""third generation"" long read sequencers. While long sequences of DNA offer
enormous advantages for biological analysis and insight, current long read
sequencing instruments have high error rates and therefore require different
approaches to analysis than their short read counterparts. Our work focuses on
an efficient distributed-memory parallelization of an accurate single-node
algorithm for overlapping and aligning long reads. We achieve scalability of
this irregular algorithm by addressing the competing issues of increasing
parallelism, minimizing communication, constraining the memory footprint, and
ensuring good load balance. The resulting application, diBELLA, is the first
distributed memory overlapper and aligner specifically designed for long reads
and parallel scalability. We describe and present analyses for high level
design trade-offs and conduct an extensive empirical analysis that compares
performance characteristics across state-of-the-art HPC systems as well as a
commercial cloud architectures, highlighting the advantages of state-of-the-art
network technologies.
","[{'version': 'v1', 'created': 'Mon, 27 Jan 2020 20:08:40 GMT'}]",2020-01-29,"[['Ellis', 'Marquita', '', '1 and 2'], ['Guidi', 'Giulia', '', '1 and 2'], ['Buluç', 'Aydın', '', '1 and 2'], ['Oliker', 'Leonid', '', '1 and 2'], ['Yelick', 'Katherine', '', '1 and 2']]","['genomics', 'bioinformatics', 'high performance computing', 'performance analysis', 'distributed data structures', 'cloud computing']"
11665,2101.05323,S\'ebastien Vaucher,"S\'ebastien Vaucher, Niloofar Yazdani, Pascal Felber, Daniel E.
  Lucani, Valerio Schiavoni",ZipLine: In-Network Compression at Line Speed,,"2020. Proceedings of the 16th International Conference on emerging
  Networking EXperiments and Technologies. Association for Computing Machinery,
  New York, NY, USA, 399-405",10.1145/3386367.3431302,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network appliances continue to offer novel opportunities to offload
processing from computing nodes directly into the data plane. One popular
concern of network operators and their customers is to move data increasingly
faster. A common technique to increase data throughput is to compress it before
its transmission. However, this requires compression of the data -- a time and
energy demanding pre-processing phase -- and decompression upon reception -- a
similarly resource consuming operation. Moreover, if multiple nodes transfer
similar data chunks across the network hop (e.g., a given pair of switches),
each node effectively wastes resources by executing similar steps. This paper
proposes ZipLine, an approach to design and implement (de)compression at line
speed leveraging the Tofino hardware platform which is programmable using the
P4_16 language. We report on lessons learned while building the system and show
throughput, latency and compression measurements on synthetic and real-world
traces, showcasing the benefits and trade-offs of our design.
","[{'version': 'v1', 'created': 'Wed, 13 Jan 2021 19:59:25 GMT'}]",2021-01-15,"[['Vaucher', 'Sébastien', ''], ['Yazdani', 'Niloofar', ''], ['Felber', 'Pascal', ''], ['Lucani', 'Daniel E.', ''], ['Schiavoni', 'Valerio', '']]","['P4', 'Tofino', 'generalized deduplication', 'compression', 'programmableswitches']"
11666,2002.02563,Rohit Zambre,"Rohit Zambre, Megan Grodowitz, Aparna Chandramowlishwaran, Pavel
  Shamis",Breaking Band: A Breakdown of High-performance Communication,"In Proceedings of the 48th ACM International Conference on Parallel
  Processing (ICPP), Kyoto, Japan, August 2019","In Proceedings of the 48th International Conference on Parallel
  Processing, pp. 1-10. 2019",10.1145/3337821,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The critical path of internode communication on large-scale systems is
composed of multiple components. When a supercomputing application initiates
the transfer of a message using a high-level communication routine such as an
MPI_Send, the payload of the message traverses multiple software stacks, the
I/O subsystem on both the host and target nodes, and network components such as
the switch. In this paper, we analyze where, why, and how much time is spent on
the critical path of communication by modeling the overall injection overhead
and end-to-end latency of a system. We focus our analysis on the performance of
small messages since fine-grained communication is becoming increasingly
important with the growing trend of an increasing number of cores per node. The
analytical models present an accurate and detailed breakdown of time spent in
internode communication. We validate the models on Arm ThunderX2-based servers
connected with Mellanox InfiniBand. This is the first work of this kind on Arm.
Alongside our breakdown, we describe the methodology to measure the time spent
in each component so that readers with access to precise CPU timers and a PCIe
analyzer can measure breakdowns on systems of their interest. Such a breakdown
is crucial for software developers, system architects, and researchers to guide
their optimization efforts. As researchers ourselves, we use the breakdown to
simulate the impacts and discuss the likelihoods of a set of optimizations that
target the bottlenecks in today's high-performance communication.
","[{'version': 'v1', 'created': 'Fri, 7 Feb 2020 00:15:49 GMT'}]",2020-02-10,"[['Zambre', 'Rohit', ''], ['Grodowitz', 'Megan', ''], ['Chandramowlishwaran', 'Aparna', ''], ['Shamis', 'Pavel', '']]","['analytical modeling', 'performance analysis', 'what-if analysis', 'breakdown', 'high-performance communication', 'Arm-based server', 'ThunderX2', 'InfiniBand']"
11667,2009.08015,Li Su,Hsuan-Kai Kao and Li Su,Temporally Guided Music-to-Body-Movement Generation,,,10.1145/3394171.3413848,,cs.MM cs.AI cs.SD eess.AS eess.IV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper presents a neural network model to generate virtual violinist's
3-D skeleton movements from music audio. Improved from the conventional
recurrent neural network models for generating 2-D skeleton data in previous
works, the proposed model incorporates an encoder-decoder architecture, as well
as the self-attention mechanism to model the complicated dynamics in body
movement sequences. To facilitate the optimization of self-attention model,
beat tracking is applied to determine effective sizes and boundaries of the
training examples. The decoder is accompanied with a refining network and a
bowing attack inference mechanism to emphasize the right-hand behavior and
bowing attack timing. Both objective and subjective evaluations reveal that the
proposed model outperforms the state-of-the-art methods. To the best of our
knowledge, this work represents the first attempt to generate 3-D violinists'
body movements considering key features in musical body movement.
","[{'version': 'v1', 'created': 'Thu, 17 Sep 2020 02:10:05 GMT'}]",2020-09-18,"[['Kao', 'Hsuan-Kai', ''], ['Su', 'Li', '']]","['Neural networks', 'pose estimation', 'body movement generation', 'music information retrieval']"
11668,2012.03772,Leon Bungert,"Tim Roith, Leon Bungert",Continuum Limit of Lipschitz Learning on Graphs,"39 pages, added acknowledgement, corrected typos",Found Comput Math (2022),10.1007/s10208-022-09557-9,,cs.LG cs.NA math.AP math.NA stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tackling semi-supervised learning problems with graph-based methods has
become a trend in recent years since graphs can represent all kinds of data and
provide a suitable framework for studying continuum limits, e.g., of
differential operators. A popular strategy here is $p$-Laplacian learning,
which poses a smoothness condition on the sought inference function on the set
of unlabeled data. For $p<\infty$ continuum limits of this approach were
studied using tools from $\Gamma$-convergence. For the case $p=\infty$, which
is referred to as Lipschitz learning, continuum limits of the related
infinity-Laplacian equation were studied using the concept of viscosity
solutions.
  In this work, we prove continuum limits of Lipschitz learning using
$\Gamma$-convergence. In particular, we define a sequence of functionals which
approximate the largest local Lipschitz constant of a graph function and prove
$\Gamma$-convergence in the $L^\infty$-topology to the supremum norm of the
gradient as the graph becomes denser. Furthermore, we show compactness of the
functionals which implies convergence of minimizers. In our analysis we allow a
varying set of labeled data which converges to a general closed set in the
Hausdorff distance. We apply our results to nonlinear ground states, i.e.,
minimizers with constrained $L^p$-norm, and, as a by-product, prove convergence
of graph distance functions to geodesic distance functions.
","[{'version': 'v1', 'created': 'Mon, 7 Dec 2020 15:10:35 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Feb 2021 17:07:44 GMT'}, {'version': 'v3', 'created': 'Mon, 29 Nov 2021 10:40:44 GMT'}]",2022-02-07,"[['Roith', 'Tim', ''], ['Bungert', 'Leon', '']]","['Lipschitz learning', 'graph-based semi-supervised learning', 'continuum limit', 'Gamma-convergence', 'ground states', 'distance functions']"
11669,2003.05336,Yoshiki Higo,Yoshiki Higo and Shinpei Hayashi and Shinji Kusumoto,On Tracking Java Methods with Git Mechanisms,accepted by Journal of Systems and Software,"Journal of Systems and Software, 165(110571):1-13, 2020",10.1016/j.jss.2020.110571,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Method-level historical information is useful in research on mining software
repositories such as fault-prone module detection or evolutionary coupling
identification. An existing technique named Historage converts a Git repository
of a Java project to a finer-grained one. In a finer-grained repository, each
Java method exists as a single file. Treating Java methods as files has an
advantage, which is that Java methods can be tracked with Git mechanisms. The
biggest benefit of tracking methods with Git mechanisms is that it can easily
connect with any other tools and techniques build on Git infrastructure.
However, Historage's tracking has an issue of accuracy, especially on small
methods. More concretely, in the case that a small method is renamed or moved
to another class, Historage has a limited capability to track the method. In
this paper, we propose a new technique, FinerGit, to improve the trackability
of Java methods with Git mechanisms. We implement FinerGit as a system and
apply it to 182 open source software projects, which include 1,768K methods in
total. The experimental results show that our tool has a higher capability of
tracking methods in the case that methods are renamed or moved to other
classes.
","[{'version': 'v1', 'created': 'Wed, 11 Mar 2020 14:42:58 GMT'}]",2021-04-23,"[['Higo', 'Yoshiki', ''], ['Hayashi', 'Shinpei', ''], ['Kusumoto', 'Shinji', '']]","['Mining software repositories', 'Source code analysis', 'Tracking Java methods']"
11670,2108.07805,Abhiroop Sarkar,"Abhiroop Sarkar, Robert Krook, Bo Joel Svensson, Mary Sheeran",Higher-Order Concurrency for Microcontrollers,,,10.1145/3475738.3480716,,cs.PL cs.CL,http://creativecommons.org/licenses/by-sa/4.0/,"  Programming microcontrollers involves low-level interfacing with hardware and
peripherals that are concurrent and reactive. Such programs are typically
written in a mixture of C and assembly using concurrent language extensions
(like $\texttt{FreeRTOS tasks}$ and $\texttt{semaphores}$), resulting in
unsafe, callback-driven, error-prone and difficult-to-maintain code.
  We address this challenge by introducing $\texttt{SenseVM}$ - a
bytecode-interpreted virtual machine that provides a message-passing based
$\textit{higher-order concurrency}$ model, originally introduced by Reppy, for
microcontroller programming. This model treats synchronous operations as
first-class values (called $\texttt{Events}$) akin to the treatment of
first-class functions in functional languages. This primarily allows the
programmer to compose and tailor their own concurrency abstractions and,
additionally, abstracts away unsafe memory operations, common in shared-memory
concurrency models, thereby making microcontroller programs safer, composable
and easier-to-maintain.
  Our VM is made portable via a low-level $\textit{bridge}$ interface, built
atop the embedded OS - Zephyr. The bridge is implemented by all drivers and
designed such that programming in response to a software message or a hardware
interrupt remains uniform and indistinguishable. In this paper we demonstrate
the features of our VM through an example, written in a Caml-like functional
language, running on the $\texttt{nRF52840}$ and $\texttt{STM32F4}$
microcontrollers.
","[{'version': 'v1', 'created': 'Tue, 17 Aug 2021 15:11:03 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Sep 2021 17:59:53 GMT'}]",2021-09-02,"[['Sarkar', 'Abhiroop', ''], ['Krook', 'Robert', ''], ['Svensson', 'Bo Joel', ''], ['Sheeran', 'Mary', '']]","['concurrency', 'virtual machine', 'microcontrollers', 'functional programming']"
11671,2201.00338,Markus Haltmeier,Andrea Ebner and Markus Haltmeier,"Convergence rates for the joint solution of inverse problems with
  compressed sensing data",,,10.1088/1361-6420/aca5ae,,cs.IT cs.NA math.IT math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Compressed sensing (CS) is a powerful tool for reducing the amount of data to
be collected while maintaining high spatial resolution. Such techniques work
well in practice and at the same time are supported by solid theory. Standard
CS results assume measurements to be made directly on the targeted signal. In
many practical applications, however, CS information can only be taken from
indirect data $h_\star = W x_\star$ related to the original signal by an
additional forward operator. If inverting the forward operator is ill-posed,
then existing CS theory is not applicable. In this paper, we address this issue
and present two joint reconstruction approaches, namely relaxed $\ell^1$
co-regularization and strict $\ell^1$ co-regularization, for CS from indirect
data. As main results, we derive error estimates for recovering $x_\star$ and
$h_\star$. In particular, we derive a linear convergence rate in the norm for
the latter. To obtain these results, solutions are required to satisfy a source
condition and the CS measurement operator is required to satisfy a restricted
injectivity condition. We further show that these conditions are not only
sufficient but even necessary to obtain linear convergence.
","[{'version': 'v1', 'created': 'Sun, 2 Jan 2022 11:25:25 GMT'}, {'version': 'v2', 'created': 'Mon, 16 May 2022 09:01:15 GMT'}]",2022-12-28,"[['Ebner', 'Andrea', ''], ['Haltmeier', 'Markus', '']]","['Compressed sensing from indirect data', 'joint recovery', 'inverse problems', 'regularization', 'convergence rate', 'sparse recovery']"
11672,2202.01677,Michael Heider,"Michael Heider, Helena Stegherr, Jonathan Wurth, Roman Sraj, J\""org
  H\""ahner","Separating Rule Discovery and Global Solution Composition in a Learning
  Classifier System","Genetic and Evolutionary Computation Conference Companion (GECCO '22
  Companion), July 9--13, 2022, Boston, MA, USA",,10.1145/3520304.3529014,,cs.LG cs.AI cs.NE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  While utilization of digital agents to support crucial decision making is
increasing, trust in suggestions made by these agents is hard to achieve.
However, it is essential to profit from their application, resulting in a need
for explanations for both the decision making process and the model. For many
systems, such as common black-box models, achieving at least some
explainability requires complex post-processing, while other systems profit
from being, to a reasonable extent, inherently interpretable. We propose a
rule-based learning system specifically conceptualised and, thus, especially
suited for these scenarios. Its models are inherently transparent and easily
interpretable by design. One key innovation of our system is that the rules'
conditions and which rules compose a problem's solution are evolved separately.
We utilise independent rule fitnesses which allows users to specifically tailor
their model structure to fit the given requirements for explainability.
","[{'version': 'v1', 'created': 'Thu, 3 Feb 2022 16:45:05 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Apr 2022 20:07:32 GMT'}]",2022-04-21,"[['Heider', 'Michael', ''], ['Stegherr', 'Helena', ''], ['Wurth', 'Jonathan', ''], ['Sraj', 'Roman', ''], ['Hähner', 'Jörg', '']]","['rule-based learning', 'learning classifier systems', 'evolutionary machine learning', 'interpretable models', 'explainable AI']"
11673,2108.08500,Sunwoong Yang,"Sunwoong Yang, Sanga Lee, Kwanjung Yee","Inverse design optimization framework via a two-step deep learning
  approach: application to a wind turbine airfoil",,,10.1007/s00366-022-01617-6,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The inverse approach is computationally efficient in aerodynamic design as
the desired target performance distribution is prespecified. However, it has
some significant limitations that prevent it from achieving full efficiency.
First, the iterative procedure should be repeated whenever the specified target
distribution changes. Target distribution optimization can be performed to
clarify the ambiguity in specifying this distribution, but several additional
problems arise in this process such as loss of the representation capacity due
to parameterization of the distribution, excessive constraints for a realistic
distribution, inaccuracy of quantities of interest due to theoretical/empirical
predictions, and the impossibility of explicitly imposing geometric
constraints. To deal with these issues, a novel inverse design optimization
framework with a two-step deep learning approach is proposed. A variational
autoencoder and multi-layer perceptron are used to generate a realistic target
distribution and predict the quantities of interest and shape parameters from
the generated distribution, respectively. Then, target distribution
optimization is performed as the inverse design optimization. The proposed
framework applies active learning and transfer learning techniques to improve
accuracy and efficiency. Finally, the framework is validated through
aerodynamic shape optimizations of the wind turbine airfoil. Their results show
that this framework is accurate, efficient, and flexible to be applied to other
inverse design engineering applications.
","[{'version': 'v1', 'created': 'Thu, 19 Aug 2021 05:00:08 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Dec 2021 14:28:23 GMT'}, {'version': 'v3', 'created': 'Wed, 9 Mar 2022 02:12:15 GMT'}]",2022-03-10,"[['Yang', 'Sunwoong', ''], ['Lee', 'Sanga', ''], ['Yee', 'Kwanjung', '']]","['inverse design optimization', 'multi-layer perceptron', 'variational autoencoder', 'wind turbine airfoil']"
11674,2001.01458,Yingshi Chen,Yingshi Chen,"Express Wavenet -- a low parameter optical neural network with random
  shift wavelet pattern","5 pages,4 figures",,10.1016/j.optcom.2020.126709,,cs.LG cs.CV eess.IV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Express Wavenet is an improved optical diffractive neural network. At each
layer, it uses wavelet-like pattern to modulate the phase of optical waves. For
input image with n2 pixels, express wavenet reduce parameter number from O(n2)
to O(n). Only need one percent of the parameters, and the accuracy is still
very high. In the MNIST dataset, it only needs 1229 parameters to get accuracy
of 92%, while the standard optical network needs 125440 parameters. The random
shift wavelets show the characteristics of optical network more vividly.
Especially the vanishing gradient phenomenon in the training process. We
present a modified expressway structure for this problem. Experiments verified
the effect of random shift wavelet and expressway structure. Our work shows
optical diffractive network would use much fewer parameters than other neural
networks. The source codes are available at
https://github.com/closest-git/ONNet.
","[{'version': 'v1', 'created': 'Mon, 6 Jan 2020 09:45:20 GMT'}]",2021-02-03,"[['Chen', 'Yingshi', '']]","['machine learning', 'optical diffractive network', 'random shift wavelet', 'expressway network']"
11675,1905.07019,Zhe Yu,"Zhe Yu, Fahmid M. Fahid, Tim Menzies, Gregg Rothermel, Kyle Patrick,
  Snehit Cherian",TERMINATOR: Better Automated UI Test Case Prioritization,"10+2 pages, 4 figures, 3 tables, ESEC/FSE 2019 industry track",,10.1145/3338906.3340448,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated UI testing is an important component of the continuous integration
process of software development. A modern web-based UI is an amalgam of reports
from dozens of microservices written by multiple teams. Queries on a page that
opens up another will fail if any of that page's microservices fails. As a
result, the overall cost for automated UI testing is high since the UI elements
cannot be tested in isolation. For example, the entire automated UI testing
suite at LexisNexis takes around 30 hours (3-5 hours on the cloud) to execute,
which slows down the continuous integration process.
  To mitigate this problem and give developers faster feedback on their code,
test case prioritization techniques are used to reorder the automated UI test
cases so that more failures can be detected earlier. Given that much of the
automated UI testing is ""black box"" in nature, very little information (only
the test case descriptions and testing results) can be utilized to prioritize
these automated UI test cases. Hence, this paper evaluates 17 ""black box"" test
case prioritization approaches that do not rely on source code information.
Among these, we propose a novel TCP approach, that dynamically re-prioritizes
the test cases when new failures are detected, by applying and adapting a state
of the art framework from the total recall problem. Experimental results on
LexisNexis automated UI testing data show that our new approach (which we call
TERMINATOR), outperformed prior state of the art approaches in terms of failure
detection rates with negligible CPU overhead.
","[{'version': 'v1', 'created': 'Thu, 16 May 2019 20:07:53 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Jun 2019 18:25:56 GMT'}]",2019-06-20,"[['Yu', 'Zhe', ''], ['Fahid', 'Fahmid M.', ''], ['Menzies', 'Tim', ''], ['Rothermel', 'Gregg', ''], ['Patrick', 'Kyle', ''], ['Cherian', 'Snehit', '']]","['automated UI testing', 'test case prioritization', 'total recall']"
11676,1809.04399,Slava Jankin Mikhaylov,Slava Jankin Mikhaylov and Marc Esteve and Averill Campion,"Artificial Intelligence for the Public Sector: Opportunities and
  challenges of cross-sector collaboration",,"Philosophical Transactions of the Royal Society A, 2018, Volume
  376, Issue 2128",10.1098/rsta.2017.0357,,cs.AI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Public sector organisations are increasingly interested in using data science
and artificial intelligence capabilities to deliver policy and generate
efficiencies in high uncertainty environments. The long-term success of data
science and AI in the public sector relies on effectively embedding it into
delivery solutions for policy implementation. However, governments cannot do
this integration of AI into public service delivery on their own. The UK
Government Industrial Strategy is clear that delivering on the AI grand
challenge requires collaboration between universities and public and private
sectors. This cross-sectoral collaborative approach is the norm in applied AI
centres of excellence around the world. Despite their popularity, cross-sector
collaborations entail serious management challenges that hinder their success.
In this article we discuss the opportunities and challenges from AI for public
sector. Finally, we propose a series of strategies to successfully manage these
cross-sectoral collaborations.
","[{'version': 'v1', 'created': 'Wed, 12 Sep 2018 13:12:07 GMT'}]",2019-10-29,"[['Mikhaylov', 'Slava Jankin', ''], ['Esteve', 'Marc', ''], ['Campion', 'Averill', '']]","['cross-sector collaboration', 'data science', 'artificial intelligence', 'public policy']"
11677,1812.08252,Richard Preen,"Richard J. Preen, Larry Bull, Andrew Adamatzky",Towards an Evolvable Cancer Treatment Simulator,,"BioSystems (2019), 182:1-7",10.1016/j.biosystems.2019.05.005,,cs.NE cs.AI cs.CE cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of high-fidelity computational simulations promises to enable
high-throughput hypothesis testing and optimisation of cancer therapies.
However, increasing realism comes at the cost of increasing computational
requirements. This article explores the use of surrogate-assisted evolutionary
algorithms to optimise the targeted delivery of a therapeutic compound to
cancerous tumour cells with the multicellular simulator, PhysiCell. The use of
both Gaussian process models and multi-layer perceptron neural network
surrogate models are investigated. We find that evolutionary algorithms are
able to effectively explore the parameter space of biophysical properties
within the agent-based simulations, minimising the resulting number of
cancerous cells after a period of simulated treatment. Both model-assisted
algorithms are found to outperform a standard evolutionary algorithm,
demonstrating their ability to perform a more effective search within the very
small evaluation budget. This represents the first use of efficient
evolutionary algorithms within a high-throughput multicellular computing
approach to find therapeutic design optima that maximise tumour regression.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2018 21:28:15 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Mar 2019 15:05:02 GMT'}, {'version': 'v3', 'created': 'Tue, 14 May 2019 16:06:46 GMT'}]",2022-12-05,"[['Preen', 'Richard J.', ''], ['Bull', 'Larry', ''], ['Adamatzky', 'Andrew', '']]","['Agent-based model', 'evolutionary algorithm', 'cancer', 'PhysiCell', 'high-throughput computing', 'surrogate modelling']"
11678,1811.05046,Felix Hamza-Lup,"Felix Hamza-Lup, Marcel Maghiar","Web3D Graphics enabled through Sensor Networks for Cost-Effective
  Assessment and Management of Energy Efficiency in Buildings",,"Graphical Models Journal, Volume 88, 2016, Pages 66-74, ISSN
  1524-0703",10.1016/j.gmod.2016.03.005,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The past decade has seen the advent of numerous building energy efficiency
visualization and simulation systems; however, most of them rely on theoretical
thermal models to suggest building structural design for new constructions and
modifications for existing ones. Sustainable methods of construction have made
tremendous progress. The example of the German Energy-Plus- House technology
uses a combination of (almost) zero-carbon passive heating technologies. A
web-enabled X3D visualization and simulation system coupled with a
cost-effective set of temperature/humidity sensors can provide valuable
insights into building design, materials and construction that can lead to
significant energy savings and an improved thermal comfort for residents,
resulting in superior building energy efficiency. A cost-effective
hardware-software prototype system is proposed in this paper that can provide
real-time data driven visualization or offline simulation of 3D thermal maps
for residential and/or commercial buildings on the Web.
","[{'version': 'v1', 'created': 'Mon, 12 Nov 2018 23:37:46 GMT'}]",2018-11-14,"[['Hamza-Lup', 'Felix', ''], ['Maghiar', 'Marcel', '']]","['Thermal Comfort', 'Thermal Maps', 'X3D', 'Web3D', 'Building Energy Efficiency', '3D Simulation', 'Sensor Networks']"
11679,2205.00191,Katie Seaborn,"Katie Seaborn, Peter Pennefather, Haruki Kotani",Exploring Gender-Expansive Categorization Options for Robots,Accepted at CHI EA '22,"CHI EA '22: CHI Conference on Human Factors in Computing Systems
  Extended Abstracts, April 2022, Article No.: 252",10.1145/3491101.3519646,,cs.HC cs.RO,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Gender is increasingly being explored as a social characteristic ascribed to
robots by people. Yet, research involving social robots that may be gendered
tends not to address gender perceptions, such as through pilot studies or
manipulation checks. Moreover, research that does address gender perceptions
has been limited by a reliance on the human gender binary model of feminine and
masculine, prescriptive response options, and/or researcher assumptions and/or
ascriptions of participant gendering. In response, we conducted an online pilot
categorization study (n=55) wherein we provided gender-expansive response
options for rating four robots ranging across four levels of anthropomorphism.
Findings indicate that people gender robots in diverse ways, and not
necessarily in relation to the gender binary. Additionally, less
anthropomorphic robots and the childlike humanoid robot were deemed masculine,
while the iconic robot was deemed gender neutral, fluid, and/or ambiguous. We
discuss implications for future work on all humanoid robots.
","[{'version': 'v1', 'created': 'Sat, 30 Apr 2022 07:37:48 GMT'}]",2022-05-03,"[['Seaborn', 'Katie', ''], ['Pennefather', 'Peter', ''], ['Kotani', 'Haruki', '']]","['Robots', 'Gender', 'Robot gender', 'Gender-expansive', 'Anthropomorphism', 'Age']"
11680,2105.02082,Thibault Pirson,Thibault Pirson and David Bol,"Assessing the embodied carbon footprint of IoT edge devices with a
  bottom-up life-cycle approach","18 pages, 6 figures. Supplementary material [text] included (7 pages,
  2 figures). Submitted to Journal of Cleaner Production","Journal of Cleaner Production Volume 322, 1 November 2021, 128966",10.1016/j.jclepro.2021.128966,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In upcoming years, the number of Internet-of-Things (IoT) devices is expected
to surge up to tens of billions of physical objects. However, while the IoT is
often presented as a promising solution to tackle environmental challenges, the
direct environmental impacts generated over the life cycle of the physical
devices are usually overlooked. It is implicitly assumed that their
environmental burden is negligible compared to the positive impacts they can
generate. In this paper, we present a parametric framework based on hardware
profiles to evaluate the cradle-to-gate carbon footprint of IoT edge devices.
We exploit our framework in three ways. First, we apply it on four use cases to
evaluate their respective production carbon footprint. Then, we show that the
heterogeneity inherent to IoT edge devices must be considered as the production
carbon footprint between simple and complex devices can vary by a factor of
more than 150x. Finally, we estimate the absolute carbon footprint induced by
the worldwide production of IoT edge devices through a macroscopic analysis
over a 10-year period. Results range from 22 to 562 MtCO2-eq/year in 2027
depending on the deployment scenarios. However, the truncation error
acknowledged for LCA bottom-up approaches usually lead to an undershoot of the
environmental impacts. We compared the results of our use cases with the few
reports available from Google and Apple, which suggest that our estimates could
be revised upwards by a factor around 2x to compensate for the truncation
error. Worst-case scenarios in 2027 would therefore reach more than 1000
MtCO2-eq/year. This truly stresses the necessity to consider environmental
constraints when designing and deploying IoT edge devices.
","[{'version': 'v1', 'created': 'Wed, 5 May 2021 14:29:21 GMT'}]",2021-11-22,"[['Pirson', 'Thibault', ''], ['Bol', 'David', '']]","['Internet-of-Things (IoT)', 'life-cycle assessment (LCA)', 'carbon footprint (CF)', 'cradle-to-gate', 'sustainability']"
11681,2201.04425,Pavlo Mykytyn,"Pavlo Mykytyn, Marcin Brzozowski, Zoya Dyka and Peter Langendoerfer",Jamming Detection for IR-UWB Ranging Technology in Autonomous UAV Swarms,"6 pages, 1 figure","2021 10th MEDITERRANEAN CONFERENCE ON EMBEDDED COMPUTING, p. 81-86",10.1109/MECO52532.2021.9460250,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Jamming is a form of the Denial of Service (J-DoS) attack. It is a
significant threat that causes malfunction in Unmanned Aerial Vehicle systems,
especially when used in hostile environments. The attackers mainly operate in
the wireless communication environment by following a few preexisting
scenarios. In this paper, we propose an idea for a Jamming detection mechanism.
The mechanism utilizes the network parameters available to the system and some
additional measures to distinguish between bad transmission quality and Jamming
to avoid false positive alarms. After detecting a Jamming attack, appropriate
countermeasures or mitigation techniques can be applied to keep the system
safe.
","[{'version': 'v1', 'created': 'Wed, 12 Jan 2022 11:45:32 GMT'}]",2022-01-13,"[['Mykytyn', 'Pavlo', ''], ['Brzozowski', 'Marcin', ''], ['Dyka', 'Zoya', ''], ['Langendoerfer', 'Peter', '']]","['Impulse Radio (IR)', 'Ultra-Wideband (UWB) Unmanned Aerial Vehicle (UAV)', 'Jamming attack detection', 'drone swarm', 'Wireless sensor network (WSN)']"
11682,2210.17209,Eason Chen,Eason Chen,The Effect of Multiple Replies for Natural Language Generation Chatbots,5 pages,,10.1145/3491101.3516800,,cs.HC cs.CL,http://creativecommons.org/licenses/by/4.0/,"  In this research, by responding to users' utterances with multiple replies to
create a group chat atmosphere, we alleviate the problem that Natural Language
Generation chatbots might reply with inappropriate content, thus causing a bad
user experience. Because according to our findings, users tend to pay attention
to appropriate replies and ignore inappropriate replies. We conducted a 2
(single reply vs. five replies) x 2 (anonymous avatar vs. anime avatar)
repeated measures experiment to compare the chatting experience in different
conditions. The result shows that users will have a better chatting experience
when receiving multiple replies at once from the NLG model compared to the
single reply. Furthermore, according to the effect size of our result, to
improve the chatting experience for NLG chatbots which is single reply and
anonymous avatar, providing five replies will have more benefits than setting
an anime avatar.
","[{'version': 'v1', 'created': 'Mon, 31 Oct 2022 10:45:18 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Dec 2022 09:13:26 GMT'}]",2022-12-14,"[['Chen', 'Eason', '']]","['Natural Language Generation', 'Chatbot', 'Multiple Replies', 'ImproveChatting Experience']"
11683,2112.15479,Jung Ho Ahn,"Sangpyo Kim and Jongmin Kim and Michael Jaemin Kim and Wonkyung Jung
  and Minsoo Rhu and John Kim and Jung Ho Ahn",BTS: An Accelerator for Bootstrappable Fully Homomorphic Encryption,"15 pages, 10 figures",,10.1145/3470496.3527415,,cs.CR cs.AR,http://creativecommons.org/licenses/by/4.0/,"  Homomorphic encryption (HE) enables the secure offloading of computations to
the cloud by providing computation on encrypted data (ciphertexts). HE is based
on noisy encryption schemes in which noise accumulates as more computations are
applied to the data. The limited number of operations applicable to the data
prevents practical applications from exploiting HE. Bootstrapping enables an
unlimited number of operations or fully HE (FHE) by refreshing the ciphertext.
Unfortunately, bootstrapping requires a significant amount of additional
computation and memory bandwidth as well. Prior works have proposed hardware
accelerators for computation primitives of FHE. However, to the best of our
knowledge, this is the first to propose a hardware FHE accelerator that
supports bootstrapping as a first-class citizen.
  In particular, we propose BTS - Bootstrappable, Technologydriven, Secure
accelerator architecture for FHE. We identify the challenges of supporting
bootstrapping in the accelerator and analyze the off-chip memory bandwidth and
computation required. In particular, given the limitations of modern memory
technology, we identify the HE parameter sets that are efficient for FHE
acceleration. Based on the insights gained from our analysis, we propose BTS,
which effectively exploits the parallelism innate in HE operations by arranging
a massive number of processing elements in a grid. We present the design and
microarchitecture of BTS, including a network-on-chip design that exploits a
deterministic communication pattern. BTS shows 5,556x and 1,306x improved
execution time on ResNet-20 and logistic regression over a CPU, with a chip
area of 373.6mm^2 and up to 163.2W of power.
","[{'version': 'v1', 'created': 'Fri, 31 Dec 2021 14:34:50 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Apr 2022 02:42:02 GMT'}]",2022-05-02,"[['Kim', 'Sangpyo', ''], ['Kim', 'Jongmin', ''], ['Kim', 'Michael Jaemin', ''], ['Jung', 'Wonkyung', ''], ['Rhu', 'Minsoo', ''], ['Kim', 'John', ''], ['Ahn', 'Jung Ho', '']]","['Fully Homomorphic Encryption', 'CKKS', 'Bootstrapping', 'Accelerator', 'Technology-driven']"
11684,2204.11241,Mirko Marras,"Giacomo Balloccu, Ludovico Boratto, Gianni Fenu, Mirko Marras","Post Processing Recommender Systems with Knowledge Graphs for Recency,
  Popularity, and Diversity of Explanations","Accepted at the 45th International ACM SIGIR Conference on Research
  and Development in Information Retrieval (ACM SIGIR 2022)",,10.1145/3477495.3532041,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing explainable recommender systems have mainly modeled relationships
between recommended and already experienced products, and shaped explanation
types accordingly (e.g., movie ""x"" starred by actress ""y"" recommended to a user
because that user watched other movies with ""y"" as an actress). However, none
of these systems has investigated the extent to which properties of a single
explanation (e.g., the recency of interaction with that actress) and of a group
of explanations for a recommended list (e.g., the diversity of the explanation
types) can influence the perceived explaination quality. In this paper, we
conceptualized three novel properties that model the quality of the
explanations (linking interaction recency, shared entity popularity, and
explanation type diversity) and proposed re-ranking approaches able to optimize
for these properties. Experiments on two public data sets showed that our
approaches can increase explanation quality according to the proposed
properties, fairly across demographic groups, while preserving recommendation
utility. The source code and data are available at
https://github.com/giacoballoccu/explanation-quality-recsys.
","[{'version': 'v1', 'created': 'Sun, 24 Apr 2022 10:51:54 GMT'}]",2022-04-26,"[['Balloccu', 'Giacomo', ''], ['Boratto', 'Ludovico', ''], ['Fenu', 'Gianni', ''], ['Marras', 'Mirko', '']]","['Recommender Systems', 'Explainability', 'Fairness', 'Knowledge Graphs']"
11685,2204.09588,Scott Pezanowski,"Scott Pezanowski, Prasenjit Mitra, Alan M. MacEachren",Exploring Descriptions of Movement Through Geovisual Analytics,KN - Journal of Cartography and Geographic Information (2022),,10.1007/s42489-022-00098-3,,cs.HC cs.CL cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Sensemaking using automatically extracted information from text is a
challenging problem. In this paper, we address a specific type of information
extraction, namely extracting information related to descriptions of movement.
Aggregating and understanding information related to descriptions of movement
and lack of movement specified in text can lead to an improved understanding
and sensemaking of movement phenomena of various types, e.g., migration of
people and animals, impediments to travel due to COVID-19, etc. We present
GeoMovement, a system that is based on combining machine learning and
rule-based extraction of movement-related information with state-of-the-art
visualization techniques. Along with the depiction of movement, our tool can
extract and present a lack of movement. Very little prior work exists on
automatically extracting descriptions of movement, especially negation and
movement. Apart from addressing these, GeoMovement also provides a novel
integrated framework for combining these extraction modules with visualization.
We include two systematic case studies of GeoMovement that show how humans can
derive meaningful geographic movement information. GeoMovement can complement
precise movement data, e.g., obtained using sensors, or be used by itself when
precise data is unavailable.
","[{'version': 'v1', 'created': 'Tue, 1 Mar 2022 18:23:02 GMT'}]",2022-04-21,"[['Pezanowski', 'Scott', ''], ['Mitra', 'Prasenjit', ''], ['MacEachren', 'Alan M.', '']]","['geographic movement', 'geovisual analytics', 'machine learning', 'natural language processing', 'big data analytics']"
11686,2211.16307,Nikolaos Ellinas,"Nikolaos Ellinas, Myrsini Christidou, Alexandra Vioni, June Sig Sung,
  Aimilios Chalamandaris, Pirros Tsiakoulis, Paris Mastorocostas","Controllable speech synthesis by learning discrete phoneme-level
  prosodic representations","Final published version available at: Speech Communication. arXiv
  admin note: substantial text overlap with arXiv:2111.10168",,10.1016/j.specom.2022.11.006,,cs.SD cs.CL cs.LG eess.AS,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this paper, we present a novel method for phoneme-level prosody control of
F0 and duration using intuitive discrete labels. We propose an unsupervised
prosodic clustering process which is used to discretize phoneme-level F0 and
duration features from a multispeaker speech dataset. These features are fed as
an input sequence of prosodic labels to a prosody encoder module which augments
an autoregressive attention-based text-to-speech model. We utilize various
methods in order to improve prosodic control range and coverage, such as
augmentation, F0 normalization, balanced clustering for duration and
speaker-independent clustering. The final model enables fine-grained
phoneme-level prosody control for all speakers contained in the training set,
while maintaining the speaker identity. Instead of relying on reference
utterances for inference, we introduce a prior prosody encoder which learns the
style of each speaker and enables speech synthesis without the requirement of
reference audio. We also fine-tune the multispeaker model to unseen speakers
with limited amounts of data, as a realistic application scenario and show that
the prosody control capabilities are maintained, verifying that the
speaker-independent prosodic clustering is effective. Experimental results show
that the model has high output speech quality and that the proposed method
allows efficient prosody control within each speaker's range despite the
variability that a multispeaker setting introduces.
","[{'version': 'v1', 'created': 'Tue, 29 Nov 2022 15:43:36 GMT'}]",2022-11-30,"[['Ellinas', 'Nikolaos', ''], ['Christidou', 'Myrsini', ''], ['Vioni', 'Alexandra', ''], ['Sung', 'June Sig', ''], ['Chalamandaris', 'Aimilios', ''], ['Tsiakoulis', 'Pirros', ''], ['Mastorocostas', 'Paris', '']]","['Controllable text-to-speech synthesis', 'fine-grained control', 'prosody']"
11687,2206.05476,Jiajun Li,"Jiajun Li, Zhewei Wei, Bolin Ding, Xiening Dai, Lu Lu, Jingren Zhou","Sampling-based Estimation of the Number of Distinct Values in
  Distributed Environment",11 pages,,10.1145/3534678.3539390,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In data mining, estimating the number of distinct values (NDV) is a
fundamental problem with various applications. Existing methods for estimating
NDV can be broadly classified into two categories: i) scanning-based methods,
which scan the entire data and maintain a sketch to approximate NDV; and ii)
sampling-based methods, which estimate NDV using sampling data rather than
accessing the entire data warehouse. Scanning-based methods achieve a lower
approximation error at the cost of higher I/O and more time. Sampling-based
estimation is preferable in applications with a large data volume and a
permissible error restriction due to its higher scalability. However, while the
sampling-based method is more effective on a single machine, it is less
practical in a distributed environment with massive data volumes. For obtaining
the final NDV estimators, the entire sample must be transferred throughout the
distributed system, incurring a prohibitive communication cost when the sample
rate is significant. This paper proposes a novel sketch-based distributed
method that achieves sub-linear communication costs for distributed
sampling-based NDV estimation under mild assumptions. Our method leverages a
sketch-based algorithm to estimate the sample's {\em frequency of frequency} in
the {\em distributed streaming model}, which is compatible with most classical
sampling-based NDV estimators. Additionally, we provide theoretical evidence
for our method's ability to minimize communication costs in the worst-case
scenario. Extensive experiments show that our method saves orders of magnitude
in communication costs compared to existing sampling- and sketch-based methods.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2022 09:12:22 GMT'}]",2022-06-14,"[['Li', 'Jiajun', ''], ['Wei', 'Zhewei', ''], ['Ding', 'Bolin', ''], ['Dai', 'Xiening', ''], ['Lu', 'Lu', ''], ['Zhou', 'Jingren', '']]","['sampling', 'distributed environment', 'NDV', 'communication']"
11688,2101.00771,Jeremy Gordon,"Jeremy Gordon, Max Curran, John Chuang, Coye Cheshire","Covert Embodied Choice: Decision-Making and the Limits of Privacy Under
  Biometric Surveillance",12 pages. To be presented at CHI 2021,,10.1145/3411764.3445309,,cs.HC cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Algorithms engineered to leverage rich behavioral and biometric data to
predict individual attributes and actions continue to permeate public and
private life. A fundamental risk may emerge from misconceptions about the
sensitivity of such data, as well as the agency of individuals to protect their
privacy when fine-grained (and possibly involuntary) behavior is tracked. In
this work, we examine how individuals adjust their behavior when incentivized
to avoid the algorithmic prediction of their intent. We present results from a
virtual reality task in which gaze, movement, and other physiological signals
are tracked. Participants are asked to decide which card to select without an
algorithmic adversary anticipating their choice. We find that while
participants use a variety of strategies, data collected remains highly
predictive of choice (80% accuracy). Additionally, a significant portion of
participants became more predictable despite efforts to obfuscate, possibly
indicating mistaken priors about the dynamics of algorithmic prediction.
","[{'version': 'v1', 'created': 'Mon, 4 Jan 2021 04:45:22 GMT'}]",2021-01-05,"[['Gordon', 'Jeremy', ''], ['Curran', 'Max', ''], ['Chuang', 'John', ''], ['Cheshire', 'Coye', '']]","['biometrics', 'prediction', 'privacy', 'virtual reality', 'surveillance']"
11689,2110.03127,Dimitrios Boursinos,Dimitrios Boursinos and Xenofon Koutsoukos,"Reliable Probability Intervals For Classification Using Inductive Venn
  Predictors Based on Distance Learning","Published in IEEE International Conference on Omni-Layer Intelligent
  Systems (COINS), 2021","IEEE International Conference on Omni-Layer Intelligent Systems
  (COINS), 2021, pp. 1-7",10.1109/COINS51742.2021.9524144,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Deep neural networks are frequently used by autonomous systems for their
ability to learn complex, non-linear data patterns and make accurate
predictions in dynamic environments. However, their use as black boxes
introduces risks as the confidence in each prediction is unknown. Different
frameworks have been proposed to compute accurate confidence measures along
with the predictions but at the same time introduce a number of limitations
like execution time overhead or inability to be used with high-dimensional
data. In this paper, we use the Inductive Venn Predictors framework for
computing probability intervals regarding the correctness of each prediction in
real-time. We propose taxonomies based on distance metric learning to compute
informative probability intervals in applications involving high-dimensional
inputs. Empirical evaluation on image classification and botnet attacks
detection in Internet-of-Things (IoT) applications demonstrates improved
accuracy and calibration. The proposed method is computationally efficient, and
therefore, can be used in real-time.
","[{'version': 'v1', 'created': 'Thu, 7 Oct 2021 00:51:43 GMT'}]",2021-10-08,"[['Boursinos', 'Dimitrios', ''], ['Koutsoukos', 'Xenofon', '']]","['deep neural networks', 'assurance monitoring', 'inductive venn predictors', 'probability intervals']"
11690,2201.10316,Anh Viet Do,"Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann","Niching-based Evolutionary Diversity Optimization for the Traveling
  Salesperson Problem",14 pages,,10.1145/3512290.3528724,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we consider the problem of finding a set of tours to a
traveling salesperson problem (TSP) instance maximizing diversity, while
satisfying a given cost constraint. This study aims to investigate the
effectiveness of applying niching to maximize diversity rather than simply
maintaining it. To this end, we introduce a 2-stage approach where a simple
niching memetic algorithm (NMA), derived from a state-of-the-art for
multi-solution TSP, is combined with a baseline diversifying algorithm. The
most notable feature of the proposed NMA is the use of randomized
improvement-first local search instead of 2-opt. Our experiment on TSPLIB
instances shows that while the populations evolved by our NMA tend to contain
clusters at tight quality constraints, they frequently occupy distant basins of
attraction rather than close-by regions, improving on the baseline
diversification in terms of sum-sum diversity. Compared to the original NMA,
ours, despite its simplicity, finds more distant solutions of higher quality
within less running time, by a large margin.
","[{'version': 'v1', 'created': 'Tue, 25 Jan 2022 13:40:27 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Apr 2022 03:41:53 GMT'}]",2022-04-20,"[['Do', 'Anh Viet', ''], ['Guo', 'Mingyu', ''], ['Neumann', 'Aneta', ''], ['Neumann', 'Frank', '']]","['Traveling Salesperson Problem', 'niching', 'evolutionary diversity optimization']"
11691,2101.05510,Michael Schaub,"Michael T. Schaub and Yu Zhu and Jean-Baptiste Seby and T. Mitchell
  Roddenberry and Santiago Segarra","Signal Processing on Higher-Order Networks: Livin' on the Edge ... and
  Beyond",41 pages; 8 figures,"Signal Processing, Volume 187, 2021, 108149, ISSN 0165-1684",10.1016/j.sigpro.2021.108149,,cs.SI cs.LG physics.soc-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this tutorial, we provide a didactic treatment of the emerging topic of
signal processing on higher-order networks. Drawing analogies from discrete and
graph signal processing, we introduce the building blocks for processing data
on simplicial complexes and hypergraphs, two common higher-order network
abstractions that can incorporate polyadic relationships. We provide brief
introductions to simplicial complexes and hypergraphs, with a special emphasis
on the concepts needed for the processing of signals supported on these
structures. Specifically, we discuss Fourier analysis, signal denoising, signal
interpolation, node embeddings, and nonlinear processing through neural
networks, using these two higher-order network models. In the context of
simplicial complexes, we specifically focus on signal processing using the
Hodge Laplacian matrix, a multi-relational operator that leverages the special
structure of simplicial complexes and generalizes desirable properties of the
Laplacian matrix in graph signal processing. For hypergraphs, we present both
matrix and tensor representations, and discuss the trade-offs in adopting one
or the other. We also highlight limitations and potential research avenues,
both to inform practitioners and to motivate the contribution of new
researchers to the area.
","[{'version': 'v1', 'created': 'Thu, 14 Jan 2021 09:08:26 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Apr 2021 17:24:25 GMT'}, {'version': 'v3', 'created': 'Fri, 11 Jun 2021 10:16:00 GMT'}, {'version': 'v4', 'created': 'Sun, 20 Feb 2022 12:36:26 GMT'}]",2022-02-22,"[['Schaub', 'Michael T.', ''], ['Zhu', 'Yu', ''], ['Seby', 'Jean-Baptiste', ''], ['Roddenberry', 'T. Mitchell', ''], ['Segarra', 'Santiago', '']]","['simplicial complex', 'hypergraph', 'higher-order network', 'graph signal processing', 'node embeddings']"
11692,2206.10473,Carlo Ottaviani,"Adarsh Kumar, Carlo Ottaviani, Sukhpal Singh Gill and Rajkumar Buyya",Securing the Future Internet of Things with Post-Quantum Cryptography,Accepted version,"Security and Privacy 5 (2), e20, 2022",10.1002/spy2.200,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional and lightweight cryptography primitives and protocols are
insecure against quantum attacks. Thus, a real-time application using
traditional or lightweight cryptography primitives and protocols does not
ensure full-proof security. Post-quantum Cryptography is important for the
Internet of Things (IoT) due to its security against Quantum attacks. This
paper offers a broad literature analysis of post-quantum cryptography for IoT
networks, including the challenges and research directions to adopt in
real-time applications. The work draws focus towards post-quantum cryptosystems
that are useful for resource-constraint devices. Further, those quantum attacks
are surveyed, which may occur over traditional and lightweight cryptographic
primitives.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2022 15:37:54 GMT'}]",2022-06-22,"[['Kumar', 'Adarsh', ''], ['Ottaviani', 'Carlo', ''], ['Gill', 'Sukhpal Singh', ''], ['Buyya', 'Rajkumar', '']]","['Security', 'Quantum Computing', 'Cryptography', 'Internet of Things', 'Post-Quantum Cryptography']"
11693,2005.10823,Lampros Gavalakis,"Lampros Gavalakis, Ioannis Kontoyiannis","Sharp Second-Order Pointwise Asymptotics for Lossless Compression with
  Side Information","20 pages, no figures. Based on part of arXiv:1912.05734v1",,10.3390/e22060705,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of determining the best achievable performance of arbitrary
lossless compression algorithms is examined, when correlated side information
is available at both the encoder and decoder. For arbitrary source-side
information pairs, the conditional information density is shown to provide a
sharp asymptotic lower bound for the description lengths achieved by an
arbitrary sequence of compressors. This implies that, for ergodic source-side
information pairs, the conditional entropy rate is the best achievable
asymptotic lower bound to the rate, not just in expectation but with
probability one. Under appropriate mixing conditions, a central limit theorem
and a law of the iterated logarithm are proved, describing the inevitable
fluctuations of the second-order asymptotically best possible rate. An
idealised version of Lempel-Ziv coding with side information is shown to be
universally first- and second-order asymptotically optimal, under the same
conditions. These results are in part based on a new almost-sure invariance
principle for the conditional information density, which may be of independent
interest.
","[{'version': 'v1', 'created': 'Thu, 21 May 2020 17:58:29 GMT'}]",2020-07-15,"[['Gavalakis', 'Lampros', ''], ['Kontoyiannis', 'Ioannis', '']]","['Entropy', 'lossless data compression', 'side information', 'conditional entropy', 'central limittheorem', 'law of the iterated logarithm', 'conditional varentropy']"
11694,1910.04819,Theodoros Tsiligkaridis,Theodoros Tsiligkaridis,"Information Aware Max-Norm Dirichlet Networks for Predictive Uncertainty
  Estimation","To appear in Neural Networks.
  https://doi.org/10.1016/j.neunet.2020.12.011","Neural Networks, Volume 135, March 2021, Pages 105-114",10.1016/j.neunet.2020.12.011,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Precise estimation of uncertainty in predictions for AI systems is a critical
factor in ensuring trust and safety. Deep neural networks trained with a
conventional method are prone to over-confident predictions. In contrast to
Bayesian neural networks that learn approximate distributions on weights to
infer prediction confidence, we propose a novel method, Information Aware
Dirichlet networks, that learn an explicit Dirichlet prior distribution on
predictive distributions by minimizing a bound on the expected max norm of the
prediction error and penalizing information associated with incorrect outcomes.
Properties of the new cost function are derived to indicate how improved
uncertainty estimation is achieved. Experiments using real datasets show that
our technique outperforms, by a large margin, state-of-the-art neural networks
for estimating within-distribution and out-of-distribution uncertainty, and
detecting adversarial examples.
","[{'version': 'v1', 'created': 'Thu, 10 Oct 2019 19:10:42 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Feb 2020 18:44:49 GMT'}, {'version': 'v3', 'created': 'Wed, 1 Jul 2020 00:32:23 GMT'}, {'version': 'v4', 'created': 'Mon, 4 Jan 2021 16:13:24 GMT'}]",2021-01-05,"[['Tsiligkaridis', 'Theodoros', '']]","['Predictive Uncertainty', 'Neural Networks', 'Deep Learning', 'UncertaintyQuantification', 'Dirichlet']"
11695,1806.06124,Pooya Ashtari,"Pooya Ashtari, Fateme Nateghi Haredasht, Hamid Beigy",Supervised Fuzzy Partitioning,"30 pages, 6 figures, 6 tables, 1 algorithm",,10.1016/j.patcog.2019.107013,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Centroid-based methods including k-means and fuzzy c-means are known as
effective and easy-to-implement approaches to clustering purposes in many
applications. However, these algorithms cannot be directly applied to
supervised tasks. This paper thus presents a generative model extending the
centroid-based clustering approach to be applicable to classification and
regression tasks. Given an arbitrary loss function, the proposed approach,
termed Supervised Fuzzy Partitioning (SFP), incorporates labels information
into its objective function through a surrogate term penalizing the empirical
risk. Entropy-based regularization is also employed to fuzzify the partition
and to weight features, enabling the method to capture more complex patterns,
identify significant features, and yield better performance facing
high-dimensional data. An iterative algorithm based on block coordinate descent
scheme is formulated to efficiently find a local optimum. Extensive
classification experiments on synthetic, real-world, and high-dimensional
datasets demonstrate that the predictive performance of SFP is competitive with
state-of-the-art algorithms such as SVM and random forest. SFP has a major
advantage over such methods, in that it not only leads to a flexible, nonlinear
model but also can exploit any convex loss function in the training phase
without compromising computational efficiency.
","[{'version': 'v1', 'created': 'Fri, 15 Jun 2018 20:49:08 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Jul 2018 09:50:39 GMT'}, {'version': 'v3', 'created': 'Thu, 20 Sep 2018 11:37:30 GMT'}, {'version': 'v4', 'created': 'Mon, 22 Oct 2018 12:18:35 GMT'}, {'version': 'v5', 'created': 'Mon, 19 Aug 2019 11:52:06 GMT'}]",2021-04-20,"[['Ashtari', 'Pooya', ''], ['Haredasht', 'Fateme Nateghi', ''], ['Beigy', 'Hamid', '']]","['Supervised k-means', 'Centroid-based Clustering', 'Entropy-based Regularization', 'Feature Weighting', 'Mixtures of Experts']"
11696,2005.09233,Yun-Fei Fu,"Yun-Fei Fu, Bernard Rolfe, Ngai Sum Louis Chiu, Yanan Wang, Xiaodong
  Huang, Kazem Ghabraie","SEMDOT: Smooth-Edged Material Distribution for Optimizing Topology
  Algorithm",Accepted by Advances in Engineering Software,"Advances in Engineering Software, 2020",10.1016/j.advengsoft.2020.102921,"Volume 150, December 2020, 102921",cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Element-based topology optimization algorithms capable of generating smooth
boundaries have drawn serious attention given the significance of accurate
boundary information in engineering applications. The basic framework of a new
element-based continuum algorithm is proposed in this paper. This algorithm is
based on a smooth-edged material distribution strategy that uses solid/void
grid points assigned to each element. Named Smooth-Edged Material Distribution
for Optimizing Topology (SEMDOT), the algorithm uses elemental volume fractions
which depend on the densities of grid points in the Finite Element Analysis
(FEA) model rather than elemental densities. Several numerical examples are
studied to demonstrate the application and effectiveness of SEMDOT. In these
examples, SEMDOT proved to be capable of obtaining optimized topologies with
smooth and clear boundaries showing better or comparable performance compared
to other topology optimization methods. Through these examples, first, the
advantages of using the Heaviside smooth function are discussed in comparison
to the Heaviside step function. Then, the benefits of introducing multiple
filtering steps in this algorithm are shown. Finally, comparisons are conducted
to exhibit the differences between SEMDOT and some well-established
element-based algorithms. The validation of the sensitivity analysis method
adopted in SEMDOT is conducted using a typical compliant mechanism design case.
In addition, this paper provides the Matlab code of SEMDOT for educational and
academic purposes.
","[{'version': 'v1', 'created': 'Tue, 19 May 2020 06:03:40 GMT'}, {'version': 'v2', 'created': 'Wed, 20 May 2020 00:54:37 GMT'}, {'version': 'v3', 'created': 'Fri, 25 Sep 2020 09:19:57 GMT'}]",2021-01-11,"[['Fu', 'Yun-Fei', ''], ['Rolfe', 'Bernard', ''], ['Chiu', 'Ngai Sum Louis', ''], ['Wang', 'Yanan', ''], ['Huang', 'Xiaodong', ''], ['Ghabraie', 'Kazem', '']]","['Topology optimization', 'Smooth design', 'Elemental volume fractions', 'Boundary elements', 'Heaviside']"
11697,2012.08677,Sheng Yue,"Sheng Yue, Ju Ren, Jiang Xin, Sen Lin, Junshan Zhang","Inexact-ADMM Based Federated Meta-Learning for Fast and Continual Edge
  Learning",,,10.1145/3466772.3467038,,cs.LG cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to meet the requirements for performance, safety, and latency in
many IoT applications, intelligent decisions must be made right here right now
at the network edge. However, the constrained resources and limited local data
amount pose significant challenges to the development of edge AI. To overcome
these challenges, we explore continual edge learning capable of leveraging the
knowledge transfer from previous tasks. Aiming to achieve fast and continual
edge learning, we propose a platform-aided federated meta-learning architecture
where edge nodes collaboratively learn a meta-model, aided by the knowledge
transfer from prior tasks. The edge learning problem is cast as a regularized
optimization problem, where the valuable knowledge learned from previous tasks
is extracted as regularization. Then, we devise an ADMM based federated
meta-learning algorithm, namely ADMM-FedMeta, where ADMM offers a natural
mechanism to decompose the original problem into many subproblems which can be
solved in parallel across edge nodes and the platform. Further, a variant of
inexact-ADMM method is employed where the subproblems are `solved' via linear
approximation as well as Hessian estimation to reduce the computational cost
per round to $\mathcal{O}(n)$. We provide a comprehensive analysis of
ADMM-FedMeta, in terms of the convergence properties, the rapid adaptation
performance, and the forgetting effect of prior knowledge transfer, for the
general non-convex case. Extensive experimental studies demonstrate the
effectiveness and efficiency of ADMM-FedMeta, and showcase that it
substantially outperforms the existing baselines.
","[{'version': 'v1', 'created': 'Wed, 16 Dec 2020 00:02:26 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Dec 2020 21:02:45 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Jun 2021 23:52:59 GMT'}, {'version': 'v4', 'created': 'Tue, 17 Aug 2021 19:43:12 GMT'}]",2021-08-19,"[['Yue', 'Sheng', ''], ['Ren', 'Ju', ''], ['Xin', 'Jiang', ''], ['Lin', 'Sen', ''], ['Zhang', 'Junshan', '']]","['edge intelligence', 'continual learning', 'federated meta-learning', 'regularization', 'ADMM']"
11698,1906.11185,Ueverton Souza,"Claudson F. Bornstein and Martin Charles Golumbic and Tanilson D.
  Santos and U\'everton S. Souza and Jayme L. Szwarcfiter",The Complexity of Helly-$B_{1}$ EPG Graph Recognition,,"Discrete Mathematics & Theoretical Computer Science, vol. 22 no.
  1, Graph Theory (June 4, 2020) dmtcs:6506",10.23638/DMTCS-22-1-19,,cs.DM cs.CC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Golumbic, Lipshteyn, and Stern defined in 2009 the class of EPG graphs, the
intersection graph class of edge paths on a grid. An EPG graph $G$ is a graph
that admits a representation where its vertices correspond to paths in a grid
$Q$, such that two vertices of $G$ are adjacent if and only if their
corresponding paths in $Q$ have a common edge. If the paths in the
representation have at most $k$ bends, we say that it is a $B_k$-EPG
representation. A collection $C$ of sets satisfies the Helly property when
every sub-collection of $C$ that is pairwise intersecting has at least one
common element. In this paper, we show that given a graph $G$ and an integer
$k$, the problem of determining whether $G$ admits a $B_k$-EPG representation
whose edge-intersections of paths satisfy the Helly property, so-called
Helly-$B_k$-EPG representation, is in NP, for every $k$ bounded by a polynomial
function of $|V(G)|$. Moreover, we show that the problem of recognizing
Helly-$B_1$-EPG graphs is NP-complete, and it remains NP-complete even when
restricted to 2-apex and 3-degenerate graphs.
","[{'version': 'v1', 'created': 'Wed, 26 Jun 2019 16:06:16 GMT'}, {'version': 'v2', 'created': 'Fri, 15 May 2020 14:38:39 GMT'}, {'version': 'v3', 'created': 'Mon, 25 May 2020 16:44:33 GMT'}]",2020-08-25,"[['Bornstein', 'Claudson F.', ''], ['Golumbic', 'Martin Charles', ''], ['Santos', 'Tanilson D.', ''], ['Souza', 'Uéverton S.', ''], ['Szwarcfiter', 'Jayme L.', '']]","['paths', 'grid', 'EPG', 'Helly', 'intersection graphs', 'NP-completeness', 'single bend']"
11699,2008.10039,Toshiyuki Yokoyama,"Toshiyuki T. Yokoyama, Masashi Okada, Tadahiro Taniguchi","Visual Exploration System for Analyzing Trends in Annual Recruitment
  Using Time-varying Graphs",,,10.1371/journal.pone.0247587,,cs.HC cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Annual recruitment data of new graduates are manually analyzed by human
resources specialists (HR) in industries, which signifies the need to evaluate
the recruitment strategy of HR specialists. Every year, different applicants
send in job applications to companies. The relationships between applicants'
attributes (e.g., English skill or academic credential) can be used to analyze
the changes in recruitment trends across multiple years' data. However, most
attributes are unnormalized and thus require thorough preprocessing. Such
unnormalized data hinder the effective comparison of the relationship between
applicants in the early stage of data analysis. Thus, a visual exploration
system is highly needed to gain insight from the overview of the relationship
between applicants across multiple years. In this study, we propose the
Polarizing Attributes for Network Analysis of Correlation on Entities
Association (Panacea) visualization system. The proposed system integrates a
time-varying graph model and dynamic graph visualization for heterogeneous
tabular data. Using this system, human resource specialists can interactively
inspect the relationships between two attributes of prospective employees
across multiple years. Further, we demonstrate the usability of Panacea with
representative examples for finding hidden trends in real-world datasets and
then describe HR specialists' feedback obtained throughout Panacea's
development. The proposed Panacea system enables HR specialists to visually
explore the annual recruitment of new graduates.
","[{'version': 'v1', 'created': 'Sun, 23 Aug 2020 13:26:29 GMT'}]",2021-06-09,"[['Yokoyama', 'Toshiyuki T.', ''], ['Okada', 'Masashi', ''], ['Taniguchi', 'Tadahiro', '']]","['Human resources', 'Data visualization', 'Property graph', 'Timeseries analysis']"
11700,2104.05040,Zhenlong Li Dr.,"Zhenlong Li, Xiao Huang, Tao Hu, Huan Ning, Xinyue Ye, Xiaoming Li","ODT FLOW: A Scalable Platform for Extracting, Analyzing, and Sharing
  Multi-source Multi-scale Human Mobility",,,10.1371/journal.pone.0255259,,cs.DC cs.DB cs.SI,http://creativecommons.org/licenses/by/4.0/,"  In response to the soaring needs of human mobility data, especially during
disaster events such as the COVID-19 pandemic, and the associated big data
challenges, we develop a scalable online platform for extracting, analyzing,
and sharing multi-source multi-scale human mobility flows. Within the platform,
an origin-destination-time (ODT) data model is proposed to work with scalable
query engines to handle heterogenous mobility data in large volumes with
extensive spatial coverage, which allows for efficient extraction, query, and
aggregation of billion-level origin-destination (OD) flows in parallel at the
server-side. An interactive spatial web portal, ODT Flow Explorer, is developed
to allow users to explore multi-source mobility datasets with user-defined
spatiotemporal scales. To promote reproducibility and replicability, we further
develop ODT Flow REST APIs that provide researchers with the flexibility to
access the data programmatically via workflows, codes, and programs.
Demonstrations are provided to illustrate the potential of the APIs integrating
with scientific workflows and with the Jupyter Notebook environment. We believe
the platform coupled with the derived multi-scale mobility data can assist
human mobility monitoring and analysis during disaster events such as the
ongoing COVID-19 pandemic and benefit both scientific communities and the
general public in understanding human mobility dynamics.
","[{'version': 'v1', 'created': 'Sun, 11 Apr 2021 16:07:00 GMT'}]",2021-09-15,"[['Li', 'Zhenlong', ''], ['Huang', 'Xiao', ''], ['Hu', 'Tao', ''], ['Ning', 'Huan', ''], ['Ye', 'Xinyue', ''], ['Li', 'Xiaoming', '']]","['population movement', 'social media', 'SafeGraph', 'workflow', 'ODT cube']"
11701,2203.01272,Yong Kiam Tan,"James Gallicchio, Yong Kiam Tan, Stefan Mitsch, Andr\'e Platzer","Implicit Definitions with Differential Equations for KeYmaera X (System
  Description)","Long version of paper at IJCAR 2022 (11th International Joint
  Conference on Automated Reasoning, August 8-10, 2022, Haifa, Israel)",,10.1007/978-3-031-10769-6_42,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Definition packages in theorem provers provide users with means of defining
and organizing concepts of interest. This system description presents a new
definition package for the hybrid systems theorem prover KeYmaera X based on
differential dynamic logic (dL). The package adds KeYmaera X support for
user-defined smooth functions whose graphs can be implicitly characterized by
dL formulas. Notably, this makes it possible to implicitly characterize
functions, such as the exponential and trigonometric functions, as solutions of
differential equations and then prove properties of those functions using dL's
differential equation reasoning principles. Trustworthiness of the package is
achieved by minimally extending KeYmaera X's soundness-critical kernel with a
single axiom scheme that expands function occurrences with their implicit
characterization. Users are provided with a high-level interface for defining
functions and non-soundness-critical tactics that automate low-level reasoning
over implicit characterizations in hybrid system proofs.
","[{'version': 'v1', 'created': 'Wed, 2 Mar 2022 17:59:00 GMT'}, {'version': 'v2', 'created': 'Tue, 31 May 2022 14:45:15 GMT'}]",2022-11-23,"[['Gallicchio', 'James', ''], ['Tan', 'Yong Kiam', ''], ['Mitsch', 'Stefan', ''], ['Platzer', 'André', '']]","['Definitions', 'differential dynamic logic', 'verification of hybrid systems', 'theorem proving']"
11702,2108.09164,Changzhen Ji,"Changzhen Ji, Yating Zhang, Xiaozhong Liu, Adam Jatowt, Changlong Sun,
  Conghui Zhu and Tiejun Zhao","A Neural Conversation Generation Model via Equivalent Shared Memory
  Investigation",,,10.1145/3459637.3482407,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Conversation generation as a challenging task in Natural Language Generation
(NLG) has been increasingly attracting attention over the last years. A number
of recent works adopted sequence-to-sequence structures along with external
knowledge, which successfully enhanced the quality of generated conversations.
Nevertheless, few works utilized the knowledge extracted from similar
conversations for utterance generation. Taking conversations in customer
service and court debate domains as examples, it is evident that essential
entities/phrases, as well as their associated logic and inter-relationships can
be extracted and borrowed from similar conversation instances. Such information
could provide useful signals for improving conversation generation. In this
paper, we propose a novel reading and memory framework called Deep Reading
Memory Network (DRMN) which is capable of remembering useful information of
similar conversations for improving utterance generation. We apply our model to
two large-scale conversation datasets of justice and e-commerce fields.
Experiments prove that the proposed model outperforms the state-of-the-art
approaches.
","[{'version': 'v1', 'created': 'Fri, 20 Aug 2021 13:20:14 GMT'}]",2021-08-23,"[['Ji', 'Changzhen', ''], ['Zhang', 'Yating', ''], ['Liu', 'Xiaozhong', ''], ['Jatowt', 'Adam', ''], ['Sun', 'Changlong', ''], ['Zhu', 'Conghui', ''], ['Zhao', 'Tiejun', '']]","['Conversation Generation', 'Equivalent Shared Memory', 'Deep Reading Memory Network']"
11703,2211.16820,Fabian Meyer,"Fabian Meyer, Katharina Glock",Trajectory-based Traveling Salesman Problem for Multirotor UAVs,"This work was published at 2021 17th International Conference on
  Distributed Computing in Sensor Systems (DCOSS)","2021 17th International Conference on Distributed Computing in
  Sensor Systems (DCOSS), 2021, pp. 335-342",10.1109/DCOSS52077.2021.00061,,cs.RO math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new method for integrated time-optimal routing and
trajectory optimization of multirotor unmanned aerial vehicles (UAVs). Our
approach extends the well-known Traveling Salesman Problem by accounting for
the limited maneuverability of the UAVs due to their kinematic properties. To
this end, we allow each waypoint to be traversed with a discretized velocity as
well as a discretized flight direction and compute time-optimal trajectories to
determine the travel time costs for each edge. We refer to this novel
optimization problem as the Trajectory-based Traveling Salesman Problem
(TBTSP). The results show that compared to a state-of-the-art approach for
Traveling Salesman Problems with kinematic restrictions of UAVs, we can
decrease mission duration by up to 15\%.
","[{'version': 'v1', 'created': 'Wed, 30 Nov 2022 08:39:52 GMT'}]",2022-12-01,"[['Meyer', 'Fabian', ''], ['Glock', 'Katharina', '']]","['Traveling Salesman Problem', 'multirotor UAV', 'route planning', 'trajectory planning', 'time-optimality']"
11704,2202.12915,Valentin Zieglmeier,Valentin Zieglmeier and Antonia Maria Lehene,Designing Trustworthy User Interfaces,"Peer-reviewed version accepted for publication in the proceedings of
  the 33rd Australian Conference on Human-Computer Interaction (OzCHI '21)",,10.1145/3520495.3520525,,cs.HC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interface design can directly influence trustworthiness of a software.
Thereby, it affects users' intention to use a tool. Previous research on user
trust has not comprehensively addressed user interface design, though. We lack
an understanding of what makes interfaces trustworthy (1), as well as
actionable measures to improve trustworthiness (2). We contribute to this by
addressing both gaps. Based on a systematic literature review, we give a
thorough overview over the theory on user trust and provide a taxonomy of
factors influencing user interface trustworthiness. Then, we derive concrete
measures to address these factors in interface design. We use the results to
create a proof of concept interface. In a preliminary evaluation, we compare a
variant designed to elicit trust with one designed to reduce it. Our results
show that the measures we apply can be effective in fostering trust in users.
","[{'version': 'v1', 'created': 'Fri, 25 Feb 2022 19:12:48 GMT'}]",2022-03-01,"[['Zieglmeier', 'Valentin', ''], ['Lehene', 'Antonia Maria', '']]","['User trust', 'User-centered design', 'Taxonomy', 'Systematic literaturereview', 'Proof of concept']"
11705,2001.05228,Aditya Kusupati,"Yashoteja Prabhu, Aditya Kusupati, Nilesh Gupta and Manik Varma",Extreme Regression for Dynamic Search Advertising,"15 pages, 4 figures, published at WSDM 2020 as a Long Oral",,10.1145/3336191.3371768,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a new learning paradigm called eXtreme Regression (XR)
whose objective is to accurately predict the numerical degrees of relevance of
an extremely large number of labels to a data point. XR can provide elegant
solutions to many large-scale ranking and recommendation applications including
Dynamic Search Advertising (DSA). XR can learn more accurate models than the
recently popular extreme classifiers which incorrectly assume strictly
binary-valued label relevances. Traditional regression metrics which sum the
errors over all the labels are unsuitable for XR problems since they could give
extremely loose bounds for the label ranking quality. Also, the existing
regression algorithms won't efficiently scale to millions of labels. This paper
addresses these limitations through: (1) new evaluation metrics for XR which
sum only the k largest regression errors; (2) a new algorithm called XReg which
decomposes XR task into a hierarchy of much smaller regression problems thus
leading to highly efficient training and prediction. This paper also introduces
a (3) new labelwise prediction algorithm in XReg useful for DSA and other
recommendation tasks. Experiments on benchmark datasets demonstrated that XReg
can outperform the state-of-the-art extreme classifiers as well as large-scale
regressors and rankers by up to 50% reduction in the new XR error metric, and
up to 2% and 2.4% improvements in terms of the propensity-scored precision
metric used in extreme classification and the click-through rate metric used in
DSA respectively. Deployment of XReg on DSA in Bing resulted in a relative gain
of 27% in query coverage. XReg's source code can be downloaded from
http://manikvarma.org/code/XReg/download.html.
","[{'version': 'v1', 'created': 'Wed, 15 Jan 2020 10:56:42 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Jan 2020 02:34:48 GMT'}, {'version': 'v3', 'created': 'Mon, 20 Jan 2020 10:46:58 GMT'}]",2020-01-22,"[['Prabhu', 'Yashoteja', ''], ['Kusupati', 'Aditya', ''], ['Gupta', 'Nilesh', ''], ['Varma', 'Manik', '']]","['Extreme classification', 'dynamic search advertising', 'regression']"
11706,1911.01208,Alon Kipnis,Alon Kipnis,"Higher Criticism for Discriminating Word-Frequency Tables and Testing
  Authorship",,"The Annals of Applied Statistics 16, no. 2 (2022): 1236-1252",10.1214/21-AOAS1544,,cs.CL cs.LG stat.CO stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We adapt the Higher Criticism (HC) goodness-of-fit test to measure the
closeness between word-frequency tables. We apply this measure to authorship
attribution challenges, where the goal is to identify the author of a document
using other documents whose authorship is known. The method is simple yet
performs well without handcrafting and tuning; reporting accuracy at the state
of the art level in various current challenges. As an inherent side effect, the
HC calculation identifies a subset of discriminating words. In practice, the
identified words have low variance across documents belonging to a corpus of
homogeneous authorship. We conclude that in comparing the similarity of a new
document and a corpus of a single author, HC is mostly affected by words
characteristic of the author and is relatively unaffected by topic structure.
","[{'version': 'v1', 'created': 'Wed, 30 Oct 2019 23:47:25 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Dec 2019 19:41:44 GMT'}, {'version': 'v3', 'created': 'Mon, 6 Jul 2020 20:04:32 GMT'}, {'version': 'v4', 'created': 'Mon, 27 Dec 2021 14:31:26 GMT'}, {'version': 'v5', 'created': 'Tue, 21 Jun 2022 07:29:10 GMT'}]",2022-06-22,"[['Kipnis', 'Alon', '']]","['higher criticism', 'two-sample testing', 'nonparametric methods', 'unsupervised learning', 'feature selection', 'authorship attribution']"
11707,1909.12252,Chandrakana Nandi,"Chandrakana Nandi, Max Willsey, Adam Anderson, James R. Wilcox, Eva
  Darulova, Dan Grossman, Zachary Tatlock","Synthesizing Structured CAD Models with Equality Saturation and Inverse
  Transformations",14 pages,PLDI 2020,10.1145/3385412.3386012,,cs.PL cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent program synthesis techniques help users customize CAD models(e.g., for
3D printing) by decompiling low-level triangle meshes to Constructive Solid
Geometry (CSG) expressions. Without loops or functions, editing CSG can require
many coordinated changes, and existing mesh decompilers use heuristics that can
obfuscate high-level structure.
  This paper proposes a second decompilation stage to robustly ""shrink""
unstructured CSG expressions into more editable programs with map and fold
operators. We present Szalinski, a tool that uses Equality Saturation with
semantics-preserving CAD rewrites to efficiently search for smaller equivalent
programs. Szalinski relies on inverse transformations, a novel way for solvers
to speculatively add equivalences to an E-graph. We qualitatively evaluate
Szalinski in case studies, show how it composes with an existing mesh
decompiler, and demonstrate that Szalinski can shrink large models in seconds.
","[{'version': 'v1', 'created': 'Thu, 26 Sep 2019 16:58:08 GMT'}, {'version': 'v2', 'created': 'Tue, 31 Mar 2020 15:05:08 GMT'}, {'version': 'v3', 'created': 'Sun, 12 Apr 2020 18:15:51 GMT'}]",2021-01-08,"[['Nandi', 'Chandrakana', ''], ['Willsey', 'Max', ''], ['Anderson', 'Adam', ''], ['Wilcox', 'James R.', ''], ['Darulova', 'Eva', ''], ['Grossman', 'Dan', ''], ['Tatlock', 'Zachary', '']]","['Program Synthesis', 'Equality Graph', 'Decompilation', 'Computer-Aided Design']"
11708,2002.05341,Ruoxi Sun,Ruoxi Sun and Minhui Xue,"Quality Assessment of Online Automated Privacy Policy Generators: An
  Empirical Study","The International Conference on Evaluation and Assessment in Software
  Engineering (EASE) 2020",,10.1145/3383219.3383247,,cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online Automated Privacy Policy Generators (APPGs) are tools used by app
developers to quickly create app privacy policies which are required by privacy
regulations to be incorporated to each mobile app. The creation of these tools
brings convenience to app developers; however, the quality of these tools puts
developers and stakeholders at legal risk. In this paper, we conduct an
empirical study to assess the quality of online APPGs. We analyze the
completeness of privacy policies, determine what categories and items should be
covered in a complete privacy policy, and conduct APPG assessment with
boilerplate apps. The results of assessment show that due to the lack of static
or dynamic analysis of app's behavior, developers may encounter two types of
issues caused by APPGs. First, the generated policies could be incomplete
because they do not cover all the essential items required by a privacy policy.
Second, some generated privacy policies contain unnecessary personal
information collection or arbitrary commitments inconsistent with user input.
Ultimately, the defects of APPGs may potentially lead to serious legal issues.
We hope that the results and insights developed in this paper can motivate the
healthy and ethical development of APPGs towards generating a more complete,
accurate, and robust privacy policy.
","[{'version': 'v1', 'created': 'Thu, 13 Feb 2020 04:34:57 GMT'}]",2020-02-14,"[['Sun', 'Ruoxi', ''], ['Xue', 'Minhui', '']]","['Automated privacy policy generator', 'Privacy policy completenessanalysis', 'Qality assessment']"
11709,1906.08099,Richard Mayne Dr.,"Richard Mayne, Thomas C. Draper, Neil Phillips, James G. H. Whiting,
  Roshan Weerasekera, Claire Fullarton, Ben P. J. de Lacy Costello, Andrew
  Adamatzky",Neuromorphic Liquid Marbles With Aqueous Carbon Nanotube Cores,"14 pages, 5 figures","Langmuir, 2019, 35, 13182-13188",10.1021/acs.langmuir.9b02552,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neuromorphic computing devices attempt to emulate features of biological
nervous systems through mimicking the properties of synapses, towards
implementing the emergent properties of their counterparts, such as learning.
Inspired by recent advances in the utilisation of liquid marbles (microlitre
quantities of fluid coated in hydrophobic powder) for the creation of
unconventional computing devices, we describe the development of liquid marbles
with neuromorphic properties through the use of copper coatings and 1.0 mg/ml
carbon nanotube-containing fluid cores. Experimentation was performed through
sandwiching the marbles between two cup-style electrodes and stimulating them
with repeated DC pulses at 3.0 V. Our results demonstrate that `entrainment' of
a carbon nanotube filled-copper liquid marble via periodic pulses can cause
their electrical resistance to rapidly switch between high to low resistance
profiles, upon inverting the polarity of stimulation: the reduction in
resistance between high and low profiles was approximately 88\% after two
rounds of entrainment. This effect was found to be reversible through reversion
to the original stimulus polarity and was strengthened by repeated
experimentation, as evidenced by a mean reduction in time to switching onset of
43\%. These effects were not replicated in nanotube solutions not bound inside
liquid marbles. Our electrical characterisation also reveals that
nanotube-filled liquid marbles exhibit pinched loop hysteresis IV profiles
consistent with the description of memristors. We conclude by discussing the
applications of this technology to the development of unconventional computing
devices and the study of emergent characteristics in biological neural tissue.
","[{'version': 'v1', 'created': 'Wed, 19 Jun 2019 13:53:34 GMT'}]",2021-05-12,"[['Mayne', 'Richard', ''], ['Draper', 'Thomas C.', ''], ['Phillips', 'Neil', ''], ['Whiting', 'James G. H.', ''], ['Weerasekera', 'Roshan', ''], ['Fullarton', 'Claire', ''], ['Costello', 'Ben P. J. de Lacy', ''], ['Adamatzky', 'Andrew', '']]","['Memristor', 'Unconventional Computing', 'Nanotechnology', 'Synapse', 'Biomimetic']"
11710,2104.02303,Tomasz Kryjak,"Dominika Przewlocka-Rus, Marcin Kowalczyk, Tomasz Kryjak","Exploration of Hardware Acceleration Methods for an XNOR Traffic Signs
  Classifier","12 pages, 2 figures, 6 tables. Submitted for the CORES 2021
  conference",,10.1007/978-3-030-81523-3_4,,cs.CV cs.AI eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning algorithms are a key component of many state-of-the-art vision
systems, especially as Convolutional Neural Networks (CNN) outperform most
solutions in the sense of accuracy. To apply such algorithms in real-time
applications, one has to address the challenges of memory and computational
complexity. To deal with the first issue, we use networks with reduced
precision, specifically a binary neural network (also known as XNOR). To
satisfy the computational requirements, we propose to use highly parallel and
low-power FPGA devices. In this work, we explore the possibility of
accelerating XNOR networks for traffic sign classification. The trained binary
networks are implemented on the ZCU 104 development board, equipped with a Zynq
UltraScale+ MPSoC device using two different approaches. Firstly, we propose a
custom HDL accelerator for XNOR networks, which enables the inference with
almost 450 fps. Even better results are obtained with the second method - the
Xilinx FINN accelerator - enabling to process input images with around 550
frame rate. Both approaches provide over 96% accuracy on the test set.
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2021 06:01:57 GMT'}]",2022-12-19,"[['Przewlocka-Rus', 'Dominika', ''], ['Kowalczyk', 'Marcin', ''], ['Kryjak', 'Tomasz', '']]","['XNOR', 'FPGA', 'traffic signs recognition', 'hardware acceleration', 'FINN']"
11711,2110.00821,Elisa Claire Alem\'an Carre\'on,Elisa Claire Alem\'an Carre\'on and Hirofumi Nonaka and Toru Hiraoka,"Relation Analysis between Hotel Review Rating Scores and Sentiment
  Analysis of Reviews by Chinese Tourists Visiting Japan",Translation of the original in Japanese,"The Japanese Journal of the Institute of Industrial Applications
  Engineers (JJIIAE), 2018, Vol. 6, No. 2. pp. 95-99",10.12792/jjiiae.6.2.95,,cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In current times, the importance of online hotel review sites has become more
and more apparent. Users of these sites reference of reviews strongly
influences their purchase behavior and as such, reviews are important to
companies and researchers alike. The majority of review sites offer both text
reviews and numerical hotel ratings, and both information sources are widely
used by researchers as a representation of a customer's sentiment and opinion.
However, an opinion is a difficult concept to measure, and as such, depending
on the relation these two sources have, it would be apparent whether or not it
is safe to consider them equally in research. In this study we utilize an
entropy-based Support Vector Machine to classify positive and negative
sentiments in hotel reviews from the site Ctrip, then calculating the ratio of
positive and negative sentiment in each review and examine their correlation
with said review's rating score using Spearman and Kendall Correlation
coefficients and Maximal Information Coefficient (MIC).
","[{'version': 'v1', 'created': 'Sat, 2 Oct 2021 15:07:46 GMT'}]",2021-10-05,"[['Carreón', 'Elisa Claire Alemán', ''], ['Nonaka', 'Hirofumi', ''], ['Hiraoka', 'Toru', '']]","['Sentiment Analysis', 'Tourism', 'SVM', 'Machine Learning', 'Chinese']"
11712,2206.15429,Shengzhe Hou,"Shengzhe Hou, Xinming Lu, Wenli Gao, Shuai Jiang, Xingli Zhang",Interactive Physically-Based Simulation of Roadheader Robot,,,10.1007/s13369-022-07335-x,,cs.RO cs.GR,http://creativecommons.org/licenses/by/4.0/,"  Roadheader is an engineering robot widely used in underground engineering and
mining industry. Interactive dynamics simulation of roadheader is a fundamental
problem in unmanned excavation and virtual reality training. However, current
research is only based on traditional animation techniques or commercial game
engines. There are few studies that apply real-time physical simulation of
computer graphics to the field of roadheader robot. This paper aims to present
an interactive physically-based simulation system of roadheader robot. To this
end, an improved multibody simulation method based on generalized coordinates
is proposed. First, our simulation method describes robot dynamics based on
generalized coordinates. Compared to state-of-the-art methods, our method is
more stable and accurate. Numerical simulation results showed that our method
has significantly less error than the game engine in the same number of
iterations. Second, we adopt the symplectic Euler integrator instead of the
conventional fourth-order Runge-Kutta (RK4) method for dynamics iteration.
Compared with other integrators, our method is more stable in energy drift
during long-term simulation. The test results showed that our system achieved
real-time interaction performance of 60 frames per second (fps). Furthermore,
we propose a model format for geometric and robotics modeling of roadheaders to
implement the system. Our interactive simulation system of roadheader meets the
requirements of interactivity, accuracy and stability.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2022 14:33:50 GMT'}]",2022-10-04,"[['Hou', 'Shengzhe', ''], ['Lu', 'Xinming', ''], ['Gao', 'Wenli', ''], ['Jiang', 'Shuai', ''], ['Zhang', 'Xingli', '']]","['Physically-based simulation', 'Robotics simulation', 'Roadheader', 'Interactive simulation', 'Numerical integration']"
11713,2207.06336,Bruno Klaus de Aquino Afonso,"Bruno Klaus de Aquino Afonso, Lilian Berton","QT-Routenet: Improved GNN generalization to larger 5G networks by
  fine-tuning predictions from queueing theory",,ITU Journal on Future and Evolving Technologies 3 (2022),10.52953/FBRB3688,,cs.NI cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  In order to promote the use of machine learning in 5G, the International
Telecommunication Union (ITU) proposed in 2021 the second edition of the ITU
AI/ML in 5G challenge, with over 1600 participants from 82 countries. This work
details the second place solution overall, which is also the winning solution
of the Graph Neural Networking Challenge 2021. We tackle the problem of
generalization when applying a model to a 5G network that may have longer paths
and larger link capacities than the ones observed in training. To achieve this,
we propose to first extract robust features related to Queueing Theory (QT),
and then fine-tune the analytical baseline prediction using a modification of
the Routenet Graph Neural Network (GNN) model. The proposed solution
generalizes much better than simply using Routenet, and manages to reduce the
analytical baseline's 10.42 mean absolute percent error to 1.45 (1.27 with an
ensemble). This suggests that making small changes to an approximate model that
is known to be robust can be an effective way to improve accuracy without
compromising generalization.
","[{'version': 'v1', 'created': 'Wed, 13 Jul 2022 16:49:37 GMT'}]",2022-10-05,"[['Afonso', 'Bruno Klaus de Aquino', ''], ['Berton', 'Lilian', '']]","['5G networks', 'fine-tuning', 'graph neural network', 'ITU challenge', 'queueing theory']"
11714,2202.04582,Yu Meng,"Yu Meng, Yunyi Zhang, Jiaxin Huang, Yu Zhang, Jiawei Han","Topic Discovery via Latent Space Clustering of Pretrained Language Model
  Representations",WWW 2022. (Code: https://github.com/yumeng5/TopClus),,10.1145/3485447.3512034,,cs.CL cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Topic models have been the prominent tools for automatic topic discovery from
text corpora. Despite their effectiveness, topic models suffer from several
limitations including the inability of modeling word ordering information in
documents, the difficulty of incorporating external linguistic knowledge, and
the lack of both accurate and efficient inference methods for approximating the
intractable posterior. Recently, pretrained language models (PLMs) have brought
astonishing performance improvements to a wide variety of tasks due to their
superior representations of text. Interestingly, there have not been standard
approaches to deploy PLMs for topic discovery as better alternatives to topic
models. In this paper, we begin by analyzing the challenges of using PLM
representations for topic discovery, and then propose a joint latent space
learning and clustering framework built upon PLM embeddings. In the latent
space, topic-word and document-topic distributions are jointly modeled so that
the discovered topics can be interpreted by coherent and distinctive terms and
meanwhile serve as meaningful summaries of the documents. Our model effectively
leverages the strong representation power and superb linguistic features
brought by PLMs for topic discovery, and is conceptually simpler than topic
models. On two benchmark datasets in different domains, our model generates
significantly more coherent and diverse topics than strong topic models, and
offers better topic-wise document representations, based on both automatic and
human evaluations.
","[{'version': 'v1', 'created': 'Wed, 9 Feb 2022 17:26:08 GMT'}]",2022-02-10,"[['Meng', 'Yu', ''], ['Zhang', 'Yunyi', ''], ['Huang', 'Jiaxin', ''], ['Zhang', 'Yu', ''], ['Han', 'Jiawei', '']]","['Topic Discovery', 'Pretrained Language Models', 'Clustering']"
11715,1912.09142,Davide De Tommaso,Davide De Tommaso and Agnieszka Wykowska,"TobiiGlassesPySuite: An open-source suite for using the Tobii Pro
  Glasses 2 in eye-tracking studies",,,10.1145/3314111.3319828,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  In this paper we present the TobiiGlassesPySuite, an open-source suite we
implemented for using the Tobii Pro Glasses 2 wearable eye-tracker in custom
eye-tracking studies. We provide a platform-independent solution for
controlling the device and for managing the recordings. The software consists
of Python modules, integrated into a single package, accompanied by sample
scripts and recordings. The proposed solution aims at providing additional
methods with respect to the manufacturer's software, for allowing the users to
exploit more the device's capabilities and the existing software. Our suite is
available for download from the repository indicated in the paper and usable
according to the terms of the GNU GPL v3.0 license.
","[{'version': 'v1', 'created': 'Thu, 19 Dec 2019 11:46:57 GMT'}]",2019-12-20,"[['De Tommaso', 'Davide', ''], ['Wykowska', 'Agnieszka', '']]","['eye-tracking', 'human-computer interaction', 'Tobii Pro Glasses 2', 'wearable eye-tracker', 'wearable computing', 'open-source']"
11716,2108.02532,Ivan Mezei,"Jelena Stanulovic, Nathalie Mitton and Ivan Mezei","Routing with Face Traversal and Auctions Algorithms for Task Allocation
  in WSRN","21 p., submitted for journal publication","Sensors, MDPI, 21(18):6149, 2021",10.3390/s21186149,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Four new algorithms (RFTA1, RFTA2, GFGF2A, and RFTA2GE) handling the event in
wireless sensor and robot networks based on the Greedy-Face-Greedy (GFG)
routing extended with auctions are proposed in this paper. In this paper we
assume that all robots are mobile and after the event is found (reported by
sensors), the goal is to allocate the task to the most suitable robot to act
upon the event, using either distance or the robots' remaining energy as
metrics. The proposed algorithms consist of two phases. The first phase of
algorithms is based on face routing and we introduced the parameter called
search radius (SR) at the end of this first phase. Routing is considered
successful if the found robot is inside SR. After that, the second phase, based
on auctions, is initiated by the robot found in SR trying to find a more
suitable one. In the simulations, network lifetime and communication costs are
measured and used for comparison. We compare our algorithms with two similar
algorithms from the literature (k-SAAP and BFS) used for the task assignment.
RFTA2 and RFTA2GE feature up to 7 times longer network lifetime with
significant communication overhead reduction compared to k-SAAP and BFS. Among
our algorithms, RFTA2GE features the best robot energy utilization.
","[{'version': 'v1', 'created': 'Thu, 5 Aug 2021 11:38:03 GMT'}]",2021-09-17,"[['Stanulovic', 'Jelena', ''], ['Mitton', 'Nathalie', ''], ['Mezei', 'Ivan', '']]","['auctions', 'face routing', 'GFG routing', 'greedy routing', 'wireless sensor', 'robot networks']"
11717,1909.02425,Andr\'es Camero,"Andr\'es Camero, Jamal Toutouh, Enrique Alba","Random Error Sampling-based Recurrent Neural Network Architecture
  Optimization",,"Engineering Applications of Artificial Intelligence 96 (2020):
  103946",10.1016/j.engappai.2020.103946,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recurrent neural networks are good at solving prediction problems. However,
finding a network that suits a problem is quite hard because their performance
is strongly affected by their architecture configuration. Automatic
architecture optimization methods help to find the most suitable design, but
they are not extensively adopted because of their high computational cost. In
this work, we introduce the Random Error Sampling-based Neuroevolution (RESN),
an evolutionary algorithm that uses the mean absolute error random sampling, a
training-free approach to predict the expected performance of an artificial
neural network, to optimize the architecture of a network. We empirically
validate our proposal on three prediction problems, and compare our technique
to training-based architecture optimization techniques and to neuroevolutionary
approaches. Our findings show that we can achieve state-of-the-art error
performance and that we reduce by half the time needed to perform the
optimization.
","[{'version': 'v1', 'created': 'Wed, 4 Sep 2019 10:38:41 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Apr 2020 21:53:23 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Mar 2021 10:55:38 GMT'}]",2021-03-16,"[['Camero', 'Andrés', ''], ['Toutouh', 'Jamal', ''], ['Alba', 'Enrique', '']]","['neuroevolution', 'metaheuristics', 'recurrent neural network', 'evolutionary algorithm']"
11718,2206.13764,Yixin Su,"Yixin Su, Yunxiang Zhao, Sarah Erfani, Junhao Gan, Rui Zhang","Detecting Arbitrary Order Beneficial Feature Interactions for
  Recommender Systems","KDD 2022, 11 pages, 12 figures, 5 tables",,10.1145/3534678.3539238,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detecting beneficial feature interactions is essential in recommender
systems, and existing approaches achieve this by examining all the possible
feature interactions. However, the cost of examining all the possible
higher-order feature interactions is prohibitive (exponentially growing with
the order increasing). Hence existing approaches only detect limited order
(e.g., combinations of up to four features) beneficial feature interactions,
which may miss beneficial feature interactions with orders higher than the
limitation. In this paper, we propose a hypergraph neural network based model
named HIRS. HIRS is the first work that directly generates beneficial feature
interactions of arbitrary orders and makes recommendation predictions
accordingly. The number of generated feature interactions can be specified to
be much smaller than the number of all the possible interactions and hence, our
model admits a much lower running time. To achieve an effective algorithm, we
exploit three properties of beneficial feature interactions, and propose
deep-infomax-based methods to guide the interaction generation. Our
experimental results show that HIRS outperforms state-of-the-art algorithms by
up to 5% in terms of recommendation accuracy.
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2022 05:27:45 GMT'}]",2022-06-29,"[['Su', 'Yixin', ''], ['Zhao', 'Yunxiang', ''], ['Erfani', 'Sarah', ''], ['Gan', 'Junhao', ''], ['Zhang', 'Rui', '']]","['Recommender Systems', 'Feature Interactions', 'Graph Neural Networks', 'Mutual Information Maximization']"
11719,1803.10197,"Gabri\""el Konat","Gabri\""el Konat, Michael J. Steindorfer, Sebastian Erdweg, Eelco
  Visser (Delft University of Technology, Netherlands)","PIE: A Domain-Specific Language for Interactive Software Development
  Pipelines",,"The Art, Science, and Engineering of Programming, 2018, Vol. 2,
  Issue 3, Article 9",10.22152/programming-journal.org/2018/2/9,,cs.PL,http://creativecommons.org/licenses/by/4.0/,"  Context. Software development pipelines are used for automating essential
parts of software engineering processes, such as build automation and
continuous integration testing. In particular, interactive pipelines, which
process events in a live environment such as an IDE, require timely results for
low-latency feedback, and persistence to retain low-latency feedback between
restarts.
  Inquiry. Developing an incrementalized and persistent version of a pipeline
is one way to reduce feedback latency, but requires dependency tracking, cache
invalidation, and other complicated techniques. Therefore, interactivity
complicates pipeline development if timeliness and persistence become
responsibilities of the pipeline programmer, rather than being supported by the
underlying system.
  Approach. We develop Pipelines for Interactive Environments (PIE), a
Domain-Specific Language (DSL), API, and runtime for developing interactive
software development pipelines, where ease of development is a focus.
  Knowledge. PIE provides a straightforward programming model that enables
direct and concise expression of pipelines without boilerplate, reducing the
development and maintenance effort of pipelines. Compiled pipeline programs can
be embedded into interactive environments such as code editors and IDEs,
enabling timely feedback at a low cost.
  Grounding. Compared to the state of the art, PIE reduces the code required to
express an interactive pipeline by a factor of 6 in a case study on
syntax-aware editors. Furthermore, we evaluate PIE in two case studies of
complex interactive software development scenarios, demonstrating that PIE can
handle complex interactive pipelines in a straightforward and concise way.
","[{'version': 'v1', 'created': 'Tue, 27 Mar 2018 17:36:16 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Apr 2018 12:56:40 GMT'}]",2018-04-20,"[['Konat', 'Gabriël', '', 'Delft University of Technology, Netherlands'], ['Steindorfer', 'Michael J.', '', 'Delft University of Technology, Netherlands'], ['Erdweg', 'Sebastian', '', 'Delft University of Technology, Netherlands'], ['Visser', 'Eelco', '', 'Delft University of Technology, Netherlands']]","['domain-specific language', 'pipeline', 'interactive software development', 'incremental']"
11720,1712.03477,Xuan-Thuan Nguyen Dr,"Xuan-Thuan Nguyen, Duc-Hung Le, Trong-Tu Bui, Huu-Thuan Huynh, and
  Cong-Kha Pham",A Flexible High-Bandwidth Low-Latency Multi-Port Memory Controller,13 pages,"Vietnam Journal of Science and Technology, Vol. 56(3), 2018, pp.
  357-369",10.15625/2525-2518/56/3/11103,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-port memory controllers (MPMCs) have become increasingly important in
many modern applications due to the tremendous growth in bandwidth requirement.
Many approaches so far have focused on improving either the memory access
latency or the bandwidth utilization for specific applications. Moreover, the
application systems are likely to require certain adjustments to connect with
an MPMC, since the MPMC interface is limited to a single-clock and single
data-width domain. In this paper, we propose efficient techniques to improve
the flexibility, latency, and bandwidth of an MPMC. Firstly, MPMC interfaces
employ a pair of dual-clock dual-port FIFOs at each port, so any multi-clock
multi-data-width application system can connect to an MPMC without requiring
extra resources. Secondly, memory access latency is significantly reduced
because parallel FIFOs temporarily keep the data transfer between the
application system and memory. Lastly, a proposed arbitration scheme, namely
window-based first-come-first-serve, considerably enhances the bandwidth
utilization. Depending on the applications, MPMC can be properly configured by
updating several internal configuration registers. The experimental results in
an Altera Cyclone FPGA prove that MPMC is fully operational at 150 MHz and
supports up to 32 concurrent connections at various clocks and data widths.
More significantly, achieved bandwidth utilization is approximately 93.2% of
the theoretical bandwidth, and the access latency is minimized as compared to
previous designs.
","[{'version': 'v1', 'created': 'Sun, 10 Dec 2017 07:34:59 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Jun 2018 14:39:46 GMT'}]",2018-06-12,"[['Nguyen', 'Xuan-Thuan', ''], ['Le', 'Duc-Hung', ''], ['Bui', 'Trong-Tu', ''], ['Huynh', 'Huu-Thuan', ''], ['Pham', 'Cong-Kha', '']]","['multi-port memory controller', 'high bandwidth', 'low latency', 'FPGA', 'parallel', 'pipelining']"
11721,1912.13295,Godfred Koi-Akrofi,Godfred Yaw Koi-Akrofi,"IT Project Governance in Project Delivery: Key Processes, Activities,
  Roles and Responsibilities","2 Tables, 1 Figure, 12 Pages","Texila International Journal of Management. Volume 3, Issue 2, Nov
  2017",10.21522/TIJMG.2015.03.01.Art023,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  The general objective of this work was to contribute to the general body of
knowledge and research work in the area of managing IT projects successfully.
The office of Government commerce of the UK Government in conjunction with the
National Audit came out with a guideline in 2007 which list out eight causes of
project failures. Six out of the eight causes were attributed to governance
issues (Aon, 2011). This shows clearly that governance activities in project
management are really important, and failure to place premium on them can
result in failure of projects. The research work was therefore intended to come
out with IT governance frameworks that can help resolve the problem of failure
of IT projects resulting from governance issues. Four IT program managers and
eight IT project managers were talked to on a variety of IT project governance
issues. The frameworks were developed based on a combination of literature,
experts (IT project and program managers of the telecom industry in Ghana)
input, observation, and so on. The governance frameworks depicts project
management processes, project activities, project governance activities, roles
and responsibilities of key stakeholders, key milestones, approval bodies,
signatures, and so on, to ensure successful delivery of IT projects.
","[{'version': 'v1', 'created': 'Tue, 19 Nov 2019 14:26:12 GMT'}]",2020-01-01,"[['Koi-Akrofi', 'Godfred Yaw', '']]","['Governance', 'Project', 'Information', 'Technology', 'Framework', 'Process']"
11722,2005.08708,Istv\'an Koren,"Dominik Adam Kus, Istv\'an Koren, Ralf Klamma","A Link Generator for Increasing the Utility of OpenAPI-to-GraphQL
  Translations",WWW2020 Developer Track,,10.13140/RG.2.2.33982.92488,,cs.DC cs.DB cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Standardized interfaces are the connecting link of today's distributed
systems, facilitating access to data services in the cloud. REST APIs have been
prevalent over the last years, despite several issues like over- and
underfetching of resources. GraphQL enjoys rapid adoption, resolving these
problems by using statically typed queries. However, the redevelopment of
services to the new paradigm is costly. Therefore, several approaches for the
successive migration from REST to GraphQL have been proposed, many leveraging
OpenAPI service descriptions. In this article, we present the findings of our
empirical evaluation on the APIs.guru directory and identify several schema
translation challenges. These include less expressive schema types in GraphQL,
as well as missing meta information about related resources in OpenAPI. To this
end, we developed the open source Link Generator, that analyzes OpenAPI
documents and automatically adds links to increase translation utility. This
fundamentally benefits around 34% of APIs in the APIs.guru directory. Our
findings and tool support contribute to the ongoing discussion about the
migration of REST APIs to GraphQL, and provide developers with valuable
insights into common pitfalls, to reduce friction during API transformation.
","[{'version': 'v1', 'created': 'Mon, 18 May 2020 13:35:22 GMT'}]",2020-05-20,"[['Kus', 'Dominik Adam', ''], ['Koren', 'István', ''], ['Klamma', 'Ralf', '']]","['Web APIs', 'GraphQL', 'OpenAPI', 'REST']"
11723,2012.07548,Matej Hoffmann,"Karla Stepanova, Jakub Rozlivek, Frantisek Puciow, Pavel Krsek, Tomas
  Pajdla, and Matej Hoffmann","Automatic self-contained calibration of an industrial dual-arm robot
  with cameras using self-contact, planar constraints, and self-observation","25 pages, 29 figures","Robotics and Computer-Integrated Manufacturing 2022, Volume 73,
  102250",10.1016/j.rcim.2021.102250,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  We present a robot kinematic calibration method that combines complementary
calibration approaches: self-contact, planar constraints, and self-observation.
We analyze the estimation of the end effector parameters, joint offsets of the
manipulators, and calibration of the complete kinematic chain (DH parameters).
The results are compared with ground truth measurements provided by a laser
tracker. Our main findings are: (1) When applying the complementary calibration
approaches in isolation, the self-contact approach yields the best and most
stable results. (2) All combinations of more than one approach were always
superior to using any single approach in terms of calibration errors and the
observability of the estimated parameters. Combining more approaches delivers
robot parameters that better generalize to the workspace parts not used for the
calibration. (3) Sequential calibration, i.e. calibrating cameras first and
then robot kinematics, is more effective than simultaneous calibration of all
parameters. In real experiments, we employ two industrial manipulators mounted
on a common base. The manipulators are equipped with force/torque sensors at
their wrists, with two cameras attached to the robot base, and with special end
effectors with fiducial markers. We collect a new comprehensive dataset for
robot kinematic calibration and make it publicly available. The dataset and its
analysis provide quantitative and qualitative insights that go beyond the
specific manipulators used in this work and apply to self-contained robot
kinematic calibration in general.
","[{'version': 'v1', 'created': 'Mon, 14 Dec 2020 14:16:45 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Aug 2021 14:03:55 GMT'}, {'version': 'v3', 'created': 'Fri, 24 Sep 2021 13:52:20 GMT'}]",2021-09-27,"[['Stepanova', 'Karla', ''], ['Rozlivek', 'Jakub', ''], ['Puciow', 'Frantisek', ''], ['Krsek', 'Pavel', ''], ['Pajdla', 'Tomas', ''], ['Hoffmann', 'Matej', '']]","['automatic robot calibration', 'self-contained calibration', 'self-contact', 'self-observation', 'self-calibration', 'kinematiccalibration']"
11724,2008.02849,Julio Alves,"Dilson Lucas Pereira, J\'ulio C\'esar Alves, Mayron C\'esar de
  Oliveira Moreira","A Multiperiod Workforce Scheduling and Routing Problem with Dependent
  Tasks",,"Computers & Operations Research, Volume 118, 2020, 104930, ISSN
  0305-0548",10.1016/j.cor.2020.104930,,cs.AI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study a new Workforce Scheduling and Routing Problem,
denoted Multiperiod Workforce Scheduling and Routing Problem with Dependent
Tasks. In this problem, customers request services from a company. Each service
is composed of dependent tasks, which are executed by teams of varying skills
along one or more days. Tasks belonging to a service may be executed by
different teams, and customers may be visited more than once a day, as long as
precedences are not violated. The objective is to schedule and route teams so
that the makespan is minimized, i.e., all services are completed in the minimum
number of days. In order to solve this problem, we propose a Mixed-Integer
Programming model, a constructive algorithm and heuristic algorithms based on
the Ant Colony Optimization (ACO) metaheuristic. The presence of precedence
constraints makes it difficult to develop efficient local search algorithms.
This motivates the choice of the ACO metaheuristic, which is effective in
guiding the construction process towards good solutions. Computational results
show that the model is capable of consistently solving problems with up to
about 20 customers and 60 tasks. In most cases, the best performing ACO
algorithm was able to match the best solution provided by the model in a
fraction of its computational time.
","[{'version': 'v1', 'created': 'Thu, 6 Aug 2020 19:31:55 GMT'}]",2020-08-10,"[['Pereira', 'Dilson Lucas', ''], ['Alves', 'Júlio César', ''], ['Moreira', 'Mayron César de Oliveira', '']]","['Workforce Scheduling and Routing', 'Scheduling', 'Vehicle Routing']"
11725,2010.02580,Vitthal Khatik,"Vitthal Khatik, Shyam Sunder Nishad, Anupam Saxena","Comprehending finger flexor tendon pulley system using a computational
  analysis","13 pages, 16 figures. Submitted to Journal of Biomechanics",J Biomech Eng. Nov 2021,10.1115/1.4051528,BIO-20-1520,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing prosthetic/orthotic designs are rarely based on kinetostatics of a
biological finger, especially its tendon-pulley system (TPS) which helps render
a set of extraordinary functionalities. Studies on computational models or
cadaver experiments do exist. However, they provide little information on TPS
configurations that lead to lower tendon tension, bowstringing, and pulley
stresses, all of which a biological finger may be employing after all. A priori
knowledge of such configurations and associated trade-offs is helpful not only
from the design viewpoint of, say, an exoskeleton but also for surgical
reconstruction procedures. We present a parametric study to determine optimal
TPS configurations for the flexor mechanism. A compliant, flexure-based
computational model is developed and simulated using the pseudo rigid body
method, with various combinations of pulley/tendon attachment point locations,
pulley heights, and widths. Deductions are drawn from the data collected to
recommend the most suitable configuration. Many aspects of the biological TPS
configuration are explained through the presented analysis. We reckon that the
analytical approach herein will be useful in arriving at customized (optimized)
hand exoskeletal designs.
","[{'version': 'v1', 'created': 'Tue, 6 Oct 2020 09:44:16 GMT'}]",2022-02-25,"[['Khatik', 'Vitthal', ''], ['Nishad', 'Shyam Sunder', ''], ['Saxena', 'Anupam', '']]","['Tendon-pulley system', 'fnger biomechanical model', 'fnger fexion', 'bionic hand devices']"
11726,1806.04033,Johannes Haupt,"Johannes Haupt, Benedict Bender, Benjamin Fabian and Stefan Lessmann",Robust identification of email tracking: A machine learning approach,"Accepted publication, In press, European Journal of Operational
  Research, 2018",,10.1016/j.ejor.2018.05.018,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Email tracking allows email senders to collect fine-grained behavior and
location data on email recipients, who are uniquely identifiable via their
email address. Such tracking invades user privacy in that email tracking
techniques gather data without user consent or awareness. Striving to increase
privacy in email communication, this paper develops a detection engine to be
the core of a selective tracking blocking mechanism in the form of three
contributions. First, a large collection of email newsletters is analyzed to
show the wide usage of tracking over different countries, industries and time.
Second, we propose a set of features geared towards the identification of
tracking images under real-world conditions. Novel features are devised to be
computationally feasible and efficient, generalizable and resilient towards
changes in tracking infrastructure. Third, we test the predictive power of
these features in a benchmarking experiment using a selection of state-
of-the-art classifiers to clarify the effectiveness of model-based tracking
identification. We evaluate the expected accuracy of the approach on
out-of-sample data, over increasing periods of time, and when faced with
unknown senders.
","[{'version': 'v1', 'created': 'Mon, 11 Jun 2018 14:59:24 GMT'}]",2018-06-12,"[['Haupt', 'Johannes', ''], ['Bender', 'Benedict', ''], ['Fabian', 'Benjamin', ''], ['Lessmann', 'Stefan', '']]","['Analytics', 'Data Privacy', 'Email Tracking', 'Machine Learning']"
11727,2206.12994,Xiaochuan Fan,"Xiaochuan Fan, Chi Zhang, Yong Yang, Yue Shang, Xueying Zhang, Zhen
  He, Yun Xiao, Bo Long, Lingfei Wu",Automatic Generation of Product-Image Sequence in E-commerce,Accepted by KDD 2022 ADS,,10.1145/3534678.3539149,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Product images are essential for providing desirable user experience in an
e-commerce platform. For a platform with billions of products, it is extremely
time-costly and labor-expensive to manually pick and organize qualified images.
Furthermore, there are the numerous and complicated image rules that a product
image needs to comply in order to be generated/selected. To address these
challenges, in this paper, we present a new learning framework in order to
achieve Automatic Generation of Product-Image Sequence (AGPIS) in e-commerce.
To this end, we propose a Multi-modality Unified Image-sequence Classifier
(MUIsC), which is able to simultaneously detect all categories of rule
violations through learning. MUIsC leverages textual review feedback as the
additional training target and utilizes product textual description to provide
extra semantic information. Based on offline evaluations, we show that the
proposed MUIsC significantly outperforms various baselines. Besides MUIsC, we
also integrate some other important modules in the proposed framework, such as
primary image selection, noncompliant content detection, and image
deduplication. With all these modules, our framework works effectively and
efficiently in JD.com recommendation platform. By Dec 2021, our AGPIS framework
has generated high-standard images for about 1.5 million products and achieves
13.6% in reject rate.
","[{'version': 'v1', 'created': 'Sun, 26 Jun 2022 23:38:42 GMT'}]",2022-06-28,"[['Fan', 'Xiaochuan', ''], ['Zhang', 'Chi', ''], ['Yang', 'Yong', ''], ['Shang', 'Yue', ''], ['Zhang', 'Xueying', ''], ['He', 'Zhen', ''], ['Xiao', 'Yun', ''], ['Long', 'Bo', ''], ['Wu', 'Lingfei', '']]","['product image selection', 'image-sequence classifier', 'multi-modalityfusion', 'e-commerce']"
11728,1604.05503,Andrew Connor,"Jacqui Finlay, Russel Pears and Andy M. Connor","Data stream mining for predicting software build outcomes using source
  code metrics",,"Information & Software Technology, 56(2), 183-198 (2014)",10.1016/j.infsof.2013.09.001,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software development projects involve the use of a wide range of tools to
produce a software artifact. Software repositories such as source control
systems have become a focus for emergent research because they are a source of
rich information regarding software development projects. The mining of such
repositories is becoming increasingly common with a view to gaining a deeper
understanding of the development process.
","[{'version': 'v1', 'created': 'Tue, 19 Apr 2016 10:16:44 GMT'}]",2016-04-20,"[['Finlay', 'Jacqui', ''], ['Pears', 'Russel', ''], ['Connor', 'Andy M.', '']]","['Data Stream Mining', 'Concept Drift Detection', 'Hoeffding Tree', 'Jazz', 'Software Metrics', 'Software Repositories.   1']"
11729,2202.07467,Nelson Rodelas,"Ryan Francisco, Nelson Rodelas, and John Edison Ubaldo","The Perception of Filipinos on the Advent of Cryptocurrency and
  Non-Fungible Token (NFT) Games","presented in National Research Conference in Computer Engineering and
  Technology",,10.25147/ijcsr.2017.001.1.89,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  This study aims to shed light on the rise of play-to-earn games in the
Philippines alongside cryptocurrency. The lack of research and public
understanding of its benefits and drawbacks prompted the researchers to
investigate its market. As such, the study tried to look into the risks and
benefits of crypto gaming if it would be regulated by the government, and how
market volatility influences the churn rate of crypto games. The research used
a descriptive study to determine the perception of people who are engaged in
playing a crypto-game named as Axie Infinity. The results showed that most
players spend their time playing Axie Infinity for about 1 to 4 hours a day.
Predominantly, the return of investments for playing the game will take about 1
to 3 months. It also showed that these players agreed that there is a possible
financial instability in a volatile market. With this, they have a high trust
issue in terms of price manipulation, privacy and security, and its design and
usability. Understanding the cryptocurrency market requires comprehending the
perspective of the people who are engaged in a play-to-earn game, and their
concerns are critical for any government actions aimed at regulating
self-employed income earners playing (Non-fungible Tokens) NFT games in the
Philippines.
","[{'version': 'v1', 'created': 'Sun, 13 Feb 2022 05:15:05 GMT'}]",2022-02-16,"[['Francisco', 'Ryan', ''], ['Rodelas', 'Nelson', ''], ['Ubaldo', 'John Edison', '']]","['Crypto-gaming', 'Churn rate', 'Cryptocurrency', 'Online Gaming', 'Axie Infinity', 'Perception    INTRODUCTION']"
11730,2203.05048,Gunnar Kudrjavets,"Gunnar Kudrjavets (University of Groningen), Aditya Kumar (Snap,
  Inc.), Nachiappan Nagappan (Meta Platforms, Inc.), Ayushi Rastogi (University
  of Groningen)","Mining Code Review Data to Understand Waiting Times Between Acceptance
  and Merging: An Empirical Analysis","12 pages. To be published in Proceedings of MSR '22: Proceedings of
  the 19th International Conference on Mining Software Repositories (MSR 2022).
  ACM, New York, NY, USA",,10.1145/3524842.3528432,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Increasing code velocity (or the speed with which code changes are reviewed
and merged) is integral to speeding up development and contributes to the work
satisfaction of engineers. While factors affecting code change acceptance have
been investigated in the past, solutions to decrease the code review lifetime
are less understood. This study investigates the code review process to
quantify delays and investigate opportunities to potentially increase code
velocity. We study the temporal characteristics of half a million code reviews
hosted on Gerrit and Phabricator, starting from the first response, to a
decision to accept or reject the changes, and until the changes are merged into
a target branch. We identified two types of time delays: (a) the wait time from
the proposal of code changes until first response, and (b) the wait time
between acceptance and merging. Our study indicates that reducing the time
between acceptance and merging has the potential to speed up Phabricator code
reviews by 29-63%. Small code changes and changes made by authors with a large
number of previously accepted code reviews have a higher chance of being
immediately accepted, without code review iterations. Our analysis suggests
that switching from manual to automatic merges can help increase code velocity.
","[{'version': 'v1', 'created': 'Wed, 9 Mar 2022 21:11:20 GMT'}]",2022-12-01,"[['Kudrjavets', 'Gunnar', '', 'University of Groningen'], ['Kumar', 'Aditya', '', 'Snap,\n  Inc.'], ['Nagappan', 'Nachiappan', '', 'Meta Platforms, Inc.'], ['Rastogi', 'Ayushi', '', 'University\n  of Groningen']]","['Code review', 'code velocity', 'developer productivity', 'non-productivetime']"
11731,2008.07284,Eiji Uchibe,Eiji Uchibe and Kenji Doya,"Forward and inverse reinforcement learning sharing network weights and
  hyperparameters",Accepted for publication in the Neural Networks,"Neural Networks, December 2021, Pages 138-153",10.1016/j.neunet.2021.08.017,,cs.LG cs.AI cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes model-free imitation learning named Entropy-Regularized
Imitation Learning (ERIL) that minimizes the reverse Kullback-Leibler (KL)
divergence. ERIL combines forward and inverse reinforcement learning (RL) under
the framework of an entropy-regularized Markov decision process. An inverse RL
step computes the log-ratio between two distributions by evaluating two binary
discriminators. The first discriminator distinguishes the state generated by
the forward RL step from the expert's state. The second discriminator, which is
structured by the theory of entropy regularization, distinguishes the
state-action-next-state tuples generated by the learner from the expert ones.
One notable feature is that the second discriminator shares hyperparameters
with the forward RL, which can be used to control the discriminator's ability.
A forward RL step minimizes the reverse KL estimated by the inverse RL step. We
show that minimizing the reverse KL divergence is equivalent to finding an
optimal policy. Our experimental results on MuJoCo-simulated environments and
vision-based reaching tasks with a robotic arm show that ERIL is more
sample-efficient than the baseline methods. We apply the method to human
behaviors that perform a pole-balancing task and describe how the estimated
reward functions show how every subject achieves her goal.
","[{'version': 'v1', 'created': 'Mon, 17 Aug 2020 13:12:44 GMT'}, {'version': 'v2', 'created': 'Tue, 31 May 2022 11:07:58 GMT'}]",2022-06-01,"[['Uchibe', 'Eiji', ''], ['Doya', 'Kenji', '']]","['reinforcement learning', 'inverse reinforcement learning', 'imitationlearning', 'entropy regularization']"
11732,2208.11879,Lindon Roberts,"Lindon Roberts, Edward Smyth","A simplified convergence theory for Byzantine resilient stochastic
  gradient descent",,"EURO Journal on Computational Optimization, vol 10 (2022)",10.1016/j.ejco.2022.100038,,cs.LG math.OC,http://creativecommons.org/licenses/by/4.0/,"  In distributed learning, a central server trains a model according to updates
provided by nodes holding local data samples. In the presence of one or more
malicious servers sending incorrect information (a Byzantine adversary),
standard algorithms for model training such as stochastic gradient descent
(SGD) fail to converge. In this paper, we present a simplified convergence
theory for the generic Byzantine Resilient SGD method originally proposed by
Blanchard et al. [NeurIPS 2017]. Compared to the existing analysis, we shown
convergence to a stationary point in expectation under standard assumptions on
the (possibly nonconvex) objective function and flexible assumptions on the
stochastic gradients.
","[{'version': 'v1', 'created': 'Thu, 25 Aug 2022 05:37:14 GMT'}]",2022-08-26,"[['Roberts', 'Lindon', ''], ['Smyth', 'Edward', '']]","['stochastic optimization', 'distributed learning', 'Byzantine resilience']"
11733,2109.03039,Zeyang Liu,"Zeyang Liu, Ke Zhou, Jiaxin Mao, Max L. Wilson","POSSCORE: A Simple Yet Effective Evaluation of Conversational Search
  with Part of Speech Labelling",11 pages,,10.1145/3459637.3482463,,cs.IR cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Conversational search systems, such as Google Assistant and Microsoft
Cortana, provide a new search paradigm where users are allowed, via natural
language dialogues, to communicate with search systems. Evaluating such systems
is very challenging since search results are presented in the format of natural
language sentences. Given the unlimited number of possible responses,
collecting relevance assessments for all the possible responses is infeasible.
In this paper, we propose POSSCORE, a simple yet effective automatic evaluation
method for conversational search. The proposed embedding-based metric takes the
influence of part of speech (POS) of the terms in the response into account. To
the best knowledge, our work is the first to systematically demonstrate the
importance of incorporating syntactic information, such as POS labels, for
conversational search evaluation. Experimental results demonstrate that our
metrics can correlate with human preference, achieving significant improvements
over state-of-the-art baseline metrics.
","[{'version': 'v1', 'created': 'Tue, 7 Sep 2021 12:31:29 GMT'}]",2021-09-08,"[['Liu', 'Zeyang', ''], ['Zhou', 'Ke', ''], ['Mao', 'Jiaxin', ''], ['Wilson', 'Max L.', '']]","['Evaluation', 'Conversational search', 'Dialogue', 'Metric', 'Part of Speech']"
11734,2202.07463,Michael Saidani,"Michael Saidani (LGI), Harrison Kim, Nawres Ayadhi (LGI), Bernard
  Yannou (LGI)","Can Online Customer Reviews Help Design More Sustainable Products? A
  Preliminary Study on Amazon Climate Pledge Friendly Products","ASME 2021 International Design Engineering Technical Conferences and
  Computers and Information in Engineering Conference, Aug 2021, Virtual,
  United States",,10.1115/DETC2021-69705,,cs.CY cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online product reviews are a valuable resource for product developers to
improve the design of their products. Yet, the potential value of customer
feedback to improve the sustainability performance of products is still to be
exploited. The present paper investigates and analyzes Amazon product reviews
to bring new light on the following question: ``What sustainable design
insights can be identified or interpreted from online product reviews?''. To do
so, the top 100 reviews, evenly distributed by star ratings, for three product
categories (laptop, printer, cable) are collected, manually annotated, analyzed
and interpreted. For each product category, the reviews of two similar products
(one with environmental certification and one standard version) are compared
and combined to come up with sustainable design solutions. In all, for the six
products considered, between 12% and 20% of the reviews mentioned directly or
indirectly aspects or attributes that could be exploited to improve the design
of these products from a sustainability perspective. Concrete examples of
sustainable design leads that could be elicited from product reviews are given
and discussed. As such, this contribution provides a baseline for future work
willing to automate this process to gain further insights from online product
reviews. Notably, the deployment of machine learning tools and the use of
natural language processing techniques to do so are discussed as promising
lines for future research.
","[{'version': 'v1', 'created': 'Mon, 20 Dec 2021 08:57:37 GMT'}]",2022-02-16,"[['Saidani', 'Michael', '', 'LGI'], ['Kim', 'Harrison', '', 'LGI'], ['Ayadhi', 'Nawres', '', 'LGI'], ['Yannou', 'Bernard', '', 'LGI']]","['sustainable design', 'data-driven design', 'online']"
11735,2103.08525,Tobias Kauer,"Tobias Kauer, Arran Ridley, Marian D\""ork, Benjamin Bach","The Public Life of Data: Investigating Reactions to Visualizations on
  Reddit",,,10.1145/3411764.3445720,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  This research investigates how people engage with data visualizations when
commenting on the social platform Reddit. There has been considerable research
on collaborative sensemaking with visualizations and the personal relation of
people with data. Yet, little is known about how public audiences without
specific expertise and shared incentives openly express their thoughts,
feelings, and insights in response to data visualizations. Motivated by the
extensive social exchange around visualizations in online communities, this
research examines characteristics and motivations of people's reactions to
posts featuring visualizations. Following a Grounded Theory approach, we study
475 reactions from the /r/dataisbeautiful community, identify ten
distinguishable reaction types, and consider their contribution to the
discourse. A follow-up survey with 168 Reddit users clarified their intentions
to react. Our results help understand the role of personal perspectives on data
and inform future interfaces that integrate audience reactions into
visualizations to foster a public discourse about data.
","[{'version': 'v1', 'created': 'Mon, 15 Mar 2021 16:47:54 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Mar 2021 08:13:19 GMT'}]",2021-03-18,"[['Kauer', 'Tobias', ''], ['Ridley', 'Arran', ''], ['Dörk', 'Marian', ''], ['Bach', 'Benjamin', '']]","['data visualization', 'reddit', 'personal data']"
11736,2102.13391,Rajat Sharma,"Rajat Sharma, Tobias Schwandt, Christian Kunert, Steffen Urban and
  Wolfgang Broll","Point Cloud Upsampling and Normal Estimation using Deep Learning for
  Robust Surface Reconstruction",,"In Proceedings of the 16th International Joint Conference on
  Computer Vision, Imaging and Computer Graphics Theory and Applications
  (VISIGRAPP 2021) - Volume 5: VISAPP, pages 70-79",10.5220/0010211600700079,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The reconstruction of real-world surfaces is on high demand in various
applications. Most existing reconstruction approaches apply 3D scanners for
creating point clouds which are generally sparse and of low density. These
points clouds will be triangulated and used for visualization in combination
with surface normals estimated by geometrical approaches. However, the quality
of the reconstruction depends on the density of the point cloud and the
estimation of the surface normals. In this paper, we present a novel deep
learning architecture for point cloud upsampling that enables subsequent stable
and smooth surface reconstruction. A noisy point cloud of low density with
corresponding point normals is used to estimate a point cloud with higher
density and appendant point normals. To this end, we propose a compound loss
function that encourages the network to estimate points that lie on a surface
including normals accurately predicting the orientation of the surface. Our
results show the benefit of estimating normals together with point positions.
The resulting point cloud is smoother, more complete, and the final surface
reconstruction is much closer to ground truth.
","[{'version': 'v1', 'created': 'Fri, 26 Feb 2021 10:58:26 GMT'}]",2021-03-01,"[['Sharma', 'Rajat', ''], ['Schwandt', 'Tobias', ''], ['Kunert', 'Christian', ''], ['Urban', 'Steffen', ''], ['Broll', 'Wolfgang', '']]","['Point Cloud Upsampling', 'Surface Normal Estimation', 'Surface Reconstruction', 'Deep Learning']"
11737,1909.03306,Massimiliano Lupo Pasini Dr.,"Massimiliano Lupo Pasini, Junqi Yin, Ying Wai Li, Markus Eisenbach","A scalable constructive algorithm for the optimization of neural network
  architectures","12 pages, 15 figures, 3 table","Parallel Computing, 2021",10.1016/j.parco.2021.102788,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new scalable method to optimize the architecture of an
artificial neural network. The proposed algorithm, called Greedy Search for
Neural Network Architecture, aims to determine a neural network with minimal
number of layers that is at least as performant as neural networks of the same
structure identified by other hyperparameter search algorithms in terms of
accuracy and computational cost. Numerical results performed on benchmark
datasets show that, for these datasets, our method outperforms state-of-the-art
hyperparameter optimization algorithms in terms of attainable predictive
performance by the selected neural network architecture, and time-to-solution
for the hyperparameter optimization to complete.
","[{'version': 'v1', 'created': 'Sat, 7 Sep 2019 17:22:28 GMT'}, {'version': 'v2', 'created': 'Sat, 25 Jul 2020 17:26:10 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Apr 2021 14:13:57 GMT'}]",2021-04-30,"[['Pasini', 'Massimiliano Lupo', ''], ['Yin', 'Junqi', ''], ['Li', 'Ying Wai', ''], ['Eisenbach', 'Markus', '']]","['deep learning', 'hyperparameter optimization', 'neural network architecture', 'random search', 'greedy constructivealgorithms', 'adaptive algorithms']"
11738,2007.06711,Derek Prijatelj,"Derek S. Prijatelj (1), Mel McCurrie (2), Walter J. Scheirer (1) ((1)
  University of Notre Dame, Notre Dame, USA, (2) Perceptive Automata, Boston,
  USA)","A Bayesian Evaluation Framework for Subjectively Annotated Visual
  Recognition Tasks","21 pages. 6 figures. 2 tables. Supplementary Material as Appendix
  with 28 pages, 6 figures, 2 tables. First major revision for journal Pattern
  Recognition. Code to be included after publication at
  https://github.com/prijatelj/bayesian_eval_ground_truth-free",,10.1016/j.patcog.2021.108395,,cs.CV cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  An interesting development in automatic visual recognition has been the
emergence of tasks where it is not possible to assign objective labels to
images, yet still feasible to collect annotations that reflect human judgements
about them. Machine learning-based predictors for these tasks rely on
supervised training that models the behavior of the annotators, i.e., what
would the average person's judgement be for an image? A key open question for
this type of work, especially for applications where inconsistency with human
behavior can lead to ethical lapses, is how to evaluate the epistemic
uncertainty of trained predictors, i.e., the uncertainty that comes from the
predictor's model. We propose a Bayesian framework for evaluating black box
predictors in this regime, agnostic to the predictor's internal structure. The
framework specifies how to estimate the epistemic uncertainty that comes from
the predictor with respect to human labels by approximating a conditional
distribution and producing a credible interval for the predictions and their
measures of performance. The framework is successfully applied to four image
classification tasks that use subjective human judgements: facial beauty
assessment, social attribute assignment, apparent age estimation, and ambiguous
scene labeling.
","[{'version': 'v1', 'created': 'Sat, 20 Jun 2020 18:35:33 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Sep 2021 22:05:56 GMT'}]",2021-12-23,"[['Prijatelj', 'Derek S.', ''], ['McCurrie', 'Mel', ''], ['Scheirer', 'Walter J.', '']]","['uncertainty estimation', 'epistemic uncertainty', 'supervisedlearning', 'Bayesian inference', 'Bayesian modeling']"
11739,2111.13271,Fenareti Lampathaki,"Evmorfia Biliri, Minas Pertselakis, Marios Phinikettos, Marios
  Zacharias, Fenareti Lampathaki, Dimitrios Alexandrou",Designing a Trusted Data Brokerage Framework in the Aviation Domain,"9 pages, 2 figures",,10.1007/978-3-030-28464-0_21,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, there is growing interest in the ways the European aviation
industry can leverage the multi-source data fusion towards augmented domain
intelligence. However, privacy, legal and organisational policies together with
technical limitations, hinder data sharing and, thus, its benefits. The current
paper presents the ICARUS data policy and assets brokerage framework, which
aims to (a) formalise the data attributes and qualities that affect how
aviation data assets can be shared and handled subsequently to their
acquisition, including licenses, IPR, characterisation of sensitivity and
privacy risks, and (b) enable the creation of machine-processable data
contracts for the aviation industry. This involves expressing contractual terms
pertaining to data trading agreements into a machine-processable language and
supporting the diverse interactions among stakeholders in aviation data sharing
scenarios through a trusted and robust system based on the Ethereum platform.
","[{'version': 'v1', 'created': 'Thu, 25 Nov 2021 23:22:17 GMT'}]",2021-11-29,"[['Biliri', 'Evmorfia', ''], ['Pertselakis', 'Minas', ''], ['Phinikettos', 'Marios', ''], ['Zacharias', 'Marios', ''], ['Lampathaki', 'Fenareti', ''], ['Alexandrou', 'Dimitrios', '']]","['data brokerage', 'collaboration platform', 'aviation']"
11740,1912.12172,Ehsan Meamari,"Khadijeh Afhamisisi, Hadi Shahriar Shahhoseini, Ehsan Meamari","Defense against Lion Attack in Cognitive Radio Systems using the Markov
  Decision Process Approach",,"Frequenz, 2014",10.1515/freq-2013-0048,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cognitive Radio (CR) technology is a solution to solve the lack of spectrum
by allowing the secondary user to use licensed bands. There are several
potential security challenges for cognitive radio like Jamming, PUE and Lion
attack. Lion attack is multi layer attacks that has effected on two layers. The
Lion attack uses PUE or jamming attack in physical layer to disrupt TCP
protocol in transport layer. Since transport layer is unaware of physical layer
situation, when it occurs to an unacknowledged packet, there is no way to
distinguish between congestion and disconnection in the physical layer. So the
windows size of TCP would be decrease because of a wrong decision caused by
unawareness. To Mitigate the Lion attack the cross layer design is usually used
to freeze its windows size during frequency handoff. The main issue in this
solution is finding the best strategy for freezing. In this paper, we propose a
dynamic method for freezing and performing frequency handoff to counter Lion
attack. Also a learning model based on Markov decision process (MDP) is
applied. By using the proposed method, the secondary user can choose an optimal
strategy in both physical and transport layers to reduce the effect of Lion
attack.
","[{'version': 'v1', 'created': 'Fri, 20 Dec 2019 05:29:52 GMT'}]",2019-12-30,"[['Afhamisisi', 'Khadijeh', ''], ['Shahhoseini', 'Hadi Shahriar', ''], ['Meamari', 'Ehsan', '']]","['Cross layer', 'Secondary user', 'Malicious user', 'Security', 'Freeze', 'Handoff']"
11741,2103.06157,Sunil Kumar Kopparapu Dr,Ayush Tripathi and Swapnil Bhosale and Sunil Kumar Kopparapu,"Automatic Speaker Independent Dysarthric Speech Intelligibility
  Assessment System","29 pages, 2 figures, Computer Speech & Language 2021",,10.1016/j.csl.2021.101213,,cs.SD cs.AI eess.AS,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Dysarthria is a condition which hampers the ability of an individual to
control the muscles that play a major role in speech delivery. The loss of fine
control over muscles that assist the movement of lips, vocal chords, tongue and
diaphragm results in abnormal speech delivery. One can assess the severity
level of dysarthria by analyzing the intelligibility of speech spoken by an
individual. Continuous intelligibility assessment helps speech language
pathologists not only study the impact of medication but also allows them to
plan personalized therapy. It helps the clinicians immensely if the
intelligibility assessment system is reliable, automatic, simple for (a)
patients to undergo and (b) clinicians to interpret. Lack of availability of
dysarthric data has resulted in development of speaker dependent automatic
intelligibility assessment systems which requires patients to speak a large
number of utterances. In this paper, we propose (a) a cost minimization
procedure to select an optimal (small) number of utterances that need to be
spoken by the dysarthric patient, (b) four different speaker independent
intelligibility assessment systems which require the patient to speak a small
number of words, and (c) the assessment score is close to the perceptual score
that the Speech Language Pathologist (SLP) can relate to. The need for small
number of utterances to be spoken by the patient and the score being relatable
to the SLP benefits both the dysarthric patient and the clinician from
usability perspective.
","[{'version': 'v1', 'created': 'Wed, 10 Mar 2021 16:15:32 GMT'}]",2021-03-11,"[['Tripathi', 'Ayush', ''], ['Bhosale', 'Swapnil', ''], ['Kopparapu', 'Sunil Kumar', '']]","['Dysarthria', 'speech intelligibility', 'assessment', 'pathological', 'DeepSpeech']"
11742,1307.0110,Nicolas Robinson-Garcia,"Alvaro Cabezas-Clavijo, Nicol\'as Robinson-Garcia, Manuel Escabias and
  Evaristo Jim\'enez-Contreras","Reviewers' ratings and bibliometric indicators: hand in hand when
  assessing over research proposals?",,PLoS ONE 8(6): e68258,10.1371/journal.pone.0068258,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The peer review system has been traditionally challenged due to its many
limitations especially for allocating funding. Bibliometric indicators may well
present themselves as a complement. Objective: We analyze the relationship
between peers' ratings and bibliometric indicators for Spanish researchers in
the 2007 National R&D Plan for 23 research fields. We analyze peers' ratings
for 2333 applications. We also gathered principal investigators' research
output and impact and studied the differences between accepted and rejected
applications. We used the Web of Science database and focused on the 2002-2006
period. First, we analyzed the distribution of granted and rejected proposals
considering a given set of bibliometric indicators to test if there are
significant differences. Then, we applied a multiple logistic regression
analysis to determine if bibliometric indicators can explain by themselves the
concession of grant proposals. 63.4% of the applications were funded.
Bibliometric indicators for accepted proposals showed a better previous
performance than for those rejected; however the correlation between peer
review and bibliometric indicators is very heterogeneous among most areas. The
logistic regression analysis showed that the main bibliometric indicators that
explain the granting of research proposals in most cases are the output (number
of published articles) and the number of papers published in journals that
belong to the first quartile ranking of the Journal Citations Report.
Bibliometric indicators predict the concession of grant proposals at least as
well as peer ratings. Social Sciences and Education are the only areas where no
relation was found, although this may be due to the limitations of the Web of
Science's coverage. These findings encourage the use of bibliometric indicators
as a complement to peer review in most of the analyzed areas.
","[{'version': 'v1', 'created': 'Sat, 29 Jun 2013 14:38:12 GMT'}]",2013-07-02,"[['Cabezas-Clavijo', 'Alvaro', ''], ['Robinson-Garcia', 'Nicolás', ''], ['Escabias', 'Manuel', ''], ['Jiménez-Contreras', 'Evaristo', '']]","['Bibliometric indicators', 'peer review', 'Spain', 'grant proposals', 'research funding', 'research policy', 'evaluation agencies']"
11743,1906.12278,Jin Xu,Jin Xu and Natarajan Gautam,Peak Age of Information in Priority Queueing Systems,,"IEEE Transactions on Information Theory, vol. 67, no. 1, pp.
  373-390, Jan. 2021",10.1109/TIT.2020.3033501,,cs.IT math.IT math.OC math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a priority queueing system where a single processor serves k
classes of packets that are generated randomly following Poisson processes. Our
objective is to compute the expected Peak Age of Information (PAoI) under
various scenarios. In particular, we consider two situations where the buffer
size at each queue is one and infinite, and in the infinite buffer size case we
consider First Come First Serve (FCFS) and Last Come First Serve (LCFS) as
service disciplines. For the system with buffer size one at each queue, we
derive PAoI exactly for the case of exponential service time and bounds (which
are excellent approximations) for the case of general service time, with small
k. For the system with infinite buffer size, we provide closed-form expressions
of PAoI for both FCFS and LCFS where service time is general and k could be
large. Using those results we investigated the effect of ordering of priorities
and service disciplines for the various scenarios. We perform extensive
numerical studies to validate our results and develop insights.
","[{'version': 'v1', 'created': 'Fri, 28 Jun 2019 15:59:37 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Feb 2020 19:19:51 GMT'}, {'version': 'v3', 'created': 'Tue, 3 Nov 2020 02:38:54 GMT'}]",2021-01-01,"[['Xu', 'Jin', ''], ['Gautam', 'Natarajan', '']]","['Age of Information', 'Priority Queues', 'PerformanceAnalysis']"
11744,1711.10413,Gheorghe-Teodor Bercea PhD,"Gheorghe-Teodor Bercea, Carlo Bertolli, Arpith C. Jacob, Alexandre
  Eichenberger, Alexey Bataev, Georgios Rokos, Hyojin Sung, Tong Chen, Kevin
  O'Brien",Implementing implicit OpenMP data sharing on GPUs,,,10.1145/3148173.3148189,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  OpenMP is a shared memory programming model which supports the offloading of
target regions to accelerators such as NVIDIA GPUs. The implementation in
Clang/LLVM aims to deliver a generic GPU compilation toolchain that supports
both the native CUDA C/C++ and the OpenMP device offloading models. There are
situations where the semantics of OpenMP and those of CUDA diverge. One such
example is the policy for implicitly handling local variables. In CUDA, local
variables are implicitly mapped to thread local memory and thus become private
to a CUDA thread. In OpenMP, due to semantics that allow the nesting of regions
executed by different numbers of threads, variables need to be implicitly
\emph{shared} among the threads of a contention group. In this paper we
introduce a re-design of the OpenMP device data sharing infrastructure that is
responsible for the implicit sharing of local variables in the Clang/LLVM
toolchain. We introduce a new data sharing infrastructure that lowers
implicitly shared variables to the shared memory of the GPU. We measure the
amount of shared memory used by our scheme in cases that involve scalar
variables and statically allocated arrays. The evaluation is carried out by
offloading to K40 and P100 NVIDIA GPUs. For scalar variables the pressure on
shared memory is relatively low, under 26\% of shared memory utilization for
the K40, and does not negatively impact occupancy. The limiting occupancy
factor in that case is register pressure. The data sharing scheme offers the
users a simple memory model for controlling the implicit allocation of device
shared memory.
","[{'version': 'v1', 'created': 'Tue, 28 Nov 2017 17:15:28 GMT'}]",2017-11-29,"[['Bercea', 'Gheorghe-Teodor', ''], ['Bertolli', 'Carlo', ''], ['Jacob', 'Arpith C.', ''], ['Eichenberger', 'Alexandre', ''], ['Bataev', 'Alexey', ''], ['Rokos', 'Georgios', ''], ['Sung', 'Hyojin', ''], ['Chen', 'Tong', ''], [""O'Brien"", 'Kevin', '']]","['OpenMP', 'Clang', 'shared memory', 'data sharing']"
11745,2211.08426,Xevi Roca,"Eloi Ruiz-Giron\'es, Xevi Roca","Automatic penalty and degree continuation for parallel pre-conditioned
  mesh curving on virtual geometry",,"Computer-Aided Design, 146 (2022)",10.1016/j.cad.2022.103208,,cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We present a distributed parallel mesh curving method for virtual geometry.
The main application is to generate large-scale curved meshes on complex
geometry suitable for analysis with unstructured high-order methods.
Accordingly, we devise the technique to generate geometrically accurate meshes
composed of high-quality elements. To this end, we advocate for degree
continuation on a penalty-based second-order optimizer that uses global tight
tolerances to converge the distortion residuals. To reduce the method memory
footprint, waiting time, and energy consumption, we combine three main
ingredients. First, we propose a matrix-free GMRES solver pre-conditioned with
successive over-relaxation by blocks to reduce the memory footprint three
times. We also propose an adaptive penalty technique, to reduce the number of
non-linear iterations. Third, we propose an indicator of the required linear
solver tolerance to reduce the number of linear iterations. On thousands of
cores, the method curves meshes composed of millions of quartic elements
featuring highly stretched elements while matching a virtual topology.
","[{'version': 'v1', 'created': 'Mon, 14 Nov 2022 10:13:13 GMT'}]",2022-11-17,"[['Ruiz-Gironés', 'Eloi', ''], ['Roca', 'Xevi', '']]","['High-order mesh curving', 'distributed parallel', 'pre-conditioner', 'p-continuation']"
11746,cs/0309043,Valmir Barbosa,"A. H. L. Porto, V. C. Barbosa",Finding approximate palindromes in strings,,"Pattern Recognition 35 (2002), 2581-2591",10.1016/S0031-3203(01)00179-0,,cs.DS,,"  We introduce a novel definition of approximate palindromes in strings, and
provide an algorithm to find all maximal approximate palindromes in a string
with up to $k$ errors. Our definition is based on the usual edit operations of
approximate pattern matching, and the algorithm we give, for a string of size
$n$ on a fixed alphabet, runs in $O(k^2 n)$ time. We also discuss two
implementation-related improvements to the algorithm, and demonstrate their
efficacy in practice by means of both experiments and an average-case analysis.
","[{'version': 'v1', 'created': 'Tue, 23 Sep 2003 13:45:48 GMT'}]",2007-05-23,"[['Porto', 'A. H. L.', ''], ['Barbosa', 'V. C.', '']]","['Approximate palindromes', 'string editing', 'approximate pattern matching']"
11747,1906.09324,Jie Wang,"Ziwen Wang, Jie Wang, Haiqian Gu, Fei Su and Bojin Zhuang","Automatic Conditional Generation of Personalized Social Media Short
  Texts",published in PRICAI 2018,"In: Geng X., Kang BH. (eds) PRICAI 2018: Trends in Artificial
  Intelligence",10.1007/978-3-319-97310-4_7,,cs.CL cs.AI cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic text generation has received much attention owing to rapid
development of deep neural networks. In general, text generation systems based
on statistical language model will not consider anthropomorphic
characteristics, which results in machine-like generated texts. To fill the
gap, we propose a conditional language generation model with Big Five
Personality (BFP) feature vectors as input context, which writes human-like
short texts. The short text generator consists of a layer of long short memory
network (LSTM), where a BFP feature vector is concatenated as one part of input
for each cell. To enable supervised training generation model, a text
classification model based convolution neural network (CNN) has been used to
prepare BFP-tagged Chinese micro-blog corpora. Validated by a BFP linguistic
computational model, our generated Chinese short texts exhibit discriminative
personality styles, which are also syntactically correct and semantically
smooth with appropriate emoticons. With combination of natural language
generation with psychological linguistics, our proposed BFP-dependent text
generation model can be widely used for individualization in machine
translation, image caption, dialogue generation and so on.
","[{'version': 'v1', 'created': 'Sat, 15 Jun 2019 09:20:41 GMT'}]",2019-06-25,"[['Wang', 'Ziwen', ''], ['Wang', 'Jie', ''], ['Gu', 'Haiqian', ''], ['Su', 'Fei', ''], ['Zhuang', 'Bojin', '']]","['Natural Language Generation', 'Deep Neural Network', 'Recurrent Neural Network', 'Convolution Neural Network', 'Big Five Personality']"
11748,1910.07203,Margaux Nattaf,"Arnaud Malapert, Margaux Nattaf (G-SCOP)","A new CP-approach for a parallel machine scheduling problem with time
  constraints on machine qualifications",,"Integration of Constraint Programming, Artificial Intelligence,
  and Operations Research, pp.426-442, 2019",10.1007/978-3-030-19212-9_28,,cs.DC cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the scheduling of job families on parallel machines with
time constraints on machine qualifications. In this problem, each job belongs
to a family and a family can only be executed on a subset of qualified
machines. In addition, machines can lose their qualifications during the
schedule. Indeed, if no job of a family is scheduled on a machine during a
given amount of time, the machine loses its qualification for this family. The
goal is to minimize the sum of job completion times, i.e. the flow time, while
maximizing the number of qualifications at the end of the schedule. The paper
presents a new Constraint Programming (CP) model taking more advantages of the
CP feature to model machine disqualifications. This model is compared with two
existing models: an Integer Linear Programming (ILP) model and a Constraint
Programming model. The experiments show that the new CP model outperforms the
other model when the priority is given to the number of disqualifications
objective. Furthermore, it is competitive with the other model when the flow
time objective is prioritized.
","[{'version': 'v1', 'created': 'Wed, 16 Oct 2019 08:03:30 GMT'}]",2019-10-17,"[['Malapert', 'Arnaud', '', 'G-SCOP'], ['Nattaf', 'Margaux', '', 'G-SCOP']]","['Parallel Machine Scheduling', 'Time Constraint', 'MachineQualifications', 'Integer Linear Programming', 'Constraint Programming']"
11749,1707.00015,Ravi Chugh,"Brian Hempel, Justin Lubin, Grace Lu, and Ravi Chugh",Deuce: A Lightweight User Interface for Structured Editing,ICSE 2018 Paper + Supplementary Appendices,,10.1145/3180155.3180165,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a structure-aware code editor, called Deuce, that is equipped with
direct manipulation capabilities for invoking automated program
transformations. Compared to traditional refactoring environments, Deuce
employs a direct manipulation interface that is tightly integrated within a
text-based editing workflow. In particular, Deuce draws (i) clickable widgets
atop the source code that allow the user to structurally select the
unstructured text for subexpressions and other relevant features, and (ii) a
lightweight, interactive menu of potential transformations based on the current
selections. We implement and evaluate our design with mostly standard
transformations in the context of a small functional programming language. A
controlled user study with 21 participants demonstrates that structural
selection is preferred to a more traditional text-selection interface and may
be faster overall once users gain experience with the tool. These results
accord with Deuce's aim to provide human-friendly structural interactions on
top of familiar text-based editing.
","[{'version': 'v1', 'created': 'Fri, 30 Jun 2017 18:22:13 GMT'}, {'version': 'v2', 'created': 'Mon, 5 Feb 2018 16:40:11 GMT'}]",2018-02-06,"[['Hempel', 'Brian', ''], ['Lubin', 'Justin', ''], ['Lu', 'Grace', ''], ['Chugh', 'Ravi', '']]","['Structured Editing', 'Refactoring', 'Direct Manipulation']"
11750,2111.10411,Ben Greenman,"Ben Greenman (Brown University, USA), Lukas Lazarek (Northwestern
  University, USA), Christos Dimoulas (Northwestern University, USA), Matthias
  Felleisen (Northeastern University, USA)",A Transient Semantics for Typed Racket,,"The Art, Science, and Engineering of Programming, 2022, Vol. 6,
  Issue 2, Article 9",10.22152/programming-journal.org/2022/6/9,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mixed-typed languages enable programmers to link typed and untyped components
in various ways. Some offer rich type systems to facilitate the smooth
migration of untyped code to the typed world; others merely provide a
convenient form of type Dynamic together with a conventional structural type
system. Orthogonal to this dimension, Natural systems ensure the integrity of
types with a sophisticated contract system, while Transient systems insert
simple first-order checks at strategic places within typed code. Furthermore,
each method of ensuring type integrity comes with its own blame-assignment
strategy.
  Typed Racket has a rich migratory type system and enforces the types with a
Natural semantics. Reticulated Python has a simple structural type system
extended with Dynamic and enforces types with a Transient semantics. While
Typed Racket satisfies the most stringent gradual-type soundness properties at
a significant performance cost, Reticulated Python seems to limit the
performance penalty to a tolerable degree and is nevertheless type sound. This
comparison raises the question of whether Transient checking is applicable to
and beneficial for a rich migratory type system.
  This paper reports on the surprising difficulties of adapting the Transient
semantics of Reticulated Python to the rich migratory type system of Typed
Racket. The resulting implementation, Shallow Typed Racket, is faster than the
standard Deep Typed Racket but only when the Transient blame assignment
strategy is disabled. For language designers, this report provides valuable
hints on how to equip an existing compiler to support a Transient semantics.
For theoreticians, the negative experience with Transient blame calls for a
thorough investigation of this strategy.
","[{'version': 'v1', 'created': 'Fri, 19 Nov 2021 19:48:58 GMT'}]",2021-11-23,"[['Greenman', 'Ben', '', 'Brown University, USA'], ['Lazarek', 'Lukas', '', 'Northwestern\n  University, USA'], ['Dimoulas', 'Christos', '', 'Northwestern University, USA'], ['Felleisen', 'Matthias', '', 'Northeastern University, USA']]","['migratory typing', 'gradual typing', 'transient semantics', 'compilers']"
11751,2107.10070,Satwik Prabhu Kumble,"Satwik Prabhu Kumble, Dick Epema and Stefanie Roos",How Lightning's Routing Diminishes its Anonymity,"10 pages, 4 figures, 1 table, The 16th International Conference on
  Availability, Reliability and Security (ARES 2021), August 17--20, 2021,
  Vienna, Austria",,10.1145/3465481.3465761,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The system shows the error of ""Bad character(s) in field Abstract"" for no
reason. Please refer to manuscript for the full abstract
","[{'version': 'v1', 'created': 'Wed, 21 Jul 2021 13:26:01 GMT'}]",2021-07-22,"[['Kumble', 'Satwik Prabhu', ''], ['Epema', 'Dick', ''], ['Roos', 'Stefanie', '']]","['Payment Channel Networks', 'Lightning', 'Routing', 'Anonymity']"
11752,2003.03585,Pengli Lu,Pengli Lu and Chen Dong,"EMH: Extended Mixing H-index centrality for identification important
  users in social networks based on neighborhood diversity",,,10.1142/S021798492050284X,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rapid expansion of social network provides a suitable platform for users
to deliver messages. Through the social network, we can harvest resources and
share messages in a very short time. The developing of social network has
brought us tremendous conveniences. However, nodes that make up the network
have different spreading capability, which are constrained by many factors, and
the topological structure of network is the principal element. In order to
calculate the importance of nodes in network more accurately, this paper
defines the improved H-index centrality (IH) according to the diversity of
neighboring nodes, then uses the cumulative centrality (MC) to take all
neighboring nodes into consideration, and proposes the extended mixing H-index
centrality (EMH). We evaluate the proposed method by
Susceptible-Infected-Recovered (SIR) model and monotonicity which are used to
assess accuracy and resolution of the method, respectively. Experimental
results indicate that the proposed method is superior to the existing measures
of identifying nodes in different networks.
","[{'version': 'v1', 'created': 'Sat, 7 Mar 2020 15:00:24 GMT'}]",2020-10-28,"[['Lu', 'Pengli', ''], ['Dong', 'Chen', '']]","['Topological structure', 'Neighbor-diversity', 'Cumulative centrality', 'Extendedmixing H-index centrality (EMH)', 'Susceptible-Infected-Recovered (SIR) model']"
11753,1811.05321,Alexander Gorban,"A.N. Gorban, A. Golubkov, B. Grechuk, E.M. Mirkes, I.Y. Tyukin","Correction of AI systems by linear discriminants: Probabilistic
  foundations","arXiv admin note: text overlap with arXiv:1809.07656 and
  arXiv:1802.02172","Information Sciences 466 (2018), 303-322",10.1016/j.ins.2018.07.040,,cs.LG cs.AI stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Artificial Intelligence (AI) systems sometimes make errors and will make
errors in the future, from time to time. These errors are usually unexpected,
and can lead to dramatic consequences. Intensive development of AI and its
practical applications makes the problem of errors more important. Total
re-engineering of the systems can create new errors and is not always possible
due to the resources involved. The important challenge is to develop fast
methods to correct errors without damaging existing skills. We formulated the
technical requirements to the 'ideal' correctors. Such correctors include
binary classifiers, which separate the situations with high risk of errors from
the situations where the AI systems work properly. Surprisingly, for
essentially high-dimensional data such methods are possible: simple linear
Fisher discriminant can separate the situations with errors from correctly
solved tasks even for exponentially large samples. The paper presents the
probabilistic basis for fast non-destructive correction of AI systems. A series
of new stochastic separation theorems is proven. These theorems provide new
instruments for fast non-iterative correction of errors of legacy AI systems.
The new approaches become efficient in high-dimensions, for correction of
high-dimensional systems in high-dimensional world (i.e. for processing of
essentially high-dimensional data by large systems).
","[{'version': 'v1', 'created': 'Sun, 11 Nov 2018 13:11:13 GMT'}]",2019-03-01,"[['Gorban', 'A. N.', ''], ['Golubkov', 'A.', ''], ['Grechuk', 'B.', ''], ['Mirkes', 'E. M.', ''], ['Tyukin', 'I. Y.', '']]","['big data', 'non-iterative learning', 'error correction', 'measure concentration', 'blessing of dimensionality', 'linear discriminant']"
11754,2104.09565,Igor Sfiligoi,"Igor Sfiligoi, Daniel McDonald and Rob Knight","Accelerating key bioinformatics tasks 100-fold by improving memory
  access","6 pages, 3 tables, 7 algorithms, To be published in Proceedings of
  PEARC21",,10.1145/3437359.3465562,,cs.DC q-bio.GN,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Most experimental sciences now rely on computing, and biological sciences are
no exception. As datasets get bigger, so do the computing costs, making proper
optimization of the codes used by scientists increasingly important. Many of
the codes developed in recent years are based on the Python-based NumPy, due to
its ease of use and good performance characteristics. The composable nature of
NumPy, however, does not generally play well with the multi-tier nature of
modern CPUs, making any non-trivial multi-step algorithm limited by the
external memory access speeds, which are hundreds of times slower than the
CPU's compute capabilities. In order to fully utilize the CPU compute
capabilities, one must keep the working memory footprint small enough to fit in
the CPU caches, which requires splitting the problem into smaller portions and
fusing together as many steps as possible. In this paper, we present changes
based on these principles to two important functions in the scikit-bio library,
principal coordinates analysis and the Mantel test, that resulted in over 100x
speed improvement in these widely used, general-purpose tools.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2021 18:52:23 GMT'}]",2021-07-21,"[['Sfiligoi', 'Igor', ''], ['McDonald', 'Daniel', ''], ['Knight', 'Rob', '']]","['Optimization', 'Cache awareness', 'Computational biology', 'scikitbio']"
11755,2104.09237,Nathan Sandholtz,"Nathan Sandholtz, Yohsuke Miyamoto, Luke Bornn, Maurice Smith","Inverse Bayesian Optimization: Learning Human Acquisition Functions in
  an Exploration vs Exploitation Search Task","24 pages, 10 figures, 5 appendices",,10.1214/21-BA1303,,cs.HC cs.LG math.OC stat.AP stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a probabilistic framework to estimate parameters of an
acquisition function given observed human behavior that can be modeled as a
collection of sample paths from a Bayesian optimization procedure. The
methodology involves defining a likelihood on observed human behavior from an
optimization task, where the likelihood is parameterized by a Bayesian
optimization subroutine governed by an unknown acquisition function. This
structure enables us to make inference on a subject's acquisition function
while allowing their behavior to deviate around the solution to the Bayesian
optimization subroutine. To test our methods, we designed a sequential
optimization task which forced subjects to balance exploration and exploitation
in search of an invisible target location. Applying our proposed methods to the
resulting data, we find that many subjects tend to exhibit exploration
preferences beyond that of standard acquisition functions to capture. Guided by
the model discrepancies, we augment the candidate acquisition functions to
yield a superior fit to the human behavior in this task.
","[{'version': 'v1', 'created': 'Fri, 16 Apr 2021 15:40:34 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Feb 2022 21:52:09 GMT'}]",2022-02-04,"[['Sandholtz', 'Nathan', ''], ['Miyamoto', 'Yohsuke', ''], ['Bornn', 'Luke', ''], ['Smith', 'Maurice', '']]","['Bayesian optimization', 'directional statistics', 'exploration vs.exploitation', 'human cognition', 'inverse optimization', 'lab experiment', 'probabilistic models']"
11756,2207.12903,Alan Smeaton,Hyowon Lee and Mingming Liu and Michael Scriney and Alan F. Smeaton,"Playback-centric visualisations of video usage using weighted
  interactions to guide where to watch in an educational context",,Front. Educ. 7:733646 (2022),10.3389/feduc.2022.733646,,cs.MM cs.HC,http://creativecommons.org/licenses/by/4.0/,"  The increase in use of online educational tools has led to a large amount of
educational video materials made available for students. Finding the right
video content is usually supported by the overarching learning management
system and its interface that organises video items by course, categories and
weeks, and makes them searchable. However, once a video is found, students are
left without further guidance as to what parts in that video they should focus
on. In this article, an additional timeline visualisation to augment the
conventional playback timeline is introduced which employs a novel playback
weighting strategy in which the history of different video interactions
generate scores based on the context of each playback. The resultant scores are
presented on the additional timeline, making it in effect a playback-centric
usage graph nuanced by how each playback was executed. Students can selectively
watch those portions which the contour of the usage visualisation suggests. The
visualisation was implemented and deployed in an undergraduate course at a
university for two full semesters. 270 students used the system throughout both
semesters watching 52 videos, guided by visualisations on what to watch.
Analysis of playback logs revealed students selectively watched corresponding
to the most important portions of the videos as assessed by the instructor who
created the videos. The characteristics of this as a way of guiding students as
to where to watch as well as a complementary tool for playback analysis, are
discussed. Further insights into the potential values of this visualisation and
its underlying playback weighting strategy are also discussed.
","[{'version': 'v1', 'created': 'Tue, 26 Jul 2022 13:53:15 GMT'}]",2022-07-27,"[['Lee', 'Hyowon', ''], ['Liu', 'Mingming', ''], ['Scriney', 'Michael', ''], ['Smeaton', 'Alan F.', '']]","['learning analytics', 'online learning', 'educational video', 'interaction logging', 'system deployment']"
11757,2105.02098,Giulia Perugia Dr.,"Giulia Perugia, Maike Paetzel-Pr\""ussman, Isabelle Hupont, Giovanna
  Varni, Mohamed Chetouani, Christopher Edward Peters, and Ginevra Castellano","Does the Goal Matter? Emotion Recognition Tasks Can Change the Social
  Value of Facial Mimicry towards Artificial Agents","27 pages, 8 figures, 7 tables (Submitted to Frontiers in Robotics and
  AI, Human-Robot Interaction)","Frontiers in Robotics and AI, 8, 362 (2021)",10.3389/frobt.2021.699090,,cs.HC cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a study aimed at understanding whether the
embodiment and humanlikeness of an artificial agent can affect people's
spontaneous and instructed mimicry of its facial expressions. The study
followed a mixed experimental design and revolved around an emotion recognition
task. Participants were randomly assigned to one level of humanlikeness
(between-subject variable: humanlike, characterlike, or morph facial texture of
the artificial agents) and observed the facial expressions displayed by a human
(control) and three artificial agents differing in embodiment (within-subject
variable: video-recorded robot, physical robot, and virtual agent). To study
both spontaneous and instructed facial mimicry, we divided the experimental
sessions into two phases. In the first phase, we asked participants to observe
and recognize the emotions displayed by the agents. In the second phase, we
asked them to look at the agents' facial expressions, replicate their dynamics
as closely as possible, and then identify the observed emotions. In both cases,
we assessed participants' facial expressions with an automated Action Unit (AU)
intensity detector. Contrary to our hypotheses, our results disclose that the
agent that was perceived as the least uncanny, and most anthropomorphic,
likable, and co-present, was the one spontaneously mimicked the least.
Moreover, they show that instructed facial mimicry negatively predicts
spontaneous facial mimicry. Further exploratory analyses revealed that
spontaneous facial mimicry appeared when participants were less certain of the
emotion they recognized. Hence, we postulate that an emotion recognition goal
can flip the social value of facial mimicry as it transforms a likable
artificial agent into a distractor.
","[{'version': 'v1', 'created': 'Wed, 5 May 2021 14:58:04 GMT'}]",2021-12-17,"[['Perugia', 'Giulia', ''], ['Paetzel-Prüssman', 'Maike', ''], ['Hupont', 'Isabelle', ''], ['Varni', 'Giovanna', ''], ['Chetouani', 'Mohamed', ''], ['Peters', 'Christopher Edward', ''], ['Castellano', 'Ginevra', '']]","['Human-Robot Interaction', 'Human-Agent Interaction', 'Affective Computing', 'Facial Mimicry', 'Anthropomorphism', 'Uncanny Valley', 'Facial Action Coding System']"
11758,2207.08145,Sandipan Choudhuri,"Sandipan Choudhuri, Hemanth Venkateswara, Arunabha Sen","Coupling Adversarial Learning with Selective Voting Strategy for
  Distribution Alignment in Partial Domain Adaptation",,"Journal of Computational and Cognitive Engineering. Volume 1,
  Issue 4, 2022",10.47852/bonviewJCCE2202324,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  In contrast to a standard closed-set domain adaptation task, partial domain
adaptation setup caters to a realistic scenario by relaxing the identical label
set assumption. The fact of source label set subsuming the target label set,
however, introduces few additional obstacles as training on private source
category samples thwart relevant knowledge transfer and mislead the
classification process. To mitigate these issues, we devise a mechanism for
strategic selection of highly-confident target samples essential for the
estimation of class-importance weights. Furthermore, we capture
class-discriminative and domain-invariant features by coupling the process of
achieving compact and distinct class distributions with an adversarial
objective. Experimental findings over numerous cross-domain classification
tasks demonstrate the potential of the proposed technique to deliver superior
and comparable accuracy over existing methods.
","[{'version': 'v1', 'created': 'Sun, 17 Jul 2022 11:34:56 GMT'}]",2022-12-12,"[['Choudhuri', 'Sandipan', ''], ['Venkateswara', 'Hemanth', ''], ['Sen', 'Arunabha', '']]","['Partial Domain Adaptation', 'Domain Adaptation', 'Adversarial Learning', 'Class-Distribution Alignment']"
11759,2003.02491,Jiri Matyas,"Milan Ceska, Jiri Matyas, Vojtech Mrazek, Lukas Sekanina, Zdenek
  Vasicek, Tomas Vojnar","Adaptive Verifiability-Driven Strategy for Evolutionary Approximation of
  Arithmetic Circuits",,"Applied Soft Computing, Volume 95, October 2020, 106466",10.1016/j.asoc.2020.106466,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a novel approach for designing complex approximate arithmetic
circuits that trade correctness for power consumption and play important role
in many energy-aware applications. Our approach integrates in a unique way
formal methods providing formal guarantees on the approximation error into an
evolutionary circuit optimisation algorithm. The key idea is to employ a novel
adaptive search strategy that drives the evolution towards promptly verifiable
approximate circuits. As demonstrated in an extensive experimental evaluation
including several structurally different arithmetic circuits and target
precisions, the search strategy provides superior scalability and versatility
with respect to various approximation scenarios. Our approach significantly
improves capabilities of the existing methods and paves a way towards an
automated design process of provably-correct circuit approximations.
","[{'version': 'v1', 'created': 'Thu, 5 Mar 2020 09:11:45 GMT'}]",2020-07-03,"[['Ceska', 'Milan', ''], ['Matyas', 'Jiri', ''], ['Mrazek', 'Vojtech', ''], ['Sekanina', 'Lukas', ''], ['Vasicek', 'Zdenek', ''], ['Vojnar', 'Tomas', '']]","['Approximate computing', 'energy efficiency', 'circuit optimization', 'genetic programming']"
11760,2110.13957,Nan Wang,"Nan Wang, Lu Lin, Jundong Li, Hongning Wang",Unbiased Graph Embedding with Biased Graph Observations,"Keywords: unbiased graph embedding, fairness, sensitive attributes,
  bias-free graph, node representation In Proceedings of the ACM Web Conference
  2022 (WWW'22), April 25-29, 2022, Virtual Event, Lyon, France. ACM, New York,
  NY, USA, 11 pages. https://doi.org/10.1145/3485447.3512189",,10.1145/3485447.3512189,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph embedding techniques are pivotal in real-world machine learning tasks
that operate on graph-structured data, such as social recommendation and
protein structure modeling. Embeddings are mostly performed on the node level
for learning representations of each node. Since the formation of a graph is
inevitably affected by certain sensitive node attributes, the node embeddings
can inherit such sensitive information and introduce undesirable biases in
downstream tasks. Most existing works impose ad-hoc constraints on the node
embeddings to restrict their distributions for unbiasedness/fairness, which
however compromise the utility of the resulting embeddings. In this paper, we
propose a principled new way for unbiased graph embedding by learning node
embeddings from an underlying bias-free graph, which is not influenced by
sensitive node attributes. Motivated by this new perspective, we propose two
complementary methods for uncovering such an underlying graph, with the goal of
introducing minimum impact on the utility of the embeddings. Both our
theoretical justification and extensive experimental comparisons against
state-of-the-art solutions demonstrate the effectiveness of our proposed
methods.
","[{'version': 'v1', 'created': 'Tue, 26 Oct 2021 18:44:37 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Oct 2021 15:05:04 GMT'}, {'version': 'v3', 'created': 'Mon, 4 Apr 2022 15:51:28 GMT'}, {'version': 'v4', 'created': 'Sat, 23 Apr 2022 16:43:54 GMT'}]",2022-04-26,"[['Wang', 'Nan', ''], ['Lin', 'Lu', ''], ['Li', 'Jundong', ''], ['Wang', 'Hongning', '']]","['unbiased graph embedding', 'fairness', 'sensitive attributes', 'bias-freegraph', 'node representation']"
11761,1708.04764,Yuantao Gu,"Yanxi Chen, Gen Li and Yuantao Gu",Active Orthogonal Matching Pursuit for Sparse Subspace Clustering,"14 pages, 5 figures, 1 table",,10.1109/LSP.2017.2741509,,cs.LG cs.CV cs.IT math.IT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sparse Subspace Clustering (SSC) is a state-of-the-art method for clustering
high-dimensional data points lying in a union of low-dimensional subspaces.
However, while $\ell_1$ optimization-based SSC algorithms suffer from high
computational complexity, other variants of SSC, such as Orthogonal Matching
Pursuit-based SSC (OMP-SSC), lose clustering accuracy in pursuit of improving
time efficiency. In this letter, we propose a novel Active OMP-SSC, which
improves clustering accuracy of OMP-SSC by adaptively updating data points and
randomly dropping data points in the OMP process, while still enjoying the low
computational complexity of greedy pursuit algorithms. We provide heuristic
analysis of our approach, and explain how these two active steps achieve a
better tradeoff between connectivity and separation. Numerical results on both
synthetic data and real-world data validate our analyses and show the
advantages of the proposed active algorithm.
","[{'version': 'v1', 'created': 'Wed, 16 Aug 2017 04:15:37 GMT'}]",2018-02-14,"[['Chen', 'Yanxi', ''], ['Li', 'Gen', ''], ['Gu', 'Yuantao', '']]","['Sparse subspace clustering', 'orthogonal matching pursuit', 'active algo']"
11762,2204.13009,Hao Wang,Hao Wang,"Extremal GloVe: Theoretically Accurate Distributed Word Embedding by
  Tail Inference",ICCIP 2021,,10.1145/3507971.3507972,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Distributed word embeddings such as Word2Vec and GloVe have been widely
adopted in industrial context settings. Major technical applications of GloVe
include recommender systems and natural language processing. The fundamental
theory behind GloVe relies on the selection of a weighting function in the
weighted least squres formulation that computes the powered ratio of word
occurrence count and the maximum word count in the corpus. However, the initial
formulation of GloVe is not theoretically sound in two aspects, namely the
selection of the weighting function and its power exponent is ad-hoc. In this
paper, we utilize the theory of extreme value analysis and propose a
theoretically accurate version of GloVe. By reformulating the weighted least
squares loss function as the expected loss function and accurately choosing the
power exponent, we create a theoretically accurate version of GloVe. We
demonstrate the competitiveness of our algorithm and show that the initial
formulation of GloVe with the suggested optimal parameter can be viewed as a
special case of our paradigm.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2022 15:29:10 GMT'}]",2022-04-28,"[['Wang', 'Hao', '']]","['GloVe', 'distributed word embedding', 'tail inference', 'extreme value analysis']"
11763,2007.08552,Diego Montezanti,"Diego Montezanti, Enzo Rucci, Armando De Giusti, Marcelo Naiouf,
  Dolores Rexachs, Emilio Luque","Soft Errors Detection and Automatic Recovery based on Replication
  combined with different Levels of Checkpointing","26 pages, 3 figures (1 and 2 with subfigures), 4 tables, sent to
  review to Future Generation Computer Systems","FGCS Volume 113, December 2020, Pages 240-254, ISSN 0167-739X",10.1016/j.future.2020.07.003,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Handling faults is a growing concern in HPC. In future exascale systems, it
is projected that silent undetected errors will occur several times a day,
increasing the occurrence of corrupted results. In this article, we propose
SEDAR, which is a methodology that improves system reliability against
transient faults when running parallel message-passing applications. Our
approach, based on process replication for detection, combined with different
levels of checkpointing for automatic recovery, has the goal of helping users
of scientific applications to obtain executions with correct results. SEDAR is
structured in three levels: (1) only detection and safe-stop with notification;
(2) recovery based on multiple system-level checkpoints; and (3) recovery based
on a single valid user-level checkpoint. As each of these variants supplies a
particular coverage but involves limitations and implementation costs, SEDAR
can be adapted to the needs of the system. In this work, a description of the
methodology is presented and the temporal behavior of employing each SEDAR
strategy is mathematically described, both in the absence and presence of
faults. A model that considers all the fault scenarios on a test application is
introduced to show the validity of the detection and recovery mechanisms. An
overhead evaluation of each variant is performed with applications involving
different communication patterns; this is also used to extract guidelines about
when it is beneficial to employ each SEDAR protection level. As a result, we
show its efficacy and viability to tolerate transient faults in target HPC
environments.
","[{'version': 'v1', 'created': 'Thu, 16 Jul 2020 18:17:16 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Jul 2020 23:01:33 GMT'}]",2020-07-29,"[['Montezanti', 'Diego', ''], ['Rucci', 'Enzo', ''], ['De Giusti', 'Armando', ''], ['Naiouf', 'Marcelo', ''], ['Rexachs', 'Dolores', ''], ['Luque', 'Emilio', '']]","['soft error detection', 'automatic recovery', 'system-level checkpoint', 'user-level checkpoint']"
11764,1401.6393,Radu Horaud P,"Miles Hansard, Radu Horaud, Michel Amat, Georgios Evangelidis",Automatic Detection of Calibration Grids in Time-of-Flight Images,"11 pages, 11 figures, 1 table","Computer Vision and Image Understanding, 121, 2014",10.1016/j.cviu.2014.01.007,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is convenient to calibrate time-of-flight cameras by established methods,
using images of a chequerboard pattern. The low resolution of the amplitude
image, however, makes it difficult to detect the board reliably. Heuristic
detection methods, based on connected image-components, perform very poorly on
this data. An alternative, geometrically-principled method is introduced here,
based on the Hough transform. The projection of a chequerboard is represented
by two pencils of lines, which are identified as oriented clusters in the
gradient-data of the image. A projective Hough transform is applied to each of
the two clusters, in axis-aligned coordinates. The range of each transform is
properly bounded, because the corresponding gradient vectors are approximately
parallel. Each of the two transforms contains a series of collinear peaks; one
for every line in the given pencil. This pattern is easily detected, by
sweeping a dual line through the transform. The proposed Hough-based method is
compared to the standard OpenCV detection routine, by application to several
hundred time-of-flight images. It is shown that the new method detects
significantly more calibration boards, over a greater variety of poses, without
any overall loss of accuracy. This conclusion is based on an analysis of both
geometric and photometric error.
","[{'version': 'v1', 'created': 'Fri, 24 Jan 2014 16:25:56 GMT'}]",2020-12-18,"[['Hansard', 'Miles', ''], ['Horaud', 'Radu', ''], ['Amat', 'Michel', ''], ['Evangelidis', 'Georgios', '']]","['Range imaging', 'time-of-flight sensors', 'camera calibration', 'Hough transform']"
11765,1307.1070,Uwe Aickelin,"Naisan Benatar, Uwe Aickelin, Jonathan M. Garibaldi","A Comparison of Non-stationary, Type-2 and Dual Surface Fuzzy Control","2011 IEEE International Conference on Fuzzy Systems, pp 1193-1200",,10.1109/FUZZY.2011.6007602,,cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Type-1 fuzzy logic has frequently been used in control systems. However this
method is sometimes shown to be too restrictive and unable to adapt in the
presence of uncertainty. In this paper we compare type-1 fuzzy control with
several other fuzzy approaches under a range of uncertain conditions. Interval
type-2 and non-stationary fuzzy controllers are compared, along with 'dual
surface' type-2 control, named due to utilising both the lower and upper values
produced from standard interval type-2 systems. We tune a type-1 controller,
then derive the membership functions and footprints of uncertainty from the
type-1 system and evaluate them using a simulated autonomous sailing problem
with varying amounts of environmental uncertainty. We show that while these
more sophisticated controllers can produce better performance than the type-1
controller, this is not guaranteed and that selection of Footprint of
Uncertainty (FOU) size has a large effect on this relative performance.
","[{'version': 'v1', 'created': 'Wed, 3 Jul 2013 16:34:00 GMT'}]",2016-11-15,"[['Benatar', 'Naisan', ''], ['Aickelin', 'Uwe', ''], ['Garibaldi', 'Jonathan M.', '']]","['Interval Type-2 Fuzzy', 'Robot Boat control', 'Fuzzy']"
11766,2010.00494,Abbas Cheddad,"Charitha Dissanayake Lekamlage, Fabia Afzal, Erik Westerberg, Abbas
  Cheddad",Mini-DDSM: Mammography-based Automatic Age Estimation,"C.D. Lekamlage, F. Afzal, E. Westerberg and A. Cheddad, ""Mini-DDSM:
  Mammography-based Automatic Age Estimation,"" in the 3rd International
  Conference on Digital Medicine and Image Processing (DMIP 2020), ACM, Kyoto,
  Japan, November 06-09, 2020",,10.1145/3441369.3441370,,cs.CV cs.LG eess.IV,http://creativecommons.org/licenses/by/4.0/,"  Age estimation has attracted attention for its various medical applications.
There are many studies on human age estimation from biomedical images. However,
there is no research done on mammograms for age estimation, as far as we know.
The purpose of this study is to devise an AI-based model for estimating age
from mammogram images. Due to lack of public mammography data sets that have
the age attribute, we resort to using a web crawler to download thumbnail
mammographic images and their age fields from the public data set; the Digital
Database for Screening Mammography. The original images in this data set
unfortunately can only be retrieved by a software which is broken.
Subsequently, we extracted deep learning features from the collected data set,
by which we built a model using Random Forests regressor to estimate the age
automatically. The performance assessment was measured using the mean absolute
error values. The average error value out of 10 tests on random selection of
samples was around 8 years. In this paper, we show the merits of this approach
to fill up missing age values. We ran logistic and linear regression models on
another independent data set to further validate the advantage of our proposed
work. This paper also introduces the free-access Mini-DDSM data set.
","[{'version': 'v1', 'created': 'Thu, 1 Oct 2020 15:35:11 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Nov 2020 12:45:23 GMT'}, {'version': 'v3', 'created': 'Tue, 24 Nov 2020 10:13:41 GMT'}]",2022-07-14,"[['Lekamlage', 'Charitha Dissanayake', ''], ['Afzal', 'Fabia', ''], ['Westerberg', 'Erik', ''], ['Cheddad', 'Abbas', '']]","['Applied machine learning', 'Mammograms', 'Image segmentation', 'Deep learning', 'Feature extraction', 'Regression analysis', 'Age estimation']"
11767,2112.05575,Jayati Deshmukh,Srinath Srinivasa and Jayati Deshmukh,Paradigms of Computational Agency,"Earlier version of this paper was published as a book chapter in the
  book titled Novel Approaches to Information Systems Design","In Novel Approaches to Information Systems Design, pp. 1-19. IGI
  Global, 2020",10.4018/978-1-7998-2975-1.ch001,,cs.AI cs.MA,http://creativecommons.org/licenses/by/4.0/,"  Agent-based models have emerged as a promising paradigm for addressing ever
increasing complexity of information systems. In its initial days in the 1990s
when object-oriented modeling was at its peak, an agent was treated as a
special kind of ""object"" that had a persistent state and its own independent
thread of execution. Since then, agent-based models have diversified enormously
to even open new conceptual insights about the nature of systems in general.
This paper presents a perspective on the disparate ways in which our
understanding of agency, as well as computational models of agency have
evolved. Advances in hardware like GPUs, that brought neural networks back to
life, may also similarly infuse new life into agent-based models, as well as
pave the way for advancements in research on Artificial General Intelligence
(AGI).
","[{'version': 'v1', 'created': 'Fri, 10 Dec 2021 14:42:49 GMT'}]",2021-12-13,"[['Srinivasa', 'Srinath', ''], ['Deshmukh', 'Jayati', '']]","['Agent-Based Models', 'Multi-Agent Systems', 'Normative andEconomic Models', 'Artificial General Intelligence']"
11768,2208.06018,Florian Tambon,"Florian Tambon, Foutse Khomh, Giuliano Antoniol",A Probabilistic Framework for Mutation Testing in Deep Neural Networks,"23 pages, 5 figures, 4 tables. Submitted to Information and Software
  Technology Journal",Information and Software Technology. 155 (2023) 107129,10.1016/j.infsof.2022.107129,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Mutation Testing (MT) is an important tool in traditional Software
Engineering (SE) white-box testing. It aims to artificially inject faults in a
system to evaluate a test suite's capability to detect them, assuming that the
test suite defects finding capability will then translate to real faults. If MT
has long been used in SE, it is only recently that it started gaining the
attention of the Deep Learning (DL) community, with researchers adapting it to
improve the testability of DL models and improve the trustworthiness of DL
systems.
  Objective: If several techniques have been proposed for MT, most of them
neglected the stochasticity inherent to DL resulting from the training phase.
Even the latest MT approaches in DL, which propose to tackle MT through a
statistical approach, might give inconsistent results. Indeed, as their
statistic is based on a fixed set of sampled training instances, it can lead to
different results across instances set when results should be consistent for
any instance.
  Methods: In this work, we propose a Probabilistic Mutation Testing (PMT)
approach that alleviates the inconsistency problem and allows for a more
consistent decision on whether a mutant is killed or not.
  Results: We show that PMT effectively allows a more consistent and informed
decision on mutations through evaluation using three models and eight mutation
operators used in previously proposed MT methods. We also analyze the trade-off
between the approximation error and the cost of our method, showing that
relatively small error can be achieved for a manageable cost.
  Conclusion: Our results showed the limitation of current MT practices in DNN
and the need to rethink them. We believe PMT is the first step in that
direction which effectively removes the lack of consistency across test
executions of previous methods caused by the stochasticity of DNN training.
","[{'version': 'v1', 'created': 'Thu, 11 Aug 2022 19:45:14 GMT'}]",2023-01-16,"[['Tambon', 'Florian', ''], ['Khomh', 'Foutse', ''], ['Antoniol', 'Giuliano', '']]","['Deep learning', 'Mutation Testing', 'Bayesian Probability']"
11769,2103.03610,Iain Barclay,"Iain Barclay, Harrison Taylor, Alun Preece, Ian Taylor, Dinesh Verma,
  Geeth de Mel","A framework for fostering transparency in shared artificial intelligence
  models by increasing visibility of contributions","This is the pre-peer reviewed version of the following article:
  Barclay I, Taylor H, Preece A, Taylor I, Verma D, de Mel G. A framework for
  fostering transparency in shared artificial intelligence models by increasing
  visibility of contributions. Concurrency Computat Pract Exper. 2020;e6129.
  arXiv admin note: substantial text overlap with arXiv:1907.03483",,10.1002/cpe.6129,,cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Increased adoption of artificial intelligence (AI) systems into scientific
workflows will result in an increasing technical debt as the distance between
the data scientists and engineers who develop AI system components and
scientists, researchers and other users grows. This could quickly become
problematic, particularly where guidance or regulations change and
once-acceptable best practice becomes outdated, or where data sources are later
discredited as biased or inaccurate. This paper presents a novel method for
deriving a quantifiable metric capable of ranking the overall transparency of
the process pipelines used to generate AI systems, such that users, auditors
and other stakeholders can gain confidence that they will be able to validate
and trust the data sources and contributors in the AI systems that they rely
on. The methodology for calculating the metric, and the type of criteria that
could be used to make judgements on the visibility of contributions to systems
are evaluated through models published at ModelHub and PyTorch Hub, popular
archives for sharing science resources, and is found to be helpful in driving
consideration of the contributions made to generating AI systems and approaches
towards effective documentation and improving transparency in machine learning
assets shared within scientific communities.
","[{'version': 'v1', 'created': 'Fri, 5 Mar 2021 11:28:50 GMT'}]",2021-03-08,"[['Barclay', 'Iain', ''], ['Taylor', 'Harrison', ''], ['Preece', 'Alun', ''], ['Taylor', 'Ian', ''], ['Verma', 'Dinesh', ''], ['de Mel', 'Geeth', '']]","['accountability', 'data ecosystems', 'data provenance', 'ML model evaluation', 'model zoo', 'transparency']"
11770,2208.06632,John Paul Miranda,"Jaymark A. Yambao, John Paul P. Miranda, Earl Lawrence B. Pelayo","Development of Augmented Reality Application for Made-to-Order Furniture
  Industry in Pampanga, Philippines","11 pages, 3 figures, journal article, short paper",International Journal of Computing Sciences Research 6 (2022) 1-11,10.25147/ijcsr.2017.001.1.112,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  The focus of the study was to develop a mobile application utilizing
marker-less augmented reality for specific made-to-order products to support
furniture and fixtures businesses. The study implemented mixed-methodology to
properly identify the various stakeholders' considerations in developing the
application. Interviews with key informants were conducted to ensure that the
features were appropriate for the intended user needs, and selected ISO
standards were used as evaluation criteria. The results indicate that the
mobile application with marker-less AR technology was found to be highly
acceptable by three evaluators (i.e., customers, owners, and IT experts). The
study also highlighted the use of AR-related technology in this case, where
marker-less has the potential to improve customer purchasing experience even
further. Future studies may include using newer technologies to further improve
the application. The study suggests that Augmented Reality technology could be
used to connect specific businesses directly to consumers regardless of setting
or context.
","[{'version': 'v1', 'created': 'Sat, 13 Aug 2022 11:40:25 GMT'}]",2022-08-16,"[['Yambao', 'Jaymark A.', ''], ['Miranda', 'John Paul P.', ''], ['Pelayo', 'Earl Lawrence B.', '']]","['augmented reality', 'mobile application', 'made-to-order', 'furniture', 'fixtures    INTRODUCTION']"
11771,2005.05725,"Alexander Badri-Spr\""owitz","An Mo and Fabio Izzi and Daniel F. B. Haeufle and Alexander
  Badri-Spr\""owitz","Effective Viscous Damping Enables Morphological Computation in Legged
  Locomotion",,,10.3389/frobt.2020.00110,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Muscle models and animal observations suggest that physical damping is
beneficial for stabilization. Still, only a few implementations of mechanical
damping exist in compliant robotic legged locomotion. It remains unclear how
physical damping can be exploited for locomotion tasks, while its advantages as
sensor-free, adaptive force- and negative work-producing actuators are
promising. In a simplified numerical leg model, we studied the energy
dissipation from viscous and Coulomb damping during vertical drops with
ground-level perturbations. A parallel spring-damper is engaged between
touch-down and mid-stance, and its damper auto-disengages during mid-stance and
takeoff. Our simulations indicate that an adjustable and viscous damper is
desired. In hardware we explored effective viscous damping and adjustability
and quantified the dissipated energy. We tested two mechanical, leg-mounted
damping mechanisms; a commercial hydraulic damper, and a custom-made pneumatic
damper. The pneumatic damper exploits a rolling diaphragm with an adjustable
orifice, minimizing Coulomb damping effects while permitting adjustable
resistance. Experimental results show that the leg-mounted, hydraulic damper
exhibits the most effective viscous damping. Adjusting the orifice setting did
not result in substantial changes of dissipated energy per drop, unlike
adjusting damping parameters in the numerical model. Consequently, we also
emphasize the importance of characterizing physical dampers during real legged
impacts to evaluate their effectiveness for compliant legged locomotion.
","[{'version': 'v1', 'created': 'Tue, 12 May 2020 12:41:04 GMT'}, {'version': 'v2', 'created': 'Sat, 6 Jun 2020 17:17:04 GMT'}]",2022-03-07,"[['Mo', 'An', ''], ['Izzi', 'Fabio', ''], ['Haeufle', 'Daniel F. B.', ''], ['Badri-Spröwitz', 'Alexander', '']]","['damping', 'energy dissipation', 'legged locomotion', 'ground disturbance', 'drop test', 'rolling diaphragm']"
11772,2002.12021,"Felicitas L\""offler","Felicitas L\""offler, Valentin Wesp, Birgitta K\""onig-Ries, Friederike
  Klan","Dataset Search In Biodiversity Research: Do Metadata In Data
  Repositories Reflect Scholarly Information Needs?",,,10.1371/journal.pone.0246099,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  The increasing amount of research data provides the opportunity to link and
integrate data to create novel hypotheses, to repeat experiments or to compare
recent data to data collected at a different time or place. However, recent
studies have shown that retrieving relevant data for data reuse is a
time-consuming task in daily research practice. In this study, we explore what
hampers dataset retrieval in biodiversity research, a field that produces a
large amount of heterogeneous data. We analyze the primary source in dataset
search - metadata - and determine if they reflect scholarly search interests.
We examine if metadata standards provide elements corresponding to search
interests, we inspect if selected data repositories use metadata standards
representing scholarly interests, and we determine how many fields of the
metadata standards used are filled. To determine search interests in
biodiversity research, we gathered 169 questions that researchers aimed to
answer with the help of retrieved data, identified biological entities and
grouped them into 13 categories. Our findings indicate that environments,
materials and chemicals, species, biological and chemical processes, locations,
data parameters and data types are important search interests in biodiversity
research. The comparison with existing metadata standards shows that
domain-specific standards cover search interests quite well, whereas general
standards do not explicitly contain elements that reflect search interests. We
inspect metadata from five large data repositories. Our results confirm that
metadata currently poorly reflect search interests in biodiversity research.
From these findings, we derive recommendations for researchers and data
repositories how to bridge the gap between search interest and metadata
provided.
","[{'version': 'v1', 'created': 'Thu, 27 Feb 2020 10:32:47 GMT'}]",2021-06-09,"[['Löffler', 'Felicitas', ''], ['Wesp', 'Valentin', ''], ['König-Ries', 'Birgitta', ''], ['Klan', 'Friederike', '']]","['semantic search', 'query expansion', 'biological data', 'Life Sciences', 'biodiversity']"
11773,2109.02311,Ahtsham Manzoor Mr.,Ahtsham Manzoor and Dietmar Jannach,Towards Retrieval-based Conversational Recommendation,"29 pages, 5 figures, 7 tables","Information Systems, Volume 109, 2022, 102083, ISSN 0306-4379",10.1016/j.is.2022.102083,IS_102083,cs.IR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Conversational recommender systems have attracted immense attention recently.
The most recent approaches rely on neural models trained on recorded dialogs
between humans, implementing an end-to-end learning process. These systems are
commonly designed to generate responses given the user's utterances in natural
language. One main challenge is that these generated responses both have to be
appropriate for the given dialog context and must be grammatically and
semantically correct. An alternative to such generation-based approaches is to
retrieve responses from pre-recorded dialog data and to adapt them if needed.
Such retrieval-based approaches were successfully explored in the context of
general conversational systems, but have received limited attention in recent
years for CRS. In this work, we re-assess the potential of such approaches and
design and evaluate a novel technique for response retrieval and ranking. A
user study (N=90) revealed that the responses by our system were on average of
higher quality than those of two recent generation-based systems. We
furthermore found that the quality ranking of the two generation-based
approaches is not aligned with the results from the literature, which points to
open methodological questions. Overall, our research underlines that
retrieval-based approaches should be considered an alternative or complement to
language generation approaches.
","[{'version': 'v1', 'created': 'Mon, 6 Sep 2021 09:23:15 GMT'}]",2022-05-26,"[['Manzoor', 'Ahtsham', ''], ['Jannach', 'Dietmar', '']]","['Recommender Systems', 'Conversational Recommendation', 'UserStudy', 'Information Retrieval', 'End-to-end Learning', 'Dialog Systems']"
11774,2109.11450,Sina Baghbanijam,"Sina Baghbanijam (Iran University of Science and Technology), Hanie
  Sanaei (Tarbiat Modares University), Mahdi Farajzadeh (Tehran University)","An Improved Authentication & Key Exchange Protocol Based on ECDH for
  WSNs","7 Pages, 5 figures",,10.1109/ICEE55646.2022.9827043,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  The widespread use of wireless sensor networks (WSNs) that are consisted of
resource-constrained sensor nodes in communication with gateways in open-space
environments and industries has highlighted the need for a secure yet fast
communication protocol between users, gateways, and sensor nodes. Due to the
properties of the network, elliptic-curve cryptography seems to be the most
viable choice as it requires fewer resources than most other options. In this
paper, we analyze the protocol suggested by Moghadam et al. which is based on
ECDH (elliptic-curve Diffie-Hellman), and mention some of the flaws in their
proposed authentication and key exchange protocol. Some attacks are also
mentioned to further explain the shortcomings of their schema. Then a modified
version of the protocol is proposed, analyzed, and checked against the same
attacks as an informal security proof.
","[{'version': 'v1', 'created': 'Thu, 23 Sep 2021 15:50:26 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Apr 2022 13:02:01 GMT'}]",2022-07-26,"[['Baghbanijam', 'Sina', '', 'Iran University of Science and Technology'], ['Sanaei', 'Hanie', '', 'Tarbiat Modares University'], ['Farajzadeh', 'Mahdi', '', 'Tehran University']]","['Wireless Sensor Networks (WSNs)', 'EllipticCurve Cryptography', 'Authentication', 'Key Exchange']"
11775,2101.05018,Xinggang Wang,"Mengting Chen and Xinggang Wang and Heng Luo and Yifeng Geng and Wenyu
  Liu","Learning to Focus: Cascaded Feature Matching Network for Few-shot Image
  Recognition",14 pages,"SCIENCE CHINA Information Sciences, 2021",10.1007/s11432-020-2973-7,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Deep networks can learn to accurately recognize objects of a category by
training on a large number of annotated images. However, a meta-learning
challenge known as a low-shot image recognition task comes when only a few
images with annotations are available for learning a recognition model for one
category. The objects in testing/query and training/support images are likely
to be different in size, location, style, and so on. Our method, called
Cascaded Feature Matching Network (CFMN), is proposed to solve this problem. We
train the meta-learner to learn a more fine-grained and adaptive deep distance
metric by focusing more on the features that have high correlations between
compared images by the feature matching block which can align associated
features together and naturally ignore those non-discriminative features. By
applying the proposed feature matching block in different layers of the
few-shot recognition network, multi-scale information among the compared images
can be incorporated into the final cascaded matching feature, which boosts the
recognition performance further and generalizes better by learning on
relationships. The experiments for few-shot learning on two standard datasets,
\emph{mini}ImageNet and Omniglot, have confirmed the effectiveness of our
method. Besides, the multi-label few-shot task is first studied on a new data
split of COCO which further shows the superiority of the proposed feature
matching network when performing few-shot learning in complex images. The code
will be made publicly available.
","[{'version': 'v1', 'created': 'Wed, 13 Jan 2021 11:37:28 GMT'}]",2021-01-14,"[['Chen', 'Mengting', ''], ['Wang', 'Xinggang', ''], ['Luo', 'Heng', ''], ['Geng', 'Yifeng', ''], ['Liu', 'Wenyu', '']]","['Few-shot learning', 'image recognition', 'feature matching']"
11776,2009.05720,Ayu Purwarianti,"Ayu Purwarianti (1), Ida Ayu Putu Ari Crisdayanti (1) ((1) Institut
  Teknologi Bandung)","Improving Bi-LSTM Performance for Indonesian Sentiment Analysis Using
  Paragraph Vector",,"2019 International Conference of Advanced Informatics: Concepts,
  Theory and Applications (ICAICTA)",10.1109/ICAICTA.2019.8904199,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bidirectional Long Short-Term Memory Network (Bi-LSTM) has shown promising
performance in sentiment classification task. It processes inputs as sequence
of information. Due to this behavior, sentiment predictions by Bi-LSTM were
influenced by words sequence and the first or last phrases of the texts tend to
have stronger features than other phrases. Meanwhile, in the problem scope of
Indonesian sentiment analysis, phrases that express the sentiment of a document
might not appear in the first or last part of the document that can lead to
incorrect sentiment classification. To this end, we propose the using of an
existing document representation method called paragraph vector as additional
input features for Bi-LSTM. This vector provides information context of the
document for each sequence processing. The paragraph vector is simply
concatenated to each word vector of the document. This representation also
helps to differentiate ambiguous Indonesian words. Bi-LSTM and paragraph vector
were previously used as separate methods. Combining the two methods has shown a
significant performance improvement of Indonesian sentiment analysis model.
Several case studies on testing data showed that the proposed method can handle
the sentiment phrases position problem encountered by Bi-LSTM.
","[{'version': 'v1', 'created': 'Sat, 12 Sep 2020 03:43:30 GMT'}]",2020-09-15,"[['Purwarianti', 'Ayu', ''], ['Crisdayanti', 'Ida Ayu Putu Ari', '']]","['sentiment analysis', 'document', 'Indonesian', 'Bi']"
11777,2110.10876,Yuchen Liu,"Yuchen Liu, S.Y. Kung, David Wentzlaff",Evolving Transferable Neural Pruning Functions,Published at GECCO 2022,"Proceedings of the Genetic and Evolutionary Computation
  Conference, 2022 (385--394)",10.1145/3512290.3528694,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Structural design of neural networks is crucial for the success of deep
learning. While most prior works in evolutionary learning aim at directly
searching the structure of a network, few attempts have been made on another
promising track, channel pruning, which recently has made major headway in
designing efficient deep learning models. In fact, prior pruning methods adopt
human-made pruning functions to score a channel's importance for channel
pruning, which requires domain knowledge and could be sub-optimal. To this end,
we pioneer the use of genetic programming (GP) to discover strong pruning
metrics automatically. Specifically, we craft a novel design space to express
high-quality and transferable pruning functions, which ensures an end-to-end
evolution process where no manual modification is needed on the evolved
functions for their transferability after evolution. Unlike prior methods, our
approach can provide both compact pruned networks for efficient inference and
novel closed-form pruning metrics which are mathematically explainable and thus
generalizable to different pruning tasks. While the evolution is conducted on
small datasets, our functions shows promising results when applied to more
challenging datasets, different from those used in the evolution process. For
example, on ILSVRC-2012, an evolved function achieves state-of-the-art pruning
results.
","[{'version': 'v1', 'created': 'Thu, 21 Oct 2021 03:40:51 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Aug 2022 02:10:56 GMT'}]",2022-08-05,"[['Liu', 'Yuchen', ''], ['Kung', 'S. Y.', ''], ['Wentzlaff', 'David', '']]","['Convolutional Neural Network', 'Channel Pruning', 'Efficient DeepLearning', 'Genetic Programming']"
11778,2008.10298,Robin Kips,"Robin Kips, Pietro Gori, Matthieu Perrot, Isabelle Bloch","CA-GAN: Weakly Supervised Color Aware GAN for Controllable Makeup
  Transfer",,,10.1007/978-3-030-67070-2_17,,cs.CV cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While existing makeup style transfer models perform an image synthesis whose
results cannot be explicitly controlled, the ability to modify makeup color
continuously is a desirable property for virtual try-on applications. We
propose a new formulation for the makeup style transfer task, with the
objective to learn a color controllable makeup style synthesis. We introduce
CA-GAN, a generative model that learns to modify the color of specific objects
(e.g. lips or eyes) in the image to an arbitrary target color while preserving
background. Since color labels are rare and costly to acquire, our method
leverages weakly supervised learning for conditional GANs. This enables to
learn a controllable synthesis of complex objects, and only requires a weak
proxy of the image attribute that we desire to modify. Finally, we present for
the first time a quantitative analysis of makeup style transfer and color
control performance.
","[{'version': 'v1', 'created': 'Mon, 24 Aug 2020 10:11:17 GMT'}]",2021-03-12,"[['Kips', 'Robin', ''], ['Gori', 'Pietro', ''], ['Perrot', 'Matthieu', ''], ['Bloch', 'Isabelle', '']]","['Image Synthesis', 'GANs', 'Weakly Supervised Learning', 'MakeupStyle Transfer']"
11779,1912.11864,"Mika\""el Monet","Mika\""el Monet","Solving a Special Case of the Intensional vs Extensional Conjecture in
  Probabilistic Databases","16 pages, including 12 pages of main text. This is the ArXiv version
  of the PODS'20 paper. Except from minor differences that could be introduced
  by the publisher, the only difference should be the addition of the figure in
  Appendix D",,10.1145/3375395.3387642,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of exact probabilistic inference for Union of
Conjunctive Queries (UCQs) on tuple-independent databases. For this problem,
two approaches currently coexist. In the extensional method, query evaluation
is performed by exploiting the structure of the query, and relies heavily on
the use of the inclusion-exclusion principle. In the intensional method, one
first builds a representation of the lineage of the query in a tractable
formalism of knowledge compilation. The chosen formalism should then ensure
that the probability can be efficiently computed using simple disjointness and
independence assumptions, without the need of performing inclusion-exclusion.
The extensional approach has long been thought to be strictly more powerful
than the intensional approach, the reason being that for some queries, the use
of inclusion-exclusion seemed unavoidable. In this paper we introduce a new
technique to construct lineage representations as deterministic decomposable
circuits in polynomial time. We prove that this technique applies to a class of
UCQs that had been conjectured to separate the complexity of the two
approaches. In essence, we show that relying on the inclusion-exclusion formula
can be avoided by using negation. This result brings back hope to prove that
the intensional approach can handle all tractable UCQs.
","[{'version': 'v1', 'created': 'Thu, 26 Dec 2019 13:46:23 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Mar 2020 16:20:44 GMT'}]",2021-04-29,"[['Monet', 'Mikaël', '']]","['Tuple-independent databases', 'knowledge compilation', 'deterministic decomposable Boolean circuits', 'inclusion–exclusion principle']"
11780,1802.00912,Zongwei Zhou,"Zongwei Zhou, Jae Y. Shin, Suryakanth R. Gurudu, Michael B. Gotway,
  Jianming Liang","Active, Continual Fine Tuning of Convolutional Neural Networks for
  Reducing Annotation Efforts",,,10.1016/j.media.2021.101997,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The splendid success of convolutional neural networks (CNNs) in computer
vision is largely attributable to the availability of massive annotated
datasets, such as ImageNet and Places. However, in medical imaging, it is
challenging to create such large annotated datasets, as annotating medical
images is not only tedious, laborious, and time consuming, but it also demands
costly, specialty-oriented skills, which are not easily accessible. To
dramatically reduce annotation cost, this paper presents a novel method to
naturally integrate active learning and transfer learning (fine-tuning) into a
single framework, which starts directly with a pre-trained CNN to seek ""worthy""
samples for annotation and gradually enhances the (fine-tuned) CNN via
continual fine-tuning. We have evaluated our method using three distinct
medical imaging applications, demonstrating that it can reduce annotation
efforts by at least half compared with random selection.
","[{'version': 'v1', 'created': 'Sat, 3 Feb 2018 05:01:17 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Feb 2018 02:13:28 GMT'}, {'version': 'v3', 'created': 'Sat, 23 May 2020 18:03:48 GMT'}, {'version': 'v4', 'created': 'Tue, 30 Mar 2021 00:19:51 GMT'}, {'version': 'v5', 'created': 'Sat, 10 Apr 2021 22:38:32 GMT'}]",2021-04-13,"[['Zhou', 'Zongwei', ''], ['Shin', 'Jae Y.', ''], ['Gurudu', 'Suryakanth R.', ''], ['Gotway', 'Michael B.', ''], ['Liang', 'Jianming', '']]","['Active learning', 'annotationcost reduction', 'convolutional neural networks', 'computer-aided diagnosis', 'medical image analysis', 'transfer learning']"
11781,2210.02910,Samuel Maddock,"Samuel Maddock, Graham Cormode, Tianhao Wang, Carsten Maple and Somesh
  Jha",Federated Boosted Decision Trees with Differential Privacy,Full version of a paper to appear at ACM CCS'22,,10.1145/3548606.3560687,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is great demand for scalable, secure, and efficient privacy-preserving
machine learning models that can be trained over distributed data. While deep
learning models typically achieve the best results in a centralized non-secure
setting, different models can excel when privacy and communication constraints
are imposed. Instead, tree-based approaches such as XGBoost have attracted much
attention for their high performance and ease of use; in particular, they often
achieve state-of-the-art results on tabular data. Consequently, several recent
works have focused on translating Gradient Boosted Decision Tree (GBDT) models
like XGBoost into federated settings, via cryptographic mechanisms such as
Homomorphic Encryption (HE) and Secure Multi-Party Computation (MPC). However,
these do not always provide formal privacy guarantees, or consider the full
range of hyperparameters and implementation settings. In this work, we
implement the GBDT model under Differential Privacy (DP). We propose a general
framework that captures and extends existing approaches for differentially
private decision trees. Our framework of methods is tailored to the federated
setting, and we show that with a careful choice of techniques it is possible to
achieve very high utility while maintaining strong levels of privacy.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2022 13:28:29 GMT'}]",2022-11-09,"[['Maddock', 'Samuel', ''], ['Cormode', 'Graham', ''], ['Wang', 'Tianhao', ''], ['Maple', 'Carsten', ''], ['Jha', 'Somesh', '']]","['Gradient Boosting', 'Differential Privacy', 'Federated Learning']"
11782,1908.05006,Jake Lee,"Jake H. Lee, Kiri L. Wagstaff",Visualizing Image Content to Explain Novel Image Discovery,Published in DMKD,"Data Mining and Knowledge Discovery, vol. 34, pp. 1777-1804, 2020",10.1007/s10618-020-00700-0,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The initial analysis of any large data set can be divided into two phases:
(1) the identification of common trends or patterns and (2) the identification
of anomalies or outliers that deviate from those trends. We focus on the goal
of detecting observations with novel content, which can alert us to artifacts
in the data set or, potentially, the discovery of previously unknown phenomena.
To aid in interpreting and diagnosing the novel aspect of these selected
observations, we recommend the use of novelty detection methods that generate
explanations. In the context of large image data sets, these explanations
should highlight what aspect of a given image is new (color, shape, texture,
content) in a human-comprehensible form. We propose DEMUD-VIS, the first method
for providing visual explanations of novel image content by employing a
convolutional neural network (CNN) to extract image features, a method that
uses reconstruction error to detect novel content, and an up-convolutional
network to convert CNN feature representations back into image space. We
demonstrate this approach on diverse images from ImageNet, freshwater streams,
and the surface of Mars.
","[{'version': 'v1', 'created': 'Wed, 14 Aug 2019 07:53:05 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Sep 2022 21:02:51 GMT'}]",2022-09-14,"[['Lee', 'Jake H.', ''], ['Wagstaff', 'Kiri L.', '']]","['novelty detection', 'explanations', 'image analysis']"
11783,2012.05982,John Leung,John Kalung Leung and Igor Griva and William G. Kennedy,"Making Cross-Domain Recommendations by Associating Disjoint Users and
  Items Through the Affective Aware Pseudo Association Method","17 pages, 8 tables, 4 figures and paper has been accepted by the 2nd
  International Conference on Natural Language Processing, Information
  Retrieval and AI (NIAI 2021) to be held on January 23~24, 2021 in Zurich,
  Switzerland","David C. Wyld et al. (Eds): AIAP, SIGML, CNSA, NIAI - 2021 pp.
  113-129, 2021. CS & IT - CSCP 2021",10.5121/csit.2021.110108,,cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper utilizes an ingenious text-based affective aware pseudo
association method (AAPAM) to link disjoint users and items across different
information domains and leverage them to make cross-domain content-based and
collaborative filtering recommendations. This paper demonstrates that the AAPAM
method could seamlessly join different information domain datasets to act as
one without any additional cross-domain information retrieval protocols.
Besides making cross-domain recommendations, the benefit of joining datasets
from different information domains through AAPAM is that it eradicates cold
start issues while making serendipitous recommendations.
","[{'version': 'v1', 'created': 'Thu, 10 Dec 2020 21:16:13 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Feb 2021 19:08:23 GMT'}, {'version': 'v3', 'created': 'Wed, 10 Feb 2021 18:31:48 GMT'}]",2021-02-11,"[['Leung', 'John Kalung', ''], ['Griva', 'Igor', ''], ['Kennedy', 'William G.', '']]","['Behavioral Analysis', 'Emotion-aware Recommender System', 'Emotion prediction', 'Personality', 'Pseudo Users Association']"
11784,1910.12241,Danhao Zhu,"Danhao Zhu, Xin-yu Dai, Jiajun Chen","Pre-train and Learn: Preserve Global Information for Graph Neural
  Networks",,"JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 36(6): 1420-1430 Nov.
  2021",10.1007/s11390-020-0142-x,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph neural networks (GNNs) have shown great power in learning on attributed
graphs. However, it is still a challenge for GNNs to utilize information
faraway from the source node. Moreover, general GNNs require graph attributes
as input, so they cannot be appled to plain graphs. In the paper, we propose
new models named G-GNNs (Global information for GNNs) to address the above
limitations. First, the global structure and attribute features for each node
are obtained via unsupervised pre-training, which preserve the global
information associated to the node. Then, using the global features and the raw
network attributes, we propose a parallel framework of GNNs to learn different
aspects from these features. The proposed learning methods can be applied to
both plain graphs and attributed graphs. Extensive experiments have shown that
G-GNNs can outperform other state-of-the-art models on three standard
evaluation graphs. Specially, our methods establish new benchmark records on
Cora (84.31\%) and Pubmed (80.95\%) when learning on attributed graphs.
","[{'version': 'v1', 'created': 'Sun, 27 Oct 2019 11:27:14 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Dec 2021 02:06:49 GMT'}]",2021-12-28,"[['Zhu', 'Danhao', ''], ['Dai', 'Xin-yu', ''], ['Chen', 'Jiajun', '']]","['Graph neural network', 'Network embedding', 'Representation learning']"
11785,2011.06473,Tae Woo Hong,"Freddie Hong, Connor Myant, David Boyle","Thermoformed Circuit Boards: Fabrication of highly conductive freeform
  3D printed circuit boards with heat bending","10 pages, 17 figures, 2021 ACM CHI Conference on Human Factors in
  Computing Systems",,10.1145/3411764.3445469,,cs.ET cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fabricating 3D printed electronics using desktop printers has become more
accessible with recent developments in conductive thermoplastic filaments.
Because of their high resistance and difficulties in printing traces in
vertical directions, most applications are restricted to capacitive sensing. In
this paper, we introduce Thermoformed Circuit Board (TCB), a novel approach
that employs the thermoformability of the 3D printed plastics to construct
various double-sided, rigid and highly conductive freeform circuit boards that
can withstand high current applications through copper electroplating. To
illustrate the capability of the TCB, we showcase a range of examples with
various shapes, electrical characteristics and interaction mechanisms. We also
demonstrate a new design tool extension to an existing CAD environment that
allows users to parametrically draw the substrate and conductive trace, and
export 3D printable files. TCB is an inexpensive and highly accessible
fabrication technique intended to broaden HCI researcher participation.
","[{'version': 'v1', 'created': 'Thu, 12 Nov 2020 16:28:40 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Jan 2021 14:17:48 GMT'}]",2021-01-27,"[['Hong', 'Freddie', ''], ['Myant', 'Connor', ''], ['Boyle', 'David', '']]","['3D printed electronics', 'conductive filament', 'hybrid additive manufacturing']"
11786,2107.11157,Jerome Darmont,"Pengfei Liu (ERIC), Sabine Loudcher (ERIC), J\'er\^ome Darmont (ERIC),
  Camille No\^us (Laboratoire Cogitamus)",ArchaeoDAL: A Data Lake for Archaeological Data Management and Analytics,"25th International Database Engineering & Applications Symposium
  (IDEAS 2021), Jul 2021, Montr\'eal, Canada",,10.1145/3472163.3472266,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With new emerging technologies, such as satellites and drones, archaeologists
collect data over large areas. However, it becomes difficult to process such
data in time. Archaeological data also have many different formats (images,
texts, sensor data) and can be structured, semi-structured and unstructured.
Such variety makes data difficult to collect, store, manage, search and analyze
effectively. A few approaches have been proposed, but none of them covers the
full data lifecycle nor provides an efficient data management system. Hence, we
propose the use of a data lake to provide centralized data stores to host
heterogeneous data, as well as tools for data quality checking, cleaning,
transformation, and analysis. In this paper, we propose a generic, flexible and
complete data lake architecture. Our metadata management system exploits
goldMEDAL, which is the most complete metadata model currently available.
Finally, we detail the concrete implementation of this architecture dedicated
to an archaeological project.
","[{'version': 'v1', 'created': 'Fri, 23 Jul 2021 12:05:52 GMT'}]",2021-07-26,"[['Liu', 'Pengfei', '', 'ERIC'], ['Loudcher', 'Sabine', '', 'ERIC'], ['Darmont', 'Jérôme', '', 'ERIC'], ['Noûs', 'Camille', '', 'Laboratoire Cogitamus']]","['Data lake architecture', 'Data lake implementation', 'Metadata management', 'Archaeological data', 'Thesaurus']"
11787,2111.01257,Jossekin Beilharz,"Jossekin Beilharz, Bjarne Pfitzner, Robert Schmid, Paul Geppert, Bert
  Arnrich, and Andreas Polze","Implicit Model Specialization through DAG-based Decentralized Federated
  Learning",to be published in Middleware '21,,10.1145/3464298.3493403,,cs.DC cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Federated learning allows a group of distributed clients to train a common
machine learning model on private data. The exchange of model updates is
managed either by a central entity or in a decentralized way, e.g. by a
blockchain. However, the strong generalization across all clients makes these
approaches unsuited for non-independent and identically distributed (non-IID)
data.
  We propose a unified approach to decentralization and personalization in
federated learning that is based on a directed acyclic graph (DAG) of model
updates. Instead of training a single global model, clients specialize on their
local data while using the model updates from other clients dependent on the
similarity of their respective data. This specialization implicitly emerges
from the DAG-based communication and selection of model updates. Thus, we
enable the evolution of specialized models, which focus on a subset of the data
and therefore cover non-IID data better than federated learning in a
centralized or blockchain-based setup.
  To the best of our knowledge, the proposed solution is the first to unite
personalization and poisoning robustness in fully decentralized federated
learning. Our evaluation shows that the specialization of models emerges
directly from the DAG-based communication of model updates on three different
datasets. Furthermore, we show stable model accuracy and less variance across
clients when compared to federated averaging.
","[{'version': 'v1', 'created': 'Mon, 1 Nov 2021 20:55:47 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Nov 2021 08:09:29 GMT'}]",2021-11-04,"[['Beilharz', 'Jossekin', ''], ['Pfitzner', 'Bjarne', ''], ['Schmid', 'Robert', ''], ['Geppert', 'Paul', ''], ['Arnrich', 'Bert', ''], ['Polze', 'Andreas', '']]","['decentralized machine learning', 'consensus protocol', 'blockchain', 'personalized federated learning']"
11788,2009.06847,Guansong Pang,"Guansong Pang, Anton van den Hengel, Chunhua Shen, Longbing Cao","Toward Deep Supervised Anomaly Detection: Reinforcement Learning from
  Partially Labeled Anomaly Data",Accepted to KDD 2021,,10.1145/3447548.3467417,,cs.LG cs.AI cs.CR cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of anomaly detection with a small set of partially
labeled anomaly examples and a large-scale unlabeled dataset. This is a common
scenario in many important applications. Existing related methods either
exclusively fit the limited anomaly examples that typically do not span the
entire set of anomalies, or proceed with unsupervised learning from the
unlabeled data. We propose here instead a deep reinforcement learning-based
approach that enables an end-to-end optimization of the detection of both
labeled and unlabeled anomalies. This approach learns the known abnormality by
automatically interacting with an anomaly-biased simulation environment, while
continuously extending the learned abnormality to novel classes of anomaly
(i.e., unknown anomalies) by actively exploring possible anomalies in the
unlabeled data. This is achieved by jointly optimizing the exploitation of the
small labeled anomaly data and the exploration of the rare unlabeled anomalies.
Extensive experiments on 48 real-world datasets show that our model
significantly outperforms five state-of-the-art competing methods.
","[{'version': 'v1', 'created': 'Tue, 15 Sep 2020 03:05:39 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Jun 2021 13:40:11 GMT'}]",2021-06-11,"[['Pang', 'Guansong', ''], ['Hengel', 'Anton van den', ''], ['Shen', 'Chunhua', ''], ['Cao', 'Longbing', '']]","['Anomaly Detection', 'Deep Learning', 'Reinforcement Learning', 'Neural Networks', 'Outlier Detection', 'Intrusion Detection']"
11789,1908.06665,Yang Dongming,"Dongming Yang, YueXian Zou, Jian Zhang, Ge Li","C-RPNs: Promoting Object Detection in real world via a Cascade Structure
  of Region Proposal Networks","28 pages,10 figures",,10.1016/j.neucom.2019.08.016,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, significant progresses have been made in object detection on common
benchmarks (i.e., Pascal VOC). However, object detection in real world is still
challenging due to the serious data imbalance. Images in real world are
dominated by easy samples like the wide range of background and some easily
recognizable objects, for example. Although two-stage detectors like Faster
R-CNN achieved big successes in object detection due to the strategy of
extracting region proposals by region proposal network, they show their poor
adaption in real-world object detection as a result of without considering
mining hard samples during extracting region proposals. To address this issue,
we propose a Cascade framework of Region Proposal Networks, referred to as
C-RPNs. The essence of C-RPNs is adopting multiple stages to mine hard samples
while extracting region proposals and learn stronger classifiers. Meanwhile, a
feature chain and a score chain are proposed to help learning more
discriminative representations for proposals. Moreover, a loss function of
cascade stages is designed to train cascade classifiers through
backpropagation. Our proposed method has been evaluated on Pascal VOC and
several challenging datasets like BSBDV 2017, CityPersons, etc. Our method
achieves competitive results compared with the current state-of-the-arts and
all-sided improvements in error analysis, validating its efficacy for detection
in real world.
","[{'version': 'v1', 'created': 'Mon, 19 Aug 2019 09:37:08 GMT'}]",2019-08-20,"[['Yang', 'Dongming', ''], ['Zou', 'YueXian', ''], ['Zhang', 'Jian', ''], ['Li', 'Ge', '']]","['Object Detection', 'Hard Samples Mining', 'Cascade Network', 'Region']"
11790,2103.08786,Jessie J. Smith,"Nasim Sonboli and Jessie J. Smith, Florencia Cabral Berenfus, Robin
  Burke, Casey Fiesler",Fairness and Transparency in Recommendation: The Users' Perspective,,,10.1145/3450613.3456835,,cs.IR cs.AI cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Though recommender systems are defined by personalization, recent work has
shown the importance of additional, beyond-accuracy objectives, such as
fairness. Because users often expect their recommendations to be purely
personalized, these new algorithmic objectives must be communicated
transparently in a fairness-aware recommender system. While explanation has a
long history in recommender systems research, there has been little work that
attempts to explain systems that use a fairness objective. Even though the
previous work in other branches of AI has explored the use of explanations as a
tool to increase fairness, this work has not been focused on recommendation.
Here, we consider user perspectives of fairness-aware recommender systems and
techniques for enhancing their transparency. We describe the results of an
exploratory interview study that investigates user perceptions of fairness,
recommender systems, and fairness-aware objectives. We propose three features
-- informed by the needs of our participants -- that could improve user
understanding of and trust in fairness-aware recommender systems.
","[{'version': 'v1', 'created': 'Tue, 16 Mar 2021 00:42:09 GMT'}]",2021-03-17,"[['Sonboli', 'Nasim', ''], ['Smith', 'Jessie J.', ''], ['Berenfus', 'Florencia Cabral', ''], ['Burke', 'Robin', ''], ['Fiesler', 'Casey', '']]","['fairness', 'transparency', 'qualitative study', 'recommender systems', 'explanation']"
11791,2007.01455,John Leung,"John Kalung Leung, Igor Griva, William G. Kennedy",Text-based Emotion Aware Recommender,"13 pages, 8 tables, International Conference on Natural Language
  Computing and AI (NLCAI2020) July25-26, London, United Kingdom","David C. Wyld et al. (Eds): CCSEA, BIoT, DKMP, CLOUD, NLCAI, SIPRO
  - 2020 pp. 101-114, 2020",10.5121/csit.2020.101009,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We apply the concept of users' emotion vectors (UVECs) and movies' emotion
vectors (MVECs) as building components of Emotion Aware Recommender System. We
built a comparative platform that consists of five recommenders based on
content-based and collaborative filtering algorithms. We employed a Tweets
Affective Classifier to classify movies' emotion profiles through movie
overviews. We construct MVECs from the movie emotion profiles. We track users'
movie watching history to formulate UVECs by taking the average of all the
MVECs from all the movies a user has watched. With the MVECs, we built an
Emotion Aware Recommender as one of the comparative platforms' algorithms. We
evaluated the top-N recommendation lists generated by these Recommenders and
found the top-N list of Emotion Aware Recommender showed serendipity
recommendations.
","[{'version': 'v1', 'created': 'Fri, 3 Jul 2020 01:43:29 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Jul 2020 13:02:01 GMT'}]",2020-07-29,"[['Leung', 'John Kalung', ''], ['Griva', 'Igor', ''], ['Kennedy', 'William G.', '']]","['Context-Aware', 'Emotion Text Mining', 'Affective Computing', 'Recommender Systems', 'Machine Learning']"
11792,2104.11847,A K M Nuhil Mehdy,"A K M Nuhil Mehdy, Michael D. Ekstrand, Bart P. Knijnenburg, Hoda
  Mehrpouyan","Privacy as a Planned Behavior: Effects of Situational Factors on Privacy
  Perceptions and Plans","10 pages, 5 figures, ACM UMAP 2021",,10.1145/3450613.3456829,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To account for privacy perceptions and preferences in user models and develop
personalized privacy systems, we need to understand how users make privacy
decisions in various contexts. Existing studies of privacy perceptions and
behavior focus on overall tendencies toward privacy, but few have examined the
context-specific factors in privacy decision making. We conducted a survey on
Mechanical Turk (N=401) based on the theory of planned behavior (TPB) to
measure the way users' perceptions of privacy factors and intent to disclose
information are affected by three situational factors embodied hypothetical
scenarios: information type, recipients' role, and trust source. Results showed
a positive relationship between subjective norms and perceived behavioral
control, and between each of these and situational privacy attitude; all three
constructs are significantly positively associated with intent to disclose.
These findings also suggest that, situational factors predict participants'
privacy decisions through their influence on the TPB constructs.
","[{'version': 'v1', 'created': 'Sat, 24 Apr 2021 00:50:40 GMT'}]",2021-04-27,"[['Mehdy', 'A K M Nuhil', ''], ['Ekstrand', 'Michael D.', ''], ['Knijnenburg', 'Bart P.', ''], ['Mehrpouyan', 'Hoda', '']]","['privacy', 'decision making', 'behavior modeling', 'situational factors']"
11793,2203.06955,Romain Fouquet,"Romain Fouquet (SPIRALS), Pierre Laperdrix (CNRS, SPIRALS), Romain
  Rouvoy (SPIRALS)","JSRehab: Weaning Common Web Interface Components from JavaScript
  Addiction","WWW '22 Companion, May 2022, Lyon, France",,10.1145/3487553.3524227,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Leveraging JavaScript (JS) for User Interface (UI) interactivity has been the
norm on the web for many years. Yet, using JS increases bandwidth and battery
consumption as scripts need to be downloaded and processed by the browser.
Plus, client-side JS may expose visitors to security vulnerabilities such as
Cross-Site Scripting (XSS).This paper introduces a new server-side plugin,
called JSRehab, that automatically rewrites common web interface components by
alternatives that do not require any JavaScript (JS). The main objective of
JSRehab is to drastically reduce-and ultimately remove-the inclusion of JS in a
web page to improve its responsiveness and consume less resources. We report on
our implementation of JS-Rehab for Bootstrap, the most popular UI framework by
far, and evaluate it on a corpus of 100 webpages. We show through manual
validation that it is indeed possible to lower the dependencies of pages on JS
while keeping intact its interactivity and accessibility. We observe that
JSRehab brings energy savings of at least 5 % for the majority of web pages on
the tested devices, while introducing a median on-the-wire overhead of only 5 %
to the HTML payload.
","[{'version': 'v1', 'created': 'Mon, 14 Mar 2022 09:40:31 GMT'}]",2022-03-15,"[['Fouquet', 'Romain', '', 'SPIRALS'], ['Laperdrix', 'Pierre', '', 'CNRS, SPIRALS'], ['Rouvoy', 'Romain', '', 'SPIRALS']]","['web security', 'web framework', 'javascript', 'content security policy', 'web accessibility', 'mobile web', 'energy savings']"
11794,2002.03563,Seyed Mohammad Hadi Hosseini,"S. M. Hadi Hosseini, Hao Chen, Monica M. Jablonski","Automatic detection and counting of retina cell nuclei using deep
  learning","13 pages, 11 figures, 2 tables, SPIE. Medical Imaging 2020 Conference","Proceedings Volume 11317, Medical Imaging 2020: Biomedical
  Applications in Molecular, Structural, and Functional Imaging; 113172I (2020)",10.1117/12.2567454,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ability to automatically detect, classify, calculate the size, number,
and grade of retinal cells and other biological objects is critically important
in eye disease like age-related macular degeneration (AMD). In this paper, we
developed an automated tool based on deep learning technique and Mask R-CNN
model to analyze large datasets of transmission electron microscopy (TEM)
images and quantify retinal cells with high speed and precision. We considered
three categories for outer nuclear layer (ONL) cells: live, intermediate, and
pyknotic. We trained the model using a dataset of 24 samples. We then optimized
the hyper-parameters using another set of 6 samples. The results of this
research, after applying to the test datasets, demonstrated that our method is
highly accurate for automatically detecting, categorizing, and counting cell
nuclei in the ONL of the retina. Performance of our model was tested using
general metrics: general mean average precision (mAP) for detection; and
precision, recall, F1-score, and accuracy for categorizing and counting.
","[{'version': 'v1', 'created': 'Mon, 10 Feb 2020 05:49:10 GMT'}]",2020-10-01,"[['Hosseini', 'S. M. Hadi', ''], ['Chen', 'Hao', ''], ['Jablonski', 'Monica M.', '']]","['Cell nuclei detection', 'cell counting', 'object detection', 'deep learning', 'mask R-CNN']"
11795,1805.03549,Thomas Vogel,"Sona Ghahremani, Holger Giese, Thomas Vogel","Efficient Utility-Driven Self-Healing Employing Adaptation Rules for
  Large Dynamic Architectures",,"International Conference on Autonomic Computing. ICAC '17. IEEE,
  2017, pp. 59-68",10.1109/ICAC.2017.35,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-adaptation can be realized in various ways. Rule-based approaches
prescribe the adaptation to be executed if the system or environment satisfy
certain conditions and result in scalable solutions, however, with often only
satisfying adaptation decisions. In contrast, utility-driven approaches
determine optimal adaptation decisions by using an often costly optimization
step, which typically does not scale well for larger problems. We propose a
rule-based and utility-driven approach that achieves the beneficial properties
of each of these directions such that the adaptation decisions are optimal
while the computation remains scalable since an expensive optimization step can
be avoided. The approach can be used for the architecture-based self-healing of
large software systems. We define the utility for large dynamic architectures
of such systems based on patterns capturing issues the self-healing must
address and we use patternbased adaptation rules to resolve the issues.
Defining the utility as well as the adaptation rules pattern-based allows us to
compute the impact of each rule application on the overall utility and to
realize an incremental and efficient utility-driven self-healing. We
demonstrate the efficiency and optimality of our scheme in comparative
experiments with a static rule-based scheme as a baseline and a utility-driven
approach using a constraint solver.
","[{'version': 'v1', 'created': 'Wed, 9 May 2018 14:19:06 GMT'}]",2018-05-10,"[['Ghahremani', 'Sona', ''], ['Giese', 'Holger', ''], ['Vogel', 'Thomas', '']]","['self-healing', 'adaptation rules', 'architecture-basedadaptation', 'utility']"
11796,2211.13827,Marcos Kalinowski,"Bruna Ferreira, Silvio Marques, Marcos Kalinowski, Helio Lopes, Simone
  D. J. Barbosa","Lessons Learned to Improve the UX Practices in Agile Projects Involving
  Data Science and Process Automation",,"Information and Software Technology Journal, 2022",10.1016/j.infsof.2022.107106,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: User-Centered Design and Agile methodologies focus on human issues.
Nevertheless, agile methodologies focus on contact with contracting customers
and generating value for them. Usually, the communication between end users and
the agile team is mediated by customers. However, they do not know the problems
end users face in their routines. Hence, UX issues are typically identified
only after the implementation, during user testing and validation. Objective:
Aiming to improve the understanding and definition of the problem in agile
projects, this research investigates the practices and difficulties experienced
by agile teams during the development of data science and process automation
projects. Also, we analyze the benefits and the teams' perceptions regarding
user participation in these projects. Method: We collected data from four agile
teams in an academia-industry collaboration focusing on delivering data science
and process automation solutions. Therefore, we applied a carefully designed
questionnaire answered by developers, scrum masters, and UX designers. In
total, 18 subjects answered the questionnaire. Results: From the results, we
identify practices used by the teams to define and understand the problem and
to represent the solution. The practices most often used are prototypes and
meetings with stakeholders. Another practice that helped the team to understand
the problem was using Lean Inceptions. Also, our results present some specific
issues regarding data science projects. Conclusion: We observed that end-user
participation can be critical to understanding and defining the problem. They
help to define elements of the domain and barriers in the implementation. We
identified a need for approaches that facilitate user-team communication in
data science projects and the need for more detailed requirements
representations to support data science solutions.
","[{'version': 'v1', 'created': 'Thu, 24 Nov 2022 23:43:30 GMT'}]",2022-11-28,"[['Ferreira', 'Bruna', ''], ['Marques', 'Silvio', ''], ['Kalinowski', 'Marcos', ''], ['Lopes', 'Helio', ''], ['Barbosa', 'Simone D. J.', '']]","['Agile', 'User-Centered Design', 'Lean Inception', 'User Involvement', 'User Participation', 'User Experience', 'Data Science']"
11797,2209.14598,Bla\v{z} \v{S}krlj,"Bla\v{z} \v{S}krlj, Adi Schwartz, Jure Ferle\v{z}, Davorin Kopi\v{c}
  and Naama Ziporin","Dynamic Surrogate Switching: Sample-Efficient Search for Factorization
  Machine Configurations in Online Recommendations",https://dl.acm.org/doi/abs/10.1145/3523227.3547384,,10.1145/3523227.3547384,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Hyperparameter optimization is the process of identifying the appropriate
hyperparameter configuration of a given machine learning model with regard to a
given learning task. For smaller data sets, an exhaustive search is possible;
However, when the data size and model complexity increase, the number of
configuration evaluations becomes the main computational bottleneck. A
promising paradigm for tackling this type of problem is surrogate-based
optimization. The main idea underlying this paradigm considers an incrementally
updated model of the relation between the hyperparameter space and the output
(target) space; the data for this model are obtained by evaluating the main
learning engine, which is, for example, a factorization machine-based model. By
learning to approximate the hyperparameter-target relation, the surrogate
(machine learning) model can be used to score large amounts of hyperparameter
configurations, exploring parts of the configuration space beyond the reach of
direct machine learning engine evaluation. Commonly, a surrogate is selected
prior to optimization initialization and remains the same during the search. We
investigated whether dynamic switching of surrogates during the optimization
itself is a sensible idea of practical relevance for selecting the most
appropriate factorization machine-based models for large-scale online
recommendation. We conducted benchmarks on data sets containing hundreds of
millions of instances against established baselines such as Random Forest- and
Gaussian process-based surrogates. The results indicate that surrogate
switching can offer good performance while considering fewer learning engine
evaluations.
","[{'version': 'v1', 'created': 'Thu, 29 Sep 2022 07:29:38 GMT'}]",2022-09-30,"[['Škrlj', 'Blaž', ''], ['Schwartz', 'Adi', ''], ['Ferlež', 'Jure', ''], ['Kopič', 'Davorin', ''], ['Ziporin', 'Naama', '']]","['online learning', 'data mining', 'hyperparameter optimization', 'surrogate models', 'AutoML']"
11798,1401.5996,Jose Teixeira,Jose Teixeira and Tingting Lin,Collaboration in the open-source arena: The WebKit case,"As submitted to ACM SIG MIS Computers and People Research (CPR) May
  29 - 31, 2014 Singapore",,10.1145/2599990.2600009,,cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In an era of software crisis, the move of firms towards distributed software
development teams is being challenged by emerging collaboration issues. On this
matter, the open-source phenomenon may shed some light, as successful cases on
distributed collaboration in the open-source community have been recurrently
reported. In this paper, we explore the collaboration networks in the WebKit
open-source project, by mining WebKit's source-code version-control-system data
with Social Network Analysis (SNA). Our approach allows us to observe how key
events in the mobile-device industry have affected the WebKit collaboration
network over time. With our findings, we show the explanation power from
network visualizations capturing the collaborative dynamics of a high-networked
software project over time; and highlight the power of the open-source fork
concept as a nexus enabling both features of competition and collaboration. We
also reveal the WebKit project as a valuable research site manifesting the
novel notion of open-coopetition, where rival firms collaborate with
competitors in the open-source community.
","[{'version': 'v1', 'created': 'Thu, 23 Jan 2014 15:11:46 GMT'}]",2014-08-15,"[['Teixeira', 'Jose', ''], ['Lin', 'Tingting', '']]","['Free-software', 'open-source', 'distributed  software  development', 'software ecosystem', 'WebKit', 'coopetition', 'open-coopetition']"
11799,2102.12994,Yang Sun,"Yang Sun, Junwei Pan, Alex Zhang, Aaron Flores",$FM^2$: Field-matrixed Factorization Machines for Recommender Systems,"In Proceedings of the Web Conference 2021 (WWW 2021), April 19-23,
  2021, Ljubljana, Slovenia. 10 pages",,10.1145/3442381.3449930,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Click-through rate (CTR) prediction plays a critical role in recommender
systems and online advertising. The data used in these applications are
multi-field categorical data, where each feature belongs to one field. Field
information is proved to be important and there are several works considering
fields in their models. In this paper, we proposed a novel approach to model
the field information effectively and efficiently. The proposed approach is a
direct improvement of FwFM, and is named as Field-matrixed Factorization
Machines (FmFM, or $FM^2$). We also proposed a new explanation of FM and FwFM
within the FmFM framework, and compared it with the FFM. Besides pruning the
cross terms, our model supports field-specific variable dimensions of embedding
vectors, which acts as soft pruning. We also proposed an efficient way to
minimize the dimension while keeping the model performance. The FmFM model can
also be optimized further by caching the intermediate vectors, and it only
takes thousands of floating-point operations (FLOPs) to make a prediction. Our
experiment results show that it can out-perform the FFM, which is more complex.
The FmFM model's performance is also comparable to DNN models which require
much more FLOPs in runtime.
","[{'version': 'v1', 'created': 'Sat, 20 Feb 2021 00:03:37 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Mar 2021 17:19:47 GMT'}]",2021-03-22,"[['Sun', 'Yang', ''], ['Pan', 'Junwei', ''], ['Zhang', 'Alex', ''], ['Flores', 'Aaron', '']]","['Recommender Systems', 'Factorization Machines', 'CTR prediction']"
11800,1909.03346,K. R. Jayaram,K. R. Jayaram,Elastic Remote Methods,ACM MIDDLEWARE 2013,"Middleware 2013. Lecture Notes in Computer Science, vol 8275.
  Springer, Berlin, Heidelberg",10.1007/978-3-642-45065-5_8,,cs.DC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For distributed applications to take full advantage of cloud computing
systems, we need middleware systems
  that allow developers to build elasticity management components right into
the applications.
  This paper describes the design and implementation of ElasticRMI, a
middleware system that (1) enables application developers to dynamically change
the number of (server) objects available to handle remote method invocations
with respect to the application's workload, without requiring major changes to
clients (invokers) of remote methods, (2) enables flexible elastic scaling by
allowing developers to use a combination of resource utilization metrics and
fine-grained application-specific information like the properties of internal
data structures to drive scaling decisions, (3) provides a high-level
programming framework that handles elasticity at the level of classes and
objects, masking low-level platform specific tasks (like provisioning VM
images) from the developer, and (4) increases the portability of ElasticRMI
applications across different private data centers/IaaS clouds through Apache
Mesos.
","[{'version': 'v1', 'created': 'Sat, 7 Sep 2019 22:20:07 GMT'}]",2019-09-10,"[['Jayaram', 'K. R.', '']]","['programmable elasticity', 'scalability', 'distributed objects']"
11801,2004.09831,Daniel Graziotin,"Simone V. Spiegler, Daniel Graziotin, Christoph Heinecke, Stefan
  Wagner","A Quantitative Exploration of the 9-Factor Theory: Distribution of
  Leadership Roles between Scrum Master and Agile Team","17 pages, 4 figures. To appear in International Conference on Agile
  Software Development 2020 (XP 2020)","Agile Processes in Software Engineering and Extreme Programming.
  XP 2020. Lecture Notes in Business Information Processing, vol 383. Springer,
  Cham",10.1007/978-3-030-49392-9_11,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A number of qualitative studies find that team leadership is one essential
success factor for evolving into a mature agile team. One such qualitative
study suggests the 9-Factor Theory of Scrum Master roles, which claims that the
Scrum Master performs a set of 9 leadership roles which are transferred to the
team over time (Spiegler et al., 2019). We aimed at conducting a quantitative
exploration that examines the presence and change of the 9-Factory Theory in
relation to team maturity. We conducted an online survey with 67 individuals at
the conglomerate Robert Bosch GmbH. Descriptive statistics reveal that the
Scrum Master and the agile team score differently on the 9 factors and that the
Scrum Master role is most often distributed in teams that had been working
between 3 and 5 months in an agile manner. Yet, we also find that the
leadership roles predominantly remain with one dedicated Scrum Master. Based on
our results we suggest to group the 9-Factor Theory into three clusters: the
Scrum Master is rather linked to psychological team factors (1), while the team
tends to be linked to rather product-related factors (2). Organizational
factors (3) are less often present. Our practical implications suggest an
extension of the Scrum Master description. Furthermore, our study lays
groundwork for future quantitative testing of leadership in agile teams.
","[{'version': 'v1', 'created': 'Tue, 21 Apr 2020 08:55:47 GMT'}]",2022-04-15,"[['Spiegler', 'Simone V.', ''], ['Graziotin', 'Daniel', ''], ['Heinecke', 'Christoph', ''], ['Wagner', 'Stefan', '']]","['leadership', 'Scrum Master', 'maturity', 'agile teams', 'quantitative survey']"
11802,2205.02177,"Sebastian M\""uller","Sebastian M\""uller, Andreas Penzkofer, Nikita Polyanskii, Jonas Theis,
  William Sanders, Hans Moog",Tangle 2.0 Leaderless Nakamoto Consensus on the Heaviest DAG,"revised version, to appear in IEEE Access",,10.1109/ACCESS.2022.3211422,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  We introduce the theoretical foundations of the Tangle 2.0, a probabilistic
leaderless consensus protocol based on a directed acyclic graph (DAG) called
the Tangle. The Tangle naturally succeeds the blockchain as its next
evolutionary step as it offers features suited to establish more efficient and
scalable distributed ledger solutions.
  Consensus is no longer found in the longest chain but on the heaviest DAG,
where PoW is replaced by a stake- or reputation-based weight function. The DAG
structure and the underlying Reality-based UTXO Ledger allow parallel
validation of transactions without the need for total ordering. Moreover, it
enables the removal of the intermediary of miners and validators, allowing a
pure two-step process that follows the \emph{propose-vote} paradigm at the node
level and not at the validator level.
  We propose a framework to analyse liveness and safety under different
communication and adversary models. This allows providing impossibility results
in some edge cases and in the asynchronous communication model. We provide
formal proof of the security of the protocol assuming a common random coin.
","[{'version': 'v1', 'created': 'Wed, 4 May 2022 16:46:53 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Oct 2022 10:15:10 GMT'}]",2022-10-13,"[['Müller', 'Sebastian', ''], ['Penzkofer', 'Andreas', ''], ['Polyanskii', 'Nikita', ''], ['Theis', 'Jonas', ''], ['Sanders', 'William', ''], ['Moog', 'Hans', '']]","['consensus protocol', 'leaderless', 'asynchronous', 'faulttolerance', 'directed acyclic graph', 'security']"
11803,2202.03013,Wenqiang Li,"Wenqiang Li, Jiameng Shi, Fengjun Li, Jingqiang Lin, Wei Wang, Le Guan","$\mu$AFL: Non-intrusive Feedback-driven Fuzzing for Microcontroller
  Firmware",44th International Conference on Software Engineering (ICSE 2022),,10.1145/3510003.3510208,,cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fuzzing is one of the most effective approaches to finding software flaws.
However, applying it to microcontroller firmware incurs many challenges. For
example, rehosting-based solutions cannot accurately model peripheral behaviors
and thus cannot be used to fuzz the corresponding driver code. In this work, we
present $\mu$AFL, a hardware-in-the-loop approach to fuzzing microcontroller
firmware. It leverages debugging tools in existing embedded system development
to construct an AFL-compatible fuzzing framework. Specifically, we use the
debug dongle to bridge the fuzzing environment on the PC and the target
firmware on the microcontroller device. To collect code coverage information
without costly code instrumentation, $\mu$AFL relies on the ARM ETM hardware
debugging feature, which transparently collects the instruction trace and
streams the results to the PC. However, the raw ETM data is obscure and needs
enormous computing resources to recover the actual instruction flow. We
therefore propose an alternative representation of code coverage, which retains
the same path sensitivity as the original AFL algorithm, but can directly work
on the raw ETM data without matching them with disassembled instructions. To
further reduce the workload, we use the DWT hardware feature to selectively
collect runtime information of interest. We evaluated $\mu$AFL on two real
evaluation boards from two major vendors: NXP and STMicroelectronics. With our
prototype, we discovered ten zero-day bugs in the driver code shipped with the
SDK of STMicroelectronics and three zero-day bugs in the SDK of NXP. Eight CVEs
have been allocated for them. Considering the wide adoption of vendor SDKs in
real products, our results are alarming.
","[{'version': 'v1', 'created': 'Mon, 7 Feb 2022 09:10:24 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Feb 2022 00:40:59 GMT'}, {'version': 'v3', 'created': 'Tue, 19 Apr 2022 04:50:58 GMT'}]",2022-04-20,"[['Li', 'Wenqiang', ''], ['Shi', 'Jiameng', ''], ['Li', 'Fengjun', ''], ['Lin', 'Jingqiang', ''], ['Wang', 'Wei', ''], ['Guan', 'Le', '']]","['firmware security', 'fuzzing', 'microcontroller', 'IoT', 'ETM']"
11804,2008.00932,Hacer Yalim Keles,Ozge Mercanoglu Sincan and Hacer Yalim Keles,"AUTSL: A Large Scale Multi-modal Turkish Sign Language Dataset and
  Baseline Methods","Preprint of the accepted paper at IEEE Access Journal. The revised
  version contains empirical results with Montalbano dataset, in addition to
  AUTSL. The abstract is revised accordingly","IEEE Access (2020), vol. 8, pp. 181340-181355",10.1109/ACCESS.2020.3028072,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sign language recognition is a challenging problem where signs are identified
by simultaneous local and global articulations of multiple sources, i.e. hand
shape and orientation, hand movements, body posture, and facial expressions.
Solving this problem computationally for a large vocabulary of signs in real
life settings is still a challenge, even with the state-of-the-art models. In
this study, we present a new largescale multi-modal Turkish Sign Language
dataset (AUTSL) with a benchmark and provide baseline models for performance
evaluations. Our dataset consists of 226 signs performed by 43 different
signers and 38,336 isolated sign video samples in total. Samples contain a wide
variety of backgrounds recorded in indoor and outdoor environments. Moreover,
spatial positions and the postures of signers also vary in the recordings. Each
sample is recorded with Microsoft Kinect v2 and contains RGB, depth, and
skeleton modalities. We prepared benchmark training and test sets for user
independent assessments of the models. We trained several deep learning based
models and provide empirical evaluations using the benchmark; we used CNNs to
extract features, unidirectional and bidirectional LSTM models to characterize
temporal information. We also incorporated feature pooling modules and temporal
attention to our models to improve the performances. We evaluated our baseline
models on AUTSL and Montalbano datasets. Our models achieved competitive
results with the state-of-the-art methods on Montalbano dataset, i.e. 96.11%
accuracy. In AUTSL random train-test splits, our models performed up to 95.95%
accuracy. In the proposed user-independent benchmark dataset our best baseline
model achieved 62.02% accuracy. The gaps in the performances of the same
baseline models show the challenges inherent in our benchmark dataset. AUTSL
benchmark dataset is publicly available at https://cvml.ankara.edu.tr.
","[{'version': 'v1', 'created': 'Mon, 3 Aug 2020 15:12:05 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Oct 2020 10:31:48 GMT'}]",2020-10-20,"[['Sincan', 'Ozge Mercanoglu', ''], ['Keles', 'Hacer Yalim', '']]","['Turkish Sign language recognition', 'deep learning', 'CNN', 'LSTM', 'BLSTM', 'featurepooling', 'temporal attention']"
11805,2009.02625,Zifeng Wang,"Zifeng Wang and Rui Wen and Xi Chen and Shilei Cao and Shao-Lun Huang
  and Buyue Qian and Yefeng Zheng","Online Disease Self-diagnosis with Inductive Heterogeneous Graph
  Convolutional Networks",,,10.1145/3442381.3449795,,cs.LG cs.AI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a Healthcare Graph Convolutional Network (HealGCN) to offer
disease self-diagnosis service for online users based on Electronic Healthcare
Records (EHRs). Two main challenges are focused in this paper for online
disease diagnosis: (1) serving cold-start users via graph convolutional
networks and (2) handling scarce clinical description via a symptom retrieval
system. To this end, we first organize the EHR data into a heterogeneous graph
that is capable of modeling complex interactions among users, symptoms and
diseases, and tailor the graph representation learning towards disease
diagnosis with an inductive learning paradigm. Then, we build a disease
self-diagnosis system with a corresponding EHR Graph-based Symptom Retrieval
System (GraphRet) that can search and provide a list of relevant alternative
symptoms by tracing the predefined meta-paths. GraphRet helps enrich the seed
symptom set through the EHR graph when confronting users with scarce
descriptions, hence yield better diagnosis accuracy. At last, we validate the
superiority of our model on a large-scale EHR dataset.
","[{'version': 'v1', 'created': 'Sun, 6 Sep 2020 01:32:14 GMT'}, {'version': 'v2', 'created': 'Sat, 13 Feb 2021 01:47:01 GMT'}]",2021-02-16,"[['Wang', 'Zifeng', ''], ['Wen', 'Rui', ''], ['Chen', 'Xi', ''], ['Cao', 'Shilei', ''], ['Huang', 'Shao-Lun', ''], ['Qian', 'Buyue', ''], ['Zheng', 'Yefeng', '']]","['disease diagnosis', 'graph neural network', 'online healthcare service']"
11806,2201.06147,Jaime P\'erez,"Jaime P\'erez, Patricia Arroba and Jos\'e M. Moya","Data augmentation through multivariate scenario forecasting in Data
  Centers using Generative Adversarial Networks",,Appl Intell (2022),10.1007/s10489-022-03557-6,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  The Cloud paradigm is at a critical point in which the existing
energy-efficiency techniques are reaching a plateau, while the computing
resources demand at Data Center facilities continues to increase exponentially.
The main challenge in achieving a global energy efficiency strategy based on
Artificial Intelligence is that we need massive amounts of data to feed the
algorithms. This paper proposes a time-series data augmentation methodology
based on synthetic scenario forecasting within the Data Center. For this
purpose, we will implement a powerful generative algorithm: Generative
Adversarial Networks (GANs). Specifically, our work combines the disciplines of
GAN-based data augmentation and scenario forecasting, filling the gap in the
generation of synthetic data in DCs. Furthermore, we propose a methodology to
increase the variability and heterogeneity of the generated data by introducing
on-demand anomalies without additional effort or expert knowledge. We also
suggest the use of Kullback-Leibler Divergence and Mean Squared Error as new
metrics in the validation of synthetic time series generation, as they provide
a better overall comparison of multivariate data distributions. We validate our
approach using real data collected in an operating Data Center, successfully
generating synthetic data helpful for prediction and optimization models. Our
research will help optimize the energy consumed in Data Centers, although the
proposed methodology can be employed in any similar time-series-like problem.
","[{'version': 'v1', 'created': 'Wed, 12 Jan 2022 15:09:10 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Mar 2022 11:25:06 GMT'}]",2022-05-05,"[['Pérez', 'Jaime', ''], ['Arroba', 'Patricia', ''], ['Moya', 'José M.', '']]","['Data Augmentation', 'Sensor Data', 'Data Center', 'GenerativeAdversarial Networks', 'Synthetic Data', 'Scenario Forecasting']"
11807,1905.05940,Dean Zadok,"Dean Zadok, Tom Hirshberg, Amir Biran, Kira Radinsky, Ashish Kapoor","Explorations and Lessons Learned in Building an Autonomous Formula SAE
  Car from Simulations",,,10.5220/0008120604140421,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the exploration and learnings during the process of
developing a self-driving algorithm in simulation, followed by deployment on a
real car. We specifically concentrate on the Formula Student Driverless
competition. In such competitions, a formula race car, designed and built by
students, is challenged to drive through previously unseen tracks that are
marked by traffic cones. We explore and highlight the challenges associated
with training a deep neural network that uses a single camera as input for
inferring car steering angles in real-time. The paper explores in-depth
creation of simulation, usage of simulations to train and validate the software
stack and then finally the engineering challenges associated with the
deployment of the system in real-world.
","[{'version': 'v1', 'created': 'Wed, 15 May 2019 04:17:48 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Jun 2019 17:52:09 GMT'}]",2020-01-24,"[['Zadok', 'Dean', ''], ['Hirshberg', 'Tom', ''], ['Biran', 'Amir', ''], ['Radinsky', 'Kira', ''], ['Kapoor', 'Ashish', '']]","['Autonomous Driving', 'Imitation Learning', 'Deep Neural Networks']"
11808,2201.05649,Achintha Ihalage,Achintha Ihalage and Yang Hao,"Formula graph self-attention network for representation-domain
  independent materials discovery",,,10.1002/advs.202200164,,cs.LG cond-mat.mtrl-sci,http://creativecommons.org/licenses/by/4.0/,"  The success of machine learning (ML) in materials property prediction depends
heavily on how the materials are represented for learning. Two dominant
families of material descriptors exist, one that encodes crystal structure in
the representation and the other that only uses stoichiometric information with
the hope of discovering new materials. Graph neural networks (GNNs) in
particular have excelled in predicting material properties within chemical
accuracy. However, current GNNs are limited to only one of the above two
avenues owing to the little overlap between respective material
representations. Here, we introduce a new concept of formula graph which
unifies stoichiometry-only and structure-based material descriptors. We further
develop a self-attention integrated GNN that assimilates a formula graph and
show that the proposed architecture produces material embeddings transferable
between the two domains. Our model can outperform some previously proposed
structure-agnostic models and their structure-based counterparts while
exhibiting better sample efficiency and faster convergence. Finally, the model
is applied in a challenging exemplar to predict the complex dielectric function
of materials and nominate new substances that potentially exhibit
epsilon-near-zero phenomena.
","[{'version': 'v1', 'created': 'Fri, 14 Jan 2022 19:49:45 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Apr 2022 13:00:26 GMT'}]",2022-04-05,"[['Ihalage', 'Achintha', ''], ['Hao', 'Yang', '']]","['graph-network', 'attention', 'epsilon-near-zero', 'materials-informatics', 'machine-learning']"
11809,1708.04632,"Didem G\""oz\""upek","T{\i}naz Ekim, Didem G\""oz\""upek, Ademir Hujdurovi\'c, Martin
  Milani\v{c}",On Almost Well-Covered Graphs of Girth at Least 6,,"Discrete Mathematics & Theoretical Computer Science, vol. 20 no.
  2, Graph Theory (November 20, 2018) dmtcs:4982",10.23638/DMTCS-20-2-17,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a relaxation of the concept of well-covered graphs, which are
graphs with all maximal independent sets of the same size. The extent to which
a graph fails to be well-covered can be measured by its independence gap,
defined as the difference between the maximum and minimum sizes of a maximal
independent set in $G$. While the well-covered graphs are exactly the graphs of
independence gap zero, we investigate in this paper graphs of independence gap
one, which we also call almost well-covered graphs. Previous works due to
Finbow et al. (1994) and Barbosa et al. (2013) have implications for the
structure of almost well-covered graphs of girth at least $k$ for $k\in
\{7,8\}$. We focus on almost well-covered graphs of girth at least $6$. We show
that every graph in this class has at most two vertices each of which is
adjacent to exactly $2$ leaves. We give efficiently testable characterizations
of almost well-covered graphs of girth at least $6$ having exactly one or
exactly two such vertices. Building on these results, we develop a
polynomial-time recognition algorithm of almost well-covered
$\{C_3,C_4,C_5,C_7\}$-free graphs.
","[{'version': 'v1', 'created': 'Tue, 15 Aug 2017 18:12:14 GMT'}, {'version': 'v2', 'created': 'Thu, 17 May 2018 10:19:07 GMT'}, {'version': 'v3', 'created': 'Wed, 24 Oct 2018 18:50:16 GMT'}, {'version': 'v4', 'created': 'Sat, 17 Nov 2018 06:28:51 GMT'}]",2019-03-14,"[['Ekim', 'Tınaz', ''], ['Gözüpek', 'Didem', ''], ['Hujdurović', 'Ademir', ''], ['Milanič', 'Martin', '']]","['maximal independent set', 'almost well-covered graph', 'independence gap', 'girth']"
11810,2010.08094,Navod Thilakarathne,"Navod Neranjan Thilakarathne, Mohan Krishna Kagita, Dr. Surekha Lanka,
  Hussain Ahmad","Smart Grid: A Survey of Architectural Elements, Machine Learning and
  Deep Learning Applications and Future Directions",,,10.5281/zenodo.5202741,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Smart grid (SG), generally known as the next-generation power grid
emerged as a replacement for ill-suited power systems in the 21st century. It
is in-tegrated with advanced communication and computing capabilities, thus it
is ex-pected to enhance the reliability and the efficiency of energy
distribution with minimum effects. With the massive infrastructure it holds and
the underlying communication network in the system, it introduced a large
volume of data that demands various techniques for proper analysis and decision
making. Big data analytics, machine learning (ML), and deep learning (DL) plays
a key role when it comes to the analysis of this massive amount of data and
generation of valuable insights. This paper explores and surveys the Smart grid
architectural elements, machine learning, and deep learning-based applications
and approaches in the context of the Smart grid. In addition in terms of
machine learning-based data an-alytics, this paper highlights the limitations
of the current research and highlights future directions as well.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2020 01:40:24 GMT'}]",2021-08-17,"[['Thilakarathne', 'Navod Neranjan', ''], ['Kagita', 'Mohan Krishna', ''], ['Lanka', 'Dr. Surekha', ''], ['Ahmad', 'Hussain', '']]","['Smart Grid', 'Internet of Things', 'Machine Learning', 'Deep Learning', 'Cyber Physical System']"
11811,2103.04448,Yang Shi,"Yang Shi, Krupal Shah, Wengran Wang, Samiha Marwan, Poorvaja Penmetsa
  and Thomas W. Price",Toward Semi-Automatic Misconception Discovery Using Code Embeddings,"7 pages, 3 figures, Accepted in LAK'21",,10.1145/3448139.3448205,,cs.LG cs.CY cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Understanding students' misconceptions is important for effective teaching
and assessment. However, discovering such misconceptions manually can be
time-consuming and laborious. Automated misconception discovery can address
these challenges by highlighting patterns in student data, which domain experts
can then inspect to identify misconceptions. In this work, we present a novel
method for the semi-automated discovery of problem-specific misconceptions from
students' program code in computing courses, using a state-of-the-art code
classification model. We trained the model on a block-based programming dataset
and used the learned embedding to cluster incorrect student submissions. We
found these clusters correspond to specific misconceptions about the problem
and would not have been easily discovered with existing approaches. We also
discuss potential applications of our approach and how these misconceptions
inform domain-specific insights into students' learning processes.
","[{'version': 'v1', 'created': 'Sun, 7 Mar 2021 20:32:41 GMT'}]",2021-03-09,"[['Shi', 'Yang', ''], ['Shah', 'Krupal', ''], ['Wang', 'Wengran', ''], ['Marwan', 'Samiha', ''], ['Penmetsa', 'Poorvaja', ''], ['Price', 'Thomas W.', '']]","['Neural Network', 'Code Analysis', 'Automatic Assessment', 'LearningRepresentation']"
11812,1905.07767,Ahmet Bozkir,"Firat Coskun Dalgic, Ahmet Selman Bozkir, Murat Aydos","Phish-IRIS: A New Approach for Vision Based Brand Prediction of Phishing
  Web Pages via Compact Visual Descriptors","2nd International Symposium on Multidisciplinary Studies and
  Innovation Technologies, ISMSIT 2018",,10.1109/ISMSIT.2018.8567299,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Phishing, a continuously growing cyber threat, aims to obtain innocent users'
credentials by deceiving them via presenting fake web pages which mimic their
legitimate targets. To date, various attempts have been carried out in order to
detect phishing pages. In this study, we treat the problem of phishing web page
identification as an image classification task and propose a machine learning
augmented pure vision based approach which extracts and classifies compact
visual features from web page screenshots. For this purpose, we employed
several MPEG7 and MPEG7-like compact visual descriptors (SCD, CLD, CEDD, FCTH
and JCD) to reveal color and edge based discriminative visual cues. Throughout
the feature extraction process we have followed two different schemes working
on either whole screenshots in a ""holistic"" manner or equal sized ""patches""
constructing a coarse-to-fine ""pyramidal"" representation. Moreover, for the
task of image classification, we have built SVM and Random Forest based machine
learning models. In order to assess the performance and generalization
capability of the proposed approach, we have collected a mid-sized corpus
covering 14 distinct brands and involving 2852 samples. According to the
conducted experiments, our approach reaches up to 90.5% F1 score via SCD. As a
result, compared to other studies, the suggested approach presents a
lightweight schema serving competitive accuracy and superior feature extraction
and inferring speed that enables it to be used as a browser plugin.
","[{'version': 'v1', 'created': 'Sun, 19 May 2019 16:28:51 GMT'}]",2019-05-21,"[['Dalgic', 'Firat Coskun', ''], ['Bozkir', 'Ahmet Selman', ''], ['Aydos', 'Murat', '']]","['Phishing', 'MPEG-7', 'Machine Learning', 'Computer Vision', 'Information Security']"
11813,2203.00112,John Palowitch,"John Palowitch, Anton Tsitsulin, Brandon Mayer, Bryan Perozzi",GraphWorld: Fake Graphs Bring Real Insights for GNNs,Uploading KDD camera-ready version,,10.1145/3534678.3539203,,cs.LG cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Despite advances in the field of Graph Neural Networks (GNNs), only a small
number (~5) of datasets are currently used to evaluate new models. This
continued reliance on a handful of datasets provides minimal insight into the
performance differences between models, and is especially challenging for
industrial practitioners who are likely to have datasets which look very
different from those used as academic benchmarks. In the course of our work on
GNN infrastructure and open-source software at Google, we have sought to
develop improved benchmarks that are robust, tunable, scalable,and
generalizable. In this work we introduce GraphWorld, a novel methodology and
system for benchmarking GNN models on an arbitrarily-large population of
synthetic graphs for any conceivable GNN task. GraphWorld allows a user to
efficiently generate a world with millions of statistically diverse datasets.
It is accessible, scalable, and easy to use. GraphWorld can be run on a single
machine without specialized hardware, or it can be easily scaled up to run on
arbitrary clusters or cloud frameworks. Using GraphWorld, a user has
fine-grained control over graph generator parameters, and can benchmark
arbitrary GNN models with built-in hyperparameter tuning. We present insights
from GraphWorld experiments regarding the performance characteristics of tens
of thousands of GNN models over millions of benchmark datasets. We further show
that GraphWorld efficiently explores regions of benchmark dataset space
uncovered by standard benchmarks, revealing comparisons between models that
have not been historically obtainable. Using GraphWorld, we also are able to
study in-detail the relationship between graph properties and task performance
metrics, which is nearly impossible with the classic collection of real-world
benchmarks.
","[{'version': 'v1', 'created': 'Mon, 28 Feb 2022 22:00:02 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jul 2022 21:37:00 GMT'}]",2022-07-11,"[['Palowitch', 'John', ''], ['Tsitsulin', 'Anton', ''], ['Mayer', 'Brandon', ''], ['Perozzi', 'Bryan', '']]","['graph neural networks', 'graph learning benchmarks', 'synthetic graphs', 'machine learning datasets', 'machine learning evaluation']"
11814,2004.03951,Zhongchen Ma,Zhongchen Ma and Songcan Chen,"Expand Globally, Shrink Locally: Discriminant Multi-label Learning with
  Missing Labels","Accepted by Pattern Recognition. arXiv admin note: text overlap with
  arXiv:1704.01415 by other authors",,10.1016/j.patcog.2020.107675,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In multi-label learning, the issue of missing labels brings a major
challenge. Many methods attempt to recovery missing labels by exploiting
low-rank structure of label matrix. However, these methods just utilize global
low-rank label structure, ignore both local low-rank label structures and label
discriminant information to some extent, leaving room for further performance
improvement. In this paper, we develop a simple yet effective discriminant
multi-label learning (DM2L) method for multi-label learning with missing
labels. Specifically, we impose the low-rank structures on all the predictions
of instances from the same labels (local shrinking of rank), and a maximally
separated structure (high-rank structure) on the predictions of instances from
different labels (global expanding of rank). In this way, these imposed
low-rank structures can help modeling both local and global low-rank label
structures, while the imposed high-rank structure can help providing more
underlying discriminability. Our subsequent theoretical analysis also supports
these intuitions. In addition, we provide a nonlinear extension via using
kernel trick to enhance DM2L and establish a concave-convex objective to learn
these models. Compared to the other methods, our method involves the fewest
assumptions and only one hyper-parameter. Even so, extensive experiments show
that our method still outperforms the state-of-the-art methods.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2020 11:49:58 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Feb 2022 07:55:40 GMT'}]",2022-02-17,"[['Ma', 'Zhongchen', ''], ['Chen', 'Songcan', '']]","['Multi-label learning', 'missing labels', 'local low-rank label structure', 'global']"
11815,2202.10707,Clayton Miller,"Mahmoud Abdelrahman, Clayton Miller","Targeting occupant feedback using digital twins: Adaptive
  spatial-temporal thermal preference sampling to optimize personal comfort
  models",,Build Environ. 2022;218: 109090,10.1016/j.buildenv.2022.109090,,cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Collecting intensive longitudinal thermal preference data from building
occupants is emerging as an innovative means of characterizing the performance
of buildings and the people who use them. These techniques have occupants
giving subjective feedback using smartphones or smartwatches frequently over
the course of days or weeks. The intention is that the data will be collected
with high spatial and temporal diversity to best characterize a building and
the occupant's preferences. But in reality, leaving the occupant to respond in
an ad-hoc or fixed interval way creates unneeded survey fatigue and redundant
data. This paper outlines a scenario-based (virtual experiment) method for
optimizing data sampling using a smartwatch to achieve comparable accuracy in a
personal thermal preference model with fewer data. This method uses
BIM-extracted spatial data and Graph Neural Network-based (GNN) modeling to
find regions of similar comfort preference to identify the best scenarios for
triggering the occupant to give feedback. This method is compared to two
baseline scenarios that use conventional zoning and a generic 4x4 square meter
grid method from two field-based data sets. The results show that the proposed
Build2Vec method has an 18-23\% higher overall sampling quality than the
spaces-based and square-grid-based sampling methods. The Build2Vec method also
performs similar to the baselines when removing redundant occupant feedback
points but with better scalability potential.
","[{'version': 'v1', 'created': 'Tue, 22 Feb 2022 07:38:23 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Apr 2022 03:14:09 GMT'}]",2022-08-08,"[['Abdelrahman', 'Mahmoud', ''], ['Miller', 'Clayton', '']]","['Personal comfort models', 'Thermal comfort', 'Digital twin', 'Building information model', 'Adaptive sampling']"
11816,2008.07192,Antonio Ferrara,"Vito Walter Anelli, Yashar Deldjoo, Tommaso Di Noia, Antonio Ferrara,
  Fedelucio Narducci","How to Put Users in Control of their Data in Federated Top-N
  Recommendation with Learning to Rank","Accepted at the 36th ACM/SIGAPP Symposium on Applied Computing (SAC
  '21)",,10.1145/3412841.3442010,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Recommendation services are extensively adopted in several user-centered
applications as a tool to alleviate the information overload problem and help
users in orienteering in a vast space of possible choices. In such scenarios,
data ownership is a crucial concern since users may not be willing to share
their sensitive preferences (e.g., visited locations) with a central server.
Unfortunately, data harvesting and collection is at the basis of modern,
state-of-the-art approaches to recommendation. To address this issue, we
present FPL, an architecture in which users collaborate in training a central
factorization model while controlling the amount of sensitive data leaving
their devices. The proposed approach implements pair-wise learning-to-rank
optimization by following the Federated Learning principles, originally
conceived to mitigate the privacy risks of traditional machine learning. The
public implementation is available at https://split.to/sisinflab-fpl.
","[{'version': 'v1', 'created': 'Mon, 17 Aug 2020 10:13:15 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Nov 2020 15:45:41 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Dec 2020 20:24:20 GMT'}, {'version': 'v4', 'created': 'Tue, 22 Dec 2020 10:14:40 GMT'}]",2020-12-23,"[['Anelli', 'Vito Walter', ''], ['Deldjoo', 'Yashar', ''], ['Di Noia', 'Tommaso', ''], ['Ferrara', 'Antonio', ''], ['Narducci', 'Fedelucio', '']]","['federated learning', 'recommender systems', 'BPR', 'privacy control']"
11817,2208.12924,David Beauchemin,"Vincent Primpied, David Beauchemin, Richard Khoury",Quantifying French Document Complexity,Accepted in CAIA 2022,,10.21428/594757db.8b7cd94b,,cs.CL cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Measuring a document's complexity level is an open challenge, particularly
when one is working on a diverse corpus of documents rather than comparing
several documents on a similar topic or working on a language other than
English. In this paper, we define a methodology to measure the complexity of
French documents, using a new general and diversified corpus of texts, the
""French Canadian complexity level corpus"", and a wide range of metrics. We
compare different learning algorithms to this task and contrast their
performances and their observations on which characteristics of the texts are
more significant to their complexity. Our results show that our methodology
gives a general-purpose measurement of text complexity in French.
","[{'version': 'v1', 'created': 'Sat, 27 Aug 2022 04:12:54 GMT'}]",2022-09-01,"[['Primpied', 'Vincent', ''], ['Beauchemin', 'David', ''], ['Khoury', 'Richard', '']]","['Document Complexity', 'Readability Metrics', 'French Corpus', 'Machine']"
11818,2005.02844,Yanqiao Zhu,"Feng Yu, Yanqiao Zhu, Qiang Liu, Shu Wu, Liang Wang, Tieniu Tan","TAGNN: Target Attentive Graph Neural Networks for Session-based
  Recommendation","5 pages, accepted to SIGIR 2020, authors' version",,10.1145/3397271.3401319,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Session-based recommendation nowadays plays a vital role in many websites,
which aims to predict users' actions based on anonymous sessions. There have
emerged many studies that model a session as a sequence or a graph via
investigating temporal transitions of items in a session. However, these
methods compress a session into one fixed representation vector without
considering the target items to be predicted. The fixed vector will restrict
the representation ability of the recommender model, considering the diversity
of target items and users' interests. In this paper, we propose a novel target
attentive graph neural network (TAGNN) model for session-based recommendation.
In TAGNN, target-aware attention adaptively activates different user interests
with respect to varied target items. The learned interest representation vector
varies with different target items, greatly improving the expressiveness of the
model. Moreover, TAGNN harnesses the power of graph neural networks to capture
rich item transitions in sessions. Comprehensive experiments conducted on
real-world datasets demonstrate its superiority over state-of-the-art methods.
","[{'version': 'v1', 'created': 'Wed, 6 May 2020 14:17:05 GMT'}]",2020-05-20,"[['Yu', 'Feng', ''], ['Zhu', 'Yanqiao', ''], ['Liu', 'Qiang', ''], ['Wu', 'Shu', ''], ['Wang', 'Liang', ''], ['Tan', 'Tieniu', '']]","['Session-based recommendation', 'graph neural networks', 'target attention']"
11819,2007.14622,Yusuf Yazici,Yusuf Yazici,"Approaches to Fraud Detection on Credit Card Transactions Using
  Artificial Intelligence Methods","10 pages, 1 table, conference paper","pp. 235-244, 2020. CS & IT - CSCP 2020",10.5121/csit.2020.101018,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Credit card fraud is an ongoing problem for almost all industries in the
world, and it raises millions of dollars to the global economy each year.
Therefore, there is a number of research either completed or proceeding in
order to detect these kinds of frauds in the industry. These researches
generally use rule-based or novel artificial intelligence approaches to find
eligible solutions. The ultimate goal of this paper is to summarize
state-of-the-art approaches to fraud detection using artificial intelligence
and machine learning techniques. While summarizing, we will categorize the
common problems such as imbalanced dataset, real time working scenarios, and
feature engineering challenges that almost all research works encounter, and
identify general approaches to solve them. The imbalanced dataset problem
occurs because the number of legitimate transactions is much higher than the
fraudulent ones whereas applying the right feature engineering is substantial
as the features obtained from the industries are limited, and applying feature
engineering methods and reforming the dataset is crucial. Also, adapting the
detection system to real time scenarios is a challenge since the number of
credit card transactions in a limited time period is very high. In addition, we
will discuss how evaluation metrics and machine learning methods differentiate
among each research.
","[{'version': 'v1', 'created': 'Wed, 29 Jul 2020 06:18:57 GMT'}]",2020-07-30,"[['Yazici', 'Yusuf', '']]","['Credit Card', 'Fraud Detection', 'Machine Learning', 'Survey', 'Artificial Intelligence']"
11820,2209.13502,Matteo Dunnhofer,"Matteo Dunnhofer, Antonino Furnari, Giovanni Maria Farinella,
  Christian Micheloni",Visual Object Tracking in First Person Vision,"International Journal of Computer Vision (IJCV). arXiv admin note:
  substantial text overlap with arXiv:2108.13665",,10.1007/s11263-022-01694-6,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The understanding of human-object interactions is fundamental in First Person
Vision (FPV). Visual tracking algorithms which follow the objects manipulated
by the camera wearer can provide useful information to effectively model such
interactions. In the last years, the computer vision community has
significantly improved the performance of tracking algorithms for a large
variety of target objects and scenarios. Despite a few previous attempts to
exploit trackers in the FPV domain, a methodical analysis of the performance of
state-of-the-art trackers is still missing. This research gap raises the
question of whether current solutions can be used ``off-the-shelf'' or more
domain-specific investigations should be carried out. This paper aims to
provide answers to such questions. We present the first systematic
investigation of single object tracking in FPV. Our study extensively analyses
the performance of 42 algorithms including generic object trackers and baseline
FPV-specific trackers. The analysis is carried out by focusing on different
aspects of the FPV setting, introducing new performance measures, and in
relation to FPV-specific tasks. The study is made possible through the
introduction of TREK-150, a novel benchmark dataset composed of 150 densely
annotated video sequences. Our results show that object tracking in FPV poses
new challenges to current visual trackers. We highlight the factors causing
such behavior and point out possible research directions. Despite their
difficulties, we prove that trackers bring benefits to FPV downstream tasks
requiring short-term object tracking. We expect that generic object tracking
will gain popularity in FPV as new and FPV-specific methodologies are
investigated.
","[{'version': 'v1', 'created': 'Tue, 27 Sep 2022 16:18:47 GMT'}]",2022-10-20,"[['Dunnhofer', 'Matteo', ''], ['Furnari', 'Antonino', ''], ['Farinella', 'Giovanni Maria', ''], ['Micheloni', 'Christian', '']]","['First Person Vision', 'Egocentric Vision', 'VisualObject Tracking', 'Single Object Tracking']"
11821,1810.03143,Jelmer Wolterink,"Jelmer M. Wolterink and Robbert W. van Hamersvelt and Max A. Viergever
  and Tim Leiner and Ivana I\v{s}gum","Coronary Artery Centerline Extraction in Cardiac CT Angiography Using a
  CNN-Based Orientation Classifier",Accepted in Medical Image Analysis,,10.1016/j.media.2018.10.005,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Coronary artery centerline extraction in cardiac CT angiography (CCTA) images
is a prerequisite for evaluation of stenoses and atherosclerotic plaque. We
propose an algorithm that extracts coronary artery centerlines in CCTA using a
convolutional neural network (CNN).
  A 3D dilated CNN is trained to predict the most likely direction and radius
of an artery at any given point in a CCTA image based on a local image patch.
Starting from a single seed point placed manually or automatically anywhere in
a coronary artery, a tracker follows the vessel centerline in two directions
using the predictions of the CNN. Tracking is terminated when no direction can
be identified with high certainty.
  The CNN was trained using 32 manually annotated centerlines in a training set
consisting of 8 CCTA images provided in the MICCAI 2008 Coronary Artery
Tracking Challenge (CAT08). Evaluation using 24 test images of the CAT08
challenge showed that extracted centerlines had an average overlap of 93.7%
with 96 manually annotated reference centerlines. Extracted centerline points
were highly accurate, with an average distance of 0.21 mm to reference
centerline points. In a second test set consisting of 50 CCTA scans, 5,448
markers in the coronary arteries were used as seed points to extract single
centerlines. This showed strong correspondence between extracted centerlines
and manually placed markers. In a third test set containing 36 CCTA scans,
fully automatic seeding and centerline extraction led to extraction of on
average 92% of clinically relevant coronary artery segments.
  The proposed method is able to accurately and efficiently determine the
direction and radius of coronary arteries. The method can be trained with
limited training data, and once trained allows fast automatic or interactive
extraction of coronary artery trees from CCTA images.
","[{'version': 'v1', 'created': 'Sun, 7 Oct 2018 13:45:51 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Oct 2018 13:20:35 GMT'}]",2018-10-25,"[['Wolterink', 'Jelmer M.', ''], ['van Hamersvelt', 'Robbert W.', ''], ['Viergever', 'Max A.', ''], ['Leiner', 'Tim', ''], ['Išgum', 'Ivana', '']]","['Deep learning', 'cardiac CT angiography', 'coronary artery centerlines', 'centerline extraction']"
11822,1605.02912,Matthew England Dr,James H. Davenport and Matthew England,Need Polynomial Systems be Doubly-exponential?,"Extended Abstract for ICMS 2016 Presentation. arXiv admin note: text
  overlap with arXiv:1605.02494","In: G.M. Greuel, T. Koch, P. Paule and A. Sommese, eds.
  Mathematical Software - ICMS 2016, pp.167-164, (Lecture Notes in Computer
  Science, 9725). Springer International Publishing, 2016",10.1007/978-3-319-42432-3_20,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Polynomial Systems, or at least their algorithms, have the reputation of
being doubly-exponential in the number of variables [Mayr and Mayer, 1982],
[Davenport and Heintz, 1988]. Nevertheless, the Bezout bound tells us that that
number of zeros of a zero-dimensional system is singly-exponential in the
number of variables. How should this contradiction be reconciled?
  We first note that [Mayr and Ritscher, 2013] shows that the doubly
exponential nature of Gr\""{o}bner bases is with respect to the dimension of the
ideal, not the number of variables. This inspires us to consider what can be
done for Cylindrical Algebraic Decomposition which produces a
doubly-exponential number of polynomials of doubly-exponential degree.
  We review work from ISSAC 2015 which showed the number of polynomials could
be restricted to doubly-exponential in the (complex) dimension using McCallum's
theory of reduced projection in the presence of equational constraints. We then
discuss preliminary results showing the same for the degree of those
polynomials. The results are under primitivity assumptions whose importance we
illustrate.
","[{'version': 'v1', 'created': 'Tue, 10 May 2016 09:54:16 GMT'}]",2016-07-19,"[['Davenport', 'James H.', ''], ['England', 'Matthew', '']]","['computer algebra', 'cylindrical algebraic decomposition', 'equational constraint', 'Gr¨obner bases', 'quantifier elimination']"
11823,1710.09671,Matthew Parno,"Brendan A. West, Taylor S. Hodgdon, Matthew D. Parno, Arnold J. Song",Improved Workflow for Unsupervised Multiphase Image Segmentation,,,10.1016/j.cageo.2018.05.013,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quantitative image analysis often depends on accurate classification of
pixels through a segmentation process. However, imaging artifacts such as the
partial volume effect and sensor noise complicate the classification process.
These effects increase the pixel intensity variance of each constituent class,
causing intensities from one class to overlap with another. This increased
variance makes threshold based segmentation methods insufficient due to
ambiguous overlap regions in the pixel intensity distributions. The class
ambiguity becomes even more complex for systems with more than two
constituents, such as unsaturated moist granular media. In this paper, we
propose an image processing workflow that improves segmentation accuracy for
multiphase systems. First, the ambiguous transition regions between classes are
identified and removed, which allows for global thresholding of single-class
regions. Then the transition regions are classified using a distance function,
and finally both segmentations are combined into one classified image. This
workflow includes three methodologies for identifying transition pixels and we
demonstrate on a variety of synthetic images that these approaches are able to
accurately separate the ambiguous transition pixels from the single-class
regions. For situations with typical amounts of image noise, misclassification
errors and area differences calculated between each class of the synthetic
images and the resultant segmented images range from 0.69-1.48% and 0.01-0.74%,
respectively, showing the segmentation accuracy of this approach. We
demonstrate that we are able to accurately segment x-ray microtomography images
of moist granular media using these computationally efficient methodologies.
","[{'version': 'v1', 'created': 'Thu, 26 Oct 2017 12:58:09 GMT'}]",2018-08-01,"[['West', 'Brendan A.', ''], ['Hodgdon', 'Taylor S.', ''], ['Parno', 'Matthew D.', ''], ['Song', 'Arnold J.', '']]","['Image segmentation', 'Multiphase segmentation', 'Local deconvolution', 'Non-gaussian mixture modeling', 'Granular media']"
11824,2002.06183,Jeff Smits,"Jeff Smits (Delft University of Technology, Netherlands), Gabri\""el
  D.P. Konat (Delft University of Technology, Netherlands), Eelco Visser (Delft
  University of Technology, Netherlands)","Constructing Hybrid Incremental Compilers for Cross-Module Extensibility
  with an Internal Build System",,"The Art, Science, and Engineering of Programming, 2020, Vol. 4,
  Issue 3, Article 16",10.22152/programming-journal.org/2020/4/16,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Compilation time is an important factor in the adaptability of a
software project. Fast recompilation enables cheap experimentation with changes
to a project, as those changes can be tested quickly. Separate and incremental
compilation has been a topic of interest for a long time to facilitate fast
recompilation.
  Inquiry: Despite the benefits of an incremental compiler, such compilers are
usually not the default. This is because incrementalization requires
cross-cutting, complicated, and error-prone techniques such as dependency
tracking, caching, cache invalidation, and change detection. Especially in
compilers for languages with cross-module definitions and integration,
correctly and efficiently implementing an incremental compiler can be a
challenge. Retrofitting incrementality into a compiler is even harder. We
address this problem by developing a compiler design approach that reuses parts
of an existing non-incremental compiler to lower the cost of building an
incremental compiler. It also gives an intuition into compiling
difficult-to-incrementalize language features through staging.
  Approach: We use the compiler design approach presented in this paper to
develop an incremental compiler for the Stratego term-rewriting language. This
language has a set of features that at first glance look incompatible with
incremental compilation. Therefore, we treat Stratego as our critical case to
demonstrate the approach on. We show how this approach decomposes the original
compiler and has a solution to compile Stratego incrementally. The key idea on
which we build our incremental compiler is to internally use an incremental
build system to wire together the components we extract from the original
compiler.
  Knowledge: The resulting compiler is already in use as a replacement of the
original whole-program compiler. We find that the incremental build system
inside the compiler is a crucial component of our approach. This allows a
compiler writer to think in multiple steps of compilation, and combine that
into a incremental compiler almost effortlessly. Normally, separate compilation
\`a la C is facilitated by an external build system, where the programmer is
responsible for managing dependencies between files. We reuse an existing sound
and optimal incremental build system, and integrate its dependency tracking
into the compiler.
  Grounding: The incremental compiler for Stratego is available as an artefact
along with this article. We evaluate it on a large Stratego project to test its
performance. The benchmark replays edits to the Stratego project from version
control. These benchmarks are part of the artefact, packaged as a virtual
machine image for easy reproducibility.
  Importance: Although we demonstrate our design approach on the Stratego
programming language, we also describe it generally throughout this paper. Many
currently used programming languages have a compiler that is much slower than
necessary. Our design provides an approach to change this, by reusing an
existing compiler and making it incremental within a reasonable amount of time.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 18:57:48 GMT'}]",2020-02-17,"[['Smits', 'Jeff', '', 'Delft University of Technology, Netherlands'], ['Konat', 'Gabriël D. P.', '', 'Delft University of Technology, Netherlands'], ['Visser', 'Eelco', '', 'Delft\n  University of Technology, Netherlands']]","['separate compilation', 'incremental compilation', 'extensible language definition', 'stratego', 'term']"
11825,2204.04189,Ghassan Samara,"Ghassan Samara, Ruzayn Quaddoura, Mooad Imad Al-Shalout, AL-Qawasmi
  Khaled, Ghadeer Al Besani",Internet of Things Protection and Encryption: A Survey,7 pages,"2021 22nd International Arab Conference on Information Technology
  (ACIT)",10.1109/ACIT53391.2021.9677225,,cs.CR cs.NI,http://creativecommons.org/licenses/by/4.0/,"  The Internet of Things (IoT) has enabled a wide range of sectors to interact
effectively with their consumers in order to deliver seamless services and
products. Despite the widespread availability of (IoT) devices and their
Internet connectivity, they have a low level of information security integrity.
A number of security methods were proposed and evaluated in our research, and
comparisons were made in terms of energy and time in the encryption and
decryption processes. A ratification procedure is also performed on the devices
in the main manager, which is regarded as a full firewall for IoT devices. The
suggested algorithm's success has been shown utilizing low-cost Adriano Uno and
Raspberry Pi devices. Arduous Uno has been used to demonstrate the encryption
process in low-energy devices using a variety of algorithms, including Enhanced
Algorithm for Data Integrity and Authentication (EDAI) and raspberry, which
serves as a safety manager in low-energy device molecules. A variety of
enhanced algorithms used in conjunction with Blockchain software have also
assured the security and integrity of the information. These findings and
discussions are presented at the conclusion of the paper.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2022 10:23:38 GMT'}]",2022-04-11,"[['Samara', 'Ghassan', ''], ['Quaddoura', 'Ruzayn', ''], ['Al-Shalout', 'Mooad Imad', ''], ['Khaled', 'AL-Qawasmi', ''], ['Besani', 'Ghadeer Al', '']]","['IOT Security', 'Low Devices Powered IOT', 'Data']"
11826,2201.08378,Ruslan Nikolaev,"Ruslan Nikolaev, Hassan Nadeem, Cathlyn Stone, Binoy Ravindran","Adelie: Continuous Address Space Layout Re-randomization for Linux
  Drivers","27th ACM International Conference on Architectural Support for
  Programming Languages and Operating Systems (ASPLOS '22), February 28 - March
  4, 2022, Lausanne, Switzerland",,10.1145/3503222.3507779,,cs.OS cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While address space layout randomization (ASLR) has been extensively studied
for user-space programs, the corresponding OS kernel's KASLR support remains
very limited, making the kernel vulnerable to just-in-time (JIT)
return-oriented programming (ROP) attacks. Furthermore, commodity OSs such as
Linux restrict their KASLR range to 32 bits due to architectural constraints
(e.g., x86-64 only supports 32-bit immediate operands for most instructions),
which makes them vulnerable to even unsophisticated brute-force ROP attacks due
to low entropy. Most in-kernel pointers remain static, exacerbating the problem
when pointers are leaked.
  Adelie, our kernel defense mechanism, overcomes KASLR limitations, increases
KASLR entropy, and makes successful ROP attacks on the Linux kernel much harder
to achieve. First, Adelie enables the position-independent code (PIC) model so
that the kernel and its modules can be placed anywhere in the 64-bit virtual
address space, at any distance apart from each other. Second, Adelie implements
stack re-randomization and address encryption on modules. Finally, Adelie
enables efficient continuous KASLR for modules by using the PIC model to make
it (almost) impossible to inject ROP gadgets through these modules regardless
of gadget's origin.
  Since device drivers (typically compiled as modules) are often developed by
third parties and are typically less tested than core OS parts, they are also
often more vulnerable. By fully re-randomizing device drivers, the last two
contributions together prevent most JIT ROP attacks since vulnerable modules
are very likely to be a starting point of an attack. Furthermore, some OS
instances in virtualized environments are specifically designated to run device
drivers, where drivers are the primary target of JIT ROP attacks. Our
evaluation shows high efficiency of Adelie's approach.
  [full abstract is in the paper]
","[{'version': 'v1', 'created': 'Thu, 20 Jan 2022 18:58:44 GMT'}]",2022-01-21,"[['Nikolaev', 'Ruslan', ''], ['Nadeem', 'Hassan', ''], ['Stone', 'Cathlyn', ''], ['Ravindran', 'Binoy', '']]","['return-oriented programming (ROP)', 'address space layout randomization (ASLR)', 'position-independent code (PIC)', 'operating system']"
11827,2208.12386,Adam Hepworth,"Adam Hepworth, Aya Hussein, Darryn Reid and Hussein Abbass","Swarm Analytics: Designing Information Markers to Characterise Swarm
  Systems in Shepherding Contexts","28 pages, 15 tables, 13 figures",,10.1177/10597123221137090,,cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Contemporary swarm indicators are often used in isolation, focused on
extracting information at the individual or collective levels. Consequently,
these are seldom integrated to infer a top-level operating picture of the
swarm, its members, and its overall collective dynamics. The primary
contribution of this paper is to organise a suite of indicators about swarms
into an ontologically-arranged collection of information markers to
characterise the swarm from the perspective of an external observer\textemdash,
a recognition agent. Our contribution shows the foundations for a new area of
research that we tile swarm analytics, whose primary concern is with the design
and organisation of collections of swarm markers to understand, detect,
recognise, track, and learn a particular insight about a swarm system. We
present our designed framework of information markers that offer a new avenue
for swarm research, especially for heterogeneous and cognitive swarms that may
require more advanced capabilities to detect agencies and categorise agent
influences and responses.
","[{'version': 'v1', 'created': 'Fri, 26 Aug 2022 00:43:24 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Oct 2022 22:14:51 GMT'}]",2022-11-22,"[['Hepworth', 'Adam', ''], ['Hussein', 'Aya', ''], ['Reid', 'Darryn', ''], ['Abbass', 'Hussein', '']]","['Swarm Recognition', 'Context Recognition', 'Swarm Shepherding', 'Situation Awareness', 'Heterogeneous Swarming']"
11828,2010.16111,Frederic Blanqui,"Fr\'ed\'eric Blanqui (LSV,ENS Paris Saclay)",Type safety of rewrite rules in dependent types,,"5th International Conference on Formal Structures for Computation
  and Deduction (FSCD 2020), Jun 2020, Paris, France. pp.14",10.4230/LIPIcs.FSCD.2020.13,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The expressiveness of dependent type theory can be extended by identifying
types modulo some additional computation rules. But, for preserving the
decidability of type-checking or the logical consistency of the system, one
must make sure that those user-defined rewriting rules preserve typing. In this
paper, we give a new method to check that property using Knuth-Bendix
completion.
","[{'version': 'v1', 'created': 'Fri, 30 Oct 2020 08:06:21 GMT'}]",2020-11-02,"[['Blanqui', 'Frédéric', '', 'LSV,ENS Paris Saclay']]","['subject-reduction', 'rewriting', 'dependent types']"
11829,2107.14585,Alexander Genser Ag,Alexander Genser and Anastasios Kouvelas,"Dynamic optimal congestion pricing in multi-region urban networks by
  application of a Multi-Layer-Neural network",,"Transportation Research Part C: Emerging Technologies, Volume 134,
  2022",10.1016/j.trc.2021.103485,,cs.RO cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Traffic management by applying congestion pricing is a measure for mitigating
congestion in protected city corridors. As a promising tool, pricing improves
the level of service in a network and reduces travel delays. However,
real-world implementations are restricted to static pricing, i.e., the price is
fixed and not responsive to the prevailing regional traffic conditions. Dynamic
pricing overcomes these limitations but also affects the users route choices.
This work uses dynamic pricing's influence and predicts pricing functions to
aim for a system optimal traffic distribution. The framework models a
large-scale network where every region is considered homogeneous, allowing for
the Macroscopic Fundamental Diagram (MFD) application. We compute Dynamic
System Optimum (DSO) and a Quasi Dynamic User Equilibrium (QDUE) of the
macroscopic model by formulating a linear optimization problem and utilizing
the Dijkstra algorithm and a Multinomial Logit model (MNL), respectively. The
equilibria allow us to find an optimal pricing methodology by training
Multi-Layer-Neural (MLN) network models. We test our framework on a case study
in Zurich, Switzerland, and showcase that (a) our neural network model learns
the complex user behavior and (b) allows predicting optimal pricing functions.
Results show a significant performance improvement when operating a
transportation network in the DSO and highlight how dynamic pricing influences
the user's route choice behavior towards the system optimal equilibrium.
","[{'version': 'v1', 'created': 'Tue, 27 Jul 2021 14:16:59 GMT'}]",2021-12-14,"[['Genser', 'Alexander', ''], ['Kouvelas', 'Anastasios', '']]","['Multi-region-network modeling', 'Dynamic optimal pricing', 'Dynamic system optimum', 'Linear rolling horizon optimization', 'Machine learning', 'Deep neural networks']"
11830,2103.00053,Reyhan Kevser Keser,"Reyhan Kevser Keser, Aydin Ayanzadeh, Omid Abdollahi Aghdam, Caglar
  Kilcioglu, Behcet Ugur Toreyin, Nazim Kemal Ure","PURSUhInT: In Search of Informative Hint Points Based on Layer
  Clustering for Knowledge Distillation","Our codes are published on Code Ocean, where the link to our codes
  is: https://codeocean.com/capsule/4245746/tree/v1","Expert Systems with Applications, Volume 213, Part B, March 2023,
  119040",10.1016/j.eswa.2022.119040,,cs.LG cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  One of the most efficient methods for model compression is hint distillation,
where the student model is injected with information (hints) from several
different layers of the teacher model. Although the selection of hint points
can drastically alter the compression performance, conventional distillation
approaches overlook this fact and use the same hint points as in the early
studies. Therefore, we propose a clustering based hint selection methodology,
where the layers of teacher model are clustered with respect to several metrics
and the cluster centers are used as the hint points. Our method is applicable
for any student network, once it is applied on a chosen teacher network. The
proposed approach is validated in CIFAR-100 and ImageNet datasets, using
various teacher-student pairs and numerous hint distillation methods. Our
results show that hint points selected by our algorithm results in superior
compression performance compared to state-of-the-art knowledge distillation
algorithms on the same student models and datasets.
","[{'version': 'v1', 'created': 'Fri, 26 Feb 2021 21:18:34 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Feb 2022 20:50:30 GMT'}, {'version': 'v3', 'created': 'Thu, 3 Nov 2022 22:41:42 GMT'}]",2022-11-07,"[['Keser', 'Reyhan Kevser', ''], ['Ayanzadeh', 'Aydin', ''], ['Aghdam', 'Omid Abdollahi', ''], ['Kilcioglu', 'Caglar', ''], ['Toreyin', 'Behcet Ugur', ''], ['Ure', 'Nazim Kemal', '']]","['Model compression', 'Knowledge distillation', 'Hint selection', 'Feature matching']"
11831,2001.07586,Hongyu Jin,Hongyu Jin and Panos Papadimitratos,Resilient Collaborative Privacy for Location-Based Services,,"Nordic Conference on Secure IT Systems (NordSec), Stockholm,
  Sweden, Oct. 2015",10.1007/978-3-319-26502-5_4,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Location-based Services (LBSs) provide valuable services, with convenient
features for users. However, the information disclosed through each request
harms user privacy. This is a concern particularly with honest-but-curious LBS
servers, which could, by collecting requests, track users and infer additional
sensitive user data. This is the motivation of both centralized and
decentralized location privacy protection schemes for LBSs: anonymizing and
obfuscating LBS queries to not disclose exact information, while still getting
useful responses. Decentralized schemes overcome the disadvantages of
centralized schemes, eliminating anonymizers and enhancing users' control over
sensitive information. However, an insecure decentralized system could pose
even more serious security threats than privacy leakage. We address exactly
this problem, by proposing security enhancements for mobile data sharing
systems. We protect user privacy while preserving accountability of user
activities, leveraging pseudonymous authentication with mainstream
cryptography. Our design leverages architectures proposed for large scale
mobile systems, while it incurs minimal changes to LBS servers as it can be
deployed in parallel to the LBS servers. This further motivates the adoption of
our design, in order to cater to the needs of privacy-sensitive users. We
provide an analysis of security and privacy concerns and countermeasures, as
well as a performance evaluation of basic protocol operations showing the
practicality of our design.
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2020 14:50:42 GMT'}]",2020-01-22,"[['Jin', 'Hongyu', ''], ['Papadimitratos', 'Panos', '']]","['Location-Based Service', 'Security and Privacy', 'Pseudonymous Authentication']"
11832,2204.06899,Ze Chen,"Ze Chen, Zhihang Fu, Jianqiang Huang, Mingyuan Tao, Rongxin Jiang,
  Xiang Tian, Yaowu Chen and Xian-sheng Hua","Spatial Likelihood Voting with Self-Knowledge Distillation for Weakly
  Supervised Object Detection",arXiv admin note: text overlap with arXiv:2006.12884,"Image and Vision Computing, Volume 116, 2021, 104314, ISSN
  0262-8856",10.1016/j.imavis.2021.104314,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Weakly supervised object detection (WSOD), which is an effective way to train
an object detection model using only image-level annotations, has attracted
considerable attention from researchers. However, most of the existing methods,
which are based on multiple instance learning (MIL), tend to localize instances
to the discriminative parts of salient objects instead of the entire content of
all objects. In this paper, we propose a WSOD framework called the Spatial
Likelihood Voting with Self-knowledge Distillation Network (SLV-SD Net). In
this framework, we introduce a spatial likelihood voting (SLV) module to
converge region proposal localization without bounding box annotations.
Specifically, in every iteration during training, all the region proposals in a
given image act as voters voting for the likelihood of each category in the
spatial dimensions. After dilating the alignment on the area with large
likelihood values, the voting results are regularized as bounding boxes, which
are then used for the final classification and localization. Based on SLV, we
further propose a self-knowledge distillation (SD) module to refine the feature
representations of the given image. The likelihood maps generated by the SLV
module are used to supervise the feature learning of the backbone network,
encouraging the network to attend to wider and more diverse areas of the image.
Extensive experiments on the PASCAL VOC 2007/2012 and MS-COCO datasets
demonstrate the excellent performance of SLV-SD Net. In addition, SLV-SD Net
produces new state-of-the-art results on these benchmarks.
","[{'version': 'v1', 'created': 'Thu, 14 Apr 2022 11:56:19 GMT'}]",2022-04-15,"[['Chen', 'Ze', ''], ['Fu', 'Zhihang', ''], ['Huang', 'Jianqiang', ''], ['Tao', 'Mingyuan', ''], ['Jiang', 'Rongxin', ''], ['Tian', 'Xiang', ''], ['Chen', 'Yaowu', ''], ['Hua', 'Xian-sheng', '']]","['Object detection', 'weak supervision', 'spatial likelihood voting', 'self-knowledge distillation']"
11833,1905.09522,Pawel Trajdos,"Pawel Trajdos, Robert Burduk","Combination of linear classifiers using score function -- analysis of
  possible combination strategies",,"In Advances in Intelligent Systems and Computing (pp. 348-359)
  (2019)",10.1007/978-3-030-19738-4_35,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we addressed the issue of combining linear classifiers using
their score functions. The value of the scoring function depends on the
distance from the decision boundary. Two score functions have been tested and
four different combination strategies were investigated. During the
experimental study, the proposed approach was applied to the heterogeneous
ensemble and it was compared to two reference methods -- majority voting and
model averaging respectively. The comparison was made in terms of seven
different quality criteria. The result shows that combination strategies based
on simple average, and trimmed average are the best combination strategies of
the geometrical combination.
","[{'version': 'v1', 'created': 'Thu, 23 May 2019 08:10:12 GMT'}]",2019-05-24,"[['Trajdos', 'Pawel', ''], ['Burduk', 'Robert', '']]","['binary classifiers', 'linear classifiers', 'geometrical space', 'potential function']"
11834,2004.07371,Eduardo Nuno Almeida,"Eduardo Nuno Almeida, Andr\'e Coelho, Jos\'e Ruela, Rui Campos, Manuel
  Ricardo","Joint Traffic-Aware UAV Placement and Predictive Routing for Aerial
  Networks",,,10.1016/j.adhoc.2021.102525,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aerial networks, composed of Unmanned Aerial Vehicles (UAVs) acting as Wi-Fi
access points or cellular base stations, are emerging as an interesting
solution to provide on-demand wireless connectivity to users, when there is no
network infrastructure available, or to enhance the network capacity. This
article proposes a traffic-aware topology control solution for aerial networks
that holistically combines the placement of UAVs with a predictive and
centralized routing protocol. The synergy created by the combination of the UAV
placement and routing solutions allows the aerial network to seamlessly update
its topology according to the users' traffic demand, whilst minimizing the
disruption caused by the movement of the UAVs. As a result, the Quality of
Service (QoS) provided to the users is improved. The components of the proposed
solution are described and evaluated individually in this article by means of
simulation and an experimental testbed. The results show that all the
components improve the QoS provided to the users when compared to the
corresponding baseline solutions.
","[{'version': 'v1', 'created': 'Wed, 15 Apr 2020 22:01:13 GMT'}]",2021-05-11,"[['Almeida', 'Eduardo Nuno', ''], ['Coelho', 'André', ''], ['Ruela', 'José', ''], ['Campos', 'Rui', ''], ['Ricardo', 'Manuel', '']]","['Aerial wireless networks', 'UAV placement', 'Predictive routing', 'Quality of Service (QoS)']"
11835,2106.08177,Shaykh Siddique,"Shaykh Siddique, Monica Yasmin, Tasnova Bintee Taher, Mushfiqul Alam","The Reliability and Acceptance of Biometric System in Bangladesh: Users
  Perspective","7 pages, 4 figures, Published with International Journal of Computer
  Trends and Technology (IJCTT)","International Journal of Computer Trends and Technology, 69(6),
  15-21, June 2021",10.14445/22312803/IJCTT-V69I6P103,,cs.CR cs.CY cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Biometric systems are the latest technologies of unique identification.
People all over the world prefer to use this unique identification technology
for their authentication security. The goal of this research is to evaluate the
biometric systems based on system reliability and user satisfaction. As
technology fully depends on personal data, so in terms of the quality and
reliability of biometric systems, user satisfaction is a principal factor. To
walk with the digital era, it is extremely important to assess users' concerns
about data security as the systems are conducted the authentication by
analyzing users' personal data. The study shows that users are satisfied by
using biometric systems rather than other security systems. Besides, hardware
failure is a big issue faced by biometric systems users. Finally, a matrix is
generated to compare the performance of popular biometric systems from the
users' opinions. As system reliability and user satisfaction are the focused
issue of this research, biometric service providers can use these phenomena to
find what aspect of improvement they need for their services. Also, this study
can be a great visualizer for Bangladeshi users, so that they can easily
realize which biometric system they have to choose.
","[{'version': 'v1', 'created': 'Mon, 14 Jun 2021 08:46:00 GMT'}]",2021-06-16,"[['Siddique', 'Shaykh', ''], ['Yasmin', 'Monica', ''], ['Taher', 'Tasnova Bintee', ''], ['Alam', 'Mushfiqul', '']]","['Biometric systems', 'User concern', 'Preference', 'Reliability', 'Acceptance', 'Security']"
11836,2010.09258,Sheng Shen,"Sheng Shen, Tianqing Zhu, Di Wu, Wei Wang, Wanlei Zhou","From Distributed Machine Learning To Federated Learning: In The View Of
  Data Privacy And Security","21 pages, 4 figures, 4 tables, 76 references","Concurrency and Computation Practice and Experience, 2020, 1-19",10.1002/cpe.6002,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Federated learning is an improved version of distributed machine learning
that further offloads operations which would usually be performed by a central
server. The server becomes more like an assistant coordinating clients to work
together rather than micro-managing the workforce as in traditional DML. One of
the greatest advantages of federated learning is the additional privacy and
security guarantees it affords. Federated learning architecture relies on smart
devices, such as smartphones and IoT sensors, that collect and process their
own data, so sensitive information never has to leave the client device.
Rather, clients train a sub-model locally and send an encrypted update to the
central server for aggregation into the global model. These strong privacy
guarantees make federated learning an attractive choice in a world where data
breaches and information theft are common and serious threats. This survey
outlines the landscape and latest developments in data privacy and security for
federated learning. We identify the different mechanisms used to provide
privacy and security, such as differential privacy, secure multi-party
computation and secure aggregation. We also survey the current attack models,
identifying the areas of vulnerability and the strategies adversaries use to
penetrate federated systems. The survey concludes with a discussion on the open
challenges and potential directions of future work in this increasingly popular
learning paradigm.
","[{'version': 'v1', 'created': 'Mon, 19 Oct 2020 07:00:29 GMT'}]",2020-10-20,"[['Shen', 'Sheng', ''], ['Zhu', 'Tianqing', ''], ['Wu', 'Di', ''], ['Wang', 'Wei', ''], ['Zhou', 'Wanlei', '']]","['federated learning', 'data privacy', 'security', 'distributed machine learning']"
11837,2108.05308,Davide Rigoni,"Davide Rigoni, Luciano Serafini, Alessandro Sperduti",A Better Loss for Visual-Textual Grounding,,,10.1145/3477314.3507047,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a textual phrase and an image, the visual grounding problem is the task
of locating the content of the image referenced by the sentence. It is a
challenging task that has several real-world applications in human-computer
interaction, image-text reference resolution, and video-text reference
resolution. In the last years, several works have addressed this problem by
proposing more and more large and complex models that try to capture
visual-textual dependencies better than before. These models are typically
constituted by two main components that focus on how to learn useful
multi-modal features for grounding and how to improve the predicted bounding
box of the visual mention, respectively. Finding the right learning balance
between these two sub-tasks is not easy, and the current models are not
necessarily optimal with respect to this issue. In this work, we propose a loss
function based on bounding boxes classes probabilities that: (i) improves the
bounding boxes selection; (ii) improves the bounding boxes coordinates
prediction. Our model, although using a simple multi-modal feature fusion
component, is able to achieve a higher accuracy than state-of-the-art models on
two widely adopted datasets, reaching a better learning balance between the two
sub-tasks mentioned above.
","[{'version': 'v1', 'created': 'Wed, 11 Aug 2021 16:26:54 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Feb 2022 10:57:29 GMT'}]",2022-02-03,"[['Rigoni', 'Davide', ''], ['Serafini', 'Luciano', ''], ['Sperduti', 'Alessandro', '']]","['Computer Vision', 'Visual Textual Grounding', 'Semantic Loss']"
11838,2101.04378,Laurent Najman,"Jord{\~a}o Bragantini (IC), Alexandre X Falc{\~a}o (IC), Laurent
  Najman (LIGM)",Rethinking Interactive Image Segmentation: Feature Space Annotation,,"Pattern Recognition, Elsevier, In press",10.1016/j.patcog.2022.108882,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the progress of interactive image segmentation methods, high-quality
pixel-level annotation is still time-consuming and laborious - a bottleneck for
several deep learning applications. We take a step back to propose interactive
and simultaneous segment annotation from multiple images guided by feature
space projection. This strategy is in stark contrast to existing interactive
segmentation methodologies, which perform annotation in the image domain. We
show that feature space annotation achieves competitive results with
state-of-the-art methods in foreground segmentation datasets: iCoSeg, DAVIS,
and Rooftop. Moreover, in the semantic segmentation context, it achieves 91.5%
accuracy in the Cityscapes dataset, being 74.75 times faster than the original
annotation procedure. Further, our contribution sheds light on a novel
direction for interactive image annotation that can be integrated with existing
methodologies. The supplementary material presents video demonstrations. Code
available at
https://github.com/LIDS-UNICAMP/rethinking-interactive-image-segmentation.
","[{'version': 'v1', 'created': 'Tue, 12 Jan 2021 10:13:35 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Dec 2021 10:18:03 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Jul 2022 09:34:07 GMT'}]",2022-07-12,"[['Bragantini', 'Jord{ã}o', '', 'IC'], ['Falc{ã}o', 'Alexandre X', '', 'IC'], ['Najman', 'Laurent', '', 'LIGM']]","['interactive image segmentation', 'data annotation', 'interactive machine learning', 'feature space annotation']"
11839,1905.12725,Javier Segurado,Sergio Lucarini and Javier Segurado,"DBFFT: A displacement based FFT approach for non-linear homogenization
  of the mechanical behavior",,"International Journal of Engineering Science 144, 103131, 2019",10.1016/j.ijengsci.2019.103131,,cs.CE cond-mat.mtrl-sci,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most of the FFT methods available for homogenization of the mechanical
response use the strain/deformation gradient as unknown, imposing their
compatibility using Green's functions or projection operators. This implies the
allocation of redundant information and, when the method is based in solving a
linear equation, the rank-deficiency of the resulting system. In this work we
propose a fast, robust and memory-efficient FFT homogenization framework in
which the displacement field on the Fourier space is the unknown: the
displacement based FFT (DBFFT) algorithm. The framework allows any general
non-linear constitutive behavior for the phases and direct strain, stress and
mixed control of the macroscopic load. In the linear case, the method results
in a linear system defined in terms of linear operators in the Fourier space
and that does not require a reference medium. The system has an associated full
rank Hermitian matrix and can be solved using iterative Krylov solvers and
allows the use of preconditioners. A preconditioner is proposed to improve the
efficiency of the system resolution. Finally, some numerical examples including
elastic, hyperelastic and viscoplastic materials are solved to check the
accuracy and efficiency of the method. The computational cost reduction respect
the Galerkin-FFT was around 30%.
","[{'version': 'v1', 'created': 'Mon, 27 May 2019 08:35:09 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Aug 2019 10:35:11 GMT'}]",2019-08-27,"[['Lucarini', 'Sergio', ''], ['Segurado', 'Javier', '']]","['FFT', 'computational homogenization', 'micromechanics', 'polycrystals']"
11840,2008.12578,Tien Huu Do,"Tien Huu Do, Duc Minh Nguyen, Giannis Bekoulis, Adrian Munteanu, Nikos
  Deligiannis","Graph Convolutional Neural Networks with Node Transition
  Probability-based Message Passing and DropNode Regularization","Expert Systems with Applications, graph-based deep learning, graph
  neural networks, document classification","Expert Systems with Applications, 174 (2021), Elsevier",10.1016/j.eswa.2021.114711,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph convolutional neural networks (GCNNs) have received much attention
recently, owing to their capability in handling graph-structured data. Among
the existing GCNNs, many methods can be viewed as instances of a neural message
passing motif; features of nodes are passed around their neighbors, aggregated
and transformed to produce better nodes' representations. Nevertheless, these
methods seldom use node transition probabilities, a measure that has been found
useful in exploring graphs. Furthermore, when the transition probabilities are
used, their transition direction is often improperly considered in the feature
aggregation step, resulting in an inefficient weighting scheme. In addition,
although a great number of GCNN models with increasing level of complexity have
been introduced, the GCNNs often suffer from over-fitting when being trained on
small graphs. Another issue of the GCNNs is over-smoothing, which tends to make
nodes' representations indistinguishable. This work presents a new method to
improve the message passing process based on node transition probabilities by
properly considering the transition direction, leading to a better weighting
scheme in nodes' features aggregation compared to the existing counterpart.
Moreover, we propose a novel regularization method termed DropNode to address
the over-fitting and over-smoothing issues simultaneously. DropNode randomly
discards part of a graph, thus it creates multiple deformed versions of the
graph, leading to data augmentation regularization effect. Additionally,
DropNode lessens the connectivity of the graph, mitigating the effect of
over-smoothing in deep GCNNs. Extensive experiments on eight benchmark datasets
for node and graph classification tasks demonstrate the effectiveness of the
proposed methods in comparison with the state of the art.
","[{'version': 'v1', 'created': 'Fri, 28 Aug 2020 10:51:03 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Mar 2021 13:48:49 GMT'}]",2021-03-19,"[['Do', 'Tien Huu', ''], ['Nguyen', 'Duc Minh', ''], ['Bekoulis', 'Giannis', ''], ['Munteanu', 'Adrian', ''], ['Deligiannis', 'Nikos', '']]","['Graph convolutional neural networks', 'graph classification', 'node']"
11841,2210.09375,Erik Buchholz,"Erik Buchholz, Alsharif Abuadbba, Shuo Wang, Surya Nepal, Salil S.
  Kanhere","Reconstruction Attack on Differential Private Trajectory Protection
  Mechanisms","To be published in the proceedings of the 38th Annual Computer
  Security Applications Conference (ACSAC '22)",,10.1145/3564625.3564628,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Location trajectories collected by smartphones and other devices represent a
valuable data source for applications such as location-based services.
Likewise, trajectories have the potential to reveal sensitive information about
individuals, e.g., religious beliefs or sexual orientations. Accordingly,
trajectory datasets require appropriate sanitization. Due to their strong
theoretical privacy guarantees, differential private publication mechanisms
receive much attention. However, the large amount of noise required to achieve
differential privacy yields structural differences, e.g., ship trajectories
passing over land. We propose a deep learning-based Reconstruction Attack on
Protected Trajectories (RAoPT), that leverages the mentioned differences to
partly reconstruct the original trajectory from a differential private release.
The evaluation shows that our RAoPT model can reduce the Euclidean and
Hausdorff distances between the released and original trajectories by over 68%
on two real-world datasets under protection with $\varepsilon \leq 1$. In this
setting, the attack increases the average Jaccard index of the trajectories'
convex hulls, representing a user's activity space, by over 180%. Trained on
the GeoLife dataset, the model still reduces the Euclidean and Hausdorff
distances by over 60% for T-Drive trajectories protected with a
state-of-the-art mechanism ($\varepsilon = 0.1$). This work highlights
shortcomings of current trajectory publication mechanisms, and thus motivates
further research on privacy-preserving publication schemes.
","[{'version': 'v1', 'created': 'Mon, 17 Oct 2022 19:15:51 GMT'}]",2022-10-19,"[['Buchholz', 'Erik', ''], ['Abuadbba', 'Alsharif', ''], ['Wang', 'Shuo', ''], ['Nepal', 'Surya', ''], ['Kanhere', 'Salil S.', '']]","['Trajectory Privacy', 'Differential Privacy', 'Location Privacy', 'DeepLearning']"
11842,1708.04146,Michel Melo Silva,"Michel Melo Silva, Washington Luis Souza Ramos, Joao Pedro Klock
  Ferreira, Mario Fernando Montenegro Campos, Erickson Rangel Nascimento",Towards Semantic Fast-Forward and Stabilized Egocentric Videos,"Accepted for publication and presented in the First International
  Workshop on Egocentric Perception, Interaction and Computing at European
  Conference on Computer Vision (EPIC@ECCV) 2016",,10.1007/978-3-319-46604-0_40,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The emergence of low-cost personal mobiles devices and wearable cameras and
the increasing storage capacity of video-sharing websites have pushed forward a
growing interest towards first-person videos. Since most of the recorded videos
compose long-running streams with unedited content, they are tedious and
unpleasant to watch. The fast-forward state-of-the-art methods are facing
challenges of balancing the smoothness of the video and the emphasis in the
relevant frames given a speed-up rate. In this work, we present a methodology
capable of summarizing and stabilizing egocentric videos by extracting the
semantic information from the frames. This paper also describes a dataset
collection with several semantically labeled videos and introduces a new
smoothness evaluation metric for egocentric videos that is used to test our
method.
","[{'version': 'v1', 'created': 'Mon, 14 Aug 2017 14:32:11 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Aug 2017 13:36:34 GMT'}]",2017-08-17,"[['Silva', 'Michel Melo', ''], ['Ramos', 'Washington Luis Souza', ''], ['Ferreira', 'Joao Pedro Klock', ''], ['Campos', 'Mario Fernando Montenegro', ''], ['Nascimento', 'Erickson Rangel', '']]","['Semantic Information', 'First-person Video', 'Fast-Forward', 'Egocentric Stabilization']"
11843,1508.04851,EPTCS,"Eike Best (Oldenburg), Uli Schlachter (Oldenburg)",Analysis of Petri Nets and Transition Systems,"In Proceedings ICE 2015, arXiv:1508.04595","EPTCS 189, 2015, pp. 53-67",10.4204/EPTCS.189.6,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a stand-alone, no-frills tool supporting the analysis of
(labelled) place/transition Petri nets and the synthesis of labelled transition
systems into Petri nets. It is implemented as a collection of independent,
dedicated algorithms which have been designed to operate modularly, portably,
extensibly, and efficiently.
","[{'version': 'v1', 'created': 'Thu, 20 Aug 2015 01:40:51 GMT'}]",2015-08-21,"[['Best', 'Eike', '', 'Oldenburg'], ['Schlachter', 'Uli', '', 'Oldenburg']]","['Analysis', 'Labelled Transition Systems', 'Petri Nets', 'Synthesis']"
11844,1806.04544,Gabriele D'Angelo,"Gabriele D'Angelo, Stefano Ferretti, Moreno Marzolla",A Blockchain-based Flight Data Recorder for Cloud Accountability,"1st Workshop on Cryptocurrencies and Blockchains for Distributed
  Systems (CryBlock 2018)",,10.1145/3211933.3211950,,cs.DC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many companies rely on Cloud infrastructures for their computation,
communication and data storage requirements. While Cloud services provide some
benefits, e.g., replacing high upfront costs for an IT infrastructure with a
pay-as-you-go model, they also introduce serious concerns that are notoriously
difficult to address. In essence, Cloud customers are storing data and running
computations on infrastructures that they can not control directly. Therefore,
when problems arise -- violations of Service Level Agreements, data corruption,
data leakage, security breaches -- both customers and Cloud providers face the
challenge of agreeing on which party is to be held responsible. In this paper,
we review the challenges and requirements for enforcing accountability in Cloud
infrastructures, and argue that smart contracts and blockchain technologies
might provide a key contribution towards accountable Clouds.
","[{'version': 'v1', 'created': 'Tue, 12 Jun 2018 14:08:25 GMT'}]",2018-06-13,"[[""D'Angelo"", 'Gabriele', ''], ['Ferretti', 'Stefano', ''], ['Marzolla', 'Moreno', '']]","['Cloud Computing', 'Accountability', 'Blockchain', 'Smart Contracts']"
11845,2012.04735,Muhammad Usman,"Vahid Azizi, Muhammad Usman, Honglu Zhou, Petros Faloutsos and
  Mubbasir Kapadia","Graph-Based Generative Representation Learning of Semantically and
  Behaviorally Augmented Floorplans",,,10.1007/s00371-021-02155-w,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Floorplans are commonly used to represent the layout of buildings. In
computer aided-design (CAD) floorplans are usually represented in the form of
hierarchical graph structures. Research works towards computational techniques
that facilitate the design process, such as automated analysis and
optimization, often use simple floorplan representations that ignore the
semantics of the space and do not take into account usage related analytics. We
present a floorplan embedding technique that uses an attributed graph to
represent the geometric information as well as design semantics and behavioral
features of the inhabitants as node and edge attributes. A Long Short-Term
Memory (LSTM) Variational Autoencoder (VAE) architecture is proposed and
trained to embed attributed graphs as vectors in a continuous space. A user
study is conducted to evaluate the coupling of similar floorplans retrieved
from the embedding space with respect to a given input (e.g., design layout).
The qualitative, quantitative and user-study evaluations show that our
embedding framework produces meaningful and accurate vector representations for
floorplans. In addition, our proposed model is a generative model. We studied
and showcased its effectiveness for generating new floorplans. We also release
the dataset that we have constructed and which, for each floorplan, includes
the design semantics attributes as well as simulation generated human
behavioral features for further study in the community.
","[{'version': 'v1', 'created': 'Tue, 8 Dec 2020 20:51:56 GMT'}]",2021-06-04,"[['Azizi', 'Vahid', ''], ['Usman', 'Muhammad', ''], ['Zhou', 'Honglu', ''], ['Faloutsos', 'Petros', ''], ['Kapadia', 'Mubbasir', '']]","['Floorplan Representation', 'Floorplan Generation', 'LSTM Variational Autoencoder', 'AttributedGraph', 'Design Semantic Features', 'Human BehavioralFeatures']"
11846,2205.00820,Faegheh Hasibi,"Emma J. Gerritse, Faegheh Hasibi, Arjen P. de Vries",Entity-aware Transformers for Entity Search,,,10.1145/3477495.3531971,,cs.IR cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Pre-trained language models such as BERT have been a key ingredient to
achieve state-of-the-art results on a variety of tasks in natural language
processing and, more recently, also in information retrieval.Recent research
even claims that BERT is able to capture factual knowledge about entity
relations and properties, the information that is commonly obtained from
knowledge graphs. This paper investigates the following question: Do BERT-based
entity retrieval models benefit from additional entity information stored in
knowledge graphs? To address this research question, we map entity embeddings
into the same input space as a pre-trained BERT model and inject these entity
embeddings into the BERT model. This entity-enriched language model is then
employed on the entity retrieval task. We show that the entity-enriched BERT
model improves effectiveness on entity-oriented queries over a regular BERT
model, establishing a new state-of-the-art result for the entity retrieval
task, with substantial improvements for complex natural language queries and
queries requesting a list of entities with a certain property. Additionally, we
show that the entity information provided by our entity-enriched model
particularly helps queries related to less popular entities. Last, we observe
empirically that the entity-enriched BERT models enable fine-tuning on limited
training data, which otherwise would not be feasible due to the known
instabilities of BERT in few-sample fine-tuning, thereby contributing to
data-efficient training of BERT for entity search.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 11:53:59 GMT'}]",2022-05-03,"[['Gerritse', 'Emma J.', ''], ['Hasibi', 'Faegheh', ''], ['de Vries', 'Arjen P.', '']]","['Entity retrieval', 'transformers', 'BERT', 'entity embeddings']"
11847,2111.11712,Susannah Kate Devitt,"S.K. Devitt, P.W.J. Baxter, G. Hamilton",The Ethics of Biosurveillance,"32 pages, 2 figures, 2019, Journal of Agricultural and Environmental
  Ethics","Journal of Agricultural and Environmental Ethics, 32(5), 709-740
  (2019)",10.1007/s10806-019-09775-2,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Governments must keep agricultural systems free of pests that threaten
agricultural production and international trade. Biosecurity surveillance
already makes use of a wide range of technologies, such as insect traps and
lures, geographic information systems, and diagnostic biochemical tests. The
rise of cheap and usable surveillance technologies such as remotely piloted
aircraft systems (RPAS) presents value conflicts not addressed in international
biosurveillance guidelines. The costs of keeping agriculture pest-free include
privacy violations and reduced autonomy for farmers. We argue that physical and
digital privacy in the age of ubiquitous aerial and ground surveillance is a
natural right to allow people to function freely on their land. Surveillance
methods must be co-created and justified through using ethically defensible
processes such as discourse theory, value-centred design and responsible
innovation to forge a cooperative social contract between diverse stakeholders.
We propose an ethical framework for biosurveillance activities that balances
the collective benefits for food security with individual privacy: (1)
establish the boundaries of a biosurveillance social contract; (2) justify
surveillance operations for the farmers, researchers, industry, the public and
regulators; (3) give decision makers a reasonable measure of control over their
personal and agricultural data; and (4) choose surveillance methodologies that
give the appropriate information. The benefits of incorporating an ethical
framework for responsible biosurveillance innovation include increased
participation and accumulated trust over time. Long term trust and cooperation
will support food security, producing higher quality data overall and
mitigating against anticipated information gaps that may emerge due to
disrespecting landholder rights
","[{'version': 'v1', 'created': 'Tue, 23 Nov 2021 08:06:50 GMT'}]",2021-11-24,"[['Devitt', 'S. K.', ''], ['Baxter', 'P. W. J.', ''], ['Hamilton', 'G.', '']]","['biosurveillance', 'privacy', 'biosecurity', 'food security', 'ethics', 'autonomous agriculture', 'value-centred design', 'responsible innovation']"
11848,1910.14417,Keltoum Bendiab,"Aimilia Panagiotou, Bogdan Ghita, Stavros Shiaeles, Keltoum Bendiab","A machine-learning approach to Detect users' suspicious behaviour
  through the Facebook wall",8 pages,"19th International Conference, NEW2AN 2019, and 12th Conference,
  ruSMART 2019",10.1007/978-3-030-30859-9_6,,cs.CR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Facebook represents the current de-facto choice for social media, changing
the nature of social relationships. The increasing amount of personal
information that runs through this platform publicly exposes user behaviour and
social trends, allowing aggregation of data through conventional intelligence
collection techniques such as OSINT (Open Source Intelligence). In this paper,
we propose a new method to detect and diagnose variations in overall Facebook
user psychology through Open Source Intelligence (OSINT) and machine learning
techniques. We are aggregating the spectrum of user sentiments and views by
using N-Games charts, which exhibit noticeable variations over time, validated
through long term collection. We postulate that the proposed approach can be
used by security organisations to understand and evaluate the user psychology,
then use the information to predict insider threats or prevent insider attacks.
","[{'version': 'v1', 'created': 'Thu, 31 Oct 2019 12:23:31 GMT'}]",2019-11-01,"[['Panagiotou', 'Aimilia', ''], ['Ghita', 'Bogdan', ''], ['Shiaeles', 'Stavros', ''], ['Bendiab', 'Keltoum', '']]","['Facebook', 'Social Media', 'Information Collection', 'OSINT', 'Machine Learning', 'Web Crawle']"
11849,2207.14593,Yucheol Jung,"Yucheol Jung, Wonjong Jang, Soongjin Kim, Jiaolong Yang, Xin Tong,
  Seungyong Lee",Deep Deformable 3D Caricatures with Learned Shape Control,"ACM SIGGRAPH 2022. For the project page, see
  https://ycjungsubhuman.github.io/DeepDeformable3DCaricatures",,10.1145/3528233.3530748,,cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A 3D caricature is an exaggerated 3D depiction of a human face. The goal of
this paper is to model the variations of 3D caricatures in a compact parameter
space so that we can provide a useful data-driven toolkit for handling 3D
caricature deformations. To achieve the goal, we propose an MLP-based framework
for building a deformable surface model, which takes a latent code and produces
a 3D surface. In the framework, a SIREN MLP models a function that takes a 3D
position on a fixed template surface and returns a 3D displacement vector for
the input position. We create variations of 3D surfaces by learning a
hypernetwork that takes a latent code and produces the parameters of the MLP.
Once learned, our deformable model provides a nice editing space for 3D
caricatures, supporting label-based semantic editing and point-handle-based
deformation, both of which produce highly exaggerated and natural 3D caricature
shapes. We also demonstrate other applications of our deformable model, such as
automatic 3D caricature creation.
","[{'version': 'v1', 'created': 'Fri, 29 Jul 2022 10:21:27 GMT'}]",2022-08-01,"[['Jung', 'Yucheol', ''], ['Jang', 'Wonjong', ''], ['Kim', 'Soongjin', ''], ['Yang', 'Jiaolong', ''], ['Tong', 'Xin', ''], ['Lee', 'Seungyong', '']]","['Deformable model', 'Parametric model', '3D face model', 'Semantic 3Dface control', '3D face deformation', 'Auto-decoder']"
11850,2011.03574,Uri Alon,"Ben Finkelshtein, Chaim Baskin, Evgenii Zheltonozhskii, Uri Alon",Single-Node Attacks for Fooling Graph Neural Networks,Appeared in Neurocomputing,,10.1016/j.neucom.2022.09.115,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Graph neural networks (GNNs) have shown broad applicability in a variety of
domains. These domains, e.g., social networks and product recommendations, are
fertile ground for malicious users and behavior. In this paper, we show that
GNNs are vulnerable to the extremely limited (and thus quite realistic)
scenarios of a single-node adversarial attack, where the perturbed node cannot
be chosen by the attacker. That is, an attacker can force the GNN to classify
any target node to a chosen label, by only slightly perturbing the features or
the neighbor list of another single arbitrary node in the graph, even when not
being able to select that specific attacker node. When the adversary is allowed
to select the attacker node, these attacks are even more effective. We
demonstrate empirically that our attack is effective across various common GNN
types (e.g., GCN, GraphSAGE, GAT, GIN) and robustly optimized GNNs (e.g.,
Robust GCN, SM GCN, GAL, LAT-GCN), outperforming previous attacks across
different real-world datasets both in a targeted and non-targeted attacks. Our
code is available at https://github.com/benfinkelshtein/SINGLE .
","[{'version': 'v1', 'created': 'Fri, 6 Nov 2020 19:59:39 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Sep 2022 17:37:33 GMT'}]",2022-09-30,"[['Finkelshtein', 'Ben', ''], ['Baskin', 'Chaim', ''], ['Zheltonozhskii', 'Evgenii', ''], ['Alon', 'Uri', '']]","['Graph neural networks', 'adversarial robustness', 'node classification']"
11851,2210.09463,Zhan Xu,"Zhan Xu, Yang Zhou, Li Yi, Evangelos Kalogerakis",Morig: Motion-aware rigging of character meshes from point clouds,SIGGRAPH ASIA 2022,,10.1145/3550469.3555390,,cs.GR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present MoRig, a method that automatically rigs character meshes driven by
single-view point cloud streams capturing the motion of performing characters.
Our method is also able to animate the 3D meshes according to the captured
point cloud motion. MoRig's neural network encodes motion cues from the point
clouds into features that are informative about the articulated parts of the
performing character. These motion-aware features guide the inference of an
appropriate skeletal rig for the input mesh, which is then animated based on
the point cloud motion. Our method can rig and animate diverse characters,
including humanoids, quadrupeds, and toys with varying articulation. It
accounts for occluded regions in the point clouds and mismatches in the part
proportions between the input mesh and captured character. Compared to other
rigging approaches that ignore motion cues, MoRig produces more accurate rigs,
well-suited for re-targeting motion from captured characters.
","[{'version': 'v1', 'created': 'Mon, 17 Oct 2022 22:28:59 GMT'}]",2022-10-19,"[['Xu', 'Zhan', ''], ['Zhou', 'Yang', ''], ['Yi', 'Li', ''], ['Kalogerakis', 'Evangelos', '']]","['character rigging', 'animation', 'neural networks', 'transformers']"
11852,2007.07138,Sabah Al-Fedaghi Dr.,Sabah Al-Fedaghi,Modeling the Semantics of States and State Machines,"15 pages, 17 figures","Journal of Computer Science 2020, 16 (7): 891-905",10.3844/jcssp.2020.891.905,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A system s behavior is typically specified through models such as state
diagrams that describe how the system should behave. According to researchers,
it is not clear what a state actually represents regarding the system to be
modeled. Standards do not provide adequate definitions of or sufficient
guidance on the use of states. Studies show these inconsistencies can lead to
poor or incomplete specifications, which in turn could result in project delays
or increase the cost of the system design. This paper aims to establish a
precise definition of the notion of states and state machines, a goal motivated
by system modelers (e.g., requirement engineers) need to understand key
concepts and vocabulary such as states and state machine, which are major
behavioral modeling tools (e.g., in UML). State is the main notion of a state
machine in which events drive state changes. This raises questions about the
nature of these state-related notations. The semantics of these concepts is
based on a new modeling methodology called the thinging machine applied to a
number of examples of existing models. The thinging machine semantics is
founded on five elementary actions that divide the static model into
changes/states upon which events are defined.
","[{'version': 'v1', 'created': 'Tue, 14 Jul 2020 15:57:07 GMT'}]",2020-07-15,"[['Al-Fedaghi', 'Sabah', '']]","['State', 'State Machine', 'System Behavior', 'Conceptual Model', 'Modeling Change', 'Events']"
11853,2201.06842,Nguyen Huynh,Zhiheng Jiang and Hoai Nguyen Huynh,Unveiling music genre structure through common-interest communities,"19 pages, 6 figures","Social Network Analysis and Mining, 12:35 (2022)",10.1007/s13278-022-00863-2,,cs.SI physics.soc-ph,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Using a dataset of more than 90,000 metal music reviews written by over 9,000
users in a period of 15 years, we analyse the genre structure of metal music
with the aid of review text information. We model the relationships between
genres using a user-oriented network, based on the written reviews. We then
perform community detection and employ a network ""averaging"" method to obtain
stable genre clusters, in order to analyse the structures of clusters both
locally within each cluster and globally over the entire network. In addition
to identifying the clusters, we use Dependency Parsing and modified Term
Frequency - Inverse Document Frequency to extract significant and unique
features of each cluster. These structures and review text information can
allow us to understand how music audience (fans) perceive similar and different
genres, and also assist in classifying different genres which share
common-interest user communities, offering a more objective way in grouping
music genres. Furthermore, the classification can also help recommendation
engines provide more targeted suggestions of music, and potentially help
musicians to select genre labels for their music, and design music to better
cater to preferences of their audiences based on previous reviews.
","[{'version': 'v1', 'created': 'Tue, 18 Jan 2022 09:36:27 GMT'}]",2022-02-15,"[['Jiang', 'Zhiheng', ''], ['Huynh', 'Hoai Nguyen', '']]","['Complex networks', 'Social networks', 'Community detection', 'Music genre', 'Metalmusic', 'Text mining']"
11854,2006.16910,Jean-Baptiste Lamy,Jean-Baptiste Lamy,"A data science approach to drug safety: Semantic and visual mining of
  adverse drug events from clinical trials of pain treatments","13 pages, 15 figures",Artificial Intelligence in Medicine 2021;115:102074,10.1016/j.artmed.2021.102074,,cs.CY cs.AI q-bio.QM,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Clinical trials are the basis of Evidence-Based Medicine. Trial results are
reviewed by experts and consensus panels for producing meta-analyses and
clinical practice guidelines. However, reviewing these results is a long and
tedious task, hence the meta-analyses and guidelines are not updated each time
a new trial is published. Moreover, the independence of experts may be
difficult to appraise. On the contrary, in many other domains, including
medical risk analysis, the advent of data science, big data and visual
analytics allowed moving from expert-based to fact-based knowledge. Since 12
years, many trial results are publicly available online in trial registries.
Nevertheless, data science methods have not yet been applied widely to trial
data. In this paper, we present a platform for analyzing the safety events
reported during clinical trials and published in trial registries. This
platform is based on an ontological model including 582 trials on pain
treatments, and uses semantic web technologies for querying this dataset at
various levels of granularity. It also relies on a 26-dimensional flower glyph
for the visualization of the Adverse Drug Events (ADE) rates in 13 categories
and 2 levels of seriousness. We illustrate the interest of this platform
through several use cases and we were able to find back conclusions that were
initially found during meta-analyses. The platform was presented to four
experts in drug safety, and is publicly available online, with the ontology of
pain treatment ADE.
","[{'version': 'v1', 'created': 'Fri, 19 Jun 2020 14:37:36 GMT'}, {'version': 'v2', 'created': 'Sat, 17 Apr 2021 12:25:33 GMT'}]",2021-04-21,"[['Lamy', 'Jean-Baptiste', '']]","['Data mining', 'Ontology', 'Visual analytics', 'Glyph', 'Drug safety', 'Adverse drug events', 'Pain treatments', 'Painkillers']"
11855,cs/0609023,Himanshu Thapliyal,"Himanshu Thapliyal, M. B. Srinivas","Novel Reversible TSG Gate and Its Application for Designing Components
  of Primitive Reversible/Quantum ALU","5 Pages; Published in Proceedings of the Fifth IEEE International
  Conference on Information, Communications and Signal Processing (ICICS 2005),
  Bangkok, Thailand, 6-9 December 2005,pp.1425-1429",,10.1109/ICICS.2005.1689293,,cs.AR,,"  In recent years, reversible logic has emerged as a promising computing
paradigm having application in low power CMOS, quantum computing,
nanotechnology, and optical computing. The classical set of gates such as AND,
OR, and EXOR are not reversible. This paper utilizes a new 4 * 4 reversible
gate called TSG gate to build the components of a primitive reversible/quantum
ALU. The most significant aspect of the TSG gate is that it can work singly as
a reversible full adder, that is reversible full adder can now be implemented
with a single gate only. A Novel reversible 4:2 compressor is also designed
from the TSG gate which is later used to design a novel 8x8 reversible Wallace
tree multiplier. It is proved that the adder, 4:2 compressor and multiplier
architectures designed using the TSG gate are better than their counterparts
available in literature, in terms of number of reversible gates and garbage
outputs. This is perhaps, the first attempt to design a reversible 4:2
compressor and a reversible Wallace tree multiplier as far as existing
literature and our knowledge is concerned. Thus, this paper provides an initial
threshold to build more complex systems which can execute complicated
operations using reversible logic.
","[{'version': 'v1', 'created': 'Wed, 6 Sep 2006 16:09:04 GMT'}]",2016-11-17,"[['Thapliyal', 'Himanshu', ''], ['Srinivas', 'M. B.', '']]","['Reversible Logic', 'Quantum Computing', 'Reversible gates', 'TSG Gate', 'Reversible ALU']"
11856,2211.15095,Dhanalakshmi M Mrs,Dhanalakshmi M and Radha V,"Discretized Linear Regression and Multiclass Support Vector Based Air
  Pollution Forecasting Technique","9 pages, 7 figures, Published with International Journal of
  Engineering Trends and Technology (IJETT)","International Journal of Engineering Trends and Technology, vol.
  70, no. 11, pp. 315-323, 2022",10.14445/22315381/IJETT-V70I11P234,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Air pollution is a vital issue emerging from the uncontrolled utilization of
traditional energy sources as far as developing countries are concerned. Hence,
ingenious air pollution forecasting methods are indispensable to minimize the
risk. To that end, this paper proposes an Internet of Things (IoT) enabled
system for monitoring and controlling air pollution in the cloud computing
environment. A method called Linear Regression and Multiclass Support Vector
(LR-MSV) IoT-based Air Pollution Forecast is proposed to monitor the air
quality data and the air quality index measurement to pave the way for
controlling effectively. Extensive experiments carried out on the air quality
data in the India dataset have revealed the outstanding performance of the
proposed LR-MSV method when benchmarked with well-established state-of-the-art
methods. The results obtained by the LR-MSV method witness a significant
increase in air pollution forecasting accuracy by reducing the air pollution
forecasting time and error rate compared with the results produced by the other
state-of-the-art methods
","[{'version': 'v1', 'created': 'Mon, 28 Nov 2022 06:51:59 GMT'}]",2022-11-29,"[['M', 'Dhanalakshmi', ''], ['V', 'Radha', '']]","['Internet of Things', 'Cloud Computing', 'Wavelet', 'Sliding Window', 'Linear Regression', 'Correlation', 'Multiclass', 'Support Vector']"
11857,2006.02951,Gasper Begus,Ga\v{s}per Begu\v{s},"CiwGAN and fiwGAN: Encoding information in acoustic data to model
  lexical learning with Generative Adversarial Networks",Published in Neural Networks,"Neural Networks 139 (2021), pp. 305-325",10.1016/j.neunet.2021.03.017,,cs.CL cs.LG,http://creativecommons.org/licenses/by/4.0/,"  How can deep neural networks encode information that corresponds to words in
human speech into raw acoustic data? This paper proposes two neural network
architectures for modeling unsupervised lexical learning from raw acoustic
inputs, ciwGAN (Categorical InfoWaveGAN) and fiwGAN (Featural InfoWaveGAN),
that combine a Deep Convolutional GAN architecture for audio data (WaveGAN;
arXiv:1705.07904) with an information theoretic extension of GAN -- InfoGAN
(arXiv:1606.03657), and propose a new latent space structure that can model
featural learning simultaneously with a higher level classification and allows
for a very low-dimension vector representation of lexical items. Lexical
learning is modeled as emergent from an architecture that forces a deep neural
network to output data such that unique information is retrievable from its
acoustic outputs. The networks trained on lexical items from TIMIT learn to
encode unique information corresponding to lexical items in the form of
categorical variables in their latent space. By manipulating these variables,
the network outputs specific lexical items. The network occasionally outputs
innovative lexical items that violate training data, but are linguistically
interpretable and highly informative for cognitive modeling and neural network
interpretability. Innovative outputs suggest that phonetic and phonological
representations learned by the network can be productively recombined and
directly paralleled to productivity in human speech: a fiwGAN network trained
on `suit' and `dark' outputs innovative `start', even though it never saw
`start' or even a [st] sequence in the training data. We also argue that
setting latent featural codes to values well beyond training range results in
almost categorical generation of prototypical lexical items and reveals
underlying values of each latent code.
","[{'version': 'v1', 'created': 'Thu, 4 Jun 2020 15:33:55 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Dec 2020 07:02:03 GMT'}, {'version': 'v3', 'created': 'Wed, 28 Jul 2021 10:31:31 GMT'}]",2021-07-29,"[['Beguš', 'Gašper', '']]","['artificial intelligence', 'generative adversarial networks', 'speech', 'lexical learning', 'neuralnetwork interpretability', 'acoustic word embedding']"
11858,2001.02542,Pierre-Alexandre Beaufort Ir,"Pierre-Alexandre Beaufort, Christophe Geuzaine, Jean-Fran\c{c}ois
  Remacle","Automatic surface mesh generation for discrete models: A complete and
  automatic pipeline based on reparameterization",Images have lower quality in order to meet arxiv requirements,,10.1016/j.jcp.2020.109575,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Triangulations are an ubiquitous input for the finite element community.
However, most raw triangulations obtained by imaging techniques are unsuitable
as-is for finite element analysis. In this paper, we give a robust pipeline for
handling those triangulations, based on the computation of a one-to-one
parametrization for automatically selected patches of input triangles, which
makes each patch amenable to remeshing by standard finite element meshing
algorithms. Using only geometrical arguments, we prove that a discrete
parametrization of a patch is one-to-one if (and only if) its image in the
parameter space is such that all parametric triangles have a positive area. We
then derive a non-standard linear discretization scheme based on mean value
coordinates to compute such one-to-one parametrizations, and show that the
scheme does not discretize a Laplacian on a structured mesh. The proposed
pipeline is implemented in the open source mesh generator Gmsh, where the
creation of suitable patches is based on triangulation topology and
parametrization quality, combined with feature edge detection. Several examples
illustrate the robustness of the resulting implementation.
","[{'version': 'v1', 'created': 'Wed, 8 Jan 2020 14:19:54 GMT'}]",2020-07-15,"[['Beaufort', 'Pierre-Alexandre', ''], ['Geuzaine', 'Christophe', ''], ['Remacle', 'Jean-François', '']]","['Triangulations', 'Finite Element', 'Remeshing', 'Parametrization', 'Mean Value Coordinates', 'Gmsh', 'Feature Edge', 'Longest Edge Bisection']"
11859,2201.00563,Tarik A. Rashid,"Dosti Kh. Abbas, Tarik A. Rashid, Karmand H. Abdallaand Nebojsa
  Bacanin, Abeer Alsadoon",Using Fitness Dependent Optimizer for Training Multi-layer Perceptron,12 pages,"Journal of Internet Technology, 2021",10.53106/160792642021122207011,,cs.NE,http://creativecommons.org/licenses/by/4.0/,"  This study presents a novel training algorithm depending upon the recently
proposed Fitness Dependent Optimizer (FDO). The stability of this algorithm has
been verified and performance-proofed in both the exploration and exploitation
stages using some standard measurements. This influenced our target to gauge
the performance of the algorithm in training multilayer perceptron neural
networks (MLP). This study combines FDO with MLP (codename FDO-MLP) for
optimizing weights and biases to predict outcomes of students. This study can
improve the learning system in terms of the educational background of students
besides increasing their achievements. The experimental results of this
approach are affirmed by comparing with the Back-Propagation algorithm (BP) and
some evolutionary models such as FDO with cascade MLP (FDO-CMLP), Grey Wolf
Optimizer (GWO) combined with MLP (GWO-MLP), modified GWO combined with MLP
(MGWO-MLP), GWO with cascade MLP (GWO-CMLP), and modified GWO with cascade MLP
(MGWO-CMLP). The qualitative and quantitative results prove that the proposed
approach using FDO as a trainer can outperform the other approaches using
different trainers on the dataset in terms of convergence speed and local
optima avoidance. The proposed FDO-MLP approach classifies with a rate of 0.97.
","[{'version': 'v1', 'created': 'Mon, 3 Jan 2022 10:23:17 GMT'}]",2022-01-04,"[['Abbas', 'Dosti Kh.', ''], ['Rashid', 'Tarik A.', ''], ['Bacanin', 'Karmand H. Abdallaand Nebojsa', ''], ['Alsadoon', 'Abeer', '']]","['Optimization', 'Multilayer perceptron', 'Fitness dependent optimizer', 'Training neural network', 'Academic student Performance']"
11860,2208.12650,Yaniv Yacoby,"Yaniv Yacoby, John Girash, David C. Parkes","Empowering First-Year Computer Science Ph.D. Students to Create a
  Culture that Values Community and Mental Health",Accepted at SIGCSE 2023,,10.1145/3545945.3569751,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Doctoral programs often have high rates of depression, anxiety, isolation,
and imposter phenomenon. Consequently, graduating students may feel
inadequately prepared for research-focused careers, contributing to an
attrition of talent. Prior work identifies an important contributing factor to
maladjustment: even with prior exposure to research, entering Ph.D. students
often have problematically idealized views of science. These preconceptions can
become obstacles for students in their own professional growth. Unfortunately,
existing curricular and extracurricular programming in many doctoral programs
fail to include mechanisms to systematically address students' misconceptions
of their profession. In this work, we describe a new initiative at our
institution that aims to address Ph.D. mental health via a mandatory seminar
for entering doctoral students. The seminar is designed to build professional
resilience in students by (1) increasing self-regulatory competence, and (2)
teaching students to proactively examine academic cultural values and to
participate in shaping them. Our evaluation indicates that students improved in
both areas after completing the seminar.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2022 20:24:48 GMT'}, {'version': 'v2', 'created': 'Sat, 10 Dec 2022 20:17:31 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Dec 2022 00:53:03 GMT'}]",2022-12-22,"[['Yacoby', 'Yaniv', ''], ['Girash', 'John', ''], ['Parkes', 'David C.', '']]","['mental health in doctoral programs', 'social isolation in doctoralprograms', 'self-regulation', 'self-efficacy', 'imposter phenomenon']"
11861,2203.16042,Jiangtao Gong,"Siling Guo, Tianchen Sun, Jiangtao Gong, Zhicong Lu, Liuxin Zhang,
  Qianying Wang","Remote Co-teaching in Rural Classroom: Current Practices, Impacts, and
  Challenges","16 pages, 6 figures, SIGCHI 2022",,10.1145/3491102.3501924,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The shortage of high-quality teachers is one of the biggest educational
problems faced by underdeveloped areas. With the development of information and
communication technologies (ICTs), China has begun a remote co-teaching
intervention program using ICTs for rural classes, forming a unique co-teaching
classroom. We conducted semi-structured interviews with nine remote urban
teachers and twelve local rural teachers. We identified the remote co-teaching
classes standard practices and co-teachers collaborative work process. We also
found that remote teachers high-quality class directly impacted local teachers
and students. Furthermore, interestingly, local teachers were also actively
involved in making indirect impacts on their students by deeply coordinating
with remote teachers and adapting the resources offered by the remote teachers.
We conclude by summarizing and discussing the challenges faced by teachers,
lessons learned from the current program, and related design implications to
achieve a more adaptive and sustainable ICT4D program design.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2022 04:19:14 GMT'}]",2022-03-31,"[['Guo', 'Siling', ''], ['Sun', 'Tianchen', ''], ['Gong', 'Jiangtao', ''], ['Lu', 'Zhicong', ''], ['Zhang', 'Liuxin', ''], ['Wang', 'Qianying', '']]","['ICT4D/E', 'remote collaboration', 'rural education', 'educational inequality']"
11862,1911.06319,Jonathan Baxter,Jonathan Baxter,"The Canonical Distortion Measure for Vector Quantization and Function
  Approximation",,"In: Thrun S., Pratt L. (eds) Learning to Learn (1998). Pages
  159-177",10.1007/978-1-4615-5529-2_7,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To measure the quality of a set of vector quantization points a means of
measuring the distance between a random point and its quantization is required.
Common metrics such as the {\em Hamming} and {\em Euclidean} metrics, while
mathematically simple, are inappropriate for comparing natural signals such as
speech or images. In this paper it is shown how an {\em environment} of
functions on an input space $X$ induces a {\em canonical distortion measure}
(CDM) on X. The depiction 'canonical"" is justified because it is shown that
optimizing the reconstruction error of X with respect to the CDM gives rise to
optimal piecewise constant approximations of the functions in the environment.
The CDM is calculated in closed form for several different function classes. An
algorithm for training neural networks to implement the CDM is presented along
with some encouraging experimental results.
","[{'version': 'v1', 'created': 'Thu, 14 Nov 2019 18:59:38 GMT'}]",2019-11-15,"[['Baxter', 'Jonathan', '']]","['Canonical Distortion', 'Learning Distance Measures', 'Vector Quantization']"
11863,2210.11166,Leonhard Balduf,"Leonhard Balduf, Martin Florian, Bj\""orn Scheuermann","Dude, where's my NFT? Distributed Infrastructures for Digital Art",To be presented at the DICG Workshop 2022,,10.1145/3565383.3566106,,cs.NI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore issues relating to the storage of digital art, based on an
empirical investigation into the storage of audiovisual data referenced by
non-fungible tokens (NFTs). We identify current trends in NFT data storage and
highlight problems with implemented solutions. We particularly focus our
investigation on the use of the Interplanetary Filesystem (IPFS), which emerges
as a popular and versatile distributed storage solution for NFTs. Based on the
analysis of discovered data storage techniques, we propose a set of best
practices to ensure long-term storage survivability of NFT data. While helpful
for forming the NFT art market into a legitimate long-term environment for
digital art, our recommendations are also directly applicable for improving the
availability and integrity of non-NFT digital art.
","[{'version': 'v1', 'created': 'Thu, 20 Oct 2022 11:05:46 GMT'}]",2022-10-21,"[['Balduf', 'Leonhard', ''], ['Florian', 'Martin', ''], ['Scheuermann', 'Björn', '']]","['non-fungible tokens', 'storage systems', 'ipfs', 'blockchain']"
11864,1904.06809,Ao Liu,"Ao Liu, Lirong Xia, Andrew Duchowski, Reynold Bailey, Kenneth
  Holmqvist, Eakta Jain",Differential Privacy for Eye-Tracking Data,10 pages including appendix,,10.1145/3314111.3319823,,cs.CR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As large eye-tracking datasets are created, data privacy is a pressing
concern for the eye-tracking community. De-identifying data does not guarantee
privacy because multiple datasets can be linked for inferences. A common belief
is that aggregating individuals' data into composite representations such as
heatmaps protects the individual. However, we analytically examine the privacy
of (noise-free) heatmaps and show that they do not guarantee privacy. We
further propose two noise mechanisms that guarantee privacy and analyze their
privacy-utility tradeoff. Analysis reveals that our Gaussian noise mechanism is
an elegant solution to preserve privacy for heatmaps. Our results have
implications for interdisciplinary research to create differentially private
mechanisms for eye tracking.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2019 02:23:01 GMT'}]",2019-04-16,"[['Liu', 'Ao', ''], ['Xia', 'Lirong', ''], ['Duchowski', 'Andrew', ''], ['Bailey', 'Reynold', ''], ['Holmqvist', 'Kenneth', ''], ['Jain', 'Eakta', '']]","['Eye-tracking', 'Differential Privacy', 'Privacy-Utility Tradeoff', 'Heatmaps']"
11865,2208.07792,Jiazheng Zhang,"Jiazheng Zhang, Bang Wang","Dismantling Complex Networks by a Neural Model Trained from Tiny
  Networks",To be published at CIKM 2022 as a full paper,,10.1145/3511808.3557290,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Can we employ one neural model to efficiently dismantle many complex yet
unique networks? This article provides an affirmative answer. Diverse
real-world systems can be abstracted as complex networks each consisting of
many functional nodes and edges. Percolation theory has indicated that removing
only a few vital nodes can cause the collapse of whole network. However,
finding the least number of such vital nodes is a rather challenging task for
large networks due to its NP-hardness. Previous studies have proposed many
centrality measures and heuristic algorithms to tackle this network dismantling
(ND) problem. Different from theirs, this article tries to approach the ND task
by designing a neural model which can be trained from tiny synthetic networks
but will be applied for various real-world networks. It seems a discouraging
mission at first sight, as network sizes and topologies are quite different
across distinct real-world networks. Nonetheless, this article initiates
insightful efforts of designing and training a neural influence ranking model
(NIRM). Experiments on fifteen real-world networks validate its effectiveness
for its mostly requiring fewer vital nodes to dismantle a network, compared
with the state-of-the-art competitors. The key to its success lies in that our
NIRM can efficiently encode both local structural and global topological
signals for ranking nodes, in addition to our innovative labelling method in
training dataset construction.
","[{'version': 'v1', 'created': 'Tue, 16 Aug 2022 15:03:19 GMT'}]",2022-08-17,"[['Zhang', 'Jiazheng', ''], ['Wang', 'Bang', '']]","['Network Dismantling', 'Neural Node Ranking Method', 'Graph NeuralNetworks', 'Complex Networks']"
11866,2206.00352,Battista Biggio,"Huang Xiao, Battista Biggio, Blaine Nelson, Han Xiao, Claudia Eckert,
  Fabio Roli",Support Vector Machines under Adversarial Label Contamination,,"Neurocomputing, Special Issue on Advances in Learning with Label
  Noise, 160(0):53-62, 2015",10.1016/j.neucom.2014.08.081,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning algorithms are increasingly being applied in
security-related tasks such as spam and malware detection, although their
security properties against deliberate attacks have not yet been widely
understood. Intelligent and adaptive attackers may indeed exploit specific
vulnerabilities exposed by machine learning techniques to violate system
security. Being robust to adversarial data manipulation is thus an important,
additional requirement for machine learning algorithms to successfully operate
in adversarial settings. In this work, we evaluate the security of Support
Vector Machines (SVMs) to well-crafted, adversarial label noise attacks. In
particular, we consider an attacker that aims to maximize the SVM's
classification error by flipping a number of labels in the training data. We
formalize a corresponding optimal attack strategy, and solve it by means of
heuristic approaches to keep the computational complexity tractable. We report
an extensive experimental analysis on the effectiveness of the considered
attacks against linear and non-linear SVMs, both on synthetic and real-world
datasets. We finally argue that our approach can also provide useful insights
for developing more secure SVM learning algorithms, and also novel techniques
in a number of related research areas, such as semi-supervised and active
learning.
","[{'version': 'v1', 'created': 'Wed, 1 Jun 2022 09:38:07 GMT'}]",2022-06-02,"[['Xiao', 'Huang', ''], ['Biggio', 'Battista', ''], ['Nelson', 'Blaine', ''], ['Xiao', 'Han', ''], ['Eckert', 'Claudia', ''], ['Roli', 'Fabio', '']]","['Support Vector Machines', 'Adversarial Learning', 'Label Noise', 'Label Flip Attacks']"
11867,2010.05495,Christoph Kamann,"Christoph Kamann, Burkhard G\""ussefeld, Robin Hutmacher, Jan Hendrik
  Metzen, Carsten Rother","Increasing the Robustness of Semantic Segmentation Models with
  Painting-by-Numbers",,,10.1007/978-3-030-58607-2_22,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For safety-critical applications such as autonomous driving, CNNs have to be
robust with respect to unavoidable image corruptions, such as image noise.
While previous works addressed the task of robust prediction in the context of
full-image classification, we consider it for dense semantic segmentation. We
build upon an insight from image classification that output robustness can be
improved by increasing the network-bias towards object shapes. We present a new
training schema that increases this shape bias. Our basic idea is to
alpha-blend a portion of the RGB training images with faked images, where each
class-label is given a fixed, randomly chosen color that is not likely to
appear in real imagery. This forces the network to rely more strongly on shape
cues. We call this data augmentation technique ``Painting-by-Numbers''. We
demonstrate the effectiveness of our training schema for DeepLabv3+ with
various network backbones, MobileNet-V2, ResNets, and Xception, and evaluate it
on the Cityscapes dataset. With respect to our 16 different types of image
corruptions and 5 different network backbones, we are in 74% better than
training with clean data. For cases where we are worse than a model trained
without our training schema, it is mostly only marginally worse. However, for
some image corruptions such as images with noise, we see a considerable
performance gain of up to 25%.
","[{'version': 'v1', 'created': 'Mon, 12 Oct 2020 07:42:39 GMT'}]",2020-11-11,"[['Kamann', 'Christoph', ''], ['Güssefeld', 'Burkhard', ''], ['Hutmacher', 'Robin', ''], ['Metzen', 'Jan Hendrik', ''], ['Rother', 'Carsten', '']]","['Semantic segmentation', 'shape-bias', 'corruption robustness']"
11868,1601.02300,Marian-Andrei Rizoiu,"Young-Min Kim, Julien Velcin, St\'ephane Bonnevay, Marian-Andrei
  Rizoiu","Temporal Multinomial Mixture for Instance-Oriented Evolutionary
  Clustering",,,10.1007/978-3-319-16354-3_66,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evolutionary clustering aims at capturing the temporal evolution of clusters.
This issue is particularly important in the context of social media data that
are naturally temporally driven. In this paper, we propose a new probabilistic
model-based evolutionary clustering technique. The Temporal Multinomial Mixture
(TMM) is an extension of classical mixture model that optimizes feature
co-occurrences in the trade-off with temporal smoothness. Our model is
evaluated for two recent case studies on opinion aggregation over time. We
compare four different probabilistic clustering models and we show the
superiority of our proposal in the task of instance-oriented clustering.
","[{'version': 'v1', 'created': 'Mon, 11 Jan 2016 02:06:36 GMT'}]",2016-01-12,"[['Kim', 'Young-Min', ''], ['Velcin', 'Julien', ''], ['Bonnevay', 'Stéphane', ''], ['Rizoiu', 'Marian-Andrei', '']]","['Evolutionary clustering', 'mixture model', 'temporal analysis']"
11869,2210.08934,Xiaojian Liao,"Xiaojian Liao, Zhe Yang, Jiwu Shu",RIO: Order-Preserving and CPU-Efficient Remote Storage Access,,,10.1145/3552326.3567495,,cs.OS,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Modern NVMe SSDs and RDMA networks provide dramatically higher bandwidth and
concurrency. Existing networked storage systems (e.g., NVMe over Fabrics) fail
to fully exploit these new devices due to inefficient storage ordering
guarantees. Severe synchronous execution for storage order in these systems
stalls the CPU and I/O devices and lowers the CPU and I/O performance
efficiency of the storage system.
  We present Rio, a new approach to the storage order of remote storage access.
The key insight in Rio is that the layered design of the software stack, along
with the concurrent and asynchronous network and storage devices, makes the
storage stack conceptually similar to the CPU pipeline. Inspired by the CPU
pipeline that executes out-of-order and commits in-order, Rio introduces the
I/O pipeline that allows internal out-of-order and asynchronous execution for
ordered write requests while offering intact external storage order to
applications. Together with merging consecutive ordered requests, these design
decisions make for write throughput and CPU efficiency close to that of
orderless requests.
  We implement Rio in Linux NVMe over RDMA stack, and further build a file
system named RioFS atop Rio. Evaluations show that Rio outperforms Linux NVMe
over RDMA and a state-of-the-art storage stack named Horae by two orders of
magnitude and 4.9 times on average in terms of throughput of ordered write
requests, respectively. RioFS increases the throughput of RocksDB by 1.9 times
and 1.5 times on average, against Ext4 and HoraeFS, respectively.
","[{'version': 'v1', 'created': 'Mon, 17 Oct 2022 10:55:15 GMT'}]",2022-10-18,"[['Liao', 'Xiaojian', ''], ['Yang', 'Zhe', ''], ['Shu', 'Jiwu', '']]","['Storage Order', 'NVMe over Fabrics', 'Flash', 'FileSystem', 'SSD']"
11870,2012.02298,Chao Du,"Chao Du, Zhifeng Gao, Shuo Yuan, Lining Gao, Ziyan Li, Yifan Zeng,
  Xiaoqiang Zhu, Jian Xu, Kun Gai, Kuang-chih Lee","Exploration in Online Advertising Systems with Deep Uncertainty-Aware
  Learning",SIGKDD 2021,,10.1145/3447548.3467089,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern online advertising systems inevitably rely on personalization methods,
such as click-through rate (CTR) prediction. Recent progress in CTR prediction
enjoys the rich representation capabilities of deep learning and achieves great
success in large-scale industrial applications. However, these methods can
suffer from lack of exploration. Another line of prior work addresses the
exploration-exploitation trade-off problem with contextual bandit methods,
which are recently less studied in the industry due to the difficulty in
extending their flexibility with deep models. In this paper, we propose a novel
Deep Uncertainty-Aware Learning (DUAL) method to learn CTR models based on
Gaussian processes, which can provide predictive uncertainty estimations while
maintaining the flexibility of deep neural networks. DUAL can be easily
implemented on existing models and deployed in real-time systems with minimal
extra computational overhead. By linking the predictive uncertainty estimation
ability of DUAL to well-known bandit algorithms, we further present DUAL-based
Ad-ranking strategies to boost up long-term utilities such as the social
welfare in advertising systems. Experimental results on several public datasets
demonstrate the effectiveness of our methods. Remarkably, an online A/B test
deployed in the Alibaba display advertising platform shows an 8.2% social
welfare improvement and an 8.0% revenue lift.
","[{'version': 'v1', 'created': 'Wed, 25 Nov 2020 17:23:52 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Jun 2021 06:28:13 GMT'}]",2021-06-16,"[['Du', 'Chao', ''], ['Gao', 'Zhifeng', ''], ['Yuan', 'Shuo', ''], ['Gao', 'Lining', ''], ['Li', 'Ziyan', ''], ['Zeng', 'Yifan', ''], ['Zhu', 'Xiaoqiang', ''], ['Xu', 'Jian', ''], ['Gai', 'Kun', ''], ['Lee', 'Kuang-chih', '']]","['click-through rate (CTR)', 'exploration-exploitation trade-off', 'advertising system', 'Gaussian process']"
11871,2012.06473,Mich\`ele Weiland,Michele Weiland and Bernhard Homoelle,"Usage Scenarios for Byte-Addressable Persistent Memory
  inHigh-Performance and Data Intensive Computing",,,10.1007/s11390-020-0776-8,,cs.DC cs.PF,http://creativecommons.org/licenses/by/4.0/,"  Byte-addressable persistent memory (B-APM) presents a new opportunity to
bridge the performance gap between main memory and storage. In this paper, we
present the usage scenarios for this new technology, based on the capabilities
of Intel's DCPMM. We outline some of the basic performance characteristics of
DCPMM, and explain how it can be configured and used to address the needs of
memory and I/O intensive applications in the HPC and data intensive domains.
Two decision trees are presented to advise on the configuration options for
B-APM; their use is illustrated with two examples. We show that the flexibility
of the technology has the potential to be truly disruptive, not only because of
the performance improvements it can deliver, but also because it allows systems
to cater for wider range of applications on homogeneous hardware.
","[{'version': 'v1', 'created': 'Thu, 10 Dec 2020 10:35:52 GMT'}]",2020-12-14,"[['Weiland', 'Michele', ''], ['Homoelle', 'Bernhard', '']]","['byte-addressable', 'data intensive', 'memory intensive', 'persistent']"
11872,2004.07663,Brittany Reid,"Brittany Reid, Christoph Treude, Markus Wagner",Optimising the Fit of Stack Overflow Code Snippets into Existing Code,Submitted to GECCO 2020 GI Workshop,,10.1145/3377929.3398087,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software developers often reuse code from online sources such as Stack
Overflow within their projects. However, the process of searching for code
snippets and integrating them within existing source code can be tedious. In
order to improve efficiency and reduce time spent on code reuse, we present an
automated code reuse tool for the Eclipse IDE (Integrated Developer
Environment), NLP2TestableCode. NLP2TestableCode can not only search for Java
code snippets using natural language tasks, but also evaluate code snippets
based on a user's existing code, modify snippets to improve fit and correct
errors, before presenting the user with the best snippet, all without leaving
the editor. NLP2TestableCode also includes functionality to automatically
generate customisable test cases and suggest argument and return types, in
order to further evaluate code snippets. In evaluation, NLP2TestableCode was
capable of finding compilable code snippets for 82.9% of tasks, and testable
code snippets for 42.9%.
","[{'version': 'v1', 'created': 'Thu, 16 Apr 2020 13:56:28 GMT'}]",2021-01-05,"[['Reid', 'Brittany', ''], ['Treude', 'Christoph', ''], ['Wagner', 'Markus', '']]","['Crowd-generated code snippets', 'Stack Overflow', 'Optimisation']"
11873,2203.02652,Weiqi Sun,"Weiqi Sun, Haidar Khan, Nicolas Guenon des Mesnards, Melanie Rubino,
  Konstantine Arkoudas","Unfreeze with Care: Space-Efficient Fine-Tuning of Semantic Parsing
  Models","9 pages, 4 figures, submitted to the ACM Web Conference 2022 (WWW
  '22) and accepted as a full-length research track paper. To be published in
  the proceedings and ACM Digital Library",,10.1145/3485447.3511942,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semantic parsing is a key NLP task that maps natural language to structured
meaning representations. As in many other NLP tasks, SOTA performance in
semantic parsing is now attained by fine-tuning a large pretrained language
model (PLM). While effective, this approach is inefficient in the presence of
multiple downstream tasks, as a new set of values for all parameters of the PLM
needs to be stored for each task separately. Recent work has explored methods
for adapting PLMs to downstream tasks while keeping most (or all) of their
parameters frozen. We examine two such promising techniques, prefix tuning and
bias-term tuning, specifically on semantic parsing. We compare them against
each other on two different semantic parsing datasets, and we also compare them
against full and partial fine-tuning, both in few-shot and conventional data
settings. While prefix tuning is shown to do poorly for semantic parsing tasks
off the shelf, we modify it by adding special token embeddings, which results
in very strong performance without compromising parameter savings.
","[{'version': 'v1', 'created': 'Sat, 5 Mar 2022 04:30:03 GMT'}]",2022-03-08,"[['Sun', 'Weiqi', ''], ['Khan', 'Haidar', ''], ['Mesnards', 'Nicolas Guenon des', ''], ['Rubino', 'Melanie', ''], ['Arkoudas', 'Konstantine', '']]","['semantic parsing', 'pretrained language model', 'prefix tuning', 'BitFit']"
11874,2210.10972,Vijay John Dr,Vijay John and Yasutomo Kawanishi,"A Multimodal Sensor Fusion Framework Robust to Missing Modalities for
  Person Recognition","Accepted for ACM Multimedia Asia, 2022",,10.1145/3551626.3564965,,cs.MM cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Utilizing the sensor characteristics of the audio, visible camera, and
thermal camera, the robustness of person recognition can be enhanced. Existing
multimodal person recognition frameworks are primarily formulated assuming that
multimodal data is always available. In this paper, we propose a novel trimodal
sensor fusion framework using the audio, visible, and thermal camera, which
addresses the missing modality problem. In the framework, a novel deep latent
embedding framework, termed the AVTNet, is proposed to learn multiple latent
embeddings. Also, a novel loss function, termed missing modality loss, accounts
for possible missing modalities based on the triplet loss calculation while
learning the individual latent embeddings. Additionally, a joint latent
embedding utilizing the trimodal data is learnt using the multi-head attention
transformer, which assigns attention weights to the different modalities. The
different latent embeddings are subsequently used to train a deep neural
network. The proposed framework is validated on the Speaking Faces dataset. A
comparative analysis with baseline algorithms shows that the proposed framework
significantly increases the person recognition accuracy while accounting for
missing modalities.
","[{'version': 'v1', 'created': 'Thu, 20 Oct 2022 02:39:48 GMT'}, {'version': 'v2', 'created': 'Sat, 22 Oct 2022 04:51:51 GMT'}]",2022-10-25,"[['John', 'Vijay', ''], ['Kawanishi', 'Yasutomo', '']]","['missing modality loss', 'multimodal transformer', 'person recognition']"
11875,1506.04631,Ivan Yu. Tyukin,"Alexander N. Gorban, Ivan Yu. Tyukin, Danil V. Prokhorov, Konstantin
  I. Sofeikov",Approximation with Random Bases: Pro et Contra,arXiv admin note: text overlap with arXiv:0905.0677,"Information Sciences 364-365, 10 October 2016, Pages 129-145",10.1016/j.ins.2015.09.021,,cs.NA cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we discuss the problem of selecting suitable approximators from
families of parameterized elementary functions that are known to be dense in a
Hilbert space of functions. We consider and analyze published procedures, both
randomized and deterministic, for selecting elements from these families that
have been shown to ensure the rate of convergence in $L_2$ norm of order
$O(1/N)$, where $N$ is the number of elements. We show that both randomized and
deterministic procedures are successful if additional information about the
families of functions to be approximated is provided. In the absence of such
additional information one may observe exponential growth of the number of
terms needed to approximate the function and/or extreme sensitivity of the
outcome of the approximation to parameters. Implications of our analysis for
applications of neural networks in modeling and control are illustrated with
examples.
","[{'version': 'v1', 'created': 'Mon, 15 Jun 2015 15:22:06 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Jun 2015 07:59:25 GMT'}, {'version': 'v3', 'created': 'Tue, 15 Sep 2015 11:57:54 GMT'}, {'version': 'v4', 'created': 'Thu, 17 Sep 2015 15:18:28 GMT'}, {'version': 'v5', 'created': 'Sat, 24 Oct 2015 16:07:26 GMT'}]",2016-09-01,"[['Gorban', 'Alexander N.', ''], ['Tyukin', 'Ivan Yu.', ''], ['Prokhorov', 'Danil V.', ''], ['Sofeikov', 'Konstantin I.', '']]","['Random bases', 'measure concentration', 'neural networks', 'approximation']"
11876,2105.01709,Rifat Shahriyar,"Partha Chakraborty, Rifat Shahriyar, Anindya Iqbal, Gias Uddin","How do developers discuss and support new programming languages in
  technical Q&A site? An empirical study of Go, Swift, and Rust in Stack
  Overflow",Information and Software Technology,Information and Software Technology 137 (2021) 106603,10.1016/j.infsof.2021.106603,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  New programming languages (e.g., Swift, Go, Rust, etc.) are being introduced
to provide a better opportunity for the developers to make software development
robust and easy. At the early stage, a programming language is likely to have
resource constraints that encourage the developers to seek help frequently from
experienced peers active in QA sites such as Stack Overflow (SO). In this
study, we have formally studied the discussions on three popular new languages
introduced after the inception of SO (2008) and match those with the relevant
activities in GitHub whenever appropriate. For that purpose, we have mined
4,17,82,536 questions and answers from SO and 7,846 issue information along
with 6,60,965 repository information from GitHub. Initially, the development of
new languages is relatively slow compared to mature languages (e.g., C, C++,
Java). The expected outcome of this study is to reveal the difficulties and
challenges faced by the developers working with these languages so that
appropriate measures can be taken to expedite the generation of relevant
resources. We have used the LDA method on SO's questions and answers to
identify different topics of new languages. We have extracted several features
of the answer pattern of the new languages from SO to study their
characteristics. These attributes were used to identify difficult topics. We
explored the background of developers who are contributing to these languages.
We have created a model by combining Stack Overflow data and issues,
repository, user data of GitHub. Finally, we have used that model to identify
factors that affect language evolution. We believe that the outcome of our
study is likely to help the owner/sponsor of these languages to design better
features and documentation. It will also help the software developers or
students to prepare themselves to work on these languages in an informed way.
","[{'version': 'v1', 'created': 'Tue, 4 May 2021 19:00:26 GMT'}]",2021-05-06,"[['Chakraborty', 'Partha', ''], ['Shahriyar', 'Rifat', ''], ['Iqbal', 'Anindya', ''], ['Uddin', 'Gias', '']]","['Stack Overflow', 'Swift', 'Go', 'Rust', 'New Language', 'Evolution']"
11877,2103.05100,Jochen Triesch,"Zhetuo Zhao, Jochen Triesch, Bertram E. Shi","Learning Hierarchical Integration of Foveal and Peripheral Vision for
  Vergence Control by Active Efficient Coding",,,10.1007/978-3-319-97628-0_7,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The active efficient coding (AEC) framework parsimoniously explains the joint
development of visual processing and eye movements, e.g., the emergence of
binocular disparity selective neurons and fusional vergence, the disjunctive
eye movements that align left and right eye images. Vergence can be driven by
information in both the fovea and periphery, which play complementary roles.
The high resolution fovea can drive precise short range movements. The lower
resolution periphery supports coarser long range movements. The fovea and
periphery may also contain conflicting information, e.g. due to objects at
different depths. While past AEC models did integrate peripheral and foveal
information, they did not explicitly take into account these characteristics.
We propose here a two-level hierarchical approach that does. The bottom level
generates different vergence actions from foveal and peripheral regions. The
top level selects one. We demonstrate that the hierarchical approach performs
better than prior approaches in realistic environments, exhibiting better
alignment and less oscillation.
","[{'version': 'v1', 'created': 'Fri, 29 Jan 2021 08:53:42 GMT'}]",2021-03-10,"[['Zhao', 'Zhetuo', ''], ['Triesch', 'Jochen', ''], ['Shi', 'Bertram E.', '']]","['Vergence', 'Disparity', 'Foveal Vision', 'Peripheral Vision']"
11878,2004.02671,Nassim Dehouche,Nassim Dehouche,On Evaluating the Quality of Rule-Based Classification Systems,"ICIC Express Letters Volume 11, Number 10, October 2017","ICIC Express Letters ICIC International c 2013 ISSN 1881-803X ICIC
  Express Letters Volume 11, Number 10, October 2017 c 2013 ISSN 1881-803X
  Volume 11, Number 10, October 2017",10.24507/icicel.11.10.1515,,cs.AI cs.LG cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two indicators are classically used to evaluate the quality of rule-based
classification systems: predictive accuracy, i.e. the system's ability to
successfully reproduce learning data and coverage, i.e. the proportion of
possible cases for which the logical rules constituting the system apply. In
this work, we claim that these two indicators may be insufficient, and
additional measures of quality may need to be developed. We theoretically show
that classification systems presenting ""good"" predictive accuracy and coverage
can, nonetheless, be trivially improved and illustrate this proposition with
examples.
","[{'version': 'v1', 'created': 'Mon, 6 Apr 2020 13:41:49 GMT'}]",2020-04-07,"[['Dehouche', 'Nassim', '']]","['Expert Systems', 'Machine Learning', 'Classification', 'Bankruptcy Prediction']"
11879,2111.02354,Sapana Chaudhary,"Sapana Chaudhary, Balaraman Ravindran",Smooth Imitation Learning via Smooth Costs and Smooth Policies,"To appear in the Proceedings of the Fifth Joint International
  Conference on Data Science and Management of Data (CoDS-COMAD 2022). Research
  Track. ACM DL",,10.1145/3493700.3493716,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Imitation learning (IL) is a popular approach in the continuous control
setting as among other reasons it circumvents the problems of reward
mis-specification and exploration in reinforcement learning (RL). In IL from
demonstrations, an important challenge is to obtain agent policies that are
smooth with respect to the inputs. Learning through imitation a policy that is
smooth as a function of a large state-action ($s$-$a$) space (typical of high
dimensional continuous control environments) can be challenging. We take a
first step towards tackling this issue by using smoothness inducing
regularizers on \textit{both} the policy and the cost models of adversarial
imitation learning. Our regularizers work by ensuring that the cost function
changes in a controlled manner as a function of $s$-$a$ space; and the agent
policy is well behaved with respect to the state space. We call our new smooth
IL algorithm \textit{Smooth Policy and Cost Imitation Learning} (SPaCIL,
pronounced 'Special'). We introduce a novel metric to quantify the smoothness
of the learned policies. We demonstrate SPaCIL's superior performance on
continuous control tasks from MuJoCo. The algorithm not just outperforms the
state-of-the-art IL algorithm on our proposed smoothness metric, but, enjoys
added benefits of faster learning and substantially higher average return.
","[{'version': 'v1', 'created': 'Wed, 3 Nov 2021 17:12:47 GMT'}]",2021-11-04,"[['Chaudhary', 'Sapana', ''], ['Ravindran', 'Balaraman', '']]","['imitation learning', 'continuous control', 'smooth policy', 'regularization', 'deep reinforcement learning']"
11880,2011.06959,Edouard Fouch\'e,"Edouard Fouch\'e, Florian Kalinke, Klemens B\""ohm",Efficient Subspace Search in Data Streams,"Accepted Manuscript to Information Systems, Volume 97, Elsevier.
  Final authenticated version: https://doi.org/10.1016/j.is.2020.101705","In: Information Systems 97 (2021), p. 101705. ISSN: 0306-4379",10.1016/j.is.2020.101705,,cs.LG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the real world, data streams are ubiquitous -- think of network traffic or
sensor data. Mining patterns, e.g., outliers or clusters, from such data must
take place in real time. This is challenging because (1) streams often have
high dimensionality, and (2) the data characteristics may change over time.
Existing approaches tend to focus on only one aspect, either high
dimensionality or the specifics of the streaming setting. For static data, a
common approach to deal with high dimensionality -- known as subspace search --
extracts low-dimensional, `interesting' projections (subspaces), in which
patterns are easier to find. In this paper, we address both Challenge (1) and
(2) by generalising subspace search to data streams. Our approach, Streaming
Greedy Maximum Random Deviation (SGMRD), monitors interesting subspaces in
high-dimensional data streams. It leverages novel multivariate dependency
estimators and monitoring techniques based on bandit theory. We show that the
benefits of SGMRD are twofold: (i) It monitors subspaces efficiently, and (ii)
this improves the results of downstream data mining tasks, such as outlier
detection. Our experiments, performed against synthetic and real-world data,
demonstrate that SGMRD outperforms its competitors by a large margin.
","[{'version': 'v1', 'created': 'Fri, 13 Nov 2020 15:13:25 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jan 2021 11:07:50 GMT'}]",2021-01-08,"[['Fouché', 'Edouard', ''], ['Kalinke', 'Florian', ''], ['Böhm', 'Klemens', '']]","['Subspace Search', 'Data Stream Monitoring', 'Outlier Detection']"
11881,2011.11900,Jeong-Gi Kwak,"Jeong-gi Kwak, David K. Han, Hanseok Ko","CAFE-GAN: Arbitrary Face Attribute Editing with Complementary Attention
  Feature",,"European Conference on Computer Vision (ECCV), 2020",10.1007/978-3-030-58568-6_31,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The goal of face attribute editing is altering a facial image according to
given target attributes such as hair color, mustache, gender, etc. It belongs
to the image-to-image domain transfer problem with a set of attributes
considered as a distinctive domain. There have been some works in multi-domain
transfer problem focusing on facial attribute editing employing Generative
Adversarial Network (GAN). These methods have reported some successes but they
also result in unintended changes in facial regions - meaning the generator
alters regions unrelated to the specified attributes. To address this
unintended altering problem, we propose a novel GAN model which is designed to
edit only the parts of a face pertinent to the target attributes by the concept
of Complementary Attention Feature (CAFE). CAFE identifies the facial regions
to be transformed by considering both target attributes as well as
complementary attributes, which we define as those attributes absent in the
input facial image. In addition, we introduce a complementary feature matching
to help in training the generator for utilizing the spatial information of
attributes. Effectiveness of the proposed method is demonstrated by analysis
and comparison study with state-of-the-art methods.
","[{'version': 'v1', 'created': 'Tue, 24 Nov 2020 05:21:03 GMT'}]",2020-11-25,"[['Kwak', 'Jeong-gi', ''], ['Han', 'David K.', ''], ['Ko', 'Hanseok', '']]","['Face Attribute Editing', 'GAN', 'Complementary AttentionFeature', 'Complementary Feature Matching']"
11882,2106.08692,Andras Gazdag,"Irina Chiscop, Andr\'as Gazdag, Joost Bosman, Gergely Bicz\'ok","Detecting message modification attacks on the CAN bus with Temporal
  Convolutional Networks",,,10.5220/0010445504880496,,cs.CR cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Multiple attacks have shown that in-vehicle networks have vulnerabilities
which can be exploited. Securing the Controller Area Network (CAN) for modern
vehicles has become a necessary task for car manufacturers. Some attacks inject
potentially large amount of fake messages into the CAN network; however, such
attacks are relatively easy to detect. In more sophisticated attacks, the
original messages are modified, making the detection a more complex problem. In
this paper, we present a novel machine learning based intrusion detection
method for CAN networks. We focus on detecting message modification attacks,
which do not change the timing patterns of communications. Our proposed
temporal convolutional network-based solution can learn the normal behavior of
CAN signals and differentiate them from malicious ones. The method is evaluated
on multiple CAN-bus message IDs from two public datasets including different
types of attacks. Performance results show that our lightweight approach
compares favorably to the state-of-the-art unsupervised learning approach,
achieving similar or better accuracy for a wide range of scenarios with a
significantly lower false positive rate.
","[{'version': 'v1', 'created': 'Wed, 16 Jun 2021 10:51:58 GMT'}]",2021-06-17,"[['Chiscop', 'Irina', ''], ['Gazdag', 'András', ''], ['Bosman', 'Joost', ''], ['Biczók', 'Gergely', '']]","['Vehicle Security', 'Intrusion Detection', 'Controller Area Network', 'Machine Learning', 'Temporal ConvolutionalNetworks']"
11883,2109.08763,Jason Wu,"Jason Wu, Xiaoyi Zhang, Jeff Nichols, Jeffrey P. Bigham","Screen Parsing: Towards Reverse Engineering of UI Models from
  Screenshots",,,10.1145/3472749.3474763,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Automated understanding of user interfaces (UIs) from their pixels can
improve accessibility, enable task automation, and facilitate interface design
without relying on developers to comprehensively provide metadata. A first step
is to infer what UI elements exist on a screen, but current approaches are
limited in how they infer how those elements are semantically grouped into
structured interface definitions. In this paper, we motivate the problem of
screen parsing, the task of predicting UI elements and their relationships from
a screenshot. We describe our implementation of screen parsing and provide an
effective training procedure that optimizes its performance. In an evaluation
comparing the accuracy of the generated output, we find that our implementation
significantly outperforms current systems (up to 23%). Finally, we show three
example applications that are facilitated by screen parsing: (i) UI similarity
search, (ii) accessibility enhancement, and (iii) code generation from UI
screenshots.
","[{'version': 'v1', 'created': 'Fri, 17 Sep 2021 21:22:17 GMT'}]",2021-09-21,"[['Wu', 'Jason', ''], ['Zhang', 'Xiaoyi', ''], ['Nichols', 'Jeff', ''], ['Bigham', 'Jeffrey P.', '']]","['user interface modeling', 'ui semantics', 'hierarchy prediction']"
11884,2010.04906,Olof Liberg Mr,"Olof Liberg, Stefan Eriksson L\""owenmark, Sebastian Euler, Bj\""orn
  Hofstr\""om, Talha Khan, Xingqin Lin and Jonas Sedin",Narrowband Internet of Things for Non-terrestrial Networks,,,10.1109/MCOMSTD.001.2000004,,cs.NI eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Narrowband Internet of Things (NB-IoT) is a cellular access technology
developed by the Third Generation Partnership Project (3GPP) to provide wide
area connectivity for the Internet of Things. Since its introduction in 3GPP
Release 13, NB-IoT has in a few years achieved a remarkable market presence and
is currently providing coverage in close to 100 countries. To further extend
the reach of NB-IoT and to connect the unconnected, 3GPP Release 17 will study
the feasibility of adapting NB-IoT to support non-terrestrial networks (NTNs).
In this article, we review the fundamentals of NB-IoT and NTN and explain how
NB-IoT can be adapted to support satellite communication through a minimal set
of modifications.
","[{'version': 'v1', 'created': 'Sat, 10 Oct 2020 05:40:07 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Apr 2021 07:00:09 GMT'}]",2021-04-20,"[['Liberg', 'Olof', ''], ['Löwenmark', 'Stefan Eriksson', ''], ['Euler', 'Sebastian', ''], ['Hofström', 'Björn', ''], ['Khan', 'Talha', ''], ['Lin', 'Xingqin', ''], ['Sedin', 'Jonas', '']]","['3GPP', 'NB-IoT', 'NTN', 'Satellite communication']"
11885,2106.05485,Leonid Sokolinsky,"Leonid B. Sokolinsky, Irina M. Sokolinskaya",VaLiPro: Linear Programming Validator for Cluster Computing Systems,"Submitted to ""Supercomputing Frontiers and Innovations"" journal","Supercomputing Frontiers and Innovations. 2021. Vol. 8, No. 3. P.
  51-61",10.14529/jsfi210303,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The article presents and evaluates a scalable algorithm for validating
solutions of linear programming problems on cluster computing systems. The main
idea of the method is to generate a regular set of points (validation set) on a
small-radius hypersphere centered at the point of the solution under
validation. The objective function is calculated for each point of the
validation set that belongs to the feasible region. If all these values are
less than or equal to the value of the objective function at the point under
validation, then this point is the correct solution. The parallel
implementation of the VaLiPro algorithm is performed in C++ through the
parallel BSF-skeleton, which encapsulates all aspects related to the MPI-based
parallelization of the program. We provide the results of large-scale
computational experiments on a cluster computing system to study the
scalability of the VaLiPro algorithm.
","[{'version': 'v1', 'created': 'Thu, 10 Jun 2021 03:56:49 GMT'}, {'version': 'v2', 'created': 'Mon, 5 Jul 2021 03:13:12 GMT'}]",2021-11-29,"[['Sokolinsky', 'Leonid B.', ''], ['Sokolinskaya', 'Irina M.', '']]","['Linear programming', 'Solution validator', 'VaLiPro', 'Parallel algorithm', 'Cluster computing system', 'BSF-skeleton']"
11886,1905.08347,Kai Sauerwald,Kai Sauerwald and Christoph Beierle,Decrement Operators in Belief Change,,,10.1007/978-3-030-29765-7_21,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While research on iterated revision is predominant in the field of iterated
belief change, the class of iterated contraction operators received more
attention in recent years. In this article, we examine a non-prioritized
generalisation of iterated contraction. In particular, the class of weak
decrement operators is introduced, which are operators that by multiple steps
achieve the same as a contraction. Inspired by Darwiche and Pearl's work on
iterated revision the subclass of decrement operators is defined. For both,
decrement and weak decrement operators, postulates are presented and for each
of them a representation theorem in the framework of total preorders is given.
Furthermore, we present two sub-types of decrement operators.
","[{'version': 'v1', 'created': 'Mon, 20 May 2019 21:09:55 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Jul 2019 12:20:37 GMT'}]",2019-08-13,"[['Sauerwald', 'Kai', ''], ['Beierle', 'Christoph', '']]","['belief revision', 'belief contraction', 'non-prioritized change', 'gradual change', 'forgetting', 'decrement operator']"
11887,2111.05649,Jiwei Yan,"Jiwei Yan, Shixin Zhang, Yepang Liu, Xi Deng, Jun Yan, Jian Zhang",A Comprehensive Evaluation of Android ICC Resolution Techniques,,,10.1145/3551349.3560420.,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Inter-component communication (ICC) is a widely used mechanism in mobile
apps, which enables message-based control flow transferring and data passing
between Android components. Effective ICC resolution requires precisely
identifying entry points, analyzing data values of ICC fields, modeling related
framework APIs, etc. Due to various control-flow- and data-flow-related
characteristics involved and the lack of oracles for real-world apps, the
comprehensive evaluation of ICC resolution techniques is challenging.
  To fill this gap, we collect multiple-type benchmark suites with 4,104 apps,
covering hand-made apps, open-source, and commercial ones. Considering their
differences, various evaluation metrics, e.g., number count, graph structure,
and reliable oracle based metrics, are adopted on-demand. As the oracle for
real-world apps is unavailable, we design a dynamic analysis approach to
extract the real ICC links triggered during GUI exploration. By auditing the
code implementations, we carefully check the extracted ICCs and confirm 1,680
ones to form a reliable oracle set, in which each ICC is labeled with 25 code
characteristic tags. The evaluation performed on six state-of-the-art ICC
resolution tools shows that 1) the completeness of static ICC resolution
results on real-world apps is not satisfactory, as up to 38%-85% ICCs are
missed by tools; 2) many wrongly reported ICCs are sent from or received by
only a few components and the graph structure information can help the
identification; 3) the efficiency of fundamental tools, like ICC resolution
ones, should be optimized in both engineering and research aspects. By
investigating both the missed and wrongly reported ICCs, we discuss the
strengths of different tools for users and summarize eight common FN/FP
patterns in ICC resolution for tool developers.
","[{'version': 'v1', 'created': 'Wed, 10 Nov 2021 11:31:37 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Feb 2022 06:35:58 GMT'}, {'version': 'v3', 'created': 'Sat, 3 Sep 2022 14:52:00 GMT'}]",2022-09-07,"[['Yan', 'Jiwei', ''], ['Zhang', 'Shixin', ''], ['Liu', 'Yepang', ''], ['Deng', 'Xi', ''], ['Yan', 'Jun', ''], ['Zhang', 'Jian', '']]","['Android', 'Inter-Component Communication (ICC)', 'Transition Graph']"
11888,1710.08299,Jiang Lu,"Jiang Lu, Jie Hu, Guannan Zhao, Fenghua Mei, Changshui Zhang",An In-field Automatic Wheat Disease Diagnosis System,15 pages,"Computers and Electronics in Agriculture, 142PA (2017): 369-379",10.1016/j.compag.2017.09.012,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crop diseases are responsible for the major production reduction and economic
losses in agricultural industry world- wide. Monitoring for health status of
crops is critical to control the spread of diseases and implement effective
management. This paper presents an in-field automatic wheat disease diagnosis
system based on a weakly super- vised deep learning framework, i.e. deep
multiple instance learning, which achieves an integration of identification for
wheat diseases and localization for disease areas with only image-level
annotation for training images in wild conditions. Furthermore, a new in-field
image dataset for wheat disease, Wheat Disease Database 2017 (WDD2017), is
collected to verify the effectiveness of our system. Under two different
architectures, i.e. VGG-FCN-VD16 and VGG-FCN-S, our system achieves the mean
recognition accuracies of 97.95% and 95.12% respectively over 5-fold
cross-validation on WDD2017, exceeding the results of 93.27% and 73.00% by two
conventional CNN frameworks, i.e. VGG-CNN-VD16 and VGG-CNN-S. Experimental
results demonstrate that the proposed system outperforms conventional CNN
architectures on recognition accuracy under the same amount of parameters,
meanwhile main- taining accurate localization for corresponding disease areas.
Moreover, the proposed system has been packed into a real-time mobile app to
provide support for agricultural disease diagnosis.
","[{'version': 'v1', 'created': 'Tue, 26 Sep 2017 05:20:12 GMT'}]",2017-10-24,"[['Lu', 'Jiang', ''], ['Hu', 'Jie', ''], ['Zhao', 'Guannan', ''], ['Mei', 'Fenghua', ''], ['Zhang', 'Changshui', '']]","['Agricultural disease diagnosis', 'Wheat disease detection', 'Weakly supervised learning', 'Deep multipleinstance learning', 'Fully convolutional network']"
11889,2108.12746,Eugene Yang,David D. Lewis and Eugene Yang and Ophir Frieder,Certifying One-Phase Technology-Assisted Reviews,"10 pages, 4 figures, accepted at CIKM 2021",,10.1145/3459637.3482415,,cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Technology-assisted review (TAR) workflows based on iterative active learning
are widely used in document review applications. Most stopping rules for
one-phase TAR workflows lack valid statistical guarantees, which has
discouraged their use in some legal contexts. Drawing on the theory of quantile
estimation, we provide the first broadly applicable and statistically valid
sample-based stopping rules for one-phase TAR. We further show theoretically
and empirically that overshooting a recall target, which has been treated as
innocuous or desirable in past evaluations of stopping rules, is a major source
of excess cost in one-phase TAR workflows. Counterintuitively, incurring a
larger sampling cost to reduce excess recall leads to lower total cost in
almost all scenarios.
","[{'version': 'v1', 'created': 'Sun, 29 Aug 2021 04:14:49 GMT'}]",2021-08-31,"[['Lewis', 'David D.', ''], ['Yang', 'Eugene', ''], ['Frieder', 'Ophir', '']]","['active learning', 'AI and law', 'high recall retrieval', 'randomized algorithms', 'sampling', 'statistical quality control', 'total recall']"
11890,2005.00284,William Seymour,"William Seymour, Reuben Binns, Petr Slovak, Max Van Kleek, Nigel
  Shadbolt","Strangers in the Room: Unpacking Perceptions of 'Smartness' and Related
  Ethical Concerns in the Home","10 pages, 1 figure. To appear in the Proceedings of the 2020 ACM
  Conference on Designing Interactive Systems (DIS '20)",,10.1145/3357236.3395501,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasingly widespread use of 'smart' devices has raised multifarious
ethical concerns regarding their use in domestic spaces. Previous work
examining such ethical dimensions has typically either involved empirical
studies of concerns raised by specific devices and use contexts, or
alternatively expounded on abstract concepts like autonomy, privacy or trust in
relation to 'smart homes' in general. This paper attempts to bridge these
approaches by asking what features of smart devices users consider as rendering
them 'smart' and how these relate to ethical concerns. Through a multimethod
investigation including surveys with smart device users (n=120) and
semi-structured interviews (n=15), we identify and describe eight types of
smartness and explore how they engender a variety of ethical concerns including
privacy, autonomy, and disruption of the social order. We argue that this
middle ground, between concerns arising from particular devices and more
abstract ethical concepts, can better anticipate potential ethical concerns
regarding smart devices.
","[{'version': 'v1', 'created': 'Fri, 1 May 2020 09:33:42 GMT'}]",2020-05-04,"[['Seymour', 'William', ''], ['Binns', 'Reuben', ''], ['Slovak', 'Petr', ''], ['Van Kleek', 'Max', ''], ['Shadbolt', 'Nigel', '']]","['Smart Homes', 'Smart Devices', 'Mental Models', 'Folk Theories']"
11891,2010.15056,Divya Thekke Kanapram,"Divya Kanapram, Pablo Marin-Plaza, Lucio Marcenaro, David Martin,
  Arturo de la Escalera, Carlo Regazzoni","Self-awareness in Intelligent Vehicles: Experience Based Abnormality
  Detection",Robot 2019: Fourth Iberian Robotics Conference,,10.1007/978-3-030-35990-4_18,,cs.LG eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The evolution of Intelligent Transportation System in recent times
necessitates the development of self-driving agents: the self-awareness
consciousness. This paper aims to introduce a novel method to detect
abnormalities based on internal cross-correlation parameters of the vehicle.
Before the implementation of Machine Learning, the detection of abnormalities
were manually programmed by checking every variable and creating huge nested
conditions that are very difficult to track. Nowadays, it is possible to train
a Dynamic Bayesian Network (DBN) model to automatically evaluate and detect
when the vehicle is potentially misbehaving. In this paper, different scenarios
have been set in order to train and test a switching DBN for Perimeter
Monitoring Task using a semantic segmentation for the DBN model and Hellinger
Distance metric for abnormality measurements.
","[{'version': 'v1', 'created': 'Wed, 28 Oct 2020 16:08:54 GMT'}]",2020-10-29,"[['Kanapram', 'Divya', ''], ['Marin-Plaza', 'Pablo', ''], ['Marcenaro', 'Lucio', ''], ['Martin', 'David', ''], ['de la Escalera', 'Arturo', ''], ['Regazzoni', 'Carlo', '']]","['Autonomous vehicles', 'Intelligent Transportation System(ITS)', 'Dynamic Bayesian Network(DBN)', 'Hellinger distance', 'Abnormality detection']"
11892,1709.00833,Ludovic Courtes,Ludovic Court\`es,Code Staging in GNU Guix,"16th ACM SIGPLAN International Conference on Generative Programming:
  Concepts and Experiences (GPCE'17), Oct 2017, Vancouver, Canada",,10.1145/3136040.3136045,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  GNU Guix is a "" functional "" package manager that builds upon earlier work on
Nix. Guix implements high-level abstractions such as packages and operating
system services as domain-specic languages (DSLs) embedded in Scheme. It also
implements build actions and operating system orchestration in Scheme. This
leads to a multi-tier programming environment where embedded code snippets are
staged for eventual execution. This paper presents G-expressions or "" gexps "",
the staging mechanism we devised for Guix. We explain our journey from
traditional Lisp S-expressions to G-expressions, which augment the former with
contextual information and ensure hygienic code staging. We discuss the
implementation of gexps and report on our experience using them in a variety of
operating system use cases-from package build processes to system services.
Gexps provide a novel way to cover many aspects of OS connguration in a single,
multi-tier language, while facilitating code reuse and code sharing .
","[{'version': 'v1', 'created': 'Mon, 4 Sep 2017 06:34:07 GMT'}]",2017-09-05,"[['Courtès', 'Ludovic', '']]","['Code staging', 'Scheme', 'Software deployment']"
11893,2208.14704,Jiaqi Ma,"Jiaqi Ma, Shengyuan Yan, Lefei Zhang, Guoli Wang, Qian Zhang","ELMformer: Efficient Raw Image Restoration with a Locally Multiplicative
  Transformer",ACM Multimedia 2022,,10.1145/3503161.3547767,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  In order to get raw images of high quality for downstream Image Signal
Process (ISP), in this paper we present an Efficient Locally Multiplicative
Transformer called ELMformer for raw image restoration. ELMformer contains two
core designs especially for raw images whose primitive attribute is
single-channel. The first design is a Bi-directional Fusion Projection (BFP)
module, where we consider both the color characteristics of raw images and
spatial structure of single-channel. The second one is that we propose a
Locally Multiplicative Self-Attention (L-MSA) scheme to effectively deliver
information from the local space to relevant parts. ELMformer can efficiently
reduce the computational consumption and perform well on raw image restoration
tasks. Enhanced by these two core designs, ELMformer achieves the highest
performance and keeps the lowest FLOPs on raw denoising and raw deblurring
benchmarks compared with state-of-the-arts. Extensive experiments demonstrate
the superiority and generalization ability of ELMformer. On SIDD benchmark, our
method has even better denoising performance than ISP-based methods which need
huge amount of additional sRGB training images. The codes are release at
https://github.com/leonmakise/ELMformer.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2022 09:07:13 GMT'}]",2022-09-01,"[['Ma', 'Jiaqi', ''], ['Yan', 'Shengyuan', ''], ['Zhang', 'Lefei', ''], ['Wang', 'Guoli', ''], ['Zhang', 'Qian', '']]","['Raw Images', 'Image Signal Process', 'Image Restoration', 'Transformer']"
11894,1805.02570,David Orden,"Carlos Alegr\'ia-Galicia, David Orden, Leonidas Palios, Carlos Seara,
  and Jorge Urrutia",Capturing points with a rotating polygon (and a 3D extension),"25 pages, 12 figures, submitted to journal in February 2017","Theory of Computing Systems 63:3 (2019), 543-566",10.1007/s00224-018-9885-y,,cs.CG math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of rotating a simple polygon to contain the maximum
number of elements from a given point set in the plane. We consider variations
of this problem where the rotation center is a given point or lies on a line
segment, a line, or a polygonal chain. We also solve an extension to 3D where
we rotate a polyhedron around a given point to contain the maximum number of
elements from a set of points in the space.
","[{'version': 'v1', 'created': 'Mon, 7 May 2018 15:24:30 GMT'}]",2020-07-21,"[['Alegría-Galicia', 'Carlos', ''], ['Orden', 'David', ''], ['Palios', 'Leonidas', ''], ['Seara', 'Carlos', ''], ['Urrutia', 'Jorge', '']]","['Points covering', 'rotation', 'geometric optimization', 'polygon', 'polyhedron']"
11895,1910.09818,Jobish John,"Jobish John, Gaurav S Kasbekar, Dinesh K Sharma, V. Ramulu, and Maryam
  Shojaei Baghini","Design and Implementation of a Wireless SensorNetwork for Agricultural
  Applications",,EAI Endorsed Transactions on Internet of Things 4.16 (2018),10.4108/eai.13-7-2018.158420,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the design and implementation of a shortest path tree based,
energy efficient data collection wireless sensor network to sense various
parameters in an agricultural farm using in-house developed low cost sensors.
Nodes follow a synchronized, periodic sleep-wake up schedule to maximize the
lifetime of the network. The implemented network consists of 24 sensor nodes in
a 3 acre maize farm and its performance is captured by 7 snooper nodes for
different data collection intervals: 10 minutes, 1 hour and 3 hours. The almost
static nature of wireless links in the farm motivated us to use the same tree
for a long data collection period(3 days). The imbalance in energy consumption
across nodes is observed to be very small and the network architecture uses
easy-to-implement protocols to perform different network activities including
handling of node failures. We present the results and analysis of extensive
tests conducted on our implementation, which provide significant insights.
","[{'version': 'v1', 'created': 'Tue, 22 Oct 2019 08:14:43 GMT'}]",2019-10-23,"[['John', 'Jobish', ''], ['Kasbekar', 'Gaurav S', ''], ['Sharma', 'Dinesh K', ''], ['Ramulu', 'V.', ''], ['Baghini', 'Maryam Shojaei', '']]","['Sensor network', 'Data collection', 'Energy efficiency']"
11896,2007.10290,Benjamin Allen,"Benjamin S. Allen, Matthew A. Ezell, Paul Peltz, Doug Jacobsen, Eric
  Roman, Cory Lueninghoener, and J. Lowell Wofford",Modernizing the HPC System Software Stack,"Presented at the SC (SC20), Atlanta, GA: Zenodo (2020)",,10.5281/zenodo.4324415,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Through the 1990s, HPC centers at national laboratories, universities, and
other large sites designed distributed system architectures and software stacks
that enabled extreme-scale computing. By the 2010s, these centers were eclipsed
by the scale of web-scale and cloud computing architectures, and today even
upcoming exascale HPC systems are magnitudes of scale smaller than those of
datacenters employed by large web companies. Meanwhile, the HPC community has
allowed system software designs to stagnate, relying on incremental changes to
tried-and-true designs to move between generations of systems. We contend that
a modern system software stack that focuses on manageability, scalability,
security, and modern methods will benefit the entire HPC community. In this
paper, we break down the logical parts of a typical HPC system software stack,
look at more modern ways to meet their needs, and make recommendations of
future work that would help the community move in that direction.
","[{'version': 'v1', 'created': 'Mon, 20 Jul 2020 17:18:04 GMT'}]",2021-04-28,"[['Allen', 'Benjamin S.', ''], ['Ezell', 'Matthew A.', ''], ['Peltz', 'Paul', ''], ['Jacobsen', 'Doug', ''], ['Roman', 'Eric', ''], ['Lueninghoener', 'Cory', ''], ['Wofford', 'J. Lowell', '']]","['high performance computing', 'distributedcomputing', 'operating systems']"
11897,2205.03876,"Florian Pl\""otzky","Florian Pl\""otzky and Wolf-Tilo Balke","It's the Same Old Story! Enriching Event-Centric Knowledge Graphs by
  Narrative Aspects","Accepted at WebSci'22, 10 pages, 4 figures",,10.1145/3501247.3531565,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our lives are ruled by events of varying importance ranging from simple
everyday occurrences to incidents of societal dimension. And a lot of effort is
taken to exchange information and discuss about such events: generally
speaking, stringent narratives are formed to reduce complexity. But when
considering complex events like the current conflict between Russia and Ukraine
it is easy to see that those events cannot be grasped by objective facts alone,
like the start of the conflict or respective troop sizes. There are different
viewpoints and assessments to consider, a different understanding of the roles
taken by individual participants, etc. So how can such subjective and
viewpoint-dependent information be effectively represented together with all
objective information? Recently event-centric knowledge graphs have been
proposed for objective event representation in the otherwise primarily
entity-centric domain of knowledge graphs. In this paper we introduce a novel
and lightweight structure for event-centric knowledge graphs, which for the
first time allows for queries incorporating viewpoint-dependent and narrative
aspects. Our experiments prove the effective incorporation of subjective
attributions for event participants and show the benefits of specifically
tailored indexes for narrative query processing.
","[{'version': 'v1', 'created': 'Sun, 8 May 2022 14:00:41 GMT'}]",2022-05-10,"[['Plötzky', 'Florian', ''], ['Balke', 'Wolf-Tilo', '']]","['event representation', 'event-centric knowledge graphs', 'narrativeintelligence', 'narrative query processing']"
11898,2105.00756,Roberto Ulloa Dr.,"Aleksandra Urman, Mykola Makhortykh, Roberto Ulloa","The Matter of Chance: Auditing Web Search Results Related to the 2020
  U.S. Presidential Primary Elections Across Six Search Engines",,Social Science Computer Review (2021),10.1177/08944393211006863,,cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We examine how six search engines filter and rank information in relation to
the queries on the U.S. 2020 presidential primary elections under the default -
that is nonpersonalized - conditions. For that, we utilize an algorithmic
auditing methodology that uses virtual agents to conduct large-scale analysis
of algorithmic information curation in a controlled environment. Specifically,
we look at the text search results for ""us elections"", ""donald trump"", ""joe
biden"" and ""bernie sanders"" queries on Google, Baidu, Bing, DuckDuckGo, Yahoo,
and Yandex, during the 2020 primaries. Our findings indicate substantial
differences in the search results between search engines and multiple
discrepancies within the results generated for different agents using the same
search engine. It highlights that whether users see certain information is
decided by chance due to the inherent randomization of search results. We also
find that some search engines prioritize different categories of information
sources with respect to specific candidates. These observations demonstrate
that algorithmic curation of political information can create information
inequalities between the search engine users even under nonpersonalized
conditions. Such inequalities are particularly troubling considering that
search results are highly trusted by the public and can shift the opinions of
undecided voters as demonstrated by previous research.
","[{'version': 'v1', 'created': 'Mon, 3 May 2021 11:18:19 GMT'}]",2021-05-04,"[['Urman', 'Aleksandra', ''], ['Makhortykh', 'Mykola', ''], ['Ulloa', 'Roberto', '']]","['search engines', 'web search elections', 'U.S']"
11899,1904.07554,Hanzhou Wu,Hanzhou Wu,Steganographer Identification,A tutorial with 30 pages,,10.1016/B978-0-12-819438-6.00021-9,,cs.MM cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Conventional steganalysis detects the presence of steganography within single
objects. In the real-world, we may face a complex scenario that one or some of
multiple users called actors are guilty of using steganography, which is
typically defined as the Steganographer Identification Problem (SIP). One might
use the conventional steganalysis algorithms to separate stego objects from
cover objects and then identify the guilty actors. However, the guilty actors
may be lost due to a number of false alarms. To deal with the SIP, most of the
state-of-the-arts use unsupervised learning based approaches. In their
solutions, each actor holds multiple digital objects, from which a set of
feature vectors can be extracted. The well-defined distances between these
feature sets are determined to measure the similarity between the corresponding
actors. By applying clustering or outlier detection, the most suspicious
actor(s) will be judged as the steganographer(s). Though the SIP needs further
study, the existing works have good ability to identify the steganographer(s)
when non-adaptive steganographic embedding was applied. In this chapter, we
will present foundational concepts and review advanced methodologies in SIP.
This chapter is self-contained and intended as a tutorial introducing the SIP
in the context of media steganography.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2019 09:34:54 GMT'}]",2021-06-29,"[['Wu', 'Hanzhou', '']]","['Steganographer identification', 'batch steganography', 'pooled']"
11900,2206.00473,Alberto Veneri,"Claudio Lucchese, Franco Maria Nardini, Salvatore Orlando, Raffaele
  Perego and Alberto Veneri",ILMART: Interpretable Ranking with Constrained LambdaMART,"5 pages, 3 figures, to be published in SIGIR 2022 proceedings",,10.1145/3477495.3531840,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Interpretable Learning to Rank (LtR) is an emerging field within the research
area of explainable AI, aiming at developing intelligible and accurate
predictive models. While most of the previous research efforts focus on
creating post-hoc explanations, in this paper we investigate how to train
effective and intrinsically-interpretable ranking models. Developing these
models is particularly challenging and it also requires finding a trade-off
between ranking quality and model complexity. State-of-the-art rankers, made of
either large ensembles of trees or several neural layers, exploit in fact an
unlimited number of feature interactions making them black boxes. Previous
approaches on intrinsically-interpretable ranking models address this issue by
avoiding interactions between features thus paying a significant performance
drop with respect to full-complexity models. Conversely, ILMART, our novel and
interpretable LtR solution based on LambdaMART, is able to train effective and
intelligible models by exploiting a limited and controlled number of pairwise
feature interactions. Exhaustive and reproducible experiments conducted on
three publicly-available LtR datasets show that ILMART outperforms the current
state-of-the-art solution for interpretable ranking of a large margin with a
gain of nDCG of up to 8%.
","[{'version': 'v1', 'created': 'Wed, 1 Jun 2022 13:05:53 GMT'}]",2022-06-02,"[['Lucchese', 'Claudio', ''], ['Nardini', 'Franco Maria', ''], ['Orlando', 'Salvatore', ''], ['Perego', 'Raffaele', ''], ['Veneri', 'Alberto', '']]","['Interpretable Ranking', 'Interpretable Boosting', 'LambdaMART']"
11901,2204.11227,Xirong Li,"Yue Wu and Yang Zhou and Jianchun Zhao and Jingyuan Yang and Weihong
  Yu and Youxin Chen and Xirong Li",Lesion Localization in OCT by Semi-Supervised Object Detection,,ICMR 2022,10.1145/3512527.3531418,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Over 300 million people worldwide are affected by various retinal diseases.
By noninvasive Optical Coherence Tomography (OCT) scans, a number of abnormal
structural changes in the retina, namely retinal lesions, can be identified.
Automated lesion localization in OCT is thus important for detecting retinal
diseases at their early stage. To conquer the lack of manual annotation for
deep supervised learning, this paper presents a first study on utilizing
semi-supervised object detection (SSOD) for lesion localization in OCT images.
To that end, we develop a taxonomy to provide a unified and structured
viewpoint of the current SSOD methods, and consequently identify key modules in
these methods. To evaluate the influence of these modules in the new task, we
build OCT-SS, a new dataset consisting of over 1k expert-labeled OCT B-scan
images and over 13k unlabeled B-scans. Extensive experiments on OCT-SS identify
Unbiased Teacher (UnT) as the best current SSOD method for lesion localization.
Moreover, we improve over this strong baseline, with mAP increased from 49.34
to 50.86.
","[{'version': 'v1', 'created': 'Sun, 24 Apr 2022 09:39:28 GMT'}]",2022-04-26,"[['Wu', 'Yue', ''], ['Zhou', 'Yang', ''], ['Zhao', 'Jianchun', ''], ['Yang', 'Jingyuan', ''], ['Yu', 'Weihong', ''], ['Chen', 'Youxin', ''], ['Li', 'Xirong', '']]","['OCT B-scan images', 'retinal lesion localization', 'semi-supervisedobject detection', 'medical image analysis', 'semi-supervised learning']"
11902,2203.09402,Marcos Faundez-Zanuy,"Jiri Mekyska, Eva Janousova, Pedro Gomez-Vilda, Zdenek Smekal, Irena
  Rektorova, Ilona Eliasova, Milena Kostalova, Martina Mrackova, Jesus B.
  Alonso-Hernandez, Marcos Faundez-Zanuy, Karmele L\'opez-de-Ipi\~na",Robust and Complex Approach of Pathological Speech Signal Analysis,"41 pages, published in Neurocomputing, Volume 167, 2015, Pages
  94-111, ISSN 0925-2312","Neurocomputing, Volume 167, 2015, Pages 94-111, ISSN 0925-2312",10.1016/j.neucom.2015.02.085,,cs.SD eess.AS,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper presents a study of the approaches in the state-of-the-art in the
field of pathological speech signal analysis with a special focus on
parametrization techniques. It provides a description of 92 speech features
where some of them are already widely used in this field of science and some of
them have not been tried yet (they come from different areas of speech signal
processing like speech recognition or coding). As an original contribution,
this work introduces 36 completely new pathological voice measures based on
modulation spectra, inferior colliculus coefficients, bicepstrum, sample and
approximate entropy and empirical mode decomposition. The significance of these
features was tested on 3 (English, Spanish and Czech) pathological voice
databases with respect to classification accuracy, sensitivity and specificity.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2022 15:54:44 GMT'}]",2022-03-18,"[['Mekyska', 'Jiri', ''], ['Janousova', 'Eva', ''], ['Gomez-Vilda', 'Pedro', ''], ['Smekal', 'Zdenek', ''], ['Rektorova', 'Irena', ''], ['Eliasova', 'Ilona', ''], ['Kostalova', 'Milena', ''], ['Mrackova', 'Martina', ''], ['Alonso-Hernandez', 'Jesus B.', ''], ['Faundez-Zanuy', 'Marcos', ''], ['López-de-Ipiña', 'Karmele', '']]","['pathological speech', 'disordered voice', 'dysarthria', 'speech processing', 'bicepstrum', 'non-linear']"
11903,2008.01590,Daniel Paulusma,"Nick Brettell, Jake Horsfield, Andrea Munaro, Daniel Paulusma",List $k$-Colouring $P_t$-Free Graphs: a Mim-width Perspective,"arXiv admin note: text overlap with arXiv:2004.05022 merge of
  arXiv:2004.05022 and previous version of arxiv:2008.01590","Information Processing Letters 173 (2022), 106168",10.1016/j.ipl.2021.106168,,cs.DS cs.CC cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A colouring of a graph $G=(V,E)$ is a mapping $c\colon V\to \{1,2,\ldots\}$
such that $c(u)\neq c(v)$ for every two adjacent vertices $u$ and $v$ of $G$.
The {\sc List $k$-Colouring} problem is to decide whether a graph $G=(V,E)$
with a list $L(u)\subseteq \{1,\ldots,k\}$ for each $u\in V$ has a colouring
$c$ such that $c(u)\in L(u)$ for every $u\in V$. Let $P_t$ be the path on $t$
vertices and let $K_{1,s}^1$ be the graph obtained from the $(s+1)$-vertex star
$K_{1,s}$ by subdividing each of its edges exactly once.Recently, Chudnovsky,
Spirkl and Zhong (DM 2020) proved that List $3$-Colouring is polynomial-time
solvable for $(K_{1,s}^1,P_t)$-free graphs for every $t\geq 1$ and $s\geq 1$.
We generalize their result to List $k$-Colouring for every $k\geq 1$. Our
result also generalizes the known result that for every $k\geq 1$ and $s\geq
0$, List $k$-Colouring is polynomial-time solvable for $(sP_1+P_5)$-free
graphs, which was proven for $s=0$ by Ho\`ang, Kami\'nski, Lozin, Sawada, and
Shu (Algorithmica 2010) and for every $s\geq 1$ by Couturier, Golovach, Kratsch
and Paulusma (Algorithmica 2015). We show our result by proving boundedness of
an underlying width parameter. Namely, we show that for every $k\geq 1$, $s\geq
1$, $t\geq 1$, the class of $(K_k,K_{1,s}^1,P_t)$-free graphs has bounded
mim-width and that a corresponding branch decomposition is ""quickly computable""
for these graphs.
","[{'version': 'v1', 'created': 'Mon, 3 Aug 2020 14:58:57 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Jan 2021 21:02:56 GMT'}]",2021-08-27,"[['Brettell', 'Nick', ''], ['Horsfield', 'Jake', ''], ['Munaro', 'Andrea', ''], ['Paulusma', 'Daniel', '']]","['Hereditary graph class', 'mim-width', 'colouring']"
11904,2107.03354,Tianbo Li,"Tianbo Li, Tianze Luo, Yiping Ke, Sinno Jialin Pan","Mitigating Performance Saturation in Neural Marked Point Processes:
  Architectures and Loss Functions","9 pages, 4 figures, accepted by KDD-21 research track. The source
  code is available at https://github.com/ltz0120/Graph-Convolutional-
  Hawkes-Processes-GCHP",,10.1145/3447548.3467436,,cs.LG cs.AI stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Attributed event sequences are commonly encountered in practice. A recent
research line focuses on incorporating neural networks with the statistical
model -- marked point processes, which is the conventional tool for dealing
with attributed event sequences. Neural marked point processes possess good
interpretability of probabilistic models as well as the representational power
of neural networks. However, we find that performance of neural marked point
processes is not always increasing as the network architecture becomes more
complicated and larger, which is what we call the performance saturation
phenomenon. This is due to the fact that the generalization error of neural
marked point processes is determined by both the network representational
ability and the model specification at the same time. Therefore we can draw two
major conclusions: first, simple network structures can perform no worse than
complicated ones for some cases; second, using a proper probabilistic
assumption is as equally, if not more, important as improving the complexity of
the network. Based on this observation, we propose a simple graph-based network
structure called GCHP, which utilizes only graph convolutional layers, thus it
can be easily accelerated by the parallel mechanism. We directly consider the
distribution of interarrival times instead of imposing a specific assumption on
the conditional intensity function, and propose to use a likelihood ratio loss
with a moment matching mechanism for optimization and model selection.
Experimental results show that GCHP can significantly reduce training time and
the likelihood ratio loss with interarrival time probability assumptions can
greatly improve the model performance.
","[{'version': 'v1', 'created': 'Wed, 7 Jul 2021 16:59:14 GMT'}]",2021-07-08,"[['Li', 'Tianbo', ''], ['Luo', 'Tianze', ''], ['Ke', 'Yiping', ''], ['Pan', 'Sinno Jialin', '']]","['Neural point processes', 'Hawkes processes', 'event sequential analysis']"
11905,1712.01161,Laure Philips,"Laure Philips (Software Languages Lab, Belgium), Joeri De Koster
  (Vrije Universiteit Brussel, Belgium), Wolfgang De Meuter (Vrije Universiteit
  Brussel, Belgium), Coen De Roover (Vrije Universiteit Brussel, Belgium)","Search-based Tier Assignment for Optimising Offline Availability in
  Multi-tier Web Applications",,"The Art, Science, and Engineering of Programming, 2018, Vol. 2,
  Issue 2, Article 3",10.22152/programming-journal.org/2018/2/3,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web programmers are often faced with several challenges in the development
process of modern, rich internet applications. Technologies for the different
tiers of the application have to be selected: a server-side language, a
combination of JavaScript, HTML and CSS for the client, and a database
technology. Meeting the expectations of contemporary web applications requires
even more effort from the developer: many state of the art libraries must be
mastered and glued together. This leads to an impedance mismatch problem
between the different technologies and it is up to the programmer to align them
manually. Multi-tier or tierless programming is a web programming paradigm that
provides one language for the different tiers of the web application, allowing
the programmer to focus on the actual program logic instead of the accidental
complexity that comes from combining several technologies. While current
tierless approaches therefore relieve the burden of having to combine different
technologies into one application, the distribution of the code is explicitly
tied into the program. Certain distribution decisions have an impact on
crosscutting concerns such as information security or offline availability.
Moreover, adapting the programs such that the application complies better with
these concerns often leads to code tangling, rendering the program more
difficult to understand and maintain. We introduce an approach to multi-tier
programming where the tierless code is decoupled from the tier specification.
The developer implements the web application in terms of slices and an external
specification that assigns the slices to tiers. A recommender system completes
the picture for those slices that do not have a fixed placement and proposes
slice refinements as well. This recommender system tries to optimise the tier
specification with respect to one or more crosscutting concerns. This is in
contrast with current cutting edge solutions that hide distribution decisions
from the programmer. In this paper we show that slices, together with a
recommender system, enable the developer to experiment with different
placements of slices, until the distribution of the code satisfies the
programmer's needs. We present a search-based recommender system that maximises
the offline availability of a web application and a concrete implementation of
these concepts in the tier-splitting tool Stip.js.
","[{'version': 'v1', 'created': 'Mon, 4 Dec 2017 15:53:57 GMT'}]",2017-12-05,"[['Philips', 'Laure', '', 'Software Languages Lab, Belgium'], ['De Koster', 'Joeri', '', 'Vrije Universiteit Brussel, Belgium'], ['De Meuter', 'Wolfgang', '', 'Vrije Universiteit\n  Brussel, Belgium'], ['De Roover', 'Coen', '', 'Vrije Universiteit Brussel, Belgium']]","['web programming', 'multi-tier programming', 'rich internet applications', 'JavaScript']"
11906,1710.08891,Rens Wouter van der Heijden,"Rens Wouter van der Heijden, Felix Engelmann, David M\""odinger,
  Franziska Sch\""onig, Frank Kargl","Blackchain: Scalability for Resource-Constrained Accountable
  Vehicle-to-X Communication","5 pages, 2 figures, SERIAL '17 Workshop",,10.1145/3152824.3152828,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a new Blockchain-based message and revocation
accountability system called Blackchain. Combining a distributed ledger with
existing mechanisms for security in V2X communication systems, we design a
distributed event data recorder (EDR) that satisfies traditional accountability
requirements by providing a compressed global state. Unlike previous
approaches, our distributed ledger solution provides an accountable revocation
mechanism without requiring trust in a single misbehavior authority, instead
allowing a collaborative and transparent decision making process through
Blackchain. This makes Blackchain an attractive alternative to existing
solutions for revocation in a Security Credential Management System (SCMS),
which suffer from the traditional disadvantages of PKIs, notably including
centralized trust. Our proposal becomes scalable through the use of
hierarchical consensus: individual vehicles dynamically create clusters, which
then provide their consensus decisions as input for road-side units (RSUs),
which in turn publish their results to misbehavior authorities. This authority,
which is traditionally a single entity in the SCMS, responsible for the
integrity of the entire V2X network, is now a set of authorities that
transparently perform a revocation, whose result is then published in a global
Blackchain state. This state can be used to prevent the issuance of
certificates to previously malicious users, and also prevents the authority
from misbehaving through the transparency implied by a global system state.
","[{'version': 'v1', 'created': 'Tue, 24 Oct 2017 17:04:21 GMT'}]",2017-10-25,"[['van der Heijden', 'Rens Wouter', ''], ['Engelmann', 'Felix', ''], ['Mödinger', 'David', ''], ['Schönig', 'Franziska', ''], ['Kargl', 'Frank', '']]","['Distributed Ledger', 'VANET', 'Accountability']"
11907,2204.12263,"Lo\""ic Rakotoson","Lo\""ic Rakotoson, Charles Letaillieur, Sylvain Massip, Fr\'ejus Laleye","Science Checker: Extractive-Boolean Question Answering For Scientific
  Fact Checking","8 pages, 4 figures","Proceedings of the 1st International Workshop on Multimedia AI
  against Disinformation (2022)",10.1145/3512732.3533580,,cs.CL cs.AI cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the explosive growth of scientific publications, making the synthesis of
scientific knowledge and fact checking becomes an increasingly complex task. In
this paper, we propose a multi-task approach for verifying the scientific
questions based on a joint reasoning from facts and evidence in research
articles. We propose an intelligent combination of (1) an automatic information
summarization and (2) a Boolean Question Answering which allows to generate an
answer to a scientific question from only extracts obtained after
summarization. Thus on a given topic, our proposed approach conducts structured
content modeling based on paper abstracts to answer a scientific question while
highlighting texts from paper that discuss the topic. We based our final system
on an end-to-end Extractive Question Answering (EQA) combined with a three
outputs classification model to perform in-depth semantic understanding of a
question to illustrate the aggregation of multiple responses. With our light
and fast proposed architecture, we achieved an average error rate of 4% and a
F1-score of 95.6%. Our results are supported via experiments with two QA models
(BERT, RoBERTa) over 3 Million Open Access (OA) articles in the medical and
health domains on Europe PMC.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2022 12:35:23 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Apr 2022 12:00:08 GMT'}]",2022-05-02,"[['Rakotoson', 'Loïc', ''], ['Letaillieur', 'Charles', ''], ['Massip', 'Sylvain', ''], ['Laleye', 'Fréjus', '']]","['Scientific Fact checking', 'Question Answering', 'Medical informationextraction', 'Query Analysis']"
11908,1807.08149,Daniel S. Katz,"Daniel S. Katz, Neil P. Chue Hong",Software Citation in Theory and Practice,,,10.1007/978-3-319-96418-8_34,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  In most fields, computational models and data analysis have become a
significant part of how research is performed, in addition to the more
traditional theory and experiment. Mathematics is no exception to this trend.
While the system of publication and credit for theory and experiment (journals
and books, often monographs) has developed and has become an expected part of
the culture, how research is shared and how candidates for hiring, promotion
are evaluated, software (and data) do not have the same history. A group
working as part of the FORCE11 community developed a set of principles for
software citation that fit software into the journal citation system, allow
software to be published and then cited, and there are now over 50,000 DOIs
that have been issued for software. However, some challenges remain, including:
promoting the idea of software citation to developers and users; collaborating
with publishers to ensure that systems collect and retain required metadata;
ensuring that the rest of the scholarly infrastructure, particularly indexing
sites, include software; working with communities so that software efforts
""count"" and understanding how best to cite software that has not been
published.
","[{'version': 'v1', 'created': 'Sat, 21 Jul 2018 13:13:30 GMT'}]",2018-07-24,"[['Katz', 'Daniel S.', ''], ['Hong', 'Neil P. Chue', '']]","['software citation', 'credit', 'software identifiers', 'software metadata', 'software repositories', 'bibliometrics']"
11909,1401.1906,"J\""urgen M\""unch","Peter Liggesmeyer, Jens Heidrich, J\""urgen M\""unch, Robert
  Kalckl\""osch, Henning Barthel, Dirk Zeckzer","Visualization of Software and Systems as Support Mechanism for
  Integrated Software Project Control","10 pages. The final publication is available at
  http://link.springer.com/chapter/10.1007%2F978-3-642-02574-7_94",,10.1007/978-3-642-02574-7_94,"Human-Computer Interaction: New Trends, volume 5610 of Lecture Notes
  in Computer Science, pages 846-855. Springer Berlin Heidelberg, 2009",cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many software development organizations still lack support for obtaining
intellectual control over their software development processes and for
determining the performance of their processes and the quality of the produced
products. Systematic support for detecting and reacting to critical process and
product states in order to achieve planned goals is usually missing. One means
to institutionalize measurement on the basis of explicit models is the
development and establishment of a so-called Software Project Control Center
(SPCC) for systematic quality assurance and management support. An SPCC is
comparable to a control room, which is a well known term in the mechanical
production domain. One crucial task of an SPCC is the systematic visualization
of measurement data in order to provide context-, purpose-, and role-oriented
information for all stakeholders (e.g., project managers, quality assurance
managers, developers) during the execution of a software development project.
The article will present an overview of SPCC concepts, a concrete instantiation
that supports goal-oriented data visualization, as well as examples and
experiences from practical applications.
","[{'version': 'v1', 'created': 'Thu, 9 Jan 2014 07:02:06 GMT'}]",2014-01-10,"[['Liggesmeyer', 'Peter', ''], ['Heidrich', 'Jens', ''], ['Münch', 'Jürgen', ''], ['Kalcklösch', 'Robert', ''], ['Barthel', 'Henning', ''], ['Zeckzer', 'Dirk', '']]","['Software Project Control Centers', 'Visualization Mechanisms', 'Data Visualization', 'GQM']"
11910,2012.08788,Sebastian Fuchs,"Christoph Meier, Sebastian L. Fuchs, A. John Hart and Wolfgang A. Wall","A novel smoothed particle hydrodynamics formulation for thermo-capillary
  phase change problems with focus on metal additive manufacturing melt pool
  modeling",,,10.1016/j.cma.2021.113812,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Laser-based metal processing including welding and three dimensional
printing, involves localized melting of solid or granular raw material, surface
tension-driven melt flow and significant evaporation of melt due to the applied
very high energy densities. The present work proposes a weakly compressible
smoothed particle hydrodynamics formulation for thermo-capillary phase change
problems involving solid, liquid and gaseous phases with special focus on
selective laser melting, an emerging metal additive manufacturing technique.
Evaporation-induced recoil pressure, temperature-dependent surface tension and
wetting forces are considered as mechanical interface fluxes, while a Gaussian
laser beam heat source and evaporation-induced heat losses are considered as
thermal interface fluxes. A novel interface stabilization scheme is proposed,
which is shown to allow for a stable and smooth liquid-gas interface by
effectively damping spurious interface flows as typically occurring in
continuum surface force approaches. Moreover, discretization strategies for the
tangential projection of the temperature gradient, as required for the discrete
Marangoni forces, are critically reviewed. The proposed formulation is deemed
especially suitable for modeling of the melt pool dynamics in metal additive
manufacturing because the full range of relevant interface forces is considered
and the explicit resolution of the atmospheric gas phase enables a consistent
description of pore formation by gas inclusion. The accuracy and robustness of
the individual model and method building blocks is verified by means of several
selected examples in the context of the selective laser melting process.
","[{'version': 'v1', 'created': 'Wed, 16 Dec 2020 08:15:24 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Apr 2021 18:51:09 GMT'}, {'version': 'v3', 'created': 'Mon, 19 Apr 2021 08:13:50 GMT'}]",2021-05-05,"[['Meier', 'Christoph', ''], ['Fuchs', 'Sebastian L.', ''], ['Hart', 'A. John', ''], ['Wall', 'Wolfgang A.', '']]","['Thermo-capillarity', 'two-phase flow', 'phase change', 'smoothed particle hydrodynamics', 'metaladditive manufacturing', 'melt pool']"
11911,1708.01524,Mehrdad Shariat,"Marcin Rybakowski, Krystian Safjan, Venkatkumar Venkatasubramanian,
  Arnesh Vijay, Laurent Dussopt, Ali Zaidi, Michael Peter, Jian Luo, Maria
  Fresia, Mehrdad Shariat","Challenges & Solutions for above 6 GHz Radio Access Network Integration
  for Future Mobile Communication Systems","6 pages, 4 figures",,10.1109/ICCW.2016.7503855,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile communication technology has been rapidly evolving ever since its
first introduction in the late 1980s. The development witnessed is not just in
the refinement of the radio access techniques, but also in the progression
towards offering sophisticated features and services to the mobile phone users.
To fulfill this ever-growing user demand and market trends, frequency ranges in
millimeter wave bands are envisioned for wireless radio transmission. To
respond to this trends, the EU-funded mmMAGIC project has been launched and its
main objective is to design and develop radio access techniques operating in
6-100 GHz bands. When it comes to developing technologies for systems operating
these frequency ranges, a major challenge encountered will be in terms of its
radio access network integration. Unquestionably, issues at various aspects of
physical layer design, channel modelling, architecture, network functions and
deployment will be encountered; problems in multi-node and multi-antenna
transceiver designs will surface as well. The work carried in this project will
address those challenges and propose solutions; but additionally, measure its
efficiency against the project specific KPIs set to meet the requirements of
the operational future 5G systems. The main intention of this paper is to
outline some of the challenges, more specifically to highlight the network
integration challenges, and discuss some of its technical solutions. The
primary purpose here is to focus towards integrated 5G technology, thereby
opening further research avenues for the exploration of new and alternate
frequency bands in the electromagnetic spectrum.
","[{'version': 'v1', 'created': 'Fri, 4 Aug 2017 14:35:29 GMT'}]",2017-08-07,"[['Rybakowski', 'Marcin', ''], ['Safjan', 'Krystian', ''], ['Venkatasubramanian', 'Venkatkumar', ''], ['Vijay', 'Arnesh', ''], ['Dussopt', 'Laurent', ''], ['Zaidi', 'Ali', ''], ['Peter', 'Michael', ''], ['Luo', 'Jian', ''], ['Fresia', 'Maria', ''], ['Shariat', 'Mehrdad', '']]","['mm-wave', '5G technology', 'mmMAGIC', 'air']"
11912,2002.07627,Amir M. Mirzendehdel,"Amir M. Mirzendehdel, Morad Behandish, and Saigopal Nelaturi","Topology Optimization with Accessibility Constraint for Multi-Axis
  Machining",,,10.1016/j.cad.2020.102825,,cs.CE cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a topology optimization (TO) framework to enable
automated design of mechanical components while ensuring the result can be
manufactured using multi-axis machining. Although TO improves the part's
performance, the as-designed model is often geometrically too complex to be
machined and the as-manufactured model can significantly vary due to machining
constraints that are not accounted for during TO. In other words, many of the
optimized design features cannot be accessed by a machine tool without
colliding with the part (or fixtures). The subsequent post-processing to make
the part machinable with the given setup requires trial-and-error without
guarantees on preserving the optimized performance. Our proposed approach is
based on the well-established accessibility analysis formulation using
convolutions in configuration space that is extensively used in spatial
planning and robotics. We define an 'inaccessibility measure field' (IMF) over
the design domain to identify non-manufacturable features and quantify their
contribution to non-manufacturability. The IMF is used to penalize the
sensitivity field of performance objectives and constraints to prevent
formation of inaccessible regions. Unlike existing discrete formulations, our
IMF provides a continuous spatial field that is desirable for TO convergence.
Our approach applies to arbitrary geometric complexity of the part, tools, and
fixtures, and is highly parallelizable on multi-core architecture. We
demonstrate the effectiveness of our framework on benchmark and realistic
examples in 2D and 3D. We also show that it is possible to directly construct
manufacturing plans for the optimized designs based on the accessibility
information.
","[{'version': 'v1', 'created': 'Sun, 16 Feb 2020 18:54:45 GMT'}]",2020-02-19,"[['Mirzendehdel', 'Amir M.', ''], ['Behandish', 'Morad', ''], ['Nelaturi', 'Saigopal', '']]","['Design for Manufacturing', 'Topology Optimization', 'Accessibility Analysis', 'Multi-Axis Machining', 'CNCMachining', 'Configuration Space', 'Hybrid Manufacturing']"
11913,2009.00534,Mohsen Shahhosseini,"Mohsen Shahhosseini, Guiping Hu",Improved Weighted Random Forest for Classification Problems,,,10.1007/978-3-030-66501-2_4,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several studies have shown that combining machine learning models in an
appropriate way will introduce improvements in the individual predictions made
by the base models. The key to make well-performing ensemble model is in the
diversity of the base models. Of the most common solutions for introducing
diversity into the decision trees are bagging and random forest. Bagging
enhances the diversity by sampling with replacement and generating many
training data sets, while random forest adds selecting a random number of
features as well. This has made the random forest a winning candidate for many
machine learning applications. However, assuming equal weights for all base
decision trees does not seem reasonable as the randomization of sampling and
input feature selection may lead to different levels of decision-making
abilities across base decision trees. Therefore, we propose several algorithms
that intend to modify the weighting strategy of regular random forest and
consequently make better predictions. The designed weighting frameworks include
optimal weighted random forest based on ac-curacy, optimal weighted random
forest based on the area under the curve (AUC), performance-based weighted
random forest, and several stacking-based weighted random forest models. The
numerical results show that the proposed models are able to introduce
significant improvements compared to regular random forest.
","[{'version': 'v1', 'created': 'Tue, 1 Sep 2020 16:08:45 GMT'}]",2021-03-01,"[['Shahhosseini', 'Mohsen', ''], ['Hu', 'Guiping', '']]","['ensemble', 'weighted random forest', 'optimization', 'stacking']"
11914,2112.12466,Jingbo Zhao,"Jingbo Zhao, Zhetao Wang, Yiqin Peng, Yaojun Wang",Real-Time Generation of Leg Animation for Walking-in-Place Techniques,Accepted by ACM SIGGRAPH VRCAI 2022,,10.1145/3574131.3574446,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generating forward-backward self-representation leg animation in virtual
environments for walking-in-place (WIP) techniques is an underexplored research
topic. A challenging aspect of the problem is to find an appropriate mapping
from tracked vertical foot motion to natural cyclical movements of real
walking. In this work, we present a kinematic approach based on animation
rigging to generating real-time leg animation. Our method works by tracking
vertical in-place foot movements of a user with a Kinect v2 sensor and mapping
tracked foot height to inverse kinematics (IK) targets. These IK targets were
aligned with an avatar's feet to guide the virtual feet to perform cyclic
walking motions. We conducted a user study to evaluate our approach. Results
showed that the proposed method produced compelling forward-backward leg
animation during walking. We show that the proposed technique can be easily
integrated into existing WIP techniques.
","[{'version': 'v1', 'created': 'Thu, 23 Dec 2021 11:15:24 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Dec 2022 06:59:46 GMT'}]",2022-12-13,"[['Zhao', 'Jingbo', ''], ['Wang', 'Zhetao', ''], ['Peng', 'Yiqin', ''], ['Wang', 'Yaojun', '']]","['Leg animation', 'walking-in-place', 'virtual locomotion']"
11915,2010.15506,Jawad Yasin,"Jawad N. Yasin, Sherif A.S. Mohamed, Mohammad-Hashem Haghbayan, Jukka
  Heikkonen, Hannu Tenhunen, Muhammad Mehboob Yasin, Juha Plosila","Dynamic Formation Reshaping Based on Point Set Registration in a Swarm
  of Drones","Accepted to the Future of Information and Communication Conference
  (FICC) 2021",,10.1007/978-3-030-73100-7_42,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work focuses on the formation reshaping in an optimized manner in
autonomous swarm of drones. Here, the two main problems are: 1) how to break
and reshape the initial formation in an optimal manner, and 2) how to do such
reformation while minimizing the overall deviation of the drones and the
overall time, i.e., without slowing down. To address the first problem, we
introduce a set of routines for the drones/agents to follow while reshaping to
a secondary formation shape. And the second problem is resolved by utilizing
the temperature function reduction technique, originally used in the point set
registration process. The goal is to be able to dynamically reform the shape of
multi-agent based swarm in near-optimal manner while going through narrow
openings between, for instance obstacles, and then bringing the agents back to
their original shape after passing through the narrow passage using point set
registration technique.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2020 11:59:59 GMT'}]",2021-05-31,"[['Yasin', 'Jawad N.', ''], ['Mohamed', 'Sherif A. S.', ''], ['Haghbayan', 'Mohammad-Hashem', ''], ['Heikkonen', 'Jukka', ''], ['Tenhunen', 'Hannu', ''], ['Yasin', 'Muhammad Mehboob', ''], ['Plosila', 'Juha', '']]","['Autonomous swarm', 'Multi-agent systems', 'Point set registration', 'Agent-based modeling', 'Swarm intelligence', 'Collision avoidance']"
11916,1904.04447,Bin Liu,"Bin Liu, Ruiming Tang, Yingzhi Chen, Jinkai Yu, Huifeng Guo, Yuzhou
  Zhang","Feature Generation by Convolutional Neural Network for Click-Through
  Rate Prediction",,TheWebConf 2019,10.1145/3308558.3313497,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Click-Through Rate prediction is an important task in recommender systems,
which aims to estimate the probability of a user to click on a given item.
Recently, many deep models have been proposed to learn low-order and high-order
feature interactions from original features. However, since useful interactions
are always sparse, it is difficult for DNN to learn them effectively under a
large number of parameters. In real scenarios, artificial features are able to
improve the performance of deep models (such as Wide & Deep Learning), but
feature engineering is expensive and requires domain knowledge, making it
impractical in different scenarios. Therefore, it is necessary to augment
feature space automatically. In this paper, We propose a novel Feature
Generation by Convolutional Neural Network (FGCNN) model with two components:
Feature Generation and Deep Classifier. Feature Generation leverages the
strength of CNN to generate local patterns and recombine them to generate new
features. Deep Classifier adopts the structure of IPNN to learn interactions
from the augmented feature space. Experimental results on three large-scale
datasets show that FGCNN significantly outperforms nine state-of-the-art
models. Moreover, when applying some state-of-the-art models as Deep
Classifier, better performance is always achieved, showing the great
compatibility of our FGCNN model. This work explores a novel direction for CTR
predictions: it is quite useful to reduce the learning difficulties of DNN by
automatically identifying important features.
","[{'version': 'v1', 'created': 'Tue, 9 Apr 2019 03:27:06 GMT'}]",2019-04-30,"[['Liu', 'Bin', ''], ['Tang', 'Ruiming', ''], ['Chen', 'Yingzhi', ''], ['Yu', 'Jinkai', ''], ['Guo', 'Huifeng', ''], ['Zhang', 'Yuzhou', '']]","['CNN', 'Click-Through Rate Prediction', 'Feature Generation']"
11917,1906.03786,Abu Sufian,"A. Sufian (1), Anirudha Ghosh (1), Avijit Naskar (1), Farhana Sultana
  (1), Jaya Sil (2) and M M Hafizur Rahman (3) ((1) University of Gour Banga,
  India, (2) IIEST Shibpur, India, (3) King Faisal University, Saudi Arabia)","BDNet: Bengali Handwritten Numeral Digit Recognition based on Densely
  connected Convolutional Neural Networks","23 pages, 11 figures, 7 tables, Accepted Manuscript. Journal of King
  Saud University - Computer and Information Sciences (2019)","Journal of King Saud University - Computer and Information
  Sciences, Elsevier, Online, 2020",10.1016/j.jksuci.2020.03.002,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Images of handwritten digits are different from natural images as the
orientation of a digit, as well as similarity of features of different digits,
makes confusion. On the other hand, deep convolutional neural networks are
achieving huge success in computer vision problems, especially in image
classification. BDNet is a densely connected deep convolutional neural network
model used to classify (recognize) Bengali handwritten numeral digits. It is
end-to-end trained using ISI Bengali handwritten numeral dataset. During
training, untraditional data preprocessing and augmentation techniques are used
so that the trained model works on a different dataset. The model has achieved
the test accuracy of 99.775%(baseline was 99.40%) on the test dataset of ISI
Bengali handwritten numerals. So, the BDNet model gives 62.5% error reduction
compared to previous state-of-the-art models. Here we have also created a
dataset of 1000 images of Bengali handwritten numerals to test the trained
model, and it giving promising results. Codes, trained model and our own
dataset are available at: {https://github.com/Sufianlab/BDNet}.
","[{'version': 'v1', 'created': 'Mon, 10 Jun 2019 03:31:58 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Jun 2019 14:12:37 GMT'}, {'version': 'v3', 'created': 'Fri, 25 Oct 2019 19:32:36 GMT'}, {'version': 'v4', 'created': 'Tue, 31 Dec 2019 13:35:43 GMT'}, {'version': 'v5', 'created': 'Thu, 12 Mar 2020 13:15:44 GMT'}]",2020-07-14,"[['Sufian', 'A.', ''], ['Ghosh', 'Anirudha', ''], ['Naskar', 'Avijit', ''], ['Sultana', 'Farhana', ''], ['Sil', 'Jaya', ''], ['Rahman', 'M M Hafizur', '']]","['Bengali Digit Recognition', 'CNN', 'Dataset', 'Deep Learning', 'Handwritten Numerals', 'Image Classification']"
11918,2112.00468,Vihanga Jayawickrama,"Vihanga Jayawickrama, Gihan Weeraprameshwara, Nisansa de Silva,
  Yudhanjaya Wijeratne","Seeking Sinhala Sentiment: Predicting Facebook Reactions of Sinhala
  Posts",,,10.1109/ICter53630.2021.9774796,,cs.LG cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Facebook network allows its users to record their reactions to text via a
typology of emotions. This network, taken at scale, is therefore a prime data
set of annotated sentiment data. This paper uses millions of such reactions,
derived from a decade worth of Facebook post data centred around a Sri Lankan
context, to model an eye of the beholder approach to sentiment detection for
online Sinhala textual content. Three different sentiment analysis models are
built, taking into account a limited subset of reactions, all reactions, and
another that derives a positive/negative star rating value. The efficacy of
these models in capturing the reactions of the observers are then computed and
discussed. The analysis reveals that binary classification of reactions, for
Sinhala content, is significantly more accurate than the other approaches.
Furthermore, the inclusion of the like reaction hinders the capability of
accurately predicting other reactions.
","[{'version': 'v1', 'created': 'Wed, 1 Dec 2021 13:05:05 GMT'}]",2022-08-04,"[['Jayawickrama', 'Vihanga', ''], ['Weeraprameshwara', 'Gihan', ''], ['de Silva', 'Nisansa', ''], ['Wijeratne', 'Yudhanjaya', '']]","['NLP', 'sentiment analysis', 'Sinhala', 'word vectorization']"
11919,2002.06383,Andrew McDole,Andrew McDole and Mahmoud Abdelsalam and Maanak Gupta and Sudip Mittal,"Analyzing CNN Based Behavioural Malware Detection Techniques on Cloud
  IaaS",,,10.1007/978-3-030-59635-4_5,,cs.CR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud Infrastructure as a Service (IaaS) is vulnerable to malware due to its
exposure to external adversaries, making it a lucrative attack vector for
malicious actors. A datacenter infected with malware can cause data loss and/or
major disruptions to service for its users. This paper analyzes and compares
various Convolutional Neural Networks (CNNs) for online detection of malware in
cloud IaaS. The detection is performed based on behavioural data using process
level performance metrics including cpu usage, memory usage, disk usage etc. We
have used the state of the art DenseNets and ResNets in effectively detecting
malware in online cloud system. CNN are designed to extract features from data
gathered from a live malware running on a real cloud environment. Experiments
are performed on OpenStack (a cloud IaaS software) testbed designed to
replicate a typical 3-tier web architecture. Comparative analysis is performed
for different metrics for different CNN models used in this research.
","[{'version': 'v1', 'created': 'Sat, 15 Feb 2020 14:04:33 GMT'}]",2020-09-28,"[['McDole', 'Andrew', ''], ['Abdelsalam', 'Mahmoud', ''], ['Gupta', 'Maanak', ''], ['Mittal', 'Sudip', '']]","['Deep Learning', 'Convolutional Neural Network', 'Cloud IaaS', 'Residual Networks', 'Dense Networks']"
11920,2105.02156,Sean Moss,"Cristina Matache, Sean Moss, Sam Staton",Recursion and Sequentiality in Categories of Sheaves,,,10.4230/LIPIcs.FSCD.2021.25,,cs.PL cs.LO math.CT,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We present a fully abstract model of a call-by-value language with
higher-order functions, recursion and natural numbers, as an exponential ideal
in a topos. Our model is inspired by the fully abstract models of O'Hearn,
Riecke and Sandholm, and Marz and Streicher. In contrast with semantics based
on cpo's, we treat recursion as just one feature in a model built by combining
a choice of modular components.
","[{'version': 'v1', 'created': 'Wed, 5 May 2021 16:10:06 GMT'}]",2021-07-07,"[['Matache', 'Cristina', ''], ['Moss', 'Sean', ''], ['Staton', 'Sam', '']]","['Denotational semantics', 'Full abstraction', 'Recursion', 'Sheaf toposes', 'CPOs']"
11921,2003.04470,Vuong M. Ngo,"V.M. Ngo, N.A. Le-Khac, and M.T. Kechadi",Data Warehouse and Decision Support on Integrated Crop Big Data,"13 pages, 11 figures. arXiv admin note: text overlap with
  arXiv:1905.12411","International Journal of Business Process Integration and
  Management 2020 Vol.10 No.1",10.1504/IJBPIM.2020.113115,,cs.DB cs.DC cs.LG cs.PF,http://creativecommons.org/licenses/by/4.0/,"  In recent years, precision agriculture is becoming very popular. The
introduction of modern information and communication technologies for
collecting and processing Agricultural data revolutionise the agriculture
practises. This has started a while ago (early 20th century) and it is driven
by the low cost of collecting data about everything; from information on fields
such as seed, soil, fertiliser, pest, to weather data, drones and satellites
images. Specially, the agricultural data mining today is considered as Big Data
application in terms of volume, variety, velocity and veracity. Hence it leads
to challenges in processing vast amounts of complex and diverse information to
extract useful knowledge for the farmer, agronomist, and other businesses. It
is a key foundation to establishing a crop intelligence platform, which will
enable efficient resource management and high quality agronomy decision making
and recommendations. In this paper, we designed and implemented a continental
level agricultural data warehouse (ADW). ADW is characterised by its (1)
flexible schema; (2) data integration from real agricultural multi datasets;
(3) data science and business intelligent support; (4) high performance; (5)
high storage; (6) security; (7) governance and monitoring; (8) consistency,
availability and partition tolerant; (9) cloud compatibility. We also evaluate
the performance of ADW and present some complex queries to extract and return
necessary knowledge about crop management.
","[{'version': 'v1', 'created': 'Tue, 10 Mar 2020 00:10:22 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Apr 2021 08:45:11 GMT'}]",2021-04-13,"[['Ngo', 'V. M.', ''], ['Le-Khac', 'N. A.', ''], ['Kechadi', 'M. T.', '']]","['Data warehouse', 'decision support', 'crop Big Data', 'smart agriculture']"
11922,2011.03841,Jean Pablo Vieira de Mello,"Jean Pablo Vieira de Mello, Lucas Tabelini, Rodrigo F. Berriel, Thiago
  M. Paix\~ao, Alberto F. de Souza, Claudine Badue, Nicu Sebe, Thiago
  Oliveira-Santos","Deep traffic light detection by overlaying synthetic context on
  arbitrary natural images",,Computers & Graphics (2020),10.1016/j.cag.2020.09.012,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Deep neural networks come as an effective solution to many problems
associated with autonomous driving. By providing real image samples with
traffic context to the network, the model learns to detect and classify
elements of interest, such as pedestrians, traffic signs, and traffic lights.
However, acquiring and annotating real data can be extremely costly in terms of
time and effort. In this context, we propose a method to generate artificial
traffic-related training data for deep traffic light detectors. This data is
generated using basic non-realistic computer graphics to blend fake traffic
scenes on top of arbitrary image backgrounds that are not related to the
traffic domain. Thus, a large amount of training data can be generated without
annotation efforts. Furthermore, it also tackles the intrinsic data imbalance
problem in traffic light datasets, caused mainly by the low amount of samples
of the yellow state. Experiments show that it is possible to achieve results
comparable to those obtained with real training data from the problem domain,
yielding an average mAP and an average F1-score which are each nearly 4 p.p.
higher than the respective metrics obtained with a real-world reference model.
","[{'version': 'v1', 'created': 'Sat, 7 Nov 2020 19:57:22 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Nov 2020 02:30:51 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Dec 2020 22:44:41 GMT'}]",2020-12-14,"[['de Mello', 'Jean Pablo Vieira', ''], ['Tabelini', 'Lucas', ''], ['Berriel', 'Rodrigo F.', ''], ['Paixão', 'Thiago M.', ''], ['de Souza', 'Alberto F.', ''], ['Badue', 'Claudine', ''], ['Sebe', 'Nicu', ''], ['Oliveira-Santos', 'Thiago', '']]","['Traffic light', 'Synthetic data', 'Deep learning', 'Object detection', 'Imagecontext']"
11923,2004.11556,Jan Vykopal,"Jan Vykopal, Valdemar \v{S}v\'abensk\'y, Ee-Chien Chang","Benefits and Pitfalls of Using Capture the Flag Games in University
  Courses","ACM SIGCSE 2020 conference, 7 pages, 5 figures, 2 tables",,10.1145/3328778.3366893,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The concept of Capture the Flag (CTF) games for practicing cybersecurity
skills is widespread in informal educational settings and leisure-time
competitions. However, it is not much used in university courses. This paper
summarizes our experience from using jeopardy CTF games as homework assignments
in an introductory undergraduate course. Our analysis of data describing
students' in-game actions and course performance revealed four aspects that
should be addressed in the design of CTF tasks: scoring, scaffolding,
plagiarism, and learning analytics capabilities of the used CTF platform. The
paper addresses these aspects by sharing our recommendations. We believe that
these recommendations are useful for cybersecurity instructors who consider
using CTF games for assessment in university courses and developers of CTF game
frameworks.
","[{'version': 'v1', 'created': 'Fri, 24 Apr 2020 06:55:02 GMT'}]",2020-04-27,"[['Vykopal', 'Jan', ''], ['Švábenský', 'Valdemar', ''], ['Chang', 'Ee-Chien', '']]","['cybersecurity', 'capture the flag', 'summative assessment', 'homeworkassignment', 'plagiarism', 'learning analytics', 'educational data mining']"
11924,2202.02098,Ralph Peeters,"Ralph Peeters, Christian Bizer",Supervised Contrastive Learning for Product Matching,,,10.1145/3487553.3524254,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Contrastive learning has moved the state of the art for many tasks in
computer vision and information retrieval in recent years. This poster is the
first work that applies supervised contrastive learning to the task of product
matching in e-commerce using product offers from different e-shops. More
specifically, we employ a supervised contrastive learning technique to
pre-train a Transformer encoder which is afterward fine-tuned for the matching
task using pair-wise training data. We further propose a source-aware sampling
strategy that enables contrastive learning to be applied for use cases in which
the training data does not contain product identifiers. We show that applying
supervised contrastive pre-training in combination with source-aware sampling
significantly improves the state-of-the-art performance on several widely used
benchmarks: For Abt-Buy, we reach an F1-score of 94.29 (+3.24 compared to the
previous state-of-the-art), for Amazon-Google 79.28 (+ 3.7). For WDC Computers
datasets, we reach improvements between +0.8 and +8.84 in F1-score depending on
the training set size. Further experiments with data augmentation and
self-supervised contrastive pre-training show that the former can be helpful
for smaller training sets while the latter leads to a significant decline in
performance due to inherent label noise. We thus conclude that contrastive
pre-training has a high potential for product matching use cases in which
explicit supervision is available.
","[{'version': 'v1', 'created': 'Fri, 4 Feb 2022 12:16:38 GMT'}, {'version': 'v2', 'created': 'Mon, 2 May 2022 10:40:06 GMT'}]",2022-05-03,"[['Peeters', 'Ralph', ''], ['Bizer', 'Christian', '']]","['e-commerce', 'product matching', 'entity matching', 'contrastive learning', 'transformers']"
11925,2104.14208,Peng Liang,"Chen Yang, Peng Liang, Liming Fu, Zengyang Li","Self-Claimed Assumptions in Deep Learning Frameworks: An Exploratory
  Study",,,10.1145/3463274.3463333,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Deep learning (DL) frameworks have been extensively designed, implemented,
and used in software projects across many domains. However, due to the lack of
knowledge or information, time pressure, complex context, etc., various
uncertainties emerge during the development, leading to assumptions made in DL
frameworks. Though not all the assumptions are negative to the frameworks,
being unaware of certain assumptions can result in critical problems (e.g.,
system vulnerability and failures, inconsistencies, and increased cost). As the
first step of addressing the critical problems, there is a need to explore and
understand the assumptions made in DL frameworks. To this end, we conducted an
exploratory study to understand self-claimed assumptions (SCAs) about their
distribution, classification, and impacts using code comments from nine popular
DL framework projects on GitHub. The results are that: (1) 3,084 SCAs are
scattered across 1,775 files in the nine DL frameworks, ranging from 1,460
(TensorFlow) to 8 (Keras) SCAs. (2) There are four types of validity of SCAs:
Valid SCA, Invalid SCA, Conditional SCA, and Unknown SCA, and four types of
SCAs based on their content: Configuration and Context SCA, Design SCA, Tensor
and Variable SCA, and Miscellaneous SCA. (3) Both valid and invalid SCAs may
have an impact within a specific scope (e.g., in a function) on the DL
frameworks. Certain technical debt is induced when making SCAs. There are
source code written and decisions made based on SCAs. This is the first study
on investigating SCAs in DL frameworks, which helps researchers and
practitioners to get a comprehensive understanding on the assumptions made. We
also provide the first dataset of SCAs for further research and practice in
this area.
","[{'version': 'v1', 'created': 'Thu, 29 Apr 2021 08:56:47 GMT'}]",2021-04-30,"[['Yang', 'Chen', ''], ['Liang', 'Peng', ''], ['Fu', 'Liming', ''], ['Li', 'Zengyang', '']]","['Self-Claimed Assumption', 'Deep Learning Framework', 'GitHub']"
11926,2209.09098,Bojan \v{Z}unkovi\v{c},Bojan \v{Z}unkovi\v{c},Deep tensor networks with matrix product operators,"9+2 pages, 8 figures","Quantum Mach. Intell. 4, 21 (2022)",10.1007/s42484-022-00081-1,,cs.LG quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce deep tensor networks, which are exponentially wide neural
networks based on the tensor network representation of the weight matrices. We
evaluate the proposed method on the image classification (MNIST, FashionMNIST)
and sequence prediction (cellular automata) tasks. In the image classification
case, deep tensor networks improve our matrix product state baselines and
achieve 0.49% error rate on MNIST and 8.3% error rate on FashionMNIST. In the
sequence prediction case, we demonstrate an exponential improvement in the
number of parameters compared to the one-layer tensor network methods. In both
cases, we discuss the non-uniform and the uniform tensor network models and
show that the latter generalizes well to different input sizes.
","[{'version': 'v1', 'created': 'Fri, 16 Sep 2022 09:09:52 GMT'}]",2022-09-20,"[['Žunkovič', 'Bojan', '']]","['matrix product operators', 'time-dependent variational principle', 'deep tensor networks', 'lineardot-attention']"
11927,1601.06327,Katina Kralevska,"Katina Kralevska, Danilo Gligoroski and Harald Oeverby",Balanced XOR-ed Coding,"Advances in Communication Networking Volume 8115 of the series
  Lecture Notes in Computer Science pp 161-172","Lecture Notes in Computer Science, vol. 8115, pp. 161-172, 2013",10.1007/978-3-642-40552-5_15,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper concerns with the construction of codes over $GF(2)$ which reach
the max-flow for single source multicast acyclic networks with delay. The
coding is always a bitwise XOR of packets with equal lengths, and is based on
highly symmetrical and balanced designs. For certain setups and parameters, our
approach offers additional plausible security properties: an adversary needs to
eavesdrop at least max-flow links in order to decode at least one original
packet.
","[{'version': 'v1', 'created': 'Sat, 23 Jan 2016 23:30:18 GMT'}]",2020-02-14,"[['Kralevska', 'Katina', ''], ['Gligoroski', 'Danilo', ''], ['Oeverby', 'Harald', '']]","['XOR coding', 'GF(2)', 'Latin squares', 'Latin rectangles']"
11928,2211.14233,\'Etienne Andr\'e,"\'Etienne Andr\'e, Shapagat Bolat, Engel Lefaucheux, Dylan Marinho",strategFTO: Untimed control for timed opacity,"This work is partially supported by the ANR-NRF French-Singaporean
  research program ProMiS (ANR-19-CE25-0015 / 2019 ANR NRF 0092) and the ANR
  research program BisoUS. Experiments presented in this paper were carried out
  using the Grid'5000 testbed, supported by a scientific interest group hosted
  by Inria and including CNRS, RENATER and several universities as well as
  other organizations","Proceedings of the 8th International Workshop on Formal Techniques
  for Safety-Critical Systems (FTSCS 2022)",10.1145/3563822.3568013,,cs.CR cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a prototype tool strategFTO addressing the verification of a
security property in critical software. We consider a recent definition of
timed opacity where an attacker aims to deduce some secret while having access
only to the total execution time. The system, here modeled by timed automata,
is deemed opaque if for any execution time, there are either no corresponding
runs, or both public and private corresponding runs. We focus on the untimed
control problem: exhibiting a controller, i.e., a set of allowed actions, such
that the system restricted to those actions is fully timed-opaque. We first
show that this problem is not more complex than the full timed opacity problem,
and then we propose an algorithm, implemented and evaluated in practice.
","[{'version': 'v1', 'created': 'Fri, 25 Nov 2022 16:47:45 GMT'}]",2022-11-28,"[['André', 'Étienne', ''], ['Bolat', 'Shapagat', ''], ['Lefaucheux', 'Engel', ''], ['Marinho', 'Dylan', '']]","['opacity', 'timing leak', 'timed automata', 'security', 'control', 'IMITATOR']"
11929,2009.11963,Jonathan Enderle,Jonathan Scott Enderle,Toward a Thermodynamics of Meaning,"To be published in the proceedings of CHR 2020: Workshop on
  Computational Humanities Research, November 18-20, 2020, Amsterdam, The
  Netherlands","Proceedings of the Workshop on Computational Humanities Research
  CEUR Vol-2723 (2020) 191-201",10.5281/zenodo.4302259,,cs.CL cs.AI,http://creativecommons.org/licenses/by/4.0/,"  As language models such as GPT-3 become increasingly successful at generating
realistic text, questions about what purely text-based modeling can learn about
the world have become more urgent. Is text purely syntactic, as skeptics argue?
Or does it in fact contain some semantic information that a sufficiently
sophisticated language model could use to learn about the world without any
additional inputs? This paper describes a new model that suggests some
qualified answers to those questions. By theorizing the relationship between
text and the world it describes as an equilibrium relationship between a
thermodynamic system and a much larger reservoir, this paper argues that even
very simple language models do learn structural facts about the world, while
also proposing relatively precise limits on the nature and extent of those
facts. This perspective promises not only to answer questions about what
language models actually learn, but also to explain the consistent and
surprising success of cooccurrence prediction as a meaning-making strategy in
AI.
","[{'version': 'v1', 'created': 'Thu, 24 Sep 2020 21:56:02 GMT'}]",2020-12-03,"[['Enderle', 'Jonathan Scott', '']]","['language modeling', 'natural language semantics', 'artificial intelligence', 'statistical mechanics']"
11930,2208.04494,Dongwoo Lew,"Dongwoo Lew, Kyungchul Lee, and Jongsun Park","A Time-to-first-spike Coding and Conversion Aware Training for
  Energy-Efficient Deep Spiking Neural Network Processor Design",Accepted to Design Automation Conference 2022,,10.1145/3489517.3530457,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present an energy-efficient SNN architecture, which can
seamlessly run deep spiking neural networks (SNNs) with improved accuracy.
First, we propose a conversion aware training (CAT) to reduce ANN-to-SNN
conversion loss without hardware implementation overhead. In the proposed CAT,
the activation function developed for simulating SNN during ANN training, is
efficiently exploited to reduce the data representation error after conversion.
Based on the CAT technique, we also present a time-to-first-spike coding that
allows lightweight logarithmic computation by utilizing spike time information.
The SNN processor design that supports the proposed techniques has been
implemented using 28nm CMOS process. The processor achieves the top-1
accuracies of 91.7%, 67.9% and 57.4% with inference energy of 486.7uJ, 503.6uJ,
and 1426uJ to process CIFAR-10, CIFAR-100, and Tiny-ImageNet, respectively,
when running VGG-16 with 5bit logarithmic weights.
","[{'version': 'v1', 'created': 'Tue, 9 Aug 2022 01:46:46 GMT'}]",2022-08-10,"[['Lew', 'Dongwoo', ''], ['Lee', 'Kyungchul', ''], ['Park', 'Jongsun', '']]","['Spiking Neural Network', 'ANN-to-SNN Conversion', 'Temporal Coding', 'Logarithmic Computations']"
11931,2010.15363,Tianxin Wei,"Tianxin Wei, Fuli Feng, Jiawei Chen, Ziwei Wu, Jinfeng Yi, Xiangnan He","Model-Agnostic Counterfactual Reasoning for Eliminating Popularity Bias
  in Recommender System",To Appear in SIGKDD 2021,,10.1145/3447548.3467289,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The general aim of the recommender system is to provide personalized
suggestions to users, which is opposed to suggesting popular items. However,
the normal training paradigm, i.e., fitting a recommender model to recover the
user behavior data with pointwise or pairwise loss, makes the model biased
towards popular items. This results in the terrible Matthew effect, making
popular items be more frequently recommended and become even more popular.
Existing work addresses this issue with Inverse Propensity Weighting (IPW),
which decreases the impact of popular items on the training and increases the
impact of long-tail items. Although theoretically sound, IPW methods are highly
sensitive to the weighting strategy, which is notoriously difficult to tune. In
this work, we explore the popularity bias issue from a novel and fundamental
perspective -- cause-effect. We identify that popularity bias lies in the
direct effect from the item node to the ranking score, such that an item's
intrinsic property is the cause of mistakenly assigning it a higher ranking
score. To eliminate popularity bias, it is essential to answer the
counterfactual question that what the ranking score would be if the model only
uses item property. To this end, we formulate a causal graph to describe the
important cause-effect relations in the recommendation process. During
training, we perform multi-task learning to achieve the contribution of each
cause; during testing, we perform counterfactual inference to remove the effect
of item popularity. Remarkably, our solution amends the learning process of
recommendation which is agnostic to a wide range of models -- it can be easily
implemented in existing methods. We demonstrate it on Matrix Factorization (MF)
and LightGCN [20]. Experiments on five real-world datasets demonstrate the
effectiveness of our method.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2020 06:02:31 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Jun 2021 13:23:37 GMT'}]",2021-06-08,"[['Wei', 'Tianxin', ''], ['Feng', 'Fuli', ''], ['Chen', 'Jiawei', ''], ['Wu', 'Ziwei', ''], ['Yi', 'Jinfeng', ''], ['He', 'Xiangnan', '']]","['Recommendation', 'Popularity Bias', 'Causal Reasoning']"
11932,2210.14441,Song Yang,Song Yang and Houari Sahraoui,"Towards Automatically Extracting UML Class Diagrams from Natural
  Language Specifications","8 pages, 7 tables, 9 figures, 2 algorithms, to be published in MODELS
  '22 Companion",,10.1145/3550356.3561592,,cs.SE cs.IR,http://creativecommons.org/licenses/by/4.0/,"  In model-driven engineering (MDE), UML class diagrams serve as a way to plan
and communicate between developers. However, it is complex and
resource-consuming. We propose an automated approach for the extraction of UML
class diagrams from natural language software specifications. To develop our
approach, we create a dataset of UML class diagrams and their English
specifications with the help of volunteers. Our approach is a pipeline of steps
consisting of the segmentation of the input into sentences, the classification
of the sentences, the generation of UML class diagram fragments from sentences,
and the composition of these fragments into one UML class diagram. We develop a
quantitative testing framework specific to UML class diagram extraction. Our
approach yields low precision and recall but serves as a benchmark for future
research.
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2022 03:24:46 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Oct 2022 17:54:56 GMT'}]",2022-10-28,"[['Yang', 'Song', ''], ['Sahraoui', 'Houari', '']]","['Model-driven engineering', 'Machine learning', 'Natural languageprocessing', 'Domain modeling']"
11933,2301.09365,Younes El Koudia,"Younes El koudia, Jarou Tarik, Abdouni Jawad, Sofia El Idrissi and
  Elmahdi Nasri","Modeling and Design of Longitudinal and Lateral Control System with a
  FeedForward Controller for a 4 Wheeled Robot",,"International Journal on Cybernetics & Informatics (IJCI) Vol. 12,
  No.1, February 2023",10.5121/ijci.2023.120107,,cs.RO cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  The work show in this paper progresses through a sequence of physics-based
increasing fidelity models that are used to design the robot controllers that
respect the limits of the robot capabilities, develop a reference simple
controller applicable to a large subset of tracking conditions, which include
mostly non-invasive or highly dynamic movements and define path geometry
following the control problem and develop both a simple geometric control and a
dynamic model predictive control approach. In this paper, we propose for a
nonlinear model with disturbance effect, the mathematical modeling of the
longitudinal and lateral movements using PID with a feed-forward controller.
This study proposes a feedforward controller to eliminate the disturbance
effect.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2023 11:15:46 GMT'}]",2023-01-24,"[['koudia', 'Younes El', ''], ['Tarik', 'Jarou', ''], ['Jawad', 'Abdouni', ''], ['Idrissi', 'Sofia El', ''], ['Nasri', 'Elmahdi', '']]","['Robot', 'tracking', 'path geometry', 'geometric control', 'predictive control', 'feed-forward controller']"
11934,2009.10174,Sonal Mahajan,"Sonal Mahajan (1), Negarsadat Abolhassani (2), Mukul R. Prasad (1)
  ((1) Fujitsu Laboratories of America, Inc., (2) University of Southern
  California)","Recommending Stack Overflow Posts for Fixing Runtime Exceptions using
  Failure Scenario Matching",,,10.1145/3368089.3409764,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Using online Q&A forums, such as Stack Overflow (SO), for guidance to resolve
program bugs, among other development issues, is commonplace in modern software
development practice. Runtime exceptions (RE) is one such important class of
bugs that is actively discussed on SO. In this work we present a technique and
prototype tool called MAESTRO that can automatically recommend an SO post that
is most relevant to a given Java RE in a developer's code. MAESTRO compares the
exception-generating program scenario in the developer's code with that
discussed in an SO post and returns the post with the closest match. To extract
and compare the exception scenario effectively, MAESTRO first uses the answer
code snippets in a post to implicate a subset of lines in the post's question
code snippet as responsible for the exception and then compares these lines
with the developer's code in terms of their respective Abstract Program Graph
(APG) representations. The APG is a simplified and abstracted derivative of an
abstract syntax tree, proposed in this work, that allows an effective
comparison of the functionality embodied in the high-level program structure,
while discarding many of the low-level syntactic or semantic differences. We
evaluate MAESTRO on a benchmark of 78 instances of Java REs extracted from the
top 500 Java projects on GitHub and show that MAESTRO can return either a
highly relevant or somewhat relevant SO post corresponding to the exception
instance in 71% of the cases, compared to relevant posts returned in only 8% -
44% instances, by four competitor tools based on state-of-the-art techniques.
We also conduct a user experience study of MAESTRO with 10 Java developers,
where the participants judge MAESTRO reporting a highly relevant or somewhat
relevant post in 80% of the instances. In some cases the post is judged to be
even better than the one manually found by the participant.
","[{'version': 'v1', 'created': 'Mon, 21 Sep 2020 20:55:05 GMT'}]",2020-09-23,"[['Mahajan', 'Sonal', ''], ['Abolhassani', 'Negarsadat', ''], ['Prasad', 'Mukul R.', '']]","['code search', 'static analysis', 'runtime exceptions', 'crowd intelligence']"
11935,1802.02088,Tom Vercauteren,"Jyotirmoy Banerjee, Premal A. Patel, Fred Ushakov, Donald Peebles, Jan
  Deprest, Sebastien Ourselin, David Hawkes, Tom Vercauteren","A Log-Euclidean and Total Variation based Variational Framework for
  Computational Sonography",SPIE Medical Imaging 2018,,10.1117/12.2292501,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a spatial compounding technique and variational framework to
improve 3D ultrasound image quality by compositing multiple ultrasound volumes
acquired from different probe orientations. In the composite volume, instead of
intensity values, we estimate a tensor at every voxel. The resultant tensor
image encapsulates the directional information of the underlying imaging data
and can be used to generate ultrasound volumes from arbitrary, potentially
unseen, probe positions. Extending the work of Hennersperger et al., we
introduce a log-Euclidean framework to ensure that the tensors are
positive-definite, eventually ensuring non-negative images. Additionally, we
regularise the underpinning ill-posed variational problem while preserving edge
information by relying on a total variation penalisation of the tensor field in
the log domain. We present results on in vivo human data to show the efficacy
of the approach.
","[{'version': 'v1', 'created': 'Tue, 6 Feb 2018 17:42:07 GMT'}]",2018-04-04,"[['Banerjee', 'Jyotirmoy', ''], ['Patel', 'Premal A.', ''], ['Ushakov', 'Fred', ''], ['Peebles', 'Donald', ''], ['Deprest', 'Jan', ''], ['Ourselin', 'Sebastien', ''], ['Hawkes', 'David', ''], ['Vercauteren', 'Tom', '']]","['Ultrasound', 'Computational Sonography', 'Image Registration', 'Compounding', 'Compositing', 'TensorImaging', 'Total Variation', 'Inverse Problem']"
11936,2002.07419,Aleksey Fedorov,"M.A. Kudinov, E.O. Kiktenko, A.K. Fedorov","Security analysis of the W-OTS$^+$ signature scheme: Updating security
  bounds","16 pages, 1 figure, 1 table","Mat. Vopr. Kriptogr. 12, 129 (2021)",10.4213/mvk362,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we discuss in detail a flaw in the original security proof of
the W-OTS${^+}$ variant of the Winternitz one-time signature scheme, which is
an important component for various stateless and stateful many-time hash-based
digital signature schemes. We update the security proof for the W-OTS${^+}$
scheme and derive the corresponding security level. Our result is of importance
for the security analysis of hash-based digital signature schemes.
","[{'version': 'v1', 'created': 'Tue, 18 Feb 2020 07:59:59 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Jul 2021 08:27:26 GMT'}]",2021-07-23,"[['Kudinov', 'M. A.', ''], ['Kiktenko', 'E. O.', ''], ['Fedorov', 'A. K.', '']]","['post-quantum cryptography', 'hash-based signatures', 'W-OTS signature']"
11937,2009.02445,Cristiano Politowski,"Cristiano Politowski, Lisandra M. Fontoura, Fabio Petrillo,
  Yann-Ga\""el Gu\'eh\'eneuc","Learning from the past: A process recommendation system for video game
  projects using postmortems experiences",,,10.1016/j.infsof.2018.04.003,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: The video game industry is a billion dollar industry that faces
problems in the way games are developed. One method to address these problems
is using developer aid tools, such as Recommendation Systems. These tools
assist developers by generating recommendations to help them perform their
tasks. Objective: This article describes a systematic approach to recommend
development processes for video game projects, using postmortem knowledge
extraction and a model of the context of the new project, in which
""postmortems"" are articles written by video game developers at the end of
projects, summarizing the experience of their game development team. This
approach aims to provide reflections about development processes used in the
game industry as well as guidance to developers to choose the most adequate
process according to the contexts they're in. Method: Our approach is divided
in three separate phases: in the the first phase, we manually extracted the
processes from the postmortems analysis; in the second one, we created a video
game context and algorithm rules for recommendation; and finally in the third
phase, we evaluated the recommended processes by using quantitative and
qualitative metrics, game developers feedback, and a case study by interviewing
a video game development team. Contributions: This article brings three main
contributions. The first describes a database of developers' experiences
extracted from postmortems in the form of development processes. The second
defines the main attributes that a video game project contain, which it uses to
define the contexts of the project. The third describes and evaluates a
recommendation system for video game projects, which uses the contexts of the
projects to identify similar projects and suggest a set of activities in the
form of a process.
","[{'version': 'v1', 'created': 'Sat, 5 Sep 2020 02:55:37 GMT'}]",2020-09-08,"[['Politowski', 'Cristiano', ''], ['Fontoura', 'Lisandra M.', ''], ['Petrillo', 'Fabio', ''], ['Guéhéneuc', 'Yann-Gaël', '']]","['Software development process', 'Video game development', 'Recommendation system']"
11938,2005.06332,Antonio J. Pe\v{n}a,"Pedro Valero-Lara and Ra\""ul Sirvent and Antonio J. Pe\~na and Jes\'us
  Labarta","MPI+OpenMP Tasking Scalability for Multi-Morphology Simulations of the
  Human Brain",,"P. Valero-Lara, R. Sirvent, A. J. Pe\~na, and J. Labarta.
  ""MPI+OpenMP tasking scalability for multi-morphology simulations of the human
  brain"", Parallel Computing, Elsevier, vol. 84, pp. 50-61, May 2019",10.1016/j.parco.2019.03.006,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The simulation of the behavior of the human brain is one of the most
ambitious challenges today with a non-end of important applications. We can
find many different initiatives in the USA, Europe and Japan which attempt to
achieve such a challenging target. In this work, we focus on the most important
European initiative (the Human Brain Project) and on one of the models
developed in this project. This tool simulates the spikes triggered in a neural
network by computing the voltage capacitance on the neurons' morphology, being
one of the most precise simulators today. In the present work, we have
evaluated the use of MPI+OpenMP tasking on top of this framework. We prove that
this approach is able to achieve a good scaling even when computing a
relatively low workload (number of neurons) per node. One of our targets
consists of achieving not only a highly scalable implementation, but also to
develop a tool with a high degree of abstraction without losing control and
performance by using \emph{MPI+OpenMP} tasking. The main motivation of this
work is the evaluation of this cutting-edge simulation on multi-morphology
neural networks. The simulation of a high number of neurons, which are
completely different among them, is an important challenge. In fact, in the
multi-morphology simulations, we find an important unbalancing between the
nodes, mainly due to the differences in the neurons, which causes an important
under-utilization of the available resources. In this work, the authors present
and evaluate mechanisms to deal with this and reduce the time of this kind of
simulations considerably.
","[{'version': 'v1', 'created': 'Wed, 13 May 2020 14:15:24 GMT'}]",2020-05-14,"[['Valero-Lara', 'Pedro', ''], ['Sirvent', 'Raül', ''], ['Peña', 'Antonio J.', ''], ['Labarta', 'Jesús', '']]","['MPI', 'OpenMP', 'Tasking', 'Simulation', 'Human Brain', 'Human Brain Project']"
11939,2005.13382,Fang Yu Dr.,"Fang Yu, Daowen Qiu, Xiaoming Wang, Qin Li, Lvzhou Li, Jozef Gruska","Security Improvements of Several Basic Quantum Private Query Protocols
  with O(log N) Communication Complexity",,Theoretical Computer Science 807 (2020): 330-340,10.1016/j.tcs.2019.12.008,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  New quantum private database (with N elements) query protocols are presented
and analyzed. Protocols preserve O(logN) communication complexity of known
protocols for the same task, but achieve several significant improvements in
security, especially concerning user privacy. For example, the randomized form
of our protocol has a cheat-sensitive property - it allows the user to detect a
dishonest database with a nonzero probability, while the phase-encoded private
query protocols for the same task do not have such a property. Moreover, when
the database performs the computational basis measurement, a particular
projective measurement which can cause a significant loss of user privacy in
the previous private query protocols with O(logN) communication complexity, at
most half of the user privacy could leak to such a database in our protocol,
while in the QPQ protocol, the entire user privacy could leak out. In addition,
it is proved here that for large N, the user could detect a cheating via the
computational basis measurement, with a probability close to 1/2 using
O(\sqrt{N}) special queries. Finally, it is shown here, for both forms of our
protocol, basic and randomized, how a dishonest database has to act in case it
could not learn user's queries.
","[{'version': 'v1', 'created': 'Wed, 27 May 2020 14:25:38 GMT'}]",2020-06-14,"[['Yu', 'Fang', ''], ['Qiu', 'Daowen', ''], ['Wang', 'Xiaoming', ''], ['Li', 'Qin', ''], ['Li', 'Lvzhou', ''], ['Gruska', 'Jozef', '']]","['Private Database Query Protocol', 'O(log N) CommunicationComplexity', 'Cheat-sensitivity', 'Rhetoric Query', 'Dishonest Database', 'Privacy']"
11940,2007.06372,Roberto Ferrara,"Sencer Derebeyoglu, Christian Deppe, Roberto Ferrara",Performance Analysis of Identification Codes,"v2: 20 pages, 10 figures, updated after journal reviews",,10.3390/e22101067,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we analyse the construction of identification codes.
Identification codes are based on the question ""Is the message I have just
received the one I am interested in?"", as opposed to Shannon's transmission,
where the receiver is interested in not only one, but any message. The
advantage of identification is that it allows rates growing double
exponentially in the blocklength at the cost of not being able to decode every
message, which might be beneficial in certain applications. We focus on a
special identification code construction based on two concatenated Reed-Solomon
codes and have a closer look at its implementation, analyzing the trade-offs of
identification with respect to transmission and the trade-offs introduced by
the computational cost of identification codes.
","[{'version': 'v1', 'created': 'Mon, 13 Jul 2020 13:34:19 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Sep 2020 09:43:17 GMT'}]",2020-10-26,"[['Derebeyoglu', 'Sencer', ''], ['Deppe', 'Christian', ''], ['Ferrara', 'Roberto', '']]","['Identification', 'Coding', 'Construction', 'Reed-Solomon', 'Simulation']"
11941,2209.00721,Gustavo de Carvalho Bertoli,"Gustavo de Carvalho Bertoli, Louren\c{c}o Alves Pereira Junior, Aldri
  Luiz dos Santos, and Osamu Saotome","Generalizing intrusion detection for heterogeneous networks: A
  stacked-unsupervised federated learning approach","Preprint (Under revision), 35 pages. Added repository link, see
  https://github.com/c2dc/fl-unsup-nids",,10.1016/j.cose.2023.103106,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  The constantly evolving digital transformation imposes new requirements on
our society. Aspects relating to reliance on the networking domain and the
difficulty of achieving security by design pose a challenge today. As a result,
data-centric and machine-learning approaches arose as feasible solutions for
securing large networks. Although, in the network security domain, ML-based
solutions face a challenge regarding the capability to generalize between
different contexts. In other words, solutions based on specific network data
usually do not perform satisfactorily on other networks. This paper describes
the stacked-unsupervised federated learning (FL) approach to generalize on a
cross-silo configuration for a flow-based network intrusion detection system
(NIDS). The proposed approach we have examined comprises a deep autoencoder in
conjunction with an energy flow classifier in an ensemble learning task. Our
approach performs better than traditional local learning and naive
cross-evaluation (training in one context and testing on another network data).
Remarkably, the proposed approach demonstrates a sound performance in the case
of non-iid data silos. In conjunction with an informative feature in an
ensemble architecture for unsupervised learning, we advise that the proposed
FL-based NIDS results in a feasible approach for generalization between
heterogeneous networks. To the best of our knowledge, our proposal is the first
successful approach to applying unsupervised FL on the problem of network
intrusion detection generalization using flow-based data.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2022 20:49:56 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Sep 2022 08:20:15 GMT'}, {'version': 'v3', 'created': 'Wed, 2 Nov 2022 09:54:05 GMT'}, {'version': 'v4', 'created': 'Mon, 28 Nov 2022 11:11:08 GMT'}]",2023-01-20,"[['Bertoli', 'Gustavo de Carvalho', ''], ['Junior', 'Lourenço Alves Pereira', ''], ['Santos', 'Aldri Luiz dos', ''], ['Saotome', 'Osamu', '']]","['Network Intrusion Detection', 'Generalization', 'UnsupervisedLearning', 'Federated Learning', 'Network flows']"
11942,2209.10477,Yan Liu,"Yan Liu, Maria Laricheva, Chiyu Zhang, Patrick Boutet, Guanyu Chen,
  Terence Tracey, Giuseppe Carenini, Richard Young","Transition to Adulthood for Young People with Intellectual or
  Developmental Disabilities: Emotion Detection and Topic Modeling",Conference proceedings of 2022 SBP-BRiMS,"In: Thomson, R., Dancy, C., Pyke, A. (eds) SBP-BRiMS 2022. Lecture
  Notes in Computer Science, vol 13558. Springer, Cham (2022)",10.1007/978-3-031-17114-7_21,,cs.CL stat.AP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transition to Adulthood is an essential life stage for many families. The
prior research has shown that young people with intellectual or development
disabil-ities (IDD) have more challenges than their peers. This study is to
explore how to use natural language processing (NLP) methods, especially
unsupervised machine learning, to assist psychologists to analyze emotions and
sentiments and to use topic modeling to identify common issues and challenges
that young people with IDD and their families have. Additionally, the results
were compared to those obtained from young people without IDD who were in
tran-sition to adulthood. The findings showed that NLP methods can be very
useful for psychologists to analyze emotions, conduct cross-case analysis, and
sum-marize key topics from conversational data. Our Python code is available at
https://github.com/mlaricheva/emotion_topic_modeling.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2022 16:23:45 GMT'}]",2022-09-22,"[['Liu', 'Yan', ''], ['Laricheva', 'Maria', ''], ['Zhang', 'Chiyu', ''], ['Boutet', 'Patrick', ''], ['Chen', 'Guanyu', ''], ['Tracey', 'Terence', ''], ['Carenini', 'Giuseppe', ''], ['Young', 'Richard', '']]","['Transition to Adulthood', 'Intellectual or Development Disabilities', 'Emotion Detection', 'Sentiment Analysis', 'Topic Modeling', 'Natural Language Processing']"
11943,1708.01611,Paul Vitanyi,"Paul M.B. Vitanyi (CWI and University of Amsterdam) and Nick Chater
  (Behavioural Science Group, Warwick Business School, University of Warwick,
  Coventry, UK)",Identification of Probabilities,"31 pages LaTeX. arXiv admin note: substantial text overlap with
  arXiv:1311.7385","Journal of Mathematical Psychology 51, 135-163 (2007)",10.1016/j.jmp.2006.10.002,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Within psychology, neuroscience and artificial intelligence, there has been
increasing interest in the proposal that the brain builds probabilistic models
of sensory and linguistic input: that is, to infer a probabilistic model from a
sample. The practical problems of such inference are substantial: the brain has
limited data and restricted computational resources. But there is a more
fundamental question: is the problem of inferring a probabilistic model from a
sample possible even in principle? We explore this question and find some
surprisingly positive and general results. First, for a broad class of
probability distributions characterised by computability restrictions, we
specify a learning algorithm that will almost surely identify a probability
distribution in the limit given a finite i.i.d. sample of sufficient but
unknown length. This is similarly shown to hold for sequences generated by a
broad class of Markov chains, subject to computability assumptions. The
technical tool is the strong law of large numbers. Second, for a large class of
dependent sequences, we specify an algorithm which identifies in the limit a
computable measure for which the sequence is typical, in the sense of
Martin-Lof (there may be more than one such measure). The technical tool is the
theory of Kolmogorov complexity. We analyse the associated predictions in both
cases. We also briefly consider special cases, including language learning, and
wider theoretical implications for psychology.
","[{'version': 'v1', 'created': 'Fri, 4 Aug 2017 16:36:12 GMT'}]",2017-08-08,"[['Vitanyi', 'Paul M. B.', '', 'CWI and University of Amsterdam'], ['Chater', 'Nick', '', 'Behavioural Science Group, Warwick Business School, University of Warwick,\n  Coventry, UK']]","['learning', 'Bayesian brain', 'identification', 'computable probability', 'Markov chain', 'computable']"
11944,2008.07956,Farhan Khawar,"Farhan Khawar, Leonard Kin Man Poon, Nevin Lianwen Zhang",Learning the Structure of Auto-Encoding Recommenders,Proceedings of The Web Conference 2020,,10.1145/3366423.3380135,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autoencoder recommenders have recently shown state-of-the-art performance in
the recommendation task due to their ability to model non-linear item
relationships effectively. However, existing autoencoder recommenders use
fully-connected neural network layers and do not employ structure learning.
This can lead to inefficient training, especially when the data is sparse as
commonly found in collaborative filtering. The aforementioned results in lower
generalization ability and reduced performance. In this paper, we introduce
structure learning for autoencoder recommenders by taking advantage of the
inherent item groups present in the collaborative filtering domain. Due to the
nature of items in general, we know that certain items are more related to each
other than to other items. Based on this, we propose a method that first learns
groups of related items and then uses this information to determine the
connectivity structure of an auto-encoding neural network. This results in a
network that is sparsely connected. This sparse structure can be viewed as a
prior that guides the network training. Empirically we demonstrate that the
proposed structure learning enables the autoencoder to converge to a local
optimum with a much smaller spectral norm and generalization error bound than
the fully-connected network. The resultant sparse network considerably
outperforms the state-of-the-art methods like \textsc{Mult-vae/Mult-dae} on
multiple benchmarked datasets even when the same number of parameters and flops
are used. It also has a better cold-start performance.
","[{'version': 'v1', 'created': 'Tue, 18 Aug 2020 14:37:40 GMT'}]",2020-08-19,"[['Khawar', 'Farhan', ''], ['Poon', 'Leonard Kin Man', ''], ['Zhang', 'Nevin Lianwen', '']]","['Structure Learning', 'Collaborative Filtering', 'Sparse Autoencoder', 'Wide Autoencoder', 'Shallow Networks']"
11945,2209.04257,Nils Meyer,"Nils Meyer, Sergej Ilinzeer, Andrew N. Hrymak, Frank Henning, Luise
  K\""arger","Non-isothermal direct bundle simulation of SMC compression molding with
  a non-Newtonian compressible matrix",,"Journal of Non-Newtonian Fluid Mechanics, Volume 310, December
  2022, 104940",10.1016/j.jnnfm.2022.104940,,cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Compression molding of Sheet Molding Compounds (SMC) is a manufacturing
process in which a stack of discontinuous fiber-reinforced thermoset sheets is
formed in a hot mold. The reorientation of fibers during this molding process
can be either described by macroscale models based on Jeffery's equation or by
direct mesoscale simulations of individual fiber bundles. In complex geometries
and for long fibers, direct bundle simulations outperform the accuracy of
state-of-the-art macroscale approaches in terms of fiber orientation and fiber
volume fraction. However, it remains to be shown that they are able to predict
the necessary compression forces considering non-isothermal, non-Newtonian and
compaction behavior. In this contribution, both approaches are applied to the
elongational flow in a press rheometer and compared to experiments with 23%
glass fiber volume fraction. The results show that both models predict
contributions to the total compression force and orientation reasonably well
for short flow paths. For long flow paths and thick stacks, complex deformation
mechanisms arise and potential origins for deviation between simulations models
and experimental observations are discussed. Furthermore, Jeffery's basic model
is able to predict orientations similar to the high-fidelity mesoscale model.
For planar SMC flow, this basic model appears to be even better suited than the
more advanced orientation models with diffusion terms developed for injection
molding.
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2022 11:32:30 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Oct 2022 10:11:54 GMT'}, {'version': 'v3', 'created': 'Sun, 13 Nov 2022 17:52:36 GMT'}]",2022-11-15,"[['Meyer', 'Nils', ''], ['Ilinzeer', 'Sergej', ''], ['Hrymak', 'Andrew N.', ''], ['Henning', 'Frank', ''], ['Kärger', 'Luise', '']]","['Compression Molding', 'Sheet Molding Compound', 'Discontinuous Fiber Reinforcement']"
11946,1810.02251,Michael Green,"Michael Cerny Green, Gabriella A.B. Barros, Antonios Liapis, Julian
  Togelius",DATA Agent,"8 pages, 4 images, 3 tables",Foundations of Digital Games (FDG) 2018,10.1145/3235765.3235792,,cs.AI cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces DATA Agent, a system which creates murder mystery
adventures from open data. In the game, the player takes on the role of a
detective tasked with finding the culprit of a murder. All characters, places,
and items in DATA Agent games are generated using open data as source content.
The paper discusses the general game design and user interface of DATA Agent,
and provides details on the generative algorithms which transform linked data
into different game objects. Findings from a user study with 30 participants
playing through two games of DATA Agent show that the game is easy and fun to
play, and that the mysteries it generates are straightforward to solve.
","[{'version': 'v1', 'created': 'Fri, 28 Sep 2018 15:36:19 GMT'}]",2018-10-05,"[['Green', 'Michael Cerny', ''], ['Barros', 'Gabriella A. B.', ''], ['Liapis', 'Antonios', ''], ['Togelius', 'Julian', '']]","['Procedural Content Generation', 'Murder Mystery', 'Adventure Games', 'Data Games', 'Open Data', 'Wikipedia']"
11947,2109.13629,Xavier Alejandro Flores Cabezas,"X. A. Flores Cabezas, D. P. Moya Osorio and M. Latva-aho","Weighted Secrecy Coverage Analysis and the Impact of Friendly Jamming
  over UAV-Enabled Networks",,,10.1109/EuCNC/6GSummit51104.2021.9482493,,cs.IT eess.SP math.IT,http://creativecommons.org/licenses/by/4.0/,"  In 5G and beyond networks, Unmanned Aerial Vehicles (UAV) are an attractive
solution to enhance the secrecy of a wireless systems by exploiting their
predominant LOS links and spacial manoeuvrability to introduce a friendly
jamming. In this work, we investigate the impact of two cooperative UAV-based
jammers on the secrecy performance of a ground wireless wiretap channel by
considering secrecy-area related metrics, the jamming coverage and jamming
efficiency. Moreover, we propose a hybrid metric, the so-called Weighted
Secrecy Coverage (WSC) that can be used as a metric for gaining insights on the
optimal deployments of the UAV jammers to provide the best exploration of
jamming signals. For evaluating these metrics, we derive a closed-form
position-based metric, the secrecy improvement, and propose an analogous
computationally simpler metric. Our simulations show that a balanced power
allocation between the two UAVs leads to the best performances, as well as a
symmetrical positioning behind the line of sight between the legitimate
transmitter and receiver. Moreover, there exist an optimal UAV height for the
jammers. Finally, we propose a sub-optimal and simpler problem for the
maximisation of the WSC.
","[{'version': 'v1', 'created': 'Tue, 28 Sep 2021 11:44:41 GMT'}]",2021-09-29,"[['Cabezas', 'X. A. Flores', ''], ['Osorio', 'D. P. Moya', ''], ['Latva-aho', 'M.', '']]","['UAV communications', 'physical layer security', 'UAV']"
11948,1810.03422,Mikael Brudfors,"Mikael Brudfors, Yael Balbastre, Parashkev Nachev, John Ashburner",MRI Super-Resolution using Multi-Channel Total Variation,,"MIUA 2018. Communications in Computer and Information Science, vol
  894",10.1007/978-3-030-00928-1_97,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a generative model for super-resolution in routine
clinical magnetic resonance images (MRI), of arbitrary orientation and
contrast. The model recasts the recovery of high resolution images as an
inverse problem, in which a forward model simulates the slice-select profile of
the MR scanner. The paper introduces a prior based on multi-channel total
variation for MRI super-resolution. Bias-variance trade-off is handled by
estimating hyper-parameters from the low resolution input scans. The model was
validated on a large database of brain images. The validation showed that the
model can improve brain segmentation, that it can recover anatomical
information between images of different MR contrasts, and that it generalises
well to the large variability present in MR images of different subjects. The
implementation is freely available at https://github.com/brudfors/spm_superres
","[{'version': 'v1', 'created': 'Mon, 8 Oct 2018 13:14:28 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Oct 2018 15:08:37 GMT'}, {'version': 'v3', 'created': 'Thu, 11 Oct 2018 09:22:03 GMT'}, {'version': 'v4', 'created': 'Tue, 16 Oct 2018 10:17:10 GMT'}, {'version': 'v5', 'created': 'Thu, 18 Oct 2018 13:44:22 GMT'}, {'version': 'v6', 'created': 'Mon, 9 Sep 2019 16:42:17 GMT'}]",2019-09-10,"[['Brudfors', 'Mikael', ''], ['Balbastre', 'Yael', ''], ['Nachev', 'Parashkev', ''], ['Ashburner', 'John', '']]","['Super-resolution', 'Multi-channel total variation', 'MRI', 'ADMM']"
11949,2211.08116,Rajjat Dadwal,"Rajjat Dadwal, Thorben Funke, Michael N\""usken and Elena Demidova",W-Trace: Robust and Effective Watermarking for GPS Trajectories,"4 pages, 1 figure",,10.1145/3557915.3561474,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rise of data-driven methods for traffic forecasting, accident
prediction, and profiling driving behavior, personal GPS trajectory data has
become an essential asset for businesses and emerging data markets. However, as
personal data, GPS trajectories require protection. Especially by data
breaches, verification of GPS data ownership is a challenging problem.
Watermarking facilitates data ownership verification by encoding provenance
information into the data. GPS trajectory watermarking is particularly
challenging due to the spatio-temporal data properties and easiness of data
modification; as a result, existing methods embed only minimal provenance
information and lack robustness. In this paper, we propose W-Trace - a novel
GPS trajectory watermarking method based on Fourier transformation. We
demonstrate the effectiveness and robustness of W-Trace on two real-world GPS
trajectory datasets.
","[{'version': 'v1', 'created': 'Tue, 15 Nov 2022 13:11:37 GMT'}]",2022-11-16,"[['Dadwal', 'Rajjat', ''], ['Funke', 'Thorben', ''], ['Nüsken', 'Michael', ''], ['Demidova', 'Elena', '']]","['GPS trajectory', 'Watermarking', 'Data provenance', 'Data protection']"
11950,2104.13896,Mustapha Saidallah,"Mustapha Saidallah, Fatimazahra Taki, Abdelbaki El Belrhiti El Alaoui
  and Abdeslam El Fergougui",Classification and comparison of license plates localization algorithms,11 pages,"April 2021, Volume 12",10.5121/sipij.2021.12201,02,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The Intelligent Transportation Systems (ITS) are the subject of a world
economic competition. They are the application of new information and
communication technologies in the transport sector, to make the infrastructures
more efficient, more reliable and more ecological. License Plates Recognition
(LPR) is the key module of these systems, in which the License Plate
Localization (LPL) is the most important stage, because it determines the speed
and robustness of this module. Thus, during this step the algorithm must
process the image and overcome several constraints as climatic and lighting
conditions, sensors and angles variety, LPs no-standardization, and the real
time processing. This paper presents a classification and comparison of License
Plates Localization (LPL) algorithms and describes the advantages,
disadvantages and improvements made by each of them
","[{'version': 'v1', 'created': 'Wed, 28 Apr 2021 17:26:52 GMT'}]",2021-05-12,"[['Saidallah', 'Mustapha', ''], ['Taki', 'Fatimazahra', ''], ['Alaoui', 'Abdelbaki El Belrhiti El', ''], ['Fergougui', 'Abdeslam El', '']]","['License Plate Localization', 'LPL constraints', 'performance', 'real time', 'multi-localization', 'convolutional neural network', 'deep learning.   1']"
11951,1410.7265,Balint Antal,"Balint Antal, Bence Remenyik, Andras Hajdu","An Unsupervised Ensemble-based Markov Random Field Approach to
  Microscope Cell Image Segmentation",,"Proceeingds of the 10th International Conference on Signal
  Processing and Multimedia Applications (SIGMAP 2013), Reykjavik, Iceland,
  2013, pp. 94-99",10.5220/0004612900940099,,cs.CV cs.AI q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose an approach to the unsupervised segmentation of
images using Markov Random Field. The proposed approach is based on the idea of
Bit Plane Slicing. We use the planes as initial labellings for an ensemble of
segmentations. With pixelwise voting, a robust segmentation approach can be
achieved, which we demonstrate on microscope cell images. We tested our
approach on a publicly available database, where it proven to be competitive
with other methods and manual segmentation.
","[{'version': 'v1', 'created': 'Mon, 27 Oct 2014 14:58:28 GMT'}]",2014-10-29,"[['Antal', 'Balint', ''], ['Remenyik', 'Bence', ''], ['Hajdu', 'Andras', '']]","['Cell segmentation', 'Markov Random Fields', 'Bit plane slicing']"
11952,2002.07175,Umut Can Cabuk,"Umut Can Cabuk, Eylul Adiguzel, Enis Karaarslan","A Survey on Feasibility and Suitability of Blockchain Techniques for the
  E-Voting Systems",,"International Journal of Advanced Research in Computer and
  Communication Engineering (IJARCCE), Vol. 7, Issue 3, March 2018",10.17148/IJARCCE.2018.7324,,cs.CR cs.DC,http://creativecommons.org/licenses/by/4.0/,"  In the second decade of the 21st century, blockchain definitely became one of
the most trending computational technologies. This research aims to question
the feasibility and suitability of using blockchain technology within e-voting
systems, regarding both technical and non-technical aspects. In today's world,
although the course of this spreading is considerably slow, several countries
already use means of e-voting due to many social and economic reasons, which we
further investigated. Nevertheless, the number of countries offering various
e-government solutions, apart from e-voting, is significantly high. E-voting
systems, naturally, require much more attention and assurance regarding
potential security and anonymity issues, since voting is one of the few
extremely critical governmental processes. Nevertheless, e-voting is not purely
a governmental service, but many companies and nonprofit organizations would
benefit the cost-efficiency, scalability, remote accessibility, and ease of use
that it provides. Blockchain technology is claimed to be able to address some,
obviously not all, important security concerns, including anonymity,
confidentiality, integrity, and non-repudiation. The analysis results presented
in this article mostly confirm these claims.
","[{'version': 'v1', 'created': 'Tue, 11 Feb 2020 11:19:54 GMT'}]",2020-02-19,"[['Cabuk', 'Umut Can', ''], ['Adiguzel', 'Eylul', ''], ['Karaarslan', 'Enis', '']]","['Blockchain', 'decentralized computing', 'e-democracy', 'electronic elections', 'e-voting']"
11953,2004.09056,Masahiro Oda Dr.,"Masahiro Oda, Holger R. Roth, Takayuki Kitasaka, Kazuhiro Furukawa,
  Ryoji Miyahara, Yoshiki Hirooka, Nassir Navab, Kensaku Mori",Colonoscope tracking method based on shape estimation network,"Accepted paper as an oral presentation at SPIE Medical Imaging 2019,
  San Diego, CA, USA","Proceedings of SPIE Medical Imaging 2019: Image-Guided Procedures,
  Robotic Interventions, and Modeling, Vol.10951, 109510Q",10.1117/12.2512729,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a colonoscope tracking method utilizing a colon shape
estimation method. CT colonography is used as a less-invasive colon diagnosis
method. If colonic polyps or early-stage cancers are found, they are removed in
a colonoscopic examination. In the colonoscopic examination, understanding
where the colonoscope running in the colon is difficult. A colonoscope
navigation system is necessary to reduce overlooking of polyps. We propose a
colonoscope tracking method for navigation systems. Previous colonoscope
tracking methods caused large tracking errors because they do not consider
deformations of the colon during colonoscope insertions. We utilize the shape
estimation network (SEN), which estimates deformed colon shape during
colonoscope insertions. The SEN is a neural network containing long short-term
memory (LSTM) layer. To perform colon shape estimation suitable to the real
clinical situation, we trained the SEN using data obtained during colonoscope
operations of physicians. The proposed tracking method performs mapping of the
colonoscope tip position to a position in the colon using estimation results of
the SEN. We evaluated the proposed method in a phantom study. We confirmed that
tracking errors of the proposed method was enough small to perform navigation
in the ascending, transverse, and descending colons.
","[{'version': 'v1', 'created': 'Mon, 20 Apr 2020 05:10:38 GMT'}]",2020-04-21,"[['Oda', 'Masahiro', ''], ['Roth', 'Holger R.', ''], ['Kitasaka', 'Takayuki', ''], ['Furukawa', 'Kazuhiro', ''], ['Miyahara', 'Ryoji', ''], ['Hirooka', 'Yoshiki', ''], ['Navab', 'Nassir', ''], ['Mori', 'Kensaku', '']]","['Colon', 'colonoscope tracking', 'deformation estimation', 'shape estimation network (SEN)', 'deep learning', 'long short-term memory (LSTM)']"
11954,2104.02581,Uche Onyekpe Dr,"Uche Onyekpe, Vasile Palade, Anuradha Herath, Stratis Kanarachos and
  Michael E. Fitzpatrick","WhONet: Wheel Odometry Neural Network for Vehicular Localisation in
  GNSS-Deprived Environments",,"Engineering Applications of Artificial Intelligence, 2021",10.1016/J.ENGAPPAI.2021.104421,,cs.RO,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this paper, a deep learning approach is proposed to accurately position
wheeled vehicles in Global Navigation Satellite Systems (GNSS) deprived
environments. In the absence of GNSS signals, information on the speed of the
wheels of a vehicle (or other robots alike), recorded from the wheel encoder,
can be used to provide continuous positioning information for the vehicle,
through the integration of the vehicle's linear velocity to displacement.
However, the displacement estimation from the wheel speed measurements are
characterised by uncertainties, which could be manifested as wheel slips or/and
changes to the tyre size or pressure, from wet and muddy road drives or tyres
wearing out. As such, we exploit recent advances in deep learning to propose
the Wheel Odometry neural Network (WhONet) to learn the uncertainties in the
wheel speed measurements needed for correction and accurate positioning. The
performance of the proposed WhONet is first evaluated on several challenging
driving scenarios, such as on roundabouts, sharp cornering, hard-brake and wet
roads (drifts). WhONet's performance is then further and extensively evaluated
on longer-term GNSS outage scenarios of 30s, 60s, 120s and 180s duration,
respectively over a total distance of 493 km. The experimental results obtained
show that the proposed method is able to accurately position the vehicle with
up to 93% reduction in the positioning error of its original counterpart after
any 180s of travel. WhONet's implementation can be found at
https://github.com/onyekpeu/WhONet.
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2021 15:21:20 GMT'}, {'version': 'v2', 'created': 'Sat, 11 Dec 2021 00:27:18 GMT'}]",2021-12-14,"[['Onyekpe', 'Uche', ''], ['Palade', 'Vasile', ''], ['Herath', 'Anuradha', ''], ['Kanarachos', 'Stratis', ''], ['Fitzpatrick', 'Michael E.', '']]","['Wheel odometry', 'Autonomous vehicles', 'Inertial Navigation System', 'Deep learning', 'Machine learning', 'GNSS outage', 'Positioning', 'Neural networks']"
11955,1803.09529,Daniel Graziotin,"Verena K\""afer, Daniel Graziotin, Ivan Bogicevic, Stefan Wagner,
  Jasmin Ramadani",Poster: Communication in Open-Source Projects--End of the E-mail Era?,"2 pages. To appear as a poster in 40th International Conference on
  Software Engineering (ICSE 2018) Companion proceedings",,10.1145/3183440.3194951,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Communication is essential in software engineering. Especially in distributed
open-source teams, communication needs to be supported by channels including
mailing lists, forums, issue trackers, and chat systems. Yet, we do not have a
clear understanding of which communication channels stakeholders in open-source
projects use. In this study, we fill the knowledge gap by investigating a
statistically representative sample of 400 GitHub projects. We discover the
used communication channels by regular expressions on project data. We show
that (1) half of the GitHub projects use observable communication channels; (2)
GitHub Issues, e-mail addresses, and the modern chat system Gitter are the most
common channels; (3) mailing lists are only in place five and have a lower
market share than all modern chat systems combined.
","[{'version': 'v1', 'created': 'Mon, 26 Mar 2018 11:55:42 GMT'}]",2018-03-28,"[['Käfer', 'Verena', ''], ['Graziotin', 'Daniel', ''], ['Bogicevic', 'Ivan', ''], ['Wagner', 'Stefan', ''], ['Ramadani', 'Jasmin', '']]","['communication', 'open-source', 'mining software repositories']"
11956,2010.00883,Carlos Gaete,"Carlos Gaete-Morales, Martin Kittel, Alexander Roth and Wolf-Peter
  Schill","DIETERpy: a Python framework for The Dispatch and Investment Evaluation
  Tool with Endogenous Renewables",,,10.1016/j.softx.2021.100784,,cs.CY physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  DIETER is an open-source power sector model designed to analyze future
settings with very high shares of variable renewable energy sources. It
minimizes overall system costs, including fixed and variable costs of various
generation, flexibility and sector coupling options. Here we introduce DIETERpy
that builds on the existing model version, written in the General Algebraic
Modeling System (GAMS), and enhances it with a Python framework. This combines
the flexibility of Python regarding pre- and post-processing of data with a
straightforward algebraic formulation in GAMS and the use of efficient solvers.
DIETERpy also offers a browser-based graphical user interface. The new
framework is designed to be easily accessible as it enables users to run the
model, alter its configuration, and define numerous scenarios without a deeper
knowledge of GAMS. Code, data, and manuals are available in public repositories
under permissive licenses for transparency and reproducibility.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2020 09:27:33 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Apr 2021 14:18:58 GMT'}]",2021-09-23,"[['Gaete-Morales', 'Carlos', ''], ['Kittel', 'Martin', ''], ['Roth', 'Alexander', ''], ['Schill', 'Wolf-Peter', '']]","['Power sector modeling', 'Open-source modeling', 'GAMS', 'Python', 'Energystorage', 'Flexibility options', 'Sector coupling', 'Renewable energy integration']"
11957,2112.13753,Xiaofeng Pan,"Xiaofeng Pan, Ming Li, Jing Zhang, Keren Yu, Luping Wang, Hong Wen,
  Chengjun Mao and Bo Cao","MetaCVR: Conversion Rate Prediction via Meta Learning in Small-Scale
  Recommendation Scenarios",,,10.1145/3477495.3531733,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Different from large-scale platforms such as Taobao and Amazon, CVR modeling
in small-scale recommendation scenarios is more challenging due to the severe
Data Distribution Fluctuation (DDF) issue. DDF prevents existing CVR models
from being effective since 1) several months of data are needed to train CVR
models sufficiently in small scenarios, leading to considerable distribution
discrepancy between training and online serving; and 2) e-commerce promotions
have significant impacts on small scenarios, leading to distribution
uncertainty of the upcoming time period. In this work, we propose a novel CVR
method named MetaCVR from a perspective of meta learning to address the DDF
issue. Firstly, a base CVR model which consists of a Feature Representation
Network (FRN) and output layers is designed and trained sufficiently with
samples across months. Then we treat time periods with different data
distributions as different occasions and obtain positive and negative
prototypes for each occasion using the corresponding samples and the
pre-trained FRN. Subsequently, a Distance Metric Network (DMN) is devised to
calculate the distance metrics between each sample and all prototypes to
facilitate mitigating the distribution uncertainty. At last, we develop an
Ensemble Prediction Network (EPN) which incorporates the output of FRN and DMN
to make the final CVR prediction. In this stage, we freeze the FRN and train
the DMN and EPN with samples from recent time period, therefore effectively
easing the distribution discrepancy. To the best of our knowledge, this is the
first study of CVR prediction targeting the DDF issue in small-scale
recommendation scenarios. Experimental results on real-world datasets validate
the superiority of our MetaCVR and online A/B test also shows our model
achieves impressive gains of 11.92% on PCVR and 8.64% on GMV.
","[{'version': 'v1', 'created': 'Mon, 27 Dec 2021 16:05:42 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Feb 2022 16:17:40 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Apr 2022 09:39:06 GMT'}, {'version': 'v4', 'created': 'Tue, 12 Apr 2022 05:25:20 GMT'}, {'version': 'v5', 'created': 'Thu, 28 Apr 2022 10:56:26 GMT'}]",2022-04-29,"[['Pan', 'Xiaofeng', ''], ['Li', 'Ming', ''], ['Zhang', 'Jing', ''], ['Yu', 'Keren', ''], ['Wang', 'Luping', ''], ['Wen', 'Hong', ''], ['Mao', 'Chengjun', ''], ['Cao', 'Bo', '']]","['Recommender System', 'Conversion Rate Prediction', 'Meta Learning', 'Occasion']"
11958,2209.02256,Ekaterina Gurina,"Ekaterina Gurina, Nikita Klyuchnikov, Ksenia Antipova, Dmitry Koroteev","Making the black-box brighter: interpreting machine learning algorithm
  for forecasting drilling accidents",,"Journal of Petroleum Science and Engineering, 2022, 111041, ISSN
  0920-4105",10.1016/j.petrol.2022.111041,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We present an approach for interpreting a black-box alarming system for
forecasting accidents and anomalies during the drilling of oil and gas wells.
The interpretation methodology aims to explain the local behavior of the
accident predictive model to drilling engineers. The explanatory model uses
Shapley additive explanations analysis of features, obtained through
Bag-of-features representation of telemetry logs used during the drilling
accident forecasting phase. Validation shows that the explanatory model has 15%
precision at 70% recall, and overcomes the metric values of a random baseline
and multi-head attention neural network. These results justify that the
developed explanatory model is better aligned with explanations of drilling
engineers, than the state-of-the-art method. The joint performance of
explanatory and Bag-of-features models allows drilling engineers to understand
the logic behind the system decisions at the particular moment, pay attention
to highlighted telemetry regions, and correspondingly, increase the trust level
in the accident forecasting alarms.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2022 07:06:16 GMT'}]",2022-09-08,"[['Gurina', 'Ekaterina', ''], ['Klyuchnikov', 'Nikita', ''], ['Antipova', 'Ksenia', ''], ['Koroteev', 'Dmitry', '']]","['interpretability', 'machine learning', 'bag-of-features', 'drilling', 'telemetry']"
11959,2007.15235,Guillermo Arturo Mart\'inez-Mascorro Mr.,"Guillermo A. Mart\'inez-Mascorro, Jos\'e C. Ortiz-Bayliss, Hugo
  Terashima-Mar\'in","Detecting Suspicious Behavior: How to Deal with Visual Similarity
  through Neural Networks",,2020 IEEE ANDESCON,10.1109/ANDESCON50619.2020.9272175,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Suspicious behavior is likely to threaten security, assets, life, or freedom.
This behavior has no particular pattern, which complicates the tasks to detect
it and define it. Even for human observers, it is complex to spot suspicious
behavior in surveillance videos. Some proposals to tackle abnormal and
suspicious behavior-related problems are available in the literature. However,
they usually suffer from high false-positive rates due to different classes
with high visual similarity. The Pre-Crime Behavior method removes information
related to a crime commission to focus on suspicious behavior before the crime
happens. The resulting samples from different types of crime have a high-visual
similarity with normal-behavior samples. To address this problem, we
implemented 3D Convolutional Neural Networks and trained them under different
approaches. Also, we tested different values in the number-of-filter parameter
to optimize computational resources. Finally, the comparison between the
performance using different training approaches shows the best option to
improve the suspicious behavior detection on surveillance videos.
","[{'version': 'v1', 'created': 'Thu, 30 Jul 2020 05:13:52 GMT'}]",2021-02-24,"[['Martínez-Mascorro', 'Guillermo A.', ''], ['Ortiz-Bayliss', 'José C.', ''], ['Terashima-Marín', 'Hugo', '']]","['Suspicious behavior detection', 'Visual similarity', '3D Convolutional Neural Networks', 'Deep Learning']"
11960,1805.01890,Kamran Kowsari,"Kamran Kowsari, Mojtaba Heidarysafa, Donald E. Brown, Kiana Jafari
  Meimandi, Laura E. Barnes",RMDL: Random Multimodel Deep Learning for Classification,Best Paper award ACM ICISDM,,10.1145/3206098.3206111,,cs.LG cs.AI cs.CV cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The continually increasing number of complex datasets each year necessitates
ever improving machine learning methods for robust and accurate categorization
of these data. This paper introduces Random Multimodel Deep Learning (RMDL): a
new ensemble, deep learning approach for classification. Deep learning models
have achieved state-of-the-art results across many domains. RMDL solves the
problem of finding the best deep learning structure and architecture while
simultaneously improving robustness and accuracy through ensembles of deep
learning architectures. RDML can accept as input a variety data to include
text, video, images, and symbolic. This paper describes RMDL and shows test
results for image and text data including MNIST, CIFAR-10, WOS, Reuters, IMDB,
and 20newsgroup. These test results show that RDML produces consistently better
performance than standard methods over a broad range of data types and
classification problems.
","[{'version': 'v1', 'created': 'Thu, 3 May 2018 19:36:43 GMT'}, {'version': 'v2', 'created': 'Thu, 31 May 2018 16:08:33 GMT'}]",2018-06-01,"[['Kowsari', 'Kamran', ''], ['Heidarysafa', 'Mojtaba', ''], ['Brown', 'Donald E.', ''], ['Meimandi', 'Kiana Jafari', ''], ['Barnes', 'Laura E.', '']]","['Data Mining', 'Text Classification', 'Image Classification', 'Deep NeuralNetworks', 'Deep Learning', 'Supervised Learning']"
11961,2003.11079,Wei Ye,"Wei Ye, Dominik Mautz, Christian Boehm, Ambuj Singh, Claudia Plant",Incorporating User's Preference into Attributed Graph Clustering,,,10.1109/TKDE.2020.2976063,,cs.LG cs.HC cs.SI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph clustering has been studied extensively on both plain graphs and
attributed graphs. However, all these methods need to partition the whole graph
to find cluster structures. Sometimes, based on domain knowledge, people may
have information about a specific target region in the graph and only want to
find a single cluster concentrated on this local region. Such a task is called
local clustering. In contrast to global clustering, local clustering aims to
find only one cluster that is concentrating on the given seed vertex (and also
on the designated attributes for attributed graphs). Currently, very few
methods can deal with this kind of task. To this end, we propose two quality
measures for a local cluster: Graph Unimodality (GU) and Attribute Unimodality
(AU). The former measures the homogeneity of the graph structure while the
latter measures the homogeneity of the subspace that is composed of the
designated attributes. We call their linear combination as Compactness.
Further, we propose LOCLU to optimize the Compactness score. The local cluster
detected by LOCLU concentrates on the region of interest, provides efficient
information flow in the graph and exhibits a unimodal data distribution in the
subspace of the designated attributes.
","[{'version': 'v1', 'created': 'Tue, 24 Mar 2020 19:07:22 GMT'}]",2020-03-26,"[['Ye', 'Wei', ''], ['Mautz', 'Dominik', ''], ['Boehm', 'Christian', ''], ['Singh', 'Ambuj', ''], ['Plant', 'Claudia', '']]","['Local clustering', 'user’s preference', 'attributed graphs', 'dip test', 'unimodal', 'NCut', 'power iteration']"
11962,2102.01565,Juan Pedro Dominguez-Morales,"Luis J. Mu\~noz-Molina, Ignacio Cazorla-Pi\~nar, Juan P.
  Dominguez-Morales, Fernando Perez-Pe\~na",Real-time detection of uncalibrated sensors using Neural Networks,,Neural Comput & Applic (2022),10.1007/s00521-021-06865-z,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Nowadays, sensors play a major role in several contexts like science,
industry and daily life which benefit of their use. However, the retrieved
information must be reliable. Anomalies in the behavior of sensors can give
rise to critical consequences such as ruining a scientific project or
jeopardizing the quality of the production in industrial production lines. One
of the more subtle kind of anomalies are uncalibrations. An uncalibration is
said to take place when the sensor is not adjusted or standardized by
calibration according to a ground truth value. In this work, an online
machine-learning based uncalibration detector for temperature, humidity and
pressure sensors was developed. This solution integrates an Artificial Neural
Network as main component which learns from the behavior of the sensors under
calibrated conditions. Then, after trained and deployed, it detects
uncalibrations once they take place. The obtained results show that the
proposed solution is able to detect uncalibrations for deviation values of 0.25
degrees, 1% RH and 1.5 Pa, respectively. This solution can be adapted to
different contexts by means of transfer learning, whose application allows for
the addition of new sensors, the deployment into new environments and the
retraining of the model with minimum amounts of data.
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2021 15:44:39 GMT'}]",2022-01-26,"[['Muñoz-Molina', 'Luis J.', ''], ['Cazorla-Piñar', 'Ignacio', ''], ['Dominguez-Morales', 'Juan P.', ''], ['Perez-Peña', 'Fernando', '']]","['Neural Networks', 'sensors', 'uncalibrations', 'sensor anomalies', 'transfer learning']"
11963,1902.04055,Charles Buehrle,"Sa\'ul A. Blanco, Charles Buehrle, and Akshay Patidar",On the number of pancake stacks requiring four flips to be sorted,"We have finalized for the paper for publication in DMTCS, updated a
  reference to its published version, moved the abstract to its proper
  location, and added a thank you to the referees. The paper has 27 pages, 6
  figures, and 2 tables","Discrete Mathematics & Theoretical Computer Science, Vol. 21 no.
  2, Permutation Patters 2018 (November 4, 2019) dmtcs:5879",10.23638/DMTCS-21-2-5,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using existing classification results for the 7- and 8-cycles in the pancake
graph, we determine the number of permutations that require 4 pancake flips
(prefix reversals) to be sorted. A similar characterization of the 8-cycles in
the burnt pancake graph, due to the authors, is used to derive a formula for
the number of signed permutations requiring 4 (burnt) pancake flips to be
sorted. We furthermore provide an analogous characterization of the 9-cycles in
the burnt pancake graph. Finally we present numerical evidence that polynomial
formulae exist giving the number of signed permutations that require $k$ flips
to be sorted, with $5\leq k\leq9$.
","[{'version': 'v1', 'created': 'Mon, 11 Feb 2019 18:55:46 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Feb 2019 18:21:54 GMT'}, {'version': 'v3', 'created': 'Sun, 4 Aug 2019 04:42:23 GMT'}, {'version': 'v4', 'created': 'Sat, 26 Oct 2019 17:30:55 GMT'}]",2021-02-10,"[['Blanco', 'Saúl A.', ''], ['Buehrle', 'Charles', ''], ['Patidar', 'Akshay', '']]","['Pancake graph', 'burnt Pancake graph', 'Cayley graphs', 'cycle embedding']"
11964,2205.15051,Sotaro Takeshita,"Sotaro Takeshita, Tommaso Green, Niklas Friedrich, Kai Eckert and
  Simone Paolo Ponzetto",X-SCITLDR: Cross-Lingual Extreme Summarization of Scholarly Documents,JCDL2022,,10.1145/3529372.3530938,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  The number of scientific publications nowadays is rapidly increasing, causing
information overload for researchers and making it hard for scholars to keep up
to date with current trends and lines of work. Consequently, recent work on
applying text mining technologies for scholarly publications has investigated
the application of automatic text summarization technologies, including extreme
summarization, for this domain. However, previous work has concentrated only on
monolingual settings, primarily in English. In this paper, we fill this
research gap and present an abstractive cross-lingual summarization dataset for
four different languages in the scholarly domain, which enables us to train and
evaluate models that process English papers and generate summaries in German,
Italian, Chinese and Japanese. We present our new X-SCITLDR dataset for
multilingual summarization and thoroughly benchmark different models based on a
state-of-the-art multilingual pre-trained model, including a two-stage
`summarize and translate' approach and a direct cross-lingual model. We
additionally explore the benefits of intermediate-stage training using English
monolingual summarization and machine translation as intermediate tasks and
analyze performance in zero- and few-shot scenarios.
","[{'version': 'v1', 'created': 'Mon, 30 May 2022 12:31:28 GMT'}]",2022-05-31,"[['Takeshita', 'Sotaro', ''], ['Green', 'Tommaso', ''], ['Friedrich', 'Niklas', ''], ['Eckert', 'Kai', ''], ['Ponzetto', 'Simone Paolo', '']]","['Scholarly document processing', 'Summarization', 'Multilinguality']"
11965,2101.10367,Samantha Robertson,"Samantha Robertson, Tonya Nguyen, Niloufar Salehi","Modeling Assumptions Clash with the Real World: Transparency, Equity,
  and Community Challenges for Student Assignment Algorithms",,"CHI Conference on Human Factors in Computing Systems (CHI '21),
  May 8--13, 2021, Yokohama, Japan",10.1145/3411764.3445748,,cs.HC cs.CY cs.GT,http://creativecommons.org/licenses/by/4.0/,"  Across the United States, a growing number of school districts are turning to
matching algorithms to assign students to public schools. The designers of
these algorithms aimed to promote values such as transparency, equity, and
community in the process. However, school districts have encountered practical
challenges in their deployment. In fact, San Francisco Unified School District
voted to stop using and completely redesign their student assignment algorithm
because it was not promoting educational equity in practice. We analyze this
system using a Value Sensitive Design approach and find that one reason values
are not met in practice is that the system relies on modeling assumptions about
families' priorities, constraints, and goals that clash with the real world.
These assumptions overlook the complex barriers to ideal participation that
many families face, particularly because of socioeconomic inequalities. We
argue that direct, ongoing engagement with stakeholders is central to aligning
algorithmic values with real world conditions. In doing so we must broaden how
we evaluate algorithms while recognizing the limitations of purely algorithmic
solutions in addressing complex socio-political problems.
","[{'version': 'v1', 'created': 'Mon, 25 Jan 2021 19:29:39 GMT'}]",2021-01-27,"[['Robertson', 'Samantha', ''], ['Nguyen', 'Tonya', ''], ['Salehi', 'Niloufar', '']]","['student assignment', 'mechanism design', 'value sensitive design']"
11966,2008.09982,Liangwei Li,"Liangwei Li, Liucheng Sun, Chenwei Weng, Chengfu Huo, Weijun Ren","Spending Money Wisely: Online Electronic Coupon Allocation based on
  Real-Time User Intent Detection",,,10.1145/3340531.3412745,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online electronic coupon (e-coupon) is becoming a primary tool for e-commerce
platforms to attract users to place orders. E-coupons are the digital
equivalent of traditional paper coupons which provide customers with discounts
or gifts. One of the fundamental problems related is how to deliver e-coupons
with minimal cost while users' willingness to place an order is maximized. We
call this problem the coupon allocation problem. This is a non-trivial problem
since the number of regular users on a mature e-platform often reaches hundreds
of millions and the types of e-coupons to be allocated are often multiple. The
policy space is extremely large and the online allocation has to satisfy a
budget constraint. Besides, one can never observe the responses of one user
under different policies which increases the uncertainty of the policy making
process. Previous work fails to deal with these challenges. In this paper, we
decompose the coupon allocation task into two subtasks: the user intent
detection task and the allocation task. Accordingly, we propose a two-stage
solution: at the first stage (detection stage), we put forward a novel
Instantaneous Intent Detection Network (IIDN) which takes the user-coupon
features as input and predicts user real-time intents; at the second stage
(allocation stage), we model the allocation problem as a Multiple-Choice
Knapsack Problem (MCKP) and provide a computational efficient allocation method
using the intents predicted at the detection stage. We conduct extensive online
and offline experiments and the results show the superiority of our proposed
framework, which has brought great profits to the platform and continues to
function online.
","[{'version': 'v1', 'created': 'Sun, 23 Aug 2020 07:19:25 GMT'}]",2020-08-25,"[['Li', 'Liangwei', ''], ['Sun', 'Liucheng', ''], ['Weng', 'Chenwei', ''], ['Huo', 'Chengfu', ''], ['Ren', 'Weijun', '']]","['E-commerce', 'Electronic Coupon Allocation', 'Real-Time Intent Detection', 'Multiple-Choice Knapsack Problem']"
11967,1910.10264,Andrew Lensen,"Andrew Lensen, Bing Xue, Mengjie Zhang","Genetic Programming for Evolving Similarity Functions for Clustering:
  Representations and Analysis","29 pages, accepted by Evolutionary Computation (Journal), MIT Press",,10.1162/evco_a_00264,,cs.NE cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering is a difficult and widely-studied data mining task, with many
varieties of clustering algorithms proposed in the literature. Nearly all
algorithms use a similarity measure such as a distance metric (e.g. Euclidean
distance) to decide which instances to assign to the same cluster. These
similarity measures are generally pre-defined and cannot be easily tailored to
the properties of a particular dataset, which leads to limitations in the
quality and the interpretability of the clusters produced. In this paper, we
propose a new approach to automatically evolving similarity functions for a
given clustering algorithm by using genetic programming. We introduce a new
genetic programming-based method which automatically selects a small subset of
features (feature selection) and then combines them using a variety of
functions (feature construction) to produce dynamic and flexible similarity
functions that are specifically designed for a given dataset. We demonstrate
how the evolved similarity functions can be used to perform clustering using a
graph-based representation. The results of a variety of experiments across a
range of large, high-dimensional datasets show that the proposed approach can
achieve higher and more consistent performance than the benchmark methods. We
further extend the proposed approach to automatically produce multiple
complementary similarity functions by using a multi-tree approach, which gives
further performance improvements. We also analyse the interpretability and
structure of the automatically evolved similarity functions to provide insight
into how and why they are superior to standard distance metrics.
","[{'version': 'v1', 'created': 'Tue, 22 Oct 2019 22:45:19 GMT'}]",2019-10-24,"[['Lensen', 'Andrew', ''], ['Xue', 'Bing', ''], ['Zhang', 'Mengjie', '']]","['Cluster analysis', 'automatic clustering', 'genetic programming', 'similarity function', 'feature selection', 'feature construction']"
11968,2209.14046,Xintian Wu,"Xintian Wu, Hanbin Zhao, Liangli Zheng, Shouhong Ding, Xi Li","Adma-GAN: Attribute-Driven Memory Augmented GANs for Text-to-Image
  Generation",,,10.1145/3503161.3547821,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As a challenging task, text-to-image generation aims to generate
photo-realistic and semantically consistent images according to the given text
descriptions. Existing methods mainly extract the text information from only
one sentence to represent an image and the text representation effects the
quality of the generated image well. However, directly utilizing the limited
information in one sentence misses some key attribute descriptions, which are
the crucial factors to describe an image accurately. To alleviate the above
problem, we propose an effective text representation method with the
complements of attribute information. Firstly, we construct an attribute memory
to jointly control the text-to-image generation with sentence input. Secondly,
we explore two update mechanisms, sample-aware and sample-joint mechanisms, to
dynamically optimize a generalized attribute memory. Furthermore, we design an
attribute-sentence-joint conditional generator learning scheme to align the
feature embeddings among multiple representations, which promotes the
cross-modal network training. Experimental results illustrate that the proposed
method obtains substantial performance improvements on both the CUB (FID from
14.81 to 8.57) and COCO (FID from 21.42 to 12.39) datasets.
","[{'version': 'v1', 'created': 'Wed, 28 Sep 2022 12:28:54 GMT'}]",2022-09-29,"[['Wu', 'Xintian', ''], ['Zhao', 'Hanbin', ''], ['Zheng', 'Liangli', ''], ['Ding', 'Shouhong', ''], ['Li', 'Xi', '']]","['text-to-image generation', 'attribute memory', 'sample-aware', 'samplejoint', 'cross-modal alignment']"
11969,2209.08853,"Patrick St\""ockle","Patrick St\""ockle, Theresa Wasserer, Bernd Grobauer, Alexander
  Pretschner","Automated Identification of Security-Relevant Configuration Settings
  Using NLP","Peer-reviewed version accepted for publication in the Industry
  Showcase track at the 37th IEEE/ACM International Conference on Automated
  Software Engineering (ASE '22), October 10--14, 2022, Rochester, MI, USA",,10.1145/3551349.3559499,,cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To secure computer infrastructure, we need to configure all security-relevant
settings. We need security experts to identify security-relevant settings, but
this process is time-consuming and expensive. Our proposed solution uses
state-of-the-art natural language processing to classify settings as
security-relevant based on their description. Our evaluation shows that our
trained classifiers do not perform well enough to replace the human security
experts but can help them classify the settings. By publishing our labeled data
sets and the code of our trained model, we want to help security experts
analyze configuration settings and enable further research in this area.
","[{'version': 'v1', 'created': 'Mon, 19 Sep 2022 08:55:05 GMT'}]",2022-09-20,"[['Stöckle', 'Patrick', ''], ['Wasserer', 'Theresa', ''], ['Grobauer', 'Bernd', ''], ['Pretschner', 'Alexander', '']]","['Hardening', 'Security Configuration', 'Natural Language Processing']"
11970,1803.10200,Fabio Niephaus,"Fabio Niephaus (Hasso Plattner Institute, University of Potsdam,
  Germany, Germany), Tim Felgentreff (Hasso Plattner Institute, University of
  Potsdam, Germany, Oracle Labs Potsdam, Germany, Germany), Tobias Pape (Hasso
  Plattner Institute, University of Potsdam, Germany, Germany), Robert
  Hirschfeld (Hasso Plattner Institute, University of Potsdam, Germany,
  Germany), Marcel Taeumel (Hasso Plattner Institute, University of Potsdam,
  Germany, Germany)",Live Multi-language Development and Runtime Environments,,"The Art, Science, and Engineering of Programming, 2018, Vol. 2,
  Issue 3, Article 8",10.22152/programming-journal.org/2018/2/8,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Software development tools should work and behave consistently
across different programming languages, so that developers do not have to
familiarize themselves with new tooling for new languages. Also, being able to
combine multiple programming languages in a program increases reusability, as
developers do not have to recreate software frameworks and libraries in the
language they develop in and can reuse existing software instead.
  Inquiry: However, developers often have a broad choice of tools, some of
which are designed for only one specific programming language. Various
Integrated Development Environments have support for multiple languages, but
are usually unable to provide a consistent programming experience due to
different language-specific runtime features. With regard to language
integrations, common mechanisms usually use abstraction layers, such as the
operating system or a network connection, which are often boundaries for tools
and hence negatively affect the programming experience.
  Approach: In this paper, we present a novel approach for tool reuse that aims
to improve the experience with regard to working with multiple high-level
dynamic, object-oriented programming languages. As part of this, we build a
multi-language virtual execution environment and reuse Smalltalk's live
programming tools for other languages.
  Knowledge: An important part of our approach is to retrofit and align runtime
capabilities for different languages as it is a requirement for providing
consistent tools. Furthermore, it provides convenient means to reuse and even
mix software libraries and frameworks written in different languages without
breaking tool support.
  Grounding: The prototype system Squimera is an implementation of our approach
and demonstrates that it is possible to reuse both development tools from a
live programming system to improve the development experience as well as
software artifacts from different languages to increase productivity.
  Importance: In the domain of polyglot programming systems, most research has
focused on the integration of different languages and corresponding performance
optimizations. Our work, on the other hand, focuses on tooling and the overall
programming experience.
","[{'version': 'v1', 'created': 'Tue, 27 Mar 2018 17:37:01 GMT'}]",2018-03-28,"[['Niephaus', 'Fabio', '', 'Hasso Plattner Institute, University of Potsdam,\n  Germany, Germany'], ['Felgentreff', 'Tim', '', 'Hasso Plattner Institute, University of\n  Potsdam, Germany, Oracle Labs Potsdam, Germany, Germany'], ['Pape', 'Tobias', '', 'Hasso\n  Plattner Institute, University of Potsdam, Germany, Germany'], ['Hirschfeld', 'Robert', '', 'Hasso Plattner Institute, University of Potsdam, Germany,\n  Germany'], ['Taeumel', 'Marcel', '', 'Hasso Plattner Institute, University of Potsdam,\n  Germany, Germany']]","['Programming experience', 'Integrated development environments', 'Polyglot execution']"
11971,1906.04272,Sulaf Elshaar,Sulaf Elshaar and Samira Sadaoui,Building High-Quality Auction Fraud Dataset,10 pages,"Computer and Information Science; Vol. 12, No. 4; 2019 ISSN
  1913-8989 E-ISSN 1913-8997 Published by Canadian Center of Science and
  Education",10.5539/cis.v12n4p1,,cs.LG cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Given the magnitude of online auction transactions, it is difficult to
safeguard consumers from dishonest sellers, such as shill bidders. To date, the
application of Machine Learning Techniques (MLTs) to auction fraud has been
limited, unlike their applications for combatting other types of fraud. Shill
Bidding (SB) is a severe auction fraud, which is driven by modern-day
technologies and clever scammers. The difficulty of identifying the behavior of
sophisticated fraudsters and the unavailability of training datasets hinder the
research on SB detection. In this study, we developed a high-quality SB
dataset. To do so, first, we crawled and preprocessed a large number of
commercial auctions and bidders' history as well. We thoroughly preprocessed
both datasets to make them usable for the computation of the SB metrics.
Nevertheless, this operation requires a deep understanding of the behavior of
auctions and bidders. Second, we introduced two new SB pattern s and
implemented other existing SB patterns. Finally, we removed outliers to improve
the quality of training SB data.
","[{'version': 'v1', 'created': 'Mon, 10 Jun 2019 21:03:30 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Jun 2019 22:54:32 GMT'}, {'version': 'v3', 'created': 'Fri, 23 Aug 2019 08:39:17 GMT'}]",2019-08-26,"[['Elshaar', 'Sulaf', ''], ['Sadaoui', 'Samira', '']]","['auction fraud', 'fraud detection', 'shill bidding', 'bidder history', 'outlier detection']"
11972,2012.02865,Seham Ebrahim,Seham Muawadh Ali Ebrahim,Hybrid Chaotic Method for Medical Images Ciphering,,"International Journal of Network Security & Its Applications
  (IJNSA) Vol.12, No.6, November 2020",10.5121/ijnsa.2020.12601,,cs.CR cs.NI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Healthcare is an essential application of e-services, where for diagnostic
testing, medical imaging acquiring, processing, analysis, storage, and
protection are used. Image ciphering during storage and transmission over the
networks used has seen implemented using many types of ciphering algorithms for
security purpose. Current cyphering algorithms are classified into two types:
traditional classical cryptography using standard algorithms (DES, AES, IDEA,
RC5, RSA, ...) and chaos cryptography using continuous (Chau, Rossler, Lorenz,
...) or discreet (Logistics, Henon, ...) algorithms. The traditional algorithms
have struggled to combat image data as compared to regular textual data.
Whereas, the chaotic algorithms are more efficient for image ciphering. The
Significance characteristics of chaos are its extreme sensitivity to initial
conditions and algorithm parameters. In this paper, medical image security
based on hybrid/mixed chaotic algorithms is proposed. The proposed method is
implemented using MATLAB. Where the image of the Retina of the Eye to detect
Blood Vessels is ciphered. The Pseudo-Random Numbers Generators (PRNGs) from
the different chaotic algorithms are implemented, and their statistical
properties are evaluated using the National Institute of Standards and
Technology NIST and other statistical test-suits. Then, these algorithms are
used to secure the data, where the statistical properties of the cipher-text
are also tested. We propose two PRNGs to increase the complexity of the PRNGs
and to allow many of the NIST statistical tests to be passed: one based on
two-hybrid mixed chaotic logistic maps and one based on two-hybrid mixed
chaotic Henon maps, where each chaotic algorithm runs side-by-side and starts
with random initial conditions and parameters (encryption keys). The resulting
hybrid PRNGs passed many of the NIST statistical test suits.
","[{'version': 'v1', 'created': 'Fri, 4 Dec 2020 21:52:21 GMT'}]",2020-12-08,"[['Ebrahim', 'Seham Muawadh Ali', '']]","['Images Security', 'Encryption', 'chaotic algorithms', 'Matlab simulation', 'NIST statistical tests.  1']"
11973,2204.11914,Jinfeng Lin,"Yalin Liu, Jinfeng Lin, Oghenemaro Anuyah, Ronald Metoyer, Jane
  Cleland-Huang",Generating and Visualizing Trace Link Explanations,,,10.1145/3510003.3510129,,cs.SE cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Recent breakthroughs in deep-learning (DL) approaches have resulted in the
dynamic generation of trace links that are far more accurate than was
previously possible. However, DL-generated links lack clear explanations, and
therefore non-experts in the domain can find it difficult to understand the
underlying semantics of the link, making it hard for them to evaluate the
link's correctness or suitability for a specific software engineering task. In
this paper we present a novel NLP pipeline for generating and visualizing trace
link explanations. Our approach identifies domain-specific concepts, retrieves
a corpus of concept-related sentences, mines concept definitions and usage
examples, and identifies relations between cross-artifact concepts in order to
explain the links. It applies a post-processing step to prioritize the most
likely acronyms and definitions and to eliminate non-relevant ones. We evaluate
our approach using project artifacts from three different domains of
interstellar telescopes, positive train control, and electronic health-care
systems, and then report coverage, correctness, and potential utility of the
generated definitions. We design and utilize an explanation interface which
leverages concept definitions and relations to visualize and explain trace link
rationales, and we report results from a user study that was conducted to
evaluate the effectiveness of the explanation interface. Results show that the
explanations presented in the interface helped non-experts to understand the
underlying semantics of a trace link and improved their ability to vet the
correctness of the link.
","[{'version': 'v1', 'created': 'Mon, 25 Apr 2022 18:37:59 GMT'}]",2022-04-27,"[['Liu', 'Yalin', ''], ['Lin', 'Jinfeng', ''], ['Anuyah', 'Oghenemaro', ''], ['Metoyer', 'Ronald', ''], ['Cleland-Huang', 'Jane', '']]","['Software traceability', 'explanation interface', 'concept mining']"
11974,2112.01624,Byunghyun Ban,Byunghyun Ban,A Survey on Awesome Korean NLP Datasets,"11 pages, 1 horizontal page for large table","2022 13th International Conference on Information and
  Communication Technology Convergence (ICTC)",10.1109/ICTC55196.2022.9952930,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  English based datasets are commonly available from Kaggle, GitHub, or
recently published papers. Although benchmark tests with English datasets are
sufficient to show off the performances of new models and methods, still a
researcher need to train and validate the models on Korean based datasets to
produce a technology or product, suitable for Korean processing. This paper
introduces 15 popular Korean based NLP datasets with summarized details such as
volume, license, repositories, and other research results inspired by the
datasets. Also, I provide high-resolution instructions with sample or
statistics of datasets. The main characteristics of datasets are presented on a
single table to provide a rapid summarization of datasets for researchers.
","[{'version': 'v1', 'created': 'Sun, 17 Oct 2021 03:24:05 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Dec 2021 07:56:15 GMT'}]",2022-11-29,"[['Ban', 'Byunghyun', '']]","['natural language', 'NLP', 'Korean', 'dataset']"
11975,2101.09709,Juan Pedro Dominguez-Morales,"Pablo Lopez-Osorio, Alberto Patino-Saucedo, Juan P. Dominguez-Morales,
  Horacio Rostro-Gonzalez, Fernando Perez-Pe\~na","Neuromorphic adaptive spiking CPG towards bio-inspired locomotion of
  legged robots","23 pages, 12 figures",,10.1016/j.neucom.2022.06.085,,cs.NE cs.AI cs.RO,http://creativecommons.org/licenses/by/4.0/,"  In recent years, locomotion mechanisms exhibited by vertebrate animals have
been the inspiration for the improvement in the performance of robotic systems.
These mechanisms include the adaptability of their locomotion to any change
registered in the environment through their biological sensors. In this regard,
we aim to replicate such kind of adaptability in legged robots through a
Spiking Central Pattern Generator. This Spiking Central Pattern Generator
generates different locomotion (rhythmic) patterns which are driven by an
external stimulus, that is, the output of a Force Sensitive Resistor connected
to the robot to provide feedback. The Spiking Central Pattern Generator
consists of a network of five populations of Leaky Integrate-and-Fire neurons
designed with a specific topology in such a way that the rhythmic patterns can
be generated and driven by the aforementioned external stimulus. Therefore, the
locomotion of the end robotic platform (any-legged robot) can be adapted to the
terrain by using any sensor as input. The Spiking Central Pattern Generator
with adaptive learning has been numerically validated at software and hardware
level, using the Brian 2 simulator and the SpiNNaker neuromorphic platform for
the latest. In particular, our experiments clearly show an adaptation in the
oscillation frequencies between the spikes produced in the populations of the
Spiking Central Pattern Generator while the input stimulus varies. To validate
the robustness and adaptability of the Spiking Central Pattern Generator, we
have performed several tests by variating the output of the sensor. These
experiments were carried out in Brian 2 and SpiNNaker; both implementations
showed a similar behavior with a Pearson correlation coefficient of 0.905.
","[{'version': 'v1', 'created': 'Sun, 24 Jan 2021 12:44:38 GMT'}]",2022-07-04,"[['Lopez-Osorio', 'Pablo', ''], ['Patino-Saucedo', 'Alberto', ''], ['Dominguez-Morales', 'Juan P.', ''], ['Rostro-Gonzalez', 'Horacio', ''], ['Perez-Peña', 'Fernando', '']]","['Neurorobotics', 'SpiNNaker', 'Central Pattern Generator', 'SpikingNeural Network', 'Neuromorphic Hardware', 'Adaptive-learning']"
11976,2202.11245,Tianxiang Zhao,"Tianxiang Zhao, Xiang Zhang, Suhang Wang",Exploring Edge Disentanglement for Node Classification,Accepted to The Web Conference (WWW) 2022,,10.1145/3485447.3511929,,cs.SI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Edges in real-world graphs are typically formed by a variety of factors and
carry diverse relation semantics. For example, connections in a social network
could indicate friendship, being colleagues, or living in the same
neighborhood. However, these latent factors are usually concealed behind mere
edge existence due to the data collection and graph formation processes.
Despite rapid developments in graph learning over these years, most models take
a holistic approach and treat all edges as equal. One major difficulty in
disentangling edges is the lack of explicit supervisions. In this work, with
close examination of edge patterns, we propose three heuristics and design
three corresponding pretext tasks to guide the automatic edge disentanglement.
Concretely, these self-supervision tasks are enforced on a designed edge
disentanglement module to be trained jointly with the downstream node
classification task to encourage automatic edge disentanglement. Channels of
the disentanglement module are expected to capture distinguishable relations
and neighborhood interactions, and outputs from them are aggregated as node
representations. The proposed DisGNN is easy to be incorporated with various
neural architectures, and we conduct experiments on $6$ real-world datasets.
Empirical results show that it can achieve significant performance gains.
","[{'version': 'v1', 'created': 'Wed, 23 Feb 2022 00:31:37 GMT'}]",2022-02-24,"[['Zhao', 'Tianxiang', ''], ['Zhang', 'Xiang', ''], ['Wang', 'Suhang', '']]","['graph neural networks', 'graph disentanglement', 'node classification']"
11977,2008.12360,Connor Heaton,"Connor T. Heaton, David M. Schwartz",Language Models as Emotional Classifiers for Textual Conversations,,,10.1145/3394171.3413755,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Emotions play a critical role in our everyday lives by altering how we
perceive, process and respond to our environment. Affective computing aims to
instill in computers the ability to detect and act on the emotions of human
actors. A core aspect of any affective computing system is the classification
of a user's emotion. In this study we present a novel methodology for
classifying emotion in a conversation. At the backbone of our proposed
methodology is a pre-trained Language Model (LM), which is supplemented by a
Graph Convolutional Network (GCN) that propagates information over the
predicate-argument structure identified in an utterance. We apply our proposed
methodology on the IEMOCAP and Friends data sets, achieving state-of-the-art
performance on the former and a higher accuracy on certain emotional labels on
the latter. Furthermore, we examine the role context plays in our methodology
by altering how much of the preceding conversation the model has access to when
making a classification.
","[{'version': 'v1', 'created': 'Thu, 27 Aug 2020 20:04:30 GMT'}]",2020-08-31,"[['Heaton', 'Connor T.', ''], ['Schwartz', 'David M.', '']]","['Affective computing', 'Natural Language Processing', 'Language modeling']"
11978,2104.04616,Milijana Surbatovich,"Milijana Surbatovich, Limin Jia, Brandon Lucia","Automatically Enforcing Fresh and Consistent Inputs in Intermittent
  Systems","Updates for camera-ready, add DOI",,10.1145/3453483.3454081,,cs.PL,http://creativecommons.org/licenses/by-sa/4.0/,"  Intermittently powered energy-harvesting devices enable new applications in
inaccessible environments. Program executions must be robust to unpredictable
power failures, introducing new challenges in programmability and correctness.
One hard problem is that input operations have implicit constraints, embedded
in the behavior of continuously powered executions, on when input values can be
collected and used. This paper aims to develop a formal framework for enforcing
these constraints. We identify two key properties -- freshness (i.e., uses of
inputs must satisfy the same time constraints as in continuous executions) and
temporal consistency (i.e., the collection of a set of inputs must satisfy the
same time constraints as in continuous executions). We formalize these
properties and show that they can be enforced using atomic regions. We develop
Ocelot, an LLVM-based analysis and transformation tool targeting Rust, to
enforce these properties automatically. Ocelot provides the programmer with
annotations to express these constraints and infers atomic region placement in
a program to satisfy them. We then formalize Ocelot's design and show that
Ocelot generates correct programs with little performance cost or code changes.
","[{'version': 'v1', 'created': 'Fri, 9 Apr 2021 21:39:52 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Jun 2021 23:01:28 GMT'}]",2021-06-22,"[['Surbatovich', 'Milijana', ''], ['Jia', 'Limin', ''], ['Lucia', 'Brandon', '']]","['intermittent computing', 'energy harvesting', 'timeliness']"
11979,1904.09538,James Stevens,"James D. Stevens, Andreas Kl\""ockner","A mechanism for balancing accuracy and scope in cross-machine black-box
  GPU performance modeling","25 pages, 9 figures","The International Journal of High Performance Computing
  Applications, June 2020",10.1177/1094342020921340,,cs.PF cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ability to model, analyze, and predict execution time of computations is
an important building block supporting numerous efforts, such as load
balancing, performance optimization, and automated performance tuning for high
performance, parallel applications. In today's increasingly heterogeneous
computing environment, this task must be accomplished efficiently across
multiple architectures, including massively parallel coprocessors like GPUs. To
address this challenge, we present an approach for constructing customizable,
cross-machine performance models for GPU kernels, including a mechanism to
automatically and symbolically gather performance-relevant kernel operation
counts, a tool for formulating mathematical models using these counts, and a
customizable parameterized collection of benchmark kernels used to calibrate
models to GPUs in a black-box fashion. Our approach empowers a user to manage
trade-offs between model accuracy, evaluation speed, and generalizability. A
user can define a model and customize the calibration process, making it as
simple or complex as desired, and as application-targeted or general as
desired. To evaluate our approach, we demonstrate both linear and nonlinear
models; each example models execution times for multiple variants of a
particular computation: two matrix multiplication variants, four Discontinuous
Galerkin (DG) differentiation operation variants, and two 2-D five-point finite
difference stencil variants. For each variant, we present accuracy results on
GPUs from multiple vendors and hardware generations. We view this customizable
approach as a response to a central question in GPU performance modeling: how
can we model GPU performance in a cost-explanatory fashion while maintaining
accuracy, evaluation speed, portability, and ease of use, an attribute we
believe precludes manual collection of kernel or hardware statistics.
","[{'version': 'v1', 'created': 'Sun, 21 Apr 2019 03:50:20 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Nov 2019 20:57:09 GMT'}, {'version': 'v3', 'created': 'Fri, 19 Jun 2020 15:46:53 GMT'}]",2020-06-22,"[['Stevens', 'James D.', ''], ['Klöckner', 'Andreas', '']]","['Performance model', 'GPU', 'Microbenchmark', 'Code generation', 'Black box', 'OpenCL']"
11980,2211.00057,Petar Radanliev,"Petar Radanliev, David De Roure","New and emerging forms of data and technologies: literature and
  bibliometric review",Multimed Tools Appl (2022),,10.1007/s11042-022-13451-5,,cs.CY cs.MM,http://creativecommons.org/licenses/by/4.0/,"  With the increased digitalisation of our society, new and emerging forms of
data present new values and opportunities for improved data driven multimedia
services, or even new solutions for managing future global pandemics (i.e.,
Disease X). The results are somewhat unexpected. Despite the special
relationship between the US and the UK, there is not much evidence of
collaboration in research on this topic. Similarly, despite the negative media
publicity on the current relationship between the US and China (and the US
sanctions on China), the research on this topic seems to be growing strong.
However, it would be interesting to repeat this exercise after a few years and
compare the results. It is possible that the effect of the current US sanctions
on China has not taken its full effect yet.
","[{'version': 'v1', 'created': 'Sun, 16 Oct 2022 09:46:22 GMT'}]",2022-11-02,"[['Radanliev', 'Petar', ''], ['De Roure', 'David', '']]","['New and emerging forms of data', 'Literature review', 'Bibliometric review', 'Spatiotemporal data', 'Time-stamped data', 'Open data', 'Real-time data']"
11981,1801.09116,Dong Wang,"Dong Wang, Boleslaw K. Szymanski, Tarek Abdelzaher, Heng Ji, Lance
  Kaplan",The Age of Social Sensing,"8 pages, 3 figures, Accepted to IEEE Computer","IEEE Computer, 52(1):36-45, Jan. 2019",10.1109/MC.2018.2890173,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online social media, such as Twitter and Instagram, democratized information
broadcast, allowing anyone to share information about themselves and their
surroundings at an unprecedented scale. The large volume of information thus
posted on these media offer a new lens into the physical world through the eyes
of the social network. The exploitation of this lens to inspect aspects of
world state has recently been termed social sensing. The power of manipulating
reality via the use (or intentional misuse) of social media opened concerns
with issues ranging from radicalization by terror propaganda to potential
manipulation of elections in mature democracies. Many important challenges and
open research questions arise in this emerging field that aims to better
understand how information can be extracted from the medium and what properties
characterize the extracted information and the world it represents. Addressing
the above challenges requires multi-disciplinary research at the intersection
of computer science and social sciences that combines cyber-physical computing,
sociology, sensor networks, social networks, cognition, data mining, estimation
theory, data fusion, information theory, linguistics, machine learning,
behavioral economics, and possibly others. This paper surveys important
directions in social sensing, identifies current research challenges, and
outlines avenues for future research.
","[{'version': 'v1', 'created': 'Sat, 27 Jan 2018 17:46:40 GMT'}]",2019-12-02,"[['Wang', 'Dong', ''], ['Szymanski', 'Boleslaw K.', ''], ['Abdelzaher', 'Tarek', ''], ['Ji', 'Heng', ''], ['Kaplan', 'Lance', '']]","['Linguistic Processing', 'Sensor Networks', 'Social Networking']"
11982,1809.05011,Maarten Schoukens,Maarten Schoukens and Roland T\'oth,"Linear Parameter Varying Representation of a class of MIMO Nonlinear
  Systems",,,10.1016/j.ifacol.2018.11.162,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linear parameter-varying (LPV) models form a powerful model class to analyze
and control a (nonlinear) system of interest. Identifying an LPV model of a
nonlinear system can be challenging due to the difficulty of selecting the
scheduling variable(s) a priori, especially if a first principles based
understanding of the system is unavailable. Converting a nonlinear model to an
LPV form is also non-trivial and requires systematic methods to automate the
process.
  Inspired by these challenges, a systematic LPV embedding approach starting
from multiple-input multiple-output (MIMO) linear fractional representations
with a nonlinear feedback block (NLFR) is proposed. This NLFR model class is
embedded into the LPV model class by an automated factorization of the
(possibly MIMO) static nonlinear block present in the model. As a result of the
factorization, an LPV-LFR or an LPV state-space model with affine dependency on
the scheduling is obtained. This approach facilitates the selection of the
scheduling variable and the connected mapping of system variables. Such a
conversion method enables to use nonlinear identification tools to estimate LPV
models.
  The potential of the proposed approach is illustrated on a 2-DOF nonlinear
mass-spring-damper example.
","[{'version': 'v1', 'created': 'Thu, 13 Sep 2018 15:18:03 GMT'}]",2020-05-11,"[['Schoukens', 'Maarten', ''], ['Tóth', 'Roland', '']]","['Nonlinear Systems', 'Linear-Parameter Varying Systems', 'System Identification', 'LPVEmbedding', 'Linear Fractional Representation', 'MIMO']"
11983,1910.13195,Shiori Hironaka,Shiori Hironaka and Mitsuo Yoshida and Kyoji Umemura,User's Centrality Analysis for Home Location Estimation,published at ABCSS 2019 on WI 2019,,10.1145/3358695.3360930,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  User attributes, such as home location, are useful for many applications.
Many researchers have been tackling how to estimate users' home locations using
relationships among users. It is known that the home locations of certain
users, such as celebrities, are hard to estimate using relationships. However,
because estimating the home locations of all celebrities is not actually hard,
it is important to clarify the characteristics of users whose home locations
are hard to estimate. We analyze whether centralities, which represent users'
characteristics, and the tendency to have the same home locations as friends
are related. The results indicate that PageRank and HITS scores are related to
whether users have the same home location as friends, and that users with
higher HITS scores have the same home location as their friends less often.
This result indicates that there are two types of users whose home locations
are difficult to estimate: hub users who follow many celebrities and authority
users who are celebrities.
","[{'version': 'v1', 'created': 'Tue, 29 Oct 2019 11:06:14 GMT'}]",2019-10-30,"[['Hironaka', 'Shiori', ''], ['Yoshida', 'Mitsuo', ''], ['Umemura', 'Kyoji', '']]","['Home location estimation', 'Centrality', 'PageRank', 'HITS algorithm']"
11984,2005.06580,Junade Ali,Junade Ali and Vladimir Dyo,Practical Hash-based Anonymity for MAC Addresses,"Accepted at the 17th International Conference on Security and
  Cryptography (SECRYPT 2020). To be presented between 8-10 July 2020",,10.5220/0009825105720579,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given that a MAC address can uniquely identify a person or a vehicle,
continuous tracking over a large geographical scale has raised serious privacy
concerns amongst governments and the general public. Prior work has
demonstrated that simple hash-based approaches to anonymization can be easily
inverted due to the small search space of MAC addresses. In particular, it is
possible to represent the entire allocated MAC address space in 39 bits and
that frequency-based attacks allow for 50% of MAC addresses to be enumerated in
31 bits. We present a practical approach to MAC address anonymization using
both computationally expensive hash functions and truncating the resulting
hashes to allow for k-anonymity. We provide an expression for computing the
percentage of expected collisions, demonstrating that for digests of 24 bits it
is possible to store up to 168,617 MAC addresses with the rate of collisions
less than 1%. We experimentally demonstrate that a rate of collision of 1% or
less can be achieved by storing data sets of 100 MAC addresses in 13 bits,
1,000 MAC addresses in 17 bits and 10,000 MAC addresses in 20 bits.
","[{'version': 'v1', 'created': 'Wed, 13 May 2020 20:48:57 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Jun 2020 19:20:32 GMT'}]",2020-07-30,"[['Ali', 'Junade', ''], ['Dyo', 'Vladimir', '']]","['Intelligent Transportation Systems', 'Privacy', 'Tracking', 'Anonymization', 'k-Anonymity']"
11985,1806.06151,Mahawaga Arachchige Pathum Chamikara,"M.A.P. Chamikara, P. Bertok, D. Liu, S. Camtepe, I. Khalil","Efficient Data Perturbation for Privacy Preserving and Accurate Data
  Stream Mining",Pervasive and Mobile Computing 2018,,10.1016/j.pmcj.2018.05.003,,cs.DB,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The widespread use of the Internet of Things (IoT) has raised many concerns,
including the protection of private information. Existing privacy preservation
methods cannot provide a good balance between data utility and privacy, and
also have problems with efficiency and scalability. This paper proposes an
efficient data stream perturbation method (named as $P^2RoCAl$). $P^2RoCAl$
offers better data utility than similar methods: classification accuracies of
$P^2RoCAl$ perturbed data streams are very close to those of the original data
streams. $P^2RoCAl$ also provides higher resilience against data reconstruction
attacks.
","[{'version': 'v1', 'created': 'Fri, 15 Jun 2018 23:51:52 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Jun 2018 09:59:49 GMT'}]",2018-06-20,"[['Chamikara', 'M. A. P.', ''], ['Bertok', 'P.', ''], ['Liu', 'D.', ''], ['Camtepe', 'S.', ''], ['Khalil', 'I.', '']]","['Privacy', 'privacy preserving data mining', 'data streams', 'Internet of Things (IoT)', 'Web of']"
11986,1801.08110,Roberto J. L\'opez-Sastre,"Daniel O\~noro-Rubio and Roberto J. L\'opez-Sastre and Carolina
  Redondo-Cabrera and Pedro Gil-Jim\'enez","The challenge of simultaneous object detection and pose estimation: a
  comparative study",,"Image and Vision Computing, 2018",10.1016/j.imavis.2018.09.013,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detecting objects and estimating their pose remains as one of the major
challenges of the computer vision research community. There exists a compromise
between localizing the objects and estimating their viewpoints. The detector
ideally needs to be view-invariant, while the pose estimation process should be
able to generalize towards the category-level. This work is an exploration of
using deep learning models for solving both problems simultaneously. For doing
so, we propose three novel deep learning architectures, which are able to
perform a joint detection and pose estimation, where we gradually decouple the
two tasks. We also investigate whether the pose estimation problem should be
solved as a classification or regression problem, being this still an open
question in the computer vision community. We detail a comparative analysis of
all our solutions and the methods that currently define the state of the art
for this problem. We use PASCAL3D+ and ObjectNet3D datasets to present the
thorough experimental evaluation and main results. With the proposed models we
achieve the state-of-the-art performance in both datasets.
","[{'version': 'v1', 'created': 'Wed, 24 Jan 2018 18:21:38 GMT'}]",2018-10-08,"[['Oñoro-Rubio', 'Daniel', ''], ['López-Sastre', 'Roberto J.', ''], ['Redondo-Cabrera', 'Carolina', ''], ['Gil-Jiménez', 'Pedro', '']]","['Pose estimation', 'viewpoint estimation', 'object detection', 'deep learning', 'convolutional neural network']"
11987,1912.12673,Steven McElwee,Steven McElwee and James Cannady,Cyber Situation Awareness with Active Learning for Intrusion Detection,"McElwee, S. & Cannady, J. (2019). Cyber situation awareness with
  active learning for intrusion detection. SoutheastCon 2019. IEEE. Pre-print",IEEE SoutheastCon (2019) 1-7,10.1109/SoutheastCon42311.2019.9020599,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intrusion detection has focused primarily on detecting cyberattacks at the
event-level. Since there is such a large volume of network data and attacks are
minimal, machine learning approaches have focused on improving accuracy and
reducing false positives, but this has frequently resulted in overfitting. In
addition, the volume of intrusion detection alerts is large and creates fatigue
in the human analyst who must review them. This research addresses the problems
associated with event-level intrusion detection and the large volumes of
intrusion alerts by applying active learning and cyber situation awareness.
This paper includes the results of two experiments using the UNSW-NB15 dataset.
The first experiment evaluated sampling approaches for querying the oracle, as
part of active learning. It then trained a Random Forest classifier using the
samples and evaluated its results. The second experiment applied cyber
situation awareness by aggregating the detection results of the first
experiment and calculating the probability that a computer system was part of a
cyberattack. This research showed that moving the perspective of event-level
alerts to the probability that a computer system was part of an attack improved
the accuracy of detection and reduced the volume of alerts that a human analyst
would need to review.
","[{'version': 'v1', 'created': 'Sun, 29 Dec 2019 15:25:22 GMT'}]",2020-04-14,"[['McElwee', 'Steven', ''], ['Cannady', 'James', '']]","['intrusion detection', 'active learning', 'cyber situation']"
11988,1401.7494,Johannes Hofmann,"Johannes Hofmann, Jan Treibig, Georg Hager, Gerhard Wellein","Comparing the Performance of Different x86 SIMD Instruction Sets for a
  Medical Imaging Application on Modern Multi- and Manycore Chips",arXiv admin note: text overlap with arXiv:1401.3615,,10.1145/2568058.2568068,,cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Single Instruction, Multiple Data (SIMD) vectorization is a major driver of
performance in current architectures, and is mandatory for achieving good
performance with codes that are limited by instruction throughput. We
investigate the efficiency of different SIMD-vectorized implementations of the
RabbitCT benchmark. RabbitCT performs 3D image reconstruction by back
projection, a vital operation in computed tomography applications. The
underlying algorithm is a challenge for vectorization because it consists,
apart from a streaming part, also of a bilinear interpolation requiring
scattered access to image data. We analyze the performance of SSE (128 bit),
AVX (256 bit), AVX2 (256 bit), and IMCI (512 bit) implementations on recent
Intel x86 systems. A special emphasis is put on the vector gather
implementation on Intel Haswell and Knights Corner microarchitectures. Finally
we discuss why GPU implementations perform much better for this specific
algorithm.
","[{'version': 'v1', 'created': 'Wed, 29 Jan 2014 12:41:44 GMT'}]",2014-01-30,"[['Hofmann', 'Johannes', ''], ['Treibig', 'Jan', ''], ['Hager', 'Georg', ''], ['Wellein', 'Gerhard', '']]","['SIMD', 'Intel MIC', 'gather', 'computed tomography', 'backprojection', 'performance']"
11989,2109.02058,Linhao Luo,"Linhao Luo, Yixiang Fang, Xin Cao, Xiaofeng Zhang, Wenjie Zhang","Detecting Communities from Heterogeneous Graphs: A Context Path-based
  Graph Neural Network Model","11 pages, 8 figures, accepted by CIKM2021",,10.1145/3459637.3482250,,cs.SI cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Community detection, aiming to group the graph nodes into clusters with dense
inner-connection, is a fundamental graph mining task. Recently, it has been
studied on the heterogeneous graph, which contains multiple types of nodes and
edges, posing great challenges for modeling the high-order relationship between
nodes. With the surge of graph embedding mechanism, it has also been adopted to
community detection. A remarkable group of works use the meta-path to capture
the high-order relationship between nodes and embed them into nodes' embedding
to facilitate community detection. However, defining meaningful meta-paths
requires much domain knowledge, which largely limits their applications,
especially on schema-rich heterogeneous graphs like knowledge graphs. To
alleviate this issue, in this paper, we propose to exploit the context path to
capture the high-order relationship between nodes, and build a Context
Path-based Graph Neural Network (CP-GNN) model. It recursively embeds the
high-order relationship between nodes into the node embedding with attention
mechanisms to discriminate the importance of different relationships. By
maximizing the expectation of the co-occurrence of nodes connected by context
paths, the model can learn the nodes' embeddings that both well preserve the
high-order relationship between nodes and are helpful for community detection.
Extensive experimental results on four real-world datasets show that CP-GNN
outperforms the state-of-the-art community detection methods.
","[{'version': 'v1', 'created': 'Sun, 5 Sep 2021 12:28:00 GMT'}]",2021-09-07,"[['Luo', 'Linhao', ''], ['Fang', 'Yixiang', ''], ['Cao', 'Xin', ''], ['Zhang', 'Xiaofeng', ''], ['Zhang', 'Wenjie', '']]","['Community Detection', 'Heterogeneous Graphs', 'Context Path', 'GraphNeural Network', 'Unsupervised Learning']"
11990,1401.2688,Kiran Sree Pokkuluri Prof,"Pokkuluri Kiran Sree, Inamupudi Ramesh Babu, SSSN Usha Devi N","PSMACA: An Automated Protein Structure Prediction Using MACA (Multiple
  Attractor Cellular Automata)","6 pages. arXiv admin note: substantial text overlap with
  arXiv:1310.4342, arXiv:1310.4495","Journal of Bioinformatics and Intelligent Control Vol 2, pp
  211--215, 2013",10.1166/jbic.2013.1052,,cs.CE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Protein Structure Predication from sequences of amino acid has gained a
remarkable attention in recent years. Even though there are some prediction
techniques addressing this problem, the approximate accuracy in predicting the
protein structure is closely 75%. An automated procedure was evolved with MACA
(Multiple Attractor Cellular Automata) for predicting the structure of the
protein. Most of the existing approaches are sequential which will classify the
input into four major classes and these are designed for similar sequences.
PSMACA is designed to identify ten classes from the sequences that share
twilight zone similarity and identity with the training sequences. This method
also predicts three states (helix, strand, and coil) for the structure. Our
comprehensive design considers 10 feature selection methods and 4 classifiers
to develop MACA (Multiple Attractor Cellular Automata) based classifiers that
are build for each of the ten classes. We have tested the proposed classifier
with twilight-zone and 1-high-similarity benchmark datasets with over three
dozens of modern competing predictors shows that PSMACA provides the best
overall accuracy that ranges between 77% and 88.7% depending on the dataset.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2014 00:38:52 GMT'}]",2014-01-14,"[['Sree', 'Pokkuluri Kiran', ''], ['Babu', 'Inamupudi Ramesh', ''], ['N', 'SSSN Usha Devi', '']]","['Protein Structure', 'Cellular Automata', 'MACA']"
11991,2108.06136,Teresa Gomez-Diaz,"Teresa Gomez-Diaz, Tomas Recio",On the evaluation of research software: the CDUR procedure,,"F1000Research 2019, 8:1353",10.12688/f1000research.19994.2,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Background: Evaluation of the quality of research software is a challenging
and relevant issue, still not sufficiently addressed by the scientific
community.
  Methods: Our contribution begins by defining, precisely but widely enough,
the notions of research software and of its authors followed by a study of the
evaluation issues, as the basis for the proposition of a sound assessment
protocol: the CDUR procedure.
  Results: CDUR comprises four steps introduced as follows: Citation, to deal
with correct RS identification, Dissemination, to measure good dissemination
practices, Use, devoted to the evaluation of usability aspects, and Research,
to assess the impact of the scientific work.
  Conclusions: Some conclusions and recommendations are finally included. The
evaluation of research is the keystone to boost the evolution of the Open
Science policies and practices. It is as well our belief that research software
evaluation is a fundamental step to induce better research software practices
and, thus, a step towards more efficient science.
","[{'version': 'v1', 'created': 'Fri, 13 Aug 2021 09:17:13 GMT'}]",2021-08-24,"[['Gomez-Diaz', 'Teresa', ''], ['Recio', 'Tomas', '']]","['Scientific Software', 'Research Software', 'Research Software Citation', 'Research Software Evaluation', 'Open Science', 'Research evaluation']"
11992,2012.08662,Mohammad Zaki Zadeh,"Mohammad Zaki Zadeh, Ashwin Ramesh Babu, Ashish Jaiswal, Maria
  Kyrarini, Morris Bell, Fillia Makedon","Automated system to measure Tandem Gait to assess executive functions in
  children",,,10.1145/3453892.3453999,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As mobile technologies have become ubiquitous in recent years, computer-based
cognitive tests have become more popular and efficient. In this work, we focus
on assessing motor function in children by analyzing their gait movements.
Although there has been a lot of research on designing automated assessment
systems for gait analysis, most of these efforts use obtrusive wearable sensors
for measuring body movements. We have devised a computer vision-based
assessment system that only requires a camera which makes it easier to employ
in school or home environments. A dataset has been created with 27 children
performing the test. Furthermore in order to improve the accuracy of the
system, a deep learning based model was pre-trained on NTU-RGB+D 120 dataset
and then it was fine-tuned on our gait dataset. The results highlight the
efficacy of proposed work for automating the assessment of children's
performances by achieving 76.61% classification accuracy.
","[{'version': 'v1', 'created': 'Tue, 15 Dec 2020 23:12:13 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Dec 2020 18:40:25 GMT'}]",2021-07-08,"[['Zadeh', 'Mohammad Zaki', ''], ['Babu', 'Ashwin Ramesh', ''], ['Jaiswal', 'Ashish', ''], ['Kyrarini', 'Maria', ''], ['Bell', 'Morris', ''], ['Makedon', 'Fillia', '']]","['tandem gait', 'cognitive assessment', 'computer vision', 'deep learning']"
11993,2009.12269,Ehsan Doostmohammadi,"Ehsan Doostmohammadi, Mohammad Hadi Bokaei, Hossein Sameti",PerKey: A Persian News Corpus for Keyphrase Extraction and Generation,,,10.1109/ISTEL.2018.8661095,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Keyphrases provide an extremely dense summary of a text. Such information can
be used in many Natural Language Processing tasks, such as information
retrieval and text summarization. Since previous studies on Persian keyword or
keyphrase extraction have not published their data, the field suffers from the
lack of a human extracted keyphrase dataset. In this paper, we introduce
PerKey, a corpus of 553k news articles from six Persian news websites and
agencies with relatively high quality author extracted keyphrases, which is
then filtered and cleaned to achieve higher quality keyphrases. The resulted
data was put into human assessment to ensure the quality of the keyphrases. We
also measured the performance of different supervised and unsupervised
techniques, e.g. TFIDF, MultipartiteRank, KEA, etc. on the dataset using
precision, recall, and F1-score.
","[{'version': 'v1', 'created': 'Fri, 25 Sep 2020 14:36:41 GMT'}]",2020-09-28,"[['Doostmohammadi', 'Ehsan', ''], ['Bokaei', 'Mohammad Hadi', ''], ['Sameti', 'Hossein', '']]","['Keyphrase Extraction', 'Keyword Extraction', 'Persian news corpus', 'supervised Keyphrase Extraction', 'unsupervisedKeyphrase Extraction']"
11994,2006.09205,Andrew Dowsey,"William Andrew, Jing Gao, Siobhan Mullan, Neill Campbell, Andrew W
  Dowsey, Tilo Burghardt","Visual Identification of Individual Holstein-Friesian Cattle via Deep
  Metric Learning","41 pages, 18 figures, 2 tables; Submitted to Computers and
  Electronics in Agriculture ; Source code and network weights available at
  https://github.com/CWOA/MetricLearningIdentification ; OpenCows2020 dataset
  available at https://doi.org/10.5523/bris.10m32xl88x2b61zlkkgz3fml17","Computers and Electronics in Agriculture 185, 106133 (2021)",10.1016/j.compag.2021.106133,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Holstein-Friesian cattle exhibit individually-characteristic black and white
coat patterns visually akin to those arising from Turing's reaction-diffusion
systems. This work takes advantage of these natural markings in order to
automate visual detection and biometric identification of individual
Holstein-Friesians via convolutional neural networks and deep metric learning
techniques. Existing approaches rely on markings, tags or wearables with a
variety of maintenance requirements, whereas we present a totally hands-off
method for the automated detection, localisation, and identification of
individual animals from overhead imaging in an open herd setting, i.e. where
new additions to the herd are identified without re-training. We propose the
use of SoftMax-based reciprocal triplet loss to address the identification
problem and evaluate the techniques in detail against fixed herd paradigms. We
find that deep metric learning systems show strong performance even when many
cattle unseen during system training are to be identified and re-identified --
achieving 93.8% accuracy when trained on just half of the population. This work
paves the way for facilitating the non-intrusive monitoring of cattle
applicable to precision farming and surveillance for automated productivity,
health and welfare monitoring, and to veterinary research such as behavioural
analysis, disease outbreak tracing, and more. Key parts of the source code,
network weights and datasets are available publicly.
","[{'version': 'v1', 'created': 'Tue, 16 Jun 2020 14:41:55 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Jul 2020 11:38:09 GMT'}, {'version': 'v3', 'created': 'Wed, 14 Oct 2020 10:58:30 GMT'}]",2021-05-04,"[['Andrew', 'William', ''], ['Gao', 'Jing', ''], ['Mullan', 'Siobhan', ''], ['Campbell', 'Neill', ''], ['Dowsey', 'Andrew W', ''], ['Burghardt', 'Tilo', '']]","['Automated Agriculture', 'Computer Vision', 'Deep Learning', 'Metric']"
11995,2207.04560,Nodari Vakhania,"Frank Hernandez, Ernesto Parra, Jose Maria Sigarreta, Nodari Vakhania",A polynomial-time approximation to a minimum dominating set in a graph,,Theoretical Computer Science 930 (2022) 142-156,10.1016/j.tcs.2022.07.020,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A {\em dominating set} of a graph $G=(V,E)$ is a subset of vertices
$S\subseteq V$ such that every vertex $v\in V\setminus S$ has at least one
neighbor in $S$. Finding a dominating set with the minimum cardinality in a
connected graph $G=(V,E)$ is known to be NP-hard. A polynomial-time
approximation algorithm for this problem, described here, works in two stages.
At the first stage a dominant set is generated by a greedy algorithm, and at
the second stage this dominating set is purified (reduced). The reduction is
achieved by the analysis of the flowchart of the algorithm of the first stage
and a special kind of clustering of the dominating set generated at the first
stage. The clustering of the dominating set naturally leads to a special kind
of a spanning forest of graph $G$, which serves as a basis for the second
purification stage. We expose some types of graphs for which the algorithm of
the first stage already delivers an optimal solution and derive sufficient
conditions when the overall algorithm constructs an optimal solution. We give
three alternative approximation ratios for the algorithm of the first stage,
two of which are expressed in terms of solely invariant problem instance
parameters, and we also give one additional approximation ratio for the overall
two-stage algorithm. The greedy algorithm of the first stage turned out to be
essentially the same as the earlier known state-of-the-art algorithms for the
set cover and dominating set problem Chv\'atal \cite{chvatal} and Parekh
\cite{parekh}. The second purification stage results in a significant reduction
of the dominant set created at the first stage, in practice. The practical
behavior of both stages was verified for randomly generated problem instances.
The computational experiments emphasize the gap between a solution of Stage 1
and a solution of Stage 2.
","[{'version': 'v1', 'created': 'Sun, 10 Jul 2022 22:43:05 GMT'}]",2022-11-23,"[['Hernandez', 'Frank', ''], ['Parra', 'Ernesto', ''], ['Sigarreta', 'Jose Maria', ''], ['Vakhania', 'Nodari', '']]","['graph', 'dominating set', 'approximation ratio', 'approximation algorithm', 'time complexity']"
11996,2208.10205,Sukwon Yun,"Sukwon Yun, Kibum Kim, Kanghoon Yoon, Chanyoung Park",LTE4G: Long-Tail Experts for Graph Neural Networks,"Accepted by CIKM 2022, the code is available at
  https://github.com/SukwonYun/LTE4G",,10.1145/3511808.3557381,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing Graph Neural Networks (GNNs) usually assume a balanced situation
where both the class distribution and the node degree distribution are
balanced. However, in real-world situations, we often encounter cases where a
few classes (i.e., head class) dominate other classes (i.e., tail class) as
well as in the node degree perspective, and thus naively applying existing GNNs
eventually fall short of generalizing to the tail cases. Although recent
studies proposed methods to handle long-tail situations on graphs, they only
focus on either the class long-tailedness or the degree long-tailedness. In
this paper, we propose a novel framework for training GNNs, called Long-Tail
Experts for Graphs (LTE4G), which jointly considers the class long-tailedness,
and the degree long-tailedness for node classification. The core idea is to
assign an expert GNN model to each subset of nodes that are split in a balanced
manner considering both the class and degree long-tailedness. After having
trained an expert for each balanced subset, we adopt knowledge distillation to
obtain two class-wise students, i.e., Head class student and Tail class
student, each of which is responsible for classifying nodes in the head classes
and tail classes, respectively. We demonstrate that LTE4G outperforms a wide
range of state-of-the-art methods in node classification evaluated on both
manual and natural imbalanced graphs. The source code of LTE4G can be found at
https://github.com/SukwonYun/LTE4G.
","[{'version': 'v1', 'created': 'Mon, 22 Aug 2022 11:03:36 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Sep 2022 05:59:46 GMT'}]",2022-09-09,"[['Yun', 'Sukwon', ''], ['Kim', 'Kibum', ''], ['Yoon', 'Kanghoon', ''], ['Park', 'Chanyoung', '']]","['Graph Neural Networks', 'Long Tail Problem', 'Imbalance Learning']"
11997,1810.00722,Daniel Ziener,"Thorbj\""orn Posewsky and Daniel Ziener",Throughput Optimizations for FPGA-based Deep Neural Network Inference,,Microprocessors and Microsystems 60C (2018) pp. 151-161,10.1016/j.micpro.2018.04.004,,cs.DC cs.AR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Deep neural networks are an extremely successful and widely used technique
for various pattern recognition and machine learning tasks. Due to power and
resource constraints, these computationally intensive networks are difficult to
implement in embedded systems. Yet, the number of applications that can benefit
from the mentioned possibilities is rapidly rising. In this paper, we propose
novel architectures for the inference of previously learned and arbitrary deep
neural networks on FPGA-based SoCs that are able to overcome these limitations.
Our key contributions include the reuse of previously transferred weight
matrices across multiple input samples, which we refer to as batch processing,
and the usage of compressed weight matrices, also known as pruning. An
extensive evaluation of these optimizations is presented. Both techniques allow
a significant mitigation of data transfers and speed-up the network inference
by one order of magnitude. At the same time, we surpass the data throughput of
fully-featured x86-based systems while only using a fraction of their energy
consumption.
","[{'version': 'v1', 'created': 'Fri, 28 Sep 2018 17:08:22 GMT'}]",2018-10-02,"[['Posewsky', 'Thorbjörn', ''], ['Ziener', 'Daniel', '']]","['Deep Neural Networks', 'Batch processing', 'Pruning', 'Compression', 'FPGA', 'Inference', 'Throughput Optimizations', 'fully-connected']"
11998,1907.01642,Moritz Schubotz,"Moritz Schubotz and Philipp Scharpf and Kaushal Dudhat and Yash Nagar
  and Felix Hamborg and Bela Gipp",Introducing MathQA -- A Math-Aware Question Answering System,"Proceedings of the ACM/IEEE-CS Joint Conference on Digital Libraries
  (JCDL), Workshop on Knowledge Discovery (2018)",,10.1108/IDD-06-2018-0022,,cs.IR cs.CL cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an open source math-aware Question Answering System based on Ask
Platypus. Our system returns as a single mathematical formula for a natural
language question in English or Hindi. This formulae originate from the
knowledge-base Wikidata. We translate these formulae to computable data by
integrating the calculation engine sympy into our system. This way, users can
enter numeric values for the variables occurring in the formula. Moreover, the
system loads numeric values for constants occurring in the formula from
Wikidata. In a user study, our system outperformed a commercial computational
mathematical knowledge engine by 13%. However, the performance of our system
heavily depends on the size and quality of the formula data available in
Wikidata. Since only a few items in Wikidata contained formulae when we started
the project, we facilitated the import process by suggesting formula edits to
Wikidata editors. With the simple heuristic that the first formula is
significant for the article, 80% of the suggestions were correct.
","[{'version': 'v1', 'created': 'Fri, 28 Jun 2019 08:27:53 GMT'}]",2019-07-04,"[['Schubotz', 'Moritz', ''], ['Scharpf', 'Philipp', ''], ['Dudhat', 'Kaushal', ''], ['Nagar', 'Yash', ''], ['Hamborg', 'Felix', ''], ['Gipp', 'Bela', '']]","['Mathematical Information Retrieval (MIR)', 'Question AnsweringSystems (QA)', 'Wikidata']"
11999,2103.05362,Jonathan Kelly,"Filip Mari\'c, Luka Petrovi\'c, Marko Guberina, Jonathan Kelly, Ivan
  Petrovi\'c","A Riemannian Metric for Geometry-Aware Singularity Avoidance by
  Articulated Robots","12 pages, 12 figures","Robotics and Autonomous Systems, Vol. 145, pp. 103865, Nov. 2021",10.1016/j.robot.2021.103865,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Articulated robots such as manipulators increasingly must operate in
uncertain and dynamic environments where interaction (with human coworkers, for
example) is necessary. In these situations, the capacity to quickly adapt to
unexpected changes in operational space constraints is essential. At certain
points in a manipulator's configuration space, termed singularities, the robot
loses one or more degrees of freedom (DoF) and is unable to move in specific
operational space directions. The inability to move in arbitrary directions in
operational space compromises adaptivity and, potentially, safety. We introduce
a geometry-aware singularity index, defined using a Riemannian metric on the
manifold of symmetric positive definite matrices, to provide a measure of
proximity to singular configurations. We demonstrate that our index avoids some
of the failure modes and difficulties inherent to other common indices.
Further, we show that this index can be differentiated easily, making it
compatible with local optimization approaches used for operational space
control. Our experimental results establish that, for reaching and path
following tasks, optimization based on our index outperforms a common
manipulability maximization technique and ensures singularity-robust motions.
","[{'version': 'v1', 'created': 'Tue, 9 Mar 2021 11:20:57 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Aug 2021 15:03:49 GMT'}, {'version': 'v3', 'created': 'Wed, 25 Aug 2021 11:57:58 GMT'}, {'version': 'v4', 'created': 'Tue, 12 Jul 2022 18:16:17 GMT'}]",2022-07-14,"[['Marić', 'Filip', ''], ['Petrović', 'Luka', ''], ['Guberina', 'Marko', ''], ['Kelly', 'Jonathan', ''], ['Petrović', 'Ivan', '']]","['manipulation', 'manipulability ellipsoid', 'kinematics', 'differential geometry']"
12000,2102.01760,Luciana Ferrer,"Luciana Ferrer, Mitchell McLaren, Niko Brummer",A Speaker Verification Backend with Robust Performance across Conditions,,"Computer Speech and Language, Volume 71, 2021",10.1016/j.csl.2021.101258,,cs.SD cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we address the problem of speaker verification in conditions
unseen or unknown during development. A standard method for speaker
verification consists of extracting speaker embeddings with a deep neural
network and processing them through a backend composed of probabilistic linear
discriminant analysis (PLDA) and global logistic regression score calibration.
This method is known to result in systems that work poorly on conditions
different from those used to train the calibration model. We propose to modify
the standard backend, introducing an adaptive calibrator that uses duration and
other automatically extracted side-information to adapt to the conditions of
the inputs. The backend is trained discriminatively to optimize binary
cross-entropy. When trained on a number of diverse datasets that are labeled
only with respect to speaker, the proposed backend consistently and, in some
cases, dramatically improves calibration, compared to the standard PLDA
approach, on a number of held-out datasets, some of which are markedly
different from the training data. Discrimination performance is also
consistently improved. We show that joint training of the PLDA and the adaptive
calibrator is essential -- the same benefits cannot be achieved when freezing
PLDA and fine-tuning the calibrator. To our knowledge, the results in this
paper are the first evidence in the literature that it is possible to develop a
speaker verification system with robust out-of-the-box performance on a large
variety of conditions.
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2021 21:27:52 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Aug 2021 17:30:49 GMT'}]",2021-08-18,"[['Ferrer', 'Luciana', ''], ['McLaren', 'Mitchell', ''], ['Brummer', 'Niko', '']]","['Speaker Verification', 'Probabilistic Linear DiscriminantAnalysis', 'Robust Calibration']"
12001,2002.05024,Mirko Myllykoski,"Mirko Myllykoski, Carl Christian Kjelgaard Mikkelsen","Task-based, GPU-accelerated and Robust Library for Solving Dense
  Nonsymmetric Eigenvalue Problems","18 pages, 11 figures (18 when counting sub-figures), 1 tex-files.
  Invited article submitted to Concurrency and Computation: Practice and
  Experience. Second author's first name is ""Carl Christian"" and last name
  ""Kjelgaard Mikkelsen""",Concurrency Computat Pract Exper. (2020) e5915,10.1002/cpe.5915,,cs.MS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present the StarNEig library for solving dense nonsymmetric
standard and generalized eigenvalue problems. The library is built on top of
the StarPU runtime system and targets both shared and distributed memory
machines. Some components of the library have support for GPU acceleration. The
library is currently in an early beta state and supports only real matrices.
Support for complex matrices is planned for a future release. This paper is
aimed at potential users of the library. We describe the design choices and
capabilities of the library, and contrast them to existing software such as
ScaLAPACK. StarNEig implements a ScaLAPACK compatibility layer which should
assist new users in the transition to StarNEig. We demonstrate the performance
of the library with a sample of computational experiments.
","[{'version': 'v1', 'created': 'Wed, 12 Feb 2020 14:28:55 GMT'}]",2020-08-07,"[['Myllykoski', 'Mirko', ''], ['Mikkelsen', 'Carl Christian Kjelgaard', '']]","['eigenvalue problem', 'parallel computing', 'task-based', 'numerical library']"
12002,2105.14688,Yongchun Zhu,"Yongchun Zhu, Yudan Liu, Ruobing Xie, Fuzhen Zhuang, Xiaobo Hao,
  Kaikai Ge, Xu Zhang, Leyu Lin and Juan Cao","Learning to Expand Audience via Meta Hybrid Experts and Critics for
  Recommendation and Advertising",accepted by KDD2021,,10.1145/3447548.3467093,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recommender systems and advertising platforms, marketers always want to
deliver products, contents, or advertisements to potential audiences over media
channels such as display, video, or social. Given a set of audiences or
customers (seed users), the audience expansion technique (look-alike modeling)
is a promising solution to identify more potential audiences, who are similar
to the seed users and likely to finish the business goal of the target
campaign. However, look-alike modeling faces two challenges: (1) In practice, a
company could run hundreds of marketing campaigns to promote various contents
within completely different categories every day, e.g., sports, politics,
society. Thus, it is difficult to utilize a common method to expand audiences
for all campaigns. (2) The seed set of a certain campaign could only cover
limited users. Therefore, a customized approach based on such a seed set is
likely to be overfitting.
  In this paper, to address these challenges, we propose a novel two-stage
framework named Meta Hybrid Experts and Critics (MetaHeac) which has been
deployed in WeChat Look-alike System. In the offline stage, a general model
which can capture the relationships among various tasks is trained from a
meta-learning perspective on all existing campaign tasks. In the online stage,
for a new campaign, a customized model is learned with the given seed set based
on the general model. According to both offline and online experiments, the
proposed MetaHeac shows superior effectiveness for both content marketing
campaigns in recommender systems and advertising campaigns in advertising
platforms. Besides, MetaHeac has been successfully deployed in WeChat for the
promotion of both contents and advertisements, leading to great improvement in
the quality of marketing. The code has been available at
\url{https://github.com/easezyc/MetaHeac}.
","[{'version': 'v1', 'created': 'Mon, 31 May 2021 03:43:10 GMT'}]",2021-06-01,"[['Zhu', 'Yongchun', ''], ['Liu', 'Yudan', ''], ['Xie', 'Ruobing', ''], ['Zhuang', 'Fuzhen', ''], ['Hao', 'Xiaobo', ''], ['Ge', 'Kaikai', ''], ['Zhang', 'Xu', ''], ['Lin', 'Leyu', ''], ['Cao', 'Juan', '']]","['Look-alike', 'Audience Expansion', 'Meta Learning', 'Campaign']"
12003,2002.06182,Steven Costiou,"Steven Costiou (INRIA, France), Vincent Aranega (INRIA, France),
  Marcus Denker (INRIA, France)","Sub-method, partial behavioral reflection with Reflectivity: Looking
  back on 10 years of use",,"The Art, Science, and Engineering of Programming, 2020, Vol. 4,
  Issue 3, Article 5",10.22152/programming-journal.org/2020/4/5,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context. Refining or altering existing behavior is the daily work of every
developer, but that cannot be always anticipated, and software sometimes cannot
be stopped. In such cases, unanticipated adaptation of running systems is of
interest for many scenarios, ranging from functional upgrades to on-the-fly
debugging or monitoring of critical applications.
  Inquiry. A way of altering software at run time is using behavioral
reflection, which is particularly well-suited for unanticipated adaptation of
real-world systems. Partial behavioral reflection is not a new idea, and for
years many efforts have been made to propose a practical way of expressing it.
All these efforts resulted in practical solutions, but which introduced a
semantic gap between the code that requires adaptation and the expression of
the partial behavior. For example, in Aspect-Oriented Programming, a pointcut
description is expressed in another language, which introduces a new distance
between the behavior expression (the Advice) and the source code in itself.
  Approach. Ten years ago, the idea of closing the gap between the code and the
expression of the partial behavior led to the implementation of the
Reflectivity framework. Using Reflectivity, developers annotate Abstract Syntax
Tree (AST) nodes with meta-behavior which is taken into account by the compiler
to produce behavioral variations. In this paper, we present Reflectivity, its
API, its implementation and its usage in Pharo. We reflect on ten years of use
of Reflectivity, and show how it has been used as a basic building block of
many innovative ideas.
  Knowledge. Reflectivity brings a practical way of working at the AST level,
which is a high-level representation of the source code manipulated by software
developers. It enables a powerful way of dynamically add and modify behavior.
Reflectivity is also a flexible mean to bridge the gap between the expression
of the meta-behavior and the source code. This ability to apply unanticipated
adaptation and to provide behavioral reflection led to many experiments and
projects during this last decade by external users. Existing work use
Reflectivity to implement reflective libraries or languages extensions,
featherweight code instrumentation, dynamic software update, debugging tools
and visualization and software analysis tools.
  Grounding. Reflectivity is actively used in research projects. During the
past ten years, it served as a support, either for implementation or as a
fundamental base, for many research work including PhD theses, conference,
journal and workshop papers. Reflectivity is now an important library of the
Pharo language, and is integrated at the heart of the platform.
  Importance. Reflectivity exposes powerful abstractions to deal with partial
behavioral adaptation, while providing a mature framework for unanticipated,
non-intrusive and partial behavioral reflection based on AST annotation.
Furthermore, even if Reflectivity found its home inside Pharo, it is not a pure
Smalltalk-oriented solution. As validation over the practical use of
Reflectivity in dynamic object-oriented languages, the API has been ported to
Python. Finally, the AST annotation feature of Reflectivity opens new
experimentation opportunities about the control that developers could gain on
the behavior of their own software.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 18:57:11 GMT'}]",2020-02-17,"[['Costiou', 'Steven', '', 'INRIA, France'], ['Aranega', 'Vincent', '', 'INRIA, France'], ['Denker', 'Marcus', '', 'INRIA, France']]","['Meta-programming', 'reflection', 'AST']"
12004,2110.12648,YoonHyuk Choi,"Yoonhyuk Choi, Jiho Choi, Taewook Ko, Hyungho Byun, Chong-Kwon Kim","Review-Based Domain Disentanglement without Duplicate Users or Contexts
  for Cross-Domain Recommendation",,,10.1145/3511808.3557434,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A cross-domain recommendation has shown promising results in solving
data-sparsity and cold-start problems. Despite such progress, existing methods
focus on domain-shareable information (overlapped users or same contexts) for a
knowledge transfer, and they fail to generalize well without such requirements.
To deal with these problems, we suggest utilizing review texts that are general
to most e-commerce systems. Our model (named SER) uses three text analysis
modules, guided by a single domain discriminator for disentangled
representation learning. Here, we suggest a novel optimization strategy that
can enhance the quality of domain disentanglement, and also debilitates
detrimental information of a source domain. Also, we extend the encoding
network from a single to multiple domains, which has proven to be powerful for
review-based recommender systems. Extensive experiments and ablation studies
demonstrate that our method is efficient, robust, and scalable compared to the
state-of-the-art single and cross-domain recommendation methods.
","[{'version': 'v1', 'created': 'Mon, 25 Oct 2021 05:17:58 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Sep 2022 04:11:48 GMT'}]",2022-09-02,"[['Choi', 'Yoonhyuk', ''], ['Choi', 'Jiho', ''], ['Ko', 'Taewook', ''], ['Byun', 'Hyungho', ''], ['Kim', 'Chong-Kwon', '']]","['Cross-Domain Recommendation', 'Disentangled Representation Learning', 'Domain Adaptation', 'Textual Analysis']"
12005,1811.07583,Jaime Spencer Martin Mr.,"Jaime Spencer, Oscar Mendez, Richard Bowden, Simon Hadfield",Localisation via Deep Imagination: learn the features not the map,VNAD @ ECCV2018,,10.1007/978-3-030-11021-5_44,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  How many times does a human have to drive through the same area to become
familiar with it? To begin with, we might first build a mental model of our
surroundings. Upon revisiting this area, we can use this model to extrapolate
to new unseen locations and imagine their appearance. Based on this, we propose
an approach where an agent is capable of modelling new environments after a
single visitation. To this end, we introduce ""Deep Imagination"", a combination
of classical Visual-based Monte Carlo Localisation and deep learning. By making
use of a feature embedded 3D map, the system can ""imagine"" the view from any
novel location. These ""imagined"" views are contrasted with the current
observation in order to estimate the agent's current location. In order to
build the embedded map, we train a deep Siamese Fully Convolutional U-Net to
perform dense feature extraction. By training these features to be generic, no
additional training or fine tuning is required to adapt to new environments.
Our results demonstrate the generality and transfer capability of our learnt
dense features by training and evaluating on multiple datasets. Additionally,
we include several visualizations of the feature representations and resulting
3D maps, as well as their application to localisation.
","[{'version': 'v1', 'created': 'Mon, 19 Nov 2018 09:52:34 GMT'}]",2019-03-26,"[['Spencer', 'Jaime', ''], ['Mendez', 'Oscar', ''], ['Bowden', 'Richard', ''], ['Hadfield', 'Simon', '']]","['Localization', 'Deep Imagination', 'VMCL', 'FCU-Net']"
12006,2001.06145,Adam Stinchcombe,"Jihun Han, Mihai Nica, Adam R Stinchcombe","A Derivative-Free Method for Solving Elliptic Partial Differential
  Equations with Deep Neural Networks","25 pages, 4 figures",,10.1016/j.jcp.2020.109672,,cs.LG math.PR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a deep neural network based method for solving a class of
elliptic partial differential equations. We approximate the solution of the PDE
with a deep neural network which is trained under the guidance of a
probabilistic representation of the PDE in the spirit of the Feynman-Kac
formula. The solution is given by an expectation of a martingale process driven
by a Brownian motion. As Brownian walkers explore the domain, the deep neural
network is iteratively trained using a form of reinforcement learning. Our
method is a 'Derivative-Free Loss Method' since it does not require the
explicit calculation of the derivatives of the neural network with respect to
the input neurons in order to compute the training loss. The advantages of our
method are showcased in a series of test problems: a corner singularity
problem, an interface problem, and an application to a chemotaxis population
model.
","[{'version': 'v1', 'created': 'Fri, 17 Jan 2020 03:29:24 GMT'}]",2020-08-26,"[['Han', 'Jihun', ''], ['Nica', 'Mihai', ''], ['Stinchcombe', 'Adam R', '']]","['numerical method', 'partial differential equation', 'neural network', 'Brownianmotion', 'reinforcement learning', 'Bellman equation']"
12007,2208.00380,Yiran Wang,"Yiran Wang, Zhiyu Pan, Xingyi Li, Zhiguo Cao, Ke Xian, Jianming Zhang","Less is More: Consistent Video Depth Estimation with Masked Frames
  Modeling",Accepted by ACM MM 2022,,10.1145/3503161.3547978,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Temporal consistency is the key challenge of video depth estimation. Previous
works are based on additional optical flow or camera poses, which is
time-consuming. By contrast, we derive consistency with less information. Since
videos inherently exist with heavy temporal redundancy, a missing frame could
be recovered from neighboring ones. Inspired by this, we propose the frame
masking network (FMNet), a spatial-temporal transformer network predicting the
depth of masked frames based on their neighboring frames. By reconstructing
masked temporal features, the FMNet can learn intrinsic inter-frame
correlations, which leads to consistency. Compared with prior arts,
experimental results demonstrate that our approach achieves comparable spatial
accuracy and higher temporal consistency without any additional information.
Our work provides a new perspective on consistent video depth estimation. Our
official project page is https://github.com/RaymondWang987/FMNet.
","[{'version': 'v1', 'created': 'Sun, 31 Jul 2022 07:11:20 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Aug 2022 10:43:29 GMT'}]",2022-08-19,"[['Wang', 'Yiran', ''], ['Pan', 'Zhiyu', ''], ['Li', 'Xingyi', ''], ['Cao', 'Zhiguo', ''], ['Xian', 'Ke', ''], ['Zhang', 'Jianming', '']]","['depth estimation', 'temporal consistency', 'masked frames modeling']"
12008,2007.16076,Guillaume Noyel,"Guillaume Noyel (CMM), Jesus Angulo (CMM), Dominique Jeulin (CMM)",Fast computation of all pairs of geodesic distances,,"Image Analysis and Stereology, International Society for
  Stereology, 2011, 30 (2), pp.101-109",10.5566/ias.v30.p101-109,,cs.DM eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computing an array of all pairs of geodesic distances between the pixels of
an image is time consuming. In the sequel, we introduce new methods exploiting
the redundancy of geodesic propagations and compare them to an existing one. We
show that our method in which the source point of geodesic propagations is
chosen according to its minimum number of distances to the other points,
improves the previous method up to 32% and the naive method up to 50% in terms
of reduction of the number of operations.
","[{'version': 'v1', 'created': 'Fri, 31 Jul 2020 13:44:54 GMT'}]",2020-08-03,"[['Noyel', 'Guillaume', '', 'CMM'], ['Angulo', 'Jesus', '', 'CMM'], ['Jeulin', 'Dominique', '', 'CMM']]","['All pairs of geodesic distances', 'geodesic propagation', 'fast marching']"
12009,2107.04551,Amey Thakur,"Amey Thakur, Hasan Rizvi, Mega Satish",White-Box Cartoonization Using An Extended GAN Framework,"5 pages, 6 figures. International Journal of Engineering Applied
  Sciences and Technology, 2021",,10.33564/IJEAST.2021.v05i12.049,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the present study, we propose to implement a new framework for estimating
generative models via an adversarial process to extend an existing GAN
framework and develop a white-box controllable image cartoonization, which can
generate high-quality cartooned images/videos from real-world photos and
videos. The learning purposes of our system are based on three distinct
representations: surface representation, structure representation, and texture
representation. The surface representation refers to the smooth surface of the
images. The structure representation relates to the sparse colour blocks and
compresses generic content. The texture representation shows the texture,
curves, and features in cartoon images. Generative Adversarial Network (GAN)
framework decomposes the images into different representations and learns from
them to generate cartoon images. This decomposition makes the framework more
controllable and flexible which allows users to make changes based on the
required output. This approach overcomes any previous system in terms of
maintaining clarity, colours, textures, shapes of images yet showing the
characteristics of cartoon images.
","[{'version': 'v1', 'created': 'Fri, 9 Jul 2021 17:09:19 GMT'}]",2021-08-31,"[['Thakur', 'Amey', ''], ['Rizvi', 'Hasan', ''], ['Satish', 'Mega', '']]","['Cartoonization', 'Generator', 'Discriminator', 'GAN', 'Surface', 'Structure', 'Texture']"
12010,1907.02703,Yong Min,"Yong Min, Tingjun Jiang, Cheng Jin, Qu Li and Xiaogang Jin","Intelligent social bots uncover the link between user preference and
  diversity of news consumption",The refined manuscript is under review in Royal Society Open Science,Roy. Soc. Open Sci. 6 (2019) 190868,10.1098/rsos.190868,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The boom of online social media and microblogging platforms has rapidly alter
the way we consume news and exchange opinions. Even though considerable efforts
try to recommend various contents to users, loss of information diversity and
the polarization of interest groups are still an enormous challenge for
industry and academia. Here, we take advantage of benign social bots to design
a controlled experiment on Weibo (the largest microblogging platform in China).
These software bots can exhibit human-like behavior (e.g., preferring
particular content) and simulate the formation of personal social networks and
news consumption under two well-accepted sociological hypotheses (i.e.,
homophily and triadic closure). We deployed 68 bots to Weibo, and each bot ran
for at least 2 months and followed 100 to 120 accounts. In total, we observed
5,318 users and recorded about 630,000 messages exposed to these bots. Our
results show, even with the same selection behaviors, bots preferring
entertainment content are more likely to form polarized communities with their
peers, in which about 80\% of the information they consume is of the same type,
which is a significant difference for bots preferring sci-tech content. The
result suggests that users preference played a more crucial role in limiting
themselves access to diverse content by compared with the two well-known
drivers (self-selection and pre-selection). Furthermore, our results reveal an
ingenious connection between specific content and its propagating
sub-structures in the same social network. In the Weibo network, entertainment
news favors a unidirectional star-like sub-structure, while sci-tech news
spreads on a bidirectional clustering sub-structure. This connection can
amplify the diversity effect of user preference. The discovery may have
important implications for diffusion dynamics study and recommendation system
design.
","[{'version': 'v1', 'created': 'Fri, 5 Jul 2019 07:20:48 GMT'}]",2020-03-05,"[['Min', 'Yong', ''], ['Jiang', 'Tingjun', ''], ['Jin', 'Cheng', ''], ['Li', 'Qu', ''], ['Jin', 'Xiaogang', '']]","['Social network', 'Information polarization', 'Controlled experiment', 'Social bot', 'Text classifcation', 'Microblogging']"
12011,2301.04700,David Sayah,David Sayah,Continuous-Time Formulations for Multi-Mode Project Scheduling,37 pages,,10.1016/j.cor.2023.106147,,cs.DM math.OC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper reviews compact continuous-time formulations for the multi-mode
resource-constrained project scheduling problem. Specifically, we first point
out a serious flaw in an existing start-end-event-based formulation owing to
inconsistent mode choices. We propose two options to formulate the missing
constraints and we consider an equivalent reformulation with sparser constraint
matrix. Second, we formulate an aggregate variant of an existing model that
relies on on-off-events and clarify the role of mode consistency issues in such
models. Third, we suggest two variants of an existing network flow formulation.
We enhance our models by adapting several techniques that have been used
previously, e.g., in cases with only a single mode. A large set of benchmark
instances from the literature provides the basis for an up-to-date and fair
computational study with an out-of-the-box solver package. We compare our
models against two models from the literature. Our experiments assert
confidently that network flow formulations prevail in the test bed, and they
provide a hint on why event-based models become less competitive in multi-mode
settings.
","[{'version': 'v1', 'created': 'Wed, 11 Jan 2023 20:19:07 GMT'}, {'version': 'v2', 'created': 'Sun, 15 Jan 2023 10:47:22 GMT'}]",2023-01-23,"[['Sayah', 'David', '']]","['resource-constrained project scheduling', 'multiple operationalmodes', 'network flows', 'events', 'mixed-integer linear programming']"
12012,2012.15627,Oliviero Riganelli,"Marco Mobilio, Oliviero Riganelli, Daniela Micucci, Leonardo Mariani","FILO: FIx-LOcus Localization for Backward Incompatibilities Caused by
  Android Framework Upgrades","for associated video, see http://myhost.domain/file.mpg and FILO
  source code can be downloaded from https://gitlab.com/learnERC/filo . In the
  International Conference on Automated Software Engineering (2020)",,10.1145/3324884.3415290,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile operating systems evolve quickly, frequently updating the APIs that
app developers use to build their apps. Unfortunately, API updates do not
always guarantee backward compatibility, causing apps to not longer work
properly or even crash when running with an updated system. This paper presents
FILO, a tool that assists Android developers in resolving backward
compatibility issues introduced by API upgrades. FILO both suggests the method
that needs to be modified in the app in order to adapt the app to an upgraded
API, and reports key symptoms observed in the failed execution to facilitate
the fixing activity. Results obtained with the analysis of 12 actual upgrade
problems and the feedback produced by early tool adopters show that FILO can
practically support Android developers.FILO can be downloaded from
https://gitlab.com/learnERC/filo, and its video demonstration is available at
https://youtu.be/WDvkKj-wnlQ.
","[{'version': 'v1', 'created': 'Thu, 31 Dec 2020 14:32:44 GMT'}]",2021-01-01,"[['Mobilio', 'Marco', ''], ['Riganelli', 'Oliviero', ''], ['Micucci', 'Daniela', ''], ['Mariani', 'Leonardo', '']]","['Debugging', 'Android', 'API upgrades', 'Fault localization']"
12013,1708.02318,Vikraman Choudhury,"Chao-Hong Chen, Vikraman Choudhury and Ryan R. Newton","Adaptive Lock-Free Data Structures in Haskell: A General Method for
  Concurrent Implementation Swapping",To be published in ACM SIGPLAN Haskell Symposium 2017,,10.1145/3122955.3122973,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A key part of implementing high-level languages is providing built-in and
default data structures. Yet selecting good defaults is hard. A mutable data
structure's workload is not known in advance, and it may shift over its
lifetime - e.g., between read-heavy and write-heavy, or from heavy contention
by multiple threads to single-threaded or low-frequency use. One idea is to
switch implementations adaptively, but it is nontrivial to switch the
implementation of a concurrent data structure at runtime. Performing the
transition requires a concurrent snapshot of data structure contents, which
normally demands special engineering in the data structure's design. However,
in this paper we identify and formalize an relevant property of lock-free
algorithms. Namely, lock-freedom is sufficient to guarantee that freezing
memory locations in an arbitrary order will result in a valid snapshot. Several
functional languages have data structures that freeze and thaw, transitioning
between mutable and immutable, such as Haskell vectors and Clojure transients,
but these enable only single-threaded writers. We generalize this approach to
augment an arbitrary lock-free data structure with the ability to gradually
freeze and optionally transition to a new representation. This augmentation
doesn't require changing the algorithm or code for the data structure, only
replacing its datatype for mutable references with a freezable variant. In this
paper, we present an algorithm for lifting plain to adaptive data and prove
that the resulting hybrid data structure is itself lock-free, linearizable, and
simulates the original. We also perform an empirical case study in the context
of heating up and cooling down concurrent maps.
","[{'version': 'v1', 'created': 'Mon, 7 Aug 2017 22:00:49 GMT'}]",2017-08-09,"[['Chen', 'Chao-Hong', ''], ['Choudhury', 'Vikraman', ''], ['Newton', 'Ryan R.', '']]","['lock-free algorithms', 'concurrent data structures', 'concurrency', 'parallelism']"
12014,1708.03472,Todd Davies,"Chi Ling Chan, Justin Lai, Bryan Hooi, Todd Davies","The Message or the Messenger? Inferring Virality and Diffusion Structure
  from Online Petition Signature Data","19 pages, 6 figures, 4 tables, to appear in Giovanni Luca Ciampaglia,
  Afra J. Mashhadi, and Taha Yasseri (Editors), Social Informatics: Proceedings
  of the 9th International Conference, SocInfo 2017 (Oxford, UK, September
  13-15), Springer LNCS, 2017","Lecture Notes in Computer Science 10539:499-517, 2017",10.1007/978-3-319-67217-5_30,,cs.CY cs.SI stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Goel et al. (2016) examined diffusion data from Twitter to conclude that
online petitions are shared more virally than other types of content. Their
definition of structural virality, which measures the extent to which diffusion
follows a broadcast model or is spread person to person (virally), depends on
knowing the topology of the diffusion cascade. But often the diffusion
structure cannot be observed directly. We examined time-stamped signature data
from the Obama White House's We the People petition platform. We developed
measures based on temporal dynamics that, we argue, can be used to infer
diffusion structure as well as the more intrinsic notion of virality sometimes
known as infectiousness. These measures indicate that successful petitions are
likely to be higher in both intrinsic and structural virality than unsuccessful
petitions are. We also investigate threshold effects on petition signing that
challenge simple contagion models, and report simulations for a theoretical
model that are consistent with our data.
","[{'version': 'v1', 'created': 'Fri, 11 Aug 2017 08:43:31 GMT'}]",2017-09-20,"[['Chan', 'Chi Ling', ''], ['Lai', 'Justin', ''], ['Hooi', 'Bryan', ''], ['Davies', 'Todd', '']]","['petitions', 'virality', 'broadcast', 'diffusion']"
12015,2104.02396,Tobias Pfandzelter,Tobias Pfandzelter and Jonathan Hasenburg and David Bermbach,Towards a Computing Platform for the LEO Edge,"Accepted for Publication at 4th International Workshop on Edge
  Systems, Analytics and Networking (EdgeSys '21), April 26, 2021, Online,
  United Kingdom",,10.1145/3434770.3459736,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The new space race is heating up as private companies such as SpaceX and
Amazon are building large satellite constellations in low-earth orbit (LEO) to
provide global broadband internet access. As the number of subscribers
connected to this access network grows, it becomes necessary to investigate if
and how edge computing concepts can be applied to LEO satellite networks.
  In this paper, we discuss the unique characteristics of the LEO edge and
analyze the suitability of three organization paradigms for applications
considering developer requirements. We conclude that the serverless approach is
the most promising solution, opening up the field for future research.
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2021 10:04:13 GMT'}]",2021-04-07,"[['Pfandzelter', 'Tobias', ''], ['Hasenburg', 'Jonathan', ''], ['Bermbach', 'David', '']]","['satellite internet', 'LEO constellations', 'edge computing']"
12016,1806.05135,Andrea Borghesi,"Andrea Borghesi, Andrea Bartolini, Michela Milano, Luca Benini",Pricing Schemes for Energy-Efficient HPC Systems: Design and Exploration,,"The International Journal of High Performance Computing
  Applications. Volume: 33 issue: 4, page(s): 716-734 , 2019",10.1177/1094342018814593,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Energy efficiency is of paramount importance for the sustainability of HPC
systems. Energy consumption limits the peak performance of supercomputers and
accounts for a large share of total cost of ownership. Consequently, system
owners and final users have started exploring mechanisms to trade off
performance for power consumption, for example through frequency and voltage
scaling.
  However, only a limited number of studies have been devoted to explore the
economic viability of performance scaling solutions and to devise pricing
mechanisms fostering a more energy-conscious usage of resources, without
adversely impacting return-of-investment on the HPC facility. We present a
parametrized model to analyze the impact of frequency scaling on energy and to
assess the potential total cost benefits for the HPC facility and the user. We
evaluate four pricing schemes, considering both facility manager and the user
perspectives. We then perform a design space exploration considering current
and near-future HPC systems and technologies.
","[{'version': 'v1', 'created': 'Wed, 13 Jun 2018 16:33:39 GMT'}]",2020-07-30,"[['Borghesi', 'Andrea', ''], ['Bartolini', 'Andrea', ''], ['Milano', 'Michela', ''], ['Benini', 'Luca', '']]","['High Performance Computing', 'Energy-Efficiency', 'Power Consumption', 'Pricing Schemes']"
12017,2006.16424,Wei-Lin Hsiao,"Nicole D. Payntar, Wei-Lin Hsiao, R. Alan Covey, Kristen Grauman","Learning Patterns of Tourist Movement and Photography from Geotagged
  Photos at Archaeological Heritage Sites in Cuzco, Peru",Accepted to Tourism Management,,10.1016/j.tourman.2020.104165,,cs.SI cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The popularity of media sharing platforms in recent decades has provided an
abundance of open source data that remains underutilized by heritage scholars.
By pairing geotagged internet photographs with machine learning and computer
vision algorithms, we build upon the current theoretical discourse of
anthropology associated with visuality and heritage tourism to identify travel
patterns across a known archaeological heritage circuit, and quantify visual
culture and experiences in Cuzco, Peru. Leveraging large-scale in-the-wild
tourist photos, our goals are to (1) understand how the intensification of
tourism intersects with heritage regulations and social media, aiding in the
articulation of travel patterns across Cuzco's heritage landscape; and to (2)
assess how aesthetic preferences and visuality become entangled with the
rapidly evolving expectations of tourists, whose travel narratives are curated
on social media and grounded in historic site representations.
","[{'version': 'v1', 'created': 'Mon, 29 Jun 2020 22:49:59 GMT'}]",2020-07-22,"[['Payntar', 'Nicole D.', ''], ['Hsiao', 'Wei-Lin', ''], ['Covey', 'R. Alan', ''], ['Grauman', 'Kristen', '']]","['geotagged photos', 'anthropology and computer vision', 'clustering', 'visuality', 'heritage tourism', 'visual recognition', 'Peru']"
12018,1910.07381,Irene-Angelica Chounta,Irene-Angelica Chounta,"Using learning analytics to provide personalized recommendations for
  finding peers","4 pages, 1 figure, conference, CollabTech",,10.13140/RG.2.2.36616.78081,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work aims to propose a method to support students in finding appropriate
peers in collaborative and blended learning settings. The main goal of this
research is to bridge the gap between pedagogical theory and data driven
practice to provide personalized and adaptive guidance to students who engage
in computer supported learning activities. The research hypothesis is that we
can use Learning Analytics to model students' cognitive state and to assess
whether the student is in the Zone of Proximal Development. Based on this
assessment, we can plan how to provide scaffolding based on the principles of
Contingent Tutoring and how to form study groups based on the principles of the
Zone of Proximal Development.
","[{'version': 'v1', 'created': 'Wed, 16 Oct 2019 14:40:27 GMT'}]",2019-10-17,"[['Chounta', 'Irene-Angelica', '']]","['learning analytics', 'personalization', 'adaptation', 'student modeling', 'zone of proximal development', 'social learning']"
12019,1411.7911,Artem Rozantsev Mr.,"Artem Rozantsev, Vincent Lepetit, Pascal Fua",On Rendering Synthetic Images for Training an Object Detector,,,10.1016/j.cviu.2014.12.006,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel approach to synthesizing images that are effective for
training object detectors. Starting from a small set of real images, our
algorithm estimates the rendering parameters required to synthesize similar
images given a coarse 3D model of the target object. These parameters can then
be reused to generate an unlimited number of training images of the object of
interest in arbitrary 3D poses, which can then be used to increase
classification performances.
  A key insight of our approach is that the synthetically generated images
should be similar to real images, not in terms of image quality, but rather in
terms of features used during the detector training. We show in the context of
drone, plane, and car detection that using such synthetically generated images
yields significantly better performances than simply perturbing real images or
even synthesizing images in such way that they look very realistic, as is often
done when only limited amounts of training data are available.
","[{'version': 'v1', 'created': 'Fri, 28 Nov 2014 15:41:11 GMT'}]",2015-06-30,"[['Rozantsev', 'Artem', ''], ['Lepetit', 'Vincent', ''], ['Fua', 'Pascal', '']]","['synthetic data', 'synthetic image rendering', 'object detection']"
12020,2010.16245,Hussain Hussain,"Hussain Hussain, Tomislav Duricic, Elisabeth Lex, Roman Kern, and
  Denis Helic","On the Impact of Communities on Semi-supervised Classification Using
  Graph Neural Networks",,"Complex Networks & Their Applications IX, edited by Rosa M.
  Benito, Chantal Cherifi, Hocine Cherifi, Esteban Moro, Luis Mateus Rocha,
  Marta Sales-Pardo, 2020, Springer, Cham reproduced with permission of
  Springer, Cham",10.1007/978-3-030-65351-4_2,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph Neural Networks (GNNs) are effective in many applications. Still, there
is a limited understanding of the effect of common graph structures on the
learning process of GNNs. In this work, we systematically study the impact of
community structure on the performance of GNNs in semi-supervised node
classification on graphs. Following an ablation study on six datasets, we
measure the performance of GNNs on the original graphs, and the change in
performance in the presence and the absence of community structure. Our results
suggest that communities typically have a major impact on the learning process
and classification performance. For example, in cases where the majority of
nodes from one community share a single classification label, breaking up
community structure results in a significant performance drop. On the other
hand, for cases where labels show low correlation with communities, we find
that the graph structure is rather irrelevant to the learning process, and a
feature-only baseline becomes hard to beat. With our work, we provide deeper
insights in the abilities and limitations of GNNs, including a set of general
guidelines for model selection based on the graph structure.
","[{'version': 'v1', 'created': 'Fri, 30 Oct 2020 13:17:38 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Mar 2021 15:56:27 GMT'}]",2021-03-08,"[['Hussain', 'Hussain', ''], ['Duricic', 'Tomislav', ''], ['Lex', 'Elisabeth', ''], ['Kern', 'Roman', ''], ['Helic', 'Denis', '']]","['graph neural networks', 'community structure', 'semi-supervisedlearning']"
12021,2110.07366,Tamas Bisztray,"Tamas Bisztray, Nils Gruschka","Privacy Impact Assessment: Comparing methodologies with a focus on
  practicality",,"NordSec 2019. Lecture Notes in Computer Science, vol 11875.
  Springer, Cham",10.1007/978-3-030-35055-0_1,,cs.CR cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Privacy and data protection have become more and more important in recent
years since an increasing number of enterprises and startups are harvesting
personal data as a part of their business model. One central requirement of the
GDPR is the implementation of a data protection impact assessment for privacy
critical systems. However, the law does not dictate or recommend the use of any
particular framework. In this paper we compare different data protection impact
assessment frameworks. We have developed a comparison and evaluation
methodology and applied this to three popular impact assessment frameworks. The
result of this comparison shows the weaknesses and strengths, but also clearly
indicates that none of the tested frameworks fulfill all desired properties.
Thus, the development of a new or improved data protection impact assessment
framework is an important open issue for future work, especially for sector
specific applications.
","[{'version': 'v1', 'created': 'Thu, 14 Oct 2021 13:52:29 GMT'}]",2021-10-15,"[['Bisztray', 'Tamas', ''], ['Gruschka', 'Nils', '']]","['Data protection', 'Privacy Impact Assessment', 'GDPR', 'DPIA']"
12022,2006.12549,Ahmad Khan,"Ahmad Ali Khan, Raviraj Adve and Wei Yu","Optimizing Downlink Resource Allocation in Multiuser MIMO Networks via
  Fractional Programming and the Hungarian Algorithm","Accepted for publication in IEEE Transactions on Wireless
  Communications (2020)",,10.1109/TWC.2020.2990176.,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optimizing the sum-log-utility for the downlink of multi-frequency band,
multiuser, multiantenna networks requires joint solutions to the associated
beamforming and user scheduling problems through the use of cloud radio access
network (CRAN) architecture; optimizing such a network is, however, non-convex
and NP-hard. In this paper, we present a novel iterative beamforming and
scheduling strategy based on fractional programming and the Hungarian
algorithm. The beamforming strategy allows us to iteratively maximize the
chosen objective function in a fashion similar to block coordinate ascent.
Furthermore, based on the crucial insight that, in the downlink, the
interference pattern remains fixed for a given set of beamforming weights, we
use the Hungarian algorithm as an efficient approach to optimally schedule
users for the given set of beamforming weights. Specifically, this approach
allows us to select the best subset of users (amongst the larger set of all
available users). Our simulation results show that, in terms of average
sum-log-utility, as well as sum-rate, the proposed scheme substantially
outperforms both the state-of-the-art multicell weighted minimum mean-squared
error (WMMSE) and greedy proportionally fair WMMSE schemes, as well as standard
interior-point and sequential quadratic solvers. Importantly, our proposed
scheme is also far more computationally efficient than the multicell WMMSE
scheme.
","[{'version': 'v1', 'created': 'Mon, 22 Jun 2020 18:21:58 GMT'}]",2020-06-24,"[['Khan', 'Ahmad Ali', ''], ['Adve', 'Raviraj', ''], ['Yu', 'Wei', '']]","['Multiple input multiple output (MIMO)', 'fractional programming', 'beamforming', 'scheduling', 'wireless']"
12023,2205.13646,Rushit Dave,"Nyle Siddiqui, Rushit Dave, Naeem Seliya, Mounika Vanamala","Machine and Deep Learning Applications to Mouse Dynamics for Continuous
  User Authentication",,Mach. Learn. Knowl. Extr. 2022,10.3390/make4020023,,cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Static authentication methods, like passwords, grow increasingly weak with
advancements in technology and attack strategies. Continuous authentication has
been proposed as a solution, in which users who have gained access to an
account are still monitored in order to continuously verify that the user is
not an imposter who had access to the user credentials. Mouse dynamics is the
behavior of a users mouse movements and is a biometric that has shown great
promise for continuous authentication schemes. This article builds upon our
previous published work by evaluating our dataset of 40 users using three
machine learning and deep learning algorithms. Two evaluation scenarios are
considered: binary classifiers are used for user authentication, with the top
performer being a 1-dimensional convolutional neural network with a peak
average test accuracy of 85.73% across the top 10 users. Multi class
classification is also examined using an artificial neural network which
reaches an astounding peak accuracy of 92.48% the highest accuracy we have seen
for any classifier on this dataset.
","[{'version': 'v1', 'created': 'Thu, 26 May 2022 21:43:59 GMT'}]",2022-05-30,"[['Siddiqui', 'Nyle', ''], ['Dave', 'Rushit', ''], ['Seliya', 'Naeem', ''], ['Vanamala', 'Mounika', '']]","['Deep learning', 'Machine learning', 'Mouse dynamics', 'Continuous user authentication', 'multi-class classification']"
12024,2001.08813,Johannes Rauh,Johannes Rauh and Franti\v{s}ek Mat\'u\v{s},Maximizing the Bregman divergence from a Bregman family,"11 pages, 5 theorems, no figure","Kybernetika 56 no. 5, 875-885, 2020",10.14736/kyb-2020-5-0875,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem to maximize the information divergence from an exponential family
is generalized to the setting of Bregman divergences and suitably defined
Bregman families.
","[{'version': 'v1', 'created': 'Thu, 23 Jan 2020 21:17:22 GMT'}]",2021-11-02,"[['Rauh', 'Johannes', ''], ['Matúš', 'František', '']]","['Bregman divergence', 'relative entropy', 'exponential family', 'optimization']"
12025,1910.05680,Chao-Tsung Huang,"Chao-Tsung Huang, Yu-Chun Ding, Huan-Ching Wang, Chi-Wen Weng,
  Kai-Ping Lin, Li-Wei Wang, Li-De Chen","eCNN: A Block-Based and Highly-Parallel CNN Accelerator for Edge
  Inference","14 pages; appearing in IEEE/ACM International Symposium on
  Microarchitecture (MICRO), 2019",,10.1145/3352460.3358263,,cs.DC cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convolutional neural networks (CNNs) have recently demonstrated superior
quality for computational imaging applications. Therefore, they have great
potential to revolutionize the image pipelines on cameras and displays.
However, it is difficult for conventional CNN accelerators to support
ultra-high-resolution videos at the edge due to their considerable DRAM
bandwidth and power consumption. Therefore, finding a further memory- and
computation-efficient microarchitecture is crucial to speed up this coming
revolution.
  In this paper, we approach this goal by considering the inference flow,
network model, instruction set, and processor design jointly to optimize
hardware performance and image quality. We apply a block-based inference flow
which can eliminate all the DRAM bandwidth for feature maps and accordingly
propose a hardware-oriented network model, ERNet, to optimize image quality
based on hardware constraints. Then we devise a coarse-grained instruction set
architecture, FBISA, to support power-hungry convolution by massive
parallelism. Finally,we implement an embedded processor---eCNN---which
accommodates to ERNet and FBISA with a flexible processing architecture. Layout
results show that it can support high-quality ERNets for super-resolution and
denoising at up to 4K Ultra-HD 30 fps while using only DDR-400 and consuming
6.94W on average. By comparison, the state-of-the-art Diffy uses dual-channel
DDR3-2133 and consumes 54.3W to support lower-quality VDSR at Full HD 30 fps.
Lastly, we will also present application examples of high-performance style
transfer and object recognition to demonstrate the flexibility of eCNN.
","[{'version': 'v1', 'created': 'Sun, 13 Oct 2019 03:54:25 GMT'}]",2019-10-15,"[['Huang', 'Chao-Tsung', ''], ['Ding', 'Yu-Chun', ''], ['Wang', 'Huan-Ching', ''], ['Weng', 'Chi-Wen', ''], ['Lin', 'Kai-Ping', ''], ['Wang', 'Li-Wei', ''], ['Chen', 'Li-De', '']]","['convolutional neural network', 'computational imaging', 'edge inference', 'hardware accelerator', 'ultra-high-definition']"
12026,1902.05377,Yuxuan Liang,"Yuxuan Liang, Kun Ouyang, Lin Jing, Sijie Ruan, Ye Liu, Junbo Zhang,
  David S. Rosenblum, Yu Zheng",UrbanFM: Inferring Fine-Grained Urban Flows,,,10.1145/3292500.3330646,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Urban flow monitoring systems play important roles in smart city efforts
around the world. However, the ubiquitous deployment of monitoring devices,
such as CCTVs, induces a long-lasting and enormous cost for maintenance and
operation. This suggests the need for a technology that can reduce the number
of deployed devices, while preventing the degeneration of data accuracy and
granularity. In this paper, we aim to infer the real-time and fine-grained
crowd flows throughout a city based on coarse-grained observations. This task
is challenging due to two reasons: the spatial correlations between coarse- and
fine-grained urban flows, and the complexities of external impacts. To tackle
these issues, we develop a method entitled UrbanFM based on deep neural
networks. Our model consists of two major parts: 1) an inference network to
generate fine-grained flow distributions from coarse-grained inputs by using a
feature extraction module and a novel distributional upsampling module; 2) a
general fusion subnet to further boost the performance by considering the
influences of different external factors. Extensive experiments on two
real-world datasets, namely TaxiBJ and HappyValley, validate the effectiveness
and efficiency of our method compared to seven baselines, demonstrating the
state-of-the-art performance of our approach on the fine-grained urban flow
inference problem.
","[{'version': 'v1', 'created': 'Wed, 6 Feb 2019 08:22:18 GMT'}]",2019-11-06,"[['Liang', 'Yuxuan', ''], ['Ouyang', 'Kun', ''], ['Jing', 'Lin', ''], ['Ruan', 'Sijie', ''], ['Liu', 'Ye', ''], ['Zhang', 'Junbo', ''], ['Rosenblum', 'David S.', ''], ['Zheng', 'Yu', '']]","['Urban computing', 'Deep learning', 'Spatio-temporal data', 'Urbanfows']"
12027,2006.12144,Shady Issa,"Alex Kogan, Dave Dice, Shady Issa",Scalable Range Locks for Scalable Address Spaces and Beyond,"17 pages, 9 figures, Eurosys 2020",,10.1145/3342195.3387533,,cs.OS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Range locks are a synchronization construct designed to provide concurrent
access to multiple threads (or processes) to disjoint parts of a shared
resource. Originally conceived in the file system context, range locks are
gaining increasing interest in the Linux kernel community seeking to alleviate
bottlenecks in the virtual memory management subsystem. The existing
implementation of range locks in the kernel, however, uses an internal spin
lock to protect the underlying tree structure that keeps track of acquired and
requested ranges. This spin lock becomes a point of contention on its own when
the range lock is frequently acquired. Furthermore, where and exactly how
specific (refined) ranges can be locked remains an open question.
  In this paper, we make two independent, but related contributions. First, we
propose an alternative approach for building range locks based on linked lists.
The lists are easy to maintain in a lock-less fashion, and in fact, our range
locks do not use any internal locks in the common case. Second, we show how the
range of the lock can be refined in the mprotect operation through a
speculative mechanism. This refinement, in turn, allows concurrent execution of
mprotect operations on non-overlapping memory regions. We implement our new
algorithms and demonstrate their effectiveness in user-space and kernel-space,
achieving up to 9$\times$ speedup compared to the stock version of the Linux
kernel. Beyond the virtual memory management subsystem, we discuss other
applications of range locks in parallel software. As a concrete example, we
show how range locks can be used to facilitate the design of scalable
concurrent data structures, such as skip lists.
","[{'version': 'v1', 'created': 'Mon, 22 Jun 2020 11:12:44 GMT'}]",2020-06-23,"[['Kogan', 'Alex', ''], ['Dice', 'Dave', ''], ['Issa', 'Shady', '']]","['reader-writer locks', 'semaphores', 'scalable synchronization', 'lock-less', 'Linux kernel', 'parallel file systems']"
12028,2112.11879,Alexandru Calotoiu,"Alexandru Calotoiu, Tal Ben-Nun, Grzegorz Kwasniewski, Johannes de
  Fine Licht, Timo Schneider, Philipp Schaad, Torsten Hoefler",Lifting C Semantics for Dataflow Optimization,,,10.1145/3524059.3532389,,cs.PL cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  C is the lingua franca of programming and almost any device can be programmed
using C. However, programming mod-ern heterogeneous architectures such as
multi-core CPUs and GPUs requires explicitly expressing parallelism as well as
device-specific properties such as memory hierarchies. The resulting code is
often hard to understand, debug, and modify for different architectures. We
propose to lift C programs to a parametric dataflow representation that lends
itself to static data-centric analysis and enables automatic high-performance
code generation. We separate writing code from optimizing for different
hardware: simple, portable C source code is used to generate efficient
specialized versions with a click of a button. Our approach can identify
parallelism when no other compiler can, and outperforms a bespoke parallelized
version of a scientific proxy application by up to 21%.
","[{'version': 'v1', 'created': 'Wed, 22 Dec 2021 14:04:38 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Dec 2021 14:45:47 GMT'}, {'version': 'v3', 'created': 'Tue, 24 May 2022 08:53:23 GMT'}]",2022-05-25,"[['Calotoiu', 'Alexandru', ''], ['Ben-Nun', 'Tal', ''], ['Kwasniewski', 'Grzegorz', ''], ['Licht', 'Johannes de Fine', ''], ['Schneider', 'Timo', ''], ['Schaad', 'Philipp', ''], ['Hoefler', 'Torsten', '']]","['parallelism', 'dataflow analysis', 'automatic parallelization']"
12029,2103.07863,Kees Middelburg,C.A. Middelburg,Imperative process algebra with abstraction,"33 pages, a polished revision of v4","Scientific Annals of Computer Science 32(1):137--179, 2022",10.7561/SACS.2022.1.137,,cs.LO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper introduces an imperative process algebra based on ACP (Algebra of
Communicating Processes). Like other imperative process algebras, this process
algebra deals with processes of the kind that arises from the execution of
imperative programs. It distinguishes itself from already existing imperative
process algebras among other things by supporting abstraction from actions that
are considered not to be visible. The support of abstraction of this kind opens
interesting application possibilities of the process algebra. This paper goes
briefly into the possibility of information-flow security analysis of the kind
that is concerned with the leakage of confidential data. For the presented
axiomatization, soundness and semi-completeness results with respect to a
notion of branching bisimulation equivalence are established.
","[{'version': 'v1', 'created': 'Sun, 14 Mar 2021 07:52:48 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Mar 2021 16:11:30 GMT'}, {'version': 'v3', 'created': 'Tue, 18 May 2021 11:23:48 GMT'}, {'version': 'v4', 'created': 'Thu, 23 Dec 2021 10:56:59 GMT'}, {'version': 'v5', 'created': 'Sat, 21 May 2022 11:56:45 GMT'}]",2022-07-08,"[['Middelburg', 'C. A.', '']]","['imperative process algebra', 'abstraction', 'branching bisimulation', 'information-flow security', 'data non-interference with interactions']"
12030,2110.12935,Susannah Kate Devitt,Susannah Kate Devitt,Normative Epistemology for Lethal Autonomous Weapons Systems,"30 pages, published in Lethal Autonomous Weapons: Re-Examining the
  Law and Ethics of Robotic Warfare. Oxford University Press 2021",,10.1093/oso/9780197546048.001.0001,,cs.HC cs.AI,http://creativecommons.org/licenses/by/4.0/,"  The rise of human-information systems, cybernetic systems, and increasingly
autonomous systems requires the application of epistemic frameworks to machines
and human-machine teams. This chapter discusses higher-order design principles
to guide the design, evaluation, deployment, and iteration of Lethal Autonomous
Weapons Systems (LAWS) based on epistemic models. Epistemology is the study of
knowledge. Epistemic models consider the role of accuracy, likelihoods,
beliefs, competencies, capabilities, context, and luck in the justification of
actions and the attribution of knowledge. The aim is not to provide ethical
justification for or against LAWS, but to illustrate how epistemological
frameworks can be used in conjunction with moral apparatus to guide the design
and deployment of future systems. The models discussed in this chapter aim to
make Article 36 reviews of LAWS systematic, expedient, and evaluable. A
Bayesian virtue epistemology is proposed to enable justified actions under
uncertainty that meet the requirements of the Laws of Armed Conflict and
International Humanitarian Law. Epistemic concepts can provide some of the
apparatus to meet explainability and transparency requirements in the
development, evaluation, deployment, and review of ethical AI.
","[{'version': 'v1', 'created': 'Mon, 25 Oct 2021 13:13:42 GMT'}]",2021-10-26,"[['Devitt', 'Susannah Kate', '']]","['epistemology', 'Bayesian epistemology', 'virtue epistemology']"
12031,2004.11018,Vojtech Mrazek,"David Hodan, Vojtech Mrazek, Zdenek Vasicek","Semantically-Oriented Mutation Operator in Cartesian Genetic Programming
  for Evolutionary Circuit Design","Accepted for Genetic and Evolutionary Computation Conference (GECCO
  '20), July 8--12, 2020, Canc\'un, Mexico",,10.1145/3377930.3390188,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite many successful applications, Cartesian Genetic Programming (CGP)
suffers from limited scalability, especially when used for evolutionary circuit
design. Considering the multiplier design problem, for example, the 5x5-bit
multiplier represents the most complex circuit evolved from a randomly
generated initial population. The efficiency of CGP highly depends on the
performance of the point mutation operator, however, this operator is purely
stochastic. This contrasts with the recent developments in Genetic Programming
(GP), where advanced informed approaches such as semantic-aware operators are
incorporated to improve the search space exploration capability of GP. In this
paper, we propose a semantically-oriented mutation operator (SOMO) suitable for
the evolutionary design of combinational circuits. SOMO uses semantics to
determine the best value for each mutated gene. Compared to the common CGP and
its variants as well as the recent versions of Semantic GP, the proposed method
converges on common Boolean benchmarks substantially faster while keeping the
phenotype size relatively small. The successfully evolved instances presented
in this paper include 10-bit parity, 10+10-bit adder and 5x5-bit multiplier.
The most complex circuits were evolved in less than one hour with a
single-thread implementation running on a common CPU.
","[{'version': 'v1', 'created': 'Thu, 23 Apr 2020 08:15:48 GMT'}]",2020-04-24,"[['Hodan', 'David', ''], ['Mrazek', 'Vojtech', ''], ['Vasicek', 'Zdenek', '']]","['cartesian genetic programming', 'semantic operator', 'semantic mutation', 'evolutionary circuit design']"
12032,2009.11182,Tarik A. Rashid,Chnoor M. Rahman and Tarik A. Rashid,"A new evolutionary algorithm: Learner performance based behavior
  algorithm","17 pages. Egyptian Informatics Journal, 2020",,10.1016/j.eij.2020.08.003,,cs.CY cs.NE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  A novel evolutionary algorithm called learner performance based behavior
algorithm (LPB) is proposed in this article. The basic inspiration of LPB
originates from the process of accepting graduated learners from high school in
different departments at university. In addition, the changes those learners
should do in their studying behaviors to improve their study level at
university. The most important stages of optimization; exploitation and
exploration are outlined by designing the process of accepting graduated
learners from high school to university and the procedure of improving the
learner's studying behavior at university to improve the level of their study.
To show the accuracy of the proposed algorithm, it is evaluated against a
number of test functions, such as traditional benchmark functions, CEC-C06 2019
test functions, and a real-world case study problem. The results of the
proposed algorithm are then compared to the DA, GA, and PSO. The proposed
algorithm produced superior results in most of the cases and comparative in
some others. It is proved that the algorithm has a great ability to deal with
the large optimization problems comparing to the DA, GA, and PSO. The overall
results proved the ability of LPB in improving the initial population and
converging towards the global optima. Moreover, the results of the proposed
work are proved statistically.
","[{'version': 'v1', 'created': 'Sat, 5 Sep 2020 04:17:35 GMT'}]",2020-09-24,"[['Rahman', 'Chnoor M.', ''], ['Rashid', 'Tarik A.', '']]","['Evolutionary Algorithms', 'Genetic Algorithm', 'LPB', 'Learner Performance Based Behavior Algorithm', 'Optimization', 'Metaheuristic Optimization Algorithm']"
12033,2107.05005,Yi-Geng Hong,"Yi-Geng Hong, Hui-Chu Xiao, Wan-Lei Zhao",Towards Accurate Localization by Instance Search,Accepted by ACM MM 2021 as Oral,,10.1145/3474085.3475530,,cs.CV cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Visual object localization is the key step in a series of object detection
tasks. In the literature, high localization accuracy is achieved with the
mainstream strongly supervised frameworks. However, such methods require
object-level annotations and are unable to detect objects of unknown
categories. Weakly supervised methods face similar difficulties. In this paper,
a self-paced learning framework is proposed to achieve accurate object
localization on the rank list returned by instance search. The proposed
framework mines the target instance gradually from the queries and their
corresponding top-ranked search results. Since a common instance is shared
between the query and the images in the rank list, the target visual instance
can be accurately localized even without knowing what the object category is.
In addition to performing localization on instance search, the issue of
few-shot object detection is also addressed under the same framework. Superior
performance over state-of-the-art methods is observed on both tasks.
","[{'version': 'v1', 'created': 'Sun, 11 Jul 2021 10:03:31 GMT'}, {'version': 'v2', 'created': 'Sat, 7 Aug 2021 14:58:34 GMT'}]",2021-08-10,"[['Hong', 'Yi-Geng', ''], ['Xiao', 'Hui-Chu', ''], ['Zhao', 'Wan-Lei', '']]","['Instance Search', 'Content-based Image Retrieval', 'Few-Shot ObjectDetection', 'Computer Vision']"
12034,1902.03155,Timo Nolle,"Timo Nolle and Stefan Luettgen and Alexander Seeliger and Max
  M\""uhlh\""auser",BINet: Multi-perspective Business Process Anomaly Classification,,,10.1016/j.is.2019.101458,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce BINet, a neural network architecture for
real-time multi-perspective anomaly detection in business process event logs.
BINet is designed to handle both the control flow and the data perspective of a
business process. Additionally, we propose a set of heuristics for setting the
threshold of an anomaly detection algorithm automatically. We demonstrate that
BINet can be used to detect anomalies in event logs not only on a case level
but also on event attribute level. Finally, we demonstrate that a simple set of
rules can be used to utilize the output of BINet for anomaly classification. We
compare BINet to eight other state-of-the-art anomaly detection algorithms and
evaluate their performance on an elaborate data corpus of 29 synthetic and 15
real-life event logs. BINet outperforms all other methods both on the synthetic
as well as on the real-life datasets.
","[{'version': 'v1', 'created': 'Fri, 8 Feb 2019 15:48:29 GMT'}]",2019-11-05,"[['Nolle', 'Timo', ''], ['Luettgen', 'Stefan', ''], ['Seeliger', 'Alexander', ''], ['Mühlhäuser', 'Max', '']]","['Business Process Management', 'Anomaly Detection', 'ArtificialProcess Intelligence', 'Deep Learning', 'Recurrent Neural Networks']"
12035,2108.06207,Roy Ka-Wei Lee,"Rui Cao, Ziqing Fan, Roy Ka-Wei Lee, Wen-Haw Chong, Jing Jiang",Disentangling Hate in Online Memes,Paper accepted in ACM Multimedia 2021,,10.1145/3474085.3475625,,cs.IR cs.CL cs.MM,http://creativecommons.org/licenses/by/4.0/,"  Hateful and offensive content detection has been extensively explored in a
single modality such as text. However, such toxic information could also be
communicated via multimodal content such as online memes. Therefore, detecting
multimodal hateful content has recently garnered much attention in academic and
industry research communities. This paper aims to contribute to this emerging
research topic by proposing DisMultiHate, which is a novel framework that
performed the classification of multimodal hateful content. Specifically,
DisMultiHate is designed to disentangle target entities in multimodal memes to
improve hateful content classification and explainability. We conduct extensive
experiments on two publicly available hateful and offensive memes datasets. Our
experiment results show that DisMultiHate is able to outperform
state-of-the-art unimodal and multimodal baselines in the hateful meme
classification task. Empirical case studies were also conducted to demonstrate
DisMultiHate's ability to disentangle target entities in memes and ultimately
showcase DisMultiHate's explainability of the multimodal hateful content
classification task.
","[{'version': 'v1', 'created': 'Mon, 9 Aug 2021 06:46:28 GMT'}]",2021-08-16,"[['Cao', 'Rui', ''], ['Fan', 'Ziqing', ''], ['Lee', 'Roy Ka-Wei', ''], ['Chong', 'Wen-Haw', ''], ['Jiang', 'Jing', '']]","['hate speech', 'hateful memes', 'multimodal', 'social media mining']"
12036,cs/0412025,Kevin Wortman,David Eppstein and Kevin A. Wortman,Minimum Dilation Stars,"6 pages, 3 figures","Comp. Geom. Theory and Appl. 37(1):27-37, 2007",10.1016/j.comgeo.2006.05.007,,cs.CG,,"  The dilation of a Euclidean graph is defined as the ratio of distance in the
graph divided by distance in R^d. In this paper we consider the problem of
positioning the root of a star such that the dilation of the resulting star is
minimal. We present a deterministic O(n log n)-time algorithm for evaluating
the dilation of a given star; a randomized O(n log n) expected-time algorithm
for finding an optimal center in R^d; and for the case d=2, a randomized O(n
2^(alpha(n)) log^2 n) expected-time algorithm for finding an optimal center
among the input points.
","[{'version': 'v1', 'created': 'Tue, 7 Dec 2004 01:39:36 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Mar 2005 05:19:33 GMT'}, {'version': 'v3', 'created': 'Wed, 16 Mar 2005 03:21:03 GMT'}]",2007-06-14,"[['Eppstein', 'David', ''], ['Wortman', 'Kevin A.', '']]","['Facility location', 'quasiconvex program m ing', 'dilation', 'stretchfactor', 'Euclidean graphs']"
12037,2205.15097,Loreto Pescosolido,"Loreto Pescosolido, Marco Conti, Andrea Passarella","On the impact of the physical layer model on the performance of
  D2D-offloading in vehicular environments",,"Ad Hoc Networks, Volume 81, December 2018, Pages 197-210",10.1016/j.adhoc.2018.07.019,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Offloading data traffic from Infrastructure-to-Device (I2D) to
Device-to-Device (D2D) communications is a powerful tool for reducing
congestion, energy consumption, and spectrum usage of mobile cellular networks.
Prior network-level studies on D2D data offloading focus on high level
performance metrics as the offloading efficiency, and take into account the
radio propagation aspects by using simplistic wireless channel models. We
consider a D2D data offloading protocol tailored to highly dynamic scenarios as
vehicular environments, and evaluate its performance focusing on physical layer
aspects, like energy consumption and spectral efficiency. We do this by taking
into account more realistic models of the wireless channel, with respect to the
simplistic ones generally used in the previous studies. Our objective is
twofold: first, to quantify the performance gain of the considered D2D
offloading protocol with respect to a classic cellular network, based on I2D
communications, in terms of energy consumption and spectral efficiency. Second,
to show that using simplistic channel models may prevent to accurately evaluate
the performance gain. Additionally, the use of more elaborated models allows to
obtain insightful information on relevant system-level parameters settings,
which would not be possible to obtain by using simple models. The considered
channel models have been proposed and validated, in the recent years, through
large-scale measurements campaigns.
  Our results show that the considered protocol is able to achieve a reduction
in the energy consumption of up to 35%, and an increase in the system spectral
efficiency of 50%, with respect to the benchmark cellular system. The use of
different channel models in evaluating these metrics may result, in the worst
case, in a sixfold underestimation of the achieved improvement.
","[{'version': 'v1', 'created': 'Mon, 30 May 2022 13:41:46 GMT'}]",2022-05-31,"[['Pescosolido', 'Loreto', ''], ['Conti', 'Marco', ''], ['Passarella', 'Andrea', '']]","['D2D data offloading', 'caching', 'vehicular networks']"
12038,2012.10206,"Michael Schr\""oder","Michael Schr\""oder and J\""urgen Cito",An Empirical Investigation of Command-Line Customization,,"Empir Software Eng 27, 30 (2022)",10.1007/s10664-021-10036-y,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  The interactive command line, also known as the shell, is a prominent
mechanism used extensively by a wide range of software professionals
(engineers, system administrators, data scientists, etc.). Shell customizations
can therefore provide insight into the tasks they repeatedly perform, how well
the standard environment supports those tasks, and ways in which the
environment could be productively extended or modified. To characterize the
patterns and complexities of command-line customization, we mined the
collective knowledge of command-line users by analyzing more than 2.2 million
shell alias definitions found on GitHub. Shell aliases allow command-line users
to customize their environment by defining arbitrarily complex command
substitutions. Using inductive coding methods, we found three types of aliases
that each enable a number of customization practices: Shortcuts (for nicknaming
commands, abbreviating subcommands, and bookmarking locations), Modifications
(for substituting commands, overriding defaults, colorizing output, and
elevating privilege), and Scripts (for transforming data and chaining
subcommands). We conjecture that identifying common customization practices can
point to particular usability issues within command-line programs, and that a
deeper understanding of these practices can support researchers and tool
developers in designing better user experiences. In addition to our analysis,
we provide an extensive reproducibility package in the form of a curated
dataset together with well-documented computational notebooks enabling further
knowledge discovery and a basis for learning approaches to improve command-line
workflows.
","[{'version': 'v1', 'created': 'Fri, 18 Dec 2020 13:00:41 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Aug 2021 15:12:45 GMT'}]",2022-02-03,"[['Schröder', 'Michael', ''], ['Cito', 'Jürgen', '']]","['command line', 'customization practices', 'collective knowledge', 'inductive coding']"
12039,1807.08576,Paulius Juodisius,"Paulius Juodisius (IT University of Copenhagen, Denmark), Atrisha
  Sarkar (University of Waterloo, Canada), Raghava Rao Mukkamala (Department of
  Technology, Kristiania University College, Norway), Michal Antkiewicz
  (University of Waterloo, Canada), Krzysztof Czarnecki (University of
  Waterloo, Canada), Andrzej Wasowski (IT University of Copenhagen, Denmark)","Clafer: Lightweight Modeling of Structure, Behaviour, and Variability",,"The Art, Science, and Engineering of Programming, 2019, Vol. 3,
  Issue 1, Article 2",10.22152/programming-journal.org/2019/3/2,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Embedded software is growing fast in size and complexity, leading to intimate
mixture of complex architectures and complex control. Consequently, software
specification requires modeling both structures and behaviour of systems.
Unfortunately, existing languages do not integrate these aspects well, usually
prioritizing one of them. It is common to develop a separate language for each
of these facets. In this paper, we contribute Clafer: a small language that
attempts to tackle this challenge. It combines rich structural modeling with
state of the art behavioural formalisms. We are not aware of any other modeling
language that seamlessly combines these facets common to system and software
modeling. We show how Clafer, in a single unified syntax and semantics, allows
capturing feature models (variability), component models, discrete control
models (automata) and variability encompassing all these aspects. The language
is built on top of first order logic with quantifiers over basic entities (for
modeling structures) combined with linear temporal logic (for modeling
behaviour). On top of this semantic foundation we build a simple but expressive
syntax, enriched with carefully selected syntactic expansions that cover
hierarchical modeling, associations, automata, scenarios, and Dwyer's property
patterns. We evaluate Clafer using a power window case study, and comparing it
against other notations that substantially overlap with its scope (SysML, AADL,
Temporal OCL and Live Sequence Charts), discussing benefits and perils of using
a single notation for the purpose.
","[{'version': 'v1', 'created': 'Mon, 23 Jul 2018 13:01:09 GMT'}]",2018-08-01,"[['Juodisius', 'Paulius', '', 'IT University of Copenhagen, Denmark'], ['Sarkar', 'Atrisha', '', 'University of Waterloo, Canada'], ['Mukkamala', 'Raghava Rao', '', 'Department of\n  Technology, Kristiania University College, Norway'], ['Antkiewicz', 'Michal', '', 'University of Waterloo, Canada'], ['Czarnecki', 'Krzysztof', '', 'University of\n  Waterloo, Canada'], ['Wasowski', 'Andrzej', '', 'IT University of Copenhagen, Denmark']]","['Language Design', 'Feature Modeling', 'Variability Modeling', 'Behaviour modeling', 'Semantics']"
12040,1812.09718,Francesco Calimeri,"Francesco Calimeri, Simona Perri, Jessica Zangari",Optimizing Answer Set Computation via Heuristic-Based Decomposition,"28 pages, 6 figures, 4 tables, BEST PAPER AWARD at PADL 2018 (Los
  Angeles, CA, USA), Under consideration in Theory and Practice of Logic
  Programming (TPLP)",Theory and Practice of Logic Programming 19 (2019) 603-628,10.1017/S1471068419000036,,cs.AI cs.CL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Answer Set Programming (ASP) is a purely declarative formalism developed in
the field of logic programming and nonmonotonic reasoning: computational
problems are encoded by logic programs whose answer sets, corresponding to
solutions, are computed by an ASP system. Different, semantically equivalent,
programs can be defined for the same problem; however, performance of systems
evaluating them might significantly vary. We propose an approach for
automatically transforming an input logic program into an equivalent one that
can be evaluated more efficiently. One can make use of existing
tree-decomposition techniques for rewriting selected rules into a set of
multiple ones; the idea is to guide and adaptively apply them on the basis of
proper new heuristics, to obtain a smart rewriting algorithm to be integrated
into an ASP system. The method is rather general: it can be adapted to any
system and implement different preference policies. Furthermore, we define a
set of new heuristics tailored at optimizing grounding, one of the main phases
of the ASP computation; we use them in order to implement the approach into the
ASP system DLV, in particular into its grounding subsystem I-DLV, and carry out
an extensive experimental activity for assessing the impact of the proposal.
Under consideration in Theory and Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Sun, 23 Dec 2018 14:35:58 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Jan 2019 17:27:16 GMT'}]",2020-02-19,"[['Calimeri', 'Francesco', ''], ['Perri', 'Simona', ''], ['Zangari', 'Jessica', '']]","['Answer Set Programming', 'Artificial Intelligence', 'ASP in practice']"
12041,2205.06513,Christin Katharina Kreutz,"Christin Katharina Kreutz, Martin Blum, Ralf Schenkel","SchenQL: A query language for bibliographic data with aggregations and
  domain-specific functions","Accepted at JCDL'22 as a demo, 5 pages, 4 figures",,10.1145/3529372.3533282,,cs.DL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current search interfaces of digital libraries are not suitable to satisfy
complex or convoluted information needs directly, when it comes to cases such
as ""Find authors who only recently started working on a topic"". They might
offer possibilities to obtain this information only by requiring vast user
interaction. We present SchenQL, a web interface of a domain-specific query
language on bibliographic metadata, which offers information search and
exploration by query formulation and navigation in the system. Our system
focuses on supporting aggregation of data and providing specialised domain
dependent functions while being suitable for domain experts as well as casual
users of digital libraries.
","[{'version': 'v1', 'created': 'Fri, 13 May 2022 08:40:23 GMT'}]",2022-05-16,"[['Kreutz', 'Christin Katharina', ''], ['Blum', 'Martin', ''], ['Schenkel', 'Ralf', '']]","['domain-specific query language', 'digital libraries', 'query formulation']"
12042,2012.01162,Kenn Migan Vincent Gumonan,"Kenn Migan Vincent C. Gumonan, and Aleta C. Fabregas",ASIAVR: Asian Studies Virtual Reality Game a Learning Tool,"14 pages, 10 figures, presented in International Science, Technology
  and Engineering Conference ISTEC 2019, and published in International Journal
  of Computing Sciences Research",,10.25147/ijcsr.2017.001.1.53,,cs.CY cs.HC,http://creativecommons.org/licenses/by/4.0/,"  The study aims to develop an application that will serve as an alternative
learning tool for learning Asian Studies. The delivery of lessons into a
virtual reality game depends on the pace of students. The developed application
comprises several more features that enable users to get valuable information
from an immersive environment. The researchers used Rapid Application
Development (RAD) in developing the application. It follows phases such as
requirement planning, user design, construction, and cutover. Two sets of
questionnaires were developed, one for the teachers and another for the
students. Then, testing and evaluation were conducted through purposive
sampling to select the respondents. The application was overall rated as 3.56
which is verbally interpreted as very good. The result was based on the system
evaluation using ISO 9126 in terms of functionality, usability, content,
reliability, and performance. The developed application meets the objectives to
provide an alternative learning tool for learning Asian Studies. The
application is well commended and accepted by the end-users to provide an
interactive and immersive environment for students to learn at their own pace.
Further enhancement of the audio, gameplay, and graphics of the tool. Schools
should take into consideration the adoption of the Asian Studies Virtual
Reality is a good alternative tool for their teachers and students to teach and
learn Asian Studies. The use of more 3D objects relevant to the given
information to enhance the game experience may be considered. A databank for
the quiz questions that will be loaded into the game should also be considered.
","[{'version': 'v1', 'created': 'Mon, 23 Nov 2020 04:24:03 GMT'}]",2020-12-03,"[['Gumonan', 'Kenn Migan Vincent C.', ''], ['Fabregas', 'Aleta C.', '']]","['virtual reality', 'immersive environment', 'android-mobile game', 'learning tool', 'Asian studies   INTRODUCTION']"
12043,2212.05750,Fabian Fagerholm,"Vihtori M\""antyl\""a, Bettina Lehtel\""a, Fabian Fagerholm","The Viability of Continuous Experimentation in Early-Stage Software
  Startups: A Descriptive Multiple-Case Study","23rd International Conference on Product-Focused Software Process
  Improvement (PROFES 2022)",,10.1007/978-3-031-21388-5_10,,cs.SE,http://creativecommons.org/licenses/by-sa/4.0/,"  Background: Continuous experimentation (CE) has been proposed as a
data-driven approach to software product development. Several challenges with
this approach have been described in large organisations, but its application
in smaller companies with early-stage products remains largely unexplored.
Aims: The goal of this study is to understand what factors could affect the
adoption of CE in early-stage software startups. Method: We present a
descriptive multiple-case study of five startups in Finland which differ in
their utilisation of experimentation. Results: We find that practices often
mentioned as prerequisites for CE, such as iterative development and continuous
integration and delivery, were used in the case companies. CE was not widely
recognised or used as described in the literature. Only one company performed
experiments and used experimental data systematically. Conclusions: Our study
indicates that small companies may be unlikely to adopt CE unless 1) at least
some company employees have prior experience with the practice, 2) the
company's limited available resources are not exceeded by its adoption, and 3)
the practice solves a problem currently experienced by the company, or the
company perceives almost immediate benefit of adopting it. We discuss
implications for advancing CE in early-stage startups and outline directions
for future research on the approach.
","[{'version': 'v1', 'created': 'Mon, 12 Dec 2022 08:01:28 GMT'}]",2022-12-13,"[['Mäntylä', 'Vihtori', ''], ['Lehtelä', 'Bettina', ''], ['Fagerholm', 'Fabian', '']]","['continuous experimentation', 'new product development', 'startup', 'continuous software engineering', 'case study']"
12044,2205.10798,Shuo Li,"Shuo Li, Xiayan Ji, Edgar Dobriban, Oleg Sokolsky, Insup Lee",PAC-Wrap: Semi-Supervised PAC Anomaly Detection,Accepted by SIGKDD 2022,,10.1145/3534678.3539408,,cs.LG math.ST stat.ML stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Anomaly detection is essential for preventing hazardous outcomes for
safety-critical applications like autonomous driving. Given their
safety-criticality, these applications benefit from provable bounds on various
errors in anomaly detection. To achieve this goal in the semi-supervised
setting, we propose to provide Probably Approximately Correct (PAC) guarantees
on the false negative and false positive detection rates for anomaly detection
algorithms. Our method (PAC-Wrap) can wrap around virtually any existing
semi-supervised and unsupervised anomaly detection method, endowing it with
rigorous guarantees. Our experiments with various anomaly detectors and
datasets indicate that PAC-Wrap is broadly effective.
","[{'version': 'v1', 'created': 'Sun, 22 May 2022 11:05:49 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Jun 2022 15:27:09 GMT'}]",2022-06-22,"[['Li', 'Shuo', ''], ['Ji', 'Xiayan', ''], ['Dobriban', 'Edgar', ''], ['Sokolsky', 'Oleg', ''], ['Lee', 'Insup', '']]","['Anomaly Detection', 'Semi-Supervised Learning', 'Statistical MachineLearning', 'PAC Learning']"
12045,2002.06810,Zhaohui Yang,"Zhaohui Yang, Yunhe Wang, Chang Xu, Peng Du, Chao Xu, Chunjing Xu, Qi
  Tian",Discernible Image Compression,Accepted by ACMMM 2020,,10.1145/3394171.3413968,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image compression, as one of the fundamental low-level image processing
tasks, is very essential for computer vision. Tremendous computing and storage
resources can be preserved with a trivial amount of visual information.
Conventional image compression methods tend to obtain compressed images by
minimizing their appearance discrepancy with the corresponding original images,
but pay little attention to their efficacy in downstream perception tasks,
e.g., image recognition and object detection. Thus, some of compressed images
could be recognized with bias. In contrast, this paper aims to produce
compressed images by pursuing both appearance and perceptual consistency. Based
on the encoder-decoder framework, we propose using a pre-trained CNN to extract
features of the original and compressed images, and making them similar. Thus
the compressed images are discernible to subsequent tasks, and we name our
method as Discernible Image Compression (DIC). In addition, the maximum mean
discrepancy (MMD) is employed to minimize the difference between feature
distributions. The resulting compression network can generate images with high
image quality and preserve the consistent perception in the feature domain, so
that these images can be well recognized by pre-trained machine learning
models. Experiments on benchmarks demonstrate that images compressed by using
the proposed method can also be well recognized by subsequent visual
recognition and detection models. For instance, the mAP value of compressed
images by DIC is about 0.6% higher than that of using compressed images by
conventional methods.
","[{'version': 'v1', 'created': 'Mon, 17 Feb 2020 07:35:08 GMT'}, {'version': 'v2', 'created': 'Sun, 30 Aug 2020 13:54:31 GMT'}, {'version': 'v3', 'created': 'Tue, 8 Sep 2020 00:44:12 GMT'}]",2020-09-09,"[['Yang', 'Zhaohui', ''], ['Wang', 'Yunhe', ''], ['Xu', 'Chang', ''], ['Du', 'Peng', ''], ['Xu', 'Chao', ''], ['Xu', 'Chunjing', ''], ['Tian', 'Qi', '']]","['image compression', 'neural networks', 'visual recognition', 'perceptualconsistency']"
12046,2002.08136,Daniel Molina Dr.,"Daniel Molina and Javier Poyatos and Javier Del Ser and Salvador
  Garc\'ia and Amir Hussain and Francisco Herrera","Comprehensive Taxonomies of Nature- and Bio-inspired Optimization:
  Inspiration versus Algorithmic Behavior, Critical Analysis and
  Recommendations","83 pages, 6 figures",Cognitive Computation 12:5 (2020) 897-939,10.1007/s12559-020-09730-8,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, a great variety of nature- and bio-inspired algorithms has
been reported in the literature. This algorithmic family simulates different
biological processes observed in Nature in order to efficiently address complex
optimization problems. In the last years the number of bio-inspired
optimization approaches in literature has grown considerably, reaching
unprecedented levels that dark the future prospects of this field of research.
This paper addresses this problem by proposing two comprehensive,
principle-based taxonomies that allow researchers to organize existing and
future algorithmic developments into well-defined categories, considering two
different criteria: the source of inspiration and the behavior of each
algorithm. Using these taxonomies we review more than three hundred
publications dealing with nature-inspired and bio-inspired algorithms, and
proposals falling within each of these categories are examined, leading to a
critical summary of design trends and similarities between them, and the
identification of the most similar classical algorithm for each reviewed paper.
From our analysis we conclude that a poor relationship is often found between
the natural inspiration of an algorithm and its behavior. Furthermore,
similarities in terms of behavior between different algorithms are greater than
what is claimed in their public disclosure: specifically, we show that more
than one-third of the reviewed bio-inspired solvers are versions of classical
algorithms. Grounded on the conclusions of our critical analysis, we give
several recommendations and points of improvement for better methodological
practices in this active and growing research field.
","[{'version': 'v1', 'created': 'Wed, 19 Feb 2020 12:34:45 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Feb 2020 09:27:38 GMT'}, {'version': 'v3', 'created': 'Fri, 30 Apr 2021 13:54:37 GMT'}, {'version': 'v4', 'created': 'Sat, 7 May 2022 12:08:01 GMT'}]",2022-05-10,"[['Molina', 'Daniel', ''], ['Poyatos', 'Javier', ''], ['Del Ser', 'Javier', ''], ['García', 'Salvador', ''], ['Hussain', 'Amir', ''], ['Herrera', 'Francisco', '']]","['Nature-inspired algorithms', 'bio-inspired optimization', 'taxonomy', 'classification']"
12047,1807.08654,Evan Bollig,"Evan F. Bollig, James C. Wilgenbusch","From Bare Metal to Virtual: Lessons Learned when a Supercomputing
  Institute Deploys its First Cloud","8 pages, 5 figures, PEARC '18: Practice and Experience in Advanced
  Research Computing, July 22--26, 2018, Pittsburgh, PA, USA",,10.1145/3219104.3219164,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  As primary provider for research computing services at the University of
Minnesota, the Minnesota Supercomputing Institute (MSI) has long been
responsible for serving the needs of a user-base numbering in the thousands.
  In recent years, MSI---like many other HPC centers---has observed a growing
need for self-service, on-demand, data-intensive research, as well as the
emergence of many new controlled-access datasets for research purposes. In
light of this, MSI constructed a new on-premise cloud service, named Stratus,
which is architected from the ground up to easily satisfy data-use agreements
and fill four gaps left by traditional HPC. The resulting OpenStack cloud,
constructed from HPC-specific compute nodes and backed by Ceph storage, is
designed to fully comply with controls set forth by the NIH Genomic Data
Sharing Policy.
  Herein, we present twelve lessons learned during the ambitious sprint to take
Stratus from inception and into production in less than 18 months. Important,
and often overlooked, components of this timeline included the development of
new leadership roles, staff and user training, and user support documentation.
Along the way, the lessons learned extended well beyond the technical
challenges often associated with acquiring, configuring, and maintaining
large-scale systems.
","[{'version': 'v1', 'created': 'Mon, 23 Jul 2018 14:54:53 GMT'}]",2018-07-24,"[['Bollig', 'Evan F.', ''], ['Wilgenbusch', 'James C.', '']]","['ACM proceedings', 'Cloud Infrastructure', 'Controlled-Access Data', 'OpenStack', 'Cost-Recovery', 'Lessons Learned']"
12048,1909.12038,Qimai Li,"Qimai Li, Xiaotong Zhang, Han Liu, Quanyu Dai, Xiao-Ming Wu","Dimensionwise Separable 2-D Graph Convolution for Unsupervised and
  Semi-Supervised Learning on Graphs","Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery
  and Data Mining (KDD '21)",,10.1145/3447548.3467413,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph convolutional neural networks (GCN) have been the model of choice for
graph representation learning, which is mainly due to the effective design of
graph convolution that computes the representation of a node by aggregating
those of its neighbors. However, existing GCN variants commonly use 1-D graph
convolution that solely operates on the object link graph without exploring
informative relational information among object attributes. This significantly
limits their modeling capability and may lead to inferior performance on noisy
and sparse real-world networks. In this paper, we explore 2-D graph convolution
to jointly model object links and attribute relations for graph representation
learning. Specifically, we propose a computationally efficient dimensionwise
separable 2-D graph convolution (DSGC) for filtering node features.
Theoretically, we show that DSGC can reduce intra-class variance of node
features on both the object dimension and the attribute dimension to learn more
effective representations. Empirically, we demonstrate that by modeling
attribute relations, DSGC achieves significant performance gain over
state-of-the-art methods for node classification and clustering on a variety of
real-world networks. The source code for reproducing the experimental results
is available at https://github.com/liqimai/DSGC.
","[{'version': 'v1', 'created': 'Thu, 26 Sep 2019 11:47:54 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Sep 2019 18:19:39 GMT'}, {'version': 'v3', 'created': 'Fri, 21 Feb 2020 16:22:25 GMT'}, {'version': 'v4', 'created': 'Sun, 21 Jun 2020 17:44:03 GMT'}, {'version': 'v5', 'created': 'Wed, 9 Jun 2021 10:33:41 GMT'}]",2021-06-10,"[['Li', 'Qimai', ''], ['Zhang', 'Xiaotong', ''], ['Liu', 'Han', ''], ['Dai', 'Quanyu', ''], ['Wu', 'Xiao-Ming', '']]","['2-D graph convolution', 'node classification', 'node clustering', 'variance reduction']"
12049,1902.03524,Stephen Balaban,Stephen Balaban,Deep learning and face recognition: the state of the art,"Published May 15th 2015 in the Proc. SPIE 9457, Biometric and
  Surveillance Technology for Human and Activity Identification XII, 94570B;
  Ioannis A. Kakadiaris; Ajay Kumar; Walter J. Scheirer, Editor(s)","Proc. SPIE 9457, Biometric and Surveillance Technology for Human
  and Activity Identification XII, 94570B (15 May 2015)",10.1117/12.2181526,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep Neural Networks (DNNs) have established themselves as a dominant
technique in machine learning. DNNs have been top performers on a wide variety
of tasks including image classification, speech recognition, and face
recognition. Convolutional neural networks (CNNs) have been used in nearly all
of the top performing methods on the Labeled Faces in the Wild (LFW) dataset.
In this talk and accompanying paper, I attempt to provide a review and summary
of the deep learning techniques used in the state-of-the-art. In addition, I
highlight the need for both larger and more challenging public datasets to
benchmark these systems. The high accuracy (99.63% for FaceNet at the time of
publishing) and utilization of outside data (hundreds of millions of images in
the case of Google's FaceNet) suggest that current face verification benchmarks
such as LFW may not be challenging enough, nor provide enough data, for current
techniques. There exist a variety of organizations with mobile photo sharing
applications that would be capable of releasing a very large scale and highly
diverse dataset of facial images captured on mobile devices. Such an ""ImageNet
for Face Recognition"" would likely receive a warm welcome from researchers and
practitioners alike.
","[{'version': 'v1', 'created': 'Sun, 10 Feb 2019 01:07:15 GMT'}]",2019-02-12,"[['Balaban', 'Stephen', '']]","['Deep Learning', 'Feature Learning', 'Representation Learning', 'Facial Recognition', 'Face verification', 'Face identification', 'biometrics']"
12050,2208.07604,Yang Tan,"Yang, Tan",Achieve Fully Decentralized End to End Encryption Meeting via Blockchain,,,10.1145/3532640.3532648,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Zoom Meeting is an enterprise online video conferencing solution with
real-time messaging and content sharing. However, it's lack of privacy
protection since centralized Zoom servers are capable of monitoring user's
messages. Thereby, to solve the privacy problem, in May 2020, Zoom acquired
Keybase so that Keybase's team can help it to build end-to-end encryption
meeting while remaining Zoom's current scalability and high-performance.
Nonetheless, according to the latest released Zoom's whitepaper, even with the
new design of E2E (end to end) encryption meeting, the security threats can't
be erased completely since the new design is not fully decentralized.
  In this paper, we introduce a fully decentralized design of E2E encryption
meeting via blockchain technology. With this new design, Zoom's E2E meeting
privacy can be further improved.
","[{'version': 'v1', 'created': 'Tue, 16 Aug 2022 08:40:52 GMT'}]",2022-08-17,"[['Yang', '', ''], ['Tan', '', '']]","['Blockchain', 'Zoom Meeting', 'End-to-end encryption meeting', 'Decentralization']"
12051,1712.04544,Mark Scanlon,"David Lillis, Frank Breitinger and Mark Scanlon",Hierarchical Bloom Filter Trees for Approximate Matching,,,10.15394/jdfsl.2018.1489,,cs.CR cs.DS,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Bytewise approximate matching algorithms have in recent years shown
significant promise in de- tecting files that are similar at the byte level.
This is very useful for digital forensic investigators, who are regularly faced
with the problem of searching through a seized device for pertinent data. A
common scenario is where an investigator is in possession of a collection of
""known-illegal"" files (e.g. a collection of child abuse material) and wishes to
find whether copies of these are stored on the seized device. Approximate
matching addresses shortcomings in traditional hashing, which can only find
identical files, by also being able to deal with cases of merged files,
embedded files, partial files, or if a file has been changed in any way.
  Most approximate matching algorithms work by comparing pairs of files, which
is not a scalable approach when faced with large corpora. This paper
demonstrates the effectiveness of using a ""Hierarchical Bloom Filter Tree""
(HBFT) data structure to reduce the running time of
collection-against-collection matching, with a specific focus on the MRSH-v2
algorithm. Three experiments are discussed, which explore the effects of
different configurations of HBFTs. The proposed approach dramatically reduces
the number of pairwise comparisons required, and demonstrates substantial speed
gains, while maintaining effectiveness.
","[{'version': 'v1', 'created': 'Tue, 12 Dec 2017 21:44:18 GMT'}]",2022-11-15,"[['Lillis', 'David', ''], ['Breitinger', 'Frank', ''], ['Scanlon', 'Mark', '']]","['approximate matching', 'hierarchical bloom filter trees', 'mrsh-v2']"
12052,1506.07031,"Stefan D\""uck","Manfred Droste and Stefan D\""uck",Weighted Automata and Logics for Infinite Nested Words,"LATA 2014, 12 pages","Proc. of Language and Automata Theory and Applications (LATA
  2014), LNCS 8370, pp. 323-334. Springer (2014)",10.1007/978-3-319-04921-2_26,,cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nested words introduced by Alur and Madhusudan are used to capture structures
with both linear and hierarchical order, e.g. XML documents, without losing
valuable closure properties. Furthermore, Alur and Madhusudan introduced
automata and equivalent logics for both finite and infinite nested words, thus
extending B\""uchi's theorem to nested words. Recently, average and discounted
computations of weights in quantitative systems found much interest. Here, we
will introduce and investigate weighted automata models and weighted MSO logics
for infinite nested words. As weight structures we consider valuation monoids
which incorporate average and discounted computations of weights as well as the
classical semirings. We show that under suitable assumptions, two resp. three
fragments of our weighted logics can be transformed into each other. Moreover,
we show that the logic fragments have the same expressive power as weighted
nested word automata.
","[{'version': 'v1', 'created': 'Tue, 23 Jun 2015 14:39:21 GMT'}]",2015-06-24,"[['Droste', 'Manfred', ''], ['Dück', 'Stefan', '']]","['nested words', 'weighted automata', 'weighted logics', 'quantitative automata', 'valuation monoids']"
12053,2004.05589,Jithin Cheriyan,"Jithin Cheriyan, Bastin Tony Roy Savarimuthu, Stephen Cranefield","Norm violation in online communities -- A study of Stack Overflow
  comments","16 pages, 8 figures, 2 tables",,10.1007/978-3-030-72376-7_2,,cs.SI cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Norms are behavioral expectations in communities. Online communities are also
expected to abide by the rules and regulations that are expressed in the code
of conduct of a system. Even though community authorities continuously prompt
their users to follow the regulations, it is observed that hate speech and
abusive language usage are on the rise. In this paper, we quantify and analyze
the patterns of violations of normative behaviour among the users of Stack
Overflow (SO) - a well-known technical question-answer site for professionals
and enthusiast programmers, while posting a comment. Even though the site has
been dedicated to technical problem solving and debugging, hate speech as well
as posting offensive comments make the community ""toxic"". By identifying and
minimising various patterns of norm violations in different SO communities, the
community would become less toxic and thereby the community can engage more
effectively in its goal of knowledge sharing. Moreover, through automatic
detection of such comments, the authors can be warned by the moderators, so
that it is less likely to be repeated, thereby the reputation of the site and
community can be improved. Based on the comments extracted from two different
data sources on SO, this work first presents a taxonomy of norms that are
violated. Second, it demonstrates the sanctions for certain norm violations.
Third, it proposes a recommendation system that can be used to warn users that
they are about to violate a norm. This can help achieve norm adherence in
online communities.
","[{'version': 'v1', 'created': 'Sun, 12 Apr 2020 11:34:48 GMT'}]",2022-11-02,"[['Cheriyan', 'Jithin', ''], ['Savarimuthu', 'Bastin Tony Roy', ''], ['Cranefield', 'Stephen', '']]","['norms', 'norm identification', 'norm violation', 'norm signalling', 'sanctioning', 'Stack Overflow']"
12054,2202.12269,Amir Mosavi Prof,"Ardabili Sina, Leila Abdolalizadeh, Csaba Mako, Bernat Torok, Mosavi
  Amir","Systematic review of deep learning and machine learning for building
  energy","14 figures, 10 tables, accepted Frontiers in Energy Research:
  https://www.frontiersin.org/articles/10.3389/fenrg.2022.786027/abstract",,10.3389/fenrg.2022.786027,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The building energy (BE) management has an essential role in urban
sustainability and smart cities. Recently, the novel data science and
data-driven technologies have shown significant progress in analyzing the
energy consumption and energy demand data sets for a smarter energy management.
The machine learning (ML) and deep learning (DL) methods and applications, in
particular, have been promising for the advancement of the accurate and
high-performance energy models. The present study provides a comprehensive
review of ML and DL-based techniques applied for handling BE systems, and it
further evaluates the performance of these techniques. Through a systematic
review and a comprehensive taxonomy, the advances of ML and DL-based techniques
are carefully investigated, and the promising models are introduced. According
to the results obtained for energy demand forecasting, the hybrid and ensemble
methods are located in high robustness range, SVM-based methods are located in
good robustness limitation, ANN-based methods are located in medium robustness
limitation and linear regression models are located in low robustness
limitations. On the other hand, for energy consumption forecasting, DL-based,
hybrid, and ensemble-based models provided the highest robustness score. ANN,
SVM, and single ML models provided good and medium robustness and LR-based
models provided the lower robustness score. In addition, for energy load
forecasting, LR-based models provided the lower robustness score. The hybrid
and ensemble-based models provided a higher robustness score. The DL-based and
SVM-based techniques provided a good robustness score and ANN-based techniques
provided a medium robustness score.
","[{'version': 'v1', 'created': 'Wed, 23 Feb 2022 13:40:45 GMT'}]",2022-02-25,"[['Sina', 'Ardabili', ''], ['Abdolalizadeh', 'Leila', ''], ['Mako', 'Csaba', ''], ['Torok', 'Bernat', ''], ['Amir', 'Mosavi', '']]","['Deep learning', 'machine learning', 'building energy', 'energy demand', 'energy consumption', 'smart grid', 'internet of things', 'data science']"
12055,2202.03691,Cyril Onwubiko PhD,Cyril Onwubiko and Karim Ouazzane,"Challenges towards Building an effective Cyber Security Operations
  Centre","20 pages, 3 figures","International Journal On Cyber Situational Awareness (IJCSA), Vol.
  4, No.1, 2019, ISSN: 2057-2182, https://c-mric.com/100124",10.22619/IJCSA.2019.100124,,cs.CR cs.SI,http://creativecommons.org/licenses/by/4.0/,"  The increasing dependency of modern society on IT systems and infrastructures
for essential services (e.g. internet banking, vehicular network, health-IT,
etc.) coupled with the growing number of cyber incidents and security
vulnerabilities have made Cyber Security Operations Centre (CSOC) undoubtedly
vital. As such security operations monitoring is now an integral part of most
business operations. SOCs (used interchangeably as CSOCs) are responsible for
continuously and protectively monitoring business services, IT systems and
infrastructures to identify vulnerabilities, detect cyber-attacks, security
breaches, policy violations, and to respond to cyber incidents swiftly. They
must also ensure that security events and alerts are triaged and analysed,
while coordinating and managing cyber incidents to resolution. Because SOCs are
vital, it is also necessary that SOCs are effective. But unfortunately, the
effectiveness of SOCs are a widespread concern and a focus of boundless debate.
In this paper, we identify and discuss some of the pertinent challenges to
building an effective SOC. We investigate some of the factors contributing to
the inefficiencies in SOCs and explain some of the challenges they face.
Further, we provide and prioritise recommendations to addressing the identified
issues.
","[{'version': 'v1', 'created': 'Tue, 8 Feb 2022 07:24:53 GMT'}]",2022-02-09,"[['Onwubiko', 'Cyril', ''], ['Ouazzane', 'Karim', '']]","['Cyber Security Operations Centre', 'CSOC', 'SOC', 'Cyber Operations', 'Cyber Onboarding', 'Effective SOC & Challenges']"
12056,1909.06526,K. R. Jayaram,"K. R. Jayaram, Vinod Muthusamy, Parijat Dube, Vatche Ishakian, Chen
  Wang, Benjamin Herta, Scott Boag, Diana Arroyo, Asser Tantawi, Archit Verma,
  Falk Pollok, Rania Khalaf",FfDL : A Flexible Multi-tenant Deep Learning Platform,MIDDLEWARE 2019,,10.1145/3361525.3361538,,cs.DC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning (DL) is becoming increasingly popular in several application
domains and has made several new application features involving computer
vision, speech recognition and synthesis, self-driving automobiles, drug
design, etc. feasible and accurate. As a result, large scale on-premise and
cloud-hosted deep learning platforms have become essential infrastructure in
many organizations. These systems accept, schedule, manage and execute DL
training jobs at scale.
  This paper describes the design, implementation and our experiences with
FfDL, a DL platform used at IBM. We describe how our design balances
dependability with scalability, elasticity, flexibility and efficiency. We
examine FfDL qualitatively through a retrospective look at the lessons learned
from building, operating, and supporting FfDL; and quantitatively through a
detailed empirical evaluation of FfDL, including the overheads introduced by
the platform for various deep learning models, the load and performance
observed in a real case study using FfDL within our organization, the frequency
of various faults observed including unanticipated faults, and experiments
demonstrating the benefits of various scheduling policies. FfDL has been
open-sourced.
","[{'version': 'v1', 'created': 'Sat, 14 Sep 2019 04:02:45 GMT'}]",2019-09-17,"[['Jayaram', 'K. R.', ''], ['Muthusamy', 'Vinod', ''], ['Dube', 'Parijat', ''], ['Ishakian', 'Vatche', ''], ['Wang', 'Chen', ''], ['Herta', 'Benjamin', ''], ['Boag', 'Scott', ''], ['Arroyo', 'Diana', ''], ['Tantawi', 'Asser', ''], ['Verma', 'Archit', ''], ['Pollok', 'Falk', ''], ['Khalaf', 'Rania', '']]","['deep learning platform', 'fault tolerance', 'clusterscheduling', 'gang scheduling']"
12057,2102.01203,A. Feder Cooper,"A. Feder Cooper, Ellen Abrams",Emergent Unfairness in Algorithmic Fairness-Accuracy Trade-Off Research,AIES 2021 (Oral),,10.1145/3461702.3462519,,cs.CY cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Across machine learning (ML) sub-disciplines, researchers make explicit
mathematical assumptions in order to facilitate proof-writing. We note that,
specifically in the area of fairness-accuracy trade-off optimization
scholarship, similar attention is not paid to the normative assumptions that
ground this approach. Such assumptions presume that 1) accuracy and fairness
are in inherent opposition to one another, 2) strict notions of mathematical
equality can adequately model fairness, 3) it is possible to measure the
accuracy and fairness of decisions independent from historical context, and 4)
collecting more data on marginalized individuals is a reasonable solution to
mitigate the effects of the trade-off. We argue that such assumptions, which
are often left implicit and unexamined, lead to inconsistent conclusions: While
the intended goal of this work may be to improve the fairness of machine
learning models, these unexamined, implicit assumptions can in fact result in
emergent unfairness. We conclude by suggesting a concrete path forward toward a
potential resolution.
","[{'version': 'v1', 'created': 'Mon, 1 Feb 2021 22:02:14 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Apr 2021 22:33:05 GMT'}, {'version': 'v3', 'created': 'Tue, 7 Sep 2021 20:02:05 GMT'}]",2021-09-09,"[['Cooper', 'A. Feder', ''], ['Abrams', 'Ellen', '']]","['algorithmic fairness', 'machine learning', 'societal implications of AI']"
12058,2110.00855,Zifeng Wang,"Zifeng Wang, Jimeng Sun",SurvTRACE: Transformers for Survival Analysis with Competing Events,ACM-BCB 2022,,10.1145/3535508.3545521,,cs.LG cs.AI stat.ML,http://creativecommons.org/licenses/by/4.0/,"  In medicine, survival analysis studies the time duration to events of
interest such as mortality. One major challenge is how to deal with multiple
competing events (e.g., multiple disease diagnoses). In this work, we propose a
transformer-based model that does not make the assumption for the underlying
survival distribution and is capable of handling competing events, namely
SurvTRACE. We account for the implicit \emph{confounders} in the observational
setting in multi-events scenarios, which causes selection bias as the predicted
survival probability is influenced by irrelevant factors. To sufficiently
utilize the survival data to train transformers from scratch, multiple
auxiliary tasks are designed for multi-task learning. The model hence learns a
strong shared representation from all these tasks and in turn serves for better
survival analysis. We further demonstrate how to inspect the covariate
relevance and importance through interpretable attention mechanisms of
SurvTRACE, which suffices to great potential in enhancing clinical trial design
and new treatment development. Experiments on METABRIC, SUPPORT, and SEER data
with 470k patients validate the all-around superiority of our method.
","[{'version': 'v1', 'created': 'Sat, 2 Oct 2021 17:46:26 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Jun 2022 22:18:06 GMT'}]",2022-06-29,"[['Wang', 'Zifeng', ''], ['Sun', 'Jimeng', '']]","['survival analysis', 'competing events', 'transformers']"
12059,2112.08673,Olga Ibriaeva,"V. Sinitsin, O. Ibryaeva, V. Sakovskaya, V. Eremeeva","Intelligent Bearing Fault Diagnosis Method Combining Mixed Input and
  Hybrid CNN-MLP model",,,10.1016/j.ymssp.2022.109454,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Rolling bearings are one of the most widely used bearings in industrial
machines. Deterioration in the condition of rolling bearings can result in the
total failure of rotating machinery. AI-based methods are widely applied in the
diagnosis of rolling bearings. Hybrid NN-based methods have been shown to
achieve the best diagnosis results. Typically, raw data is generated from
accelerometers mounted on the machine housing. However, the diagnostic utility
of each signal is highly dependent on the location of the corresponding
accelerometer. This paper proposes a novel hybrid CNN-MLP model-based
diagnostic method which combines mixed input to perform rolling bearing
diagnostics. The method successfully detects and localizes bearing defects
using acceleration data from a shaft-mounted wireless acceleration sensor. The
experimental results show that the hybrid model is superior to the CNN and MLP
models operating separately, and can deliver a high detection accuracy of 99,6%
for the bearing faults compared to 98% for CNN and 81% for MLP models.
","[{'version': 'v1', 'created': 'Thu, 16 Dec 2021 07:26:22 GMT'}]",2022-07-20,"[['Sinitsin', 'V.', ''], ['Ibryaeva', 'O.', ''], ['Sakovskaya', 'V.', ''], ['Eremeeva', 'V.', '']]","['Condition monitoring', 'Fault diagnosis', 'Deep learning', 'Empirical Mode']"
12060,2003.08681,Andrew Adamatzky,"Eric Goles, Michail-Antisthenis Tsompanas, Andrew Adamatzky, Martin
  Tegelaar, Han A. B. Wosten, Genaro J. Martinez",Computational universality of fungal sandpile automata,,,10.1016/j.physleta.2020.126541,,cs.ET nlin.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hyphae within the mycelia of the ascomycetous fungi are compartmentalised by
septa. Each septum has a pore that allows for inter-compartmental and
inter-hyphal streaming of cytosol and even organelles. The compartments,
however, have special organelles, Woronin bodies, that can plug the pores. When
the pores are blocked, no flow of cytoplasm takes place. Inspired by the
controllable compartmentalisation within the mycelium of the ascomycetous fungi
we designed two-dimensional fungal automata. A fungal automaton is a cellular
automaton where communication between neighbouring cells can be blocked on
demand. We demonstrate computational universality of the fungal automata by
implementing sandpile cellular automata circuits there. We reduce the Monotone
Circuit Value Problem to the Fungal Automaton Prediction Problem. We construct
families of wires, cross-overs and gates to prove that the fungal automata are
P-complete.
","[{'version': 'v1', 'created': 'Thu, 19 Mar 2020 10:56:23 GMT'}]",2020-06-24,"[['Goles', 'Eric', ''], ['Tsompanas', 'Michail-Antisthenis', ''], ['Adamatzky', 'Andrew', ''], ['Tegelaar', 'Martin', ''], ['Wosten', 'Han A. B.', ''], ['Martinez', 'Genaro J.', '']]","['fungi', 'sandpile automata', 'computational universality']"
12061,1703.10873,Walter Cazzola,"Walter Cazzola (Universit\`a degli Studi di Milano, Italy), Albert
  Shaqiri (Universit\`a degli Studi di Milano, Italy)",Open Programming Language Interpreters,,"The Art, Science, and Engineering of Programming, 2017, Vol. 1,
  Issue 2, Article 5",10.22152/programming-journal.org/2017/1/5,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: This paper presents the concept of open programming language
interpreters and the implementation of a framework-level metaobject protocol
(MOP) to support them. Inquiry: We address the problem of dynamic interpreter
adaptation to tailor the interpreter's behavior on the task to be solved and to
introduce new features to fulfill unforeseen requirements. Many languages
provide a MOP that to some degree supports reflection. However, MOPs are
typically language-specific, their reflective functionality is often
restricted, and the adaptation and application logic are often mixed which
hardens the understanding and maintenance of the source code. Our system
overcomes these limitations. Approach: We designed and implemented a system to
support open programming language interpreters. The prototype implementation is
integrated in the Neverlang framework. The system exposes the structure,
behavior and the runtime state of any Neverlang-based interpreter with the
ability to modify it. Knowledge: Our system provides a complete control over
interpreter's structure, behavior and its runtime state. The approach is
applicable to every Neverlang-based interpreter. Adaptation code can
potentially be reused across different language implementations. Grounding:
Having a prototype implementation we focused on feasibility evaluation. The
paper shows that our approach well addresses problems commonly found in the
research literature. We have a demonstrative video and examples that illustrate
our approach on dynamic software adaptation, aspect-oriented programming,
debugging and context-aware interpreters. Importance: To our knowledge, our
paper presents the first reflective approach targeting a general framework for
language development. Our system provides full reflective support for free to
any Neverlang-based interpreter. We are not aware of any prior application of
open implementations to programming language interpreters in the sense defined
in this paper. Rather than substituting other approaches, we believe our system
can be used as a complementary technique in situations where other approaches
present serious limitations.
","[{'version': 'v1', 'created': 'Fri, 31 Mar 2017 12:09:27 GMT'}]",2017-04-03,"[['Cazzola', 'Walter', '', 'Università degli Studi di Milano, Italy'], ['Shaqiri', 'Albert', '', 'Università degli Studi di Milano, Italy']]","['modular interpreters', 'dynamic language evolution', 'neverlang']"
12062,2010.05353,Deepak P,Deepak P,Local Connectivity in Centroid Clustering,"In 24th International Database Engineering & Applications Symposium
  (IDEAS 2020), August 12--14, 2020, Seoul, Republic of Korea",,10.1145/3410566.3410601,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering is a fundamental task in unsupervised learning, one that targets
to group a dataset into clusters of similar objects. There has been recent
interest in embedding normative considerations around fairness within
clustering formulations. In this paper, we propose 'local connectivity' as a
crucial factor in assessing membership desert in centroid clustering. We use
local connectivity to refer to the support offered by the local neighborhood of
an object towards supporting its membership to the cluster in question. We
motivate the need to consider local connectivity of objects in cluster
assignment, and provide ways to quantify local connectivity in a given
clustering. We then exploit concepts from density-based clustering and devise
LOFKM, a clustering method that seeks to deepen local connectivity in
clustering outputs, while staying within the framework of centroid clustering.
Through an empirical evaluation over real-world datasets, we illustrate that
LOFKM achieves notable improvements in local connectivity at reasonable costs
to clustering quality, illustrating the effectiveness of the method.
","[{'version': 'v1', 'created': 'Sun, 11 Oct 2020 21:56:42 GMT'}]",2020-10-13,"[['P', 'Deepak', '']]","['Clustering', 'Local Connectivity', 'Normative Considerations']"
12063,1909.02063,Bas Hofstra,"Bas Hofstra, Vivek V. Kulkarni, Sebastian Munoz-Najar Galvez, Bryan
  He, Dan Jurafsky, Daniel A. McFarland",The Diversity-Innovation Paradox in Science,"Updated paper; tightened up terminology, added better theoretical
  explanation, tested for a mechanism in the updated paper, added robustness
  analyses, updated and improved metrics across the board",,10.1073/pnas.1915378117,,cs.SI cs.CL stat.AP stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Prior work finds a diversity paradox: diversity breeds innovation, and yet,
underrepresented groups that diversify organizations have less successful
careers within them. Does the diversity paradox hold for scientists as well? We
study this by utilizing a near-population of ~1.2 million US doctoral
recipients from 1977-2015 and following their careers into publishing and
faculty positions. We use text analysis and machine learning to answer a series
of questions: How do we detect scientific innovations? Are underrepresented
groups more likely to generate scientific innovations? And are the innovations
of underrepresented groups adopted and rewarded? Our analyses show that
underrepresented groups produce higher rates of scientific novelty. However,
their novel contributions are devalued and discounted: e.g., novel
contributions by gender and racial minorities are taken up by other scholars at
lower rates than novel contributions by gender and racial majorities, and
equally impactful contributions of gender and racial minorities are less likely
to result in successful scientific careers than for majority groups. These
results suggest there may be unwarranted reproduction of stratification in
academic careers that discounts diversity's role in innovation and partly
explains the underrepresentation of some groups in academia.
","[{'version': 'v1', 'created': 'Wed, 4 Sep 2019 19:10:20 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Jan 2020 02:31:51 GMT'}]",2022-10-12,"[['Hofstra', 'Bas', ''], ['Kulkarni', 'Vivek V.', ''], ['Galvez', 'Sebastian Munoz-Najar', ''], ['He', 'Bryan', ''], ['Jurafsky', 'Dan', ''], ['McFarland', 'Daniel A.', '']]","['Diversity', 'Innovation', 'Science', 'Inequality', 'Sociology of Science']"
12064,2205.02355,Ningyu Zhang,"Xiang Chen, Lei Li, Ningyu Zhang, Chuanqi Tan, Fei Huang, Luo Si,
  Huajun Chen","Relation Extraction as Open-book Examination: Retrieval-enhanced Prompt
  Tuning","Accepted by SIGIR 2022, short paper",,10.1145/3477495.3531746,,cs.CL cs.AI cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pre-trained language models have contributed significantly to relation
extraction by demonstrating remarkable few-shot learning abilities. However,
prompt tuning methods for relation extraction may still fail to generalize to
those rare or hard patterns. Note that the previous parametric learning
paradigm can be viewed as memorization regarding training data as a book and
inference as the close-book test. Those long-tailed or hard patterns can hardly
be memorized in parameters given few-shot instances. To this end, we regard RE
as an open-book examination and propose a new semiparametric paradigm of
retrieval-enhanced prompt tuning for relation extraction. We construct an
open-book datastore for retrieval regarding prompt-based instance
representations and corresponding relation labels as memorized key-value pairs.
During inference, the model can infer relations by linearly interpolating the
base output of PLM with the non-parametric nearest neighbor distribution over
the datastore. In this way, our model not only infers relation through
knowledge stored in the weights during training but also assists
decision-making by unwinding and querying examples in the open-book datastore.
Extensive experiments on benchmark datasets show that our method can achieve
state-of-the-art in both standard supervised and few-shot settings. Code are
available in https://github.com/zjunlp/PromptKG/tree/main/research/RetrievalRE.
","[{'version': 'v1', 'created': 'Wed, 4 May 2022 23:38:37 GMT'}]",2022-11-02,"[['Chen', 'Xiang', ''], ['Li', 'Lei', ''], ['Zhang', 'Ningyu', ''], ['Tan', 'Chuanqi', ''], ['Huang', 'Fei', ''], ['Si', 'Luo', ''], ['Chen', 'Huajun', '']]","['Relation Extraction', 'Prompt Tuning', 'Few-shot Learning']"
12065,2005.10701,Alexandru Cristian Mara,"Alexandru Mara, Yoosof Mashayekhi, Jefrey Lijffijt, Tijl De Bie",CSNE: Conditional Signed Network Embedding,,,10.1145/3340531.3411959,,cs.SI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Signed networks are mathematical structures that encode positive and negative
relations between entities such as friend/foe or trust/distrust. Recently,
several papers studied the construction of useful low-dimensional
representations (embeddings) of these networks for the prediction of missing
relations or signs. Existing embedding methods for sign prediction generally
enforce different notions of status or balance theories in their optimization
function. These theories, however, are often inaccurate or incomplete, which
negatively impacts method performance.
  In this context, we introduce conditional signed network embedding (CSNE).
Our probabilistic approach models structural information about the signs in the
network separately from fine-grained detail. Structural information is
represented in the form of a prior, while the embedding itself is used for
capturing fine-grained information. These components are then integrated in a
rigorous manner. CSNE's accuracy depends on the existence of sufficiently
powerful structural priors for modelling signed networks, currently unavailable
in the literature. Thus, as a second main contribution, which we find to be
highly valuable in its own right, we also introduce a novel approach to
construct priors based on the Maximum Entropy (MaxEnt) principle. These priors
can model the \emph{polarity} of nodes (degree to which their links are
positive) as well as signed \emph{triangle counts} (a measure of the degree
structural balance holds to in a network).
  Experiments on a variety of real-world networks confirm that CSNE outperforms
the state-of-the-art on the task of sign prediction. Moreover, the MaxEnt
priors on their own, while less accurate than full CSNE, achieve accuracies
competitive with the state-of-the-art at very limited computational cost, thus
providing an excellent runtime-accuracy trade-off in resource-constrained
situations.
","[{'version': 'v1', 'created': 'Tue, 19 May 2020 19:14:52 GMT'}, {'version': 'v2', 'created': 'Mon, 25 May 2020 10:13:43 GMT'}]",2020-11-06,"[['Mara', 'Alexandru', ''], ['Mashayekhi', 'Yoosof', ''], ['Lijffijt', 'Jefrey', ''], ['De Bie', 'Tijl', '']]","['Signed Network Embedding', 'Sign Prediction', 'MaxEnt Models']"
12066,2204.06735,EPTCS,"Clodomir Silva Lima Neto (Federal University of Rio Grande do Norte),
  Thiago Nascimento da Silva (Federal University of Rio Grande do Norte),
  Umberto Rivieccio (Federal University of Rio Grande do Norte)",Algebraizability of the Logic of Quasi-N4-Lattices,"In Proceedings NCL 2022, arXiv:2204.06359","EPTCS 358, 2022, pp. 240-253",10.4204/EPTCS.358.18,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  The class of quasi-N4-lattices (QN4-lattices) was introduced as a common
generalization of quasi-Nelson algebras and N4-lattices, in such a way that
N4-lattices are precisely the QN4-lattices satisfying the double negation law
(~~x = x) and quasi-Nelson algebras are the QN4-lattices satisfying the
explosive law (x ^ ~x) -> y = ((x ^ ~x) -> y) -> ((x ^ ~x) -> y). In this paper
we introduce, via a Hilbert-style presentation, a logic (L_QN4) whose algebraic
semantics is a class of algebras that we show to be term-equivalent to
QN4-lattices. The result is obtained by showing that the calculus introduced by
us is algebraizable in the sense of Blok and Pigozzi, and its equivalent
algebraic semantics is term-equivalent to the class of QN4-lattices. As a
prospect for future investigation, we consider the question of how one could
place L_QN4 within the family of relevance logics.
","[{'version': 'v1', 'created': 'Thu, 14 Apr 2022 03:28:09 GMT'}]",2022-04-15,"[['Neto', 'Clodomir Silva Lima', '', 'Federal University of Rio Grande do Norte'], ['da Silva', 'Thiago Nascimento', '', 'Federal University of Rio Grande do Norte'], ['Rivieccio', 'Umberto', '', 'Federal University of Rio Grande do Norte']]","['Non-involutive', 'Paraconsistent Nelson', 'Twist-structures', 'Algebraizable logic']"
12067,2108.11748,Zhongyi Zhou,Zhongyi Zhou and Koji Yatani,"Enhancing Model Assessment in Vision-based Interactive Machine Teaching
  through Real-time Saliency Map Visualization",Accepted to ACM UIST 2021 (Demo),,10.1145/3474349.3480194,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interactive Machine Teaching systems allow users to create customized machine
learning models through an iterative process of user-guided training and model
assessment. They primarily offer confidence scores of each label or class as
feedback for assessment by users. However, we observe that such feedback does
not necessarily suffice for users to confirm the behavior of the model. In
particular, confidence scores do not always offer the full understanding of
what features in the data are used for learning, potentially leading to the
creation of an incorrectly-trained model. In this demonstration paper, we
present a vision-based interactive machine teaching interface with real-time
saliency map visualization in the assessment phase. This visualization can
offer feedback on which regions of each image frame the current model utilizes
for classification, thus better guiding users to correct the corresponding
concepts in the iterative teaching.
","[{'version': 'v1', 'created': 'Thu, 26 Aug 2021 12:42:22 GMT'}]",2021-10-22,"[['Zhou', 'Zhongyi', ''], ['Yatani', 'Koji', '']]","['Interactive Machine Teaching', 'Saliency Map', 'Visualization']"
12068,2005.09907,J. Emmanuel Johnson,"J. Emmanuel Johnson, Valero Laparra, Gustau Camps-Valls",Accounting for Input Noise in Gaussian Process Parameter Retrieval,,"IEEE Geoscience and Remote Sensing Letters ( Volume: 17 , Issue: 3
  , March 2020 )",10.1109/LGRS.2019.2921476,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Gaussian processes (GPs) are a class of Kernel methods that have shown to be
very useful in geoscience and remote sensing applications for parameter
retrieval, model inversion, and emulation. They are widely used because they
are simple, flexible, and provide accurate estimates. GPs are based on a
Bayesian statistical framework which provides a posterior probability function
for each estimation. Therefore, besides the usual prediction (given in this
case by the mean function), GPs come equipped with the possibility to obtain a
predictive variance (i.e., error bars, confidence intervals) for each
prediction. Unfortunately, the GP formulation usually assumes that there is no
noise in the inputs, only in the observations. However, this is often not the
case in earth observation problems where an accurate assessment of the
measuring instrument error is typically available, and where there is huge
interest in characterizing the error propagation through the processing
pipeline. In this letter, we demonstrate how one can account for input noise
estimates using a GP model formulation which propagates the error terms using
the derivative of the predictive mean function. We analyze the resulting
predictive variance term and show how they more accurately represent the model
error in a temperature prediction problem from infrared sounding data.
","[{'version': 'v1', 'created': 'Wed, 20 May 2020 08:23:48 GMT'}]",2020-05-21,"[['Johnson', 'J. Emmanuel', ''], ['Laparra', 'Valero', ''], ['Camps-Valls', 'Gustau', '']]","['Gaussian Process Regression', 'Error', 'Noisy', 'Derivative', 'Variance', 'Surface Temperature']"
12069,2205.09584,Frida Heskebeck,"Frida Heskebeck, Carolina Bergeling, Bo Bernhardsson",Multi-Armed Bandits in Brain-Computer Interfaces,,,10.3389/fnhum.2022.931085,,cs.AI cs.HC cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  The multi-armed bandit (MAB) problem models a decision-maker that optimizes
its actions based on current and acquired new knowledge to maximize its reward.
This type of online decision is prominent in many procedures of Brain-Computer
Interfaces (BCIs) and MAB has previously been used to investigate, e.g., what
mental commands to use to optimize BCI performance. However, MAB optimization
in the context of BCI is still relatively unexplored, even though it has the
potential to improve BCI performance during both calibration and real-time
implementation. Therefore, this review aims to further introduce MABs to the
BCI community. The review includes a background on MAB problems and standard
solution methods, and interpretations related to BCI systems. Moreover, it
includes state-of-the-art concepts of MAB in BCI and suggestions for future
research.
","[{'version': 'v1', 'created': 'Thu, 19 May 2022 14:24:54 GMT'}]",2022-11-10,"[['Heskebeck', 'Frida', ''], ['Bergeling', 'Carolina', ''], ['Bernhardsson', 'Bo', '']]","['Multi-Armed Bandits', 'Brain-Computer Interfaces', 'Reinforcement Learning', 'Calibration', 'Real-Time']"
12070,1910.13090,Wenzhuo Song,"Wenzhuo Song, Hongxu Chen, Xueyan Liu, Hongzhe Jiang, Shengsheng Wang",Hyperbolic Node Embedding for Signed Networks,32 pages,,10.1016/j.neucom.2020.10.008,,cs.LG cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Signed network embedding methods aim to learn vector representations of nodes
in signed networks. However, existing algorithms only managed to embed networks
into low-dimensional Euclidean spaces whereas many intrinsic features of signed
networks are reported more suitable for non-Euclidean spaces. For instance,
previous works did not consider the hierarchical structures of networks, which
is widely witnessed in real-world networks. In this work, we answer an open
question that whether the hyperbolic space is a better choice to accommodate
signed networks and learn embeddings that can preserve the corresponding
special characteristics. We also propose a non-Euclidean signed network
embedding method based on structural balance theory and Riemannian
optimization, which embeds signed networks into a Poincar\'e ball in a
hyperbolic space. This space enables our approach to capture underlying
hierarchy of nodes in signed networks because it can be seen as a continuous
tree. We empirically compare our method against six Euclidean-based baselines
in three tasks on seven real-world datasets, and the results show the
effectiveness of our method.
","[{'version': 'v1', 'created': 'Tue, 29 Oct 2019 05:17:00 GMT'}, {'version': 'v2', 'created': 'Mon, 31 Aug 2020 06:01:26 GMT'}]",2021-07-16,"[['Song', 'Wenzhuo', ''], ['Chen', 'Hongxu', ''], ['Liu', 'Xueyan', ''], ['Jiang', 'Hongzhe', ''], ['Wang', 'Shengsheng', '']]","['network embedding', 'signed networks', 'hyperbolic geometric']"
12071,1904.07467,"Dominik K\""oppl","Kazuya Tsuruta and Dominik K\""oppl and Shunsuke Kanda and Yuto
  Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",c-trie++: A Dynamic Trie Tailored for Fast Prefix Searches,,"Full version of conference paper at DCC, pages 243-252, 2020",10.1109/DCC47342.2020.00032,,cs.DS cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a dynamic set $K$ of $k$ strings of total length $n$ whose characters
are drawn from an alphabet of size $\sigma$, a keyword dictionary is a data
structure built on $K$ that provides locate, prefix search, and update
operations on $K$. Under the assumption that $\alpha = w / \lg \sigma$
characters fit into a single machine word $w$, we propose a keyword dictionary
that represents $K$ in $n \lg \sigma + \Theta(k \lg n)$ bits of space,
supporting all operations in $O(m / \alpha + \lg \alpha)$ expected time on an
input string of length $m$ in the word RAM model. This data structure is
underlined with an exhaustive practical evaluation, highlighting the practical
usefulness of the proposed data structure, especially for prefix searches - one
of the most elementary keyword dictionary operations.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2019 05:20:47 GMT'}, {'version': 'v2', 'created': 'Sat, 16 Nov 2019 07:37:22 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Oct 2020 07:43:59 GMT'}]",2020-10-08,"[['Tsuruta', 'Kazuya', ''], ['Köppl', 'Dominik', ''], ['Kanda', 'Shunsuke', ''], ['Nakashima', 'Yuto', ''], ['Inenaga', 'Shunsuke', ''], ['Bannai', 'Hideo', ''], ['Takeda', 'Masayuki', '']]","['string dictionary', 'compact trie', 'hashing', 'word-packing', 'prefix searches']"
12072,2006.12231,Shijun Zhang,Zuowei Shen and Haizhao Yang and Shijun Zhang,"Deep Network with Approximation Error Being Reciprocal of Width to Power
  of Square Root of Depth",,"Neural Computation, Volume 33, Issue 4, April 2021, Pages
  1005-1036",10.1162/neco_a_01364,,cs.LG cs.NA math.NA stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new network with super approximation power is introduced. This network is
built with Floor ($\lfloor x\rfloor$) or ReLU ($\max\{0,x\}$) activation
function in each neuron and hence we call such networks Floor-ReLU networks.
For any hyper-parameters $N\in\mathbb{N}^+$ and $L\in\mathbb{N}^+$, it is shown
that Floor-ReLU networks with width $\max\{d,\, 5N+13\}$ and depth $64dL+3$ can
uniformly approximate a H\""older function $f$ on $[0,1]^d$ with an
approximation error $3\lambda d^{\alpha/2}N^{-\alpha\sqrt{L}}$, where $\alpha
\in(0,1]$ and $\lambda$ are the H\""older order and constant, respectively. More
generally for an arbitrary continuous function $f$ on $[0,1]^d$ with a modulus
of continuity $\omega_f(\cdot)$, the constructive approximation rate is
$\omega_f(\sqrt{d}\,N^{-\sqrt{L}})+2\omega_f(\sqrt{d}){N^{-\sqrt{L}}}$. As a
consequence, this new class of networks overcomes the curse of dimensionality
in approximation power when the variation of $\omega_f(r)$ as $r\to 0$ is
moderate (e.g., $\omega_f(r) \lesssim r^\alpha$ for H\""older continuous
functions), since the major term to be considered in our approximation rate is
essentially $\sqrt{d}$ times a function of $N$ and $L$ independent of $d$
within the modulus of continuity.
","[{'version': 'v1', 'created': 'Mon, 22 Jun 2020 13:27:33 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Aug 2020 01:51:17 GMT'}, {'version': 'v3', 'created': 'Wed, 30 Sep 2020 16:47:47 GMT'}, {'version': 'v4', 'created': 'Sun, 4 Oct 2020 21:13:30 GMT'}, {'version': 'v5', 'created': 'Sat, 24 Oct 2020 18:18:10 GMT'}, {'version': 'v6', 'created': 'Tue, 27 Oct 2020 01:51:52 GMT'}]",2021-03-30,"[['Shen', 'Zuowei', ''], ['Yang', 'Haizhao', ''], ['Zhang', 'Shijun', '']]","['Exponential Convergence', 'Curse of Dimensionality', 'Deep Neural Network', 'Floor and ReLU Activation Functions', 'Continuous Function']"
12073,1811.05896,Miguel De Prado,"Miguel de Prado, Maurizio Denna, Luca Benini and Nuria Pazos",QUENN: QUantization Engine for low-power Neural Networks,Computing Frontiers 2018,,10.1145/3203217.3203282,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep Learning is moving to edge devices, ushering in a new age of distributed
Artificial Intelligence (AI). The high demand of computational resources
required by deep neural networks may be alleviated by approximate computing
techniques, and most notably reduced-precision arithmetic with coarsely
quantized numerical representations. In this context, Bonseyes comes in as an
initiative to enable stakeholders to bring AI to low-power and autonomous
environments such as: Automotive, Medical Healthcare and Consumer Electronics.
To achieve this, we introduce LPDNN, a framework for optimized deployment of
Deep Neural Networks on heterogeneous embedded devices. In this work, we detail
the quantization engine that is integrated in LPDNN. The engine depends on a
fine-grained workflow which enables a Neural Network Design Exploration and a
sensitivity analysis of each layer for quantization. We demonstrate the engine
with a case study on Alexnet and VGG16 for three different techniques for
direct quantization: standard fixed-point, dynamic fixed-point and k-means
clustering, and demonstrate the potential of the latter. We argue that using a
Gaussian quantizer with k-means clustering can achieve better performance than
linear quantizers. Without retraining, we achieve over 55.64\% saving for
weights' storage and 69.17\% for run-time memory accesses with less than 1\%
drop in top5 accuracy in Imagenet.
","[{'version': 'v1', 'created': 'Wed, 14 Nov 2018 16:38:42 GMT'}]",2018-11-15,"[['de Prado', 'Miguel', ''], ['Denna', 'Maurizio', ''], ['Benini', 'Luca', ''], ['Pazos', 'Nuria', '']]","['Deep Learning', 'quantization', 'embedded system', 'layer sensitivity']"
12074,2010.10008,Li Yuan,"Li Yuan, Shuning Chang, Xuecheng Nie, Ziyuan Huang, Yichen Zhou,
  Yunpeng Chen, Jiashi Feng, Shuicheng Yan",Towards Accurate Human Pose Estimation in Videos of Crowded Scenes,"2nd Place in ACM Multimedia Grand Challenge: Human in Events, Track2:
  Crowd Pose Estimation in Complex Events. ACM Multimedia 2020. arXiv admin
  note: substantial text overlap with arXiv:2010.08365, arXiv:2010.10007",,10.1145/3394171.3416299,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video-based human pose estimation in crowded scenes is a challenging problem
due to occlusion, motion blur, scale variation and viewpoint change, etc. Prior
approaches always fail to deal with this problem because of (1) lacking of
usage of temporal information; (2) lacking of training data in crowded scenes.
In this paper, we focus on improving human pose estimation in videos of crowded
scenes from the perspectives of exploiting temporal context and collecting new
data. In particular, we first follow the top-down strategy to detect persons
and perform single-person pose estimation for each frame. Then, we refine the
frame-based pose estimation with temporal contexts deriving from the
optical-flow. Specifically, for one frame, we forward the historical poses from
the previous frames and backward the future poses from the subsequent frames to
current frame, leading to stable and accurate human pose estimation in videos.
In addition, we mine new data of similar scenes to HIE dataset from the
Internet for improving the diversity of training set. In this way, our model
achieves best performance on 7 out of 13 videos and 56.33 average w\_AP on test
dataset of HIE challenge.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2020 13:19:11 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Oct 2020 03:37:40 GMT'}]",2020-10-22,"[['Yuan', 'Li', ''], ['Chang', 'Shuning', ''], ['Nie', 'Xuecheng', ''], ['Huang', 'Ziyuan', ''], ['Zhou', 'Yichen', ''], ['Chen', 'Yunpeng', ''], ['Feng', 'Jiashi', ''], ['Yan', 'Shuicheng', '']]","['pose estimation', 'object detection', 'human in events']"
12075,2110.01591,Soheil Habibian,"Soheil Habibian, Benjamin B. Wheatley, Suehye Bae, Joon Shin, and
  Keith W. Buffinton","Evaluation of Two Complementary Modeling Approaches for Fiber-Reinforced
  Soft Actuators",,,10.1186/s40648-022-00225-9,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Roboticists have been seeking to address this situation in recent years
through the use of soft robots. Unfortunately, identifying appropriate models
for the complete analysis and investigation of soft robots for design and
control purposes can be problematic. This paper seeks to address this challenge
by proposing two complementary modeling techniques for a particular type of
soft robotic actuator known as a Fiber-Reinforced Elastomeric Enclosure (FREE).
We propose that researchers can leverage multiple models to fill gaps in the
understanding of the behavior of soft robots. We present and evaluate both a
dynamic, lumped-parameter model and a finite element model to extend
understanding of the practicability of FREEs in soft robotic applications. The
results with the lumped-parameter model demonstrate that it predicts the actual
rotational motion of a FREE with at most 4% error when a closed-loop controller
is embedded in the system. Additionally, finite element analysis was used to
study FREE design parameters as well as the workspace achieved with a module
comprised of multiple FREEs. Our finite element results indicate that
variations in the material properties of the elastic enclosure of a FREE are
more significant than variations in fiber properties. Finally, finite element
results show that a 30-degree difference in winding angle dramatically alters
the shape of the workspace generated by four FREEs assembled into a module.
Concludingly, comments are made about the relative advantages and limitations
of lumped-parameter and finite element models of FREEs and FREE modules in
providing useful insights into their behavior.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2021 18:48:28 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Oct 2021 02:09:57 GMT'}, {'version': 'v3', 'created': 'Sun, 22 May 2022 03:38:38 GMT'}]",2022-05-24,"[['Habibian', 'Soheil', ''], ['Wheatley', 'Benjamin B.', ''], ['Bae', 'Suehye', ''], ['Shin', 'Joon', ''], ['Buffinton', 'Keith W.', '']]","['Soft robots', 'Fiber reinforced soft actuators', 'Modeling soft robots', 'Finite element analysis of soft robots']"
12076,2001.05358,Somayyeh Firoozi,"Reza Fotohi, Somayyeh Firoozi Bari","A novel countermeasure technique to protect WSN against denial-of-sleep
  attacks using firefly and Hopfield neural network (HNN) algorithms","27 pages, 10 figures, Journal","The Journal of Supercomputing, 1-27 (2020)",10.1007/s11227-019-03131-x,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless sensor networks (WSNs) contain numerous nodes that their main goals
are to monitor and control environments. Also, sensor nodes distribute based on
network usage. One of the most significant issues in this type of network is
the energy consumption of sensor nodes. In fixed-sink networks, nodes which are
near the sink act as an interface to transfer data of other nodes to sink. This
causes the energy consumption of sensors reduces rapidly. Therefore, the
lifetime of the network declines. Sensor nodes owing to their weaknesses are
susceptible to several threats, one of which is denial-of-sleep attack (DoSA)
threatening WSN. Hence, the DoSA refers to the energy loss in these nodes by
maintaining the nodes from entering energy-saving and sleep mode. In this
paper, a hybrid approach is proposed based on mobile sink, firefly algorithm
based on leach, and Hopfield neural network (WSN-FAHN). Thus, mobile sink is
applied to both improve energy consumption and increase network lifetime.
Firefly algorithm is proposed to cluster nodes and authenticate in two levels
to prevent from DoSA. In addition, Hopfield neural network detects the
direction route of the sink movement to send data of CH. Furthermore, here
WSN-FAHN technique is assessed through wide simulations performed in the NS-2
environment. The WSN-FAHN procedure superiority is demonstrated by simulation
outcomes in comparison with contemporary schemes based on performance metrics
like packet delivery ratio (PDR), average throughput, detection ratio, and
network lifetime while decreasing the average residual energy.
","[{'version': 'v1', 'created': 'Wed, 15 Jan 2020 14:59:14 GMT'}]",2020-01-16,"[['Fotohi', 'Reza', ''], ['Bari', 'Somayyeh Firoozi', '']]","['Wireless Sensor networks (WSNs)', 'Denial of Sleep Attack', 'Firefly algorithm', 'Mobile Sink']"
12077,2207.12841,Kevin Gildea,"Kevin Gildea, Clara Mercadal-Baudart, Richard Blythman, Aljosa Smolic,
  Ciaran Simms","KinePose: A temporally optimized inverse kinematics technique for 6DOF
  human pose estimation with biomechanical constraints",Project page: https://kevgildea.github.io/KinePose/,Irish Machine Vision & Image Processing Conference (IMVIP 2022),10.56541/QTUV2945,,cs.CV math.OC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Computer vision/deep learning-based 3D human pose estimation methods aim to
localize human joints from images and videos. Pose representation is normally
limited to 3D joint positional/translational degrees of freedom (3DOFs),
however, a further three rotational DOFs (6DOFs) are required for many
potential biomechanical applications. Positional DOFs are insufficient to
analytically solve for joint rotational DOFs in a 3D human skeletal model.
Therefore, we propose a temporal inverse kinematics (IK) optimization technique
to infer joint orientations throughout a biomechanically informed, and
subject-specific kinematic chain. For this, we prescribe link directions from a
position-based 3D pose estimate. Sequential least squares quadratic programming
is used to solve a minimization problem that involves both frame-based pose
terms, and a temporal term. The solution space is constrained using joint DOFs,
and ranges of motion (ROMs). We generate 3D pose motion sequences to assess the
IK approach both for general accuracy, and accuracy in boundary cases. Our
temporal algorithm achieves 6DOF pose estimates with low Mean Per Joint Angular
Separation (MPJAS) errors (3.7{\deg}/joint overall, & 1.6{\deg}/joint for lower
limbs). With frame-by-frame IK we obtain low errors in the case of bent elbows
and knees, however, motion sequences with phases of extended/straight limbs
results in ambiguity in twist angle. With temporal IK, we reduce ambiguity for
these poses, resulting in lower average errors.
","[{'version': 'v1', 'created': 'Tue, 26 Jul 2022 12:17:07 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Sep 2022 17:50:47 GMT'}]",2022-09-07,"[['Gildea', 'Kevin', ''], ['Mercadal-Baudart', 'Clara', ''], ['Blythman', 'Richard', ''], ['Smolic', 'Aljosa', ''], ['Simms', 'Ciaran', '']]","['Human Pose Estimation', 'Computer Vision', 'Inverse Kinematics', 'Motion Capture', 'Biomechanics']"
12078,2104.03888,Manuel Carranza-Garc\'ia,"Manuel Carranza-Garc\'ia, Pedro Lara-Ben\'itez, Jorge
  Garc\'ia-Guti\'errez, Jos\'e C. Riquelme","Enhancing Object Detection for Autonomous Driving by Optimizing Anchor
  Generation and Addressing Class Imbalance",,"Neurocomputing, 2021",10.1016/j.neucom.2021.04.001,,cs.CV cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Object detection has been one of the most active topics in computer vision
for the past years. Recent works have mainly focused on pushing the
state-of-the-art in the general-purpose COCO benchmark. However, the use of
such detection frameworks in specific applications such as autonomous driving
is yet an area to be addressed. This study presents an enhanced 2D object
detector based on Faster R-CNN that is better suited for the context of
autonomous vehicles. Two main aspects are improved: the anchor generation
procedure and the performance drop in minority classes. The default uniform
anchor configuration is not suitable in this scenario due to the perspective
projection of the vehicle cameras. Therefore, we propose a perspective-aware
methodology that divides the image into key regions via clustering and uses
evolutionary algorithms to optimize the base anchors for each of them.
Furthermore, we add a module that enhances the precision of the second-stage
header network by including the spatial information of the candidate regions
proposed in the first stage. We also explore different re-weighting strategies
to address the foreground-foreground class imbalance, showing that the use of a
reduced version of focal loss can significantly improve the detection of
difficult and underrepresented objects in two-stage detectors. Finally, we
design an ensemble model to combine the strengths of the different learning
strategies. Our proposal is evaluated with the Waymo Open Dataset, which is the
most extensive and diverse up to date. The results demonstrate an average
accuracy improvement of 6.13% mAP when using the best single model, and of
9.69% mAP with the ensemble. The proposed modifications over the Faster R-CNN
do not increase computational cost and can easily be extended to optimize other
anchor-based detection frameworks.
","[{'version': 'v1', 'created': 'Thu, 8 Apr 2021 16:58:31 GMT'}]",2021-04-09,"[['Carranza-García', 'Manuel', ''], ['Lara-Benítez', 'Pedro', ''], ['García-Gutiérrez', 'Jorge', ''], ['Riquelme', 'José C.', '']]","['autonomous vehicles', 'anchor optimization', 'class imbalance', 'convolutional neural networks', 'deeplearning', 'object detection']"
12079,2006.06819,Nuoa Lei,Nuoa Lei,A robust modeling framework for energy analysis of data centers,,,10.1145/3401335.3401648,,cs.CY stat.AP,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Global digitalization has given birth to the explosion of digital services in
approximately every sector of contemporary life. Applications of artificial
intelligence, blockchain technologies, and internet of things are promising to
accelerate digitalization further. As a consequence, the number of data
centers, which provide the services of data processing, storage, and
communication services, is also increasing rapidly. Because data centers are
energy-intensive with significant and growing electricity demand, an energy
model of data centers with temporal, spatial, and predictive analysis
capability is critical for guiding industry and governmental authorities for
making technology investment decisions. However, current models fail to provide
consistent and high dimensional energy analysis for data centers due to severe
data gaps. This can be further attributed to the lack of the modeling
capabilities for energy analysis of data center components including IT
equipment and data center cooling and power provisioning infrastructure in
current energy models. In this research, a technology-based modeling framework,
in hybrid with a data-driven approach, is proposed to address the knowledge
gaps in current data center energy models. The research aims to provide policy
makers and data center energy analysts with comprehensive understanding of data
center energy use and efficiency opportunities and a better understanding of
macro-level data center energy demand and energy saving potentials, in addition
to the technological barriers for adopting energy efficiency measures.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2020 21:05:20 GMT'}]",2020-06-15,"[['Lei', 'Nuoa', '']]","['Data Center', 'Energy Modeling', 'Uncertainty Quantification', 'Statistical Analysis', 'Index Decomposition Analysis']"
12080,1912.11527,Francisco Erivaldo Fernandes Junior,"Francisco Erivaldo Fernandes Junior, Gary G. Yen","Pruning Deep Convolutional Neural Networks Architectures with Evolution
  Strategy",Accepted at Information Sciences,,10.1016/j.ins.2020.11.009,,cs.NE cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Currently, Deep Convolutional Neural Networks (DCNNs) are used to solve all
kinds of problems in the field of machine learning and artificial intelligence
due to their learning and adaptation capabilities. However, most successful
DCNN models have a high computational complexity making them difficult to
deploy on mobile or embedded platforms. This problem has prompted many
researchers to develop algorithms and approaches to help reduce the
computational complexity of such models. One of them is called filter pruning,
where convolution filters are eliminated to reduce the number of parameters
and, consequently, the computational complexity of the given model. In the
present work, we propose a novel algorithm to perform filter pruning by using
Multi-Objective Evolution Strategy (ES) algorithm, called DeepPruningES. Our
approach avoids the need for using any knowledge during the pruning procedure
and helps decision-makers by returning three pruned CNN models with different
trade-offs between performance and computational complexity. We show that
DeepPruningES can significantly reduce a model's computational complexity by
testing it on three DCNN architectures: Convolutional Neural Networks (CNNs),
Residual Neural Networks (ResNets), and Densely Connected Neural Networks
(DenseNets).
","[{'version': 'v1', 'created': 'Tue, 24 Dec 2019 20:48:00 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Nov 2020 13:13:47 GMT'}]",2020-12-01,"[['Junior', 'Francisco Erivaldo Fernandes', ''], ['Yen', 'Gary G.', '']]","['Deep Convolutional Neural Networks', 'Convolutional FilterPruning', 'Multi-Objective Optimization', 'Evolution Strategies', 'EvolutionaryAlgorithm']"
12081,2202.08159,Ahmadreza Mosallanezhad,"Ahmadreza Mosallanezhad, Mansooreh Karami, Kai Shu, Michelle V.
  Mancenido, Huan Liu",Domain Adaptive Fake News Detection via Reinforcement Learning,Accepted to The ACM Web Conference (WWW) 2022,,10.1145/3485447.3512258,,cs.SI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  With social media being a major force in information consumption, accelerated
propagation of fake news has presented new challenges for platforms to
distinguish between legitimate and fake news. Effective fake news detection is
a non-trivial task due to the diverse nature of news domains and expensive
annotation costs. In this work, we address the limitations of existing
automated fake news detection models by incorporating auxiliary information
(e.g., user comments and user-news interactions) into a novel reinforcement
learning-based model called \textbf{RE}inforced \textbf{A}daptive
\textbf{L}earning \textbf{F}ake \textbf{N}ews \textbf{D}etection (REAL-FND).
REAL-FND exploits cross-domain and within-domain knowledge that makes it robust
in a target domain, despite being trained in a different source domain.
Extensive experiments on real-world datasets illustrate the effectiveness of
the proposed model, especially when limited labeled data is available in the
target domain.
","[{'version': 'v1', 'created': 'Wed, 16 Feb 2022 16:05:37 GMT'}]",2022-02-17,"[['Mosallanezhad', 'Ahmadreza', ''], ['Karami', 'Mansooreh', ''], ['Shu', 'Kai', ''], ['Mancenido', 'Michelle V.', ''], ['Liu', 'Huan', '']]","['neural networks', 'reinforcement learning', 'domain adaptation', 'disinformation']"
12082,1907.04891,Artur Strzelecki,Artur Strzelecki and Paulina Rutecka,Featured Snippets Results in Google Web Search: An Exploratory Study,"10 pages, 6 tables, accepted to conference ICMarktech'19",Marketing and Smart Technologies 2020,10.1007/978-981-15-1564-4_2,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper authors analyzed 163412 keywords and results with featured
snippets collected from localized Polish Google search engine. A method-ology
for retrieving data from Google search engine was proposed in terms of
obtaining necessary data to study featured snippets. It was observed that
almost half of featured snippets (48%) is taken from result on first ranking
position. Furthermore, some correlations between prepositions and the most
often appearing content words in keywords was discovered. Results show that
featured snippets are often taken from trustworthy websites like e.g.,
Wikipedia and are mainly presented in form of a paragraph. Paragraph can be
read by Google Assistant or Home Assistant with voice search. We conclude our
findings with discussion and research limitations.
","[{'version': 'v1', 'created': 'Wed, 10 Jul 2019 19:06:58 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Oct 2019 09:05:03 GMT'}, {'version': 'v3', 'created': 'Tue, 3 Dec 2019 22:51:53 GMT'}]",2019-12-05,"[['Strzelecki', 'Artur', ''], ['Rutecka', 'Paulina', '']]","['Featured snippet', 'Google', 'Search engines', 'voice results']"
12083,2101.02874,Jose-Luis Blanco-Claraco,"Jos\'e-Luis Blanco-Claraco, Antonio Leanza, Giulio Reina","A general framework for modeling and dynamic simulation of multibody
  systems using factor graphs",23 pages,"Nonlinear Dynamics, 2021",10.1007/s11071-021-06731-6,,cs.RO cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this paper, we present a novel general framework grounded in the factor
graph theory to solve kinematic and dynamic problems for multi-body systems.
Although the motion of multi-body systems is considered to be a well-studied
problem and various methods have been proposed for its solution, a unified
approach providing an intuitive interpretation is still pursued. We describe
how to build factor graphs to model and simulate multibody systems using both,
independent and dependent coordinates. Then, batch optimization or a
fixed-lag-smoother can be applied to solve the underlying optimization problem
that results in a highly-sparse nonlinear minimization problem. The proposed
framework has been tested in extensive simulations and validated against a
commercial multibody software. We release a reference implementation as an
open-source C++ library, based on the GTSAM framework, a well-known estimation
library. Simulations of forward and inverse dynamics are presented, showing
comparable accuracy with classical approaches. The proposed factor graph-based
framework has the potential to be integrated into applications related with
motion estimation and parameter identification of complex mechanical systems,
ranging from mechanisms to vehicles, or robot manipulators.
","[{'version': 'v1', 'created': 'Fri, 8 Jan 2021 06:45:45 GMT'}]",2021-07-27,"[['Blanco-Claraco', 'José-Luis', ''], ['Leanza', 'Antonio', ''], ['Reina', 'Giulio', '']]","['Dynamics of mechanical systems', 'Multibody systems', 'Motion state estimation', 'Factor graph', 'Nonlinearoptimization', 'Computational mechanics']"
12084,2006.07066,Rosa M Badia,"Rosa M Badia, Jorge Ejarque, Francesc Lordan, Daniele Lezzi, Javier
  Conejero, Javier \'Alvarez Cid-Fuentes, Yolanda Becerra, and Anna Queralt",Workflow environments for advanced cyberinfrastructure platforms,"10 pages, 6 figures, in proceedings of 2019 IEEE 39th International
  Conference on Distributed Computing Systems (ICDCS)","Proceedings of 2019 IEEE 39th International Conference on
  Distributed Computing Systems (ICDCS)",10.1109/ICDCS.2019.00171,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Progress in science is deeply bound to the effective use of high-performance
computing infrastructures and to the efficient extraction of knowledge from
vast amounts of data. Such data comes from different sources that follow a
cycle composed of pre-processing steps for data curation and preparation for
subsequent computing steps, and later analysis and analytics steps applied to
the results. However, scientific workflows are currently fragmented in multiple
components, with different processes for computing and data management, and
with gaps in the viewpoints of the user profiles involved. Our vision is that
future workflow environments and tools for the development of scientific
workflows should follow a holistic approach, where both data and computing are
integrated in a single flow built on simple, high-level interfaces. The topics
of research that we propose involve novel ways to express the workflows that
integrate the different data and compute processes, dynamic runtimes to support
the execution of the workflows in complex and heterogeneous computing
infrastructures in an efficient way, both in terms of performance and energy.
These infrastructures include highly distributed resources, from sensors and
instruments, and devices in the edge, to High-Performance Computing and Cloud
computing resources. This paper presents our vision to develop these workflow
environments and also the steps we are currently following to achieve it.
","[{'version': 'v1', 'created': 'Fri, 12 Jun 2020 10:41:48 GMT'}]",2020-06-15,"[['Badia', 'Rosa M', ''], ['Ejarque', 'Jorge', ''], ['Lordan', 'Francesc', ''], ['Lezzi', 'Daniele', ''], ['Conejero', 'Javier', ''], ['Cid-Fuentes', 'Javier Álvarez', ''], ['Becerra', 'Yolanda', ''], ['Queralt', 'Anna', '']]","['Scientific workflows', 'computing continuum platforms', 'Big data and High-Performance Computing convergence', 'Intelligent runtimes']"
12085,2008.13108,Ali Nawaz,"Attique Ur Rehman, Ali Nawaz, Muhammad Abbas","Agile Methods: Testing Challenges, Solutions & Tool Support",,"2020 14th International Conference on Open Source Systems and
  Technologies (ICOSST), Lahore, Pakistan, 2020, pp. 1-5",10.1109/ICOSST51357.2020.9332965,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Agile development is conventional these days and with the passage of time
software developers are rapidly moving from Waterfall to Agile development.
Agile methods focus on delivering executable code quickly by increasing the
responsiveness of software companies while decreasing development overhead and
consider people as the strongest pillar of software development. As agile
development overshadows Waterfall methodologies for software development, it
comes up with some distinct challenges related to testing of such software. Our
study is going to discuss the challenges this approach has stirred up. Some of
the challenges are discussed in this paper with possible solutions and
approaches used for resolving these challenges. Also, the tools in practice are
mentioned to improve the efficiency of the process.
","[{'version': 'v1', 'created': 'Sun, 30 Aug 2020 07:42:07 GMT'}]",2021-04-13,"[['Rehman', 'Attique Ur', ''], ['Nawaz', 'Ali', ''], ['Abbas', 'Muhammad', '']]","['Agile development', 'Software development', 'Agile tools']"
12086,1508.04347,Fran\c{c}ois Renaville,"Fran\c{c}ois Renaville, Yosef Branse, Xiaotian Chen, Mark Needleman","SFX Miscellaneous Free Ejournals Target: Usage Survey among the SFX
  Community",,Serials Review 41 (2015) 58-68,10.1080/00987913.2015.1031317,,cs.DL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The number of free or open access articles is increasing rapidly, and their
retrieval with library indexes and OpenURL link resolvers has been a challenge.
In June 2014, the SFX MISCELLANEOUS FREE EJOURNALS target contained more than
24,000 portfolios of all kinds. The SFX Knowledge Base Advisory Board (KBAB)
carried out an international survey to get an overview of the usage of this
target by the SFX community and to precisely identify what could be done to
improve it. The target is widely used among the community. However, many
respondents complained about three major problems: (a) incorrect links, (b)
full texts actually not free, and (c) incorrect or missing thresholds (years
and volumes information).
","[{'version': 'v1', 'created': 'Tue, 18 Aug 2015 15:20:39 GMT'}]",2015-08-19,"[['Renaville', 'François', ''], ['Branse', 'Yosef', ''], ['Chen', 'Xiaotian', ''], ['Needleman', 'Mark', '']]","['broken links', 'free ejournals', 'metadata quality', 'open access journals', 'SFX', 'SFX KnowledgeBase']"
12087,2002.07611,Guangping Li,"Sujoy Bhore, Guangping Li, Martin N\""ollenburg",An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling,"The full version of a paper appearing at ESA 2020, accepted by the
  ACM Journal of Experimental Algorithmics (JEA)",,10.4230/LIPIcs.ESA.2020.19,,cs.CG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Map labeling is a classical problem in cartography and geographic information
systems (GIS) that asks to place labels for area, line, and point features,
with the goal to select and place the maximum number of independent, i.e.,
overlap-free, labels. A practically interesting case is point labeling with
axis-parallel rectangular labels of common size. In a fully dynamic setting, at
each time step, either a new label appears or an existing label disappears.
Then, the challenge is to maintain a maximum cardinality subset of pairwise
independent labels with sub-linear update time. Motivated by this, we study the
maximal independent set ((MIS)) and maximum independent set (Max-IS) problems
on fully dynamic (insertion/deletion model) sets of axis-parallel rectangles of
two types -- (i) uniform height and width and (ii) uniform height and arbitrary
width; both settings can be modeled as rectangle intersection graphs.
  We present the first deterministic algorithm for maintaining an MIS (and thus
a 4-approximate Max-IS) of a dynamic set of uniform rectangles with
polylogarithmic update time. This breaks the natural barrier of
$\Omega(\Delta)$ update time (where $\Delta$ is the maximum degree in the
graph) for \emph{vertex updates} presented by Assadi et al. (STOC 2018). We
continue by investigating Max-IS and provide a series of deterministic dynamic
approximation schemes with approximation factors between 2 and 4 and
corresponding running-time trade-offs. We have implemented our algorithms and
reported the results of an experimental comparison exploring the trade-off
between solution quality and update time for synthetic and real-world map
labeling instances.
","[{'version': 'v1', 'created': 'Tue, 18 Feb 2020 14:51:48 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Jun 2020 13:31:11 GMT'}, {'version': 'v3', 'created': 'Mon, 17 Aug 2020 14:37:57 GMT'}, {'version': 'v4', 'created': 'Thu, 17 Feb 2022 11:24:31 GMT'}]",2022-02-18,"[['Bhore', 'Sujoy', ''], ['Li', 'Guangping', ''], ['Nöllenburg', 'Martin', '']]","['Independent Sets', 'Dynamic Algorithms', 'Rectangle Intersection Graphs', 'Approximation Algorithms', 'Experimental Evaluation']"
12088,2212.11030,Akash Singh,"Akash Singh, Tom De Schepper, Kevin Mets, Peter Hellinckx, Jose
  Oramas, Steven Latre",Deep set conditioned latent representations for action recognition,"Conference VISAPP 2022, 11 pages,5 figures, 2 Tables, 6 plots","In Proceedings of the 17th International Joint Conference on
  Computer Vision, Imaging and Computer Graphics Theory and Applications -
  Volume 5: VISAPP, ISBN 978-989-758-555-5; ISSN 2184-4321, year 2022, pages
  456-466",10.5220/0010838400003124,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In recent years multi-label, multi-class video action recognition has gained
significant popularity. While reasoning over temporally connected atomic
actions is mundane for intelligent species, standard artificial neural networks
(ANN) still struggle to classify them. In the real world, atomic actions often
temporally connect to form more complex composite actions. The challenge lies
in recognising composite action of varying durations while other distinct
composite or atomic actions occur in the background. Drawing upon the success
of relational networks, we propose methods that learn to reason over the
semantic concept of objects and actions. We empirically show how ANNs benefit
from pretraining, relational inductive biases and unordered set-based latent
representations. In this paper we propose deep set conditioned I3D (SCI3D), a
two stream relational network that employs latent representation of state and
visual representation for reasoning over events and actions. They learn to
reason about temporally connected actions in order to identify all of them in
the video. The proposed method achieves an improvement of around 1.49% mAP in
atomic action recognition and 17.57% mAP in composite action recognition, over
a I3D-NL baseline, on the CATER dataset.
","[{'version': 'v1', 'created': 'Wed, 21 Dec 2022 14:11:46 GMT'}]",2022-12-22,"[['Singh', 'Akash', ''], ['De Schepper', 'Tom', ''], ['Mets', 'Kevin', ''], ['Hellinckx', 'Peter', ''], ['Oramas', 'Jose', ''], ['Latre', 'Steven', '']]","['Action Recognition', 'Deep Sets', 'Deep Learning']"
12089,2009.08451,Siddharth Bhatia,"Siddharth Bhatia, Arjit Jain, Pan Li, Ritesh Kumar, Bryan Hooi",MSTREAM: Fast Anomaly Detection in Multi-Aspect Streams,"The Web Conference (WWW), 2021",,10.1145/3442381.3450023,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a stream of entries in a multi-aspect data setting i.e., entries having
multiple dimensions, how can we detect anomalous activities in an unsupervised
manner? For example, in the intrusion detection setting, existing work seeks to
detect anomalous events or edges in dynamic graph streams, but this does not
allow us to take into account additional attributes of each entry. Our work
aims to define a streaming multi-aspect data anomaly detection framework,
termed MSTREAM which can detect unusual group anomalies as they occur, in a
dynamic manner. MSTREAM has the following properties: (a) it detects anomalies
in multi-aspect data including both categorical and numeric attributes; (b) it
is online, thus processing each record in constant time and constant memory;
(c) it can capture the correlation between multiple aspects of the data.
MSTREAM is evaluated over the KDDCUP99, CICIDS-DoS, UNSW-NB 15 and CICIDS-DDoS
datasets, and outperforms state-of-the-art baselines.
","[{'version': 'v1', 'created': 'Thu, 17 Sep 2020 17:59:16 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Oct 2020 14:11:06 GMT'}, {'version': 'v3', 'created': 'Sun, 14 Feb 2021 23:42:21 GMT'}, {'version': 'v4', 'created': 'Tue, 30 Mar 2021 14:49:02 GMT'}]",2021-06-09,"[['Bhatia', 'Siddharth', ''], ['Jain', 'Arjit', ''], ['Li', 'Pan', ''], ['Kumar', 'Ritesh', ''], ['Hooi', 'Bryan', '']]","['Anomaly Detection', 'Multi-Aspect Data', 'Stream', 'Intrusion Detection']"
12090,1708.03513,Matilda Rhode,"Matilda Rhode, Pete Burnap, Kevin Jones",Early Stage Malware Prediction Using Recurrent Neural Networks,,"Computers & Security, Volume 77, August 2018, Pages 578-594",10.1016/j.cose.2018.05.010,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Static malware analysis is well-suited to endpoint anti-virus systems as it
can be conducted quickly by examining the features of an executable piece of
code and matching it to previously observed malicious code. However, static
code analysis can be vulnerable to code obfuscation techniques. Behavioural
data collected during file execution is more difficult to obfuscate, but takes
a relatively long time to capture - typically up to 5 minutes, meaning the
malicious payload has likely already been delivered by the time it is detected.
  In this paper we investigate the possibility of predicting whether or not an
executable is malicious based on a short snapshot of behavioural data. We find
that an ensemble of recurrent neural networks are able to predict whether an
executable is malicious or benign within the first 5 seconds of execution with
94% accuracy. This is the first time general types of malicious file have been
predicted to be malicious during execution rather than using a complete
activity log file post-execution, and enables cyber security endpoint
protection to be advanced to use behavioural data for blocking malicious
payloads rather than detecting them post-execution and having to repair the
damage.
","[{'version': 'v1', 'created': 'Fri, 11 Aug 2017 12:11:23 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Dec 2017 15:53:34 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Jun 2018 17:54:01 GMT'}]",2018-06-19,"[['Rhode', 'Matilda', ''], ['Burnap', 'Pete', ''], ['Jones', 'Kevin', '']]","['malware detection', 'intrusion detection', 'recurrent neural networks', 'machinelearning', 'deep learning']"
12091,2005.11608,Sheriffo Ceesay,"Sheriffo Ceesay, Adam Barker, Yuhui Lin","Benchmarking and Performance Modelling of MapReduce Communication
  Pattern","8 pages, 10 figures","2019 IEEE International Conference on Cloud Computing Technology
  and Science (CloudCom)",10.1109/CloudCom.2019.00029,,cs.DC cs.LG cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding and predicting the performance of big data applications running
in the cloud or on-premises could help minimise the overall cost of operations
and provide opportunities in efforts to identify performance bottlenecks. The
complexity of the low-level internals of big data frameworks and the ubiquity
of application and workload configuration parameters makes it challenging and
expensive to come up with comprehensive performance modelling solutions.
  In this paper, instead of focusing on a wide range of configurable
parameters, we studied the low-level internals of the MapReduce communication
pattern and used a minimal set of performance drivers to develop a set of phase
level parametric models for approximating the execution time of a given
application on a given cluster. Models can be used to infer the performance of
unseen applications and approximate their performance when an arbitrary dataset
is used as input. Our approach is validated by running empirical experiments in
two setups. On average the error rate in both setups is plus or minus 10% from
the measured values.
","[{'version': 'v1', 'created': 'Sat, 23 May 2020 21:52:29 GMT'}]",2020-05-26,"[['Ceesay', 'Sheriffo', ''], ['Barker', 'Adam', ''], ['Lin', 'Yuhui', '']]","['Communication Patterns', 'Modelling', 'MapReduce', 'Big Data']"
12092,2010.02595,Robert Y. Lewis,Johan Commelin and Robert Y. Lewis,Formalizing the Ring of Witt Vectors,,Proceedings of Certified Programs and Proofs (CPP 2021),10.1145/3437992.3439919,,cs.LO math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ring of Witt vectors $\mathbb{W} R$ over a base ring $R$ is an important
tool in algebraic number theory and lies at the foundations of modern $p$-adic
Hodge theory. $\mathbb{W} R$ has the interesting property that it constructs a
ring of characteristic $0$ out of a ring of characteristic $p > 1$, and it can
be used more specifically to construct from a finite field containing
$\mathbb{Z}/p\mathbb{Z}$ the corresponding unramified field extension of the
$p$-adic numbers $\mathbb{Q}_p$ (which is unique up to isomorphism).
  We formalize the notion of a Witt vector in the Lean proof assistant, along
with the corresponding ring operations and other algebraic structure. We prove
in Lean that, for prime $p$, the ring of Witt vectors over
$\mathbb{Z}/p\mathbb{Z}$ is isomorphic to the ring of $p$-adic integers
$\mathbb{Z}_p$. In the process we develop idioms to cleanly handle calculations
of identities between operations on the ring of Witt vectors. These
calculations are intractable with a naive approach, and require a proof
technique that is usually skimmed over in the informal literature. Our proofs
resemble the informal arguments while being fully rigorous.
","[{'version': 'v1', 'created': 'Tue, 6 Oct 2020 10:10:46 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Dec 2020 17:20:40 GMT'}]",2020-12-24,"[['Commelin', 'Johan', ''], ['Lewis', 'Robert Y.', '']]","['formal math', 'ring theory', 'number theory', 'Lean', 'proof assistant']"
12093,2105.02354,Zhiyu Chen,"Zhiyu Chen, Shuo Zhang, Brian D. Davison",WTR: A Test Collection for Web Table Retrieval,Accepted as a resource paper in SIGIR 2021,,10.1145/3404835.3463260,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe the development, characteristics and availability of a test
collection for the task of Web table retrieval, which uses a large-scale Web
Table Corpora extracted from the Common Crawl. Since a Web table usually has
rich context information such as the page title and surrounding paragraphs, we
not only provide relevance judgments of query-table pairs, but also the
relevance judgments of query-table context pairs with respect to a query, which
are ignored by previous test collections. To facilitate future research with
this benchmark, we provide details about how the dataset is pre-processed and
also baseline results from both traditional and recently proposed table
retrieval methods. Our experimental results show that proper usage of context
labels can benefit previous table retrieval methods.
","[{'version': 'v1', 'created': 'Wed, 5 May 2021 22:25:23 GMT'}]",2021-05-07,"[['Chen', 'Zhiyu', ''], ['Zhang', 'Shuo', ''], ['Davison', 'Brian D.', '']]","['datasets', 'table search', 'dataset search']"
12094,2010.00386,Fabrizia Auletta,"Fabrizia Auletta, Davide Fiore, Michael J. Richardson, Mario di
  Bernardo","Herding stochastic autonomous agents via local control rules and online
  global target selection strategies",,"Autonomous Robots, vol. 46, pp. 469-481, 2022",10.1007/s10514-021-10033-6,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this Paper we propose a simple yet effective set of local control rules to
make a group of ""herder agents"" collect and contain in a desired region an
ensemble of non-cooperative stochastic ""target agents"" in the plane. We
investigate the robustness of the proposed strategies to variations of the
number of target agents and the strength of the repulsive force they feel when
in proximity of the herders. Extensive numerical simulations confirm the
effectiveness of the approach and are complemented by a more realistic
validation on commercially available robotic agents via ROS.
","[{'version': 'v1', 'created': 'Thu, 1 Oct 2020 13:26:27 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Dec 2020 13:21:04 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Apr 2021 16:33:14 GMT'}]",2022-09-28,"[['Auletta', 'Fabrizia', ''], ['Fiore', 'Davide', ''], ['Richardson', 'Michael J.', ''], ['di Bernardo', 'Mario', '']]","['Agent-Based Systems', 'Biologically-Inspired Agents', 'Autonomous Agents', 'Multi-Robot Systems']"
12095,1903.05488,Jakub Krzywda,"Jakub Krzywda and Ahmed Ali-Eldin and Trevor E. Carlson and Per-Olov
  \""Ostberg and Erik Elmroth","Power-Performance Tradeoffs in Data Center Servers: DVFS, CPU pinning,
  Horizontal, and Vertical Scaling",31 pages,"Future Generation Computer Systems, Elsevier, Vol. 81, pp.
  114-128, 2018",10.1016/j.future.2017.10.044,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dynamic Voltage and Frequency Scaling (DVFS), CPU pinning, horizontal, and
vertical scaling, are four techniques that have been proposed as actuators to
control the performance and energy consumption on data center servers. This
work investigates the utility of these four actuators, and quantifies the
power-performance tradeoffs associated with them. Using replicas of the German
Wikipedia running on our local testbed, we perform a set of experiments to
quantify the influence of DVFS, vertical and horizontal scaling, and CPU
pinning on end-to-end response time (average and tail), throughput, and power
consumption with different workloads. Results of the experiments show that DVFS
rarely reduces the power consumption of underloaded servers by more than 5%,
but it can be used to limit the maximal power consumption of a saturated server
by up to 20% (at a cost of performance degradation). CPU pinning reduces the
power consumption of underloaded server (by up to 7%) at the cost of
performance degradation, which can be limited by choosing an appropriate CPU
pinning scheme. Horizontal and vertical scaling improves both the average and
tail response time, but the improvement is not proportional to the amount of
resources added. The load balancing strategy has a big impact on the tail
response time of horizontally scaled applications.
","[{'version': 'v1', 'created': 'Wed, 13 Mar 2019 13:50:27 GMT'}]",2019-03-14,"[['Krzywda', 'Jakub', ''], ['Ali-Eldin', 'Ahmed', ''], ['Carlson', 'Trevor E.', ''], ['Östberg', 'Per-Olov', ''], ['Elmroth', 'Erik', '']]","['Power-performance tradeoffs', 'Dynamic Voltage and Frequency Scaling(DVFS)', 'CPU pinning', 'horizontal scaling', 'vertical scaling']"
12096,1910.13372,Pieter Robberechts,"Pieter Robberechts, Rud Derie, Pieter Van den Berghe, Joeri Gerlo,
  Dirk De Clercq, Veerle Segers, Jesse Davis","Predicting gait events from tibial acceleration in rearfoot running: a
  structured machine learning approach",,"Gait & Posture, Volume 84, 2021, Pages 87-92",10.1016/j.gaitpost.2020.10.035,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Gait event detection of the initial contact and toe off is essential for
running gait analysis, allowing the derivation of parameters such as stance
time. Heuristic-based methods exist to estimate these key gait events from
tibial accelerometry. However, these methods are tailored to very specific
acceleration profiles, which may offer complications when dealing with larger
data sets and inherent biological variability. Therefore, this paper
investigates whether a structured machine learning approach can achieve a more
accurate prediction of running gait event timings from tibial accelerometry.
Force-based event detection acted as the criterion measure in order to assess
the accuracy, repeatability and sensitivity of the predicted gait events. A
heuristic method and two structured machine learning methods were employed to
derive initial contact, toe off and stance time from tibial acceleration
signals. Both a structured perceptron model (median absolute error of stance
time estimation: 10.00 $\pm$ 8.73 ms) and a structured recurrent neural network
model (median absolute error of stance time estimation: 6.50 $\pm$ 5.74 ms)
significantly outperformed the existing heuristic approach (median absolute
error of stance time estimation: 11.25 $\pm$ 9.52 ms) on data from 93 rearfoot
runners. Thus, results indicate that a structured recurrent neural network
machine learning model offers the most accurate and consistent estimation of
the gait events and its derived stance time during level overground running.
The machine learning methods seem less affected by intra- and inter-subject
variation within the data, allowing for accurate and efficient automated data
output during rearfoot overground running. Furthermore offering possibilities
for real-time monitoring and biofeedback during prolonged measurements, even
outside the laboratory.
","[{'version': 'v1', 'created': 'Tue, 29 Oct 2019 16:36:04 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Dec 2019 15:17:18 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Dec 2020 12:20:51 GMT'}]",2020-12-15,"[['Robberechts', 'Pieter', ''], ['Derie', 'Rud', ''], ['Berghe', 'Pieter Van den', ''], ['Gerlo', 'Joeri', ''], ['De Clercq', 'Dirk', ''], ['Segers', 'Veerle', ''], ['Davis', 'Jesse', '']]","['Running', 'Gait event detection', 'Machine learning', 'Structured prediction']"
12097,cs/0211031,Paolo Liberatore,Paolo Liberatore,Redundancy in Logic I: CNF Propositional Formulae,"Extended and revised version of a paper that has been presented at
  ECAI 2002",,10.1016/j.artint.2004.11.002,,cs.AI cs.CC,,"  A knowledge base is redundant if it contains parts that can be inferred from
the rest of it. We study the problem of checking whether a CNF formula (a set
of clauses) is redundant, that is, it contains clauses that can be derived from
the other ones. Any CNF formula can be made irredundant by deleting some of its
clauses: what results is an irredundant equivalent subset (I.E.S.) We study the
complexity of some related problems: verification, checking existence of a
I.E.S. with a given size, checking necessary and possible presence of clauses
in I.E.S.'s, and uniqueness. We also consider the problem of redundancy with
different definitions of equivalence.
","[{'version': 'v1', 'created': 'Fri, 22 Nov 2002 18:23:22 GMT'}]",2007-07-25,"[['Liberatore', 'Paolo', '']]","['propositional logic', 'redundancy', 'formula minimization', 'computational complexity']"
12098,2202.03367,Sebasti\'an Pizard,Sebasti\'an Pizard and Diego Vallespir and Barbara Kitchenham,"A longitudinal case study on the effects of an evidence-based software
  engineering training",https://conf.researchr.org/details/icse-2022/icse-2022-seet/20/A-longitudinal-case-study-on-the-effects-of-an-evidence-based-software-engineering-tr,,10.1145/3510456.3514150,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Context: Evidence-based software engineering (EBSE) can be an effective
resource to bridge the gap between academia and industry by balancing research
of practical relevance and academic rigor. To achieve this, it seems necessary
to investigate EBSE training and its benefits for the practice. Objective: We
sought both to develop an EBSE training course for university students and to
investigate what effects it has on the attitudes and behaviors of the trainees.
Method: We conducted a longitudinal case study to study our EBSE course and its
effects. For this, we collect data at the end of each EBSE course (2017, 2018,
and 2019), and in two follow-up surveys (one after 7 months of finishing the
last course, and a second after 21 months). Results: Our EBSE courses seem to
have taught students adequately and consistently. Half of the respondents to
the surveys report making use of the new skills from the course. The
most-reported effects in both surveys indicated that EBSE concepts increase
awareness of the value of research and evidence and EBSE methods improve
information gathering skills. Conclusions: As suggested by research in other
areas, training appears to play a key role in the adoption of evidence-based
practice. Our results indicate that our training method provides an
introduction to EBSE suitable for undergraduates. However, we believe it is
necessary to continue investigating EBSE training and its impact on software
engineering practice.
","[{'version': 'v1', 'created': 'Mon, 7 Feb 2022 17:26:58 GMT'}]",2022-02-08,"[['Pizard', 'Sebastián', ''], ['Vallespir', 'Diego', ''], ['Kitchenham', 'Barbara', '']]","['Evidence-based software engineering', 'evidence-based practice', 'training', 'longitudinal case study']"
12099,1904.05853,Noga Agmon,"Noga Agmon, Asaf Shabtai, Rami Puzis",Deployment Optimization of IoT Devices through Attack Graph Analysis,,,10.1145/3317549.3323411,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Internet of things (IoT) has become an integral part of our life at both
work and home. However, these IoT devices are prone to vulnerability exploits
due to their low cost, low resources, the diversity of vendors, and proprietary
firmware. Moreover, short range communication protocols (e.g., Bluetooth or
ZigBee) open additional opportunities for the lateral movement of an attacker
within an organization. Thus, the type and location of IoT devices may
significantly change the level of network security of the organizational
network. In this paper, we quantify the level of network security based on an
augmented attack graph analysis that accounts for the physical location of IoT
devices and their communication capabilities. We use the depth-first branch and
bound (DFBnB) heuristic search algorithm to solve two optimization problems:
Full Deployment with Minimal Risk (FDMR) and Maximal Utility without Risk
Deterioration (MURD). An admissible heuristic is proposed to accelerate the
search. The proposed method is evaluated using a real network with simulated
deployment of IoT devices. The results demonstrate (1) the contribution of the
augmented attack graphs to quantifying the impact of IoT devices deployed
within the organization on security, and (2) the effectiveness of the optimized
IoT deployment.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2019 17:15:11 GMT'}]",2019-04-12,"[['Agmon', 'Noga', ''], ['Shabtai', 'Asaf', ''], ['Puzis', 'Rami', '']]","['Attack graphs', 'Internet of Things', 'IoT deployment', 'Optimization', 'Short-Range Communication']"
12100,2003.03599,Armin Pournaki,"Armin Pournaki, Felix Gaisbauer, Sven Banisch, Eckehard Olbrich","The Twitter Explorer: a Framework for Observing Twitter through
  Interactive Networks","13 pages, 5 figures","Journal of Digital Social Research. 3, 1 (Mar. 2021)",10.33621/jdsr.v3i1.64,,cs.SI,http://creativecommons.org/licenses/by-sa/4.0/,"  We present an open-source interface for scientists to explore Twitter data
through interactive network visualizations. Combining data collection,
transformation and visualization in one easily accessible framework, the
twitter explorer connects distant and close reading of Twitter data through the
interactive exploration of interaction networks and semantic networks. By
lowering the technological barriers of data-driven research, it aims to attract
researchers from various disciplinary backgrounds and facilitates new
perspectives in the thriving field of computational social science.
","[{'version': 'v1', 'created': 'Sat, 7 Mar 2020 16:19:11 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Apr 2021 16:45:36 GMT'}]",2021-04-08,"[['Pournaki', 'Armin', ''], ['Gaisbauer', 'Felix', ''], ['Banisch', 'Sven', ''], ['Olbrich', 'Eckehard', '']]","['Twitter', 'complex networks', 'interface', 'digital methods', 'computational social science']"
12101,2108.06771,Samah Khawaled,"Samah Khawaled, Moti Freiman","NPBDREG: Uncertainty Assessment in Diffeomorphic Brain MRI Registration
  using a Non-parametric Bayesian Deep-Learning Based Approach","To appear in Computerized Medical Imaging and Graphics, DOI:
  https://doi.org/10.1016/j.compmedimag.2022.102087. This is an extension
  representing a more comprehensive work extending preliminary work presented
  at arXiv:2008.03949",,10.1016/j.compmedimag.2022.102087,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quantification of uncertainty in deep-neural-networks (DNN) based image
registration algorithms plays a critical role in the deployment of image
registration algorithms for clinical applications such as surgical planning,
intraoperative guidance, and longitudinal monitoring of disease progression or
treatment efficacy as well as in research-oriented processing pipelines.
Currently available approaches for uncertainty estimation in DNN-based image
registration algorithms may result in sub-optimal clinical decision making due
to potentially inaccurate estimation of the uncertainty of the registration
stems for the assumed parametric distribution of the registration latent space.
We introduce NPBDREG, a fully non-parametric Bayesian framework for uncertainty
estimation in DNN-based deformable image registration by combining an Adam
optimizer with stochastic gradient Langevin dynamics (SGLD) to characterize the
underlying posterior distribution through posterior sampling. Thus, it has the
potential to provide uncertainty estimates that are highly correlated with the
presence of out of distribution data. We demonstrated the added-value of
NPBDREG, compared to the baseline probabilistic VoxelMorph model (PrVXM), on
brain MRI image registration using $390$ image pairs from four publicly
available databases: MGH10, CMUC12, ISBR18 and LPBA40. The NPBDREG shows a
better correlation of the predicted uncertainty with out-of-distribution data
($r>0.95$ vs. $r<0.5$) as well as a 7.3%improvement in the registration
accuracy (Dice score, $0.74$ vs. $0.69$, $p \ll 0.01$), and 18% improvement in
registration smoothness (percentage of folds in the deformation field, 0.014
vs. 0.017, $p \ll 0.01$). Finally, NPBDREG demonstrated a better generalization
capability for data corrupted by a mixed structure noise (Dice score of $0.73$
vs. $0.69$, $p \ll 0.01$) compared to the baseline PrVXM approach.
","[{'version': 'v1', 'created': 'Sun, 15 Aug 2021 16:00:06 GMT'}, {'version': 'v2', 'created': 'Sun, 29 Aug 2021 06:51:53 GMT'}, {'version': 'v3', 'created': 'Thu, 28 Apr 2022 14:32:56 GMT'}, {'version': 'v4', 'created': 'Thu, 9 Jun 2022 06:40:18 GMT'}]",2022-06-10,"[['Khawaled', 'Samah', ''], ['Freiman', 'Moti', '']]","['Brain MRI', 'Bayesian Deep-learning', 'Deformable imageregistration', 'Uncertainty estimation']"
12102,2212.00528,Sarah E Carter,Sarah E. Carter,"A Value-Centered Exploration of Data Privacy and Personalized Privacy
  Assistants",,"DISO 1, 27 (2022)",10.1007/s44206-022-00028-w,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  In the the current post-GDPR landscape, privacy notices have become ever more
prevalent on our phones and online. However, these notices are not well suited
to their purpose of helping users make informed decisions. I suggest that
instead of utilizing notice to eliciting informed consent, we could repurpose
privacy notices to create the space for more meaningful, value-centered user
decisions. Value-centered privacy decisions, or those that accurately reflect
who we are and what we value, encapsulate the intuitive role of personal values
in data privacy decisions. To explore how notices could be repurposed to
support such decisions, I utilize Suzy Killmister's four-dimensional theory of
autonomy (4DT) to operationalize value-centered privacy decisions. I then
assess the degree that an existing technology, Personalized Privacy Assistants
(PPAs), uses notices in a manner that allows for value-centered
decision-making. Lastly, I explore the implications of the PPA assessment for
designing a new assistant, called a value-centered privacy assistant (VcPA). A
VcPA could ideally utilized notice to assists users in value-centered app
selection and in other data privacy decisions.
","[{'version': 'v1', 'created': 'Thu, 1 Dec 2022 14:26:33 GMT'}]",2022-12-02,"[['Carter', 'Sarah E.', '']]","['DATA PRIVACY', 'PRIVACY NOTICE', 'PRIVACY ASSISTANT', 'AUTONOMY', 'VALUES']"
12103,2011.10307,Margaux Nattaf,"Margaux Nattaf (G-SCOP), Arnaud Malapert","Filtering Rules for Flow Time Minimization in a Parallel Machine
  Scheduling Problem",,"CP 2020: Principles and Practice of Constraint Programming,
  pp.462-477, 2020",10.1007/978-3-030-58475-7_27,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies the scheduling of jobs of different families on parallel
machines with qualification constraints. Originating from semiconductor
manufacturing, this constraint imposes a time threshold between the execution
of two jobs of the same family. Otherwise, the machine becomes disqualified for
this family. The goal is to minimize both the flow time and the number of
disqualifications. Recently, an efficient constraint programming model has been
proposed. However, when priority is given to the flow time objective, the
efficiency of the model can be improved. This paper uses a polynomial-time
algorithm which minimize the flow time for a single machine relaxation where
disqualifications are not considered. Using this algorithm one can derived
filtering rules on different variables of the model. Experimental results are
presented showing the effectiveness of these rules. They improve the
competitiveness with the mixed integer linear program of the literature.
","[{'version': 'v1', 'created': 'Fri, 20 Nov 2020 10:00:14 GMT'}]",2020-11-23,"[['Nattaf', 'Margaux', '', 'G-SCOP'], ['Malapert', 'Arnaud', '']]","['Parallel Machine Scheduling', 'Job families', 'Flow time', 'Machine Disqualification', 'Filtering Algorithm', 'Cost-Based Filtering']"
12104,1601.06610,Diederik Aerts,"Diederik Aerts, Jan Broekaert, Liane Gabora and Sandro Sozzo",Generalizing Prototype Theory: A Formal Quantum Framework,"30 pages, 3 figures","Frontiers in Psychology 7, 418, (2016)",10.3389/fpsyg.2016.00418,,cs.AI quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Theories of natural language and concepts have been unable to model the
flexibility, creativity, context-dependence, and emergence, exhibited by words,
concepts and their combinations. The mathematical formalism of quantum theory
has instead been successful in capturing these phenomena such as graded
membership, situational meaning, composition of categories, and also more
complex decision making situations, which cannot be modeled in traditional
probabilistic approaches. We show how a formal quantum approach to concepts and
their combinations can provide a powerful extension of prototype theory. We
explain how prototypes can interfere in conceptual combinations as a
consequence of their contextual interactions, and provide an illustration of
this using an intuitive wave-like diagram. This quantum-conceptual approach
gives new life to original prototype theory, without however making it a
privileged concept theory, as we explain at the end of our paper.
","[{'version': 'v1', 'created': 'Mon, 25 Jan 2016 14:12:59 GMT'}]",2016-09-09,"[['Aerts', 'Diederik', ''], ['Broekaert', 'Jan', ''], ['Gabora', 'Liane', ''], ['Sozzo', 'Sandro', '']]","['Cognition', 'Concept theory', 'Prototype theory', 'Contextuality', 'Interference', 'Quantum modeling']"
12105,2204.14103,Matteo Spallanzani,"Thorir Mar Ingolfsson, Mark Vero, Xiaying Wang, Lorenzo Lamberti, Luca
  Benini, Matteo Spallanzani","Reducing Neural Architecture Search Spaces with Training-Free Statistics
  and Computational Graph Clustering",,,10.1145/3528416.3530873,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The computational demands of neural architecture search (NAS) algorithms are
usually directly proportional to the size of their target search spaces. Thus,
limiting the search to high-quality subsets can greatly reduce the
computational load of NAS algorithms. In this paper, we present
Clustering-Based REDuction (C-BRED), a new technique to reduce the size of NAS
search spaces. C-BRED reduces a NAS space by clustering the computational
graphs associated with its architectures and selecting the most promising
cluster using proxy statistics correlated with network accuracy. When
considering the NAS-Bench-201 (NB201) data set and the CIFAR-100 task, C-BRED
selects a subset with 70% average accuracy instead of the whole space's 64%
average accuracy.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2022 13:52:35 GMT'}]",2022-05-02,"[['Ingolfsson', 'Thorir Mar', ''], ['Vero', 'Mark', ''], ['Wang', 'Xiaying', ''], ['Lamberti', 'Lorenzo', ''], ['Benini', 'Luca', ''], ['Spallanzani', 'Matteo', '']]","['deep learning', 'neural architecture search', 'training-free statistics', 'computational graph', 'clustering']"
12106,1902.04444,Nikolaos Athanasios Anagnostopoulos,"Andr\'e Schaller, Wenjie Xiong, Nikolaos Athanasios Anagnostopoulos,
  Muhammad Umair Saleem, Sebastian Gabmeyer, Stefan Katzenbeisser and Jakub
  Szefer","Intrinsic Rowhammer PUFs: Leveraging the Rowhammer Effect for Improved
  Security","Copyright held by IEEE. Personal use of this material is permitted.
  Permission from IEEE must be obtained for all other uses, in any current or
  future media, including reprinting/republishing this material for advertising
  or promotional purposes, creating new collective works, for resale or
  redistribution to servers or lists, or reuse of any copyrighted component of
  this work in other works","A. Schaller et al., ""Intrinsic Rowhammer PUFs: Leveraging the
  Rowhammer Effect for Improved Security,"" 2017 IEEE International Symposium on
  Hardware Oriented Security and Trust (HOST), McLean, VA, 2017",10.1109/HST.2017.7951729,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Physically Unclonable Functions (PUFs) have become an important and promising
hardware primitive for device fingerprinting, device identification, or key
storage. Intrinsic PUFs leverage components already found in existing devices,
unlike extrinsic silicon PUFs, which are based on customized circuits that
involve modification of hardware. In this work, we present a new type of a
memory-based intrinsic PUF, which leverages the Rowhammer effect in DRAM
modules; the Rowhammer PUF. Our PUF makes use of bit flips, which occur in DRAM
cells due to rapid and repeated access of DRAM rows. Prior research has mainly
focused on Rowhammer attacks, where the Rowhammer effect is used to
illegitimately alter data stored in memory, e.g., to change page table entries
or enable privilege escalation attacks. Meanwhile, this is the first work to
use the Rowhammer effect in a positive context: to design a novel PUF. We
extensively evaluate the Rowhammer PUF using commercial, off-the-shelf devices,
not relying on custom hardware or an FPGA-based setup. The evaluation shows
that the Rowhammer PUF holds required properties needed for the envisioned
security applications, and could be deployed today.
","[{'version': 'v1', 'created': 'Tue, 12 Feb 2019 15:35:24 GMT'}]",2019-02-13,"[['Schaller', 'André', ''], ['Xiong', 'Wenjie', ''], ['Anagnostopoulos', 'Nikolaos Athanasios', ''], ['Saleem', 'Muhammad Umair', ''], ['Gabmeyer', 'Sebastian', ''], ['Katzenbeisser', 'Stefan', ''], ['Szefer', 'Jakub', '']]","['rowhammer', 'physical unclonable function', 'security', 'dynamic random access memory', 'PUF', 'DRAM', 'DRAM retention']"
12107,2206.11118,Jixiang Chen,Jixiang Chen and Fu Luo and Zhenkun Wang,"Dynamic Multi-objective Ensemble of Acquisition Functions in Batch
  Bayesian Optimization","4 pages, GECCO 2022",,10.1145/3520304.3529083,,cs.NE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Bayesian optimization (BO) is a typical approach to solve expensive
optimization problems. In each iteration of BO, a Gaussian process(GP) model is
trained using the previously evaluated solutions; then next candidate solutions
for expensive evaluation are recommended by maximizing a cheaply-evaluated
acquisition function on the trained surrogate model. The acquisition function
plays a crucial role in the optimization process. However, each acquisition
function has its own strengths and weaknesses, and no single acquisition
function can consistently outperform the others on all kinds of problems. To
better leverage the advantages of different acquisition functions, we propose a
new method for batch BO. In each iteration, three acquisition functions are
dynamically selected from a set based on their current and historical
performance to form a multi-objective optimization problem (MOP). Using an
evolutionary multi-objective algorithm to optimize such a MOP, a set of
non-dominated solutions can be obtained. To select batch candidate solutions,
we rank these non-dominated solutions into several layers according to their
relative performance on the three acquisition functions. The empirical results
show that the proposed method is competitive with the state-of-the-art methods
on different problems.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2022 14:09:18 GMT'}]",2022-06-23,"[['Chen', 'Jixiang', ''], ['Luo', 'Fu', ''], ['Wang', 'Zhenkun', '']]","['Bayesian Optimization', 'Parallel', 'Batch', 'Dynamic selection', 'Acquisition function', 'Multi-objective Optimization', 'Ensemble']"
12108,2010.05050,Yicheng Luo,"Yicheng Luo, Antonio Filieri, Yuan Zhou","Symbolic Parallel Adaptive Importance Sampling for Probabilistic Program
  Analysis",Extended pre-print version of ESEC/FSE '21 paper,,10.1145/3468264.3468593,,cs.LG cs.AI cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Probabilistic software analysis aims at quantifying the probability of a
target event occurring during the execution of a program processing uncertain
incoming data or written itself using probabilistic programming constructs.
Recent techniques combine symbolic execution with model counting or solution
space quantification methods to obtain accurate estimates of the occurrence
probability of rare target events, such as failures in a mission-critical
system. However, they face several scalability and applicability limitations
when analyzing software processing with high-dimensional and correlated
multivariate input distributions. In this paper, we present SYMbolic Parallel
Adaptive Importance Sampling (SYMPAIS), a new inference method tailored to
analyze path conditions generated from the symbolic execution of programs with
high-dimensional, correlated input distributions. SYMPAIS combines results from
importance sampling and constraint solving to produce accurate estimates of the
satisfaction probability for a broad class of constraints that cannot be
analyzed by current solution space quantification methods. We demonstrate
SYMPAIS's generality and performance compared with state-of-the-art
alternatives on a set of problems from different application domains.
","[{'version': 'v1', 'created': 'Sat, 10 Oct 2020 17:39:12 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Jun 2021 19:32:14 GMT'}]",2021-06-21,"[['Luo', 'Yicheng', ''], ['Filieri', 'Antonio', ''], ['Zhou', 'Yuan', '']]","['symbolic execution', 'probabilistic analysis', 'probabilistic programming', 'importance sampling', 'Markov chain Monte Carlo']"
12109,2201.10623,Tarik A. Rashid,"Hozan K. Hamarashid, Soran A. Saeed, Tarik A. Rashid","A comprehensive review and evaluation on text predictive and
  entertainment systems",42 pages,"Soft computing, 2022",10.1007/s00500-021-06691-4,,cs.NE,http://creativecommons.org/licenses/by/4.0/,"  One of the most important ways to experience communication and interact with
the systems is by handling the prediction of the most likely words to happen
after typing letters or words. It is helpful for people with disabilities due
to disabling people who could type or enter texts at a limited slow speed.
Also, it is beneficial for people with dyslexia and those people who are not
well with spells of words. Though, an input technology, for instance, the next
word suggestion facilitates the typing process in smartphones as an example.
This means that when a user types a word, then the system suggests the next
words to be chosen in which the necessary word by the user. Besides, it can be
used in entertainment as a gam, for example, to determine a target word and
reach it or tackle it within 10 attempts of prediction. Generally, the systems
depend on a text corpus, which was provided in the system to conduct the
prediction. Writing every single word is time-consuming, therefore, it is
vitally important to decrease time consumption by reducing efforts to input
texts in the systems by offering most probable words for the user to select,
this could be done via next word prediction systems. There are several
techniques can be found in literature, which is utilized to conduct a variety
of next word prediction systems by using different approaches. In this paper, a
survey of miscellaneous techniques towards the next word prediction systems
will be addressed. Besides, the evaluation of the prediction systems will be
discussed. Then, a modal technique will be determined to be utilized for the
next word prediction system from the perspective of easiness of implementation
and obtaining a good result.
","[{'version': 'v1', 'created': 'Sat, 8 Jan 2022 10:27:30 GMT'}]",2022-01-27,"[['Hamarashid', 'Hozan K.', ''], ['Saeed', 'Soran A.', ''], ['Rashid', 'Tarik A.', '']]","['Machine learning', 'Next-word prediction', 'next word suggestion techniques', 'word']"
12110,1910.06156,Alessio Netti,"Alessio Netti, Micha Mueller, Carla Guillen, Michael Ott, Daniele
  Tafani, Gence Ozer and Martin Schulz","DCDB Wintermute: Enabling Online and Holistic Operational Data Analytics
  on HPC Systems","Accepted for publication at the 29th ACM International Symposium on
  High-Performance Parallel and Distributed Computing (HPDC 2020)",,10.1145/3369583.3392674,,cs.DC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As we approach the exascale era, the size and complexity of HPC systems
continues to increase, raising concerns about their manageability and
sustainability. For this reason, more and more HPC centers are experimenting
with fine-grained monitoring coupled with Operational Data Analytics (ODA) to
optimize efficiency and effectiveness of system operations. However, while
monitoring is a common reality in HPC, there is no well-stated and
comprehensive list of requirements, nor matching frameworks, to support
holistic and online ODA. This leads to insular ad-hoc solutions, each
addressing only specific aspects of the problem.
  In this paper we propose Wintermute, a novel generic framework to enable
online ODA on large-scale HPC installations. Its design is based on the results
of a literature survey of common operational requirements. We implement
Wintermute on top of the holistic DCDB monitoring system, offering a large
variety of configuration options to accommodate the varying requirements of ODA
applications. Moreover, Wintermute is based on a set of logical abstractions to
ease the configuration of models at a large scale and maximize code re-use. We
highlight Wintermute's flexibility through a series of practical case studies,
each targeting a different aspect of the management of HPC systems, and then
demonstrate the small resource footprint of our implementation.
","[{'version': 'v1', 'created': 'Mon, 14 Oct 2019 14:05:52 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Apr 2020 18:04:48 GMT'}]",2020-04-21,"[['Netti', 'Alessio', ''], ['Mueller', 'Micha', ''], ['Guillen', 'Carla', ''], ['Ott', 'Michael', ''], ['Tafani', 'Daniele', ''], ['Ozer', 'Gence', ''], ['Schulz', 'Martin', '']]","['High-Performance Computing', 'Monitoring', 'Operational Data Analytics', 'System Management', 'Online Analysis']"
12111,2010.07517,Mehdi Neshat,"Martin Schlueter, Mehdi Neshat, Mohamed Wahib, Masaharu Munetomo,
  Markus Wagner",GTOPX Space Mission Benchmarks,,,10.1016/j.softx.2021.100666,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This contribution introduces the GTOPX space mission benchmark collection,
which is an extension of GTOP database published by the European Space Agency
(ESA). GTOPX consists of ten individual benchmark instances representing
real-world interplanetary space trajectory design problems. In regard to the
original GTOP collection, GTOPX includes three new problem instances featuring
mixed-integer and multi-objective properties. GTOPX enables a simplified user
handling, unified benchmark function call and some minor bug corrections to the
original GTOP implementation. Furthermore, GTOPX is linked from it's original
C++ source code to Python and Matlab based on dynamic link libraries, assuring
computationally fast and accurate reproduction of the benchmark results in all
three programming languages. Space mission trajectory design problems as those
represented in GTOPX are known to be highly non-linear and difficult to solve.
The GTOPX collection, therefore, aims particularly at researchers wishing to
put advanced (meta)heuristic and hybrid optimization algorithms to the test.
The goal of this paper is to provide researchers with a manual and reference to
the newly available GTOPX benchmark software.
","[{'version': 'v1', 'created': 'Thu, 15 Oct 2020 04:45:16 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Nov 2020 05:03:45 GMT'}, {'version': 'v3', 'created': 'Sat, 30 Jan 2021 11:00:33 GMT'}, {'version': 'v4', 'created': 'Wed, 17 Feb 2021 11:47:55 GMT'}]",2021-02-18,"[['Schlueter', 'Martin', ''], ['Neshat', 'Mehdi', ''], ['Wahib', 'Mohamed', ''], ['Munetomo', 'Masaharu', ''], ['Wagner', 'Markus', '']]","['Optimisation', 'Benchmark', 'Landscape Analysis', 'Space Mission Trajectory']"
12112,2205.06048,Antonio Ferrara,"Antonio Ferrara, Lisette Esp\'in-Noboa, Fariba Karimi and Claudia
  Wagner",Link recommendations: Their impact on network structure and minorities,"11 pages, accepted at the WebSci'22 conference",,10.1145/3501247.3531583,,cs.SI physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  Network-based people recommendation algorithms are widely employed on the Web
to suggest new connections in social media or professional platforms. While
such recommendations bring people together, the feedback loop between the
algorithms and the changes in network structure may exacerbate social biases.
These biases include rich-get-richer effects, filter bubbles, and polarization.
However, social networks are diverse complex systems and recommendations may
affect them differently, depending on their structural properties. In this
work, we explore five people recommendation algorithms by systematically
applying them over time to different synthetic networks. In particular, we
measure to what extent these recommendations change the structure of
bi-populated networks and show how these changes affect the minority group. Our
systematic experimentation helps to better understand when link recommendation
algorithms are beneficial or harmful to minority groups in social networks. In
particular, our findings suggest that, while all algorithms tend to close
triangles and increase cohesion, all algorithms except Node2Vec are prone to
favor and suggest nodes with high in-degree. Furthermore, we found that,
especially when both classes are heterophilic, recommendation algorithms can
reduce the visibility of minorities.
","[{'version': 'v1', 'created': 'Thu, 12 May 2022 12:21:11 GMT'}]",2022-05-13,"[['Ferrara', 'Antonio', ''], ['Espín-Noboa', 'Lisette', ''], ['Karimi', 'Fariba', ''], ['Wagner', 'Claudia', '']]","['Recommendation algorithms', 'friendship recommendations', 'network science', 'social networks', 'homophily', 'preferential attachment']"
12113,2107.12053,Tomohiro Harada,Tomohiro Harada,"A Frequency-based Parent Selection for Reducing the Effect of Evaluation
  Time Bias in Asynchronous Parallel Multi-objective Evolutionary Algorithms","16 pages, submitted to Natural Computing and under review",,10.1007/s11047-022-09940-z,,cs.NE cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Parallel evolutionary algorithms (PEAs) have been studied for reducing the
execution time of evolutionary algorithms by utilizing parallel computing. An
asynchronous PEA (APEA) is a scheme of PEAs that increases computational
efficiency by generating a new solution immediately after a solution evaluation
completes without the idling time of computing nodes. However, because APEA
gives more search opportunities to solutions with shorter evaluation times, the
evaluation time bias of solutions negatively affects the search performance. To
overcome this drawback, this paper proposes a new parent selection method to
reduce the effect of evaluation time bias in APEAs. The proposed method
considers the search frequency of solutions and selects the parent solutions so
that the search progress in the population is uniform regardless of the
evaluation time bias. This paper conducts experiments on multi-objective
optimization problems that simulate the evaluation time bias. The experiments
use NSGA-III, a well-known multi-objective evolutionary algorithm, and compare
the proposed method with the conventional synchronous/asynchronous
parallelization. The experimental results reveal that the proposed method can
reduce the effect of the evaluation time bias while reducing the computing time
of the parallel NSGA-III.
","[{'version': 'v1', 'created': 'Mon, 26 Jul 2021 09:20:55 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Dec 2022 03:55:23 GMT'}]",2023-01-25,"[['Harada', 'Tomohiro', '']]","['Asynchronous evaluation', 'evaluation time bias', 'evolutionary algorithm', 'multi-objectiveoptimization', 'parallelism', 'parent selection']"
12114,1402.6601,Gr\'egory Mouni\'e,"Rapha\""el Bleuse and Thierry Gautier and Jo\~ao V. F. Lima and
  Gr\'egory Mouni\'e and Denis Trystram","Scheduling data flow program in xkaapi: A new affinity based Algorithm
  for Heterogeneous Architectures",,,10.1007/978-3-319-09873-9_47,,cs.DC,http://creativecommons.org/licenses/by/3.0/,"  Efficient implementations of parallel applications on heterogeneous hybrid
architectures require a careful balance between computations and communications
with accelerator devices. Even if most of the communication time can be
overlapped by computations, it is essential to reduce the total volume of
communicated data. The literature therefore abounds with ad-hoc methods to
reach that balance, but that are architecture and application dependent. We
propose here a generic mechanism to automatically optimize the scheduling
between CPUs and GPUs, and compare two strategies within this mechanism: the
classical Heterogeneous Earliest Finish Time (HEFT) algorithm and our new,
parametrized, Distributed Affinity Dual Approximation algorithm (DADA), which
consists in grouping the tasks by affinity before running a fast dual
approximation. We ran experiments on a heterogeneous parallel machine with six
CPU cores and eight NVIDIA Fermi GPUs. Three standard dense linear algebra
kernels from the PLASMA library have been ported on top of the Xkaapi runtime.
We report their performances. It results that HEFT and DADA perform well for
various experimental conditions, but that DADA performs better for larger
systems and number of GPUs, and, in most cases, generates much lower data
transfers than HEFT to achieve the same performance.
","[{'version': 'v1', 'created': 'Wed, 26 Feb 2014 16:37:01 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Apr 2014 13:05:23 GMT'}]",2014-09-22,"[['Bleuse', 'Raphaël', ''], ['Gautier', 'Thierry', ''], ['Lima', 'João V. F.', ''], ['Mounié', 'Grégory', ''], ['Trystram', 'Denis', '']]","['heterogeneous architectures', 'scheduling', 'cost models', 'dualapproximation scheme', 'programming tools', 'affinity']"
12115,2101.07069,Jong-Seok Lee,"Seong-Eun Moon, Chun-Jui Chen, Cho-Jui Hsieh, Jane-Ling Wang,
  Jong-Seok Lee","Emotional EEG Classification using Connectivity Features and
  Convolutional Neural Networks",,"Neural Networks, vol. 132, pp. 96-107, Dec. 2020",10.1016/j.neunet.2020.08.009,,cs.LG cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Convolutional neural networks (CNNs) are widely used to recognize the user's
state through electroencephalography (EEG) signals. In the previous studies,
the EEG signals are usually fed into the CNNs in the form of high-dimensional
raw data. However, this approach makes it difficult to exploit the brain
connectivity information that can be effective in describing the functional
brain network and estimating the perceptual state of the user. We introduce a
new classification system that utilizes brain connectivity with a CNN and
validate its effectiveness via the emotional video classification by using
three different types of connectivity measures. Furthermore, two data-driven
methods to construct the connectivity matrix are proposed to maximize
classification performance. Further analysis reveals that the level of
concentration of the brain connectivity related to the emotional property of
the target video is correlated with classification performance.
","[{'version': 'v1', 'created': 'Mon, 18 Jan 2021 13:28:08 GMT'}]",2021-01-19,"[['Moon', 'Seong-Eun', ''], ['Chen', 'Chun-Jui', ''], ['Hsieh', 'Cho-Jui', ''], ['Wang', 'Jane-Ling', ''], ['Lee', 'Jong-Seok', '']]","['electroencephalography (EEG)', 'convolutional neural network (CNN)', 'brain connectivity', 'emotion']"
12116,2107.02677,Andrey Skripnikov,"A. Skripnikov (1), N. Wagner (1), J. Shafer (2), M. Beck (3), E.
  Sherwood (3), M. Burke (3) ((1) New College of Florida, (2) Science and
  Environment Council of Southwest Florida, (3) Tampa Bay Estuary Program)",Using Localized Twitter Activity for Red Tide Impact Assessment,"40 pages,11 figures (27 image files though), 5 tables, submitted to
  ""Harmful Algae""",,10.1016/j.hal.2021.102118,,cs.SI stat.AP,http://creativecommons.org/licenses/by/4.0/,"  Red tide blooms of the dinoflagellate Karenia brevis (K. brevis) produce
toxic coastal conditions that can impact marine organisms and human health,
while also affecting local economies. During the extreme Florida red tide event
of 2017-2019, residents and visitors turned to social media platforms to both
receive disaster-related information and communicate their own sentiments and
experiences. This was the first major red tide event since the ubiquitous use
of social media, thus providing unique crowd-sourced reporting of red tide
impacts. We evaluated the spatial and temporal accuracy of red tide topic
activity on Twitter, taking tweet sentiments and user types (e.g. media,
citizens) into consideration, and compared tweet activity with reported red
tide conditions, such as K. brevis cell counts, levels of dead fish and
respiratory irritation on local beaches. The analysis was done on multiple
levels with respect to both locality (e.g., entire Gulf coast, county-level,
city-level, zip code tabulation areas) and temporal frequencies (e.g. daily,
every three days, weekly), resulting in strong correlations between local
per-capita Twitter activity and the actual red tide conditions observed in the
area. Moreover, an association was observed between proximity to the affected
coastal areas and per-capita counts for relevant tweets. Results show that
Twitter is a reliable proxy of the red tide's local impacts and development
over time, which can potentially be used as one of the tools for more efficient
assessment and a more coordinated response to the disaster in real time.
","[{'version': 'v1', 'created': 'Tue, 6 Jul 2021 15:35:52 GMT'}]",2021-10-22,"[['Skripnikov', 'A.', ''], ['Wagner', 'N.', ''], ['Shafer', 'J.', ''], ['Beck', 'M.', ''], ['Sherwood', 'E.', ''], ['Burke', 'M.', '']]","['Red tide', 'Sentiment analysis', 'Social media analytics', 'Twitter']"
12117,2002.05493,Fabricio Breve,"Fabricio A Breve, Marcos G Quiles, Liang Zhao, and Elbert E. N. Macau","Chaotic Phase Synchronization and Desynchronization in an Oscillator
  Network for Object Selection",,"BREVE, FA; ZHAO, L; QUILES, MG; MACAU, EEN. Chaotic Phase
  Synchronization and Desynchronization in an Oscillator Network for Object
  Selection. Neural Networks, v. 22, p. 728-737, 2009",10.1016/j.neunet.2009.06.027,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Object selection refers to the mechanism of extracting objects of interest
while ignoring other objects and background in a given visual scene. It is a
fundamental issue for many computer vision and image analysis techniques and it
is still a challenging task to artificial visual systems. Chaotic phase
synchronization takes place in cases involving almost identical dynamical
systems and it means that the phase difference between the systems is kept
bounded over the time, while their amplitudes remain chaotic and may be
uncorrelated. Instead of complete synchronization, phase synchronization is
believed to be a mechanism for neural integration in brain. In this paper, an
object selection model is proposed. Oscillators in the network representing the
salient object in a given scene are phase synchronized, while no phase
synchronization occurs for background objects. In this way, the salient object
can be extracted. In this model, a shift mechanism is also introduced to change
attention from one object to another. Computer simulations show that the model
produces some results similar to those observed in natural vision systems.
","[{'version': 'v1', 'created': 'Thu, 13 Feb 2020 13:39:25 GMT'}]",2020-02-14,"[['Breve', 'Fabricio A', ''], ['Quiles', 'Marcos G', ''], ['Zhao', 'Liang', ''], ['Macau', 'Elbert E. N.', '']]","['chaotic phase synchronization', 'object selection', 'shiftingmechanism']"
12118,2104.00148,Gonzalo M\'endez Dr,"Gonzalo Gabriel M\'endez, Luis Gal\'arraga and Katherine Chiluiza","Showing Academic Performance Predictions during Term Planning: Effects
  on Students' Decisions, Behaviors, and Preferences",17 pages,,10.1145/3411764,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Course selection is a crucial activity for students as it directly impacts
their workload and performance. It is also time-consuming, prone to
subjectivity, and often carried out based on incomplete information. This task
can, nevertheless, be assisted with computational tools, for instance, by
predicting performance based on historical data. We investigate the effects of
showing grade predictions to students through an interactive visualization
tool. A qualitative study suggests that in the presence of predictions,
students may focus too much on maximizing their performance, to the detriment
of other factors such as the workload. A follow-up quantitative study explored
whether these effects are mitigated by changing how predictions are conveyed.
Our observations suggest the presence of a framing effect that induces students
to put more effort into course selection when faced with more specific
predictions. We discuss these and other findings and outline considerations for
designing better data-driven course selection tools.
","[{'version': 'v1', 'created': 'Wed, 31 Mar 2021 22:32:21 GMT'}]",2021-04-02,"[['Méndez', 'Gonzalo Gabriel', ''], ['Galárraga', 'Luis', ''], ['Chiluiza', 'Katherine', '']]","['Visual learning analytics', 'academic performance predictions', 'framing effects', 'course selection', 'course recommendation']"
12119,2010.16303,Maarten Vandercammen,"Maarten Vandercammen, Laurent Christophe, Dario Di Nucci, Wolfgang De
  Meuter, Coen De Roover",Prioritising Server Side Reachability via Inter-process Concolic Testing,,"The Art, Science, and Engineering of Programming, 2021, Vol. 5,
  Issue 2, Article 5",10.22152/programming-journal.org/2021/5/5,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Most approaches to automated white-box testing consider the client
side and the server side of a web application in isolation from each other.
Such testers lack a whole-program perspective on the web application under
test.
  Inquiry: We hypothesise that an additional whole-program perspective would
enable the tester to discover which server side errors can be triggered by an
actual end user accessing the application through the client, and which ones
can only be triggered in hypothetical scenarios.
  Approach: In this paper, we explore the idea of employing such a
whole-program perspective in testing. To this end, we develop , a novel
concolic tester which operates on full-stack JavaScript web applications, where
both the client and the server side are JavaScript processes communicating via
asynchronous messages -- as enabled by the WebSocket or Socket.IO-libraries.
  Knowledge: We find that the whole-program perspective enables discerning
high-priority errors, which are reachable from a particular client, from
low-priority errors, which are not accessible through the tested client.
Another benefit of the perspective is that it allows the automated tester to
construct practical, step-by-step scenarios for triggering server side errors
from the end user's perspective.
  Grounding: We apply on a collection of web applications to evaluate how
effective testing is in distinguishing between high- and low-priority errors.
The results show that correctly classifies the majority of server errors.
  Importance: This paper demonstrates the feasibility of testing as a novel
approach for automatically testing web applications. Classifying errors as
being of high or low importance aids developers in prioritising bugs that might
be encountered by users, and postponing the diagnosis of bugs that are less
easily reached.
","[{'version': 'v1', 'created': 'Fri, 30 Oct 2020 14:53:39 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Mar 2021 10:24:07 GMT'}]",2021-03-05,"[['Vandercammen', 'Maarten', ''], ['Christophe', 'Laurent', ''], ['Di Nucci', 'Dario', ''], ['De Meuter', 'Wolfgang', ''], ['De Roover', 'Coen', '']]","['Concolic Testing', 'Whitebox Testing', 'Full-stack Applications']"
12120,2108.09865,Atsushi Miyauchi,"Naoki Marumo, Atsushi Miyauchi, Akiko Takeda, Akira Tanaka","A Projected Gradient Method for Opinion Optimization with Limited
  Changes of Susceptibility to Persuasion",CIKM 2021,,10.1145/3459637.3482408,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Many social phenomena are triggered by public opinion that is formed in the
process of opinion exchange among individuals. To date, from the engineering
point of view, a large body of work has been devoted to studying how to
manipulate individual opinions so as to guide public opinion towards the
desired state. Recently, Abebe et al. (KDD 2018) have initiated the study of
the impact of interventions at the level of susceptibility rather than the
interventions that directly modify individual opinions themselves. For the
model, Chan et al. (The Web Conference 2019) designed a local search algorithm
to find an optimal solution in polynomial time. However, it can be seen that
the solution obtained by solving the above model might not be implemented in
real-world scenarios. In fact, as we do not consider the amount of changes of
the susceptibility, it would be too costly to change the susceptibility values
for agents based on the solution.
  In this paper, we study an opinion optimization model that is able to limit
the amount of changes of the susceptibility in various forms. First we
introduce a novel opinion optimization model, where the initial susceptibility
values are given as additional input and the feasible region is defined using
the $\ell_p$-ball centered at the initial susceptibility vector. For the
proposed model, we design a projected gradient method that is applicable to the
case where there are millions of agents. Finally we conduct thorough
experiments using a variety of real-world social networks and demonstrate that
the proposed algorithm outperforms baseline methods.
","[{'version': 'v1', 'created': 'Sun, 22 Aug 2021 22:58:15 GMT'}]",2021-08-24,"[['Marumo', 'Naoki', ''], ['Miyauchi', 'Atsushi', ''], ['Takeda', 'Akiko', ''], ['Tanaka', 'Akira', '']]","['social networks', 'opinion dynamics', 'susceptibility to persuasion', 'projected gradient methods', 'non-convex optimization']"
12121,2208.07240,Tinkle Chugh,Tinkle Chugh,"Mono-surrogate vs Multi-surrogate in Multi-objective Bayesian
  Optimisation",,,10.1145/3520304.3533972,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Bayesian optimisation (BO) has been widely used to solve problems with
expensive function evaluations. In multi-objective optimisation problems, BO
aims to find a set of approximated Pareto optimal solutions. There are
typically two ways to build surrogates in multi-objective BO: One surrogate by
aggregating objective functions (by using a scalarising function, also called
mono-surrogate approach) and multiple surrogates (for each objective function,
also called multi-surrogate approach). In both approaches, an acquisition
function (AF) is used to guide the search process. Mono-surrogate has the
advantage that only one model is used, however, the approach has two major
limitations. Firstly, the fitness landscape of the scalarising function and the
objective functions may not be similar. Secondly, the approach assumes that the
scalarising function distribution is Gaussian, and thus a closed-form
expression of the AF can be used. In this work, we overcome these limitations
by building a surrogate model for each objective function and show that the
scalarising function distribution is not Gaussian. We approximate the
distribution using Generalised extreme value distribution. The results and
comparison with existing approaches on standard benchmark and real-world
optimisation problems show the potential of the multi-surrogate approach.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 09:25:04 GMT'}]",2022-08-16,"[['Chugh', 'Tinkle', '']]","['Bayesian optimisation', 'Surrogate modelling', 'Gaussian process', 'Approximate inference', 'Bayesian Optimisation', 'Uncertainty']"
12122,2202.01542,Alexandros Gazis,"Alexandros Gazis, Konstantinos Stamatis, Eleftheria Katsiri","A Method for Counting, Tracking and Monitoring of Visitors with RFID
  sensors","6 pages,8 figures, 22 references, Proceedings of 10th Panhellenic
  Electrical and Computer Engineering Students Conference (ECESCON) 2018 Xanthi",,10.5281/zenodo.3549417,,cs.SE cs.DC,http://creativecommons.org/licenses/by/4.0/,"  This publication presents a method responsible for counting tracking and
monitoring visitors inside a building. The site examined is Manos Hatzidakis'
House, situated in Xanthi. Specifically, we have conducted a study, which
provides recommendations, regarding the installation of sensors in the
building. We also present the communication protocols of the computer network
used in order to ensure the efficient communication between the space examined
and the sensor network. Finally, we describe the process of creating a website,
which is designed to store and view the data.
","[{'version': 'v1', 'created': 'Thu, 3 Feb 2022 11:56:32 GMT'}]",2022-02-23,"[['Gazis', 'Alexandros', ''], ['Stamatis', 'Konstantinos', ''], ['Katsiri', 'Eleftheria', '']]","['counting', 'monitoring', 'tracking', 'RFID', 'Raspberry']"
12123,1806.06704,Marie-Christine Costa,"C\'edric Bentz (CEDRIC), Marie-Christine Costa (CEDRIC, OC),
  Pierre-Louis Poirion (CEDRIC, OC), Thomas Ridremont (CEDRIC, OC)","Formulations for designing robust networks. An application to wind power
  collection",arXiv admin note: substantial text overlap with arXiv:1801.04696,"Electronic Notes in Discrete Mathematics, 2018, Inernational
  network optimization conference 2017., 64, pp.365-374",10.1016/j.endm.2018.02.011,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We are interested in the design of survivable capacitated rooted Steiner
networks. Given a graph G = (V, E), capacity and cost functions on E, a root r,
a subset T of V of terminals and an integer k, we search for a minimum cost
subset E $\subset$ E, covering T and r, such that the network induced by E is
k-survivable: after the removal of any k edges, there still exists a feasible
flow from r to T. We also consider the possibility of protecting a given number
of edges. We propose three different formulations: a cut-set, a flow and a
bi-level formulation where the second-level is a min-max problem (with an
attacker and a defender). We propose algorithms for each problem formulation
and compare their efficiency.
","[{'version': 'v1', 'created': 'Fri, 15 Jun 2018 06:58:20 GMT'}]",2018-06-19,"[['Bentz', 'Cédric', '', 'CEDRIC'], ['Costa', 'Marie-Christine', '', 'CEDRIC, OC'], ['Poirion', 'Pierre-Louis', '', 'CEDRIC, OC'], ['Ridremont', 'Thomas', '', 'CEDRIC, OC']]","['Mixed-integer programming', 'bilevel programming', 'survivable networks']"
12124,1712.07223,Dimitrios Loukrezis,"Dimitrios Loukrezis, Ulrich R\""omer, and Herbert De Gersem","Assessing the Performance of Leja and Clenshaw-Curtis Collocation for
  Computational Electromagnetics with Random Input Data","29 pages, 13 figures, 2 tables",,10.1615/Int.J.UncertaintyQuantification.2018025234,,cs.CE cs.NA math.NA stat.CO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We consider the problem of quantifying uncertainty regarding the output of an
electromagnetic field problem in the presence of a large number of uncertain
input parameters. In order to reduce the growth in complexity with the number
of dimensions, we employ a dimension-adaptive stochastic collocation method
based on nested univariate nodes. We examine the accuracy and performance of
collocation schemes based on Clenshaw-Curtis and Leja rules, for the cases of
uniform and bounded, non-uniform random inputs, respectively. Based on
numerical experiments with an academic electromagnetic field model, we compare
the two rules in both the univariate and multivariate case and for both
quadrature and interpolation purposes. Results for a real-world electromagnetic
field application featuring high-dimensional input uncertainty are also
presented.
","[{'version': 'v1', 'created': 'Tue, 19 Dec 2017 21:28:26 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Oct 2018 08:07:20 GMT'}, {'version': 'v3', 'created': 'Wed, 20 Jul 2022 06:26:47 GMT'}]",2022-07-21,"[['Loukrezis', 'Dimitrios', ''], ['Römer', 'Ulrich', ''], ['De Gersem', 'Herbert', '']]","['dimension adaptivity', 'Clenshaw-Curtis', 'computational electromagnetics', 'Leja', 'sparse grids', 'stochastic collocation', 'uncertainty quantification']"
12125,1903.04654,Spyridoula Gravani,"Spyridoula Gravani, Mohammad Hedayati, John Criswell, and Michael L.
  Scott",Fast Intra-kernel Isolation and Security with IskiOS,,,10.1145/3471621.3471849,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The kernels of operating systems such as Windows, Linux, and MacOS are
vulnerable to control-flow hijacking. Defenses exist, but many require
efficient intra-address-space isolation. Execute-only memory, for example,
requires read protection on code segments, and shadow stacks require protection
from buffer overwrites. Intel's Protection Keys for Userspace (PKU) could, in
principle, provide the intra-kernel isolation needed by such defenses, but,
when used as designed, it applies only to user-mode application code. This
paper presents an unconventional approach to memory protection, allowing PKU to
be used within the operating system kernel on existing Intel hardware,
replacing the traditional user/supervisor isolation mechanism and,
simultaneously, enabling efficient intra-kernel isolation. We call the
resulting mechanism Protection Keys for Kernelspace (PKK). To demonstrate its
utility and efficiency, we present a system we call IskiOS: a Linux variant
featuring execute-only memory (XOM) and the first-ever race-free shadow stacks
for x86-64. Experiments with the LMBench kernel microbenchmarks display a
geometric mean overhead of about 11% for PKK and no additional overhead for
XOM. IskiOS's shadow stacks bring the total to 22%. For full applications,
experiments with the system benchmarks of the Phoronix test suite display
negligible overhead for PKK and XOM, and less than 5% geometric mean overhead
for shadow stacks.
","[{'version': 'v1', 'created': 'Mon, 11 Mar 2019 23:34:17 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Nov 2019 14:39:50 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Dec 2020 19:13:41 GMT'}, {'version': 'v4', 'created': 'Fri, 9 Jul 2021 17:03:47 GMT'}, {'version': 'v5', 'created': 'Mon, 2 Aug 2021 18:52:21 GMT'}]",2021-08-04,"[['Gravani', 'Spyridoula', ''], ['Hedayati', 'Mohammad', ''], ['Criswell', 'John', ''], ['Scott', 'Michael L.', '']]","['security', 'operating systems', 'protection keys', 'intra-kernel isolation']"
12126,1904.08709,Simone Paolo Ponzetto,"Lydia Weiland, Ioana Hulpus, Simone Paolo Ponzetto, Wolfgang
  Effelsberg, Laura Dietz",Knowledge-rich Image Gist Understanding Beyond Literal Meaning,,"Data & Knowledge Engineering, Volume 117, September 2018, Pages
  114-132",10.1016/j.datak.2018.07.006,,cs.IR cs.CL cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We investigate the problem of understanding the message (gist) conveyed by
images and their captions as found, for instance, on websites or news articles.
To this end, we propose a methodology to capture the meaning of image-caption
pairs on the basis of large amounts of machine-readable knowledge that has
previously been shown to be highly effective for text understanding. Our method
identifies the connotation of objects beyond their denotation: where most
approaches to image understanding focus on the denotation of objects, i.e.,
their literal meaning, our work addresses the identification of connotations,
i.e., iconic meanings of objects, to understand the message of images. We view
image understanding as the task of representing an image-caption pair on the
basis of a wide-coverage vocabulary of concepts such as the one provided by
Wikipedia, and cast gist detection as a concept-ranking problem with
image-caption pairs as queries. To enable a thorough investigation of the
problem of gist understanding, we produce a gold standard of over 300
image-caption pairs and over 8,000 gist annotations covering a wide variety of
topics at different levels of abstraction. We use this dataset to
experimentally benchmark the contribution of signals from heterogeneous
sources, namely image and text. The best result with a Mean Average Precision
(MAP) of 0.69 indicate that by combining both dimensions we are able to better
understand the meaning of our image-caption pairs than when using language or
vision information alone. We test the robustness of our gist detection approach
when receiving automatically generated input, i.e., using automatically
generated image tags or generated captions, and prove the feasibility of an
end-to-end automated process.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2019 11:50:20 GMT'}]",2019-04-19,"[['Weiland', 'Lydia', ''], ['Hulpus', 'Ioana', ''], ['Ponzetto', 'Simone Paolo', ''], ['Effelsberg', 'Wolfgang', ''], ['Dietz', 'Laura', '']]","['Image understanding', 'Language and Vision', 'Entity ranking']"
12127,1606.02228,Dmytro Mishkin,Dmytro Mishkin and Nikolay Sergievskiy and Jiri Matas,Systematic evaluation of CNN advances on the ImageNet,"Submitted to CVIU Special Issue on Deep Learning. Updated dataset
  quality experiment",,10.1016/j.cviu.2017.05.007,,cs.NE cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper systematically studies the impact of a range of recent advances in
CNN architectures and learning methods on the object categorization (ILSVRC)
problem. The evalution tests the influence of the following choices of the
architecture: non-linearity (ReLU, ELU, maxout, compatibility with batch
normalization), pooling variants (stochastic, max, average, mixed), network
width, classifier design (convolutional, fully-connected, SPP), image
pre-processing, and of learning parameters: learning rate, batch size,
cleanliness of the data, etc.
  The performance gains of the proposed modifications are first tested
individually and then in combination. The sum of individual gains is bigger
than the observed improvement when all modifications are introduced, but the
""deficit"" is small suggesting independence of their benefits. We show that the
use of 128x128 pixel images is sufficient to make qualitative conclusions about
optimal network structure that hold for the full size Caffe and VGG nets. The
results are obtained an order of magnitude faster than with the standard 224
pixel images.
","[{'version': 'v1', 'created': 'Tue, 7 Jun 2016 17:38:06 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Jun 2016 13:48:39 GMT'}]",2017-06-02,"[['Mishkin', 'Dmytro', ''], ['Sergievskiy', 'Nikolay', ''], ['Matas', 'Jiri', '']]","['CNN', 'benchmark', 'non-linearity', 'pooling', 'ImageNet']"
12128,2207.08581,Judith S\'ainz-Pardo D\'iaz,Judith S\'ainz-Pardo D\'iaz and \'Alvaro L\'opez Garc\'ia,"Study of the performance and scalability of federated learning for
  medical imaging with intermittent clients",,,10.1016/j.neucom.2022.11.011,,cs.LG cs.AI cs.CV eess.IV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Federated learning is a data decentralization privacy-preserving technique
used to perform machine or deep learning in a secure way. In this paper we
present theoretical aspects about federated learning, such as the presentation
of an aggregation operator, different types of federated learning, and issues
to be taken into account in relation to the distribution of data from the
clients, together with the exhaustive analysis of a use case where the number
of clients varies. Specifically, a use case of medical image analysis is
proposed, using chest X-Ray images obtained from an open data repository. In
addition to the advantages related to privacy, improvements in predictions (in
terms of accuracy, loss and area under the curve) and reduction of execution
times will be studied with respect to the classical case (the centralized
approach). Different clients will be simulated from the training data, selected
in an unbalanced manner. The results of considering three or ten clients are
exposed and compared between them and against the centralized case. Two
different problems related to intermittent clients are discussed, together with
two approaches to be followed for each of them. Specifically, this type of
problems may occur because in a real scenario some clients may leave the
training, and others enter it, and on the other hand because of client
technical or connectivity problems. Finally, improvements and future work in
the field are proposed.
","[{'version': 'v1', 'created': 'Mon, 18 Jul 2022 13:18:34 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Jul 2022 09:24:09 GMT'}, {'version': 'v3', 'created': 'Thu, 3 Nov 2022 13:05:25 GMT'}]",2022-11-09,"[['Díaz', 'Judith Sáinz-Pardo', ''], ['García', 'Álvaro López', '']]","['Federated learning', 'deep learning', 'data decentralization', 'data privacy']"
12129,2102.00576,Ruolin Wang,"Ruolin Wang, Zixuan Chen, Mingrui ""Ray"" Zhang, Zhaoheng Li, Zhixiu
  Liu, Zihan Dang, Chun Yu, Xiang ""Anthony"" Chen","Revamp: Enhancing Accessible Information Seeking Experience of Online
  Shopping for Blind or Low Vision Users",,,10.1145/3411764.3445547,,cs.HC cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online shopping has become a valuable modern convenience, but blind or low
vision (BLV) users still face significant challenges using it, because of: 1)
inadequate image descriptions and 2) the inability to filter large amounts of
information using screen readers. To address those challenges, we propose
Revamp, a system that leverages customer reviews for interactive information
retrieval. Revamp is a browser integration that supports review-based
question-answering interactions on a reconstructed product page. From our
interview, we identified four main aspects (color, logo, shape, and size) that
are vital for BLV users to understand the visual appearance of a product. Based
on the findings, we formulated syntactic rules to extract review snippets,
which were used to generate image descriptions and responses to users' queries.
Evaluations with eight BLV users showed that Revamp 1) provided useful
descriptive information for understanding product appearance and 2) helped the
participants locate key information efficiently.
","[{'version': 'v1', 'created': 'Mon, 1 Feb 2021 00:53:09 GMT'}]",2021-02-02,"[['Wang', 'Ruolin', ''], ['Chen', 'Zixuan', ''], ['Zhang', 'Mingrui ""Ray""', ''], ['Li', 'Zhaoheng', ''], ['Liu', 'Zhixiu', ''], ['Dang', 'Zihan', ''], ['Yu', 'Chun', ''], ['Chen', 'Xiang ""Anthony""', '']]","['Online shopping', 'Information Retrieval', 'Accessibility', 'Blind or LowVision Users', 'Reviews', 'Image Description', 'Question-answering']"
12130,1802.04100,Marcos Baez,Marcos Baez and Fabio Casati,"Agile development for vulnerable populations: lessons learned and
  recommendations",,,10.1145/3183428.3183439,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we draw attention to the challenges of managing software
projects for vulnerable populations, i.e., people potentially exposed to harm
or not capable of protecting their own interests. The focus on human aspects,
and particularly, the inclusion of human-centered approaches, has been a
popular topic in the software engineering community. We argue, however, that
current literature provides little understanding and guidance on how to
approach these type of scenarios. Here, we shed some light on the topic by
reporting on our experiences in developing innovative solutions for the
residential care scenario, outlining potential issues and recommendations.
","[{'version': 'v1', 'created': 'Thu, 25 Jan 2018 15:11:16 GMT'}]",2018-02-13,"[['Baez', 'Marcos', ''], ['Casati', 'Fabio', '']]","['Agile development', 'human-centered design', 'vulnerable populations']"
12131,2209.01817,Robert Dyer,Robert Dyer and Jigyasa Chauhan,"An Exploratory Study on the Predominant Programming Paradigms in Python
  Code","Accepted to the ACM Joint European Software Engineering Conference
  and Symposium on the Foundations of Software Engineering (ESEC/FSE 2022)",,10.1145/3540250.3549158,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Python is a multi-paradigm programming language that fully supports
object-oriented (OO) programming. The language allows writing code in a
non-procedural imperative manner, using procedures, using classes, or in a
functional style. To date, no one has studied what paradigm(s), if any, are
predominant in Python code and projects. In this work, we first define a
technique to classify Python files into predominant paradigm(s). We then
automate our approach and evaluate it against human judgements, showing over
80% agreement. We then analyze over 100k open-source Python projects,
automatically classifying each source file and investigating the paradigm
distributions. The results indicate Python developers tend to heavily favor OO
features. We also observed a positive correlation between OO and procedural
paradigms and the size of the project. And despite few files or projects being
predominantly functional, we still found many functional feature uses.
","[{'version': 'v1', 'created': 'Mon, 5 Sep 2022 08:03:20 GMT'}]",2022-09-07,"[['Dyer', 'Robert', ''], ['Chauhan', 'Jigyasa', '']]","['Python', 'programming paradigms', 'empirical study']"
12132,2107.07112,Ensheng Shi,"Ensheng Shi, Yanlin Wang, Lun Du, Junjie Chen, Shi Han, Hongyu Zhang,
  Dongmei Zhang, Hongbin Sun",On the Evaluation of Neural Code Summarization,"Accepted by ICSE 2022 (The 44th International Conference on Software
  Engineering)",,10.1145/3510003.3510060,,cs.SE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Source code summaries are important for program comprehension and
maintenance. However, there are plenty of programs with missing, outdated, or
mismatched summaries. Recently, deep learning techniques have been exploited to
automatically generate summaries for given code snippets. To achieve a profound
understanding of how far we are from solving this problem and provide
suggestions to future research, in this paper, we conduct a systematic and
in-depth analysis of 5 state-of-the-art neural code summarization models on 6
widely used BLEU variants, 4 pre-processing operations and their combinations,
and 3 widely used datasets. The evaluation results show that some important
factors have a great influence on the model evaluation, especially on the
performance of models and the ranking among the models. However, these factors
might be easily overlooked. Specifically, (1) the BLEU metric widely used in
existing work of evaluating code summarization models has many variants.
Ignoring the differences among these variants could greatly affect the validity
of the claimed results. Furthermore, we conduct human evaluations and find that
the metric BLEU-DC is most correlated to human perception; (2) code
pre-processing choices can have a large (from -18\% to +25\%) impact on the
summarization performance and should not be neglected. We also explore the
aggregation of pre-processing combinations and boost the performance of models;
(3) some important characteristics of datasets (corpus sizes, data splitting
methods, and duplication ratios) have a significant impact on model evaluation.
Based on the experimental results, we give actionable suggestions for
evaluating code summarization and choosing the best method in different
scenarios. We also build a shared code summarization toolbox to facilitate
future research.
","[{'version': 'v1', 'created': 'Thu, 15 Jul 2021 04:33:59 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Feb 2022 14:49:13 GMT'}]",2022-02-14,"[['Shi', 'Ensheng', ''], ['Wang', 'Yanlin', ''], ['Du', 'Lun', ''], ['Chen', 'Junjie', ''], ['Han', 'Shi', ''], ['Zhang', 'Hongyu', ''], ['Zhang', 'Dongmei', ''], ['Sun', 'Hongbin', '']]","['Code summarization', 'Empirical study', 'Deep learning', 'Evaluation']"
12133,2204.10463,Emanuele Bugliarello,"Emanuele Bugliarello and Rishabh Mehrotra and James Kirk and Mounia
  Lalmas","Mostra: A Flexible Balancing Framework to Trade-off User, Artist and
  Platform Objectives for Music Sequencing",TheWebConf 2022,,10.1145/3485447.3512014,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the task of sequencing tracks on music streaming platforms where
the goal is to maximise not only user satisfaction, but also artist- and
platform-centric objectives, needed to ensure long-term health and
sustainability of the platform. Grounding the work across four objectives: Sat,
Discovery, Exposure and Boost, we highlight the need and the potential to
trade-off performance across these objectives, and propose Mostra, a Set
Transformer-based encoder-decoder architecture equipped with submodular
multi-objective beam search decoding. The proposed model affords system
designers the power to balance multiple goals, and dynamically control the
impact on one objective to satisfy other objectives. Through extensive
experiments on data from a large-scale music streaming platform, we present
insights on the trade-offs that exist across different objectives, and
demonstrate that the proposed framework leads to a superior, just-in-time
balancing across the various metrics of interest.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2022 02:23:56 GMT'}]",2022-04-25,"[['Bugliarello', 'Emanuele', ''], ['Mehrotra', 'Rishabh', ''], ['Kirk', 'James', ''], ['Lalmas', 'Mounia', '']]","['marketplace', 'music sequencing', 'balancing', 'transformer', 'trade-off']"
12134,1805.03491,"Markus Schr\""oder","Markus Schr\""oder, Christian Jilek and Andreas Dengel",Deep Linking Desktop Resources,"5 pages, 2 figures, ESWC 2018 demo paper","The Semantic Web: ESWC 2018 Satellite Events, pp. 202-207,
  Springer",10.1007/978-3-319-98192-5_38,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep Linking is the process of referring to a specific piece of web content.
Although users can browse their files in desktop environments, they are unable
to directly traverse deeper into their content using deep links. In order to
solve this issue, we demonstrate ""DeepLinker"", a tool which generates and
interprets deep links to desktop resources, thus enabling the reference to a
certain location within a file using a simple hyperlink. By default, the
service responds with an HTML representation of the resource along with further
links to follow. Additionally, we allow the use of RDF to interlink our deep
links with other resources.
","[{'version': 'v1', 'created': 'Thu, 3 May 2018 11:15:54 GMT'}]",2018-08-06,"[['Schröder', 'Markus', ''], ['Jilek', 'Christian', ''], ['Dengel', 'Andreas', '']]","['Deep Link', 'Desktop', 'URI', 'Fragment Identifier', 'RDF']"
12135,1905.01172,Wolfgang Mulzer,Wolfgang Mulzer and Natalia Shenkman,"A Constructive Proof of a Concentration Bound for Real-Valued Random
  Variables","7 pages, no figures","Information Processing Letters (IPL), 158, 2020, Article 105942",10.1016/j.ipl.2020.105942,,cs.DM math.CO math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Almost 10 years ago, Impagliazzo and Kabanets (2010) gave a new combinatorial
proof of Chernoff's bound for sums of bounded independent random variables.
Unlike previous methods, their proof is constructive. This means that it
provides an efficient randomized algorithm for the following task: given a set
of Boolean random variables whose sum is not concentrated around its
expectation, find a subset of statistically dependent variables. However, the
algorithm of Impagliazzo and Kabanets (2010) is given only for the Boolean
case. On the other hand, the general proof technique works also for real-valued
random variables, even though for this case, Impagliazzo and Kabanets (2010)
obtain a concentration bound that is slightly suboptimal.
  Herein, we revisit both these issues and show that it is relatively easy to
extend the Impagliazzo-Kabanets algorithm to real-valued random variables and
to improve the corresponding concentration bound by a constant factor.
","[{'version': 'v1', 'created': 'Fri, 3 May 2019 13:10:18 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Mar 2020 17:27:12 GMT'}]",2020-03-03,"[['Mulzer', 'Wolfgang', ''], ['Shenkman', 'Natalia', '']]","['generalized Chernoff-Hoeffding bound', 'concentration bound', 'randomized algorithm']"
12136,1912.07943,Hazrat Ali,"Hazrat Ali, Ahsan Ullah, Talha Iqbal, Shahid Khattak","Pioneer dataset and automatic recognition of Urdu handwritten characters
  using a deep autoencoder and convolutional neural network","SN Applied Sciences, December 2019",,10.1007/s42452-019-1914-1,,cs.CV cs.CL cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Automatic recognition of Urdu handwritten digits and characters, is a
challenging task. It has applications in postal address reading, bank's cheque
processing, and digitization and preservation of handwritten manuscripts from
old ages. While there exists a significant work for automatic recognition of
handwritten English characters and other major languages of the world, the work
done for Urdu lan-guage is extremely insufficient. This paper has two goals.
Firstly, we introduce a pioneer dataset for handwritten digits and characters
of Urdu, containing samples from more than 900 individuals. Secondly, we report
results for automatic recog-nition of handwritten digits and characters as
achieved by using deep auto-encoder network and convolutional neural network.
More specifically, we use a two-layer and a three-layer deep autoencoder
network and convolutional neural network and evaluate the two frameworks in
terms of recognition accuracy. The proposed framework of deep autoencoder can
successfully recognize digits and characters with an accuracy of 97% for digits
only, 81% for characters only and 82% for both digits and characters
simultaneously. In comparison, the framework of convolutional neural network
has accuracy of 96.7% for digits only, 86.5% for characters only and 82.7% for
both digits and characters simultaneously. These frameworks can serve as
baselines for future research on Urdu handwritten text.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2019 11:49:13 GMT'}]",2019-12-18,"[['Ali', 'Hazrat', ''], ['Ullah', 'Ahsan', ''], ['Iqbal', 'Talha', ''], ['Khattak', 'Shahid', '']]","['Autoencoder', 'convolutional neural network', 'Urdu', 'text recognition']"
12137,2108.00513,Ping Wang,"Ping Wang, Tian Shi, Khushbu Agarwal, Sutanay Choudhury, Chandan K.
  Reddy","Attention-based Aspect Reasoning for Knowledge Base Question Answering
  on Clinical Notes",Accepted to ACM BCB 2022,,10.1145/3535508.3545518,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Question Answering (QA) in clinical notes has gained a lot of attention in
the past few years. Existing machine reading comprehension approaches in
clinical domain can only handle questions about a single block of clinical
texts and fail to retrieve information about multiple patients and their
clinical notes. To handle more complex questions, we aim at creating knowledge
base from clinical notes to link different patients and clinical notes, and
performing knowledge base question answering (KBQA). Based on the expert
annotations available in the n2c2 dataset, we first created the ClinicalKBQA
dataset that includes around 9K QA pairs and covers questions about seven
medical topics using more than 300 question templates. Then, we investigated an
attention-based aspect reasoning (AAR) method for KBQA and analyzed the impact
of different aspects of answers (e.g., entity, type, path, and context) for
prediction. The AAR method achieves better performance due to the well-designed
encoder and attention mechanism. From our experiments, we find that both
aspects, type and path, enable the model to identify answers satisfying the
general conditions and produce lower precision and higher recall. On the other
hand, the aspects, entity and context, limit the answers by node-specific
information and lead to higher precision and lower recall.
","[{'version': 'v1', 'created': 'Sun, 1 Aug 2021 17:58:46 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Jul 2022 13:04:47 GMT'}]",2022-07-25,"[['Wang', 'Ping', ''], ['Shi', 'Tian', ''], ['Agarwal', 'Khushbu', ''], ['Choudhury', 'Sutanay', ''], ['Reddy', 'Chandan K.', '']]","['Clinical knowledge base', 'question answering', 'aspect representation', 'attention mechanism']"
12138,2108.03384,Peng Liang,"Muhammad Waseem, Peng Liang, Mojtaba Shahin, Amleto Di Salle, Gast\'on
  M\'arquez","Design, Monitoring, and Testing of Microservices Systems: The
  Practitioners' Perspective","Preprint accepted for publication in Journal of Systems and Software,
  2021",,10.1016/j.jss.2021.111061,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Context: Microservices Architecture (MSA) has received significant attention
in the software industry. However, little empirical evidence exists on design,
monitoring, and testing of microservices systems. Objective: This research aims
to gain a deep understanding of how microservices systems are designed,
monitored, and tested in the industry. Method: A mixed-methods study was
conducted with 106 survey responses and 6 interviews from microservices
practitioners. Results: The main findings are: (1) a combination of
domain-driven design and business capability is the most used strategy to
decompose an application into microservices, (2) over half of the participants
used architecture evaluation and architecture implementation when designing
microservices systems, (3) API gateway and Backend for frontend patterns are
the most used MSA patterns, (4) resource usage and load balancing as monitoring
metrics, log management and exception tracking as monitoring practices are
widely used, (5) unit and end-to-end testing are the most used testing
strategies, and (6) the complexity of microservices systems poses challenges
for their design, monitoring, and testing, for which there are no dedicated
solutions. Conclusions: Our findings reveal that more research is needed to (1)
deal with microservices complexity at the design level, (2) handle security in
microservices systems, and (3) address the monitoring and testing challenges
through dedicated solutions.
","[{'version': 'v1', 'created': 'Sat, 7 Aug 2021 07:18:14 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Aug 2021 04:28:46 GMT'}]",2021-08-24,"[['Waseem', 'Muhammad', ''], ['Liang', 'Peng', ''], ['Shahin', 'Mojtaba', ''], ['Di Salle', 'Amleto', ''], ['Márquez', 'Gastón', '']]","['Microservices Architecture', 'Design', 'Monitoring', 'Testing', 'Industrial Survey']"
12139,1707.01253,Shaohua Li,"Shaohua Li, Xinxing Xu, Liqiang Nie, Tat-Seng Chua",Laplacian-Steered Neural Style Transfer,"Accepted by the ACM Multimedia Conference (MM) 2017. 9 pages, 65
  figures",,10.1145/3123266.3123425,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural Style Transfer based on Convolutional Neural Networks (CNN) aims to
synthesize a new image that retains the high-level structure of a content
image, rendered in the low-level texture of a style image. This is achieved by
constraining the new image to have high-level CNN features similar to the
content image, and lower-level CNN features similar to the style image. However
in the traditional optimization objective, low-level features of the content
image are absent, and the low-level features of the style image dominate the
low-level detail structures of the new image. Hence in the synthesized image,
many details of the content image are lost, and a lot of inconsistent and
unpleasing artifacts appear. As a remedy, we propose to steer image synthesis
with a novel loss function: the Laplacian loss. The Laplacian matrix
(""Laplacian"" in short), produced by a Laplacian operator, is widely used in
computer vision to detect edges and contours. The Laplacian loss measures the
difference of the Laplacians, and correspondingly the difference of the detail
structures, between the content image and a new image. It is flexible and
compatible with the traditional style transfer constraints. By incorporating
the Laplacian loss, we obtain a new optimization objective for neural style
transfer named Lapstyle. Minimizing this objective will produce a stylized
image that better preserves the detail structures of the content image and
eliminates the artifacts. Experiments show that Lapstyle produces more
appealing stylized images with less artifacts, without compromising their
""stylishness"".
","[{'version': 'v1', 'created': 'Wed, 5 Jul 2017 08:10:41 GMT'}, {'version': 'v2', 'created': 'Sun, 30 Jul 2017 15:46:17 GMT'}]",2017-08-01,"[['Li', 'Shaohua', ''], ['Xu', 'Xinxing', ''], ['Nie', 'Liqiang', ''], ['Chua', 'Tat-Seng', '']]","['Neural Style Transfer', 'Convolutional Neural Networks', 'Image Laplacian']"
12140,1403.0338,Sanjaya Kumar Panda,"Jitendra Kumar Rout, Sourav Kumar Bhoi, Sanjaya Kumar Panda","SFTP : A Secure and Fault-Tolerant Paradigm against Blackhole Attack in
  MANET","6 pages, 9 figures",International Journal of Computer Applications 2013,10.5120/10623-5343,pxc3885343,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security issues in MANET are a challenging task nowadays. MANETs are
vulnerable to passive attacks and active attacks because of a limited number of
resources and lack of centralized authority. Blackhole attack is an attack in
network layer which degrade the network performance by dropping the packets. In
this paper, we have proposed a Secure Fault-Tolerant Paradigm (SFTP) which
checks the Blackhole attack in the network. The three phases used in SFTP
algorithm are designing of coverage area to find the area of coverage, Network
Connection algorithm to design a fault-tolerant model and Route Discovery
algorithm to discover the route and data delivery from source to destination.
SFTP gives better network performance by making the network fault free.
","[{'version': 'v1', 'created': 'Mon, 3 Mar 2014 08:36:22 GMT'}]",2014-03-04,"[['Rout', 'Jitendra Kumar', ''], ['Bhoi', 'Sourav Kumar', ''], ['Panda', 'Sanjaya Kumar', '']]","['SFTP', 'Node Connection Algorithm', 'Route Discovery Algorithm', 'Blackhole', 'DSR']"
12141,2208.00510,Johan Lin{\aa}ker,"Johan Lin{\aa}ker, Per Runeson","Public Sector Platforms going Open: Creating and Growing an Ecosystem
  with Open Collaborative Development",,,10.1145/3412569.3412572,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Background: By creating ecosystems around platforms of Open Source Software
(OSS) and Open Data (OD), and adopting open collaborative development
practices, platform providers may exploit open innovation benefits. However,
adopting such practices in a traditionally closed organization is a maturity
process that we hypothesize cannot be undergone without friction.
  Objective: This study aims to investigate what challenges may occur for a
newly-turned platform provider in the public sector, aiming to adopt open
collaborative practices to create an ecosystem around the development of the
underpinning platform.
  Method: An exploratory case-study is conducted at a Swedish public sector
platform provider, which is creating an ecosystem around OSS and OD, related to
the labor market. Data is collected through interviews, document studies, and
prolonged engagement.
  Results: Findings highlight a fear among developers of being publicly
questioned for their work, as they represent a government agency undergoing
constant scrutiny. Issue trackers, roadmaps, and development processes are
generally closed, while multiple channels are used for communication, causing
internal and external confusion. Some developers are reluctant to communicate
externally as they believe it interferes with their work. Lack of health
metrics limits possibilities to follow ecosystem growth and for actors to make
investment decisions. Further, an autonomous team structure is reported to
complicate internal communication and enforcement of the common vision, as well
as collaboration. A set of interventions for addressing the challenges are
proposed, based on related work.
  Conclusions: We conclude that several cultural, organizational, and
process-related challenges may reside, and by understanding these early on,
platform providers can be preemptive in their work of building healthy
ecosystems.
","[{'version': 'v1', 'created': 'Sun, 31 Jul 2022 20:26:46 GMT'}]",2022-08-02,"[['Linåker', 'Johan', ''], ['Runeson', 'Per', '']]","['Open Source Software', 'Open Government Data', 'Ecosystem', 'Collaborative Development']"
12142,1507.05999,Peter Lofgren,"Peter Lofgren, Siddhartha Banerjee, Ashish Goel",Personalized PageRank Estimation and Search: A Bidirectional Approach,WSDM 2016,,10.1145/2835776.2835823,,cs.DS cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present new algorithms for Personalized PageRank estimation and
Personalized PageRank search. First, for the problem of estimating Personalized
PageRank (PPR) from a source distribution to a target node, we present a new
bidirectional estimator with simple yet strong guarantees on correctness and
performance, and 3x to 8x speedup over existing estimators in experiments on a
diverse set of networks. Moreover, it has a clean algebraic structure which
enables it to be used as a primitive for the Personalized PageRank Search
problem: Given a network like Facebook, a query like ""people named John"", and a
searching user, return the top nodes in the network ranked by PPR from the
perspective of the searching user. Previous solutions either score all nodes or
score candidate nodes one at a time, which is prohibitively slow for large
candidate sets. We develop a new algorithm based on our bidirectional PPR
estimator which identifies the most relevant results by sampling candidates
based on their PPR; this is the first solution to PPR search that can find the
best results without iterating through the set of all candidate results.
Finally, by combining PPR sampling with sequential PPR estimation and Monte
Carlo, we develop practical algorithms for PPR search, and we show via
experiments that our algorithms are efficient on networks with billions of
edges.
","[{'version': 'v1', 'created': 'Tue, 21 Jul 2015 21:50:08 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Jul 2015 22:54:15 GMT'}, {'version': 'v3', 'created': 'Tue, 15 Dec 2015 02:07:04 GMT'}]",2015-12-16,"[['Lofgren', 'Peter', ''], ['Banerjee', 'Siddhartha', ''], ['Goel', 'Ashish', '']]","['Personalized Search', 'Personalized PageRank', 'Social Network Analysis']"
12143,2012.08692,Stephen MacDonell,"Michael Franklin Bosu, Stephen G. MacDonell, Peter Whigham","Testing the Stationarity Assumption in Software Effort Estimation
  Datasets","7 pages, conference, 1 table, 2 figures","Proceedings of the 32nd International Conference on Software
  Engineering and Knowledge Engineering (SEKE2020)",10.18293/SEKE2020-159,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software effort estimation (SEE) models are typically developed based on an
underlying assumption that all data points are equally relevant to the
prediction of effort for future projects. The dynamic nature of several aspects
of the software engineering process could mean that this assumption does not
hold in at least some cases. This study employs three kernel estimator
functions to test the stationarity assumption in three software engineering
datasets that have been used in the construction of software effort estimation
models. The kernel estimators are used in the generation of non-uniform weights
which are subsequently employed in weighted linear regression modeling.
Prediction errors are compared to those obtained from uniform models. Our
results indicate that, for datasets that exhibit underlying non-stationary
processes, uniform models are more accurate than non-uniform models. In
contrast, the accuracy of uniform and non-uniform models for datasets that
exhibited stationary processes was essentially equivalent. The results of our
study also confirm prior findings that the accuracy of effort estimation models
is independent of the type of kernel estimator function used in model
development.
","[{'version': 'v1', 'created': 'Wed, 16 Dec 2020 01:47:36 GMT'}]",2020-12-17,"[['Bosu', 'Michael Franklin', ''], ['MacDonell', 'Stephen G.', ''], ['Whigham', 'Peter', '']]","['Software effort estimation', 'software processes', 'stationarity', 'kernel estimators', 'weighted linear regression   1']"
12144,2205.00824,Pawel Ladosz,"Pawel Ladosz, Lilian Weng, Minwoo Kim, Hyondong Oh",Exploration in Deep Reinforcement Learning: A Survey,,,10.1016/j.inffus.2022.03.003,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper reviews exploration techniques in deep reinforcement learning.
Exploration techniques are of primary importance when solving sparse reward
problems. In sparse reward problems, the reward is rare, which means that the
agent will not find the reward often by acting randomly. In such a scenario, it
is challenging for reinforcement learning to learn rewards and actions
association. Thus more sophisticated exploration methods need to be devised.
This review provides a comprehensive overview of existing exploration
approaches, which are categorized based on the key contributions as follows
reward novel states, reward diverse behaviours, goal-based methods,
probabilistic methods, imitation-based methods, safe exploration and
random-based methods. Then, the unsolved challenges are discussed to provide
valuable future research directions. Finally, the approaches of different
categories are compared in terms of complexity, computational effort and
overall performance.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 12:03:44 GMT'}]",2022-05-03,"[['Ladosz', 'Pawel', ''], ['Weng', 'Lilian', ''], ['Kim', 'Minwoo', ''], ['Oh', 'Hyondong', '']]","['Deep reinforcement learning', 'Exploration', 'Intrinsic motivation', 'Sparse reward problems']"
12145,2206.13441,Haoran Su,"Haoran Su, Yaofeng D. Zhong, Joseph Y.J. Chow, Biswadip Dey and Li Jin","EMVLight: a Multi-agent Reinforcement Learning Framework for an
  Emergency Vehicle Decentralized Routing and Traffic Signal Control System","19 figures, 10 tables. Manuscript extended on previous work
  arXiv:2109.05429, arXiv:2111.00278","Transportation Research Part C: Emerging Technologies Volume 146,
  January 2023, 103955",10.1016/j.trc.2022.103955,,cs.AI cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  Emergency vehicles (EMVs) play a crucial role in responding to time-critical
calls such as medical emergencies and fire outbreaks in urban areas. Existing
methods for EMV dispatch typically optimize routes based on historical
traffic-flow data and design traffic signal pre-emption accordingly; however,
we still lack a systematic methodology to address the coupling between EMV
routing and traffic signal control. In this paper, we propose EMVLight, a
decentralized reinforcement learning (RL) framework for joint dynamic EMV
routing and traffic signal pre-emption. We adopt the multi-agent advantage
actor-critic method with policy sharing and spatial discounted factor. This
framework addresses the coupling between EMV navigation and traffic signal
control via an innovative design of multi-class RL agents and a novel
pressure-based reward function. The proposed methodology enables EMVLight to
learn network-level cooperative traffic signal phasing strategies that not only
reduce EMV travel time but also shortens the travel time of non-EMVs.
Simulation-based experiments indicate that EMVLight enables up to a $42.6\%$
reduction in EMV travel time as well as an $23.5\%$ shorter average travel time
compared with existing approaches.
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2022 16:46:20 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Jun 2022 05:04:08 GMT'}, {'version': 'v3', 'created': 'Wed, 29 Jun 2022 04:00:27 GMT'}]",2022-12-13,"[['Su', 'Haoran', ''], ['Zhong', 'Yaofeng D.', ''], ['Chow', 'Joseph Y. J.', ''], ['Dey', 'Biswadip', ''], ['Jin', 'Li', '']]","['Emergency Vehicle Management', 'Traffic Signal Control', 'DeepReinforcement Learning', 'Multi-agent System']"
12146,1804.00175,Yi Li,"Yi Li, Gu Wang, Xiangyang Ji, Yu Xiang, Dieter Fox",DeepIM: Deep Iterative Matching for 6D Pose Estimation,"submitted to IJCV, update results on YCB_Video, add depth-based
  results",,10.1007/s11263-019-01250-9,,cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Estimating the 6D pose of objects from images is an important problem in
various applications such as robot manipulation and virtual reality. While
direct regression of images to object poses has limited accuracy, matching
rendered images of an object against the observed image can produce accurate
results. In this work, we propose a novel deep neural network for 6D pose
matching named DeepIM. Given an initial pose estimation, our network is able to
iteratively refine the pose by matching the rendered image against the observed
image. The network is trained to predict a relative pose transformation using
an untangled representation of 3D location and 3D orientation and an iterative
training process. Experiments on two commonly used benchmarks for 6D pose
estimation demonstrate that DeepIM achieves large improvements over
state-of-the-art methods. We furthermore show that DeepIM is able to match
previously unseen objects.
","[{'version': 'v1', 'created': 'Sat, 31 Mar 2018 14:02:25 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Apr 2018 16:28:50 GMT'}, {'version': 'v3', 'created': 'Thu, 14 Mar 2019 13:25:49 GMT'}, {'version': 'v4', 'created': 'Wed, 2 Oct 2019 00:54:47 GMT'}]",2019-10-03,"[['Li', 'Yi', ''], ['Wang', 'Gu', ''], ['Ji', 'Xiangyang', ''], ['Xiang', 'Yu', ''], ['Fox', 'Dieter', '']]","['3D Object Recognition', '6D Object PoseEstimation', 'Object Tracking']"
12147,2112.11745,Mohammad Ghafari,Quentin Sti\'evenart and Coen De Roover and Mohammad Ghafari,Security Risks of Porting C Programs to WebAssembly,"The 37th ACM/SIGAPP Symposium on Applied Computing (SAC'22), 2022.
  arXiv admin note: text overlap with arXiv:2111.01421",,10.1145/3477314.3507308,,cs.CR cs.PL,http://creativecommons.org/licenses/by/4.0/,"  WebAssembly is a compilation target for cross-platform applications that is
increasingly being used. In this paper, we investigate whether one can
transparently cross-compile C programs to WebAssembly, and if not, what impact
porting can have on their security. We compile 17,802 programs that exhibit
common vulnerabilities to 64-bit x86 and to WebAssembly binaries, and we
observe that the execution of 4,911 binaries produces different results across
these platforms. Through manual inspection, we identify three classes of root
causes for such differences: the use of a different standard library
implementation, the lack of security measures in WebAssembly, and the different
semantics of the execution environments. We describe our observations and
discuss the ones that are critical from a security point of view and need most
attention from developers. We conclude that compiling an existing C program to
WebAssembly for cross-platform distribution may require source code
adaptations; otherwise, the security of the WebAssembly application may be at
risk.
","[{'version': 'v1', 'created': 'Wed, 22 Dec 2021 09:24:55 GMT'}]",2021-12-23,"[['Stiévenart', 'Quentin', ''], ['De Roover', 'Coen', ''], ['Ghafari', 'Mohammad', '']]","['WebAssembly', 'security', 'cross-compilation']"
12148,1605.03356,Ashkan Nikseresht,Ashkan Nikseresht,Dual of Codes over Finite Quotients of Polynomial Rings,16 pages,Finite Fields and Their Applications 45 (2017) 323-340,10.1016/j.ffa.2017.01.003,,cs.IT math.IT math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $A=\frac{\mathbb{F}[x]}{\langle f(x)\rangle }$, where $f(x)$ is a monic
polynomial over a finite field $\mathbb{F}$. In this paper, we study the
relation between $A$-codes and their duals. In particular, we state a
counterexample and a correction to a theorem of Berger and El Amrani (Codes
over finite quotients of polynomial rings, \emph{Finite Fields Appl.}
\textbf{25} (2014), 165--181) and present an efficient algorithm to find a
system of generators for the dual of a given $A$-code. Also we characterize
self-dual $A$-codes of length 2 and investigate when the $\mathbb{F}$-dual of
$A$-codes are $A$-codes.
","[{'version': 'v1', 'created': 'Wed, 11 May 2016 09:55:01 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Dec 2016 06:29:16 GMT'}]",2017-05-30,"[['Nikseresht', 'Ashkan', '']]","['Algebraic coding', 'Dual of a code', 'Basis of divisors', 'Polynomial ring']"
12149,1710.09552,Kunal Narayan Chaudhury,Sanjay Ghosh and Kunal N. Chaudhury,Artifact reduction for separable non-local means,To appear in Journal of Electronic Imaging,,10.1117/1.JEI.26.6.063012,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It was recently demonstrated [J. Electron. Imaging, 25(2), 2016] that one can
perform fast non-local means (NLM) denoising of one-dimensional signals using a
method called lifting. The cost of lifting is independent of the patch length,
which dramatically reduces the run-time for large patches. Unfortunately, it is
difficult to directly extend lifting for non-local means denoising of images.
To bypass this, the authors proposed a separable approximation in which the
image rows and columns are filtered using lifting. The overall algorithm is
significantly faster than NLM, and the results are comparable in terms of PSNR.
However, the separable processing often produces vertical and horizontal
stripes in the image. This problem was previously addressed by using a
bilateral filter-based post-smoothing, which was effective in removing some of
the stripes. In this letter, we demonstrate that stripes can be mitigated in
the first place simply by involving the neighboring rows (or columns) in the
filtering. In other words, we use a two-dimensional search (similar to NLM),
while still using one-dimensional patches (as in the previous proposal). The
novelty is in the observation that one can use lifting for performing
two-dimensional searches. The proposed approach produces artifact-free images,
whose quality and PSNR are comparable to NLM, while being significantly faster.
","[{'version': 'v1', 'created': 'Thu, 26 Oct 2017 06:05:06 GMT'}]",2018-03-14,"[['Ghosh', 'Sanjay', ''], ['Chaudhury', 'Kunal N.', '']]","['Denoising', 'non-local means', 'fast algorithm', 'lifting', 'artifact']"
12150,1506.05645,Xavier Caruso,"Alin Bostan (SPECFUN), Xavier Caruso (IRMAR), \'Eric Schost",A Fast Algorithm for Computing the p-Curvature,"ISSAC 2015, Jul 2015, Bath, United Kingdom",,10.1145/2755996.2756674,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We design an algorithm for computing the $p$-curvature of a differential
system in positive characteristic $p$. For a system of dimension $r$ with
coefficients of degree at most $d$, its complexity is $\softO (p d r^\omega)$
operations in the ground field (where $\omega$ denotes the exponent of matrix
multiplication), whereas the size of the output is about $p d r^2$. Our
algorithm is then quasi-optimal assuming that matrix multiplication is
(\emph{i.e.} $\omega = 2$). The main theoretical input we are using is the
existence of a well-suited ring of series with divided powers for which an
analogue of the Cauchy--Lipschitz Theorem holds.
","[{'version': 'v1', 'created': 'Thu, 18 Jun 2015 12:14:55 GMT'}]",2015-06-19,"[['Bostan', 'Alin', '', 'SPECFUN'], ['Caruso', 'Xavier', '', 'IRMAR'], ['Schost', 'Éric', '']]","['Algorithms', 'complexity', 'differential equations', 'p-curvature']"
12151,1910.11679,Imad El Hanouti,"Imad El Hanouti, Hakim El Fadili, Khalid Zenkouar","Cryptanalysis of a Chaos-Based Fast Image Encryption Algorithm for
  Embedded Systems",11 pages,,10.1007/s11042-020-10289-7,,cs.CR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fairly recently, a new encryption scheme for embedded systems based on
continuous third-order hyperbolic sine chaotic system was proposed by Z. Lin et
al. The cryptosystem's main objective is to provide a faster algorithm with
lowest computational time in order to be qualified for use in embedded systems
especially on a program of UAV (unmanned aerial vehicle). In this paper, we
scrutinize the design architecture of this recently proposed scheme against
conventional attacks e.g., chosen plaintext attack, differential attack, known
plaintext attack. We prove in this paper that, negatively, the studied system
is vulnerable. For differential attack, only two chosen plain images are
required to recover the full equivalent key. Moreover, only one 3x400 size
image is sufficient to break the cryptosystem under chosen plaintext attack
considering stability of sort algorithm. Therefore, the proposed scheme is not
recommended for security purposes.
","[{'version': 'v1', 'created': 'Sat, 19 Oct 2019 10:37:35 GMT'}]",2021-06-21,"[['Hanouti', 'Imad El', ''], ['Fadili', 'Hakim El', ''], ['Zenkouar', 'Khalid', '']]","['cryptanalysis', 'chaotic systems', 'embedded systems', 'chosen plaintext attack', 'differential attack']"
12152,2301.03093,Mahbuba Yesmin Turaba,"Md. Kowsher, Mahbuba Yesmin Turaba, Tanvir Sajed, M M Mahabubur Rahman","Prognosis and Treatment Prediction of Type-2 Diabetes Using Deep Neural
  Network and Machine Learning Classifiers",,,10.1109/ICCIT48885.2019.9038574,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Type 2 Diabetes is a fast-growing, chronic metabolic disorder due to
imbalanced insulin activity.The motion of this research is a comparative study
of seven machine learning classifiers and an artificial neural network method
to prognosticate the detection and treatment of diabetes with high accuracy,in
order to identify and treat diabetes patients at an early age.Our training and
test dataset is an accumulation of 9483 diabetes patients information.The
training dataset is large enough to negate overfitting and provide for highly
accurate test performance.We use performance measures such as accuracy and
precision to find out the best algorithm deep ANN which outperforms with 95.14%
accuracy among all other tested machine learning classifiers.We hope our
high-performing model can be used by hospitals to predict diabetes and drive
research into more accurate prediction models.
","[{'version': 'v1', 'created': 'Sun, 8 Jan 2023 19:10:20 GMT'}]",2023-01-10,"[['Kowsher', 'Md.', ''], ['Turaba', 'Mahbuba Yesmin', ''], ['Sajed', 'Tanvir', ''], ['Rahman', 'M M Mahabubur', '']]","['Artificial Neural Network', 'Type 2 diabetes', 'Support Vector Machine', 'Decision Tree', 'Naive Bayes', 'LDA', 'Random forest classifier']"
12153,2206.04789,Tianxin Wei,"Tianxin Wei, Jingrui He",Comprehensive Fair Meta-learned Recommender System,Accepted to SIGKDD 2022,,10.1145/3534678.3539269,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recommender systems, one common challenge is the cold-start problem, where
interactions are very limited for fresh users in the systems. To address this
challenge, recently, many works introduce the meta-optimization idea into the
recommendation scenarios, i.e. learning to learn the user preference by only a
few past interaction items. The core idea is to learn global shared
meta-initialization parameters for all users and rapidly adapt them into local
parameters for each user respectively. They aim at deriving general knowledge
across preference learning of various users, so as to rapidly adapt to the
future new user with the learned prior and a small amount of training data.
However, previous works have shown that recommender systems are generally
vulnerable to bias and unfairness. Despite the success of meta-learning at
improving the recommendation performance with cold-start, the fairness issues
are largely overlooked. In this paper, we propose a comprehensive fair
meta-learning framework, named CLOVER, for ensuring the fairness of
meta-learned recommendation models. We systematically study three kinds of
fairness - individual fairness, counterfactual fairness, and group fairness in
the recommender systems, and propose to satisfy all three kinds via a
multi-task adversarial learning scheme. Our framework offers a generic training
paradigm that is applicable to different meta-learned recommender systems. We
demonstrate the effectiveness of CLOVER on the representative meta-learned user
preference estimator on three real-world data sets. Empirical results show that
CLOVER achieves comprehensive fairness without deteriorating the overall
cold-start recommendation performance.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2022 22:48:35 GMT'}]",2022-06-13,"[['Wei', 'Tianxin', ''], ['He', 'Jingrui', '']]","['Fairness', 'Recommender Systems', 'Meta-Learning']"
12154,1912.09445,S. Mohammad Mirbagheri,"S. Mohammad Mirbagheri, Howard J. Hamilton","FIBS: A Generic Framework for Classifying Interval-based Temporal
  Sequences","In: Big Data Analytics and Knowledge Discovery. DaWaK 2020. Springer,
  Cham","22nd International Conference on Big Data Analytics and Knowledge
  Discovery (DaWaK), Bratislava, Slovakia, September 14-17, 2020. Springer,
  Cham",10.1007/978-3-030-59065-9_24,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of classifying interval-based temporal sequences
(IBTSs). Since common classification algorithms cannot be directly applied to
IBTSs, the main challenge is to define a set of features that effectively
represents the data such that classifiers can be applied. Most prior work
utilizes frequent pattern mining to define a feature set based on discovered
patterns. However, frequent pattern mining is computationally expensive and
often discovers many irrelevant patterns. To address this shortcoming, we
propose the FIBS framework for classifying IBTSs. FIBS extracts features
relevant to classification from IBTSs based on relative frequency and temporal
relations. To avoid selecting irrelevant features, a filter-based selection
strategy is incorporated into FIBS. Our empirical evaluation on eight
real-world datasets demonstrates the effectiveness of our methods in practice.
The results provide evidence that FIBS effectively represents IBTSs for
classification algorithms, which contributes to similar or significantly better
accuracy compared to state-of-the-art competitors. It also suggests that the
feature selection strategy is beneficial to FIBS's performance.
","[{'version': 'v1', 'created': 'Thu, 19 Dec 2019 18:23:27 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Sep 2020 18:21:47 GMT'}]",2020-09-18,"[['Mirbagheri', 'S. Mohammad', ''], ['Hamilton', 'Howard J.', '']]","['Interval-based events', 'Temporal interval sequences', 'Featurebased classification framework']"
12155,1809.04127,Minghong Fang,"Minghong Fang, Guolei Yang, Neil Zhenqiang Gong, Jia Liu",Poisoning Attacks to Graph-Based Recommender Systems,"34th Annual Computer Security Applications Conference (ACSAC), 2018;
  Due to the limitation ""The abstract field cannot be longer than 1,920
  characters"", the abstract appearing here is slightly shorter than that in the
  PDF file",,10.1145/3274694.3274706,,cs.IR cs.CR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender system is an important component of many web services to help
users locate items that match their interests. Several studies showed that
recommender systems are vulnerable to poisoning attacks, in which an attacker
injects fake data to a given system such that the system makes recommendations
as the attacker desires. However, these poisoning attacks are either agnostic
to recommendation algorithms or optimized to recommender systems that are not
graph-based. Like association-rule-based and matrix-factorization-based
recommender systems, graph-based recommender system is also deployed in
practice, e.g., eBay, Huawei App Store. However, how to design optimized
poisoning attacks for graph-based recommender systems is still an open problem.
In this work, we perform a systematic study on poisoning attacks to graph-based
recommender systems. Due to limited resources and to avoid detection, we assume
the number of fake users that can be injected into the system is bounded. The
key challenge is how to assign rating scores to the fake users such that the
target item is recommended to as many normal users as possible. To address the
challenge, we formulate the poisoning attacks as an optimization problem,
solving which determines the rating scores for the fake users. We also propose
techniques to solve the optimization problem. We evaluate our attacks and
compare them with existing attacks under white-box (recommendation algorithm
and its parameters are known), gray-box (recommendation algorithm is known but
its parameters are unknown), and black-box (recommendation algorithm is
unknown) settings using two real-world datasets. Our results show that our
attack is effective and outperforms existing attacks for graph-based
recommender systems. For instance, when 1% fake users are injected, our attack
can make a target item recommended to 580 times more normal users in certain
scenarios.
","[{'version': 'v1', 'created': 'Tue, 11 Sep 2018 19:50:41 GMT'}]",2018-09-13,"[['Fang', 'Minghong', ''], ['Yang', 'Guolei', ''], ['Gong', 'Neil Zhenqiang', ''], ['Liu', 'Jia', '']]","['Adversarial recommender systems', 'poisoning atacks', 'adversarialmachine learning']"
12156,2108.05499,Zhihao Peng,"Zhihao Peng, Hui Liu, Yuheng Jia, Junhui Hou",Attention-driven Graph Clustering Network,,,10.1145/3474085.3475276,,cs.CV cs.MM,http://creativecommons.org/licenses/by/4.0/,"  The combination of the traditional convolutional network (i.e., an
auto-encoder) and the graph convolutional network has attracted much attention
in clustering, in which the auto-encoder extracts the node attribute feature
and the graph convolutional network captures the topological graph feature.
However, the existing works (i) lack a flexible combination mechanism to
adaptively fuse those two kinds of features for learning the discriminative
representation and (ii) overlook the multi-scale information embedded at
different layers for subsequent cluster assignment, leading to inferior
clustering results. To this end, we propose a novel deep clustering method
named Attention-driven Graph Clustering Network (AGCN). Specifically, AGCN
exploits a heterogeneity-wise fusion module to dynamically fuse the node
attribute feature and the topological graph feature. Moreover, AGCN develops a
scale-wise fusion module to adaptively aggregate the multi-scale features
embedded at different layers. Based on a unified optimization framework, AGCN
can jointly perform feature learning and cluster assignment in an unsupervised
fashion. Compared with the existing deep clustering methods, our method is more
flexible and effective since it comprehensively considers the numerous and
discriminative information embedded in the network and directly produces the
clustering results. Extensive quantitative and qualitative results on commonly
used benchmark datasets validate that our AGCN consistently outperforms
state-of-the-art methods.
","[{'version': 'v1', 'created': 'Thu, 12 Aug 2021 02:30:38 GMT'}]",2021-08-13,"[['Peng', 'Zhihao', ''], ['Liu', 'Hui', ''], ['Jia', 'Yuheng', ''], ['Hou', 'Junhui', '']]","['Deep clustering', 'attention-based mechanism', 'multi-scale features', 'feature fusion']"
12157,2112.12248,David Anisi,"Yvonne Murray, Martin Sirev{\aa}g, Pedro Ribeiro, David A. Anisi,
  Morten Mossige","Safety assurance of an industrial robotic control system using
  hardware/software co-verification","preprint, Author Accepted Manuscript",,10.1016/j.scico.2021.102766,,cs.RO cs.FL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  As a general trend in industrial robotics, an increasing number of safety
functions are being developed or re-engineered to be handled in software rather
than by physical hardware such as safety relays or interlock circuits. This
trend reinforces the importance of supplementing traditional, input-based
testing and quality procedures which are widely used in industry today, with
formal verification and model-checking methods. To this end, this paper focuses
on a representative safety-critical system in an ABB industrial paint robot,
namely the High-Voltage electrostatic Control system (HVC). The practical
convergence of the high-voltage produced by the HVC, essential for safe
operation, is formally verified using a novel and general co-verification
framework where hardware and software models are related via platform mappings.
This approach enables the pragmatic combination of highly diverse and
specialised tools. The paper's main contribution includes details on how
hardware abstraction and verification results can be transferred between tools
in order to verify system-level safety properties. It is noteworthy that the
HVC application considered in this paper has a rather generic form of a
feedback controller. Hence, the co-verification framework and experiences
reported here are also highly relevant for any cyber-physical system tracking a
setpoint reference.
","[{'version': 'v1', 'created': 'Wed, 22 Dec 2021 22:29:40 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Dec 2021 10:29:25 GMT'}]",2022-01-28,"[['Murray', 'Yvonne', ''], ['Sirevåg', 'Martin', ''], ['Ribeiro', 'Pedro', ''], ['Anisi', 'David A.', ''], ['Mossige', 'Morten', '']]","['Formal Verification', 'Co-Verification', 'Model Checking', 'High-Voltage Controller (HVC)', 'Robots', 'Cyber-Physical Systems (CPS)']"
12158,1402.6663,Pierre De Loor,"Pierre De Loor, Kristen Manach and Jacques Tisseau","Enaction-Based Artificial Intelligence: Toward Coevolution with Humans
  in the Loop",,"Minds and Machine, num 19, pp 319-343, 2009",10.1007/s11023-009-9165-3,,cs.AI nlin.AO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article deals with the links between the enaction paradigm and
artificial intelligence. Enaction is considered a metaphor for artificial
intelligence, as a number of the notions which it deals with are deemed
incompatible with the phenomenal field of the virtual. After explaining this
stance, we shall review previous works regarding this issue in terms of
artifical life and robotics. We shall focus on the lack of recognition of
co-evolution at the heart of these approaches. We propose to explicitly
integrate the evolution of the environment into our approach in order to refine
the ontogenesis of the artificial system, and to compare it with the enaction
paradigm. The growing complexity of the ontogenetic mechanisms to be activated
can therefore be compensated by an interactive guidance system emanating from
the environment. This proposition does not however resolve that of the
relevance of the meaning created by the machine (sense-making). Such
reflections lead us to integrate human interaction into this environment in
order to construct relevant meaning in terms of participative artificial
intelligence. This raises a number of questions with regards to setting up an
enactive interaction. The article concludes by exploring a number of issues,
thereby enabling us to associate current approaches with the principles of
morphogenesis, guidance, the phenomenology of interactions and the use of
minimal enactive interfaces in setting up experiments which will deal with the
problem of artificial intelligence in a variety of enaction-based ways.
","[{'version': 'v1', 'created': 'Wed, 26 Feb 2014 20:10:39 GMT'}]",2014-02-27,"[['De Loor', 'Pierre', ''], ['Manach', 'Kristen', ''], ['Tisseau', 'Jacques', '']]","['enaction', 'embodied-embedded AI', 'sense-making', 'co-evolution', 'guidance', 'phylogenesis/ontogenesis ratio', 'Human in the Loop', 'Virtual Reality']"
12159,1804.00994,Thomas Vogel,"Arthur Rodrigues (1), Ricardo Diniz Caldas (1), Gena\'ina Nunes
  Rodrigues (1), Thomas Vogel (2), Patrizio Pelliccione (3) ((1) University of
  Bras\'ilia, Bras\'ilia, DF, Brazil, (2) Humboldt-Universit\""at zu Berlin,
  Berlin, Germany, (3) Chalmers | University of Gothenburg, Gothenburg, Sweden)","A Learning Approach to Enhance Assurances for Real-Time Self-Adaptive
  Systems",,"SEAMS'18: 13th International Symposium on Software Engineering for
  Adaptive and Self-Managing Systems, May 28-29, 2018, Gothenburg, Sweden",10.1145/3194133.3194147,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The assurance of real-time properties is prone to context variability.
Providing such assurance at design time would require to check all the possible
context and system variations or to predict which one will be actually used.
Both cases are not viable in practice since there are too many possibilities to
foresee. Moreover, the knowledge required to fully provide the assurance for
self-adaptive systems is only available at runtime and therefore difficult to
predict at early development stages. Despite all the efforts on assurances for
self-adaptive systems at design or runtime, there is still a gap on verifying
and validating real-time constraints accounting for context variability. To
fill this gap, we propose a method to provide assurance of self-adaptive
systems, at design- and runtime, with special focus on real-time constraints.
We combine off-line requirements elicitation and model checking with on-line
data collection and data mining to guarantee the system's goals, both
functional and non-functional, with fine tuning of the adaptation policies
towards the optimization of quality attributes. We experimentally evaluate our
method on a simulated prototype of a Body Sensor Network system (BSN)
implemented in OpenDaVINCI. The results of the validation are promising and
show that our method is effective in providing evidence that support the
provision of assurance.
","[{'version': 'v1', 'created': 'Tue, 3 Apr 2018 14:36:58 GMT'}]",2018-04-04,"[['Rodrigues', 'Arthur', ''], ['Caldas', 'Ricardo Diniz', ''], ['Rodrigues', 'Genaína Nunes', ''], ['Vogel', 'Thomas', ''], ['Pelliccione', 'Patrizio', '']]","['Self-adaptive systems', 'assurance evidence', 'goal-oriented', 'real-timesystems', 'data mining', 'learning approach']"
12160,2208.02815,Pasquale Salza,"Marco Edoardo Palma, Pasquale Salza, Harald C. Gall",On-the-Fly Syntax Highlighting using Neural Networks,"Accepted for publication in the ACM Joint European Software
  Engineering Conference and Symposium on the Foundations of Software
  Engineering (ESEC/FSE 2022)",,10.1145/3540250.3549109,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the presence of online collaborative tools for software developers,
source code is shared and consulted frequently, from code viewers to merge
requests and code snippets. Typically, code highlighting quality in such
scenarios is sacrificed in favor of system responsiveness. In these on-the-fly
settings, performing a formal grammatical analysis of the source code is not
only expensive, but also intractable for the many times the input is an invalid
derivation of the language. Indeed, current popular highlighters heavily rely
on a system of regular expressions, typically far from the specification of the
language's lexer. Due to their complexity, regular expressions need to be
periodically updated as more feedback is collected from the users and their
design unwelcome the detection of more complex language formations. This paper
delivers a deep learning-based approach suitable for on-the-fly grammatical
code highlighting of correct and incorrect language derivations, such as code
viewers and snippets. It focuses on alleviating the burden on the developers,
who can reuse the language's parsing strategy to produce the desired
highlighting specification. Moreover, this approach is compared to nowadays
online syntax highlighting tools and formal methods in terms of accuracy and
execution time, across different levels of grammatical coverage, for three
mainstream programming languages. The results obtained show how the proposed
approach can consistently achieve near-perfect accuracy in its predictions,
thereby outperforming regular expression-based strategies.
","[{'version': 'v1', 'created': 'Thu, 4 Aug 2022 17:59:45 GMT'}]",2022-08-05,"[['Palma', 'Marco Edoardo', ''], ['Salza', 'Pasquale', ''], ['Gall', 'Harald C.', '']]","['Syntax highlighting', 'neural networks', 'deep learning', 'regular expressions']"
12161,2103.13549,Zheng Tong,"Zheng Tong, Philippe Xu, Thierry Den{\oe}ux","An evidential classifier based on Dempster-Shafer theory and deep
  learning",,"Neurocomputing, Vol. 450, pages 275-293, 2021",10.1016/j.neucom.2021.03.066,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new classifier based on Dempster-Shafer (DS) theory and a
convolutional neural network (CNN) architecture for set-valued classification.
In this classifier, called the evidential deep-learning classifier,
convolutional and pooling layers first extract high-dimensional features from
input data. The features are then converted into mass functions and aggregated
by Dempster's rule in a DS layer. Finally, an expected utility layer performs
set-valued classification based on mass functions. We propose an end-to-end
learning strategy for jointly updating the network parameters. Additionally, an
approach for selecting partial multi-class acts is proposed. Experiments on
image recognition, signal processing, and semantic-relationship classification
tasks demonstrate that the proposed combination of deep CNN, DS layer, and
expected utility layer makes it possible to improve classification accuracy and
to make cautious decisions by assigning confusing patterns to multi-class sets.
","[{'version': 'v1', 'created': 'Thu, 25 Mar 2021 01:29:05 GMT'}]",2021-05-07,"[['Tong', 'Zheng', ''], ['Xu', 'Philippe', ''], ['Denœux', 'Thierry', '']]","['Evidence theory', 'belief function', 'convolutional neural network', 'decisionanalysis', 'classification']"
12162,1903.06656,Felix Hamza-Lup,"Ivan Sopin, Felix G. Hamza-Lup",Extending the Web3D: Design of Conventional GUI Libraries in X3D,,"3D Web Technology, 2010, pp. 137-146",10.1145/1836049.1836070,,cs.HC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Extensible 3D (X3D) modeling language is one of the leading Web3D
technologies. Despite the rich functionality, the language does not currently
provide tools for rapid development of conventional graphical user interfaces
(GUIs). Every X3D author is responsible for building from primitives a purpose
specific set of required interface components, often for a single use. We
address the challenge of creating consistent, efficient, interactive, and
visually appealing GUIs by proposing the X3D User Interface (X3DUI) library.
This library includes a wide range of cross-compatible X3D widgets, equipped
with configurable appearance and behavior. With this library, we attempt to
standardize the GUI construction across various X3D-driven projects, and
improve the usability, compatibility, adaptability, readability, and
flexibility of many existing applications.
","[{'version': 'v1', 'created': 'Fri, 8 Mar 2019 04:19:06 GMT'}]",2019-03-18,"[['Sopin', 'Ivan', ''], ['Hamza-Lup', 'Felix G.', '']]","['X3D', 'GUI Library', 'Visualization Framework']"
12163,2112.06148,Alex Renda,"Alex Renda, Yi Ding, Michael Carbin",Programming with Neural Surrogates of Programs,,Onward! 2021,10.1145/3486607.3486748,,cs.PL cs.LG cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Surrogates, models that mimic the behavior of programs, form the basis of a
variety of development workflows. We study three surrogate-based design
patterns, evaluating each in case studies on a large-scale CPU simulator.
  With surrogate compilation, programmers develop a surrogate that mimics the
behavior of a program to deploy to end-users in place of the original program.
Surrogate compilation accelerates the CPU simulator under study by $1.6\times$.
With surrogate adaptation, programmers develop a surrogate of a program then
retrain that surrogate on a different task. Surrogate adaptation decreases the
simulator's error by up to $50\%$. With surrogate optimization, programmers
develop a surrogate of a program, optimize input parameters of the surrogate,
then plug the optimized input parameters back into the original program.
Surrogate optimization finds simulation parameters that decrease the
simulator's error by $5\%$ compared to the error induced by expert-set
parameters.
  In this paper we formalize this taxonomy of surrogate-based design patterns.
We further describe the programming methodology common to all three design
patterns. Our work builds a foundation for the emerging class of workflows
based on programming with surrogates of programs.
","[{'version': 'v1', 'created': 'Sun, 12 Dec 2021 04:45:41 GMT'}]",2021-12-14,"[['Renda', 'Alex', ''], ['Ding', 'Yi', ''], ['Carbin', 'Michael', '']]","['programming languages', 'machine learning', 'surrogate models', 'neural networks']"
12164,1810.04227,Chris Cantwell,"Chris D. Cantwell, Yumnah Mohamied, Konstantinos N. Tzortzis, Stef
  Garasto, Charles Houston, Rasheda A. Chowdhury, Fu Siong Ng, Anil A. Bharath,
  Nicholas S. Peters","Rethinking multiscale cardiac electrophysiology with machine learning
  and predictive modelling",,,10.1016/j.compbiomed.2018.10.015,,cs.LG math.DS q-bio.TO stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We review some of the latest approaches to analysing cardiac
electrophysiology data using machine learning and predictive modelling. Cardiac
arrhythmias, particularly atrial fibrillation, are a major global healthcare
challenge. Treatment is often through catheter ablation, which involves the
targeted localized destruction of regions of the myocardium responsible for
initiating or perpetuating the arrhythmia. Ablation targets are either
anatomically defined, or identified based on their functional properties as
determined through the analysis of contact intracardiac electrograms acquired
with increasing spatial density by modern electroanatomic mapping systems.
While numerous quantitative approaches have been investigated over the past
decades for identifying these critical curative sites, few have provided a
reliable and reproducible advance in success rates. Machine learning
techniques, including recent deep-learning approaches, offer a potential route
to gaining new insight from this wealth of highly complex spatio-temporal
information that existing methods struggle to analyse. Coupled with predictive
modelling, these techniques offer exciting opportunities to advance the field
and produce more accurate diagnoses and robust personalised treatment. We
outline some of these methods and illustrate their use in making predictions
from the contact electrogram and augmenting predictive modelling tools, both by
more rapidly predicting future states of the system and by inferring the
parameters of these models from experimental observations.
","[{'version': 'v1', 'created': 'Tue, 9 Oct 2018 20:09:45 GMT'}]",2018-10-22,"[['Cantwell', 'Chris D.', ''], ['Mohamied', 'Yumnah', ''], ['Tzortzis', 'Konstantinos N.', ''], ['Garasto', 'Stef', ''], ['Houston', 'Charles', ''], ['Chowdhury', 'Rasheda A.', ''], ['Ng', 'Fu Siong', ''], ['Bharath', 'Anil A.', ''], ['Peters', 'Nicholas S.', '']]","['cardiac electrophysiology', 'cardiac arrhythmia', 'electrogram', 'machine learning', 'predictive modelling', 'deep learning']"
12165,1910.00730,Yajun Zhao,"Yifei Yuan, Yajun Zhao, Baiqing Zong, Sergio Parolari",Potential Key Technologies for 6G Mobile Communications,"SCIENCE CHINA Information Sciences, 28 pages, 7 figures,","Sci China Inf Sci, 2020, 63(8): 183301",10.1007/s11432-019-2789-y,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The standard development of 5G wireless communication culminated between 2017
and 2019, followed by the worldwide deployment of 5G networks, which is
expected to result in very high data rate for enhanced mobile broadband,
support ultra-reliable and low-latency services and accommodate massive number
of connections. Research attention is shifting to future generation of wireless
communications, for instance, beyond 5G or 6G. Unlike previous papers, which
discussed the use cases, deployment scenarios, or new network architectures of
6G in depth, this paper focuses on a few potential technologies for 6G wireless
communications, all of which represent certain fundamental breakthrough at the
physical layer-technical hardcore of any new generation of wireless
communications. Some of them, such as holographic radio, terahertz
communication, large intelligent surface, and orbital angular momentum, are of
revolutionary nature and many related studies are still at their scientific
exploration stage. Several technical areas, such as advanced channel coding and
modulation, visible light communication, and advanced duplex, while having been
studied, may find more opportunities in 6G.
","[{'version': 'v1', 'created': 'Wed, 2 Oct 2019 00:55:11 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Mar 2020 03:09:16 GMT'}]",2020-05-28,"[['Yuan', 'Yifei', ''], ['Zhao', 'Yajun', ''], ['Zong', 'Baiqing', ''], ['Parolari', 'Sergio', '']]","['6G', 'holographic radio', 'terahertz', 'large intelligent surface', 'orbital angular momentum', 'advanced']"
12166,2111.14123,Klaus-Tycho Foerster,"Oliver Schweiger, Klaus-Tycho Foerster, Stefan Schmid","Improving the Resilience of Fast Failover Routing: TREE (Tree Routing to
  Extend Edge disjoint paths)","Accepted at the ACM/IEEE Symposium on Architectures for Networking
  and Communications Systems 2021 (ANCS'21)",,10.1145/3493425.3502747,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today's communication networks have stringent availability requirements and
hence need to rapidly restore connectivity after failures. Modern networks thus
implement various forms of fast reroute mechanisms in the data plane, to bridge
the gap to slow global control plane convergence. State-of-the-art fast reroute
commonly relies on disjoint route structures, to offer multiple independent
paths to the destination. We propose to leverage the network's path diversity
to extend edge disjoint path mechanisms to tree routing, in order to improve
the performance of fast rerouting. We present two such tree-mechanisms in
detail and show that they boost resilience by up to 12% and 25% respectively on
real-world, synthetic, and data center topologies, while still retaining good
path length qualities.
","[{'version': 'v1', 'created': 'Sun, 28 Nov 2021 11:59:31 GMT'}]",2021-11-30,"[['Schweiger', 'Oliver', ''], ['Foerster', 'Klaus-Tycho', ''], ['Schmid', 'Stefan', '']]","['networks', 'routing schemes', 'fast failover', 'fast reroute', 'network resilience', 'data plane']"
12167,2012.13720,Binjie Ding,"Yanlong Cao, Binjie Ding, Zewei He, Jiangxin Yang, Jingxi Chen,
  Yanpeng Cao and Xin Li","Learning Inter- and Intraframe Representations for Non-Lambertian
  Photometric Stereo","9 pages,8 figures",,10.1016/j.optlaseng.2021.106838,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Photometric stereo provides an important method for high-fidelity 3D
reconstruction based on multiple intensity images captured under different
illumination directions. In this paper, we present a complete framework,
including a multilight source illumination and acquisition hardware system and
a two-stage convolutional neural network (CNN) architecture, to construct
inter- and intraframe representations for accurate normal estimation of
non-Lambertian objects. We experimentally investigate numerous network design
alternatives for identifying the optimal scheme to deploy inter- and intraframe
feature extraction modules for the photometric stereo problem. Moreover, we
propose utilizing the easily obtained object mask to eliminate adverse
interference from invalid background regions in intraframe spatial
convolutions, thus effectively improving the accuracy of normal estimation for
surfaces made of dark materials or with cast shadows. Experimental results
demonstrate that the proposed masked two-stage photometric stereo CNN model
(MT-PS-CNN) performs favourably against state-of-the-art photometric stereo
techniques in terms of both accuracy and efficiency. In addition, the proposed
method is capable of predicting accurate and rich surface normal details for
non-Lambertian objects of complex geometry and performs stably given inputs
captured in both sparse and dense lighting distributions.
","[{'version': 'v1', 'created': 'Sat, 26 Dec 2020 11:22:56 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Dec 2020 14:08:57 GMT'}, {'version': 'v3', 'created': 'Thu, 21 Oct 2021 06:25:48 GMT'}]",2021-10-22,"[['Cao', 'Yanlong', ''], ['Ding', 'Binjie', ''], ['He', 'Zewei', ''], ['Yang', 'Jiangxin', ''], ['Chen', 'Jingxi', ''], ['Cao', 'Yanpeng', ''], ['Li', 'Xin', '']]","['Photometric Stereo', 'Convolutional Neural Network (CNN)', '3D Reconstruction/Modeling']"
12168,2002.10145,Armin Wei{\ss},Armin Wei{\ss},"Hardness of equations over finite solvable groups under the exponential
  time hypothesis",,,10.4230/LIPIcs.ICALP.2020.102,,cs.CC math.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Goldmann and Russell (2002) initiated the study of the complexity of the
equation satisfiability problem in finite groups by showing that it is in P for
nilpotent groups while it is NP-complete for non-solvable groups. Since then,
several results have appeared showing that the problem can be solved in
polynomial time in certain solvable groups of Fitting length two. In this work,
we present the first lower bounds for the equation satisfiability problem in
finite solvable groups: under the assumption of the exponential time
hypothesis, we show that it cannot be in P for any group of Fitting length at
least four and for certain groups of Fitting length three. Moreover, the same
hardness result applies to the equation identity problem.
","[{'version': 'v1', 'created': 'Mon, 24 Feb 2020 10:26:34 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Oct 2020 15:45:23 GMT'}]",2020-10-27,"[['Weiß', 'Armin', '']]","['equations in groups', 'solvable groups', 'exponential time hypothesis']"
12169,2210.14621,ELkebir Sarhrouni,"A. Elmaizi, E. Sarhrouni, A. Hammouch, C. Nacir","A new band selection approach based on information theory and support
  vector machine for hyperspectral images reduction and classification",,"2017 International Symposium on Networks, Computers and
  Communications (ISNCC) -
  http://www.scopus.com/inward/record.url?eid=2-s2.0-85039974269&partnerID=MN8TOARS",10.1109/ISNCC.2017.8072002,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The high dimensionality of hyperspectral images consisting of several bands
often imposes a big computational challenge for image processing. Therefore,
spectral band selection is an essential step for removing the irrelevant, noisy
and redundant bands. Consequently increasing the classification accuracy.
However, identification of useful bands from hundreds or even thousands of
related bands is a nontrivial task. This paper aims at identifying a small set
of highly discriminative bands, for improving computational speed and
prediction accuracy. Hence, we proposed a new strategy based on joint mutual
information to measure the statistical dependence and correlation between the
selected bands and evaluate the relative utility of each one to classification.
The proposed filter approach is compared to an effective reproduced filters
based on mutual information. Simulations results on the hyperpectral image HSI
AVIRIS 92AV3C using the SVM classifier have shown that the effective proposed
algorithm outperforms the reproduced filters strategy performance.
  Keywords-Hyperspectral images, Classification, band Selection, Joint Mutual
Information, dimensionality reduction ,correlation, SVM.
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2022 10:54:23 GMT'}]",2022-10-27,"[['Elmaizi', 'A.', ''], ['Sarhrouni', 'E.', ''], ['Hammouch', 'A.', ''], ['Nacir', 'C.', '']]","['Hyperspectral images', 'Classification', 'band']"
12170,2106.03002,Luz Angela Aristiz\'abal Quintero,Luz Angela Aristiz\'abal Q and Nicol\'as Toro G,Multilayer Representation and Multiscale Analysis on Data Networks,15 pages,"International Journal of Computer Networks & Communications
  (IJCNC). Volumen 13, Number 1 (2021)",10.13039/501100002753,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The constant increase in the complexity of data networks motivates the search
for strategies that make it possible to reduce current monitoring times. This
paper shows the way in which multilayer network representation and the
application of multiscale analysis techniques, as applied to software-defined
networks, allows for the visualization of anomalies from ""coarse views of the
network topology"". This implies the analysis of fewer data, and consequently
the reduction of the time that a process takes to monitor the network. The fact
that software-defined networks allow for the obtention of a global view of
network behavior facilitates detail recovery from affected zones detected in
monitoring processes. The method is evaluated by calculating the reduction
factor of nodes, checked during anomaly detection, with respect to the total
number of nodes in the network.
","[{'version': 'v1', 'created': 'Sun, 6 Jun 2021 01:39:52 GMT'}]",2021-06-08,"[['Q', 'Luz Angela Aristizábal', ''], ['G', 'Nicolás Toro', '']]","['Multiscale analysis', 'Multilayer representation', 'Graph signal processing', 'Software defined networks', 'Monitoring']"
12171,1910.11142,Yury Maximov,"Valerii Likhosherstov, Yury Maximov, Michael Chertkov",Tractable Minor-free Generalization of Planar Zero-field Ising Models,"32 pages. arXiv admin note: substantial text overlap with
  arXiv:1906.06431, arXiv:1812.09587","Journal of Statistical Mechanics: Theory and Experiment, 2020",10.1088/1742-5468/abcaf1,,cs.DS math.ST physics.data-an stat.ML stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new family of zero-field Ising models over $N$ binary
variables/spins obtained by consecutive ""gluing"" of planar and $O(1)$-sized
components and subsets of at most three vertices into a tree. The
polynomial-time algorithm of the dynamic programming type for solving exact
inference (computing partition function) and exact sampling (generating i.i.d.
samples) consists in a sequential application of an efficient (for planar) or
brute-force (for $O(1)$-sized) inference and sampling to the components as a
black box. To illustrate the utility of the new family of tractable graphical
models, we first build a polynomial algorithm for inference and sampling of
zero-field Ising models over $K_{3,3}$-minor-free topologies and over
$K_{5}$-minor-free topologies -- both are extensions of the planar zero-field
Ising models -- which are neither genus - nor treewidth-bounded. Second, we
demonstrate empirically an improvement in the approximation quality of the
NP-hard problem of inference over the square-grid Ising model in a
node-dependent non-zero ""magnetic"" field.
","[{'version': 'v1', 'created': 'Tue, 22 Oct 2019 10:39:48 GMT'}]",2021-09-15,"[['Likhosherstov', 'Valerii', ''], ['Maximov', 'Yury', ''], ['Chertkov', 'Michael', '']]","['Graphical model', 'Ising model', 'partition function', 'statistical inference']"
12172,2204.04339,Jane Hsieh,"Jane Hsieh, Yili Hong, Gordon Burtch, Haiyi Zhu","A Little Too Personal: Effects of Standardization versus Personalization
  on Job Acquisition, Work Completion, and Revenue for Online Freelancers","CHI'22, April 29-May 5, 2022, New Orleans, LA, USA",,10.1145/3491102.3517546,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  As more individuals consider permanently working from home, the online labor
market continues to grow as an alternative working environment. While the
flexibility and autonomy of these online gigs attracts many workers, success
depends critically upon self-management and workers' efficient allocation of
scarce resources. To achieve this, freelancers may develop alternative work
strategies, employing highly standardized schedules and communication patterns
while taking on large work volumes, or engaging in smaller numbers of jobs
whilst tailoring their activities to build relationships with individual
employers. In this study, we consider this contrast in relation to worker
communication patterns. We demonstrate the heterogeneous effects of
standardization versus personalization across different stages of a project and
examine the relative impact on job acquisition, project completion, and
earnings. Our findings can inform the design of platforms and various worker
support tools for the gig economy.
","[{'version': 'v1', 'created': 'Sat, 9 Apr 2022 00:39:10 GMT'}]",2022-04-12,"[['Hsieh', 'Jane', ''], ['Hong', 'Yili', ''], ['Burtch', 'Gordon', ''], ['Zhu', 'Haiyi', '']]","['Online freelancing', 'digitally-mediated communication', 'online labormarkets', 'standardization', 'personalization']"
12173,2202.03057,Thomas Pierrot,"Thomas Pierrot, Guillaume Richard, Karim Beguir, Antoine Cully",Multi-Objective Quality Diversity Optimization,,,10.1145/3512290.3528823,,cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this work, we consider the problem of Quality-Diversity (QD) optimization
with multiple objectives. QD algorithms have been proposed to search for a
large collection of both diverse and high-performing solutions instead of a
single set of local optima. Thriving for diversity was shown to be useful in
many industrial and robotics applications. On the other hand, most real-life
problems exhibit several potentially antagonist objectives to be optimized.
Hence being able to optimize for multiple objectives with an appropriate
technique while thriving for diversity is important to many fields. Here, we
propose an extension of the MAP-Elites algorithm in the multi-objective
setting: Multi-Objective MAP-Elites (MOME). Namely, it combines the diversity
inherited from the MAP-Elites grid algorithm with the strength of
multi-objective optimizations by filling each cell with a Pareto Front. As
such, it allows to extract diverse solutions in the descriptor space while
exploring different compromises between objectives. We evaluate our method on
several tasks, from standard optimization problems to robotics simulations. Our
experimental evaluation shows the ability of MOME to provide diverse solutions
while providing global performances similar to standard multi-objective
algorithms.
","[{'version': 'v1', 'created': 'Mon, 7 Feb 2022 10:48:28 GMT'}, {'version': 'v2', 'created': 'Tue, 31 May 2022 08:06:59 GMT'}]",2022-06-01,"[['Pierrot', 'Thomas', ''], ['Richard', 'Guillaume', ''], ['Beguir', 'Karim', ''], ['Cully', 'Antoine', '']]","['Quality-Diversity', 'Multi-Objective Optimization', 'MAP-Elites']"
12174,2009.10576,Irene Y. Chen,"Irene Y. Chen, Emma Pierson, Sherri Rose, Shalmali Joshi, Kadija
  Ferryman, and Marzyeh Ghassemi",Ethical Machine Learning in Health Care,Annual Reviews in Biomedical Data Science 2021,,10.1146/annurev-biodatasci-092820-114757,,cs.CY cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The use of machine learning (ML) in health care raises numerous ethical
concerns, especially as models can amplify existing health inequities. Here, we
outline ethical considerations for equitable ML in the advancement of health
care. Specifically, we frame ethics of ML in health care through the lens of
social justice. We describe ongoing efforts and outline challenges in a
proposed pipeline of ethical ML in health, ranging from problem selection to
post-deployment considerations. We close by summarizing recommendations to
address these challenges.
","[{'version': 'v1', 'created': 'Tue, 22 Sep 2020 14:34:28 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Sep 2020 12:16:57 GMT'}, {'version': 'v3', 'created': 'Thu, 8 Oct 2020 03:26:31 GMT'}]",2021-07-29,"[['Chen', 'Irene Y.', ''], ['Pierson', 'Emma', ''], ['Rose', 'Sherri', ''], ['Joshi', 'Shalmali', ''], ['Ferryman', 'Kadija', ''], ['Ghassemi', 'Marzyeh', '']]","['machine learning', 'bias', 'ethics', 'health', 'health care', 'health disparities']"
12175,1910.14026,Federico Orsini,"Federico Orsini, Massimiliano Gastaldi, Luca Mantecchini, Riccardo
  Rossi","Neural networks trained with WiFi traces to predict airport passenger
  behavior","Post-print of paper presented at the 2019 6th International
  Conference on Models and Technologies for Intelligent Transportation Systems
  (MT-ITS)","2019 6th International Conference on Models and Technologies for
  Intelligent Transportation Systems (MT-ITS)",10.1109/MTITS.2019.8883365,,cs.LG eess.SP stat.AP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of neural networks to predict airport passenger activity choices
inside the terminal is presented in this paper. Three network architectures are
proposed: Feedforward Neural Networks (FNN), Long Short-Term Memory (LSTM)
networks, and a combination of the two. Inputs to these models are both static
(passenger and trip characteristics) and dynamic (real-time passenger
tracking). A real-world case study exemplifies the application of these models,
using anonymous WiFi traces collected at Bologna Airport to train the networks.
The performance of the models were evaluated according to the misclassification
rate of passenger activity choices. In the LSTM approach, two different
multi-step forecasting strategies are tested. According to our findings, the
direct LSTM approach provides better results than the FNN, especially when the
prediction horizon is relatively short (20 minutes or less).
","[{'version': 'v1', 'created': 'Wed, 30 Oct 2019 08:11:38 GMT'}]",2019-11-01,"[['Orsini', 'Federico', ''], ['Gastaldi', 'Massimiliano', ''], ['Mantecchini', 'Luca', ''], ['Rossi', 'Riccardo', '']]","['airport passenger', 'machine learning', 'deep']"
12176,1904.09405,Qingqing Wang,"Qingqing Wang, Wenjing Jia, Xiangjian He, Yue Lu, Michael Blumenstein,
  Ye Huang",FACLSTM: ConvLSTM with Focused Attention for Scene Text Recognition,Accepted by Science China Information Science,,10.1007/s11432-019-2713-1,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scene text recognition has recently been widely treated as a
sequence-to-sequence prediction problem, where traditional fully-connected-LSTM
(FC-LSTM) has played a critical role. Due to the limitation of FC-LSTM,
existing methods have to convert 2-D feature maps into 1-D sequential feature
vectors, resulting in severe damages of the valuable spatial and structural
information of text images. In this paper, we argue that scene text recognition
is essentially a spatiotemporal prediction problem for its 2-D image inputs,
and propose a convolution LSTM (ConvLSTM)-based scene text recognizer, namely,
FACLSTM, i.e., Focused Attention ConvLSTM, where the spatial correlation of
pixels is fully leveraged when performing sequential prediction with LSTM.
Particularly, the attention mechanism is properly incorporated into an
efficient ConvLSTM structure via the convolutional operations and additional
character center masks are generated to help focus attention on right feature
areas. The experimental results on benchmark datasets IIIT5K, SVT and CUTE
demonstrate that our proposed FACLSTM performs competitively on the regular,
low-resolution and noisy text images, and outperforms the state-of-the-art
approaches on the curved text with large margins.
","[{'version': 'v1', 'created': 'Sat, 20 Apr 2019 05:44:37 GMT'}, {'version': 'v2', 'created': 'Sun, 5 Jan 2020 06:59:13 GMT'}]",2020-01-07,"[['Wang', 'Qingqing', ''], ['Jia', 'Wenjing', ''], ['He', 'Xiangjian', ''], ['Lu', 'Yue', ''], ['Blumenstein', 'Michael', ''], ['Huang', 'Ye', '']]","['Scene text recognition', 'convolutional LSTM', 'focused attention', 'spatial correlation', 'sequentialprediction']"
12177,1410.7252,Abhimanyu Sarin Mr.,"Abhimanyu Sarin, Dr. Jagadish Nayak",Iris Biometric System using a hybrid approach,"11 pages, 11 pictures, Computer Science & Information Technology-CSCP
  2014",,10.5121/csit.2014.4914,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Iris Recognition Systems are ocular- based biometric devices used primarily
for security reasons. The complexity and the randomness of the Iris, amongst
various other factors, ensure that this biometric system is inarguably an exact
and reliable method of identification. The algorithm is responsible for
automatic localization and segmentation of boundaries using circular Hough
Transform, noise reductions, image enhancement and feature extraction across
numerous distinct images present in the database. This paper delves into the
various kinds of techniques required to approximate the pupillary and limbic
boundaries of the enrolled iris image, captured using a suitable image
acquisition device and perform feature extraction on the normalized iris image
with the help of Haar Wavelets to encode the input data into a binary string
format. These techniques were validated using images from the CASIA database,
and various other procedures were also tried and tested.
","[{'version': 'v1', 'created': 'Mon, 27 Oct 2014 14:28:59 GMT'}]",2014-10-28,"[['Sarin', 'Abhimanyu', ''], ['Nayak', 'Dr. Jagadish', '']]","['Iris Biometrics', 'Hough Transform', 'Daugman’s Algorithm', 'Localization', 'Haar Wavelets']"
12178,2012.07949,Fabian Ritz,"Fabian Ritz, Thomy Phan, Robert M\""uller, Thomas Gabor, Andreas
  Sedlmeier, Marc Zeller, Jan Wieghardt, Reiner Schmid, Horst Sauer, Cornel
  Klein, Claudia Linnhoff-Popien","SAT-MARL: Specification Aware Training in Multi-Agent Reinforcement
  Learning","9 pages, 5 figures; accepted as a full paper at ICAART 2021
  (http://www.icaart.org/)","Proceedings of the 13th International Conference on Agents and
  Artificial Intelligence - Volume 1: ICAART, 28-37, 2021",10.5220/0010189500280037,,cs.LG cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A characteristic of reinforcement learning is the ability to develop
unforeseen strategies when solving problems. While such strategies sometimes
yield superior performance, they may also result in undesired or even dangerous
behavior. In industrial scenarios, a system's behavior also needs to be
predictable and lie within defined ranges. To enable the agents to learn (how)
to align with a given specification, this paper proposes to explicitly transfer
functional and non-functional requirements into shaped rewards. Experiments are
carried out on the smart factory, a multi-agent environment modeling an
industrial lot-size-one production facility, with up to eight agents and
different multi-agent reinforcement learning algorithms. Results indicate that
compliance with functional and non-functional constraints can be achieved by
the proposed approach.
","[{'version': 'v1', 'created': 'Mon, 14 Dec 2020 21:33:16 GMT'}]",2021-04-12,"[['Ritz', 'Fabian', ''], ['Phan', 'Thomy', ''], ['Müller', 'Robert', ''], ['Gabor', 'Thomas', ''], ['Sedlmeier', 'Andreas', ''], ['Zeller', 'Marc', ''], ['Wieghardt', 'Jan', ''], ['Schmid', 'Reiner', ''], ['Sauer', 'Horst', ''], ['Klein', 'Cornel', ''], ['Linnhoff-Popien', 'Claudia', '']]","['Multi-Agent', 'Reinforcement Learning', 'Specification Compliance', 'AI Safety']"
12179,1812.08253,Houda Kriouile,Houda Kriouile and Bouchra El Asri,A Rich-Variant Architecture for a User-Aware multi-tenant SaaS approach,"8 pages, 5 figures","IJCSI International Journal of Computer Science Issues, Volume 15,
  Issue 4, July 2018",10.5281/zenodo.1346047,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software as a Service cloud computing model favorites the Multi-Tenancy as a
key factor to exploit economies of scale. However Multi-Tenancy present several
disadvantages. Therein, our approach comes to assign instances to multi-tenants
with an optimal solution while ensuring more economies of scale and avoiding
tenants hesitation to share resources. The present paper present the
architecture of our user-aware multi-tenancy SaaS approach based on the use of
rich-variant components. The proposed approach seek to model services
functional customization as well as automation of computing the optimal
distribution of instances by tenants. The proposed model takes into
consideration tenants functional requirements and tenants deployment
requirements to deduce an optimal distribution using essentially a specific
variability engine and a graph-based execution framework.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2018 21:30:56 GMT'}]",2018-12-21,"[['Kriouile', 'Houda', ''], ['Asri', 'Bouchra El', '']]","['Cloud Computing', 'SaaS', 'Multi-Tenancy', 'RichVariant Component', 'Rich-Variant Architecture']"
12180,2104.12537,Ciaran Eising,"Markus Heimberger, Jonathan Horgan, Ciaran Hughes, John McDonald,
  Senthil Yogamani","Computer vision in automated parking systems: Design, implementation and
  challenges",,"Image and Vision Computing, Volume 68, December 2017, Pages 88-101",10.1016/j.imavis.2017.07.002,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Automated driving is an active area of research in both industry and
academia. Automated Parking, which is automated driving in a restricted
scenario of parking with low speed manoeuvring, is a key enabling product for
fully autonomous driving systems. It is also an important milestone from the
perspective of a higher end system built from the previous generation driver
assistance systems comprising of collision warning, pedestrian detection, etc.
In this paper, we discuss the design and implementation of an automated parking
system from the perspective of computer vision algorithms. Designing a low-cost
system with functional safety is challenging and leads to a large gap between
the prototype and the end product, in order to handle all the corner cases. We
demonstrate how camera systems are crucial for addressing a range of automated
parking use cases and also, to add robustness to systems based on active
distance measuring sensors, such as ultrasonics and radar. The key vision
modules which realize the parking use cases are 3D reconstruction, parking slot
marking recognition, freespace and vehicle/pedestrian detection. We detail the
important parking use cases and demonstrate how to combine the vision modules
to form a robust parking system. To the best of the authors' knowledge, this is
the first detailed discussion of a systemic view of a commercial automated
parking system.
","[{'version': 'v1', 'created': 'Mon, 26 Apr 2021 13:18:02 GMT'}]",2021-04-27,"[['Heimberger', 'Markus', ''], ['Horgan', 'Jonathan', ''], ['Hughes', 'Ciaran', ''], ['McDonald', 'John', ''], ['Yogamani', 'Senthil', '']]","['Automated Parking', 'Automotive Vision', 'Autonomous Driving', 'ADAS', 'Machine Learning', 'Computer Vision', 'Embedded Vision', 'Safety critical systems']"
12181,2109.03710,Gueltoum Bendiab,"Christopher Braker, Stavros Shiaeles, Gueltoum Bendiab, Nick Savage,
  Konstantinos Limniotis",BotSpot: Deep Learning Classification of Bot Accounts within Twitter,"7 pages, 3 figures, 2 tables","NEW2AN 2020, ruSMART 2020: Internet of Things, Smart Spaces, and
  Next Generation Networks and Systems pp 165-175",10.1007/978-3-030-65726-0_16,,cs.CR cs.AI cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The openness feature of Twitter allows programs to generate and control
Twitter accounts automatically via the Twitter API. These accounts, which are
known as bots, can automatically perform actions such as tweeting, re-tweeting,
following, unfollowing, or direct messaging other accounts, just like real
people. They can also conduct malicious tasks such as spreading of fake news,
spams, malicious software and other cyber-crimes. In this paper, we introduce a
novel bot detection approach using deep learning, with the Multi-layer
Perceptron Neural Networks and nine features of a bot account. A web crawler is
developed to automatically collect data from public Twitter accounts and build
the testing and training datasets, with 860 samples of human and bot accounts.
After the initial training is done, the Multilayer Perceptron Neural Networks
achieved an overall accuracy rate of 92%, which proves the performance of the
proposed approach.
","[{'version': 'v1', 'created': 'Wed, 8 Sep 2021 15:17:10 GMT'}]",2021-09-09,"[['Braker', 'Christopher', ''], ['Shiaeles', 'Stavros', ''], ['Bendiab', 'Gueltoum', ''], ['Savage', 'Nick', ''], ['Limniotis', 'Konstantinos', '']]","['Bot accounts', 'Malware', 'Machine Learning', 'Spam bots', 'Security']"
12182,2208.09235,Alexander Hepp,Alexander Hepp and Tiago Perez and Samuel Pagliarini and Georg Sigl,"A Pragmatic Methodology for Blind Hardware Trojan Insertion in Finalized
  Layouts","9 pages, 6 figures, 3 tables, to be published in ICCAD 2022",,10.1145/3508352.3549452,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A potential vulnerability for integrated circuits (ICs) is the insertion of
hardware trojans (HTs) during manufacturing. Understanding the practicability
of such an attack can lead to appropriate measures for mitigating it. In this
paper, we demonstrate a pragmatic framework for analyzing HT susceptibility of
finalized layouts. Our framework is representative of a fabrication-time
attack, where the adversary is assumed to have access only to a layout
representation of the circuit. The framework inserts trojans into tapeout-ready
layouts utilizing an Engineering Change Order (ECO) flow. The attacked security
nodes are blindly searched utilizing reverse-engineering techniques. For our
experimental investigation, we utilized three crypto-cores (AES-128, SHA-256,
and RSA) and a microcontroller (RISC-V) as targets. We explored 96 combinations
of triggers, payloads and targets for our framework. Our findings demonstrate
that even in high-density designs, the covert insertion of sophisticated
trojans is possible. All this while maintaining the original target logic, with
minimal impact on power and performance. Furthermore, from our exploration, we
conclude that it is too naive to only utilize placement resources as a metric
for HT vulnerability. This work highlights that the HT insertion success is a
complex function of the placement, routing resources, the position of the
attacked nodes, and further design-specific characteristics. As a result, our
framework goes beyond just an attack, we present the most advanced analysis
tool to assess the vulnerability of HT insertion into finalized layouts.
","[{'version': 'v1', 'created': 'Fri, 19 Aug 2022 09:22:00 GMT'}]",2022-08-22,"[['Hepp', 'Alexander', ''], ['Perez', 'Tiago', ''], ['Pagliarini', 'Samuel', ''], ['Sigl', 'Georg', '']]","['hardware security', 'reverse engineering', 'manufacturing-time attack', 'hardware trojan horse', 'VLSI', 'ASIC']"
12183,2006.06356,Suzanne Wetstein,"Gerda Bortsova, Cristina Gonz\'alez-Gonzalo, Suzanne C. Wetstein,
  Florian Dubost, Ioannis Katramados, Laurens Hogeweg, Bart Liefers, Bram van
  Ginneken, Josien P.W. Pluim, Mitko Veta, Clara I. S\'anchez, and Marleen de
  Bruijne","Adversarial Attack Vulnerability of Medical Image Analysis Systems:
  Unexplored Factors",First three authors contributed equally,Medical Image Analysis. Available online 18 Jun 2021,10.1016/j.media.2021.102141,,cs.CR cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Adversarial attacks are considered a potentially serious security threat for
machine learning systems. Medical image analysis (MedIA) systems have recently
been argued to be vulnerable to adversarial attacks due to strong financial
incentives and the associated technological infrastructure.
  In this paper, we study previously unexplored factors affecting adversarial
attack vulnerability of deep learning MedIA systems in three medical domains:
ophthalmology, radiology, and pathology. We focus on adversarial black-box
settings, in which the attacker does not have full access to the target model
and usually uses another model, commonly referred to as surrogate model, to
craft adversarial examples. We consider this to be the most realistic scenario
for MedIA systems.
  Firstly, we study the effect of weight initialization (ImageNet vs. random)
on the transferability of adversarial attacks from the surrogate model to the
target model. Secondly, we study the influence of differences in development
data between target and surrogate models. We further study the interaction of
weight initialization and data differences with differences in model
architecture. All experiments were done with a perturbation degree tuned to
ensure maximal transferability at minimal visual perceptibility of the attacks.
  Our experiments show that pre-training may dramatically increase the
transferability of adversarial examples, even when the target and surrogate's
architectures are different: the larger the performance gain using
pre-training, the larger the transferability. Differences in the development
data between target and surrogate models considerably decrease the performance
of the attack; this decrease is further amplified by difference in the model
architecture. We believe these factors should be considered when developing
security-critical MedIA systems planned to be deployed in clinical practice.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2020 12:19:39 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Jun 2020 08:36:29 GMT'}, {'version': 'v3', 'created': 'Thu, 17 Jun 2021 12:50:56 GMT'}]",2021-06-23,"[['Bortsova', 'Gerda', ''], ['González-Gonzalo', 'Cristina', ''], ['Wetstein', 'Suzanne C.', ''], ['Dubost', 'Florian', ''], ['Katramados', 'Ioannis', ''], ['Hogeweg', 'Laurens', ''], ['Liefers', 'Bart', ''], ['van Ginneken', 'Bram', ''], ['Pluim', 'Josien P. W.', ''], ['Veta', 'Mitko', ''], ['Sánchez', 'Clara I.', ''], ['de Bruijne', 'Marleen', '']]","['Adversarial Attacks', 'MedicalImaging', 'Deep Learning', 'Cybersecurity']"
12184,1905.08900,Shibo Yao,"Shibo Yao, Dantong Yu, Keli Xiao",Enhancing Domain Word Embedding via Latent Semantic Imputation,ACM SIGKDD 2019,,10.1145/3292500.3330926,,cs.LG cs.IR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a novel method named Latent Semantic Imputation (LSI) to transfer
external knowledge into semantic space for enhancing word embedding. The method
integrates graph theory to extract the latent manifold structure of the
entities in the affinity space and leverages non-negative least squares with
standard simplex constraints and power iteration method to derive spectral
embeddings. It provides an effective and efficient approach to combining entity
representations defined in different Euclidean spaces. Specifically, our
approach generates and imputes reliable embedding vectors for low-frequency
words in the semantic space and benefits downstream language tasks that depend
on word embedding. We conduct comprehensive experiments on a carefully designed
classification problem and language modeling and demonstrate the superiority of
the enhanced embedding via LSI over several well-known benchmark embeddings. We
also confirm the consistency of the results under different parameter settings
of our method.
","[{'version': 'v1', 'created': 'Tue, 21 May 2019 23:31:45 GMT'}]",2019-05-23,"[['Yao', 'Shibo', ''], ['Yu', 'Dantong', ''], ['Xiao', 'Keli', '']]","['representation learning', 'graph', 'manifold learning', 'spectral methods']"
12185,2208.11170,Yuhang Zhao,"Kexin Zhang, Elmira Deldari, Zhicong Lu, Yaxing Yao, Yuhang Zhao","""It's Just Part of Me:"" Understanding Avatar Diversity and
  Self-presentation of People with Disabilities in Social Virtual Reality","The 24th International ACM SIGACCESS Conference on Computers and
  Accessibility (ASSETS '22), 16 pages, 4 figures",,10.1145/3517428.3544829,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  In social Virtual Reality (VR), users are embodied in avatars and interact
with other users in a face-to-face manner using avatars as the medium. With the
advent of social VR, people with disabilities (PWD) have shown an increasing
presence on this new social media. With their unique disability identity, it is
not clear how PWD perceive their avatars and whether and how they prefer to
disclose their disability when presenting themselves in social VR. We fill this
gap by exploring PWD's avatar perception and disability disclosure preferences
in social VR. Our study involved two steps. We first conducted a systematic
review of fifteen popular social VR applications to evaluate their avatar
diversity and accessibility support. We then conducted an in-depth interview
study with 19 participants who had different disabilities to understand their
avatar experiences. Our research revealed a number of disability disclosure
preferences and strategies adopted by PWD (e.g., reflect selective
disabilities, present a capable self). We also identified several challenges
faced by PWD during their avatar customization process. We discuss the design
implications to promote avatar accessibility and diversity for future social VR
platforms.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2022 19:56:26 GMT'}]",2022-08-25,"[['Zhang', 'Kexin', ''], ['Deldari', 'Elmira', ''], ['Lu', 'Zhicong', ''], ['Yao', 'Yaxing', ''], ['Zhao', 'Yuhang', '']]","['Social VR', 'avatar', 'self-perception', 'disability disclosure', 'visual impairments', 'd/Deaf and heard of hearing']"
12186,2202.05048,Jemin Lee,"Jemin Lee, Misun Yu, Yongin Kwon, Taeho Kim","Quantune: Post-training Quantization of Convolutional Neural Networks
  using Extreme Gradient Boosting for Fast Deployment","13 page, 9 figures, Accepted in Future Generation Computer Systems",,10.1016/j.future.2022.02.005,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To adopt convolutional neural networks (CNN) for a range of
resource-constrained targets, it is necessary to compress the CNN models by
performing quantization, whereby precision representation is converted to a
lower bit representation. To overcome problems such as sensitivity of the
training dataset, high computational requirements, and large time consumption,
post-training quantization methods that do not require retraining have been
proposed. In addition, to compensate for the accuracy drop without retraining,
previous studies on post-training quantization have proposed several
complementary methods: calibration, schemes, clipping, granularity, and
mixed-precision. To generate a quantized model with minimal error, it is
necessary to study all possible combinations of the methods because each of
them is complementary and the CNN models have different characteristics.
However, an exhaustive or a heuristic search is either too time-consuming or
suboptimal. To overcome this challenge, we propose an auto-tuner known as
Quantune, which builds a gradient tree boosting model to accelerate the search
for the configurations of quantization and reduce the quantization error. We
evaluate and compare Quantune with the random, grid, and genetic algorithms.
The experimental results show that Quantune reduces the search time for
quantization by approximately 36.5x with an accuracy loss of 0.07 ~ 0.65%
across six CNN models, including the fragile ones (MobileNet, SqueezeNet, and
ShuffleNet). To support multiple targets and adopt continuously evolving
quantization works, Quantune is implemented on a full-fledged compiler for deep
learning as an open-sourced project.
","[{'version': 'v1', 'created': 'Thu, 10 Feb 2022 14:05:02 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Feb 2022 01:44:01 GMT'}]",2022-02-22,"[['Lee', 'Jemin', ''], ['Yu', 'Misun', ''], ['Kwon', 'Yongin', ''], ['Kim', 'Taeho', '']]","['Quantization', 'neural networks', 'model compression', 'deep learning compiler']"
12187,1910.11110,Ludovic Henrio,"Ludovic Henrio (CASH), Christoph Kessler (LIU), Lu Li (LIU)","Leveraging access mode declarations in a model for memory consistency in
  heterogeneous systems",,"Journal of Logical and Algebraic Methods in Programming, Elsevier,
  2020, 110, pp.100498",10.1016/j.jlamp.2019.100498,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  On a system that exposes disjoint memory spaces to the software, a program
has to address memory consistency issues and perform data transfers so that it
always accesses valid data. Several approaches exist to ensure the consistency
of the memory accessed. Here we are interested in the verification of a
declarative approach where each component of a computation is annotated with an
access mode declaring which part of the memory is read or written by the
component. The programming framework uses the component annotations to
guarantee the validity of the memory accesses. This is the mechanism used in
VectorPU, a C++ library for programming CPU-GPU heterogeneous systems. This
article proves the correctness of the software cache-coherence mechanism used
in VectorPU. Beyond the scope of VectorPU, this article provides a simple and
effective formalisation of memory consistency mechanisms based on the explicit
declaration of the effect of each component on each memory space. The formalism
we propose also takes into account arrays for which a single validity status is
stored for the whole array; additional mechanisms for dealing with overlapping
arrays are also studied.
","[{'version': 'v1', 'created': 'Thu, 24 Oct 2019 13:49:15 GMT'}]",2019-10-25,"[['Henrio', 'Ludovic', '', 'CASH'], ['Kessler', 'Christoph', '', 'LIU'], ['Li', 'Lu', '', 'LIU']]","['Memory consistency', 'CPU-GPU heterogeneous systems', 'datatransfer', 'software caching', 'cache coherence']"
12188,2002.04525,William Derigent,"William Derigent (CRAN), Olivier Cardin (PSI), Damien Trentesaux
  (LAMIH)","Industry 4.0: contributions of holonic manufacturing control
  architectures and future challenges","Journal of Intelligent Manufacturing, Springer Verlag (Germany), 2020",,10.1007/s10845-020-01532-x,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The flexibility claimed by the next generation production systems induces a
deep modification of the behaviour and the core itself of the control systems.
Over-connectivity and data management abilities targeted by Industry 4.0
paradigm enable the emergence of more flexible and reactive control systems,
based on the cooperation of autonomous and connected entities in the
decision-making process. From most relevant articles extracted from existing
literature, a list of 10 key enablers for Industry 4.0 is first presented.
During the last 20 years, the holonic paradigm has become a major paradigm of
Intelligent Manufacturing Systems. After the presentation of the holonic
paradigm and holon properties, this article highlights how historical and
current holonic control architectures can partly fulfil I4.0 key enablers. The
remaining unfulfilled key enablers are then the subject of an extensive
discussion on the remaining research perspectives on holonic architectures
needed to achieve a complete support of Industry4.0.
","[{'version': 'v1', 'created': 'Tue, 28 Jan 2020 15:39:39 GMT'}]",2020-02-12,"[['Derigent', 'William', '', 'CRAN'], ['Cardin', 'Olivier', '', 'PSI'], ['Trentesaux', 'Damien', '', 'LAMIH']]","['Manufacturing systems', 'Holonic manufacturing systems', 'Holonic Control Architecture', 'Industry 4.0']"
12189,2210.09572,Hu Chao,"Chao Hu, Weibin Qiu, Weijie Wu and Liqiang Zhu",Spatio-Temporal-based Context Fusion for Video Anomaly Detection,,Machine Intelligence Research 2022,10.1016/S0550-3213(01)00405-9,MIR-2022-09-302,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video anomaly detection aims to discover abnormal events in videos, and the
principal objects are target objects such as people and vehicles. Each target
in the video data has rich spatio-temporal context information. Most existing
methods only focus on the temporal context, ignoring the role of the spatial
context in anomaly detection. The spatial context information represents the
relationship between the detection target and surrounding targets. Anomaly
detection makes a lot of sense. To this end, a video anomaly detection
algorithm based on target spatio-temporal context fusion is proposed. Firstly,
the target in the video frame is extracted through the target detection network
to reduce background interference. Then the optical flow map of two adjacent
frames is calculated. Motion features are used multiple targets in the video
frame to construct spatial context simultaneously, re-encoding the target
appearance and motion features, and finally reconstructing the above features
through the spatio-temporal dual-stream network, and using the reconstruction
error to represent the abnormal score. The algorithm achieves frame-level AUCs
of 98.5% and 86.3% on the UCSDped2 and Avenue datasets, respectively. On the
UCSDped2 dataset, the spatio-temporal dual-stream network improves frames by
5.1% and 0.3%, respectively, compared to the temporal and spatial stream
networks. After using spatial context encoding, the frame-level AUC is enhanced
by 1%, which verifies the method's effectiveness.
","[{'version': 'v1', 'created': 'Tue, 18 Oct 2022 04:07:10 GMT'}]",2022-11-23,"[['Hu', 'Chao', ''], ['Qiu', 'Weibin', ''], ['Wu', 'Weijie', ''], ['Zhu', 'Liqiang', '']]","['Anomaly Detection', 'context fusion', 'optical flow', 'spatial context', 'temporal context', 'dual-stream network']"
12190,2004.11093,Mohammed Belkhatir,"Bhawani Selvaretnam, Mohammed Belkhatir","Natural language technology and query expansion: issues,
  state-of-the-art and perspectives",,J Intell Inf Syst 2012,10.1007/s10844-011-0174-3,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The availability of an abundance of knowledge sources has spurred a large
amount of effort in the development and enhancement of Information Retrieval
techniques. Users information needs are expressed in natural language and
successful retrieval is very much dependent on the effective communication of
the intended purpose. Natural language queries consist of multiple linguistic
features which serve to represent the intended search goal. Linguistic
characteristics that cause semantic ambiguity and misinterpretation of queries
as well as additional factors such as the lack of familiarity with the search
environment affect the users ability to accurately represent their information
needs, coined by the concept intention gap. The latter directly affects the
relevance of the returned search results which may not be to the users
satisfaction and therefore is a major issue impacting the effectiveness of
information retrieval systems. Central to our discussion is the identification
of the significant constituents that characterize the query intent and their
enrichment through the addition of meaningful terms, phrases or even latent
representations, either manually or automatically to capture their intended
meaning. Specifically, we discuss techniques to achieve the enrichment and in
particular those utilizing the information gathered from statistical processing
of term dependencies within a document corpus or from external knowledge
sources such as ontologies. We lay down the anatomy of a generic linguistic
based query expansion framework and propose its module-based decomposition,
covering topical issues from query processing, information retrieval,
computational linguistics and ontology engineering. For each of the modules we
review state-of-the-art solutions in the literature categorized and analyzed
under the light of the techniques used.
","[{'version': 'v1', 'created': 'Thu, 23 Apr 2020 11:39:07 GMT'}]",2020-04-24,"[['Selvaretnam', 'Bhawani', ''], ['Belkhatir', 'Mohammed', '']]","['query expansion systems', 'linguistic analysis', 'term dependency', 'knowledge based processing']"
12191,2002.04760,Michele Tufano,"Michele Tufano, Jason Kimko, Shiya Wang, Cody Watson, Gabriele Bavota,
  Massimiliano Di Penta, Denys Poshyvanyk",DeepMutation: A Neural Mutation Tool,"Accepted to the 42nd ACM/IEEE International Conference on Software
  Engineering (ICSE 2020), Demonstrations Track - Seoul, South Korea, May
  23-29, 2020, 4 pages",,10.1145/3377812.3382146,,cs.SE cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mutation testing can be used to assess the fault-detection capabilities of a
given test suite. To this aim, two characteristics of mutation testing
frameworks are of paramount importance: (i) they should generate mutants that
are representative of real faults; and (ii) they should provide a complete tool
chain able to automatically generate, inject, and test the mutants. To address
the first point, we recently proposed an approach using a Recurrent Neural
Network Encoder-Decoder architecture to learn mutants from ~787k faults mined
from real programs. The empirical evaluation of this approach confirmed its
ability to generate mutants representative of real faults. In this paper, we
address the second point, presenting DeepMutation, a tool wrapping our deep
learning model into a fully automated tool chain able to generate, inject, and
test mutants learned from real faults. Video:
https://sites.google.com/view/learning-mutation/deepmutation
","[{'version': 'v1', 'created': 'Wed, 12 Feb 2020 01:57:41 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Feb 2020 01:32:42 GMT'}]",2020-02-14,"[['Tufano', 'Michele', ''], ['Kimko', 'Jason', ''], ['Wang', 'Shiya', ''], ['Watson', 'Cody', ''], ['Bavota', 'Gabriele', ''], ['Di Penta', 'Massimiliano', ''], ['Poshyvanyk', 'Denys', '']]","['software testing', 'mutation testing', 'neural networks']"
12192,2201.06523,Subasish Das,"Xiaoqiang Kong, Subasish Das, Hongmin Zhou, Yunlong Zhang","Patterns of near-crash events in a naturalistic driving dataset:
  applying rules mining",,Accident Analysis & Prevention (2021),10.1016/j.aap.2021.106346,,cs.LG cs.AI cs.DB cs.IR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This study aims to explore the associations between near-crash events and
road geometry and trip features by investigating a naturalistic driving dataset
and a corresponding roadway inventory dataset using an association rule mining
method.
","[{'version': 'v1', 'created': 'Mon, 17 Jan 2022 16:57:53 GMT'}]",2022-01-21,"[['Kong', 'Xiaoqiang', ''], ['Das', 'Subasish', ''], ['Zhou', 'Hongmin', ''], ['Zhang', 'Yunlong', '']]","['naturalistic driving data', 'near-crash', 'association rule', 'geometric feature', 'SPMD', 'HPMS']"
12193,1401.6267,Harun Rasit Er M.S.,"Harun Rasit Er, Nadia Erdogan","Parallel Genetic Algorithm to Solve Traveling Salesman Problem on
  MapReduce Framework using Hadoop Cluster","The International Journal of Soft Computing and Software Engineering
  [JSCSE], Vol. 3, No. 3, Special Issue. The Proceeding of International
  Conference on Soft Computing and Software Engineering 2013",,10.7321/jscse.v3.n3.57,e-ISSN: 2251-7545,cs.DC cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traveling Salesman Problem (TSP) is one of the most common studied problems
in combinatorial optimization. Given the list of cities and distances between
them, the problem is to find the shortest tour possible which visits all the
cities in list exactly once and ends in the city where it starts. Despite the
Traveling Salesman Problem is NP-Hard, a lot of methods and solutions are
proposed to the problem. One of them is Genetic Algorithm (GA). GA is a simple
but an efficient heuristic method that can be used to solve Traveling Salesman
Problem. In this paper, we will show a parallel genetic algorithm
implementation on MapReduce framework in order to solve Traveling Salesman
Problem. MapReduce is a framework used to support distributed computation on
clusters of computers. We used free licensed Hadoop implementation as MapReduce
framework.
","[{'version': 'v1', 'created': 'Fri, 24 Jan 2014 06:59:08 GMT'}]",2014-01-27,"[['Er', 'Harun Rasit', ''], ['Erdogan', 'Nadia', '']]","['Hadoop', 'MapReduce', 'Traveling Salesman']"
12194,1707.02327,Marco Tulio Valente,"Jailton Coelho, Marco Tulio Valente",Why Modern Open Source Projects Fail,"Paper accepted at 25th International Symposium on the Foundations of
  Software Engineering (FSE), pages 1-11, 2017",,10.1145/3106237.3106246,,cs.SE cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Open source is experiencing a renaissance period, due to the appearance of
modern platforms and workflows for developing and maintaining public code. As a
result, developers are creating open source software at speeds never seen
before. Consequently, these projects are also facing unprecedented mortality
rates. To better understand the reasons for the failure of modern open source
projects, this paper describes the results of a survey with the maintainers of
104 popular GitHub systems that have been deprecated. We provide a set of nine
reasons for the failure of these open source projects. We also show that some
maintenance practices -- specifically the adoption of contributing guidelines
and continuous integration -- have an important association with a project
failure or success. Finally, we discuss and reveal the principal strategies
developers have tried to overcome the failure of the studied projects.
","[{'version': 'v1', 'created': 'Fri, 7 Jul 2017 18:33:29 GMT'}]",2018-08-07,"[['Coelho', 'Jailton', ''], ['Valente', 'Marco Tulio', '']]","['Project failure', 'GitHub', 'Open Source Software']"
12195,2010.05027,Jun Wang,"Jun Wang, Qianying Liu, Haotian Xie, Zhaogang Yang, Hefeng Zhou","Boosted EfficientNet: Detection of Lymph Node Metastases in Breast
  Cancer Using Convolutional Neural Network","17 pages, 7 figures, 2 tables, journal",,10.3390/cancers13040661,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, advances in the development of whole-slide images have laid
a foundation for the utilization of digital images in pathology. With the
assistance of computer images analysis that automatically identifies tissue or
cell types, they have greatly improved the histopathologic interpretation and
diagnosis accuracy. In this paper, the Convolutional Neutral Network (CNN) has
been adapted to predict and classify lymph node metastasis in breast cancer.
Unlike traditional image cropping methods that are only suitable for large
resolution images, we propose a novel data augmentation method named Random
Center Cropping (RCC) to facilitate small resolution images. RCC enriches the
datasets while retaining the image resolution and the center area of images. In
addition, we reduce the downsampling scale of the network to further facilitate
small resolution images better. Moreover, Attention and Feature Fusion (FF)
mechanisms are employed to improve the semantic information of images.
Experiments demonstrate that our methods boost performances of basic CNN
architectures. And the best-performed method achieves an accuracy of 97.96% and
an AUC of 99.68% on RPCam datasets, respectively.
","[{'version': 'v1', 'created': 'Sat, 10 Oct 2020 15:18:56 GMT'}]",2021-02-09,"[['Wang', 'Jun', ''], ['Liu', 'Qianying', ''], ['Xie', 'Haotian', ''], ['Yang', 'Zhaogang', ''], ['Zhou', 'Hefeng', '']]","['Diagnosis', 'Metastatic Breast Cancer', 'CNN', 'Image Classification', 'Cropping', 'Attention', 'Feature Fusion']"
12196,2007.09134,Ganga Prasad Basyal,"Ganga Prasad Basyal, Bhaskar P. Rimal, and David Zeng","A Systematic Review of Natural Language Processing for Knowledge
  Management in Healthcare",,,10.5121/csit.2020.100921,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Driven by the visions of Data Science, recent years have seen a paradigm
shift in Natural Language Processing (NLP). NLP has set the milestone in text
processing and proved to be the preferred choice for researchers in the
healthcare domain. The objective of this paper is to identify the potential of
NLP, especially, how NLP is used to support the knowledge management process in
the healthcare domain, making data a critical and trusted component in
improving the health outcomes. This paper provides a comprehensive survey of
the state-of-the-art NLP research with a particular focus on how knowledge is
created, captured, shared, and applied in the healthcare domain. Our findings
suggest, first, the techniques of NLP those supporting knowledge management
extraction and knowledge capture processes in healthcare. Second, we propose a
conceptual model for the knowledge extraction process through NLP. Finally, we
discuss a set of issues, challenges, and proposed future research areas.
","[{'version': 'v1', 'created': 'Fri, 17 Jul 2020 17:50:50 GMT'}]",2020-07-20,"[['Basyal', 'Ganga Prasad', ''], ['Rimal', 'Bhaskar P.', ''], ['Zeng', 'David', '']]","['Knowledge Management', 'Natural Language Processing', 'Knowledge Extraction', 'Knowledge Capture']"
12197,1709.00412,Gregory Tsipenyuk,"Gregory Tsipenyuk, Jon Crowcroft","My Home is My Post-Office: Evaluation of a decentralized email
  architecture on Internet-of-Things low-end device","9 pages, 15 figures, 1 table, ICC'17, Cambridge, UK",,10.1145/3018896.3018918,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Users predominantly access their email via mobile devices. This presents a
two-fold challenge to the email applications. First, email's update from
multiple devices has to be eventually reconciled with the server.
Prioritization of updates is difficult and maybe undesirable. Solving this
problem requires a data store with the complete history of email changes.
Second, legacy email protocols don't provide an optimal email synchronization
and access in mobile environment. In this paper we are proposing to take
advantage of the Internet of Things (IoT) phenomena. In IoT environment a user
may have multiple interconnected in-home low-end devices with publicly
accessible address. In this architecture we move the email application from the
central service into user's in-home and mobile devices, store complete email
history on each device, and replace legacy IMAP and SMTP protocols with a
synchronization protocol found in Distributed Version Control Systems(DVCS).
This addresses the email reconciliation issue, optimizes the bandwidth usage,
and intrinsically puts the user in control of her data. We analyze a number of
stores and synchronization implementations and compare them with the open
source Dovecot email server.
","[{'version': 'v1', 'created': 'Fri, 1 Sep 2017 16:03:54 GMT'}]",2017-09-05,"[['Tsipenyuk', 'Gregory', ''], ['Crowcroft', 'Jon', '']]","['Internet-of-things', 'eventual consistency', 'revision control', 'decentralization', 'email']"
12198,1906.02796,Wilkie Olin-Ammentorp,"Wilkie Olin-Ammentorp, Karsten Beckmann, Catherine D. Schuman, James
  S. Plank, Nathaniel C. Cady",Stochasticity and Robustness in Spiking Neural Networks,,,10.1016/j.neucom.2020.07.105,,cs.NE q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Artificial neural networks normally require precise weights to operate,
despite their origins in biological systems, which can be highly variable and
noisy. When implementing artificial networks which utilize analog 'synaptic'
devices to encode weights, however, inherent limits are placed on the accuracy
and precision with which these values can be encoded. In this work, we
investigate the effects that inaccurate synapses have on spiking neurons and
spiking neural networks. Starting with a mathematical analysis of
integrate-and-fire (IF) neurons, including different non-idealities (such as
leakage and channel noise), we demonstrate that noise can be used to make the
behavior of IF neurons more robust to synaptic inaccuracy. We then train
spiking networks which utilize IF neurons with and without noise and leakage,
and experimentally confirm that the noisy networks are more robust. Lastly, we
show that a noisy network can tolerate the inaccuracy expected when
hafnium-oxide based resistive random-access memory is used to encode synaptic
weights.
","[{'version': 'v1', 'created': 'Thu, 6 Jun 2019 20:16:46 GMT'}]",2021-09-29,"[['Olin-Ammentorp', 'Wilkie', ''], ['Beckmann', 'Karsten', ''], ['Schuman', 'Catherine D.', ''], ['Plank', 'James S.', ''], ['Cady', 'Nathaniel C.', '']]","['Spiking neural networks', 'synaptic devices', 'memristors', 'robustness', 'non-deterministic networks', 'stochastic networks', 'ReRAM']"
12199,2107.07921,Alessandro Marino,Martina Lippi and Alessandro Marino,"Safety in human-multi robot collaborative scenarios: a trajectory
  scaling approach","Link to the paper:
  https://www.sciencedirect.com/science/article/pii/S2405896318332464","IFAC-PapersOnLine, Volume 51, Issue 22, Pages 190-196, 2018",10.1016/j.ifacol.2018.11.540,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a strategy to handle the human safety in a multi-robot
scenario is devised. In the presented framework, it is foreseen that robots are
in charge of performing any cooperative manipulation task which is
parameterized by a proper task function. The devised architecture answers to
the increasing demand of strict cooperation between humans and robots, since it
equips a general multi-robot cell with the feature of making robots and human
working together. The human safety is properly handled by defining a safety
index which depends both on the relative position and velocity of the human
operator and robots. Then, the multi-robot task trajectory is properly scaled
in order to ensure that the human safety never falls below a given threshold
which can be set in worst conditions according to a minimum allowed distance.
Simulations results are presented in order to prove the effectiveness of the
approach.
","[{'version': 'v1', 'created': 'Fri, 16 Jul 2021 14:22:01 GMT'}]",2021-07-19,"[['Lippi', 'Martina', ''], ['Marino', 'Alessandro', '']]","['Human-robot collaboration', 'Trajectory scaling', 'Multi-robot systems']"
12200,1506.04268,Tomasz Waclawczyk PhD,Tomasz Waclawczyk,"A consistent solution of the reinitialization equation in the
  conservative level-set method","the paper is currently under review after the first revision in the
  Journal of Computational Physics (72 pages)",J. Comput. Phys. 299 (2015) 487-525,10.1016/j.jcp.2015.06.029,,cs.NA physics.comp-ph physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a new re-initialization method for the conservative level-set
function is put forward. First, it has been shown that the re-initialization
and advection equations of the conservative level-set function are
mathematically equivalent to the re-initialization and advection equations of
the localized signed distance function. Next, a new discretization for the
spatial derivatives of the conservative level-set function has been proposed.
This new discretization is consistent with the re-initialization procedure and
it guarantees a second-order convergence rate of the interface curvature on
gradually refined grids. The new re-initialization method does not introduce
artificial deformations to stationary and non-stationary interfaces, even when
the number of re-initialization steps is large.
","[{'version': 'v1', 'created': 'Sat, 13 Jun 2015 13:26:55 GMT'}]",2015-07-29,"[['Waclawczyk', 'Tomasz', '']]","['conservative level-set method', 'consistent re-initialization', 'localized']"
12201,1904.13210,Morad Behandish,"Morad Behandish, Amir M. Mirzendehdel, Saigopal Nelaturi",A Classification of Topological Discrepancies in Additive Manufacturing,Special Issue on symposium on Solid and Physical Modeling (SPM'2019),"Journal of Computer-Aided Design, 2019",10.1016/j.cad.2019.05.032,,cs.CG cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Additive manufacturing (AM) enables enormous freedom for design of complex
structures. However, the process-dependent limitations that result in
discrepancies between as-designed and as-manufactured shapes are not fully
understood. The tradeoffs between infinitely many different ways to approximate
a design by a manufacturable replica are even harder to characterize. To
support design for AM (DfAM), one has to quantify local discrepancies
introduced by AM processes, identify the detrimental deviations (if any) to the
original design intent, and prescribe modifications to the design and/or
process parameters to countervail their effects. Our focus in this work will be
on topological analysis. There is ample evidence in many applications that
preserving local topology (e.g., connectivity of beams in a lattice) is
important even when slight geometric deviations can be tolerated. We first
present a generic method to characterize local topological discrepancies due to
material under- and over-deposition in AM, and show how it captures various
types of defects in the as-manufactured structures. We use this information to
systematically modify the as-manufactured outcomes within the limitations of
available 3D printer resolution(s), which often comes at the expense of
introducing more geometric deviations (e.g., thickening a beam to avoid
disconnection). We validate the effectiveness of the method on 3D examples with
nontrivial topologies such as lattice structures and foams.
","[{'version': 'v1', 'created': 'Sat, 27 Apr 2019 17:30:30 GMT'}, {'version': 'v2', 'created': 'Thu, 23 May 2019 02:36:58 GMT'}, {'version': 'v3', 'created': 'Tue, 28 May 2019 22:39:14 GMT'}]",2019-05-30,"[['Behandish', 'Morad', ''], ['Mirzendehdel', 'Amir M.', ''], ['Nelaturi', 'Saigopal', '']]","['Additive Manufacturing', '3D Printing', 'Topological Analysis', 'Euler Characteristic', 'Betti Numbers']"
12202,1912.10013,Maura Pintor,"Maura Pintor, Luca Demetrio, Angelo Sotgiu, Marco Melis, Ambra
  Demontis, Battista Biggio",secml: A Python Library for Secure and Explainable Machine Learning,"Accepted for publication to SoftwareX. Published version can be found
  at: https://doi.org/10.1016/j.softx.2022.101095",SoftwareX 18 (2022),10.1016/j.softx.2022.101095,,cs.LG cs.CR cs.CV cs.GT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present \texttt{secml}, an open-source Python library for secure and
explainable machine learning. It implements the most popular attacks against
machine learning, including test-time evasion attacks to generate adversarial
examples against deep neural networks and training-time poisoning attacks
against support vector machines and many other algorithms. These attacks enable
evaluating the security of learning algorithms and the corresponding defenses
under both white-box and black-box threat models. To this end, \texttt{secml}
provides built-in functions to compute security evaluation curves, showing how
quickly classification performance decreases against increasing adversarial
perturbations of the input data. \texttt{secml} also includes explainability
methods to help understand why adversarial attacks succeed against a given
model, by visualizing the most influential features and training prototypes
contributing to each decision. It is distributed under the Apache License 2.0
and hosted at \url{https://github.com/pralab/secml}.
","[{'version': 'v1', 'created': 'Fri, 20 Dec 2019 18:41:37 GMT'}, {'version': 'v2', 'created': 'Fri, 13 May 2022 16:15:10 GMT'}]",2022-05-16,"[['Pintor', 'Maura', ''], ['Demetrio', 'Luca', ''], ['Sotgiu', 'Angelo', ''], ['Melis', 'Marco', ''], ['Demontis', 'Ambra', ''], ['Biggio', 'Battista', '']]","['Machine Learning', 'Security', 'Adversarial Attacks', 'Explainability', 'Python3']"
12203,1906.06283,Dennis Willsch,"Dennis Willsch, Madita Willsch, Hans De Raedt, Kristel Michielsen",Support vector machines on the D-Wave quantum annealer,"corrected typo in Eq. (11) and relation to SVM variant on p. 4; open
  source code available at
  https://gitlab.version.fz-juelich.de/cavallaro1/svm_quantum-annealer","Comput. Phys. Commun. 248, 107006 (2020)",10.1016/j.cpc.2019.107006,,cs.LG quant-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Kernel-based support vector machines (SVMs) are supervised machine learning
algorithms for classification and regression problems. We introduce a method to
train SVMs on a D-Wave 2000Q quantum annealer and study its performance in
comparison to SVMs trained on conventional computers. The method is applied to
both synthetic data and real data obtained from biology experiments. We find
that the quantum annealer produces an ensemble of different solutions that
often generalizes better to unseen data than the single global minimum of an
SVM trained on a conventional computer, especially in cases where only limited
training data is available. For cases with more training data than currently
fits on the quantum annealer, we show that a combination of classifiers for
subsets of the data almost always produces stronger joint classifiers than the
conventional SVM for the same parameters.
","[{'version': 'v1', 'created': 'Fri, 14 Jun 2019 16:45:01 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Nov 2019 10:47:46 GMT'}, {'version': 'v3', 'created': 'Tue, 26 Jan 2021 10:23:30 GMT'}]",2021-01-27,"[['Willsch', 'Dennis', ''], ['Willsch', 'Madita', ''], ['De Raedt', 'Hans', ''], ['Michielsen', 'Kristel', '']]","['Support Vector Machine', 'Kernel-based SVM', 'Machine Learning', 'Classification', 'Quantum Computation', 'Quantum Annealing']"
12204,2008.09151,Liangming Pan,"Liangming Pan, Jingjing Chen, Jianlong Wu, Shaoteng Liu, Chong-Wah
  Ngo, Min-Yen Kan, Yu-Gang Jiang, Tat-Seng Chua",Multi-modal Cooking Workflow Construction for Food Recipes,This manuscript has been accepted at ACM MM 2020,,10.1145/3394171.3413765,,cs.CL cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding food recipe requires anticipating the implicit causal effects
of cooking actions, such that the recipe can be converted into a graph
describing the temporal workflow of the recipe. This is a non-trivial task that
involves common-sense reasoning. However, existing efforts rely on hand-crafted
features to extract the workflow graph from recipes due to the lack of
large-scale labeled datasets. Moreover, they fail to utilize the cooking
images, which constitute an important part of food recipes. In this paper, we
build MM-ReS, the first large-scale dataset for cooking workflow construction,
consisting of 9,850 recipes with human-labeled workflow graphs. Cooking steps
are multi-modal, featuring both text instructions and cooking images. We then
propose a neural encoder-decoder model that utilizes both visual and textual
information to construct the cooking workflow, which achieved over 20%
performance gain over existing hand-crafted baselines.
","[{'version': 'v1', 'created': 'Thu, 20 Aug 2020 18:31:25 GMT'}]",2020-08-24,"[['Pan', 'Liangming', ''], ['Chen', 'Jingjing', ''], ['Wu', 'Jianlong', ''], ['Liu', 'Shaoteng', ''], ['Ngo', 'Chong-Wah', ''], ['Kan', 'Min-Yen', ''], ['Jiang', 'Yu-Gang', ''], ['Chua', 'Tat-Seng', '']]","['Food Recipes', 'Cooking Workflow', 'Multi-modal Fusion', 'MM-ResDataset', 'Cause-and-Effect Reasoning', 'Deep Learning']"
12205,2202.02974,Yingchen Tian,"Yingchen Tian, Yuxia Zhang, Klaas-Jan Stol, Lin Jiang, and Hui Liu",What Makes a Good Commit Message?,,,10.1145/3510003.3510205,,cs.SE cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A key issue in collaborative software development is communication among
developers. One modality of communication is a commit message, in which
developers describe the changes they make in a repository. As such, commit
messages serve as an ""audit trail"" by which developers can understand how the
source code of a project has changed-and why. Hence, the quality of commit
messages affects the effectiveness of communication among developers. Commit
messages are often of poor quality as developers lack time and motivation to
craft a good message. Several automatic approaches have been proposed to
generate commit messages. However, these are based on uncurated datasets
including considerable proportions of poorly phrased commit messages. In this
multi-method study, we first define what constitutes a ""good"" commit message,
and then establish what proportion of commit messages lack information using a
sample of almost 1,600 messages from five highly active open source projects.
We find that an average of circa 44% of messages could be improved, suggesting
the use of uncurated datasets may be a major threat when commit message
generators are trained with such data. We also observe that prior work has not
considered semantics of commit messages, and there is surprisingly little
guidance available for writing good commit messages. To that end, we develop a
taxonomy based on recurring patterns in commit messages' expressions. Finally,
we investigate whether ""good"" commit messages can be automatically identified;
such automation could prompt developers to write better commit messages.
","[{'version': 'v1', 'created': 'Mon, 7 Feb 2022 06:48:30 GMT'}]",2022-02-08,"[['Tian', 'Yingchen', ''], ['Zhang', 'Yuxia', ''], ['Stol', 'Klaas-Jan', ''], ['Jiang', 'Lin', ''], ['Liu', 'Hui', '']]","['Commit-based software development', 'open collaboration', 'commitmessage quality']"
12206,1810.02559,Mostafa Zaman Chowdhury,"Imtiaz Nasim, Mostafa Zaman Chowdhury, and Md. Syadus Sefat","Energy-Efficient Cellular Communications Powered by Smart Grid
  Technology","International Conference on Electrical Information and Communication
  Technology (EICT), December 2015, Khulna, Bangladesh",,10.1109/EICT.2015.7391965,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The energy efficiency aspect of cellular networks is a vital topic of
research over the recent days. As energy consumption is on the rise and the
price of electricity is increasing very rapidly, necessity to reduce
electricity usage in every aspect is becoming much more significant. The power
grid infrastructure, from which the cellular networks attain the required
electricity for operation is considering a significant change from the
traditional electricity grid to the smart grid. The base stations, which are
the main candidates for energy consumption in cellular networks, remain in
operation even when there are a very few users or no user at all. In this
paper, we propose an effective application scenario of the femtocell technology
for power saving purpose of cellular networks. Effective deployment of
femto-access-points in the required places can reduce the power usage of
cellular networks by turning off the redundant base stations. Moreover, the
signal to noise plus interference ratio is also enhanced in comparison to the
traditional scheme. The base station turn off probability and the energy
consumption in the overall network are analyzed. The comparison results show
that the proposed energy efficient model can significantly reduce energy
consumption and increase the service quality of the cellular users.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 07:49:09 GMT'}]",2018-10-08,"[['Nasim', 'Imtiaz', ''], ['Chowdhury', 'Mostafa Zaman', ''], ['Sefat', 'Md. Syadus', '']]","['Smart grid', 'cellular network', 'energy consumption', 'QoS', 'femtocell']"
12207,2209.03441,Jason Hiser,"Stefan Nagy, Anh Nguyen-Tuong, Jason D. Hiser, Jack W. Davidson,
  Matthew Hicks","Same Coverage, Less Bloat: Accelerating Binary-only Fuzzing with
  Coverage-preserving Coverage-guided Tracing","CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer
  and Communications Security",,10.1145/3460120.3484787,,cs.CR cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Coverage-guided fuzzing's aggressive, high-volume testing has helped reveal
tens of thousands of software security flaws. While executing billions of test
cases mandates fast code coverage tracing, the nature of binary-only targets
leads to reduced tracing performance. A recent advancement in binary fuzzing
performance is Coverage-guided Tracing (CGT), which brings orders-of-magnitude
gains in throughput by restricting the expense of coverage tracing to only when
new coverage is guaranteed. Unfortunately, CGT suits only a basic block
coverage granularity -- yet most fuzzers require finer-grain coverage metrics:
edge coverage and hit counts. It is this limitation which prohibits nearly all
of today's state-of-the-art fuzzers from attaining the performance benefits of
CGT.
  This paper tackles the challenges of adapting CGT to fuzzing's most
ubiquitous coverage metrics. We introduce and implement a suite of enhancements
that expand CGT's introspection to fuzzing's most common code coverage metrics,
while maintaining its orders-of-magnitude speedup over conventional always-on
coverage tracing. We evaluate their trade-offs with respect to fuzzing
performance and effectiveness across 12 diverse real-world binaries (8 open-
and 4 closed-source). On average, our coverage-preserving CGT attains
near-identical speed to the present block-coverage-only CGT, UnTracer; and
outperforms leading binary- and source-level coverage tracers QEMU, Dyninst,
RetroWrite, and AFL-Clang by 2-24x, finding more bugs in less time.
","[{'version': 'v1', 'created': 'Wed, 7 Sep 2022 19:58:32 GMT'}]",2022-09-09,"[['Nagy', 'Stefan', ''], ['Nguyen-Tuong', 'Anh', ''], ['Hiser', 'Jason D.', ''], ['Davidson', 'Jack W.', ''], ['Hicks', 'Matthew', '']]","['Fuzzing', 'Binaries', 'Code Coverage']"
12208,cs/0503009,Valmir Barbosa,"R. S. C. Leao, V. C. Barbosa",Minimal chordal sense of direction and circulant graphs,,"Lecture Notes in Computer Science 4162 (2006), 670-680",10.1007/11821069_58,,cs.DM,,"  A sense of direction is an edge labeling on graphs that follows a globally
consistent scheme and is known to considerably reduce the complexity of several
distributed problems. In this paper, we study a particular instance of sense of
direction, called a chordal sense of direction (CSD). In special, we identify
the class of k-regular graphs that admit a CSD with exactly k labels (a minimal
CSD). We prove that connected graphs in this class are Hamiltonian and that the
class is equivalent to that of circulant graphs, presenting an efficient
(polynomial-time) way of recognizing it when the graphs' degree k is fixed.
","[{'version': 'v1', 'created': 'Thu, 3 Mar 2005 12:06:10 GMT'}]",2007-05-23,"[['Leao', 'R. S. C.', ''], ['Barbosa', 'V. C.', '']]","['Chordal sense of direction', 'Cayley graphs', 'Circulant graphs']"
12209,1910.00081,Nitant Upasani,"Nitant Upasani, Krishnendra Shekhawat and Garv Sachdeva",Automated Generation of Dimensioned Rectangular Floorplans,,,10.1016/j.autcon.2020.103149,,cs.CG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a methodology for the automated construction of
rectangular floorplans (RFPs) while addressing dimensional constraints and
adjacency relations. Here, adjacency relations are taken in the form of a
dimensionless rectangular arrangement (RA) ensuring the existence of a RFP,
while dimensional constraints are given in terms of minimum width and aspect
ratio range for each room. A linear optimization model is then presented to
obtain a feasible dimensioned RFP for user-defined constraints. A GUI is also
developed for the automated generation of RFPs. The proposed model is able to
generate feasible solutions for every possible RA in a reasonable amount of
time. From the architectural perspective, this work can be seen as a
re-generation of well-known architectural plans with modified dimensions. In
the end, the regeneration of existing legacy RFPs (corresponding to the
user-defined dimensions) has been demonstrated, taking their image as input.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2019 20:11:34 GMT'}]",2020-03-12,"[['Upasani', 'Nitant', ''], ['Shekhawat', 'Krishnendra', ''], ['Sachdeva', 'Garv', '']]","['1 Floorplanning', 'Rectangular Floorplan', 'Network Flow', 'Graph Theory', 'Linear Optimization']"
12210,1909.12228,Ameya Jagtap Dr,"Ameya D. Jagtap, Kenji Kawaguchi and George Em Karniadakis","Locally adaptive activation functions with slope recovery term for deep
  and physics-informed neural networks","19 pages, 8 figures",,10.1098/rspa.2020.0334,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose two approaches of locally adaptive activation functions namely,
layer-wise and neuron-wise locally adaptive activation functions, which improve
the performance of deep and physics-informed neural networks. The local
adaptation of activation function is achieved by introducing a scalable
parameter in each layer (layer-wise) and for every neuron (neuron-wise)
separately, and then optimizing it using a variant of stochastic gradient
descent algorithm. In order to further increase the training speed, an
activation slope based slope recovery term is added in the loss function, which
further accelerates convergence, thereby reducing the training cost. On the
theoretical side, we prove that in the proposed method, the gradient descent
algorithms are not attracted to sub-optimal critical points or local minima
under practical conditions on the initialization and learning rate, and that
the gradient dynamics of the proposed method is not achievable by base methods
with any (adaptive) learning rates. We further show that the adaptive
activation methods accelerate the convergence by implicitly multiplying
conditioning matrices to the gradient of the base method without any explicit
computation of the conditioning matrix and the matrix-vector product. The
different adaptive activation functions are shown to induce different implicit
conditioning matrices. Furthermore, the proposed methods with the slope
recovery are shown to accelerate the training process.
","[{'version': 'v1', 'created': 'Wed, 25 Sep 2019 16:36:21 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Sep 2019 23:00:15 GMT'}, {'version': 'v3', 'created': 'Fri, 18 Oct 2019 01:21:22 GMT'}, {'version': 'v4', 'created': 'Wed, 17 Jun 2020 04:39:24 GMT'}]",2021-04-28,"[['Jagtap', 'Ameya D.', ''], ['Kawaguchi', 'Kenji', ''], ['Karniadakis', 'George Em', '']]","['Machine learning', 'bad minima', 'stochastic gradients', 'accelerated training', 'PINN', 'deep learningbenchmarks']"
12211,2206.13982,Taminul Islam,"Taminul Islam, MD Alamin Hosen, Akhi Mony, MD Touhid Hasan, Israt
  Jahan, Arindom Kundu",A Proposed Bi-LSTM Method to Fake News Detection,"Accepted and published in 2022 International Conference for
  Advancement in Technology, 5 pages, 8 figures","In 2022 International Conference for Advancement in Technology
  (ICONAT) (pp. 1-5). IEEE (2022, January)",10.1109/ICONAT53423.2022.9725937,,cs.CL cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent years have seen an explosion in social media usage, allowing people to
connect with others. Since the appearance of platforms such as Facebook and
Twitter, such platforms influence how we speak, think, and behave. This problem
negatively undermines confidence in content because of the existence of fake
news. For instance, false news was a determining factor in influencing the
outcome of the U.S. presidential election and other sites. Because this
information is so harmful, it is essential to make sure we have the necessary
tools to detect and resist it. We applied Bidirectional Long Short-Term Memory
(Bi-LSTM) to determine if the news is false or real in order to showcase this
study. A number of foreign websites and newspapers were used for data
collection. After creating & running the model, the work achieved 84% model
accuracy and 62.0 F1-macro scores with training data.
","[{'version': 'v1', 'created': 'Wed, 15 Jun 2022 06:36:42 GMT'}]",2022-06-29,"[['Islam', 'Taminul', ''], ['Hosen', 'MD Alamin', ''], ['Mony', 'Akhi', ''], ['Hasan', 'MD Touhid', ''], ['Jahan', 'Israt', ''], ['Kundu', 'Arindom', '']]","['Fake news detection', 'News detection', 'Bi-LSTM model']"
12212,2006.13847,Tryambak Gangopadhyay,"Johnathon Shook, Tryambak Gangopadhyay, Linjiang Wu, Baskar
  Ganapathysubramanian, Soumik Sarkar, Asheesh K. Singh","Crop Yield Prediction Integrating Genotype and Weather Variables Using
  Deep Learning","18 pages, 9 figures",,10.1371/journal.pone.0252402,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate prediction of crop yield supported by scientific and domain-relevant
insights, can help improve agricultural breeding, provide monitoring across
diverse climatic conditions and thereby protect against climatic challenges to
crop production including erratic rainfall and temperature variations. We used
historical performance records from Uniform Soybean Tests (UST) in North
America spanning 13 years of data to build a Long Short Term Memory - Recurrent
Neural Network based model to dissect and predict genotype response in
multiple-environments by leveraging pedigree relatedness measures along with
weekly weather parameters. Additionally, for providing explainability of the
important time-windows in the growing season, we developed a model based on
temporal attention mechanism. The combination of these two models outperformed
random forest (RF), LASSO regression and the data-driven USDA model for yield
prediction. We deployed this deep learning framework as a 'hypotheses
generation tool' to unravel GxExM relationships. Attention-based time series
models provide a significant advancement in interpretability of yield
prediction models. The insights provided by explainable models are applicable
in understanding how plant breeding programs can adapt their approaches for
global climate change, for example identification of superior varieties for
commercial release, intelligent sampling of testing environments in variety
development, and integrating weather parameters for a targeted breeding
approach. Using DL models as hypothesis generation tools will enable
development of varieties with plasticity response in variable climatic
conditions. We envision broad applicability of this approach (via conducting
sensitivity analysis and ""what-if"" scenarios) for soybean and other crop
species under different climatic conditions.
","[{'version': 'v1', 'created': 'Wed, 24 Jun 2020 16:20:12 GMT'}]",2021-07-14,"[['Shook', 'Johnathon', ''], ['Gangopadhyay', 'Tryambak', ''], ['Wu', 'Linjiang', ''], ['Ganapathysubramanian', 'Baskar', ''], ['Sarkar', 'Soumik', ''], ['Singh', 'Asheesh K.', '']]","['deep learning', 'explainable', 'LSTM', 'attention', 'crop yield', 'impact of climate change']"
12213,2211.16195,Florian Rupp,"Florian Rupp, Benjamin Schnabel, Kai Eckert","Easy and complex: new perspectives for metadata modeling using RDF-star
  and Named Graphs","The Version of Record of this contribution is published in Knowledge
  Graphs and Semantic Web . KGSWC 2022. Communications in Computer and
  Information Science, vol 1686. Springer, Cham and is available online at
  https://doi.org/10.1007/978-3-031-21422-6_18","Knowledge Graphs and Semantic Web . KGSWC 2022. Communications in
  Computer and Information Science, vol 1686. Springer, Cham",10.1007/978-3-031-21422-6_18,,cs.DB,http://creativecommons.org/licenses/by/4.0/,"  The Resource Description Framework is well-established as a lingua franca for
data modeling and is designed to integrate heterogeneous data at instance and
schema level using statements. While RDF is conceptually simple, data models
nevertheless get complex, when complex data needs to be represented. Additional
levels of indirection with intermediate resources instead of simple properties
lead to higher barriers for prospective users of the data. Based on three
patterns, we argue that shifting information to a meta-level can not only be
used to (1) provide provenance information, but can also help to (2) maintain
backwards compatibility for existing models, and to (3) reduce the complexity
of a data model. There are, however, multiple ways in RDF to use a meta-level,
i.e., to provide additional statements about statements. With Named Graphs,
there exists a well-established mechanism to describe groups of statements.
Since its inception, however, it has been hard to make statements about single
statements. With the introduction of RDF-star, a new way to provide data about
single statements is now available. We show that the combination of RDF-star
and Named Graphs is a viable solution to express data on a meta-level and
propose that this meta-level should be used as first class citizen in data
modeling.
","[{'version': 'v1', 'created': 'Tue, 29 Nov 2022 13:37:06 GMT'}]",2022-11-30,"[['Rupp', 'Florian', ''], ['Schnabel', 'Benjamin', ''], ['Eckert', 'Kai', '']]","['data modeling', 'RDF-star', 'Named Graphs', 'meta-level']"
12214,1810.05729,Teresa Finisterra Ara\'ujo,"Teresa Ara\'ujo, Guilherme Aresta, Adrian Galdran, Pedro Costa, Ana
  Maria Mendon\c{c}a, and Aur\'elio Campilho",UOLO - automatic object detection and segmentation in biomedical images,"Publised on DLMIA 2018. Licensed under the Creative Commons
  CC-BY-NC-ND 4.0 license: http://creativecommons.org/licenses/by-nc-nd/4.0/","4th International Workshop, DLMIA 2018, and 8th International
  Workshop, ML-CDS 2018, Held in Conjunction with MICCAI 2018, Granada, Spain,
  September 20, 2018, Proceedings. 165-173",10.1007/978-3-030-00889-5_19,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose UOLO, a novel framework for the simultaneous detection and
segmentation of structures of interest in medical images. UOLO consists of an
object segmentation module which intermediate abstract representations are
processed and used as input for object detection. The resulting system is
optimized simultaneously for detecting a class of objects and segmenting an
optionally different class of structures. UOLO is trained on a set of bounding
boxes enclosing the objects to detect, as well as pixel-wise segmentation
information, when available. A new loss function is devised, taking into
account whether a reference segmentation is accessible for each training image,
in order to suitably backpropagate the error. We validate UOLO on the task of
simultaneous optic disc (OD) detection, fovea detection, and OD segmentation
from retinal images, achieving state-of-the-art performance on public datasets.
","[{'version': 'v1', 'created': 'Tue, 9 Oct 2018 13:53:13 GMT'}]",2019-06-18,"[['Araújo', 'Teresa', ''], ['Aresta', 'Guilherme', ''], ['Galdran', 'Adrian', ''], ['Costa', 'Pedro', ''], ['Mendonça', 'Ana Maria', ''], ['Campilho', 'Aurélio', '']]","['detection', 'segmentation', 'biomedical images', 'eye fundus images', 'convolutional neural networks']"
12215,2109.10835,Srijanie Dey,Srijanie Dey and Alexander Dimitrov,"Mapping and Validating a Point Neuron Model on Intel's Neuromorphic
  Hardware Loihi",,Frontiers in Neuroinformatics 2022,10.3389/fnins.2022.883360,,cs.NE cs.ET,http://creativecommons.org/licenses/by/4.0/,"  Neuromorphic hardware is based on emulating the natural biological structure
of the brain. Since its computational model is similar to standard neural
models, it could serve as a computational acceleration for research projects in
the field of neuroscience and artificial intelligence, including biomedical
applications. However, in order to exploit this new generation of computer
chips, rigorous simulation and consequent validation of brain-based
experimental data is imperative. In this work, we investigate the potential of
Intel's fifth generation neuromorphic chip - `Loihi', which is based on the
novel idea of Spiking Neural Networks (SNNs) emulating the neurons in the
brain. The work is implemented in context of simulating the Leaky Integrate and
Fire (LIF) models based on the mouse primary visual cortex matched to a rich
data set of anatomical, physiological and behavioral constraints. Simulations
on the classical hardware serve as the validation platform for the neuromorphic
implementation. We find that Loihi replicates classical simulations very
efficiently and scales notably well in terms of both time and energy
performance as the networks get larger.
","[{'version': 'v1', 'created': 'Wed, 22 Sep 2021 16:52:51 GMT'}]",2022-06-03,"[['Dey', 'Srijanie', ''], ['Dimitrov', 'Alexander', '']]","['Neuromorphic Computing', 'LIF', 'Neural Simulations', 'Validation', 'Performance Analysis']"
12216,2103.15194,Vasileios Mavroeidis Dr.,Vasileios Mavroeidis and Audun J{\o}sang,Data-Driven Threat Hunting Using Sysmon,,,10.1145/3199478.3199490,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Threat actors can be persistent, motivated and agile, and leverage a
diversified and extensive set of tactics and techniques to attain their goals.
In response to that, defenders establish threat intelligence programs to stay
threat-informed and lower risk. Actionable threat intelligence is integrated
into security information and event management systems (SIEM) or is accessed
via more dedicated tools like threat intelligence platforms. A threat
intelligence platform gives access to contextual threat information by
aggregating, processing, correlating, and analyzing real-time data and
information from multiple sources, and in many cases, it provides centralized
analysis and reporting of an organization's security events. Sysmon logs is a
data source that has received considerable attention for endpoint visibility.
Approaches for threat detection using Sysmon have been proposed, mainly
focusing on search engine technologies like NoSQL database systems. This paper
demonstrates one of the many use cases of Sysmon and cyber threat intelligence.
In particular, we present a threat assessment system that relies on a cyber
threat intelligence ontology to automatically classify executed software into
different threat levels by analyzing Sysmon log streams. The presented system
and approach augments cyber defensive capabilities through situational
awareness, prediction, and automated courses of action.
","[{'version': 'v1', 'created': 'Sun, 28 Mar 2021 18:20:16 GMT'}]",2021-03-30,"[['Mavroeidis', 'Vasileios', ''], ['Jøsang', 'Audun', '']]","['cyber threat intelligence', 'software threat assessment', 'sysmon', 'threathunting', 'knowledge representation', 'ontology', 'inference', 'cybersecurity automation']"
12217,2105.00272,Wilhelm Hasselbring,Wilhelm Hasselbring,Benchmarking as Empirical Standard in Software Engineering Research,"This is the author's version of the work. It is posted here for your
  personal use. Not for redistribution. The definitive version was published in
  EASE 2021 (Evaluation and Assessment in Software Engineering), June 21-23,
  2021, Trondheim, Norway, https://doi.org/10.1145/3463274.3463361",,10.1145/3463274.3463361,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In empirical software engineering, benchmarks can be used for comparing
different methods, techniques and tools. However, the recent ACM SIGSOFT
Empirical Standards for Software Engineering Research do not include an
explicit checklist for benchmarking. In this paper, we discuss benchmarks for
software performance and scalability evaluation as example research areas in
software engineering, relate benchmarks to some other empirical research
methods, and discuss the requirements on benchmarks that may constitute the
basis for a checklist of a benchmarking standard for empirical software
engineering research.
","[{'version': 'v1', 'created': 'Sat, 1 May 2021 14:54:56 GMT'}]",2021-05-04,"[['Hasselbring', 'Wilhelm', '']]","['benchmarking', 'empirical software engineering', 'empirical standards']"
12218,1710.08904,Pei Cao,"Pei Cao, Shengli Zhang, Jiong Tang","Pre-Processing-Free Gear Fault Diagnosis Using Small Datasets with Deep
  Convolutional Neural Network-Based Transfer Learning",,,10.1109/ACCESS.2018.2837621,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Early fault diagnosis in complex mechanical systems such as gearbox has
always been a great challenge, even with the recent development in deep neural
networks. The performance of a classic fault diagnosis system predominantly
depends on the features extracted and the classifier subsequently applied.
Although a large number of attempts have been made regarding feature extraction
techniques, the methods require great human involvements are heavily depend on
domain expertise and may thus be non-representative and biased from application
to application. On the other hand, while the deep neural networks based
approaches feature adaptive feature extractions and inherent classifications,
they usually require a substantial set of training data and thus hinder their
usage for engineering applications with limited training data such as gearbox
fault diagnosis. This paper develops a deep convolutional neural network-based
transfer learning approach that not only entertains pre-processing free
adaptive feature extractions, but also requires only a small set of training
data. The proposed approach performs gear fault diagnosis using pre-processing
free raw accelerometer data and experiments with various sizes of training data
were conducted. The superiority of the proposed approach is revealed by
comparing the performance with other methods such as locally trained
convolution neural network and angle-frequency analysis based support vector
machine. The achieved accuracy indicates that the proposed approach is not only
viable and robust, but also has the potential to be readily applicable to other
fault diagnosis practices.
","[{'version': 'v1', 'created': 'Tue, 24 Oct 2017 17:39:00 GMT'}]",2018-10-30,"[['Cao', 'Pei', ''], ['Zhang', 'Shengli', ''], ['Tang', 'Jiong', '']]","['gear fault diagnosis', 'deep convolution neural network', 'transfer learning']"
12219,1912.11064,"Mika\""el Monet","Marcelo Arenas, Pablo Barcel\'o, Mika\""el Monet",Counting Problems over Incomplete Databases,"29 pages, including 12 pages of main text. This is the arXiv version
  of the PODS'20 paper. Except from minor differences that could be introduced
  by the publisher, the only difference should be the addition of the appendix,
  which contains all the proofs that do not appear in the main text",,10.1145/3375395.3387656,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the complexity of various fundamental counting problems that arise
in the context of incomplete databases, i.e., relational databases that can
contain unknown values in the form of labeled nulls. Specifically, we assume
that the domains of these unknown values are finite and, for a Boolean query
$q$, we consider the following two problems: given as input an incomplete
database $D$, (a) return the number of completions of $D$ that satisfy $q$; or
(b) return or the number of valuations of the nulls of $D$ yielding a
completion that satisfies $q$. We obtain dichotomies between #P-hardness and
polynomial-time computability for these problems when $q$ is a self-join--free
conjunctive query, and study the impact on the complexity of the following two
restrictions: (1) every null occurs at most once in $D$ (what is called Codd
tables); and (2) the domain of each null is the same. Roughly speaking, we show
that counting completions is much harder than counting valuations (for
instance, while the latter is always in #P, we prove that the former is not in
#P under some widely believed theoretical complexity assumption). Moreover, we
find that both (1) and (2) reduce the complexity of our problems. We also study
the approximability of these problems and show that, while counting valuations
always has a fully polynomial randomized approximation scheme, in most cases
counting completions does not. Finally, we consider more expressive query
languages and situate our problems with respect to known complexity classes.
","[{'version': 'v1', 'created': 'Mon, 23 Dec 2019 19:08:58 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Mar 2020 12:02:02 GMT'}]",2021-04-29,"[['Arenas', 'Marcelo', ''], ['Barceló', 'Pablo', ''], ['Monet', 'Mikaël', '']]","['Incomplete databases', 'closed-world assumption', 'counting complexity', 'FPRAS']"
12220,2205.14228,Yinghao Li,"Yinghao Li, Le Song, Chao Zhang","Sparse Conditional Hidden Markov Model for Weakly Supervised Named
  Entity Recognition","11 pages, 8 figures, 11 tables",,10.1145/3534678.3539247,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Weakly supervised named entity recognition methods train label models to
aggregate the token annotations of multiple noisy labeling functions (LFs)
without seeing any manually annotated labels. To work well, the label model
needs to contextually identify and emphasize well-performed LFs while
down-weighting the under-performers. However, evaluating the LFs is challenging
due to the lack of ground truths. To address this issue, we propose the sparse
conditional hidden Markov model (Sparse-CHMM). Instead of predicting the entire
emission matrix as other HMM-based methods, Sparse-CHMM focuses on estimating
its diagonal elements, which are considered as the reliability scores of the
LFs. The sparse scores are then expanded to the full-fledged emission matrix
with pre-defined expansion functions. We also augment the emission with
weighted XOR scores, which track the probabilities of an LF observing incorrect
entities. Sparse-CHMM is optimized through unsupervised learning with a
three-stage training pipeline that reduces the training difficulty and prevents
the model from falling into local optima. Compared with the baselines in the
Wrench benchmark, Sparse-CHMM achieves a 3.01 average F1 score improvement on
five comprehensive datasets. Experiments show that each component of
Sparse-CHMM is effective, and the estimated LF reliabilities strongly correlate
with true LF F1 scores.
","[{'version': 'v1', 'created': 'Fri, 27 May 2022 20:47:30 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Jun 2022 15:54:52 GMT'}]",2022-06-08,"[['Li', 'Yinghao', ''], ['Song', 'Le', ''], ['Zhang', 'Chao', '']]","['Hidden Markov Model', 'Weak Supervision', 'Information Extraction', 'Named Entity Recognition']"
12221,2103.09907,Tao Zhou,"Yan-Li Lee, Tao Zhou",Collaborative Filtering Approach to Link Prediction,"19 pages, 3 tables, 1 figure",Physica A 578 (2021) 126107,10.1016/j.physa.2021.126107,,cs.SI cs.IR,http://creativecommons.org/publicdomain/zero/1.0/,"  Link prediction is a fundamental challenge in network science. Among various
methods, local similarity indices are widely used for their high
cost-performance. However, the performance is less robust: for some networks
local indices are highly competitive to state-of-the-art algorithms while for
some other networks they are very poor. Inspired by techniques developed for
recommender systems, we propose an enhancement framework for local indices
based on collaborative filtering (CF). Considering the delicate but important
difference between personalized recommendation and link prediction, we further
propose an improved framework named as self-included collaborative filtering
(SCF). The SCF framework significantly improved the accuracy and robustness of
well-known local indices. The combination of SCF framework and a simple local
index can produce an index with competitive performance and much lower
complexity compared with elaborately-designed state-of-the-art algorithms.
","[{'version': 'v1', 'created': 'Sun, 14 Mar 2021 07:40:57 GMT'}]",2021-09-09,"[['Lee', 'Yan-Li', ''], ['Zhou', 'Tao', '']]","['Complex Network', 'Link Prediction', 'Collaborative Filtering', 'Node Similarity']"
12222,1905.07817,Shehroz Khan,"Shehroz S. Khan, Jacob Nogas, Alex Mihailidis",Spatio-Temporal Adversarial Learning for Detecting Unseen Falls,"17 pages, 10 figures, 4 tables, 39 references","Pattern Analysis and Applications, 2020",10.1007/s10044-020-00901-9,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fall detection is an important problem from both the health and machine
learning perspective. A fall can lead to severe injuries, long term impairments
or even death in some cases. In terms of machine learning, it presents a
severely class imbalance problem with very few or no training data for falls
owing to the fact that falls occur rarely. In this paper, we take an alternate
philosophy to detect falls in the absence of their training data, by training
the classifier on only the normal activities (that are available in abundance)
and identifying a fall as an anomaly. To realize such a classifier, we use an
adversarial learning framework, which comprises of a spatio-temporal
autoencoder for reconstructing input video frames and a spatio-temporal
convolution network to discriminate them against original video frames. 3D
convolutions are used to learn spatial and temporal features from the input
video frames. The adversarial learning of the spatio-temporal autoencoder will
enable reconstructing the normal activities of daily living efficiently; thus,
rendering detecting unseen falls plausible within this framework. We tested the
performance of the proposed framework on camera sensing modalities that may
preserve an individual's privacy (fully or partially), such as thermal and
depth camera. Our results on three publicly available datasets show that the
proposed spatio-temporal adversarial framework performed better than other
baseline frame based (or spatial) adversarial learning methods.
","[{'version': 'v1', 'created': 'Sun, 19 May 2019 22:19:17 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Mar 2020 17:57:23 GMT'}]",2020-07-24,"[['Khan', 'Shehroz S.', ''], ['Nogas', 'Jacob', ''], ['Mihailidis', 'Alex', '']]","['Fall', 'Spatio-Temporal', 'Adversarial Learning', 'Autoencoder', 'Thermal Camera', 'Depth Camera']"
12223,1908.11680,Robert Buhren,"Robert Buhren, Christian Werling, Jean-Pierre Seifert",Insecure Until Proven Updated: Analyzing AMD SEV's Remote Attestation,,,10.1145/3319535.3354216,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Customers of cloud services have to trust the cloud providers, as they
control the building blocks that form the cloud. This includes the hypervisor
enabling the sharing of a single hardware platform among multiple tenants. AMD
Secure Encrypted Virtualization (SEV) claims a new level of protection in cloud
scenarios. AMD SEV encrypts the main memory of virtual machines with
VM-specific keys, thereby denying the higher-privileged hypervisor access to a
guest's memory. To enable the cloud customer to verify the correct deployment
of his virtual machine, SEV additionally introduces a remote attestation
protocol.This paper analyzes the firmware components that implement the SEV
remote attestation protocol on the current AMD Epyc Naples CPU series. We
demonstrate that it is possible to extract critical CPU-specific keys that are
fundamental for the security of the remote attestation protocol.Building on the
extracted keys, we propose attacks that allow a malicious cloud provider a
complete circumvention of the SEV protection mechanisms. Although the
underlying firmware issues were already fixed by AMD, we show that the current
series of AMD Epyc CPUs, i.e., the Naples series, does not prevent the
installation of previous firmware versions. We show that the severity of our
proposed attacks is very high as no purely software-based mitigations are
possible. This effectively renders the SEV technology on current AMD Epyc CPUs
useless when confronted with an untrusted cloud provider. To overcome these
issues, we also propose robust changes to the SEV design that allow future
generations of the SEV technology to mitigate the proposed attacks.
","[{'version': 'v1', 'created': 'Fri, 30 Aug 2019 12:17:27 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Sep 2019 14:22:21 GMT'}]",2019-09-04,"[['Buhren', 'Robert', ''], ['Werling', 'Christian', ''], ['Seifert', 'Jean-Pierre', '']]","['virtualization', 'Secure Encrypted Virtualization', 'cloud computing', 'shielding systems', 'SEV', 'remote atestation']"
12224,1909.10123,Rohan Kadekodi,"Rohan Kadekodi, Se Kwon Lee, Sanidhya Kashyap, Taesoo Kim, Aasheesh
  Kolli, Vijay Chidambaram","SplitFS: Reducing Software Overhead in File Systems for Persistent
  Memory",,,10.1145/3341301.3359631,,cs.OS cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present SplitFS, a file system for persistent memory (PM) that reduces
software overhead significantly compared to state-of-the-art PM file systems.
SplitFS presents a novel split of responsibilities between a user-space library
file system and an existing kernel PM file system. The user-space library file
system handles data operations by intercepting POSIX calls, memory-mapping the
underlying file, and serving the read and overwrites using processor loads and
stores. Metadata operations are handled by the kernel PM file system (ext4
DAX). SplitFS introduces a new primitive termed relink to efficiently support
file appends and atomic data operations. SplitFS provides three consistency
modes, which different applications can choose from, without interfering with
each other. SplitFS reduces software overhead by up-to 4x compared to the NOVA
PM file system, and 17x compared to ext4-DAX. On a number of micro-benchmarks
and applications such as the LevelDB key-value store running the YCSB
benchmark, SplitFS increases application performance by up to 2x compared to
ext4 DAX and NOVA while providing similar consistency guarantees.
","[{'version': 'v1', 'created': 'Mon, 23 Sep 2019 02:03:13 GMT'}]",2019-09-24,"[['Kadekodi', 'Rohan', ''], ['Lee', 'Se Kwon', ''], ['Kashyap', 'Sanidhya', ''], ['Kim', 'Taesoo', ''], ['Kolli', 'Aasheesh', ''], ['Chidambaram', 'Vijay', '']]","['Persistent Memory', 'File Systems', 'Crash Consistency', 'DirectAccess']"
12225,1706.09771,Ferrucio De Franco Rosa,Ferrucio de Franco Rosa and Mario Jino,A Survey of Security Assessment Ontologies,,,10.1007/978-3-319-56535-4_17,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A literature survey on ontologies concerning the Security Assessment domain
has been carried out to uncover initiatives that aim at formalizing concepts
from the Security Assessment field of research. A preliminary analysis and a
discussion on the selected works are presented. Our main contribution is an
updated literature review, describing key characteristics, results, research
issues, and application domains of the papers. We have also detected gaps in
the Security Assessment literature that could be the subject of further studies
in the field. This work is meant to be useful for security researchers who wish
to adopt a formal approach in their methods.
","[{'version': 'v1', 'created': 'Thu, 29 Jun 2017 14:21:21 GMT'}]",2017-06-30,"[['Rosa', 'Ferrucio de Franco', ''], ['Jino', 'Mario', '']]","['Software Assessment', 'Information Security', 'Security Assessment', 'Ontology', 'Information', 'Knowledge Management']"
12226,2006.08654,Pedro Garc\'ia-L\'opez,"Pedro Garc\'ia-L\'opez, Aitor Arjona, Josep Sampe, Aleksander
  Slominski, Lionel Villard",Triggerflow: Trigger-based Orchestration of Serverless Workflows,"The 14th ACM International Conference on Distributed and Event-based
  Systems (DEBS 2020)",,10.1145/3401025.3401731,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As more applications are being moved to the Cloud thanks to serverless
computing, it is increasingly necessary to support native life cycle execution
of those applications in the data center. But existing systems either focus on
short-running workflows (like IBM Composer or Amazon Express Workflows) or
impose considerable overheads for synchronizing massively parallel jobs (Azure
Durable Functions, Amazon Step Functions, Google Cloud Composer). None of them
are open systems enabling extensible interception and optimization of custom
workflows. We present Triggerflow: an extensible Trigger-based Orchestration
architecture for serverless workflows built on top of Knative Eventing and
Kubernetes technologies. We demonstrate that Triggerflow is a novel serverless
building block capable of constructing different reactive schedulers (State
Machines, Directed Acyclic Graphs, Workflow as code). We also validate that it
can support high-volume event processing workloads, auto-scale on demand and
transparently optimize scientific workflows.
","[{'version': 'v1', 'created': 'Mon, 15 Jun 2020 18:04:33 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Jun 2020 14:18:34 GMT'}]",2020-06-18,"[['García-López', 'Pedro', ''], ['Arjona', 'Aitor', ''], ['Sampe', 'Josep', ''], ['Slominski', 'Aleksander', ''], ['Villard', 'Lionel', '']]","['event-based', 'orchestration', 'serverless']"
12227,2012.13044,Qingfang He,"Jingyi Zhou, Qingfang He and Zhiying Lin",Union-net: A deep neural network model adapted to small data sets,"23 pages, 9 figures",The Journal of Supercomputing(2022),10.1007/s11227-022-04963-w,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In real applications, generally small data sets can be obtained. At present,
most of the practical applications of machine learning use classic models based
on big data to solve the problem of small data sets. However, the deep neural
network model has complex structure, huge model parameters, and training
requires more advanced equipment, which brings certain difficulties to the
application. Therefore, this paper proposes the concept of union convolution,
designing a light deep network model union-net with a shallow network structure
and adapting to small data sets. This model combines convolutional network
units with different combinations of the same input to form a union module.
Each union module is equivalent to a convolutional layer. The serial input and
output between the 3 modules constitute a ""3-layer"" neural network. The output
of each union module is fused and added as the input of the last convolutional
layer to form a complex network with a 4-layer network structure. It solves the
problem that the deep network model network is too deep and the transmission
path is too long, which causes the loss of the underlying information
transmission. Because the model has fewer model parameters and fewer channels,
it can better adapt to small data sets. It solves the problem that the deep
network model is prone to overfitting in training small data sets. Use the
public data sets cifar10 and 17flowers to conduct multi-classification
experiments. Experiments show that the Union-net model can perform well in
classification of large data sets and small data sets. It has high practical
value in daily application scenarios. The model code is published at
https://github.com/yeaso/union-net
","[{'version': 'v1', 'created': 'Thu, 24 Dec 2020 00:44:06 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Aug 2022 02:12:35 GMT'}]",2022-12-02,"[['Zhou', 'Jingyi', ''], ['He', 'Qingfang', ''], ['Lin', 'Zhiying', '']]","['small data sets', 'Deep Learning', 'pre-trained model', 'shallow network', 'CNN model 1']"
12228,1601.02699,Juyeop Kim Dr.,"Juyeop Kim, Sang Won Choi, Won-Yong Shin, Yong-Soo Song and Yong-Kyu
  Kim",Group Communication Over LTE : A Radio Access Perspective,will be published in IEEE Communications Magazine,,10.1109/MCOM.2016.7452261,,cs.NI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Long Term Evolution (LTE), which has its root on commercial mobile
communications, recently becomes an influential solution to future public
safety communications. To verify the feasibility of LTE for public safety, it
is essential to investigate whether an LTE system optimized for one-to-one
communications is capable of providing group communication, which is one of the
most important service concepts in public safety. In general, a number of first
responders for public safety need to form a group for communicating with each
other or sharing the common data for collaboration on their mission. In this
article, we analyze how the current LTE system can support group communication
in a radio access aspect. Based on the requirements for group communication, we
validate whether each LTE-enabled radio access method can efficiently support
group communication. In addition, we propose a new multicast transmission
scheme, termed index-coded Hybrid Automatic Retransmission reQuest (HARQ). By
applying the index coding concept to HARQ operations, we show that the LTE
system can provide group communication more sophisticatedly in terms of radio
resource efficiency and scalability. We finally evaluate the performance of
LTE-enabled group communication using several radio access methods and show how
the proposed transmission scheme brings the performance enhancement via system
level simulations.
","[{'version': 'v1', 'created': 'Tue, 12 Jan 2016 00:22:41 GMT'}]",2016-11-17,"[['Kim', 'Juyeop', ''], ['Choi', 'Sang Won', ''], ['Shin', 'Won-Yong', ''], ['Song', 'Yong-Soo', ''], ['Kim', 'Yong-Kyu', '']]","['J. Kim', 'S.W. Choi', 'Y.-S. Song and Y']"
12229,2202.02519,Yongjun Chen,"Yongjun Chen, Zhiwei Liu, Jia Li, Julian McAuley, Caiming Xiong",Intent Contrastive Learning for Sequential Recommendation,,,10.1145/3485447.3512090,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Users' interactions with items are driven by various intents (e.g., preparing
for holiday gifts, shopping for fishing equipment, etc.).However, users'
underlying intents are often unobserved/latent, making it challenging to
leverage such latent intents forSequentialrecommendation(SR). To investigate
the benefits of latent intents and leverage them effectively for
recommendation, we proposeIntentContrastiveLearning(ICL), a general learning
paradigm that leverages a latent intent variable into SR. The core idea is to
learn users' intent distribution functions from unlabeled user behavior
sequences and optimize SR models with contrastive self-supervised learning
(SSL) by considering the learned intents to improve recommendation.
Specifically, we introduce a latent variable to represent users' intents and
learn the distribution function of the latent variable via clustering. We
propose to leverage the learned intents into SR models via contrastive SSL,
which maximizes the agreement between a view of sequence and its corresponding
intent. The training is alternated between intent representation learning and
the SR model optimization steps within the generalized expectation-maximization
(EM) framework. Fusing user intent information into SR also improves model
robustness. Experiments conducted on four real-world datasets demonstrate the
superiority of the proposed learning paradigm, which improves performance, and
robustness against data sparsity and noisy interaction issues.
","[{'version': 'v1', 'created': 'Sat, 5 Feb 2022 09:24:13 GMT'}]",2022-02-08,"[['Chen', 'Yongjun', ''], ['Liu', 'Zhiwei', ''], ['Li', 'Jia', ''], ['McAuley', 'Julian', ''], ['Xiong', 'Caiming', '']]","['Latent Factor Modeling', 'Self-Supervised Learning', 'Contrastive Learning', 'Robustness', 'Sequential Recommendation']"
12230,2207.12208,Paul Boniol,"Paul Boniol, Themis Palpanas",Series2Graph: Graph-based Subsequence Anomaly Detection for Time Series,,"Proceedings of the VLDB Endowment, Volume 13, Issue 12, Pages
  1821-1834, 2020",10.14778/3407790.3407792,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Subsequence anomaly detection in long sequences is an important problem with
applications in a wide range of domains. However, the approaches proposed so
far in the literature have severe limitations: they either require prior domain
knowledge used to design the anomaly discovery algorithms, or become cumbersome
and expensive to use in situations with recurrent anomalies of the same type.
In this work, we address these problems, and propose an unsupervised method
suitable for domain agnostic subsequence anomaly detection. Our method,
Series2Graph, is based on a graph representation of a novel low-dimensionality
embedding of subsequences. Series2Graph needs neither labeled instances (like
supervised techniques) nor anomaly-free data (like zero-positive learning
techniques), and identifies anomalies of varying lengths. The experimental
results, on the largest set of synthetic and real datasets used to date,
demonstrate that the proposed approach correctly identifies single and
recurrent anomalies without any prior knowledge of their characteristics,
outperforming by a large margin several competing approaches in accuracy, while
being up to orders of magnitude faster. This paper has appeared in VLDB 2020.
","[{'version': 'v1', 'created': 'Mon, 25 Jul 2022 13:55:43 GMT'}]",2022-07-26,"[['Boniol', 'Paul', ''], ['Palpanas', 'Themis', '']]","['Time series', 'Data series', 'Subsequence anomalies', 'Outliers']"
12231,2110.00326,Qiyi Tang,Stefan Kiefer and Qiyi Tang,Approximate Bisimulation Minimisation,Full version of an FSTTCS'21 paper,,10.4230/LIPIcs.FSTTCS.2021.28,,cs.FL cs.LO,http://creativecommons.org/licenses/by/4.0/,"  We propose polynomial-time algorithms to minimise labelled Markov chains
whose transition probabilities are not known exactly, have been perturbed, or
can only be obtained by sampling. Our algorithms are based on a new notion of
an approximate bisimulation quotient, obtained by lumping together states that
are exactly bisimilar in a slightly perturbed system. We present experiments
that show that our algorithms are able to recover the structure of the
bisimulation quotient of the unperturbed system.
","[{'version': 'v1', 'created': 'Fri, 1 Oct 2021 11:37:26 GMT'}]",2021-10-04,"[['Kiefer', 'Stefan', ''], ['Tang', 'Qiyi', '']]","['Markov chains', 'Behavioural metrics', 'Bisimulation']"
12232,2101.01052,Sagar Gubbi Venkatesh,Sagar Gubbi and Shishir Kolathaya and Bharadwaj Amrutur,Imitation Learning for High Precision Peg-in-Hole Tasks,Accepted at ICCAR 2020,,10.1109/ICCAR49639.2020.9108072,,cs.RO cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Industrial robot manipulators are not able to match the precision and speed
with which humans are able to execute contact rich tasks even to this day.
Therefore, as a means overcome this gap, we demonstrate generative methods for
imitating a peg-in-hole insertion task in a 6-DOF robot manipulator. In
particular, generative adversarial imitation learning (GAIL) is used to
successfully achieve this task with a 10 um, and a 6 um peg-hole clearance on
the Yaskawa GP8 industrial robot. Experimental results show that the policy
successfully learns within 20 episodes from a handful of human expert
demonstrations on the robot (i.e., < 10 tele-operated robot demonstrations).
The insertion time improves from > 20 seconds (which also includes failed
insertions) to < 15 seconds, thereby validating the effectiveness of this
approach.
","[{'version': 'v1', 'created': 'Sat, 26 Dec 2020 08:42:15 GMT'}]",2021-01-05,"[['Gubbi', 'Sagar', ''], ['Kolathaya', 'Shishir', ''], ['Amrutur', 'Bharadwaj', '']]","['Imitation learning', 'generative adversarial networks', 'peg-in-hole insertion']"
12233,2110.07307,Xue Zhang,"Xue Zhang, Zehua Sheng, Hui-Liang Shen",FocusNet: Classifying Better by Focusing on Confusing Classes,Accepted by Pattern Recognition 2022,Pattern Recognition 2022,10.1016/j.patcog.2022.108709,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Nowadays, most classification networks use one-hot encoding to represent
categorical data because of its simplicity. However, one-hot encoding may
affect the generalization ability as it neglects inter-class correlations. We
observe that, even when a neural network trained with one-hot labels produces
incorrect predictions, it still pays attention to the target image region and
reveals which classes confuse the network. Inspired by this observation, we
propose a confusion-focusing mechanism to address the class-confusion issue.
Our confusion-focusing mechanism is implemented by a two-branch network
architecture. Its baseline branch generates confusing classes, and its FocusNet
branch, whose architecture is flexible, discriminates correct labels from these
confusing classes. We also introduce a novel focus-picking loss function to
improve classification accuracy by encouraging FocusNet to focus on the most
confusing classes. The experimental results validate that our FocusNet is
effective for image classification on common datasets, and that our
focus-picking loss function can also benefit the current neural networks in
improving their classification accuracy.
","[{'version': 'v1', 'created': 'Thu, 14 Oct 2021 12:22:59 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Apr 2022 02:08:08 GMT'}, {'version': 'v3', 'created': 'Wed, 5 Oct 2022 07:45:38 GMT'}]",2022-10-06,"[['Zhang', 'Xue', ''], ['Sheng', 'Zehua', ''], ['Shen', 'Hui-Liang', '']]","['Image classification', 'inter-class correlations', 'confusing classes']"
12234,2108.06723,Shuvendu Roy,"Shuvendu Roy, Ali Etemad",Self-supervised Contrastive Learning of Multi-view Facial Expressions,"Accepted by 23rd ACM International Conference on Multimodal
  Interaction (ICMI 2021)",,10.1145/3462244.3479955,,cs.CV cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  Facial expression recognition (FER) has emerged as an important component of
human-computer interaction systems. Despite recent advancements in FER,
performance often drops significantly for non-frontal facial images. We propose
Contrastive Learning of Multi-view facial Expressions (CL-MEx) to exploit
facial images captured simultaneously from different angles towards FER. CL-MEx
is a two-step training framework. In the first step, an encoder network is
pre-trained with the proposed self-supervised contrastive loss, where it learns
to generate view-invariant embeddings for different views of a subject. The
model is then fine-tuned with labeled data in a supervised setting. We
demonstrate the performance of the proposed method on two multi-view FER
datasets, KDEF and DDCF, where state-of-the-art performances are achieved.
Further experiments show the robustness of our method in dealing with
challenging angles and reduced amounts of labeled data.
","[{'version': 'v1', 'created': 'Sun, 15 Aug 2021 11:23:34 GMT'}]",2021-08-17,"[['Roy', 'Shuvendu', ''], ['Etemad', 'Ali', '']]","['Contrastive Learning', 'Self-Supervised Learning', 'Multi-View Learning', 'Affective Computing']"
12235,2208.00371,Lucia Moura,"Thais Bardini Idalino, Lucia Moura","Nested Cover-Free Families for Unbounded Fault-Tolerant Aggregate
  Signatures",30 pages,Theoretical Computer Science 854 (2021) 116-130,10.1016/j.tcs.2020.12.008,,cs.CR cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aggregate signatures are used to create one short proof of authenticity and
integrity from a set of digital signatures. However, one invalid signature in
the set invalidates the entire aggregate, giving no information on which
signatures are valid. Hartung et al. (2016) propose a fault-tolerant aggregate
signature scheme based on combinatorial group testing. Given a bound $d$ on the
number of invalid signatures among $n$ signatures to be aggregated, this scheme
uses $d$-cover-free families to determine which signatures are invalid. These
combinatorial structures guarantee a moderate increase on the size of the
aggregate signature that can reach the best possible compression ratio of
$O(\frac{n}{\log n})$, for fixed $d$, coming from an information theoretical
bound. The case where the total number of signatures grows dynamically
(unbounded scheme) was not satisfactorily solved in their original paper, since
explicit constructions had constant compression ratios. In the present paper,
we propose efficient solutions for the unbounded scheme, relying on sequences
of $d$-cover-free families that we call {\em nested families}. Some of our
constructions yield high compression ratio close to \rmv{the information
theoretical bound}\todo{the best known upper bound}. We also propose the use of
$(d,\lambda)$-cover-free families to support the loss of up to $\lambda-1$
parts of the aggregate.
","[{'version': 'v1', 'created': 'Sun, 31 Jul 2022 06:16:37 GMT'}]",2022-08-02,"[['Idalino', 'Thais Bardini', ''], ['Moura', 'Lucia', '']]","['Aggregate signature', 'fault-tolerance', 'cover-free family', 'digitalsignature', 'combinatorial group testing']"
12236,2112.13459,Bushra Sadia,"Bushra Sadia, Ayberk Sadic, Mehmet Ayyildiz, Cagatay Basdogan","Exploration Strategies for Tactile Graphics Displayed by
  Electrovibration on a Touchscreen",,"International Journal of Human-Computer Studies, Volume 160, 2022,
  102760",10.1016/j.ijhcs.2021.102760,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advancements in surface haptics technology have given rise to the development
of interactive applications displaying tactile content on touch surfaces such
as images, signs, diagrams, plots, charts, graphs, maps, networks, and tables.
In those applications, users manually explore the touch surface to interact
with the tactile data using some intuitive strategies. The user's exploration
strategy, tactile data's complexity, and tactile rendering method all affect
the user's haptic perception, which plays a critical role in design and
prototyping of those applications. In this study, we conducted experiments with
human participants to investigate the recognition rate and time of five tactile
shapes rendered by electrovibration on a touchscreen using three different
methods and displayed in prototypical orientation and non-prototypical
orientations. The results showed that the correct recognition rate of the
shapes was higher when the haptically active area was larger. However, as the
number of edges increased, the recognition time increased and the recognition
rate dropped significantly, arriving to a value slightly higher than the chance
rate of 20% for non-prototypical octagon. We also recorded the participants'
finger movements on the touchscreen to examine their haptic exploration
strategies. Our analyses revealed that the participants first used global
scanning to extract the coarse features of the displayed shapes, and then they
applied local scanning to identify finer details, but needed another global
scan for final confirmation in the case of non-prototypical shapes, possibly
due to the current limitations of electrovibration technology in displaying
tactile stimuli to a user. We observed that it was highly difficult to follow
the edges of shapes and recognize shapes with more than five edges under
electrovibration when a single finger was used for exploration.
","[{'version': 'v1', 'created': 'Sun, 26 Dec 2021 22:33:46 GMT'}]",2021-12-28,"[['Sadia', 'Bushra', ''], ['Sadic', 'Ayberk', ''], ['Ayyildiz', 'Mehmet', ''], ['Basdogan', 'Cagatay', '']]","['Surface Haptics', 'Electrovibration', 'Exploration Strategies', 'Tactile Perception', 'Haptic']"
12237,2108.13679,Weizhi Wang,"Weizhi Wang, Zhirui Zhang, Junliang Guo, Yinpei Dai, Boxing Chen and
  Weihua Luo",Task-Oriented Dialogue System as Natural Language Generation,SIGIR 2022,,10.1145/3477495.3531920,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose to formulate the task-oriented dialogue system as
the purely natural language generation task, so as to fully leverage the
large-scale pre-trained models like GPT-2 and simplify complicated
delexicalization prepossessing. However, directly applying this method heavily
suffers from the dialogue entity inconsistency caused by the removal of
delexicalized tokens, as well as the catastrophic forgetting problem of the
pre-trained model during fine-tuning, leading to unsatisfactory performance. To
alleviate these problems, we design a novel GPT-Adapter-CopyNet network, which
incorporates the lightweight adapter and CopyNet modules into GPT-2 to achieve
better performance on transfer learning and dialogue entity generation.
Experimental results conducted on the DSTC8 Track 1 benchmark and MultiWOZ
dataset demonstrate that our proposed approach significantly outperforms
baseline models with a remarkable performance on automatic and human
evaluations.
","[{'version': 'v1', 'created': 'Tue, 31 Aug 2021 08:36:42 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Sep 2021 07:33:04 GMT'}, {'version': 'v3', 'created': 'Sun, 24 Apr 2022 12:30:31 GMT'}]",2022-04-26,"[['Wang', 'Weizhi', ''], ['Zhang', 'Zhirui', ''], ['Guo', 'Junliang', ''], ['Dai', 'Yinpei', ''], ['Chen', 'Boxing', ''], ['Luo', 'Weihua', '']]","['Task-oriented Dialogue System', 'Natural Language Generation', 'GPT']"
12238,1507.06353,Hidir Yuzuguzel,"Hidir Yuzuguzel, Jari Niemi, Serkan Kiranyaz, Moncef Gabbouj and
  Thomas Heinz",ShakeMe: Key Generation From Shared Motion,"The paper is accepted to the 13th IEEE International Conference on
  Pervasive Intelligence and Computing (PIComp-2015)",,10.1109/CIT/IUCC/DASC/PICOM.2015.316,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Devices equipped with accelerometer sensors such as today's mobile devices
can make use of motion to exchange information. A typical example for shared
motion is shaking of two devices which are held together in one hand. Deriving
a shared secret (key) from shared motion, e.g. for device pairing, is an
obvious application for this. Only the keys need to be exchanged between the
peers and neither the motion data nor the features extracted from it. This
makes the pairing fast and easy. For this, each device generates an information
signal (key) independently of each other and, in order to pair, they should be
identical. The key is essentially derived by quantizing certain well
discriminative features extracted from the accelerometer data after an implicit
synchronization. In this paper, we aim at finding a small set of effective
features which enable a significantly simpler quantization procedure than the
prior art. Our tentative results with authentic accelerometer data show that
this is possible with a competent accuracy ($76$%) and key strength (entropy
approximately $15$ bits).
","[{'version': 'v1', 'created': 'Wed, 22 Jul 2015 22:51:08 GMT'}, {'version': 'v2', 'created': 'Sun, 13 Sep 2015 18:38:13 GMT'}]",2016-11-18,"[['Yuzuguzel', 'Hidir', ''], ['Niemi', 'Jari', ''], ['Kiranyaz', 'Serkan', ''], ['Gabbouj', 'Moncef', ''], ['Heinz', 'Thomas', '']]","['accelerometer', 'feature extraction', 'quantization', 'information signal']"
12239,2004.02264,Kalikinkar Mandal,Kalikinkar Mandal and Guang Gong,"PrivFL: Practical Privacy-preserving Federated Regressions on
  High-dimensional Data over Mobile Networks","In Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing
  Security Workshop (CCSW'19)",,10.1145/3338466.3358926,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Federated Learning (FL) enables a large number of users to jointly learn a
shared machine learning (ML) model, coordinated by a centralized server, where
the data is distributed across multiple devices. This approach enables the
server or users to train and learn an ML model using gradient descent, while
keeping all the training data on users' devices. We consider training an ML
model over a mobile network where user dropout is a common phenomenon. Although
federated learning was aimed at reducing data privacy risks, the ML model
privacy has not received much attention.
  In this work, we present PrivFL, a privacy-preserving system for training
(predictive) linear and logistic regression models and oblivious predictions in
the federated setting, while guaranteeing data and model privacy as well as
ensuring robustness to users dropping out in the network. We design two
privacy-preserving protocols for training linear and logistic regression models
based on an additive homomorphic encryption (HE) scheme and an aggregation
protocol. Exploiting the training algorithm of federated learning, at the core
of our training protocols is a secure multiparty global gradient computation on
alive users' data. We analyze the security of our training protocols against
semi-honest adversaries. As long as the aggregation protocol is secure under
the aggregation privacy game and the additive HE scheme is semantically secure,
PrivFL guarantees the users' data privacy against the server, and the server's
regression model privacy against the users. We demonstrate the performance of
PrivFL on real-world datasets and show its applicability in the federated
learning system.
","[{'version': 'v1', 'created': 'Sun, 5 Apr 2020 17:43:13 GMT'}]",2020-04-07,"[['Mandal', 'Kalikinkar', ''], ['Gong', 'Guang', '']]","['Privacy-preserving computations', 'Predictive analysis', 'Federatedlearning', 'Machine learning']"
12240,2203.10830,Marcos Faundez-Zanuy,"Jiri Mekyska, Zdenek Smekal, Zoltan Galaz, Zdenek Mzourek, Irena
  Rektorova, Marcos Faundez-Zanuy, Karmele Lopez-De-Ipina","Perceptual Features as Markers of Parkinson's Disease: The Issue of
  Clinical Interpretability","8 pages, published in International Conference on NONLINEAR SPEECH
  PROCESSING, NOLISP 2015 jointly organized with the 25th Italian Workshop on
  Neural Networks, WIRN 2015, held at May 2015, Vietri sul Mare, Salerno, Italy","NOLISP 2015, In Recent Advances in Nonlinear Speech Processing.
  Smart Innovation, Systems and Technologies, vol 48. Springer, Cham",10.1007/978-3-319-28109-4_9,,cs.SD cs.LG eess.AS,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Up to 90% of patients with Parkinson's disease (PD) suffer from hypokinetic
dysathria (HD) which is also manifested in the field of phonation. Clinical
signs of HD like monoloudness, monopitch or hoarse voice are usually quantified
by conventional clinical interpretable features (jitter, shimmer,
harmonic-to-noise ratio, etc.). This paper provides large and robust insight
into perceptual analysis of 5 Czech vowels of 84 PD patients and proves that
despite the clinical inexplicability the perceptual features outperform the
conventional ones, especially in terms of discrimination power (classification
accuracy ACC = 92 %, sensitivity SEN = 93 %, specificity SPE = 92 %) and
partial correlation with clinical scores like UPDRS (Unified Parkinson's
disease rating scale), MMSE (Mini-mental state examination) or FOG (Freezing of
gait questionnaire), where p < 0.0001.
","[{'version': 'v1', 'created': 'Mon, 21 Mar 2022 09:46:48 GMT'}]",2022-03-22,"[['Mekyska', 'Jiri', ''], ['Smekal', 'Zdenek', ''], ['Galaz', 'Zoltan', ''], ['Mzourek', 'Zdenek', ''], ['Rektorova', 'Irena', ''], ['Faundez-Zanuy', 'Marcos', ''], ['Lopez-De-Ipina', 'Karmele', '']]","['perceptual features', 'perceptual analysis', 'Parkinson’s disease', 'hypokinetic dysarthria', 'speech processing']"
12241,2202.05684,Md Faizul Bari,"Md Faizul Bari, Parv Agrawal, Baibhab Chatterjee, and Shreyas Sen","Statistical Analysis Based Feature Selection Enhanced RF-PUF with >99.8%
  Accuracy on Unmodified Commodity Transmitters for IoT Physical Security","18 pages, 10 figures, we have made our dataset (used in this work)
  public and available at: https://github.com/SparcLab/Sparclab-RF-PUF-Dataset",,10.3389/felec.2022.856284,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Due to the diverse and mobile nature of the deployment environment, smart
commodity devices are vulnerable to various attacks which can grant
unauthorized access to a rogue device in a large, connected network.
Traditional digital signature-based authentication methods are vulnerable to
key recovery attacks, CSRF, etc. To circumvent this, RF-PUF had been proposed
as a promising alternative that utilizes the inherent nonidealities of the
devices as physical signatures. RF-PUF offers a robust authentication method
that is resilient to key-hacking methods due to the absence of secret key
requirements and does not require any additional circuitry on the transmitter
end, eliminating additional power, area, and computational burden. In this
work, for the first time, we analyze the effectiveness of RF-PUF on commodity
devices, purchased off-the-shelf, without any modifications whatsoever. Data
were collected from 30 Xbee S2C modules and released as a public dataset. A new
feature has been engineered through statistical property analysis. With a new
and robust feature set, it has been shown that 95% accuracy can be achieved
using only ~1.8 ms of test data, reaching >99.8% accuracy with more data and a
network of higher model capacity, without any assisting digital preamble. The
design space has been explored in detail and the effect of the wireless channel
has been determined. The performance of some popular ML algorithms has been
compared with the NN approach. A thorough investigation on various PUF
properties has been done and both intra and inter-PUF distances have been
calculated. With extensive testing of 41238000 cases, the detection probability
for RF-PUF for our data is found to be 0.9987, which, for the first time,
experimentally establishes RF-PUF as a strong authentication method. Finally,
the potential attack models and the robustness of RF-PUF against them have been
discussed.
","[{'version': 'v1', 'created': 'Tue, 18 Jan 2022 20:31:43 GMT'}]",2022-05-06,"[['Bari', 'Md Faizul', ''], ['Agrawal', 'Parv', ''], ['Chatterjee', 'Baibhab', ''], ['Sen', 'Shreyas', '']]","['IoT', 'machine learning', 'physical security', 'PUF', 'neural network (NN)', 'radio frequency', 'authentication', 'Xbee']"
12242,2104.14532,Bolu John Folayan Dr.,"Bolu John Folayan, Olubunmi Ajibade, Olubunmi Dipo-Adedoyin, Toyin
  Segun Onayinka, Toluwani Titilola Folayan","The Big Brother NaijaTV Reality Show as Coordinate of Media Functions
  and Dysfunctions",,Journal of Social Science ResearchVol 17(2021) ISSN: 2321-1091,10.24297/jssr.v17i.9015,,cs.MM,http://creativecommons.org/licenses/by/4.0/,"  The mass media play at least five basic functions which include news
dissemination, surveillance of the environment, correlation of the components
of the society, entertainment and transmission of social heritage. Sometimes,
disruptions and impairments do occur in the performance of these roles and some
of these basic functions become dysfunctions, which turn the media into
purveyor of negative values. The present study investigates how popular the
Nigerian TV reality show, Big Brother Naija BBN, is perceived by its viewers.
Three hundred heavy viewers of the program were surveyed from Lagos and Ede,
South-West Nigeria, and their opinions and attitudes were sought regarding, why
they like or dislike the program; the gratifications that those who like the
program derive and whether the BBN, as media content, is generally functional
or dysfunctional to the society. Sixty six per cent 66 33.7 of respondents like
the program because it entertains. Half of the respondents, 99 50.5 dislike
immoral aspects of the program. The viewers affirm that the eviction part of
the program was their highest form of gratification. Most respondents, despite
public outcry against the program, consider the program to be functional.
Findings reinforce the postulation that TV viewers are not passive consumers of
media contents.
","[{'version': 'v1', 'created': 'Thu, 29 Apr 2021 17:47:58 GMT'}]",2021-04-30,"[['Folayan', 'Bolu John', ''], ['Ajibade', 'Olubunmi', ''], ['Dipo-Adedoyin', 'Olubunmi', ''], ['Onayinka', 'Toyin Segun', ''], ['Folayan', 'Toluwani Titilola', '']]","['Coordinate', 'Edutainment', 'Media Functions', 'Media Dysfunctions', 'Gratifications']"
12243,1905.09645,Nantheera Anantrasirichai,"Nantheera Anantrasirichai, Rencheng Zheng, Ivan Selesnick, Alin Achim",Image Fusion via Sparse Regularization with Non-Convex Penalties,,,10.1016/j.patrec.2020.01.020,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The L1 norm regularized least squares method is often used for finding sparse
approximate solutions and is widely used in 1-D signal restoration. Basis
pursuit denoising (BPD) performs noise reduction in this way. However, the
shortcoming of using L1 norm regularization is the underestimation of the true
solution. Recently, a class of non-convex penalties have been proposed to
improve this situation. This kind of penalty function is non-convex itself, but
preserves the convexity property of the whole cost function. This approach has
been confirmed to offer good performance in 1-D signal denoising. This paper
demonstrates the aforementioned method to 2-D signals (images) and applies it
to multisensor image fusion. The problem is posed as an inverse one and a
corresponding cost function is judiciously designed to include two data
attachment terms. The whole cost function is proved to be convex upon suitably
choosing the non-convex penalty, so that the cost function minimization can be
tackled by convex optimization approaches, which comprise simple computations.
The performance of the proposed method is benchmarked against a number of
state-of-the-art image fusion techniques and superior performance is
demonstrated both visually and in terms of various assessment measures.
","[{'version': 'v1', 'created': 'Thu, 23 May 2019 13:33:26 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Dec 2019 16:43:43 GMT'}, {'version': 'v3', 'created': 'Wed, 29 Jan 2020 18:58:12 GMT'}]",2020-01-30,"[['Anantrasirichai', 'Nantheera', ''], ['Zheng', 'Rencheng', ''], ['Selesnick', 'Ivan', ''], ['Achim', 'Alin', '']]","['Sparse approximate solutions', 'non-convex penalties', 'cost function', 'imagefusion', 'convex optimization', 'multispectral image', 'noisy image', 'multifocus image']"
12244,1810.02550,Mostafa Zaman Chowdhury,"Shakil Ahmed, Mohammad Arif Hossain, and Mostafa Zaman Chowdhury","On Demand Cell Sectoring Based Fractional Frequency Reuse in Wireless
  Networks",,,10.1109/IFOST.2014.6991092,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a dynamic channel assigning along with dynamic cell sectoring
model has been proposed that focuses on the Fractional Frequency Reuse (FFR)
not only for interference mitigation but also for enhancement of overall system
capacity in wireless networks. We partition the cells in a cluster into two
part named centre user part (CUP) and edge user part (EUP). Instead of huge
traffic, there may be unoccupied channels in the EUPs of the cells. These
unoccupied channels of the EUPs can assist the excessive number of users if
these channels are assigned with proper interference management. If the number
of traffic of a cell surpasses the number of channels of the EUP, then the cell
assigns the channels from the EUP of other cells in the cluster. To alleviate
the interference, we propose a dynamic cell sectoring scheme. The scheme
sectors the EUP of the cell which assigns channels that the assigned channels
are provided to the sectored part where these channels receive negligible
interference. The performance analysis illustrates reduced call blocking
probability as well as better signal to interference plus noise ratio (SINR)
without sacrificing bandwidth utilization. Besides, the proposed model ensures
lower outage probability.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 07:32:15 GMT'}]",2018-10-08,"[['Ahmed', 'Shakil', ''], ['Hossain', 'Mohammad Arif', ''], ['Chowdhury', 'Mostafa Zaman', '']]","['Fractional Frequency Reuse (FFR)', 'Quality of Service (QoS)', 'dynamic channel assigning', 'dynamic cell sectoring']"
12245,2011.12767,John Paul Miranda,"John Paul P. Miranda, Jaymark A. Yambao, Jhon Asley M. Marcelo,
  Christopher Robert N. Gonzales, Vee-jay T. Mungcal","Towards the Development of 3D Engine Assembly Simulation Learning Module
  for Senior High School","13 pages, 10 figures","International Journal of Computing Sciences Research (ISSN print:
  2546-0552; ISSN online: 2546-115X) Vol. 5, No. 1, 2021",10.25147/ijcsr.2017.001.1.54,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  The focus of the study is to develop a 3D engine assembly simulation learning
module to address the lack of equipment in one senior high school in the
Philippines. The study used mixed-method to determine the considerations needed
in developing an application for educational use particularly among
laboratory/practical subjects like engine assembly. The study used ISO 25010
quality standards in evaluating the application(n=153 students and 3 ICT
experts).Results showed that the application is moderately acceptable(overall
mean = 3.52) under ISO 25010 quality standards. The study created an engine
simulation learning assembly in which teachers can use to augment their lesson.
The study also highlights the applicability of using 3D-related technologies
for practical and laboratory subjects particularly highly technical-related
subjects. Future studies may develop a similar application in the same context
using mobile and other emerging technology(i.e., Virtual Reality, Augmented
Reality) as well as making the content more customizable. Effectivity of the
system in an actual setting is also worth pursuing. The study highlighted the
potential use of 3D technology in a classroom setting.
","[{'version': 'v1', 'created': 'Thu, 19 Nov 2020 10:45:29 GMT'}]",2020-11-26,"[['Miranda', 'John Paul P.', ''], ['Yambao', 'Jaymark A.', ''], ['Marcelo', 'Jhon Asley M.', ''], ['Gonzales', 'Christopher Robert N.', ''], ['Mungcal', 'Vee-jay T.', '']]","['3D simulations', 'senior high school', 'specialized track', 'technical-vocational livelihood education', 'engine assembly', 'learning module    INTRODUCTION']"
12246,2101.03683,Carlo Godoy Jr,Carlo H. Godoy Jr,A Review of Game-based Mobile E-Learning Applications,10 pages,International Journal of Computing Sciences Research 2020,10.25147/ijcsr.2017.001.1.45,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  This study aims to review and get information on the different mobile game
applications and the possibility of being a supplementary tool for learning to
enhance and empower the e-Learning aspect of a Technical Education and Skills
Development Authority. It is reviewed to help in the development of the
eLearning department of TESDA. The study aims to facilitate the reorganization
of the E-learning program of TESDA by using a method called Game Based
Learning. To accomplish this target, different applications will be reviewed to
give an idea on how game-based learning is being used as a supplementary
learning tool for different subject areas. This paper will focus on TESDA
language Skills institute and Technical-Vocational program since there are a
lot of reviews for main subject areas but only few in this field. The database
to be used in the methodology is Google Scholar, inclusion and exclusion
criteria used is that article should be within the span of five years and
should be game based learning mobile applications. Will be selecting 4
applications as a representation since it is an informational review. No need
to indicate the other applications as this is just a basis for future studies.
Mobile games have such a powerful instructional potential, by which teaching
can be revolutionized, which output is acquiring the praise and judgment of
academic professionals and educators. After this review, future studies can be
made to support this study like reviewing from other databases like Web of
Science and Scopus to support the foundation made on this review. The review
will open further studies to help TESDA administrator in using mobile games as
a supplementary learning tool for their e-learning.
","[{'version': 'v1', 'created': 'Mon, 11 Jan 2021 03:00:18 GMT'}]",2021-01-12,"[['Godoy', 'Carlo H.', 'Jr']]","['e-learning', 'mobile game application', 'game-based learning', 'TESDA', 'language skills institute   INTRODUCTION']"
12247,2206.12811,Chenyang Wang,"Chenyang Wang, Yuanqing Yu, Weizhi Ma, Min Zhang, Chong Chen, Yiqun
  Liu, Shaoping Ma","Towards Representation Alignment and Uniformity in Collaborative
  Filtering",Accepted by KDD'2022,,10.1145/3534678.3539253,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Collaborative filtering (CF) plays a critical role in the development of
recommender systems. Most CF methods utilize an encoder to embed users and
items into the same representation space, and the Bayesian personalized ranking
(BPR) loss is usually adopted as the objective function to learn informative
encoders. Existing studies mainly focus on designing more powerful encoders
(e.g., graph neural network) to learn better representations. However, few
efforts have been devoted to investigating the desired properties of
representations in CF, which is important to understand the rationale of
existing CF methods and design new learning objectives. In this paper, we
measure the representation quality in CF from the perspective of alignment and
uniformity on the hypersphere. We first theoretically reveal the connection
between the BPR loss and these two properties. Then, we empirically analyze the
learning dynamics of typical CF methods in terms of quantified alignment and
uniformity, which shows that better alignment or uniformity both contribute to
higher recommendation performance. Based on the analyses results, a learning
objective that directly optimizes these two properties is proposed, named
DirectAU. We conduct extensive experiments on three public datasets, and the
proposed learning framework with a simple matrix factorization model leads to
significant performance improvements compared to state-of-the-art CF methods.
Our implementations are publicly available at
https://github.com/THUwangcy/DirectAU.
","[{'version': 'v1', 'created': 'Sun, 26 Jun 2022 07:32:53 GMT'}]",2022-06-28,"[['Wang', 'Chenyang', ''], ['Yu', 'Yuanqing', ''], ['Ma', 'Weizhi', ''], ['Zhang', 'Min', ''], ['Chen', 'Chong', ''], ['Liu', 'Yiqun', ''], ['Ma', 'Shaoping', '']]","['Recommender Systems', 'Collaborative Filtering', 'RepresentationLearning', 'Alignment and Uniformity']"
12248,1812.08756,Zhiling Long,"G. AlRegib, M. Deriche, Z. Long, H. Di, Z. Wang, Y. Alaudah, M.
  Shafiq, and M. Alfarraj","Subsurface structure analysis using computational interpretation and
  learning: A visual signal processing perspective",,,10.1109/MSP.2017.2785979,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding Earth's subsurface structures has been and continues to be an
essential component of various applications such as environmental monitoring,
carbon sequestration, and oil and gas exploration. By viewing the seismic
volumes that are generated through the processing of recorded seismic traces,
researchers were able to learn from applying advanced image processing and
computer vision algorithms to effectively analyze and understand Earth's
subsurface structures. In this paper, first, we summarize the recent advances
in this direction that relied heavily on the fields of image processing and
computer vision. Second, we discuss the challenges in seismic interpretation
and provide insights and some directions to address such challenges using
emerging machine learning algorithms.
","[{'version': 'v1', 'created': 'Thu, 20 Dec 2018 18:38:11 GMT'}]",2018-12-26,"[['AlRegib', 'G.', ''], ['Deriche', 'M.', ''], ['Long', 'Z.', ''], ['Di', 'H.', ''], ['Wang', 'Z.', ''], ['Alaudah', 'Y.', ''], ['Shafiq', 'M.', ''], ['Alfarraj', 'M.', '']]","['subsurface imaging and exploration', 'seismic interpretation', 'digital signal processing', 'machine learning', 'humanvisual system', 'visual analytics']"
12249,2107.00712,Manuel Rebol,"Manuel Rebol and Christian G\""utl and Krzysztof Pietroszek","Passing a Non-verbal Turing Test: Evaluating Gesture Animations
  Generated from Speech",,2021 IEEE Virtual Reality and 3D User Interfaces (VR),10.1109/VR50410.2021.00082,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  People communicate using both speech and non-verbal signals such as gestures,
face expression or body pose. Non-verbal signals impact the meaning of the
spoken utterance in an abundance of ways. An absence of non-verbal signals
impoverishes the process of communication. Yet, when users are represented as
avatars, it is difficult to translate non-verbal signals along with the speech
into the virtual world without specialized motion-capture hardware. In this
paper, we propose a novel, data-driven technique for generating gestures
directly from speech. Our approach is based on the application of Generative
Adversarial Neural Networks (GANs) to model the correlation rather than
causation between speech and gestures. This approach approximates neuroscience
findings on how non-verbal communication and speech are correlated. We create a
large dataset which consists of speech and corresponding gestures in a 3D human
pose format from which our model learns the speaker-specific correlation. We
evaluate the proposed technique in a user study that is inspired by the Turing
test. For the study, we animate the generated gestures on a virtual character.
We find that users are not able to distinguish between the generated and the
recorded gestures. Moreover, users are able to identify our synthesized
gestures as related or not related to a given utterance. Code and videos are
available at https://github.com/mrebol/Gestures-From-Speech
","[{'version': 'v1', 'created': 'Thu, 1 Jul 2021 19:38:43 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Aug 2021 20:03:52 GMT'}]",2021-08-24,"[['Rebol', 'Manuel', ''], ['Gütl', 'Christian', ''], ['Pietroszek', 'Krzysztof', '']]","['Gesture Animation', 'GAN', '3D Human Pose Estimation', 'Human Body Language', 'VR']"
12250,2007.14001,Hasara Maithree,"Hasara Maithree, Dilan Dinushka, Adeesha Wijayasiri",Change Detection Using Synthetic Aperture Radar Videos,,"AIRCC Publishing Corporation, Volume 10, Number 10, July 2020",10.5121/csit.2020.101011,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many researches have been carried out for change detection using temporal SAR
images. In this paper an algorithm for change detection using SAR videos has
been proposed. There are various challenges related to SAR videos such as high
level of speckle noise, rotation of SAR image frames of the video around a
particular axis due to the circular movement of airborne vehicle, non-uniform
back scattering of SAR pulses. Hence conventional change detection algorithms
used for optical videos and SAR temporal images cannot be directly utilized for
SAR videos. We propose an algorithm which is a combination of optical flow
calculation using Lucas Kanade (LK) method and blob detection. The developed
method follows a four steps approach: image filtering and enhancement, applying
LK method, blob analysis and combining LK method with blob analysis. The
performance of the developed approach was tested on SAR videos available on
Sandia National Laboratories website and SAR videos generated by a SAR
simulator.
","[{'version': 'v1', 'created': 'Tue, 28 Jul 2020 05:53:10 GMT'}]",2020-07-29,"[['Maithree', 'Hasara', ''], ['Dinushka', 'Dilan', ''], ['Wijayasiri', 'Adeesha', '']]","['Remote Sensing', 'SAR videos', 'Change Detection']"
12251,2301.10947,Jon McCormack,Nina Rajcic and Jon McCormack,Message Ritual: A Posthuman Account of Living with Lamp,"Paper accepted for CHI2023, Hamburg, Germany April 23-28, 2023",,10.1145/3544548.3581363,,cs.HC cs.AI cs.NE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  As we become increasingly entangled with digital technologies, the boundary
between human and machine is progressively blurring. Adopting a performative,
posthumanist perspective resolves this ambiguity by proposing that such
boundaries are not predetermined, rather they are enacted within a certain
material configuration. Using this approach, dubbed `Entanglement HCI', this
paper presents \emph{Message Ritual} -- a novel, integrated AI system that
encourages the re-framing of memory through machine generated poetics. Embodied
within a domestic table lamp, the system listens in on conversations occurring
within the home, drawing out key topics and phrases of the day and
reconstituting them through machine generated poetry, delivered to household
members via SMS upon waking each morning. Participants across four households
were asked to live with the lamp over a two week period. We present a
diffractive analysis exploring how the lamp \emph{becomes with} participants
and discuss the implications of this method for future HCI research.
","[{'version': 'v1', 'created': 'Thu, 26 Jan 2023 05:53:51 GMT'}]",2023-01-27,"[['Rajcic', 'Nina', ''], ['McCormack', 'Jon', '']]","['Augmented memory', 'posthumanism', 'narrative', 'poetry', 'generativenetworks', 'diffractive analysis']"
12252,1906.11485,Moritz Schubotz,"Andre Greiner-Petter, Moritz Schubotz, Howard S. Cohl and Bela Gipp","Semantic Preserving Bijective Mappings for Expressions involving Special
  Functions in Computer Algebra Systems and Document Preparation Systems","This work was supported by the German Research Foundation (DFG, grant
  GI-1259-1)",,10.1108/AJIM-08-2018-0185,,cs.DL cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose: Modern mathematicians and scientists of math-related disciplines
often use Document Preparation Systems (DPS) to write and Computer Algebra
Systems (CAS) to calculate mathematical expressions. Usually, they translate
the expressions manually between DPS and CAS. This process is time-consuming
and error-prone. Our goal is to automate this translation. This paper uses
Maple and Mathematica as the CAS, and LaTeX as our DPS.
  Design/methodology/approach: Bruce Miller at the National Institute of
Standards and Technology (NIST) developed a collection of special LaTeX macros
that create links from mathematical symbols to their definitions in the NIST
Digital Library of Mathematical Functions (DLMF). We are using these macros to
perform rule-based translations between the formulae in the DLMF and CAS.
Moreover, we develop software to ease the creation of new rules and to discover
inconsistencies.
  Findings: We created 396 mappings and translated 58.8% of DLMF formulae
(2,405 expressions) successfully between Maple and DLMF. For a significant
percentage, the special function definitions in Maple and the DLMF were
different. Therefore, an atomic symbol in one system maps to a composite
expression in the other system. The translator was also successfully used for
automatic verification of mathematical online compendia and CAS. Our evaluation
techniques discovered two errors in the DLMF and one defect in Maple.
  Originality: This paper introduces the first translation tool for special
functions between LaTeX and CAS. The approach improves error-prone manual
translations and can be used to verify mathematical online compendia and CAS.
","[{'version': 'v1', 'created': 'Thu, 27 Jun 2019 08:08:09 GMT'}]",2019-06-28,"[['Greiner-Petter', 'Andre', ''], ['Schubotz', 'Moritz', ''], ['Cohl', 'Howard S.', ''], ['Gipp', 'Bela', '']]","['LATEX', 'Computer Algebra System (CAS)', 'Document Preparation System (D2P)', 'Translation', 'Presentation to Computation (P2C)', 'Special Functions']"
12253,2012.01044,Sebastian Bullinger,"Sebastian Bullinger, Christoph Bodensteiner, Michael Arens","A Photogrammetry-based Framework to Facilitate Image-based Modeling and
  Automatic Camera Tracking",,"In Proceedings of the 16th International Joint Conference on
  Computer Vision, Imaging and Computer Graphics Theory and Applications -
  Volume 1: GRAPP, 106-112, 2021",10.5220/0010319801060112,,cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a framework that extends Blender to exploit Structure from Motion
(SfM) and Multi-View Stereo (MVS) techniques for image-based modeling tasks
such as sculpting or camera and motion tracking. Applying SfM allows us to
determine camera motions without manually defining feature tracks or
calibrating the cameras used to capture the image data. With MVS we are able to
automatically compute dense scene models, which is not feasible with the
built-in tools of Blender. Currently, our framework supports several
state-of-the-art SfM and MVS pipelines. The modular system design enables us to
integrate further approaches without additional effort. The framework is
publicly available as an open source software package.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2020 09:26:37 GMT'}]",2021-04-06,"[['Bullinger', 'Sebastian', ''], ['Bodensteiner', 'Christoph', ''], ['Arens', 'Michael', '']]","['Image-based Modelling', 'Camera Tracking', 'Photogrammetry', 'Structure from Motion', 'Multi-view Stereo', 'Blender']"
12254,2111.02524,Chinmaya Kumar Dehury Dr.,"Chinmaya Kumar Dehury, Pelle Jakovits, Satish Narayana Srirama,
  Giorgos Giotis, Gaurav Garg",TOSCAdata: Modelling data pipeline applications in TOSCA,"This is accepted (In Press, Journal Pre-proof version) by JSS-SI on
  Software Architecture and Artificial Intelligence",,10.1016/j.jss.2021.111164,,cs.DC cs.SE,http://creativecommons.org/licenses/by/4.0/,"  The serverless platform allows a customer to effectively use cloud resources
and pay for the exact amount of used resources. A number of dedicated open
source and commercial cloud data management tools are available to handle the
massive amount of data. Such modern cloud data management tools are not enough
matured to integrate the generic cloud application with the serverless platform
due to the lack of mature and stable standards. One of the most popular and
mature standards, TOSCA (Topology and Orchestration Specification for Cloud
Applications), mainly focuses on application and service portability and
automated management of the generic cloud application components. This paper
proposes the extension of the TOSCA standard, TOSCAdata, that focuses on the
modeling of data pipeline-based cloud applications. Keeping the requirements of
modern data pipeline cloud applications, TOSCAdata provides a number of TOSCA
models that are independently deployable, schedulable, scalable, and re-usable,
while effectively handling the flow and transformation of data in a pipeline
manner. We also demonstrate the applicability of proposed TOSCAdata models by
taking a web-based cloud application in the context of tourism promotion as a
use case scenario.
","[{'version': 'v1', 'created': 'Wed, 3 Nov 2021 21:13:45 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Dec 2021 09:04:30 GMT'}]",2021-12-21,"[['Dehury', 'Chinmaya Kumar', ''], ['Jakovits', 'Pelle', ''], ['Srirama', 'Satish Narayana', ''], ['Giotis', 'Giorgos', ''], ['Garg', 'Gaurav', '']]","['Data Pipeline', 'data flow management', 'serverless computing', 'datamigration', 'TOSCA', 'DevOps']"
12255,1402.0068,V Karthikeyan VKK,V.Karthikeyan and V.J.Vijayalakshmi,Radiation Pattern of Patch Antenna with Slits,6 pages and 7 figures,,10.5121/ijit.2014.3101,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Microstrip antenna has been commercially used in many applications, such
as direct broadcast satellite service, mobile satellite communications, global
positioning system, medical hyperthermia usage, etc. The patch antenna of the
size reduction at a given operating frequency is obtained. Mobile personal
communication systems and wireless computer networks are most commonly used
nowadays and they are in need of antennas in different frequency bands. In
regulate to without difficulty incorporate these antennas into individual
systems, a micro strip scrap transmitter have been preferred and intended for a
convinced divergence. There is also an analysis of radiation pattern, Gain of
the antenna, Directivity of the antenna, Electric Far Field. The simulations
results are obtained by using electromagnetic simulation software called feko
software are presented and discussed
","[{'version': 'v1', 'created': 'Sat, 1 Feb 2014 10:01:39 GMT'}]",2014-02-04,"[['Karthikeyan', 'V.', ''], ['Vijayalakshmi', 'V. J.', '']]","['Microstrip', 'patch', 'antenna', 'slit Directivity of the antenna', 'Electric Far Field']"
12256,2109.10020,Chin-Chia Michael Yeh,"Chin-Chia Michael Yeh, Zhongfang Zhuang, Junpeng Wang, Yan Zheng,
  Javid Ebrahimi, Ryan Mercer, Liang Wang, Wei Zhang","Online Multi-horizon Transaction Metric Estimation with Multi-modal
  Learning in Payment Networks",10 pages,,10.1145/3459637.3481942,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predicting metrics associated with entities' transnational behavior within
payment processing networks is essential for system monitoring. Multivariate
time series, aggregated from the past transaction history, can provide valuable
insights for such prediction. The general multivariate time series prediction
problem has been well studied and applied across several domains, including
manufacturing, medical, and entomology. However, new domain-related challenges
associated with the data such as concept drift and multi-modality have surfaced
in addition to the real-time requirements of handling the payment transaction
data at scale. In this work, we study the problem of multivariate time series
prediction for estimating transaction metrics associated with entities in the
payment transaction database. We propose a model with five unique components to
estimate the transaction metrics from multi-modality data. Four of these
components capture interaction, temporal, scale, and shape perspectives, and
the fifth component fuses these perspectives together. We also propose a hybrid
offline/online training scheme to address concept drift in the data and fulfill
the real-time requirements. Combining the estimation model with a graphical
user interface, the prototype transaction metric estimation system has
demonstrated its potential benefit as a tool for improving a payment processing
company's system monitoring capability.
","[{'version': 'v1', 'created': 'Tue, 21 Sep 2021 08:23:27 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Sep 2021 04:41:55 GMT'}]",2021-09-23,"[['Yeh', 'Chin-Chia Michael', ''], ['Zhuang', 'Zhongfang', ''], ['Wang', 'Junpeng', ''], ['Zheng', 'Yan', ''], ['Ebrahimi', 'Javid', ''], ['Mercer', 'Ryan', ''], ['Wang', 'Liang', ''], ['Zhang', 'Wei', '']]","['financial technology', 'time series', 'online learning', 'regression']"
12257,2002.06001,Fabricio Breve,Fabricio Breve,"Building Networks for Image Segmentation using Particle Competition and
  Cooperation",,"BREVE, FA. Building Networks for Image Segmentation Using Particle
  Competition and Cooperation. Lecture Notes in Computer Science. Cham:
  Springer International Publishing AG, 2017. v.10404. p.217 - 231",10.1007/978-3-319-62392-4_16,,cs.CV cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Particle competition and cooperation (PCC) is a graph-based semi-supervised
learning approach. When PCC is applied to interactive image segmentation tasks,
pixels are converted into network nodes, and each node is connected to its
k-nearest neighbors, according to the distance between a set of features
extracted from the image. Building a proper network to feed PCC is crucial to
achieve good segmentation results. However, some features may be more important
than others to identify the segments, depending on the characteristics of the
image to be segmented. In this paper, an index to evaluate candidate networks
is proposed. Thus, building the network becomes a problem of optimizing some
feature weights based on the proposed index. Computer simulations are performed
on some real-world images from the Microsoft GrabCut database, and the
segmentation results related in this paper show the effectiveness of the
proposed method.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 12:45:12 GMT'}]",2020-02-17,"[['Breve', 'Fabricio', '']]","['particle competition and cooperation', 'image segmentation', 'complex networks']"
12258,1912.12533,Ozan Ciga,"Ozan Ciga, Anne L. Martel",Learning to segment images with classification labels,"Published on Elsevier, Medical Image Analysis","Medical Image Analysis, Volume 68, 2021, 101912, ISSN 1361-8415",10.1016/j.media.2020.101912,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two of the most common tasks in medical imaging are classification and
segmentation. Either task requires labeled data annotated by experts, which is
scarce and expensive to collect. Annotating data for segmentation is generally
considered to be more laborious as the annotator has to draw around the
boundaries of regions of interest, as opposed to assigning image patches a
class label. Furthermore, in tasks such as breast cancer histopathology, any
realistic clinical application often includes working with whole slide images,
whereas most publicly available training data are in the form of image patches,
which are given a class label. We propose an architecture that can alleviate
the requirements for segmentation-level ground truth by making use of
image-level labels to reduce the amount of time spent on data curation. In
addition, this architecture can help unlock the potential of previously
acquired image-level datasets on segmentation tasks by annotating a small
number of regions of interest. In our experiments, we show using only one
segmentation-level annotation per class, we can achieve performance comparable
to a fully annotated dataset.
","[{'version': 'v1', 'created': 'Sat, 28 Dec 2019 22:01:39 GMT'}, {'version': 'v2', 'created': 'Sun, 29 Nov 2020 19:56:32 GMT'}]",2020-12-01,"[['Ciga', 'Ozan', ''], ['Martel', 'Anne L.', '']]","['Weakly supervised learning', 'digital histopathology', 'whole slide images', 'image segmentation']"
12259,2007.02265,Meiqi Zhu,"Xiao Wang, Meiqi Zhu, Deyu Bo, Peng Cui, Chuan Shi, Jian Pei",AM-GCN: Adaptive Multi-channel Graph Convolutional Networks,"11 pages, KDD2020",,10.1145/3394486.3403177,,cs.LG cs.SI eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph Convolutional Networks (GCNs) have gained great popularity in tackling
various analytics tasks on graph and network data. However, some recent studies
raise concerns about whether GCNs can optimally integrate node features and
topological structures in a complex graph with rich information. In this paper,
we first present an experimental investigation. Surprisingly, our experimental
results clearly show that the capability of the state-of-the-art GCNs in fusing
node features and topological structures is distant from optimal or even
satisfactory. The weakness may severely hinder the capability of GCNs in some
classification tasks, since GCNs may not be able to adaptively learn some deep
correlation information between topological structures and node features. Can
we remedy the weakness and design a new type of GCNs that can retain the
advantages of the state-of-the-art GCNs and, at the same time, enhance the
capability of fusing topological structures and node features substantially? We
tackle the challenge and propose an adaptive multi-channel graph convolutional
networks for semi-supervised classification (AM-GCN). The central idea is that
we extract the specific and common embeddings from node features, topological
structures, and their combinations simultaneously, and use the attention
mechanism to learn adaptive importance weights of the embeddings. Our extensive
experiments on benchmark data sets clearly show that AM-GCN extracts the most
correlated information from both node features and topological structures
substantially, and improves the classification accuracy with a clear margin.
","[{'version': 'v1', 'created': 'Sun, 5 Jul 2020 08:16:03 GMT'}, {'version': 'v2', 'created': 'Sat, 11 Jul 2020 03:23:47 GMT'}]",2020-07-14,"[['Wang', 'Xiao', ''], ['Zhu', 'Meiqi', ''], ['Bo', 'Deyu', ''], ['Cui', 'Peng', ''], ['Shi', 'Chuan', ''], ['Pei', 'Jian', '']]","['Graph convolutional networks', 'network representation learning', 'deep learning']"
12260,2208.02630,Johan Lin{\aa}ker,"Johan Lin{\aa}ker, Bj\""orn Regnell","A Contribution Management Framework for Firms Engaged in Open Source
  Software Ecosystems -- A Research Preview",,,10.1007/978-3-319-54045-0_4,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Context and motivation: Contribution Management helps firms engaged in Open
Source Software (OSS) ecosystems to motivate what they should contribute and
when, but also what they should focus their resources on and to what extent.
Such guidelines are also referred to as contribution strategies. The motivation
for developing tailored contribution strategies is to maximize return on
investment and sustain the influence needed in the ecosystem. Question/Problem:
We aim to develop a framework to help firms understand their current situation
and create a starting point to develop an effective contribution management
process. Principal ideas/results: Through a design science approach, a
prototype framework is created based on literature and validated iteratively
with expert opinions through interviews. Contribution: In this research
preview, we present our initial results after our first design cycle and
consultation with one experienced OSS manager at a large OSS oriented
software-intensive firm. The initial validation highlights importance of
stakeholder identification and analysis, as well as the general need for
contribution management and alignment with internal product planning. This
encourages future work to develop the framework further using expert and case
validation.
","[{'version': 'v1', 'created': 'Sun, 31 Jul 2022 20:14:04 GMT'}]",2022-08-05,"[['Linåker', 'Johan', ''], ['Regnell', 'Björn', '']]","['requirements engineering', 'open source', 'software ecosystem', 'open innovation', 'co-opetition', 'scoping', 'contribution strategy', 'contribution management']"
12261,1906.10877,Volodymyr Sokolov,Volodymyr Buriachok and Volodymyr Sokolov and Pavlo Skladannyi,Security Rating Metrics for Distributed Wireless Systems,,"Mathematics. Information Technologies. Education (MoMLeT&DS), 2019",10.5281/zenodo.3256219,,cs.CR cs.PF,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The paper examines quantitative assessment of wireless distribution system
security, as well as an assessment of risks from attacks and security
violations. Furthermore, it describes typical security breach and formal attack
models and five methods for assessing security. The proposed normalized method
for assessing the degree of security assurance operates with at least three
characteristics, which allows comparatively analyze heterogeneous information
systems. The improved calculating formulas have been proposed for two security
assessment methods, and the elements of functional-cost analysis have been
applied to calculate the degree of security. To check the results of the
analysis, the coefficient of concordance was calculated, which gives
opportunity to determine the quality of expert assessment. The simultaneous use
of several models to describe attacks and the effectiveness of countering them
allows us to create a comprehensive approach to countering modern security
threats to information networks at the commercial enterprises and critical
infrastructure facilities.
","[{'version': 'v1', 'created': 'Wed, 26 Jun 2019 07:19:23 GMT'}]",2019-06-27,"[['Buriachok', 'Volodymyr', ''], ['Sokolov', 'Volodymyr', ''], ['Skladannyi', 'Pavlo', '']]","['Immunity', 'Risk', 'Security', 'Threat', 'Function Cost Analysis']"
12262,2105.02559,Blair Archibald,"Blair Archibald, Muffy Calder, Michele Sevegnani",Probablistic Bigraphs,"20 pages, 15 figures",,10.1145/3545180,,cs.LO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Bigraphs are a universal computational modelling formalism for the spatial
and temporal evolution of a system in which entities can be added and removed.
We extend bigraphs to probablistic bigraphs, and then again to action bigraphs,
which include non-determinism and rewards. The extensions are implemented in
the BigraphER toolkit and illustrated through examples of virus spread in
computer networks and data harvesting in wireless sensor systems. BigraphER
also supports the existing stochastic bigraphs extension of Krivine et al., and
using BigraphER we give, for the first time, a direct implementation of the
membrane budding model used to motivate stochastic bigraphs.
","[{'version': 'v1', 'created': 'Thu, 6 May 2021 10:13:41 GMT'}]",2022-06-28,"[['Archibald', 'Blair', ''], ['Calder', 'Muffy', ''], ['Sevegnani', 'Michele', '']]","['Bigraphs', 'Probabilistic bigraphical reactive systems', 'Discrete Time Markov Chains', 'MarkovDecision Processes']"
12263,2009.12795,Thierry Denoeux,Thierry Denoeux,NN-EVCLUS: Neural Network-based Evidential Clustering,,"Information Sciences, Volume 572, Pages 297-330, 2021",10.1016/j.ins.2021.05.011,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evidential clustering is an approach to clustering based on the use of
Dempster-Shafer mass functions to represent cluster-membership uncertainty. In
this paper, we introduce a neural-network based evidential clustering
algorithm, called NN-EVCLUS, which learns a mapping from attribute vectors to
mass functions, in such a way that more similar inputs are mapped to output
mass functions with a lower degree of conflict. The neural network can be
paired with a one-class support vector machine to make it robust to outliers
and allow for novelty detection. The network is trained to minimize the
discrepancy between dissimilarities and degrees of conflict for all or some
object pairs. Additional terms can be added to the loss function to account for
pairwise constraints or labeled data, which can also be used to adapt the
metric. Comparative experiments show the superiority of N-EVCLUS over
state-of-the-art evidential clustering algorithms for a range of unsupervised
and constrained clustering tasks involving both attribute and dissimilarity
data.
","[{'version': 'v1', 'created': 'Sun, 27 Sep 2020 09:05:41 GMT'}, {'version': 'v2', 'created': 'Thu, 27 May 2021 01:56:10 GMT'}]",2021-05-28,"[['Denoeux', 'Thierry', '']]","['Dempster-Shafer theory', 'evidence theory', 'belief functions', 'unsupervised learning', 'semi-supervised learning', 'constrained clustering']"
12264,2104.02741,Thomas Schrefl,"Alexander Kovacs, Lukas Exl, Alexander Kornell, Johann Fischbacher,
  Markus Hovorka, Markus Gusenbauer, Leoni Breth, Harald Oezelt, Masao Yano,
  Noritsugu Sakuma, Akihito Kinoshita, Tetsuya Shoji, Akira Kato, Thomas
  Schrefl",Conditional physics informed neural networks,"18 pages, 11 figures",,10.1016/j.cnsns.2021.106041,,cs.LG cond-mat.mtrl-sci,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce conditional PINNs (physics informed neural networks) for
estimating the solution of classes of eigenvalue problems. The concept of PINNs
is expanded to learn not only the solution of one particular differential
equation but the solutions to a class of problems. We demonstrate this idea by
estimating the coercive field of permanent magnets which depends on the width
and strength of local defects. When the neural network incorporates the physics
of magnetization reversal, training can be achieved in an unsupervised way.
There is no need to generate labeled training data. The presented test cases
have been rigorously studied in the past. Thus, a detailed and easy comparison
with analytical solutions is made. We show that a single deep neural network
can learn the solution of partial differential equations for an entire class of
problems.
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2021 18:29:14 GMT'}]",2021-10-04,"[['Kovacs', 'Alexander', ''], ['Exl', 'Lukas', ''], ['Kornell', 'Alexander', ''], ['Fischbacher', 'Johann', ''], ['Hovorka', 'Markus', ''], ['Gusenbauer', 'Markus', ''], ['Breth', 'Leoni', ''], ['Oezelt', 'Harald', ''], ['Yano', 'Masao', ''], ['Sakuma', 'Noritsugu', ''], ['Kinoshita', 'Akihito', ''], ['Shoji', 'Tetsuya', ''], ['Kato', 'Akira', ''], ['Schrefl', 'Thomas', '']]","['micromagnetics', 'neural network', 'Ritz method']"
12265,1411.0217,Raka Jovanovic,"Raka Jovanovic, Sabre Kais, Fahhad H. Alharbi","Cuckoo Search Inspired Hybridization of the Nelder-Mead Simplex
  Algorithm Applied to Optimization of Photovoltaic Cells",,,10.18576/amis/100314,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new hybridization of the Cuckoo Search (CS) is developed and applied to
optimize multi-cell solar systems; namely multi-junction and split spectrum
cells. The new approach consists of combining the CS with the Nelder-Mead
method. More precisely, instead of using single solutions as nests for the CS,
we use the concept of a simplex which is used in the Nelder-Mead algorithm.
This makes it possible to use the flip operation introduces in the Nelder-Mead
algorithm instead of the Levy flight which is a standard part of the CS. In
this way, the hybridized algorithm becomes more robust and less sensitive to
parameter tuning which exists in CS. The goal of our work was to optimize the
performance of multi-cell solar systems. Although the underlying problem
consists of the minimization of a function of a relatively small number of
parameters, the difficulty comes from the fact that the evaluation of the
function is complex and only a small number of evaluations is possible. In our
test, we show that the new method has a better performance when compared to
similar but more compex hybridizations of Nelder-Mead algorithm using genetic
algorithms or particle swarm optimization on standard benchmark functions.
Finally, we show that the new method outperforms some standard meta-heuristics
for the problem of interest.
","[{'version': 'v1', 'created': 'Sun, 2 Nov 2014 07:47:26 GMT'}]",2016-08-31,"[['Jovanovic', 'Raka', ''], ['Kais', 'Sabre', ''], ['Alharbi', 'Fahhad H.', '']]","['Cuckoo search', 'Nelder-Mead Simplex', 'cascaded optimization', 'multi-cell solarsystems', 'multi-junction solar cells', 'split spectrum solar cell system']"
12266,1706.10217,Thierry Chateau Pr,"Ala Mhalla and Thierry Chateau and Houda Maamatou and Sami Gazzah and
  Najoua Essoukri Ben Amara",SMC Faster R-CNN: Toward a scene-specialized multi-object detector,,,10.1016/j.cviu.2017.06.008,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generally, the performance of a generic detector decreases significantly when
it is tested on a specific scene due to the large variation between the source
training dataset and the samples from the target scene. To solve this problem,
we propose a new formalism of transfer learning based on the theory of a
Sequential Monte Carlo (SMC) filter to automatically specialize a
scene-specific Faster R-CNN detector. The suggested framework uses different
strategies based on the SMC filter steps to approximate iteratively the target
distribution as a set of samples in order to specialize the Faster R-CNN
detector towards a target scene. Moreover, we put forward a likelihood function
that combines spatio-temporal information extracted from the target video
sequence and the confidence-score given by the output layer of the Faster
R-CNN, to favor the selection of target samples associated with the right
label. The effectiveness of the suggested framework is demonstrated through
experiments on several public traffic datasets. Compared with the
state-of-the-art specialization frameworks, the proposed framework presents
encouraging results for both single and multi-traffic object detections.
","[{'version': 'v1', 'created': 'Fri, 30 Jun 2017 14:31:12 GMT'}]",2017-07-14,"[['Mhalla', 'Ala', ''], ['Chateau', 'Thierry', ''], ['Maamatou', 'Houda', ''], ['Gazzah', 'Sami', ''], ['Amara', 'Najoua Essoukri Ben', '']]","['Transfer learning', 'Deep learning', 'Specialization', 'Faster R-CNN', 'Sequential Monte Carlo filter', 'Traffic object detection']"
12267,2112.15421,Ad\'in Ram\'irez Rivera,Thalles Silva and Ad\'in Ram\'irez Rivera,Representation Learning via Consistent Assignment of Views to Clusters,"Pre-print. 37th ACM/SIGAPP Symposium on Applied Computing (SAC'22).
  Code at https://gitlab.com/mipl/carl/",,10.1145/3477314.3507267,,cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  We introduce Consistent Assignment for Representation Learning (CARL), an
unsupervised learning method to learn visual representations by combining ideas
from self-supervised contrastive learning and deep clustering. By viewing
contrastive learning from a clustering perspective, CARL learns unsupervised
representations by learning a set of general prototypes that serve as energy
anchors to enforce different views of a given image to be assigned to the same
prototype. Unlike contemporary work on contrastive learning with deep
clustering, CARL proposes to learn the set of general prototypes in an online
fashion, using gradient descent without the necessity of using
non-differentiable algorithms or K-Means to solve the cluster assignment
problem. CARL surpasses its competitors in many representations learning
benchmarks, including linear evaluation, semi-supervised learning, and transfer
learning.
","[{'version': 'v1', 'created': 'Fri, 31 Dec 2021 12:59:23 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Mar 2022 08:16:07 GMT'}]",2022-03-17,"[['Silva', 'Thalles', ''], ['Rivera', 'Adín Ramírez', '']]","['Contrastive learning', 'learning through clustering', 'representationlearning']"
12268,2207.09051,Menglin Yang,"Menglin Yang, Zhihao Li, Min Zhou, Jiahong Liu, Irwin King",HICF: Hyperbolic Informative Collaborative Filtering,"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery
  and Data Mining (KDD '22)",,10.1145/3534678.3539475,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Considering the prevalence of the power-law distribution in user-item
networks, hyperbolic space has attracted considerable attention and achieved
impressive performance in the recommender system recently. The advantage of
hyperbolic recommendation lies in that its exponentially increasing capacity is
well-suited to describe the power-law distributed user-item network whereas the
Euclidean equivalent is deficient. Nonetheless, it remains unclear which kinds
of items can be effectively recommended by the hyperbolic model and which
cannot. To address the above concerns, we take the most basic recommendation
technique, collaborative filtering, as a medium, to investigate the behaviors
of hyperbolic and Euclidean recommendation models. The results reveal that (1)
tail items get more emphasis in hyperbolic space than that in Euclidean space,
but there is still ample room for improvement; (2) head items receive modest
attention in hyperbolic space, which could be considerably improved; (3) and
nonetheless, the hyperbolic models show more competitive performance than
Euclidean models. Driven by the above observations, we design a novel learning
method, named hyperbolic informative collaborative filtering (HICF), aiming to
compensate for the recommendation effectiveness of the head item while at the
same time improving the performance of the tail item. The main idea is to adapt
the hyperbolic margin ranking learning, making its pull and push procedure
geometric-aware, and providing informative guidance for the learning of both
head and tail items. Extensive experiments back up the analytic findings and
also show the effectiveness of the proposed method. The work is valuable for
personalized recommendations since it reveals that the hyperbolic space
facilitates modeling the tail item, which often represents user-customized
preferences or new products.
","[{'version': 'v1', 'created': 'Tue, 19 Jul 2022 03:45:38 GMT'}]",2022-07-20,"[['Yang', 'Menglin', ''], ['Li', 'Zhihao', ''], ['Zhou', 'Min', ''], ['Liu', 'Jiahong', ''], ['King', 'Irwin', '']]","['Recommender system', 'collaborative filtering', 'hyperbolic space', 'personalized recommendation', 'graph neural network']"
12269,2202.04307,Jihoon Kim,"Jihoon Kim, Taehyun Byun, Seungyoun Shin, Jungdam Won, Sungjoon Choi",Conditional Motion In-betweening,,"Pattern Recognition, Volume 132, December 2022, 108894",10.1016/j.patcog.2022.108894,,cs.CV cs.AI cs.GR,http://creativecommons.org/licenses/by/4.0/,"  Motion in-betweening (MIB) is a process of generating intermediate skeletal
movement between the given start and target poses while preserving the
naturalness of the motion, such as periodic footstep motion while walking.
Although state-of-the-art MIB methods are capable of producing plausible
motions given sparse key-poses, they often lack the controllability to generate
motions satisfying the semantic contexts required in practical applications. We
focus on the method that can handle pose or semantic conditioned MIB tasks
using a unified model. We also present a motion augmentation method to improve
the quality of pose-conditioned motion generation via defining a distribution
over smooth trajectories. Our proposed method outperforms the existing
state-of-the-art MIB method in pose prediction errors while providing
additional controllability.
","[{'version': 'v1', 'created': 'Wed, 9 Feb 2022 06:47:56 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Oct 2022 05:14:05 GMT'}]",2022-10-07,"[['Kim', 'Jihoon', ''], ['Byun', 'Taehyun', ''], ['Shin', 'Seungyoun', ''], ['Won', 'Jungdam', ''], ['Choi', 'Sungjoon', '']]","['motion in-betweening', 'conditional motion generation', 'generative model', 'motion data augmentation']"
12270,1902.05333,Johann Knechtel,Johann Knechtel and Satwik Patnaik and Ozgur Sinanoglu,Protect Your Chip Design Intellectual Property: An Overview,"INTERNATIONAL CONFERENCE ON OMNI-LAYER INTELLIGENT SYSTEMS (COINS),
  May 5--7, 2019, Crete, Greece; 6 pages, 3 figures, 1 table; [v2]: minor edits
  and update references, as in camera copy for COINS; [v3]: added ACM reference
  format and CCS concepts, minor edits",,10.1145/3312614.3312657,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing cost of integrated circuit (IC) fabrication has driven most
companies to ""go fabless"" over time. The corresponding outsourcing trend gave
rise to various attack vectors, e.g., illegal overproduction of ICs, piracy of
the design intellectual property (IP), or insertion of hardware Trojans (HTs).
These attacks are possibly conducted by untrusted entities residing all over
the supply chain, ranging from untrusted foundries, test facilities, even to
end-users. To overcome this multitude of threats, various techniques have been
proposed over the past decade. In this paper, we review the landscape of IP
protection techniques, which can be classified into logic locking, layout
camouflaging, and split manufacturing. We discuss the history of these
techniques, followed by state-of-the-art advancements, relevant limitations,
and scope for future work.
","[{'version': 'v1', 'created': 'Thu, 14 Feb 2019 12:56:33 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Feb 2019 07:38:30 GMT'}, {'version': 'v3', 'created': 'Sun, 24 Feb 2019 12:59:20 GMT'}]",2019-02-26,"[['Knechtel', 'Johann', ''], ['Patnaik', 'Satwik', ''], ['Sinanoglu', 'Ozgur', '']]","['Logic Locking', 'Layout Camouflaging', 'Split Manufacturing']"
12271,1810.03470,Mostafa Zaman Chowdhury,"Mostafa Zaman Chowdhury, Tuan Nguyena, Young-Il Kimb, Won Ryub, and
  Yeong Min Jang",Bandwidth Adaptation for Scalable Videos over Wireless Networks,arXiv admin note: substantial text overlap with arXiv:1412.3628,,10.1109/ICUFN.2012.6261739,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multicast/broadcast services (MBS) are able to provide video services for
many users simultaneously. Fixed amount of bandwidth allocation for all of the
MBS videos is not effective in terms of bandwidth utilization, overall forced
call termination probability, and handover call dropping probability.
Therefore, variable bandwidth allocation for the MBS videos can efficiently
improve the system performance. In this paper, we propose a bandwidth
allocation scheme that efficiently allocates bandwidth among the MBS sessions
and the non-MBS traffic calls (e.g., voice, unicast, internet, and other
background traffic). The proposed scheme reduces the bandwidth allocation for
the MBS sessions during the congested traffic condition only to accommodate
more number of calls in the system. Our scheme allocates variable amount of
bandwidths for the BMS sessions and the non-MBS traffic calls. The performance
analyses show that the proposed bandwidth adaptation scheme maximizes the
bandwidth utilization and significantly reduces the handover call dropping
probability and overall forced call termination probability.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 02:00:45 GMT'}]",2018-12-27,"[['Chowdhury', 'Mostafa Zaman', ''], ['Nguyena', 'Tuan', ''], ['Kimb', 'Young-Il', ''], ['Ryub', 'Won', ''], ['Jang', 'Yeong Min', '']]","['QoS', 'bandwidth allocation', 'video session', 'call dropping probability', 'MBS', 'scalable video', 'bandwidth utilization']"
12272,2110.02316,Stanis{\l}aw Ka\'zmierczak,"Stanis{\l}aw Ka\'zmierczak, Zofia Juszka, Vaska Vandevska-Radunovic,
  Thomas JJ Maal, Piotr Fudalej, Jacek Ma\'ndziuk",Prediction of the Facial Growth Direction is Challenging,,"International Conference on Neural Information Processing, ICONIP
  2021, CCIS 1517, 665-673",10.1007/978-3-030-92310-5_77,,cs.CV cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Facial dysmorphology or malocclusion is frequently associated with abnormal
growth of the face. The ability to predict facial growth (FG) direction would
allow clinicians to prepare individualized therapy to increase the chance for
successful treatment. Prediction of FG direction is a novel problem in the
machine learning (ML) domain. In this paper, we perform feature selection and
point the attribute that plays a central role in the abovementioned problem.
Then we successfully apply data augmentation (DA) methods and improve the
previously reported classification accuracy by 2.81%. Finally, we present the
results of two experienced clinicians that were asked to solve a similar task
to ours and show how tough is solving this problem for human experts.
","[{'version': 'v1', 'created': 'Tue, 28 Sep 2021 20:22:01 GMT'}]",2022-08-16,"[['Kaźmierczak', 'Stanisław', ''], ['Juszka', 'Zofia', ''], ['Vandevska-Radunovic', 'Vaska', ''], ['Maal', 'Thomas JJ', ''], ['Fudalej', 'Piotr', ''], ['Mańdziuk', 'Jacek', '']]","['Orthodontics', 'Facial growth prediction', 'Neural networks', 'Dataaugmentation']"
12273,1909.04032,Christian Reul,"Christian Reul, Dennis Christ, Alexander Hartelt, Nico Balbach,
  Maximilian Wehner, Uwe Springmann, Christoph Wick, Christine Grundig, Andreas
  B\""uttner, Frank Puppe","OCR4all -- An Open-Source Tool Providing a (Semi-)Automatic OCR Workflow
  for Historical Printings",submitted to MDPI - Applied Sciences,https://www.mdpi.com/2076-3417/9/22/4853/htm,10.3390/app9224853,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optical Character Recognition (OCR) on historical printings is a challenging
task mainly due to the complexity of the layout and the highly variant
typography. Nevertheless, in the last few years great progress has been made in
the area of historical OCR, resulting in several powerful open-source tools for
preprocessing, layout recognition and segmentation, character recognition and
post-processing. The drawback of these tools often is their limited
applicability by non-technical users like humanist scholars and in particular
the combined use of several tools in a workflow. In this paper we present an
open-source OCR software called OCR4all, which combines state-of-the-art OCR
components and continuous model training into a comprehensive workflow. A
comfortable GUI allows error corrections not only in the final output, but
already in early stages to minimize error propagations. Further on, extensive
configuration capabilities are provided to set the degree of automation of the
workflow and to make adaptations to the carefully selected default parameters
for specific printings, if necessary. Experiments showed that users with
minimal or no experience were able to capture the text of even the earliest
printed books with manageable effort and great quality, achieving excellent
character error rates (CERs) below 0.5%. The fully automated application on
19th century novels showed that OCR4all can considerably outperform the
commercial state-of-the-art tool ABBYY Finereader on moderate layouts if
suitably pretrained mixed OCR models are available. The architecture of OCR4all
allows the easy integration (or substitution) of newly developed tools for its
main components by standardized interfaces like PageXML, thus aiming at
continual higher automation for historical printings.
","[{'version': 'v1', 'created': 'Mon, 9 Sep 2019 11:15:40 GMT'}]",2021-06-01,"[['Reul', 'Christian', ''], ['Christ', 'Dennis', ''], ['Hartelt', 'Alexander', ''], ['Balbach', 'Nico', ''], ['Wehner', 'Maximilian', ''], ['Springmann', 'Uwe', ''], ['Wick', 'Christoph', ''], ['Grundig', 'Christine', ''], ['Büttner', 'Andreas', ''], ['Puppe', 'Frank', '']]","['Optical Character Recognition', 'Document Analysis', 'Historical Printings']"
12274,2107.10147,Thilo Krachenfels,"Thilo Krachenfels, Jean-Pierre Seifert, Shahin Tajik","Trojan Awakener: Detecting Dormant Malicious Hardware Using Laser Logic
  State Imaging","This is the author's version of the work. It is posted here for your
  personal use. Not for redistribution. The definitive Version of Record was
  published in Proceedings of the 5th Workshop on Attacks and Solutions in
  Hardware Security (ASHES '21)",,10.1145/3474376.3487282,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The threat of hardware Trojans (HTs) and their detection is a widely studied
field. While the effort for inserting a Trojan into an application-specific
integrated circuit (ASIC) can be considered relatively high, especially when
trusting the chip manufacturer, programmable hardware is vulnerable to Trojan
insertion even after the product has been shipped or during usage. At the same
time, detecting dormant HTs with small or zero-overhead triggers and payloads
on these platforms is still a challenging task, as the Trojan might not get
activated during the chip verification using logical testing or physical
measurements. In this work, we present a novel Trojan detection approach based
on a technique known from integrated circuit (IC) failure analysis, capable of
detecting virtually all classes of dormant Trojans. Using laser logic state
imaging (LLSI), we show how supply voltage modulations can awaken inactive
Trojans, making them detectable using laser voltage imaging techniques.
Therefore, our technique does not require triggering the Trojan. To support our
claims, we present two case studies on 28 nm SRAM- and flash-based
field-programmable gate arrays (FPGAs). We demonstrate how to detect with high
confidence small changes in sequential and combinatorial logic as well as in
the routing configuration of FPGAs in a non-invasive manner. Finally, we
discuss the practical applicability of our approach on dormant analog Trojans
in ASICs.
","[{'version': 'v1', 'created': 'Wed, 21 Jul 2021 15:23:53 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Jul 2021 15:25:01 GMT'}, {'version': 'v3', 'created': 'Fri, 23 Jul 2021 18:27:21 GMT'}, {'version': 'v4', 'created': 'Sat, 18 Sep 2021 14:28:16 GMT'}]",2021-09-21,"[['Krachenfels', 'Thilo', ''], ['Seifert', 'Jean-Pierre', ''], ['Tajik', 'Shahin', '']]","['Hardware security', 'Hardware Trojans', 'Optical side-channels', 'Hardware snapshots', 'LLSI']"
12275,1703.10328,Debayan Das,"Debayan Das, Shovan Maity, Saad Bin Nasir, Santosh Ghosh, Arijit
  Raychowdhury, Shreyas Sen","High Efficiency Power Side-Channel Attack Immunity using Noise Injection
  in Attenuated Signature Domain","IEEE International Symposium on Hardware Oriented Security and Trust
  (HOST) 2017",,10.1109/HST.2017.7951799,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the advancement of technology in the last few decades, leading to the
widespread availability of miniaturized sensors and internet-connected things
(IoT), security of electronic devices has become a top priority. Side-channel
attack (SCA) is one of the prominent methods to break the security of an
encryption system by exploiting the information leaked from the physical
devices. Correlational power attack (CPA) is an efficient power side-channel
attack technique, which analyses the correlation between the estimated and
measured supply current traces to extract the secret key. The existing
countermeasures to the power attacks are mainly based on reducing the SNR of
the leaked data, or introducing large overhead using techniques like power
balancing. This paper presents an attenuated signature AES (AS-AES), which
resists SCA with minimal noise current overhead. AS-AES uses a shunt
low-drop-out (LDO) regulator to suppress the AES current signature by 400x in
the supply current traces. The shunt LDO has been fabricated and validated in
130 nm CMOS technology. System-level implementation of the AS-AES along with
noise injection, shows that the system remains secure even after 50K
encryptions, with 10x reduction in power overhead compared to that of noise
addition alone.
","[{'version': 'v1', 'created': 'Thu, 30 Mar 2017 06:35:15 GMT'}, {'version': 'v2', 'created': 'Mon, 8 May 2017 22:07:40 GMT'}]",2018-02-14,"[['Das', 'Debayan', ''], ['Maity', 'Shovan', ''], ['Nasir', 'Saad Bin', ''], ['Ghosh', 'Santosh', ''], ['Raychowdhury', 'Arijit', ''], ['Sen', 'Shreyas', '']]","['Side Channel Attack (SCA)', 'Cryptographic Hardware', 'Power Analysis Attack', 'Countermeasure', 'Attenuated Signature AES', 'Shunt LDO', 'Noise Injection']"
12276,2301.08525,Fabian Eitel,"Fabian Eitel, Marc-Andr\'e Schulz, Moritz Seiler, Henrik Walter,
  Kerstin Ritter","Promises and pitfalls of deep neural networks in neuroimaging-based
  psychiatric research",,,10.1016/j.expneurol.2021.113608,,cs.LG eess.IV q-bio.NC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  By promising more accurate diagnostics and individual treatment
recommendations, deep neural networks and in particular convolutional neural
networks have advanced to a powerful tool in medical imaging. Here, we first
give an introduction into methodological key concepts and resulting
methodological promises including representation and transfer learning, as well
as modelling domain-specific priors. After reviewing recent applications within
neuroimaging-based psychiatric research, such as the diagnosis of psychiatric
diseases, delineation of disease subtypes, normative modeling, and the
development of neuroimaging biomarkers, we discuss current challenges. This
includes for example the difficulty of training models on small, heterogeneous
and biased data sets, the lack of validity of clinical labels, algorithmic
bias, and the influence of confounding variables.
","[{'version': 'v1', 'created': 'Fri, 20 Jan 2023 12:05:59 GMT'}]",2023-01-23,"[['Eitel', 'Fabian', ''], ['Schulz', 'Marc-André', ''], ['Seiler', 'Moritz', ''], ['Walter', 'Henrik', ''], ['Ritter', 'Kerstin', '']]","['Deep learning', 'Convolutional Neural Networks', 'Psychiatry', 'Neuroimaging', 'MRI']"
12277,2011.02887,Diego Kozlowski,"Diego Kozlowski, Jennifer Dusdal, Jun Pang and Andreas Zilian","Semantic and Relational Spaces in Science of Science: Deep Learning
  Models for Article Vectorisation",,"Scientometrics 126, 2021",10.1007/s11192-021-03984-1,,cs.SI cs.LG physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  Over the last century, we observe a steady and exponentially growth of
scientific publications globally. The overwhelming amount of available
literature makes a holistic analysis of the research within a field and between
fields based on manual inspection impossible. Automatic techniques to support
the process of literature review are required to find the epistemic and social
patterns that are embedded in scientific publications. In computer sciences,
new tools have been developed to deal with large volumes of data. In
particular, deep learning techniques open the possibility of automated
end-to-end models to project observations to a new, low-dimensional space where
the most relevant information of each observation is highlighted. Using deep
learning to build new representations of scientific publications is a growing
but still emerging field of research. The aim of this paper is to discuss the
potential and limits of deep learning for gathering insights about scientific
research articles. We focus on document-level embeddings based on the semantic
and relational aspects of articles, using Natural Language Processing (NLP) and
Graph Neural Networks (GNNs). We explore the different outcomes generated by
those techniques. Our results show that using NLP we can encode a semantic
space of articles, while with GNN we are able to build a relational space where
the social practices of a research community are also encoded.
","[{'version': 'v1', 'created': 'Thu, 5 Nov 2020 14:57:41 GMT'}]",2022-03-09,"[['Kozlowski', 'Diego', ''], ['Dusdal', 'Jennifer', ''], ['Pang', 'Jun', ''], ['Zilian', 'Andreas', '']]","['Embeddings', 'Science of Science', 'Deep Learning', 'Graph NeuralNetworks', 'Semantic Space', 'Relational Space']"
12278,2005.14308,Muhammad Naseer Bajwa,"Muhammad Naseer Bajwa, Yoshinobu Taniguchi, Muhammad Imran Malik,
  Wolfgang Neumeier, Andreas Dengel, Sheraz Ahmed","Combining Fine- and Coarse-Grained Classifiers for Diabetic Retinopathy
  Detection","Pages 12, Figures 5",,10.1007/978-3-030-39343-4_21,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visual artefacts of early diabetic retinopathy in retinal fundus images are
usually small in size, inconspicuous, and scattered all over retina. Detecting
diabetic retinopathy requires physicians to look at the whole image and fixate
on some specific regions to locate potential biomarkers of the disease.
Therefore, getting inspiration from ophthalmologist, we propose to combine
coarse-grained classifiers that detect discriminating features from the whole
images, with a recent breed of fine-grained classifiers that discover and pay
particular attention to pathologically significant regions. To evaluate the
performance of this proposed ensemble, we used publicly available EyePACS and
Messidor datasets. Extensive experimentation for binary, ternary and quaternary
classification shows that this ensemble largely outperforms individual image
classifiers as well as most of the published works in most training setups for
diabetic retinopathy detection. Furthermore, the performance of fine-grained
classifiers is found notably superior than coarse-grained image classifiers
encouraging the development of task-oriented fine-grained classifiers modelled
after specialist ophthalmologists.
","[{'version': 'v1', 'created': 'Thu, 28 May 2020 21:37:36 GMT'}]",2020-06-01,"[['Bajwa', 'Muhammad Naseer', ''], ['Taniguchi', 'Yoshinobu', ''], ['Malik', 'Muhammad Imran', ''], ['Neumeier', 'Wolfgang', ''], ['Dengel', 'Andreas', ''], ['Ahmed', 'Sheraz', '']]","['Computer-Aided Diagnosis', 'Medical Image Analysis', 'Automated Diabetic Retinopathy Detection', 'Convolutional Neural Network', 'Deep Learning in Ophthalmology']"
12279,2001.11590,Thanh Pham Dinh,"Pham Dinh Thanh, Huynh Thi Thanh Binh, Bui Thu Lam","New mechanism of combination crossover operators in genetic algorithm
  for solving the traveling salesman problem",The final publication is available at link.springer.com,,10.1007/978-3-319-11680-8_29,,cs.NE cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Traveling salesman problem (TSP) is a well-known in computing field. There
are many researches to improve the genetic algorithm for solving TSP. In this
paper, we propose two new crossover operators and new mechanism of combination
crossover operators in genetic algorithm for solving TSP. We experimented on
TSP instances from TSP-Lib and compared the results of proposed algorithm with
genetic algorithm (GA), which used MSCX. Experimental results show that, our
proposed algorithm is better than the GA using MSCX on the min, mean cost
values.
","[{'version': 'v1', 'created': 'Tue, 14 Jan 2020 13:20:44 GMT'}]",2020-02-03,"[['Thanh', 'Pham Dinh', ''], ['Binh', 'Huynh Thi Thanh', ''], ['Lam', 'Bui Thu', '']]","['Traveling Salesman Problem', 'Genetic Algorithm', 'ModifiedSequential Constructive Crossover']"
12280,2002.04521,Jiri Vlasak,"Jiri Vlasak, Michal Sojka and Zden\v{e}k Hanz\'alek",Accelerated RRT* and its evaluation on Autonomous Parking,"12 pages, 6 figures, 3 pseudocodes, VEHITS 2019 conference
  proceedings","Proceedings of the 5th International Conference on Vehicle
  Technology and Intelligent Transport Systems - Volume 1: VEHITS, pages 86-94.
  INSTICC, SciTePress, 2019",10.5220/0007679500860094,,cs.RO,http://creativecommons.org/licenses/by-sa/4.0/,"  Finding a collision-free path for autonomous parking is usually performed by
computing geometric equations, but the geometric approach may become unusable
under challenging situations where space is highly constrained. We propose an
algorithm based on Rapidly-Exploring Random Trees Star (RRT*), which works even
in highly constrained environments and improvements to RRT*-based algorithm
that accelerate computational time and decrease the final path cost. Our
improved RRT* algorithm found a path for parallel parking maneuver in 95 % of
cases in less than 0.15 seconds.
","[{'version': 'v1', 'created': 'Tue, 11 Feb 2020 16:23:26 GMT'}]",2020-02-12,"[['Vlasak', 'Jiri', ''], ['Sojka', 'Michal', ''], ['Hanzálek', 'Zdeněk', '']]","['Autonomous parking', 'Rapidly-ExploringRandom Trees', 'Reeds and Shepp steering', 'Dijkstraoptimization', 'Nearest neighbor heuristics']"
12281,1802.02673,Tomer Weiss,"Tomer Weiss, Alan Litteneker, Chenfanfu Jiang, Demetri Terzopoulos","Position-Based Multi-Agent Dynamics for Real-Time Crowd Simulation (MiG
  paper)",9 pages,"MIG 2017 Proceedings of the Tenth International Conference on
  Motion in Games",10.1145/3136457.3136462,,cs.GR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Exploiting the efficiency and stability of Position-Based Dynamics (PBD), we
introduce a novel crowd simulation method that runs at interactive rates for
hundreds of thousands of agents. Our method enables the detailed modeling of
per-agent behavior in a Lagrangian formulation. We model short-range and
long-range collision avoidance to simulate both sparse and dense crowds. On the
particles representing agents, we formulate a set of positional constraints
that can be readily integrated into a standard PBD solver. We augment the
tentative particle motions with planning velocities to determine the preferred
velocities of agents, and project the positions onto the constraint manifold to
eliminate colliding configurations. The local short-range interaction is
represented with collision and frictional contact between agents, as in the
discrete simulation of granular materials. We incorporate a cohesion model for
modeling collective behaviors and propose a new constraint for dealing with
potential future collisions. Our new method is suitable for use in interactive
games.
","[{'version': 'v1', 'created': 'Wed, 7 Feb 2018 23:37:20 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Feb 2018 01:58:15 GMT'}]",2018-02-21,"[['Weiss', 'Tomer', ''], ['Litteneker', 'Alan', ''], ['Jiang', 'Chenfanfu', ''], ['Terzopoulos', 'Demetri', '']]","['position-based dynamics', 'crowd simulation', 'collision avoidance']"
12282,2201.00329,Kilian Wenker,Kilian Wenker,A Systematic Literature Review on Persuasive Technology at the Workplace,"14 pages, 2 figures","Patterns, Volume 3, Issue 8, 100545, 2022",10.1016/j.patter.2022.100545,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Employees face decisions every day - in the absence of supervision. The
outcome of these decisions can be influenced by digital workplace design
through the power of persuasive technology. This paper provides a structured
literature review based on recent research on persuasive technology in the
workplace. It examines the design and use of persuasive systems from a variety
of disciplinary perspectives and theories. The reviewed studies were
categorized into the research streams of technology design, user-centered
research, and gamification. The purpose of the studies is categorized using a
modified definition of the persuasive systems design model. A number of
experimental studies show that alignment of the employee's behavior with the
employer's agenda can be achieved. A robust finding is the key role of
interactivity in granting employees a subjective experience of rapid and
meaningful feedback when using the interface.
","[{'version': 'v1', 'created': 'Sun, 2 Jan 2022 10:07:38 GMT'}]",2022-08-15,"[['Wenker', 'Kilian', '']]","['persuasive technology', 'human-computer interaction (HCI)', 'behavioral change', 'digital workplace design', 'gamification']"
12283,1307.0679,Maurizio Gabbrielli,"Maurizio Gabbrielli, Maria Chiara Meo, Paolo Tacchella and Herbert
  Wiklicky",Unfolding for CHR programs,49 pages,Theory and Practice of Logic Programming 15 (2015) 264-311,10.1017/S1471068413000288,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Program transformation is an appealing technique which allows to improve
run-time efficiency, space-consumption, and more generally to optimize a given
program. Essentially, it consists of a sequence of syntactic program
manipulations which preserves some kind of semantic equivalence. Unfolding is
one of the basic operations which is used by most program transformation
systems and which consists in the replacement of a procedure call by its
definition. While there is a large body of literature on transformation and
unfolding of sequential programs, very few papers have addressed this issue for
concurrent languages.
  This paper defines an unfolding system for CHR programs. We define an
unfolding rule, show its correctness and discuss some conditions which can be
used to delete an unfolded rule while preserving the program meaning. We also
prove that, under some suitable conditions, confluence and termination are
preserved by the above transformation.
  To appear in Theory and Practice of Logic Programming (TPLP)
","[{'version': 'v1', 'created': 'Tue, 2 Jul 2013 10:55:24 GMT'}]",2020-02-19,"[['Gabbrielli', 'Maurizio', ''], ['Meo', 'Maria Chiara', ''], ['Tacchella', 'Paolo', ''], ['Wiklicky', 'Herbert', '']]","['CHR (Constraint Handling Rules)', 'Program Transformation', 'Unfolding', 'Confluence', 'Termination']"
12284,1709.00308,Chee Seng Chan,"John E. Ball, Derek T. Anderson, Chee Seng Chan","A Comprehensive Survey of Deep Learning in Remote Sensing: Theories,
  Tools and Challenges for the Community","64 pages, 411 references. To appear in Journal of Applied Remote
  Sensing",J. Appl. Remote Sens. 11(4) (2017) 042609,10.1117/1.JRS.11.042609,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, deep learning (DL), a re-branding of neural networks (NNs),
has risen to the top in numerous areas, namely computer vision (CV), speech
recognition, natural language processing, etc. Whereas remote sensing (RS)
possesses a number of unique challenges, primarily related to sensors and
applications, inevitably RS draws from many of the same theories as CV; e.g.,
statistics, fusion, and machine learning, to name a few. This means that the RS
community should be aware of, if not at the leading edge of, of advancements
like DL. Herein, we provide the most comprehensive survey of state-of-the-art
RS DL research. We also review recent new developments in the DL field that can
be used in DL for RS. Namely, we focus on theories, tools and challenges for
the RS community. Specifically, we focus on unsolved challenges and
opportunities as it relates to (i) inadequate data sets, (ii)
human-understandable solutions for modelling physical phenomena, (iii) Big
Data, (iv) non-traditional heterogeneous data sources, (v) DL architectures and
learning algorithms for spectral, spatial and temporal data, (vi) transfer
learning, (vii) an improved theoretical understanding of DL systems, (viii)
high barriers to entry, and (ix) training and optimizing the DL.
","[{'version': 'v1', 'created': 'Fri, 1 Sep 2017 13:40:35 GMT'}, {'version': 'v2', 'created': 'Sun, 24 Sep 2017 06:11:30 GMT'}]",2017-11-01,"[['Ball', 'John E.', ''], ['Anderson', 'Derek T.', ''], ['Chan', 'Chee Seng', '']]","['Remote Sensing', 'Deep Learning', 'Hyperspectral', 'Multispectral', 'Big Data', 'Computer Vision']"
12285,2101.09163,Aidong Yang,"Ye Ouyang (1), Lilei Wang (1), Aidong Yang (1), Maulik Shah (2), David
  Belanger (3 and 4), Tongqing Gao (5), Leping Wei (6), Yaqin Zhang (7) ((1)
  AsiaInfo Technologies, (2) Verizon, (3) AT&T, (4) Stevens Institute of
  Technology, (5) China Mobile, (6) China Telecom, (7) Tsinghua University)",The Next Decade of Telecommunications Artificial Intelligence,"50 pages in English 24 figures. (Note version 5 is 19 pages, in
  Chinese, with 24 figures)","CAAI Artificial Intelligence Research, 2022, 1 (1): 28-53",10.26599/AIR.2022.9150003,,cs.NI cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It has been an exciting journey since the mobile communications and
artificial intelligence were conceived 37 years and 64 years ago. While both
fields evolved independently and profoundly changed communications and
computing industries, the rapid convergence of 5G and deep learning is
beginning to significantly transform the core communication infrastructure,
network management and vertical applications. The paper first outlines the
individual roadmaps of mobile communications and artificial intelligence in the
early stage, with a concentration to review the era from 3G to 5G when AI and
mobile communications started to converge. With regard to telecommunications
artificial intelligence, the paper further introduces in detail the progress of
artificial intelligence in the ecosystem of mobile communications. The paper
then summarizes the classifications of AI in telecom ecosystems along with its
evolution paths specified by various international telecommunications
standardization bodies. Towards the next decade, the paper forecasts the
prospective roadmap of telecommunications artificial intelligence. In line with
3GPP and ITU-R timeline of 5G & 6G, the paper further explores the network
intelligence following 3GPP and ORAN routes respectively, experience and
intention driven network management and operation, network AI signalling
system, intelligent middle-office based BSS, intelligent customer experience
management and policy control driven by BSS and OSS convergence, evolution from
SLA to ELA, and intelligent private network for verticals. The paper is
concluded with the vision that AI will reshape the future B5G or 6G landscape
and we need pivot our R&D, standardizations, and ecosystem to fully take the
unprecedented opportunities.
","[{'version': 'v1', 'created': 'Tue, 19 Jan 2021 07:33:44 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Jan 2021 02:25:23 GMT'}, {'version': 'v3', 'created': 'Mon, 22 Feb 2021 10:19:47 GMT'}, {'version': 'v4', 'created': 'Mon, 1 Mar 2021 14:41:49 GMT'}, {'version': 'v5', 'created': 'Thu, 2 Dec 2021 02:25:55 GMT'}, {'version': 'v6', 'created': 'Fri, 3 Dec 2021 02:18:41 GMT'}]",2022-10-11,"[['Ouyang', 'Ye', '', '3 and 4'], ['Wang', 'Lilei', '', '3 and 4'], ['Yang', 'Aidong', '', '3 and 4'], ['Shah', 'Maulik', '', '3 and 4'], ['Belanger', 'David', '', '3 and 4'], ['Gao', 'Tongqing', ''], ['Wei', 'Leping', ''], ['Zhang', 'Yaqin', '']]","['such as ""Artificial Intelligence""', '""Machine Learning""', '""Deep Learning""', 'etc. increases 6']"
12286,2007.02813,David Carrera,"Aaron Call, Jord\`a Polo, David Carrera, Francesc Guim, Sujoy Sen","Disaggregating Non-Volatile Memory for Throughput-Oriented Genomics
  Workloads","Partially funded by European Research Council (ERC) under the
  European Union's Horizon 2020 research and innovation programme (grant
  agreement No 639595) - HiEST Project Published Euro-Par 2018: Euro-Par 2018:
  Parallel Processing Workshops pp 613-625",Euro-Par 2018: Euro-Par 2018: Parallel Processing Workshops,10.1007/978-3-030-10549-5_48,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Massive exploitation of next-generation sequencing technologies requires
dealing with both: huge amounts of data and complex bioinformatics pipelines.
Computing architectures have evolved to deal with these problems, enabling
approaches that were unfeasible years ago: accelerators and Non-Volatile
Memories (NVM) are becoming widely used to enhance the most demanding
workloads. However, bioinformatics workloads are usually part of bigger
pipelines with different and dynamic needs in terms of resources. The
introduction of Software Defined Infrastructures (SDI) for data centers
provides roots to dramatically increase the efficiency in the management of
infrastructures. SDI enables new ways to structure hardware resources through
disaggregation, and provides new hardware composability and sharing mechanisms
to deploy workloads in more flexible ways. In this paper we study a
state-of-the-art genomics application, SMUFIN, aiming to address the challenges
of future HPC facilities.
","[{'version': 'v1', 'created': 'Mon, 6 Jul 2020 15:16:21 GMT'}]",2020-07-07,"[['Call', 'Aaron', ''], ['Polo', 'Jordà', ''], ['Carrera', 'David', ''], ['Guim', 'Francesc', ''], ['Sen', 'Sujoy', '']]","['Genomics', 'Disaggregation', 'Composability', 'NVM', 'NVMeOF', 'Characterization', 'Orchestration']"
12287,2212.02100,Wei Xing,"Shuo Yin, Guohao Dai, Wei W. Xing","High-Dimensional Yield Estimation using Shrinkage Deep Features and
  Maximization of Integral Entropy Reduction",,"ASPDAC 2023, January, Tokyo, Japan",10.1145/3566097.3567907,,cs.CE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the fast advances in high-sigma yield analysis with the help of
machine learning techniques in the past decade, one of the main challenges, the
curse of dimensionality, which is inevitable when dealing with modern
large-scale circuits, remains unsolved. To resolve this challenge, we propose
an absolute shrinkage deep kernel learning, ASDK, which automatically
identifies the dominant process variation parameters in a nonlinear-correlated
deep kernel and acts as a surrogate model to emulate the expensive SPICE
simulation. To further improve the yield estimation efficiency, we propose a
novel maximization of approximated entropy reduction for an efficient model
update, which is also enhanced with parallel batch sampling for parallel
computing, making it ready for practical deployment. Experiments on SRAM column
circuits demonstrate the superiority of ASDK over the state-of-the-art (SOTA)
approaches in terms of accuracy and efficiency with up to 10.3x speedup over
SOTA methods.
","[{'version': 'v1', 'created': 'Mon, 5 Dec 2022 08:39:41 GMT'}]",2022-12-06,"[['Yin', 'Shuo', ''], ['Dai', 'Guohao', ''], ['Xing', 'Wei W.', '']]","['Yield Analysis', 'Bayesian Optimization', 'Failure Probability']"
12288,2012.06280,"Robert M\""uller","Robert M\""uller, Steffen Illium, Fabian Ritz, Tobias Schr\""oder,
  Christian Platschek, J\""org Ochs, Claudia Linnhoff-Popien",Acoustic Leak Detection in Water Networks,"ICAART 2021, 8 pages, 4 figures, 1 table",,10.5220/0010295403060313,,cs.LG cs.SD eess.AS,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this work, we present a general procedure for acoustic leak detection in
water networks that satisfies multiple real-world constraints such as energy
efficiency and ease of deployment. Based on recordings from seven contact
microphones attached to the water supply network of a municipal suburb, we
trained several shallow and deep anomaly detection models. Inspired by how
human experts detect leaks using electronic sounding-sticks, we use these
models to repeatedly listen for leaks over a predefined decision horizon. This
way we avoid constant monitoring of the system. While we found the detection of
leaks in close proximity to be a trivial task for almost all models, neural
network based approaches achieve better results at the detection of distant
leaks.
","[{'version': 'v1', 'created': 'Fri, 11 Dec 2020 12:24:15 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Jan 2021 11:21:02 GMT'}]",2021-02-19,"[['Müller', 'Robert', ''], ['Illium', 'Steffen', ''], ['Ritz', 'Fabian', ''], ['Schröder', 'Tobias', ''], ['Platschek', 'Christian', ''], ['Ochs', 'Jörg', ''], ['Linnhoff-Popien', 'Claudia', '']]","['Leak Detection', 'Water Networks', 'Acoustic Anomaly Detection', 'Applied Machine Learning']"
12289,2204.09108,Sarah Alnegheimish,"Sarah Alnegheimish, Dongyu Liu, Carles Sala, Laure Berti-Equille,
  Kalyan Veeramachaneni",Sintel: A Machine Learning Framework to Extract Insights from Signals,"This work is accepted by ACM SIGMOD/PODS International Conference on
  Management of Data (SIGMOD 2022)",,10.1145/3514221.3517910,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The detection of anomalies in time series data is a critical task with many
monitoring applications. Existing systems often fail to encompass an end-to-end
detection process, to facilitate comparative analysis of various anomaly
detection methods, or to incorporate human knowledge to refine output. This
precludes current methods from being used in real-world settings by
practitioners who are not ML experts. In this paper, we introduce Sintel, a
machine learning framework for end-to-end time series tasks such as anomaly
detection. The framework uses state-of-the-art approaches to support all steps
of the anomaly detection process. Sintel logs the entire anomaly detection
journey, providing detailed documentation of anomalies over time. It enables
users to analyze signals, compare methods, and investigate anomalies through an
interactive visualization tool, where they can annotate, modify, create, and
remove events. Using these annotations, the framework leverages human knowledge
to improve the anomaly detection pipeline. We demonstrate the usability,
efficiency, and effectiveness of Sintel through a series of experiments on
three public time series datasets, as well as one real-world use case involving
spacecraft experts tasked with anomaly analysis tasks. Sintel's framework,
code, and datasets are open-sourced at https://github.com/sintel-dev/.
","[{'version': 'v1', 'created': 'Tue, 19 Apr 2022 19:38:27 GMT'}]",2022-04-21,"[['Alnegheimish', 'Sarah', ''], ['Liu', 'Dongyu', ''], ['Sala', 'Carles', ''], ['Berti-Equille', 'Laure', ''], ['Veeramachaneni', 'Kalyan', '']]","['Machine Learning Framework', 'Anomaly Detection', 'Human-In-theLoop AI', 'Time Series Data', 'Data Science Pipeline']"
12290,2111.10173,Nikolaos Ellinas,"Konstantinos Klapsas, Nikolaos Ellinas, June Sig Sung, Hyoungmin Park,
  Spyros Raptis","Word-Level Style Control for Expressive, Non-attentive Speech Synthesis",Proceedings of SPECOM 2021,,10.1007/978-3-030-87802-3_31,,cs.SD cs.CL cs.LG eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an expressive speech synthesis architecture for modeling
and controlling the speaking style at a word level. It attempts to learn
word-level stylistic and prosodic representations of the speech data, with the
aid of two encoders. The first one models style by finding a combination of
style tokens for each word given the acoustic features, and the second outputs
a word-level sequence conditioned only on the phonetic information in order to
disentangle it from the style information. The two encoder outputs are aligned
and concatenated with the phoneme encoder outputs and then decoded with a
Non-Attentive Tacotron model. An extra prior encoder is used to predict the
style tokens autoregressively, in order for the model to be able to run without
a reference utterance. We find that the resulting model gives both word-level
and global control over the style, as well as prosody transfer capabilities.
","[{'version': 'v1', 'created': 'Fri, 19 Nov 2021 12:03:53 GMT'}]",2021-11-22,"[['Klapsas', 'Konstantinos', ''], ['Ellinas', 'Nikolaos', ''], ['Sung', 'June Sig', ''], ['Park', 'Hyoungmin', ''], ['Raptis', 'Spyros', '']]","['text-to-speech', 'prosody control', 'expressive speech synthesis']"
12291,2012.13862,Aaron Baumgarten,"Aaron S. Baumgarten, Benjamin L. S. Couchman, Ken Kamrin","A coupled finite volume and material point method for two-phase
  simulation of liquid-sediment and gas-sediment flows",,,10.1016/j.cma.2021.113940,,cs.CE cond-mat.soft,http://creativecommons.org/licenses/by/4.0/,"  Mixtures of fluids and granular sediments play an important role in many
industrial, geotechnical, and aerospace engineering problems, from waste
management and transportation (liquid--sediment mixtures) to dust kick-up below
helicopter rotors (gas--sediment mixtures). These mixed flows often involve
bulk motion of hundreds of billions of individual sediment particles and can
contain both highly turbulent regions and static, non-flowing regions. This
breadth of phenomena necessitates the use of continuum simulation methods, such
as the material point method (MPM), which can accurately capture these large
deformations while also tracking the Lagrangian features of the flow (e.g.\ the
granular surface, elastic stress, etc.).
  Recent works using two-phase MPM frameworks to simulate these mixtures have
shown substantial promise; however, these approaches are hindered by the
numerical limitations of MPM when simulating pure fluids. In addition to the
well-known particle ringing instability and difficulty defining inflow/outflow
boundary conditions, MPM has a tendency to accumulate quadrature errors as
materials deform, increasing the rate of overall error growth as simulations
progress. In this work, we present an improved, two-phase continuum simulation
framework that uses the finite volume method (FVM) to solve the fluid phase
equations of motion and MPM to solve the solid phase equations of motion,
substantially reducing the effect of these errors and providing better accuracy
and stability for long-duration simulations of these mixtures.
","[{'version': 'v1', 'created': 'Sun, 27 Dec 2020 04:55:49 GMT'}, {'version': 'v2', 'created': 'Wed, 19 May 2021 12:24:50 GMT'}]",2021-07-07,"[['Baumgarten', 'Aaron S.', ''], ['Couchman', 'Benjamin L. S.', ''], ['Kamrin', 'Ken', '']]","['granular materials', 'poromechanics', 'FVM', 'MPM']"
12292,2010.12491,Giacomo Livan,"Samuel Stern, Giacomo Livan",The Impact Of Noise And Topology On Opinion Dynamics In Social Networks,,"Royal Society Open Science, Volume 8, Issue 4 (2021)",10.1098/rsos.201943,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the impact of noise and topology on opinion diversity in
social networks. We do so by extending well-established models of opinion
dynamics to a stochastic setting where agents are subject both to assimilative
forces by their local social interactions, as well as to idiosyncratic factors
preventing their population from reaching consensus. We model the latter to
account for both scenarios where noise is entirely exogenous to peer influence
and cases where it is instead endogenous, arising from the agents' desire to
maintain some uniqueness in their opinions. We derive a general analytical
expression for opinion diversity, which holds for any network and depends on
the network's topology through its spectral properties alone. Using this
expression, we find that opinion diversity decreases as communities and
clusters are broken down. We test our predictions against data describing
empirical influence networks between major news outlets and find that
incorporating our measure in linear models for the sentiment expressed by such
sources on a variety of topics yields a notable improvement in terms of
explanatory power.
","[{'version': 'v1', 'created': 'Fri, 23 Oct 2020 15:47:54 GMT'}]",2021-04-15,"[['Stern', 'Samuel', ''], ['Livan', 'Giacomo', '']]","['Opinion Dynamics', 'Discord', 'Social Networks Analysis']"
12293,1906.01005,Ian Jordan,"Ian D. Jordan, Piotr Aleksander Sokol, Il Memming Park","Gated recurrent units viewed through the lens of continuous time
  dynamical systems",,"Frontiers in Computational Neuroscience, 2021",10.3389/fncom.2021.678158,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Gated recurrent units (GRUs) are specialized memory elements for building
recurrent neural networks. Despite their incredible success on various tasks,
including extracting dynamics underlying neural data, little is understood
about the specific dynamics representable in a GRU network. As a result, it is
both difficult to know a priori how successful a GRU network will perform on a
given task, and also their capacity to mimic the underlying behavior of their
biological counterparts. Using a continuous time analysis, we gain intuition on
the inner workings of GRU networks. We restrict our presentation to low
dimensions, allowing for a comprehensive visualization. We found a surprisingly
rich repertoire of dynamical features that includes stable limit cycles
(nonlinear oscillations), multi-stable dynamics with various topologies, and
homoclinic bifurcations. At the same time we were unable to train GRU networks
to produce continuous attractors, which are hypothesized to exist in biological
neural networks. We contextualize the usefulness of different kinds of observed
dynamics and support our claims experimentally.
","[{'version': 'v1', 'created': 'Mon, 3 Jun 2019 18:13:32 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Jul 2021 02:50:50 GMT'}]",2021-07-30,"[['Jordan', 'Ian D.', ''], ['Sokol', 'Piotr Aleksander', ''], ['Park', 'Il Memming', '']]","['Recurrent Neural Networks', 'Dynamical Systems', 'Continuous Time', 'Bifurcations', 'Time-Series']"
12294,1909.03448,Miao Zhu,Duan-Shin Lee and Cheng-Shang Chang and Miao Zhu and Hung-Chih Li,"A Generalized Configuration Model with Degree Correlations and Its
  Percolation Analysis","23 pages, 4 figures","Applied Network Science 4, 124 (2019)",10.1016/j.apsusc.2018.12.012,,cs.SI cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a generalization of the classical configuration
model. Like the classical configuration model, the generalized configuration
model allows users to specify an arbitrary degree distribution. In our
generalized configuration model, we partition the stubs in the configuration
model into b blocks of equal sizes and choose a permutation function h for
these blocks. In each block, we randomly designate a number proportional to q
of stubs as type 1 stubs, where q is a parameter in the range [0; 1]. Other
stubs are designated as type 2 stubs. To construct a network, randomly select
an unconnected stub. Suppose that this stub is in block i. If it is a type 1
stub, connect this stub to a randomly selected unconnected type 1 stub in block
h(i). If it is a type 2 stub, connect it to a randomly selected unconnected
type 2 stub. We repeat this process until all stubs are connected. Under an
assumption, we derive a closed form for the joint degree distribution of two
random neighboring vertices in the constructed graph. Based on this joint
degree distribution, we show that the Pearson degree correlation function is
linear in q for any fixed b. By properly choosing h, we show that our
construction algorithm can create assortative networks as well as
disassortative networks. We present a percolation analysis of this model. We
verify our results by extensive computer simulations.
","[{'version': 'v1', 'created': 'Sun, 8 Sep 2019 12:32:07 GMT'}]",2021-06-02,"[['Lee', 'Duan-Shin', ''], ['Chang', 'Cheng-Shang', ''], ['Zhu', 'Miao', ''], ['Li', 'Hung-Chih', '']]","['configuration model', 'assortative mixing', 'degree correlation']"
12295,2001.03849,Ankit Agrawal,"Ankit Agrawal (1), Sophia Abraham (1), Benjamin Burger (1), Chichi
  Christine (1), Luke Fraser (1), John Hoeksema (1), Sara Hwang (1), Elizabeth
  Travnik (1), Shreya Kumar (1), Walter Scheirer (1), Jane Cleland-Huang (1),
  Michael Vierhauser (2), Ryan Bauer (3), Steve Cox (3) ((1) University of
  Notre Dame, USA, (2) Johannes Keppler University, Linz, Austria, (3) South
  Bend Fire Department, South Bend, IN, USA)","The Next Generation of Human-Drone Partnerships: Co-Designing an
  Emergency Response System","10 Pages, 5 Figures, 2 Tables. This article is publishing in CHI2020",,10.1145/3313831.3376825,,cs.HC cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The use of semi-autonomous Unmanned Aerial Vehicles (UAV) to support
emergency response scenarios, such as fire surveillance and search and rescue,
offers the potential for huge societal benefits. However, designing an
effective solution in this complex domain represents a ""wicked design"" problem,
requiring a careful balance between trade-offs associated with drone autonomy
versus human control, mission functionality versus safety, and the diverse
needs of different stakeholders. This paper focuses on designing for
situational awareness (SA) using a scenario-driven, participatory design
process. We developed SA cards describing six common design-problems, known as
SA demons, and three new demons of importance to our domain. We then used these
SA cards to equip domain experts with SA knowledge so that they could more
fully engage in the design process. We designed a potentially reusable solution
for achieving SA in multi-stakeholder, multi-UAV, emergency response
applications.
","[{'version': 'v1', 'created': 'Sun, 12 Jan 2020 04:54:39 GMT'}]",2020-09-23,"[['Agrawal', 'Ankit', ''], ['Abraham', 'Sophia', ''], ['Burger', 'Benjamin', ''], ['Christine', 'Chichi', ''], ['Fraser', 'Luke', ''], ['Hoeksema', 'John', ''], ['Hwang', 'Sara', ''], ['Travnik', 'Elizabeth', ''], ['Kumar', 'Shreya', ''], ['Scheirer', 'Walter', ''], ['Cleland-Huang', 'Jane', ''], ['Vierhauser', 'Michael', ''], ['Bauer', 'Ryan', ''], ['Cox', 'Steve', '']]","['Situational Awareness', 'Human-CPS interactions', 'UnmannedAerial Vehicles', 'Emergency Response', 'Participatory design']"
12296,2006.11070,Tarun Kumar,"Tarun Kumar, K Darwin, Srinivasan Parthasarathy, Balaraman Ravindran",HPRA: Hyperedge Prediction using Resource Allocation,Accepted at WebSci'20,,10.1145/3394231.3397903,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many real-world systems involve higher-order interactions and thus demand
complex models such as hypergraphs. For instance, a research article could have
multiple collaborating authors, and therefore the co-authorship network is best
represented as a hypergraph. In this work, we focus on the problem of hyperedge
prediction. This problem has immense applications in multiple domains, such as
predicting new collaborations in social networks, discovering new chemical
reactions in metabolic networks, etc. Despite having significant importance,
the problem of hyperedge prediction hasn't received adequate attention, mainly
because of its inherent complexity. In a graph with $n$ nodes the number of
potential edges is $\mathcal{O}(n^{2})$, whereas in a hypergraph, the number of
potential hyperedges is $\mathcal{O}(2^{n})$. To avoid searching through such a
huge space, current methods restrain the original problem in the following two
ways. One class of algorithms assume the hypergraphs to be $k$-uniform.
However, many real-world systems are not confined only to have interactions
involving $k$ components. Thus, these algorithms are not suitable for many
real-world applications. The second class of algorithms requires a candidate
set of hyperedges from which the potential hyperedges are chosen. In the
absence of domain knowledge, the candidate set can have $\mathcal{O}(2^{n})$
possible hyperedges, which makes this problem intractable. We propose HPRA -
Hyperedge Prediction using Resource Allocation, the first of its kind
algorithm, which overcomes these issues and predicts hyperedges of any
cardinality without using any candidate hyperedge set. HPRA is a
similarity-based method working on the principles of the resource allocation
process. In addition to recovering missing hyperedges, we demonstrate that HPRA
can predict future hyperedges in a wide range of hypergraphs.
","[{'version': 'v1', 'created': 'Fri, 19 Jun 2020 11:12:27 GMT'}]",2020-06-22,"[['Kumar', 'Tarun', ''], ['Darwin', 'K', ''], ['Parthasarathy', 'Srinivasan', ''], ['Ravindran', 'Balaraman', '']]","['hypergraph', 'hyperedge prediction', 'resource allocation']"
12297,2102.01460,Alberto Pretto,"Alessandro Saviolo, Matteo Bonotto, Daniele Evangelista, Marco
  Imperoli, Jacopo Lazzaro, Emanuele Menegatti and Alberto Pretto","Learning to Segment Human Body Parts with Synthetically Trained Deep
  Convolutional Networks","This paper has been published in: Proceedings of the 16th
  International Conference on Intelligent Autonomous Systems (IAS 2021)","Proceedings of the 16th International Conference on Intelligent
  Autonomous Systems (IAS 2021)",10.1007/978-3-030-95892-3_52,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new framework for human body part segmentation based on
Deep Convolutional Neural Networks trained using only synthetic data. The
proposed approach achieves cutting-edge results without the need of training
the models with real annotated data of human body parts. Our contributions
include a data generation pipeline, that exploits a game engine for the
creation of the synthetic data used for training the network, and a novel
pre-processing module, that combines edge response maps and adaptive histogram
equalization to guide the network to learn the shape of the human body parts
ensuring robustness to changes in the illumination conditions. For selecting
the best candidate architecture, we perform exhaustive tests on manually
annotated images of real human body limbs. We further compare our method
against several high-end commercial segmentation tools on the body parts
segmentation task. The results show that our method outperforms the other
models by a significant margin. Finally, we present an ablation study to
validate our pre-processing module. With this paper, we release an
implementation of the proposed approach along with the acquired datasets.
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2021 12:26:50 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Nov 2021 15:06:02 GMT'}, {'version': 'v3', 'created': 'Tue, 7 Jun 2022 15:10:20 GMT'}]",2022-06-08,"[['Saviolo', 'Alessandro', ''], ['Bonotto', 'Matteo', ''], ['Evangelista', 'Daniele', ''], ['Imperoli', 'Marco', ''], ['Lazzaro', 'Jacopo', ''], ['Menegatti', 'Emanuele', ''], ['Pretto', 'Alberto', '']]","['Semantic Segmentation', 'Human Body Part Segmentation', 'Foreground Segmentation', 'Synthetic Datasets', 'Deep Learning']"
12298,2009.03820,Niall O' Mahony,"Niall O' Mahony, Sean Campbell, Anderson Carvalho, Lenka Krpalkova,
  Gustavo Velasco-Hernandez, Daniel Riordan, Joseph Walsh","Understanding and Exploiting Dependent Variables with Deep Metric
  Learning",,"Proceedings of the 2020 Intelligent Systems Conference
  (IntelliSys) Volume 1, B. R. Arai K., Kapoor S., Ed. Springer, Cham, 2020,
  pp. 97 to 113",10.1007/978-3-030-55180-3_8,,cs.CV cs.AI,http://creativecommons.org/licenses/by-sa/4.0/,"  Deep Metric Learning (DML) approaches learn to represent inputs to a
lower-dimensional latent space such that the distance between representations
in this space corresponds with a predefined notion of similarity. This paper
investigates how the mapping element of DML may be exploited in situations
where the salient features in arbitrary classification problems vary over time
or due to changing underlying variables. Examples of such variable features
include seasonal and time-of-day variations in outdoor scenes in place
recognition tasks for autonomous navigation and age/gender variations in
human/animal subjects in classification tasks for medical/ethological studies.
Through the use of visualisation tools for observing the distribution of DML
representations per each query variable for which prior information is
available, the influence of each variable on the classification task may be
better understood. Based on these relationships, prior information on these
salient background variables may be exploited at the inference stage of the DML
approach by using a clustering algorithm to improve classification performance.
This research proposes such a methodology establishing the saliency of query
background variables and formulating clustering algorithms for better
separating latent-space representations at run-time. The paper also discusses
online management strategies to preserve the quality and diversity of data and
the representation of each class in the gallery of embeddings in the DML
approach. We also discuss latent works towards understanding the relevance of
underlying/multiple variables with DML.
","[{'version': 'v1', 'created': 'Tue, 8 Sep 2020 15:30:45 GMT'}]",2020-09-09,"[['Mahony', ""Niall O'"", ''], ['Campbell', 'Sean', ''], ['Carvalho', 'Anderson', ''], ['Krpalkova', 'Lenka', ''], ['Velasco-Hernandez', 'Gustavo', ''], ['Riordan', 'Daniel', ''], ['Walsh', 'Joseph', '']]","['Deep Metric Learning', 'Variable Features', 'Dependent Variables', 'Computer Vision']"
12299,2207.09728,Nicolas Gillis,"Maryam Abdolali, Nicolas Gillis",Revisiting data augmentation for subspace clustering,38 pages (including 10 of supplementary material),"Knowledge-Based Systems 258, 109974, 2022",10.1016/j.knosys.2022.109974,,cs.LG cs.AI cs.CV eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Subspace clustering is the classical problem of clustering a collection of
data samples that approximately lie around several low-dimensional subspaces.
The current state-of-the-art approaches for this problem are based on the
self-expressive model which represents the samples as linear combination of
other samples. However, these approaches require sufficiently well-spread
samples for accurate representation which might not be necessarily accessible
in many applications. In this paper, we shed light on this commonly neglected
issue and argue that data distribution within each subspace plays a critical
role in the success of self-expressive models. Our proposed solution to tackle
this issue is motivated by the central role of data augmentation in the
generalization power of deep neural networks. We propose two subspace
clustering frameworks for both unsupervised and semi-supervised settings that
use augmented samples as an enlarged dictionary to improve the quality of the
self-expressive representation. We present an automatic augmentation strategy
using a few labeled samples for the semi-supervised problem relying on the fact
that the data samples lie in the union of multiple linear subspaces.
Experimental results confirm the effectiveness of data augmentation, as it
significantly improves the performance of general self-expressive models.
","[{'version': 'v1', 'created': 'Wed, 20 Jul 2022 08:13:08 GMT'}]",2023-01-26,"[['Abdolali', 'Maryam', ''], ['Gillis', 'Nicolas', '']]","['subspace clustering', 'data augmentation', 'auto-augmentation', 'sparse representation']"
12300,2210.04095,Ye Hong,"Ye Hong, Henry Martin, Martin Raubal","How do you go where? Improving next location prediction by learning
  travel mode information using transformers","updated main figure, 10 pages, camera ready SIGSPATIAL '22",,10.1145/3557915.3560996,,cs.LG physics.soc-ph,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Predicting the next visited location of an individual is a key problem in
human mobility analysis, as it is required for the personalization and
optimization of sustainable transport options. Here, we propose a transformer
decoder-based neural network to predict the next location an individual will
visit based on historical locations, time, and travel modes, which are
behaviour dimensions often overlooked in previous work. In particular, the
prediction of the next travel mode is designed as an auxiliary task to help
guide the network's learning. For evaluation, we apply this approach to two
large-scale and long-term GPS tracking datasets involving more than 600
individuals. Our experiments show that the proposed method significantly
outperforms other state-of-the-art next location prediction methods by a large
margin (8.05% and 5.60% relative increase in F1-score for the two datasets,
respectively). We conduct an extensive ablation study that quantifies the
influence of considering temporal features, travel mode information, and the
auxiliary task on the prediction results. Moreover, we experimentally determine
the performance upper bound when including the next mode prediction in our
model. Finally, our analysis indicates that the performance of location
prediction varies significantly with the chosen next travel mode by the
individual. These results show potential for a more systematic consideration of
additional dimensions of travel behaviour in human mobility prediction tasks.
The source code of our model and experiments is available at
https://github.com/mie-lab/location-mode-prediction.
","[{'version': 'v1', 'created': 'Sat, 8 Oct 2022 19:36:58 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Oct 2022 20:55:31 GMT'}]",2022-10-31,"[['Hong', 'Ye', ''], ['Martin', 'Henry', ''], ['Raubal', 'Martin', '']]","['Mobility', 'Deep learning', 'Location prediction', 'Travel behaviour']"
12301,2005.05005,Lingbo Yang,"Lingbo Yang, Chang Liu, Pan Wang, Shanshe Wang, Peiran Ren, Siwei Ma,
  Wen Gao","HiFaceGAN: Face Renovation via Collaborative Suppression and
  Replenishment",Published in ACM Multimedia 2020,,10.1145/3394171.3413965,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Existing face restoration researches typically relies on either the
degradation prior or explicit guidance labels for training, which often results
in limited generalization ability over real-world images with heterogeneous
degradations and rich background contents. In this paper, we investigate the
more challenging and practical ""dual-blind"" version of the problem by lifting
the requirements on both types of prior, termed as ""Face Renovation""(FR).
Specifically, we formulated FR as a semantic-guided generation problem and
tackle it with a collaborative suppression and replenishment (CSR) approach.
This leads to HiFaceGAN, a multi-stage framework containing several nested CSR
units that progressively replenish facial details based on the hierarchical
semantic guidance extracted from the front-end content-adaptive suppression
modules. Extensive experiments on both synthetic and real face images have
verified the superior performance of HiFaceGAN over a wide range of challenging
restoration subtasks, demonstrating its versatility, robustness and
generalization ability towards real-world face processing applications.
","[{'version': 'v1', 'created': 'Mon, 11 May 2020 11:33:17 GMT'}, {'version': 'v2', 'created': 'Sat, 22 May 2021 12:12:36 GMT'}]",2021-05-25,"[['Yang', 'Lingbo', ''], ['Liu', 'Chang', ''], ['Wang', 'Pan', ''], ['Wang', 'Shanshe', ''], ['Ren', 'Peiran', ''], ['Ma', 'Siwei', ''], ['Gao', 'Wen', '']]","['Face Renovation', 'image synthesis', 'collaborative learning']"
12302,2106.13475,Clayton Miller,"Clayton Miller, Bianca Picchetti, Chun Fu, Jovan Pantelic","Limitations of machine learning for building energy prediction: ASHRAE
  Great Energy Predictor III Kaggle competition error analysis",,"Science and Technology for the Built Environment. Volume 28, 2022,
  Issue 5. 1-18",10.1080/23744731.2022.2067466,,cs.LG cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Research is needed to explore the limitations and potential for improvement
of machine learning for building energy prediction. With this aim, the ASHRAE
Great Energy Predictor III (GEPIII) Kaggle competition was launched in 2019.
This effort was the largest building energy meter machine learning competition
of its kind, with 4,370 participants who submitted 39,403 predictions. The test
data set included two years of hourly whole building readings from 2,380 meters
in 1,448 buildings at 16 locations. This paper analyzes the various sources and
types of residual model error from an aggregation of the competition's top 50
solutions. This analysis reveals the limitations for machine learning using the
standard model inputs of historical meter, weather, and basic building
metadata. The errors are classified according to timeframe, behavior,
magnitude, and incidence in single buildings or across a campus. The results
show machine learning models have errors within a range of acceptability
(RMSLE_scaled =< 0.1) on 79.1% of the test data. Lower magnitude (in-range)
model errors (0.1 < RMSLE_scaled =< 0.3) occur in 16.1% of the test data. These
errors could be remedied using innovative training data from onsite and
web-based sources. Higher magnitude (out-of-range) errors (RMSLE_scaled > 0.3)
occur in 4.8% of the test data and are unlikely to be accurately predicted.
","[{'version': 'v1', 'created': 'Fri, 25 Jun 2021 07:40:42 GMT'}, {'version': 'v2', 'created': 'Sat, 7 Aug 2021 08:41:05 GMT'}, {'version': 'v3', 'created': 'Sun, 20 Feb 2022 07:50:00 GMT'}]",2022-08-08,"[['Miller', 'Clayton', ''], ['Picchetti', 'Bianca', ''], ['Fu', 'Chun', ''], ['Pantelic', 'Jovan', '']]","['Building energy prediction', 'Energy model', 'Error analysis', 'Machine learning limitations', 'Kaggle competition', 'Artificialintelligence']"
12303,1811.05618,Ian Briggs,"Michael Bentley, Ian Briggs, Ganesh Gopalakrishnan, Dong H. Ahn,
  Ignacio Laguna, Gregory L. Lee, Holger E. Jones","Multi-level analysis of compiler induced variability and performance
  tradeoffs","12 pages, 11 figures, accepted in HPDC 2019",,10.1145/3307681.3325960,LLNL-CONF-759867,cs.SE cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Successful HPC software applications are long-lived. When ported across
machines and their compilers, these applications often produce different
numerical results, many of which are unacceptable. Such variability is also a
concern while optimizing the code more aggressively to gain performance.
Efficient tools that help locate the program units (files and functions) within
which most of the variability occurs are badly needed, both to plan for code
ports and to root-cause errors due to variability when they happen in the
field. In this work, we offer an enhanced version of the open-source testing
framework FLiT to serve these roles. Key new features of FLiT include a suite
of bisection algorithms that help locate the root causes of variability.
Another added feature allows an analysis of the tradeoffs between performance
and the degree of variability. Our new contributions also include a collection
of case studies. Results on the MFEM finite-element library include
variability/performance tradeoffs, and the identification of a (hitherto
unknown) abnormal level of result-variability even under mild compiler
optimizations. Results from studying the Laghos proxy application include
identifying a significantly divergent floating-point result-variability and
successful root-causing down to the problematic function over as little as 14
program executions. Finally, in an evaluation of 4,376 controlled injections of
floating-point perturbations on the LULESH proxy application, we showed that
the FLiT framework has 100 precision and recall in discovering the file and
function locations of the injections all within an average of only 15 program
executions.
","[{'version': 'v1', 'created': 'Wed, 14 Nov 2018 03:15:37 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Jun 2019 19:58:49 GMT'}]",2019-06-26,"[['Bentley', 'Michael', ''], ['Briggs', 'Ian', ''], ['Gopalakrishnan', 'Ganesh', ''], ['Ahn', 'Dong H.', ''], ['Laguna', 'Ignacio', ''], ['Lee', 'Gregory L.', ''], ['Jones', 'Holger E.', '']]","['debugging', 'compilers', 'code optimization', 'reproducibility', 'performance tuning']"
12304,2103.09019,Felippe Vieira Zacarias,"Felippe V. Zacarias (1, 2 and 3), Vinicius Petrucci (1 and 5), Rajiv
  Nishtala (4), Paul Carpenter (3) and Daniel Moss\'e (5) ((1) Universidade
  Federal da Bahia, (2) Universitat Polit\`ecnica de Catalunya, (3) Barcelona
  Supercomputing Center, (4) Coop, Norway/Norwegian University of Science and
  Technology, Norway, (5) University of Pittsburgh)",Intelligent colocation of HPC workloads,Submitted to Journal of Parallel and Distributed Computing,"Volume 151, May 2021, Pages 125-137",10.1016/j.jpdc.2021.02.010,,cs.DC cs.LG cs.PF,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Many HPC applications suffer from a bottleneck in the shared caches,
instruction execution units, I/O or memory bandwidth, even though the remaining
resources may be underutilized. It is hard for developers and runtime systems
to ensure that all critical resources are fully exploited by a single
application, so an attractive technique for increasing HPC system utilization
is to colocate multiple applications on the same server. When applications
share critical resources, however, contention on shared resources may lead to
reduced application performance.
  In this paper, we show that server efficiency can be improved by first
modeling the expected performance degradation of colocated applications based
on measured hardware performance counters, and then exploiting the model to
determine an optimized mix of colocated applications. This paper presents a new
intelligent resource manager and makes the following contributions: (1) a new
machine learning model to predict the performance degradation of colocated
applications based on hardware counters and (2) an intelligent scheduling
scheme deployed on an existing resource manager to enable application
co-scheduling with minimum performance degradation. Our results show that our
approach achieves performance improvements of 7% (avg) and 12% (max) compared
to the standard policy commonly used by existing job managers.
","[{'version': 'v1', 'created': 'Tue, 16 Mar 2021 12:35:35 GMT'}]",2021-03-17,"[['Zacarias', 'Felippe V.', '', '1, 2 and 3'], ['Petrucci', 'Vinicius', '', '1 and 5'], ['Nishtala', 'Rajiv', ''], ['Carpenter', 'Paul', ''], ['Mossé', 'Daniel', '']]","['Resource manager', 'HPC systems', 'Machine learning', 'Colocation', 'Performance Characterization', 'Performance counters']"
12305,1710.07543,Gustavo Maciel Dias Vieira,"Rodrigo R. Barbieri, Gustavo M. D. Vieira",Hardened Paxos Through Consistency Validation,"6 pages, fixed metadata","SBESC '15: Proceedings of the V Brazilian Symposium on Computing
  Systems Engineering, IEEE Computer Society, 2015, 13-18",10.1109/SBESC.2015.10,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the emergent adoption of distributed systems when building
applications, demand for reliability and availability has increased. These
properties can be achieved through replication techniques using middleware
algorithms that must be capable of tolerating faults. Certain faults such as
arbitrary faults, however, may be more difficult to tolerate, resulting in more
complex and resource intensive algorithms that end up being not so practical to
use. We propose and experiment with the use of consistency validation
techniques to harden a benign fault-tolerant Paxos, thus being able to detect
and tolerate non-malicious arbitrary faults.
","[{'version': 'v1', 'created': 'Fri, 20 Oct 2017 14:22:10 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Oct 2017 17:22:45 GMT'}]",2017-10-26,"[['Barbieri', 'Rodrigo R.', ''], ['Vieira', 'Gustavo M. D.', '']]","['Fault tolerance', 'Paxos', 'benign faults', 'arbitraryfaults', 'consistency validation', 'hardening', 'non-malicious']"
12306,2103.11350,Tao Zhou,"Yan-Li Lee, Qiang Dong and Tao Zhou",Link Prediction via controlling the leading eigenvector,"22 pages, 4 figures, 4 tables",Applied Mathematics and Computation 411 (2021) 126517,10.1016/j.amc.2021.126517,,cs.SI physics.soc-ph,http://creativecommons.org/publicdomain/zero/1.0/,"  Link prediction is a fundamental challenge in network science. Among various
methods, similarity-based algorithms are popular for their simplicity,
interpretability, high efficiency and good performance. In this paper, we show
that the most elementary local similarity index Common Neighbor (CN) can be
linearly decomposed by eigenvectors of the adjacency matrix of the target
network, with each eigenvector's contribution being proportional to the square
of the corresponding eigenvalue. As in many real networks, there is a huge gap
between the largest eigenvalue and the second largest eigenvalue, the CN index
is thus dominated by the leading eigenvector and much useful information
contained in other eigenvectors may be overlooked. Accordingly, we propose a
parameter-free algorithm that ensures the contributions of the leading
eigenvector and the secondary eigenvector the same. Extensive experiments on
real networks demonstrate that the prediction performance of the proposed
algorithm is remarkably better than well-performed local similarity indices in
the literature. A further proposed algorithm that can adjust the contribution
of leading eigenvector shows the superiority over state-of-the-art algorithms
with tunable parameters for its competitive accuracy and lower computational
complexity.
","[{'version': 'v1', 'created': 'Sun, 21 Mar 2021 09:52:32 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Apr 2021 09:15:48 GMT'}, {'version': 'v3', 'created': 'Fri, 30 Apr 2021 03:03:29 GMT'}, {'version': 'v4', 'created': 'Wed, 30 Jun 2021 09:27:25 GMT'}]",2021-08-27,"[['Lee', 'Yan-Li', ''], ['Dong', 'Qiang', ''], ['Zhou', 'Tao', '']]","['Complex Networks', 'Link Prediction', 'Similarity Index']"
12307,2208.08118,Sindhu Hegde,"Sindhu B Hegde, Rudrabha Mukhopadhyay, Vinay P Namboodiri, C. V.
  Jawahar",Extreme-scale Talking-Face Video Upsampling with Audio-Visual Priors,"Accepted in ACM-MM 2022, 10 pages, 6 pages supplementary, 18 Figures",,10.1145/3503161.3548080,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we explore an interesting question of what can be obtained
from an $8\times8$ pixel video sequence. Surprisingly, it turns out to be quite
a lot. We show that when we process this $8\times8$ video with the right set of
audio and image priors, we can obtain a full-length, $256\times256$ video. We
achieve this $32\times$ scaling of an extremely low-resolution input using our
novel audio-visual upsampling network. The audio prior helps to recover the
elemental facial details and precise lip shapes and a single high-resolution
target identity image prior provides us with rich appearance details. Our
approach is an end-to-end multi-stage framework. The first stage produces a
coarse intermediate output video that can be then used to animate single target
identity image and generate realistic, accurate and high-quality outputs. Our
approach is simple and performs exceedingly well (an $8\times$ improvement in
FID score) compared to previous super-resolution methods. We also extend our
model to talking-face video compression, and show that we obtain a $3.5\times$
improvement in terms of bits/pixel over the previous state-of-the-art. The
results from our network are thoroughly analyzed through extensive ablation
experiments (in the paper and supplementary material). We also provide the demo
video along with code and models on our website:
\url{http://cvit.iiit.ac.in/research/projects/cvit-projects/talking-face-video-upsampling}.
","[{'version': 'v1', 'created': 'Wed, 17 Aug 2022 07:19:40 GMT'}]",2022-08-18,"[['Hegde', 'Sindhu B', ''], ['Mukhopadhyay', 'Rudrabha', ''], ['Namboodiri', 'Vinay P', ''], ['Jawahar', 'C. V.', '']]","['video upsampling', 'video super-resolution', 'video compression', 'talkingface videos', 'audio-visual learning']"
12308,2111.05097,Tarek Saier,"Tarek Saier, Michael F\""arber, Tornike Tsereteli","Cross-Lingual Citations in English Papers: A Large-Scale Analysis of
  Prevalence, Usage, and Impact",to be published in the International Journal on Digital Libraries,,10.1007/s00799-021-00312-z,,cs.DL cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Citation information in scholarly data is an important source of insight into
the reception of publications and the scholarly discourse. Outcomes of citation
analyses and the applicability of citation based machine learning approaches
heavily depend on the completeness of such data. One particular shortcoming of
scholarly data nowadays is that non-English publications are often not included
in data sets, or that language metadata is not available. Because of this,
citations between publications of differing languages (cross-lingual citations)
have only been studied to a very limited degree. In this paper, we present an
analysis of cross-lingual citations based on over one million English papers,
spanning three scientific disciplines and a time span of three decades. Our
investigation covers differences between cited languages and disciplines,
trends over time, and the usage characteristics as well as impact of
cross-lingual citations. Among our findings are an increasing rate of citations
to publications written in Chinese, citations being primarily to local
non-English languages, and consistency in citation intent between cross- and
monolingual citations. To facilitate further research, we make our collected
data and source code publicly available.
","[{'version': 'v1', 'created': 'Sun, 7 Nov 2021 15:34:02 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Nov 2021 08:48:05 GMT'}]",2022-01-12,"[['Saier', 'Tarek', ''], ['Färber', 'Michael', ''], ['Tsereteli', 'Tornike', '']]","['Scholarly Data', 'Citations', 'Cross-Lingual', 'Citation Analysis']"
12309,2012.09475,Murilo Santos de Lima,"Magn\'us M. Halld\'orsson (1), Murilo S. de Lima (2) ((1) ICE-TCS,
  Department of Computer Science, Reykjavik University, Iceland, (2) School of
  Informatics, University of Leicester, United Kingdom)",Query-Competitive Sorting with Uncertainty,"Partially supported by Icelandic Research Fund grant 174484-051. A
  preliminary version of this paper appeared in volume 138 of LIPICs, article
  7, 2019. DOI: 10.4230/LIPIcs.MFCS.2019.7",Theoretical Computer Science 867 (2021) 50-67,10.1016/j.tcs.2021.03.021,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of sorting under incomplete information, when queries
are used to resolve uncertainties. Each of $n$ data items has an unknown value,
which is known to lie in a given interval. We can pay a query cost to learn the
actual value, and we may allow an error threshold in the sorting. The goal is
to find a nearly-sorted permutation by performing a minimum-cost set of
queries.
  We show that an offline optimum query set can be found in poly time, and that
both oblivious and adaptive problems have simple competitive algorithms. The
competitive ratio for the oblivious problem is $n$ for uniform query costs, and
unbounded for arbitrary costs; for the adaptive problem, the ratio is 2.
  We present a unified adaptive strategy for uniform costs that yields the
following improved results: (1) a 3/2-competitive randomized algorithm; (2) a
5/3-competitive deterministic algorithm if the dependency graph has no
2-components after some preprocessing, which has competitive ratio
$3/2+\mathrm{O}(1/k)$ if the components obtained have size at least $k$; and
(3) an exact algorithm for laminar families of intervals. The first two results
have matching lower bounds, and we have a lower bound of 7/5 for large
components.
  We also give a randomized adaptive algorithm with competitive ratio
$1+\frac{4}{3\sqrt{3}}\approx 1.7698$ for arbitrary query costs, and we show
that the 2-competitive deterministic adaptive algorithm can be generalized for
queries returning intervals and for a more general vertex cover problem, by
using the local ratio technique. Moreover, we prove that the advice complexity
of the adaptive problem is $\lfloor n/2\rfloor$ if no error threshold is
allowed, and $\lceil n/3\cdot\lg 3\rceil$ for the general case.
  Finally, we present some graph-theoretical results on co-threshold tolerance
graphs, and we discuss uncertainty variants of some classical interval
problems.
","[{'version': 'v1', 'created': 'Thu, 17 Dec 2020 09:54:24 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Apr 2021 15:42:36 GMT'}]",2021-04-16,"[['Halldórsson', 'Magnús M.', ''], ['de Lima', 'Murilo S.', '']]","['online algorithms', 'sorting', 'randomized algorithms', 'advice complexity', 'threshold tolerancegraphs']"
12310,2004.09038,Pengbo Bo,Zixuan Hu and Pengbo Bo,Developable B-spline surface generation from control rulings,"13 pages, 12 figrues","Journal of Computer Science and Technology, 2022",10.1007/s11390-022-0680-5,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An intuitive design method is proposed for generating developable ruled
B-spline surfaces from a sequence of straight line segments indicating the
surface shape. The first and last line segments are enforced to be the head and
tail ruling lines of the resulting surface while the interior lines are
required to approximate rulings on the resulting surface as much as possible.
This manner of developable surface design is conceptually similar to the
popular way of the freeform curve and surface design in the CAD community,
observing that a developable ruled surface is a single parameter family of
straight lines. This new design mode of the developable surface also provides
more flexibility than the widely employed way of developable surface design
from two boundary curves of the surface. The problem is treated by numerical
optimization methods with which a particular level of distance error is
allowed. We thus provide an effective tool for creating surfaces with a high
degree of developability when the input control rulings do not lie in exact
developable surfaces. We consider this ability as the superiority over
analytical methods in that it can deal with arbitrary design inputs and find
practically useful results.
","[{'version': 'v1', 'created': 'Mon, 20 Apr 2020 03:22:23 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Apr 2020 04:19:05 GMT'}]",2022-10-14,"[['Hu', 'Zixuan', ''], ['Bo', 'Pengbo', '']]","['Developable surface', 'Interactive design', 'B-spline surface', 'Numerical optimization']"
12311,1806.06878,Shawn Jones,"Shawn M. Jones, Alexander Nwala, Michele C. Weigle, Michael L. Nelson",The Many Shapes of Archive-It,"10 pages, 12 figures, to appear in the proceedings of the 15th
  International Conference on Digital Preservation (iPres 2018)",,10.17605/OSF.IO/EV42P,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web archives, a key area of digital preservation, meet the needs of
journalists, social scientists, historians, and government organizations. The
use cases for these groups often require that they guide the archiving process
themselves, selecting their own original resources, or seeds, and creating
their own web archive collections. We focus on the collections within
Archive-It, a subscription service started by the Internet Archive in 2005 for
the purpose of allowing organizations to create their own collections of
archived web pages, or mementos. Understanding these collections could be done
via their user-supplied metadata or via text analysis, but the metadata is
applied inconsistently between collections and some Archive-It collections
consist of hundreds of thousands of seeds, making it costly in terms of time to
download each memento. Our work proposes using structural metadata as an
additional way to understand these collections. We explore structural features
currently existing in these collections that can unveil curation and crawling
behaviors. We adapt the concept of the collection growth curve for
understanding Archive-It collection curation and crawling behavior. We also
introduce several seed features and come to an understanding of the diversity
of resources that make up a collection. Finally, we use the descriptions of
each collection to identify four semantic categories of Archive-It collections.
Using the identified structural features, we reviewed the results of runs with
20 classifiers and are able to predict the semantic category of a collection
using a Random Forest classifier with a weighted average F1 score of 0.720,
thus bridging the structural to the descriptive. Our method is useful because
it saves the researcher time and bandwidth. Identifying collections by their
semantic category allows further downstream processing to be tailored to these
categories.
","[{'version': 'v1', 'created': 'Mon, 18 Jun 2018 18:27:20 GMT'}]",2021-01-26,"[['Jones', 'Shawn M.', ''], ['Nwala', 'Alexander', ''], ['Weigle', 'Michele C.', ''], ['Nelson', 'Michael L.', '']]","['Web Archive', 'Archive', 'Collections', 'Archive-It']"
12312,2212.09330,Sirikonda Dhawal,"Rahul Goel, Sirikonda Dhawal, Saurabh Saini, P. J. Narayanan",StyleTRF: Stylizing Tensorial Radiance Fields,Accepted at ICVGIP-2022,,10.1145/3571600.3571643,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Stylized view generation of scenes captured casually using a camera has
received much attention recently. The geometry and appearance of the scene are
typically captured as neural point sets or neural radiance fields in the
previous work. An image stylization method is used to stylize the captured
appearance by training its network jointly or iteratively with the structure
capture network. The state-of-the-art SNeRF method trains the NeRF and
stylization network in an alternating manner. These methods have high training
time and require joint optimization. In this work, we present StyleTRF, a
compact, quick-to-optimize strategy for stylized view generation using TensoRF.
The appearance part is fine-tuned using sparse stylized priors of a few views
rendered using the TensoRF representation for a few iterations. Our method thus
effectively decouples style-adaption from view capture and is much faster than
the previous methods. We show state-of-the-art results on several scenes used
for this purpose.
","[{'version': 'v1', 'created': 'Mon, 19 Dec 2022 09:50:05 GMT'}]",2022-12-20,"[['Goel', 'Rahul', ''], ['Dhawal', 'Sirikonda', ''], ['Saini', 'Saurabh', ''], ['Narayanan', 'P. J.', '']]","['NeRF', 'Content Stylization', 'Multi-view consistency', 'Fine-tuning', 'Fast Adaptation']"
12313,1908.06576,Xiangyang He,"Xiangyang He, Yubo Tao, Qirui Wang, Hai Lin",A Co-analysis Framework for Exploring Multivariate Scientific Data,"31 pages, 7 figures","Visual Informatics Volume 2, Issue 4, December 2018, Pages 254-263",10.1016/j.visinf.2018.12.005,,cs.CV cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In complex multivariate data sets, different features usually include diverse
associations with different variables, and different variables are associated
within different regions. Therefore, exploring the associations between
variables and voxels locally becomes necessary to better understand the
underlying phenomena. In this paper, we propose a co-analysis framework based
on biclusters, which are two subsets of variables and voxels with close
scalar-value relationships, to guide the process of visually exploring
multivariate data. We first automatically extract all meaningful biclusters,
each of which only contains voxels with a similar scalar-value pattern over a
subset of variables. These biclusters are organized according to their variable
sets, and biclusters in each variable set are further grouped by a similarity
metric to reduce redundancy and support diversity during visual exploration.
Biclusters are visually represented in coordinated views to facilitate
interactive exploration of multivariate data based on the similarity between
biclusters and the correlation of scalar values with different variables.
Experiments on several representative multivariate scientific data sets
demonstrate the effectiveness of our framework in exploring local relationships
among variables, biclusters and scalar values in the data.
","[{'version': 'v1', 'created': 'Mon, 19 Aug 2019 03:31:48 GMT'}]",2019-08-20,"[['He', 'Xiangyang', ''], ['Tao', 'Yubo', ''], ['Wang', 'Qirui', ''], ['Lin', 'Hai', '']]","['Multivariate data', 'bicluster', 'local association']"
12314,2004.02137,Benyamin Ghojogh,"Benyamin Ghojogh, Fakhri Karray, Mark Crowley",Anomaly Detection and Prototype Selection Using Polyhedron Curvature,"Accepted (to appear) in Canadian Conference on Artificial
  Intelligence (Canadian AI conference) 2020, Springer. This version includes
  supplementary material for derivation of an equation","Canadian Conference on Artificial Intelligence, pp. 238-250.
  Springer, Cham, 2020",10.1007/978-3-030-47358-7_23,,cs.LG cs.CG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel approach to anomaly detection called Curvature Anomaly
Detection (CAD) and Kernel CAD based on the idea of polyhedron curvature. Using
the nearest neighbors for a point, we consider every data point as the vertex
of a polyhedron where the more anomalous point has more curvature. We also
propose inverse CAD (iCAD) and Kernel iCAD for instance ranking and prototype
selection by looking at CAD from an opposite perspective. We define the concept
of anomaly landscape and anomaly path and we demonstrate an application for it
which is image denoising. The proposed methods are straightforward and easy to
implement. Our experiments on different benchmarks show that the proposed
methods are effective for anomaly detection and prototype selection.
","[{'version': 'v1', 'created': 'Sun, 5 Apr 2020 09:50:13 GMT'}]",2020-05-14,"[['Ghojogh', 'Benyamin', ''], ['Karray', 'Fakhri', ''], ['Crowley', 'Mark', '']]","['Anomaly detection', 'prototype selection', 'polyhedron curvature', 'curvature anomaly detection (CAD)']"
12315,2009.00594,Yanyu Zhang,"Yanyu Zhang, Xiu Wang, Xuan Wu, Wenjing Zhang, Meiqian Jiang and
  Mahmood Al-Khassaweneh",Intelligent Hotel ROS-based Service Robot,,,10.1109/EIT.2019.8834040,,cs.RO cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the advances of artificial intelligence (AI) technology, many studies
and work have been carried out on how robots could replace human labor. In this
paper, we present a ROS based intelligence hotel robot, which simplifies the
check-in process. We use pioneer 3dx robot and considered different environment
settings. The robot combined with Hokuyo Lidar and Kinect Xbox camera, can plan
the routes accurately and reach rooms in different floors. In addition, we
added an intelligent voice system which provides an assistant for the
customers.
","[{'version': 'v1', 'created': 'Tue, 1 Sep 2020 17:33:34 GMT'}]",2020-09-02,"[['Zhang', 'Yanyu', ''], ['Wang', 'Xiu', ''], ['Wu', 'Xuan', ''], ['Zhang', 'Wenjing', ''], ['Jiang', 'Meiqian', ''], ['Al-Khassaweneh', 'Mahmood', '']]","['Arm manipulating', 'deep learning', 'logical control', 'robotic object detection', 'sensors apply']"
12316,1602.06632,Tejal Bhamre,"Tejal Bhamre, Teng Zhang, Amit Singer",Denoising and Covariance Estimation of Single Particle Cryo-EM Images,Revision for JSB,,10.1016/j.jsb.2016.04.013,,cs.CV q-bio.BM stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of image restoration in cryo-EM entails correcting for the
effects of the Contrast Transfer Function (CTF) and noise. Popular methods for
image restoration include `phase flipping', which corrects only for the Fourier
phases but not amplitudes, and Wiener filtering, which requires the spectral
signal to noise ratio. We propose a new image restoration method which we call
`Covariance Wiener Filtering' (CWF). In CWF, the covariance matrix of the
projection images is used within the classical Wiener filtering framework for
solving the image restoration deconvolution problem. Our estimation procedure
for the covariance matrix is new and successfully corrects for the CTF. We
demonstrate the efficacy of CWF by applying it to restore both simulated and
experimental cryo-EM images. Results with experimental datasets demonstrate
that CWF provides a good way to evaluate the particle images and to see what
the dataset contains even without 2D classification and averaging.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2016 03:04:44 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Feb 2016 04:03:55 GMT'}, {'version': 'v3', 'created': 'Wed, 6 Apr 2016 19:41:52 GMT'}]",2016-04-29,"[['Bhamre', 'Tejal', ''], ['Zhang', 'Teng', ''], ['Singer', 'Amit', '']]","['CTF Correction', 'Steerable PCA', 'Wiener Filtering']"
12317,2205.00746,Mike Kosek,"Mike Kosek, Trinh Viet Doan, Simon Huber, Vaibhav Bajpai","Measuring DNS over TCP in the Era of Increasing DNS Response Sizes: A
  View from the Edge","Published in ACM SIGCOMM Computer Communication Review Volume 52
  Issue 2, April 2022",,10.1145/3544912.3544918,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Domain Name System (DNS) is one of the most crucial parts of the
Internet. Although the original standard defined the usage of DNS over UDP
(DoUDP) as well as DNS over TCP (DoTCP), UDP has become the predominant
protocol used in the DNS. With the introduction of new Resource Records (RRs),
the sizes of DNS responses have increased considerably. Since this can lead to
truncation or IP fragmentation, the fallback to DoTCP as required by the
standard ensures successful DNS responses by overcoming the size limitations of
DoUDP. However, the effects of the usage of DoTCP by stub resolvers are not
extensively studied to this date. We close this gap by presenting a view at
DoTCP from the Edge, issuing 12.1M DNS requests from 2,500 probes toward Public
as well as Probe DNS recursive resolvers. In our measurement study, we observe
that DoTCP is generally slower than DoUDP, where the relative increase in
Response Time is less than 37% for most resolvers. While optimizations to DoTCP
can be leveraged to further reduce the response times, we show that support on
Public resolvers is still missing, hence leaving room for optimizations in the
future. Moreover, we also find that Public resolvers generally have comparable
reliability for DoTCP and DoUDP. However, Probe resolvers show a significantly
different behavior: DoTCP queries targeting Probe resolvers fail in 3 out of 4
cases, and, therefore, do not comply with the standard. This problem will only
aggravate in the future: As DNS response sizes will continue to grow, the need
for DoTCP will solidify.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 08:51:33 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Jul 2022 08:16:00 GMT'}]",2022-07-19,"[['Kosek', 'Mike', ''], ['Doan', 'Trinh Viet', ''], ['Huber', 'Simon', ''], ['Bajpai', 'Vaibhav', '']]","['Domain Name System', 'Transmission Control Protocol', 'DNS overTCP', 'RIPE Atlas']"
12318,2011.03991,Christophe De Wagter,"Christophe De Wagter, Bart Remes, Ewoud Smeur, Freek van Tienen, Rick
  Ruijsink, Kevin van Hecke, Erik van der Horst","The NederDrone: A hybrid lift, hybrid energy hydrogen UAV",,,10.1016/j.ijhydene.2021.02.053,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A lot of UAV applications require vertical take-off and landing (VTOL)
combined with very long-range or endurance. Transitioning UAVs have been
proposed to combine the VTOL capabilities of helicopters with the efficient
long-range flight properties of fixed-wing aircraft. But energy is still a
bottleneck for many electric long endurance applications. While solar power
technology and battery technology have improved a lot, in rougher conditions
they still respectively lack the power or total amount of energy required for
many real-world situations. In this paper, we introduce the NederDrone, a
hybrid lift, hybrid energy hydrogen-powered UAV which can perform vertical
take-off and landings using 12 propellers while flying efficiently in forward
flight thanks to its fixed wings. The energy is supplied from a mix of
hydrogen-driven fuel-cells to store large amounts of energy and battery power
for high power situations. The hydrogen is stored in a pressurized cylinder
around which the UAV is optimized. This paper analyses the selection of the
concept, the implemented safety elements, the electronics and flight control
and shows flight data including a 3h38 flight at sea, starting and landing on a
small moving ship.
","[{'version': 'v1', 'created': 'Sun, 8 Nov 2020 14:39:32 GMT'}]",2021-03-23,"[['De Wagter', 'Christophe', ''], ['Remes', 'Bart', ''], ['Smeur', 'Ewoud', ''], ['van Tienen', 'Freek', ''], ['Ruijsink', 'Rick', ''], ['van Hecke', 'Kevin', ''], ['van der Horst', 'Erik', '']]","['PEM fuel-cell', 'Hydrogen', 'Pressure cylinder', 'Tail-sitter', 'HybridUAV', 'Maritime UAV']"
12319,2111.05108,Zhi Lu,Zhi Lu and Vrizlynn L.L. Thing,"""How Does It Detect A Malicious App?"" Explaining the Predictions of
  AI-based Android Malware Detector",,"IEEE 8th Intl Conference on Big Data Security on Cloud
  (BigDataSecurity), IEEE Intl Conference on High Performance and Smart
  Computing, (HPSC) and IEEE Intl Conference on Intelligent Data and Security
  (IDS), 2022, pp. 194-199",10.1109/BigDataSecurityHPSCIDS54978.2022.00045,,cs.CR cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  AI methods have been proven to yield impressive performance on Android
malware detection. However, most AI-based methods make predictions of
suspicious samples in a black-box manner without transparency on models'
inference. The expectation on models' explainability and transparency by cyber
security and AI practitioners to assure the trustworthiness increases. In this
article, we present a novel model-agnostic explanation method for AI models
applied for Android malware detection. Our proposed method identifies and
quantifies the data features relevance to the predictions by two steps: i) data
perturbation that generates the synthetic data by manipulating features'
values; and ii) optimization of features attribution values to seek significant
changes of prediction scores on the perturbed data with minimal feature values
changes. The proposed method is validated by three experiments. We firstly
demonstrate that our proposed model explanation method can aid in discovering
how AI models are evaded by adversarial samples quantitatively. In the
following experiments, we compare the explainability and fidelity of our
proposed method with state-of-the-arts, respectively.
","[{'version': 'v1', 'created': 'Sat, 6 Nov 2021 11:25:24 GMT'}]",2022-11-21,"[['Lu', 'Zhi', ''], ['Thing', 'Vrizlynn L. L.', '']]","['Explainable AI', 'Cyber security', 'Machine Learning']"
12320,2207.10999,Prajwol Kumar Nakarmi,"Prajwol Kumar Nakarmi, Jakob Sternby, Ikram Ullah","Applying Machine Learning on RSRP-based Features for False Base Station
  Detection","9 pages,5 figure, 3 tables, 2 algorithms",,10.1145/3538969.3543787,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  False base stations -- IMSI catchers, Stingrays -- are devices that
impersonate legitimate base stations, as a part of malicious activities like
unauthorized surveillance or communication sabotage. Detecting them on the
network side using 3GPP standardized measurement reports is a promising
technique. While applying predetermined detection rules works well when an
attacker operates a false base station with an illegitimate Physical Cell
Identifiers (PCI), the detection will produce false negatives when a more
resourceful attacker operates the false base station with one of the legitimate
PCIs obtained by scanning the neighborhood first. In this paper, we show how
Machine Learning (ML) can be applied to alleviate such false negatives. We
demonstrate our approach by conducting experiments in a simulation setup using
the ns-3 LTE module. We propose three robust ML features (COL, DIST, XY) based
on Reference Signal Received Power (RSRP) contained in measurement reports and
cell locations. We evaluate four ML models (Regression Clustering, Anomaly
Detection Forest, Autoencoder, and RCGAN) and show that several of them have a
high precision in detection even when the false base station is using a
legitimate PCI. In our experiments with a layout of 12 cells, where one cell
acts as a moving false cell, between 75-95\% of the false positions are
detected by the best model at a cost of 0.5\% false positives.
","[{'version': 'v1', 'created': 'Fri, 22 Jul 2022 10:33:29 GMT'}]",2022-07-25,"[['Nakarmi', 'Prajwol Kumar', ''], ['Sternby', 'Jakob', ''], ['Ullah', 'Ikram', '']]","['security', 'false base station', 'IMSI catcher', 'machine learning', 'anomaly detection', 'ns-3']"
12321,2211.16736,Hadi Jahanshahi,"Elnaz Yousefzadeh Barri, Steven Farber, Hadi Jahanshahi, Eda Beyazit","Understanding transit ridership in an equity context through a
  comparison of statistical and machine learning algorithms","This is the preprint of the accepted paper in the journal of
  Transport Geography. Please refer to its DOI","Barri, E. Y., Farber, S., Jahanshahi, H., & Beyazit, E. (2022).
  Understanding transit ridership in an equity context through a comparison of
  statistical and machine learning algorithms. Journal of Transport Geography,
  105, 103482",10.1016/j.jtrangeo.2022.103482,,cs.LG cs.CY stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Building an accurate model of travel behaviour based on individuals'
characteristics and built environment attributes is of importance for
policy-making and transportation planning. Recent experiments with big data and
Machine Learning (ML) algorithms toward a better travel behaviour analysis have
mainly overlooked socially disadvantaged groups. Accordingly, in this study, we
explore the travel behaviour responses of low-income individuals to transit
investments in the Greater Toronto and Hamilton Area, Canada, using statistical
and ML models. We first investigate how the model choice affects the prediction
of transit use by the low-income group. This step includes comparing the
predictive performance of traditional and ML algorithms and then evaluating a
transit investment policy by contrasting the predicted activities and the
spatial distribution of transit trips generated by vulnerable households after
improving accessibility. We also empirically investigate the proposed transit
investment by each algorithm and compare it with the city of Brampton's future
transportation plan. While, unsurprisingly, the ML algorithms outperform
classical models, there are still doubts about using them due to
interpretability concerns. Hence, we adopt recent local and global
model-agnostic interpretation tools to interpret how the model arrives at its
predictions. Our findings reveal the great potential of ML algorithms for
enhanced travel behaviour predictions for low-income strata without
considerably sacrificing interpretability.
","[{'version': 'v1', 'created': 'Wed, 30 Nov 2022 04:48:58 GMT'}]",2022-12-01,"[['Barri', 'Elnaz Yousefzadeh', ''], ['Farber', 'Steven', ''], ['Jahanshahi', 'Hadi', ''], ['Beyazit', 'Eda', '']]","['Machine Learning', 'Statistical Models', 'Transit Equity', 'Travelbehaviour', 'Travel Mode Choice']"
12322,2106.03058,Hanzhi Wang,"Hanzhi Wang, Mingguo He, Zhewei Wei, Sibo Wang, Ye Yuan, Xiaoyong Du
  and Ji-Rong Wen",Approximate Graph Propagation,ACM SIGKDD 2021,,10.1145/3447548.3467243,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efficient computation of node proximity queries such as transition
probabilities, Personalized PageRank, and Katz are of fundamental importance in
various graph mining and learning tasks. In particular, several recent works
leverage fast node proximity computation to improve the scalability of Graph
Neural Networks (GNN). However, prior studies on proximity computation and GNN
feature propagation are on a case-by-case basis, with each paper focusing on a
particular proximity measure.
  In this paper, we propose Approximate Graph Propagation (AGP), a unified
randomized algorithm that computes various proximity queries and GNN feature
propagation, including transition probabilities, Personalized PageRank, heat
kernel PageRank, Katz, SGC, GDC, and APPNP. Our algorithm provides a
theoretical bounded error guarantee and runs in almost optimal time complexity.
We conduct an extensive experimental study to demonstrate AGP's effectiveness
in two concrete applications: local clustering with heat kernel PageRank and
node classification with GNNs. Most notably, we present an empirical study on a
billion-edge graph Papers100M, the largest publicly available GNN dataset so
far. The results show that AGP can significantly improve various existing GNN
models' scalability without sacrificing prediction accuracy.
","[{'version': 'v1', 'created': 'Sun, 6 Jun 2021 08:11:36 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Jul 2021 06:07:14 GMT'}, {'version': 'v3', 'created': 'Fri, 26 Nov 2021 14:23:59 GMT'}]",2021-11-29,"[['Wang', 'Hanzhi', ''], ['He', 'Mingguo', ''], ['Wei', 'Zhewei', ''], ['Wang', 'Sibo', ''], ['Yuan', 'Ye', ''], ['Du', 'Xiaoyong', ''], ['Wen', 'Ji-Rong', '']]","['node proximity queries', 'local clustering', 'Graph Neural Networks']"
12323,2203.16328,Bo Shen,"Bo Shen, Weijun Xie and Zhenyu Kong","Smooth Robust Tensor Completion for Background/Foreground Separation
  with Missing Pixels: Novel Algorithm with Convergence Guarantee","40 pages, 11 figures",,10.48550/arXiv.2203.16328,,cs.CV cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  The objective of this study is to address the problem of
background/foreground separation with missing pixels by combining the video
acquisition, video recovery, background/foreground separation into a single
framework. To achieve this, a smooth robust tensor completion (SRTC) model is
proposed to recover the data and decompose it into the static background and
smooth foreground, respectively. Specifically, the static background is modeled
by the low-rank tucker decomposition and the smooth foreground (moving objects)
is modeled by the spatiotemporal continuity, which is enforced by the total
variation regularization. An efficient algorithm based on tensor proximal
alternating minimization (tenPAM) is implemented to solve the proposed model
with global convergence guarantee under very mild conditions. Extensive
experiments on real data demonstrate that the proposed method significantly
outperforms the state-of-the-art approaches for background/foreground
separation with missing pixels.
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2022 01:28:27 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Apr 2022 01:27:42 GMT'}]",2022-04-12,"[['Shen', 'Bo', ''], ['Xie', 'Weijun', ''], ['Kong', 'Zhenyu', '']]","['Robust Tensor Completion (RTC)', 'Spatio-temporal Continuity', 'Low-rankness', 'Tensor Proximal Alternating Minimization (tenPAM)', 'Global Convergence']"
12324,1909.06423,Valter Estevam,"Valter Estevam, Helio Pedrini, David Menotti",Zero-Shot Action Recognition in Videos: A Survey,Preprint,,10.1016/j.neucom.2021.01.036,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Zero-Shot Action Recognition has attracted attention in the last years and
many approaches have been proposed for recognition of objects, events and
actions in images and videos. There is a demand for methods that can classify
instances from classes that are not present in the training of models,
especially in the complex problem of automatic video understanding, since
collecting, annotating and labeling videos are difficult and laborious tasks.
We have identified that there are many methods available in the literature,
however, it is difficult to categorize which techniques can be considered state
of the art. Despite the existence of some surveys about zero-shot action
recognition in still images and experimental protocol, there is no work focused
on videos. Therefore, we present a survey of the methods that comprise
techniques to perform visual feature extraction and semantic feature extraction
as well to learn the mapping between these features considering specifically
zero-shot action recognition in videos. We also provide a complete description
of datasets, experiments and protocols, presenting open issues and directions
for future work, essential for the development of the computer vision research
field.
","[{'version': 'v1', 'created': 'Fri, 13 Sep 2019 19:57:27 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Nov 2020 17:10:24 GMT'}]",2021-12-17,"[['Estevam', 'Valter', ''], ['Pedrini', 'Helio', ''], ['Menotti', 'David', '']]","['Zero-shot learning', 'Video action recognition', 'Visual embedding', 'Semantic label embedding', 'Experimental protocols', 'Deep features']"
12325,1911.01890,Jun Zhao,Jun Zhao,Analyzing connectivity of heterogeneous secure sensor networks,Published in IEEE Transactions on Control of Network Systems,,10.1109/TCNS.2016.2641799,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze connectivity of a heterogeneous secure sensor network that uses
key predistribution to protect communications between sensors. For this network
on a set $\mathcal{V}_n$ of $n$ sensors, suppose there is a pool
$\mathcal{P}_n$ consisting of $P_n$ distinct keys. The $n$ sensors in
$\mathcal{V}_n$ are divided into $m$ groups $\mathcal{A}_1, \mathcal{A}_2,
\ldots, \mathcal{A}_m$. Each sensor $v$ is independently assigned to exactly a
group according to the probability distribution with $\mathbb{P}[v \in
\mathcal{A}_i]= a_i$ for $i=1,2,\ldots,m$, where $\sum_{i=1}^{m}a_i = 1$.
Afterwards, each sensor in group $\mathcal{A}_i$ independently chooses
$K_{i,n}$ keys uniformly at random from the key pool $\mathcal{P}_n$, where
$K_{1,n} \leq K_{2,n}\leq \ldots \leq K_{m,n}$. Finally, any two sensors in
$\mathcal{V}_n$ establish a secure link in between if and only if they have at
least one key in common. We present critical conditions for connectivity of
this heterogeneous secure sensor network. The result provides useful guidelines
for the design of secure sensor networks.
  This paper improves the seminal work [1] (IEEE Transactions on Information
Theory 2016) of Ya{\u{g}}an on connectivity in several aspects (omitted due to
arxiv abstract's character limitation; see the paper for details).
","[{'version': 'v1', 'created': 'Sat, 2 Nov 2019 15:21:47 GMT'}]",2019-11-06,"[['Zhao', 'Jun', '']]","['Secure sensor networks', 'heterogeneity', 'connectivity', 'key predistribution']"
12326,1811.06002,Gennady Ososkov Alexeevich,"Dmitriy Baranov, Gennady Ososkov, Pavel Goncharov, Andrei Tsytrinov",Catch and Prolong: recurrent neural network for seeking track-candidates,"5 pages, 1 figure, XXII International Scientific Conference of Young
  Scientists and Specialists (AYSS-2018), April 23-27, 2018,
  http://ayss-2018.jinr.ru",,10.1051/epjconf/201920105001,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  One of the most important problems of data processing in high energy and
nuclear physics is the event reconstruction. Its main part is the track
reconstruction procedure which consists in looking for all tracks that
elementary particles leave when they pass through a detector among a huge
number of points, so-called hits, produced when flying particles fire detector
coordinate planes. Unfortunately, the tracking is seriously impeded by the
famous shortcoming of multiwired, strip and GEM detectors due to appearance in
them a lot of fake hits caused by extra spurious crossings of fired strips.
Since the number of those fakes is several orders of magnitude greater than for
true hits, one faces with the quite serious difficulty to unravel possible
track-candidates via true hits ignoring fakes. We introduce a renewed method
that is a significant improvement of our previous two-stage approach based on
hit preprocessing using directed K-d tree search followed a deep neural
classifier. We combine these two stages in one by applying recurrent neural
network that simultaneously determines whether a set of points belongs to a
true track or not and predicts where to look for the next point of track on the
next coordinate plane of the detector. We show that proposed deep network is
more accurate, faster and does not require any special preprocessing stage.
Preliminary results of our approach for simulated events of the BM@N GEM
detector are presented.
","[{'version': 'v1', 'created': 'Wed, 14 Nov 2018 19:03:26 GMT'}]",2019-02-20,"[['Baranov', 'Dmitriy', ''], ['Ososkov', 'Gennady', ''], ['Goncharov', 'Pavel', ''], ['Tsytrinov', 'Andrei', '']]","['tracking', 'BM@N experiment', 'GEM detectors', 'directed search', 'recurrent neural networks']"
12327,2011.02280,Luca Magri,"Nguyen Anh Khoa Doan, Wolfgang Polifke, Luca Magri",Physics-Informed Echo State Networks,"10 pages, 11 figures. arXiv admin note: substantial text overlap with
  arXiv:1906.11122","Journal of computational science, 2020",10.1016/j.jocs.2020.101237,,cs.LG nlin.CD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a physics-informed Echo State Network (ESN) to predict the
evolution of chaotic systems. Compared to conventional ESNs, the
physics-informed ESNs are trained to solve supervised learning tasks while
ensuring that their predictions do not violate physical laws. This is achieved
by introducing an additional loss function during the training, which is based
on the system's governing equations. The additional loss function penalizes
non-physical predictions without the need of any additional training data. This
approach is demonstrated on a chaotic Lorenz system and a truncation of the
Charney-DeVore system. Compared to the conventional ESNs, the physics-informed
ESNs improve the predictability horizon by about two Lyapunov times. This
approach is also shown to be robust with regard to noise. The proposed
framework shows the potential of using machine learning combined with prior
physical knowledge to improve the time-accurate prediction of chaotic dynamical
systems.
","[{'version': 'v1', 'created': 'Sat, 31 Oct 2020 11:47:33 GMT'}]",2020-11-05,"[['Doan', 'Nguyen Anh Khoa', ''], ['Polifke', 'Wolfgang', ''], ['Magri', 'Luca', '']]","['Echo State Networks', 'Physics-Informed Neural Networks', 'Chaotic Dynamical Systems']"
12328,1904.08577,William La Cava,"William La Cava, Jason H. Moore",Semantic variation operators for multidimensional genetic programming,"9 pages, 8 figures, GECCO 2019",,10.1145/3321707.3321776,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multidimensional genetic programming represents candidate solutions as sets
of programs, and thereby provides an interesting framework for exploiting
building block identification. Towards this goal, we investigate the use of
machine learning as a way to bias which components of programs are promoted,
and propose two semantic operators to choose where useful building blocks are
placed during crossover. A forward stagewise crossover operator we propose
leads to significant improvements on a set of regression problems, and produces
state-of-the-art results in a large benchmark study. We discuss this
architecture and others in terms of their propensity for allowing heuristic
search to utilize information during the evolutionary process. Finally, we look
at the collinearity and complexity of the data representations that result from
these architectures, with a view towards disentangling factors of variation in
application.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2019 03:05:37 GMT'}]",2019-04-19,"[['La Cava', 'William', ''], ['Moore', 'Jason H.', '']]","['representation learning', 'feature construction', 'variation', 'regression']"
12329,2008.12259,Nassim Dehouche,Nassim Dehouche,"The k-interchange-constrained diameter of a transit network: A
  connectedness indicator that accounts for travel convenience",,"Transportation Letters The International Journal of Transportation
  Research Transportation Letters - Volume 12, 2020 - Issue 3",10.1080/19427867.2018.1564987,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study two variants of the shortest path problem. Given an integer k, the
k-color-constrained and the k-interchange-constrained shortest path problems,
respectively seek a shortest path that uses no more than k colors and one that
makes no more than k - 1 alternations of colors. We show that the former
problem is NP-hard, when the latter is tractable. The study of these problems
is motivated by some limitations in the use of diameter-based metrics to
evaluate the topological structure of transit networks. We notably show that
indicators such as the diameter or directness of a transit network fail to
adequately account for travel convenience in measuring the connectivity of a
network and propose a new network indicator, based on solving the
k-interchange-constrained shortest path problem, that aims at alleviating these
limitations.
","[{'version': 'v1', 'created': 'Thu, 27 Aug 2020 16:56:12 GMT'}]",2020-08-28,"[['Dehouche', 'Nassim', '']]","['Graph Theory', 'Shortest Path Problem', 'Computational Complexity', 'Transit Networks', 'Network Indicators']"
12330,1507.00691,Gwen Spencer PhD,Gwen Spencer,Sticky Seeding in Discrete-Time Reversible-Threshold Networks,"19 pages, 2 figures","Discrete Mathematics & Theoretical Computer Science, Vol. 18 no.
  3, Distributed Computing and Networking (March 17, 2016) dmtcs:1405",10.46298/dmtcs.1241,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When nodes can repeatedly update their behavior (as in agent-based models
from computational social science or repeated-game play settings) the problem
of optimal network seeding becomes very complex. For a popular
spreading-phenomena model of binary-behavior updating based on thresholds of
adoption among neighbors, we consider several planning problems in the design
of \textit{Sticky Interventions}: when adoption decisions are reversible, the
planner aims to find a Seed Set where temporary intervention leads to long-term
behavior change. We prove that completely converting a network at minimum cost
is $\Omega(\ln (OPT) )$-hard to approximate and that maximizing conversion
subject to a budget is $(1-\frac{1}{e})$-hard to approximate. Optimization
heuristics which rely on many objective function evaluations may still be
practical, particularly in relatively-sparse networks: we prove that the
long-term impact of a Seed Set can be evaluated in $O(|E|^2)$ operations. For a
more descriptive model variant in which some neighbors may be more influential
than others, we show that under integer edge weights from $\{0,1,2,...,k\}$
objective function evaluation requires only $O(k|E|^2)$ operations. These
operation bounds are based on improvements we give for bounds on
time-steps-to-convergence under discrete-time reversible-threshold updates in
networks.
","[{'version': 'v1', 'created': 'Thu, 2 Jul 2015 18:46:26 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Jan 2016 18:50:48 GMT'}, {'version': 'v3', 'created': 'Tue, 8 Mar 2016 15:52:46 GMT'}, {'version': 'v4', 'created': 'Wed, 9 Mar 2016 13:10:16 GMT'}]",2021-10-04,"[['Spencer', 'Gwen', '']]","['Network seeding', 'Spreading phenomenon', 'Combinatorial optimization', 'Convergence']"
12331,1806.07526,Vishal Sharma,"Takshi Gupta, Gaurav Choudhary, Vishal Sharma",A Survey on the Security of Pervasive Online Social Networks (POSNs),"39 Pages, 10 Figures","Journal of Internet Services and Information Security (JISIS),
  8(2), 48--86, May 2018",10.22667/JISIS.2018.05.31.048,,cs.NI cs.CR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pervasive Online Social Networks (POSNs) are the extensions of Online Social
Networks (OSNs) which facilitate connectivity irrespective of the domain and
properties of users. POSNs have been accumulated with the convergence of a
plethora of social networking platforms with a motivation of bridging their
gap. Over the last decade, OSNs have visually perceived an altogether
tremendous amount of advancement in terms of the number of users as well as
technology enablers. A single OSN is the property of an organization, which
ascertains smooth functioning of its accommodations for providing a quality
experience to their users. However, with POSNs, multiple OSNs have coalesced
through communities, circles, or only properties, which make
service-provisioning tedious and arduous to sustain. Especially, challenges
become rigorous when the focus is on the security perspective of cross-platform
OSNs, which are an integral part of POSNs. Thus, it is of utmost paramountcy to
highlight such a requirement and understand the current situation while
discussing the available state-of-the-art. With the modernization of OSNs and
convergence towards POSNs, it is compulsory to understand the impact and reach
of current solutions for enhancing the security of users as well as associated
services. This survey understands this requisite and fixates on different sets
of studies presented over the last few years and surveys them for their
applicability to POSNs...
","[{'version': 'v1', 'created': 'Wed, 20 Jun 2018 02:23:06 GMT'}]",2018-06-21,"[['Gupta', 'Takshi', ''], ['Choudhary', 'Gaurav', ''], ['Sharma', 'Vishal', '']]","['Anomaly', 'Online Social Networks', 'POSNs', 'Security', 'Trust', 'IoT']"
12332,2202.12242,Marcos Faundez-Zanuy,"Joan Fabregas, Marcos Faundez-Zanuy",On-line signature verification system with failure to enroll managing,35 pages,"Pattern Recognition Volume 42, Issue 9, September 2009, Pages
  2117-2126",10.1016/j.patcog.2009.01.019,,cs.CV cs.CR cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this paper we simulate a real biometric verification system based on
on-line signatures. For this purpose we have split the MCYT signature database
in three subsets: one for classifier training, another for system adjustment
and a third one for system testing simulating enrollment and verification. This
context corresponds to a real operation, where a new user tries to enroll an
existing system and must be automatically guided by the system in order to
detect the failure to enroll situations. The main contribution of this work is
the management of failure to enroll situations by means of a new proposal,
called intelligent enrollment, which consists of consistency checking in order
to automatically reject low quality samples. This strategy lets to enhance the
verification errors up to 22% when leaving out 8% of the users. In this
situation 8% of the people cannot be enrolled in the system and must be
verified by other biometrics or by human abilities. These people are identified
with intelligent enrollment and the situation can be thus managed. In addition
we also propose a DCT-based feature extractor with threshold coding and
discriminability criteria.
","[{'version': 'v1', 'created': 'Wed, 23 Feb 2022 15:22:03 GMT'}]",2022-02-25,"[['Fabregas', 'Joan', ''], ['Faundez-Zanuy', 'Marcos', '']]","['On-line signatures', 'Biometric authentication', 'Feature extraction', 'Individual']"
12333,1506.05996,Rajesh Gandham,"J.-F. Remacle, R. Gandham, T. Warburton",GPU accelerated spectral finite elements on all-hex meshes,"23 pages, 7 figures",,10.1016/j.jcp.2016.08.005,,cs.CE cs.DC cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a spectral element finite element scheme that efficiently
solves elliptic problems on unstructured hexahedral meshes. The discrete
equations are solved using a matrix-free preconditioned conjugate gradient
algorithm. An additive Schwartz two-scale preconditioner is employed that
allows h-independence convergence. An extensible multi-threading programming
API is used as a common kernel language that allows runtime selection of
different computing devices (GPU and CPU) and different threading interfaces
(CUDA, OpenCL and OpenMP). Performance tests demonstrate that problems with
over 50 million degrees of freedom can be solved in a few seconds on an
off-the-shelf GPU.
","[{'version': 'v1', 'created': 'Fri, 19 Jun 2015 13:27:05 GMT'}]",2016-09-21,"[['Remacle', 'J. -F.', ''], ['Gandham', 'R.', ''], ['Warburton', 'T.', '']]","['Spectral Finite Elements', 'GPU computing', 'Hexahedral Meshes']"
12334,2008.09533,Md Momen Bhuiyan,"Md Momen Bhuiyan, Amy X. Zhang, Connie Moon Sehat and Tanushree Mitra","Investigating Differences in Crowdsourced News Credibility Assessment:
  Raters, Tasks, and Expert Criteria",,,10.1145/3415164,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Misinformation about critical issues such as climate change and vaccine
safety is oftentimes amplified on online social and search platforms. The
crowdsourcing of content credibility assessment by laypeople has been proposed
as one strategy to combat misinformation by attempting to replicate the
assessments of experts at scale. In this work, we investigate news credibility
assessments by crowds versus experts to understand when and how ratings between
them differ. We gather a dataset of over 4,000 credibility assessments taken
from 2 crowd groups---journalism students and Upwork workers---as well as 2
expert groups---journalists and scientists---on a varied set of 50 news
articles related to climate science, a topic with widespread disconnect between
public opinion and expert consensus. Examining the ratings, we find differences
in performance due to the makeup of the crowd, such as rater demographics and
political leaning, as well as the scope of the tasks that the crowd is assigned
to rate, such as the genre of the article and partisanship of the publication.
Finally, we find differences between expert assessments due to differing expert
criteria that journalism versus science experts use---differences that may
contribute to crowd discrepancies, but that also suggest a way to reduce the
gap by designing crowd tasks tailored to specific expert criteria. From these
findings, we outline future research directions to better design crowd
processes that are tailored to specific crowds and types of content.
","[{'version': 'v1', 'created': 'Fri, 21 Aug 2020 15:19:18 GMT'}]",2020-08-24,"[['Bhuiyan', 'Md Momen', ''], ['Zhang', 'Amy X.', ''], ['Sehat', 'Connie Moon', ''], ['Mitra', 'Tanushree', '']]","['misinformation', 'crowdsourcing', 'credibility', 'news', 'expert']"
12335,2107.05489,Matti Huotari,"Matti Huotari, Shashank Arora, Avleen Malhi, Kary Fr\""amling","Comparing seven methods for state-of-health time series prediction for
  the lithium-ion battery packs of forklifts","16 pages, 10 figures and 10 tables",Applied Soft Computing July 2021,10.1016/j.asoc.2021.107670,,cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  A key aspect for the forklifts is the state-of-health (SoH) assessment to
ensure the safety and the reliability of uninterrupted power source.
Forecasting the battery SoH well is imperative to enable preventive maintenance
and hence to reduce the costs. This paper demonstrates the capabilities of
gradient boosting regression for predicting the SoH timeseries under
circumstances when there is little prior information available about the
batteries. We compared the gradient boosting method with light gradient
boosting, extra trees, extreme gradient boosting, random forests, long
short-term memory networks and with combined convolutional neural network and
long short-term memory networks methods. We used multiple predictors and lagged
target signal decomposition results as additional predictors and compared the
yielded prediction results with different sets of predictors for each method.
For this work, we are in possession of a unique data set of 45 lithium-ion
battery packs with large variation in the data. The best model that we derived
was validated by a novel walk-forward algorithm that also calculates point-wise
confidence intervals for the predictions; we yielded reasonable predictions and
confidence intervals for the predictions. Furthermore, we verified this model
against five other lithium-ion battery packs; the best model generalised to
greater extent to this set of battery packs. The results about the final model
suggest that we were able to enhance the results in respect to previously
developed models. Moreover, we further validated the model for extracting cycle
counts presented in our previous work with data from new forklifts; their
battery packs completed around 3000 cycles in a 10-year service period, which
corresponds to the cycle life for commercial Nickel-Cobalt-Manganese (NMC)
cells.
","[{'version': 'v1', 'created': 'Tue, 6 Jul 2021 10:52:56 GMT'}]",2021-07-13,"[['Huotari', 'Matti', ''], ['Arora', 'Shashank', ''], ['Malhi', 'Avleen', ''], ['Främling', 'Kary', '']]","['Electrical vehicles', 'state-of-health for lithium-ion batteries', 'machine learning', 'neural networks', 'timeseries prediction']"
12336,2111.08227,Yuxuan Liang,"Yuxuan Liang, Chuang Niu, Chen Wei, Shenghan Ren, Wenxiang Cong and Ge
  Wang",Phase function estimation from a diffuse optical image via deep learning,"16 pages, 8 figures",,10.1088/1361-6560/ac5b21,,cs.LG physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The phase function is a key element of a light propagation model for Monte
Carlo (MC) simulation, which is usually fitted with an analytic function with
associated parameters. In recent years, machine learning methods were reported
to estimate the parameters of the phase function of a particular form such as
the Henyey-Greenstein phase function but, to our knowledge, no studies have
been performed to determine the form of the phase function. Here we design a
convolutional neural network to estimate the phase function from a diffuse
optical image without any explicit assumption on the form of the phase
function. Specifically, we use a Gaussian mixture model as an example to
represent the phase function generally and learn the model parameters
accurately. The Gaussian mixture model is selected because it provides the
analytic expression of phase function to facilitate deflection angle sampling
in MC simulation, and does not significantly increase the number of free
parameters. Our proposed method is validated on MC-simulated reflectance images
of typical biological tissues using the Henyey-Greenstein phase function with
different anisotropy factors. The effects of field of view (FOV) and spatial
resolution on the errors are analyzed to optimize the estimation method. The
mean squared error of the phase function is 0.01 and the relative error of the
anisotropy factor is 3.28%.
","[{'version': 'v1', 'created': 'Tue, 16 Nov 2021 04:59:25 GMT'}]",2022-04-06,"[['Liang', 'Yuxuan', ''], ['Niu', 'Chuang', ''], ['Wei', 'Chen', ''], ['Ren', 'Shenghan', ''], ['Cong', 'Wenxiang', ''], ['Wang', 'Ge', '']]","['Light propagation', 'Phase function', 'Henyey-Greenstein phase function', 'Gaussian mixture model', 'Monte Carlo simulation', 'Convolutional neural network']"
12337,2205.00600,Hongquan Zhu,"Hongquan Zhu, Xincheng He, Lei Xu","HatCUP: Hybrid Analysis and Attention based Just-In-Time Comment
  Updating",to be published in ICPC 2022,,10.1145/3524610.3527901,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When changing code, developers sometimes neglect updating the related
comments, bringing inconsistent or outdated comments. These comments increase
the cost of program understanding and greatly reduce software maintainability.
Researchers have put forward some solutions, such as CUP and HEBCUP, which
update comments efficiently for simple code changes (i.e. modifying of a single
token), but not good enough for complex ones. In this paper, we propose an
approach, named HatCUP (Hybrid Analysis and Attention based Comment UPdater),
to provide a new mechanism for comment updating task. HatCUP pays attention to
hybrid analysis and information. First, HatCUP considers the code structure
change information and introduces a structure-guided attention mechanism
combined with code change graph analysis and optimistic data flow dependency
analysis. With a generally popular RNN-based encoder-decoder architecture,
HatCUP takes the action of the code edits, the syntax, semantics and structure
code changes, and old comments as inputs and generates a structural
representation of the changes in the current code snippet. Furthermore, instead
of directly generating new comments, HatCUP proposes a new edit or non-edit
mechanism to mimic human editing behavior, by generating a sequence of edit
actions and constructing a modified RNN model to integrate newly developed
components. Evaluation on a popular dataset demonstrates that HatCUP
outperforms the state-of-the-art deep learning-based approaches (CUP) by 53.8%
for accuracy, 31.3% for recall and 14.3% for METEOR of the original metrics.
Compared with the heuristic-based approach (HEBCUP), HatCUP also shows better
overall performance.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 01:02:52 GMT'}]",2022-05-03,"[['Zhu', 'Hongquan', ''], ['He', 'Xincheng', ''], ['Xu', 'Lei', '']]","['comment updating', 'code-comment co-evolution', 'hybrid analysis', 'data flow analysis', 'deep learning']"
12338,1906.01965,Yaoming Zhu,"Yaoming Zhu, Juncheng Wan, Zhiming Zhou, Liheng Chen, Lin Qiu, Weinan
  Zhang, Xin Jiang, Yong Yu","Triple-to-Text: Converting RDF Triples into High-Quality Natural
  Languages via Optimizing an Inverse KL Divergence",,,10.1145/3331184.3331232,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge base is one of the main forms to represent information in a
structured way. A knowledge base typically consists of Resource Description
Frameworks (RDF) triples which describe the entities and their relations.
Generating natural language description of the knowledge base is an important
task in NLP, which has been formulated as a conditional language generation
task and tackled using the sequence-to-sequence framework. Current works mostly
train the language models by maximum likelihood estimation, which tends to
generate lousy sentences. In this paper, we argue that such a problem of
maximum likelihood estimation is intrinsic, which is generally irrevocable via
changing network structures. Accordingly, we propose a novel Triple-to-Text
(T2T) framework, which approximately optimizes the inverse Kullback-Leibler
(KL) divergence between the distributions of the real and generated sentences.
Due to the nature that inverse KL imposes large penalty on fake-looking
samples, the proposed method can significantly reduce the probability of
generating low-quality sentences. Our experiments on three real-world datasets
demonstrate that T2T can generate higher-quality sentences and outperform
baseline models in several evaluation metrics.
","[{'version': 'v1', 'created': 'Sat, 25 May 2019 03:05:15 GMT'}]",2019-06-06,"[['Zhu', 'Yaoming', ''], ['Wan', 'Juncheng', ''], ['Zhou', 'Zhiming', ''], ['Chen', 'Liheng', ''], ['Qiu', 'Lin', ''], ['Zhang', 'Weinan', ''], ['Jiang', 'Xin', ''], ['Yu', 'Yong', '']]","['Natural Language Generation', 'Sequence to Sequence Generation', 'Knowledge Bases']"
12339,2101.04057,Bernardo Furtado,"L\'igia Mori Madeira, Bernardo Alves Furtado, Alan Rafael Dill","VIDA: A simulation model of domestic VIolence in times of social
  DistAncing","20 pages, 3 figures, 4 tables",,10.18564/jasss.4612,,cs.MA,http://creativecommons.org/licenses/by/4.0/,"  Violence against women occurs predominantly in the family and domestic
context. The COVID-19 pandemic led Brazil to recommend and, at times, impose
social distancing, with the partial closure of economic activities, schools,
and restrictions on events and public services. Preliminary evidence shows that
intense coexistence increases domestic violence, while social distancing
measures may have prevented access to public services and networks,
information, and help. We propose an agent-based model (ABM), called VIDA, to
illustrate and examine multi-causal factors that influence events that generate
violence. A central part of the model is the multi-causal stress indicator,
created as a probability trigger of domestic violence occurring within the
family environment. Two experimental design tests were performed: (a) absence
or presence of the deterrence system of domestic violence against women and (b)
measures to increase social distancing. VIDA presents comparative results for
metropolitan regions and neighbourhoods considered in the experiments. Results
suggest that social distancing measures, particularly those encouraging staying
at home, may have increased domestic violence against women by about 10%. VIDA
suggests further that more populated areas have comparatively fewer cases per
hundred thousand women than less populous capitals or rural areas of urban
concentrations. This paper contributes to the literature by formalising, to the
best of our knowledge, the first model of domestic violence through agent-based
modelling, using empirical detailed socioeconomic, demographic, educational,
gender, and race data at the intraurban level (census sectors).
","[{'version': 'v1', 'created': 'Mon, 11 Jan 2021 17:42:49 GMT'}]",2021-08-13,"[['Madeira', 'Lígia Mori', ''], ['Furtado', 'Bernardo Alves', ''], ['Dill', 'Alan Rafael', '']]","['Domestic Violence', 'Violence against Women', 'Agent-basedModels (ABMs)', 'Pandemics', 'Simulation', 'Metropolitan Regions']"
12340,2011.05703,Robin Delabays,Robin Delabays and Melvyn Tyloo,"Heavy-Tailed Distribution of the Number of Papers within Scientific
  Journals","Main text: 12 pages, 8 figures, 4 tables. 2 supplementary figures",,10.1162/qss_a_00201,,cs.DL physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  Scholarly publications represent at least two benefits for the study of the
scientific community as a social group. First, they attest of some form of
relation between scientists (collaborations, mentoring, heritage,...), useful
to determine and analyze social subgroups. Second, most of them are recorded in
large data bases, easily accessible and including a lot of pertinent
information, easing the quantitative and qualitative study of the scientific
community. Understanding the underlying dynamics driving the creation of
knowledge in general, and of scientific publication in particular can
contribute to maintaining a high level of research, by identifying good and bad
practices in science. In this article, we aim at advancing this understanding
by a statistical analysis of publication within peer-reviewed journals. Namely,
we show that the distribution of the number of papers published by an author in
a given journal is heavy-tailed, but has lighter tail than a power law.
Interestingly, we demonstrate (both analytically and numerically) that such
distributions match the result of an modified preferential attachment process,
where, on top of a Barab\'asi-Albert process, we take finite career span of
scientists into account.
","[{'version': 'v1', 'created': 'Wed, 11 Nov 2020 11:13:58 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Feb 2022 00:09:07 GMT'}, {'version': 'v3', 'created': 'Sun, 7 Aug 2022 01:20:53 GMT'}]",2022-08-09,"[['Delabays', 'Robin', ''], ['Tyloo', 'Melvyn', '']]","['Heavy-tail', 'publications', 'scholarly journals', 'preferential attachment', 'cumulative advantage']"
12341,1708.05221,Mina Rezaei,"Mina Rezaei, Haojin Yang and Christoph Meinel",Deep Neural Network with l2-norm Unit for Brain Lesions Detection,Accepted for presentation in ICONIP-2017,Springer2017,10.1007/978-3-319-70093-9_85,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated brain lesions detection is an important and very challenging
clinical diagnostic task because the lesions have different sizes, shapes,
contrasts, and locations. Deep Learning recently has shown promising progress
in many application fields, which motivates us to apply this technology for
such important problem. In this paper, we propose a novel and end-to-end
trainable approach for brain lesions classification and detection by using deep
Convolutional Neural Network (CNN). In order to investigate the applicability,
we applied our approach on several brain diseases including high and low-grade
glioma tumor, ischemic stroke, Alzheimer diseases, by which the brain Magnetic
Resonance Images (MRI) have been applied as an input for the analysis. We
proposed a new operating unit which receives features from several projections
of a subset units of the bottom layer and computes a normalized l2-norm for
next layer. We evaluated the proposed approach on two different CNN
architectures and number of popular benchmark datasets. The experimental
results demonstrate the superior ability of the proposed approach.
","[{'version': 'v1', 'created': 'Thu, 17 Aug 2017 12:11:45 GMT'}]",2018-01-08,"[['Rezaei', 'Mina', ''], ['Yang', 'Haojin', ''], ['Meinel', 'Christoph', '']]","['Multimodal CNN', 'l2-norm unit', 'Brain lesion detection andlocalization']"
12342,2211.09511,Mikel Kengni Ngueajio,Mikel K. Ngueajio and Gloria Washington,"Hey ASR System! Why Aren't You More Inclusive? Automatic Speech
  Recognition Systems' Bias and Proposed Bias Mitigation Techniques. A
  Literature Review","In press at HCI International 2022 - Late Breaking Papers:
  Interacting with eXtended Reality and Artificial Intelligence, LNCS 13518","HCI InternationaLate Breaking Papers: Interacting with eXtended
  Reality and Artificial Intelligence. HCII 2022. Lecture Notes in Computer
  Science, vol 13518. Springer, Cham",10.1007/978-3-031-21707-4_30,421--440,cs.CL cs.CY cs.HC cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Speech is the fundamental means of communication between humans. The advent
of AI and sophisticated speech technologies have led to the rapid proliferation
of human-to-computer-based interactions, fueled primarily by Automatic Speech
Recognition (ASR) systems. ASR systems normally take human speech in the form
of audio and convert it into words, but for some users, it cannot decode the
speech, and any output text is filled with errors that are incomprehensible to
the human reader. These systems do not work equally for everyone and actually
hinder the productivity of some users. In this paper, we present research that
addresses ASR biases against gender, race, and the sick and disabled, while
exploring studies that propose ASR debiasing techniques for mitigating these
discriminations. We also discuss techniques for designing a more accessible and
inclusive ASR technology. For each approach surveyed, we also provide a summary
of the investigation and methods applied, the ASR systems and corpora used, and
the research findings, and highlight their strengths and/or weaknesses.
Finally, we propose future opportunities for Natural Language Processing
researchers to explore in the next level creation of ASR technologies.
","[{'version': 'v1', 'created': 'Thu, 17 Nov 2022 13:15:58 GMT'}]",2022-12-01,"[['Ngueajio', 'Mikel K.', ''], ['Washington', 'Gloria', '']]","['ASR Systems', 'Speech and Language processing', 'Responsible AI']"
12343,2005.05910,Antonio J. Pe\v{n}a,"Sergio Iserte and Rafael Mayo and Enrique S. Quintana-Orti and Vicenc
  Beltran and Antonio J. Pe\~na","DMR API: Improving cluster productivity by turning applications into
  malleable",,"S. Iserte, R. Mayo, E. S. Quintana-Orti, V. Beltran, and A. J.
  Pe\~na, ""DMR API: Improving cluster productivity by turning applications into
  malleable"", Parallel Computing, Elsevier, vol. 78, pp. 54-66, Oct. 2018",10.1016/j.parco.2018.07.006,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Adaptive workloads can change on--the--fly the configuration of their jobs,
in terms of number of processes. In order to carry out these job
reconfigurations, we have designed a methodology which enables a job to
communicate with the resource manager and, through the runtime, to change its
number of MPI ranks. The collaboration between both the workload
manager---aware of the queue of jobs and the resource allocation---and the
parallel runtime---able to transparently handle the processes and the program
data---is crucial for our throughput-aware malleability methodology. Hence,
when a job triggers a reconfiguration, the resource manager will check the
cluster status and return an action: an expansion, if there are spare
resources; a shrink, if queued jobs can be initiated; or none, if no change can
improve the global productivity. In this paper, we describe the internals of
our framework and how it is capable of reducing the global workload completion
time along with providing a smarter usage of the underlying resources. For this
purpose, we present a thorough study of the adaptive workloads processing by
showing the detailed behavior of our framework in representative experiments
and the low overhead that our reconfiguration involves.
","[{'version': 'v1', 'created': 'Tue, 12 May 2020 16:41:55 GMT'}, {'version': 'v2', 'created': 'Thu, 28 May 2020 22:31:28 GMT'}]",2020-06-01,"[['Iserte', 'Sergio', ''], ['Mayo', 'Rafael', ''], ['Quintana-Orti', 'Enrique S.', ''], ['Beltran', 'Vicenc', ''], ['Peña', 'Antonio J.', '']]","['MPI Malleability', 'Job Reconfiguration', 'Dynamic Reallocation', 'Smart Resource Utilization', 'Adaptive workload']"
12344,1911.05994,Suthee Ruangwises,"Suthee Ruangwises, Toshiya Itoh",Securely Computing the $n$-Variable Equality Function with $2n$ Cards,A preliminary version of this paper has appeared at TAMC 2020,"Theoretical Computer Science, 887: 99-110 (2021)",10.1016/j.tcs.2021.07.007,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Research in the area of secure multi-party computation using a deck of
playing cards, often called card-based cryptography, started from the
introduction of the five-card trick protocol to compute the logical AND
function by den Boer in 1989. Since then, many card-based protocols to compute
various functions have been developed. In this paper, we propose two new
protocols that securely compute the $n$-variable equality function (determining
whether all inputs are equal) $E: \{0,1\}^n \rightarrow \{0,1\}$ using $2n$
cards. The first protocol can be generalized to compute any doubly symmetric
function $f: \{0,1\}^n \rightarrow \mathbb{Z}$ using $2n$ cards, and any
symmetric function $f: \{0,1\}^n \rightarrow \mathbb{Z}$ using $2n+2$ cards.
The second protocol can be generalized to compute the $k$-candidate
$n$-variable equality function $E: (\mathbb{Z}/k\mathbb{Z})^n \rightarrow
\{0,1\}$ using $2 \lceil \lg k \rceil n$ cards.
","[{'version': 'v1', 'created': 'Thu, 14 Nov 2019 08:38:36 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Nov 2020 12:01:13 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Nov 2020 02:20:10 GMT'}, {'version': 'v4', 'created': 'Thu, 26 Nov 2020 19:47:10 GMT'}, {'version': 'v5', 'created': 'Sun, 8 Aug 2021 12:22:51 GMT'}, {'version': 'v6', 'created': 'Mon, 27 Sep 2021 13:02:40 GMT'}]",2021-09-28,"[['Ruangwises', 'Suthee', ''], ['Itoh', 'Toshiya', '']]","['card-based cryptography', 'secure multi-party computation', 'equalityfunction', 'symmetric function', 'doubly symmetric function']"
12345,1801.09229,David Chalupa,"David Chalupa, Ken A Hawick","GraphCombEx: A Software Tool for Exploration of Combinatorial
  Optimisation Properties of Large Graphs",,,10.1007/s00500-018-3230-x,,cs.SI cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a prototype of a software tool for exploration of multiple
combinatorial optimisation problems in large real-world and synthetic complex
networks. Our tool, called GraphCombEx (an acronym of Graph Combinatorial
Explorer), provides a unified framework for scalable computation and
presentation of high-quality suboptimal solutions and bounds for a number of
widely studied combinatorial optimisation problems. Efficient representation
and applicability to large-scale graphs and complex networks are particularly
considered in its design. The problems currently supported include maximum
clique, graph colouring, maximum independent set, minimum vertex clique
covering, minimum dominating set, as well as the longest simple cycle problem.
Suboptimal solutions and intervals for optimal objective values are estimated
using scalable heuristics. The tool is designed with extensibility in mind,
with the view of further problems and both new fast and high-performance
heuristics to be added in the future. GraphCombEx has already been successfully
used as a support tool in a number of recent research studies using
combinatorial optimisation to analyse complex networks, indicating its promise
as a research software tool.
","[{'version': 'v1', 'created': 'Sun, 28 Jan 2018 13:43:50 GMT'}]",2018-05-15,"[['Chalupa', 'David', ''], ['Hawick', 'Ken A', '']]","['GraphCombEx', 'Graph Combinatorial Explorer', 'complex networks', 'large sparse graphs', 'combinatorial optimisation problems', 'researchsoftware']"
12346,2204.13001,Alex Falcon,"Alex Falcon and Swathikiran Sudhakaran and Giuseppe Serra and Sergio
  Escalera and Oswald Lanz",Relevance-based Margin for Contrastively-trained Video Retrieval Models,"Accepted for presentation at International Conference on Multimedia
  Retrieval (ICMR '22)",,10.1145/3512527.3531395,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video retrieval using natural language queries has attracted increasing
interest due to its relevance in real-world applications, from intelligent
access in private media galleries to web-scale video search. Learning the
cross-similarity of video and text in a joint embedding space is the dominant
approach. To do so, a contrastive loss is usually employed because it organizes
the embedding space by putting similar items close and dissimilar items far.
This framework leads to competitive recall rates, as they solely focus on the
rank of the groundtruth items. Yet, assessing the quality of the ranking list
is of utmost importance when considering intelligent retrieval systems, since
multiple items may share similar semantics, hence a high relevance. Moreover,
the aforementioned framework uses a fixed margin to separate similar and
dissimilar items, treating all non-groundtruth items as equally irrelevant. In
this paper we propose to use a variable margin: we argue that varying the
margin used during training based on how much relevant an item is to a given
query, i.e. a relevance-based margin, easily improves the quality of the
ranking lists measured through nDCG and mAP. We demonstrate the advantages of
our technique using different models on EPIC-Kitchens-100 and YouCook2. We show
that even if we carefully tuned the fixed margin, our technique (which does not
have the margin as a hyper-parameter) would still achieve better performance.
Finally, extensive ablation studies and qualitative analysis support the
robustness of our approach. Code will be released at
\url{https://github.com/aranciokov/RelevanceMargin-ICMR22}.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2022 15:16:11 GMT'}]",2022-04-28,"[['Falcon', 'Alex', ''], ['Sudhakaran', 'Swathikiran', ''], ['Serra', 'Giuseppe', ''], ['Escalera', 'Sergio', ''], ['Lanz', 'Oswald', '']]","['deep learning', 'cross-modal retrieval', 'video retrieval', 'relevance']"
12347,1702.05265,Franz J. Brandenburg,Franz J. Brandenburg,T-Shape Visibility Representations of 1-Planar Graphs,"26 pages, 8 figures",,10.1016/j.comgeo.2017.10.007,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A shape visibility representation displays a graph so that each vertex is
represented by an orthogonal polygon of a particular shape and for each edge
there is a horizontal or vertical line of sight between the polygons assigned
to its endvertices. Special shapes are rectangles, L, T, E and H-shapes, and
caterpillars. A flat rectangle is a horizontal bar of height $\epsilon>0$. A
graph is 1-planar if there is a drawing in the plane such that each edge is
crossed at most once and is IC-planar if in addition no two crossing edges
share a vertex.
  We show that every IC-planar graph has a flat rectangle visibility
representation and that every 1-planar graph has a T-shape visibility
representation. The representations use quadratic area and can be computed in
linear time from a given embedding.
","[{'version': 'v1', 'created': 'Fri, 17 Feb 2017 09:19:02 GMT'}]",2018-01-25,"[['Brandenburg', 'Franz J.', '']]","['Graph Drawing', 'visibility representations', 'orthogonal polygons', 'beyond-planar graphs']"
12348,2107.13373,Ludovic Mignot,"Samira Attou, Ludovic Mignot and Djelloul Ziadi",Bottom-Up Derivatives of Tree Expressions,,RAIRO-Theor. Inf. Appl. 55 (2021) 4,10.1051/ita/2021008,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we extend the notion of (word) derivatives and partial
derivatives due to (respectively) Brzozowski and Antimirov to tree derivatives
using already known inductive formulae of quotients.
  We define a new family of extended regular tree expressions (using negation
or intersection operators), and we show how to compute a Brzozowski-like
inductive tree automaton; the fixed point of this construction, when it exists,
is the derivative tree automaton.
  Such a deterministic tree automaton can be used to solve the membership test
efficiently: the whole structure is not necessarily computed, and the
derivative computations can be performed in parallel.
  We also show how to solve the membership test using our (Bottom-Up) partial
derivatives, without computing an automaton.
","[{'version': 'v1', 'created': 'Wed, 28 Jul 2021 14:03:44 GMT'}]",2021-07-29,"[['Attou', 'Samira', ''], ['Mignot', 'Ludovic', ''], ['Ziadi', 'Djelloul', '']]","['Regular tree expressions', 'derivatives tree automata', 'partial derivatives', 'bottom-Up derivatives']"
12349,2210.17292,Chaohe Zhang,"Chaohe Zhang, Xu Chu, Liantao Ma, Yinghao Zhu, Yasha Wang, Jiangtao
  Wang, Junfeng Zhao","M$^3$Care: Learning with Missing Modalities in Multimodal Healthcare
  Data",9 pages,KDD 2022,10.1145/3534678.3539388,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multimodal electronic health record (EHR) data are widely used in clinical
applications. Conventional methods usually assume that each sample (patient) is
associated with the unified observed modalities, and all modalities are
available for each sample. However, missing modality caused by various clinical
and social reasons is a common issue in real-world clinical scenarios. Existing
methods mostly rely on solving a generative model that learns a mapping from
the latent space to the original input space, which is an unstable ill-posed
inverse problem. To relieve the underdetermined system, we propose a model
solving a direct problem, dubbed learning with Missing Modalities in Multimodal
healthcare data (M3Care). M3Care is an end-to-end model compensating the
missing information of the patients with missing modalities to perform clinical
analysis. Instead of generating raw missing data, M3Care imputes the
task-related information of the missing modalities in the latent space by the
auxiliary information from each patient's similar neighbors, measured by a
task-guided modality-adaptive similarity metric, and thence conducts the
clinical tasks. The task-guided modality-adaptive similarity metric utilizes
the uncensored modalities of the patient and the other patients who also have
the same uncensored modalities to find similar patients. Experiments on
real-world datasets show that M3Care outperforms the state-of-the-art
baselines. Moreover, the findings discovered by M3Care are consistent with
experts and medical knowledge, demonstrating the capability and the potential
of providing useful insights and explanations.
","[{'version': 'v1', 'created': 'Fri, 28 Oct 2022 02:38:40 GMT'}]",2022-11-01,"[['Zhang', 'Chaohe', ''], ['Chu', 'Xu', ''], ['Ma', 'Liantao', ''], ['Zhu', 'Yinghao', ''], ['Wang', 'Yasha', ''], ['Wang', 'Jiangtao', ''], ['Zhao', 'Junfeng', '']]","['healthcare informatics', 'multimodal data', 'electronic health record']"
12350,2001.02746,Suyun Bae,"Suyun ""Sandra"" Bae, Oh-Hyun Kwon, Senthil Chandrasegaran, Kwan-Liu Ma","Spinneret: Aiding Creative Ideation through Non-Obvious Concept
  Associations",ACM CHI 2020,,10.1145/3313831.3376746,,cs.HC cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mind mapping is a popular way to explore a design space in creative thinking
exercises, allowing users to form associations between concepts. Yet, most
existing digital tools for mind mapping focus on authoring and organization,
with little support for addressing the challenges of mind mapping such as
stagnation and design fixation. We present Spinneret, a functional approach to
aid mind mapping by providing suggestions based on a knowledge graph. Spinneret
uses biased random walks to explore the knowledge graph in the neighborhood of
an existing concept node in the mind map, and provides ""suggestions"" for the
user to add to the mind map. A comparative study with a baseline mind-mapping
tool reveals that participants created more diverse and distinct concepts with
Spinneret, and reported that the suggestions inspired them to think of ideas
they would otherwise not have explored.
","[{'version': 'v1', 'created': 'Wed, 8 Jan 2020 21:28:06 GMT'}]",2020-01-10,"[['Bae', 'Suyun ""Sandra""', ''], ['Kwon', 'Oh-Hyun', ''], ['Chandrasegaran', 'Senthil', ''], ['Ma', 'Kwan-Liu', '']]","['Mind mapping', 'Creativity', 'Knowledge Graph', 'Suggestion']"
12351,2206.08772,Pierre Gosselet,"Sandeep Kumar, Pierre Gosselet, Dengpeng Huang, Christian
  Wei{\ss}enfels, Peter Wriggers","Parallel Multiphysics Simulation for the Stabilized Optimal
  Transportation Meshfree (OTM)","21 page, 18 figures","Journal of Computational Science, 2022",10.1016/j.jocs.2022.101739,,cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper presents a parallel \PG{implementation} for the Optimal
Transportation Meshfree (OTM) method on large CPU clusters. Communications are
handled with the Message Passing Interface (MPI). The Recursive Coordinate
Bisection (RCB) algorithm is utilized for domain decomposition and for
implementing dynamic load-balancing strategy. This work involves three new
concepts to reduce the computational efforts: Dynamic halo regions, Efficient
data management strategies for ease of addition and deletion of nodes and
material points using advanced STL container, and nearest neighborhood
communication for detection of neighbors and communication. Also, Linked Cell
approach has been implemented to further reduce the computational efforts.
Parallel performance analysis is investigated for challenging multiphysics
applications like Taylor rod impact and serrated chip formation process.
Adequate scalability of parallel implementation for these applications is
reported.
","[{'version': 'v1', 'created': 'Fri, 17 Jun 2022 13:43:56 GMT'}]",2022-06-20,"[['Kumar', 'Sandeep', ''], ['Gosselet', 'Pierre', ''], ['Huang', 'Dengpeng', ''], ['Weißenfels', 'Christian', ''], ['Wriggers', 'Peter', '']]","['Optimal Transportation Meshfree Method', 'Parallel Computing', 'MPI', 'Dynamic']"
12352,2110.09132,Zhiquan Lai,"Shengwei Li, Zhiquan Lai, Dongsheng Li, Yiming Zhang, Xiangyu Ye, Yabo
  Duan","EmbRace: Accelerating Sparse Communication for Distributed Training of
  NLP Neural Networks",,,10.1145/3545008.3545011,,cs.LG cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed data-parallel training has been widely adopted for deep neural
network (DNN) models. Although current deep learning (DL) frameworks scale well
for dense models like image classification models, we find that these DL
frameworks have relatively low scalability for sparse models like natural
language processing (NLP) models that have highly sparse embedding tables. Most
existing works overlook the sparsity of model parameters thus suffering from
significant but unnecessary communication overhead. In this paper, we propose
EmbRace, an efficient communication framework to accelerate communications of
distributed training for sparse models. EmbRace introduces Sparsity-aware
Hybrid Communication, which integrates AlltoAll and model parallelism into
data-parallel training, so as to reduce the communication overhead of highly
sparse parameters. To effectively overlap sparse communication with both
backward and forward computation, EmbRace further designs a 2D Communication
Scheduling approach which optimizes the model computation procedure, relaxes
the dependency of embeddings, and schedules the sparse communications of each
embedding row with a priority queue. We have implemented a prototype of EmbRace
based on PyTorch and Horovod, and conducted comprehensive evaluations with four
representative NLP models. Experimental results show that EmbRace achieves up
to 2.41X speedup compared to the state-of-the-art distributed training
baselines.
","[{'version': 'v1', 'created': 'Mon, 18 Oct 2021 09:35:40 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Jun 2022 03:10:55 GMT'}]",2022-06-28,"[['Li', 'Shengwei', ''], ['Lai', 'Zhiquan', ''], ['Li', 'Dongsheng', ''], ['Zhang', 'Yiming', ''], ['Ye', 'Xiangyu', ''], ['Duan', 'Yabo', '']]","['distributed training', 'deep learning', 'sparsity of NLP models', 'communication scheduling']"
12353,2210.12298,Chen Chen,"Chen Chen, Matin Yarmand, Varun Singh, Michael V. Sherer, James D.
  Murphy, Yang Zhang, Nadir Weibel","VRContour: Bringing Contour Delineations of Medical Structures Into
  Virtual Reality","C. Chen, M. Yarmand, V. Singh, M.V. Sherer, J.D. Murphy, Y. Zhang and
  N. Weibel, ""VRContour: Bringing Contour Delineations of Medical Structures
  Into Virtual Reality"", 2022 IEEE International Symposium on Mixed and
  Augmented Reality (ISMAR), 2022, pp. 1-10, doi: 10.1109/ISMAR55827.2022.00020",,10.1109/ISMAR55827.2022.00020,,cs.HC cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Contouring is an indispensable step in Radiotherapy (RT) treatment planning.
However, today's contouring software is constrained to only work with a 2D
display, which is less intuitive and requires high task loads. Virtual Reality
(VR) has shown great potential in various specialties of healthcare and health
sciences education due to the unique advantages of intuitive and natural
interactions in immersive spaces. VR-based radiation oncology integration has
also been advocated as a target healthcare application, allowing providers to
directly interact with 3D medical structures. We present VRContour and
investigate how to effectively bring contouring for radiation oncology into VR.
Through an autobiographical iterative design, we defined three design spaces
focused on contouring in VR with the support of a tracked tablet and VR stylus,
and investigating dimensionality for information consumption and input (either
2D or 2D + 3D). Through a within-subject study (n = 8), we found that
visualizations of 3D medical structures significantly increase precision, and
reduce mental load, frustration, as well as overall contouring effort.
Participants also agreed with the benefits of using such metaphors for learning
purposes.
","[{'version': 'v1', 'created': 'Fri, 21 Oct 2022 23:22:21 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Nov 2022 04:47:20 GMT'}]",2022-11-09,"[['Chen', 'Chen', ''], ['Yarmand', 'Matin', ''], ['Singh', 'Varun', ''], ['Sherer', 'Michael V.', ''], ['Murphy', 'James D.', ''], ['Zhang', 'Yang', ''], ['Weibel', 'Nadir', '']]","['Human–Computer Interactions for Health', 'Radiotherapy (RT) Treatment Planning', 'VR in Health & Medical Applications']"
12354,1707.01556,Jean-Baptiste Chapelier,"Jean-Baptiste Chapelier, Bono Wasistho and Carlo Scalo","A Coherent vorticity preserving eddy viscosity correction for Large-Eddy
  Simulation",,,10.1016/j.jcp.2018.01.012,,cs.CE physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a new approach to Large-Eddy Simulation (LES) where
subgrid-scale (SGS) dissipation is applied proportionally to the degree of
local spectral broadening, hence mitigated or deactivated in regions dominated
by large-scale and/or laminar vortical motion. The proposed Coherent vorticity
preserving (CvP) LES methodology is based on the evaluation of the ratio of the
test-filtered to resolved (or grid-filtered) enstrophy $\sigma$. Values of
$\sigma$ close to 1 indicate low sub-test-filter turbulent activity, justifying
local deactivation of the SGS dissipation. The intensity of the SGS dissipation
is progressively increased for $\sigma < 1$ which corresponds to a small-scale
spectral broadening. The SGS dissipation is then fully activated in developed
turbulence characterized by $\sigma \le \sigma_{eq}$, where the value
$\sigma_{eq}$ is derived assuming a Kolmogorov spectrum. The proposed approach
can be applied to any eddy-viscosity model, is algorithmically simple and
computationally inexpensive. LES of Taylor-Green vortex breakdown demonstrates
that the CvP methodology improves the performance of traditional, non-dynamic
dissipative SGS models, capturing the peak of total turbulent kinetic energy
dissipation during transition. Similar accuracy is obtained by adopting
Germano's dynamic procedure albeit at more than twice the computational
overhead. A CvP-LES of a pair of unstable periodic helical vortices is shown to
predict accurately the experimentally observed growth rate using coarse
resolutions. The ability of the CvP methodology to dynamically sort the
coherent, large-scale motion from the smaller, broadband scales during
transition is demonstrated via flow visualizations. LES of compressible channel
are carried out and show a good match with a reference DNS.
","[{'version': 'v1', 'created': 'Wed, 5 Jul 2017 19:37:50 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Dec 2017 18:06:35 GMT'}]",2018-02-14,"[['Chapelier', 'Jean-Baptiste', ''], ['Wasistho', 'Bono', ''], ['Scalo', 'Carlo', '']]","['Large-Eddy Simulation', 'dynamic models', 'coherent vortices', 'enstrophy', 'turbulence sensor']"
12355,2002.08101,Martin Florian,"Martin Florian, Sebastian Henningsen, Charmaine Ndolo, Bj\""orn
  Scheuermann",The Sum of Its Parts: Analysis of Federated Byzantine Agreement Systems,,,10.1007/s00446-022-00430-0,,cs.DC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Federated Byzantine Agreement Systems (FBASs) are a fascinating new paradigm
in the context of consensus protocols. Originally proposed for powering the
Stellar payment network, FBASs can instantiate Byzantine quorum systems without
requiring out-of-band agreement on a common set of validators; every node is
free to decide for itself with whom it requires agreement. Sybil-resistant and
yet energy-efficient consensus protocols can therefore be built upon FBASs, and
the ""decentrality"" possible with the FBAS paradigm might be sufficient to
reduce the use of environmentally unsustainable proof-of-work protocols. In
this paper, we first demonstrate how the robustness of individual FBASs can be
determined, by precisely determining their safety and liveness buffers and
therefore enabling a comparison with threshold-based quorum systems. Using
simulations and example node configuration strategies, we then empirically
investigate the hypothesis that while FBASs can be bootstrapped in a bottom-up
fashion from individual preferences, strategic considerations should
additionally be applied by node operators in order to arrive at FBASs that are
robust and amenable to monitoring. Finally, we investigate the reported
""open-membership"" property of FBASs. We observe that an often small group of
nodes is exclusively relevant for determining liveness buffers and prove that
membership in this top tier is conditional on the approval by current top tier
nodes if maintaining safety is a core requirement.
","[{'version': 'v1', 'created': 'Wed, 19 Feb 2020 10:57:21 GMT'}, {'version': 'v2', 'created': 'Tue, 11 May 2021 07:53:09 GMT'}, {'version': 'v3', 'created': 'Fri, 15 Oct 2021 08:28:38 GMT'}, {'version': 'v4', 'created': 'Thu, 31 Mar 2022 12:59:19 GMT'}]",2022-07-19,"[['Florian', 'Martin', ''], ['Henningsen', 'Sebastian', ''], ['Ndolo', 'Charmaine', ''], ['Scheuermann', 'Björn', '']]","['Byzantine quorum systems', 'asymmetrictrust', 'Byzantine faults', 'consensus', 'Stellar', 'blockchain']"
12356,2212.05947,Damiano Perri,"Valentina Franzoni, Sergio Tasso, Simonetta Pallottelli, Damiano Perri","Sharing Linkable Learning Objects with the use of Metadata and a
  Taxonomy Assistant for Categorization",,,10.1007/978-3-030-24296-1_28,,cs.OH cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this work, a re-design of the Moodledata module functionalities is
presented to share learning objects between e-learning content platforms, e.g.,
Moodle and G-Lorep, in a linkable object format. The e-learning courses content
of the Drupal-based Content Management System G-Lorep for academic learning is
exchanged designing an object incorporating metadata to support the reuse and
the classification in its context. In such an Artificial Intelligence
environment, the exchange of Linkable Learning Objects can be used for dialogue
between Learning Systems to obtain information, especially with the use of
semantic or structural similarity measures to enhance the existent Taxonomy
Assistant for advanced automated classification.
","[{'version': 'v1', 'created': 'Fri, 9 Dec 2022 18:32:18 GMT'}]",2022-12-13,"[['Franzoni', 'Valentina', ''], ['Tasso', 'Sergio', ''], ['Pallottelli', 'Simonetta', ''], ['Perri', 'Damiano', '']]","['e-learning', 'Moodle', 'learning management system', 'linked data', 'learning object', 'CMS', 'LMS', 'G-Lorep']"
12357,2012.13604,Abdallah Moubayed,"Abdallah Moubayed, MohammadNoor Injadat, Abdallah Shami, Hanan
  Lutfiyya","DNS Typo-squatting Domain Detection: A Data Analytics & Machine Learning
  Based Approach","7 pages, 6 figures, 3 tables, published in 2018 IEEE Global
  Communications Conference (GLOBECOM)","2018 IEEE Global Communications Conference (GLOBECOM), 2018, pp.
  1-7",10.1109/GLOCOM.2018.8647679,,cs.LG cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Domain Name System (DNS) is a crucial component of current IP-based networks
as it is the standard mechanism for name to IP resolution. However, due to its
lack of data integrity and origin authentication processes, it is vulnerable to
a variety of attacks. One such attack is Typosquatting. Detecting this attack
is particularly important as it can be a threat to corporate secrets and can be
used to steal information or commit fraud. In this paper, a machine
learning-based approach is proposed to tackle the typosquatting vulnerability.
To that end, exploratory data analytics is first used to better understand the
trends observed in eight domain name-based extracted features. Furthermore, a
majority voting-based ensemble learning classifier built using five
classification algorithms is proposed that can detect suspicious domains with
high accuracy. Moreover, the observed trends are validated by studying the same
features in an unlabeled dataset using K-means clustering algorithm and through
applying the developed ensemble learning classifier. Results show that
legitimate domains have a smaller domain name length and fewer unique
characters. Moreover, the developed ensemble learning classifier performs
better in terms of accuracy, precision, and F-score. Furthermore, it is shown
that similar trends are observed when clustering is used. However, the number
of domains identified as potentially suspicious is high. Hence, the ensemble
learning classifier is applied with results showing that the number of domains
identified as potentially suspicious is reduced by almost a factor of five
while still maintaining the same trends in terms of features' statistics.
","[{'version': 'v1', 'created': 'Fri, 25 Dec 2020 16:51:30 GMT'}]",2020-12-29,"[['Moubayed', 'Abdallah', ''], ['Injadat', 'MohammadNoor', ''], ['Shami', 'Abdallah', ''], ['Lutfiyya', 'Hanan', '']]","['DNS', 'Security', 'Typosquatting', 'Machine Learning', 'Data Analytics', 'Ensemble Learning Classifier']"
12358,2011.14307,Adrian Prochaska,"Adrian Prochaska and Julien Pillas and Bernard B\""aker","Active Output Selection Strategies for Multiple Learning Regression
  Models",The paper is accepted for publication at ICPRAM 2021,ICPRAM 2021,10.5220/0010181501500157,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Active learning shows promise to decrease test bench time for model-based
drivability calibration. This paper presents a new strategy for active output
selection, which suits the needs of calibration tasks. The strategy is actively
learning multiple outputs in the same input space. It chooses the output model
with the highest cross-validation error as leading. The presented method is
applied to three different toy examples with noise in a real world range and to
a benchmark dataset. The results are analyzed and compared to other existing
strategies. In a best case scenario, the presented strategy is able to decrease
the number of points by up to 30% compared to a sequential space-filling design
while outperforming other existing active learning strategies. The results are
promising but also show that the algorithm has to be improved to increase
robustness for noisy environments. Further research will focus on improving the
algorithm and applying it to a real-world example.
","[{'version': 'v1', 'created': 'Sun, 29 Nov 2020 08:05:53 GMT'}]",2021-02-24,"[['Prochaska', 'Adrian', ''], ['Pillas', 'Julien', ''], ['Bäker', 'Bernard', '']]","['Gaussian Processes', 'Active Learning', 'Regression', 'Active Output Selection', 'Drivability Calibration']"
12359,2106.15872,Jakob Egetenmeyer,Jakob Egetenmeyer,"Genre determining prediction: Non-standard TAM marking in football
  language","23 pages, submitted to Frontiers in Communication",,10.3389/fcomm.2021.730914,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  German and French football language display tense-aspect-mood (TAM) forms
which differ from the TAM use in other genres. In German football talk, the
present indicative may replace the pluperfect subjunctive. In French reports of
football matches, the imperfective past may occur instead of a perfective past
tense-aspect form. We argue that the two phenomena share a functional core and
are licensed in the same way, which is a direct result of the genre they occur
in. More precisely, football match reports adhere to a precise script and
specific events are temporally determined in terms of objective time. This
allows speakers to exploit a secondary function of TAM forms, namely, they
shift the temporal perspective. We argue that it is on the grounds of the genre
that comprehenders predict the deviating forms and are also able to decode
them. We present various corpus studies where we explore the functioning of
these phenomena in order to gain insights into their distribution,
grammaticalization and their functioning in discourse. Relevant factors are
Aktionsart properties, rhetorical relations and their interaction with other
TAM forms. This allows us to discuss coping mechanisms on the part of the
comprehender. We broaden our understanding of the phenomena, which have only
been partly covered for French and up to now seem to have been ignored in
German.
","[{'version': 'v1', 'created': 'Wed, 30 Jun 2021 08:01:57 GMT'}]",2021-09-20,"[['Egetenmeyer', 'Jakob', '']]","['Football language', 'TAM', 'genre', 'prediction', 'temporal perspective', 'French imparfait', 'German present indicative', 'temporal discourse structure']"
12360,2004.10393,Qiang Dong,"Qiang Dong, Quan Yuan, Yang-Bo Shi",Alleviating the recommendation bias via rank aggregation,"published on Physica A: Statistical Mechanics and its Applications,
  2019, volume 534, article ID: 122073","Physica A: Statistical Mechanics and its Applications, 2019,
  534:122073",10.1016/j.physa.2019.122073,,cs.SI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The primary goal of a recommender system is often known as ""helping users
find relevant items"", and a lot of recommendation algorithms are proposed
accordingly. However, these accuracy-oriented methods usually suffer the
problem of recommendation bias on popular items, which is not welcome to not
only users but also item providers. To alleviate the recommendation bias
problem, we propose a generic rank aggregation framework for the recommendation
results of an existing algorithm, in which the user- and item-oriented ranking
results are linearly aggregated together, with a parameter controlling the
weight of the latter ranking process. Experiment results of a typical algorithm
on two real-world data sets show that, this framework is effective to improve
the recommendation fairness of any existing accuracy-oriented algorithms, while
avoiding significant accuracy loss.
","[{'version': 'v1', 'created': 'Wed, 22 Apr 2020 04:33:20 GMT'}]",2020-04-23,"[['Dong', 'Qiang', ''], ['Yuan', 'Quan', ''], ['Shi', 'Yang-Bo', '']]","['recommender systems', 'popularity bias', 'rank aggregation', 'Ginicoefficient']"
12361,1906.00013,Bryan O'Gorman,Bryan O'Gorman,Parameterization of tensor network contraction,,,10.4230/LIPIcs.TQC.2019.10,,cs.DS quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a conceptually clear and algorithmically useful framework for
parameterizing the costs of tensor network contraction. Our framework is
completely general, applying to tensor networks with arbitrary bond dimensions,
open legs, and hyperedges. The fundamental objects of our framework are rooted
and unrooted contraction trees, which represent classes of contraction orders.
Properties of a contraction tree correspond directly and precisely to the time
and space costs of tensor network contraction. The properties of rooted
contraction trees give the costs of parallelized contraction algorithms. We
show how contraction trees relate to existing tree-like objects in the graph
theory literature, bringing to bear a wide range of graph algorithms and tools
to tensor network contraction. Independent of tensor networks, we show that the
edge congestion of a graph is almost equal to the branchwidth of its line
graph.
","[{'version': 'v1', 'created': 'Fri, 31 May 2019 18:00:12 GMT'}]",2019-06-04,"[[""O'Gorman"", 'Bryan', '']]","['Tensor networks', 'Parameterized complexity', 'Tree embedding', 'Congestion']"
12362,2004.09958,Jes\'us Tramullas,"Jes\'us Tramullas, Piedad Garrido-Picazo, Ana I. S\'anchez-Casab\'on","Use of Wikipedia categories on information retrieval research: a brief
  review",,,10.1145/3230599.3230617,,cs.DL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Wikipedia categories, a classification scheme built for organizing and
describing Wikpedia articles, are being applied in computer science research.
This paper adopts a systematic literature review approach, in order to identify
different approaches and uses of Wikipedia categories in information retrieval
research. Several types of work are identified, depending on the intrinsic
study of the categories structure, or its use as a tool for the processing and
analysis of other documentary corpus different to Wikipedia. Information
retrieval is identified as one of the major areas of use, in particular its
application in the refinement and improvement of search expressions, and the
construction of textual corpus. However, the set of available works shows that
in many cases research approaches applied and results obtained can be
integrated into a comprehensive and inclusive concept of information retrieval.
","[{'version': 'v1', 'created': 'Tue, 21 Apr 2020 12:45:09 GMT'}]",2020-04-22,"[['Tramullas', 'Jesús', ''], ['Garrido-Picazo', 'Piedad', ''], ['Sánchez-Casabón', 'Ana I.', '']]","['Wikipedia', 'categories', 'information retrieval', 'classification']"
12363,2001.08168,Jean Michel De Souza Sant'Ana,"Jean Michel de Souza Sant'Ana, Arliones Hoeller, Richard Demo Souza,
  Samuel Montejo-S\'anchez, Hirley Alves, and Mario de Noronha Neto",Hybrid Coded Replication in LoRa Networks,"9 pages, 4 figures, to be published in IEEE Transactions on
  Industrial Informatics",,10.1109/TII.2020.2966120,,cs.NI eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Low Power Wide Area Networks (LPWAN) are wireless connectivity solutions for
Internet-of-Things (IoT) applications, including industrial automation. Among
the several LPWAN technologies, LoRaWAN has been extensively addressed by the
research community and the industry. However, the reliability and scalability
of LoRaWAN are still uncertain. One of the techniques to increase the
reliability of LoRaWAN is message replication, which exploits time diversity.
This paper proposes a novel hybrid coded message replication scheme that
interleaves simple repetition and a recently proposed coded replication method.
We analyze the optimization of the proposed scheme under minimum reliability
requirements and show that it enhances the network performance without
requiring additional transmit power compared to the competing replication
techniques.
","[{'version': 'v1', 'created': 'Thu, 9 Jan 2020 15:31:48 GMT'}]",2020-01-24,"[[""Sant'Ana"", 'Jean Michel de Souza', ''], ['Hoeller', 'Arliones', ''], ['Souza', 'Richard Demo', ''], ['Montejo-Sánchez', 'Samuel', ''], ['Alves', 'Hirley', ''], ['Neto', 'Mario de Noronha', '']]","['Industrial Internet-of-Things', 'LoRaWAN', 'MessageReplication', 'Reliability', 'Wireless Networks']"
12364,2204.05280,Kenneth Rapko,"Kenneth Rapko, Wanlin Xie, and Andrew Walsh","MONCE Tracking Metrics: a comprehensive quantitative performance
  evaluation methodology for object tracking",,,10.1117/12.2618631,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Evaluating tracking model performance is a complicated task, particularly for
non-contiguous, multi-object trackers that are crucial in defense applications.
While there are various excellent tracking benchmarks available, this work
expands them to quantify the performance of long-term, non-contiguous,
multi-object and detection model assisted trackers. We propose a suite of MONCE
(Multi-Object Non-Contiguous Entities) image tracking metrics that provide both
objective tracking model performance benchmarks as well as diagnostic insight
for driving tracking model development in the form of Expected Average Overlap,
Short/Long Term Re-Identification, Tracking Recall, Tracking Precision,
Longevity, Localization and Absence Prediction.
","[{'version': 'v1', 'created': 'Mon, 11 Apr 2022 17:32:03 GMT'}]",2022-06-16,"[['Rapko', 'Kenneth', ''], ['Xie', 'Wanlin', ''], ['Walsh', 'Andrew', '']]","['multi-object tracking', 'long-term', 'noncontiguous', 're-identification', 'recall', 'precision', 'longevity', 'absence prediction']"
12365,2208.13278,Fran\c{c}ois Labr\`eche,"Fran\c{c}ois Labr\`eche, Enrico Mariconti, Gianluca Stringhini",Shedding Light on the Targeted Victim Profiles of Malicious Downloaders,"Published in the proceedings of the 17th International Conference on
  Availability, Reliability and Security (ARES '22)",,10.1145/3538969.3544435,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Malware affects millions of users worldwide, impacting the daily lives of
many people as well as businesses. Malware infections are increasing in
complexity and unfold over a number of stages. A malicious downloader often
acts as the starting point as it fingerprints the victim's machine and
downloads one or more additional malware payloads. Although previous research
was conducted on these malicious downloaders and their Pay-Per-Install
networks, limited work has investigated how the profile of the victim machine,
e.g., its characteristics and software configuration, affect the targeting
choice of cybercriminals.
  In this paper, we operate a large-scale investigation of the relation between
the machine profile and the payload downloaded by droppers, through 151,189
executions of malware downloaders over a period of 12 months. We build a fully
automated framework which uses Virtual Machines (VMs) in sandboxes to build
custom user and machine profiles to test our malicious samples. We then use
changepoint analysis to model the behavior of different downloader families,
and perform analyses of variance (ANOVA) on the ratio of infections per
profile. With this, we identify which machine profile is targeted by
cybercriminals at different points in time.
  Our results show that a number of downloaders present different behaviors
depending on a number of features of a machine. Notably, a higher number of
infections for specific malware families were observed when using different
browser profiles, keyboard layouts and operating systems, while one keyboard
layout obtained fewer infections of a specific malware family.
  Our findings bring light to the importance of the features of a machine
running malicious downloader software, particularly for malware research.
","[{'version': 'v1', 'created': 'Sun, 28 Aug 2022 19:56:35 GMT'}]",2022-08-30,"[['Labrèche', 'François', ''], ['Mariconti', 'Enrico', ''], ['Stringhini', 'Gianluca', '']]","['Malware', 'Downloader', 'Pay-Per-Install', 'Changepoint Analysis']"
12366,1902.04181,"Ga\""el Beck","Ga\""el Beck, Tarn Duong, Mustapha Lebbah, Hanane Azzag",Nearest Neighbor Median Shift Clustering for Binary Data,"Algorithms are available at
  https://github.com/Clustering4Ever/Clustering4Ever",,10.1007/978-3-030-86383-8_8,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe in this paper the theory and practice behind a new modal
clustering method for binary data. Our approach (BinNNMS) is based on the
nearest neighbor median shift. The median shift is an extension of the
well-known mean shift, which was designed for continuous data, to handle binary
data. We demonstrate that BinNNMS can discover accurately the location of
clusters in binary data with theoretical and experimental analyses.
","[{'version': 'v1', 'created': 'Mon, 11 Feb 2019 23:34:21 GMT'}]",2022-03-04,"[['Beck', 'Gaël', ''], ['Duong', 'Tarn', ''], ['Lebbah', 'Mustapha', ''], ['Azzag', 'Hanane', '']]","['density gradient ascent', 'Hamming distance', 'mean shift']"
12367,2111.09749,"Johannes Stegm\""uller","Johannes Stegm\""uller, Fabian Bauer-Marquart, Norman Meuschke, Terry
  Ruas, Moritz Schubotz, Bela Gipp",Detecting Cross-Language Plagiarism using Open Knowledge Graphs,"10 pages, EEKE21, Preprint",,10.6084/m9.figshare.17212340.v3,,cs.CL cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Identifying cross-language plagiarism is challenging, especially for distant
language pairs and sense-for-sense translations. We introduce the new
multilingual retrieval model Cross-Language Ontology-Based Similarity Analysis
(CL-OSA) for this task. CL-OSA represents documents as entity vectors obtained
from the open knowledge graph Wikidata. Opposed to other methods, CL-OSA does
not require computationally expensive machine translation, nor pre-training
using comparable or parallel corpora. It reliably disambiguates homonyms and
scales to allow its application to Web-scale document collections. We show that
CL-OSA outperforms state-of-the-art methods for retrieving candidate documents
from five large, topically diverse test corpora that include distant language
pairs like Japanese-English. For identifying cross-language plagiarism at the
character level, CL-OSA primarily improves the detection of sense-for-sense
translations. For these challenging cases, CL-OSA's performance in terms of the
well-established PlagDet score exceeds that of the best competitor by more than
factor two. The code and data of our study are openly available.
","[{'version': 'v1', 'created': 'Thu, 18 Nov 2021 15:23:27 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Dec 2021 12:57:24 GMT'}]",2021-12-17,"[['Stegmüller', 'Johannes', ''], ['Bauer-Marquart', 'Fabian', ''], ['Meuschke', 'Norman', ''], ['Ruas', 'Terry', ''], ['Schubotz', 'Moritz', ''], ['Gipp', 'Bela', '']]","['Cross-language plagiarism detection', 'knowledge graphs', 'Wikidata']"
12368,1904.12156,Arne Meier,Anselm Haak and Arne Meier and Om Prakash and B. V. Raghavendra Rao,Parameterised Counting in Logspace,Updated technical report to final version at STACS21,,10.4230/LIPIcs.STACS.2021.45,,cs.LO cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce a new framework for parameterised counting in
logspace, inspired by the parameterised space bounded models developed by
Elberfeld, Stockhusen and Tantau (IPEC 2013, Algorithmica 2015). They defined
the operators paraW and paraBeta for parameterised space complexity classes by
allowing bounded nondeterminism with multiple-read and read-once access,
respectively. Using these operators, they characterised the parameterised
complexity of natural problems on graphs. In the spirit of the operators paraW
and paraBeta by Stockhusen and Tantau, we introduce variants based on
tail-nondeterminism, paraW[1] and paraBeta-Tail. Then, we consider counting
versions of all four operators applied to logspace and obtain several natural
complete problems for the resulting classes: counting of paths in digraphs,
counting first-order models for formulas, and counting graph homomorphisms.
Furthermore, we show that the complexity of a parameterised variant of the
determinant function for (0,1)-matrices is #paraBeta-Tail-L-hard and can be
written as the difference of two functions in #paraBetaTail-L. For example, we
show that the closure of #paraBetaTail-L under parameterised logspace
parsimonious reductions coincides with #paraBeta-L, that is, modulo
parameterised reductions, tail-nondeterminism with read-once access is the same
as read-once nondeterminism. We show that all introduced classes are closed
under addition and multiplication, and those without tail-nondeterminism are
closed under parameterised logspace parsimonious reductions. Finally, we
underline the significance of this topic by providing a promising outlook
showing several open problems and options for further directions of research.
","[{'version': 'v1', 'created': 'Sat, 27 Apr 2019 13:12:28 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Oct 2019 09:25:01 GMT'}, {'version': 'v3', 'created': 'Thu, 7 May 2020 09:23:44 GMT'}, {'version': 'v4', 'created': 'Mon, 11 May 2020 09:42:28 GMT'}, {'version': 'v5', 'created': 'Fri, 15 Jan 2021 16:03:24 GMT'}]",2021-01-18,"[['Haak', 'Anselm', ''], ['Meier', 'Arne', ''], ['Prakash', 'Om', ''], ['Rao', 'B. V. Raghavendra', '']]","['Parameterized Complexity', 'Counting Complexity', 'Logspace']"
12369,1910.09798,Shruti Jadon,"Shruti Jadon, Aditya Acrot Srinivasan","Improving Siamese Networks for One Shot Learning using Kernel Based
  Activation functions","15 pages, 8 figures","Advances in Intelligent Systems and Computing book series (AISC,
  volume 1175) Springer 2020",10.1007/978-981-15-5619-7_25,,cs.LG cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The lack of a large amount of training data has always been the constraining
factor in solving a lot of problems in machine learning, making One Shot
Learning one of the most intriguing ideas in machine learning. It aims to learn
information about object categories from one, or only a few training examples.
This process of learning in deep learning is usually accomplished by proper
objective function, i.e; loss function and embeddings extraction i.e;
architecture. In this paper, we discussed about metrics based deep learning
architectures for one shot learning such as Siamese neural networks and present
a method to improve on their accuracy using Kafnets (kernel-based
non-parametric activation functions for neural networks) by learning proper
embeddings with relatively less number of epochs. Using kernel activation
functions, we are able to achieve strong results which exceed those of ReLU
based deep learning models in terms of embeddings structure, loss convergence,
and accuracy.
","[{'version': 'v1', 'created': 'Tue, 22 Oct 2019 07:17:07 GMT'}]",2020-09-22,"[['Jadon', 'Shruti', ''], ['Srinivasan', 'Aditya Acrot', '']]","['One Shot Learning', 'Embeddings', 'Computer Vision', 'Gaussian Distribution', 'Loss Function']"
12370,2208.09614,Morteza Zakeri-Nasrabadi,Morteza Zakeri-Nasrabadi and Saeed Parsa,An ensemble meta-estimator to predict source code testability,"52 pages, 11 figures, 11 tables","Applied Soft Computing, 109562 (2022)",10.1016/j.asoc.2022.109562,,cs.SE cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Unlike most other software quality attributes, testability cannot be
evaluated solely based on the characteristics of the source code. The
effectiveness of the test suite and the budget assigned to the test highly
impact the testability of the code under test. The size of a test suite
determines the test effort and cost, while the coverage measure indicates the
test effectiveness. Therefore, testability can be measured based on the
coverage and number of test cases provided by a test suite, considering the
test budget. This paper offers a new equation to estimate testability regarding
the size and coverage of a given test suite. The equation has been used to
label 23,000 classes belonging to 110 Java projects with their testability
measure. The labeled classes were vectorized using 262 metrics. The labeled
vectors were fed into a family of supervised machine learning algorithms,
regression, to predict testability in terms of the source code metrics.
Regression models predicted testability with an R2 of 0.68 and a mean squared
error of 0.03, suitable in practice. Fifteen software metrics highly affecting
testability prediction were identified using a feature importance analysis
technique on the learned model. The proposed models have improved mean absolute
error by 38% due to utilizing new criteria, metrics, and data compared with the
relevant study on predicting branch coverage as a test criterion. As an
application of testability prediction, it is demonstrated that automated
refactoring of 42 smelly Java classes targeted at improving the 15 influential
software metrics could elevate their testability by an average of 86.87%.
","[{'version': 'v1', 'created': 'Sat, 20 Aug 2022 06:18:16 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Aug 2022 10:26:34 GMT'}]",2022-08-25,"[['Zakeri-Nasrabadi', 'Morteza', ''], ['Parsa', 'Saeed', '']]","['Software testability', 'software metrics', 'automated refactoring', 'static and dynamic']"
12371,1912.12623,Marti Sanchez-Fibla,"Berkay Demirel, Mart\'i S\'anchez-Fibla","Speeding up reinforcement learning by combining attention and agency
  features","9 pages, 5 figures, Paper appeared in CCIA 2019",,10.3233/FAIA190111,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  When playing video-games we immediately detect which entity we control and we
center the attention towards it to focus the learning and reduce its
dimensionality. Reinforcement Learning (RL) has been able to deal with big
state spaces, including states derived from pixel images in Atari games, but
the learning is slow, depends on the brute force mapping from the global state
to the action values (Q-function), thus its performance is severely affected by
the dimensionality of the state and cannot be transferred to other games or
other parts of the same game. We propose different transformations of the input
state that combine attention and agency detection mechanisms which both have
been addressed separately in RL but not together to our knowledge. We propose
and benchmark different architectures including both global and local agency
centered versions of the state and also including summaries of the
surroundings. Results suggest that even a redundant global-local state network
can learn faster than the global alone. Summarized versions of the state look
promising to achieve input-size independence learning.
","[{'version': 'v1', 'created': 'Sun, 29 Dec 2019 10:23:01 GMT'}]",2020-01-01,"[['Demirel', 'Berkay', ''], ['Sánchez-Fibla', 'Martí', '']]","['Deep Reinforcement Learning', 'Agency', 'Attention']"
12372,1708.02983,Yang You,"Yang You, Aydin Buluc, James Demmel",Scaling Deep Learning on GPU and Knights Landing clusters,,,10.1145/3126908.3126912,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The speed of deep neural networks training has become a big bottleneck of
deep learning research and development. For example, training GoogleNet by
ImageNet dataset on one Nvidia K20 GPU needs 21 days. To speed up the training
process, the current deep learning systems heavily rely on the hardware
accelerators. However, these accelerators have limited on-chip memory compared
with CPUs. To handle large datasets, they need to fetch data from either CPU
memory or remote processors. We use both self-hosted Intel Knights Landing
(KNL) clusters and multi-GPU clusters as our target platforms. From an
algorithm aspect, current distributed machine learning systems are mainly
designed for cloud systems. These methods are asynchronous because of the slow
network and high fault-tolerance requirement on cloud systems. We focus on
Elastic Averaging SGD (EASGD) to design algorithms for HPC clusters. Original
EASGD used round-robin method for communication and updating. The communication
is ordered by the machine rank ID, which is inefficient on HPC clusters.
  First, we redesign four efficient algorithms for HPC systems to improve
EASGD's poor scaling on clusters. Async EASGD, Async MEASGD, and Hogwild EASGD
are faster \textcolor{black}{than} their existing counterparts (Async SGD,
Async MSGD, and Hogwild SGD, resp.) in all the comparisons. Finally, we design
Sync EASGD, which ties for the best performance among all the methods while
being deterministic. In addition to the algorithmic improvements, we use some
system-algorithm codesign techniques to scale up the algorithms. By reducing
the percentage of communication from 87% to 14%, our Sync EASGD achieves 5.3x
speedup over original EASGD on the same platform. We get 91.5% weak scaling
efficiency on 4253 KNL cores, which is higher than the state-of-the-art
implementation.
","[{'version': 'v1', 'created': 'Wed, 9 Aug 2017 19:49:13 GMT'}]",2017-08-11,"[['You', 'Yang', ''], ['Buluc', 'Aydin', ''], ['Demmel', 'James', '']]","['Distributed Deep Learning', 'Knights Landing', 'Scalable Algorithm']"
12373,2205.13780,Mohammad Reza Feizi Derakhshi,"Majid Ramezani and Mohammad-Reza Feizi-Derakhshi and Mohammad-Ali
  Balafar","Text-Based Automatic Personality Prediction Using KGrAt-Net; A Knowledge
  Graph Attention Network Classifier","This is a preprint of an article published in ""scientific reports"".
  The final authenticated version is available online at:
  https://www.nature.com/articles/s41598-022-25955-z",,10.1038/s41598-022-25955-z,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, a tremendous amount of human communications occur on Internet-based
communication infrastructures, like social networks, email, forums,
organizational communication platforms, etc. Indeed, the automatic prediction
or assessment of individuals' personalities through their written or exchanged
text would be advantageous to ameliorate their relationships. To this end, this
paper aims to propose KGrAt-Net, which is a Knowledge Graph Attention Network
text classifier. For the first time, it applies the knowledge graph attention
network to perform Automatic Personality Prediction (APP), according to the Big
Five personality traits. After performing some preprocessing activities, it
first tries to acquire a knowing-full representation of the knowledge behind
the concepts in the input text by building its equivalent knowledge graph. A
knowledge graph collects interlinked descriptions of concepts, entities, and
relationships in a machine-readable form. Practically, it provides a
machine-readable cognitive understanding of concepts and semantic relationships
among them. Then, applying the attention mechanism, it attempts to pay
attention to the most relevant parts of the graph to predict the personality
traits of the input text. We used 2,467 essays from the Essays Dataset. The
results demonstrated that KGrAt-Net considerably improved personality
prediction accuracies (up to 70.26% on average). Furthermore, KGrAt-Net also
uses knowledge graph embedding to enrich the classification, which makes it
even more accurate (on average, 72.41%) in APP.
","[{'version': 'v1', 'created': 'Fri, 27 May 2022 06:33:09 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Jan 2023 20:05:57 GMT'}]",2023-01-09,"[['Ramezani', 'Majid', ''], ['Feizi-Derakhshi', 'Mohammad-Reza', ''], ['Balafar', 'Mohammad-Ali', '']]","['Automatic Personality Prediction (APP)', 'Knowledge Graph (KG)', 'Attention Network', 'Knowledge Graph Embedding', 'Knowledge Representation (KR)', 'Big Five']"
12374,1802.01516,Marcelo Saval Calvo,"Marcelo Saval-Calvo, Jorge Azorin-Lopez, Andres Fuster-Guillo, Victor
  Villena-Martinez, Robert B. Fisher",3D non-rigid registration using color: Color Coherent Point Drift,Published in Computer Vision and Image Understanding,,10.1016/j.cviu.2018.01.008,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Research into object deformations using computer vision techniques has been
under intense study in recent years. A widely used technique is 3D non-rigid
registration to estimate the transformation between two instances of a
deforming structure. Despite many previous developments on this topic, it
remains a challenging problem. In this paper we propose a novel approach to
non-rigid registration combining two data spaces in order to robustly calculate
the correspondences and transformation between two data sets. In particular, we
use point color as well as 3D location as these are the common outputs of RGB-D
cameras. We have propose the Color Coherent Point Drift (CCPD) algorithm (an
extension of the CPD method [1]). Evaluation is performed using synthetic and
real data. The synthetic data includes easy shapes that allow evaluation of the
effect of noise, outliers and missing data. Moreover, an evaluation of
realistic figures obtained using Blensor is carried out. Real data acquired
using a general purpose Primesense Carmine sensor is used to validate the CCPD
for real shapes. For all tests, the proposed method is compared to the original
CPD showing better results in registration accuracy in most cases.
","[{'version': 'v1', 'created': 'Mon, 5 Feb 2018 17:14:09 GMT'}]",2018-02-06,"[['Saval-Calvo', 'Marcelo', ''], ['Azorin-Lopez', 'Jorge', ''], ['Fuster-Guillo', 'Andres', ''], ['Villena-Martinez', 'Victor', ''], ['Fisher', 'Robert B.', '']]","['3D non-rigid registration', '3D deformable registration', 'CCPD']"
12375,1901.03319,Philip Smith,"Vitaliy Kurlin, Philip Smith","Skeletonisation Algorithms with Theoretical Guarantees for Unorganised
  Point Clouds with High Levels of Noise",This paper has been published in the journal Pattern Recognition,,10.1016/j.patcog.2021.107902,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data Science aims to extract meaningful knowledge from unorganised data. Real
datasets usually come in the form of a cloud of points with only pairwise
distances. Numerous applications require to visualise an overall shape of a
noisy cloud of points sampled from a non-linear object that is more complicated
than a union of disjoint clusters. The skeletonisation problem in its hardest
form is to find a 1-dimensional skeleton that correctly represents a shape of
the cloud. This paper compares several algorithms that solve the above
skeletonisation problem for any point cloud and guarantee a successful
reconstruction. For example, given a highly noisy point sample of an unknown
underlying graph, a reconstructed skeleton should be geometrically close and
homotopy equivalent to (has the same number of independent cycles as) the
underlying graph. One of these algorithm produces a Homologically Persistent
Skeleton (HoPeS) for any cloud without extra parameters. This universal
skeleton contains sub-graphs that provably represent the 1-dimensional shape of
the cloud at any scale. Other subgraphs of HoPeS reconstruct an unknown graph
from its noisy point sample with a correct homotopy type and within a small
offset of the sample. The extensive experiments on synthetic and real data
reveal for the first time the maximum level of noise that allows successful
graph reconstructions.
","[{'version': 'v1', 'created': 'Thu, 10 Jan 2019 18:52:02 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Jun 2019 16:16:11 GMT'}, {'version': 'v3', 'created': 'Fri, 26 Feb 2021 13:34:40 GMT'}]",2021-03-01,"[['Kurlin', 'Vitaliy', ''], ['Smith', 'Philip', '']]","['data skeletonisation', 'noisy point sample', 'persistent homology']"
12376,1810.02802,Ni Lao,"Gengchen Mai, Krzysztof Janowicz, Cheng He, Sumang Liu, Ni Lao","POIReviewQA: A Semantically Enriched POI Retrieval and Question
  Answering Dataset",,12th Workshop on Geographic Information Retrieval (GIR 2018),10.1145/3281354.3281359,,cs.AI cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many services that perform information retrieval for Points of Interest (POI)
utilize a Lucene-based setup with spatial filtering. While this type of system
is easy to implement it does not make use of semantics but relies on direct
word matches between a query and reviews leading to a loss in both precision
and recall. To study the challenging task of semantically enriching POIs from
unstructured data in order to support open-domain search and question answering
(QA), we introduce a new dataset POIReviewQA. It consists of 20k questions
(e.g.""is this restaurant dog friendly?"") for 1022 Yelp business types. For each
question we sampled 10 reviews, and annotated each sentence in the reviews
whether it answers the question and what the corresponding answer is. To test a
system's ability to understand the text we adopt an information retrieval
evaluation by ranking all the review sentences for a question based on the
likelihood that they answer this question. We build a Lucene-based baseline
model, which achieves 77.0% AUC and 48.8% MAP. A sentence embedding-based model
achieves 79.2% AUC and 41.8% MAP, indicating that the dataset presents a
challenging problem for future research by the GIR community. The result
technology can help exploit the thematic content of web documents and social
media for characterisation of locations.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 17:37:37 GMT'}]",2018-10-08,"[['Mai', 'Gengchen', ''], ['Janowicz', 'Krzysztof', ''], ['He', 'Cheng', ''], ['Liu', 'Sumang', ''], ['Lao', 'Ni', '']]","['POI', 'Search', 'Question Answering', 'Semantic Enrichment']"
12377,1811.05475,Jingcheng Du,"Jingcheng Du, Qingyu Chen, Yifan Peng, Yang Xiang, Cui Tao, Zhiyong Lu","ML-Net: multi-label classification of biomedical texts with deep neural
  networks",,,10.1093/jamia/ocz085,,cs.IR cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In multi-label text classification, each textual document can be assigned
with one or more labels. Due to this nature, the multi-label text
classification task is often considered to be more challenging compared to the
binary or multi-class text classification problems. As an important task with
broad applications in biomedicine such as assigning diagnosis codes, a number
of different computational methods (e.g. training and combining binary
classifiers for each label) have been proposed in recent years. However, many
suffered from modest accuracy and efficiency, with only limited success in
practical use. We propose ML-Net, a novel deep learning framework, for
multi-label classification of biomedical texts. As an end-to-end system, ML-Net
combines a label prediction network with an automated label count prediction
mechanism to output an optimal set of labels by leveraging both predicted
confidence score of each label and the contextual information in the target
document. We evaluate ML-Net on three independent, publicly-available corpora
in two kinds of text genres: biomedical literature and clinical notes. For
evaluation, example-based measures such as precision, recall and f-measure are
used. ML-Net is compared with several competitive machine learning baseline
models. Our benchmarking results show that ML-Net compares favorably to the
state-of-the-art methods in multi-label classification of biomedical texts.
ML-NET is also shown to be robust when evaluated on different text genres in
biomedicine. Unlike traditional machine learning methods, ML-Net does not
require human efforts in feature engineering and is highly efficient and
scalable approach to tasks with a large set of labels (no need to build
individual classifiers for each separate label). Finally, ML-NET is able to
dynamically estimate the label count based on the document context in a more
systematic and accurate manner.
","[{'version': 'v1', 'created': 'Tue, 13 Nov 2018 17:31:49 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Nov 2018 16:02:52 GMT'}]",2019-07-02,"[['Du', 'Jingcheng', ''], ['Chen', 'Qingyu', ''], ['Peng', 'Yifan', ''], ['Xiang', 'Yang', ''], ['Tao', 'Cui', ''], ['Lu', 'Zhiyong', '']]","['Multi-label classification', 'biomedical text', 'deep neural network']"
12378,2205.03670,Quentin Renau,"Quentin Renau, Johann Dreo, Alain Peres, Yann Semet, Carola Doerr,
  Benjamin Doerr",Automated Algorithm Selection for Radar Network Configuration,"To appear in Proc. of The Genetic and Evolutionary Computation
  Conference 2022 (GECCO 2022)","Automated algorithm selection for radar network configuration.
  GECCO 2022: 1263-1271",10.1145/3512290.3528825,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The configuration of radar networks is a complex problem that is often
performed manually by experts with the help of a simulator. Different numbers
and types of radars as well as different locations that the radars shall cover
give rise to different instances of the radar configuration problem. The exact
modeling of these instances is complex, as the quality of the configurations
depends on a large number of parameters, on internal radar processing, and on
the terrains on which the radars need to be placed. Classic optimization
algorithms can therefore not be applied to this problem, and we rely on
""trial-and-error"" black-box approaches.
  In this paper, we study the performances of 13~black-box optimization
algorithms on 153~radar network configuration problem instances. The algorithms
perform considerably better than human experts. Their ranking, however, depends
on the budget of configurations that can be evaluated and on the elevation
profile of the location. We therefore also investigate automated algorithm
selection approaches. Our results demonstrate that a pipeline that extracts
instance features from the elevation of the terrain performs on par with the
classical, far more expensive approach that extracts features from the
objective function.
","[{'version': 'v1', 'created': 'Sat, 7 May 2022 15:28:36 GMT'}]",2022-10-11,"[['Renau', 'Quentin', ''], ['Dreo', 'Johann', ''], ['Peres', 'Alain', ''], ['Semet', 'Yann', ''], ['Doerr', 'Carola', ''], ['Doerr', 'Benjamin', '']]","['radar network configuration', 'evolutionary computation', 'algorithmselection', 'exploratory landscape analysis']"
12379,2012.02237,Mark Philip Sy,"Mark Philip M. Sy, Christian James M. Historillo, Allen Cris T. Conde,
  and Ma. Yvonne Czarina R. Costelo","Query Game 2.0: Improvement of a Web-Based Query Game for Cavite State
  University Main Campus",,"International Journal of Computing Sciences Research, 4(2),
  304-318",10.25147/ijcsr.2017.001.1.41,,cs.CY cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Purpose: The study aimed to improve the previous study covering a web-based
query game for Cavite State University. The study created a new mechanic and
gameplay for the students to learn Structured Query Language (SQL). The
enhancements also focused on the interactions of one or more students playing
the game.
  Method: The researchers used iterative development process methodology in the
development of the study. The system was assessed and evaluated using different
testing methods: unit, integration, and system testing. After passing the
tests, 90 students of Information Technology and Computer Science program along
with 10 IT experts evaluated the system.
  Results: The respondents were classified into technical and non-technical
respondents and the study garnered an evaluation score of 4.69 and 4.70
respectively. The overall interpretation of the results of the evaluation is
Excellent.
  Conclusion: The study created a system where the user can read and watch
lectures and experience the tutorial. Instructors and students may communicate
in the system, hence, promoting better relations and healthy competition
between students.
  Recommendations: Based on the conclusions of the study, the system can be
used as a supplementary tool in teaching courses with Database Management. To
enhance the analysis of query construction of the students, it is recommended
to add a module that can analyze the pattern of creating queries and answering
questions for every user.
","[{'version': 'v1', 'created': 'Sat, 21 Nov 2020 06:43:05 GMT'}]",2020-12-07,"[['Sy', 'Mark Philip M.', ''], ['Historillo', 'Christian James M.', ''], ['Conde', 'Allen Cris T.', ''], ['Costelo', 'Ma. Yvonne Czarina R.', '']]","['query game', 'database', 'educational game', 'SQL', 'ranked game   INTRODUCTION']"
12380,2007.09098,Ranwa Al Mallah,"Ranwa Al Mallah, Bilal Farooq",Actor-based Risk Analysis for Blockchains in Smart Mobility,arXiv admin note: text overlap with arXiv:1904.11908 by other authors,,10.1145/3410699.3413794,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Blockchain technology is a crypto-based secure ledger for data storage and
transfer through decentralized, trustless peer-to-peer systems. Despite its
advantages, previous studies have shown that the technology is not completely
secure against cyber attacks. Thus, it is crucial to perform domain specific
risk analysis to measure how viable the attacks are on the system, their impact
and consequently the risk exposure. Specifically, in this paper, we carry out
an analysis in terms of quantifying the risk associated to an operational
multi-layered Blockchain framework for Smart Mobility Data-markets (BSMD). We
conduct an actor-based analysis to determine the impact of the attacks. The
analysis identified five attack goals and five types of attackers that violate
the security of the blockchain system. In the case study of the public
permissioned BSMD, we highlight the highest risk factors according to their
impact on the victims in terms of monetary, privacy, integrity and trust. Four
attack goals represent a risk in terms of economic losses and one attack goal
contains many threats that represent a risk that is either unacceptable or
undesirable.
","[{'version': 'v1', 'created': 'Thu, 16 Jul 2020 00:03:28 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Dec 2020 17:13:03 GMT'}]",2020-12-07,"[['Mallah', 'Ranwa Al', ''], ['Farooq', 'Bilal', '']]","['blockchain', 'mobility', 'security', 'risk analysis']"
12381,2206.01439,Mohamad Yaser Jaradeh,"Mohamad Yaser Jaradeh and Allard Oelen and Manuel Prinz and Markus
  Stocker and S\""oren Auer",Open Research Knowledge Graph:A System Walkthrough,Pre-print for TPDL 2019 demo,,10.1007/978-3-030-30760-8_31,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite improved digital access to scholarly literature in the last decades,
the fundamental principles of scholarly communication remain unchanged and
continue to be largely document-based. Scholarly knowledge remains locked in
representations that are inadequate for machine processing. The Open Research
Knowledge Graph (ORKG) is an infrastructure for representing, curating and
exploring scholarly knowledge in a machine actionable manner. We demonstrate
the core functionality of ORKG for representing research contributions
published in scholarly articles. A video of the demonstration and the system
are available online.
","[{'version': 'v1', 'created': 'Fri, 3 Jun 2022 08:01:08 GMT'}]",2022-06-06,"[['Jaradeh', 'Mohamad Yaser', ''], ['Oelen', 'Allard', ''], ['Prinz', 'Manuel', ''], ['Stocker', 'Markus', ''], ['Auer', 'Sören', '']]","['Digital Libraries', 'Information Science', 'Knowledge Graph', 'ResearchInfrastructure', 'Scholarly Communication']"
12382,1909.13772,Martin Bauer,"Martin Bauer, Sebastian Eibl, Christian Godenschwager, Nils Kohl,
  Michael Kuron, Christoph Rettinger, Florian Schornbaum, Christoph
  Schwarzmeier, Dominik Th\""onnes, Harald K\""ostler, Ulrich R\""ude","waLBerla: A block-structured high-performance framework for multiphysics
  simulations",,,10.1016/j.camwa.2020.01.007,,cs.DC cs.CE physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Programming current supercomputers efficiently is a challenging task.
Multiple levels of parallelism on the core, on the compute node, and between
nodes need to be exploited to make full use of the system. Heterogeneous
hardware architectures with accelerators further complicate the development
process. waLBerla addresses these challenges by providing the user with highly
efficient building blocks for developing simulations on block-structured grids.
The block-structured domain partitioning is flexible enough to handle complex
geometries, while the structured grid within each block allows for highly
efficient implementations of stencil-based algorithms. We present several
example applications realized with waLBerla, ranging from lattice Boltzmann
methods to rigid particle simulations. Most importantly, these methods can be
coupled together, enabling multiphysics simulations. The framework uses
meta-programming techniques to generate highly efficient code for CPUs and GPUs
from a symbolic method formulation. To ensure software quality and performance
portability, a continuous integration toolchain automatically runs an extensive
test suite encompassing multiple compilers, hardware architectures, and
software configurations.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2019 15:13:22 GMT'}]",2020-02-26,"[['Bauer', 'Martin', ''], ['Eibl', 'Sebastian', ''], ['Godenschwager', 'Christian', ''], ['Kohl', 'Nils', ''], ['Kuron', 'Michael', ''], ['Rettinger', 'Christoph', ''], ['Schornbaum', 'Florian', ''], ['Schwarzmeier', 'Christoph', ''], ['Thönnes', 'Dominik', ''], ['Köstler', 'Harald', ''], ['Rüde', 'Ulrich', '']]","['high-performance computing', 'multiphysics', 'lattice Boltzmann', 'rigidparticle dynamics', 'adaptive mesh refinement', 'code generation']"
12383,2104.09971,Valentin Zieglmeier,Valentin Zieglmeier and Gabriel Loyola Daiqui,GDPR-Compliant Use of Blockchain for Secure Usage Logs,"Peer-reviewed version accepted for publication in the proceedings of
  the 2021 International Conference on Evaluation and Assessment in Software
  Engineering (EASE'21)",,10.1145/3463274.3463349,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The unique properties of blockchain enable central requirements of
distributed secure logging: Immutability, integrity, and availability.
Especially when providing transparency about data usages, a blockchain-based
secure log can be beneficial, as no trusted third party is required. Yet, with
data governed by privacy legislation such as the GDPR or CCPA, the core
advantage of immutability becomes a liability. After a rightful request, an
individual's personal data need to be rectified or deleted, which is impossible
in an immutable blockchain. To solve this issue, we exploit a legal property of
pseudonymized data: They are only regarded personal data if they can be
associated with an individual's identity. We make use of this fact by
presenting P3, a pseudonym provisioning system for secure usage logs including
a protocol for recording new usages. For each new block, a one-time transaction
pseudonym is generated. The pseudonym generation algorithm guarantees
unlinkability and enables proof of ownership. These properties enable
GDPR-compliant use of blockchain, as data subjects can exercise their legal
rights with regards to their personal data. The new-usage protocol ensures
non-repudiation, and therefore accountability and liability. Most importantly,
our approach does not require a trusted third party and is independent of the
utilized blockchain software.
","[{'version': 'v1', 'created': 'Tue, 20 Apr 2021 14:03:01 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Jun 2021 09:21:52 GMT'}]",2021-06-22,"[['Zieglmeier', 'Valentin', ''], ['Daiqui', 'Gabriel Loyola', '']]","['Blockchain', 'GDPR', 'Privacy', 'Anonymity', 'Logging']"
12384,2104.10941,Aneesh Balakrishnan,"Dan Alexandrescu, Aneesh Balakrishnan, Thomas Lange and Maximilien
  Glorieux","Enabling Cross-Layer Reliability and Functional Safety Assessment
  Through ML-Based Compact Models","7 pages (paper) + 1 page copyright statement, Number of figures: 3,
  Conference: 2020 IEEE 26th International Symposium on On-Line Testing and
  Robust System Design (IOLTS)",,10.1109/IOLTS50870.2020.9159750,,cs.AR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Typical design flows are hierarchical and rely on assembling many individual
technology elements from standard cells to complete boards. Providers use
compact models to provide simplified views of their products to their users.
Designers group simpler elements in more complex structures and have to manage
the corresponding propagation of reliability and functional safety information
through the hierarchy of the system, accompanied by the obvious problems of IP
confidentiality, possibility of reverse engineering and so on. This paper
proposes a machine-learning-based approach to integrate the many individual
models of a subsystem's elements in a single compact model that can be re-used
and assembled further up in the hierarchy. The compact models provide
consistency, accuracy and confidentiality, allowing technology, IP, component,
sub-system or system providers to accompany their offering with high-quality
reliability and functional safety compact models that can be safely and
accurately consumed by their users.
","[{'version': 'v1', 'created': 'Thu, 22 Apr 2021 09:13:57 GMT'}]",2021-04-23,"[['Alexandrescu', 'Dan', ''], ['Balakrishnan', 'Aneesh', ''], ['Lange', 'Thomas', ''], ['Glorieux', 'Maximilien', '']]","['reliability', 'functional safety', 'machine learning', 'fault']"
12385,2008.09680,Ryan Bernstein,"Ryan Bernstein, Matthijs V\'ak\'ar, Jeannette Wing",Transforming Probabilistic Programs for Model Checking,"To be published in Proceedings of the 2020 ACM-IMS Foundations of
  Data Science Conference",,10.1145/3412815.3416896,,cs.AI cs.LG cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Probabilistic programming is perfectly suited to reliable and transparent
data science, as it allows the user to specify their models in a high-level
language without worrying about the complexities of how to fit the models.
Static analysis of probabilistic programs presents even further opportunities
for enabling a high-level style of programming, by automating time-consuming
and error-prone tasks. We apply static analysis to probabilistic programs to
automate large parts of two crucial model checking methods: Prior Predictive
Checks and Simulation-Based Calibration. Our method transforms a probabilistic
program specifying a density function into an efficient forward-sampling form.
To achieve this transformation, we extract a factor graph from a probabilistic
program using static analysis, generate a set of proposal directed acyclic
graphs using a SAT solver, select a graph which will produce provably correct
sampling code, then generate one or more sampling programs. We allow minimal
user interaction to broaden the scope of application beyond what is possible
with static analysis alone. We present an implementation targeting the popular
Stan probabilistic programming language, automating large parts of a robust
Bayesian workflow for a wide community of probabilistic programming users.
","[{'version': 'v1', 'created': 'Fri, 21 Aug 2020 21:06:34 GMT'}]",2020-08-31,"[['Bernstein', 'Ryan', ''], ['Vákár', 'Matthijs', ''], ['Wing', 'Jeannette', '']]","['probabilistic programming', 'static analysis', 'Bayesian workflow']"
12386,1910.03478,Javier Cabrera ARteaga,"Javier Cabrera-Arteaga, Martin Monperrus and Benoit Baudry",Scalable Comparison of JavaScript V8 Bytecode Traces,"10 pages, 6 figures, 2 tables,","Proceedings of the SPLASH workshop on Virtual Machines and
  Language Implementations (VMIL), 2019",10.1145/3358504.3361228,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The comparison and alignment of runtime traces are essential, e.g., for
semantic analysis or debugging. However, naive sequence alignment algorithms
cannot address the needs of the modern web: (i) the bytecode generation process
of V8 is not deterministic; (ii) bytecode traces are large.
  We present STRAC, a scalable and extensible tool tailored to compare bytecode
traces generated by the V8 JavaScript engine. Given two V8 bytecode traces and
a distance function between trace events, STRAC computes and provides the best
alignment. The key insight is to split access between memory and disk. STRAC
can identify semantically equivalent web pages and is capable of processing
huge V8 bytecode traces whose order of magnitude matches today's web like
https://2019.splashcon.org, which generates approx. 150k of V8 bytecode
instructions.
","[{'version': 'v1', 'created': 'Tue, 8 Oct 2019 15:46:42 GMT'}]",2019-10-17,"[['Cabrera-Arteaga', 'Javier', ''], ['Monperrus', 'Martin', ''], ['Baudry', 'Benoit', '']]","['V8', 'Sequence alignment', 'JavaScript', 'Bytecode', 'Similarity measurement']"
12387,1801.10082,Alexey Medvedev N.,"Alexey N. Medvedev, Jean-Charles Delvenne, Renaud Lambiotte","Modelling structure and predicting dynamics of discussion threads in
  online boards","16 pages (2 pages appendix incl.), 10 figures (8 in main text + 2 in
  appendix)","Journal of Complex Networks, Volume 7, Issue 1, February 2019,
  Pages 67-82",10.1093/comnet/cny010,,cs.SI math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet boards are platforms for online discussions about a variety of
topics. On these boards, individuals may start a new thread on a specific
matter, or leave comments in an existing discussion. The resulting collective
process leads to the formation of `discussion trees', where nodes represent a
post and comments, and an edge represents a `reply-to' relation. The structure
of discussion trees has been analysed in previous works, but only from a static
perspective. In this paper, we focus on their structural and dynamical
properties by modelling their formation as a self-exciting Hawkes process. We
first study a Reddit dataset to show that the structure of the trees resemble
those produced by a Galton-Watson process with a special root offspring
distribution. The dynamical aspect of the model is then used to predict future
commenting activity and the final size of a discussion tree. We compare the
efficiency of our approach with previous works and show its superiority for the
prediction of the dynamics of discussions.
","[{'version': 'v1', 'created': 'Tue, 30 Jan 2018 16:14:29 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Jun 2020 08:20:51 GMT'}]",2020-06-05,"[['Medvedev', 'Alexey N.', ''], ['Delvenne', 'Jean-Charles', ''], ['Lambiotte', 'Renaud', '']]","['complex networks', 'temporal networks', 'Hawkes processes', 'bursty time series', 'cascadeprediction', 'online discussions']"
12388,2108.12301,Dmitry Kulyabov,Dmitry S. Kulyabov and Anna V. Korolkova,Computer algebra in Julia,in English; in Russian,,10.1134/S0361768821020079,,cs.SC,http://creativecommons.org/licenses/by/4.0/,"  Recently, the place of the main programming language for scientific and
engineering computations has been little by little taken by Julia. Some users
want to work completely within the Julia framework as they work within the
Python framework. There are libraries for Julia that cover the majority of
scientific and engineering computations demands. The aim of this paper is to
combine the usage of the Julia framework for numerical computations and for
symbolic computations in mathematical modeling problems. The main functional
domains determining various variants of the application of computer algebra
systems are described. In each of these domains, generic representatives of
computer algebra systems in Julia are distinguished. The conclusion is that it
is possible (and even convenient) to use computer algebra systems within the
Julia framework.
","[{'version': 'v1', 'created': 'Fri, 27 Aug 2021 14:24:51 GMT'}]",2021-08-30,"[['Kulyabov', 'Dmitry S.', ''], ['Korolkova', 'Anna V.', '']]","['Julia language', 'SymPy computer algebra', 'Wolfram language', 'Computer Algebra Systems']"
12389,1802.04749,Kevin Moran P,"Kevin Moran, Michele Tufano, Carlos Bernal-C\'ardenas, Mario
  Linares-V\'asquez, Gabriele Bavota, Christopher Vendome, Massimiliano Di
  Penta and Denys Poshyvanyk",MDroid+: A Mutation Testing Framework for Android,"4 Pages, Accepted to the Formal Tool Demonstration Track at the 40th
  International Conference on Software Engineering (ICSE'18)",,10.1145/3183440.3183492,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mutation testing has shown great promise in assessing the effectiveness of
test suites while exhibiting additional applications to test-case generation,
selection, and prioritization. Traditional mutation testing typically utilizes
a set of simple language specific source code transformations, called
operators, to introduce faults. However, empirical studies have shown that for
mutation testing to be most effective, these simple operators must be augmented
with operators specific to the domain of the software under test. One
challenging software domain for the application of mutation testing is that of
mobile apps. While mobile devices and accompanying apps have become a mainstay
of modern computing, the frameworks and patterns utilized in their development
make testing and verification particularly difficult. As a step toward helping
to measure and ensure the effectiveness of mobile testing practices, we
introduce MDroid+, an automated framework for mutation testing of Android apps.
MDroid+ includes 38 mutation operators from ten empirically derived types of
Android faults and has been applied to generate over 8,000 mutants for more
than 50 apps.
","[{'version': 'v1', 'created': 'Tue, 13 Feb 2018 17:18:10 GMT'}]",2018-02-14,"[['Moran', 'Kevin', ''], ['Tufano', 'Michele', ''], ['Bernal-Cárdenas', 'Carlos', ''], ['Linares-Vásquez', 'Mario', ''], ['Bavota', 'Gabriele', ''], ['Vendome', 'Christopher', ''], ['Di Penta', 'Massimiliano', ''], ['Poshyvanyk', 'Denys', '']]","['Mutation testing', 'Operators', 'Android']"
12390,2002.09846,Wei Ye,"Wei Ye, Zhen Wang, Rachel Redberg, Ambuj Singh",Tree++: Truncated Tree Based Graph Kernels,,,10.1109/TKDE.2019.2946149,,cs.LG cs.SI stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Graph-structured data arise ubiquitously in many application domains. A
fundamental problem is to quantify their similarities. Graph kernels are often
used for this purpose, which decompose graphs into substructures and compare
these substructures. However, most of the existing graph kernels do not have
the property of scale-adaptivity, i.e., they cannot compare graphs at multiple
levels of granularities. Many real-world graphs such as molecules exhibit
structure at varying levels of granularities. To tackle this problem, we
propose a new graph kernel called Tree++ in this paper. At the heart of Tree++
is a graph kernel called the path-pattern graph kernel. The path-pattern graph
kernel first builds a truncated BFS tree rooted at each vertex and then uses
paths from the root to every vertex in the truncated BFS tree as features to
represent graphs. The path-pattern graph kernel can only capture graph
similarity at fine granularities. In order to capture graph similarity at
coarse granularities, we incorporate a new concept called super path into it.
The super path contains truncated BFS trees rooted at the vertices in a path.
Our evaluation on a variety of real-world graphs demonstrates that Tree++
achieves the best classification accuracy compared with previous graph kernels.
","[{'version': 'v1', 'created': 'Sun, 23 Feb 2020 07:07:10 GMT'}]",2020-03-26,"[['Ye', 'Wei', ''], ['Wang', 'Zhen', ''], ['Redberg', 'Rachel', ''], ['Singh', 'Ambuj', '']]","['Graph kernel', 'Graph classification', 'Truncated tree', 'Path', 'Path pattern', 'Super path', 'BFS']"
12391,2012.13581,Ajoy Mondal Dr.,Ajoy Mondal,Camouflaged Object Detection and Tracking: A Survey,,"International Journal of Image and Graphics, 2020",10.1142/S021946782050028X,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Moving object detection and tracking have various applications, including
surveillance, anomaly detection, vehicle navigation, etc. The literature on
object detection and tracking is rich enough, and several essential survey
papers exist. However, the research on camouflage object detection and tracking
limited due to the complexity of the problem. Existing work on this problem has
been done based on either biological characteristics of the camouflaged objects
or computer vision techniques. In this article, we review the existing
camouflaged object detection and tracking techniques using computer vision
algorithms from the theoretical point of view. This article also addresses
several issues of interest as well as future research direction on this area.
We hope this review will help the reader to learn the recent advances in
camouflaged object detection and tracking.
","[{'version': 'v1', 'created': 'Fri, 25 Dec 2020 14:15:45 GMT'}]",2020-12-29,"[['Mondal', 'Ajoy', '']]","['Camouflaged object', 'detection', 'tracking']"
12392,2201.00301,Prasang Gupta,"Prasang Gupta, Antoinette Young, Anand Rao","Investigating Cargo Loss in Logistics Systems using Low-Cost Impact
  Sensors","March 26~27, 2022 - Sydney, Australia (11 pages, 4 figures)","Embedded Systems and Applications (Volume 12, Number 06, March
  2022)",10.5121/csit.2022.120618,,cs.NI cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Cargo loss/damage is a very common problem faced by almost any business with
a supply chain arm, leading to major problems like revenue loss and reputation
tarnishing. This problem can be solved by employing an asset and impact
tracking solution. This would be more practical and effective for high-cost
cargo in comparison to low-cost cargo due to the high costs associated with the
sensors and overall solution. In this study, we propose a low-cost solution
architecture that is scalable, user-friendly, easy to adopt and is viable for a
large range of cargo and logistics systems. Taking inspiration from a real-life
use case we solved for a client, we also provide insights into the architecture
as well as the design decisions that make this a reality.
","[{'version': 'v1', 'created': 'Sun, 2 Jan 2022 06:02:13 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Apr 2022 05:16:19 GMT'}]",2022-04-20,"[['Gupta', 'Prasang', ''], ['Young', 'Antoinette', ''], ['Rao', 'Anand', '']]","['Asset tracking', 'Logistics', 'Cargo loss', 'Cargo damage', 'Impact sensor', 'Accelerometer sensor', 'Low-cost solution', 'No code AEP (Application Enablement Platform)']"
12393,1601.01203,Lovro \v{S}ubelj,"Lovro \v{S}ubelj, Dalibor Fiala","Publication boost in Web of Science journals and its effect on citation
  distributions","14 pages, 5 figures, J. Assoc. Inf. Sci. Tec. (2016)","J. Assoc. Inf. Sci. Tec. 68(4), 1018-1023 (2017)",10.1002/asi.23718,,cs.DL cs.SI physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we show that the dramatic increase in the number of research
articles indexed in the Web of Science database impacts the commonly observed
distributions of citations within these articles. First, we document that the
growing number of physics articles in recent years is due to existing journals
publishing more and more papers rather than more new journals coming into being
as it happens in computer science. And second, even though the references from
the more recent papers generally cover a longer time span, the newer papers are
cited more frequently than the older ones if the uneven paper growth is not
corrected for. Nevertheless, despite this change in the distribution of
citations, the citation behavior of scientists does not seem to have changed.
","[{'version': 'v1', 'created': 'Wed, 6 Jan 2016 15:10:57 GMT'}, {'version': 'v2', 'created': 'Sat, 11 Jun 2016 11:00:38 GMT'}]",2017-03-09,"[['Šubelj', 'Lovro', ''], ['Fiala', 'Dalibor', '']]","['Web of Science', 'publications', 'citations', 'references', 'distribution']"
12394,1909.11342,Robert Y. Lewis,Robert Y. Lewis,A formal proof of Hensel's lemma over the p-adic integers,CPP 2019,,10.1145/3293880.3294089,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The field of $p$-adic numbers $\mathbb{Q}_p$ and the ring of $p$-adic
integers $\mathbb{Z}_p$ are essential constructions of modern number theory.
Hensel's lemma, described by Gouv\^ea as the ""most important algebraic property
of the $p$-adic numbers,"" shows the existence of roots of polynomials over
$\mathbb{Z}_p$ provided an initial seed point. The theorem can be proved for
the $p$-adics with significantly weaker hypotheses than for general rings. We
construct $\mathbb{Q}_p$ and $\mathbb{Z}_p$ in the Lean proof assistant, with
various associated algebraic properties, and formally prove a strong form of
Hensel's lemma. The proof lies at the intersection of algebraic and analytic
reasoning and demonstrates how the Lean mathematical library handles such a
heterogeneous topic.
","[{'version': 'v1', 'created': 'Wed, 25 Sep 2019 08:42:11 GMT'}]",2019-09-26,"[['Lewis', 'Robert Y.', '']]","['Lean', 'p-adic', 'Hensel’s lemma', 'formal proof']"
12395,2205.01969,Chukwuma Okolie,"Peter C. Nwilo., Chukwuma J. Okolie, Johanson C. Onyegbula, Ikenna D.
  Arungwa, Owolabi Q. Ayoade, Olagoke E. Daramola, Michael J. Orji, Ikechukwu
  D. Maduako and Imeime I. Uyo",Positional Accuracy Assessment of Historical Google Earth Imagery,36 pages,,10.1007/s12518-022-00449-9,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Google Earth is the most popular virtual globe in use today. Given its
popularity and usefulness, most users do not pay close attention to the
positional accuracy of the imagery, and there is limited information on the
subject. This study evaluates the horizontal accuracy of historical GE imagery
at four epochs between year 2000 and 2018, and the vertical accuracy of its
elevation data within Lagos State in Nigeria, West Africa. The horizontal
accuracies of the images were evaluated by comparison with a very high
resolution (VHR) digital orthophoto while the vertical accuracy was assessed by
comparison with a network of 558 ground control points. The GE elevations were
also compared to elevation data from two readily available 30m digital
elevation models (DEMs), the Shuttle Radar Topography Mission (SRTM) v3.0 and
the Advanced Land Observing Satellite World 3D (AW3D) DEM v2.1. The most recent
GE imagery (year 2018) was the most accurate while year 2000 was the least
accurate. This shows a continuous enhancement in the accuracy and reliability
of satellite imagery data sources which form the source of Google Earth data.
In terms of the vertical accuracy, GE elevation data had the highest RMSE of
6.213m followed by AW3D with an RMSE of 4.388m and SRTM with an RMSE of 3.682m.
Although the vertical accuracy of SRTM and AW3D are superior, Google Earth
still presents clear advantages in terms of its ease of use and contextual
awareness.
","[{'version': 'v1', 'created': 'Wed, 4 May 2022 09:36:37 GMT'}, {'version': 'v2', 'created': 'Sun, 24 Jul 2022 16:40:31 GMT'}]",2022-07-26,"[['Nwilo.', 'Peter C.', ''], ['Okolie', 'Chukwuma J.', ''], ['Onyegbula', 'Johanson C.', ''], ['Arungwa', 'Ikenna D.', ''], ['Ayoade', 'Owolabi Q.', ''], ['Daramola', 'Olagoke E.', ''], ['Orji', 'Michael J.', ''], ['Maduako', 'Ikechukwu D.', ''], ['Uyo', 'Imeime I.', '']]","['Google Earth Imagery', 'Positional Accuracy', 'Global Positioning System', 'Shuttle Radar Topography Mission']"
12396,2009.11353,Konstantin Avrachenkov,"Konstantin Avrachenkov, Andrei Bobu, Maximilien Dreveton",Higher-Order Spectral Clustering for Geometric Graphs,"23 pages, 6 figures","Journal of Fourier Analysis and Applications, 27:22, 2021",10.1007/s00041-021-09825-2,,cs.LG cs.SI math.PR math.SP stat.ML,http://creativecommons.org/licenses/by/4.0/,"  The present paper is devoted to clustering geometric graphs. While the
standard spectral clustering is often not effective for geometric graphs, we
present an effective generalization, which we call higher-order spectral
clustering. It resembles in concept the classical spectral clustering method
but uses for partitioning the eigenvector associated with a higher-order
eigenvalue. We establish the weak consistency of this algorithm for a wide
class of geometric graphs which we call Soft Geometric Block Model. A small
adjustment of the algorithm provides strong consistency. We also show that our
method is effective in numerical experiments even for graphs of modest size.
","[{'version': 'v1', 'created': 'Wed, 23 Sep 2020 19:51:55 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Mar 2021 16:57:43 GMT'}]",2021-03-16,"[['Avrachenkov', 'Konstantin', ''], ['Bobu', 'Andrei', ''], ['Dreveton', 'Maximilien', '']]","['Spectral clustering', 'Random geometric graphs', 'Block models']"
12397,2009.02083,Seiji Ishihara,Seiji Ishihara and Harukazu Igarashi,"Policy Gradient Reinforcement Learning for Policy Represented by Fuzzy
  Rules: Application to Simulations of Speed Control of an Automobile",,"Journal of Japan Society for Fuzzy Theory and Intelligent
  Informatics, Vol. 32, No. 4, pp. 801-810, 2020 (in Japanese)",10.3156/jsoft.32.4_801,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A method of a fusion of fuzzy inference and policy gradient reinforcement
learning has been proposed that directly learns, as maximizes the expected
value of the reward per episode, parameters in a policy function represented by
fuzzy rules with weights. A study has applied this method to a task of speed
control of an automobile and has obtained correct policies, some of which
control speed of the automobile appropriately but many others generate
inappropriate vibration of speed. In general, the policy is not desirable that
causes sudden time change or vibration in the output value, and there would be
many cases where the policy giving smooth time change in the output value is
desirable. In this paper, we propose a fusion method using the objective
function, that introduces defuzzification with the center of gravity model
weighted stochastically and a constraint term for smoothness of time change, as
an improvement measure in order to suppress sudden change of the output value
of the fuzzy controller. Then we show the learning rule in the fusion, and also
consider the effect by reward functions on the fluctuation of the output value.
As experimental results of an application of our method on speed control of an
automobile, it was confirmed that the proposed method has the effect of
suppressing the undesirable fluctuation in time-series of the output value.
Moreover, it was also showed that the difference between reward functions might
adversely affect the results of learning.
","[{'version': 'v1', 'created': 'Fri, 4 Sep 2020 09:30:13 GMT'}]",2020-09-07,"[['Ishihara', 'Seiji', ''], ['Igarashi', 'Harukazu', '']]","['fuzzy controller', 'reinforcement learning', 'policy gradient method', 'center of gravity model', 'speed controlproblem']"
12398,2208.03078,Matias Quintana,"Matias Quintana, Stefano Schiavon, Federico Tartarini, Joyce Kim,
  Clayton Miller","Cohort comfort models -- Using occupants' similarity to predict personal
  thermal preference with less data",,Building and Environment 2023; 227:109685,10.1016/j.buildenv.2022.109685,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  We introduce Cohort Comfort Models, a new framework for predicting how new
occupants would perceive their thermal environment. Cohort Comfort Models
leverage historical data collected from a sample population, who have some
underlying preference similarity, to predict thermal preference responses of
new occupants. Our framework is capable of exploiting available background
information such as physical characteristics and one-time on-boarding surveys
(satisfaction with life scale, highly sensitive person scale, the Big Five
personality traits) from the new occupant as well as physiological and
environmental sensor measurements paired with thermal preference responses. We
implemented our framework in two publicly available datasets containing
longitudinal data from 55 people, comprising more than 6,000 individual thermal
comfort surveys. We observed that, a Cohort Comfort Model that uses background
information provided very little change in thermal preference prediction
performance but uses none historical data. On the other hand, for half and one
third of each dataset occupant population, using Cohort Comfort Models, with
less historical data from target occupants, Cohort Comfort Models increased
their thermal preference prediction by 8~\% and 5~\% on average, and up to
36~\% and 46~\% for some occupants, when compared to general-purpose models
trained on the whole population of occupants. The framework is presented in a
data and site agnostic manner, with its different components easily tailored to
the data availability of the occupants and the buildings. Cohort Comfort Models
can be an important step towards personalization without the need of developing
a personalized model for each new occupant.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2022 10:21:03 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Nov 2022 05:49:06 GMT'}]",2022-11-23,"[['Quintana', 'Matias', ''], ['Schiavon', 'Stefano', ''], ['Tartarini', 'Federico', ''], ['Kim', 'Joyce', ''], ['Miller', 'Clayton', '']]","['Thermal comfort', 'Clustering', 'Personalized environments', 'Cold start', 'Warm start', 'Recommender systems']"
12399,2212.12488,Qiaoyu Tan,"Qiaoyu Tan, Xin Zhang, Ninghao Liu, Daochen Zha, Li Li, Rui Chen,
  Soo-Hyun Choi, Xia Hu","Bring Your Own View: Graph Neural Networks for Link Prediction with
  Personalized Subgraph Selection",,,10.1145/3539597.3570407,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph neural networks (GNNs) have received remarkable success in link
prediction (GNNLP) tasks. Existing efforts first predefine the subgraph for the
whole dataset and then apply GNNs to encode edge representations by leveraging
the neighborhood structure induced by the fixed subgraph. The prominence of
GNNLP methods significantly relies on the adhoc subgraph. Since node
connectivity in real-world graphs is complex, one shared subgraph is limited
for all edges. Thus, the choices of subgraphs should be personalized to
different edges. However, performing personalized subgraph selection is
nontrivial since the potential selection space grows exponentially to the scale
of edges. Besides, the inference edges are not available during training in
link prediction scenarios, so the selection process needs to be inductive. To
bridge the gap, we introduce a Personalized Subgraph Selector (PS2) as a
plug-and-play framework to automatically, personally, and inductively identify
optimal subgraphs for different edges when performing GNNLP. PS2 is
instantiated as a bi-level optimization problem that can be efficiently solved
differently. Coupling GNNLP models with PS2, we suggest a brand-new angle
towards GNNLP training: by first identifying the optimal subgraphs for edges;
and then focusing on training the inference model by using the sampled
subgraphs. Comprehensive experiments endorse the effectiveness of our proposed
method across various GNNLP backbones (GCN, GraphSage, NGCF, LightGCN, and
SEAL) and diverse benchmarks (Planetoid, OGB, and Recommendation datasets). Our
code is publicly available at \url{https://github.com/qiaoyu-tan/PS2}
","[{'version': 'v1', 'created': 'Fri, 23 Dec 2022 17:30:19 GMT'}]",2022-12-26,"[['Tan', 'Qiaoyu', ''], ['Zhang', 'Xin', ''], ['Liu', 'Ninghao', ''], ['Zha', 'Daochen', ''], ['Li', 'Li', ''], ['Chen', 'Rui', ''], ['Choi', 'Soo-Hyun', ''], ['Hu', 'Xia', '']]","['Graph neural networks', 'personalized subgraph selection', 'link prediction', 'bi-level optimization']"
12400,1802.00304,Malika Bendechache,Malika Bendechache and M-Tahar Kechadi,Distributed Clustering Algorithm for Spatial Data Mining,6 pages. arXiv admin note: text overlap with arXiv:1704.03421,"Spatial Data Mining and Geographical Knowledge Services (ICSDM),
  2015 2nd IEEE International Conference on, pages 60--65, 2015",10.1109/ICSDM.2015.7298026,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed data mining techniques and mainly distributed clustering are
widely used in the last decade because they deal with very large and
heterogeneous datasets which cannot be gathered centrally. Current distributed
clustering approaches are normally generating global models by aggregating
local results that are obtained on each site. While this approach mines the
datasets on their locations the aggregation phase is complex, which may produce
incorrect and ambiguous global clusters and therefore incorrect knowledge. In
this paper we propose a new clustering approach for very large spatial datasets
that are heterogeneous and distributed. The approach is based on K-means
Algorithm but it generates the number of global clusters dynamically. Moreover,
this approach uses an elaborated aggregation phase. The aggregation phase is
designed in such a way that the overall process is efficient in time and memory
allocation. Preliminary results show that the proposed approach produces high
quality results and scales up well. We also compared it to two popular
clustering algorithms and show that this approach is much more efficient.
","[{'version': 'v1', 'created': 'Thu, 1 Feb 2018 14:41:33 GMT'}]",2018-02-02,"[['Bendechache', 'Malika', ''], ['Kechadi', 'M-Tahar', '']]","['Spatial data', 'clustering', 'distributed mining', 'data analysis', 'k-means']"
12401,1810.05964,Dogancan Temel,Dogancan Temel and Ghassan AlRegib,"Perceptual Image Quality Assessment through Spectral Analysis of Error
  Representations","23 pages, 6 figures, 4 tables","Signal Processing: Image Communication, Volume 70, 2019, Pages
  37-46,ISSN 0923-5965",10.1016/j.image.2018.09.005,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we analyze the statistics of error signals to assess the
perceived quality of images. Specifically, we focus on the magnitude spectrum
of error images obtained from the difference of reference and distorted images.
Analyzing spectral statistics over grayscale images partially models
interference in spatial harmonic distortion exhibited by the visual system but
it overlooks color information, selective and hierarchical nature of visual
system. To overcome these shortcomings, we introduce an image quality
assessment algorithm based on the Spectral Understanding of Multi-scale and
Multi-channel Error Representations, denoted as SUMMER. We validate the quality
assessment performance over 3 databases with around 30 distortion types. These
distortion types are grouped into 7 main categories as compression artifact,
image noise, color artifact, communication error, blur, global and local
distortions. In total, we benchmark the performance of 17 algorithms along with
the proposed algorithm using 5 performance metrics that measure linearity,
monotonicity, accuracy, and consistency. In addition to experiments with
standard performance metrics, we analyze the distribution of objective and
subjective scores with histogram difference metrics and scatter plots.
Moreover, we analyze the classification performance of quality assessment
algorithms along with their statistical significance tests. Based on our
experiments, SUMMER significantly outperforms majority of the compared methods
in all benchmark categories
","[{'version': 'v1', 'created': 'Sun, 14 Oct 2018 04:13:56 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Nov 2018 15:49:25 GMT'}]",2018-11-14,"[['Temel', 'Dogancan', ''], ['AlRegib', 'Ghassan', '']]","['= ”Full-referenceimage quality assessment', 'Visual system', 'Error spectrum', 'Spectral analysis', 'Color perception', 'Multi-resolution”}']"
12402,2108.12411,Valentina Lenarduzzi,"Valentina Lenarduzzi, Oscar Dieste, Davide Fucci, Sira Vegas","Towards a Methodology for Participant Selection in Software Engineering
  Experiments. A Vision of the Future",,,10.1145/3475716.3484273,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Background. Software Engineering (SE) researchers extensively perform
experiments with human subjects. Well-defined samples are required to ensure
external validity. Samples are selected \textit{purposely} or by
\textit{convenience}, limiting the generalizability of results. Objective. We
aim to depict the current status of participants selection in empirical SE,
identifying the main threats and how they are mitigated. We draft a robust
approach to participants' selection. Method. We reviewed existing participants'
selection guidelines in SE, and performed a preliminary literature review to
find out how participants' selection is conducted in SE in practice. % and 3)
we summarized the main issues identified. Results. We outline a new selection
methodology, by 1) defining the characteristics of the desired population, 2)
locating possible sources of sampling available for researchers, and 3)
identifying and reducing the ""distance"" between the selected sample and its
corresponding population. Conclusion. We propose a roadmap to develop and
empirically validate the selection methodology.
","[{'version': 'v1', 'created': 'Fri, 27 Aug 2021 17:41:01 GMT'}]",2021-08-30,"[['Lenarduzzi', 'Valentina', ''], ['Dieste', 'Oscar', ''], ['Fucci', 'Davide', ''], ['Vegas', 'Sira', '']]","['Participant Selection', 'Empirical Software Engineering', 'ControlledExperiment', 'Threats to Validity', 'Generalizability']"
12403,2109.06471,Haolan Zhan,"Lei Shen, Haolan Zhan, Xin Shen, Hongshen Chen, Xiaofang Zhao and
  Xiaodan Zhu","Identifying Untrustworthy Samples: Data Filtering for Open-domain
  Dialogues with Bayesian Optimization",Accepted by CIKM 2021,,10.1145/3459637.3482352,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Being able to reply with a related, fluent, and informative response is an
indispensable requirement for building high-quality conversational agents. In
order to generate better responses, some approaches have been proposed, such as
feeding extra information by collecting large-scale datasets with human
annotations, designing neural conversational models (NCMs) with complex
architecture and loss functions, or filtering out untrustworthy samples based
on a dialogue attribute, e.g., Relatedness or Genericness. In this paper, we
follow the third research branch and present a data filtering method for
open-domain dialogues, which identifies untrustworthy samples from training
data with a quality measure that linearly combines seven dialogue attributes.
The attribute weights are obtained via Bayesian Optimization (BayesOpt) that
aims to optimize an objective function for dialogue generation iteratively on
the validation set. Then we score training samples with the quality measure,
sort them in descending order, and filter out those at the bottom. Furthermore,
to accelerate the ""filter-train-evaluate"" iterations involved in BayesOpt on
large-scale datasets, we propose a training framework that integrates maximum
likelihood estimation (MLE) and negative training method (NEG). The training
method updates parameters of a trained NCMs on two small sets with newly
maintained and removed samples, respectively. Specifically, MLE is applied to
maximize the log-likelihood of newly maintained samples, while NEG is used to
minimize the log-likelihood of newly removed ones. Experimental results on two
datasets show that our method can effectively identify untrustworthy samples,
and NCMs trained on the filtered datasets achieve better performance.
","[{'version': 'v1', 'created': 'Tue, 14 Sep 2021 06:42:54 GMT'}]",2021-09-15,"[['Shen', 'Lei', ''], ['Zhan', 'Haolan', ''], ['Shen', 'Xin', ''], ['Chen', 'Hongshen', ''], ['Zhao', 'Xiaofang', ''], ['Zhu', 'Xiaodan', '']]","['Dialogue systems', 'Data filtering', 'Bayesian optimization']"
12404,2207.11844,Min Zhang,"Min Zhang, Zhihong Pan, Xin Zhou, C.-C. Jay Kuo","Enhancing Image Rescaling using Dual Latent Variables in Invertible
  Neural Network",Accepted by ACM Multimedia 2022,,10.1145/3503161.3548376,,cs.CV eess.IV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Normalizing flow models have been used successfully for generative image
super-resolution (SR) by approximating complex distribution of natural images
to simple tractable distribution in latent space through Invertible Neural
Networks (INN). These models can generate multiple realistic SR images from one
low-resolution (LR) input using randomly sampled points in the latent space,
simulating the ill-posed nature of image upscaling where multiple
high-resolution (HR) images correspond to the same LR. Lately, the invertible
process in INN has also been used successfully by bidirectional image rescaling
models like IRN and HCFlow for joint optimization of downscaling and inverse
upscaling, resulting in significant improvements in upscaled image quality.
While they are optimized for image downscaling too, the ill-posed nature of
image downscaling, where one HR image could be downsized to multiple LR images
depending on different interpolation kernels and resampling methods, is not
considered. A new downscaling latent variable, in addition to the original one
representing uncertainties in image upscaling, is introduced to model
variations in the image downscaling process. This dual latent variable
enhancement is applicable to different image rescaling models and it is shown
in extensive experiments that it can improve image upscaling accuracy
consistently without sacrificing image quality in downscaled LR images. It is
also shown to be effective in enhancing other INN-based models for image
restoration applications like image hiding.
","[{'version': 'v1', 'created': 'Sun, 24 Jul 2022 23:12:51 GMT'}]",2022-07-26,"[['Zhang', 'Min', ''], ['Pan', 'Zhihong', ''], ['Zhou', 'Xin', ''], ['Kuo', 'C. -C. Jay', '']]","['image rescaling', 'latent variable', 'invertible neural network']"
12405,2002.10530,Lucas Layman,"William Roden, Lucas Layman","Cry Wolf: Toward an Experimentation Platform and Dataset for Human
  Factors in Cyber Security Analysis","The definitive Version of Record was published in the 2020 ACM
  Southeast Conference (ACMSE 2020), April 2--4, 2020, Tampa, FL, USA",,10.1145/3374135.3385301,,cs.CR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer network defense is a partnership between automated systems and human
cyber security analysts. The system behaviors, for example raising a high
proportion of false alarms, likely impact cyber analyst performance.
Experimentation in the analyst-system domain is challenging due to lack of
access to security experts, the usability of attack datasets, and the training
required to use security analysis tools. This paper describes Cry Wolf, an open
source web application for user studies of cyber security analysis tasks. This
paper also provides an open-access dataset of 73 true and false Intrusion
Detection System (IDS) alarms derived from real-world examples of ""impossible
travel"" scenarios. Cry Wolf and the impossible travel dataset were used in an
experiment on the impact of IDS false alarm rate on analysts' abilities to
correctly classify IDS alerts as true or false alarms. Results from that
experiment are used to evaluate the quality of the dataset using difficulty and
discrimination index measures drawn from classical test theory. Many alerts in
the dataset provide good discrimination for participants' overall task
performance.
","[{'version': 'v1', 'created': 'Mon, 24 Feb 2020 20:38:23 GMT'}]",2020-02-26,"[['Roden', 'William', ''], ['Layman', 'Lucas', '']]","['cyber security', 'human factors', 'IDS']"
12406,1807.10438,Ali Dehghantanha,"Mauro Conti, Ali Dehghantanha, Katrin Franke, Steve Watson",Internet of Things Security and Forensics: Challenges and Opportunities,,,10.1016/j.future.2017.07.060,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The Internet of Things (IoT) envisions pervasive, connected, and smart nodes
interacting autonomously while offering all sorts of services. Wide
distribution, openness and relatively high processing power of IoT objects made
them an ideal target for cyber attacks. Moreover, as many of IoT nodes are
collecting and processing private information, they are becoming a goldmine of
data for malicious actors. Therefore, security and specifically the ability to
detect compromised nodes, together with collecting and preserving evidences of
an attack or malicious activities emerge as a priority in successful deployment
of IoT networks. In this paper, we first introduce existing major security and
forensics challenges within IoT domain and then briefly discuss about papers
published in this special issue targeting identified challenges.
","[{'version': 'v1', 'created': 'Fri, 27 Jul 2018 05:28:29 GMT'}]",2018-07-30,"[['Conti', 'Mauro', ''], ['Dehghantanha', 'Ali', ''], ['Franke', 'Katrin', ''], ['Watson', 'Steve', '']]","['Internet of Things', 'Cyber Security', 'Digital Forensics']"
12407,2009.06402,Liesbeth Allein,"Liesbeth Allein, Isabelle Augenstein and Marie-Francine Moens",Time-Aware Evidence Ranking for Fact-Checking,"16 pages, accepted for publication in Journal of Web Semantics -
  Special Issue on Content Credibility",,10.1016/j.websem.2021.100663,,cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Truth can vary over time. Fact-checking decisions on claim veracity should
therefore take into account temporal information of both the claim and
supporting or refuting evidence. In this work, we investigate the hypothesis
that the timestamp of a Web page is crucial to how it should be ranked for a
given claim. We delineate four temporal ranking methods that constrain evidence
ranking differently and simulate hypothesis-specific evidence rankings given
the evidence timestamps as gold standard. Evidence ranking in three
fact-checking models is ultimately optimized using a learning-to-rank loss
function. Our study reveals that time-aware evidence ranking not only surpasses
relevance assumptions based purely on semantic similarity or position in a
search results list, but also improves veracity predictions of time-sensitive
claims in particular.
","[{'version': 'v1', 'created': 'Thu, 10 Sep 2020 13:39:49 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Feb 2021 09:15:20 GMT'}, {'version': 'v3', 'created': 'Fri, 30 Jul 2021 12:24:13 GMT'}, {'version': 'v4', 'created': 'Thu, 9 Sep 2021 11:41:26 GMT'}]",2021-10-13,"[['Allein', 'Liesbeth', ''], ['Augenstein', 'Isabelle', ''], ['Moens', 'Marie-Francine', '']]","['automated fact-checking', 'temporal relevance', 'temporal semantics', 'document ranking', 'learning to rank']"
12408,cs/0603090,Alexander Gorban,"A.N. Gorban, N.R. Sumner, A.Y. Zinovyev",Topological Grammars for Data Approximation,"Corrected Journal version, Appl. Math. Lett., in press. 7 pgs., 2
  figs",Applied Mathematics Letters 20 (2007) 382--386,10.1016/j.aml.2006.04.022,,cs.NE cs.LG,,"  A method of {\it topological grammars} is proposed for multidimensional data
approximation. For data with complex topology we define a {\it principal cubic
complex} of low dimension and given complexity that gives the best
approximation for the dataset. This complex is a generalization of linear and
non-linear principal manifolds and includes them as particular cases. The
problem of optimal principal complex construction is transformed into a series
of minimization problems for quadratic functionals. These quadratic functionals
have a physically transparent interpretation in terms of elastic energy. For
the energy computation, the whole complex is represented as a system of nodes
and springs. Topologically, the principal complex is a product of
one-dimensional continuums (represented by graphs), and the grammars describe
how these continuums transform during the process of optimal complex
construction. This factorization of the whole process onto one-dimensional
transformations using minimization of quadratic energy functionals allow us to
construct efficient algorithms.
","[{'version': 'v1', 'created': 'Wed, 22 Mar 2006 22:52:23 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Jul 2006 13:41:39 GMT'}]",2007-05-23,"[['Gorban', 'A. N.', ''], ['Sumner', 'N. R.', ''], ['Zinovyev', 'A. Y.', '']]","['Principal component', 'Principal manifold', 'Graph grammar', 'Cubiccomplex', 'Elastic energy', 'Dataset', 'Approximation']"
12409,2201.00439,Didier Ndayikengurukiye,Didier Ndayikengurukiye and Max Mignotte,"Salient Object Detection by LTP Texture Characterization on Opposing
  Color Pairs under SLICO Superpixel Constraint",,"J. Imaging 2022, 8(4), 110",10.3390/jimaging8040110,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The effortless detection of salient objects by humans has been the subject of
research in several fields, including computer vision as it has many
applications. However, salient object detection remains a challenge for many
computer models dealing with color and textured images. Herein, we propose a
novel and efficient strategy, through a simple model, almost without internal
parameters, which generates a robust saliency map for a natural image. This
strategy consists of integrating color information into local textural patterns
to characterize a color micro-texture. Most models in the literature that use
the color and texture features treat them separately. In our case, it is the
simple, yet powerful LTP (Local Ternary Patterns) texture descriptor applied to
opposing color pairs of a color space that allows us to achieve this end. Each
color micro-texture is represented by vector whose components are from a
superpixel obtained by SLICO (Simple Linear Iterative Clustering with zero
parameter) algorithm which is simple, fast and exhibits state-of-the-art
boundary adherence. The degree of dissimilarity between each pair of color
micro-texture is computed by the FastMap method, a fast version of MDS
(Multi-dimensional Scaling), that considers the color micro-textures
non-linearity while preserving their distances. These degrees of dissimilarity
give us an intermediate saliency map for each RGB, HSL, LUV and CMY color
spaces. The final saliency map is their combination to take advantage of the
strength of each of them. The MAE (Mean Absolute Error) and F$_{\beta}$
measures of our saliency maps, on the complex ECSSD dataset show that our model
is both simple and efficient, outperforming several state-of-the-art models.
","[{'version': 'v1', 'created': 'Mon, 3 Jan 2022 00:03:50 GMT'}]",2022-04-15,"[['Ndayikengurukiye', 'Didier', ''], ['Mignotte', 'Max', '']]","['VisualAttention', 'SalientObjectDetection', 'Color Textures', 'Local Ternary Pattern', 'FastMap']"
12410,1601.03892,Massimo Cafaro,"Massimo Cafaro, Marco Pulimeno, Italo Epicoco and Giovanni Aloisio",Mining frequent items in the time fading model,"To appear in Information Sciences, Elsevier","Information Sciences, Elsevier, 2016, Volume 370-371, pp.221-238",10.1016/j.ins.2016.07.077,,cs.DS cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present FDCMSS, a new sketch-based algorithm for mining frequent items in
data streams. The algorithm cleverly combines key ideas borrowed from forward
decay, the Count-Min and the Space Saving algorithms. It works in the time
fading model, mining data streams according to the cash register model. We
formally prove its correctness and show, through extensive experimental
results, that our algorithm outperforms $\lambda$-HCount, a recently developed
algorithm, with regard to speed, space used, precision attained and error
committed on both synthetic and real datasets.
","[{'version': 'v1', 'created': 'Fri, 15 Jan 2016 12:21:47 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jun 2016 10:00:22 GMT'}, {'version': 'v3', 'created': 'Tue, 2 Aug 2016 08:24:12 GMT'}]",2016-08-08,"[['Cafaro', 'Massimo', ''], ['Pulimeno', 'Marco', ''], ['Epicoco', 'Italo', ''], ['Aloisio', 'Giovanni', '']]","['frequent items', 'time fading model', 'cash register model', 'sketches']"
12411,1912.11038,Christophe Demko,"Christophe Demko and Karell Bertet and Cyril Faucher and
  Jean-Fran\c{c}ois Viaud and Serge\""i Kuznetsov","Next Priority Concept: A new and generic algorithm computing concepts
  from complex and heterogeneous data","28 pages, 8 figures, 7 algorithms",,10.1016/j.tcs.2020.08.026,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, we present a new data type agnostic algorithm calculating a
concept lattice from heterogeneous and complex data. Our NextPriorityConcept
algorithm is first introduced and proved in the binary case as an extension of
Bordat's algorithm with the notion of strategies to select only some
predecessors of each concept, avoiding the generation of unreasonably large
lattices. The algorithm is then extended to any type of data in a generic way.
It is inspired from pattern structure theory, where data are locally described
by predicates independent of their types, allowing the management of
heterogeneous data.
","[{'version': 'v1', 'created': 'Fri, 20 Dec 2019 19:55:39 GMT'}]",2020-09-08,"[['Demko', 'Christophe', ''], ['Bertet', 'Karell', ''], ['Faucher', 'Cyril', ''], ['Viaud', 'Jean-François', ''], ['Kuznetsov', 'Sergeï', '']]","['Formal Concept Analysis', 'Lattice', 'Pattern Structure', 'Strategies', 'Heterogeneous data']"
12412,2112.00858,Gordon Fraser,"Christoph Fr\""adrich, Florian Oberm\""uller, Nina K\""orber, Ute Heuer,
  Gordon Fraser",Common Bugs in Scratch Programs,"Proceedings of the 2020 ACM Conference on Innovation and Technology
  in Computer Science Education (pp. 89-95)",,10.1145/3341525.3387389,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bugs in Scratch programs can spoil the fun and inhibit learning success. Many
common bugs are the result of recurring patterns of bad code. In this paper we
present a collection of common code patterns that typically hint at bugs in
Scratch programs, and the LitterBox tool which can automatically detect them.
We empirically evaluate how frequently these patterns occur, and how severe
their consequences usually are. While fixing bugs inevitably is part of
learning, the possibility to identify the bugs automatically provides the
potential to support learners
","[{'version': 'v1', 'created': 'Wed, 1 Dec 2021 22:18:00 GMT'}]",2021-12-03,"[['Frädrich', 'Christoph', ''], ['Obermüller', 'Florian', ''], ['Körber', 'Nina', ''], ['Heuer', 'Ute', ''], ['Fraser', 'Gordon', '']]","['Scratch', 'Block-based programming', 'Code quality']"
12413,1906.03489,David Moxey,"David Moxey, Chris D. Cantwell, Yan Bao, Andrea Cassinelli, Giacomo
  Castiglioni, Sehun Chun, Emilia Juda, Ehsan Kazemi, Kilian Lackhove, Julian
  Marcon, Gianmarco Mengaldo, Douglas Serson, Michael Turner, Hui Xu, Joaquim
  Peir\'o, Robert M. Kirby, Spencer J. Sherwin","Nektar++: enhancing the capability and application of high-fidelity
  spectral/$hp$ element methods","21 pages, 14 figures",Computer Physics Communications 249 (2020) 107110,10.1016/j.cpc.2019.107110,,cs.MS cs.NA math.NA physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nektar++ is an open-source framework that provides a flexible,
high-performance and scalable platform for the development of solvers for
partial differential equations using the high-order spectral/$hp$ element
method. In particular, Nektar++ aims to overcome the complex implementation
challenges that are often associated with high-order methods, thereby allowing
them to be more readily used in a wide range of application areas. In this
paper, we present the algorithmic, implementation and application developments
associated with our Nektar++ version 5.0 release. We describe some of the key
software and performance developments, including our strategies on parallel
I/O, on in situ processing, the use of collective operations for exploiting
current and emerging hardware, and interfaces to enable multi-solver coupling.
Furthermore, we provide details on a newly developed Python interface that
enables a more rapid introduction for new users unfamiliar with spectral/$hp$
element methods, C++ and/or Nektar++. This release also incorporates a number
of numerical method developments - in particular: the method of moving frames,
which provides an additional approach for the simulation of equations on
embedded curvilinear manifolds and domains; a means of handling spatially
variable polynomial order; and a novel technique for quasi-3D simulations to
permit spatially-varying perturbations to the geometry in the homogeneous
direction. Finally, we demonstrate the new application-level features provided
in this release, namely: a facility for generating high-order curvilinear
meshes called NekMesh; a novel new AcousticSolver for aeroacoustic problems;
our development of a 'thick' strip model for the modelling of fluid-structure
interaction problems in the context of vortex-induced vibrations. We conclude
by commenting some directions for future code development and expansion.
","[{'version': 'v1', 'created': 'Sat, 8 Jun 2019 17:01:12 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Nov 2019 19:22:23 GMT'}]",2020-02-18,"[['Moxey', 'David', ''], ['Cantwell', 'Chris D.', ''], ['Bao', 'Yan', ''], ['Cassinelli', 'Andrea', ''], ['Castiglioni', 'Giacomo', ''], ['Chun', 'Sehun', ''], ['Juda', 'Emilia', ''], ['Kazemi', 'Ehsan', ''], ['Lackhove', 'Kilian', ''], ['Marcon', 'Julian', ''], ['Mengaldo', 'Gianmarco', ''], ['Serson', 'Douglas', ''], ['Turner', 'Michael', ''], ['Xu', 'Hui', ''], ['Peiró', 'Joaquim', ''], ['Kirby', 'Robert M.', ''], ['Sherwin', 'Spencer J.', '']]","['Nektar++', 'spectral/hp element methods', 'high-order finite element methods']"
12414,2109.09152,Martino Trevisan Dr,"Carlos H.G. Ferreira, Fabricio Murai, Ana P.C. Silva, Jussara M.
  Almeida, Martino Trevisan, Luca Vassio, Marco Mellia, Idilio Drago","On the Dynamics of Political Discussions on Instagram: A Network
  Perspective",,"Online Social Networks and Media, Volume 25, 2021, ISSN 2468-6964",10.1016/j.osnem.2021.100155.,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Instagram has been increasingly used as a source of information especially
among the youth. As a result, political figures now leverage the platform to
spread opinions and political agenda. We here analyze online discussions on
Instagram, notably in political topics, from a network perspective.
Specifically, we investigate the emergence of communities of co-commenters,
that is, groups of users who often interact by commenting on the same posts and
may be driving the ongoing online discussions. In particular, we are interested
in salient co-interactions, i.e., interactions of co-commenters that occur more
often than expected by chance and under independent behavior. Unlike casual and
accidental co-interactions which normally happen in large volumes, salient
co-interactions are key elements driving the online discussions and,
ultimately, the information dissemination. We base our study on the analysis of
10 weeks of data centered around major elections in Brazil and Italy, following
both politicians and other celebrities. We extract and characterize the
communities of co-commenters in terms of topological structure, properties of
the discussions carried out by community members, and how some community
properties, notably community membership and topics, evolve over time. We show
that communities discussing political topics tend to be more engaged in the
debate by writing longer comments, using more emojis, hashtags and negative
words than in other subjects. Also, communities built around political
discussions tend to be more dynamic, although top commenters remain active and
preserve community membership over time. Moreover, we observe a great diversity
in discussed topics over time: whereas some topics attract attention only
momentarily, others, centered around more fundamental political discussions,
remain consistently active over time.
","[{'version': 'v1', 'created': 'Sun, 19 Sep 2021 15:58:49 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Oct 2021 16:41:18 GMT'}, {'version': 'v3', 'created': 'Tue, 13 Sep 2022 08:16:57 GMT'}]",2022-09-14,"[['Ferreira', 'Carlos H. G.', ''], ['Murai', 'Fabricio', ''], ['Silva', 'Ana P. C.', ''], ['Almeida', 'Jussara M.', ''], ['Trevisan', 'Martino', ''], ['Vassio', 'Luca', ''], ['Mellia', 'Marco', ''], ['Drago', 'Idilio', '']]","['Political Discussions', 'Community Dynamics', 'Information Dissemination', 'Network Backbone Extraction', 'Instagram']"
12415,2105.00964,Alex Sim,"Elizabeth Copps, Huiyi Zhang, Alex Sim, Kesheng Wu, Inder Monga, Chin
  Guok, Frank W\""urthwein, Diego Davila, Edgar Fajardo",Analyzing scientific data sharing patterns for in-network data caching,,,10.1145/3452411.3464441,,cs.NI cs.DC,http://creativecommons.org/licenses/by/4.0/,"  The volume of data moving through a network increases with new scientific
experiments and simulations. Network bandwidth requirements also increase
proportionally to deliver data within a certain time frame. We observe that a
significant portion of the popular dataset is transferred multiple times to
different users as well as to the same user for various reasons. In-network
data caching for the shared data has shown to reduce the redundant data
transfers and consequently save network traffic volume. In addition, overall
application performance is expected to improve with in-network caching because
access to the locally cached data results in lower latency. This paper shows
how much data was shared over the study period, how much network traffic volume
was consequently saved, and how much the temporary in-network caching increased
the scientific application performance. It also analyzes data access patterns
in applications and the impacts of caching nodes on the regional data
repository. From the results, we observed that the network bandwidth demand was
reduced by nearly a factor of 3 over the study period.
","[{'version': 'v1', 'created': 'Mon, 3 May 2021 16:01:18 GMT'}]",2021-10-26,"[['Copps', 'Elizabeth', ''], ['Zhang', 'Huiyi', ''], ['Sim', 'Alex', ''], ['Wu', 'Kesheng', ''], ['Monga', 'Inder', ''], ['Guok', 'Chin', ''], ['Würthwein', 'Frank', ''], ['Davila', 'Diego', ''], ['Fajardo', 'Edgar', '']]","['network cache', 'network storage', 'network performance', 'contentdelivery network', 'xcache']"
12416,2010.16305,John Wrenn,"John Wrenn, Tim Nelson, Shriram Krishnamurthi",Using Relational Problems to Teach Property-Based Testing,,"The Art, Science, and Engineering of Programming, 2021, Vol. 5,
  Issue 2, Article 9",10.22152/programming-journal.org/2021/5/9,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: The success of QuickCheck has led to the development of
property-based testing (PBT) libraries for many languages and the process is
getting increasing attention. However, unlike regular testing, PBT is not
widespread in collegiate curricula. Furthermore, the value of PBT is not
limited to software testing. The growing use of formal methods in, and the
growth of software synthesis, all create demand for techniques to train
students and developers in the art of specification writing. We posit that PBT
forms a strong bridge between testing and the act of specification: it's a form
of testing where the tester is actually writing abstract specifications.
  Inquiry: Even well-informed technologists mention the difficulty of finding
good motivating examples for its use. We take steps to fill this lacuna.
  Approach & Knowledge: We find that the use of ""relational"" problems -- those
for which an input may admit multiple valid outputs -- easily motivates the use
of PBT. We also notice that such problems are readily available in the computer
science pantheon of problems (e.g., many graph and sorting algorithms). We have
been using these for some years now to teach PBT in collegiate courses.
  Grounding: In this paper, we describe the problems we use and report on
students? completion of them. We believe the problems overcome some of the
motivation issues described above. We also show that students can do quite well
at PBT for these problems, suggesting that the topic is well within their
reach. In the process, we introduce a simple method to evaluate the accuracy of
their specifications, and use it to characterize their common mistakes.
  Importance: Based on our findings, we believe that relational problems are an
underutilized motivating example for PBT. We hope this paper initiates a
catalog of such problems for educators (and developers) to use, and also
provides a concrete (though by no means exclusive) method to analyze the
quality of PBT.
","[{'version': 'v1', 'created': 'Fri, 30 Oct 2020 14:54:01 GMT'}]",2020-11-02,"[['Wrenn', 'John', ''], ['Nelson', 'Tim', ''], ['Krishnamurthi', 'Shriram', '']]","['Property-Based Testing', 'Test Oracles', 'Education', 'Specification']"
12417,2209.01105,Lei Kou,"Lei Kou, Zhe Huang, Cuimei Jiang, Fangfang Zhang, Wende Ke, Junhe Wan,
  Hailin Liu, Hui Li","Data Encryption based on 7D Complex Chaotic System with Cubic Memristor
  for Smart Grid",Accepted by Frontiers in Energy Research,,10.3389/fenrg.2022.980863,,cs.CR cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The information security has an irreplaceable position in the smart grid
(SG). In order to avoid the malicious attack and ensure the information
security, the cryptographic techniques are essential. This paper focuses on the
encryption techniques to ensure the information security of SG. Firstly, an
unusual 7-dimensional complex chaotic system (7D-CCS) combined with the cubic
memristor is introduced. Besides its phase portraits, Lyapunov exponent, 0-1
test, complexity, and bifurcation diagram are investigated. Then, with the
proposed 7D-CCS, we design a data encryption algorithm to ensure the encryption
security. Finally, the data and monitoring images in SG are encrypted by the
designed encryption scheme. Besides, the encryption performance is given in
detailed. The experimental results show that the proposed encryption scheme has
quite good encryption performance. Therefore, it can ensure the information
security of SG.
","[{'version': 'v1', 'created': 'Fri, 2 Sep 2022 15:11:58 GMT'}]",2022-09-05,"[['Kou', 'Lei', ''], ['Huang', 'Zhe', ''], ['Jiang', 'Cuimei', ''], ['Zhang', 'Fangfang', ''], ['Ke', 'Wende', ''], ['Wan', 'Junhe', ''], ['Liu', 'Hailin', ''], ['Li', 'Hui', '']]","['Smart Grid', 'Chaotic System', 'Data Encryption', 'Memristor', 'Information Security  1 INTRODUCTION']"
12418,2002.00899,Francesco Ragusa,"Francesco Ragusa, Antonino Furnari, Sebastiano Battiato, Giovanni
  Signorello, Giovanni Maria Farinella","EGO-CH: Dataset and Fundamental Tasks for Visitors
  BehavioralUnderstanding using Egocentric Vision",,Pattern Recognition Letters 2020,10.1016/j.patrec.2019.12.016,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Equipping visitors of a cultural site with a wearable device allows to easily
collect information about their preferences which can be exploited to improve
the fruition of cultural goods with augmented reality. Moreover, egocentric
video can be processed using computer vision and machine learning to enable an
automated analysis of visitors' behavior. The inferred information can be used
both online to assist the visitor and offline to support the manager of the
site. Despite the positive impact such technologies can have in cultural
heritage, the topic is currently understudied due to the limited number of
public datasets suitable to study the considered problems. To address this
issue, in this paper we propose EGOcentric-Cultural Heritage (EGO-CH), the
first dataset of egocentric videos for visitors' behavior understanding in
cultural sites. The dataset has been collected in two cultural sites and
includes more than $27$ hours of video acquired by $70$ subjects, with labels
for $26$ environments and over $200$ different Points of Interest. A large
subset of the dataset, consisting of $60$ videos, is associated with surveys
filled out by real visitors. To encourage research on the topic, we propose $4$
challenging tasks (room-based localization, point of interest/object
recognition, object retrieval and survey prediction) useful to understand
visitors' behavior and report baseline results on the dataset.
","[{'version': 'v1', 'created': 'Mon, 3 Feb 2020 17:25:23 GMT'}]",2020-02-04,"[['Ragusa', 'Francesco', ''], ['Furnari', 'Antonino', ''], ['Battiato', 'Sebastiano', ''], ['Signorello', 'Giovanni', ''], ['Farinella', 'Giovanni Maria', '']]","['Egocentric Vision', 'First Person Vision', 'Localization', 'Object Detection', 'Object Retrieval']"
12419,2006.12330,Utkan Gezer,M. Utkan Gezer and A. C. Cem Say,"Constant-Space, Constant-Randomness Verifiers with Arbitrarily Small
  Error",,,10.1016/j.ic.2021.104744,,cs.CC cs.FL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We study the capabilities of probabilistic finite-state machines that act as
verifiers for certificates of language membership for input strings, in the
regime where the verifiers are restricted to toss some fixed nonzero number of
coins regardless of the input size. Say and Yakary{\i}lmaz showed that the
class of languages that could be verified by these machines within an error
bound strictly less than $1/2$ is precisely NL, but their construction yields
verifiers with error bounds that are very close to $1/2$ for most languages in
that class when the definition of ""error"" is strengthened to include looping
forever without giving a response. We characterize a subset of NL for which
verification with arbitrarily low error is possible by these extremely weak
machines. It turns out that, for any $\varepsilon>0$, one can construct a
constant-coin, constant-space verifier operating within error $\varepsilon$ for
every language that is recognizable by a linear-time multi-head
nondeterministic finite automaton (2nfa($k$)). We discuss why it is difficult
to generalize this method to all of NL, and give a reasonably tight way to
relate the power of linear-time 2nfa($k$)'s to simultaneous time-space
complexity classes defined in terms of Turing machines.
","[{'version': 'v1', 'created': 'Mon, 22 Jun 2020 15:16:42 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Mar 2021 13:15:54 GMT'}]",2021-03-30,"[['Gezer', 'M. Utkan', ''], ['Say', 'A. C. Cem', '']]","['Interactive Proof Systems', 'Multi-head finite automata', 'Probabilistic finite automata']"
12420,2009.09786,Marc Carrascosa-Zamacois,"Marc Carrascosa, Boris Bellalta",Cloud-gaming:Analysis of Google Stadia traffic,,"Carrascosa, Marc, and Boris Bellalta. ""Cloud-gaming: Analysis of
  google stadia traffic."" Computer Communications 188 (2022): 99-116",10.1016/j.comcom.2022.03.006,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interactive, real-time, and high-quality cloud video games pose a serious
challenge to the Internet due to simultaneous high-throughput and low round
trip delay requirements. In this paper, we investigate the traffic
characteristics of Stadia, the cloud-gaming solution from Google, which is
likely to become one of the dominant players in the gaming sector. To do that,
we design several experiments, and perform an extensive traffic measurement
campaign to obtain all required data. Our first goal is to gather a deep
understanding of Stadia traffic characteristics by identifying the different
protocols involved for both signalling and video/audio contents, the traffic
generation patterns, and the packet size and inter-packet time probability
distributions. Then, our second goal is to understand how different Stadia
games and configurations, such as the video codec and the video resolution
selected, impact on the characteristics of the generated traffic. We also
evaluate the ability of Stadia to adapt to different link capacity conditions,
including cases where the capacity drops suddenly, as well as sudden increases
in the network latency. Our results and findings, besides illustrating the
characteristics of Stadia traffic, are also valuable for planning and
dimensioning future networks, as well as for designing new resource management
strategies. Finally, we compare Stadia traffic to other video streaming
applications, showcasing the main differences between them, and introduce a
traffic model using our captures. We show that this model can be used in
simulations to further investigate the network performance in presence of
Stadia traffic.
","[{'version': 'v1', 'created': 'Mon, 21 Sep 2020 12:06:53 GMT'}, {'version': 'v2', 'created': 'Mon, 23 May 2022 11:17:13 GMT'}]",2022-05-24,"[['Carrascosa', 'Marc', ''], ['Bellalta', 'Boris', '']]","['Cloud-gaming', 'Google Stadia', 'Traffic Measurements', 'Analysis']"
12421,2202.02679,Leon Moonen,David Binkley and Leon Moonen and Sibren Isaacman,Featherweight Assisted Vulnerability Discovery,"17 pages, 6 figures, 6 tables","Information and Software Technology, 2022",10.1016/j.infsof.2022.106844,,cs.CR cs.LG cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Predicting vulnerable source code helps to focus attention on those parts of
the code that need to be examined with more scrutiny. Recent work proposed the
use of function names as semantic cues that can be learned by a deep neural
network (DNN) to aid in the hunt for vulnerability of functions.
  Combining identifier splitting, which splits each function name into its
constituent words, with a novel frequency-based algorithm, we explore the
extent to which the words that make up a function's name can predict
potentially vulnerable functions. In contrast to *lightweight* predictions by a
DNN that considers only function names, avoiding the use of a DNN provides
*featherweight* predictions. The underlying idea is that function names that
contain certain ""dangerous"" words are more likely to accompany vulnerable
functions. Of course, this assumes that the frequency-based algorithm can be
properly tuned to focus on truly dangerous words.
  Because it is more transparent than a DNN, the frequency-based algorithm
enables us to investigate the inner workings of the DNN. If successful, this
investigation into what the DNN does and does not learn will help us train more
effective future models.
  We empirically evaluate our approach on a heterogeneous dataset containing
over 73000 functions labeled vulnerable, and over 950000 functions labeled
benign. Our analysis shows that words alone account for a significant portion
of the DNN's classification ability. We also find that words are of greatest
value in the datasets with a more homogeneous vocabulary. Thus, when working
within the scope of a given project, where the vocabulary is unavoidably
homogeneous, our approach provides a cheaper, potentially complementary,
technique to aid in the hunt for source-code vulnerabilities. Finally, this
approach has the advantage that it is viable with orders of magnitude less
training data.
","[{'version': 'v1', 'created': 'Sun, 6 Feb 2022 01:58:49 GMT'}]",2022-02-08,"[['Binkley', 'David', ''], ['Moonen', 'Leon', ''], ['Isaacman', 'Sibren', '']]","['model interpretability', 'vulnerability prediction', 'identifier splitting', 'source code vocabulary', 'software security']"
12422,2205.06807,Fabricio Olivetti de Franca,Fabricio Olivetti de Franca,"Transformation-Interaction-Rational Representation for Symbolic
  Regression","Accepted at the Genetic and Evolutionary Computation Conference 2022
  (GECCO'22) Genetic Programming Track - Full paper",,10.1145/3512290.3528695,,cs.NE cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Symbolic Regression searches for a function form that approximates a dataset
often using Genetic Programming.
  Since there is usually no restriction to what form the function can have,
Genetic Programming may return a hard to understand model due to non-linear
function chaining or long expressions. A novel representation called
Interaction-Transformation was recently proposed to alleviate this problem. In
this representation, the function form is restricted to an affine combination
of terms generated as the application of a single univariate function to the
interaction of selected variables. This representation obtained competing
solutions on standard benchmarks. Despite the initial success, a broader set of
benchmarking functions revealed the limitations of the constrained
representation.
  In this paper we propose an extension to this representation, called
Transformation-Interaction-Rational representation that defines a new function
form as the rational of two Interaction-Transformation functions. Additionally,
the target variable can also be transformed with an univariate function. The
main goal is to improve the approximation power while still constraining the
overall complexity of the expression.
  We tested this representation with a standard Genetic Programming with
crossover and mutation. The results show a great improvement when compared to
its predecessor and a state-of-the-art performance for a large benchmark.
","[{'version': 'v1', 'created': 'Mon, 25 Apr 2022 16:53:43 GMT'}]",2022-05-16,"[['de Franca', 'Fabricio Olivetti', '']]","['symbolic regression', 'regression', 'genetic programming']"
12423,2111.01976,Damiano Perri,"Damiano Perri, Marco Simonetti, Andrea Lombardi, Noelia Faginas-Lago,
  Osvaldo Gervasi",A new method for binary classification of proteins with Machine Learning,"International Conference on Computational Science and Its
  Applications, ICCSA 2021","LNCS, volume 12958, 2020",10.1007/978-3-030-87016-4_29,,cs.LG q-bio.BM,http://creativecommons.org/licenses/by/4.0/,"  In this work we set out to find a method to classify protein structures using
a Deep Learning methodology. Our Artificial Intelligence has been trained to
recognize complex biomolecule structures extrapolated from the Protein Data
Bank (PDB) database and reprocessed as images; for this purpose various tests
have been conducted with pre-trained Convolutional Neural Networks, such as
InceptionResNetV2 or InceptionV3, in order to extract significant features from
these images and correctly classify the molecule. A comparative analysis of the
performances of the various networks will therefore be produced.
","[{'version': 'v1', 'created': 'Wed, 3 Nov 2021 01:58:34 GMT'}]",2021-11-04,"[['Perri', 'Damiano', ''], ['Simonetti', 'Marco', ''], ['Lombardi', 'Andrea', ''], ['Faginas-Lago', 'Noelia', ''], ['Gervasi', 'Osvaldo', '']]","['Machine Learning', 'Computational Chemistry', 'Protein Data Bank', 'Convolutional Neural Network', 'Image Processing', 'Orthogonal Axonometry']"
12424,1712.06180,Per-Arne Andersen,"Per-Arne Andersen, Morten Goodwin, Ole-Christoffer Granmo",Towards a Deep Reinforcement Learning Approach for Tower Line Wars,"Proceedings of the 37th SGAI International Conference on Artificial
  Intelligence, Cambridge, UK, 2017, Artificial Intelligence XXXIV, 2017",,10.1007/978-3-319-71078-5,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There have been numerous breakthroughs with reinforcement learning in the
recent years, perhaps most notably on Deep Reinforcement Learning successfully
playing and winning relatively advanced computer games. There is undoubtedly an
anticipation that Deep Reinforcement Learning will play a major role when the
first AI masters the complicated game plays needed to beat a professional
Real-Time Strategy game player. For this to be possible, there needs to be a
game environment that targets and fosters AI research, and specifically Deep
Reinforcement Learning. Some game environments already exist, however, these
are either overly simplistic such as Atari 2600 or complex such as Starcraft II
from Blizzard Entertainment. We propose a game environment in between Atari
2600 and Starcraft II, particularly targeting Deep Reinforcement Learning
algorithm research. The environment is a variant of Tower Line Wars from
Warcraft III, Blizzard Entertainment. Further, as a proof of concept that the
environment can harbor Deep Reinforcement algorithms, we propose and apply a
Deep Q-Reinforcement architecture. The architecture simplifies the state space
so that it is applicable to Q-learning, and in turn improves performance
compared to current state-of-the-art methods. Our experiments show that the
proposed architecture can learn to play the environment well, and score 33%
better than standard Deep Q-learning which in turn proves the usefulness of the
game environment.
","[{'version': 'v1', 'created': 'Sun, 17 Dec 2017 21:29:45 GMT'}]",2017-12-19,"[['Andersen', 'Per-Arne', ''], ['Goodwin', 'Morten', ''], ['Granmo', 'Ole-Christoffer', '']]","['Reinforcement Learning', 'Q-Learning', 'Deep Learning', 'GameEnvironment']"
12425,2202.13092,Shaher Ahmed,"Shaher Ahmed, Mohamed Shekha, Suhaila Skran and Abdelrahman Bassyouny","Investigation of Optimization Techniques on the Elevator Dispatching
  Problem",13 PAGES,,10.5121/csit.2022.120305,,cs.NE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In the elevator industry, reducing passenger journey time in an elevator
system is a major aim. The key obstacle to optimising elevator dispatching is
the unpredictable traffic flow of passengers. To address this difficulty, two
main features must be optimised: waiting time and journey time. To address the
problem in real time, several strategies are employed, including Simulated
Annealing (SA), Genetic Algorithm (GA), Particle Swarm Optimization Algorithm
(PSO), and Whale Optimization Algorithm (WOA). This research article compares
the algorithms discussed above. To investigate the functioning of the
algorithms for visualisation and insight, a case study was created. In order to
discover the optimum algorithm for the elevator dispatching problem,
performance indices such as average and ideal fitness value are generated in 5
runs to compare the outcomes of the methods. The goal of this study is to
compute a dispatching scheme, which is the result of the algorithms, in order
to lower the average trip time for all passengers. This study builds on
previous studies that recommended ways to reduce waiting time. The proposed
technique reduces average wait time, improves lift efficiency, and improves
customer experience.
","[{'version': 'v1', 'created': 'Sat, 26 Feb 2022 08:26:07 GMT'}]",2022-03-01,"[['Ahmed', 'Shaher', ''], ['Shekha', 'Mohamed', ''], ['Skran', 'Suhaila', ''], ['Bassyouny', 'Abdelrahman', '']]","['Stochastic Optimization', 'Elevator Dispatching Systems', 'Meta-Heuristics Optimization Techniques']"
12426,2202.09679,Elliot Meyerson,"Elliot Meyerson, Xin Qiu and Risto Miikkulainen","Simple Genetic Operators are Universal Approximators of Probability
  Distributions (and other Advantages of Expressive Encodings)","Received a best paper award at GECCO 2022; 10 pages, with 5 page
  appendix",,10.1145/3512290.3528746,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper characterizes the inherent power of evolutionary algorithms. This
power depends on the computational properties of the genetic encoding. With
some encodings, two parents recombined with a simple crossover operator can
sample from an arbitrary distribution of child phenotypes. Such encodings are
termed \emph{expressive encodings} in this paper. Universal function
approximators, including popular evolutionary substrates of genetic programming
and neural networks, can be used to construct expressive encodings. Remarkably,
this approach need not be applied only to domains where the phenotype is a
function: Expressivity can be achieved even when optimizing static structures,
such as binary vectors. Such simpler settings make it possible to characterize
expressive encodings theoretically: Across a variety of test problems,
expressive encodings are shown to achieve up to super-exponential convergence
speed-ups over the standard direct encoding. The conclusion is that, across
evolutionary computation areas as diverse as genetic programming,
neuroevolution, genetic algorithms, and theory, expressive encodings can be a
key to understanding and realizing the full power of evolution.
","[{'version': 'v1', 'created': 'Sat, 19 Feb 2022 20:54:37 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Apr 2022 18:59:45 GMT'}, {'version': 'v3', 'created': 'Tue, 5 Jul 2022 22:41:20 GMT'}, {'version': 'v4', 'created': 'Tue, 2 Aug 2022 21:56:51 GMT'}]",2022-08-04,"[['Meyerson', 'Elliot', ''], ['Qiu', 'Xin', ''], ['Miikkulainen', 'Risto', '']]","['genetic algorithms', 'universal approximation', 'expressive encodings']"
12427,2102.01009,Craig Poulin,"Craig Poulin, Michael Kane","Infrastructure Resilience Curves: Performance Measures and Summary
  Metrics","32 pages, 4 figures. Submitted to Reliability Engineering & System
  Safety","Reliability Engineering & System Safety, Volume 216, December
  2021, 107926",10.1016/j.ress.2021.107926,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Resilience curves are used to communicate quantitative and qualitative
aspects of system behavior and resilience to stakeholders of critical
infrastructure. Generally, these curves illustrate the evolution of system
performance before, during, and after a disruption. As simple as these curves
may appear, the literature contains underexplored nuance when defining
""performance"" and comparing curves with summary metrics. Through a critical
review of 273 publications, this manuscript aims to define a common vocabulary
for practitioners and researchers that will improve the use of resilience
curves as a tool for assessing and designing resilient infrastructure. This
vocabulary includes a taxonomy of resilience curve performance measures as well
as a taxonomy of summary metrics. In addition, this review synthesizes a
framework for examining assumptions of resilience analysis that are often
implicit or unexamined in the practice and literature. From this vocabulary and
framework comes recommendations including broader adoption of productivity
measures; additional research on endogenous performance targets and thresholds;
deliberate consideration of curve milestones when defining summary metrics; and
cautionary fundamental flaws that may arise when condensing an ensemble of
resilience curves into an ""expected"" trajectory.
","[{'version': 'v1', 'created': 'Fri, 29 Jan 2021 14:10:27 GMT'}, {'version': 'v2', 'created': 'Sat, 16 Oct 2021 13:10:20 GMT'}]",2021-10-19,"[['Poulin', 'Craig', ''], ['Kane', 'Michael', '']]","['Resilience', 'critical infrastructure', 'metrics', 'performance measures', 'system analysis']"
12428,2203.07075,Yang Li,"Jia Cui, Yonghui Jin, Renzhe Yu, Martin Onyeka Okoye, Yang Li, Junyou
  Yang, Shunjiang Wang","A Robust Approach for the Decomposition of High-Energy-Consuming
  Industrial Loads with Deep Learning",Accepted by Journal of Cleaner Production,Journal of Cleaner Production 349 (2022) 131208,10.1016/j.jclepro.2022.131208,,cs.LG cs.SY eess.SP eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The knowledge of the users' electricity consumption pattern is an important
coordinating mechanism between the utility company and the electricity
consumers in terms of key decision makings. The load decomposition is therefore
crucial to reveal the underlying relationship between the load consumption and
its characteristics. However, load decomposition is conventionally performed on
the residential and commercial loads, and adequate consideration has not been
given to the high-energy-consuming industrial loads leading to inefficient
results. This paper thus focuses on the load decomposition of the industrial
park loads (IPL). The commonly used parameters in a conventional method are
however inapplicable in high-energy-consuming industrial loads. Therefore, a
more robust approach is developed comprising a three-algorithm model to achieve
this goal on the IPL. First, the improved variational mode decomposition (IVMD)
algorithm is introduced to denoise the training data of the IPL and improve its
stability. Secondly, the convolutional neural network (CNN) and simple
recurrent units (SRU) joint algorithms are used to achieve a non-intrusive and
non-invasive decomposition process of the IPL using a double-layer deep
learning network based on the IPL characteristics. Specifically, CNN is used to
extract the IPL data characteristics while the improved long and short-term
memory (LSTM) network, SRU, is adopted to develop the decomposition model and
further train the load data. Through the robust decomposition process, the
underlying relationship in the load consumption is extracted. The results
obtained from the numerical examples show that this approach outperforms the
state-of-the-art in the conventional decomposition process.
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2022 07:11:52 GMT'}]",2022-03-30,"[['Cui', 'Jia', ''], ['Jin', 'Yonghui', ''], ['Yu', 'Renzhe', ''], ['Okoye', 'Martin Onyeka', ''], ['Li', 'Yang', ''], ['Yang', 'Junyou', ''], ['Wang', 'Shunjiang', '']]","['smart grid', 'load awareness', 'non-intrusive load decomposition', 'deep learning']"
12429,2004.03976,Alireza Kavousi,"Alireza Kavousi, Javad Mohajeri, Mahmoud Salmasizadeh",Improved Secure Efficient Delegated Private Set Intersection,"6 pages, presented in proceedings of the 28th Iranian Conference on
  Electrical Engineering (ICEE 2020). Final version of the paper has been added",,10.1109/ICEE50131.2020.9260663,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Private Set Intersection (PSI) is a vital cryptographic technique used for
securely computing common data of different sets. In PSI protocols, often two
parties hope to find their common set elements without needing to disclose
their uncommon ones. In recent years, the cloud has been playing an influential
role in PSI protocols which often need huge computational tasks. In 2017, Abadi
et al. introduced a scheme named EO-PSI which uses a cloud to pass on the main
computations to it and does not include any public-key operations. In EO-PSI,
parties need to set up secure channels beforehand; otherwise, an attacker can
easily eavesdrop on communications between honest parties and find private
information. This paper presents an improved EO-PSI scheme which has the edge
on the previous scheme in terms of privacy and complexity. By providing
possible attacks on the prior scheme, we show the necessity of using secure
channels between parties. Also, our proposed protocol is secure against passive
attacks without having to have any secure channels. We measure the protocol's
overhead and show that computational complexity is considerably reduced and
also is fairer compared to the previous scheme.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2020 12:39:48 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Apr 2020 13:05:24 GMT'}, {'version': 'v3', 'created': 'Wed, 13 May 2020 21:23:09 GMT'}, {'version': 'v4', 'created': 'Tue, 24 Nov 2020 17:12:38 GMT'}, {'version': 'v5', 'created': 'Thu, 28 Jan 2021 20:12:42 GMT'}]",2021-02-01,"[['Kavousi', 'Alireza', ''], ['Mohajeri', 'Javad', ''], ['Salmasizadeh', 'Mahmoud', '']]","['private set intersection', 'data outsourcing', 'privacy']"
12430,1906.01600,Georgios Leontidis,"George Onoufriou, Ronald Bickerton, Simon Pearson, Georgios Leontidis","Nemesyst: A Hybrid Parallelism Deep Learning-Based Framework Applied for
  Internet of Things Enabled Food Retailing Refrigeration Systems","25 pages, 13 figures, 4 tables, 2 appendices","Computers in Industry, 2019",10.1016/j.compind.2019.103133,,cs.LG cs.DC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep Learning has attracted considerable attention across multiple
application domains, including computer vision, signal processing and natural
language processing. Although quite a few single node deep learning frameworks
exist, such as tensorflow, pytorch and keras, we still lack a complete
processing structure that can accommodate large scale data processing, version
control, and deployment, all while staying agnostic of any specific single node
framework. To bridge this gap, this paper proposes a new, higher level
framework, i.e. Nemesyst, which uses databases along with model
sequentialisation to allow processes to be fed unique and transformed data at
the point of need. This facilitates near real-time application and makes models
available for further training or use at any node that has access to the
database simultaneously. Nemesyst is well suited as an application framework
for internet of things aggregated control systems, deploying deep learning
techniques to optimise individual machines in massive networks. To demonstrate
this framework, we adopted a case study in a novel domain; deploying deep
learning to optimise the high speed control of electrical power consumed by a
massive internet of things network of retail refrigeration systems in
proportion to load available on the UK National Grid (a demand side response).
The case study demonstrated for the first time in such a setting how deep
learning models, such as Recurrent Neural Networks (vanilla and Long-Short-Term
Memory) and Generative Adversarial Networks paired with Nemesyst, achieve
compelling performance, whilst still being malleable to future adjustments as
both the data and requirements inevitably change over time.
","[{'version': 'v1', 'created': 'Tue, 4 Jun 2019 17:23:09 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Sep 2019 22:55:00 GMT'}]",2019-11-22,"[['Onoufriou', 'George', ''], ['Bickerton', 'Ronald', ''], ['Pearson', 'Simon', ''], ['Leontidis', 'Georgios', '']]","['Deep Learning', 'Databases', 'Distributed Computing', 'Parallel Computing', 'Demand SideResponse', 'Refrigeration', 'Internet of Things']"
12431,2009.05236,Yuke Wang,"Yuke Wang, Boyuan Feng, Xueqiao Peng, Yufei Ding","An Efficient Quantitative Approach for Optimizing Convolutional Neural
  Networks",,,10.1145/3459637.3482230,,cs.CV cs.LG eess.IV,http://creativecommons.org/licenses/by/4.0/,"  With the increasing popularity of deep learning, Convolutional Neural
Networks (CNNs) have been widely applied in various domains, such as image
classification and object detection, and achieve stunning success in terms of
their high accuracy over the traditional statistical methods. To exploit the
potential of CNN models, a huge amount of research and industry efforts have
been devoted to optimizing CNNs. Among these endeavors, CNN architecture design
has attracted tremendous attention because of its great potential of improving
model accuracy or reducing model complexity. However, existing work either
introduces repeated training overhead in the search process or lacks an
interpretable metric to guide the design. To clear these hurdles, we propose
3D-Receptive Field (3DRF), an explainable and easy-to-compute metric, to
estimate the quality of a CNN architecture and guide the search process of
designs. To validate the effectiveness of 3DRF, we build a static optimizer to
improve the CNN architectures at both the stage level and the kernel level. Our
optimizer not only provides a clear and reproducible procedure but also
mitigates unnecessary training efforts in the architecture search process.
Extensive experiments and studies show that the models generated by our
optimizer can achieve up to 5.47% accuracy improvement and up to 65.38%
parameters deduction, compared with state-of-the-art CNN structures like
MobileNet and ResNet.
","[{'version': 'v1', 'created': 'Fri, 11 Sep 2020 05:14:34 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Aug 2021 16:24:40 GMT'}, {'version': 'v3', 'created': 'Thu, 2 Sep 2021 18:02:45 GMT'}, {'version': 'v4', 'created': 'Wed, 15 Sep 2021 16:59:45 GMT'}]",2021-09-16,"[['Wang', 'Yuke', ''], ['Feng', 'Boyuan', ''], ['Peng', 'Xueqiao', ''], ['Ding', 'Yufei', '']]","['Deep Learning', 'Neural Network Optimization', 'Image Classification']"
12432,1910.07223,Jessica Diaz,"Jessica D\'iaz, Jorge E. Perez, Agust\'in Yague, Andrea Villegas,
  Antonio de Antona","DevOps in Practice -- A preliminary Analysis of two Multinational
  Companies","8 pages, 1 figure, 2 tables, conference",,10.1007/978-3-030-35333-9_23,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  DevOps is a cultural movement that aims the collaboration of all the
stakeholders involved in the development, deployment and operation of soft-ware
to deliver a quality product or service in the shortest possible time. DevOps
is relatively recent, and companies have developed their DevOps prac-tices
largely from scratch. Our research aims to conduct an analysis on practic-ing
DevOps in +20 software-intensive companies to provide patterns of DevOps
practices and identify their benefits and barriers. This paper presents the
preliminary analysis of an exploratory case study based on the interviews to
relevant stakeholders of two (multinational) companies. The results show the
benefits (software delivery performance) and barriers that these companies are
dealing with, as well as DevOps team topology they approached during their
DevOps transformation. This study aims to help practitioners and researchers to
better understand DevOps transformations and the contexts where the practices
worked. This, hopefully, will contribute to strengthening the evidence
regarding DevOps and supporting practitioners in making better informed
decisions about the return of investment when adopting DevOps.
","[{'version': 'v1', 'created': 'Wed, 16 Oct 2019 09:07:22 GMT'}]",2020-05-20,"[['Díaz', 'Jessica', ''], ['Perez', 'Jorge E.', ''], ['Yague', 'Agustín', ''], ['Villegas', 'Andrea', ''], ['de Antona', 'Antonio', '']]","['DevOps', 'Empirical Software Engineering', 'exploratory case study']"
12433,2207.09855,Rishubh Parihar,"Rishubh Parihar, Ankit Dhiman, Tejan Karmali and R. Venkatesh Babu","Everything is There in Latent Space: Attribute Editing and Attribute
  Style Manipulation by StyleGAN Latent Space Exploration",Project page: https://sites.google.com/view/flamelatentediting,,10.1145/3503161.3547972,,cs.CV cs.AI,http://creativecommons.org/publicdomain/zero/1.0/,"  Unconstrained Image generation with high realism is now possible using recent
Generative Adversarial Networks (GANs). However, it is quite challenging to
generate images with a given set of attributes. Recent methods use style-based
GAN models to perform image editing by leveraging the semantic hierarchy
present in the layers of the generator. We present Few-shot Latent-based
Attribute Manipulation and Editing (FLAME), a simple yet effective framework to
perform highly controlled image editing by latent space manipulation.
Specifically, we estimate linear directions in the latent space (of a
pre-trained StyleGAN) that controls semantic attributes in the generated image.
In contrast to previous methods that either rely on large-scale attribute
labeled datasets or attribute classifiers, FLAME uses minimal supervision of a
few curated image pairs to estimate disentangled edit directions. FLAME can
perform both individual and sequential edits with high precision on a diverse
set of images while preserving identity. Further, we propose a novel task of
Attribute Style Manipulation to generate diverse styles for attributes such as
eyeglass and hair. We first encode a set of synthetic images of the same
identity but having different attribute styles in the latent space to estimate
an attribute style manifold. Sampling a new latent from this manifold will
result in a new attribute style in the generated image. We propose a novel
sampling method to sample latent from the manifold, enabling us to generate a
diverse set of attribute styles beyond the styles present in the training set.
FLAME can generate diverse attribute styles in a disentangled manner. We
illustrate the superior performance of FLAME against previous image editing
methods by extensive qualitative and quantitative comparisons. FLAME also
generalizes well on multiple datasets such as cars and churches.
","[{'version': 'v1', 'created': 'Wed, 20 Jul 2022 12:40:32 GMT'}]",2022-07-21,"[['Parihar', 'Rishubh', ''], ['Dhiman', 'Ankit', ''], ['Karmali', 'Tejan', ''], ['Babu', 'R. Venkatesh', '']]","['GANs', 'Image-Editing', 'Latent space', 'Image Manipulation']"
12434,2110.03728,Luiz Capretz Dr.,"Ammar K Alazzawi, Helmi Md Rais, Shuib Basri, Yazan A Alsariera, Luiz
  Fernando Capretz, Abdullateef Oluwagbemiga Balogun, Abdullahi Abubakar Imam","HABCSm: A Hamming Based t-way Strategy Based on Hybrid Artificial Bee
  Colony for Variable Strength Test Sets Generation",18 pages,"International Journal of Computer Communications & Control,
  16(5):1-18, #4308, October 2021",10.15837/ijccc.2021.5.4308,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Search-based software engineering that involves the deployment of
meta-heuristics in applicable software processes has been gaining wide
attention. Recently, researchers have been advocating the adoption of
meta-heuristic algorithms for t-way testing strategies (where t points the
interaction strength among parameters). Although helpful, no single
meta-heuristic based t-way strategy can claim dominance over its counterparts.
For this reason, the hybridization of meta-heuristic algorithms can help to
ascertain the search capabilities of each by compensating for the limitations
of one algorithm with the strength of others. Consequently, a new
meta-heuristic based t-way strategy called Hybrid Artificial Bee Colony
(HABCSm) strategy, based on merging the advantages of the Artificial Bee Colony
(ABC) algorithm with the advantages of a Particle Swarm Optimization (PSO)
algorithm is proposed in this paper. HABCSm is the first t-way strategy to
adopt Hybrid Artificial Bee Colony (HABC) algorithm with Hamming distance as
its core method for generating a final test set and the first to adopt the
Hamming distance as the final selection criterion for enhancing the exploration
of new solutions. The experimental results demonstrate that HABCSm provides
superior competitive performance over its counterparts. Therefore, this finding
contributes to the field of software testing by minimizing the number of test
cases required for test execution.
","[{'version': 'v1', 'created': 'Thu, 7 Oct 2021 18:28:42 GMT'}]",2021-10-11,"[['Alazzawi', 'Ammar K', ''], ['Rais', 'Helmi Md', ''], ['Basri', 'Shuib', ''], ['Alsariera', 'Yazan A', ''], ['Capretz', 'Luiz Fernando', ''], ['Balogun', 'Abdullateef Oluwagbemiga', ''], ['Imam', 'Abdullahi Abubakar', '']]","['Software testing', 'Combinatorial testing', 't-way testing', 'Variable strength interaction', 'an optimization problem', 'Hybrid artificial bee colony algorithm']"
12435,1704.06065,Bob De Vos,"Bob D. de Vos, Floris F. Berendsen, Max A. Viergever, Marius Staring,
  Ivana I\v{s}gum","End-to-End Unsupervised Deformable Image Registration with a
  Convolutional Neural Network",,DLMIA/ML-CDS@MICCAI 2017,10.1007/978-3-319-67558-9_24,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we propose a deep learning network for deformable image
registration (DIRNet). The DIRNet consists of a convolutional neural network
(ConvNet) regressor, a spatial transformer, and a resampler. The ConvNet
analyzes a pair of fixed and moving images and outputs parameters for the
spatial transformer, which generates the displacement vector field that enables
the resampler to warp the moving image to the fixed image. The DIRNet is
trained end-to-end by unsupervised optimization of a similarity metric between
input image pairs. A trained DIRNet can be applied to perform registration on
unseen image pairs in one pass, thus non-iteratively. Evaluation was performed
with registration of images of handwritten digits (MNIST) and cardiac cine MR
scans (Sunnybrook Cardiac Data). The results demonstrate that registration with
DIRNet is as accurate as a conventional deformable image registration method
with substantially shorter execution times.
","[{'version': 'v1', 'created': 'Thu, 20 Apr 2017 09:40:50 GMT'}]",2017-12-08,"[['de Vos', 'Bob D.', ''], ['Berendsen', 'Floris F.', ''], ['Viergever', 'Max A.', ''], ['Staring', 'Marius', ''], ['Išgum', 'Ivana', '']]","['convolution neural network', 'deformable image registration', 'spatial transformer', 'cardiac MRI']"
12436,2010.01575,Joseph A. Paradiso,"Joseph A. Paradiso, Kai-yuh Hsiao, and Ari Benbasat",Tangible Music Interfaces Using Passive Magnetic Tags,"Proceedings of the International Conference on New Interfaces for
  Musical Expression, 2001",,10.5281/zenodo.1176374,,cs.HC cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  The technologies behind passive resonant magnetically coupled tags are
introduced and their application as a musical controller is illustrated for
solo or group performances, interactive installations, and music toys.
","[{'version': 'v1', 'created': 'Sun, 4 Oct 2020 12:57:33 GMT'}]",2020-10-06,"[['Paradiso', 'Joseph A.', ''], ['Hsiao', 'Kai-yuh', ''], ['Benbasat', 'Ari', '']]","['RFID', 'resonant tags', 'EAS tags', 'musical controller', 'tangible interface']"
12437,1712.04628,Samin Aref,Samin Aref and Mark C. Wilson,Balance and Frustration in Signed Networks,"Accepted version, 28 pages, 13 figures, and 5 tables","AREF, S., AND WILSON, M. C. Balance and frustration in signed
  networks. Journal of Complex Networks 7, 2 (2019), 163-189.
  doi:10.1093/comnet/cny015",10.1093/comnet/cny015,,cs.SI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The frustration index is a key measure for analysing signed networks, which
has been underused due to its computational complexity. We use an exact
optimisation-based method to analyse frustration as a global structural
property of signed networks coming from diverse application areas. In the
classic friend-enemy interpretation of balance theory, a by-product of
computing the frustration index is the partitioning of nodes into two
internally solidary but mutually hostile groups.
  The main purpose of this paper is to present general methodology for
answering questions related to partial balance in signed networks, and apply it
to a range of representative examples that are now analysable because of
advances in computational methods.
  We provide exact numerical results on social and biological signed networks,
networks of formal alliances and antagonisms between countries, and financial
portfolio networks. Molecular graphs of carbon and Ising models are also
considered. The purpose served by exploring several problems in this paper is
to propose a single general methodology for studying signed networks and to
demonstrate its relevance to applications. We point out several mistakes in the
signed networks literature caused by inaccurate computation, implementation
errors or inappropriate measures.
","[{'version': 'v1', 'created': 'Wed, 13 Dec 2017 07:10:05 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Apr 2018 06:48:00 GMT'}, {'version': 'v3', 'created': 'Sun, 21 Jul 2019 19:33:21 GMT'}]",2019-07-23,"[['Aref', 'Samin', ''], ['Wilson', 'Mark C.', '']]","['Frustration index', 'Line index of balance', 'Signed graph', 'Integer programming', 'Optimisation', 'Balance theory']"
12438,1906.02235,Jukka Ruohonen,Jukka Ruohonen and Kai Kimppa,"Updating the Wassenaar Debate Once Again: Surveillance, Intrusion
  Software, and Ambiguity","Journal of Information Technology & Politics (published online in May
  2019)",,10.1080/19331681.2019.1616646,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper analyzes a recent debate on regulating cyber weapons through
multilateral export controls. The background relates to the amending of the
international Wassenaar Arrangement with offensive cyber security technologies
known as intrusion software. Implicitly, such software is related to previously
unregulated software vulnerabilities and exploits, which also make the ongoing
debate particularly relevant. By placing the debate into a historical context,
the paper reveals interesting historical parallels, elaborates the political
background, and underlines many ambiguity problems related to rigorous
definitions for cyber weapons. Many difficult problems remaining for framing
offensive security tools with multilateral export controls are also pointed
out.
","[{'version': 'v1', 'created': 'Wed, 5 Jun 2019 18:23:31 GMT'}]",2019-06-07,"[['Ruohonen', 'Jukka', ''], ['Kimppa', 'Kai', '']]","['cyber security', 'cyber weapons', 'offensive security', 'export controls', 'nonproliferation', 'Internet governance']"
12439,1912.08925,Seonghyeon Lee,"Seonghyeon Lee, Chanyoung Park and Hwanjo Yu","BHIN2vec: Balancing the Type of Relation in Heterogeneous Information
  Network",,CIKM 2019,10.1145/3357384.3357893,,cs.SI cs.LG,http://creativecommons.org/publicdomain/zero/1.0/,"  The goal of network embedding is to transform nodes in a network to a
low-dimensional embedding vectors. Recently, heterogeneous network has shown to
be effective in representing diverse information in data. However,
heterogeneous network embedding suffers from the imbalance issue, i.e. the size
of relation types (or the number of edges in the network regarding the type) is
imbalanced. In this paper, we devise a new heterogeneous network embedding
method, called BHIN2vec, which considers the balance among all relation types
in a network. We view the heterogeneous network embedding as simultaneously
solving multiple tasks in which each task corresponds to each relation type in
a network. After splitting the skip-gram loss into multiple losses
corresponding to different tasks, we propose a novel random-walk strategy to
focus on the tasks with high loss values by considering the relative training
ratio. Unlike previous random walk strategies, our proposed random-walk
strategy generates training samples according to the relative training ratio
among different tasks, which results in a balanced training for the node
embedding. Our extensive experiments on node classification and recommendation
demonstrate the superiority of BHIN2vec compared to the state-of-the-art
methods. Also, based on the relative training ratio, we analyze how much each
relation type is represented in the embedding space.
","[{'version': 'v1', 'created': 'Tue, 26 Nov 2019 12:25:44 GMT'}]",2019-12-21,"[['Lee', 'Seonghyeon', ''], ['Park', 'Chanyoung', ''], ['Yu', 'Hwanjo', '']]","['network embedding', 'heterogeneous network', 'random-walk strategy', 'multitask learning', 'inverse training ratio', 'stochastic matrix']"
12440,2206.07555,William Seymour,"William Seymour, Max Van Kleek, Reuben Binns, Dave Murray-Rust",Respect as a Lens for the Design of AI Systems,"To appear in the Proceedings of the 2022 AAAI/ACM Conference on AI,
  Ethics, and Society (AIES '22)",,10.1145/3514094.3534186,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Critical examinations of AI systems often apply principles such as fairness,
justice, accountability, and safety, which is reflected in AI regulations such
as the EU AI Act. Are such principles sufficient to promote the design of
systems that support human flourishing? Even if a system is in some sense fair,
just, or 'safe', it can nonetheless be exploitative, coercive, inconvenient, or
otherwise conflict with cultural, individual, or social values. This paper
proposes a dimension of interactional ethics thus far overlooked: the ways AI
systems should treat human beings. For this purpose, we explore the
philosophical concept of respect: if respect is something everyone needs and
deserves, shouldn't technology aim to be respectful? Despite its intuitive
simplicity, respect in philosophy is a complex concept with many disparate
senses. Like fairness or justice, respect can characterise how people deserve
to be treated; but rather than relating primarily to the distribution of
benefits or punishments, respect relates to how people regard one another, and
how this translates to perception, treatment, and behaviour. We explore respect
broadly across several literatures, synthesising perspectives on respect from
Kantian, post-Kantian, dramaturgical, and agential realist design perspectives
with a goal of drawing together a view of what respect could mean for AI. In so
doing, we identify ways that respect may guide us towards more sociable
artefacts that ethically and inclusively honour and recognise humans using the
rich social language that we have evolved to interact with one another every
day.
","[{'version': 'v1', 'created': 'Wed, 15 Jun 2022 14:15:03 GMT'}]",2022-06-16,"[['Seymour', 'William', ''], ['Van Kleek', 'Max', ''], ['Binns', 'Reuben', ''], ['Murray-Rust', 'Dave', '']]","['Respect', 'ethical design', 'AI systems']"
12441,2104.02549,Nicolai Kraus,Nicolai Kraus and Fredrik Nordvall Forsberg and Chuangjie Xu,Connecting Constructive Notions of Ordinals in Homotopy Type Theory,"main part (16 pages) published at MFCS'21; arXiv version contains an
  appendix with proofs (27 pages total)","Mathematical Foundations of Computer Science (MFCS) 2021, p.
  70:1-70:16",10.4230/LIPIcs.MFCS.2021.70,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In classical set theory, there are many equivalent ways to introduce
ordinals. In a constructive setting, however, the different notions split
apart, with different advantages and disadvantages for each. We consider three
different notions of ordinals in homotopy type theory, and show how they relate
to each other: A notation system based on Cantor normal forms, a refined notion
of Brouwer trees (inductively generated by zero, successor and countable
limits), and wellfounded extensional orders. For Cantor normal forms, most
properties are decidable, whereas for wellfounded extensional transitive
orders, most are undecidable. Formulations for Brouwer trees are usually
partially decidable. We demonstrate that all three notions have properties
expected of ordinals: their order relations, although defined differently in
each case, are all extensional and wellfounded, and the usual arithmetic
operations can be defined in each case. We connect these notions by
constructing structure preserving embeddings of Cantor normal forms into
Brouwer trees, and of these in turn into wellfounded extensional orders. We
have formalised most of our results in cubical Agda.
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2021 14:41:27 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Jul 2021 11:56:03 GMT'}]",2022-08-04,"[['Kraus', 'Nicolai', ''], ['Forsberg', 'Fredrik Nordvall', ''], ['Xu', 'Chuangjie', '']]","['Constructive ordinals', 'Cantor normal forms', 'Brouwer trees']"
12442,1802.02607,Panayiotis Georgiou,"Prashanth Gurunath Shivakumar, Haoqi Li, Kevin Knight, Panayiotis
  Georgiou","Learning from Past Mistakes: Improving Automatic Speech Recognition
  Output via Noisy-Clean Phrase Context Modeling",,"APSIPA Transactions on Signal and Information Processing 8.
  Cambridge University Press: e8, 2019",10.1017/ATSIP.2018.31,,cs.CL cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic speech recognition (ASR) systems often make unrecoverable errors
due to subsystem pruning (acoustic, language and pronunciation models); for
example pruning words due to acoustics using short-term context, prior to
rescoring with long-term context based on linguistics. In this work we model
ASR as a phrase-based noisy transformation channel and propose an error
correction system that can learn from the aggregate errors of all the
independent modules constituting the ASR and attempt to invert those. The
proposed system can exploit long-term context using a neural network language
model and can better choose between existing ASR output possibilities as well
as re-introduce previously pruned or unseen (out-of-vocabulary) phrases. It
provides corrections under poorly performing ASR conditions without degrading
any accurate transcriptions; such corrections are greater on top of
out-of-domain and mismatched data ASR. Our system consistently provides
improvements over the baseline ASR, even when baseline is further optimized
through recurrent neural network language model rescoring. This demonstrates
that any ASR improvements can be exploited independently and that our proposed
system can potentially still provide benefits on highly optimized ASR. Finally,
we present an extensive analysis of the type of errors corrected by our system.
","[{'version': 'v1', 'created': 'Wed, 7 Feb 2018 19:30:17 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Mar 2019 23:28:46 GMT'}]",2019-07-01,"[['Shivakumar', 'Prashanth Gurunath', ''], ['Li', 'Haoqi', ''], ['Knight', 'Kevin', ''], ['Georgiou', 'Panayiotis', '']]","['Error correction', 'Speech recognition', 'Phrase-based context modeling', 'Noise channel estimation', 'Neural NetworkLanguage Model']"
12443,2011.02850,Houwang Tu,"Houwang Tu, Yongxian Wang, Qiang Lan, Wei Liu, Wenbin Xiao, Shuqing Ma","Applying a Legendre collocation method based on domain decomposition to
  calculate underwater sound propagation in a horizontally stratified
  environment","29pages, 7 figures",,10.1016/j.jsv.2021.116364,,cs.CE math.SP physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The propagation of sound waves in a horizontally stratified environment, a
classic problem in ocean acoustics, has traditionally been calculated using
normal modes. Most programs based on the normal mode model are discretized
using the finite difference method (FDM). In this paper, a Legendre collocation
method (LCM) based on domain decomposition is proposed to solve this problem. A
set of collocation points cannot penetrate multiple layers of media, thus
necessitating domain decomposition and the use of multiple sets of collocation
points. The solution process of this method proceeds entirely in physical
space, requiring that the original differential equation be strictly
established at the collocation points; thus, a dense matrix eigenvalue system
is formed, from which the solution for the horizontal wavenumbers and modes can
be directly obtained. Numerical experiments are presented to demonstrate the
validity and applicability of this method. A comparison with other methods
shows that the LCM proposed in this article is more accurate than the FDM and
offers roughly the same accuracy as but a faster calculation speed than other
types of spectral methods.
","[{'version': 'v1', 'created': 'Thu, 5 Nov 2020 14:22:01 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Feb 2021 11:18:24 GMT'}, {'version': 'v3', 'created': 'Fri, 28 May 2021 05:45:36 GMT'}, {'version': 'v4', 'created': 'Wed, 28 Jul 2021 07:36:22 GMT'}]",2021-07-29,"[['Tu', 'Houwang', ''], ['Wang', 'Yongxian', ''], ['Lan', 'Qiang', ''], ['Liu', 'Wei', ''], ['Xiao', 'Wenbin', ''], ['Ma', 'Shuqing', '']]","['Collocation method', 'normal modes', 'underwater soundpropagation', 'computational ocean acoustics']"
12444,cs/0703118,Andreas de Vries,Andreas de Vries,Mathematical model of interest matchmaking in electronic social networks,"6 pages, 3 figures","Applied Mathematics 5 (16) 2014, 2619-2629",10.4236/am.2014.516250,,cs.CY cs.AI,,"  The problem of matchmaking in electronic social networks is formulated as an
optimization problem. In particular, a function measuring the matching degree
of fields of interest of a search profile with those of an advertising profile
is proposed.
","[{'version': 'v1', 'created': 'Fri, 23 Mar 2007 12:42:20 GMT'}, {'version': 'v2', 'created': 'Sat, 24 Mar 2007 09:47:49 GMT'}]",2015-02-03,"[['de Vries', 'Andreas', '']]","['matchmaking algorithm', 'matching degree', 'electronic social network', 'matching fields ofinterest']"
12445,1810.03506,Eric Neiva,"Eric Neiva and Santiago Badia and Alberto F. Mart\'in and Michele
  Chiumenti","A scalable parallel finite element framework for growing geometries.
  Application to metal additive manufacturing",,,10.1002/nme.6085,,cs.CE cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work introduces an innovative parallel, fully-distributed finite element
framework for growing geometries and its application to metal additive
manufacturing. It is well-known that virtual part design and qualification in
additive manufacturing requires highly-accurate multiscale and multiphysics
analyses. Only high performance computing tools are able to handle such
complexity in time frames compatible with time-to-market. However, efficiency,
without loss of accuracy, has rarely held the centre stage in the numerical
community. Here, in contrast, the framework is designed to adequately exploit
the resources of high-end distributed-memory machines. It is grounded on three
building blocks: (1) Hierarchical adaptive mesh refinement with octree-based
meshes; (2) a parallel strategy to model the growth of the geometry; (3)
state-of-the-art parallel iterative linear solvers. Computational experiments
consider the heat transfer analysis at the part scale of the printing process
by powder-bed technologies. After verification against a 3D benchmark, a
strong-scaling analysis assesses performance and identifies major sources of
parallel overhead. A third numerical example examines the efficiency and
robustness of (2) in a curved 3D shape. Unprecedented parallelism and
scalability were achieved in this work. Hence, this framework contributes to
take on higher complexity and/or accuracy, not only of part-scale simulations
of metal or polymer additive manufacturing, but also in welding, sedimentation,
atherosclerosis, or any other physical problem where the physical domain of
interest grows in time.
","[{'version': 'v1', 'created': 'Mon, 8 Oct 2018 14:51:31 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Oct 2018 09:21:34 GMT'}, {'version': 'v3', 'created': 'Wed, 27 Mar 2019 10:20:37 GMT'}]",2019-04-30,"[['Neiva', 'Eric', ''], ['Badia', 'Santiago', ''], ['Martín', 'Alberto F.', ''], ['Chiumenti', 'Michele', '']]","['Parallel computing', 'domain decomposition', 'finite elements', 'adaptive mesh refinement', 'additive manufacturing', 'powder-bed fusion']"
12446,1908.06974,Fehmi Cirak,Fehmi Cirak and Malcolm Sabin,Adding quadric fillets to quador lattice structures,,,10.1016/j.cad.2019.102754,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Gupta et al. [1, 2] describe a very beautiful application of algebraic
geometry to lattice structures composed of quadric of revolution (quador)
implicit surfaces. However, the shapes created have concave edges where the
stubs meet, and such edges can be stress-raisers which can cause significant
problems with, for instance, fatigue under cyclic loading. This note describes
a way in which quadric fillets can be added to these models, thus relieving
this problem while retaining their computational simplicity and efficiency.
","[{'version': 'v1', 'created': 'Mon, 19 Aug 2019 11:26:38 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Sep 2019 12:58:29 GMT'}]",2019-09-27,"[['Cirak', 'Fehmi', ''], ['Sabin', 'Malcolm', '']]","['lattice structures', 'quadrics of revolution', 'quadors', 'algebraic geometry']"
12447,cs/0010017,Davide Rocchesso,Davide Rocchesso and Pierre Dutilleux,"Generalization of a 3-D resonator model for the simulation of spherical
  enclosures","39 pages, 16 figures, 6 tables. Accepted for publication in Applied
  Signal Processing",,10.1155/S1110865701000105,,cs.SD,,"  A rectangular enclosure has such an even distribution of resonances that it
can be accurately and efficiently modelled using a feedback delay network.
Conversely, a non rectangular shape such as a sphere has a distribution of
resonances that challenges the construction of an efficient model. This work
proposes an extension of the already known feedback delay network structure to
model the resonant properties of a sphere. A specific frequency distribution of
resonances can be approximated, up to a certain frequency, by inserting an
allpass filter of moderate order after each delay line of a feedback delay
network. The structure used for rectangular boxes is therefore augmented with a
set of allpass filters allowing parametric control over the enclosure size and
the boundary properties. This work was motivated by informal listening tests
which have shown that it is possible to identify a basic shape just from the
distribution of its audible resonances.
","[{'version': 'v1', 'created': 'Tue, 10 Oct 2000 13:08:28 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Jan 2001 07:48:08 GMT'}]",2016-02-17,"[['Rocchesso', 'Davide', ''], ['Dutilleux', 'Pierre', '']]","['Physically-based sound modelling', 'spherical resonators', 'feedback']"
12448,1810.01051,Parth Shah,Parth Shah and Rachana Oza,"Improved Parallel Rabin-Karp Algorithm Using Compute Unified Device
  Architecture","Information and Communication Technology for Intelligent Systems
  (ICTIS 2017)","Smart Innovation, Systems and Technologies, vol 84. 2017 Springer,
  Cham",10.1007/978-3-319-63645-0_26,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  String matching algorithms are among one of the most widely used algorithms
in computer science. Traditional string matching algorithms efficiency of
underlaying string matching algorithm will greatly increase the efficiency of
any application. In recent years, Graphics processing units are emerged as
highly parallel processor. They out perform best of the central processing
units in scientific computation power. By combining recent advancement in
graphics processing units with string matching algorithms will allows to speed
up process of string matching. In this paper we proposed modified parallel
version of Rabin-Karp algorithm using graphics processing unit. Based on that,
result of CPU as well as parallel GPU implementations are compared for
evaluating effect of varying number of threads, cores, file size as well as
pattern size.
","[{'version': 'v1', 'created': 'Tue, 2 Oct 2018 03:21:28 GMT'}]",2018-10-03,"[['Shah', 'Parth', ''], ['Oza', 'Rachana', '']]","['Rabin-Karp', 'GPU', 'String Matching', 'CUDA', 'Parallel Processing', 'Big Data', 'Pattern Matching']"
12449,1806.06387,Marta Nu\~nez-Garcia,"Marta Nu\~nez-Garcia, Oscar Camara, Mark D. O'Neill, Reza Razavi,
  Henry Chubb, and Constantine Butakoff","Mind the gap: quantification of incomplete ablation patterns after
  pulmonary vein isolation using minimum path search",,"Medical Image Analysis, 51, 1-12, (2018)",10.1016/j.media.2018.10.001,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pulmonary vein isolation (PVI) is a common procedure for the treatment of
atrial fibrillation (AF). A successful isolation produces a continuous lesion
(scar) completely encircling the veins that stops activation waves from
propagating to the atrial body. Unfortunately, the encircling lesion is often
incomplete, becoming a combination of scar and gaps of healthy tissue. These
gaps are potential causes of AF recurrence, which requires a redo of the
isolation procedure. Late-gadolinium enhanced cardiac magnetic resonance
(LGE-CMR) is a non-invasive method that may also be used to detect gaps, but it
is currently a time-consuming process, prone to high inter-observer
variability. In this paper, we present a method to semi-automatically identify
and quantify ablation gaps. Gap quantification is performed through minimum
path search in a graph where every node is a scar patch and the edges are the
geodesic distances between patches. We propose the Relative Gap Measure (RGM)
to estimate the percentage of gap around a vein, which is defined as the ratio
of the overall gap length and the total length of the path that encircles the
vein. Additionally, an advanced version of the RGM has been developed to
integrate gap quantification estimates from different scar segmentation
techniques into a single figure-of-merit. Population-based statistical and
regional analysis of gap distribution was performed using a standardised
parcellation of the left atrium. We have evaluated our method on synthetic and
clinical data from 50 AF patients who underwent PVI with radiofrequency
ablation. The population-based analysis concluded that the left superior PV is
more prone to lesion gaps while the left inferior PV tends to have less gaps
(p<0.05 in both cases), in the processed data. This type of information can be
very useful for the optimization and objective assessment of PVI interventions.
","[{'version': 'v1', 'created': 'Sun, 17 Jun 2018 14:13:14 GMT'}]",2018-11-06,"[['Nuñez-Garcia', 'Marta', ''], ['Camara', 'Oscar', ''], [""O'Neill"", 'Mark D.', ''], ['Razavi', 'Reza', ''], ['Chubb', 'Henry', ''], ['Butakoff', 'Constantine', '']]","['Ablation gap', 'minimal path search', 'geodesic distance', 'distance transform', 'atrial fibrillation', 'pulmonaryvein isolation']"
12450,2203.13692,Wojciech Jamroga,"Francesco Belardinelli, Rodica Condurache, Catalin Dima, Wojciech
  Jamroga, Michal Knapik","Bisimulations for Verifying Strategic Abilities with an Application to
  the ThreeBallot Voting Protocol",,,10.1016/j.ic.2020.104552,,cs.MA,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We propose a notion of alternating bisimulation for strategic abilities under
imperfect information. The bisimulation preserves formulas of ATL$^*$ for both
the {\em objective} and {\em subjective} variants of the state-based semantics
with imperfect information, which are commonly used in the modeling and
verification of multi-agent systems. Furthermore, we apply the theoretical
result to the verification of coercion-resistance in the ThreeBallot voting
system, a voting protocol that does not use cryptography. In particular, we
show that natural simplifications of an initial model of the protocol are in
fact bisimulations of the original model, and therefore satisfy the same
ATL$^*$ properties, including coercion-resistance. These simplifications allow
the model-checking tool MCMAS to terminate on models with a larger number of
voters and candidates, compared with the initial model.
","[{'version': 'v1', 'created': 'Fri, 25 Mar 2022 14:56:20 GMT'}]",2022-03-28,"[['Belardinelli', 'Francesco', ''], ['Condurache', 'Rodica', ''], ['Dima', 'Catalin', ''], ['Jamroga', 'Wojciech', ''], ['Knapik', 'Michal', '']]","['Alternating-time Temporal Logic', 'Bisimulations', 'VotingProtocols', 'Formal Verification']"
12451,2105.01011,Peng Liang,"Liming Fu, Peng Liang, Xueying Li, Chen Yang","A Machine Learning Based Ensemble Method for Automatic Multiclass
  Classification of Decisions","The 25th International Conference on Evaluation and Assessment in
  Software Engineering (EASE)",,10.1145/3463274.3463325,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Stakeholders make various types of decisions with respect to requirements,
design, management, and so on during the software development life cycle.
Nevertheless, these decisions are typically not well documented and classified
due to limited human resources, time, and budget. To this end, automatic
approaches provide a promising way. In this paper, we aimed at automatically
classifying decisions into five types to help stakeholders better document and
understand decisions. First, we collected a dataset from the Hibernate
developer mailing list. We then experimented and evaluated 270 configurations
regarding feature selection, feature extraction techniques, and machine
learning classifiers to seek the best configuration for classifying decisions.
Especially, we applied an ensemble learning method and constructed ensemble
classifiers to compare the performance between ensemble classifiers and base
classifiers. Our experiment results show that (1) feature selection can
decently improve the classification results; (2) ensemble classifiers can
outperform base classifiers provided that ensemble classifiers are well
constructed; (3) BoW + 50% features selected by feature selection with an
ensemble classifier that combines Na\""ive Bayes (NB), Logistic Regression (LR),
and Support Vector Machine (SVM) achieves the best classification result (with
a weighted precision of 0.750, a weighted recall of 0.739, and a weighted
F1-score of 0.727) among all the configurations. Our work can benefit various
types of stakeholders in software development through providing an automatic
approach for effectively classifying decisions into specific types that are
relevant to their interests.
","[{'version': 'v1', 'created': 'Mon, 3 May 2021 16:55:00 GMT'}, {'version': 'v2', 'created': 'Tue, 4 May 2021 04:21:23 GMT'}]",2021-05-05,"[['Fu', 'Liming', ''], ['Liang', 'Peng', ''], ['Li', 'Xueying', ''], ['Yang', 'Chen', '']]","['Decision', 'Automatic Classification', 'Ensemble Classifier', 'SoftwareDevelopment', 'Hibernate']"
12452,2212.02344,Krzysztof R. Apt,Krzysztof R. Apt and Jan Heering,"Characterization of incentive compatible single-parameter mechanisms
  revisited",17 pages,"Journal of Mechanism and Institution Design Volume 7, issue 1,
  pages 113-129 (December 2022)",10.22574/jmid.2022.12.004,,cs.GT,http://creativecommons.org/licenses/by/4.0/,"  We reexamine the characterization of incentive compatible single-parameter
mechanisms introduced in Archer & Tardos(2001). We argue that the claimed
uniqueness result, called `Myerson's Lemma' was not well established. We
provide an elementary proof of uniqueness that unifies the presentation for two
classes of allocation functions used in the literature and show that the
general case is a consequence of a little known result from the theory of real
functions. We also clarify that our proof of uniqueness is more elementary than
the previous one. Finally, by generalizing our characterization result to more
dimensions, we provide alternative proofs of revenue equivalence results for
multiunit auctions and combinatorial auctions.
","[{'version': 'v1', 'created': 'Mon, 5 Dec 2022 15:23:18 GMT'}]",2022-12-06,"[['Apt', 'Krzysztof R.', ''], ['Heering', 'Jan', '']]","['incentive compatibility', 'single-parameter mechanisms', 'Myerson’slemma', 'auctions', 'revenue equivalence']"
12453,2101.01036,Jian Chen,"Jian Chen and Meng Ling and Rui Li and Petra Isenberg and Tobias
  Isenberg and Michael Sedlmair and Torsten M\""oller and Robert S. Laramee and
  Han-Wei Shen and Katharina W\""unsche and Qiru Wang","VIS30K: A Collection of Figures and Tables from IEEE Visualization
  Conference Publications",12 pages,"IEEE Transactions on Visualization and Computer Graphics, 27
  January 2021",10.1109/TVCG.2021.3054916,33502982,cs.CV cs.GR eess.IV,http://creativecommons.org/licenses/by/4.0/,"  We present the VIS30K dataset, a collection of 29,689 images that represents
30 years of figures and tables from each track of the IEEE Visualization
conference series (Vis, SciVis, InfoVis, VAST). VIS30K's comprehensive coverage
of the scientific literature in visualization not only reflects the progress of
the field but also enables researchers to study the evolution of the
state-of-the-art and to find relevant work based on graphical content. We
describe the dataset and our semi-automatic collection process, which couples
convolutional neural networks (CNN) with curation. Extracting figures and
tables semi-automatically allows us to verify that no images are overlooked or
extracted erroneously. To improve quality further, we engaged in a peer-search
process for high-quality figures from early IEEE Visualization papers. With the
resulting data, we also contribute VISImageNavigator (VIN,
visimagenavigator.github.io), a web-based tool that facilitates searching and
exploring VIS30K by author names, paper keywords, title and abstract, and
years.
","[{'version': 'v1', 'created': 'Tue, 22 Dec 2020 19:56:29 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Jan 2021 03:05:49 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Jan 2021 11:50:39 GMT'}]",2021-03-09,"[['Chen', 'Jian', ''], ['Ling', 'Meng', ''], ['Li', 'Rui', ''], ['Isenberg', 'Petra', ''], ['Isenberg', 'Tobias', ''], ['Sedlmair', 'Michael', ''], ['Möller', 'Torsten', ''], ['Laramee', 'Robert S.', ''], ['Shen', 'Han-Wei', ''], ['Wünsche', 'Katharina', ''], ['Wang', 'Qiru', '']]","[', title', 'abstract,', 'years']"
12454,2202.13822,Alper Yegenoglu,"Alper Yegenoglu, Anand Subramoney, Thorsten Hater, Cristian
  Jimenez-Romero, Wouter Klijn, Aaron Perez Martin, Michiel van der Vlag,
  Michael Herty, Abigail Morrison, Sandra Diaz-Pier","Exploring hyper-parameter spaces of neuroscience models on high
  performance computers with Learning to Learn",,,10.3389/fncom.2022.885207,,cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Neuroscience models commonly have a high number of degrees of freedom and
only specific regions within the parameter space are able to produce dynamics
of interest. This makes the development of tools and strategies to efficiently
find these regions of high importance to advance brain research. Exploring the
high dimensional parameter space using numerical simulations has been a
frequently used technique in the last years in many areas of computational
neuroscience. High performance computing (HPC) can provide today a powerful
infrastructure to speed up explorations and increase our general understanding
of the model's behavior in reasonable times.
","[{'version': 'v1', 'created': 'Mon, 28 Feb 2022 14:32:14 GMT'}]",2022-12-19,"[['Yegenoglu', 'Alper', ''], ['Subramoney', 'Anand', ''], ['Hater', 'Thorsten', ''], ['Jimenez-Romero', 'Cristian', ''], ['Klijn', 'Wouter', ''], ['Martin', 'Aaron Perez', ''], ['van der Vlag', 'Michiel', ''], ['Herty', 'Michael', ''], ['Morrison', 'Abigail', ''], ['Diaz-Pier', 'Sandra', '']]","['simulation', 'meta learning', 'hyper-parameter optimization', 'high performance computing', 'connectivitygeneration', 'parameter exploration']"
12455,1402.0160,Hamza Salami,"Hamza Onoruoiza Salami, Moataz Ahmed",A framework for reuse of multi-view UML artifacts,conference proceeding,"International Journal of Soft Computing and Software Engineering
  [JSCSE], Vol. 3, No. 3, pp. 156-162, 2013, Doi: 10.7321/jscse.v3.n3.25",10.7321/jscse.v3.n3.25,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software is typically modeled from different viewpoints such as structural
view, behavioral view and functional view. Few existing works can be considered
as applying multi-view retrieval approaches. A number of important issues
regarding mapping of entities during multi-view retrieval of UML models is
identified in this study. In response, we describe a framework for reusing UML
artifacts, and discuss how our retrieval approach tackles the identified
issues.
","[{'version': 'v1', 'created': 'Sun, 2 Feb 2014 08:45:47 GMT'}]",2014-02-04,"[['Salami', 'Hamza Onoruoiza', ''], ['Ahmed', 'Moataz', '']]","['UML', 'software reuse', 'software retrieval', 'multi']"
12456,2104.14939,Tarun Krishna,"Tarun Krishna, Kevin McGuinness and Noel O'Connor",Evaluating Contrastive Models for Instance-based Image Retrieval,"Accepted In Proceedings of the 2021 International Conference on
  Multimedia Retrieval (ICMR 21)",,10.1145/3460426.3463585,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  In this work, we evaluate contrastive models for the task of image retrieval.
We hypothesise that models that are learned to encode semantic similarity among
instances via discriminative learning should perform well on the task of image
retrieval, where relevancy is defined in terms of instances of the same object.
Through our extensive evaluation, we find that representations from models
trained using contrastive methods perform on-par with (and outperforms) a
pre-trained supervised baseline trained on the ImageNet labels in retrieval
tasks under various configurations. This is remarkable given that the
contrastive models require no explicit supervision. Thus, we conclude that
these models can be used to bootstrap base models to build more robust image
retrieval engines.
","[{'version': 'v1', 'created': 'Fri, 30 Apr 2021 12:05:23 GMT'}]",2021-05-03,"[['Krishna', 'Tarun', ''], ['McGuinness', 'Kevin', ''], [""O'Connor"", 'Noel', '']]","['Deep learning', 'Contrastive learning', 'Self-supervised learning']"
12457,2008.01391,Bharathi Raja Chakravarthi,"Bharathi Raja Chakravarthi, Priya Rani, Mihael Arcan and John P.
  McCrae",A Survey of Orthographic Information in Machine Translation,18 pages,SN Computer Science (2021) 2:330,10.1007/s42979-021-00723-4,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Machine translation is one of the applications of natural language processing
which has been explored in different languages. Recently researchers started
paying attention towards machine translation for resource-poor languages and
closely related languages. A widespread and underlying problem for these
machine translation systems is the variation in orthographic conventions which
causes many issues to traditional approaches. Two languages written in two
different orthographies are not easily comparable, but orthographic information
can also be used to improve the machine translation system. This article offers
a survey of research regarding orthography's influence on machine translation
of under-resourced languages. It introduces under-resourced languages in terms
of machine translation and how orthographic information can be utilised to
improve machine translation. We describe previous work in this area, discussing
what underlying assumptions were made, and showing how orthographic knowledge
improves the performance of machine translation of under-resourced languages.
We discuss different types of machine translation and demonstrate a recent
trend that seeks to link orthographic information with well-established machine
translation methods. Considerable attention is given to current efforts of
cognates information at different levels of machine translation and the lessons
that can be drawn from this. Additionally, multilingual neural machine
translation of closely related languages is given a particular focus in this
survey. This article ends with a discussion of the way forward in machine
translation with orthographic information, focusing on multilingual settings
and bilingual lexicon induction.
","[{'version': 'v1', 'created': 'Tue, 4 Aug 2020 07:59:02 GMT'}]",2021-06-09,"[['Chakravarthi', 'Bharathi Raja', ''], ['Rani', 'Priya', ''], ['Arcan', 'Mihael', ''], ['McCrae', 'John P.', '']]","['Orthography', 'Under-resourced languages', 'Machine translation', 'Rulebased machine translation', 'Statistical machine translation', 'Neural machine translation']"
12458,2002.11557,David Garc\'ia-Soriano,"David Garc\'ia-Soriano, Konstantin Kutzkov, Francesco Bonchi,
  Charalampos Tsourakakis",Query-Efficient Correlation Clustering,To appear in WWW 2020,,10.1145/3366423.3380220,,cs.DS cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Correlation clustering is arguably the most natural formulation of
clustering. Given n objects and a pairwise similarity measure, the goal is to
cluster the objects so that, to the best possible extent, similar objects are
put in the same cluster and dissimilar objects are put in different clusters.
  A main drawback of correlation clustering is that it requires as input the
$\Theta(n^2)$ pairwise similarities. This is often infeasible to compute or
even just to store. In this paper we study \emph{query-efficient} algorithms
for correlation clustering. Specifically, we devise a correlation clustering
algorithm that, given a budget of $Q$ queries, attains a solution whose
expected number of disagreements is at most $3\cdot OPT + O(\frac{n^3}{Q})$,
where $OPT$ is the optimal cost for the instance. Its running time is $O(Q)$,
and can be easily made non-adaptive (meaning it can specify all its queries at
the outset and make them in parallel) with the same guarantees. Up to constant
factors, our algorithm yields a provably optimal trade-off between the number
of queries $Q$ and the worst-case error attained, even for adaptive algorithms.
  Finally, we perform an experimental study of our proposed method on both
synthetic and real data, showing the scalability and the accuracy of our
algorithm.
","[{'version': 'v1', 'created': 'Wed, 26 Feb 2020 15:18:20 GMT'}]",2020-02-27,"[['García-Soriano', 'David', ''], ['Kutzkov', 'Konstantin', ''], ['Bonchi', 'Francesco', ''], ['Tsourakakis', 'Charalampos', '']]","['correlation clustering', 'active learning', 'query complexity', 'algorithmdesign']"
12459,2101.12446,Matthew Olson,"Matthew L. Olson, Roli Khanna, Lawrence Neal, Fuxin Li, Weng-Keen Wong","Counterfactual State Explanations for Reinforcement Learning Agents via
  Generative Deep Learning","Full source code available at
  https://github.com/mattolson93/counterfactual-state-explanations","Artificial Intelligence, 2021, 103455, ISSN 0004-3702",10.1016/j.artint.2021.103455,,cs.AI cs.HC cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Counterfactual explanations, which deal with ""why not?"" scenarios, can
provide insightful explanations to an AI agent's behavior. In this work, we
focus on generating counterfactual explanations for deep reinforcement learning
(RL) agents which operate in visual input environments like Atari. We introduce
counterfactual state explanations, a novel example-based approach to
counterfactual explanations based on generative deep learning. Specifically, a
counterfactual state illustrates what minimal change is needed to an Atari game
image such that the agent chooses a different action. We also evaluate the
effectiveness of counterfactual states on human participants who are not
machine learning experts. Our first user study investigates if humans can
discern if the counterfactual state explanations are produced by the actual
game or produced by a generative deep learning approach. Our second user study
investigates if counterfactual state explanations can help non-expert
participants identify a flawed agent; we compare against a baseline approach
based on a nearest neighbor explanation which uses images from the actual game.
Our results indicate that counterfactual state explanations have sufficient
fidelity to the actual game images to enable non-experts to more effectively
identify a flawed RL agent compared to the nearest neighbor baseline and to
having no explanation at all.
","[{'version': 'v1', 'created': 'Fri, 29 Jan 2021 07:43:41 GMT'}]",2021-02-01,"[['Olson', 'Matthew L.', ''], ['Khanna', 'Roli', ''], ['Neal', 'Lawrence', ''], ['Li', 'Fuxin', ''], ['Wong', 'Weng-Keen', '']]","['Deep Learning', 'Reinforcement Learning', 'Explainable AI', 'Interpretable AI']"
12460,2109.10175,Dhananjay Phansalkar,"Dhananjay Phansalkar and Kerstin Weinberg and Michael Ortiz and Sigrid
  Leyendecker",A spatially adaptive phase-field model of fracture,"14 pages, 6 figures",,10.1016/j.cma.2022.114880,,cs.CE cs.NA math.NA,http://creativecommons.org/licenses/by/4.0/,"  Phase-field models of fracture introduce smeared cracks of width commensurate
with a regularisation length parameter $\epsilon$ and obeying a minimum energy
principle. Mesh adaptivity naturally suggests itself as a means of supplying
spatial resolution were needed while simultaneously keeping the computational
size of the model as small as possible. Here, a variational-based spatial
adaptivity is proposed for a phase-field model of fracture.
  The conventional phase-field model is generalised by allowing a spatial
variation of the regularisation length $\epsilon$ in the energy functional. The
optimal spatial variation of the regularisation length then follows by energy
minimisation in the same manner as the displacement and phase fields. The
extended phase-field model is utilised as a basis for an adaptive mesh
refinement strategy, whereby the mesh size is required to resolve the optimal
length parameter locally. The resulting solution procedure is implemented in
the framework of the finite element library FEniCS. Selected numerical tests
suggest that the spatially adaptive phase-field model exhibits the same
convergence rate as the conventional phase-field model, albeit with a vastly
superior constant, which results in considerable computational savings.
","[{'version': 'v1', 'created': 'Tue, 21 Sep 2021 13:47:56 GMT'}]",2022-06-01,"[['Phansalkar', 'Dhananjay', ''], ['Weinberg', 'Kerstin', ''], ['Ortiz', 'Michael', ''], ['Leyendecker', 'Sigrid', '']]","['brittle fracture', 'phase-field model', 'spatial variation of the regularisation length', 'adaptive mesh']"
12461,2008.10906,Mahdi Mohseni,"Mahdi Mohseni, Volker Gast, Christoph Redies","Comparative Computational Analysis of Global Structure in Canonical,
  Non-Canonical and Non-Literary Texts","30 pages + 7 pages supplementary material, 5 figures",https://www.frontiersin.org/articles/10.3389/fpsyg.2021.599063/full?&utm_source=Email_to_authors_&utm_medium=Email&utm_content=T1_11.5e1_author&utm_campaign=Email_publication&field=&journalName=Frontiers_in_Psychology&id=599063,10.3389/fpsyg.2021.599063,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study investigates global properties of literary and non-literary texts.
Within the literary texts, a distinction is made between canonical and
non-canonical works. The central hypothesis of the study is that the three text
types (non-literary, literary/canonical and literary/non-canonical) exhibit
systematic differences with respect to structural design features as correlates
of aesthetic responses in readers. To investigate these differences, we
compiled a corpus containing texts of the three categories of interest, the
Jena Textual Aesthetics Corpus. Two aspects of global structure are
investigated, variability and self-similar (fractal) patterns, which reflect
long-range correlations along texts. We use four types of basic observations,
(i) the frequency of POS-tags per sentence, (ii) sentence length, (iii) lexical
diversity in chunks of text, and (iv) the distribution of topic probabilities
in chunks of texts. These basic observations are grouped into two more general
categories, (a) the low-level properties (i) and (ii), which are observed at
the level of the sentence (reflecting linguistic decoding), and (b) the
high-level properties (iii) and (iv), which are observed at the textual level
(reflecting comprehension). The basic observations are transformed into time
series, and these time series are subject to multifractal detrended fluctuation
analysis (MFDFA). Our results show that low-level properties of texts are
better discriminators than high-level properties, for the three text types
under analysis. Canonical literary texts differ from non-canonical ones
primarily in terms of variability. Fractality seems to be a universal feature
of text, more pronounced in non-literary than in literary texts. Beyond the
specific results of the study, we intend to open up new perspectives on the
experimental study of textual aesthetics.
","[{'version': 'v1', 'created': 'Tue, 25 Aug 2020 09:37:06 GMT'}]",2021-04-19,"[['Mohseni', 'Mahdi', ''], ['Gast', 'Volker', ''], ['Redies', 'Christoph', '']]","['fractality', 'self-similarity', 'multifractal DFA', 'variability', 'POS tagging', 'sentence length', 'lexical diversity', 'topic modeling']"
12462,2005.05179,Zichao Zhang,"Zichao Zhang, Torsten Sattler, Davide Scaramuzza","Reference Pose Generation for Long-term Visual Localization via Learned
  Features and View Synthesis","25 pages, 16 figures. Int J Comput Vis (2020)",,10.1007/s11263-020-01399-8,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visual Localization is one of the key enabling technologies for autonomous
driving and augmented reality. High quality datasets with accurate 6
Degree-of-Freedom (DoF) reference poses are the foundation for benchmarking and
improving existing methods. Traditionally, reference poses have been obtained
via Structure-from-Motion (SfM). However, SfM itself relies on local features
which are prone to fail when images were taken under different conditions,
e.g., day/ night changes. At the same time, manually annotating feature
correspondences is not scalable and potentially inaccurate. In this work, we
propose a semi-automated approach to generate reference poses based on feature
matching between renderings of a 3D model and real images via learned features.
Given an initial pose estimate, our approach iteratively refines the pose based
on feature matches against a rendering of the model from the current pose
estimate. We significantly improve the nighttime reference poses of the popular
Aachen Day-Night dataset, showing that state-of-the-art visual localization
methods perform better (up to $47\%$) than predicted by the original reference
poses. We extend the dataset with new nighttime test images, provide
uncertainty estimates for our new reference poses, and introduce a new
evaluation criterion. We will make our reference poses and our framework
publicly available upon publication.
","[{'version': 'v1', 'created': 'Mon, 11 May 2020 15:13:07 GMT'}, {'version': 'v2', 'created': 'Wed, 13 May 2020 15:31:07 GMT'}, {'version': 'v3', 'created': 'Sun, 8 Nov 2020 04:07:27 GMT'}, {'version': 'v4', 'created': 'Wed, 30 Dec 2020 14:29:28 GMT'}]",2021-01-01,"[['Zhang', 'Zichao', ''], ['Sattler', 'Torsten', ''], ['Scaramuzza', 'Davide', '']]","['Visual localization', 'benchmark construction', 'learned local features']"
12463,2109.14138,Joseph Chow,"Gyugeun Yoon, Joseph Y. J. Chow, Srushti Rath","A simulation sandbox to compare fixed-route, semi-flexible-transit, and
  on-demand microtransit system designs",,"KSCE Journal of Civil Engineering 26, 3043-3062 (2022)",10.1007/s12205-022-0995-3,,cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  With advances in emerging technologies, options for operating public transit
services have broadened from conventional fixed-route service through
semi-flexible service to on-demand microtransit. Nevertheless, guidelines for
deciding between these services remain limited in the real implementation. An
open-source simulation sandbox is developed that can compare
state-of-the-practice methods for evaluating between the different types of
public transit operations. For the case of the semi-flexible service, the
Mobility Allowance Shuttle Transit (MAST) system is extended to include
passenger deviations. A case study demonstrates the sandbox to evaluate and
existing B63 bus route in Brooklyn, NY and compares its performance with the
four other system designs spanning across the three service types for three
different demand scenarios.
","[{'version': 'v1', 'created': 'Wed, 29 Sep 2021 02:00:34 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Jan 2022 16:37:32 GMT'}]",2022-09-14,"[['Yoon', 'Gyugeun', ''], ['Chow', 'Joseph Y. J.', ''], ['Rath', 'Srushti', '']]","['public transport', 'semi-flexible transit', 'on-demand microtransit', 'Mobility-as-a-Service']"
12464,2103.04826,Jamal Toutouh,"Diego Gabriel Rossit, Jamal Toutouh, and Sergio Nesmachnow","Exact and heuristic approaches for multi-objective garbage accumulation
  points location in real scenarios","This article has been accepted for publication in the Waste
  Management journal",Waste Management. 105:467-481 (2020),10.1016/j.wasman.2020.02.016,,cs.OH cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Municipal solid waste management is a major challenge for nowadays urban
societies, because it accounts for a large proportion of public budget and,
when mishandled, it can lead to environmental and social problems. This work
focuses on the problem of locating waste bins in an urban area, which is
considered to have a strong influence in the overall efficiency of the reverse
logistic chain. This article contributes with an exact multiobjective approach
to solve the waste bin location in which the optimization criteria that are
considered are: the accessibility to the system (as quality of service
measure), the investment cost, and the required frequency of waste removal from
the bins (as a proxy of the posterior routing costs). In this approach,
different methods to obtain the objectives ideal and nadir values over the
Pareto front are proposed and compared. Then, a family of heuristic methods
based on the PageRank algorithm is proposed which aims to optimize the
accessibility to the system, the amount of collected waste and the installation
cost. The experimental evaluation was performed on real-world scenarios of the
cities of Montevideo, Uruguay, and Bah\'ia Blanca, Argentina. The obtained
results show the competitiveness of the proposed approaches for constructing a
set of candidate solutions that considers the different trade-offs between the
optimization criteria.
","[{'version': 'v1', 'created': 'Fri, 5 Mar 2021 13:47:21 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Mar 2021 18:05:15 GMT'}]",2021-03-12,"[['Rossit', 'Diego Gabriel', ''], ['Toutouh', 'Jamal', ''], ['Nesmachnow', 'Sergio', '']]","['municipal solid waste', 'waste bins location problem', 'multiobjective optimization', 'mixed integer programming']"
12465,2201.06629,Eung-Joo Lee,"Eung-Joo Lee, Damon M. Conover, Shuvra S. Bhattacharyyaa, Heesung
  Kwon, Jason Hill, Kenneth Evensen",Validation of object detection in UAV-based images using synthetic data,,,10.1117/12.2586860,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Object detection is increasingly used onboard Unmanned Aerial Vehicles (UAV)
for various applications; however, the machine learning (ML) models for
UAV-based detection are often validated using data curated for tasks unrelated
to the UAV application. This is a concern because training neural networks on
large-scale benchmarks have shown excellent capability in generic object
detection tasks, yet conventional training approaches can lead to large
inference errors for UAV-based images. Such errors arise due to differences in
imaging conditions between images from UAVs and images in training. To overcome
this problem, we characterize boundary conditions of ML models, beyond which
the models exhibit rapid degradation in detection accuracy. Our work is focused
on understanding the impact of different UAV-based imaging conditions on
detection performance by using synthetic data generated using a game engine.
Properties of the game engine are exploited to populate the synthetic datasets
with realistic and annotated images. Specifically, it enables the fine control
of various parameters, such as camera position, view angle, illumination
conditions, and object pose. Using the synthetic datasets, we analyze detection
accuracy in different imaging conditions as a function of the above parameters.
We use three well-known neural network models with different model complexity
in our work. In our experiment, we observe and quantify the following: 1) how
detection accuracy drops as the camera moves toward the nadir-view region; 2)
how detection accuracy varies depending on different object poses, and 3) the
degree to which the robustness of the models changes as illumination conditions
vary.
","[{'version': 'v1', 'created': 'Mon, 17 Jan 2022 20:56:56 GMT'}]",2022-01-19,"[['Lee', 'Eung-Joo', ''], ['Conover', 'Damon M.', ''], ['Bhattacharyyaa', 'Shuvra S.', ''], ['Kwon', 'Heesung', ''], ['Hill', 'Jason', ''], ['Evensen', 'Kenneth', '']]","['Object detection', 'UAV-based image', 'Synthetic data generation', 'Domain adaptation', 'Model validation']"
12466,2110.13941,Anna Maria Mandalari,"Oliver Thompson, Anna Maria Mandalari, Hamed Haddadi",Rapid IoT Device Identification at the Edge,,"2nd Workshop on Distributed Machine Learning, co-located with
  CoNEXT 2021",10.1145/3488659.3493777,,cs.LG cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consumer Internet of Things (IoT) devices are increasingly common in everyday
homes, from smart speakers to security cameras. Along with their benefits come
potential privacy and security threats. To limit these threats we must
implement solutions to filter IoT traffic at the edge. To this end the
identification of the IoT device is the first natural step.
  In this paper we demonstrate a novel method of rapid IoT device
identification that uses neural networks trained on device DNS traffic that can
be captured from a DNS server on the local network. The method identifies
devices by fitting a model to the first seconds of DNS second-level-domain
traffic following their first connection. Since security and privacy threat
detection often operate at a device specific level, rapid identification allows
these strategies to be implemented immediately. Through a total of 51,000
rigorous automated experiments, we classify 30 consumer IoT devices from 27
different manufacturers with 82% and 93% accuracy for product type and device
manufacturers respectively.
","[{'version': 'v1', 'created': 'Tue, 26 Oct 2021 18:11:38 GMT'}]",2021-10-28,"[['Thompson', 'Oliver', ''], ['Mandalari', 'Anna Maria', ''], ['Haddadi', 'Hamed', '']]","['Internet of Things', 'IoT identification', 'IoT security and privacy', 'Internet Measurement', 'machine learning', 'neural networks']"
12467,1909.09804,Mengyao Zheng,"Mengyao Zheng, Dixing Xu, Linshan Jiang, Chaojie Gu, Rui Tan, Peng
  Cheng",Challenges of Privacy-Preserving Machine Learning in IoT,"In First International Workshop on Challenges in Artificial
  Intelligence and Machine Learning (AIChallengeIoT'19) November 10-13, 2019. 7
  pages",,10.1145/3363347.3363357,,cs.CR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Internet of Things (IoT) will be a main data generation infrastructure
for achieving better system intelligence. However, the extensive data
collection and processing in IoT also engender various privacy concerns. This
paper provides a taxonomy of the existing privacy-preserving machine learning
approaches developed in the context of cloud computing and discusses the
challenges of applying them in the context of IoT. Moreover, we present a
privacy-preserving inference approach that runs a lightweight neural network at
IoT objects to obfuscate the data before transmission and a deep neural network
in the cloud to classify the obfuscated data. Evaluation based on the MNIST
dataset shows satisfactory performance.
","[{'version': 'v1', 'created': 'Sat, 21 Sep 2019 10:12:48 GMT'}]",2019-09-24,"[['Zheng', 'Mengyao', ''], ['Xu', 'Dixing', ''], ['Jiang', 'Linshan', ''], ['Gu', 'Chaojie', ''], ['Tan', 'Rui', ''], ['Cheng', 'Peng', '']]","['Internet of Things', 'machine learning', 'privacy']"
12468,2007.16070,Luis Sequeira Dr,"Jose Saldana, Mirko Suznjevic, Luis Sequeira, Julian
  Fernandez-Navajas, Maja Matijasevic, Jose Ruiz-Mas","The Effect of TCP Variants on the Coexistence of MMORPG and Best-Effort
  Traffic",,"8th International Workshop on Networking Issues in Multimedia
  Entertainment (NIME'12), Munich, Germany, July 30, 2012. ISBN:
  978-1-4673-1543-2",10.1109/ICCCN.2012.6289245,,cs.NI cs.MM cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study TCP flows coexistence between Massive Multiplayer Online Role
Playing Games (MMORPGs) and other TCP applications, by taking World of Warcraft
(WoW) and a file transfer application based on File Transfer Protocol (FTP) as
an example. Our focus is on the effects of the sender buffer size and FTP
cross-traffic on the queuing delay experienced by the (MMORPG) game traffic. A
network scenario corresponding to a real life situation in an ADSL access
network has been simulated by using NS2. Three TCP variants, namely TCP SACK,
TCP New Reno, and TCP Vegas, have been considered for cross-traffic. The
results show that TCP Vegas is able to maintain a constant rate while competing
with the game traffic, since it prevents packet loss and high queuing delays by
not increasing the sender window size. TCP SACK and TCP New Reno, on the other
hand, tend to continuously increase the sender window size, thus potentially
allowing higher packet loss and causing undesired delays for the game traffic.
In terms of buffer size, we have established that smaller buffers are better
for MMORPG applications, while larger buffers contribute to a higher overall
delay.
","[{'version': 'v1', 'created': 'Thu, 30 Jul 2020 11:03:23 GMT'}]",2020-08-03,"[['Saldana', 'Jose', ''], ['Suznjevic', 'Mirko', ''], ['Sequeira', 'Luis', ''], ['Fernandez-Navajas', 'Julian', ''], ['Matijasevic', 'Maja', ''], ['Ruiz-Mas', 'Jose', '']]","['online gaming', 'MMORPG', 'TCP variants', 'buffer size', 'queuing delay']"
12469,2206.13611,Vivek Jayaram,"Ishan Chatterjee, Maruchi Kim, Vivek Jayaram, Shyamnath Gollakota, Ira
  Kemelmacher-Shlizerman, Shwetak Patel, Steven M. Seitz","ClearBuds: Wireless Binaural Earbuds for Learning-Based Speech
  Enhancement","12 pages, Published in Mobisys 2022",,10.1145/3498361.3538933,,cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  We present ClearBuds, the first hardware and software system that utilizes a
neural network to enhance speech streamed from two wireless earbuds. Real-time
speech enhancement for wireless earbuds requires high-quality sound separation
and background cancellation, operating in real-time and on a mobile phone.
Clear-Buds bridges state-of-the-art deep learning for blind audio source
separation and in-ear mobile systems by making two key technical contributions:
1) a new wireless earbud design capable of operating as a synchronized,
binaural microphone array, and 2) a lightweight dual-channel speech enhancement
neural network that runs on a mobile device. Our neural network has a novel
cascaded architecture that combines a time-domain conventional neural network
with a spectrogram-based frequency masking neural network to reduce the
artifacts in the audio output. Results show that our wireless earbuds achieve a
synchronization error less than 64 microseconds and our network has a runtime
of 21.4 milliseconds on an accompanying mobile phone. In-the-wild evaluation
with eight users in previously unseen indoor and outdoor multipath scenarios
demonstrates that our neural network generalizes to learn both spatial and
acoustic cues to perform noise suppression and background speech removal. In a
user-study with 37 participants who spent over 15.4 hours rating 1041 audio
samples collected in-the-wild, our system achieves improved mean opinion score
and background noise suppression.
  Project page with demos: https://clearbuds.cs.washington.edu
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2022 20:09:25 GMT'}]",2022-06-29,"[['Chatterjee', 'Ishan', ''], ['Kim', 'Maruchi', ''], ['Jayaram', 'Vivek', ''], ['Gollakota', 'Shyamnath', ''], ['Kemelmacher-Shlizerman', 'Ira', ''], ['Patel', 'Shwetak', ''], ['Seitz', 'Steven M.', '']]","['Audio source separation', 'earable computing', 'noise cancellation', 'cascaded neural networks', 'audio and speech processing']"
12470,2007.09334,Yi Liu,"Yi Liu, Hao Yuan, Lei Cai and Shuiwang Ji","Deep Learning of High-Order Interactions for Protein Interface
  Prediction","10 pages, 3 figures, 4 tables. KDD2020",,10.1145/3394486.3403110,,cs.LG q-bio.MN stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Protein interactions are important in a broad range of biological processes.
Traditionally, computational methods have been developed to automatically
predict protein interface from hand-crafted features. Recent approaches employ
deep neural networks and predict the interaction of each amino acid pair
independently. However, these methods do not incorporate the important
sequential information from amino acid chains and the high-order pairwise
interactions. Intuitively, the prediction of an amino acid pair should depend
on both their features and the information of other amino acid pairs. In this
work, we propose to formulate the protein interface prediction as a 2D dense
prediction problem. In addition, we propose a novel deep model to incorporate
the sequential information and high-order pairwise interactions to perform
interface predictions. We represent proteins as graphs and employ graph neural
networks to learn node features. Then we propose the sequential modeling method
to incorporate the sequential information and reorder the feature matrix. Next,
we incorporate high-order pairwise interactions to generate a 3D tensor
containing different pairwise interactions. Finally, we employ convolutional
neural networks to perform 2D dense predictions. Experimental results on
multiple benchmarks demonstrate that our proposed method can consistently
improve the protein interface prediction performance.
","[{'version': 'v1', 'created': 'Sat, 18 Jul 2020 05:39:35 GMT'}]",2020-07-21,"[['Liu', 'Yi', ''], ['Yuan', 'Hao', ''], ['Cai', 'Lei', ''], ['Ji', 'Shuiwang', '']]","['protein interface prediction', 'graphs neural networks', 'structural information', 'sequential information', 'high-order pairwise interactions']"
12471,2202.08036,Ruixuan Liu,"Ruixuan Liu, Fangzhao Wu, Chuhan Wu, Yanlin Wang, Lingjuan Lyu, Hong
  Chen, Xing Xie","No One Left Behind: Inclusive Federated Learning over Heterogeneous
  Devices",Accepted by KDD22,,10.1145/3534678.3539086,,cs.LG cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Federated learning (FL) is an important paradigm for training global models
from decentralized data in a privacy-preserving way. Existing FL methods
usually assume the global model can be trained on any participating client.
However, in real applications, the devices of clients are usually
heterogeneous, and have different computing power. Although big models like
BERT have achieved huge success in AI, it is difficult to apply them to
heterogeneous FL with weak clients. The straightforward solutions like removing
the weak clients or using a small model to fit all clients will lead to some
problems, such as under-representation of dropped clients and inferior accuracy
due to data loss or limited model representation ability. In this work, we
propose InclusiveFL, a client-inclusive federated learning method to handle
this problem. The core idea of InclusiveFL is to assign models of different
sizes to clients with different computing capabilities, bigger models for
powerful clients and smaller ones for weak clients. We also propose an
effective method to share the knowledge among multiple local models with
different sizes. In this way, all the clients can participate in the model
learning in FL, and the final model can be big and powerful enough. Besides, we
propose a momentum knowledge distillation method to better transfer knowledge
in big models on powerful clients to the small models on weak clients.
Extensive experiments on many real-world benchmark datasets demonstrate the
effectiveness of the proposed method in learning accurate models from clients
with heterogeneous devices under the FL framework.
","[{'version': 'v1', 'created': 'Wed, 16 Feb 2022 13:03:27 GMT'}, {'version': 'v2', 'created': 'Sun, 17 Jul 2022 14:22:39 GMT'}]",2022-07-19,"[['Liu', 'Ruixuan', ''], ['Wu', 'Fangzhao', ''], ['Wu', 'Chuhan', ''], ['Wang', 'Yanlin', ''], ['Lyu', 'Lingjuan', ''], ['Chen', 'Hong', ''], ['Xie', 'Xing', '']]","['Federated learning', 'Heterogeneous device', 'Knowledge distillation']"
12472,1912.08138,Zenon Gniazdowski,"Zenon Gniazdowski, Maciej Boniecki","Detection of a Source Code Plagiarism in a Student Programming
  Competition","21 pages, 9 figures","Zeszyty Naukowe WWSI, No 21, Vol. 13, 2018, pp. 74-94",10.26348/znwwsi.21.74,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The article presents a system for testing the independence of solutions to
algorithmic problems sent by students as part of the student programming
competition. First, the context was discussed, as well as the need to organize
programming competitions resulting from this context. Then, an algorithm was
proposed to study the mutual similarity of source codes of programs sent as
part of a programming competition. Since, after implementation, the algorithm
was used in practice, examples of its application for detecting the plagiarism
of source codes of solutions in two programming competitions conducted as part
of classes on Algorithms and Numerical Methods were also presented. Finally,
the effectiveness of the solutions used in the work was discussed.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2019 17:10:20 GMT'}]",2019-12-18,"[['Gniazdowski', 'Zenon', ''], ['Boniecki', 'Maciej', '']]","['source code plagiarism', 'Levenshtein distance', 'Levenshtein similarity', 'similarityrelation', 'propensity to plagiarism']"
12473,2204.14137,Nick Fischer,"Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos",Improved Sublinear-Time Edit Distance for Preprocessed Strings,Appears at ICALP '22,,10.4230/LIPIcs.ICALP.2022.32,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  We study the problem of approximating the edit distance of two strings in
sublinear time, in a setting where one or both string(s) are preprocessed, as
initiated by Goldenberg, Rubinstein, Saha (STOC '20). Specifically, in the $(k,
K)$-gap edit distance problem, the goal is to distinguish whether the edit
distance of two strings is at most $k$ or at least $K$. We obtain the following
results:
  * After preprocessing one string in time $n^{1+o(1)}$, we can solve $(k, k
\cdot n^{o(1)})$-gap edit distance in time $(n/k + k) \cdot n^{o(1)}$.
  * After preprocessing both strings separately in time $n^{1+o(1)}$, we can
solve $(k, k \cdot n^{o(1)})$-gap edit distance in time $k \cdot n^{o(1)}$.
  Both results improve upon some previously best known result, with respect to
either the gap or the query time or the preprocessing time.
  Our algorithms build on the framework by Andoni, Krauthgamer and Onak (FOCS
'10) and the recent sublinear-time algorithm by Bringmann, Cassis, Fischer and
Nakos (STOC '22). We replace many complicated parts in their algorithm by
faster and simpler solutions which exploit the preprocessing.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2022 14:47:16 GMT'}]",2022-10-13,"[['Bringmann', 'Karl', ''], ['Cassis', 'Alejandro', ''], ['Fischer', 'Nick', ''], ['Nakos', 'Vasileios', '']]","['Edit Distance', 'Property Testing', 'Preprocessing', 'Precision Sampling']"
12474,1805.01788,Asia Biega,"Asia J. Biega, Krishna P. Gummadi, Gerhard Weikum",Equity of Attention: Amortizing Individual Fairness in Rankings,Accepted to SIGIR 2018,,10.1145/3209978.3210063,,cs.IR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rankings of people and items are at the heart of selection-making,
match-making, and recommender systems, ranging from employment sites to sharing
economy platforms. As ranking positions influence the amount of attention the
ranked subjects receive, biases in rankings can lead to unfair distribution of
opportunities and resources, such as jobs or income.
  This paper proposes new measures and mechanisms to quantify and mitigate
unfairness from a bias inherent to all rankings, namely, the position bias,
which leads to disproportionately less attention being paid to low-ranked
subjects. Our approach differs from recent fair ranking approaches in two
important ways. First, existing works measure unfairness at the level of
subject groups while our measures capture unfairness at the level of individual
subjects, and as such subsume group unfairness. Second, as no single ranking
can achieve individual attention fairness, we propose a novel mechanism that
achieves amortized fairness, where attention accumulated across a series of
rankings is proportional to accumulated relevance.
  We formulate the challenge of achieving amortized individual fairness subject
to constraints on ranking quality as an online optimization problem and show
that it can be solved as an integer linear program. Our experimental evaluation
reveals that unfair attention distribution in rankings can be substantial, and
demonstrates that our method can improve individual fairness while retaining
high ranking quality.
","[{'version': 'v1', 'created': 'Fri, 4 May 2018 13:58:48 GMT'}]",2018-05-07,"[['Biega', 'Asia J.', ''], ['Gummadi', 'Krishna P.', ''], ['Weikum', 'Gerhard', '']]","['Algorithmic Fairness', 'Fair Ranking', 'Position Bias', 'Exposure']"
12475,2104.02980,Pierre Gutierrez,"Pierre Gutierrez, Maria Luschkova, Antoine Cordier, Mustafa Shukor,
  Mona Schappert, and Tim Dahmen","Synthetic training data generation for deep learning based quality
  inspection","8 pages, 4 figures, to be published in QCAV 2021 conference,
  proceedings will by published by SPIE",,10.1117/12.2586824,,cs.CV cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Deep learning is now the gold standard in computer vision-based quality
inspection systems. In order to detect defects, supervised learning is often
utilized, but necessitates a large amount of annotated images, which can be
costly: collecting, cleaning, and annotating the data is tedious and limits the
speed at which a system can be deployed as everything the system must detect
needs to be observed first. This can impede the inspection of rare defects,
since very few samples can be collected by the manufacturer. In this work, we
focus on simulations to solve this issue. We first present a generic simulation
pipeline to render images of defective or healthy (non defective) parts. As
metallic parts can be highly textured with small defects like holes, we design
a texture scanning and generation method. We assess the quality of the
generated images by training deep learning networks and by testing them on real
data from a manufacturer. We demonstrate that we can achieve encouraging
results on real defect detection using purely simulated data. Additionally, we
are able to improve global performances by concatenating simulated and real
data, showing that simulations can complement real images to boost
performances. Lastly, using domain adaptation techniques helps improving
slightly our final results.
","[{'version': 'v1', 'created': 'Wed, 7 Apr 2021 08:07:57 GMT'}]",2021-07-23,"[['Gutierrez', 'Pierre', ''], ['Luschkova', 'Maria', ''], ['Cordier', 'Antoine', ''], ['Shukor', 'Mustafa', ''], ['Schappert', 'Mona', ''], ['Dahmen', 'Tim', '']]","['visual inspection', 'computer vision', 'deep learning', 'simulations', '3d rendering', 'domain adaptation', 'domain randomization', 'sim2real']"
12476,2203.09023,Antonios Saravanos,"Antonios Saravanos (1), Dongnanzi Zheng (1), Stavros Zervoudakis (1)
  ((1) New York University)",Measuring Consumer Perceived Warm-Glow for Technology Adoption Modeling,,,10.1145/3545922.3545938,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we adapt and validate two constructs-perceived extrinsic
warm-glow (PEWG) and perceived intrinsic warm-glow (PIWG)-to measure the two
dimensions of consumer perceived warm-glow (i.e., extrinsic and intrinsic) for
use with the practice of technology adoption modeling. Taking an experimental
approach, participants were exposed to one of four vignettes designed to
simulate either the absence or the presence of warm-glow (specifically,
extrinsic warm-glow, intrinsic warm-glow, and concurrently extrinsic and
intrinsic warm-glow). The results revealed that both constructs measured their
respective forms of warm-glow with two caveats. Firstly, singularly trying to
evoke extrinsic warm-glow led to only a slight increase in consumer perception
of extrinsic warm-glow. We attributed this finding to individuals not being
attracted to technology products that overtly target and seek to satisfy their
vanity, instead preferring technology that does so in a more subtle way. The
second is that singularly trying to evoke intrinsic warm-glow also resulted in
the manifestation of extrinsic warm-glow. Thus, warm-glow appears as a blend of
extrinsic and intrinsic dimensions. This finding serves to reinforce what has
already been reported in existing literature regarding warm-glow and the idea
of impure altruism.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2022 01:50:55 GMT'}, {'version': 'v2', 'created': 'Sat, 28 May 2022 00:29:41 GMT'}, {'version': 'v3', 'created': 'Mon, 20 Jun 2022 22:53:53 GMT'}, {'version': 'v4', 'created': 'Wed, 29 Jun 2022 12:03:00 GMT'}]",2022-06-30,"[['Saravanos', 'Antonios', '', 'New York University'], ['Zheng', 'Dongnanzi', '', 'New York University'], ['Zervoudakis', 'Stavros', '', 'New York University']]","['warm-glow', 'extrinsic warm-glow', 'intrinsic warm-glow', 'technology adoption', 'good tech']"
12477,2101.10453,Abhilash Singh,"Abhilash Singh, Sandeep Sharma, Jitenda Singh","Nature-Inspired Algorithms for Wireless Sensor Networks: A Comprehensive
  Survey",,Computer Science Review (2020) 100342,10.1016/j.cosrev.2020.100342,,cs.NI cs.NE,http://creativecommons.org/licenses/by/4.0/,"  In order to solve the critical issues in Wireless Sensor Networks (WSNs),
with concern for limited sensor lifetime, nature-inspired algorithms are
emerging as a suitable method. Getting optimal network coverage is one of those
challenging issues that need to be examined critically before any network
setup. Optimal network coverage not only minimizes the consumption of limited
energy of battery-driven sensors but also reduce the sensing of redundant
information. In this paper, we focus on nature-inspired optimization algorithms
concerning the optimal coverage in WSNs. In the first half of the paper, we
have briefly discussed the taxonomy of the optimization algorithms along with
the problem domains in WSNs. In the second half of the paper, we have compared
the performance of two nature-inspired algorithms for getting optimal coverage
in WSNs. The first one is a combined Improved Genetic Algorithm and Binary Ant
Colony Algorithm (IGABACA), and the second one is Lion Optimization (LO). The
simulation results confirm that LO gives better network coverage, and the
convergence rate of LO is faster than that of IGA-BACA. Further, we observed
that the optimal coverage is achieved at a lesser number of generations in LO
as compared to IGA-BACA. This review will help researchers to explore the
applications in this field as well as beyond this area. Keywords: Optimal
Coverage, Bio-inspired Algorithm, Lion Optimization, WSNs.
","[{'version': 'v1', 'created': 'Thu, 24 Dec 2020 05:30:04 GMT'}]",2021-01-27,"[['Singh', 'Abhilash', ''], ['Sharma', 'Sandeep', ''], ['Singh', 'Jitenda', '']]","['Optimal Coverage', 'Bio-inspired Algorithm', 'Lion Optimization', 'WSNs']"
12478,1902.03365,Guangcun Shan,"Yinghong Fang, Guangcun Shan, Xin Li, Wenliang Liu, Tian Wang, Hichem
  Snoussi","HE-SLAM: a Stereo SLAM System Based on Histogram Equalization and ORB
  Features","7 pages, 2 figures, 2018 Chinese Automation Congress (CAC)",,10.1109/CAC.2018.8623424,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the real-life environments, due to the sudden appearance of windows,
lights, and objects blocking the light source, the visual SLAM system can
easily capture the low-contrast images caused by over-exposure or
over-darkness. At this time, the direct method of estimating camera motion
based on pixel luminance information is infeasible, and it is often difficult
to find enough valid feature points without image processing. This paper
proposed HE-SLAM, a new method combining histogram equalization and ORB feature
extraction, which can be robust in more scenes, especially in stages with
low-contrast images. Because HE-SLAM uses histogram equalization to improve the
contrast of images, it can extract enough valid feature points in low-contrast
images for subsequent feature matching, keyframe selection, bundle adjustment,
and loop closure detection. The proposed HE-SLAM has been tested on the popular
datasets (such as KITTI and EuRoc), and the real-time performance and
robustness of the system are demonstrated by comparing system runtime and the
mean square root error (RMSE) of absolute trajectory error (ATE) with
state-of-the-art methods like ORB-SLAM2.
","[{'version': 'v1', 'created': 'Sat, 9 Feb 2019 03:23:41 GMT'}]",2019-02-12,"[['Fang', 'Yinghong', ''], ['Shan', 'Guangcun', ''], ['Li', 'Xin', ''], ['Liu', 'Wenliang', ''], ['Wang', 'Tian', ''], ['Snoussi', 'Hichem', '']]","['stereo visual SLAM', 'low-contrast images', 'histogram equalization', 'ORB features']"
12479,2104.07736,Yiming Tang,"Yiming Tang, Allan Spektor, Raffi Khatchadourian, Mehdi Bagherzadeh","Automated Evolution of Feature Logging Statement Levels Using Git
  Histories and Degree of Interest","37 pages, 1 figure","Science of Computer Programming, 2022-02, Vol. 214, p.102724",10.1016/j.scico.2021.102724,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Logging -- used for system events and security breaches to describe more
informational yet essential aspects of software features -- is pervasive. Given
the high transactionality of today's software, logging effectiveness can be
reduced by information overload. Log levels help alleviate this problem by
correlating a priority to logs that can be later filtered. As software evolves,
however, levels of logs documenting surrounding feature implementations may
also require modification as features once deemed important may have decreased
in urgency and vice-versa. We present an automated approach that assists
developers in evolving levels of such (feature) logs. The approach, based on
mining Git histories and manipulating a degree of interest (DOI) model,
transforms source code to revitalize feature log levels based on the
""interestingness"" of the surrounding code. Built upon JGit and Mylyn, the
approach is implemented as an Eclipse IDE plug-in and evaluated on 18 Java
projects with $\sim$3 million lines of code and $\sim$4K log statements. Our
tool successfully analyzes 99.22% of logging statements, increases log level
distributions by $\sim$20%, and increases the focus of logs in bug fix contexts
$\sim$83% of the time. Moreover, pull (patch) requests were integrated into
large and popular open-source projects. The results indicate that the approach
is promising in assisting developers in evolving feature log levels.
","[{'version': 'v1', 'created': 'Thu, 15 Apr 2021 19:30:11 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Jul 2021 13:25:15 GMT'}, {'version': 'v3', 'created': 'Tue, 7 Sep 2021 18:09:35 GMT'}, {'version': 'v4', 'created': 'Mon, 13 Sep 2021 02:27:41 GMT'}]",2022-07-20,"[['Tang', 'Yiming', ''], ['Spektor', 'Allan', ''], ['Khatchadourian', 'Raffi', ''], ['Bagherzadeh', 'Mehdi', '']]","['logging', 'software evolution', 'software repository mining', 'software']"
12480,1704.03379,Pim Moeskops,"Pim Moeskops, Jelmer M. Wolterink, Bas H.M. van der Velden, Kenneth
  G.A. Gilhuijs, Tim Leiner, Max A. Viergever, Ivana I\v{s}gum","Deep Learning for Multi-Task Medical Image Segmentation in Multiple
  Modalities",,"Moeskops, P., Wolterink, J.M., van der Velden, B.H.M., Gilhuijs,
  K.G.A., Leiner, T., Viergever, M.A., I\v{s}gum, I. Deep learning for
  multi-task medical image segmentation in multiple modalities. In: MICCAI
  2016, pp. 478-486",10.1007/978-3-319-46723-8_55,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic segmentation of medical images is an important task for many
clinical applications. In practice, a wide range of anatomical structures are
visualised using different imaging modalities. In this paper, we investigate
whether a single convolutional neural network (CNN) can be trained to perform
different segmentation tasks.
  A single CNN is trained to segment six tissues in MR brain images, the
pectoral muscle in MR breast images, and the coronary arteries in cardiac CTA.
The CNN therefore learns to identify the imaging modality, the visualised
anatomical structures, and the tissue classes.
  For each of the three tasks (brain MRI, breast MRI and cardiac CTA), this
combined training procedure resulted in a segmentation performance equivalent
to that of a CNN trained specifically for that task, demonstrating the high
capacity of CNN architectures. Hence, a single system could be used in clinical
practice to automatically perform diverse segmentation tasks without
task-specific training.
","[{'version': 'v1', 'created': 'Tue, 11 Apr 2017 15:52:34 GMT'}]",2017-04-12,"[['Moeskops', 'Pim', ''], ['Wolterink', 'Jelmer M.', ''], ['van der Velden', 'Bas H. M.', ''], ['Gilhuijs', 'Kenneth G. A.', ''], ['Leiner', 'Tim', ''], ['Viergever', 'Max A.', ''], ['Išgum', 'Ivana', '']]","['Deep learning', 'Convolutional neural networks', 'Medical image segmentation', 'Brain MRI', 'Breast MRI', 'Cardiac CTA']"
12481,2001.08849,Gang Mei,"Zenan Huo, Gang Mei, Nengxiong Xu","juSFEM: A Julia-based Open-source Package of Parallel Smoothed Finite
  Element Method (S-FEM) for Elastic Problems","Revised version submitted to Computers & Mathematics with
  Applications on Dec. 4, 2019","Computers & Mathematics with Applications, 2020",10.1016/j.camwa.2020.01.027,,cs.MS cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Smoothed Finite Element Method (S-FEM) proposed by Liu G.R. can achieve
more accurate results than the conventional FEM. Currently, much commercial
software and many open-source packages have been developed to analyze various
science and engineering problems using the FEM. However, there is little work
focusing on designing and developing software or packages for the S-FEM. In
this paper, we design and implement an open-source package of the parallel
S-FEM for elastic problems by utilizing the Julia language on multi-core CPU.
The Julia language is a fast, easy-to-use, and open-source programming language
that was originally designed for high-performance computing. We term our
package as juSFEM. To the best of the authors knowledge, juSFEM is the first
package of parallel S-FEM developed with the Julia language. To verify the
correctness and evaluate the efficiency of juSFEM, two groups of benchmark
tests are conducted. The benchmark results show that (1) juSFEM can achieve
accurate results when compared to commercial FEM software ABAQUS, and (2)
juSFEM only requires 543 seconds to calculate the displacements of a 3D elastic
cantilever beam model which is composed of approximately 2 million tetrahedral
elements, while in contrast the commercial FEM software needs 930 seconds for
the same calculation model; (3) the parallel juSFEM executed on the 24-core CPU
is approximately 20x faster than the corresponding serial version. Moreover,
the structure and function of juSFEM are easily modularized, and the code in
juSFEM is clear and readable, which is convenient for further development.
","[{'version': 'v1', 'created': 'Thu, 23 Jan 2020 23:37:15 GMT'}]",2020-02-21,"[['Huo', 'Zenan', ''], ['Mei', 'Gang', ''], ['Xu', 'Nengxiong', '']]","['Smoothed Finite Element Method (S-FEM)', 'Parallel Algorithm', 'Julia Language', 'Computational Efficiency', 'Computational Accuracy']"
12482,2206.13829,Davide Alessandro Coccomini,"Davide Alessandro Coccomini, Roberto Caldelli, Fabrizio Falchi,
  Claudio Gennaro, Giuseppe Amato","Cross-Forgery Analysis of Vision Transformers and CNNs for Deepfake
  Image Detection",,,10.1145/3512732.3533582,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deepfake Generation Techniques are evolving at a rapid pace, making it
possible to create realistic manipulated images and videos and endangering the
serenity of modern society. The continual emergence of new and varied
techniques brings with it a further problem to be faced, namely the ability of
deepfake detection models to update themselves promptly in order to be able to
identify manipulations carried out using even the most recent methods. This is
an extremely complex problem to solve, as training a model requires large
amounts of data, which are difficult to obtain if the deepfake generation
method is too recent. Moreover, continuously retraining a network would be
unfeasible. In this paper, we ask ourselves if, among the various deep learning
techniques, there is one that is able to generalise the concept of deepfake to
such an extent that it does not remain tied to one or more specific deepfake
generation methods used in the training set. We compared a Vision Transformer
with an EfficientNetV2 on a cross-forgery context based on the ForgeryNet
dataset. From our experiments, It emerges that EfficientNetV2 has a greater
tendency to specialize often obtaining better results on training methods while
Vision Transformers exhibit a superior generalization ability that makes them
more competent even on images generated with new methodologies.
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2022 08:50:22 GMT'}]",2022-06-29,"[['Coccomini', 'Davide Alessandro', ''], ['Caldelli', 'Roberto', ''], ['Falchi', 'Fabrizio', ''], ['Gennaro', 'Claudio', ''], ['Amato', 'Giuseppe', '']]","['Deep Fake Detection', 'Transformer Networks', 'Deep Learning']"
12483,2202.03392,Liangwei Yang,"Liangwei Yang, Zhiwei Liu, Yu Wang, Chen Wang, Ziwei Fan, Philip S. Yu","Large-scale Personalized Video Game Recommendation via Social-aware
  Contextualized Graph Neural Network",,,10.1145/3485447.3512273,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Because of the large number of online games available nowadays, online game
recommender systems are necessary for users and online game platforms. The
former can discover more potential online games of their interests, and the
latter can attract users to dwell longer in the platform. This paper
investigates the characteristics of user behaviors with respect to the online
games on the Steam platform. Based on the observations, we argue that a
satisfying recommender system for online games is able to characterize:
personalization, game contextualization and social connection. However,
simultaneously solving all is rather challenging for game recommendation.
Firstly, personalization for game recommendation requires the incorporation of
the dwelling time of engaged games, which are ignored in existing methods.
Secondly, game contextualization should reflect the complex and high-order
properties of those relations. Last but not least, it is problematic to use
social connections directly for game recommendations due to the massive noise
within social connections. To this end, we propose a Social-aware
Contextualized Graph Neural Recommender System (SCGRec), which harnesses three
perspectives to improve game recommendation. We conduct a comprehensive
analysis of users' online game behaviors, which motivates the necessity of
handling those three characteristics in the online game recommendation.
","[{'version': 'v1', 'created': 'Mon, 7 Feb 2022 18:29:39 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Feb 2022 00:04:35 GMT'}]",2022-02-14,"[['Yang', 'Liangwei', ''], ['Liu', 'Zhiwei', ''], ['Wang', 'Yu', ''], ['Wang', 'Chen', ''], ['Fan', 'Ziwei', ''], ['Yu', 'Philip S.', '']]","['Game Recommendation', 'Graph Neural Network', 'Personalization']"
12484,2006.00575,Artem Shelmanov,"Ozge Sevgili, Artem Shelmanov, Mikhail Arkhipov, Alexander Panchenko,
  Chris Biemann",Neural Entity Linking: A Survey of Models Based on Deep Learning,Published in Semantic Web journal,"Semantic Web, Vol. 13, Number 3, 2022",10.3233/SW-222986,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This survey presents a comprehensive description of recent neural entity
linking (EL) systems developed since 2015 as a result of the ""deep learning
revolution"" in natural language processing. Its goal is to systemize design
features of neural entity linking systems and compare their performance to the
remarkable classic methods on common benchmarks. This work distills a generic
architecture of a neural EL system and discusses its components, such as
candidate generation, mention-context encoding, and entity ranking, summarizing
prominent methods for each of them. The vast variety of modifications of this
general architecture are grouped by several common themes: joint entity mention
detection and disambiguation, models for global linking, domain-independent
techniques including zero-shot and distant supervision methods, and
cross-lingual approaches. Since many neural models take advantage of entity and
mention/context embeddings to represent their meaning, this work also overviews
prominent entity embedding techniques. Finally, the survey touches on
applications of entity linking, focusing on the recently emerged use-case of
enhancing deep pre-trained masked language models based on the Transformer
architecture.
","[{'version': 'v1', 'created': 'Sun, 31 May 2020 18:02:26 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Jan 2021 14:07:02 GMT'}, {'version': 'v3', 'created': 'Wed, 25 Aug 2021 12:51:07 GMT'}, {'version': 'v4', 'created': 'Thu, 7 Apr 2022 17:56:30 GMT'}]",2022-04-08,"[['Sevgili', 'Ozge', ''], ['Shelmanov', 'Artem', ''], ['Arkhipov', 'Mikhail', ''], ['Panchenko', 'Alexander', ''], ['Biemann', 'Chris', '']]","['Entity Linking', 'Deep Learning', 'Neural Networks', 'Natural Language Processing', 'Knowledge Graphs']"
12485,2003.07124,Fatih Semiz,Fatih Semiz and Faruk Polat,"Solving Area Coverage Problem with UAVs: A Vehicle Routing with Time
  Windows Variation",,"Robotics and Autonomous Systems, 126, April 2020, 103435",10.1016/j.robot.2020.103435,,cs.AI cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In real life, providing security for a set of large areas by covering the
area with Unmanned Aerial Vehicles (UAVs) is a difficult problem that consist
of multiple objectives. These difficulties are even greater if the area
coverage must continue throughout a specific time window. We address this by
considering a Vehicle Routing Problem with Time Windows (VRPTW) variation in
which capacity of agents is one and each customer (target area) must be
supplied with more than one vehicles simultaneously without violating time
windows. In this problem, our aim is to find a way to cover all areas with the
necessary number of UAVs during the time windows, minimize the total distance
traveled, and provide a fast solution by satisfying the additional constraint
that each agent has limited fuel. We present a novel algorithm that relies on
clustering the target areas according to their time windows, and then
incrementally generating transportation problems with each cluster and the
ready UAVs. Then we solve transportation problems with the simplex algorithm to
generate the solution. The performance of the proposed algorithm and other
implemented algorithms to compare the solution quality is evaluated on example
scenarios with practical problem sizes.
","[{'version': 'v1', 'created': 'Mon, 16 Mar 2020 11:27:21 GMT'}]",2020-03-17,"[['Semiz', 'Fatih', ''], ['Polat', 'Faruk', '']]","['vehicle routing problem', 'unmanned aerial vehicle', 'VRPTW', 'transportation problem', 'simplex algorithm']"
12486,1810.00041,Carmine Dodaro,"Francesco Calimeri, Carmine Dodaro, Davide Fusc\`a, Simona Perri,
  Jessica Zangari",Efficiently Coupling the I-DLV Grounder with ASP Solvers,"Under consideration in Theory and Practice of Logic Programming
  (TPLP). 19 pages, 4 figures",Theory and Practice of Logic Programming 20 (2020) 205-224,10.1017/S1471068418000546,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present I-DLV+MS , a new Answer Set Programming (ASP) system that
integrates an efficient grounder, namely I-DLV, with an automatic selector that
inductively chooses a solver: depending on some inherent features of the
instantiation produced by I-DLV, machine learning techniques guide the
selection of the most appropriate solver. The system participated in the latest
(7th) ASP competition, winning the regular track, category SP (i.e., one
processor allowed). Under consideration in Theory and Practice of Logic
Programming (TPLP).
","[{'version': 'v1', 'created': 'Fri, 28 Sep 2018 18:49:34 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Oct 2018 10:55:20 GMT'}]",2020-02-19,"[['Calimeri', 'Francesco', ''], ['Dodaro', 'Carmine', ''], ['Fuscà', 'Davide', ''], ['Perri', 'Simona', ''], ['Zangari', 'Jessica', '']]","['Knowledge Representation and Reasoning', 'Answer Set Programming', 'Artificial Intelligence', 'Deductive Database Systems', 'DLV', 'Grounding', 'Instantiation']"
12487,1912.12616,Sherif Tarabishy,"Sherif Tarabishy, Stamatios Psarras, Marcin Kosicki, Martha Tsigkari",Deep learning surrogate models for spatial and visual connectivity,"Accepted manuscript in the International Journal of Architectural
  Computing (2019)",,10.1177/1478077119894483,,cs.LG cs.CV eess.IV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spatial and visual connectivity are important metrics when developing
workplace layouts. Calculating those metrics in real-time can be difficult,
depending on the size of the floor plan being analysed and the resolution of
the analyses. This paper investigates the possibility of considerably speeding
up the outcomes of such computationally intensive simulations by using machine
learning to create models capable of identifying the spatial and visual
connectivity potential of a space. To that end we present the entire process of
investigating different machine learning models and a pipeline for training
them on such task, from the incorporation of a bespoke spatial and visual
connectivity analysis engine through a distributed computation pipeline, to the
process of synthesizing training data and evaluating the performance of
different neural networks.
","[{'version': 'v1', 'created': 'Sun, 29 Dec 2019 09:17:19 GMT'}]",2020-01-01,"[['Tarabishy', 'Sherif', ''], ['Psarras', 'Stamatios', ''], ['Kosicki', 'Marcin', ''], ['Tsigkari', 'Martha', '']]","['Algorithmic and evolutionary techniques', 'Performance and simulation', 'Machine learning']"
12488,1710.08802,Eric Kerrigan,"Bulat Khusainov, Eric C. Kerrigan, George A. Constantinides","Automatic Software and Computing Hardware Co-design for Predictive
  Control",,"IEEE Transactions on Control Systems Technology (Volume: 27,
  Issue: 5, Sept. 2019)",10.1109/TCST.2018.2855666,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Model Predictive Control (MPC) is a computationally demanding control
technique that allows dealing with multiple-input and multiple-output systems,
while handling constraints in a systematic way. The necessity of solving an
optimization problem at every sampling instant often (i) limits the application
scope to slow dynamical systems and/or (ii) results in expensive computational
hardware implementations. Traditional MPC design is based on manual tuning of
software and computational hardware design parameters, which leads to
suboptimal implementations. This paper proposes a framework for automating the
MPC software and computational hardware co-design, while achieving the optimal
trade-off between computational resource usage and controller performance. The
proposed approach is based on using a multi-objective optimization algorithm,
namely BiMADS. Two test studies are considered: Central Processing Unit (CPU)
and Field-Programmable Gate Array (FPGA) implementations of fast gradient-based
MPC. Numerical experiments show that optimization-based design outperforms
Latin Hypercube Sampling (LHS), a statistical sampling-based design exploration
technique.
","[{'version': 'v1', 'created': 'Tue, 24 Oct 2017 14:31:40 GMT'}]",2021-12-16,"[['Khusainov', 'Bulat', ''], ['Kerrigan', 'Eric C.', ''], ['Constantinides', 'George A.', '']]","['Model predictive control', 'Hardware-software co-design', 'FPGA', 'Multi-objective optimization']"
12489,2110.06116,Ben Dai,"Ben Dai, Xiaotong Shen, and Wei Pan",Two-level monotonic multistage recommender systems,,2021,10.1214/21-EJS1924,,cs.IR cs.LG math.ST stat.ML stat.TH,http://creativecommons.org/licenses/by/4.0/,"  A recommender system learns to predict the user-specific preference or
intention over many items simultaneously for all users, making personalized
recommendations based on a relatively small number of observations. One central
issue is how to leverage three-way interactions, referred to as user-item-stage
dependencies on a monotonic chain of events, to enhance the prediction
accuracy. A monotonic chain of events occurs, for instance, in an article
sharing dataset, where a ``follow'' action implies a ``like'' action, which in
turn implies a ``view'' action. In this article, we develop a multistage
recommender system utilizing a two-level monotonic property characterizing a
monotonic chain of events for personalized prediction. Particularly, we derive
a large-margin classifier based on a nonnegative additive latent factor model
in the presence of a high percentage of missing observations, particularly
between stages, reducing the number of model parameters for personalized
prediction while guaranteeing prediction consistency. On this ground, we derive
a regularized cost function to learn user-specific behaviors at different
stages, linking decision functions to numerical and categorical covariates to
model user-item-stage interactions. Computationally, we derive an algorithm
based on blockwise coordinate descent. Theoretically, we show that the
two-level monotonic property enhances the accuracy of learning as compared to a
standard method treating each stage individually and an ordinal method
utilizing only one-level monotonicity. Finally, the proposed method compares
favorably with existing methods in simulations and an article sharing dataset.
","[{'version': 'v1', 'created': 'Wed, 6 Oct 2021 08:50:32 GMT'}]",2022-09-21,"[['Dai', 'Ben', ''], ['Shen', 'Xiaotong', ''], ['Pan', 'Wei', '']]","['Monotonicity', 'Nonconvex Minimization', 'Explicit/implicit Feedback', 'Nonnegative Latent Factor Model']"
12490,2007.05066,Azdine Nait-Ali,"Sami Ben Elhaj Salah, Azdine Nait-Ali, Mikael Gueguen, Carole
  Nadot-Martin","Non-local modeling with asymptotic expansion homogenization of random
  materials",,,10.1016/j.mechmat.2020.103459,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  The aim of this study is to build a non-local homogenized model for
three-dimensional composites with inclusions randomly embedded within a matrix
according to a stochastic point process w in a bounded open set associated with
a suitable probability space). Both phases were linear elastic. Asymptotic
expansion homogenization (AEH) was revisited by taking into account the
stochastic parameter representing the inclusion centers distribution. The
macroscopic behavior was then studied by combining the variational approach
with the mean-ergodicity.
","[{'version': 'v1', 'created': 'Wed, 8 Jul 2020 06:42:21 GMT'}]",2020-07-13,"[['Salah', 'Sami Ben Elhaj', ''], ['Nait-Ali', 'Azdine', ''], ['Gueguen', 'Mikael', ''], ['Nadot-Martin', 'Carole', '']]","['Heterogeneous material', 'Non-local phenomenon', 'Second gradient theory', 'Asymptoticanalysis', 'Homogenization theory']"
12491,2008.07688,Vaibhav Kumar,Vaibhav Kumar and Vikas Raunak and Jamie Callan,Ranking Clarification Questions via Natural Language Inference,Accepted at CIKM 2020,,10.1145/3340531.3412137,,cs.LG cs.AI cs.IR stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Given a natural language query, teaching machines to ask clarifying questions
is of immense utility in practical natural language processing systems. Such
interactions could help in filling information gaps for better machine
comprehension of the query. For the task of ranking clarification questions, we
hypothesize that determining whether a clarification question pertains to a
missing entry in a given post (on QA forums such as StackExchange) could be
considered as a special case of Natural Language Inference (NLI), where both
the post and the most relevant clarification question point to a shared latent
piece of information or context. We validate this hypothesis by incorporating
representations from a Siamese BERT model fine-tuned on NLI and Multi-NLI
datasets into our models and demonstrate that our best performing model obtains
a relative performance improvement of 40 percent and 60 percent respectively
(on the key metric of Precision@1), over the state-of-the-art baseline(s) on
the two evaluation sets of the StackExchange dataset, thereby, significantly
surpassing the state-of-the-art.
","[{'version': 'v1', 'created': 'Tue, 18 Aug 2020 01:32:29 GMT'}]",2020-08-19,"[['Kumar', 'Vaibhav', ''], ['Raunak', 'Vikas', ''], ['Callan', 'Jamie', '']]","['Clarification Question', 'Natural Language Inference', 'BERT']"
12492,2109.06931,Keren Zhou,"Keren Zhou, Laksono Adhianto, Jonathon Anderson, Aaron Cherian, Dejan
  Grubisic, Mark Krentel, Yumeng Liu, Xiaozhu Meng, John Mellor-Crummey",Measurement and Analysis of GPU-accelerated Applications with HPCToolkit,,Parallel Computing 2021,10.1016/j.parco.2021.102837,,cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  To address the challenge of performance analysis on the US DOE's forthcoming
exascale supercomputers, Rice University has been extending its HPCToolkit
performance tools to support measurement and analysis of GPU-accelerated
applications. To help developers understand the performance of accelerated
applications as a whole, HPCToolkit's measurement and analysis tools attribute
metrics to calling contexts that span both CPUs and GPUs. To measure
GPU-accelerated applications efficiently, HPCToolkit employs a novel wait-free
data structure to coordinate monitoring and attribution of GPU performance. To
help developers understand the performance of complex GPU code generated from
high-level programming models, HPCToolkit constructs sophisticated
approximations of call path profiles for GPU computations. To support
fine-grained analysis and tuning, HPCToolkit uses PC sampling and
instrumentation to measure and attribute GPU performance metrics to source
lines, loops, and inlined code. To supplement fine-grained measurements,
HPCToolkit can measure GPU kernel executions using hardware performance
counters. To provide a view of how an execution evolves over time, HPCToolkit
can collect, analyze, and visualize call path traces within and across nodes.
Finally, on NVIDIA GPUs, HPCToolkit can derive and attribute a collection of
useful performance metrics based on measurements using GPU PC samples. We
illustrate HPCToolkit's new capabilities for analyzing GPU-accelerated
applications with several codes developed as part of the Exascale Computing
Project.
","[{'version': 'v1', 'created': 'Tue, 14 Sep 2021 19:07:58 GMT'}]",2021-09-16,"[['Zhou', 'Keren', ''], ['Adhianto', 'Laksono', ''], ['Anderson', 'Jonathon', ''], ['Cherian', 'Aaron', ''], ['Grubisic', 'Dejan', ''], ['Krentel', 'Mark', ''], ['Liu', 'Yumeng', ''], ['Meng', 'Xiaozhu', ''], ['Mellor-Crummey', 'John', '']]","['Supercomputers', 'high performance computing', 'software performance', 'performance analysis']"
12493,1807.10442,Ali Dehghantanha,"James Baldwin, Ali Dehghantanha","Leveraging Support Vector Machine for Opcode Density Based Detection of
  Crypto-Ransomware",28 Pages,,10.1007/978-3-319-73951-9_6,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Ransomware is a significant global threat, with easy deployment due to the
prevalent ransomware-as-a-service model. Machine learning algorithms
incorporating the use of opcode characteristics and Support Vector Machine have
been demonstrated to be a successful method for general malware detection. This
research focuses on crypto-ransomware and uses static analysis of malicious and
benign Portable Executable files to extract 443 opcodes across all samples,
representing them as density histograms within the dataset. Using the SMO
classifier and PUK kernel in the WEKA machine learning toolset it demonstrates
that this methodology can achieve 100% precision when differentiating between
ransomware and goodware, and 96.5% when differentiating between 5
cryptoransomware families and goodware. Moreover, 8 different attribute
selection methods are evaluated to achieve significant feature reduction. Using
the CorrelationAttributeEval method close to 100% precision can be maintained
with a feature reduction of 59.5%. The CFSSubset filter achieves the highest
feature reduction of 97.7% however with a slightly lower precision at 94.2%.
","[{'version': 'v1', 'created': 'Fri, 27 Jul 2018 05:36:34 GMT'}]",2018-07-30,"[['Baldwin', 'James', ''], ['Dehghantanha', 'Ali', '']]","['Malware', 'ransomware', 'ransomware detection', 'ransomware family detection']"
12494,2007.02766,Samiran Ganguly,"Samiran Ganguly, Avik W. Ghosh",Building Reservoir Computing Hardware Using Low Energy-Barrier Magnetics,"To be presented at International Conference on Neuromorphic Systems
  2020",,10.1145/3407197.3407217,,cs.ET cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Biologically inspired recurrent neural networks, such as reservoir computers
are of interest in designing spatio-temporal data processors from a hardware
point of view due to the simple learning scheme and deep connections to Kalman
filters. In this work we discuss using in-depth simulation studies a way to
construct hardware reservoir computers using an analog stochastic neuron cell
built from a low energy-barrier magnet based magnetic tunnel junction and a few
transistors. This allows us to implement a physical embodiment of the
mathematical model of reservoir computers. Compact implementation of reservoir
computers using such devices may enable building compact, energy-efficient
signal processors for standalone or in-situ machine cognition in edge devices.
","[{'version': 'v1', 'created': 'Mon, 6 Jul 2020 14:11:45 GMT'}]",2020-07-09,"[['Ganguly', 'Samiran', ''], ['Ghosh', 'Avik W.', '']]","['Spintronics', 'Stochastic Magnetics', 'Reservoir Computing', 'Kalman filters', 'Neuromorphics']"
12495,2007.00278,Daniele Pellegrini,"Maria Girardi, Cristina Padovani, Daniele Pellegrini, Leonardo Robol",A finite element model updating method based on global optimization,"62 pages, 16 figures",,10.1016/j.ymssp.2020.107372,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finite element model updating of a structure made of linear elastic materials
is based on the solution of a minimization problem. The goal is to find some
unknown parameters of the finite element model (elastic moduli, mass densities,
constraints and boundary conditions) that minimize an objective function which
evaluates the discrepancy between experimental and numerical dynamic
properties. The objective function depends nonlinearly on the parameters and
may have multiple local minimum points. This paper presents a numerical method
able to find a global minimum point and assess its reliability. The numerical
method has been tested on two simulated examples - a masonry tower and a domed
temple - and validated via a generic genetic algorithm and a global sensitivity
analysis tool. A real case study monitored under operational conditions has
also been addressed, and the structure's experimental modal properties have
been used in the model updating procedure to estimate the mechanical properties
of its constituent materials.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2020 07:09:55 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Dec 2020 09:48:03 GMT'}]",2021-02-24,"[['Girardi', 'Maria', ''], ['Padovani', 'Cristina', ''], ['Pellegrini', 'Daniele', ''], ['Robol', 'Leonardo', '']]","['Modal analysis', 'finite elements', 'model updating', 'global']"
12496,2206.12413,Jing Tan,Jing Tan and Lars Braubach and Kai Jander and Rongjun Xu and Kai Chen,"A Novel Multi-Agent Scheduling Mechanism for Adaptation of Production
  Plans in Case of Supply Chain Disruptions",,,10.3233/AIC-200646,,cs.AI cs.MA math.OC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Manufacturing companies typically use sophisticated production planning
systems optimizing production steps, often delivering near-optimal solutions.
As a downside for delivering a near-optimal schedule, planning systems have
high computational demands resulting in hours of computation. Under normal
circumstances this is not issue if there is enough buffer time before
implementation of the schedule (e.g. at night for the next day). However, in
case of unexpected disruptions such as delayed part deliveries or defectively
manufactured goods, the planned schedule may become invalid and swift
replanning becomes necessary. Such immediate replanning is unsuited for
existing optimal planners due to the computational requirements. This paper
proposes a novel solution that can effectively and efficiently perform
replanning in case of different types of disruptions using an existing plan.
The approach is based on the idea to adhere to the existing schedule as much as
possible, adapting it based on limited local changes. For that purpose an
agent-based scheduling mechanism has been devised, in which agents represent
materials and production sites and use local optimization techniques and
negotiations to generate an adapted (sufficient, but non-optimal) schedule. The
approach has been evaluated using real production data from Huawei, showing
that efficient schedules are produced in short time. The system has been
implemented as proof of concept and is currently reimplemented and transferred
to a production system based on the Jadex agent platform.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2022 10:28:54 GMT'}]",2022-06-28,"[['Tan', 'Jing', ''], ['Braubach', 'Lars', ''], ['Jander', 'Kai', ''], ['Xu', 'Rongjun', ''], ['Chen', 'Kai', '']]","['supply chain management', 'multi-agent system', 'agent', 'simulation']"
12497,2301.07859,Daniel Morton,"Daniel Morton, Artemis Xu, Alberto Matute, Robert F. Shepherd",Autonomous Material Composite Morphing Wing,,,10.1177/00219983231151397,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Aeronautics research has continually sought to achieve the adaptability and
morphing performance of avian wings, but in practice, wings of all scales
continue to use the same hinged control-surface embodiment. Recent research
into compliant and bio-inspired mechanisms for morphing wings and control
surfaces has indicated promising results, though often these are mechanically
complex, or limited in the number of degrees-of-freedom (DOF) they can control.
Seeking to improve on these limitations, we apply a new paradigm denoted
Autonomous Material Composites to the design of avian-scale morphing wings.
With this methodology, we reduce the need for complex actuation and mechanisms,
and allow for three-dimensional placement of stretchable fiber optic strain
gauges (Optical Lace) throughout the metamaterial structure. This structure
centers around elastomeric conformal lattices, and by applying
functionally-graded warping and thickening to this lattice, we allow for local
tailoring of the compliance properties to fit the desired morphing. As a
result, the wing achieves high-deformation morphing in three DOF: twist,
camber, and extension/compression, with these morphed shapes effectively
modifying the aerodynamic performance of the wing, as demonstrated in
low-Reynolds wind tunnel testing. Our sensors also successfully demonstrate
differentiable trends across all degrees of morphing, enabling the future state
estimation and control of this wing.
","[{'version': 'v1', 'created': 'Thu, 19 Jan 2023 03:03:28 GMT'}]",2023-01-20,"[['Morton', 'Daniel', ''], ['Xu', 'Artemis', ''], ['Matute', 'Alberto', ''], ['Shepherd', 'Robert F.', '']]","['Autonomous material composites', 'morphing wings', 'soft robotics', 'compliant lattice structures', 'metamaterials', 'additivemanufacturing', 'optical strain sensing']"
12498,2007.01764,Xiang Wang,"Xiang Wang, Hongye Jin, An Zhang, Xiangnan He, Tong Xu, Tat-Seng Chua",Disentangled Graph Collaborative Filtering,SIGIR 2020,,10.1145/3397271.3401137,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning informative representations of users and items from the interaction
data is of crucial importance to collaborative filtering (CF). Present
embedding functions exploit user-item relationships to enrich the
representations, evolving from a single user-item instance to the holistic
interaction graph. Nevertheless, they largely model the relationships in a
uniform manner, while neglecting the diversity of user intents on adopting the
items, which could be to pass time, for interest, or shopping for others like
families. Such uniform approach to model user interests easily results in
suboptimal representations, failing to model diverse relationships and
disentangle user intents in representations.
  In this work, we pay special attention to user-item relationships at the
finer granularity of user intents. We hence devise a new model, Disentangled
Graph Collaborative Filtering (DGCF), to disentangle these factors and yield
disentangled representations. Specifically, by modeling a distribution over
intents for each user-item interaction, we iteratively refine the intent-aware
interaction graphs and representations. Meanwhile, we encourage independence of
different intents. This leads to disentangled representations, effectively
distilling information pertinent to each intent. We conduct extensive
experiments on three benchmark datasets, and DGCF achieves significant
improvements over several state-of-the-art models like NGCF, DisenGCN, and
MacridVAE. Further analyses offer insights into the advantages of DGCF on the
disentanglement of user intents and interpretability of representations. Our
codes are available in
https://github.com/xiangwang1223/disentangled_graph_collaborative_filtering.
","[{'version': 'v1', 'created': 'Fri, 3 Jul 2020 15:37:25 GMT'}]",2020-07-06,"[['Wang', 'Xiang', ''], ['Jin', 'Hongye', ''], ['Zhang', 'An', ''], ['He', 'Xiangnan', ''], ['Xu', 'Tong', ''], ['Chua', 'Tat-Seng', '']]","['Collaborative Filtering', 'Graph Neural Networks', 'DisentangledRepresentation Learning', 'Explainable Recommendation']"
12499,2111.04179,Nicolas Moes,"Nicolas Moes, Jean-Francois Remacle, Jonathan Lambrechts, Benoit Le,
  Nicolas Chevaugeon","The eXtreme Mesh deformation approach (X-MESH) for the Stefan
  phase-change model",18 pages,,10.1016/j.jcp.2022.111878,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  The eXtreme Mesh deformation approach (X-MESH) is a new paradigm to follow
sharp interfaces without remeshing and without changing the mesh topology. Even
though the mesh does not change its topology, it can follow interfaces that do
change their topology (nucleation, coalescence, splitting). To make this
possible, the key X-MESH idea is to allow elements to reach zero measure. This
permits interface relaying between nodes as well as interface annihilation and
seeding in a time continuous manner. The paper targets the Stefan phase change
model in which the interface (front) is at a given temperature. Several
examples demonstrate the capability of the approach.
","[{'version': 'v1', 'created': 'Sun, 7 Nov 2021 21:22:08 GMT'}, {'version': 'v2', 'created': 'Sat, 9 Apr 2022 09:11:17 GMT'}, {'version': 'v3', 'created': 'Tue, 24 Jan 2023 14:06:51 GMT'}]",2023-01-25,"[['Moes', 'Nicolas', ''], ['Remacle', 'Jean-Francois', ''], ['Lambrechts', 'Jonathan', ''], ['Le', 'Benoit', ''], ['Chevaugeon', 'Nicolas', '']]","['X-MESH', 'Front relaying', 'Sharp interface', 'Phase change', 'Stefanmodel', 'Solidification']"
12500,2106.02545,Roger Zhe Li,"Roger Zhe Li, Juli\'an Urbano, Alan Hanjalic",New Insights into Metric Optimization for Ranking-based Recommendation,"10 pages, 5 figures, accepted at SIGIR 2021",,10.1145/3404835.3462973,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Direct optimization of IR metrics has often been adopted as an approach to
devise and develop ranking-based recommender systems. Most methods following
this approach aim at optimizing the same metric being used for evaluation,
under the assumption that this will lead to the best performance. A number of
studies of this practice bring this assumption, however, into question. In this
paper, we dig deeper into this issue in order to learn more about the effects
of the choice of the metric to optimize on the performance of a ranking-based
recommender system. We present an extensive experimental study conducted on
different datasets in both pairwise and listwise learning-to-rank scenarios, to
compare the relative merit of four popular IR metrics, namely RR, AP, nDCG and
RBP, when used for optimization and assessment of recommender systems in
various combinations. For the first three, we follow the practice of loss
function formulation available in literature. For the fourth one, we propose
novel loss functions inspired by RBP for both the pairwise and listwise
scenario. Our results confirm that the best performance is indeed not
necessarily achieved when optimizing the same metric being used for evaluation.
In fact, we find that RBP-inspired losses perform at least as well as other
metrics in a consistent way, and offer clear benefits in several cases.
Interesting to see is that RBP-inspired losses, while improving the
recommendation performance for all uses, may lead to an individual performance
gain that is correlated with the activity level of a user in interacting with
items. The more active the users, the more they benefit. Overall, our results
challenge the assumption behind the current research practice of optimizing and
evaluating the same metric, and point to RBP-based optimization instead as a
promising alternative when learning to rank in the recommendation context.
","[{'version': 'v1', 'created': 'Fri, 4 Jun 2021 15:18:36 GMT'}]",2021-06-07,"[['Li', 'Roger Zhe', ''], ['Urbano', 'Julián', ''], ['Hanjalic', 'Alan', '']]","['Recommender Systems', 'Learning to Rank', 'Evaluation Metrics']"
12501,2203.05707,Da Ma,"Ghazal Mirabnahrazam, Da Ma, Sieun Lee, Karteek Popuri, Hyunwoo Lee,
  Jiguo Cao, Lei Wang, James E Galvin, Mirza Faisal Beg, and the Alzheimer's
  Disease Neuroimaging Initiative","Machine Learning Based Multimodal Neuroimaging Genomics Dementia Score
  for Predicting Future Conversion to Alzheimer's Disease",,J Alzheimers Dis 1 Jan. (2022) 1-21,10.3233/JAD-220021,,cs.LG cs.AI eess.IV q-bio.GN,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Background: The increasing availability of databases containing both magnetic
resonance imaging (MRI) and genetic data allows researchers to utilize
multimodal data to better understand the characteristics of dementia of
Alzheimer's type (DAT). Objective: The goal of this study was to develop and
analyze novel biomarkers that can help predict the development and progression
of DAT. Methods: We used feature selection and ensemble learning classifier to
develop an image/genotype-based DAT score that represents a subject's
likelihood of developing DAT in the future. Three feature types were used: MRI
only, genetic only, and combined multimodal data. We used a novel data
stratification method to better represent different stages of DAT. Using a
pre-defined 0.5 threshold on DAT scores, we predicted whether or not a subject
would develop DAT in the future. Results: Our results on Alzheimer's Disease
Neuroimaging Initiative (ADNI) database showed that dementia scores using
genetic data could better predict future DAT progression for currently normal
control subjects (Accuracy=0.857) compared to MRI (Accuracy=0.143), while MRI
can better characterize subjects with stable mild cognitive impairment
(Accuracy=0.614) compared to genetics (Accuracy=0.356). Combining MRI and
genetic data showed improved classification performance in the remaining
stratified groups. Conclusion: MRI and genetic data can contribute to DAT
prediction in different ways. MRI data reflects anatomical changes in the
brain, while genetic data can detect the risk of DAT progression prior to the
symptomatic onset. Combining information from multimodal data in the right way
can improve prediction performance.
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2022 01:35:30 GMT'}]",2022-04-25,"[['Mirabnahrazam', 'Ghazal', ''], ['Ma', 'Da', ''], ['Lee', 'Sieun', ''], ['Popuri', 'Karteek', ''], ['Lee', 'Hyunwoo', ''], ['Cao', 'Jiguo', ''], ['Wang', 'Lei', ''], ['Galvin', 'James E', ''], ['Beg', 'Mirza Faisal', ''], ['Initiative', ""the Alzheimer's Disease Neuroimaging"", '']]","['Alzheimer’s Disease', 'Magnetic Resonance Imaging', 'Single Nucleotide Polymorphism', 'Machine']"
12502,1410.5010,Georg Hager,"Holger Stengel, Jan Treibig, Georg Hager, Gerhard Wellein","Quantifying performance bottlenecks of stencil computations using the
  Execution-Cache-Memory model","10 pages, 8 figures. Added Roofline comparison and other minor
  improvements",,10.1145/2751205.2751240,,cs.PF cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stencil algorithms on regular lattices appear in many fields of computational
science, and much effort has been put into optimized implementations. Such
activities are usually not guided by performance models that provide estimates
of expected speedup. Understanding the performance properties and bottlenecks
by performance modeling enables a clear view on promising optimization
opportunities. In this work we refine the recently developed
Execution-Cache-Memory (ECM) model and use it to quantify the performance
bottlenecks of stencil algorithms on a contemporary Intel processor. This
includes applying the model to arrive at single-core performance and
scalability predictions for typical corner case stencil loop kernels. Guided by
the ECM model we accurately quantify the significance of ""layer conditions,""
which are required to estimate the data traffic through the memory hierarchy,
and study the impact of typical optimization approaches such as spatial
blocking, strength reduction, and temporal blocking for their expected
benefits. We also compare the ECM model to the widely known Roofline model.
","[{'version': 'v1', 'created': 'Sat, 18 Oct 2014 21:49:45 GMT'}, {'version': 'v2', 'created': 'Sat, 17 Jan 2015 14:07:26 GMT'}]",2016-01-28,"[['Stengel', 'Holger', ''], ['Treibig', 'Jan', ''], ['Hager', 'Georg', ''], ['Wellein', 'Gerhard', '']]","['stencils', 'performance model', 'optimization', 'multicore']"
12503,1908.07683,Kwanyong Park,"Kwanyong Park, Sanghyun Woo, Dahun Kim, Donghyeon Cho, In So Kweon","Preserving Semantic and Temporal Consistency for Unpaired Video-to-Video
  Translation",Accepted by ACM Multimedia(ACM MM) 2019,,10.1145/3343031.3350864,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate the problem of unpaired video-to-video
translation. Given a video in the source domain, we aim to learn the
conditional distribution of the corresponding video in the target domain,
without seeing any pairs of corresponding videos. While significant progress
has been made in the unpaired translation of images, directly applying these
methods to an input video leads to low visual quality due to the additional
time dimension. In particular, previous methods suffer from semantic
inconsistency (i.e., semantic label flipping) and temporal flickering
artifacts. To alleviate these issues, we propose a new framework that is
composed of carefully-designed generators and discriminators, coupled with two
core objective functions: 1) content preserving loss and 2) temporal
consistency loss. Extensive qualitative and quantitative evaluations
demonstrate the superior performance of the proposed method against previous
approaches. We further apply our framework to a domain adaptation task and
achieve favorable results.
","[{'version': 'v1', 'created': 'Wed, 21 Aug 2019 02:54:21 GMT'}]",2019-08-22,"[['Park', 'Kwanyong', ''], ['Woo', 'Sanghyun', ''], ['Kim', 'Dahun', ''], ['Cho', 'Donghyeon', ''], ['Kweon', 'In So', '']]","['unpaired video-to-video translation', 'semantic and temporal consistency', 'domain adaptation']"
12504,1606.01786,Robert Richardson,"Robert R. Richardson, Shi Zhao and David A. Howey","On-board monitoring of 2-D spatially-resolved temperatures in
  cylindrical lithium-ion batteries: Part II. State estimation via
  impedance-based temperature sensing","11 pages, 8 figures, submitted to the Journal of Power Sources",,10.1016/j.jpowsour.2016.06.104,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Impedance-based temperature detection (ITD) is a promising approach for rapid
estimation of internal cell temperature based on the correlation between
temperature and electrochemical impedance. Previously, ITD was used as part of
an Extended Kalman Filter (EKF) state-estimator in conjunction with a thermal
model to enable estimation of the 1-D temperature distribution of a cylindrical
lithium-ion battery. Here, we extend this method to enable estimation of the
2-D temperature field of a battery with temperature gradients in both the
radial and axial directions.
  An EKF using a parameterised 2-D spectral-Galerkin model with ITD measurement
input (the imaginary part of the impedance at 215 Hz) is shown to accurately
predict the core temperature and multiple surface temperatures of a 32113
LiFePO$_4$ cell, using current excitation profiles based on an Artemis HEV
drive cycle. The method is validated experimentally on a cell fitted with a
heat sink and asymmetrically cooled via forced air convection.
  A novel approach to impedance-temperature calibration is also presented,
which uses data from a single drive cycle, rather than measurements at multiple
uniform cell temperatures as in previous studies. This greatly reduces the time
required for calibration, since it overcomes the need for repeated cell thermal
equalization.
","[{'version': 'v1', 'created': 'Mon, 6 Jun 2016 15:28:58 GMT'}]",2016-06-28,"[['Richardson', 'Robert R.', ''], ['Zhao', 'Shi', ''], ['Howey', 'David A.', '']]","['Lithium-ion battery', 'impedance', 'temperature', 'Kalman filter', 'state estimation']"
12505,2103.01359,Gustavo Olague Dr.,"Gerardo Ibarra-Vazquez, Gustavo Olague, Mariana Chan-Ley, Cesar
  Puente, Carlos Soubervielle-Montalvo","Brain Programming is Immune to Adversarial Attacks: Towards Accurate and
  Robust Image Classification using Symbolic Learning","58 pages, 9 figures, 13 tables, 81 references",Swarm and Evolutionary Computation 2022,10.1016/j.swevo.2022.101059,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In recent years, the security concerns about the vulnerability of Deep
Convolutional Neural Networks (DCNN) to Adversarial Attacks (AA) in the form of
small modifications to the input image almost invisible to human vision make
their predictions untrustworthy. Therefore, it is necessary to provide
robustness to adversarial examples in addition to an accurate score when
developing a new classifier. In this work, we perform a comparative study of
the effects of AA on the complex problem of art media categorization, which
involves a sophisticated analysis of features to classify a fine collection of
artworks. We tested a prevailing bag of visual words approach from computer
vision, four state-of-the-art DCNN models (AlexNet, VGG, ResNet, ResNet101),
and the Brain Programming (BP) algorithm. In this study, we analyze the
algorithms' performance using accuracy. Besides, we use the accuracy ratio
between adversarial examples and clean images to measure robustness. Moreover,
we propose a statistical analysis of each classifier's predictions' confidence
to corroborate the results. We confirm that BP predictions' change was below
2\% using adversarial examples computed with the fast gradient sign method.
Also, considering the multiple pixel attack, BP obtained four out of seven
classes without changes and the rest with a maximum error of 4\% in the
predictions. Finally, BP also gets four categories using adversarial patches
without changes and for the remaining three classes with a variation of 1\%.
Additionally, the statistical analysis showed that the predictions' confidence
of BP were not significantly different for each pair of clean and perturbed
images in every experiment. These results prove BP's robustness against
adversarial examples compared to DCNN and handcrafted features methods, whose
performance on the art media classification was compromised with the proposed
perturbations.
","[{'version': 'v1', 'created': 'Mon, 1 Mar 2021 23:49:26 GMT'}]",2022-04-06,"[['Ibarra-Vazquez', 'Gerardo', ''], ['Olague', 'Gustavo', ''], ['Chan-Ley', 'Mariana', ''], ['Puente', 'Cesar', ''], ['Soubervielle-Montalvo', 'Carlos', '']]","['Brain Programming', 'Adversarial Attacks', 'Image Classification', 'Art Media Categorization']"
12506,1903.06472,Lihi Dery,"Lihi Dery, Tamir Tassa, and Avishay Yanai","Fear Not, Vote Truthfully: Secure Multiparty Computation of Score Based
  Rules",,"Expert Systems with Applications, 168, 114434 (2021)",10.1016/j.eswa.2020.114434,,cs.CR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a secure voting protocol for score-based voting rules, where
independent talliers perform the tallying procedure. The protocol outputs the
winning candidate(s) while preserving the privacy of the voters and the secrecy
of the ballots. It offers perfect secrecy, in the sense that apart from the
desired output, all other information -- the ballots, intermediate values, and
the final scores received by each of the candidates -- is not disclosed to any
party, including the talliers. Such perfect secrecy may increase the voters'
confidence and, consequently, encourage them to vote according to their true
preferences. The protocol is extremely lightweight, and therefore it can be
easily deployed in real-life voting scenarios.
","[{'version': 'v1', 'created': 'Fri, 15 Mar 2019 11:36:27 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Jan 2020 19:01:36 GMT'}, {'version': 'v3', 'created': 'Sun, 26 Jan 2020 10:11:46 GMT'}, {'version': 'v4', 'created': 'Fri, 11 Dec 2020 16:37:12 GMT'}, {'version': 'v5', 'created': 'Sun, 24 Jan 2021 09:32:12 GMT'}, {'version': 'v6', 'created': 'Sun, 31 Jan 2021 15:13:59 GMT'}, {'version': 'v7', 'created': 'Thu, 27 Jan 2022 18:47:18 GMT'}]",2022-01-28,"[['Dery', 'Lihi', ''], ['Tassa', 'Tamir', ''], ['Yanai', 'Avishay', '']]","['Electronic Voting', 'Secure Multiparty Computation', 'Perfect BallotSecrecy', 'Voting Protocols', 'Computational Social Choice']"
12507,1908.07319,Hassan Ismail Fawaz,"Hassan Ismail Fawaz, Germain Forestier, Jonathan Weber, Lhassane
  Idoumghar, Pierre-Alain Muller","Accurate and interpretable evaluation of surgical skills from kinematic
  data using fully convolutional neural networks",Accepted at IJCARS Special Issue for MICCAI 2018,,10.1007/s11548-019-02039-4,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose: Manual feedback from senior surgeons observing less experienced
trainees is a laborious task that is very expensive, time-consuming and prone
to subjectivity. With the number of surgical procedures increasing annually,
there is an unprecedented need to provide an accurate, objective and automatic
evaluation of trainees' surgical skills in order to improve surgical practice.
Methods: In this paper, we designed a convolutional neural network (CNN) to
classify surgical skills by extracting latent patterns in the trainees' motions
performed during robotic surgery. The method is validated on the JIGSAWS
dataset for two surgical skills evaluation tasks: classification and
regression. Results: Our results show that deep neural networks constitute
robust machine learning models that are able to reach new competitive
state-of-the-art performance on the JIGSAWS dataset. While we leveraged from
CNNs' efficiency, we were able to minimize its black-box effect using the class
activation map technique. Conclusions: This characteristic allowed our method
to automatically pinpoint which parts of the surgery influenced the skill
evaluation the most, thus allowing us to explain a surgical skill
classification and provide surgeons with a novel personalized feedback
technique. We believe this type of interpretable machine learning model could
integrate within ""Operation Room 2.0"" and support novice surgeons in improving
their skills to eventually become experts.
","[{'version': 'v1', 'created': 'Tue, 20 Aug 2019 13:04:05 GMT'}]",2019-08-21,"[['Fawaz', 'Hassan Ismail', ''], ['Forestier', 'Germain', ''], ['Weber', 'Jonathan', ''], ['Idoumghar', 'Lhassane', ''], ['Muller', 'Pierre-Alain', '']]","['kinematic data', 'surgical education', 'deeplearning', 'time series classification', 'interpretablemachine learning']"
12508,2103.08079,Katie Seaborn,"Katie Seaborn, Peter Pennefather, Norihisa P. Miyake, Mihoko
  Otake-Matsuura","Crossing the Tepper Line: An Emerging Ontology for Describing the
  Dynamic Sociality of Embodied AI",Accepted at CHI EA '21,,10.1145/3411763.3451783,,cs.HC cs.AI cs.RO,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Artificial intelligences (AI) are increasingly being embodied and embedded in
the world to carry out tasks and support decision-making with and for people.
Robots, recommender systems, voice assistants, virtual humans - do these
disparate types of embodied AI have something in common? Here we show how they
can manifest as ""socially embodied AI."" We define this as the state that
embodied AI ""circumstantially"" take on within interactive contexts when
perceived as both social and agentic by people. We offer a working ontology
that describes how embodied AI can dynamically transition into socially
embodied AI. We propose an ontological heuristic for describing the threshold:
the Tepper line. We reinforce our theoretical work with expert insights from a
card sort workshop. We end with two case studies to illustrate the dynamic and
contextual nature of this heuristic.
","[{'version': 'v1', 'created': 'Mon, 15 Mar 2021 00:45:44 GMT'}]",2021-03-16,"[['Seaborn', 'Katie', ''], ['Pennefather', 'Peter', ''], ['Miyake', 'Norihisa P.', ''], ['Otake-Matsuura', 'Mihoko', '']]","['Social embodiment', 'Social perceptions', 'Artificial agents', 'AI', 'Ontology']"
12509,2108.03348,Md Shamim Hussain,"Md Shamim Hussain, Mohammed J. Zaki and Dharmashankar Subramanian",Global Self-Attention as a Replacement for Graph Convolution,The accepted version in KDD '22,,10.1145/3534678.3539296,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We propose an extension to the transformer neural network architecture for
general-purpose graph learning by adding a dedicated pathway for pairwise
structural information, called edge channels. The resultant framework - which
we call Edge-augmented Graph Transformer (EGT) - can directly accept, process
and output structural information of arbitrary form, which is important for
effective learning on graph-structured data. Our model exclusively uses global
self-attention as an aggregation mechanism rather than static localized
convolutional aggregation. This allows for unconstrained long-range dynamic
interactions between nodes. Moreover, the edge channels allow the structural
information to evolve from layer to layer, and prediction tasks on edges/links
can be performed directly from the output embeddings of these channels. We
verify the performance of EGT in a wide range of graph-learning experiments on
benchmark datasets, in which it outperforms Convolutional/Message-Passing Graph
Neural Networks. EGT sets a new state-of-the-art for the quantum-chemical
regression task on the OGB-LSC PCQM4Mv2 dataset containing 3.8 million
molecular graphs. Our findings indicate that global self-attention based
aggregation can serve as a flexible, adaptive and effective replacement of
graph convolution for general-purpose graph learning. Therefore, convolutional
local neighborhood aggregation is not an essential inductive bias.
","[{'version': 'v1', 'created': 'Sat, 7 Aug 2021 02:18:11 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Sep 2021 09:38:24 GMT'}, {'version': 'v3', 'created': 'Fri, 3 Jun 2022 05:03:28 GMT'}]",2022-06-06,"[['Hussain', 'Md Shamim', ''], ['Zaki', 'Mohammed J.', ''], ['Subramanian', 'Dharmashankar', '']]","['graph neural networks', 'graph representation learning', 'self-attention']"
12510,2012.02724,Jukka Ruohonen,Jukka Ruohonen,The Treachery of Images in the Digital Sovereignty Debate,"Minds and Machines, published online in July 2021, pp. 1-18",,10.1007/s11023-021-09566-7,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This short theoretical and argumentative essay contributes to the ongoing
deliberation about the so-called digital sovereignty, as pursued particularly
in the European Union (EU). Drawing from classical political science
literature, the essay approaches the debate through paradoxes that arise from
applying classical notions of sovereignty to the digital domain. With these
paradoxes and a focus on the Peace of Westphalia in 1648, the essay develops a
viewpoint distinct from the conventional territorial notion of sovereignty.
Accordingly, the lesson from Westphalia has more to do with the capacity of a
state to govern. It is also this capacity that is argued to enable the
sovereignty of individuals within the digital realm. With this viewpoint, the
essay further advances another, broader, and more pressing debate on politics
and democracy in the digital era.
","[{'version': 'v1', 'created': 'Fri, 4 Dec 2020 17:14:33 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Apr 2021 10:49:18 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Jun 2021 06:01:17 GMT'}, {'version': 'v4', 'created': 'Tue, 27 Jul 2021 09:51:15 GMT'}]",2021-07-28,"[['Ruohonen', 'Jukka', '']]","['digital democracy', 'conceptual stretching', 'self-sovereignty', 'Westphalia', 'territoriality', 'strategic autonomy']"
12511,2112.04352,Swarnendu Biswas,Shivam Kumar and Anupam Agrawal and Swarnendu Biswas,"Efficient Data Race Detection of Async-Finish Programs Using Vector
  Clocks",13 pages,,10.1145/3528425.3529101,,cs.PL,http://creativecommons.org/licenses/by/4.0/,"  Existing data race detectors for task-based programs incur significant run
time and space overheads. The overheads arise because of frequent lookups in
fine-grained tree data structures to check whether two accesses can happen in
parallel.
  This work shows how to efficiently apply vector clocks for dynamic data race
detection of async-finish programs with locks. Our proposed technique,
FastRacer, builds on the FastTrack algorithm with per-task and per-variable
optimizations to reduce the size of vector clocks. FastRacer exploits the
structured parallelism of async-finish programs to use a coarse-grained
encoding of the dynamic task inheritance relations to limit the metadata in the
presence of many concurrent readers. Our evaluation shows that FastRacer
substantially improves time and space overheads over FastTrack, and is
competitive with the state-of-the-art data race detectors for async-finish
programs with locks.
","[{'version': 'v1', 'created': 'Wed, 8 Dec 2021 16:03:09 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Apr 2022 06:31:39 GMT'}]",2022-04-06,"[['Kumar', 'Shivam', ''], ['Agrawal', 'Anupam', ''], ['Biswas', 'Swarnendu', '']]","['Concurrency bugs', 'data races', 'happens-before', 'dynamic program analysis', 'task parallelism', 'async-finish']"
12512,2107.04003,Robert Yawson PhD,"Robert M Yawson, Daniel Woldeab and Emmanuel Osafo",Human Resource Development and the Internet of Things,,"Proceedings of the 25th Annual Academy of Human Resource
  Development International Research Conference in the Americas. Richmond VA,
  USA. February 14 -17, 2018",10.31124/advance.9638417.v1,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  The Internet of Things (IoT) is affecting national innovation ecosystems and
the approach of organizations to innovation and how they create and capture
value in everyday business activities. The Internet of Things (IoT), is
disruptive, and it will change the manner in which human resources are
developed and managed, calling for a new and adaptive human resource
development approach. The Classical Internet communication form is human-human.
The prospect of IoT is that every object will have a unique way of
identification and can be addressed so that every object can be connected. The
communication forms will expand from human-human to human-human, human-thing,
and thing-thing. This will bring a new challenge to how Human Resource
Development (HRD) is practiced. This paper provides an overview of the Internet
of Things and conceptualizes the role of HRD in the age of the Internet of
Things. Keywords:
","[{'version': 'v1', 'created': 'Tue, 22 Jun 2021 01:11:29 GMT'}]",2021-07-09,"[['Yawson', 'Robert M', ''], ['Woldeab', 'Daniel', ''], ['Osafo', 'Emmanuel', '']]","['Analytics', 'Internet of Things', 'Human Resource', 'Workforce', 'Disruptive Technology']"
12513,2101.02841,Tomomi Matsui,"Yuto Ushioda, Masato Tanaka, Tomomi Matsui","Monte Carlo Methods for Calculating Shapley-Shubik Power Index in
  Weighted Majority Games",19pages,"Games 2022, 13(3), 44",10.3390/g13030044,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses Monte Carlo algorithms for calculating the
Shapley-Shubik power index in weighted majority games. First, we analyze a
naive Monte Carlo algorithm and discuss the required number of samples. We then
propose an efficient Monte Carlo algorithm and show that our algorithm reduces
the required number of samples as compared to the naive algorithm.
","[{'version': 'v1', 'created': 'Fri, 8 Jan 2021 04:12:07 GMT'}]",2022-06-06,"[['Ushioda', 'Yuto', ''], ['Tanaka', 'Masato', ''], ['Matsui', 'Tomomi', '']]","['Games/Voting', 'Probability/Applications', 'Statistics/Sampling', 'Monte Carlo algorithm']"
12514,2107.11288,Valerii Serpiva Sr.,"Valerii Serpiva, Ekaterina Karmanova, Aleksey Fedoseev, Stepan
  Perminov and Dzmitry Tsetserukou",DronePaint: Swarm Light Painting with DNN-based Gesture Recognition,"ACM SIGGRAPH 21. Permission to make digital or hard copies of all or
  part of this work for personal or classroom use is granted without fee
  provided that copies are not made or distributed for profit or commercial
  advantage and that copies bear this notice and the full citation on the first
  page. Copyrights for components of this work owned by others than ACM must be
  honored. arXiv admin note: substantial text overlap with arXiv:2106.14698",,10.1145/3450550.3465349,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel human-swarm interaction system, allowing the user to
directly control a swarm of drones in a complex environment through trajectory
drawing with a hand gesture interface based on the DNN-based gesture
recognition. The developed CV-based system allows the user to control the swarm
behavior without additional devices through human gestures and motions in
real-time, providing convenient tools to change the swarm's shape and
formation. The two types of interaction were proposed and implemented to adjust
the swarm hierarchy: trajectory drawing and free-form trajectory generation
control. The experimental results revealed a high accuracy of the gesture
recognition system (99.75%), allowing the user to achieve relatively high
precision of the trajectory drawing (mean error of 5.6 cm in comparison to 3.1
cm by mouse drawing) over the three evaluated trajectory patterns. The proposed
system can be potentially applied in complex environment exploration, spray
painting using drones, and interactive drone shows, allowing users to create
their own art objects by drone swarms.
","[{'version': 'v1', 'created': 'Fri, 23 Jul 2021 15:01:56 GMT'}]",2021-07-26,"[['Serpiva', 'Valerii', ''], ['Karmanova', 'Ekaterina', ''], ['Fedoseev', 'Aleksey', ''], ['Perminov', 'Stepan', ''], ['Tsetserukou', 'Dzmitry', '']]","['Human-Drone Interaction', 'Light Painting', 'Gesture Recognition', 'Deep Neural Network']"
12515,2103.03332,Stefania Ionescu,"Stefania Ionescu, Aniko Hannak, Kenneth Joseph","An Agent-based Model to Evaluate Interventions on Online Dating
  Platforms to Decrease Racial Homogamy",,,10.1145/3442188.3445904,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Perhaps the most controversial questions in the study of online platforms
today surround the extent to which platforms can intervene to reduce the
societal ills perpetrated on them. Up for debate is whether there exist any
effective and lasting interventions a platform can adopt to address, e.g.,
online bullying, or if other, more far-reaching change is necessary to address
such problems. Empirical work is critical to addressing such questions. But it
is also challenging, because it is time-consuming, expensive, and sometimes
limited to the questions companies are willing to ask. To help focus and inform
this empirical work, we here propose an agent-based modeling (ABM) approach. As
an application, we analyze the impact of a set of interventions on a simulated
online dating platform on the lack of long-term interracial relationships in an
artificial society. In the real world, a lack of interracial relationships are
a critical vehicle through which inequality is maintained. Our work shows that
many previously hypothesized interventions online dating platforms could take
to increase the number of interracial relationships from their website have
limited effects, and that the effectiveness of any intervention is subject to
assumptions about sociocultural structure. Further, interventions that are
effective in increasing diversity in long-term relationships are at odds with
platforms' profit-oriented goals. At a general level, the present work shows
the value of using an ABM approach to help understand the potential effects and
side effects of different interventions that a platform could take.
","[{'version': 'v1', 'created': 'Thu, 4 Mar 2021 21:02:09 GMT'}]",2021-03-08,"[['Ionescu', 'Stefania', ''], ['Hannak', 'Aniko', ''], ['Joseph', 'Kenneth', '']]","['racism', 'social media', 'dating platforms', 'agent-based modeling']"
12516,2006.08162,"Erdem Akag\""und\""uz",H. Se\c{c}kin Demir and Erdem Akagunduz,"Filter design for small target detection on infrared imagery using
  normalized-cross-correlation layer",,"published in Turkish Journal of Electrical Engineering and
  Computer Sciences, vol.28, 302:317, 2020",10.3906/elk-1807-287,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce a machine learning approach to the problem of
infrared small target detection filter design. For this purpose, similarly to a
convolutional layer of a neural network, the normalized-cross-correlational
(NCC) layer, which we utilize for designing a target detection/recognition
filter bank, is proposed. By employing the NCC layer in a neural network
structure, we introduce a framework, in which supervised training is used to
calculate the optimal filter shape and the optimum number of filters required
for a specific target detection/recognition task on infrared images. We also
propose the mean-absolute-deviation NCC (MAD-NCC) layer, an efficient
implementation of the proposed NCC layer, designed especially for FPGA systems,
in which square root operations are avoided for real-time computation. As a
case study we work on dim-target detection on mid-wave infrared imagery and
obtain the filters that can discriminate a dim target from various types of
background clutter, specific to our operational concept.
","[{'version': 'v1', 'created': 'Mon, 15 Jun 2020 06:46:08 GMT'}]",2020-06-16,"[['Demir', 'H. Seçkin', ''], ['Akagunduz', 'Erdem', '']]","['Small Target Detection', 'Filter Design', 'Normalized-Cross Correlation', 'ConvolutionalNeural Networks']"
12517,2101.01421,Valdemar \v{S}v\'abensk\'y,"Valdemar \v{S}v\'abensk\'y, Pavel \v{C}eleda, Jan Vykopal, Silvia
  Bri\v{s}\'akov\'a",Cybersecurity Knowledge and Skills Taught in Capture the Flag Challenges,"Published in Elsevier Computers & Security, see
  https://www.sciencedirect.com/science/article/pii/S0167404820304272 (first
  available online on December 27, 2020). The article has 32 pages (in the
  preprint template), 9 figures, and 4 tables",,10.1016/j.cose.2020.102154,,cs.CR,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Capture the Flag challenges are a popular form of cybersecurity education,
where students solve hands-on tasks in an informal, game-like setting. The
tasks feature diverse assignments, such as exploiting websites, cracking
passwords, and breaching unsecured networks. However, it is unclear how the
skills practiced by these challenges match formal cybersecurity curricula
defined by security experts. We explain the significance of Capture the Flag
challenges in cybersecurity training and analyze their 15,963 textual solutions
collected since 2012. Based on keywords in the solutions, we map them to
well-established ACM/IEEE curricular guidelines to understand which skills the
challenges teach. We study the distribution of cybersecurity topics, their
variance in different challenge formats, and their development over the past
years. The analysis showed the prominence of technical knowledge about
cryptography and network security, but human aspects, such as social
engineering and cybersecurity awareness, are neglected. We discuss the
implications of these results and relate them to contemporary literature. Our
results indicate that future Capture the Flag challenges should include
non-technical aspects to address the current advanced cyber threats and attract
a broader audience to cybersecurity.
","[{'version': 'v1', 'created': 'Tue, 5 Jan 2021 09:12:48 GMT'}]",2021-01-06,"[['Švábenský', 'Valdemar', ''], ['Čeleda', 'Pavel', ''], ['Vykopal', 'Jan', ''], ['Brišáková', 'Silvia', '']]","['cybersecurity education', 'security training', 'capture the flag', 'curricular guidelines']"
12518,1805.01825,"Markus Schr\""oder","Markus Schr\""oder and J\""orn Hees and Ansgar Bernardi and Daniel Ewert
  and Peter Klotz and Steffen Stadtm\""uller",Simplified SPARQL REST API - CRUD on JSON Object Graphs via URI Paths,"5 pages, 2 figures, ESWC 2018 demo paper","The Semantic Web: ESWC 2018 Satellite Events - ESWC 2018 Satellite
  Events, Heraklion, Crete, Greece, June 3-7, 2018, Revised Selected Papers",10.1007/978-3-319-98192-5_8,,cs.DB cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Within the Semantic Web community, SPARQL is one of the predominant languages
to query and update RDF knowledge. However, the complexity of SPARQL, the
underlying graph structure and various encodings are common sources of
confusion for Semantic Web novices.
  In this paper we present a general purpose approach to convert any given
SPARQL endpoint into a simple to use REST API. To lower the initial hurdle, we
represent the underlying graph as an interlinked view of nested JSON objects
that can be traversed by the API path.
","[{'version': 'v1', 'created': 'Thu, 3 May 2018 09:57:13 GMT'}]",2022-02-07,"[['Schröder', 'Markus', ''], ['Hees', 'Jörn', ''], ['Bernardi', 'Ansgar', ''], ['Ewert', 'Daniel', ''], ['Klotz', 'Peter', ''], ['Stadtmüller', 'Steffen', '']]","['SPARQL', 'REST API', 'URI', 'JSON', 'CRUD', 'Query', 'Update']"
12519,2209.11851,Juraj Machaj,"Jan Racko, Juraj Machaj, Peter Brida",Ubiquitous smartphone based localization with door crossing detection,,"Engineering Applications of Artificial Intelligence, Volume 75,
  October 2018, Pages 88-93",10.1016/j.engappai.2018.08.001,,cs.HC eess.SP,http://creativecommons.org/licenses/by/4.0/,"  The positioning of users using their smartphones represents interesting
service for various areas. Position of users can represent valuable information
for various service providers. In industry 4.0 smart devices such as smartphone
or tablet can help users to react faster in case of emergency. It can help to
reduce reaction times for service workers and improve users orientation in the
environment, or delegate work to the nearest available employee. In previous
work we have described modular positioning system that is able to automatically
select optimal positioning module based on available radio signals. In this
paper we will focus on estimation of crossing between environments e.g. indoor
and outdoor. The proposed algorithm is crucial for implementation of seamless
positioning. Since both environments have specific demands not only on
positioning solutions but also on maps and navigation algorithms. The proposed
algorithm does not require deployment of new infrastructure and can be used on
widely available smartphones. The algorithm was tested in real conditions by
different users and using various smartphone devices to prove its performance
under various conditions.
","[{'version': 'v1', 'created': 'Thu, 22 Sep 2022 05:33:30 GMT'}]",2022-09-27,"[['Racko', 'Jan', ''], ['Machaj', 'Juraj', ''], ['Brida', 'Peter', '']]","['modular positioning system', 'position estimation', 'inertial measurement unit', 'door detection', 'industry 4.0']"
12520,2009.03027,Alexander Malafeev,"Alexander Malafeev, Anneke Hertig-Godeschalk, David R. Schreier,
  Jelena Skorucak, Johannes Mathis, Peter Achermann",Automatic detection of microsleep episodes with deep learning,,,10.3389/fnins.2021.564098,,cs.LG eess.SP stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Brief fragments of sleep shorter than 15 s are defined as microsleep episodes
(MSEs), often subjectively perceived as sleepiness. Their main characteristic
is a slowing in frequency in the electroencephalogram (EEG), similar to stage
N1 sleep according to standard criteria. The maintenance of wakefulness test
(MWT) is often used in a clinical setting to assess vigilance. Scoring of the
MWT in most sleep-wake centers is limited to classical definition of sleep
(30-s epochs), and MSEs are mostly not considered in the absence of established
scoring criteria defining MSEs but also because of the laborious work. We aimed
for automatic detection of MSEs with machine learning, i.e. with deep learning
based on raw EEG and EOG data as input. We analyzed MWT data of 76 patients.
Experts visually scored wakefulness, and according to recently developed
scoring criteria MSEs, microsleep episode candidates (MSEc), and episodes of
drowsiness (ED). We implemented segmentation algorithms based on convolutional
neural networks (CNNs) and a combination of a CNN with a long-short term memory
(LSTM) network. A LSTM network is a type of a recurrent neural network which
has a memory for past events and takes them into account. Data of 53 patients
were used for training of the classifiers, 12 for validation and 11 for
testing. Our algorithms showed a good performance close to human experts. The
detection was very good for wakefulness and MSEs and poor for MSEc and ED,
similar to the low inter-expert reliability for these borderline segments. We
provide a proof of principle that it is feasible to reliably detect MSEs with
deep neuronal networks based on raw EEG and EOG data with a performance close
to that of human experts. Code of algorithms (
https://github.com/alexander-malafeev/microsleep-detection ) and data (
https://zenodo.org/record/3251716 ) are available.
","[{'version': 'v1', 'created': 'Mon, 7 Sep 2020 11:38:40 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Mar 2021 17:40:15 GMT'}]",2021-03-05,"[['Malafeev', 'Alexander', ''], ['Hertig-Godeschalk', 'Anneke', ''], ['Schreier', 'David R.', ''], ['Skorucak', 'Jelena', ''], ['Mathis', 'Johannes', ''], ['Achermann', 'Peter', '']]","['microsleep episodes', 'excessive daytime sleepiness', 'drowsiness', 'deep learning', 'machine learning']"
12521,2205.05938,Mayank Patel,"Mayank Patel, Minal Bhise",Query Complexity Based Optimal Processing of Raw Data,"Accepted in 10th Region 10 Humanitarian Technology Conference
  (R10-HTC)",,10.1109/R10-HTC54060.2022.9929945,,cs.DB cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The paper aims to find an efficient way for processing large datasets having
different types of workload queries with minimal replication. The work first
identifies the complexity of queries best suited for the given data processing
tool . The paper proposes Query Complexity Aware partitioning technique QCA
with a lightweight query identification and partitioning algorithm. Different
replication approaches have been studied to cover more use-cases for different
application workloads. The technique is demonstrated using a scientific dataset
known as Sloan Digital Sky Survey SDSS. The results show workload execution
time WET reduced by 94.6% using only 6.7% of the dataset in loaded format
compared to the original dataset. The QCA technique also reduced multi-node
replication by 5.8x times compared to state-of-the-art workload aware WA
techniques. The multi-node and multi-core execution of workload using QCA
proposed partitions reduced WET by 42.66% and 25.46% compared to WA.
","[{'version': 'v1', 'created': 'Thu, 12 May 2022 08:02:01 GMT'}]",2022-12-22,"[['Patel', 'Mayank', ''], ['Bhise', 'Minal', '']]","['Data Loading', 'In-situ engines', 'Partitioning']"
12522,2208.13436,Yifeng Zhou,"Yifeng Zhou, Chuming Lin, Donghao Luo, Yong Liu, Ying Tai, Chengjie
  Wang, Mingang Chen","Joint Learning Content and Degradation Aware Feature for Blind
  Super-Resolution",,,10.1145/3503161.3547907,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To achieve promising results on blind image super-resolution (SR), some
attempts leveraged the low resolution (LR) images to predict the kernel and
improve the SR performance. However, these Supervised Kernel Prediction (SKP)
methods are impractical due to the unavailable real-world blur kernels.
Although some Unsupervised Degradation Prediction (UDP) methods are proposed to
bypass this problem, the \textit{inconsistency} between degradation embedding
and SR feature is still challenging. By exploring the correlations between
degradation embedding and SR feature, we observe that jointly learning the
content and degradation aware feature is optimal. Based on this observation, a
Content and Degradation aware SR Network dubbed CDSR is proposed. Specifically,
CDSR contains three newly-established modules: (1) a Lightweight Patch-based
Encoder (LPE) is applied to jointly extract content and degradation features;
(2) a Domain Query Attention based module (DQA) is employed to adaptively
reduce the inconsistency; (3) a Codebook-based Space Compress module (CSC) that
can suppress the redundant information. Extensive experiments on several
benchmarks demonstrate that the proposed CDSR outperforms the existing UDP
models and achieves competitive performance on PSNR and SSIM even compared with
the state-of-the-art SKP methods.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2022 09:12:39 GMT'}]",2022-08-30,"[['Zhou', 'Yifeng', ''], ['Lin', 'Chuming', ''], ['Luo', 'Donghao', ''], ['Liu', 'Yong', ''], ['Tai', 'Ying', ''], ['Wang', 'Chengjie', ''], ['Chen', 'Mingang', '']]","['Blind super-resolution', 'content aware', 'contrastive learning']"
12523,1907.03309,Ali Kassem,Ali Kassem and Yli\`es Falcone,Detecting Fault Injection Attacks with Runtime Verification,,,10.1145/3338503.3357724,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fault injections are increasingly used to attack/test secure applications. In
this paper, we define formal models of runtime monitors that can detect fault
injections that result in test inversion attacks and arbitrary jumps in the
control flow. Runtime verification monitors offer several advantages. The code
implementing a monitor is small compared to the entire application code.
Monitors have a formal semantics; and we prove that they effectively detect
attacks. Each monitor is a module dedicated to detecting an attack and can be
deployed as needed to secure the application. A monitor can run separately from
the application or it can be ``weaved'' inside the application. Our monitors
have been validated by detecting simulated attacks on a program that verifies a
user PIN.
","[{'version': 'v1', 'created': 'Sun, 7 Jul 2019 15:41:17 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Sep 2019 13:50:09 GMT'}]",2019-09-23,"[['Kassem', 'Ali', ''], ['Falcone', 'Yliès', '']]","['Runtime Verification', 'Monitor', 'Fault Injection', 'Detection', 'Quantified Event Automata', 'Attacker Model']"
12524,1906.07906,Brian de Silva,"Brian M. de Silva (1), David M. Higdon (2), Steven L. Brunton (3), J.
  Nathan Kutz (1) ((1) University of Washington Applied Mathematics, (2)
  Virginia Polytechnic Institute and State University Statistics, (3)
  University of Washington Mechanical Engineering)",Discovery of Physics from Data: Universal Laws and Discrepancies,,,10.3389/frai.2020.00025,,cs.LG physics.class-ph stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Machine learning (ML) and artificial intelligence (AI) algorithms are now
being used to automate the discovery of physics principles and governing
equations from measurement data alone. However, positing a universal physical
law from data is challenging without simultaneously proposing an accompanying
discrepancy model to account for the inevitable mismatch between theory and
measurements. By revisiting the classic problem of modeling falling objects of
different size and mass, we highlight a number of nuanced issues that must be
addressed by modern data-driven methods for automated physics discovery.
Specifically, we show that measurement noise and complex secondary physical
mechanisms, like unsteady fluid drag forces, can obscure the underlying law of
gravitation, leading to an erroneous model. We use the sparse identification of
nonlinear dynamics (SINDy) method to identify governing equations for
real-world measurement data and simulated trajectories. Incorporating into
SINDy the assumption that each falling object is governed by a similar physical
law is shown to improve the robustness of the learned models, but discrepancies
between the predictions and observations persist due to subtleties in drag
dynamics. This work highlights the fact that the naive application of ML/AI
will generally be insufficient to infer universal physical laws without further
modification.
","[{'version': 'v1', 'created': 'Wed, 19 Jun 2019 04:09:20 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Apr 2020 18:21:32 GMT'}, {'version': 'v3', 'created': 'Thu, 16 Apr 2020 19:56:03 GMT'}]",2021-02-23,"[['de Silva', 'Brian M.', ''], ['Higdon', 'David M.', ''], ['Brunton', 'Steven L.', ''], ['Kutz', 'J. Nathan', '']]","['dynamical systems', 'system identification', 'machine learning', 'artificial intelligence', 'sparse regression']"
12525,2003.03317,Joao Barreto,"Ricardo Filipe, Shady Issa, Paolo Romano, Jo\~ao Barreto","Stretching the capacity of Hardware Transactional Memory in IBM POWER
  architectures",,"PPoPP '19: Proceedings of the 24th Symposium on Principles and
  Practice of Parallel Programming, February 2019, Pages 107-119",10.1145/3293883.3295714,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The hardware transactional memory (HTM) implementations in commercially
available processors are significantly hindered by their tight capacity
constraints. In practice, this renders current HTMs unsuitable to many
real-world workloads of in-memory databases. This paper proposes SI-HTM, which
stretches the capacity bounds of the underlying HTM, thus opening HTM to a much
broader class of applications. SI-HTM leverages the HTM implementation of the
IBM POWER architecture with a software layer to offer a single-version
implementation of Snapshot Isolation. When compared to HTM- and software-based
concurrency control alternatives, SI-HTM exhibits improved scalability,
achieving speedups of up to 300% relatively to HTM on in-memory database
benchmarks.
","[{'version': 'v1', 'created': 'Fri, 6 Mar 2020 17:25:13 GMT'}]",2020-03-09,"[['Filipe', 'Ricardo', ''], ['Issa', 'Shady', ''], ['Romano', 'Paolo', ''], ['Barreto', 'João', '']]","['HTM', 'Transactional Memory', 'IMDBs', 'IBM POWER', 'Snapshot Isolation']"
12526,2012.12770,Dorothee Henke,"Christoph Buchheim, Dorothee Henke, Felix Hommelsheim",On the Complexity of the Bilevel Minimum Spanning Tree Problem,,"Networks 80(3), 338-355 (2022)",10.1002/net.22111,,cs.DS cs.DM math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the bilevel minimum spanning tree (BMST) problem where the leader
and the follower choose a spanning tree together, according to different
objective functions. By showing that this problem is NP-hard in general, we
answer an open question stated in by Shi et al. We prove that BMST remains hard
even in the special case where the follower only controls a matching. Moreover,
by a polynomial reduction from the vertex-disjoint Steiner trees problem, we
give some evidence that BMST might even remain hard in case the follower
controls only few edges. On the positive side, we present a polynomial-time
$(|V|-1)$-approximation algorithm for BMST, where $|V|$ is the number of
vertices in the input graph. Moreover, considering the number of edges
controlled by the follower as parameter, we show that 2-approximating BMST is
fixed-parameter tractable and that, in case of uniform costs on leader's edges,
even solving BMST exactly is fixed-parameter tractable. We finally consider
bottleneck variants of BMST and settle the complexity landscape of all
combinations of sum or bottleneck objective functions for the leader and
follower, for the optimistic as well as the pessimistic setting.
","[{'version': 'v1', 'created': 'Wed, 23 Dec 2020 16:23:57 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Aug 2021 19:42:40 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Jul 2022 10:10:34 GMT'}]",2022-09-14,"[['Buchheim', 'Christoph', ''], ['Henke', 'Dorothee', ''], ['Hommelsheim', 'Felix', '']]","['bilevel optimization', 'combinatorial optimization', 'spanning treeproblem', 'complexity', 'Steiner tree', 'approximation algorithms']"
12527,2110.06019,Marco Winckler,"Adrian Reuter (TUM), Karima Boudaoud (I3S), Marco Winckler (I3S,
  WIMMICS, IRIT-ICS), Ahmed Abdelmaksoud (I3S), Wadie Lemrazzeq (I3S)",Secure Email -- A Usability Study,,"FC 2020: Workshops, International Conference on Financial
  Cryptography and Data Security, 12063, pp.36-46, 2020, Lecture Notes in
  Computer Science book series (LNCS, volume 12063), 978-3-030-54454-6",10.1007/978-3-030-54455-3_3,,cs.CR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several end-to-end encryption technologies for emails such as PGP and S/MIME
exist since decades. However, end-to-end encryption is barely applied. To
understand why users hesitate to secure their email communication and which
usability issues they face with PGP, S/MIME as well as with pEp (Pretty Easy
Privacy), a fairly new technology, we conducted an online survey and user
testing. We found that more than 60% of e-mail users are unaware of the
existence of such encryption technologies and never tried to use one. We
observed that above all, users are overwhelmed with the management of public
keys and struggle with the setup of encryption technology in their mail
software. Even though users struggle to put email encryption into practice, we
experienced roughly the same number of users being aware of the importance of
email encryption. Particularly, we found that users are very concerned about
identity theft, as 78% want to make sure that no other person is able to write
email in their name.
","[{'version': 'v1', 'created': 'Tue, 12 Oct 2021 14:04:28 GMT'}]",2021-10-13,"[['Reuter', 'Adrian', '', 'TUM'], ['Boudaoud', 'Karima', '', 'I3S'], ['Winckler', 'Marco', '', 'I3S,\n  WIMMICS, IRIT-ICS'], ['Abdelmaksoud', 'Ahmed', '', 'I3S'], ['Lemrazzeq', 'Wadie', '', 'I3S']]","['mail encryption', 'user study', 'usability', 'PGP', 'S/MIME', 'pEp']"
12528,2012.13014,Nelson Alves,"Nelson Alves, Marco Ruiz, Marco Reis, Tiago Cajahyba, Davi Oliveira,
  Ana Barreto, Eduardo F. Simas Filho, Wagner L. A. de Oliveira, Leizer
  Schnitman, Roberto L. S. Monteiro",Low-latency Perception in Off-Road Dynamical Low Visibility Environments,,,10.1016/j.eswa.2022.117010,,cs.CV cs.LG cs.RO eess.IV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This work proposes a perception system for autonomous vehicles and advanced
driver assistance specialized on unpaved roads and off-road environments. In
this research, the authors have investigated the behavior of Deep Learning
algorithms applied to semantic segmentation of off-road environments and
unpaved roads under differents adverse conditions of visibility. Almost 12,000
images of different unpaved and off-road environments were collected and
labeled. It was assembled an off-road proving ground exclusively for its
development. The proposed dataset also contains many adverse situations such as
rain, dust, and low light. To develop the system, we have used convolutional
neural networks trained to segment obstacles and areas where the car can pass
through. We developed a Configurable Modular Segmentation Network (CMSNet)
framework to help create different architectures arrangements and test them on
the proposed dataset. Besides, we also have ported some CMSNet configurations
by removing and fusing many layers using TensorRT, C++, and CUDA to achieve
embedded real-time inference and allow field tests. The main contributions of
this work are: a new dataset for unpaved roads and off-roads environments
containing many adverse conditions such as night, rain, and dust; a CMSNet
framework; an investigation regarding the feasibility of applying deep learning
to detect region where the vehicle can pass through when there is no clear
boundary of the track; a study of how our proposed segmentation algorithms
behave in different severity levels of visibility impairment; and an evaluation
of field tests carried out with semantic segmentation architectures ported for
real-time inference.
","[{'version': 'v1', 'created': 'Wed, 23 Dec 2020 22:54:43 GMT'}]",2022-04-22,"[['Alves', 'Nelson', ''], ['Ruiz', 'Marco', ''], ['Reis', 'Marco', ''], ['Cajahyba', 'Tiago', ''], ['Oliveira', 'Davi', ''], ['Barreto', 'Ana', ''], ['Filho', 'Eduardo F. Simas', ''], ['de Oliveira', 'Wagner L. A.', ''], ['Schnitman', 'Leizer', ''], ['Monteiro', 'Roberto L. S.', '']]","['Autonomous Vehicle', 'ADAS', 'Perception', 'Deep learning', 'CNN', 'Real-time Segmentation', 'Off-Road']"
12529,2010.11886,K L Bhanu Moorthy,"K L Bhanu Moorthy, Moneish Kumar, Ramanathan Subramaniam, Vineet
  Gandhi","GAZED- Gaze-guided Cinematic Editing of Wide-Angle Monocular Video
  Recordings",10 pages,"In Proceedings of the 2020 CHI Conference on Human Factors in
  Computing Systems (CHI '20). Association for Computing Machinery, New York,
  NY, USA, 1-11",10.1145/3313831.3376544,,cs.CV cs.HC cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present GAZED- eye GAZe-guided EDiting for videos captured by a solitary,
static, wide-angle and high-resolution camera. Eye-gaze has been effectively
employed in computational applications as a cue to capture interesting scene
content; we employ gaze as a proxy to select shots for inclusion in the edited
video. Given the original video, scene content and user eye-gaze tracks are
combined to generate an edited video comprising cinematically valid actor shots
and shot transitions to generate an aesthetic and vivid representation of the
original narrative. We model cinematic video editing as an energy minimization
problem over shot selection, whose constraints capture cinematographic editing
conventions. Gazed scene locations primarily determine the shots constituting
the edited video. Effectiveness of GAZED against multiple competing methods is
demonstrated via a psychophysical study involving 12 users and twelve
performance videos.
","[{'version': 'v1', 'created': 'Thu, 22 Oct 2020 17:27:03 GMT'}]",2020-10-23,"[['Moorthy', 'K L Bhanu', ''], ['Kumar', 'Moneish', ''], ['Subramaniam', 'Ramanathan', ''], ['Gandhi', 'Vineet', '']]","['Eye gaze', 'Cinematic video editing', 'Stage performance', 'Staticwide-angle recording', 'Gaze potential', 'Shot selection', 'Dynamic programming']"
12530,2003.08144,Florian Ingels,"Florian Ingels and Romain Aza\""is",Enumeration of Irredundant Forests,,"Theoretical Computer Science, 2022",10.1016/j.tcs.2022.04.033,,cs.DM cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reverse search is a convenient method for enumerating structured objects,
that can be used both to address theoretical issues and to solve data mining
problems. This method has already been successfully developed to handle
unordered trees. If the literature proposes solutions to enumerate singletons
of trees, we study in this article a more general problem, the enumeration of
sets of trees -- forests. Specifically, we mainly study irredundant forests,
i.e., where no tree is a subtree of another. By compressing each such forest
into a Directed Acyclic Graph (DAG), we develop a reverse search like method to
enumerate DAGs compressing irredundant forests. Remarkably, we prove that these
DAGs are in bijection with the row-Fishburn matrices, a well-studied class of
combinatorial objects. In a second step, we derive our irredundant forest
enumeration to provide algorithms for tackling related problems: (i)
enumeration of forests in their classical sense (where redundancy is allowed);
(ii) the enumeration of ""subforests"" of a forest, and (iii) the frequent
""subforest"" mining problem. All the methods presented in this article enumerate
each item uniquely, up to isomorphism.
","[{'version': 'v1', 'created': 'Wed, 18 Mar 2020 10:46:44 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Mar 2021 14:51:08 GMT'}, {'version': 'v3', 'created': 'Fri, 17 Dec 2021 16:19:51 GMT'}, {'version': 'v4', 'created': 'Wed, 13 Apr 2022 08:34:57 GMT'}]",2022-05-13,"[['Ingels', 'Florian', ''], ['Azaïs', 'Romain', '']]","['Directed Acyclic Graph', 'Reverse Search', 'Unordered Trees', 'Enumeration', 'Forest']"
12531,2010.04767,Tanmay Samak,"Tanmay Vilas Samak, Chinmay Vilas Samak and Sivanathan Kandhasamy","Robust Behavioral Cloning for Autonomous Vehicles using End-to-End
  Imitation Learning","Accepted at SAE International Journal of Connected and Automated
  Vehicles","SAE International Journal of Connected and Automated Vehicles,
  vol. 4, no. 3, pp. 279-295, 2021",10.4271/12-04-03-0023,,cs.RO cs.CV cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we present a lightweight pipeline for robust behavioral cloning
of a human driver using end-to-end imitation learning. The proposed pipeline
was employed to train and deploy three distinct driving behavior models onto a
simulated vehicle. The training phase comprised of data collection, balancing,
augmentation, preprocessing and training a neural network, following which, the
trained model was deployed onto the ego vehicle to predict steering commands
based on the feed from an onboard camera. A novel coupled control law was
formulated to generate longitudinal control commands on-the-go based on the
predicted steering angle and other parameters such as actual speed of the ego
vehicle and the prescribed constraints for speed and steering. We analyzed
computational efficiency of the pipeline and evaluated robustness of the
trained models through exhaustive experimentation during the deployment phase.
We also compared our approach against state-of-the-art implementation in order
to comment on its validity.
","[{'version': 'v1', 'created': 'Fri, 9 Oct 2020 19:03:15 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Jan 2021 18:07:14 GMT'}, {'version': 'v3', 'created': 'Sat, 13 Mar 2021 09:33:08 GMT'}, {'version': 'v4', 'created': 'Thu, 5 Aug 2021 10:31:35 GMT'}]",2021-10-19,"[['Samak', 'Tanmay Vilas', ''], ['Samak', 'Chinmay Vilas', ''], ['Kandhasamy', 'Sivanathan', '']]","['Autonomous Vehicles', 'Behavioral Cloning', 'End-to-End Learning', 'Imitation Learning']"
12532,2006.10838,Vlad Coroam\u{a},"Pernilla Bergmark, Vlad C. Coroam\u{a}, Mattias H\""ojer, Craig Donovan","A Methodology for Assessing the Environmental Effects Induced by ICT
  Services. Part II: Multiple Services and Companies","10 pages, 4 figures, The 7th International Conference on ICT for
  Sustainability (ICT4S 2020)",,10.1145/3401335.3401711,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information and communication technologies (ICT) can make existing products
and activities more efficient or substitute them altogether and could thus
become crucial for the mitigation of climate change. In this context,
individual ICT companies, industry organizations and international initiatives
have started to estimate the environmental effects of ICT services. Often such
assessments rely on crude assumptions and methods, yielding inaccurate or even
misleading results. The few existing methodological attempts are too general to
provide guidance to practitioners. The starting points of this paper are i) a
high level standard from the European Telecommunication Standardisation
Institute (ETSI) and the International Telecommunication Union (ITU), and ii)
its suggested enhancements for single service assessment outlined in ""A
Methodology for Assessing the Environmental Effects Induced by ICT Services
Part I: Single services"" (Part I in short). Building on the assessment of
single services, the current article identifies and addresses shortcomings of
existing methodologies and industry practices with regard to multiple services
assessment. For a collection of services, it addresses the goal and scope
definition, the so far ignored aggregation of effects among several services,
and the allocation between several companies contributing to one or more
services. The article finally brings these considerations together with those
of Part I into a workflow for performing such assessments in practice.
","[{'version': 'v1', 'created': 'Thu, 18 Jun 2020 20:12:26 GMT'}]",2020-06-22,"[['Bergmark', 'Pernilla', ''], ['Coroamă', 'Vlad C.', ''], ['Höjer', 'Mattias', ''], ['Donovan', 'Craig', '']]","['Induced effect', 'enabling effect', 'enablement', 'abatement', 'avoided emissions', 'digital services', 'digitization']"
12533,2003.11011,Yuriy Pershin,"V. J. Dowling, V. A. Slipko, and Y. V. Pershin","Probabilistic Memristive Networks: Application of a Master Equation to
  Networks of Binary ReRAM cells",,"Chaos, Solitons & Fractals, Volume 142, 110385 (2021)",10.1016/j.chaos.2020.110385,,cs.ET cond-mat.mes-hall cond-mat.mtrl-sci,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The possibility of using non-deterministic circuit components has been
gaining significant attention in recent years. The modeling and simulation of
their circuits require novel approaches, as now the state of a circuit at an
arbitrary moment in time cannot be precisely predicted. Generally, these
circuits should be described in terms of probabilities, the circuit variables
should be calculated on average, and correlation functions should be used to
explore interrelations among the variables. In this paper, we use, for the
first time, a master equation to analyze the networks composed of probabilistic
binary memristors. Analytical solutions of the master equation for the case of
identical memristors connected in-series and in-parallel are found. Our
analytical results are supplemented by results of numerical simulations that
extend our findings beyond the case of identical memristors. The approach
proposed in this paper facilitates the development of probabilistic/stochastic
electronic circuits and advance their real-world applications.
","[{'version': 'v1', 'created': 'Tue, 24 Mar 2020 17:56:36 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Jul 2020 13:38:00 GMT'}, {'version': 'v3', 'created': 'Fri, 4 Dec 2020 23:20:53 GMT'}]",2021-01-25,"[['Dowling', 'V. J.', ''], ['Slipko', 'V. A.', ''], ['Pershin', 'Y. V.', '']]","['memristors', 'networks', 'probabilistic computing', 'probabilistic logic']"
12534,2204.08468,Marcos Faundez-Zanuy,"Josep roure-Alcob\'e, Marcos Faundez-Zanuy",Face recognition with small and large size databases,"5 pages, published in Proceedings 39th Annual 2005 International
  Carnahan Conference on Security Technology, Las Palmas (Spain). arXiv admin
  note: text overlap with arXiv:2204.07764, arXiv:2204.03935","IEEE Proceedings 39th Annual 2005 International Carnahan
  Conference on Security Technology, 2005, pp. 153-156",10.1109/CCST.2005.1594843,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper presents experimental results using the ORL (40 people) and FERET
(994 people) databases. The ORL database can be useful for securing
applications where few users attempting to access are expected. This is the
case, for instance, of a PDA or PC where the password is the face of the user.
On the other hand, the FERET database is useful for studying those situations
where the number of authorized users is around a thousand people.
","[{'version': 'v1', 'created': 'Sat, 16 Apr 2022 09:37:11 GMT'}]",2022-04-20,"[['roure-Alcobé', 'Josep', ''], ['Faundez-Zanuy', 'Marcos', '']]","['Face image', 'Discrete Cosine Transform', 'verification', 'feature extraction']"
12535,1709.02339,Arun Sathanur,"Arun V. Sathanur, Sutanay Choudhury, Cliff Joslyn, Sumit Purohit","When Labels Fall Short: Property Graph Simulation via Blending of
  Network Structure and Vertex Attributes",Published in CIKM 2017,,10.1145/3132847.3133065,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Property graphs can be used to represent heterogeneous networks with labeled
(attributed) vertices and edges. Given a property graph, simulating another
graph with same or greater size with the same statistical properties with
respect to the labels and connectivity is critical for privacy preservation and
benchmarking purposes. In this work we tackle the problem of capturing the
statistical dependence of the edge connectivity on the vertex labels and using
the same distribution to regenerate property graphs of the same or expanded
size in a scalable manner. However, accurate simulation becomes a challenge
when the attributes do not completely explain the network structure. We propose
the Property Graph Model (PGM) approach that uses a label augmentation strategy
to mitigate the problem and preserve the vertex label and the edge connectivity
distributions as well as their correlation, while also replicating the degree
distribution. Our proposed algorithm is scalable with a linear complexity in
the number of edges in the target graph. We illustrate the efficacy of the PGM
approach in regenerating and expanding the datasets by leveraging two distinct
illustrations. Our open-source implementation is available on GitHub.
","[{'version': 'v1', 'created': 'Thu, 7 Sep 2017 16:30:54 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Jul 2019 00:03:27 GMT'}]",2019-07-18,"[['Sathanur', 'Arun V.', ''], ['Choudhury', 'Sutanay', ''], ['Joslyn', 'Cliff', ''], ['Purohit', 'Sumit', '']]","['Property Graphs', 'Attributed Graphs', 'Joint Distribution', 'GraphGeneration', 'Label Augmentation', 'Label-Topology Correlation']"
12536,2108.10118,Thomas Wendler,"Markus Kr\""onke, Christine Eilers, Desislava Dimova, Melanie K\""ohler,
  Gabriel Buschner, Lilit Mirzojan, Lemonia Konstantinidou, Marcus R. Makowski,
  James Nagarajah, Nassir Navab, Wolfgang Weber, Thomas Wendler","Tracked 3D Ultrasound and Deep Neural Network-based Thyroid Segmentation
  reduce Interobserver Variability in Thyroid Volumetry","7 figures, 19 pages, under review",,10.1371/journal.pone.0268550,,cs.CV cs.LG cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Thyroid volumetry is crucial in diagnosis, treatment and
monitoring of thyroid diseases. However, conventional thyroid volumetry with 2D
ultrasound is highly operator-dependent. This study compares 2D ultrasound and
tracked 3D ultrasound with an automatic thyroid segmentation based on a deep
neural network regarding inter- and intraobserver variability, time and
accuracy. Volume reference was MRI. Methods: 28 healthy volunteers were scanned
with 2D and 3D ultrasound as well as by MRI. Three physicians (MD 1, 2, 3) with
different levels of experience (6, 4 and 1 a) performed three 2D ultrasound and
three tracked 3D ultrasound scans on each volunteer. In the 2D scans the
thyroid lobe volumes were calculated with the ellipsoid formula. A
convolutional deep neural network (CNN) segmented the 3D thyroid lobes
automatically. On MRI (T1 VIBE sequence) the thyroid was manually segmented by
an experienced medical doctor. Results: The CNN was trained to obtain a dice
score of 0.94. The interobserver variability comparing two MDs showed mean
differences for 2D and 3D respectively of 0.58 ml to 0.52 ml (MD1 vs. 2), -1.33
ml to -0.17 ml (MD1 vs. 3) and -1.89 ml to -0.70 ml (MD2 vs. 3). Paired samples
t-tests showed significant differences in two comparisons for 2D and none for
3D. Intraobsever variability was similar for 2D and 3D ultrasound. Comparison
of ultrasound volumes and MRI volumes by paired samples t-tests showed a
significant difference for the 2D volumetry of all MDs, and no significant
difference for 3D ultrasound. Acquisition time was significantly shorter for 3D
ultrasound. Conclusion: Tracked 3D ultrasound combined with a CNN segmentation
significantly reduces interobserver variability in thyroid volumetry and
increases the accuracy of the measurements with shorter acquisition times.
","[{'version': 'v1', 'created': 'Tue, 10 Aug 2021 23:28:27 GMT'}]",2022-10-12,"[['Krönke', 'Markus', ''], ['Eilers', 'Christine', ''], ['Dimova', 'Desislava', ''], ['Köhler', 'Melanie', ''], ['Buschner', 'Gabriel', ''], ['Mirzojan', 'Lilit', ''], ['Konstantinidou', 'Lemonia', ''], ['Makowski', 'Marcus R.', ''], ['Nagarajah', 'James', ''], ['Navab', 'Nassir', ''], ['Weber', 'Wolfgang', ''], ['Wendler', 'Thomas', '']]","['tracked 3D ultrasound', 'thyroid volumetry', 'ultrasoundsegmentation']"
12537,1602.07127,"Johannes Br\""auer","Johannes Br\""auer",Measuring Object-Oriented Design Principles,"4 pages, 1 figure, Proceeding of the Doctoral Symposium at the 30th
  ACM/IEEE International Conference on Automated Software Engineering (ASE
  2015), Lincoln, Nebraska, USA, November 9-13, 2015",,10.1109/ASE.2015.17,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The idea of automatizing the assessment of objectoriented design is not new.
Different approaches define and apply their own quality models, which are
composed of single metrics or combinations thereof, to operationalize software
design. However, single metrics are too fine-grained to identify core design
flaws and they cannot provide hints for making design improvements. In order to
deal with these weaknesses of metric-based models, rules-based approaches have
proven successful in the realm of source-code quality. Moreover, for developing
a well-designed software system, design principles play a key role, as they
define fundamental guidelines and help to avoid pitfalls. Therefore, this
thesis will enhance and complete a rule-based quality reference model for
operationalizing design principles and will provide a measuring tool that
implements these rules. The validation of the design quality model and the
measurement tool will be based on various industrial projects. Additionally,
quantitative and qualitative surveys will be conducted in order to get
validated results on the value of object-oriented design principles for
software development
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2016 11:49:07 GMT'}]",2016-02-24,"[['Bräuer', 'Johannes', '']]","['design principles', 'software-design quality', 'software']"
12538,2103.00482,Yuqi Si,"Yuqi Si, Elmer V Bernstam, Kirk Roberts","Generalized and Transferable Patient Language Representation for
  Phenotyping with Limited Data",Journal of Biomedical Informatics (in press),,10.1016/j.jbi.2021.103726,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paradigm of representation learning through transfer learning has the
potential to greatly enhance clinical natural language processing. In this
work, we propose a multi-task pre-training and fine-tuning approach for
learning generalized and transferable patient representations from medical
language. The model is first pre-trained with different but related
high-prevalence phenotypes and further fine-tuned on downstream target tasks.
Our main contribution focuses on the impact this technique can have on
low-prevalence phenotypes, a challenging task due to the dearth of data. We
validate the representation from pre-training, and fine-tune the multi-task
pre-trained models on low-prevalence phenotypes including 38 circulatory
diseases, 23 respiratory diseases, and 17 genitourinary diseases. We find
multi-task pre-training increases learning efficiency and achieves consistently
high performance across the majority of phenotypes. Most important, the
multi-task pre-training is almost always either the best-performing model or
performs tolerably close to the best-performing model, a property we refer to
as robust. All these results lead us to conclude that this multi-task transfer
learning architecture is a robust approach for developing generalized and
transferable patient language representations for numerous phenotypes.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2021 18:18:02 GMT'}]",2021-03-15,"[['Si', 'Yuqi', ''], ['Bernstam', 'Elmer V', ''], ['Roberts', 'Kirk', '']]","['language representation', 'phenotype prediction', 'patient representation', 'deep learning']"
12539,2011.10915,Zhenyu Shou,"Zhenyu Shou, Xu Chen, Yongjie Fu, Xuan Di","Multi-Agent Reinforcement Learning for Markov Routing Games: A New
  Modeling Paradigm For Dynamic Traffic Assignment","20 pages, 11 figures, published in Transportation Research Part C 137
  (2022) 103560","Transportation Research Part C: Emerging Technologies 137, 103560
  (2022)",10.1016/j.trc.2022.103560,,cs.LG cs.MA,http://creativecommons.org/licenses/by/4.0/,"  This paper aims to develop a paradigm that models the learning behavior of
intelligent agents (including but not limited to autonomous vehicles, connected
and automated vehicles, or human-driven vehicles with intelligent navigation
systems where human drivers follow the navigation instructions completely) with
a utility-optimizing goal and the system's equilibrating processes in a routing
game among atomic selfish agents. Such a paradigm can assist policymakers in
devising optimal operational and planning countermeasures under both normal and
abnormal circumstances. To this end, we develop a Markov routing game (MRG) in
which each agent learns and updates her own en-route path choice policy while
interacting with others in transportation networks. To efficiently solve MRG,
we formulate it as multi-agent reinforcement learning (MARL) and devise a mean
field multi-agent deep Q learning (MF-MA-DQL) approach that captures the
competition among agents. The linkage between the classical DUE paradigm and
our proposed Markov routing game (MRG) is discussed. We show that the routing
behavior of intelligent agents is shown to converge to the classical notion of
predictive dynamic user equilibrium (DUE) when traffic environments are
simulated using dynamic loading models (DNL). In other words, the MRG depicts
DUEs assuming perfect information and deterministic environments propagated by
DNL models. Four examples are solved to illustrate the algorithm efficiency and
consistency between DUE and the MRG equilibrium, on a simple network without
and with spillback, the Ortuzar Willumsen (OW) Network, and a real-world
network near Columbia University's campus in Manhattan of New York City.
","[{'version': 'v1', 'created': 'Sun, 22 Nov 2020 02:31:14 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Feb 2022 01:24:04 GMT'}]",2022-03-01,"[['Shou', 'Zhenyu', ''], ['Chen', 'Xu', ''], ['Fu', 'Yongjie', ''], ['Di', 'Xuan', '']]","['Markov Game', 'Multi-Agent Reinforcement Learning (MARL)', 'Atomic Agents', 'DynamicUser Equilibrium (DUE)']"
12540,1703.10882,Nicole Vavrov\'a,"Nicole Vavrov\'a (Universiteit van Amsterdam, Netherlands), Vadim
  Zaytsev (Raincode Labs, Belgium)","Does Python Smell Like Java? Tool Support for Design Defect Discovery in
  Python",,"The Art, Science, and Engineering of Programming, 2017, Vol. 1,
  Issue 2, Article 11",10.22152/programming-journal.org/2017/1/11,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The context of this work is specification, detection and ultimately removal
of detectable harmful patterns in source code that are associated with defects
in design and implementation of software. In particular, we investigate five
code smells and four antipatterns previously defined in papers and books. Our
inquiry is about detecting those in source code written in Python programming
language, which is substantially different from all prior research, most of
which concerns Java or C-like languages. Our approach was that of software
engineers: we have processed existing research literature on the topic,
extracted both the abstract definitions of nine design defects and their
concrete implementation specifications, implemented them all in a tool we have
programmed and let it loose on a huge test set obtained from open source code
from thousands of GitHub projects. When it comes to knowledge, we have found
that more than twice as many methods in Python can be considered too long
(statistically extremely longer than their neighbours within the same project)
than in Java, but long parameter lists are seven times less likely to be found
in Python code than in Java code. We have also found that Functional
Decomposition, the way it was defined for Java, is not found in the Python code
at all, and Spaghetti Code and God Classes are extremely rare there as well.
The grounding and the confidence in these results comes from the fact that we
have performed our experiments on 32'058'823 lines of Python code, which is by
far the largest test set for a freely available Python parser. We have also
designed the experiment in such a way that it aligned with prior research on
design defect detection in Java in order to ease the comparison if we treat our
own actions as a replication. Thus, the importance of the work is both in the
unique open Python grammar of highest quality, tested on millions of lines of
code, and in the design defect detection tool which works on something else
than Java.
","[{'version': 'v1', 'created': 'Fri, 31 Mar 2017 12:47:50 GMT'}]",2017-04-03,"[['Vavrová', 'Nicole', '', 'Universiteit van Amsterdam, Netherlands'], ['Zaytsev', 'Vadim', '', 'Raincode Labs, Belgium']]","['Python', 'code smells', 'antipatterns', 'design defects', 'parsing', 'software analysis']"
12541,2106.05844,Shruti Jadon,Shruti Jadon,SemSegLoss: A python package of loss functions for semantic segmentation,"8 pages, 2 tables",,10.1016/j.simpa.2021.100078,"SIMPA_100078, Software Impacts Journal",cs.LG cs.CV eess.IV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Image Segmentation has been an active field of research as it has a wide
range of applications, ranging from automated disease detection to self-driving
cars. In recent years, various research papers proposed different loss
functions used in case of biased data, sparse segmentation, and unbalanced
dataset. In this paper, we introduce SemSegLoss, a python package consisting of
some of the well-known loss functions widely used for image segmentation. It is
developed with the intent to help researchers in the development of novel loss
functions and perform an extensive set of experiments on model architectures
for various applications. The ease-of-use and flexibility of the presented
package have allowed reducing the development time and increased evaluation
strategies of machine learning models for semantic segmentation. Furthermore,
different applications that use image segmentation can use SemSegLoss because
of the generality of its functions. This wide range of applications will lead
to the development and growth of AI across all industries.
","[{'version': 'v1', 'created': 'Tue, 18 May 2021 04:27:06 GMT'}]",2021-06-11,"[['Jadon', 'Shruti', '']]","['Deep Learning', 'Image Segmentation', 'Medical Imaging', 'Lossfunctions']"
12542,2209.06691,Chen Wu,"Chen Wu, Ruqing Zhang, Jiafeng Guo, Wei Chen, Yixing Fan, Maarten de
  Rijke and Xueqi Cheng","Certified Robustness to Word Substitution Ranking Attack for Neural
  Ranking Models",Accepted by CIKM2022,,10.1145/3511808.3557256,,cs.IR,http://creativecommons.org/publicdomain/zero/1.0/,"  Neural ranking models (NRMs) have achieved promising results in information
retrieval. NRMs have also been shown to be vulnerable to adversarial examples.
A typical Word Substitution Ranking Attack (WSRA) against NRMs was proposed
recently, in which an attacker promotes a target document in rankings by adding
human-imperceptible perturbations to its text. This raises concerns when
deploying NRMs in real-world applications. Therefore, it is important to
develop techniques that defend against such attacks for NRMs. In empirical
defenses adversarial examples are found during training and used to augment the
training set. However, such methods offer no theoretical guarantee on the
models' robustness and may eventually be broken by other sophisticated WSRAs.
To escape this arms race, rigorous and provable certified defense methods for
NRMs are needed.
  To this end, we first define the \textit{Certified Top-$K$ Robustness} for
ranking models since users mainly care about the top ranked results in
real-world scenarios. A ranking model is said to be Certified Top-$K$ Robust on
a ranked list when it is guaranteed to keep documents that are out of the top
$K$ away from the top $K$ under any attack. Then, we introduce a Certified
Defense method, named CertDR, to achieve certified top-$K$ robustness against
WSRA, based on the idea of randomized smoothing. Specifically, we first
construct a smoothed ranker by applying random word substitutions on the
documents, and then leverage the ranking property jointly with the statistical
property of the ensemble to provably certify top-$K$ robustness. Extensive
experiments on two representative web search datasets demonstrate that CertDR
can significantly outperform state-of-the-art empirical defense methods for
ranking models.
","[{'version': 'v1', 'created': 'Wed, 14 Sep 2022 14:50:49 GMT'}]",2022-09-15,"[['Wu', 'Chen', ''], ['Zhang', 'Ruqing', ''], ['Guo', 'Jiafeng', ''], ['Chen', 'Wei', ''], ['Fan', 'Yixing', ''], ['de Rijke', 'Maarten', ''], ['Cheng', 'Xueqi', '']]","['Certified Top-𝐾 Robustness', 'Certified Defense', 'Word SubstitutionRanking Attack', 'Ranking Models']"
12543,2112.09842,Bahador Bahmani,Bahador Bahmani and WaiChing Sun,Manifold embedding data-driven mechanics,,,10.1016/j.jmps.2022.104927,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  This article introduces a new data-driven approach that leverages a manifold
embedding generated by the invertible neural network to improve the robustness,
efficiency, and accuracy of the constitutive-law-free simulations with limited
data. We achieve this by training a deep neural network to globally map data
from the constitutive manifold onto a lower-dimensional Euclidean vector space.
As such, we establish the relation between the norm of the mapped Euclidean
vector space and the metric of the manifold and lead to a more physically
consistent notion of distance for the material data. This treatment in return
allows us to bypass the expensive combinatorial optimization, which may
significantly speed up the model-free simulations when data are abundant and of
high dimensions. Meanwhile, the learning of embedding also improves the
robustness of the algorithm when the data is sparse or distributed unevenly in
the parametric space. Numerical experiments are provided to demonstrate and
measure the performance of the manifold embedding technique under different
circumstances. Results obtained from the proposed method and those obtained via
the classical energy norms are compared.
","[{'version': 'v1', 'created': 'Sat, 18 Dec 2021 04:38:32 GMT'}]",2022-05-19,"[['Bahmani', 'Bahador', ''], ['Sun', 'WaiChing', '']]","['data-driven mechanics', 'manifold learning', 'geodesic', 'constitutive manifold', 'model-freepredictions']"
12544,2101.11778,Kai Lukoff,"Kai Lukoff, Ulrik Lyngs, Himanshu Zade, J. Vera Liao, James Choi,
  Kaiyue Fan, Sean A. Munson, Alexis Hiniker",How the Design of YouTube Influences User Sense of Agency,"14 pages, 3 figures, Forthcoming at the CHI 2021 Conference",,10.1145/3411764.3445467,,cs.HC,http://creativecommons.org/licenses/by-sa/4.0/,"  In the attention economy, video apps employ design mechanisms like autoplay
that exploit psychological vulnerabilities to maximize watch time.
Consequently, many people feel a lack of agency over their app use, which is
linked to negative life effects such as loss of sleep. Prior design research
has innovated external mechanisms that police multiple apps, such as lockout
timers. In this work, we shift the focus to how the internal mechanisms of an
app can support user agency, taking the popular YouTube mobile app as a test
case. From a survey of 120 U.S. users, we find that autoplay and
recommendations primarily undermine sense of agency, while search and playlists
support it. From 13 co-design sessions, we find that when users have a specific
intention for how they want to use YouTube they prefer interfaces that support
greater agency. We discuss implications for how designers can help users
reclaim a sense of agency over their media use.
","[{'version': 'v1', 'created': 'Thu, 28 Jan 2021 02:16:15 GMT'}]",2021-01-29,"[['Lukoff', 'Kai', ''], ['Lyngs', 'Ulrik', ''], ['Zade', 'Himanshu', ''], ['Liao', 'J. Vera', ''], ['Choi', 'James', ''], ['Fan', 'Kaiyue', ''], ['Munson', 'Sean A.', ''], ['Hiniker', 'Alexis', '']]","['digital wellbeing', 'sense of agency', 'social media', 'YouTube']"
12545,1810.04111,Gon\c{c}alo Marcelino,"Gon\c{c}alo Marcelino, Ricardo Pinto, Jo\~ao Magalh\~aes",Ranking News-Quality Multimedia,To appear in ICMR'18,,10.1145/3206025.3206053,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  News editors need to find the photos that best illustrate a news piece and
fulfill news-media quality standards, while being pressed to also find the most
recent photos of live events. Recently, it became common to use social-media
content in the context of news media for its unique value in terms of immediacy
and quality. Consequently, the amount of images to be considered and filtered
through is now too much to be handled by a person. To aid the news editor in
this process, we propose a framework designed to deliver high-quality,
news-press type photos to the user. The framework, composed of two parts, is
based on a ranking algorithm tuned to rank professional media highly and a
visual SPAM detection module designed to filter-out low-quality media. The core
ranking algorithm is leveraged by aesthetic, social and deep-learning semantic
features. Evaluation showed that the proposed framework is effective at finding
high-quality photos (true-positive rate) achieving a retrieval MAP of 64.5% and
a classification precision of 70%.
","[{'version': 'v1', 'created': 'Tue, 9 Oct 2018 16:38:28 GMT'}]",2018-10-10,"[['Marcelino', 'Gonçalo', ''], ['Pinto', 'Ricardo', ''], ['Magalhães', 'João', '']]","['News photos', 'News quality', 'Visual aesthetics', 'Social-media']"
12546,1910.08373,Beomjun Kim,"Beomjun Kim, Jean Ponce, Bumsub Ham",Deformable Kernel Networks for Joint Image Filtering,"International Journal of Computer Vision (2020). arXiv admin note:
  substantial text overlap with arXiv:1903.11286",,10.1007/s11263-020-01386-z,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Joint image filters are used to transfer structural details from a guidance
picture used as a prior to a target image, in tasks such as enhancing spatial
resolution and suppressing noise. Previous methods based on convolutional
neural networks (CNNs) combine nonlinear activations of spatially-invariant
kernels to estimate structural details and regress the filtering result. In
this paper, we instead learn explicitly sparse and spatially-variant kernels.
We propose a CNN architecture and its efficient implementation, called the
deformable kernel network (DKN), that outputs sets of neighbors and the
corresponding weights adaptively for each pixel. The filtering result is then
computed as a weighted average. We also propose a fast version of DKN that runs
about seventeen times faster for an image of size 640 x 480. We demonstrate the
effectiveness and flexibility of our models on the tasks of depth map
upsampling, saliency map upsampling, cross-modality image restoration, texture
removal, and semantic segmentation. In particular, we show that the weighted
averaging process with sparsely sampled 3 x 3 kernels outperforms the state of
the art by a significant margin in all cases.
","[{'version': 'v1', 'created': 'Thu, 17 Oct 2019 06:55:40 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Sep 2020 01:29:38 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Oct 2020 01:55:17 GMT'}]",2020-10-22,"[['Kim', 'Beomjun', ''], ['Ponce', 'Jean', ''], ['Ham', 'Bumsub', '']]","['Joint filtering', 'convolutional neural networks', 'depth map upsampling', 'cross-modality image restoration', 'texture removal', 'semantic segmentation']"
12547,2002.11686,Jaidip Kotak,Jaidip Kotak and Yuval Elovici,IoT Device Identification Using Deep Learning,,,10.1007/978-3-030-57805-3_8,,cs.CR cs.LG cs.NI eess.SP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The growing use of IoT devices in organizations has increased the number of
attack vectors available to attackers due to the less secure nature of the
devices. The widely adopted bring your own device (BYOD) policy which allows an
employee to bring any IoT device into the workplace and attach it to an
organization's network also increases the risk of attacks. In order to address
this threat, organizations often implement security policies in which only the
connection of white-listed IoT devices is permitted. To monitor adherence to
such policies and protect their networks, organizations must be able to
identify the IoT devices connected to their networks and, more specifically, to
identify connected IoT devices that are not on the white-list (unknown
devices). In this study, we applied deep learning on network traffic to
automatically identify IoT devices connected to the network. In contrast to
previous work, our approach does not require that complex feature engineering
be applied on the network traffic, since we represent the communication
behavior of IoT devices using small images built from the IoT devices network
traffic payloads. In our experiments, we trained a multiclass classifier on a
publicly available dataset, successfully identifying 10 different IoT devices
and the traffic of smartphones and computers, with over 99% accuracy. We also
trained multiclass classifiers to detect unauthorized IoT devices connected to
the network, achieving over 99% overall average detection accuracy.
","[{'version': 'v1', 'created': 'Tue, 25 Feb 2020 12:24:49 GMT'}]",2020-09-25,"[['Kotak', 'Jaidip', ''], ['Elovici', 'Yuval', '']]","['Internet of Things (IoT)', 'Cyber Security', 'Deep Learning', 'IoT Device Identification']"
12548,2210.13205,Aleksander Byrski,"Mateusz Godzik, Jacek Dajda, Marek Kisiel-Dorohinicki, Aleksander
  Byrski, Leszek Rutkowski, Patryk Orzechowski, Joost Wagenaar, Jason H. Moore","Applying Autonomous Hybrid Agent-based Computing to Difficult
  Optimization Problems",,"Journal of Computational Science, Volume 64, October 2022, 101858",10.1016/j.jocs.2022.101858,,cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Evolutionary multi-agent systems (EMASs) are very good at dealing with
difficult, multi-dimensional problems, their efficacy was proven theoretically
based on analysis of the relevant Markov-Chain based model. Now the research
continues on introducing autonomous hybridization into EMAS. This paper focuses
on a proposed hybrid version of the EMAS, and covers selection and introduction
of a number of hybrid operators and defining rules for starting the hybrid
steps of the main algorithm. Those hybrid steps leverage existing, well-known
and proven to be efficient metaheuristics, and integrate their results into the
main algorithm. The discussed modifications are evaluated based on a number of
difficult continuous-optimization benchmarks.
","[{'version': 'v1', 'created': 'Mon, 24 Oct 2022 13:28:35 GMT'}]",2022-10-25,"[['Godzik', 'Mateusz', ''], ['Dajda', 'Jacek', ''], ['Kisiel-Dorohinicki', 'Marek', ''], ['Byrski', 'Aleksander', ''], ['Rutkowski', 'Leszek', ''], ['Orzechowski', 'Patryk', ''], ['Wagenaar', 'Joost', ''], ['Moore', 'Jason H.', '']]","['Agent-based computing', 'Hybrid metaheuristics', 'Nature-inspired algorithms']"
12549,2211.12177,Stephan Kleber,Patrick Wachter and Stephan Kleber,Analysis of the DoIP Protocol for Security Vulnerabilities,,Computer Science in Cars Symposium (CSCS 2022),10.1145/3568160.3570229,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  DoIP, which is defined in ISO 13400, is a transport protocol stack for
diagnostic data. Diagnostic data is a potential attack vector at vehicles, so
secure transmission must be guaranteed to protect sensitive data and the
vehicle. Previous work analyzed a draft version and earlier versions of the
DoIP protocol without Transport Layer Security (TLS). No formal analysis exists
for the DoIP protocol. The goal of this work is to investigate the DoIP
protocol for design flaws that may lead to security vulnerabilities and
possible attacks to exploit them. For this purpose, we deductively analyze the
DoIP protocol in a first step and subsequently confirm our conclusions
formally. For the formal analysis, we use the prover Tamarin. Based on the
results, we propose countermeasures to improve the DoIP's security.We showthat
the DoIP protocol cannot be considered secure mainly because the security
mechanisms TLS and client authentication in the DoIP protocol are not
mandatory. We propose measures to mitigate the vulnerabilities thatwe confirm
to remain after activating TLS. These require only a minor redesign of the
protocol.
","[{'version': 'v1', 'created': 'Tue, 22 Nov 2022 11:10:02 GMT'}]",2022-11-23,"[['Wachter', 'Patrick', ''], ['Kleber', 'Stephan', '']]","['DoIP', 'security assessment', 'formal analysis', 'network protocol']"
12550,2012.04517,Tom Goodman,"Tom Goodman, Karoline van Gemst, Peter Tino",A Geometric Framework for Pitch Estimation on Acoustic Musical Signals,,,10.13140/RG.2.2.22366.05444,,cs.SD cs.CG eess.AS,http://creativecommons.org/licenses/by-sa/4.0/,"  This paper presents a geometric approach to pitch estimation (PE)-an
important problem in Music Information Retrieval (MIR), and a precursor to a
variety of other problems in the field. Though there exist a number of
highly-accurate methods, both mono-pitch estimation and multi-pitch estimation
(particularly with unspecified polyphonic timbre) prove computationally and
conceptually challenging. A number of current techniques, whilst incredibly
effective, are not targeted towards eliciting the underlying mathematical
structures that underpin the complex musical patterns exhibited by acoustic
musical signals. Tackling the approach from both a theoretical and experimental
perspective, we present a novel framework, a basis for further work in the
area, and results that (whilst not state of the art) demonstrate relative
efficacy. The framework presented in this paper opens up a completely new way
to tackle PE problems, and may have uses both in traditional analytical
approaches, as well as in the emerging machine learning (ML) methods that
currently dominate the literature.
","[{'version': 'v1', 'created': 'Tue, 8 Dec 2020 16:06:58 GMT'}]",2020-12-09,"[['Goodman', 'Tom', ''], ['van Gemst', 'Karoline', ''], ['Tino', 'Peter', '']]","['Pitch Estimation', 'Signal Processing', 'Geometry', 'Visualisation', 'MusicInformation Retrieval']"
12551,2101.12255,"Alexander Badri-Spr\""owitz","Milad Shafiee Ashtiani, and Alborz Aghamaleki Sarvestani, and
  Alexander Badri-Spr\""owitz","Hybrid leg compliance enables robots to operate with sensorimotor delays
  and low control update frequencies",,,10.3389/frobt.2021.645748,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Animals locomote robustly and agile, albeit significant sensorimotor delays
of their nervous system. The sensorimotor control of legged robots is
implemented with much higher frequencies-often in the kilohertz range-and
sensor and actuator delays in the low millisecond range. But especially at
harsh impacts with unknown touch-down timing, legged robots show unstable
controller behaviors, while animals are seemingly not impacted. Here we examine
this discrepancy and suggest a hybrid robotic leg and controller design. We
implemented a physical, parallel joint compliance dimensioned in combination
with an active, virtual leg length controller. We present an extensive set of
systematic experiments both in computer simulation and hardware. Our hybrid leg
and controller design shows previously unseen robustness, in the presence of
sensorimotor delays up to 60 ms, or control frequencies as low as 20 Hz, for a
drop landing task from 1.3 leg lengths high and with a passive compliance ratio
of 0.7. In computer simulations, we report successful drop-landings of the
hybrid compliant leg from 3.8 leg lengths (1.2 m) for a 2 kg quadruped robot
with 100 Hz control frequency and a sensorimotor delay of 35 ms. The results of
our presented hybrid leg design and control provide a further explanation for
the performance robustness of animals, and the resulting discrepancy between
animals and legged robots.
","[{'version': 'v1', 'created': 'Thu, 28 Jan 2021 20:04:07 GMT'}]",2022-03-07,"[['Ashtiani', 'Milad Shafiee', ''], ['Sarvestani', 'Alborz Aghamaleki', ''], ['Badri-Spröwitz', 'Alexander', '']]","['legged robots', 'parallel and passive compliance', 'hybrid actuation and leg design', 'sensorimotor delay', 'feedback', 'latency']"
12552,2008.09785,Hung-Min Hsu,"Hung-Min Hsu, Yizhou Wang, Jenq-Neng Hwang","Traffic-Aware Multi-Camera Tracking of Vehicles Based on ReID and Camera
  Link Model",Accepted by ACM International Conference on Multimedia 2020,,10.1145/3394171.3413863,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-target multi-camera tracking (MTMCT), i.e., tracking multiple targets
across multiple cameras, is a crucial technique for smart city applications. In
this paper, we propose an effective and reliable MTMCT framework for vehicles,
which consists of a traffic-aware single camera tracking (TSCT) algorithm, a
trajectory-based camera link model (CLM) for vehicle re-identification (ReID),
and a hierarchical clustering algorithm to obtain the cross camera vehicle
trajectories. First, the TSCT, which jointly considers vehicle appearance,
geometric features, and some common traffic scenarios, is proposed to track the
vehicles in each camera separately. Second, the trajectory-based CLM is adopted
to facilitate the relationship between each pair of adjacently connected
cameras and add spatio-temporal constraints for the subsequent vehicle ReID
with temporal attention. Third, the hierarchical clustering algorithm is used
to merge the vehicle trajectories among all the cameras to obtain the final
MTMCT results. Our proposed MTMCT is evaluated on the CityFlow dataset and
achieves a new state-of-the-art performance with IDF1 of 74.93%.
","[{'version': 'v1', 'created': 'Sat, 22 Aug 2020 08:54:47 GMT'}, {'version': 'v2', 'created': 'Sun, 30 Aug 2020 04:47:55 GMT'}]",2020-09-01,"[['Hsu', 'Hung-Min', ''], ['Wang', 'Yizhou', ''], ['Hwang', 'Jenq-Neng', '']]","['MTMCT', 'multi-camera tracking', 'traffic-aware single camera tracking', 'camera link model', 'vehicle ReID', 'hierarchical clustering']"
12553,1712.05647,Ribana Roscher,"Ribana Roscher, Katja Herzog, Annemarie Kunkel, Anna Kicherer,
  Reinhard T\""opfer, Wolfgang F\""orstner","Automated Image Analysis Framework for the High-Throughput Determination
  of Grapevine Berry Sizes Using Conditional Random Fields",,"Computers and Electronics in Agriculture 100 (2014), 148--158",10.1016/j.compag.2013.11.008,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The berry size is one of the most important fruit traits in grapevine
breeding. Non-invasive, image-based phenotyping promises a fast and precise
method for the monitoring of the grapevine berry size. In the present study an
automated image analyzing framework was developed in order to estimate the size
of grapevine berries from images in a high-throughput manner. The framework
includes (i) the detection of circular structures which are potentially berries
and (ii) the classification of these into the class 'berry' or 'non-berry' by
utilizing a conditional random field. The approach used the concept of a
one-class classification, since only the target class 'berry' is of interest
and needs to be modeled. Moreover, the classification was carried out by using
an automated active learning approach, i.e no user interaction is required
during the classification process and in addition, the process adapts
automatically to changing image conditions, e.g. illumination or berry color.
The framework was tested on three datasets consisting in total of 139 images.
The images were taken in an experimental vineyard at different stages of
grapevine growth according to the BBCH scale. The mean berry size of a plant
estimated by the framework correlates with the manually measured berry size by
$0.88$.
","[{'version': 'v1', 'created': 'Fri, 15 Dec 2017 12:51:37 GMT'}]",2017-12-18,"[['Roscher', 'Ribana', ''], ['Herzog', 'Katja', ''], ['Kunkel', 'Annemarie', ''], ['Kicherer', 'Anna', ''], ['Töpfer', 'Reinhard', ''], ['Förstner', 'Wolfgang', '']]","['grapevine', 'phenotyping', 'berry size', 'images', 'conditional random fields', 'machinevision']"
12554,2006.08505,Thomas Pierrot,"Thomas Pierrot, Valentin Mac\'e, F\'elix Chalumeau, Arthur Flajolet,
  Geoffrey Cideron, Karim Beguir, Antoine Cully, Olivier Sigaud and Nicolas
  Perrin-Gilbert","Diversity Policy Gradient for Sample Efficient Quality-Diversity
  Optimization","Add several baselines (Policy Gradient assisted MAP Elites, DIAYN,
  AGAC) Change writing to take the point of view of the evo community Change
  style, writing, explanation, figures",,10.1145/3512290.3528845,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A fascinating aspect of nature lies in its ability to produce a large and
diverse collection of organisms that are all high-performing in their niche. By
contrast, most AI algorithms focus on finding a single efficient solution to a
given problem. Aiming for diversity in addition to performance is a convenient
way to deal with the exploration-exploitation trade-off that plays a central
role in learning. It also allows for increased robustness when the returned
collection contains several working solutions to the considered problem, making
it well-suited for real applications such as robotics. Quality-Diversity (QD)
methods are evolutionary algorithms designed for this purpose. This paper
proposes a novel algorithm, QDPG, which combines the strength of Policy
Gradient algorithms and Quality Diversity approaches to produce a collection of
diverse and high-performing neural policies in continuous control environments.
The main contribution of this work is the introduction of a Diversity Policy
Gradient (DPG) that exploits information at the time-step level to drive
policies towards more diversity in a sample-efficient manner. Specifically,
QDPG selects neural controllers from a MAP-Elites grid and uses two
gradient-based mutation operators to improve both quality and diversity. Our
results demonstrate that QDPG is significantly more sample-efficient than its
evolutionary competitors.
","[{'version': 'v1', 'created': 'Mon, 15 Jun 2020 16:04:06 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Apr 2021 12:15:55 GMT'}, {'version': 'v3', 'created': 'Thu, 25 Nov 2021 13:18:38 GMT'}, {'version': 'v4', 'created': 'Thu, 3 Feb 2022 23:14:08 GMT'}, {'version': 'v5', 'created': 'Tue, 31 May 2022 08:57:21 GMT'}]",2022-06-01,"[['Pierrot', 'Thomas', ''], ['Macé', 'Valentin', ''], ['Chalumeau', 'Félix', ''], ['Flajolet', 'Arthur', ''], ['Cideron', 'Geoffrey', ''], ['Beguir', 'Karim', ''], ['Cully', 'Antoine', ''], ['Sigaud', 'Olivier', ''], ['Perrin-Gilbert', 'Nicolas', '']]","['Quality-Diversity', 'MAP-Elites', 'Neuroevolution', 'Policy Gradient']"
12555,1905.08415,Angel Beltre,"Pankaj Saha, Angel Beltre, Piotr Uminski, Madhusudhan Govindaraju",Evaluation of Docker Containers for Scientific Workloads in the Cloud,,"PEARC 2018 Proceedings of the Practice and Experience on Advanced
  Research Computing",10.1145/3219104.3229280,,cs.PF cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The HPC community is actively researching and evaluating tools to support
execution of scientific applications in cloud-based environments. Among the
various technologies, containers have recently gained importance as they have
significantly better performance compared to full-scale virtualization, support
for microservices and DevOps, and work seamlessly with workflow and
orchestration tools. Docker is currently the leader in containerization
technology because it offers low overhead, flexibility, portability of
applications, and reproducibility. Singularity is another container solution
that is of interest as it is designed specifically for scientific applications.
It is important to conduct performance and feature analysis of the container
technologies to understand their applicability for each application and target
execution environment. This paper presents a (1) performance evaluation of
Docker and Singularity on bare metal nodes in the Chameleon cloud (2) mechanism
by which Docker containers can be mapped with InfiniBand hardware with RDMA
communication and (3) analysis of mapping elements of parallel workloads to the
containers for optimal resource management with container-ready orchestration
tools. Our experiments are targeted toward application developers so that they
can make informed decisions on choosing the container technologies and
approaches that are suitable for their HPC workloads on cloud infrastructure.
Our performance analysis shows that scientific workloads for both Docker and
Singularity based containers can achieve near-native performance. Singularity
is designed specifically for HPC workloads. However, Docker still has
advantages over Singularity for use in clouds as it provides overlay networking
and an intuitive way to run MPI applications with one container per rank for
fine-grained resources allocation.
","[{'version': 'v1', 'created': 'Tue, 21 May 2019 03:03:37 GMT'}]",2019-05-23,"[['Saha', 'Pankaj', ''], ['Beltre', 'Angel', ''], ['Uminski', 'Piotr', ''], ['Govindaraju', 'Madhusudhan', '']]","['Docker', 'Singularity', 'scientific workloads']"
12556,2009.06848,Ali Ghanbari,"Ali Ghanbari, Andrian Marcus","PRF: A Framework for Building Automatic Program Repair Prototypes for
  JVM-Based Languages","Proceedings of the 28th ACM Joint European Software Engineering
  Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE
  '20)",,10.1145/3368089.3417929,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  PRF is a Java-based framework that allows researchers to build prototypes of
test-based generate-and-validate automatic program repair techniques for JVM
languages by simply extending it with their patch generation plugins. The
framework also provides other useful components for constructing automatic
program repair tools, e.g., a fault localization component that provides
spectrum-based fault localization information at different levels of
granularity, a configurable and safe patch validation component that is 11+X
faster than vanilla testing, and a customizable post-processing component to
generate fix reports. A demo video of PRF is available at
https://bit.ly/3ehduSS.
","[{'version': 'v1', 'created': 'Tue, 15 Sep 2020 03:07:53 GMT'}]",2020-09-16,"[['Ghanbari', 'Ali', ''], ['Marcus', 'Andrian', '']]","['Automatic Program Repair', 'Framework', 'Fault Localization', 'PatchValidation']"
12557,2012.15059,Rakshitha Godahewa,"Rakshitha Godahewa, Kasun Bandara, Geoffrey I. Webb, Slawek Smyl,
  Christoph Bergmeir",Ensembles of Localised Models for Time Series Forecasting,"37 pages, 6 figures, 6 tables",Knowledge-Based Systems (2021) 107518,10.1016/j.knosys.2021.107518,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With large quantities of data typically available nowadays, forecasting
models that are trained across sets of time series, known as Global Forecasting
Models (GFM), are regularly outperforming traditional univariate forecasting
models that work on isolated series. As GFMs usually share the same set of
parameters across all time series, they often have the problem of not being
localised enough to a particular series, especially in situations where
datasets are heterogeneous. We study how ensembling techniques can be used with
generic GFMs and univariate models to solve this issue. Our work systematises
and compares relevant current approaches, namely clustering series and training
separate submodels per cluster, the so-called ensemble of specialists approach,
and building heterogeneous ensembles of global and local models. We fill some
gaps in the existing GFM localisation approaches, in particular by
incorporating varied clustering techniques such as feature-based clustering,
distance-based clustering and random clustering, and generalise them to use
different underlying GFM model types. We then propose a new methodology of
clustered ensembles where we train multiple GFMs on different clusters of
series, obtained by changing the number of clusters and cluster seeds. Using
Feed-forward Neural Networks, Recurrent Neural Networks, and Pooled Regression
models as the underlying GFMs, in our evaluation on eight publicly available
datasets, the proposed models are able to achieve significantly higher accuracy
than baseline GFM models and univariate forecasting methods.
","[{'version': 'v1', 'created': 'Wed, 30 Dec 2020 06:33:51 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Sep 2021 07:10:40 GMT'}]",2021-09-22,"[['Godahewa', 'Rakshitha', ''], ['Bandara', 'Kasun', ''], ['Webb', 'Geoffrey I.', ''], ['Smyl', 'Slawek', ''], ['Bergmeir', 'Christoph', '']]","['Time Series Forecasting', 'Feed-Forward Neural Networks', 'Recurrent NeuralNetworks', 'Pooled Regression', 'Ensemble Models']"
12558,1905.11391,Diana Sousa,"Diana Sousa, Andre Lamurias, Francisco M. Couto",Using Neural Networks for Relation Extraction from Biomedical Literature,Artificial Neural Networks book (Springer) - Chapter 14,"Artificial Neural Networks. Methods in Molecular Biology, vol
  2190. Humana, New York, NY. 2020. pp. 289-305",10.1007/978-1-0716-0826-5_14,,cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using different sources of information to support automated extracting of
relations between biomedical concepts contributes to the development of our
understanding of biological systems. The primary comprehensive source of these
relations is biomedical literature. Several relation extraction approaches have
been proposed to identify relations between concepts in biomedical literature,
namely, using neural networks algorithms. The use of multichannel architectures
composed of multiple data representations, as in deep neural networks, is
leading to state-of-the-art results. The right combination of data
representations can eventually lead us to even higher evaluation scores in
relation extraction tasks. Thus, biomedical ontologies play a fundamental role
by providing semantic and ancestry information about an entity. The
incorporation of biomedical ontologies has already been proved to enhance
previous state-of-the-art results.
","[{'version': 'v1', 'created': 'Mon, 27 May 2019 09:33:29 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Sep 2020 13:40:39 GMT'}]",2020-09-21,"[['Sousa', 'Diana', ''], ['Lamurias', 'Andre', ''], ['Couto', 'Francisco M.', '']]","['Relation Extraction', 'Biomedical Literature', 'Neural Networks', 'Deep Learning', 'Ontologies', 'External Sources of Knowledge']"
12559,2108.05846,Zhipeng Gao,"Zhipeng Gao, Xin Xia, David Lo, John Grundy, Thomas Zimmermann",Automating the Removal of Obsolete TODO Comments,,,10.1145/3468264.3468553,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  TODO comments are very widely used by software developers to describe their
pending tasks during software development. However, after performing the task
developers sometimes neglect or simply forget to remove the TODO comment,
resulting in obsolete TODO comments. These obsolete TODO comments can confuse
development teams and may cause the introduction of bugs in the future,
decreasing the software's quality and maintainability. In this work, we propose
a novel model, named TDCleaner (TODO comment Cleaner), to identify obsolete
TODO comments in software projects. TDCleaner can assist developers in
just-in-time checking of TODO comments status and avoid leaving obsolete TODO
comments. Our approach has two main stages: offline learning and online
prediction. During offline learning, we first automatically establish
<code_change, todo_comment, commit_msg> training samples and leverage three
neural encoders to capture the semantic features of TODO comment, code change
and commit message respectively. TDCleaner then automatically learns the
correlations and interactions between different encoders to estimate the final
status of the TODO comment. For online prediction, we check a TODO comment's
status by leveraging the offline trained model to judge the TODO comment's
likelihood of being obsolete. We built our dataset by collecting TODO comments
from the top-10,000 Python and Java Github repositories and evaluated TDCleaner
on them. Extensive experimental results show the promising performance of our
model over a set of benchmarks. We also performed an in-the-wild evaluation
with real-world software projects, we reported 18 obsolete TODO comments
identified by TDCleaner to Github developers and 9 of them have already been
confirmed and removed by the developers, demonstrating the practical usage of
our approach.
","[{'version': 'v1', 'created': 'Thu, 12 Aug 2021 16:51:56 GMT'}]",2021-08-13,"[['Gao', 'Zhipeng', ''], ['Xia', 'Xin', ''], ['Lo', 'David', ''], ['Grundy', 'John', ''], ['Zimmermann', 'Thomas', '']]","['TODO comment', 'Obsolete comment', 'Code-Comment Inconsistency', 'Code-comment co-evolution', 'BERT model']"
12560,2206.13831,Kuang-Chen Lu,"Kuang-Chen Lu (Brown University, USA), Ben Greenman (Brown University,
  USA), Carl Meyer (Meta, USA), Dino Viehland (Meta, USA), Aniket Panse (Meta,
  USA), Shriram Krishnamurthi (Brown University, USA)",Gradual Soundness: Lessons from Static Python,,"The Art, Science, and Engineering of Programming, 2023, Vol. 7,
  Issue 1, Article 2",10.22152/programming-journal.org/2023/7/2,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Gradually-typed languages allow typed and untyped code to
interoperate, but typically come with significant drawbacks. In some languages,
the types are unreliable; in others, communication across type boundaries can
be extremely expensive; and still others allow only limited forms of
interoperability. The research community is actively seeking a sound, fast, and
expressive approach to gradual typing.
  Inquiry: This paper describes Static Python, a language developed by
engineers at Instagram that has proven itself sound, fast, and reasonably
expressive in production. Static Python's approach to gradual types is
essentially a programmer-tunable combination of the concrete and transient
approaches from the literature. Concrete types provide full soundness and low
performance overhead, but impose nonlocal constraints. Transient types are
sound in a shallow sense and easier to use; they help to bridge the gap between
untyped code and typed concrete code.
  Approach: We evaluate the language in its current state and develop a model
that captures the essence of its approach to gradual types. We draw upon
personal communication, bug reports, and the Static Python regression test
suite to develop this model.
  Knowledge: Our main finding is that the gradual soundness that arises from a
mix of concrete and transient types is an effective way to lower the
maintenance cost of the concrete approach. We also find that method-based JIT
technology can eliminate the costs of the transient approach. On a more
technical level, this paper describes two contributions: a model of Static
Python and a performance evaluation of Static Python. The process of
formalization found several errors in the implementation, including fatal
errors.
  Grounding: Our model of Static Python is implemented in PLT Redex and tested
using property-based soundness tests and 265 tests from the Static Python
regression suite. This paper includes a small core of the model to convey the
main ideas of the Static Python approach and its soundness. Our performance
claims are based on production experience in the Instagram web server.
Migrations to Static Python in the server have caused a 3.7\% increase in
requests handled per second at maximum CPU load.
  Importance: Static Python is the first sound gradual language whose
piece-meal application to a realistic codebase has consistently improved
performance. Other language designers may wish to replicate its approach,
especially those who currently maintain unsound gradual languages and are
seeking a path to soundness.
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2022 08:53:44 GMT'}]",2022-06-29,"[['Lu', 'Kuang-Chen', '', 'Brown University, USA'], ['Greenman', 'Ben', '', 'Brown University,\n  USA'], ['Meyer', 'Carl', '', 'Meta, USA'], ['Viehland', 'Dino', '', 'Meta, USA'], ['Panse', 'Aniket', '', 'Meta,\n  USA'], ['Krishnamurthi', 'Shriram', '', 'Brown University, USA']]","['gradual typing', 'migratory typing', 'language design', 'concrete types', 'shallow types']"
12561,1912.12941,Kilian Hendrickx,"Kilian Hendrickx, Wannes Meert, Yves Mollet, Johan Gyselinck, Bram
  Cornelis, Konstantinos Gryllias, Jesse Davis","A general anomaly detection framework for fleet-based condition
  monitoring of machines","Accepted in Mechanical Systems and Signal Processing, SI: Machine
  Diagnostics by AI",,10.1016/j.ymssp.2019.106585,,cs.LG eess.SP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine failures decrease up-time and can lead to extra repair costs or even
to human casualties and environmental pollution. Recent condition monitoring
techniques use artificial intelligence in an effort to avoid time-consuming
manual analysis and handcrafted feature extraction. Many of these only analyze
a single machine and require a large historical data set. In practice, this can
be difficult and expensive to collect. However, some industrial condition
monitoring applications involve a fleet of similar operating machines. In most
of these applications, it is safe to assume healthy conditions for the majority
of machines. Deviating machine behavior is then an indicator for a machine
fault. This work proposes an unsupervised, generic, anomaly detection framework
for fleet-based condition monitoring. It uses generic building blocks and
offers three key advantages. First, a historical data set is not required due
to online fleet-based comparisons. Second, it allows incorporating domain
expertise by user-defined comparison measures. Finally, contrary to most
black-box artificial intelligence techniques, easy interpretability allows a
domain expert to validate the predictions made by the framework. Two use-cases
on an electrical machine fleet demonstrate the applicability of the framework
to detect a voltage unbalance by means of electrical and vibration signatures.
","[{'version': 'v1', 'created': 'Mon, 30 Dec 2019 14:35:45 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Jan 2020 11:10:06 GMT'}, {'version': 'v3', 'created': 'Tue, 7 Jan 2020 11:06:06 GMT'}]",2020-01-14,"[['Hendrickx', 'Kilian', ''], ['Meert', 'Wannes', ''], ['Mollet', 'Yves', ''], ['Gyselinck', 'Johan', ''], ['Cornelis', 'Bram', ''], ['Gryllias', 'Konstantinos', ''], ['Davis', 'Jesse', '']]","['Anomaly detection', 'Clustering', 'Fleet monitoring', 'Condition monitoring', 'Electrical motors']"
12562,2203.17211,Evgeny Stemasov,"Evgeny Stemasov, Tobias Wagner, Jan Gugenheimer, Enrico Rukzio","ShapeFindAR: Exploring In-Situ Spatial Search for Physical Artifact
  Retrieval using Mixed Reality","10 pages, 10 figures. Preprint of a conditionally accepted paper to
  appear in the Proceedings of the CHI Conference on Human Factors in Computing
  Systems (CHI '22), April 29-May 5, 2022, New Orleans, LA, USA. ACM",,10.1145/3491102.3517682,,cs.HC cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Personal fabrication is made more accessible through repositories like
Thingiverse, as they replace modeling with retrieval. However, they require
users to translate spatial requirements to keywords, which paints an incomplete
picture of physical artifacts: proportions or morphology are non-trivially
encoded through text only. We explore a vision of in-situ spatial search for
(future) physical artifacts, and present ShapeFindAR, a mixed-reality tool to
search for 3D models using in-situ sketches blended with textual queries. With
ShapeFindAR, users search for geometry, and not necessarily precise labels,
while coupling the search process to the physical environment (e.g., by
sketching in-situ, extracting search terms from objects present, or tracing
them). We developed ShapeFindAR for HoloLens 2, connected to a database of
3D-printable artifacts. We specify in-situ spatial search, describe its
advantages, and present walkthroughs using ShapeFindAR, which highlight novel
ways for users to articulate their wishes, without requiring complex modeling
tools or profound domain knowledge.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2022 17:37:26 GMT'}]",2022-04-01,"[['Stemasov', 'Evgeny', ''], ['Wagner', 'Tobias', ''], ['Gugenheimer', 'Jan', ''], ['Rukzio', 'Enrico', '']]","['Personal Fabrication', 'Spatial Search', 'In-Situ Search', 'Mixed Reality', 'Physical Artifact Retrieval', 'Model Repositories', '3D-Printing']"
12563,2209.06119,Ravin Kumar,Ravin Kumar,"APTx: better activation function than MISH, SWISH, and ReLU's variants
  used in deep learning","8 pages, 6 figures","International Journal of Artificial Intelligence and Machine
  Learning, 2(2), 56-61 (2022)",10.51483/IJAIML.2.2.2022.56-61,,cs.LG cs.AI cs.CV cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Activation Functions introduce non-linearity in the deep neural networks.
This nonlinearity helps the neural networks learn faster and efficiently from
the dataset. In deep learning, many activation functions are developed and used
based on the type of problem statement. ReLU's variants, SWISH, and MISH are
goto activation functions. MISH function is considered having similar or even
better performance than SWISH, and much better than ReLU. In this paper, we
propose an activation function named APTx which behaves similar to MISH, but
requires lesser mathematical operations to compute. The lesser computational
requirements of APTx does speed up the model training, and thus also reduces
the hardware requirement for the deep learning model.
","[{'version': 'v1', 'created': 'Sat, 10 Sep 2022 14:26:04 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Sep 2022 16:51:19 GMT'}, {'version': 'v3', 'created': 'Fri, 23 Sep 2022 17:39:14 GMT'}]",2022-10-21,"[['Kumar', 'Ravin', '']]","['Activation functions', 'ReLU', 'Leaky ReLU', 'ELU', 'SWISH', 'MISH', 'Neural']"
12564,1904.06311,Cl\'ement Elvira,"Cl\'ement Elvira and R\'emi Gribonval and Charles Soussen and C\'edric
  Herzet",When does OMP achieve exact recovery with continuous dictionaries?,"52 pages, 2 figures",,10.1016/j.acha.2020.12.002,,cs.IT math.IT physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents new theoretical results on sparse recovery guarantees for
a greedy algorithm, Orthogonal Matching Pursuit (OMP), in the context of
continuous parametric dictionaries. Here, the continuous setting means that the
dictionary is made up of an infinite uncountable number of atoms. In this work,
we rely on the Hilbert structure of the observation space to express our
recovery results as a property of the kernel defined by the inner product
between two atoms. Using a continuous extension of Tropp's Exact Recovery
Condition, we identify key assumptions allowing to analyze OMP in the
continuous setting. Under these assumptions, OMP unambiguously identifies in
exactly $k$ steps the atom parameters from any observed linear combination of
$k$ atoms. These parameters play the role of the so-called support of a sparse
representation in traditional sparse recovery. In our paper, any kernel and set
of parameters that satisfy these conditions are said to be admissible. In the
one-dimensional setting, we exhibit a family of kernels relying on completely
monotone functions for which admissibility holds for any set of atom
parameters. For higher dimensional parameter spaces, the analysis turns out to
be more subtle. An additional assumption, so-called axis admissibility, is
imposed to ensure a form of delayed recovery (in at most $k^D$ steps, where $D$
is the dimension of the parameter space). Furthermore, guarantees for recovery
in exactly $k$ steps are derived under an additional algebraic condition
involving a finite subset of atoms (built as an extension of the set of atoms
to be recovered). We show that the latter technical conditions simplify in the
case of Laplacian kernels, allowing us to derive simple conditions for $k$-step
exact recovery, and to carry out a coherence-based analysis in terms of a
minimum separation assumption between the atoms to be recovered.
","[{'version': 'v1', 'created': 'Fri, 12 Apr 2019 16:34:36 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Apr 2019 14:45:40 GMT'}, {'version': 'v3', 'created': 'Mon, 22 Jun 2020 06:42:33 GMT'}]",2020-12-23,"[['Elvira', 'Clément', ''], ['Gribonval', 'Rémi', ''], ['Soussen', 'Charles', ''], ['Herzet', 'Cédric', '']]","['sparse representation', 'continuous dictionaries', 'OrthogonalMatching Pursuit', 'exact recovery']"
12565,2104.02653,Ad\'in Ram\'irez Rivera,"Miguel Rodr\'iguez Santander, Juan Hern\'andez Albarrac\'in, Ad\'in
  Ram\'irez Rivera","On the Pitfalls of Learning with Limited Data: A Facial Expression
  Recognition Case Study",To appear in Expert Systems with Applications,"Expert Syst. Appl. 2021, 18 (1) 114991",10.1016/j.eswa.2021.114991,,cs.CV cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Deep learning models need large amounts of data for training. In video
recognition and classification, significant advances were achieved with the
introduction of new large databases. However, the creation of large-databases
for training is infeasible in several scenarios. Thus, existing or small
collected databases are typically joined and amplified to train these models.
Nevertheless, training neural networks on limited data is not straightforward
and comes with a set of problems. In this paper, we explore the effects of
stacking databases, model initialization, and data amplification techniques
when training with limited data on deep learning models' performance. We
focused on the problem of Facial Expression Recognition from videos. We
performed an extensive study with four databases at a different complexity and
nine deep-learning architectures for video classification. We found that (i)
complex training sets translate better to more stable test sets when trained
with transfer learning and synthetically generated data, but their performance
yields a high variance; (ii) training with more detailed data translates to
more stable performance on novel scenarios (albeit with lower performance);
(iii) merging heterogeneous data is not a straightforward improvement, as the
type of augmentation and initialization is crucial; (iv) classical data
augmentation cannot fill the holes created by joining largely separated
datasets; and (v) inductive biases help to bridge the gap when paired with
synthetic data, but this data is not enough when working with standard
initialization techniques.
","[{'version': 'v1', 'created': 'Fri, 2 Apr 2021 18:53:41 GMT'}]",2021-07-05,"[['Santander', 'Miguel Rodríguez', ''], ['Albarracín', 'Juan Hernández', ''], ['Rivera', 'Adín Ramírez', '']]","['Learning with limited data', 'Limited data', 'Video classification']"
12566,2010.00682,Minsung Kim,"Minsung Kim, Davide Venturelli, Kyle Jamieson","Towards Hybrid Classical-Quantum Computation Structures in
  Wirelessly-Networked Systems","HotNets 2020: Nineteenth ACM Workshop on Hot Topics in Networks
  (https://doi.org/10.1145/3422604.3425924)",,10.1145/3422604.3425924,,cs.NI quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With unprecedented increases in traffic load in today's wireless networks,
design challenges shift from the wireless network itself to the computational
support behind the wireless network. In this vein, there is new interest in
quantum-compute approaches because of their potential to substantially speed up
processing, and so improve network throughput. However, quantum hardware that
actually exists today is much more susceptible to computational errors than
silicon-based hardware, due to the physical phenomena of decoherence and noise.
This paper explores the boundary between the two types of
computation---classical-quantum hybrid processing for optimization problems in
wireless systems---envisioning how wireless can simultaneously leverage the
benefit of both approaches. We explore the feasibility of a hybrid system with
a real hardware prototype using one of the most advanced experimentally
available techniques today, reverse quantum annealing. Preliminary results on a
low-latency, large MIMO system envisioned in the 5G New Radio roadmap are
encouraging, showing approximately 2--10X better performance in terms of
processing time than prior published results.
","[{'version': 'v1', 'created': 'Thu, 1 Oct 2020 21:00:12 GMT'}]",2020-10-05,"[['Kim', 'Minsung', ''], ['Venturelli', 'Davide', ''], ['Jamieson', 'Kyle', '']]","['Wireless Networks', 'Quantum Computing', 'Hybrid Design', 'QuantumAnnealing', 'MIMO Detection']"
12567,2104.04451,Theron Guo,"Theron Guo, Ond\v{r}ej Roko\v{s}, Karen Veroy","Learning constitutive models from microstructural simulations via a
  non-intrusive reduced basis method",,Computer Methods in Applied Mechanics and Engineering 384 (2021),10.1016/j.cma.2021.113924,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  In order to optimally design materials, it is crucial to understand the
structure-property relations in the material by analyzing the effect of
microstructure parameters on the macroscopic properties. In computational
homogenization, the microstructure is thus explicitly modeled inside the
macrostructure, leading to a coupled two-scale formulation. Unfortunately, the
high computational costs of such multiscale simulations often render the
solution of design, optimization, or inverse problems infeasible. To address
this issue, we propose in this work a non-intrusive reduced basis method to
construct inexpensive surrogates for parametrized microscale problems; the
method is specifically well-suited for multiscale simulations since the coupled
simulation is decoupled into two independent problems: (1) solving the
microscopic problem for different (loading or material) parameters and learning
a surrogate model from the data; and (2) solving the macroscopic problem with
the learned material model. The proposed method has three key features. First,
the microscopic stress field can be fully recovered. Second, the method is able
to accurately predict the stress field for a wide range of material parameters;
furthermore, the derivatives of the effective stress with respect to the
material parameters are available and can be readily utilized in solving
optimization problems. Finally, it is more data efficient, i.e. requiring less
training data, as compared to directly performing a regression on the effective
stress. For the microstructures in the two test problems considered, the mean
approximation error of the effective stress is as low as 0.1% despite using a
relatively small training dataset. Embedded into the macroscopic problem, the
reduced order model leads to an online speed up of approximately three orders
of magnitude while maintaining a high accuracy as compared to the FE$^2$
solver.
","[{'version': 'v1', 'created': 'Fri, 9 Apr 2021 15:58:54 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Aug 2022 13:53:03 GMT'}]",2022-08-24,"[['Guo', 'Theron', ''], ['Rokoš', 'Ondřej', ''], ['Veroy', 'Karen', '']]","['Non-intrusive reduced basis method', 'proper orthogonal decomposition', 'computationalhomogenization', 'Gaussian process regression', 'multiscale analysis']"
12568,2204.01637,Maria A. Zuluaga,"Julien Audibert and Pietro Michiardi and Fr\'ed\'eric Guyard and
  S\'ebastien Marti and Maria A. Zuluaga","Do Deep Neural Networks Contribute to Multivariate Time Series Anomaly
  Detection?",,"Pattern Recognition Volume 132, December 2022,108945",10.1016/j.patcog.2022.108945,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Anomaly detection in time series is a complex task that has been widely
studied. In recent years, the ability of unsupervised anomaly detection
algorithms has received much attention. This trend has led researchers to
compare only learning-based methods in their articles, abandoning some more
conventional approaches. As a result, the community in this field has been
encouraged to propose increasingly complex learning-based models mainly based
on deep neural networks. To our knowledge, there are no comparative studies
between conventional, machine learning-based and, deep neural network methods
for the detection of anomalies in multivariate time series. In this work, we
study the anomaly detection performance of sixteen conventional, machine
learning-based and, deep neural network approaches on five real-world open
datasets. By analyzing and comparing the performance of each of the sixteen
methods, we show that no family of methods outperforms the others. Therefore,
we encourage the community to reincorporate the three categories of methods in
the anomaly detection in multivariate time series benchmarks.
","[{'version': 'v1', 'created': 'Mon, 4 Apr 2022 16:32:49 GMT'}]",2022-09-13,"[['Audibert', 'Julien', ''], ['Michiardi', 'Pietro', ''], ['Guyard', 'Frédéric', ''], ['Marti', 'Sébastien', ''], ['Zuluaga', 'Maria A.', '']]","['Anomaly detection', 'Multivariate time series', 'Neural Networks']"
12569,2101.09656,Aobo Yang,"Aobo Yang, Nan Wang, Hongbo Deng, Hongning Wang",Explanation as a Defense of Recommendation,WSDM 2021,,10.1145/3437963.3441726,,cs.IR cs.AI cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Textual explanations have proved to help improve user satisfaction on
machine-made recommendations. However, current mainstream solutions loosely
connect the learning of explanation with the learning of recommendation: for
example, they are often separately modeled as rating prediction and content
generation tasks. In this work, we propose to strengthen their connection by
enforcing the idea of sentiment alignment between a recommendation and its
corresponding explanation. At training time, the two learning tasks are joined
by a latent sentiment vector, which is encoded by the recommendation module and
used to make word choices for explanation generation. At both training and
inference time, the explanation module is required to generate explanation text
that matches sentiment predicted by the recommendation module. Extensive
experiments demonstrate our solution outperforms a rich set of baselines in
both recommendation and explanation tasks, especially on the improved quality
of its generated explanations. More importantly, our user studies confirm our
generated explanations help users better recognize the differences between
recommended items and understand why an item is recommended.
","[{'version': 'v1', 'created': 'Sun, 24 Jan 2021 06:34:36 GMT'}]",2021-01-26,"[['Yang', 'Aobo', ''], ['Wang', 'Nan', ''], ['Deng', 'Hongbo', ''], ['Wang', 'Hongning', '']]","['Explainable Recommendation', 'Natural Language Generation', 'Sentiment Alignment']"
12570,2104.01306,Jonathan Dunn,Jonathan Dunn,"Global Syntactic Variation in Seven Languages: Towards a Computational
  Dialectology",,"Frontiers in Artificial Intelligence: Language and Computation
  (2019)",10.3389/frai.2019.00015,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  The goal of this paper is to provide a complete representation of regional
linguistic variation on a global scale. To this end, the paper focuses on
removing three constraints that have previously limited work within
dialectology/dialectometry. First, rather than assuming a fixed and incomplete
set of variants, we use Computational Construction Grammar to provide a
replicable and falsifiable set of syntactic features. Second, rather than
assuming a specific area of interest, we use global language mapping based on
web-crawled and social media datasets to determine the selection of national
varieties. Third, rather than looking at a single language in isolation, we
model seven major languages together using the same methods: Arabic, English,
French, German, Portuguese, Russian, and Spanish. Results show that models for
each language are able to robustly predict the region-of-origin of held-out
samples better using Construction Grammars than using simpler syntactic
features. These global-scale experiments are used to argue that new methods in
computational sociolinguistics are able to provide more generalized models of
regional variation that are essential for understanding language variation and
change at scale.
","[{'version': 'v1', 'created': 'Sat, 3 Apr 2021 03:40:21 GMT'}]",2021-04-06,"[['Dunn', 'Jonathan', '']]","['dialectology', 'dialectometry', 'construction grammar', 'syntactic variation', 'text classification', 'language mapping', 'dialect']"
12571,1704.00768,Qunwei Li,Qunwei Li and Pramod K. Varshney,"Does Confidence Reporting from the Crowd Benefit Crowdsourcing
  Performance?","6 pages, 4 figures, SocialSens 2017. arXiv admin note: text overlap
  with arXiv:1602.00575",,10.1145/3055601.3055607,,cs.SI cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore the design of an effective crowdsourcing system for an $M$-ary
classification task. Crowd workers complete simple binary microtasks whose
results are aggregated to give the final classification decision. We consider
the scenario where the workers have a reject option so that they are allowed to
skip microtasks when they are unable to or choose not to respond to binary
microtasks. Additionally, the workers report quantized confidence levels when
they are able to submit definitive answers. We present an aggregation approach
using a weighted majority voting rule, where each worker's response is assigned
an optimized weight to maximize crowd's classification performance. We obtain a
couterintuitive result that the classification performance does not benefit
from workers reporting quantized confidence. Therefore, the crowdsourcing
system designer should employ the reject option without requiring confidence
reporting.
","[{'version': 'v1', 'created': 'Mon, 3 Apr 2017 19:09:08 GMT'}]",2017-04-05,"[['Li', 'Qunwei', ''], ['Varshney', 'Pramod K.', '']]","['Classifcation', 'crowdsourcing', 'distributed inference', 'informationfusion', 'reject option', 'confdence reporting']"
12572,2005.00817,Andrea Apicella,"Andrea Apicella, Francesco Donnarumma, Francesco Isgr\`o and Roberto
  Prevete",A survey on modern trainable activation functions,"Published in ""Neural Networks"" journal (Elsevier)","Neural Networks Volume 138, June 2021, Pages 14-32",10.1016/j.neunet.2021.01.026,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In neural networks literature, there is a strong interest in identifying and
defining activation functions which can improve neural network performance. In
recent years there has been a renovated interest of the scientific community in
investigating activation functions which can be trained during the learning
process, usually referred to as ""trainable"", ""learnable"" or ""adaptable""
activation functions. They appear to lead to better network performance.
Diverse and heterogeneous models of trainable activation function have been
proposed in the literature. In this paper, we present a survey of these models.
Starting from a discussion on the use of the term ""activation function"" in
literature, we propose a taxonomy of trainable activation functions, highlight
common and distinctive proprieties of recent and past models, and discuss main
advantages and limitations of this type of approach. We show that many of the
proposed approaches are equivalent to adding neuron layers which use fixed
(non-trainable) activation functions and some simple local rule that
constraints the corresponding weight layers.
","[{'version': 'v1', 'created': 'Sat, 2 May 2020 12:38:43 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Dec 2020 22:11:55 GMT'}, {'version': 'v3', 'created': 'Tue, 26 Jan 2021 12:55:51 GMT'}, {'version': 'v4', 'created': 'Thu, 25 Feb 2021 21:34:34 GMT'}]",2021-03-01,"[['Apicella', 'Andrea', ''], ['Donnarumma', 'Francesco', ''], ['Isgrò', 'Francesco', ''], ['Prevete', 'Roberto', '']]","['neural networks', 'machine learning', 'activation functions', 'trainable activationfunctions', 'learnable activation functions']"
12573,2106.02245,Jithin Cheriyan,Jithin Cheriyan and Bastin Tony Roy Savarimuthu and Stephen Cranefield,"Towards offensive language detection and reduction in four Software
  Engineering communities",,,10.1145/3463274.3463805,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Software Engineering (SE) communities such as Stack Overflow have become
unwelcoming, particularly through members' use of offensive language. Research
has shown that offensive language drives users away from active engagement
within these platforms. This work aims to explore this issue more broadly by
investigating the nature of offensive language in comments posted by users in
four prominent SE platforms - GitHub, Gitter, Slack and Stack Overflow (SO). It
proposes an approach to detect and classify offensive language in SE
communities by adopting natural language processing and deep learning
techniques. Further, a Conflict Reduction System (CRS), which identifies
offence and then suggests what changes could be made to minimize offence has
been proposed. Beyond showing the prevalence of offensive language in over 1
million comments from four different communities which ranges from 0.07% to
0.43%, our results show promise in successful detection and classification of
such language. The CRS system has the potential to drastically reduce manual
moderation efforts to detect and reduce offence in SE communities.
","[{'version': 'v1', 'created': 'Fri, 4 Jun 2021 04:25:09 GMT'}, {'version': 'v2', 'created': 'Sat, 12 Jun 2021 09:34:42 GMT'}]",2022-11-02,"[['Cheriyan', 'Jithin', ''], ['Savarimuthu', 'Bastin Tony Roy', ''], ['Cranefield', 'Stephen', '']]","['Offensive language detection', 'Conflict reduction', 'SE platforms']"
12574,2206.05930,Kostiantyn Khabarlak,Kostiantyn Khabarlak,Faster Optimization-Based Meta-Learning Adaptation Phase,,,10.15588/1607-3274-2022-1-10,,cs.LG cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural networks require a large amount of annotated data to learn.
Meta-learning algorithms propose a way to decrease the number of training
samples to only a few. One of the most prominent optimization-based
meta-learning algorithms is Model-Agnostic Meta-Learning (MAML). However, the
key procedure of adaptation to new tasks in MAML is quite slow. In this work we
propose an improvement to MAML meta-learning algorithm. We introduce Lambda
patterns by which we restrict which weight are updated in the network during
the adaptation phase. This makes it possible to skip certain gradient
computations. The fastest pattern is selected given an allowed quality
degradation threshold parameter. In certain cases, quality improvement is
possible by a careful pattern selection. The experiments conducted have shown
that via Lambda adaptation pattern selection, it is possible to significantly
improve the MAML method in the following areas: adaptation time has been
decreased by a factor of 3 with minimal accuracy loss; accuracy for one-step
adaptation has been substantially improved.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2022 06:57:17 GMT'}]",2022-06-14,"[['Khabarlak', 'Kostiantyn', '']]","['Model-Agnostic Meta-Learning', 'MAML', 'Adaptation Time', 'Adaptation Speed', 'Few-Shot Learning', 'Meta-Learning']"
12575,1412.0366,Natarajan Meghanathan,Natarajan Meghanathan and Philip Mumford,"Node Failure Time and Coverage Loss Time Analysis for Maximum Stability
  Vs Minimum Distance Spanning Tree based Data Gathering in Mobile Sensor
  Networks","16 pages, 11 figures","IJCNC, 5(4): 15-30, 2013",10.5121/ijcnc.2013.5402,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A mobile sensor network is a wireless network of sensor nodes that move
arbitrarily. In this paper, we explore the use of a maximum stability spanning
tree-based data gathering (Max.Stability-DG) algorithm and a minimum-distance
spanning tree-based data gathering (MST-DG) algorithm for mobile sensor
networks. We analyze the impact of these two algorithms on the node failure
times and the resulting coverage loss due to node failures. Both the
Max.Stability-DG and MST-DG algorithms are based on a greedy strategy of
determining a data gathering tree when one is needed and using that tree as
long as it exists. The Max.Stability-DG algorithm assumes the availability of
the complete knowledge of future topology changes and determines a data
gathering tree whose corresponding spanning tree would exist for the longest
time since the current time instant; whereas, the MST-DG algorithm determines a
data gathering tree whose corresponding spanning tree is the minimum distance
tree at the current time instant. We observe the Max.Stability-DG trees to
incur a longer network lifetime (time of disconnection of the network of live
sensor nodes due to node failures), a larger coverage loss time for a
particular fraction of loss of coverage as well as a lower fraction of coverage
loss at any time. The tradeoff is that the Max.Stability-DG trees incur a lower
node lifetime (the time of first node failure) due to repeated use of a data
gathering tree for a longer time.
","[{'version': 'v1', 'created': 'Mon, 1 Dec 2014 07:38:33 GMT'}]",2014-12-02,"[['Meghanathan', 'Natarajan', ''], ['Mumford', 'Philip', '']]","['Data Gathering', 'Maximum Stability', 'Minimum Distance Spanning Tree', 'Mobile Sensor Networks', 'NodeLifetime', 'Network Lifetime', 'Coverage Loss Time']"
12576,2110.07923,Chengqian Gao,"Chengqian Gao, Ke Xu, Kuangqi Zhou, Lanqing Li, Xueqian Wang, Bo Yuan,
  Peilin Zhao",Value Penalized Q-Learning for Recommender Systems,"An uncertainty based offline RL algorithm for recommender systems,
  SIGIR short paper",,10.1145/3477495.3531796,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scaling reinforcement learning (RL) to recommender systems (RS) is promising
since maximizing the expected cumulative rewards for RL agents meets the
objective of RS, i.e., improving customers' long-term satisfaction. A key
approach to this goal is offline RL, which aims to learn policies from logged
data. However, the high-dimensional action space and the non-stationary
dynamics in commercial RS intensify distributional shift issues, making it
challenging to apply offline RL methods to RS. To alleviate the action
distribution shift problem in extracting RL policy from static trajectories, we
propose Value Penalized Q-learning (VPQ), an uncertainty-based offline RL
algorithm. It penalizes the unstable Q-values in the regression target by
uncertainty-aware weights, without the need to estimate the behavior policy,
suitable for RS with a large number of items. We derive the penalty weights
from the variances across an ensemble of Q-functions. To alleviate
distributional shift issues at test time, we further introduce the critic
framework to integrate the proposed method with classic RS models. Extensive
experiments conducted on two real-world datasets show that the proposed method
could serve as a gain plugin for existing RS models.
","[{'version': 'v1', 'created': 'Fri, 15 Oct 2021 08:08:28 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Sep 2022 11:38:48 GMT'}]",2022-09-27,"[['Gao', 'Chengqian', ''], ['Xu', 'Ke', ''], ['Zhou', 'Kuangqi', ''], ['Li', 'Lanqing', ''], ['Wang', 'Xueqian', ''], ['Yuan', 'Bo', ''], ['Zhao', 'Peilin', '']]","['offline reinforcement learning', 'sequential recommender systems', 'long-term satisfaction']"
12577,2108.05150,Dipto Barman Mr.,Dipto Barman and Owen Conlan,"Exploring the Links between Personality Traits and Suscep;bility to
  Disinformation","4 pages, 1 figure, ACM conference",,10.1145/3465336.3475121,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  The growth of online Digital/social media has allowed a variety of ideas and
opinions to coexist. Social Media has appealed users due to the ease of fast
dissemination of information at low cost and easy access. However, due to the
growth in affordance of Digital platforms, users have become prone to consume
disinformation, misinformation, propaganda, and conspiracy theories. In this
paper, we wish to explore the links between the personality traits given by the
Big Five Inventory and their susceptibility to disinformation. More
speciDically, this study is attributed to capture the short- term as well as
the long-term effects of disinformation and its effects on the Dive personality
traits. Further, we expect to observe that different personalities traits have
different shifts in opinion and different increase or decrease of uncertainty
on an issue after consuming the disinformation. Based on the Dindings of this
study, we would like to propose a personalized narrative-based change in
behavior for different personality traits.
","[{'version': 'v1', 'created': 'Wed, 11 Aug 2021 10:56:10 GMT'}]",2021-08-12,"[['Barman', 'Dipto', ''], ['Conlan', 'Owen', '']]","['Disinformation', 'Susceptibility', 'Personality\tTrait', 'Change']"
12578,2002.03060,Yongzhen Wang,"Yongzhen Wang, Xiaozhong Liu, Yingnan Ju, Katy B\""orner, Jun Lin,
  Changlong Sun, Luo Si","Chinese E-Romance: Analyzing and Visualizing 7.92 Million Alibaba
  Valentine's Day Purchases","14 pages, 3 figures, 3 tables",,10.2478/dim-2021-0006,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The days that precede Valentine's Day are characterized by extensive gift
shopping activities all across the globe. In China, where much shopping takes
place online, there has been an explosive growth in e-commerce sales during
Valentine's Day over the recent years. This exploratory study investigates the
extent to which each product category and each shopper group can exhibit
romantic love within China's e-market throughout the 2 weeks leading up to 2019
Valentine's Day. Massive data from Alibaba, the biggest e-commerce retailer
worldwide, are utilized to formulate an innovative romance index (RI) to
quantitatively measure e-romantic values for products and shoppers. On this
basis, millions of shoppers, along with their millions of products purchased
around Valentine's Day, are analyzed as a case study to demonstrate their love
consumption and romantic gift-giving. The results of the analysis are then
illustrated to help understand Chinese e-romance based on the perspectives of
different product categories and shopper groups. This empirical information
visualization also contributes to improving the segmentation, targeting, and
positioning of China's e-market for Valentine's Day.
","[{'version': 'v1', 'created': 'Sat, 8 Feb 2020 01:15:02 GMT'}, {'version': 'v2', 'created': 'Sun, 3 May 2020 22:26:59 GMT'}, {'version': 'v3', 'created': 'Thu, 12 Nov 2020 16:02:29 GMT'}, {'version': 'v4', 'created': 'Fri, 7 May 2021 05:48:33 GMT'}, {'version': 'v5', 'created': 'Mon, 12 Jul 2021 03:11:07 GMT'}, {'version': 'v6', 'created': 'Fri, 20 Aug 2021 08:57:13 GMT'}]",2021-08-23,"[['Wang', 'Yongzhen', ''], ['Liu', 'Xiaozhong', ''], ['Ju', 'Yingnan', ''], ['Börner', 'Katy', ''], ['Lin', 'Jun', ''], ['Sun', 'Changlong', ''], ['Si', 'Luo', '']]","['Valentine’s Day', 'love consumption', 'romantic gift-giving', 'Alibaba', 'e-romance', 'e-commerce']"
12579,1912.07821,Sandeep Krishna Thirumala,"Sandeep Thirumala, Yi-Tse Hung, Shubham Jain, Arnab Raha, Niharika
  Thakuria, Vijay Raghunathan, Anand Raghunathan, Zhihong Chen and Sumeet Gupta","Valley-Coupled-Spintronic Non-Volatile Memories with Compute-In-Memory
  Support",,,10.1109/TNANO.2020.3012550,,cs.ET physics.app-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we propose valley-coupled spin-hall memories (VSH-MRAMs) based
on monolayer WSe2. The key features of the proposed memories are (a) the
ability to switch magnets with perpendicular magnetic anisotropy (PMA) via VSH
effect and (b) an integrated gate that can modulate the charge/spin current
(IC/IS) flow. The former attribute results in high energy efficiency (compared
to the Giant-Spin Hall (GSH) effect-based devices with in-plane magnetic
anisotropy (IMA) magnets). The latter feature leads to a compact access
transistor-less memory array design. We experimentally measure the gate
controllability of the current as well as the nonlocal resistance associated
with VSH effect. Based on the measured data, we develop a simulation framework
(using physical equations) to propose and analyze single-ended and differential
VSH effect based magnetic memories (VSH-MRAM and DVSH-MRAM, respectively). At
the array level, the proposed VSH/DVSH-MRAMs achieve 50%/ 11% lower write time,
59%/ 67% lower write energy and 35%/ 41% lower read energy at iso-sense margin,
compared to single ended/differential (GSH/DGSH)-MRAMs. System level evaluation
in the context of general purpose processor and intermittently-powered system
shows up to 3.14X and 1.98X better energy efficiency for the proposed
(D)VSH-MRAMs over (D)GSH-MRAMs respectively. Further, the differential sensing
of the proposed DVSH-MRAM leads to natural and simultaneous in-memory
computation of bit-wise AND and NOR logic functions. Using this feature, we
design a computation-in-memory (CiM) architecture that performs Boolean logic
and addition (ADD) with a single array access. System analysis performed by
integrating our DVSH-MRAM: CiM in the Nios II processor across various
application benchmarks shows up to 2.66X total energy savings, compared to
DGSH-MRAM: CiM.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2019 05:10:28 GMT'}]",2020-12-02,"[['Thirumala', 'Sandeep', ''], ['Hung', 'Yi-Tse', ''], ['Jain', 'Shubham', ''], ['Raha', 'Arnab', ''], ['Thakuria', 'Niharika', ''], ['Raghunathan', 'Vijay', ''], ['Raghunathan', 'Anand', ''], ['Chen', 'Zhihong', ''], ['Gupta', 'Sumeet', '']]","['Computing in Memory', 'Magnetic RAM', 'Non']"
12580,2301.00174,Sho Cremers,"Sho Cremers, Valentin Robu, Peter Zhang, Merlinda Andoni, Sonam Norbu,
  David Flynn","Efficient Methods for Approximating the Shapley Value for Asset Sharing
  in Energy Communities","34 pages, 10 figures, Published in Elsevier Applied Energy","Applied Energy, 331 (2022)",10.1016/j.apenergy.2022.120328,,cs.GT cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  With the emergence of energy communities, where a number of prosumers invest
in shared generation and storage, the issue of fair allocation of benefits is
increasingly important. The Shapley value has attracted increasing interest for
redistribution in energy settings - however, computing it exactly is
intractable beyond a few dozen prosumers. In this paper, we first conduct a
systematic review of the literature on the use of Shapley value in
energy-related applications, as well as efforts to compute or approximate it.
Next, we formalise the main methods for approximating the Shapley value in
community energy settings, and propose a new one, which we call the stratified
expected value approximation. To compare the performance of these methods, we
design a novel method for exact Shapley value computation, which can be applied
to communities of up to several hundred agents by clustering the prosumers into
a smaller number of demand profiles. We perform a large-scale experimental
comparison of the proposed methods, for communities of up to 200 prosumers,
using large-scale, publicly available data from two large-scale energy trials
in the UK (UKERC Energy Data Centre, 2017, UK Power Networks Innovation, 2021).
Our analysis shows that, as the number of agents in the community increases,
the relative difference to the exact Shapley value converges to under 1% for
all the approximation methods considered. In particular, for most experimental
scenarios, we show that there is no statistical difference between the newly
proposed stratified expected value method and the existing state-of-the-art
method that uses adaptive sampling (O'Brien et al., 2015), although the cost of
computation for large communities is an order of magnitude lower.
","[{'version': 'v1', 'created': 'Sat, 31 Dec 2022 10:51:22 GMT'}]",2023-01-03,"[['Cremers', 'Sho', ''], ['Robu', 'Valentin', ''], ['Zhang', 'Peter', ''], ['Andoni', 'Merlinda', ''], ['Norbu', 'Sonam', ''], ['Flynn', 'David', '']]","['energy community', 'fair allocation', 'prosumer', 'Shapley value']"
12581,2209.07282,Armin Moin,"J\""org Christian Kirchhof and Evgeny Kusmenko and Jonas Ritz and
  Bernhard Rumpe and Armin Moin and Atta Badii and Stephan G\""unnemann and
  Moharram Challenger","MDE for Machine Learning-Enabled Software Systems: A Case Study and
  Comparison of MontiAnna & ML-Quadrat","ACM / IEEE 25th International Conference on Model Driven Engineering
  Languages and Systems (MODELS 2022) Companion - MDE Intelligence Workshop",,10.1145/3550356.3561576,,cs.SE cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this paper, we propose to adopt the MDE paradigm for the development of
Machine Learning (ML)-enabled software systems with a focus on the Internet of
Things (IoT) domain. We illustrate how two state-of-the-art open-source
modeling tools, namely MontiAnna and ML-Quadrat can be used for this purpose as
demonstrated through a case study. The case study illustrates using ML, in
particular deep Artificial Neural Networks (ANNs), for automated image
recognition of handwritten digits using the MNIST reference dataset, and
integrating the machine learning components into an IoT system. Subsequently,
we conduct a functional comparison of the two frameworks, setting out an
analysis base to include a broad range of design considerations, such as the
problem domain, methods for the ML integration into larger systems, and
supported ML methods, as well as topics of recent intense interest to the ML
community, such as AutoML and MLOps. Accordingly, this paper is focused on
elucidating the potential of the MDE approach in the ML domain. This supports
the ML engineer in developing the (ML/software) model rather than implementing
the code, and additionally enforces reusability and modularity of the design
through enabling the out-of-the-box integration of ML functionality as a
component of the IoT or cyber-physical systems.
","[{'version': 'v1', 'created': 'Thu, 15 Sep 2022 13:21:16 GMT'}]",2022-12-06,"[['Kirchhof', 'Jörg Christian', ''], ['Kusmenko', 'Evgeny', ''], ['Ritz', 'Jonas', ''], ['Rumpe', 'Bernhard', ''], ['Moin', 'Armin', ''], ['Badii', 'Atta', ''], ['Günnemann', 'Stephan', ''], ['Challenger', 'Moharram', '']]","['model-driven engineering', 'artificial intelligence', 'domain specificmodeling', 'machine learning', 'tools']"
12582,1803.10201,Michael Van De Vanter,"Michael Van De Vanter (Oracle Labs, United States), Chris Seaton
  (Oracle Labs, United Kingdom), Michael Haupt (self, Germany), Christian Humer
  (Oracle Labs, Switzerland), Thomas W\""urthinger (Oracle Labs, Switzerland)","Fast, Flexible, Polyglot Instrumentation Support for Debuggers and other
  Tools",,"The Art, Science, and Engineering of Programming, 2018, Vol. 2,
  Issue 3, Article 14",10.22152/programming-journal.org/2018/2/14,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Software development tools that interact with running programs such
as debuggers, profilers, and dynamic analysis frameworks are presumed to demand
difficult tradeoffs among implementation complexity (cost), functionality,
usability, and performance. Among the many consequences, tools are often
delivered late (if ever), have limited functionality, require non-standard
configurations, and impose serious performance costs on running programs.
  Inquiry: Can flexible tool support become a practical, first class, intrinsic
requirement for a modern highperformance programming language implementation
framework?
  Approach: We extended the Truffle Language Implementation Framework, which
together with the GraalVM execution environment makes possible very high
performance language implementations. Truffle's new Instrumentation Framework
is language-agnostic and designed to derive high performance from the same
technologies as do language implementations. Truffle Instrumentation includes:
(1) low overhead capture of execution events by dynamically adding ""wrapper""
nodes to executing ASTs; (2) extensions to the Language Implementation
Framework that allow per-language specialization, primarily for visual display
of values and names, among others; and (3) versatile APIs and support services
for implementing many kinds of tools without VM modification.
  Knowledge: It is now possible for a client in a production environment to
insert (dynamically, with thread safety) an instrumentation probe that captures
and reports abstractly specified execution events. A probe in fully optimized
code imposes very low overhead until actually used to access (or modify)
execution state. Event capture has enabled construction of numerous GraalVM
services and tools that work for all implemented languages, either singly or in
combination. Instrumentation has also proved valuable for implementing some
traditionally tricky language features, as well as some GraalVM services such
as placing bounds on resources consumed by running programs.
  Grounding: Tools for debugging (via multiple clients), profiling, statement
counting, dynamic analysis, and others are now part of GraalVM or are in active
development. Third parties have also used Truffle Instrumentation for
innovative tool implementations.
  Importance: Experience with Truffle Instrumentation validates the notion that
addressing developer tools support as a forethought can change expectations
about the availability of practical, efficient tools for high-performance
languages. Tool development becomes a natural part of language implementation,
requiring little additional effort and offering the advantage of early and
continuous availability.
","[{'version': 'v1', 'created': 'Tue, 27 Mar 2018 17:37:18 GMT'}]",2018-03-28,"[['Van De Vanter', 'Michael', '', 'Oracle Labs, United States'], ['Seaton', 'Chris', '', 'Oracle Labs, United Kingdom'], ['Haupt', 'Michael', '', 'self, Germany'], ['Humer', 'Christian', '', 'Oracle Labs, Switzerland'], ['Würthinger', 'Thomas', '', 'Oracle Labs, Switzerland']]","['Virtual Machine', 'Instrumentation', 'Optimization', 'Debugging', 'Tools']"
12583,2108.07996,Shubhangi Agarwal,"Shubhangi Agarwal, Sourav Dutta, Arnab Bhattacharya","VerSaChI: Finding Statistically Significant Subgraph Matches using
  Chebyshev's Inequality",,,10.1145/3459637.3482217,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Approximate subgraph matching, which is an important primitive for many
applications like question answering, community detection, and motif discovery,
often involves large labeled graphs such as knowledge graphs, social networks,
and protein sequences. Effective methods for extracting matching subgraphs, in
terms of label and structural similarities to a query, should depict accuracy,
computational efficiency, and robustness to noise. In this paper, we propose
VerSaChI for finding the top-k most similar subgraphs based on 2-hop label and
structural overlap similarity with the query. The similarity is characterized
using Chebyshev's inequality to compute the chi-square statistical significance
for measuring the degree of matching of the subgraphs. Experiments on real-life
graph datasets showcase significant improvements in terms of accuracy compared
to state-of-the-art methods, as well as robustness to noise.
","[{'version': 'v1', 'created': 'Wed, 18 Aug 2021 06:53:39 GMT'}]",2021-08-19,"[['Agarwal', 'Shubhangi', ''], ['Dutta', 'Sourav', ''], ['Bhattacharya', 'Arnab', '']]","['Subgraph Similarity', 'Approximate Matching', 'Statistical Significance', 'Chi-Square', 'Labeled Graph', 'Chebyshev’s Inequality']"
12584,2103.06238,Benzar Glen Grepon,Benzar Glen Grepon and Aldwin Lester Martinez,"Architectural Visualization Using Virtual Reality: A User Experience in
  Simulating Buildings of a Community College in Bukidnon, Philippines",19 pages,"International Journal of Computing Sciences Research, [S.l.], v.
  5, n. 1, p. 644-662, Feb. 2021",10.25147/ijcsr.2017.001.1.64,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  The study aims to design and develop a virtual structural design that
simulates the campus and its buildings of a community college in Bukidnon,
Philippines through Virtual Reality. With the immersion of technology, this
project represents the architectural design of the establishment with the use
of Virtual Reality Technology. The project uses a modified Iterative
Development Model which is a guide for the design and development of the 3D
Models and VR Application. TinkerCAD which is a web-based application has been
used to design buildings on the other hand Unity is used to develop the
structural designs of the buildings. The respondents of this study are the
Grade 12 Senior High students from the 4 schools which are geographically near
to the college. With this study, the researchers were able to showcase its VR
Application to the students and later evaluated using a System Usability Scale,
a 10 item questionnaire measuring usability with an overall average of 90% or
Point Score of 4.5 which is interpreted as excellent in a Likert table for
descriptive interpretation. With the use of the VR application potential
students of the college will be able to visualize and experience the present
structures of the college without being physically present in the area. In this
paper, the buildings and structures of NBCC were designed and developed through
a Virtual Reality Platform allowing students from different secondary schools
that are geographically near to the college to experience the feeling to be in
the school without being able to set a step in physically.
","[{'version': 'v1', 'created': 'Mon, 15 Feb 2021 03:55:39 GMT'}]",2021-03-16,"[['Grepon', 'Benzar Glen', ''], ['Martinez', 'Aldwin Lester', '']]","['virtual reality', 'technology', 'architectural structure', 'architectural visualization', 'Philippines  INTRODUCTION']"
12585,2107.08760,Leon Moonen,"Guru Prasad Bhandari, Amara Naseer and Leon Moonen (Simula Research
  Laboratory, Norway)","CVEfixes: Automated Collection of Vulnerabilities and Their Fixes from
  Open-Source Software","Accepted for publication in Proceedings of the 17th International
  Conference on Predictive Models and Data Analytics in Software Engineering
  (PROMISE '21), August 19-20, 2021, Athens, Greece",,10.1145/3475960.3475985,,cs.SE cs.AI cs.CR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Data-driven research on the automated discovery and repair of security
vulnerabilities in source code requires comprehensive datasets of real-life
vulnerable code and their fixes. To assist in such research, we propose a
method to automatically collect and curate a comprehensive vulnerability
dataset from Common Vulnerabilities and Exposures (CVE) records in the public
National Vulnerability Database (NVD). We implement our approach in a fully
automated dataset collection tool and share an initial release of the resulting
vulnerability dataset named CVEfixes.
  The CVEfixes collection tool automatically fetches all available CVE records
from the NVD, gathers the vulnerable code and corresponding fixes from
associated open-source repositories, and organizes the collected information in
a relational database. Moreover, the dataset is enriched with meta-data such as
programming language, and detailed code and security metrics at five levels of
abstraction. The collection can easily be repeated to keep up-to-date with
newly discovered or patched vulnerabilities. The initial release of CVEfixes
spans all published CVEs up to 9 June 2021, covering 5365 CVE records for 1754
open-source projects that were addressed in a total of 5495 vulnerability
fixing commits.
  CVEfixes supports various types of data-driven software security research,
such as vulnerability prediction, vulnerability classification, vulnerability
severity prediction, analysis of vulnerability-related code changes, and
automated vulnerability repair.
","[{'version': 'v1', 'created': 'Mon, 19 Jul 2021 11:34:09 GMT'}]",2022-02-08,"[['Bhandari', 'Guru Prasad', '', 'Simula Research\n  Laboratory, Norway'], ['Naseer', 'Amara', '', 'Simula Research\n  Laboratory, Norway'], ['Moonen', 'Leon', '', 'Simula Research\n  Laboratory, Norway']]","['Security vulnerabilities', 'dataset', 'software repository mining', 'vulnerability prediction', 'vulnerability classification', 'source code repair']"
12586,2103.01769,Husein Osman Abdullahi Mr.,"Husein Osman Abdullahi, Abdikarim Abi Hassan, Murni Mahmud, Abdifatah
  Farah Ali","Determinants of ICT Adoption Among Small Scale Agribusiness Enterprises
  In Somalia","9 pages, 2 figures","IJETT, 69(2), 68-76, 2021",10.14445/22315381/IJETT-V69I2P210,,cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The use of Information and Communication Technology (ICT) can advance the
Agricultural Business sector, particularly in a country seeking opportunities
to explore the sector. There is evidence that ICT has made significant
contributions to agribusiness because it allows enterprises to manage their
operations, and it has major impacts on the business. However, the critical
factors that motivate the adoption of new innovative technology by agribusiness
enterprises are underexplored. The literature has indicated ICT adoption among
small-scale agribusiness enterprises in Somalia is not fully understood.
Nevertheless, this study addresses this gap by investigating the adoption of
ICT among small-scale agribusiness enterprises in Somalia. The paper reports
the use of the Technology, Organization, Environment (TOE) framework. An online
survey has been conducted with random sampling for data collection, with 107
respondents. The respondents are from agribusiness staff and farmers from
various agricultural companies in Somalia. After quantitative data analysis,
the results indicated that relative advantage, complexity, top management
support, and competitive pressure factors are significant contributors to ICT
adoption in Somalian agribusiness enterprises, while ICT costs and vendor
support are not significantly related to the adoption of ICT in agricultural
business. This study concludes that ICT adoption in Somalia is inspired by
insight and motivation rather than financial and external support.
Understanding these factors leads to a better understanding of ICT adoption in
Somalia. Additionally, it enriches the literature about the agriculture
business on the African continent
  Keywords: Determinants, ICT Adoption, Agribusiness, Small Scale, TOE
framework
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2021 11:25:15 GMT'}]",2021-03-03,"[['Abdullahi', 'Husein Osman', ''], ['Hassan', 'Abdikarim Abi', ''], ['Mahmud', 'Murni', ''], ['Ali', 'Abdifatah Farah', '']]","['Determinants', 'ICT Adoption', 'Agribusiness', 'Small']"
12587,2204.00454,Aleksey Gvozdarev S.,Aleksey S. Gvozdarev and Aleksandra Alischyuk and Marina Kazakova,"Impact of System Correlation Matrix Bordering on the MU-MIMO Ergodic
  Sum-Rate Capacity in the Presence of the Multipath Fading Channel","2021 4th International Conference on Advanced Communication
  Technologies and Networking (CommNet)",,10.1109/CommNet52204.2021.9641957,,cs.IT math.IT,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The research analyzes the problem of capacity analysis of the multi-user
massive multi-input multi-output systems with a banded correlation model. The
presented study impacts the analytical statistical description with closed form
expression of the ergodic sum-rate capacity of the system functioning in
presence of multipath fading channel with complex Nakagami-m statistics of the
complex transmission coefficients. Numerical verification of the derived
expressions was performed and demonstrated excellent correspondence with
simulation. The research demonstrated that the system correlation matrix (in
case when exponential model is considered) can be bordered up to pentadiagonal
structure without introducing any discrepancies in to the sum-rate capacity.
","[{'version': 'v1', 'created': 'Fri, 1 Apr 2022 14:06:34 GMT'}]",2022-04-04,"[['Gvozdarev', 'Aleksey S.', ''], ['Alischyuk', 'Aleksandra', ''], ['Kazakova', 'Marina', '']]","['MU-MIMO', 'fading', 'correlation', 'Nakagami-m', 'banded matrix']"
12588,2109.00238,Michael Kommenda,"Michael Kommenda, Andreas Beham, Michael Affenzeller, Gabriel
  Kronberger",Complexity Measures for Multi-objective Symbolic Regression,"International Conference on Computer Aided Systems Theory, Eurocast
  2015, pp 409-416","In: Moreno-D\'iaz R. et al (eds) Computer Aided Systems Theory,
  EUROCAST 2015. Lecture Notes in Computer Science, vol 9520 (2015)",10.1007/978-3-319-27340-2_51,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-objective symbolic regression has the advantage that while the accuracy
of the learned models is maximized, the complexity is automatically adapted and
need not be specified a-priori. The result of the optimization is not a single
solution anymore, but a whole Pareto-front describing the trade-off between
accuracy and complexity. In this contribution we study which complexity
measures are most appropriately used in symbolic regression when performing
multi- objective optimization with NSGA-II. Furthermore, we present a novel
complexity measure that includes semantic information based on the function
symbols occurring in the models and test its effects on several benchmark
datasets. Results comparing multiple complexity measures are presented in terms
of the achieved accuracy and model length to illustrate how the search
direction of the algorithm is affected.
","[{'version': 'v1', 'created': 'Wed, 1 Sep 2021 08:22:41 GMT'}]",2021-09-02,"[['Kommenda', 'Michael', ''], ['Beham', 'Andreas', ''], ['Affenzeller', 'Michael', ''], ['Kronberger', 'Gabriel', '']]","['Symbolic Regression', 'Complexity Measures', 'Multi-objectiveOptimization', 'NSGA-II', 'Genetic Programming']"
12589,2204.03301,Daniel Kershaw,Daniel Kershaw and Rob Koeling,Sequence-Based Extractive Summarisation for Scientific Articles,7 pages,,10.1145/3487553.3524637,,cs.CL cs.IR,http://creativecommons.org/licenses/by/4.0/,"  This paper presents the results of research on supervised extractive text
summarisation for scientific articles. We show that a simple sequential tagging
model based only on the text within a document achieves high results against a
simple classification model. Improvements can be achieved through additional
sentence-level features, though these were minimal. Through further analysis,
we show the potential of the sequential model relying on the structure of the
document depending on the academic discipline which the document is from.
","[{'version': 'v1', 'created': 'Thu, 7 Apr 2022 09:09:33 GMT'}]",2022-04-08,"[['Kershaw', 'Daniel', ''], ['Koeling', 'Rob', '']]","['summerisation', 'neural networks', 'extractive', 'corpus', 'scientific texts']"
12590,2110.07433,Joshua Peeples,"Joshua Peeples, Daniel Suen, Alina Zare, James Keller","Possibilistic Fuzzy Local Information C-Means with Automated Feature
  Selection for Seafloor Segmentation","Proc. SPIE 10628, Detection and Sensing of Mines, Explosive Objects,
  and Obscured Targets XXIII (30 April 2018), 14 pages, 7 figures, 5 tables",,10.1117/12.2305178,,cs.CV cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The Possibilistic Fuzzy Local Information C-Means (PFLICM) method is
presented as a technique to segment side-look synthetic aperture sonar (SAS)
imagery into distinct regions of the sea-floor. In this work, we investigate
and present the results of an automated feature selection approach for SAS
image segmentation. The chosen features and resulting segmentation from the
image will be assessed based on a select quantitative clustering validity
criterion and the subset of the features that reach a desired threshold will be
used for the segmentation process.
","[{'version': 'v1', 'created': 'Thu, 14 Oct 2021 15:00:12 GMT'}]",2022-03-03,"[['Peeples', 'Joshua', ''], ['Suen', 'Daniel', ''], ['Zare', 'Alina', ''], ['Keller', 'James', '']]","['Feature selection', 'SAS', 'segmentation', 'clustering', 'SONAR', 'cluster validity']"
12591,2003.00952,Jary Pomponi,"Jary Pomponi, Simone Scardapane, and Aurelio Uncini",Bayesian Neural Networks With Maximum Mean Discrepancy Regularization,,,10.1016/j.neucom.2021.01.090,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bayesian Neural Networks (BNNs) are trained to optimize an entire
distribution over their weights instead of a single set, having significant
advantages in terms of, e.g., interpretability, multi-task learning, and
calibration. Because of the intractability of the resulting optimization
problem, most BNNs are either sampled through Monte Carlo methods, or trained
by minimizing a suitable Evidence Lower BOund (ELBO) on a variational
approximation. In this paper, we propose a variant of the latter, wherein we
replace the Kullback-Leibler divergence in the ELBO term with a Maximum Mean
Discrepancy (MMD) estimator, inspired by recent work in variational inference.
After motivating our proposal based on the properties of the MMD term, we
proceed to show a number of empirical advantages of the proposed formulation
over the state-of-the-art. In particular, our BNNs achieve higher accuracy on
multiple benchmarks, including several image classification tasks. In addition,
they are more robust to the selection of a prior over the weights, and they are
better calibrated. As a second contribution, we provide a new formulation for
estimating the uncertainty on a given prediction, showing it performs in a more
robust fashion against adversarial attacks and the injection of noise over
their inputs, compared to more classical criteria such as the differential
entropy.
","[{'version': 'v1', 'created': 'Mon, 2 Mar 2020 14:54:48 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Sep 2020 09:56:44 GMT'}]",2022-10-07,"[['Pomponi', 'Jary', ''], ['Scardapane', 'Simone', ''], ['Uncini', 'Aurelio', '']]","['Bayesian learning', 'variational approximation', 'maximum mean']"
12592,1507.00280,David Hallac,"David Hallac, Jure Leskovec, Stephen Boyd",Network Lasso: Clustering and Optimization in Large Graphs,,,10.1145/2783258.2783313,,cs.SI math.OC stat.AP stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convex optimization is an essential tool for modern data analysis, as it
provides a framework to formulate and solve many problems in machine learning
and data mining. However, general convex optimization solvers do not scale
well, and scalable solvers are often specialized to only work on a narrow class
of problems. Therefore, there is a need for simple, scalable algorithms that
can solve many common optimization problems. In this paper, we introduce the
\emph{network lasso}, a generalization of the group lasso to a network setting
that allows for simultaneous clustering and optimization on graphs. We develop
an algorithm based on the Alternating Direction Method of Multipliers (ADMM) to
solve this problem in a distributed and scalable manner, which allows for
guaranteed global convergence even on large graphs. We also examine a
non-convex extension of this approach. We then demonstrate that many types of
problems can be expressed in our framework. We focus on three in particular -
binary classification, predicting housing prices, and event detection in time
series data - comparing the network lasso to baseline approaches and showing
that it is both a fast and accurate method of solving large optimization
problems.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2015 16:25:38 GMT'}]",2015-07-02,"[['Hallac', 'David', ''], ['Leskovec', 'Jure', ''], ['Boyd', 'Stephen', '']]","['Convex Optimization', 'ADMM', 'Network Lasso']"
12593,2205.15561,Pei Liu,"Pei Liu, Yanjie Zhao, Haipeng Cai, Mattia Fazzini, John Grundy, and Li
  Li","Automatically Detecting API-induced Compatibility Issues in Android
  Apps: A Comparative Analysis (Replicability Study)",,,10.1145/3533767.3534407,"ISSTA '22 Proceedings of the 31st ACM SIGSOFT International
  Symposium on Software Testing and Analysis",cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Fragmentation is a serious problem in the Android ecosystem. This problem is
mainly caused by the fast evolution of the system itself and the various
customizations independently maintained by different smartphone manufacturers.
Many efforts have attempted to mitigate its impact via approaches to
automatically pinpoint compatibility issues in Android apps. Unfortunately, at
this stage, it is still unknown if this objective has been fulfilled, and the
existing approaches can indeed be replicated and reliably leveraged to pinpoint
compatibility issues in the wild. We, therefore, propose to fill this gap by
first conducting a literature review within this topic to identify all the
available approaches. Among the nine identified approaches, we then try our
best to reproduce them based on their original datasets. After that, we go one
step further to empirically compare those approaches against common datasets
with real-world apps containing compatibility issues. Experimental results show
that existing tools can indeed be reproduced, but their capabilities are quite
distinct, as confirmed by the fact that there is only a small overlap of the
results reported by the selected tools. This evidence suggests that more
efforts should be spent by our community to achieve sound compatibility issues
detection.
","[{'version': 'v1', 'created': 'Tue, 31 May 2022 06:39:39 GMT'}]",2022-06-01,"[['Liu', 'Pei', ''], ['Zhao', 'Yanjie', ''], ['Cai', 'Haipeng', ''], ['Fazzini', 'Mattia', ''], ['Grundy', 'John', ''], ['Li', 'Li', '']]","['Android', 'Android API', 'Compatibility Issue', 'Replication']"
12594,cs/0504104,Neal E. Young,Marek Chrobak and Claire Kenyon and Neal E. Young,The reverse greedy algorithm for the metric k-median problem,to appear in IPL. preliminary version in COCOON '05,Information Processing Letters 97:68-72(2006),10.1016/j.ipl.2005.09.009,,cs.DS,,"  The Reverse Greedy algorithm (RGreedy) for the k-median problem works as
follows. It starts by placing facilities on all nodes. At each step, it removes
a facility to minimize the resulting total distance from the customers to the
remaining facilities. It stops when k facilities remain. We prove that, if the
distance function is metric, then the approximation ratio of RGreedy is between
?(log n/ log log n) and O(log n).
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2005 19:36:08 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Sep 2005 17:43:50 GMT'}]",2015-06-02,"[['Chrobak', 'Marek', ''], ['Kenyon', 'Claire', ''], ['Young', 'Neal E.', '']]","['Analysis of algorithms', 'approximation algorithms', 'online algorithms', 'facility location', 'combinatorial optimization']"
12595,1703.10316,Yantao Jia,"Denghui Zhang, Manling Li, Yantao Jia, Yuanzhuo Wang, Xueqi Cheng",Efficient Parallel Translating Embedding For Knowledge Graphs,WI 2017: 460-468,,10.1145/3106426.3106447,,cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Knowledge graph embedding aims to embed entities and relations of knowledge
graphs into low-dimensional vector spaces. Translating embedding methods regard
relations as the translation from head entities to tail entities, which achieve
the state-of-the-art results among knowledge graph embedding methods. However,
a major limitation of these methods is the time consuming training process,
which may take several days or even weeks for large knowledge graphs, and
result in great difficulty in practical applications. In this paper, we propose
an efficient parallel framework for translating embedding methods, called
ParTrans-X, which enables the methods to be paralleled without locks by
utilizing the distinguished structures of knowledge graphs. Experiments on two
datasets with three typical translating embedding methods, i.e., TransE [3],
TransH [17], and a more efficient variant TransE- AdaGrad [10] validate that
ParTrans-X can speed up the training process by more than an order of
magnitude.
","[{'version': 'v1', 'created': 'Thu, 30 Mar 2017 05:20:18 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Aug 2017 10:52:29 GMT'}, {'version': 'v3', 'created': 'Mon, 27 Nov 2017 09:09:01 GMT'}, {'version': 'v4', 'created': 'Tue, 9 Jan 2018 02:40:30 GMT'}]",2018-01-10,"[['Zhang', 'Denghui', ''], ['Li', 'Manling', ''], ['Jia', 'Yantao', ''], ['Wang', 'Yuanzhuo', ''], ['Cheng', 'Xueqi', '']]","['Knowledge Graph Embedding', 'Translation-based', 'Parallel']"
12596,1506.08689,Adrien Bizeray,"A. M. Bizeray, S. Zhao, S.R. Duncan, D.A. Howey","Lithium-ion battery thermal-electrochemical model-based state estimation
  using orthogonal collocation and a modified extended Kalman filter",Submitted to the Journal of Power Sources,Journal of Power Sources 296 (2015) 400-412,10.1016/j.jpowsour.2015.07.019,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates the state estimation of a high-fidelity spatially
resolved thermal- electrochemical lithium-ion battery model commonly referred
to as the pseudo two-dimensional model. The partial-differential algebraic
equations (PDAEs) constituting the model are spatially discretised using
Chebyshev orthogonal collocation enabling fast and accurate simulations up to
high C-rates. This implementation of the pseudo-2D model is then used in
combination with an extended Kalman filter algorithm for differential-algebraic
equations to estimate the states of the model. The state estimation algorithm
is able to rapidly recover the model states from current, voltage and
temperature measurements. Results show that the error on the state estimate
falls below 1 % in less than 200 s despite a 30 % error on battery initial
state-of-charge and additive measurement noise with 10 mV and 0.5 K standard
deviations.
","[{'version': 'v1', 'created': 'Mon, 29 Jun 2015 15:41:23 GMT'}]",2015-08-04,"[['Bizeray', 'A. M.', ''], ['Zhao', 'S.', ''], ['Duncan', 'S. R.', ''], ['Howey', 'D. A.', '']]","['Lithium-ion battery', 'pseudo-two dimensional model', 'state estimation', 'extended Kalman filter', 'Chebyshev orthogonal collocation']"
12597,2009.12867,Ryoji Tanabe Dr.,Ryoji Tanabe and Hisao Ishibuchi,An Easy-to-use Real-world Multi-objective Optimization Problem Suite,"This is an accepted version of a paper published in Applied Soft
  Computing",,10.1016/j.asoc.2020.106078,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although synthetic test problems are widely used for the performance
assessment of evolutionary multi-objective optimization algorithms, they are
likely to include unrealistic properties which may lead to
overestimation/underestimation. To address this issue, we present a
multi-objective optimization problem suite consisting of 16 bound-constrained
real-world problems. The problem suite includes various problems in terms of
the number of objectives, the shape of the Pareto front, and the type of design
variables. 4 out of the 16 problems are multi-objective mixed-integer
optimization problems. We provide Java, C, and Matlab source codes of the 16
problems so that they are available in an off-the-shelf manner. We examine an
approximated Pareto front of each test problem. We also analyze the performance
of six representative evolutionary multi-objective optimization algorithms on
the 16 problems. In addition to the 16 problems, we present 8 constrained
multi-objective real-world problems.
","[{'version': 'v1', 'created': 'Sun, 27 Sep 2020 15:11:08 GMT'}]",2020-09-29,"[['Tanabe', 'Ryoji', ''], ['Ishibuchi', 'Hisao', '']]","['Evolutionary multi-objective optimization', 'test problems', 'real-world problems']"
12598,2006.02155,Brian Kroth,"Carlo Curino, Neha Godwal, Brian Kroth, Sergiy Kuryata, Greg Lapinski,
  Siqi Liu, Slava Oks, Olga Poppe, Adam Smiechowski, Ed Thayer, Markus Weimer,
  Yiwen Zhu",MLOS: An Infrastructure for Automated Software Performance Engineering,"4 pages, DEEM 2020",,10.1145/3399579.3399927,,cs.DC cs.DB cs.LG cs.PF cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Developing modern systems software is a complex task that combines business
logic programming and Software Performance Engineering (SPE). The later is an
experimental and labor-intensive activity focused on optimizing the system for
a given hardware, software, and workload (hw/sw/wl) context.
  Today's SPE is performed during build/release phases by specialized teams,
and cursed by: 1) lack of standardized and automated tools, 2) significant
repeated work as hw/sw/wl context changes, 3) fragility induced by a
""one-size-fit-all"" tuning (where improvements on one workload or component may
impact others). The net result: despite costly investments, system software is
often outside its optimal operating point - anecdotally leaving 30% to 40% of
performance on the table.
  The recent developments in Data Science (DS) hints at an opportunity:
combining DS tooling and methodologies with a new developer experience to
transform the practice of SPE. In this paper we present: MLOS, an ML-powered
infrastructure and methodology to democratize and automate Software Performance
Engineering. MLOS enables continuous, instance-level, robust, and trackable
systems optimization. MLOS is being developed and employed within Microsoft to
optimize SQL Server performance. Early results indicated that component-level
optimizations can lead to 20%-90% improvements when custom-tuning for a
specific hw/sw/wl, hinting at a significant opportunity. However, several
research challenges remain that will require community involvement. To this
end, we are in the process of open-sourcing the MLOS core infrastructure, and
we are engaging with academic institutions to create an educational program
around Software 2.0 and MLOS ideas.
","[{'version': 'v1', 'created': 'Mon, 1 Jun 2020 22:38:30 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Jun 2020 11:10:53 GMT'}]",2020-06-05,"[['Curino', 'Carlo', ''], ['Godwal', 'Neha', ''], ['Kroth', 'Brian', ''], ['Kuryata', 'Sergiy', ''], ['Lapinski', 'Greg', ''], ['Liu', 'Siqi', ''], ['Oks', 'Slava', ''], ['Poppe', 'Olga', ''], ['Smiechowski', 'Adam', ''], ['Thayer', 'Ed', ''], ['Weimer', 'Markus', ''], ['Zhu', 'Yiwen', '']]","['systems', 'software engineering', 'performance', 'optimization', 'machine learning', 'data science']"
12599,1811.08205,Ce Jin,Ce Jin,Simulating Random Walks on Graphs in the Streaming Model,To appear in ITCS 2019,,10.4230/LIPIcs.ITCS.2019.46,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of approximately simulating a $t$-step random walk on a
graph where the input edges come from a single-pass stream. The straightforward
algorithm using reservoir sampling needs $O(nt)$ words of memory. We show that
this space complexity is near-optimal for directed graphs. For undirected
graphs, we prove an $\Omega(n\sqrt{t})$-bit space lower bound, and give a
near-optimal algorithm using $O(n\sqrt{t})$ words of space with
$2^{-\Omega(\sqrt{t})}$ simulation error (defined as the $\ell_1$-distance
between the output distribution of the simulation algorithm and the
distribution of perfect random walks). We also discuss extending the algorithms
to the turnstile model, where both insertion and deletion of edges can appear
in the input stream.
","[{'version': 'v1', 'created': 'Tue, 20 Nov 2018 12:23:49 GMT'}]",2020-01-03,"[['Jin', 'Ce', '']]","['streaming models', 'random walks', 'sampling']"
12600,1906.11539,"J\""urgen Scherer","J\""urgen Scherer, Bernhard Rinner",Multi-Robot Patrolling with Sensing Idleness and Data Delay Objectives,,Journal of Intelligent & Robotic Systems (2020),10.1007/s10846-020-01156-6,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-robot patrolling represents a fundamental problem for many monitoring
and surveillance applications and has gained significant interest in recent
years. In patrolling, mobile robots repeatedly travel through an environment,
capture sensor data at certain sensing locations and deliver this data to the
base station in a way that maximizes the changes of detection. Robots move on
tours, exchange data when they meet with robots on neighboring tours and so
eventually deliver data to the base station.
  In this paper we jointly consider two important optimization criteria of
multi-robot patrolling: (i) idleness, i.e. the time between consecutive visits
of sensing locations, and (ii) delay, i.e. the time between capturing data at
the sensing location and its arrival at the base station. We systematically
investigate the effect of the robots' moving directions along their tours and
the selection of meeting points for data exchange. We prove that the problem of
determining the movement directions and meeting points such that the data delay
is minimized is NP-hard. We propose heuristics and provide a simulation study
which shows that the cooperative approach can outperform an uncooperative
approach where every robot delivers the captured data individually to the base
station.
","[{'version': 'v1', 'created': 'Thu, 27 Jun 2019 10:28:28 GMT'}]",2020-01-22,"[['Scherer', 'Jürgen', ''], ['Rinner', 'Bernhard', '']]","['Multi-Robot Systems', 'Mobile robotics', 'Patrolling', 'Coordination', 'Cooperating Robots']"
12601,2203.06290,Adam Thorpe,"Adam J. Thorpe, Meeko M. K. Oishi","SOCKS: A Stochastic Optimal Control and Reachability Toolbox Using
  Kernel Methods",,,10.1145/3501710.3519525,,cs.LG cs.SY eess.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present SOCKS, a data-driven stochastic optimal control toolbox based in
kernel methods. SOCKS is a collection of data-driven algorithms that compute
approximate solutions to stochastic optimal control problems with arbitrary
cost and constraint functions, including stochastic reachability, which seeks
to determine the likelihood that a system will reach a desired target set while
respecting a set of pre-defined safety constraints. Our approach relies upon a
class of machine learning algorithms based in kernel methods, a nonparametric
technique which can be used to represent probability distributions in a
high-dimensional space of functions known as a reproducing kernel Hilbert
space. As a nonparametric technique, kernel methods are inherently data-driven,
meaning that they do not place prior assumptions on the system dynamics or the
structure of the uncertainty. This makes the toolbox amenable to a wide variety
of systems, including those with nonlinear dynamics, black-box elements, and
poorly characterized stochastic disturbances. We present the main features of
SOCKS and demonstrate its capabilities on several benchmarks.
","[{'version': 'v1', 'created': 'Sat, 12 Mar 2022 00:09:08 GMT'}]",2022-03-15,"[['Thorpe', 'Adam J.', ''], ['Oishi', 'Meeko M. K.', '']]","['Stochastic Optimal Control', 'Machine Learning', 'Stochastic Reachability']"
12602,1905.10190,Yinzhong Yan,"Yinzhong Yan, Qingming Li","Low-pass-filter-based shock response spectrum and the evaluation method
  of transmissibility between equipment and sensitive components interfaces",,"Volume 117, 15 February 2019, Pages 97-115",10.1016/j.ymssp.2018.07.023,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  According to the features of the sources of pyroshock and ballistic shock,
this study considers the pyroshock and ballistic shock generated by their
respective impulsive sources as damped harmonic waves with different
frequencies. According to the linear superposition assumption of damped
harmonic waves in a linear elastic structure, a shock analysis method based on
low-pass-filtered shock signals and their corresponding shock response spectrum
(SRS), termed as low-pass-filter-based shock response spectrum (LPSRS), is
proposed. LPSRS contains rich information of the frequency distribution of the
shock excitation signal. A method to calculate shock transmissibility is
proposed based on LPSRS and basic modal information of the equipment structure.
LPSRS and SRS curves can be predicted at any given position of the equipment
structure. The prediction method is validated by finite element method (FEM)
simulation.
","[{'version': 'v1', 'created': 'Tue, 21 May 2019 14:09:18 GMT'}]",2019-05-27,"[['Yan', 'Yinzhong', ''], ['Li', 'Qingming', '']]","['Shock Response Spectrum', 'Low-pass Filter', 'Shock Transmissibility', 'Pyroshock', 'Ballistic Shock']"
12603,2203.16915,Ioannis Mavromatis Dr,"Ioannis Mavromatis and Aleksandar Stanoev and Pietro Carnelli and
  Yichao Jin and Mahesh Sooriyabandara and Aftab Khan","A Dataset of Images of Public Streetlights with Operational Monitoring
  using Computer Vision Techniques",Data in Brief Journal,,10.1016/j.dib.2022.108658,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  A dataset of street light images is presented. Our dataset consists of
$\sim350\textrm{k}$ images, taken from 140 UMBRELLA nodes installed in the
South Gloucestershire region in the UK. Each UMBRELLA node is installed on the
pole of a lamppost and is equipped with a Raspberry Pi Camera Module v1 facing
upwards towards the sky and lamppost light bulb. Each node collects an image at
hourly intervals for 24h every day. The data collection spans for a period of
six months.
  Each image taken is logged as a single entry in the dataset along with the
Global Positioning System (GPS) coordinates of the lamppost. All entries in the
dataset have been post-processed and labelled based on the operation of the
lamppost, i.e., whether the lamppost is switched ON or OFF. The dataset can be
used to train deep neural networks and generate pre-trained models providing
feature representations for smart city CCTV applications, smart weather
detection algorithms, or street infrastructure monitoring. The dataset can be
found at \url{https://doi.org/10.5281/zenodo.6046758}.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2022 09:36:07 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Apr 2022 14:30:59 GMT'}, {'version': 'v3', 'created': 'Fri, 14 Oct 2022 16:36:24 GMT'}]",2022-10-17,"[['Mavromatis', 'Ioannis', ''], ['Stanoev', 'Aleksandar', ''], ['Carnelli', 'Pietro', ''], ['Jin', 'Yichao', ''], ['Sooriyabandara', 'Mahesh', ''], ['Khan', 'Aftab', '']]","['Streetlight', 'Street Furniture', 'Light and Emergency Light Maintenance', 'Lighting Columns', 'ComputerVision', 'Machine Learning', 'Smart Cities']"
12604,2203.14076,Thrivikraman V,"Thrivikraman V, Vishnu R. Dixit, Nikhil Ram S, Vikas K. Gowda,
  Santhosh Kumar Vasudevan, Subramaniam Kalambur",MiSeRTrace: Kernel-level Request Tracing for Microservice Visibility,,,10.1145/3491204.3527462,,cs.DC,http://creativecommons.org/licenses/by-sa/4.0/,"  With the evolution of microservice applications, the underlying architectures
have become increasingly complex compared to their monolith counterparts. This
mainly brings in the challenge of observability. By providing a deeper
understanding into the functioning of distributed applications, observability
enables improving the performance of the system by obtaining a view of the
bottlenecks in the implementation. The observability provided by currently
existing tools that perform dynamic tracing on distributed applications is
limited to the user-space and requires the application to be instrumented to
track request flows. In this paper, we present a new open-source framework
MiSeRTrace that can trace the end-to-end path of requests entering a
microservice application at the kernel space without requiring instrumentation
or modification of the application. Observability at the comprehensiveness of
the kernel space allows breaking down of various steps in activities such as
network transfers and IO tasks, thus enabling root cause based performance
analysis and accurate identification of hotspots. MiSeRTrace supports tracing
user-enabled kernel events provided by frameworks such as bpftrace or ftrace
and isolates kernel activity associated with each application request with
minimal overheads. We then demonstrate the working of the solution with results
on a benchmark microservice application.
","[{'version': 'v1', 'created': 'Sat, 26 Mar 2022 13:27:25 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Dec 2022 04:22:06 GMT'}]",2022-12-06,"[['V', 'Thrivikraman', ''], ['Dixit', 'Vishnu R.', ''], ['S', 'Nikhil Ram', ''], ['Gowda', 'Vikas K.', ''], ['Vasudevan', 'Santhosh Kumar', ''], ['Kalambur', 'Subramaniam', '']]","['request tracing', 'kernel tracing', 'microservice', 'MiSeRTrace', 'ThreadState Model']"
12605,1908.05268,Sandra Kiefer,"Sandra Kiefer, Daniel Neuen",The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs,"48 pages, 6 figures, full version of a paper accepted at MFCS 2019.
  Added Definition 5.4 and Theorem 5.6 to formalise the notions and arguments.
  New appendix contains extended proofs for Theorems 5.6 and 5.7. Results
  remain unchanged",SIAM J. Discret. Math. 36(1): 252-298 (2022),10.1137/20m1314987,,cs.DM cs.LO math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Weisfeiler-Leman procedure is a widely-used technique for graph
isomorphism testing that works by iteratively computing an
isomorphism-invariant coloring of vertex tuples. Meanwhile, a fundamental tool
in structural graph theory, which is often exploited in approaches to tackle
the graph isomorphism problem, is the decomposition into 2- and 3-connected
components.
  We prove that the 2-dimensional Weisfeiler-Leman algorithm implicitly
computes the decomposition of a graph into its 3-connected components. This
implies that the dimension of the algorithm needed to distinguish two given
non-isomorphic graphs is at most the dimension required to distinguish
non-isomorphic 3-connected components of the graphs (assuming dimension at
least 2).
  To obtain our decomposition result, we show that, for k >= 2, the
k-dimensional algorithm distinguishes k-separators, i.e., k-tuples of vertices
that separate the graph, from other vertex k-tuples. As a byproduct, we also
obtain insights about the connectivity of constituent graphs of association
schemes.
  In an application of the results, we show the new upper bound of k on the
Weisfeiler-Leman dimension of the class of graphs of treewidth at most k. Using
a construction by Cai, F\""urer, and Immerman, we also provide a new lower bound
that is asymptotically tight up to a factor of 2.
","[{'version': 'v1', 'created': 'Wed, 14 Aug 2019 17:49:29 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Sep 2021 11:29:58 GMT'}]",2022-07-19,"[['Kiefer', 'Sandra', ''], ['Neuen', 'Daniel', '']]","['Weisfeiler-Leman algorithm', 'separators', 'first-order logic', 'counting quantifiers']"
12606,2105.14159,Ben Chugg,"Ben Chugg, Brandon Anderson, Seiji Eicher, Sandy Lee, Daniel E. Ho","Enhancing Environmental Enforcement with Near Real-Time Monitoring:
  Likelihood-Based Detection of Structural Expansion of Intensive Livestock
  Farms",,"International Journal of Applied Earth Observation and
  Geoinformation, Volume 103, 2021, 102463, ISSN 0303-2434",10.1016/j.jag.2021.102463,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Much environmental enforcement in the United States has historically relied
on either self-reported data or physical, resource-intensive, infrequent
inspections. Advances in remote sensing and computer vision, however, have the
potential to augment compliance monitoring by detecting early warning signs of
noncompliance. We demonstrate a process for rapid identification of significant
structural expansion using Planet's 3m/pixel satellite imagery products and
focusing on Concentrated Animal Feeding Operations (CAFOs) in the US as a test
case. Unpermitted building expansion has been a particular challenge with
CAFOs, which pose significant health and environmental risks. Using new
hand-labeled dataset of 145,053 images of 1,513 CAFOs, we combine
state-of-the-art building segmentation with a likelihood-based change-point
detection model to provide a robust signal of building expansion (AUC = 0.86).
A major advantage of this approach is that it can work with higher cadence
(daily to weekly), but lower resolution (3m/pixel), satellite imagery than
previously used in similar environmental settings. It is also highly
generalizable and thus provides a near real-time monitoring tool to prioritize
enforcement resources in other settings where unpermitted construction poses
environmental risk, e.g. zoning, habitat modification, or wetland protection.
","[{'version': 'v1', 'created': 'Sat, 29 May 2021 00:33:18 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Aug 2021 16:38:26 GMT'}]",2021-08-03,"[['Chugg', 'Ben', ''], ['Anderson', 'Brandon', ''], ['Eicher', 'Seiji', ''], ['Lee', 'Sandy', ''], ['Ho', 'Daniel E.', '']]","['Structural Expansion', 'Time series', 'Maximum Likelihood', 'AnimalFeeding Operations']"
12607,2011.11007,Mehdi Khoshboresh-Masouleh,"Mohammad R. Bayanlou, Mehdi Khoshboresh-Masouleh","SAMA-VTOL: A new unmanned aircraft system for remotely sensed data
  collection","12 pages, 6 figures","Proceedings Volume 11525, SPIE Future Sensing Technologies;
  115250V (2020)",10.1117/12.2580533,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In recent years, unmanned aircraft systems (UASs) are frequently used in many
different applications of photogrammetry such as building damage monitoring,
archaeological mapping and vegetation monitoring. In this paper, a new
state-of-the-art vertical take-off and landing fixed-wing UAS is proposed to
robust photogrammetry missions, called SAMA-VTOL. In this study, the capability
of SAMA-VTOL is investigated for generating orthophoto. The major stages are
including designing, building and experimental scenario. First, a brief
description of design and build is introduced. Next, an experiment was done to
generate accurate orthophoto with minimum ground control points requirements.
The processing step, which includes automatic aerial triangulation with camera
calibration and model generation. In this regard, the Pix4Dmapper software was
used to orientate the images, produce point clouds, creating digital surface
model and generating orthophoto mosaic. Experimental results based on the test
area covering 26.3 hectares indicate that our SAMA-VTOL performs well in the
orthophoto mosaic task.
","[{'version': 'v1', 'created': 'Sun, 22 Nov 2020 12:55:16 GMT'}]",2020-11-24,"[['Bayanlou', 'Mohammad R.', ''], ['Khoshboresh-Masouleh', 'Mehdi', '']]","['Unmanned Aircraft System', 'Remote Sensing', 'Photogrammetry', 'Post-Processed']"
12608,2202.01128,Markus J. Hofmann,"Markus J. Hofmann, Steffen Remus, Chris Biemann, Ralph Radach and Lars
  Kuchinke","Language Models Explain Word Reading Times Better Than Empirical
  Predictability",,"Frontiers in Artificial Intelligence, 4(730570), 1-20 (2022)",10.3389/frai.2021.730570,,cs.CL cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Though there is a strong consensus that word length and frequency are the
most important single-word features determining visual-orthographic access to
the mental lexicon, there is less agreement as how to best capture syntactic
and semantic factors. The traditional approach in cognitive reading research
assumes that word predictability from sentence context is best captured by
cloze completion probability (CCP) derived from human performance data. We
review recent research suggesting that probabilistic language models provide
deeper explanations for syntactic and semantic effects than CCP. Then we
compare CCP with (1) Symbolic n-gram models consolidate syntactic and semantic
short-range relations by computing the probability of a word to occur, given
two preceding words. (2) Topic models rely on subsymbolic representations to
capture long-range semantic similarity by word co-occurrence counts in
documents. (3) In recurrent neural networks (RNNs), the subsymbolic units are
trained to predict the next word, given all preceding words in the sentences.
To examine lexical retrieval, these models were used to predict single fixation
durations and gaze durations to capture rapidly successful and standard lexical
access, and total viewing time to capture late semantic integration. The linear
item-level analyses showed greater correlations of all language models with all
eye-movement measures than CCP. Then we examined non-linear relations between
the different types of predictability and the reading times using generalized
additive models. N-gram and RNN probabilities of the present word more
consistently predicted reading performance compared with topic models or CCP.
","[{'version': 'v1', 'created': 'Wed, 2 Feb 2022 16:38:43 GMT'}]",2022-02-03,"[['Hofmann', 'Markus J.', ''], ['Remus', 'Steffen', ''], ['Biemann', 'Chris', ''], ['Radach', 'Ralph', ''], ['Kuchinke', 'Lars', '']]","['language models', 'n-gram model', 'topic model', 'recurrent neural network model', 'predictability', 'generalized additive models', 'eye movements']"
12609,1909.08866,Dimitri Gominski,"Dimitri Gominski (LaSTIG), Martyna Poreba (LaSTIG), Val\'erie
  Gouet-Brunet (LaSTIG), Liming Chen (LaSTIG)","Challenging deep image descriptors for retrieval in heterogeneous
  iconographic collections","SUMAC '19, 2019",,10.1145/3347317.3357246,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article proposes to study the behavior of recent and efficient
state-of-the-art deep-learning based image descriptors for content-based image
retrieval, facing a panel of complex variations appearing in heterogeneous
image datasets, in particular in cultural collections that may involve
multi-source, multi-date and multi-view Permission to make digital
","[{'version': 'v1', 'created': 'Thu, 19 Sep 2019 08:54:51 GMT'}]",2019-09-20,"[['Gominski', 'Dimitri', '', 'LaSTIG'], ['Poreba', 'Martyna', '', 'LaSTIG'], ['Gouet-Brunet', 'Valérie', '', 'LaSTIG'], ['Chen', 'Liming', '', 'LaSTIG']]","['CBIR', 'deep learning', 'image descriptors', 'evaluation']"
12610,2109.07878,Shiyu Fan,"Shiyu Fan, Runhai Xu, Zhaohang Yan","A Medical Pre-Diagnosis System for Histopathological Image of Breast
  Cancer",,,10.1109/CISP-BMEI53629.2021.9624252,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper constructs a novel intelligent medical diagnosis system, which can
realize automatic communication and breast cancer pathological image
recognition. This system contains two main parts, including a pre-training
chatbot called M-Chatbot and an improved neural network model of
EfficientNetV2-S named EfficientNetV2-SA, in which the activation function in
top layers is replaced by ACON-C. Using information retrieval mechanism,
M-Chatbot instructs patients to send breast pathological image to
EfficientNetV2-SA network, and then the classifier trained by transfer learning
will return the diagnosis results. We verify the performance of our chatbot and
classification on the extrinsic metrics and BreaKHis dataset, respectively. The
task completion rate of M-Chatbot reached 63.33\%. For the BreaKHis dataset,
the highest accuracy of EfficientNetV2-SA network have achieved 84.71\%. All
these experimental results illustrate that the proposed model can improve the
accuracy performance of image recognition and our new intelligent medical
diagnosis system is successful and efficient in providing automatic diagnosis
of breast cancer.
","[{'version': 'v1', 'created': 'Thu, 16 Sep 2021 11:16:46 GMT'}]",2021-12-30,"[['Fan', 'Shiyu', ''], ['Xu', 'Runhai', ''], ['Yan', 'Zhaohang', '']]","['medicaldiagnosissystems', 'breastcancer', 'MChatbot', 'EfficientNetV2-SA', 'transfer learning', 'image classification']"
12611,1704.03421,Malika Bendechache,"Malika Bendechache, Nhien-An Le-Khac, M-Tahar Kechadi",Efficient Large Scale Clustering based on Data Partitioning,10 pages,"Data Science and Advanced Analytics (DSAA), 2016 IEEE
  International Conference on, 612--621, 2016",10.1109/DSAA.2016.70,,cs.DB cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering techniques are very attractive for extracting and identifying
patterns in datasets. However, their application to very large spatial datasets
presents numerous challenges such as high-dimensionality data, heterogeneity,
and high complexity of some algorithms. For instance, some algorithms may have
linear complexity but they require the domain knowledge in order to determine
their input parameters. Distributed clustering techniques constitute a very
good alternative to the big data challenges (e.g.,Volume, Variety, Veracity,
and Velocity). Usually these techniques consist of two phases. The first phase
generates local models or patterns and the second one tends to aggregate the
local results to obtain global models. While the first phase can be executed in
parallel on each site and, therefore, efficient, the aggregation phase is
complex, time consuming and may produce incorrect and ambiguous global clusters
and therefore incorrect models. In this paper we propose a new distributed
clustering approach to deal efficiently with both phases, generation of local
results and generation of global models by aggregation. For the first phase,
our approach is capable of analysing the datasets located in each site using
different clustering techniques. The aggregation phase is designed in such a
way that the final clusters are compact and accurate while the overall process
is efficient in time and memory allocation. For the evaluation, we use two
well-known clustering algorithms, K-Means and DBSCAN. One of the key outputs of
this distributed clustering technique is that the number of global clusters is
dynamic, no need to be fixed in advance. Experimental results show that the
approach is scalable and produces high quality results.
","[{'version': 'v1', 'created': 'Tue, 11 Apr 2017 17:05:01 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Feb 2018 15:23:31 GMT'}]",2018-02-27,"[['Bendechache', 'Malika', ''], ['Le-Khac', 'Nhien-An', ''], ['Kechadi', 'M-Tahar', '']]","['Big Data', 'spatial data', 'clustering', 'distributed mining', 'data analysis', 'k-means', 'DBSCAN']"
12612,2206.13965,Alan Smeaton,"Alan F. Smeaton, Aparajita Dey-Plissonneau, Hyowon Lee, Mingming Liu,
  Michael Scriney","Analysis of Individual Conversational Volatility in Tandem
  Telecollaboration for Second Language Learning","21st European Conference on e-Learning, October 2022, Brighton, UK",,10.34190/ecel.21.1.590,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Second language learning can be enabled by tandem collaboration where
students are grouped into video conference calls while learning the native
language of other student(s) on the calls. This places students in an online
environment where the more outgoing can actively contribute and engage in
dialogue while those more shy and unsure of their second language skills can
sit back and coast through the calls. We have built and deployed the L2L system
which records timings of conversational utterances from all participants in a
call. We generate visualisations including participation rates and timelines
for each student in each call and present these on a dashboard. We have
recently developed a measure called personal conversational volatility for how
dynamic has been each student's contribution to the dialogue in each call. We
present an analysis of conversational volatility measures for a sample of 19
individual English-speaking students from our University who are learning
Frenchm, in each of 86 tandem telecollaboration calls over one teaching
semester. Our analysis shows there is a need to look into the nature of the
interactions and see if the choices of discussion topics assigned to them were
too difficult for some students and that may have influenced their engagement
in some way.
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2022 12:34:00 GMT'}]",2022-10-25,"[['Smeaton', 'Alan F.', ''], ['Dey-Plissonneau', 'Aparajita', ''], ['Lee', 'Hyowon', ''], ['Liu', 'Mingming', ''], ['Scriney', 'Michael', '']]","['Language learning', 'telecollaboration', 'conversation metrics', 'conversational volatility']"
12613,2001.03985,Luigi Acerbi,"Bas van Opheusden, Luigi Acerbi and Wei Ji Ma","Unbiased and Efficient Log-Likelihood Estimation with Inverse Binomial
  Sampling",Bas van Opheusden and Luigi Acerbi contributed equally to this work,,10.1371/journal.pcbi.1008483,,cs.LG q-bio.NC q-bio.QM stat.CO stat.ME stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The fate of scientific hypotheses often relies on the ability of a
computational model to explain the data, quantified in modern statistical
approaches by the likelihood function. The log-likelihood is the key element
for parameter estimation and model evaluation. However, the log-likelihood of
complex models in fields such as computational biology and neuroscience is
often intractable to compute analytically or numerically. In those cases,
researchers can often only estimate the log-likelihood by comparing observed
data with synthetic observations generated by model simulations. Standard
techniques to approximate the likelihood via simulation either use summary
statistics of the data or are at risk of producing severe biases in the
estimate. Here, we explore another method, inverse binomial sampling (IBS),
which can estimate the log-likelihood of an entire data set efficiently and
without bias. For each observation, IBS draws samples from the simulator model
until one matches the observation. The log-likelihood estimate is then a
function of the number of samples drawn. The variance of this estimator is
uniformly bounded, achieves the minimum variance for an unbiased estimator, and
we can compute calibrated estimates of the variance. We provide theoretical
arguments in favor of IBS and an empirical assessment of the method for
maximum-likelihood estimation with simulation-based models. As case studies, we
take three model-fitting problems of increasing complexity from computational
and cognitive neuroscience. In all problems, IBS generally produces lower error
in the estimated parameters and maximum log-likelihood values than alternative
sampling methods with the same average number of samples. Our results
demonstrate the potential of IBS as a practical, robust, and easy to implement
method for log-likelihood evaluation when exact techniques are not available.
","[{'version': 'v1', 'created': 'Sun, 12 Jan 2020 19:51:35 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Oct 2020 19:24:28 GMT'}, {'version': 'v3', 'created': 'Tue, 27 Oct 2020 20:08:25 GMT'}]",2021-01-27,"[['van Opheusden', 'Bas', ''], ['Acerbi', 'Luigi', ''], ['Ma', 'Wei Ji', '']]","['Maximum-likelihood estimation', 'likelihood-free inference', 'simulation']"
12614,2202.04887,Minhao Jiang,"Minhao Jiang, Xiangchen Song, Jieyu Zhang, Jiawei Han","TaxoEnrich: Self-Supervised Taxonomy Completion via Structure-Semantic
  Representations",WWW 2022,,10.1145/3485447.3511935,,cs.CL cs.AI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Taxonomies are fundamental to many real-world applications in various
domains, serving as structural representations of knowledge. To deal with the
increasing volume of new concepts needed to be organized as taxonomies,
researchers turn to automatically completion of an existing taxonomy with new
concepts. In this paper, we propose TaxoEnrich, a new taxonomy completion
framework, which effectively leverages both semantic features and structural
information in the existing taxonomy and offers a better representation of
candidate position to boost the performance of taxonomy completion.
Specifically, TaxoEnrich consists of four components: (1)
taxonomy-contextualized embedding which incorporates both semantic meanings of
concept and taxonomic relations based on powerful pretrained language models;
(2) a taxonomy-aware sequential encoder which learns candidate position
representations by encoding the structural information of taxonomy; (3) a
query-aware sibling encoder which adaptively aggregates candidate siblings to
augment candidate position representations based on their importance to the
query-position matching; (4) a query-position matching model which extends
existing work with our new candidate position representations. Extensive
experiments on four large real-world datasets from different domains show that
\TaxoEnrich achieves the best performance among all evaluation metrics and
outperforms previous state-of-the-art methods by a large margin.
","[{'version': 'v1', 'created': 'Thu, 10 Feb 2022 08:10:43 GMT'}]",2022-02-11,"[['Jiang', 'Minhao', ''], ['Song', 'Xiangchen', ''], ['Zhang', 'Jieyu', ''], ['Han', 'Jiawei', '']]","['Taxonomy Completion', 'Self-supervised Learning', 'Knowledge Representation']"
12615,1811.05005,Danielle Gonzalez,"Danielle Gonzalez, Suzanne Prentice, Mehdi Mirakhorli","A Fine-Grained Approach for Automated Conversion of JUnit Assertions to
  English","In Proceedings of the 4th ACM SIGSOFT International Workshop on NLP
  for Software Engineering (NL4SE 18), November 4, 2018, Lake Buena Vista, FL,
  USA. ACM, New York, NY, USA, 4 pages",,10.1145/3283812.3283819,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Converting source or unit test code to English has been shown to improve the
maintainability, understandability, and analysis of software and tests. Code
summarizers identify important statements in the source/tests and convert them
to easily understood English sentences using static analysis and NLP
techniques. However, current test summarization approaches handle only a subset
of the variation and customization allowed in the JUnit assert API (a critical
component of test cases) which may affect the accuracy of conversions. In this
paper, we present our work towards improving JUnit test summarization with a
detailed process for converting a total of 45 unique JUnit assertions to
English, including 37 previously-unhandled variations of the assertThat method.
This process has also been implemented and released as the AssertConvert tool.
Initial evaluations have shown that this tool generates English conversions
that accurately represent a wide variety of assertion statements which could be
used for code summarization or other NLP analyses.
","[{'version': 'v1', 'created': 'Mon, 12 Nov 2018 21:17:03 GMT'}]",2021-03-11,"[['Gonzalez', 'Danielle', ''], ['Prentice', 'Suzanne', ''], ['Mirakhorli', 'Mehdi', '']]","['Software Testing', 'JUnit', 'Code Summarization', 'NLP']"
12616,1810.02196,Andrea Mazza,Gianfranco Chicco and Andrea Mazza,"Heuristic Optimization of Electrical Energy Systems: Refined Metrics to
  Compare the Solutions","Previous title: Heuristic Optimization of Electrical Energy Systems:
  A Perpetual Motion Scheme and Refined Metrics to Compare the Solutions",,10.1016/j.segan.2019.100197,,cs.AI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many optimization problems admit a number of local optima, among which there
is the global optimum. For these problems, various heuristic optimization
methods have been proposed. Comparing the results of these solvers requires the
definition of suitable metrics. In the electrical energy systems literature,
simple metrics such as best value obtained, the mean value, the median or the
standard deviation of the solutions are still used. However, the comparisons
carried out with these metrics are rather weak, and on these bases a somehow
uncontrolled proliferation of heuristic solvers is taking place. This paper
addresses the overall issue of understanding the reasons of this proliferation,
showing a conceptual scheme that indicates how the assessment of the best
solver may result in the unlimited formulation of new solvers. Moreover, this
paper shows how the use of more refined metrics defined to compare the
optimization result, associated with the definition of appropriate benchmarks,
may make the comparisons among the solvers more robust. The proposed metrics
are based on the concept of first-order stochastic dominance and are defined
for the cases in which: (i) the globally optimal solution can be found (for
testing purposes); and (ii) the number of possible solutions is so large that
practically it cannot be guaranteed that the global optimum has been found.
Illustrative examples are provided for a typical problem in the electrical
energy systems area-distribution network reconfiguration. The conceptual
results obtained are generally valid to compare the results of other
optimization problems.
","[{'version': 'v1', 'created': 'Tue, 2 Oct 2018 12:43:58 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Feb 2019 07:35:19 GMT'}]",2019-02-18,"[['Chicco', 'Gianfranco', ''], ['Mazza', 'Andrea', '']]","['Electrical energy systems', 'optimization', 'meta-heuristics', 'reconfiguration', 'solution ranking', 'first-order']"
12617,2101.11174,Weiwei Jiang,"Weiwei Jiang, Jiayun Luo",Graph Neural Network for Traffic Forecasting: A Survey,,"Expert Systems with Applications Volume, vol. 207, 30 November
  2022, 117921",10.1016/j.eswa.2022.117921,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Traffic forecasting is important for the success of intelligent
transportation systems. Deep learning models, including convolution neural
networks and recurrent neural networks, have been extensively applied in
traffic forecasting problems to model spatial and temporal dependencies. In
recent years, to model the graph structures in transportation systems as well
as contextual information, graph neural networks have been introduced and have
achieved state-of-the-art performance in a series of traffic forecasting
problems. In this survey, we review the rapidly growing body of research using
different graph neural networks, e.g. graph convolutional and graph attention
networks, in various traffic forecasting problems, e.g. road traffic flow and
speed forecasting, passenger flow forecasting in urban rail transit systems,
and demand forecasting in ride-hailing platforms. We also present a
comprehensive list of open data and source resources for each problem and
identify future research directions. To the best of our knowledge, this paper
is the first comprehensive survey that explores the application of graph neural
networks for traffic forecasting problems. We have also created a public GitHub
repository where the latest papers, open data, and source resources will be
updated.
","[{'version': 'v1', 'created': 'Wed, 27 Jan 2021 02:35:41 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Feb 2021 14:19:27 GMT'}, {'version': 'v3', 'created': 'Tue, 30 Nov 2021 16:27:26 GMT'}, {'version': 'v4', 'created': 'Tue, 22 Feb 2022 05:46:58 GMT'}]",2022-07-08,"[['Jiang', 'Weiwei', ''], ['Luo', 'Jiayun', '']]","['Traffic Forecasting', 'Graph Neural Networks', 'Graph Convolution']"
12618,2204.00183,Ze Chen,"Ze Chen, Zhihang Fu, Jianqiang Huang, Mingyuan Tao, Shengyu Li,
  Rongxin Jiang, Xiang Tian, Yaowu Chen and Xian-sheng Hua",Dynamic Supervisor for Cross-dataset Object Detection,,"Neurocomputing, Volume 469, 2022, Pages 310-320, ISSN 0925-2312",10.1016/j.neucom.2021.09.076,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The application of cross-dataset training in object detection tasks is
complicated because the inconsistency in the category range across datasets
transforms fully supervised learning into semi-supervised learning. To address
this problem, recent studies focus on the generation of high-quality missing
annotations. In this study, we first point out that it is not enough to
generate high-quality annotations using a single model, which only looks once
for annotations. Through detailed experimental analyses, we further conclude
that hard-label training is conducive to generating high-recall annotations,
while soft-label training tends to obtain high-precision annotations. Inspired
by the aspects mentioned above, we propose a dynamic supervisor framework that
updates the annotations multiple times through multiple-updated submodels
trained using hard and soft labels. In the final generated annotations, both
recall and precision improve significantly through the integration of
hard-label training with soft-label training. Extensive experiments conducted
on various dataset combination settings support our analyses and demonstrate
the superior performance of the proposed dynamic supervisor.
","[{'version': 'v1', 'created': 'Fri, 1 Apr 2022 03:18:46 GMT'}]",2022-04-04,"[['Chen', 'Ze', ''], ['Fu', 'Zhihang', ''], ['Huang', 'Jianqiang', ''], ['Tao', 'Mingyuan', ''], ['Li', 'Shengyu', ''], ['Jiang', 'Rongxin', ''], ['Tian', 'Xiang', ''], ['Chen', 'Yaowu', ''], ['Hua', 'Xian-sheng', '']]","['Cross-dataset object detection', 'Hard-label training', 'Soft-label training', 'Dynamic ensembling']"
12619,2211.07977,Simone Angarano,"Luca Marchionna, Giulio Pugliese, Mauro Martini, Simone Angarano,
  Francesco Salvetti, Marcello Chiaberge","Deep Instance Segmentation and Visual Servoing to Play Jenga with a
  Cost-Effective Robotic System",,Sensors. 2023; 23(2):752,10.3390/s23020752,,cs.RO cs.CV cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The game of Jenga represents an inspiring benchmark for developing innovative
manipulation solutions for complex tasks. Indeed, it encouraged the study of
novel robotics methods to successfully extract blocks from the tower. A Jenga
game round undoubtedly embeds many traits of complex industrial or surgical
manipulation tasks, requiring a multi-step strategy, the combination of visual
and tactile data, and the highly precise motion of the robotic arm to perform a
single block extraction. In this work, we propose a novel, cost-effective
architecture for playing Jenga with e.Do, a 6-DOF anthropomorphic manipulator
manufactured by Comau, a standard depth camera, and an inexpensive
monodirectional force sensor. Our solution focuses on a visual-based control
strategy to accurately align the end-effector with the desired block, enabling
block extraction by pushing. To this aim, we train an instance segmentation
deep learning model on a synthetic custom dataset to segment each piece of the
Jenga tower, allowing visual tracking of the desired block's pose during the
motion of the manipulator. We integrate the visual-based strategy with a 1D
force sensor to detect whether the block can be safely removed by identifying a
force threshold value. Our experimentation shows that our low-cost solution
allows e.DO to precisely reach removable blocks and perform up to 14
consecutive extractions in a row.
","[{'version': 'v1', 'created': 'Tue, 15 Nov 2022 08:26:50 GMT'}, {'version': 'v2', 'created': 'Mon, 9 Jan 2023 15:57:33 GMT'}]",2023-01-10,"[['Marchionna', 'Luca', ''], ['Pugliese', 'Giulio', ''], ['Martini', 'Mauro', ''], ['Angarano', 'Simone', ''], ['Salvetti', 'Francesco', ''], ['Chiaberge', 'Marcello', '']]","['Jenga', 'Robotic Arm', 'Deep Instance Segmentation', 'Visual Servoing', 'Sensor Fusion']"
12620,2003.02537,Irene Celino,Irene Celino and Gloria Re Calegari,"Submitting surveys via a conversational interface: an evaluation of user
  acceptance and approach effectiveness","44 pages, 8 figures","International Journal of Human Computer Studies, Vol. 139 (2020)",10.1016/j.ijhcs.2020.102410,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Conversational interfaces are currently on the rise: more and more
applications rely on a chat-like interaction pattern to increase their
acceptability and to improve user experience. Also in the area of questionnaire
design and administration, interaction design is increasingly looked at as an
important ingredient of a digital solution. For those reasons, we designed and
developed a conversational survey tool to administer questionnaires with a
colloquial form through a chat-like Web interface.
  In this paper, we present the evaluation results of our approach, taking into
account both the user point of view - by assessing user acceptance and
preferences in terms of survey compilation experience - and the survey design
perspective - by investigating the effectiveness of a conversational survey in
comparison to a traditional questionnaire. We show that users clearly
appreciate the conversational form and prefer it over a traditional approach
and that, from a data collection point of view, the conversational method shows
the same reliability and a higher response quality with respect to a
traditional questionnaire.
","[{'version': 'v1', 'created': 'Thu, 5 Mar 2020 11:31:24 GMT'}]",2020-03-06,"[['Celino', 'Irene', ''], ['Calegari', 'Gloria Re', '']]","['conversational survey', 'survey design and administration', 'questionnaire reliability', 'questionnaire response quality', 'user experience', 'quantitative research']"
12621,2203.11826,Yoshiaki Takata,"Yoshiaki Takata, Ryoma Senda, and Hiroyuki Seki","Reduction of Register Pushdown Systems with Freshness Property to
  Pushdown Systems in LTL Model Checking","9 pages, 2 figures, this is a longer version of a short paper
  submitted to IEICE Transactions on Information and Systems",,10.1587/transinf.2022EDL8030,,cs.FL cs.LO,http://creativecommons.org/licenses/by/4.0/,"  Pushdown systems (PDS) are known as an abstract model of recursive programs,
and model checking methods for PDS have been studied. Register PDS (RPDS) are
PDS augmented by registers to deal with data values from an infinite domain in
a restricted way. A linear temporal logic (LTL) model checking method for RPDS
with regular valuations has been proposed; however, the method requires the
register automata (RA) used for representing a regular valuation to be
backward-deterministic. This paper proposes another approach to the same
problem, in which the model checking problem for RPDS is reduced to that
problem for PDS by constructing a PDS bisimulation equivalent to a given RPDS.
The construction in the proposed method is simpler than the previous model
checking method and does not require RAs deterministic or
backward-deterministic, and the bisimulation equivalence clearly guarantees the
correctness of this reduction. On the other hand, the proposed method requires
every RPDS (and RA) to have the freshness property, in which whenever the RPDS
updates a register with a data value not stored in any register or the stack
top, the value should be fresh. This paper also shows that this model checking
problem with regular valuations defined by general RA is undecidable, and thus
the freshness constraint is essential in the proposed method.
","[{'version': 'v1', 'created': 'Tue, 22 Mar 2022 15:51:07 GMT'}]",2022-09-14,"[['Takata', 'Yoshiaki', ''], ['Senda', 'Ryoma', ''], ['Seki', 'Hiroyuki', '']]","['model checking', 'register pushdown system', 'regular valuation']"
12622,2101.06096,Carlo Godoy Jr,Carlo H Godoy Jr,Motorcycle System for Optimum Road Safety with Anti-theft Capability,"10 pages. International Journal of Innovative Science and Research
  Technology 2020",,10.38124/ijisrt20jun314,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Due to road traffic accidents, 6941 Filipinos died in 2010, and thousands
more were wounded or disabled. Head and neck injuries are the main cause of
death, severe injury, and motorcycle users disabilities. Motorcycle users make
up a large proportion of those on the road who were killed. The main purpose of
the study is to develop an MCU Based Motorcycle System for Optimum Road Safety
with Anti-theft Capability that will help motorcycle riders to be safe while
travelling in national roads. The researchers will be using the prototyping
methodology where in a prototype is built according to the initial requirements
gathered from the motorists themselves. The expected result of the proposed
methodology is the system will be utilizing the different function of each
modules to ensure that the riders will be able to detect and avoid possible
danger while on the road. As a result of different literature in relation to
each module, the system is expected to provide a new leap to ensure the safety
of all riders here in the Philippines. Future studies will ensure the
development of the system, provide testing and improve the functionality of the
system depending on the test result. Due to the high increase in the number of
cars and motorcycle travelling on national road, the percentage of accidents
also is getting higher. In line with that, the proposed system is expected to
lessen the percentage of accident by avoiding the possible cause of it.
","[{'version': 'v1', 'created': 'Wed, 13 Jan 2021 10:58:30 GMT'}]",2021-01-18,"[['Godoy', 'Carlo H', 'Jr']]","['Motorcycle', 'Rider', 'Microcontroller', 'Modules', 'Road Safety', 'Transportation']"
12623,1906.03752,S. S. Ravi,"Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi and Richard E.
  Stearns",Symmetry Properties of Nested Canalyzing Functions,17 pages,"Discrete Mathematics & Theoretical Computer Science, vol. 21 no.
  4, Discrete Algorithms (November 26, 2019) dmtcs:5920",10.23638/DMTCS-21-4-19,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many researchers have studied symmetry properties of various Boolean
functions. A class of Boolean functions, called nested canalyzing functions
(NCFs), has been used to model certain biological phenomena. We identify some
interesting relationships between NCFs, symmetric Boolean functions and a
generalization of symmetric Boolean functions, which we call $r$-symmetric
functions (where $r$ is the symmetry level). Using a normalized representation
for NCFs, we develop a characterization of when two variables of an NCF are
symmetric. Using this characterization, we show that the symmetry level of an
NCF $f$ can be easily computed given a standard representation of $f$. We also
present an algorithm for testing whether a given $r$-symmetric function is an
NCF. Further, we show that for any NCF $f$ with $n$ variables, the notion of
strong asymmetry considered in the literature is equivalent to the property
that $f$ is $n$-symmetric. We use this result to derive a closed form
expression for the number of $n$-variable Boolean functions that are NCFs and
strongly asymmetric. We also identify all the Boolean functions that are NCFs
and symmetric.
","[{'version': 'v1', 'created': 'Mon, 10 Jun 2019 01:04:42 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Oct 2019 15:55:50 GMT'}, {'version': 'v3', 'created': 'Mon, 25 Nov 2019 14:54:43 GMT'}]",2020-06-17,"[['Rosenkrantz', 'Daniel J.', ''], ['Marathe', 'Madhav V.', ''], ['Ravi', 'S. S.', ''], ['Stearns', 'Richard E.', '']]","['Boolean functions', 'Nested canalyzing functions', 'Symmetry', 'Algorithms']"
12624,2111.14020,Adam Lechowicz,"Nikita Bhalla, Adam Lechowicz, Cameron Musco",Local Edge Dynamics and Opinion Polarization,"Accepted to WSDM 2023. 14 pages, 30 figures",,10.1145/3539597.3570442,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The proliferation of social media platforms, recommender systems, and their
joint societal impacts have prompted significant interest in opinion formation
and evolution within social networks. We study how local edge dynamics can
drive opinion polarization. In particular, we introduce a variant of the
classic Friedkin-Johnsen opinion dynamics, augmented with a simple
time-evolving network model. Edges are iteratively added or deleted according
to simple rules, modeling decisions based on individual preferences and network
recommendations.
  Via simulations on synthetic and real-world graphs, we find that the combined
presence of two dynamics gives rise to high polarization: 1) confirmation bias
-- i.e., the preference for nodes to connect to other nodes with similar
expressed opinions and 2) friend-of-friend link recommendations, which
encourage new connections between closely connected nodes. We show that our
model is tractable to theoretical analysis, which helps explain how these local
dynamics erode connectivity across opinion groups, affecting polarization and a
related measure of disagreement across edges. Finally, we validate our model
against real-world data, showing that our edge dynamics drive the structure of
arbitrary graphs, including random graphs, to more closely resemble real social
networks.
","[{'version': 'v1', 'created': 'Sun, 28 Nov 2021 01:59:57 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Dec 2022 22:52:05 GMT'}]",2022-12-12,"[['Bhalla', 'Nikita', ''], ['Lechowicz', 'Adam', ''], ['Musco', 'Cameron', '']]","['opinion polarization', 'Friedkin-Johnsen model', 'polarization anddisagreement', 'recommender systems', 'random graph models']"
12625,2105.02091,Avijit Ghosh,"Avijit Ghosh, Ritam Dutt, Christo Wilson",When Fair Ranking Meets Uncertain Inference,Accepted as full paper at SIGIR 2021,,10.1145/3404835.3462850,,cs.IR cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing fair ranking systems, especially those designed to be
demographically fair, assume that accurate demographic information about
individuals is available to the ranking algorithm. In practice, however, this
assumption may not hold -- in real-world contexts like ranking job applicants
or credit seekers, social and legal barriers may prevent algorithm operators
from collecting peoples' demographic information. In these cases, algorithm
operators may attempt to infer peoples' demographics and then supply these
inferences as inputs to the ranking algorithm.
  In this study, we investigate how uncertainty and errors in demographic
inference impact the fairness offered by fair ranking algorithms. Using
simulations and three case studies with real datasets, we show how demographic
inferences drawn from real systems can lead to unfair rankings. Our results
suggest that developers should not use inferred demographic data as input to
fair ranking algorithms, unless the inferences are extremely accurate.
","[{'version': 'v1', 'created': 'Wed, 5 May 2021 14:40:07 GMT'}, {'version': 'v2', 'created': 'Wed, 4 May 2022 21:00:47 GMT'}]",2022-05-06,"[['Ghosh', 'Avijit', ''], ['Dutt', 'Ritam', ''], ['Wilson', 'Christo', '']]","['ranking algorithms', 'demographic inference', 'algorithmic fairness', 'ethical ai', 'noisy protected attributes', 'uncertainty']"
12626,2006.03103,Stefan Monnier,"Stefan Monnier (University of Montreal, Canada)",SMIE: Weakness is Power!: Auto-indentation with incomplete information,,"The Art, Science, and Engineering of Programming, 2021, Vol. 5,
  Issue 1, Article 1",10.22152/programming-journal.org/2021/5/1,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic indentation of source code is fundamentally a simple matter of
parsing the code and then applying language- and style-specific rules about
relative indentation of the various constructs. Yet, in practice, full parsing
is not always an option, either because of quirks of the language, or because
the code is temporarily syntactically incorrect, or because of an incomplete or
broken grammar. I present the design of Emacs's Simple-Minded Indentation
Engine (SMIE), which gets its power from the weakness of the underlying parsing
technique. It makes it possible to perform local parsing, which is hence
unaffected by irrelevant surrounding code. This provides a form of graceful
degradation in the face of incomplete, erroneous, or just plain problematic
information.
","[{'version': 'v1', 'created': 'Thu, 4 Jun 2020 19:08:59 GMT'}]",2020-06-08,"[['Monnier', 'Stefan', '', 'University of Montreal, Canada']]","['text editing', 'auto-indentation', 'operator precedence parsing', 'local parsing']"
12627,1810.01223,Max A. Deppert,"Max A. Deppert, Klaus Jansen","Near-Linear Approximation Algorithms for Scheduling Problems with Batch
  Setup Times",,,10.1145/3323165.3323200,,cs.DS cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the scheduling of $n$ jobs divided into $c$ classes on $m$
identical parallel machines. For every class there is a setup time which is
required whenever a machine switches from the processing of one class to
another class. The objective is to find a schedule that minimizes the makespan.
We give near-linear approximation algorithms for the following problem
variants: the non-preemptive context where jobs may not be preempted, the
preemptive context where jobs may be preempted but not parallelized, as well as
the splittable context where jobs may be preempted and parallelized.
  We present the first algorithm improving the previously best approximation
ratio of $2$ to a better ratio of $3/2$ in the preemptive case. In more detail,
for all three flavors we present an approximation ratio $2$ with running time
$\mathcal{O}(n)$, ratio $3/2+\varepsilon$ in time $\mathcal{O}(n\log
1/\varepsilon)$ as well as a ratio of $3/2$. The $(3/2)$-approximate algorithms
have different running times. In the non-preemptive case we get time
$\mathcal{O}(n\log (n+\Delta))$ where $\Delta$ is the largest value of the
input. The splittable approximation runs in time $\mathcal{O}(n+c\log(c+m))$
whereas the preemptive algorithm has a running time $\mathcal{O}(n \log (c+m))
\leq \mathcal{O}(n \log n)$. So far, no PTAS is known for the preemptive
problem without restrictions, so we make progress towards that question.
Recently Jansen et al. found an EPTAS for the splittable and non-preemptive
case but with impractical running times exponential in $1/\varepsilon$.
","[{'version': 'v1', 'created': 'Tue, 2 Oct 2018 13:14:46 GMT'}, {'version': 'v2', 'created': 'Wed, 1 May 2019 17:01:08 GMT'}]",2019-05-02,"[['Deppert', 'Max A.', ''], ['Jansen', 'Klaus', '']]","['approximation', 'scheduling', 'setup times', 'preemption', 'parallelization']"
12628,2112.01590,Sumon Biswas,"Sumon Biswas, Mohammad Wardat, Hridesh Rajan","The Art and Practice of Data Science Pipelines: A Comprehensive Study of
  Data Science Pipelines In Theory, In-The-Small, and In-The-Large",,"ICSE 2022: The 44th International Conference on Software
  Engineering",10.1145/3510003.3510057,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Increasingly larger number of software systems today are including data
science components for descriptive, predictive, and prescriptive analytics. The
collection of data science stages from acquisition, to cleaning/curation, to
modeling, and so on are referred to as data science pipelines. To facilitate
research and practice on data science pipelines, it is essential to understand
their nature. What are the typical stages of a data science pipeline? How are
they connected? Do the pipelines differ in the theoretical representations and
that in the practice? Today we do not fully understand these architectural
characteristics of data science pipelines. In this work, we present a
three-pronged comprehensive study to answer this for the state-of-the-art, data
science in-the-small, and data science in-the-large. Our study analyzes three
datasets: a collection of 71 proposals for data science pipelines and related
concepts in theory, a collection of over 105 implementations of curated data
science pipelines from Kaggle competitions to understand data science
in-the-small, and a collection of 21 mature data science projects from GitHub
to understand data science in-the-large. Our study has led to three
representations of data science pipelines that capture the essence of our
subjects in theory, in-the-small, and in-the-large.
","[{'version': 'v1', 'created': 'Thu, 2 Dec 2021 20:16:03 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Dec 2021 06:01:50 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Feb 2022 17:35:39 GMT'}]",2022-02-15,"[['Biswas', 'Sumon', ''], ['Wardat', 'Mohammad', ''], ['Rajan', 'Hridesh', '']]","['data science pipelines', 'data science processes', 'descriptive', 'predictive']"
12629,2108.11903,Grischa Liebel,"Rodi Jolak and Andreas Wortmann and Grischa Liebel and Eric Umuhoza
  and Michel R.V. Chaudron","Design Thinking and Creativity of Co-located vs. Globally Distributed
  Software Developers","This is a pre-peer-review version of an article published in Wiley
  Journal of Software: Evolution and Process. The final version is available
  via https://dx.doi.org/10.1002/smr.2377",,10.1002/smr.2377,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Context: Designing software is an activity in which software developers think
and make design decisions that shape the structure and behavior of software
products. Designing software is one of the least understood software
engineering activities. In a collaborative design setting, various types of
distances can lead to challenges and effects that potentially affect how
software is designed. Objective: To contribute to a better understanding of
collaborative software design, we investigate how geographic distance affects
its design thinking and the creativity of its discussions. Method: To this end,
we conducted a multiple-case study exploring the design thinking and creativity
of co-located and distributed software developers in a collaborative design
setting. Results: Compared to co-located developers, distributed developers
spend less time on exploring the problem space, which could be related to
different socio-technical challenges, such as lack of awareness and common
understanding. Distributed development does not seem to affect the creativity
of their activities. Conclusion: Developers engaging in collaborative design
need to be aware that problem space exploration is reduced in a distributed
setting. Unless distributed teams take compensatory measures, this could
adversely affect the development. Regarding the effect distance has on
creativity, our results are inconclusive and further studies are needed.
","[{'version': 'v1', 'created': 'Thu, 26 Aug 2021 16:50:31 GMT'}]",2021-08-27,"[['Jolak', 'Rodi', ''], ['Wortmann', 'Andreas', ''], ['Liebel', 'Grischa', ''], ['Umuhoza', 'Eric', ''], ['Chaudron', 'Michel R. V.', '']]","['Software Engineering', 'Collaborative Design Thinking', 'Creativity', 'Distance', 'Cognitive']"
12630,2109.12968,Maryline Laurent,"Paul Marillonnet, Maryline Laurent, Mika\""el Ates","Personal information self-management: A survey of technologies
  supporting administrative services",,"Journal of Computer Science and Technology, 2021",10.1007/s11390-021-9673-z,,cs.CY cs.NI,http://creativecommons.org/licenses/by/4.0/,"  This paper presents a survey of technologies for personal data
self-management interfacing with administrative and territorial public service
providers. It classifies a selection of scientific technologies into four
categories of solutions: Personal Data Store (PDS), Identity Manager (IdM),
Anonymous Certificate System and Access Control Delegation Architecture. Each
category, along with its technological approach, is analyzed thanks to eighteen
identified functional criteria that encompass architectural and communication
aspects, as well as user data lifecycle considerations. The originality of the
survey is multifold. First, as far as we know, there is no such thorough survey
covering such a panel of a dozen of existing solutions. Second, it is the first
survey addressing Personally Identifiable Information (PII) management for both
administrative and private service providers. Third, this paper achieves a
functional comparison of solutions of very different technical natures. The
outcome of this paper is the clear identification of functional gaps of each
solution. As a result, this paper establishes the research directions to follow
in order to fill these functional gaps.
","[{'version': 'v1', 'created': 'Mon, 27 Sep 2021 11:45:20 GMT'}]",2021-09-28,"[['Marillonnet', 'Paul', ''], ['Laurent', 'Maryline', ''], ['Ates', 'Mikaël', '']]","['personal information management', 'privacy enforcement', 'user-centric solutions', 'technological survey']"
12631,2006.11195,Mina Maleki,"Sandhya Rani Kourla, Eesha Putti and Mina Maleki",REBD:A Conceptual Framework for Big Data Requirements Engineering,"9 pages,2 figures, one table, CSIT2020",,10.5121/csit.2020.100608,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Requirements engineering (RE), as a part of the project development life
cycle, has increasingly been recognized as the key to ensuring on-time,
on-budget, and goal-based delivery of software projects;compromising this vital
phase is nothing but project failures. RE of big data projects is even more
crucial because of the main characteristics of big data, including high volume,
velocity, and variety. As the traditional RE methods and tools are user-centric
rather than data-centric, employing these methodologies is insufficient to
fulfill the RE processes for big data projects. Because of the importance of RE
and limitations of traditional RE methodologies in the context of big data
software projects, in this paper, a big data requirements engineering
framework, named REBD, has been proposed. This conceptual framework describes
the systematic plan to carry out big data projects starting from requirements
engineering to the development, assuring successful execution, and increased
productivity of the big data projects.
","[{'version': 'v1', 'created': 'Fri, 19 Jun 2020 15:49:00 GMT'}]",2020-06-22,"[['Kourla', 'Sandhya Rani', ''], ['Putti', 'Eesha', ''], ['Maleki', 'Mina', '']]","['Big data', 'requirements engineering', 'requirements elicitation', 'knowledge discovery']"
12632,2108.08976,Zhiyuan Zhang,"Zhiyuan Zhang, Wei Li, Ruihan Bao, Keiko Harimoto, Yunfang Wu, Xu Sun",ASAT: Adaptively Scaled Adversarial Training in Time Series,Accepted to Neurocomputing,Neurocomputing 522 (2023) pp. 11-23,10.1016/j.neucom.2022.12.013,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Adversarial training is a method for enhancing neural networks to improve the
robustness against adversarial examples. Besides the security concerns of
potential adversarial examples, adversarial training can also improve the
generalization ability of neural networks, train robust neural networks, and
provide interpretability for neural networks. In this work, we introduce
adversarial training in time series analysis to enhance the neural networks for
better generalization ability by taking the finance field as an example.
Rethinking existing research on adversarial training, we propose the adaptively
scaled adversarial training (ASAT) in time series analysis, by rescaling data
at different time slots with adaptive scales. Experimental results show that
the proposed ASAT can improve both the generalization ability and the
adversarial robustness of neural networks compared to the baselines. Compared
to the traditional adversarial training algorithm, ASAT can achieve better
generalization ability and similar adversarial robustness.
","[{'version': 'v1', 'created': 'Fri, 20 Aug 2021 03:13:34 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Dec 2022 03:33:42 GMT'}]",2022-12-21,"[['Zhang', 'Zhiyuan', ''], ['Li', 'Wei', ''], ['Bao', 'Ruihan', ''], ['Harimoto', 'Keiko', ''], ['Wu', 'Yunfang', ''], ['Sun', 'Xu', '']]","['Time Series', 'Adversarial Training', 'Adaptive Adversarial Training']"
12633,2205.00664,Michael Weiss,Michael Weiss and Paolo Tonella,"Simple Techniques Work Surprisingly Well for Neural Network Test
  Prioritization and Active Learning (Replicability Study)",Accepted at ISSTA 2022,,10.1145/3533767.3534375,,cs.LG cs.AI cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Test Input Prioritizers (TIP) for Deep Neural Networks (DNN) are an important
technique to handle the typically very large test datasets efficiently, saving
computation and labeling costs. This is particularly true for large-scale,
deployed systems, where inputs observed in production are recorded to serve as
potential test or training data for the next versions of the system. Feng et.
al. propose DeepGini, a very fast and simple TIP, and show that it outperforms
more elaborate techniques such as neuron- and surprise coverage. In a
large-scale study (4 case studies, 8 test datasets, 32'200 trained models) we
verify their findings. However, we also find that other comparable or even
simpler baselines from the field of uncertainty quantification, such as the
predicted softmax likelihood or the entropy of the predicted softmax
likelihoods perform equally well as DeepGini.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 05:47:34 GMT'}, {'version': 'v2', 'created': 'Tue, 24 May 2022 15:16:31 GMT'}]",2022-05-25,"[['Weiss', 'Michael', ''], ['Tonella', 'Paolo', '']]","['Test prioritization', 'neural networks', 'uncertainty quantification']"
12634,2205.10550,Wei Ju,"Wei Ju, Junwei Yang, Meng Qu, Weiping Song, Jianhao Shen, Ming Zhang","KGNN: Harnessing Kernel-based Networks for Semi-supervised Graph
  Classification",Published as a full paper at WSDM 2022,,10.1145/3488560.3498429,,cs.LG cs.AI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies semi-supervised graph classification, which is an
important problem with various applications in social network analysis and
bioinformatics. This problem is typically solved by using graph neural networks
(GNNs), which yet rely on a large number of labeled graphs for training and are
unable to leverage unlabeled graphs. We address the limitations by proposing
the Kernel-based Graph Neural Network (KGNN). A KGNN consists of a GNN-based
network as well as a kernel-based network parameterized by a memory network.
The GNN-based network performs classification through learning graph
representations to implicitly capture the similarity between query graphs and
labeled graphs, while the kernel-based network uses graph kernels to explicitly
compare each query graph with all the labeled graphs stored in a memory for
prediction. The two networks are motivated from complementary perspectives, and
thus combing them allows KGNN to use labeled graphs more effectively. We
jointly train the two networks by maximizing their agreement on unlabeled
graphs via posterior regularization, so that the unlabeled graphs serve as a
bridge to let both networks mutually enhance each other. Experiments on a range
of well-known benchmark datasets demonstrate that KGNN achieves impressive
performance over competitive baselines.
","[{'version': 'v1', 'created': 'Sat, 21 May 2022 10:03:46 GMT'}]",2022-05-24,"[['Ju', 'Wei', ''], ['Yang', 'Junwei', ''], ['Qu', 'Meng', ''], ['Song', 'Weiping', ''], ['Shen', 'Jianhao', ''], ['Zhang', 'Ming', '']]","['Graph Classification', 'Graph Neural Networks', 'Graph Kernels', 'Semisupervised Learning']"
12635,2006.15648,Taha Yasseri,Alicia Mergenthaler and Taha Yasseri,"Selling sex: what determines rates and popularity? An analysis of 11,500
  online profiles",Main manuscript and Supplementary Information,"Culture, Health & Sexuality, 24:7, 935-952 (2022)",10.1080/13691058.2021.1901145,,cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sex work, or the exchange of sexual services for money or goods, is
ubiquitous across eras and cultures. However, the practice of selling sex is
often hidden due to stigma and the varying legal status of sex work. Online
platforms that sex workers use to advertise services have become an
increasingly important means of studying a market that is largely hidden.
Although prior literature has primarily shed light on sex work from a public
health or policy perspective (focusing largely on female sex workers), there
are few studies that empirically research patterns of service provision in
online sex work. This study investigated the determinants of pricing and
popularity in the market for commercial sexual services online by using data
from the largest UK network of online sexual services, a platform that is the
industry-standard for sex workers. While the size of these influences varies
across genders, nationality, age and the services provided are shown to be
primary drivers of rates and popularity in sex work.
","[{'version': 'v1', 'created': 'Sun, 28 Jun 2020 16:46:22 GMT'}, {'version': 'v2', 'created': 'Tue, 4 May 2021 10:51:58 GMT'}, {'version': 'v3', 'created': 'Tue, 11 May 2021 17:04:07 GMT'}]",2023-01-05,"[['Mergenthaler', 'Alicia', ''], ['Yasseri', 'Taha', '']]","['sex work', 'popularity dynamics', 'gender', 'online marketplace', 'UK']"
12636,2208.00758,Eske Hoy Nielsen,"Mikkel Milo, Eske Hoy Nielsen, Danil Annenkov, Bas Spitters","Finding smart contract vulnerabilities with ConCert's property-based
  testing framework",,"FMBC: Formal Methods for Blockchains, 2022",10.4230/OASIcs.FMBC.2022.2,,cs.LO cs.PL,http://creativecommons.org/licenses/by/4.0/,"  We provide three detailed case studies of vulnerabilities in smart contracts,
and show how property-based testing would have found them:
  1. the Dexter1 token exchange;
  2. the iToken;
  3. the ICO of Brave's BAT token.
  The last example is, in fact, new, and was missed in the auditing process. We
have implemented this testing in ConCert, a general executable
model/specification of smart contract execution in the Coq proof assistant.
ConCert contracts can be used to generate verified smart contracts in Tezos'
LIGO and Concordium's rust language. We thus show the effectiveness of
combining formal verification and property-based testing of smart contracts.
","[{'version': 'v1', 'created': 'Mon, 1 Aug 2022 11:35:16 GMT'}]",2022-10-07,"[['Milo', 'Mikkel', ''], ['Nielsen', 'Eske Hoy', ''], ['Annenkov', 'Danil', ''], ['Spitters', 'Bas', '']]","['Smart Contracts', 'Formal Verification', 'Property-Based Testing', 'Coq']"
12637,2208.02906,Giuseppe Emanuele Lio Dr.,"Giuseppe Emanuele Lio, Sara Nocentini, Lorenzo Pattelli, Eleonora
  Cara, Diederik Sybolt Wiersma, Ulrich R\""uhrmair and Francesco Riboli","Quantifying the Sensitivity and Unclonability of Optical Physical
  Unclonable Functions","8 pages, 7 figures and Supporting Information",,10.1002/adpr.202200225,,cs.CR physics.app-ph physics.optics,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to their unmatched entropy, complexity, and security level, optical
Physical Unclonable Functions (PUFs) currently receive a lot of interest in the
literature. Despite the large body of existing works, however, one of their
core features has never been quantified in detail, namely their physical
unclonability. This paper tackles this fundamental and yet largely unaddressed
issue. In simulations and/or experiments, the sensitivity of diffraction-based
optical responses is investigated with respect to various small alterations
such as variation in the position, size, and number of the scatterers, as well
as perturbations in the spatial alignment between the physical unclonable
function (PUF) and the measurement apparatus. Our analysis focuses on 2D
optical PUFs because of their relevance in integrated applications and the need
to reply to security concerns that can be raised when the physical structure of
the geometry is accessible. Among the results of this study, the sensitivity
analysis shows that a positional perturbation of scatterers on the order of
\SI{30}{\nano\meter}, i.e., far below the wavelength of the probing laser light
of \SI{632}{\nano\meter} wavelength, is sufficient to invalidate the PUF
response and thus detect a forgery attempt. These results support and quantify
the high adversarial efforts required to clone optical PUFs, even for 2D
layouts.
","[{'version': 'v1', 'created': 'Fri, 29 Jul 2022 18:39:56 GMT'}]",2022-12-12,"[['Lio', 'Giuseppe Emanuele', ''], ['Nocentini', 'Sara', ''], ['Pattelli', 'Lorenzo', ''], ['Cara', 'Eleonora', ''], ['Wiersma', 'Diederik Sybolt', ''], ['Rührmair', 'Ulrich', ''], ['Riboli', 'Francesco', '']]","['Optical Physical Unclonable Functions', 'Rayleigh-Sommerfeld diffraction', 'Authentication', 'Specklesensitivity', 'Scattering']"
12638,2205.02149,Vladimir Lysikov,"Fulvio Gesmundo, Purnata Ghosal, Christian Ikenmeyer, Vladimir Lysikov","Degree-restricted strength decompositions and algebraic branching
  programs",14 pages,"42nd IARCS Annual Conference on Foundations of Software Technology
  and Theoretical Computer Science (FSTTCS 2022), pp. 20:1--20:15",10.4230/LIPIcs.FSTTCS.2022.20,,cs.CC math.AG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze Kumar's recent quadratic algebraic branching program size lower
bound proof method (CCC 2017) for the power sum polynomial. We present a
refinement of this method that gives better bounds in some cases.
  The lower bound relies on Noether-Lefschetz type conditions on the
hypersurface defined by the homogeneous polynomial. In the explicit example
that we provide, the lower bound is proved resorting to classical intersection
theory.
  Furthermore, we use similar methods to improve the known lower bound methods
for slice rank of polynomials. We consider a sequence of polynomials that have
been studied before by Shioda and show that for these polynomials the improved
lower bound matches the known upper bound.
","[{'version': 'v1', 'created': 'Wed, 4 May 2022 16:04:47 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Aug 2022 08:57:24 GMT'}]",2022-12-27,"[['Gesmundo', 'Fulvio', ''], ['Ghosal', 'Purnata', ''], ['Ikenmeyer', 'Christian', ''], ['Lysikov', 'Vladimir', '']]","['Lower bounds', 'Slice rank', 'Strength of polynomials', 'Algebraic branchingprograms']"
12639,2002.09931,Carlos Sarraute PhD,"Mar\'ia \'Oskarsd\'ottir, Cristi\'an Bravo, Carlos Sarraute, Jan
  Vanthienen, Bart Baesens","The Value of Big Data for Credit Scoring: Enhancing Financial Inclusion
  using Mobile Phone Data and Social Network Analytics",,"Applied Soft Computing, Volume 74, January 2019, Pages 26-39",10.1016/j.asoc.2018.10.004,,cs.SI cs.CY cs.LG stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Credit scoring is without a doubt one of the oldest applications of
analytics. In recent years, a multitude of sophisticated classification
techniques have been developed to improve the statistical performance of credit
scoring models. Instead of focusing on the techniques themselves, this paper
leverages alternative data sources to enhance both statistical and economic
model performance. The study demonstrates how including call networks, in the
context of positive credit information, as a new Big Data source has added
value in terms of profit by applying a profit measure and profit-based feature
selection. A unique combination of datasets, including call-detail records,
credit and debit account information of customers is used to create scorecards
for credit card applicants. Call-detail records are used to build call networks
and advanced social network analytics techniques are applied to propagate
influence from prior defaulters throughout the network to produce influence
scores. The results show that combining call-detail records with traditional
data in credit scoring models significantly increases their performance when
measured in AUC. In terms of profit, the best model is the one built with only
calling behavior features. In addition, the calling behavior features are the
most predictive in other models, both in terms of statistical and economic
performance. The results have an impact in terms of ethical use of call-detail
records, regulatory implications, financial inclusion, as well as data sharing
and privacy.
","[{'version': 'v1', 'created': 'Sun, 23 Feb 2020 16:13:56 GMT'}]",2020-03-20,"[['Óskarsdóttir', 'María', ''], ['Bravo', 'Cristián', ''], ['Sarraute', 'Carlos', ''], ['Vanthienen', 'Jan', ''], ['Baesens', 'Bart', '']]","['Credit Scoring', 'Social Network Analysis', 'Profit Measure', 'Mobile Phone Data']"
12640,1904.06920,Debjyoti Bhattacharjee,"Laxmidhar Biswal, Debjyoti Bhattacharjee, Anupam Chattopadhyay and
  Hafizur Rahaman","New techniques for fault-tolerant decomposition of Multi-Controlled
  Toffoli gate","9 pages, 11 figures","Phys. Rev. A 100, 062326 (2019)",10.1103/PhysRevA.100.062326,,cs.ET quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Physical implementation of scalable quantum architectures faces an immense
challenge in form of fragile quantum states. To overcome it, quantum
architectures with fault tolerance is desirable. This is achieved currently by
using surface code along with a transversal gate set. This dictates the need
for decomposition of universal Multi Control Toffoli~(MCT) gates using a
transversal gate set. Additionally, the transversal non-Clifford phase gate
incurs high latency which makes it an important factor to consider during
decomposition.Besides, the decomposition of large Multi-control Toffoli~(MCT)
gate without ancilla presents an additional hurdle. In this manuscript, we
address both of these issues by introducing Clifford+$Z_N$ gate library. We
present an ancilla free decomposition of MCT gates with linear phase depth and
quadratic phase count. Furthermore, we provide a technique for decomposition of
MCT gates in unit phase depth using the Clifford+$Z_N$ library, albeit at the
cost of ancillary lines and quadratic phase count.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2019 09:17:31 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Apr 2019 10:49:45 GMT'}]",2019-12-25,"[['Biswal', 'Laxmidhar', ''], ['Bhattacharjee', 'Debjyoti', ''], ['Chattopadhyay', 'Anupam', ''], ['Rahaman', 'Hafizur', '']]","['Clifford+ZN', 'Quantum Computing', 'Multi-control Toffoli gate', 'Decomposition']"
12641,2010.03781,Wenge Xu,"Wenge Xu, Hai-Ning Liang, Xiaoyue Ma, Xiang Li",VirusBoxing: A HIIT-based VR boxing game,Corresponding author: haining.liang@xjtlu.edu.cn,"In Extended Abstracts of the 2020 Annual Symposium on
  Computer-Human Interaction in Play (CHI PLAY' 20 EA)",10.1145/3383668.3419958,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Physical activity or exercise can improve people's health and reduce their
risk of developing several diseases; most importantly, regular activity can
improve the quality of life. However, lack of time is one of the major barriers
for people doing exercise. High-intensity interval training (HIIT) can reduce
the time required for a healthy exercise regime but also bring similar benefits
of regular exercise. We present a boxing-based VR exergame called VirusBoxing
to promote physical activity for players. VirusBoxing provides players with a
platform for HIIT and empowers them with additional abilities to jab a distant
object without the need to aim at it precisely. In this paper, we discuss how
we adapted the HIIT protocol and gameplay features to empower players in a VR
exergame to give players an efficient, effective, and enjoyable exercise
experience.
","[{'version': 'v1', 'created': 'Thu, 8 Oct 2020 05:55:03 GMT'}]",2020-10-09,"[['Xu', 'Wenge', ''], ['Liang', 'Hai-Ning', ''], ['Ma', 'Xiaoyue', ''], ['Li', 'Xiang', '']]","['Exergame', 'virtual reality', 'ability empowerment']"
12642,1905.08780,Miguel Angel Alvarez,"Miguel \'A. \'Alvarez-Carmona, Esa\'u Villatoro-Tello and Manuel
  Montes-y-G\'omez and Luis Villase\~nor-Pienda","A Comparative Analysis of Distributional Term Representations for Author
  Profiling in Social Media",,"Journal of Intelligent & Fuzzy Systems, vol. 36, no. 5, pp.
  4857-4868, 2019",10.3233/JIFS-179033,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Author Profiling (AP) aims at predicting specific characteristics from a
group of authors by analyzing their written documents. Many research has been
focused on determining suitable features for modeling writing patterns from
authors. Reported results indicate that content-based features continue to be
the most relevant and discriminant features for solving this task. Thus, in
this paper, we present a thorough analysis regarding the appropriateness of
different distributional term representations (DTR) for the AP task. In this
regard, we introduce a novel framework for supervised AP using these
representations and, supported on it. We approach a comparative analysis of
representations such as DOR, TCOR, SSR, and word2vec in the AP problem. We also
compare the performance of the DTRs against classic approaches including
popular topic-based methods. The obtained results indicate that DTRs are
suitable for solving the AP task in social media domains as they achieve
competitive results while providing meaningful interpretability.
","[{'version': 'v1', 'created': 'Tue, 21 May 2019 17:54:09 GMT'}]",2019-05-22,"[['Álvarez-Carmona', 'Miguel Á.', ''], ['Villatoro-Tello', 'Esaú', ''], ['Montes-y-Gómez', 'Manuel', ''], ['Villaseñor-Pienda', 'Luis', '']]","['Author profiling', 'document representation', 'distributional term representation', 'textclassification', 'social media']"
12643,2203.01438,Qifan Wang,"Qifan Wang, Shujie Cui, Lei Zhou, Ocean Wu, Yonghua Zhu and Giovanni
  Russello","EnclaveTree: Privacy-preserving Data Stream Training and Inference Using
  TEE","15 pages, 12 figures",,10.1145/3488932.3517391,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The classification service over a stream of data is becoming an important
offering for cloud providers, but users may encounter obstacles in providing
sensitive data due to privacy concerns. While Trusted Execution Environments
(TEEs) are promising solutions for protecting private data, they remain
vulnerable to side-channel attacks induced by data-dependent access patterns.
We propose a Privacy-preserving Data Stream Training and Inference scheme,
called EnclaveTree, that provides confidentiality for user's data and the
target models against a compromised cloud service provider. We design a
matrix-based training and inference procedure to train the Hoeffding Tree (HT)
model and perform inference with the trained model inside the trusted area of
TEEs, which provably prevent the exploitation of access-pattern-based attacks.
The performance evaluation shows that EnclaveTree is practical for processing
the data streams with small or medium number of features. When there are less
than 63 binary features, EnclaveTree is up to ${\thicksim}10{\times}$ and
${\thicksim}9{\times}$ faster than na\""ive oblivious solution on training and
inference, respectively.
","[{'version': 'v1', 'created': 'Wed, 2 Mar 2022 22:23:49 GMT'}]",2022-03-04,"[['Wang', 'Qifan', ''], ['Cui', 'Shujie', ''], ['Zhou', 'Lei', ''], ['Wu', 'Ocean', ''], ['Zhu', 'Yonghua', ''], ['Russello', 'Giovanni', '']]","['Data stream', 'hoeffding tree', 'SGX enclave', 'data-oblivious']"
12644,2001.05493,Anant Khandelwal,"Anant Khandelwal, Niraj Kumar","A Unified System for Aggression Identification in English Code-Mixed and
  Uni-Lingual Texts","10 pages, 5 Figures, 6 Tables, accepted at CoDS-COMAD 2020",,10.1145/3371158.3371165,,cs.CL cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Wide usage of social media platforms has increased the risk of aggression,
which results in mental stress and affects the lives of people negatively like
psychological agony, fighting behavior, and disrespect to others. Majority of
such conversations contains code-mixed languages[28]. Additionally, the way
used to express thought or communication style also changes from one social
media plat-form to another platform (e.g., communication styles are different
in twitter and Facebook). These all have increased the complexity of the
problem. To solve these problems, we have introduced a unified and robust
multi-modal deep learning architecture which works for English code-mixed
dataset and uni-lingual English dataset both.The devised system, uses
psycho-linguistic features and very ba-sic linguistic features. Our multi-modal
deep learning architecture contains, Deep Pyramid CNN, Pooled BiLSTM, and
Disconnected RNN(with Glove and FastText embedding, both). Finally, the system
takes the decision based on model averaging. We evaluated our system on English
Code-Mixed TRAC 2018 dataset and uni-lingual English dataset obtained from
Kaggle. Experimental results show that our proposed system outperforms all the
previous approaches on English code-mixed dataset and uni-lingual English
dataset.
","[{'version': 'v1', 'created': 'Wed, 15 Jan 2020 17:06:29 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Jan 2020 06:50:54 GMT'}]",2020-01-22,"[['Khandelwal', 'Anant', ''], ['Kumar', 'Niraj', '']]","['English code-mixed Text', 'Deep Pyramid CNN', 'Disconnected RNN', 'Pooled BiLSTM', 'Model Averaging']"
12645,2208.05190,Yu Zheng,"Yu Zheng, Chen Gao, Jingtao Ding, Lingling Yi, Depeng Jin, Yong Li,
  Meng Wang","DVR: Micro-Video Recommendation Optimizing Watch-Time-Gain under
  Duration Bias",Accepted by MM'22,,10.1145/3503161.3548428,,cs.IR cs.MM,http://creativecommons.org/licenses/by/4.0/,"  Recommender systems are prone to be misled by biases in the data. Models
trained with biased data fail to capture the real interests of users, thus it
is critical to alleviate the impact of bias to achieve unbiased recommendation.
In this work, we focus on an essential bias in micro-video recommendation,
duration bias. Specifically, existing micro-video recommender systems usually
consider watch time as the most critical metric, which measures how long a user
watches a video. Since videos with longer duration tend to have longer watch
time, there exists a kind of duration bias, making longer videos tend to be
recommended more against short videos. In this paper, we empirically show that
commonly-used metrics are vulnerable to duration bias, making them NOT suitable
for evaluating micro-video recommendation. To address it, we further propose an
unbiased evaluation metric, called WTG (short for Watch Time Gain). Empirical
results reveal that WTG can alleviate duration bias and better measure
recommendation performance. Moreover, we design a simple yet effective model
named DVR (short for Debiased Video Recommendation) that can provide unbiased
recommendation of micro-videos with varying duration, and learn unbiased user
preferences via adversarial learning. Extensive experiments based on two
real-world datasets demonstrate that DVR successfully eliminates duration bias
and significantly improves recommendation performance with over 30% relative
progress. Codes and datasets are released at
https://github.com/tsinghua-fib-lab/WTG-DVR.
","[{'version': 'v1', 'created': 'Wed, 10 Aug 2022 07:18:17 GMT'}]",2022-08-11,"[['Zheng', 'Yu', ''], ['Gao', 'Chen', ''], ['Ding', 'Jingtao', ''], ['Yi', 'Lingling', ''], ['Jin', 'Depeng', ''], ['Li', 'Yong', ''], ['Wang', 'Meng', '']]","['Recommendation', 'micro-video', 'duration bias', 'fairness']"
12646,1906.06331,Nima Miryeganeh,"Nima Miryeganeh, Mehdi Amoui and Hadi Hemmati","An IR-based Approach Towards Automated Integration of Geo-spatial
  Datasets in Map-based Software Systems",ESEC/FSE 2019 - Industry track,,10.1145/3338906.3340454,,cs.DB,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Data is arguably the most valuable asset of the modern world. In this era,
the success of any data-intensive solution relies on the quality of data that
drives it. Among vast amount of data that are captured, managed, and analyzed
everyday, geospatial data are one of the most interesting class of data that
hold geographical information of real-world phenomena and can be visualized as
digital maps. Geo-spatial data is the source of many enterprise solutions that
provide local information and insights. In order to increase the quality of
such solutions, companies continuously aggregate geospatial datasets from
various sources. However, lack of a global standard model for geospatial
datasets makes the task of merging and integrating datasets difficult and
error-prone. Traditionally, domain experts manually validate the data
integration process by merging new data sources and/or new versions of previous
data against conflicts and other requirement violations. However, this approach
is not scalable and is hinder toward rapid release, when dealing with
frequently changing big datasets. Thus more automated approaches with limited
interaction with domain experts is required. As a first step to tackle this
problem, in this paper, we leverage Information Retrieval (IR) and geospatial
search techniques to propose a systematic and automated conflict identification
approach. To evaluate our approach, we conduct a case study in which we measure
the accuracy of our approach in several real-world scenarios and we interview
with software developers at Localintel Inc. (our industry partner) to get their
feedbacks.
","[{'version': 'v1', 'created': 'Thu, 13 Jun 2019 22:26:38 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Jun 2019 16:53:39 GMT'}]",2019-06-28,"[['Miryeganeh', 'Nima', ''], ['Amoui', 'Mehdi', ''], ['Hemmati', 'Hadi', '']]","['Spatial Data Integration (SDI)', 'Conflict detection and resolution', 'Continues Data Integration', 'Geospatial Datasets']"
12647,2012.06256,Ionut Anghel,"Tudor Cioara, Claudia Pop (Antal), Razvan Zanc, Ionut Anghel, Marcel
  Antal, Ioan Salomie",Smart Grid Management using Blockchain: Future Scenarios and Challenges,"Accepted and presented at: 19th RoEduNet Conference: Networking in
  Education and Research, December 11-12, 2020","2020 19th RoEduNet Conference: Networking in Education and
  Research (RoEduNet)",10.1109/RoEduNet51892.2020.9324874,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Decentralized management and coordination of energy systems are emerging
trends facilitated by the uptake of the Internet of Things and Blockchain
offering new opportunities for more secure, resilient, and efficient energy
distribution. Even though the use of distributed ledger technology in the
energy domain is promising, the development of decentralized smart grid
management solutions is in the early stages. In this paper, we define a layered
architecture of a blockchain-based smart grid management platform featuring
energy data metering and tamper-proof registration, business enforcement via
smart contracts, and Oracle-based integration of high computational services
supporting the implementation of future grid management scenarios. Three such
scenarios are discussed from the perspective of their implementation using the
proposed blockchain platform and associated challenges: peer to peer energy
trading, decentralized management, and aggregation of energy flexibility and
operation of community oriented Virtual Power Plants.
","[{'version': 'v1', 'created': 'Fri, 11 Dec 2020 11:44:52 GMT'}]",2021-01-26,"[['Cioara', 'Tudor', '', 'Antal'], ['Pop', 'Claudia', '', 'Antal'], ['Zanc', 'Razvan', ''], ['Anghel', 'Ionut', ''], ['Antal', 'Marcel', ''], ['Salomie', 'Ioan', '']]","['Smart Grid', 'Blockchain', 'Peer to Peer Energy']"
12648,1910.05552,Zekun Li,"Zekun Li, Zeyu Cui, Shu Wu, Xiaoyu Zhang, Liang Wang","Fi-GNN: Modeling Feature Interactions via Graph Neural Networks for CTR
  Prediction","10 pages, accepted by the 2019 Conference on Information and
  Knowledge Management (CIKM-2019)",,10.1145/3357384.3357951,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Click-through rate (CTR) prediction is an essential task in web applications
such as online advertising and recommender systems, whose features are usually
in multi-field form. The key of this task is to model feature interactions
among different feature fields. Recently proposed deep learning based models
follow a general paradigm: raw sparse input multi-filed features are first
mapped into dense field embedding vectors, and then simply concatenated
together to feed into deep neural networks (DNN) or other specifically designed
networks to learn high-order feature interactions. However, the simple
\emph{unstructured combination} of feature fields will inevitably limit the
capability to model sophisticated interactions among different fields in a
sufficiently flexible and explicit fashion.
  In this work, we propose to represent the multi-field features in a graph
structure intuitively, where each node corresponds to a feature field and
different fields can interact through edges. The task of modeling feature
interactions can be thus converted to modeling node interactions on the
corresponding graph. To this end, we design a novel model Feature Interaction
Graph Neural Networks (Fi-GNN). Taking advantage of the strong representative
power of graphs, our proposed model can not only model sophisticated feature
interactions in a flexible and explicit fashion, but also provide good model
explanations for CTR prediction. Experimental results on two real-world
datasets show its superiority over the state-of-the-arts.
","[{'version': 'v1', 'created': 'Sat, 12 Oct 2019 11:33:05 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Jul 2020 05:51:11 GMT'}]",2020-07-27,"[['Li', 'Zekun', ''], ['Cui', 'Zeyu', ''], ['Wu', 'Shu', ''], ['Zhang', 'Xiaoyu', ''], ['Wang', 'Liang', '']]","['Feature interactions', 'Graph neural networks', 'CTR prediction', 'Recommender system']"
12649,1411.0001,Abhijit Chandra,"Abhijit Chandra, Oliva Kar, Kuan-Chuen Wu, Michelle Hall and Jason
  Gillette","Prognosis of Anterior Cruciate Ligament (ACL) Reconstruction: A Data
  Driven Approach",arXiv admin note: substantial text overlap with arXiv:1410.8616,,10.1098/rspa.2014.0526,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Individuals who suffer anterior cruciate ligament (ACL) injury are at higher
risk of developing knee osteoarthritis (OA) and almost 50% display symptoms 10
to 20 years post injury. Anterior cruciate ligament reconstruction (ACLR) often
does not protect against knee OA development. Accordingly, a multiscale
formulation for Data Driven Prognosis (DDP) of post ACLR is developed. Unlike
traditional predictive strategies that require controlled off-line measurements
or training for determination of constitutive parameters to derive the
transitional statistics, the proposed DDP algorithm relies solely on in situ
measurements. The proposed DDP scheme is capable of predicting onset of
instabilities. Since the need for off line testing (or training) is obviated,
it can be easily implemented for ACLR, where such controlled a priori testing
is almost impossible to conduct. The DDP algorithm facilitates hierarchical
handling of the large data set, and can assess the state of recovery in post
ACLR conditions based on data collected from stair ascent and descent exercises
of subjects. The DDP algorithm identifies inefficient knee varus motion and
knee rotation as primary difficulties experienced by some of the post ACLR
population. In such cases, levels of energy dissipation rate at the knee, and
its fluctuation may be used as measures for assessing progress after ACL
reconstruction.
","[{'version': 'v1', 'created': 'Thu, 30 Oct 2014 22:54:07 GMT'}]",2015-08-19,"[['Chandra', 'Abhijit', ''], ['Kar', 'Oliva', ''], ['Wu', 'Kuan-Chuen', ''], ['Hall', 'Michelle', ''], ['Gillette', 'Jason', '']]","['ACL Reconstruction', 'data driven', 'prognosis', 'multi-scale', 'energy dissipation rate']"
12650,2005.10427,Peter Ahrens,"Suzanne Mueller, Peter Ahrens, Stephen Chou, Fredrik Kjolstad, Saman
  Amarasinghe",Sparse Tensor Transpositions,"This work will be the subject of a brief announcement at the 32nd ACM
  Symposium on Parallelism in Algorithms and Architectures (SPAA '20)",,10.1145/3350755.3400245,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new algorithm for transposing sparse tensors called Quesadilla.
The algorithm converts the sparse tensor data structure to a list of
coordinates and sorts it with a fast multi-pass radix algorithm that exploits
knowledge of the requested transposition and the tensors input partial
coordinate ordering to provably minimize the number of parallel partial sorting
passes. We evaluate both a serial and a parallel implementation of Quesadilla
on a set of 19 tensors from the FROSTT collection, a set of tensors taken from
scientific and data analytic applications. We compare Quesadilla and a
generalization, Top-2-sadilla to several state of the art approaches, including
the tensor transposition routine used in the SPLATT tensor factorization
library. In serial tests, Quesadilla was the best strategy for 60% of all
tensor and transposition combinations and improved over SPLATT by at least 19%
in half of the combinations. In parallel tests, at least one of Quesadilla or
Top-2-sadilla was the best strategy for 52% of all tensor and transposition
combinations.
","[{'version': 'v1', 'created': 'Thu, 21 May 2020 02:24:10 GMT'}]",2020-05-22,"[['Mueller', 'Suzanne', ''], ['Ahrens', 'Peter', ''], ['Chou', 'Stephen', ''], ['Kjolstad', 'Fredrik', ''], ['Amarasinghe', 'Saman', '']]","['Sparse Tensors', 'Transposition', 'Sorting', 'COO', 'Radix Sort']"
12651,2110.06013,Genaro J. Martinez,"Genaro J. Martinez, Andrew Adamatzky, Shigeru Ninagawa, Kenichi Morita",On Wave-Based Majority Gates with Cellular Automata,"18 pages, 12 figures, 2 tables.
  https://www.worldscientific.com/doi/abs/10.1142/9789811235740_0009","Handbook of Unconventional Computing, Volume 2: Implementations,
  chapter 9, pp. 271-288, (2021)",10.1142/9789811235740_0009,,cs.ET cs.DC nlin.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We demonstrate a discrete implementation of a wave-based majority gate in a
chaotic Life-like cellular automaton. The gate functions via controlling of
patterns' propagation into stationary channels. The gate presented is
realisable in many living and non-living substrates that show wave-like
activity of its space-time dynamics or pattern propagation. In the gate a
symmetric pattern represents a binary value 0 while a non-symmetric pattern
represents a binary value 1. Origination of the patterns and their symmetry
type are encoded by the particle reactions at the beginning of computation. The
patterns propagate in channels of the gate and compete for the space at the
intersection of the channels. We implement 3-inputs majority gates using a W
topology showing additional implementations of 5-inputs majority gates and one
tree (cascade) majority gate.
","[{'version': 'v1', 'created': 'Sat, 9 Oct 2021 18:47:10 GMT'}]",2021-10-13,"[['Martinez', 'Genaro J.', ''], ['Adamatzky', 'Andrew', ''], ['Ninagawa', 'Shigeru', ''], ['Morita', 'Kenichi', '']]","['majority gate', 'cellular automata', 'computation', 'wave propagation']"
12652,2007.06892,Jose Gracia,Huan Zhou and Jose Gracia and Ralf Schneider,"MPI Collectives for Multi-core Clusters: Optimized Performance of the
  Hybrid MPI+MPI Parallel Codes",10 pages. Accepted for publication in ICPP Workshops 2019,ICPP Workshops 2019: 18:1-18:10,10.1145/3339186.3339199,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The advent of multi-/many-core processors in clusters advocates hybrid
parallel programming, which combines Message Passing Interface (MPI) for
inter-node parallelism with a shared memory model for on-node parallelism.
Compared to the traditional hybrid approach of MPI plus OpenMP, a new, but
promising hybrid approach of MPI plus MPI-3 shared-memory extensions (MPI+MPI)
is gaining attraction. We describe an algorithmic approach for collective
operations (with allgather and broadcast as concrete examples) in the context
of hybrid MPI+MPI, so as to minimize memory consumption and memory copies. With
this approach, only one memory copy is maintained and shared by on-node
processes. This allows the removal of unnecessary on-node copies of replicated
data that are required between MPI processes when the collectives are invoked
in the context of pure MPI. We compare our approach of collectives for hybrid
MPI+MPI and the traditional one for pure MPI, and also have a discussion on the
synchronization that is required to guarantee data integrity. The performance
of our approach has been validated on a Cray XC40 system (Cray MPI) and NEC
cluster (OpenMPI), showing that it achieves comparable or better performance
for allgather operations. We have further validated our approach with a
standard computational kernel, namely distributed matrix multiplication, and a
Bayesian Probabilistic Matrix Factorization code.
","[{'version': 'v1', 'created': 'Tue, 14 Jul 2020 08:03:27 GMT'}]",2020-07-15,"[['Zhou', 'Huan', ''], ['Gracia', 'Jose', ''], ['Schneider', 'Ralf', '']]","['MPI', 'MPI shared memory model', 'collective communication', 'hybridprogramming']"
12653,cs/0505048,David Eppstein,"David Eppstein, Michael T. Goodrich, and Daniel S. Hirschberg","Improved Combinatorial Group Testing Algorithms for Real-World Problem
  Sizes","18 pages; an abbreviated version of this paper is to appear at the
  9th Worksh. Algorithms and Data Structures","SIAM J. Computing 36(5):1360-1375, 2007",10.1137/050631847,,cs.DS,,"  We study practically efficient methods for performing combinatorial group
testing. We present efficient non-adaptive and two-stage combinatorial group
testing algorithms, which identify the at most d items out of a given set of n
items that are defective, using fewer tests for all practical set sizes. For
example, our two-stage algorithm matches the information theoretic lower bound
for the number of tests in a combinatorial group testing regimen.
","[{'version': 'v1', 'created': 'Wed, 18 May 2005 20:25:16 GMT'}]",2011-11-09,"[['Eppstein', 'David', ''], ['Goodrich', 'Michael T.', ''], ['Hirschberg', 'Daniel S.', '']]","['combinatorial group testing', 'Chinese remaindering', 'Bloom filters']"
12654,1809.04059,Vaibhav Rastogi,"Jinman Zhao, Aws Albarghouthi, Vaibhav Rastogi, Somesh Jha, Damien
  Octeau",Neural-Augmented Static Analysis of Android Communication,"Appears in Proceedings of the 2018 ACM Joint European Software
  Engineering Conference and Symposium on the Foundations of Software
  Engineering (ESEC/FSE)",,10.1145/3236024.3236066,,cs.PL cs.LG cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the problem of discovering communication links between
applications in the popular Android mobile operating system, an important
problem for security and privacy in Android. Any scalable static analysis in
this complex setting is bound to produce an excessive amount of
false-positives, rendering it impractical. To improve precision, we propose to
augment static analysis with a trained neural-network model that estimates the
probability that a communication link truly exists. We describe a
neural-network architecture that encodes abstractions of communicating objects
in two applications and estimates the probability with which a link indeed
exists. At the heart of our architecture are type-directed encoders (TDE), a
general framework for elegantly constructing encoders of a compound data type
by recursively composing encoders for its constituent types. We evaluate our
approach on a large corpus of Android applications, and demonstrate that it
achieves very high accuracy. Further, we conduct thorough interpretability
studies to understand the internals of the learned neural networks.
","[{'version': 'v1', 'created': 'Tue, 11 Sep 2018 17:50:47 GMT'}]",2018-09-12,"[['Zhao', 'Jinman', ''], ['Albarghouthi', 'Aws', ''], ['Rastogi', 'Vaibhav', ''], ['Jha', 'Somesh', ''], ['Octeau', 'Damien', '']]","['Neural networks', 'Type-directed encoders', 'Android', 'Inter-componentcommunication']"
12655,2103.09639,Reza Fotohi,"Shahram Jamali, Mir Mahmoud Talebi, Reza Fotohi","Congestion control in high-speed networks using the probabilistic
  estimation approach","19 pages, 14 Figures, 2 Tables, Int J Commun Syst",Int J Commun Syst. 2021;e4766,10.1002/dac.4766,,cs.NI cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Nowadays, the bulk of Internet traffic uses TCP protocol for reliable
transmission. But the standard TCP's performance is very poor in High Speed
Networks (HSN) and hence the core gigabytes links are usually underutilization.
This problem has roots in conservative nature of TCP, especially in its
Additive Increase Multiplicative Decrease (AIMD) phase. In other words, since
TCP can't figure out precisely the congestion status of the network, it follows
a conservative strategy to keep the network from overwhelming. We believe that
precisely congestion estimation in the network can solve this problem by
avoiding unnecessary conservation. To this end, this paper proposes an
algorithm which considers packet loss and delay information jointly and employs
a probabilistic approach to accurately estimation of congestion status in the
network. To examine the proposed scheme performance, extensive simulations have
been performed in the NS-2 environment. Simulation results reveal that the
proposed algorithm has better performance than existing algorithms in terms of
bottleneck utilization, stability, throughput and fairness.
","[{'version': 'v1', 'created': 'Tue, 9 Mar 2021 20:18:20 GMT'}]",2021-03-18,"[['Jamali', 'Shahram', ''], ['Talebi', 'Mir Mahmoud', ''], ['Fotohi', 'Reza', '']]","['High-speed Networks (HSN)', 'Probabilistic', 'Estimation', 'Bayes theorem', 'Congestion Control']"
12656,1810.05444,Veronika Cheplygina,Veronika Cheplygina,"Cats or CAT scans: transfer learning from natural or medical image
  source datasets?",Accepted to Current Opinion in Biomedical Engineering,,10.1016/j.cobme.2018.12.005,,cs.CV cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transfer learning is a widely used strategy in medical image analysis.
Instead of only training a network with a limited amount of data from the
target task of interest, we can first train the network with other, potentially
larger source datasets, creating a more robust model. The source datasets do
not have to be related to the target task. For a classification task in lung CT
images, we could use both head CT images, or images of cats, as the source.
While head CT images appear more similar to lung CT images, the number and
diversity of cat images might lead to a better model overall. In this survey we
review a number of papers that have performed similar comparisons. Although the
answer to which strategy is best seems to be ""it depends"", we discuss a number
of research directions we need to take as a community, to gain more
understanding of this topic.
","[{'version': 'v1', 'created': 'Fri, 12 Oct 2018 10:35:21 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Jan 2019 08:45:08 GMT'}]",2019-01-11,"[['Cheplygina', 'Veronika', '']]","['medical imaging', 'deep learning', 'transfer learning']"
12657,2107.14107,Omer Aydin,Omer Aydin,Analysis of the Visitor Data of a Higher Education Institution Website,"in Turkish language, Traffic analysis, Visitor analysis, Website
  analysis, Corporate website, Trafik analizi, Ziyaretci analizi, Web sitesi
  analizi, Kurumsal web sitesi","Yuksekogretim ve Bilim Dergisi, (2) , 299-309",10.5961/jhes.2020.391,,cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In todays world, the internet affects every aspect of human life; it has
caused changes in corporate websites as well as in many other areas. Corporate
websites should be more dynamic, more interactive, and more compatible with new
technologies. The interaction of the website with users, search engines, and
other devices has to be examined by experts, and improvements and changes
should be made for this interaction. In this study, a higher education
institution website was examined. Visitor data collected between 2013 and 2019
were used for the analysis. In the study, which includes a wide range of
examinations and data, important findings from traffic analysis to development
suggestions were included. In particular, useful information has been obtained
through the compatibility of the site with mobile devices, optimization of
pictures and videos, geographical features of users, language options, and
density analysis of the content accessed over time.
","[{'version': 'v1', 'created': 'Sat, 10 Jul 2021 21:54:42 GMT'}]",2021-07-30,"[['Aydin', 'Omer', '']]","['Traffic analysis', 'Visitor analysis', 'Website analysis', 'Corporate website']"
12658,2210.04441,Suayb Arslan,Osman B. Guney and Suayb S. Arslan,Fault-Tolerant Strassen-Like Matrix Multiplication,"6 pages, 2 figures",,10.1109/SIU49456.2020.9302383,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, we propose a simple method for fault-tolerant Strassen-like
matrix multiplications. The proposed method is based on using two distinct
Strassen-like algorithms instead of replicating a given one. We have realized
that using two different algorithms, new check relations arise resulting in
more local computations. These local computations are found using computer
aided search. To improve performance, special parity (extra) sub-matrix
multiplications (PSMMs) are generated (two of them) at the expense of
increasing communication/computation cost of the system. Our preliminary
results demonstrate that the proposed method outperforms a Strassen-like
algorithm with two copies and secures a very close performance to three copy
version using only 2 PSMMs, reducing the total number of compute nodes by
around 24\% i.e., from 21 to 16.
","[{'version': 'v1', 'created': 'Mon, 10 Oct 2022 05:18:22 GMT'}]",2022-10-11,"[['Guney', 'Osman B.', ''], ['Arslan', 'Suayb S.', '']]","['Strassen-Like Algorithms', 'Fault-Tolerant Computation', 'Coded Matrix Multiplication']"
12659,2006.05033,Seongbin Oh,"Seongbin Oh, Dongseok Kwon, Gyuho Yeom, Won-Mook Kang, Soochang Lee,
  Sung Yun Woo, Jang Saeng Kim, Min Kyu Park and Jong-Ho Lee","Hardware Implementation of Spiking Neural Networks Using
  Time-To-First-Spike Encoding",,,10.1109/ACCESS.2022.3149577,,cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Hardware-based spiking neural networks (SNNs) are regarded as promising
candidates for the cognitive computing system due to low power consumption and
highly parallel operation. In this work, we train the SNN in which the firing
time carries information using temporal backpropagation. The temporally encoded
SNN with 512 hidden neurons showed an accuracy of 96.90% for the MNIST test
set. Furthermore, the effect of the device variation on the accuracy in
temporally encoded SNN is investigated and compared with that of the
rate-encoded network. In a hardware configuration of our SNN, NOR-type analog
memory having an asymmetric floating gate is used as a synaptic device. In
addition, we propose a neuron circuit including a refractory period generator
for temporally encoded SNN. The performance of the 2-layer neural network
consisting of synapses and proposed neurons is evaluated through circuit
simulation using SPICE. The network with 128 hidden neurons showed an accuracy
of 94.9%, a 0.1% reduction compared to that of the system simulation of the
MNIST dataset. Finally, the latency and power consumption of each block
constituting the temporal network is analyzed and compared with those of the
rate-encoded network depending on the total time step. Assuming that the total
time step number of the network is 256, the temporal network consumes 15.12
times lower power than the rate-encoded network and can make decisions 5.68
times faster.
","[{'version': 'v1', 'created': 'Tue, 9 Jun 2020 03:31:15 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Oct 2021 05:56:20 GMT'}]",2022-03-17,"[['Oh', 'Seongbin', ''], ['Kwon', 'Dongseok', ''], ['Yeom', 'Gyuho', ''], ['Kang', 'Won-Mook', ''], ['Lee', 'Soochang', ''], ['Woo', 'Sung Yun', ''], ['Kim', 'Jang Saeng', ''], ['Park', 'Min Kyu', ''], ['Lee', 'Jong-Ho', '']]","['Neuromorphic', 'Spiking Neural Networks (SNNs)', 'Hardware-based Neural Networks', 'Temporal Encoding', 'Time-to-First-Spike Encoding', 'Neuron Circuits']"
12660,2012.05373,Mohammad Rafayet Ali,"Mohammad Rafayet Ali, Taylor Myers, Ellen Wagner, Harshil Ratnu, E.
  Ray Dorsey, Ehsan Hoque","Facial expressions can detect Parkinson's disease: preliminary evidence
  from videos collected online",,npj Digital Medicine 2021,10.1038/s41746-021-00502-8,,cs.HC cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the symptoms of Parkinson's disease (PD) is hypomimia or reduced
facial expressions. In this paper, we present a digital biomarker for PD that
utilizes the study of micro-expressions. We analyzed the facial action units
(AU) from 1812 videos of 604 individuals (61 with PD and 543 without PD, mean
age 63.9 yo, sd 7.8 ) collected online using a web-based tool
(www.parktest.net). In these videos, participants were asked to make three
facial expressions (a smiling, disgusted, and surprised face) followed by a
neutral face. Using techniques from computer vision and machine learning, we
objectively measured the variance of the facial muscle movements and used it to
distinguish between individuals with and without PD. The prediction accuracy
using the facial micro-expressions was comparable to those methodologies that
utilize motor symptoms. Logistic regression analysis revealed that participants
with PD had less variance in AU6 (cheek raiser), AU12 (lip corner puller), and
AU4 (brow lowerer) than non-PD individuals. An automated classifier using
Support Vector Machine was trained on the variances and achieved 95.6%
accuracy. Using facial expressions as a biomarker for PD could be potentially
transformative for patients in need of physical separation (e.g., due to COVID)
or are immobile.
","[{'version': 'v1', 'created': 'Wed, 9 Dec 2020 23:53:32 GMT'}]",2021-09-06,"[['Ali', 'Mohammad Rafayet', ''], ['Myers', 'Taylor', ''], ['Wagner', 'Ellen', ''], ['Ratnu', 'Harshil', ''], ['Dorsey', 'E. Ray', ''], ['Hoque', 'Ehsan', '']]","['Parkinson’s disease', 'Facial expression', 'Action Units', 'Hypomimia']"
12661,2005.03090,Thanh Pham Dinh,"Huynh Thi Thanh Binh, Pham Dinh Thanh, Tran Ba Trung, Le Cong Thanh,
  Le Minh Hai Phong, Ananthram Swami, Bui Thu Lam","A Multifactorial Optimization Paradigm for Linkage Tree Genetic
  Algorithm",,InformationSciences. 540 (2020) 325-344,10.1016/j.ins.2020.05.132,INS_15553,cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Linkage Tree Genetic Algorithm (LTGA) is an effective Evolutionary Algorithm
(EA) to solve complex problems using the linkage information between problem
variables. LTGA performs well in various kinds of single-task optimization and
yields promising results in comparison with the canonical genetic algorithm.
However, LTGA is an unsuitable method for dealing with multi-task optimization
problems. On the other hand, Multifactorial Optimization (MFO) can
simultaneously solve independent optimization problems, which are encoded in a
unified representation to take advantage of the process of knowledge transfer.
In this paper, we introduce Multifactorial Linkage Tree Genetic Algorithm
(MF-LTGA) by combining the main features of both LTGA and MFO. MF-LTGA is able
to tackle multiple optimization tasks at the same time, each task learns the
dependency between problem variables from the shared representation. This
knowledge serves to determine the high-quality partial solutions for supporting
other tasks in exploring the search space. Moreover, MF-LTGA speeds up
convergence because of knowledge transfer of relevant problems. We demonstrate
the effectiveness of the proposed algorithm on two benchmark problems:
Clustered Shortest-Path Tree Problem and Deceptive Trap Function. In comparison
to LTGA and existing methods, MF-LTGA outperforms in quality of the solution or
in computation time.
","[{'version': 'v1', 'created': 'Wed, 6 May 2020 19:28:39 GMT'}]",2020-07-09,"[['Binh', 'Huynh Thi Thanh', ''], ['Thanh', 'Pham Dinh', ''], ['Trung', 'Tran Ba', ''], ['Thanh', 'Le Cong', ''], ['Phong', 'Le Minh Hai', ''], ['Swami', 'Ananthram', ''], ['Lam', 'Bui Thu', '']]","['Linkage Tree Genetic Algorithm', 'Multifactorial Optimization', 'Linkagemodels', 'Clustered Shortest-Path Tree Problem', 'Evolutionary Algorithm']"
12662,2009.06077,Paul-Olivier Dehaye,Paul-Olivier Dehaye and Joel Reardon,Proximity Tracing in an Ecosystem of Surveillance Capitalism,,"19th Workshop on Privacy in the Electronic Society, WPES 2020",10.1145/3411497.3420219,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Proximity tracing apps have been proposed as an aide in dealing with the
COVID-19 crisis. Some of those apps leverage attenuation of Bluetooth beacons
from mobile devices to build a record of proximate encounters between a pair of
device owners. The underlying protocols are known to suffer from false positive
and re-identification attacks. We present evidence that the attacker's
difficulty in mounting such attacks has been overestimated. Indeed, an attacker
leveraging a moderately successful app or SDK with Bluetooth and location
access can eavesdrop and interfere with these proximity tracing systems at no
hardware cost and perform these attacks against users who do not have this app
or SDK installed. We describe concrete examples of actors who would be in a
good position to execute such attacks. We further present a novel attack, which
we call a biosurveillance attack, which allows the attacker to monitor the
exposure risk of a smartphone user who installs their app or SDK but who does
not use any contact tracing system and may falsely believe that they have opted
out of the system.
  Through traffic auditing with an instrumented testbed, we characterize
precisely the behaviour of one such SDK that we found in a handful of
apps---but installed on more than one hundred million mobile devices. Its
behaviour is functionally indistinguishable from a re-identification or
biosurveillance attack and capable of executing a false positive attack with
minimal effort. We also discuss how easily an attacker could acquire a position
conducive to such attacks, by leveraging the lax logic for granting permissions
to apps in the Android framework: any app with some geolocation permission
could acquire the necessary Bluetooth permission through an upgrade, without
any additional user prompt. Finally we discuss motives for conducting such
attacks.
","[{'version': 'v1', 'created': 'Sun, 13 Sep 2020 20:06:30 GMT'}]",2020-09-15,"[['Dehaye', 'Paul-Olivier', ''], ['Reardon', 'Joel', '']]","['proximity tracing', 'privacy', 'mobile phones']"
12663,1906.09445,Hadrien Van Lierde,Hadrien Van Lierde and Tommy W. S. Chow,"Learning with fuzzy hypergraphs: a topical approach to query-oriented
  text summarization",8 figures,"Information Sciences, 496 (2019), 212-224",10.1016/j.ins.2019.05.020,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing graph-based methods for extractive document summarization represent
sentences of a corpus as the nodes of a graph or a hypergraph in which edges
depict relationships of lexical similarity between sentences. Such approaches
fail to capture semantic similarities between sentences when they express a
similar information but have few words in common and are thus lexically
dissimilar. To overcome this issue, we propose to extract semantic similarities
based on topical representations of sentences. Inspired by the Hierarchical
Dirichlet Process, we propose a probabilistic topic model in order to infer
topic distributions of sentences. As each topic defines a semantic connection
among a group of sentences with a certain degree of membership for each
sentence, we propose a fuzzy hypergraph model in which nodes are sentences and
fuzzy hyperedges are topics. To produce an informative summary, we extract a
set of sentences from the corpus by simultaneously maximizing their relevance
to a user-defined query, their centrality in the fuzzy hypergraph and their
coverage of topics present in the corpus. We formulate a polynomial time
algorithm building on the theory of submodular functions to solve the
associated optimization problem. A thorough comparative analysis with other
graph-based summarization systems is included in the paper. Our obtained
results show the superiority of our method in terms of content coverage of the
summaries.
","[{'version': 'v1', 'created': 'Sat, 22 Jun 2019 13:28:32 GMT'}]",2019-06-25,"[['Van Lierde', 'Hadrien', ''], ['Chow', 'Tommy W. S.', '']]","['Automatic Text Summarization', 'Fuzzy Graphs', 'Probabilistic Topic Models', 'Hierarchical Dirichlet Process', 'PersonalizedPageRank', 'Submodular Set Functions']"
12664,2203.05778,Guanhua Wang,"Guanhua Wang, Wuli Zuo, Mingyu Guo",Redistribution in Public Project Problems via Neural Networks,,"International Conference on Web Intelligence and Intelligent Agent
  Technology(WI-IAT 2021)",10.1145/3486622.3493922,,cs.GT,http://creativecommons.org/licenses/by/4.0/,"  Many important problems in multiagent systems involve resource allocations.
Self-interested agents may lie about their valuations if doing so increases
their own utilities. Therefore, it is necessary to design mechanisms
(collective decision-making rules) with desired properties and objectives. The
VCG redistribution mechanisms are efficient (the agents who value the resources
the most will be allocated), strategy-proof (the agents have no incentives to
lie about their valuations), and weakly budget-balanced (no deficits).
  We focus on the VCG redistribution mechanisms for the classic public project
problem, where a group of agents needs to decide whether or not to build a
non-excludable public project. We design mechanisms via neural networks with
two welfare-maximizing objectives: optimal in the worst case and optimal in
expectation. Previous studies showed two worst-case optimal mechanisms for 3
agents, but worst-case optimal mechanisms have not been identified for more
than 3 agents. For maximizing expected welfare, there are no existing results.
  We use neural networks to design VCG redistribution mechanisms. Neural
networks have been used to design the redistribution mechanisms for multi-unit
auctions with unit demand. We show that for the public project problem, the
previously proposed neural networks, which led to optimal/near-optimal
mechanisms for multi-unit auctions with unit demand, perform abysmally for the
public project problem. We significantly improve the existing networks on
multiple fronts: We conduct a GAN network to generate worst-case type profiles
and feed prior distribution into loss function to provide quality gradients for
the optimal-in-expectation objective......
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2022 07:23:34 GMT'}]",2022-03-14,"[['Wang', 'Guanhua', ''], ['Zuo', 'Wuli', ''], ['Guo', 'Mingyu', '']]","['public project', 'VCG redistribution mechanism', 'neural networks', 'GAN', 'dimension reduction']"
12665,1802.04127,"Arif G\""ursoy","Necla Kircali Gursoy, Ibrahim Senturk, Tahsin Oner, Arif Gursoy","A New Algorithmic Decision for Categorical Syllogisms via Caroll's
  Diagrams",,,10.1007/s00500-019-04598-9,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we deal with a calculus system SLCD (Syllogistic Logic with
Carroll Diagrams), which gives a formal approach to logical reasoning with
diagrams, for representations of the fundamental Aristotelian categorical
propositions and show that they are closed under the syllogistic criterion of
inference which is the deletion of middle term. Therefore, it is implemented to
let the formalism comprise synchronically bilateral and trilateral
diagrammatical appearance and a naive algorithmic nature. And also, there is no
need specific knowledge or exclusive ability to understand as well as to use
it. Consequently, we give an effective algorithm used to determine whether a
syllogistic reasoning valid or not by using SLCD.
","[{'version': 'v1', 'created': 'Thu, 8 Feb 2018 11:29:59 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Feb 2018 11:17:01 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Mar 2018 06:25:46 GMT'}, {'version': 'v4', 'created': 'Thu, 28 Jan 2021 09:36:37 GMT'}]",2021-01-29,"[['Gursoy', 'Necla Kircali', ''], ['Senturk', 'Ibrahim', ''], ['Oner', 'Tahsin', ''], ['Gursoy', 'Arif', '']]","['categorical syllogism', 'validity', 'algorithm']"
12666,1912.12431,Hong Wu,"Fiseha B. Tesema, Hong Wu, Mingjian Chen, Junpeng Lin, William Zhu,
  Kaizhu Huang",Hybrid Channel Based Pedestrian Detection,"9 pages, 4 figures, Submitted to Neurocomputing, The 5th line of
  table 3 was accidentally mistaken. The data have been corrected and the
  related descriptions in section 4.4 have also be revised accordingly. Typos
  corrected, references corrected","Neurocomputing, 389(5), 2020, 1-8",10.1016/j.neucom.2019.12.110,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pedestrian detection has achieved great improvements with the help of
Convolutional Neural Networks (CNNs). CNN can learn high-level features from
input images, but the insufficient spatial resolution of CNN feature channels
(feature maps) may cause a loss of information, which is harmful especially to
small instances. In this paper, we propose a new pedestrian detection
framework, which extends the successful RPN+BF framework to combine handcrafted
features and CNN features. RoI-pooling is used to extract features from both
handcrafted channels (e.g. HOG+LUV, CheckerBoards or RotatedFilters) and CNN
channels. Since handcrafted channels always have higher spatial resolution than
CNN channels, we apply RoI-pooling with larger output resolution to handcrafted
channels to keep more detailed information. Our ablation experiments show that
the developed handcrafted features can reach better detection accuracy than the
CNN features extracted from the VGG-16 net, and a performance gain can be
achieved by combining them. Experimental results on Caltech pedestrian dataset
with the original annotations and the improved annotations demonstrate the
effectiveness of the proposed approach. When using a more advanced RPN in our
framework, our approach can be further improved and get competitive results on
both benchmarks.
","[{'version': 'v1', 'created': 'Sat, 28 Dec 2019 09:55:35 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Jan 2020 04:20:34 GMT'}]",2020-04-30,"[['Tesema', 'Fiseha B.', ''], ['Wu', 'Hong', ''], ['Chen', 'Mingjian', ''], ['Lin', 'Junpeng', ''], ['Zhu', 'William', ''], ['Huang', 'Kaizhu', '']]","['Pedestrian detection', 'Handcrafted features channels', 'CNN feature channels', 'RoI-pooling', 'Feature combination']"
12667,1802.04431,Kyle Hundman,"Kyle Hundman, Valentino Constantinou, Christopher Laporte, Ian
  Colwell, Tom Soderstrom","Detecting Spacecraft Anomalies Using LSTMs and Nonparametric Dynamic
  Thresholding",KDD 2018 camera-ready version,,10.1145/3219819.3219845,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As spacecraft send back increasing amounts of telemetry data, improved
anomaly detection systems are needed to lessen the monitoring burden placed on
operations engineers and reduce operational risk. Current spacecraft monitoring
systems only target a subset of anomaly types and often require costly expert
knowledge to develop and maintain due to challenges involving scale and
complexity. We demonstrate the effectiveness of Long Short-Term Memory (LSTMs)
networks, a type of Recurrent Neural Network (RNN), in overcoming these issues
using expert-labeled telemetry anomaly data from the Soil Moisture Active
Passive (SMAP) satellite and the Mars Science Laboratory (MSL) rover,
Curiosity. We also propose a complementary unsupervised and nonparametric
anomaly thresholding approach developed during a pilot implementation of an
anomaly detection system for SMAP, and offer false positive mitigation
strategies along with other key improvements and lessons learned during
development.
","[{'version': 'v1', 'created': 'Tue, 13 Feb 2018 02:09:32 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Feb 2018 01:52:08 GMT'}, {'version': 'v3', 'created': 'Wed, 6 Jun 2018 20:39:29 GMT'}]",2018-06-08,"[['Hundman', 'Kyle', ''], ['Constantinou', 'Valentino', ''], ['Laporte', 'Christopher', ''], ['Colwell', 'Ian', ''], ['Soderstrom', 'Tom', '']]","['Anomaly detection', 'Neural networks', 'RNNs', 'LSTMs', 'Aerospace', 'Time-series', 'Forecasting']"
12668,2012.14156,Ugur Erkan,"U\u{g}ur Erkan, Abdurrahim Toktas, Serdar Engino\u{g}lu, Enver
  Karabacak, Dang N. H. Thanh","An Image Encryption Scheme Based on Chaotic Logarithmic Map and Key
  Generation using Deep CNN",,"Multimedia Tools and Applications, 2022",10.1007/s11042-021-11803-1,,cs.IT cs.CR eess.IV math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A secure and reliable image encryption scheme is presented in this study. The
encryption scheme hereby introduces a novel chaotic log-map, deep convolution
neural network (CNN) model for key generation, and bit reversion operation for
the manipulation process. Thanks to the sensitive key generation, initial
values and control parameters are produced for the hyperchaotic log-map, and
thus a diverse chaotic sequence is achieved for encrypting operations. The
scheme then encrypts the images by scrambling and manipulating the pixels of
images through four operations: permutation, DNA encoding, diffusion, and bit
reversion. The encryption scheme is precisely examined for the well-known
images in terms of various analyses such as keyspace, key sensitivity,
information entropy, histogram, correlation, differential attack, noisy attack,
and cropping attack. To corroborate the scheme, the visual and numerical
results are even compared with available outcomes of the state of the art.
Therefore, the proposed log-map based image encryption scheme is successfully
verified and validated by the superior absolute and comparative results.
","[{'version': 'v1', 'created': 'Mon, 28 Dec 2020 09:20:31 GMT'}]",2022-02-01,"[['Erkan', 'Uğur', ''], ['Toktas', 'Abdurrahim', ''], ['Enginoğlu', 'Serdar', ''], ['Karabacak', 'Enver', ''], ['Thanh', 'Dang N. H.', '']]","['Image encryption', 'chaotic map', 'logarithmic map', 'deep convolution neural network (CNN)', 'bit reversion']"
12669,2103.00436,Jin Chen,"Jin Chen, Ju Xu, Gangwei Jiang, Tiezheng Ge, Zhiqiang Zhang, Defu
  Lian, Kai Zheng",Automated Creative Optimization for E-Commerce Advertising,"10 pages, 5 figures, the Web Conference 2021",,10.1145/3442381.3449909,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advertising creatives are ubiquitous in E-commerce advertisements and
aesthetic creatives may improve the click-through rate (CTR) of the products.
Nowadays smart advertisement platforms provide the function of compositing
creatives based on source materials provided by advertisers. Since a great
number of creatives can be generated, it is difficult to accurately predict
their CTR given a limited amount of feedback. Factorization machine (FM), which
models inner product interaction between features, can be applied for the CTR
prediction of creatives. However, interactions between creative elements may be
more complex than the inner product, and the FM-estimated CTR may be of high
variance due to limited feedback. To address these two issues, we propose an
Automated Creative Optimization (AutoCO) framework to model complex interaction
between creative elements and to balance between exploration and exploitation.
Specifically, motivated by AutoML, we propose one-shot search algorithms for
searching effective interaction functions between elements. We then develop
stochastic variational inference to estimate the posterior distribution of
parameters based on the reparameterization trick, and apply Thompson Sampling
for efficiently exploring potentially better creatives. We evaluate the
proposed method with both a synthetic dataset and two public datasets. The
experimental results show our method can outperform competing baselines with
respect to cumulative regret. The online A/B test shows our method leads to a 7
increase in CTR compared to the baseline.
","[{'version': 'v1', 'created': 'Sun, 28 Feb 2021 09:39:24 GMT'}]",2021-03-02,"[['Chen', 'Jin', ''], ['Xu', 'Ju', ''], ['Jiang', 'Gangwei', ''], ['Ge', 'Tiezheng', ''], ['Zhang', 'Zhiqiang', ''], ['Lian', 'Defu', ''], ['Zheng', 'Kai', '']]","['Advertising Creatives', 'Exploration and Exploitation', 'AutoML', 'Thompson Sampling', 'Variational Bayesian']"
12670,1809.06253,Leonardo Gutierrez,"Leonardo Gutierrez Gomez, Jean-Charles Delvenne",Multi-hop assortativities for networks classification,"20 pages, 7 figures. arXiv admin note: text overlap with
  arXiv:1705.10817",,10.1093/comnet/cny034,,cs.LG cs.SI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several social, medical, engineering and biological challenges rely on
discovering the functionality of networks from their structure and node
metadata, when it is available. For example, in chemoinformatics one might want
to detect whether a molecule is toxic based on structure and atomic types, or
discover the research field of a scientific collaboration network. Existing
techniques rely on counting or measuring structural patterns that are known to
show large variations from network to network, such as the number of triangles,
or the assortativity of node metadata. We introduce the concept of multi-hop
assortativity, that captures the similarity of the nodes situated at the
extremities of a randomly selected path of a given length. We show that
multi-hop assortativity unifies various existing concepts and offers a
versatile family of 'fingerprints' to characterize networks. These fingerprints
allow in turn to recover the functionalities of a network, with the help of the
machine learning toolbox. Our method is evaluated empirically on established
social and chemoinformatic network benchmarks. Results reveal that our
assortativity based features are competitive providing highly accurate results
often outperforming state of the art methods for the network classification
task.
","[{'version': 'v1', 'created': 'Fri, 14 Sep 2018 13:33:35 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Nov 2018 09:28:51 GMT'}]",2018-11-26,"[['Gomez', 'Leonardo Gutierrez', ''], ['Delvenne', 'Jean-Charles', '']]","['network classification', 'multi-hop assortativities', 'graph classification']"
12671,1810.04735,Jack Collins,"Jack Collins, Wade Geles, David Howard, Frederic Maire",Towards the Targeted Environment-Specific Evolution of Robot Components,"8 pages appearing in the 2018 Genetic and Evolutionary Computation
  Conference Proceedings",,10.1145/3205455.3205541,,cs.RO cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This research considers the task of evolving the physical structure of a
robot to enhance its performance in various environments, which is a
significant problem in the field of Evolutionary Robotics. Inspired by the
fields of evolutionary art and sculpture, we evolve only targeted parts of a
robot, which simplifies the optimisation problem compared to traditional
approaches that must simultaneously evolve both (actuated) body and brain.
Exploration fidelity is emphasised in areas of the robot most likely to benefit
from shape optimisation, whilst exploiting existing robot structure and
control. Our approach uses a Genetic Algorithm to optimise collections of
Bezier splines that together define the shape of a legged robot's tibia, and
leg performance is evaluated in parallel in a high-fidelity simulator. The leg
is represented in the simulator as 3D-printable file, and as such can be
readily instantiated in reality. Provisional experiments in three distinct
environments show the evolution of environment-specific leg structures that are
both high-performing and notably different to those evolved in the other
environments. This proof-of-concept represents an important step towards the
environment-dependent optimisation of performance-critical components for a
range of ubiquitous, standard, and already-capable robots that can carry out a
wide variety of tasks.
","[{'version': 'v1', 'created': 'Thu, 11 Oct 2018 03:02:07 GMT'}]",2018-10-12,"[['Collins', 'Jack', ''], ['Geles', 'Wade', ''], ['Howard', 'David', ''], ['Maire', 'Frederic', '']]","['Evolutionary Robotics', 'Simulation', 'Parallelization', 'Genetic Algorithm', 'Bezier Spline', 'Environmental Adaptation']"
12672,2006.03642,Nitinraj Nair Mr.,"Nitinraj Nair, Rakshit Kothari, Aayush K. Chaudhary, Zhizhuo Yang,
  Gabriel J. Diaz, Jeff B. Pelz, Reynold J. Bailey",RIT-Eyes: Rendering of near-eye images for eye-tracking applications,,,10.1145/3385955.3407935,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks for video-based eye tracking have demonstrated
resilience to noisy environments, stray reflections, and low resolution.
However, to train these networks, a large number of manually annotated images
are required. To alleviate the cumbersome process of manual labeling, computer
graphics rendering is employed to automatically generate a large corpus of
annotated eye images under various conditions. In this work, we introduce a
synthetic eye image generation platform that improves upon previous work by
adding features such as an active deformable iris, an aspherical cornea,
retinal retro-reflection, gaze-coordinated eye-lid deformations, and blinks. To
demonstrate the utility of our platform, we render images reflecting the
represented gaze distributions inherent in two publicly available datasets,
NVGaze and OpenEDS. We also report on the performance of two semantic
segmentation architectures (SegNet and RITnet) trained on rendered images and
tested on the original datasets.
","[{'version': 'v1', 'created': 'Fri, 5 Jun 2020 19:18:50 GMT'}]",2020-12-22,"[['Nair', 'Nitinraj', ''], ['Kothari', 'Rakshit', ''], ['Chaudhary', 'Aayush K.', ''], ['Yang', 'Zhizhuo', ''], ['Diaz', 'Gabriel J.', ''], ['Pelz', 'Jeff B.', ''], ['Bailey', 'Reynold J.', '']]","['eye-tracking', 'synthetic datasets', 'semantic segmentation', 'neuralnetworks']"
12673,2208.02644,Ahmad Naghavi,"Ahmad Naghavi, Mohammad Sadegh Fazel, Mojtaba Beheshti and Ehsan
  Yazdian","A Sequential MUSIC algorithm for Scatterers Detection 2 in SAR
  Tomography Enhanced by a Robust Covariance 3 Estimator",,,10.1016/j.dsp.2022.103621,,cs.IT eess.SP math.IT,http://creativecommons.org/licenses/by/4.0/,"  Synthetic aperture radar (SAR) tomography (TomoSAR) is an appealing tool for
the extraction of height information of urban infrastructures. Due to the
widespread applications of the MUSIC algorithm in source localization, it is a
suitable solution in TomoSAR when multiple snapshots (looks) are available.
While the classical MUSIC algorithm aims to estimate the whole reflectivity
profile of scatterers, sequential MUSIC algorithms are suited for the detection
of sparse point-like scatterers. In this class of methods, successive
cancellation is performed through orthogonal complement projections on the
MUSIC power spectrum. In this work, a new sequential MUSIC algorithm named
recursive covariance canceled MUSIC (RCC-MUSIC), is proposed. This method
brings higher accuracy in comparison with the previous sequential methods at
the cost of a negligible increase in computational cost. Furthermore, to
improve the performance of RCC-MUSIC, it is combined with the recent method of
covariance matrix estimation called correlation subspace. Utilizing the
correlation subspace method results in a denoised covariance matrix which in
turn, increases the accuracy of subspace-based methods. Several numerical
examples are presented to compare the performance of the proposed method with
the relevant state-of-the-art methods. As a subspace method, simulation results
demonstrate the efficiency of the proposed method in terms of estimation
accuracy and computational load.
","[{'version': 'v1', 'created': 'Thu, 4 Aug 2022 13:22:49 GMT'}]",2022-08-05,"[['Naghavi', 'Ahmad', ''], ['Fazel', 'Mohammad Sadegh', ''], ['Beheshti', 'Mojtaba', ''], ['Yazdian', 'Ehsan', '']]","['Synthetic aperture radar tomography (TomoSAR)', 'scatterersdetection', 'Sequential MUSIC algorithm', 'covariance matrix estimation']"
12674,2204.00145,Young-Ho Kim,"Young-Ho Kim, Diana Chou, Bongshin Lee, Margaret Danilovich, Amanda
  Lazar, David E. Conroy, Hernisa Kacorri, Eun Kyoung Choe","MyMove: Facilitating Older Adults to Collect In-Situ Activity Labels on
  a Smartwatch with Speech","To appear at ACM CHI 2022. 21 pages, 3 figures, 7 tables. For the NSF
  funded project, visit https://mymove-collective.github.io",,10.1145/3491102.3517457,,cs.HC cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Current activity tracking technologies are largely trained on younger adults'
data, which can lead to solutions that are not well-suited for older adults. To
build activity trackers for older adults, it is crucial to collect training
data with them. To this end, we examine the feasibility and challenges with
older adults in collecting activity labels by leveraging speech. Specifically,
we built MyMove, a speech-based smartwatch app to facilitate the in-situ
labeling with a low capture burden. We conducted a 7-day deployment study,
where 13 older adults collected their activity labels and smartwatch sensor
data, while wearing a thigh-worn activity monitor. Participants were highly
engaged, capturing 1,224 verbal reports in total. We extracted 1,885 activities
with corresponding effort level and timespan, and examined the usefulness of
these reports as activity labels. We discuss the implications of our approach
and the collected dataset in supporting older adults through personalized
activity tracking technologies.
","[{'version': 'v1', 'created': 'Fri, 1 Apr 2022 00:37:58 GMT'}]",2022-04-04,"[['Kim', 'Young-Ho', ''], ['Chou', 'Diana', ''], ['Lee', 'Bongshin', ''], ['Danilovich', 'Margaret', ''], ['Lazar', 'Amanda', ''], ['Conroy', 'David E.', ''], ['Kacorri', 'Hernisa', ''], ['Choe', 'Eun Kyoung', '']]","['activity labeling', 'older adults', 'smartwatch', 'speech interaction', 'experience sampling method']"
12675,2105.00894,George De Ath,"George De Ath, Richard Everson and Jonathan Fieldsend",How Bayesian Should Bayesian Optimisation Be?,"To appear in the Proceedings of Genetic and Evolutionary Computation
  Conference Companion (GECCO 2021), ACM. 10 pages (main paper) + 26 pages
  (supplement)",,10.1145/3449726.3463164,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bayesian optimisation (BO) uses probabilistic surrogate models - usually
Gaussian processes (GPs) - for the optimisation of expensive black-box
functions. At each BO iteration, the GP hyperparameters are fit to
previously-evaluated data by maximising the marginal likelihood. However, this
fails to account for uncertainty in the hyperparameters themselves, leading to
overconfident model predictions. This uncertainty can be accounted for by
taking the Bayesian approach of marginalising out the model hyperparameters.
  We investigate whether a fully-Bayesian treatment of the Gaussian process
hyperparameters in BO (FBBO) leads to improved optimisation performance. Since
an analytic approach is intractable, we compare FBBO using three approximate
inference schemes to the maximum likelihood approach, using the Expected
Improvement (EI) and Upper Confidence Bound (UCB) acquisition functions paired
with ARD and isotropic Matern kernels, across 15 well-known benchmark problems
for 4 observational noise settings. FBBO using EI with an ARD kernel leads to
the best performance in the noise-free setting, with much less difference
between combinations of BO components when the noise is increased. FBBO leads
to over-exploration with UCB, but is not detrimental with EI. Therefore, we
recommend that FBBO using EI with an ARD kernel as the default choice for BO.
","[{'version': 'v1', 'created': 'Mon, 3 May 2021 14:28:11 GMT'}]",2021-05-04,"[['De Ath', 'George', ''], ['Everson', 'Richard', ''], ['Fieldsend', 'Jonathan', '']]","['Bayesian optimisation', 'Surrogate modelling', 'Gaussian process', 'Approximate inference']"
12676,2204.10165,"Ga\""el Poux-M\'edard","Ga\""el Poux-M\'edard, Julien Velcin, Sabine Loudcher",Interactions in Information Spread,,,10.1145/3487553.3524190,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Large quantities of data flow on the internet. When a user decides to help
the spread of a piece of information (by retweeting, liking, posting content),
most research works assumes she does so according to information's content,
publication date, the user's position in the network, the platform used, etc.
However, there is another aspect that has received little attention in the
literature: the information interaction. The idea is that a user's choice is
partly conditioned by the previous pieces of information she has been exposed
to. In this document, we review the works done on interaction modeling and
underline several aspects of interactions that complicate their study. Then, we
present an approach seemingly fit to answer those challenges and detail a
dedicated interaction model based on it. We show our approach fits the problem
better than existing methods, and present leads for future works. Throughout
the text, we show that taking interactions into account improves our
comprehension of information interaction processes in real-world datasets, and
argue that this aspect of information spread is should not be neglected when
modeling spreading processes.
","[{'version': 'v1', 'created': 'Thu, 21 Apr 2022 15:21:04 GMT'}]",2022-04-22,"[['Poux-Médard', 'Gaël', ''], ['Velcin', 'Julien', ''], ['Loudcher', 'Sabine', '']]","['Information', 'Interaction', 'Diffusion', 'MMSBM', 'Dirichlet-HawkesProcess']"
12677,2203.03827,Jinghui Cheng,"Mohammad Amin Mozaffari, Xinyuan Zhang, Jinghui Cheng, Jin L.C. Guo","GANSpiration: Balancing Targeted and Serendipitous Inspiration in User
  Interface Design with Style-Based Generative Adversarial Network","15 pages, 9 figures, CHI Conference on Human Factors in Computing
  Systems (CHI '22)",,10.1145/3491102.3517511,,cs.HC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Inspiration from design examples plays a crucial role in the creative process
of user interface design. However, current tools and techniques that support
inspiration usually only focus on example browsing with limited user control or
similarity-based example retrieval, leading to undesirable design outcomes such
as focus drift and design fixation. To address these issues, we propose the
GANSpiration approach that suggests design examples for both targeted and
serendipitous inspiration, leveraging a style-based Generative Adversarial
Network. A quantitative evaluation revealed that the outputs of
GANSpiration-based example suggestion approaches are relevant to the input
design, and at the same time include diverse instances. A user study with
professional UI/UX practitioners showed that the examples suggested by our
approach serve as viable sources of inspiration for overall design concepts and
specific design elements. Overall, our work paves the road of using advanced
generative machine learning techniques in supporting the creative design
practice.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2022 03:25:35 GMT'}]",2022-03-15,"[['Mozaffari', 'Mohammad Amin', ''], ['Zhang', 'Xinyuan', ''], ['Cheng', 'Jinghui', ''], ['Guo', 'Jin L. C.', '']]","['User interface design', 'inspiration', 'StyleGAN', 'creativity support']"
12678,1712.02820,Heri Ramampiaro,"Basant Agarwal, Heri Ramampiaro, Helge Langseth, Massimiliano Ruocco",A Deep Network Model for Paraphrase Detection in Short Text Messages,,"B Agarwal, H. Ramampiaro, H Langseth, M Ruocco, (2018), ""A Deep
  Network Model for Paraphrase Detection in Short Text Messages"". In
  Information Processing & Management Journal (IPM), 54(6), pp. 922-937.
  Elsevier",10.1016/j.ipm.2018.06.005,,cs.IR cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is concerned with paraphrase detection. The ability to detect
similar sentences written in natural language is crucial for several
applications, such as text mining, text summarization, plagiarism detection,
authorship authentication and question answering. Given two sentences, the
objective is to detect whether they are semantically identical. An important
insight from this work is that existing paraphrase systems perform well when
applied on clean texts, but they do not necessarily deliver good performance
against noisy texts. Challenges with paraphrase detection on user generated
short texts, such as Twitter, include language irregularity and noise. To cope
with these challenges, we propose a novel deep neural network-based approach
that relies on coarse-grained sentence modeling using a convolutional neural
network and a long short-term memory model, combined with a specific
fine-grained word-level similarity matching model. Our experimental results
show that the proposed approach outperforms existing state-of-the-art
approaches on user-generated noisy social media data, such as Twitter texts,
and achieves highly competitive performance on a cleaner corpus.
","[{'version': 'v1', 'created': 'Thu, 7 Dec 2017 19:10:45 GMT'}]",2018-07-18,"[['Agarwal', 'Basant', ''], ['Ramampiaro', 'Heri', ''], ['Langseth', 'Helge', ''], ['Ruocco', 'Massimiliano', '']]","['Paraphrase detection', 'Sentence Similarity', 'Deep learning', 'LSTM', 'CNN']"
12679,2210.01508,Matiss Rikters,Mat\=iss Rikters and Sanita Reinsone,"How Masterly Are People at Playing with Their Vocabulary? Analysis of
  the Wordle Game for Latvian",,"In Proceedings of the 10th Conference Human Language Technologies
  - The Baltic Perspective (Baltic HLT 2022)",10.22364/bjmc.2022.10.3.11,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we describe adaptation of a simple word guessing game that
occupied the hearts and minds of people around the world. There are versions
for all three Baltic countries and even several versions of each. We
specifically pay attention to the Latvian version and look into how people form
their guesses given any already uncovered hints. The paper analyses guess
patterns, easy and difficult word characteristics, and player behaviour and
response.
","[{'version': 'v1', 'created': 'Tue, 4 Oct 2022 10:25:24 GMT'}]",2022-10-05,"[['Rikters', 'Matīss', ''], ['Reinsone', 'Sanita', '']]","['linguistics', 'analysis', 'game', 'generation', 'Wordle', 'word game', 'word list']"
12680,1909.10278,Daniel Lerch Hostalot PhD,"Daniel Lerch-Hostalot, David Meg\'ias",Detection of Classifier Inconsistencies in Image Steganalysis,,,10.1145/3335203.3335738,,cs.CR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a methodology to detect inconsistencies in
classification-based image steganalysis is presented. The proposed approach
uses two classifiers: the usual one, trained with a set formed by cover and
stego images, and a second classifier trained with the set obtained after
embedding additional random messages into the original training set. When the
decisions of these two classifiers are not consistent, we know that the
prediction is not reliable. The number of inconsistencies in the predictions of
a testing set may indicate that the classifier is not performing correctly in
the testing scenario. This occurs, for example, in case of cover source
mismatch, or when we are trying to detect a steganographic method that the
classifier is no capable of modelling accurately. We also show how the number
of inconsistencies can be used to predict the reliability of the classifier
(classification errors).
","[{'version': 'v1', 'created': 'Mon, 23 Sep 2019 11:03:16 GMT'}]",2019-09-27,"[['Lerch-Hostalot', 'Daniel', ''], ['Megías', 'David', '']]","['Steganalysis', 'Cover Source Mismatch', 'Machine Learning']"
12681,2104.09837,Stefan Milius,Ji\v{r}\'i Ad\'amek and Stefan Milius and Lawrence S. Moss,An Initial Algebra Theorem Without Iteration,,"Proc. 9th Conference on Algebra and Coalgebra in Computer Science
  (CALCO 2021), volume 211 of LIPIcs, pages 5:1-5:20",10.4230/LIPIcs.CALCO.2021.5,,cs.LO math.CT,http://creativecommons.org/licenses/by/4.0/,"  The Initial Algebra Theorem by Trnkov\'a et al.~states, under mild
assumptions, that an endofunctor has an initial algebra provided it has a
pre-fixed point. The proof crucially depends on transfinitely iterating the
functor and in fact shows that, equivalently, the (transfinite) initial-algebra
chain stops. We give a constructive proof of the Initial Algebra Theorem that
avoids transfinite iteration of the functor. For a given pre-fixed point $A$ of
the functor, it uses Pataraia's theorem to obtain the least fixed point of a
monotone function on the partial order formed by all subobjects of $A$. Thanks
to properties of recursive coalgebras, this least fixed point yields an initial
algebra. We obtain new results on fixed points and initial algebras in
categories enriched over directed-complete partial orders, again without
iteration. Using transfinite iteration we equivalently obtain convergence of
the initial-algebra chain as an equivalent condition, overall yielding a
streamlined version of the original proof.
","[{'version': 'v1', 'created': 'Tue, 20 Apr 2021 08:54:03 GMT'}, {'version': 'v2', 'created': 'Wed, 26 May 2021 10:40:33 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Feb 2022 08:51:12 GMT'}]",2022-02-15,"[['Adámek', 'Jiří', ''], ['Milius', 'Stefan', ''], ['Moss', 'Lawrence S.', '']]","['Initial algebra', 'Pataraia’s theorem', 'recursive coalgebra', 'initial-algebra chain']"
12682,2105.00183,Jinghua Yu,"Jinghua Yu, Stefan Wagner, Bowen Wang, Feng Luo","A systematic mapping study on security countermeasures of in-vehicle
  communication systems","31 pages, 19 figures, submitted to Vehicular Communications","SAE International Journal of Transportation Cybersecurity and
  Privacy 4(2):97-116, 2021",10.4271/11-04-02-0005,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The innovations of vehicle connectivity have been increasing dramatically to
enhance the safety and user experience of driving, while the rising numbers of
interfaces to the external world also bring security threats to vehicles. Many
security countermeasures have been proposed and discussed to protect the
systems and services against attacks. To provide an overview of the current
states in this research field, we conducted a systematic mapping study on the
topic area ""security countermeasures of in-vehicle communication systems"". 279
papers are identified based on the defined study identification strategy and
criteria. We discussed four research questions related to the security
countermeasures, validation methods, publication patterns, and research trends
and gaps based on the extracted and classified data. Finally, we evaluated the
validity threats, the study identification results, and the whole mapping
process. We found that the studies in this topic area are increasing rapidly in
recent years. However, there are still gaps in various subtopics like
automotive Ethernet security, anomaly reaction, and so on. This study reviews
the target field not only related to research findings but also research
activities, which can help identify research gaps at a high level and inspire
new ideas for future work.
","[{'version': 'v1', 'created': 'Sat, 1 May 2021 07:23:00 GMT'}]",2022-04-15,"[['Yu', 'Jinghua', ''], ['Wagner', 'Stefan', ''], ['Wang', 'Bowen', ''], ['Luo', 'Feng', '']]","['vehicle cybersecurity', 'in-vehicle network', 'literature survey', 'research activity pattern', 'data classification']"
12683,2106.04232,Thierry Deruyttere,"Thierry Deruyttere, Victor Milewski, Marie-Francine Moens","Giving Commands to a Self-Driving Car: How to Deal with Uncertain
  Situations?",Removed minus sign before the sum in equation 11,,10.1016/j.engappai.2021.104257,,cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Current technology for autonomous cars primarily focuses on getting the
passenger from point A to B. Nevertheless, it has been shown that passengers
are afraid of taking a ride in self-driving cars. One way to alleviate this
problem is by allowing the passenger to give natural language commands to the
car. However, the car can misunderstand the issued command or the visual
surroundings which could lead to uncertain situations. It is desirable that the
self-driving car detects these situations and interacts with the passenger to
solve them. This paper proposes a model that detects uncertain situations when
a command is given and finds the visual objects causing it. Optionally, a
question generated by the system describing the uncertain objects is included.
We argue that if the car could explain the objects in a human-like way,
passengers could gain more confidence in the car's abilities. Thus, we
investigate how to (1) detect uncertain situations and their underlying causes,
and (2) how to generate clarifying questions for the passenger. When evaluating
on the Talk2Car dataset, we show that the proposed model, \acrfull{pipeline},
improves \gls{m:ambiguous-absolute-increase} in terms of $IoU_{.5}$ compared to
not using \gls{pipeline}. Furthermore, we designed a referring expression
generator (REG) \acrfull{reg_model} tailored to a self-driving car setting
which yields a relative improvement of \gls{m:meteor-relative} METEOR and
\gls{m:rouge-relative} ROUGE-l compared with state-of-the-art REG models, and
is three times faster.
","[{'version': 'v1', 'created': 'Tue, 8 Jun 2021 10:21:11 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Jul 2022 19:09:32 GMT'}]",2022-07-05,"[['Deruyttere', 'Thierry', ''], ['Milewski', 'Victor', ''], ['Moens', 'Marie-Francine', '']]","['Self-Driving Cars', 'Question Generation', 'Uncertainty Detection']"
12684,2109.05955,Mohammad Aliannejadi,"Mohammad Aliannejadi, Leif Azzopardi, Hamed Zamani, Evangelos
  Kanoulas, Paul Thomas, Nick Craswel","Analysing Mixed Initiatives and Search Strategies during Conversational
  Search",Accepted in CIKM 2021,,10.1145/3459637.3482231,,cs.IR cs.CL cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Information seeking conversations between users and Conversational Search
Agents (CSAs) consist of multiple turns of interaction. While users initiate a
search session, ideally a CSA should sometimes take the lead in the
conversation by obtaining feedback from the user by offering query suggestions
or asking for query clarifications i.e. mixed initiative. This creates the
potential for more engaging conversational searches, but substantially
increases the complexity of modelling and evaluating such scenarios due to the
large interaction space coupled with the trade-offs between the costs and
benefits of the different interactions. In this paper, we present a model for
conversational search -- from which we instantiate different observed
conversational search strategies, where the agent elicits: (i) Feedback-First,
or (ii) Feedback-After. Using 49 TREC WebTrack Topics, we performed an analysis
comparing how well these different strategies combine with different mixed
initiative approaches: (i) Query Suggestions vs. (ii) Query Clarifications. Our
analysis reveals that there is no superior or dominant combination, instead it
shows that query clarifications are better when asked first, while query
suggestions are better when asked after presenting results. We also show that
the best strategy and approach depends on the trade-offs between the relative
costs between querying and giving feedback, the performance of the initial
query, the number of assessments per query, and the total amount of gain
required. While this work highlights the complexities and challenges involved
in analyzing CSAs, it provides the foundations for evaluating conversational
strategies and conversational search agents in batch/offline settings.
","[{'version': 'v1', 'created': 'Mon, 13 Sep 2021 13:30:10 GMT'}]",2021-09-14,"[['Aliannejadi', 'Mohammad', ''], ['Azzopardi', 'Leif', ''], ['Zamani', 'Hamed', ''], ['Kanoulas', 'Evangelos', ''], ['Thomas', 'Paul', ''], ['Craswel', 'Nick', '']]","['Conversational Search', 'Mixed Initiatives', 'Evaluation']"
12685,2012.08986,Huifeng Guo,"Huifeng Guo, Bo Chen, Ruiming Tang, Weinan Zhang, Zhenguo Li, Xiuqiang
  He",An Embedding Learning Framework for Numerical Features in CTR Prediction,9 pages,,10.1145/3447548.3467077,,cs.IR cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Click-Through Rate (CTR) prediction is critical for industrial recommender
systems, where most deep CTR models follow an Embedding \& Feature Interaction
paradigm. However, the majority of methods focus on designing network
architectures to better capture feature interactions while the feature
embedding, especially for numerical features, has been overlooked. Existing
approaches for numerical features are difficult to capture informative
knowledge because of the low capacity or hard discretization based on the
offline expertise feature engineering. In this paper, we propose a novel
embedding learning framework for numerical features in CTR prediction (AutoDis)
with high model capacity, end-to-end training and unique representation
properties preserved. AutoDis consists of three core components:
meta-embeddings, automatic discretization and aggregation. Specifically, we
propose meta-embeddings for each numerical field to learn global knowledge from
the perspective of field with a manageable number of parameters. Then the
differentiable automatic discretization performs soft discretization and
captures the correlations between the numerical features and meta-embeddings.
Finally, distinctive and informative embeddings are learned via an aggregation
function. Comprehensive experiments on two public and one industrial datasets
are conducted to validate the effectiveness of AutoDis. Moreover, AutoDis has
been deployed onto a mainstream advertising platform, where online A/B test
demonstrates the improvement over the base model by 2.1% and 2.7% in terms of
CTR and eCPM, respectively. In addition, the code of our framework is publicly
available in
MindSpore(https://gitee.com/mindspore/mindspore/tree/master/model_zoo/research/recommend/autodis).
","[{'version': 'v1', 'created': 'Wed, 16 Dec 2020 14:31:31 GMT'}, {'version': 'v2', 'created': 'Sat, 22 May 2021 05:20:45 GMT'}]",2021-05-25,"[['Guo', 'Huifeng', ''], ['Chen', 'Bo', ''], ['Tang', 'Ruiming', ''], ['Zhang', 'Weinan', ''], ['Li', 'Zhenguo', ''], ['He', 'Xiuqiang', '']]","['Numerical Features', 'Embedding Learning', 'Click-Through Rate Prediction', 'Neural Network']"
12686,1506.09107,Diego Amancio,Diego R. Amancio,A complex network approach to stylometry,"PLoS ONE, 2015 (to appear)","PLoS ONE 10(8): e0136076, 2015",10.1371/journal.pone.0136076,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Statistical methods have been widely employed to study the fundamental
properties of language. In recent years, methods from complex and dynamical
systems proved useful to create several language models. Despite the large
amount of studies devoted to represent texts with physical models, only a
limited number of studies have shown how the properties of the underlying
physical systems can be employed to improve the performance of natural language
processing tasks. In this paper, I address this problem by devising complex
networks methods that are able to improve the performance of current
statistical methods. Using a fuzzy classification strategy, I show that the
topological properties extracted from texts complement the traditional textual
description. In several cases, the performance obtained with hybrid approaches
outperformed the results obtained when only traditional or networked methods
were used. Because the proposed model is generic, the framework devised here
could be straightforwardly used to study similar textual applications where the
topology plays a pivotal role in the description of the interacting agents.
","[{'version': 'v1', 'created': 'Tue, 30 Jun 2015 14:32:30 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Aug 2015 13:59:39 GMT'}]",2015-09-18,"[['Amancio', 'Diego R.', '']]","['complex networks', 'network topology', 'pattern recognition']"
12687,2202.07305,Kohei Uehara,"Kohei Uehara, Yusuke Mori, Yusuke Mukuta, Tatsuya Harada",ViNTER: Image Narrative Generation with Emotion-Arc-Aware Transformer,,,10.1145/3487553.3524649,,cs.CV cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Image narrative generation is a task to create a story from an image with a
subjective viewpoint. Given the importance of the subjective feelings of
writers, readers, and characters in storytelling, an image narrative generation
method should consider human emotion. In this study, we propose a novel method
of image narrative generation called ViNTER (Visual Narrative Transformer with
Emotion arc Representation), which takes ""emotion arc"" as input to capture a
sequence of emotional changes. Since emotion arcs represent the trajectory of
emotional change, it is expected that we can include detailed information about
the emotional changes in the story to the model. We present experimental
results of both automatic and manual evaluations on the Image Narrative dataset
and demonstrate the effectiveness of the proposed approach.
","[{'version': 'v1', 'created': 'Tue, 15 Feb 2022 10:53:08 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Apr 2022 06:33:19 GMT'}]",2022-04-08,"[['Uehara', 'Kohei', ''], ['Mori', 'Yusuke', ''], ['Mukuta', 'Yusuke', ''], ['Harada', 'Tatsuya', '']]","['Vision and Language', 'Emotion Arc', 'Creative AI', 'Narrative / Storytelling']"
12688,2107.06796,Novanto Yudistira,"Aisyah Awalina, Jibran Fawaid, Rifky Yunus Krisnabayu, Novanto
  Yudistira",Indonesia's Fake News Detection using Transformer Network,,"SIET '21: 6th International Conference on Sustainable Information
  Engineering and Technology 2021",10.1145/3479645.3479666,,cs.CL cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Fake news is a problem faced by society in this era. It is not rare for fake
news to cause provocation and problem for the people. Indonesia, as a country
with the 4th largest population, has a problem in dealing with fake news. More
than 30% of rural and urban population are deceived by this fake news problem.
As we have been studying, there is only few literatures on preventing the
spread of fake news in Bahasa Indonesia. So, this research is conducted to
prevent these problems. The dataset used in this research was obtained from a
news portal that identifies fake news, turnbackhoax.id. Using Web Scrapping on
this page, we got 1116 data consisting of valid news and fake news. The dataset
can be accessed at https://github.com/JibranFawaid/turnbackhoax-dataset. This
dataset will be combined with other available datasets. The methods used are
CNN, BiLSTM, Hybrid CNN-BiLSTM, and BERT with Transformer Network. This
research shows that the BERT method with Transformer Network has the best
results with an accuracy of up to 90%.
","[{'version': 'v1', 'created': 'Wed, 14 Jul 2021 15:52:15 GMT'}]",2021-11-05,"[['Awalina', 'Aisyah', ''], ['Fawaid', 'Jibran', ''], ['Krisnabayu', 'Rifky Yunus', ''], ['Yudistira', 'Novanto', '']]","['Fake News', 'Bert', 'Transformer Network']"
12689,1704.05132,Nikolaos Antoniadis,"Nikolaos Antoniadis, Angelo Sifaleras","A hybrid CPU-GPU parallelization scheme of variable neighborhood search
  for inventory optimization problems","8 pages, 1 figure","Electronic Notes in Discrete Mathematics, Volume 58, April 2017,
  Pages 47-54, ISSN 1571-0653",10.1016/j.endm.2017.03.007,,cs.NE cs.DC cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study various parallelization schemes for the Variable
Neighborhood Search (VNS) metaheuristic on a CPU-GPU system via OpenMP and
OpenACC. A hybrid parallel VNS method is applied to recent benchmark problem
instances for the multi-product dynamic lot sizing problem with product returns
and recovery, which appears in reverse logistics and is known to be NP-hard. We
report our findings regarding these parallelization approaches and present
promising computational results.
","[{'version': 'v1', 'created': 'Mon, 17 Apr 2017 21:31:14 GMT'}]",2017-04-19,"[['Antoniadis', 'Nikolaos', ''], ['Sifaleras', 'Angelo', '']]","['Variable Neighborhood Search', 'Parallel Computing', 'CPU-GPUcomputing', 'OpenMP', 'OpenACC']"
12690,1910.06493,Benjamin Adams,"Mathew Darling, Benjamin Adams, Caroline Orchiston, Thomas Wilson,
  Brendon Bradley","Understanding population fluctuations through volunteered geographic
  information and novel indicators: The experience of Rakiura, Stewart Island,
  New Zealand","8 pages, GeoComputation 2019",,10.17608/k6.auckland.9846323.v1,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  In an era of heterogeneous data, novel methods and volunteered geographic
information provide opportunities to understand how people interact with a
place. However, it is not enough to simply have such heterogeneous data,
instead an understanding of its usability and reliability needs to be
undertaken. Here, we draw upon the case study of Rakiura, Stewart Island where
manifested passenger numbers across the Foveaux Strait are known. We have built
a population model to ground truth such novel indicators. In our preliminary
study, we find that a number of indicators offer the opportunity to understand
fluctuations in populations. Some indicators (such as wastewater volumes) can
suggest relative changes in populations in a raw form. While other indicators
(such as TripAdvisor reviews or Instagram posts) require further data
enrichment to get insights into population fluctuations. This research forms
part of a larger research project looking to test and apply such novel
indicators to inform disaster risk assessments.
","[{'version': 'v1', 'created': 'Tue, 15 Oct 2019 02:43:03 GMT'}]",2019-10-16,"[['Darling', 'Mathew', ''], ['Adams', 'Benjamin', ''], ['Orchiston', 'Caroline', ''], ['Wilson', 'Thomas', ''], ['Bradley', 'Brendon', '']]","['Population movement', 'tourism', 'transient populations', 'volunteered geographic information', 'New Zealand', 'Stewart Island']"
12691,1811.07271,Michael Correll,Michael Correll,Ethical Dimensions of Visualization Research,,,10.1145/3290605.3300418,,cs.HC cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Visualizations have a potentially enormous influence on how data are used to
make decisions across all areas of human endeavor. However, it is not clear how
this power connects to ethical duties: what obligations do we have when it
comes to visualizations and visual analytics systems, beyond our duties as
scientists and engineers? Drawing on historical and contemporary examples, I
address the moral components of the design and use of visualizations, identify
some ongoing areas of visualization research with ethical dilemmas, and propose
a set of additional moral obligations that we have as designers, builders, and
researchers of visualizations.
","[{'version': 'v1', 'created': 'Sun, 18 Nov 2018 04:37:32 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Dec 2018 23:20:03 GMT'}]",2021-04-07,"[['Correll', 'Michael', '']]","['Information Visualization', 'Visual Analytics', 'Ethics']"
12692,2110.01818,Dingming Yang D.Y.,"Dingming Yang, Zeyu Yu, Hongqiang Yuan, Yanrong Cui","An Improved Genetic Algorithm and Its Application in Neural Network
  Adversarial Attack","18 pages, 9 figures, 9 tables and 23 References",,10.1371/journal.pone.0267970,,cs.NE cs.CR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The choice of crossover and mutation strategies plays a crucial role in the
searchability, convergence efficiency and precision of genetic algorithms. In
this paper, a novel improved genetic algorithm is proposed by improving the
crossover and mutation operation of the simple genetic algorithm, and it is
verified by 15 test functions. The qualitative results show that, compared with
three other mainstream swarm intelligence optimization algorithms, the
algorithm can not only improve the global search ability, convergence
efficiency and precision, but also increase the success rate of convergence to
the optimal value under the same experimental conditions. The quantitative
results show that the algorithm performs superiorly in 13 of the 15 tested
functions. The Wilcoxon rank-sum test was used for statistical evaluation,
showing the significant advantage of the algorithm at $95\%$ confidence
intervals. Finally, the algorithm is applied to neural network adversarial
attacks. The applied results show that the method does not need the structure
and parameter information inside the neural network model, and it can obtain
the adversarial samples with high confidence in a brief time just by the
classification and confidence information output from the neural network.
","[{'version': 'v1', 'created': 'Tue, 5 Oct 2021 04:46:16 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Nov 2021 04:00:36 GMT'}, {'version': 'v3', 'created': 'Tue, 23 Nov 2021 14:19:57 GMT'}, {'version': 'v4', 'created': 'Mon, 6 Dec 2021 04:24:18 GMT'}, {'version': 'v5', 'created': 'Sun, 6 Mar 2022 13:34:12 GMT'}]",2022-10-12,"[['Yang', 'Dingming', ''], ['Yu', 'Zeyu', ''], ['Yuan', 'Hongqiang', ''], ['Cui', 'Yanrong', '']]","['Genetic algorithms', 'swarm intelligence optimization algorithms', 'algorithm improvement', 'neural network adversarial attack']"
12693,1811.05015,Behzad Golshan,"Sanaz Bahargam, Behzad Golshan, Theodoros Lappas, Evimaria Terzi",A Team-Formation Algorithm for Faultline Minimization,,,10.1016/j.eswa.2018.10.046,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, the proliferation of online resumes and the need to evaluate
large populations of candidates for on-site and virtual teams have led to a
growing interest in automated team-formation. Given a large pool of candidates,
the general problem requires the selection of a team of experts to complete a
given task. Surprisingly, while ongoing research has studied numerous
variations with different constraints, it has overlooked a factor with a
well-documented impact on team cohesion and performance: team faultlines.
Addressing this gap is challenging, as the available measures for faultlines in
existing teams cannot be efficiently applied to faultline optimization. In this
work, we meet this challenge with a new measure that can be efficiently used
for both faultline measurement and minimization. We then use the measure to
solve the problem of automatically partitioning a large population into
low-faultline teams. By introducing faultlines to the team-formation
literature, our work creates exciting opportunities for algorithmic work on
faultline optimization, as well as on work that combines and studies the
connection of faultlines with other influential team characteristics.
","[{'version': 'v1', 'created': 'Mon, 12 Nov 2018 21:56:07 GMT'}]",2018-11-14,"[['Bahargam', 'Sanaz', ''], ['Golshan', 'Behzad', ''], ['Lappas', 'Theodoros', ''], ['Terzi', 'Evimaria', '']]","['Teams', 'Team Faultlines', 'Team Formation']"
12694,2105.01542,Son T. Luu,"Son T. Luu, Mao Nguyen Bui, Loi Duc Nguyen, Khiem Vinh Tran, Kiet Van
  Nguyen, Ngan Luu-Thuy Nguyen","Conversational Machine Reading Comprehension for Vietnamese Healthcare
  Texts","Published at The 13th International Conference on Computational
  Collective Intelligence (ICCCI 2021)",,10.1007/978-3-030-88113-9_44,,cs.CL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Machine reading comprehension (MRC) is a sub-field in natural language
processing that aims to assist computers understand unstructured texts and then
answer questions related to them. In practice, the conversation is an essential
way to communicate and transfer information. To help machines understand
conversation texts, we present UIT-ViCoQA, a new corpus for conversational
machine reading comprehension in the Vietnamese language. This corpus consists
of 10,000 questions with answers over 2,000 conversations about health news
articles. Then, we evaluate several baseline approaches for conversational
machine comprehension on the UIT-ViCoQA corpus. The best model obtains an F1
score of 45.27%, which is 30.91 points behind human performance (76.18%),
indicating that there is ample room for improvement. Our dataset is available
at our website: http://nlp.uit.edu.vn/datasets/ for research purposes.
","[{'version': 'v1', 'created': 'Tue, 4 May 2021 14:50:39 GMT'}, {'version': 'v2', 'created': 'Wed, 5 May 2021 01:48:26 GMT'}, {'version': 'v3', 'created': 'Sat, 15 May 2021 10:43:18 GMT'}, {'version': 'v4', 'created': 'Fri, 21 May 2021 09:47:05 GMT'}, {'version': 'v5', 'created': 'Fri, 2 Jul 2021 01:59:01 GMT'}, {'version': 'v6', 'created': 'Thu, 30 Sep 2021 14:59:03 GMT'}]",2021-10-01,"[['Luu', 'Son T.', ''], ['Bui', 'Mao Nguyen', ''], ['Nguyen', 'Loi Duc', ''], ['Tran', 'Khiem Vinh', ''], ['Van Nguyen', 'Kiet', ''], ['Nguyen', 'Ngan Luu-Thuy', '']]","['conversations', 'question answering', 'machine reading comprehension', 'deep neural models', 'texts']"
12695,2301.10086,Sebastian Schulthei{\ss},Sebastian Schulthei{\ss},"How search engine marketing influences user knowledge gain: Development
  and empirical testing of an information search behavior model",,,10.1145/3576840.3578297,,cs.IR,http://creativecommons.org/licenses/by/4.0/,"  People use search engines to find answers to questions related to their
health, finances, or other socially relevant issues. However, most users are
unaware that search results are considerably influenced by search engine
marketing (SEM). SEM measures are driven by commercial, political, or other
motives. Due to these motivations, two questions arise: What information
quality is mediated through SEM? And how is collecting documents of different
quality affecting user knowledge gain? Both questions are not considered by
existing models of information behavior. Hence, the doctoral research project
described in this paper aims to develop and empirically test an information
search behavior model on the influences of SEM on user knowledge gain and
thereby contribute to the search as learning body of research.
","[{'version': 'v1', 'created': 'Tue, 24 Jan 2023 15:48:18 GMT'}]",2023-01-25,"[['Schultheiß', 'Sebastian', '']]","['Search engines', 'user behavior', 'knowledge gain', 'search as learning', 'search engine']"
12696,2204.09773,Guillem Pascual,"Guillem Pascual, Pablo Laiz, Albert Garc\'ia, Hagen Wenzek, Jordi
  Vitri\`a, Santi Segu\'i",Time-based Self-supervised Learning for Wireless Capsule Endoscopy,,,10.1016/j.compbiomed.2022.105631,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  State-of-the-art machine learning models, and especially deep learning ones,
are significantly data-hungry; they require vast amounts of manually labeled
samples to function correctly. However, in most medical imaging fields,
obtaining said data can be challenging. Not only the volume of data is a
problem, but also the imbalances within its classes; it is common to have many
more images of healthy patients than of those with pathology. Computer-aided
diagnostic systems suffer from these issues, usually over-designing their
models to perform accurately. This work proposes using self-supervised learning
for wireless endoscopy videos by introducing a custom-tailored method that does
not initially need labels or appropriate balance. We prove that using the
inferred inherent structure learned by our method, extracted from the temporal
axis, improves the detection rate on several domain-specific applications even
under severe imbalance.
","[{'version': 'v1', 'created': 'Wed, 20 Apr 2022 20:31:06 GMT'}]",2022-05-27,"[['Pascual', 'Guillem', ''], ['Laiz', 'Pablo', ''], ['García', 'Albert', ''], ['Wenzek', 'Hagen', ''], ['Vitrià', 'Jordi', ''], ['Seguí', 'Santi', '']]","['capsule endoscopy', 'deep learning', 'self-supervised learning', 'semi-supervised learning']"
12697,2209.06126,Christine Bauer,Karlijn Dinnissen and Christine Bauer,A Stakeholder-Centered View on Fairness in Music Recommender Systems,"Abstract for FAcctRec 2022 at RecSys 2022, 1 table, main article
  published in Frontiers in Big Data","Frontiers in Big Data, 5, Art no. 913608 (2022)",10.3389/fdata.2022.913608,,cs.IR cs.CY cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Our narrative literature review acknowledges that, although there is an
increasing interest in recommender system fairness in general, the music domain
has received relatively little attention in this regard. However, addressing
fairness of music recommender systems (MRSs) is highly important because the
performance of these systems considerably impacts both the users of music
streaming platforms and the artists providing music to those platforms. The
distinct needs that these stakeholder groups may have, and the different
aspects of fairness that therefore should be considered, make for a challenging
research field with ample opportunities for improvement. The review first
outlines current literature on MRS fairness from the perspective of each
stakeholder and the stakeholders combined, and then identifies promising
directions for future research.
  The two open questions arising from the review are as follows: (i) In the MRS
field, only limited data is publicly available to conduct fairness research;
most datasets either originate from the same source or are proprietary (and,
thus, not widely accessible). How can we address this limited data
availability? (ii) Overall, the review shows that the large majority of works
analyze the current situation of MRS fairness, whereas only few works propose
approaches to improve it. How can we move forward to a focus on improving
fairness aspects in these recommender systems?
  At FAccTRec '22, we emphasize the specifics of addressing RS fairness in the
music domain.
","[{'version': 'v1', 'created': 'Thu, 8 Sep 2022 16:02:16 GMT'}]",2022-09-14,"[['Dinnissen', 'Karlijn', ''], ['Bauer', 'Christine', '']]","['bias mitigation', 'fairness', 'music recommendation systems', 'stakeholders', 'literature review']"
12698,1909.06795,Ruiqi Cheng,"Ruiqi Cheng, Kaiwei Wang, Jian Bai, Zhijie Xu","OpenMPR: Recognize Places Using Multimodal Data for People with Visual
  Impairments","The paper is accepted by the special issue of Measurement Science and
  Engineering",,10.1088/1361-6501/ab2106,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Place recognition plays a crucial role in navigational assistance, and is
also a challenging issue of assistive technology. The place recognition is
prone to erroneous localization owing to various changes between database and
query images. Aiming at the wearable assistive device for visually impaired
people, we propose an open-sourced place recognition algorithm OpenMPR, which
utilizes the multimodal data to address the challenging issues of place
recognition. Compared with conventional place recognition, the proposed OpenMPR
not only leverages multiple effective descriptors, but also assigns different
weights to those descriptors in image matching. Incorporating GNSS data into
the algorithm, the cone-based sequence searching is used for robust place
recognition. The experiments illustrate that the proposed algorithm manages to
solve the place recognition issue in the real-world scenarios and surpass the
state-of-the-art algorithms in terms of assistive navigation performance. On
the real-world testing dataset, the online OpenMPR achieves 88.7% precision at
100% recall without illumination changes, and achieves 57.8% precision at 99.3%
recall with illumination changes. The OpenMPR is available at
https://github.com/chengricky/OpenMultiPR.
","[{'version': 'v1', 'created': 'Sun, 15 Sep 2019 12:58:53 GMT'}]",2019-09-17,"[['Cheng', 'Ruiqi', ''], ['Wang', 'Kaiwei', ''], ['Bai', 'Jian', ''], ['Xu', 'Zhijie', '']]","['Visual Localization', 'Computer Vision', 'Navigational Assistance', 'AssistiveTechnology']"
12699,2012.10839,Stephen MacDonell,"Bilal Raza, Stephen G. MacDonell and Tony Clear","Topics and Treatments in Global Software Engineering Research: A
  Systematic Snapshot","10 Pages, Conference, 7 Figres, 6 Tables","Proceedings of the 8th International Conference on Evaluation of
  Novel Approaches to Software Engineering (ENASE2013)",10.5220/0004444700850096,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study presents an analysis of the most recent literature addressing
global software engineering (GSE). We examine the current state of GSE research
using a new Systematic Snapshot Mapping (SSM) technique. We analysed 275 papers
published between January 2011 and June 2012 in peer-reviewed conferences,
journals and workshops. Our results provide a coarse-grained overview of the
very recent literature addressing GSE, by classifying studies into predefined
categories. We also follow and extend several prior classifications to support
our synthesis of the data. Our results reveal that currently GSE studies are
focused on Management and Infrastructure related factors. Most of the studies
are conducted at the organizational level using methods such as interviews,
surveys, field studies and case studies. We use inter-country network analysis
to confirm that the USA and India are major players in GSE, with USA-India
collaborations being the most frequently studied, followed by USA-China.
Specific groups of countries have dominated the reported GSE project locations.
In contrast, regions including Central Asia, South Asia (except India), Africa
and South East Asia have not been covered in these studies. While a
considerable number of GSE-related studies have been published they are
currently quite narrowly focused on exploratory research and explanatory
theories. The critical research paradigm has been untouched, perhaps due to a
lack of criteria and principles for carrying out such research in GSE. An
absence of formulative research, experimentation and simulation, and a
comparative focus on evaluative approaches, all suggest that existing tools,
methods and approaches from related fields are being tested in the GSE context.
However, these solutions may not scale to cover GSE-related issues or may
overlook factors/facets specific to GSE.
","[{'version': 'v1', 'created': 'Sun, 20 Dec 2020 04:04:27 GMT'}]",2020-12-30,"[['Raza', 'Bilal', ''], ['MacDonell', 'Stephen G.', ''], ['Clear', 'Tony', '']]","['Global Software Engineering (GSE)', 'Distributed Software Development', 'Systematic']"
12700,2202.12598,Di Wu,"Di Wu, Jie Yang, and Mohamad Sawan","Bridging the Gap Between Patient-specific and Patient-independent
  Seizure Prediction via Knowledge Distillation",,,10.1088/1741-2552/ac73b3,,cs.LG cs.AI eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Objective. Deep neural networks (DNNs) have shown unprecedented success in
various brain-machine interface applications such as epileptic seizure
prediction. However, existing approaches typically train models in a
patient-specific fashion due to the highly personalized characteristics of
epileptic signals. Therefore, only a limited number of labeled recordings from
each subject can be used for training. As a consequence, current DNN based
methods demonstrate poor generalization ability to some extent due to the
insufficiency of training data. On the other hand, patient-independent models
attempt to utilize more patient data to train a universal model for all
patients by pooling patient data together. Despite different techniques
applied, results show that patient-independent models perform worse than
patient-specific models due to high individual variation across patients. A
substantial gap thus exists between patient-specific and patient-independent
models. Approach. In this paper, we propose a novel training scheme based on
knowledge distillation which makes use of a large amount of data from multiple
subjects. It first distills informative features from signals of all available
subjects with a pre-trained general model. A patient-specific model can then be
obtained with the help of distilled knowledge and additional personalized data.
Main results. Four state-of-the-art seizure prediction methods are trained on
the Children's Hospital of Boston-MIT sEEG database with our proposed scheme.
The resulting accuracy, sensitivity, and false prediction rate show that our
proposed training scheme consistently improves the prediction performance of
state-of-the-art methods by a large margin. Significance. The proposed training
scheme significantly improves the performance of patient-specific seizure
predictors and bridges the gap between patient-specific and patient-independent
predictors.
","[{'version': 'v1', 'created': 'Fri, 25 Feb 2022 10:30:29 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Jun 2022 02:14:34 GMT'}]",2022-06-14,"[['Wu', 'Di', ''], ['Yang', 'Jie', ''], ['Sawan', 'Mohamad', '']]","['Neurological symptom prediction', 'epileptic seizures', 'patient-specific', 'patientindependent', 'knowledge distillation', 'EEG']"
12701,2109.09415,Claudio Cicconetti,Claudio Cicconetti and Marco Conti and Andrea Passarella,"Architecture and Performance Evaluation of Distributed Computation
  Offloading in Edge Computing",,"Simulation Modelling Practice and Theory. Volume 101, May 2020,
  102007",10.1016/j.simpat.2019.102007,,cs.DC cs.NI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Edge computing is an emerging paradigm to enable low-latency applications,
like mobile augmented reality, because it takes the computation on processing
devices that are closer to the users. On the other hand, the need for highly
scalable execution of stateless tasks for cloud systems is driving the
definition of new technologies based on serverless computing. In this paper, we
propose a novel architecture where the two converge to enable low-latency
applications: this is achieved by offloading short-lived stateless tasks from
the user terminals to edge nodes. Furthermore, we design a distributed
algorithm that tackles the research challenge of selecting the best executor,
based on real-time measurements and simple, yet effective, prediction
algorithms. Finally, we describe a new performance evaluation framework
specifically designed for an accurate assessment of algorithms and protocols in
edge computing environments, where the nodes may have very heterogeneous
networking and processing capabilities. The proposed framework relies on the
use of real components on lightweight virtualization mixed with simulated
computation and is well-suited to the analysis of several applications and
network environments. Using our framework, we evaluate our proposed
architecture and algorithms in small- and large-scale edge computing scenarios,
showing that our solution achieves similar or better delay performance than a
centralized solution, with far less network utilization.
","[{'version': 'v1', 'created': 'Mon, 20 Sep 2021 10:31:32 GMT'}]",2021-09-21,"[['Cicconetti', 'Claudio', ''], ['Conti', 'Marco', ''], ['Passarella', 'Andrea', '']]","['online job dispatching', 'serverless computing', 'computationoffloading', 'edge computing', 'performance evaluation']"
12702,2206.05584,Harsh Vardhan,"Harsh Vardhan, Neal M Sarkar, Himanshu Neema","Modeling and Optimization of a Longitudinally-Distributed Global Solar
  Grid",,,10.1109/ICPS48983.2019.9067584,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Our simulation-based experiments are aimed to demonstrate a use case on the
feasibility of fulfillment of global energy demand by primarily relying on
solar energy through the integration of a longitudinally-distributed grid.
These experiments demonstrate the availability of simulation technologies, good
approximation models of grid components, and data for simulation. We also
experimented with integrating different tools to create realistic simulations
as we are currently developing a detailed tool-chain for experimentation. These
experiments consist of a network of model houses at different locations in the
world, each producing and consuming only solar energy. The model includes
houses, various appliances, appliance usage schedules, regional weather
information, floor area, HVAC systems, population, number of houses in the
region, and other parameters to imitate a real-world scenario. Data gathered
from the power system simulation is used to develop optimization models to find
the optimal solar panel area required at the different locations to satisfy
energy demands in different scenarios.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2022 18:20:13 GMT'}]",2022-06-14,"[['Vardhan', 'Harsh', ''], ['Sarkar', 'Neal M', ''], ['Neema', 'Himanshu', '']]","['Solar Energy', 'Global Grid', 'Optimization', 'Model-BasedSimulation', 'Data-Driven Simulation', 'Cyber-Physical System', 'GridLAB-D', 'Sustainable Future']"
12703,2201.07835,Jhon Alejandro Montanez Barrera,"J.A. Montanez-Barrera, J.M. Barroso-Maldonado, A.F. Bedoya-Santacruz,
  Adrian Mota-Babiloni","Correlated-informed neural networks: a new machine learning framework to
  predict pressure drop in micro-channels",,"International Journal of Heat and Mass Transfer, Volume 194, 15
  September 2022, 123017",10.1016/j.ijheatmasstransfer.2022.123017,,cs.LG cs.AI physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate pressure drop estimation in forced boiling phenomena is important
during the thermal analysis and the geometric design of cryogenic heat
exchangers. However, current methods to predict the pressure drop have one of
two problems: lack of accuracy or generalization to different situations. In
this work, we present the correlated-informed neural networks (CoINN), a new
paradigm in applying the artificial neural network (ANN) technique combined
with a successful pressure drop correlation as a mapping tool to predict the
pressure drop of zeotropic mixtures in micro-channels. The proposed approach is
inspired by Transfer Learning, highly used in deep learning problems with
reduced datasets. Our method improves the ANN performance by transferring the
knowledge of the Sun & Mishima correlation for the pressure drop to the ANN.
The correlation having physical and phenomenological implications for the
pressure drop in micro-channels considerably improves the performance and
generalization capabilities of the ANN. The final architecture consists of
three inputs: the mixture vapor quality, the micro-channel inner diameter, and
the available pressure drop correlation. The results show the benefits gained
using the correlated-informed approach predicting experimental data used for
training and a posterior test with a mean relative error (mre) of 6%, lower
than the Sun & Mishima correlation of 13%. Additionally, this approach can be
extended to other mixtures and experimental settings, a missing feature in
other approaches for mapping correlations using ANNs for heat transfer
applications.
","[{'version': 'v1', 'created': 'Wed, 19 Jan 2022 19:40:21 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Aug 2022 14:05:20 GMT'}]",2022-08-03,"[['Montanez-Barrera', 'J. A.', ''], ['Barroso-Maldonado', 'J. M.', ''], ['Bedoya-Santacruz', 'A. F.', ''], ['Mota-Babiloni', 'Adrian', '']]","['two-phase flow', 'pressure drop', 'zeotropic mixtures', 'machine learning', 'transfer learning', 'ANN', 'micro-channels']"
12704,1906.10329,Ahmed Shifaz,"Ahmed Shifaz, Charlotte Pelletier, Francois Petitjean, Geoffrey I.
  Webb","TS-CHIEF: A Scalable and Accurate Forest Algorithm for Time Series
  Classification","37 pages, 10 figures",Data Mining and Knowledge Discovery 34 (2020) 742-775,10.1007/s10618-020-00679-8,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Time Series Classification (TSC) has seen enormous progress over the last two
decades. HIVE-COTE (Hierarchical Vote Collective of Transformation-based
Ensembles) is the current state of the art in terms of classification accuracy.
HIVE-COTE recognizes that time series data are a specific data type for which
the traditional attribute-value representation, used predominantly in machine
learning, fails to provide a relevant representation. HIVE-COTE combines
multiple types of classifiers: each extracting information about a specific
aspect of a time series, be it in the time domain, frequency domain or
summarization of intervals within the series. However, HIVE-COTE (and its
predecessor, FLAT-COTE) is often infeasible to run on even modest amounts of
data. For instance, training HIVE-COTE on a dataset with only 1,500 time series
can require 8 days of CPU time. It has polynomial runtime with respect to the
training set size, so this problem compounds as data quantity increases. We
propose a novel TSC algorithm, TS-CHIEF (Time Series Combination of
Heterogeneous and Integrated Embedding Forest), which rivals HIVE-COTE in
accuracy but requires only a fraction of the runtime. TS-CHIEF constructs an
ensemble classifier that integrates the most effective embeddings of time
series that research has developed in the last decade. It uses tree-structured
classifiers to do so efficiently. We assess TS-CHIEF on 85 datasets of the
University of California Riverside (UCR) archive, where it achieves
state-of-the-art accuracy with scalability and efficiency. We demonstrate that
TS-CHIEF can be trained on 130k time series in 2 days, a data quantity that is
beyond the reach of any TSC algorithm with comparable accuracy.
","[{'version': 'v1', 'created': 'Tue, 25 Jun 2019 05:41:16 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Feb 2020 04:14:24 GMT'}]",2021-02-09,"[['Shifaz', 'Ahmed', ''], ['Pelletier', 'Charlotte', ''], ['Petitjean', 'Francois', ''], ['Webb', 'Geoffrey I.', '']]","['time series', 'classification', 'metrics', 'bag of words', 'transformation', 'forest', 'scalable']"
12705,2112.04017,Zachary Neal,"Karl Godard, Zachary P. Neal","fastball: A fast algorithm to sample bipartite graphs with fixed degree
  sequences",Journal of Complex Networks (2022),,10.1093/comnet/cnac049,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  Many applications require randomly sampling bipartite graphs with fixed
degrees, or randomly sampling incidence matrices with fixed row and column
sums. Although several sampling algorithms exist, the ``curveball'' algorithm
is the most efficient with an asymptotic time complexity of O(n log n), and has
been proven to sample uniformly at random. In this paper, we introduce the
``fastball'' algorithm, which adopts a similar approach but has an asymptotic
time complexity of O(n). We show that a C++ implementation of fastball randomly
samples large bipartite graphs with fixed degrees faster than curveball, and
illustrate the value of this faster algorithm in the context of the fixed
degree sequence model for backbone extraction.
","[{'version': 'v1', 'created': 'Tue, 7 Dec 2021 22:05:25 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Feb 2022 16:01:42 GMT'}, {'version': 'v3', 'created': 'Fri, 8 Jul 2022 17:21:17 GMT'}, {'version': 'v4', 'created': 'Mon, 29 Aug 2022 20:18:00 GMT'}, {'version': 'v5', 'created': 'Sun, 30 Oct 2022 15:22:30 GMT'}]",2022-11-01,"[['Godard', 'Karl', ''], ['Neal', 'Zachary P.', '']]","['Bipartite', 'Configuration Model', 'Fixed Degree', 'Markov Chain', 'Randomization', 'Sampling']"
12706,1708.01244,Yury Korolev,Yury Korolev and Jan Lellmann,"Image reconstruction with imperfect forward models and applications in
  deblurring",,,10.1137/17M1141965,,cs.NA cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present and analyse an approach to image reconstruction problems with
imperfect forward models based on partially ordered spaces - Banach lattices.
In this approach, errors in the data and in the forward models are described
using order intervals. The method can be characterised as the lattice analogue
of the residual method, where the feasible set is defined by linear inequality
constraints. The study of this feasible set is the main contribution of this
paper. Convexity of this feasible set is examined in several settings and
modifications for introducing additional information about the forward operator
are considered. Numerical examples demonstrate the performance of the method in
deblurring with errors in the blurring kernel.
","[{'version': 'v1', 'created': 'Thu, 3 Aug 2017 17:49:31 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Aug 2017 12:49:18 GMT'}, {'version': 'v3', 'created': 'Mon, 23 Oct 2017 08:11:10 GMT'}]",2018-08-15,"[['Korolev', 'Yury', ''], ['Lellmann', 'Jan', '']]","['inverse problems', 'imperfect forward models', 'residual method', 'deblurring', 'blind deblurring', 'deconvolution', 'blind deconvolution', 'uncertainty quantification']"
12707,2108.12510,Sindhu C. M. Gowda,"Sindhu C.M. Gowda, Shalmali Joshi, Haoran Zhang and Marzyeh Ghassemi","Pulling Up by the Causal Bootstraps: Causal Data Augmentation for
  Pre-training Debiasing",Published in CIKM 2021,,10.1145/3459637.3482380,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning models achieve state-of-the-art performance on many
supervised learning tasks. However, prior evidence suggests that these models
may learn to rely on shortcut biases or spurious correlations (intuitively,
correlations that do not hold in the test as they hold in train) for good
predictive performance. Such models cannot be trusted in deployment
environments to provide accurate predictions. While viewing the problem from a
causal lens is known to be useful, the seamless integration of causation
techniques into machine learning pipelines remains cumbersome and expensive. In
this work, we study and extend a causal pre-training debiasing technique called
causal bootstrapping (CB) under five practical confounded-data
generation-acquisition scenarios (with known and unknown confounding). Under
these settings, we systematically investigate the effect of confounding bias on
deep learning model performance, demonstrating their propensity to rely on
shortcut biases when these biases are not properly accounted for. We
demonstrate that such a causal pre-training technique can significantly
outperform existing base practices to mitigate confounding bias on real-world
domain generalization benchmarking tasks. This systematic investigation
underlines the importance of accounting for the underlying data-generating
mechanisms and fortifying data-preprocessing pipelines with a causal framework
to develop methods robust to confounding biases.
","[{'version': 'v1', 'created': 'Fri, 27 Aug 2021 21:42:04 GMT'}]",2021-08-31,"[['Gowda', 'Sindhu C. M.', ''], ['Joshi', 'Shalmali', ''], ['Zhang', 'Haoran', ''], ['Ghassemi', 'Marzyeh', '']]","['confounding bias', 'pre-training', 'debiasing', 'causal graphs', 're-sampling']"
12708,2108.00505,Mohammadreza Baharani,"Vinit Katariya, Mohammadreza Baharani, Nichole Morris, Omidreza
  Shoghli, Hamed Tabkhi","DeepTrack: Lightweight Deep Learning for Vehicle Path Prediction in
  Highways",Published in IEEE Transactions on Intelligent Transportation Systems,,10.1109/TITS.2022.3172015,,cs.LG cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vehicle trajectory prediction is essential for enabling safety-critical
intelligent transportation systems (ITS) applications used in management and
operations. While there have been some promising advances in the field, there
is a need for modern deep learning algorithms that allow real-time trajectory
prediction on embedded IoT devices. This article presents DeepTrack, a novel
deep learning algorithm customized for real-time vehicle trajectory prediction
and monitoring applications in arterial management, freeway management, traffic
incident management, and work zone management for high-speed incoming traffic.
In contrast to previous methods, the vehicle dynamics are encoded using
Temporal Convolutional Networks (TCNs) to provide more robust time prediction
with less computation. DeepTrack also uses depthwise convolution, which reduces
the complexity of models compared to existing approaches in terms of model size
and operations. Overall, our experimental results demonstrate that DeepTrack
achieves comparable accuracy to state-of-the-art trajectory prediction models
but with smaller model sizes and lower computational complexity, making it more
suitable for real-world deployment.
","[{'version': 'v1', 'created': 'Sun, 1 Aug 2021 17:33:04 GMT'}, {'version': 'v2', 'created': 'Wed, 25 May 2022 20:03:30 GMT'}]",2022-05-27,"[['Katariya', 'Vinit', ''], ['Baharani', 'Mohammadreza', ''], ['Morris', 'Nichole', ''], ['Shoghli', 'Omidreza', ''], ['Tabkhi', 'Hamed', '']]","['Vehicle trajectory prediction', 'Deep Learning', 'Temporal Convolutions', 'DeepTrack']"
12709,2006.00894,Jinhan Kim,"Jinhan Kim, Jeongil Ju, Robert Feldt, Shin Yoo","Reducing DNN Labelling Cost using Surprise Adequacy: An Industrial Case
  Study for Autonomous Driving","to be published in Proceedings of the 28th ACM Joint European
  Software Engineering Conference and Symposium on the Foundations of Software
  Engineering",,10.1145/3368089.3417065,,cs.LG cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep Neural Networks (DNNs) are rapidly being adopted by the automotive
industry, due to their impressive performance in tasks that are essential for
autonomous driving. Object segmentation is one such task: its aim is to
precisely locate boundaries of objects and classify the identified objects,
helping autonomous cars to recognise the road environment and the traffic
situation. Not only is this task safety critical, but developing a DNN based
object segmentation module presents a set of challenges that are significantly
different from traditional development of safety critical software. The
development process in use consists of multiple iterations of data collection,
labelling, training, and evaluation. Among these stages, training and
evaluation are computation intensive while data collection and labelling are
manual labour intensive. This paper shows how development of DNN based object
segmentation can be improved by exploiting the correlation between Surprise
Adequacy (SA) and model performance. The correlation allows us to predict model
performance for inputs without manually labelling them. This, in turn, enables
understanding of model performance, more guided data collection, and informed
decisions about further training. In our industrial case study the technique
allows cost savings of up to 50% with negligible evaluation inaccuracy.
Furthermore, engineers can trade off cost savings versus the tolerable level of
inaccuracy depending on different development phases and scenarios.
","[{'version': 'v1', 'created': 'Fri, 29 May 2020 06:33:55 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Sep 2020 05:43:23 GMT'}]",2022-09-15,"[['Kim', 'Jinhan', ''], ['Ju', 'Jeongil', ''], ['Feldt', 'Robert', ''], ['Yoo', 'Shin', '']]","['Software Testing', 'Autonomous Driving', 'Deep Neural Network']"
12710,1906.09182,Nishant Saurabh,"Nishant Saurabh, Dragi Kimovski, Simon Ostermann, Radu Prodan","VM Image Repository and Distribution Models for Federated Clouds: State
  of the Art, Possible Directions and Open Issues","MI storage repository, VMI distribution, Federated cloud",Euro-Par 2016: Euro-Par 2016: Parallel Processing Workshops,10.1007/978-3-319-58943-5_21,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The emerging trend of Federated Cloud models enlist virtualization as a
significant concept to offer a large scale distributed Infrastructure as a
Service collaborative paradigm to end users. Virtualization leverage Virtual
Machines (VM) instantiated from user specific templates labelled as VM Images
(VMI). To this extent, the rapid provisioning of VMs with varying user requests
ensuring Quality of Service (QoS) across multiple cloud providers largely
depends upon the image repository architecture and distribution policies. We
discuss the possible state-of-art in VMI storage repository and distribution
mechanisms for efficient VM provisioning in federated clouds. In addition, we
present and compare various representative systems in this realm. Furthermore,
we define a design space, identify current limitations, challenges and open
trends for VMI repositories and distribution techniques within federated
infrastructure.
","[{'version': 'v1', 'created': 'Fri, 21 Jun 2019 15:04:49 GMT'}]",2019-06-24,"[['Saurabh', 'Nishant', ''], ['Kimovski', 'Dragi', ''], ['Ostermann', 'Simon', ''], ['Prodan', 'Radu', '']]","['VMI Storage Repository', 'VMI Distribution', 'Federated Cloud']"
12711,1908.09032,Vipin Singh Sehrawat,Vipin Singh Sehrawat and Yvo Desmedt,"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable
  Encryption","This is the full version of the paper that appears in Cryptology and
  Network Security 2019, LNCS, Springer, Volume 11829, pp. 3-23","Cryptology and Network Security 2019, LNCS, Springer, Volume
  11829, pp. 3-23",10.1007/978-3-030-31578-8_1,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We define a pseudorandom function (PRF) $F: \mathcal{K} \times \mathcal{X}
\rightarrow \mathcal{Y}$ to be bi-homomorphic when it is fully Key homomorphic
and partially Input Homomorphic (KIH), i.e., given $F(k_1, x_1)$ and $F(k_2,
x_2)$, there is an efficient algorithm to compute $F(k_1 \oplus k_2, x_1
\ominus x_2)$, where $\oplus$ and $\ominus$ are (binary) group operations. The
homomorphism on the input is restricted to a fixed subset of the input bits,
i.e., $\ominus$ operates on some pre-decided $m$-out-of-$n$ bits, where $|x_1|
= |x_2| = n$, and the remaining $n-m$ bits are identical in both inputs. In
addition, the output length, $\ell$, of the operator $\ominus$ is not fixed and
is defined as $n \leq \ell \leq 2n$, hence leading to Homomorphically induced
Variable input Length (HVL) as $n \leq |x_1 \ominus x_2| \leq 2n$. We present a
learning with errors (LWE) based construction for a HVL-KIH-PRF family. Our
construction is inspired by the key homomorphic PRF construction due to
Banerjee and Peikert (Crypto 2014).
  An updatable encryption scheme allows rotations of the encryption key, i.e.,
moving existing ciphertexts from old to new key. These updates are carried out
via \emph{update tokens}, which can be used by an untrusted party since the
update procedure does not involve decryption of the ciphertext. We use our
novel PRF family to construct an updatable encryption scheme, named QPC-UE-UU,
which is quantum-safe, post-compromise secure and supports unidirectional
ciphertext updates, i.e., the update tokens can be used to perform ciphertext
updates but they cannot be used to undo already completed updates. Our PRF
family also leads to the first left/right key homomorphic constrained-PRF
family with HVL.
","[{'version': 'v1', 'created': 'Fri, 23 Aug 2019 20:37:10 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Oct 2019 01:13:10 GMT'}, {'version': 'v3', 'created': 'Thu, 20 Aug 2020 02:10:22 GMT'}, {'version': 'v4', 'created': 'Fri, 21 Aug 2020 13:32:35 GMT'}]",2020-08-24,"[['Sehrawat', 'Vipin Singh', ''], ['Desmedt', 'Yvo', '']]","['Bi-Homomorphic PRF', 'Constrained-PRF', 'LWE', 'LWR', 'Updatable Encryption', 'Unidirectional Updates', 'Post-Compromise Security']"
12712,2111.09863,Dimitrios Miltiadou,"Dimitrios Miltiadou (1), Stamatis Pitsios (1), Dimitrios Spyropoulos
  (1), Dimitrios Alexandrou (1), Fenareti Lampathaki (2), Domenico Messina (3),
  Konstantinos Perakis (1) ((1) UBITECH, (2) Suite5, (3) ENGINEERING Ingegneria
  Informatica S.p.A.)","A Secure Experimentation Sandbox for the design and execution of trusted
  and secure analytics in the aviation domain",,"LNICST (2021), volume 344, pp 120-134",10.1007/978-3-030-66922-5_8,,cs.CR cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The aviation industry as well as the industries that benefit and are linked
to it are ripe for innovation in the form of Big Data analytics. The number of
available big data technologies is constantly growing, while at the same time
the existing ones are rapidly evolving and empowered with new features.
However, the Big Data era imposes the crucial challenge of how to effectively
handle information security while managing massive and rapidly evolving data
from heterogeneous data sources. While multiple technologies have emerged,
there is a need to find a balance between multiple security requirements,
privacy obligations, system performance and rapid dynamic analysis on large
datasets. The current paper aims to introduce the ICARUS Secure Experimentation
Sandbox of the ICARUS platform. The ICARUS platform aims to provide a big
data-enabled platform that aspires to become an 'one-stop shop' for aviation
data and intelligence marketplace that provides a trusted and secure
'sandboxed' analytics workspace, allowing the exploration, integration and deep
analysis of original and derivative data in a trusted and fair manner. Towards
this end, a Secure Experimentation Sandbox has been designed and integrated in
the ICARUS platform offering, that enables the provisioning of a sophisticated
environment that can completely guarantee the safety and confidentiality of
data, allowing to any interested party to utilise the platform to conduct
analytical experiments in closed-lab conditions.
","[{'version': 'v1', 'created': 'Thu, 18 Nov 2021 18:44:29 GMT'}]",2021-11-19,"[['Miltiadou', 'Dimitrios', ''], ['Pitsios', 'Stamatis', ''], ['Spyropoulos', 'Dimitrios', ''], ['Alexandrou', 'Dimitrios', ''], ['Lampathaki', 'Fenareti', ''], ['Messina', 'Domenico', ''], ['Perakis', 'Konstantinos', '']]","['Big Data', 'Security', 'Privacy', 'Cybersecurity', 'Data Analytics']"
12713,2010.15032,Daniel Barcelona-Pons,Daniel Barcelona-Pons and Pedro Garc\'ia-L\'opez,Benchmarking Parallelism in FaaS Platforms,"19 pages, 15 figures, submitted to FGCS, revised",,10.1016/j.future.2021.06.005,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Serverless computing has seen a myriad of work exploring its potential. Some
systems tackle Function-as-a-Service (FaaS) properties on automatic elasticity
and scale to run highly-parallel computing jobs. However, they focus on
specific platforms and convey that their ideas can be extrapolated to any FaaS
runtime.
  An important question arises: do all FaaS platforms fit parallel
computations? In this paper, we argue that not all of them provide the
necessary means to host highly-parallel applications. To validate our
hypothesis, we create a comparative framework and categorize the architectures
of four cloud FaaS offerings, emphasizing parallel performance. We attest and
extend this description with an empirical experiment that consists in plotting
in deep detail the evolution of a parallel computing job on each service.
  The analysis of our results evinces that FaaS is not inherently good for
parallel computations and architectural differences across platforms are
decisive to categorize their performance. A key insight is the importance of
virtualization technologies and the scheduling approach of FaaS platforms.
Parallelism improves with lighter virtualization and proactive scheduling due
to finer resource allocation and faster elasticity. This causes some platforms
like AWS and IBM to perform well for highly-parallel computations, while others
such as Azure present difficulties to achieve the required parallelism degree.
Consequently, the information in this paper becomes of special interest to help
users choose the most adequate infrastructure for their parallel applications.
","[{'version': 'v1', 'created': 'Wed, 28 Oct 2020 15:09:55 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Oct 2020 13:21:59 GMT'}, {'version': 'v3', 'created': 'Tue, 1 Jun 2021 13:45:30 GMT'}]",2021-06-16,"[['Barcelona-Pons', 'Daniel', ''], ['García-López', 'Pedro', '']]","['Serverless', 'FaaS', 'parallelism', 'benchmark']"
12714,2204.10419,Oliver Limoyo,"Oliver Limoyo, Trevor Ablett, and Jonathan Kelly","Learning Sequential Latent Variable Models from Multimodal Time Series
  Data","In: Petrovic, I., Menegatti, E., Markovi\'c, I. (eds) Intelligent
  Autonomous Systems 17. IAS 2022. Lecture Notes in Networks and Systems, vol
  577. Springer, Cham",,10.1007/978-3-031-22216-0_35,,cs.LG cs.AI cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sequential modelling of high-dimensional data is an important problem that
appears in many domains including model-based reinforcement learning and
dynamics identification for control. Latent variable models applied to
sequential data (i.e., latent dynamics models) have been shown to be a
particularly effective probabilistic approach to solve this problem, especially
when dealing with images. However, in many application areas (e.g., robotics),
information from multiple sensing modalities is available -- existing latent
dynamics methods have not yet been extended to effectively make use of such
multimodal sequential data. Multimodal sensor streams can be correlated in a
useful manner and often contain complementary information across modalities. In
this work, we present a self-supervised generative modelling framework to
jointly learn a probabilistic latent state representation of multimodal data
and the respective dynamics. Using synthetic and real-world datasets from a
multimodal robotic planar pushing task, we demonstrate that our approach leads
to significant improvements in prediction and representation quality.
Furthermore, we compare to the common learning baseline of concatenating each
modality in the latent space and show that our principled probabilistic
formulation performs better. Finally, despite being fully self-supervised, we
demonstrate that our method is nearly as effective as an existing supervised
approach that relies on ground truth labels.
","[{'version': 'v1', 'created': 'Thu, 21 Apr 2022 21:59:24 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Jan 2023 07:11:44 GMT'}]",2023-01-23,"[['Limoyo', 'Oliver', ''], ['Ablett', 'Trevor', ''], ['Kelly', 'Jonathan', '']]","['Data Fusion and Machine Learning', 'Robot Vision', 'Intelligent Perceptions']"
12715,2205.06980,Antonio Javier Gallego,"Samer Alashhab, Antonio Javier Gallego, Miguel \'Angel Lozano","Efficient Gesture Recognition for the Assistance of Visually Impaired
  People using Multi-Head Neural Networks",,"Engineering Applications of Artificial Intelligence, 2022",10.1016/j.engappai.2022.105188,114,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper proposes an interactive system for mobile devices controlled by
hand gestures aimed at helping people with visual impairments. This system
allows the user to interact with the device by making simple static and dynamic
hand gestures. Each gesture triggers a different action in the system, such as
object recognition, scene description or image scaling (e.g., pointing a finger
at an object will show a description of it). The system is based on a
multi-head neural network architecture, which initially detects and classifies
the gestures, and subsequently, depending on the gesture detected, performs a
second stage that carries out the corresponding action. This multi-head
architecture optimizes the resources required to perform different tasks
simultaneously, and takes advantage of the information obtained from an initial
backbone to perform different processes in a second stage. To train and
evaluate the system, a dataset with about 40k images was manually compiled and
labeled including different types of hand gestures, backgrounds (indoors and
outdoors), lighting conditions, etc. This dataset contains synthetic gestures
(whose objective is to pre-train the system in order to improve the results)
and real images captured using different mobile phones. The results obtained
and the comparison made with the state of the art show competitive results as
regards the different actions performed by the system, such as the accuracy of
classification and localization of gestures, or the generation of descriptions
for objects and scenes.
","[{'version': 'v1', 'created': 'Sat, 14 May 2022 06:01:47 GMT'}]",2022-07-27,"[['Alashhab', 'Samer', ''], ['Gallego', 'Antonio Javier', ''], ['Lozano', 'Miguel Ángel', '']]","['Multi-head architectures', 'Hand gesture detection', 'Visual impairments', 'Deep Neural Networks']"
12716,2009.04234,Alfonso Alcantara,"Alfonso Alc\'antara, Jes\'us Capit\'an, Rita Cunha, An\'ibal Ollero","Optimal Trajectory Planning for Cinematography with Multiple Unmanned
  Aerial Vehicles","This paper has been published as: Optimal trajectory planning for
  cinematography with multiple Unmanned Aerial Vehicles. Alfonso Alcantara and
  Jesus Capitan and Rita Cunha and Anibal Ollero. Robotics and Autonomous
  Systems. 103778 (2021) 10.1016/j.robot.2021.103778",Robotics and Autonomous Systems. 103778 (2021),10.1016/j.robot.2021.103778,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a method for planning optimal trajectories with a team of
Unmanned Aerial Vehicles (UAVs) performing autonomous cinematography. The
method is able to plan trajectories online and in a distributed manner,
providing coordination between the UAVs. We propose a novel non-linear
formulation for this challenging problem of computing multi-UAV optimal
trajectories for cinematography; integrating UAVs dynamics and collision
avoidance constraints, together with cinematographic aspects like smoothness,
gimbal mechanical limits and mutual camera visibility. We integrate our method
within a hardware and software architecture for UAV cinematography that was
previously developed within the framework of the MultiDrone project; and
demonstrate its use with different types of shots filming a moving target
outdoors. We provide extensive experimental results both in simulation and
field experiments. We analyze the performance of the method and prove that it
is able to compute online smooth trajectories, reducing jerky movements and
complying with cinematography constraints.
","[{'version': 'v1', 'created': 'Wed, 9 Sep 2020 11:55:27 GMT'}, {'version': 'v2', 'created': 'Mon, 5 Apr 2021 08:56:10 GMT'}]",2021-04-06,"[['Alcántara', 'Alfonso', ''], ['Capitán', 'Jesús', ''], ['Cunha', 'Rita', ''], ['Ollero', 'Aníbal', '']]","['Optimal trajectory planning', 'UAV cinematography', 'Multi-UAV coordination']"
12717,2001.07283,Daniela Briola,"Oscar Cornejo, Daniela Briola, Daniela Micucci, Leonardo Mariani",In-The-Field Monitoring of Functional Calls: Is It Feasible?,,,10.1016/j.jss.2020.110523,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Collecting data about the sequences of function calls executed by an
application while running in the field can be useful to a number of
applications, including failure reproduction, profiling, and debugging.
Unfortunately, collecting data from the field may introduce annoying slowdowns
that negatively affect the quality of the user experience. So far, the impact
of monitoring has been mainly studied in terms of the overhead that it may
introduce in the monitored applications, rather than considering if the
introduced overhead can be really recognized by users. In this paper we take a
different perspective studying to what extent collecting data about sequences
of function calls may impact the quality of the user experience, producing
recognizable effects. Interestingly we found that, depending on the nature of
the executed operation and its execution context, users may tolerate a
non-trivial overhead. This information can be potentially exploited to collect
significant amount of data without annoying users.
","[{'version': 'v1', 'created': 'Mon, 20 Jan 2020 23:32:33 GMT'}]",2020-01-22,"[['Cornejo', 'Oscar', ''], ['Briola', 'Daniela', ''], ['Micucci', 'Daniela', ''], ['Mariani', 'Leonardo', '']]","['Monitoring', 'dynamic analysis', 'user experience']"
12718,2004.14561,Yong Kiam Tan,"Yong Kiam Tan, Andr\'e Platzer","An Axiomatic Approach to Existence and Liveness for Differential
  Equations",Significantly extended version of arXiv:1904.07984,"Formal Aspects of Computing 33, pp. 461-518, 2021",10.1007/s00165-020-00525-0,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents an axiomatic approach for deductive verification of
existence and liveness for ordinary differential equations (ODEs) with
differential dynamic logic (dL). The approach yields proofs that the solution
of a given ODE exists long enough to reach a given target region without
leaving a given evolution domain. Numerous subtleties complicate the
generalization of discrete liveness verification techniques, such as loop
variants, to the continuous setting. For example, ODE solutions may blow up in
finite time or their progress towards the goal may converge to zero. These
subtleties are handled in dL by successively refining ODE liveness properties
using ODE invariance properties which have a complete axiomatization. This
approach is widely applicable: several liveness arguments from the literature
are surveyed and derived as special instances of axiomatic refinement in dL.
These derivations also correct several soundness errors in the surveyed
literature, which further highlights the subtlety of ODE liveness reasoning and
the utility of an axiomatic approach. An important special case of this
approach deduces (global) existence properties of ODEs, which are a fundamental
part of every ODE liveness argument. Thus, all generalizations of existence
properties and their proofs immediately lead to corresponding generalizations
of ODE liveness arguments. Overall, the resulting library of common refinement
steps enables both the sound development and justification of new ODE existence
and of liveness proof rules from dL axioms. These insights are put into
practice through an implementation of ODE liveness proofs in the KeYmaera X
theorem prover for hybrid systems.
","[{'version': 'v1', 'created': 'Thu, 30 Apr 2020 03:30:53 GMT'}, {'version': 'v2', 'created': 'Sun, 9 Aug 2020 14:29:39 GMT'}]",2021-09-08,"[['Tan', 'Yong Kiam', ''], ['Platzer', 'André', '']]","['differential equations', 'liveness', 'global existence', 'differential dynamic logic']"
12719,2104.08030,Young Hwi Kim,"Young Hwi Kim, Seonghyeon Nam, and Seon Joo Kim","Temporally smooth online action detection using cycle-consistent future
  anticipation",Accepted by Pattern Recognition,"Pattern Recognition, Volume 116, August 2021, 107954",10.1016/j.patcog.2021.107954,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Many video understanding tasks work in the offline setting by assuming that
the input video is given from the start to the end. However, many real-world
problems require the online setting, making a decision immediately using only
the current and the past frames of videos such as in autonomous driving and
surveillance systems. In this paper, we present a novel solution for online
action detection by using a simple yet effective RNN-based networks called the
Future Anticipation and Temporally Smoothing network (FATSnet). The proposed
network consists of a module for anticipating the future that can be trained in
an unsupervised manner with the cycle-consistency loss, and another component
for aggregating the past and the future for temporally smooth frame-by-frame
predictions. We also propose a solution to relieve the performance loss when
running RNN-based models on very long sequences. Evaluations on TVSeries,
THUMOS14, and BBDB show that our method achieve the state-of-the-art
performances compared to the previous works on online action detection.
","[{'version': 'v1', 'created': 'Fri, 16 Apr 2021 11:00:19 GMT'}]",2021-04-19,"[['Kim', 'Young Hwi', ''], ['Nam', 'Seonghyeon', ''], ['Kim', 'Seon Joo', '']]","['Online Action Detection', 'Cycle-consistency', 'Temporal Smoothing', 'Video Understanding']"
12720,2008.01546,Tarik A. Rashid,"Hozan K. Hamarashid, Soran A. Saeed and Tarik A. Rashid","Next word prediction based on the N-gram model for Kurdish Sorani and
  Kurmanji",37 pages,"Neural Computing and Applications, NCAA-D-19-02773R1, 2020",10.1007/s00521-020-05245-3,,cs.CL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Next word prediction is an input technology that simplifies the process of
typing by suggesting the next word to a user to select, as typing in a
conversation consumes time. A few previous studies have focused on the Kurdish
language, including the use of next word prediction. However, the lack of a
Kurdish text corpus presents a challenge. Moreover, the lack of a sufficient
number of N-grams for the Kurdish language, for instance, five grams, is the
reason for the rare use of next Kurdish word prediction. Furthermore, the
improper display of several Kurdish letters in the Rstudio software is another
problem. This paper provides a Kurdish corpus, creates five, and presents a
unique research work on next word prediction for Kurdish Sorani and Kurmanji.
The N-gram model has been used for next word prediction to reduce the amount of
time while typing in the Kurdish language. In addition, little work has been
conducted on next Kurdish word prediction; thus, the N-gram model is utilized
to suggest text accurately. To do so, R programming and RStudio are used to
build the application. The model is 96.3% accurate.
","[{'version': 'v1', 'created': 'Mon, 27 Jul 2020 20:45:13 GMT'}]",2020-08-05,"[['Hamarashid', 'Hozan K.', ''], ['Saeed', 'Soran A.', ''], ['Rashid', 'Tarik A.', '']]","['Next word prediction', 'Kurdish language', 'N-gram', 'Corpus']"
12721,2202.14005,Moritz Blumenthal,"Moritz Blumenthal and Guanxiong Luo and Martin Schilling and H.
  Christian M. Holme and Martin Uecker","Deep, Deep Learning with BART",Submitted to Magnetic Resonance in Medicine,Magnetic Resonance in Medicine 2022;89:678-693,10.1002/mrm.29485,,cs.CV eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose: To develop a deep-learning-based image reconstruction framework for
reproducible research in MRI.
  Methods: The BART toolbox offers a rich set of implementations of calibration
and reconstruction algorithms for parallel imaging and compressed sensing. In
this work, BART was extended by a non-linear operator framework that provides
automatic differentiation to allow computation of gradients. Existing
MRI-specific operators of BART, such as the non-uniform fast Fourier transform,
are directly integrated into this framework and are complemented by common
building blocks used in neural networks. To evaluate the use of the framework
for advanced deep-learning-based reconstruction, two state-of-the-art unrolled
reconstruction networks, namely the Variational Network [1] and MoDL [2], were
implemented.
  Results: State-of-the-art deep image-reconstruction networks can be
constructed and trained using BART's gradient based optimization algorithms.
The BART implementation achieves a similar performance in terms of training
time and reconstruction quality compared to the original implementations based
on TensorFlow.
  Conclusion: By integrating non-linear operators and neural networks into
BART, we provide a general framework for deep-learning-based reconstruction in
MRI.
","[{'version': 'v1', 'created': 'Mon, 28 Feb 2022 18:23:41 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Sep 2022 12:05:08 GMT'}]",2022-12-13,"[['Blumenthal', 'Moritz', ''], ['Luo', 'Guanxiong', ''], ['Schilling', 'Martin', ''], ['Holme', 'H. Christian M.', ''], ['Uecker', 'Martin', '']]","['MRI', 'image reconstruction', 'inverse problems', 'deep learning', 'parallel imaging', 'automatic differentiation']"
12722,2104.05125,Evgeny Toropov,"Evgeny Toropov, Paola A. Buitrago, Jose M. F. Moura",Shuffler: A Large Scale Data Management Tool for ML in Computer Vision,,PEARC 2019 Article No 23,10.1145/3332186.3333046,,cs.CV cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Datasets in the computer vision academic research community are primarily
static. Once a dataset is accepted as a benchmark for a computer vision task,
researchers working on this task will not alter it in order to make their
results reproducible. At the same time, when exploring new tasks and new
applications, datasets tend to be an ever changing entity. A practitioner may
combine existing public datasets, filter images or objects in them, change
annotations or add new ones to fit a task at hand, visualize sample images, or
perhaps output statistics in the form of text or plots. In fact, datasets
change as practitioners experiment with data as much as with algorithms, trying
to make the most out of machine learning models. Given that ML and deep
learning call for large volumes of data to produce satisfactory results, it is
no surprise that the resulting data and software management associated to
dealing with live datasets can be quite complex. As far as we know, there is no
flexible, publicly available instrument to facilitate manipulating image data
and their annotations throughout a ML pipeline. In this work, we present
Shuffler, an open source tool that makes it easy to manage large computer
vision datasets. It stores annotations in a relational, human-readable
database. Shuffler defines over 40 data handling operations with annotations
that are commonly useful in supervised learning applied to computer vision and
supports some of the most well-known computer vision datasets. Finally, it is
easily extensible, making the addition of new operations and datasets a task
that is fast and easy to accomplish.
","[{'version': 'v1', 'created': 'Sun, 11 Apr 2021 22:27:28 GMT'}]",2021-04-13,"[['Toropov', 'Evgeny', ''], ['Buitrago', 'Paola A.', ''], ['Moura', 'Jose M. F.', '']]","['data managing', 'machine learning', 'computer vision', 'big data', 'datareuse']"
12723,1604.02879,Marek Szyku{\l}a,Marek Szyku{\l}a and Vojt\v{e}ch Vorel,An Extremal Series of Eulerian Synchronizing Automata,"The final publication is available at Springer via
  http://dx.doi.org/10.1007/978-3-662-53132-7_31","Developments in Language Theory (DLT 2016), volume 9840 of LNCS,
  pages 380--392, 2016",10.1007/978-3-662-53132-7_31,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an infinite series of $n$-state Eulerian automata whose reset
words have length at least $(n^2-3)/2$. This improves the current lower bound
on the length of shortest reset words in Eulerian automata. We conjecture that
$(n^2-3)/2$ also forms an upper bound for this class and we experimentally
verify it for small automata by an exhaustive computation.
","[{'version': 'v1', 'created': 'Mon, 11 Apr 2016 10:50:46 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Aug 2016 17:45:38 GMT'}]",2016-08-04,"[['Szykuła', 'Marek', ''], ['Vorel', 'Vojtěch', '']]","['Eulerian automaton', 'reset threshold', 'reset word', 'synchronizing automaton']"
12724,2104.06552,Jennifer Healey,"Victor S. Bursztyn (1), Jennifer Healey (2), Eunyee Koh (2), Nedim
  Lipka (2), Larry Birnbaum (1) ((1) Northwestern University, (2) Adobe)","Developing a Conversational Recommendation System for Navigating Limited
  Options","7 pages, 4 figures, to appear in CHI 2021 as a Late Breaking Work,
  see ""https://chi2021.acm.org/""",,10.1145/3411763.3451596,,cs.CL cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We have developed a conversational recommendation system designed to help
users navigate through a set of limited options to find the best choice. Unlike
many internet scale systems that use a singular set of search terms and return
a ranked list of options from amongst thousands, our system uses multi-turn
user dialog to deeply understand the users preferences. The system responds in
context to the users specific and immediate feedback to make sequential
recommendations. We envision our system would be highly useful in situations
with intrinsic constraints, such as finding the right restaurant within walking
distance or the right retail item within a limited inventory. Our research
prototype instantiates the former use case, leveraging real data from Google
Places, Yelp, and Zomato. We evaluated our system against a similar system that
did not incorporate user feedback in a 16 person remote study, generating 64
scenario-based search journeys. When our recommendation system was successfully
triggered, we saw both an increase in efficiency and a higher confidence rating
with respect to final user choice. We also found that users preferred our
system (75%) compared with the baseline.
","[{'version': 'v1', 'created': 'Tue, 13 Apr 2021 23:46:10 GMT'}]",2021-04-15,"[['Bursztyn', 'Victor S.', '', 'Northwestern University'], ['Healey', 'Jennifer', '', 'Adobe'], ['Koh', 'Eunyee', '', 'Adobe'], ['Lipka', 'Nedim', '', 'Adobe'], ['Birnbaum', 'Larry', '', 'Northwestern University']]","['recommendation system', 'conversational', 'natural language processing', 'agreement', 'interactive']"
12725,1601.01498,Ali Gholami,"Ali Gholami, Erwin Laure","Security and Privacy of Sensitive Data in Cloud Computing: A Survey of
  Recent Developments",,,10.5121/csit.2015.51611,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing is revolutionizing many ecosystems by providing organizations
with computing resources featuring easy deployment, connectivity,
configuration, automation and scalability. This paradigm shift raises a broad
range of security and privacy issues that must be taken into consideration.
Multi-tenancy, loss of control, and trust are key challenges in cloud computing
environments. This paper reviews the existing technologies and a wide array of
both earlier and state-of-the-art projects on cloud security and privacy. We
categorize the existing research according to the cloud reference architecture
orchestration, resource control, physical resource, and cloud service
management layers, in addition to reviewing the existing developments in
privacy-preserving sensitive data approaches in cloud computing such as privacy
threat modeling and privacy enhancing protocols and solutions.
","[{'version': 'v1', 'created': 'Thu, 7 Jan 2016 11:53:20 GMT'}]",2016-01-08,"[['Gholami', 'Ali', ''], ['Laure', 'Erwin', '']]","['Cloud Security', 'Privacy', 'Trust', 'Virtualization', 'Data Protection']"
12726,1910.00262,Helge Spieker,"Helge Spieker, Arnaud Gotlieb",Adaptive Metamorphic Testing with Contextual Bandits,,Journal of Systems and Software (JSS) Vol. 165 (2020) 110574,10.1016/j.jss.2020.110574,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Metamorphic Testing is a software testing paradigm which aims at using
necessary properties of a system-under-test, called metamorphic relations, to
either check its expected outputs, or to generate new test cases. Metamorphic
Testing has been successful to test programs for which a full oracle is not
available or to test programs for which there are uncertainties on expected
outputs such as learning systems. In this article, we propose Adaptive
Metamorphic Testing as a generalization of a simple yet powerful reinforcement
learning technique, namely contextual bandits, to select one of the multiple
metamorphic relations available for a program. By using contextual bandits,
Adaptive Metamorphic Testing learns which metamorphic relations are likely to
transform a source test case, such that it has higher chance to discover
faults. We present experimental results over two major case studies in machine
learning, namely image classification and object detection, and identify
weaknesses and robustness boundaries. Adaptive Metamorphic Testing efficiently
identifies weaknesses of the tested systems in context of the source test case.
","[{'version': 'v1', 'created': 'Tue, 1 Oct 2019 08:56:38 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Jan 2020 16:07:27 GMT'}, {'version': 'v3', 'created': 'Fri, 13 Mar 2020 11:09:41 GMT'}]",2020-06-23,"[['Spieker', 'Helge', ''], ['Gotlieb', 'Arnaud', '']]","['Software Testing', 'Metamorphic Testing', 'Contextual Bandits', 'Machine Learning']"
12727,1910.04792,Shruti Jadon,"Shruti Jadon, Mahmood Jasim","Unsupervised video summarization framework using keyframe extraction and
  video skimming","5 pages, 3 figures. Technical Report","2020 IEEE 5th International Conference on Computing Communication
  and Automation (ICCCA)",10.1109/ICCCA49541.2020.9250764,140 - 145,cs.IR cs.CV cs.LG eess.IV,http://creativecommons.org/licenses/by/4.0/,"  Video is one of the robust sources of information and the consumption of
online and offline videos has reached an unprecedented level in the last few
years. A fundamental challenge of extracting information from videos is a
viewer has to go through the complete video to understand the context, as
opposed to an image where the viewer can extract information from a single
frame. Apart from context understanding, it almost impossible to create a
universal summarized video for everyone, as everyone has their own bias of
keyframe, e.g; In a soccer game, a coach person might consider those frames
which consist of information on player placement, techniques, etc; however, a
person with less knowledge about a soccer game, will focus more on frames which
consist of goals and score-board. Therefore, if we were to tackle problem video
summarization through a supervised learning path, it will require extensive
personalized labeling of data. In this paper, we attempt to solve video
summarization through unsupervised learning by employing traditional
vision-based algorithmic methodologies for accurate feature extraction from
video frames. We have also proposed a deep learning-based feature extraction
followed by multiple clustering methods to find an effective way of summarizing
a video by interesting key-frame extraction. We have compared the performance
of these approaches on the SumMe dataset and showcased that using deep
learning-based feature extraction has been proven to perform better in case of
dynamic viewpoint videos.
","[{'version': 'v1', 'created': 'Thu, 10 Oct 2019 18:14:48 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Jun 2020 18:27:25 GMT'}]",2020-11-17,"[['Jadon', 'Shruti', ''], ['Jasim', 'Mahmood', '']]","['Video Summarization', 'Vision', 'Deep Learning']"
12728,2104.11385,Michael Rowan,"Michael E. Rowan, Axel Huebl, Kevin N. Gott, Jack Deslippe, Maxence
  Th\'evenet, Remi Lehe, Jean-Luc Vay","In-Situ Assessment of Device-Side Compute Work for Dynamic Load
  Balancing in a GPU-Accelerated PIC Code","11 pages, 8 figures. Paper accepted in the Platform for Advanced
  Scientific Computing Conference (PASC '21), July 5 to 9, 2021, Geneva,
  Switzerland","PASC 2021: Proceedings of the Platform for Advanced Scientific
  Computing Conference",10.1145/3468267.3470614,,cs.DC physics.acc-ph physics.comp-ph physics.plasm-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Maintaining computational load balance is important to the performant
behavior of codes which operate under a distributed computing model. This is
especially true for GPU architectures, which can suffer from memory
oversubscription if improperly load balanced. We present enhancements to
traditional load balancing approaches and explicitly target GPU architectures,
exploring the resulting performance. A key component of our enhancements is the
introduction of several GPU-amenable strategies for assessing compute work.
These strategies are implemented and benchmarked to find the most optimal data
collection methodology for in-situ assessment of GPU compute work. For the
fully kinetic particle-in-cell code WarpX, which supports MPI+CUDA parallelism,
we investigate the performance of the improved dynamic load balancing via a
strong scaling-based performance model and show that, for a laser-ion
acceleration test problem run with up to 6144 GPUs on Summit, the enhanced
dynamic load balancing achieves from 62%--74% (88% when running on 6 GPUs) of
the theoretically predicted maximum speedup; for the 96-GPU case, we find that
dynamic load balancing improves performance relative to baselines without load
balancing (3.8x speedup) and with static load balancing (1.2x speedup). Our
results provide important insights into dynamic load balancing and performance
assessment, and are particularly relevant in the context of distributed memory
applications ran on GPUs.
","[{'version': 'v1', 'created': 'Fri, 23 Apr 2021 02:43:45 GMT'}]",2021-11-05,"[['Rowan', 'Michael E.', ''], ['Huebl', 'Axel', ''], ['Gott', 'Kevin N.', ''], ['Deslippe', 'Jack', ''], ['Thévenet', 'Maxence', ''], ['Lehe', 'Remi', ''], ['Vay', 'Jean-Luc', '']]","['Dynamic Load Balancing', 'Particle-In-Cell (PIC)', 'AMReX', 'HighPerformance Computing', 'GPU', 'CUDA']"
12729,2001.08099,Ming-Chang Lee,"Ming-Chang Lee, Jia-Chun Lin, and Olaf Owe",PDS: Deduce Elder Privacy from Smart Homes,"31 pages, 23 figures, and 2 tables, journal paper. arXiv admin note:
  text overlap with arXiv:1808.07379","Internet of Things, 7, 1000072, 2019",10.1016/j.iot.2019.100072,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the development of IoT technologies in the past few years, a wide range
of smart devices are deployed in a variety of environments aiming to improve
the quality of human life in a cost efficient way. Due to the increasingly
serious aging problem around the world, smart homes for elder healthcare have
become an important IoT-based application, which not only enables elders'
health to be properly monitored and taken care of, but also allows them to live
more comfortably and independently in their houses. However, elders' privacy
might be disclosed from smart homes due to non-fully protected network
communication. To show that elders' privacy could be substantially exposed, in
this paper we develop a Privacy Deduction Scheme (PDS for short) by
eavesdropping sensor traffic from a smart home to identify elders' movement
activities and speculating sensor locations in the smart home based on a series
of deductions from the viewpoint of an attacker. The experimental results based
on sensor datasets from real smart homes demonstrate the effectiveness of PDS
in deducing and disclosing elders' privacy, which might be maliciously
exploited by attackers to endanger elders and their properties.
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2020 13:55:40 GMT'}]",2020-01-23,"[['Lee', 'Ming-Chang', ''], ['Lin', 'Jia-Chun', ''], ['Owe', 'Olaf', '']]","['Internet of Things', 'IoT', 'Smart Home', 'Privacy', 'Deduction', 'Association']"
12730,1810.05246,Chris Donahue,"Chris Donahue, Ian Simon, Sander Dieleman",Piano Genie,Published as a conference paper at ACM IUI 2019,,10.1145/3301275.3302288,,cs.LG cs.HC cs.SD eess.AS stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present Piano Genie, an intelligent controller which allows non-musicians
to improvise on the piano. With Piano Genie, a user performs on a simple
interface with eight buttons, and their performance is decoded into the space
of plausible piano music in real time. To learn a suitable mapping procedure
for this problem, we train recurrent neural network autoencoders with discrete
bottlenecks: an encoder learns an appropriate sequence of buttons corresponding
to a piano piece, and a decoder learns to map this sequence back to the
original piece. During performance, we substitute a user's input for the
encoder output, and play the decoder's prediction each time the user presses a
button. To improve the intuitiveness of Piano Genie's performance behavior, we
impose musically meaningful constraints over the encoder's outputs.
","[{'version': 'v1', 'created': 'Thu, 11 Oct 2018 21:00:44 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Mar 2019 08:53:31 GMT'}]",2019-03-25,"[['Donahue', 'Chris', ''], ['Simon', 'Ian', ''], ['Dieleman', 'Sander', '']]","['Augmented intelligence', 'discrete representation learning', 'generative modeling', 'piano', 'music', 'real-time', 'web']"
12731,1506.06038,Vitaly Perevoshchikov,Manfred Droste and Vitaly Perevoshchikov,"A Nivat Theorem for Weighted Timed Automata and Weighted Relative
  Distance Logic","The final version appeared in the Proceedings of the 41st
  International Colloquium on Automata, Languages, and Programming (ICALP 2014)",,10.1007/978-3-662-43951-7_15,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Weighted timed automata (WTA) model quantitative aspects of real-time systems
like continuous consumption of memory, power or financial resources. They
accept quantitative timed languages where every timed word is mapped to a
value, e.g., a real number. In this paper, we prove a Nivat theorem for WTA
which states that recognizable quantitative timed languages are exactly those
which can be obtained from recognizable boolean timed languages with the help
of several simple operations. We also introduce a weighted extension of
relative distance logic developed by Wilke, and we show that our weighted
relative distance logic and WTA are equally expressive. The proof of this
result can be derived from our Nivat theorem and Wilke's theorem for relative
distance logic. Since the proof of our Nivat theorem is constructive, the
translation process from logic to automata and vice versa is also constructive.
This leads to decidability results for weighted relative distance logic.
","[{'version': 'v1', 'created': 'Fri, 19 Jun 2015 14:59:41 GMT'}]",2015-06-22,"[['Droste', 'Manfred', ''], ['Perevoshchikov', 'Vitaly', '']]","['Weighted timed automata', 'linearly priced timed automata', 'average behavior', 'discounting', 'Nivat’s theorem', 'quantitative logic']"
12732,2011.13162,Sebastian Baltes,Oliver Moseler and Felix Lemmer and Sebastian Baltes and Stephan Diehl,"On the diversity and frequency of code related to mathematical formulas
  in real-world Java projects","31 pages, 4 figures, 8 tables","Journal of Systems and Software, 2020",10.1016/j.jss.2020.110863,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the term formula code refers to fragments of source code that
implement a mathematical formula. We present empirical studies that analyze the
diversity and frequency of formula code in open-source-software projects. In an
exploratory study, we investigated what kinds of formulas are implemented in
real-world Java projects and derived syntactical patterns and constraints. We
refined these patterns for sum and product formulas to automatically detect
formula code in software archives and to reconstruct the implemented formula in
mathematical notation. In a quantitative study of a large sample of engineered
Java projects on GitHub we analyzed the frequency of formula code and estimated
that one of 700 lines of code in this sample implements a sum or product
formula. For a sample of scientific-computing projects, we found that one of
100 lines of code implements a sum or product formula. To assess the need for
tool support, we investigated the helpfulness of comments for program
understanding in a sample of formula-code fragments and performed an online
survey. Our findings provide first insights into the characteristics of formula
code, that can motivate further studies on the role of formula code in software
projects and the design of formula-related tools.
","[{'version': 'v1', 'created': 'Thu, 26 Nov 2020 07:19:47 GMT'}]",2020-11-30,"[['Moseler', 'Oliver', ''], ['Lemmer', 'Felix', ''], ['Baltes', 'Sebastian', ''], ['Diehl', 'Stephan', '']]","['formula code', 'qualitative study', 'code patterns', 'GitHub', 'quantitative study']"
12733,2002.06178,Greg Michaelson,"Greg Michaelson (Heriot-Watt University, United Kingdom)","Programming Paradigms, Turing Completeness and Computational Thinking",,"The Art, Science, and Engineering of Programming, 2020, Vol. 4,
  Issue 3, Article 4",10.22152/programming-journal.org/2020/4/4,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The notion of programming paradigms, with associated programming languages
and methodologies, is a well established tenet of Computer Science pedagogy,
enshrined in international curricula. However, this notion sits ill with Kuhn's
classic conceptualisation of a scientific paradigm as a dominant world view,
which supersedes its predecessors through superior explanatory power.
Furthermore, it is not at all clear how programming paradigms are to be
characterised and differentiated. Indeed, on closer inspection, apparently
disparate programming paradigms are very strongly connected. Rather, they
should be viewed as different traditions of a unitary Computer Science paradigm
of Turing complete computation complemented by Computational Thinking.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 18:56:12 GMT'}]",2020-02-17,"[['Michaelson', 'Greg', '', 'Heriot-Watt University, United Kingdom']]","['programming', 'programming language', 'paradigm', 'computational thinking', 'Turing Complete']"
12734,2103.08777,Nicole Davila,Nicole Davila and Ingrid Nunes,A Systematic Literature Review and Taxonomy of Modern Code Review,,"Journal of Systems and Software. 2021, Vol. 177: 110951",10.1016/j.jss.2021.110951,,cs.SE,http://creativecommons.org/licenses/by-sa/4.0/,"  Modern Code Review (MCR) is a widely known practice of software quality
assurance. However, the existing body of knowledge of MCR is currently not
understood as a whole. Objective: Our goal is to identify the state of the art
on MCR, providing a structured overview and an in-depth analysis of the
research done in this field. Method: We performed a systematic literature
review, selecting publications from four digital libraries. Results: A total of
139 papers were selected and analyzed in three main categories. Foundational
studies are those that analyze existing or collected data from the adoption of
MCR. Proposals consist of techniques and tools to support MCR, while
evaluations are studies to assess an approach or compare a set of them.
Conclusion: The most represented category is foundational studies, mainly
aiming to understand the motivations for adopting MCR, its challenges and
benefits, and which influence factors lead to which MCR outcomes. The most
common types of proposals are code reviewer recommender and support to code
checking. Evaluations of MCR-supporting approaches have been done mostly
offline, without involving human subjects. Five main research gaps have been
identified, which point out directions for future work in the area.
","[{'version': 'v1', 'created': 'Tue, 16 Mar 2021 00:12:19 GMT'}]",2021-04-06,"[['Davila', 'Nicole', ''], ['Nunes', 'Ingrid', '']]","['Modern code review', 'software verification', 'software quality', 'systematic literature review']"
12735,1712.05513,Umang Mathur,"P. Madhusudan, Umang Mathur, Shambwaditya Saha, Mahesh Viswanathan","A Decidable Fragment of Second Order Logic With Applications to
  Synthesis",,"27th EACSL Annual Conference on Computer Science Logic (CSL 2018),
  http://drops.dagstuhl.de/opus/volltexte/2018/9698",10.4230/LIPIcs.CSL.2018.31,,cs.LO cs.PL,http://creativecommons.org/licenses/by/4.0/,"  We propose a fragment of many-sorted second order logic called EQSMT and show
that checking satisfiability of sentences in this fragment is decidable. EQSMT
formulae have an $\exists^*\forall^*$ quantifier prefix (over variables,
functions and relations) making EQSMT conducive for modeling synthesis
problems. Moreover, EQSMT allows reasoning using a combination of background
theories provided that they have a decidable satisfiability problem for the
$\exists^*\forall^*$ FO-fragment (e.g., linear arithmetic). Our decision
procedure reduces the satisfiability of EQSMT formulae to satisfiability
queries of $\exists^*\forall^*$ formulae of each individual background theory,
allowing us to use existing efficient SMT solvers supporting
$\exists^*\forall^*$ reasoning for these theories; hence our procedure can be
seen as effectively quantified SMT (EQSMT) reasoning.
  Errata: We have modified the transformation step-2 (page 9) to correct for a
slight error. Also, the description above Theorem 10 is different from the
published version.
","[{'version': 'v1', 'created': 'Fri, 15 Dec 2017 03:03:11 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Jun 2018 03:17:10 GMT'}, {'version': 'v3', 'created': 'Thu, 27 Sep 2018 17:14:43 GMT'}]",2018-09-28,"[['Madhusudan', 'P.', ''], ['Mathur', 'Umang', ''], ['Saha', 'Shambwaditya', ''], ['Viswanathan', 'Mahesh', '']]","['second order logic', 'synthesis', 'decidable fragment']"
12736,1601.05257,Manon Kok,"Manon Kok and Thomas B. Sch\""on",Magnetometer calibration using inertial sensors,"19 pages, 8 figures","IEEE Sensors Journal, Volume 16, Issue 14, Pages 5679--5689, 2016",10.1109/JSEN.2016.2569160,,cs.SY cs.RO stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we present a practical algorithm for calibrating a magnetometer
for the presence of magnetic disturbances and for magnetometer sensor errors.
To allow for combining the magnetometer measurements with inertial measurements
for orientation estimation, the algorithm also corrects for misalignment
between the magnetometer and the inertial sensor axes. The calibration
algorithm is formulated as the solution to a maximum likelihood problem and the
computations are performed offline. The algorithm is shown to give good results
using data from two different commercially available sensor units. Using the
calibrated magnetometer measurements in combination with the inertial sensors
to determine the sensor's orientation is shown to lead to significantly
improved heading estimates.
","[{'version': 'v1', 'created': 'Wed, 20 Jan 2016 12:55:42 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Apr 2016 15:29:06 GMT'}, {'version': 'v3', 'created': 'Thu, 14 Jul 2016 12:15:52 GMT'}]",2016-07-15,"[['Kok', 'Manon', ''], ['Schön', 'Thomas B.', '']]","['Magnetometers', 'calibration', 'inertial sensors', 'maximum likelihood', 'grey-box systemidentification', 'sensor fusion']"
12737,2010.01572,Camille Goudeseune,"Camille Goudeseune, Guy Garnett, and Timothy Johnson",Resonant Processing of Instrumental Sound Controlled by Spatial Position,"Proceedings of the International Conference on New Interfaces for
  Musical Expression, 2001",,10.5281/zenodo.1176362,,cs.SD cs.HC eess.AS,http://creativecommons.org/licenses/by/4.0/,"  We present an acoustic musical instrument played through a resonance model of
another sound. The resonance model is controlled in real time as part of the
composite instrument. Our implementation uses an electric violin, whose spatial
position modifies filter parameters of the resonance model. Simplicial
interpolation defines the mapping from spatial position to filter parameters.
With some effort, pitch tracking can also control the filter parameters. The
individual technologies -- motion tracking, pitch tracking, resonance models --
are easily adapted to other instruments.
","[{'version': 'v1', 'created': 'Sun, 4 Oct 2020 12:56:41 GMT'}]",2020-10-06,"[['Goudeseune', 'Camille', ''], ['Garnett', 'Guy', ''], ['Johnson', 'Timothy', '']]","['multidimensionality', 'control', 'resonance', 'pitch tracking']"
12738,2211.14160,Jonathan Dunn,Jonathan Dunn,"Exposure and Emergence in Usage-Based Grammar: Computational Experiments
  in 35 Languages",,,10.18710/CES0L8,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  This paper uses computational experiments to explore the role of exposure in
the emergence of construction grammars. While usage-based grammars are
hypothesized to depend on a learner's exposure to actual language use, the
mechanisms of such exposure have only been studied in a few constructions in
isolation. This paper experiments with (i) the growth rate of the
constructicon, (ii) the convergence rate of grammars exposed to independent
registers, and (iii) the rate at which constructions are forgotten when they
have not been recently observed. These experiments show that the lexicon grows
more quickly than the grammar and that the growth rate of the grammar is not
dependent on the growth rate of the lexicon. At the same time,
register-specific grammars converge onto more similar constructions as the
amount of exposure increases. This means that the influence of specific
registers becomes less important as exposure increases. Finally, the rate at
which constructions are forgotten when they have not been recently observed
mirrors the growth rate of the constructicon. This paper thus presents a
computational model of usage-based grammar that includes both the emergence and
the unentrenchment of constructions.
","[{'version': 'v1', 'created': 'Fri, 25 Nov 2022 15:05:36 GMT'}]",2022-11-28,"[['Dunn', 'Jonathan', '']]","['construction grammar', 'constructions', 'usage-based', 'exposure', 'emergence']"
12739,1908.05145,Krishna Balajirao Manoorkar,"Sabine Frittella, Krishna Manoorkar, Alessandra Palmigiano, Apostolos
  Tzimoulis, Nachoem M. Wijnberg",Toward a Dempster-Shafer theory of concepts,,,10.1016/j.ijar.2020.05.004,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we generalize the basic notions and results of Dempster-Shafer
theory from predicates to formal concepts. Results include the representation
of conceptual belief functions as inner measures of suitable probability
functions, and a Dempster-Shafer rule of combination on belief functions on
formal concepts.
","[{'version': 'v1', 'created': 'Wed, 14 Aug 2019 14:27:00 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Jan 2020 15:19:00 GMT'}]",2021-05-19,"[['Frittella', 'Sabine', ''], ['Manoorkar', 'Krishna', ''], ['Palmigiano', 'Alessandra', ''], ['Tzimoulis', 'Apostolos', ''], ['Wijnberg', 'Nachoem M.', '']]","['Formal Concept Analysis', 'Dempster-Shafer theory', 'epistemic logic']"
12740,1907.00822,Xin Zhao,"Xin Zhao, Philipp Haller","Consistency types for replicated data in a higher-order distributed
  programming language",,"The Art, Science, and Engineering of Programming, 2021, Vol. 5,
  Issue 2, Article 6",10.22152/programming-journal.org/2021/5/6,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed systems address the increasing demand for fast access to
resources and fault tolerance for data. However, due to scalability
requirements, software developers need to trade consistency for performance.
For certain data, consistency guarantees may be weakened if application
correctness is unaffected. In contrast, data flow from data with weak
consistency to data with strong consistency requirements is problematic, since
application correctness may be broken. In this paper, we propose lattice-based
consistency types for replicated data (CTRD), a higher-order static
consistency-typed language with replicated data types. The type system of CTRD
supports shared data among multiple clients, and statically enforces
noninterference between data types with weaker consistency and data types with
stronger consistency. The language can be applied to many distributed
applications and guarantees that updates of weakly-consistent data can never
affect strongly-consistent data. We also extend the basic CTRD with an
optimization that reduces synchronization for generating reference graphs.
","[{'version': 'v1', 'created': 'Mon, 1 Jul 2019 14:29:11 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Nov 2019 12:43:42 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Sep 2020 12:59:29 GMT'}, {'version': 'v4', 'created': 'Fri, 30 Oct 2020 15:18:44 GMT'}]",2020-11-02,"[['Zhao', 'Xin', ''], ['Haller', 'Philipp', '']]","['consistency types', 'replicated data types', 'distributed programming', 'information-flow security']"
12741,cs/0603050,Irene Guessarian,"Patrick Cegielski (LACL), Irene Guessarian (LIAFA), Yuri Matiyasevich
  (PDMI)",Multiple serial episode matching,12,CSIT05 (2005) 26-38,10.1016/j.ipl.2006.02.008,,cs.DS,,"  In a previous paper we generalized the Knuth-Morris-Pratt (KMP) pattern
matching algorithm and defined a non-conventional kind of RAM, the MP--RAMs
(RAMS equipped with extra operations), and designed an O(n) on-line algorithm
for solving the serial episode matching problem on MP--RAMs when there is only
one single episode. We here give two extensions of this algorithm to the case
when we search for several patterns simultaneously and compare them. More
preciseley, given $q+1$ strings (a text $t$ of length $n$ and $q$ patterns
$m\_1,...,m\_q$) and a natural number $w$, the {\em multiple serial episode
matching problem} consists in finding the number of size $w$ windows of text
$t$ which contain patterns $m\_1,...,m\_q$ as subsequences, i.e. for each
$m\_i$, if $m\_i=p\_1,..., p\_k$, the letters $p\_1,..., p\_k$ occur in the
window, in the same order as in $m\_i$, but not necessarily consecutively (they
may be interleaved with other letters).} The main contribution is an algorithm
solving this problem on-line in time $O(nq)$.
","[{'version': 'v1', 'created': 'Mon, 13 Mar 2006 11:03:34 GMT'}]",2021-10-26,"[['Cegielski', 'Patrick', '', 'LACL'], ['Guessarian', 'Irene', '', 'LIAFA'], ['Matiyasevich', 'Yuri', '', 'PDMI']]","['Subsequence matching', 'algorithm', 'frequent patterns', 'episode matching', 'datamining']"
12742,2002.11245,"Jan Br\""udigam","Jan Br\""udigam and Zachary Manchester",Linear-Time Variational Integrators in Maximal Coordinates,,Workshop on the Algorithmic Foundations of Robotics (WAFR) 2020,10.1007/978-3-030-66723-8_12,,cs.RO physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most dynamic simulation tools parameterize the configuration of multi-body
robotic systems using minimal coordinates, also called generalized or joint
coordinates. However, maximal-coordinate approaches have several advantages
over minimal-coordinate parameterizations, including native handling of closed
kinematic loops and nonholonomic constraints. This paper describes a
linear-time variational integrator that is formulated in maximal coordinates.
Due to its variational formulation, the algorithm does not suffer from
constraint drift and has favorable energy and momentum conservation properties.
A sparse matrix factorization technique allows the dynamics of a loop-free
articulated mechanism with $n$ links to be computed in $O(n)$ (linear) time.
Additional constraints that introduce loops can also be handled by the
algorithm without incurring much computational overhead. Experimental results
show that our approach offers speed competitive with state-of-the-art
minimal-coordinate algorithms while outperforming them in several scenarios,
especially when dealing with closed loops and configuration singularities.
","[{'version': 'v1', 'created': 'Wed, 26 Feb 2020 01:14:41 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Jun 2020 14:00:57 GMT'}]",2021-03-26,"[['Brüdigam', 'Jan', ''], ['Manchester', 'Zachary', '']]","['Discrete Mechanics', 'Variational Integrators', 'Dynamics', 'Maximal Coordinates', 'Computer Animation & Simulation']"
12743,2109.08935,Rishiraj Saha Roy,"Zhen Jia, Soumajit Pramanik, Rishiraj Saha Roy, Gerhard Weikum",Complex Temporal Question Answering on Knowledge Graphs,"CIKM 2021 Long Paper, 11 pages",,10.1145/3459637.3482416,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Question answering over knowledge graphs (KG-QA) is a vital topic in IR.
Questions with temporal intent are a special class of practical importance, but
have not received much attention in research. This work presents EXAQT, the
first end-to-end system for answering complex temporal questions that have
multiple entities and predicates, and associated temporal conditions. EXAQT
answers natural language questions over KGs in two stages, one geared towards
high recall, the other towards precision at top ranks. The first step computes
question-relevant compact subgraphs within the KG, and judiciously enhances
them with pertinent temporal facts, using Group Steiner Trees and fine-tuned
BERT models. The second step constructs relational graph convolutional networks
(R-GCNs) from the first step's output, and enhances the R-GCNs with time-aware
entity embeddings and attention over temporal relations. We evaluate EXAQT on
TimeQuestions, a large dataset of 16k temporal questions we compiled from a
variety of general purpose KG-QA benchmarks. Results show that EXAQT
outperforms three state-of-the-art systems for answering complex questions over
KGs, thereby justifying specialized treatment of temporal QA.
","[{'version': 'v1', 'created': 'Sat, 18 Sep 2021 13:41:43 GMT'}]",2021-09-21,"[['Jia', 'Zhen', ''], ['Pramanik', 'Soumajit', ''], ['Roy', 'Rishiraj Saha', ''], ['Weikum', 'Gerhard', '']]","['Temporal question answering', 'Complex questions', 'Knowledge graphs']"
12744,2107.02408,Shahroz Tariq,Minha Kim and Shahroz Tariq and Simon S. Woo,"CoReD: Generalizing Fake Media Detection with Continual Representation
  using Distillation","13 pages, 7 Figures, 13 Tables, Accepted for publication in the 29th
  ACM International Conference on Multimedia (ACMMM '21)",,10.1145/3474085.3475535,,cs.CV cs.CR cs.LG cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the last few decades, artificial intelligence research has made
tremendous strides, but it still heavily relies on fixed datasets in stationary
environments. Continual learning is a growing field of research that examines
how AI systems can learn sequentially from a continuous stream of linked data
in the same way that biological systems do. Simultaneously, fake media such as
deepfakes and synthetic face images have emerged as significant to current
multimedia technologies. Recently, numerous method has been proposed which can
detect deepfakes with high accuracy. However, they suffer significantly due to
their reliance on fixed datasets in limited evaluation settings. Therefore, in
this work, we apply continuous learning to neural networks' learning dynamics,
emphasizing its potential to increase data efficiency significantly. We propose
Continual Representation using Distillation (CoReD) method that employs the
concept of Continual Learning (CL), Representation Learning (RL), and Knowledge
Distillation (KD). We design CoReD to perform sequential domain adaptation
tasks on new deepfake and GAN-generated synthetic face datasets, while
effectively minimizing the catastrophic forgetting in a teacher-student model
setting. Our extensive experimental results demonstrate that our method is
efficient at domain adaptation to detect low-quality deepfakes videos and
GAN-generated images from several datasets, outperforming the-state-of-art
baseline methods.
","[{'version': 'v1', 'created': 'Tue, 6 Jul 2021 06:07:17 GMT'}, {'version': 'v2', 'created': 'Sat, 10 Jul 2021 05:27:16 GMT'}, {'version': 'v3', 'created': 'Thu, 5 Aug 2021 05:53:57 GMT'}]",2021-08-06,"[['Kim', 'Minha', ''], ['Tariq', 'Shahroz', ''], ['Woo', 'Simon S.', '']]","['Continual Learning', 'Knowledge Distillation', 'Deepfake', 'Representation Learning', 'Catastrophic Forgetting', 'Incremental Learning']"
12745,2112.09328,Laha Ale,"Laha Ale, Scott A. King, Ning Zhang, Abdul Rahman Sattar, Janahan
  Skandaraniyam","D3PG: Dirichlet DDPG for Task Partitioning and Offloading with
  Constrained Hybrid Action Space in Mobile Edge Computing",,,10.1109/JIOT.2022.3166110,,cs.NI eess.SP,http://creativecommons.org/licenses/by/4.0/,"  Mobile Edge Computing (MEC) has been regarded as a promising paradigm to
reduce service latency for data processing in the Internet of Things, by
provisioning computing resources at the network edge. In this work, we jointly
optimize the task partitioning and computational power allocation for
computation offloading in a dynamic environment with multiple IoT devices and
multiple edge servers. We formulate the problem as a Markov decision process
with constrained hybrid action space, which cannot be well handled by existing
deep reinforcement learning (DRL) algorithms. Therefore, we develop a novel
Deep Reinforcement Learning called Dirichlet Deep Deterministic Policy Gradient
(D3PG), which is built on Deep Deterministic Policy Gradient (DDPG) to solve
the problem. The developed model can learn to solve multi-objective
optimization, including maximizing the number of tasks processed before
expiration and minimizing the energy cost and service latency.} More
importantly, D3PG can effectively deal with constrained distribution-continuous
hybrid action space, where the distribution variables are for the task
partitioning and offloading, while the continuous variables are for
computational frequency control. Moreover, the D3PG can address many similar
issues in MEC and general reinforcement learning problems. Extensive simulation
results show that the proposed D3PG outperforms the state-of-art methods.
","[{'version': 'v1', 'created': 'Fri, 17 Dec 2021 05:21:12 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Mar 2022 16:14:55 GMT'}]",2022-04-19,"[['Ale', 'Laha', ''], ['King', 'Scott A.', ''], ['Zhang', 'Ning', ''], ['Sattar', 'Abdul Rahman', ''], ['Skandaraniyam', 'Janahan', '']]","['Mobile Edge Computing', 'Task Partition', 'Deep Reinforcement Learning', 'Computation Offloading', 'Energy efficiency', 'TD3', 'DDPG', 'Dirichlet']"
12746,2008.10960,Julien Despois,"Julien Despois, Frederic Flament, Matthieu Perrot","AgingMapGAN (AMGAN): High-Resolution Controllable Face Aging with
  Spatially-Aware Conditional GANs",Project page: https://despoisj.github.io/AgingMapGAN/,,10.1007/978-3-030-67070-2_37,,cs.CV cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing approaches and datasets for face aging produce results skewed
towards the mean, with individual variations and expression wrinkles often
invisible or overlooked in favor of global patterns such as the fattening of
the face. Moreover, they offer little to no control over the way the faces are
aged and can difficultly be scaled to large images, thus preventing their usage
in many real-world applications. To address these limitations, we present an
approach to change the appearance of a high-resolution image using
ethnicity-specific aging information and weak spatial supervision to guide the
aging process. We demonstrate the advantage of our proposed method in terms of
quality, control, and how it can be used on high-definition images while
limiting the computational overhead.
","[{'version': 'v1', 'created': 'Tue, 25 Aug 2020 12:35:48 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Aug 2020 09:51:12 GMT'}]",2021-03-12,"[['Despois', 'Julien', ''], ['Flament', 'Frederic', ''], ['Perrot', 'Matthieu', '']]","['Conditional GANs', 'Face Aging', 'High-Resolution']"
12747,2106.14801,Loris Bozzato,"Loris Bozzato, Thomas Eiter, Luciano Serafini",Reasoning on $\textit{DL-Lite}_{\cal R}$ with Defeasibility in ASP,"Under consideration in Theory and Practice of Logic Programming
  (TPLP). This paper is an extended and revised version of a conference paper
  appearing in the proceedings of the 3rd International Joint Conference on
  Rules and Reasoning (RuleML+RR 2019). (v2 updates: added discussion on
  equivalence in Appendix, typos corrected). arXiv admin note: text overlap
  with arXiv:1905.09221",,10.1017/S1471068421000132,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reasoning on defeasible knowledge is a topic of interest in the area of
description logics, as it is related to the need of representing exceptional
instances in knowledge bases. In this direction, in our previous works we
presented a framework for representing (contextualized) OWL RL knowledge bases
with a notion of justified exceptions on defeasible axioms: reasoning in such
framework is realized by a translation into ASP programs. The resulting
reasoning process for OWL RL, however, introduces a complex encoding in order
to capture reasoning on the negative information needed for reasoning on
exceptions. In this paper, we apply the justified exception approach to
knowledge bases in $\textit{DL-Lite}_{\cal R}$, i.e., the language underlying
OWL QL. We provide a definition for $\textit{DL-Lite}_{\cal R}$ knowledge bases
with defeasible axioms and study their semantic and computational properties.
In particular, we study the effects of exceptions over unnamed individuals. The
limited form of $\textit{DL-Lite}_{\cal R}$ axioms allows us to formulate a
simpler ASP encoding, where reasoning on negative information is managed by
direct rules. The resulting materialization method gives rise to a complete
reasoning procedure for instance checking in $\textit{DL-Lite}_{\cal R}$ with
defeasible axioms. Under consideration in Theory and Practice of Logic
Programming (TPLP).
","[{'version': 'v1', 'created': 'Mon, 28 Jun 2021 15:23:11 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Jun 2021 13:51:29 GMT'}]",2021-08-10,"[['Bozzato', 'Loris', ''], ['Eiter', 'Thomas', ''], ['Serafini', 'Luciano', '']]","['Defeasible Knowledge', 'Description Logics', 'Answer Set Programming', 'Justifiable Exceptions']"
12748,2104.10984,C\'edric Marco-Detchart,"Cedric Marco-Detchart, Giancarlo Lucca, Carlos Lopez-Molina, Laura De
  Miguel, Gra\c{c}aliz Pereira Dimuro, Humberto Bustince",Neuro-inspired edge feature fusion using Choquet integrals,,,10.1016/j.ins.2021.10.016,,cs.CV cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is known that the human visual system performs a hierarchical information
process in which early vision cues (or primitives) are fused in the visual
cortex to compose complex shapes and descriptors. While different aspects of
the process have been extensively studied, as the lens adaptation or the
feature detection, some other,as the feature fusion, have been mostly left
aside. In this work we elaborate on the fusion of early vision primitives using
generalizations of the Choquet integral, and novel aggregation operators that
have been extensively studied in recent years. We propose to use
generalizations of the Choquet integral to sensibly fuse elementary edge cues,
in an attempt to model the behaviour of neurons in the early visual cortex. Our
proposal leads to a full-framed edge detection algorithm, whose performance is
put to the test in state-of-the-art boundary detection datasets.
","[{'version': 'v1', 'created': 'Thu, 22 Apr 2021 10:45:52 GMT'}]",2021-10-11,"[['Marco-Detchart', 'Cedric', ''], ['Lucca', 'Giancarlo', ''], ['Lopez-Molina', 'Carlos', ''], ['De Miguel', 'Laura', ''], ['Dimuro', 'Graçaliz Pereira', ''], ['Bustince', 'Humberto', '']]","['image processing', 'feature extraction', 'edge detection', 'Choquet integral', 'CF -integral', 'pre-agregation functions']"
12749,1906.05491,Alberto Calderone Dr.,Alberto Calderone,"A Computational Analysis of Natural Languages to Build a Sentence
  Structure Aware Artificial Neural Network",,,10.6084/m9.figshare.8796725.v1,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Natural languages are complexly structured entities. They exhibit
characterising regularities that can be exploited to link them one another. In
this work, I compare two morphological aspects of languages: Written Patterns
and Sentence Structure. I show how languages spontaneously group by similarity
in both analyses and derive an average language distance. Finally, exploiting
Sentence Structure I developed an Artificial Neural Network capable of
distinguishing languages suggesting that not only word roots but also
grammatical sentence structure is a characterising trait which alone suffice to
identify them.
","[{'version': 'v1', 'created': 'Thu, 13 Jun 2019 05:44:16 GMT'}]",2019-07-09,"[['Calderone', 'Alberto', '']]","['Data Science and Analytics', 'Artificial Neural Networks', 'Natural Language Processing', 'Natural Languages']"
12750,2205.10759,Shoujin Wang,"Shoujin Wang, Qi Zhang, Liang Hu, Xiuzhen Zhang, Yan Wang, Charu
  Aggarwal","Sequential/Session-based Recommendations: Challenges, Approaches,
  Applications and Opportunities",,SIGIR 2022,10.1145/3477495.3532685,,cs.IR cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  In recent years, sequential recommender systems (SRSs) and session-based
recommender systems (SBRSs) have emerged as a new paradigm of RSs to capture
users' short-term but dynamic preferences for enabling more timely and accurate
recommendations. Although SRSs and SBRSs have been extensively studied, there
are many inconsistencies in this area caused by the diverse descriptions,
settings, assumptions and application domains. There is no work to provide a
unified framework and problem statement to remove the commonly existing and
various inconsistencies in the area of SR/SBR. There is a lack of work to
provide a comprehensive and systematic demonstration of the data
characteristics, key challenges, most representative and state-of-the-art
approaches, typical real-world applications and important future research
directions in the area. This work aims to fill in these gaps so as to
facilitate further research in this exciting and vibrant area.
","[{'version': 'v1', 'created': 'Sun, 22 May 2022 06:17:36 GMT'}]",2022-05-24,"[['Wang', 'Shoujin', ''], ['Zhang', 'Qi', ''], ['Hu', 'Liang', ''], ['Zhang', 'Xiuzhen', ''], ['Wang', 'Yan', ''], ['Aggarwal', 'Charu', '']]","['Recommender systems', 'sequential recommendation', 'session-basedrecommendation']"
12751,2201.04180,Souma Chowdhury,"Chen Zeng, Grant Hecht, Prajit KrisshnaKumar, Raj K. Shah, Souma
  Chowdhury and Eleonora M. Botta","Learning Robust Policies for Generalized Debris Capture with an
  Automated Tether-Net System","This paper has been presented at the 2022 AIAA SciTech Forum and
  Exposition, and accepted for publication in the corresponding AIAA
  proceedings",,10.2514/6.2022-2379,,cs.RO cs.AI cs.LG math.OC,http://creativecommons.org/licenses/by/4.0/,"  Tether-net launched from a chaser spacecraft provides a promising method to
capture and dispose of large space debris in orbit. This tether-net system is
subject to several sources of uncertainty in sensing and actuation that affect
the performance of its net launch and closing control. Earlier
reliability-based optimization approaches to design control actions however
remain challenging and computationally prohibitive to generalize over varying
launch scenarios and target (debris) state relative to the chaser. To search
for a general and reliable control policy, this paper presents a reinforcement
learning framework that integrates a proximal policy optimization (PPO2)
approach with net dynamics simulations. The latter allows evaluating the
episodes of net-based target capture, and estimate the capture quality index
that serves as the reward feedback to PPO2. Here, the learned policy is
designed to model the timing of the net closing action based on the state of
the moving net and the target, under any given launch scenario. A stochastic
state transition model is considered in order to incorporate synthetic
uncertainties in state estimation and launch actuation. Along with notable
reward improvement during training, the trained policy demonstrates capture
performance (over a wide range of launch/target scenarios) that is close to
that obtained with reliability-based optimization run over an individual
scenario.
","[{'version': 'v1', 'created': 'Tue, 11 Jan 2022 20:09:05 GMT'}]",2022-01-13,"[['Zeng', 'Chen', ''], ['Hecht', 'Grant', ''], ['KrisshnaKumar', 'Prajit', ''], ['Shah', 'Raj K.', ''], ['Chowdhury', 'Souma', ''], ['Botta', 'Eleonora M.', '']]","['Active Debris Removal', 'Reinforcement Learning', 'Tether-Net', 'Uncertainty']"
12752,2010.03629,Rudy Arthur,Rudy Arthur,"Studying the UK Job Market During the COVID-19 Crisis with Online Job
  Ads","33 pages, 20 figures",,10.1371/journal.pone.0251431,,cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The COVID-19 global pandemic and the lockdown policies enacted to mitigate it
have had profound effects on the labour market. Understanding these effects
requires us to obtain and analyse data in as close to real time as possible,
especially as rules change rapidly and local lockdowns are enacted. In this
work we study the UK labour market by analysing data from the online job board
Reed.co.uk. Using topic modelling and geo-inference methods we are able to
break down the data by sector and geography. We also study how the salary,
contract type and mode of work have changed since the COVID-19 crisis hit the
UK in March. Overall, vacancies were down by 60 to 70\% in the first weeks of
lockdown. By the end of the year numbers had recovered somewhat, but the total
job ad deficit is measured to be over 40\%. Broken down by sector, vacancies
for hospitality and graduate jobs are greatly reduced, while there were more
care work and nursing vacancies during lockdown. Differences by geography are
less significant than between sectors, though there is some indication that
local lockdowns stall recovery and less badly hit areas may have experienced a
smaller reduction in vacancies. There are also small but significant changes in
the salary distribution and number of full time and permanent jobs. In addition
to these results, this work presents an open methodology that enables a rapid
and detailed survey of the job market in these unsettled conditions and we
describe a web application \url{jobtrender.com} that allows others to query
this data set.
","[{'version': 'v1', 'created': 'Wed, 7 Oct 2020 19:56:16 GMT'}, {'version': 'v2', 'created': 'Sun, 31 Jan 2021 14:02:19 GMT'}]",2021-06-09,"[['Arthur', 'Rudy', '']]","['Labour Market', 'Topic Modelling', 'Geo-inference']"
12753,2106.00799,Laura Elena Cue La Rosa,"Laura Elena Cu\'e La Rosa, Camile Sothe, Raul Queiroz Feitosa,
  Cl\'audia Maria de Almeida, Marcos Benedito Schimalski, Dario Augusto Borges
  Oliveira","Multi-task fully convolutional network for tree species mapping in dense
  forests using small training hyperspectral data","Full version of preprint accepted at ISPRS Journal of Photogrammetry
  and Remote Sensing",,10.1016/j.isprsjprs.2021.07.001,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work proposes a multi-task fully convolutional architecture for tree
species mapping in dense forests from sparse and scarce polygon-level
annotations using hyperspectral UAV-borne data. Our model implements a partial
loss function that enables dense tree semantic labeling outcomes from non-dense
training samples, and a distance regression complementary task that enforces
tree crown boundary constraints and substantially improves the model
performance. Our multi-task architecture uses a shared backbone network that
learns common representations for both tasks and two task-specific decoders,
one for the semantic segmentation output and one for the distance map
regression. We report that introducing the complementary task boosts the
semantic segmentation performance compared to the single-task counterpart in up
to 11% reaching an average user's accuracy of 88.63% and an average producer's
accuracy of 88.59%, achieving state-of-art performance for tree species
classification in tropical forests.
","[{'version': 'v1', 'created': 'Tue, 1 Jun 2021 21:10:10 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Sep 2021 13:44:35 GMT'}]",2021-09-07,"[['La Rosa', 'Laura Elena Cué', ''], ['Sothe', 'Camile', ''], ['Feitosa', 'Raul Queiroz', ''], ['de Almeida', 'Cláudia Maria', ''], ['Schimalski', 'Marcos Benedito', ''], ['Oliveira', 'Dario Augusto Borges', '']]","['Semantic segmentation', 'Tree species identification', 'Multi-tasklearning', 'Fully convolutional network', 'Sparse annotations']"
12754,2205.06670,Paulo Laerte Natti,"Pedro Zaffalon da Silva, Neyva Maria Lopes Romeiro, Iury Pereira de
  Souza, Paulo Laerte Natti, and Eliandro Rodrigues Cirilo","Rectangular mesh contour generation algorithm for finite differences
  calculus",In Portuguese language,"In: Cole\c{c}\~ao desafios das engenharias: Engenharia de
  computa\c{c}\~ao. Cap\'itulo 4, 1ed. Ponta Grossa: Atena Editora, 2021, p.
  38-52",10.22533/at.ed.8702118084,,cs.CG cs.NA math.NA,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this work, a 2D contour generation algorithm is proposed for irregular
regions. The contour of the physical domain is approximated by mesh segments
using the known coordinates of the contour. For this purpose, the algorithm
uses a repeating structure that analyzes the known irregular contour
coordinates to approximate the physical domain contour by mesh segments. To
this end, the algorithm calculates the slope of the line defined by the known
point of the irregular contours and the neighboring vertices. In this way, the
algorithm calculates the points of the line and its distance to the closest
known nodes of the mesh, allowing to obtain the points of the approximate
contour. This process is repeated until the approximate contour is obtained.
Therefore, this approximate contour generation algorithm, from known nodes of a
mesh, is suitable for describing meshes involving geometries with irregular
contours and for calculating finite differences in numerical simulations. The
contour is evaluated through three geometries, the difference between the areas
delimited by the given contour and the approximate contour, the number of nodes
and the number of internal points. It can be seen that the increase in geometry
complexity implies the need for a greater number of nodes in the contour,
generating more refined meshes that allow reaching differences in areas below
2%.
","[{'version': 'v1', 'created': 'Tue, 10 May 2022 18:23:41 GMT'}]",2022-05-17,"[['da Silva', 'Pedro Zaffalon', ''], ['Romeiro', 'Neyva Maria Lopes', ''], ['de Souza', 'Iury Pereira', ''], ['Natti', 'Paulo Laerte', ''], ['Cirilo', 'Eliandro Rodrigues', '']]","['Irregular geometry', 'contour', 'mesh', 'finite differences']"
12755,2112.07384,Timo Spinde,"Timo Spinde, Lada Rudnitckaia, Felix Hamborg, Bela Gipp","Identification of Biased Terms in News Articles by Comparison of
  Outlet-specific Word Embeddings",,,10.1007/978-3-030-71305-8_17,,cs.CL cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Slanted news coverage, also called media bias, can heavily influence how news
consumers interpret and react to the news. To automatically identify biased
language, we present an exploratory approach that compares the context of
related words. We train two word embedding models, one on texts of left-wing,
the other on right-wing news outlets. Our hypothesis is that a word's
representations in both word embedding spaces are more similar for non-biased
words than biased words. The underlying idea is that the context of biased
words in different news outlets varies more strongly than the one of non-biased
words, since the perception of a word as being biased differs depending on its
context. While we do not find statistical significance to accept the
hypothesis, the results show the effectiveness of the approach. For example,
after a linear mapping of both word embeddings spaces, 31% of the words with
the largest distances potentially induce bias. To improve the results, we find
that the dataset needs to be significantly larger, and we derive further
methodology as future research direction. To our knowledge, this paper presents
the first in-depth look at the context of bias words measured by word
embeddings.
","[{'version': 'v1', 'created': 'Tue, 14 Dec 2021 13:23:49 GMT'}]",2021-12-15,"[['Spinde', 'Timo', ''], ['Rudnitckaia', 'Lada', ''], ['Hamborg', 'Felix', ''], ['Gipp', 'Bela', '']]","['Media bias', 'news slant', 'context analysis', 'word embeddings']"
12756,1411.7640,Raghvendra Mall,"Raghvendra Mall, Rocco Langone and Johan A.K. Suykens","Multilevel Hierarchical Kernel Spectral Clustering for Real-Life Large
  Scale Complex Networks","PLOS ONE, Vol 9, Issue 6, June 2014",,10.1371/journal.pone.0099966,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Kernel spectral clustering corresponds to a weighted kernel principal
component analysis problem in a constrained optimization framework. The primal
formulation leads to an eigen-decomposition of a centered Laplacian matrix at
the dual level. The dual formulation allows to build a model on a
representative subgraph of the large scale network in the training phase and
the model parameters are estimated in the validation stage. The KSC model has a
powerful out-of-sample extension property which allows cluster affiliation for
the unseen nodes of the big data network. In this paper we exploit the
structure of the projections in the eigenspace during the validation stage to
automatically determine a set of increasing distance thresholds. We use these
distance thresholds in the test phase to obtain multiple levels of hierarchy
for the large scale network. The hierarchical structure in the network is
determined in a bottom-up fashion. We empirically showcase that real-world
networks have multilevel hierarchical organization which cannot be detected
efficiently by several state-of-the-art large scale hierarchical community
detection techniques like the Louvain, OSLOM and Infomap methods. We show a
major advantage our proposed approach i.e. the ability to locate good quality
clusters at both the coarser and finer levels of hierarchy using internal
cluster quality metrics on 7 real-life networks.
","[{'version': 'v1', 'created': 'Thu, 27 Nov 2014 16:43:55 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Dec 2014 10:04:03 GMT'}]",2014-12-03,"[['Mall', 'Raghvendra', ''], ['Langone', 'Rocco', ''], ['Suykens', 'Johan A. K.', '']]","['Hierarchical Community Detection', 'Kernel Spectral Clustering', 'Out-of-sample extensions']"
12757,2012.02242,Fateme Sarkohaki,"Mina Zaminkar, Fateme Sarkohaki, Reza Fotohi","A method based on encryption and node rating for securing the RPL
  protocol communications in the IoT ecosystem","24 pages, 11 figures, 6 tables",Int J Commun Syst. 2020;e4693,10.1002/dac.4693,,cs.CR cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Internet of Things (IoT) provides the possibility for milliards of devices
throughout the world to communicate with each other, and data is collected
autonomously. The big data generated by the devices should be managed securely.
Due to security challenges, like malicious nodes, many approaches cannot
respond to these concerns. In this paper, a robust hybrid method, including
encryption, is used as an efficient approach for resolving the RPL protocol
concerns so that the devices are connected securely. Therefore, the proposed
DSH-RPL method for securing the RPL protocol comprises the four following
phases: The first phase creates a reliable RPL. The second phase detects the
sinkhole attack. The third phase quarantines the detected malicious node, and
the fourth phase transmits data through encryption. The simulation results show
that the DSH-RPL reduces the false-positive rate more than 18.2% and 23.1%, and
reduces the false-negative rate more than 16.1% and 22.78%, it also increases
the packet delivery rate more than 19.68% and 25.32% and increases the
detection rate more than 26% and 31% compared to SecTrust-RPL and IBOOS-RPL.
","[{'version': 'v1', 'created': 'Sat, 21 Nov 2020 09:27:38 GMT'}]",2020-12-07,"[['Zaminkar', 'Mina', ''], ['Sarkohaki', 'Fateme', ''], ['Fotohi', 'Reza', '']]","['Internet of Things (IoT)', 'Sinkhole attack', 'RPL', 'Rating and ranking mechanism', 'Encryption']"
12758,1802.00752,Alexey Shvets,"Alexander Rakhlin, Alexey Shvets, Vladimir Iglovikov and Alexandr A.
  Kalinin","Deep Convolutional Neural Networks for Breast Cancer Histology Image
  Analysis","8 pages, 4 figures",,10.1007/978-3-319-93000-8_83,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Breast cancer is one of the main causes of cancer death worldwide. Early
diagnostics significantly increases the chances of correct treatment and
survival, but this process is tedious and often leads to a disagreement between
pathologists. Computer-aided diagnosis systems showed potential for improving
the diagnostic accuracy. In this work, we develop the computational approach
based on deep convolution neural networks for breast cancer histology image
classification. Hematoxylin and eosin stained breast histology microscopy image
dataset is provided as a part of the ICIAR 2018 Grand Challenge on Breast
Cancer Histology Images. Our approach utilizes several deep neural network
architectures and gradient boosted trees classifier. For 4-class classification
task, we report 87.2% accuracy. For 2-class classification task to detect
carcinomas we report 93.8% accuracy, AUC 97.3%, and sensitivity/specificity
96.5/88.0% at the high-sensitivity operating point. To our knowledge, this
approach outperforms other common methods in automated histopathological image
classification. The source code for our approach is made publicly available at
https://github.com/alexander-rakhlin/ICIAR2018
","[{'version': 'v1', 'created': 'Fri, 2 Feb 2018 16:20:58 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Apr 2018 13:59:59 GMT'}]",2018-06-26,"[['Rakhlin', 'Alexander', ''], ['Shvets', 'Alexey', ''], ['Iglovikov', 'Vladimir', ''], ['Kalinin', 'Alexandr A.', '']]","['Medical imaging', 'Computer-aided diagnosis (CAD)', 'Computer vision', 'Image recognition', 'Deep learning']"
12759,1908.11567,Tobias Skovgaard Jepsen,"Tobias Skovgaard Jepsen, Christian S. Jensen, Thomas Dyhre Nielsen",Graph Convolutional Networks for Road Networks,"Ten-page pre-print version of a four-page ACM SIGSPATIAL 2019 poster
  paper",,10.1145/3347146.3359094,,cs.LG cs.DB stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning techniques for road networks hold the potential to
facilitate many important transportation applications. Graph Convolutional
Networks (GCNs) are neural networks that are capable of leveraging the
structure of a road network by utilizing information of, e.g., adjacent road
segments. While state-of-the-art GCNs target node classification tasks in
social, citation, and biological networks, machine learning tasks in road
networks differ substantially from such tasks. In road networks, prediction
tasks concern edges representing road segments, and many tasks involve
regression. In addition, road networks differ substantially from the networks
assumed in the GCN literature in terms of the attribute information available
and the network characteristics. Many implicit assumptions of GCNs do therefore
not apply. We introduce the notion of Relational Fusion Network (RFN), a novel
type of GCN designed specifically for machine learning on road networks. In
particular, we propose methods that outperform state-of-the-art GCNs on both a
road segment regression task and a road segment classification task by 32-40%
and 21-24%, respectively. In addition, we provide experimental evidence of the
short-comings of state-of-the-art GCNs in the context of road networks: unlike
our method, they cannot effectively leverage the road network structure for
road segment classification and fail to outperform a regular multi-layer
perceptron.
","[{'version': 'v1', 'created': 'Fri, 30 Aug 2019 07:08:51 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Dec 2019 09:44:40 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Jul 2020 14:50:54 GMT'}]",2020-07-23,"[['Jepsen', 'Tobias Skovgaard', ''], ['Jensen', 'Christian S.', ''], ['Nielsen', 'Thomas Dyhre', '']]","['Road Network', 'Machine Learning', 'Graph Representation Learning', 'Graph Convolutional Networks']"
12760,2012.08205,Tobias Scheck,"Tobias Scheck, Ana Perez Grassi, Gangolf Hirtz","Unsupervised Domain Adaptation from Synthetic to Real Images for
  Anchorless Object Detection",Paper accepted in VISAPP 2021,,10.5220/0010202503190327,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Synthetic images are one of the most promising solutions to avoid high costs
associated with generating annotated datasets to train supervised convolutional
neural networks (CNN). However, to allow networks to generalize knowledge from
synthetic to real images, domain adaptation methods are necessary. This paper
implements unsupervised domain adaptation (UDA) methods on an anchorless object
detector. Given their good performance, anchorless detectors are increasingly
attracting attention in the field of object detection. While their results are
comparable to the well-established anchor-based methods, anchorless detectors
are considerably faster. In our work, we use CenterNet, one of the most recent
anchorless architectures, for a domain adaptation problem involving synthetic
images. Taking advantage of the architecture of anchorless detectors, we
propose to adjust two UDA methods, viz., entropy minimization and maximum
squares loss, originally developed for segmentation, to object detection. Our
results show that the proposed UDA methods can increase the mAPfrom61 %to69
%with respect to direct transfer on the considered anchorless detector. The
code is available: https://github.com/scheckmedia/centernet-uda.
","[{'version': 'v1', 'created': 'Tue, 15 Dec 2020 10:51:43 GMT'}]",2021-03-11,"[['Scheck', 'Tobias', ''], ['Grassi', 'Ana Perez', ''], ['Hirtz', 'Gangolf', '']]","['Unsupervised Domain Adaptation', 'Synthetic Images', 'CenterNet', 'Anchorless/Keypoint-based Detectors', 'ObjectDetection']"
12761,2108.03033,Riccardo Zese,"Elena Bellodi, Marco Gavanelli, Riccardo Zese, Evelina Lamma, Fabrizio
  Riguzzi","Nonground Abductive Logic Programming with Probabilistic Integrity
  Constraints","Paper presented at the 37th International Conference on Logic
  Programming (ICLP 2021), 16 pages","Theory and Practice of Logic Programming, 21(5), 557-574, 2021",10.1017/S1471068421000417,,cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Uncertain information is being taken into account in an increasing number of
application fields. In the meantime, abduction has been proved a powerful tool
for handling hypothetical reasoning and incomplete knowledge. Probabilistic
logical models are a suitable framework to handle uncertain information, and in
the last decade many probabilistic logical languages have been proposed, as
well as inference and learning systems for them. In the realm of Abductive
Logic Programming (ALP), a variety of proof procedures have been defined as
well. In this paper, we consider a richer logic language, coping with
probabilistic abduction with variables. In particular, we consider an ALP
program enriched with integrity constraints `a la IFF, possibly annotated with
a probability value. We first present the overall abductive language, and its
semantics according to the Distribution Semantics. We then introduce a proof
procedure, obtained by extending one previously presented, and prove its
soundness and completeness.
","[{'version': 'v1', 'created': 'Fri, 6 Aug 2021 10:22:12 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Feb 2022 14:22:05 GMT'}]",2022-02-04,"[['Bellodi', 'Elena', ''], ['Gavanelli', 'Marco', ''], ['Zese', 'Riccardo', ''], ['Lamma', 'Evelina', ''], ['Riguzzi', 'Fabrizio', '']]","['Abduction', 'Integrity Constraints', 'Distribution Semantics', 'Probabilistic IFF']"
12762,1601.03022,Xavier Navarro-Sune,"X Navarro-Sune, A.L. Hudson, F. De Vico Fallani, J. Martinerie, A.
  Witon, P. Pouget, M. Raux, T. Similowski and M. Chavez","Riemannian geometry applied to detection of respiratory states from EEG
  signals: the basis for a brain-ventilator interface","14 pages, 7 figures","IEEE Transactions on Biomedical Engineering, 2016",10.1109/TBME.2016.2592820,,cs.HC q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During mechanical ventilation, patient-ventilator disharmony is frequently
observed and may result in increased breathing effort, compromising the
patient's comfort and recovery. This circumstance requires clinical
intervention and becomes challenging when verbal communication is difficult. In
this work, we propose a brain computer interface (BCI) to automatically and
non-invasively detect patient-ventilator disharmony from
electroencephalographic (EEG) signals: a brain-ventilator interface (BVI). Our
framework exploits the cortical activation provoked by the inspiratory
compensation when the subject and the ventilator are desynchronized. Use of a
one-class approach and Riemannian geometry of EEG covariance matrices allows
effective classification of respiratory states. The BVI is validated on nine
healthy subjects that performed different respiratory tasks that mimic a
patient-ventilator disharmony. Classification performances, in terms of areas
under ROC curves, are significantly improved using EEG signals compared to
detection based on air flow. Reduction in the number of electrodes that can
achieve discrimination can often be desirable (e.g. for portable BCI systems).
By using an iterative channel selection technique, the Common Highest Order
Ranking (CHOrRa), we find that a reduced set of electrodes (n=6) can slightly
improve for an intra-subject configuration, and it still provides fairly good
performances for a general inter-subject setting. Results support the
discriminant capacity of our approach to identify anomalous respiratory states,
by learning from a training set containing only normal respiratory epochs. The
proposed framework opens the door to brain-ventilator interfaces for monitoring
patient's breathing comfort and adapting ventilator parameters to patient
respiratory needs.
","[{'version': 'v1', 'created': 'Tue, 12 Jan 2016 20:32:30 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Sep 2016 14:09:22 GMT'}]",2016-09-21,"[['Navarro-Sune', 'X', ''], ['Hudson', 'A. L.', ''], ['Fallani', 'F. De Vico', ''], ['Martinerie', 'J.', ''], ['Witon', 'A.', ''], ['Pouget', 'P.', ''], ['Raux', 'M.', ''], ['Similowski', 'T.', ''], ['Chavez', 'M.', '']]","['Biomedical signal processing', 'Braincomputer interfaces (BCI)', 'Biomedical monitoring', 'Medical signal detection', 'Electroencephalography(EEG)']"
12763,2010.00860,Claire N\'edellec,"Claire N\'edellec, Wiktoria Golik, Sophie Aubin, Robert Bossy","Building Large Lexicalized Ontologies from Text: a Use Case in Automatic
  Indexing of Biotechnology Patents",,"International Conference on Knowledge Engineering and Knowledge
  Management. EKAW 2010. Lecture Notes in Computer Science, vol 6317. (pp.
  514-523) Springer, Berlin, Heidelberg",10.1007/978-3-642-16438-5_41,,cs.AI cs.CL cs.IR,http://creativecommons.org/licenses/by/4.0/,"  This paper presents a tool, TyDI, and methods experimented in the building of
a termino-ontology, i.e. a lexicalized ontology aimed at fine-grained
indexation for semantic search applications. TyDI provides facilities for
knowledge engineers and domain experts to efficiently collaborate to validate,
organize and conceptualize corpus extracted terms. A use case on biotechnology
patent search demonstrates TyDI's potential.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2020 08:42:56 GMT'}]",2020-10-05,"[['Nédellec', 'Claire', ''], ['Golik', 'Wiktoria', ''], ['Aubin', 'Sophie', ''], ['Bossy', 'Robert', '']]","['Knowledge engineering', 'knowledge acquisition from texts', 'life sciences']"
12764,1802.02254,Ping Zhang,"Ping Zhang, Zhifeng Bao, Yuchen Li, Guoliang Li, Yipeng Zhang, Zhiyong
  Peng",Trajectory-driven Influential Billboard Placement,,,10.1145/3219819.3219946,,cs.SI cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose and study the problem of trajectory-driven
influential billboard placement: given a set of billboards $U$ (each with a
location and a cost), a database of trajectories $\mathcal{T}$ and a budget
$L$, find a set of billboards within the budget to influence the largest number
of trajectories. One core challenge is to identify and reduce the overlap of
the influence from different billboards to the same trajectories, while keeping
the budget constraint into consideration. We show that this problem is NP-hard
and present an enumeration based algorithm with $(1-1/e)$ approximation ratio.
However, the enumeration should be very costly when $|U|$ is large. By
exploiting the locality property of billboards' influence, we propose a
partition-based framework PartSel. PartSel partitions $U$ into a set of small
clusters, computes the locally influential billboards for each cluster, and
merges them to generate the global solution. Since the local solutions can be
obtained much more efficient than the global one, PartSel should reduce the
computation cost greatly; meanwhile it achieves a non-trivial approximation
ratio guarantee. Then we propose a LazyProbe method to further prune billboards
with low marginal influence, while achieving the same approximation ratio as
PartSel. Experiments on real datasets verify the efficiency and effectiveness
of our methods.
","[{'version': 'v1', 'created': 'Tue, 6 Feb 2018 23:05:02 GMT'}, {'version': 'v2', 'created': 'Wed, 30 May 2018 11:13:46 GMT'}, {'version': 'v3', 'created': 'Sun, 9 Sep 2018 14:43:37 GMT'}, {'version': 'v4', 'created': 'Sat, 15 Sep 2018 07:43:40 GMT'}]",2018-09-18,"[['Zhang', 'Ping', ''], ['Bao', 'Zhifeng', ''], ['Li', 'Yuchen', ''], ['Li', 'Guoliang', ''], ['Zhang', 'Yipeng', ''], ['Peng', 'Zhiyong', '']]","['Outdoor Advertising', 'Influence Maximization', 'Trajectory']"
12765,2204.12120,Sandra Maci\`a,"Sandra Maci\`a, Pedro J. Mart{\i}\'inez-Ferrer, Eduard Ayguad\'e,
  Vicen\c{c} Beltran","Automated Generation of High-Performance Computational Fluid Dynamics
  Codes","30 pages, 18 figures. Postprint submitted to the Journal of
  Computational Science (Elsevier). Article updated with reviewers' comments,
  additional material in section 4.3 including figures and correction of typos","Journal of Computational Science Volume 61, May 2022, 101664",10.1016/j.jocs.2022.101664,,cs.MS cs.CE cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Domain-Specific Languages (DSLs) improve programmers productivity by
decoupling problem descriptions from algorithmic implementations. However, DSLs
for High-Performance Computing (HPC) have two additional critical requirements:
performance and scalability. This paper presents the automated process of
generating, from abstract mathematical specifications of Computational Fluid
Dynamics (CFD) problems, optimised parallel codes that perform and scale as
manually optimised ones. We consciously combine within Saiph, a DSL for solving
CFD problems, low-level optimisations and parallelisation strategies, enabling
high-performance single-core executions which effectively scale to multi-core
and distributed environments. Our results demonstrate how high-level DSLs can
offer competitive performance by transparently leveraging state-of-the-art HPC
techniques.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2022 07:26:36 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Apr 2022 06:50:57 GMT'}]",2022-04-28,"[['Macià', 'Sandra', ''], ['Martıínez-Ferrer', 'Pedro J.', ''], ['Ayguadé', 'Eduard', ''], ['Beltran', 'Vicenç', '']]","['Domain-Specific Languages', 'High-Performance Computing', 'Computational Fluid Dynamics', 'Code Optimisation']"
12766,2004.09546,Ali Javed,"Ali Javed, Byung Suk Lee, Dona M. Rizzo",A Benchmark Study on Time Series Clustering,"Typos corrected, figures resolution changed","Machine Learning with Applications, 1:100001, 2020",10.1016/j.mlwa.2020.100001,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the first time series clustering benchmark utilizing all
time series datasets currently available in the University of California
Riverside (UCR) archive -- the state of the art repository of time series data.
Specifically, the benchmark examines eight popular clustering methods
representing three categories of clustering algorithms (partitional,
hierarchical and density-based) and three types of distance measures
(Euclidean, dynamic time warping, and shape-based). We lay out six restrictions
with special attention to making the benchmark as unbiased as possible. A
phased evaluation approach was then designed for summarizing dataset-level
assessment metrics and discussing the results. The benchmark study presented
can be a useful reference for the research community on its own; and the
dataset-level assessment metrics reported may be used for designing evaluation
frameworks to answer different research questions.
","[{'version': 'v1', 'created': 'Mon, 20 Apr 2020 18:06:42 GMT'}, {'version': 'v2', 'created': 'Sun, 26 Apr 2020 16:15:18 GMT'}]",2021-08-26,"[['Javed', 'Ali', ''], ['Lee', 'Byung Suk', ''], ['Rizzo', 'Dona M.', '']]","['Time series', 'clustering', 'benchmark', 'UCR archive']"
12767,2104.05215,Xiangde Luo,"Xiangde Luo, Tao Song, Guotai Wang, Jieneng Chen, Yinan Chen, Kang Li,
  Dimitris N. Metaxas and Shaoting Zhang","SCPM-Net: An Anchor-free 3D Lung Nodule Detection Network using Sphere
  Representation and Center Points Matching",accept to Medical Image Analysis,,10.1016/j.media.2021.102287,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Lung nodule detection from 3D Computed Tomography scans plays a vital role in
efficient lung cancer screening. Despite the SOTA performance obtained by
recent anchor-based detectors using CNNs for this task, they require
predetermined anchor parameters such as the size, number, and aspect ratio of
anchors, and have limited robustness when dealing with lung nodules with a
massive variety of sizes. To overcome these problems, we propose a 3D sphere
representation-based center-points matching detection network that is
anchor-free and automatically predicts the position, radius, and offset of
nodules without the manual design of nodule/anchor parameters. The SCPM-Net
consists of two novel components: sphere representation and center points
matching. First, to match the nodule annotation in clinical practice, we
replace the commonly used bounding box with our proposed bounding sphere to
represent nodules with the centroid, radius, and local offset in 3D space. A
compatible sphere-based intersection over-union loss function is introduced to
train the lung nodule detection network stably and efficiently. Second, we
empower the network anchor-free by designing a positive center-points selection
and matching process, which naturally discards pre-determined anchor boxes. An
online hard example mining and re-focal loss subsequently enable the CPM
process to be more robust, resulting in more accurate point assignment and
mitigation of class imbalance. In addition, to better capture spatial
information and 3D context for the detection, we propose to fuse multi-level
spatial coordinate maps with the feature extractor and combine them with 3D
squeeze-and-excitation attention modules. Experimental results on the LUNA16
dataset showed that our proposed framework achieves superior performance
compared with existing anchor-based and anchor-free methods for lung nodule
detection.
","[{'version': 'v1', 'created': 'Mon, 12 Apr 2021 05:51:29 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Jan 2022 09:13:15 GMT'}]",2022-01-07,"[['Luo', 'Xiangde', ''], ['Song', 'Tao', ''], ['Wang', 'Guotai', ''], ['Chen', 'Jieneng', ''], ['Chen', 'Yinan', ''], ['Li', 'Kang', ''], ['Metaxas', 'Dimitris N.', ''], ['Zhang', 'Shaoting', '']]","['Lung nodule detection', 'anchor-free detection', 'sphere representation', 'center points matching']"
12768,1902.02860,Saeed Khaki,Saeed Khaki and Lizhi Wang,Crop Yield Prediction Using Deep Neural Networks,"9 pages, Presented at 2018 INFORMS Conference on Business Analytics
  and Operations Research (Baltimore, MD, USA). One of the winning solutions to
  the 2018 Syngenta Crop Challenge","Frontiers in Plant Science, 10:621, 2019",10.3389/fpls.2019.00621,,cs.LG stat.AP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crop yield is a highly complex trait determined by multiple factors such as
genotype, environment, and their interactions. Accurate yield prediction
requires fundamental understanding of the functional relationship between yield
and these interactive factors, and to reveal such relationship requires both
comprehensive datasets and powerful algorithms. In the 2018 Syngenta Crop
Challenge, Syngenta released several large datasets that recorded the genotype
and yield performances of 2,267 maize hybrids planted in 2,247 locations
between 2008 and 2016 and asked participants to predict the yield performance
in 2017. As one of the winning teams, we designed a deep neural network (DNN)
approach that took advantage of state-of-the-art modeling and solution
techniques. Our model was found to have a superior prediction accuracy, with a
root-mean-square-error (RMSE) being 12% of the average yield and 50% of the
standard deviation for the validation dataset using predicted weather data.
With perfect weather data, the RMSE would be reduced to 11% of the average
yield and 46% of the standard deviation. We also performed feature selection
based on the trained DNN model, which successfully decreased the dimension of
the input space without significant drop in the prediction accuracy. Our
computational results suggested that this model significantly outperformed
other popular methods such as Lasso, shallow neural networks (SNN), and
regression tree (RT). The results also revealed that environmental factors had
a greater effect on the crop yield than genotype.
","[{'version': 'v1', 'created': 'Thu, 7 Feb 2019 21:54:00 GMT'}, {'version': 'v2', 'created': 'Wed, 22 May 2019 21:53:26 GMT'}, {'version': 'v3', 'created': 'Mon, 10 Jun 2019 18:20:24 GMT'}]",2019-06-12,"[['Khaki', 'Saeed', ''], ['Wang', 'Lizhi', '']]","['Yield Prediction', 'Machine Learning', 'Deep Learning', 'Feature Selection', 'Weather Prediction']"
12769,1905.11013,Hao Wang,"Hao Wang, Tong Xu, Qi Liu, Defu Lian, Enhong Chen, Dongfang Du, Han
  Wu, Wen Su","MCNE: An End-to-End Framework for Learning Multiple Conditional Network
  Representations of Social Network","Accepted by KDD 2019 Research Track. In Proceedings of the 25th ACM
  SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'19)",,10.1145/3292500.3330931,,cs.SI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, the Network Representation Learning (NRL) techniques, which
represent graph structure via low-dimension vectors to support social-oriented
application, have attracted wide attention. Though large efforts have been
made, they may fail to describe the multiple aspects of similarity between
social users, as only a single vector for one unique aspect has been
represented for each node. To that end, in this paper, we propose a novel
end-to-end framework named MCNE to learn multiple conditional network
representations, so that various preferences for multiple behaviors could be
fully captured. Specifically, we first design a binary mask layer to divide the
single vector as conditional embeddings for multiple behaviors. Then, we
introduce the attention network to model interaction relationship among
multiple preferences, and further utilize the adapted message sending and
receiving operation of graph neural network, so that multi-aspect preference
information from high-order neighbors will be captured. Finally, we utilize
Bayesian Personalized Ranking loss function to learn the preference similarity
on each behavior, and jointly learn multiple conditional node embeddings via
multi-task learning framework. Extensive experiments on public datasets
validate that our MCNE framework could significantly outperform several
state-of-the-art baselines, and further support the visualization and transfer
learning tasks with excellent interpretability and robustness.
","[{'version': 'v1', 'created': 'Mon, 27 May 2019 07:29:48 GMT'}]",2019-05-28,"[['Wang', 'Hao', ''], ['Xu', 'Tong', ''], ['Liu', 'Qi', ''], ['Lian', 'Defu', ''], ['Chen', 'Enhong', ''], ['Du', 'Dongfang', ''], ['Wu', 'Han', ''], ['Su', 'Wen', '']]","['Network Embedding', 'Social Netowrk', 'Conditional Representation']"
12770,1401.1882,YuLi Sun,Yuli Sun and Jinxu Tao,Image reconstruction from few views by L0-norm optimization,"11 pages,5 figures, 1 table",,10.1088/1674-1056/23/7/078703,,cs.IT cs.CV math.IT,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The L1-norm of the gradient-magnitude images (GMI), which is the well-known
total variation (TV) model, is widely used as regularization in the few views
CT reconstruction. As the L1-norm TV regularization is tending to uniformly
penalize the image gradient and the low-contrast structures are sometimes over
smoothed, we proposed a new algorithm based on the L0-norm of the GMI to deal
with the few views problem. To rise to the challenges introduced by the L0-norm
DGT, the algorithm uses a pseudo-inverse transform of DGT and adapts an
iterative hard thresholding (IHT) algorithm, whose convergence and effective
efficiency have been theoretically proven. The simulation indicates that the
algorithm proposed in this paper can obviously improve the reconstruction
quality.
","[{'version': 'v1', 'created': 'Thu, 9 Jan 2014 02:08:06 GMT'}]",2019-05-01,"[['Sun', 'Yuli', ''], ['Tao', 'Jinxu', '']]","['iterative hard thresholding', 'few views reconstruction', 'sparse', '0\uf06c -norm optimization']"
12771,2205.00716,Hermann Kroll,"Hermann Kroll and Jan Pirklbauer and Florian Pl\""otzky and Wolf-Tilo
  Balke","A Library Perspective on Nearly-Unsupervised Information Extraction
  Workflows in Digital Libraries","Accepted at JCDL2022, 11 pages, 1 figure",,10.1145/3529372.3530924,,cs.CL cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Information extraction can support novel and effective access paths for
digital libraries. Nevertheless, designing reliable extraction workflows can be
cost-intensive in practice. On the one hand, suitable extraction methods rely
on domain-specific training data. On the other hand, unsupervised and open
extraction methods usually produce not-canonicalized extraction results. This
paper tackles the question how digital libraries can handle such extractions
and if their quality is sufficient in practice. We focus on unsupervised
extraction workflows by analyzing them in case studies in the domains of
encyclopedias (Wikipedia), pharmacy and political sciences. We report on
opportunities and limitations. Finally we discuss best practices for
unsupervised extraction workflows.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 08:11:32 GMT'}]",2022-05-03,"[['Kroll', 'Hermann', ''], ['Pirklbauer', 'Jan', ''], ['Plötzky', 'Florian', ''], ['Balke', 'Wolf-Tilo', '']]","['Open Information Extraction', 'Workflows', 'Digital Libraries']"
12772,2001.05414,Matus Medo,"Shuqi Xu, Manuel Sebastian Mariani, Linyuan L\""u, Mat\'u\v{s} Medo","Unbiased evaluation of ranking metrics reveals consistent performance in
  science and technology citation data","21 pages, 11 figures, 5 tables",,10.1016/j.joi.2019.101005,"Journal of Informetrics 14(1), 101005 (2020)",cs.SI cs.DL cs.IR physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the increasing use of citation-based metrics for research evaluation
purposes, we do not know yet which metrics best deliver on their promise to
gauge the significance of a scientific paper or a patent. We assess 17
network-based metrics by their ability to identify milestone papers and patents
in three large citation datasets. We find that traditional
information-retrieval evaluation metrics are strongly affected by the interplay
between the age distribution of the milestone items and age biases of the
evaluated metrics. Outcomes of these metrics are therefore not representative
of the metrics' ranking ability. We argue in favor of a modified evaluation
procedure that explicitly penalizes biased metrics and allows us to reveal
metrics' performance patterns that are consistent across the datasets. PageRank
and LeaderRank turn out to be the best-performing ranking metrics when their
age bias is suppressed by a simple transformation of the scores that they
produce, whereas other popular metrics, including citation count, HITS and
Collective Influence, produce significantly worse ranking results.
","[{'version': 'v1', 'created': 'Wed, 15 Jan 2020 16:34:21 GMT'}]",2020-07-10,"[['Xu', 'Shuqi', ''], ['Mariani', 'Manuel Sebastian', ''], ['Lü', 'Linyuan', ''], ['Medo', 'Matúš', '']]","['Citation networks', 'Network ranking metrics', 'Node centrality', 'Metrics evaluation', 'Milestone scientificpapers', 'patents']"
12773,2006.13615,Francisco Cruz,Francisco Cruz and Richard Dazeley and Peter Vamplew and Ithan Moreira,"Explainable robotic systems: Understanding goal-driven actions in a
  reinforcement learning scenario","26 pages, 10 figures",,10.1007/s00521-021-06425-5,,cs.AI cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robotic systems are more present in our society everyday. In human-robot
environments, it is crucial that end-users may correctly understand their
robotic team-partners, in order to collaboratively complete a task. To increase
action understanding, users demand more explainability about the decisions by
the robot in particular situations. Recently, explainable robotic systems have
emerged as an alternative focused not only on completing a task satisfactorily,
but also on justifying, in a human-like manner, the reasons that lead to making
a decision. In reinforcement learning scenarios, a great effort has been
focused on providing explanations using data-driven approaches, particularly
from the visual input modality in deep learning-based systems. In this work, we
focus rather on the decision-making process of reinforcement learning agents
performing a task in a robotic scenario. Experimental results are obtained
using 3 different set-ups, namely, a deterministic navigation task, a
stochastic navigation task, and a continuous visual-based sorting object task.
As a way to explain the goal-driven robot's actions, we use the probability of
success computed by three different proposed approaches: memory-based,
learning-based, and introspection-based. The difference between these
approaches is the amount of memory required to compute or estimate the
probability of success as well as the kind of reinforcement learning
representation where they could be used. In this regard, we use the
memory-based approach as a baseline since it is obtained directly from the
agent's observations. When comparing the learning-based and the
introspection-based approaches to this baseline, both are found to be suitable
alternatives to compute the probability of success, obtaining high levels of
similarity when compared using both the Pearson's correlation and the mean
squared error.
","[{'version': 'v1', 'created': 'Wed, 24 Jun 2020 10:51:14 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jul 2020 05:47:44 GMT'}, {'version': 'v3', 'created': 'Thu, 2 Sep 2021 07:17:22 GMT'}]",2021-09-03,"[['Cruz', 'Francisco', ''], ['Dazeley', 'Richard', ''], ['Vamplew', 'Peter', ''], ['Moreira', 'Ithan', '']]","['Explainable robotic systems', 'Explainable reinforcement learning', 'Goal-driven explanations', 'Human-robot environment', 'Human-aligned artificialintelligence']"
12774,2009.11190,Ulrich Kerzel,U. Kerzel,"Enterprise AI Canvas -- Integrating Artificial Intelligence into
  Business","Accepted at ""Applied Artificial Intelligence UAAI""",,10.1080/08839514.2020.1826146,,cs.CY cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Artificial Intelligence (AI) and Machine Learning have enormous potential to
transform businesses and disrupt entire industry sectors. However, companies
wishing to integrate algorithmic decisions into their face multiple challenges:
They have to identify use-cases in which artificial intelligence can create
value, as well as decisions that can be supported or executed automatically.
Furthermore, the organization will need to be transformed to be able to
integrate AI based systems into their human work-force. Furthermore, the more
technical aspects of the underlying machine learning model have to be discussed
in terms of how they impact the various units of a business: Where do the
relevant data come from, which constraints have to be considered, how is the
quality of the data and the prediction evaluated?
  The Enterprise AI canvas is designed to bring Data Scientist and business
expert together to discuss and define all relevant aspects which need to be
clarified in order to integrate AI based systems into a digital enterprise. It
consists of two parts where part one focuses on the business view and
organizational aspects, whereas part two focuses on the underlying machine
learning model and the data it uses.
","[{'version': 'v1', 'created': 'Fri, 18 Sep 2020 07:30:56 GMT'}]",2020-09-24,"[['Kerzel', 'U.', '']]","['artificial intelligence', 'business', 'decision making', 'canvas', 'value proposition']"
12775,2109.04717,Haoran Xie,"Haoran Xie, Takuma Torii, Aoshi Chiba, Qiukai Qi",xBalloon: Animated Objects with Balloon Plastic Actuator,"Proceedings of AH 2021.6 pages, 10 figures",,10.1145/3460881.3460933,,cs.HC cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Shape-changing interfaces are promising for users to change the physical
properties of common objects. However, prevailing approaches of actuation
devices require either professional equipment or materials that are not
commonly accessible to non-professional users. In this work, we focus on the
controllable soft actuators with inflatable structures because they are soft
thus safe for human computer interaction. We propose a soft actuator design,
called xBalloon, that is workable, inexpensive and easy-to-fabricate. It
consists of daily materials including balloons and plastics and can realize
bending actuation very effectively. For characterization, we fabricated
xBalloon samples with different geometrical parameters and tested them
regarding the bending performance and found the analytical model describing the
relationship between the shape and the bending width. We then used xBalloons to
animate a series of common objects and all can work satisfactorily. We further
verified the user experience about the the fabrication and found that even
those with no prior robotic knowledge can fabricate xBalloons with ease and
confidence. Given all these advantages, we believe that xBalloon is an ideal
platform for interaction design and entertainment applications.
","[{'version': 'v1', 'created': 'Fri, 10 Sep 2021 07:50:32 GMT'}]",2021-09-13,"[['Xie', 'Haoran', ''], ['Torii', 'Takuma', ''], ['Chiba', 'Aoshi', ''], ['Qi', 'Qiukai', '']]","['pneumatic actuator', 'balloon', 'soft actuator', 'animated object']"
12776,2003.12250,Anil Ramachandran,"Anil Ramachandran, Sunil Gupta, Santu Rana, Cheng Li, Svetha Venkatesh",Incorporating Expert Prior in Bayesian Optimisation via Space Warping,"21 Pages, 8 figures. To be published in Elsevier",Knowledge-Based Systems (2020) 105663,10.1016/j.knosys.2020.105663,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bayesian optimisation is a well-known sample-efficient method for the
optimisation of expensive black-box functions. However when dealing with big
search spaces the algorithm goes through several low function value regions
before reaching the optimum of the function. Since the function evaluations are
expensive in terms of both money and time, it may be desirable to alleviate
this problem. One approach to subside this cold start phase is to use prior
knowledge that can accelerate the optimisation. In its standard form, Bayesian
optimisation assumes the likelihood of any point in the search space being the
optimum is equal. Therefore any prior knowledge that can provide information
about the optimum of the function would elevate the optimisation performance.
In this paper, we represent the prior knowledge about the function optimum
through a prior distribution. The prior distribution is then used to warp the
search space in such a way that space gets expanded around the high probability
region of function optimum and shrinks around low probability region of
optimum. We incorporate this prior directly in function model (Gaussian
process), by redefining the kernel matrix, which allows this method to work
with any acquisition function, i.e. acquisition agnostic approach. We show the
superiority of our method over standard Bayesian optimisation method through
optimisation of several benchmark functions and hyperparameter tuning of two
algorithms: Support Vector Machine (SVM) and Random forest.
","[{'version': 'v1', 'created': 'Fri, 27 Mar 2020 06:18:49 GMT'}]",2020-03-31,"[['Ramachandran', 'Anil', ''], ['Gupta', 'Sunil', ''], ['Rana', 'Santu', ''], ['Li', 'Cheng', ''], ['Venkatesh', 'Svetha', '']]","['Bayesian optimisation', 'Gaussian process', 'Black-box function', 'Probabilityintegrity transform', 'Space warping']"
12777,2203.06907,Youming Deng,"Youming Deng, Yansheng Li, Yongjun Zhang, Xiang Xiang, Jian Wang,
  Jingdong Chen, Jiayi Ma",Hierarchical Memory Learning for Fine-Grained Scene Graph Generation,,,10.1007/978-3-031-19812-0_16,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As far as Scene Graph Generation (SGG), coarse and fine predicates mix in the
dataset due to the crowd-sourced labeling, and the long-tail problem is also
pronounced. Given this tricky situation, many existing SGG methods treat the
predicates equally and learn the model under the supervision of
mixed-granularity predicates in one stage, leading to relatively coarse
predictions. In order to alleviate the negative impact of the suboptimum
mixed-granularity annotation and long-tail effect problems, this paper proposes
a novel Hierarchical Memory Learning (HML) framework to learn the model from
simple to complex, which is similar to the human beings' hierarchical memory
learning process. After the autonomous partition of coarse and fine predicates,
the model is first trained on the coarse predicates and then learns the fine
predicates. In order to realize this hierarchical learning pattern, this paper,
for the first time, formulates the HML framework using the new Concept
Reconstruction (CR) and Model Reconstruction (MR) constraints. It is worth
noticing that the HML framework can be taken as one general optimization
strategy to improve various SGG models, and significant improvement can be
achieved on the SGG benchmark (i.e., Visual Genome).
","[{'version': 'v1', 'created': 'Mon, 14 Mar 2022 08:01:14 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Mar 2022 03:53:11 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Mar 2022 09:14:57 GMT'}, {'version': 'v4', 'created': 'Thu, 11 Aug 2022 02:58:19 GMT'}]",2022-12-19,"[['Deng', 'Youming', ''], ['Li', 'Yansheng', ''], ['Zhang', 'Yongjun', ''], ['Xiang', 'Xiang', ''], ['Wang', 'Jian', ''], ['Chen', 'Jingdong', ''], ['Ma', 'Jiayi', '']]","['Scene Graph Generation', 'Mixed-Granularity Annotation', 'Hierarchical Memory Learning']"
12778,1909.08991,Gilberto Ochoa-Ruiz,"A.A. Angulo, J.A. Vega-Fern\'andez, L.M. Aguilar-Lobo, S. Natraj and G
  Ochoa-Ruiz","Road Damage Detection Acquisition System based on Deep Neural Networks
  for Physical Asset Management",,,10.1007/978-3-030-33749-0_1,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Research on damage detection of road surfaces has been an active area of
re-search, but most studies have focused so far on the detection of the
presence of damages. However, in real-world scenarios, road managers need to
clearly understand the type of damage and its extent in order to take effective
action in advance or to allocate the necessary resources. Moreover, currently
there are few uniform and openly available road damage datasets, leading to a
lack of a common benchmark for road damage detection. Such dataset could be
used in a great variety of applications; herein, it is intended to serve as the
acquisition component of a physical asset management tool which can aid
governments agencies for planning purposes, or by infrastructure mainte-nance
companies. In this paper, we make two contributions to address these issues.
First, we present a large-scale road damage dataset, which includes a more
balanced and representative set of damages. This dataset is composed of 18,034
road damage images captured with a smartphone, with 45,435 in-stances road
surface damages. Second, we trained different types of object detection
methods, both traditional (an LBP-cascaded classifier) and deep learning-based,
specifically, MobileNet and RetinaNet, which are amenable for embedded and
mobile and implementations with an acceptable perfor-mance for many
applications. We compare the accuracy and inference time of all these models
with others in the state of the art.
","[{'version': 'v1', 'created': 'Thu, 19 Sep 2019 13:43:31 GMT'}]",2022-01-21,"[['Angulo', 'A. A.', ''], ['Vega-Fernández', 'J. A.', ''], ['Aguilar-Lobo', 'L. M.', ''], ['Natraj', 'S.', ''], ['Ochoa-Ruiz', 'G', '']]","['Road Damage', 'Deep Learning', 'DNNs', 'Generic Object Detection']"
12779,2109.07411,Guohai Xu,"Guohai Xu, Hehong Chen, Feng-Lin Li, Fu Sun, Yunzhou Shi, Zhixiong
  Zeng, Wei Zhou, Zhongzhou Zhao, Ji Zhang",AliMe MKG: A Multi-modal Knowledge Graph for Live-streaming E-commerce,CIKM2021,,10.1145/3459637.3481983,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Live streaming is becoming an increasingly popular trend of sales in
E-commerce. The core of live-streaming sales is to encourage customers to
purchase in an online broadcasting room. To enable customers to better
understand a product without jumping out, we propose AliMe MKG, a multi-modal
knowledge graph that aims at providing a cognitive profile for products,
through which customers are able to seek information about and understand a
product. Based on the MKG, we build an online live assistant that highlights
product search, product exhibition and question answering, allowing customers
to skim over item list, view item details, and ask item-related questions. Our
system has been launched online in the Taobao app, and currently serves
hundreds of thousands of customers per day.
","[{'version': 'v1', 'created': 'Mon, 13 Sep 2021 06:14:30 GMT'}]",2021-09-16,"[['Xu', 'Guohai', ''], ['Chen', 'Hehong', ''], ['Li', 'Feng-Lin', ''], ['Sun', 'Fu', ''], ['Shi', 'Yunzhou', ''], ['Zeng', 'Zhixiong', ''], ['Zhou', 'Wei', ''], ['Zhao', 'Zhongzhou', ''], ['Zhang', 'Ji', '']]","['Knowledge Graph', 'Multi-modality', 'Live-streaming', 'E-commerce']"
12780,2207.10482,Bestami Gunay,"Bestami G\""unay, Sefa Burak Okcu and Hasan \c{S}akir Bilge",LPYOLO: Low Precision YOLO for Face Detection on FPGA,Accepted to MVML2022,"Proceedings of the 8th World Congress on Electrical Engineering
  and Computer Systems and Sciences (2022)",10.11159/mvml22.108,,cs.CV cs.AR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  In recent years, number of edge computing devices and artificial intelligence
applications on them have advanced excessively. In edge computing, decision
making processes and computations are moved from servers to edge devices.
Hence, cheap and low power devices are required. FPGAs are very low power,
inclined to do parallel operations and deeply suitable devices for running
Convolutional Neural Networks (CNN) which are the fundamental unit of an
artificial intelligence application. Face detection on surveillance systems is
the most expected application on the security market. In this work, TinyYolov3
architecture is redesigned and deployed for face detection. It is a CNN based
object detection method and developed for embedded systems. PYNQ-Z2 is selected
as a target board which has low-end Xilinx Zynq 7020 System-on-Chip (SoC) on
it. Redesigned TinyYolov3 model is defined in numerous bit width precisions
with Brevitas library which brings fundamental CNN layers and activations in
integer quantized form. Then, the model is trained in a quantized structure
with WiderFace dataset. In order to decrease latency and power consumption,
onchip memory of the FPGA is configured as a storage of whole network
parameters and the last activation function is modified as rescaled HardTanh
instead of Sigmoid. Also, high degree of parallelism is applied to logical
resources of the FPGA. The model is converted to an HLS based application with
using FINN framework and FINN-HLS library which includes the layer definitions
in C++. Later, the model is synthesized and deployed. CPU of the SoC is
employed with multithreading mechanism and responsible for preprocessing,
postprocessing and TCP/IP streaming operations. Consequently, 2.4 Watt total
board power consumption, 18 Frames-Per-Second (FPS) throughput and 0.757 mAP
accuracy rate on Easy category of the WiderFace are achieved with 4 bits
precision model.
","[{'version': 'v1', 'created': 'Thu, 21 Jul 2022 13:54:52 GMT'}]",2022-07-22,"[['Günay', 'Bestami', ''], ['Okcu', 'Sefa Burak', ''], ['Bilge', 'Hasan Şakir', '']]","['Quantized Neural Networks', 'TinyYolo', 'FPGA', 'Face Detection   1']"
12781,2011.13511,Sina Amini Niaki,"Sina Amini Niaki, Ehsan Haghighat, Trevor Campbell, Anoush Poursartip,
  Reza Vaziri","Physics-Informed Neural Network for Modelling the Thermochemical Curing
  Process of Composite-Tool Systems During Manufacture",,CMAME 384 (2021) 113959,10.1016/j.cma.2021.113959,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a Physics-Informed Neural Network (PINN) to simulate the
thermochemical evolution of a composite material on a tool undergoing cure in
an autoclave. In particular, we solve the governing coupled system of
differential equations -- including conductive heat transfer and resin cure
kinetics -- by optimizing the parameters of a deep neural network (DNN) using a
physics-based loss function. To account for the vastly different behaviour of
thermal conduction and resin cure, we design a PINN consisting of two
disconnected subnetworks, and develop a sequential training algorithm that
mitigates instability present in traditional training methods. Further, we
incorporate explicit discontinuities into the DNN at the composite-tool
interface and enforce known physical behaviour directly in the loss function to
improve the solution near the interface. We train the PINN with a technique
that automatically adapts the weights on the loss terms corresponding to PDE,
boundary, interface, and initial conditions. Finally, we demonstrate that one
can include problem parameters as an input to the model -- resulting in a
surrogate that provides real-time simulation for a range of problem settings --
and that one can use transfer learning to significantly reduce the training
time for problem settings similar to that of an initial trained model. The
performance of the proposed PINN is demonstrated in multiple scenarios with
different material thicknesses and thermal boundary conditions.
","[{'version': 'v1', 'created': 'Fri, 27 Nov 2020 00:56:15 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Jun 2021 22:11:45 GMT'}]",2021-06-16,"[['Niaki', 'Sina Amini', ''], ['Haghighat', 'Ehsan', ''], ['Campbell', 'Trevor', ''], ['Poursartip', 'Anoush', ''], ['Vaziri', 'Reza', '']]","['Physics-Informed Neural Networks', 'Deep Learning', 'Composites Processing', 'Exothermic Heat Transfer', 'Resin Reaction', 'Surrogate Modeling']"
12782,1805.00862,Hadrien Van Lierde,"H. Van Lierde (1), T. W. S. Chow (1), J.-C. Delvenne (2) ((1) City
  University of Hong Kong, (2) Universite Catholique de Louvain)","Spectral clustering algorithms for the detection of clusters in
  block-cyclic and block-acyclic graphs","This is the unrefereed Author's Original Version of the article. A
  peer-reviewed version has been accepted for publication in the Journal of
  Complex Networks published by Oxford University Press. The present version is
  not the Accepted Manuscript","Journal of Complex Networks, cny011 (2018)",10.1093/comnet/cny011,,cs.DS cs.CV cs.DM stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose two spectral algorithms for partitioning nodes in directed graphs
respectively with a cyclic and an acyclic pattern of connection between groups
of nodes. Our methods are based on the computation of extremal eigenvalues of
the transition matrix associated to the directed graph. The two algorithms
outperform state-of-the art methods for directed graph clustering on synthetic
datasets, including methods based on blockmodels, bibliometric symmetrization
and random walks. Our algorithms have the same space complexity as classical
spectral clustering algorithms for undirected graphs and their time complexity
is also linear in the number of edges in the graph. One of our methods is
applied to a trophic network based on predator-prey relationships. It
successfully extracts common categories of preys and predators encountered in
food chains. The same method is also applied to highlight the hierarchical
structure of a worldwide network of Autonomous Systems depicting business
agreements between Internet Service Providers.
","[{'version': 'v1', 'created': 'Wed, 2 May 2018 15:19:49 GMT'}]",2018-05-09,"[['Van Lierde', 'H.', ''], ['Chow', 'T. W. S.', ''], ['Delvenne', 'J. -C.', '']]","['Complex networks', 'spectral clustering', 'cyclic graph', 'acyclicgraph', 'stochastic blockmodel', 'directed graph']"
12783,2208.04022,Wen-Ji Zhou,"Qianying Lin, Wen-Ji Zhou, Yanshi Wang, Qing Da, Qing-Guo Chen, Bing
  Wang","Sparse Attentive Memory Network for Click-through Rate Prediction with
  Long Sequences","Published as a conference paper at the 31st ACM International
  Conference on Information and Knowledge Management, CIKM 2022",,10.1145/3511808.3557095,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sequential recommendation predicts users' next behaviors with their
historical interactions. Recommending with longer sequences improves
recommendation accuracy and increases the degree of personalization. As
sequences get longer, existing works have not yet addressed the following two
main challenges. Firstly, modeling long-range intra-sequence dependency is
difficult with increasing sequence lengths. Secondly, it requires efficient
memory and computational speeds. In this paper, we propose a Sparse Attentive
Memory (SAM) network for long sequential user behavior modeling. SAM supports
efficient training and real-time inference for user behavior sequences with
lengths on the scale of thousands. In SAM, we model the target item as the
query and the long sequence as the knowledge database, where the former
continuously elicits relevant information from the latter. SAM simultaneously
models target-sequence dependencies and long-range intra-sequence dependencies
with O(L) complexity and O(1) number of sequential updates, which can only be
achieved by the self-attention mechanism with O(L^2) complexity. Extensive
empirical results demonstrate that our proposed solution is effective not only
in long user behavior modeling but also on short sequences modeling.
Implemented on sequences of length 1000, SAM is successfully deployed on one of
the largest international E-commerce platforms. This inference time is within
30ms, with a substantial 7.30% click-through rate improvement for the online
A/B test. To the best of our knowledge, it is the first end-to-end long user
sequence modeling framework that models intra-sequence and target-sequence
dependencies with the aforementioned degree of efficiency and successfully
deployed on a large-scale real-time industrial recommender system.
","[{'version': 'v1', 'created': 'Mon, 8 Aug 2022 10:11:46 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Sep 2022 06:17:49 GMT'}]",2022-09-05,"[['Lin', 'Qianying', ''], ['Zhou', 'Wen-Ji', ''], ['Wang', 'Yanshi', ''], ['Da', 'Qing', ''], ['Chen', 'Qing-Guo', ''], ['Wang', 'Bing', '']]","['Sequential Recommenders', 'Long User Behavior Modeling', 'LongSequences', 'Click-through Rate Prediction', 'Memory Networks']"
12784,2203.04384,Georgios Tsialiamanis,"G. Tsialiamanis, D.J. Wagg, N. Dervilis, K. Worden",On generative models as the basis for digital twins,,"Data-Centric Engineering , Volume 2 , 2021",10.1017/dce.2021.13,,cs.LG cs.SY eess.SY stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  A framework is proposed for generative models as a basis for digital twins or
mirrors of structures. The proposal is based on the premise that deterministic
models cannot account for the uncertainty present in most structural modelling
applications. Two different types of generative models are considered here. The
first is a physics-based model based on the stochastic finite element (SFE)
method, which is widely used when modelling structures that have material and
loading uncertainties imposed. Such models can be calibrated according to data
from the structure and would be expected to outperform any other model if the
modelling accurately captures the true underlying physics of the structure. The
potential use of SFE models as digital mirrors is illustrated via application
to a linear structure with stochastic material properties. For situations where
the physical formulation of such models does not suffice, a data-driven
framework is proposed, using machine learning and conditional generative
adversarial networks (cGANs). The latter algorithm is used to learn the
distribution of the quantity of interest in a structure with material
nonlinearities and uncertainties. For the examples considered in this work, the
data-driven cGANs model outperform the physics-based approach. Finally, an
example is shown where the two methods are coupled such that a hybrid model
approach is demonstrated.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2022 20:34:56 GMT'}]",2022-03-10,"[['Tsialiamanis', 'G.', ''], ['Wagg', 'D. J.', ''], ['Dervilis', 'N.', ''], ['Worden', 'K.', '']]","['Digital twins', 'mirror models', 'generative models', 'stochastic finite elements', 'generativeadversarial network (GAN)', 'conditional GAN (cGAN)']"
12785,1904.10169,Vahid Ranjbar,"Shaghayegh Najari, Mostafa Salehi, Vahid Ranjbar, Mahdi Jalili",Link Prediction in Multiplex Networks based on Interlayer Similarity,,,10.1016/j.physa.2019.04.214,,cs.SI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Some networked systems can be better modelled by multilayer structure where
the individual nodes develop relationships in multiple layers. Multilayer
networks with similar nodes across layers are also known as multiplex networks.
This manuscript proposes a novel framework for predicting forthcoming or
missing links in multiplex networks. The link prediction problem in multiplex
networks is how to predict links in one of the layers, taking into account the
structural information of other layers. The proposed link prediction framework
is based on interlayer similarity and proximity-based features extracted from
the layer for which the link prediction is considered. To this end, commonly
used proximity-based features such as Adamic-Adar and Jaccard Coefficient are
considered. These features that have been originally proposed to predict
missing links in monolayer networks, do not require learning, and thus are
simple to compute. The proposed method introduces a systematic approach to take
into account interlayer similarity for the link prediction purpose.
Experimental results on both synthetic and real multiplex networks reveal the
effectiveness of the proposed method and show its superior performance than
state-of-the-art algorithms proposed for the link prediction problem in
multiplex networks.
","[{'version': 'v1', 'created': 'Tue, 23 Apr 2019 06:18:55 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Apr 2019 19:47:46 GMT'}]",2020-01-08,"[['Najari', 'Shaghayegh', ''], ['Salehi', 'Mostafa', ''], ['Ranjbar', 'Vahid', ''], ['Jalili', 'Mahdi', '']]","['Link Prediction', 'Multiplex network', 'Multirelational Network', 'Machine Learning', 'Complex Network']"
12786,1911.00666,Hui Li,"Hui Li, Jimin Xiao, Mingjie Sun, Eng Gee Lim, Yao Zhao","Progressive Sample Mining and Representation Learning for One-Shot
  Person Re-identification with Adversarial Samples",,,10.1016/j.patcog.2020.107614,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we aim to tackle the one-shot person re-identification problem
where only one image is labelled for each person, while other images are
unlabelled. This task is challenging due to the lack of sufficient labelled
training data. To tackle this problem, we propose to iteratively guess pseudo
labels for the unlabeled image samples, which are later used to update the
re-identification model together with the labelled samples. A new sampling
mechanism is designed to select unlabeled samples to pseudo labelled samples
based on the distance matrix, and to form a training triplet batch including
both labelled samples and pseudo labelled samples. We also design an
HSoften-Triplet-Loss to soften the negative impact of the incorrect pseudo
label, considering the unreliable nature of pseudo labelled samples. Finally,
we deploy an adversarial learning method to expand the image samples to
different camera views. Our experiments show that our framework achieves a new
state-of-the-art one-shot Re-ID performance on Market-1501 (mAP 42.7%) and
DukeMTMC-Reid dataset (mAP 40.3%). Code will be available soon.
","[{'version': 'v1', 'created': 'Sat, 2 Nov 2019 06:44:58 GMT'}]",2022-01-21,"[['Li', 'Hui', ''], ['Xiao', 'Jimin', ''], ['Sun', 'Mingjie', ''], ['Lim', 'Eng Gee', ''], ['Zhao', 'Yao', '']]","['Re-ID', 'One-shot', 'Semi-supervised', 'GAN']"
12787,2012.00265,Charles Martin,Charles Martin,Performing with a Mobile Computer System for Vibraphone,,"Proceedings of the International Conference on New Interfaces for
  Musical Expression (2013), pp. 377-380",10.5281/zenodo.1178602,,cs.SD cs.HC eess.AS,http://creativecommons.org/licenses/by/4.0/,"  This paper describes the development of an Apple iPhone based mobile computer
system for vibraphone and its use in a series of the author's performance
projects in 2011 and 2012. This artistic research was motivated by a desire to
develop an alternative to laptop computers for the author's existing percussion
and computer performance practice. The aims were to develop a light, compact
and flexible system using mobile devices that would allow computer music to
infiltrate solo and ensemble performance situations where it is difficult to
use a laptop computer. The project began with a system that brought computer
elements to Nordlig Vinter, a suite of percussion duos, using an iPhone, RjDj,
Pure Data and a home-made pickup system. This process was documented with video
recordings and analysed using ethnographic methods. The mobile computer music
setup proved to be elegant and convenient in performance situations with very
little time and space to set up, as well as in performance classes and
workshops. The simple mobile system encouraged experimentation and the
platforms used enabled sharing with a wider audience.
","[{'version': 'v1', 'created': 'Tue, 1 Dec 2020 04:57:25 GMT'}]",2020-12-02,"[['Martin', 'Charles', '']]","['percussion', 'mobile computer music', 'Apple iOS', 'collaborative performance practice', 'ethnography', 'artistic research']"
12788,2002.06187,Johannes Mey,"Johannes Mey (TU Dresden, Germany), Thomas K\""uhn (Karlsruhe Institute
  of Technology, Germany), Ren\'e Sch\""one (TU Dresden, Germany), Uwe
  A{\ss}mann (TU Dresden, Germany)","Reusing Static Analysis across Different Domain-Specific Languages using
  Reference Attribute Grammars",,"The Art, Science, and Engineering of Programming, 2020, Vol. 4,
  Issue 3, Article 15",10.22152/programming-journal.org/2020/4/15,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Domain-specific languages (DSLs) enable domain experts to specify
tasks and problems themselves, while enabling static analysis to elucidate
issues in the modelled domain early. Although language workbenches have
simplified the design of DSLs and extensions to general purpose languages,
static analyses must still be implemented manually.
  Inquiry: Moreover, static analyses, e.g., complexity metrics, dependency
analysis, and declaration-use analysis, are usually domain-dependent and cannot
be easily reused. Therefore, transferring existing static analyses to another
DSL incurs a huge implementation overhead. However, this overhead is not always
intrinsically necessary: in many cases, while the concepts of the DSL on which
a static analysis is performed are domain-specific, the underlying algorithm
employed in the analysis is actually domain-independent and thus can be reused
in principle, depending on how it is specified. While current approaches either
implement static analyses internally or with an external Visitor, the
implementation is tied to the language's grammar and cannot be reused easily.
Thus far, a commonly used approach that achieves reusable static analysis
relies on the transformation into an intermediate representation upon which the
analysis is performed. This, however, entails a considerable additional
implementation effort.
  Approach: To remedy this, it has been proposed to map the necessary
domain-specific concepts to the algorithm's domain-independent data structures,
yet without a practical implementation and the demonstration of reuse. Thus, to
make static analysis reusable again, we employ relational Reference Attribute
Grammars (RAGs) by creating such a mapping to a domain-independent overlay
structure using higher-order attributes.
  Knowledge: We describe how static analysis can be specified on
analysis-specific data structures, how relational RAGs can help with the
specification, and how a mapping from the domain-specific language can be
performed. Furthermore, we demonstrate how a static analysis for a DSL can be
externalized and reused in another general purpose language.
  Grounding: The approach was evaluated using the RAG system JastAdd. To
illustrate reusability, we implemented two analyses with two addressed
languages each: a cycle detection analysis used in a small state machine DSL
and for detecting circular dependencies in Java types and packages, and an
analysis of variable shadowing, applied to both Java and the Modelica modelling
language. Thereby, we demonstrate the reuse of two analysis algorithms in three
completely different domains. Additionally, we use the cycle detection analysis
to evaluate the efficiency by comparing our external analysis to an internal
reference implementation analysing all Java programs in the Qualitas Corpus and
thereby are able to show that an externalized analysis incurs only minimal
overhead.
  Importance: We make static analysis reusable, again, showing the practicality
and efficiency of externalizing static analysis for both DSLs and general
purpose languages using relational RAGs.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 18:58:55 GMT'}]",2020-02-17,"[['Mey', 'Johannes', '', 'TU Dresden, Germany'], ['Kühn', 'Thomas', '', 'Karlsruhe Institute\n  of Technology, Germany'], ['Schöne', 'René', '', 'TU Dresden, Germany'], ['Aßmann', 'Uwe', '', 'TU Dresden, Germany']]","['reusability', 'domain specific languages', 'references attribute grammars', 'static analysis']"
12789,2110.06750,Darius Sas,"Darius Sas, Ilaria Pigazzini, Paris Avgeriou, Francesca Arcelli
  Fontana",The perception of Architectural Smells in industrial practice,"Submitted and accepted to IEEE Software special issue on Technical
  Debt. This is a preprint",,10.1109/MS.2021.3103664,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Architectural Technical Debt (ATD) is considered as the most significant type
of TD in industrial practice. In this study, we interview 21 software engineers
and architects to investigate a specific type of ATD, namely architectural
smells (AS). Our goal is to understand the phenomenon of AS better and support
practitioners to better manage it and researchers to offer relevant support.
The findings of this study provide insights on how practitioners perceive AS
and how they introduce them, the maintenance and evolution issues they
experienced and associated to the presence of AS, and what practices and tools
they adopt to manage AS.
","[{'version': 'v1', 'created': 'Wed, 13 Oct 2021 14:29:31 GMT'}]",2022-03-17,"[['Sas', 'Darius', ''], ['Pigazzini', 'Ilaria', ''], ['Avgeriou', 'Paris', ''], ['Fontana', 'Francesca Arcelli', '']]","['Technical Debt', 'Architectural Smells', 'Industrial Study', 'Case Study', 'Industrial experience']"
12790,1711.09286,Joachim Breitner,"Antal Spector-Zabusky and Joachim Breitner and Christine Rizkallah and
  Stephanie Weirich",Total Haskell is Reasonable Coq,"13 pages plus references. Published at CPP'18, In Proceedings of 7th
  ACM SIGPLAN International Conference on Certified Programs and Proofs
  (CPP'18). ACM, New York, NY, USA, 2018",,10.1145/3167092,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We would like to use the Coq proof assistant to mechanically verify
properties of Haskell programs. To that end, we present a tool, named
hs-to-coq, that translates total Haskell programs into Coq programs via a
shallow embedding. We apply our tool in three case studies -- a lawful Monad
instance, ""Hutton's razor"", and an existing data structure library -- and prove
their correctness. These examples show that this approach is viable: both that
hs-to-coq applies to existing Haskell code, and that the output it produces is
amenable to verification.
","[{'version': 'v1', 'created': 'Sat, 25 Nov 2017 20:49:58 GMT'}]",2017-11-28,"[['Spector-Zabusky', 'Antal', ''], ['Breitner', 'Joachim', ''], ['Rizkallah', 'Christine', ''], ['Weirich', 'Stephanie', '']]","['Coq', 'Haskell', 'verification']"
12791,2208.13447,Gordon Fraser,"Isabella Gra{\ss}l, Gordon Fraser","Gender-dependent Contribution, Code and Creativity in a Virtual
  Programming Course","To be published in the Proceedings of the 17th Workshop in Primary
  and Secondary Computing Education (WIPSCE'22)",,10.1145/3556787.3556861,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since computer science is still mainly male dominated, academia, industry and
education jointly seek ways to motivate and inspire girls, for example by
introducing them to programming at an early age. The recent COVID-19 pandemic
has forced many such endeavours to move to an online setting. While the
gender-dependent differences in programming courses have been studied
previously, for example revealing that girls may feel safer in same-sex groups,
much less is known about gender-specific differences in online programming
courses. In order to investigate whether gender-specific differences can be
observed in online courses, we conducted an online introductory programming
course for Scratch, in which we observed the gender-specific characteristics of
participants with respect to how they interact, their enjoyment, the code they
produce, and the creativity exposed by their programs. Overall, we observed no
significant differences between how girls participated in all-female vs. mixed
groups, and girls generally engaged with the course more actively than boys.
This suggests that online courses can be a useful means to avoid
gender-dependent group dynamics. However, when encouraging creative freedom in
programming, girls and boys seem to fall back to socially inherited
stereotypical behavior also in an online setting, influencing the choice of
programming concepts applied. This may inhibit learning and is a challenge that
needs to be addressed independently of whether courses are held online.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2022 09:29:37 GMT'}]",2022-08-30,"[['Graßl', 'Isabella', ''], ['Fraser', 'Gordon', '']]","['Scratch', 'gender', 'diversity', 'online course', 'primary education']"
12792,1811.07643,Marco Tulio Valente,"Hudson Borges, Marco Tulio Valente","What's in a GitHub Star? Understanding Repository Starring Practices in
  a Social Coding Platform","Accepted and published at Journal of Systems and Software, 146:
  112-129 (2018)","Journal of Systems and Software, pages 112-129, 2018",10.1016/j.jss.2018.09.016,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Besides a git-based version control system, GitHub integrates several social
coding features. Particularly, GitHub users can star a repository, presumably
to manifest interest or satisfaction with an open source project. However, the
real and practical meaning of starring a project was never the subject of an
in-depth and well-founded empirical investigation. Therefore, we provide in
this paper a throughout study on the meaning, characteristics, and dynamic
growth of GitHub stars. First, by surveying 791 developers, we report that
three out of four developers consider the number of stars before using or
contributing to a GitHub project. Then, we report a quantitative analysis on
the characteristics of the top-5,000 most starred GitHub repositories. We
propose four patterns to describe stars growth, which are derived after
clustering the time series representing the number of stars of the studied
repositories; we also reveal the perception of 115 developers about these
growth patterns. To conclude, we provide a list of recommendations to open
source project managers (e.g., on the importance of social media promotion) and
to GitHub users and Software Engineering researchers (e.g., on the risks faced
when selecting projects by GitHub stars).
","[{'version': 'v1', 'created': 'Mon, 19 Nov 2018 12:29:14 GMT'}]",2019-03-20,"[['Borges', 'Hudson', ''], ['Valente', 'Marco Tulio', '']]","['GitHub stars', 'Software Popularity', 'Social Coding']"
12793,2205.08412,Valentina Pansanella,"Valentina Pansanella, Giulio Rossetti and Letizia Milli","From mean-field to complex topologies: network effects on the
  algorithmic bias model","11 pages, 4 figures, Complex Networks & Their Applications X",,10.1007/978-3-030-93413-2_28,,cs.SI physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  Nowadays, we live in a society where people often form their opinion by
accessing and discussing contents shared on social networking websites. While
these platforms have fostered information access and diffusion, they represent
optimal environments for the proliferation of polluted contents, which is
argued to be one of the co-causes of polarization/radicalization. Moreover,
recommendation algorithms - intended to enhance platform usage - are likely to
augment such phenomena, generating the so called Algorithmic Bias. In this
work, we study the impact that different network topologies have on the
formation and evolution of opinion in the context of a recent opinion dynamic
model which includes bounded confidence and algorithmic bias. Mean-field,
scale-free and random topologies, as well as networks generated by the
Lancichinetti-Fortunato-Radicchi benchmark, are compared in terms of opinion
fragmentation/polarization and time to convergence.
","[{'version': 'v1', 'created': 'Tue, 17 May 2022 14:50:08 GMT'}]",2022-05-18,"[['Pansanella', 'Valentina', ''], ['Rossetti', 'Giulio', ''], ['Milli', 'Letizia', '']]","['opinion dynamics', 'complex networks', 'algorithmic bias']"
12794,2206.02904,Jonas Oppenlaender,Jonas Oppenlaender,The Creativity of Text-to-Image Generation,,,10.1145/3569219.3569352,,cs.HC cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Text-guided synthesis of images has made a giant leap towards becoming a
mainstream phenomenon. With text-to-image generation systems, anybody can
create digital images and artworks. This provokes the question of whether
text-to-image generation is creative. This paper expounds on the nature of
human creativity involved in text-to-image art (so-called ""AI art"") with a
specific focus on the practice of prompt engineering. The paper argues that the
current product-centered view of creativity falls short in the context of
text-to-image generation. A case exemplifying this shortcoming is provided and
the importance of online communities for the creative ecosystem of
text-to-image art is highlighted. The paper provides a high-level summary of
this online ecosystem drawing on Rhodes' conceptual four P model of creativity.
Challenges for evaluating the creativity of text-to-image generation and
opportunities for research on text-to-image generation in the field of
Human-Computer Interaction (HCI) are discussed.
","[{'version': 'v1', 'created': 'Fri, 13 May 2022 05:59:02 GMT'}, {'version': 'v2', 'created': 'Wed, 31 Aug 2022 07:45:43 GMT'}, {'version': 'v3', 'created': 'Fri, 28 Oct 2022 11:19:54 GMT'}, {'version': 'v4', 'created': 'Mon, 31 Oct 2022 09:56:44 GMT'}]",2022-11-01,"[['Oppenlaender', 'Jonas', '']]","['prompt engineering', 'text-to-image generation', 'text-guided imagesynthesis', 'creativity', 'Midjourney', 'AI art', 'generative art']"
12795,2008.02140,Francesco Dagnino,"Francesco Dagnino, Davide Ancona, Elena Zucca",Flexible coinductive logic programming,"Paper presented at the 36th International Conference on Logic
  Programming (ICLP 2019), University Of Calabria, Rende (CS), Italy, September
  2020, 16 pages",Theory and Practice of Logic Programming 20 (2020) 818-833,10.1017/S147106842000023X,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recursive definitions of predicates are usually interpreted either
inductively or coinductively. Recently, a more powerful approach has been
proposed, called flexible coinduction, to express a variety of intermediate
interpretations, necessary in some cases to get the correct meaning. We provide
a detailed formal account of an extension of logic programming supporting
flexible coinduction. Syntactically, programs are enriched by coclauses,
clauses with a special meaning used to tune the interpretation of predicates.
As usual, the declarative semantics can be expressed as a fixed point which,
however, is not necessarily the least, nor the greatest one, but is determined
by the coclauses. Correspondingly, the operational semantics is a combination
of standard SLD resolution and coSLD resolution. We prove that the operational
semantics is sound and complete with respect to declarative semantics
restricted to finite comodels. This paper is under consideration for acceptance
in TPLP.
","[{'version': 'v1', 'created': 'Wed, 5 Aug 2020 13:57:21 GMT'}]",2020-09-23,"[['Dagnino', 'Francesco', ''], ['Ancona', 'Davide', ''], ['Zucca', 'Elena', '']]","['coinduction', 'operational semantics', 'declarative semantics', 'soundness', 'completeness']"
12796,2107.12704,Staas De Jong,Staas de Jong,The cyclotactor: towards a tactile platform for musical interaction,"Proceedings of the International Conference on New Interfaces for
  Musical Expression, 2008",,10.5281/zenodo.1179571,,cs.HC cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  This paper reports on work in progress on a finger-based tactile I/O device
for musical interaction. Central to the device is the ability to set up
cyclical relationships between tactile input and output. A direct practical
application of this to musical interaction is given, using the idea to
multiplex two degrees of freedom on a single tactile loop.
","[{'version': 'v1', 'created': 'Tue, 27 Jul 2021 10:02:57 GMT'}]",2021-07-28,"[['de Jong', 'Staas', '']]","['Musical controller', 'haptic interface', 'tactile feedback']"
12797,2107.02368,Taehun Kim,"Taehun Kim, Hyemin Lee, Daijin Kim",UACANet: Uncertainty Augmented Context Attention for Polyp Segmentation,"9 pages, 6 figures, 4 tables. To appear in the Proceedings of the
  29th ACM International Conference on Multimedia (ACM MM '21), October 20-24,
  2021, Chengdu, China. DOI will be added soon",,10.1145/3474085.3475375,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose Uncertainty Augmented Context Attention network (UACANet) for
polyp segmentation which consider a uncertain area of the saliency map. We
construct a modified version of U-Net shape network with additional encoder and
decoder and compute a saliency map in each bottom-up stream prediction module
and propagate to the next prediction module. In each prediction module,
previously predicted saliency map is utilized to compute foreground, background
and uncertain area map and we aggregate the feature map with three area maps
for each representation. Then we compute the relation between each
representation and each pixel in the feature map. We conduct experiments on
five popular polyp segmentation benchmarks, Kvasir, CVC-ClinicDB, ETIS,
CVC-ColonDB and CVC-300, and achieve state-of-the-art performance. Especially,
we achieve 76.6% mean Dice on ETIS dataset which is 13.8% improvement compared
to the previous state-of-the-art method. Source code is publicly available at
https://github.com/plemeri/UACANet
","[{'version': 'v1', 'created': 'Tue, 6 Jul 2021 03:11:12 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Jul 2021 12:26:27 GMT'}, {'version': 'v3', 'created': 'Thu, 22 Jul 2021 00:20:25 GMT'}]",2021-07-23,"[['Kim', 'Taehun', ''], ['Lee', 'Hyemin', ''], ['Kim', 'Daijin', '']]","['medical image segmentation', 'polyp segmentation', 'colonoscopy', 'self-attention']"
12798,2002.08343,Pedro Hecht,Pedro Hecht,"Algebraic Extension Ring Framework for Non-Commutative Asymmetric
  Cryptography","4 pages, 3 tables, 1 figure",,10.13140/RG.2.2.34977.84329,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Post-Quantum Cryptography PQC attempts to find cryptographic protocols
resistant to attacks using Shors polynomial time algorithm for numerical field
problems or Grovers algorithm to find the unique input to a black-box function
that produces a particular output value. The use of non-standard algebraic
structures like non-commutative or non-associative structures, combined with
one-way trapdoor functions derived from combinatorial group theory, are mainly
unexplored choices for these new kinds of protocols and overlooked in current
PQC solutions. In this paper, we develop an algebraic extension ring framework
who could be applied to different asymmetric protocols, i.e. key exchange, key
transport, enciphering, digital signature, zero-knowledge authentication,
oblivious transfer, secret sharing etc.. A valuable feature is that there is no
need for big number libraries as all arithmetic is performed in F256 extension
field operations (precisely the AES field). We assume that the new framework is
cryptographical secure against strong classical attacks like the
sometimes-useful length-based attack, Romankovs linearization attacks and
Tsabans algebraic span attack. This statement is based on the non-linear
structure of the selected platform which proved to be useful protecting the AES
protocol. Otherwise, it could resist post-quantum attacks Grover, Shor and be
particularly useful for computational platforms with limited capabilities like
USB cryptographic keys or smartcards. Semantic security IND-CCA2 could also be
inferred for this new platform.
","[{'version': 'v1', 'created': 'Wed, 19 Feb 2020 18:44:07 GMT'}, {'version': 'v2', 'created': 'Sun, 2 Aug 2020 14:01:20 GMT'}]",2020-08-04,"[['Hecht', 'Pedro', '']]","['Post-Quantum Cryptography', 'NonCommutative Cryptography', 'Rings', 'Finite Fields', 'AES', 'Combinatorial Group Theory']"
12799,2008.02216,Matej Petkovi\'c,"Matej Petkovi\'c, Bla\v{z} \v{S}krlj, Dragi Kocev, Nikola Simidjievski",Fuzzy Jaccard Index: A robust comparison of ordered lists,"29 pages, 30 figures","Applied Soft Computing, Volume 113, Part A, 2021, 107849, ISSN
  1568-4946",10.1016/j.asoc.2021.107849,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  We propose Fuzzy Jaccard Index (FUJI) -- a scale-invariant score for
assessment of the similarity between two ranked/ordered lists. FUJI improves
upon the Jaccard index by incorporating a membership function which takes into
account the particular ranks, thus producing both more stable and more accurate
similarity estimates. We provide theoretical insights into the properties of
the FUJI score as well as propose an efficient algorithm for computing it. We
also present empirical evidence of its performance on different synthetic
scenarios. Finally, we demonstrate its utility in a typical machine learning
setting -- comparing feature ranking lists relevant to a given machine learning
task. In real-life, and in particular high-dimensional domains, where only a
small percentage of the whole feature space might be relevant, a robust and
confident feature ranking leads to interpretable findings as well as efficient
computation and good predictive performance. In such cases, FUJI correctly
distinguishes between existing feature ranking approaches, while being more
robust and efficient than the benchmark similarity scores.
","[{'version': 'v1', 'created': 'Wed, 5 Aug 2020 16:33:52 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Oct 2021 17:01:49 GMT'}]",2021-10-06,"[['Petković', 'Matej', ''], ['Škrlj', 'Blaž', ''], ['Kocev', 'Dragi', ''], ['Simidjievski', 'Nikola', '']]","['ordered lists', 'fuzzy scores', 'feature ranking', 'information retrieval', 'Jaccard index']"
12800,2203.00804,Maksym Neyra-Nesterenko,"Maksym Neyra-Nesterenko, Ben Adcock","NESTANets: Stable, accurate and efficient neural networks for
  analysis-sparse inverse problems",,"Sampl. Theory Signal Process. Data Anal. 21, 4 (2023)",10.1007/s43670-022-00043-5,,cs.LG cs.CV cs.IT cs.NA eess.IV math.IT math.NA,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Solving inverse problems is a fundamental component of science, engineering
and mathematics. With the advent of deep learning, deep neural networks have
significant potential to outperform existing state-of-the-art, model-based
methods for solving inverse problems. However, it is known that current
data-driven approaches face several key issues, notably hallucinations,
instabilities and unpredictable generalization, with potential impact in
critical tasks such as medical imaging. This raises the key question of whether
or not one can construct deep neural networks for inverse problems with
explicit stability and accuracy guarantees. In this work, we present a novel
construction of accurate, stable and efficient neural networks for inverse
problems with general analysis-sparse models, termed NESTANets. To construct
the network, we first unroll NESTA, an accelerated first-order method for
convex optimization. The slow convergence of this method leads to deep networks
with low efficiency. Therefore, to obtain shallow, and consequently more
efficient, networks we combine NESTA with a novel restart scheme. We then use
compressed sensing techniques to demonstrate accuracy and stability. We
showcase this approach in the case of Fourier imaging, and verify its stability
and performance via a series of numerical experiments. The key impact of this
work is demonstrating the construction of efficient neural networks based on
unrolling with guaranteed stability and accuracy.
","[{'version': 'v1', 'created': 'Wed, 2 Mar 2022 00:44:25 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Oct 2022 21:25:25 GMT'}]",2022-12-22,"[['Neyra-Nesterenko', 'Maksym', ''], ['Adcock', 'Ben', '']]","['deep learning', 'inverse problems', 'unrolling', 'restart scheme', 'NESTA', 'adversarial perturbations']"
12801,1803.10983,Christine Dahn,"Christine Dahn, Nils M. Kriege, and Petra Mutzel","A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar
  Graphs",conference version from IWOCA 2018,,10.1007/978-3-319-94667-2_12,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  We propose a fixed-parameter tractable algorithm for the \textsc{Max-Cut}
problem on embedded 1-planar graphs parameterized by the crossing number $k$ of
the given embedding. A graph is called 1-planar if it can be drawn in the plane
with at most one crossing per edge. Our algorithm recursively reduces a
1-planar graph to at most $3^k$ planar graphs, using edge removal and node
contraction. The \textsc{Max-Cut} problem is then solved on the planar graphs
using established polynomial-time algorithms. We show that a maximum cut in the
given 1-planar graph can be derived from the solutions for the planar graphs.
Our algorithm computes a maximum cut in an embedded 1-planar graph with $n$
nodes and $k$ edge crossings in time $\mathcal{O}(3^k \cdot n^{3/2} \log n)$.
","[{'version': 'v1', 'created': 'Thu, 29 Mar 2018 09:39:14 GMT'}, {'version': 'v2', 'created': 'Wed, 30 May 2018 09:41:28 GMT'}]",2018-12-08,"[['Dahn', 'Christine', ''], ['Kriege', 'Nils M.', ''], ['Mutzel', 'Petra', '']]","['maximum cut', 'fixed-parameter tractable', '1-planar graphs']"
12802,2010.12042,Byungsoo Kim,"Dongmin Shin, Yugeun Shim, Hangyeol Yu, Seewoo Lee, Byungsoo Kim,
  Youngduck Choi",SAINT+: Integrating Temporal Features for EdNet Correctness Prediction,LAK 2021,,10.1145/3448139.3448188,,cs.CY cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose SAINT+, a successor of SAINT which is a Transformer based
knowledge tracing model that separately processes exercise information and
student response information. Following the architecture of SAINT, SAINT+ has
an encoder-decoder structure where the encoder applies self-attention layers to
a stream of exercise embeddings, and the decoder alternately applies
self-attention layers and encoder-decoder attention layers to streams of
response embeddings and encoder output. Moreover, SAINT+ incorporates two
temporal feature embeddings into the response embeddings: elapsed time, the
time taken for a student to answer, and lag time, the time interval between
adjacent learning activities. We empirically evaluate the effectiveness of
SAINT+ on EdNet, the largest publicly available benchmark dataset in the
education domain. Experimental results show that SAINT+ achieves
state-of-the-art performance in knowledge tracing with an improvement of 1.25%
in area under receiver operating characteristic curve compared to SAINT, the
current state-of-the-art model in EdNet dataset.
","[{'version': 'v1', 'created': 'Mon, 19 Oct 2020 01:49:31 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Feb 2021 02:31:42 GMT'}]",2021-02-02,"[['Shin', 'Dongmin', ''], ['Shim', 'Yugeun', ''], ['Yu', 'Hangyeol', ''], ['Lee', 'Seewoo', ''], ['Kim', 'Byungsoo', ''], ['Choi', 'Youngduck', '']]","['Education', 'Personalized Learning', 'Knowledge Tracing', 'Deep Learning', 'Transformer']"
12803,1911.01220,Essam Rashed,"Essam A. Rashed, Yinliang Diao, Akimasa Hirata","Learning-based estimation of dielectric properties and tissue density in
  head models for personalized radio-frequency dosimetry","18 pages, 10 figures, 4 tables","Physics in Medicine and Biology 65, pp. 065001, 2020",10.1088/1361-6560/ab7308,,cs.LG eess.IV physics.med-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Radio-frequency dosimetry is an important process in human safety and for
compliance of related products. Recently, computational human models generated
from medical images have often been used for such assessment, especially to
consider the inter-variability of subjects. However, the common procedure to
develop personalized models is time consuming because it involves excessive
segmentation of several components that represent different biological tissues,
which limits the inter-variability assessment of radiation safety based on
personalized dosimetry. Deep learning methods have been shown to be a powerful
approach for pattern recognition and signal analysis. Convolutional neural
networks with deep architecture are proven robust for feature extraction and
image mapping in several biomedical applications. In this study, we develop a
learning-based approach for fast and accurate estimation of the dielectric
properties and density of tissues directly from magnetic resonance images in a
single shot. The smooth distribution of the dielectric properties in head
models, which is realized using a process without tissue segmentation, improves
the smoothness of the specific absorption rate (SAR) distribution compared with
that in the commonly used procedure. The estimated SAR distributions, as well
as that averaged over 10-g of tissue in a cubic shape, are found to be highly
consistent with those computed using the conventional methods that employ
segmentation.
","[{'version': 'v1', 'created': 'Mon, 4 Nov 2019 13:55:30 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Nov 2019 03:16:33 GMT'}, {'version': 'v3', 'created': 'Wed, 5 Feb 2020 01:07:54 GMT'}]",2020-04-29,"[['Rashed', 'Essam A.', ''], ['Diao', 'Yinliang', ''], ['Hirata', 'Akimasa', '']]","['Electromagnetic exposure', 'radio frequency', 'human safety', 'deep learning', 'specific absorption rate (SAR)']"
12804,2012.05997,Atefeh Keshavarzi Zafarghandi,"Atefeh Keshavarzi Zafarghandi, Rineke Verbrugge and Bart Verheij",Strong Admissibility for Abstract Dialectical Frameworks,"9 pages, 3 Figures, SAC '21 conference: The 36th ACM/SIGAPP Symposium
  on Applied Computing",,10.1145/3412841.3441962,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Abstract dialectical frameworks (ADFs) have been introduced as a formalism
for modeling and evaluating argumentation allowing general logical satisfaction
conditions. Different criteria used to settle the acceptance of arguments are
called semantics. Semantics of ADFs have so far mainly been defined based on
the concept of admissibility. However, the notion of strongly admissible
semantics studied for abstract argumentation frameworks has not yet been
introduced for ADFs. In the current work we present the concept of strong
admissibility of interpretations for ADFs. Further, we show that strongly
admissible interpretations of ADFs form a lattice with the grounded
interpretation as top element.
","[{'version': 'v1', 'created': 'Thu, 10 Dec 2020 21:50:35 GMT'}]",2020-12-14,"[['Zafarghandi', 'Atefeh Keshavarzi', ''], ['Verbrugge', 'Rineke', ''], ['Verheij', 'Bart', '']]","['Abstract argumentation frameworks', 'Abstract dialectical frameworks', 'Strongly admissible semantics']"
12805,2011.00733,Sergey Alyaev,"Sergey Alyaev, Reidar Brumer Bratvold, Sofija Ivanova, Andrew
  Holsaeter, Morten Bendiksen",An interactive sequential-decision benchmark from geosteering,arXiv admin note: substantial text overlap with arXiv:2005.08916,"Applied Computing and Geosciences Volume 12, December 2021, 100072",10.1016/j.acags.2021.100072,,cs.HC cs.SY eess.SY stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Geosteering workflows are increasingly based on the quantification of
subsurface uncertainties during real-time operations. As a consequence
operational decision making is becoming both better informed and more complex.
This paper presents an experimental web-based decision support system, which
can be used to both aid expert decisions under uncertainty or further develop
decision optimization algorithms in controlled environment. A user of the
system (either human or AI) controls the decisions to steer the well or stop
drilling. Whenever a user drills ahead, the system produces simulated
measurements along the selected well trajectory which are used to update the
uncertainty represented by model realizations using the ensemble Kalman filter.
To enable informed decisions the system is equipped with functionality to
evaluate the value of the selected trajectory under uncertainty with respect to
the objectives of the current experiment.
  To illustrate the utility of the system as a benchmark, we present the
initial experiment, in which we compare the decision skills of geoscientists
with those of a recently published automatic decision support algorithm. The
experiment and the survey after it showed that most participants were able to
use the interface and complete the three test rounds. At the same time, the
automated algorithm outperformed 28 out of 29 qualified human participants.
  Such an experiment is not sufficient to draw conclusions about practical
geosteering, but is nevertheless useful for geoscience. First, this
communication-by-doing made 76% of respondents more curious about and/or
confident in the presented technologies. Second, the system can be further used
as a benchmark for sequential decisions under uncertainty. This can accelerate
development of algorithms and improve the training for decision making.
","[{'version': 'v1', 'created': 'Fri, 30 Oct 2020 12:54:11 GMT'}]",2021-11-16,"[['Alyaev', 'Sergey', ''], ['Bratvold', 'Reidar Brumer', ''], ['Ivanova', 'Sofija', ''], ['Holsaeter', 'Andrew', ''], ['Bendiksen', 'Morten', '']]","['interactive benchmark', 'sequential geosteering decisions', 'uncertainty quantification', 'expert decisions', 'experimental study', 'decisionsupport system']"
12806,2008.13343,Yuhang Li,"Yuhang Li and Xuejin Chen and Binxin Yang and Zihan Chen and Zhihua
  Cheng and Zheng-Jun Zha",DeepFacePencil: Creating Face Images from Freehand Sketches,ACM MM 2020 (oral),,10.1145/3394171.3413684,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we explore the task of generating photo-realistic face images
from hand-drawn sketches. Existing image-to-image translation methods require a
large-scale dataset of paired sketches and images for supervision. They
typically utilize synthesized edge maps of face images as training data.
However, these synthesized edge maps strictly align with the edges of the
corresponding face images, which limit their generalization ability to real
hand-drawn sketches with vast stroke diversity. To address this problem, we
propose DeepFacePencil, an effective tool that is able to generate
photo-realistic face images from hand-drawn sketches, based on a novel dual
generator image translation network during training. A novel spatial attention
pooling (SAP) is designed to adaptively handle stroke distortions which are
spatially varying to support various stroke styles and different levels of
details. We conduct extensive experiments and the results demonstrate the
superiority of our model over existing methods on both image quality and model
generalization to hand-drawn sketches.
","[{'version': 'v1', 'created': 'Mon, 31 Aug 2020 03:35:21 GMT'}]",2020-09-01,"[['Li', 'Yuhang', ''], ['Chen', 'Xuejin', ''], ['Yang', 'Binxin', ''], ['Chen', 'Zihan', ''], ['Cheng', 'Zhihua', ''], ['Zha', 'Zheng-Jun', '']]","['Sketch-based synthesis', 'face image generation', 'spatial attention', 'dual generator', 'conditional generative adversarial networks']"
12807,2011.09241,Francesco Salvetti,"Enrico Sutera, Vittorio Mazzia, Francesco Salvetti, Giovanni Fantin
  and Marcello Chiaberge","Indoor Point-to-Point Navigation with Deep Reinforcement Learning and
  Ultra-wideband",Accepted by ICAART 2021 - http://www.icaart.org/,,10.5220/0010202600380047,,cs.RO cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Indoor autonomous navigation requires a precise and accurate localization
system able to guide robots through cluttered, unstructured and dynamic
environments. Ultra-wideband (UWB) technology, as an indoor positioning system,
offers precise localization and tracking, but moving obstacles and
non-line-of-sight occurrences can generate noisy and unreliable signals. That,
combined with sensors noise, unmodeled dynamics and environment changes can
result in a failure of the guidance algorithm of the robot. We demonstrate how
a power-efficient and low computational cost point-to-point local planner,
learnt with deep reinforcement learning (RL), combined with UWB localization
technology can constitute a robust and resilient to noise short-range guidance
system complete solution. We trained the RL agent on a simulated environment
that encapsulates the robot dynamics and task constraints and then, we tested
the learnt point-to-point navigation policies in a real setting with more than
two-hundred experimental evaluations using UWB localization. Our results show
that the computational efficient end-to-end policy learnt in plain simulation,
that directly maps low-range sensors signals to robot controls, deployed in
combination with ultra-wideband noisy localization in a real environment, can
provide a robust, scalable and at-the-edge low-cost navigation system solution.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2020 12:30:36 GMT'}]",2021-12-21,"[['Sutera', 'Enrico', ''], ['Mazzia', 'Vittorio', ''], ['Salvetti', 'Francesco', ''], ['Fantin', 'Giovanni', ''], ['Chiaberge', 'Marcello', '']]","['Indoor Autonomous Navigation', 'Autonomous Agents', 'Deep Reinforcement Learning', 'Ultra-wideband']"
12808,2201.10051,Xiaobing Sun,"Xiaobing Sun, Wenjie Feng, Shenghua Liu, Yuyang Xie, Siddharth Bhatia,
  Bryan Hooi, Wenhan Wang, Xueqi Cheng",MonLAD: Money Laundering Agents Detection in Transaction Streams,,,10.1145/3488560.3498418,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Given a stream of money transactions between accounts in a bank, how can we
accurately detect money laundering agent accounts and suspected behaviors in
real-time? Money laundering agents try to hide the origin of illegally obtained
money by dispersive multiple small transactions and evade detection by smart
strategies. Therefore, it is challenging to accurately catch such fraudsters in
an unsupervised manner. Existing approaches do not consider the characteristics
of those agent accounts and are not suitable to the streaming settings.
Therefore, we propose MonLAD and MonLAD-W to detect money laundering agent
accounts in a transaction stream by keeping track of their residuals and other
features; we devise AnoScore algorithm to find anomalies based on the robust
measure of statistical deviation. Experimental results show that MonLAD
outperforms the state-of-the-art baselines on real-world data and finds various
suspicious behavior patterns of money laundering. Additionally, several
detected suspected accounts have been manually-verified as agents in real money
laundering scenario.
","[{'version': 'v1', 'created': 'Tue, 25 Jan 2022 02:30:34 GMT'}]",2022-01-26,"[['Sun', 'Xiaobing', ''], ['Feng', 'Wenjie', ''], ['Liu', 'Shenghua', ''], ['Xie', 'Yuyang', ''], ['Bhatia', 'Siddharth', ''], ['Hooi', 'Bryan', ''], ['Wang', 'Wenhan', ''], ['Cheng', 'Xueqi', '']]","['Anomaly detection', 'Money laundering', 'Stream algorithm']"
12809,2007.13890,Djebril Mekhazni,"Djebril Mekhazni, Amran Bhuiyan, George Ekladious and Eric Granger","Unsupervised Domain Adaptation in the Dissimilarity Space for Person
  Re-identification","14 pages (16 pages with references), 7 figures, conference ECCV",,10.1007/978-3-030-58583-9_10,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Person re-identification (ReID) remains a challenging task in many real-word
video analytics and surveillance applications, even though state-of-the-art
accuracy has improved considerably with the advent of deep learning (DL) models
trained on large image datasets. Given the shift in distributions that
typically occurs between video data captured from the source and target
domains, and absence of labeled data from the target domain, it is difficult to
adapt a DL model for accurate recognition of target data. We argue that for
pair-wise matchers that rely on metric learning, e.g., Siamese networks for
person ReID, the unsupervised domain adaptation (UDA) objective should consist
in aligning pair-wise dissimilarity between domains, rather than aligning
feature representations. Moreover, dissimilarity representations are more
suitable for designing open-set ReID systems, where identities differ in the
source and target domains. In this paper, we propose a novel
Dissimilarity-based Maximum Mean Discrepancy (D-MMD) loss for aligning
pair-wise distances that can be optimized via gradient descent. From a person
ReID perspective, the evaluation of D-MMD loss is straightforward since the
tracklet information allows to label a distance vector as being either
within-class or between-class. This allows approximating the underlying
distribution of target pair-wise distances for D-MMD loss optimization, and
accordingly align source and target distance distributions. Empirical results
with three challenging benchmark datasets show that the proposed D-MMD loss
decreases as source and domain distributions become more similar. Extensive
experimental evaluation also indicates that UDA methods that rely on the D-MMD
loss can significantly outperform baseline and state-of-the-art UDA methods for
person ReID without the common requirement for data augmentation and/or complex
networks.
","[{'version': 'v1', 'created': 'Mon, 27 Jul 2020 22:10:46 GMT'}]",2020-11-20,"[['Mekhazni', 'Djebril', ''], ['Bhuiyan', 'Amran', ''], ['Ekladious', 'George', ''], ['Granger', 'Eric', '']]","['Deep Learning', 'Domain Adaptation', 'Maximum Mean Discrepancy', 'Dissimilarity Space', 'Person Re-identification']"
12810,2109.14958,Matteo Mordacchini,"Matteo Mordacchini, Andrea Passarella, Marco Conti","A Social Cognitive Heuristic for Adaptive Data Dissemination in Mobile
  Opportunistic Networks",,Pervasive and Mobile Computing 42 (2017) 371-392,10.1016/j.pmcj.2017.06.006,,cs.NI cs.DC cs.HC cs.MA,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  It is commonly agreed that data will be one of the cornerstones of Future
Internet systems. In this context, mobile Opportunistic Networks (ONs) are one
of the key paradigms to support, in a self-organising and decentralised manner,
the growth of data generated by localized interactions between users mobile
devices, and between them and nearby devices such as IoT nodes. In ONs, the
spontaneous collaboration among mobile devices is exploited to disseminate data
toward interested users. However, the limited resources and knowledge available
at each node, and the vast amount of data available, make it difficult to
devise efficient schemes to accomplish this task. Recent solutions propose to
equip each device with data filtering methods derived from human data
processing schemes, known as Cognitive Heuristics, i.e. very effective methods
used by the brain to quickly drop useless information, while keeping the most
relevant one. These solutions can become less effective when facing dynamic
scenarios or situations where nodes cannot fully collaborate. One of the
reasons is that the solutions proposed so far do not take take into account the
social structure of the environment where the nodes move in. To be more
effective, the selection of information performed by each node should take into
consideration this dimension of the environment. In this paper we propose a
social-based data dissemination scheme, based on the cognitive Social Circle
Heuristic. This evaluation method exploits the structure of the social
environment to make inferences about the relevance of discovered information.
We show how the Social Circle Heuristic, coupled with a cognitive-based
community detection scheme, can be exploited to design an effective data
dissemination algorithm for ONs. We provide a detailed analysis of the
performance of the proposed solution via simulation.
","[{'version': 'v1', 'created': 'Thu, 30 Sep 2021 09:43:16 GMT'}]",2021-10-01,"[['Mordacchini', 'Matteo', ''], ['Passarella', 'Andrea', ''], ['Conti', 'Marco', '']]","['Opportunistic networks', 'Cognitive Heuristics', 'Data Dissemination', 'Social']"
12811,2107.03947,Igor Sfiligoi,"Igor Sfiligoi, Frank W\""urthwein, Thomas DeFanti and John Graham",HTCondor data movement at 100 Gbps,"2 pages, 2 figures, to be published in proceedings of eScience 2021","2021 IEEE 17th International Conference on eScience (eScience),
  2021, pp. 239-240",10.1109/eScience51609.2021.00040,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  HTCondor is a major workload management system used in distributed high
throughput computing (dHTC) environments, e.g., the Open Science Grid. One of
the distinguishing features of HTCondor is the native support for data
movement, allowing it to operate without a shared filesystem. Coupling data
handling and compute scheduling is both convenient for users and allows for
significant infrastructure flexibility but does introduce some limitations. The
default HTCondor data transfer mechanism routes both the input and output data
through the submission node, making it a potential bottleneck. In this document
we show that by using a node equipped with a 100 Gbps network interface (NIC)
HTCondor can serve data at up to 90 Gbps, which is sufficient for most current
use cases, as it would saturate the border network links of most research
universities at the time of writing.
","[{'version': 'v1', 'created': 'Thu, 8 Jul 2021 16:18:20 GMT'}]",2021-11-02,"[['Sfiligoi', 'Igor', ''], ['Würthwein', 'Frank', ''], ['DeFanti', 'Thomas', ''], ['Graham', 'John', '']]","['data handling', 'htcondor', 'benchmarking']"
12812,1710.08825,Stefan Bard,"Stefan Bard, Thomas Bellitto, Christopher Duffy, Gary MacGillivray,
  Feiran Yang",Complexity of locally-injective homomorphisms to tournaments,"22 pages, 16 figures","Discrete Mathematics & Theoretical Computer Science, vol. 20 no.
  2, Graph Theory (November 30, 2018) dmtcs:4999",10.23638/DMTCS-20-2-4,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For oriented graphs $G$ and $H$, a homomorphism $f: G \rightarrow H$ is
locally-injective if, for every $v \in V(G)$, it is injective when restricted
to some combination of the in-neighbourhood and out-neighbourhood of $v$. Two
of the possible definitions of local-injectivity are examined. In each case it
is shown that the associated homomorphism problem is NP-complete when $H$ is a
reflexive tournament on three or more vertices with a loop at every vertex, and
solvable in polynomial time when $H$ is a reflexive tournament on two or fewer
vertices.
","[{'version': 'v1', 'created': 'Tue, 24 Oct 2017 15:04:59 GMT'}, {'version': 'v2', 'created': 'Sun, 19 Aug 2018 03:38:54 GMT'}, {'version': 'v3', 'created': 'Thu, 22 Nov 2018 21:27:36 GMT'}]",2019-03-14,"[['Bard', 'Stefan', ''], ['Bellitto', 'Thomas', ''], ['Duffy', 'Christopher', ''], ['MacGillivray', 'Gary', ''], ['Yang', 'Feiran', '']]","['Complexity', 'Graph homomorphism', 'Oriented graph', 'Locally-injective homomorphism']"
12813,1410.8618,Chen Jie,Jie Chen and Haixian Zhang and Hua Mao and Yongsheng Sang and Zhang Yi,Symmetric low-rank representation for subspace clustering,13 pages,,10.1016/j.neucom.2015.08.077,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a symmetric low-rank representation (SLRR) method for subspace
clustering, which assumes that a data set is approximately drawn from the union
of multiple subspaces. The proposed technique can reveal the membership of
multiple subspaces through the self-expressiveness property of the data. In
particular, the SLRR method considers a collaborative representation combined
with low-rank matrix recovery techniques as a low-rank representation to learn
a symmetric low-rank representation, which preserves the subspace structures of
high-dimensional data. In contrast to performing iterative singular value
decomposition in some existing low-rank representation based algorithms, the
symmetric low-rank representation in the SLRR method can be calculated as a
closed form solution by solving the symmetric low-rank optimization problem. By
making use of the angular information of the principal directions of the
symmetric low-rank representation, an affinity graph matrix is constructed for
spectral clustering. Extensive experimental results show that it outperforms
state-of-the-art subspace clustering algorithms.
","[{'version': 'v1', 'created': 'Fri, 31 Oct 2014 02:14:03 GMT'}, {'version': 'v2', 'created': 'Thu, 21 May 2015 14:04:13 GMT'}]",2015-11-24,"[['Chen', 'Jie', ''], ['Zhang', 'Haixian', ''], ['Mao', 'Hua', ''], ['Sang', 'Yongsheng', ''], ['Yi', 'Zhang', '']]","['Subspace clustering', 'spectral clustering', 'symmetric low-rank representation', 'affinity matrix', 'low-rank matrix recovery', 'dimensionreduction']"
12814,2109.10038,Alexander Black,"Alexander Black, Tu Bui, Simon Jenni, Vishy Swaminathan, John
  Collomosse",VPN: Video Provenance Network for Robust Content Attribution,CVMP2021 camera-ready version,,10.1145/3485441.3485650,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  We present VPN - a content attribution method for recovering provenance
information from videos shared online. Platforms, and users, often transform
video into different quality, codecs, sizes, shapes, etc. or slightly edit its
content such as adding text or emoji, as they are redistributed online. We
learn a robust search embedding for matching such video, invariant to these
transformations, using full-length or truncated video queries. Once matched
against a trusted database of video clips, associated information on the
provenance of the clip is presented to the user. We use an inverted index to
match temporal chunks of video using late-fusion to combine both visual and
audio features. In both cases, features are extracted via a deep neural network
trained using contrastive learning on a dataset of original and augmented video
clips. We demonstrate high accuracy recall over a corpus of 100,000 videos.
","[{'version': 'v1', 'created': 'Tue, 21 Sep 2021 09:07:05 GMT'}]",2021-09-22,"[['Black', 'Alexander', ''], ['Bui', 'Tu', ''], ['Jenni', 'Simon', ''], ['Swaminathan', 'Vishy', ''], ['Collomosse', 'John', '']]","['Video retrieval', 'media provenance', 'attribution', 'content authenticity']"
12815,2109.09906,Stavros Shiaeles Dr,"Ievgeniia Kuzminykh, Dan Shevchuk, Stavros Shiaeles, Bogdan Ghita",Audio Interval Retrieval using Convolutional Neural Networks,"20th International Conference on Next Generation Teletraffic and
  Wired/Wireless Advanced Networks and Systems, NEW2AN 2020 and 13th Conference
  on the Internet of Things and Smart Spaces, ruSMART 2020",,10.1007/978-3-030-65726-0_21,,cs.SD cs.AI eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Modern streaming services are increasingly labeling videos based on their
visual or audio content. This typically augments the use of technologies such
as AI and ML by allowing to use natural speech for searching by keywords and
video descriptions. Prior research has successfully provided a number of
solutions for speech to text, in the case of a human speech, but this article
aims to investigate possible solutions to retrieve sound events based on a
natural language query, and estimate how effective and accurate they are. In
this study, we specifically focus on the YamNet, AlexNet, and ResNet-50
pre-trained models to automatically classify audio samples using their
respective melspectrograms into a number of predefined classes. The predefined
classes can represent sounds associated with actions within a video fragment.
Two tests are conducted to evaluate the performance of the models on two
separate problems: audio classification and intervals retrieval based on a
natural language query. Results show that the benchmarked models are comparable
in terms of performance, with YamNet slightly outperforming the other two
models. YamNet was able to classify single fixed-size audio samples with 92.7%
accuracy and 68.75% precision while its average accuracy on intervals retrieval
was 71.62% and precision was 41.95%. The investigated method may be embedded
into an automated event marking architecture for streaming services.
","[{'version': 'v1', 'created': 'Tue, 21 Sep 2021 01:32:18 GMT'}]",2021-09-22,"[['Kuzminykh', 'Ievgeniia', ''], ['Shevchuk', 'Dan', ''], ['Shiaeles', 'Stavros', ''], ['Ghita', 'Bogdan', '']]","['Deep Learning', 'Intervals Retrieval', 'Natural Language Query', 'Audio Classification', 'Convolutional Neural Network']"
12816,2002.07676,Claire Lazar Reich,Claire Lazar Reich and Suhas Vijaykumar,"A Possibility in Algorithmic Fairness: Can Calibration and Equal Error
  Rates Be Reconciled?","2nd Symposium on Foundations of Responsible Computing (FORC 2021)
  https://drops.dagstuhl.de/opus/volltexte/2021/13872/",,10.4230/LIPIcs.FORC.2021.4,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Decision makers increasingly rely on algorithmic risk scores to determine
access to binary treatments including bail, loans, and medical interventions.
In these settings, we reconcile two fairness criteria that were previously
shown to be in conflict: calibration and error rate equality. In particular, we
derive necessary and sufficient conditions for the existence of calibrated
scores that yield classifications achieving equal error rates at any given
group-blind threshold. We then present an algorithm that searches for the most
accurate score subject to both calibration and minimal error rate disparity.
Applied to the COMPAS criminal risk assessment tool, we show that our method
can eliminate error disparities while maintaining calibration. In a separate
application to credit lending, we compare our procedure to the omission of
sensitive features and show that it raises both profit and the probability that
creditworthy individuals receive loans.
","[{'version': 'v1', 'created': 'Tue, 18 Feb 2020 16:03:09 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Jul 2020 15:09:40 GMT'}, {'version': 'v3', 'created': 'Mon, 7 Jun 2021 20:41:16 GMT'}]",2021-06-09,"[['Reich', 'Claire Lazar', ''], ['Vijaykumar', 'Suhas', '']]","['fair prediction', 'impossibility results', 'screening decisions', 'classification', 'calibration', 'equalized odds', 'optimal transport', 'risk scores']"
12817,2112.09389,Qiang Liu,"Qiang Liu (1), Jiade Zhang (2), Jingna Liu (3) and Zhi Yang (1)","Feature extraction and classification algorithm, which one is more
  essential? An experimental study on a specific task of vibration signal
  diagnosis",,,10.1007/s13042-021-01477-4,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the development of machine learning, a data-driven model has been widely
used in vibration signal fault diagnosis. Most data-driven machine learning
algorithms are built based on well-designed features, but feature extraction is
usually required to be completed in advance. In the deep learning era, feature
extraction and classifier learning are conducted simultaneously, which will
lead to an end-to-end learning system. This paper explores which one of the two
key factors, i.e., feature extraction and classification algorithm, is more
essential for a specific task of vibration signal diagnosis during a learning
system is generated. Feature extractions from vibration signal based on both
well-known Gaussian model and statistical characteristics are discussed,
respectively. And several classification algorithms are selected to
experimentally validate the comparative impact of both feature extraction and
classification algorithm on prediction performance.
","[{'version': 'v1', 'created': 'Fri, 17 Dec 2021 08:50:06 GMT'}]",2021-12-20,"[['Liu', 'Qiang', ''], ['Zhang', 'Jiade', ''], ['Liu', 'Jingna', ''], ['Yang', 'Zhi', '']]","['Feature extraction', 'Supervised learning', 'Vibration signal', 'Gearbox fault diagnosis; Gaussian model']"
12818,2205.00937,Dwaipayan Roy,"Dwaipayan Roy, Zeljko Carevic, Philipp Mayr","Studying Retrievability of Publications and Datasets in an Integrated
  Retrieval System","ACM/IEEE Joint Conference on Digital Libraries (JCDL) 2022 research
  paper",Proc. of JCDL 2022,10.1145/3529372.3530931,,cs.IR cs.DL,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we investigate the retrievability of datasets and publications
in a real-life Digital Library (DL). The measure of retrievability was
originally developed to quantify the influence that a retrieval system has on
the access to information. Retrievability can also enable DL engineers to
evaluate their search engine to determine the ease with which the content in
the collection can be accessed. Following this methodology, in our study, we
propose a system-oriented approach for studying dataset and publication
retrieval. A speciality of this paper is the focus on measuring the
accessibility biases of various types of DL items and including a metric of
usefulness. Among other metrics, we use Lorenz curves and Gini coefficients to
visualize the differences of the two retrievable document types (specifically
datasets and publications). Empirical results reported in the paper show a
distinguishable diversity in the retrievability scores among the documents of
different types.
","[{'version': 'v1', 'created': 'Mon, 2 May 2022 14:36:31 GMT'}]",2022-07-22,"[['Roy', 'Dwaipayan', ''], ['Carevic', 'Zeljko', ''], ['Mayr', 'Philipp', '']]","['Retrievability', 'Dataset Retrieval', 'Interactive IR', 'Diversity']"
12819,1904.09078,Jun-Ho Choi,"Jun-Ho Choi, Jong-Seok Lee","EmbraceNet: A robust deep learning architecture for multimodal
  classification",Code available at https://github.com/idearibosome/embracenet,Information Fusion 51 (2019) 259-270,10.1016/j.inffus.2019.02.010,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classification using multimodal data arises in many machine learning
applications. It is crucial not only to model cross-modal relationship
effectively but also to ensure robustness against loss of part of data or
modalities. In this paper, we propose a novel deep learning-based multimodal
fusion architecture for classification tasks, which guarantees compatibility
with any kind of learning models, deals with cross-modal information carefully,
and prevents performance degradation due to partial absence of data. We employ
two datasets for multimodal classification tasks, build models based on our
architecture and other state-of-the-art models, and analyze their performance
on various situations. The results show that our architecture outperforms the
other multimodal fusion architectures when some parts of data are not
available.
","[{'version': 'v1', 'created': 'Fri, 19 Apr 2019 04:46:29 GMT'}]",2019-04-22,"[['Choi', 'Jun-Ho', ''], ['Lee', 'Jong-Seok', '']]","['Multimodal data fusion', 'deep learning', 'classification', 'data loss']"
12820,2110.07355,Laura De Lorenzis,"Helge C. Hille, Siddhant Kumar, Laura De Lorenzis",Floating Isogeometric Analysis,,,10.1016/j.cma.2022.114684,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  We propose Floating Isogeometric Analysis (FLIGA), which extends the concepts
of IGA to Lagrangian extreme deformation analysis. The method is based on a
novel tensor-product construction of B-Splines for the update of the basis
functions in one direction of the parametric space. With basis functions
'floating' deformation-dependently in this direction, mesh distortion is
overcome for problems in which extreme deformations occur predominantly along
the associated (possibly curved) physical axis. In doing so, we preserve the
numerical advantages of splines over many meshless basis functions, while
avoiding remeshing. We employ material point integration for numerical
quadrature attributing a Lagrangian character to our technique. The paper
introduces the method and reviews the fundamental properties of the FLIGA basis
functions, including a numerical patch test. The performance of FLIGA is then
numerically investigated on the benchmark of Newtonian and viscoelastic
Taylor-Couette flow. Finally, we simulate a viscoelastic extrusion-based
additive manufacturing process, which served as the original motivation for the
new approach.
","[{'version': 'v1', 'created': 'Thu, 14 Oct 2021 13:42:50 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Oct 2021 11:31:33 GMT'}]",2022-02-15,"[['Hille', 'Helge C.', ''], ['Kumar', 'Siddhant', ''], ['De Lorenzis', 'Laura', '']]","['isogeometric analysis', 'meshless methods', 'extreme deformations', 'mesh distortion', 'viscoelasticity', 'extrusion', 'additive manufacturing']"
12821,2010.11548,Artem Kramov,"S.D. Pogorilyy, A.A. Kramov",Method of noun phrase detection in Ukrainian texts,"25 pages, in Ukrainian, 5 figures, 2 tables",Control Systems and Computers. 2019. Issue 5. P. 48-59,10.15407/csc.2019.05.048,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Introduction. The area of natural language processing considers AI-complete
tasks that cannot be solved using traditional algorithmic actions. Such tasks
are commonly implemented with the usage of machine learning methodology and
means of computer linguistics. One of the preprocessing tasks of a text is the
search of noun phrases. The accuracy of this task has implications for the
effectiveness of many other tasks in the area of natural language processing.
In spite of the active development of research in the area of natural language
processing, the investigation of the search for noun phrases within Ukrainian
texts are still at an early stage. Results. The different methods of noun
phrases detection have been analyzed. The expediency of the representation of
sentences as a tree structure has been justified. The key disadvantage of many
methods of noun phrase detection is the severe dependence of the effectiveness
of their detection from the features of a certain language. Taking into account
the unified format of sentence processing and the availability of the trained
model for the building of sentence trees for Ukrainian texts, the Universal
Dependency model has been chosen. The complex method of noun phrases detection
in Ukrainian texts utilizing Universal Dependencies means and named-entity
recognition model has been suggested. Experimental verification of the
effectiveness of the suggested method on the corpus of Ukrainian news has been
performed. Different metrics of method accuracy have been calculated.
Conclusions. The results obtained can indicate that the suggested method can be
used to find noun phrases in Ukrainian texts. An accuracy increase of the
method can be made with the usage of appropriate named-entity recognition
models according to a subject area.
","[{'version': 'v1', 'created': 'Thu, 22 Oct 2020 09:20:24 GMT'}]",2020-10-23,"[['Pogorilyy', 'S. D.', ''], ['Kramov', 'A. A.', '']]","['natural language processing', 'noun phrase', 'Universal Dependencies model', 'NER model', 'tree']"
12822,2108.06952,Yu Zheng,"Yu Zheng, Chen Gao, Liang Chen, Depeng Jin, Yong Li",DGCN: Diversified Recommendation with Graph Convolutional Networks,WWW'21,,10.1145/3442381.3449835,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  These years much effort has been devoted to improving the accuracy or
relevance of the recommendation system. Diversity, a crucial factor which
measures the dissimilarity among the recommended items, received rather little
scrutiny. Directly related to user satisfaction, diversification is usually
taken into consideration after generating the candidate items. However, this
decoupled design of diversification and candidate generation makes the whole
system suboptimal. In this paper, we aim at pushing the diversification to the
upstream candidate generation stage, with the help of Graph Convolutional
Networks (GCN). Although GCN based recommendation algorithms have shown great
power in modeling complex collaborative filtering effect to improve the
accuracy of recommendation, how diversity changes is ignored in those advanced
works. We propose to perform rebalanced neighbor discovering, category-boosted
negative sampling and adversarial learning on top of GCN. We conduct extensive
experiments on real-world datasets. Experimental results verify the
effectiveness of our proposed method on diversification. Further ablation
studies validate that our proposed method significantly alleviates the
accuracy-diversity dilemma.
","[{'version': 'v1', 'created': 'Mon, 16 Aug 2021 08:00:44 GMT'}]",2021-08-17,"[['Zheng', 'Yu', ''], ['Gao', 'Chen', ''], ['Chen', 'Liang', ''], ['Jin', 'Depeng', ''], ['Li', 'Yong', '']]","['Recommender systems', 'diversification', 'graph convolutional networks']"
12823,1809.06106,Daniel Rodriguez,"Javier Moreno, Daniel Rodriguez, Antonio Nebro, Jose A. Lozano",Merge Non-Dominated Sorting Algorithm for Many-Objective Optimization,,,10.1109/TCYB.2020.2968301,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many Pareto-based multi-objective evolutionary algorithms require to rank the
solutions of the population in each iteration according to the dominance
principle, what can become a costly operation particularly in the case of
dealing with many-objective optimization problems. In this paper, we present a
new efficient algorithm for computing the non-dominated sorting procedure,
called Merge Non-Dominated Sorting (MNDS), which has a best computational
complexity of $\Theta(NlogN)$ and a worst computational complexity of
$\Theta(MN^2)$. Our approach is based on the computation of the dominance set
of each solution by taking advantage of the characteristics of the merge sort
algorithm. We compare the MNDS against four well-known techniques that can be
considered as the state-of-the-art. The results indicate that the MNDS
algorithm outperforms the other techniques in terms of number of comparisons as
well as the total running time.
","[{'version': 'v1', 'created': 'Mon, 17 Sep 2018 10:09:29 GMT'}]",2020-02-19,"[['Moreno', 'Javier', ''], ['Rodriguez', 'Daniel', ''], ['Nebro', 'Antonio', ''], ['Lozano', 'Jose A.', '']]","['Multi-objective optimization', 'non-dominated sorting', 'many objectiveproblems', 'evolutionary algorithms']"
12824,2204.11586,Antoine Chaffin,"Antoine Chaffin, Thomas Scialom, Sylvain Lamprier, Jacopo Staiano,
  Benjamin Piwowarski, Ewa Kijak, Vincent Claveau",Which Discriminator for Cooperative Text Generation?,"6 pages, 2 figures, accepted to SIGIR 2022",,10.1145/3477495.3531858,,cs.CL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Language models generate texts by successively predicting probability
distributions for next tokens given past ones. A growing field of interest
tries to leverage external information in the decoding process so that the
generated texts have desired properties, such as being more natural, non toxic,
faithful, or having a specific writing style. A solution is to use a classifier
at each generation step, resulting in a cooperative environment where the
classifier guides the decoding of the language model distribution towards
relevant texts for the task at hand. In this paper, we examine three families
of (transformer-based) discriminators for this specific task of cooperative
decoding: bidirectional, left-to-right and generative ones. We evaluate the
pros and cons of these different types of discriminators for cooperative
generation, exploring respective accuracy on classification tasks along with
their impact on the resulting sample quality and computational performances. We
also provide the code of a batched implementation of the powerful cooperative
decoding strategy used for our experiments, the Monte Carlo Tree Search,
working with each discriminator for Natural Language Generation.
","[{'version': 'v1', 'created': 'Mon, 25 Apr 2022 12:16:02 GMT'}]",2022-04-26,"[['Chaffin', 'Antoine', ''], ['Scialom', 'Thomas', ''], ['Lamprier', 'Sylvain', ''], ['Staiano', 'Jacopo', ''], ['Piwowarski', 'Benjamin', ''], ['Kijak', 'Ewa', ''], ['Claveau', 'Vincent', '']]","['natural language generation', 'cooperative', 'discriminator', 'montecarlo tree search', 'attention', 'empirical', 'performance']"
12825,2008.03007,Agostino Dovier,"Alessandro Burigana, Francesco Fabiano, Agostino Dovier, Enrico
  Pontelli",Modelling Multi-Agent Epistemic Planning in ASP,"Paper presented at the 36th International Conference on Logic
  Programming (ICLP 2019), University Of Calabria, Rende (CS), Italy, September
  2020, 16 pages",Theory and Practice of Logic Programming 20 (2020) 593-608,10.1017/S1471068420000289,,cs.AI,http://creativecommons.org/publicdomain/zero/1.0/,"  Designing agents that reason and act upon the world has always been one of
the main objectives of the Artificial Intelligence community. While for
planning in ""simple"" domains the agents can solely rely on facts about the
world, in several contexts, e.g., economy, security, justice and politics, the
mere knowledge of the world could be insufficient to reach a desired goal. In
these scenarios, epistemic reasoning, i.e., reasoning about agents' beliefs
about themselves and about other agents' beliefs, is essential to design
winning strategies.
  This paper addresses the problem of reasoning in multi-agent epistemic
settings exploiting declarative programming techniques. In particular, the
paper presents an actual implementation of a multi-shot Answer Set
Programming-based planner that can reason in multi-agent epistemic settings,
called PLATO (ePistemic muLti-agent Answer seT programming sOlver). The ASP
paradigm enables a concise and elegant design of the planner, w.r.t. other
imperative implementations, facilitating the development of formal verification
of correctness.
  The paper shows how the planner, exploiting an ad-hoc epistemic state
representation and the efficiency of ASP solvers, has competitive performance
results on benchmarks collected from the literature. It is under consideration
for acceptance in TPLP.
","[{'version': 'v1', 'created': 'Fri, 7 Aug 2020 06:35:56 GMT'}]",2020-09-23,"[['Burigana', 'Alessandro', ''], ['Fabiano', 'Francesco', ''], ['Dovier', 'Agostino', ''], ['Pontelli', 'Enrico', '']]","['Epistemic Reasoning', 'Multi-Shot ASP', 'Planning', 'Multi-Agent', 'Possibilities']"
12826,1506.06072,Emilio Ferrara,"Emilio Ferrara, Zeyao Yang","Quantifying the Effect of Sentiment on Information Diffusion in Social
  Media","10 pages, 5 figures","PeerJ Computer Science, 1, e26. 2015",10.7717/peerj-cs.26,,cs.SI cs.LG physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media have become the main vehicle of information production and
consumption online. Millions of users every day log on their Facebook or
Twitter accounts to get updates and news, read about their topics of interest,
and become exposed to new opportunities and interactions. Although recent
studies suggest that the contents users produce will affect the emotions of
their readers, we still lack a rigorous understanding of the role and effects
of contents sentiment on the dynamics of information diffusion. This work aims
at quantifying the effect of sentiment on information diffusion, to understand:
(i) whether positive conversations spread faster and/or broader than negative
ones (or vice-versa); (ii) what kind of emotions are more typical of popular
conversations on social media; and, (iii) what type of sentiment is expressed
in conversations characterized by different temporal dynamics. Our findings
show that, at the level of contents, negative messages spread faster than
positive ones, but positive ones reach larger audiences, suggesting that people
are more inclined to share and favorite positive contents, the so-called
positive bias. As for the entire conversations, we highlight how different
temporal dynamics exhibit different sentiment patterns: for example, positive
sentiment builds up for highly-anticipated events, while unexpected events are
mainly characterized by negative sentiment. Our contribution is a milestone to
understand how the emotions expressed in short texts affect their spreading in
online social ecosystems, and may help to craft effective policies and
strategies for content generation and diffusion.
","[{'version': 'v1', 'created': 'Fri, 19 Jun 2015 16:12:19 GMT'}]",2017-03-07,"[['Ferrara', 'Emilio', ''], ['Yang', 'Zeyao', '']]","['computational social science', 'social media', 'sentiment analysis']"
12827,2108.10674,Gong Yantao,"Yantao Gong, Cao Liu, Jiazhen Yuan, Fan Yang, Xunliang Cai, Guanglu
  Wan, Jiansong Chen, Ruiyao Niu and Houfeng Wang",Density-Based Dynamic Curriculum Learning for Intent Detection,,,10.1145/3459637.3482082,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pre-trained language models have achieved noticeable performance on the
intent detection task. However, due to assigning an identical weight to each
sample, they suffer from the overfitting of simple samples and the failure to
learn complex samples well. To handle this problem, we propose a density-based
dynamic curriculum learning model. Our model defines the sample's difficulty
level according to their eigenvectors' density. In this way, we exploit the
overall distribution of all samples' eigenvectors simultaneously. Then we apply
a dynamic curriculum learning strategy, which pays distinct attention to
samples of various difficulty levels and alters the proportion of samples
during the training process. Through the above operation, simple samples are
well-trained, and complex samples are enhanced. Experiments on three open
datasets verify that the proposed density-based algorithm can distinguish
simple and complex samples significantly. Besides, our model obtains obvious
improvement over the strong baselines.
","[{'version': 'v1', 'created': 'Tue, 24 Aug 2021 12:29:26 GMT'}]",2021-08-25,"[['Gong', 'Yantao', ''], ['Liu', 'Cao', ''], ['Yuan', 'Jiazhen', ''], ['Yang', 'Fan', ''], ['Cai', 'Xunliang', ''], ['Wan', 'Guanglu', ''], ['Chen', 'Jiansong', ''], ['Niu', 'Ruiyao', ''], ['Wang', 'Houfeng', '']]","['intent detection', 'eigenvector density', 'dynamic curriculum learning']"
12828,2208.14908,Chansup Byun,"Chansup Byun, William Arcand, David Bestor, Bill Bergeron, Vijay
  Gadepally, Michael Houle, Matthew Hubbell, Hayden Jananthan, Michael Jones,
  Kurt Keville, Anna Klein, Peter Michaleas, Lauren Milechin, Guillermo
  Morales, Julie Mullen, Andrew Prout, Albert Reuther, Antonio Rosa, Siddharth
  Samsi, Charles Yee, and Jeremy Kepner",pPython for Parallel Python Programming,"arXiv admin note: substantial text overlap with
  arXiv:astro-ph/0606464",,10.1109/HPEC55821.2022.9926365,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  pPython seeks to provide a parallel capability that provides good speed-up
without sacrificing the ease of programming in Python by implementing
partitioned global array semantics (PGAS) on top of a simple file-based
messaging library (PythonMPI) in pure Python. The core data structure in
pPython is a distributed numerical array whose distribution onto multiple
processors is specified with a map construct. Communication operations between
distributed arrays are abstracted away from the user and pPython transparently
supports redistribution between any block-cyclic-overlapped distributions in up
to four dimensions. pPython follows a SPMD (single program multiple data) model
of computation. pPython runs on any combination of heterogeneous systems that
support Python, including Windows, Linux, and MacOS operating systems. In
addition to running transparently on single-node (e.g., a laptop), pPython
provides a scheduler interface, so that pPython can be executed in a massively
parallel computing environment. The initial implementation uses the Slurm
scheduler. Performance of pPython on the HPC Challenge benchmark suite
demonstrates both ease of programming and scalability.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2022 15:08:39 GMT'}]",2022-12-12,"[['Byun', 'Chansup', ''], ['Arcand', 'William', ''], ['Bestor', 'David', ''], ['Bergeron', 'Bill', ''], ['Gadepally', 'Vijay', ''], ['Houle', 'Michael', ''], ['Hubbell', 'Matthew', ''], ['Jananthan', 'Hayden', ''], ['Jones', 'Michael', ''], ['Keville', 'Kurt', ''], ['Klein', 'Anna', ''], ['Michaleas', 'Peter', ''], ['Milechin', 'Lauren', ''], ['Morales', 'Guillermo', ''], ['Mullen', 'Julie', ''], ['Prout', 'Andrew', ''], ['Reuther', 'Albert', ''], ['Rosa', 'Antonio', ''], ['Samsi', 'Siddharth', ''], ['Yee', 'Charles', ''], ['Kepner', 'Jeremy', '']]","['PGAS', 'Python', 'MPI', 'Parallel Programming']"
12829,2105.00865,Amogh Warkhandkar,Amogh G. Warkhandkar and Omkar B. Bhambure,LiveStyle -- An Application to Transfer Artistic Styles,"4 pages, 5 figures","International Journal of Computer Applications, Volume 174 -
  No.30, April 2021, Pages 1-4",10.5120/ijca2021921222,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Art is a variety of human activities that include the production of visual,
auditory, or performing objects that express the creativity, creative concepts,
or technological abilities of the artist, intended primarily for their beauty
or emotional power to be appreciated. The renaissance of historic and forgotten
art has been made possible by modern developments in Artificial Intelligence.
Techniques for Computer Vision have long been related to such arts. Style
Transfer using Neural Networks refers to optimization techniques, where a
content image and a style image are taken and blended such that it feels like
the content image is reconstructed in the style image color palette. This paper
implements the Style Transfer using three different Neural Networks in form of
an application that is accessible to the general population thereby reviving
interest in lost art styles.
","[{'version': 'v1', 'created': 'Mon, 3 May 2021 13:50:48 GMT'}]",2021-05-17,"[['Warkhandkar', 'Amogh G.', ''], ['Bhambure', 'Omkar B.', '']]","['Neural Networks', 'React', 'Docker', 'FastAPI', 'TensorFlow', 'StyleTransfer']"
12830,2301.09606,Zuzana Spitalova,"Zuzana \v{S}pit\'alov\'a, Oliver Leontiev and Patrik Harma\v{n}o\v{s}",Concept of Delivery System in the Smart City Environment,,,10.5121/ijci.2023.120110,,cs.CY,http://creativecommons.org/publicdomain/zero/1.0/,"  Regarding to the smart city infrastructures, there is a demand for big data
processing and its further usage. This data can be gained by various means.
There are many IoT devices in the city, which can communicate and share the
information about the environment which they are situated in. Moreover every
personal mobile device can also participate in this process and help to gain
data via various applications. Every app provides the useful data, enabling the
location and data sharing. This data can be further processed and used for
improving the city infrastructure, transport or other services. We designed the
system for shared delivery process, which can help to achieve the described
situation. It consists of frontend and backend part. The frontend part,
multiplatform mobile app, represents the graphical interface and the backend
part represents the database for the gained data.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2023 18:10:41 GMT'}]",2023-01-24,"[['Špitálová', 'Zuzana', ''], ['Leontiev', 'Oliver', ''], ['Harmaňoš', 'Patrik', '']]","['Smart City', 'Delivery System', 'PostrgreSQL', 'ReactNative', 'API']"
12831,2203.03169,Chengyang Lee,"Chengyang Li, Tianbo Huang, Xiarun Chen, Chenglin Xie and Weiping Wen",IOLLVM: enhance version of OLLVM,13pages,,10.5121/csit.2022.120409,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Code obfuscation increases the difficulty of understanding programs, improves
software security, and, in particular, OLLVM offers the possibility of
cross-platform code obfuscation. For OLLVM, we provide enhanced solutions for
control flow obfuscation and identifier obfuscation. First, we propose the
nested switch obfuscation scheme and the in-degree obfuscation for bogus blocks
in the control flow obfuscation. Secondly, the identifier obfuscation scheme is
presented in the LLVM layer to fill the gap of OLLVM at this level. Finally, we
experimentally verify the enhancement effect of the control flow method and the
identifier obfuscation effect and prove that the program's security can be
further improved with less overhead, providing higher software security.
","[{'version': 'v1', 'created': 'Mon, 7 Mar 2022 06:54:24 GMT'}]",2022-03-08,"[['Li', 'Chengyang', ''], ['Huang', 'Tianbo', ''], ['Chen', 'Xiarun', ''], ['Xie', 'Chenglin', ''], ['Wen', 'Weiping', '']]","['Software Protection', 'Code Obfuscation', 'Control Flow Obfuscation', 'Identifier Obfuscation', 'LLVM']"
12832,1809.04520,Sergey Rodionov,"Alexey Potapov, Sergey Rodionov","Genetic algorithms with DNN-based trainable crossover as an example of
  partial specialization of general search","AGI 2017 procedding, The final publication is available at
  link.springer.com",,10.1007/978-3-319-63703-7_10,,cs.NE cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Universal induction relies on some general search procedure that is doomed to
be inefficient. One possibility to achieve both generality and efficiency is to
specialize this procedure w.r.t. any given narrow task. However, complete
specialization that implies direct mapping from the task parameters to
solutions (discriminative models) without search is not always possible. In
this paper, partial specialization of general search is considered in the form
of genetic algorithms (GAs) with a specialized crossover operator. We perform a
feasibility study of this idea implementing such an operator in the form of a
deep feedforward neural network. GAs with trainable crossover operators are
compared with the result of complete specialization, which is also represented
as a deep neural network. Experimental results show that specialized GAs can be
more efficient than both general GAs and discriminative models.
","[{'version': 'v1', 'created': 'Wed, 18 Jul 2018 10:14:58 GMT'}]",2018-09-13,"[['Potapov', 'Alexey', ''], ['Rodionov', 'Sergey', '']]","['genetic algorithms', 'deep neural networks', 'optimization', 'specialization', 'universal induction', 'general search']"
12833,2101.06709,Niloy Sikder,"Niloy Sikder, Md. Sanaullah Chowdhury, Abu Shamim Mohammad Arif,
  Abdullah-Al Nahid","Human Activity Recognition Using Multichannel Convolutional Neural
  Network","10 pages, Proceedings of the 2019 5th International Conference on
  Advances in Electrical Engineering (ICAEE), 26-28 September, Dhaka,
  Bangladesh",,10.1109/ICAEE48663.2019.8975649,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Human Activity Recognition (HAR) simply refers to the capacity of a machine
to perceive human actions. HAR is a prominent application of advanced Machine
Learning and Artificial Intelligence techniques that utilize computer vision to
understand the semantic meanings of heterogeneous human actions. This paper
describes a supervised learning method that can distinguish human actions based
on data collected from practical human movements. The primary challenge while
working with HAR is to overcome the difficulties that come with the
cyclostationary nature of the activity signals. This study proposes a HAR
classification model based on a two-channel Convolutional Neural Network (CNN)
that makes use of the frequency and power features of the collected human
action signals. The model was tested on the UCI HAR dataset, which resulted in
a 95.25% classification accuracy. This approach will help to conduct further
researches on the recognition of human activities based on their biomedical
signals.
","[{'version': 'v1', 'created': 'Sun, 17 Jan 2021 16:48:17 GMT'}]",2021-01-19,"[['Sikder', 'Niloy', ''], ['Chowdhury', 'Md. Sanaullah', ''], ['Arif', 'Abu Shamim Mohammad', ''], ['Nahid', 'Abdullah-Al', '']]","['HAR', 'human action recognition', 'human activity classification', 'multichannel CNN', 'UCI HAR', 'feature extraction']"
12834,1912.10454,Mostafa Mehdipour Ghazi,"Mostafa Mehdipour Ghazi, Mads Nielsen, Akshay Pai, Marc Modat, M.
  Jorge Cardoso, Sebastien Ourselin, Lauge Sorensen",On the Initialization of Long Short-Term Memory Networks,,,10.1007/978-3-030-36708-4_23,,cs.LG cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Weight initialization is important for faster convergence and stability of
deep neural networks training. In this paper, a robust initialization method is
developed to address the training instability in long short-term memory (LSTM)
networks. It is based on a normalized random initialization of the network
weights that aims at preserving the variance of the network input and output in
the same range. The method is applied to standard LSTMs for univariate time
series regression and to LSTMs robust to missing values for multivariate
disease progression modeling. The results show that in all cases, the proposed
initialization method outperforms the state-of-the-art initialization
techniques in terms of training convergence and generalization performance of
the obtained solution.
","[{'version': 'v1', 'created': 'Sun, 22 Dec 2019 14:19:43 GMT'}]",2019-12-24,"[['Ghazi', 'Mostafa Mehdipour', ''], ['Nielsen', 'Mads', ''], ['Pai', 'Akshay', ''], ['Modat', 'Marc', ''], ['Cardoso', 'M. Jorge', ''], ['Ourselin', 'Sebastien', ''], ['Sorensen', 'Lauge', '']]","['Deep neural networks', 'long short-term memory', 'time seriesregression', 'initialization', 'disease progression modeling']"
12835,1606.03783,Thomas Lampert,"Pedro Chahuara, Thomas Lampert, Pierre Gancarski","Retrieving and Ranking Similar Questions from Question-Answer Archives
  Using Topic Modelling and Topic Distribution Regression","International Conference on Theory and Practice of Digital Libraries
  2016 (accepted)",,10.1007/978-3-319-43997-6_4,,cs.IR cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Presented herein is a novel model for similar question ranking within
collaborative question answer platforms. The presented approach integrates a
regression stage to relate topics derived from questions to those derived from
question-answer pairs. This helps to avoid problems caused by the differences
in vocabulary used within questions and answers, and the tendency for questions
to be shorter than answers. The performance of the model is shown to outperform
translation methods and topic modelling (without regression) on several
real-world datasets.
","[{'version': 'v1', 'created': 'Sun, 12 Jun 2016 23:50:19 GMT'}]",2018-10-26,"[['Chahuara', 'Pedro', ''], ['Lampert', 'Thomas', ''], ['Gancarski', 'Pierre', '']]","['Collaborative Question Answering', 'Question and AnswerRetrieval', 'LDA', 'Neural Network', 'Topic Modelling', 'Regression']"
12836,2204.09511,Endang Kurniawan,"Endang Kurniawan, Imam Riadi, Amin Irmawan, Arusani","Performance Measurement of Security Academic Information System using
  Maturity Level",,2022/04,10.48550/arXiv.2204.09511,2204.09511,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  This study aims to information security in academic information systems to
provide recommendations for improvements in information security management by
the expected maturity level based on ISO/IEC 27002:2013. By using a qualitative
descriptive approach, data collection and validation techniques with
triangulation techniques are interviews, observation, and documentation. The
data were analyzed by using gap analysis and to measure the maturity level
determined 15 objective control and 45 security controls scattered in 5
clauses, the result of the research found that the performance of academic
information system maturity level at level 2. That is, the current level of
maturity is below the expected maturity level, so it needs to be increased to
the expected level.
","[{'version': 'v1', 'created': 'Sun, 17 Apr 2022 11:39:36 GMT'}]",2022-04-25,"[['Kurniawan', 'Endang', ''], ['Riadi', 'Imam', ''], ['Irmawan', 'Amin', ''], ['Arusani', '', '']]","['Academic Information System', 'Maturity Level', 'Information Security', 'Gap Analysis']"
12837,2201.00374,Piotr Sowinski,"Piotr Sowinski, Katarzyna Wasielewska-Michniewska, Maria Ganzha,
  Marcin Paprzycki",Topical Classification of Food Safety Publications with a Knowledge Base,,,10.1007/978-981-19-4364-5_48,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  The vast body of scientific publications presents an increasing challenge of
finding those that are relevant to a given research question, and making
informed decisions on their basis. This becomes extremely difficult without the
use of automated tools. Here, one possible area for improvement is automatic
classification of publication abstracts according to their topic. This work
introduces a novel, knowledge base-oriented publication classifier. The
proposed method focuses on achieving scalability and easy adaptability to other
domains. Classification speed and accuracy are shown to be satisfactory, in the
very demanding field of food safety. Further development and evaluation of the
method is needed, as the proposed approach shows much potential.
","[{'version': 'v1', 'created': 'Sun, 2 Jan 2022 16:15:05 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Jan 2022 15:05:57 GMT'}]",2022-11-09,"[['Sowinski', 'Piotr', ''], ['Wasielewska-Michniewska', 'Katarzyna', ''], ['Ganzha', 'Maria', ''], ['Paprzycki', 'Marcin', '']]","['publication classification', 'ontology', 'named entity linking', 'systematic literature review', 'food safety']"
12838,2107.00064,Yu Chen,"Jialiang Tan, Yu Chen, Zhenming Liu, Bin Ren, Shuaiwen Leon Song,
  Xipeng Shen and Xu Liu",Toward Efficient Interactions between Python and Native Libraries,"In Proceedings of the 29th ACM Joint European Software Engineering
  Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE
  2021), August 23-27, 2021, Athens, Greece. ACM, New York,NY, USA, 12 pages",,10.1145/3468264.3468541,,cs.PL cs.PF,http://creativecommons.org/licenses/by/4.0/,"  Python has become a popular programming language because of its excellent
programmability. Many modern software packages utilize Python for high-level
algorithm design and depend on native libraries written in C/C++/Fortran for
efficient computation kernels. Interaction between Python code and native
libraries introduces performance losses because of the abstraction lying on the
boundary of Python and native libraries. On the one side, Python code,
typically run with interpretation, is disjoint from its execution behavior. On
the other side, native libraries do not include program semantics to understand
algorithm defects.
  To understand the interaction inefficiencies, we extensively study a large
collection of Python software packages and categorize them according to the
root causes of inefficiencies. We extract two inefficiency patterns that are
common in interaction inefficiencies. Based on these patterns, we develop
PieProf, a lightweight profiler, to pinpoint interaction inefficiencies in
Python applications. The principle of PieProf is to measure the inefficiencies
in the native execution and associate inefficiencies with high-level Python
code to provide a holistic view. Guided by PieProf, we optimize 17 real-world
applications, yielding speedups up to 6.3$\times$ on application level.
","[{'version': 'v1', 'created': 'Fri, 11 Jun 2021 00:48:02 GMT'}]",2021-07-02,"[['Tan', 'Jialiang', ''], ['Chen', 'Yu', ''], ['Liu', 'Zhenming', ''], ['Ren', 'Bin', ''], ['Song', 'Shuaiwen Leon', ''], ['Shen', 'Xipeng', ''], ['Liu', 'Xu', '']]","['Python', 'profiling', 'PMU', 'debug register']"
12839,2005.05414,Soumya Banerjee,"Soumya Banerjee, Debarshi Kumar Sanyal, Samiran Chattopadhyay, Plaban
  Kumar Bhowmick and Parthapratim Das","Segmenting Scientific Abstracts into Discourse Categories: A Deep
  Learning-Based Approach for Sparse Labeled Data",to appear in the proceedings of JCDL'2020,,10.1145/3383583.3398598,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The abstract of a scientific paper distills the contents of the paper into a
short paragraph. In the biomedical literature, it is customary to structure an
abstract into discourse categories like BACKGROUND, OBJECTIVE, METHOD, RESULT,
and CONCLUSION, but this segmentation is uncommon in other fields like computer
science. Explicit categories could be helpful for more granular, that is,
discourse-level search and recommendation. The sparsity of labeled data makes
it challenging to construct supervised machine learning solutions for automatic
discourse-level segmentation of abstracts in non-bio domains. In this paper, we
address this problem using transfer learning. In particular, we define three
discourse categories BACKGROUND, TECHNIQUE, OBSERVATION-for an abstract because
these three categories are the most common. We train a deep neural network on
structured abstracts from PubMed, then fine-tune it on a small hand-labeled
corpus of computer science papers. We observe an accuracy of 75% on the test
corpus. We perform an ablation study to highlight the roles of the different
parts of the model. Our method appears to be a promising solution to the
automatic segmentation of abstracts, where the labeled data is sparse.
","[{'version': 'v1', 'created': 'Mon, 11 May 2020 20:21:25 GMT'}, {'version': 'v2', 'created': 'Wed, 27 May 2020 08:35:08 GMT'}]",2020-05-28,"[['Banerjee', 'Soumya', ''], ['Sanyal', 'Debarshi Kumar', ''], ['Chattopadhyay', 'Samiran', ''], ['Bhowmick', 'Plaban Kumar', ''], ['Das', 'Parthapratim', '']]","['structured abstract', 'deep learning', 'LSTM', 'transfer learning']"
12840,2301.04919,Maciej Wozniak,"Maciej K. Wozniak, Rebecca Stower, Patric Jensfelt, Andre Pereira","What you see is (not) what you get: A VR Framework for Correcting Robot
  Errors",,,10.1145/3568294.3580081,,cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Many solutions tailored for intuitive visualization or teleoperation of
virtual, augmented and mixed (VAM) reality systems are not robust to robot
failures, such as the inability to detect and recognize objects in the
environment or planning unsafe trajectories. In this paper, we present a novel
virtual reality (VR) framework where users can (i) recognize when the robot has
failed to detect a real-world object, (ii) correct the error in VR, (iii)
modify proposed object trajectories and, (iv) implement behaviors on a
real-world robot. Finally, we propose a user study aimed at testing the
efficacy of our framework. Project materials can be found in the OSF
repository.
","[{'version': 'v1', 'created': 'Thu, 12 Jan 2023 10:27:30 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Jan 2023 09:32:28 GMT'}]",2023-01-18,"[['Wozniak', 'Maciej K.', ''], ['Stower', 'Rebecca', ''], ['Jensfelt', 'Patric', ''], ['Pereira', 'Andre', '']]","['robotics', 'human-robot interaction', 'VR', 'AR', 'perception']"
12841,2107.05298,Enzo Tartaglione,"Enzo Tartaglione, St\'ephane Lathuili\`ere, Attilio Fiandrotti, Marco
  Cagnazzo, Marco Grangetto",HEMP: High-order Entropy Minimization for neural network comPression,,,10.1016/j.neucom.2021.07.022,,cs.LG cs.AI cs.IT math.IT,http://creativecommons.org/licenses/by/4.0/,"  We formulate the entropy of a quantized artificial neural network as a
differentiable function that can be plugged as a regularization term into the
cost function minimized by gradient descent. Our formulation scales efficiently
beyond the first order and is agnostic of the quantization scheme. The network
can then be trained to minimize the entropy of the quantized parameters, so
that they can be optimally compressed via entropy coding. We experiment with
our entropy formulation at quantizing and compressing well-known network
architectures over multiple datasets. Our approach compares favorably over
similar methods, enjoying the benefits of higher order entropy estimate,
showing flexibility towards non-uniform quantization (we use Lloyd-max
quantization), scalability towards any entropy order to be minimized and
efficiency in terms of compression. We show that HEMP is able to work in
synergy with other approaches aiming at pruning or quantizing the model itself,
delivering significant benefits in terms of storage size compressibility
without harming the model's performance.
","[{'version': 'v1', 'created': 'Mon, 12 Jul 2021 10:17:53 GMT'}]",2021-07-13,"[['Tartaglione', 'Enzo', ''], ['Lathuilière', 'Stéphane', ''], ['Fiandrotti', 'Attilio', ''], ['Cagnazzo', 'Marco', ''], ['Grangetto', 'Marco', '']]","['deep learning', 'compression', 'entropy', 'neural networks', 'regularization']"
12842,1909.00311,Prasanna Balaprakash,"Prasanna Balaprakash and Romain Egele and Misha Salim and Stefan Wild
  and Venkatram Vishwanath and Fangfang Xia and Tom Brettin and Rick Stevens","Scalable Reinforcement-Learning-Based Neural Architecture Search for
  Cancer Deep Learning Research","SC '19: IEEE/ACM International Conference on High Performance
  Computing, Networking, Storage and Analysis, November 17--22, 2019, Denver,
  CO",,10.1145/3295500.3356202,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cancer is a complex disease, the understanding and treatment of which are
being aided through increases in the volume of collected data and in the scale
of deployed computing power. Consequently, there is a growing need for the
development of data-driven and, in particular, deep learning methods for
various tasks such as cancer diagnosis, detection, prognosis, and prediction.
Despite recent successes, however, designing high-performing deep learning
models for nonimage and nontext cancer data is a time-consuming,
trial-and-error, manual task that requires both cancer domain and deep learning
expertise. To that end, we develop a reinforcement-learning-based neural
architecture search to automate deep-learning-based predictive model
development for a class of representative cancer data. We develop custom
building blocks that allow domain experts to incorporate the
cancer-data-specific characteristics. We show that our approach discovers deep
neural network architectures that have significantly fewer trainable
parameters, shorter training time, and accuracy similar to or higher than those
of manually designed architectures. We study and demonstrate the scalability of
our approach on up to 1,024 Intel Knights Landing nodes of the Theta
supercomputer at the Argonne Leadership Computing Facility.
","[{'version': 'v1', 'created': 'Sun, 1 Sep 2019 02:49:59 GMT'}]",2019-09-04,"[['Balaprakash', 'Prasanna', ''], ['Egele', 'Romain', ''], ['Salim', 'Misha', ''], ['Wild', 'Stefan', ''], ['Vishwanath', 'Venkatram', ''], ['Xia', 'Fangfang', ''], ['Brettin', 'Tom', ''], ['Stevens', 'Rick', '']]","['cancer', 'deep learning', 'neural architecture search', 'reinforcementlearning']"
12843,2011.00946,Jukka Ruohonen,Jukka Ruohonen and Kalle Hjerppe,The GDPR Enforcement Fines at Glance,"Information Systems, published online in August 2021, pp. 1-11.
  Substantial overlap expected with arXiv:2003.05151; accepted by venue (i.e.,
  extended conference paper)",,10.1016/j.is.2021.101876,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The General Data Protection Regulation (GDPR) came into force in 2018. After
this enforcement, many fines have already been imposed by national data
protection authorities in Europe. This paper examines the individual GDPR
articles referenced in the enforcement decisions, as well as predicts the
amount of enforcement fines with available meta-data and text mining features
extracted from the enforcement decision documents. According to the results,
three articles related to the general principles, lawfulness, and information
security have been the most frequently referenced ones. Although the amount of
fines imposed vary across the articles referenced, these three particular
articles do not stand out. Furthermore, a better statistical evidence is
available with other meta-data features, including information about the
particular European countries in which the enforcements were made. Accurate
predictions are attainable even with simple machine learning techniques for
regression analysis. Basic text mining features outperform the meta-data
features in this regard. In addition to these results, the paper reflects the
GDPR's enforcement against public administration obstacles in the European
Union (EU), as well as discusses the use of automatic decision-making systems
in judiciary.
","[{'version': 'v1', 'created': 'Mon, 2 Nov 2020 13:01:45 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Apr 2021 10:42:07 GMT'}, {'version': 'v3', 'created': 'Wed, 1 Sep 2021 09:13:46 GMT'}]",2021-09-02,"[['Ruohonen', 'Jukka', ''], ['Hjerppe', 'Kalle', '']]","['Data protection', 'privacy', 'law enforcement', 'public administration', 'legal mining', 'empirical jurisprudence']"
12844,2008.02522,Sayantan Guha,Sayantan Guha and Adel Alshamrani,"Attaining High Bandwidth In Cloud Computing Through SDN-enabled
  Multi-tree Multicast","7 pages. Published with International Journal of Computer Trends and
  Technology (IJCTT)""","International Journal of Computer Trends and Technology 68.3
  (2020):92-98",10.14445/22312803/IJCTT-V68I3P119,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Achieving high bandwidth utilization in cloud computing is essential for
better network performance. However, it is difficult to attain high bandwidth
utilization in cloud computing due to the complex and distributed natures of
cloud computing resources. Recently, a growing demand for multicast
transmission is perceived in cloud computing, due to the explosive growth of
multi-point communication applications, such as video conferencing, online
gaming, etc. Nonetheless, the inherent complexity in multicast routing in cloud
computing, existing multicast plans failed to produce effective and efficient
protocol schemes, which limits the application of multicast communication on
the Internet. In this paper, a technique is proposed in how the newly developed
network architecture, Software Defined Network (SDN), can promote the design of
the multicast protocol and improve the performance of the multicast
transmission in the cloud computing. The approach is to use the SDN-cloud
Computing-enabled multicast communication scheme with ultra-high bandwidth
utilization. The bandwidth utilization is enhanced by measuring various routing
trees for each multicast transmission session and distributing the traffic load
over all available routes in the cloud computing resources. The SDN is utilized
to tackle with various design hurdles in the cloud computing, including both
the current ones with the conventional multicast pattern and the newly emerged
ones with multi-tree multicast. The prototype implementation and experiments
demonstrate the performance enhancement of the proposed approach in the cloud
computing in compared to conventional single-tree multicast designs.
","[{'version': 'v1', 'created': 'Thu, 6 Aug 2020 08:45:26 GMT'}]",2020-08-07,"[['Guha', 'Sayantan', ''], ['Alshamrani', 'Adel', '']]","['Cloud Systems', 'High Bandwidth Utilization', 'cloud Computing', 'Software Defined Network (SDN)', 'Multi-tree multicast']"
12845,2001.05046,Abeba Birhane,Abeba Birhane and Jelle van Dijk,Robot Rights? Let's Talk about Human Welfare Instead,"Accepted to the AIES 2020 conference in New York, February 2020. The
  final version of this paper will appear in Proceedings of the 2020 AAAI/ACM
  Conference on AI, Ethics, and Society",,10.1145/3375627.3375855,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The 'robot rights' debate, and its related question of 'robot
responsibility', invokes some of the most polarized positions in AI ethics.
While some advocate for granting robots rights on a par with human beings,
others, in a stark opposition argue that robots are not deserving of rights but
are objects that should be our slaves. Grounded in post-Cartesian philosophical
foundations, we argue not just to deny robots 'rights', but to deny that
robots, as artifacts emerging out of and mediating human being, are the kinds
of things that could be granted rights in the first place. Once we see robots
as mediators of human being, we can understand how the `robots rights' debate
is focused on first world problems, at the expense of urgent ethical concerns,
such as machine bias, machine elicited human labour exploitation, and erosion
of privacy all impacting society's least privileged individuals. We conclude
that, if human being is our starting point and human welfare is the primary
concern, the negative impacts emerging from machinic systems, as well as the
lack of taking responsibility by people designing, selling and deploying such
machines, remains the most pressing ethical discussion in AI.
","[{'version': 'v1', 'created': 'Tue, 14 Jan 2020 20:54:29 GMT'}]",2020-01-16,"[['Birhane', 'Abeba', ''], ['van Dijk', 'Jelle', '']]","['Robot rights', 'AI ethics', 'embodiment', 'human welfare']"
12846,1802.03113,Araz Taeihagh,Araz Taeihagh,Crowdsourcing: a new tool for policy-making?,,"Policy Sciences Journal, 50(4):629-647 (2017)",10.1007/s11077-017-9303-3,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crowdsourcing is rapidly evolving and applied in situations where ideas,
labour, opinion or expertise of large groups of people are used. Crowdsourcing
is now used in various policy-making initiatives; however, this use has usually
focused on open collaboration platforms and specific stages of the policy
process, such as agenda-setting and policy evaluations. Other forms of
crowdsourcing have been neglected in policy-making, with a few exceptions. This
article examines crowdsourcing as a tool for policy-making, and explores the
nuances of the technology and its use and implications for different stages of
the policy process. The article addresses questions surrounding the role of
crowdsourcing and whether it can be considered as a policy tool or as a
technological enabler and investigates the current trends and future directions
of crowdsourcing.
  Keywords: Crowdsourcing, Public Policy, Policy Instrument, Policy Tool,
Policy Process, Policy Cycle, Open Collaboration, Virtual Labour Markets,
Tournaments, Competition.
","[{'version': 'v1', 'created': 'Fri, 9 Feb 2018 03:34:15 GMT'}]",2018-02-12,"[['Taeihagh', 'Araz', '']]","['Crowdsourcing', 'Public Policy', 'Policy Instrument', 'Policy Tool', 'Policy']"
12847,2106.00982,Yongxing Wang,Yongxing Wang,"A monolithic one-velocity-field optimal control formulation for
  fluid-structure interaction problems with large solid deformation",,,10.1016/j.jfluidstructs.2022.103577,,cs.CE math.OC,http://creativecommons.org/publicdomain/zero/1.0/,"  In this article, we formulate a monolithic optimal control method for general
time-dependent Fluid-Structure Interaction (FSI) systems with large solid
deformation. We consider a displacement-tracking type of objective with a
constraint of the solid velocity, tackle the time-dependent control problems by
a piecewise-in-time control, cope with large solid displacement using a
one-velocity fictitious domain method, and solve the fully-coupled FSI and the
corresponding adjoint equations in a monolithic manner. We implement the
proposed method in the open-source software package FreeFEM++ and assess it by
three numerical experiments, in the aspects of stability of the numerical
scheme for different regularisation parameters, and efficiency of reducing the
objective function with control of the solid velocity.
","[{'version': 'v1', 'created': 'Wed, 2 Jun 2021 06:56:08 GMT'}]",2022-05-25,"[['Wang', 'Yongxing', '']]","['Optimal Control', 'Piecewise Control', 'Fluid-Structure Interaction', 'MonolithicMethod', 'One-Velocity Method']"
12848,2009.05698,Ayu Purwarianti,"Ramos Janoah Hasudungan (1), Ayu Purwarianti (1) ((1) Institut
  Teknologi Bandung)","Relation Detection for Indonesian Language using Deep Neural Network --
  Support Vector Machine",2018 International Conference on Asian Language Processing (IALP),,10.1109/IALP.2018.8629248,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Relation Detection is a task to determine whether two entities are related or
not. In this paper, we employ neural network to do relation detection between
two named entities for Indonesian Language. We used feature such as word
embedding, position embedding, POS-Tag embedding, and character embedding. For
the model, we divide the model into two parts: Front-part classifier
(Convolutional layer or LSTM layer) and Back-part classifier (Dense layer or
SVM). We did grid search method of neural network hyper parameter and SVM. We
used 6000 Indonesian sentences for training process and 1,125 for testing. The
best result is 0.8083 on F1-Score using Convolutional Layer as front-part and
SVM as back-part.
","[{'version': 'v1', 'created': 'Sat, 12 Sep 2020 01:45:08 GMT'}]",2020-09-15,"[['Hasudungan', 'Ramos Janoah', ''], ['Purwarianti', 'Ayu', '']]","['Relation detection', 'neural network', 'SVM']"
12849,2003.01824,Davoud Mougouei,"Davoud Mougouei, David M W Powers","Dependency-Aware Release Planning for Software Projects using Fuzzy
  Graphs and Integer Programming",,Journal of Intelligent & Fuzzy Systems (2019) 1-15,10.3233/JIFS-182810,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software Release Planning (SRP) is to find, for the software, a subset of the
requirements with the highest value while respecting the budget. The value of a
requirement however may, to various degrees, depend on selecting or ignoring
other requirements. However, existing SRP models ignore either Value-Related
Dependencies altogether or the strengths of those dependencies even if they
consider them. This paper presents an Integer Programming model for software
release planning, which considers the variances of strengths of positive and
negative value-related dependencies among software requirements. To capture the
imprecision associated with strengths of value-related dependencies we have
made use of the algebraic structure of fuzzy graphs. We have further,
contributed a scalable technique for automated identification of value-related
dependencies based on user preferences for software requirements. The validity
of the work is verified through simulations.
","[{'version': 'v1', 'created': 'Tue, 3 Mar 2020 22:54:32 GMT'}]",2020-03-05,"[['Mougouei', 'Davoud', ''], ['Powers', 'David M W', '']]","['Fuzzy Graphs', 'Integer Programming', 'Value-Related Dependencies', 'Release Planning']"
12850,2111.06685,Kunal Dahiya,"Kunal Dahiya, Deepak Saini, Anshul Mittal, Ankush Shaw, Kushal Dave,
  Akshay Soni, Himanshu Jain, Sumeet Agarwal, Manik Varma","DeepXML: A Deep Extreme Multi-Label Learning Framework Applied to Short
  Text Documents",,Web Search and Data Mining 2021,10.1145/3437963.3441810,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scalability and accuracy are well recognized challenges in deep extreme
multi-label learning where the objective is to train architectures for
automatically annotating a data point with the most relevant subset of labels
from an extremely large label set. This paper develops the DeepXML framework
that addresses these challenges by decomposing the deep extreme multi-label
task into four simpler sub-tasks each of which can be trained accurately and
efficiently. Choosing different components for the four sub-tasks allows
DeepXML to generate a family of algorithms with varying trade-offs between
accuracy and scalability. In particular, DeepXML yields the Astec algorithm
that could be 2-12% more accurate and 5-30x faster to train than leading deep
extreme classifiers on publically available short text datasets. Astec could
also efficiently train on Bing short text datasets containing up to 62 million
labels while making predictions for billions of users and data points per day
on commodity hardware. This allowed Astec to be deployed on the Bing search
engine for a number of short text applications ranging from matching user
queries to advertiser bid phrases to showing personalized ads where it yielded
significant gains in click-through-rates, coverage, revenue and other online
metrics over state-of-the-art techniques currently in production. DeepXML's
code is available at https://github.com/Extreme-classification/deepxml
","[{'version': 'v1', 'created': 'Fri, 12 Nov 2021 12:25:23 GMT'}]",2021-11-15,"[['Dahiya', 'Kunal', ''], ['Saini', 'Deepak', ''], ['Mittal', 'Anshul', ''], ['Shaw', 'Ankush', ''], ['Dave', 'Kushal', ''], ['Soni', 'Akshay', ''], ['Jain', 'Himanshu', ''], ['Agarwal', 'Sumeet', ''], ['Varma', 'Manik', '']]","['Extreme multi-label learning', 'large-scale learning', 'short-text', 'bidphrase recommendation', 'personalized ads']"
12851,2108.06530,Lun Du,"Haitao Mao, Xu Chen, Qiang Fu, Lun Du, Shi Han and Dongmei Zhang","Neuron Campaign for Initialization Guided by Information Bottleneck
  Theory","5 pages, Accepted by CIKM'21",,10.1145/3459637.3482153,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Initialization plays a critical role in the training of deep neural networks
(DNN). Existing initialization strategies mainly focus on stabilizing the
training process to mitigate gradient vanish/explosion problems. However, these
initialization methods are lacking in consideration about how to enhance
generalization ability. The Information Bottleneck (IB) theory is a well-known
understanding framework to provide an explanation about the generalization of
DNN. Guided by the insights provided by IB theory, we design two criteria for
better initializing DNN. And we further design a neuron campaign initialization
algorithm to efficiently select a good initialization for a neural network on a
given dataset. The experiments on MNIST dataset show that our method can lead
to a better generalization performance with faster convergence.
","[{'version': 'v1', 'created': 'Sat, 14 Aug 2021 13:19:43 GMT'}]",2021-08-17,"[['Mao', 'Haitao', ''], ['Chen', 'Xu', ''], ['Fu', 'Qiang', ''], ['Du', 'Lun', ''], ['Han', 'Shi', ''], ['Zhang', 'Dongmei', '']]","['neural networks', 'initialization', 'information bottleneck']"
12852,2206.07743,Wei Jin,"Wei Jin, Xiaorui Liu, Yao Ma, Charu Aggarwal, Jiliang Tang",Feature Overcorrelation in Deep Graph Neural Networks: A New Perspective,Accepted by KDD 2022,,10.1145/3534678.3539445,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent years have witnessed remarkable success achieved by graph neural
networks (GNNs) in many real-world applications such as recommendation and drug
discovery. Despite the success, oversmoothing has been identified as one of the
key issues which limit the performance of deep GNNs. It indicates that the
learned node representations are highly indistinguishable due to the stacked
aggregators. In this paper, we propose a new perspective to look at the
performance degradation of deep GNNs, i.e., feature overcorrelation. Through
empirical and theoretical study on this matter, we demonstrate the existence of
feature overcorrelation in deeper GNNs and reveal potential reasons leading to
this issue. To reduce the feature correlation, we propose a general framework
DeCorr which can encourage GNNs to encode less redundant information. Extensive
experiments have demonstrated that DeCorr can help enable deeper GNNs and is
complementary to existing techniques tackling the oversmoothing issue.
","[{'version': 'v1', 'created': 'Wed, 15 Jun 2022 18:13:52 GMT'}]",2022-06-17,"[['Jin', 'Wei', ''], ['Liu', 'Xiaorui', ''], ['Ma', 'Yao', ''], ['Aggarwal', 'Charu', ''], ['Tang', 'Jiliang', '']]","['Graph Neural Networks', 'Semi-supervised Learning', 'Deep Models']"
12853,1910.07476,Michael Biehl,Elisa Oostwal and Michiel Straat and Michael Biehl,"Hidden Unit Specialization in Layered Neural Networks: ReLU vs.
  Sigmoidal Activation","Main changes compared to first version: Added a section on supporting
  Monte Carlo simulations, results and additional figures are presented and
  discussed. Some references added. Layout changed to single column layout for
  better readability. Minor textual changes and typos corrected","Physica A: Statistical Mechanics and its Applications 564: 125517,
  2020",10.1016/j.physa.2020.125517,,cs.LG cond-mat.dis-nn stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study layered neural networks of rectified linear units (ReLU) in a
modelling framework for stochastic training processes. The comparison with
sigmoidal activation functions is in the center of interest. We compute typical
learning curves for shallow networks with K hidden units in matching student
teacher scenarios. The systems exhibit sudden changes of the generalization
performance via the process of hidden unit specialization at critical sizes of
the training set. Surprisingly, our results show that the training behavior of
ReLU networks is qualitatively different from that of networks with sigmoidal
activations. In networks with K >= 3 sigmoidal hidden units, the transition is
discontinuous: Specialized network configurations co-exist and compete with
states of poor performance even for very large training sets. On the contrary,
the use of ReLU activations results in continuous transitions for all K: For
large enough training sets, two competing, differently specialized states
display similar generalization abilities, which coincide exactly for large
networks in the limit K to infinity.
","[{'version': 'v1', 'created': 'Wed, 16 Oct 2019 17:06:00 GMT'}, {'version': 'v2', 'created': 'Wed, 27 May 2020 05:19:14 GMT'}]",2020-11-13,"[['Oostwal', 'Elisa', ''], ['Straat', 'Michiel', ''], ['Biehl', 'Michael', '']]","['Neural Networks', 'Machine Learning', 'Statistical Physics']"
12854,2103.04889,Radhika Rani Chintala,"Radhika Rani Chintala, Narasinga Rao M R, Somu Venkateswarlu","Design and implementation of Energy Efficient Lightweight Encryption
  (EELWE) algorithm for medical applications",11 pages,,10.17762/itii.v9i1.152,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Proportional to the growth in the usage of Human Sensor Networks (HSN), the
volume of the data exchange between Sensor devices is increasing at a rapid
pace. In this paper, we have proposed an Energy Efficient Lightweight
Encryption (EELWE) algorithm for providing the confidentiality of data at the
sensor level, particularly suitable for resource-constrained environments.
Results obtained have proved that an EELWE consumes less energy relative to
present lightweight ciphers and it supports multiple block sizes of 32-bit,
48-bit, and 64-bit.
","[{'version': 'v1', 'created': 'Mon, 8 Mar 2021 16:48:31 GMT'}]",2021-05-27,"[['Chintala', 'Radhika Rani', ''], ['R', 'Narasinga Rao M', ''], ['Venkateswarlu', 'Somu', '']]","['Human Sensor Network', 'Security', 'Lightweight Encryption', 'Energy Consumption']"
12855,2209.00642,Sindhu Hegde,"Sindhu B Hegde, K R Prajwal, Rudrabha Mukhopadhyay, Vinay P
  Namboodiri, C. V. Jawahar",Lip-to-Speech Synthesis for Arbitrary Speakers in the Wild,"Accepted in ACM-MM 2022, 9 pages, 2 pages supplementary, 7 Figures",,10.1145/3503161.3548081,,cs.CV cs.CL cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  In this work, we address the problem of generating speech from silent lip
videos for any speaker in the wild. In stark contrast to previous works, our
method (i) is not restricted to a fixed number of speakers, (ii) does not
explicitly impose constraints on the domain or the vocabulary and (iii) deals
with videos that are recorded in the wild as opposed to within laboratory
settings. The task presents a host of challenges, with the key one being that
many features of the desired target speech, like voice, pitch and linguistic
content, cannot be entirely inferred from the silent face video. In order to
handle these stochastic variations, we propose a new VAE-GAN architecture that
learns to associate the lip and speech sequences amidst the variations. With
the help of multiple powerful discriminators that guide the training process,
our generator learns to synthesize speech sequences in any voice for the lip
movements of any person. Extensive experiments on multiple datasets show that
we outperform all baselines by a large margin. Further, our network can be
fine-tuned on videos of specific identities to achieve a performance comparable
to single-speaker models that are trained on $4\times$ more data. We conduct
numerous ablation studies to analyze the effect of different modules of our
architecture. We also provide a demo video that demonstrates several
qualitative results along with the code and trained models on our website:
\url{http://cvit.iiit.ac.in/research/projects/cvit-projects/lip-to-speech-synthesis}}
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2022 17:50:29 GMT'}]",2022-09-02,"[['Hegde', 'Sindhu B', ''], ['Prajwal', 'K R', ''], ['Mukhopadhyay', 'Rudrabha', ''], ['Namboodiri', 'Vinay P', ''], ['Jawahar', 'C. V.', '']]","['lip-to-speech', 'speech synthesis', 'hybrid vae-gan', 'talking-face videos']"
12856,2111.03756,Chen Chen,"Chen Chen, Janet G. Johnson, Kemeberly Charles, Alice Lee, Ella T.
  Lifset, Michael Hogarth, Alison A. Moore, Emilia Farcas, Nadir Weibel","Understanding Barriers and Design Opportunities to Improve Healthcare
  and QOL for Older Adults through Voice Assistants","16 pages, The 23rd International ACM SIGACCESS Conference on
  Computers and Accessibility",,10.1145/3441852.3471218,,cs.HC cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Voice based Intelligent Virtual Assistants (IVAs) promise to improve
healthcare management and Quality of Life (QOL) by introducing the paradigm of
hands free and eye free interactions. However, there has been little
understanding regarding the challenges for designing such systems for older
adults, especially when it comes to healthcare related tasks. To tackle this,
we consider the processes of care delivery and QOL enhancements for older
adults as a collaborative task between patients and providers. By interviewing
16 older adults living independently or semi independently and 5 providers, we
identified 12 barriers that older adults might encounter during daily routine
and while managing health. We ultimately highlighted key design challenges and
opportunities that might be introduced when integrating voice based IVAs into
the life of older adults. Our work will benefit practitioners who study and
attempt to create full fledged IVA powered smart devices to deliver better care
and support an increased QOL for aging populations.
","[{'version': 'v1', 'created': 'Fri, 5 Nov 2021 23:22:05 GMT'}]",2021-11-09,"[['Chen', 'Chen', ''], ['Johnson', 'Janet G.', ''], ['Charles', 'Kemeberly', ''], ['Lee', 'Alice', ''], ['Lifset', 'Ella T.', ''], ['Hogarth', 'Michael', ''], ['Moore', 'Alison A.', ''], ['Farcas', 'Emilia', ''], ['Weibel', 'Nadir', '']]","['Gerontechnology', 'Accessibility', 'Health – Well-being', 'User Experience Design', 'Older Adults', 'Semi-Structured Interview']"
12857,2004.09863,Asunci\'on Jim\'enez-Cordero,"Asunci\'on Jim\'enez-Cordero, Juan Miguel Morales and Salvador Pineda","A novel embedded min-max approach for feature selection in nonlinear
  support vector machine classification",Published at European Journal of Operational Research,,10.1016/j.ejor.2020.12.009,,cs.LG math.OC stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In recent years, feature selection has become a challenging problem in
several machine learning fields, such as classification problems. Support
Vector Machine (SVM) is a well-known technique applied in classification tasks.
Various methodologies have been proposed in the literature to select the most
relevant features in SVM. Unfortunately, all of them either deal with the
feature selection problem in the linear classification setting or propose
ad-hoc approaches that are difficult to implement in practice. In contrast, we
propose an embedded feature selection method based on a min-max optimization
problem, where a trade-off between model complexity and classification accuracy
is sought. By leveraging duality theory, we equivalently reformulate the
min-max problem and solve it without further ado using off-the-shelf software
for nonlinear optimization. The efficiency and usefulness of our approach are
tested on several benchmark data sets in terms of accuracy, number of selected
features and interpretability.
","[{'version': 'v1', 'created': 'Tue, 21 Apr 2020 09:40:38 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Apr 2020 14:24:48 GMT'}, {'version': 'v3', 'created': 'Fri, 23 Oct 2020 16:35:04 GMT'}, {'version': 'v4', 'created': 'Fri, 15 Jan 2021 15:40:42 GMT'}]",2021-01-18,"[['Jiménez-Cordero', 'Asunción', ''], ['Morales', 'Juan Miguel', ''], ['Pineda', 'Salvador', '']]","['Machine learning', 'min-max optimization', 'duality theory', 'feature']"
12858,2301.07799,Alexander New,"Megan M. Baker, Alexander New, Mario Aguilar-Simon, Ziad Al-Halah,
  S\'ebastien M. R. Arnold, Ese Ben-Iwhiwhu, Andrew P. Brna, Ethan Brooks, Ryan
  C. Brown, Zachary Daniels, Anurag Daram, Fabien Delattre, Ryan Dellana, Eric
  Eaton, Haotian Fu, Kristen Grauman, Jesse Hostetler, Shariq Iqbal, Cassandra
  Kent, Nicholas Ketz, Soheil Kolouri, George Konidaris, Dhireesha Kudithipudi,
  Erik Learned-Miller, Seungwon Lee, Michael L. Littman, Sandeep Madireddy,
  Jorge A. Mendez, Eric Q. Nguyen, Christine D. Piatko, Praveen K. Pilly, Aswin
  Raghavan, Abrar Rahman, Santhosh Kumar Ramakrishnan, Neale Ratzlaff, Andrea
  Soltoggio, Peter Stone, Indranil Sur, Zhipeng Tang, Saket Tiwari, Kyle
  Vedder, Felix Wang, Zifan Xu, Angel Yanguas-Gil, Harel Yedidsion, Shangqun
  Yu, Gautam K. Vallabha","A Domain-Agnostic Approach for Characterization of Lifelong Learning
  Systems",To appear in Neural Networks,,10.1016/j.neunet.2023.01.007,,cs.LG cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the advancement of machine learning techniques in recent years,
state-of-the-art systems lack robustness to ""real world"" events, where the
input distributions and tasks encountered by the deployed systems will not be
limited to the original training context, and systems will instead need to
adapt to novel distributions and tasks while deployed. This critical gap may be
addressed through the development of ""Lifelong Learning"" systems that are
capable of 1) Continuous Learning, 2) Transfer and Adaptation, and 3)
Scalability. Unfortunately, efforts to improve these capabilities are typically
treated as distinct areas of research that are assessed independently, without
regard to the impact of each separate capability on other aspects of the
system. We instead propose a holistic approach, using a suite of metrics and an
evaluation framework to assess Lifelong Learning in a principled way that is
agnostic to specific domains or system techniques. Through five case studies,
we show that this suite of metrics can inform the development of varied and
complex Lifelong Learning systems. We highlight how the proposed suite of
metrics quantifies performance trade-offs present during Lifelong Learning
system development - both the widely discussed Stability-Plasticity dilemma and
the newly proposed relationship between Sample Efficient and Robust Learning.
Further, we make recommendations for the formulation and use of metrics to
guide the continuing development of Lifelong Learning systems and assess their
progress in the future.
","[{'version': 'v1', 'created': 'Wed, 18 Jan 2023 21:58:54 GMT'}]",2023-01-24,"[['Baker', 'Megan M.', ''], ['New', 'Alexander', ''], ['Aguilar-Simon', 'Mario', ''], ['Al-Halah', 'Ziad', ''], ['Arnold', 'Sébastien M. R.', ''], ['Ben-Iwhiwhu', 'Ese', ''], ['Brna', 'Andrew P.', ''], ['Brooks', 'Ethan', ''], ['Brown', 'Ryan C.', ''], ['Daniels', 'Zachary', ''], ['Daram', 'Anurag', ''], ['Delattre', 'Fabien', ''], ['Dellana', 'Ryan', ''], ['Eaton', 'Eric', ''], ['Fu', 'Haotian', ''], ['Grauman', 'Kristen', ''], ['Hostetler', 'Jesse', ''], ['Iqbal', 'Shariq', ''], ['Kent', 'Cassandra', ''], ['Ketz', 'Nicholas', ''], ['Kolouri', 'Soheil', ''], ['Konidaris', 'George', ''], ['Kudithipudi', 'Dhireesha', ''], ['Learned-Miller', 'Erik', ''], ['Lee', 'Seungwon', ''], ['Littman', 'Michael L.', ''], ['Madireddy', 'Sandeep', ''], ['Mendez', 'Jorge A.', ''], ['Nguyen', 'Eric Q.', ''], ['Piatko', 'Christine D.', ''], ['Pilly', 'Praveen K.', ''], ['Raghavan', 'Aswin', ''], ['Rahman', 'Abrar', ''], ['Ramakrishnan', 'Santhosh Kumar', ''], ['Ratzlaff', 'Neale', ''], ['Soltoggio', 'Andrea', ''], ['Stone', 'Peter', ''], ['Sur', 'Indranil', ''], ['Tang', 'Zhipeng', ''], ['Tiwari', 'Saket', ''], ['Vedder', 'Kyle', ''], ['Wang', 'Felix', ''], ['Xu', 'Zifan', ''], ['Yanguas-Gil', 'Angel', ''], ['Yedidsion', 'Harel', ''], ['Yu', 'Shangqun', ''], ['Vallabha', 'Gautam K.', '']]","['lifelong learning', 'reinforcement learning', 'continual learning', 'system evaluation', 'catastrophic forgetting']"
12859,2109.14950,Huan Qing,Huan Qing,"A useful criterion on studying consistent estimation in community
  detection",,,10.3390/e24081098,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In network analysis, developing a unified theoretical framework that can
compare methods under different models is an interesting problem. This paper
proposes a partial solution to this problem. We summarize the idea of using
separation condition for a standard network and sharp threshold of
Erd\""os-R\'enyi random graph to study consistent estimation, compare
theoretical error rates and requirements on network sparsity of spectral
methods under models that can degenerate to stochastic block model as a
four-step criterion SCSTC. Using SCSTC, we find some inconsistent phenomena on
separation condition and sharp threshold in community detection. Especially, we
find original theoretical results of the SPACL algorithm introduced to estimate
network memberships under the mixed membership stochastic blockmodel were
sub-optimal. To find the formation mechanism of inconsistencies, we
re-establish theoretical convergence rates of this algorithm by applying recent
techniques on row-wise eigenvector deviation. The results are further extended
to the degree corrected mixed membership model. By comparison, our results
enjoy smaller error rates, lesser dependence on the number of communities,
weaker requirements on network sparsity, and so forth. Furthermore, separation
condition and sharp threshold obtained from our theoretical results match
classical results, which shows the usefulness of this criterion on studying
consistent estimation.
","[{'version': 'v1', 'created': 'Thu, 30 Sep 2021 09:27:48 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Oct 2021 03:00:06 GMT'}]",2022-08-24,"[['Qing', 'Huan', '']]","['Community detection', 'consistency', 'mixed membership network', 'separation condition', 'sharp threshold']"
12860,2006.05167,Sara Asgari,Sara Asgari and Babak Sadeghiyan,Towards Generating Benchmark Datasets for Worm Infection Studies,,,10.1109/IST50524.2020.9345845,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Worm origin identification and propagation path reconstruction are among the
essential problems in digital forensics. Until now, several methods have been
proposed for this purpose. However, evaluating these methods is a big challenge
because there are no suitable datasets containing both normal background
traffic and worm traffic to evaluate these methods. In this paper, we
investigate different methods of generating such datasets and suggest a
technique for this purpose. ReaSE is a tool for the creation of realistic
simulation environments. However, it needs some modifications to be suitable
for generating the datasets. So we make required modifications to it. Then, we
generate several datasets for Slammer, Code Red I, Code Red II and modified
versions of these worms in different scenarios using our technique and make
them publicly available.
","[{'version': 'v1', 'created': 'Tue, 9 Jun 2020 10:21:21 GMT'}, {'version': 'v2', 'created': 'Sun, 14 Jun 2020 12:17:09 GMT'}, {'version': 'v3', 'created': 'Fri, 3 Jul 2020 12:44:30 GMT'}, {'version': 'v4', 'created': 'Sat, 30 Jan 2021 16:56:33 GMT'}, {'version': 'v5', 'created': 'Sun, 21 Feb 2021 20:07:23 GMT'}, {'version': 'v6', 'created': 'Sun, 30 May 2021 17:25:08 GMT'}]",2021-06-01,"[['Asgari', 'Sara', ''], ['Sadeghiyan', 'Babak', '']]","['dataset generation', 'simulation', 'worm origin']"
12861,2003.07037,Meng Chen,"Meng Chen, Yang Liu, Xiaohui Yu",NLPMM: a Next Location Predictor with Markov Modeling,,"Pacific-Asia Conference on Knowledge Discovery and Data Mining,
  186-197, 2014",10.1007/978-3-319-06605-9_16,,cs.AI cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we solve the problem of predicting the next locations of the
moving objects with a historical dataset of trajectories. We present a Next
Location Predictor with Markov Modeling (NLPMM) which has the following
advantages: (1) it considers both individual and collective movement patterns
in making prediction, (2) it is effective even when the trajectory data is
sparse, (3) it considers the time factor and builds models that are suited to
different time periods. We have conducted extensive experiments in a real
dataset, and the results demonstrate the superiority of NLPMM over existing
methods.
","[{'version': 'v1', 'created': 'Mon, 16 Mar 2020 05:48:41 GMT'}]",2020-03-17,"[['Chen', 'Meng', ''], ['Liu', 'Yang', ''], ['Yu', 'Xiaohui', '']]","['moving pattern', 'next location prediction', 'time factor']"
12862,2212.11582,Linfeng Du,"Linfeng Du, Tingyuan Liang, Sharad Sinha, Zhiyao Xie, Wei Zhang","FADO: Floorplan-Aware Directive Optimization for High-Level Synthesis
  Designs on Multi-Die FPGAs","Accepted as a conference paper at FPGA '23. Open source at:
  https://github.com/RipperJ/FADO",,10.1145/3543622.3573188,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-die FPGAs are widely adopted to deploy large hardware accelerators. Two
factors impede the performance optimization of HLS designs implemented on
multi-die FPGAs. On the one hand, the long net delay due to nets crossing
die-boundaries results in an NP-hard problem to properly floorplan and pipeline
an application. On the other hand, traditional automated searching flow for HLS
directive optimizations targets single-die FPGAs, and hence, it cannot consider
the resource constraints on each die and the timing issue incurred by the
die-crossings. Further, it leads to an excessively long runtime to legalize the
floorplan of HLS designs generated under each group of configurations during
directive optimization due to the large design scale.
  To co-optimize the directives and floorplan of HLS designs on multi-die
FPGAs, we propose the FADO framework, which formulates the directive-floorplan
co-search problem based on the multi-choice multi-dimensional bin-packing and
solves it using an iterative optimization flow. For each step of directive
search, a latency-bottleneck-guided greedy algorithm searches for more
efficient directive configurations. For floorplanning, instead of repetitively
incurring global floorplanning algorithms, we implement a more efficient
incremental floorplan legalization algorithm. It mainly applies the worst-fit
online bin-packing algorithm to balance the floorplan, together with an offline
best-fit-decreasing re-packing to compact the floorplan, followed by pipelining
of long wires crossing die-boundaries.
  Through experiments on HLS designs mixing dataflow and non-dataflow kernels,
FADO not only well-automates the co-optimization and finishes within 693X~4925X
shorter runtime, compared with DSE assisted by global floorplanning, but also
yields an improvement of 1.16X~8.78X in overall workflow execution time after
implementation on the Xilinx Alveo U250 FPGA.
","[{'version': 'v1', 'created': 'Thu, 22 Dec 2022 10:18:35 GMT'}, {'version': 'v2', 'created': 'Sat, 7 Jan 2023 08:16:46 GMT'}]",2023-01-10,"[['Du', 'Linfeng', ''], ['Liang', 'Tingyuan', ''], ['Sinha', 'Sharad', ''], ['Xie', 'Zhiyao', ''], ['Zhang', 'Wei', '']]","['High-Level Synthesis', 'Design Space Exploration', 'Multi-Die FPGA', 'Directive Optimization', 'Floorplanning']"
12863,2112.02662,Abdolreza Taheri,"Tyrone Machado, David Fassbender, Abdolreza Taheri, Daniel Eriksson,
  Himanshu Gupta, Amirmasoud Molaei, Paolo Forte, Prashant Rai, Reza
  Ghabcheloo, Saku M\""akinen, Achim Lilienthal, Henrik Andreasson, Marcus
  Geimer","Autonomous Heavy-Duty Mobile Machinery: A Multidisciplinary
  Collaborative Challenge","published in 2021 IEEE International Conference on Technology and
  Entrepreneurship (ICTE)","2021 IEEE International Conference on Technology and
  Entrepreneurship (ICTE), 2021, Kaunas, Lithuania, pp. 1-8",10.1109/ICTE51655.2021.9584498,,cs.HC cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Heavy-duty mobile machines (HDMMs) are a wide range of machinery used in
diverse and critical application areas which are currently facing several
issues like skilled labor shortage, poor safety records, and harsh work
environments. Consequently, efforts are underway to increase automation in
HDMMs for increased productivity and safety, eventually transitioning to
operator-less autonomous HDMMs to address skilled labor shortages. However,
HDMM are complex machines requiring continuous physical and cognitive inputs
from human-operators. Thus, developing autonomous HDMM is a huge challenge,
with current research and developments being performed in several independent
research domains. Through this study, we use the bounded rationality concept to
propose multidisciplinary collaborations for new autonomous HDMMs and apply the
transaction cost economics framework to suggest future implications in the HDMM
industry. Furthermore, we introduce a conceptual understanding of
collaborations in the autonomous HDMM as a unified approach, while highlighting
the practical implications and challenges of the complex nature of such
multidisciplinary collaborations. The collaborative challenges and potentials
are mapped out between the following topics: mechanical systems, AI methods,
software systems, sensors, connectivity, simulations and process optimization,
business cases, organization theories, and finally, regulatory frameworks.
","[{'version': 'v1', 'created': 'Sun, 5 Dec 2021 19:35:25 GMT'}, {'version': 'v2', 'created': 'Sun, 9 Jan 2022 14:21:27 GMT'}]",2022-01-11,"[['Machado', 'Tyrone', ''], ['Fassbender', 'David', ''], ['Taheri', 'Abdolreza', ''], ['Eriksson', 'Daniel', ''], ['Gupta', 'Himanshu', ''], ['Molaei', 'Amirmasoud', ''], ['Forte', 'Paolo', ''], ['Rai', 'Prashant', ''], ['Ghabcheloo', 'Reza', ''], ['Mäkinen', 'Saku', ''], ['Lilienthal', 'Achim', ''], ['Andreasson', 'Henrik', ''], ['Geimer', 'Marcus', '']]","['automation', 'augmentation', 'autonomous', 'collaboration', 'mobile machinery', 'transaction cost economics']"
12864,2205.08335,Wenying Wei,"Ming Fan, Wenying Wei, Wuxia Jin, Zijiang Yang, Ting Liu",Explanation-Guided Fairness Testing through Genetic Algorithm,,,10.1145/1122445.1122456,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The fairness characteristic is a critical attribute of trusted AI systems. A
plethora of research has proposed diverse methods for individual fairness
testing. However, they are suffering from three major limitations, i.e., low
efficiency, low effectiveness, and model-specificity. This work proposes ExpGA,
an explanationguided fairness testing approach through a genetic algorithm
(GA). ExpGA employs the explanation results generated by interpretable methods
to collect high-quality initial seeds, which are prone to derive discriminatory
samples by slightly modifying feature values. ExpGA then adopts GA to search
discriminatory sample candidates by optimizing a fitness value. Benefiting from
this combination of explanation results and GA, ExpGA is both efficient and
effective to detect discriminatory individuals. Moreover, ExpGA only requires
prediction probabilities of the tested model, resulting in a better
generalization capability to various models. Experiments on multiple real-world
benchmarks, including tabular and text datasets, show that ExpGA presents
higher efficiency and effectiveness than four state-of-the-art approaches.
","[{'version': 'v1', 'created': 'Mon, 16 May 2022 02:40:48 GMT'}]",2022-05-18,"[['Fan', 'Ming', ''], ['Wei', 'Wenying', ''], ['Jin', 'Wuxia', ''], ['Yang', 'Zijiang', ''], ['Liu', 'Ting', '']]","['Explanation result', 'fairness testing', 'genetic algorithm']"
12865,1909.05539,Alexander Svozil,"Krishnendu Chatterjee and Wolfgang Dvor\'ak and Monika Henzinger and
  Alexander Svozil",Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs,Published at CONCUR 2019,,10.4230/LIPIcs.CONCUR.2019.7,,cs.GT cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The fundamental model-checking problem, given as input a model and a
specification, asks for the algorithmic verification of whether the model
satisfies the specification. Two classical models for reactive systems are
graphs and Markov decision processes (MDPs). A basic specification formalism in
the verification of reactive systems is the strong fairness (aka Streett)
objective, where given different types of requests and corresponding grants,
the requirement is that for each type, if the request event happens infinitely
often, then the corresponding grant event must also happen infinitely often.
All omega-regular objectives can be expressed as Streett objectives and hence
they are canonical in verification. Consider graphs/MDPs with n vertices, m
edges, and a Streett objectives with k pairs, and let b denote the size of the
description of the Streett objective for the sets of requests and grants. The
current best-known algorithm for the problem requires time $O(min(n^2, m
\sqrt{m \log n}) + b \log n)$. In this work, we present randomized near-linear
time algorithms, with expected running time $\widetilde{O}(m + b)$, where the
$\widetilde{O}$ notation hides poly-log factors. Our randomized algorithms are
near-linear in the size of the input, and hence optimal up to poly-log factors.
","[{'version': 'v1', 'created': 'Thu, 12 Sep 2019 09:56:24 GMT'}]",2019-09-13,"[['Chatterjee', 'Krishnendu', ''], ['Dvorák', 'Wolfgang', ''], ['Henzinger', 'Monika', ''], ['Svozil', 'Alexander', '']]","['model checking', 'graph games', 'Streett games']"
12866,1702.03414,Kees Middelburg,C. A. Middelburg,"On the strongest three-valued paraconsistent logic contained in
  classical logic and its dual","17 pages, version that is accepted for publication, there is some
  text overlap between this paper and arXiv:1508.06899 [cs.LO]","Journal of Logic and Computation, 31(2):597--611, 2021",10.1093/logcom/exaa084,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  LP$^{\supset,\mathsf{F}}$ is a three-valued paraconsistent propositional
logic which is essentially the same as J3. It has most properties that have
been proposed as desirable properties of a reasonable paraconsistent
propositional logic. However, it follows easily from already published results
that there are exactly 8192 different three-valued paraconsistent propositional
logics that have the properties concerned. In this paper, properties concerning
the logical equivalence relation of a logic are used to distinguish
LP$^{\supset,\mathsf{F}}$ from the others. As one of the bonuses of focussing
on the logical equivalence relation, it is found that only 32 of the 8192
logics have a logical equivalence relation that satisfies the identity,
annihilation, idempotent, and commutative laws for conjunction and disjunction.
For most properties of LP$^{\supset,\mathsf{F}}$ that have been proposed as
desirable properties of a reasonable paraconsistent propositional logic, its
paracomplete analogue has a comparable property. In this paper, properties
concerning the logical equivalence relation of a logic are also used to
distinguish the paracomplete analogue of LP$^{\supset,\mathsf{F}}$ from the
other three-valued paracomplete propositional logics with those comparable
properties.
","[{'version': 'v1', 'created': 'Sat, 11 Feb 2017 12:04:14 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Nov 2017 10:57:11 GMT'}, {'version': 'v3', 'created': 'Wed, 6 Mar 2019 11:21:26 GMT'}, {'version': 'v4', 'created': 'Thu, 14 Mar 2019 15:50:34 GMT'}, {'version': 'v5', 'created': 'Sun, 24 May 2020 10:52:12 GMT'}, {'version': 'v6', 'created': 'Wed, 23 Sep 2020 09:27:19 GMT'}, {'version': 'v7', 'created': 'Tue, 1 Dec 2020 16:31:04 GMT'}]",2021-03-08,"[['Middelburg', 'C. A.', '']]","['paraconsistent logic', 'three-valued logic', 'logical consequence', 'logical equivalence', 'paracomplete logic']"
12867,1704.03329,"Eike Hermann M\""uller","William R. Saunders and James Grant and Eike H. M\""uller","A Domain Specific Language for Performance Portable Molecular Dynamics
  Algorithms","24 pages, 12 figures, 11 tables, accepted for publication in Computer
  Physics Communications on 12 Nov 2017",,10.1016/j.cpc.2017.11.006,,cs.DC cs.SE physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Developers of Molecular Dynamics (MD) codes face significant challenges when
adapting existing simulation packages to new hardware. In a continuously
diversifying hardware landscape it becomes increasingly difficult for
scientists to be experts both in their own domain (physics/chemistry/biology)
and specialists in the low level parallelisation and optimisation of their
codes. To address this challenge, we describe a ""Separation of Concerns""
approach for the development of parallel and optimised MD codes: the science
specialist writes code at a high abstraction level in a domain specific
language (DSL), which is then translated into efficient computer code by a
scientific programmer. In a related context, an abstraction for the solution of
partial differential equations with grid based methods has recently been
implemented in the (Py)OP2 library. Inspired by this approach, we develop a
Python code generation system for molecular dynamics simulations on different
parallel architectures, including massively parallel distributed memory systems
and GPUs. We demonstrate the efficiency of the auto-generated code by studying
its performance and scalability on different hardware and compare it to other
state-of-the-art simulation packages. With growing data volumes the extraction
of physically meaningful information from the simulation becomes increasingly
challenging and requires equally efficient implementations. A particular
advantage of our approach is the easy expression of such analysis algorithms.
We consider two popular methods for deducing the crystalline structure of a
material from the local environment of each atom, show how they can be
expressed in our abstraction and implement them in the code generation
framework.
","[{'version': 'v1', 'created': 'Tue, 11 Apr 2017 14:52:55 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Nov 2017 15:02:44 GMT'}]",2018-03-14,"[['Saunders', 'William R.', ''], ['Grant', 'James', ''], ['Müller', 'Eike H.', '']]","['Molecular Dynamics', 'Domain Specific Language', 'Performance Portability', 'Parallel Computing', 'GPU']"
12868,2210.15565,Joaqu\'in Ossand\'on,"Joaquin Ossand\'on, Benjamin Earle, \'Alvaro Soto",Bridging the visual gap in VLN via semantically richer instructions,"Accepted in ECCV 2022. Research completed on November 21, 2021",,10.1007/978-3-031-19836-6_4,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The Visual-and-Language Navigation (VLN) task requires understanding a
textual instruction to navigate a natural indoor environment using only visual
information. While this is a trivial task for most humans, it is still an open
problem for AI models. In this work, we hypothesize that poor use of the visual
information available is at the core of the low performance of current models.
To support this hypothesis, we provide experimental evidence showing that
state-of-the-art models are not severely affected when they receive just
limited or even no visual data, indicating a strong overfitting to the textual
instructions. To encourage a more suitable use of the visual information, we
propose a new data augmentation method that fosters the inclusion of more
explicit visual information in the generation of textual navigational
instructions. Our main intuition is that current VLN datasets include textual
instructions that are intended to inform an expert navigator, such as a human,
but not a beginner visual navigational agent, such as a randomly initialized DL
model. Specifically, to bridge the visual semantic gap of current VLN datasets,
we take advantage of metadata available for the Matterport3D dataset that,
among others, includes information about object labels that are present in the
scenes. Training a state-of-the-art model with the new set of instructions
increase its performance by 8% in terms of success rate on unseen environments,
demonstrating the advantages of the proposed data augmentation method.
","[{'version': 'v1', 'created': 'Thu, 27 Oct 2022 15:58:07 GMT'}]",2022-10-28,"[['Ossandón', 'Joaquin', ''], ['Earle', 'Benjamin', ''], ['Soto', 'Álvaro', '']]","['computer vision', 'natural language processing', 'navigation', 'VLN', 'data augmentation']"
12869,2206.05809,Yue Wu,Yue Wu and Jes\'us A. De Loera,Geometric Policy Iteration for Markov Decision Processes,Camera ready version for SIGKDD 2022,,10.1145/3534678.3539478,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Recently discovered polyhedral structures of the value function for finite
state-action discounted Markov decision processes (MDP) shed light on
understanding the success of reinforcement learning. We investigate the value
function polytope in greater detail and characterize the polytope boundary
using a hyperplane arrangement. We further show that the value space is a union
of finitely many cells of the same hyperplane arrangement and relate it to the
polytope of the classical linear programming formulation for MDPs. Inspired by
these geometric properties, we propose a new algorithm, Geometric Policy
Iteration (GPI), to solve discounted MDPs. GPI updates the policy of a single
state by switching to an action that is mapped to the boundary of the value
function polytope, followed by an immediate update of the value function. This
new update rule aims at a faster value improvement without compromising
computational efficiency. Moreover, our algorithm allows asynchronous updates
of state values which is more flexible and advantageous compared to traditional
policy iteration when the state set is large. We prove that the complexity of
GPI achieves the best known bound $\mathcal{O}\left(\frac{|\mathcal{A}|}{1 -
\gamma}\log \frac{1}{1-\gamma}\right)$ of policy iteration and empirically
demonstrate the strength of GPI on MDPs of various sizes.
","[{'version': 'v1', 'created': 'Sun, 12 Jun 2022 18:15:24 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Jun 2022 08:52:39 GMT'}]",2022-06-27,"[['Wu', 'Yue', ''], ['De Loera', 'Jesús A.', '']]","['Markov Decision Processes', 'Policy Iteration', 'Polytopes']"
12870,1905.05918,David Laredo Razo,"David Laredo, Zhaoyin Chen, Oliver Sch\""utze, Jian-Qiao Sun","A Neural Network-Evolutionary Computational Framework for Remaining
  Useful Life Estimation of Mechanical Systems","Published at Neural Networks 116, (2019) 178-187","Neural Networks 116, (2019) 178-187",10.1016/j.neunet.2019.04.016,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a framework for estimating the remaining useful life
(RUL) of mechanical systems. The framework consists of a multi-layer perceptron
and an evolutionary algorithm for optimizing the data-related parameters. The
framework makes use of a strided time window to estimate the RUL for mechanical
components. Tuning the data-related parameters can become a very time consuming
task. The framework presented here automatically reshapes the data such that
the efficiency of the model is increased. Furthermore, the complexity of the
model is kept low, e.g. neural networks with few hidden layers and few neurons
at each layer. Having simple models has several advantages like short training
times and the capacity of being in environments with limited computational
resources such as embedded systems. The proposed method is evaluated on the
publicly available C-MAPSS dataset, its accuracy is compared against other
state-of-the art methods for the same dataset.
","[{'version': 'v1', 'created': 'Wed, 15 May 2019 02:31:45 GMT'}]",2019-05-16,"[['Laredo', 'David', ''], ['Chen', 'Zhaoyin', ''], ['Schütze', 'Oliver', ''], ['Sun', 'Jian-Qiao', '']]","['artificial neural networks', 'moving time window', 'RUL estimation', 'prognostics', 'evolutionary algorithms']"
12871,1801.06294,Shaika Chowdhury,"Shaika Chowdhury, Chenwei Zhang and Philip S. Yu",Multi-Task Pharmacovigilance Mining from Social Media Posts,Accepted in the research track of The Web Conference(WWW) 2018,,10.1145/3178876.3186053,,cs.LG cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media has grown to be a crucial information source for
pharmacovigilance studies where an increasing number of people post adverse
reactions to medical drugs that are previously unreported. Aiming to
effectively monitor various aspects of Adverse Drug Reactions (ADRs) from
diversely expressed social medical posts, we propose a multi-task neural
network framework that learns several tasks associated with ADR monitoring with
different levels of supervisions collectively. Besides being able to correctly
classify ADR posts and accurately extract ADR mentions from online posts, the
proposed framework is also able to further understand reasons for which the
drug is being taken, known as 'indication', from the given social media post. A
coverage-based attention mechanism is adopted in our framework to help the
model properly identify 'phrasal' ADRs and Indications that are attentive to
multiple words in a post. Our framework is applicable in situations where
limited parallel data for different pharmacovigilance tasks are available.We
evaluate the proposed framework on real-world Twitter datasets, where the
proposed model outperforms the state-of-the-art alternatives of each individual
task consistently.
","[{'version': 'v1', 'created': 'Fri, 19 Jan 2018 05:04:21 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Feb 2018 02:07:45 GMT'}, {'version': 'v3', 'created': 'Tue, 13 Feb 2018 06:07:22 GMT'}, {'version': 'v4', 'created': 'Thu, 15 Feb 2018 03:03:56 GMT'}, {'version': 'v5', 'created': 'Fri, 16 Feb 2018 18:43:05 GMT'}]",2018-02-19,"[['Chowdhury', 'Shaika', ''], ['Zhang', 'Chenwei', ''], ['Yu', 'Philip S.', '']]","['Multi-Task Learning', 'Pharmacovigilance', 'Adverse Drug Reaction', 'Attention Mechanism', 'Coverage', 'Recurrent Neural Network', 'SocialMedia']"
12872,2106.08078,Bosheng Song,"Yu Jin, Bosheng Song, Yanyan Li, Ying Zhu","Time-free solution to independent set problem using P systems with
  active membranes",,"Fundamenta Informaticae, Volume 182, Issue 3 (November 18, 2021)
  fi:8636",10.3233/FI-2021-2072,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Membrane computing is a branch of natural computingwhich abstracts fromthe
structure and the functioning of living cells. The computation models obtained
in the field of membrane computing are usually called P systems. P systems have
been used to solve computationally hard problems efficiently on the assumption
that the execution of each rule is completed in exactly one time-unit (a global
clock is assumed for timing and synchronizing the execution of rules). However,
in biological reality, different biological processes take different times to
be completed, which can also be influenced by many environmental factors. In
this work, with this biological reality, we give a time-free solution to
independent set problemusing P systems with active membranes, which solve the
problem independent of the execution time of the involved rules.
","[{'version': 'v1', 'created': 'Tue, 15 Jun 2021 12:11:18 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Jun 2021 14:53:05 GMT'}, {'version': 'v3', 'created': 'Thu, 24 Jun 2021 04:28:09 GMT'}, {'version': 'v4', 'created': 'Mon, 12 Jul 2021 12:58:39 GMT'}, {'version': 'v5', 'created': 'Sat, 31 Jul 2021 02:48:52 GMT'}, {'version': 'v6', 'created': 'Sat, 30 Oct 2021 09:47:48 GMT'}]",2021-12-11,"[['Jin', 'Yu', ''], ['Song', 'Bosheng', ''], ['Li', 'Yanyan', ''], ['Zhu', 'Ying', '']]","['bio-inspired computing', 'membrane computing', 'cell-like P system', 'time-free solution', 'independent set problem']"
12873,2106.03353,Md Rafiqul Islam Rabin,"Md Rafiqul Islam Rabin, Vincent J. Hellendoorn, Mohammad Amin Alipour",Understanding Neural Code Intelligence Through Program Simplification,"The 29th ACM Joint European Software Engineering Conference and
  Symposium on the Foundations of Software Engineering (ESEC/FSE'21)",,10.1145/3468264.3468539,,cs.SE cs.LG cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A wide range of code intelligence (CI) tools, powered by deep neural
networks, have been developed recently to improve programming productivity and
perform program analysis. To reliably use such tools, developers often need to
reason about the behavior of the underlying models and the factors that affect
them. This is especially challenging for tools backed by deep neural networks.
Various methods have tried to reduce this opacity in the vein of
""transparent/interpretable-AI"". However, these approaches are often specific to
a particular set of network architectures, even requiring access to the
network's parameters. This makes them difficult to use for the average
programmer, which hinders the reliable adoption of neural CI systems. In this
paper, we propose a simple, model-agnostic approach to identify critical input
features for models in CI systems, by drawing on software debugging research,
specifically delta debugging. Our approach, SIVAND, uses simplification
techniques that reduce the size of input programs of a CI model while
preserving the predictions of the model. We show that this approach yields
remarkably small outputs and is broadly applicable across many model
architectures and problem domains. We find that the models in our experiments
often rely heavily on just a few syntactic features in input programs. We
believe that SIVAND's extracted features may help understand neural CI systems'
predictions and learned behavior.
","[{'version': 'v1', 'created': 'Mon, 7 Jun 2021 05:44:29 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Sep 2021 07:17:19 GMT'}]",2021-09-10,"[['Rabin', 'Md Rafiqul Islam', ''], ['Hellendoorn', 'Vincent J.', ''], ['Alipour', 'Mohammad Amin', '']]","['Models of Code', 'Interpretable AI', 'Program Simplification']"
12874,1909.13848,Raul Lopes,"Raul Lopes, Ignasi Sau","A relaxation of the Directed Disjoint Paths problem: a global congestion
  metric helps","25 pages, 9 figures","Theoretical Computer Science 898, 2022, pages 75-91",10.1016/j.tcs.2021.10.023,,cs.DS cs.CC math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the Directed Disjoint Paths problem, we are given a digraph $D$ and a set
of requests $\{(s_1, t_1), \ldots, (s_k, t_k)\}$, and the task is to find a
collection of pairwise vertex-disjoint paths $\{P_1, \ldots, P_k\}$ such that
each $P_i$ is a path from $s_i$ to $t_i$ in $D$. This problem is NP-complete
for fixed $k=2$ and W[1]-hard with parameter $k$ in DAGs. A few positive
results are known under restrictions on the input digraph, such as being planar
or having bounded directed tree-width, or under relaxations of the problem,
such as allowing for vertex congestion. Positive results are scarce, however,
for general digraphs. In this article we propose a novel global congestion
metric for the problem: we only require the paths to be ""disjoint enough"", in
the sense that they must behave properly not in the whole graph, but in an
unspecified part of size prescribed by a parameter. Namely, in the Disjoint
Enough Directed Paths problem, given an $n$-vertex digraph $D$, a set of $k$
requests, and non-negative integers $d$ and $s$, the task is to find a
collection of paths connecting the requests such that at least $d$ vertices of
$D$ occur in at most $s$ paths of the collection. We study the parameterized
complexity of this problem for a number of choices of the parameter, including
the directed tree-width of $D$. Among other results, we show that the problem
is W[1]-hard in DAGs with parameter $d$ and, on the positive side, we give an
algorithm in time $\mathcal{O}(n^{d+2} \cdot k^{d\cdot s})$ and a kernel of
size $d \cdot 2^{k-s}\cdot \binom{k}{s} + 2k$ in general digraphs. This latter
result has consequences for the Steiner Network problem: we show that it is FPT
parameterized by the number $k$ of terminals and $p$, where $p = n - q$ and $q$
is the size of the solution.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2019 17:12:37 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Dec 2021 17:36:01 GMT'}]",2021-12-21,"[['Lopes', 'Raul', ''], ['Sau', 'Ignasi', '']]","['Parameterized complexity', 'directed disjoint paths', 'congestion', 'dual parameterization', 'kernelization', 'directed tree-width']"
12875,2103.16280,Matti Huotari,"Matti Huotari, Shashank Arora, Avleen Malhi, Kary Fr\""amling","A Dynamic Battery State-of-Health Forecasting Model for Electric Trucks:
  Li-Ion Batteries Case-Study","This paper has first been published at the Proceedings of the ASME
  2020 International Mechanical Engineering Congress and Exposition IMECE2020
  held on November 16-19, 2020, Portland, OR, USA","ASME International Mechanical Engineering Congress and Exposition,
  Proceedings (IMECE) 2020 IMECE2020-23949, V008T08A021",10.1115/IMECE2020-23949,,cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  It is of extreme importance to monitor and manage the battery health to
enhance the performance and decrease the maintenance cost of operating electric
vehicles. This paper concerns the machine-learning-enabled state-of-health
(SoH) prognosis for Li-ion batteries in electric trucks, where they are used as
energy sources. The paper proposes methods to calculate SoH and cycle life for
the battery packs. We propose autoregressive integrated modeling average
(ARIMA) and supervised learning (bagging with decision tree as the base
estimator; BAG) for forecasting the battery SoH in order to maximize the
battery availability for forklift operations. As the use of data-driven methods
for battery prognostics is increasing, we demonstrate the capabilities of ARIMA
and under circumstances when there is little prior information available about
the batteries. For this work, we had a unique data set of 31 lithium-ion
battery packs from forklifts in commercial operations. On the one hand, results
indicate that the developed ARIMA model provided relevant tools to analyze the
data from several batteries. On the other hand, BAG model results suggest that
the developed supervised learning model using decision trees as base estimator
yields better forecast accuracy in the presence of large variation in data for
one battery.
","[{'version': 'v1', 'created': 'Tue, 30 Mar 2021 12:19:21 GMT'}]",2021-03-31,"[['Huotari', 'Matti', ''], ['Arora', 'Shashank', ''], ['Malhi', 'Avleen', ''], ['Främling', 'Kary', '']]","['Electrical vehicles', 'lithium-ion batteries', 'state']"
12876,2010.04351,Thao Nguyen,"Thao N.N. Nguyen, Bharadwaj Veeravalli, Xuanyao Fong","Connection Pruning for Deep Spiking Neural Networks with On-Chip
  Learning","8 pages, 9 figures This paper has been accepted for publication in
  the International Conference on Neuromorphic Systems (ICONS) 2021",International Conference on Neuromorphic Systems 2021,10.1145/3477145.3477157,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Long training time hinders the potential of the deep, large-scale Spiking
Neural Network (SNN) with the on-chip learning capability to be realized on the
embedded systems hardware. Our work proposes a novel connection pruning
approach that can be applied during the on-chip Spike Timing Dependent
Plasticity (STDP)-based learning to optimize the learning time and the network
connectivity of the deep SNN. We applied our approach to a deep SNN with the
Time To First Spike (TTFS) coding and has successfully achieved 2.1x speed-up
and 64% energy savings in the on-chip learning and reduced the network
connectivity by 92.83%, without incurring any accuracy loss. Moreover, the
connectivity reduction results in 2.83x speed-up and 78.24% energy savings in
the inference. Evaluation of our proposed approach on the Field Programmable
Gate Array (FPGA) platform revealed 0.56% power overhead was needed to
implement the pruning algorithm.
","[{'version': 'v1', 'created': 'Fri, 9 Oct 2020 03:44:42 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Oct 2020 12:44:47 GMT'}, {'version': 'v3', 'created': 'Sat, 31 Jul 2021 17:29:01 GMT'}]",2021-08-03,"[['Nguyen', 'Thao N. N.', ''], ['Veeravalli', 'Bharadwaj', ''], ['Fong', 'Xuanyao', '']]","['Connection Pruning', 'Spiking Neural Networks', 'On-Chip Learning', 'Hardware Accelerator']"
12877,1803.10329,Ivan Smirnov,Elizaveta Sivak and Ivan Smirnov,"Gender Bias in Sharenting: Both Men and Women Mention Sons More Often
  Than Daughters on Social Media",,,10.1073/pnas.1804996116,,cs.SI cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Gender inequality starts before birth. Parents tend to prefer boys over
girls, which is manifested in reproductive behavior, marital life, and parents'
pastimes and investments in their children. While social media and sharing
information about children (so-called ""sharenting"") have become an integral
part of parenthood, it is not well-known if and how gender preference shapes
online behavior of users. In this paper, we investigate public mentions of
daughters and sons on social media. We use data from a popular social
networking site on public posts from 635,665 users. We find that both men and
women mention sons more often than daughters in their posts. We also find that
posts featuring sons get more ""likes"" on average. Our results indicate that
girls are underrepresented in parents' digital narratives about their children.
This gender imbalance may send a message that girls are less important than
boys, or that they deserve less attention, thus reinforcing gender inequality.
","[{'version': 'v1', 'created': 'Tue, 27 Mar 2018 21:02:25 GMT'}]",2019-12-03,"[['Sivak', 'Elizaveta', ''], ['Smirnov', 'Ivan', '']]","['gender inequality', 'son preference', 'parenthood', 'sharenting', 'social media']"
12878,1909.03730,Simon Duque Anton,"Simon D. Duque Anton, Anna Pia Lohfink, Christoph Garth, and Hans
  Dieter Schotten",Security in Process: Detecting Attacks in Industrial Process Data,,,10.1145/3360664.3360669,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the fourth industrial revolution, industrial applications make use of
the progress in communication and embedded devices. This allows industrial
users to increase efficiency and manageability while reducing cost and effort.
Furthermore, the fourth industrial revolution, creating the so-called Industry
4.0, opens a variety of novel use and business cases in the industrial
environment. However, this progress comes at the cost of an enlarged attack
surface of industrial companies. Operational networks that have previously been
phyiscally separated from public networks are now connected in order to make
use of new communication capabilites. This motivates the need for industrial
intrusion detection solutions that are compatible to the long-term operation
machines in industry as well as the heterogeneous and fast-changing networks.
In this work, process data is analysed. The data is created and monitored on
real-world hardware. After a set up phase, attacks are introduced into the
systems that influence the process behaviour. A time series-based anomaly
detection approach, the Matrix Profiles, are adapted to the specific needs and
applied to the intrusion detection. The results indicate an applicability of
these methods to detect attacks in the process behaviour. Furthermore, they are
easily integrated into existing process environments. Additionally, one-class
classifiers One-Class Support Vector Machines and Isolation Forest are applied
to the data without a notion of timing. While Matrix Profiles perform well in
terms of creating and visualising results, the one-class classifiers perform
poorly.
","[{'version': 'v1', 'created': 'Mon, 9 Sep 2019 09:53:06 GMT'}]",2019-09-10,"[['Anton', 'Simon D. Duque', ''], ['Lohfink', 'Anna Pia', ''], ['Garth', 'Christoph', ''], ['Schotten', 'Hans Dieter', '']]","['Anomaly Detection', 'Intrusion Detection', 'Industrial Networks', 'Machine Learning', 'Time Series']"
12879,2009.05687,Ayu Purwarianti,"Devin Hoesen (1), Ayu Purwarianti (2) ((1) Prosa.ai, (2) Institut
  Teknologi Bandung)","Investigating Bi-LSTM and CRF with POS Tag Embedding for Indonesian
  Named Entity Tagger",,2018 International Conference on Asian Language Processing (IALP),10.1109/IALP.2018.8629158,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Researches on Indonesian named entity (NE) tagger have been conducted since
years ago. However, most did not use deep learning and instead employed
traditional machine learning algorithms such as association rule, support
vector machine, random forest, na\""ive bayes, etc. In those researches, word
lists as gazetteers or clue words were provided to enhance the accuracy. Here,
we attempt to employ deep learning in our Indonesian NE tagger. We use long
short-term memory (LSTM) as the topology since it is the state-of-the-art of NE
tagger. By using LSTM, we do not need a word list in order to enhance the
accuracy. Basically, there are two main things that we investigate. The first
is the output layer of the network: Softmax vs conditional random field (CRF).
The second is the usage of part of speech (POS) tag embedding input layer.
Using 8400 sentences as the training data and 97 sentences as the evaluation
data, we find that using POS tag embedding as additional input improves the
performance of our Indonesian NE tagger. As for the comparison between Softmax
and CRF, we find that both architectures have a weakness in classifying an NE
tag.
","[{'version': 'v1', 'created': 'Fri, 11 Sep 2020 23:54:31 GMT'}]",2020-09-15,"[['Hoesen', 'Devin', ''], ['Purwarianti', 'Ayu', '']]","['Indonesian NE Tagger', 'Bi-LSTM', 'CRF', 'POS Tag', 'Softmax']"
12880,1912.12693,Federico Errica,"Davide Bacciu, Federico Errica, Alessio Micheli, Marco Podda",A Gentle Introduction to Deep Learning for Graphs,,,10.1016/j.neunet.2020.06.006,,cs.LG cs.SI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The adaptive processing of graph data is a long-standing research topic which
has been lately consolidated as a theme of major interest in the deep learning
community. The snap increase in the amount and breadth of related research has
come at the price of little systematization of knowledge and attention to
earlier literature. This work is designed as a tutorial introduction to the
field of deep learning for graphs. It favours a consistent and progressive
introduction of the main concepts and architectural aspects over an exposition
of the most recent literature, for which the reader is referred to available
surveys. The paper takes a top-down view to the problem, introducing a
generalized formulation of graph representation learning based on a local and
iterative approach to structured information processing. It introduces the
basic building blocks that can be combined to design novel and effective neural
models for graphs. The methodological exposition is complemented by a
discussion of interesting research challenges and applications in the field.
","[{'version': 'v1', 'created': 'Sun, 29 Dec 2019 16:43:39 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Jun 2020 07:29:38 GMT'}]",2020-06-16,"[['Bacciu', 'Davide', ''], ['Errica', 'Federico', ''], ['Micheli', 'Alessio', ''], ['Podda', 'Marco', '']]","['deep learning for graphs', 'graph neural networks', 'learning for']"
12881,1507.01292,Andres Monroy-Hernandez,Andr\'es Monroy-Hern\'andez,ScratchR: Sharing User-generated Programmable Media,"In Proceedings of the 6th international conference on Interaction
  Design and Children (IDC 2007). ACM, New York, NY, USA, 167-168",,10.1145/1297277.1297315,,cs.HC cs.CY cs.SI,http://creativecommons.org/licenses/by/4.0/,"  In this paper, I describe a platform for sharing programmable media on the
web called ScratchR. As the backbone of an on-line community of creative
learners, ScratchR will give members access to an audience and inspirational
ideas from each other. ScratchR seeks to support different states of
participation: from passive consumption to active creation. This platform is
being evaluated with a group of middle-school students and a larger community
of beta testers.
","[{'version': 'v1', 'created': 'Sun, 5 Jul 2015 22:56:01 GMT'}]",2015-07-07,"[['Monroy-Hernández', 'Andrés', '']]","['Programmable media', 'user-generated content', 'social networks', 'creativity', 'on-line communities', 'programming languages']"
12882,2008.02783,Nicholas Kluge Corr\^ea,Nicholas Kluge Corr\^ea and Nythamar De Oliveira,"Modelos din\^amicos aplicados \`a aprendizagem de valores em
  intelig\^encia artificial",in Portuguese,Veritas 65(2):1-15 (2020),10.15448/1984-6746.2020.2.37439,,cs.CY cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Experts in Artificial Intelligence (AI) development predict that advances in
the development of intelligent systems and agents will reshape vital areas in
our society. Nevertheless, if such an advance is not made prudently and
critically, reflexively, it can result in negative outcomes for humanity. For
this reason, several researchers in the area have developed a robust,
beneficial, and safe concept of AI for the preservation of humanity and the
environment. Currently, several of the open problems in the field of AI
research arise from the difficulty of avoiding unwanted behaviors of
intelligent agents and systems, and at the same time specifying what we really
want such systems to do, especially when we look for the possibility of
intelligent agents acting in several domains over the long term. It is of
utmost importance that artificial intelligent agents have their values aligned
with human values, given the fact that we cannot expect an AI to develop human
moral values simply because of its intelligence, as discussed in the
Orthogonality Thesis. Perhaps this difficulty comes from the way we are
addressing the problem of expressing objectives, values, and ends, using
representational cognitive methods. A solution to this problem would be the
dynamic approach proposed by Dreyfus, whose phenomenological philosophy shows
that the human experience of being-in-the-world in several aspects is not well
represented by the symbolic or connectionist cognitive method, especially in
regards to the question of learning values. A possible approach to this problem
would be to use theoretical models such as SED (situated embodied dynamics) to
address the values learning problem in AI.
","[{'version': 'v1', 'created': 'Thu, 30 Jul 2020 00:56:11 GMT'}]",2020-08-07,"[['Corrêa', 'Nicholas Kluge', ''], ['De Oliveira', 'Nythamar', '']]","['Artificial Intelligence', 'Learning values', 'Cognitive science', 'Dynamical systems']"
12883,2207.05334,Hao Liu,"Hao Liu, Bin Chen, Bo Wang, Chunpeng Wu, Feng Dai, Peng Wu","Cycle Self-Training for Semi-Supervised Object Detection with
  Distribution Consistency Reweighting",ACM Multimedia 2022,,10.1145/3503161.3548040,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, many semi-supervised object detection (SSOD) methods adopt
teacher-student framework and have achieved state-of-the-art results. However,
the teacher network is tightly coupled with the student network since the
teacher is an exponential moving average (EMA) of the student, which causes a
performance bottleneck. To address the coupling problem, we propose a Cycle
Self-Training (CST) framework for SSOD, which consists of two teachers T1 and
T2, two students S1 and S2. Based on these networks, a cycle self-training
mechanism is built, i.e.,
S1${\rightarrow}$T1${\rightarrow}$S2${\rightarrow}$T2${\rightarrow}$S1. For
S${\rightarrow}$T, we also utilize the EMA weights of the students to update
the teachers. For T${\rightarrow}$S, instead of providing supervision for its
own student S1(S2) directly, the teacher T1(T2) generates pseudo-labels for the
student S2(S1), which looses the coupling effect. Moreover, owing to the
property of EMA, the teacher is most likely to accumulate the biases from the
student and make the mistakes irreversible. To mitigate the problem, we also
propose a distribution consistency reweighting strategy, where pseudo-labels
are reweighted based on distribution consistency across the teachers T1 and T2.
With the strategy, the two students S2 and S1 can be trained robustly with
noisy pseudo labels to avoid confirmation biases. Extensive experiments prove
the superiority of CST by consistently improving the AP over the baseline and
outperforming state-of-the-art methods by 2.1% absolute AP improvements with
scarce labeled data.
","[{'version': 'v1', 'created': 'Tue, 12 Jul 2022 06:16:48 GMT'}]",2022-07-13,"[['Liu', 'Hao', ''], ['Chen', 'Bin', ''], ['Wang', 'Bo', ''], ['Wu', 'Chunpeng', ''], ['Dai', 'Feng', ''], ['Wu', 'Peng', '']]","['object detection', 'semi-supervised learning', 'cycle self-training framework', 'distribution consistency reweighting']"
12884,2301.07999,Edoardo Lamon PhD,"Elena Merlo (1,2), Edoardo Lamon (1), Fabio Fusaro (1,3), Marta
  Lorenzini (1), Alessandro Carf\`i (2), Fulvio Mastrogiovanni (2), Arash
  Ajoudani (1) ((1) Human-Robot Interfaces and Interaction, Istituto Italiano
  di Tecnologia, Genoa, Italy, (2) Dept. of Informatics, Bioengineering,
  Robotics, and Systems Engineering, University of Genoa, Genoa, Italy, (3)
  Dept. of Electronics, Information and Bioengineering, Politecnico di Milano,
  Milan, Italy)","An Ergonomic Role Allocation Framework for Dynamic Human-Robot
  Collaborative Tasks","14 pages, 22 figures, accepted to the special issue on Human-centric
  Smart Manufacturing: Trends, Issues and Challenges of the Journal of
  Manufacturing Systems",,10.1016/j.jmsy.2022.12.011,,cs.RO cs.HC cs.MA,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  By incorporating ergonomics principles into the task allocation processes,
human-robot collaboration (HRC) frameworks can favour the prevention of
work-related musculoskeletal disorders (WMSDs). In this context, existing
offline methodologies do not account for the variability of human actions and
states; therefore, planning and dynamically assigning roles in human-robot
teams remains an unaddressed challenge.This study aims to create an ergonomic
role allocation framework that optimises the HRC, taking into account task
features and human state measurements. The presented framework consists of two
main modules: the first provides the HRC task model, exploiting AND/OR Graphs
(AOG)s, which we adapted to solve the allocation problem; the second module
describes the ergonomic risk assessment during task execution through a risk
indicator and updates the AOG-related variables to influence future task
allocation. The proposed framework can be combined with any time-varying
ergonomic risk indicator that evaluates human cognitive and physical burden. In
this work, we tested our framework in an assembly scenario, introducing a risk
index named Kinematic Wear.The overall framework has been tested with a
multi-subject experiment. The task allocation results and subjective
evaluations, measured with questionnaires, show that high-risk actions are
correctly recognised and not assigned to humans, reducing fatigue and
frustration in collaborative tasks.
","[{'version': 'v1', 'created': 'Thu, 19 Jan 2023 10:59:06 GMT'}]",2023-01-20,"[['Merlo', 'Elena', ''], ['Lamon', 'Edoardo', ''], ['Fusaro', 'Fabio', ''], ['Lorenzini', 'Marta', ''], ['Carfì', 'Alessandro', ''], ['Mastrogiovanni', 'Fulvio', ''], ['Ajoudani', 'Arash', '']]","['Human-Robot TeamingErgonomicsIntelligent', 'Flexible ManufacturingHuman Factors', 'Human-in-the-Loop']"
12885,2004.03727,Sona Ghahremani,"Lucas Sakizloglou, Sona Ghahremani, Thomas Brand, Matthias Barkowsky,
  and Holger Giese",Towards Highly Scalable Runtime Models with History,"8 pages, 4 figures, 15th International Symposium on Software
  Engineering for Adaptive and Self-Managing Systems (SEAMS2020)",,10.1145/3387939.3388614,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advanced systems such as IoT comprise many heterogeneous, interconnected, and
autonomous entities operating in often highly dynamic environments. Due to
their large scale and complexity, large volumes of monitoring data are
generated and need to be stored, retrieved, and mined in a time- and
resource-efficient manner. Architectural self-adaptation automates the control,
orchestration, and operation of such systems. This can only be achieved via
sophisticated decision-making schemes supported by monitoring data that fully
captures the system behavior and its history.
  Employing model-driven engineering techniques we propose a highly scalable,
history-aware approach to store and retrieve monitoring data in form of
enriched runtime models. We take advantage of rule-based adaptation where
change events in the system trigger adaptation rules. We first present a scheme
to incrementally check model queries in the form of temporal logic formulas
which represent the conditions of adaptation rules against a runtime model with
history. Then we enhance the model to retain only information that is
temporally relevant to the queries, therefore reducing the accumulation of
information to a required minimum. Finally, we demonstrate the feasibility and
scalability of our approach via experiments on a simulated smart healthcare
system employing a real-world medical guideline.
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2020 22:01:26 GMT'}]",2020-04-09,"[['Sakizloglou', 'Lucas', ''], ['Ghahremani', 'Sona', ''], ['Brand', 'Thomas', ''], ['Barkowsky', 'Matthias', ''], ['Giese', 'Holger', '']]","['runtime models', 'architectural self-adaptation', 'IoT', 'temporal graphconditions', 'memory efficiency', 'history-awareness', 'scalability']"
12886,2106.09866,Eugene Yang,Eugene Yang and David D. Lewis and Ophir Frieder,On Minimizing Cost in Legal Document Review Workflows,"10 pages, 3 figures. Accepted at DocEng 21",,10.1145/3469096.3469872,,cs.IR cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Technology-assisted review (TAR) refers to human-in-the-loop machine learning
workflows for document review in legal discovery and other high recall review
tasks. Attorneys and legal technologists have debated whether review should be
a single iterative process (one-phase TAR workflows) or whether model training
and review should be separate (two-phase TAR workflows), with implications for
the choice of active learning algorithm. The relative cost of manual labeling
for different purposes (training vs. review) and of different documents
(positive vs. negative examples) is a key and neglected factor in this debate.
Using a novel cost dynamics analysis, we show analytically and empirically that
these relative costs strongly impact whether a one-phase or two-phase workflow
minimizes cost. We also show how category prevalence, classification task
difficulty, and collection size impact the optimal choice not only of workflow
type, but of active learning method and stopping point.
","[{'version': 'v1', 'created': 'Fri, 18 Jun 2021 01:51:47 GMT'}]",2021-06-21,"[['Yang', 'Eugene', ''], ['Lewis', 'David D.', ''], ['Frieder', 'Ophir', '']]","['cost modeling', 'active learning', 'total recall', 'high-recall retrieval']"
12887,2109.02382,Francesco Greco,"Giuseppe Desolda, Francesco Greco, Francisco Guarnieri, Nicole Mariz,
  Massimo Zancanaro","SENSATION: An Authoring Tool to Support Event-State Paradigm in End-User
  Development","11 pages, 2 figures, 1 table, published in proceedings of the 18th
  International Conference promoted by the IFIP Technical Committee 13 on Human
  Computer Interaction, INTERACT 2021. August 30th September 3rd, 2021, Bari,
  Italy","INTERACT 2021. Lecture Notes in Computer Science, vol 12933. pp
  373-382 Springer, Cham",10.1007/978-3-030-85616-8_22,,cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this paper, we present the design and the evaluation of an authoring tool
for End-User Development, which supports the definition of Trigger-Actions
rules that combines events and states in the triggers. The possibility of using
either states or events in triggers has already been discussed in the
literature. However, it is recognized that the state/event distinction is
difficult to manage for users. In this paper, we propose an authoring tool that
provides explicit support for managing this distinction. We compare it with a
state-of-the-art authoring tool that implements the classical event-event
paradigm.
","[{'version': 'v1', 'created': 'Mon, 6 Sep 2021 11:58:40 GMT'}]",2021-09-07,"[['Desolda', 'Giuseppe', ''], ['Greco', 'Francesco', ''], ['Guarnieri', 'Francisco', ''], ['Mariz', 'Nicole', ''], ['Zancanaro', 'Massimo', '']]","['End-User Development', 'Internet of Things', 'Trigger Action Programming']"
12888,1709.01788,Ekta Vats,Anders Hast and Ekta Vats,"Radial Line Fourier Descriptor for Historical Handwritten Text
  Representation",under review,,10.24132/JWSCG.2018.26.1.4,,cs.CV cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic recognition of historical handwritten manuscripts is a daunting
task due to paper degradation over time. Recognition-free retrieval or word
spotting is popularly used for information retrieval and digitization of the
historical handwritten documents. However, the performance of word spotting
algorithms depends heavily on feature detection and representation methods.
Although there exist popular feature descriptors such as Scale Invariant
Feature Transform (SIFT) and Speeded Up Robust Features (SURF), the invariant
properties of these descriptors amplify the noise in the degraded document
images, rendering them more sensitive to noise and complex characteristics of
historical manuscripts. Therefore, an efficient and relaxed feature descriptor
is required as handwritten words across different documents are indeed similar,
but not identical. This paper introduces a Radial Line Fourier (RLF) descriptor
for handwritten word representation, with a short feature vector of 32
dimensions. A segmentation-free and training-free handwritten word spotting
method is studied herein that relies on the proposed RLF descriptor, takes into
account different keypoint representations and uses a simple
preconditioner-based feature matching algorithm. The effectiveness of the RLF
descriptor for segmentation-free handwritten word spotting is empirically
evaluated on well-known historical handwritten datasets using standard
evaluation measures.
","[{'version': 'v1', 'created': 'Wed, 6 Sep 2017 11:56:34 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Oct 2017 11:39:39 GMT'}, {'version': 'v3', 'created': 'Mon, 20 Nov 2017 14:30:47 GMT'}, {'version': 'v4', 'created': 'Tue, 20 Mar 2018 15:23:08 GMT'}]",2018-08-15,"[['Hast', 'Anders', ''], ['Vats', 'Ekta', '']]","['Radial Line Fourier descriptor', 'word spotting', 'feature matching']"
12889,2004.05740,Anirban Bhattacharjee,"Anirban Bhattacharjee, Ajay Dev Chhokra, Hongyang Sun, Shashank
  Shekhar, Aniruddha Gokhale, Gabor Karsai, Abhishek Dubey","Deep-Edge: An Efficient Framework for Deep Learning Model Update on
  Heterogeneous Edge",,"2020 IEEE 4th International Conference on Fog and Edge Computing
  (ICFEC)",10.1109/ICFEC50348.2020.00016,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep Learning (DL) model-based AI services are increasingly offered in a
variety of predictive analytics services such as computer vision, natural
language processing, speech recognition. However, the quality of the DL models
can degrade over time due to changes in the input data distribution, thereby
requiring periodic model updates. Although cloud data-centers can meet the
computational requirements of the resource-intensive and time-consuming model
update task, transferring data from the edge devices to the cloud incurs a
significant cost in terms of network bandwidth and are prone to data privacy
issues. With the advent of GPU-enabled edge devices, the DL model update can be
performed at the edge in a distributed manner using multiple connected edge
devices. However, efficiently utilizing the edge resources for the model update
is a hard problem due to the heterogeneity among the edge devices and the
resource interference caused by the co-location of the DL model update task
with latency-critical tasks running in the background. To overcome these
challenges, we present Deep-Edge, a load- and interference-aware,
fault-tolerant resource management framework for performing model update at the
edge that uses distributed training. This paper makes the following
contributions. First, it provides a unified framework for monitoring,
profiling, and deploying the DL model update tasks on heterogeneous edge
devices. Second, it presents a scheduler that reduces the total re-training
time by appropriately selecting the edge devices and distributing data among
them such that no latency-critical applications experience deadline violations.
Finally, we present empirical results to validate the efficacy of the framework
using a real-world DL model update case-study based on the Caltech dataset and
an edge AI cluster testbed.
","[{'version': 'v1', 'created': 'Mon, 13 Apr 2020 01:46:29 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Nov 2020 03:35:35 GMT'}]",2020-11-04,"[['Bhattacharjee', 'Anirban', ''], ['Chhokra', 'Ajay Dev', ''], ['Sun', 'Hongyang', ''], ['Shekhar', 'Shashank', ''], ['Gokhale', 'Aniruddha', ''], ['Karsai', 'Gabor', ''], ['Dubey', 'Abhishek', '']]","['Resource Management', 'Deep Learning', 'Edge Computing', 'PerformanceOptimization', 'Interference-aware', 'Distributed Training']"
12890,2001.01473,Kazuaki Matsumura,"Kazuaki Matsumura, Hamid Reza Zohouri, Mohamed Wahib, Toshio Endo,
  Satoshi Matsuoka","AN5D: Automated Stencil Framework for High-Degree Temporal Blocking on
  GPUs",,,10.1145/3368826.3377904,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stencil computation is one of the most widely-used compute patterns in high
performance computing applications. Spatial and temporal blocking have been
proposed to overcome the memory-bound nature of this type of computation by
moving memory pressure from external memory to on-chip memory on GPUs. However,
correctly implementing those optimizations while considering the complexity of
the architecture and memory hierarchy of GPUs to achieve high performance is
difficult. We propose AN5D, an automated stencil framework which is capable of
automatically transforming and optimizing stencil patterns in a given C source
code, and generating corresponding CUDA code. Parameter tuning in our framework
is guided by our performance model. Our novel optimization strategy reduces
shared memory and register pressure in comparison to existing implementations,
allowing performance scaling up to a temporal blocking degree of 10. We achieve
the highest performance reported so far for all evaluated stencil benchmarks on
the state-of-the-art Tesla V100 GPU.
","[{'version': 'v1', 'created': 'Mon, 6 Jan 2020 10:35:46 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Jan 2020 02:27:14 GMT'}, {'version': 'v3', 'created': 'Wed, 8 Jan 2020 12:44:54 GMT'}, {'version': 'v4', 'created': 'Mon, 3 Feb 2020 16:22:52 GMT'}]",2020-02-04,"[['Matsumura', 'Kazuaki', ''], ['Zohouri', 'Hamid Reza', ''], ['Wahib', 'Mohamed', ''], ['Endo', 'Toshio', ''], ['Matsuoka', 'Satoshi', '']]","['Stencil Computation', 'GPU', 'Automatic CodeGeneration', 'Temporal Blocking']"
12891,2103.15438,Yufan Liu,"Yufan Liu, Minglang Qiao, Mai Xu, Bing Li, Weiming Hu, Ali Borji",Learning to Predict Salient Faces: A Novel Visual-Audio Saliency Model,Published as an ECCV2020 paper,,10.1007/978-3-030-58565-5_25,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, video streams have occupied a large proportion of Internet traffic,
most of which contain human faces. Hence, it is necessary to predict saliency
on multiple-face videos, which can provide attention cues for many content
based applications. However, most of multiple-face saliency prediction works
only consider visual information and ignore audio, which is not consistent with
the naturalistic scenarios. Several behavioral studies have established that
sound influences human attention, especially during the speech turn-taking in
multiple-face videos. In this paper, we thoroughly investigate such influences
by establishing a large-scale eye-tracking database of Multiple-face Video in
Visual-Audio condition (MVVA). Inspired by the findings of our investigation,
we propose a novel multi-modal video saliency model consisting of three
branches: visual, audio and face. The visual branch takes the RGB frames as the
input and encodes them into visual feature maps. The audio and face branches
encode the audio signal and multiple cropped faces, respectively. A fusion
module is introduced to integrate the information from three modalities, and to
generate the final saliency map. Experimental results show that the proposed
method outperforms 11 state-of-the-art saliency prediction works. It performs
closer to human multi-modal attention.
","[{'version': 'v1', 'created': 'Mon, 29 Mar 2021 09:09:39 GMT'}]",2021-03-30,"[['Liu', 'Yufan', ''], ['Qiao', 'Minglang', ''], ['Xu', 'Mai', ''], ['Li', 'Bing', ''], ['Hu', 'Weiming', ''], ['Borji', 'Ali', '']]","['Visual-audio', 'Saliency prediction', 'Multiple-face video']"
12892,2301.04780,Michael Ekstrand,"Christine Pinney, Amifa Raj, Alex Hanna, and Michael D. Ekstrand","Much Ado About Gender: Current Practices and Future Recommendations for
  Appropriate Gender-Aware Information Access",Published in CHIIR 2023,,10.1145/3576840.3578316,,cs.IR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information access research (and development) sometimes makes use of gender,
whether to report on the demographics of participants in a user study, as
inputs to personalized results or recommendations, or to make systems
gender-fair, amongst other purposes. This work makes a variety of assumptions
about gender, however, that are not necessarily aligned with current
understandings of what gender is, how it should be encoded, and how a gender
variable should be ethically used. In this work, we present a systematic review
of papers on information retrieval and recommender systems that mention gender
in order to document how gender is currently being used in this field. We find
that most papers mentioning gender do not use an explicit gender variable, but
most of those that do either focus on contextualizing results of model
performance, personalizing a system based on assumptions of user gender, or
auditing a model's behavior for fairness or other privacy-related issues.
Moreover, most of the papers we review rely on a binary notion of gender, even
if they acknowledge that gender cannot be split into two categories. We connect
these findings with scholarship on gender theory and recent work on gender in
human-computer interaction and natural language processing. We conclude by
making recommendations for ethical and well-grounded use of gender in building
and researching information access systems.
","[{'version': 'v1', 'created': 'Thu, 12 Jan 2023 01:21:02 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Jan 2023 23:06:53 GMT'}]",2023-01-18,"[['Pinney', 'Christine', ''], ['Raj', 'Amifa', ''], ['Hanna', 'Alex', ''], ['Ekstrand', 'Michael D.', '']]","['information access', 'gender', 'auditing', 'systematic review']"
12893,2207.07284,Zhicai Wang,"Zhicai Wang, Yanbin Hao, Xingyu Gao, Hao Zhang, Shuo Wang, Tingting
  Mu, Xiangnan He","Parameterization of Cross-Token Relations with Relative Positional
  Encoding for Vision MLP",,,10.1145/3503161.3547953,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vision multi-layer perceptrons (MLPs) have shown promising performance in
computer vision tasks, and become the main competitor of CNNs and vision
Transformers. They use token-mixing layers to capture cross-token interactions,
as opposed to the multi-head self-attention mechanism used by Transformers.
However, the heavily parameterized token-mixing layers naturally lack
mechanisms to capture local information and multi-granular non-local relations,
thus their discriminative power is restrained. To tackle this issue, we propose
a new positional spacial gating unit (PoSGU). It exploits the attention
formulations used in the classical relative positional encoding (RPE), to
efficiently encode the cross-token relations for token mixing. It can
successfully reduce the current quadratic parameter complexity $O(N^2)$ of
vision MLPs to $O(N)$ and $O(1)$. We experiment with two RPE mechanisms, and
further propose a group-wise extension to improve their expressive power with
the accomplishment of multi-granular contexts. These then serve as the key
building blocks of a new type of vision MLP, referred to as PosMLP. We evaluate
the effectiveness of the proposed approach by conducting thorough experiments,
demonstrating an improved or comparable performance with reduced parameter
complexity. For instance, for a model trained on ImageNet1K, we achieve a
performance improvement from 72.14\% to 74.02\% and a learnable parameter
reduction from $19.4M$ to $18.2M$. Code could be found at
https://github.com/Zhicaiwww/PosMLP.
","[{'version': 'v1', 'created': 'Fri, 15 Jul 2022 04:18:06 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Sep 2022 07:14:57 GMT'}]",2022-09-13,"[['Wang', 'Zhicai', ''], ['Hao', 'Yanbin', ''], ['Gao', 'Xingyu', ''], ['Zhang', 'Hao', ''], ['Wang', 'Shuo', ''], ['Mu', 'Tingting', ''], ['He', 'Xiangnan', '']]","['Computer Vision', 'Positional Encoding', 'Image Classification']"
12894,2111.02604,Ashish Pawar,"Tanuja Patanshetti, Ashish Anil Pawar, Disha Patel, Sanket Thakare",Auto Tuning of Hadoop and Spark parameters,"12 Pages, 9 Figures, 12 Tables, Published with International Journal
  of Engineering Trends and Technology (IJETT)","International Journal of Engineering Trends and Technology
  69.11(2021):22-33",10.14445/22315381/IJETT-V69I11P204,,cs.DC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Data of the order of terabytes, petabytes, or beyond is known as Big Data.
This data cannot be processed using the traditional database software, and
hence there comes the need for Big Data Platforms. By combining the
capabilities and features of various big data applications and utilities, Big
Data Platforms form a single solution. It is a platform that helps to develop,
deploy and manage the big data environment. Hadoop and Spark are the two
open-source Big Data Platforms provided by Apache. Both these platforms have
many configurational parameters, which can have unforeseen effects on the
execution time, accuracy, etc. Manual tuning of these parameters can be
tiresome, and hence automatic ways should be needed to tune them. After
studying and analyzing various previous works in automating the tuning of these
parameters, this paper proposes two algorithms - Grid Search with Finer Tuning
and Controlled Random Search. The performance indicator studied in this paper
is Execution Time. These algorithms help to tune the parameters automatically.
Experimental results have shown a reduction in execution time of about 70% and
50% for Hadoop and 81.19% and 77.77% for Spark by Grid Search with Finer Tuning
and Controlled Random Search, respectively.
","[{'version': 'v1', 'created': 'Thu, 4 Nov 2021 03:22:17 GMT'}]",2021-11-05,"[['Patanshetti', 'Tanuja', ''], ['Pawar', 'Ashish Anil', ''], ['Patel', 'Disha', ''], ['Thakare', 'Sanket', '']]","['Big Data Platform', 'Auto tuning', 'Parameters', 'Hadoop', 'Spark', 'Execution Time']"
12895,2106.04907,Mikhail Fomichev,"Mikhail Fomichev, Julia Hesse, Lars Almon, Timm Lippert, Jun Han,
  Matthias Hollick",FastZIP: Faster and More Secure Zero-Interaction Pairing,"ACM MobiSys '21; Fixed ambiguity in flow diagram (Figure 2). Code and
  data are available at: https://github.com/seemoo-lab/fastzip",,10.1145/3458864.3467883,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the advent of the Internet of Things (IoT), establishing a secure
channel between smart devices becomes crucial. Recent research proposes
zero-interaction pairing (ZIP), which enables pairing without user assistance
by utilizing devices' physical context (e.g., ambient audio) to obtain a shared
secret key. The state-of-the-art ZIP schemes suffer from three limitations: (1)
prolonged pairing time (i.e., minutes or hours), (2) vulnerability to
brute-force offline attacks on a shared key, and (3) susceptibility to attacks
caused by predictable context (e.g., replay attack) because they rely on
limited entropy of physical context to protect a shared key. We address these
limitations, proposing FastZIP, a novel ZIP scheme that significantly reduces
pairing time while preventing offline and predictable context attacks. In
particular, we adapt a recently introduced Fuzzy Password-Authenticated Key
Exchange (fPAKE) protocol and utilize sensor fusion, maximizing their
advantages. We instantiate FastZIP for intra-car device pairing to demonstrate
its feasibility and show how the design of FastZIP can be adapted to other ZIP
use cases. We implement FastZIP and evaluate it by driving four cars for a
total of 800 km. We achieve up to three times shorter pairing time compared to
the state-of-the-art ZIP schemes while assuring robust security with
adversarial error rates below 0.5%.
","[{'version': 'v1', 'created': 'Wed, 9 Jun 2021 08:44:46 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Feb 2022 11:27:08 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Feb 2022 09:58:44 GMT'}]",2022-02-24,"[['Fomichev', 'Mikhail', ''], ['Hesse', 'Julia', ''], ['Almon', 'Lars', ''], ['Lippert', 'Timm', ''], ['Han', 'Jun', ''], ['Hollick', 'Matthias', '']]","['Pairing', 'Zero-interaction', 'Internet of Things', 'fPAKE', 'Sensor fusion']"
12896,cs/0508057,Miguel Rodrigues PhD,"M. R. D. Rodrigues, I. Chatzigeorgiou, I. J. Wassell and R. Carrasco",On the Performance of Turbo Codes in Quasi-Static Fading Channels,"To appear in the Proceedings of the 2005 IEEE International Symposium
  on Information Theory, Adelaide, Australia, September 4-9, 2005",,10.1109/ISIT.2005.1523410,,cs.IT math.IT,,"  In this paper, we investigate in detail the performance of turbo codes in
quasi-static fading channels both with and without antenna diversity. First, we
develop a simple and accurate analytic technique to evaluate the performance of
turbo codes in quasi-static fading channels. The proposed analytic technique
relates the frame error rate of a turbo code to the iterative decoder
convergence threshold, rather than to the turbo code distance spectrum.
Subsequently, we compare the performance of various turbo codes in quasi-static
fading channels. We show that, in contrast to the situation in the AWGN
channel, turbo codes with different interleaver sizes or turbo codes based on
RSC codes with different constraint lengths and generator polynomials exhibit
identical performance. Moreover, we also compare the performance of turbo codes
and convolutional codes in quasi-static fading channels under the condition of
identical decoding complexity. In particular, we show that turbo codes do not
outperform convolutional codes in quasi-static fading channels with no antenna
diversity; and that turbo codes only outperform convolutional codes in
quasi-static fading channels with antenna diversity.
","[{'version': 'v1', 'created': 'Thu, 11 Aug 2005 10:14:52 GMT'}]",2016-11-17,"[['Rodrigues', 'M. R. D.', ''], ['Chatzigeorgiou', 'I.', ''], ['Wassell', 'I. J.', ''], ['Carrasco', 'R.', '']]","['Performance', 'Turbo Codes', 'Convolutional Codes', 'Quasistatic Fading Channels', 'Antenna Diversity']"
12897,2005.14716,Kevin Tang,"Kevin Tang, Jason A. Shaw",Prosody leaks into the memories of words,"41 pages, 1 figure",Cognition 210. 104601 (2021),10.1016/j.cognition.2021.104601,,cs.CL cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The average predictability (aka informativity) of a word in context has been
shown to condition word duration (Seyfarth, 2014). All else being equal, words
that tend to occur in more predictable environments are shorter than words that
tend to occur in less predictable environments. One account of the
informativity effect on duration is that the acoustic details of probabilistic
reduction are stored as part of a word's mental representation. Other research
has argued that predictability effects are tied to prosodic structure in
integral ways. With the aim of assessing a potential prosodic basis for
informativity effects in speech production, this study extends past work in two
directions; it investigated informativity effects in another large language,
Mandarin Chinese, and broadened the study beyond word duration to additional
acoustic dimensions, pitch and intensity, known to index prosodic prominence.
The acoustic information of content words was extracted from a large telephone
conversation speech corpus with over 400,000 tokens and 6,000 word types spoken
by 1,655 individuals and analyzed for the effect of informativity using
frequency statistics estimated from a 431 million word subtitle corpus. Results
indicated that words with low informativity have shorter durations, replicating
the effect found in English. In addition, informativity had significant effects
on maximum pitch and intensity, two phonetic dimensions related to prosodic
prominence. Extending this interpretation, these results suggest that
predictability is closely linked to prosodic prominence, and that the lexical
representation of a word includes phonetic details associated with its average
prosodic prominence in discourse. In other words, the lexicon absorbs prosodic
influences on speech production.
","[{'version': 'v1', 'created': 'Fri, 29 May 2020 17:58:33 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Dec 2020 16:09:11 GMT'}]",2021-01-26,"[['Tang', 'Kevin', ''], ['Shaw', 'Jason A.', '']]","['probabilistic reduction', 'prosodic prominence', 'lexical representation', 'speech production', 'predictability', 'informativity']"
12898,2201.05962,Qi An,"Qi An, Patryk Szewczyk, Michael N Johnstone, James Jin Kang","Enhancement of Healthcare Data Performance Metrics using Neural Network
  Machine Learning Algorithms","8 pages, 18 fingures",,10.1109/ITNAC53136.2021.9652158,,cs.LG cs.AI cs.CY,http://creativecommons.org/licenses/by-sa/4.0/,"  Patients are often encouraged to make use of wearable devices for remote
collection and monitoring of health data. This adoption of wearables results in
a significant increase in the volume of data collected and transmitted. The
battery life of the devices is then quickly diminished due to the high
processing requirements of the devices. Given the importance attached to
medical data, it is imperative that all transmitted data adhere to strict
integrity and availability requirements. Reducing the volume of healthcare data
for network transmission may improve sensor battery life without compromising
accuracy. There is a trade-off between efficiency and accuracy which can be
controlled by adjusting the sampling and transmission rates. This paper
demonstrates that machine learning can be used to analyse complex health data
metrics such as the accuracy and efficiency of data transmission to overcome
the trade-off problem. The study uses time series nonlinear autoregressive
neural network algorithms to enhance both data metrics by taking fewer samples
to transmit. The algorithms were tested with a standard heart rate dataset to
compare their accuracy and efficiency. The result showed that the
Levenbery-Marquardt algorithm was the best performer with an efficiency of 3.33
and accuracy of 79.17%, which is similar to other algorithms accuracy but
demonstrates improved efficiency. This proves that machine learning can improve
without sacrificing a metric over the other compared to the existing methods
with high efficiency.
","[{'version': 'v1', 'created': 'Sun, 16 Jan 2022 04:08:07 GMT'}]",2022-01-19,"[['An', 'Qi', ''], ['Szewczyk', 'Patryk', ''], ['Johnstone', 'Michael N', ''], ['Kang', 'James Jin', '']]","['Machine Learning', 'Levenberg-Marquardt', 'Bayesian Regularization', 'Scaled Conjugate Gradient', 'Data accuracy', 'Data efficiency', 'Neural networks', 'Healthcare']"
12899,2207.04096,"Yunus Can G\""ultekin","Yunus Can G\""ultekin, Olga Vassilieva, Inwoong Kim, Paparao
  Palacharla, Chigo Okonkwo, Alex Alvarado","On Optimum Enumerative Sphere Shaping Blocklength at Different Symbol
  Rates for the Nonlinear Fiber Channel","3 pages, 3 figures, presented at the OECC/PSC 2022",,10.23919/OECC/PSC53152.2022.9849911,,cs.IT eess.SP math.IT,http://creativecommons.org/licenses/by/4.0/,"  We show that a 0.9 dB SNR improvement can be obtained via short-blocklength
enumerative sphere shaping for single-span transmission at 56 GBd. This gain
vanishes for higher symbol rates and a larger number of spans.
","[{'version': 'v1', 'created': 'Fri, 8 Jul 2022 18:38:32 GMT'}]",2022-08-30,"[['Gültekin', 'Yunus Can', ''], ['Vassilieva', 'Olga', ''], ['Kim', 'Inwoong', ''], ['Palacharla', 'Paparao', ''], ['Okonkwo', 'Chigo', ''], ['Alvarado', 'Alex', '']]","['Probabilistic Amplitude Shaping', 'Enumerative Sphere Shaping', 'Nonlinear Interference Noise']"
12900,2102.01767,Jorge Miguel Ferreira Da Silva,"Jorge Miguel Silva, Diogo Pratas, Rui Antunes, S\'ergio Matos, and
  Armando J. Pinho","Automatic analysis of artistic paintings using information-based
  measures","Website: http://panther.web.ua.pt 24 Pages; 19 pages article; 5 pages
  supplementary material",Pattern Recognition (2021) 107864,10.1016/j.patcog.2021.107864,,cs.CV cs.IT cs.LG math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The artistic community is increasingly relying on automatic computational
analysis for authentication and classification of artistic paintings. In this
paper, we identify hidden patterns and relationships present in artistic
paintings by analysing their complexity, a measure that quantifies the sum of
characteristics of an object. Specifically, we apply Normalized Compression
(NC) and the Block Decomposition Method (BDM) to a dataset of 4,266 paintings
from 91 authors and examine the potential of these information-based measures
as descriptors of artistic paintings. Both measures consistently described the
equivalent types of paintings, authors, and artistic movements. Moreover,
combining the NC with a measure of the roughness of the paintings creates an
efficient stylistic descriptor. Furthermore, by quantifying the local
information of each painting, we define a fingerprint that describes critical
information regarding the artists' style, their artistic influences, and shared
techniques. More fundamentally, this information describes how each author
typically composes and distributes the elements across the canvas and,
therefore, how their work is perceived. Finally, we demonstrate that regional
complexity and two-point height difference correlation function are useful
auxiliary features that improve current methodologies in style and author
classification of artistic paintings. The whole study is supported by an
extensive website (http://panther.web.ua.pt) for fast author characterization
and authentication.
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2021 21:40:30 GMT'}]",2021-02-10,"[['Silva', 'Jorge Miguel', ''], ['Pratas', 'Diogo', ''], ['Antunes', 'Rui', ''], ['Matos', 'Sérgio', ''], ['Pinho', 'Armando J.', '']]","['Image Analysis', 'Data Compression', 'BDM', 'Artistic Paintings', 'Algorithmic Information Theory']"
12901,2010.07834,Ond\v{r}ej Leng\'al,Vojt\v{e}ch Havlena and Ond\v{r}ej Leng\'al,"Reducing (to) the Ranks: Efficient Rank-based B\""{u}chi Automata
  Complementation (Technical Report)",Accepted at CONCUR'21,,10.4230/LIPIcs.CONCUR.2021.9,,cs.LO cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper provides several optimizations of the rank-based approach for
complementing B\""{u}chi automata. We start with Schewe's theoretically optimal
construction and develop a set of techniques for pruning its state space that
are key to obtaining small complement automata in practice. In particular, the
reductions (except one) have the property that they preserve (at least some)
so-called super-tight runs, which are runs whose ranking is as tight as
possible. Our evaluation on a large benchmark shows that the optimizations
indeed significantly help the rank-based approach and that, in a large number
of cases, the obtained complement is the smallest from those produced by a
large number of state-of-the-art tools for B\""{u}chi complementation.
","[{'version': 'v1', 'created': 'Thu, 15 Oct 2020 15:53:13 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Oct 2020 11:01:28 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Jul 2021 07:57:27 GMT'}]",2021-07-22,"[['Havlena', 'Vojtěch', ''], ['Lengál', 'Ondřej', '']]","['Büchi automata', 'rank-based complementation', 'super-tight runs']"
12902,1909.09369,Rafael Poyiadzi,"Rafael Poyiadzi, Kacper Sokol, Raul Santos-Rodriguez, Tijl De Bie,
  Peter Flach",FACE: Feasible and Actionable Counterfactual Explanations,"Presented at AAAI/ACM Conference on AI, Ethics, and Society 2020",,10.1145/3375627.3375850,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Work in Counterfactual Explanations tends to focus on the principle of ""the
closest possible world"" that identifies small changes leading to the desired
outcome. In this paper we argue that while this approach might initially seem
intuitively appealing it exhibits shortcomings not addressed in the current
literature. First, a counterfactual example generated by the state-of-the-art
systems is not necessarily representative of the underlying data distribution,
and may therefore prescribe unachievable goals(e.g., an unsuccessful life
insurance applicant with severe disability may be advised to do more sports).
Secondly, the counterfactuals may not be based on a ""feasible path"" between the
current state of the subject and the suggested one, making actionable recourse
infeasible (e.g., low-skilled unsuccessful mortgage applicants may be told to
double their salary, which may be hard without first increasing their skill
level). These two shortcomings may render counterfactual explanations
impractical and sometimes outright offensive. To address these two major flaws,
first of all, we propose a new line of Counterfactual Explanations research
aimed at providing actionable and feasible paths to transform a selected
instance into one that meets a certain goal. Secondly, we propose FACE: an
algorithmically sound way of uncovering these ""feasible paths"" based on the
shortest path distances defined via density-weighted metrics. Our approach
generates counterfactuals that are coherent with the underlying data
distribution and supported by the ""feasible paths"" of change, which are
achievable and can be tailored to the problem at hand.
","[{'version': 'v1', 'created': 'Fri, 20 Sep 2019 08:29:35 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Feb 2020 15:39:07 GMT'}]",2020-02-25,"[['Poyiadzi', 'Rafael', ''], ['Sokol', 'Kacper', ''], ['Santos-Rodriguez', 'Raul', ''], ['De Bie', 'Tijl', ''], ['Flach', 'Peter', '']]","['Explainability', 'Interpretability', 'Counterfactuals', 'Black-box Models']"
12903,2208.04373,Shumpei Kubosawa,"Shumpei Kubosawa, Takashi Onishi, Yoshimasa Tsuruoka",Soft Sensors and Process Control using AI and Dynamic Simulation,"This is an English version of the research paper in Japanese
  translated by the original authors. The original paper is published in Kagaku
  Kogaku Ronbunsyu by the Society of Chemical Engineers, Japan (SCEJ) on July
  20th, 2022 (DOI: 10.1252/kakoronbunshu.48.141)","Kagaku Kogaku Ronbunsyu, 48(4), 141-151 (2022) in Japanese",10.1252/kakoronbunshu.48.141,,cs.AI cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During the operation of a chemical plant, product quality must be
consistently maintained, and the production of off-specification products
should be minimized. Accordingly, process variables related to the product
quality, such as the temperature and composition of materials at various parts
of the plant must be measured, and appropriate operations (that is, control)
must be performed based on the measurements. Some process variables, such as
temperature and flow rate, can be measured continuously and instantaneously.
However, other variables, such as composition and viscosity, can only be
obtained through time-consuming analysis after sampling substances from the
plant. Soft sensors have been proposed for estimating process variables that
cannot be obtained in real time from easily measurable variables. However, the
estimation accuracy of conventional statistical soft sensors, which are
constructed from recorded measurements, can be very poor in unrecorded
situations (extrapolation). In this study, we estimate the internal state
variables of a plant by using a dynamic simulator that can estimate and predict
even unrecorded situations on the basis of chemical engineering knowledge and
an artificial intelligence (AI) technology called reinforcement learning, and
propose to use the estimated internal state variables of a plant as soft
sensors. In addition, we describe the prospects for plant operation and control
using such soft sensors and the methodology to obtain the necessary prediction
models (i.e., simulators) for the proposed system.
","[{'version': 'v1', 'created': 'Mon, 8 Aug 2022 19:14:50 GMT'}]",2022-08-10,"[['Kubosawa', 'Shumpei', ''], ['Onishi', 'Takashi', ''], ['Tsuruoka', 'Yoshimasa', '']]","['Soft Sensors', 'Reinforcement Learning', 'Dynamic Simulation', 'Systems Identification']"
12904,1905.07228,Igor Ivkic,"Roland Pellegrini, Igor Ivkic, Markus Tauber","Towards a Security-Aware Benchmarking Framework for
  Function-as-a-Service",,"8th International Conference on Cloud Computing and Services
  Science 2018 (CLOSER), Funchal, Portugal",10.5220/0006817606660669,,cs.SE cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a world, where complexity increases on a daily basis the
Function-as-a-Service (FaaS) cloud model seams to take countermeasures. In
comparison to other cloud models, the fast evolving FaaS increasingly abstracts
the underlying infrastructure and refocuses on the application logic. This
trend brings huge benefits in application and performance but comes with
difficulties for benchmarking cloud applications. In this position paper, we
present an initial investigation of benchmarking FaaS in close to reality
production systems. Furthermore, we outline the architectural design including
the necessary benchmarking metrics. We also discuss the possibility of using
the proposed framework for identifying security vulnerabilities.
","[{'version': 'v1', 'created': 'Wed, 15 May 2019 10:14:12 GMT'}]",2019-05-20,"[['Pellegrini', 'Roland', ''], ['Ivkic', 'Igor', ''], ['Tauber', 'Markus', '']]","['Cloud Computing', 'Benchmarking', 'Cloud Security', 'Framework', 'Function-as-a-Service']"
12905,1910.06708,Tianxing Wu,"Tianxing Wu, Arijit Khan, Melvin Yong, Guilin Qi, Meng Wang",Efficiently Embedding Dynamic Knowledge Graphs,46 pages,,10.1016/j.knosys.2022.109124,,cs.DB cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge graph (KG) embedding encodes the entities and relations from a KG
into low-dimensional vector spaces to support various applications such as KG
completion, question answering, and recommender systems. In real world,
knowledge graphs (KGs) are dynamic and evolve over time with addition or
deletion of triples. However, most existing models focus on embedding static
KGs while neglecting dynamics. To adapt to the changes in a KG, these models
need to be retrained on the whole KG with a high time cost. In this paper, to
tackle the aforementioned problem, we propose a new context-aware Dynamic
Knowledge Graph Embedding (DKGE) method which supports the embedding learning
in an online fashion. DKGE introduces two different representations (i.e.,
knowledge embedding and contextual element embedding) for each entity and each
relation, in the joint modeling of entities and relations as well as their
contexts, by employing two attentive graph convolutional networks, a gate
strategy, and translation operations. This effectively helps limit the impacts
of a KG update in certain regions, not in the entire graph, so that DKGE can
rapidly acquire the updated KG embedding by a proposed online learning
algorithm. Furthermore, DKGE can also learn KG embedding from scratch.
Experiments on the tasks of link prediction and question answering in a dynamic
environment demonstrate the effectiveness and efficiency of DKGE.
","[{'version': 'v1', 'created': 'Tue, 15 Oct 2019 13:12:59 GMT'}, {'version': 'v2', 'created': 'Tue, 31 May 2022 18:13:56 GMT'}]",2022-06-02,"[['Wu', 'Tianxing', ''], ['Khan', 'Arijit', ''], ['Yong', 'Melvin', ''], ['Qi', 'Guilin', ''], ['Wang', 'Meng', '']]","['Knowledge Graph', 'Dynamic Embedding', 'Online Learning']"
12906,2004.09492,Igor Sfiligoi,"I. Sfiligoi, D. Schultz, B. Riedel, F. Wuerthwein, S. Barnet and V.
  Brik","Demonstrating a Pre-Exascale, Cost-Effective Multi-Cloud Environment for
  Scientific Computing","5 pages, 7 figures, to be published in proceedings of PEARC'20. arXiv
  admin note: text overlap with arXiv:2002.06667",,10.1145/3311790.3396625,,cs.PF cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Scientific computing needs are growing dramatically with time and are
expanding in science domains that were previously not compute intensive. When
compute workflows spike well in excess of the capacity of their local compute
resource, capacity should be temporarily provisioned from somewhere else to
both meet deadlines and to increase scientific output. Public Clouds have
become an attractive option due to their ability to be provisioned with minimal
advance notice. The available capacity of cost-effective instances is not well
understood. This paper presents expanding the IceCube's production HTCondor
pool using cost-effective GPU instances in preemptible mode gathered from the
three major Cloud providers, namely Amazon Web Services, Microsoft Azure and
the Google Cloud Platform. Using this setup, we sustained for a whole workday
about 15k GPUs, corresponding to around 170 PFLOP32s, integrating over one
EFLOP32 hour worth of science output for a price tag of about $60k. In this
paper, we provide the reasoning behind Cloud instance selection, a description
of the setup and an analysis of the provisioned resources, as well as a short
description of the actual science output of the exercise.
","[{'version': 'v1', 'created': 'Sat, 18 Apr 2020 05:06:39 GMT'}]",2020-07-28,"[['Sfiligoi', 'I.', ''], ['Schultz', 'D.', ''], ['Riedel', 'B.', ''], ['Wuerthwein', 'F.', ''], ['Barnet', 'S.', ''], ['Brik', 'V.', '']]","['Cloud', 'Hybrid-Cloud', 'Multi-Cloud', 'GPU', 'HTCondor', 'IceCube', 'astrophysics', 'cost analysis']"
12907,2201.09696,Wei Yuan,"Wei Yuan, Hongzhi Yin, Tieke He, Tong Chen, Qiufeng Wang, Lizhen Cui",Unified Question Generation with Continual Lifelong Learning,Paper accepted in The Web Conference (WWW) 2022,,10.1145/3485447.3511930,,cs.CL cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Question Generation (QG), as a challenging Natural Language Processing task,
aims at generating questions based on given answers and context. Existing QG
methods mainly focus on building or training models for specific QG datasets.
These works are subject to two major limitations: (1) They are dedicated to
specific QG formats (e.g., answer-extraction or multi-choice QG), therefore, if
we want to address a new format of QG, a re-design of the QG model is required.
(2) Optimal performance is only achieved on the dataset they were just trained
on. As a result, we have to train and keep various QG models for different QG
datasets, which is resource-intensive and ungeneralizable.
  To solve the problems, we propose a model named Unified-QG based on lifelong
learning techniques, which can continually learn QG tasks across different
datasets and formats. Specifically, we first build a format-convert encoding to
transform different kinds of QG formats into a unified representation. Then, a
method named \emph{STRIDER} (\emph{S}imilari\emph{T}y \emph{R}egular\emph{I}zed
\emph{D}ifficult \emph{E}xample \emph{R}eplay) is built to alleviate
catastrophic forgetting in continual QG learning. Extensive experiments were
conducted on $8$ QG datasets across $4$ QG formats (answer-extraction,
answer-abstraction, multi-choice, and boolean QG) to demonstrate the
effectiveness of our approach. Experimental results demonstrate that our
Unified-QG can effectively and continually adapt to QG tasks when datasets and
formats vary. In addition, we verify the ability of a single trained Unified-QG
model in improving $8$ Question Answering (QA) systems' performance through
generating synthetic QA data.
","[{'version': 'v1', 'created': 'Mon, 24 Jan 2022 14:05:18 GMT'}, {'version': 'v2', 'created': 'Sat, 3 Dec 2022 14:33:21 GMT'}]",2022-12-06,"[['Yuan', 'Wei', ''], ['Yin', 'Hongzhi', ''], ['He', 'Tieke', ''], ['Chen', 'Tong', ''], ['Wang', 'Qiufeng', ''], ['Cui', 'Lizhen', '']]","['Question Generation', 'Question Answering', 'Lifelong Learning', 'Pretrained Model']"
12908,1907.03266,Florent Foucaud,"Fran\c{c}ois Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem,
  Th\'eo Pierron",Complexity of planar signed graph homomorphisms to cycles,"17 pages, 10 figures","Discrete Applied Mathematics 284:166-178, 2020",10.1016/j.dam.2020.03.029,,cs.DS cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study homomorphism problems of signed graphs. A signed graph is an
undirected graph where each edge is given a sign, positive or negative. An
important concept for signed graphs is the operation of switching at a vertex,
which is to change the sign of each incident edge. A homomorphism of a graph is
a vertex-mapping that preserves the adjacencies; in the case of signed graphs,
we also preserve the edge-signs. Special homomorphisms of signed graphs, called
s-homomorphisms, have been studied. In an s-homomorphism, we allow, before the
mapping, to perform any number of switchings on the source signed graph. This
concept has been extensively studied, and a full complexity classification
(polynomial or NP-complete) for s-homomorphism to a fixed target signed graph
has recently been obtained. Such a dichotomy is not known when we restrict the
input graph to be planar (not even for non-signed graph homomorphisms).
  We show that deciding whether a (non-signed) planar graph admits a
homomorphism to the square $C_t^2$ of a cycle with $t\ge 6$, or to the circular
clique $K_{4t/(2t-1)}$ with $t\ge2$, are NP-complete problems. We use these
results to show that deciding whether a planar signed graph admits an
s-homomorphism to an unbalanced even cycle is NP-complete. (A cycle is
unbalanced if it has an odd number of negative edges). We deduce a complete
complexity dichotomy for the planar s-homomorphism problem with any signed
cycle as a target.
  We also study further restrictions involving the maximum degree and the girth
of the input signed graph. We prove that planar s-homomorphism problems to
signed cycles remain NP-complete even for inputs of maximum degree~$3$ (except
for the case of unbalanced $4$-cycles, for which we show this for maximum
degree~$4$). We also show that for a given integer $g$, the problem for signed
bipartite planar inputs of girth $g$ is either trivial or NP-complete.
","[{'version': 'v1', 'created': 'Sun, 7 Jul 2019 10:44:00 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Jul 2019 08:48:12 GMT'}]",2020-12-08,"[['Dross', 'François', ''], ['Foucaud', 'Florent', ''], ['Mitsou', 'Valia', ''], ['Ochem', 'Pascal', ''], ['Pierron', 'Théo', '']]","['signed graph', 'edge-coloured graph', 'graph homomorphism', 'planar graph']"
12909,2006.13924,Amanda Stathopoulos,"J Soria, Y Chen, A Stathopoulos",K-Prototype Segmentation Analysis on Large-scale Ridesourcing Trip Data,,"Transportation Research Record, 2020",10.1177/0361198120929338,,cs.CY cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Shared mobility-on-demand services are expanding rapidly in cities around the
world. As a prominent example, app-based ridesourcing is becoming an integral
part of many urban transportation ecosystems. Despite the centrality, limited
public availability of detailed temporal and spatial data on ridesourcing trips
has limited research on how new services interact with traditional mobility
options and how they impact travel in cities. Improving data-sharing agreements
are opening unprecedented opportunities for research in this area. This study
examines emerging patterns of mobility using recently released City of Chicago
public ridesourcing data. The detailed spatio-temporal ridesourcing data are
matched with weather, transit, and taxi data to gain a deeper understanding of
ridesourcings role in Chicagos mobility system. The goal is to investigate the
systematic variations in patronage of ride-hailing. K-prototypes is utilized to
detect user segments owing to its ability to accept mixed variable data types.
An extension of the K-means algorithm, its output is a classification of the
data into several clusters called prototypes. Six ridesourcing prototypes are
identified and discussed based on significant differences in relation to
adverse weather conditions, competition with alternative modes, location and
timing of use, and tendency for ridesplitting. The paper discusses implications
of the identified clusters related to affordability, equity and competition
with transit.
","[{'version': 'v1', 'created': 'Wed, 24 Jun 2020 17:53:26 GMT'}]",2020-11-02,"[['Soria', 'J', ''], ['Chen', 'Y', ''], ['Stathopoulos', 'A', '']]","['Transportation network company', 'Ridesourcing', 'Ridesplitting', 'K-prototype', 'Clustering analysis']"
12910,2209.04130,Reza Arablouei,"Reza Arablouei, Liang Wang, Caitlin Phillips, Lachlan Currie, Jordan
  Yates, Greg Bishop-Hurley","In-situ animal behavior classification using knowledge distillation and
  fixed-point quantization",,,10.1016/j.atech.2022.100159,,cs.LG cs.AI eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore the use of knowledge distillation (KD) for learning compact and
accurate models that enable classification of animal behavior from
accelerometry data on wearable devices. To this end, we take a deep and complex
convolutional neural network, known as residual neural network (ResNet), as the
teacher model. ResNet is specifically designed for multivariate time-series
classification. We use ResNet to distill the knowledge of animal behavior
classification datasets into soft labels, which consist of the predicted
pseudo-probabilities of every class for each datapoint. We then use the soft
labels to train our significantly less complex student models, which are based
on the gated recurrent unit (GRU) and multilayer perceptron (MLP). The
evaluation results using two real-world animal behavior classification datasets
show that the classification accuracy of the student GRU-MLP models improves
appreciably through KD, approaching that of the teacher ResNet model. To
further reduce the computational and memory requirements of performing
inference using the student models trained via KD, we utilize dynamic
fixed-point quantization (DQ) through an appropriate modification of the
computational graph of the considered models. We implement both unquantized and
quantized versions of the developed KD-based models on the embedded systems of
our purpose-built collar and ear tag devices to classify animal behavior in
situ and in real time. Our evaluations corroborate the effectiveness of KD and
DQ in improving the accuracy and efficiency of in-situ animal behavior
classification.
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2022 06:07:17 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Dec 2022 06:09:57 GMT'}]",2022-12-21,"[['Arablouei', 'Reza', ''], ['Wang', 'Liang', ''], ['Phillips', 'Caitlin', ''], ['Currie', 'Lachlan', ''], ['Yates', 'Jordan', ''], ['Bishop-Hurley', 'Greg', '']]","['animal behavior classification', 'deep learning', 'dynamic quantization', 'embedded']"
12911,2001.07491,Zhichao Fang,"Zhichao Fang, Jonathan Dudek, Rodrigo Costas","The stability of Twitter metrics: A study on unavailable Twitter
  mentions of scientific publications",,"Journal of the Association for Information Science and Technology,
  2020",10.1002/asi.24344,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates the stability of Twitter counts of scientific
publications over time. For this, we conducted an analysis of the availability
statuses of over 2.6 million Twitter mentions received by the 1,154 most
tweeted scientific publications recorded by Altmetric.com up to October 2017.
Results show that of the Twitter mentions for these highly tweeted
publications, about 14.3% have become unavailable by April 2019. Deletion of
tweets by users is the main reason for unavailability, followed by suspension
and protection of Twitter user accounts. This study proposes two measures for
describing the Twitter dissemination structures of publications: Degree of
Originality (i.e., the proportion of original tweets received by a paper) and
Degree of Concentration (i.e., the degree to which retweets concentrate on a
single original tweet). Twitter metrics of publications with relatively low
Degree of Originality and relatively high Degree of Concentration are observed
to be at greater risk of becoming unstable due to the potential disappearance
of their Twitter mentions. In light of these results, we emphasize the
importance of paying attention to the potential risk of unstable Twitter
counts, and the significance of identifying the different Twitter dissemination
structures when studying the Twitter metrics of scientific publications.
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2020 12:59:50 GMT'}]",2020-02-25,"[['Fang', 'Zhichao', ''], ['Dudek', 'Jonathan', ''], ['Costas', 'Rodrigo', '']]","['Twitter metrics', 'altmetrics', 'data stability', 'Twitter unavailability rate', 'Twitter dissemination structures']"
12912,1905.09865,Long Ho,"Long V. Ho, Melissa D. Aczon, David Ledbetter, Randall Wetzel","Interpreting a Recurrent Neural Network's Predictions of ICU Mortality
  Risk",,,10.1016/j.jbi.2021.103672,,cs.LG cs.AI stat.ML,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Deep learning has demonstrated success in many applications; however, their
use in healthcare has been limited due to the lack of transparency into how
they generate predictions. Algorithms such as Recurrent Neural Networks (RNNs)
when applied to Electronic Medical Records (EMR) introduce additional barriers
to transparency because of the sequential processing of the RNN and the
multi-modal nature of EMR data. This work seeks to improve transparency by: 1)
introducing Learned Binary Masks (LBM) as a method for identifying which EMR
variables contributed to an RNN model's risk of mortality (ROM) predictions for
critically ill children; and 2) applying KernelSHAP for the same purpose. Given
an individual patient, LBM and KernelSHAP both generate an attribution matrix
that shows the contribution of each input feature to the RNN's sequence of
predictions for that patient. Attribution matrices can be aggregated in many
ways to facilitate different levels of analysis of the RNN model and its
predictions. Presented are three methods of aggregations and analyses: 1) over
volatile time periods within individual patient predictions, 2) over
populations of ICU patients sharing specific diagnoses, and 3) across the
general population of critically ill children.
","[{'version': 'v1', 'created': 'Thu, 23 May 2019 18:41:09 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Jun 2019 22:21:17 GMT'}, {'version': 'v3', 'created': 'Mon, 6 Apr 2020 22:06:12 GMT'}, {'version': 'v4', 'created': 'Tue, 12 Jan 2021 19:38:02 GMT'}]",2021-01-14,"[['Ho', 'Long V.', ''], ['Aczon', 'Melissa D.', ''], ['Ledbetter', 'David', ''], ['Wetzel', 'Randall', '']]","['Model Interpretation', 'Recurrent Neural Networks', 'Feature Importance', 'Feature Attribution', 'ElectronicMedical Records', 'Deep Learning']"
12913,1801.09308,Ahmed Mahfouz,"Ahmed Mahfouz, Tarek M. Mahmoud, Ahmed Sharaf Eldin",A Survey on Behavioral Biometric Authentication on Smartphones,,"Journal of Information Security and Applications. 2017 Dec
  31;37:28-37",10.1016/j.jisa.2017.10.002,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent research has shown the possibility of using smartphones' sensors and
accessories to extract some behavioral attributes such as touch dynamics,
keystroke dynamics and gait recognition. These attributes are known as
behavioral biometrics and could be used to verify or identify users implicitly
and continuously on smartphones. The authentication systems that have been
built based on these behavioral biometric traits are known as active or
continuous authentication systems.
  This paper provides a review of the active authentication systems. We present
the components and the operating process of the active authentication systems
in general, followed by an overview of the state-of-the-art behavioral
biometric traits that used to develop an active authentication systems and
their evaluation on smartphones. We discuss the issues, strengths and
limitations that associated with each behavioral biometric trait. Also, we
introduce a comparative summary between them. Finally, challenges and open
research problems are presented in this research field.
","[{'version': 'v1', 'created': 'Sun, 28 Jan 2018 22:20:30 GMT'}]",2018-01-30,"[['Mahfouz', 'Ahmed', ''], ['Mahmoud', 'Tarek M.', ''], ['Eldin', 'Ahmed Sharaf', '']]","['Behavioral Biometric Authentication', 'Touch Dynamics', 'Keystroke Dynamics', 'BehavioralProfiling', 'Gait Recognition']"
12914,2208.05621,Xujie Zhang,"Xujie Zhang, Yu Sha, Michael C. Kampffmeyer, Zhenyu Xie, Zequn Jie,
  Chengwen Huang, Jianqing Peng, Xiaodan Liang","ARMANI: Part-level Garment-Text Alignment for Unified Cross-Modal
  Fashion Design",Accepted by ACMMM22,,10.1145/3503161.3548230,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cross-modal fashion image synthesis has emerged as one of the most promising
directions in the generation domain due to the vast untapped potential of
incorporating multiple modalities and the wide range of fashion image
applications. To facilitate accurate generation, cross-modal synthesis methods
typically rely on Contrastive Language-Image Pre-training (CLIP) to align
textual and garment information. In this work, we argue that simply aligning
texture and garment information is not sufficient to capture the semantics of
the visual information and therefore propose MaskCLIP. MaskCLIP decomposes the
garments into semantic parts, ensuring fine-grained and semantically accurate
alignment between the visual and text information. Building on MaskCLIP, we
propose ARMANI, a unified cross-modal fashion designer with part-level
garment-text alignment. ARMANI discretizes an image into uniform tokens based
on a learned cross-modal codebook in its first stage and uses a Transformer to
model the distribution of image tokens for a real image given the tokens of the
control signals in its second stage. Contrary to prior approaches that also
rely on two-stage paradigms, ARMANI introduces textual tokens into the
codebook, making it possible for the model to utilize fine-grain semantic
information to generate more realistic images. Further, by introducing a
cross-modal Transformer, ARMANI is versatile and can accomplish image synthesis
from various control signals, such as pure text, sketch images, and partial
images. Extensive experiments conducted on our newly collected cross-modal
fashion dataset demonstrate that ARMANI generates photo-realistic images in
diverse synthesis tasks and outperforms existing state-of-the-art cross-modal
image synthesis approaches.Our code is available at
https://github.com/Harvey594/ARMANI.
","[{'version': 'v1', 'created': 'Thu, 11 Aug 2022 03:44:02 GMT'}]",2022-08-12,"[['Zhang', 'Xujie', ''], ['Sha', 'Yu', ''], ['Kampffmeyer', 'Michael C.', ''], ['Xie', 'Zhenyu', ''], ['Jie', 'Zequn', ''], ['Huang', 'Chengwen', ''], ['Peng', 'Jianqing', ''], ['Liang', 'Xiaodan', '']]","['Cross-modal Alignment', 'Fashion Editing', 'Image Generation']"
12915,2007.10036,Miroslav Kulich,"Michaela Brejchov\'a, Miroslav Kulich, Jan Petr\v{s}, Libor
  P\v{r}eu\v{c}il","Modelling, Simulation, and Planning for the MoleMOD System",,"Modelling and Simulation for Autonomous Systems. MESAS 2018.
  Lecture Notes in Computer Science",10.1007/978-3-030-14984-0_1,vol 11472,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  MoleMOD is a heterogeneous self-reconfigurable modular robotic system to be
employed in architecture and civil engineering. In this paper we present two
components of the MoleMOD infrastructure - a test environment and a planning
algorithm. The test environment for simulation and visualization of active
parts as well as passive blocks of MoleMOD is based on Gazebo - a powerful
general-purpose robotic simulator. The key effort has been put into preparation
of realistic models of passive and active components taking into account their
physical characteristics. Moreover, given a starting configuration of the
MoleMOD system and a final configuration an approach to plan collision-free
trajectories for a fleet of active parts is introduced.
","[{'version': 'v1', 'created': 'Mon, 20 Jul 2020 12:12:16 GMT'}]",2020-07-21,"[['Brejchová', 'Michaela', ''], ['Kulich', 'Miroslav', ''], ['Petrš', 'Jan', ''], ['Přeučil', 'Libor', '']]","['modelling', 'simulation', 'planning', 'self-reconfiguration', 'modular robotic systems']"
12916,2203.06551,Ke Zhang,"Ke Zhang, Jin Fan, Shaoli Huang, Yongliang Qiao, Xiaofeng Yu, Feiwei
  Qin","CEKD:Cross Ensemble Knowledge Distillation for Augmented Fine-grained
  Data",,,10.1007/s10489-022-03355-0,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data augmentation has been proved effective in training deep models. Existing
data augmentation methods tackle the fine-grained problem by blending image
pairs and fusing corresponding labels according to the statistics of mixed
pixels, which produces additional noise harmful to the performance of networks.
Motivated by this, we present a simple yet effective cross ensemble knowledge
distillation (CEKD) model for fine-grained feature learning. We innovatively
propose a cross distillation module to provide additional supervision to
alleviate the noise problem, and propose a collaborative ensemble module to
overcome the target conflict problem. The proposed model can be trained in an
end-to-end manner, and only requires image-level label supervision. Extensive
experiments on widely used fine-grained benchmarks demonstrate the
effectiveness of our proposed model. Specifically, with the backbone of
ResNet-101, CEKD obtains the accuracy of 89.59%, 95.96% and 94.56% in three
datasets respectively, outperforming state-of-the-art API-Net by 0.99%, 1.06%
and 1.16%.
","[{'version': 'v1', 'created': 'Sun, 13 Mar 2022 02:57:25 GMT'}]",2022-03-15,"[['Zhang', 'Ke', ''], ['Fan', 'Jin', ''], ['Huang', 'Shaoli', ''], ['Qiao', 'Yongliang', ''], ['Yu', 'Xiaofeng', ''], ['Qin', 'Feiwei', '']]","['Fine-grained Recognition', 'Knowledge Distillation', 'Data Augmentation', 'Image Visualization', 'DeepLearning']"
12917,1908.11324,Ning Zhang,"Ning Zhang, Dechun Wang, Xinzi Sun, Pengfei Zhang, Chenxi Zhang, Yu
  Cao, Benyuan Liu",3D Anchor-Free Lesion Detector on Computed Tomography Scans,,TransAI 2019,10.1109/TransAI.2019.00016,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lesions are injuries and abnormal tissues in the human body. Detecting
lesions in 3D Computed Tomography (CT) scans can be time-consuming even for
very experienced physicians and radiologists. In recent years, CNN based lesion
detectors have demonstrated huge potentials. Most of current state-of-the-art
lesion detectors employ anchors to enumerate all possible bounding boxes with
respect to the dataset in process. This anchor mechanism greatly improves the
detection performance while also constraining the generalization ability of
detectors. In this paper, we propose an anchor-free lesion detector. The anchor
mechanism is removed and lesions are formalized as single keypoints. By doing
so, we witness a considerable performance gain in terms of both accuracy and
inference speed compared with the anchor-based baseline
","[{'version': 'v1', 'created': 'Thu, 29 Aug 2019 16:15:45 GMT'}]",2019-09-30,"[['Zhang', 'Ning', ''], ['Wang', 'Dechun', ''], ['Sun', 'Xinzi', ''], ['Zhang', 'Pengfei', ''], ['Zhang', 'Chenxi', ''], ['Cao', 'Yu', ''], ['Liu', 'Benyuan', '']]","['Anchor-Free', '3D Object Detection', 'Lesion Detection']"
12918,2205.08475,Bhanuka Mahanama,"Bhanuka Mahanama, Gavindya Jayawardena, Yasasi Abeysinghe, Vikas
  Ashok, Sampath Jayarathna",Multidisciplinary Reading Patterns of Digital Documents,,,10.1145/3517031.3531630,,cs.DL cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Reading plays a vital role in updating the researchers on recent developments
in the field, including but not limited to solutions to various problems and
collaborative studies between disciplines. Prior studies identify reading
patterns to vary depending on the level of expertise of the researcher on the
content of the document. We present a pilot study of eye-tracking measures
during a reading task with participants with different domain expertise to
characterize their reading patterns.
","[{'version': 'v1', 'created': 'Tue, 17 May 2022 16:38:22 GMT'}]",2022-05-18,"[['Mahanama', 'Bhanuka', ''], ['Jayawardena', 'Gavindya', ''], ['Abeysinghe', 'Yasasi', ''], ['Ashok', 'Vikas', ''], ['Jayarathna', 'Sampath', '']]","['Eye Tracking', 'Reading Patterns', 'Multidisciplinary Research']"
12919,2109.13442,Dongxiao Zhang,"Xing Luo, Dongxiao Zhang","An Adaptive Deep Learning Framework for Day-ahead Forecasting of
  Photovoltaic Power Generation","26 pages, 10 figures","Sustainable Energy Technologies and Assessments, 52, 102326, 2022",10.1016/j.seta.2022.102326,,cs.LG cs.AI physics.comp-ph physics.data-an,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Accurate forecasts of photovoltaic power generation (PVPG) are essential to
optimize operations between energy supply and demand. Recently, the propagation
of sensors and smart meters has produced an enormous volume of data, which
supports the development of data based PVPG forecasting. Although emerging deep
learning (DL) models, such as the long short-term memory (LSTM) model, based on
historical data, have provided effective solutions for PVPG forecasting with
great successes, these models utilize offline learning. As a result, DL models
cannot take advantage of the opportunity to learn from newly-arrived data, and
are unable to handle concept drift caused by installing extra PV units and
unforeseen PV unit failures. Consequently, to improve day-ahead PVPG
forecasting accuracy, as well as eliminate the impacts of concept drift, this
paper proposes an adaptive LSTM (AD-LSTM) model, which is a DL framework that
can not only acquire general knowledge from historical data, but also
dynamically learn specific knowledge from newly-arrived data. A two-phase
adaptive learning strategy (TP-ALS) is integrated into AD-LSTM, and a sliding
window (SDWIN) algorithm is proposed, to detect concept drift in PV systems.
Multiple datasets from PV systems are utilized to assess the feasibility and
effectiveness of the proposed approaches. The developed AD-LSTM model
demonstrates greater forecasting capability than the offline LSTM model,
particularly in the presence of concept drift. Additionally, the proposed
AD-LSTM model also achieves superior performance in terms of day-ahead PVPG
forecasting compared to other traditional machine learning models and
statistical models in the literature.
","[{'version': 'v1', 'created': 'Tue, 28 Sep 2021 02:39:56 GMT'}]",2022-06-14,"[['Luo', 'Xing', ''], ['Zhang', 'Dongxiao', '']]","['forecast', 'PV power generation', 'deep learning', 'adaptive LSTM']"
12920,1805.01334,Chenyan Xiong,Chenyan Xiong and Zhengzhong Liu and Jamie Callan and Tie-Yan Liu,"Towards Better Text Understanding and Retrieval through Kernel Entity
  Salience Modeling",,In proceedings of SIGIR 2018,10.1145/3209978.3209982,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a Kernel Entity Salience Model (KESM) that improves text
understanding and retrieval by better estimating entity salience (importance)
in documents. KESM represents entities by knowledge enriched distributed
representations, models the interactions between entities and words by kernels,
and combines the kernel scores to estimate entity salience. The whole model is
learned end-to-end using entity salience labels. The salience model also
improves ad hoc search accuracy, providing effective ranking features by
modeling the salience of query entities in candidate documents. Our experiments
on two entity salience corpora and two TREC ad hoc search datasets demonstrate
the effectiveness of KESM over frequency-based and feature-based methods. We
also provide examples showing how KESM conveys its text understanding ability
learned from entity salience to search.
","[{'version': 'v1', 'created': 'Thu, 3 May 2018 14:46:12 GMT'}]",2018-05-04,"[['Xiong', 'Chenyan', ''], ['Liu', 'Zhengzhong', ''], ['Callan', 'Jamie', ''], ['Liu', 'Tie-Yan', '']]","['Text Understanding', 'Entity Salience', 'Entity-Oriented Search']"
12921,2109.04532,William Bergeron,"Bill Bergeron, Matthew Hubbell, Dylan Sequeira, Winter Williams,
  William Arcand, David Bestor, Chansup, Byun, Vijay Gadepally, Michael Houle,
  Michael Jones, Anna Klien, Peter Michaleas, Lauren Milechin, Julie Mullen
  Andrew Prout, Albert Reuther, Antonio Rosa, Siddharth Samsi, Charles Yee,
  Jeremy Kepner",3D Real-Time Supercomputer Monitoring,,,10.1109/HPEC49654.2021.9622787,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Supercomputers are complex systems producing vast quantities of performance
data from multiple sources and of varying types. Performance data from each of
the thousands of nodes in a supercomputer tracks multiple forms of storage,
memory, networks, processors, and accelerators. Optimization of application
performance is critical for cost effective usage of a supercomputer and
requires efficient methods for effectively viewing performance data. The
combination of supercomputing analytics and 3D gaming visualization enables
real-time processing and visual data display of massive amounts of information
that humans can process quickly with little training. Our system fully utilizes
the capabilities of modern 3D gaming environments to create novel
representations of computing hardware which intuitively represent the physical
attributes of the supercomputer while displaying real-time alerts and component
utilization. This system allows operators to quickly assess how the
supercomputer is being used, gives users visibility into the resources they are
consuming, and provides instructors new ways to interactively teach the
computing architecture concepts necessary for efficient computing
","[{'version': 'v1', 'created': 'Thu, 9 Sep 2021 19:46:29 GMT'}]",2022-08-23,"[['Bergeron', 'Bill', ''], ['Hubbell', 'Matthew', ''], ['Sequeira', 'Dylan', ''], ['Williams', 'Winter', ''], ['Arcand', 'William', ''], ['Bestor', 'David', ''], ['Chansup', '', ''], ['Byun', '', ''], ['Gadepally', 'Vijay', ''], ['Houle', 'Michael', ''], ['Jones', 'Michael', ''], ['Klien', 'Anna', ''], ['Michaleas', 'Peter', ''], ['Milechin', 'Lauren', ''], ['Prout', 'Julie Mullen Andrew', ''], ['Reuther', 'Albert', ''], ['Rosa', 'Antonio', ''], ['Samsi', 'Siddharth', ''], ['Yee', 'Charles', ''], ['Kepner', 'Jeremy', '']]","['Supercomputing', 'High Performance Computing', 'HPC', '3D Gaming', 'Unity', 'supercloud', 'cloud computing']"
12922,2001.09822,Mario Aguilar-Simon,"Andrew Brna, Ryan Brown, Patrick Connolly, Stephen Simons, Renee
  Shimizu, Mario Aguilar-Simon",Uncertainty-based Modulation for Lifelong Learning,,"Neural Networks, Vol. 120, pp 129-142, 2019",10.1016/j.neunet.2019.09.011,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The creation of machine learning algorithms for intelligent agents capable of
continuous, lifelong learning is a critical objective for algorithms being
deployed on real-life systems in dynamic environments. Here we present an
algorithm inspired by neuromodulatory mechanisms in the human brain that
integrates and expands upon Stephen Grossberg\'s ground-breaking Adaptive
Resonance Theory proposals. Specifically, it builds on the concept of
uncertainty, and employs a series of neuromodulatory mechanisms to enable
continuous learning, including self-supervised and one-shot learning. Algorithm
components were evaluated in a series of benchmark experiments that demonstrate
stable learning without catastrophic forgetting. We also demonstrate the
critical role of developing these systems in a closed-loop manner where the
environment and the agent\'s behaviors constrain and guide the learning
process. To this end, we integrated the algorithm into an embodied simulated
drone agent. The experiments show that the algorithm is capable of continuous
learning of new tasks and under changed conditions with high classification
accuracy (greater than 94 percent) in a virtual environment, without
catastrophic forgetting. The algorithm accepts high dimensional inputs from any
state-of-the-art detection and feature extraction algorithms, making it a
flexible addition to existing systems. We also describe future development
efforts focused on imbuing the algorithm with mechanisms to seek out new
knowledge as well as employ a broader range of neuromodulatory processes.
","[{'version': 'v1', 'created': 'Mon, 27 Jan 2020 14:34:37 GMT'}]",2020-01-28,"[['Brna', 'Andrew', ''], ['Brown', 'Ryan', ''], ['Connolly', 'Patrick', ''], ['Simons', 'Stephen', ''], ['Shimizu', 'Renee', ''], ['Aguilar-Simon', 'Mario', '']]","['Self-supervision', 'Few-shot learning', 'Lifelong learning', 'Catastrophic forgetting']"
12923,2207.04284,Patrick Ebel,"Patrick Ebel, Moritz Berger, Christoph Lingenfelder, Andreas Vogelsang","How Do Drivers Self-Regulate their Secondary Task Engagements? The
  Effect of Driving Automation on Touchscreen Interactions and Glance Behavior","14th International ACM Conference on Automotive User Interfaces and
  Interactive Vehicular Applications",,10.1145/3543174.3545173,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With ever-improving driver assistance systems and large touchscreens becoming
the main in-vehicle interface, drivers are more tempted than ever to engage in
distracting non-driving-related tasks. However, little research exists on how
driving automation affects drivers' self-regulation when interacting with
center stack touchscreens. To investigate this, we employ multilevel models on
a real-world driving dataset consisting of 10,139 sequences. Our results show
significant differences in drivers' interaction and glance behavior in response
to varying levels of driving automation, vehicle speed, and road curvature.
During partially automated driving, drivers are not only more likely to engage
in secondary touchscreen tasks, but their mean glance duration toward the
touchscreen also increases by 12% (Level 1) and 20% (Level 2) compared to
manual driving. We further show that the effect of driving automation on
drivers' self-regulation is larger than that of vehicle speed and road
curvature. The derived knowledge can facilitate the safety evaluation of
infotainment systems and the development of context-aware driver monitoring
systems.
","[{'version': 'v1', 'created': 'Sat, 9 Jul 2022 15:00:38 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Jul 2022 06:53:48 GMT'}]",2022-07-13,"[['Ebel', 'Patrick', ''], ['Berger', 'Moritz', ''], ['Lingenfelder', 'Christoph', ''], ['Vogelsang', 'Andreas', '']]","['Human Computer Interaction', 'Driver Behavior', 'Distracted Driving', 'Naturalistic Driving Study', 'Driving Automation']"
12924,1710.09417,Daniel Severin Dr.,Daniel Severin,"Cross-identification of stellar catalogs with multiple stars: Complexity
  and Resolution",,"Electronic Notes in Discrete Mathematics 69 (2018), 29-36",10.1016/j.endm.2018.07.005,,cs.DM astro-ph.IM cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, I present an optimization problem which consists of assigning
entries of a stellar catalog to multiple entries of another stellar catalog
such that the probability of such assignment is maximum. I show a way of
modeling it as a Maximum Weighted Stable Set Problem which is further used to
solve a real astronomical instance and I partially characterize the forbidden
subgraphs of the resulting family of graphs given by that reduction. Finally, I
prove that the problem is NP-Hard.
","[{'version': 'v1', 'created': 'Wed, 25 Oct 2017 18:42:35 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Aug 2018 13:59:21 GMT'}]",2018-08-09,"[['Severin', 'Daniel', '']]","['Cross-identification', 'Complexity', 'Maximum Weighted Stable SetProblem', 'Forbidden subgraphs']"
12925,1910.09336,Robert Y. Lewis,The mathlib Community,The Lean mathematical library,,,10.1145/3372885.3373824,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes mathlib, a community-driven effort to build a unified
library of mathematics formalized in the Lean proof assistant. Among proof
assistant libraries, it is distinguished by its dependently typed foundations,
focus on classical mathematics, extensive hierarchy of structures, use of
large- and small-scale automation, and distributed organization. We explain the
architecture and design decisions of the library and the social organization
that has led us here.
","[{'version': 'v1', 'created': 'Mon, 21 Oct 2019 13:08:24 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Dec 2019 20:37:52 GMT'}]",2020-01-28,"[['Community', 'The mathlib', '']]","['Lean', 'mathlib', 'formal library', 'formal proof']"
12926,2207.14621,Nikita Starodubcev,"Nikita O. Starodubcev, Nikolay O. Nikitin, Konstantin G. Gavaza,
  Elizaveta A. Andronova, Denis O. Sidorenko, Anna V. Kalyuzhnaya",Generative Design of Physical Objects using Modular Framework,,,10.1016/j.engappai.2022.105715,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years generative design techniques have become firmly established
in numerous applied fields, especially in engineering. These methods are
demonstrating intensive growth owing to promising outlook. However, existing
approaches are limited by the specificity of problem under consideration. In
addition, they do not provide desired flexibility. In this paper we formulate
general approach to an arbitrary generative design problem and propose novel
framework called GEFEST (Generative Evolution For Encoded STructure) on its
basis. The developed approach is based on three general principles: sampling,
estimation and optimization. This ensures the freedom of method adjustment for
solution of particular generative design problem and therefore enables to
construct the most suitable one. A series of experimental studies was conducted
to confirm the effectiveness of the GEFEST framework. It involved synthetic and
real-world cases (coastal engineering, microfluidics, thermodynamics and oil
field planning). Flexible structure of the GEFEST makes it possible to obtain
the results that surpassing baseline solutions.
","[{'version': 'v1', 'created': 'Fri, 29 Jul 2022 11:41:45 GMT'}]",2022-12-29,"[['Starodubcev', 'Nikita O.', ''], ['Nikitin', 'Nikolay O.', ''], ['Gavaza', 'Konstantin G.', ''], ['Andronova', 'Elizaveta A.', ''], ['Sidorenko', 'Denis O.', ''], ['Kalyuzhnaya', 'Anna V.', '']]","['generative design', 'deep learning', 'evolutionary algorithms', 'optimization problems']"
12927,2101.07855,Furkan Gursoy,"Mahsun Alt{\i}n, Furkan G\""ursoy, Lina Xu","Machine-Generated Hierarchical Structure of Human Activities to Reveal
  How Machines Think",,"IEEE Access, vol. 9, pp. 18307-18317, 2021",10.1109/ACCESS.2021.3053084,,cs.CV cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep-learning based computer vision models have proved themselves to be
ground-breaking approaches to human activity recognition (HAR). However, most
existing works are dedicated to improve the prediction accuracy through either
creating new model architectures, increasing model complexity, or refining
model parameters by training on larger datasets. Here, we propose an
alternative idea, differing from existing work, to increase model accuracy and
also to shape model predictions to align with human understandings through
automatically creating higher-level summarizing labels for similar groups of
human activities. First, we argue the importance and feasibility of
constructing a hierarchical labeling system for human activity recognition.
Then, we utilize the predictions of a black box HAR model to identify
similarities between different activities. Finally, we tailor hierarchical
clustering methods to automatically generate hierarchical trees of activities
and conduct experiments. In this system, the activity labels on the same level
will have a designed magnitude of accuracy and reflect a specific amount of
activity details. This strategy enables a trade-off between the extent of the
details in the recognized activity and the user privacy by masking some
sensitive predictions; and also provides possibilities for the use of formerly
prohibited invasive models in privacy-concerned scenarios. Since the hierarchy
is generated from the machine's perspective, the predictions at the upper
levels provide better accuracy, which is especially useful when there are too
detailed labels in the training set that are rather trivial to the final
prediction goal. Moreover, the analysis of the structure of these trees can
reveal the biases in the prediction model and guide future data collection
strategies.
","[{'version': 'v1', 'created': 'Tue, 19 Jan 2021 20:40:22 GMT'}]",2021-02-04,"[['Altın', 'Mahsun', ''], ['Gürsoy', 'Furkan', ''], ['Xu', 'Lina', '']]","['hierarchical labeling', 'human activity recognition', 'machine learning', 'privacy preservation', 'video processing']"
12928,cs/0601090,Vitaly Skachek,"Ron M. Roth, Vitaly Skachek",Improved Nearly-MDS Expander Codes,"Part of this work was presented at the 2004 IEEE Int'l Symposium on
  Information Theory (ISIT'2004), Chicago, Illinois (June 2004). This work was
  submitted to IEEE Transactions on Information Theory on January 21, 2005. To
  appear in IEEE Transactions on Information Theory, August 2006. 12 pages",,10.1109/TIT.2006.878232,,cs.IT math.IT,,"  A construction of expander codes is presented with the following three
properties:
  (i) the codes lie close to the Singleton bound, (ii) they can be encoded in
time complexity that is linear in their code length, and (iii) they have a
linear-time bounded-distance decoder.
  By using a version of the decoder that corrects also erasures, the codes can
replace MDS outer codes in concatenated constructions, thus resulting in
linear-time encodable and decodable codes that approach the Zyablov bound or
the capacity of memoryless channels. The presented construction improves on an
earlier result by Guruswami and Indyk in that any rate and relative minimum
distance that lies below the Singleton bound is attainable for a significantly
smaller alphabet size.
","[{'version': 'v1', 'created': 'Sat, 21 Jan 2006 12:40:26 GMT'}, {'version': 'v2', 'created': 'Wed, 10 May 2006 16:59:55 GMT'}]",2016-11-17,"[['Roth', 'Ron M.', ''], ['Skachek', 'Vitaly', '']]","['Concatenated codes', 'Expander codes', 'Graph codes', 'Iterative decoding', 'Linear-time decoding', 'Linear-time encoding', 'MDS codes']"
12929,1706.10241,Jorge Calvo-Zaragoza,Jorge Calvo-Zaragoza and Antonio-Javier Gallego,A selectional auto-encoder approach for document image binarization,Published in Pattern Recognition,,10.1016/j.patcog.2018.08.011,,cs.CV cs.DL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Binarization plays a key role in the automatic information retrieval from
document images. This process is usually performed in the first stages of
documents analysis systems, and serves as a basis for subsequent steps. Hence
it has to be robust in order to allow the full analysis workflow to be
successful. Several methods for document image binarization have been proposed
so far, most of which are based on hand-crafted image processing strategies.
Recently, Convolutional Neural Networks have shown an amazing performance in
many disparate duties related to computer vision. In this paper we discuss the
use of convolutional auto-encoders devoted to learning an end-to-end map from
an input image to its selectional output, in which activations indicate the
likelihood of pixels to be either foreground or background. Once trained,
documents can therefore be binarized by parsing them through the model and
applying a threshold. This approach has proven to outperform existing
binarization strategies in a number of document domains.
","[{'version': 'v1', 'created': 'Fri, 30 Jun 2017 15:35:13 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Sep 2017 13:18:51 GMT'}, {'version': 'v3', 'created': 'Thu, 6 Sep 2018 09:32:09 GMT'}]",2018-09-07,"[['Calvo-Zaragoza', 'Jorge', ''], ['Gallego', 'Antonio-Javier', '']]","['Binarization', 'Document Analysis', 'Auto-encoders', 'ConvolutionalNeural Networks']"
12930,1912.10041,Kees Middelburg,C. A. Middelburg,Probabilistic process algebra and strategic interleaving,"30 pages, major revision with adaptation of example from
  arXiv:2003.00473 incorporated (also text overlap with arXiv:1703.06822)",Scientific Annals of Computer Science 30(2):205--243 (2020),10.7561/SACS.2020.2.205,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We first present a probabilistic version of ACP that rests on the principle
that probabilistic choices are always resolved before choices involved in
alternative composition and parallel composition are resolved and then extend
this probabilistic version of ACP with a form of interleaving in which parallel
processes are interleaved according to what is known as a process-scheduling
policy in the field of operating systems. We use the term strategic
interleaving for this more constrained form of interleaving. The extension
covers probabilistic process-scheduling policies.
","[{'version': 'v1', 'created': 'Fri, 20 Dec 2019 15:54:45 GMT'}, {'version': 'v2', 'created': 'Sun, 26 Jan 2020 09:38:57 GMT'}, {'version': 'v3', 'created': 'Sun, 1 Mar 2020 13:12:43 GMT'}, {'version': 'v4', 'created': 'Sun, 15 Mar 2020 15:09:22 GMT'}, {'version': 'v5', 'created': 'Tue, 21 Apr 2020 13:42:04 GMT'}, {'version': 'v6', 'created': 'Tue, 8 Sep 2020 14:17:35 GMT'}]",2020-12-23,"[['Middelburg', 'C. A.', '']]","['process algebra', 'probabilistic choice', 'parallel composition', 'arbitrary interleaving', 'strategic interleaving']"
12931,1410.6854,Diederik Aerts,"Diederik Aerts, Sandro Sozzo and Tomas Veloz","The Quantum Nature of Identity in Human Thought: Bose-Einstein
  Statistics for Conceptual Indistinguishability",12 pages,"International Journal of Theoretical Physics, 54, pp 4430-4443,
  2015",10.1007/s10773-015-2620-4,,cs.AI quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Increasing experimental evidence shows that humans combine concepts in a way
that violates the rules of classical logic and probability theory. On the other
hand, mathematical models inspired by the formalism of quantum theory are in
accordance with data on concepts and their combinations. In this paper, we
investigate a novel type of concept combination were a number is combined with
a noun, e.g., `Eleven Animals. Our aim is to study 'conceptual identity' and
the effects of 'indistinguishability' - in the combination 'Eleven Animals',
the 'animals' are identical and indistinguishable - on the mechanisms of
conceptual combination. We perform experiments on human subjects and find
significant evidence of deviation from the predictions of classical statistical
theories, more specifically deviations with respect to Maxwell-Boltzmann
statistics. This deviation is of the 'same type' of the deviation of quantum
mechanical from classical mechanical statistics, due to indistinguishability of
microscopic quantum particles, i.e we find convincing evidence of the presence
of Bose-Einstein statistics. We also present preliminary promising evidence of
this phenomenon in a web-based study.
","[{'version': 'v1', 'created': 'Fri, 24 Oct 2014 23:51:41 GMT'}]",2015-12-31,"[['Aerts', 'Diederik', ''], ['Sozzo', 'Sandro', ''], ['Veloz', 'Tomas', '']]","['Indistinguishability', 'quantum statistics', 'conceptual identity', 'quantum cognition']"
12932,2201.01183,Nicola Ferro,"Matteo Gavazzoni, Nicola Ferro, Simona Perotto, Stefano Foletti","Multi-physics inverse homogenization for the design of innovative
  cellular materials: application to thermo-mechanical problems",,,10.3390/mca27010015,,cs.CE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We present a new algorithm to design lightweight cellular materials with
required properties in a multi-physics context. In particular, we focus on a
thermo-mechanical setting, by promoting the design of unit cells characterized
both by an isotropic and an anisotropic behaviour with respect to mechanical
and thermal requirements. The proposed procedure generalizes microSIMPATY
algorithm to a multi-physics framework, by preserving all the good properties
of the reference design methodology. The resulting layouts exhibit non-standard
topologies and are characterized by very sharp contours, thus limiting the
post-processing before manufacturing. The new cellular materials are compared
with the state-of-art in engineering practice in terms of thermo-mechanical
properties, thus highlighting the good performance of the new layouts which, in
some cases, outperform the consolidated choices.
","[{'version': 'v1', 'created': 'Tue, 4 Jan 2022 15:13:56 GMT'}]",2022-02-21,"[['Gavazzoni', 'Matteo', ''], ['Ferro', 'Nicola', ''], ['Perotto', 'Simona', ''], ['Foletti', 'Stefano', '']]","['Topology optimization', 'Cellular materials', 'Multi-physics', 'Homogenization', 'Anisotropic mesh adaptation']"
12933,2010.04225,Ryan Omidi,"Ryan Omidi, Ali Moghimi, Alireza Pourreza, Mohamed El-Hadedy, Anas
  Salah Eddin","Ensemble Hyperspectral Band Selection for Detecting Nitrogen Status in
  Grape Leaves","8 PAGES, ACCEPTED IN 19TH IEEE INTERNATIONAL CONFERENCE ON MACHINE
  LEARNING AND APPLICATIONS (ICMLA 2020), MODIFIED ONE AUTHOR NAME",,10.1109/ICMLA51294.2020.00054,,cs.CV cs.LG eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The large data size and dimensionality of hyperspectral data demands complex
processing and data analysis. Multispectral data do not suffer the same
limitations, but are normally restricted to blue, green, red, red edge, and
near infrared bands. This study aimed to identify the optimal set of spectral
bands for nitrogen detection in grape leaves using ensemble feature selection
on hyperspectral data from over 3,000 leaves from 150 Flame Seedless table
grapevines. Six machine learning base rankers were included in the ensemble:
random forest, LASSO, SelectKBest, ReliefF, SVM-RFE, and chaotic crow search
algorithm (CCSA). The pipeline identified less than 0.45% of the bands as most
informative about grape nitrogen status. The selected violet, yellow-orange,
and shortwave infrared bands lie outside of the typical blue, green, red, red
edge, and near infrared bands of commercial multispectral cameras, so the
potential improvement in remote sensing of nitrogen in grapevines brought forth
by a customized multispectral sensor centered at the selected bands is
promising and worth further investigation. The proposed pipeline may also be
used for application-specific multispectral sensor design in domains other than
agriculture.
","[{'version': 'v1', 'created': 'Thu, 8 Oct 2020 19:09:10 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Oct 2020 01:17:28 GMT'}]",2021-03-10,"[['Omidi', 'Ryan', ''], ['Moghimi', 'Ali', ''], ['Pourreza', 'Alireza', ''], ['El-Hadedy', 'Mohamed', ''], ['Eddin', 'Anas Salah', '']]","['hyperspectral', 'multispectral', 'ensemble', 'feature']"
12934,1601.05904,Gang Mei,"Gang Mei, Nengxiong Xu, Liangliang Xu","Improving GPU-accelerated Adaptive IDW Interpolation Algorithm Using
  Fast kNN Search","Submitted manuscript. 9 Figures, 3 Tables",SpringerPlus 2016 5:1389,10.1186/s40064-016-3035-2,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an efficient parallel Adaptive Inverse Distance Weighting
(AIDW) interpolation algorithm on modern Graphics Processing Unit (GPU). The
presented algorithm is an improvement of our previous GPU-accelerated AIDW
algorithm by adopting fast k-Nearest Neighbors (kNN) search. In AIDW, it needs
to find several nearest neighboring data points for each interpolated point to
adaptively determine the power parameter; and then the desired prediction value
of the interpolated point is obtained by weighted interpolating using the power
parameter. In this work, we develop a fast kNN search approach based on the
space-partitioning data structure, even grid, to improve the previous
GPU-accelerated AIDW algorithm. The improved algorithm is composed of the
stages of kNN search and weighted interpolating. To evaluate the performance of
the improved algorithm, we perform five groups of experimental tests.
Experimental results show that: (1) the improved algorithm can achieve a
speedup of up to 1017 over the corresponding serial algorithm; (2) the improved
algorithm is at least two times faster than our previous GPU-accelerated AIDW
algorithm; and (3) the utilization of fast kNN search can significantly improve
the computational efficiency of the entire GPU-accelerated AIDW algorithm.
","[{'version': 'v1', 'created': 'Fri, 22 Jan 2016 08:19:39 GMT'}]",2016-09-09,"[['Mei', 'Gang', ''], ['Xu', 'Nengxiong', ''], ['Xu', 'Liangliang', '']]","['Graphics Processing Unit (GPU)', 'k-Nearest Neighbors (kNN)', 'Inverse Distance Weighting (IDW)', 'SpatialInterpolation']"
12935,2001.00479,Stefano Sarao Mannelli,Stefano Sarao Mannelli and Lenka Zdeborova,Thresholds of descending algorithms in inference problems,"8 pages, 4 figures",J. Stat. Mech. (2020) 034004,10.1088/1742-5468/ab7123,,cs.LG cond-mat.dis-nn stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We review recent works on analyzing the dynamics of gradient-based algorithms
in a prototypical statistical inference problem. Using methods and insights
from the physics of glassy systems, these works showed how to understand
quantitatively and qualitatively the performance of gradient-based algorithms.
Here we review the key results and their interpretation in non-technical terms
accessible to a wide audience of physicists in the context of related works.
","[{'version': 'v1', 'created': 'Thu, 2 Jan 2020 15:08:40 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Jan 2020 08:53:20 GMT'}]",2020-03-12,"[['Mannelli', 'Stefano Sarao', ''], ['Zdeborova', 'Lenka', '']]","['analysis of algorithms', 'statistical inference', 'spin glasses', 'machine learning']"
12936,1906.06603,Bing Li Dr.,"Bing Li, Bonan Yan, Hai (Helen) Li","An Overview of In-memory Processing with Emerging Non-volatile Memory
  for Data-intensive Applications",,,10.1145/3299874.3319452,,cs.AR cs.ET cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The conventional von Neumann architecture has been revealed as a major
performance and energy bottleneck for rising data-intensive applications. %,
due to the intensive data movements. The decade-old idea of leveraging
in-memory processing to eliminate substantial data movements has returned and
led extensive research activities. The effectiveness of in-memory processing
heavily relies on memory scalability, which cannot be satisfied by traditional
memory technologies. Emerging non-volatile memories (eNVMs) that pose appealing
qualities such as excellent scaling and low energy consumption, on the other
hand, have been heavily investigated and explored for realizing in-memory
processing architecture. In this paper, we summarize the recent research
progress in eNVM-based in-memory processing from various aspects, including the
adopted memory technologies, locations of the in-memory processing in the
system, supported arithmetics, as well as applied applications.
","[{'version': 'v1', 'created': 'Sat, 15 Jun 2019 18:46:40 GMT'}]",2019-06-18,"[['Li', 'Bing', '', 'Helen'], ['Yan', 'Bonan', '', 'Helen'], ['Hai', '', '', 'Helen'], ['Li', '', '']]","['Data-intensive applications', 'emerging non-volatile memory', 'inmemory processing']"
12937,2202.05891,Shrisha Rao,"Karishma, Shrisha Rao","Cooperative Solutions to Exploration Tasks Under Speed and Budget
  Constraints",,"Journal of Simulation, 2023",10.1080/17477778.2022.2043792,,cs.MA cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a multi-agent system where agents can cooperate to solve a system
of dependent tasks, with agents having the capability to explore a solution
space, make inferences, as well as query for information under a limited
budget. Re-exploration of the solution space takes place by an agent when an
older solution expires and is thus able to adapt to dynamic changes in the
environment. We investigate the effects of task dependencies, with
highly-dependent graph $G_{40}$ (a well-known program graph that contains $40$
highly interlinked nodes, each representing a task) and less-dependent graphs
$G_{18}$ (a program graph that contains $18$ tasks with fewer links),
increasing the speed of the agents and the complexity of the problem space and
the query budgets available to agents. Specifically, we evaluate trade-offs
between the agent's speed and query budget. During the experiments, we observed
that increasing the speed of a single agent improves the system performance to
a certain point only, and increasing the number of faster agents may not
improve the system performance due to task dependencies. Favoring faster agents
during budget allocation enhances the system performance, in line with the
""Matthew effect."" We also observe that allocating more budget to a faster agent
gives better performance for a less-dependent system, but increasing the number
of faster agents gives a better performance for a highly-dependent system.
","[{'version': 'v1', 'created': 'Fri, 11 Feb 2022 20:17:15 GMT'}]",2023-01-18,"[['Karishma', '', ''], ['Rao', 'Shrisha', '']]","['Task exploration', 'cooperative agents', 'resource constraints', 'multiagent system', 'Matthew Effect']"
12938,2012.12369,Daniel Lemire,"Daniel Lemire, Colin Bartlett, Owen Kaser",Integer Division by Constants: Optimal Bounds,,"Heliyon 7 (6), 2021",10.1016/j.heliyon.2021.e07442,"TR-20-001, Dept of CS, UNB Saint John",cs.DS,http://creativecommons.org/licenses/by/4.0/,"  The integer division of a numerator n by a divisor d gives a quotient q and a
remainder r. Optimizing compilers accelerate software by replacing the division
of n by d with the division of c * n (or c * n + c) by m for convenient
integers c and m chosen so that they approximate the reciprocal: c/m ~= 1/d.
Such techniques are especially advantageous when m is chosen to be a power of
two and when d is a constant so that c and m can be precomputed. The literature
contains many bounds on the distance between c/m and the divisor d. Some of
these bounds are optimally tight, while others are not. We present optimally
tight bounds for quotient and remainder computations.
","[{'version': 'v1', 'created': 'Tue, 22 Dec 2020 21:44:42 GMT'}, {'version': 'v2', 'created': 'Mon, 10 May 2021 19:07:35 GMT'}, {'version': 'v3', 'created': 'Tue, 29 Jun 2021 13:53:43 GMT'}]",2021-11-16,"[['Lemire', 'Daniel', ''], ['Bartlett', 'Colin', ''], ['Kaser', 'Owen', '']]","['Integer Division', 'Compiler Optimization', 'Tight Bounds']"
12939,2205.15258,Miri Zilka,"Miri Zilka, Holli Sargeant, Adrian Weller","Transparency, Governance and Regulation of Algorithmic Tools Deployed in
  the Criminal Justice System: a UK Case Study","AAAI/ACM Conference on AI, Ethics, and Society 2022",,10.1145/3514094.3534200,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  We present a survey of tools used in the criminal justice system in the UK in
three categories: data infrastructure, data analysis, and risk prediction. Many
tools are currently in deployment, offering potential benefits, including
improved efficiency and consistency. However, there are also important
concerns. Transparent information about these tools, their purpose, how they
are used, and by whom is difficult to obtain. Even when information is
available, it is often insufficient to enable a satisfactory evaluation. More
work is needed to establish governance mechanisms to ensure that tools are
deployed in a transparent, safe and ethical way. We call for more engagement
with stakeholders and greater documentation of the intended goal of a tool, how
it will achieve this goal compared to other options, and how it will be
monitored in deployment. We highlight additional points to consider when
evaluating the trustworthiness of deployed tools and make concrete proposals
for policy.
","[{'version': 'v1', 'created': 'Mon, 30 May 2022 17:12:17 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Jun 2022 20:43:56 GMT'}]",2022-06-03,"[['Zilka', 'Miri', ''], ['Sargeant', 'Holli', ''], ['Weller', 'Adrian', '']]","['Criminal Justice', 'Trustworthy AI', 'Policy', 'Governance and regulation', 'Algorithms in deployment']"
12940,1910.11621,Shumin Deng,"Shumin Deng, Ningyu Zhang, Jiaojian Kang, Yichi Zhang, Wei Zhang,
  Huajun Chen","Meta-Learning with Dynamic-Memory-Based Prototypical Network for
  Few-Shot Event Detection",Accepted by WSDM 2020,,10.1145/3336191.3371796,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Event detection (ED), a sub-task of event extraction, involves identifying
triggers and categorizing event mentions. Existing methods primarily rely upon
supervised learning and require large-scale labeled event datasets which are
unfortunately not readily available in many real-life applications. In this
paper, we consider and reformulate the ED task with limited labeled data as a
Few-Shot Learning problem. We propose a Dynamic-Memory-Based Prototypical
Network (DMB-PN), which exploits Dynamic Memory Network (DMN) to not only learn
better prototypes for event types, but also produce more robust sentence
encodings for event mentions. Differing from vanilla prototypical networks
simply computing event prototypes by averaging, which only consume event
mentions once, our model is more robust and is capable of distilling contextual
information from event mentions for multiple times due to the multi-hop
mechanism of DMNs. The experiments show that DMB-PN not only deals with sample
scarcity better than a series of baseline models but also performs more
robustly when the variety of event types is relatively large and the instance
quantity is extremely small.
","[{'version': 'v1', 'created': 'Fri, 25 Oct 2019 11:14:33 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Nov 2019 15:27:52 GMT'}]",2019-11-14,"[['Deng', 'Shumin', ''], ['Zhang', 'Ningyu', ''], ['Kang', 'Jiaojian', ''], ['Zhang', 'Yichi', ''], ['Zhang', 'Wei', ''], ['Chen', 'Huajun', '']]","['event extraction', 'prototypical network', 'dynamic memory network']"
12941,2110.09309,Maryem Rhanoui,"Sofia Lahrichi and Maryem Rhanoui and Mounia Mikram and Bouchra El
  Asri","Toward a multimodal multitask model for neurodegenerative diseases
  diagnosis and progression prediction",,,10.5220/0010600003220328,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Recent studies on modelling the progression of Alzheimer's disease use a
single modality for their predictions while ignoring the time dimension.
However, the nature of patient data is heterogeneous and time dependent which
requires models that value these factors in order to achieve a reliable
diagnosis, as well as making it possible to track and detect changes in the
progression of patients' condition at an early stage. This article overviews
various categories of models used for Alzheimer's disease prediction with their
respective learning methods, by establishing a comparative study of early
prediction and detection Alzheimer's disease progression. Finally, a robust and
precise detection model is proposed.
","[{'version': 'v1', 'created': 'Sun, 10 Oct 2021 11:44:16 GMT'}]",2021-10-19,"[['Lahrichi', 'Sofia', ''], ['Rhanoui', 'Maryem', ''], ['Mikram', 'Mounia', ''], ['Asri', 'Bouchra El', '']]","['alzheimer’s disease', 'multimodal multitask learning', 'machine learning', 'deep learning', 'progression detection', 'time series']"
12942,2012.12466,Abdulaziz Alhefdhi,"Abdulaziz Alhefdhi (1), Hoa Khanh Dam (1), Yusuf Sulistyo Nugroho (2),
  Hideaki Hata (3), Takashi Ishio (4), Aditya Ghose (1) ((1) University of
  Wollongong, (2) Universitas Muhammadiyah Surakarta, (3) Shinshu University,
  (4) Nara Institute of Science and Technology)","A Framework for Conditional Statement Technical Debt Identification and
  Description",,"Autom Softw Eng 29, 60 (2022)",10.1007/s10515-022-00364-8,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Technical Debt occurs when development teams favour short-term operability
over long-term stability. Since this places software maintainability at risk,
technical debt requires early attention to avoid paying for accumulated
interest. Most of the existing work focuses on detecting technical debt using
code comments, known as Self-Admitted Technical Debt (SATD). However, there are
many cases where technical debt instances are not explicitly acknowledged but
deeply hidden in the code. In this paper, we propose a framework that caters
for the absence of SATD comments in code. Our Self-Admitted Technical Debt
Identification and Description (SATDID) framework determines if technical debt
should be self-admitted for an input code fragment. If that is the case, SATDID
will automatically generate the appropriate descriptive SATD comment that can
be attached with the code. While our approach is applicable in principle to any
type of code fragments, we focus in this study on technical debt hidden in
conditional statements, one of the most TD-carrying parts of code. We explore
and evaluate different implementations of SATDID. The evaluation results
demonstrate the applicability and effectiveness of our framework over multiple
benchmarks. Comparing with the results from the benchmarks, our approach
provides at least 21.35%, 59.36%, 31.78%, and 583.33% improvements in terms of
Precision, Recall, F-1, and Bleu-4 scores, respectively. In addition, we
conduct human evaluation to the SATD comments generated by SATDID. In 1-5 and
0-5 scales for Acceptability and Understandability, the total means achieved by
our approach are 3.128 and 3.172, respectively.
","[{'version': 'v1', 'created': 'Wed, 23 Dec 2020 03:10:43 GMT'}, {'version': 'v2', 'created': 'Sun, 9 Jan 2022 07:15:39 GMT'}, {'version': 'v3', 'created': 'Thu, 13 Oct 2022 04:29:08 GMT'}]",2022-10-14,"[['Alhefdhi', 'Abdulaziz', ''], ['Dam', 'Hoa Khanh', ''], ['Nugroho', 'Yusuf Sulistyo', ''], ['Hata', 'Hideaki', ''], ['Ishio', 'Takashi', ''], ['Ghose', 'Aditya', '']]","['Software Analytics', 'Self-Admitted Technical Debt', 'SoftwareDocumentation', 'Software Quality', 'Machine Learning', 'Conditional Statements']"
12943,2206.00136,Kwanghyun Park,"Kwanghyun Park, Karla Saur, Dalitso Banda, Rathijit Sen, Matteo
  Interlandi, Konstantinos Karanasos",End-to-end Optimization of Machine Learning Prediction Queries,,,10.1145/3514221.3526141,,cs.DB cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Prediction queries are widely used across industries to perform advanced
analytics and draw insights from data. They include a data processing part
(e.g., for joining, filtering, cleaning, featurizing the datasets) and a
machine learning (ML) part invoking one or more trained models to perform
predictions. These parts have so far been optimized in isolation, leaving
significant opportunities for optimization unexplored. We present Raven, a
production-ready system for optimizing prediction queries. Raven follows the
enterprise architectural trend of collocating data and ML runtimes. It relies
on a unified intermediate representation that captures both data and ML
operators in a single graph structure to unlock two families of optimizations.
First, it employs logical optimizations that pass information between the data
part (and the properties of the underlying data) and the ML part to optimize
each other. Second, it introduces logical-to-physical transformations that
allow operators to be executed on different runtimes (relational, ML, and DNN)
and hardware (CPU, GPU). Novel data-driven optimizations determine the runtime
to be used for each part of the query to achieve optimal performance. Our
evaluation shows that Raven improves performance of prediction queries on
Apache Spark and SQL Server by up to 13.1x and 330x, respectively. For complex
models where GPU acceleration is beneficial, Raven provides up to 8x speedup
compared to state-of-the-art systems.
","[{'version': 'v1', 'created': 'Tue, 31 May 2022 22:39:14 GMT'}]",2022-06-02,"[['Park', 'Kwanghyun', ''], ['Saur', 'Karla', ''], ['Banda', 'Dalitso', ''], ['Sen', 'Rathijit', ''], ['Interlandi', 'Matteo', ''], ['Karanasos', 'Konstantinos', '']]","['query processing', 'query optimization', 'machine learning prediction']"
12944,2208.10846,Haonan Chen,"Haonan Chen, Zhicheng Dou, Yutao Zhu, Zhao Cao, Xiaohua Cheng, Ji-Rong
  Wen","Enhancing User Behavior Sequence Modeling by Generative Tasks for
  Session Search",,,10.1145/3511808.3557310,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Users' search tasks have become increasingly complicated, requiring multiple
queries and interactions with the results. Recent studies have demonstrated
that modeling the historical user behaviors in a session can help understand
the current search intent. Existing context-aware ranking models primarily
encode the current session sequence (from the first behavior to the current
query) and compute the ranking score using the high-level representations.
However, there is usually some noise in the current session sequence (useless
behaviors for inferring the search intent) that may affect the quality of the
encoded representations. To help the encoding of the current user behavior
sequence, we propose to use a decoder and the information of future sequences
and a supplemental query. Specifically, we design three generative tasks that
can help the encoder to infer the actual search intent: (1) predicting future
queries, (2) predicting future clicked documents, and (3) predicting a
supplemental query. We jointly learn the ranking task with these generative
tasks using an encoder-decoder structured approach. Extensive experiments on
two public search logs demonstrate that our model outperforms all existing
baselines, and the designed generative tasks can actually help the ranking
task. Besides, additional experiments also show that our approach can be easily
applied to various Transformer-based encoder-decoder models and improve their
performance.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2022 09:56:55 GMT'}]",2022-08-24,"[['Chen', 'Haonan', ''], ['Dou', 'Zhicheng', ''], ['Zhu', 'Yutao', ''], ['Cao', 'Zhao', ''], ['Cheng', 'Xiaohua', ''], ['Wen', 'Ji-Rong', '']]","['Auto-session-encoder', 'Session Search', 'Document Ranking']"
12945,2002.02576,Rose Bohrer,Rose Bohrer and Andr\'e Platzer,Refining Constructive Hybrid Games,40 pages. Extended preprint,,10.4230/LIPIcs.FSCD.2020.14,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We extend the constructive differential game logic (CdGL) of hybrid games
with a refinement connective that relates two hybrid games. We use this
connective to prove a folk theorem relating hybrid games to hybrid systems.
","[{'version': 'v1', 'created': 'Fri, 7 Feb 2020 01:06:28 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Feb 2020 01:50:37 GMT'}, {'version': 'v3', 'created': 'Thu, 13 Feb 2020 21:15:48 GMT'}]",2022-10-07,"[['Bohrer', 'Rose', ''], ['Platzer', 'André', '']]","['Hybrid Games', 'Constructive Logic', 'Refinement', 'Game Logic']"
12946,2006.12735,Ziaur Rahman,"Ratul Uddin Ashraf, Anujoy Das, Ziaur Rahman, Ali Newaz Bahar and
  Husne Ara Rubaiyeat","Helping Software Developers through Offline Repository Based API
  Searching in Data MiningIntegrated Environment","4 Pages, 4 Figures 3 Tables","2015 2nd International Conference on Electrical Information and
  Communication Technologies (EICT)",10.1109/EICT.2015.7392017,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Software development is getting changed so rapidly. It will be highly
benefited if we can accelerate software development process by guiding
developers. Appropriate guidelines and accurate recommendations to developers
during development process can reduce software development expenses, as well as
can save valuable times of developers. There are a number of approaches to
speed up the software development process. It can be done through code
assistance tools that help developers by recommending relevant items from
searching particular repository of Application Programming Interface (API).
Some approaches are based on online searching that have some drawbacks due to
request and response latency as it has to deal with the extra-large files in a
server. Developers generally uses previously completed resources as well as
libraries or frameworks to generate relevant snippets which are supplied by the
referral repository of APIs. Developers find it hard to choose the appropriate
methods as there are thousands of methods in which some are not properly
documented. In this paper we have proposed a concept and its respective
framework to guide developers that suggests relevant API methods from an
offline mined repository. From the investigation we made, we can say that our
approach works much better than some of the existing approaches.
","[{'version': 'v1', 'created': 'Sun, 21 Jun 2020 05:28:05 GMT'}]",2020-06-24,"[['Ashraf', 'Ratul Uddin', ''], ['Das', 'Anujoy', ''], ['Rahman', 'Ziaur', ''], ['Bahar', 'Ali Newaz', ''], ['Rubaiyeat', 'Husne Ara', '']]","['Application Programming Inteface (API)', 'Offline Repository', 'ORBAS', 'Data Mining Integrated Environment (DMIE)']"
12947,1909.11340,Aravind Sesagiri Raamkumar,"Aravind Sesagiri Raamkumar, Mojisola Erdt, Harsha Vijayakumar, Aarthy
  Nagarajan, Yin-Leng Theng",Understanding the Twitter Usage of Science Citation Index (SCI) Journals,"Paper accepted for presentation at 21st International Conference on
  Asia-Pacific Digital Libraries (ICADL 2019)",,10.1007/978-3-030-34058-2_6,,cs.DL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates the Twitter interaction patterns of journals from the
Science Citation Index (SCI) of Master Journal List (MJL). A total of 953,253
tweets extracted from 857 journal accounts, were analyzed in this study.
Findings indicate that SCI journals interacted more with each other but much
less with journals from other citation indices. The network structure of the
communication graph resembled a tight crowd network, with Nature journals
playing a major part. Information sources such as news portals and scientific
organizations were mentioned more in tweets, than academic journal Twitter
accounts. Journals with high journal impact factors (JIFs) were found to be
prominent hubs in the communication graph. Differences were found between the
Twitter usage of SCI journals with Humanities and Social Sciences (HSS)
journals.
","[{'version': 'v1', 'created': 'Wed, 25 Sep 2019 08:33:33 GMT'}]",2019-11-19,"[['Raamkumar', 'Aravind Sesagiri', ''], ['Erdt', 'Mojisola', ''], ['Vijayakumar', 'Harsha', ''], ['Nagarajan', 'Aarthy', ''], ['Theng', 'Yin-Leng', '']]","['Twitter', 'Journals', 'Science Citation Index', 'Social Network Analysis', 'Social Media']"
12948,2103.10461,Indra Agustian,"Indra Agustian, Novalio Daratha, Ruvita Faurina, Agus Suandi,
  Sulistyaningsih","Robot Manipulator Control with Inverse Kinematics PD-Pseudoinverse
  Jacobian and Forward Kinematics Denavit Hartenberg","The manuscript published in Jurnal Elektronika dan Telekomunikasi
  (JET), Vol. 21, No. 1, August 2021, pp. 8-18","Jurnal Elektronika dan Telekomunikasi (JET), 21(1), 8-18 (2021)",10.14203/jet.v21.8-18,,cs.RO cs.SY eess.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the development of vision-based robotic arm manipulator
control by applying Proportional Derivative-Pseudoinverse Jacobian (PD-PIJ)
kinematics and Denavit Hartenberg forward kinematics. The task of sorting
objects based on color is carried out to observe error propagation in the
implementation of manipulator on real system. The objects image captured by the
digital camera were processed based on HSV-color model and the centroid
coordinate of each object detected were calculated. These coordinates are end
effector position target to pick each object and were placed to the right
position based on its color. Based on the end effector position target, PD-PIJ
inverse kinematics method was used to determine the right angle of each joint
of manipulator links. The angles found by PD-PIJ is the input of DH forward
kinematics. The process was repeated until the square end effector reached the
target. The experiment of model and implementation to actual manipulator were
analyzed using Probability Density Function (PDF) and Weibull Probability
Distribution. The result shows that the manipulator navigation system had a
good performance. The real implementation of color sorting task on manipulator
shows the probability of success rate cm is 94.46% for euclidian distance error
less than 1.2 cm.
","[{'version': 'v1', 'created': 'Thu, 18 Mar 2021 18:18:53 GMT'}, {'version': 'v2', 'created': 'Tue, 31 Aug 2021 19:34:51 GMT'}]",2021-09-02,"[['Agustian', 'Indra', ''], ['Daratha', 'Novalio', ''], ['Faurina', 'Ruvita', ''], ['Suandi', 'Agus', ''], ['Sulistyaningsih', '', '']]","['robot manipulator', 'robotic arm', 'inverse kinematics', 'proportional derivative', 'pseudoinverse jacobian', 'forward kinematics', 'denavit hartenberg', 'color sorting']"
12949,2209.07795,Astrid Orcesi,"Adrien Maglo, Astrid Orcesi and Quoc Cuong Pham",KaliCalib: A Framework for Basketball Court Registration,"Accepted at ACM MMSports 2022 (5th International ACM Workshop on
  Multimedia Content Analysis in Sports)",,10.1145/3552437.3555701,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tracking the players and the ball in team sports is key to analyse the
performance or to enhance the game watching experience with augmented reality.
When the only sources for this data are broadcast videos, sports-field
registration systems are required to estimate the homography and re-project the
ball or the players from the image space to the field space. This paper
describes a new basketball court registration framework in the context of the
MMSports 2022 camera calibration challenge. The method is based on the
estimation by an encoder-decoder network of the positions of keypoints sampled
with perspective-aware constraints. The regression of the basket positions and
heavy data augmentation techniques make the model robust to different arenas.
Ablation studies show the positive effects of our contributions on the
challenge test set. Our method divides the mean squared error by 4.7 compared
to the challenge baseline.
","[{'version': 'v1', 'created': 'Fri, 16 Sep 2022 08:52:29 GMT'}]",2022-09-19,"[['Maglo', 'Adrien', ''], ['Orcesi', 'Astrid', ''], ['Pham', 'Quoc Cuong', '']]","['sports-field registration', 'neural networks', 'computer vision']"
12950,2006.11916,"Eyke H\""ullermeier","Vu-Linh Nguyen and Eyke H\""ullermeier and Michael Rapp and Eneldo Loza
  Menc\'ia and Johannes F\""urnkranz",On Aggregation in Ensembles of Multilabel Classifiers,"14 pages, 2 figures",Proc. DS 2020: 533-547,10.1007/978-3-030-61527-7_35,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While a variety of ensemble methods for multilabel classification have been
proposed in the literature, the question of how to aggregate the predictions of
the individual members of the ensemble has received little attention so far. In
this paper, we introduce a formal framework of ensemble multilabel
classification, in which we distinguish two principal approaches: ""predict then
combine"" (PTC), where the ensemble members first make loss minimizing
predictions which are subsequently combined, and ""combine then predict"" (CTP),
which first aggregates information such as marginal label probabilities from
the individual ensemble members, and then derives a prediction from this
aggregation. While both approaches generalize voting techniques commonly used
for multilabel ensembles, they allow to explicitly take the target performance
measure into account. Therefore, concrete instantiations of CTP and PTC can be
tailored to concrete loss functions. Experimentally, we show that standard
voting techniques are indeed outperformed by suitable instantiations of CTP and
PTC, and provide some evidence that CTP performs well for decomposable loss
functions, whereas PTC is the better choice for non-decomposable losses.
","[{'version': 'v1', 'created': 'Sun, 21 Jun 2020 21:43:24 GMT'}]",2020-12-09,"[['Nguyen', 'Vu-Linh', ''], ['Hüllermeier', 'Eyke', ''], ['Rapp', 'Michael', ''], ['Mencía', 'Eneldo Loza', ''], ['Fürnkranz', 'Johannes', '']]","['Ensembles of Multilabel Classifiers', 'Predict then Combine', 'Combine then Predict', 'Hamming loss', 'F-measure', 'Subset 0/1 loss']"
12951,2110.15606,Nobukatsu Kajiura,"Nobukatsu Kajiura, Hong Liu, Shin'ichi Satoh","Improving Camouflaged Object Detection with the Uncertainty of
  Pseudo-edge Labels",Accepted to ACM Multimedia Asia 2021,,10.1145/3469877.3490587,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper focuses on camouflaged object detection (COD), which is a task to
detect objects hidden in the background. Most of the current COD models aim to
highlight the target object directly while outputting ambiguous camouflaged
boundaries. On the other hand, the performance of the models considering edge
information is not yet satisfactory. To this end, we propose a new framework
that makes full use of multiple visual cues, i.e., saliency as well as edges,
to refine the predicted camouflaged map. This framework consists of three key
components, i.e., a pseudo-edge generator, a pseudo-map generator, and an
uncertainty-aware refinement module. In particular, the pseudo-edge generator
estimates the boundary that outputs the pseudo-edge label, and the conventional
COD method serves as the pseudo-map generator that outputs the pseudo-map
label. Then, we propose an uncertainty-based module to reduce the uncertainty
and noise of such two pseudo labels, which takes both pseudo labels as input
and outputs an edge-accurate camouflaged map. Experiments on various COD
datasets demonstrate the effectiveness of our method with superior performance
to the existing state-of-the-art methods.
","[{'version': 'v1', 'created': 'Fri, 29 Oct 2021 08:15:47 GMT'}]",2021-11-01,"[['Kajiura', 'Nobukatsu', ''], ['Liu', 'Hong', ''], ['Satoh', ""Shin'ichi"", '']]","['Uncertainty', 'camouflaged object detection', 'pseudo-edge/map synthesis', 'CVAE', 'camouflaged map refinement']"
12952,2203.06152,Travis LaCroix,Travis LaCroix,Moral Dilemmas for Moral Machines,AI Ethics (2022),,10.1007/s43681-022-00134-y,,cs.CY cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autonomous systems are being developed and deployed in situations that may
require some degree of ethical decision-making ability. As a result, research
in machine ethics has proliferated in recent years. This work has included
using moral dilemmas as validation mechanisms for implementing decision-making
algorithms in ethically-loaded situations. Using trolley-style problems in the
context of autonomous vehicles as a case study, I argue (1) that this is a
misapplication of philosophical thought experiments because (2) it fails to
appreciate the purpose of moral dilemmas, and (3) this has potentially
catastrophic consequences; however, (4) there are uses of moral dilemmas in
machine ethics that are appropriate and the novel situations that arise in a
machine-learning context can shed some light on philosophical work in ethics.
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2022 18:24:39 GMT'}]",2022-03-14,"[['LaCroix', 'Travis', '']]","['AI Ethics', 'Moral Dilemmas', 'Artificial Moral Agency', 'ThoughtExperiments']"
12953,2004.02118,Bang Liu,"Bang Liu, Weidong Guo, Di Niu, Jinwen Luo, Chaoyue Wang, Zhen Wen, Yu
  Xu",GIANT: Scalable Creation of a Web-scale Ontology,Accepted as full paper by SIGMOD 2020,,10.1145/3318464.3386145,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding what online users may pay attention to is key to content
recommendation and search services. These services will benefit from a highly
structured and web-scale ontology of entities, concepts, events, topics and
categories. While existing knowledge bases and taxonomies embody a large volume
of entities and categories, we argue that they fail to discover properly
grained concepts, events and topics in the language style of online population.
Neither is a logically structured ontology maintained among these notions. In
this paper, we present GIANT, a mechanism to construct a user-centered,
web-scale, structured ontology, containing a large number of natural language
phrases conforming to user attentions at various granularities, mined from a
vast volume of web documents and search click graphs. Various types of edges
are also constructed to maintain a hierarchy in the ontology. We present our
graph-neural-network-based techniques used in GIANT, and evaluate the proposed
methods as compared to a variety of baselines. GIANT has produced the Attention
Ontology, which has been deployed in various Tencent applications involving
over a billion users. Online A/B testing performed on Tencent QQ Browser shows
that Attention Ontology can significantly improve click-through rates in news
recommendation.
","[{'version': 'v1', 'created': 'Sun, 5 Apr 2020 07:51:23 GMT'}]",2020-04-07,"[['Liu', 'Bang', ''], ['Guo', 'Weidong', ''], ['Niu', 'Di', ''], ['Luo', 'Jinwen', ''], ['Wang', 'Chaoyue', ''], ['Wen', 'Zhen', ''], ['Xu', 'Yu', '']]","['Ontology Creation', 'Concept Mining', 'Event Mining', 'UserInterest Modeling', 'Document Understanding']"
12954,2202.06931,Heiko Gimperlein,"Siobhan Duncan, Gissell Estrada-Rodriguez, Jakub Stocek, Mauro
  Dragone, Patricia A. Vargas, Heiko Gimperlein","Efficient quantitative assessment of robot swarms: coverage and
  targeting L\'{e}vy strategies","28 pages, 11 figures, to appear in Bioinspiration & Biomimetics","Bioinspiration & Biomimetics 17 (2022), 036006",10.1088/1748-3190/ac57f0,,cs.RO nlin.AO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Biologically inspired strategies have long been adapted to swarm robotic
systems, including biased random walks, reaction to chemotactic cues and
long-range coordination. In this paper we apply analysis tools developed for
modeling biological systems, such as continuum descriptions, to the efficient
quantitative characterization of robot swarms. As an illustration, both
Brownian and L\'{e}vy strategies with a characteristic long-range movement are
discussed. As a result we obtain computationally fast methods for the
optimization of robot movement laws to achieve a prescribed collective
behavior. We show how to compute performance metrics like coverage and hitting
times, and illustrate the accuracy and efficiency of our approach for area
coverage and search problems. Comparisons between the continuum model and
robotic simulations confirm the quantitative agreement and speed up of our
approach. Results confirm and quantify the advantage of L\'{e}vy strategies
over Brownian motion for search and area coverage problems in swarm robotics.
","[{'version': 'v1', 'created': 'Mon, 14 Feb 2022 18:43:11 GMT'}]",2022-04-12,"[['Duncan', 'Siobhan', ''], ['Estrada-Rodriguez', 'Gissell', ''], ['Stocek', 'Jakub', ''], ['Dragone', 'Mauro', ''], ['Vargas', 'Patricia A.', ''], ['Gimperlein', 'Heiko', '']]","['Swarm robotics', 'multi-agent systems', 'diffusion equation', 'optimization', 'coverage', 'target search', 'L´evy walks']"
12955,2012.10389,Harshavardhan Kamarthi,"Aravind Venugopal, Elizabeth Bondi, Harshavardhan Kamarthi, Keval
  Dholakia, Balaraman Ravindran, Milind Tambe","Reinforcement Learning for Unified Allocation and Patrolling in
  Signaling Games with Uncertainty",Accepted at AAMAS 2021,,10.5555/3463952,page 1353-1361,cs.MA,http://creativecommons.org/licenses/by/4.0/,"  Green Security Games (GSGs) have been successfully used in the protection of
valuable resources such as fisheries, forests and wildlife. While real-world
deployment involves both resource allocation and subsequent coordinated
patrolling with communication and real-time, uncertain information, previous
game models do not fully address both of these stages simultaneously.
Furthermore, adopting existing solution strategies is difficult since they do
not scale well for larger, more complex variants of the game models.
  We therefore first propose a novel GSG model that combines defender
allocation, patrolling, real-time drone notification to human patrollers, and
drones sending warning signals to attackers. The model further incorporates
uncertainty for real-time decision-making within a team of drones and human
patrollers. Second, we present CombSGPO, a novel and scalable algorithm based
on reinforcement learning, to compute a defender strategy for this game model.
CombSGPO performs policy search over a multi-dimensional, discrete action space
to compute an allocation strategy that is best suited to a best-response
patrolling strategy for the defender, learnt by training a multi-agent Deep
Q-Network. We show via experiments that CombSGPO converges to better strategies
and is more scalable than comparable approaches. Third, we provide a detailed
analysis of the coordination and signaling behavior learnt by CombSGPO, showing
group formation between defender resources and patrolling formations based on
signaling and notifications between resources. Importantly, we find that
strategic signaling emerges in the final learnt strategy. Finally, we perform
experiments to evaluate these strategies under different levels of uncertainty.
","[{'version': 'v1', 'created': 'Fri, 18 Dec 2020 17:53:39 GMT'}]",2021-06-09,"[['Venugopal', 'Aravind', ''], ['Bondi', 'Elizabeth', ''], ['Kamarthi', 'Harshavardhan', ''], ['Dholakia', 'Keval', ''], ['Ravindran', 'Balaraman', ''], ['Tambe', 'Milind', '']]","['Reinforcement Learning', 'Multi-agent Systems', 'Green Security Games']"
12956,2107.07296,Christophe De Troyer,"Christophe De Troyer (Vrije Universiteit Brussel, Belgium), Jens
  Nicolay (Vrije Universiteit Brussel, Belgium), Wolfgang De Meuter (Vrije
  Universiteit Brussel, Belgium)",The Art of the Meta Stream Protocol: Torrents of Streams,,"The Art, Science, and Engineering of Programming, 2022, Vol. 6,
  Issue 1, Article 2",10.22152/programming-journal.org/2022/6/2,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rise of streaming libraries such as Akka Stream, Reactive Extensions, and
LINQ popularized the declarative functional style of data processing. The
stream paradigm offers concise syntax to write down processing pipelines to
consume the vast amounts of real-time data available today. These libraries
offer the programmer a domain specific language (DSL) embedded in the host
language to describe data streams. These libraries however, all suffer from
extensibility issues. The semantics of a stream is hard-coded into the DSL
language and cannot be changed by the user of the library. We introduce an
approach to modify the semantics of a streaming library by means of
meta-programming at both run-time and compile-time, and showcase its
generality. We show that the expressiveness of the meta-facilities is strong
enough to enable push and pull semantics, error handling, parallelism, and
operator fusion. We evaluate our work by implementing the identified
shortcomings in terms of a novel stream meta-architecture and show that its
design and architecture adhere to the design principles of a meta-level
architecture. The state of the art offers plenty of choice to programmers
regarding reactive stream processing libraries. Expressing reactive systems is
otherwise difficult to do in general purpose languages. Extensibility and
fine-tuning should be possible in these libraries to ensure a broad variety of
applications can be expressed within this single DSL.
","[{'version': 'v1', 'created': 'Thu, 15 Jul 2021 13:03:25 GMT'}]",2021-07-16,"[['De Troyer', 'Christophe', '', 'Vrije Universiteit Brussel, Belgium'], ['Nicolay', 'Jens', '', 'Vrije Universiteit Brussel, Belgium'], ['De Meuter', 'Wolfgang', '', 'Vrije\n  Universiteit Brussel, Belgium']]","['stream processing', 'functional programming', 'extensibility', 'meta-programming', 'library design']"
12957,1803.10831,Anthony Anjorin,"Anthony Anjorin (Paderborn University, Germany), Enes Yigitbas
  (Paderborn University, Germany), Erhan Leblebici (TU Darmstadt, Germany),
  Andy Sch\""urr (TU Darmstadt, Germany), Marius Lauder (Continental Automotive
  GmbH, Germany, Germany), Martin Witte (Siemens AG, Germany)","Description Languages for Consistency Management Scenarios Based on
  Examples from the Industry Automation Domain",,"The Art, Science, and Engineering of Programming, 2018, Vol. 2,
  Issue 3, Article 7",10.22152/programming-journal.org/2018/2/7,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To cope with the increasing complexity of developing and maintaining modern
(software) systems, multiple abstractions (models) of the same system can be
established and used to allow different domain experts to collaborate and
contribute their respective expertise. This divide-and-conquer, model-based
approach requires, however, support for a concurrent engineering process, i.e.,
providing a means of checking, restoring, and ensuring the consistency of all
involved and concurrently maintained models. The task of providing such support
is often referred to as consistency management.
  Although there exist various approaches to consistency management and
numerous (industrial) case studies described in the literature on bidirectional
transformations (bx), there is currently no uniform description of diverse but
related industrial applications of model synchronisation and other forms of
consistency management. This makes it challenging to detect similarities and
differences related to requirements, constraints, applied techniques and tools.
It is thus difficult to compare and transfer knowledge gained from (successful)
projects to other bx approaches or even other bx tools for the same general
approach.
  In this paper, therefore, we propose a description language for envisioned
scenarios in the problem domain of consistency management, as well as a
complementary description language for solution strategies in terms of method
fragments and method patterns in the solution domain of Model-Driven
Engineering (MDE). Our work is inspired by previous research in the bx and MDE
communities, and is also based on our collective experience from over ten years
of investigating a series of application scenarios in the industry automation
section together with Siemens AG as an industrial partner. [Abridged due to
arXiv]
","[{'version': 'v1', 'created': 'Wed, 28 Mar 2018 19:57:59 GMT'}]",2018-03-30,"[['Anjorin', 'Anthony', '', 'Paderborn University, Germany'], ['Yigitbas', 'Enes', '', 'Paderborn University, Germany'], ['Leblebici', 'Erhan', '', 'TU Darmstadt, Germany'], ['Schürr', 'Andy', '', 'TU Darmstadt, Germany'], ['Lauder', 'Marius', '', 'Continental Automotive\n  GmbH, Germany, Germany'], ['Witte', 'Martin', '', 'Siemens AG, Germany']]","['Consistency Management', 'Bidirectional Model Transformations', 'Method Engineering', 'Industry']"
12958,2106.14007,Ravi Vadlamani,"Yelleti Vivek, Vadlamani Ravi and Pisipati Radhakrishna","Scalable Feature Subset Selection for Big Data using Parallel Hybrid
  Evolutionary Algorithm based Wrapper in Apache Spark","28 pages, 10 Tables and 6 figures",,10.1007/s10586-022-03725-w,,cs.NE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Owing to the emergence of large datasets, applying current sequential
wrapper-based feature subset selection (FSS) algorithms increases the
complexity. This limitation motivated us to propose a wrapper for feature
subset selection (FSS) based on parallel and distributed hybrid evolutionary
algorithms (EAs) under the Apache Spark environment. The hybrid EAs are based
on the BDE and Binary Threshold Accepting (BTA), a point-based EA, which is
invoked to enhance the search capability and avoid premature convergence of the
PB-DE. Thus, we designed the hybrid variants (i) parallel binary differential
evolution and threshold accepting (PB-DETA), where DE and TA work in tandem in
every iteration, and (ii) parallel binary threshold accepting and differential
evolution (PB-TADE), where TA and DE work in tandem in every iteration under
the Apache Spark environment. Both PB-DETA and PB-TADE are compared with the
baseline, viz., the parallel version of the binary differential evolution
(PB-DE). All three proposed approaches use logistic regression (LR) to compute
the fitness function, namely, the area under ROC curve (AUC). The effectiveness
of the proposed algorithms is tested over the five large datasets of varying
feature space dimension, taken from cyber security and biology domains. It is
noteworthy that the PB-TADE turned out to be statistically significant compared
to PB-DE and PB-DETA. We reported the speedup analysis, average AUC obtained by
the most repeated feature subset, feature subset with high AUC and least
cardinality.
","[{'version': 'v1', 'created': 'Sat, 26 Jun 2021 11:59:02 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Jul 2021 05:43:32 GMT'}, {'version': 'v3', 'created': 'Tue, 25 Jan 2022 05:35:46 GMT'}]",2022-10-28,"[['Vivek', 'Yelleti', ''], ['Ravi', 'Vadlamani', ''], ['Radhakrishna', 'Pisipati', '']]","['Feature Subset Selection', 'Apache Spark', 'Differential Evolution', 'Threshold Accepting', 'MapReduce', 'Multithreading.  1']"
12959,2211.09865,Thomas Misa,Thomas J. Misa,Gender Bias in Big Data Analysis,"27 pages, 1 figure, 3 tables","Information & Culture, Volume 57, Number 3, 2022, pp. 283-306",10.7560/IC57303,,cs.CY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This article combines humanistic ""data critique"" with informed inspection of
big data analysis. It measures gender bias when gender prediction software
tools (Gender API, Namsor, and Genderize.io) are used in historical big data
research. Gender bias is measured by contrasting personally identified computer
science authors in the well-regarded DBLP dataset (1950-1980) with exactly
comparable results from the software tools. Implications for public
understanding of gender bias in computing and the nature of the computing
profession are outlined. Preliminary assessment of the Semantic Scholar dataset
is presented. The conclusion combines humanistic approaches with selective use
of big data methods.
","[{'version': 'v1', 'created': 'Thu, 17 Nov 2022 20:13:04 GMT'}]",2022-11-21,"[['Misa', 'Thomas J.', '']]","['gender bias', 'algorithmic bias', 'big data', 'history of computing', 'computer science research', 'digital humanities']"
12960,2111.11026,Jianhuan Zhuo,"Jianhuan Zhuo, Qiannan Zhu, Yinliang Yue and Yuhong Zhao",Learning Explicit User Interest Boundary for Recommendation,"12 pages, 9 figures, 5 tables",,10.1145/3485447.3511971,,cs.IR cs.AI,http://creativecommons.org/licenses/by/4.0/,"  The core objective of modelling recommender systems from implicit feedback is
to maximize the positive sample score $s_p$ and minimize the negative sample
score $s_n$, which can usually be summarized into two paradigms: the pointwise
and the pairwise. The pointwise approaches fit each sample with its label
individually, which is flexible in weighting and sampling on instance-level but
ignores the inherent ranking property. By qualitatively minimizing the relative
score $s_n - s_p$, the pairwise approaches capture the ranking of samples
naturally but suffer from training efficiency. Additionally, both approaches
are hard to explicitly provide a personalized decision boundary to determine if
users are interested in items unseen. To address those issues, we innovatively
introduce an auxiliary score $b_u$ for each user to represent the User Interest
Boundary(UIB) and individually penalize samples that cross the boundary with
pairwise paradigms, i.e., the positive samples whose score is lower than $b_u$
and the negative samples whose score is higher than $b_u$. In this way, our
approach successfully achieves a hybrid loss of the pointwise and the pairwise
to combine the advantages of both. Analytically, we show that our approach can
provide a personalized decision boundary and significantly improve the training
efficiency without any special sampling strategy. Extensive results show that
our approach achieves significant improvements on not only the classical
pointwise or pairwise models but also state-of-the-art models with complex loss
function and complicated feature encoding.
","[{'version': 'v1', 'created': 'Mon, 22 Nov 2021 07:26:51 GMT'}]",2022-03-01,"[['Zhuo', 'Jianhuan', ''], ['Zhu', 'Qiannan', ''], ['Yue', 'Yinliang', ''], ['Zhao', 'Yuhong', '']]","['Recommender System', 'Loss Function', 'User Interest Boundary']"
12961,2009.09928,Yue Liu,"Yue Liu, Alex Colburn, Mehlika Inanici",Deep Neural Network Approach for Annual Luminance Simulations,,,10.1080/19401493.2020.1803404,,cs.CV cs.GR cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Annual luminance maps provide meaningful evaluations for occupants' visual
comfort, preferences, and perception. However, acquiring long-term luminance
maps require labor-intensive and time-consuming simulations or impracticable
long-term field measurements. This paper presents a novel data-driven machine
learning approach that makes annual luminance-based evaluations more efficient
and accessible. The methodology is based on predicting the annual luminance
maps from a limited number of point-in-time high dynamic range imagery by
utilizing a deep neural network (DNN). Panoramic views are utilized, as they
can be post-processed to study multiple view directions. The proposed DNN model
can faithfully predict high-quality annual panoramic luminance maps from one of
the three options within 30 minutes training time: a) point-in-time luminance
imagery spanning 5% of the year, when evenly distributed during daylight hours,
b) one-month hourly imagery generated or collected continuously during daylight
hours around the equinoxes (8% of the year); or c) 9 days of hourly data
collected around the spring equinox, summer and winter solstices (2.5% of the
year) all suffice to predict the luminance maps for the rest of the year. The
DNN predicted high-quality panoramas are validated against Radiance (RPICT)
renderings using a series of quantitative and qualitative metrics. The most
efficient predictions are achieved with 9 days of hourly data collected around
the spring equinox, summer and winter solstices. The results clearly show that
practitioners and researchers can efficiently incorporate long-term
luminance-based metrics over multiple view directions into the design and
research processes using the proposed DNN workflow.
","[{'version': 'v1', 'created': 'Mon, 14 Sep 2020 20:19:21 GMT'}]",2020-09-22,"[['Liu', 'Yue', ''], ['Colburn', 'Alex', ''], ['Inanici', 'Mehlika', '']]","['daylighting simulation', 'luminance maps', 'machine learning', 'neural networks', 'HDR imagery', 'panoramic view']"
12962,2209.11492,Yanling Tian,"Yanling Tian and Di Chen and Yunan Liu and Shanshan Zhang and Jian
  Yang",Grouped Adaptive Loss Weighting for Person Search,Accepted by ACM MM,,10.1145/3503161.3547779,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Person search is an integrated task of multiple sub-tasks such as
foreground/background classification, bounding box regression and person
re-identification. Therefore, person search is a typical multi-task learning
problem, especially when solved in an end-to-end manner. Recently, some works
enhance person search features by exploiting various auxiliary information,
e.g. person joint keypoints, body part position, attributes, etc., which brings
in more tasks and further complexifies a person search model. The inconsistent
convergence rate of each task could potentially harm the model optimization. A
straightforward solution is to manually assign different weights to different
tasks, compensating for the diverse convergence rates. However, given the
special case of person search, i.e. with a large number of tasks, it is
impractical to weight the tasks manually. To this end, we propose a Grouped
Adaptive Loss Weighting (GALW) method which adjusts the weight of each task
automatically and dynamically. Specifically, we group tasks according to their
convergence rates. Tasks within the same group share the same learnable weight,
which is dynamically assigned by considering the loss uncertainty. Experimental
results on two typical benchmarks, CUHK-SYSU and PRW, demonstrate the
effectiveness of our method.
","[{'version': 'v1', 'created': 'Fri, 23 Sep 2022 09:32:54 GMT'}]",2022-09-26,"[['Tian', 'Yanling', ''], ['Chen', 'Di', ''], ['Liu', 'Yunan', ''], ['Zhang', 'Shanshan', ''], ['Yang', 'Jian', '']]","['person search', 'loss weighting', 'task grouping', 'multi-task learning']"
12963,1403.0335,Sanjaya Kumar Panda,"Sanjaya Kumar Panda, Debasis Dash, Jitendra Kumar Rout","A Group based Time Quantum Round Robin Algorithm using Min-Max Spread
  Measure","7 pages, 16 figures",International Journal of Computer Applications 2013,10.5120/10667-5445,pxc3885445,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Round Robin (RR) Scheduling is the basis of time sharing environment. It is
the combination of First Come First Served (FCFS) scheduling algorithm and
preemption among processes. It is basically used in a time sharing operating
system. It switches from one process to another process in a time interval. The
time interval or Time Quantum (TQ) is fixed for all available processes. So,
the larger process suffers from Context Switches (CS). To increase efficiency,
we have to select different TQ for processes. The main objective of RR is to
reduce the CS, maximize the utilization of CPU and minimize the turn around and
the waiting time. In this paper, we have considered different TQ for a group of
processes. It reduces CS as well as enhancing the performance of RR algorithm.
TQ can be calculated using min-max dispersion measure. Our experimental
analysis shows that Group Based Time Quantum (GBTQ) RR algorithm performs
better than existing RR algorithm with respect to Average Turn Around Time
(ATAT), Average Waiting Time (AWT) and CS.
","[{'version': 'v1', 'created': 'Mon, 3 Mar 2014 08:27:29 GMT'}]",2014-03-04,"[['Panda', 'Sanjaya Kumar', ''], ['Dash', 'Debasis', ''], ['Rout', 'Jitendra Kumar', '']]","['Round Robin', 'Time Quantum', 'Min-Max', 'Ready Queue', 'Group Based Time Quantum']"
12964,2012.14649,EungChang Lee,"EungChang Mason Lee, Duckyu Choi, and Hyun Myung","Peacock Exploration: A Lightweight Exploration for UAV using
  Control-Efficient Trajectory",10 pages,,10.1007/978-981-16-4803-8_16,,cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Unmanned Aerial Vehicles have received much attention in recent years due to
its wide range of applications, such as exploration of an unknown environment
to acquire a 3D map without prior knowledge of it. Existing exploration methods
have been largely challenged by computationally heavy probabilistic path
planning. Similarly, kinodynamic constraints or proper sensors considering the
payload for UAVs were not considered. In this paper, to solve those issues and
to consider the limited payload and computational resource of UAVs, we propose
""Peacock Exploration"": A lightweight exploration method for UAVs using
precomputed minimum snap trajectories which look like a peacock's tail. Using
the widely known, control efficient minimum snap trajectories and OctoMap, the
UAV equipped with a RGB-D camera can explore unknown 3D environments without
any prior knowledge or human-guidance with only O(logN) computational
complexity. It also adopts the receding horizon approach and simple, heuristic
scoring criteria. The proposed algorithm's performance is demonstrated by
exploring a challenging 3D maze environment and compared with a
state-of-the-art algorithm.
","[{'version': 'v1', 'created': 'Tue, 29 Dec 2020 08:03:08 GMT'}]",2021-08-06,"[['Lee', 'EungChang Mason', ''], ['Choi', 'Duckyu', ''], ['Myung', 'Hyun', '']]","['Exploration', 'Active SLAM', 'Unmanned Aerial Vehicle', 'Control', 'Path Planning']"
12965,2009.03066,Jaume Bosch,"Jaume Bosch, Carlos \'Alvarez, Daniel Jim\'enez-Gonz\'alez, Xavier
  Martorell, Eduard Ayguad\'e","Asynchronous Runtime with Distributed Manager for Task-based Programming
  Models",2020 Parallel Computing,"Parallel Computing, Volume 97, 2020",10.1016/j.parco.2020.102664,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parallel task-based programming models, like OpenMP, allow application
developers to easily create a parallel version of their sequential codes. The
standard OpenMP 4.0 introduced the possibility of describing a set of data
dependences per task that the runtime uses to order the tasks execution. This
order is calculated using shared graphs, which are updated by all threads in
exclusive access using synchronization mechanisms (locks) to ensure the
dependence management correctness. The contention in the access to these
structures becomes critical in many-core systems because several threads may be
wasting computation resources waiting their turn.
  This paper proposes an asynchronous management of the runtime structures,
like task dependence graphs, suitable for task-based programming model
runtimes. In such organization, the threads request actions to the runtime
instead of doing them directly. The requests are then handled by a distributed
runtime manager (DDAST) which does not require dedicated resources. Instead,
the manager uses the idle threads to modify the runtime structures. The paper
also presents an implementation, analysis and performance evaluation of such
runtime organization. The performance results show that the proposed
asynchronous organization outperforms the speedup obtained by the original
runtime for different benchmarks and different many-core architectures.
","[{'version': 'v1', 'created': 'Mon, 7 Sep 2020 12:46:25 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Sep 2020 06:21:12 GMT'}]",2020-09-09,"[['Bosch', 'Jaume', ''], ['Álvarez', 'Carlos', ''], ['Jiménez-González', 'Daniel', ''], ['Martorell', 'Xavier', ''], ['Ayguadé', 'Eduard', '']]","['OmpSs', 'OpenMP', 'Task-Based', 'Task-Graph', 'Dependence Manager', 'Runtime']"
12966,2201.03061,Arut Prakash Kaleeswaran,"Arut Prakash Kaleeswaran, Arne Nordmann, Thomas Vogel, Lars Grunske",A systematic literature review on counterexample explanation,Accepted Manuscript. Information and Software Technology,"Information and Software Technology, Volume 145, December 2021,
  106800",10.1016/j.infsof.2021.106800,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Context: Safety is of paramount importance for cyber-physical systems in
domains such as automotive, robotics, and avionics. Formal methods such as
model checking are one way to ensure the safety of cyber-physical systems.
However, adoption of formal methods in industry is hindered by usability
issues, particularly the difficulty of understanding model checking results.
Objective: We want to provide an overview of the state of the art for
counterexample explanation by investigating the contexts, techniques, and
evaluation of research approaches in this field. This overview shall provide an
understanding of current and guide future research. Method: To provide this
overview, we conducted a systematic literature review. The survey comprises 116
publications that address counterexample explanations for model checking.
Results: Most primary studies provide counterexample explanations graphically
or as traces, minimize counterexamples to reduce complexity, localize errors in
the models expressed in the input formats of model checkers, support linear
temporal logic or computation tree logic specifications, and use model checkers
of the Symbolic Model Verifier family. Several studies evaluate their
approaches in safety-critical domains with industrial applications. Conclusion:
We notably see a lack of research on counterexample explanation that targets
probabilistic and real-time systems, leverages the explanations to
domain-specific models, and evaluates approaches in user studies. We conclude
by discussing the adequacy of different types of explanations for users with
varying domain and formal methods expertise, showing the need to support
laypersons in understanding model checking results to increase adoption of
formal methods in industry.
","[{'version': 'v1', 'created': 'Sun, 9 Jan 2022 17:46:34 GMT'}]",2022-01-14,"[['Kaleeswaran', 'Arut Prakash', ''], ['Nordmann', 'Arne', ''], ['Vogel', 'Thomas', ''], ['Grunske', 'Lars', '']]","['formal methods', 'model checking', 'counterexample explanation']"
12967,2202.05817,Andrea Poltronieri,Andrea Poltronieri and Aldo Gangemi,"The HaMSE Ontology: Using Semantic Technologies to support Music
  Representation Interoperability and Musicological Analysis",,,10.5281/zenodo.6047780,,cs.SD cs.AI cs.MM eess.AS,http://creativecommons.org/licenses/by-sa/4.0/,"  The use of Semantic Technologies - in particular the Semantic Web - has
revealed to be a great tool for describing the cultural heritage domain and
artistic practices. However, the panorama of ontologies for musicological
applications seems to be limited and restricted to specific applications. In
this research, we propose HaMSE, an ontology capable of describing musical
features that can assist musicological research. More specifically, HaMSE
proposes to address sues that have been affecting musicological research for
decades: the representation of music and the relationship between quantitative
and qualitative data. To do this, HaMSE allows the alignment between different
music representation systems and describes a set of musicological features that
can allow the music analysis at different granularity levels.
","[{'version': 'v1', 'created': 'Fri, 11 Feb 2022 18:26:24 GMT'}]",2022-05-17,"[['Poltronieri', 'Andrea', ''], ['Gangemi', 'Aldo', '']]","['Ontology', 'Computational Musicology', 'Music Information Retrieval', 'RDF', 'OWL', 'Semantic Web']"
12968,1904.04377,Tarik A. Rashid,Tarik A. Rashid and Hawraz A. Ahmad,"Lecturer Performance System Using Neural Network with Particle Swarm
  Optimization",20 pages,"Computer Applications in Engineering Education. Wiley publication,
  2016",10.1002/cae.21737,,cs.NE,http://creativecommons.org/licenses/by-sa/4.0/,"  The field of analyzing performance is very important and sensitive in
particular when it is related to the performance of lecturers in academic
institutions. Locating the weak points of lecturers through a system that
provides an early warning to notify or reward the lecturers with warned or
punished notices will help them to improve their weaknesses, leads to a better
quality in the institutions. The current system has major issues in the higher
education at Salahaddin University-Erbil (SUE) in Kurdistan-Iraq. These issues
are: first, the assessment of lecturers' activities is conducted traditionally
via the Quality Assurance Teams at different departments and colleges at the
university, second, the outcomes in some cases of lecturers' performance
provoke a low level of acceptance among lectures, as these cases are reflected
and viewed by some academic communities as unfair cases, and finally, the
current system is not accurate and vigorous. In this paper, Particle Swarm
Optimization Neural Network is used to assess performance of lecturers in more
fruitful way and also to enhance the accuracy of recognition system. Different
real and novel data sets are collected from SUE. The prepared datasets
preprocessed and important features are then fed as input source to the
training and testing phases. Particle Swarm Optimization is used to find the
best weights and biases in the training phase of the neural network. The best
accuracy rate obtained in the test phase is 98.28 %.
","[{'version': 'v1', 'created': 'Mon, 8 Apr 2019 21:58:05 GMT'}]",2019-04-10,"[['Rashid', 'Tarik A.', ''], ['Ahmad', 'Hawraz A.', '']]","['Particle Swarm Optimization', 'Neural Network', 'Lecturer Performance Analysis', 'Classification']"
12969,1506.05533,Kim-Kwang Raymond Choo,"Ben Martini, Quang Do, Kim-Kwang Raymond Choo",Mobile Cloud Forensics: An Analysis of Seven Popular Android Apps,"Book Chapter in Cloud Security Ecosystem (Syngress, an Imprint of
  Elsevier), 2015",,10.1016/B978-0-12-801595-7.00015-X,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using the evidence collection and analysis methodology for Android devices
proposed by Martini, Do and Choo, we examined and analyzed seven popular
Android cloud-based apps. Firstly, we analyzed each app in order to see what
information could be obtained from their private app storage and SD card
directories. We collated the information and used it to aid our investigation
of each app database files and AccountManager data. To complete our
understanding of the forensic artefacts stored by apps we analyzed, we
performed further analysis on the apps to determine if the user authentication
credentials could be collected for each app based on the information gained in
the initial analysis stages. The contributions of this research include a
detailed description of artefacts, which are of general forensic interest, for
each app analyzed.
","[{'version': 'v1', 'created': 'Thu, 18 Jun 2015 02:17:20 GMT'}]",2015-06-19,"[['Martini', 'Ben', ''], ['Do', 'Quang', ''], ['Choo', 'Kim-Kwang Raymond', '']]","['Cloud forensics', 'Digital forensics', 'Dropbox', 'Mobile forensics', 'OAuth', 'OneDrive']"
12970,2206.03390,Aylin Caliskan,"Aylin Caliskan, Pimparkar Parth Ajay, Tessa Charlesworth, Robert
  Wolfe, Mahzarin R. Banaji","Gender Bias in Word Embeddings: A Comprehensive Analysis of Frequency,
  Syntax, and Semantics","15 pages, 6 figures, accepted to AAAI/ACM Artificial Intelligence,
  Ethics, and Society",,10.1145/3514094.3534162,,cs.CY cs.AI cs.CL cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The statistical regularities in language corpora encode well-known social
biases into word embeddings. Here, we focus on gender to provide a
comprehensive analysis of group-based biases in widely-used static English word
embeddings trained on internet corpora (GloVe 2014, fastText 2017). Using the
Single-Category Word Embedding Association Test, we demonstrate the widespread
prevalence of gender biases that also show differences in: (1) frequencies of
words associated with men versus women; (b) part-of-speech tags in
gender-associated words; (c) semantic categories in gender-associated words;
and (d) valence, arousal, and dominance in gender-associated words.
  First, in terms of word frequency: we find that, of the 1,000 most frequent
words in the vocabulary, 77% are more associated with men than women, providing
direct evidence of a masculine default in the everyday language of the
English-speaking world. Second, turning to parts-of-speech: the top
male-associated words are typically verbs (e.g., fight, overpower) while the
top female-associated words are typically adjectives and adverbs (e.g., giving,
emotionally). Gender biases in embeddings also permeate parts-of-speech. Third,
for semantic categories: bottom-up, cluster analyses of the top 1,000 words
associated with each gender. The top male-associated concepts include roles and
domains of big tech, engineering, religion, sports, and violence; in contrast,
the top female-associated concepts are less focused on roles, including,
instead, female-specific slurs and sexual content, as well as appearance and
kitchen terms. Fourth, using human ratings of word valence, arousal, and
dominance from a ~20,000 word lexicon, we find that male-associated words are
higher on arousal and dominance, while female-associated words are higher on
valence.
","[{'version': 'v1', 'created': 'Tue, 7 Jun 2022 15:35:10 GMT'}]",2022-06-08,"[['Caliskan', 'Aylin', ''], ['Ajay', 'Pimparkar Parth', ''], ['Charlesworth', 'Tessa', ''], ['Wolfe', 'Robert', ''], ['Banaji', 'Mahzarin R.', '']]","['word embeddings', 'AI bias', 'gender bias', 'psycholinguistics', 'representation', 'masculine default']"
12971,2006.01358,Sandra Ramirez,"Sandra L. Ram\'irez-Mora, Hanna Oktaba, Helena G\'omez-Adorno","Descriptions of issues and comments for predicting issue success in
  software projects",65 pages; 15 figures,"Journal of Systems and Software, Vol. 168, 2020, 110663, ISSN
  0164-1212",10.1016/j.jss.2020.110663,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Software development tasks must be performed successfully to achieve software
quality and customer satisfaction. Knowing whether software tasks are likely to
fail is essential to ensure the success of software projects. Issue Tracking
Systems store information of software tasks (issues) and comments, which can be
useful to predict issue success; however; almost no research on this topic
exists. This work studies the usefulness of textual descriptions of issues and
comments for predicting whether issues will be resolved successfully or not.
Issues and comments of 588 software projects were extracted from four popular
Issue Tracking Systems. Seven machine learning classifiers were trained on 30k
issues and more than 120k comments, and more than 6000 experiments were
performed to predict the success of three types of issues: bugs, improvements
and new features. The results provided evidence that descriptions of issues and
comments are useful for predicting issue success with more than 85% of accuracy
and precision, and that the predictions of issue success vary over time. Words
related to software development were particularly relevant for predicting issue
success. Other communication aspects and their relationship to the success of
software projects must be researched in detail using data from software tools.
","[{'version': 'v1', 'created': 'Tue, 2 Jun 2020 02:49:22 GMT'}]",2020-06-03,"[['Ramírez-Mora', 'Sandra L.', ''], ['Oktaba', 'Hanna', ''], ['Gómez-Adorno', 'Helena', '']]","['Software development', 'Software project', 'Issue success', 'Machinelearning', 'Issue Tracking System']"
12972,2208.10441,Gustav Eje Henter,"Youngwoo Yoon, Pieter Wolfert, Taras Kucherenko, Carla Viegas, Teodor
  Nikolov, Mihail Tsakov, Gustav Eje Henter","The GENEA Challenge 2022: A large evaluation of data-driven co-speech
  gesture generation","12 pages, 5 figures; final version for ACM ICMI 2022",,10.1145/3536221.3558058,,cs.HC cs.GR cs.LG cs.MM cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper reports on the second GENEA Challenge to benchmark data-driven
automatic co-speech gesture generation. Participating teams used the same
speech and motion dataset to build gesture-generation systems. Motion generated
by all these systems was rendered to video using a standardised visualisation
pipeline and evaluated in several large, crowdsourced user studies. Unlike when
comparing different research papers, differences in results are here only due
to differences between methods, enabling direct comparison between systems.
This year's dataset was based on 18 hours of full-body motion capture,
including fingers, of different persons engaging in dyadic conversation. Ten
teams participated in the challenge across two tiers: full-body and upper-body
gesticulation. For each tier we evaluated both the human-likeness of the
gesture motion and its appropriateness for the specific speech signal. Our
evaluations decouple human-likeness from gesture appropriateness, which
previously was a major challenge in the field.
  The evaluation results are a revolution, and a revelation. Some synthetic
conditions are rated as significantly more human-like than human motion
capture. To the best of our knowledge, this has never been shown before on a
high-fidelity avatar. On the other hand, all synthetic motion is found to be
vastly less appropriate for the speech than the original motion-capture
recordings. Additional material is available via the project website at
https://youngwoo-yoon.github.io/GENEAchallenge2022/
","[{'version': 'v1', 'created': 'Mon, 22 Aug 2022 16:55:02 GMT'}]",2022-08-23,"[['Yoon', 'Youngwoo', ''], ['Wolfert', 'Pieter', ''], ['Kucherenko', 'Taras', ''], ['Viegas', 'Carla', ''], ['Nikolov', 'Teodor', ''], ['Tsakov', 'Mihail', ''], ['Henter', 'Gustav Eje', '']]","['gesture generation', 'embodied conversational agents', 'evaluationparadigms']"
12973,2108.08139,Ricardo Caldas,"Ricardo Caldas, Razan Ghzouli, Alessandro V. Papadopoulos, Patrizio
  Pelliccione, Danny Weyns, Thorsten Berger","Towards Mapping Control Theory and Software Engineering Properties using
  Specification Patterns",,"2021 IEEE International Conference on Autonomic Computing and
  Self-Organizing Systems Companion (ACSOS-C)",10.1109/ACSOS-C52956.2021.00067,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A traditional approach to realize self-adaptation in software engineering
(SE) is by means of feedback loops. The goals of the system can be specified as
formal properties that are verified against models of the system. On the other
hand, control theory (CT) provides a well-established foundation for designing
feedback loop systems and providing guarantees for essential properties, such
as stability, settling time, and steady state error. Currently, it is an open
question whether and how traditional SE approaches to self-adaptation consider
properties from CT. Answering this question is challenging given the principle
differences in representing properties in both fields. In this paper, we take a
first step to answer this question. We follow a bottom up approach where we
specify a control design (in Simulink) for a case inspired by Scuderia Ferrari
(F1) and provide evidence for stability and safety. The design is then
transferred into code (in C) that is further optimized. Next, we define
properties that enable verifying whether the control properties still hold at
code level. Then, we consolidate the solution by mapping the properties in both
worlds using specification patterns as common language and we verify the
correctness of this mapping. The mapping offers a reusable artifact to solve
similar problems. Finally, we outline opportunities for future work,
particularly to refine and extend the mapping and investigate how it can
improve the engineering of self-adaptive systems for both SE and CT engineers.
","[{'version': 'v1', 'created': 'Wed, 18 Aug 2021 13:30:30 GMT'}, {'version': 'v2', 'created': 'Mon, 23 May 2022 09:12:57 GMT'}]",2022-05-24,"[['Caldas', 'Ricardo', ''], ['Ghzouli', 'Razan', ''], ['Papadopoulos', 'Alessandro V.', ''], ['Pelliccione', 'Patrizio', ''], ['Weyns', 'Danny', ''], ['Berger', 'Thorsten', '']]","['Self-adaptive systems', 'feedback loops', 'control theory', 'properties', 'mapping of properties']"
12974,2109.07909,Alfonso Semeraro,"Giancarlo Ruffo, Alfonso Semeraro, Anastasia Giachanou, Paolo Rosso","Studying Fake News Spreading, Polarisation Dynamics, and Manipulation by
  Bots: a Tale of Networks and Language","43 pages, 9 figures","Computer Science Review, Volume 47, 2023, 100531, ISSN 1574-0137",10.1016/j.cosrev.2022.100531,,cs.CY cs.CL cs.SI,http://creativecommons.org/licenses/by/4.0/,"  With the explosive growth of online social media, the ancient problem of
information disorders interfering with news diffusion has surfaced with a
renewed intensity threatening our democracies, public health, and news outlets'
credibility. Therefore, thousands of scientific papers have been published in a
relatively short period, making researchers of different disciplines struggle
with an information overload problem. The aim of this survey is threefold: (1)
we present the results of a network-based analysis of the existing
multidisciplinary literature to support the search for relevant trends and
central publications; (2) we describe the main results and necessary background
to attack the problem under a computational perspective; (3) we review selected
contributions using network science as a unifying framework and computational
linguistics as the tool to make sense of the shared content. Despite scholars
working on computational linguistics and networks traditionally belong to
different scientific communities, we expect that those interested in the area
of fake news should be aware of crucial aspects of both disciplines.
","[{'version': 'v1', 'created': 'Mon, 13 Sep 2021 14:10:44 GMT'}, {'version': 'v2', 'created': 'Sat, 14 Jan 2023 13:56:38 GMT'}]",2023-01-18,"[['Ruffo', 'Giancarlo', ''], ['Semeraro', 'Alfonso', ''], ['Giachanou', 'Anastasia', ''], ['Rosso', 'Paolo', '']]","['disinformation', 'network analysis', 'natural language processing', 'opinion dynamics', 'fake news spreading', 'social bots']"
12975,2105.02147,Bryar Hassan Dr.,"Miran Hama Rahim Saeed, Bryar A. Hassan, Shko M. Qader","An Optimized Framework to Adopt Computer Laboratory Administrations for
  Operating System and Application Installations",,,10.24017/science.2017.3.8,,cs.NI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Nowadays, in most of the fields, task automation is area of interest and
research due to that manual execution of a task is error prone, time consuming,
involving more human resources and focus concerning. In the area of Computer
laboratory administration, the old fashioned administration cannot run with
todays growth, where the Operating System (OS) and required applications are
installed on all the machines one by one. Therefore, a framework for automating
Lab administration in regards of Operating Systems and Application
installations will be proposed in this research. Affordability, simplicity,
usability are taken into major consideration. All the parts of the framework
are implemented and illustrated in detail which promotes a great enhancement in
the area of Computer Lab Administration.
","[{'version': 'v1', 'created': 'Wed, 5 May 2021 15:58:40 GMT'}]",2021-05-06,"[['Saeed', 'Miran Hama Rahim', ''], ['Hassan', 'Bryar A.', ''], ['Qader', 'Shko M.', '']]","['Automating Lab administrator', 'Windows customization', 'Network based OS installation', 'PXE', 'SERVA']"
12976,2104.09583,Raghav Malik,"Raghav Malik, Vidush Singhal, Benjamin Gottfried, Milind Kulkarni",Vectorized Secure Evaluation of Decision Forests,"15 pages, 10 figures",,10.1145/3453483.3454094,,cs.CR cs.PL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  As the demand for machine learning-based inference increases in tandem with
concerns about privacy, there is a growing recognition of the need for secure
machine learning, in which secret models can be used to classify private data
without the model or data being leaked. Fully Homomorphic Encryption (FHE)
allows arbitrary computation to be done over encrypted data, providing an
attractive approach to providing such secure inference. While such computation
is often orders of magnitude slower than its plaintext counterpart, the ability
of FHE cryptosystems to do \emph{ciphertext packing} -- that is, encrypting an
entire vector of plaintexts such that operations are evaluated elementwise on
the vector -- helps ameliorate this overhead, effectively creating a SIMD
architecture where computation can be vectorized for more efficient evaluation.
Most recent research in this area has targeted regular, easily vectorizable
neural network models. Applying similar techniques to irregular ML models such
as decision forests remains unexplored, due to their complex, hard-to-vectorize
structures. In this paper we present COPSE, the first system that exploits
ciphertext packing to perform decision-forest inference. COPSE consists of a
staging compiler that automatically restructures and compiles decision forest
models down to a new set of vectorizable primitives for secure inference. We
find that COPSE's compiled models outperform the state of the art across a
range of decision forest models, often by more than an order of magnitude,
while still scaling well.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2021 19:32:47 GMT'}]",2021-04-21,"[['Malik', 'Raghav', ''], ['Singhal', 'Vidush', ''], ['Gottfried', 'Benjamin', ''], ['Kulkarni', 'Milind', '']]","['Homomorphic Encryption', 'Decision Forests', 'Vectorization']"
12977,2206.03275,Upol Ehsan,"Upol Ehsan, Ranjit Singh, Jacob Metcalf, Mark O. Riedl",The Algorithmic Imprint,Accepted to ACM FAccT 2022,,10.1145/3531146.3533186,,cs.CY cs.AI cs.HC,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  When algorithmic harms emerge, a reasonable response is to stop using the
algorithm to resolve concerns related to fairness, accountability,
transparency, and ethics (FATE). However, just because an algorithm is removed
does not imply its FATE-related issues cease to exist. In this paper, we
introduce the notion of the ""algorithmic imprint"" to illustrate how merely
removing an algorithm does not necessarily undo or mitigate its consequences.
We operationalize this concept and its implications through the 2020 events
surrounding the algorithmic grading of the General Certificate of Education
(GCE) Advanced (A) Level exams, an internationally recognized UK-based high
school diploma exam administered in over 160 countries. While the algorithmic
standardization was ultimately removed due to global protests, we show how the
removal failed to undo the algorithmic imprint on the sociotechnical
infrastructures that shape students', teachers', and parents' lives. These
events provide a rare chance to analyze the state of the world both with and
without algorithmic mediation. We situate our case study in Bangladesh to
illustrate how algorithms made in the Global North disproportionately impact
stakeholders in the Global South. Chronicling more than a year-long community
engagement consisting of 47 inter-views, we present the first coherent timeline
of ""what"" happened in Bangladesh, contextualizing ""why"" and ""how"" they happened
through the lenses of the algorithmic imprint and situated algorithmic
fairness. Analyzing these events, we highlight how the contours of the
algorithmic imprints can be inferred at the infrastructural, social, and
individual levels. We share conceptual and practical implications around how
imprint-awareness can (a) broaden the boundaries of how we think about
algorithmic impact, (b) inform how we design algorithms, and (c) guide us in AI
governance.
","[{'version': 'v1', 'created': 'Fri, 3 Jun 2022 15:44:44 GMT'}]",2022-06-08,"[['Ehsan', 'Upol', ''], ['Singh', 'Ranjit', ''], ['Metcalf', 'Jacob', ''], ['Riedl', 'Mark O.', '']]","['Algorithmic Imprint', 'Algorithmic Impact Assessment', 'Situated Fairness', 'Infrastructure', 'Global South', 'Folk Theories of Algorithms', 'User Perceptions']"
12978,2212.06679,Christian Otto,"Christian Otto, Markos Stamatakis, Anett Hoppe, Ralph Ewerth",Predicting Knowledge Gain for MOOC Video Consumption,"13 pages, 1 figure, 3 tables","AIED 2022. Lecture Notes in Computer Science, vol 13356, pp.
  458-462",10.1007/978-3-031-11647-6_92,,cs.IR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Informal learning on the Web using search engines as well as more structured
learning on MOOC platforms have become very popular in recent years. As a
result of the vast amount of available learning resources, intelligent
retrieval and recommendation methods are indispensable -- this is true also for
MOOC videos. However, the automatic assessment of this content with regard to
predicting (potential) knowledge gain has not been addressed by previous work
yet. In this paper, we investigate whether we can predict learning success
after MOOC video consumption using 1) multimodal features covering slide and
speech content, and 2) a wide range of text-based features describing the
content of the video. In a comprehensive experimental setting, we test four
different classifiers and various feature subset combinations. We conduct a
detailed feature importance analysis to gain insights in which modality
benefits knowledge gain prediction the most.
","[{'version': 'v1', 'created': 'Tue, 13 Dec 2022 15:57:32 GMT'}]",2022-12-14,"[['Otto', 'Christian', ''], ['Stamatakis', 'Markos', ''], ['Hoppe', 'Anett', ''], ['Ewerth', 'Ralph', '']]","['Web Learning', 'Resource Quality', 'Knowledge Gain']"
12979,1704.00702,Lu\'is F. Sim\~oes,"Lu\'is F. Sim\~oes, Dario Izzo, Evert Haasdijk, A. E. Eiben",Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO,Code available at https://github.com/lfsimoes/beam_paco__gtoc5,"EvoCOP 2017, LNCS 10197, pp. 141-156, 2017",10.1007/978-3-319-55453-2_10,,cs.NE physics.space-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The design of spacecraft trajectories for missions visiting multiple
celestial bodies is here framed as a multi-objective bilevel optimization
problem. A comparative study is performed to assess the performance of
different Beam Search algorithms at tackling the combinatorial problem of
finding the ideal sequence of bodies. Special focus is placed on the
development of a new hybridization between Beam Search and the Population-based
Ant Colony Optimization algorithm. An experimental evaluation shows all
algorithms achieving exceptional performance on a hard benchmark problem. It is
found that a properly tuned deterministic Beam Search always outperforms the
remaining variants. Beam P-ACO, however, demonstrates lower parameter
sensitivity, while offering superior worst-case performance. Being an anytime
algorithm, it is then found to be the preferable choice for certain practical
applications.
","[{'version': 'v1', 'created': 'Mon, 3 Apr 2017 17:38:04 GMT'}]",2017-04-05,"[['Simões', 'Luís F.', ''], ['Izzo', 'Dario', ''], ['Haasdijk', 'Evert', ''], ['Eiben', 'A. E.', '']]","['Beam Search', 'Ant Colony Optimization', 'P-ACO', 'Bilevel optimization', 'Multi-objective optimization', 'Spacecraft trajectories']"
12980,2005.01589,Loay Faisal,"Loay F. Hussein, Aisha-Hassan Abdalla Hashim, Mohamed Hadi Habaebi,
  and Wan Haslina Hassan","An Adaptive Diffserv Approach To Support QoS In Network Mobility Nemo
  Environment","26 pages, 16 figures",,10.5121/ijcnc.2020.12202,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network mobility basic support (NEMO BS) protocol (RFC 3963) is an extension
of Mobile IPv6. The NEMO BS embraced by the IETF working group to permit any
node in the portable network to be accessible to the Internet despite the fact
the network itself is roaming. This protocol likewise Mobile IPv6 does not
deliver any kind of Quality of Service (QoS) guarantees to its clients. It can
barely offer the same level of services (i.e. Best-Effort) to all the users
without obligation to the needs of applications. These propositions a challenge
to real-time applications that demand a precise level of QoS pledge. The
Differentiated Services have recently come to be the most widely used QoS
support technology in IP networks due to its relative simplicity and
scalability benefits. This paper proposes a new scheme to provide QoS to mobile
network nodes within the NEMO context. The proposed scheme intends to reduce
handover latency for the users of MNN as well as alleviates packet losses. The
feasibility of the proposed enhancement is assessed by measuring its
performance against the native NEMO BS standard protocol using the NS-2
simulator. The obtained results in the simulation study have demonstrated that
the proposed scheme outperforms the standard NEMO BS protocol.
","[{'version': 'v1', 'created': 'Mon, 4 May 2020 15:58:27 GMT'}]",2020-05-05,"[['Hussein', 'Loay F.', ''], ['Hashim', 'Aisha-Hassan Abdalla', ''], ['Habaebi', 'Mohamed Hadi', ''], ['Hassan', 'Wan Haslina', '']]","['Mobile IPv6', 'FHMIPv6', 'NEMO', 'QoS', 'DiffServ.  1']"
12981,2203.16275,Emery Neufeld,Emery Neufeld,Reinforcement Learning Guided by Provable Normative Compliance,"12 pages, 2 figures. Extended version, March 2022","In Proceedings of the 14th International Conference on Agents and
  Artificial Intelligence - Volume 3: ICAART (2022)",10.5220/0010835600003116,,cs.AI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Reinforcement learning (RL) has shown promise as a tool for engineering safe,
ethical, or legal behaviour in autonomous agents. Its use typically relies on
assigning punishments to state-action pairs that constitute unsafe or unethical
choices. Despite this assignment being a crucial step in this approach,
however, there has been limited discussion on generalizing the process of
selecting punishments and deciding where to apply them. In this paper, we adopt
an approach that leverages an existing framework -- the normative supervisor of
(Neufeld et al., 2021) -- during training. This normative supervisor is used to
dynamically translate states and the applicable normative system into
defeasible deontic logic theories, feed these theories to a theorem prover, and
use the conclusions derived to decide whether or not to assign a punishment to
the agent. We use multi-objective RL (MORL) to balance the ethical objective of
avoiding violations with a non-ethical objective; we will demonstrate that our
approach works for a multiplicity of MORL techniques, and show that it is
effective regardless of the magnitude of the punishment we assign.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2022 13:10:55 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Apr 2022 10:56:59 GMT'}]",2022-04-20,"[['Neufeld', 'Emery', '']]","['Reinforcement Learning', 'Ethical AI', 'Deontic Logic']"
12982,1905.08300,Hansenclever Bassani,"Hansenclever F. Bassani, Aluizio F. R. Araujo","A Neural Network Architecture for Learning Word-Referent Associations in
  Multiple Contexts",,,10.1016/j.neunet.2019.05.017,,cs.LG cs.CL stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This article proposes a biologically inspired neurocomputational architecture
which learns associations between words and referents in different contexts,
considering evidence collected from the literature of Psycholinguistics and
Neurolinguistics. The multi-layered architecture takes as input raw images of
objects (referents) and streams of word's phonemes (labels), builds an adequate
representation, recognizes the current context, and associates label with
referents incrementally, by employing a Self-Organizing Map which creates new
association nodes (prototypes) as required, adjusts the existing prototypes to
better represent the input stimuli and removes prototypes that become
obsolete/unused. The model takes into account the current context to retrieve
the correct meaning of words with multiple meanings. Simulations show that the
model can reach up to 78% of word-referent association accuracy in ambiguous
situations and approximates well the learning rates of humans as reported by
three different authors in five Cross-Situational Word Learning experiments,
also displaying similar learning patterns in the different learning conditions.
","[{'version': 'v1', 'created': 'Mon, 20 May 2019 19:05:12 GMT'}]",2019-05-29,"[['Bassani', 'Hansenclever F.', ''], ['Araujo', 'Aluizio F. R.', '']]","['Self-Organizing Maps', 'Cross-Situational Word Learning', 'Context', 'Learning Representations', 'NeurocomputationalModel']"
12983,2207.04360,Simon X. Yang,"Danjie Zhu, Tao Yan, Simon X. Yang","Motion Planning and Tracking Control of Unmanned Underwater Vehicles:
  Technologies, Challenges and Prospects",,,10.20517/ir.2022.13,,cs.RO cs.SY eess.SY,http://creativecommons.org/publicdomain/zero/1.0/,"  The motion planning and tracking control techniques of unmanned underwater
vehicles (UUV) are fundamentally significant for efficient and robust UUV
navigation, which is crucial for underwater rescue, facility maintenance,
marine resource exploration, aquatic recreation, etc. Studies on UUV motion
planning and tracking control have been growing rapidly worldwide, which are
usually sorted into the following topics: task assignment of the multi-UUV
system, UUV path planning and UUV trajectory tracking. This paper provides a
comprehensive review of conventional and intelligent technologies for motion
planning and tracking control of UUVs. Analysis of the benefits and drawbacks
of these various methodologies in literature is presented. In addition, the
challenges and prospects of UUV motion planning and tracking control are
provided as possible developments for future research.
","[{'version': 'v1', 'created': 'Sun, 10 Jul 2022 01:33:37 GMT'}]",2022-07-12,"[['Zhu', 'Danjie', ''], ['Yan', 'Tao', ''], ['Yang', 'Simon X.', '']]","['Unmanned underwater vehicles', 'motion planning', 'path planning', 'task assignment', 'tracking control']"
12984,2207.08227,Peter Nicholas Hansen,"Peter Nicholas Hansen, Thomas T. Enevoldsen, Dimitrios Papageorgiou
  and Mogens Blanke","Autonomous Navigation in Confined Waters -- A COLREGs Rule 9 Compliant
  Framework",To be published at IFAC CAMS 2022,,10.1016/j.ifacol.2022.10.435,,cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Fully or partial autonomous marine vessels are actively being developed by
many industry actors. In many cases, the autonomous vessels will be operating
close to shore, and within range of a Remote Control Center (RCC). Close to
shore operation requires that the autonomous vessel is able to navigate in
close proximity to other autonomous or manned vessels, and possibly in confined
waters, while obeying the COLREGs on equal terms as any other vessel at sea. In
confined waters however, certain COLREGs rules apply, which might alter the
expected actions (give-way or stand-on), depending on the manoeuvrability of
the vessels. This paper presents a Situation Awareness (SAS) framework for
autonomous navigation that complies with COLREGs rule 9 (Narrow Channels). The
proposed solution comprises a method for evaluating the manoeuvrability of a
vessel in confined waters, for assessing the applicability of COLREGs rule 9.
This feature is then integrated into an already existing SAS framework for
facilitating COLREGs-compliant navigation in restricted waters. The
applicability of the proposed method is demonstrated in simulation using a case
study of a small autonomous passenger ferry.
","[{'version': 'v1', 'created': 'Sun, 17 Jul 2022 17:00:26 GMT'}]",2022-12-01,"[['Hansen', 'Peter Nicholas', ''], ['Enevoldsen', 'Thomas T.', ''], ['Papageorgiou', 'Dimitrios', ''], ['Blanke', 'Mogens', '']]","['Situation awareness', 'COLREGs compliance', 'Rule 9', 'Confined waters']"
12985,1906.06512,Nicolo Pollini,"Nicol\`o Pollini, Oded Amir","Mixed projection- and density-based topology optimization with
  applications to structural assemblies",,Structural and Multidisciplinary Optimization 2019,10.1007/s00158-019-02390-9,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a mixed projection- and density-based topology
optimization approach. The aim is to combine the benefits of both
parametrizations: the explicit geometric representation provides specific
controls on certain design regions while the implicit density representation
provides the ultimate design freedom elsewhere. This approach is particularly
suited for structural assemblies, where the optimization of the structural
topology is coupled with the optimization of the shape of the interface between
the sub-components in a unified formulation. The interface between the
assemblies is defined by a segmented profile made of linear geometric entities.
The geometric coordinates of the nodes connecting the profile segments are used
as shape variables in the problem, together with density variables as in
conventional topology optimization. The variable profile is used to locally
impose specific geometric constraints or to project particular material
properties. Examples of the properties considered herein are a local volume
constraint, a local maximum length scale control, a variable Young's modulus
for the distributed solid material, and spatially variable minimum and maximum
length scale. The resulting optimization approach is general and various
geometric entities can be used. The potential for complex design manipulations
is demonstrated through several numerical examples.
","[{'version': 'v1', 'created': 'Sat, 15 Jun 2019 09:53:05 GMT'}]",2019-10-09,"[['Pollini', 'Nicolò', ''], ['Amir', 'Oded', '']]","['topology optimization', 'shape optimization', 'projection methods', 'structural assembly', 'robust approach']"
12986,1905.10949,Yu Yin,"Yu Yin, Qi Liu, Zhenya Huang, Enhong Chen, Wei Tong, Shijin Wang and
  Yu Su",QuesNet: A Unified Representation for Heterogeneous Test Questions,,,10.1145/3292500.3330900,,cs.LG cs.CL stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Understanding learning materials (e.g. test questions) is a crucial issue in
online learning systems, which can promote many applications in education
domain. Unfortunately, many supervised approaches suffer from the problem of
scarce human labeled data, whereas abundant unlabeled resources are highly
underutilized. To alleviate this problem, an effective solution is to use
pre-trained representations for question understanding. However, existing
pre-training methods in NLP area are infeasible to learn test question
representations due to several domain-specific characteristics in education.
First, questions usually comprise of heterogeneous data including content text,
images and side information. Second, there exists both basic linguistic
information as well as domain logic and knowledge. To this end, in this paper,
we propose a novel pre-training method, namely QuesNet, for comprehensively
learning question representations. Specifically, we first design a unified
framework to aggregate question information with its heterogeneous inputs into
a comprehensive vector. Then we propose a two-level hierarchical pre-training
algorithm to learn better understanding of test questions in an unsupervised
way. Here, a novel holed language model objective is developed to extract
low-level linguistic features, and a domain-oriented objective is proposed to
learn high-level logic and knowledge. Moreover, we show that QuesNet has good
capability of being fine-tuned in many question-based tasks. We conduct
extensive experiments on large-scale real-world question data, where the
experimental results clearly demonstrate the effectiveness of QuesNet for
question understanding as well as its superior applicability.
","[{'version': 'v1', 'created': 'Mon, 27 May 2019 03:08:17 GMT'}]",2019-05-28,"[['Yin', 'Yu', ''], ['Liu', 'Qi', ''], ['Huang', 'Zhenya', ''], ['Chen', 'Enhong', ''], ['Tong', 'Wei', ''], ['Wang', 'Shijin', ''], ['Su', 'Yu', '']]","['question representation', 'heterogeneous data', 'pre-training']"
12987,1410.8202,"Jesko H\""uttenhain","Jesko H\""uttenhain and Christian Ikenmeyer",Binary Determinantal Complexity,"10 pages, C source code for the computation available as ancillary
  files","Linear Algebra and its Applications, 504:559-573, 2016",10.1016/j.laa.2016.04.027,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove that for writing the 3 by 3 permanent polynomial as a determinant of
a matrix consisting only of zeros, ones, and variables as entries, a 7 by 7
matrix is required. Our proof is computer based and uses the enumeration of
bipartite graphs. Furthermore, we analyze sequences of polynomials that are
determinants of polynomially sized matrices consisting only of zeros, ones, and
variables. We show that these are exactly the sequences in the complexity class
of constant free polynomially sized (weakly) skew circuits.
","[{'version': 'v1', 'created': 'Wed, 29 Oct 2014 23:57:38 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Jan 2015 22:20:31 GMT'}]",2017-04-11,"[['Hüttenhain', 'Jesko', ''], ['Ikenmeyer', 'Christian', '']]","['determinant', 'permanent', 'computational complexity', 'arithmetic circuit', 'constant-free']"
12988,1508.06033,Zhiyong Cui,Zhiyong Cui and Ying Long,"Perspectives on stability and mobility of transit passenger's travel
  behaviour through smart card data","9 pages, 10 figures",IET Intelligent Transport Systems (2019),10.1049/iet-its.2019.0212,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing studies have extensively used spatiotemporal data to discover the
mobility patterns of various types of travellers. Smart card data (SCD)
collected by the automated fare collection systems can reflect a general view
of the mobility pattern of public transit riders. Mobility patterns of transit
riders are temporally and spatially dynamic, and therefore difficult to
measure. However, few existing studies measure both the mobility and stability
of transit riders' travel patterns over a long period of time. To analyse the
long-term changes of transit riders' travel behaviour, the authors define a
metric for measuring the similarity between SCD, in this study. Also an
improved density-based clustering algorithm, simplified smoothed ordering
points to identify the clustering structure (SS-OPTICS), to identify transit
rider clusters is proposed. Compared to the original OPTICS, SS-OPTICS needs
fewer parameters and has better generalisation ability. Further, the generated
clusters are categorized according to their features of regularity and
occasionality. Based on the generated clusters and categories, fine- and
coarse-grained travel pattern transitions of transit riders over four years
from 2010 to 2014 are measured. By combining socioeconomic data of Beijing in
the year of 2010 and 2014, the interdependence between stability and mobility
of transit riders' travel behaviour is also discussed.
","[{'version': 'v1', 'created': 'Tue, 25 Aug 2015 05:04:34 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Nov 2019 02:10:41 GMT'}]",2019-11-11,"[['Cui', 'Zhiyong', ''], ['Long', 'Ying', '']]","['Smart Card Data', 'Temporal Travel Pattern', 'Mobility', 'Stability', 'SS-OPTICS Clustering']"
12989,2005.12815,Diego Aghi,"Diego Aghi, Vittorio Mazzia, Marcello Chiaberge","Local Motion Planner for Autonomous Navigation in Vineyards with a RGB-D
  Camera-Based Algorithm and Deep Learning Synergy",,,10.3390/machines8020027,,cs.LG cs.CV stat.ML,http://creativecommons.org/licenses/by/4.0/,"  With the advent of agriculture 3.0 and 4.0, researchers are increasingly
focusing on the development of innovative smart farming and precision
agriculture technologies by introducing automation and robotics into the
agricultural processes. Autonomous agricultural field machines have been
gaining significant attention from farmers and industries to reduce costs,
human workload, and required resources. Nevertheless, achieving sufficient
autonomous navigation capabilities requires the simultaneous cooperation of
different processes; localization, mapping, and path planning are just some of
the steps that aim at providing to the machine the right set of skills to
operate in semi-structured and unstructured environments. In this context, this
study presents a low-cost local motion planner for autonomous navigation in
vineyards based only on an RGB-D camera, low range hardware, and a dual layer
control algorithm. The first algorithm exploits the disparity map and its depth
representation to generate a proportional control for the robotic platform.
Concurrently, a second back-up algorithm, based on representations learning and
resilient to illumination variations, can take control of the machine in case
of a momentaneous failure of the first block. Moreover, due to the double
nature of the system, after initial training of the deep learning model with an
initial dataset, the strict synergy between the two algorithms opens the
possibility of exploiting new automatically labeled data, coming from the
field, to extend the existing model knowledge. The machine learning algorithm
has been trained and tested, using transfer learning, with acquired images
during different field surveys in the North region of Italy and then optimized
for on-device inference with model pruning and quantization. Finally, the
overall system has been validated with a customized robot platform in the
relevant environment.
","[{'version': 'v1', 'created': 'Tue, 26 May 2020 15:47:42 GMT'}]",2020-05-27,"[['Aghi', 'Diego', ''], ['Mazzia', 'Vittorio', ''], ['Chiaberge', 'Marcello', '']]","['Agricultural Field Machines', 'Stereo Vision', 'DeepLearning', 'Autonomous Navigation', 'Edge AI', 'Transfer Learning']"
12990,2204.03655,Bryan Lim,"Bryan Lim, Alexander Reichenbach, Antoine Cully",Learning to Walk Autonomously via Reset-Free Quality-Diversity,,,10.1145/3512290.3528715,,cs.LG cs.AI cs.NE cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Quality-Diversity (QD) algorithms can discover large and complex behavioural
repertoires consisting of both diverse and high-performing skills. However, the
generation of behavioural repertoires has mainly been limited to simulation
environments instead of real-world learning. This is because existing QD
algorithms need large numbers of evaluations as well as episodic resets, which
require manual human supervision and interventions. This paper proposes
Reset-Free Quality-Diversity optimization (RF-QD) as a step towards autonomous
learning for robotics in open-ended environments. We build on Dynamics-Aware
Quality-Diversity (DA-QD) and introduce a behaviour selection policy that
leverages the diversity of the imagined repertoire and environmental
information to intelligently select of behaviours that can act as automatic
resets. We demonstrate this through a task of learning to walk within defined
training zones with obstacles. Our experiments show that we can learn full
repertoires of legged locomotion controllers autonomously without manual resets
with high sample efficiency in spite of harsh safety constraints. Finally,
using an ablation of different target objectives, we show that it is important
for RF-QD to have diverse types solutions available for the behaviour selection
policy over solutions optimised with a specific objective. Videos and code
available at https://sites.google.com/view/rf-qd.
","[{'version': 'v1', 'created': 'Thu, 7 Apr 2022 14:07:51 GMT'}]",2022-07-12,"[['Lim', 'Bryan', ''], ['Reichenbach', 'Alexander', ''], ['Cully', 'Antoine', '']]","['Quality-Diversity', 'Reset-free', 'Safety-aware Learning', 'Robotics']"
12991,1809.04234,Liheng Chen,"Liheng Chen, Yanru Qu, Zhenghui Wang, Lin Qiu, Weinan Zhang, Ken Chen,
  Shaodian Zhang, Yong Yu",Sampled in Pairs and Driven by Text: A New Graph Embedding Framework,"Accepted by WWW 2019 (The World Wide Web Conference. ACM, 2019)",Proceedings of the 2019 World Wide Web Conference,10.1145/3308558.3313520,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In graphs with rich texts, incorporating textual information with structural
information would benefit constructing expressive graph embeddings. Among
various graph embedding models, random walk (RW)-based is one of the most
popular and successful groups. However, it is challenged by two issues when
applied on graphs with rich texts: (i) sampling efficiency: deriving from the
training objective of RW-based models (e.g., DeepWalk and node2vec), we show
that RW-based models are likely to generate large amounts of redundant training
samples due to three main drawbacks. (ii) text utilization: these models have
difficulty in dealing with zero-shot scenarios where graph embedding models
have to infer graph structures directly from texts. To solve these problems, we
propose a novel framework, namely Text-driven Graph Embedding with Pairs
Sampling (TGE-PS). TGE-PS uses Pairs Sampling (PS) to improve the sampling
strategy of RW, being able to reduce ~99% training samples while preserving
competitive performance. TGE-PS uses Text-driven Graph Embedding (TGE), an
inductive graph embedding approach, to generate node embeddings from texts.
Since each node contains rich texts, TGE is able to generate high-quality
embeddings and provide reasonable predictions on existence of links to unseen
nodes. We evaluate TGE-PS on several real-world datasets, and experiment
results demonstrate that TGE-PS produces state-of-the-art results on both
traditional and zero-shot link prediction tasks.
","[{'version': 'v1', 'created': 'Wed, 12 Sep 2018 02:53:00 GMT'}, {'version': 'v2', 'created': 'Sat, 12 Oct 2019 05:29:41 GMT'}]",2019-10-15,"[['Chen', 'Liheng', ''], ['Qu', 'Yanru', ''], ['Wang', 'Zhenghui', ''], ['Qiu', 'Lin', ''], ['Zhang', 'Weinan', ''], ['Chen', 'Ken', ''], ['Zhang', 'Shaodian', ''], ['Yu', 'Yong', '']]","['Graph Embedding', 'Data Mining', 'Link Prediction', 'Zero-shot']"
12992,2009.13627,Xiaoran Zhang,"Xiaoran Zhang and Michelle Noga and David Glynn Martin and Kumaradevan
  Punithakumar","Fully Automated Left Atrium Segmentation from Anatomical Cine Long-axis
  MRI Sequences using Deep Convolutional Neural Network with Unscented Kalman
  Filter",Accepted by Medical Image Analysis 2020,,10.1016/j.media.2020.101916,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study proposes a fully automated approach for the left atrial
segmentation from routine cine long-axis cardiac magnetic resonance image
sequences using deep convolutional neural networks and Bayesian filtering. The
proposed approach consists of a classification network that automatically
detects the type of long-axis sequence and three different convolutional neural
network models followed by unscented Kalman filtering (UKF) that delineates the
left atrium. Instead of training and predicting all long-axis sequence types
together, the proposed approach first identifies the image sequence type as to
2, 3 and 4 chamber views, and then performs prediction based on neural nets
trained for that particular sequence type. The datasets were acquired
retrospectively and ground truth manual segmentation was provided by an expert
radiologist. In addition to neural net based classification and segmentation,
another neural net is trained and utilized to select image sequences for
further processing using UKF to impose temporal consistency over cardiac cycle.
A cyclic dynamic model with time-varying angular frequency is introduced in UKF
to characterize the variations in cardiac motion during image scanning. The
proposed approach was trained and evaluated separately with varying amount of
training data with images acquired from 20, 40, 60 and 80 patients. Evaluations
over 1515 images with equal number of images from each chamber group acquired
from an additional 20 patients demonstrated that the proposed model
outperformed state-of-the-art and yielded a mean Dice coefficient value of
94.1%, 93.7% and 90.1% for 2, 3 and 4-chamber sequences, respectively, when
trained with datasets from 80 patients.
","[{'version': 'v1', 'created': 'Mon, 28 Sep 2020 21:06:35 GMT'}, {'version': 'v2', 'created': 'Sun, 22 Nov 2020 18:47:25 GMT'}]",2020-11-30,"[['Zhang', 'Xiaoran', ''], ['Noga', 'Michelle', ''], ['Martin', 'David Glynn', ''], ['Punithakumar', 'Kumaradevan', '']]","['Left Atrial Segmentation', 'Magnetic Resonance Imaging', 'Long-Axis Sequences', 'DeepConvolutional Neural Network', 'Unscented Kalman Filter']"
12993,2008.00914,Kui Liu,"Kui Liu and Shangwen Wang and Anil Koyuncu and Kisub Kim and
  Tegawend\'e F. Bissyand\'e and Dongsun Kim and Peng Wu and Jacques Klein and
  Xiaoguang Mao and Yves Le Traon","On the Efficiency of Test Suite based Program Repair: A Systematic
  Assessment of 16 Automated Repair Systems for Java Programs",,,10.1145/3377811.3380338,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Test-based automated program repair has been a prolific field of research in
software engineering in the last decade. Many approaches have indeed been
proposed, which leverage test suites as a weak, but affordable, approximation
to program specifications. Although the literature regularly sets new records
on the number of benchmark bugs that can be fixed, several studies increasingly
raise concerns about the limitations and biases of state-of-the-art approaches.
For example, the correctness of generated patches has been questioned in a
number of studies, while other researchers pointed out that evaluation schemes
may be misleading with respect to the processing of fault localization results.
Nevertheless, there is little work addressing the efficiency of patch
generation, with regard to the practicality of program repair. In this paper,
we fill this gap in the literature, by providing an extensive review on the
efficiency of test suite based program repair. Our objective is to assess the
number of generated patch candidates, since this information is correlated to
(1) the strategy to traverse the search space efficiently in order to select
sensical repair attempts, (2) the strategy to minimize the test effort for
identifying a plausible patch, (3) as well as the strategy to prioritize the
generation of a correct patch. To that end, we perform a large-scale empirical
study on the efficiency, in terms of quantity of generated patch candidates of
the 16 open-source repair tools for Java programs. The experiments are
carefully conducted under the same fault localization configurations to limit
biases.
","[{'version': 'v1', 'created': 'Mon, 3 Aug 2020 14:47:41 GMT'}]",2020-08-04,"[['Liu', 'Kui', ''], ['Wang', 'Shangwen', ''], ['Koyuncu', 'Anil', ''], ['Kim', 'Kisub', ''], ['Bissyandé', 'Tegawendé F.', ''], ['Kim', 'Dongsun', ''], ['Wu', 'Peng', ''], ['Klein', 'Jacques', ''], ['Mao', 'Xiaoguang', ''], ['Traon', 'Yves Le', '']]","['Patch generation', 'Program repair', 'Efficiency', 'Empirical assessment']"
12994,2103.07925,Sebastian Fuchs,"Sebastian L. Fuchs, Christoph Meier, Wolfgang A. Wall, Christian J.
  Cyron","An SPH framework for fluid-solid and contact interaction problems
  including thermo-mechanical coupling and reversible phase transitions",,,10.1186/s40323-021-00200-w,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The present work proposes an approach for fluid-solid and contact interaction
problems including thermo-mechanical coupling and reversible phase transitions.
The solid field is assumed to consist of several arbitrarily-shaped,
undeformable but mobile rigid bodies, that are evolved in time individually and
allowed to get into mechanical contact with each other. The fluid field
generally consists of multiple liquid or gas phases. All fields are spatially
discretized using the method of smoothed particle hydrodynamics (SPH). This
approach is especially suitable in the context of continually changing
interface topologies and dynamic phase transitions without the need for
additional methodological and computational effort for interface tracking as
compared to mesh- or grid-based methods. Proposing a concept for the
parallelization of the computational framework, in particular concerning a
computationally efficient evaluation of rigid body motion, is an essential part
of this work. Finally, the accuracy and robustness of the proposed framework is
demonstrated by several numerical examples in two and three dimensions,
involving multiple rigid bodies, two-phase flow, and reversible phase
transitions, with a focus on two potential application scenarios in the fields
of engineering and biomechanics: powder bed fusion additive manufacturing
(PBFAM) and disintegration of food boluses in the human stomach. The efficiency
of the parallel computational framework is demonstrated by a strong scaling
analysis.
","[{'version': 'v1', 'created': 'Sun, 14 Mar 2021 13:39:56 GMT'}]",2021-09-14,"[['Fuchs', 'Sebastian L.', ''], ['Meier', 'Christoph', ''], ['Wall', 'Wolfgang A.', ''], ['Cyron', 'Christian J.', '']]","['rigid body motion', 'two-phase flow', 'reversible phase transitions', 'smoothed particlehydrodynamics', 'metal additive manufacturing', 'gastric fluid mechanics']"
12995,1508.06095,Rossella Cancelliere,"Rossella Cancelliere, Mario Gai, Patrick Gallinari, Luca Rubini","OCReP: An Optimally Conditioned Regularization for Pseudoinversion Based
  Neural Training",Published on Neural Networks,,10.1016/j.neunet.2015.07.015,,cs.NE cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider the training of single hidden layer neural networks
by pseudoinversion, which, in spite of its popularity, is sometimes affected by
numerical instability issues. Regularization is known to be effective in such
cases, so that we introduce, in the framework of Tikhonov regularization, a
matricial reformulation of the problem which allows us to use the condition
number as a diagnostic tool for identification of instability. By imposing
well-conditioning requirements on the relevant matrices, our theoretical
analysis allows the identification of an optimal value for the regularization
parameter from the standpoint of stability. We compare with the value derived
by cross-validation for overfitting control and optimisation of the
generalization performance. We test our method for both regression and
classification tasks. The proposed method is quite effective in terms of
predictivity, often with some improvement on performance with respect to the
reference cases considered. This approach, due to analytical determination of
the regularization parameter, dramatically reduces the computational load
required by many other techniques.
","[{'version': 'v1', 'created': 'Tue, 25 Aug 2015 10:09:31 GMT'}]",2015-08-26,"[['Cancelliere', 'Rossella', ''], ['Gai', 'Mario', ''], ['Gallinari', 'Patrick', ''], ['Rubini', 'Luca', '']]","['Regularization parameter', 'Condition number', 'Pseudoinversion', 'Numerical instability']"
12996,1810.00520,Rafael Menelau Oliveira E Cruz,"Rafael M. O. Cruz, Dayvid V. R. Oliveira, George D. C. Cavalcanti,
  Robert Sabourin","FIRE-DES++: Enhanced Online Pruning of Base Classifiers for Dynamic
  Ensemble Selection","Article published on Pattern Recognition, 2019","Pattern Recognition, Volume 85, January 2019, Pages 149-160",10.1016/j.patcog.2018.07.037,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite being very effective in several classification tasks, Dynamic
Ensemble Selection (DES) techniques can select classifiers that classify all
samples in the region of competence as being from the same class. The Frienemy
Indecision REgion DES (FIRE-DES) tackles this problem by pre-selecting
classifiers that correctly classify at least one pair of samples from different
classes in the region of competence of the test sample. However, FIRE-DES
applies the pre-selection for the classification of a test sample if and only
if its region of competence is composed of samples from different classes
(indecision region), even though this criterion is not reliable for determining
if a test sample is located close to the borders of classes (true indecision
region) when the region of competence is obtained using classical nearest
neighbors approach. Because of that, FIRE-DES mistakes noisy regions for true
indecision regions, leading to the pre-selection of incompetent classifiers,
and mistakes true indecision regions for safe regions, leaving samples in such
regions without any pre-selection. To tackle these issues, we propose the
FIRE-DES++, an enhanced FIRE-DES that removes noise and reduces the overlap of
classes in the validation set; and defines the region of competence using an
equal number of samples of each class, avoiding selecting a region of
competence with samples of a single class. Experiments are conducted using
FIRE-DES++ with 8 different dynamic selection techniques on 64 classification
datasets. Experimental results show that FIRE-DES++ increases the
classification performance of all DES techniques considered in this work,
outperforming FIRE-DES with 7 out of the 8 DES techniques, and outperforming
state-of-the-art DES frameworks.
","[{'version': 'v1', 'created': 'Mon, 1 Oct 2018 03:49:46 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Oct 2018 23:17:15 GMT'}]",2020-03-06,"[['Cruz', 'Rafael M. O.', ''], ['Oliveira', 'Dayvid V. R.', ''], ['Cavalcanti', 'George D. C.', ''], ['Sabourin', 'Robert', '']]","['Ensemble of classifiers', 'Dynamic ensemble selection', 'Classifier competence', 'Prototype']"
12997,2004.11123,Georgios Leontidis,"Benedict Delahaye Chivers, John Wallbank, Steven J. Cole, Ondrej
  Sebek, Simon Stanley, Matthew Fry and Georgios Leontidis","Imputation of missing sub-hourly precipitation data in a large sensor
  network: a machine learning approach","24 pages, 7 figures, 5 tables",Journal of Hydrology 2020,10.1016/j.jhydrol.2020.125126,,cs.LG stat.AP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Precipitation data collected at sub-hourly resolution represents specific
challenges for missing data recovery by being largely stochastic in nature and
highly unbalanced in the duration of rain vs non-rain. Here we present a
two-step analysis utilising current machine learning techniques for imputing
precipitation data sampled at 30-minute intervals by devolving the task into
(a) the classification of rain or non-rain samples, and (b) regressing the
absolute values of predicted rain samples. Investigating 37 weather stations in
the UK, this machine learning process produces more accurate predictions for
recovering precipitation data than an established surface fitting technique
utilising neighbouring rain gauges. Increasing available features for the
training of machine learning algorithms increases performance with the
integration of weather data at the target site with externally sourced rain
gauges providing the highest performance. This method informs machine learning
models by utilising information in concurrently collected environmental data to
make accurate predictions of missing rain data. Capturing complex non-linear
relationships from weakly correlated variables is critical for data recovery at
sub-hourly resolutions. Such pipelines for data recovery can be developed and
deployed for highly automated and near instantaneous imputation of missing
values in ongoing datasets at high temporal resolutions.
","[{'version': 'v1', 'created': 'Mon, 30 Mar 2020 10:47:18 GMT'}, {'version': 'v2', 'created': 'Sat, 2 May 2020 09:11:03 GMT'}]",2020-07-21,"[['Chivers', 'Benedict Delahaye', ''], ['Wallbank', 'John', ''], ['Cole', 'Steven J.', ''], ['Sebek', 'Ondrej', ''], ['Stanley', 'Simon', ''], ['Fry', 'Matthew', ''], ['Leontidis', 'Georgios', '']]","['machine learning', 'data imputation', 'gradient boosted trees', 'environmental sensor networks', 'precipitation', 'soil moisture']"
12998,2010.08778,Sungu Kim,"Sungu Kim, Makrand A. Khanwale, Robbyn K. Anand, Baskar
  Ganapathysubramanian","Modeling electrochemical systems with weakly imposed Dirichlet boundary
  conditions","26 pages, 14 figures","Finite Elements in Analysis and Design, Year: 2022 , Volume: 205,
  Pages: 103749",10.1016/j.finel.2022.103749,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finite element modeling of charged species transport has enabled analysis,
design, and optimization of a diverse array of electrochemical and
electrokinetic devices. These systems are represented by the
Poisson-Nernst-Planck equations coupled with the Navier-Stokes equation, with a
key quantity of interest being the current at the system boundaries. Accurately
computing the current flux is challenging due to the small critical dimension
of the boundary layers (small Debye layer) that require fine mesh resolution at
the boundaries. We resolve this challenge by using the
Dirichlet-to-Neumanntransformation to weakly impose the Dirichlet conditions
for the Poisson-Nernst-Planck equations. The results obtained with weakly
imposed Dirichlet boundary conditions showed excellent agreement with those
obtained when conventional boundary conditions with highly resolved mesh we
reemployed. Furthermore, the calculated current flux showed faster mesh
convergence using weakly imposed conditions compared to the conventionally
imposed Dirichlet boundary conditions. We illustrate the approach on canonical
3D problems that otherwise would have been computationally intractable to solve
accurately. This approach substantially reduces the computational cost of
model-ing electrochemical systems.
","[{'version': 'v1', 'created': 'Sat, 17 Oct 2020 12:30:42 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Jan 2021 06:33:11 GMT'}, {'version': 'v3', 'created': 'Sun, 22 Aug 2021 21:44:39 GMT'}]",2022-05-13,"[['Kim', 'Sungu', ''], ['Khanwale', 'Makrand A.', ''], ['Anand', 'Robbyn K.', ''], ['Ganapathysubramanian', 'Baskar', '']]","['Finite element method', 'Dirichlet-to-Neumann transformation', 'Charged species transport', 'Navier-Stokes Poisson-Nernst-Planck', 'Electrokinetics', 'Boundary flux']"
12999,2202.00846,Zenan Wang,"Zenan Wang, Carlos Carrion, Xiliang Lin, Fuhua Ji, Yongjun Bao,
  Weipeng Yan",Adaptive Experimentation with Delayed Binary Feedback,"to be published in Proceedings of the ACM Web Conference 2022 (WWW
  '22)",,10.1145/3485447.3512097,,cs.IR cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Conducting experiments with objectives that take significant delays to
materialize (e.g. conversions, add-to-cart events, etc.) is challenging.
Although the classical ""split sample testing"" is still valid for the delayed
feedback, the experiment will take longer to complete, which also means
spending more resources on worse-performing strategies due to their fixed
allocation schedules. Alternatively, adaptive approaches such as ""multi-armed
bandits"" are able to effectively reduce the cost of experimentation. But these
methods generally cannot handle delayed objectives directly out of the box.
This paper presents an adaptive experimentation solution tailored for delayed
binary feedback objectives by estimating the real underlying objectives before
they materialize and dynamically allocating variants based on the estimates.
Experiments show that the proposed method is more efficient for delayed
feedback compared to various other approaches and is robust in different
settings. In addition, we describe an experimentation product powered by this
algorithm. This product is currently deployed in the online experimentation
platform of JD.com, a large e-commerce company and a publisher of digital ads.
","[{'version': 'v1', 'created': 'Wed, 2 Feb 2022 01:47:10 GMT'}]",2022-02-03,"[['Wang', 'Zenan', ''], ['Carrion', 'Carlos', ''], ['Lin', 'Xiliang', ''], ['Ji', 'Fuhua', ''], ['Bao', 'Yongjun', ''], ['Yan', 'Weipeng', '']]","['Multi-armed Bandit', 'Delayed Feedback', 'Conversion Rate', 'DisplayAds', 'Experimentation Platform', 'Deployed System']"
13000,2205.15063,Franca Delmastro,"Valerio Arnaboldi, Mattia G. Campana, Franca Delmastro, Elena Pagani",A Personalized Recommender System for Pervasive Social Networks,,"Pervasive and Mobile Computing Volume 36, April 2017, Pages 3-24",10.1016/j.pmcj.2016.08.010,,cs.NI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The current availability of interconnected portable devices, and the advent
of the Web 2.0, raise the problem of supporting anywhere and anytime access to
a huge amount of content, generated and shared by mobile users. In this work we
propose a novel framework for pervasive social networks, called Pervasive
PLIERS (pPLIERS), able to discover and select, in a highly personalized way,
contents of interest for single mobile users. pPLIERS exploits the recently
proposed PLIERS tag based recommender system as context a reasoning tool able
to adapt recommendations to heterogeneous interest profiles of different users.
pPLIERS effectively operates also when limited knowledge about the network is
maintained. It is implemented in a completely decentralized environment, in
which new contents are continuously generated and diffused through the network,
and it relies only on the exchange of single nodes knowledge during proximity
contacts and through device to device communications. We evaluated pPLIERS by
simulating its behaviour in three different scenarios: a big event (Expo 2015),
a conference venue (ACM KDD 2015), and a working day in the city of Helsinki.
For each scenario, we used real or synthetic mobility traces and we extracted
real datasets from Twitter interactions to characterise the generation and
sharing of user contents.
","[{'version': 'v1', 'created': 'Mon, 30 May 2022 12:43:28 GMT'}]",2022-05-31,"[['Arnaboldi', 'Valerio', ''], ['Campana', 'Mattia G.', ''], ['Delmastro', 'Franca', ''], ['Pagani', 'Elena', '']]","['pervasive content sharing', 'mobile social networks', 'opportunistic networks', 'personalized recommendersystems']"
13001,2103.08971,Tsing Zhang,"Jianqing Zhang (1), Dongjing Wang (1), Dongjin Yu (1) ((1) School of
  Computer Science and Technology, Hangzhou Dianzi University, China)","TLSAN: Time-aware Long- and Short-term Attention Network for Next-item
  Recommendation",,"Neurocomputing, Volume 441, 21 June 2021, Pages 179-191",10.1016/j.neucom.2021.02.015,,cs.IR cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Recently, deep neural networks are widely applied in recommender systems for
their effectiveness in capturing/modeling users' preferences. Especially, the
attention mechanism in deep learning enables recommender systems to incorporate
various features in an adaptive way. Specifically, as for the next item
recommendation task, we have the following three observations: 1) users'
sequential behavior records aggregate at time positions (""time-aggregation""),
2) users have personalized taste that is related to the ""time-aggregation""
phenomenon (""personalized time-aggregation""), and 3) users' short-term
interests play an important role in the next item prediction/recommendation. In
this paper, we propose a new Time-aware Long- and Short-term Attention Network
(TLSAN) to address those observations mentioned above. Specifically, TLSAN
consists of two main components. Firstly, TLSAN models ""personalized
time-aggregation"" and learn user-specific temporal taste via trainable
personalized time position embeddings with category-aware correlations in
long-term behaviors. Secondly, long- and short-term feature-wise attention
layers are proposed to effectively capture users' long- and short-term
preferences for accurate recommendation. Especially, the attention mechanism
enables TLSAN to utilize users' preferences in an adaptive way, and its usage
in long- and short-term layers enhances TLSAN's ability of dealing with sparse
interaction data. Extensive experiments are conducted on Amazon datasets from
different fields (also with different size), and the results show that TLSAN
outperforms state-of-the-art baselines in both capturing users' preferences and
performing time-sensitive next-item recommendation.
","[{'version': 'v1', 'created': 'Tue, 16 Mar 2021 10:51:57 GMT'}]",2021-03-17,"[['Zhang', 'Jianqing', ''], ['Wang', 'Dongjing', ''], ['Yu', 'Dongjin', '']]","['personalized recommendation', 'next-item recommendation', 'time-aware', 'long-and short-term', 'attention']"
13002,2006.13613,Daisuke Ishii,"Daisuke Ishii, Saito Fujii","Formalizing the Soundness of the Encoding Methods of SAT-based Model
  Checking","Accepted to be published in the 14th International Symposium on
  Theoretical Aspects of Software Engineering (TASE), 2020; path length k+1 in
  the bounded safety encoding, which was redundant, was decremented; fixed typo
  in Eq (12)",,10.1109/TASE49443.2020.00023,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the effective model checking methods is to utilize the efficient
decision procedure of SAT (or SMT) solvers. In a SAT-based model checking, a
system and its property are encoded into a set of logic formulas and the safety
is checked based on the satisfiability of the formulas. As the encoding methods
are improved and crafted (e.g., k-induction and IC3/PDR), verifying their
correctness becomes more important. This research aims at a formal verification
of the SMC methods using the Coq proof assistant. Our contributions are
twofold: (1) We specify the basic encoding methods, k-induction and (a
simplified version of) IC3/PDR in Coq as a set of simple and modular encoding
predicates. (2) We provide a formal proof of the soundness of the encoding
methods based on our formalized lemmas on state sequences and paths.
","[{'version': 'v1', 'created': 'Wed, 24 Jun 2020 10:49:41 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Mar 2022 08:32:14 GMT'}]",2022-03-14,"[['Ishii', 'Daisuke', ''], ['Fujii', 'Saito', '']]","['verification', 'model checking', 'SAT', 'SMT', 'Coq']"
13003,cs/0510064,Valmir Barbosa,"Rosa M. V. Figueiredo, Valmir C. Barbosa, Nelson Maculan, Cid C. Souza",Acyclic orientations with path constraints,,"RAIRO Operations Research 42 (2008), 455-467",10.1051/ro:2008028,,cs.DM,,"  Many well-known combinatorial optimization problems can be stated over the
set of acyclic orientations of an undirected graph. For example, acyclic
orientations with certain diameter constraints are closely related to the
optimal solutions of the vertex coloring and frequency assignment problems. In
this paper we introduce a linear programming formulation of acyclic
orientations with path constraints, and discuss its use in the solution of the
vertex coloring problem and some versions of the frequency assignment problem.
A study of the polytope associated with the formulation is presented, including
proofs of which constraints of the formulation are facet-defining and the
introduction of new classes of valid inequalities.
","[{'version': 'v1', 'created': 'Fri, 21 Oct 2005 18:29:44 GMT'}]",2008-10-15,"[['Figueiredo', 'Rosa M. V.', ''], ['Barbosa', 'Valmir C.', ''], ['Maculan', 'Nelson', ''], ['Souza', 'Cid C.', '']]","['Acyclic orientations', 'Path constraints', 'Combinatorial optimization problems', 'Facets of polyhedra']"
13004,1911.02496,Dmtri Babaev,"Dmitrii Babaev, Maxim Savchenko, Alexander Tuzhilin, Dmitrii Umerenkov",E.T.-RNN: Applying Deep Learning to Credit Loan Applications,KDD 2019,,10.1145/3292500.3330693,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a novel approach to credit scoring of retail
customers in the banking industry based on deep learning methods. We used RNNs
on fine grained transnational data to compute credit scores for the loan
applicants. We demonstrate that our approach significantly outperforms the
baselines based on the customer data of a large European bank. We also
conducted a pilot study on loan applicants of the bank, and the study produced
significant financial gains for the organization. In addition, our method has
several other advantages described in the paper that are very significant for
the bank.
","[{'version': 'v1', 'created': 'Wed, 6 Nov 2019 17:13:03 GMT'}]",2019-11-07,"[['Babaev', 'Dmitrii', ''], ['Savchenko', 'Maxim', ''], ['Tuzhilin', 'Alexander', ''], ['Umerenkov', 'Dmitrii', '']]","['credit scoring', 'recurrent neural networks', 'card transactions', 'multivariate time-series']"
13005,2001.10421,Fabio Durastante Dr.,"Stefano Cipolla, Fabio Durastante, Francesco Tudisco",Nonlocal PageRank,,"ESAIM: M2AN (2021) Volume 55, Number 1, Page(s) 77 - 97",10.1051/m2an/2020071,,cs.SI cs.NA math.NA physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we introduce and study a nonlocal version of the PageRank. In
our approach, the random walker explores the graph using longer excursions than
just moving between neighboring nodes. As a result, the corresponding ranking
of the nodes, which takes into account a \textit{long-range interaction}
between them, does not exhibit concentration phenomena typical of spectral
rankings which take into account just local interactions. We show that the
predictive value of the rankings obtained using our proposals is considerably
improved on different real world problems.
","[{'version': 'v1', 'created': 'Tue, 28 Jan 2020 15:49:10 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Jul 2020 17:13:00 GMT'}]",2021-03-10,"[['Cipolla', 'Stefano', ''], ['Durastante', 'Fabio', ''], ['Tudisco', 'Francesco', '']]","['Complex network', 'nonlocal dynamics', 'Markov chain', 'Perron–Frobenius']"
13006,2005.05847,Yuan Sun,"Yuan Sun, Andreas Ernst, Xiaodong Li and Jake Weiner","Generalization of Machine Learning for Problem Reduction: A Case Study
  on Travelling Salesman Problems",Published as a regular article at OR Spectrum (https://rdcu.be/b6ECv),,10.1007/s00291-020-00604-x,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Combinatorial optimization plays an important role in real-world problem
solving. In the big data era, the dimensionality of a combinatorial
optimization problem is usually very large, which poses a significant challenge
to existing solution methods. In this paper, we examine the generalization
capability of a machine learning model for problem reduction on the classic
travelling salesman problems (TSP). We demonstrate that our method can greedily
remove decision variables from an optimization problem that are predicted not
to be part of an optimal solution. More specifically, we investigate our
model's capability to generalize on test instances that have not been seen
during the training phase. We consider three scenarios where training and test
instances are different in terms of: 1) problem characteristics; 2) problem
sizes; and 3) problem types. Our experiments show that this machine learning
based technique can generalize reasonably well over a wide range of TSP test
instances with different characteristics or sizes. While the accuracy of
predicting unused variables naturally deteriorates as a test instance is
further away from the training set, we observe that even when tested on a
different TSP problem variant, the machine learning model still makes useful
predictions about which variables can be eliminated without significantly
impacting solution quality.
","[{'version': 'v1', 'created': 'Tue, 12 May 2020 15:09:20 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Sep 2020 03:13:18 GMT'}]",2020-09-09,"[['Sun', 'Yuan', ''], ['Ernst', 'Andreas', ''], ['Li', 'Xiaodong', ''], ['Weiner', 'Jake', '']]","['Combinatorial optimization', 'machine learning', 'generalization error', 'problem reduction', 'travelling salesman problem']"
13007,1506.06822,Shahram Zarei,"Shahram Zarei, Wolfgang Gerstacker, Jocelyn Aulin, and Robert Schober","I/Q Imbalance Aware Widely-Linear Receiver for Uplink Multi-Cell Massive
  MIMO Systems","To appear in IEEE Transactions on Wireless Communications, 40 pages,
  4 figures",,10.1109/TWC.2016.2520935,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In-phase/quadrature-phase (I/Q) imbalance is one of the most important
hardware impairments in communication systems. It arises in the analogue parts
of direct conversion radio frequency (RF) transceivers and can cause severe
performance losses. In this paper, I/Q imbalance (IQI) aware widely-linear (WL)
channel estimation and data detection schemes for uplink multi-cell massive
multiple-input multiple-output (MIMO) systems are proposed. The resulting
receiver is a WL extension of the minimum mean square error (MMSE) receiver and
jointly mitigates multi-user interference and IQI by processing the real and
the imaginary parts of the received signal separately. The IQI arising at both
the base station (BS) and the user terminals (UTs) is then taken into account.
The considered channel state information (CSI) acquisition model includes the
effects of both estimation errors and pilot contamination, which is caused by
the reuse of the same training sequences in neighboring cells. We apply results
from random matrix theory to derive analytical expressions for the achievable
sum rates of the proposed IQI aware and conventional IQI unaware receivers. Our
simulation results show that the performance of the proposed IQI aware WLMMSE
receiver in a system with IQI is close to that of the MMSE receiver in an ideal
system without IQI. Moreover, our results for the sum rate of the IQI unaware
MMSE receiver reveal that the performance loss due to IQI can be large and, if
left unattended, does not vanish for large numbers of BS antennas.
","[{'version': 'v1', 'created': 'Mon, 22 Jun 2015 23:43:16 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Apr 2016 10:32:46 GMT'}]",2016-04-27,"[['Zarei', 'Shahram', ''], ['Gerstacker', 'Wolfgang', ''], ['Aulin', 'Jocelyn', ''], ['Schober', 'Robert', '']]","['Massive MIMO', 'Widely-Linear Detection', 'I/Q Imbalance', 'Asymptotic Analysis']"
13008,1910.02807,Damian Kowalczyk,"Damian Konrad Kowalczyk, Lars Kai Hansen","The Complexity of Social Media Response: Statistical Evidence For
  One-Dimensional Engagement Signal in Twitter",Presented at ICAART 2020,"Proceedings of the 12th International Conference on Agents and
  Artificial Intelligence - Volume 2: ICAART (2020) 918-925",10.5220/0009169709180925,ICAART20-RP-238,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many years after online social networks exceeded our collective attention,
social influence is still built on attention capital. Quality is not a
prerequisite for viral spreading, yet large diffusion cascades remain the
hallmark of a social influencer. Consequently, our exposure to low-quality
content and questionable influence is expected to increase. Since the
conception of influence maximization frameworks, multiple content performance
metrics became available, albeit raising the complexity of influence analysis.
In this paper, we examine and consolidate a diverse set of content engagement
metrics. The correlations discovered lead us to propose a new, more holistic,
one-dimensional engagement signal. We then show it is more predictable than any
individual influence predictors previously investigated. Our proposed model
achieves strong engagement ranking performance and is the first to explain half
of the variance with features available early. We share the detailed numerical
workflow to compute the new compound engagement signal. The model is
immediately applicable to social media monitoring, influencer identification,
campaign engagement forecasting, and curating user feeds.
","[{'version': 'v1', 'created': 'Mon, 7 Oct 2019 14:11:48 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Jan 2020 19:52:52 GMT'}, {'version': 'v3', 'created': 'Sat, 15 Feb 2020 11:13:18 GMT'}]",2020-06-02,"[['Kowalczyk', 'Damian Konrad', ''], ['Hansen', 'Lars Kai', '']]","['Social', 'Influence', 'Engagement', 'Virality', 'Popularity', 'Twitter']"
13009,2205.01446,Xin Zhou,"Xin Zhou, Huang Huang, He Zhang, Xin Huang, Dong Shao and Chenxing
  Zhong","A Cross-Company Ethnographic Study on Software Teams for DevOps and
  Microservices: Organization, Benefits, and Issues",,,10.1145/3510457.3513054,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: DevOps and microservices are acknowledged to be important new
paradigms to tackle contemporary software demands and provide capabilities for
rapid and reliable software development. Industrial reports show that they are
quickly adopted together in massive software companies. However, because of the
technical and organizational requirements, many difficulties against efficient
implementation of the both emerge in real software teams. Objectives: This
study aims to discover the organization, benefits and issues of software teams
using DevOps & microservices from an immersive perspective. Method: An
ethnographic study was carried out in three companies with different business,
size, products, customers, and degree of globalization. All the three companies
claimed their adoption of DevOps and microservices. Seven months (cumulative)
of participant observations and nine interviews with practitioners were
conducted to collect the data of software teams related to DevOps and
microservices. A cross-company empirical investigation using grounded theory
was done by analyzing the archive data. Results: The adoption of DevOps and
microservices brings benefits to rapid delivery, ability improvements and
burden reduction, whilst the high cost and lack of practical guidance were
emerged. Moreover, our observations and interviews reflect that in software
teams, the relationship between DevOps and microservices is not significant,
which differs from the relationship described in the previous studies. Four
lessons for practitioners and four implications for researchers were discussed
based on our findings. Conclusion: Our findings contribute to the understanding
of the organization, benefits and issues of adopting DevOps and microservices
from an immersive perspective of software teams.
","[{'version': 'v1', 'created': 'Tue, 3 May 2022 12:12:06 GMT'}]",2022-05-04,"[['Zhou', 'Xin', ''], ['Huang', 'Huang', ''], ['Zhang', 'He', ''], ['Huang', 'Xin', ''], ['Shao', 'Dong', ''], ['Zhong', 'Chenxing', '']]","['DevOps', 'microservices', 'ethnographic study', 'participant observation', 'interview']"
13010,2001.02553,Marvin Wyrich,"Marvin Wyrich, Regina Hebig, Stefan Wagner, Riccardo Scandariato",Perception and Acceptance of an Autonomous Refactoring Bot,"8 pages, 2 figures. To be published at 12th International Conference
  on Agents and Artificial Intelligence (ICAART 2020)",,10.5220/0009168803030310,,cs.SE cs.AI cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of autonomous bots for automatic support in software development
tasks is increasing. In the past, however, they were not always perceived
positively and sometimes experienced a negative bias compared to their human
counterparts. We conducted a qualitative study in which we deployed an
autonomous refactoring bot for 41 days in a student software development
project. In between and at the end, we conducted semi-structured interviews to
find out how developers perceive the bot and whether they are more or less
critical when reviewing the contributions of a bot compared to human
contributions. Our findings show that the bot was perceived as a useful and
unobtrusive contributor, and developers were no more critical of it than they
were about their human colleagues, but only a few team members felt responsible
for the bot.
","[{'version': 'v1', 'created': 'Wed, 8 Jan 2020 14:47:54 GMT'}]",2021-02-10,"[['Wyrich', 'Marvin', ''], ['Hebig', 'Regina', ''], ['Wagner', 'Stefan', ''], ['Scandariato', 'Riccardo', '']]","['Software Bot', 'Refactoring', 'Human Agent Interaction', 'Collaborative Development', 'Software Engineering']"
13011,1810.02489,Mostafa Zaman Chowdhury,"Mostafa Zaman Chowdhury, Young-Il Kimb, Won Ryub, and Yeong Min Jang","Popularity based Bandwidth Allocation for Video Broadcast/Multicast over
  Wireless Networks","International Conference on ICT Convergence (ICTC), Sept. 2011,
  Seoul, Korea, pp. 373 -376",,10.1109/ICTC.2011.6082620,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, video broadcast/multicast over wireless networks has created a
significant interest in the field of wireless communication. However, the
wireless resources have limitations to broadcast/multicast many video sessions
at the same time with the best quality. Hence, during the video transmission
through wireless networks, it is very important to make the best utilization of
the limited bandwidth. When the system bandwidth is not sufficient to allocate
the demanded bandwidth for all of the active broadcasting/multicasting video
sessions, instead of allocating equal bandwidth to each of them, our proposed
scheme allocates bandwidth per video session based on popularity of the video
program. Using the mathematical and simulation analyses, we show that the
proposed scheme maximizes average user satisfaction level. The simulation
results also indicate that a large number of subscribers can receive a
significantly improved quality of video. To improve the video quality for large
number of subscribers, the only tradeoff is that a very few subscribers receive
slightly degraded video quality.
","[{'version': 'v1', 'created': 'Fri, 5 Oct 2018 01:52:18 GMT'}]",2018-10-08,"[['Chowdhury', 'Mostafa Zaman', ''], ['Kimb', 'Young-Il', ''], ['Ryub', 'Won', ''], ['Jang', 'Yeong Min', '']]","['¾ Broadcasting/multicasting', 'bandwidth', 'video session', 'popularity', 'wireless networks']"
13012,1703.10345,Besnik Fetahu,Besnik Fetahu and Abhijit Anand and Avishek Anand,How much is Wikipedia Lagging Behind News?,,,10.1145/2786451.2786460,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wikipedia, rich in entities and events, is an invaluable resource for various
knowledge harvesting, extraction and mining tasks. Numerous resources like
DBpedia, YAGO and other knowledge bases are based on extracting entity and
event based knowledge from it. Online news, on the other hand, is an
authoritative and rich source for emerging entities, events and facts relating
to existing entities. In this work, we study the creation of entities in
Wikipedia with respect to news by studying how entity and event based
information flows from news to Wikipedia.
  We analyze the lag of Wikipedia (based on the revision history of the English
Wikipedia) with 20 years of \emph{The New York Times} dataset (NYT). We model
and analyze the lag of entities and events, namely their first appearance in
Wikipedia and in NYT, respectively. In our extensive experimental analysis, we
find that almost 20\% of the external references in entity pages are news
articles encoding the importance of news to Wikipedia. Second, we observe that
the entity-based lag follows a normal distribution with a high standard
deviation, whereas the lag for news-based events is typically very low.
Finally, we find that events are responsible for creation of emergent entities
with as many as 12\% of the entities mentioned in the event page are created
after the creation of the event page.
","[{'version': 'v1', 'created': 'Thu, 30 Mar 2017 08:05:17 GMT'}]",2017-03-31,"[['Fetahu', 'Besnik', ''], ['Anand', 'Abhijit', ''], ['Anand', 'Avishek', '']]","['entity lag', 'event lag', 'news reference density', 'emergent entitydensity', 'wikipedia', 'news corpora']"
13013,2206.03870,Andrew A. Krizhanovsky,"Tatyana Boyko, Nina Zaitseva, Natalia Krizhanovskaya, Andrew
  Krizhanovsky, Irina Novak, Nataliya Pellinen and Aleksandra Rodionova","The Open corpus of the Veps and Karelian languages: overview and
  applications","9 pages, 9 figures, published in the journal",KnE Social Sciences. 7 (3). 2022. P. 29-40,10.18502/kss.v7i3.10419,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  A growing priority in the study of Baltic-Finnic languages of the Republic of
Karelia has been the methods and tools of corpus linguistics. Since 2016,
linguists, mathematicians, and programmers at the Karelian Research Centre have
been working with the Open Corpus of the Veps and Karelian Languages (VepKar),
which is an extension of the Veps Corpus created in 2009. The VepKar corpus
comprises texts in Karelian and Veps, multifunctional dictionaries linked to
them, and software with an advanced system of search using various criteria of
the texts (language, genre, etc.) and numerous linguistic categories (lexical
and grammatical search in texts was implemented thanks to the generator of word
forms that we created earlier). A corpus of 3000 texts was compiled, texts were
uploaded and marked up, the system for classifying texts into languages,
dialects, types and genres was introduced, and the word-form generator was
created. Future plans include developing a speech module for working with audio
recordings and a syntactic tagging module using morphological analysis outputs.
Owing to continuous functional advancements in the corpus manager and ongoing
VepKar enrichment with new material and text markup, users can handle a wide
range of scientific and applied tasks. In creating the universal national
VepKar corpus, its developers and managers strive to preserve and exhibit as
fully as possible the state of the Veps and Karelian languages in the 19th-21st
centuries.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2022 13:05:50 GMT'}]",2022-06-09,"[['Boyko', 'Tatyana', ''], ['Zaitseva', 'Nina', ''], ['Krizhanovskaya', 'Natalia', ''], ['Krizhanovsky', 'Andrew', ''], ['Novak', 'Irina', ''], ['Pellinen', 'Nataliya', ''], ['Rodionova', 'Aleksandra', '']]","['corpus linguistics', 'Veps language', 'Karelian language', 'national corpus', 'dictionary', 'tagging']"
13014,2007.10498,Fatemeh Rouzbeh,"Fatemeh Rouzbeh, Ananth Grama, Paul Griffin, Mohammad Adibuzzaman","Collaborative Cloud Computing Framework for Health Data with Open Source
  Technologies",This paper is accepted in ACM-BCB 2020,,10.1145/3388440.3412460,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The proliferation of sensor technologies and advancements in data collection
methods have enabled the accumulation of very large amounts of data.
Increasingly, these datasets are considered for scientific research. However,
the design of the system architecture to achieve high performance in terms of
parallelization, query processing time, aggregation of heterogeneous data types
(e.g., time series, images, structured data, among others), and difficulty in
reproducing scientific research remain a major challenge. This is specifically
true for health sciences research, where the systems must be i) easy to use
with the flexibility to manipulate data at the most granular level, ii)
agnostic of programming language kernel, iii) scalable, and iv) compliant with
the HIPAA privacy law. In this paper, we review the existing literature for
such big data systems for scientific research in health sciences and identify
the gaps of the current system landscape. We propose a novel architecture for
software-hardware-data ecosystem using open source technologies such as Apache
Hadoop, Kubernetes and JupyterHub in a distributed environment. We also
evaluate the system using a large clinical data set of 69M patients.
","[{'version': 'v1', 'created': 'Mon, 20 Jul 2020 21:50:35 GMT'}]",2020-07-28,"[['Rouzbeh', 'Fatemeh', ''], ['Grama', 'Ananth', ''], ['Griffin', 'Paul', ''], ['Adibuzzaman', 'Mohammad', '']]","['Big Data', 'Healthcare', 'Cloud Computing', 'Hadoop', 'Kubernetes', 'JupyterHub']"
13015,2103.13526,Francesco Osborne,"Thiviyan Thanapalasingam, Francesco Osborne, Aliaksandr Birukou and
  Enrico Motta",Ontology-Based Recommendation of Editorial Products,"In: The Semantic Web - ISWC 2018. Lecture Notes in Computer Science,
  vol 11137. Springer, Cham",,10.1007/978-3-030-00668-6_21,,cs.DL cs.AI cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Major academic publishers need to be able to analyse their vast catalogue of
products and select the best items to be marketed in scientific venues. This is
a complex exercise that requires characterising with a high precision the
topics of thousands of books and matching them with the interests of the
relevant communities. In Springer Nature, this task has been traditionally
handled manually by publishing editors. However, the rapid growth in the number
of scientific publications and the dynamic nature of the Computer Science
landscape has made this solution increasingly inefficient. We have addressed
this issue by creating Smart Book Recommender (SBR), an ontology-based
recommender system developed by The Open University (OU) in collaboration with
Springer Nature, which supports their Computer Science editorial team in
selecting the products to market at specific venues. SBR recommends books,
journals, and conference proceedings relevant to a conference by taking
advantage of a semantically enhanced representation of about 27K editorial
products. This is based on the Computer Science Ontology, a very large-scale,
automatically generated taxonomy of research areas. SBR also allows users to
investigate why a certain publication was suggested by the system. It does so
by means of an interactive graph view that displays the topic taxonomy of the
recommended editorial product and compares it with the topic-centric
characterization of the input conference. An evaluation carried out with seven
Springer Nature editors and seven OU researchers has confirmed the
effectiveness of the solution.
","[{'version': 'v1', 'created': 'Wed, 24 Mar 2021 23:23:53 GMT'}]",2021-03-26,"[['Thanapalasingam', 'Thiviyan', ''], ['Osborne', 'Francesco', ''], ['Birukou', 'Aliaksandr', ''], ['Motta', 'Enrico', '']]","['Recommender Systems', 'Ontology', 'User Interface', 'Scholarly Ontology', 'Scholarly Data']"
13016,2208.01347,Dominik Wurzer,Dominik Wurzer and Yumeng Qin,How UMass-FSD Inadvertently Leverages Temporal Bias,"Temporal Bias, First Story Detection, Topic Detection and Tracking,
  UMass-FSD, LSH-FSD","SIGIR 20, July 2020",10.1145/3397271.3401306,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  First Story Detection describes the task of identifying new events in a
stream of documents. The UMass-FSD system is known for its strong performance
in First Story Detection competitions. Recently, it has been frequently used as
a high accuracy baseline in research publications. We are the first to discover
that UMass-FSD inadvertently leverages temporal bias. Interestingly, the
discovered bias contrasts previously known biases and performs significantly
better. Our analysis reveals an increased contribution of temporally distant
documents, resulting from an unusual way of handling incremental term
statistics. We show that this form of temporal bias is also applicable to other
well-known First Story Detection systems, where it improves the detection
accuracy. To provide a more generalizable conclusion and demonstrate that the
observed bias is not only an artefact of a particular implementation, we
present a model that intentionally leverages a bias on temporal distance. Our
model significantly improves the detection effectiveness of state-of-the-art
First Story Detection systems.
","[{'version': 'v1', 'created': 'Tue, 2 Aug 2022 10:19:29 GMT'}]",2022-08-03,"[['Wurzer', 'Dominik', ''], ['Qin', 'Yumeng', '']]","['Temporal Bias', 'First Story Detection', 'Topic Detection and Tracking', 'UMass-FSD', 'LSH-FSD']"
13017,1801.07618,Ilia Rushkin,"Ilia Rushkin, Isaac Chuang, Dustin Tingley",Modelling and Using Response Times in Online Courses,,"Journal of Learning Analytics, 2019, Volume 6(3), 76-89",10.18608/jla.2019.63.10,,cs.HC cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Each time a learner in a self-paced online course seeks to answer an
assessment question, it takes some time for the student to read the question
and arrive at an answer to submit. If multiple attempts are allowed, and the
first answer is incorrect, it takes some time to provide a second answer. Here
we study the distribution of such ""response times."" We find that the log-normal
statistical model for such times, previously suggested in the literature, holds
for online courses. Users who, according to this model, tend to take longer on
submits are more likely to complete the course, have a higher level of
engagement, and achieve a higher grade. This finding can be the basis for
designing interventions in online courses, such as MOOCs, which would encourage
""fast"" users to slow down.
","[{'version': 'v1', 'created': 'Tue, 23 Jan 2018 15:34:32 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Jul 2019 21:05:36 GMT'}, {'version': 'v3', 'created': 'Wed, 5 Feb 2020 15:37:21 GMT'}]",2020-02-06,"[['Rushkin', 'Ilia', ''], ['Chuang', 'Isaac', ''], ['Tingley', 'Dustin', '']]","['MOOC', 'response\ttime', 'lognormal\ttime\tdistribution']"
13018,2005.09027,Pavel Levin,Benjamin Gutelman and Pavel Levin,"Efficient Image Gallery Representations at Scale Through Multi-Task
  Learning","Proceedings of the 43rd International ACM SIGIR Conference on
  Research and Development in Information Retrieval",,10.1145/3397271.3401433,,cs.CV cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image galleries provide a rich source of diverse information about a product
which can be leveraged across many recommendation and retrieval applications.
We study the problem of building a universal image gallery encoder through
multi-task learning (MTL) approach and demonstrate that it is indeed a
practical way to achieve generalizability of learned representations to new
downstream tasks. Additionally, we analyze the relative predictive performance
of MTL-trained solutions against optimal and substantially more expensive
solutions, and find signals that MTL can be a useful mechanism to address
sparsity in low-resource binary tasks.
","[{'version': 'v1', 'created': 'Mon, 18 May 2020 18:49:22 GMT'}, {'version': 'v2', 'created': 'Mon, 25 May 2020 05:50:53 GMT'}, {'version': 'v3', 'created': 'Fri, 24 Jul 2020 10:24:02 GMT'}]",2020-07-27,"[['Gutelman', 'Benjamin', ''], ['Levin', 'Pavel', '']]","['multi-task learning', 'neural networks', 'image set representations']"
13019,2008.04193,Titouan Carette,Titouan Carette and Emmanuel Jeandel,On a recipe for quantum graphical languages,,,10.4230/LIPIcs.ICALP.2020.118,,cs.LO quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Different graphical calculi have been proposed to represent quantum
computation. First the ZX- calculus [4], followed by the ZW-calculus [12] and
then the ZH-calculus [1]. We can wonder if new Z*-calculi will continue to be
proposed forever. This article answers negatively. All those language share a
common core structure we call Z*-algebras. We classify Z*-algebras up to
isomorphism in two dimensional Hilbert spaces and show that they are all
variations of the aforementioned calculi. We do the same for linear relations
and show that the calculus of [2] is essentially the unique one.
","[{'version': 'v1', 'created': 'Mon, 10 Aug 2020 15:26:08 GMT'}]",2020-08-11,"[['Carette', 'Titouan', ''], ['Jeandel', 'Emmanuel', '']]","['Categorical Quantum Mechanics', 'Quantum Computing', 'Category Theory']"
13020,2208.05877,Dennis Trautwein,"Dennis Trautwein, Aravindh Raman, Gareth Tyson, Ignacio Castro, Will
  Scott, Moritz Schubotz, Bela Gipp, Yiannis Psaras",Design and Evaluation of IPFS: A Storage Layer for the Decentralized Web,"14 pages, 11 figures","SIGCOMM '22, August 22-26, 2022, Amsterdam, Netherlands",10.1145/3544216.3544232,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  Recent years have witnessed growing consolidation of web operations. For
example, the majority of web traffic now originates from a few organizations,
and even micro-websites often choose to host on large pre-existing cloud
infrastructures. In response to this, the ""Decentralized Web"" attempts to
distribute ownership and operation of web services more evenly. This paper
describes the design and implementation of the largest and most widely used
Decentralized Web platform - the InterPlanetary File System (IPFS) - an
open-source, content-addressable peer-to-peer network that provides distributed
data storage and delivery. IPFS has millions of daily content retrievals and
already underpins dozens of third-party applications. This paper evaluates the
performance of IPFS by introducing a set of measurement methodologies that
allow us to uncover the characteristics of peers in the IPFS network. We reveal
presence in more than 2700 Autonomous Systems and 152 countries, the majority
of which operate outside large central cloud providers like Amazon or Azure. We
further evaluate IPFS performance, showing that both publication and retrieval
delays are acceptable for a wide range of use cases. Finally, we share our
datasets, experiences and lessons learned.
","[{'version': 'v1', 'created': 'Thu, 11 Aug 2022 15:27:01 GMT'}]",2022-08-12,"[['Trautwein', 'Dennis', ''], ['Raman', 'Aravindh', ''], ['Tyson', 'Gareth', ''], ['Castro', 'Ignacio', ''], ['Scott', 'Will', ''], ['Schubotz', 'Moritz', ''], ['Gipp', 'Bela', ''], ['Psaras', 'Yiannis', '']]","['Interplanetary file system', 'content addressing', 'decentralized web', 'libp2p', 'content addressable storage']"
13021,2003.08615,Ali Balali,"Ali Balali, Masoud Asadpour, Ricardo Campos, Adam Jatowt","Joint Event Extraction along Shortest Dependency Paths using Graph
  Convolutional Networks",,"Knowledge-Based Systems, Volume 210, Year 2020, Page 106492",10.1016/j.knosys.2020.106492,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Event extraction (EE) is one of the core information extraction tasks, whose
purpose is to automatically identify and extract information about incidents
and their actors from texts. This may be beneficial to several domains such as
knowledge bases, question answering, information retrieval and summarization
tasks, to name a few. The problem of extracting event information from texts is
longstanding and usually relies on elaborately designed lexical and syntactic
features, which, however, take a large amount of human effort and lack
generalization. More recently, deep neural network approaches have been adopted
as a means to learn underlying features automatically. However, existing
networks do not make full use of syntactic features, which play a fundamental
role in capturing very long-range dependencies. Also, most approaches extract
each argument of an event separately without considering associations between
arguments which ultimately leads to low efficiency, especially in sentences
with multiple events. To address the two above-referred problems, we propose a
novel joint event extraction framework that aims to extract multiple event
triggers and arguments simultaneously by introducing shortest dependency path
(SDP) in the dependency graph. We do this by eliminating irrelevant words in
the sentence, thus capturing long-range dependencies. Also, an attention-based
graph convolutional network is proposed, to carry syntactically related
information along the shortest paths between argument candidates that captures
and aggregates the latent associations between arguments; a problem that has
been overlooked by most of the literature. Our results show a substantial
improvement over state-of-the-art methods.
","[{'version': 'v1', 'created': 'Thu, 19 Mar 2020 07:48:38 GMT'}]",2020-10-29,"[['Balali', 'Ali', ''], ['Asadpour', 'Masoud', ''], ['Campos', 'Ricardo', ''], ['Jatowt', 'Adam', '']]","['Information extraction', 'Event extraction', 'Deep learning', 'Shortest dependency path', 'Graph convolution network']"
13022,2201.02555,Aidan Hughes,"Aidan J. Hughes, Lawrence A. Bull, Paul Gardner, Nikolaos Dervilis,
  Keith Worden","On robust risk-based active-learning algorithms for enhanced decision
  support","Author accepted manuscript, 48 pages, 39 figures, published in
  Mechanical Systems and Signal Processing",Mechanical Systems and Signal Processing 181 (2022) 109502,10.1016/j.ymssp.2022.109502,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Classification models are a fundamental component of physical-asset
management technologies such as structural health monitoring (SHM) systems and
digital twins. Previous work introduced risk-based active learning, an online
approach for the development of statistical classifiers that takes into account
the decision-support context in which they are applied. Decision-making is
considered by preferentially querying data labels according to expected value
of perfect information (EVPI). Although several benefits are gained by adopting
a risk-based active learning approach, including improved decision-making
performance, the algorithms suffer from issues relating to sampling bias as a
result of the guided querying process. This sampling bias ultimately manifests
as a decline in decision-making performance during the later stages of active
learning, which in turn corresponds to lost resource/utility.
  The current paper proposes two novel approaches to counteract the effects of
sampling bias: semi-supervised learning, and discriminative classification
models. These approaches are first visualised using a synthetic dataset, then
subsequently applied to an experimental case study, specifically, the Z24
Bridge dataset. The semi-supervised learning approach is shown to have variable
performance; with robustness to sampling bias dependent on the suitability of
the generative distributions selected for the model with respect to each
dataset. In contrast, the discriminative classifiers are shown to have
excellent robustness to the effects of sampling bias. Moreover, it was found
that the number of inspections made during a monitoring campaign, and therefore
resource expenditure, could be reduced with the careful selection of the
statistical classifiers used within a decision-supporting monitoring system.
","[{'version': 'v1', 'created': 'Fri, 7 Jan 2022 17:25:41 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Jul 2022 15:19:55 GMT'}]",2022-07-13,"[['Hughes', 'Aidan J.', ''], ['Bull', 'Lawrence A.', ''], ['Gardner', 'Paul', ''], ['Dervilis', 'Nikolaos', ''], ['Worden', 'Keith', '']]","['decision-making', 'active learning', 'value of information', 'structural health monitoring', 'sampling bias', 'digital twins', 'risk']"
13023,2109.15139,Premathas Somasekaram,"Premathas Somasekaram, Radu Calinescu and Rajkumar Buyya","High-Availability Clusters: A Taxonomy, Survey, and Future Directions",Published in Journal of Systems and Software,"Journal of Systems and Software, Volume 187, 2022, 111208",10.1016/j.jss.2021.111208,,cs.DC cs.NI cs.SY eess.SY,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The delivery of key services in domains ranging from finance and
manufacturing to healthcare and transportation is underpinned by a rapidly
growing number of mission-critical enterprise applications. Ensuring the
continuity of these complex applications requires the use of software-managed
infrastructures called high-availability clusters (HACs). HACs employ
sophisticated techniques to monitor the health of key enterprise application
layers and of the resources they use, and to seamlessly restart or relocate
application components after failures. In this paper, we first describe the
manifold uses of HACs to protect essential layers of a critical application and
present the architecture of high availability clusters. We then propose a
taxonomy that covers all key aspects of HACs -- deployment patterns,
application areas, types of cluster, topology, cluster management, failure
detection and recovery, consistency and integrity, and data synchronisation;
and we use this taxonomy to provide a comprehensive survey of the end-to-end
software solutions available for the HAC deployment of enterprise applications.
Finally, we discuss the limitations and challenges of existing HAC solutions,
and we identify opportunities for future research in the area.
","[{'version': 'v1', 'created': 'Thu, 30 Sep 2021 13:58:48 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Oct 2021 09:53:15 GMT'}, {'version': 'v3', 'created': 'Thu, 22 Sep 2022 00:28:39 GMT'}]",2022-09-23,"[['Somasekaram', 'Premathas', ''], ['Calinescu', 'Radu', ''], ['Buyya', 'Rajkumar', '']]","['Clustering', 'dependability', 'enterprise system', 'high availability', 'high availability clusters', 'reliability']"
13024,2010.07413,Mrityunjay Ghosh,"Mrityunjay Ghosh, Nivedita Dey, Debdeep Mitra and Amlan Chakrabarti",A Novel Quantum Algorithm for Ant Colony Optimization,"13 pages, 13 figures",IET Quantum Communication 2021,10.1049/qtc2.12023,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ant colony optimization (ACO) is a commonly used meta-heuristic to solve
complex combinatorial optimization problems like traveling salesman problem
(TSP), vehicle routing problem (VRP), etc. However, classical ACO algorithms
provide better optimal solutions but do not reduce computation time overhead to
a significant extent. Algorithmic speed-up can be achieved by using parallelism
offered by quantum computing. Existing quantum algorithms to solve ACO are
either quantum-inspired classical algorithms or hybrid quantum-classical
algorithms. Since all these algorithms need the intervention of classical
computing, leveraging the true potential of quantum computing on real quantum
hardware remains a challenge. This paper's main contribution is to propose a
fully quantum algorithm to solve ACO, enhancing the quantum information
processing toolbox in the fault-tolerant quantum computing (FTQC) era. We have
Solved the Single Source Single Destination (SSSD) shortest-path problem using
our proposed adaptive quantum circuit for representing dynamic pheromone
updating strategy in real IBMQ devices. Our quantum ACO technique can be
further used as a quantum ORACLE to solve complex optimization problems in a
fully quantum setup with significant speed up upon the availability of more
qubits.
","[{'version': 'v1', 'created': 'Wed, 14 Oct 2020 21:41:26 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Sep 2021 06:58:55 GMT'}]",2021-11-05,"[['Ghosh', 'Mrityunjay', ''], ['Dey', 'Nivedita', ''], ['Mitra', 'Debdeep', ''], ['Chakrabarti', 'Amlan', '']]","['Quantum Computing', 'Quantum Algorithm', 'Ant Colony Optimization', 'QACO', 'Quantum Ant', 'Quantum Circuit Synthesis']"
13025,2103.05916,Dominique Vaufreydaz,"Louis Airale (M-PSI, PERCEPTION), Dominique Vaufreydaz (M-PSI), Xavier
  Alameda-Pineda (PERCEPTION)",SocialInteractionGAN: Multi-person Interaction Sequence Generation,"IEEE Transactions on Affective Computing, Institute of Electrical and
  Electronics Engineers, 2022",,10.1109/TAFFC.2022.3171719,,cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Prediction of human actions in social interactions has important applications
in the design of social robots or artificial avatars. In this paper, we focus
on a unimodal representation of interactions and propose to tackle interaction
generation in a data-driven fashion. In particular, we model human interaction
generation as a discrete multi-sequence generation problem and present
SocialInteractionGAN, a novel adversarial architecture for conditional
interaction generation. Our model builds on a recurrent encoder-decoder
generator network and a dual-stream discriminator, that jointly evaluates the
realism of interactions and individual action sequences and operates at
different time scales. Crucially, contextual information on interacting
participants is shared among agents and reinjected in both the generation and
the discriminator evaluation processes. Experiments show that albeit dealing
with low dimensional data, SocialInteractionGAN succeeds in producing high
realism action sequences of interacting people, comparing favorably to a
diversity of recurrent and convolutional discriminator baselines, and we argue
that this work will constitute a first stone towards higher dimensional and
multimodal interaction generation. Evaluations are conducted using classical
GAN metrics, that we specifically adapt for discrete sequential data. Our model
is shown to properly learn the dynamics of interaction sequences, while
exploiting the full range of available actions.
","[{'version': 'v1', 'created': 'Wed, 10 Mar 2021 08:11:34 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Sep 2022 08:43:42 GMT'}]",2022-09-13,"[['Airale', 'Louis', '', 'M-PSI, PERCEPTION'], ['Vaufreydaz', 'Dominique', '', 'M-PSI'], ['Alameda-Pineda', 'Xavier', '', 'PERCEPTION']]","['Multi-person interactions', 'discrete sequencegeneration', 'adversarial learning']"
13026,1904.12040,Elisa Claire Alem\'an Carre\'on,"Asahi Hentona, Takeshi Sakumoto, Hugo Alberto Mendoza Espa\~na,
  Hirofumi Nonaka, Shotaro Kataoka, Toru Hiraoka, Kensei Nakai, Elisa Claire
  Alem\'an Carre\'on and Masaharu Hirota","Community Detection and Growth Potential Prediction from Patent Citation
  Networks",arXiv admin note: text overlap with arXiv:1607.00653 by other authors,"In Proceedings of the 10th International Conference on Management
  of Emergent Digital EcoSystems (MEDES'18). pp. 204 - 211. Tokyo, Japan.
  September 25-28, 2018",10.1145/3281375.3281396,,cs.IR cs.SI physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  The scoring of patents is useful for technology management analysis.
Therefore, a necessity of developing citation network clustering and prediction
of future citations for practical patent scoring arises. In this paper, we
propose a community detection method using the Node2vec. And in order to
analyze growth potential we compare three ''time series analysis methods'', the
Long Short-Term Memory (LSTM), ARIMA model, and Hawkes Process. The results of
our experiments, we could find common technical points from those clusters by
Node2vec. Furthermore, we found that the prediction accuracy of the ARIMA model
was higher than that of other models.
","[{'version': 'v1', 'created': 'Tue, 23 Apr 2019 15:36:35 GMT'}]",2019-04-30,"[['Hentona', 'Asahi', ''], ['Sakumoto', 'Takeshi', ''], ['España', 'Hugo Alberto Mendoza', ''], ['Nonaka', 'Hirofumi', ''], ['Kataoka', 'Shotaro', ''], ['Hiraoka', 'Toru', ''], ['Nakai', 'Kensei', ''], ['Carreón', 'Elisa Claire Alemán', ''], ['Hirota', 'Masaharu', '']]","['Patent analysis', 'Community detection', 'Growth prediction', 'Node2vec', 'ARIMA', 'LSTM', 'Hawkes process']"
13027,2109.09461,Soundes Marzougui,"Soundes Marzougui, Nils Wisiol, Patrick Gersch, Juliane Kr\""amer and
  Jean-Pierre Seifert","Machine-Learning Side-Channel Attacks on the GALACTICS Constant-Time
  Implementation of BLISS","23 pages, 4 Figures, 7 algorithms","The 17th International Conference on Availability, Reliability and
  Security (ARES 2022), August 23--26, 2022, Vienna, Austria",10.1145/3538969.3538980,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Due to the advancing development of quantum computers, practical attacks on
conventional public-key cryptography may become feasible in the next few
decades. To address this risk, post-quantum schemes that are secure against
quantum attacks are being developed.
  Lattice-based algorithms are promising replacements for conventional schemes,
with BLISS being one of the earliest post-quantum signature schemes in this
family. However, required subroutines such as Gaussian sampling have been
demonstrated to be a risk for the security of BLISS, since implementing
Gaussian sampling both efficient and secure with respect to physical attacks is
highly challenging.
  This paper presents three related power side-channel attacks on GALACTICS,
the latest constant-time implementation of BLISS. All attacks are based on
leakages we identified in the Gaussian sampling and signing algorithm of
GALACTICS.
  To run the attack, a profiling phase on a device identical to the device
under attack is required to train machine learning classifiers.
  In the attack phase, the leakages of GALACTICS enable the trained classifiers
to predict sensitive internal information with high accuracy, paving the road
for three different key recovery attacks.
  We demonstrate the leakages by running GALACTICS on a Cortex-M4 and provide
proof-of-concept data and implementation for all our attacks.
","[{'version': 'v1', 'created': 'Mon, 20 Sep 2021 12:16:30 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Sep 2021 16:56:35 GMT'}, {'version': 'v3', 'created': 'Wed, 8 Jun 2022 21:00:40 GMT'}]",2022-06-10,"[['Marzougui', 'Soundes', ''], ['Wisiol', 'Nils', ''], ['Gersch', 'Patrick', ''], ['Krämer', 'Juliane', ''], ['Seifert', 'Jean-Pierre', '']]","['side-channel analysis', 'Machine-Learning', 'post-quantum cryptography', 'Gaussian sampler', 'BLISS', 'GALACTICS']"
13028,2208.14795,Dickson Owuor Dr.,"Dickson Odhiambo Owuor and Thomas Runkler and Anne Laurent and Joseph
  Orero and Edmond Menya",Ant Colony Optimization for Mining Gradual Patterns,"35 pages, journal article","Int. J. Mach. Learn. & Cyber. 12, 2989--3009 (2021)",10.1007/s13042-021-01390-w,,cs.DB cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Gradual pattern extraction is a field in (KDD) Knowledge Discovery in
Databases that maps correlations between attributes of a data set as gradual
dependencies. A gradual dependency may take a form of ""the more Attribute K ,
the less Attribute L"". In this paper, we propose an ant colony optimization
technique that uses a probabilistic approach to learn and extract frequent
gradual patterns. Through computational experiments on real-world data sets, we
compared the performance of our ant-based algorithm to an existing gradual item
set extraction algorithm and we found out that our algorithm outperforms the
later especially when dealing with large data sets.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2022 12:22:57 GMT'}]",2022-09-01,"[['Owuor', 'Dickson Odhiambo', ''], ['Runkler', 'Thomas', ''], ['Laurent', 'Anne', ''], ['Orero', 'Joseph', ''], ['Menya', 'Edmond', '']]","['Ant Colony Optimization', 'Data Mining', 'Genetic Algorithm', 'Gradual Patterns', 'Particle Swarm Optimization', 'Swarm Intelligence']"
13029,2208.07704,Chaoyun Zhang,"Chaoyun Zhang, Kai Wang, Hao Chen, Ge Fan, Yingjie Li, Lifang Wu,
  Bingchao Zheng",QuickSkill: Novice Skill Estimation in Online Multiplayer Games,Accepted by CIKM 2022 Applied Research Track,,10.1145/3511808.3557070,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Matchmaking systems are vital for creating fair matches in online multiplayer
games, which directly affects players' satisfactions and game experience. Most
of the matchmaking systems largely rely on precise estimation of players' game
skills to construct equitable games. However, the skill rating of a novice is
usually inaccurate, as current matchmaking rating algorithms require
considerable amount of games for learning the true skill of a new player. Using
these unreliable skill scores at early stages for matchmaking usually leads to
disparities in terms of team performance, which causes negative game
experience. This is known as the ''cold-start'' problem for matchmaking rating
algorithms.
  To overcome this conundrum, this paper proposes QuickSKill, a deep learning
based novice skill estimation framework to quickly probe abilities of new
players in online multiplayer games. QuickSKill extracts sequential performance
features from initial few games of a player to predict his/her future skill
rating with a dedicated neural network, thus delivering accurate skill
estimation at the player's early game stage. By employing QuickSKill for
matchmaking, game fairness can be dramatically improved in the initial
cold-start period. We conduct experiments in a popular mobile multiplayer game
in both offline and online scenarios. Results obtained with two real-world
anonymized gaming datasets demonstrate that proposed QuickSKill delivers
precise estimation of game skills for novices, leading to significantly lower
team skill disparities and better player game experience. To the best of our
knowledge, proposed QuickSKill is the first framework that tackles the
cold-start problem for traditional skill rating algorithms.
","[{'version': 'v1', 'created': 'Mon, 15 Aug 2022 11:59:05 GMT'}]",2022-08-17,"[['Zhang', 'Chaoyun', ''], ['Wang', 'Kai', ''], ['Chen', 'Hao', ''], ['Fan', 'Ge', ''], ['Li', 'Yingjie', ''], ['Wu', 'Lifang', ''], ['Zheng', 'Bingchao', '']]","['Game Skill Estimation', 'Online Multiplayer Game', 'Game Matchmaking', 'Deep Learning']"
13030,2009.08805,Matteo Giacomini,"Matteo Giacomini, Ruben Sevilla and Antonio Huerta","HDGlab: An open-source implementation of the hybridisable discontinuous
  Galerkin method in MATLAB","90 pages, 51 figures","Archives of Computational Methods in Engineering, Vol. 28, Issue
  3, pp. 1941-1986, 2021",10.1007/s11831-020-09502-5,,cs.MS cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents HDGlab, an open source MATLAB implementation of the
hybridisable discontinuous Galerkin (HDG) method. The main goal is to provide a
detailed description of both the HDG method for elliptic problems and its
implementation available in HDGlab. Ultimately, this is expected to make this
relatively new advanced discretisation method more accessible to the
computational engineering community. HDGlab presents some features not
available in other implementations of the HDG method that can be found in the
free domain. First, it implements high-order polynomial shape functions up to
degree nine, with both equally-spaced and Fekete nodal distributions. Second,
it supports curved isoparametric simplicial elements in two and three
dimensions. Third, it supports non-uniform degree polynomial approximations and
it provides a flexible structure to devise degree adaptivity strategies.
Finally, an interface with the open-source high-order mesh generator Gmsh is
provided to facilitate its application to practical engineering problems.
","[{'version': 'v1', 'created': 'Wed, 16 Sep 2020 21:28:09 GMT'}]",2021-06-28,"[['Giacomini', 'Matteo', ''], ['Sevilla', 'Ruben', ''], ['Huerta', 'Antonio', '']]","['hybridizable discontinuous Galerkin', 'high-order', 'elliptic problems', 'MATLAB', 'open-source']"
13031,2109.08052,Ambareesh Revanur,"Ambareesh Revanur, Vijay Kumar, Deepthi Sharma",Semi-Supervised Visual Representation Learning for Fashion Compatibility,"ACM RecSys'21 (9 pages) DOI:
  https://dl.acm.org/doi/10.1145/3460231.3474233",,10.1145/3460231.3474233,,cs.CV cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We consider the problem of complementary fashion prediction. Existing
approaches focus on learning an embedding space where fashion items from
different categories that are visually compatible are closer to each other.
However, creating such labeled outfits is intensive and also not feasible to
generate all possible outfit combinations, especially with large fashion
catalogs. In this work, we propose a semi-supervised learning approach where we
leverage large unlabeled fashion corpus to create pseudo-positive and
pseudo-negative outfits on the fly during training. For each labeled outfit in
a training batch, we obtain a pseudo-outfit by matching each item in the
labeled outfit with unlabeled items. Additionally, we introduce consistency
regularization to ensure that representation of the original images and their
transformations are consistent to implicitly incorporate colour and other
important attributes through self-supervision. We conduct extensive experiments
on Polyvore, Polyvore-D and our newly created large-scale Fashion Outfits
datasets, and show that our approach with only a fraction of labeled examples
performs on-par with completely supervised methods.
","[{'version': 'v1', 'created': 'Thu, 16 Sep 2021 15:35:38 GMT'}]",2021-09-17,"[['Revanur', 'Ambareesh', ''], ['Kumar', 'Vijay', ''], ['Sharma', 'Deepthi', '']]","['fashion compatibility', 'semi-supervised learning', 'self-supervision', 'product recommendation']"
13032,2011.05260,Mohammadreza Baharani,"Mohammadreza Baharani, Hamed Tabkhi",ATCN: Resource-Efficient Processing of Time Series on Edge,Published in ACM Trans. Embed. Comput. Syst. (March 2022),,10.1145/3524070,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a scalable deep learning model called Agile Temporal
Convolutional Network (ATCN) for high-accurate fast classification and time
series prediction in resource-constrained embedded systems. ATCN is a family of
compact networks with formalized hyperparameters that enable
application-specific adjustments to be made to the model architecture. It is
primarily designed for embedded edge devices with very limited performance and
memory, such as wearable biomedical devices and real-time reliability
monitoring systems. ATCN makes fundamental improvements over the mainstream
temporal convolutional neural networks, including residual connections to
increase the network depth and accuracy, and the incorporation of separable
depth-wise convolution to reduce the computational complexity of the model. As
part of the present work, two ATCN families, namely T0, and T1 are also
presented and evaluated on different ranges of embedded processors - Cortex-M7
and Cortex-A57 processor. An evaluation of the ATCN models against the
best-in-class InceptionTime and MiniRocket shows that ATCN almost maintains
accuracy while improving the execution time on a broad range of embedded and
cyber-physical applications with demand for real-time processing on the
embedded edge. At the same time, in contrast to existing solutions, ATCN is the
first time-series classifier based on deep learning that can be run bare-metal
on embedded microcontrollers (Cortex-M7) with limited computational performance
and memory capacity while delivering state-of-the-art accuracy.
","[{'version': 'v1', 'created': 'Tue, 10 Nov 2020 17:26:49 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Nov 2020 23:30:04 GMT'}, {'version': 'v3', 'created': 'Sun, 1 Aug 2021 07:56:42 GMT'}, {'version': 'v4', 'created': 'Mon, 21 Mar 2022 22:08:22 GMT'}]",2022-03-23,"[['Baharani', 'Mohammadreza', ''], ['Tabkhi', 'Hamed', '']]","['Temporal Convolutional Networks (TCN)', 'Recurrent Neural Networks (RNN)', 'Real-time EdgeComputing']"
13033,2011.02473,Jo\~ao Eduardo Montandon,"Jo\~ao Eduardo Montandon and Cristiano Politowski and Luciana Lourdes
  Silva and Marco Tulio Valente and Fabio Petrillo and Yann-Ga\""el
  Gu\'eh\'eneuc","What Skills do IT Companies look for in New Developers? A Study with
  Stack Overflow Jobs",,Information and Software Technology 129 (January 2021) 106429,10.1016/j.infsof.2020.106429,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: There is a growing demand for information on how IT companies look
for candidates to their open positions. Objective: This paper investigates
which hard and soft skills are more required in IT companies by analyzing the
description of 20,000 job opportunities. Method: We applied open card sorting
to perform a high-level analysis on which types of hard skills are more
requested. Further, we manually analyzed the most mentioned soft skills.
Results: Programming languages are the most demanded hard skills.
Communication, collaboration, and problem-solving are the most demanded soft
skills. Conclusion: We recommend developers to organize their resum\'e
according to the positions they are applying. We also highlight the importance
of soft skills, as they appear in many job opportunities.
","[{'version': 'v1', 'created': 'Wed, 4 Nov 2020 18:45:10 GMT'}]",2020-11-05,"[['Montandon', 'João Eduardo', ''], ['Politowski', 'Cristiano', ''], ['Silva', 'Luciana Lourdes', ''], ['Valente', 'Marco Tulio', ''], ['Petrillo', 'Fabio', ''], ['Guéhéneuc', 'Yann-Gaël', '']]","['Hiring', 'Soft Skills', 'Hard Skills', 'Stack Overflow']"
13034,2212.00003,Xinquan Wen,"Xinquan Wen, Yiying Wu","Slowing Plants, Slowing Home",,,10.1145/3547522.3547691,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  The Anthropocene is causing a global crisis in recent decades. Facing this
challenge, increasing attempts are being made to explore the
more-than-human-centred perspective in HCI and design. Our research sets out to
explore the ways of experiencing and interacting with plants with a case study
on the slowness of plants. Utilising existing time-lapse technology, we
investigate the role of IoT technologies in associating biological slowness
with the networked technological environment of the home. In the experiment, we
chose the humidity level of the environment as the variable to synchronise the
movement of smart curtains and plants. We propose a relationship-centred
strategy that uses an inclusive feature of a microclimate, like humidity,
instead of the plant itself, for human-plant interaction. Furthermore, it
indicates a 'plant-decentred' perspective to spark critical reflection on the
taken-for-granted perception of isolating a person or a plant as an individual
entity.
","[{'version': 'v1', 'created': 'Tue, 4 Oct 2022 07:16:36 GMT'}]",2022-12-02,"[['Wen', 'Xinquan', ''], ['Wu', 'Yiying', '']]","['Human-plant interaction', 'More-than-human', 'Design experimentation']"
13035,2002.00850,Aron Szanto,"Nir Rosenfeld, Aron Szanto, David C. Parkes","A Kernel of Truth: Determining Rumor Veracity on Twitter by Diffusion
  Pattern Alone",Published at The Web Conference (WWW) 2020,,10.1145/3366423.3380180,,cs.SI cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Recent work in the domain of misinformation detection has leveraged rich
signals in the text and user identities associated with content on social
media. But text can be strategically manipulated and accounts reopened under
different aliases, suggesting that these approaches are inherently brittle. In
this work, we investigate an alternative modality that is naturally robust: the
pattern in which information propagates. Can the veracity of an unverified
rumor spreading online be discerned solely on the basis of its pattern of
diffusion through the social network?
  Using graph kernels to extract complex topological information from Twitter
cascade structures, we train accurate predictive models that are blind to
language, user identities, and time, demonstrating for the first time that such
""sanitized"" diffusion patterns are highly informative of veracity. Our results
indicate that, with proper aggregation, the collective sharing pattern of the
crowd may reveal powerful signals of rumor truth or falsehood, even in the
early stages of propagation.
","[{'version': 'v1', 'created': 'Tue, 28 Jan 2020 19:56:03 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Feb 2020 14:30:49 GMT'}]",2020-02-07,"[['Rosenfeld', 'Nir', ''], ['Szanto', 'Aron', ''], ['Parkes', 'David C.', '']]","['Social networks', 'Social media', 'Information propagation', 'Information diffusion', 'Misinformation', 'Rumors', 'Graph kernels']"
13036,2103.04931,Bartosz Sawicki,"Maciej \'Swiechowski, Konrad Godlewski, Bartosz Sawicki, Jacek
  Ma\'ndziuk","Monte Carlo Tree Search: A Review of Recent Modifications and
  Applications","99 pages, Accepted to Artificial Intelligence Review journal","Artificial Intelligence Review (2022), Open Access, published: 19
  July 2022",10.1007/s10462-022-10228-y,,cs.AI cs.LG cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Monte Carlo Tree Search (MCTS) is a powerful approach to designing
game-playing bots or solving sequential decision problems. The method relies on
intelligent tree search that balances exploration and exploitation. MCTS
performs random sampling in the form of simulations and stores statistics of
actions to make more educated choices in each subsequent iteration. The method
has become a state-of-the-art technique for combinatorial games, however, in
more complex games (e.g. those with high branching factor or real-time ones),
as well as in various practical domains (e.g. transportation, scheduling or
security) an efficient MCTS application often requires its problem-dependent
modification or integration with other techniques. Such domain-specific
modifications and hybrid approaches are the main focus of this survey. The last
major MCTS survey has been published in 2012. Contributions that appeared since
its release are of particular interest for this review.
","[{'version': 'v1', 'created': 'Mon, 8 Mar 2021 17:44:15 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Mar 2021 13:04:22 GMT'}, {'version': 'v3', 'created': 'Wed, 27 Apr 2022 21:48:55 GMT'}, {'version': 'v4', 'created': 'Sat, 11 Jun 2022 09:12:50 GMT'}]",2022-07-21,"[['Świechowski', 'Maciej', ''], ['Godlewski', 'Konrad', ''], ['Sawicki', 'Bartosz', ''], ['Mańdziuk', 'Jacek', '']]","['Monte Carlo Tree Search', 'Combinatorial Optimization', 'Simulations', 'Machine Learning', 'Games']"
13037,2111.00990,Piotr Szyma\'nski,"Kamil Raczycki, Piotr Szyma\'nski","Transfer Learning Approach to Bicycle-sharing Systems' Station Location
  Planning using OpenStreetMap Data","Accepted to 4th ACM SIGSPATIAL International Workshop on Advances in
  Resilient and Intelligent Cities",,10.1145/3486626.3493434,,cs.LG cs.AI,http://creativecommons.org/licenses/by-sa/4.0/,"  Bicycle-sharing systems (BSS) have become a daily reality for many citizens
of larger, wealthier cities in developed regions. However, planning the layout
of bicycle-sharing stations usually requires expensive data gathering,
surveying travel behavior and trip modelling followed by station layout
optimization. Many smaller cities and towns, especially in developing areas,
may have difficulty financing such projects. Planning a BSS also takes a
considerable amount of time. Yet as the pandemic has shown us, municipalities
will face the need to adapt rapidly to mobility shifts, which include citizens
leaving public transport for bicycles. Laying out a bike sharing system quickly
will become critical in addressing the increase in bike demand. This paper
addresses the problem of cost and time in BSS layout design and proposes a new
solution to streamline and facilitate the process of such planning by using
spatial embedding methods. Based only on publicly available data from
OpenStreetMap, and station layouts from 34 cities in Europe, a method has been
developed to divide cities into micro-regions using the Uber H3 discrete global
grid system and to indicate regions where it is worth placing a station based
on existing systems in different cities using transfer learning. The result of
the work is a mechanism to support planners in their decision making when
planning a station layout with a choice of reference cities.
","[{'version': 'v1', 'created': 'Mon, 1 Nov 2021 14:56:49 GMT'}]",2021-11-02,"[['Raczycki', 'Kamil', ''], ['Szymański', 'Piotr', '']]","['Bicycle-sharing system', 'Bicycle station prediction', 'OpenStreetMaprepresentation', 'Spatial data embedding']"
13038,2205.15565,Emre Can Kuran,"Emre Can Kuran, Umut Kuran and Mehmet Bilal Er","Sub-Image Histogram Equalization using Coot Optimization Algorithm for
  Segmentation and Parameter Selection",14 pages,,10.5121/csit.2022.120903,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Contrast enhancement is very important in terms of assessing images in an
objective way. Contrast enhancement is also significant for various algorithms
including supervised and unsupervised algorithms for accurate classification of
samples. Some contrast enhancement algorithms solve this problem by addressing
the low contrast issue. Mean and variance based sub-image histogram
equalization (MVSIHE) algorithm is one of these contrast enhancements methods
proposed in the literature. It has different parameters which need to be tuned
in order to achieve optimum results. With this motivation, in this study, we
employed one of the most recent optimization algorithms, namely, coot
optimization algorithm (COA) for selecting appropriate parameters for the
MVSIHE algorithm. Blind/referenceless image spatial quality evaluator (BRISQUE)
and natural image quality evaluator (NIQE) metrics are used for evaluating
fitness of the coot swarm population. The results show that the proposed method
can be used in the field of biomedical image processing.
","[{'version': 'v1', 'created': 'Tue, 31 May 2022 06:51:45 GMT'}]",2022-06-01,"[['Kuran', 'Emre Can', ''], ['Kuran', 'Umut', ''], ['Er', 'Mehmet Bilal', '']]","['Contrast Enhancement', 'Coot Optimization Algorithm', 'Knee X-Ray Images', 'Biomedical Image Processing']"
13039,2011.06549,Maxime Chaveroche,"Maxime Chaveroche, Franck Davoine, V\'eronique Cherfaoui","Focal points and their implications for M\""obius Transforms and
  Dempster-Shafer Theory",Accepted for publication in Elsevier Information Sciences Journal,Information Sciences 555 (2021) 215-235,10.1016/j.ins.2020.10.060,,cs.DM cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Dempster-Shafer Theory (DST) generalizes Bayesian probability theory,
offering useful additional information, but suffers from a much higher
computational burden. A lot of work has been done to reduce the time complexity
of information fusion with Dempster's rule, which is a pointwise multiplication
of two zeta transforms, and optimal general algorithms have been found to get
the complete definition of these transforms. Yet, it is shown in this paper
that the zeta transform and its inverse, the M\""obius transform, can be exactly
simplified, fitting the quantity of information contained in belief functions.
Beyond that, this simplification actually works for any function on any
partially ordered set. It relies on a new notion that we call focal point and
that constitutes the smallest domain on which both the zeta and M\""obius
transforms can be defined. We demonstrate the interest of these general results
for DST, not only for the reduction in complexity of most transformations
between belief representations and their fusion, but also for theoretical
purposes. Indeed, we provide a new generalization of the conjunctive
decomposition of evidence and formulas uncovering how each decomposition weight
is tied to the corresponding mass function.
","[{'version': 'v1', 'created': 'Thu, 12 Nov 2020 18:08:23 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Nov 2020 02:50:35 GMT'}, {'version': 'v3', 'created': 'Sat, 5 Dec 2020 17:33:51 GMT'}]",2021-01-12,"[['Chaveroche', 'Maxime', ''], ['Davoine', 'Franck', ''], ['Cherfaoui', 'Véronique', '']]","['M¨obius Transform', 'Zeta Transform', 'Efficiency', 'Complexity']"
13040,1910.00976,Arish Sateesan,S Arish and R.K. Sharma,"An efficient floating point multiplier design for high speed
  applications using Karatsuba algorithm and Urdhva-Tiryagbhyam algorithm",arXiv admin note: text overlap with arXiv:1909.13318,"2015 International Conference on Signal Processing and
  Communication (ICSC)",10.1109/ICSPCom.2015.7150666,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Floating point multiplication is a crucial operation in high power computing
applications such as image processing, signal processing etc. And also
multiplication is the most time and power consuming operation. This paper
proposes an efficient method for IEEE 754 floating point multiplication which
gives a better implementation in terms of delay and power. A combination of
Karatsuba algorithm and Urdhva-Tiryagbhyam algorithm (Vedic Mathematics) is
used to implement unsigned binary multiplier for mantissa multiplication. The
multiplier is implemented using Verilog HDL, targeted on Spartan-3E and
Virtex-4 FPGA.
","[{'version': 'v1', 'created': 'Tue, 1 Oct 2019 08:37:19 GMT'}, {'version': 'v2', 'created': 'Sun, 3 Nov 2019 09:53:17 GMT'}]",2019-12-17,"[['Arish', 'S', ''], ['Sharma', 'R. K.', '']]","['fpga', 'Floating point multiplier', 'Vedic mathematics', 'Urdhva-Tiryagbhyam', 'Karatsuba']"
13041,2206.05339,Brian Brubach,"Brian Brubach, Audrey Ballarin, Heeba Nazeer","Characterizing Properties and Trade-offs of Centralized Delegation
  Mechanisms in Liquid Democracy","10 pages, 4 figures, to appear in ACM FAccT 2022",,10.1145/3531146.3533219,,cs.MA,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Liquid democracy is a form of transitive delegative democracy that has
received a flurry of scholarly attention from the computer science community in
recent years. In its simplest form, every agent starts with one vote and may
have other votes assigned to them via delegation from other agents. They can
choose to delegate all votes assigned to them to another agent or vote directly
with all votes assigned to them. However, many proposed realizations of liquid
democracy allow for agents to express their delegation/voting preferences in
more complex ways (e.g., a ranked list of potential delegates) and employ a
centralized delegation mechanism to compute the final vote tally. In doing so,
centralized delegation mechanisms can make decisions that affect the outcome of
a vote and where/whether agents are able to delegate their votes. Much of the
analysis thus far has focused on the ability of these mechanisms to make a
correct choice. We extend this analysis by introducing and formalizing other
important properties of a centralized delegation mechanism in liquid democracy
with respect to crucial features such as accountability, transparency,
explainability, fairness, and user agency. In addition, we evaluate existing
methods in terms of these properties, show how some prior work can be augmented
to achieve desirable properties, prove impossibility results for achieving
certain sets of properties simultaneously, and highlight directions for future
work.
","[{'version': 'v1', 'created': 'Fri, 10 Jun 2022 20:11:35 GMT'}]",2022-06-14,"[['Brubach', 'Brian', ''], ['Ballarin', 'Audrey', ''], ['Nazeer', 'Heeba', '']]","['liquid democracy', 'voting', 'computational social choice', 'fairness', 'accountability', 'transparency']"
13042,2207.06103,Hansen Feng,"Hansen Feng, Lizhi Wang, Yuzhi Wang, Hua Huang","Learnability Enhancement for Low-light Raw Denoising: Where Paired Real
  Data Meets Noise Modeling","9 pages, 8 figures, to be published in ACMMM 2022",,10.1145/3503161.3548186,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Low-light raw denoising is an important and valuable task in computational
photography where learning-based methods trained with paired real data are
mainstream. However, the limited data volume and complicated noise distribution
have constituted a learnability bottleneck for paired real data, which limits
the denoising performance of learning-based methods. To address this issue, we
present a learnability enhancement strategy to reform paired real data
according to noise modeling. Our strategy consists of two efficient techniques:
shot noise augmentation (SNA) and dark shading correction (DSC). Through noise
model decoupling, SNA improves the precision of data mapping by increasing the
data volume and DSC reduces the complexity of data mapping by reducing the
noise complexity. Extensive results on the public datasets and real imaging
scenarios collectively demonstrate the state-of-the-art performance of our
method. Our code is available at: https://github.com/megvii-research/PMN.
","[{'version': 'v1', 'created': 'Wed, 13 Jul 2022 10:23:28 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Aug 2022 07:17:20 GMT'}]",2022-08-19,"[['Feng', 'Hansen', ''], ['Wang', 'Lizhi', ''], ['Wang', 'Yuzhi', ''], ['Huang', 'Hua', '']]","['low light denoising', 'noise modeling', 'data augmentation', 'computational photography']"
13043,2209.07421,Tarik A. Rashid,"Askandar H. Amin, Botan K. Ahmed, Bestan B. Maaroof and Tarik A.
  Rashid","Heart Attack Classification System using Neural Network Trained with
  Particle Swarm Optimization",12 pages,,10.1007/978-3-031-14054-9_4,"Advances in Intelligent Systems and Computing, 2022",cs.NE,http://creativecommons.org/licenses/by/4.0/,"  The prior detection of a heart attack could lead to the saving of one's life.
Putting specific criteria into a system that provides an early warning of an
imminent at-tack will be advantageous to a better prevention plan for an
upcoming heart attack. Some studies have been conducted for this purpose, but
yet the goal has not been reached to prevent a patient from getting such a
disease. In this paper, Neural Network trained with Particle Swarm Optimization
(PSONN) is used to analyze the input criteria and enhance heart attack
anticipation. A real and novel dataset that has been recorded on the disease is
used. After preprocessing the data, the features are fed into the system. As a
result, the outcomes from PSONN have been evaluated against those from other
algorithms. Decision Tree, Random Forest, Neural network trained with
Backpropagation (BPNN), and Naive Bayes were among those employed. Then the
results of 100%, 99.2424%, 99.2323%, 81.3131%, and 66.4141% are produced
concerning the mentioned algorithms, which show that PSONN has recorded the
highest accuracy rate among all other tested algorithms.
","[{'version': 'v1', 'created': 'Sun, 21 Aug 2022 09:25:17 GMT'}]",2022-09-16,"[['Amin', 'Askandar H.', ''], ['Ahmed', 'Botan K.', ''], ['Maaroof', 'Bestan B.', ''], ['Rashid', 'Tarik A.', '']]","['Heart Attack', 'Particle Swarm Optimization', 'Neural Network', 'Backpropagation', 'Swarm Intelligence']"
13044,1809.05926,Bhaskar DasGupta,"Bhaskar DasGupta, Nasim Mobasheri and Ismael G. Yero","On analyzing and evaluating privacy measures for social networks under
  active attack",To appear in Information Sciences,"Information Sciences, 473, 87-100, 2019",10.1016/j.ins.2018.09.023,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Widespread usage of complex interconnected social networks such as Facebook,
Twitter and LinkedIn in modern internet era has also unfortunately opened the
door for privacy violation of users of such networks by malicious entities. In
this article we investigate, both theoretically and empirically, privacy
violation measures of large networks under active attacks that was recently
introduced in (Information Sciences, 328, 403-417, 2016). Our theoretical
result indicates that the network manager responsible for prevention of privacy
violation must be very careful in designing the network if its topology does
not contain a cycle. Our empirical results shed light on privacy violation
properties of eight real social networks as well as a large number of synthetic
networks generated by both the classical Erdos-Renyi model and the scale-free
random networks generated by the Barabasi-Albert preferential-attachment model.
","[{'version': 'v1', 'created': 'Sun, 16 Sep 2018 18:22:22 GMT'}]",2018-09-26,"[['DasGupta', 'Bhaskar', ''], ['Mobasheri', 'Nasim', ''], ['Yero', 'Ismael G.', '']]","['Privacy measure', 'social networks', 'active attack', 'empirical']"
13045,2211.08568,Linhao Luo,"Linhao Luo, Reza Haffari, Shirui Pan","Graph Sequential Neural ODE Process for Link Prediction on Dynamic and
  Sparse Graphs",Accepted by WSDM2023,,10.1145/3539597.3570465,,cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Link prediction on dynamic graphs is an important task in graph mining.
Existing approaches based on dynamic graph neural networks (DGNNs) typically
require a significant amount of historical data (interactions over time), which
is not always available in practice. The missing links over time, which is a
common phenomenon in graph data, further aggravates the issue and thus creates
extremely sparse and dynamic graphs. To address this problem, we propose a
novel method based on the neural process, called Graph Sequential Neural ODE
Process (GSNOP). Specifically, GSNOP combines the advantage of the neural
process and neural ordinary differential equation that models the link
prediction on dynamic graphs as a dynamic-changing stochastic process. By
defining a distribution over functions, GSNOP introduces the uncertainty into
the predictions, making it generalize to more situations instead of overfitting
to the sparse data. GSNOP is also agnostic to model structures that can be
integrated with any DGNN to consider the chronological and geometrical
information for link prediction. Extensive experiments on three dynamic graph
datasets show that GSNOP can significantly improve the performance of existing
DGNNs and outperform other neural process variants.
","[{'version': 'v1', 'created': 'Tue, 15 Nov 2022 23:21:02 GMT'}]",2022-11-17,"[['Luo', 'Linhao', ''], ['Haffari', 'Reza', ''], ['Pan', 'Shirui', '']]","['Link Prediction', 'Dynamic Graphs', 'Neural Process', 'Graph NeuralNetworks', 'Neural Ordinary Differential Equation']"
13046,2006.03102,Bertrand Petit,"Bertrand Petit (INRIA, France), Manuel Serrano (INRIA, France)",Interactive Music and Synchronous Reactive Programming,,"The Art, Science, and Engineering of Programming, 2021, Vol. 5,
  Issue 1, Article 2",10.22152/programming-journal.org/2021/5/2,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents Skini, a programming methodology and an execution
environment for interactive structured music. With this system, the composer
programs his scores in the HipHop.js synchronous reactive language. They are
then executed, or played, in live concerts, in interaction with the audience.
The system aims at helping composers to find a good balance between the
determinism of the compositions and the nondeterminism of the interactions with
the public. Each execution of a Skini score yields to a different but
aesthetically consistent interpretation. This work raises many questions in the
musical fields. How to combine composition and interaction? How to control the
musical style when the audience influences what is to play next? What are the
possible connections with generative music? These are important questions for
the Skini system but they are out of the scope of this paper that focuses
exclusively on the computer science aspects of the system. From that
perspective, the main questions are how to program the scores and in which
language? General purpose languages are inappropriate because their elementary
constructs (i.e., variables, functions, loops, etc.) do not match the
constructions needed to express music and musical constraints. We show that
synchronous programming languages are a much better fit because they rely on
temporal constructs that can be directly used to represent musical scores and
because their malleability enables composers to experiment easily with artistic
variations of their initial scores. The paper mostly focuses on scores
programming. It exposes the process a composer should follow from his very
first musical intuitions up to the generation of a musical artifact. The paper
presents some excerpts of the programming of a classical music composition that
it then precisely relates to an actual recording. Examples of techno music and
jazz are also presented, with audio artifact, to demonstrate the versatility of
the system. Finally, brief presentations of past live concerts are presented as
an evidence of viability of the system.
","[{'version': 'v1', 'created': 'Thu, 4 Jun 2020 19:08:45 GMT'}]",2020-06-08,"[['Petit', 'Bertrand', '', 'INRIA, France'], ['Serrano', 'Manuel', '', 'INRIA, France']]","['synchronous reactive programming', 'music composition', 'music generation', 'interactive music', 'web']"
13047,2109.08278,EPTCS,W{\l}odzimierz Drabent,A Note on Occur-Check,"In Proceedings ICLP 2021, arXiv:2109.07914","EPTCS 345, 2021, pp. 54-67",10.4204/EPTCS.345.17,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most known results on avoiding the occur-check are based on the notion of
""not subject to occur-check"" (NSTO). It means that unification is performed
only on such pairs of atoms for which the occur-check never succeeds in any run
of a nondeterministic unification algorithm. Here we show that this requirement
is too strong. We show how to weaken it, and present some related sufficient
conditions under which the occur-check may be safely omitted. We show examples
for which the proposed approach provides more general results than the
approaches based on well-moded and nicely moded programs (this includes cases
to which the latter approaches are inapplicable).
","[{'version': 'v1', 'created': 'Fri, 17 Sep 2021 01:43:11 GMT'}]",2021-09-20,"[['Drabent', 'Włodzimierz', '']]","['occur-check', 'unification', 'modes', 'delays']"
13048,2210.15422,ELkebir Sarhrouni,"Hasna Nhaila, Asma Elmaizi, Elkebir Sarhrouni and Ahmed Hammouch","Supervised classification methods applied to airborne hyperspectral
  images: Comparative study using mutual information",,"Procedia Computer Science, 2019, 148, pp. 97-106 -
  http://www.scopus.com/inward/record.url?eid=2-s2.0-85048829863&partnerID=MN8TOARS",10.1016/j.procs.2019.01.013,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Nowadays, the hyperspectral remote sensing imagery HSI becomes an important
tool to observe the Earth's surface, detect the climatic changes and many other
applications. The classification of HSI is one of the most challenging tasks
due to the large amount of spectral information and the presence of redundant
and irrelevant bands. Although great progresses have been made on
classification techniques, few studies have been done to provide practical
guidelines to determine the appropriate classifier for HSI. In this paper, we
investigate the performance of four supervised learning algorithms, namely,
Support Vector Machines SVM, Random Forest RF, K-Nearest Neighbors KNN and
Linear Discriminant Analysis LDA with different kernels in terms of
classification accuracies. The experiments have been performed on three real
hyperspectral datasets taken from the NASA's Airborne Visible/Infrared Imaging
Spectrometer Sensor AVIRIS and the Reflective Optics System Imaging
Spectrometer ROSIS sensors. The mutual information had been used to reduce the
dimensionality of the used datasets for better classification efficiency. The
extensive experiments demonstrate that the SVM classifier with RBF kernel and
RF produced statistically better results and seems to be respectively the more
suitable as supervised classifiers for the hyperspectral remote sensing images.
  Keywords: hyperspectral images, mutual information, dimension reduction,
Support Vector Machines, K-Nearest Neighbors, Random Forest, Linear
Discriminant Analysis.
","[{'version': 'v1', 'created': 'Thu, 27 Oct 2022 13:39:08 GMT'}]",2022-10-28,"[['Nhaila', 'Hasna', ''], ['Elmaizi', 'Asma', ''], ['Sarhrouni', 'Elkebir', ''], ['Hammouch', 'Ahmed', '']]","['hyperspectral images', 'mutual information', 'dimension reduction', 'Support Vector Machines', 'K-Nearest Neighbors', 'Random Forest', 'Linear Discriminant Analysis']"
13049,2104.02951,Luis Larios-C\'ardenas,Luis \'Angel Larios-C\'ardenas and Fr\'ed\'eric Gibou,"A hybrid inference system for improved curvature estimation in the
  level-set method using machine learning",Submitted,"J. Comput. Phys., 463:111291, August 2022",10.1016/j.jcp.2022.111291,,cs.LG cs.NA math.NA,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We present a novel hybrid strategy based on machine learning to improve
curvature estimation in the level-set method. The proposed inference system
couples enhanced neural networks with standard numerical schemes to compute
curvature more accurately. The core of our hybrid framework is a switching
mechanism that relies on well established numerical techniques to gauge
curvature. If the curvature magnitude is larger than a resolution-dependent
threshold, it uses a neural network to yield a better approximation. Our
networks are multilayer perceptrons fitted to synthetic data sets composed of
sinusoidal- and circular-interface samples at various configurations. To reduce
data set size and training complexity, we leverage the problem's characteristic
symmetry and build our models on just half of the curvature spectrum. These
savings lead to a powerful inference system able to outperform any of its
numerical or neural component alone. Experiments with stationary, smooth
interfaces show that our hybrid solver is notably superior to conventional
numerical methods in coarse grids and along steep interface regions. Compared
to prior research, we have observed outstanding gains in precision after
training the regression model with data pairs from more than a single interface
type and transforming data with specialized input preprocessing. In particular,
our findings confirm that machine learning is a promising venue for reducing or
removing mass loss in the level-set method.
","[{'version': 'v1', 'created': 'Wed, 7 Apr 2021 06:51:52 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Jun 2021 18:36:50 GMT'}, {'version': 'v3', 'created': 'Wed, 9 Feb 2022 04:27:50 GMT'}, {'version': 'v4', 'created': 'Fri, 6 May 2022 20:11:25 GMT'}, {'version': 'v5', 'created': 'Wed, 28 Sep 2022 04:21:37 GMT'}]",2022-09-29,"[['Larios-Cárdenas', 'Luis Ángel', ''], ['Gibou', 'Frédéric', '']]","['machine learning', 'curvature', 'hybrid solver', 'level-set method']"
13050,2008.09687,Christophe Bonneville,"Wensi Wu, Christophe Bonneville, Christopher J. Earls","A Principled Approach to Design Using High Fidelity Fluid-Structure
  Interaction Simulations",,,10.1016/j.finel.2021.103562,,cs.CE cs.NA math.NA physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A high fidelity fluid-structure interaction simulation may require many days
to run, on hundreds of cores. This poses a serious burden, both in terms of
time and economic considerations, when repetitions of such simulations may be
required (e.g. for the purpose of design optimization). In this paper we
present strategies based on (constrained) Bayesian optimization (BO) to
alleviate this burden. BO is a numerical optimization technique based on
Gaussian processes (GP) that is able to efficiently (with minimal calls to the
expensive FSI models) converge towards some globally optimal design, as gauged
using a black box objective function. In this study we present a principled
design evolution that moves from FSI model verification, through a series of
Bridge Simulations (bringing the verification case incrementally closer to the
application), in order that we may identify material properties for an
underwater, unmanned, autonomous vehicle (UUAV) sail plane. We are able to
achieve fast convergence towards an optimal design, using a small number of FSI
simulations (a dozen at most), even when selecting over several design
parameters, and while respecting optimization constraints.
","[{'version': 'v1', 'created': 'Fri, 21 Aug 2020 21:37:12 GMT'}]",2021-04-12,"[['Wu', 'Wensi', ''], ['Bonneville', 'Christophe', ''], ['Earls', 'Christopher J.', '']]","['Bayesian Optimization', 'Fluid-Structure Interaction', 'Gaussian']"
13051,2002.02793,Andreas Vogelsang,"Andreas Vogelsang, Jonas Eckhardt, Daniel Mendez, Moritz Berger","Views on Quality Requirements in Academia and Practice: Commonalities,
  Differences, and Context-Dependent Grey Areas",,,10.1016/j.infsof.2019.106253,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Quality requirements (QRs) are a topic of constant discussions both
in industry and academia. Debates entwine around the definition of quality
requirements, the way how to handle them, or their importance for project
success. While many academic endeavors contribute to the body of knowledge
about QRs, practitioners may have different views. In fact, we still lack a
consistent body of knowledge on QRs since much of the discussion around this
topic is still dominated by observations that are strongly context-dependent.
This holds for both academic and practitioners' views. Our assumption is that,
in consequence, those views may differ. Objective: We report on a study to
better understand the extent to which available research statements on quality
requirements, as found in exemplary peer-reviewed and frequently cited
publications, are reflected in the perception of practitioners. Our goal is to
analyze differences, commonalities, and context-dependent grey areas in the
views of academics and practitioners to allow a discussion on potential
misconceptions (on either sides) and opportunities for future research. Method:
We conducted a survey with 109 practitioners to assess whether they agree with
research statements about QRs reflected in the literature. Based on a
statistical model, we evaluate the impact of a set of context factors to the
perception of research statements. Results: Our results show that a majority of
the statements is well respected by practitioners; however, not all of them.
When examining the different groups and backgrounds of respondents, we noticed
interesting deviations of perceptions within different groups that may lead to
new research questions. Conclusions: Our results help identifying prevalent
context-dependent differences about how academics and practitioners view QRs
and pinpointing statements where further research might be useful.
","[{'version': 'v1', 'created': 'Fri, 7 Feb 2020 14:02:43 GMT'}]",2020-02-10,"[['Vogelsang', 'Andreas', ''], ['Eckhardt', 'Jonas', ''], ['Mendez', 'Daniel', ''], ['Berger', 'Moritz', '']]","['quality requirements', 'non-functional requirements', 'contextfactors', 'requirements engineering', 'survey', 'empirical study']"
13052,2110.07374,Alexander Henkes,"Alexander Henkes, Henning Wessels, Rolf Mahnken",Physics informed neural networks for continuum micromechanics,https://www.sciencedirect.com/science/article/pii/S0045782522001268?via%3Dihub,"Computer Methods in Applied Mechanics and Engineering, Volume 393,
  1 April 2022, 114790",10.1016/j.cma.2022.114790,,cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Recently, physics informed neural networks have successfully been applied to
a broad variety of problems in applied mathematics and engineering. The
principle idea is to use a neural network as a global ansatz function to
partial differential equations. Due to the global approximation, physics
informed neural networks have difficulties in displaying localized effects and
strong non-linear solutions by optimization. In this work we consider material
non-linearities invoked by material inhomogeneities with sharp phase
interfaces. This constitutes a challenging problem for a method relying on a
global ansatz. To overcome convergence issues, adaptive training strategies and
domain decomposition are studied. It is shown, that the domain decomposition
approach is able to accurately resolve nonlinear stress, displacement and
energy fields in heterogeneous microstructures obtained from real-world
$\mu$CT-scans.
","[{'version': 'v1', 'created': 'Thu, 14 Oct 2021 14:05:19 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Mar 2022 11:54:41 GMT'}]",2022-03-28,"[['Henkes', 'Alexander', ''], ['Wessels', 'Henning', ''], ['Mahnken', 'Rolf', '']]","['Physics informed neural networks', 'micromechanics', 'adaptivity', 'domain decomposition', 'µCT-scans', 'heterogeneous materials']"
13053,1907.00802,Takahiro Wada,Takahiro Wada,"Simultaneous Achievement of Driver Assistance and Skill Development in
  Shared and Cooperative Controls","Accepted for Cognition, Technology & Work (2018)",,10.1007/s10111-018-0514-y,,cs.HC cs.RO,http://creativecommons.org/licenses/by/4.0/,"  Advanced driver assistance systems have successfully reduced drivers'
workloads and increased safety. On the other hand, the excessive use of such
systems can impede the development of driving skills. However, there exist
collaborative driver assistance systems, including shared and cooperative
controls, which can promote effective collaboration between an assistance
system and a human operator under appropriate system settings. Given an
effective collaboration setup, we address the goal of simultaneously developing
or maintaining driving skills while reducing workload. As there has been a
paucity of research on such systems and their methodologies, we discuss a
methodology applying shared and cooperative controls by considering related
concepts in the skill training field. Reverse parking assisted by haptic shared
control is presented as a means of increasing performance during assistance,
while skill improvement following assistance is used to demonstrate the
possibility of simultaneous achievement of driver assistance through the
reduction of workload and skill improvement.
","[{'version': 'v1', 'created': 'Mon, 1 Jul 2019 14:09:31 GMT'}]",2019-07-02,"[['Wada', 'Takahiro', '']]","['Driver assistance', 'skill development', 'shared control', 'cooperative control', 'automobile', 'training']"
13054,2107.09640,Michael Caballero,Michael Caballero,Predicting the 2020 US Presidential Election with Twitter,,"2nd International Conference on Soft Computing, Artificial
  Intelligence and Machine Learning, 2021, pp. 53-65",10.5121/csit.2021.111006,,cs.SI cs.LG,http://creativecommons.org/licenses/by/4.0/,"  One major sub-domain in the subject of polling public opinion with social
media data is electoral prediction. Electoral prediction utilizing social media
data potentially would significantly affect campaign strategies, complementing
traditional polling methods and providing cheaper polling in real-time. First,
this paper explores past successful methods from research for analysis and
prediction of the 2020 US Presidential Election using Twitter data. Then, this
research proposes a new method for electoral prediction which combines
sentiment, from NLP on the text of tweets, and structural data with aggregate
polling, a time series analysis, and a special focus on Twitter users critical
to the election. Though this method performed worse than its baseline of
polling predictions, it is inconclusive whether this is an accurate method for
predicting elections due to scarcity of data. More research and more data are
needed to accurately measure this method's overall effectiveness.
","[{'version': 'v1', 'created': 'Mon, 19 Jul 2021 14:59:25 GMT'}]",2021-07-21,"[['Caballero', 'Michael', '']]","['Big Data', 'Internet of Things', 'Machine Learning', 'Data Mining', 'NLP']"
13055,2205.05502,Erik Fredericks,"Abigail C. Diller, Erik M. Fredericks",Towards Run-Time Search for Real-World Multi-Agent Systems,,,10.1145/3526072.3527537,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-agent systems (MAS) may encounter uncertainties in the form of
unexpected environmental conditions, sub-optimal system configurations, and
unplanned interactions between autonomous agents. The number of combinations of
such uncertainties may be innumerable, however run-time testing may reduce the
issues impacting such a system. We posit that search heuristics can augment a
run-time testing process, in-situ, for a MAS. To support our position we
discuss our in-progress experimental testbed to realize this goal and highlight
challenges we anticipate for this domain.
","[{'version': 'v1', 'created': 'Wed, 11 May 2022 13:52:54 GMT'}]",2022-05-12,"[['Diller', 'Abigail C.', ''], ['Fredericks', 'Erik M.', '']]","['search-based software testing', 'multi-agent systems', 'cyber-physicalsystems']"
13056,1802.00914,Hans van Ditmarsch,"Hans van Ditmarsch, Wiebe van der Hoek, Barteld Kooi, Louwe B. Kuijer",Arrow Update Synthesis,,Information and Computation 275: 104544 (2020),10.1016/j.ic.2020.104544,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this contribution we present arbitrary arrow update model logic (AAUML).
This is a dynamic epistemic logic or update logic. In update logics,
static/basic modalities are interpreted on a given relational model whereas
dynamic/update modalities induce transformations (updates) of relational
models. In AAUML the update modalities formalize the execution of arrow update
models, and there is also a modality for quantification over arrow update
models. Arrow update models are an alternative to the well-known action models.
We provide an axiomatization of AAUML. The axiomatization is a rewrite system
allowing to eliminate arrow update modalities from any given formula, while
preserving truth. Thus, AAUML is decidable and equally expressive as the base
multi-agent modal logic. Our main result is to establish arrow update
synthesis: if there is an arrow update model after which phi, we can construct
(synthesize) that model from phi. We also point out some pregnant differences
in update expressivity between arrow update logics, action model logics, and
refinement modal logic.
","[{'version': 'v1', 'created': 'Sat, 3 Feb 2018 05:17:40 GMT'}, {'version': 'v2', 'created': 'Sun, 3 Feb 2019 17:04:48 GMT'}, {'version': 'v3', 'created': 'Thu, 24 Oct 2019 17:03:20 GMT'}]",2021-11-30,"[['van Ditmarsch', 'Hans', ''], ['van der Hoek', 'Wiebe', ''], ['Kooi', 'Barteld', ''], ['Kuijer', 'Louwe B.', '']]","['modal logic', 'synthesis', 'dynamic epistemic logic', 'expressivity']"
13057,2208.10820,Daniel Franzen,"Daniel Franzen (1), Saskia Nu\~nez von Voigt (2), Peter S\""orries (1),
  Florian Tschorsch (2), Claudia M\""uller-Birn (1) ((1) Freie Universit\""at
  Berlin, (2) Technische Universit\""at Berlin)","""Am I Private and If So, how Many?"" - Communicating Privacy Guarantees
  of Differential Privacy with Risk Communication Formats","Accepted to ACM CCS 2022. arXiv admin note: substantial text overlap
  with arXiv:2204.04061",,10.1145/3548606.3560693,,cs.HC cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Decisions about sharing personal information are not trivial, since there are
many legitimate and important purposes for such data collection, but often the
collected data can reveal sensitive information about individuals.
Privacy-preserving technologies, such as differential privacy (DP), can be
employed to protect the privacy of individuals and, furthermore, provide
mathematically sound guarantees on the maximum privacy risk. However, they can
only support informed privacy decisions, if individuals understand the provided
privacy guarantees. This article proposes a novel approach for communicating
privacy guarantees to support individuals in their privacy decisions when
sharing data. For this, we adopt risk communication formats from the medical
domain in conjunction with a model for privacy guarantees of DP to create
quantitative privacy risk notifications. We conducted a crowd-sourced study
with 343 participants to evaluate how well our notifications conveyed the
privacy risk information and how confident participants were about their own
understanding of the privacy risk. Our findings suggest that these new
notifications can communicate the objective information similarly well to
currently used qualitative notifications, but left individuals less confident
in their understanding. We also discovered that several of our notifications
and the currently used qualitative notification disadvantage individuals with
low numeracy: these individuals appear overconfident compared to their actual
understanding of the associated privacy risks and are, therefore, less likely
to seek the needed additional information before an informed decision. The
promising results allow for multiple directions in future research, for
example, adding visual aids or tailoring privacy risk communication to
characteristics of the individuals.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2022 09:05:30 GMT'}]",2022-09-21,"[['Franzen', 'Daniel', ''], ['von Voigt', 'Saskia Nuñez', ''], ['Sörries', 'Peter', ''], ['Tschorsch', 'Florian', ''], ['Müller-Birn', 'Claudia', '']]","['communication', 'privacy', 'privacy risk', 'differential privacy']"
13058,2004.05609,Saeed Shafiee Sabet,"Saeed Shafiee Sabet, Steven Schmidt, Saman Zadtootaghaj, Carsten
  Griwodz, Sebastian Moller",Delay Sensitivity Classification of Cloud Gaming Content,"Accepted In International Workshop on Immersive Mixed and Virtual
  Environment Systems 2020. ACM, Istanbul, Turkey",,10.1145/3386293.3397116,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud Gaming is an emerging service that catches growing interest in the
research community as well as industry. While the paradigm shift from a game
execution on clients to streaming games from the cloud offers a variety of
benefits, the new services also require a highly reliable and low latency
network to achieve a satisfying Quality of Experience (QoE) for its users.
Using a cloud gaming service with high latency would harm the interaction of
the user with the game, leading to a decrease in playing performance and thus
frustration of players. However, the negative effect of delay on gaming QoE
depends strongly on the game content. At a certain level of delay, a slow-paced
card game is typically not as delay sensitive as a shooting game. For optimal
resource allocation and quality estimation, it is highly important for cloud
providers, game developers, and network planners to consider the impact of the
game content. This paper contributes to a better understanding of the delay
impact on QoE for cloud gaming applications by identifying game characteristics
influencing the delay perception of users. In addition, an expert evaluation
methodology to quantify these characteristics, as well as a delay sensitivity
classification based on a decision tree is presented. The ratings of 14 experts
for the quantification indicated an excellent level of agreement which
demonstrates the reliability of the proposed method. Additionally, the decision
tree reached an accuracy of 86.6 % on determining the delay sensitivity classes
which were derived from a large dataset of subjective input quality ratings
during a series of experiments.
","[{'version': 'v1', 'created': 'Sun, 12 Apr 2020 13:31:49 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jan 2021 11:48:10 GMT'}]",2021-01-08,"[['Sabet', 'Saeed Shafiee', ''], ['Schmidt', 'Steven', ''], ['Zadtootaghaj', 'Saman', ''], ['Griwodz', 'Carsten', ''], ['Moller', 'Sebastian', '']]","['Delay', 'QoE', 'Cloud Gaming', 'Content Classification']"
13059,2101.10977,Lukas Brunke,"Lukas Brunke, Prateek Agrawal, Nikhil George","Evaluating Input Perturbation Methods for Interpreting CNNs and Saliency
  Map Comparison",,ECCV 2020: Computer Vision - ECCV 2020 Workshops pp 120-134,10.1007/978-3-030-66415-2_8,,cs.LG cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Input perturbation methods occlude parts of an input to a function and
measure the change in the function's output. Recently, input perturbation
methods have been applied to generate and evaluate saliency maps from
convolutional neural networks. In practice, neutral baseline images are used
for the occlusion, such that the baseline image's impact on the classification
probability is minimal. However, in this paper we show that arguably neutral
baseline images still impact the generated saliency maps and their evaluation
with input perturbations. We also demonstrate that many choices of
hyperparameters lead to the divergence of saliency maps generated by input
perturbations. We experimentally reveal inconsistencies among a selection of
input perturbation methods and find that they lack robustness for generating
saliency maps and for evaluating saliency maps as saliency metrics.
","[{'version': 'v1', 'created': 'Tue, 26 Jan 2021 18:11:06 GMT'}]",2021-01-27,"[['Brunke', 'Lukas', ''], ['Agrawal', 'Prateek', ''], ['George', 'Nikhil', '']]","['Saliency methods', 'saliency maps', 'saliency metrics', 'perturbation methods', 'baseline image', 'RISE', 'MoRF', 'LeRF']"
13060,2007.11347,Francesco Concas,"Francesco Concas, Jukka K. Nurminen, Tommi Mikkonen, Sasu Tarkoma",Validation Frameworks for Self-Driving Vehicles: A Survey,,,10.1007/978-3-030-60922-1_10,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As a part of the digital transformation, we interact with more and more
intelligent gadgets. Today, these gadgets are often mobile devices, but in the
advent of smart cities, more and more infrastructure---such as traffic and
buildings---in our surroundings becomes intelligent. The intelligence, however,
does not emerge by itself. Instead, we need both design techniques to create
intelligent systems, as well as approaches to validate their correct behavior.
An example of intelligent systems that could benefit smart cities are
self-driving vehicles. Self-driving vehicles are continuously becoming both
commercially available and common on roads. Accidents involving self-driving
vehicles, however, have raised concerns about their reliability. Due to these
concerns, the safety of self-driving vehicles should be thoroughly tested
before they can be released into traffic. To ensure that self-driving vehicles
encounter all possible scenarios, several millions of hours of testing must be
carried out; therefore, testing self-driving vehicles in the real world is
impractical. There is also the issue that testing self-driving vehicles
directly in the traffic poses a potential safety hazard to human drivers. To
tackle this challenge, validation frameworks for testing self-driving vehicles
in simulated scenarios are being developed by academia and industry. In this
chapter, we briefly introduce self-driving vehicles and give an overview of
validation frameworks for testing them in a simulated environment. We conclude
by discussing what an ideal validation framework at the state of the art should
be and what could benefit validation frameworks for self-driving vehicles in
the future.
","[{'version': 'v1', 'created': 'Wed, 22 Jul 2020 11:22:16 GMT'}]",2020-12-17,"[['Concas', 'Francesco', ''], ['Nurminen', 'Jukka K.', ''], ['Mikkonen', 'Tommi', ''], ['Tarkoma', 'Sasu', '']]","['Self-driving vehicles', 'validation frameworks', 'simulation', 'intelligent infrastructure', 'smartcities']"
13061,cs/0509098,Nicolas Macris,Nicolas Macris,Applications of correlation inequalities to low density graphical codes,"11 pages, 3 figures",,10.1140/epjb/e2006-00129-6,,cs.IT cond-mat.stat-mech math.IT,,"  This contribution is based on the contents of a talk delivered at the
Next-SigmaPhi conference held in Crete in August 2005. It is adressed to an
audience of physicists with diverse horizons and does not assume any background
in communications theory. Capacity approaching error correcting codes for
channel communication known as Low Density Parity Check (LDPC) codes have
attracted considerable attention from coding theorists in the last decade.
Surprisingly strong connections with the theory of diluted spin glasses have
been discovered. In this work we elucidate one new connection, namely that a
class of correlation inequalities valid for gaussian spin glasses can be
applied to the theoretical analysis of LDPC codes. This allows for a rigorous
comparison between the so called (optimal) maximum a posteriori and the
computationaly efficient belief propagation decoders. The main ideas of the
proofs are explained and we refer to recent works for the more lengthy
technical details.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2005 10:02:10 GMT'}]",2009-11-11,"[['Macris', 'Nicolas', '']]","['Spin glass', 'error correcting code', 'belief propagation', 'correlation inequality']"
13062,2101.03706,Shuo Niu,"Shuo Niu, Ava Bartolome, Cat Mai, and Nguyen B. Ha",#StayHome #WithMe: How Do YouTubers Help with COVID-19 Loneliness?,"CHI Conference on Human Factors in Computing Systems (CHI '21), May
  8--13, 2021, Yokohama, Japan","Proceedings of the 2021 CHI Conference on Human Factors in
  Computing Systems",10.1145/3411764.3445397,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Loneliness threatens public mental wellbeing during COVID-19. In response,
YouTube creators participated in the #StayHome #WithMe movement (SHWM) and made
myriad videos for people experiencing loneliness or boredom at home.
User-shared videos generate parasocial attachment and virtual connectedness.
However, there is limited knowledge of how creators contributed videos during
disasters to provide social provisions as disaster-relief. Grounded on Weiss's
loneliness theory, this work analyzed 1488 SHWM videos to examine video sharing
as a pathway to social provisions. Findings suggested that skill and knowledge
sharing, entertaining arts, homelife activities, live chatting, and gameplay
were the most popular video styles. YouTubers utilized parasocial relationships
to form a space for staying away from the disaster. SHWM YouTubers provided
friend-like, mentor-like, and family-like provisions through videos in
different styles. Family-like provisions led to the highest overall viewer
engagement. Based on the findings, design implications for supporting viewers'
mental wellbeing in disasters are discussed.
","[{'version': 'v1', 'created': 'Mon, 11 Jan 2021 05:30:19 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Jan 2021 16:47:57 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Jan 2021 23:56:07 GMT'}]",2021-07-20,"[['Niu', 'Shuo', ''], ['Bartolome', 'Ava', ''], ['Mai', 'Cat', ''], ['Ha', 'Nguyen B.', '']]","['YouTube', 'video sharing', 'parasocial', 'social provisions', 'disaster', 'loneliness']"
13063,2005.07261,Amir Javadpour,"Amir Javadpour, Guojun Wang and Xiaofei Xing","Managing Heterogeneous Substrate Resources by Mapping and Visualization
  Based on Software-Defined Network",arXiv admin note: substantial text overlap with arXiv:2004.09193,,10.1109/BDCloud.2018.00057,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network virtualization is a way to simultaneously run multiple heterogeneous
architectures on a shared substrate. The main issue in the virtualization of
networks is the problem of mapping virtual networks to the substrate network.
How to manage substrate resources when performing the mapping will have an
effective role in improving the use of infrastructure resources and
consequently better mapping. By writing a module in the controller for dynamic
resource management, an initial mapping has been attempted until the request
arrives, if sufficient resources are available, but until the arrival of the n
request that their initial mapping is successful, writing the rules in the
switches is postponed. The simulation results with the NS2 simulator showed
that compared to the two similar approaches, the proposed method could reduce
the delay and the cost by maintaining the acceptance rate. Keywords:
Heterogeneous, Network virtualization, Software-defined network, Virtual
network mapping, Substrate Resources
","[{'version': 'v1', 'created': 'Tue, 21 Apr 2020 01:01:09 GMT'}]",2020-05-18,"[['Javadpour', 'Amir', ''], ['Wang', 'Guojun', ''], ['Xing', 'Xiaofei', '']]","['Heterogeneous', 'Network virtualization', 'Software']"
13064,2202.02163,Dr Peter J. Bentley,"Peter J Bentley, Soo Ling Lim, Adam Gaier and Linh Tran","COIL: Constrained Optimization in Learned Latent Space: Learning
  Representations for Valid Solutions","Genetic and Evolutionary Computation Conference Companion (GECCO '22
  Companion). ACM, Boston, USA, 8 pages",,10.1145/3520304.3533993,,cs.NE cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  Constrained optimization problems can be difficult because their search
spaces have properties not conducive to search, e.g., multimodality,
discontinuities, or deception. To address such difficulties, considerable
research has been performed on creating novel evolutionary algorithms or
specialized genetic operators. However, if the representation that defined the
search space could be altered such that it only permitted valid solutions that
satisfied the constraints, the task of finding the optimal would be made more
feasible without any need for specialized optimization algorithms. We propose
Constrained Optimization in Latent Space (COIL), which uses a VAE to generate a
learned latent representation from a dataset comprising samples from the valid
region of the search space according to a constraint, thus enabling the
optimizer to find the objective in the new space defined by the learned
representation. Preliminary experiments show promise: compared to an identical
GA using a standard representation that cannot meet the constraints or find fit
solutions, COIL with its learned latent representation can perfectly satisfy
different types of constraints while finding high-fitness solutions.
","[{'version': 'v1', 'created': 'Fri, 4 Feb 2022 14:45:37 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Feb 2022 11:16:23 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Apr 2022 15:32:33 GMT'}, {'version': 'v4', 'created': 'Mon, 6 Jun 2022 12:05:52 GMT'}]",2022-06-07,"[['Bentley', 'Peter J', ''], ['Lim', 'Soo Ling', ''], ['Gaier', 'Adam', ''], ['Tran', 'Linh', '']]","['Variational\t autoencoder', 'Learning\t latent\t representations', 'Genetic\talgorithm', 'Constrained\toptimization']"
13065,1810.06599,Colin Gordon,"Sergey Matskevich, Colin S. Gordon",Generating Comments From Source Code with CCGs,NL4SE 2018 preprint,,10.1145/3283812.3283822,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Good comments help developers understand software faster and provide better
maintenance. However, comments are often missing, generally inaccurate, or out
of date. Many of these problems can be avoided by automatic comment generation.
This paper presents a method to generate informative comments directly from the
source code using general-purpose techniques from natural language processing.
We generate comments using an existing natural language model that couples
words with their individual logical meaning and grammar rules, allowing comment
generation to proceed by search from declarative descriptions of program text.
We evaluate our algorithm on several classic algorithms implemented in Python.
","[{'version': 'v1', 'created': 'Mon, 15 Oct 2018 18:25:25 GMT'}]",2018-10-17,"[['Matskevich', 'Sergey', ''], ['Gordon', 'Colin S.', '']]","['Comment Generation', 'Natural Language', 'Combinatory CategorialGrammar']"
13066,2209.10978,Katherine Kosaian,"Katherine Kosaian, Yong Kiam Tan, Andr\'e Platzer","A First Complete Algorithm for Real Quantifier Elimination in
  Isabelle/HOL",CPP 2023,,10.1145/3573105.3575672,,cs.LO math.AG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We formalize a multivariate quantifier elimination (QE) algorithm in the
theorem prover Isabelle/HOL. Our algorithm is complete, in that it is able to
reduce any quantified formula in the first-order logic of real arithmetic to a
logically equivalent quantifier-free formula. The algorithm we formalize is a
hybrid mixture of Tarski's original QE algorithm and the Ben-Or, Kozen, and
Reif algorithm, and it is the first complete multivariate QE algorithm
formalized in Isabelle/HOL.
","[{'version': 'v1', 'created': 'Thu, 22 Sep 2022 13:05:00 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Dec 2022 17:01:41 GMT'}]",2022-12-22,"[['Kosaian', 'Katherine', ''], ['Tan', 'Yong Kiam', ''], ['Platzer', 'André', '']]","['quantifier elimination', 'theorem proving', 'real arithmetic', 'multivariate polynomials']"
13067,2007.15634,Ralph Foorthuis,Ralph Foorthuis,On the Nature and Types of Anomalies: A Review of Deviations in Data,"39 pages (30 pages content), 10 figures and 3 tables. Preprint;
  comments will be appreciated. Improvements in version 4: Small textual
  updates, added publication details on JDSA journal. International Journal of
  Data Science and Analytics, Springer (2021)",,10.1007/s41060-021-00265-1,,cs.DB cs.AI cs.LG stat.OT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Anomalies are occurrences in a dataset that are in some way unusual and do
not fit the general patterns. The concept of the anomaly is typically
ill-defined and perceived as vague and domain-dependent. Moreover, despite some
250 years of publications on the topic, no comprehensive and concrete overviews
of the different types of anomalies have hitherto been published. By means of
an extensive literature review this study therefore offers the first
theoretically principled and domain-independent typology of data anomalies and
presents a full overview of anomaly types and subtypes. To concretely define
the concept of the anomaly and its different manifestations, the typology
employs five dimensions: data type, cardinality of relationship, anomaly level,
data structure, and data distribution. These fundamental and data-centric
dimensions naturally yield 3 broad groups, 9 basic types, and 63 subtypes of
anomalies. The typology facilitates the evaluation of the functional
capabilities of anomaly detection algorithms, contributes to explainable data
science, and provides insights into relevant topics such as local versus global
anomalies.
","[{'version': 'v1', 'created': 'Thu, 30 Jul 2020 17:55:11 GMT'}, {'version': 'v2', 'created': 'Sun, 27 Dec 2020 22:15:50 GMT'}, {'version': 'v3', 'created': 'Sat, 15 May 2021 11:45:58 GMT'}, {'version': 'v4', 'created': 'Sat, 7 Aug 2021 11:43:38 GMT'}]",2021-09-01,"[['Foorthuis', 'Ralph', '']]","['Anomalies', 'Outliers', 'Deviants', 'Typology', 'Anomaly detection', 'Explainable data science']"
13068,1806.06944,Huu Phuoc Bui,"Michel Duprez, St\'ephane P.A. Bordas, Marek Bucki, Huu Phuoc Bui,
  Franz Chouly, Vanessa Lleras, Claudio Lobos, Alexei Lozinski, Pierre-Yves
  Rohan, Satyendra Tomar","Quantifying discretization errors for soft-tissue simulation in computer
  assisted surgery: a preliminary study","35 pages, 10 figures","Applied Mathematical Modelling Volume 77, Part 1, January 2020,
  Pages 709-723",10.1016/j.apm.2019.07.055,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Errors in biomechanics simulations arise from modeling and discretization.
Modeling errors are due to the choice of the mathematical model whilst
discretization errors measure the impact of the choice of the numerical method
on the accuracy of the approximated solution to this specific mathematical
model. A major source of discretization errors is mesh generation from medical
images, that remains one of the major bottlenecks in the development of
reliable, accurate, automatic and efficient personalized, clinically-relevant
Finite Element (FE) models in biomechanics. The impact of mesh quality and
density on the accuracy of the FE solution can be quantified with \emph{a
posteriori} error estimates. Yet, to our knowledge, the relevance of such error
estimates for practical biomechanics problems has seldom been addressed, see
[25]. In this contribution, we propose an implementation of some a posteriori
error estimates to quantify the discretization errors and to optimize the mesh.
More precisely, we focus on error estimation for a user-defined quantity of
interest with the Dual Weighted Residual (DWR) technique. We test its
applicability and relevance in two situations, corresponding to computations
for a tongue and an artery, using a simplified setting, i.e., plane linearized
elasticity with contractility of the soft-tissue modeled as a pre-stress. Our
results demonstrate the feasibility of such methodology to estimate the actual
solution errors and to reduce them economically through mesh refinement.
","[{'version': 'v1', 'created': 'Mon, 18 Jun 2018 20:58:49 GMT'}]",2020-03-04,"[['Duprez', 'Michel', ''], ['Bordas', 'Stéphane P. A.', ''], ['Bucki', 'Marek', ''], ['Bui', 'Huu Phuoc', ''], ['Chouly', 'Franz', ''], ['Lleras', 'Vanessa', ''], ['Lobos', 'Claudio', ''], ['Lozinski', 'Alexei', ''], ['Rohan', 'Pierre-Yves', ''], ['Tomar', 'Satyendra', '']]","['computer assisted surgery', 'computational biomechanics', 'goal oriented errorestimates', 'adaptive finite elements']"
13069,2204.10858,Michael Froehlich,"Klaudia Guzij, Michael Fr\""ohlich, Florian Fincke, Albrecht Schmidt,
  Florian Alt","Designing Trustworthy User Interfaces for the Voluntary Carbon Market: A
  Randomized Online Experiment",,,10.1145/3532106.3533462,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The voluntary carbon market is an important building block in the fight
against climate change. However, it is not trivial for consumers to verify
whether carbon offset projects deliver what they promise. While technical
solutions for measuring their impact are emerging, there is a lack of
understanding of how to translate this data into interface designs that mediate
the establishment of trust. With interaction between users and offset projects
mainly happening online, it is critical to meet this design challenge. To this
end, we designed and evaluated interfaces with varying trust cues for carbon
offset projects in a randomized online experiment (n=244). Our results show
that content design, particularly financial and forest-related quantitative
data presented at the right detail level, increases the perceived
trustworthiness, while images have no significant effect. We contribute the
first specific guidance for interface designers for carbon offsets and discuss
implications for interaction design.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2022 10:56:49 GMT'}]",2022-06-22,"[['Guzij', 'Klaudia', ''], ['Fröhlich', 'Michael', ''], ['Fincke', 'Florian', ''], ['Schmidt', 'Albrecht', ''], ['Alt', 'Florian', '']]","['trust', 'trustworthy interfaces', 'carbon markets', 'charitable giving', 'hci', 'experiment']"
13070,1905.13503,Behnaz Pourmohseni,"Behnaz Pourmohseni, Fedor Smirnov, Stefan Wildermann, J\""urgen Teich","Isolation-Aware Timing Analysis and Design Space Exploration for
  Predictable and Composable Many-Core Systems","Final version published at the 31st Euromicro Conference on Real-Time
  Systems (ECRTS 2019)",,10.4230/LIPIcs.ECRTS.2019.12,,cs.DC cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Composable many-core systems enable the independent development and analysis
of applications which will be executed on a shared platform where the mix of
concurrently executed applications may change dynamically at run time. For each
individual application, an off-line Design Space Exploration (DSE) is performed
to compute several mapping alternatives on the platform, offering
Pareto-optimal trade-offs in terms of real-time guarantees, resource usage,
etc. At run time, one mapping is then chosen to launch the application on
demand. In this context, to enable an independent analysis of each individual
application at design time, so-called inter-application isolation schemes are
applied which specify temporal or spatial isolation policies between
applications. S.o.t.a. composable many-core systems are developed based on a
fixed isolation scheme that is exclusively applied to every resource in every
mapping of every application and use a timing analysis tailored to that
isolation scheme to derive timing guarantees for each mapping. A fixed
isolation scheme, however, heavily restricts the explored space of solutions
and can, therefore, lead to suboptimality. Lifting this restriction
necessitates a timing analysis that is applicable to mappings with an arbitrary
mix of isolation schemes on different resources. To address this issue, we
present an isolation-aware timing analysis that unlike existing analyses can
handle multiple isolation schemes in combination within one mapping and
delivers safe yet tight timing bounds by identifying and excluding interference
scenarios that can never happen under the given combination of isolation
schemes. Based on the timing analysis, we present a DSE which explores the
choices of isolation scheme per resource within each mapping. Experimental
results demonstrate the advantage of the proposed approach over approaches
based on a fixed isolation scheme.
","[{'version': 'v1', 'created': 'Fri, 31 May 2019 10:43:21 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Jun 2019 12:07:28 GMT'}, {'version': 'v3', 'created': 'Mon, 24 Jun 2019 08:43:05 GMT'}, {'version': 'v4', 'created': 'Mon, 10 Feb 2020 10:48:06 GMT'}]",2020-02-11,"[['Pourmohseni', 'Behnaz', ''], ['Smirnov', 'Fedor', ''], ['Wildermann', 'Stefan', ''], ['Teich', 'Jürgen', '']]","['Many-core systems', 'timing analysis', 'design space exploration (DSE)', 'isolationscheme', 'predictability', 'composability']"
13071,1712.02466,Jingke Xu,Jingke Xu and Zhifang Zhang,"On Sub-Packetization and Access Number of Capacity-Achieving PIR Schemes
  for MDS Coded Non-Colluding Servers","15 pages, information theorey",SCIENCE CHINA information theorey (2018) 61: 100306,10.1007/s11432-018-9538-4,,cs.IT math.IT,http://creativecommons.org/publicdomain/zero/1.0/,"  Consider the problem of private information retrieval (PIR) over a
distributed storage system where $M$ records are stored across $N$ servers by
using an $[N,K]$ MDS code. For simplicity, this problem is usually referred as
the coded PIR problem. In 2016, Banawan and Ulukus designed the first
capacity-achieving coded PIR scheme with sub-packetization $KN^{M}$ and access
number $MKN^{M}$, where capacity characterizes the minimal download size for
retrieving per unit of data, and sub-packetization and access number are two
metrics closely related to implementation complexity. In this paper, we focus
on minimizing the sub-packetization and the access number for linear
capacity-achieving coded PIR schemes. We first determine the lower bounds on
sub-packetization and access number, which are $Kn^{M-1}$ and $MKn^{M-1}$,
respectively, in the nontrivial cases (i.e. $N\!>\!K\!\geq\!1$ and $M\!>\!1$),
where $n\!=\!N/{\rm gcd}(N,K)$. We then design a general linear
capacity-achieving coded PIR scheme to simultaneously attain these two bounds,
implying tightness of both bounds.
","[{'version': 'v1', 'created': 'Thu, 7 Dec 2017 01:16:50 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Dec 2017 03:09:51 GMT'}, {'version': 'v3', 'created': 'Thu, 17 Jan 2019 13:33:03 GMT'}]",2019-01-18,"[['Xu', 'Jingke', ''], ['Zhang', 'Zhifang', '']]","['private information retrieval', 'sub-packetization', 'access number', 'distributed storage', 'MDS code']"
13072,2212.08927,Harshil Bhatt,"Ashish Sharma, Harshil Bhatt",Increasing Physical Layer Security through Hyperchaos in VLC Systems,,,10.1007/s42979-022-01552-9,,cs.CR eess.SP,http://creativecommons.org/licenses/by/4.0/,"  Visible Light Communication (VLC) systems have relatively higher security
compared with traditional Radio Frequency (RF) channels due to line-of-sight
(LOS) propagation. However, they still are susceptible to eavesdropping. The
proposed solution of the papers have been built on existing work on
hyperchaos-based security measure to increase physical layer security from
eavesdroppers. A fourth-order Henon map is used to scramble the constellation
diagrams of the transmitted signals. The scramblers change the constellation
symbol of the system using a key. That key on the receiver side de-scrambles
the received data. The presented modulation scheme takes advantage of a higher
degree of the map to isolate the data transmission to a single dimension,
allowing for better scrambling and synchronization. A sliding mode controller
is used at the receiver in a master-slave configuration for projective
synchronization of the two Henon maps, which helps de-scramble the received
data. The data is only isolated for the users aware of the key for
synchronization, providing security against eavesdroppers. The proposed VLC
system is compared against various existing approaches based on various
metrics. An improved Bit Error Rate and a lower information leakage are
achieved for a variety of modulation schemes at an acceptable Signal-to-Noise
Ratio.
","[{'version': 'v1', 'created': 'Sat, 17 Dec 2022 18:32:16 GMT'}]",2023-01-13,"[['Sharma', 'Ashish', ''], ['Bhatt', 'Harshil', '']]","['visible light communication', 'sliding mode control', 'physical layersecurity', 'chaos synchronization', 'constellation scrambling']"
13073,1606.02016,EPTCS,"Thomas Fayolle (Universit\'e Paris-Est LACL), Marc Frappier
  (Universit\'e de Sherbrooke GRIL), R\'egine Laleau (Universit\'e Paris-Est
  LACL), Fr\'ed\'eric Gervais (Universit\'e Paris-Est LACL)",Formal refinement of extended state machines,"In Proceedings Refine'15, arXiv:1606.01344","EPTCS 209, 2016, pp. 1-16",10.4204/EPTCS.209.1,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a traditional formal development process, e.g. using the B method, the
informal user requirements are (manually) translated into a global abstract
formal specification. This translation is especially difficult to achieve. The
Event-B method was developed to incrementally and formally construct such a
specification using stepwise refinement. Each increment takes into account new
properties and system aspects. In this paper, we propose to couple a graphical
notation called Algebraic State-Transition Diagrams (ASTD) with an Event-B
specification in order to provide a better understanding of the software
behaviour. The dynamic behaviour is captured by the ASTD, which is based on
automata and process algebra operators, while the data model is described by
means of an Event-B specification. We propose a methodology to incrementally
refine such specification couplings, taking into account new refinement
relations and consistency conditions between the control specification and the
data specification. We compare the specifications obtained using each approach
for readability and proof complexity. The advantages and drawbacks of the
traditional approach and of our methodology are discussed. The whole process is
illustrated by a railway CBTC-like case study. Our approach is supported by
tools for translating ASTD's into B and Event-B into B.
","[{'version': 'v1', 'created': 'Tue, 7 Jun 2016 04:08:52 GMT'}]",2016-06-08,"[['Fayolle', 'Thomas', '', 'Université Paris-Est LACL'], ['Frappier', 'Marc', '', 'Université de Sherbrooke GRIL'], ['Laleau', 'Régine', '', 'Université Paris-Est\n  LACL'], ['Gervais', 'Frédéric', '', 'Université Paris-Est LACL']]","['Refinement', 'ASTD', 'Classical B', 'Event-B', 'Process Algebra', 'Railway System']"
13074,1710.02977,Vineel Kumar Veludandi,Vineel Kumar Veludandi and K Vasudevan,"Linear Prediction based Data Detection of Convolutional Coded DQPSK in
  SIMO-OFDM","The Viterbi algorithm is used to detect convolutionally coded DQPSK
  in SIMO-OFDM, Wireless Personal Communications, Springer. Online first, 2017",,10.1007/s11277-017-4751-9,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data detection of convolutional coded differential quaternary phase shift
keyed (DQPSK) signals using a predictive Viterbi algorithm (VA) based receiver,
is presented for single input, multiple output - orthogonal frequency division
multiplexed (OFDM) systems. The receiver has both error correcting capability
and also the ability to perform channel estimation (prediction). The predictive
VA operates on a supertrellis with just $S_{\mathrm{ST}}=S_{\mathrm{E}}\times
2^{P-1}$ states instead of $S_{\mathrm{ST}}=S_{\mathrm{E}}\times 2^{P}$ states,
where the complexity reduction is achieved by using the concept of isometry
(here $S_{\mathrm{E}}$ denotes the number of states in the encoder trellis and
$P$ denotes the prediction order). Though the linear prediction based data
detection in turbo coded OFDM and the bit interleaved coded (BIC) OFDM systems
perform better than the proposed approach in terms of bit error rate (BER) for
a given signal to noise ratio (SNR), the decoding delay of the proposed
approach is significantly lower than that of the BIC and the turbo coded OFDM
systems.
","[{'version': 'v1', 'created': 'Mon, 9 Oct 2017 07:44:02 GMT'}]",2017-10-10,"[['Veludandi', 'Vineel Kumar', ''], ['Vasudevan', 'K', '']]","['Supertrellis', 'Prediction filter', 'Viterbi algorithm', 'Isometry']"
13075,2008.08360,Junyan Wang,"Junyan Wang, Yang Bai, Yang Long, Bingzhang Hu, Zhenhua Chai, Yu Guan
  and Xiaolin Wei","Query Twice: Dual Mixture Attention Meta Learning for Video
  Summarization",This manuscript has been accepted at ACM MM 2020,,10.1145/3394171.3414064,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video summarization aims to select representative frames to retain high-level
information, which is usually solved by predicting the segment-wise importance
score via a softmax function. However, softmax function suffers in retaining
high-rank representations for complex visual or sequential information, which
is known as the Softmax Bottleneck problem. In this paper, we propose a novel
framework named Dual Mixture Attention (DMASum) model with Meta Learning for
video summarization that tackles the softmax bottleneck problem, where the
Mixture of Attention layer (MoA) effectively increases the model capacity by
employing twice self-query attention that can capture the second-order changes
in addition to the initial query-key attention, and a novel Single Frame Meta
Learning rule is then introduced to achieve more generalization to small
datasets with limited training sources. Furthermore, the DMASum significantly
exploits both visual and sequential attention that connects local key-frame and
global attention in an accumulative way. We adopt the new evaluation protocol
on two public datasets, SumMe, and TVSum. Both qualitative and quantitative
experiments manifest significant improvements over the state-of-the-art
methods.
","[{'version': 'v1', 'created': 'Wed, 19 Aug 2020 10:12:52 GMT'}]",2020-08-20,"[['Wang', 'Junyan', ''], ['Bai', 'Yang', ''], ['Long', 'Yang', ''], ['Hu', 'Bingzhang', ''], ['Chai', 'Zhenhua', ''], ['Guan', 'Yu', ''], ['Wei', 'Xiaolin', '']]","['video summarization', 'attention network', 'meta learning']"
13076,2112.05256,Michael Witbrock,"Dave Schneider, Michael Witbrock",Semantic Construction Grammar: Bridging the NL / Logic Divide,,,10.1145/2740908.2741710,,cs.CL cs.AI,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we discuss Semantic Construction Grammar (SCG), a system
developed over the past several years to facilitate translation between natural
language and logical representations. Crucially, SCG is designed to support a
variety of different methods of representation, ranging from those that are
fairly close to the NL structure (e.g. so-called 'logical forms'), to those
that are quite different from the NL structure, with higher-order and
high-arity relations. Semantic constraints and checks on representations are
integral to the process of NL understanding with SCG, and are easily carried
out due to the SCG's integration with Cyc's Knowledge Base and inference
engine.
","[{'version': 'v1', 'created': 'Fri, 10 Dec 2021 00:02:40 GMT'}]",2021-12-13,"[['Schneider', 'Dave', ''], ['Witbrock', 'Michael', '']]","['Knowledge Extraction from Text', 'SCG', 'Construction Grammar']"
13077,2110.06375,Mal\'u Grave,"Alex Viguerie, Gabriel F. Barros, Mal\'u Grave, Alessandro Reali,
  Alvaro L.G.A. Coutinho","Coupled and Uncoupled Dynamic Mode Decomposition in Multi-Compartmental
  Systems with Applications to Epidemiological and Additive Manufacturing
  Problems",,,10.1016/j.cma.2022.114600,,cs.LG math.DS,http://creativecommons.org/publicdomain/zero/1.0/,"  Dynamic Mode Decomposition (DMD) is an unsupervised machine learning method
that has attracted considerable attention in recent years owing to its
equation-free structure, ability to easily identify coherent spatio-temporal
structures in data, and effectiveness in providing reasonably accurate
predictions for certain problems. Despite these successes, the application of
DMD to certain problems featuring highly nonlinear transient dynamics remains
challenging. In such cases, DMD may not only fail to provide acceptable
predictions but may indeed fail to recreate the data in which it was trained,
restricting its application to diagnostic purposes. For many problems in the
biological and physical sciences, the structure of the system obeys a
compartmental framework, in which the transfer of mass within the system moves
within states. In these cases, the behavior of the system may not be accurately
recreated by applying DMD to a single quantity within the system, as proper
knowledge of the system dynamics, even for a single compartment, requires that
the behavior of other compartments is taken into account in the DMD process. In
this work, we demonstrate, theoretically and numerically, that, when performing
DMD on a fully coupled PDE system with compartmental structure, one may recover
useful predictive behavior, even when DMD performs poorly when acting
compartment-wise. We also establish that important physical quantities, as mass
conservation, are maintained in the coupled-DMD extrapolation. The mathematical
and numerical analysis suggests that DMD may be a powerful tool when applied to
this common class of problems. In particular, we show interesting numerical
applications to a continuous delayed-SIRD model for Covid-19, and to a problem
from additive manufacturing considering a nonlinear temperature field and the
resulting change of material phase from powder, liquid, and solid states.
","[{'version': 'v1', 'created': 'Tue, 12 Oct 2021 21:42:14 GMT'}]",2022-02-16,"[['Viguerie', 'Alex', ''], ['Barros', 'Gabriel F.', ''], ['Grave', 'Malú', ''], ['Reali', 'Alessandro', ''], ['Coutinho', 'Alvaro L. G. A.', '']]","['Dynamic Mode Decomposition', 'Compartmental models', 'Scientific machine learning', 'Epidemiological modeling', 'Additive manufacturing modeling']"
13078,2201.03339,Jinqi Huang,"Jinqi Huang, Spyros Stathopoulos, Alex Serb, and Themis Prodromakis","NeuroPack: An Algorithm-level Python-based Simulator for
  Memristor-empowered Neuro-inspired Computing",,,10.3389/fnano.2022.851856,,cs.ET cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  Emerging two terminal nanoscale memory devices, known as memristors, have
over the past decade demonstrated great potential for implementing energy
efficient neuro-inspired computing architectures. As a result, a wide-range of
technologies have been developed that in turn are described via distinct
empirical models. This diversity of technologies requires the establishment of
versatile tools that can enable designers to translate memristors' attributes
in novel neuro-inspired topologies. In this paper, we present NeuroPack, a
modular, algorithm level Python-based simulation platform that can support
studies of memristor neuro-inspired architectures for performing online
learning or offline classification. The NeuroPack environment is designed with
versatility being central, allowing the user to chose from a variety of neuron
models, learning rules and memristors models. Its hierarchical structure,
empowers NeuroPack to predict any memristor state changes and the corresponding
neural network behavior across a variety of design decisions and user
parameters options. The use of NeuroPack is demonstrated herein via an
application example of performing handwritten digit classification with the
MNIST dataset and an existing empirical model for metal-oxide memristors.
","[{'version': 'v1', 'created': 'Mon, 10 Jan 2022 13:35:25 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Feb 2022 16:05:47 GMT'}]",2022-07-29,"[['Huang', 'Jinqi', ''], ['Stathopoulos', 'Spyros', ''], ['Serb', 'Alex', ''], ['Prodromakis', 'Themis', '']]","['memristor', 'neuro-inspired computing', 'neuromorphic computing', 'neural networks', 'online learning', 'offline classification']"
13079,2007.08876,Matthias Lanzinger,Matthias Lanzinger,"Tractability Beyond $\beta$-Acyclicity for Conjunctive Queries with
  Negation",,,10.1145/3452021.3458308,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Numerous fundamental database and reasoning problems are known to be NP-hard
in general but tractable on instances where the underlying hypergraph structure
is $\beta$-acyclic. Despite the importance of many of these problems, there has
been little success in generalizing these results beyond acyclicity.
  In this paper, we take on this challenge and propose nest-set width, a novel
generalization of hypergraph $\beta$-acyclicity. We demonstrate that nest-set
width has desirable properties and algorithmic significance. In particular,
evaluation of boolean conjunctive queries with negation is tractable for
classes with bounded nest-set width. Furthermore, propositional satisfiability
is fixed-parameter tractable when parameterized by nest-set width.
","[{'version': 'v1', 'created': 'Fri, 17 Jul 2020 10:10:04 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Jun 2021 18:53:32 GMT'}]",2021-11-22,"[['Lanzinger', 'Matthias', '']]","['nest-set width', 'conjunctive queries with negation', 'beta-acyclic', 'hypergraph', 'satisfiability']"
13080,2301.09631,Bo\v{s}tjan Vouk,"Bo\v{s}tjan Vouk, Matej Guid, Marko Robnik-\v{S}ikonja",Feature construction using explanations of individual predictions,"54 pages, 10 figures, 22 tables","Engineering Applications of Artificial Intelligence 120 (2023)
  105823",10.1016/j.engappai.2023.105823,,cs.LG cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Feature construction can contribute to comprehensibility and performance of
machine learning models. Unfortunately, it usually requires exhaustive search
in the attribute space or time-consuming human involvement to generate
meaningful features. We propose a novel heuristic approach for reducing the
search space based on aggregation of instance-based explanations of predictive
models. The proposed Explainable Feature Construction (EFC) methodology
identifies groups of co-occurring attributes exposed by popular explanation
methods, such as IME and SHAP. We empirically show that reducing the search to
these groups significantly reduces the time of feature construction using
logical, relational, Cartesian, numerical, and threshold num-of-N and X-of-N
constructive operators. An analysis on 10 transparent synthetic datasets shows
that EFC effectively identifies informative groups of attributes and constructs
relevant features. Using 30 real-world classification datasets, we show
significant improvements in classification accuracy for several classifiers and
demonstrate the feasibility of the proposed feature construction even for large
datasets. Finally, EFC generated interpretable features on a real-world problem
from the financial industry, which were confirmed by a domain expert.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2023 18:59:01 GMT'}]",2023-01-24,"[['Vouk', 'Boštjan', ''], ['Guid', 'Matej', ''], ['Robnik-Šikonja', 'Marko', '']]","['explainable artificial intelligence', 'prediction explanation', 'feature construction']"
13081,1910.08498,Ji\v{r}\'i Filipovi\v{c},"Filip Petrovi\v{c}, David St\v{r}el\'ak, Jana Hozzov\'a, Jaroslav
  O\v{l}ha, Richard Trembeck\'y, Siegfried Benkner, Ji\v{r}\'i Filipovi\v{c}","A Benchmark Set of Highly-efficient CUDA and OpenCL Kernels and its
  Dynamic Autotuning with Kernel Tuning Toolkit",,"Petrovic et al., A benchmark set of highly-efficient CUDA and
  OpenCL kernels and its dynamic autotuning with Kernel Tuning Toolkit. In
  Future Generation Computer Systems, Vol. 108, pages 161-177. 2020",10.1016/j.future.2020.02.069,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autotuning of performance-relevant source-code parameters allows to
automatically tune applications without hard coding optimizations and thus
helps with keeping the performance portable. In this paper, we introduce a
benchmark set of ten autotunable kernels for important computational problems
implemented in OpenCL or CUDA. Using our Kernel Tuning Toolkit, we show that
with autotuning most of the kernels reach near-peak performance on various GPUs
and outperform baseline implementations on CPUs and Xeon Phis. Our evaluation
also demonstrates that autotuning is key to performance portability. In
addition to offline tuning, we also introduce dynamic autotuning of code
optimization parameters during application runtime. With dynamic tuning, the
Kernel Tuning Toolkit enables applications to re-tune performance-critical
kernels at runtime whenever needed, for example, when input data changes.
Although it is generally believed that autotuning spaces tend to be too large
to be searched during application runtime, we show that it is not necessarily
the case when tuning spaces are designed rationally. Many of our kernels reach
near peak-performance with moderately sized tuning spaces that can be searched
at runtime with acceptable overhead. Finally we demonstrate, how dynamic
performance tuning can be integrated into a real-world application from
cryo-electron microscopy domain.
","[{'version': 'v1', 'created': 'Fri, 18 Oct 2019 16:46:23 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Feb 2020 11:26:30 GMT'}]",2020-03-02,"[['Petrovič', 'Filip', ''], ['Střelák', 'David', ''], ['Hozzová', 'Jana', ''], ['Oľha', 'Jaroslav', ''], ['Trembecký', 'Richard', ''], ['Benkner', 'Siegfried', ''], ['Filipovič', 'Jiří', '']]","['dynamic autotuning', 'opencl', 'cuda', 'performance optimization', 'autotuning benchmark set']"
13082,2004.14098,Saloua Bennani,"Saloua Bennani, Iliass Ait El Kouch, Mahmoud El Hamlaoui, Sophie
  Ebersold, Bernard Coulette, and Mahmoud Nassar",A Formalization of Group Decision Making in Multi-viewpoints Design,,"Computer and Information Science, 2020, vol. 13, no 1",10.5539/cis.v13n1p58,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Complex systems are typically designed collaboratively by stakeholders from
different domains. This multi viewpoints paradigm promotes the separation of
concerns since separate teams, from different business viewpoints, build
partial models describing the system. These partial models are naturally
heterogeneous. So, it is difficult to ensure their inter-model consistency if
kept separately. For that, we propose a collaborative approach that combines
Group Decision Making (GDM) and Model-Based Engineering (MBE). This paper
highlights the GDM part of our approach and especially the concept of decision
policy that enables coming up with collective decisions in group
decision-making contexts.
","[{'version': 'v1', 'created': 'Wed, 29 Apr 2020 11:42:12 GMT'}]",2020-04-30,"[['Bennani', 'Saloua', ''], ['Kouch', 'Iliass Ait El', ''], ['Hamlaoui', 'Mahmoud El', ''], ['Ebersold', 'Sophie', ''], ['Coulette', 'Bernard', ''], ['Nassar', 'Mahmoud', '']]","['group decision-making (GDM)', 'collaboration', 'pattern', 'design', 'multi viewpoints', 'models']"
13083,1710.08343,Tomoyoshi Shimobaba Dr.,"Tomoyoshi Shimobaba, Yutaka Endo, Takashi Nishitsuji, Takayuki
  Takahashi, Yuki Nagahama, Satoki Hasegawa, Marie Sano, Ryuji Hirayama,
  Takashi Kakue, Atsushi Shiraki, Tomoyoshi Ito",Computational ghost imaging using deep learning,,,10.1016/j.optcom.2017.12.041,,cs.CV physics.optics,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computational ghost imaging (CGI) is a single-pixel imaging technique that
exploits the correlation between known random patterns and the measured
intensity of light transmitted (or reflected) by an object. Although CGI can
obtain two- or three- dimensional images with a single or a few bucket
detectors, the quality of the reconstructed images is reduced by noise due to
the reconstruction of images from random patterns. In this study, we improve
the quality of CGI images using deep learning. A deep neural network is used to
automatically learn the features of noise-contaminated CGI images. After
training, the network is able to predict low-noise images from new
noise-contaminated CGI images.
","[{'version': 'v1', 'created': 'Thu, 19 Oct 2017 01:54:52 GMT'}]",2018-01-17,"[['Shimobaba', 'Tomoyoshi', ''], ['Endo', 'Yutaka', ''], ['Nishitsuji', 'Takashi', ''], ['Takahashi', 'Takayuki', ''], ['Nagahama', 'Yuki', ''], ['Hasegawa', 'Satoki', ''], ['Sano', 'Marie', ''], ['Hirayama', 'Ryuji', ''], ['Kakue', 'Takashi', ''], ['Shiraki', 'Atsushi', ''], ['Ito', 'Tomoyoshi', '']]","['Computational ghost imaging', 'Ghost imaging', 'Deep-learning']"
13084,2203.15369,Stefano Zacchiroli,"Davide Rossi, Stefano Zacchiroli (IP Paris, LTCI)",Geographic Diversity in Public Code Contributions,"The 2022 Mining Software Repositories Conference, May 2022,
  Pittsburgh, Pennsylvania, United States",,10.1145/3524842.3528471,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We conduct an exploratory, large-scale, longitudinal study of 50 years of
commits to publicly available version control system repositories, in order to
characterize the geographic diversity of contributors to public code and its
evolution over time. We analyze in total 2.2 billion commits collected by
Software Heritage from 160 million projects and authored by 43 million authors
during the 1971-2021 time period. We geolocate developers to 12 world regions
derived from the United Nation geoscheme, using as signals email top-level
domains, author names compared with names distributions around the world, and
UTC offsets mined from commit metadata.We find evidence of the early dominance
of North America in open source software, later joined by Europe. After that
period, the geographic diversity in public code has been constantly increasing.
We also identify relevant historical shifts related to the UNIX wars, the
increase of coding literacy in Central and South Asia, and broader phenomena
like colonialism and people movement across countries (immigration/emigration).
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2022 09:07:43 GMT'}]",2022-03-30,"[['Rossi', 'Davide', '', 'IP Paris, LTCI'], ['Zacchiroli', 'Stefano', '', 'IP Paris, LTCI']]","['geography', 'diversity', 'open source', 'commit', 'version control systems', 'social coding', 'software heritage']"
13085,2201.07598,Shigang Li,"Shigang Li, Torsten Hoefler",Near-Optimal Sparse Allreduce for Distributed Deep Learning,"Published in Proceedings of the 27th ACM SIGPLAN Symposium on
  Principles and Practice of Parallel Programming (PPoPP'22), April 2-6, 2022,
  Pages 135-149, https://doi.org/10.1145/3503221.3508399",,10.1145/3503221.3508399,,cs.DC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Communication overhead is one of the major obstacles to train large deep
learning models at scale. Gradient sparsification is a promising technique to
reduce the communication volume. However, it is very challenging to obtain real
performance improvement because of (1) the difficulty of achieving an scalable
and efficient sparse allreduce algorithm and (2) the sparsification overhead.
This paper proposes O$k$-Top$k$, a scheme for distributed training with sparse
gradients. O$k$-Top$k$ integrates a novel sparse allreduce algorithm (less than
6$k$ communication volume which is asymptotically optimal) with the
decentralized parallel Stochastic Gradient Descent (SGD) optimizer, and its
convergence is proved. To reduce the sparsification overhead, O$k$-Top$k$
efficiently selects the top-$k$ gradient values according to an estimated
threshold. Evaluations are conducted on the Piz Daint supercomputer with neural
network models from different deep learning domains. Empirical results show
that O$k$-Top$k$ achieves similar model accuracy to dense allreduce. Compared
with the optimized dense and the state-of-the-art sparse allreduces,
O$k$-Top$k$ is more scalable and significantly improves training throughput
(e.g., 3.29x-12.95x improvement for BERT on 256 GPUs).
","[{'version': 'v1', 'created': 'Wed, 19 Jan 2022 13:56:57 GMT'}, {'version': 'v2', 'created': 'Thu, 26 May 2022 11:08:18 GMT'}]",2022-05-27,"[['Li', 'Shigang', ''], ['Hoefler', 'Torsten', '']]","['distributed deep learning', 'allreduce', 'gradientsparsification', 'data parallelism']"
13086,2101.04446,Gianmarco Cerutti,"Gianmarco Cerutti, Renzo Andri, Lukas Cavigelli, Michele Magno,
  Elisabetta Farella, Luca Benini","Sound Event Detection with Binary Neural Networks on Tightly
  Power-Constrained IoT Devices",6 pages conference,,10.1145/3370748.3406588,,cs.LG eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sound event detection (SED) is a hot topic in consumer and smart city
applications. Existing approaches based on Deep Neural Networks are very
effective, but highly demanding in terms of memory, power, and throughput when
targeting ultra-low power always-on devices.
  Latency, availability, cost, and privacy requirements are pushing recent IoT
systems to process the data on the node, close to the sensor, with a very
limited energy supply, and tight constraints on the memory size and processing
capabilities precluding to run state-of-the-art DNNs.
  In this paper, we explore the combination of extreme quantization to a
small-footprint binary neural network (BNN) with the highly energy-efficient,
RISC-V-based (8+1)-core GAP8 microcontroller. Starting from an existing CNN for
SED whose footprint (815 kB) exceeds the 512 kB of memory available on our
platform, we retrain the network using binary filters and activations to match
these memory constraints. (Fully) binary neural networks come with a natural
drop in accuracy of 12-18% on the challenging ImageNet object recognition
challenge compared to their equivalent full-precision baselines. This BNN
reaches a 77.9% accuracy, just 7% lower than the full-precision version, with
58 kB (7.2 times less) for the weights and 262 kB (2.4 times less) memory in
total. With our BNN implementation, we reach a peak throughput of 4.6 GMAC/s
and 1.5 GMAC/s over the full network, including preprocessing with Mel bins,
which corresponds to an efficiency of 67.1 GMAC/s/W and 31.3 GMAC/s/W,
respectively. Compared to the performance of an ARM Cortex-M4 implementation,
our system has a 10.3 times faster execution time and a 51.1 times higher
energy-efficiency.
","[{'version': 'v1', 'created': 'Tue, 12 Jan 2021 12:38:23 GMT'}]",2021-01-13,"[['Cerutti', 'Gianmarco', ''], ['Andri', 'Renzo', ''], ['Cavigelli', 'Lukas', ''], ['Magno', 'Michele', ''], ['Farella', 'Elisabetta', ''], ['Benini', 'Luca', '']]","['Binary Neural Networks', 'Sound Event Detection', 'Ultra Low Power']"
13087,2208.01283,Qiong Wu,"Qiong Wu, Shuai Shi, Ziyang Wan, Qiang Fan, Pingyi Fan, Cui Zhang","Towards V2I Age-aware Fairness Access: A DQN Based Intelligent Vehicular
  Node Training and Test Method","This paper has been accepted by Chinese Journal of Electronics.
  Simulation codes have been provided at:
  https://github.com/qiongwu86/Age-Fairness",,10.23919/cje.2022.00.093.,,cs.NI eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vehicles on the road exchange data with base station (BS) frequently through
vehicle to infrastructure (V2I) communications to ensure the normal use of
vehicular applications, where the IEEE 802.11 distributed coordination function
(DCF) is employed to allocate a minimum contention window (MCW) for channel
access. Each vehicle may change its MCW to achieve more access opportunities at
the expense of others, which results in unfair communication performance.
Moreover, the key access parameters MCW is the privacy information and each
vehicle are not willing to share it with other vehicles. In this uncertain
setting, age of information (AoI) is an important communication metric to
measure the freshness of data, we design an intelligent vehicular node to learn
the dynamic environment and predict the optimal MCW which can make it achieve
age fairness. In order to allocate the optimal MCW for the vehicular node, we
employ a learning algorithm to make a desirable decision by learning from
replay history data. In particular, the algorithm is proposed by extending the
traditional DQN training and testing method. Finally, by comparing with other
methods, it is proved that the proposed DQN method can significantly improve
the age fairness of the intelligent node.
","[{'version': 'v1', 'created': 'Tue, 2 Aug 2022 07:09:54 GMT'}]",2022-11-16,"[['Wu', 'Qiong', ''], ['Shi', 'Shuai', ''], ['Wan', 'Ziyang', ''], ['Fan', 'Qiang', ''], ['Fan', 'Pingyi', ''], ['Zhang', 'Cui', '']]","['vehicles', 'fair', 'access', 'AoI', 'DQN']"
13088,2205.07953,Derya Soydaner,"H\""useyin Bahtiyar, Derya Soydaner, Esra Y\""uksel","Application of multilayer perceptron with data augmentation in nuclear
  physics",,,10.1016/j.asoc.2022.109470,,cs.LG nucl-th,http://creativecommons.org/licenses/by/4.0/,"  Neural networks have become popular in many fields of science since they
serve as promising, reliable and powerful tools. In this work, we study the
effect of data augmentation on the predictive power of neural network models
for nuclear physics data. We present two different data augmentation
techniques, and we conduct a detailed analysis in terms of different depths,
optimizers, activation functions and random seed values to show the success and
robustness of the model. Using the experimental uncertainties for data
augmentation for the first time, the size of the training data set is
artificially boosted and the changes in the root-mean-square error between the
model predictions on the test set and the experimental data are investigated.
Our results show that the data augmentation decreases the prediction errors,
stabilizes the model and prevents overfitting. The extrapolation capabilities
of the MLP models are also tested for newly measured nuclei in AME2020 mass
table, and it is shown that the predictions are significantly improved by using
data augmentation.
","[{'version': 'v1', 'created': 'Mon, 16 May 2022 19:29:37 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Jul 2022 12:47:09 GMT'}]",2022-09-29,"[['Bahtiyar', 'Hüseyin', ''], ['Soydaner', 'Derya', ''], ['Yüksel', 'Esra', '']]","['Deep neural networks', 'nuclear binding energy', 'regression', 'data']"
13089,2201.06771,Dongha Lee,"Dongha Lee, Jiaming Shen, SeongKu Kang, Susik Yoon, Jiawei Han, Hwanjo
  Yu","TaxoCom: Topic Taxonomy Completion with Hierarchical Discovery of Novel
  Topic Clusters","The Web Conference (WWW) 2022, 11 pages, 7 figures",,10.1145/3485447.3512002,,cs.AI cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Topic taxonomies, which represent the latent topic (or category) structure of
document collections, provide valuable knowledge of contents in many
applications such as web search and information filtering. Recently, several
unsupervised methods have been developed to automatically construct the topic
taxonomy from a text corpus, but it is challenging to generate the desired
taxonomy without any prior knowledge. In this paper, we study how to leverage
the partial (or incomplete) information about the topic structure as guidance
to find out the complete topic taxonomy. We propose a novel framework for topic
taxonomy completion, named TaxoCom, which recursively expands the topic
taxonomy by discovering novel sub-topic clusters of terms and documents. To
effectively identify novel topics within a hierarchical topic structure,
TaxoCom devises its embedding and clustering techniques to be closely-linked
with each other: (i) locally discriminative embedding optimizes the text
embedding space to be discriminative among known (i.e., given) sub-topics, and
(ii) novelty adaptive clustering assigns terms into either one of the known
sub-topics or novel sub-topics. Our comprehensive experiments on two real-world
datasets demonstrate that TaxoCom not only generates the high-quality topic
taxonomy in terms of term coherency and topic coverage but also outperforms all
other baselines for a downstream task.
","[{'version': 'v1', 'created': 'Tue, 18 Jan 2022 07:07:38 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Jan 2022 20:02:10 GMT'}]",2022-01-21,"[['Lee', 'Dongha', ''], ['Shen', 'Jiaming', ''], ['Kang', 'SeongKu', ''], ['Yoon', 'Susik', ''], ['Han', 'Jiawei', ''], ['Yu', 'Hwanjo', '']]","['Topic taxonomy completion', 'Hierarchical topic discovery', 'Noveltydetection', 'Text embedding', 'Text clustering']"
13090,2107.02364,Zhe Liu,"Yuhui Su, Zhe Liu, Chunyang Chen, Junjie Wang, Qing Wang","OwlEyes-Online: A Fully Automated Platform for Detecting and Localizing
  UI Display Issues",Accepted to 29th International Conference on ESEC/FSE '21,,10.1145/3468264.3473109,fse21demo-p3-p,cs.SE cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Graphical User Interface (GUI) provides visual bridges between software apps
and end users. However, due to the compatibility of software or hardware, UI
display issues such as text overlap, blurred screen, image missing always occur
during GUI rendering on different devices. Because these UI display issues can
be found directly by human eyes, in this paper, we implement an online UI
display issue detection tool OwlEyes-Online, which provides a simple and
easy-to-use platform for users to realize the automatic detection and
localization of UI display issues. The OwlEyes-Online can automatically run the
app and get its screenshots and XML files, and then detect the existence of
issues by analyzing the screenshots. In addition, OwlEyes-Online can also find
the detailed area of the issue in the given screenshots to further remind
developers. Finally, OwlEyes-Online will automatically generate test reports
with UI display issues detected in app screenshots and send them to users. The
OwlEyes-Online was evaluated and proved to be able to accurately detect UI
display issues. Tool Link: http://www.owleyes.online:7476 Github Link:
https://github.com/franklinbill/owleyes Demo Video Link:
https://youtu.be/002nHZBxtCY
","[{'version': 'v1', 'created': 'Tue, 6 Jul 2021 02:55:35 GMT'}]",2021-07-07,"[['Su', 'Yuhui', ''], ['Liu', 'Zhe', ''], ['Chen', 'Chunyang', ''], ['Wang', 'Junjie', ''], ['Wang', 'Qing', '']]","['UI display', 'Mobile app', 'UI testing', 'Deep learning', 'Issue detection']"
13091,2005.13457,Sergio Miguel Martin,"Sergio M. Martin, Daniel W\""alchli, Georgios Arampatzis, Athena E.
  Economides, Petr Karnakov, Petros Koumoutsakos","Korali: Efficient and Scalable Software Framework for Bayesian
  Uncertainty Quantification and Stochastic Optimization","12 pages, 12 figures",,10.1016/j.cma.2021.114264,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present Korali, an open-source framework for large-scale Bayesian
uncertainty quantification and stochastic optimization. The framework relies on
non-intrusive sampling of complex multiphysics models and enables their
exploitation for optimization and decision-making. In addition, its distributed
sampling engine makes efficient use of massively-parallel architectures while
introducing novel fault tolerance and load balancing mechanisms. We demonstrate
these features by interfacing Korali with existing high-performance software
such as Aphros, Lammps (CPU-based), and Mirheo (GPU-based) and show efficient
scaling for up to 512 nodes of the CSCS Piz Daint supercomputer. Finally, we
present benchmarks demonstrating that Korali outperforms related
state-of-the-art software frameworks.
","[{'version': 'v1', 'created': 'Wed, 27 May 2020 16:14:49 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Mar 2021 12:58:16 GMT'}]",2022-01-26,"[['Martin', 'Sergio M.', ''], ['Wälchli', 'Daniel', ''], ['Arampatzis', 'Georgios', ''], ['Economides', 'Athena E.', ''], ['Karnakov', 'Petr', ''], ['Koumoutsakos', 'Petros', '']]","['High-Performance Computing', 'Bayesian Uncertainty Quantification', 'Optimization']"
13092,2001.08010,Mahieddine Djoudi,"Zitouni Abdelhafid (LIRE), Hichem Rahab (ICOSI, LIRE), Abdelhafid
  Zitouni (LIRE), Mahieddine Djoudi (TECHN\'E - EA 6316)",ARAACOM: ARAbic Algerian Corpus for Opinion Mining,,"ICCES '17: Proceedings of the International Conference on
  Computing for Engineering and Sciences, Jul 2017, Istanbul, France. pp.35-39",10.1145/3129186.3129193,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, it is no more needed to do an enormous effort to distribute a lot
of forms to thousands of people and collect them, then convert this from into
electronic format to track people opinion about some subjects. A lot of web
sites can today reach a large spectrum with less effort. The majority of web
sites suggest to their visitors to leave backups about their feeling of the
site or events. So, this makes for us a lot of data which need powerful mean to
exploit. Opinion mining in the web becomes more and more an attracting task,
due the increasing need for individuals and societies to track the mood of
people against several subjects of daily life (sports, politics,
television,...). A lot of works in opinion mining was developed in western
languages especially English, such works in Arabic language still very scarce.
In this paper, we propose our approach, for opinion mining in Arabic Algerian
news paper. CCS CONCEPTS $\bullet$Information systems~Sentiment analysis
$\bullet$ Computing methodologies~Natural language processing
","[{'version': 'v1', 'created': 'Wed, 22 Jan 2020 13:45:34 GMT'}]",2020-01-29,"[['Abdelhafid', 'Zitouni', '', 'LIRE'], ['Rahab', 'Hichem', '', 'ICOSI, LIRE'], ['Zitouni', 'Abdelhafid', '', 'LIRE'], ['Djoudi', 'Mahieddine', '', 'TECHNÉ - EA 6316']]","['Opinion Mining', 'Sentiment Analysis', 'Arabic comments', 'machine learning', 'NLP', 'newspaper', 'SVM', 'NB']"
13093,2208.09847,Xinyu Ma,"Xinyu Ma, Jiafeng Guo, Ruqing Zhang, Yixing Fan and Xueqi Cheng","Scattered or Connected? An Optimized Parameter-efficient Tuning Approach
  for Information Retrieval",Accepted by CIKM2022,,10.1145/3511808.3557445,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pre-training and fine-tuning have achieved significant advances in the
information retrieval (IR). A typical approach is to fine-tune all the
parameters of large-scale pre-trained models (PTMs) on downstream tasks. As the
model size and the number of tasks increase greatly, such approach becomes less
feasible and prohibitively expensive. Recently, a variety of
parameter-efficient tuning methods have been proposed in natural language
processing (NLP) that only fine-tune a small number of parameters while still
attaining strong performance. Yet there has been little effort to explore
parameter-efficient tuning for IR.
  In this work, we first conduct a comprehensive study of existing
parameter-efficient tuning methods at both the retrieval and re-ranking stages.
Unlike the promising results in NLP, we find that these methods cannot achieve
comparable performance to full fine-tuning at both stages when updating less
than 1\% of the original model parameters. More importantly, we find that the
existing methods are just parameter-efficient, but not learning-efficient as
they suffer from unstable training and slow convergence. To analyze the
underlying reason, we conduct a theoretical analysis and show that the
separation of the inserted trainable modules makes the optimization difficult.
To alleviate this issue, we propose to inject additional modules alongside the
\acp{PTM} to make the original scattered modules connected. In this way, all
the trainable modules can form a pathway to smooth the loss surface and thus
help stabilize the training process. Experiments at both retrieval and
re-ranking stages show that our method outperforms existing parameter-efficient
methods significantly, and achieves comparable or even better performance over
full fine-tuning.
","[{'version': 'v1', 'created': 'Sun, 21 Aug 2022 08:56:02 GMT'}]",2022-08-23,"[['Ma', 'Xinyu', ''], ['Guo', 'Jiafeng', ''], ['Zhang', 'Ruqing', ''], ['Fan', 'Yixing', ''], ['Cheng', 'Xueqi', '']]","['Information Retrieval', 'Dense Retrieval', 'Parameter-efficient Tuning']"
13094,2005.08083,Alex De Sa',"Alex G. C. de S\'a, Cristiano G. Pimenta, Gisele L. Pappa and Alex A.
  Freitas","A Robust Experimental Evaluation of Automated Multi-Label Classification
  Methods",GECCO'2020 paper: Submitted and accepted,,10.1145/3377930.3390231,,cs.LG cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automated Machine Learning (AutoML) has emerged to deal with the selection
and configuration of algorithms for a given learning task. With the progression
of AutoML, several effective methods were introduced, especially for
traditional classification and regression problems. Apart from the AutoML
success, several issues remain open. One issue, in particular, is the lack of
ability of AutoML methods to deal with different types of data. Based on this
scenario, this paper approaches AutoML for multi-label classification (MLC)
problems. In MLC, each example can be simultaneously associated to several
class labels, unlike the standard classification task, where an example is
associated to just one class label. In this work, we provide a general
comparison of five automated multi-label classification methods -- two
evolutionary methods, one Bayesian optimization method, one random search and
one greedy search -- on 14 datasets and three designed search spaces. Overall,
we observe that the most prominent method is the one based on a canonical
grammar-based genetic programming (GGP) search method, namely
Auto-MEKA$_{GGP}$. Auto-MEKA$_{GGP}$ presented the best average results in our
comparison and was statistically better than all the other methods in different
search spaces and evaluated measures, except when compared to the greedy search
method.
","[{'version': 'v1', 'created': 'Sat, 16 May 2020 20:08:04 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Jul 2020 16:48:27 GMT'}]",2020-08-03,"[['de Sá', 'Alex G. C.', ''], ['Pimenta', 'Cristiano G.', ''], ['Pappa', 'Gisele L.', ''], ['Freitas', 'Alex A.', '']]","['Automated Machine Learning (AutoML)', 'Multi-Label Classification', 'Search Methods', 'Search Spaces']"
13095,2011.11210,Han Hu,Qing Zhu and Qisen Shang and Han Hu and Haojia Yu and Ruofei Zhong,"Structure-Aware Completion of Photogrammetric Meshes in Urban Road
  Environment",,,10.1016/j.isprsjprs.2021.02.010,,cs.CV,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Photogrammetric mesh models obtained from aerial oblique images have been
widely used for urban reconstruction. However, the photogrammetric meshes also
suffer from severe texture problems, especially on the road areas due to
occlusion. This paper proposes a structure-aware completion approach to improve
the quality of meshes by removing undesired vehicles on the road seamlessly.
Specifically, the discontinuous texture atlas is first integrated to a
continuous screen space through rendering by the graphics pipeline; the
rendering also records necessary mapping for deintegration to the original
texture atlas after editing. Vehicle regions are masked by a standard object
detection approach, e.g. Faster RCNN. Then, the masked regions are completed
guided by the linear structures and regularities in the road region, which is
implemented based on Patch Match. Finally, the completed rendered image is
deintegrated to the original texture atlas and the triangles for the vehicles
are also flattened for improved meshes. Experimental evaluations and analyses
are conducted against three datasets, which are captured with different sensors
and ground sample distances. The results reveal that the proposed method can
quite realistic meshes after removing the vehicles. The structure-aware
completion approach for road regions outperforms popular image completion
methods and ablation study further confirms the effectiveness of the linear
guidance. It should be noted that the proposed method is also capable to handle
tiled mesh models for large-scale scenes. Dataset and code are available at
vrlab.org.cn/~hanhu/projects/mesh.
","[{'version': 'v1', 'created': 'Mon, 23 Nov 2020 05:04:28 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Nov 2020 05:54:14 GMT'}, {'version': 'v3', 'created': 'Wed, 10 Feb 2021 03:45:29 GMT'}]",2021-03-12,"[['Zhu', 'Qing', ''], ['Shang', 'Qisen', ''], ['Hu', 'Han', ''], ['Yu', 'Haojia', ''], ['Zhong', 'Ruofei', '']]","['Oblique Photogrammetry', '3D Model', 'Model Correction', 'Image Completion']"
13096,2108.03939,Nils Kurbis,"Nils K\""urbis","Normalisation and Subformula Property for a System of Classical Logic
  with Tarski's Rule",,Archive for Mathematical Logic 2021,10.1007/s00153-021-00775-6,,cs.LO math.LO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  This paper considers a formalisation of classical logic using general
introduction rules and general elimination rules. It proposes a definition of
`maximal formula', `segment' and `maximal segment' suitable to the system, and
gives reduction procedures for them. It is then shown that deductions in the
system convert into normal form, i.e. deductions that contain neither maximal
formulas nor maximal segments, and that deductions in normal form satisfy the
subformula property. Tarski's Rule is treated as a general introduction rule
for implication. The general introduction rule for negation has a similar form.
Maximal formulas with implication or negation as main operator require
reduction procedures of a more intricate kind not present in normalisation for
intuitionist logic.
","[{'version': 'v1', 'created': 'Mon, 9 Aug 2021 11:10:55 GMT'}]",2021-08-13,"[['Kürbis', 'Nils', '']]","['proof theory', 'classical logic', 'normalisation', 'subformula property']"
13097,1702.03790,Ralph Ewerth,"Markus M\""uhling, Manja Meister, Nikolaus Korfhage, J\""org Wehling,
  Angelika H\""orth, Ralph Ewerth, Bernd Freisleben","Content-Based Video Retrieval in Historical Collections of the German
  Broadcasting Archive","TPDL 2016, Hannover, Germany. Final version is available at Springer
  via DOI",,10.1007/978-3-319-43997-6_6,,cs.DL cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The German Broadcasting Archive (DRA) maintains the cultural heritage of
radio and television broadcasts of the former German Democratic Republic (GDR).
The uniqueness and importance of the video material stimulates a large
scientific interest in the video content. In this paper, we present an
automatic video analysis and retrieval system for searching in historical
collections of GDR television recordings. It consists of video analysis
algorithms for shot boundary detection, concept classification, person
recognition, text recognition and similarity search. The performance of the
system is evaluated from a technical and an archival perspective on 2,500 hours
of GDR television recordings.
","[{'version': 'v1', 'created': 'Mon, 13 Feb 2017 14:42:31 GMT'}]",2017-02-14,"[['Mühling', 'Markus', ''], ['Meister', 'Manja', ''], ['Korfhage', 'Nikolaus', ''], ['Wehling', 'Jörg', ''], ['Hörth', 'Angelika', ''], ['Ewerth', 'Ralph', ''], ['Freisleben', 'Bernd', '']]","['German Broadcasting Archive', 'Automatic Content-BasedVideo Analysis', 'Content-Based Video Retrieval']"
13098,2202.05074,Emmanouil Papadogiannakis,"Emmanouil Papadogiannakis, Panagiotis Papadopoulos, Evangelos P.
  Markatos, Nicolas Kourtellis","Leveraging Google's Publisher-specific IDs to Detect Website
  Administration","10 pages, To be published at The Web Conference 2022 (WWW 2022).
  Please cite the WWW version",,10.1145/3485447.3512124,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Digital advertising is the most popular way for content monetization on the
Internet. Publishers spawn new websites, and older ones change hands with the
sole purpose of monetizing user traffic. In this ever-evolving ecosystem, it is
challenging to effectively answer questions such as: Which entities monetize
what websites? What categories of websites does an average entity typically
monetize on and how diverse are these websites? How has this website
administration ecosystem changed across time?
  In this paper, we propose a novel, graph-based methodology to detect
administration of websites on the Web, by exploiting the ad-related
publisher-specific IDs. We apply our methodology across the top 1 million
websites and study the characteristics of the created graphs of website
administration. Our findings show that approximately 90% of the websites are
associated each with a single publisher, and that small publishers tend to
manage less popular websites. We perform a historical analysis of up to 8
million websites, and find a new, constantly rising number of (intermediary)
publishers that control and monetize traffic from hundreds of websites, seeking
a share of the ad-market pie. We also observe that over time, websites tend to
move from big to smaller administrators.
","[{'version': 'v1', 'created': 'Thu, 10 Feb 2022 14:59:17 GMT'}]",2022-02-11,"[['Papadogiannakis', 'Emmanouil', ''], ['Papadopoulos', 'Panagiotis', ''], ['Markatos', 'Evangelos P.', ''], ['Kourtellis', 'Nicolas', '']]","['Web Administration', 'Advertising', 'Web Monetization', 'Identifiers']"
13099,2210.04976,Fadlullah Raji,Fadlullah Raji and Lei Miao,"Optimal wireless rate and power control in the presence of jammers using
  reinforcement learning","Published in International Telecommunication Union, Journal on Future
  and Evolving Technologies (ITU J-FET) 2022","ITU Journal on Future and Evolving Technologies. Volume 3, Issue
  2, Pages 508-522 (2022)",10.52953/ANSC4385,,cs.NI cs.SY eess.SY,http://creativecommons.org/licenses/by/4.0/,"  Future wireless networks require high throughput and energy efficiency. This
paper studies using Reinforcement Learning (RL) to do transmission rate and
power control for maximizing a joint reward function consisting of both
throughput and energy consumption. We design the system state to include
factors that reflect packet queue length, interference from other nodes,
quality of the wireless channel, battery status, etc. The reward function is
normalized and does not involve unit conversion. It can be used to train three
different types of agents: throughput-critical, energy-critical, and throughput
and energy balanced. Using the NS-3 network simulation software, we implement
and train these agents in an 802.11ac network with the presence of a jammer. We
then test the agents with two jamming nodes interfering with the packets
received at the receiver. We compare the performance of our RL optimal policies
with the popular Minstrel rate adaptation algorithm: our approach can achieve
(i) higher throughput when using the throughput-critical reward function; (ii)
lower energy consumption when using the energy-critical reward function; and
(iii) higher throughput and slightly higher energy when using the throughput
and energy balanced reward function. Although our discussion is focused on
802.11ac networks, our method is readily applicable to other types of wireless
networks.
","[{'version': 'v1', 'created': 'Mon, 10 Oct 2022 19:20:52 GMT'}]",2022-10-12,"[['Raji', 'Fadlullah', ''], ['Miao', 'Lei', '']]","['machine learning', 'reinforcement learning', 'wireless communications', 'wireless transmission control']"
13100,2005.08101,Marie Destandau,Marie Destandau and Jean-Daniel Fekete,The Missing Path: Analysing Incompleteness in Knowledge Graphs,"10 pages, 11 figures",,10.1177/1473871621991539,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Knowledge Graphs (KG) allow to merge and connect heterogeneous data despite
their differences; they are incomplete by design. Yet, KG data producers need
to ensure the best level of completeness, as far as possible. The difficulty is
that they have no means to distinguish cases where incomplete entities could
and should be fixed. We present a new visualisation tool: The Missing Path, to
support them in identifying coherent subsets of entities that can be repaired.
It relies on a map, grouping entities according to their incomplete profile.
The map is coordinated with histograms and stacked charts to support
interactive exploration and analysis; the summary of a subset can be compared
with the one of the full collection to reveal its distinctive features. We
conduct an iterative design process and evaluation with 9 Wikidata
contributors. Participants gain insights and find various strategies to
identify coherent subsets to be fixed.
","[{'version': 'v1', 'created': 'Sat, 16 May 2020 21:04:56 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Oct 2020 19:46:23 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Jan 2021 15:28:59 GMT'}]",2021-02-24,"[['Destandau', 'Marie', ''], ['Fekete', 'Jean-Daniel', '']]","['Knowledge Graphs', 'Incompleteness', 'Coordinated views', 'Exploratory Analysis', 'Wikidata']"
13101,2002.03258,Dingwen Tao,"Cody Rivera, Jieyang Chen, Nan Xiong, Shuaiwen Leon Song, and Dingwen
  Tao","TSM2X: High-Performance Tall-and-Skinny Matrix-Matrix Multiplication on
  GPUs","17 pages, 14 figures, published in JPDC",,10.1016/j.jpdc.2021.02.013,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linear algebra operations have been widely used in big data analytics and
scientific computations. Many works have been done on optimizing linear algebra
operations on GPUs with regular-shaped input. However, few works focus on fully
utilizing GPU resources when the input is not regular-shaped. Current
optimizations do not consider fully utilizing the memory bandwidth and
computing power; therefore, they can only achieve sub-optimal performance. In
this paper, we propose two efficient algorithms -- TSM2R and TSM2L -- for two
classes of tall-and-skinny matrix-matrix multiplications on GPUs. Both of them
focus on optimizing linear algebra operation with at least one of the input
matrices is tall-and-skinny. Specifically, TSM2R is designed for a large
regular-shaped matrix multiplying a tall-and-skinny matrix, while TSM2L is
designed for a tall-and-skinny matrix multiplying a small regular-shaped
matrix. We implement our proposed algorithms and test on several modern NVIDIA
GPU micro-architectures. Experiments show that, compared to the current
state-of-the-art works, (1) TSM2R speeds up the computation by 1.1x~3x and
improves the memory bandwidth utilization and computing power utilization by
8%~47.6% and 7%~37.3%, respectively, when the regular-shaped matrix size is
relatively large or medium; and (2) TSM2L speeds up the computation by
1.1x~3.5x and improve the memory bandwidth utilization by up to 55% when the
regular-shaped matrix size is relatively small.
","[{'version': 'v1', 'created': 'Sun, 9 Feb 2020 00:53:35 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Feb 2020 05:07:00 GMT'}, {'version': 'v3', 'created': 'Mon, 27 Jul 2020 17:09:09 GMT'}, {'version': 'v4', 'created': 'Tue, 28 Jul 2020 04:07:49 GMT'}, {'version': 'v5', 'created': 'Thu, 18 Feb 2021 07:34:19 GMT'}]",2021-02-19,"[['Rivera', 'Cody', ''], ['Chen', 'Jieyang', ''], ['Xiong', 'Nan', ''], ['Song', 'Shuaiwen Leon', ''], ['Tao', 'Dingwen', '']]","['Matrix-matrix multiplication', 'Tall-and-skinny matrix', 'GEMM', 'GPU', 'CUDA', 'Performance', 'Optimization']"
13102,2012.06062,Krzysztof Pot\k{e}pa,Krzysztof Pot\k{e}pa,Faster Deterministic Modular Subset Sum,"16 pages, accepted at ESA 2021",,10.4230/LIPIcs.ESA.2021.76,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  We consider the Modular Subset Sum problem: given a multiset $X$ of integers
from $\mathbb{Z}_m$ and a target integer $t$, decide if there exists a subset
of $X$ with a sum equal to $t \pmod{m}$. Recent independent works by Cardinal
and Iacono (SOSA'21), and Axiotis et al. (SOSA'21) provided simple and
near-linear algorithms for this problem. Cardinal and Iacono gave a randomized
algorithm that runs in $O(m \log m)$ time, while Axiotis et al. gave a
deterministic algorithm that runs in $O(m \text{ polylog } m)$ time. Both
results work by reduction to a text problem, which is solved using a dynamic
strings data structure.
  In this work, we develop a simple data structure, designed specifically to
handle the text problem that arises in the algorithms for Modular Subset Sum.
Our data structure, which we call the shift-tree, is a simple variant of a
segment tree. We provide both a hashing-based and a deterministic variant of
the shift-trees.
  We then apply our data structure to the Modular Subset Sum problem and obtain
two algorithms. The first algorithm is Monte-Carlo randomized and matches the
$O(m \log m)$ runtime of the Las-Vegas algorithm by Cardinal and Iacono. The
second algorithm is fully deterministic and runs in $O(m \log m \cdot
\alpha(m))$ time, where $\alpha$ is the inverse Ackermann function.
","[{'version': 'v1', 'created': 'Fri, 11 Dec 2020 01:00:34 GMT'}, {'version': 'v2', 'created': 'Sat, 3 Jul 2021 20:31:48 GMT'}]",2021-09-21,"[['Potępa', 'Krzysztof', '']]","['Modular Subset Sum', 'String Problem', 'Segment Tree', 'Data Structure']"
13103,1904.08314,Kyriaki Kalimeri,"Oscar Araque, Lorenzo Gatti and Kyriaki Kalimeri","MoralStrength: Exploiting a Moral Lexicon and Embedding Similarity for
  Moral Foundations Prediction",,Knowledge-Based Systems 2019,10.1016/j.knosys.2019.105184,,cs.CL cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Moral rhetoric plays a fundamental role in how we perceive and interpret the
information we receive, greatly influencing our decision-making process.
Especially when it comes to controversial social and political issues, our
opinions and attitudes are hardly ever based on evidence alone. The Moral
Foundations Dictionary (MFD) was developed to operationalize moral values in
the text. In this study, we present MoralStrength, a lexicon of approximately
1,000 lemmas, obtained as an extension of the Moral Foundations Dictionary,
based on WordNet synsets. Moreover, for each lemma it provides with a
crowdsourced numeric assessment of Moral Valence, indicating the strength with
which a lemma is expressing the specific value. We evaluated the predictive
potentials of this moral lexicon, defining three utilization approaches of
increased complexity, ranging from lemmas' statistical properties to a deep
learning approach of word embeddings based on semantic similarity. Logistic
regression models trained on the features extracted from MoralStrength,
significantly outperformed the current state-of-the-art, reaching an F1-score
of 87.6% over the previous 62.4% (p-value<0.01), and an average F1-Score of
86.25% over six different datasets. Such findings pave the way for further
research, allowing for an in-depth understanding of moral narratives in text
for a wide range of social issues.
","[{'version': 'v1', 'created': 'Wed, 17 Apr 2019 15:21:33 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Sep 2019 03:26:43 GMT'}]",2019-11-11,"[['Araque', 'Oscar', ''], ['Gatti', 'Lorenzo', ''], ['Kalimeri', 'Kyriaki', '']]","['Moral Foundations', 'moral values', 'lexicon', 'Twitter data', 'naturallanguage processing', 'machine learning']"
13104,1604.04653,Xavier Gir\'o-i-Nieto,"Eva Mohedano, Amaia Salvador, Kevin McGuinness, Ferran Marques, Noel
  E. O'Connor and Xavier Giro-i-Nieto",Bags of Local Convolutional Features for Scalable Instance Search,"Preprint of a short paper accepted in the ACM International
  Conference on Multimedia Retrieval (ICMR) 2016 (New York City, NY, USA)",,10.1145/2911996.2912061,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work proposes a simple instance retrieval pipeline based on encoding the
convolutional features of CNN using the bag of words aggregation scheme (BoW).
Assigning each local array of activations in a convolutional layer to a visual
word produces an \textit{assignment map}, a compact representation that relates
regions of an image with a visual word. We use the assignment map for fast
spatial reranking, obtaining object localizations that are used for query
expansion. We demonstrate the suitability of the BoW representation based on
local CNN features for instance retrieval, achieving competitive performance on
the Oxford and Paris buildings benchmarks. We show that our proposed system for
CNN feature aggregation with BoW outperforms state-of-the-art techniques using
sum pooling at a subset of the challenging TRECVid INS benchmark.
","[{'version': 'v1', 'created': 'Fri, 15 Apr 2016 22:02:22 GMT'}]",2016-06-21,"[['Mohedano', 'Eva', ''], ['Salvador', 'Amaia', ''], ['McGuinness', 'Kevin', ''], ['Marques', 'Ferran', ''], [""O'Connor"", 'Noel E.', ''], ['Giro-i-Nieto', 'Xavier', '']]","['Instance Retrieval', 'Convolutional Neural Networks', 'Bag ofWords']"
13105,1507.06025,Rimah  Amami,"Rimah Amami, Dorra Ben Ayed, Nouerddine Ellouze",Incorporating Belief Function in SVM for Phoneme Recognition,"9th International Conference, Hybrid Artificial Intelligence Systems,
  Salamanca, Spain, June 11-13, 2014","Lecture Notes in Computer Science Volume 8480, 2014, pp 191-199",10.1007/978-3-319-07617-1_17,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Support Vector Machine (SVM) method has been widely used in numerous
classification tasks. The main idea of this algorithm is based on the principle
of the margin maximization to find an hyperplane which separates the data into
two different classes.In this paper, SVM is applied to phoneme recognition
task. However, in many real-world problems, each phoneme in the data set for
recognition problems may differ in the degree of significance due to noise,
inaccuracies, or abnormal characteristics; All those problems can lead to the
inaccuracies in the prediction phase. Unfortunately, the standard formulation
of SVM does not take into account all those problems and, in particular, the
variation in the speech input. This paper presents a new formulation of SVM
(B-SVM) that attributes to each phoneme a confidence degree computed based on
its geometric position in the space. Then, this degree is used in order to
strengthen the class membership of the tested phoneme. Hence, we introduce a
reformulation of the standard SVM that incorporates the degree of belief.
Experimental performance on TIMIT database shows the effectiveness of the
proposed method B-SVM on a phoneme recognition problem.
","[{'version': 'v1', 'created': 'Wed, 22 Jul 2015 01:03:28 GMT'}]",2015-07-23,"[['Amami', 'Rimah', ''], ['Ayed', 'Dorra Ben', ''], ['Ellouze', 'Nouerddine', '']]","['SVM', 'Phoneme', 'Belief', 'TIMIT']"
13106,1910.09295,Jan Christian Blaise Cruz,"Jan Christian Blaise Cruz, Julianne Agatha Tan and Charibeth Cheng",Localization of Fake News Detection via Multitask Transfer Learning,"Published in the LREC 2020 Proceedings. Models and data available at
  https://github.com/jcblaisecruz02/Tagalog-fake-news","In Proceedings of The 12th Language Resources and Evaluation
  Conference, pp.2589-2597 (2020)",10.13140/RG.2.2.23028.40322,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of the internet as a fast medium of spreading fake news reinforces
the need for computational tools that combat it. Techniques that train fake
news classifiers exist, but they all assume an abundance of resources including
large labeled datasets and expert-curated corpora, which low-resource languages
may not have. In this work, we make two main contributions: First, we alleviate
resource scarcity by constructing the first expertly-curated benchmark dataset
for fake news detection in Filipino, which we call ""Fake News Filipino.""
Second, we benchmark Transfer Learning (TL) techniques and show that they can
be used to train robust fake news classifiers from little data, achieving 91%
accuracy on our fake news dataset, reducing the error by 14% compared to
established few-shot baselines. Furthermore, lifting ideas from multitask
learning, we show that augmenting transformer-based transfer techniques with
auxiliary language modeling losses improves their performance by adapting to
writing style. Using this, we improve TL performance by 4-6%, achieving an
accuracy of 96% on our best model. Lastly, we show that our method generalizes
well to different types of news articles, including political news,
entertainment news, and opinion articles.
","[{'version': 'v1', 'created': 'Mon, 21 Oct 2019 12:28:00 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Oct 2019 04:57:39 GMT'}, {'version': 'v3', 'created': 'Fri, 15 May 2020 17:54:09 GMT'}]",2020-05-18,"[['Cruz', 'Jan Christian Blaise', ''], ['Tan', 'Julianne Agatha', ''], ['Cheng', 'Charibeth', '']]","['Statistical and Machine Learning Methods', 'Language Modelling', 'Document Classification', 'Text Categorization']"
13107,2003.11432,Trenton Schulz,"Trenton Schulz, Jo Herstad, Harald Holone","Privacy at Home: an Inquiry into Sensors and Robots for the Stay at Home
  Elderly","18 pages, 5 figures, International Conference on Human Aspects of IT
  for the Aged Population, Part of 2018 HCI International","Human Aspects of IT for the Aged Population. Applications in
  Health, Assistance, and Entertainment, LNCS 10927, pp. 377-394, 2018",10.1007/978-3-319-92037-5_28,,cs.RO cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The elderly in the future will use smart house technology, sensors, and
robots to stay at home longer. Privacy at home for these elderly is important.
In this exploratory paper, we examine different understandings of privacy and
use Palen and Dourish's framework to look at the negotiation of privacy along
boundaries between a human at home, the robot, and its sensors. We select three
dilemmas: turning sensors on and off, the robot seeing through walls, and
machine learning. We discuss these dilemmas and also discuss ways the robot can
help make the elderly more aware of privacy issues and to build trust.
","[{'version': 'v1', 'created': 'Wed, 25 Mar 2020 14:55:57 GMT'}]",2020-03-26,"[['Schulz', 'Trenton', ''], ['Herstad', 'Jo', ''], ['Holone', 'Harald', '']]","['robot', 'human-robot interaction', 'privacy', 'trust', 'elderly', 'home']"
13108,2011.06326,Chanika Ruchini Mudalige,"Chanika Ruchini Mudalige, Dilini Karunarathna, Isanka Rajapaksha,
  Nisansa de Silva, Gathika Ratnayaka, Amal Shehan Perera, Ramesh Pathirana","SigmaLaw-ABSA: Dataset for Aspect-Based Sentiment Analysis in Legal
  Opinion Texts","6 pages, 2 figures, IEEE International Conference on Industrial and
  Information Systems(ICIIS) 2020",,10.1109/ICIIS51140.2020.9342650,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aspect-Based Sentiment Analysis (ABSA) has been prominent and ongoing
research over many different domains, but it is not widely discussed in the
legal domain. A number of publicly available datasets for a wide range of
domains usually fulfill the needs of researchers to perform their studies in
the field of ABSA. To the best of our knowledge, there is no publicly available
dataset for the Aspect (Party) Based Sentiment Analysis for legal opinion
texts. Therefore, creating a publicly available dataset for the research of
ABSA for the legal domain can be considered as a task with significant
importance. In this study, we introduce a manually annotated legal opinion text
dataset (SigmaLaw-ABSA) intended towards facilitating researchers for ABSA
tasks in the legal domain. SigmaLaw-ABSA consists of legal opinion texts in the
English language which have been annotated by human judges. This study
discusses the sub-tasks of ABSA relevant to the legal domain and how to use the
dataset to perform them. This paper also describes the statistics of the
dataset and as a baseline, we present some results on the performance of some
existing deep learning based systems on the SigmaLaw-ABSA dataset.
","[{'version': 'v1', 'created': 'Thu, 12 Nov 2020 11:45:47 GMT'}]",2021-03-18,"[['Mudalige', 'Chanika Ruchini', ''], ['Karunarathna', 'Dilini', ''], ['Rajapaksha', 'Isanka', ''], ['de Silva', 'Nisansa', ''], ['Ratnayaka', 'Gathika', ''], ['Perera', 'Amal Shehan', ''], ['Pathirana', 'Ramesh', '']]","['Aspect-Based Sentiment Analysis', 'Legal Domain', 'Information extraction', 'Natural Language Processing']"
13109,2011.15096,Etienne Richan,"Etienne Richan, Jean Rouat","A proposal and evaluation of new timbre visualisation methods for audio
  sample browsers",14 pages. Personal and Ubiquitous Computing (2020),,10.1007/s00779-020-01388-1,,cs.HC cs.SD eess.AS,http://creativecommons.org/licenses/by/4.0/,"  Searching through vast libraries of sound samples can be a daunting and
time-consuming task. Modern audio sample browsers use mappings between acoustic
properties and visual attributes to visually differentiate displayed items.
There are few studies focused on how well these mappings help users search for
a specific sample. We propose new methods for generating textural labels and
positioning samples based on perceptual representations of timbre. We perform a
series of studies to evaluate the benefits of using shape, color or texture as
labels in a known-item search task. We describe the motivation and
implementation of the study, and present an in-depth analysis of results. We
find that shape significantly improves task performance, while color and
texture have little effect. We also compare results between in-person and
online participants and propose research directions for further studies.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2020 18:30:26 GMT'}]",2020-12-01,"[['Richan', 'Etienne', ''], ['Rouat', 'Jean', '']]","['timbre perception', 'texture synthesis', 'color', 'shape', 'known-item search', 'media browsers']"
13110,2001.05964,Karsten Paul,"Karsten Paul, Christopher Zimmermann, Thang X. Duong, Roger A. Sauer","Isogeometric continuity constraints for multi-patch shells governed by
  fourth-order deformation and phase field models","In this version, typos in the list of references were fixed, floating
  pictures in Chapter 6 were reduced, and the sign of the bending moments was
  changed (see text passages after Eqs. (63) and (71), footnotes 13-14 and 23,
  and Appendix A",Comput. Methods Appl. Mech. Eng. 370 (2020),10.1016/j.cma.2020.113219,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work presents numerical techniques to enforce continuity constraints on
multi-patch surfaces for three distinct problem classes. The first involves
structural analysis of thin shells that are described by general Kirchhoff-Love
kinematics. Their governing equation is a vector-valued, fourth-order,
nonlinear, partial differential equation (PDE) that requires at least
$C^1$-continuity within a displacement-based finite element formulation. The
second class are surface phase separations modeled by a phase field. Their
governing equation is the Cahn-Hilliard equation - a scalar, fourth-order,
nonlinear PDE - that can be coupled to the thin shell PDE. The third class are
brittle fracture processes modeled by a phase field approach. In this work,
these are described by a scalar, fourth-order, nonlinear PDE that is similar to
the Cahn-Hilliard equation and is also coupled to the thin shell PDE. Using a
direct finite element discretization, the two phase field equations also
require at least a $C^1$-continuous formulation. Isogeometric surface
discretizations - often composed of multiple patches - thus require constraints
that enforce the $C^1$-continuity of displacement and phase field. For this,
two numerical strategies are presented: For this, two numerical strategies are
presented: A Lagrange multiplier formulation and a penalty method. The
curvilinear shell model including the geometrical constraints is taken from
Duong et al. (2017) and it is extended to model the coupled phase field
problems on thin shells of Zimmermann et al. (2019) and Paul et al. (2020) on
multi-patches. Their accuracy and convergence are illustrated by several
numerical examples considering deforming shells, phase separations on evolving
surfaces, and dynamic brittle fracture of thin shells.
","[{'version': 'v1', 'created': 'Thu, 16 Jan 2020 17:52:18 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Jul 2020 16:37:33 GMT'}, {'version': 'v3', 'created': 'Wed, 6 Oct 2021 10:33:39 GMT'}]",2021-10-07,"[['Paul', 'Karsten', ''], ['Zimmermann', 'Christopher', ''], ['Duong', 'Thang X.', ''], ['Sauer', 'Roger A.', '']]","['Isogeometric analysis', 'multi-patch discretization', 'Kirchhoff-Love shells', 'phase fieldmethods', 'Cahn-Hilliard equation', 'brittle fracture']"
13111,2301.07422,Pietro Liguori,"Domenico Cotroneo, Luigi De Simone, Pietro Liguori and Roberto Natella","Run-time Failure Detection via Non-intrusive Event Analysis in a
  Large-Scale Cloud Computing Platform",Paper accepted for publication in The Journal of Systems and Software,,10.1016/j.jss.2023.111611,,cs.SE cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Cloud computing systems fail in complex and unforeseen ways due to unexpected
combinations of events and interactions among hardware and software components.
These failures are especially problematic when they are silent, i.e., not
accompanied by any explicit failure notification, hindering the timely
detection and recovery. In this work, we propose an approach to run-time
failure detection tailored for monitoring multi-tenant and concurrent cloud
computing systems. The approach uses a non-intrusive form of event tracing,
without manual changes to the system's internals to propagate session
identifiers (IDs), and builds a set of lightweight monitoring rules from
fault-free executions. We evaluated the effectiveness of the approach in
detecting failures in the context of the OpenStack cloud computing platform, a
complex and ""off-the-shelf"" distributed system, by executing a campaign of
fault injection experiments in a multi-tenant scenario. Our experiments show
that the approach detects the failure with an F1 score (0.85) and accuracy
(0.77) higher than the ones provided by the OpenStack failure logging
mechanisms (0.53 and 0.50) and two non--session-aware run-time verification
approaches (both lower than 0.15). Moreover, the approach significantly
decreases the average time to detect failures at run-time (~114 seconds)
compared to the OpenStack logging mechanisms.
","[{'version': 'v1', 'created': 'Wed, 18 Jan 2023 10:42:30 GMT'}]",2023-01-19,"[['Cotroneo', 'Domenico', ''], ['De Simone', 'Luigi', ''], ['Liguori', 'Pietro', ''], ['Natella', 'Roberto', '']]","['Run-time Verification', 'Failure Detection', 'Cloud Computing', 'OpenStack', 'Fault Injection']"
13112,2010.04304,Daniele Reda,"Daniele Reda, Tianxin Tao, Michiel van de Panne","Learning to Locomote: Understanding How Environment Design Matters for
  Deep Reinforcement Learning","Presented at The 13th Annual ACM SIGGRAPH Conference on Motion,
  Interaction and Games",,10.1145/3424636.3426907,,cs.LG cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning to locomote is one of the most common tasks in physics-based
animation and deep reinforcement learning (RL). A learned policy is the product
of the problem to be solved, as embodied by the RL environment, and the RL
algorithm. While enormous attention has been devoted to RL algorithms, much
less is known about the impact of design choices for the RL environment. In
this paper, we show that environment design matters in significant ways and
document how it can contribute to the brittle nature of many RL results.
Specifically, we examine choices related to state representations, initial
state distributions, reward structure, control frequency, episode termination
procedures, curriculum usage, the action space, and the torque limits. We aim
to stimulate discussion around such choices, which in practice strongly impact
the success of RL when applied to continuous-action control problems of
interest to animation, such as learning to locomote.
","[{'version': 'v1', 'created': 'Fri, 9 Oct 2020 00:03:27 GMT'}]",2020-10-12,"[['Reda', 'Daniele', ''], ['Tao', 'Tianxin', ''], ['van de Panne', 'Michiel', '']]","['reinforcement learning', 'simulation environments', 'locomotion']"
13113,2108.12118,Raian Rahman,"Raian Rahman, Zadid Bin Azad, Md. Bakhtiar Hasan","Densely-Populated Traffic Detection using YOLOv5 and Non-Maximum
  Suppression Ensembling","13 pages, 4 figures, conference: International Conference on Big
  Data, IoT and Machine Learning 2021 (BIM 2021)",,10.1007/978-981-16-6636-0_43,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vehicular object detection is the heart of any intelligent traffic system. It
is essential for urban traffic management. R-CNN, Fast R-CNN, Faster R-CNN and
YOLO were some of the earlier state-of-the-art models. Region based CNN methods
have the problem of higher inference time which makes it unrealistic to use the
model in real-time. YOLO on the other hand struggles to detect small objects
that appear in groups. In this paper, we propose a method that can locate and
classify vehicular objects from a given densely crowded image using YOLOv5. The
shortcoming of YOLO was solved my ensembling 4 different models. Our proposed
model performs well on images taken from both top view and side view of the
street in both day and night. The performance of our proposed model was
measured on Dhaka AI dataset which contains densely crowded vehicular images.
Our experiment shows that our model achieved mAP@0.5 of 0.458 with inference
time of 0.75 sec which outperforms other state-of-the-art models on
performance. Hence, the model can be implemented in the street for real-time
traffic detection which can be used for traffic control and data collection.
","[{'version': 'v1', 'created': 'Fri, 27 Aug 2021 04:58:45 GMT'}]",2021-12-07,"[['Rahman', 'Raian', ''], ['Azad', 'Zadid Bin', ''], ['Hasan', 'Md. Bakhtiar', '']]","['Real-time object detection', 'Ensemble learning', 'YOLOv5', 'Non-Maximum Suppression']"
13114,2202.06806,Taeahn Kwon,"Taeahn Kwon, Minkyung Jeong, Eon-Suk Ko, Youngki Lee",Captivate! Contextual Language Guidance for Parent-Child Interaction,Published as a conference paper at CHI 2022,,10.1145/3491102.3501865,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To acquire language, children need rich language input. However, many parents
find it difficult to provide children with sufficient language input, which
risks delaying their language development. To aid these parents, we design
Captivate!, the first system that provides contextual language guidance to
parents during play. Our system tracks both visual and spoken language cues to
infer targets of joint attention, enabling the real-time suggestion of
situation-relevant phrases for the parent. We design our system through a
user-centered process with immigrant families--a highly vulnerable yet
understudied population--as well as professional speech language therapists.
Next, we evaluate Captivate! on parents with children aged 1-3 to observe
improvements in responsive language use. We share insights into developing
contextual guidance technology for linguistically diverse families.
","[{'version': 'v1', 'created': 'Mon, 14 Feb 2022 15:49:22 GMT'}]",2022-02-15,"[['Kwon', 'Taeahn', ''], ['Jeong', 'Minkyung', ''], ['Ko', 'Eon-Suk', ''], ['Lee', 'Youngki', '']]","['parent–child interaction', 'cultural diversity', 'language acquisition', 'context-aware systems', 'early childhood']"
13115,2010.00793,Runmin Cong,"Chongyi Li, Runmin Cong, Chunle Guo, Hua Li, Chunjie Zhang, Feng
  Zheng, and Yao Zhao","A Parallel Down-Up Fusion Network for Salient Object Detection in
  Optical Remote Sensing Images","Neurocomputing, 415, pp. 411-420, 2020",,10.1016/j.neucom.2020.05.108,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The diverse spatial resolutions, various object types, scales and
orientations, and cluttered backgrounds in optical remote sensing images (RSIs)
challenge the current salient object detection (SOD) approaches. It is commonly
unsatisfactory to directly employ the SOD approaches designed for nature scene
images (NSIs) to RSIs. In this paper, we propose a novel Parallel Down-up
Fusion network (PDF-Net) for SOD in optical RSIs, which takes full advantage of
the in-path low- and high-level features and cross-path multi-resolution
features to distinguish diversely scaled salient objects and suppress the
cluttered backgrounds. To be specific, keeping a key observation that the
salient objects still are salient no matter the resolutions of images are in
mind, the PDF-Net takes successive down-sampling to form five parallel paths
and perceive scaled salient objects that are commonly existed in optical RSIs.
Meanwhile, we adopt the dense connections to take advantage of both low- and
high-level information in the same path and build up the relations of cross
paths, which explicitly yield strong feature representations. At last, we fuse
the multiple-resolution features in parallel paths to combine the benefits of
the features with different resolutions, i.e., the high-resolution feature
consisting of complete structure and clear details while the low-resolution
features highlighting the scaled salient objects. Extensive experiments on the
ORSSD dataset demonstrate that the proposed network is superior to the
state-of-the-art approaches both qualitatively and quantitatively.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2020 05:27:57 GMT'}]",2020-10-05,"[['Li', 'Chongyi', ''], ['Cong', 'Runmin', ''], ['Guo', 'Chunle', ''], ['Li', 'Hua', ''], ['Zhang', 'Chunjie', ''], ['Zheng', 'Feng', ''], ['Zhao', 'Yao', '']]","['Optical remote sensing images', 'Salient object detection', 'Deep learning']"
13116,2205.06771,Caitlin Grasso,Caitlin Grasso and Josh Bongard,Empowered Neural Cellular Automata,"8 pages, 8 figures",,10.1145/3520304.3529067,,cs.NE cs.AI,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Information-theoretic fitness functions are becoming increasingly popular to
produce generally useful, task-independent behaviors. One such universal
function, dubbed empowerment, measures the amount of control an agent exerts on
its environment via its sensorimotor system. Specifically, empowerment attempts
to maximize the mutual information between an agent's actions and its received
sensor states at a later point in time. Traditionally, empowerment has been
applied to a conventional sensorimotor apparatus, such as a robot. Here, we
expand the approach to a distributed, multi-agent sensorimotor system embodied
by a neural cellular automaton (NCA). We show that the addition of empowerment
as a secondary objective in the evolution of NCA to perform the task of
morphogenesis, growing and maintaining a pre-specified shape, results in higher
fitness compared to evolving for morphogenesis alone. Results suggest there may
be a synergistic relationship between morphogenesis and empowerment. That is,
indirectly selecting for coordination between neighboring cells over the
duration of development is beneficial to the developmental process itself. Such
a finding may have applications in developmental biology by providing potential
mechanisms of communication between cells during growth from a single cell to a
multicellular, target morphology. Source code for the experiments in this paper
can be found at: \url{https://github.com/caitlingrasso/empowered-nca}.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2022 19:37:26 GMT'}]",2022-05-16,"[['Grasso', 'Caitlin', ''], ['Bongard', 'Josh', '']]","['neural cellular automata', 'empowerment', 'morphogenesis']"
13117,2203.05980,Laila El-Hamamsy,"Laila El-Hamamsy, Mar\'ia Zapata-C\'aceres, Estefan\'ia Mart\'in
  Barroso, Francesco Mondada, Jessica Dehler Zufferey, Barbara Bruno","The competent Computational Thinking test (cCTt): Development and
  validation of an unplugged Computational Thinking test for upper primary
  school",To appear in the Journal of Educational Computing Research,,10.1177/07356331221081753,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  With the increasing importance of Computational Thinking (CT) at all levels
of education, it is essential to have valid and reliable assessments.
Currently, there is a lack of such assessments in upper primary school. That is
why we present the development and validation of the competent CT test (cCTt),
an unplugged CT test targeting 7-9 year-old students. In the first phase, 37
experts evaluated the validity of the cCTt through a survey and focus group. In
the second phase, the test was administered to 1519 students. We employed
Classical Test Theory, Item Response Theory, and Confirmatory Factor Analysis
to assess the instruments' psychometric properties. The expert evaluation
indicates that the cCTt shows good face, construct, and content validity.
Furthermore, the psychometric analysis of the student data demonstrates
adequate reliability, difficulty, and discriminability for the target age
groups. Finally, shortened variants of the test are established through
Confirmatory Factor Analysis. To conclude, the proposed cCTt is a valid and
reliable instrument, for use by researchers and educators alike, which expands
the portfolio of validated CT assessments across compulsory education. Future
assessments looking at capturing CT in a more exhaustive manner might consider
combining the cCTt with other forms of assessments.
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2022 15:05:35 GMT'}, {'version': 'v2', 'created': 'Wed, 4 May 2022 19:35:04 GMT'}]",2022-05-23,"[['El-Hamamsy', 'Laila', ''], ['Zapata-Cáceres', 'María', ''], ['Barroso', 'Estefanía Martín', ''], ['Mondada', 'Francesco', ''], ['Zufferey', 'Jessica Dehler', ''], ['Bruno', 'Barbara', '']]","['Computational Thinking', 'Assessment', 'Primary education', 'Expert evaluation', 'Psychometric validation']"
13118,2206.12888,"J\""ames M\'en\'etrey","J\""ames M\'en\'etrey, Marcelo Pasin, Pascal Felber, Valerio Schiavoni",WebAssembly as a Common Layer for the Cloud-edge Continuum,"This publication incorporates results from the VEDLIoT project, which
  received funding from the European Union's Horizon 2020 research and
  innovation programme under grant agreement No 957197","FRAME'22: Proceedings of the 2nd Workshop on Flexible Resource and
  Application Management on the Edge, co-located with HPDC'22, July 2022, pp.
  3-8",10.1145/3526059.3533618,,cs.DC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the last decade, the cloud computing landscape has transformed from a
centralised architecture made of large data centres to a distributed and
heterogeneous architecture embracing edge and IoT units. This shift has created
the so-called cloud-edge continuum, which closes the gap between large data
centres and end-user devices. Existing solutions for programming the continuum
are, however, dominated by proprietary silos and incompatible technologies,
built around dedicated devices and run-time stacks. In this position paper, we
motivate the need for an interoperable environment that would run seamlessly
across hardware devices and software stacks, while achieving good performance
and a high level of security -- a critical requirement when processing data
off-premises. We argue that the technology provided by WebAssembly running on
modern virtual machines and shielded within trusted execution environments,
combined with a core set of services and support libraries, allows us to meet
both goals. We also present preliminary results from a prototype deployed on
the cloud-edge continuum.
","[{'version': 'v1', 'created': 'Sun, 26 Jun 2022 14:23:42 GMT'}]",2022-06-28,"[['Ménétrey', 'Jämes', ''], ['Pasin', 'Marcelo', ''], ['Felber', 'Pascal', ''], ['Schiavoni', 'Valerio', '']]","['WebAssembly', 'WASI', 'Trusted Execution Environments', 'Intel SGX', 'Arm TrustZone', 'Cloud-edge Continuum']"
13119,2110.15716,Kristine Mae Adlaon,Kristine Mae Adlaon and Nelson Marcos,"Building the Language Resource for a Cebuano-Filipino Neural Machine
  Translation System","Published in the Proceedings of the 2019 3rd International Conference
  on Natural Language Processing and Information Retrieval. arXiv admin note:
  substantial text overlap with arXiv:1902.07250",,10.1145/3342827.3342833,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parallel corpus is a critical resource in machine learning-based translation.
The task of collecting, extracting, and aligning texts in order to build an
acceptable corpus for doing the translation is very tedious most especially for
low-resource languages. In this paper, we present the efforts made to build a
parallel corpus for Cebuano and Filipino from two different domains: biblical
texts and the web. For the biblical resource, subword unit translation for
verbs and copy-able approach for nouns were applied to correct inconsistencies
in the translation. This correction mechanism was applied as a preprocessing
technique. On the other hand, for Wikipedia being the main web resource,
commonly occurring topic segments were extracted from both the source and the
target languages. These observed topic segments are unique in 4 different
categories. The identification of these topic segments may be used for the
automatic extraction of sentences. A Recurrent Neural Network was used to
implement the translation using OpenNMT sequence modeling tool in TensorFlow.
The two different corpora were then evaluated by using them as two separate
inputs in the neural network. Results have shown a difference in BLEU scores in
both corpora.
","[{'version': 'v1', 'created': 'Tue, 5 Oct 2021 23:03:09 GMT'}]",2021-11-01,"[['Adlaon', 'Kristine Mae', ''], ['Marcos', 'Nelson', '']]","['Language resources', 'neural machine translation', 'recurrent neural network', 'Cebuano-Filipino translation', 'OpenNMT', 'natural language processing']"
13120,2205.11082,Tanvi Mehta,"Tanvi Mehta, Ganesh Deshmukh","YouTube Ad View Sentiment Analysis using Deep Learning and Machine
  Learning","5 pages, 9 figures, Published with International Journal of Computer
  Applications (IJCA)","International Journal of Computer Applications 184(11):10-14, May
  2022",10.5120/ijca2022922078,,cs.LG cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Sentiment Analysis is currently a vital area of research. With the
advancement in the use of the internet, the creation of social media, websites,
blogs, opinions, ratings, etc. has increased rapidly. People express their
feedback and emotions on social media posts in the form of likes, dislikes,
comments, etc. The rapid growth in the volume of viewer-generated or
user-generated data or content on YouTube has led to an increase in YouTube
sentiment analysis. Due to this, analyzing the public reactions has become an
essential need for information extraction and data visualization in the
technical domain. This research predicts YouTube Ad view sentiments using Deep
Learning and Machine Learning algorithms like Linear Regression (LR), Support
Vector Machine (SVM), Decision Tree (DT), Random Forest (RF), and Artificial
Neural Network (ANN). Finally, a comparative analysis is done based on
experimental results acquired from different models.
","[{'version': 'v1', 'created': 'Mon, 23 May 2022 06:55:34 GMT'}]",2022-05-24,"[['Mehta', 'Tanvi', ''], ['Deshmukh', 'Ganesh', '']]","['Sentiment analysis', 'Machine Learning', 'Deep Learning', 'Social networks', 'Ad views analysis', 'Support Vector Machine (SVM)', 'Artificial Neural Network (ANN)']"
13121,2210.09739,Simon Bultmann,"Simon Bultmann, Jan Quenzel, Sven Behnke","Real-Time Multi-Modal Semantic Fusion on Unmanned Aerial Vehicles with
  Label Propagation for Cross-Domain Adaptation","35 pages, 18 figures, Accepted for Robotics and Autonomous Systems,
  Elsevier. arXiv admin note: substantial text overlap with arXiv:2108.06608",,10.1016/j.robot.2022.104286,,cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Unmanned aerial vehicles (UAVs) equipped with multiple complementary sensors
have tremendous potential for fast autonomous or remote-controlled semantic
scene analysis, e.g., for disaster examination. Here, we propose a UAV system
for real-time semantic inference and fusion of multiple sensor modalities.
Semantic segmentation of LiDAR scans and RGB images, as well as object
detection on RGB and thermal images, run online onboard the UAV computer using
lightweight CNN architectures and embedded inference accelerators. We follow a
late fusion approach where semantic information from multiple sensor modalities
augments 3D point clouds and image segmentation masks while also generating an
allocentric semantic map. Label propagation on the semantic map allows for
sensor-specific adaptation with cross-modality and cross-domain supervision.
Our system provides augmented semantic images and point clouds with $\approx$ 9
Hz. We evaluate the integrated system in real-world experiments in an urban
environment and at a disaster test site.
","[{'version': 'v1', 'created': 'Tue, 18 Oct 2022 10:32:11 GMT'}]",2022-10-19,"[['Bultmann', 'Simon', ''], ['Quenzel', 'Jan', ''], ['Behnke', 'Sven', '']]","['robot perception', 'sensor fusion', 'unmanned aerial vehicles', 'semanticsegmentation', 'label propagation', 'object detection', 'deep learning']"
13122,2003.10735,Jae-Won Chung,"Jae-Won Chung, Jae-Yun Kim, Soo-Mook Moon","ShadowTutor: Distributed Partial Distillation for Mobile Video DNN
  Inference",Accepted at ICPP 2020,,10.1145/3404397.3404404,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Following the recent success of deep neural networks (DNN) on video computer
vision tasks, performing DNN inferences on videos that originate from mobile
devices has gained practical significance. As such, previous approaches
developed methods to offload DNN inference computations for images to cloud
servers to manage the resource constraints of mobile devices. However, when it
comes to video data, communicating information of every frame consumes
excessive network bandwidth and renders the entire system susceptible to
adverse network conditions such as congestion. Thus, in this work, we seek to
exploit the temporal coherence between nearby frames of a video stream to
mitigate network pressure. That is, we propose ShadowTutor, a distributed video
DNN inference framework that reduces the number of network transmissions
through intermittent knowledge distillation to a student model. Moreover, we
update only a subset of the student's parameters, which we call partial
distillation, to reduce the data size of each network transmission.
Specifically, the server runs a large and general teacher model, and the mobile
device only runs an extremely small but specialized student model. On sparsely
selected key frames, the server partially trains the student model by targeting
the teacher's response and sends the updated part to the mobile device. We
investigate the effectiveness of ShadowTutor with HD video semantic
segmentation. Evaluations show that network data transfer is reduced by 95% on
average. Moreover, the throughput of the system is improved by over three times
and shows robustness to changes in network bandwidth.
","[{'version': 'v1', 'created': 'Tue, 24 Mar 2020 09:50:38 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Jun 2020 06:39:06 GMT'}]",2020-06-08,"[['Chung', 'Jae-Won', ''], ['Kim', 'Jae-Yun', ''], ['Moon', 'Soo-Mook', '']]","['Deep neural networks', 'distributed inference', 'knowledge distillation', 'video semantic segmentation']"
13123,2112.10165,Nusrat Zahan,"Nusrat Zahan, Thomas Zimmermann, Patrice Godefroid, Brendan Murphy,
  Chandra Maddila, Laurie Williams",What are Weak Links in the npm Supply Chain?,"(e.g.: 10 pages, 1 figure)",,10.1145/3510457.3513044,,cs.CR cs.CY cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern software development frequently uses third-party packages, raising the
concern of supply chain security attacks. Many attackers target popular package
managers, like npm, and their users with supply chain attacks. In 2021 there
was a 650% year-on-year growth in security attacks by exploiting Open Source
Software's supply chain. Proactive approaches are needed to predict package
vulnerability to high-risk supply chain attacks. The goal of this work is to
help software developers and security specialists in measuring npm supply chain
weak link signals to prevent future supply chain attacks by empirically
studying npm package metadata.
  In this paper, we analyzed the metadata of 1.63 million JavaScript npm
packages. We propose six signals of security weaknesses in a software supply
chain, such as the presence of install scripts, maintainer accounts associated
with an expired email domain, and inactive packages with inactive maintainers.
One of our case studies identified 11 malicious packages from the install
scripts signal. We also found 2,818 maintainer email addresses associated with
expired domains, allowing an attacker to hijack 8,494 packages by taking over
the npm accounts. We obtained feedback on our weak link signals through a
survey responded to by 470 npm package developers. The majority of the
developers supported three out of our six proposed weak link signals. The
developers also indicated that they would want to be notified about weak links
signals before using third-party packages. Additionally, we discussed eight new
signals suggested by package developers.
","[{'version': 'v1', 'created': 'Sun, 19 Dec 2021 15:06:31 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Feb 2022 14:36:17 GMT'}]",2022-02-15,"[['Zahan', 'Nusrat', ''], ['Zimmermann', 'Thomas', ''], ['Godefroid', 'Patrice', ''], ['Murphy', 'Brendan', ''], ['Maddila', 'Chandra', ''], ['Williams', 'Laurie', '']]","['Software Ecosystem', 'Supply Chain Security', 'npm', 'Weak link Signal']"
13124,2109.09172,Arion Pons,Arion Pons and Tsevi Beatus,"Conditions for energetically-optimal elasticity and their implications
  for biomimetic propulsion systems","42 pages, 5 figures","Nonlinear Dynamics 108, 2022",10.1007/s11071-022-07325-6,,cs.RO physics.app-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Minimising the energy consumption associated with periodic motion is a
priority common to a wide range of technologies and organisms - among them,
many species of flying insect, for which flapping-wing flight is a
life-essential mode of locomotion. In pursuit of this priority, the following
problem often manifests: how to introduce elasticity into an actuated,
oscillating, system in order to minimise actuator power consumption? Here, we
explore this question in a range of general systems, and find some surprising
answers. For instance, it is widely assumed that, if the system dynamics are
linear, then linear resonant elasticity is the only optimal choice. We show, to
the contrary, that there exist nonlinear elasticities with equivalent
optimality, and provide an elegant method for constructing these elasticities
in general systems. This is a new principle of linear and nonlinear dynamics,
fundamentally altering how questions of energetic optimality in a wide range of
dynamical systems must be approached. Furthermore, we show how this principle
enables new forms of optimal system design, including optimal unidirectional
actuation in nonlinear systems; new tools for the design of optimal biomimetic
propulsion systems; and new insights into the role of structural elasticity in
a range of different organisms.
","[{'version': 'v1', 'created': 'Sun, 19 Sep 2021 17:24:53 GMT'}]",2022-06-22,"[['Pons', 'Arion', ''], ['Beatus', 'Tsevi', '']]","['global resonance', 'energetic optimality', 'inverse problem', 'nonlinear dynamics', 'biomimetic propulsion', 'flapping-wing flight']"
13125,2209.08337,Yuxi Cai,"Yuxi Cai, Huicheng Lai, Zhenghong Jia","Lightweight Spatial-Channel Adaptive Coordination of Multilevel
  Refinement Enhancement Network for Image Reconstruction",,,10.1016/j.knosys.2022.109824,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Benefiting from the vigorous development of deep learning, many CNN-based
image super-resolution methods have emerged and achieved better results than
traditional algorithms. However, it is difficult for most algorithms to
adaptively adjust the spatial region and channel features at the same time, let
alone the information exchange between them. In addition, the exchange of
information between attention modules is even less visible to researchers. To
solve these problems, we put forward a lightweight spatial-channel adaptive
coordination of multilevel refinement enhancement networks(MREN). Specifically,
we construct a space-channel adaptive coordination block, which enables the
network to learn the spatial region and channel feature information of interest
under different receptive fields. In addition, the information of the
corresponding feature processing level between the spatial part and the channel
part is exchanged with the help of jump connection to achieve the coordination
between the two. We establish a communication bridge between attention modules
through a simple linear combination operation, so as to more accurately and
continuously guide the network to pay attention to the information of interest.
Extensive experiments on several standard test sets have shown that our MREN
achieves superior performance over other advanced algorithms with a very small
number of parameters and very low computational complexity.
","[{'version': 'v1', 'created': 'Sat, 17 Sep 2022 14:15:42 GMT'}]",2022-09-20,"[['Cai', 'Yuxi', ''], ['Lai', 'Huicheng', ''], ['Jia', 'Zhenghong', '']]","['super-resolution reconstruction', 'lightweight', 'spatial-channel adaptive', 'attentioncommunication']"
13126,1910.05300,Bla\v{z} \v{S}krlj,Bla\v{z} \v{S}krlj and Benjamin Renoust,"Patterns of Multiplex Layer Entanglement across Real and Synthetic
  Networks",Accepted at Complex Networks 2019,Complex Networks 2019,10.1007/978-3-030-36683-4_54,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real world complex networks often exhibit multiplex structure, connecting
entities from different aspects of physical systems such as social,
transportation and biological networks. Little is known about general
properties of such networks across disciplines. In this work, we first
investigate how consistent are connectivity patterns across 35 real world
multiplex networks. We demonstrate that entanglement homogeneity and intensity,
two measures of layer consistency, indicate apparent differences between social
and biological networks. We also investigate trade, co-authorship and transport
networks. We show that real networks can be separated in the joint space of
homogeneity and intensity, demonstrating the usefulness of the two measures for
categorization of real multiplex networks. Finally, we design a multiplex
network generator, where similar patterns (as observed in real networks), are
emerging over the analysis of 11{,}905 synthetic multiplex networks with
various topological properties.
","[{'version': 'v1', 'created': 'Fri, 11 Oct 2019 16:50:33 GMT'}]",2019-11-28,"[['Škrlj', 'Blaž', ''], ['Renoust', 'Benjamin', '']]","['Multiplex networks', 'edge entanglement', 'network topology', 'networkgenerator']"
13127,2202.12205,Kyle Hamilton,"Kyle Hamilton, Aparna Nayak, Bojan Bo\v{z}i\'c, Luca Longo","Is Neuro-Symbolic AI Meeting its Promise in Natural Language Processing?
  A Structured Review",Survey,"Semantic Web, vol. Pre-press, no. Pre-press, pp. 1-42, 2022",10.3233/SW-223228,,cs.AI cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advocates for Neuro-Symbolic Artificial Intelligence (NeSy) assert that
combining deep learning with symbolic reasoning will lead to stronger AI than
either paradigm on its own. As successful as deep learning has been, it is
generally accepted that even our best deep learning systems are not very good
at abstract reasoning. And since reasoning is inextricably linked to language,
it makes intuitive sense that Natural Language Processing (NLP), would be a
particularly well-suited candidate for NeSy. We conduct a structured review of
studies implementing NeSy for NLP, with the aim of answering the question of
whether NeSy is indeed meeting its promises: reasoning, out-of-distribution
generalization, interpretability, learning and reasoning from small data, and
transferability to new domains. We examine the impact of knowledge
representation, such as rules and semantic networks, language structure and
relational structure, and whether implicit or explicit reasoning contributes to
higher promise scores. We find that systems where logic is compiled into the
neural network lead to the most NeSy goals being satisfied, while other factors
such as knowledge representation, or type of neural architecture do not exhibit
a clear correlation with goals being met. We find many discrepancies in how
reasoning is defined, specifically in relation to human level reasoning, which
impact decisions about model architectures and drive conclusions which are not
always consistent across studies. Hence we advocate for a more methodical
approach to the application of theories of human reasoning as well as the
development of appropriate benchmarks, which we hope can lead to a better
understanding of progress in the field. We make our data and code available on
github for further analysis.
","[{'version': 'v1', 'created': 'Thu, 24 Feb 2022 17:13:33 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Jun 2022 16:07:36 GMT'}]",2022-12-16,"[['Hamilton', 'Kyle', ''], ['Nayak', 'Aparna', ''], ['Božić', 'Bojan', ''], ['Longo', 'Luca', '']]","['Neuro-Symbolic Artificial Intelligence', 'Natural Language Processing', 'Deep Learning', 'Knowledge Representation &Reasoning', 'Structured Review']"
13128,2107.01507,Anish Bhattacharya,"Anish Bhattacharya, Akshit Gandhi, Lukas Merkle, Rohan Tiwari, Karun
  Warrior, Stanley Winata, Andrew Saba, Kevin Zhang, Oliver Kroemer, Sebastian
  Scherer","Mission-level Robustness with Rapidly-deployed, Autonomous Aerial
  Vehicles by Carnegie Mellon Team Tartan at MBZIRC 2020","29 pages, 26 figures. Published in Field Robotics, Special Issue on
  MBZIRC 2020","Field Robotics, 2, 172-200 (2022)",10.55417/fr.2022007,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For robotic systems to succeed in high risk, real-world situations, they have
to be quickly deployable and robust to environmental changes, under-performing
hardware, and mission subtask failures. These robots are often designed to
consider a single sequence of mission events, with complex algorithms lowering
individual subtask failure rates under some critical constraints. Our approach
utilizes common techniques in vision and control, and encodes robustness into
mission structure through outcome monitoring and recovery strategies. In
addition, our system infrastructure enables rapid deployment and requires no
central communication. This report also includes lessons in rapid field robotic
development and testing. We developed and evaluated our systems through
real-robot experiments at an outdoor test site in Pittsburgh, Pennsylvania,
USA, as well as in the 2020 Mohamed Bin Zayed International Robotics Challenge.
All competition trials were completed in fully autonomous mode without RTK-GPS.
Our system placed fourth in Challenge 2 and seventh in the Grand Challenge,
with notable achievements such as popping five balloons (Challenge 1),
successfully picking and placing a block (Challenge 2), and dispensing the most
water onto an outdoor, real fire with an autonomous UAV (Challenge 3).
","[{'version': 'v1', 'created': 'Sat, 3 Jul 2021 23:05:16 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Sep 2022 18:50:03 GMT'}]",2022-09-15,"[['Bhattacharya', 'Anish', ''], ['Gandhi', 'Akshit', ''], ['Merkle', 'Lukas', ''], ['Tiwari', 'Rohan', ''], ['Warrior', 'Karun', ''], ['Winata', 'Stanley', ''], ['Saba', 'Andrew', ''], ['Zhang', 'Kevin', ''], ['Kroemer', 'Oliver', ''], ['Scherer', 'Sebastian', '']]","['aerial robotics', 'construction', 'visual servoing', 'MBZIRC']"
13129,2005.06688,Daniel Schemmel,"Daniel Schemmel, Julian B\""uning, C\'esar Rodr\'iguez, David Laprell,
  Klaus Wehrle",Symbolic Partial-Order Execution for Testing Multi-Threaded Programs,Extended version of a paper presented at CAV'20,,10.1007/978-3-030-53288-8_18,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a technique for systematic testing of multi-threaded programs. We
combine Quasi-Optimal Partial-Order Reduction, a state-of-the-art technique
that tackles path explosion due to interleaving non-determinism, with symbolic
execution to handle data non-determinism. Our technique iteratively and
exhaustively finds all executions of the program. It represents program
executions using partial orders and finds the next execution using an
underlying unfolding semantics. We avoid the exploration of redundant program
traces using cutoff events. We implemented our technique as an extension of
KLEE and evaluated it on a set of large multi-threaded C programs. Our
experiments found several previously undiscovered bugs and undefined behaviors
in memcached and GNU sort, showing that the new method is capable of finding
bugs in industrial-size benchmarks.
","[{'version': 'v1', 'created': 'Thu, 14 May 2020 02:08:18 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Jul 2020 17:14:00 GMT'}]",2020-07-23,"[['Schemmel', 'Daniel', ''], ['Büning', 'Julian', ''], ['Rodríguez', 'César', ''], ['Laprell', 'David', ''], ['Wehrle', 'Klaus', '']]","['Software Testing', 'Symbolic Execution', 'Partial-Order Reduction']"
13130,2208.08671,Stephen Meisenbacher,"Oleksandra Klymenko, Oleksandr Kosenkov, Stephen Meisenbacher, Parisa
  Elahidoost, Daniel Mendez, Florian Matthes","Understanding the Implementation of Technical Measures in the Process of
  Data Privacy Compliance: A Qualitative Study","The 16th ACM/IEEE International Symposium on Empirical Software
  Engineering and Measurement (ESEM)",,10.1145/3544902.3546234,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Modern privacy regulations, such as the General Data Protection Regulation
(GDPR), address privacy in software systems in a technologically agnostic way
by mentioning general ""technical measures"" for data privacy compliance rather
than dictating how these should be implemented. An understanding of the concept
of technical measures and how exactly these can be handled in practice,
however, is not trivial due to its interdisciplinary nature and the necessary
technical-legal interactions. We aim to investigate how the concept of
technical measures for data privacy compliance is understood in practice as
well as the technical-legal interaction intrinsic to the process of
implementing those technical measures. We follow a research design that is 1)
exploratory in nature, 2) qualitative, and 3) interview-based, with 16 selected
privacy professionals in the technical and legal domains. Our results suggest
that there is no clear mutual understanding and commonly accepted approach to
handling technical measures. Both technical and legal roles are involved in the
implementation of such measures. While they still often operate in separate
spheres, a predominant opinion amongst the interviewees is to promote more
interdisciplinary collaboration. Our empirical findings confirm the need for
better interaction between legal and engineering teams when implementing
technical measures for data privacy. We posit that interdisciplinary
collaboration is paramount to a more complete understanding of technical
measures, which currently lacks a mutually accepted notion. Yet, as strongly
suggested by our results, there is still a lack of systematic approaches to
such interaction. Therefore, the results strengthen our confidence in the need
for further investigations into the technical-legal dynamic of data privacy
compliance.
","[{'version': 'v1', 'created': 'Thu, 18 Aug 2022 07:09:28 GMT'}]",2022-08-19,"[['Klymenko', 'Oleksandra', ''], ['Kosenkov', 'Oleksandr', ''], ['Meisenbacher', 'Stephen', ''], ['Elahidoost', 'Parisa', ''], ['Mendez', 'Daniel', ''], ['Matthes', 'Florian', '']]","['data privacy', 'privacy compliance', 'GDPR', 'technical measures']"
13131,cs/0607133,Peter Turney,"Robert Ewaschuk, Peter D. Turney",Self-Replication and Self-Assembly for Manufacturing,Java code available at http://purl.org/net/johnnyvon/,"Artificial Life, (2006), 12, 411-433",10.1162/artl.2006.12.3.411,NRC-48760,cs.MA cs.CE,,"  It has been argued that a central objective of nanotechnology is to make
products inexpensively, and that self-replication is an effective approach to
very low-cost manufacturing. The research presented here is intended to be a
step towards this vision. We describe a computational simulation of nanoscale
machines floating in a virtual liquid. The machines can bond together to form
strands (chains) that self-replicate and self-assemble into user-specified
meshes. There are four types of machines and the sequence of machine types in a
strand determines the shape of the mesh they will build. A strand may be in an
unfolded state, in which the bonds are straight, or in a folded state, in which
the bond angles depend on the types of machines. By choosing the sequence of
machine types in a strand, the user can specify a variety of polygonal shapes.
A simulation typically begins with an initial unfolded seed strand in a soup of
unbonded machines. The seed strand replicates by bonding with free machines in
the soup. The child strands fold into the encoded polygonal shape, and then the
polygons drift together and bond to form a mesh. We demonstrate that a variety
of polygonal meshes can be manufactured in the simulation, by simply changing
the sequence of machine types in the seed.
","[{'version': 'v1', 'created': 'Thu, 27 Jul 2006 17:55:16 GMT'}]",2020-08-20,"[['Ewaschuk', 'Robert', ''], ['Turney', 'Peter D.', '']]","['self-replication', 'self-assembly', 'nanotechnology', 'virtual physics', 'continuous']"
13132,2107.12636,Wen Wang,"Wen Wang, Yang Cao, Jing Zhang, Fengxiang He, Zheng-Jun Zha, Yonggang
  Wen, Dacheng Tao","Exploring Sequence Feature Alignment for Domain Adaptive Detection
  Transformers",Fix a typo in Eq. 13,,10.1145/3474085.3475317,,cs.CV cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Detection transformers have recently shown promising object detection results
and attracted increasing attention. However, how to develop effective domain
adaptation techniques to improve its cross-domain performance remains
unexplored and unclear. In this paper, we delve into this topic and empirically
find that direct feature distribution alignment on the CNN backbone only brings
limited improvements, as it does not guarantee domain-invariant sequence
features in the transformer for prediction. To address this issue, we propose a
novel Sequence Feature Alignment (SFA) method that is specially designed for
the adaptation of detection transformers. Technically, SFA consists of a domain
query-based feature alignment (DQFA) module and a token-wise feature alignment
(TDA) module. In DQFA, a novel domain query is used to aggregate and align
global context from the token sequence of both domains. DQFA reduces the domain
discrepancy in global feature representations and object relations when
deploying in the transformer encoder and decoder, respectively. Meanwhile, TDA
aligns token features in the sequence from both domains, which reduces the
domain gaps in local and instance-level feature representations in the
transformer encoder and decoder, respectively. Besides, a novel bipartite
matching consistency loss is proposed to enhance the feature discriminability
for robust object detection. Experiments on three challenging benchmarks show
that SFA outperforms state-of-the-art domain adaptive object detection methods.
Code has been made available at: https://github.com/encounter1997/SFA.
","[{'version': 'v1', 'created': 'Tue, 27 Jul 2021 07:17:12 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Aug 2021 10:54:59 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Jul 2022 02:15:21 GMT'}, {'version': 'v4', 'created': 'Fri, 15 Jul 2022 07:01:47 GMT'}]",2022-07-18,"[['Wang', 'Wen', ''], ['Cao', 'Yang', ''], ['Zhang', 'Jing', ''], ['He', 'Fengxiang', ''], ['Zha', 'Zheng-Jun', ''], ['Wen', 'Yonggang', ''], ['Tao', 'Dacheng', '']]","['Object Detection', 'Detection Transformer', 'Domain Adaptation', 'Feature Alignment', 'Matching Consistency']"
13133,2104.09455,Jack Kosaian,"Jack Kosaian, K. V. Rashmi","Arithmetic-Intensity-Guided Fault Tolerance for Neural Network Inference
  on GPUs","Appeared in The International Conference for High Performance
  Computing, Networking, Storage and Analysis (SC '21), November 14--19, 2021,
  St. Louis, MO, USA",,10.1145/3458817.3476184,,cs.DC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural networks (NNs) are increasingly employed in safety-critical domains
and in environments prone to unreliability (e.g., soft errors), such as on
spacecraft. Therefore, it is critical to impart fault tolerance to NN
inference. Algorithm-based fault tolerance (ABFT) is emerging as an efficient
approach for fault tolerance in NNs.
  We propose an adaptive approach to ABFT for NN inference that exploits
untapped opportunities in emerging deployment scenarios. GPUs have high
compute-to-memory-bandwidth ratios, while NN layers have a wide range of
arithmetic intensities. This leaves some layers compute bound and others
memory-bandwidth bound, but current approaches to ABFT do not consider these
differences. We first investigate ABFT schemes best suited for each of these
scenarios. We then propose intensity-guided ABFT, an adaptive,
arithmetic-intensity-guided approach that selects the most efficient ABFT
scheme for each NN layer. Intensity-guided ABFT reduces execution-time overhead
by 1.09--5.3$\times$ across many NNs compared to traditional approaches to
ABFT.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2021 17:13:04 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Dec 2021 14:25:00 GMT'}]",2021-12-08,"[['Kosaian', 'Jack', ''], ['Rashmi', 'K. V.', '']]","['fault tolerance', 'neural networks', 'arithmetic intensity']"
13134,2010.13096,Yong Kiam Tan,Yong Kiam Tan and Andr\'e Platzer,Deductive Stability Proofs for Ordinary Differential Equations,"Long version of paper at TACAS 2021 (27th International Conference on
  Tools and Algorithms for the Construction and Analysis of Systems, 27 Mar - 1
  Apr 2021)",,10.1007/978-3-030-72013-1_10,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stability is required for real world controlled systems as it ensures that
those systems can tolerate small, real world perturbations around their desired
operating states. This paper shows how stability for continuous systems modeled
by ordinary differential equations (ODEs) can be formally verified in
differential dynamic logic (dL). The key insight is to specify ODE stability by
suitably nesting the dynamic modalities of dL with first-order logic
quantifiers. Elucidating the logical structure of stability properties in this
way has three key benefits: i) it provides a flexible means of formally
specifying various stability properties of interest, ii) it yields rigorous
proofs of those stability properties from dL's axioms with dL's ODE safety and
liveness proof principles, and iii) it enables formal analysis of the
relationships between various stability properties which, in turn, inform
proofs of those properties. These benefits are put into practice through an
implementation of stability proofs for several examples in KeYmaera X, a hybrid
systems theorem prover based on dL.
","[{'version': 'v1', 'created': 'Sun, 25 Oct 2020 11:36:38 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Feb 2021 16:37:56 GMT'}, {'version': 'v3', 'created': 'Fri, 23 Apr 2021 14:57:04 GMT'}, {'version': 'v4', 'created': 'Wed, 23 Feb 2022 19:51:43 GMT'}]",2022-02-25,"[['Tan', 'Yong Kiam', ''], ['Platzer', 'André', '']]","['differential equations', 'stability', 'differential dynamic logic']"
13135,2202.07146,Philippe Laban,"Philippe Laban and Elicia Ye and Srujay Korlakunta and John Canny and
  Marti A. Hearst",NewsPod: Automatic and Interactive News Podcasts,"Accepted at IUI 2022, 16 pages, 10 figures",,10.1145/3490099.3511147,,cs.HC cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  News podcasts are a popular medium to stay informed and dive deep into news
topics. Today, most podcasts are handcrafted by professionals. In this work, we
advance the state-of-the-art in automatically generated podcasts, making use of
recent advances in natural language processing and text-to-speech technology.
We present NewsPod, an automatically generated, interactive news podcast. The
podcast is divided into segments, each centered on a news event, with each
segment structured as a Question and Answer conversation, whose goal is to
engage the listener. A key aspect of the design is the use of distinct voices
for each role (questioner, responder), to better simulate a conversation.
Another novel aspect of NewsPod allows listeners to interact with the podcast
by asking their own questions and receiving automatically generated answers. We
validate the soundness of this system design through two usability studies,
focused on evaluating the narrative style and interactions with the podcast,
respectively. We find that NewsPod is preferred over a baseline by
participants, with 80% claiming they would use the system in the future.
","[{'version': 'v1', 'created': 'Tue, 15 Feb 2022 02:37:04 GMT'}]",2022-02-16,"[['Laban', 'Philippe', ''], ['Ye', 'Elicia', ''], ['Korlakunta', 'Srujay', ''], ['Canny', 'John', ''], ['Hearst', 'Marti A.', '']]","['podcast', 'interactive podcast', 'automatic podcast', 'news podcast', 'conversational', 'summarization', 'question answering', 'question generation']"
13136,2202.12510,Shengyao Zhuang,Shengyao Zhuang and Guido Zuccon,"Asyncval: A Toolkit for Asynchronously Validating Dense Retriever
  Checkpoints during Training","Demo paper, accepted at SIGIR2022",,10.1145/3477495.3531658,,cs.IR cs.CL,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  The process of model checkpoint validation refers to the evaluation of the
performance of a model checkpoint executed on a held-out portion of the
training data while learning the hyperparameters of the model, and is used to
avoid over-fitting and determine when the model has converged so as to stop
training. A simple and efficient strategy to validate deep learning checkpoints
is the addition of validation loops to execute during training. However, the
validation of dense retrievers (DR) checkpoints is not as trivial -- and the
addition of validation loops is not efficient. This is because, in order to
accurately evaluate the performance of a DR checkpoint, the whole document
corpus needs to be encoded into vectors using the current checkpoint before any
actual retrieval operation for checkpoint validation can be performed. This
corpus encoding process can be very time-consuming if the document corpus
contains millions of documents (e.g., 8.8m for MS MARCO and 21m for Natural
Questions). Thus, a naive use of validation loops during training will
significantly increase training time. To address this issue, in this demo
paper, we propose Asyncval: a Python-based toolkit for efficiently validating
DR checkpoints during training. Instead of pausing the training loop for
validating DR checkpoints, Asyncval decouples the validation loop from the
training loop, uses another GPU to automatically validate new DR checkpoints
and thus permits to perform validation asynchronously from training. Asyncval
also implements a range of different corpus subset sampling strategies for
validating DR checkpoints; these strategies allow to further speed up the
validation process. We provide an investigation of these methods in terms of
their impact on validation time and validation fidelity. Asyncval is made
available as an open-source project at https://github.com/ielab/asyncval.
","[{'version': 'v1', 'created': 'Fri, 25 Feb 2022 06:07:58 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Apr 2022 01:41:20 GMT'}]",2022-04-28,"[['Zhuang', 'Shengyao', ''], ['Zuccon', 'Guido', '']]","['dense retriever', 'checkpoints validation', 'neural information retrieval']"
13137,1507.01451,"Peter Sch\""uller","Thomas Eiter, Michael Fink, Giovambattista Ianni, Thomas Krennwallner,
  Christoph Redl, Peter Sch\""uller","A model building framework for Answer Set Programming with external
  computations","57 pages, 9 figures, 3 tables, 6 algorithms, to appear in Theory and
  Practice of Logic Programming (accepted in June 2015)",Theory and Practice of Logic Programming 16 (2016) 418-464,10.1017/S1471068415000113,,cs.AI cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As software systems are getting increasingly connected, there is a need for
equipping nonmonotonic logic programs with access to external sources that are
possibly remote and may contain information in heterogeneous formats. To cater
for this need, HEX programs were designed as a generalization of answer set
programs with an API style interface that allows to access arbitrary external
sources, providing great flexibility. Efficient evaluation of such programs
however is challenging, and it requires to interleave external computation and
model building; to decide when to switch between these tasks is difficult, and
existing approaches have limited scalability in many real-world application
scenarios. We present a new approach for the evaluation of logic programs with
external source access, which is based on a configurable framework for dividing
the non-ground program into possibly overlapping smaller parts called
evaluation units. The latter will be processed by interleaving external
evaluation and model building using an evaluation graph and a model graph,
respectively, and by combining intermediate results. Experiments with our
prototype implementation show a significant improvement compared to previous
approaches. While designed for HEX-programs, the new evaluation approach may be
deployed to related rule-based formalisms as well.
","[{'version': 'v1', 'created': 'Mon, 6 Jul 2015 13:31:39 GMT'}, {'version': 'v2', 'created': 'Sat, 11 Jul 2015 22:20:15 GMT'}]",2020-02-19,"[['Eiter', 'Thomas', ''], ['Fink', 'Michael', ''], ['Ianni', 'Giovambattista', ''], ['Krennwallner', 'Thomas', ''], ['Redl', 'Christoph', ''], ['Schüller', 'Peter', '']]","['Answer Set Programming', 'Model Building', 'External Computation', 'HEX Programs']"
13138,2210.08316,Animesh Chaturvedi Dr.,Animesh Chaturvedi,"Call Graph Evolution Analytics over a Version Series of an Evolving
  Software System",,,10.1145/3551349.3559573,,cs.SE cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Call Graph evolution analytics can aid a software engineer when maintaining
or evolving a software system. This paper proposes Call Graph Evolution
Analytics to extract information from an evolving call graph ECG = CG_1,
CG_2,... CG_N for their version series VS = V_1, V_2, ... V_N of an evolving
software system. This is done using Call Graph Evolution Rules (CGERs) and Call
Graph Evolution Subgraphs (CGESs). Similar to association rule mining, the
CGERs are used to capture co-occurrences of dependencies in the system. Like
subgraph patterns in a call graph, the CGESs are used to capture evolution of
dependency patterns in evolving call graphs. Call graph analytics on the
evolution in these patterns can identify potentially affected dependencies (or
procedure calls) that need attention. The experiments are done on the evolving
call graphs of 10 large evolving systems to support dependency evolution
management. We also consider results from a detailed study for evolving call
graphs of Maven-Core's version series.
","[{'version': 'v1', 'created': 'Sat, 15 Oct 2022 15:12:20 GMT'}]",2022-10-31,"[['Chaturvedi', 'Animesh', '']]","['Software evolution', 'Graphs', 'Software repository', 'Data Mining']"
13139,1908.09125,Sara Giuliani,"Sara Giuliani, Zsuzsanna Lipt\'ak, Francesco Masillo, Romeo Rizzi",When a Dollar Makes a BWT,"This is the journal version of paper at ICTCS 2019 (20th Italian
  Conference on Theoretical Computer Science, 9-11 Sept. 2019, Como, Italy).
  Journal version appeared in TCS 2021",Theoretical Computer Science 857: 123-146 (2021),10.1016/j.tcs.2021.01.008,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Burrows-Wheeler-Transform (BWT) is a reversible string transformation
which plays a central role in text compression and is fundamental in many
modern bioinformatics applications. The BWT is a permutation of the characters,
which is in general better compressible and allows to answer several different
query types more efficiently than the original string.
  It is easy to see that not every string is a BWT image, and exact
characterizations of BWT images are known. We investigate a related
combinatorial question. In many applications, a sentinel character dollar is
added to mark the end of the string, and thus the BWT of a string ending with
dollar contains exactly one dollar-character. Given a string w, we ask in which
positions, if any, the dollar-character can be inserted to turn w into the BWT
image of a word ending with dollar. We show that this depends only on the
standard permutation of w and present a O(n log n)-time algorithm for
identifying all such positions, improving on the naive quadratic time
algorithm. We also give a combinatorial characterization of such positions and
develop bounds on their number and value. This is an extended version of
[Giuliani et al. ICTCS 2019].
","[{'version': 'v1', 'created': 'Sat, 24 Aug 2019 11:26:37 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Mar 2020 10:00:03 GMT'}, {'version': 'v3', 'created': 'Fri, 12 Mar 2021 17:46:21 GMT'}]",2021-03-15,"[['Giuliani', 'Sara', ''], ['Lipták', 'Zsuzsanna', ''], ['Masillo', 'Francesco', ''], ['Rizzi', 'Romeo', '']]","['combinatorics on words', 'Burrows-Wheeler-Transform', 'permutations', 'splay trees', 'efficient algorithms']"
13140,1905.07854,Xiang Wang,"Xiang Wang, Xiangnan He, Yixin Cao, Meng Liu, Tat-Seng Chua",KGAT: Knowledge Graph Attention Network for Recommendation,KDD 2019 research track,,10.1145/3292500.3330989,,cs.LG cs.IR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To provide more accurate, diverse, and explainable recommendation, it is
compulsory to go beyond modeling user-item interactions and take side
information into account. Traditional methods like factorization machine (FM)
cast it as a supervised learning problem, which assumes each interaction as an
independent instance with side information encoded. Due to the overlook of the
relations among instances or items (e.g., the director of a movie is also an
actor of another movie), these methods are insufficient to distill the
collaborative signal from the collective behaviors of users. In this work, we
investigate the utility of knowledge graph (KG), which breaks down the
independent interaction assumption by linking items with their attributes. We
argue that in such a hybrid structure of KG and user-item graph, high-order
relations --- which connect two items with one or multiple linked attributes
--- are an essential factor for successful recommendation. We propose a new
method named Knowledge Graph Attention Network (KGAT) which explicitly models
the high-order connectivities in KG in an end-to-end fashion. It recursively
propagates the embeddings from a node's neighbors (which can be users, items,
or attributes) to refine the node's embedding, and employs an attention
mechanism to discriminate the importance of the neighbors. Our KGAT is
conceptually advantageous to existing KG-based recommendation methods, which
either exploit high-order relations by extracting paths or implicitly modeling
them with regularization. Empirical results on three public benchmarks show
that KGAT significantly outperforms state-of-the-art methods like Neural FM and
RippleNet. Further studies verify the efficacy of embedding propagation for
high-order relation modeling and the interpretability benefits brought by the
attention mechanism.
","[{'version': 'v1', 'created': 'Mon, 20 May 2019 03:08:11 GMT'}, {'version': 'v2', 'created': 'Sat, 8 Jun 2019 02:49:37 GMT'}]",2019-06-11,"[['Wang', 'Xiang', ''], ['He', 'Xiangnan', ''], ['Cao', 'Yixin', ''], ['Liu', 'Meng', ''], ['Chua', 'Tat-Seng', '']]","['Collaborative Filtering', 'Recommendation', 'Graph Neural Network', 'Higher-order Connectivity', 'Embedding Propagation', 'KnowledgeGraph']"
13141,2109.07252,Julian von Schleinitz,"Julian von Schleinitz, Lukas W\""orle, Michael Graf, Andreas Schr\""oder","Modeling Ice Friction for Vehicle Dynamics of a Bobsled with Application
  in Driver Evaluation and Driving Simulation",Preprint submitted to Tribology International,"Tribology International, Volume 165, January 2022, 107344",10.1016/j.triboint.2021.107344,,cs.HC cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  We provide an ice friction model for vehicle dynamics of a two-man bobsled
which can be used for driver evaluation and in a driver-in-the-loop simulator.
Longitudinal friction is modeled by combining experimental results with finite
element simulations to yield a correlation between contact pressure and
friction. To model lateral friction, we collect data from 44 bobsleigh runs
using special sensors. Non-linear regression is used to fit a bob-specific
one-track vehicle dynamics model to the data. It is applied in driving
simulation and enables a novel method for bob driver evaluation. Bob drivers
with various levels of experience are investigated. It shows that a similar
performance of the top drivers results from different driving styles.
","[{'version': 'v1', 'created': 'Wed, 15 Sep 2021 12:41:10 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Nov 2021 10:16:38 GMT'}]",2021-11-23,"[['von Schleinitz', 'Julian', ''], ['Wörle', 'Lukas', ''], ['Graf', 'Michael', ''], ['Schröder', 'Andreas', '']]","['Ice Friction', 'Bobsleigh', 'Driver Evaluation', 'Vehicle Dynamics']"
13142,2009.14717,Ryoji Tanabe Dr.,Ryoji Tanabe and Hisao Ishibuchi,Non-elitist Evolutionary Multi-objective Optimizers Revisited,"This is an accepted version of a paper published in the proceedings
  of GECCO 2019",,10.1145/3321707.3321754,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since around 2000, it has been considered that elitist evolutionary
multi-objective optimization algorithms (EMOAs) always outperform non-elitist
EMOAs. This paper revisits the performance of non-elitist EMOAs for
bi-objective continuous optimization when using an unbounded external archive.
This paper examines the performance of EMOAs with two elitist and one
non-elitist environmental selections. The performance of EMOAs is evaluated on
the bi-objective BBOB problem suite provided by the COCO platform. In contrast
to conventional wisdom, results show that non-elitist EMOAs with particular
crossover methods perform significantly well on the bi-objective BBOB problems
with many decision variables when using the unbounded external archive. This
paper also analyzes the properties of the non-elitist selection.
","[{'version': 'v1', 'created': 'Wed, 30 Sep 2020 14:52:58 GMT'}]",2020-10-01,"[['Tanabe', 'Ryoji', ''], ['Ishibuchi', 'Hisao', '']]","['Evolutionary multi-objective optimization', 'continuous optimization', 'non-elitist environmental selections']"
13143,2101.06239,Tiantian Chen,"Tiantian Chen, Bin Liu, Wenjing Liu, Qizhi Fang, Jing Yuan and Weili
  Wu","A Random Algorithm for Profit Maximization with Multiple Adoptions in
  Online Social Networks","21 pages, 6 figures","Volume 803, 10 January 2020, Pages 36-47",10.1016/j.tcs.2019.03.028,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online social networks have been one of the most effective platforms for
marketing and advertising. Through ""word of mouth"" effects, information or
product adoption could spread from some influential individuals to millions of
users in social networks. Given a social network $G$ and a constant $k$, the
influence maximization problem seeks for $k$ nodes in $G$ that can influence
the largest number of nodes. This problem has found important applications, and
a large amount of works have been devoted to identifying the few most
influential users. But most of existing works only focus on the diffusion of a
single idea or product in social networks. However, in reality, one company may
produce multiple kinds of products and one user may also have multiple
adoptions.
  Given multiple kinds of different products with different activation costs
and profits, it is crucial for the company to distribute the limited budget
among multiple products in order to achieve profit maximization. Profit
Maximization with Multiple Adoptions (PM$^{2}$A) problem aims to seek for a
seed set within the budget to maximize the overall profit. In this paper, a
Randomized Modified Greedy (RMG) algorithm based on the Reverse Influence
Sampling (RIS) technique is presented for the PM$^{2}$A problem, which could
achieve a $(1-1/e-\varepsilon)$-approximate solution with high probability.
Compared with the algorithm proposed in [16] that achieves a
$\frac{1}{2}(1-1/e^{2})$-approximate solution, our algorithm provides a better
performance ratio which is also the best performance ratio of the PM$^{2}$A
problem. Comprehensive experiments on three real-world social networks are
conducted, and the results demonstrate that our RMG algorithm outperforms the
algorithm proposed in [16] and other heuristics in terms of profit
maximization, and could better allocate the budget.
","[{'version': 'v1', 'created': 'Fri, 15 Jan 2021 17:52:59 GMT'}]",2021-01-18,"[['Chen', 'Tiantian', ''], ['Liu', 'Bin', ''], ['Liu', 'Wenjing', ''], ['Fang', 'Qizhi', ''], ['Yuan', 'Jing', ''], ['Wu', 'Weili', '']]","['Profit maximization', 'Social network', 'Approximation algorithm', 'Sampling']"
13144,2103.14770,Artan Sheshmani,Artan Sheshmani and Yizhuang You,Categorical Representation Learning: Morphism is All You Need,Fixed some typos. 16 pages. Comments are welcome,"Machine Learning: Science and Technology, 3, 2021",10.1088/2632-2153/ac2c5d,015016,cs.LG cond-mat.dis-nn cs.AI math.CT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide a construction for categorical representation learning and
introduce the foundations of ""$\textit{categorifier}$"". The central theme in
representation learning is the idea of $\textbf{everything to vector}$. Every
object in a dataset $\mathcal{S}$ can be represented as a vector in
$\mathbb{R}^n$ by an $\textit{encoding map}$ $E:
\mathcal{O}bj(\mathcal{S})\to\mathbb{R}^n$. More importantly, every morphism
can be represented as a matrix $E:
\mathcal{H}om(\mathcal{S})\to\mathbb{R}^{n}_{n}$. The encoding map $E$ is
generally modeled by a $\textit{deep neural network}$. The goal of
representation learning is to design appropriate tasks on the dataset to train
the encoding map (assuming that an encoding is optimal if it universally
optimizes the performance on various tasks). However, the latter is still a
$\textit{set-theoretic}$ approach. The goal of the current article is to
promote the representation learning to a new level via a
$\textit{category-theoretic}$ approach. As a proof of concept, we provide an
example of a text translator equipped with our technology, showing that our
categorical learning model outperforms the current deep learning models by 17
times. The content of the current article is part of the recent US patent
proposal (patent application number: 63110906).
","[{'version': 'v1', 'created': 'Fri, 26 Mar 2021 23:47:15 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Mar 2021 17:34:05 GMT'}]",2023-01-25,"[['Sheshmani', 'Artan', ''], ['You', 'Yizhuang', '']]","['Category theory', 'Categorical representation learning', 'Natural languageprocessing (NLP)']"
13145,2008.12085,Juan Diego Ortega,"Juan Diego Ortega, Neslihan Kose, Paola Ca\~nas, Min-An Chao,
  Alexander Unnervik, Marcos Nieto, Oihana Otaegui, Luis Salgado","DMD: A Large-Scale Multi-Modal Driver Monitoring Dataset for Attention
  and Alertness Analysis","Accepted to ECCV 2020 workshop - Assistive Computer Vision and
  Robotics",,10.1007/978-3-030-66823-5_23,,cs.CV cs.LG eess.IV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Vision is the richest and most cost-effective technology for Driver
Monitoring Systems (DMS), especially after the recent success of Deep Learning
(DL) methods. The lack of sufficiently large and comprehensive datasets is
currently a bottleneck for the progress of DMS development, crucial for the
transition of automated driving from SAE Level-2 to SAE Level-3. In this paper,
we introduce the Driver Monitoring Dataset (DMD), an extensive dataset which
includes real and simulated driving scenarios: distraction, gaze allocation,
drowsiness, hands-wheel interaction and context data, in 41 hours of RGB, depth
and IR videos from 3 cameras capturing face, body and hands of 37 drivers. A
comparison with existing similar datasets is included, which shows the DMD is
more extensive, diverse, and multi-purpose. The usage of the DMD is illustrated
by extracting a subset of it, the dBehaviourMD dataset, containing 13
distraction activities, prepared to be used in DL training processes.
Furthermore, we propose a robust and real-time driver behaviour recognition
system targeting a real-world application that can run on cost-efficient
CPU-only platforms, based on the dBehaviourMD. Its performance is evaluated
with different types of fusion strategies, which all reach enhanced accuracy
still providing real-time response.
","[{'version': 'v1', 'created': 'Thu, 27 Aug 2020 12:33:54 GMT'}]",2021-04-01,"[['Ortega', 'Juan Diego', ''], ['Kose', 'Neslihan', ''], ['Cañas', 'Paola', ''], ['Chao', 'Min-An', ''], ['Unnervik', 'Alexander', ''], ['Nieto', 'Marcos', ''], ['Otaegui', 'Oihana', ''], ['Salgado', 'Luis', '']]","['driver monitoring dataset', 'driver actions', 'driver behaviourrecognition', 'driver state analysis', 'multi-modal fusion']"
13146,1708.01401,Zheng Li,"Zheng Li and He Zhang and Liam O'Brien and Shu Jiang and You Zhou and
  Maria Kihl and Rajiv Ranjan",Spot Pricing in the Cloud Ecosystem: A Comparative Investigation,,"Journal of Systems and Software, vol. 114, pp. 1-19 (2016)",10.1016/j.jss.2015.10.042,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Spot pricing is considered as a significant supplement for
building a full-fledged market economy for the Cloud ecosystem. However, it
seems that both providers and consumers are still hesitating to enter the Cloud
spot market. The relevant academic community also has conflicting opinions
about Cloud spot pricing in terms of revenue generation. Aim: This work aims to
systematically identify, assess, synthesize and report the published evidence
in favor of or against spot-price scheme compared with fixed-price scheme of
Cloud computing, so as to help relieve the aforementioned conflict. Method: We
employed the systematic literature review (SLR) method to collect and
investigate the empirical studies of Cloud spot pricing indexed by major
electronic libraries. Results: This SLR identified 61 primary studies that
either delivered discussions or conducted experiments to perform comparison
between spot pricing and fixed pricing in the Cloud domain. The reported
benefits and limitations were summarized to facilitate cost-benefit analysis of
being a Cloud spot pricing player, while four types of theories were
distinguished to help both researchers and practitioners better understand the
Cloud spot market. Conclusions: This SLR shows that the academic community
strongly advocates the emerging Cloud spot market. Although there is still a
lack of practical and easily deployable market-driven mechanisms, the overall
findings of our work indicate that spot pricing plays a promising role in the
sustainability of Cloud resource exploitation.
","[{'version': 'v1', 'created': 'Fri, 4 Aug 2017 07:23:05 GMT'}]",2017-08-07,"[['Li', 'Zheng', ''], ['Zhang', 'He', ''], [""O'Brien"", 'Liam', ''], ['Jiang', 'Shu', ''], ['Zhou', 'You', ''], ['Kihl', 'Maria', ''], ['Ranjan', 'Rajiv', '']]","['Cloud Computing', 'Cloud Ecosystem', 'Cloud Spot Pricing', 'Comparative Evidence', 'Systematic Literature Review']"
13147,2202.11789,Colt Deckert,Andrew Colt Deckert and Erich Kummerfeld,Investigating the effect of binning on causal discovery,,"in 2019 IEEE International Conference on Bioinformatics and
  Biomedicine (BIBM), San Diego, CA, USA, 2019 pp. 2574-2581",10.1109/BIBM47256.2019.8983336,,cs.LG,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Binning (a.k.a. discretization) of numerically continuous measurements is a
wide-spread but controversial practice in data collection, analysis, and
presentation. The consequences of binning have been evaluated for many
different kinds of data analysis methods, however so far the effect of binning
on causal discovery algorithms has not been directly investigated. This paper
reports the results of a simulation study that examined the effect of binning
on the Greedy Equivalence Search (GES) causal discovery algorithm. Our findings
suggest that unbinned continuous data often result in the highest search
performance, but some exceptions are identified. We also found that binned data
are more sensitive to changes in sample size and tuning parameters, and
identified some interactive effects between sample size, binning, and tuning
parameter on performance.
","[{'version': 'v1', 'created': 'Wed, 23 Feb 2022 21:15:10 GMT'}]",2022-02-25,"[['Deckert', 'Andrew Colt', ''], ['Kummerfeld', 'Erich', '']]","['G reedy Equivalence Search (GES)', 'Causal Discovery', 'Search Performance', 'Data discretization']"
13148,2101.04974,Fabio Ruggiero,Yousef Farid and Fabio Ruggiero,"Finite-time disturbance reconstruction and robust fractional-order
  controller design for hybrid port-Hamiltonian dynamics of biped robots",,,10.1016/j.robot.2021.103836,,cs.RO,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  In this paper, disturbance reconstruction and robust trajectory tracking
control of biped robots with hybrid dynamics in the port-Hamiltonian form is
investigated. A new type of Hamiltonian function is introduced, which ensures
the finite-time stability of the closed-loop system. The proposed control
system consists of two loops: an inner and an outer loop. A fractional
proportional-integral-derivative filter is used to achieve finite-time
convergence for position tracking errors at the outer loop. A fractional-order
sliding mode controller acts as a centralized controller at the inner-loop,
ensuring the finite-time stability of the velocity tracking error. In this
loop, the undesired effects of unknown external disturbance and parameter
uncertainties are compensated using estimators. Two disturbance estimators are
envisioned. The former is designed using fractional calculus. The latter is an
adaptive estimator, and it is constructed using the general dynamic of biped
robots. Stability analysis shows that the closed-loop system is finite-time
stable in both contact-less and impact phases. Simulation studies on two types
of biped robots (i.e., two-link walker and RABBIT biped robot) demonstrate the
proposed controller's tracking performance and disturbance rejection
capability.
","[{'version': 'v1', 'created': 'Wed, 13 Jan 2021 10:06:58 GMT'}]",2021-10-14,"[['Farid', 'Yousef', ''], ['Ruggiero', 'Fabio', '']]","['Bipedal robots', 'Hybrid systems', 'Port-Hamiltonian dynamics', 'Fractional sliding surface', 'Finite-time control', 'Disturbance estimator']"
13149,2206.08645,Yifeng Zhuang,"Yifeng Zhuang, Qiang Sun, Yanwei Fu, Lifeng Chen, Xiangyang Xue",Local Slot Attention for Vision-and-Language Navigation,ICMR 2022,,10.1145/3512527.3531366,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Vision-and-language navigation (VLN), a frontier study aiming to pave the way
for general-purpose robots, has been a hot topic in the computer vision and
natural language processing community. The VLN task requires an agent to
navigate to a goal location following natural language instructions in
unfamiliar environments.
  Recently, transformer-based models have gained significant improvements on
the VLN task. Since the attention mechanism in the transformer architecture can
better integrate inter- and intra-modal information of vision and language.
  However, there exist two problems in current transformer-based models.
  1) The models process each view independently without taking the integrity of
the objects into account.
  2) During the self-attention operation in the visual modality, the views that
are spatially distant can be inter-weaved with each other without explicit
restriction. This kind of mixing may introduce extra noise instead of useful
information.
  To address these issues, we propose 1) A slot-attention based module to
incorporate information from segmentation of the same object. 2) A local
attention mask mechanism to limit the visual attention span. The proposed
modules can be easily plugged into any VLN architecture and we use the
Recurrent VLN-Bert as our base model. Experiments on the R2R dataset show that
our model has achieved the state-of-the-art results.
","[{'version': 'v1', 'created': 'Fri, 17 Jun 2022 09:21:26 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Jun 2022 02:32:32 GMT'}]",2022-06-23,"[['Zhuang', 'Yifeng', ''], ['Sun', 'Qiang', ''], ['Fu', 'Yanwei', ''], ['Chen', 'Lifeng', ''], ['Xue', 'Xiangyang', '']]","['vision-and-language navigation', 'slot attention', 'local attention']"
13150,1902.03092,Lin Xie,"Lin Xie, Nils Thieme, Ruslan Krenzler, Hanyi Li",Efficient order picking methods in robotic mobile fulfillment systems,,European Journal of Operational Research 2021,10.1016/j.ejor.2020.05.032,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robotic mobile fulfillment systems (RMFSs) are a new type of warehousing
system, which has received more attention recently, due to increasing growth in
the e-commerce sector. Instead of sending pickers to the inventory area to
search for and pick the ordered items, robots carry shelves (called ""pods"")
including ordered items from the inventory area to picking stations. In the
picking stations, human pickers put ordered items into totes; then these items
are transported by a conveyor to the packing stations. This type of warehousing
system relieves the human pickers and improves the picking process. In this
paper, we concentrate on decisions about the assignment of pods to stations and
orders to stations to fulfill picking for each incoming customer's order. In
previous research for an RMFS with multiple picking stations, these decisions
are made sequentially. Instead, we present a new integrated model. To improve
the system performance even more, we extend our model by splitting orders. This
means parts of an order are allowed to be picked at different stations. To the
best of the authors' knowledge, this is the first publication on split orders
in an RMFS. We analyze different performance metrics, such as pile-on,
pod-station visits, robot moving distance and order turn-over time. We compare
the results of our models in different instances with the sequential method in
our open-source simulation framework RAWSim-O.
","[{'version': 'v1', 'created': 'Thu, 31 Jan 2019 22:26:56 GMT'}]",2021-01-28,"[['Xie', 'Lin', ''], ['Thieme', 'Nils', ''], ['Krenzler', 'Ruslan', ''], ['Li', 'Hanyi', '']]","['order picking problem', 'parts-to-picker warehouses', 'robotic mobilefulfillment systems', 'warehousing', 'simulation']"
13151,1909.13318,Arish Sateesan,S. Arish and R.K. Sharma,"Run-time reconfigurable multi-precision floating point multiplier design
  for high speed, low-power applications",,"2015 2nd International Conference on Signal Processing and
  Integrated Networks (SPIN)",10.1109/SPIN.2015.7095315,,cs.AR eess.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Floating point multiplication is one of the crucial operations in many
application domains such as image processing, signal processing etc. But every
application requires different working features. Some need high precision, some
need low power consumption, low latency etc. But IEEE-754 format is not really
flexible for these specifications and also design is complex. Optimal run-time
reconfigurable hardware implementations may need the use of custom
floating-point formats that do not necessarily follow IEEE specified sizes. In
this paper, we present a run-time-reconfigurable floating point multiplier
implemented on FPGA with custom floating point format for different
applications. This floating point multiplier can have 6 modes of operations
depending on the accuracy or application requirement. With the use of optimal
design with custom IPs (Intellectual Properties), a better implementation is
done by truncating the inputs before multiplication. And a combination of
Karatsuba algorithm and Urdhva-Tiryagbhyam algorithm (Vedic Mathematics) is
used to implement unsigned binary multiplier. This further increases the
efficiency of the multiplier.
","[{'version': 'v1', 'created': 'Sun, 29 Sep 2019 16:47:40 GMT'}, {'version': 'v2', 'created': 'Sun, 6 Dec 2020 21:48:39 GMT'}]",2020-12-08,"[['Arish', 'S.', ''], ['Sharma', 'R. K.', '']]","['fpga', 'Run-time-reconfigurable', 'Variable-precision', 'Floating point multiplier', 'Vedic mathematics', 'Urdhva-Tiryagbhyam', 'Karatsuba']"
13152,2201.08452,Ellen Arteca,Ellen Arteca and Alexi Turcotte,"npm-filter: Automating the mining of dynamic information from npm
  packages","5 pages. To appear in In 19th International Conference on Mining
  Software Repositories (MSR '22), May 23-24, 2022, Pittsburgh, PA, USA",,10.1145/3524842.3528021,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  The static properties of code repositories, e.g., lines of code, dependents,
dependencies, etc. can be readily scraped from code hosting platforms such as
GitHub, and from package management systems such as npm for JavaScript;
Although no less important, information related to the dynamic properties of
programs, e.g., number of tests in a test suite that pass or fail, is less
readily available. The ability to easily collect this dynamic information could
be immensely useful to researchers conducting corpus analyses, as they could
differentiate projects based on properties that can only be observed by running
them.
  In this paper, we present npm-filter, an automated tool that can download,
install, build, test, and run custom user scripts over the source code of
JavaScript projects available on npm, the most popular JavaScript package
manager. We outline this tool, describe its implementation, and show that
npm-filter has already been useful in developing evaluation suites for multiple
JavaScript tools.
","[{'version': 'v1', 'created': 'Thu, 20 Jan 2022 20:54:08 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Jan 2022 20:45:41 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Mar 2022 02:09:12 GMT'}, {'version': 'v4', 'created': 'Wed, 30 Mar 2022 01:43:00 GMT'}]",2022-03-31,"[['Arteca', 'Ellen', ''], ['Turcotte', 'Alexi', '']]","['JavaScript', 'npm', 'corpus analysis', 'tool evaluation']"
13153,2107.12190,Lalli Myllyaho,"Lalli Myllyaho, Mikko Raatikainen, Tomi M\""annist\""o, Tommi Mikkonen
  and Jukka K. Nurminen",Systematic Literature Review of Validation Methods for AI Systems,"25 pages, 6 figures, 12 tables. The manuscript has been accepted to
  the Journal of Systems and Software",,10.1016/j.jss.2021.111050,,cs.SE,http://creativecommons.org/licenses/by-nc-nd/4.0/,"  Context: Artificial intelligence (AI) has made its way into everyday
activities, particularly through new techniques such as machine learning (ML).
These techniques are implementable with little domain knowledge. This, combined
with the difficulty of testing AI systems with traditional methods, has made
system trustworthiness a pressing issue.
  Objective: This paper studies the methods used to validate practical AI
systems reported in the literature. Our goal is to classify and describe the
methods that are used in realistic settings to ensure the dependability of AI
systems.
  Method: A systematic literature review resulted in 90 papers. Systems
presented in the papers were analysed based on their domain, task, complexity,
and applied validation methods.
  Results: The validation methods were synthesized into a taxonomy consisting
of trial, simulation, model-centred validation, and expert opinion. Failure
monitors, safety channels, redundancy, voting, and input and output
restrictions are methods used to continuously validate the systems after
deployment.
  Conclusions: Our results clarify existing strategies applied to validation.
They form a basis for the synthesization, assessment, and refinement of AI
system validation in research and guidelines for validating individual systems
in practice. While various validation strategies have all been relatively
widely applied, only few studies report on continuous validation.
  Keywords: artificial intelligence, machine learning, validation, testing,
V&V, systematic literature review.
","[{'version': 'v1', 'created': 'Mon, 26 Jul 2021 12:54:32 GMT'}]",2021-09-17,"[['Myllyaho', 'Lalli', ''], ['Raatikainen', 'Mikko', ''], ['Männistö', 'Tomi', ''], ['Mikkonen', 'Tommi', ''], ['Nurminen', 'Jukka K.', '']]","['artificial intelligence', 'machine learning', 'validation', 'testing', 'V&V', 'systematic literature review']"
13154,1805.03138,Fatemeh Zahedi,Fatemeh Zahedi and Zahra Zahedi,A review of neuro-fuzzy systems based on intelligent control,"4 pages, 7 figures, 1 table, Journal of Electrical and Electronic
  Engineering","Journal of Electrical and Electronic Engineering 2015; 3(2-1):
  58-61",10.11648/j.jeee.s.2015030201.23,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The system's ability to adapt and self-organize are two key factors when it
comes to how well the system can survive the changes to the environment and the
plant they work within. Intelligent control improves these two factors in
controllers. Considering the increasing complexity of dynamic systems along
with their need for feedback controls, using more complicated controls has
become necessary and intelligent control can be a suitable response to this
necessity. This paper briefly describes the structure of intelligent control
and provides a review on fuzzy logic and neural networks which are some of the
base methods for intelligent control. The different aspects of these two
methods are then compared together and an example of a combined method is
presented.
","[{'version': 'v1', 'created': 'Sun, 6 May 2018 12:30:22 GMT'}]",2018-05-09,"[['Zahedi', 'Fatemeh', ''], ['Zahedi', 'Zahra', '']]","['Intelligent control', 'Neural networks', 'Fuzzy logic', 'Neuro-fuzzy']"
13155,2112.00395,Shreya Venugopal,"Manav Agarwal, Shreya Venugopal, Rishab Kashyap, R Bharathi","A Comprehensive Study on Various Statistical Techniques for Prediction
  of Movie Success","14 pages, 12 figures Conference: 2nd International Conference on
  Machine Learning Techniques and Data Science (MLDS 2021)",,10.5121/csit.2021.111802,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The film industry is one of the most popular entertainment industries and one
of the biggest markets for business. Among the contributing factors to this
would be the success of a movie in terms of its popularity as well as its box
office performance. Hence, we create a comprehensive comparison between the
various machine learning models to predict the rate of success of a movie. The
effectiveness of these models along with their statistical significance is
studied to conclude which of these models is the best predictor. Some insights
regarding factors that affect the success of the movies are also found. The
models studied include some Regression models, Machine Learning models, a Time
Series model and a Neural Network with the Neural Network being the best
performing model with an accuracy of about 86%. Additionally, as part of the
testing data for the movies released in 2020 are analysed.
","[{'version': 'v1', 'created': 'Wed, 1 Dec 2021 10:28:44 GMT'}]",2021-12-02,"[['Agarwal', 'Manav', ''], ['Venugopal', 'Shreya', ''], ['Kashyap', 'Rishab', ''], ['Bharathi', 'R', '']]","['Machine Learning models', 'Time Series', 'Movie Success', 'Neural Network', 'Statistical significance']"
13156,2001.00361,Shangxi Wu,Bohan Liang and Shangxi Wu and Kaiyuan Xu and Jingyu Hao,"Butterfly Detection and Classification Based on Integrated YOLO
  Algorithm","13th ICGEC 2019: Qingdao, China","Genetic and Evolutionary Computing. ICGEC 2019. Advances in
  Intelligent Systems and Computing, vol 1107. Springer, Singapore",10.1007/978-981-15-3308-2_55,500-512,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Insects are abundant species on the earth, and the task of identification and
identification of insects is complex and arduous. How to apply artificial
intelligence technology and digital image processing methods to automatic
identification of insect species is a hot issue in current research. In this
paper, the problem of automatic detection and classification recognition of
butterfly photographs is studied, and a method of bio-labeling suitable for
butterfly classification is proposed. On the basis of YOLO algorithm, by
synthesizing the results of YOLO models with different training mechanisms, a
butterfly automatic detection and classification recognition algorithm based on
YOLO algorithm is proposed. It greatly improves the generalization ability of
YOLO algorithm and makes it have better ability to solve small sample problems.
The experimental results show that the proposed annotation method and
integrated YOLO algorithm have high accuracy and recognition rate in butterfly
automatic detection and recognition.
","[{'version': 'v1', 'created': 'Thu, 2 Jan 2020 08:52:18 GMT'}, {'version': 'v2', 'created': 'Sun, 26 Apr 2020 02:50:28 GMT'}]",2020-04-28,"[['Liang', 'Bohan', ''], ['Wu', 'Shangxi', ''], ['Xu', 'Kaiyuan', ''], ['Hao', 'Jingyu', '']]","['YOLO', 'butterfly detection', 'butterfly classification', 'ensemble learning', 'target detection']"
13157,1909.13507,Christian Zingg,"Christian Zingg, Vahan Nanumyan, Frank Schweitzer","Citations Driven by Social Connections? A Multi-Layer Representation of
  Coauthorship Networks",,Quantitative Science Studies 1 (2020) 1493-1509,10.1162/qss_a_00092,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To what extent is the citation rate of new papers influenced by the past
social relations of their authors? To answer this question, we present a
data-driven analysis of nine different physics journals. Our analysis is based
on a two-layer network representation constructed from two large-scale data
sets, INSPIREHEP and APS. The social layer contains authors as nodes and
coauthorship relations as links. This allows us to quantify the social
relations of each author, prior to the publication of a new paper. The
publication layer contains papers as nodes and citations between papers as
links. This layer allows us to quantify scientific attention as measured by the
change of the citation rate over time. We particularly study how this change
depends on the social relations of their authors, prior to publication. We find
that on average the maximum value of the citation rate is reached sooner for
authors who either published more papers, or who had more coauthors in previous
papers. We also find that for these authors the decay in the citation rate is
faster, meaning that their papers are forgotten sooner.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2019 08:21:07 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Mar 2020 09:30:19 GMT'}]",2021-03-15,"[['Zingg', 'Christian', ''], ['Nanumyan', 'Vahan', ''], ['Schweitzer', 'Frank', '']]","['Collective Attention', 'Citation Rate', 'Two-Layer Network', 'CitationNetwork', 'Collaboration Network', 'Network Centrality']"
13158,2103.00433,Steffen Wendzel,"Wojciech Mazurczyk and Steffen Wendzel and Mehdi Chourib and J\""org
  Keller",Countering Adaptive Network Covert Communication with Dynamic Wardens,,"Elsevier FGCS, Volume 94, May 2019, Pages 712-725",10.1016/j.future.2018.12.047,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network covert channels are hidden communication channels in computer
networks. They influence several factors of the cybersecurity economy. For
instance, by improving the stealthiness of botnet communications, they aid and
preserve the value of darknet botnet sales. Covert channels can also be used to
secretly exfiltrate confidential data out of organizations, potentially
resulting in loss of market/research advantage. Considering the above, efforts
are needed to develop effective countermeasures against such threats. Thus in
this paper, based on the introduced novel warden taxonomy, we present and
evaluate a new concept of a dynamic warden. Its main novelty lies in the
modification of the warden's behavior over time, making it difficult for the
adaptive covert communication parties to infer its strategy and perform a
successful hidden data exchange. Obtained experimental results indicate the
effectiveness of the proposed approach.
","[{'version': 'v1', 'created': 'Sun, 28 Feb 2021 09:31:13 GMT'}]",2021-03-02,"[['Mazurczyk', 'Wojciech', ''], ['Wendzel', 'Steffen', ''], ['Chourib', 'Mehdi', ''], ['Keller', 'Jörg', '']]","['Covert Channel', 'Active Warden', 'Traffic Normalization', 'Information Hiding', 'Network Steganography', 'Data Leakage Protection']"
13159,1806.05796,Ziheng Wang,"Ziheng Wang, Ann Majewicz Fey","Deep Learning with Convolutional Neural Network for Objective Skill
  Evaluation in Robot-assisted Surgery","Manuscript published. For reference, see
  https://link.springer.com/article/10.1007/s11548-018-1860-1","2018 International Journal of Computer Assisted Radiology and
  Surgery",10.1007/s11548-018-1860-1,,cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the advent of robot-assisted surgery, the role of data-driven approaches
to integrate statistics and machine learning is growing rapidly with prominent
interests in objective surgical skill assessment. However, most existing work
requires translating robot motion kinematics into intermediate features or
gesture segments that are expensive to extract, lack efficiency, and require
significant domain-specific knowledge. We propose an analytical deep learning
framework for skill assessment in surgical training. A deep convolutional
neural network is implemented to map multivariate time series data of the
motion kinematics to individual skill levels. We perform experiments on the
public minimally invasive surgical robotic dataset, JHU-ISI Gesture and Skill
Assessment Working Set (JIGSAWS). Our proposed learning model achieved a
competitive accuracy of 92.5%, 95.4%, and 91.3%, in the standard training
tasks: Suturing, Needle-passing, and Knot-tying, respectively. Without the need
of engineered features or carefully-tuned gesture segmentation, our model can
successfully decode skill information from raw motion profiles via end-to-end
learning. Meanwhile, the proposed model is able to reliably interpret skills
within 1-3 second window, without needing an observation of entire training
trial. This study highlights the potentials of deep architectures for an
proficient online skill assessment in modern surgical training.
","[{'version': 'v1', 'created': 'Fri, 15 Jun 2018 03:22:06 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Mar 2019 06:25:35 GMT'}]",2019-03-08,"[['Wang', 'Ziheng', ''], ['Fey', 'Ann Majewicz', '']]","['Surgical robotics', 'surgical skill evaluation', 'motion analysis', 'deep learning', 'convolutional neuralnetwork']"
13160,1403.5912,Lucas Paletta,"Bj\""orn Schuller, Erik Marchi, Simon Baron-Cohen, Helen O'Reilly,
  Delia Pigat, Peter Robinson, Ian Daves","The state of play of ASC-Inclusion: An Integrated Internet-Based
  Environment for Social Inclusion of Children with Autism Spectrum Conditions",,,,IDGEI/2014/05,cs.HC cs.CV cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Individuals with Autism Spectrum Conditions (ASC) have marked difficulties
using verbal and non-verbal communication for social interaction. The running
ASC-Inclusion project aims to help children with ASC by allowing them to learn
how emotions can be expressed and recognised via playing games in a virtual
world. The platform includes analysis of users' gestures, facial, and vocal
expressions using standard microphone and web-cam or a depth sensor, training
through games, text communication with peers, animation, video and audio clips.
We present the state of play in realising such a serious game platform and
provide results for the different modalities.
","[{'version': 'v1', 'created': 'Mon, 24 Mar 2014 11:09:27 GMT'}]",2016-08-11,"[['Schuller', 'Björn', ''], ['Marchi', 'Erik', ''], ['Baron-Cohen', 'Simon', ''], [""O'Reilly"", 'Helen', ''], ['Pigat', 'Delia', ''], ['Robinson', 'Peter', ''], ['Daves', 'Ian', '']]","['Autism Spectrum Conditions', 'inclusion', 'virtual worlds', 'computerised environment', 'emotion recognition']"
13161,1007.1259,Michael Goodrich,"Michael T. Goodrich, Michael Mitzenmacher","Privacy-Preserving Access of Outsourced Data via Oblivious RAM
  Simulation","A more complete version of a paper appearing in the 38th
  International Colloquium on Automata, Languages and Programming (ICALP) 2011",,,,cs.DS cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Suppose a client, Alice, has outsourced her data to an external storage
provider, Bob, because he has capacity for her massive data set, of size n,
whereas her private storage is much smaller--say, of size O(n^{1/r}), for some
constant r > 1. Alice trusts Bob to maintain her data, but she would like to
keep its contents private. She can encrypt her data, of course, but she also
wishes to keep her access patterns hidden from Bob as well. We describe schemes
for the oblivious RAM simulation problem with a small logarithmic or
polylogarithmic amortized increase in access times, with a very high
probability of success, while keeping the external storage to be of size O(n).
To achieve this, our algorithmic contributions include a parallel MapReduce
cuckoo-hashing algorithm and an external-memory dataoblivious sorting
algorithm.
","[{'version': 'v1', 'created': 'Wed, 7 Jul 2010 23:21:31 GMT'}, {'version': 'v2', 'created': 'Mon, 2 May 2011 23:41:14 GMT'}]",2011-05-04,"[['Goodrich', 'Michael T.', ''], ['Mitzenmacher', 'Michael', '']]","['oblivious RAM simulation', 'cuckoo hashing', 'sorting', 'outsourced data', 'privacy']"
13162,1705.09435,Kingsley Kuan,"Kingsley Kuan, Mathieu Ravaut, Gaurav Manek, Huiling Chen, Jie Lin,
  Babar Nazir, Cen Chen, Tse Chiang Howe, Zeng Zeng, Vijay Chandrasekhar","Deep Learning for Lung Cancer Detection: Tackling the Kaggle Data
  Science Bowl 2017 Challenge",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a deep learning framework for computer-aided lung cancer
diagnosis. Our multi-stage framework detects nodules in 3D lung CAT scans,
determines if each nodule is malignant, and finally assigns a cancer
probability based on these results. We discuss the challenges and advantages of
our framework. In the Kaggle Data Science Bowl 2017, our framework ranked 41st
out of 1972 teams.
","[{'version': 'v1', 'created': 'Fri, 26 May 2017 05:36:29 GMT'}]",2017-05-29,"[['Kuan', 'Kingsley', ''], ['Ravaut', 'Mathieu', ''], ['Manek', 'Gaurav', ''], ['Chen', 'Huiling', ''], ['Lin', 'Jie', ''], ['Nazir', 'Babar', ''], ['Chen', 'Cen', ''], ['Howe', 'Tse Chiang', ''], ['Zeng', 'Zeng', ''], ['Chandrasekhar', 'Vijay', '']]","['lung cancer', 'nodule detection', 'deep learning', 'neural networks', '3D']"
13163,1306.2187,Stefan Hoffmann,"Stefan Hoffmann, Egon Wanke",Metric Dimension for Gabriel Unit Disk Graphs is NP-Complete,"A brief announcement of this result has been published in the
  proceedings of ALGOSENSORS 2012",,,,cs.CC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that finding a minimal number of landmark nodes for a unique virtual
addressing by hop-distances in wireless ad-hoc sensor networks is NP-complete
even if the networks are unit disk graphs that contain only Gabriel edges. This
problem is equivalent to Metric Dimension for Gabriel unit disk graphs. The
Gabriel edges of a unit disc graph induce a planar O(\sqrt{n}) distance and an
optimal energy spanner. This is one of the most interesting restrictions of
Metric Dimension in the context of wireless multi-hop networks.
","[{'version': 'v1', 'created': 'Mon, 10 Jun 2013 12:55:16 GMT'}]",2013-06-11,"[['Hoffmann', 'Stefan', ''], ['Wanke', 'Egon', '']]","['metric dimension', 'unit disk graph', 'gabriel graph', 'virtual address', 'wireless multi-hop network', 'sensor network']"
13164,1109.6018,Lillian Lee,"Chenhao Tan, Lillian Lee, Jie Tang, Long Jiang, Ming Zhou, and Ping Li",User-level sentiment analysis incorporating social networks,Proceedings of KDD 2011. Poster,,,,cs.CL cs.IR physics.data-an physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that information about social relationships can be used to improve
user-level sentiment analysis. The main motivation behind our approach is that
users that are somehow ""connected"" may be more likely to hold similar opinions;
therefore, relationship information can complement what we can extract about a
user's viewpoints from their utterances. Employing Twitter as a source for our
experimental data, and working within a semi-supervised framework, we propose
models that are induced either from the Twitter follower/followee network or
from the network in Twitter formed by users referring to each other using ""@""
mentions. Our transductive learning results reveal that incorporating
social-network information can indeed lead to statistically significant
sentiment-classification improvements over the performance of an approach based
on Support Vector Machines having access only to textual features.
","[{'version': 'v1', 'created': 'Tue, 27 Sep 2011 20:00:47 GMT'}]",2011-09-29,"[['Tan', 'Chenhao', ''], ['Lee', 'Lillian', ''], ['Tang', 'Jie', ''], ['Jiang', 'Long', ''], ['Zhou', 'Ming', ''], ['Li', 'Ping', '']]","['social networks', 'sentiment analysis', 'opinion mining', 'Twitter']"
13165,1504.07225,Sarath Chandar,"Sarath Chandar, Mitesh M. Khapra, Hugo Larochelle, Balaraman Ravindran",Correlational Neural Networks,27 pages. To Appear in Neural Computation,,,,cs.CL cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Common Representation Learning (CRL), wherein different descriptions (or
views) of the data are embedded in a common subspace, is receiving a lot of
attention recently. Two popular paradigms here are Canonical Correlation
Analysis (CCA) based approaches and Autoencoder (AE) based approaches. CCA
based approaches learn a joint representation by maximizing correlation of the
views when projected to the common subspace. AE based methods learn a common
representation by minimizing the error of reconstructing the two views. Each of
these approaches has its own advantages and disadvantages. For example, while
CCA based approaches outperform AE based approaches for the task of transfer
learning, they are not as scalable as the latter. In this work we propose an AE
based approach called Correlational Neural Network (CorrNet), that explicitly
maximizes correlation among the views when projected to the common subspace.
Through a series of experiments, we demonstrate that the proposed CorrNet is
better than the above mentioned approaches with respect to its ability to learn
correlated common representations. Further, we employ CorrNet for several cross
language tasks and show that the representations learned using CorrNet perform
better than the ones learned using other state of the art approaches.
","[{'version': 'v1', 'created': 'Mon, 27 Apr 2015 19:51:34 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Sep 2015 20:34:28 GMT'}, {'version': 'v3', 'created': 'Mon, 12 Oct 2015 19:14:05 GMT'}]",2015-10-13,"[['Chandar', 'Sarath', ''], ['Khapra', 'Mitesh M.', ''], ['Larochelle', 'Hugo', ''], ['Ravindran', 'Balaraman', '']]","['Representation Learning', 'Deep Learning', 'Transfer Learning', 'NeuralNetworks', 'Autoencoders', 'Common Representations']"
13166,0804.2037,Serban Vlad E.,Serban E. Vlad,Some properties of the regular asynchronous systems,"International Conference on Computers, Communications & Control 2008,
  May 15-17, Baile Felix, Romania",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The asynchronous systems are the models of the asynchronous circuits from the
digital electrical engineering. An asynchronous system f is a multi-valued
function that assigns to each admissible input u a set f(u) of possible states
x in f(u). A special case of asynchronous system consists in the existence of a
Boolean function \Upsilon such that for any u and any x in f(u), a certain
equation involving \Upsilon is fulfilled. Then \Upsilon is called the generator
function of f (Moisil used the terminology of network function) and we say that
f is generated by \Upsilon. The systems that have a generator function are
called regular.
  Our purpose is to continue the study of the generation of the asynchronous
systems that was started in [2], [3].
","[{'version': 'v1', 'created': 'Sun, 13 Apr 2008 01:11:43 GMT'}]",2008-12-18,"[['Vlad', 'Serban E.', '']]","['asynchronous system', 'regularity', 'generator function']"
13167,1208.4809,Husnabad Venkateswara  Reddy,"H. Venkateswara Reddy, Dr.S.Viswanadha Raju, B.Ramasubba Reddy","Comparing N-Node Set Importance Representative results with Node
  Importance Representative results for Categorical Clustering: An exploratory
  study","16 pages, 4 figures, 3 equations",,,,cs.DB,http://creativecommons.org/licenses/by/3.0/,"  The proportionate increase in the size of the data with increase in space
implies that clustering a very large data set becomes difficult and is a time
consuming process.Sampling is one important technique to scale down the size of
dataset and to improve the efficiency of clustering. After sampling allocating
unlabeled objects into proper clusters is impossible in the categorical
domain.To address the problem, Chen employed a method called MAximal
Representative Data Labeling to allocate each unlabeled data point to the
appropriate cluster based on Node Importance Representative and N-Node
Importance Representative algorithms. This paper took off from Chen s
investigation and analyzed and compared the results of NIR and NNIR leading to
the conclusion that the two processes contradict each other when it comes to
finding the resemblance between an unlabeled data point and a cluster.A new and
better way of solving the problem was arrived at that finds resemblance between
unlabeled data point within all clusters, while also providing maximal
resemblance for allocation of data in the required cluster.
","[{'version': 'v1', 'created': 'Thu, 23 Aug 2012 17:32:32 GMT'}]",2015-03-13,"[['Reddy', 'H. Venkateswara', ''], ['Raju', 'Dr. S. Viswanadha', ''], ['Reddy', 'B. Ramasubba', '']]","['Categorical Clustering', 'Data lebeling', 'Independent']"
13168,1003.1794,Rdv Ijcsis,"D. Roopamala, S. K. Katti","New Approach to Identify Common Eigenvalues of real matrices using
  Gerschgorin Theorem and Bisection method","Pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS, Vol. 7 No. 2, February 2010, USA. ISSN 1947
  5500, http://sites.google.com/site/ijcsis/",,,,cs.NA,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper, a new approach is presented to determine common eigenvalues of
two matrices. It is based on Gerschgorin theorem and Bisection method. The
proposed approach is simple and can be useful in image processing and noise
estimation.
","[{'version': 'v1', 'created': 'Tue, 9 Mar 2010 06:38:08 GMT'}]",2010-03-10,"[['Roopamala', 'D.', ''], ['Katti', 'S. K.', '']]","['Common Eigenvalues', 'Gerschgorin theorem', 'Bisection method', 'real matrices']"
13169,1407.4739,T Sarath,"T.Sarath, G.Nagalakshmi",An landcover fuzzy logic classification by maximumlikelihood,"5 Pages, 3 Figures",,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In present days remote sensing is most used application in many sectors. This
remote sensing uses different images like multispectral, hyper spectral or
ultra spectral. The remote sensing image classification is one of the
significant method to classify image. In this state we classify the maximum
likelihood classification with fuzzy logic. In this we experimenting fuzzy
logic like spatial, spectral texture methods in that different sub methods to
be used for image classification.
","[{'version': 'v1', 'created': 'Thu, 17 Jul 2014 17:10:06 GMT'}]",2014-07-18,"[['Sarath', 'T.', ''], ['Nagalakshmi', 'G.', '']]","['Hyper spectral', 'multispectral', 'image processing', 'remote sensing', 'classifications', 'Maximum likelihood', 'fuzzy logic']"
13170,1206.5469,Muhammad Aamir,"Muhammad Aamir, Mustafa Zaidi, Husnain Mansoor","Performance Analysis of DiffServ based Quality of Service in a
  Multimedia Wired Network and VPN effect using OPNET","09 pages, 13 figures, 02 tables","International Journal of Computer Science Issues (IJCSI), Vol. 9,
  Issue 3, May 2012",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quality of Service (QoS) techniques are applied in IP networks to utilize
available network resources in the most efficient manner to minimize delays and
delay variations (jitters) in network traffic having multiple type of services.
Multimedia services may include voice, video and database. Researchers have
done considerable work on queuing disciplines to analyze and improve QoS
performance in wired and wireless IP networks. This paper highlights QoS
analysis in a wired IP network with more realistic enterprise modeling and
presents simulation results of a few statistics not presented and discussed
before. Four different applications are used i.e. FTP, Database, Voice over IP
(VoIP) and Video Conferencing (VC). Two major queuing disciplines are evaluated
i.e. 'Priority Queuing' and 'Weighted Fair Queuing' for packet identification
under Differentiated Services Code Point (DSCP). The simulation results show
that WFQ has an edge over PQ in terms of queuing delays and jitters experienced
by low priority services. For high priority traffic, dependency of 'Traffic
Drop', 'Buffer Usage' and 'Packet Delay Variation' on selected buffer sizes is
simulated and discussed to evaluate QoS deeper. In the end, it is also analyzed
how network's database service with applied Quality of Service may be affected
in terms of throughput (average rate of data received) for internal network
users when the server is also accessed by external user(s) through Virtual
Private Network (VPN).
","[{'version': 'v1', 'created': 'Sun, 24 Jun 2012 07:31:39 GMT'}]",2012-06-26,"[['Aamir', 'Muhammad', ''], ['Zaidi', 'Mustafa', ''], ['Mansoor', 'Husnain', '']]","['Quality of Service', 'Queuing', 'Delay', 'Delay Variation', 'Jitter', 'DiffServ', 'Virtual Private Network']"
13171,1407.4709,Vadim Bulitko,Vadim Bulitko,Flow for Meta Control,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The psychological state of flow has been linked to optimizing human
performance. A key condition of flow emergence is a match between the human
abilities and complexity of the task. We propose a simple computational model
of flow for Artificial Intelligence (AI) agents. The model factors the standard
agent-environment state into a self-reflective set of the agent's abilities and
a socially learned set of the environmental complexity. Maximizing the flow
serves as a meta control for the agent. We show how to apply the meta-control
policy to a broad class of AI control policies and illustrate our approach with
a specific implementation. Results in a synthetic testbed are promising and
open interesting directions for future work.
","[{'version': 'v1', 'created': 'Thu, 17 Jul 2014 15:31:03 GMT'}]",2014-07-18,"[['Bulitko', 'Vadim', '']]","['flow', 'computational model', 'meta control']"
13172,1204.5828,Adrian Dumitrescu,Adrian Dumitrescu,The traveling salesman problem for lines and rays in the plane,"10 pages, 5 figures",,,,cs.CG math.MG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of
$n$ regions (neighborhoods) and we seek a shortest tour that visits each
region. In the path variant, we seek a shortest path that visits each region.
We present several linear-time approximation algorithms with improved ratios
for these problems for two cases of neighborhoods that are (infinite) lines,
and respectively, (half-infinite) rays. Along the way we derive a tight bound
on the minimum perimeter of a rectangle enclosing an open curve of length $L$.
","[{'version': 'v1', 'created': 'Thu, 26 Apr 2012 04:56:56 GMT'}]",2012-04-27,"[['Dumitrescu', 'Adrian', '']]","['Traveling salesman problem with neighborhoods', 'linear programming', 'minimumperimeter rectangle', 'approximation algorithm', 'lines', 'rays']"
13173,1708.02033,Silvio Giancola,"Silvio Giancola, Daniele Piron, Pasquale Poppa and Remo Sala",A Solution for Crime Scene Reconstruction using Time-of-Flight Cameras,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we propose a method for three-dimensional (3D) reconstruction
of wide crime scene, based on a Simultaneous Localization and Mapping (SLAM)
approach. We used a Kinect V2 Time-of-Flight (TOF) RGB-D camera to provide
colored dense point clouds at a 30 Hz frequency. This device is moved freely (6
degrees of freedom) during the scene exploration. The implemented SLAM solution
aligns successive point clouds using an 3D keypoints description and matching
approach. This type of approach exploits both colorimetric and geometrical
information, and permits reconstruction under poor illumination conditions. Our
solution has been tested for indoor crime scene and outdoor archaeological site
reconstruction, returning a mean error around one centimeter. It is less
precise than environmental laser scanner solution, but more practical and
portable as well as less cumbersome. Also, the hardware is definitively
cheaper.
","[{'version': 'v1', 'created': 'Mon, 7 Aug 2017 08:29:19 GMT'}]",2017-08-08,"[['Giancola', 'Silvio', ''], ['Piron', 'Daniele', ''], ['Poppa', 'Pasquale', ''], ['Sala', 'Remo', '']]","['Crime Scene Reconstruction', 'RGB-D Camera', 'Kinect V2', 'SLAM']"
13174,1312.7056,Izuddin Zainalabidin,"Izuddin Zainalabidin, Izyan Izzati A Halim, Faizal A Fadzil","Development of Display Ads Retrieval System to Match Publisher's
  Contents","14 pages, 3 figures, 1 table. arXiv admin note: text overlap with
  arXiv:1206.1754 by other authors",,,,cs.CY cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The technological transformation and automation of digital content delivery
has revolutionized the media industry. Advertising landscape is gradually
shifting its traditional media forms to the emergent of Internet advertising.
In this paper, the types of internet advertising to be discussed on are
contextual and sponsored search ads. These types of advertising have the
central challenge of finding the best match between a given context and a
suitable advertisement, through a principled method. Furthermore, there are
four main players that exist in the Internet advertising ecosystem: users,
advertisers, ad exchange and publishers. Hence, to find ways to counter the
central challenge, the paper addresses two objectives: how to successfully make
the best contextual ads selections to match to a web page content to ensure
that there is a valuable connection between the web page and the contextual
ads. All methods, discussions, conclusion and future recommendations are
presented as per sections. Hence, in order to prove the working mechanism of
matching contextual ads and web pages, web pages together with the ads matching
system are developed as a prototype.
","[{'version': 'v1', 'created': 'Thu, 26 Dec 2013 05:48:39 GMT'}]",2013-12-30,"[['Zainalabidin', 'Izuddin', ''], ['Halim', 'Izyan Izzati A', ''], ['Fadzil', 'Faizal A', '']]","['online advertising', 'contextual advertising', 'information retrieval', 'e-business']"
13175,1306.4724,Ognjen Arandjelovi\'c PhD,Ognjen Arandjelovic,Computer simulation based parameter selection for resistance exercise,"In Modelling and Simulation, 2013",,,,cs.CV cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In contrast to most scientific disciplines, sports science research has been
characterized by comparatively little effort investment in the development of
relevant phenomenological models. Scarcer yet is the application of said models
in practice. We present a framework which allows resistance training
practitioners to employ a recently proposed neuromuscular model in actual
training program design. The first novelty concerns the monitoring aspect of
coaching. A method for extracting training performance characteristics from
loosely constrained video sequences, effortlessly and with minimal human input,
using computer vision is described. The extracted data is subsequently used to
fit the underlying neuromuscular model. This is achieved by solving an inverse
dynamics problem corresponding to a particular exercise. Lastly, a computer
simulation of hypothetical training bouts, using athlete-specific capability
parameters, is used to predict the effected adaptation and changes in
performance. The software described here allows the practitioner to manipulate
hypothetical training parameters and immediately see their effect on predicted
adaptation for a specific athlete. Thus, this work presents a holistic view of
the monitoring-assessment-adjustment loop.
","[{'version': 'v1', 'created': 'Thu, 20 Jun 2013 00:47:21 GMT'}]",2013-06-21,"[['Arandjelovic', 'Ognjen', '']]","['weight', 'training', 'muscle', 'strength', 'powerlifting']"
13176,1307.0072,Imam  Riadi Riadi,"Imam Riadi, Jazi Eko Istiyanto, Ahmad Ashari, Subanar",Log Analysis Techniques using Clustering in Network Forensics,"8 pages, 13 figures",,,,cs.CY cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Internet crimes are now increasing. In a row with many crimes using
information technology, in particular those using Internet, some crimes are
often carried out in the form of attacks that occur within a particular agency
or institution. To be able to find and identify the types of attacks, requires
a long process that requires time, human resources and utilization of
information technology to solve these problems. The process of identifying
attacks that happened also needs the support of both hardware and software as
well. The attack happened in the Internet network can generally be stored in a
log file that has a specific data format. Clustering technique is one of
methods that can be used to facilitate the identification process. Having
grouped the data log file using K-means clustering technique, then the data is
grouped into three categories of attack, and will be continued with the
forensic process that can later be known to the source and target of attacks
that exist in the network. It is concluded that the framework proposed can help
the investigator in the trial process.
","[{'version': 'v1', 'created': 'Sat, 29 Jun 2013 05:42:43 GMT'}]",2013-07-02,"[['Riadi', 'Imam', ''], ['Istiyanto', 'Jazi Eko', ''], ['Ashari', 'Ahmad', ''], ['Subanar', '', '']]","['analysis', 'network', 'forensic', 'clustering', 'attack']"
13177,1305.1002,Ji Won Yoon,Ji Won Yoon and Nial Friel,"Efficient Estimation of the number of neighbours in Probabilistic K
  Nearest Neighbour Classification",,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Probabilistic k-nearest neighbour (PKNN) classification has been introduced
to improve the performance of original k-nearest neighbour (KNN) classification
algorithm by explicitly modelling uncertainty in the classification of each
feature vector. However, an issue common to both KNN and PKNN is to select the
optimal number of neighbours, $k$. The contribution of this paper is to
incorporate the uncertainty in $k$ into the decision making, and in so doing
use Bayesian model averaging to provide improved classification. Indeed the
problem of assessing the uncertainty in $k$ can be viewed as one of statistical
model selection which is one of the most important technical issues in the
statistics and machine learning domain. In this paper, a new functional
approximation algorithm is proposed to reconstruct the density of the model
(order) without relying on time consuming Monte Carlo simulations. In addition,
this algorithm avoids cross validation by adopting Bayesian framework. The
performance of this algorithm yielded very good performance on several real
experimental datasets.
","[{'version': 'v1', 'created': 'Sun, 5 May 2013 09:44:08 GMT'}]",2013-05-07,"[['Yoon', 'Ji Won', ''], ['Friel', 'Nial', '']]","['Bayesian Inference', 'Model Averaging', 'K-free model orderestimation']"
13178,1403.7455,Mahima Sharma,"Shruti Mathur, Varun Prakash Saxena",Hybrid Approach to English-Hindi Name Entity Transliteration,"Proceedings of IEEE Students' Conference on Electrical, Electronics
  and Computer Sciences 2014",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine translation (MT) research in Indian languages is still in its
infancy. Not much work has been done in proper transliteration of name entities
in this domain. In this paper we address this issue. We have used English-Hindi
language pair for our experiments and have used a hybrid approach. At first we
have processed English words using a rule based approach which extracts
individual phonemes from the words and then we have applied statistical
approach which converts the English into its equivalent Hindi phoneme and in
turn the corresponding Hindi word. Through this approach we have attained
83.40% accuracy.
","[{'version': 'v1', 'created': 'Fri, 28 Mar 2014 17:30:32 GMT'}]",2014-03-31,"[['Mathur', 'Shruti', ''], ['Saxena', 'Varun Prakash', '']]","['Name Entity', 'Machine Transliteration', 'Hybrid']"
13179,1406.6449,Kezun Zhang,"Kezun Zhang and Yanghua Xiao and Hanghang Tong and Haixun Wang and Wei
  Wang","The Links Have It: Infobox Generation by Summarization over Linked
  Entities",,,,,cs.IR,http://creativecommons.org/licenses/by/3.0/,"  Online encyclopedia such as Wikipedia has become one of the best sources of
knowledge. Much effort has been devoted to expanding and enriching the
structured data by automatic information extraction from unstructured text in
Wikipedia. Although remarkable progresses have been made, their effectiveness
and efficiency is still limited as they try to tackle an extremely difficult
natural language understanding problems and heavily relies on supervised
learning approaches which require large amount effort to label the training
data. In this paper, instead of performing information extraction over
unstructured natural language text directly, we focus on a rich set of
semi-structured data in Wikipedia articles: linked entities. The idea of this
paper is the following: If we can summarize the relationship between the entity
and its linked entities, we immediately harvest some of the most important
information about the entity. To this end, we propose a novel rank aggregation
approach to remove noise, an effective clustering and labeling algorithm to
extract knowledge.
","[{'version': 'v1', 'created': 'Wed, 25 Jun 2014 03:33:17 GMT'}]",2014-06-26,"[['Zhang', 'Kezun', ''], ['Xiao', 'Yanghua', ''], ['Tong', 'Hanghang', ''], ['Wang', 'Haixun', ''], ['Wang', 'Wei', '']]","['Knowledge Extraction', 'Rank Aggregation', 'Clustering', 'ClusterLabeling']"
13180,1412.8099,Rathipriya R,"R. Rathipriya, K. Thangavel","Extraction of Web Usage Profiles using Simulated Annealing Based
  Biclustering Approach",,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the Simulated Annealing (SA) based biclustering approach is
proposed in which SA is used as an optimization tool for biclustering of web
usage data to identify the optimal user profile from the given web usage data.
Extracted biclusters are consists of correlated users whose usage behaviors are
similar across the subset of web pages of a web site where as these users are
uncorrelated for remaining pages of a web site. These results are very useful
in web personalization so that it communicates better with its users and for
making customized prediction. Also useful for providing customized web service
too. Experiment was conducted on the real web usage dataset called CTI dataset.
Results show that proposed SA based biclustering approach can extract highly
correlated user groups from the preprocessed web usage data.
","[{'version': 'v1', 'created': 'Mon, 1 Dec 2014 10:06:25 GMT'}]",2014-12-30,"[['Rathipriya', 'R.', ''], ['Thangavel', 'K.', '']]","['Biclustering', 'Clickstream Data', 'Simulated Annealing (SA)', 'Web Personalization', 'Web User Profile', 'Web Recommendations', 'Web Usage Mining']"
13181,1501.04309,Baogang Hu,Bao-Gang Hu,Information Theory and its Relation to Machine Learning,"10 pages, 6 figures, 1 table",,,,cs.IT cs.LG math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this position paper, I first describe a new perspective on machine
learning (ML) by four basic problems (or levels), namely, ""What to learn?"",
""How to learn?"", ""What to evaluate?"", and ""What to adjust?"". The paper stresses
more on the first level of ""What to learn?"", or ""Learning Target Selection"".
Towards this primary problem within the four levels, I briefly review the
existing studies about the connection between information theoretical learning
(ITL [1]) and machine learning. A theorem is given on the relation between the
empirically-defined similarity measure and information measures. Finally, a
conjecture is proposed for pursuing a unified mathematical interpretation to
learning target selection.
","[{'version': 'v1', 'created': 'Sun, 18 Jan 2015 14:57:02 GMT'}]",2015-01-20,"[['Hu', 'Bao-Gang', '']]","['Machine learning', 'learning target selection', 'entropy', 'information theory', 'similarity', 'conjecture']"
13182,1106.1311,Bart Demoen,Phuong-Lan Nguyen and Bart Demoen,Representation Sharing for Prolog,"37 pages, 11 figures, 3 tables; To appear in Theory and Practice of
  Logic Programming (TPLP)",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Representation sharing can reduce the memory footprint of a program by
sharing one representation between duplicate terms. The most common
implementation of representation sharing in functional programming systems is
known as hash-consing. In the context of Prolog, representation sharing has
been given little attention. Some current techniques that deal with
representation sharing are reviewed. The new contributions are: (1) an easy
implementation of {\em input sharing} for {\em findall/3}; (2) a description of
a {\em sharer} module that introduces representation sharing at runtime. Their
realization is shown in the context of the WAM as implemented by hProlog. Both
can be adapted to any WAM-like Prolog implementation. The sharer works
independently of the garbage collector, but it can be made to cooperate with
the garbage collector. Benchmark results show that the sharer has a cost
comparable to the heap garbage collector, that its effectiveness is highly
application dependent, and that its policy must be tuned to the collector. To
appear in Theory and Practice of Logic Programming (TPLP)
","[{'version': 'v1', 'created': 'Tue, 7 Jun 2011 10:34:53 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Jun 2011 07:09:53 GMT'}]",2011-07-01,"[['Nguyen', 'Phuong-Lan', ''], ['Demoen', 'Bart', '']]","['Prolog', 'WAM', 'memory management']"
13183,1603.06110,"Stefan Sch\""onig","Lars Ackermann, Stefan Sch\""onig, Stefan Jablonski",Inter-Paradigm Translation of Process Models using Simulation and Mining,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Process modeling is usually done using imperative modeling languages like
BPMN or EPCs. In order to cope with the complexity of human-centric and
flexible business processes several declarative process modeling languages
(DPMLs) have been developed during the last years. DPMLs allow for the
specification of constraints that restrict execution flows. They differ widely
in terms of their level of expressiveness and tool support. Furthermore,
research has shown that the understandability of declarative process models is
rather low. Since there are applications for both classes of process modeling
languages, there arises a need for an automatic translation of process models
from one language into another. Our approach is based upon well-established
methodologies in process management for process model simulation and process
mining without requiring the specification of model transformation rules. In
this paper, we present the technique in principle and evaluate it by
transforming process models between two exemplary process modeling languages.
","[{'version': 'v1', 'created': 'Sat, 19 Mar 2016 16:11:14 GMT'}]",2016-03-22,"[['Ackermann', 'Lars', ''], ['Schönig', 'Stefan', ''], ['Jablonski', 'Stefan', '']]","['process model translation', 'simulation', 'process mining']"
13184,1610.08400,Babak Taati,"Babak Taati, Pranay Lohia, Avril Mansfield, Ahmed Ashraf","Video Analysis of ""YouTube Funnies"" to Aid the Study of Human Gait and
  Falls - Preliminary Results and Proof of Concept","4 pages, 3 figures, 2 tables",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Because falls are funny, YouTube and other video sharing sites contain a
large repository of real-life falls. We propose extracting gait and balance
information from these videos to help us better understand some of the factors
that contribute to falls. Proof-of-concept is explored in a single video
containing multiple (n=14) falls/non-falls in the presence of an unexpected
obstacle. The analysis explores: computing spatiotemporal parameters of gait in
a video captured from an arbitrary viewpoint; the relationship between
parameters of gait from the last few steps before the obstacle and falling vs.
not falling; and the predictive capacity of a multivariate model in predicting
a fall in the presence of an unexpected obstacle. Homography transformations
correct the perspective projection distortion and allow for the consistent
tracking of gait parameters as an individual walks in an arbitrary direction in
the scene. A synthetic top view allows for computing the average stride length
and a synthetic side view allows for measuring up and down motions of the head.
In leave-one-out cross-validation, we were able to correctly predict whether a
person would fall or not in 11 out of the 14 cases (78.6%), just by looking at
the average stride length and the range of vertical head motion during the 1-4
most recent steps prior to reaching the obstacle.
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2016 16:28:15 GMT'}]",2016-10-27,"[['Taati', 'Babak', ''], ['Lohia', 'Pranay', ''], ['Mansfield', 'Avril', ''], ['Ashraf', 'Ahmed', '']]","['such as falls/falling', 'tripping', 'slipping', 'etc']"
13185,1701.07463,Robert Brijder,Robert Brijder,Sorting by Reversals and the Theory of 4-Regular Graphs,"25 pages, 16 figures",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that the theory of sorting by reversals fits into the
well-established theory of circuit partitions of 4-regular multigraphs (which
also involves the combinatorial structures of circle graphs and
delta-matroids). In this way, we expose strong connections between the two
theories that have not been fully appreciated before. We also discuss a
generalization of sorting by reversals involving the double-cut-and-join (DCJ)
operation. Finally, we also show that the theory of sorting by reversals is
closely related to that of gene assembly in ciliates.
","[{'version': 'v1', 'created': 'Wed, 25 Jan 2017 19:54:08 GMT'}]",2017-01-27,"[['Brijder', 'Robert', '']]","['sorting by reversals', 'sorting by DCJ operations', 'genomerearrangements', '4-regular graphs', 'local complementation', 'gene assembly inciliates']"
13186,1611.00055,Milena Golshan,"Christine L. Borgman, Peter T. Darch, Ashley E. Sands, Milena S.
  Golshan","The Durability and Fragility of Knowledge Infrastructures: Lessons
  Learned from Astronomy","Paper presented at the 2016 Annual Meeting of the Association for
  Information Science and Technology, October 14-18, 2016, Copenhagen, Denmark.
  10 pages;
  https://www.asist.org/files/meetings/am16/proceedings/submissions/papers/31paper.pdf","Proceedings of the 79th ASIS&T Annual Meeting (Vol. 53), 2016",,,cs.DL astro-ph.IM cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Infrastructures are not inherently durable or fragile, yet all are fragile
over the long term. Durability requires care and maintenance of individual
components and the links between them. Astronomy is an ideal domain in which to
study knowledge infrastructures, due to its long history, transparency, and
accumulation of observational data over a period of centuries. Research
reported here draws upon a long-term study of scientific data practices to ask
questions about the durability and fragility of infrastructures for data in
astronomy. Methods include interviews, ethnography, and document analysis. As
astronomy has become a digital science, the community has invested in shared
instruments, data standards, digital archives, metadata and discovery services,
and other relatively durable infrastructure components. Several features of
data practices in astronomy contribute to the fragility of that infrastructure.
These include different archiving practices between ground- and space-based
missions, between sky surveys and investigator-led projects, and between
observational and simulated data. Infrastructure components are tightly
coupled, based on international agreements. However, the durability of these
infrastructures relies on much invisible work - cataloging, metadata, and other
labor conducted by information professionals. Continual investments in care and
maintenance of the human and technical components of these infrastructures are
necessary for sustainability.
","[{'version': 'v1', 'created': 'Mon, 31 Oct 2016 21:40:19 GMT'}]",2016-11-02,"[['Borgman', 'Christine L.', ''], ['Darch', 'Peter T.', ''], ['Sands', 'Ashley E.', ''], ['Golshan', 'Milena S.', '']]","['Knowledge Infrastructures', 'scientific data', 'astronomy', 'stewardship']"
13187,0706.3412,Blai Bonet,"Nerio Borges, Blai Bonet",On Canonical Forms of Complete Problems via First-order Projections,9 pages,,,,cs.CC,,"  The class of problems complete for NP via first-order reductions is known to
be characterized by existential second-order sentences of a fixed form. All
such sentences are built around the so-called generalized IS-form of the
sentence that defines Independent-Set. This result can also be understood as
that every sentence that defines a NP-complete problem P can be decomposed in
two disjuncts such that the first one characterizes a fragment of P as hard as
Independent-Set and the second the rest of P. That is, a decomposition that
divides every such sentence into a quotient and residue modulo Independent-Set.
  In this paper, we show that this result can be generalized over a wide
collection of complexity classes, including the so-called nice classes.
Moreover, we show that such decomposition can be done for any complete problem
with respect to the given class, and that two such decompositions are
non-equivalent in general. Interestingly, our results are based on simple and
well-known properties of first-order reductions.ow that this result can be
generalized over a wide collection of complexity classes, including the
so-called nice classes. Moreover, we show that such decomposition can be done
for any complete problem with respect to the given class, and that two such
decompositions are non-equivalent in general. Interestingly, our results are
based on simple and well-known properties of first-order reductions.
","[{'version': 'v1', 'created': 'Fri, 22 Jun 2007 21:27:06 GMT'}]",2007-06-26,"[['Borges', 'Nerio', ''], ['Bonet', 'Blai', '']]","['Finite Model Theory', 'Complexity Theory', 'First-Order Reductions', 'CanonicalForms']"
13188,1212.1617,Anil Maheshwari,"Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, J\""org-R\""udiger
  Sack, Christian Scheffer",Similarity of Polygonal Curves in the Presence of Outliers,Replaces the earlier version of this paper,,,,cs.CG cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Fr\'{e}chet distance is a well studied and commonly used measure to
capture the similarity of polygonal curves. Unfortunately, it exhibits a high
sensitivity to the presence of outliers. Since the presence of outliers is a
frequently occurring phenomenon in practice, a robust variant of Fr\'{e}chet
distance is required which absorbs outliers. We study such a variant here. In
this modified variant, our objective is to minimize the length of subcurves of
two polygonal curves that need to be ignored (MinEx problem), or alternately,
maximize the length of subcurves that are preserved (MaxIn problem), to achieve
a given Fr\'{e}chet distance. An exact solution to one problem would imply an
exact solution to the other problem. However, we show that these problems are
not solvable by radicals over $\mathbb{Q}$ and that the degree of the
polynomial equations involved is unbounded in general. This motivates the
search for approximate solutions. We present an algorithm, which approximates,
for a given input parameter $\delta$, optimal solutions for the \MinEx\ and
\MaxIn\ problems up to an additive approximation error $\delta$ times the
length of the input curves. The resulting running time is upper bounded by
$\mathcal{O} \left(\frac{n^3}{\delta} \log \left(\frac{n}{\delta}
\right)\right)$, where $n$ is the complexity of the input polygonal curves.
","[{'version': 'v1', 'created': 'Fri, 7 Dec 2012 14:22:12 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Apr 2013 14:26:19 GMT'}]",2013-04-24,"[['De Carufel', 'Jean-Lou', ''], ['Gheibi', 'Amin', ''], ['Maheshwari', 'Anil', ''], ['Sack', 'Jörg-Rüdiger', ''], ['Scheffer', 'Christian', '']]","['Fr´echet distance', 'similarity of polygonal curves', 'approximation', 'weighted shortest path']"
13189,1305.5981,Daqiang Zhang,"Daqiang Zhang, Rongbo Zhu, Shuqiqiu Men, Vaskar Raychoudhury",Query Representation with Global Consistency on User Click Graph,"accepted by Journal of Internet Technology on Sep. 9, 2012. To appear
  in Vol. 4, September, 2013",,,,cs.IR cs.HC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Extensive research has been conducted on query log analysis. A query log is
generally represented as a bipartite graph on a query set and a URL set. Most
of the traditional methods used the raw click frequency to weigh the link
between a query and a URL on the click graph. In order to address the
disadvantages of raw click frequency, researchers proposed the entropy-biased
model, which incorporates raw click frequency with inverse query frequency of
the URL as the weighting scheme for query representation. In this paper, we
observe that the inverse query frequency can be considered a global property of
the URL on the click graph, which is more informative than raw click frequency,
which can be considered a local property of the URL. Based on this insight, we
develop the global consistency model for query representation, which utilizes
the click frequency and the inverse query frequency of a URL in a consistent
manner. Furthermore, we propose a new scheme called inverse URL frequency as an
effective way to capture the global property of a URL. Experiments have been
conducted on the AOL search engine log data. The result shows that our global
consistency model achieved better performance than the current models.
","[{'version': 'v1', 'created': 'Sun, 26 May 2013 01:30:25 GMT'}]",2013-05-28,"[['Zhang', 'Daqiang', ''], ['Zhu', 'Rongbo', ''], ['Men', 'Shuqiqiu', ''], ['Raychoudhury', 'Vaskar', '']]","['Global consistency model', 'bipartite graph', 'query representation', 'inverse query frequency', 'inverse URL frequency']"
13190,1708.00143,Hamidreza Jahanjou,"Hamidreza Jahanjou, Erez Kantor, and Rajmohan Rajaraman",Improved Algorithms for Scheduling Unsplittable Flows on Paths,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate offline and online algorithms for rufpp, the
problem of minimizing the number of rounds required to schedule a set of
unsplittable flows of non-uniform sizes on a given path with non-uniform edge
capacities. rufpp is NP-hard and constant-factor approximation algorithms are
known under the no bottleneck assumption (NBA), which stipulates that maximum
size of a flow is at most the minimum edge capacity. We study rufpp without the
NBA, and present improved online and offline algorithms. We first study offline
rufpp for a restricted class of instances called $\alpha$-small, where the size
of each flow is at most $\alpha$ times the capacity of its bottleneck edge, and
present an $O(\log(1/(1-\alpha)))$-approximation algorithm. Our main result is
an online $O(\log\log c_{\max})$-competitive algorithm for rufpp for general
instances, where $c_{\max}$ is the largest edge capacities, improving upon the
previous best bound of $O(\log c_{\max})$ due to Epstein et al. Our result
leads to an offline $O(\min(\log n, \log m, \log\log c_{\max}))$-approximation
algorithm and an online $O(\min(\log m, \log\log c_{\max}))$-competitive
algorithm for rufpp, where $n$ is the number of flows and $m$ is the number of
edges.
","[{'version': 'v1', 'created': 'Tue, 1 Aug 2017 02:57:43 GMT'}]",2017-08-02,"[['Jahanjou', 'Hamidreza', ''], ['Kantor', 'Erez', ''], ['Rajaraman', 'Rajmohan', '']]","['Approximation algorithms', 'Online algorithms', 'Unsplittable flows', 'Interval coloring', 'Flow scheduling']"
13191,1412.4265,Haizhang Zhang,Wenjian Chen and Haizhang Zhang,"Exponential Approximation of Multivariate Bandlimited Functions from
  Average Oversampling",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Instead of sampling a function at a single point, average sampling takes the
weighted sum of function values around the point. Such a sampling strategy is
more practical and more stable. In this note, we present an explicit method
with an exponentially-decaying approximation error to reconstruct a
multivariate bandlimited function from its finite average oversampling data.
The key problem in our analysis is how to extend a function so that its Fourier
transform decays at an optimal rate to zero at infinity.
","[{'version': 'v1', 'created': 'Sat, 13 Dec 2014 18:14:34 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Dec 2014 01:40:43 GMT'}, {'version': 'v3', 'created': 'Mon, 22 Dec 2014 03:51:03 GMT'}]",2014-12-23,"[['Chen', 'Wenjian', ''], ['Zhang', 'Haizhang', '']]","['average sampling', 'exponential decayness', 'multivariate bandlimited functions', 'theShannon sampling theorem']"
13192,1403.1165,Michael Hanspach,"Michael Hanspach, J\""org Keller","A Taxonomy for Attack Patterns on Information Flows in Component-Based
  Operating Systems",9 pages,"In Proceedings of the 7th Layered Assurance Workshop, New Orleans,
  LA, USA, December 2013",,,cs.CR cs.OS cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a taxonomy and an algebra for attack patterns on component-based
operating systems. In a multilevel security scenario, where isolation of
partitions containing data at different security classifications is the primary
security goal and security breaches are mainly defined as undesired disclosure
or modification of classified data, strict control of information flows is the
ultimate goal. In order to prevent undesired information flows, we provide a
classification of information flow types in a component-based operating system
and, by this, possible patterns to attack the system. The systematic
consideration of informations flows reveals a specific type of operating system
covert channel, the covert physical channel, which connects two former isolated
partitions by emitting physical signals into the computer's environment and
receiving them at another interface.
","[{'version': 'v1', 'created': 'Wed, 5 Mar 2014 15:43:57 GMT'}]",2014-03-06,"[['Hanspach', 'Michael', ''], ['Keller', 'Jörg', '']]","['micro kernel', 'separation kernel', 'MILS', 'covert channels', 'sidechannels', 'multilevel security']"
13193,1205.3986,Yusuf Perwej,"Omar S. Al-Mushayt, Yusuf Perwej, Kashiful Haq","Electronic-government in Saudi Arabia: A positive revolution in the
  peninsula","12 Pages, 1 Figures, ISSN Print: (0974-7273),ISSN Online:(0975-3761)","International Transactions in Applied Sciences (ITAS), January
  2009, Volume 1 , Number 1, Pages 87-98",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The informatization practice of countries all over the world has shown that
the level of a government's informatization is one main factor that can affect
its international competitive power. At present, e-government construction is
regarded as one of the most important tasks for the national economy and
society upliftment and informatization in Saudi Arabia. Unlike the traditional
governments, an e-government takes on a new look with its framework and
operation mode more suitable for the contemporary era. In fact, it is a basic
national strategy to promote Saudi Arabia's informatization by means of
e-government construction. This talk firstly introduces the basic concepts and
relevant viewpoints of egovernment, then reviews the development process of
e-government in Saudi Arabia, and describes the current states, development
strategies of e-government in Saudi Arabia. And also review e-government
maturity models and synthesize them e-government maturity models are
investigated, in which the authors have proposed the Delloite's six-stage
model, Layne and Lee four-stage model and Accenture five-stage model. So, the
main e-government maturity stages are: online presence, interaction,
transaction, transformation and digital democracy. After that, according to
many references, the main technologies which are used in each stage are
summarized.
","[{'version': 'v1', 'created': 'Thu, 17 May 2012 17:23:50 GMT'}]",2012-05-18,"[['Al-Mushayt', 'Omar S.', ''], ['Perwej', 'Yusuf', ''], ['Haq', 'Kashiful', '']]","['E-government; Framework; Information Technology; Information', 'Communication Technology (ICT); Ministry of Communications', 'Information Technology (MCIT)']"
13194,1609.02300,Shwan Ashrafi,"Shwan Ashrafi, Chen Feng, Sumit Roy","Performance Analysis of CSMA with Multi-Packet Reception: The
  Inhomogeneous Case",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of Carrier Sense Multiple Access (CSMA) with multi-packet
reception (MPR) is studied. Most prior work has focused on the homogeneous
case, where all the mobile users are assumed to have identical packet arrival
rates and transmission probabilities. The inhomogeneous case remains largely
open in the literature. In this work, we make a first step towards this open
problem by deriving throughput and delay expressions for inhomogeneous CSMA,
with a particular focus on a family of MPR models called the ""all-or-nothing""
symmetric MPR. This family of MPR models allows us to overcome several
technical challenges associated with conventional analysis and to derive
accurate throughput and delay expressions in the large-systems regime.
Interestingly, this family of MPR models is still general enough to include a
number of useful MPR techniques - such as successive interference cancellation
(SIC), compute-and-forward (C&F), and successive compute-and-forward (SCF) - as
special cases. Based on these throughput and delay expressions, we provide
theoretical guidelines for meeting quality-of-service requirements and for
achieving global stability; we also evaluate the performances of various MPR
techniques, highlighting the clear advantages offered by SCF.
","[{'version': 'v1', 'created': 'Thu, 8 Sep 2016 07:22:17 GMT'}]",2016-09-09,"[['Ashrafi', 'Shwan', ''], ['Feng', 'Chen', ''], ['Roy', 'Sumit', '']]","['Performance Analysis', 'Mean Field Approximation', 'Inhomogeneous CSMA', 'Multipacket Reception', 'Compute-and-Forward']"
13195,1209.5626,Robert Smith,Robert Smith,A Tutorial for Creating and Publishing Open Source Lisp Software,Accepted for the International Lisp Conference 2012,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The proliferation and accessability of the Internet have made it simple to
view, download, and publish source code. This paper gives a short tutorial on
how to create a new Common Lisp project and publish it.
","[{'version': 'v1', 'created': 'Tue, 25 Sep 2012 14:41:47 GMT'}]",2012-09-26,"[['Smith', 'Robert', '']]","['Common Lisp', 'open source', 'ASDF', 'Quicklisp']"
13196,1510.00651,Mark Scanlon,"Jason Farina, M-Tahar Kechadi and Mark Scanlon",Project Maelstrom: Forensic Analysis of the BitTorrent-Powered Browser,,"Journal of Digital Forensics, Security and Law (Proc. of 10th
  International Conference on Systematic Approaches to Digital Forensic
  Engineering, SADFE 2015)",,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In April 2015, BitTorrent Inc. released their distributed peer-to-peer
powered browser, Project Maelstrom, into public beta. The browser facilitates a
new alternative website distribution paradigm to the traditional HTTP-based,
client-server model. This decentralised web is powered by each of the visitors
accessing each Maelstrom hosted website. Each user shares their copy of the
website's source code and multimedia content with new visitors. As a result, a
Maelstrom hosted website cannot be taken offline by law enforcement or any
other parties. Due to this open distribution model, a number of interesting
censorship, security and privacy considerations are raised. This paper explores
the application, its protocol, sharing Maelstrom content and its new visitor
powered ""web-hosting"" paradigm.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2015 17:25:27 GMT'}]",2015-10-05,"[['Farina', 'Jason', ''], ['Kechadi', 'M-Tahar', ''], ['Scanlon', 'Mark', '']]","['Project Maelstrom', 'BitTorrent', 'Decentralised Web', 'Alternative Web', 'Browser Forensics']"
13197,0711.2867,Cristobald de Kerchove,"Cristobald de Kerchove, Laure Ninove, Paul Van Dooren",Maximizing PageRank via outlinks,"27 pages, 14 figures, submitted to Linear Algebra Appl",,,,cs.IR math.RA,,"  We analyze linkage strategies for a set I of webpages for which the webmaster
wants to maximize the sum of Google's PageRank scores. The webmaster can only
choose the hyperlinks starting from the webpages of I and has no control on the
hyperlinks from other webpages. We provide an optimal linkage strategy under
some reasonable assumptions.
","[{'version': 'v1', 'created': 'Mon, 19 Nov 2007 09:43:22 GMT'}]",2007-12-04,"[['de Kerchove', 'Cristobald', ''], ['Ninove', 'Laure', ''], ['Van Dooren', 'Paul', '']]","['PageRank', 'Google matrix', 'Markov chain', 'Perron vector', 'Optimal linkage strategy']"
13198,1401.7239,Laura Sheble,Laura Sheble and Annie T. Chen,"Contexts of diffusion: Adoption of research synthesis in Social Work and
  Women's Studies","To appear in proceedings of the 2014 International Conference on
  Social Computing, Behavioral-Cultural Modeling, and Prediction (SBP2014)",,,,cs.SI cs.DL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Texts reveal the subjects of interest in research fields, and the values,
beliefs, and practices of researchers. In this study, texts are examined
through bibliometric mapping and topic modeling to provide a birds eye view of
the social dynamics associated with the diffusion of research synthesis methods
in the contexts of Social Work and Women's Studies. Research synthesis texts
are especially revealing because the methods, which include meta-analysis and
systematic review, are reliant on the availability of past research and data,
sometimes idealized as objective, egalitarian approaches to research
evaluation, fundamentally tied to past research practices, and performed with
the goal informing future research and practice. This study highlights the
co-influence of past and subsequent research within research fields;
illustrates dynamics of the diffusion process; and provides insight into the
cultural contexts of research in Social Work and Women's Studies. This study
suggests the potential to further develop bibliometric mapping and topic
modeling techniques to inform research problem selection and resource
allocation.
","[{'version': 'v1', 'created': 'Tue, 28 Jan 2014 15:57:01 GMT'}]",2014-01-29,"[['Sheble', 'Laura', ''], ['Chen', 'Annie T.', '']]","['diffusion', 'social work', 'women’s studies', 'research dynamics']"
13199,0712.1994,Pradorn Sureephong,"Pradorn Sureephong (LIESP, CAMT), Nopasit Chakpitak (CAMT), Yacine
  Ouzrout (LIESP), Gilles Neubert (LIESP), Abdelaziz Bouras (LIESP)",Knowledge Engineering Technique for Cluster Development,,"Dans Proceeding of Knowledge Science, Engineering and Management
  (KSEM 07) - Knowledge Science, Engineering and Management (KSEM 07),
  Melbourne : Australie (2007)",,,cs.OH,,"  After the concept of industry cluster was tangibly applied in many countries,
SMEs trended to link to each other to maintain their competitiveness in the
market. The major key success factors of the cluster are knowledge sharing and
collaboration between partners. This knowledge is collected in form of tacit
and explicit knowledge from experts and institutions within the cluster. The
objective of this study is about enhancing the industry cluster with knowledge
management by using knowledge engineering which is one of the most important
method for managing knowledge. This work analyzed three well known knowledge
engineering methods, i.e. MOKA, SPEDE and CommonKADS, and compares the
capability to be implemented in the cluster context. Then, we selected one
method and proposed the adapted methodology. At the end of this paper, we
validated and demonstrated the proposed methodology with some primary result by
using case study of handicraft cluster in Thailand.
","[{'version': 'v1', 'created': 'Wed, 12 Dec 2007 17:49:00 GMT'}]",2007-12-13,"[['Sureephong', 'Pradorn', '', 'LIESP, CAMT'], ['Chakpitak', 'Nopasit', '', 'CAMT'], ['Ouzrout', 'Yacine', '', 'LIESP'], ['Neubert', 'Gilles', '', 'LIESP'], ['Bouras', 'Abdelaziz', '', 'LIESP']]","['Knowledge Engineering', 'Industry Cluster', 'CommonKADS', 'Knowledge Management System']"
13200,1002.2425,Rdv Ijcsis,"O. J. Oyelade, O. O. Oladipupo, I. C. Obagbuwa","Application of k Means Clustering algorithm for prediction of Students
  Academic Performance","IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS January 2010, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 7, No. 1, pp. 292-295, January 2010, USA",,"Journal of Computer Science, ISSN 1947 5500",cs.LG cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ability to monitor the progress of students academic performance is a
critical issue to the academic community of higher learning. A system for
analyzing students results based on cluster analysis and uses standard
statistical algorithms to arrange their scores data according to the level of
their performance is described. In this paper, we also implemented k mean
clustering algorithm for analyzing students result data. The model was combined
with the deterministic model to analyze the students results of a private
Institution in Nigeria which is a good benchmark to monitor the progression of
academic performance of students in higher Institution for the purpose of
making an effective decision by the academic planners.
","[{'version': 'v1', 'created': 'Thu, 11 Feb 2010 20:41:28 GMT'}]",2010-02-12,"[['Oyelade', 'O. J.', ''], ['Oladipupo', 'O. O.', ''], ['Obagbuwa', 'I. C.', '']]","['k – mean', 'clustering', 'academic performance', 'algorithm']"
13201,1603.03898,Ananthanarayanan Chockalingam,T. Lakshmi Narasimhan and A. Chockalingam,On the Capacity and Performance of Generalized Spatial Modulation,Expanded version of the IEEE Communications Letters paper,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generalized spatial modulation (GSM) uses $N$ antenna elements but fewer
radio frequency (RF) chains ($R$) at the transmitter. Spatial modulation and
spatial multiplexing are special cases of GSM with $R=1$ and $R=N$,
respectively. In GSM, apart from conveying information bits through $R$
modulation symbols, information bits are also conveyed through the indices of
the $R$ active transmit antennas. In this paper, we derive lower and upper
bounds on the the capacity of a ($N,M,R$)-GSM MIMO system, where $M$ is the
number of receive antennas. Further, we propose a computationally efficient GSM
encoding (i.e., bits-to-signal mapping) method and a message passing based
low-complexity detection algorithm suited for large-scale GSM-MIMO systems.
","[{'version': 'v1', 'created': 'Sat, 12 Mar 2016 12:04:07 GMT'}]",2016-03-15,"[['Narasimhan', 'T. Lakshmi', ''], ['Chockalingam', 'A.', '']]","['GSM-MIMO capacity', 'GSM encoding', 'combinadics', 'low-complexity detection', 'message passing']"
13202,1710.04970,Paulo Abelha,Paulo Abelha and Frank Guerin,Transfer of Tool Affordance and Manipulation Cues with 3D Vision Data,24 pages,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Future service robots working in human environments, such as kitchens, will
face situations where they need to improvise. The usual tool for a given task
might not be available and the robot will have to use some substitute tool. The
robot needs to select an appropriate alternative tool from the candidates
available, and also needs to know where to grasp it, how to orient it and what
part to use as the end-effector. We present a system which takes as input a
candidate tool's point cloud and weight, and outputs a score for how effective
that tool is for a task, and how to use it. Our key novelty is in taking a
task-driven approach, where the task exerts a top-down influence on how low
level vision data is interpreted. This facilitates the type of 'everyday
creativity' where an object such as a wine bottle could be used as a rolling
pin, because the interpretation of the object is not fixed in advance, but
rather results from the interaction between the bottom-up and top-down
pressures at run-time. The top-down influence is implemented by transfer: prior
knowledge of geometric features that make a tool good for a task is used to
seek similar features in a candidate tool. The prior knowledge is learned by
simulating Web models performing the tasks. We evaluate on a set of fifty
household objects and five tasks. We compare our system with the closest one in
the literature and show that we achieve significantly better results
","[{'version': 'v1', 'created': 'Fri, 13 Oct 2017 15:37:32 GMT'}]",2017-10-16,"[['Abelha', 'Paulo', ''], ['Guerin', 'Frank', '']]","['Service Robotics', 'Tool Affordance', 'Transfer']"
13203,1603.07022,Alberto Pretto,Marco Imperoli and Alberto Pretto,"Active Detection and Localization of Textureless Objects in Cluttered
  Environments",,,,,cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces an active object detection and localization framework
that combines a robust untextured object detection and 3D pose estimation
algorithm with a novel next-best-view selection strategy. We address the
detection and localization problems by proposing an edge-based registration
algorithm that refines the object position by minimizing a cost directly
extracted from a 3D image tensor that encodes the minimum distance to an edge
point in a joint direction/location space. We face the next-best-view problem
by exploiting a sequential decision process that, for each step, selects the
next camera position which maximizes the mutual information between the state
and the next observations. We solve the intrinsic intractability of this
solution by generating observations that represent scene realizations, i.e.
combination samples of object hypothesis provided by the object detector, while
modeling the state by means of a set of constantly resampled particles.
Experiments performed on different real world, challenging datasets confirm the
effectiveness of the proposed methods.
","[{'version': 'v1', 'created': 'Tue, 22 Mar 2016 22:55:03 GMT'}]",2016-03-24,"[['Imperoli', 'Marco', ''], ['Pretto', 'Alberto', '']]","['Object Detection and Localization', 'Next-Best-View', 'Bin-Picking', 'Chamfer Distance']"
13204,1501.04668,Hui Huang,"Shaoshi Chen, Hui Huang, Manuel Kauers, Ziming Li","A Modified Abramov-Petkovsek Reduction and Creative Telescoping for
  Hypergeometric Terms","8 pages, ISSAC 2015 submission",,,,cs.SC math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Abramov-Petkovsek reduction computes an additive decomposition of a
hypergeometric term, which extends the functionality of the Gosper algorithm
for indefinite hypergeometric summation. We modify the Abramov-Petkovsek
reduction so as to decompose a hypergeometric term as the sum of a summable
term and a non-summable one. The outputs of the Abramov-Petkovsek reduction and
our modified version share the same required properties. The modified reduction
does not solve any auxiliary linear difference equation explicitly. It is also
more efficient than the original reduction according to computational
experiments. Based on this reduction, we design a new algorithm to compute
minimal telescopers for bivariate hypergeometric terms. The new algorithm can
avoid the costly computation of certificates.
","[{'version': 'v1', 'created': 'Mon, 19 Jan 2015 23:00:12 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Jun 2015 09:48:19 GMT'}]",2015-06-11,"[['Chen', 'Shaoshi', ''], ['Huang', 'Hui', ''], ['Kauers', 'Manuel', ''], ['Li', 'Ziming', '']]","['Abramov-Petkovˇsek reduction', 'Hypergeometric term', 'Telescoper', 'Summability']"
13205,0803.0966,Michael Hahsler,Michael Hahsler and Kurt Hornik,New probabilistic interest measures for association rules,,"Intelligent Data Analysis, 11(5):437-455, 2007",,,cs.DB stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mining association rules is an important technique for discovering meaningful
patterns in transaction databases. Many different measures of interestingness
have been proposed for association rules. However, these measures fail to take
the probabilistic properties of the mined data into account. In this paper, we
start with presenting a simple probabilistic framework for transaction data
which can be used to simulate transaction data when no associations are
present. We use such data and a real-world database from a grocery outlet to
explore the behavior of confidence and lift, two popular interest measures used
for rule mining. The results show that confidence is systematically influenced
by the frequency of the items in the left hand side of rules and that lift
performs poorly to filter random noise in transaction data. Based on the
probabilistic framework we develop two new interest measures, hyper-lift and
hyper-confidence, which can be used to filter or order mined association rules.
The new measures show significantly better performance than lift for
applications where spurious rules are problematic.
","[{'version': 'v1', 'created': 'Thu, 6 Mar 2008 20:17:19 GMT'}]",2008-12-18,"[['Hahsler', 'Michael', ''], ['Hornik', 'Kurt', '']]","['Data mining', 'association rules', 'measures of interestingness', 'probabilistic data modeling']"
13206,1401.2121,Carlos Pedro dos Santos Gon\c{c}alves,Carlos Pedro Gon\c{c}alves,"Emotional Responses in Artificial Agent-Based Systems: Reflexivity and
  Adaptation in Artificial Life",,,,,cs.AI nlin.AO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The current work addresses a virtual environment with self-replicating agents
whose decisions are based on a form of ""somatic computation"" (soma - body) in
which basic emotional responses, taken in parallelism to actual living
organisms, are introduced as a way to provide the agents with greater reflexive
abilities. The work provides a contribution to the field of Artificial
Intelligence (AI) and Artificial Life (ALife) in connection to a
neurobiology-based cognitive framework for artificial systems and virtual
environments' simulations. The performance of the agents capable of emotional
responses is compared with that of self-replicating automata, and the
implications of research on emotions and AI, in connection to both virtual
agents as well as robots, is addressed regarding possible future directions and
applications.
","[{'version': 'v1', 'created': 'Thu, 9 Jan 2014 19:13:02 GMT'}]",2014-01-10,"[['Gonçalves', 'Carlos Pedro', '']]","['Artificial Intelligence', 'Artificial Life', 'Somatic Computation', 'Emotional Responses', 'Awareness']"
13207,1802.06951,Yerlan Amanbek,"Yerlan Amanbek, Ilyas Balgayev, Kanat Batyrkhanov, Margaret Tan",Adoption of e-government in the Republic of Kazakhstan,,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper identifies factors that influence Kazakhstan's e-Government portal
usage. It determines challenges encountered by citizens while using the portal.
Targeted respondents for the web-based questionnaire survey were the citizens
of Kazakhstan. The technology acceptance model was used as a methodology to
measure attitude towards portal usage. In addition, this paper discusses the
barriers which were experienced by the respondents and can prevent the
successful adoption of e-Government initiative. The results of the analysis
demonstrate that awareness among citizens is high, i.e. the majority of people
have visited it at least once and they perceive the portal to be useful, but
only a limited percentage of citizens' use it on the regular basis. Further,
paper can be used to help IT managers of the portal to improve management of
informational content and maintain a more effective adoption among citizens.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 03:48:58 GMT'}]",2018-02-21,"[['Amanbek', 'Yerlan', ''], ['Balgayev', 'Ilyas', ''], ['Batyrkhanov', 'Kanat', ''], ['Tan', 'Margaret', '']]","['The Republic of Kazakhstan', 'Technology Acceptance Model (TAM)', 'e-Government']"
13208,1008.1673,Alex Berka Mr,Alex V Berka,Space and the Synchronic A-Ram,8 pages,,,,cs.CL cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Space is a circuit oriented, spatial programming language designed to exploit
the massive parallelism available in a novel formal model of computation called
the Synchronic A-Ram, and physically related FPGA and reconfigurable
architectures. Space expresses variable grained MIMD parallelism, is modular,
strictly typed, and deterministic. Barring operations associated with memory
allocation and compilation, modules cannot access global variables, and are
referentially transparent. At a high level of abstraction, modules exhibit a
small, sequential state transition system, aiding verification. Space deals
with communication, scheduling, and resource contention issues in parallel
computing, by resolving them explicitly in an incremental manner, module by
module, whilst ascending the ladder of abstraction. Whilst the Synchronic A-Ram
model was inspired by linguistic considerations, it is also put forward as a
formal model for reconfigurable digital circuits. A programming environment has
been developed, that incorporates a simulator and compiler that transform Space
programs into Synchronic A-Ram machine code, consisting of only three bit-level
instructions, and a marking instruction. Space and the Synchronic A-Ram point
to novel routes out of the parallel computing crisis.
","[{'version': 'v1', 'created': 'Tue, 10 Aug 2010 09:46:21 GMT'}, {'version': 'v2', 'created': 'Sat, 28 Aug 2010 10:33:08 GMT'}]",2010-08-31,"[['Berka', 'Alex V', '']]","['Interlanguages', 'Space', 'Synchronic A-Ram']"
13209,1206.1552,Vasanth Kishorebabu Mr,K. Vasanth and V. Jawahar Senthil Kumar,"Performance Analysis of Unsymmetrical trimmed median as detector on
  image noises and its Fpga implementation","20 pages,17 images",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This Paper Analyze the performance of Unsymmetrical trimmed median, which is
used as detector for the detection of impulse noise, Gaussian noise and mixed
noise is proposed. The proposed algorithm uses a fixed 3x3 window for the
increasing noise densities. The pixels in the current window are arranged in
sorting order using a improved snake like sorting algorithm with reduced
comparator. The processed pixel is checked for the occurrence of outliers, if
the absolute difference between processed pixels is greater than fixed
threshold. Under high noise densities the processed pixel is also noisy hence
the median is checked using the above procedure. if found true then the pixel
is considered as noisy hence the corrupted pixel is replaced by the median of
the current processing window. If median is also noisy then replace the
corrupted pixel with unsymmetrical trimmed median else if the pixel is termed
uncorrupted and left unaltered. The proposed algorithm (PA) is tested on
varying detail images for various noises. The proposed algorithm effectively
removes the high density fixed value impulse noise, low density random valued
impulse noise, low density Gaussian noise and lower proportion of mixed noise.
The proposed algorithm is targeted on Xc3e5000-5fg900 FPGA using Xilinx 7.1
compiler version which requires less number of slices, optimum speed and low
power when compared to the other median finding architectures.
","[{'version': 'v1', 'created': 'Thu, 7 Jun 2012 16:49:36 GMT'}]",2012-06-08,"[['Vasanth', 'K.', ''], ['Kumar', 'V. Jawahar Senthil', '']]","['Snake like sorting', 'Trimmed filters', 'Impulse noise', 'Gaussian noise', 'field programmable gate array']"
13210,1402.5748,Aarti,"Aarti, Sanjiv Kumar Tomar",A Parametric Chain based Routing Approach for Underwater Sensor Network,"4 pages,1 figure","International Journal of Computer Trends and Technology (IJCTT) ,
  4(1): 1492-1495, May 2013, Published by Seventh Sense Research Group",,,cs.NI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A sensor network is one of the critical networks that is based on hardware
components as well the energy parameters. Because of this, such network
requires the optimization in all kind communication to improve the network
life. In case of underwater sensor network, the criticality of network is also
increased because of the random floating movement of the nodes. In this work, a
composition of the multicast or broadcast communication is presented by the
generation of aggregative path. The presented work is about to define a new
chain based aggregative routing approach to provide the effective communication
over the network. In this work, an effective aggregative path is suggested
under the different parameters of energy, distance and congestion analysis.
Based on these parameters a trustful aggregative route will be generated so
that the network life will be improved.
","[{'version': 'v1', 'created': 'Mon, 24 Feb 2014 08:44:46 GMT'}]",2014-02-25,"[['Aarti', '', ''], ['Tomar', 'Sanjiv Kumar', '']]","['Underwater WSN', 'Aggregative Path', 'Congestion Free', 'Effective Routing']"
13211,1605.02894,Jinming Wen,"Jinming Wen, Zhengchun Zhou, Zilong Liu, Ming-Jun Lai, and Xiaohu Tang","Sharp Sufficient Conditions for Stable Recovery of Block Sparse Signals
  by Block Orthogonal Matching Pursuit","to appear in Applied and Computational Harmonic Analysis,
  https://doi.org/10.1016/j.acha.2018.02.002",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we use the block orthogonal matching pursuit (BOMP) algorithm
to recover block sparse signals $\x$ from measurements $\y=\A\x+\v$, where $\v$
is an $\ell_2$-bounded noise vector (i.e., $\|\v\|_2\leq \epsilon$ for some
constant $\epsilon$). We investigate some sufficient conditions based on the
block restricted isometry property (block-RIP) for exact (when $\v=\0$) and
stable (when $\v\neq\0$) recovery of block sparse signals $\x$. First, on the
one hand, we show that if $\A$ satisfies the block-RIP with
$\delta_{K+1}<1/\sqrt{K+1}$, then every block $K$-sparse signal $\x$ can be
exactly or stably recovered by BOMP in $K$ iterations. On the other hand, we
show that, for any $K\geq 1$ and $1/\sqrt{K+1}\leq \delta<1$, there exists a
matrix $\A$ satisfying the block-RIP with $\delta_{K+1}=\delta$ and a block
$K$-sparse signal $\x$ such that BOMP may fail to recover $\x$ in $K$
iterations. Then, we study some sufficient conditions for recovering block
$\alpha$-strongly-decaying $K$-sparse signals. We show that if $\A$ satisfies
the block-RIP with $\delta_{K+1}<\sqrt{2}/2$, then every
$\alpha$-strongly-decaying block $K$-sparse signal can be exactly or stably
recovered by BOMP in $K$ iterations under some conditions on $\alpha$. Our
newly found sufficient condition on the block-RIP of $\A$ is less restrictive
than that for $\ell_1$ minimization for this special class of sparse signals.
Furthermore, for any $K\geq 1$, $\alpha>1$ and $\sqrt{2}/2\leq \delta<1$, the
recovery of $\x$ may fail in $K$ iterations for a sensing matrix $\A$ which
satisfies the block-RIP with $\delta_{K+1}=\delta$. Finally, we study some
sufficient conditions for partial recovery of block sparse signals.
Specifically, if $\A$ satisfies the block-RIP with $\delta_{K+1}<\sqrt{2}/2$,
then BOMP is guaranteed to recover some blocks of $\x$ if these blocks satisfy
a sufficient condition.
","[{'version': 'v1', 'created': 'Tue, 10 May 2016 09:03:30 GMT'}, {'version': 'v2', 'created': 'Mon, 14 May 2018 20:44:25 GMT'}]",2018-05-16,"[['Wen', 'Jinming', ''], ['Zhou', 'Zhengchun', ''], ['Liu', 'Zilong', ''], ['Lai', 'Ming-Jun', ''], ['Tang', 'Xiaohu', '']]","['Compressed sensing', 'block restricted isometry property', 'block orthogonal matchingpursuit', 'block sparse signals', 'α-strongly-decaying']"
13212,1606.03549,Diane Strode,Diane Strode,Applying Adapted Big Five Teamwork Theory to Agile Software Development,"ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
  Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/237,cs.CY cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Teamwork is a central tenet of agile software development and various
teamwork theories partially explain teamwork in that context. Big Five teamwork
theory is one of the most influential teamwork theories, but prior research
shows that the team leadership concept in this theory it is not applicable to
agile software development. This paper applies an adapted form of Big Five
teamwork theory to cases of agile software development. Three independent cases
were drawn from a single organisation. This ensured a measure of control over
contextual factors affecting the teamwork. The findings show that the adapted
form of Big Five teamwork theory, including a shared team leadership concept,
is fully applicable to some forms of agile software development, but not all.
For practitioners, insights as to which agile practices support teamwork are
provided.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 04:07:30 GMT'}]",2016-06-14,"[['Strode', 'Diane', '']]","['Agile software development', 'Agile methods', 'Autonomous teams', 'Big Five teamwork theory Empowered teams', 'Self-managing teams', 'Self-organising teams', 'Scrum']"
13213,1409.5092,Elarbi Elalaouy,"El-arbi El-alaouy, Khadija Rhoulami",Survey Management Web Platform Applied to Morocco Household Survey Panel,,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CSPro (Census and Survey Processing System) is a software package used
recently in many large scale surveys for data collection. This software often
used as desktop software has been used for the first time as a web service for
resolving some problems encountered in the first wave of the Morocco Household
Panel Survey (MHSP). The article will outline the Survey Management Web
Platform that has been developed based on web 2.0 technologies for both
integrating the CSPro web service control and centralizing the data files
collection from survey fields.
  Keywords: CSPro, Data collection, Survey Panel, Web Platform, Web Service,
UML
","[{'version': 'v1', 'created': 'Wed, 17 Sep 2014 18:20:01 GMT'}]",2014-09-19,"[['El-alaouy', 'El-arbi', ''], ['Rhoulami', 'Khadija', '']]","['CSPro', 'Data collection', 'Survey Panel', 'Web Platform', 'Web Service', 'UML']"
13214,1110.0070,Kardile Vilas Vasantrao,Kardile Vilas Vasantrao,"Enhance accuracy in Software cost and schedule estimation by using
  ""Uncertainty Analysis and Assessment"" in the system modeling process","9 pages,4 fig,4 tabel. arXiv admin note: substantial text overlap
  with arXiv:1108.1461","International Journal of Research and Innovation in Computer
  Engineering (IJRICE) ISSN 2249 - 6580IJRICE - Volume 1, Issue 1, August 2011",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate software cost and schedule estimation are essential for software
project success. Often it referred to as the ""black art"" because of its
complexity and uncertainty, software estimation is not as difficult or puzzling
as people think. In fact, generating accurate estimates is straightforward-once
you understand the intensity of uncertainty and framework for the modeling
process. The mystery to successful software estimation-distilling academic
information and real-world experience into a practical guide for working
software professionals. Instead of arcane treatises and rigid modeling
techniques, this will guide highlights a proven set of procedures,
understandable formulas, and heuristics that individuals and development teams
can apply to their projects to help achieve estimation proficiency with choose
appropriate development approaches In the early stage of software life cycle
project manager are inefficient to estimate the effort, schedule, cost
estimation and its development approach .This in turn, confuses the manager to
bid effectively on software project and choose incorrect development approach.
That will directly effect on productivity cycle and increase level of
uncertainty. This becomes a strong cause of project failure. So to avoid such
problem if we know level and sources of uncertainty in model design, It will
directive the developer to design accurate software cost and schedule
estimation, which are essential for software project success. However once the
required efforts have estimated, little is done to recalibrate and reduce the
uncertainty of the initial estimates.
","[{'version': 'v1', 'created': 'Sat, 1 Oct 2011 04:28:36 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Jan 2012 16:11:51 GMT'}]",2012-01-16,"[['Vasantrao', 'Kardile Vilas', '']]","['software development approach', 'Uncertainty', 'Uncertainty sources', 'Uncertainty matrix']"
13215,0709.0677,Binhai Zhu,Binhai Zhu,"On the Complexity of Protein Local Structure Alignment Under the
  Discrete Fr\'echet Distance","11 pages, 2 figures",,,,cs.CC cs.DS,,"  We show that given $m$ proteins (or protein backbones, which are modeled as
3D polygonal chains each of length O(n)) the problem of protein local structure
alignment under the discrete Fr\'{e}chet distance is as hard as Independent
Set. So the problem does not admit any approximation of factor
$n^{1-\epsilon}$. This is the strongest negative result regarding the protein
local structure alignment problem. On the other hand, if $m$ is a constant,
then the problem can be solved in polygnomial time.
","[{'version': 'v1', 'created': 'Wed, 5 Sep 2007 15:30:54 GMT'}]",2007-09-06,"[['Zhu', 'Binhai', '']]","['Protein structure alignment', 'Fr´echet distance', 'Discrete Fr´echet distance', 'Approxima']"
13216,1705.05326,Michael Huth,Paul Beaumont and Michael Huth,"Constrained Bayesian Networks: Theory, Optimization, and Applications","43 pages, 18 figures",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop the theory and practice of an approach to modelling and
probabilistic inference in causal networks that is suitable when
application-specific or analysis-specific constraints should inform such
inference or when little or no data for the learning of causal network
structure or probability values at nodes are available. Constrained Bayesian
Networks generalize a Bayesian Network such that probabilities can be symbolic,
arithmetic expressions and where the meaning of the network is constrained by
finitely many formulas from the theory of the reals. A formal semantics for
constrained Bayesian Networks over first-order logic of the reals is given,
which enables non-linear and non-convex optimisation algorithms that rely on
decision procedures for this logic, and supports the composition of several
constrained Bayesian Networks. A non-trivial case study in arms control, where
few or no data are available to assess the effectiveness of an arms inspection
process, evaluates our approach. An open-access prototype implementation of
these foundations and their algorithms uses the SMT solver Z3 as decision
procedure, leverages an open-source package for Bayesian inference to symbolic
computation, and is evaluated experimentally.
","[{'version': 'v1', 'created': 'Mon, 15 May 2017 16:48:12 GMT'}]",2017-05-16,"[['Beaumont', 'Paul', ''], ['Huth', 'Michael', '']]","['Bayesian Belief Network', 'Imprecise Probabilities', 'Lack of Prior Data', 'NonLinear Optimization', 'Confidence Building in Nuclear Arms Control']"
13217,1109.2477,Daniel Dadush,Daniel Dadush,"A O(1/eps^2)^n Time Sieving Algorithm for Approximate Integer
  Programming",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Integer Programming Problem (IP) for a polytope P \subseteq R^n is to
find an integer point in P or decide that P is integer free. We give an
algorithm for an approximate version of this problem, which correctly decides
whether P contains an integer point or whether a (1+\eps) scaling of P around
its barycenter is integer free in time O(1/\eps^2)^n. We reduce this
approximate IP question to an approximate Closest Vector Problem (CVP) in a
""near-symmetric"" semi-norm, which we solve via a sieving technique first
developed by Ajtai, Kumar, and Sivakumar (STOC 2001). Our main technical
contribution is an extension of the AKS sieving technique which works for any
near-symmetric semi-norm. Our results also extend to general convex bodies and
lattices.
","[{'version': 'v1', 'created': 'Mon, 12 Sep 2011 14:19:29 GMT'}, {'version': 'v2', 'created': 'Fri, 30 Sep 2011 03:03:03 GMT'}]",2011-10-03,"[['Dadush', 'Daniel', '']]","['Integer Programming', 'Shortest Vector Problem', 'Closest Vector Problem']"
13218,1005.1925,Wojciech Mazurczyk,"Bartosz Jankowski, Wojciech Mazurczyk, Krzysztof Szczypiorski",Information Hiding Using Improper Frame Padding,"6 pages, 8 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hiding information in network traffic may lead to leakage of confidential
information. In this paper we introduce a new steganographic system: the
PadSteg (Padding Steganography). To authors' best knowledge it is the first
information hiding solution which represents interprotocol steganography i.e.
usage of relation between two or more protocols from the TCP/IP stack to enable
secret communication. PadSteg utilizes ARP and TCP protocols together with an
Etherleak vulnerability (improper Ethernet frame padding) to facilitate secret
communication for hidden groups in LANs (Local Area Networks). Basing on real
network traces we confirm that PadSteg is feasible in today's networks and we
estimate what steganographic bandwidth is achievable while limiting the chance
of disclosure. We also point at possible countermeasures against PadSteg.
","[{'version': 'v1', 'created': 'Tue, 11 May 2010 19:59:59 GMT'}, {'version': 'v2', 'created': 'Mon, 5 Jul 2010 19:58:52 GMT'}]",2010-07-06,"[['Jankowski', 'Bartosz', ''], ['Mazurczyk', 'Wojciech', ''], ['Szczypiorski', 'Krzysztof', '']]","['steganography', 'ARP', 'frame padding', 'Etherleak']"
13219,1306.4779,Firas Ajil Jassim,"Fawzi H. Altaany, Firas A. Jassim","Impact of Facebook Usage on Undergraduate Students Performance in Irbid
  National University: Case Study","6 pages, 10 tables","International Journal of Engineering Research and Applications
  (IJERA), Vol. 3, Issue 4, 2013",,,cs.CY,http://creativecommons.org/licenses/by/3.0/,"  The aim of this study is to investigate the style of Facebook usage between
undergraduate students and the impact on their academics performance. Also,
this paper was evaluated in the view of student the using of Facebook. A
questioner was design for collecting data from a sample of 480 undergraduate
students in Irbid National University. The survey revealed that 77% of the
students have an account on Facebook. One of the main findings is that there
was a significant relationship between gender and Facebook usage. Moreover, the
survey revealed that whenever the less time spent on Facebook, the higher the
performance will be in grade point average. This was conducted by the negative
correlation between time spent on Facebook and the performance of undergraduate
student. Statistically speaking, the study has seven hypotheses; two of them
were rejecting against five acceptable hypotheses.
","[{'version': 'v1', 'created': 'Thu, 20 Jun 2013 08:17:14 GMT'}]",2013-06-21,"[['Altaany', 'Fawzi H.', ''], ['Jassim', 'Firas A.', '']]","['Facebook usage', 'social networks', 'student performance']"
13220,1212.5461,Christopher Simons,"Christopher L. Simons, Jim Smith and Paul White","Interactive Ant Colony Optimisation (iACO) for Early Lifecycle Software
  Design",31 pages including appendices,,,,cs.SE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software design is crucial to successful software development, yet is a
demanding multi-objective problem for software engineers. In an attempt to
assist the software designer, interactive (i.e. human in-the-loop)
meta-heuristic search techniques such as evolutionary computing have been
applied and show promising results. Recent investigations have also shown that
Ant Colony Optimization (ACO) can outperform evolutionary computing as a
potential search engine for interactive software design. With a limited
computational budget, ACO produces superior candidate design solutions in a
smaller number of iterations. Building on these findings, we propose a novel
interactive ACO (iACO) approach to assist the designer in early lifecycle
software design, in which the search is steered jointly by subjective designer
evaluation as well as machine fitness functions relating the structural
integrity and surrogate elegance of software designs. Results show that iACO is
speedy, responsive and highly effective in enabling interactive, dynamic
multi-objective search in early lifecycle software design. Study participants
rate the iACO search experience as compelling. Results of machine learning of
fitness measure weightings indicate that software design elegance does indeed
play a significant role in designer evaluation of candidate software design. We
conclude that the evenness of the number of attributes and methods among
classes (NAC) is a significant surrogate elegance measure, which in turn
suggests that this evenness of distribution, when combined with structural
integrity, is an implicit but crucial component of effective early lifecycle
software design.
","[{'version': 'v1', 'created': 'Fri, 21 Dec 2012 14:31:42 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Jun 2014 10:52:48 GMT'}]",2014-06-24,"[['Simons', 'Christopher L.', ''], ['Smith', 'Jim', ''], ['White', 'Paul', '']]","['Ant Colony Optimization', 'Software Design', 'Interactive Search']"
13221,1401.2657,Vincenzo De Florio,"Hong Sun, Vincenzo De Florio, Ning Gui and Chris Blondia","The Missing Ones: Key Ingredients Towards Effective Ambient Assisted
  Living Systems",,"Journal of Ambient Intelligence and Smart Environments, Volume 2
  Issue 2, April 2010 Pages 109-120 IOS Press Amsterdam, The Netherlands, The
  Netherlands",,,cs.CY cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The population of elderly people keeps increasing rapidly, which becomes a
predominant aspect of our societies. As such, solutions both efficacious and
cost-effective need to be sought. Ambient Assisted Living (AAL) is a new
approach which promises to address the needs from elderly people. In this
paper, we claim that human participation is a key ingredient towards effective
AAL systems, which not only saves social resources, but also has positive
relapses on the psychological health of the elderly people. Challenges in
increasing the human participation in ambient assisted living are discussed in
this paper and solutions to meet those challenges are also proposed. We use our
proposed mutual assistance community, which is built with service oriented
approach, as an example to demonstrate how to integrate human tasks in AAL
systems. Our preliminary simulation results are presented, which support the
effectiveness of human participation.
","[{'version': 'v1', 'created': 'Sun, 12 Jan 2014 18:51:43 GMT'}]",2014-01-14,"[['Sun', 'Hong', ''], ['De Florio', 'Vincenzo', ''], ['Gui', 'Ning', ''], ['Blondia', 'Chris', '']]","['Ambient Assisted Living', 'Ambient Intelligence', 'Mutual Assistance Community']"
13222,1401.1347,"Matthias W\""ahlisch","Cristian Chilipirea, Andreea-Cristina Petre, Ciprian Dobre",MANIAC Challenge: The Wolf-pack strategy,"Published in: E. Baccelli, F. Juraschek, O. Hahm, T. C. Schmidt, H.
  Will, M. W\""ahlisch (Eds.), Proc. of 3rd MANIAC Challenge, Berlin, Germany,
  July 27 - 28, 2013, arXiv:1401.1163, Jan. 2014",,,MANIAC/2013/03,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  MANIAC Challenge raises a problem of game theory, different players
strategies intertwine and the success of any player is dependent on the actions
of all players in the system. A truly fair scenario is when all the strategies
are identical, all the nodes co-operate and they all equally share the rewards
and risks that come with every transfer. A successful strategy is one that
tries to diverge from the equilibrium to maximize its own gains and it manages
to do so. We propose the wolf-pack strategy. Unlike standard game-theory based
strategies, our strategy does not penalize the nodes that diverge from fairness
or from equilibrium, as we believe most nodes will do so in an attempt to get
an advantage over the other nodes. The wolf-pack strategy will try to always
find the most successful node or nodes and penalize them. We believe that just
like in nature, a number of small predators can take down the bigger, more
profitable ones. Furthermore during the Challenge we test two different
strategies that provide completely opposite results. These offer a clear
picture of what the best strategy is and the problems of the current system.
","[{'version': 'v1', 'created': 'Tue, 7 Jan 2014 11:44:45 GMT'}]",2014-01-08,"[['Chilipirea', 'Cristian', ''], ['Petre', 'Andreea-Cristina', ''], ['Dobre', 'Ciprian', '']]","['game theory', 'trust', 'ad-hoc networks', 'fairness']"
13223,1310.0575,Nisheeth Joshi,"Jyoti Singh, Nisheeth Joshi, Iti Mathur",Development of Marathi Part of Speech Tagger Using Statistical Approach,"In Proceedings of 2013 International Conference on Advances in
  Computing, Communications and Informatics",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Part-of-speech (POS) tagging is a process of assigning the words in a text
corresponding to a particular part of speech. A fundamental version of POS
tagging is the identification of words as nouns, verbs, adjectives etc. For
processing natural languages, Part of Speech tagging is a prominent tool. It is
one of the simplest as well as most constant and statistical model for many NLP
applications. POS Tagging is an initial stage of linguistics, text analysis
like information retrieval, machine translator, text to speech synthesis,
information extraction etc. In POS Tagging we assign a Part of Speech tag to
each word in a sentence and literature. Various approaches have been proposed
to implement POS taggers. In this paper we present a Marathi part of speech
tagger. It is morphologically rich language. Marathi is spoken by the native
people of Maharashtra. The general approach used for development of tagger is
statistical using Unigram, Bigram, Trigram and HMM Methods. It presents a clear
idea about all the algorithms with suitable examples. It also introduces a tag
set for Marathi which can be used for tagging Marathi text. In this paper we
have shown the development of the tagger as well as compared to check the
accuracy of taggers output. The three Marathi POS taggers viz. Unigram, Bigram,
Trigram and HMM gives the accuracy of 77.38%, 90.30%, 91.46% and 93.82%
respectively.
","[{'version': 'v1', 'created': 'Wed, 2 Oct 2013 06:04:53 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Oct 2013 10:57:37 GMT'}]",2013-10-10,"[['Singh', 'Jyoti', ''], ['Joshi', 'Nisheeth', ''], ['Mathur', 'Iti', '']]","['Part of Speech Tagging', 'Stochastic Tagging', 'Rule']"
13224,1506.02220,Hameer Abbasi,"Hameer Abbasi, Shahid H. Abbassi, Ijaz M. Qureshi","A framework for the simulation of CR-VANET channel sensing, coordination
  and allocation","20 pages, 13 figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  VANETs are considered as networks of critical future importance, with the
main concern being the safety of travelers and infrastructure. A lot of methods
for coordination and channel allocation in the context of VANETs are being
introduced. As such, the need of a framework to reliably compare the relative
performances of different channel sensing, allocation and coordination schemes
which takes into account the movement of vehicles is felt. In this paper, we
introduce a framework that can be used to define and compare such schemes in a
variety of scenarios. Simulation results clearly show the robustness of our
technique by eliminating the misdetections and reducing to a great extent the
false alarms.
","[{'version': 'v1', 'created': 'Sun, 7 Jun 2015 05:29:41 GMT'}]",2015-06-09,"[['Abbasi', 'Hameer', ''], ['Abbassi', 'Shahid H.', ''], ['Qureshi', 'Ijaz M.', '']]","['VANETs', 'CR', 'Allocation', 'Sensing', 'Coordination', 'PU', 'SU']"
13225,1607.02911,Genevieve Simonet,Anne Berry and Genevi\`eve Simonet,"Computing the atom graph of a graph and the union join graph of a
  hypergraph","Submitted in Algorithms on July 11, 2016",,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The atom graph of a graph is the graph whose vertices are the atoms obtained
by clique minimal separator decomposition of this graph, and whose edges are
the edges of all possible atom trees of this graph. We provide two efficient
algorithms for computing this atom graph, with a complexity in $O(min(n^\alpha
\log n, nm, n(n+\overline{m}))$ time, which is no more than the complexity of
computing the atoms in the general case. %\par We extend our results to
$\alpha$-acyclic hypergraphs. We introduce the notion of union join graph,
which is the union of all possible join trees; we apply our algorithms for atom
graphs to efficiently compute union join graphs.
  Keywords: clique separator decomposition, atom tree, atom graph, clique tree,
clique graph, $\alpha$-acyclic hypergraph.
","[{'version': 'v1', 'created': 'Mon, 11 Jul 2016 12:00:41 GMT'}]",2016-07-12,"[['Berry', 'Anne', ''], ['Simonet', 'Geneviève', '']]","['clique separator decomposition', 'atom tree', 'atom graph', 'clique tree', 'clique graph', 'α-acyclic hypergraph']"
13226,1506.04265,Vineet Kumar,"Sinjan Chakraborty, Vineet Kumar",A Study and Implementation of RSA Cryptosystem,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This project involves an implementation of the Rivest Shamir Adleman (RSA)
encryption algorithm in C. It consists of generation of two random prime
numbers and a number co- prime to phi(n) also called euler toitent function.
These three are used to generate a public key and private key. The user has to
enter a message which is encrypted by the public key. The algorithm also
decrypts the generated cipher text with the help of the private key and returns
the plain text message which was encrypted earlier.
","[{'version': 'v1', 'created': 'Sat, 13 Jun 2015 13:06:36 GMT'}]",2015-06-16,"[['Chakraborty', 'Sinjan', ''], ['Kumar', 'Vineet', '']]","['RSA', 'Public Key Cryptosystem', 'Asymmetric Key Cryptosystem', 'Cryptography', 'Security']"
13227,1610.03246,Ma\'isa Cristina Duarte,Maisa C. Duarte and Pierre Maret,Toward a new instances of NELL,"6 pages, 1 figure and 2 tables",,,,cs.CL,http://creativecommons.org/licenses/by-sa/4.0/,"  We are developing the method to start new instances of NELL in various
languages and develop then NELL multilingualism. We base our method on our
experience on NELL Portuguese and NELL French. This reports explain our method
and develops some research perspectives.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2016 09:19:06 GMT'}]",2016-10-12,"[['Duarte', 'Maisa C.', ''], ['Maret', 'Pierre', '']]","['Knowledge base', 'NELL', 'Text', 'Learning', 'Semantic Web', 'Human supervision']"
13228,1606.07623,Amjad Majid,"Henko Aantjes, Amjad Y. Majid, Przemys{\l}aw Pawe{\l}czak",A Testbed for Transiently Powered Computers,,,,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transiently Powered Computers (TPCs) are novel devices that are battery-less
and operate using only ambient energy. Therefore TPCs are prone to frequent
power interruptions, and such the need for developing TPC-centric algorithms is
a necessity. We advocate that only through a common experimental environment,
accessible to everyone, a proper comparison of newly developed algorithms for
TPCs can be realized. Moreover, only through access to various TPC
testbeds---distributed geographically throughout the world---a proper
applications testing and validation are possible. We enlist properties and
features that any TPC testbed should have, calling for more coordinated action
in this domain of TPC research. Finally, we present (to the best of our
knowledge) world's first Internet-accessible testbed for TPCs.
","[{'version': 'v1', 'created': 'Fri, 24 Jun 2016 09:55:19 GMT'}]",2016-06-27,"[['Aantjes', 'Henko', ''], ['Majid', 'Amjad Y.', ''], ['Pawełczak', 'Przemysław', '']]","['Transiently Powered Computers', 'Computational RFID', 'WISP', 'Testbed']"
13229,1207.4089,Mehrdad Gangeh,"Mehrdad J. Gangeh, Robert P. W. Duin, Bart M. ter Haar Romeny, Mohamed
  S. Kamel",A Two-Stage Combined Classifier in Scale Space Texture Classification,28 pages,,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Textures often show multiscale properties and hence multiscale techniques are
considered useful for texture analysis. Scale-space theory as a biologically
motivated approach may be used to construct multiscale textures. In this paper
various ways are studied to combine features on different scales for texture
classification of small image patches. We use the N-jet of derivatives up to
the second order at different scales to generate distinct pattern
representations (DPR) of feature subsets. Each feature subset in the DPR is
given to a base classifier (BC) of a two-stage combined classifier. The
decisions made by these BCs are combined in two stages over scales and
derivatives. Various combining systems and their significances and differences
are discussed. The learning curves are used to evaluate the performances. We
found for small sample sizes combining classifiers performs significantly
better than combining feature spaces (CFS). It is also shown that combining
classifiers performs better than the support vector machine on CFS in
multiscale texture classification.
","[{'version': 'v1', 'created': 'Tue, 17 Jul 2012 19:05:18 GMT'}]",2015-03-20,"[['Gangeh', 'Mehrdad J.', ''], ['Duin', 'Robert P. W.', ''], ['Romeny', 'Bart M. ter Haar', ''], ['Kamel', 'Mohamed S.', '']]","['classifier design and evaluation', 'scale space', 'multiresolution', 'multipleclassifier systems', 'texture']"
13230,1502.04798,Nguyen Cuong Ha Huy,"Ha Huy Cuong Nguyen, Van Thuan Dang, Van Son Le","Technical solutions to resources allocation for distributed virtual
  machine systems","International Journal of Computer Science and Telecommunications
  www.ijcst.org, International Journal of Computer Science and Information
  Security - 2015",,,ID: 30011511,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Virtual machine is built on group of real servers which are scattered
globally and connect together through the telecommunications systems, it has an
increasingly important role in the operation, providing the ability to exploit
virtual resources. The latest technique helps to use computing resources more
effectively and has many benefits, such as cost reduction of power, cooling
and, hence, contributes to the Green Computing. To ensure the supply of these
resources to demand processes correctly and promptly, avoiding any duplication
or conflict, especially remote resources, it is necessary to study and propose
a reliable solution appropriate to be the foundation for internal control
systems in the cloud. In the scope of this paper, we find a way to produce
efficient distributed resources which emphasizes solutions preventing deadlock
and proposing methods to avoid resource shortage issue. With this approach, the
outcome result is the checklist of re-sources state which has the possibility
of deadlock and lack of resources, by sending messages to the servers, the
server would know the situation and have corresponding reaction.
","[{'version': 'v1', 'created': 'Mon, 16 Feb 2015 11:28:30 GMT'}]",2015-02-18,"[['Nguyen', 'Ha Huy Cuong', ''], ['Dang', 'Van Thuan', ''], ['Le', 'Van Son', '']]","['Virtual machine', 'best-effort', 'lease', 'deadlock detection', 'distributed environments', 'virtual resources']"
13231,1607.00607,Asef Pourmasoumi,Asef Pourmasoumi and Ebrahim Bagheri,Business Process Mining,"8 pages,6 figures",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the most valuable assets of an organization is its organizational
data. The analysis and mining of this potential hidden treasure can lead to
much added-value for the organization. Process mining is an emerging area that
can be useful in helping organizations understand the status quo, check for
compliance and plan for improving their processes. The aim of process mining is
to extract knowledge from event logs of today's organizational information
systems. Process mining includes three main types: discovering process models
from event logs, conformance checking and organizational mining. In this paper,
we briefly introduce process mining and review some of its most important
techniques. Also, we investigate some of the applications of process mining in
industry and present some of the most important challenges that are faced in
this area.
","[{'version': 'v1', 'created': 'Sun, 3 Jul 2016 07:41:28 GMT'}]",2016-07-05,"[['Pourmasoumi', 'Asef', ''], ['Bagheri', 'Ebrahim', '']]","['Business process mining', 'process discovery', 'conformance checking', 'organizational mining', 'process improvement']"
13232,1511.05223,Sebastian Trimpe,Sebastian Trimpe,Distributed Event-based State Estimation,"Technical report, 16 pages, 10 figures, minor updates",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An event-based state estimation approach for reducing communication in a
networked control system is proposed. Multiple distributed
sensor-actuator-agents observe a dynamic process and sporadically exchange
their measurements and inputs over a bus network. Based on these data, each
agent estimates the full state of the dynamic system, which may exhibit
arbitrary inter-agent couplings. Local event-based protocols ensure that data
is transmitted only when necessary to meet a desired estimation accuracy. This
event-based scheme is shown to mimic a centralized Luenberger observer design
up to guaranteed bounds, and stability is proven in the sense of bounded
estimation errors for bounded disturbances. The stability result extends to the
distributed control system that results when the local state estimates are used
for distributed feedback control. Simulation results highlight the benefit of
the event-based approach over classical periodic ones in reducing communication
requirements.
","[{'version': 'v1', 'created': 'Mon, 16 Nov 2015 23:41:38 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Jan 2017 22:21:36 GMT'}]",2017-01-30,"[['Trimpe', 'Sebastian', '']]","['Event-based estimation', 'distributed estimation', 'state observers', 'networked control systems']"
13233,0908.2509,Mounita Saha,"Mounita Saha, Dipanwita Roy Chowdhury","A Secure and Efficient Protocol for Group Key agreement in Heterogeneous
  Environment","9 pages, 3 figures, Conference paper in Secrypt 2009",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Secure group communication in heterogeneous environment is gaining popularity
due to the advent of wireless and ubiquitous computing. Although a number of
protocols for group key agreement have been proposed, most of them are not
applicable in heterogeneous environment where a number of computationally
limited nodes coexist with one or more computationally efficient nodes. Among
the few existing protocols, where some fail to satisfy the key agreement
properties, some are unable to handle the agreement for dynamic group. In this
work, we propose a constant round group key agreement protocol for
heterogeneous environment using polynomial interpolation. The protocol ensures
both communication and computation efficiency by shifting the major computation
load on powerful users, achieves true contributory key agreement property and
dynamic handling of user join and leave. The security of the protocol has been
analyzed under formal model. The comparison result shows considerable
improvement in protocol efficiency compared to the existing ones.
","[{'version': 'v1', 'created': 'Tue, 18 Aug 2009 07:34:17 GMT'}]",2009-08-19,"[['Saha', 'Mounita', ''], ['Chowdhury', 'Dipanwita Roy', '']]","['Group key agreement', 'Heterogeneous environment', 'Hierarchical key agreement', 'Provable security']"
13234,1301.1575,Anna Pyayt,"Anna Pyayt, Michael Gubanov",BigDB: Automatic Machine Learning Optimizer,,,,,cs.DB,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this short vision paper, we introduce a machine learning optimizer for
data management and describe its architecture and main functionality.
","[{'version': 'v1', 'created': 'Sun, 6 Jan 2013 04:03:29 GMT'}]",2013-01-09,"[['Pyayt', 'Anna', ''], ['Gubanov', 'Michael', '']]","['Data management', 'machine learning', 'optimizer']"
13235,1501.02516,Hossein Shokri Ghadikolaei,Hossein Shokri-Ghadikolaei and Lazaros Gkatzikis and Carlo Fischione,"Beam-searching and Transmission Scheduling in Millimeter Wave
  Communications","5 figures, 7 pages, accepted in ICC 2015",,,,cs.IT cs.PF math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Millimeter wave (mmW) wireless networks are capable to support multi-gigabit
data rates, by using directional communications with narrow beams. However,
existing mmW communications standards are hindered by two problems: deafness
and single link scheduling. The deafness problem, that is, a misalignment
between transmitter and receiver beams, demands a time consuming beam-searching
operation, which leads to an alignment-throughput tradeoff. Moreover, the
existing mmW standards schedule a single link in each time slot and hence do
not fully exploit the potential of mmW communications, where directional
communications allow multiple concurrent transmissions. These two problems are
addressed in this paper, where a joint beamwidth selection and power allocation
problem is formulated by an optimization problem for short range mmW networks
with the objective of maximizing effective network throughput. This
optimization problem allows establishing the fundamental alignment-throughput
tradeoff, however it is computationally complex and requires exact knowledge of
network topology, which may not be available in practice. Therefore, two
standard-compliant approximation solution algorithms are developed, which rely
on underestimation and overestimation of interference. The first one exploits
directionality to maximize the reuse of available spectrum and thereby
increases the network throughput, while imposing almost no computational
complexity. The second one is a more conservative approach that protects all
active links from harmful interference, yet enhances the network throughput by
100% compared to the existing standards. Extensive performance analysis
provides useful insights on the directionality level and the number of
concurrent transmissions that should be pursued. Interestingly, extremely
narrow beams are in general not optimal.
","[{'version': 'v1', 'created': 'Mon, 12 Jan 2015 01:06:14 GMT'}]",2015-01-13,"[['Shokri-Ghadikolaei', 'Hossein', ''], ['Gkatzikis', 'Lazaros', ''], ['Fischione', 'Carlo', '']]","['Directional communications', 'mmW networks', 'concurrent transmissions', 'deafness', 'spectral efficiency']"
13236,1312.5515,Marek Kurdej,"Marek Kurdej (HEUDIASYC), V\'eronique Cherfaoui (HEUDIASYC)","Conservative, Proportional and Optimistic Contextual Discounting in the
  Belief Functions Theory",7 pages,"16th International Conference on Information Fusion, Istanbul :
  Turkey (2013)",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information discounting plays an important role in the theory of belief
functions and, generally, in information fusion. Nevertheless, neither
classical uniform discounting nor contextual cannot model certain use cases,
notably temporal discounting. In this article, new contextual discounting
schemes, conservative, proportional and optimistic, are proposed. Some
properties of these discounting operations are examined. Classical discounting
is shown to be a special case of these schemes. Two motivating cases are
discussed: modelling of source reliability and application to temporal
discounting.
","[{'version': 'v1', 'created': 'Thu, 19 Dec 2013 12:40:25 GMT'}]",2013-12-20,"[['Kurdej', 'Marek', '', 'HEUDIASYC'], ['Cherfaoui', 'Véronique', '', 'HEUDIASYC']]","['contextual discounting', 'temporal discounting', 'discounting', 'belief functions', 'Dempster-Shafer theory', 'evidence theory', 'contextual fusion']"
13237,1305.1596,Alessandro Andrioni,Alessandro Andrioni,"A Clifford Algebra approach to the Discretizable Molecular Distance
  Geometry Problem",extended abstract with four pages,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Discretizable Molecular Distance Geometry Problem (DMDGP) consists in a
subclass of the Molecular Distance Geometry Problem for which an embedding in
${\mathbb{R}^3}$ can be found using a Branch & Prune (BP) algorithm in a
discrete search space. We propose a Clifford Algebra model of the DMDGP with an
accompanying version of the BP algorithm.
","[{'version': 'v1', 'created': 'Sat, 4 May 2013 00:20:12 GMT'}]",2013-05-08,"[['Andrioni', 'Alessandro', '']]","['Distance geometry', 'Clifford algebra', 'Branch and prune']"
13238,1603.07210,Martin Hoefer,"Xiaohui Bei, Jugal Garg, Martin Hoefer, Kurt Mehlhorn",Computing Equilibria in Markets with Budget-Additive Utilities,21 pages,,,,cs.GT cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the first analysis of Fisher markets with buyers that have
budget-additive utility functions. Budget-additive utilities are elementary
concave functions with numerous applications in online adword markets and
revenue optimization problems. They extend the standard case of linear
utilities and have been studied in a variety of other market models. In
contrast to the frequently studied CES utilities, they have a global satiation
point which can imply multiple market equilibria with quite different
characteristics. Our main result is an efficient combinatorial algorithm to
compute a market equilibrium with a Pareto-optimal allocation of goods. It
relies on a new descending-price approach and, as a special case, also implies
a novel combinatorial algorithm for computing a market equilibrium in linear
Fisher markets. We complement these positive results with a number of hardness
results for related computational questions. We prove that it is NP-hard to
compute a market equilibrium that maximizes social welfare, and it is PPAD-hard
to find any market equilibrium with utility functions with separate satiation
points for each buyer and each good.
","[{'version': 'v1', 'created': 'Wed, 23 Mar 2016 14:53:44 GMT'}, {'version': 'v2', 'created': 'Sat, 30 Apr 2016 08:30:23 GMT'}]",2016-05-03,"[['Bei', 'Xiaohui', ''], ['Garg', 'Jugal', ''], ['Hoefer', 'Martin', ''], ['Mehlhorn', 'Kurt', '']]","['Budget-Additive Utility', 'Market Equilibrium', 'Equilibrium Computation']"
13239,1702.04478,Jian Liu,Jian Liu and Ying Jiang and Yanyun Chen and Qing Zhou,"VMDV: A 3D Visualization Tool for Modeling, Demonstration, and
  Verification",,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The output of an automated theorem prover is usually presented by using a
text format, they are often too heavy to be understood. In model checking
setting, it would be helpful if one can observe the structure of models and the
verification procedures. A 3D visualization tool (\textsf{VMDV}) is proposed in
this paper to address these problems. The facility of \vmdv is illustrated by
applying it to a proof systems.
","[{'version': 'v1', 'created': 'Wed, 15 Feb 2017 06:56:11 GMT'}]",2017-02-16,"[['Liu', 'Jian', ''], ['Jiang', 'Ying', ''], ['Chen', 'Yanyun', ''], ['Zhou', 'Qing', '']]","['3D Visualization', 'Proof System', 'Model Checking']"
13240,1209.5566,Neta Barkay,"Neta Barkay, Ely Porat, Bar Shalem",Feasible Sampling of Non-strict Turnstile Data Streams,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the first feasible method for sampling a dynamic data stream with
deletions, where the sample consists of pairs $(k,C_k)$ of a value $k$ and its
exact total count $C_k$. Our algorithms are for both Strict Turnstile data
streams and the most general Non-strict Turnstile data streams, where each
element may have a negative total count. Our method improves by an order of
magnitude the known processing time of each element in the stream, which is
extremely crucial for data stream applications. For example, for a sample of
size $O(\epsilon^{-2} \log{(1/\delta)})$ in Non-strict streams, our solution
requires $O((\log\log(1/\epsilon))^2 + (\log\log(1/\delta)) ^ 2)$ operations
per stream element, whereas the best previous solution requires
$O(\epsilon^{-2} \log^2(1/\delta))$ evaluations of a fully independent hash
function per element. Here $1-\delta$ is the success probability and $\epsilon$
is the additive approximation error.
  We achieve this improvement by constructing a single data structure from
which multiple elements can be extracted with very high success probability.
The sample we generate is useful for calculating both forward and inverse
distribution statistics, within an additive error, with provable guarantees on
the success probability. Furthermore, our algorithms can run on distributed
systems and extract statistics on the union or difference between data streams.
They can be used to calculate the Jaccard similarity coefficient as well.
","[{'version': 'v1', 'created': 'Tue, 25 Sep 2012 10:29:54 GMT'}]",2012-09-26,"[['Barkay', 'Neta', ''], ['Porat', 'Ely', ''], ['Shalem', 'Bar', '']]","['data streams', 'sampling', 'inverse distribution', 'Non-strict Turnstile']"
13241,1304.3307,Elena Pribavkina,"Vladimir V. Gusev, Marina I. Maslennikova, Elena V. Pribavkina",Principal ideal languages and synchronizing automata,"15 pages, 9 figures",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study ideal languages generated by a single word. We provide an algorithm
to construct a strongly connected synchronizing automaton for which such a
language serves as the language of synchronizing words. Also we present a
compact formula to calculate the syntactic complexity of this language.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2013 14:12:55 GMT'}]",2013-04-12,"[['Gusev', 'Vladimir V.', ''], ['Maslennikova', 'Marina I.', ''], ['Pribavkina', 'Elena V.', '']]","['ideal language', 'synchronizing automaton', 'synchronizing word', 'strongly connected automaton', 'syntactic complexity']"
13242,1312.4066,Perrot K\'evin,K\'evin Perrot and Eric R\'emila,Emergence of wave patterns on Kadanoff Sandpiles,"21 pages (including 9 pages of annexes). LATIN 2014. arXiv admin
  note: substantial text overlap with arXiv:1301.0997",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Emergence is a concept that is easy to exhibit, but very hard to formally
handle. This paper is about cubic sand grains moving around on nicely packed
columns in one dimension (the physical sandpile is two dimensional, but the
support of sand columns is one dimensional). The Kadanoff Sandpile Model is a
discrete dynamical system describing the evolution of a finite number of
stacked grains --as they would fall from an hourglass-- to a stable
configuration (fixed point). Grains move according to the repeated application
of a simple local rule until reaching a fixed point. The main interest of the
model relies in the difficulty of understanding its behavior, despite the
simplicity of the rule. In this paper we prove the emergence of wave patterns
periodically repeated on fixed points. Remarkably, those regular patterns do
not cover the entire fixed point, but eventually emerge from a seemingly highly
disordered segment. The proof technique we set up associates arguments of
linear algebra and combinatorics, which interestingly allow to formally state
the emergence of regular patterns without requiring a precise understanding of
the chaotic initial segment's dynamic.
","[{'version': 'v1', 'created': 'Sat, 14 Dec 2013 17:04:28 GMT'}]",2013-12-17,"[['Perrot', 'Kévin', ''], ['Rémila', 'Eric', '']]","['sandpile model', 'discrete dynamical system', 'emergence', 'fixed point']"
13243,1003.2123,Rob Van Son,R. J. J. H. van Son,Quantifying Shannon's Work Function for Cryptanalytic Attacks,19 pages,,,,cs.CR,http://creativecommons.org/licenses/by/3.0/,"  Attacks on cryptographic systems are limited by the available computational
resources. A theoretical understanding of these resource limitations is needed
to evaluate the security of cryptographic primitives and procedures. This study
uses an Attacker versus Environment game formalism based on computability logic
to quantify Shannon's work function and evaluate resource use in cryptanalysis.
A simple cost function is defined which allows to quantify a wide range of
theoretical and real computational resources. With this approach the use of
custom hardware, e.g., FPGA boards, in cryptanalysis can be analyzed. Applied
to real cryptanalytic problems, it raises, for instance, the expectation that
the computer time needed to break some simple 90 bit strong cryptographic
primitives might theoretically be less than two years.
","[{'version': 'v1', 'created': 'Wed, 10 Mar 2010 14:55:18 GMT'}]",2010-03-11,"[['van Son', 'R. J. J. H.', '']]","['computation', 'cryptanalysis', 'computational complexity']"
13244,1301.3862,David Heckerman,"David Heckerman, David Maxwell Chickering, Christopher Meek, Robert
  Rounthwaite, Carl Kadie",Dependency Networks for Collaborative Filtering and Data Visualization,"Appears in Proceedings of the Sixteenth Conference on Uncertainty in
  Artificial Intelligence (UAI2000)",,,UAI-P-2000-PG-264-273,cs.AI cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a graphical model for probabilistic relationships---an
alternative to the Bayesian network---called a dependency network. The graph of
a dependency network, unlike a Bayesian network, is potentially cyclic. The
probability component of a dependency network, like a Bayesian network, is a
set of conditional distributions, one for each node given its parents. We
identify several basic properties of this representation and describe a
computationally efficient procedure for learning the graph and probability
components from data. We describe the application of this representation to
probabilistic inference, collaborative filtering (the task of predicting
preferences), and the visualization of acausal predictive relationships.
","[{'version': 'v1', 'created': 'Wed, 16 Jan 2013 15:50:38 GMT'}]",2013-01-18,"[['Heckerman', 'David', ''], ['Chickering', 'David Maxwell', ''], ['Meek', 'Christopher', ''], ['Rounthwaite', 'Robert', ''], ['Kadie', 'Carl', '']]","['Dependency networks', 'graphical models', 'inference', 'data visualization', 'exploratory data analy\xadsis', 'collaborative filtering', 'Gibbs sampling']"
13245,1108.1334,Abdelhafid Abdelmalek,"Zohra Slimane, Abdelhafid Abdelmalek, Mohamed Feham and Abdelmalik
  Taleb-Ahmed","Secure and Robust IPV6 Autoconfiguration Protocol For Mobile Adhoc
  Networks Under Strong Adversarial Model",,"IJCNC, pp.208-227, Vol.3, No.4, July 2011",,,cs.NI cs.CR,http://creativecommons.org/licenses/by/3.0/,"  Automatic IP address assignment in Mobile Ad hoc Networks (MANETs) enables
nodes to obtain routable addresses without any infrastructure. Different
protocols have been developed throughout the last years to achieve this
service. However, research primarily focused on correctness, efficiency and
scalability; much less attention has been given to the security issues. The
lack of security in the design of such protocols opens the possibility of many
real threats leading to serious attacks in potentially hostile environments.
Recently, few schemes have been proposed to solve this problem, but none of
them has brought satisfactory solutions. Auto-configuration security issues are
still an open problem. In this paper, a robust and secure stateful IP address
allocation protocol for standalone MANETs is specified and evaluated within
NS2. Our solution is based on mutual authentication, and a fully distributed
Autoconfiguration and CA model, in conjunction with threshold cryptography. By
deploying a new concept of joint IP address and public key certificate, we show
that, instead of earlier approaches, our solution solves the problem of all
possible attacks associated with dynamic IP address assignment in MANETs. The
resulting protocol incurs low latency and control overhead
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2011 14:27:37 GMT'}]",2011-08-08,"[['Slimane', 'Zohra', ''], ['Abdelmalek', 'Abdelhafid', ''], ['Feham', 'Mohamed', ''], ['Taleb-Ahmed', 'Abdelmalik', '']]","['Mobile Ad hoc Networks', 'Auto-configuration', 'IP address', 'security', 'Threshold Cryptography', 'TCSAP', 'NS2']"
13246,1505.03078,Taha Arian,"Zeinab Ghafari, Taha Arian, Morteza Analoui",SFAMSS: a secure framework for atm machines via secret sharing,,,,,cs.CR,http://creativecommons.org/licenses/publicdomain/,"  As ATM applications deploy for a banking system, the need to secure
communications will become critical. However, multicast protocols do not fit
the point-to-point model of most network security protocols which were designed
with unicast communications in mind. In recent years, we have seen the
emergence and the growing of ATMs (Automatic Teller Machines) in banking
systems. Many banks are extending their activity and increasing transactions by
using ATMs. ATM will allow them to reach more customers in a cost effective way
and to make their transactions fast and efficient. However, communicating in
the network must satisfy integrity, privacy, confidentiality, authentication
and non-repudiation. Many frameworks have been implemented to provide security
in communication and transactions. In this paper, we analyze ATM communication
protocol and propose a novel framework for ATM systems that allows entities
communicate in a secure way without using a lot of storage. We describe the
architecture and operation of SFAMSS in detail. Our framework is implemented
with Java and the software architecture, and its components are studied in
detailed.
","[{'version': 'v1', 'created': 'Tue, 12 May 2015 16:15:56 GMT'}]",2015-05-13,"[['Ghafari', 'Zeinab', ''], ['Arian', 'Taha', ''], ['Analoui', 'Morteza', '']]","['ATM Security', 'Framework', 'Secret Sharing', 'Authentication', 'Protocol Design', 'Software Architecture']"
13247,1209.5836,Mina Farmanbar Ms,"Mina Farmanbar, Alexander G. Chefranov","Investigation of Hill Cipher Modifications Based on Permutation and
  Iteration",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two recent Hill cipher modifications which iteratively use interweaving and
interlacing are considered. We show that strength of these ciphers is due to
non-linear transformation used in them (bit-level permutations). Impact of
number of iterations on the avalanche effect is investigated. We propose two
Hill cipher modifications using column swapping and arbitrary permutation with
significantly less computational complexity (2 iterations are used versus 16).
The proposed modifications decrease encryption time while keeping the strength
of the ciphers. Numerical experiments for two proposed ciphers indicate that
they can provide a substantial avalanche effect.
","[{'version': 'v1', 'created': 'Wed, 26 Sep 2012 06:03:03 GMT'}]",2012-09-27,"[['Farmanbar', 'Mina', ''], ['Chefranov', 'Alexander G.', '']]","['Hill cipher', 'non-linear transformation', 'avalanche']"
13248,1412.6705,Daniel Dadush,"Daniel Dadush and Nicolai H\""ahnle",On the Shadow Simplex Method for Curved Polyhedra,,,,,cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the simplex method over polyhedra satisfying certain ""discrete
curvature"" lower bounds, which enforce that the boundary always meets vertices
at sharp angles. Motivated by linear programs with totally unimodular
constraint matrices, recent results of Bonifas et al (SOCG 2012), Brunsch and
R\""oglin (ICALP 2013), and Eisenbrand and Vempala (2014) have improved our
understanding of such polyhedra.
  We develop a new type of dual analysis of the shadow simplex method which
provides a clean and powerful tool for improving all previously mentioned
results. Our methods are inspired by the recent work of Bonifas and the first
named author (SODA 2015), who analyzed a remarkably similar process as part of
an algorithm for the Closest Vector Problem with Preprocessing.
  For our first result, we obtain a constructive diameter bound of
$O(\frac{n^2}{\delta} \ln \frac{n}{\delta})$ for $n$-dimensional polyhedra with
curvature parameter $\delta \in [0,1]$. For the class of polyhedra arising from
totally unimodular constraint matrices, this implies a bound of $O(n^3 \ln n)$.
For linear optimization, given an initial feasible vertex, we show that an
optimal vertex can be found using an expected $O(\frac{n^3}{\delta} \ln
\frac{n}{\delta})$ simplex pivots, each requiring $O(m n)$ time to compute. An
initial feasible solution can be found using $O(\frac{m n^3}{\delta} \ln
\frac{n}{\delta})$ pivot steps.
","[{'version': 'v1', 'created': 'Sat, 20 Dec 2014 23:19:09 GMT'}]",2014-12-23,"[['Dadush', 'Daniel', ''], ['Hähnle', 'Nicolai', '']]","['Optimization', 'Linear Programming', 'Simplex Method', 'Diameter of Polyhedra']"
13249,1401.2618,Deepali Virmani,"Deepali Virmani, Vikrant Malhotra, Ridhi Tyagi",Sentiment Analysis Using Collaborated Opinion Mining,"5 pages, 6 figures",,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Opinion mining and Sentiment analysis have emerged as a field of study since
the widespread of World Wide Web and internet. Opinion refers to extraction of
those lines or phrase in the raw and huge data which express an opinion.
Sentiment analysis on the other hand identifies the polarity of the opinion
being extracted. In this paper we propose the sentiment analysis in
collaboration with opinion extraction, summarization, and tracking the records
of the students. The paper modifies the existing algorithm in order to obtain
the collaborated opinion about the students. The resultant opinion is
represented as very high, high, moderate, low and very low. The paper is based
on a case study where teachers give their remarks about the students and by
applying the proposed sentiment analysis algorithm the opinion is extracted and
represented.
","[{'version': 'v1', 'created': 'Sun, 12 Jan 2014 12:35:57 GMT'}]",2014-01-14,"[['Virmani', 'Deepali', ''], ['Malhotra', 'Vikrant', ''], ['Tyagi', 'Ridhi', '']]","['opinion mining', 'sentiment analysis', 'opinion extraction', 'opinion summarization', 'collaborated opinion']"
13250,1205.1904,Thamer Ahmad Al-Rawashdeh,"Thamer A. Alrawashdeh, Mohammad I. Muhairat and Sokyna M. Alqatawnah","Factors affecting acceptance of web-based training system: Using
  extended UTAUT and structural equation modeling","this article includes 3 tales and 2 figures, International Journal of
  Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2,
  No.2, April 2012",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advancement in information system leads organizations to apply e-learning
system to train their employees in order to enhance its performance. In this
respect, applying web based training will enable the organization to train
their employees quickly, efficiently and effectively anywhere at any time. This
research aims to extend Unified Theory of Acceptance and Use Technology (UTAUT)
using some factors such flexibility of web based training system, system
interactivity and system enjoyment, in order to explain the employees'
intention to use web based training system. A total of 290 employees have
participated in this study. The findings of the study revealed that performance
expectancy, facilitating conditions, social influence and system flexibility
have direct effect on the employees' intention to use web based training
system, while effort expectancy, system enjoyment and system interactivity have
indirect effect on employees' intention to use the system.
","[{'version': 'v1', 'created': 'Wed, 9 May 2012 08:19:35 GMT'}]",2012-05-10,"[['Alrawashdeh', 'Thamer A.', ''], ['Muhairat', 'Mohammad I.', ''], ['Alqatawnah', 'Sokyna M.', '']]","['UTAUT', 'structural equation modeling', 'system enjoyment', 'system flexibility', 'system interactivity']"
13251,1011.1321,Xiaoxiao Yang,Xiaoxiao Yang,Probabilistic Model Checking for Propositional Projection Temporal Logic,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Propositional Projection Temporal Logic (PPTL) is a useful formalism for
reasoning about period of time in hardware and software systems and can handle
both sequential and parallel compositions. In this paper, based on discrete
time Markov chains, we investigate the probabilistic model checking approach
for PPTL towards verifying arbitrary linear-time properties. We first define a
normal form graph, denoted by NFG_inf, to capture the infinite paths of PPTL
formulas. Then we present an algorithm to generate the NFG_inf. Since
discrete-time Markov chains are the deterministic probabilistic models, we
further give an algorithm to determinize and minimize the nondeterministic
NFG_inf following the Safra's construction.
","[{'version': 'v1', 'created': 'Fri, 5 Nov 2010 04:28:32 GMT'}]",2010-11-08,"[['Yang', 'Xiaoxiao', '']]","['projection temporal logic', 'probabilistic model checking', 'Markovchains', 'normal form graph']"
13252,1603.01541,Dirk Roorda,Martijn Naaijer and Dirk Roorda,"Parallel Texts in the Hebrew Bible, New Methods and Visualizations","15 pages, 5 figures",,,,cs.CL,http://creativecommons.org/licenses/by-sa/4.0/,"  In this article we develop an algorithm to detect parallel texts in the
Masoretic Text of the Hebrew Bible. The results are presented online and
chapters in the Hebrew Bible containing parallel passages can be inspected
synoptically. Differences between parallel passages are highlighted. In a
similar way the MT of Isaiah is presented synoptically with 1QIsaa. We also
investigate how one can investigate the degree of similarity between parallel
passages with the help of a case study of 2 Kings 19-25 and its parallels in
Isaiah, Jeremiah and 2 Chronicles.
","[{'version': 'v1', 'created': 'Fri, 4 Mar 2016 17:11:51 GMT'}]",2016-03-07,"[['Naaijer', 'Martijn', ''], ['Roorda', 'Dirk', '']]","['Hebrew Bible', 'parallel texts', 'linguistic data', 'visualizations']"
13253,0903.5177,Shlomi Dolev,"Shlomi Dolev, Marina Kopeetsky, Adi Shamir","RFID Authentication, Efficient Proactive Information Security within
  Computational Security",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider repeated communication sessions between a RFID Tag (e.g., Radio
Frequency Identification, RFID Tag) and a RFID Verifier. A proactive
information theoretic security scheme is proposed. The scheme is based on the
assumption that the information exchanged during at least one of every n
successive communication sessions is not exposed to an adversary. The Tag and
the Verifier maintain a vector of n entries that is repeatedly refreshed by
pairwise xoring entries, with a new vector of n entries that is randomly chosen
by the Tag and sent to the Verifier as a part of each communication session.
The general case in which the adversary does not listen in k > 0 sessions among
any n successive communication sessions is also considered. A lower bound of
n(k+1) for the number of random numbers used during any n successive
communication sessions is proven. In other words, we prove that an algorithm
must use at least n(k+1) new random numbers during any n successive
communication sessions. Then a randomized scheme that uses only O(n log n) new
random numbers is presented. A computational secure scheme which is based on
the information theoretic secure scheme is used to ensure that even in the case
that the adversary listens in all the information exchanges, the communication
between the Tag and the Verifier is secure.
","[{'version': 'v1', 'created': 'Mon, 30 Mar 2009 10:43:45 GMT'}]",2009-03-31,"[['Dolev', 'Shlomi', ''], ['Kopeetsky', 'Marina', ''], ['Shamir', 'Adi', '']]","['Authentication protocol', 'information theoretic security', 'computational security', 'RFID tags', 'pseudo-random numbers']"
13254,1307.4566,Max Tschaikowski,Max Tschaikowski and Mirco Tribastone,Spatial Fluid Limits for Stochastic Mobile Networks,,,,,cs.NI cs.NA cs.PF math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider Markov models of large-scale networks where nodes are
characterized by their local behavior and by a mobility model over a
two-dimensional lattice. By assuming random walk, we prove convergence to a
system of partial differential equations (PDEs) whose size depends neither on
the lattice size nor on the population of nodes. This provides a macroscopic
view of the model which approximates discrete stochastic movements with
continuous deterministic diffusions. We illustrate the practical applicability
of this result by modeling a network of mobile nodes with on/off behavior
performing file transfers with connectivity to 802.11 access points. By means
of an empirical validation against discrete-event simulation we show high
quality of the PDE approximation even for low populations and coarse lattices.
In addition, we confirm the computational advantage in using the PDE limit over
a traditional ordinary differential equation limit where the lattice is modeled
discretely, yielding speed-ups of up to two orders of magnitude.
","[{'version': 'v1', 'created': 'Wed, 17 Jul 2013 10:31:05 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Apr 2016 18:16:09 GMT'}]",2016-04-27,"[['Tschaikowski', 'Max', ''], ['Tribastone', 'Mirco', '']]","['Stochastic networks', 'mobility models', 'fluid limits', 'reaction-diffusion']"
13255,1504.04103,Ananda Theertha Suresh,"Moein Falahatgar and Ashkan Jafarpour and Alon Orlitsky and
  Venkatadheeraj Pichapathi and Ananda Theertha Suresh",Faster Algorithms for Testing under Conditional Sampling,31 pages,,,,cs.DS cs.CC cs.LG math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There has been considerable recent interest in distribution-tests whose
run-time and sample requirements are sublinear in the domain-size $k$. We study
two of the most important tests under the conditional-sampling model where each
query specifies a subset $S$ of the domain, and the response is a sample drawn
from $S$ according to the underlying distribution.
  For identity testing, which asks whether the underlying distribution equals a
specific given distribution or $\epsilon$-differs from it, we reduce the known
time and sample complexities from $\tilde{\mathcal{O}}(\epsilon^{-4})$ to
$\tilde{\mathcal{O}}(\epsilon^{-2})$, thereby matching the information
theoretic lower bound. For closeness testing, which asks whether two
distributions underlying observed data sets are equal or different, we reduce
existing complexity from $\tilde{\mathcal{O}}(\epsilon^{-4} \log^5 k)$ to an
even sub-logarithmic $\tilde{\mathcal{O}}(\epsilon^{-5} \log \log k)$ thus
providing a better bound to an open problem in Bertinoro Workshop on Sublinear
Algorithms [Fisher, 2004].
","[{'version': 'v1', 'created': 'Thu, 16 Apr 2015 05:56:34 GMT'}]",2015-04-17,"[['Falahatgar', 'Moein', ''], ['Jafarpour', 'Ashkan', ''], ['Orlitsky', 'Alon', ''], ['Pichapathi', 'Venkatadheeraj', ''], ['Suresh', 'Ananda Theertha', '']]","['Property testing', 'conditional sampling', 'sublinear algorithms']"
13256,2006.04402,Golan Miglioli-Levy,"Dan Halperin (1), Marc van Kreveld (2), Golan Miglioli-Levy (1), Micha
  Sharir (1) ((1) The Blavatnik School of Computer Science, Tel Aviv
  University, Israel, (2) Dept. of Information and Computing Sciences, Utrecht
  University, the Netherlands)",Space-Aware Reconfiguration,"To appear in Proc. of the 14th International Workshop on the
  Algorithmic Foundations of Robotics (2020)",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of reconfiguring a set of physical objects into a
desired target configuration, a typical (sub)task in robotics and automation,
arising in product assembly, packaging, stocking store shelves, and more. In
this paper we address a variant, which we call space-aware reconfiguration,
where the goal is to minimize the physical space needed for the
reconfiguration, while obeying constraints on the allowable collision-free
motions of the objects. Since for given start and target configurations,
reconfiguration may be impossible, we translate the entire target configuration
rigidly into a location that admits a valid sequence of moves, where each
object moves in turn just once, along a straight line, from its starting to its
target location, so that the overall physical space required by the start, all
intermediate, and target configurations for all the objects is minimized.
  We investigate two variants of space-aware reconfiguration for the often
examined setting of $n$ unit discs in the plane, depending on whether the discs
are distinguishable (labeled) or indistinguishable (unlabeled). For the labeled
case, we propose a representation of size $O(n^4)$ of the space of all feasible
initial rigid translations, and use it to find, in $O(n^6)$ time, a shortest
valid translation, or one that minimizes the enclosing disc or axis-aligned
rectangle of both the start and target configurations. For the significantly
harder unlabeled case, we show that for almost every direction, there exists a
translation in this direction that makes the problem feasible. We use this to
devise heuristic solutions, where we optimize the translation under stricter
notions of feasibility. We present an implementation of such a heuristic, which
solves unlabeled instances with hundreds of discs in seconds.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2020 08:05:36 GMT'}, {'version': 'v2', 'created': 'Sun, 30 Aug 2020 11:41:05 GMT'}]",2020-09-01,"[['Halperin', 'Dan', ''], ['van Kreveld', 'Marc', ''], ['Miglioli-Levy', 'Golan', ''], ['Sharir', 'Micha', '']]","['Motion planning', 'Disc reconfiguration', 'Smallest enclosing disc']"
13257,1607.00695,Victor Sanchez-Anguix Dr.,"Victor Sanchez-Anguix and Reyhan Aydogan and Tim Baarslag and
  Catholijn M. Jonker",Can we reach Pareto optimal outcomes using bottom-up approaches?,"2nd Workshop on Conflict Resolution in Decision Making
  (COREDEMA@ECAI2016)",,,,cs.MA cs.AI cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditionally, researchers in decision making have focused on attempting to
reach Pareto Optimality using horizontal approaches, where optimality is
calculated taking into account every participant at the same time. Sometimes,
this may prove to be a difficult task (e.g., conflict, mistrust, no information
sharing, etc.). In this paper, we explore the possibility of achieving Pareto
Optimal outcomes in a group by using a bottom-up approach: discovering Pareto
optimal outcomes by interacting in subgroups. We analytically show that Pareto
optimal outcomes in a subgroup are also Pareto optimal in a supergroup of those
agents in the case of strict, transitive, and complete preferences. Then, we
empirically analyze the prospective usability and practicality of bottom-up
approaches in a variety of decision making domains.
","[{'version': 'v1', 'created': 'Sun, 3 Jul 2016 22:44:57 GMT'}]",2016-07-05,"[['Sanchez-Anguix', 'Victor', ''], ['Aydogan', 'Reyhan', ''], ['Baarslag', 'Tim', ''], ['Jonker', 'Catholijn M.', '']]","['pareto optimality', 'agreement technologies', 'group decisionmaking', 'multi-agent systems', 'artificial intelligence']"
13258,1605.00371,Lorenzo Clemente Lorenzo Clemente,"Lorenzo Clemente and Pawe{\l} Parys and Sylvain Salvati and Igor
  Walukiewicz",The Diagonal Problem for Higher-Order Recursion Schemes is Decidable,technical report; to appear in LICS'16,,,,cs.FL cs.LO,http://creativecommons.org/licenses/by/4.0/,"  A non-deterministic recursion scheme recognizes a language of finite trees.
This very expressive model can simulate, among others, higher-order pushdown
automata with collapse. We show decidability of the diagonal problem for
schemes. This result has several interesting consequences. In particular, it
gives an algorithm that computes the downward closure of languages of words
recognized by schemes. In turn, this has immediate application to separability
problems and reachability analysis of concurrent systems.
","[{'version': 'v1', 'created': 'Mon, 2 May 2016 07:15:16 GMT'}]",2016-05-03,"[['Clemente', 'Lorenzo', ''], ['Parys', 'Paweł', ''], ['Salvati', 'Sylvain', ''], ['Walukiewicz', 'Igor', '']]","['downward closure', 'separability problem', 'diagonalproblem', 'higher-order recursion schemes', 'higher-order OI grammars']"
13259,1307.0277,Nilanjan  Dey,"Sourav Samantaa, Nilanjan Dey, Poulami Das, Suvojit Acharjee, Sheli
  Sinha Chaudhuri","Multilevel Threshold Based Gray Scale Image Segmentation using Cuckoo
  Search","8 Pages,7 figures,ICECIT2012,Anatapur,India. arXiv admin note: text
  overlap with arXiv:1003.1594, arXiv:1005.2908 by other authors",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image Segmentation is a technique of partitioning the original image into
some distinct classes. Many possible solutions may be available for segmenting
an image into a certain number of classes, each one having different quality of
segmentation. In our proposed method, multilevel thresholding technique has
been used for image segmentation. A new approach of Cuckoo Search (CS) is used
for selection of optimal threshold value. In other words, the algorithm is used
to achieve the best solution from the initial random threshold values or
solutions and to evaluate the quality of a solution correlation function is
used. Finally, MSE and PSNR are measured to understand the segmentation
quality.
","[{'version': 'v1', 'created': 'Mon, 1 Jul 2013 06:50:23 GMT'}]",2013-07-02,"[['Samantaa', 'Sourav', ''], ['Dey', 'Nilanjan', ''], ['Das', 'Poulami', ''], ['Acharjee', 'Suvojit', ''], ['Chaudhuri', 'Sheli Sinha', '']]","['Multilevel   Image   Segmentation', 'Correlation', 'Cuckoo Search', 'PSNR']"
13260,1304.7998,Thirumurugan Shomasundaram,S.Thirumurugan and E. George Dharma Prakash Raj,"A Novel Cluster Validation Approach on Pso-Pac Mechanism in Ad Hoc
  Network",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ad hoc network places a vital role in contemporary days communication
scenario. This network performance gets up while the clustering phenomenon has
been incorporated. The cluster formation using the vital parameters is
incredible on deciding the efficiency level of the clustered ad hoc networks.
The PSO-PAC mechanism forms clusters based on swarm intelligence by considering
energy as crucial parameter. This optimized cluster helps to suits the
applications where the energy parameter plays a key role. The clusters formed
by this mechanism may not ascertain the compactness of the clusters. Thus, this
paper proposes D-PAC as an index based validation mechanism to be handled on
clusters formed using PSO-PAC. The cluster formation and validation mechanism
have been implemented using OMNET++ simulator.
","[{'version': 'v1', 'created': 'Thu, 7 Mar 2013 15:04:46 GMT'}]",2013-05-01,"[['Thirumurugan', 'S.', ''], ['Raj', 'E. George Dharma Prakash', '']]","['PSO-PAC', 'D-PAC', 'Dunn’s Index', 'IPv6']"
13261,1305.6395,Gabriele Fici,"Golnaz Badkobeh, Gabriele Fici, Zsuzsanna Lipt\'ak",On the Number of Closed Factors in a Word,Accepted to LATA 2015,,,,cs.FL math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A closed word (a.k.a. periodic-like word or complete first return) is a word
whose longest border does not have internal occurrences, or, equivalently,
whose longest repeated prefix is not right special. We investigate the
structure of closed factors of words. We show that a word of length $n$
contains at least $n+1$ distinct closed factors, and characterize those words
having exactly $n+1$ closed factors. Furthermore, we show that a word of length
$n$ can contain $\Theta(n^{2})$ many distinct closed factors.
","[{'version': 'v1', 'created': 'Tue, 28 May 2013 07:44:39 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Oct 2014 16:29:38 GMT'}, {'version': 'v3', 'created': 'Mon, 1 Dec 2014 08:16:17 GMT'}]",2014-12-02,"[['Badkobeh', 'Golnaz', ''], ['Fici', 'Gabriele', ''], ['Lipták', 'Zsuzsanna', '']]","['Combinatorics on words', 'Closed word', 'complete return', 'rich word', 'bitonic word']"
13262,1312.4524,Konrad W. Schwerdtfeger,Konrad W. Schwerdtfeger,A Computational Trichotomy for Connectivity of Boolean Satisfiability,"27 pages; severe error in the proof of Lemma 19 (now Lemma 23)
  corrected; all results remain true, but some new definitions and lemmas were
  necessary; also, a further error of Gopalan et al.'s paper is explained and
  corrected; several other improvements. Text overlap with arXiv:cs/0609072 due
  to corrections of that paper",,,,cs.CC cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For Boolean satisfiability problems, the structure of the solution space is
characterized by the solution graph, where the vertices are the solutions, and
two solutions are connected iff they differ in exactly one variable. In 2006,
Gopalan et al. studied connectivity properties of the solution graph and
related complexity issues for CSPs, motivated mainly by research on
satisfiability algorithms and the satisfiability threshold. They proved
dichotomies for the diameter of connected components and for the complexity of
the st-connectivity question, and conjectured a trichotomy for the connectivity
question.
  Building on this work, we here prove the trichotomy: Connectivity is either
in P, coNP-complete, or PSPACE-complete. Also, we correct a minor mistake of
Gopalan et al., which leads to a slight shift of the boundaries towards the
hard side.
","[{'version': 'v1', 'created': 'Mon, 16 Dec 2013 20:59:09 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Dec 2013 22:41:37 GMT'}, {'version': 'v3', 'created': 'Mon, 23 Dec 2013 20:52:49 GMT'}, {'version': 'v4', 'created': 'Mon, 30 Dec 2013 20:59:36 GMT'}, {'version': 'v5', 'created': 'Mon, 20 Jul 2015 19:59:30 GMT'}, {'version': 'v6', 'created': 'Sun, 25 Oct 2015 11:19:38 GMT'}]",2015-10-27,"[['Schwerdtfeger', 'Konrad W.', '']]","['Computational Complexity', 'Boolean Satisfiability', 'BooleanCSPs', 'PSPACE-Completeness', 'Dichotomy Theorems', 'Graph Connectivity']"
13263,1704.08443,Ho Bae,"Ho Bae, Byunghan Lee, Sunyoung Kwon, Sungroh Yoon",DNA Steganalysis Using Deep Recurrent Neural Networks,,,,,cs.LG cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advances in next-generation sequencing technologies have facilitated
the use of deoxyribonucleic acid (DNA) as a novel covert channels in
steganography. There are various methods that exist in other domains to detect
hidden messages in conventional covert channels. However, they have not been
applied to DNA steganography. The current most common detection approaches,
namely frequency analysis-based methods, often overlook important signals when
directly applied to DNA steganography because those methods depend on the
distribution of the number of sequence characters. To address this limitation,
we propose a general sequence learning-based DNA steganalysis framework. The
proposed approach learns the intrinsic distribution of coding and non-coding
sequences and detects hidden messages by exploiting distribution variations
after hiding these messages. Using deep recurrent neural networks (RNNs), our
framework identifies the distribution variations by using the classification
score to predict whether a sequence is to be a coding or non-coding sequence.
We compare our proposed method to various existing methods and biological
sequence analysis methods implemented on top of our framework. According to our
experimental results, our approach delivers a robust detection performance
compared to other tools.
","[{'version': 'v1', 'created': 'Thu, 27 Apr 2017 06:16:30 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Jan 2018 14:20:46 GMT'}, {'version': 'v3', 'created': 'Fri, 5 Oct 2018 04:04:58 GMT'}]",2018-10-08,"[['Bae', 'Ho', ''], ['Lee', 'Byunghan', ''], ['Kwon', 'Sunyoung', ''], ['Yoon', 'Sungroh', '']]","['Deep recurrent neural network', 'DNA steganography', 'DNA steganalysis', 'DNAwatermarking']"
13264,1506.04513,Matus Telgarsky,Matus Telgarsky and Miroslav Dud\'ik and Robert Schapire,Convex Risk Minimization and Conditional Probability Estimation,"To appear, COLT 2015",,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proves, in very general settings, that convex risk minimization is
a procedure to select a unique conditional probability model determined by the
classification problem. Unlike most previous work, we give results that are
general enough to include cases in which no minimum exists, as occurs
typically, for instance, with standard boosting algorithms. Concretely, we
first show that any sequence of predictors minimizing convex risk over the
source distribution will converge to this unique model when the class of
predictors is linear (but potentially of infinite dimension). Secondly, we show
the same result holds for \emph{empirical} risk minimization whenever this
class of predictors is finite dimensional, where the essential technical
contribution is a norm-free generalization bound.
","[{'version': 'v1', 'created': 'Mon, 15 Jun 2015 08:41:39 GMT'}]",2015-06-16,"[['Telgarsky', 'Matus', ''], ['Dudík', 'Miroslav', ''], ['Schapire', 'Robert', '']]","['Convex duality', 'classification', 'conditional probability estimation', 'maximum entropy', 'consistency', 'Orlicz spaces']"
13265,0905.1786,Swan Dubois,"Alain Cournier (MIS), Swan Dubois (LIP6, INRIA Rocquencourt), Vincent
  Villain (MIS)",Une CNS pour l'acheminement de messages instantan\'ement stabilisant,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A snap-stabilizing algorithm ensures that it always behaves according to its
specifications whenever it starts from an arbitrary configuration. In this
paper, we interest in the message forwarding problem in a message-switched
network. We must manage network ressources in order to deliver messages to any
processor of the network. In this goal, we need information given by a routing
algorithm. But, due to the context of stabilization, this information can be
initially corrupted. It is why the existence of snap-stabilizing algorithms for
this task (proved in [CDV09]) implies that we can ask the system to begin
forwarding messages even if routing tables are initially corrupted. In this
paper, we generalize the previous result given a necessary and sufficient
condition to solve the forwarding problem in a snap-stabilizing way.
","[{'version': 'v1', 'created': 'Tue, 12 May 2009 08:28:47 GMT'}]",2009-05-13,"[['Cournier', 'Alain', '', 'MIS'], ['Dubois', 'Swan', '', 'LIP6, INRIA Rocquencourt'], ['Villain', 'Vincent', '', 'MIS']]","['Stabilisation instantan´ee', 'acheminement de messages', 'routage sans interblocage']"
13266,1712.04170,Daniel Hein,"Daniel Hein, Steffen Udluft, Thomas A. Runkler",Interpretable Policies for Reinforcement Learning by Genetic Programming,,,,,cs.AI cs.NE cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The search for interpretable reinforcement learning policies is of high
academic and industrial interest. Especially for industrial systems, domain
experts are more likely to deploy autonomously learned controllers if they are
understandable and convenient to evaluate. Basic algebraic equations are
supposed to meet these requirements, as long as they are restricted to an
adequate complexity. Here we introduce the genetic programming for
reinforcement learning (GPRL) approach based on model-based batch reinforcement
learning and genetic programming, which autonomously learns policy equations
from pre-existing default state-action trajectory samples. GPRL is compared to
a straight-forward method which utilizes genetic programming for symbolic
regression, yielding policies imitating an existing well-performing, but
non-interpretable policy. Experiments on three reinforcement learning
benchmarks, i.e., mountain car, cart-pole balancing, and industrial benchmark,
demonstrate the superiority of our GPRL approach compared to the symbolic
regression method. GPRL is capable of producing well-performing interpretable
reinforcement learning policies from pre-existing default trajectory data.
","[{'version': 'v1', 'created': 'Tue, 12 Dec 2017 08:31:51 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Apr 2018 07:23:57 GMT'}]",2018-04-05,"[['Hein', 'Daniel', ''], ['Udluft', 'Steffen', ''], ['Runkler', 'Thomas A.', '']]","['interpretable', 'reinforcement learning', 'genetic programming', 'model-based', 'symbolic regression', 'industrialbenchmark']"
13267,1702.07292,Lev Reyzin,"Yi Huang, Mano Vikash Janardhanan, Lev Reyzin",Network Construction with Ordered Constraints,12 pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the problem of constructing a network by observing
ordered connectivity constraints, which we define herein. These ordered
constraints are made to capture realistic properties of real-world problems
that are not reflected in previous, more general models. We give hardness of
approximation results and nearly-matching upper bounds for the offline problem,
and we study the online problem in both general graphs and restricted
sub-classes. In the online problem, for general graphs, we give exponentially
better upper bounds than exist for algorithms for general connectivity
problems. For the restricted classes of stars and paths we are able to find
algorithms with optimal competitive ratios, the latter of which involve
analysis using a potential function defined over pq-trees.
","[{'version': 'v1', 'created': 'Thu, 23 Feb 2017 16:59:25 GMT'}]",2017-02-24,"[['Huang', 'Yi', ''], ['Janardhanan', 'Mano Vikash', ''], ['Reyzin', 'Lev', '']]","['graph connectivity', 'network construction', 'ordered connectivity constraints', 'pq-trees']"
13268,1307.7202,Leon Abdillah,Leon Andretti Abdillah,Students learning center strategy based on e-learning and blogs,"6 pages, Seminar Nasional Sains dan Teknologi (SNST) ke- 4 tahun
  2013, Universitas Wahid Hasyim Semarang, 2013","Seminar Nasional Sains dan Teknologi (SNST) ke- 4 tahun 2013,
  Universitas Wahid Hasyim Semarang, 2013",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Education is the main infrastructure for promoting a nation and increasing
their competitiveness in globalization era that involves the use of information
technology (IT). This paper has goal to expand the alternative for learning
strategy based on IT for final year students that will conduct a research for
their final report. The final year students are expected have the ability to
learn independently to manage the needness of their learning supply. In this
paper, the author will discuss how to use the e-learning media and blogs to
manage the independently learning environment or self-learning. E-learning
offers the flexibilities in term of time and place in supporting the learning
activities as well as a media for faculty/lecturer to disseminate learning
materials. While the blog has been a free medium for the publication of variety
contents, including academic contents. In this paper, author suggests some the
institutions regulations, lecturers roles, and students participations are
involve in set the learning environment based on e-learning and blog. These
activities able to support students in learning independently or self-learning.
","[{'version': 'v1', 'created': 'Sat, 27 Jul 2013 01:35:06 GMT'}]",2013-07-30,"[['Abdillah', 'Leon Andretti', '']]","['student learning center', 'e-learning', 'blog', 'IT-based learning']"
13269,1009.0794,Charlie C.L. Wang Dr.,Charlie C. L. Wang and Yong Chen,"Layered Depth-Normal Images: a Sparse Implicit Representation of Solid
  Models",,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel implicit representation of solid models. With
this representation, every solid model can be effectively presented by three
layered depth-normal images (LDNIs) that are perpendicular to three orthogonal
axes respectively. The layered depth-normal images for a solid model, whose
boundary is presented by a polygonal mesh, can be generated efficiently with
help of the graphics hardware accelerated sampling. Based on this implicit
representation - LDNIs, solid modeling operations including the Boolean
operations and the offsetting operation have been developed. A contouring
algorithm is also introduced in this paper to generate thin structure and sharp
feature preserved mesh surfaces from the layered depth-normal images.
Comparisons between LDNIs and other implicit representation of solid models are
given at the end of the paper to demonstrate the advantages of LDNIs.
","[{'version': 'v1', 'created': 'Sat, 4 Sep 2010 01:17:54 GMT'}]",2010-09-07,"[['Wang', 'Charlie C. L.', ''], ['Chen', 'Yong', '']]","['implicit representation', 'hardware accelerated sampling', 'contouring algorithm', 'Boolean']"
13270,1307.0937,Riadh Bouslimi,"Mouhamed Gaith Ayadi, Riadh Bouslimi, Jalel Akaichi",Extending UML for Conceptual Modeling of Annotation of Medical Images,"9 pages, 6 figures. In International Journal of Computer
  Applications, June 2013",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Imaging has occupied a huge role in the management of patients, whether
hospitalized or not. Depending on the patients clinical problem, a variety of
imaging modalities were available for use. This gave birth of the annotation of
medical image process. The annotation is intended to image analysis and solve
the problem of semantic gap. The reason for image annotation is due to increase
in acquisition of images. Physicians and radiologists feel better while using
annotation techniques for faster remedy in surgery and medicine due to the
following reasons: giving details to the patients, searching the present and
past records from the larger databases, and giving solutions to them in a
faster and more accurate way. However, classical conceptual modeling does not
incorporate the specificity of medical domain specially the annotation of
medical image. The design phase is the most important activity in the
successful building of annotation process. For this reason, we focus in this
paper on presenting the conceptual modeling of the annotation of medical image
by defining a new profile using the StarUML extensibility mechanism.
","[{'version': 'v1', 'created': 'Wed, 3 Jul 2013 08:45:37 GMT'}]",2013-07-04,"[['Ayadi', 'Mouhamed Gaith', ''], ['Bouslimi', 'Riadh', ''], ['Akaichi', 'Jalel', '']]","['Annotation of medical images', 'UML extension', 'UML profile']"
13271,1106.5928,Gabriel Cristobal,Salvador Gabarda and Gabriel Cristobal,Image denoising assessment using anisotropic stack filtering,"13 pages, 8 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a measure of anisotropy as a quality parameter to
estimate the amount of noise in noisy images. The anisotropy of an image can be
determined through a directional measure, using an appropriate statistical
distribution of the information contained in the image. This new measure is
achieved through a stack filtering paradigm. First, we define a local
directional entropy, based on the distribution of 0's and 1's in the
neigborhood of every pixel location of each stack level. Then the entropy
variation of this directional entropy is used to define an anisotropic measure.
The empirical results have shown that this measure can be regarded as an
excellent image noise indicator, which is particularly relevant for quality
assessment of denoising algorithms. The method has been evaluated with
artificial and real-world degraded images.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2011 13:12:56 GMT'}]",2011-06-30,"[['Gabarda', 'Salvador', ''], ['Cristobal', 'Gabriel', '']]","['Entropy', 'Anisotropy', 'Stack filters', 'Speckle', 'Synthetic apertureradar']"
13272,1402.1485,Jan Sykora,Jan S\'ykora and Anna Ku\v{c}erov\'a,Uncertainty Propagation in Elasto-Plastic Material,,,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Macroscopically heterogeneous materials, characterised mostly by comparable
heterogeneity lengthscale and structural sizes, can no longer be modelled by
deterministic approach instead. It is convenient to introduce stochastic
approach with uncertain material parameters quantified as random fields and/or
random variables. The present contribution is devoted to propagation of these
uncertainties in mechanical modelling of inelastic behaviour. In such case the
Monte Carlo method is the traditional approach for solving the proposed
problem. Nevertheless, convergence rate is relatively slow, thus new methods
(e.g. stochastic Galerkin method, stochastic collocation approach, etc.) have
been recently developed to offer fast convergence for sufficiently smooth
solution in the probability space. Our goal is to accelerate the uncertainty
propagation using a polynomial chaos expansion based on stochastic collocation
method. The whole concept is demonstrated on a simple numerical example of
uniaxial test at a material point where interesting phenomena can be clearly
understood.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2014 20:55:49 GMT'}]",2014-02-07,"[['Sýkora', 'Jan', ''], ['Kučerová', 'Anna', '']]","['Polynomial chaos expansion', 'Stochastic collocation method', 'Elasto-plastic material', 'Uncertainty propagation']"
13273,1407.7260,Tanmay Sinha,"Tanmay Sinha, Ankit Banka, Dae Ki Kang","Leveraging user profile attributes for improving pedagogical accuracy of
  learning pathways","3rd Annual International Conference on Education and E-Learning(EeL
  2013), Singapore",,,,cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, with the enormous explosion of web based learning resources,
personalization has become a critical factor for the success of services that
wish to leverage the power of Web 2.0. However, the relevance, significance and
impact of tailored content delivery in the learning domain is still
questionable. Apart from considering only interaction based features like
ratings and inferring learner preferences from them, if these services were to
incorporate innate user profile attributes which affect learning activities,
the quality of recommendations produced could be vastly improved. Recognizing
the crucial role of effective guidance in informal educational settings, we
provide a principled way of utilizing multiple sources of information from the
user profile itself for the recommendation task. We explore factors that affect
the choice of learning resources and explain in what way are they helpful to
improve the pedagogical accuracy of learning objects recommended. Through a
systematical application of machine learning techniques, we further provide a
technological solution to convert these indirectly mapped learner specific
attributes into a direct mapping with the learning resources. This mapping has
a distinct advantage of tagging learning resources to make their metadata more
informative. The results of our empirical study depict the similarity of
nominal learning attributes with respect to each other. We further succeed in
capturing the learner subset, whose preferences are most likely to be an
indication of learning resource usage. Our novel system filters learner profile
attributes to discover a tag that links them with learning resources.
","[{'version': 'v1', 'created': 'Sun, 27 Jul 2014 17:24:14 GMT'}]",2014-07-29,"[['Sinha', 'Tanmay', ''], ['Banka', 'Ankit', ''], ['Kang', 'Dae Ki', '']]","['Apriori principle', 'Clustering', 'NMF', 'Learning']"
13274,1412.2118,Carlos Lombardi,"Eduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Rios",On abstract normalisation beyond neededness,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study normalisation of multistep strategies, strategies that reduce a set
of redexes at a time, focussing on the notion of necessary sets, those which
contain at least one redex that cannot be avoided in order to reach a normal
form. This is particularly appealing in the setting of non-sequential rewrite
systems, in which terms that are not in normal form may not have any needed
redex. We first prove a normalisation theorem for abstract rewrite systems
(ARS), a general rewriting framework encompassing many rewriting systems
developed by P-A.Melli\`es in his PhD thesis. The theorem states that multistep
strategies reducing so called necessary and never-gripping sets of redexes at a
time are normalising in any ARS. Gripping refers to an abstract property
reflecting the behavior of higher-order substitution. We then apply this result
to the particular case of PPC, a calculus of patterns and to the
lambda-calculus with parallel-or.
","[{'version': 'v1', 'created': 'Fri, 5 Dec 2014 19:59:18 GMT'}, {'version': 'v2', 'created': 'Wed, 31 Dec 2014 01:34:27 GMT'}, {'version': 'v3', 'created': 'Mon, 9 May 2016 14:26:00 GMT'}]",2016-05-10,"[['Bonelli', 'Eduardo', ''], ['Kesner', 'Delia', ''], ['Lombardi', 'Carlos', ''], ['Rios', 'Alejandro', '']]","['rewriting', 'normalisation', 'neededness', 'sequentiality', 'pattern calculi']"
13275,1511.05774,Jeff Jones Dr,Jeff Jones,Applications of Multi-Agent Slime Mould Computing,,"Int. J. of Parallel, Emergent and Distributed Systems, 1-30 (2015)",,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The giant single-celled slime mould Physarum polycephalum has inspired rapid
develop- ments in unconventional computing substrates since the start of this
century. This is primarily due to its simple component parts and the
distributed nature of the computation which it approximates during its growth,
foraging and adaptation to a changing environment. Slime mould functions as a
living embodied computational material which can be influenced (or pro-
grammed) by the placement of external stimuli. The goal of exploiting this
material behaviour for unconventional computation led to the development of a
multi-agent approach to the ap- proximation of slime mould behaviour. The basis
of the model is a simple dynamical pattern formation mechanism which exhibits
self-organised formation and subsequent adaptation of collective transport
networks. The system exhibits emergent properties such as relaxation and
minimisation and it can be considered as a virtual computing material,
influenced by the external application of spatial concentration gradients. In
this paper we give an overview of this multi-agent approach to unconventional
computing. We describe its computational mechanisms and different generic
application domains, together with concrete example ap- plications of material
computation. We examine the potential exploitation of the approach for
computational geometry, path planning, combinatorial optimisation, data
smoothing and statistical applications.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2015 13:41:58 GMT'}]",2015-11-19,"[['Jones', 'Jeff', '']]","['Physarum polycephalum', 'multi-agent', 'unconventional computation', 'materialcomputation', 'spatial computing']"
13276,1402.5043,Lucas Paletta,"Marwen Belkaid, Nicolas Sabouret","A logical model of Theory of Mind for virtual agents in the context of
  job interview simulation",,,,IDGEI/2014/10,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Job interview simulation with a virtual agents aims at improving people's
social skills and supporting professional inclusion. In such simulators, the
virtual agent must be capable of representing and reasoning about the user's
mental state based on social cues that inform the system about his/her affects
and social attitude. In this paper, we propose a formal model of Theory of Mind
(ToM) for virtual agent in the context of human-agent interaction that focuses
on the affective dimension. It relies on a hybrid ToM that combines the two
major paradigms of the domain. Our framework is based on modal logic and
inference rules about the mental states, emotions and social relations of both
actors. Finally, we present preliminary results regarding the impact of such a
model on natural interaction in the context of job interviews simulation.
","[{'version': 'v1', 'created': 'Thu, 20 Feb 2014 15:40:08 GMT'}]",2014-02-21,"[['Belkaid', 'Marwen', ''], ['Sabouret', 'Nicolas', '']]","['Theory of Mind', 'Cognitive Models', 'Logic-Based Approaches', 'Human-Agent Interaction', 'Affective Computing', 'Serious Gamesfor Inclusion']"
13277,1603.04582,Laurent Buse,"Laurent Bus\'e (GALAAD2), Andr\'e Galligo (JAD, GALAAD2), Jiajun Zhang
  (GALAAD2)",Extraction of cylinders and cones from minimal point sets,,"Graphical Models, Elsevier, 2016, 86, pp.1-12",,,cs.CG cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose new algebraic methods for extracting cylinders and cones from
minimal point sets, including oriented points. More precisely, we are
interested in computing efficiently cylinders through a set of three points,
one of them being oriented, or through a set of five simple points. We are also
interested in computing efficiently cones through a set of two oriented points,
through a set of four points, one of them being oriented, or through a set of
six points. For these different interpolation problems, we give optimal bounds
on the number of solutions. Moreover, we describe algebraic methods targeted to
solve these problems efficiently.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2016 07:37:29 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Jun 2016 08:36:41 GMT'}]",2016-06-22,"[['Busé', 'Laurent', '', 'GALAAD2'], ['Galligo', 'André', '', 'JAD, GALAAD2'], ['Zhang', 'Jiajun', '', 'GALAAD2']]","['Mixed set of 3D points', 'cylinders', 'cones', 'interpolation']"
13278,1401.0875,Sonali Goyal,"Anoop J. Sahoo, Md. Amir Khusru Akhtar","Determining the Possibilities and Certainties in Network Participation
  for MANETS","10 Pages. International Journal of Computer Engineering and
  Applications,2013",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A mobile ad hoc network is a self organized cooperative network that works
without any permanent infrastructure. This infrastructure less design makes it
complex compared to other wireless networks. Lot of attacks and misbehavior
obstruct the growth and implementation. The majority of attacks and misbehavior
can be handled by existing protocols. But these protocols reduce the total
strength of nodes in a network because they isolate nodes from network
participation having lesser reputation value. To cope with this problem we have
presented the Possibility and Certainty model. This model uses reputation value
to determine the possibilities and certainties in network participation. The
proposed model classifies nodes into three classes such as certain or HIGH
grade possible or MED grade and not possible or LOW grade. Choosing HIGH grade
nodes in network activities improves the Packet Delivery Ratio which enhances
the throughput of the MANET. On the other hand when node strength is poor we
choose MED grade nodes for network activities. Thus the proposed model allows
communication in the worst scenario with the possibility of success. It
protects a network from misbehavior by isolating LOW grade nodes from routing
paths.
","[{'version': 'v1', 'created': 'Sun, 5 Jan 2014 09:00:40 GMT'}]",2014-01-07,"[['Sahoo', 'Anoop J.', ''], ['Akhtar', 'Md. Amir Khusru', '']]","['Possibility', 'Certainty', 'Reputation Values', 'Grade', 'Network Participation', 'Class']"
13279,1109.3381,Janusz Brzozowski,"Janusz Brzozowski, Baiyu Li",Syntactic Complexity of Star-Free Languages,"17 pages, 6 figures, 3 tables",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The syntactic complexity of a regular language is the cardinality of its
syntactic semigroup. The syntactic complexity of a subclass of regular
languages is the maximal syntactic complexity of languages in that subclass,
taken as a function of the state complexity of these languages. We study the
syntactic complexity of star-free regular languages, that is, languages that
can be constructed from finite languages using union, complement and
concatenation. We find tight upper bounds on the syntactic complexity of
languages accepted by monotonic and partially monotonic automata. We introduce
""nearly monotonic"" automata, which accept star-free languages, and find a tight
upper bound on the syntactic complexity of languages accepted by such automata.
We conjecture that this bound is also an upper bound on the syntactic
complexity of star-free languages.
","[{'version': 'v1', 'created': 'Thu, 15 Sep 2011 15:26:08 GMT'}]",2011-09-16,"[['Brzozowski', 'Janusz', ''], ['Li', 'Baiyu', '']]","['finite automaton', 'monotonic', 'nearly monotonic', 'partiallymonotonic', 'star-free language', 'syntactic complexity', 'syntactic semigroup']"
13280,0909.0573,R Doomun,"Jalpa Bani, Syed S. Rizvi","Minimizing Cache Timing Attack Using Dynamic Cache Flushing (DCF)
  Algorithm","7 Pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 4, No. 1 & 2, August 2009, USA",,ISSN 1947 5500,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rijndael algorithm was unanimously chosen as the Advanced Encryption Standard
(AES) by the panel of researchers at National Institute of Standards and
Technology (NIST) in October 2000. Since then, Rijndael was destined to be used
massively in various software as well as hardware entities for encrypting data.
However, a few years back, Daniel Bernstein devised a cache timing attack that
was capable enough to break Rijndael seal that encapsulates the encryption key.
In this paper, we propose a new Dynamic Cache Flushing (DCF) algorithm which
shows a set of pragmatic software measures that would make Rijndael impregnable
to cache timing attack. The simulation results demonstrate that the proposed
DCF algorithm provides better security by encrypting key at a constant time.
","[{'version': 'v1', 'created': 'Thu, 3 Sep 2009 05:53:38 GMT'}]",2009-09-04,"[['Bani', 'Jalpa', ''], ['Rizvi', 'Syed S.', '']]","['dynamic cache flushing', 'Rijndael algorithm', 'timing attack']"
13281,1606.08998,Ernest C. H. Cheung,"Ernest Cheung, Tsan Kwong Wong, Aniket Bera, Xiaogang Wang, and Dinesh
  Manocha","LCrowdV: Generating Labeled Videos for Simulation-based Crowd Behavior
  Learning",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a novel procedural framework to generate an arbitrary number of
labeled crowd videos (LCrowdV). The resulting crowd video datasets are used to
design accurate algorithms or training models for crowded scene understanding.
Our overall approach is composed of two components: a procedural simulation
framework for generating crowd movements and behaviors, and a procedural
rendering framework to generate different videos or images. Each video or image
is automatically labeled based on the environment, number of pedestrians,
density, behavior, flow, lighting conditions, viewpoint, noise, etc.
Furthermore, we can increase the realism by combining synthetically-generated
behaviors with real-world background videos. We demonstrate the benefits of
LCrowdV over prior lableled crowd datasets by improving the accuracy of
pedestrian detection and crowd behavior classification algorithms. LCrowdV
would be released on the WWW.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2016 08:30:44 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Jul 2016 05:33:48 GMT'}]",2016-07-05,"[['Cheung', 'Ernest', ''], ['Wong', 'Tsan Kwong', ''], ['Bera', 'Aniket', ''], ['Wang', 'Xiaogang', ''], ['Manocha', 'Dinesh', '']]","['crowd analysis', 'pedestrian detection', 'crowd behaviors', 'crowddatasets', 'crowd simulation', 'crowd rendering']"
13282,1407.6103,Andrew Connor,"Frederik Schmidt, Stephen G. MacDonell, Andy M. Connor",An automatic architecture reconstruction and refactoring framework,,"Software Engineering Research,Management and Applications 2011,
  Springer Berlin / Heidelberg. 377: 95-111",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A variety of sources have noted that a substantial proportion of non trivial
software systems fail due to unhindered architectural erosion. This design
deterioration leads to low maintainability, poor testability and reduced
development speed. The erosion of software systems is often caused by
inadequate understanding, documentation and maintenance of the desired
implementation architecture. If the desired architecture is lost or the
deterioration is advanced, the reconstruction of the desired architecture and
the realignment of this desired architecture with the physical architecture
both require substantial manual analysis and implementation effort. This paper
describes the initial development of a framework for automatic software
architecture reconstruction and source code migration. This framework offers
the potential to reconstruct the conceptual architecture of software systems
and to automatically migrate the physical architecture of a software system
toward a conceptual architecture model. The approach is implemented within a
proof of concept prototype which is able to analyze java system and reconstruct
a conceptual architecture for these systems as well as to refactor the system
towards a conceptual architecture.
","[{'version': 'v1', 'created': 'Wed, 23 Jul 2014 03:50:22 GMT'}]",2014-07-24,"[['Schmidt', 'Frederik', ''], ['MacDonell', 'Stephen G.', ''], ['Connor', 'Andy M.', '']]","['Architecture reconstruction', 'software migration', 'source code transformation and refactoring', 'search based software engineering', 'metaheuristics']"
13283,1108.4279,Jean-Louis Dessalles,"Eric Bonabeau, Jean-Louis Dessalles (INFRES, LTCI)",Detection and emergence,jld-98072401,"Intellectica 25, 2 (1997) 85-94",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two different conceptions of emergence are reconciled as two instances of the
phenomenon of detection. In the process of comparing these two conceptions, we
find that the notions of complexity and detection allow us to form a unified
definition of emergence that clearly delineates the role of the observer.
","[{'version': 'v1', 'created': 'Mon, 22 Aug 2011 11:30:49 GMT'}]",2011-08-23,"[['Bonabeau', 'Eric', '', 'INFRES, LTCI'], ['Dessalles', 'Jean-Louis', '', 'INFRES, LTCI']]","['detection', 'emergence', 'models', 'complexity', 'organization levels']"
13284,0711.1814,Francesca A. Lisi,Francesca A. Lisi,"Building Rules on Top of Ontologies for the Semantic Web with Inductive
  Logic Programming","30 pages, 6 figures",,,,cs.AI cs.LG,,"  Building rules on top of ontologies is the ultimate goal of the logical layer
of the Semantic Web. To this aim an ad-hoc mark-up language for this layer is
currently under discussion. It is intended to follow the tradition of hybrid
knowledge representation and reasoning systems such as $\mathcal{AL}$-log that
integrates the description logic $\mathcal{ALC}$ and the function-free Horn
clausal language \textsc{Datalog}. In this paper we consider the problem of
automating the acquisition of these rules for the Semantic Web. We propose a
general framework for rule induction that adopts the methodological apparatus
of Inductive Logic Programming and relies on the expressive and deductive power
of $\mathcal{AL}$-log. The framework is valid whatever the scope of induction
(description vs. prediction) is. Yet, for illustrative purposes, we also
discuss an instantiation of the framework which aims at description and turns
out to be useful in Ontology Refinement.
  Keywords: Inductive Logic Programming, Hybrid Knowledge Representation and
Reasoning Systems, Ontologies, Semantic Web.
  Note: To appear in Theory and Practice of Logic Programming (TPLP)
","[{'version': 'v1', 'created': 'Mon, 12 Nov 2007 17:15:34 GMT'}]",2007-11-13,"[['Lisi', 'Francesca A.', '']]","['Inductive Logic Programming', 'Hybrid Knowledge Representation and Reasoning Systems', 'Ontologies', 'Semantic Web']"
13285,1002.1363,Albert Xin Jiang,Albert Xin Jiang and MohammadAli Safari,"Pure Nash Equilibria: Complete Characterization of Hard and Easy
  Graphical Games",8 pages. To appear in AAMAS 2010,,,,cs.GT cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the computational complexity of pure Nash equilibria in graphical
games. It is known that the problem is NP-complete in general, but tractable
(i.e., in P) for special classes of graphs such as those with bounded
treewidth. It is then natural to ask: is it possible to characterize all
tractable classes of graphs for this problem? In this work, we provide such a
characterization for the case of bounded in-degree graphs, thereby resolving
the gap between existing hardness and tractability results. In particular, we
analyze the complexity of PUREGG(C, -), the problem of deciding the existence
of pure Nash equilibria in graphical games whose underlying graphs are
restricted to class C. We prove that, under reasonable complexity theoretic
assumptions, for every recursively enumerable class C of directed graphs with
bounded in-degree, PUREGG(C, -) is in polynomial time if and only if the
reduced graphs (the graphs resulting from iterated removal of sinks) of C have
bounded treewidth. We also give a characterization for PURECHG(C,-), the
problem of deciding the existence of pure Nash equilibria in colored
hypergraphical games, a game representation that can express the additional
structure that some of the players have identical local utility functions. We
show that the tractable classes of bounded-arity colored hypergraphical games
are precisely those whose reduced graphs have bounded treewidth modulo
homomorphic equivalence. Our proofs make novel use of Grohe's characterization
of the complexity of homomorphism problems.
","[{'version': 'v1', 'created': 'Sat, 6 Feb 2010 09:36:31 GMT'}]",2010-02-09,"[['Jiang', 'Albert Xin', ''], ['Safari', 'MohammadAli', '']]","['game theory', 'graphical games', 'computational complexity', 'homomorphism problem', 'treewidth']"
13286,1008.2897,Vadim E. Levit,Vadim E. Levit and Eugen Mandrescu,"Very Well-Covered Graphs of Girth at least Four and Local Maximum Stable
  Set Greedoids","7 pages, 5 figures",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A \textit{maximum stable set} in a graph $G$ is a stable set of maximum
cardinality. $S$ is a \textit{local maximum stable set} of $G$, and we write
$S\in\Psi(G)$, if $S$ is a maximum stable set of the subgraph induced by $S\cup
N(S)$, where $N(S)$ is the neighborhood of $S$. Nemhauser and Trotter Jr.
(1975), proved that any $S\in\Psi(G)$ is a subset of a maximum stable set of
$G$. In (Levit & Mandrescu, 2002) we have shown that the family $\Psi(T)$ of a
forest $T$ forms a greedoid on its vertex set. The cases where $G$ is
bipartite, triangle-free, well-covered, while $\Psi(G)$ is a greedoid, were
analyzed in (Levit & Mandrescu, 2002),(Levit & Mandrescu, 2004),(Levit &
Mandrescu, 2007), respectively. In this paper we demonstrate that if $G$ is a
very well-covered graph of girth $\geq4$, then the family $\Psi(G)$ is a
greedoid if and only if $G$ has a unique perfect matching.
","[{'version': 'v1', 'created': 'Tue, 17 Aug 2010 13:43:39 GMT'}]",2010-08-18,"[['Levit', 'Vadim E.', ''], ['Mandrescu', 'Eugen', '']]","['very well-covered graph', 'local maximum stable set', 'greedoid', 'trianglefree graph', 'K¨onig-Egerv´ary graph']"
13287,1004.1304,Gang Yu,"Gang Yu, Xiaoxiao Ma, Yong Shen, Wenbao Han",Provable Secure Identity Based Generalized Signcryption Scheme,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  According to actual needs, generalized signcryption scheme can flexibly work
as an encryption scheme, a signature scheme or a signcryption scheme. In this
paper, firstly, we give a security model for identity based generalized
signcryption which is more complete than existing model. Secondly, we propose
an identity based generalized signcryption scheme. Thirdly, we give the
security proof of the new scheme in this complete model. Comparing with
existing identity based generalized signcryption, the new scheme has less
implementation complexity. Moreover, the new scheme has comparable computation
complexity with the existing normal signcryption schemes.
","[{'version': 'v1', 'created': 'Thu, 8 Apr 2010 10:32:44 GMT'}]",2010-04-09,"[['Yu', 'Gang', ''], ['Ma', 'Xiaoxiao', ''], ['Shen', 'Yong', ''], ['Han', 'Wenbao', '']]","['Generalized signcryption', 'Signature', 'Encryption', 'Bilinearpairing', 'Identity based cryptography']"
13288,1304.6176,Yang Zhang,"Yang Zhang, Dusit Niyato and Ping Wang","An Auction Mechanism for Resource Allocation in Mobile Cloud Computing
  Systems",,,,,cs.DC cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A mobile cloud computing system is composed of heterogeneous services and
resources to be allocated by the cloud service provider to mobile cloud users.
On one hand, some of these resources are substitutable (e.g., users can use
storage from different places) that they have similar functions to the users.
On the other hand, some resources are complementary that the user will need
them as a bundle (e.g., users need both wireless connection and storage for
online photo posting). In this paper, we first model the resource allocation
process of a mobile cloud computing system as an auction mechanism with premium
and discount factors. The premium and discount factors indicate complementary
and substitutable relations among cloud resources provided by the service
provider. Then, we analyze the individual rationality and incentive
compatibility (truthfulness) properties of the users in the proposed auction
mechanism. The optimal solutions of the resource allocation and cost charging
schemes in the auction mechanism is discussed afterwards.
","[{'version': 'v1', 'created': 'Tue, 23 Apr 2013 06:11:12 GMT'}]",2013-04-24,"[['Zhang', 'Yang', ''], ['Niyato', 'Dusit', ''], ['Wang', 'Ping', '']]","['Mobile cloud computing', 'auction', 'mechanism design']"
13289,1504.06135,Jonni Virtema,"Miika Hannula, Juha Kontinen, Jonni Virtema, Heribert Vollmer",Complexity of Propositional Logics in Team Semantics,"15 pages + 1 page appendix, the main result is generalised and the
  title updated to reflect this",,,,cs.LO cs.CC math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We classify the computational complexity of the satisfiability, validity and
model-checking problems for propositional independence, inclusion, and team
logic. Our main result shows that the satisfiability and validity problems for
propositional team logic are complete for alternating exponential-time with
polynomially many alternations.
","[{'version': 'v1', 'created': 'Thu, 23 Apr 2015 12:01:22 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Jan 2017 14:01:13 GMT'}]",2017-01-06,"[['Hannula', 'Miika', ''], ['Kontinen', 'Juha', ''], ['Virtema', 'Jonni', ''], ['Vollmer', 'Heribert', '']]","['Propositional logic', 'team semantics', 'dependence', 'independence', 'inclusion', 'satisfiability', 'validity', 'model-checking']"
13290,0708.2363,Vahan Mkrtchyan,"R. R. Kamalian, V. V. Mkrtchyan","On a constructive characterization of a class of trees related to pairs
  of disjoint matchings","22 pages, 17 figures",,,,cs.DM,,"  For a graph consider the pairs of disjoint matchings which union contains as
many edges as possible, and define a parameter $\alpha$ which eqauls the
cardinality of the largest matching in those pairs. Also, define $\betta$ to be
the cardinality of a maximum matching of the graph.
  We give a constructive characterization of trees which satisfy the
$\alpha$=$\betta$ equality. The proof of our main theorem is based on a new
decomposition algorithm obtained for trees.
","[{'version': 'v1', 'created': 'Fri, 17 Aug 2007 13:19:49 GMT'}]",2009-09-29,"[['Kamalian', 'R. R.', ''], ['Mkrtchyan', 'V. V.', '']]","['tree', 'pair of disjoint matchings', 'maximum matching']"
13291,1704.02809,Estefania Talavera,"Estefania Talavera, Mariella Dimiccoli, Marc Bola\~nos, Maedeh Aghaei,
  and Petia Radeva",R-Clustering for Egocentric Video Segmentation,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a new method for egocentric video temporal
segmentation based on integrating a statistical mean change detector and
agglomerative clustering(AC) within an energy-minimization framework. Given the
tendency of most AC methods to oversegment video sequences when clustering
their frames, we combine the clustering with a concept drift detection
technique (ADWIN) that has rigorous guarantee of performances. ADWIN serves as
a statistical upper bound for the clustering-based video segmentation. We
integrate both techniques in an energy-minimization framework that serves to
disambiguate the decision of both techniques and to complete the segmentation
taking into account the temporal continuity of video frames descriptors. We
present experiments over egocentric sets of more than 13.000 images acquired
with different wearable cameras, showing that our method outperforms
state-of-the-art clustering methods.
","[{'version': 'v1', 'created': 'Mon, 10 Apr 2017 11:36:01 GMT'}]",2017-04-11,"[['Talavera', 'Estefania', ''], ['Dimiccoli', 'Mariella', ''], ['Bolaños', 'Marc', ''], ['Aghaei', 'Maedeh', ''], ['Radeva', 'Petia', '']]","['Temporal video segmentation', 'egocentric videos', 'clustering']"
13292,0910.3348,Harris Georgiou,Harris Georgiou,"Algorithms for Image Analysis and Combination of Pattern Classifiers
  with Application to Medical Diagnosis","PhD thesis summary, 12 pages",,,,cs.CV cs.AI cs.GT cs.NE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Medical Informatics and the application of modern signal processing in the
assistance of the diagnostic process in medical imaging is one of the more
recent and active research areas today. This thesis addresses a variety of
issues related to the general problem of medical image analysis, specifically
in mammography, and presents a series of algorithms and design approaches for
all the intermediate levels of a modern system for computer-aided diagnosis
(CAD). The diagnostic problem is analyzed with a systematic approach, first
defining the imaging characteristics and features that are relevant to probable
pathology in mammo-grams. Next, these features are quantified and fused into
new, integrated radio-logical systems that exhibit embedded digital signal
processing, in order to improve the final result and minimize the radiological
dose for the patient. In a higher level, special algorithms are designed for
detecting and encoding these clinically interest-ing imaging features, in order
to be used as input to advanced pattern classifiers and machine learning
models. Finally, these approaches are extended in multi-classifier models under
the scope of Game Theory and optimum collective deci-sion, in order to produce
efficient solutions for combining classifiers with minimum computational costs
for advanced diagnostic systems. The material covered in this thesis is related
to a total of 18 published papers, 6 in scientific journals and 12 in
international conferences.
","[{'version': 'v1', 'created': 'Sun, 18 Oct 2009 03:31:33 GMT'}]",2009-10-20,"[['Georgiou', 'Harris', '']]","['computer-aided diagnosis (CAD)', 'medical image', 'mammography', 'pattern recognition', 'classifier combination', 'game theory']"
13293,1412.8341,Pavel H\'ala,Pavel H\'ala,Spectral classification using convolutional neural networks,"71 pages, 50 figures, Master's thesis, Masaryk University",,,,cs.CV astro-ph.IM cs.NE,http://creativecommons.org/licenses/by/3.0/,"  There is a great need for accurate and autonomous spectral classification
methods in astrophysics. This thesis is about training a convolutional neural
network (ConvNet) to recognize an object class (quasar, star or galaxy) from
one-dimension spectra only. Author developed several scripts and C programs for
datasets preparation, preprocessing and postprocessing of the data. EBLearn
library (developed by Pierre Sermanet and Yann LeCun) was used to create
ConvNets. Application on dataset of more than 60000 spectra yielded success
rate of nearly 95%. This thesis conclusively proved great potential of
convolutional neural networks and deep learning methods in astrophysics.
","[{'version': 'v1', 'created': 'Mon, 29 Dec 2014 13:47:06 GMT'}]",2014-12-30,"[['Hála', 'Pavel', '']]","['classification', 'spectra', 'galaxies', 'deep learning', 'artificial intelligence', 'quasars', 'stars', 'convolutional neural network']"
13294,0712.2262,Ian T Foster,"David Bernholdt, Shishir Bharathi, David Brown, Kasidit Chanchio,
  Meili Chen, Ann Chervenak, Luca Cinquini, Bob Drach, Ian Foster, Peter Fox,
  Jose Garcia, Carl Kesselman, Rob Markel, Don Middleton, Veronika Nefedova,
  Line Pouchard, Arie Shoshani, Alex Sim, Gary Strand, Dean Williams","The Earth System Grid: Supporting the Next Generation of Climate
  Modeling Research",,,,,cs.CE cs.DC cs.NI,,"  Understanding the earth's climate system and how it might be changing is a
preeminent scientific challenge. Global climate models are used to simulate
past, present, and future climates, and experiments are executed continuously
on an array of distributed supercomputers. The resulting data archive, spread
over several sites, currently contains upwards of 100 TB of simulation data and
is growing rapidly. Looking toward mid-decade and beyond, we must anticipate
and prepare for distributed climate research data holdings of many petabytes.
The Earth System Grid (ESG) is a collaborative interdisciplinary project aimed
at addressing the challenge of enabling management, discovery, access, and
analysis of these critically important datasets in a distributed and
heterogeneous computational environment. The problem is fundamentally a Grid
problem. Building upon the Globus toolkit and a variety of other technologies,
ESG is developing an environment that addresses authentication, authorization
for data access, large-scale data transport and management, services and
abstractions for high-performance remote data access, mechanisms for scalable
data replication, cataloging with rich semantic and syntactic information, data
discovery, distributed monitoring, and Web-based portals for using the system.
","[{'version': 'v1', 'created': 'Thu, 13 Dec 2007 23:39:04 GMT'}]",2007-12-17,"[['Bernholdt', 'David', ''], ['Bharathi', 'Shishir', ''], ['Brown', 'David', ''], ['Chanchio', 'Kasidit', ''], ['Chen', 'Meili', ''], ['Chervenak', 'Ann', ''], ['Cinquini', 'Luca', ''], ['Drach', 'Bob', ''], ['Foster', 'Ian', ''], ['Fox', 'Peter', ''], ['Garcia', 'Jose', ''], ['Kesselman', 'Carl', ''], ['Markel', 'Rob', ''], ['Middleton', 'Don', ''], ['Nefedova', 'Veronika', ''], ['Pouchard', 'Line', ''], ['Shoshani', 'Arie', ''], ['Sim', 'Alex', ''], ['Strand', 'Gary', ''], ['Williams', 'Dean', '']]","['Climate modeling', 'data management', 'Earth SystemGrid (ESG)', 'Grid computing']"
13295,1707.09757,Mahdi Jafari Siavoshani,"Mahdi Jafari Siavoshani, Farzad Parvaresh, Ali Pourmiri, Seyed Pooya
  Shariatpanahi",Coded Load Balancing in Cache Networks,The paper is 12 pages and contains 8 figures,,,,cs.IT cs.DS cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider load balancing problem in a cache network consisting of
storage-enabled servers forming a distributed content delivery scenario.
Previously proposed load balancing solutions cannot perfectly balance out
requests among servers, which is a critical issue in practical networks.
Therefore, in this paper, we investigate a coded cache content placement where
coded chunks of original files are stored in servers based on the files
popularity distribution. In our scheme, upon each request arrival at the
delivery phase, by dispatching enough coded chunks to the request origin from
the nearest servers, the requested file can be decoded.
  Here, we show that if $n$ requests arrive randomly at $n$ servers, the
proposed scheme results in the maximum load of $O(1)$ in the network. This
result is shown to be valid under various assumptions for the underlying
network topology. Our results should be compared to the maximum load of two
baseline schemes, namely, nearest replica and power of two choices strategies,
which are $\Theta(\log n)$ and $\Theta(\log \log n)$, respectively. This
finding shows that using coding, results in a considerable load balancing
performance improvement, without compromising communications cost performance.
This is confirmed by performing extensive simulation results, in non-asymptotic
regimes as well.
","[{'version': 'v1', 'created': 'Mon, 31 Jul 2017 08:36:30 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Aug 2019 09:43:17 GMT'}]",2019-08-06,"[['Siavoshani', 'Mahdi Jafari', ''], ['Parvaresh', 'Farzad', ''], ['Pourmiri', 'Ali', ''], ['Shariatpanahi', 'Seyed Pooya', '']]","['Distributed Caching Servers', 'Content Delivery Networks', 'Coded Caching', 'Request Routing', 'Load Balancing', 'Communication Cost']"
13296,1501.03994,Ha Bui,"Yilin Gui, Ha H. Bui, Jayantha Kodikara","Numerical modelling of sandstone uniaxial compression test using a
  mix-mode cohesive fracture model",,,,,cs.CE physics.geo-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A mix-mode cohesive fracture model considering tension, compression and shear
material behaviour is presented, which has wide applications to geotechnical
problems. The model considers both elastic and inelastic displacements.
Inelastic displacement comprises fracture and plastic displacements. The norm
of inelastic displacement is used to control the fracture behaviour. Meantime,
a failure function describing the fracture strength is proposed. Using the
internal programming FISH, the cohesive fracture model is programmed into a
hybrid distinct element algorithm as encoded in Universal Distinct Element Code
(UDEC). The model is verified through uniaxial tension and direct shear tests.
The developed model is then applied to model the behaviour of a uniaxial
compression test on Gosford sandstone. The modelling results indicate that the
proposed cohesive fracture model is capable of simulating combined failure
behaviour applicable to rock.
","[{'version': 'v1', 'created': 'Fri, 16 Jan 2015 14:45:29 GMT'}]",2015-01-19,"[['Gui', 'Yilin', ''], ['Bui', 'Ha H.', ''], ['Kodikara', 'Jayantha', '']]","['cohesive fracture model', 'mix-mode fracture model', 'uniaxial compression test', 'compression', 'tension', 'shear']"
13297,1505.02508,Elmir Badr,"Abir Elmir, Badr Elmir, Bouchaib Bounabat","Inter organizational System Management for integrated service delivery:
  an Enterprise Architecture Perspective","10 pages, 7 figures, 2 tables. arXiv admin note: text overlap with
  arXiv:1110.1277 by other authors","IJCSI International Journal of Computer Science Issues, Volume 12,
  Issue 2, March 2015",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Service sharing is a prominent operating model to support business. Many
large inter-organizational networks have implemented some form of value added
integrated services in order to reach efficiency and to reduce costs
sustainably. Coupling Service orientation with enterprise architecture paradigm
is very important at improving organizational performance through business
process optimization. Indeed, enterprise architecture management is
increasingly discussed because of information system role as part of achieving
the strategic direction of value creation and contribution to economic growth.
Also, system architecture promotes synergy and business efficiency for
inter-organizational collaboration. For this purpose, this work proposes a
review of service oriented enterprise architecture. This review, enumerates
several integrative and collaborative frameworks for integrated service
delivery.
","[{'version': 'v1', 'created': 'Mon, 11 May 2015 07:36:13 GMT'}]",2015-05-12,"[['Elmir', 'Abir', ''], ['Elmir', 'Badr', ''], ['Bounabat', 'Bouchaib', '']]","['Integrated delivery network', 'Information system management', 'Service orientation', 'Enterprise architecture framework']"
13298,1609.05705,Renato Krohling,"R.A. Krohling, Artem dos Santos, A.G.C. Pacheco",TODIM and TOPSIS with Z-numbers,15 pages,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present an approach that is able to handle with Z-numbers
in the context of Multi-Criteria Decision Making (MCDM) problems. Z-numbers are
composed of two parts, the first one is a restriction on the values that can be
assumed, and the second part is the reliability of the information. As human
beings we communicate with other people by means of natural language using
sentences like: the journey time from home to university takes about half hour,
very likely. Firstly, Z-numbers are converted to fuzzy numbers using a standard
procedure. Next, the Z-TODIM and Z-TOPSIS are presented as a direct extension
of the fuzzy TODIM and fuzzy TOPSIS, respectively. The proposed methods are
applied to two case studies and compared with the standard approach using crisp
values. Results obtained show the feasibility of the approach. In addition, a
graphical interface was built to handle with both methods Z- TODIM and Z-TOPSIS
allowing ease of use for user in other areas of knowledge.
","[{'version': 'v1', 'created': 'Mon, 19 Sep 2016 13:13:19 GMT'}]",2016-09-20,"[['Krohling', 'R. A.', ''], ['Santos', 'Artem dos', ''], ['Pacheco', 'A. G. C.', '']]","['Multi-criteria decision making (MCDM)', 'TODIM', 'TOPSIS', 'Fuzzy number', 'Znumber']"
13299,1610.03902,Susmita Dey Manasi,"S. Dey Manasi, M. M. Al Rashid, J. Atulasimha, S. Bandyopadhyay, A. R.
  Trivedi","Straintronic magneto-tunneling-junction based ternary content
  addressable memory","8 pages, 11 figures","Part I: IEEE Transactions on Electron Devices (Volume: 64, Issue:
  7, Page(s): 2835-2841, July 2017), Part II: IEEE Transactions on Electron
  Devices (Volume: 64, Issue: 7, Page(s): 2842-2848, July 2017)",,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Straintronic magneto-tunneling junction (s-MTJ) switches, whose resistances
are controlled with voltage-generated strain in the magnetostrictive free layer
of the MTJ, are extremely energy-efficient switches that would dissipate a few
aJ of energy during switching. Unfortunately, they are also relatively
error-prone and have low resistance on/off ratio. This suggests that as
computing elements, they are best suited for non-Boolean architectures. Here,
we propose and analyze a ternary content addressable memory implemented with
s-MTJs and some transistors. It overcomes challenges encountered by traditional
all-transistor implementations, resulting in exceptionally high cell density.
","[{'version': 'v1', 'created': 'Thu, 13 Oct 2016 00:37:44 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Oct 2016 21:31:38 GMT'}]",2017-07-18,"[['Manasi', 'S. Dey', ''], ['Rashid', 'M. M. Al', ''], ['Atulasimha', 'J.', ''], ['Bandyopadhyay', 'S.', ''], ['Trivedi', 'A. R.', '']]","['Ternary content addressable memory', 'non-Boolean computing', 'straintronics', 'nanomagnets']"
13300,1109.6925,Clemens P J Adolphs,C. P. J. Adolphs and P. Berenbrink,Distributed Selfish Load Balancing with Weights and Speeds,"29 pages, submitted to STACS 2012",,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider neighborhood load balancing in the context of
selfish clients. We assume that a network of n processors and m tasks is given.
The processors may have different speeds and the tasks may have different
weights. Every task is controlled by a selfish user. The objective of the user
is to allocate his/her task to a processor with minimum load. We revisit the
concurrent probabilistic protocol introduced in [6], which works in sequential
rounds. In each round every task is allowed to query the load of one randomly
chosen neighboring processor. If that load is smaller the task will migrate to
that processor with a suitably chosen probability. Using techniques from
spectral graph theory we obtain upper bounds on the expected convergence time
towards approximate and exact Nash equilibria that are significantly better
than the previous results in [6]. We show results for uniform tasks on
non-uniform processors and the general case where the tasks have different
weights and the machines have speeds. To the best of our knowledge, these are
the first results for this general setting.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2011 18:49:41 GMT'}]",2011-10-03,"[['Adolphs', 'C. P. J.', ''], ['Berenbrink', 'P.', '']]","['Load balancing', 'reallocation', 'equilibrium', 'convergence']"
13301,1403.7162,Vishal Jain,"Gagandeep Singh, Vishal Jain",Information Retrieval (IR) through Semantic Web (SW): An Overview,,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A large amount of data is present on the web. It contains huge number of web
pages and to find suitable information from them is very cumbersome task. There
is need to organize data in formal manner so that user can easily access and
use them. To retrieve information from documents, we have many Information
Retrieval (IR) techniques. Current IR techniques are not so advanced that they
can be able to exploit semantic knowledge within documents and give precise
results. IR technology is major factor responsible for handling annotations in
Semantic Web (SW) languages and in the present paper knowledgeable
representation languages used for retrieving information are discussed.
","[{'version': 'v1', 'created': 'Thu, 27 Mar 2014 18:36:15 GMT'}]",2014-03-28,"[['Singh', 'Gagandeep', ''], ['Jain', 'Vishal', '']]","['Semantic Web (SW)', 'Information Retrieval (IR)', 'Ontology', 'Hybrid Information Retrieval (HIR)']"
13302,1107.4222,Hakob Aslanyan Hakob Aslanyan,Hakob Aslanyan,Interference minimization in physical model of wireless networks,,"International Journal of Information Theories and Applications,
  2010. ITHEA2010: Volume 17, Number 3, 221-232",,,cs.DS cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interference minimization problem in wireless sensor and ad-hoc networks is
considered. That is to assign a transmission power to each node of a network
such that the network is connected and at the same time the maximum of
accumulated signal straight on network nodes is minimum. Previous works on
interference minimization in wireless networks mainly consider the disk graph
model of network. For disk graph model two approximation algorithms with
$O(\sqrt{n})$ and $O((opt\ln{n})^{2})$ upper bounds of maximum interference are
known, where $n$ is the number of nodes and $opt$ is the minimal interference
of a given network. In current work we consider more general interference
model, the physical interference model, where sender nodes' signal straight on
a given node is a function of a sender/receiver node pair and sender nodes'
transmission power. For this model we give a polynomial time approximation
algorithm which finds a connected network with at most
$O((opt\ln{n})^{2}/\beta)$ interference, where $\beta \geq 1$ is the minimum
signal straight necessary on receiver node for successfully receiving a
message.
","[{'version': 'v1', 'created': 'Thu, 21 Jul 2011 10:07:27 GMT'}]",2011-07-22,"[['Aslanyan', 'Hakob', '']]","['interference', 'wireless networks', 'graph connectivity', 'set cover', 'randomized rounding']"
13303,1610.02769,Shuang Zhao,"Shuang Zhao, Fredo Durand, Changxi Zheng",Inverse Diffusion Curves using Shape Optimization,14 pages,,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The inverse diffusion curve problem focuses on automatic creation of
diffusion curve images that resemble user provided color fields. This problem
is challenging since the 1D curves have a nonlinear and global impact on
resulting color fields via a partial differential equation (PDE). We introduce
a new approach complementary to previous methods by optimizing curve geometry.
In particular, we propose a novel iterative algorithm based on the theory of
shape derivatives. The resulting diffusion curves are clean and well-shaped,
and the final image closely approximates the input. Our method provides a
user-controlled parameter to regularize curve complexity, and generalizes to
handle input color fields represented in a variety of formats.
","[{'version': 'v1', 'created': 'Mon, 10 Oct 2016 03:57:40 GMT'}]",2016-10-11,"[['Zhao', 'Shuang', ''], ['Durand', 'Fredo', ''], ['Zheng', 'Changxi', '']]","['Vector graphics', 'diffusion curves', 'inverse problem', 'shape optimization', 'Fréchet derivative']"
13304,1701.04569,Timothy Ganesan PhD,"T.Ganesan, P.Vasant, I.Elamvazuthi","Multiobjective Optimization of Solar Powered Irrigation System with
  Fuzzy Type-2 Noise Modelling","27 pages, 12 Figures","2016, Emerging Research on Applied Fuzzy Sets and Intuitionistic
  Fuzzy Matrices, IGI Global, 189 pages",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optimization is becoming a crucial element in industrial applications
involving sustainable alternative energy systems. During the design of such
systems, the engineer/decision maker would often encounter noise factors (e.g.
solar insolation and ambient temperature fluctuations) when their system
interacts with the environment. In this chapter, the sizing and design
optimization of the solar powered irrigation system was considered. This
problem is multivariate, noisy, nonlinear and multiobjective. This design
problem was tackled by first using the Fuzzy Type II approach to model the
noise factors. Consequently, the Bacterial Foraging Algorithm (BFA) (in the
context of a weighted sum framework) was employed to solve this multiobjective
fuzzy design problem. This method was then used to construct the approximate
Pareto frontier as well as to identify the best solution option in a fuzzy
setting. Comprehensive analyses and discussions were performed on the generated
numerical results with respect to the implemented solution methods.
","[{'version': 'v1', 'created': 'Tue, 17 Jan 2017 08:52:48 GMT'}]",2017-01-18,"[['Ganesan', 'T.', ''], ['Vasant', 'P.', ''], ['Elamvazuthi', 'I.', '']]","['solar-powered irrigation system', 'metaheuristics', 'multiobjective optimization', 'type-2 fuzzy logic', 'swarm intelligence', 'bacteria foraging algorithm']"
13305,1502.03943,Robert B. Allen,Robert B. Allen,"Improving Access to Digitized Historical Newspapers with Text Mining,
  Coordinated Models, and Formative User Interface Design","IFLA Newspaper Section IFLA Newspaper Meeting, New Delhi, February
  2010",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most tools for accessing digitized historical newspapers emphasize relatively
simple search; but, as increasing numbers of digitized historical newspapers
and other historical resources become available we can consider much richer
modes of interaction with these collections. For instance, users might use
exploratory search for looking at larger issues and events such as elections
and campaigns or to get a sense of ""the texture of the city"" or ""what the city
was thinking"". To take full advantage of rich interface tools, the content of
the newspapers needs to be described systematically and accurately. Moreover,
collections of multiple newspapers need to be richly cross-indexed across
titles and even with historical resources beyond the newspapers.
","[{'version': 'v1', 'created': 'Fri, 13 Feb 2015 11:12:55 GMT'}]",2015-02-16,"[['Allen', 'Robert B.', '']]","['History', 'Interviews', 'Modeling Events', 'Text Processing', 'User Interfaces']"
13306,1610.04807,Fan Wei,Omer Angel and S\'ebastien Bubeck and Yuval Peres and Fan Wei,Local max-cut in smoothed polynomial time,added some remarks and corollaries; to appear in STOC 2017,,,,cs.DS math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 1988, Johnson, Papadimitriou and Yannakakis wrote that ""Practically all
the empirical evidence would lead us to conclude that finding locally optimal
solutions is much easier than solving NP-hard problems"". Since then the
empirical evidence has continued to amass, but formal proofs of this phenomenon
have remained elusive. A canonical (and indeed complete) example is the local
max-cut problem, for which no polynomial time method is known. In a
breakthrough paper, Etscheid and R\""oglin proved that the smoothed complexity
of local max-cut is quasi-polynomial, i.e., if arbitrary bounded weights are
randomly perturbed, a local maximum can be found in $n^{O(\log n)}$ steps. In
this paper we prove smoothed polynomial complexity for local max-cut, thus
confirming that finding local optima for max-cut is much easier than solving
it.
","[{'version': 'v1', 'created': 'Sun, 16 Oct 2016 01:32:48 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Dec 2016 17:07:53 GMT'}, {'version': 'v3', 'created': 'Mon, 10 Apr 2017 18:42:34 GMT'}]",2017-04-12,"[['Angel', 'Omer', ''], ['Bubeck', 'Sébastien', ''], ['Peres', 'Yuval', ''], ['Wei', 'Fan', '']]","['Smoothed analysis', 'Max-cut', 'Polynomial running time', 'Hopfieldnetwork', 'Nash equilibrium', 'Potential game', 'Sherrington-Kirkpatrickmodel']"
13307,0908.0595,Gene Golovchinsky,Brynn M. Evans and Ed H. Chi,Towards a Model of Understanding Social Search,"Presented at 1st Intl Workshop on Collaborative Information Seeking,
  2008 (arXiv:0908.0583)",,,JCDL2008CIRWS/2008/evachi,cs.IR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Search engine researchers typically depict search as the solitary activity of
an individual searcher. In contrast, results from our critical-incident survey
of 150 users on Amazon's Mechanical Turk service suggest that social
interactions play an important role throughout the search process. Our main
contribution is that we have integrated models from previous work in
sensemaking and information seeking behavior to present a canonical social
model of user activities before, during, and after search, suggesting where in
the search process even implicitly shared information may be valuable to
individual searchers.
","[{'version': 'v1', 'created': 'Wed, 5 Aug 2009 17:09:45 GMT'}]",2009-08-06,"[['Evans', 'Brynn M.', ''], ['Chi', 'Ed H.', '']]","['Social search', 'social navigation', 'information seeking', 'sensemaking', 'web browsing']"
13308,1111.5293,Pramod Sukhadeve,Sanjay K. Dwivedi and Pramod P. Sukhadeve,Rule based Part of speech Tagger for Homoeopathy Clinical realm,,,,,cs.CL,http://creativecommons.org/licenses/by/3.0/,"  A tagger is a mandatory segment of most text scrutiny systems, as it
consigned a s yntax class (e.g., noun, verb, adjective, and adverb) to every
word in a sentence. In this paper, we present a simple part of speech tagger
for homoeopathy clinical language. This paper reports about the anticipated
part of speech tagger for homoeopathy clinical language. It exploit standard
pattern for evaluating sentences, untagged clinical corpus of 20085 words is
used, from which we had selected 125 sentences (2322 tokens). The problem of
tagging in natural language processing is to find a way to tag every word in a
text as a meticulous part of speech. The basic idea is to apply a set of rules
on clinical sentences and on each word, Accuracy is the leading factor in
evaluating any POS tagger so the accuracy of proposed tagger is also conversed.
","[{'version': 'v1', 'created': 'Sun, 13 Nov 2011 18:19:15 GMT'}]",2011-11-23,"[['Dwivedi', 'Sanjay K.', ''], ['Sukhadeve', 'Pramod P.', '']]","['POS tagging', 'Natural language processing', 'Grammar rules', 'Homoeopathic Corpus']"
13309,1104.5387,Ahmed Sharaf Eng,"M. Z. Rashed, Ahmed E. Hassan and Ahmed I. Sharaf",Model based system engineering approach of a lightweight embedded TCP/IP,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of embedded software is growing very rapidly. Accessing the internet
is a necessary service which has large range of applications in many fields.
The Internet is based on TCP/IP which is a very important stack. Although
TCP/IP is very important there is not a software engineering model describing
it. The common method in modeling and describing TCP/IP is RFCs which is not
sufficient for software engineer and developers. Therefore there is a need for
software engineering approach to help engineers and developers to customize
their own web based applications for embedded systems. This research presents a
model based system engineering approach of lightweight TCP/IP. The model
contains the necessary phases for developing a lightweight TCP/IP for embedded
systems. The proposed model is based on SysML as a model based system
engineering language.
","[{'version': 'v1', 'created': 'Thu, 28 Apr 2011 13:36:34 GMT'}]",2011-04-29,"[['Rashed', 'M. Z.', ''], ['Hassan', 'Ahmed E.', ''], ['Sharaf', 'Ahmed I.', '']]","['Communication protocol', 'embedded systems', 'TCP/IP', 'SysML', 'system engineering']"
13310,1206.1426,Maher Heni,Maher Heni and Ammar Bouallegue and Ridha Bouallegue,Energy Consumption Model in ad hoc Mobile Network,"11 pages 5 figures results found after publication of a paper in
  IJWMN; (2012),""Power Control in reactive routing protocol for mobile ad hoc
  network"", International Journal of Wireless & Mobile Networks (IJWMN)",,,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  The aim of this work is to model the nodes battery discharge in wireless ad
hoc networks. Many work focus on the energy consumption in such networks. Even,
the research in the highest layers of the ISO model, takes into account the
energy consumption and efficiency. Indeed, the nodes that form such network are
mobiles, so no instant recharge of battery. Also with special type of ad hoc
networks are wireless sensors networks using non-rechargeable batteries. All
nodes with an exhausted battery are considered death and left the network. To
consider the energy consumption, in this work we model using a Markov chain,
the discharge of the battery considering of instant activation and deactivation
distribution function of these nodes.
","[{'version': 'v1', 'created': 'Thu, 7 Jun 2012 09:12:10 GMT'}]",2012-06-08,"[['Heni', 'Maher', ''], ['Bouallegue', 'Ammar', ''], ['Bouallegue', 'Ridha', '']]","['Wireless Ad-hoc network', 'energy consumption', 'Markov chain', 'distribution function', 'performances evolution   1']"
13311,0806.4372,Stavros Nikolopoulos D.,Katerina Asdre and Stavros D. Nikolopoulos,The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph,,,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a variant of the path cover problem, namely, the
$k$-fixed-endpoint path cover problem, or kPC for short, on interval graphs.
Given a graph $G$ and a subset $\mathcal{T}$ of $k$ vertices of $V(G)$, a
$k$-fixed-endpoint path cover of $G$ with respect to $\mathcal{T}$ is a set of
vertex-disjoint paths $\mathcal{P}$ that covers the vertices of $G$ such that
the $k$ vertices of $\mathcal{T}$ are all endpoints of the paths in
$\mathcal{P}$. The kPC problem is to find a $k$-fixed-endpoint path cover of
$G$ of minimum cardinality; note that, if $\mathcal{T}$ is empty the stated
problem coincides with the classical path cover problem. In this paper, we
study the 1-fixed-endpoint path cover problem on interval graphs, or 1PC for
short, generalizing the 1HP problem which has been proved to be NP-complete
even for small classes of graphs. Motivated by a work of Damaschke, where he
left both 1HP and 2HP problems open for the class of interval graphs, we show
that the 1PC problem can be solved in polynomial time on the class of interval
graphs. The proposed algorithm is simple, runs in $O(n^2)$ time, requires
linear space, and also enables us to solve the 1HP problem on interval graphs
within the same time and space complexity.
","[{'version': 'v1', 'created': 'Thu, 26 Jun 2008 18:13:31 GMT'}]",2008-12-18,"[['Asdre', 'Katerina', ''], ['Nikolopoulos', 'Stavros D.', '']]","['perfect graphs', 'interval graphs', 'path cover', 'fixed-endpoint path cover', 'lineartime algorithms']"
13312,1004.1707,Rdv Ijcsis,"C. V. Seshaiah, S. Nagarani",A Survey on Space-Time Turbo Codes,"IEEE Publication format, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","IJCSIS, Vol. 7 No. 3, March 2010, 171-177",,,cs.IT math.IT,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  As wireless communication systems look intently to compose the transition
from voice communication to interactive Internet data, achieving higher bit
rates becomes both increasingly desirable and challenging. Space-time coding
(STC) is a communications technique for wireless systems that inhabit multiple
transmit antennas and single or multiple receive antennas. Space-time codes
make use of advantage of both the spatial diversity provided by multiple
antennas and the temporal diversity available with time-varying fading.
Space-time codes can be divided into block codes and trellis codes. Space-time
trellis coding merges signal processing at the receiver with coding techniques
appropriate to multiple transmit antennas. The advantages of space-time codes
(STC) make it extremely remarkable for high-rate wireless applications. Initial
STC research efforts focused on narrowband flat-fading channels. The decoding
complexity of Space-time turbo codes STTC increases exponentially as a function
of the diversity level and transmission rate. This proposed paper provides an
over view on various techniques used for the design of space-time turbo codes.
This paper also discusses the techniques handled by researchers to built
encoder and decoder section for multiple transmits and receives antennas. In
addition the future enhancement gives a general idea for improvement and
development of various codes which will involve implementing viterbi decoder
with soft decoding in a multi-antenna scenario. In addition the space-time code
may be analyzed using some of the available metrics and finally to simulate it
for different receive antenna configurations.
","[{'version': 'v1', 'created': 'Sat, 10 Apr 2010 10:57:03 GMT'}]",2010-04-13,"[['Seshaiah', 'C. V.', ''], ['Nagarani', 'S.', '']]","['Antenna', 'Bit Rate', 'Block Codes', 'Diversity', 'Space-Time Coding (STC)', 'Transmitter', 'Trellis Codes', 'Viterbi Decoder']"
13313,1705.06511,Daniela Briola,"Oscar Cornejo, Daniela Briola, Daniela Micucci, Leonardo Mariani",In The Field Monitoring of Interactive Applications,"IEEE Copyright, Accepted for pubblication in ICSE 2017, Nier Track",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Monitoring techniques can extract accurate data about the behavior of
software systems. When used in the field, they can reveal how applications
behave in real-world contexts and how programs are actually exercised by their
users. Nevertheless, since monitoring might need significant storage and
computational resources, it may interfere with users activities degrading the
quality of the user experience. While the impact of monitoring has been
typically studied by measuring the overhead that it may introduce in a
monitored application, there is little knowledge about how monitoring solutions
may actually impact on the user experience and to what extent users may
recognize their presence. In this paper, we present our investigation on how
collecting data in the field may impact the quality of the user experience. Our
initial results show that non-trivial overhead can be tolerated by users,
depending on the kind of activity that is performed. This opens interesting
opportunities for research in monitoring solutions, which could be designed to
opportunistically
","[{'version': 'v1', 'created': 'Thu, 18 May 2017 10:26:48 GMT'}]",2017-05-19,"[['Cornejo', 'Oscar', ''], ['Briola', 'Daniela', ''], ['Micucci', 'Daniela', ''], ['Mariani', 'Leonardo', '']]","['Monitoring', 'dynamic analysis', 'user experience']"
13314,1301.4558,Walid Mahdi,"Salah Werda, Walid Mahdi and Abdelmajid Ben Hamadou",Lip Localization and Viseme Classification for Visual Speech Recognition,14 pages,"International Journal of Computing and Information Sciences ISSN:
  1708-0460 (print) - 1708-0479 (online) Volume 5, Number 1, December 2007",,"Vol.5, No.1, pp. 62-75, 2006",cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The need for an automatic lip-reading system is ever increasing. Infact,
today, extraction and reliable analysis of facial movements make up an
important part in many multimedia systems such as videoconference, low
communication systems, lip-reading systems. In addition, visual information is
imperative among people with special needs. We can imagine, for example, a
dependent person ordering a machine with an easy lip movement or by a simple
syllable pronunciation. Moreover, people with hearing problems compensate for
their special needs by lip-reading as well as listening to the person with
whome they are talking.
","[{'version': 'v1', 'created': 'Sat, 19 Jan 2013 11:36:53 GMT'}]",2013-02-19,"[['Werda', 'Salah', ''], ['Mahdi', 'Walid', ''], ['Hamadou', 'Abdelmajid Ben', '']]","['visual information', 'lip-reading system', 'Human-Machine interaction', 'lip', 'spatial-temporal tracking']"
13315,1609.04060,Charith Perera,"Charith Perera, Ciaran McCormick, Arosha K. Bandara, Blaine A. Price,
  Bashar Nuseibeh","Privacy-by-Design Framework for Assessing Internet of Things
  Applications and Platforms","Accepted to be published in The 6th International Conference on the
  Internet of Things (IoT 2016) November 7-9, 2016 in Stuttgart, Germany","The 6th International Conference on the Internet of Things (IoT
  2016) November 7-9, 2016 in Stuttgart, Germany",,,cs.CY cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Internet of Things (IoT) systems are designed and developed either as
standalone applications from the ground-up or with the help of IoT middleware
platforms. They are designed to support different kinds of scenarios, such as
smart homes and smart cities. Thus far, privacy concerns have not been
explicitly considered by IoT applications and middleware platforms. This is
partly due to the lack of systematic methods for designing privacy that can
guide the software development process in IoT. In this paper, we propose a set
of guidelines, a privacy-by-design framework, that can be used to assess
privacy capabilities and gaps of existing IoT applications as well as
middleware platforms. We have evaluated two open source IoT middleware
platforms, namely OpenIoT and Eclipse SmartHome, to demonstrate how our
framework can be used in this way.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2016 21:35:28 GMT'}]",2016-10-02,"[['Perera', 'Charith', ''], ['McCormick', 'Ciaran', ''], ['Bandara', 'Arosha K.', ''], ['Price', 'Blaine A.', ''], ['Nuseibeh', 'Bashar', '']]","['Internet of Things', 'privacy', 'Software Engineering']"
13316,1510.03231,Olena Prianychnykova,"Igor Potapov, Olena Prianychnykova, Sergey Verlan",On insertion-deletion systems over relational words,"24 pages, 8 figures",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a new notion of a relational word as a finite totally ordered
set of positions endowed with three binary relations that describe which
positions are labeled by equal data, by unequal data and those having an
undefined relation between their labels. We define the operations of insertion
and deletion on relational words generalizing corresponding operations on
strings. We prove that the transitive and reflexive closure of these operations
has a decidable membership problem for the case of short insertion-deletion
rules (of size two/three and three/two). At the same time, we show that in the
general case such systems can produce a coding of any recursively enumerable
language leading to undecidabilty of reachability questions.
","[{'version': 'v1', 'created': 'Mon, 12 Oct 2015 11:14:51 GMT'}]",2015-10-13,"[['Potapov', 'Igor', ''], ['Prianychnykova', 'Olena', ''], ['Verlan', 'Sergey', '']]","['Infinite alphabet', 'relational words', 'insertion-deletion', 'membership']"
13317,1111.6082,Mehrdad Mahdavi,"Mehrdad Mahdavi, Rong Jin, Tianbao Yang","Trading Regret for Efficiency: Online Convex Optimization with Long Term
  Constraints",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a framework for solving constrained online convex
optimization problem. Our motivation stems from the observation that most
algorithms proposed for online convex optimization require a projection onto
the convex set $\mathcal{K}$ from which the decisions are made. While for
simple shapes (e.g. Euclidean ball) the projection is straightforward, for
arbitrary complex sets this is the main computational challenge and may be
inefficient in practice. In this paper, we consider an alternative online
convex optimization problem. Instead of requiring decisions belong to
$\mathcal{K}$ for all rounds, we only require that the constraints which define
the set $\mathcal{K}$ be satisfied in the long run. We show that our framework
can be utilized to solve a relaxed version of online learning with side
constraints addressed in \cite{DBLP:conf/colt/MannorT06} and
\cite{DBLP:conf/aaai/KvetonYTM08}. By turning the problem into an online
convex-concave optimization problem, we propose an efficient algorithm which
achieves $\tilde{\mathcal{O}}(\sqrt{T})$ regret bound and
$\tilde{\mathcal{O}}(T^{3/4})$ bound for the violation of constraints. Then we
modify the algorithm in order to guarantee that the constraints are satisfied
in the long run. This gain is achieved at the price of getting
$\tilde{\mathcal{O}}(T^{3/4})$ regret bound. Our second algorithm is based on
the Mirror Prox method \citep{nemirovski-2005-prox} to solve variational
inequalities which achieves $\tilde{\mathcal{\mathcal{O}}}(T^{2/3})$ bound for
both regret and the violation of constraints when the domain $\K$ can be
described by a finite number of linear constraints. Finally, we extend the
result to the setting where we only have partial access to the convex set
$\mathcal{K}$ and propose a multipoint bandit feedback algorithm with the same
bounds in expectation as our first algorithm.
","[{'version': 'v1', 'created': 'Fri, 25 Nov 2011 18:51:29 GMT'}, {'version': 'v2', 'created': 'Wed, 9 May 2012 15:21:25 GMT'}, {'version': 'v3', 'created': 'Thu, 27 Sep 2012 22:02:49 GMT'}]",2012-10-01,"[['Mahdavi', 'Mehrdad', ''], ['Jin', 'Rong', ''], ['Yang', 'Tianbao', '']]","['online convex optimization', 'convex-concave optimization', 'bandit feedback', 'variational inequality']"
13318,1609.03663,Tong Wang,"Tong Wang, Ping Chen, Kevin Amaral, Jipeng Qiang","An Experimental Study of LSTM Encoder-Decoder Model for Text
  Simplification",,,,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Text simplification (TS) aims to reduce the lexical and structural complexity
of a text, while still retaining the semantic meaning. Current automatic TS
techniques are limited to either lexical-level applications or manually
defining a large amount of rules. Since deep neural networks are powerful
models that have achieved excellent performance over many difficult tasks, in
this paper, we propose to use the Long Short-Term Memory (LSTM) Encoder-Decoder
model for sentence level TS, which makes minimal assumptions about word
sequence. We conduct preliminary experiments to find that the model is able to
learn operation rules such as reversing, sorting and replacing from sequence
pairs, which shows that the model may potentially discover and apply rules such
as modifying sentence structure, substituting words, and removing words for TS.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2016 03:02:32 GMT'}]",2016-09-14,"[['Wang', 'Tong', ''], ['Chen', 'Ping', ''], ['Amaral', 'Kevin', ''], ['Qiang', 'Jipeng', '']]","['Text Simplification', 'LSTM', 'Encoder-Decoder']"
13319,1506.01003,Viktor Winschel,"Jules Hedges, Paulo Oliva, Evguenia Sprits, Viktor Winschel, Philipp
  Zahn",Higher-Order Decision Theory,arXiv admin note: text overlap with arXiv:1409.7411,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classical decision theory models behaviour in terms of utility maximisation
where utilities represent rational preference relations over outcomes. However,
empirical evidence and theoretical considerations suggest that we need to go
beyond this framework. We propose to represent goals by higher-order functions
or operators that take other functions as arguments where the max and argmax
operators are special cases. Our higher-order functions take a context function
as their argument where a context represents a process from actions to
outcomes. By that we can define goals being dependent on the actions and the
process in addition to outcomes only. This formulation generalises outcome
based preferences to context-dependent goals. We show how to uniformly
represent within our higher-order framework classical utility maximisation but
also various other extensions that have been debated in economics.
","[{'version': 'v1', 'created': 'Tue, 2 Jun 2015 19:40:46 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Jun 2015 04:36:18 GMT'}]",2015-06-04,"[['Hedges', 'Jules', ''], ['Oliva', 'Paulo', ''], ['Sprits', 'Evguenia', ''], ['Winschel', 'Viktor', ''], ['Zahn', 'Philipp', '']]","['behavioural economics', 'foundations of decision theory', 'Keynes’beauty contest', 'process orientation', 'higher order functions', 'quantifiers', 'selection functions']"
13320,1307.4952,Neha Gupta,"Sudip Mittal, Neha Gupta, Prateek Dewan, Ponnurangam Kumaraguru",The Pin-Bang Theory: Discovering The Pinterest World,"15 pages, 10 figures, 5 tables",,,,cs.SI cs.SY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pinterest is an image-based online social network, which was launched in the
year 2010 and has gained a lot of traction, ever since. Within 3 years,
Pinterest has attained 48.7 million unique users. This stupendous growth makes
it interesting to study Pinterest, and gives rise to multiple questions about
it's users, and content. We characterized Pinterest on the basis of large scale
crawls of 3.3 million user profiles, and 58.8 million pins. In particular, we
explored various attributes of users, pins, boards, pin sources, and user
locations, in detail and performed topical analysis of user generated textual
content. The characterization revealed most prominent topics among users and
pins, top image sources, and geographical distribution of users on Pinterest.
We then investigated this social network from a privacy and security
standpoint, and found traces of malware in the form of pin sources. Instances
of Personally Identifiable Information (PII) leakage were also discovered in
the form of phone numbers, BBM (Blackberry Messenger) pins, and email
addresses. Further, our analysis demonstrated how Pinterest is a potential
venue for copyright infringement, by showing that almost half of the images
shared on Pinterest go uncredited. To the best of our knowledge, this is the
first attempt to characterize Pinterest at such a large scale.
","[{'version': 'v1', 'created': 'Thu, 18 Jul 2013 14:14:55 GMT'}]",2013-07-19,"[['Mittal', 'Sudip', ''], ['Gupta', 'Neha', ''], ['Dewan', 'Prateek', ''], ['Kumaraguru', 'Ponnurangam', '']]","['Online social networks', 'Pin', 'Security and Privacy']"
13321,1402.5516,Peng Zhang,"Peng Zhang, Wei Chen, Xiaoming Sun, Yajun Wang, Jialin Zhang","Minimizing Seed Set Selection with Probabilistic Coverage Guarantee in a
  Social Network",Conference version will appear in KDD 2014,,,,cs.SI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A topic propagating in a social network reaches its tipping point if the
number of users discussing it in the network exceeds a critical threshold such
that a wide cascade on the topic is likely to occur. In this paper, we consider
the task of selecting initial seed users of a topic with minimum size so that
with a guaranteed probability the number of users discussing the topic would
reach a given threshold. We formulate the task as an optimization problem
called seed minimization with probabilistic coverage guarantee (SM-PCG). This
problem departs from the previous studies on social influence maximization or
seed minimization because it considers influence coverage with probabilistic
guarantees instead of guarantees on expected influence coverage. We show that
the problem is not submodular, and thus is harder than previously studied
problems based on submodular function optimization. We provide an approximation
algorithm and show that it approximates the optimal solution with both a
multiplicative ratio and an additive error. The multiplicative ratio is tight
while the additive error would be small if influence coverage distributions of
certain seed sets are well concentrated. For one-way bipartite graphs we
analytically prove the concentration condition and obtain an approximation
algorithm with an $O(\log n)$ multiplicative ratio and an $O(\sqrt{n})$
additive error, where $n$ is the total number of nodes in the social graph.
Moreover, we empirically verify the concentration condition in real-world
networks and experimentally demonstrate the effectiveness of our proposed
algorithm comparing to commonly adopted benchmark algorithms.
","[{'version': 'v1', 'created': 'Sat, 22 Feb 2014 15:24:12 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Jun 2014 17:41:41 GMT'}]",2014-06-19,"[['Zhang', 'Peng', ''], ['Chen', 'Wei', ''], ['Sun', 'Xiaoming', ''], ['Wang', 'Yajun', ''], ['Zhang', 'Jialin', '']]","['social networks', 'influence diffusion', 'independent cascade model', 'seed minimization']"
13322,1409.3206,Petko Georgiev,"Petko Georgiev, Nicholas D. Lane, Kiran K. Rachuri, Cecilia Mascolo","DSP.Ear: Leveraging Co-Processor Support for Continuous Audio Sensing on
  Smartphones","15 pages, 12th ACM Conference on Embedded Network Sensor Systems
  (SenSys '14)",,,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rapidly growing adoption of sensor-enabled smartphones has greatly fueled
the proliferation of applications that use phone sensors to monitor user
behavior. A central sensor among these is the microphone which enables, for
instance, the detection of valence in speech, or the identification of
speakers. Deploying multiple of these applications on a mobile device to
continuously monitor the audio environment allows for the acquisition of a
diverse range of sound-related contextual inferences. However, the cumulative
processing burden critically impacts the phone battery.
  To address this problem, we propose DSP.Ear - an integrated sensing system
that takes advantage of the latest low-power DSP co-processor technology in
commodity mobile devices to enable the continuous and simultaneous operation of
multiple established algorithms that perform complex audio inferences. The
system extracts emotions from voice, estimates the number of people in a room,
identifies the speakers, and detects commonly found ambient sounds, while
critically incurring little overhead to the device battery. This is achieved
through a series of pipeline optimizations that allow the computation to remain
largely on the DSP. Through detailed evaluation of our prototype implementation
we show that, by exploiting a smartphone's co-processor, DSP.Ear achieves a 3
to 7 times increase in the battery lifetime compared to a solution that uses
only the phone's main processor. In addition, DSP.Ear is 2 to 3 times more
power efficient than a naive DSP solution without optimizations. We further
analyze a large-scale dataset from 1320 Android users to show that in about
80-90% of the daily usage instances DSP.Ear is able to sustain a full day of
operation (even in the presence of other smartphone workloads) with a single
battery charge.
","[{'version': 'v1', 'created': 'Wed, 10 Sep 2014 19:30:58 GMT'}]",2014-09-15,"[['Georgiev', 'Petko', ''], ['Lane', 'Nicholas D.', ''], ['Rachuri', 'Kiran K.', ''], ['Mascolo', 'Cecilia', '']]","['mobile sensing', 'co-processor', 'DSP', 'energy', 'audio']"
13323,1310.0145,John Barco Mr,"John Barco, Andres Guerra, Luis Mu\~noz, Nicanor Quijano","Optimal Routing and Scheduling of Charge for Electric Vehicles: Case
  Study","Highlights: We present a methodology for charging and route
  assignment for a BEVs fleet. We study the case of an airport shuttle service.
  We found the effects of scheduling of charge on the battery lifetime. Some
  conditions to perform a V2B operation are presented. V2B operation is only
  profitable under nonrealistic scenarios",,,,cs.SY cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Colombia, there is an increasing interest about improving public
transportation. One of the proposed strategies in that way is the use battery
electric vehicles (BEVs). One of the new challenges is the BEVs routing
problem, which is subjected to the traditional issues of the routing problems,
and must also consider the particularities of autonomy, charge and battery
degradation of the BEVs. In this work, a scheme that coordinates the routing,
scheduling of charge and operating costs of BEVs is proposed. The simplified
operating costs have been modeled considering both charging fees and battery
degradation. A case study is presented, in order to illustrate the proposed
methodology. The given case considers an airport shuttle service scenario, in
which energy consumption of the BEVs is estimated based on experimentally
measured driving patterns.
","[{'version': 'v1', 'created': 'Tue, 1 Oct 2013 05:27:47 GMT'}]",2013-10-02,"[['Barco', 'John', ''], ['Guerra', 'Andres', ''], ['Muñoz', 'Luis', ''], ['Quijano', 'Nicanor', '']]","['Plug-in electric vehicles', 'battery charge', 'vehicle routing problem', 'differential evolution']"
13324,0910.2829,Matteo Pradella,"Matteo Pradella, Alessandra Cherubini, Stefano Crespi Reghizzi",A unifying approach to picture grammars,,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several old and recent classes of picture grammars, that variously extend
context-free string grammars in two dimensions, are based on rules that rewrite
arrays of pixels. Such grammars can be unified and extended using a tiling
based approach, whereby the right part of a rule is formalized by means of a
finite set of permitted tiles. We focus on a simple type of tiling,named
regional, and define the corresponding regional tile grammars. They include
both Siromoney's (or Matz's) Kolam grammars and their generalization by Prusa,
as well as Drewes's grid grammars. Regionally defined pictures can be
recognized with polynomial-time complexity by an algorithm extending the CKY
one for strings. Regional tile grammars and languages are strictly included
into our previous tile grammars and languages, and are incomparable with
Giammarresi-Restivo tiling systems (or Wang systems).
","[{'version': 'v1', 'created': 'Thu, 15 Oct 2009 11:35:42 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Mar 2010 18:02:47 GMT'}, {'version': 'v3', 'created': 'Sat, 8 Jan 2011 08:39:12 GMT'}]",2011-01-11,"[['Pradella', 'Matteo', ''], ['Cherubini', 'Alessandra', ''], ['Reghizzi', 'Stefano Crespi', '']]","['picture language', 'tiling', 'picture grammar', '2D language', 'CKY algorithm', 'syntactic pattern recognition']"
13325,1606.03537,Ravinda Wijesinghe,"Ravinda Wijesinghe, Helana Scheepers and Stuart McLoughlin","Defining the optimal level of business benefits within IS/IT projects:
  Insights from benefit identification practices adopted in an IT Service
  Management (ITSM) project","Research-in-progress ISBN# 978-0-646-95337-3 Presented at the
  Australasian Conference on Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/215,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The popularity of benefit realization management (BRM) in today's IT-enabled
world is fast gaining traction within IT organisations around the world.
However, there appears to be limited attention paid to the intra-organisational
practice by which benefits are identified. The purpose of this paper is
twofold: firstly, to describe and define a practice approach to the
identification of benefits that exploits a number of benefit identification
methods in an effort to more comprehensively identify IS/IT related benefits
that reflect the ongoing organisational investment. Secondly, to underline the
importance of this benefit identification process in the context of IT service
management (ITSM). This is achieved through a case study of an information
technology infrastructure library (ITIL) implementation in a multi-national
organization. The case study exposes a pragmatic practice approach of
customising such implementations in an effort to achieve a cost effective
implementation of IT services that reflects the context and requirements of
that specific organisation.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 03:17:40 GMT'}]",2016-06-14,"[['Wijesinghe', 'Ravinda', ''], ['Scheepers', 'Helana', ''], ['McLoughlin', 'Stuart', '']]","['Benefit Planning Management', 'Benefit Identification', 'Information Technology Service Management']"
13326,1409.7368,Vinod Kulathumani,"Vinod Kulathumani, Anish Arora, Kenneth Parker, Mukundan Sridharan,
  Masahiro Nakagawa","Census: Fast, scalable and robust data aggregation in MANETs","25 pages, technical report, index terms:random walk, MANET,
  statistical aggregation, gossip, local gradients",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes Census, a protocol for data aggregation and statistical
counting in MANETs. Census operates by circulating a set of tokens in the
network using biased random walks such that each node is visited by at least
one token. The protocol is structure-free so as to avoid high messaging
overhead for maintaining structure in the presence of node mobility. It biases
the random walks of tokens so as to achieve fast cover time; the bias involves
short albeit multi-hop gradients that guide the tokens towards hitherto
unvisited nodes. Census thus achieves a cover time of O(N/k) and message
overhead of O(Nlog(N)/k) where N is the number of nodes and k the number of
tokens in the network. Notably, it enjoys scalability and robustness, which we
demonstrate via simulations in networks ranging from 100 to 4000 nodes under
different network densities and mobility models.
","[{'version': 'v1', 'created': 'Thu, 25 Sep 2014 19:02:31 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Sep 2015 17:33:06 GMT'}]",2016-11-04,"[['Kulathumani', 'Vinod', ''], ['Arora', 'Anish', ''], ['Parker', 'Kenneth', ''], ['Sridharan', 'Mukundan', ''], ['Nakagawa', 'Masahiro', '']]","['random walk', 'statistical aggregation', 'gossip', 'local gradients']"
13327,1301.4795,Mrinal Nandi Mr,"Mrinal Nandi, Anup Dewanji, Bimal Roy, Santanu Sarkar","Model Selection Approach for Distributed Fault Detection in Wireless
  Sensor Networks",14 pages,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sensor networks aim at monitoring their surroundings for event detection and
object tracking. But, due to failure, or death of sensors, false signal can be
transmitted. In this paper, we consider the problems of distributed fault
detection in wireless sensor network (WSN). In particular, we consider how to
take decision regarding fault detection in a noisy environment as a result of
false detection or false response of event by some sensors, where the sensors
are placed at the center of regular hexagons and the event can occur at only
one hexagon. We propose fault detection schemes that explicitly introduce the
error probabilities into the optimal event detection process. We introduce two
types of detection probabilities, one for the center node, where the event
occurs and the other one for the adjacent nodes. This second type of detection
probability is new in sensor network literature. We develop schemes under the
model selection procedure, multiple model selection procedure and use the
concept of Bayesian model averaging to identify a set of likely fault sensors
and obtain an average predictive error.
","[{'version': 'v1', 'created': 'Mon, 21 Jan 2013 09:19:31 GMT'}]",2013-01-22,"[['Nandi', 'Mrinal', ''], ['Dewanji', 'Anup', ''], ['Roy', 'Bimal', ''], ['Sarkar', 'Santanu', '']]","['Event Detection', 'Wireless Sensor Network', 'Multiple Model Selection', 'Bayesian Model Averaging']"
13328,1510.02856,Jos Wetzels,"Jos Wetzels, Wouter Bokslag",Sponges and Engines: An introduction to Keccak and Keyak,30 pages Revision: corrected minor terminology error,,,,cs.CR,http://creativecommons.org/licenses/by-sa/4.0/,"  In this document we present an introductory overview of the algorithms and
design components underlying the Keccac cryptographic primitive and the Keyak
encryption scheme for authenticated (session-supporting) encryption. This
document aims to familiarize readers with the basic principles of authenticated
encryption, the Sponge and Duplex constructions (full-state, keyed as well as
regular versions), the permutation functions underlying Keccak and Keyak as
well as Keyak v2's Motorist mode of operation.
","[{'version': 'v1', 'created': 'Sat, 10 Oct 2015 00:19:29 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Oct 2015 02:17:02 GMT'}]",2015-10-14,"[['Wetzels', 'Jos', ''], ['Bokslag', 'Wouter', '']]","['Keccak', 'Keyak', 'SHA-3', 'CAESAR competition', 'Authenticated Encryption', 'Sponge Constructions', 'Permutation-based Cryptography']"
13329,1606.03888,Jan Jakubuv,"Jan Jakub\r{u}v, Josef Urban",Extending E Prover with Similarity Based Clause Selection Strategies,Based on the version submitted to CICM'16,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  E prover is a state-of-the-art theorem prover for first-order logic with
equality. E prover is built around a saturation loop, where new clauses are
derived by inference rules from previously derived clauses. Selection of
clauses for the inference provides the main source of non-determinism and an
important choice-point of the loop where the right choice can dramatically
influence the proof search. In this work we extend E Prover with several new
clause selection strategies based on similarity of a clause with the
conjecture. In particular, clauses which are more related to the conjecture are
preferred. We implement different strategies that define the relationship with
a conjecture in different ways. We provide an implementation of the proposed
selection strategies and we evaluate their efficiency on an extensive benchmark
set.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2016 10:39:35 GMT'}]",2016-06-14,"[['Jakubův', 'Jan', ''], ['Urban', 'Josef', '']]","['Automated Theorem Proving', 'Large Theory Reasoning', 'ClauseSelection']"
13330,1209.5244,Srikantaiah K C,"K. C. Srikantaiah, P. L. Srikanth, V. Tejaswi, K. Shaila, K. R.
  Venugopal and L. M. Patnaik",Ranking Search Engine Result Pages based on Trustworthiness of Websites,"10 pages; IJCSI International Journal of Computer Science Issues,
  Vol. 9, Issue 4, No 2, July 2012",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The World Wide Web (WWW) is the repository of large number of web pages which
can be accessed via Internet by multiple users at the same time and therefore
it is Ubiquitous in nature. The search engine is a key application used to
search the web pages from this huge repository, which uses the link analysis
for ranking the web pages without considering the facts provided by them. A new
algorithm called Probability of Correctness of Facts(PCF)-Engine is proposed to
find the accuracy of the facts provided by the web pages. It uses the
Probability based similarity function (SIM) which performs the string matching
between the true facts and the facts of web pages to find their probability of
correctness. The existing semantic search engines, may give the relevant result
to the user query but may not be 100% accurate. Our algorithm computes
trustworthiness of websites to rank the web pages. Simulation results show that
our approach is efficient when compared with existing Voting and Truthfinder[1]
algorithms with respect to the trustworthiness of the websites.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2012 12:24:49 GMT'}]",2012-09-25,"[['Srikantaiah', 'K. C.', ''], ['Srikanth', 'P. L.', ''], ['Tejaswi', 'V.', ''], ['Shaila', 'K.', ''], ['Venugopal', 'K. R.', ''], ['Patnaik', 'L. M.', '']]","['Data Quality', 'Page Rank', 'Search Engine', 'Trustworthiness', 'Web Content Mining', 'Web Mining']"
13331,1401.3069,Shashank Mouli Satapathy Mr.,"Shashank Mouli Satapathy, Santanu Kumar Rath","Use Case Point Approach Based Software Effort Estimation using Various
  Support Vector Regression Kernel Methods","13 pages, 6 figures, 11 Tables, International Journal of Information
  Processing (IJIP)","International Journal of Information Processing,7(4),2013,87-101",,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The job of software effort estimation is a critical one in the early stages
of the software development life cycle when the details of requirements are
usually not clearly identified. Various optimization techniques help in
improving the accuracy of effort estimation. The Support Vector Regression
(SVR) is one of several different soft-computing techniques that help in
getting optimal estimated values. The idea of SVR is based upon the computation
of a linear regression function in a high dimensional feature space where the
input data are mapped via a nonlinear function. Further, the SVR kernel methods
can be applied in transforming the input data and then based on these
transformations, an optimal boundary between the possible outputs can be
obtained. The main objective of the research work carried out in this paper is
to estimate the software effort using use case point approach. The use case
point approach relies on the use case diagram to estimate the size and effort
of software projects. Then, an attempt has been made to optimize the results
obtained from use case point analysis using various SVR kernel methods to
achieve better prediction accuracy.
","[{'version': 'v1', 'created': 'Tue, 14 Jan 2014 05:01:58 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Jan 2014 18:02:47 GMT'}]",2014-01-16,"[['Satapathy', 'Shashank Mouli', ''], ['Rath', 'Santanu Kumar', '']]","['Object Oriented Analysis and Design', 'Software Effort Estimation', 'Support Vector Regression', 'Use Case Point Approach']"
13332,1504.07283,Thomas Sandholm,"Thomas Sandholm, Julie Ward, Filippo Balestrieri and Bernardo A.
  Huberman",QoS-Based Pricing and Scheduling of Batch Jobs in OpenStack Clouds,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The current Cloud infrastructure services (IaaS) market employs a
resource-based selling model: customers rent nodes from the provider and pay
per-node per-unit-time. This selling model places the burden upon customers to
predict their job resource requirements and durations. Inaccurate prediction by
customers can result in over-provisioning of resources, or under-provisioning
and poor job performance. Thanks to improved resource virtualization and
multi-tenant performance isolation, as well as common frameworks for batch
jobs, such as MapReduce, Cloud providers can predict job completion times more
accurately. We offer a new definition of QoS-levels in terms of job completion
times and we present a new QoS-based selling mechanism for batch jobs in a
multi-tenant OpenStack cluster. Our experiments show that the QoS-based
solution yields up to 40% improvement over the revenue of more standard selling
mechanisms based on a fixed per-node price across various demand and supply
conditions in a 240-VCPU OpenStack cluster.
","[{'version': 'v1', 'created': 'Mon, 27 Apr 2015 21:28:41 GMT'}]",2015-04-29,"[['Sandholm', 'Thomas', ''], ['Ward', 'Julie', ''], ['Balestrieri', 'Filippo', ''], ['Huberman', 'Bernardo A.', '']]","['QoS', 'Revenue Management', 'Resource Allocation']"
13333,1510.08662,Robert J. Mokken,"Steven Laan, Maarten Marx and Robert J. Mokken",Close Communities in Social Networks: Boroughs and 2-Clubs,"Keywords: Social networks, close communication, close communities,
  boroughs, 2-clubs, diameter 2, ego-networks",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The structure of close communication, contacts and association in social
networks is studied in the form of maximal subgraphs of diameter 2 (2-clubs),
corresponding to three types of close communities: hamlets, social circles and
coteries. The concept of borough of a graph is defined and introduced. Each
borough is a chained union of 2-clubs of the network and any 2-club of the
network belongs to one borough. Thus the set of boroughs of a network, together
with the 2-clubs held by them, are shown to contain the structure of close
communication in a network. Applications are given with examples from real
world network data.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2015 12:16:40 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Nov 2015 15:29:58 GMT'}, {'version': 'v3', 'created': 'Thu, 5 Nov 2015 13:59:33 GMT'}, {'version': 'v4', 'created': 'Mon, 16 Nov 2015 16:58:23 GMT'}, {'version': 'v5', 'created': 'Tue, 1 Dec 2015 15:54:49 GMT'}]",2015-12-02,"[['Laan', 'Steven', ''], ['Marx', 'Maarten', ''], ['Mokken', 'Robert J.', '']]","['Social networks', 'close communication', 'close communities', 'boroughs', '2-clubs', 'diameter 2', 'ego-networks']"
13334,1007.3644,Satish N. Srirama,Satish Narayana Srirama and Matthias Jarke and Wolfgang Prinz,A Performance Evaluation of Mobile Web Services Security,"3rd International Conference on Web Information Systems and
  Technologies (WEBIST 2007), March 3-6, 2007, pp. 386-392. INSTICC Press",,,,cs.NI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is now feasible to host basic web services on a smart phone due to the
advances in wireless devices and mobile communication technologies. The market
capture of mobile web services also has increased significantly, in the past
years. While the applications are quite welcoming, the ability to provide
secure and reliable communication in the vulnerable and volatile mobile ad-hoc
topologies is vastly becoming necessary. Even though a lot of standardized
security specifications like WS-Security, SAML exist for web services in the
wired networks, not much has been analyzed and standardized in the wireless
environments. In this paper we give our analysis of adapting some of the
security standards, especially WS-Security to the cellular domain, with
performance statistics. The performance latencies are obtained and analyzed
while observing the performance and quality of service of our Mobile Host.
","[{'version': 'v1', 'created': 'Wed, 21 Jul 2010 13:14:15 GMT'}]",2010-07-22,"[['Srirama', 'Satish Narayana', ''], ['Jarke', 'Matthias', ''], ['Prinz', 'Wolfgang', '']]","['Mobile web services', 'mobile web service provisioing', 'WS-Security']"
13335,1307.4339,Gregory Puleo,"Farzad Farnoud (Hassanzadeh) and Lili Su and Gregory J. Puleo and
  Olgica Milenkovic",Computing Similarity Distances Between Rankings,"32 pages, 14 figures. Corrected proof of unbalanced case",,,,cs.DS cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the problem of computing distances between rankings that take into
account similarities between candidates. The need for evaluating such distances
is governed by applications as diverse as rank aggregation, bioinformatics,
social sciences and data storage. The problem may be summarized as follows:
Given two rankings and a positive cost function on transpositions that depends
on the similarity of the candidates involved, find a smallest cost sequence of
transpositions that converts one ranking into another. Our focus is on costs
that may be described via special metric-tree structures and on complete
rankings modeled as permutations. The presented results include a
quadratic-time algorithm for finding a minimum cost decomposition for simple
cycles, and a quadratic-time, $4/3$-approximation algorithm for permutations
that contain multiple cycles. The proposed methods rely on investigating a
newly introduced balancing property of cycles embedded in trees, cycle-merging
methods, and shortest path optimization techniques.
","[{'version': 'v1', 'created': 'Tue, 16 Jul 2013 16:50:37 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Jul 2013 02:46:48 GMT'}, {'version': 'v3', 'created': 'Sat, 4 Oct 2014 22:40:00 GMT'}, {'version': 'v4', 'created': 'Wed, 19 Nov 2014 17:25:40 GMT'}]",2014-11-20,"[['Farnoud', 'Farzad', '', 'Hassanzadeh'], ['Su', 'Lili', ''], ['Puleo', 'Gregory J.', ''], ['Milenkovic', 'Olgica', '']]","['Permutations', 'rankings', 'similarity distance', 'transposition distance']"
13336,1507.00640,Du\v{s}an Knop,"Ji\v{r}\'i Fiala and Tom\'a\v{s} Gaven\v{c}iak and Du\v{s}an Knop and
  Martin Kouteck\'y and Jan Kratochv\'il","Fixed parameter complexity of distance constrained labeling and uniform
  channel assignment problems","14 pages, 4 figers",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study computational complexity of the class of distance-constrained graph
labeling problems from the fixed parameter tractability point of view. The
parameters studied are neighborhood diversity and clique width.
  We rephrase the distance constrained graph labeling problem as a specific
uniform variant of the Channel Assignment problem and show that this problem is
fixed parameter tractable when parameterized by the neighborhood diversity
together with the largest weight. Consequently, every $L(p_1, p_2, \dots,
p_k)$-labeling problem is FPT when parameterized by the neighborhood diversity,
the maximum $p_i$ and $k.$
  Our results yield also FPT algorithms for all $L(p_1, p_2, \dots,
p_k)$-labeling problems when parameterized by the size of a minimum vertex
cover, answering an open question of Fiala et al.: Parameterized complexity of
coloring problems: Treewidth versus vertex cover. The same consequence applies
on Channel Assignment when the maximum weight is additionally included among
the parameters.
  Finally, we show that the uniform variant of the Channel Assignment problem
becomes NP-complete when generalized to graphs of bounded clique width.
","[{'version': 'v1', 'created': 'Thu, 2 Jul 2015 15:59:27 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Dec 2015 11:37:38 GMT'}]",2015-12-04,"[['Fiala', 'Jiří', ''], ['Gavenčiak', 'Tomáš', ''], ['Knop', 'Dušan', ''], ['Koutecký', 'Martin', ''], ['Kratochvíl', 'Jan', '']]","['distance labeling', 'channel assignment', 'bounded cliquewidth', 'boundedvertex cover', 'fixed parameter tractability']"
13337,1105.1504,Mahima Mehta,"Mahima Mehta, Osianoh Glenn Aliu, Abhay Karandikar, Muhammad Ali Imran","A Self-Organized Resource Allocation using Inter-Cell Interference
  Coordination (ICIC) in Relay-Assisted Cellular Networks",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a multi-cell scenario, the inter-cell interference (ICI) is detrimental in
achieving the intended system performance, in particular for the edge users.
There is paucity of work available in literature on ICI coordination (ICIC) for
relay-assisted cellular networks (RACN). In this paper, we do a survey on the
ICIC schemes in cellular networks and RACN. We then propose a self-organized
resource allocation plan for RACN to improve the edge user's performance by
ICIC. We compare the performance of reuse-1, reuse-3, soft frequency reuse
(SFR) scheme, proposed plan with and without relays. The performance metrics
for comparison are edge user's spectral efficiency, their
signal-to-interference-and-noise ratio (SINR) and system's area spectral
efficiency. We show by the simulation results that our proposed plan performs
better than the existing resource allocation schemes in static allocation
scenario. Next, we propose to make our resource allocation plan dynamic and
self-organized. The distinct features of our proposed plan are: One, it
achieves a trade-off between the system's area spectral efficiency and the edge
user's spectral efficiency performance. Secondly, it introduces a novel concept
of interfering neighbor set to achieve ICIC by local interaction between the
entities.
","[{'version': 'v1', 'created': 'Sun, 8 May 2011 09:24:16 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Jul 2011 11:11:51 GMT'}, {'version': 'v3', 'created': 'Sat, 19 Apr 2014 10:21:21 GMT'}]",2014-04-22,"[['Mehta', 'Mahima', ''], ['Aliu', 'Osianoh Glenn', ''], ['Karandikar', 'Abhay', ''], ['Imran', 'Muhammad Ali', '']]","['Area spectral efficiency', 'Edge users', 'Inter-cell interference coordination (ICIC)', 'Orthogonal Frequency']"
13338,1603.09123,Byunghan Lee,"Byunghan Lee, Junghwan Baek, Seunghyun Park, and Sungroh Yoon","deepTarget: End-to-end Learning Framework for microRNA Target Prediction
  using Deep Recurrent Neural Networks",,,,,cs.LG q-bio.GN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  MicroRNAs (miRNAs) are short sequences of ribonucleic acids that control the
expression of target messenger RNAs (mRNAs) by binding them. Robust prediction
of miRNA-mRNA pairs is of utmost importance in deciphering gene regulations but
has been challenging because of high false positive rates, despite a deluge of
computational tools that normally require laborious manual feature extraction.
This paper presents an end-to-end machine learning framework for miRNA target
prediction. Leveraged by deep recurrent neural networks-based auto-encoding and
sequence-sequence interaction learning, our approach not only delivers an
unprecedented level of accuracy but also eliminates the need for manual feature
extraction. The performance gap between the proposed method and existing
alternatives is substantial (over 25% increase in F-measure), and deepTarget
delivers a quantum leap in the long-standing challenge of robust miRNA target
prediction.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2016 10:59:36 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Aug 2016 07:43:11 GMT'}]",2016-09-27,"[['Lee', 'Byunghan', ''], ['Baek', 'Junghwan', ''], ['Park', 'Seunghyun', ''], ['Yoon', 'Sungroh', '']]","['microRNA', 'deep learning', 'recurrent neural networks', 'LSTM']"
13339,0711.3242,Frank Nielsen,"Frank Nielsen, Richard Nock",On the Centroids of Symmetrized Bregman Divergences,17 pages,,,,cs.CG,,"  In this paper, we generalize the notions of centroids and barycenters to the
broad class of information-theoretic distortion measures called Bregman
divergences. Bregman divergences are versatile, and unify quadratic geometric
distances with various statistical entropic measures. Because Bregman
divergences are typically asymmetric, we consider both the left-sided and
right-sided centroids and the symmetrized centroids, and prove that all three
are unique. We give closed-form solutions for the sided centroids that are
generalized means, and design a provably fast and efficient approximation
algorithm for the symmetrized centroid based on its exact geometric
characterization that requires solely to walk on the geodesic linking the two
sided centroids. We report on our generic implementation for computing entropic
centers of image clusters and entropic centers of multivariate normals, and
compare our results with former ad-hoc methods.
","[{'version': 'v1', 'created': 'Wed, 21 Nov 2007 01:15:19 GMT'}]",2007-11-22,"[['Nielsen', 'Frank', ''], ['Nock', 'Richard', '']]","['Centroid', 'Bregman divergence', 'Legendre duality']"
13340,1402.4844,Alon Gonen,"Alon Gonen, Dan Rosenbaum, Yonina Eldar, Shai Shalev-Shwartz",Subspace Learning with Partial Information,,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The goal of subspace learning is to find a $k$-dimensional subspace of
$\mathbb{R}^d$, such that the expected squared distance between instance
vectors and the subspace is as small as possible. In this paper we study
subspace learning in a partial information setting, in which the learner can
only observe $r \le d$ attributes from each instance vector. We propose several
efficient algorithms for this task, and analyze their sample complexity
","[{'version': 'v1', 'created': 'Wed, 19 Feb 2014 22:57:03 GMT'}, {'version': 'v2', 'created': 'Thu, 26 May 2016 14:06:50 GMT'}]",2016-05-27,"[['Gonen', 'Alon', ''], ['Rosenbaum', 'Dan', ''], ['Eldar', 'Yonina', ''], ['Shalev-Shwartz', 'Shai', '']]","['principal components analysis', 'budgeted learning', 'statistical learning', 'learning withpartial information', 'learning theory']"
13341,1802.06288,Karthik R,"R Karthik, Dhruv Tyagi, Amogh Raut, Soumya Saxena, Rajesh Kumar M","Implementation of Neural Network and feature extraction to classify ECG
  signals",SPRINGER LNEE,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a suitable and efficient implementation of a feature
extraction algorithm (Pan Tompkins algorithm) on electrocardiography (ECG)
signals, for detection and classification of four cardiac diseases: Sleep
Apnea, Arrhythmia, Supraventricular Arrhythmia and Long Term Atrial
Fibrillation (AF) and differentiating them from the normal heart beat by using
pan Tompkins RR detection followed by feature extraction for classification
purpose .The paper also presents a new approach towards signal classification
using the existing neural networks classifiers.
","[{'version': 'v1', 'created': 'Sat, 17 Feb 2018 20:42:04 GMT'}]",2018-02-20,"[['Karthik', 'R', ''], ['Tyagi', 'Dhruv', ''], ['Raut', 'Amogh', ''], ['Saxena', 'Soumya', ''], ['M', 'Rajesh Kumar', '']]","['Pan Tompkins algorithm', 'pattern net', 'fit net', 'cascaded net', 'feed forward net', 'ECG classification']"
13342,1402.0299,Panos Rondogiannis,Zolt\'an \'Esik and Panos Rondogiannis,A Fixed Point Theorem for Non-Monotonic Functions,34 pages. Accepted in: Theoretical Computer Science (to appear),,,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a fixed point theorem for a class of (potentially) non-monotonic
functions over specially structured complete lattices. The theorem has as a
special case the Knaster-Tarski fixed point theorem when restricted to the case
of monotonic functions and Kleene's theorem when the functions are additionally
continuous. From the practical side, the theorem has direct applications in the
semantics of negation in logic programming. In particular, it leads to a more
direct and elegant proof of the least fixed point result of [Rondogiannis and
W.W.Wadge, ACM TOCL 6(2): 441-467 (2005)]. Moreover, the theorem appears to
have potential for possible applications outside the logic programming domain.
","[{'version': 'v1', 'created': 'Mon, 3 Feb 2014 07:42:10 GMT'}, {'version': 'v2', 'created': 'Sun, 1 Feb 2015 11:57:31 GMT'}, {'version': 'v3', 'created': 'Sat, 7 Feb 2015 14:24:30 GMT'}]",2015-02-10,"[['Ésik', 'Zoltán', ''], ['Rondogiannis', 'Panos', '']]","['Fixed Point Theory', 'Non-Monotonicity', 'Semantics of Logic Programming']"
13343,1505.07774,Briland Hitaj,"Giuseppe Ateniese, Briland Hitaj, Luigi V. Mancini, Nino V. Verde,
  Antonio Villani","No Place to Hide that Bytes won't Reveal: Sniffing Location-Based
  Encrypted Traffic to Track a User's Position","14 pages, 9th International Conference on Network and System Security
  (NSS 2015)",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  News reports of the last few years indicated that several intelligence
agencies are able to monitor large networks or entire portions of the Internet
backbone. Such a powerful adversary has only recently been considered by the
academic literature. In this paper, we propose a new adversary model for
Location Based Services (LBSs). The model takes into account an unauthorized
third party, different from the LBS provider itself, that wants to infer the
location and monitor the movements of a LBS user. We show that such an
adversary can extrapolate the position of a target user by just analyzing the
size and the timing of the encrypted traffic exchanged between that user and
the LBS provider. We performed a thorough analysis of a widely deployed
location based app that comes pre-installed with many Android devices:
GoogleNow. The results are encouraging and highlight the importance of devising
more effective countermeasures against powerful adversaries to preserve the
privacy of LBS users.
","[{'version': 'v1', 'created': 'Thu, 28 May 2015 17:48:59 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Sep 2015 14:54:32 GMT'}]",2015-09-07,"[['Ateniese', 'Giuseppe', ''], ['Hitaj', 'Briland', ''], ['Mancini', 'Luigi V.', ''], ['Verde', 'Nino V.', ''], ['Villani', 'Antonio', '']]","['location-based services', 'network traffic analysis', 'GoogleNow', 'privacy', 'mobile devices']"
13344,1606.05660,"Gwena\""el Richomme","Michelangelo Bucci, Gwena\""el Richomme",Greedy palindromic lengths,,,,,cs.FL cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In [A. Frid, S. Puzynina, L.Q. Zamboni, \textit{On palindromic factorization
of words}, Adv. in Appl. Math. 50 (2013), 737-748], it was conjectured that any
infinite word whose palindromic lengths of factors are bounded is ultimately
periodic. We introduce variants of this conjecture and prove this conjecture in
particular cases. Especially we introduce left and right greedy palindromic
lengths. These lengths are always greater than or equals to the initial
palindromic length. When the greedy left (or right) palindromic lengths of
prefixes of a word are bounded then this word is ultimately periodic.
","[{'version': 'v1', 'created': 'Fri, 17 Jun 2016 20:10:35 GMT'}]",2016-06-21,"[['Bucci', 'Michelangelo', ''], ['Richomme', 'Gwenaël', '']]","['Infinite words', 'palindromes', 'periodicity', 'factorization', 'palindromic length']"
13345,1704.07943,Fang Liu,"Swapna Buccapatnam, Fang Liu, Atilla Eryilmaz, Ness B. Shroff","Reward Maximization Under Uncertainty: Leveraging Side-Observations on
  Networks",minor revision,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the stochastic multi-armed bandit (MAB) problem in the presence of
side-observations across actions that occur as a result of an underlying
network structure. In our model, a bipartite graph captures the relationship
between actions and a common set of unknowns such that choosing an action
reveals observations for the unknowns that it is connected to. This models a
common scenario in online social networks where users respond to their friends'
activity, thus providing side information about each other's preferences. Our
contributions are as follows: 1) We derive an asymptotic lower bound (with
respect to time) as a function of the bi-partite network structure on the
regret of any uniformly good policy that achieves the maximum long-term average
reward. 2) We propose two policies - a randomized policy; and a policy based on
the well-known upper confidence bound (UCB) policies - both of which explore
each action at a rate that is a function of its network position. We show,
under mild assumptions, that these policies achieve the asymptotic lower bound
on the regret up to a multiplicative factor, independent of the network
structure. Finally, we use numerical examples on a real-world social network
and a routing example network to demonstrate the benefits obtained by our
policies over other existing policies.
","[{'version': 'v1', 'created': 'Wed, 26 Apr 2017 01:53:09 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Jul 2017 20:39:01 GMT'}]",2017-07-14,"[['Buccapatnam', 'Swapna', ''], ['Liu', 'Fang', ''], ['Eryilmaz', 'Atilla', ''], ['Shroff', 'Ness B.', '']]","['Multi-armed Bandits', 'Side Observations', 'Bipartite Graph', 'Regret Bounds']"
13346,1208.0892,Mutaz M. Al-Debei,Dima Jalal and Mutaz M. Al-Debei,"Portals and Task Innovation: A Theoretical Framework Founded on Business
  Intelligence Thinking",,"The Eleventh Annual International Conference on Business
  Intelligenece and Knowledge Economy, 2012",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The main aim of this study is to develop a theoretical framework for the
success of Web portals in promoting task innovation. This is deemed significant
as yet little research has tackled this important domain from the business
intelligence perspective. The D&M IS Success Model was used as a foundational
theory and then was refined to match the context of the current research.
Importantly, in this study, system quality and information quality constructs
were defined on the basis of portals' characteristics since a mapping was
conducted between the most significant functions and features of Web portals
and quality constructs. The developed framework is deemed useful for theory and
practice. From theoretical perspective, the dimensions that affect the
perceived quality of Web portals are identified, and the measures that affect
each quality dimension are also defined. On the practical level, contributions
gained by this study can be observed in terms of the benefits decision makers,
strategists, operational employees and IT developers can gain. Assessing
portals success in improving task innovation is important to help managers
(i.e. decision makers) in making appropriate decisions concerning the adoption
of portals' technology, by weighing its benefits against the costs needed to
establish and run such a technology. Moreover, assessing Web portals' success
gives some insight to IT developers and designers concerning what aspects
should be taken when designing and establishing high quality portals, and what
functions and features should be contained that would affect the perceived
quality of portals and therefore users' intention to use portals.
","[{'version': 'v1', 'created': 'Sat, 4 Aug 2012 05:31:52 GMT'}]",2012-08-07,"[['Jalal', 'Dima', ''], ['Al-Debei', 'Mutaz M.', '']]","['Web Portal', 'IS Success Model', 'Delone and Mclean Model', 'Task Innovation', 'Business Intelligence', 'Information Systems']"
13347,1305.5757,Fang  Wei-Kleiner,Fang Wei-Kleiner,Tree Decomposition based Steiner Tree Computation over Large Graphs,,,,,cs.DS,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper, we present an exact algorithm for the Steiner tree problem.
The algorithm is based on certain pre-computed index structures. Our algorithm
offers a practical solution for the Steiner tree problems on graphs of large
size and bounded number of terminals.
","[{'version': 'v1', 'created': 'Fri, 24 May 2013 14:48:17 GMT'}]",2013-05-27,"[['Wei-Kleiner', 'Fang', '']]","['Steiner tree', 'Graph algorithms', 'Treewidth', 'Tree decomposition']"
13348,1505.02906,Kim-Kwang Raymond Choo,"Jody Farnden, Ben Martini, Kim-Kwang Raymond Choo",Privacy Risks in Mobile Dating Apps,"Proceedings of 21st Americas Conference on Information Systems (AMCIS
  2015)",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dating apps for mobile devices, one popular GeoSocial app category, are
growing increasingly popular. These apps encourage the sharing of more personal
information than conventional social media apps, including continuous location
data. However, recent high profile incidents have highlighted the privacy risks
inherent in using these apps. In this paper, we present a case study utilizing
forensic techniques on nine popular proximity-based dating apps in order to
determine the types of data that can be recovered from user devices. We recover
a number of data types from these apps that raise concerns about user privacy.
For example, we determine that chat messages could be recovered in at least
half of the apps examined and, in some cases, the details of any users that had
been discovered nearby could also be extracted.
","[{'version': 'v1', 'created': 'Tue, 12 May 2015 08:40:51 GMT'}]",2015-05-13,"[['Farnden', 'Jody', ''], ['Martini', 'Ben', ''], ['Choo', 'Kim-Kwang Raymond', '']]","['Dating apps', 'mobile forensics', 'Android', 'privacy risks']"
13349,1603.02253,Wenbin Li,Wenbin Li and Yang Chen and JeeHang Lee and Gang Ren and Darren Cosker,Blur Robust Optical Flow using Motion Channel,Preprint of our paper accepted by Neurocomputing,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is hard to estimate optical flow given a realworld video sequence with
camera shake and other motion blur. In this paper, we first investigate the
blur parameterization for video footage using near linear motion elements. we
then combine a commercial 3D pose sensor with an RGB camera, in order to film
video footage of interest together with the camera motion. We illustrates that
this additional camera motion/trajectory channel can be embedded into a hybrid
framework by interleaving an iterative blind deconvolution and warping based
optical flow scheme. Our method yields improved accuracy within three other
state-of-the-art baselines given our proposed ground truth blurry sequences;
and several other realworld sequences filmed by our imaging system.
","[{'version': 'v1', 'created': 'Mon, 7 Mar 2016 20:53:20 GMT'}]",2016-03-08,"[['Li', 'Wenbin', ''], ['Chen', 'Yang', ''], ['Lee', 'JeeHang', ''], ['Ren', 'Gang', ''], ['Cosker', 'Darren', '']]","['Optical Flow', 'Computer Vision', 'Image Deblurring', 'Directional Filtering', 'RGB-Motion Imaging']"
13350,1005.0219,Olivier Teste,"Franck Ravat (IRIT), Olivier Teste (IRIT)","Mod\'elisation et manipulation de donn\'ees historis\'ees et archiv\'ees
  dans un entrep\^ot orient\'e objet",,"Bases de donn\'ees avanc\'ees 2001, Agadir : Maroc (2001)",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with temporal and archive object-oriented data warehouse
modelling and querying. In a first step, we define a data model describing
warehouses as central repositories of complex and temporal data extracted from
one information source. The model is based on the concepts of warehouse object
and environment. A warehouse object is composed of one current state, several
past states (modelling value changes) and several archive states (summarising
some value changes). An environment defines temporal parts in a warehouse
schema according to a relevant granularity (attribute, class or graph). In a
second step, we provide a query algebra dedicated to data warehouses. This
algebra, which is based on common object algebras, integrates temporal
operators and operators for querying object states. An other important
contribution concerns dedicated operators allowing users to transform warehouse
objects in temporal series as well as operators facilitating analytical
treatments.
","[{'version': 'v1', 'created': 'Mon, 3 May 2010 07:48:53 GMT'}]",2010-05-20,"[['Ravat', 'Franck', '', 'IRIT'], ['Teste', 'Olivier', '', 'IRIT']]","['Data Warehouse', 'OODB', 'Temporal and Archive Data', 'Query Language']"
13351,1208.0590,Partha Pratim Ray,Partha Pratim Ray,"Translation of Bengali Terms in Mobile Phones: a Simplified Approach
  Based on the Prescriptions of Conventional Accent Understand Ability",ISSN 2249-2593,"International Journal of Computer and Organization Trends (IJCOT)
  2(1) 33-38 (2012)",,,cs.HC,http://creativecommons.org/licenses/by/3.0/,"  Technology is the making, usage and knowledge of tools, techniques, crafts,
systems or methods of organization in order to solve a problem or serve some
purpose. This is true for humanitarian issues also. Such as the issue of
language and its primitive attraction for its native speakers which is visible
in the cases of the language spoken at home, outside home, in its choice of
newspapers, and TV channels. Everyone finds to accomplish its need by the same
way. Example includes the preference of using mobile phones in English. The
satisfactory answer to this tendency may be the lack of finding the
translations in native language---Bengali terms used in current mobile phones
are hard to understand by users. I have investigated various mobile phone
models available in Indian market which have lot of problems in Bengali
interpretation. I have sort out the root cause of this problem to be the
conventional accent understand ability. Depending on this I have created a set
of equivalent terms that I hope to be simpler in use. In this paper I have
performed experiments to compare the new terms to the available ones. Our
findings show that the newly derived terms do better in term of performance
than to current ones. It has also been seen that acceptance of Bengali terms in
mobile phones might grow if the parameter of simpler and conventional accent
understand ability are met while designing.
","[{'version': 'v1', 'created': 'Thu, 2 Aug 2012 16:58:39 GMT'}]",2012-08-06,"[['Ray', 'Partha Pratim', '']]","['Accent Understand Ability', 'Mobile Phones', 'Bengali', 'Indian Language']"
13352,1406.3561,Wei  Di,"Wei Di, Anurag Bhardwaj, Vignesh Jagadeesh, Robinson Piramuthu,
  Elizabeth Churchill","When relevance is not Enough: Promoting Visual Attractiveness for
  Fashion E-commerce",,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fashion, and especially apparel, is the fastest-growing category in online
shopping. As consumers requires sensory experience especially for apparel goods
for which their appearance matters most, images play a key role not only in
conveying crucial information that is hard to express in text, but also in
affecting consumer's attitude and emotion towards the product. However,
research related to e-commerce product image has mostly focused on quality at
perceptual level, but not the quality of content, and the way of presenting.
This study aims to address the effectiveness of types of image in showcasing
fashion apparel in terms of its attractiveness, i.e. the ability to draw
consumer's attention, interest, and in return their engagement. We apply
advanced vision technique to quantize attractiveness using three common display
types in fashion filed, i.e. human model, mannequin, and flat. We perform
two-stage study by starting with large scale behavior data from real online
market, then moving to well designed user experiment to further deepen our
understandings on consumer's reasoning logic behind the action. We propose a
Fisher noncentral hypergeometric distribution based user choice model to
quantitatively evaluate user's preference. Further, we investigate the
potentials to leverage visual impact for a better search that caters to user's
preference. A visual attractiveness based re-ranking model that incorporates
both presentation efficacy and user preference is proposed. We show
quantitative improvement by promoting visual attractiveness into search on top
of relevance.
","[{'version': 'v1', 'created': 'Fri, 13 Jun 2014 15:04:20 GMT'}]",2014-06-16,"[['Di', 'Wei', ''], ['Bhardwaj', 'Anurag', ''], ['Jagadeesh', 'Vignesh', ''], ['Piramuthu', 'Robinson', ''], ['Churchill', 'Elizabeth', '']]","['e-commerce', 'image', 'product representation', 'visual attractiveness', 'behavioral analysis', 'user engagement', 'search re-ranking']"
13353,0706.1477,Sylvain Perifel,"Pascal Koiran (LIP), Sylvain Perifel (LIP)",VPSPACE and a transfer theorem over the complex field,14 pages,,,,cs.CC,,"  We extend the transfer theorem of [KP2007] to the complex field. That is, we
investigate the links between the class VPSPACE of families of polynomials and
the Blum-Shub-Smale model of computation over C. Roughly speaking, a family of
polynomials is in VPSPACE if its coefficients can be computed in polynomial
space. Our main result is that if (uniform, constant-free) VPSPACE families can
be evaluated efficiently then the class PAR of decision problems that can be
solved in parallel polynomial time over the complex field collapses to P. As a
result, one must first be able to show that there are VPSPACE families which
are hard to evaluate in order to separate P from NP over C, or even from PAR.
","[{'version': 'v1', 'created': 'Mon, 11 Jun 2007 13:59:31 GMT'}]",2007-06-12,"[['Koiran', 'Pascal', '', 'LIP'], ['Perifel', 'Sylvain', '', 'LIP']]","['computational complexity', 'algebraic complexity', 'Blum-Shub-Smalemodel', 'Valiant’s model']"
13354,1701.01771,Wei Cai,"Wei Cai, Jian Xu, and Liang Huang",Low Power SI Class E Power Amplifier and RF Switch For Health Care,,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This research was to design a 2.4 GHz class E Power Amplifier (PA) for health
care, with 0.18um Semiconductor Manufacturing International Corporation CMOS
technology by using Cadence software. And also RF switch was designed at
cadence software with power Jazz 180nm SOI process. The ultimate goal for such
application is to reach high performance and low cost, and between high
performance and low power consumption design. This paper introduces the design
of a 2.4GHz class E power amplifier and RF switch design. PA consists of
cascade stage with negative capacitance. This power amplifier can transmit
16dBm output power to a 50{\Omega} load. The performance of the power amplifier
and switch meet the specification requirements of the desired.
","[{'version': 'v1', 'created': 'Fri, 6 Jan 2017 22:33:19 GMT'}]",2017-01-10,"[['Cai', 'Wei', ''], ['Xu', 'Jian', ''], ['Huang', 'Liang', '']]","['Cascode', 'Negative Capacitance', 'Class E', 'Power amplifier', 'Healthcare', 'RF switch']"
13355,1111.1570,Frederico  Durao,"Frederico Durao, Peter Dolog",Semantic Grounding Strategies for Tagbased Recommender Systems,"13 pages, 5 figures","International Journal of Web & Semantic Technology (IJWesT) Vol.2,
  No.4, 2011, 67-79",,,cs.IR cs.SI,http://creativecommons.org/licenses/by/3.0/,"  Recommender systems usually operate on similarities between recommended items
or users. Tag based recommender systems utilize similarities on tags. The tags
are however mostly free user entered phrases. Therefore, similarities computed
without their semantic groundings might lead to less relevant recommendations.
In this paper, we study a semantic grounding used for tag similarity calculus.
We show a comprehensive analysis of semantic grounding given by 20 ontologies
from different domains. The study besides other things reveals that currently
available OWL ontologies are very narrow and the percentage of the similarity
expansions is rather small. WordNet scores slightly better as it is broader but
not much as it does not support several semantic relationships. Furthermore,
the study reveals that even with such number of expansions, the recommendations
change considerably.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2011 13:31:39 GMT'}]",2011-11-08,"[['Durao', 'Frederico', ''], ['Dolog', 'Peter', '']]","['Semantic grounding', 'tags', 'ontologies', 'recommendation', 'similarity']"
13356,1106.1910,Vahid Majid Nezhad,"Vahid Majid Nezhad, Habib Motee Gader and Evgueni Efimov",A Novel Hybrid Algorithm for Task Graph Scheduling,,"IJCSI, Vol 8, Issue 2, March 2011, p32-38",,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the important problems in multiprocessor systems is Task Graph
Scheduling. Task Graph Scheduling is an NP-Hard problem. Both learning automata
and genetic algorithms are search tools which are used for solving many NP-Hard
problems. In this paper a new hybrid method based on Genetic Algorithm and
Learning Automata is proposed. The proposed algorithm begins with an initial
population of randomly generated chromosomes and after some stages, each
chromosome maps to an automaton. Experimental results show that superiority of
the proposed algorithm over the current approaches.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2011 20:26:22 GMT'}]",2011-06-13,"[['Nezhad', 'Vahid Majid', ''], ['Gader', 'Habib Motee', ''], ['Efimov', 'Evgueni', '']]","['Task Graph', 'Scheduling', 'Genetic Algorithm', 'Learning Automata']"
13357,1409.2364,Bernhard Rumpe,"Stefan Plesser, M. Norbert Fisch, Claas Pinkernell, Thomas Kurpck,
  Bernhard Rumpe","The Energy Navigator - A Web based Platform for functional Quality
  Mangement in Buildings","7 pages, 5 figures.Proceedings of the 10th International Conference
  for Enhanced Building Operations (ICEBO' 10), Kuwait City, Kuwait, October
  2010. arXiv admin note: substantial text overlap with arXiv:1409.0416",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Energy efficient buildings require high quality standards for all their
technical equipment to enable their efficient and successful operation and
management. Building simulations enable engineers to design integrated HVAC
systems with complex building automation systems to control all their technical
functions. Numerous studies show that especially these supposedly innovative
buildings often do not reach their energy efficiency targets when in operation.
Key reasons for the suboptimal performance are imprecise functional
descriptions and a lack of commissioning and monitoring of the technical
systems that leave suboptimal operation undetected. In the research project
""Energy Navigator"" we create a web-based platform that enables engineers to
create a comprehensive and precise functional description for the buildings
services. The system reuses this functional description - written in an
appropriate domain specific language - to control the building operation, to
signal malfunctions or faults, and in particular to measure energy efficiency
over time. The innovative approach of the platform is the combination of design
and control within one artifact linking the phases of design and operation and
improving the cost effectiveness for both services. The paper will describe the
concept of the platform, the technical innovation and first application
examples of the research project.
","[{'version': 'v1', 'created': 'Mon, 8 Sep 2014 14:30:31 GMT'}]",2014-09-09,"[['Plesser', 'Stefan', ''], ['Fisch', 'M. Norbert', ''], ['Pinkernell', 'Claas', ''], ['Kurpck', 'Thomas', ''], ['Rumpe', 'Bernhard', '']]","['Active Functional Description', 'Building Specification', 'Verification', 'Measurement', 'Quality Management']"
13358,1304.4682,Yuan Li,"Yuan Li, Haoyu Gao, Mingmin Yang, Wanqiu Guan, Haixin Ma, Weining
  Qian, Zhigang Cao, Xiaoguang Yang",What are Chinese Talking about in Hot Weibos?,,,,,cs.SI cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  SinaWeibo is a Twitter-like social network service emerging in China in
recent years. People can post weibos (microblogs) and communicate with others
on it. Based on a dataset of 650 million weibos from August 2009 to January
2012 crawled from APIs of SinaWeibo, we study the hot ones that have been
reposted for at least 1000 times. We find that hot weibos can be roughly
classified into eight categories, i.e. Entertainment & Fashion, Hot Social
Events, Leisure & Mood, Life & Health, Seeking for Help, Sales Promotion,
Fengshui & Fortune and Deleted Weibos. In particular, Leisure & Mood and Hot
Social Events account for almost 65% of all the hot weibos. This reflects very
well the fundamental dual-structure of the current society of China: On the one
hand, economy has made a great progress and quite a part of people are now
living a relatively prosperous and fairly easy life. On the other hand, there
still exist quite a lot of serious social problems, such as government
corruptions and environmental pollutions. It is also shown that users' posting
and reposting behaviors are greatly affected by their identity factors (gender,
verification status, and regional location). For instance, (1) Two thirds of
the hot weibos are created by male users. (2) Although verified users account
for only 0.1% in SinaWeibo, 46.5% of the hot weibos are contributed by them.
Very interestingly, 39.2% are written by SPA users. A more or less pathetic
fact is that only 14.4% of the hot weibos are created by grassroots (individual
users that are neither SPA nor verified). (3) Users from different areas of
China have distinct posting and reposting behaviors which usually reflect very
their local cultures. Homophily is also examined for people's reposting
behaviors.
","[{'version': 'v1', 'created': 'Wed, 17 Apr 2013 04:25:33 GMT'}, {'version': 'v2', 'created': 'Fri, 10 May 2013 09:52:35 GMT'}]",2013-05-13,"[['Li', 'Yuan', ''], ['Gao', 'Haoyu', ''], ['Yang', 'Mingmin', ''], ['Guan', 'Wanqiu', ''], ['Ma', 'Haixin', ''], ['Qian', 'Weining', ''], ['Cao', 'Zhigang', ''], ['Yang', 'Xiaoguang', '']]","['SinaWeibo', 'social network service', 'hot topics', 'verification mechanism', 'homophily']"
13359,1111.5639,Seifedine Kadry Seifedine Kadry,"Seifedine Kadry, Mohamad Smaili, Hussam Kassem, Hassan Hayek","A New Technique to Backup and Restore DBMS using XML and .NET
  Technologies",,"International Journal on Computer Science and Engineering Vol. 02,
  No. 04, 2010, 1092-1102",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we proposed a new technique for backing up and restoring
different Database Management Systems (DBMS). The technique is enabling to
backup and restore a part of or the whole database using a unified interface
using ASP.NET and XML technologies. It presents a Web Solution allowing the
administrators to do their jobs from everywhere, locally or remotely. To show
the importance of our solution, we have taken two case studies, oracle 11g and
SQL Server 2008.
","[{'version': 'v1', 'created': 'Wed, 23 Nov 2011 22:28:38 GMT'}]",2011-11-28,"[['Kadry', 'Seifedine', ''], ['Smaili', 'Mohamad', ''], ['Kassem', 'Hussam', ''], ['Hayek', 'Hassan', '']]","['DBMS Backup and Restore', 'XML', 'NET', 'WEB application']"
13360,1206.5582,Debajyoti Mukhopadhyay Prof.,"Debajyoti Mukhopadhyay, Archana Chougule",A Survey on Web Service Discovery Approaches,"12 pages, 1 figure","Advances in Computer Science, Eng. & Appl., AISC 166, pp.
  1001-1012, Springerlink, 2012",,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web services are playing an important role in e-business and e-commerce
applications. As web service applications are interoperable and can work on any
platform, large scale distributed systems can be developed easily using web
services. Finding most suitable web service from vast collection of web
services is very crucial for successful execution of applications. Traditional
web service discovery approach is a keyword based search using UDDI. Various
other approaches for discovering web services are also available. Some of the
discovery approaches are syntax based while other are semantic based. Having
system for service discovery which can work automatically is also the concern
of service discovery approaches. As these approaches are different, one
solution may be better than another depending on requirements. Selecting a
specific service discovery system is a hard task. In this paper, we give an
overview of different approaches for web service discovery described in
literature. We present a survey of how these approaches differ from each other.
","[{'version': 'v1', 'created': 'Mon, 25 Jun 2012 06:00:56 GMT'}]",2012-06-26,"[['Mukhopadhyay', 'Debajyoti', ''], ['Chougule', 'Archana', '']]","['WSDL', 'UDDI', 'indexing', 'service matching', 'ontology', 'LSI', 'QoS']"
13361,1603.04626,Hugo Firth,Hugo Firth and Paolo Missier,"TAPER: query-aware, partition-enhancement for large, heterogenous,
  graphs","12 pages, 11 figures, unpublished",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph partitioning has long been seen as a viable approach to address Graph
DBMS scalability. A partitioning, however, may introduce extra query processing
latency unless it is sensitive to a specific query workload, and optimised to
minimise inter-partition traversals for that workload. Additionally, it should
also be possible to incrementally adjust the partitioning in reaction to
changes in the graph topology, the query workload, or both. Because of their
complexity, current partitioning algorithms fall short of one or both of these
requirements, as they are designed for offline use and as one-off operations.
The TAPER system aims to address both requirements, whilst leveraging existing
partitioning algorithms. TAPER takes any given initial partitioning as a
starting point, and iteratively adjusts it by swapping chosen vertices across
partitions, heuristically reducing the probability of inter-partition
traversals for a given pattern matching queries workload. Iterations are
inexpensive thanks to time and space optimisations in the underlying support
data structures. We evaluate TAPER on two different large test graphs and over
realistic query workloads. Our results indicate that, given a hash-based
partitioning, TAPER reduces the number of inter-partition traversals by around
80%; given an unweighted METIS partitioning, by around 30%. These reductions
are achieved within 8 iterations and with the additional advantage of being
workload-aware and usable online.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2016 10:41:59 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Jun 2016 11:38:20 GMT'}]",2016-06-24,"[['Firth', 'Hugo', ''], ['Missier', 'Paolo', '']]","['Graph databases', 'Graph repartitioning', 'Workload mining']"
13362,1110.0864,Kazutaka Kurihara,Kazutaka Kurihara,CinemaGazer: a System for Watching Video at Very High Speed,"8 pages, 9 figures",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a technology that enables the watching of videos at very
high speed. Subtitles are widely used in DVD movies, and provide useful
supplemental information for understanding video contents. We propose a
""two-level fast-forwarding"" scheme for videos with subtitles, which controls
the speed of playback depending on the context: very fast during segments
without language, such as subtitles or speech, and ""understandably fast"" during
segments with such language. This makes it possible to watch videos at a higher
speed than usual while preserving the entertainment values of the contents. We
also propose ""centering"" and ""fading"" features for the display of subtitles to
reduce fatigue when watching high-speed video. We implement a versatile video
encoder that enables movie viewing with two-level fast-forwarding on any mobile
device by specifying the speed of playback, the reading rate, or the overall
viewing time. The effectiveness of our proposed method was demonstrated in an
evaluation study.
","[{'version': 'v1', 'created': 'Tue, 4 Oct 2011 22:42:03 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Apr 2012 00:10:13 GMT'}]",2012-04-12,"[['Kurihara', 'Kazutaka', '']]","['Two-level fast-forwarding', 'video', 'audience gaze localization']"
13363,1603.07697,Homa Foroughi,"Homa Foroughi, Nilanjan Ray, Hong Zhang","Joint Projection and Dictionary Learning using Low-rank Regularization
  and Graph Constraints",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we aim at learning simultaneously a discriminative dictionary
and a robust projection matrix from noisy data. The joint learning, makes the
learned projection and dictionary a better fit for each other, so a more
accurate classification can be obtained. However, current prevailing joint
dimensionality reduction and dictionary learning methods, would fail when the
training samples are noisy or heavily corrupted. To address this issue, we
propose a joint projection and dictionary learning using low-rank
regularization and graph constraints (JPDL-LR). Specifically, the
discrimination of the dictionary is achieved by imposing Fisher criterion on
the coding coefficients. In addition, our method explicitly encodes the local
structure of data by incorporating a graph regularization term, that further
improves the discriminative ability of the projection matrix. Inspired by
recent advances of low-rank representation for removing outliers and noise, we
enforce a low-rank constraint on sub-dictionaries of all classes to make them
more compact and robust to noise. Experimental results on several benchmark
datasets verify the effectiveness and robustness of our method for both
dimensionality reduction and image classification, especially when the data
contains considerable noise or variations.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2016 18:35:41 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Dec 2016 00:08:19 GMT'}]",2016-12-07,"[['Foroughi', 'Homa', ''], ['Ray', 'Nilanjan', ''], ['Zhang', 'Hong', '']]","['Joint Projection and Dictionary Learning', 'DimensionalityReduction', 'Sparse Representation', 'Low-rank Regularization']"
13364,1402.2903,Vadim E. Levit,Vadim E. Levit and Eugen Mandrescu,"Computing Unique Maximum Matchings in O(m) time for Konig-Egervary
  Graphs and Unicyclic Graphs","10 pages, 5 figures",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let alpha(G) denote the maximum size of an independent set of vertices and
mu(G) be the cardinality of a maximum matching in a graph G. A matching
saturating all the vertices is perfect. If alpha(G) + mu(G) equals the number
of vertices of G, then it is called a Konig-Egervary graph. A graph is
unicyclic if it has a unique cycle.
  In 2010, Bartha conjectured that a unique perfect matching, if it exists, can
be found in O(m) time, where m is the number of edges.
  In this paper we validate this conjecture for Konig-Egervary graphs and
unicylic graphs. We propose a variation of Karp-Sipser leaf-removal algorithm
(Karp and Spiser, 1981), which ends with an empty graph if and only if the
original graph is a Konig-Egervary graph with a unique perfect matching
obtained as an output as well.
  We also show that a unicyclic non-bipartite graph G may have at most one
perfect matching, and this is the case where G is a Konig-Egervary graph.
","[{'version': 'v1', 'created': 'Wed, 12 Feb 2014 17:22:46 GMT'}]",2014-02-13,"[['Levit', 'Vadim E.', ''], ['Mandrescu', 'Eugen', '']]","['unique perfect matching', 'K¨onig-Egerv´ary graph', 'unicyclicgraph', 'Karp-Sipser leaf-removal algorithm', 'core']"
13365,1304.3203,Sultan Ullah,"Sultan Ullah, Zheng Xuefeng",Cloud Computing Research Challenges,"IEEE 5th International Conference on BioMedical Engineering and
  Informatics (BMEI 2012)","IEEE 5th International Conference on BioMedical Engineering and
  Informatics (BMEI 2012), PP 1397 - 1401",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent times cloud computing has appeared as a new model for hosting and
conveying services over the Internet. This model is striking to business
vendors as it eradicates the requirement for users to plan in advance, and it
permits the organization to start from low level and then add more resources
only if there is an increase in the service demand. Even though cloud computing
presents greater opportunities not only to information technology industry, but
every organization involved in utilizing the computing in one way or the other,
it is still in infancy with many problems to be fixed. The paper discusses
research challenges in cloud computing.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2013 06:10:12 GMT'}]",2013-04-25,"[['Ullah', 'Sultan', ''], ['Xuefeng', 'Zheng', '']]","['Cloud Computing', 'SaaS', 'PaaS', 'IaaS', 'Research']"
13366,1206.0104,Dian Pratiwi,Dian Pratiwi,"The Use of Self Organizing Map Method and Feature Selection in Image
  Database Classification System","5 pages, 5 figures, 2 tables. citation in IJCSI volume 9 issue 3",,,,cs.IR cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a technique in classifying the images into a number of
classes or clusters desired by means of Self Organizing Map (SOM) Artificial
Neural Network method. A number of 250 color images to be classified as
previously done some processing, such as RGB to grayscale color conversion,
color histogram, feature vector selection, and then classifying by the SOM
Feature vector selection in this paper will use two methods, namely by PCA
(Principal Component Analysis) and LSA (Latent Semantic Analysis) in which each
of these methods would have taken the characteristic vector of 50, 100, and 150
from 256 initial feature vector into the process of color histogram. Then the
selection will be processed into the SOM network to be classified into five
classes using a learning rate of 0.5 and calculated accuracy. Classification of
some of the test results showed that the highest percentage of accuracy
obtained when using PCA and the selection of 100 feature vector that is equal
to 88%, compared to when using LSA selection that only 74%. Thus it can be
concluded that the method fits the PCA feature selection methods are applied in
conjunction with SOM and has an accuracy rate better than the LSA feature
selection methods. Keywords: Color Histogram, Feature Selection, LSA, PCA, SOM.
","[{'version': 'v1', 'created': 'Fri, 1 Jun 2012 07:16:18 GMT'}]",2012-06-04,"[['Pratiwi', 'Dian', '']]","['Color Histogram', 'Feature Selection', 'LSA', 'PCA', 'SOM']"
13367,1610.00405,Bo Chen,Bo Chen and Pietro Perona,Seeing into Darkness: Scotopic Visual Recognition,"23 pages, 6 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Images are formed by counting how many photons traveling from a given set of
directions hit an image sensor during a given time interval. When photons are
few and far in between, the concept of `image' breaks down and it is best to
consider directly the flow of photons. Computer vision in this regime, which we
call `scotopic', is radically different from the classical image-based paradigm
in that visual computations (classification, control, search) have to take
place while the stream of photons is captured and decisions may be taken as
soon as enough information is available. The scotopic regime is important for
biomedical imaging, security, astronomy and many other fields. Here we develop
a framework that allows a machine to classify objects with as few photons as
possible, while maintaining the error rate below an acceptable threshold. A
dynamic and asymptotically optimal speed-accuracy tradeoff is a key feature of
this framework. We propose and study an algorithm to optimize the tradeoff of a
convolutional network directly from lowlight images and evaluate on simulated
images from standard datasets. Surprisingly, scotopic systems can achieve
comparable classification performance as traditional vision systems while using
less than 0.1% of the photons in a conventional image. In addition, we
demonstrate that our algorithms work even when the illuminance of the
environment is unknown and varying. Last, we outline a spiking neural network
coupled with photon-counting sensors as a power-efficient hardware realization
of scotopic algorithms.
","[{'version': 'v1', 'created': 'Mon, 3 Oct 2016 05:03:45 GMT'}]",2016-10-04,"[['Chen', 'Bo', ''], ['Perona', 'Pietro', '']]","['scotopic vision', 'lowlight', 'visual recognition', 'neural networks', 'deeplearning', 'photon-counting sensors']"
13368,1602.06700,Maurits Kaptein,"Jules Kruijswijk, Robin van Emden, Petri Parvinen, Maurits Kaptein",StreamingBandit; Experimenting with Bandit Policies,"47 pages, 15 figures, accepted for publication in Journal of
  Statistical Software (JSS)",,,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A large number of statistical decision problems in the social sciences and
beyond can be framed as a (contextual) multi-armed bandit problem. However, it
is notoriously hard to develop and evaluate policies that tackle these types of
problem, and to use such policies in applied studies. To address this issue,
this paper introduces StreamingBandit, a Python web application for developing
and testing bandit policies in field studies. StreamingBandit can sequentially
select treatments using (online) policies in real time. Once StreamingBandit is
implemented in an applied context, different policies can be tested, altered,
nested, and compared. StreamingBandit makes it easy to apply a multitude of
bandit policies for sequential allocation in field experiments, and allows for
the quick development and re-use of novel policies. In this article, we detail
the implementation logic of StreamingBandit and provide several examples of its
use.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2016 09:37:24 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Sep 2018 09:54:07 GMT'}]",2018-09-05,"[['Kruijswijk', 'Jules', ''], ['van Emden', 'Robin', ''], ['Parvinen', 'Petri', ''], ['Kaptein', 'Maurits', '']]","['Sequential decision-making', 'Multi-armed bandit', 'data streams', 'sequential experimentation', 'Python']"
13369,1603.04401,Helen Treharne,"Jens Bendisposto, Philipp Koerner, Michael Leuschel, Jeroen Meijer,
  Jaco van de Pol, Helen Treharne, Jorden Whitefield",Symbolic Reachability Analysis of B through ProB and LTSmin,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a symbolic reachability analysis approach for B that can provide a
significant speedup over traditional explicit state model checking. The
symbolic analysis is implemented by linking ProB to LTSmin, a high-performance
language independent model checker. The link is achieved via LTSmin's PINS
interface, allowing ProB to benefit from LTSmin's analysis algorithms, while
only writing a few hundred lines of glue-code, along with a bridge between ProB
and C using ZeroMQ. ProB supports model checking of several formal
specification languages such as B, Event-B, Z and TLA. Our experiments are
based on a wide variety of B-Method and Event-B models to demonstrate the
efficiency of the new link. Among the tested categories are state space
generation and deadlock detection; but action detection and invariant checking
are also feasible in principle. In many cases we observe speedups of several
orders of magnitude. We also compare the results with other approaches for
improving model checking, such as partial order reduction or symmetry
reduction. We thus provide a new scalable, symbolic analysis algorithm for the
B-Method and Event-B, along with a platform to integrate other model checking
improvements via LTSmin in the future.
","[{'version': 'v1', 'created': 'Mon, 14 Mar 2016 19:19:56 GMT'}]",2016-03-15,"[['Bendisposto', 'Jens', ''], ['Koerner', 'Philipp', ''], ['Leuschel', 'Michael', ''], ['Meijer', 'Jeroen', ''], ['van de Pol', 'Jaco', ''], ['Treharne', 'Helen', ''], ['Whitefield', 'Jorden', '']]","['B-Method', 'Event-B', 'ProB', 'LTSmin', 'symbolic reachability']"
13370,1002.2191,Rdv Ijcsis,"S. Sumathi, S. K. Srivatsa, M. Uma Maheswari",Vision Based Game Development Using Human Computer Interaction,"IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS January 2010, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 7, No. 1, pp. 147-153, January 2010, USA",,"Journal of Computer Science, ISSN 19475500",cs.HC cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Human Computer Interface (HCI) System for playing games is designed here
for more natural communication with the machines. The system presented here is
a vision-based system for detection of long voluntary eye blinks and
interpretation of blink patterns for communication between man and machine.
This system replaces the mouse with the human face as a new way to interact
with the computer. Facial features (nose tip and eyes) are detected and tracked
in realtime to use their actions as mouse events. The coordinates and movement
of the nose tip in the live video feed are translated to become the coordinates
and movement of the mouse pointer on the application. The left or right eye
blinks fire left or right mouse click events. The system works with inexpensive
USB cameras and runs at a frame rate of 30 frames per second.
","[{'version': 'v1', 'created': 'Wed, 10 Feb 2010 19:46:07 GMT'}]",2010-02-11,"[['Sumathi', 'S.', ''], ['Srivatsa', 'S. K.', ''], ['Maheswari', 'M. Uma', '']]","['Human Computer Interface (HCI)', 'SSR Filter', 'Hough transform']"
13371,1402.6076,Sergei Izrailev,Sergei Izrailev and Jeremy M. Stanley,Machine Learning at Scale,Submitted to KDD'14,,,,cs.LG cs.MS stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It takes skill to build a meaningful predictive model even with the abundance
of implementations of modern machine learning algorithms and readily available
computing resources. Building a model becomes challenging if hundreds of
terabytes of data need to be processed to produce the training data set. In a
digital advertising technology setting, we are faced with the need to build
thousands of such models that predict user behavior and power advertising
campaigns in a 24/7 chaotic real-time production environment. As data
scientists, we also have to convince other internal departments critical to
implementation success, our management, and our customers that our machine
learning system works. In this paper, we present the details of the design and
implementation of an automated, robust machine learning platform that impacts
billions of advertising impressions monthly. This platform enables us to
continuously optimize thousands of campaigns over hundreds of millions of
users, on multiple continents, against varying performance objectives.
","[{'version': 'v1', 'created': 'Tue, 25 Feb 2014 07:50:50 GMT'}]",2014-02-26,"[['Izrailev', 'Sergei', ''], ['Stanley', 'Jeremy M.', '']]","['machine learning', 'predictive modeling', 'scalability', 'computational advertising']"
13372,1511.04285,Fredrik Jansson,"Fredrik Jansson, Matthew Hartley, Martin Hinsch, Ivica Slavkov,
  Noem\'i Carranza, Tjelvar S. G. Olsson, Roland M. Dries, Johanna H.
  Gr\""onqvist, Athanasius F. M. Mar\'ee, James Sharpe, Jaap A. Kaandorp,
  Ver\^onica A. Grieneisen","Kilombo: a Kilobot simulator to enable effective research in swarm
  robotics",,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Kilobot is a widely used platform for investigation of swarm robotics.
Physical Kilobots are slow moving and require frequent recalibration and
charging, which significantly slows down the development cycle. Simulators can
speed up the process of testing, exploring and hypothesis generation, but
usually require time consuming and error-prone translation of code between
simulator and robot. Moreover, code of different nature often obfuscates direct
comparison, as well as determination of the cause of deviation, between
simulator and actual robot swarm behaviour. To tackle these issues we have
developed a C-based simulator that allows those working with Kilobots to use
the same programme code in both the simulator and the physical robots. Use of
our simulator, coined Kilombo, significantly simplifies and speeds up
development, given that a simulation of 1000 robots can be run at a speed 100
times faster than real time on a desktop computer, making high-throughput
pre-screening possible of potential algorithms that could lead to desired
emergent behaviour. We argue that this strategy, here specifically developed
for Kilobots, is of general importance for effective robot swarm research. The
source code is freely available under the MIT license.
","[{'version': 'v1', 'created': 'Fri, 13 Nov 2015 14:11:31 GMT'}, {'version': 'v2', 'created': 'Mon, 9 May 2016 12:38:44 GMT'}]",2016-05-10,"[['Jansson', 'Fredrik', ''], ['Hartley', 'Matthew', ''], ['Hinsch', 'Martin', ''], ['Slavkov', 'Ivica', ''], ['Carranza', 'Noemí', ''], ['Olsson', 'Tjelvar S. G.', ''], ['Dries', 'Roland M.', ''], ['Grönqvist', 'Johanna H.', ''], ['Marée', 'Athanasius F. M.', ''], ['Sharpe', 'James', ''], ['Kaandorp', 'Jaap A.', ''], ['Grieneisen', 'Verônica A.', '']]","['Kilobot', 'Robot simulator', 'Swarm robotics']"
13373,1603.02028,Sylvain Chevallier,"Hugo Martin, Sylvain Chevallier and Eric Monacelli","Adaptive Visualisation System for Construction Building Information
  Models Using Saliency","10 pages, 5 figures, to be submitted",,,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Building Information Modeling (BIM) is a recent construction process based on
a 3D model, containing every component related to the building achievement.
Architects, structure engineers, method engineers, and others participant to
the building process work on this model through the design-to-construction
cycle. The high complexity and the large amount of information included in
these models raise several issues, delaying its wide adoption in the industrial
world. One of the most important is the visualization: professionals have
difficulties to find out the relevant information for their job. Actual
solutions suffer from two limitations: the BIM models information are processed
manually and insignificant information are simply hidden, leading to
inconsistencies in the building model. This paper describes a system relying on
an ontological representation of the building information to label
automatically the building elements. Depending on the user's department, the
visualization is modified according to these labels by automatically adjusting
the colors and image properties based on a saliency model. The proposed
saliency model incorporates several adaptations to fit the specificities of
architectural images.
","[{'version': 'v1', 'created': 'Mon, 7 Mar 2016 12:25:33 GMT'}]",2016-03-08,"[['Martin', 'Hugo', ''], ['Chevallier', 'Sylvain', ''], ['Monacelli', 'Eric', '']]","['Saliency', 'Building Information Modeling', 'Virtual Reality', 'Building Architecture', 'Data Visualization', 'Immersion', 'Knowledge Representation']"
13374,1312.5620,Leandro Montero,"Valentin Borozan, Leandro Montero, Narayanan Narayanan",Further results on strong edge-colourings in outerplanar graphs,8 pages,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An edge-colouring is {\em strong} if every colour class is an induced
matching. In this work we give a formulae that determines either the optimal or
the optimal plus one strong chromatic index of bipartite outerplanar graphs.
Further, we give an improved upper bound for any outerplanar graph which is
close to optimal. All our proofs yield efficient algorithms to construct such
colourings.
","[{'version': 'v1', 'created': 'Thu, 19 Dec 2013 16:27:25 GMT'}]",2013-12-20,"[['Borozan', 'Valentin', ''], ['Montero', 'Leandro', ''], ['Narayanan', 'Narayanan', '']]","['Strong chromatic index', 'Induced matching', 'Outerplanar graphs', 'Strong edgecolouring']"
13375,1002.1160,Vishal Goyal,"Abdullah Al Hasib, Abdullah Azfar, Md. Sarwar Morshed","Towards Public Key Infrastructure less authentication in Session
  Initiation Protocol","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 2, January 2010,
  http://ijcsi.org/articles/Towards-Public-Key-Infrastructure-less-authentication-in-Session-Initiation-Protocol.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 2, January 2010,
  http://ijcsi.org/articles/Towards-Public-Key-Infrastructure-less-authentication-in-Session-Initiation-Protocol.php",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Session Initiation Protocol (SIP) has become the most predominant
protocol for Voice over Internet Protocol (VoIP) signaling. Security of SIP is
an important consideration for VoIP communication as the traffic is transmitted
over the insecure IP network. And the authentication process in SIP ranges from
pre-shared secret based solutions to Public Key Infrastructure (PKI) based
solution. However, due to the limitations in PKI based solutions, some PKI less
authentications mechanisms are proposed. This paper aims to present an overview
of different authentication methods used in or together with SIP. We start by
highlighting the security issues in SIP in the context of VoIP communication.
Then we illustrate the current activities regarding the SIP authentication
mechanisms including the recent developments in the research community and
standardization efforts within the Internet Engineering Task Force (IETF).
Finally we analyze the security aspects of these approaches.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 09:12:26 GMT'}]",2010-02-08,"[['Hasib', 'Abdullah Al', ''], ['Azfar', 'Abdullah', ''], ['Morshed', 'Md. Sarwar', '']]","['SIP', 'VoIP', 'Authentication', 'Key exchange', 'Public Key Infrastructure']"
13376,1702.04843,Abdul Kawsar Tushar,Mohammad Asiful Hossain and Abdul Kawsar Tushar,"Chord Angle Deviation using Tangent (CADT), an Efficient and Robust
  Contour-based Corner Detector","Conference Name - 2017 IEEE International Conference on Imaging,
  Vision & Pattern Recognition (icIVPR17); Conference Date - 13 Feb, 2017;
  Conference Venue - University of Dhaka, Dhaka, Bangladesh",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detection of corner is the most essential process in a large number of
computer vision and image processing applications. We have mentioned a number
of popular contour-based corner detectors in our paper. Among all these
detectors chord to triangular arm angle (CTAA) has been demonstrated as the
most dominant corner detector in terms of average repeatability. We introduce a
new effective method to calculate the value of curvature in this paper. By
demonstrating experimental results, our proposed technique outperforms CTAA and
other detectors mentioned in this paper. The results exhibit that our proposed
method is simple yet efficient at finding out corners more accurately and
reliably.
","[{'version': 'v1', 'created': 'Thu, 16 Feb 2017 02:52:36 GMT'}]",2017-02-17,"[['Hossain', 'Mohammad Asiful', ''], ['Tushar', 'Abdul Kawsar', '']]","['Image processing', 'Computer vision', 'Cornerdetection', 'Average repeatability', 'CTAA']"
13377,1610.05970,Merim Dzaferagic,"Merim Dzaferagic, Nicholas Kaminski, Irene Macaluso and Nicola
  Marchett","Relation between Functional Complexity, Scalability and Energy
  Efficiency in WSNs",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to understand the underlying mechanisms that lead to certain network
properties (i.e. scalability, energy efficiency) we apply a complex systems
science approach to analyze clustering in Wireless Sensor Networks (WSN). We
represent different implementations of clustering in WSNs with a functional
topology graph. Different characteristics of the functional topology provide
insight into the relationships between system parts that result in certain
properties of the whole system. Moreover, we employ a complexity metric -
functional complexity (C_F) - to explain how local interactions give rise to
the global behavior of the network. Our analysis shows that higher values of
C_F indicate higher scalability and lower energy efficiency.
","[{'version': 'v1', 'created': 'Wed, 19 Oct 2016 11:53:03 GMT'}]",2016-10-20,"[['Dzaferagic', 'Merim', ''], ['Kaminski', 'Nicholas', ''], ['Macaluso', 'Irene', ''], ['Marchett', 'Nicola', '']]","['Complex systems science', 'functional complexity', 'wireless sensor networks', 'clustering', 'scalability', 'energy efficiency']"
13378,1712.05745,Pol Van Aubel,"Pol Van Aubel (1), Kostas Papagiannopoulos (1), {\L}ukasz Chmielewski
  (2), Christian Doerr (3) ((1) Radboud University, Digital Security Group, (2)
  Riscure BV, Delft, the Netherlands, (3) Delft University of Technology,
  Department of Intelligent Systems)",Side-channel based intrusion detection for industrial control systems,"12 pages, 7 figures. For associated code, see
  https://polvanaubel.com/research/em-ics/code/",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Industrial Control Systems are under increased scrutiny. Their security is
historically sub-par, and although measures are being taken by the
manufacturers to remedy this, the large installed base of legacy systems cannot
easily be updated with state-of-the-art security measures. We propose a system
that uses electromagnetic side-channel measurements to detect behavioural
changes of the software running on industrial control systems. To demonstrate
the feasibility of this method, we show it is possible to profile and
distinguish between even small changes in programs on Siemens S7-317 PLCs,
using methods from cryptographic side-channel analysis.
","[{'version': 'v1', 'created': 'Fri, 15 Dec 2017 16:45:10 GMT'}]",2017-12-18,"[['Van Aubel', 'Pol', ''], ['Papagiannopoulos', 'Kostas', ''], ['Chmielewski', 'Łukasz', ''], ['Doerr', 'Christian', '']]","['EM', 'side-channel', 'intrusion detection', 'ICS', 'industrial control system', 'PLC', 'programmable logic controller']"
13379,1212.1882,Mahyuddin K. M.  Nasution,"Maria Elfida, Mahyuddin K. M. Nasution",Generating Strategic IS: Towards the Winning Strategy,"5 pages, draft to ICOCSIM 2012",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In modern era, the role of information system in organization has been taken
many discussions. The models of information system are constantly updated.
However, most of them can not face the changing world. This paper discusses an
approach to generating of strategic information system based on features in
organization. We proposed an approach by using disadvantages in some tools of
analysis whereby the lack of analysis appear as behaviour of relation between
organisation and the world.
","[{'version': 'v1', 'created': 'Sun, 9 Dec 2012 11:39:06 GMT'}]",2012-12-11,"[['Elfida', 'Maria', ''], ['Nasution', 'Mahyuddin K. M.', '']]","['Information system', 'information technology', 'feature', 'organization', 'knowledge']"
13380,1802.08425,Joseph Shaheen,Joseph A.E. Shaheen,"Challenges of Growing Social Media Networks From the Bottom-Up Through
  the Agent Perspective","8 pages, 10 figures; Please cite as Shaheen, J. A. E., Challenges of
  Growing Social Media Networks From the Bottom-Up Through the Agent
  Perspective, Proceedings of the Spring Simulation Multi-Conference, 2018,
  forthcoming",,,,cs.SI nlin.AO physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  We develop an agent-based model in order to understand agent/node behaviors
that generate social media networks. We use simple rules to synthetically
generate a backcloth (friend/follow) network collected using Twitter's API. The
Twitter network was collected using seeds for known terrorist propaganda
accounts in 2015. Model parameter adjustments were made to reproduce the
collected network's summary statistics, stylized facts and general structural
measures. We produced an approximate network in line with the general
properties of our collected data. We present our findings with a focus on the
challenging aspects of this reproduction. We find that while it is possible to
generate a social media network utilizing a few simple rules, numerous
challenges arise requiring departure from the agent viewpoint and the
development of more useful methods. We present numerous weaknesses and
challenges in our reproduction and propose potential solutions for future
efforts.
","[{'version': 'v1', 'created': 'Fri, 23 Feb 2018 07:56:29 GMT'}]",2018-02-26,"[['Shaheen', 'Joseph A. E.', '']]","['social networks', 'social media', 'challenges', 'bottom-up growth', 'agent-based modeling', 'social simulation']"
13381,1312.6568,Ekaterina Komendantskaya Dr,"Ekaterina Komendantskaya, John Power and Martin Schmidt",Coalgebraic Logic Programming: from Semantics to Implementation,"Accepted for publication in Journal of Logic and Computation, 2014",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Coinductive definitions, such as that of an infinite stream, may often be
described by elegant logic programs, but ones for which SLD-refutation is of no
value as SLD-derivations fall into infinite loops. Such definitions give rise
to questions of lazy corecursive derivations and parallelism, as execution of
such logic programs can have both recursive and corecursive features at once.
Observational and coalgebraic semantics have been used to study them
abstractly. The programming developments have often occurred separately and
have usually been implementation-led. Here, we give a coherent semantics-led
account of the issues, starting with abstract category theoretic semantics,
developing coalgebra to characterise naturally arising trees, and proceeding
towards implementation of a new dialect, CoALP, of logic programming,
characterised by guarded lazy corecursion and parallelism.
","[{'version': 'v1', 'created': 'Mon, 23 Dec 2013 15:19:27 GMT'}]",2013-12-24,"[['Komendantskaya', 'Ekaterina', ''], ['Power', 'John', ''], ['Schmidt', 'Martin', '']]","['Logic Programming', 'Coalgebra', 'Observational Semantics', 'Corecursion', 'Coinduction', 'Parallelism']"
13382,1501.01666,Matteo Magnani,Matteo Magnani and Luca Rossi,Towards effective visual analytics on multiplex and multilayer networks,,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article we discuss visualisation strategies for multiplex networks.
Since Moreno's early works on network analysis, visualisation has been one of
the main ways to understand networks thanks to its ability to summarise a
complex structure into a single representation highlighting multiple properties
of the data. However, despite the large renewed interest in the analysis of
multiplex networks, no study has proposed specialised visualisation approaches
for this context and traditional methods are typically applied instead. In this
paper we initiate a critical and structured discussion of this topic, and claim
that the development of specific visualisation methods for multiplex networks
will be one of the main drivers pushing current research results into daily
practice.
","[{'version': 'v1', 'created': 'Wed, 7 Jan 2015 22:06:38 GMT'}]",2015-01-09,"[['Magnani', 'Matteo', ''], ['Rossi', 'Luca', '']]","['multiplex', 'visualisation', 'analytics']"
13383,1504.03586,"Christoph D\""urr","Christoph D\""urr and {\L}ukasz Je\.z and \'Oscar C. V\'asquez","Mechanism design for aggregating energy consumption and quality of
  service in speed scaling scheduling",,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a strategic game, where players submit jobs to a machine that
executes all jobs in a way that minimizes energy while respecting the given
deadlines. The energy consumption is then charged to the players in some way.
Each player wants to minimize the sum of that charge and of their job's
deadline multiplied by a priority weight. Two charging schemes are studied, the
proportional cost share which does not always admit pure Nash equilibria, and
the marginal cost share, which does always admit pure Nash equilibria, at the
price of overcharging by a constant factor.
","[{'version': 'v1', 'created': 'Tue, 14 Apr 2015 15:30:50 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Jul 2017 09:41:07 GMT'}]",2017-07-11,"[['Dürr', 'Christoph', ''], ['Jeż', 'Łukasz', ''], ['Vásquez', 'Óscar C.', '']]","['scheduling', 'energy management', 'quality of service', 'optimization', 'mechanismdesign']"
13384,1205.4138,Daniel Hienert,Daniel Hienert and Francesco Luciano,Extraction of Historical Events from Wikipedia,"To be published in Proceedings of Knowledge Discovery and Data Mining
  Meets Linked Open Data (Know@LOD) Workshop at ESWC 2012",,,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The DBpedia project extracts structured information from Wikipedia and makes
it available on the web. Information is gathered mainly with the help of
infoboxes that contain structured information of the Wikipedia article. A lot
of information is only contained in the article body and is not yet included in
DBpedia. In this paper we focus on the extraction of historical events from
Wikipedia articles that are available for about 2,500 years for different
languages. We have extracted about 121,000 events with more than 325,000 links
to DBpedia entities and provide access to this data via a Web API, SPARQL
endpoint, Linked Data Interface and in a timeline application.
","[{'version': 'v1', 'created': 'Fri, 18 May 2012 11:25:31 GMT'}]",2012-05-21,"[['Hienert', 'Daniel', ''], ['Luciano', 'Francesco', '']]","['Historical Events', 'Wikipedia', 'DBpedia', 'Linked Data']"
13385,1504.08050,Shuangyong Song,Shuangyong Song and Yao Meng,Detecting Concept-level Emotion Cause in Microblogging,"2 pages, 2 figures, to appear on WWW 2015",,,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a Concept-level Emotion Cause Model (CECM), instead
of the mere word-level models, to discover causes of microblogging users'
diversified emotions on specific hot event. A modified topic-supervised biterm
topic model is utilized in CECM to detect emotion topics' in event-related
tweets, and then context-sensitive topical PageRank is utilized to detect
meaningful multiword expressions as emotion causes. Experimental results on a
dataset from Sina Weibo, one of the largest microblogging websites in China,
show CECM can better detect emotion causes than baseline methods.
","[{'version': 'v1', 'created': 'Thu, 30 Apr 2015 00:35:32 GMT'}]",2015-05-01,"[['Song', 'Shuangyong', ''], ['Meng', 'Yao', '']]","['Emotion cause detection', 'Microblogging', 'Topic model', 'Context-sensitive topical PageRank']"
13386,1704.01570,Utku Kose,"Aslihan Tufekci, Kamuran Samanci, Utku Kose","Developing a FPGA-supported touchscreen writing / drawing system for
  educational environments","31 pages, 13 figures, 6 tables","Journal of Multidisciplinary Developments, 1(1), 2016, 60-90",,,cs.HC,http://creativecommons.org/licenses/by-sa/4.0/,"  Developments in information and communication technologies have been greatly
influential on the practices in all fields, and education is not an exception
to this. To illustrate with, computers were first used in computer assisted
education in order to increase the efficiency of teaching process. Recently,
computer has contributed more to the field through interactive and smart class
applications that are specially designed for classroom use. The aim of this
study is to develop a low cost, portable and projection supported touchscreen
to be used in educational environments by using FPGA technology and to test its
usability. For the purposes of the study, the above mentioned system was
developed by using the necessary hardware and software, and later it was tested
in terms of usability. This usability test was administered to teachers, who
were the target end users of this touchscreen writing / drawing system. The aim
of this test was to determine user friendliness, subservientness and usability
of the system. Several tools were used to obtain data from the users that
participated in the study. The analysis and evaluation of the data collected
revealed that the system has achieved its objectives successfully.
","[{'version': 'v1', 'created': 'Tue, 4 Apr 2017 18:28:50 GMT'}]",2017-04-07,"[['Tufekci', 'Aslihan', ''], ['Samanci', 'Kamuran', ''], ['Kose', 'Utku', '']]","['FPGA', 'educational technologies', 'touchscreen writing / drawing system', 'usability    1']"
13387,1205.5982,Sergey Kuniavsky,Sergey Kuniavsky,Consumer Search with Chain Stores,38 pages. version may be updated,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper explores a consumer search setting where the sellers have
asymmetries. The model is an extension of the popular Stahl Model, which is
widely used in the literature. The extension introduces sellers with
heterogeneous stores number, reflecting the typical market structure. The
market consists of several sellers heterogeneous in size consumers, some of
which face a cost when sequentially searching. The paper shows that no
symmetric model exist in the extension and asymmetric NE of the Stahl model are
found for comparison. Additional results suggest that smallest sellers will be
the ones offering lowest prices, in line with several real world examples
provided in the paper. However, profits remain in most cases fixed per store,
making a larger firm more profitable, yet with lower sold quantity. The
findings suggest that on some level price dispersion will still exist, together
with some level of price stickiness, both observed in reality.
","[{'version': 'v1', 'created': 'Sun, 27 May 2012 16:02:41 GMT'}]",2015-03-20,"[['Kuniavsky', 'Sergey', '']]","['Sequential Consumer Search', 'Oligopoly', 'Asymmetric NE']"
13388,1307.5264,Georgios Smaragdakis,"Nikolaos Chatzis, Georgios Smaragdakis, Anja Feldmann","On the importance of Internet eXchange Points for today's Internet
  ecosystem","10 pages, keywords: Internet Exchange Point, Internet Architecture,
  Peering, Content Delivery",,,,cs.NI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet eXchange Points (IXPs) are generally considered to be the successors
of the four Network Access Points that were mandated as part of the
decommissioning of the NSFNET in 1994/95 to facilitate the transition from the
NSFNET to the ""public Internet"" as we know it today. While this popular view
does not tell the whole story behind the early beginnings of IXPs, what is true
is that since around 1994, the number of operational IXPs worldwide has grown
to more than 300 (as of May 2013), with the largest IXPs handling daily traffic
volumes comparable to those carried by the largest Tier-1 ISPs, but IXPs have
never really attracted any attention from the networking research community. At
first glance, this lack of interest seems understandable as IXPs have
apparently little to do with current ""hot"" topic areas such as data centers and
cloud services or software defined networking (SDN) and mobile communication.
However, we argue in this article that, in fact, IXPs are all about data
centers and cloud services and even SDN and mobile communication and should be
of great interest to networking researchers interested in understanding the
current and future Internet ecosystem. To this end, we survey the existing but
largely unknown sources of publicly available information about IXPs to
describe their basic technical and operational aspects and highlight the
critical differences among the various IXPs in the different regions of the
world, especially in Europe and North America. More importantly, we illustrate
the important role that IXPs play in today's Internet ecosystem and discuss how
IXP-driven innovation in Europe is shaping and redefining the Internet
marketplace, not only in Europe but increasingly so around the world.
","[{'version': 'v1', 'created': 'Fri, 19 Jul 2013 16:00:31 GMT'}, {'version': 'v2', 'created': 'Sat, 27 Jul 2013 16:52:04 GMT'}]",2013-07-30,"[['Chatzis', 'Nikolaos', ''], ['Smaragdakis', 'Georgios', ''], ['Feldmann', 'Anja', '']]","['Internet Exchange Point', 'Internet Architecture', 'Peering', 'ContentDelivery']"
13389,1007.0408,Dario Freni,"Sergio Mascetti and Dario Freni and Claudio Bettini and X. Sean Wang
  and Sushil Jajodia","Privacy in geo-social networks: proximity notification with untrusted
  service providers and curious buddies",,,,,cs.DB cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A major feature of the emerging geo-social networks is the ability to notify
a user when one of his friends (also called buddies) happens to be
geographically in proximity with the user. This proximity service is usually
offered by the network itself or by a third party service provider (SP) using
location data acquired from the users. This paper provides a rigorous
theoretical and experimental analysis of the existing solutions for the
location privacy problem in proximity services. This is a serious problem for
users who do not trust the SP to handle their location data, and would only
like to release their location information in a generalized form to
participating buddies. The paper presents two new protocols providing complete
privacy with respect to the SP, and controllable privacy with respect to the
buddies. The analytical and experimental analysis of the protocols takes into
account privacy, service precision, and computation and communication costs,
showing the superiority of the new protocols compared to those appeared in the
literature to date. The proposed protocols have also been tested in a full
system implementation of the proximity service.
","[{'version': 'v1', 'created': 'Fri, 2 Jul 2010 17:25:51 GMT'}, {'version': 'v2', 'created': 'Sat, 6 Nov 2010 12:57:26 GMT'}]",2010-11-09,"[['Mascetti', 'Sergio', ''], ['Freni', 'Dario', ''], ['Bettini', 'Claudio', ''], ['Wang', 'X. Sean', ''], ['Jajodia', 'Sushil', '']]","['Proximity services', 'geo-social networks', 'location-based services', 'location privacy']"
13390,1412.4861,Yong Yao,"Yong Yao, Jia Xu, Lu Yang","A Successive Resultant Projection for Cylindrical Algebraic
  Decomposition",6 pages,,,,cs.SC,http://creativecommons.org/licenses/by/3.0/,"  This note shows the equivalence of two projection operators which both can be
used in cylindrical algebraic decomposition (CAD) . One is known as Brown's
Projection (C. W. Brown (2001)); the other was proposed by Lu Yang in his
earlier work (L.Yang and S.~H. Xia (2000)) that is sketched as follows: given a
polynomial $f$ in $x_1,\,x_2,\,\cdots$, by $f_1$ denote the resultant of $f$
and its partial derivative with respect to $x_1$ (removing the multiple
factors), by $f_2$ denote the resultant of $f_1$ and its partial derivative
with respect to $x_2$, (removing the multiple factors), $\cdots$, repeat this
procedure successively until the last resultant becomes a univariate
polynomial. Making use of an identity, the equivalence of these two projection
operators is evident.
","[{'version': 'v1', 'created': 'Tue, 16 Dec 2014 02:39:44 GMT'}]",2014-12-17,"[['Yao', 'Yong', ''], ['Xu', 'Jia', ''], ['Yang', 'Lu', '']]","['cylindrical algebraic decomposition (CAD)', 'projection operator', 'resultant']"
13391,1710.03112,Hongjian Zhan,"Hongjian Zhan, Qingqing Wang, Yue Lu","Handwritten digit string recognition by combination of residual network
  and RNN-CTC",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recurrent neural network (RNN) and connectionist temporal classification
(CTC) have showed successes in many sequence labeling tasks with the strong
ability of dealing with the problems where the alignment between the inputs and
the target labels is unknown. Residual network is a new structure of
convolutional neural network and works well in various computer vision tasks.
In this paper, we take advantage of the architectures mentioned above to create
a new network for handwritten digit string recognition. First we design a
residual network to extract features from input images, then we employ a RNN to
model the contextual information within feature sequences and predict
recognition results. At the top of this network, a standard CTC is applied to
calculate the loss and yield the final results. These three parts compose an
end-to-end trainable network. The proposed new architecture achieves the
highest performances on ORAND-CAR-A and ORAND-CAR-B with recognition rates
89.75% and 91.14%, respectively. In addition, the experiments on a generated
captcha dataset which has much longer string length show the potential of the
proposed network to handle long strings.
","[{'version': 'v1', 'created': 'Mon, 9 Oct 2017 14:16:00 GMT'}]",2017-10-10,"[['Zhan', 'Hongjian', ''], ['Wang', 'Qingqing', ''], ['Lu', 'Yue', '']]","['digit string recognition', 'end to end', 'convolutional neuralnetwork', 'recurrent neural network', 'connectionist temporal classification']"
13392,1205.0790,Eric Phipps,"Roger P. Pawlowski, Eric T. Phipps, and Andrew G. Salinger","Automating embedded analysis capabilities and managing software
  complexity in multiphysics simulation part I: template-based generic
  programming",,,,,cs.MS cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An approach for incorporating embedded simulation and analysis capabilities
in complex simulation codes through template-based generic programming is
presented. This approach relies on templating and operator overloading within
the C++ language to transform a given calculation into one that can compute a
variety of additional quantities that are necessary for many state-of-the-art
simulation and analysis algorithms. An approach for incorporating these ideas
into complex simulation codes through general graph-based assembly is also
presented. These ideas have been implemented within a set of packages in the
Trilinos framework and are demonstrated on a simple problem from chemical
engineering.
","[{'version': 'v1', 'created': 'Thu, 3 May 2012 18:24:54 GMT'}, {'version': 'v2', 'created': 'Tue, 15 May 2012 20:19:22 GMT'}]",2012-05-17,"[['Pawlowski', 'Roger P.', ''], ['Phipps', 'Eric T.', ''], ['Salinger', 'Andrew G.', '']]","['Generic programming', 'templating', 'operator overloading', 'automatic differentiation', 'uncertainty quantification']"
13393,1301.6741,Philippe Smets,Philippe Smets,Practical Uses of Belief Functions,"Appears in Proceedings of the Fifteenth Conference on Uncertainty in
  Artificial Intelligence (UAI1999)",,,UAI-P-1999-PG-612-621,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present examples where the use of belief functions provided sound and
elegant solutions to real life problems. These are essentially characterized by
?missing' information. The examples deal with 1) discriminant analysis using a
learning set where classes are only partially known; 2) an information
retrieval systems handling inter-documents relationships; 3) the combination of
data from sensors competent on partially overlapping frames; 4) the
determination of the number of sources in a multi-sensor environment by
studying the inter-sensors contradiction. The purpose of the paper is to report
on such applications where the use of belief functions provides a convenient
tool to handle ?messy' data problems.
","[{'version': 'v1', 'created': 'Wed, 23 Jan 2013 16:01:05 GMT'}]",2013-01-30,"[['Smets', 'Philippe', '']]","['belief function', 'hints model', 'transferable belief model']"
13394,1205.4829,Somdip Dey Mr.,Somdip Dey,SD-EQR: A New Technique To Use QR CodesTM in Cryptography,"6 Pages and 3 figures, International Journal of Information
  Technology & Computer Science (IJITCS), May/June 2012",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper the author present a new technique of using QR Codes (commonly
known as 'Quick Respond Codes') in the field of Cryptography. QR Codes are
mainly used to convey or store messages because they have higher or large
storage capacity than any other normal conventional 'barcodes'. In this paper
the primary focus will be on storing messages in encrypted format with a
password and send it to the required destination hiding in a QR Code, without
being tracked or decrypted properly by any hacker or spyware. Since QR Codes
have fast response time and have large storage capacity, QR Codes can be used
perfectly to send encrypted data (messages) to the receiver. This method will
be suitable in any business house, government sectors, communication network to
send their encrypted messages faster to the destination. Or a person can even
use this method to keep his important documents, like passport number, pan-card
id, social security number, perfectly secured with him all the time, without
the information getting leaked to outside world. The new method is achieved by
entering the message along with a password. This password will generate a
secret code, which will be added to each digit or alphabet in the numbers or
text entered in the message (which is needed to be encrypted) and generate the
first phase of encryption. That newly generated encrypted message will again be
encrypted using various other methods to generate the final encrypted message.
","[{'version': 'v1', 'created': 'Tue, 22 May 2012 07:46:15 GMT'}]",2012-05-23,"[['Dey', 'Somdip', '']]","['QR Code', 'Crytography', 'Data Hiding', 'encryption', 'decryption', 'code generation;']"
13395,1402.5950,Hans Raj Tiwary,"David Avis, Hans Raj Tiwary",A generalization of extension complexity that captures $P$,,,,,cs.CC math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a generalization of the extension complexity of a
polyhedron $Q$. On the one hand it is general enough so that all problems in
$P$ can be formulated as linear programs with polynomial size extension
complexity. On the other hand it still allows non-polynomial lower bounds to be
proved for $NP$-hard problems independently of whether or not $P=NP$. The
generalization, called $H$-free extension complexity, allows for a set of valid
inequalities $H$ to be excluded in computing the extension complexity of $Q$.
We give results on the $H$-free extension complexity of hard matching problems
(when $H$ are the odd set inequalities) and the traveling salesman problem
(when $H$ are the subtour elimination constraints).
","[{'version': 'v1', 'created': 'Sun, 23 Feb 2014 18:34:38 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Apr 2014 13:30:50 GMT'}]",2014-04-14,"[['Avis', 'David', ''], ['Tiwary', 'Hans Raj', '']]","['Polytopes', 'Extended Formulations', 'extension complexity', 'lower bounds', 'linear programming']"
13396,0711.3454,Eric Laporte,"Eric Laporte (IGM-LabInfo), S\'ebastien Paumier (IGM-LabInfo)",Graphes param\'etr\'es et outils de lexicalisation,,"Dans Verbum ex machina. Proceedings of TALN - Graphes
  param\'etr\'es et outils de lexicalisation, Louvain : Belgique (2006)",,,cs.CL,,"  Shifting to a lexicalized grammar reduces the number of parsing errors and
improves application results. However, such an operation affects a syntactic
parser in all its aspects. One of our research objectives is to design a
realistic model for grammar lexicalization. We carried out experiments for
which we used a grammar with a very simple content and formalism, and a very
informative syntactic lexicon, the lexicon-grammar of French elaborated by the
LADL. Lexicalization was performed by applying the parameterized-graph
approach. Our results tend to show that most information in the lexicon-grammar
can be transferred into a grammar and exploited successfully for the syntactic
parsing of sentences.
","[{'version': 'v1', 'created': 'Wed, 21 Nov 2007 20:44:04 GMT'}]",2007-11-22,"[['Laporte', 'Eric', '', 'IGM-LabInfo'], ['Paumier', 'Sébastien', '', 'IGM-LabInfo']]","['Grammar', 'syntax', 'lexicalization', 'recursive transition networks']"
13397,1206.4120,Waraporn Jirapanthong Asst.Prof.Dr.,Waraporn Jirapanthong,Experience on Re-engineering Applying with Software Product Line,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present our experience based on a reengineering project.
The software project is to re-engineer the original system of a company to
answer the new requirements and changed business functions. Reengineering is a
process that involves not only the software system, but also underlying
business model. Particularly, the new business model is designed along with new
technologies to support the new system. This paper presents our experience that
applies with software product line approach to develop the new system
supporting original business functions and new ones.
","[{'version': 'v1', 'created': 'Tue, 19 Jun 2012 04:10:53 GMT'}]",2012-06-20,"[['Jirapanthong', 'Waraporn', '']]","['Software Product Line', 'Requirements Engineering', 'Product Family', 'Re-engineering']"
13398,1107.5000,Fabricio Martins Lopes,"Fabr\'icio Martins Lopes and David C. Martins-Jr and Junior Barrera
  and Roberto M. Cesar-Jr","An iterative feature selection method for GRNs inference by exploring
  topological properties","10 pages, 5 figures, SFFS search method based on scale-free network
  topology",,,,cs.CV cs.AI cs.IT math.IT q-bio.MN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An important problem in bioinformatics is the inference of gene regulatory
networks (GRN) from temporal expression profiles. In general, the main
limitations faced by GRN inference methods is the small number of samples with
huge dimensionalities and the noisy nature of the expression measurements. In
face of these limitations, alternatives are needed to get better accuracy on
the GRNs inference problem. This work addresses this problem by presenting an
alternative feature selection method that applies prior knowledge on its search
strategy, called SFFS-BA. The proposed search strategy is based on the
Sequential Floating Forward Selection (SFFS) algorithm, with the inclusion of a
scale-free (Barab\'asi-Albert) topology information in order to guide the
search process to improve inference. The proposed algorithm explores the
scale-free property by pruning the search space and using a power law as a
weight for reducing it. In this way, the search space traversed by the SFFS-BA
method combines a breadth-first search when the number of combinations is small
(<k> <= 2) with a depth-first search when the number of combinations becomes
explosive (<k> >= 3), being guided by the scale-free prior information.
Experimental results show that the SFFS-BA provides a better inference
similarities than SFS and SFFS, keeping the robustness of the SFS and SFFS
methods, thus presenting very good results.
","[{'version': 'v1', 'created': 'Mon, 25 Jul 2011 17:04:33 GMT'}]",2011-07-26,"[['Lopes', 'Fabrício Martins', ''], ['Martins-Jr', 'David C.', ''], ['Barrera', 'Junior', ''], ['Cesar-Jr', 'Roberto M.', '']]","['SFS', 'SFFS', 'feature selection', 'reverse-engineering', 'genenetworks inference', 'systems biology', 'bioinformatics']"
13399,1401.6877,Riad Abdmeziem,Riad Abdmeziem and Djamel Tandjaoui,"Internet of Things: Concept, Building blocks, Applications and
  Challenges","arXiv admin note: substantial text overlap with arXiv:1207.0203,
  arXiv:1105.1693 by other authors",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet of things (IoT) constitutes one of the most important technology
that has the potential to affect deeply our way of life, after mobile phones
and Internet. The basic idea is that every objet that is around us will be part
of the network (Internet), interacting to reach a common goal. In another word,
the Internet of Things concept aims to link the physical world to the digital
one. Technology advances along with popular demand will foster the wide spread
deployement of IoT's services, it would radically transform our corporations,
communities, and personal spheres. In this survey, we aim to provide the reader
with a broad overview of the Internet of things concept, its building blocks,
its applications along with its challenges.
","[{'version': 'v1', 'created': 'Thu, 2 Jan 2014 15:37:15 GMT'}]",2014-01-28,"[['Abdmeziem', 'Riad', ''], ['Tandjaoui', 'Djamel', '']]","['Internet Of Things', 'RFID', 'WSN', 'Smart Environments', 'Pervasive computing']"
13400,1409.7281,Jorge Fandinno,"Pedro Cabalar, Jorge Fandinno and Michael Fink",Causal Graph Justifications of Logic Programs,,"Theory and Practice of Logic Programming (2014), volume 14, issue
  4-5, pp. 603-618",,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we propose a multi-valued extension of logic programs under the
stable models semantics where each true atom in a model is associated with a
set of justifications. These justifications are expressed in terms of causal
graphs formed by rule labels and edges that represent their application
ordering. For positive programs, we show that the causal justifications
obtained for a given atom have a direct correspon- dence to (relevant)
syntactic proofs of that atom using the program rules involved in the graphs.
The most interesting contribution is that this causal information is obtained
in a purely semantic way, by algebraic op- erations (product, sum and
application) on a lattice of causal values whose ordering relation expresses
when a justification is stronger than another. Finally, for programs with
negation, we define the concept of causal stable model by introducing an
analogous transformation to Gelfond and Lifschitz's program reduct. As a
result, default negation behaves as ""absence of proof"" and no justification is
derived from negative liter
","[{'version': 'v1', 'created': 'Thu, 25 Sep 2014 14:56:57 GMT'}]",2014-09-26,"[['Cabalar', 'Pedro', ''], ['Fandinno', 'Jorge', ''], ['Fink', 'Michael', '']]","['Answer Set Programming', 'Causality', 'Knowledge Representation', 'Multi-valued Logic Programming']"
13401,1701.08303,Sunil Sahu,"Sunil Kumar Sahu, Ashish Anand","Drug-Drug Interaction Extraction from Biomedical Text Using Long Short
  Term Memory Network",Under review to the Journal of Biomedical Informatics,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Simultaneous administration of multiple drugs can have synergistic or
antagonistic effects as one drug can affect activities of other drugs.
Synergistic effects lead to improved therapeutic outcomes, whereas,
antagonistic effects can be life-threatening, may lead to increased healthcare
cost, or may even cause death. Thus identification of unknown drug-drug
interaction (DDI) is an important concern for efficient and effective
healthcare. Although multiple resources for DDI exist, they are often unable to
keep pace with rich amount of information available in fast growing biomedical
texts. Most existing methods model DDI extraction from text as a classification
problem and mainly rely on handcrafted features. Some of these features further
depend on domain specific tools. Recently neural network models using latent
features have been shown to give similar or better performance than the other
existing models dependent on handcrafted features. In this paper, we present
three models namely, {\it B-LSTM}, {\it AB-LSTM} and {\it Joint AB-LSTM} based
on long short-term memory (LSTM) network. All three models utilize word and
position embedding as latent features and thus do not rely on explicit feature
engineering. Further use of bidirectional long short-term memory (Bi-LSTM)
networks allow implicit feature extraction from the whole sentence. The two
models, {\it AB-LSTM} and {\it Joint AB-LSTM} also use attentive pooling in the
output of Bi-LSTM layer to assign weights to features. Our experimental results
on the SemEval-2013 DDI extraction dataset show that the {\it Joint AB-LSTM}
model outperforms all the existing methods, including those relying on
handcrafted features. The other two proposed LSTM models also perform
competitively with state-of-the-art methods.
","[{'version': 'v1', 'created': 'Sat, 28 Jan 2017 17:04:21 GMT'}, {'version': 'v2', 'created': 'Sun, 13 Aug 2017 12:56:03 GMT'}]",2017-08-15,"[['Sahu', 'Sunil Kumar', ''], ['Anand', 'Ashish', '']]","['Information Extraction', 'Recurrent Neural Network', 'LongShort Term Memory', 'Attention Model']"
13402,1312.4042,Mina Mishra,"Mina Mishra, Vijay H. Mankar",Chaotic Encryption Scheme Using 1-D Chaotic Map,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes three different chaotic encryption methods using 1-D
chaotic map known as Logistic map named as Logistic, NLFSR and Modified NLFSR
according to the name of chaotic map and non-linear function involved in the
scheme. The designed schemes have been crypt analyzed for five different
methods for testing its strength. Cryptanalysis has been performed for various
texts using various keys selected from domain of key space. Logistic and NLFSR
methods are found to resist known plaintext attack for available first two
characters of plaintext. Plaintext sensitivity of both methods is within small
range along with medium key sensitivity. Identifiability for keys of first two
of the scheme has not been derived concluding that methods may prove to be weak
against brute-force attack. In the last modified scheme avalanche effect found
to be improved compared to the previous ones and method is found to resist
brute-force attack as it derives the conclusion for identifiability.
","[{'version': 'v1', 'created': 'Sat, 14 Dec 2013 13:12:55 GMT'}]",2013-12-17,"[['Mishra', 'Mina', ''], ['Mankar', 'Vijay H.', '']]","['Cryptanalysis', 'Plaintext Sensitivity', 'Key Sensitivity', 'Identifiability', 'Brute-Force Attack']"
13403,1007.2282,Manu Basavaraju,Manu Basavaraju and L. Sunil Chandran,Acyclic Edge Coloring of Triangle Free Planar Graphs,"16 pages, 0 figures",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An $acyclic$ edge coloring of a graph is a proper edge coloring such that
there are no bichromatic cycles. The \emph{acyclic chromatic index} of a graph
is the minimum number k such that there is an acyclic edge coloring using k
colors and is denoted by $a'(G)$. It was conjectured by Alon, Sudakov and Zaks
(and much earlier by Fiamcik) that $a'(G)\le \Delta+2$, where $\Delta
=\Delta(G)$ denotes the maximum degree of the graph.
  If every induced subgraph $H$ of $G$ satisfies the condition $\vert E(H)
\vert \le 2\vert V(H) \vert -1$, we say that the graph $G$ satisfies $Property\
A$. In this paper, we prove that if $G$ satisfies $Property\ A$, then $a'(G)\le
\Delta + 3$. Triangle free planar graphs satisfy $Property\ A$. We infer that
$a'(G)\le \Delta + 3$, if $G$ is a triangle free planar graph. Another class of
graph which satisfies $Property\ A$ is 2-fold graphs (union of two forests).
","[{'version': 'v1', 'created': 'Wed, 14 Jul 2010 09:24:13 GMT'}]",2010-07-15,"[['Basavaraju', 'Manu', ''], ['Chandran', 'L. Sunil', '']]","['Acyclic edge coloring', 'acyclic edge chromatic number', 'planar graphs']"
13404,1701.08074,Frederik Ruelens,"Bert J. Claessens, Dirk Vanhoudt, Johan Desmedt, Frederik Ruelens","Model-Free Control of Thermostatically Controlled Loads Connected to a
  District Heating Network",Under review at Elsevier: Energy and buildings 2017,,,,cs.SY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optimal control of thermostatically controlled loads connected to a district
heating network is considered a sequential decision- making problem under
uncertainty. The practicality of a direct model-based approach is compromised
by two challenges, namely scalability due to the large dimensionality of the
problem and the system identification required to identify an accurate model.
To help in mitigating these problems, this paper leverages on recent
developments in reinforcement learning in combination with a market-based
multi-agent system to obtain a scalable solution that obtains a significant
performance improvement in a practical learning time. The control approach is
applied on a scenario comprising 100 thermostatically controlled loads
connected to a radial district heating network supplied by a central combined
heat and power plant. Both for an energy arbitrage and a peak shaving
objective, the control approach requires 60 days to obtain a performance within
65% of a theoretical lower bound on the cost.
","[{'version': 'v1', 'created': 'Fri, 27 Jan 2017 15:15:54 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Feb 2017 15:59:34 GMT'}]",2017-02-27,"[['Claessens', 'Bert J.', ''], ['Vanhoudt', 'Dirk', ''], ['Desmedt', 'Johan', ''], ['Ruelens', 'Frederik', '']]","['District heating', 'combined heat and power', 'reinforcement learning', 'thermostatically controlled loads']"
13405,1710.05739,Gergely Neu,"G\'abor Lugosi, Mihalis G. Markakis, Gergely Neu",On the Hardness of Inventory Management with Censored Demand Data,,,,,cs.LG math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a repeated newsvendor problem where the inventory manager has no
prior information about the demand, and can access only censored/sales data. In
analogy to multi-armed bandit problems, the manager needs to simultaneously
""explore"" and ""exploit"" with her inventory decisions, in order to minimize the
cumulative cost. We make no probabilistic assumptions---importantly,
independence or time stationarity---regarding the mechanism that creates the
demand sequence. Our goal is to shed light on the hardness of the problem, and
to develop policies that perform well with respect to the regret criterion,
that is, the difference between the cumulative cost of a policy and that of the
best fixed action/static inventory decision in hindsight, uniformly over all
feasible demand sequences. We show that a simple randomized policy, termed the
Exponentially Weighted Forecaster, combined with a carefully designed cost
estimator, achieves optimal scaling of the expected regret (up to logarithmic
factors) with respect to all three key primitives: the number of time periods,
the number of inventory decisions available, and the demand support. Through
this result, we derive an important insight: the benefit from ""information
stalking"" as well as the cost of censoring are both negligible in this dynamic
learning problem, at least with respect to the regret criterion. Furthermore,
we modify the proposed policy in order to perform well in terms of the tracking
regret, that is, using as benchmark the best sequence of inventory decisions
that switches a limited number of times. Numerical experiments suggest that the
proposed approach outperforms existing ones (that are tailored to, or
facilitated by, time stationarity) on nonstationary demand models. Finally, we
extend the proposed approach and its analysis to a ""combinatorial"" version of
the repeated newsvendor problem.
","[{'version': 'v1', 'created': 'Mon, 16 Oct 2017 14:33:59 GMT'}]",2017-10-17,"[['Lugosi', 'Gábor', ''], ['Markakis', 'Mihalis G.', ''], ['Neu', 'Gergely', '']]","['repeated newsvendor problem', 'demand learning', 'censored observations', 'regretminimization', 'Exponentially Weighted Forecaster']"
13406,1111.3010,Sugata Sanyal,"Ayu Tiwari, Sudip Sanyal, Ajith Abraham, Svein Johan Knapskog, Sugata
  Sanyal","A Multi-Factor Security Protocol for Wireless Payment - Secure Web
  Authentication using Mobile Devices","8 Pages, 3 Figures; IADIS International Conference on Applied
  Computing Proceedings of the IADIS International Conference on Applied
  Computing, Salamanca, Spain, 18-20 February 2007",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Previous Web access authentication systems often use either the Web or the
Mobile channel individually to confirm the claimed identity of the remote user.
This paper proposes a new protocol using multifactor authentication system that
is both secure and highly usable. It uses a novel approach based on Transaction
Identification Code and SMS to enforce extra security level with the
traditional Login/password system. The system provides a highly secure
environment that is simple to use and deploy, that does not require any change
in infrastructure or protocol of wireless networks. This Protocol for Wireless
Payment is extended to provide two way authentications.
","[{'version': 'v1', 'created': 'Sun, 13 Nov 2011 13:29:00 GMT'}]",2011-11-15,"[['Tiwari', 'Ayu', ''], ['Sanyal', 'Sudip', ''], ['Abraham', 'Ajith', ''], ['Knapskog', 'Svein Johan', ''], ['Sanyal', 'Sugata', '']]","['Protocol for Wireless Payment', 'SMS (Short Message Service)', 'TIC (Transaction Identification Code)']"
13407,1204.5407,Pradeep  Singla,"Pradeep Singla, Naveen Kr. Malik","Reversible Programmable Logic Array (RPLA) using Feynman & MUX Gates for
  Low Power Industrial Applications","9 Pages, 9 Figures","Pradeep Singla and Naveen Kr. Malik. Article: Reversible
  Programmable Logic Array (RPLA) using Feynman & MUX Gates for Low Power
  Industrial Applications. Proceedinggs of ICIAICT-2012,pp 411-419, March 2012",,,cs.AR,http://creativecommons.org/licenses/by/3.0/,"  This paper present the research work directed towards the design of
reversible programmable logic array using very high speed integrated circuit
hardware description language (VHDL). Reversible logic circuits have
significant importance in bioinformatics, optical information processing, CMOS
design etc. In this paper the authors propose the design of new RPLA using
Feynman & MUX gate.VHDL based codes of reversible gates with simulating results
are shown .This proposed RPLA may be further used to design any reversible
logic function or Boolean function (Adder, subtractor etc.) which dissipate
very low or ideally no heat.
","[{'version': 'v1', 'created': 'Tue, 24 Apr 2012 15:28:25 GMT'}]",2012-04-25,"[['Singla', 'Pradeep', ''], ['Malik', 'Naveen Kr.', '']]","['Reversible logic', 'quantum cost', 'garbage outputs', 'RPLA', 'constant inputs', 'VHDL']"
13408,1705.07328,Chenyou Fan,"Chenyou Fan, Jangwon Lee, Michael S. Ryoo",Forecasting Hands and Objects in Future Frames,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an approach to forecast future presence and location of
human hands and objects. Given an image frame, the goal is to predict what
objects will appear in the future frame (e.g., 5 seconds later) and where they
will be located at, even when they are not visible in the current frame. The
key idea is that (1) an intermediate representation of a convolutional object
recognition model abstracts scene information in its frame and that (2) we can
predict (i.e., regress) such representations corresponding to the future frames
based on that of the current frame. We design a new two-stream convolutional
neural network (CNN) architecture for videos by extending the state-of-the-art
convolutional object detection network, and present a new fully convolutional
regression network for predicting future scene representations. Our experiments
confirm that combining the regressed future representation with our detection
network allows reliable estimation of future hands and objects in videos. We
obtain much higher accuracy compared to the state-of-the-art future object
presence forecast method on a public dataset.
","[{'version': 'v1', 'created': 'Sat, 20 May 2017 16:34:55 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Dec 2017 23:37:51 GMT'}, {'version': 'v3', 'created': 'Thu, 23 Aug 2018 04:17:07 GMT'}]",2018-08-24,"[['Fan', 'Chenyou', ''], ['Lee', 'Jangwon', ''], ['Ryoo', 'Michael S.', '']]","['Future location forecast', 'activity prediction', 'object forecast']"
13409,1203.1964,Jean Maitem,"Jean Maitem, Rosmina Joy Cabauatan, Lorena Rabago, Bartolome Tanguilig
  III","Math world: A game-based 3D Virtual Learning Environment (3D VLE) for
  second graders",,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper intends to introduce a game-based 3D Virtual Learning Environment
(VLE) to second graders. The impetus arose from the need to make learning in
mathematics more effective and interesting through multimedia. Applied in a
game, the basic mathematical operations such as addition, subtraction,
multiplication, and division are expected to performed by learners as they
represent themselves as avatars while they immerse in a quest of digital
objects in the VLE called Math World. Educational attributes such as mentality
change, emotional fulfillment, knowledge enhancement, thinking skills
development, and bodily coordination are evaluated to ensure learning
effectiveness. Also, game playability measured in terms of game plays, story,
mechanics and interface usability are examined for its educative design. With
an aggregate of these enhanced indices, results attest that objectives were met
while making mathematics an interesting, motivating and enjoyable subject,
hence VLE a significant tool to complement the conventional approaches of
teaching.
","[{'version': 'v1', 'created': 'Fri, 9 Mar 2012 00:08:43 GMT'}]",2012-03-12,"[['Maitem', 'Jean', ''], ['Cabauatan', 'Rosmina Joy', ''], ['Rabago', 'Lorena', ''], ['Tanguilig', 'Bartolome', 'III']]","['3D Virtual Learning Environment', 'Virtual 3D world', 'learning environment', 'e-learning']"
13410,1109.0675,Sumit Kumar,"Rama Murthy Garimella, Samdarshi Abhijeet, Deepti Singhal","Doubly Optimal Secure Multicasting: Hierarchical Hybrid Communication
  Network : Disaster Relief",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, the world has witnessed the increasing occurrence of disasters,
some of natural origin and others caused by man. The intensity of the
phenomenon that cause such disasters, the frequency in which they occur, the
number of people affected and the material damage caused by them have been
growing substantially. Disasters are defined as natural, technological, and
human-initiated events that disrupt the normal functioning of the economy and
society on a large scale. Areas where disasters have occurred bring many
dangers to rescue teams and the communication network infrastructure is usually
destroyed. To manage these hazards, different wireless technologies can be
launched in the area of disaster. This paper discusses the innovative wireless
technologies for Disaster Management. Specifically, issues related to the
design of Hierarchical Hybrid Communication Network (arising in the
communication network for disaster relief) are discussed.
","[{'version': 'v1', 'created': 'Sun, 4 Sep 2011 05:45:17 GMT'}]",2011-09-06,"[['Garimella', 'Rama Murthy', ''], ['Abhijeet', 'Samdarshi', ''], ['Singhal', 'Deepti', '']]","['Disaster Management', 'Wireless Technology', 'Cognitive Radio', 'Wireless Sensor Network']"
13411,1501.05821,"Micha\""el Marcozzi","Micha\""el Marcozzi and Wim Vanhoof and Jean-Luc Hainaut","A Symbolic Execution Algorithm for Constraint-Based Testing of Database
  Programs",12 pages - preliminary work,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In so-called constraint-based testing, symbolic execution is a common
technique used as a part of the process to generate test data for imperative
programs. Databases are ubiquitous in software and testing of programs
manipulating databases is thus essential to enhance the reliability of
software. This work proposes and evaluates experimentally a symbolic ex-
ecution algorithm for constraint-based testing of database programs. First, we
describe SimpleDB, a formal language which offers a minimal and well-defined
syntax and seman- tics, to model common interaction scenarios between pro-
grams and databases. Secondly, we detail the proposed al- gorithm for symbolic
execution of SimpleDB models. This algorithm considers a SimpleDB program as a
sequence of operations over a set of relational variables, modeling both the
database tables and the program variables. By inte- grating this relational
model of the program with classical static symbolic execution, the algorithm
can generate a set of path constraints for any finite path to test in the
control- flow graph of the program. Solutions of these constraints are test
inputs for the program, including an initial content for the database. When the
program is executed with respect to these inputs, it is guaranteed to follow
the path with re- spect to which the constraints were generated. Finally, the
algorithm is evaluated experimentally using representative SimpleDB models.
","[{'version': 'v1', 'created': 'Fri, 23 Jan 2015 15:07:50 GMT'}]",2015-01-26,"[['Marcozzi', 'Michaël', ''], ['Vanhoof', 'Wim', ''], ['Hainaut', 'Jean-Luc', '']]","['Constraints-Based Testing', 'Test Inputs Generation', 'Symbolic Execution', 'Database Applications', 'Relational Constraints', 'Alloy']"
13412,1212.4441,Dr. Nadeem Javaid,"Syed Hassan Ahmed, Safdar H. Bouk, Nadeem Javaid, and Iwao Sasase",RF Propagation Analysis of MICAz Motes Antenna with Ground Effect,"15th IEEE International Multi Topic Conference (INMIC12), 2012",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we analyzed the Radio Frequency (RF) propagation
characteristics of monopole antenna in MICAz mote. During the experimental
analysis, two scenarios are considered. In Scenario-I, a pair of MICAz nodes
(one transmitting and one receiving node) are placed on the ground and the RSSI
is measured in presence of the ground effect. In Scenario-II, only the
transmitting node is placed above the ground; however, the receiving node is
placed on the ground. The RSSI is measured by changing the antenna orientation
at different angles and distances between them. The results show that the
ground effect, antenna orientation and distance between the sensor nodes
drastically affect the RSSI.
","[{'version': 'v1', 'created': 'Tue, 18 Dec 2012 17:44:58 GMT'}]",2012-12-19,"[['Ahmed', 'Syed Hassan', ''], ['Bouk', 'Safdar H.', ''], ['Javaid', 'Nadeem', ''], ['Sasase', 'Iwao', '']]","['Wireless Sensor Networks', 'RSSI', 'RF propagation', 'MICAz Mote']"
13413,1203.1647,Sheng Yu,Sheng Yu and Subhash Kak,A Survey of Prediction Using Social Media,20 pages,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media comprises interactive applications and platforms for creating,
sharing and exchange of user-generated contents. The past ten years have
brought huge growth in social media, especially online social networking
services, and it is changing our ways to organize and communicate. It
aggregates opinions and feelings of diverse groups of people at low cost.
Mining the attributes and contents of social media gives us an opportunity to
discover social structure characteristics, analyze action patterns
qualitatively and quantitatively, and sometimes the ability to predict future
human related events. In this paper, we firstly discuss the realms which can be
predicted with current social media, then overview available predictors and
techniques of prediction, and finally discuss challenges and possible future
directions.
","[{'version': 'v1', 'created': 'Wed, 7 Mar 2012 22:14:00 GMT'}]",2012-03-09,"[['Yu', 'Sheng', ''], ['Kak', 'Subhash', '']]","['social media', 'social network', 'social networking service', 'user-generated contents', 'prediction']"
13414,1610.07701,Martin Milani\v{c},"Endre Boros, Vladimir Gurvich, Martin Milani\v{c}, Vladimir Oudalov,
  Jernej Vi\v{c}i\v{c}",A three-person deterministic graphical game without Nash equilibria,"23 pages, 6 captioned and 15 uncaptioned figures",,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give an example of a three-person deterministic graphical game that has no
Nash equilibrium in pure stationary strategies. The game has seven positions,
four outcomes (a unique cycle and three terminal positions), and its normal
form is of size 2 x 2 x 4 only. Thus, our example strengthens significantly the
one obtained in 2014 by Gurvich and Oudalov; the latter has four players, five
terminals, and a 2 x 4 x 6 x 8 normal form. Furthermore, our example is minimal
with respect to the number of players. Both examples are tight but not
Nash-solvable. Such examples were known since 1975, but they were not related
to deterministic graphical games. Moreover, due to the small size of our
example, we can strengthen it further by showing that it has no Nash
equilibrium not only in pure but also in independently mixed strategies, for
both Markovian and a priori evaluations.
","[{'version': 'v1', 'created': 'Tue, 25 Oct 2016 01:33:07 GMT'}, {'version': 'v2', 'created': 'Sun, 23 Jul 2017 20:53:06 GMT'}]",2017-07-25,"[['Boros', 'Endre', ''], ['Gurvich', 'Vladimir', ''], ['Milanič', 'Martin', ''], ['Oudalov', 'Vladimir', ''], ['Vičič', 'Jernej', '']]","['deterministic graphical multi-person game', 'perfect information', 'Nash equilibrium', 'directed cycle', 'terminal position', 'pure stationary strategy']"
13415,1004.1708,Rdv Ijcsis,"Manoranjan Kumar Singh, Rakesh. L",Mathematical Principles in Software Quality Engineering,"IEEE Publication format, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","IJCSIS, Vol. 7 No. 3, March 2010, 178-184",,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Mathematics has many useful properties for developing of complex software
systems. One is that it can exactly describe a physical situation of the object
or outcome of an action. Mathematics support abstraction and this is an
excellent medium for modeling, since it is an exact medium there is a little
possibility of ambiguity. This paper demonstrates that mathematics provides a
high level of validation when it is used as a software medium. It also outlines
distinguishing characteristics of structural testing which is based on the
source code of the program tested. Structural testing methods are very amenable
to rigorous definition, mathematical analysis and precise measurement. Finally,
it also discusses functional and structural testing debate to have a sense of
complete testing. Any program can be considered to be a function in the sense
that program input forms its domain and program outputs form its range. In
general discrete mathematics is more applicable to functional testing, while
graph theory pertains more to structural testing.
","[{'version': 'v1', 'created': 'Sat, 10 Apr 2010 11:17:35 GMT'}]",2010-04-19,"[['Singh', 'Manoranjan Kumar', ''], ['L', 'Rakesh.', '']]","['Propositional logic', 'Graph theory', 'Validation', 'Fault']"
13416,0907.4994,R Doomun,"R.K.Pateriya, J.L.Rana, S.C. Shrivastava, Jaideep Patel","A Proposed Algorithm to improve security & Efficiency of SSL-TLS servers
  using Batch RSA decryption","5 pages, International Journal of Computer Science and Information
  Security, IJCSIS, Impact Factor 0.423","IJCSIS July 2009, Volume 3, ISSN 1947 5500",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today, Internet becomes the essential part of our lives. Over 90 percent of
the ecommerce is developed on the Internet. A security algorithm became very
necessary for producer client transactions assurance and the financial
applications safety. The rsa algorithm applicability derives from algorithm
properties like confidentiality, safe authentication, data safety and integrity
on the internet. Thus, this kind of networks can have a more easy utilization
by practical accessing from short, medium, even long distance and from
different public places. Rsa encryption in the client side is relatively cheap,
whereas, the corresponding decryption in the server side is expensive because
its private exponent is much larger. Thus ssl tls servers become swamped to
perform public key decryption operations when the simultaneous requests
increase quickly .The batch rsa method is useful for such highly loaded web
server .In our proposed algorithm by reducing the response time and clients
tolerable waiting time an improvement in performance of ssl tls servers can be
done. The proposed algorithm should provide the reasonable response time and
optimizes server performance significantly. At Encryption side, to withstand
many attacks like brute force attack, subtle attack etc. we also adapted a
parameter generation method, which sieve all the parameters strictly, and
filter out every insecure parameter.
","[{'version': 'v1', 'created': 'Tue, 28 Jul 2009 20:17:04 GMT'}]",2009-07-30,"[['Pateriya', 'R. K.', ''], ['Rana', 'J. L.', ''], ['Shrivastava', 'S. C.', ''], ['Patel', 'Jaideep', '']]","['Batch RSA', 'MiniBatching', 'Tolerable waiting time', 'response time']"
13417,1312.2709,Anugrah Kumar,"Anugrah Kumar, Sanjiban Shekar Roy, Sarvesh SS Rawat, Sanklan Saxena","Phishing Detection by determining reliability factor using rough set
  theory","The International Conference on Machine Intelligence Research and
  Advancement, ICMIRA-2013",,,,cs.AI,http://creativecommons.org/licenses/by/3.0/,"  Phishing is a common online weapon, used against users, by Phishers for
acquiring a confidential information through deception. Since the inception of
internet, nearly everything, ranging from money transaction to sharing
information, is done online in most parts of the world. This has also given
rise to malicious activities such as Phishing. Detecting Phishing is an
intricate process due to complexity, ambiguity and copious amount of
possibilities of factors responsible for phishing . Rough sets can be a
powerful tool, when working on such kind of Applications containing vague or
imprecise data. This paper proposes an approach towards Phishing Detection
Using Rough Set Theory. The Thirteen basic factors, directly responsible
towards Phishing, are grouped into four Strata. Reliability Factor is
determined on the basis of the outcome of these strata, using Rough Set Theory
. Reliability Factor determines the possibility of a suspected site to be Valid
or Fake. Using Rough set Theory most and the least influential factors towards
Phishing are also determined.
","[{'version': 'v1', 'created': 'Tue, 10 Dec 2013 08:10:38 GMT'}]",2013-12-11,"[['Kumar', 'Anugrah', ''], ['Roy', 'Sanjiban Shekar', ''], ['Rawat', 'Sarvesh SS', ''], ['Saxena', 'Sanklan', '']]","['Phishing', 'Rough Sets', 'Spam', 'Reliability Factor']"
13418,1603.03533,Mohammad Abdollahi Azgomi,Elaheh Ghassabani and Mohammad Abdollahi Azgomi,Stateless Code Model Checking of Information Flow Security,"Trustworthy Computing Laboratory, School of Computer Engineering,
  Iran University of Science and Technology, Tehran, Iran, 2014",,,Technical Report No. TWcL-TR-1401,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Observational determinism is a security property that characterizes secure
information flow for multithreaded programs. Most of the methods that have been
used to verify observational determinism are based on either type systems or
conventional model checking techniques. A conventional model checker is
stateful and often verifies a system model usually constructed manually. As
these methods are based on stateful model checking, they are confronted with
the state space explosion problem. In order to verify and test computer
programs, stateless code model checking is more appropriate than conventional
techniques. It is an effective method for systematic testing of large and
complicated concurrent programs, and for exploring the state space of such
programs. In this paper, we propose a new method for verifying information flow
security in concurrent programs. For the first time, we use stateless code
model checking to verify observational determinism.
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2016 06:28:50 GMT'}]",2016-03-14,"[['Ghassabani', 'Elaheh', ''], ['Azgomi', 'Mohammad Abdollahi', '']]","['Information flow security', 'observational determinism', 'stateless code model checking', 'software']"
13419,1712.05307,Soufian Toufga,"Soufian Toufga (LAAS-SARA), Philippe Owezarski (LAAS-SARA), Slim
  Abdellatif (LAAS-SARA), Thierry Villemur (LAAS-SARA)","An SDN hybrid architecture for vehicular networks: Application to
  Intelligent Transport System",,"9th European Congress on Embedded Real Time Software And Systems
  (ERTS), Jan 2018, Toulouse, France. 8p., 2018",,Rapport LAAS n{\textdegree} 17464,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vehicular networks are one of the cornerstone of an Intelligent
Transportation System (ITS). They are expected to provide ubiquitous network
connectivity to moving vehicles while supporting various ITS services, some
with very stringent requirements in terms of latency and reliability. Two
vehicular networking technologies are envisioned to jointly support the full
range of ITS services : DSRC (Dedicated Short Range Communication) for direct
vehicle to vehicle/Road Side Units (RSU) communications and cellular
technologies. To the best of our knowledge, approaches from the literature
usually divide ITS services on each of these networks according to their
requirements and one single network is in charge of supporting the each
service. Those that consider both network technologies to offer multi-path
routing, load balancing or path splitting for a better quality of experience of
ITS services assume obviously separately controlled networks. Under the
umbrella of SDN (Software Defined Networking), we propose in this paper a
hybrid network architecture that enables the joint control of the networks
providing connectivity to multi-homed vehicles and, also, explore the
opportunities brought by such an architecture. We show through some use cases,
that in addition to the flexibility and fine-grained programmability brought by
SDN, it opens the way towards the development of effective network control
algorithms that are the key towards the successful support of ITS services and
especially those with stringent QoS. We also show how these algorithms could
also benefit from information related to the environment or context in which
vehicles evolve (traffic density, planned trajectory, ..), which could be
easily collected by data providers and made available via the cloud.
","[{'version': 'v1', 'created': 'Thu, 14 Dec 2017 16:04:18 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Jan 2018 13:38:40 GMT'}]",2018-01-09,"[['Toufga', 'Soufian', '', 'LAAS-SARA'], ['Owezarski', 'Philippe', '', 'LAAS-SARA'], ['Abdellatif', 'Slim', '', 'LAAS-SARA'], ['Villemur', 'Thierry', '', 'LAAS-SARA']]","['Vehicular  Network', 'QoS', 'Intelligent  Transport']"
13420,1511.05667,Leon Abdillah,"Fikri, Leon Andretti Abdillah, Ema Apriyani","Perancangan teknologi cloud untuk penjualan online kain songket
  Palembang","6 pages in Seminar Nasional Sistem Informasi Indonesia ke-8
  (SESINDO2015), Institut Teknologi Sepuluh Nopember (ITS), Surabaya, 2015",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud Computing is a paradigm in which information is permanently stored in
servers on the Internet and temporarily stored on the user's computer (client)
including the desktop. This study aims to design an online sales application
based cloud computing technology to help the artisans Palembang songket and do
not rule out the possibility for other small medium enterprises (SMEs) to
manage assets and market their products online so it can be accessed anytime
and anywhere via personal computer, laptop, tabblet, mobile phone or
smartphone. Cloud infrastructure used in this study is a Software-as-a-service
(SaaS) that enables cloud users to exploit online sales application without
having to install on your local computer, set up a dedicated server, operator
labor, maintenance costs and other support resources that can make savings in
terms of cost.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2015 06:32:08 GMT'}]",2015-11-19,"[['Fikri', '', ''], ['Abdillah', 'Leon Andretti', ''], ['Apriyani', 'Ema', '']]","['Cloud technology design', 'Online sales', 'Palembang songket cloth', 'SMEs', 'Saas']"
13421,1304.5251,Yousuf Ibrahim Khan,Yousuf Ibrahim Khan,Applications of Dynamical Systems in Engineering,32 Pages,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the current possible applications of Dynamical Systems in
Engineering. The applications of chaos, fractals have proven to be an exciting
and fruitful endeavor. These applications are highly diverse ranging over such
fields as Electrical, Electronics and Computer Engineering. Dynamical Systems
theory describes general patterns found in the solution of systems of nonlinear
equations. The theory focuses upon those equations representing the change of
processes in time. This paper offers the issue of applying dynamical systems
methods to a wider circle of Engineering problems. There are three components
to our approach: ongoing and possible applications of Fractals, Chaos Theory
and Dynamical Systems. Some basic and useful computer simulation of Dynamical
System related problems have been shown also.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2013 20:54:14 GMT'}]",2013-04-22,"[['Khan', 'Yousuf Ibrahim', '']]","['Dynamical Systems', 'Chaos', 'Fractals', 'Control', 'Feedback']"
13422,1402.4778,Jan Bergstra,Jan A. Bergstra and Peter Weijland,Bitcoin: a Money-like Informational Commodity,,,,Report TCS 1402,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The question ""what is Bitcoin"" allows for many answers depending on the
objectives aimed at when providing such answers. The question addressed in this
paper is to determine a top-level classification, or type, for Bitcoin. We will
classify Bitcoin as a system of type money-like informational commodity (MLIC).
","[{'version': 'v1', 'created': 'Wed, 19 Feb 2014 19:25:15 GMT'}]",2014-02-20,"[['Bergstra', 'Jan A.', ''], ['Weijland', 'Peter', '']]","['informational money', 'informational commodity', 'near-money', 'cryptocurrency', 'Bitcoin']"
13423,1003.4637,Zhineng Chen,"Zhineng Chen, Juan Cao, Yicheng Song, Junbo Guo, Yongdong Zhang, and
  Jintao Li",Context-Oriented Web Video Tag Recommendation,"2 pages, 2 figures, 1 table","Proceedings of the 19th international conference on World wide web
  (WWW2010), April 26-30, 2010",,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tag recommendation is a common way to enrich the textual annotation of
multimedia contents. However, state-of-the-art recommendation methods are built
upon the pair-wised tag relevance, which hardly capture the context of the web
video, i.e., when who are doing what at where. In this paper we propose the
context-oriented tag recommendation (CtextR) approach, which expands tags for
web videos under the context-consistent constraint. Given a web video, CtextR
first collects the multi-form WWW resources describing the same event with the
video, which produce an informative and consistent context; and then, the tag
recommendation is conducted based on the obtained context. Experiments on an
80,031 web video collection show CtextR recommends various relevant tags to web
videos. Moreover, the enriched tags improve the performance of web video
categorization.
","[{'version': 'v1', 'created': 'Wed, 24 Mar 2010 13:07:08 GMT'}]",2010-03-25,"[['Chen', 'Zhineng', ''], ['Cao', 'Juan', ''], ['Song', 'Yicheng', ''], ['Guo', 'Junbo', ''], ['Zhang', 'Yongdong', ''], ['Li', 'Jintao', '']]","['Social tagging', 'context-oriented', 'web video', 'tag recommendation']"
13424,1207.5117,Mahyuddin K. M.  Nasution,Mahyuddin K. M. Nasution,Algebraic on Magic Square of Odd Order n,"8 pages, Proceedings of The 1st IMT-GT Regional Conference on
  Mathematics, Statistics and Their Application, Toba Lake, Sumatera Utara,
  Indonesia: 29-36",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper aims to address the relation between a magic square of odd order
$n$ and a group, and their properties. By the modulo number $n$, we construct
entries for each table from initial table of magic square with large number
$n^2$. Generalization of the underlying idea is presented, we obtain unique
group, and we also prove variants of the main results for magic cubes.
","[{'version': 'v1', 'created': 'Sat, 21 Jul 2012 10:28:29 GMT'}]",2012-07-24,"[['Nasution', 'Mahyuddin K. M.', '']]","['entry', 'array', 'algorithm', 'magic cubes', 'group']"
13425,1106.5460,Jeremiah Wala,"Jeremiah Wala, Sergei Fotin, Jaesung Lee, Artit Jirapatnakul, Alberto
  Biancardi and Anthony Reeves","Automated segmentation of the pulmonary arteries in low-dose CT by
  vessel tracking",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a fully automated method for top-down segmentation of the
pulmonary arterial tree in low-dose thoracic CT images. The main basal
pulmonary arteries are identified near the lung hilum by searching for
candidate vessels adjacent to known airways, identified by our previously
reported airway segmentation method. Model cylinders are iteratively fit to the
vessels to track them into the lungs. Vessel bifurcations are detected by
measuring the rate of change of vessel radii, and child vessels are segmented
by initiating new trackers at bifurcation points. Validation is accomplished
using our novel sparse surface (SS) evaluation metric. The SS metric was
designed to quantify the magnitude of the segmentation error per vessel while
significantly decreasing the manual marking burden for the human user. A total
of 210 arteries and 205 veins were manually marked across seven test cases.
134/210 arteries were correctly segmented, with a specificity for arteries of
90%, and average segmentation error of 0.15 mm. This fully-automated
segmentation is a promising method for improving lung nodule detection in
low-dose CT screening scans, by separating vessels from surrounding
iso-intensity objects.
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2011 17:47:23 GMT'}]",2011-06-28,"[['Wala', 'Jeremiah', ''], ['Fotin', 'Sergei', ''], ['Lee', 'Jaesung', ''], ['Jirapatnakul', 'Artit', ''], ['Biancardi', 'Alberto', ''], ['Reeves', 'Anthony', '']]","['pulmonary artery segmentation', 'vessel tracking', 'computed tomography(CT)', 'validation metric']"
13426,1212.4797,Pascal Lenzner,Bernd Kawald and Pascal Lenzner,On Dynamics in Selfish Network Creation,"36 pages, 16 figures. To appear at SPAA'13",,,,cs.GT cs.DS math.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the dynamic behavior of several variants of the Network Creation
Game, introduced by Fabrikant et al. [PODC'03]. Equilibrium networks in these
models have desirable properties like low social cost and small diameter, which
makes them attractive for the decentralized creation of overlay-networks.
Unfortunately, due to the non-constructiveness of the Nash equilibrium, no
distributed algorithm for finding such networks is known. We treat these games
as sequential-move games and analyze whether (uncoordinated) selfish play
eventually converges to an equilibrium state. Thus, we shed light on one of the
most natural algorithms for this problem: distributed local search, where in
each step some agent performs a myopic selfish improving move.
  We show that fast convergence is guaranteed for all versions of Swap Games,
introduced by Alon et al. [SPAA'10], if the initial network is a tree, and show
that this process can be sped up to an almost optimal number of moves. For
non-tree networks we show the surprising result that even one non-tree edge
suffices to destroy the convergence guarantee and no move policy can enforce
convergence. This answers an open problem from Ehsani et al. [SPAA'11] in the
negative. We extend our negative results to the well-studied original version
and prove that there is no convergence guarantee -- even if all agents play
optimally. Furthermore, we show the quite surprising result that employing
cost-sharing yields even worse dynamic behavior.
  Finally, we contrast our mostly negative theoretical results by a careful
empirical study. Our simulations indicate two positive facts: (1) The
non-convergent behavior seems to be confined to a small set of pathological
instances and is unlikely to show up in practice. (2) In all our simulations we
observed a remarkably fast convergence towards a stable network in O(n) steps,
where n is the number of agents.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2012 19:17:57 GMT'}, {'version': 'v2', 'created': 'Tue, 28 May 2013 14:56:08 GMT'}]",2013-05-29,"[['Kawald', 'Bernd', ''], ['Lenzner', 'Pascal', '']]","['Network Creation Games', 'Game Dynamics', 'Convergence', 'Stabilization', 'Distributed Local Search']"
13427,1504.04811,Sergey Tarasenko,Sergey Tarasenko,"Socializing Autonomous Units with the Reflexive Game Theory and
  Resonate-and-Fire neurons","10 pages, 15 figures",,,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study the concept of reflexia is applied to modeling behavior of
autonomous units. The relationship between reflexia, on the one hand, and
mirror neuron system and perception of emotions, on the other hand, is
introduced. The main method of using reflexia in a group of autonomous units is
Reflexive Game Theory (RGT). To embody RGT in a group of autonomous agents a
communication system is employed. This communication system uses frequency
domain multiplexing by means of Izhikevich's resonate-and-fire neural models.
The result of socialization of autonomous units by means of RGT and
communication system is illustrated in several examples.
","[{'version': 'v1', 'created': 'Sun, 19 Apr 2015 08:37:40 GMT'}]",2015-04-21,"[['Tarasenko', 'Sergey', '']]","['reflexive game theory', 'multiagent systems', 'resonateand-fire neurons']"
13428,0801.4307,Uwe Aickelin,Uwe Aickelin and Qi Chen,On Affinity Measures for Artificial Immune System Movie Recommenders,,"Proceedings of the 5th International Conference on Recent Advances
  in Soft Computing (RASC 2004), Nottingham, UK",,,cs.NE cs.AI cs.CY,,"  We combine Artificial Immune Systems 'AIS', technology with Collaborative
Filtering 'CF' and use it to build a movie recommendation system. We already
know that Artificial Immune Systems work well as movie recommenders from
previous work by Cayzer and Aickelin 3, 4, 5. Here our aim is to investigate
the effect of different affinity measure algorithms for the AIS. Two different
affinity measures, Kendalls Tau and Weighted Kappa, are used to calculate the
correlation coefficients for the movie recommender. We compare the results with
those published previously and show that Weighted Kappa is more suitable than
others for movie problems. We also show that AIS are generally robust movie
recommenders and that, as long as a suitable affinity measure is chosen,
results are good.
","[{'version': 'v1', 'created': 'Mon, 28 Jan 2008 15:14:45 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Mar 2008 17:06:30 GMT'}, {'version': 'v3', 'created': 'Fri, 16 May 2008 10:44:44 GMT'}]",2008-05-16,"[['Aickelin', 'Uwe', ''], ['Chen', 'Qi', '']]","['Artificial Immune System', 'Recommendation System', 'Affinity Measure', 'Correlation']"
13429,1505.03332,Jean Louis Fendji Kedieng Ebongue,"Jean Louis Fendji Kedieng Ebongue, Christopher Thron, Jean Michel
  Nlong",Mesh Router Nodes placement in Rural Wireless Mesh Networks,"8 pages, 4 figures, Conference CARI 2014",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of placement of mesh router nodes in Wireless Mesh Networks is
known to be a NP hard problem. In this paper, the problem is addressed under a
constraint of network model tied to rural regions where we usually observe low
density and sparse population. We consider the area to cover as decomposed into
a set of elementary areas which can be required or optional in terms of
coverage and where a node can be placed or not. We propose an effective
algorithm to ensure the coverage. This algorithm is based on metropolis
approach. We evaluated the proposed algorithm on an instance network. A close
to 100 percent coverage with an optimal number of routers showed the efficiency
of our approach for the mesh router node placement problem
","[{'version': 'v1', 'created': 'Wed, 13 May 2015 11:15:28 GMT'}]",2015-05-14,"[['Ebongue', 'Jean Louis Fendji Kedieng', ''], ['Thron', 'Christopher', ''], ['Nlong', 'Jean Michel', '']]","['Metropolis', 'Wireless Mesh Networks', 'Mesh router node placement']"
13430,1707.08807,Pascal Su,"Fabian Kuhn, Konstantinos Panagiotou, Pascal Su",Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the nearest common ancestor (NCA) function in rooted trees. As
the main conceptual contribution, the paper introduces universal trees for the
NCA function: For a given family of rooted trees, an NCA-universal tree $S$ is
a rooted tree such that any tree $T$ of the family can be embedded into $S$
such that the embedding of the NCA in $T$ of two nodes of $T$ is equal to the
NCA in $S$ of the embeddings of the two nodes.
  As the main technical result we give explicit constructions of NCA-universal
trees of size $n^{2.318}$ for the family of rooted $n$-vertex trees and of size
$n^{1.894}$ for the family of rooted binary $n$-vertex trees. A direct
consequence is the explicit construction of NCA-labeling schemes with labels of
size $2.318\log_2 n$ and $1.894\log_2 n$ for the two families of rooted trees.
This improves on the best known such labeling schemes established by Alstrup,
Halvorsen and Larsen [SODA 2014].
","[{'version': 'v1', 'created': 'Thu, 27 Jul 2017 10:05:33 GMT'}]",2017-07-28,"[['Kuhn', 'Fabian', ''], ['Panagiotou', 'Konstantinos', ''], ['Su', 'Pascal', '']]","['Rooted Trees', 'NCA', 'Nearest Common Ancestor', 'Lowest Common Ancestor', 'Universal Trees', 'Labeling Schemes', 'Embedding Schemes']"
13431,1510.08982,Kooktae Lee,"Kooktae Lee, Raktim Bhattacharya","Asynchronous Parallel Computing Algorithm implemented in 1D Heat
  Equation with CUDA",arXiv admin note: text overlap with arXiv:1503.03952,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this note, we present the stability as well as performance analysis of
asynchronous parallel computing algorithm implemented in 1D heat equation with
CUDA. The primary objective of this note lies in dissemination of asynchronous
parallel computing algorithm by providing CUDA code for fast and easy
implementation. We show that the simulations carried out on nVIDIA GPU device
with asynchronous scheme outperforms synchronous parallel computing algorithm.
In addition, we also discuss some drawbacks of asynchronous parallel computing
algorithms.
","[{'version': 'v1', 'created': 'Fri, 30 Oct 2015 06:34:18 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Nov 2015 03:05:24 GMT'}]",2015-11-03,"[['Lee', 'Kooktae', ''], ['Bhattacharya', 'Raktim', '']]","['1D heat equation', 'asynchronous parallel computing algorithm', 'highperformance computing', 'CUDA']"
13432,1110.1015,Marco Sirianni Dr.,"Simona Perri, Francesco Ricca, Marco Sirianni",Parallel Instantiation of ASP Programs: Techniques and Experiments,,,,,cs.PL cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Answer Set Programming (ASP) is a powerful logic-based programming language,
which is enjoying increasing interest within the scientific community and (very
recently) in industry. The evaluation of ASP programs is traditionally carried
out in two steps. At the first step an input program P undergoes the so-called
instantiation (or grounding) process, which produces a program P' semantically
equivalent to P, but not containing any variable; in turn, P' is evaluated by
using a backtracking search algorithm in the second step. It is well-known that
instantiation is important for the efficiency of the whole evaluation, might
become a bottleneck in common situations, is crucial in several realworld
applications, and is particularly relevant when huge input data has to be dealt
with. At the time of this writing, the available instantiator modules are not
able to exploit satisfactorily the latest hardware, featuring
multi-core/multi-processor SMP (Symmetric MultiProcessing) technologies. This
paper presents some parallel instantiation techniques, including load-balancing
and granularity control heuristics, which allow for the effective exploitation
of the processing power offered by modern SMP machines. This is confirmed by an
extensive experimental analysis herein reported.
  To appear in Theory and Practice of Logic Programming (TPLP).
  KEYWORDS: Answer Set Programming, Instantiation, Parallelism, Heuristics
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2011 15:06:42 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Oct 2011 09:51:24 GMT'}]",2011-10-14,"[['Perri', 'Simona', ''], ['Ricca', 'Francesco', ''], ['Sirianni', 'Marco', '']]","['Answer Set Programming', 'Instantiation', 'Parallelism', 'Heuristics']"
13433,1504.02027,Vasile Patrascu,Vasile Patrascu,The Neutrosophic Entropy and its Five Components,,"Neutrosophic Sets and Systems, Vol.7, 2015,pp. 40-46",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents two variants of penta-valued representation for
neutrosophic entropy. The first is an extension of Kaufmann's formula and the
second is an extension of Kosko's formula.
  Based on the primary three-valued information represented by the degree of
truth, degree of falsity and degree of neutrality there are built some
penta-valued representations that better highlights some specific features of
neutrosophic entropy. Thus, we highlight five features of neutrosophic
uncertainty such as ambiguity, ignorance, contradiction, neutrality and
saturation. These five features are supplemented until a seven partition of
unity by adding two features of neutrosophic certainty such as truth and
falsity.
  The paper also presents the particular forms of neutrosophic entropy obtained
in the case of bifuzzy representations, intuitionistic fuzzy representations,
paraconsistent fuzzy representations and finally the case of fuzzy
representations.
","[{'version': 'v1', 'created': 'Thu, 5 Feb 2015 07:06:16 GMT'}]",2015-04-09,"[['Patrascu', 'Vasile', '']]","['Neutrosophic information', 'neutrosophic entropy', 'neutrosophic uncertainty', 'ambiguity', 'contradiction', 'neutrality', 'igno']"
13434,0807.1524,Yves Bertot,"Yves Bertot (INRIA Sophia Antipolis), Ekaterina Komendantskaya (INRIA
  Sophia Antipolis)",Inductive and Coinductive Components of Corecursive Functions in Coq,Dans Coalgebraic Methods in Computer Science (2008),,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Constructive Type Theory, recursive and corecursive definitions are
subject to syntactic restrictions which guarantee termination for recursive
functions and productivity for corecursive functions. However, many terminating
and productive functions do not pass the syntactic tests. Bove proposed in her
thesis an elegant reformulation of the method of accessibility predicates that
widens the range of terminative recursive functions formalisable in
Constructive Type Theory. In this paper, we pursue the same goal for productive
corecursive functions. Notably, our method of formalisation of coinductive
definitions of productive functions in Coq requires not only the use of ad-hoc
predicates, but also a systematic algorithm that separates the inductive and
coinductive parts of functions.
","[{'version': 'v1', 'created': 'Wed, 9 Jul 2008 19:16:25 GMT'}]",2008-07-10,"[['Bertot', 'Yves', '', 'INRIA Sophia Antipolis'], ['Komendantskaya', 'Ekaterina', '', 'INRIA\n  Sophia Antipolis']]","['Coq', 'Induction', 'Coinduction', 'Productiveness', 'Guardedness', 'Accessibility Predicates']"
13435,1702.02072,Chao-Yang Chen,"Chao-Yang Chena, Wei-Hua Gui, Zhi-Hong Guan, Ru-Liang Wang, Shao-Wu
  Zhou","Adaptive Neural Control for a Class of Stochastic Nonlinear Systems with
  Unknown Parameters, Unknown Nonlinear Functions and Stochastic Disturbances","9 pages, 6 figures, Neurocomputing",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, adaptive neural control (ANC) is investigated for a class of
strict-feedback nonlinear stochastic systems with unknown parameters, unknown
nonlinear functions and stochastic disturbances. The new controller of adaptive
neural network with state feedback is presented by using a universal
approximation of radial basis function neural network and backstepping. An
adaptive neural network state-feedback controller is designed by constructing a
suitable Lyapunov function. Adaptive bounding design technique is used to deal
with the unknown nonlinear functions and unknown parameters. It is shown that,
the global asymptotically stable in probability can be achieved for the
closed-loop system. The simulation results are presented to demonstrate the
effectiveness of the proposed control strategy in the presence of unknown
parameters, unknown nonlinear functions and stochastic disturbances.
","[{'version': 'v1', 'created': 'Tue, 7 Feb 2017 15:57:55 GMT'}]",2017-02-08,"[['Chena', 'Chao-Yang', ''], ['Gui', 'Wei-Hua', ''], ['Guan', 'Zhi-Hong', ''], ['Wang', 'Ru-Liang', ''], ['Zhou', 'Shao-Wu', '']]","['Unknown parameters', 'stochastic disturbances', 'unknown nonlinear functions', 'stochastic nonlinear', 'adaptive neuralcontrol']"
13436,1510.08267,Supartha Podder,"Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder",Graph properties in node-query setting: effect of breaking symmetry,"26 pages, 8 figures",,,,cs.CC cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The query complexity of graph properties is well-studied when queries are on
edges. We investigate the same when queries are on nodes. In this setting a
graph $G = (V, E)$ on $n$ vertices and a property $\mathcal{P}$ are given. A
black-box access to an unknown subset $S \subseteq V$ is provided via queries
of the form `Does $i \in S$?'. We are interested in the minimum number of
queries needed in worst case in order to determine whether $G[S]$, the subgraph
of $G$ induced on $S$, satisfies $\mathcal{P}$.
  Apart from being combinatorially rich, this setting allows us to initiate a
systematic study of breaking symmetry in the context of query complexity of
graph properties. In particular, we focus on hereditary graph properties. The
monotone functions in the node-query setting translate precisely to the
hereditary graph properties. The famous Evasiveness Conjecture asserts that
even with a minimal symmetry assumption on $G$, namely that of
vertex-transitivity, the query complexity for any hereditary graph property in
our setting is the worst possible, i.e., $n$.
  We show that in the absence of any symmetry on $G$ it can fall as low as
$O(n^{1/(d + 1) })$ where $d$ denotes the minimum possible degree of a minimal
forbidden sub-graph for $\mathcal{P}$. In particular, every hereditary property
benefits at least quadratically. The main question left open is: can it go
exponentially low for some hereditary property?
  We show that the answer is no for any hereditary property with {finitely
many} forbidden subgraphs by exhibiting a bound of $\Omega(n^{1/k})$ for some
constant $k$ depending only on the property. For general ones we rule out the
possibility of the query complexity falling down to constant by showing
$\Omega(\log n/ \log \log n)$ bound. Interestingly, our lower bound proofs rely
on the famous Sunflower Lemma due to Erd\""os and Rado.
","[{'version': 'v1', 'created': 'Wed, 28 Oct 2015 11:47:33 GMT'}]",2015-10-29,"[['Balaji', 'Nikhil', ''], ['Datta', 'Samir', ''], ['Kulkarni', 'Raghav', ''], ['Podder', 'Supartha', '']]","['Query Complexity', 'Graph Properties', 'Symmetry and Computation', 'Forbidden Subgraph']"
13437,1004.4109,Pavel Ruzankin,Pavel Ruzankin,"Operator-oriented programming: a new paradigm for implementing window
  interfaces and parallel algorithms",,,,,cs.PL cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new programming paradigm which can be useful, in particular, for
implementing window interfaces and parallel algorithms. This paradigm allows a
user to define operators which can contain nested operators. The new paradigm
is called operator-oriented. One of the goals of this paradigm is to escape the
complexity of objects definitions inherent in many object-oriented languages
and to move to transparent algorithms definitions.
","[{'version': 'v1', 'created': 'Fri, 23 Apr 2010 12:02:51 GMT'}]",2010-04-26,"[['Ruzankin', 'Pavel', '']]","['programming paradigm', 'programming language', 'parallel programming', 'window interface']"
13438,1607.00656,Gavin Rens,Gavin Rens and Deshendran Moodley,"A Hybrid POMDP-BDI Agent Architecture with Online Stochastic Planning
  and Plan Caching","26 pages, 3 figures, unpublished version",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents an agent architecture for controlling an autonomous
agent in stochastic environments. The architecture combines the partially
observable Markov decision process (POMDP) model with the
belief-desire-intention (BDI) framework. The Hybrid POMDP-BDI agent
architecture takes the best features from the two approaches, that is, the
online generation of reward-maximizing courses of action from POMDP theory, and
sophisticated multiple goal management from BDI theory. We introduce the
advances made since the introduction of the basic architecture, including (i)
the ability to pursue multiple goals simultaneously and (ii) a plan library for
storing pre-written plans and for storing recently generated plans for future
reuse. A version of the architecture without the plan library is implemented
and is evaluated using simulations. The results of the simulation experiments
indicate that the approach is feasible.
","[{'version': 'v1', 'created': 'Sun, 3 Jul 2016 17:11:52 GMT'}]",2016-07-05,"[['Rens', 'Gavin', ''], ['Moodley', 'Deshendran', '']]","['Autonomous Agents', 'POMDP', 'BDI', 'Satisfaction', 'Plans', 'Planning', 'Memory']"
13439,1004.2719,Martin Klein,"Martin Klein, Jeffery Shipman, Michael L. Nelson",Is This a Good Title?,"10 pages, 8 figures, 4 tables, 37 references, accepted for
  publication at Hypertext 2010 in Toronto, Canada",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Missing web pages, URIs that return the 404 ""Page Not Found"" error or the
HTTP response code 200 but dereference unexpected content, are ubiquitous in
today's browsing experience. We use Internet search engines to relocate such
missing pages and provide means that help automate the rediscovery process. We
propose querying web pages' titles against search engines. We investigate the
retrieval performance of titles and compare them to lexical signatures which
are derived from the pages' content. Since titles naturally represent the
content of a document they intuitively change over time. We measure the edit
distance between current titles and titles of copies of the same pages obtained
from the Internet Archive and display their evolution. We further investigate
the correlation between title changes and content modifications of a web page
over time. Lastly we provide a predictive model for the quality of any given
web page title in terms of its discovery performance. Our results show that
titles return more than 60% URIs top ranked and further relevant content
returned in the top 10 results. We show that titles decay slowly but are far
more stable than the pages' content. We further distill stop titles than can
help identify insufficiently performing search engine queries.
","[{'version': 'v1', 'created': 'Thu, 15 Apr 2010 21:30:41 GMT'}]",2010-04-19,"[['Klein', 'Martin', ''], ['Shipman', 'Jeffery', ''], ['Nelson', 'Michael L.', '']]","['Web Page Titles', 'Web Page Discovery', 'Digital Preservation']"
13440,1609.09547,Wenjun Mei,"Wenjun Mei, Francesco Bullo","Competitive Propagation: Models, Asymptotic Behavior and Multi-stage
  Games",,,,,cs.SI cs.MA math.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a class of propagation models for multiple competing
products over a social network. We consider two propagation mechanisms: social
conversion and self conversion, corresponding, respectively, to endogenous and
exogenous factors. A novel concept, the product-conversion graph, is proposed
to characterize the interplay among competing products. According to the
chronological order of social and self conversions, we develop two Markov-chain
models and, based on the independence approximation, we approximate them with
two respective difference equations systems.
  Theoretical analysis on these two approximation models reveals the dependency
of the systems' asymptotic behavior on the structures of both the
product-conversion graph and the social network, as well as the initial
condition. In addition to the theoretical work, accuracy of the independence
approximation and the asymptotic behavior of the Markov-chain model are
investigated via numerical analysis, for the case where social conversion
occurs before self conversion.
  Finally, we propose a class of multi-player and multi-stage competitive
propagation games and discuss the seeding-quality trade-off, as well as the
allocation of seeding resources among the individuals. We investigate the
unique Nash equilibrium at each stage and analyze the system's behavior when
every player is adopting the policy at the Nash equilibrium.
","[{'version': 'v1', 'created': 'Thu, 29 Sep 2016 23:34:02 GMT'}]",2016-10-03,"[['Mei', 'Wenjun', ''], ['Bullo', 'Francesco', '']]","['competitive propagation', 'independence approximation', 'network structure', 'stability analysis', 'multi-stage uncooperative game', 'seeding', 'product quality']"
13441,1207.4266,Alexander Gutfraind,"Alexander Gutfraind, Lauren Ancel Meyers, Ilya Safro",Multiscale Network Generation,28 pages,,,,cs.DM cond-mat.stat-mech cs.SI math.CO physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Networks are widely used in science and technology to represent relationships
between entities, such as social or ecological links between organisms,
enzymatic interactions in metabolic systems, or computer infrastructure.
Statistical analyses of networks can provide critical insights into the
structure, function, dynamics, and evolution of those systems. However, the
structures of real-world networks are often not known completely, and they may
exhibit considerable variation so that no single network is sufficiently
representative of a system. In such situations, researchers may turn to proxy
data from related systems, sophisticated methods for network inference, or
synthetic networks. Here, we introduce a flexible method for synthesizing
realistic ensembles of networks starting from a known network, through a series
of mappings that coarsen and later refine the network structure by randomized
editing. The method, MUSKETEER, preserves structural properties with minimal
bias, including unknown or unspecified features, while introducing realistic
variability at multiple scales. Using examples from several domains, we show
that MUSKETEER produces the intended stochasticity while achieving greater
fidelity across a suite of network properties than do other commonly used
network generation algorithms.
","[{'version': 'v1', 'created': 'Wed, 18 Jul 2012 04:58:32 GMT'}]",2012-07-19,"[['Gutfraind', 'Alexander', ''], ['Meyers', 'Lauren Ancel', ''], ['Safro', 'Ilya', '']]","['multiscale methods', 'complex networks', 'network generation', 'coarsening']"
13442,1108.2822,Omar Lizardo A,"Cheng Wang and Anthony Strathman and Omar Lizardo and David Hachen and
  Zoltan Toroczkai and Nitesh V. Chawla",Weighted reciprocity in human communication networks,"14 pages, 5 figures, 1 table",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we define a metric for reciprocity---the degree of balance in a
social relationship---appropriate for weighted social networks in order to
investigate the distribution of this dyadic feature in a large-scale system
built from trace-logs of over a billion cell-phone communication events across
millions of actors. We find that dyadic relations in this network are
characterized by much larger degrees of imbalance than we would expect if
persons kept only those relationships that exhibited close to full reciprocity.
We point to two structural features of human communication behavior and
relationship formation---the division of contacts into strong and weak ties and
the tendency to form relationships with similar others---that either help or
hinder the ability of persons to obtain communicative balance in their
relationships. We examine the extent to which deviations from reciprocity in
the observed network are partially traceable to these characteristics.
","[{'version': 'v1', 'created': 'Sat, 13 Aug 2011 21:07:47 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Aug 2011 13:18:50 GMT'}, {'version': 'v3', 'created': 'Mon, 5 Sep 2011 16:16:21 GMT'}, {'version': 'v4', 'created': 'Thu, 8 Sep 2011 00:43:19 GMT'}, {'version': 'v5', 'created': 'Sat, 10 Sep 2011 18:03:01 GMT'}]",2011-09-13,"[['Wang', 'Cheng', ''], ['Strathman', 'Anthony', ''], ['Lizardo', 'Omar', ''], ['Hachen', 'David', ''], ['Toroczkai', 'Zoltan', ''], ['Chawla', 'Nitesh V.', '']]","['Reciprocity', 'weighted networks', 'balance', 'symmetry', 'assortativity']"
13443,1701.08500,Boris Brimkov,"Boris Brimkov, Caleb C. Fast, Illya V. Hicks",Graphs with Extremal Connected Forcing Numbers,"24 pages, 9 figures",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Zero forcing is an iterative graph coloring process where at each discrete
time step, a colored vertex with a single uncolored neighbor forces that
neighbor to become colored. The zero forcing number of a graph is the
cardinality of the smallest set of initially colored vertices which forces the
entire graph to eventually become colored. Connected forcing is a variant of
zero forcing in which the initially colored set of vertices induces a connected
subgraph; the analogous parameter of interest is the connected forcing number.
In this paper, we characterize the graphs with connected forcing numbers 2 and
$n-2$. Our results extend existing characterizations of graphs with zero
forcing numbers 2 and $n-2$; we use combinatorial and graph theoretic
techniques, in contrast to the linear algebraic approach used to obtain the
latter. We also present several other structural results about the connected
forcing sets of a graph.
","[{'version': 'v1', 'created': 'Mon, 30 Jan 2017 07:13:09 GMT'}]",2017-02-06,"[['Brimkov', 'Boris', ''], ['Fast', 'Caleb C.', ''], ['Hicks', 'Illya V.', '']]","['Connected forcing', 'zero forcing', 'separating set', 'extremal']"
13444,1701.05382,Cynthia Kop,Cynthia Kop and Jakob Grue Simonsen,The Power of Non-Determinism in Higher-Order Implicit Complexity,pre-edition version of a paper accepted for publication at ESOP'17,,,,cs.CC cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the power of non-determinism in purely functional programming
languages with higher-order types. Specifically, we consider cons-free programs
of varying data orders, equipped with explicit non-deterministic choice.
Cons-freeness roughly means that data constructors cannot occur in function
bodies and all manipulation of storage space thus has to happen indirectly
using the call stack.
  While cons-free programs have previously been used by several authors to
characterise complexity classes, the work on non-deterministic programs has
almost exclusively considered programs of data order 0. Previous work has shown
that adding explicit non-determinism to cons-free programs taking data of order
0 does not increase expressivity; we prove that this - dramatically - is not
the case for higher data orders: adding non-determinism to programs with data
order at least 1 allows for a characterisation of the entire class of
elementary-time decidable sets.
  Finally we show how, even with non-deterministic choice, the original
hierarchy of characterisations is restored by imposing different restrictions.
","[{'version': 'v1', 'created': 'Thu, 19 Jan 2017 12:01:51 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Jan 2017 15:37:00 GMT'}]",2017-01-31,"[['Kop', 'Cynthia', ''], ['Simonsen', 'Jakob Grue', '']]","['implicit computational complexity', 'cons-free programming', 'EXPTIME hierarchy', 'non-deterministic programming', 'unitary variables']"
13445,1701.01142,Anastasios Karakostas,"Anastasios Karakostas, Alexia Briassouli, Konstantinos Avgerinakis,
  Ioannis Kompatsiaris, Magda Tsolaki",The Dem@Care Experiments and Datasets: a Technical Report,4pages 2figures,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The objective of Dem@Care is the development of a complete system providing
personal health services to people with dementia, as well as medical
professionals and caregivers, by using a multitude of sensors, for
context-aware, multi-parametric monitoring of lifestyle, ambient environment,
and health parameters. Multi-sensor data analysis, combined with intelligent
decision making mechanisms, will allow an accurate representation of the
person's current status and will provide the appropriate feedback, both to the
person and the associated caregivers, enhancing the standard clinical workflow.
Within the project framework, several data collection activities have taken
place to assist technical development and evaluation tasks. In all these
activities, particular attention has been paid to adhere to ethical guidelines
and preserve the participants' privacy. This technical report describes shorty
the (a) the main objectives of the project, (b) the main ethical principles and
(c) the datasets that have been already created.
","[{'version': 'v1', 'created': 'Sat, 17 Dec 2016 19:43:18 GMT'}]",2017-01-06,"[['Karakostas', 'Anastasios', ''], ['Briassouli', 'Alexia', ''], ['Avgerinakis', 'Konstantinos', ''], ['Kompatsiaris', 'Ioannis', ''], ['Tsolaki', 'Magda', '']]","['Alzheimer', 'Dementia', 'Sensors']"
13446,1704.08803,Mostafa Dehghani,"Mostafa Dehghani, Hamed Zamani, Aliaksei Severyn, Jaap Kamps, W. Bruce
  Croft",Neural Ranking Models with Weak Supervision,"In proceedings of The 40th International ACM SIGIR Conference on
  Research and Development in Information Retrieval (SIGIR2017)",,,,cs.IR cs.CL cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Despite the impressive improvements achieved by unsupervised deep neural
networks in computer vision and NLP tasks, such improvements have not yet been
observed in ranking for information retrieval. The reason may be the complexity
of the ranking problem, as it is not obvious how to learn from queries and
documents when no supervised signal is available. Hence, in this paper, we
propose to train a neural ranking model using weak supervision, where labels
are obtained automatically without human annotators or any external resources
(e.g., click data). To this aim, we use the output of an unsupervised ranking
model, such as BM25, as a weak supervision signal. We further train a set of
simple yet effective ranking models based on feed-forward neural networks. We
study their effectiveness under various learning scenarios (point-wise and
pair-wise models) and using different input representations (i.e., from
encoding query-document pairs into dense/sparse vectors to using word embedding
representation). We train our networks using tens of millions of training
instances and evaluate it on two standard collections: a homogeneous news
collection(Robust) and a heterogeneous large-scale web collection (ClueWeb).
Our experiments indicate that employing proper objective functions and letting
the networks to learn the input representation based on weakly supervised data
leads to impressive performance, with over 13% and 35% MAP improvements over
the BM25 model on the Robust and the ClueWeb collections. Our findings also
suggest that supervised neural ranking models can greatly benefit from
pre-training on large amounts of weakly labeled data that can be easily
obtained from unsupervised IR models.
","[{'version': 'v1', 'created': 'Fri, 28 Apr 2017 04:08:47 GMT'}, {'version': 'v2', 'created': 'Mon, 29 May 2017 11:58:34 GMT'}]",2017-05-30,"[['Dehghani', 'Mostafa', ''], ['Zamani', 'Hamed', ''], ['Severyn', 'Aliaksei', ''], ['Kamps', 'Jaap', ''], ['Croft', 'W. Bruce', '']]","['Ranking model', 'weak supervision', 'deep neural network', 'deep learning', 'ad-hoc retrieval']"
13447,1507.00088,Guillaume Corriveau,"Guillaume Corriveau, Raynald Guilbault, Antoine Tahan, Robert Sabourin","Evaluation of Genotypic Diversity Measurements Exploited in Real-Coded
  Representation",,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Numerous genotypic diversity measures (GDMs) are available in the literature
to assess the convergence status of an evolutionary algorithm (EA) or describe
its search behavior. In a recent study, the authors of this paper drew
attention to the need for a GDM validation framework. In response, this study
proposes three requirements (monotonicity in individual varieties, twinning,
and monotonicity in distance) that can clearly portray any GDMs. These
diversity requirements are analysed by means of controlled population
arrangements. In this paper four GDMs are evaluated with the proposed
validation framework. The results confirm that properly evaluating population
diversity is a rather difficult task, as none of the analysed GDMs complies
with all the diversity requirements.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2015 01:54:43 GMT'}]",2015-07-02,"[['Corriveau', 'Guillaume', ''], ['Guilbault', 'Raynald', ''], ['Tahan', 'Antoine', ''], ['Sabourin', 'Robert', '']]","['Diversity measures', 'evolutionary algorithms', 'premature convergence.   1']"
13448,1502.05094,Melissa O'Neill,"Christopher A. Stone, Melissa E. O'Neill, Sonja A. Bohr, Adam M.
  Cozzette, M. Joe DeBlasio, Julia Matsieva, Stuart A. Pernsteiner, Ari D.
  Schumer",Observationally Cooperative Multithreading,,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite widespread interest in multicore computing, concur- rency models in
mainstream languages often lead to subtle, error-prone code.
  Observationally Cooperative Multithreading (OCM) is a new approach to
shared-memory parallelism. Programmers write code using the well-understood
cooperative (i.e., nonpreemptive) multithreading model for uniprocessors. OCM
then allows threads to run in parallel, so long as results remain consistent
with the cooperative model.
  Programmers benefit because they can reason largely sequentially. Remaining
interthread interactions are far less chaotic than in other models, permitting
easier reasoning and debugging. Programmers can also defer the choice of
concurrency-control mechanism (e.g., locks or transactions) until after they
have written their programs, at which point they can compare
concurrency-control strategies and choose the one that offers the best
performance. Implementers and researchers also benefit from the agnostic nature
of OCM -- it provides a level of abstraction to investigate, compare, and
combine a variety of interesting concurrency-control techniques.
","[{'version': 'v1', 'created': 'Wed, 18 Feb 2015 01:06:43 GMT'}]",2015-02-19,"[['Stone', 'Christopher A.', ''], [""O'Neill"", 'Melissa E.', ''], ['Bohr', 'Sonja A.', ''], ['Cozzette', 'Adam M.', ''], ['DeBlasio', 'M. Joe', ''], ['Matsieva', 'Julia', ''], ['Pernsteiner', 'Stuart A.', ''], ['Schumer', 'Ari D.', '']]","['Observationally cooperative multithreading', 'cooperative multithreading', 'transactional memory', 'lock inference', 'parallel model', 'parallel debugging']"
13449,1209.6297,Pratima Gautam,"Pratima Gautam, Rahul Shukla","An Efficient Algorithm for Mining Multilevel Association Rule Based on
  Pincer Search",,"ijcsi international journal vol-9,issue-4,2012",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Discovering frequent itemset is a key difficulty in significant data mining
applications, such as the discovery of association rules, strong rules,
episodes, and minimal keys. The problem of developing models and algorithms for
multilevel association mining poses for new challenges for mathematics and
computer science. In this paper, we present a model of mining multilevel
association rules which satisfies the different minimum support at each level,
we have employed princer search concepts, multilevel taxonomy and different
minimum supports to find multilevel association rules in a given transaction
data set. This search is used only for maintaining and updating a new data
structure. It is used to prune early candidates that would normally encounter
in the top-down search. A main characteristic of the algorithms is that it does
not require explicit examination of every frequent itemsets, an example is also
given to demonstrate and support that the proposed mining algorithm can derive
the multiple-level association rules under different supports in a simple and
effective manner
","[{'version': 'v1', 'created': 'Thu, 27 Sep 2012 17:29:58 GMT'}]",2012-09-28,"[['Gautam', 'Pratima', ''], ['Shukla', 'Rahul', '']]","['Association rules', 'data mining', 'multilevel']"
13450,0910.1273,Fabien Moutarde,"Taoufik Bdiri (CAOR), Fabien Moutarde (CAOR), Nicolas Bourdis (CAOR),
  Bruno Steux (CAOR)","Adaboost with ""Keypoint Presence Features"" for Real-Time Vehicle Visual
  Detection",,"16th World Congress on Intelligent Transport Systems (ITSwc'2009),
  Su\`ede (2009)",,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present promising results for real-time vehicle visual detection, obtained
with adaBoost using new original ?keypoints presence features?. These
weak-classifiers produce a boolean response based on presence or absence in the
tested image of a ?keypoint? (~ a SURF interest point) with a descriptor
sufficiently similar (i.e. within a given distance) to a reference descriptor
characterizing the feature. A first experiment was conducted on a public image
dataset containing lateral-viewed cars, yielding 95% recall with 95% precision
on test set. Moreover, analysis of the positions of adaBoost-selected keypoints
show that they correspond to a specific part of the object category (such as
?wheel? or ?side skirt?) and thus have a ?semantic? meaning.
","[{'version': 'v1', 'created': 'Wed, 7 Oct 2009 14:26:01 GMT'}]",2009-10-08,"[['Bdiri', 'Taoufik', '', 'CAOR'], ['Moutarde', 'Fabien', '', 'CAOR'], ['Bourdis', 'Nicolas', '', 'CAOR'], ['Steux', 'Bruno', '', 'CAOR']]","['vehicle visual detection', 'image categorization', 'boosting', 'interest points']"
13451,0908.0586,Gene Golovchinsky,Meredith Ringel Morris and Jaime Teevan,"Understanding Groups' Properties as a Means of Improving Collaborative
  Search Systems","Presented at 1st Intl Workshop on Collaborative Information Seeking,
  2008 (arXiv:0908.0583)",,,JCDL2008CIRWS/2008/mortee,cs.IR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding the similar properties of people involved in group search
sessions has the potential to significantly improve collaborative search
systems; such systems could be enhanced by information retrieval algorithms and
user interface modifications that take advantage of important properties, for
example by re-ordering search results using information from group members'
combined user profiles. Understanding what makes group members similar can also
assist with the identification of groups, which can be valuable for connecting
users with others with whom they might undertake a collaborative search. In
this workshop paper, we describe our current research efforts towards studying
the properties of a variety of group types. We discuss properties of groups
that may be relevant to designers of collaborative search systems, and propose
ways in which understanding such properties could influence the design of
interfaces and algorithms for collaborative Web search.
","[{'version': 'v1', 'created': 'Wed, 5 Aug 2009 05:05:03 GMT'}]",2009-08-06,"[['Morris', 'Meredith Ringel', ''], ['Teevan', 'Jaime', '']]","['Collaborative search', 'collaborative information retrieval', 'Web search', 'personalization', 'groupization']"
13452,1304.5991,Shalabh Vidyarthi,Shalabh Vidyarthi and Kaushal K Shukla,"Approximation Algorithms for Vehicle Routing Problems with Stochastic
  Demands on Trees",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the vehicle routing problem with stochastic demands (VRPSD) on
tree structured networks with a single depot. The problem we are concerned with
in this paper is to find a set of tours for the vehicle with minimum expected
length. Every tour begins at the depot, visits a subset of customers and
returns to the depot without violating the capacity constraint. Randomized
approximation algorithm achieving approximation guarantees of 2 for
split-delivery VRPSD, and 3 for un-split delivery VRPSD are obtained.
","[{'version': 'v1', 'created': 'Mon, 22 Apr 2013 15:48:41 GMT'}]",2013-04-23,"[['Vidyarthi', 'Shalabh', ''], ['Shukla', 'Kaushal K', '']]","['Transportation', 'Vehicle Routing', 'Approximation Algorithm']"
13453,1401.3301,Caroline Japhet,"Fran\c{c}ois Cuvelier, Caroline Japhet, Gilles Scarella",An efficient way to assemble finite element matrices in vector languages,,,,,cs.MS cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efficient Matlab codes in 2D and 3D have been proposed recently to assemble
finite element matrices. In this paper we present simple, compact and efficient
vectorized algorithms, which are variants of these codes, in arbitrary
dimension, without the use of any lower level language. They can be easily
implemented in many vector languages (e.g. Matlab, Octave, Python, Scilab, R,
Julia, C++ with STL,...). The principle of these techniques is general, we
present it for the assembly of several finite element matrices in arbitrary
dimension, in the P1 finite element case. We also provide an extension of the
algorithms to the case of a system of PDE's. Then we give an extension to
piecewise polynomials of higher order. We compare numerically the performance
of these algorithms in Matlab, Octave and Python, with that in FreeFEM++ and in
a compiled language such as C. Examples show that, unlike what is commonly
believed, the performance is not radically worse than that of C : in the
best/worst cases, selected vector languages are respectively 2.3/3.5 and
2.9/4.1 times slower than C in the scalar and vector cases. We also present
numerical results which illustrate the computational costs of these algorithms
compared to standard algorithms and to other recent ones.
","[{'version': 'v1', 'created': 'Tue, 14 Jan 2014 19:36:39 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Jun 2015 09:17:43 GMT'}]",2015-06-22,"[['Cuvelier', 'François', ''], ['Japhet', 'Caroline', ''], ['Scarella', 'Gilles', '']]","['finite elements', 'matrix assembly', 'vectorization', 'vector languages', 'Matlab', 'Octave', 'Python']"
13454,1312.5692,Robert V. Mayer,Robert V Mayer,"Multi-component model of learning and its use for research didactic
  system","5 pages, 2 figures, on russian",Fundamental research 2013 10 part 11 pp. 2524 - 2528,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In computer simulation of the learning process is usually assumed that all
elements of the training material are assimilated equally durable. But in
practice, the knowledge, which a student uses in its operations, are remembered
much better. For a more precise study of didactic systems the multi component
model of learning are proposed. It takes into account: 1) the transition of
weak knowledge in trustworthy knowledge; 2) the difference in the rate of
forgetting the trustworthy and weak knowledge. It is assumed that the rate of
increase of student's knowledge is proportional to: 1) the difference between
the level of the requirements of teachers and the number of learned knowledge;
2) the amount of learned knowledge, raised to some power. Examples of the use
of a multi component model for the study of situations in the learning process
are considered, the resulting graphs of the student's level of knowledge of the
time are presented. A generalized model of learning, which allows to take into
account the complexity of the various elements of the educational material are
proposed. The possibility of creating a training program for the training of
students of pedagogical institutes are considered.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2013 14:25:20 GMT'}]",2013-12-20,"[['Mayer', 'Robert V', '']]","['didactic', 'information-cybernetic approach', 'computer modeling of the learning process']"
13455,1705.08720,Bertrand Lebichot,Bertrand Lebichot and Marco Saerens,A Bag-of-Paths Node Criticality Measure,,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work compares several node (and network) criticality measures
quantifying to which extend each node is critical with respect to the
communication flow between nodes of the network, and introduces a new measure
based on the Bag-of-Paths (BoP) framework. Network disconnection simulation
experiments show that the new BoP measure outperforms all the other measures on
a sample of Erdos-Renyi and Albert-Barabasi graphs. Furthermore, a faster
(still O(n^3)), approximate, BoP criticality relying on the Sherman-Morrison
rank-one update of a matrix is introduced for tackling larger networks. This
approximate measure shows similar performances as the original, exact, one.
","[{'version': 'v1', 'created': 'Wed, 24 May 2017 12:22:53 GMT'}]",2017-05-25,"[['Lebichot', 'Bertrand', ''], ['Saerens', 'Marco', '']]","['Criticality measure', 'network vulnerability', 'vital nodes', 'graphmining', 'network science', 'graph and network analysis', 'betweennesscentrality']"
13456,1602.07573,Jun Chen,"Fuhao Chen, Jun Chen, Feng Huang","A straightforward method to assess motion blur for different types of
  displays","22 pages, 9 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A simulation method based on the liquid crystal response and the human visual
system is suitable to characterize motion blur for LCDs but not other display
types. We propose a more straightforward and widely applicable method to
quantify motion blur based on the width of the moving object. We thus compare
various types of displays objectively. A perceptual experiment was conducted to
validate the proposed method. We test varying motion velocities for nine
commercial displays. We compare the three motion blur evaluation methods
(simulation, human perception, and our method) using z-scores. Our comparisons
indicate that our method accurately characterizes motion blur for various
display types.
","[{'version': 'v1', 'created': 'Sat, 8 Aug 2015 11:08:11 GMT'}]",2016-02-25,"[['Chen', 'Fuhao', ''], ['Chen', 'Jun', ''], ['Huang', 'Feng', '']]","['Liquid-crystal display (LCD)', 'motion blur', 'blurred edge width', 'blurred edge time', 'liquid crystal']"
13457,1606.05934,Qiuyan Yan,Qiuyan Yan and Qifa Sun and Xinming Yan,"Adapting ELM to Time Series Classification: A Novel Diversified Top-k
  Shapelets Extraction Method",,,,,cs.LG,http://creativecommons.org/publicdomain/zero/1.0/,"  ELM (Extreme Learning Machine) is a single hidden layer feed-forward network,
where the weights between input and hidden layer are initialized randomly. ELM
is efficient due to its utilization of the analytical approach to compute
weights between hidden and output layer. However, ELM still fails to output the
semantic classification outcome. To address such limitation, in this paper, we
propose a diversified top-k shapelets transform framework, where the shapelets
are the subsequences i.e., the best representative and interpretative features
of each class. As we identified, the most challenge problems are how to extract
the best k shapelets in original candidate sets and how to automatically
determine the k value. Specifically, we first define the similar shapelets and
diversified top-k shapelets to construct diversity shapelets graph. Then, a
novel diversity graph based top-k shapelets extraction algorithm named as
\textbf{DivTopkshapelets}\ is proposed to search top-k diversified shapelets.
Finally, we propose a shapelets transformed ELM algorithm named as
\textbf{DivShapELM} to automatically determine the k value, which is further
utilized for time series classification. The experimental results over public
data sets demonstrate that the proposed approach significantly outperforms
traditional ELM algorithm in terms of effectiveness and efficiency.
","[{'version': 'v1', 'created': 'Mon, 20 Jun 2016 00:59:11 GMT'}]",2016-06-21,"[['Yan', 'Qiuyan', ''], ['Sun', 'Qifa', ''], ['Yan', 'Xinming', '']]","['extreme learning machine', 'shapelets transformed classification', 'diversified query', 'feature extraction']"
13458,1501.00014,Rama  Cont,Rama Cont and Massoud Heidari,Optimal rounding under integer constraints,,,,,cs.DS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given real numbers whose sum is an integer, we study the problem of finding
integers which match these real numbers as closely as possible, in the sense of
L^p norm, while preserving the sum. We describe the structure of solutions for
this integer optimization problem and propose an algorithm with complexity O(N
log N) for solving it. In contrast to fractional rounding and randomized
rounding, which yield biased estimators of the solution when applied to this
problem, our method yields an exact solution which minimizes the relative
rounding error across the set of all solutions for any value of p greater than
1, while avoiding the complexity of exhaustive search. The proposed algorithm
also solves a class of integer optimization problems with integer constraints
and may be used as the rounding step of relaxed integer programming problems,
for rounding real-valued solutions. We give several examples of applications
for the proposed algorithm.
","[{'version': 'v1', 'created': 'Tue, 30 Dec 2014 21:01:08 GMT'}]",2015-01-05,"[['Cont', 'Rama', ''], ['Heidari', 'Massoud', '']]","['integer optimization', 'optimal rounding', 'randomized rounding', 'rounding heuristic', 'Apportionment problem', 'quota methods']"
13459,1402.6809,Arindam Pal,Sushmita Ruj and Arindam Pal,"Analyzing Cascading Failures in Smart Grids under Random and Targeted
  Attacks","Accepted for publication in 28th IEEE International Conference on
  Advanced Information Networking and Applications (AINA) 2014",,,,cs.SI cs.DM cs.NI math.CO physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We model smart grids as complex interdependent networks, and study targeted
attacks on smart grids for the first time. A smart grid consists of two
networks: the power network and the communication network, interconnected by
edges. Occurrence of failures (attacks) in one network triggers failures in the
other network, and propagates in cascades across the networks. Such cascading
failures can result in disintegration of either (or both) of the networks.
Earlier works considered only random failures. In practical situations, an
attacker is more likely to compromise nodes selectively.
  We study cascading failures in smart grids, where an attacker selectively
compromises the nodes with probabilities proportional to their degrees; high
degree nodes are compromised with higher probability. We mathematically analyze
the sizes of the giant components of the networks under targeted attacks, and
compare the results with the corresponding sizes under random attacks. We show
that networks disintegrate faster for targeted attacks compared to random
attacks. A targeted attack on a small fraction of high degree nodes
disintegrates one or both of the networks, whereas both the networks contain
giant components for random attack on the same fraction of nodes.
","[{'version': 'v1', 'created': 'Thu, 27 Feb 2014 07:17:55 GMT'}]",2015-02-19,"[['Ruj', 'Sushmita', ''], ['Pal', 'Arindam', '']]","['Complex networks', 'Percolation theory', 'Smartgrids', 'Cascading failures', 'Random and targeted attacks']"
13460,1702.03534,Barun Gorain,Barun Gorain and Andrzej Pelc,Leader Election in Trees with Customized Advice,,,,,cs.DC cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Leader election is a basic symmetry breaking problem in distributed
computing. All nodes of a network have to agree on a single node, called the
leader. If the nodes of the network have distinct labels, then agreeing on a
single node means that all nodes have to output the label of the elected
leader.
  If the nodes are anonymous, the task of leader election is formulated as
follows: every node of the network must output a simple path starting at it,
which is coded as a sequence of port numbers, such that all these paths end at
a common node, the leader. In this paper, we study deterministic leader
election in anonymous trees.
  Our goal is to establish tradeoffs between the allocated time $\tau$ and the
amount of information that has to be given {\em a priori} to the nodes of a
network to enable leader election in time $\tau$. Following the framework of
{\em algorithms with advice}, this information is provided to all nodes at the
start by an oracle knowing the entire tree, in form of binary strings assigned
to all nodes. There are two possible variants of formulating this advice
assignment. Either the strings provided to all nodes are identical, or strings
assigned to different nodes may be potentially different, i.e., advice can be
{\em customized}. As opposed to previous papers on leader election with advice,
in this paper we consider the latter option.
  The maximum length of all assigned binary strings is called the {\em size of
advice}.
  For a given time $\tau$ allocated to leader election, we give upper and lower
bounds on the minimum size of advice sufficient to perform leader election in
time $\tau$. All our bounds except one pair are tight up to multiplicative
constants, and in this one exceptional case, the gap between the upper and the
lower bound is very small.
","[{'version': 'v1', 'created': 'Sun, 12 Feb 2017 15:46:24 GMT'}]",2017-02-20,"[['Gorain', 'Barun', ''], ['Pelc', 'Andrzej', '']]","['leader election', 'tree', 'advice', 'deterministic distributed algorithm', 'time']"
13461,1407.0697,Anuradha Rana,"Anuradha Rana, Pratima Sharma",How to Track Online SLA,,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  SLA (Service level agreement) is defined by an organization to fulfil its
client requirements, the time within which the deliverables should be turned
over to the clients. Tracking of SLA can be done manually by checking the
status, priority of any particular task. Manual SLA tracking takes time as one
has to go over each and every task that needs to be completed. For instance,
you ordered a product from a website and you are not happy with the quality of
the product and want to replace the same on urgent basis, You send mail to the
customer support department, the query/complaint will be submitted in a queue
and will be processed basis of its priority and urgency (The SLA for responding
back to customers concern are listed in the policy). This online SLA tracking
system will ensure that no queries/complaints are missed and are processed in
an organized manner as per their priority and the date by when it should be
handled. The portal will provide the status of the complaints for that
particular day and the ones which have been pending since last week. The
information can be refreshed as per the client need (within what time frame the
complaint should be addressed).
","[{'version': 'v1', 'created': 'Wed, 2 Jul 2014 16:37:18 GMT'}]",2014-07-04,"[['Rana', 'Anuradha', ''], ['Sharma', 'Pratima', '']]","['SLAtracking', 'Priority', 'Request', 'Complaint', 'Scheduling', 'Resource', 'Quality']"
13462,1609.05268,Takayuki Itoh,"Takayuki Itoh, Ashnil Kumar, Karsten Klein, Jinman Kim","High-Dimensional Data Visualization by Interactive Construction of
  Low-Dimensional Parallel Coordinate Plots",,,,,cs.HC cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parallel coordinate plots (PCPs) are among the most useful techniques for the
visualization and exploration of high-dimensional data spaces. They are
especially useful for the representation of correlations among the dimensions,
which identify relationships and interdependencies between variables. However,
within these high-dimensional spaces, PCPs face difficulties in displaying the
correlation between combinations of dimensions and generally require additional
display space as the number of dimensions increases. In this paper, we present
a new technique for high-dimensional data visualization in which a set of
low-dimensional PCPs are interactively constructed by sampling user-selected
subsets of the high-dimensional data space. In our technique, we first
construct a graph visualization of sets of well-correlated dimensions. Users
observe this graph and are able to interactively select the dimensions by
sampling from its cliques, thereby dynamically specifying the most relevant
lower dimensional data to be used for the construction of focused PCPs. Our
interactive sampling overcomes the shortcomings of the PCPs by enabling the
visualization of the most meaningful dimensions (i.e., the most relevant
information) from high-dimensional spaces. We demonstrate the effectiveness of
our technique through two case studies, where we show that the proposed
interactive low-dimensional space constructions were pivotal for visualizing
the high-dimensional data and discovering new patterns.
","[{'version': 'v1', 'created': 'Sat, 17 Sep 2016 01:45:11 GMT'}]",2016-09-20,"[['Itoh', 'Takayuki', ''], ['Kumar', 'Ashnil', ''], ['Klein', 'Karsten', ''], ['Kim', 'Jinman', '']]","['visualization', 'high-dimensional data', 'parallel coordinate plots']"
13463,1502.04205,Valery Ugrinovskii,"Yi Cheng, V. Ugrinovskii","Leader-follower Tracking Control with Guaranteed Consensus Performance
  for Interconnected Systems with Linear Dynamic Uncertain Coupling",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the leader-follower tracking control problem for linear
interconnected systems with undirected topology and linear dynamic coupling.
Interactions between the systems are treated as linear dynamic uncertainty and
are described in terms of integral quadratic constraints (IQCs). A
consensus-type tracking control protocol is proposed for each system based on
its state relative its neighbors. In addition a selected set of subsystems uses
for control their relative states with respect to the leader. Two methods are
proposed for the design of this control protocol. One method uses a coordinate
transformation to recast the protocol design problem as a decentralized robust
control problem for an auxiliary interconnected large scale system. Another
method is direct, it does not employ coordinate transformation; it also allows
for more general linear uncertain interactions. Using these methods, sufficient
conditions are obtained which guarantee that the system tracks the leader.
These conditions guarantee a suboptimal bound on the system consensus and
tracking performance. The proposed methods are compared using a simulation
example, and their effectiveness is discussed. Also, algorithms are proposed
for computing suboptimal controllers.
","[{'version': 'v1', 'created': 'Sat, 14 Feb 2015 12:51:50 GMT'}]",2015-02-17,"[['Cheng', 'Yi', ''], ['Ugrinovskii', 'V.', '']]","['Large-scale systems', 'robust distributed control', 'leaderfollower tracking control', 'consensus control', 'integral quadratic constraints']"
13464,1603.04422,Hossein Sartipizadeh,Hossein Sartipizadeh and Tyrone L. Vincent,Computing the Approximate Convex Hull in High Dimensions,"5 pages, 1 figure, The more detailed version will be submitted",,,,cs.CG math.MG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, an effective method with time complexity of
$\mathcal{O}(K^{3/2}N^2\log \frac{K}{\epsilon_0})$ is introduced to find an
approximation of the convex hull for $N$ points in dimension $n$, where $K$ is
close to the number of vertices of the approximation. Since the time complexity
is independent of dimension, this method is highly suitable for the data in
high dimensions. Utilizing a greedy approach, the proposed method attempts to
find the best approximate convex hull for a given number of vertices. The
approximate convex hull can be a helpful substitute for the exact convex hull
for on-line processes and applications that have a favorable trade off between
accuracy and parsimony.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2016 22:20:02 GMT'}]",2016-03-15,"[['Sartipizadeh', 'Hossein', ''], ['Vincent', 'Tyrone L.', '']]","['Convex hull', 'Approximate convex hull', 'High dimensions', 'Greedy algorithms']"
13465,1401.1123,Nicolas Galichet,"Nicolas Galichet (LRI, INRIA Saclay - Ile de France), Mich\`ele Sebag
  (LRI, INRIA Saclay - Ile de France), Olivier Teytaud (LRI, INRIA Saclay - Ile
  de France)",Exploration vs Exploitation vs Safety: Risk-averse Multi-Armed Bandits,16 pages,"Asian Conference on Machine Learning 2013, Canberra : Australia
  (2013)",,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by applications in energy management, this paper presents the
Multi-Armed Risk-Aware Bandit (MARAB) algorithm. With the goal of limiting the
exploration of risky arms, MARAB takes as arm quality its conditional value at
risk. When the user-supplied risk level goes to 0, the arm quality tends toward
the essential infimum of the arm distribution density, and MARAB tends toward
the MIN multi-armed bandit algorithm, aimed at the arm with maximal minimal
value. As a first contribution, this paper presents a theoretical analysis of
the MIN algorithm under mild assumptions, establishing its robustness
comparatively to UCB. The analysis is supported by extensive experimental
validation of MIN and MARAB compared to UCB and state-of-art risk-aware MAB
algorithms on artificial and real-world problems.
","[{'version': 'v1', 'created': 'Mon, 6 Jan 2014 15:53:25 GMT'}]",2014-01-07,"[['Galichet', 'Nicolas', '', 'LRI, INRIA Saclay - Ile de France'], ['Sebag', 'Michèle', '', 'LRI, INRIA Saclay - Ile de France'], ['Teytaud', 'Olivier', '', 'LRI, INRIA Saclay - Ile\n  de France']]","['Multi-armed bandits', 'Risk awareness', 'Risk aversion', 'Conditional Value atRisk', 'Max-min', 'Energy policy']"
13466,1510.05942,Anna Mikhailovich,"Vadim V. Kochergin, Anna V. Mikhailovich",Inversion Complexity of Functions of Multi-Valued Logic,11 pages,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The minimum number of NOT gates in a logic circuit computing a Boolean
function is called the inversion complexity of the function. In 1957, A. A.
Markov determined the inversion complexity of every Boolean function and proved
that $\lceil\log_{2}(d(f)+1)\rceil$ NOT gates are necessary and sufficient to
compute any Boolean function $f$ (where $d(f)$ is the maximum number of value
changes from greater to smaller over all increasing chains of tuples of
variables values). This result is extended to $k$-valued functions computing in
this paper. Thereupon one can use monotone functions ""for free"" like in the
Boolean case. It is shown that the minimum sufficient number of non-monotone
gates for the realization of the arbitrary $k$-valued logic function $f$ is
equal to $\lceil\log_{2}(d(f)+1)\rceil$ if Post negation (function $x+1
\pmod{k}$) is used in NOT nodes and is also equal to
$\lceil\log_{k}(d(f)+1)\rceil$, if {\L}ukasiewicz negation (function $k-1-x$)
is used in NOT nodes. Similar extension for another classical result of A. A.
Markov for the inversion complexity of a system of Boolean functions to
$k$-valued logic functions has been obtained.
","[{'version': 'v1', 'created': 'Tue, 20 Oct 2015 16:09:06 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Oct 2015 22:28:09 GMT'}]",2015-11-02,"[['Kochergin', 'Vadim V.', ''], ['Mikhailovich', 'Anna V.', '']]","['multi-valued logic functions', 'logic circuits', 'circuit complexity', 'nonmonotone complexity', 'inversion complexity', 'Markov’s theorem']"
13467,1511.03979,Patrick McClure,"Patrick McClure, Nikolaus Kriegeskorte",Representational Distance Learning for Deep Neural Networks,,,,,cs.NE cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks (DNNs) provide useful models of visual representational
transformations. We present a method that enables a DNN (student) to learn from
the internal representational spaces of a reference model (teacher), which
could be another DNN or, in the future, a biological brain. Representational
spaces of the student and the teacher are characterized by representational
distance matrices (RDMs). We propose representational distance learning (RDL),
a stochastic gradient descent method that drives the RDMs of the student to
approximate the RDMs of the teacher. We demonstrate that RDL is competitive
with other transfer learning techniques for two publicly available benchmark
computer vision datasets (MNIST and CIFAR-100), while allowing for
architectural differences between student and teacher. By pulling the student's
RDMs towards those of the teacher, RDL significantly improved visual
classification performance when compared to baseline networks that did not use
transfer learning. In the future, RDL may enable combined supervised training
of deep neural networks using task constraints (e.g. images and category
labels) and constraints from brain-activity measurements, so as to build models
that replicate the internal representational spaces of biological brains.
","[{'version': 'v1', 'created': 'Thu, 12 Nov 2015 17:35:03 GMT'}, {'version': 'v2', 'created': 'Sun, 15 Nov 2015 13:58:48 GMT'}, {'version': 'v3', 'created': 'Wed, 18 Nov 2015 17:19:03 GMT'}, {'version': 'v4', 'created': 'Thu, 26 Nov 2015 17:10:25 GMT'}, {'version': 'v5', 'created': 'Fri, 4 Dec 2015 20:45:15 GMT'}, {'version': 'v6', 'created': 'Mon, 7 Nov 2016 18:37:05 GMT'}]",2019-09-19,"[['McClure', 'Patrick', ''], ['Kriegeskorte', 'Nikolaus', '']]","['neural networks', 'transfer learning', 'distance matrices', 'visual perception', 'computational neuroscience']"
13468,1401.7436,Rahim Rahmani,"Rahim Rahmani, Hasibur Rahman and Theo Kanter",On Performance of Logical-Clustering Of Flow-Sensors,"13 pages, 15 Figures and published on International Journal of
  Computer Science Issues, IJCSI Volume 10 Issue 5, September 2013",,,,cs.NI cs.DC,http://creativecommons.org/licenses/publicdomain/,"  In state-of-the-art Pervasive Computing, it is envisioned that unlimited
access to information will be facilitated for anyone and anything. Wireless
sensor networks will play a pivotal role in the stated vision. This reflects
the phenomena where any situation can be sensed and analyzed anywhere. It makes
heterogeneous context ubiquitous. Clustering context is one of the techniques
to manage ubiquitous context information efficiently to maximize its potential.
Logical-clustering is useful to share real-time context where sensors are
physically distributed but logically clustered. This paper investigates the
network performance of logical-clustering based on ns-3 simulations. In
particular reliability, scalability, and reachability in terms of delay,
jitter, and packet loss for the logically clustered network have been
investigated. The performance study shows that jitter demonstrates 40 % and 44
% fluctuation for 200 % increase in the node per cluster and 100 % increase in
the cluster size respectively. Packet loss exhibits only 18 % increase for 83 %
increase in the packet flow-rate.
","[{'version': 'v1', 'created': 'Wed, 29 Jan 2014 09:00:31 GMT'}]",2014-01-30,"[['Rahmani', 'Rahim', ''], ['Rahman', 'Hasibur', ''], ['Kanter', 'Theo', '']]","['Pervasive Computing', 'Wireless sensor networks', 'ubiquitous', 'context', 'distributed', 'logical-clustering', 'ns-3']"
13469,1702.02737,Xuan-Son Vu,"Xuan-Son Vu, Seong-Bae Park","Mining User/Movie Preferred Features Based on Reviews for Video
  Recommendation System","The 2nd Workshop on Future Researches of Computer Science and
  Engineering, Kyungpook National University, pp. 21-24, 2014",,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we present an approach for mining user preferences and
recommendation based on reviews. There have been various studies worked on
recommendation problem. However, most of the studies beyond one aspect user
generated- content such as user ratings, user feedback and so on to state user
preferences. There is a prob- lem in one aspect mining is lacking for stating
user preferences. As a demonstration, in collaborative filter recommendation,
we try to figure out the preference trend of crowded users, then use that trend
to predict current user preference. Therefore, there is a gap between real user
preferences and the trend of the crowded people. Additionally, user preferences
can be addressed from mining user reviews since user often comment about
various aspects of products. To solve this problem, we mainly focus on mining
product aspects and user aspects inside user reviews to directly state user
preferences. We also take into account Social Network Analysis for cold-start
item problem. With cold-start user problem, collaborative filter algorithm is
employed in our work. The framework is general enough to be applied to
different recommendation domains. Theoretically, our method would achieve a
significant enhancement.
","[{'version': 'v1', 'created': 'Thu, 9 Feb 2017 08:03:16 GMT'}]",2017-02-10,"[['Vu', 'Xuan-Son', ''], ['Park', 'Seong-Bae', '']]","['Opinion Mining', 'Sentiment AspectAnalysis', 'System Recommendation']"
13470,1105.1186,Sertac Karaman,Sertac Karaman and Emilio Frazzoli,Sampling-based Algorithms for Optimal Motion Planning,"76 pages, 26 figures, to appear in International Journal of Robotics
  Research",,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During the last decade, sampling-based path planning algorithms, such as
Probabilistic RoadMaps (PRM) and Rapidly-exploring Random Trees (RRT), have
been shown to work well in practice and possess theoretical guarantees such as
probabilistic completeness. However, little effort has been devoted to the
formal analysis of the quality of the solution returned by such algorithms,
e.g., as a function of the number of samples. The purpose of this paper is to
fill this gap, by rigorously analyzing the asymptotic behavior of the cost of
the solution returned by stochastic sampling-based algorithms as the number of
samples increases. A number of negative results are provided, characterizing
existing algorithms, e.g., showing that, under mild technical conditions, the
cost of the solution returned by broadly used sampling-based algorithms
converges almost surely to a non-optimal value. The main contribution of the
paper is the introduction of new algorithms, namely, PRM* and RRT*, which are
provably asymptotically optimal, i.e., such that the cost of the returned
solution converges almost surely to the optimum. Moreover, it is shown that the
computational complexity of the new algorithms is within a constant factor of
that of their probabilistically complete (but not asymptotically optimal)
counterparts. The analysis in this paper hinges on novel connections between
stochastic sampling-based path planning algorithms and the theory of random
geometric graphs.
","[{'version': 'v1', 'created': 'Thu, 5 May 2011 22:25:22 GMT'}]",2011-05-09,"[['Karaman', 'Sertac', ''], ['Frazzoli', 'Emilio', '']]","['Motion planning', 'optimal path planning', 'sampling-based algorithms', 'random geometric graphs']"
13471,1511.00050,Victor Solovyev,Victor Solovyev and Ramzan Umarov,"FendOff encryption software to secure personal information on computers
  and mobile devices","7 pages, 9 figures, 1 table",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper describes several original cryptographic cipher modules (VSEM) that
are based on using one time pseudorandom pad and pseudorandom transpositions.
The VSEM includes 4 modules of encryption that can be applied in combinations.
We studied ability of these modules to secure the private data against attacks
and their speed of encryption. The VSEM encryption was implemented in Fendoff
applications for mobile devices on iOS and Android platforms as well as in
computer application running Window or Mac OS. We describe these applications
designed to encrypt/decrypt various personal data such as passwords, credit
card or bank information as well as to secure content of any text or image
files.
","[{'version': 'v1', 'created': 'Sat, 31 Oct 2015 00:22:00 GMT'}]",2015-11-03,"[['Solovyev', 'Victor', ''], ['Umarov', 'Ramzan', '']]","['Encryption', 'Random pad', 'Ciphers', 'Mobile device applications', 'Personal information', 'Cryptography']"
13472,1004.0766,Ayatullah Faruk Mollah,"Ayatullah Faruk Mollah, Subhadip Basu, Mita Nasipuri, Dipak Kumar Basu",Text/Graphics Separation for Business Card Images for Mobile Devices,"Proc. IAPR International Workshop on Graphics Recognition (2009)
  263-270",,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Separation of the text regions from background texture and graphics is an
important step of any optical character recognition sytem for the images
containg both texts and graphics. In this paper, we have presented a novel
text/graphics separation technique for business card images captured with a
cell-phone camera. At first, the background is eliminated at a coarse level
based on intensity variance. This makes the foreground components distinct from
each other. Then the non-text components are removed using various
characteristic features of text and graphics. Finally, the text regions are
skew corrected and binarized for further processing. Experimenting with
business card images of various resolutions, we have found an optimum
performance of 98.54% with 0.75 MP images, that takes 0.17 seconds processing
time and 1.1 MB peak memory on a moderately powerful computer (DualCore 1.73
GHz Processor, 1 GB RAM, 1 MB L2 Cache). The developed technique is
computationally efficient and consumes low memory so as to be applicable on
mobile devices.
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2010 03:54:27 GMT'}]",2010-04-07,"[['Mollah', 'Ayatullah Faruk', ''], ['Basu', 'Subhadip', ''], ['Nasipuri', 'Mita', ''], ['Basu', 'Dipak Kumar', '']]","['Text/Graphics Separation', 'Business Card Reader', 'Skew Angle Estimation', 'Mobile Computing']"
13473,0909.4412,Mohamed El-Zawawy,"Mohamed E. El-Sharkawi, Mohamed A. El-Zawawy",Algorithm for Spatial Clustering with Obstacles,"In Proc. 2002 ICICIS Int. Conference on Intelligent Computing and
  Information Systems (ICICIS02), Cairo, Egypt, June 2002",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose an efficient clustering technique to solve the
problem of clustering in the presence of obstacles. The proposed algorithm
divides the spatial area into rectangular cells. Each cell is associated with
statistical information that enables us to label the cell as dense or
non-dense. We also label each cell as obstructed (i.e. intersects any obstacle)
or non-obstructed. Then the algorithm finds the regions (clusters) of
connected, dense, non-obstructed cells. Finally, the algorithm finds a center
for each such region and returns those centers as centers of the relatively
dense regions (clusters) in the spatial area.
","[{'version': 'v1', 'created': 'Thu, 24 Sep 2009 11:09:15 GMT'}]",2009-09-25,"[['El-Sharkawi', 'Mohamed E.', ''], ['El-Zawawy', 'Mohamed A.', '']]","['Spatial Databases', 'Data Mining', 'Clustering', 'Complexity of Algorithms']"
13474,1505.03819,George Teodoro,"George Teodoro, Tahsin Kurc, Guilherme Andrade, Jun Kong, Renato
  Ferreira, Joel Saltz","Performance Analysis and Efficient Execution on Systems with multi-core
  CPUs, GPUs and MICs","22 pages, 12 figures, 6 tables",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We carry out a comparative performance study of multi-core CPUs, GPUs and
Intel Xeon Phi (Many Integrated Core - MIC) with a microscopy image analysis
application. We experimentally evaluate the performance of computing devices on
core operations of the application. We correlate the observed performance with
the characteristics of computing devices and data access patterns, computation
complexities, and parallelization forms of the operations. The results show a
significant variability in the performance of operations with respect to the
device used. The performances of operations with regular data access are
comparable or sometimes better on a MIC than that on a GPU. GPUs are more
efficient than MICs for operations that access data irregularly, because of the
lower bandwidth of the MIC for random data accesses. We propose new
performance-aware scheduling strategies that consider variabilities in
operation speedups. Our scheduling strategies significantly improve application
performance compared to classic strategies in hybrid configurations.
","[{'version': 'v1', 'created': 'Thu, 14 May 2015 18:03:21 GMT'}]",2015-05-15,"[['Teodoro', 'George', ''], ['Kurc', 'Tahsin', ''], ['Andrade', 'Guilherme', ''], ['Kong', 'Jun', ''], ['Ferreira', 'Renato', ''], ['Saltz', 'Joel', '']]","['Hybrid Systems', 'GPGPU', 'Intel Xeon Phi', 'Cooperative Execution', 'Image Analysis']"
13475,1403.1486,Giannis Haralabopoulos,"Giannis Haralabopoulos, Ioannis Anagnostopoulos","Lifespan and propagation of information in On-line Social Networks a
  Case Study","32 Pages, 13 Figures, 6 Tables",,,,cs.SI cs.IR physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since 1950, information flows have been in the centre of scientific research.
Up until internet penetration in the late 90s, these studies were based over
traditional offline social networks. Several observations in offline
information flows studies, such as two-step flow of communication and the
importance of weak ties, were verified in several online studies, showing that
the diffused information flows from one Online Social Network (OSN) to several
others. Within that flow, information is shared to and reproduced by the users
of each network. Furthermore, the original content is enhanced or weakened
according to its topic, the dynamic and exposure of each OSNs. In such a
concept, each OSN is considered a layer of information flows that interacts
with each other. In this paper, we examine such flows in several social
networks, as well as their diffusion and lifespan across multiple OSNs, in
terms of user-generated content. Our results verify the perception of content
and information connection in various OSNs.
","[{'version': 'v1', 'created': 'Thu, 6 Mar 2014 16:43:16 GMT'}]",2014-03-07,"[['Haralabopoulos', 'Giannis', ''], ['Anagnostopoulos', 'Ioannis', '']]","['Virality', 'Online Social Networks', 'Information flows', 'Reddit']"
13476,1307.2380,Sena Seneviratne S R,"Sena Seneviratne, David C. Levy and Rajkumar Buyya","A Taxonomy of Performance Prediction Systems in the Parallel and
  Distributed Computing Grids","35 pages,4 figures,2 tables",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As Grids are loosely-coupled congregations of geographically distributed
heterogeneous resources, the efficient utilization of the resources requires
the support of a sound Performance Prediction System (PPS). The performance
prediction of grid resources is helpful for both Resource Management Systems
and grid users to make optimized resource usage decisions. There have been many
PPS projects that span over several grid resources in several dimensions. In
this paper the taxonomy for describing the PPS architecture is discussed. The
taxonomy is used to categorize and identify approaches which are followed in
the implementation of the existing PPSs for Grids. The taxonomy and the survey
results are used to identify approaches and issues that have not been fully
explored in research.
","[{'version': 'v1', 'created': 'Tue, 9 Jul 2013 09:34:25 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Jul 2013 08:52:42 GMT'}]",2013-07-15,"[['Seneviratne', 'Sena', ''], ['Levy', 'David C.', ''], ['Buyya', 'Rajkumar', '']]","['Performance Prediction System', 'Data mining', 'Cluster Computing', 'Grid Computing', 'Resource Management Systems']"
13477,1009.4976,S. M. Kamruzzaman,"S. M. Kamruzzaman, Farhana Haider, and Ahmed Ryadh Hasan","Text Classification using Association Rule with a Hybrid Concept of
  Naive Bayes Classifier and Genetic Algorithm","6 Pages, International Conference","Proc. 7th International Conference on Computer and Information
  Technology (ICCIT-2004), Dhaka, Bangladesh, pp. 682-687, Dec. 2004",,,cs.IR cs.DB cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Text classification is the automated assignment of natural language texts to
predefined categories based on their content. Text classification is the
primary requirement of text retrieval systems, which retrieve texts in response
to a user query, and text understanding systems, which transform text in some
way such as producing summaries, answering questions or extracting data. Now a
day the demand of text classification is increasing tremendously. Keeping this
demand into consideration, new and updated techniques are being developed for
the purpose of automated text classification. This paper presents a new
algorithm for text classification. Instead of using words, word relation i.e.
association rules is used to derive feature set from pre-classified text
documents. The concept of Naive Bayes Classifier is then used on derived
features and finally a concept of Genetic Algorithm has been added for final
classification. A system based on the proposed algorithm has been implemented
and tested. The experimental results show that the proposed system works as a
successful text classifier.
","[{'version': 'v1', 'created': 'Sat, 25 Sep 2010 06:10:33 GMT'}]",2010-09-28,"[['Kamruzzaman', 'S. M.', ''], ['Haider', 'Farhana', ''], ['Hasan', 'Ahmed Ryadh', '']]","['Text classification', 'Association rule', 'Apriori algorithm', 'confidence', 'support', 'frequent itemsets', 'Naive Bayes classifier', 'Genetic Algorithm']"
13478,1504.05809,Xianbiao Qi,"Xianbiao Qi, Guoying Zhao, Linlin Shen, Qingquan Li, Matti Pietikainen","LOAD: Local Orientation Adaptive Descriptor for Texture and Material
  Classification","13 pages, 7 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel local feature, called Local Orientation
Adaptive Descriptor (LOAD), to capture regional texture in an image. In LOAD,
we proposed to define point description on an Adaptive Coordinate System (ACS),
adopt a binary sequence descriptor to capture relationships between one point
and its neighbors and use multi-scale strategy to enhance the discriminative
power of the descriptor. The proposed LOAD enjoys not only discriminative power
to capture the texture information, but also has strong robustness to
illumination variation and image rotation. Extensive experiments on benchmark
data sets of texture classification and real-world material recognition show
that the proposed LOAD yields the state-of-the-art performance. It is worth to
mention that we achieve a 65.4\% classification accuracy-- which is, to the
best of our knowledge, the highest record by far --on Flickr Material Database
by using a single feature. Moreover, by combining LOAD with the feature
extracted by Convolutional Neural Networks (CNN), we obtain significantly
better performance than both the LOAD and CNN. This result confirms that the
LOAD is complementary to the learning-based features.
","[{'version': 'v1', 'created': 'Wed, 22 Apr 2015 13:59:49 GMT'}]",2015-04-23,"[['Qi', 'Xianbiao', ''], ['Zhao', 'Guoying', ''], ['Shen', 'Linlin', ''], ['Li', 'Qingquan', ''], ['Pietikainen', 'Matti', '']]","['Local Orientation Adaptive Descriptor', 'Texture Classification', 'Material Recognition', 'Improved FisherVector', 'Convolutional Neural Network']"
13479,0707.3878,Joaquim Borges,"Joaquim Borges, Cristina Fernandez",Plotkin construction: rank and kernel,,,,,cs.IT math.IT,,"  Given two binary codes of length n, using Plotkin construction we obtain a
code of length 2n. The construction works for linear and nonlinear codes. For
the linear case, it is straightforward to see that the dimension of the final
code is the sum of the dimensions of the starting codes. For nonlinear codes,
the rank and the dimension of the kernel are standard mesures of linearity. In
this report, we prove that both parameters are also the sum of the
corresponding ones of the starting codes.
","[{'version': 'v1', 'created': 'Thu, 26 Jul 2007 08:44:05 GMT'}]",2007-07-27,"[['Borges', 'Joaquim', ''], ['Fernandez', 'Cristina', '']]","['Plotkin construction', 'rank', 'kernel', 'codes']"
13480,1603.02018,Jin Li,"Aixian Zhang, Jin Li, Keqin Feng","Linear Codes over Galois Ring $GR(p^2,r)$ Related to Gauss sums",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linear codes over finite rings become one of hot topics in coding theory
after Hommons et al.([4], 1994) discovered that several remarkable nonlinear
binary codes with some linear-like properties are the images of Gray map of
linear codes over $Z_4$. In this paper we consider two series of linear codes
$C(G)$ and $\widetilde{C}(G)$ over Galois ring $R=GR(p^2,r)$, where $G$ is a
subgroup of $R^{(s)^*}$ and $R^{(s)}=GR(p^2,rs)$. We present a general formula
on $N_\beta(a)$ in terms of Gauss sums on $R^{(s)}$ for each $a\in R$, where
$N_\beta(a)$ is the number of a-component of the codeword $c_\beta\in C(G)
(\beta\in R^{(s)})$ (Theorem 3.1). We have determined the complete Hamming
weight distribution of $C(G)$ and the minimum Hamming distance of
$\widetilde{C}(G)$ for some special G (Theorem 3.3 and 3.4). We show a general
formula on homogeneous weight of codewords in $C(G)$ and $\widetilde{C}(G)$
(Theorem 4.5) for the special $G$ given in Theorem 3.4. Finally we obtained
series of nonlinear codes over $\mathbb{F}_{q} \ (q=p^r)$ with two Hamming
distance by using Gray map (Corollary 4.6).
","[{'version': 'v1', 'created': 'Mon, 7 Mar 2016 11:55:24 GMT'}]",2016-03-08,"[['Zhang', 'Aixian', ''], ['Li', 'Jin', ''], ['Feng', 'Keqin', '']]","['linear code', 'Galois ring', 'Gauss sum', 'homogeneous weight', 'Gray map', 'weight distribution']"
13481,1701.05149,"G\""urkan Alpaslan","G\""urkan Alpaslan","Comparison of the Efficiency of Different Algorithms on Recommendation
  System Design: a Case Study",,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  By the growing trend of online shopping and e-commerce websites,
recommendation systems have gained more importance in recent years in order to
increase the sales ratios of companies. Different algorithms on recommendation
systems are used and every one produce different results. Every algorithm on
this area have positive and negative attributes. The purpose of the research is
to test the different algorithms for choosing the best one according as
structure of dataset and aims of developers. For this purpose, threshold and
k-means based collaborative filtering and content-based filtering algorithms
are utilized on the dataset contains 100*73421 matrix length. What are the
differences and effects of these different algorithms on the same dataset? What
are the challenges of the algorithms? What criteria are more important in order
to evaluate a recommendation systems? In the study, we answer these crucial
problems with the case study.
","[{'version': 'v1', 'created': 'Sun, 1 Jan 2017 17:58:38 GMT'}]",2017-01-19,"[['Alpaslan', 'Gürkan', '']]","['Collaborative filtering', 'Recommendation systems', 'Content-based filtering   I']"
13482,1501.03458,Luis Quesada,"Luis Quesada, Fernando Berzal, Juan-Carlos Cubero",The ModelCC Model-Based Parser Generator,"arXiv admin note: substantial text overlap with arXiv:1111.3970,
  arXiv:1501.02038",,,,cs.FL cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Formal languages let us define the textual representation of data with
precision. Formal grammars, typically in the form of BNF-like productions,
describe the language syntax, which is then annotated for syntax-directed
translation and completed with semantic actions. When, apart from the textual
representation of data, an explicit representation of the corresponding data
structure is required, the language designer has to devise the mapping between
the suitable data model and its proper language specification, and then develop
the conversion procedure from the parse tree to the data model instance.
Unfortunately, whenever the format of the textual representation has to be
modified, changes have to propagated throughout the entire language processor
tool chain. These updates are time-consuming, tedious, and error-prone.
Besides, in case different applications use the same language, several copies
of the same language specification have to be maintained. In this paper, we
introduce ModelCC, a model-based parser generator that decouples language
specification from language processing, hence avoiding many of the problems
caused by grammar-driven parsers and parser generators. ModelCC incorporates
reference resolution within the parsing process. Therefore, instead of
returning mere abstract syntax trees, ModelCC is able to obtain abstract syntax
graphs from input strings.
","[{'version': 'v1', 'created': 'Sun, 11 Jan 2015 15:03:03 GMT'}]",2015-01-15,"[['Quesada', 'Luis', ''], ['Berzal', 'Fernando', ''], ['Cubero', 'Juan-Carlos', '']]","['Data models', 'text mining', 'language specification', 'parser generator', 'abstract syntaxgraphs', 'Model-Driven Software Development']"
13483,1009.4982,S. M. Kamruzzaman,"S. M. Kamruzzaman, Md. Hijbul Alam, Abdul Kadar Muhammad Masum, and
  Md. Mahadi Hassan",Optimal Bangla Keyboard Layout using Data Mining Technique,"9 Pages, International Conference","Proc. International Conference on Information and Communication
  Technology in Management (ICTM 2005), Multimedia University, Malaysia, May
  2005",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an optimal Bangla Keyboard Layout, which distributes the
load equally on both hands so that maximizing the ease and minimizing the
effort. Bangla alphabet has a large number of letters, for this it is difficult
to type faster using Bangla keyboard. Our proposed keyboard will maximize the
speed of operator as they can type with both hands parallel. Here we use the
association rule of data mining to distribute the Bangla characters in the
keyboard. First, we analyze the frequencies of data consisting of monograph,
digraph and trigraph, which are derived from data wire-house, and then used
association rule of data mining to distribute the Bangla characters in the
layout. Experimental results on several data show the effectiveness of the
proposed approach with better performance.
","[{'version': 'v1', 'created': 'Sat, 25 Sep 2010 06:55:27 GMT'}]",2010-09-28,"[['Kamruzzaman', 'S. M.', ''], ['Alam', 'Md. Hijbul', ''], ['Masum', 'Abdul Kadar Muhammad', ''], ['Hassan', 'Md. Mahadi', '']]","['monograph', 'digraph', 'trigraph', 'association rule', 'data mining', 'hand switching', 'support', 'confidence']"
13484,1109.1147,Anis Ismail,"Anis Ismail, Aziz Barbar",P2P Domain Classification using Decision Tree,"20 pages, 13 figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Peer-to-Peer context, a challenging problem is how to find the appropriate
peer to deal with a given query without overly consuming bandwidth? Different
methods proposed routing strategies of queries taking into account the P2P
network at hand. This paper considers an unstructured P2P system based on an
organization of peers around Super-Peers that are connected to Super-Super-
Peer according to their semantic domains; By analyzing the queries log file, a
predictive model that avoids flooding queries in the P2P network is constructed
after predicting the appropriate Super-Peer, and hence the peer to answer the
query. A challenging problem in a schema-based Peer-to-Peer (P2P) system is how
to locate peers that are relevant to a given query. In this paper,
architecture, based on (Super-)Peers is proposed, focusing on query routing.
The approach to be implemented, groups together (Super-)Peers that have similar
interests for an efficient query routing method. In such groups, called
Super-Super-Peers (SSP), Super-Peers submit queries that are often processed by
members of this group. A SSP is a specific Super-Peer which contains knowledge
about: 1. its Super-Peers and 2. The other SSP. Knowledge is extracted by using
data mining techniques (e.g. Decision Tree algorithms) starting from queries of
peers that transit on the network. The advantage of this distributed knowledge
is that, it avoids making semantic mapping between heterogeneous data sources
owned by (Super-)Peers, each time the system decides to route query to other
(Super-) Peers. The set of SSP improves the robustness in queries routing
mechanism, and the scalability in P2P Network. Compared with a baseline
approach,the proposal architecture shows the effect of the data mining with
better performance in respect to response time and precision.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2011 11:24:01 GMT'}]",2011-09-07,"[['Ismail', 'Anis', ''], ['Barbar', 'Aziz', '']]","['P2P', 'Schema', 'Query Routing', 'Data Mining']"
13485,1704.07793,Jos\'e Ignacio Orlando Eng,"Jos\'e Ignacio Orlando and Hugo Luis Manterola and Enzo Ferrante and
  Federico Ariel","Arabidopsis roots segmentation based on morphological operations and
  CRFs",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Arabidopsis thaliana is a plant species widely utilized by scientists to
estimate the impact of genetic differences in root morphological features. For
this purpose, images of this plant after genetic modifications are taken to
study differences in the root architecture. This task requires manual
segmentations of radicular structures, although this is a particularly tedious
and time-consuming labor. In this work, we present an unsupervised method for
Arabidopsis thaliana root segmentation based on morphological operations and
fully-connected Conditional Random Fields. Although other approaches have been
proposed to this purpose, all of them are based on more complex and expensive
imaging modalities. Our results prove that our method can be easily applied
over images taken using conventional scanners, with a minor user intervention.
A first data set, our results and a fully open source implementation are
available online.
","[{'version': 'v1', 'created': 'Tue, 25 Apr 2017 17:19:19 GMT'}]",2017-04-26,"[['Orlando', 'José Ignacio', ''], ['Manterola', 'Hugo Luis', ''], ['Ferrante', 'Enzo', ''], ['Ariel', 'Federico', '']]","['Roots segmentation', 'Automatic phenotyping', 'Morphological operations', 'Conditional Random Fields']"
13486,1407.2275,Ryan Lewis,Ryan H. Lewis and Afra Zomorodian,Multicore Homology via Mayer Vietoris,"For source code and data sets, see http://www.ctl.appliedtopology.org",,,,cs.CG math.AT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we investigate the parallel computation of homology using the
Mayer-Vietoris principle. We present a two stage approach for parallelizing
persistence. In the first stage, we produce a cover of the input cell complex
by overlapping subspaces. In the second stage, we use this cover to build the
Mayer-Vietoris blowup complex, a topological space, which organizes the various
subspaces needed for employing the Mayer-Vietoris principle. Next, we compute
the homology of each subspace in the blowup complex in parallel and then glue
these results together in serial. We show how to use the persistence algorithm
to organize these computations. In the first stage, any algorithm can be used
to produce a cover of the input complex. We describe an algorithm for producing
a cover of a space with a simple structure and bounded overlap based on graph
partitions. Additionally, we present a simplistic model for the problem of
finding covers appropriate for parallel algorithms and show that finding such
covers is NP-Hard. Finally, we present a second parallel homology algorithm.
This algorithm avoids the explicit construction of the blowup complex saving
space. We implement our algorithms for multicore computers, and compare them
against each other as well as existing serial and parallel algorithms with a
suite of experiments. We achieve roughly 8x speedup of the homology
computations on a 10-dimensional complex with about 46 million simplices using
11 cores.
","[{'version': 'v1', 'created': 'Tue, 8 Jul 2014 21:18:43 GMT'}]",2014-07-10,"[['Lewis', 'Ryan H.', ''], ['Zomorodian', 'Afra', '']]","['Computational Topology', 'Algorithms', 'Theory']"
13487,0709.2346,Pilar Albert,"Pilar Albert, Elvira Mayordomo, Philippe Moser, Sylvain Perifel",Pushdown Compression,,,,,cs.IT cs.CC math.IT,,"  The pressing need for eficient compression schemes for XML documents has
recently been focused on stack computation [6, 9], and in particular calls for
a formulation of information-lossless stack or pushdown compressors that allows
a formal analysis of their performance and a more ambitious use of the stack in
XML compression, where so far it is mainly connected to parsing mechanisms. In
this paper we introduce the model of pushdown compressor, based on pushdown
transducers that compute a single injective function while keeping the widest
generality regarding stack computation. The celebrated Lempel-Ziv algorithm
LZ78 [10] was introduced as a general purpose compression algorithm that
outperforms finite-state compressors on all sequences. We compare the
performance of the Lempel-Ziv algorithm with that of the pushdown compressors,
or compression algorithms that can be implemented with a pushdown transducer.
This comparison is made without any a priori assumption on the data's source
and considering the asymptotic compression ratio for infinite sequences. We
prove that Lempel-Ziv is incomparable with pushdown compressors.
","[{'version': 'v1', 'created': 'Fri, 14 Sep 2007 17:00:09 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Sep 2007 11:15:58 GMT'}]",2007-09-17,"[['Albert', 'Pilar', ''], ['Mayordomo', 'Elvira', ''], ['Moser', 'Philippe', ''], ['Perifel', 'Sylvain', '']]","['Finite-state compression', 'Lempel-Ziv algorithm', 'pumping-lemma', 'pushdown compression', 'XML document']"
13488,0704.2092,Jinsong Tan,Jinsong Tan,A Note on the Inapproximability of Correlation Clustering,,"Information Processing Letters, 108: 331-335, 2008",,,cs.LG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider inapproximability of the correlation clustering problem defined
as follows: Given a graph $G = (V,E)$ where each edge is labeled either ""+""
(similar) or ""-"" (dissimilar), correlation clustering seeks to partition the
vertices into clusters so that the number of pairs correctly (resp.
incorrectly) classified with respect to the labels is maximized (resp.
minimized). The two complementary problems are called MaxAgree and MinDisagree,
respectively, and have been studied on complete graphs, where every edge is
labeled, and general graphs, where some edge might not have been labeled.
Natural edge-weighted versions of both problems have been studied as well. Let
S-MaxAgree denote the weighted problem where all weights are taken from set S,
we show that S-MaxAgree with weights bounded by $O(|V|^{1/2-\delta})$
essentially belongs to the same hardness class in the following sense: if there
is a polynomial time algorithm that approximates S-MaxAgree within a factor of
$\lambda = O(\log{|V|})$ with high probability, then for any choice of S',
S'-MaxAgree can be approximated in polynomial time within a factor of $(\lambda
+ \epsilon)$, where $\epsilon > 0$ can be arbitrarily small, with high
probability. A similar statement also holds for $S-MinDisagree. This result
implies it is hard (assuming $NP \neq RP$) to approximate unweighted MaxAgree
within a factor of $80/79-\epsilon$, improving upon a previous known factor of
$116/115-\epsilon$ by Charikar et. al. \cite{Chari05}.
","[{'version': 'v1', 'created': 'Tue, 17 Apr 2007 03:52:41 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Mar 2009 03:22:02 GMT'}]",2009-03-23,"[['Tan', 'Jinsong', '']]","['Correlation Clustering', 'Inapproximability', 'Randomized Rounding', 'Graph Algorithm']"
13489,1610.04174,Thomas Courtade,Thomas A. Courtade,"Monotonicity of Entropy and Fisher Information: A Quick Proof via
  Maximal Correlation","To appear, Communications on Information and Systems",,,,cs.IT math.IT math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A simple proof is given for the monotonicity of entropy and Fisher
information associated to sums of i.i.d. random variables. The proof relies on
a characterization of maximal correlation for partial sums due to Dembo, Kagan
and Shepp.
","[{'version': 'v1', 'created': 'Thu, 13 Oct 2016 16:56:26 GMT'}]",2016-10-14,"[['Courtade', 'Thomas A.', '']]","['Entropy', 'Fisher information', 'Maximal Correlation']"
13490,1401.0998,Olivier Hermant,"Lisa Allali (LIX), Olivier Hermant (CRI, INRIA Paris-Rocquencourt)","Semantic A-translation and Super-consistency entail Classical Cut
  Elimination",,"LPAR 19 - 19th Conference on Logic for Programming, Artificial
  Intelligence, and Reasoning - 2013 8312 (2013) 407-422",,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that if a theory R defined by a rewrite system is super-consistent,
the classical sequent calculus modulo R enjoys the cut elimination property,
which was an open question. For such theories it was already known that proofs
strongly normalize in natural deduction modulo R, and that cut elimination
holds in the intuitionistic sequent calculus modulo R. We first define a
syntactic and a semantic version of Friedman's A-translation, showing that it
preserves the structure of pseudo-Heyting algebra, our semantic framework. Then
we relate the interpretation of a theory in the A-translated algebra and its
A-translation in the original algebra. This allows to show the stability of the
super-consistency criterion and the cut elimination theorem.
","[{'version': 'v1', 'created': 'Mon, 6 Jan 2014 07:10:21 GMT'}]",2014-01-07,"[['Allali', 'Lisa', '', 'LIX'], ['Hermant', 'Olivier', '', 'CRI, INRIA Paris-Rocquencourt']]","['Deduction modulo', 'cut elimination', 'A-translation', 'pseudoHeyting algebra', 'super-consistency']"
13491,1111.6804,Alireza Abbasi,"Alireza Abbasi, Liaquat Hossain, Loet Leydesdorff","Betweenness Centrality as a Driver of Preferential Attachment in the
  Evolution of Research Collaboration Networks",Journal of Informetrics (in press),,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze whether preferential attachment in scientific coauthorship
networks is different for authors with different forms of centrality. Using a
complete database for the scientific specialty of research about ""steel
structures,"" we show that betweenness centrality of an existing node is a
significantly better predictor of preferential attachment by new entrants than
degree or closeness centrality. During the growth of a network, preferential
attachment shifts from (local) degree centrality to betweenness centrality as a
global measure. An interpretation is that supervisors of PhD projects and
postdocs broker between new entrants and the already existing network, and thus
become focal to preferential attachment. Because of this mediation, scholarly
networks can be expected to develop differently from networks which are
predicated on preferential attachment to nodes with high degree centrality.
","[{'version': 'v1', 'created': 'Tue, 29 Nov 2011 13:17:50 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Jan 2012 14:48:03 GMT'}, {'version': 'v3', 'created': 'Tue, 24 Jan 2012 20:49:36 GMT'}, {'version': 'v4', 'created': 'Thu, 2 Feb 2012 11:19:30 GMT'}]",2012-02-03,"[['Abbasi', 'Alireza', ''], ['Hossain', 'Liaquat', ''], ['Leydesdorff', 'Loet', '']]","['Collaboration', 'coauthorship', 'network', 'preferential attachment', 'cumulative']"
13492,1110.5296,M. Sohel Rahman,"Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal and M.
  Sohel Rahman",Computing a Longest Common Palindromic Subsequence,,,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The {\em longest common subsequence (LCS)} problem is a classic and
well-studied problem in computer science. Palindrome is a word which reads the
same forward as it does backward. The {\em longest common palindromic
subsequence (LCPS)} problem is an interesting variant of the classic LCS
problem which finds the longest common subsequence between two given strings
such that the computed subsequence is also a palindrome. In this paper, we
study the LCPS problem and give efficient algorithms to solve this problem. To
the best of our knowledge, this is the first attempt to study and solve this
interesting problem.
","[{'version': 'v1', 'created': 'Mon, 24 Oct 2011 18:20:43 GMT'}]",2011-10-25,"[['Chowdhury', 'Shihabur Rahman', ''], ['Hasan', 'Md. Mahbubul', ''], ['Iqbal', 'Sumaiya', ''], ['Rahman', 'M. Sohel', '']]","['algorithms', 'longest common subsequence', 'palindromes', 'dynamic programming']"
13493,1206.0381,Shamim Ripon,"Md. Nawab Yousuf Ali, Shamim Ripon and Shaikh Muhammad Allayear","UNL Based Bangla Natural Text Conversion - Predicate Preserving Parser
  Approach","7 pages, International Journal of Computer Science Issues (IJCSI),
  Volume 9, Issue 3 May 2012",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Universal Networking Language (UNL) is a declarative formal language that is
used to represent semantic data extracted from natural language texts. This
paper presents a novel approach to converting Bangla natural language text into
UNL using a method known as Predicate Preserving Parser (PPP) technique. PPP
performs morphological, syntactic and semantic, and lexical analysis of text
synchronously. This analysis produces a semantic-net like structure represented
using UNL. We demonstrate how Bangla texts are analyzed following the PPP
technique to produce UNL documents which can then be translated into any other
suitable natural language facilitating the opportunity to develop a universal
language translation method via UNL.
","[{'version': 'v1', 'created': 'Sat, 2 Jun 2012 13:23:18 GMT'}]",2012-06-05,"[['Ali', 'Md. Nawab Yousuf', ''], ['Ripon', 'Shamim', ''], ['Allayear', 'Shaikh Muhammad', '']]","['UNL', 'Bangla Natural Text', 'Predicate Preserving Parser', 'Morphological Analysis', 'Language Conversion']"
13494,1710.02187,Benjamin Heinzerling,Benjamin Heinzerling and Michael Strube,BPEmb: Tokenization-free Pre-trained Subword Embeddings in 275 Languages,,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present BPEmb, a collection of pre-trained subword unit embeddings in 275
languages, based on Byte-Pair Encoding (BPE). In an evaluation using
fine-grained entity typing as testbed, BPEmb performs competitively, and for
some languages bet- ter than alternative subword approaches, while requiring
vastly fewer resources and no tokenization. BPEmb is available at
https://github.com/bheinzerling/bpemb
","[{'version': 'v1', 'created': 'Thu, 5 Oct 2017 19:24:07 GMT'}]",2017-10-09,"[['Heinzerling', 'Benjamin', ''], ['Strube', 'Michael', '']]","['subword embeddings', 'byte-pair encoding', 'multilingual']"
13495,1605.01151,Felix Olu Bankole,"Felix Olu Bankole (University of South Africa) and Lucas Mimbi
  (University of South Africa)",ICT and Health System Performance in Africa: A Multi-Method Approach,"ISBN# 978-0-646-95337-3, Presented at the Australasian Conference on
  Information Systems 2015 (arXiv:1605.01032), Keywords: Information
  Communication Technology, Health Systems, Multi-method, Africa",,,ACIS/2015/4,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  For the past two decades, the discussion regarding the effect of ICT on
health systems is becoming apparent. However, past studies have mainly focused
on ICT impact on specific social-economic phenomena. Little empirical research
on ICT and health systems exists. Many African countries have invested in ICT
and there is a need to examine if such investments have impacted on health
system of these countries. Using a multi-method approach, data for 27 African
countries were analysed. We employed Data Envelopment Analysis, Cluster
Analysis and Partial Least Squares to examine the impact. The findings indicate
that the 27 countries can be grouped into three clusters based on their
relative efficiency scores of ICT and health systems. More compelling, the
findings indicate that countries that performed efficiently in ICT inputs also
do so in their health systems. Further, findings indicate that ICT
significantly improves life expectancy at birth and reduces infant mortality
rate. African countries must significantly invest in ICT to improve their
health systems so as to achieve socio-economic development. The current study
has theoretical, methodological and policy implications.
","[{'version': 'v1', 'created': 'Wed, 4 May 2016 06:03:40 GMT'}]",2016-05-24,"[['Bankole', 'Felix Olu', '', 'University of South Africa'], ['Mimbi', 'Lucas', '', 'University of South Africa']]","['ICT and Health Systems', 'Data Envelopment Analysis', 'Regression Analysis', 'Cluster Analysis', 'Africa']"
13496,1707.08496,Keren Censor-Hillel,"Keren Censor-Hillel, Rina Levy and Hadas Shachnai",Fast Distributed Approximation for Max-Cut,,,,,cs.DS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finding a maximum cut is a fundamental task in many computational settings.
Surprisingly, it has been insufficiently studied in the classic distributed
settings, where vertices communicate by synchronously sending messages to their
neighbors according to the underlying graph, known as the $\mathcal{LOCAL}$ or
$\mathcal{CONGEST}$ models. We amend this by obtaining almost optimal
algorithms for Max-Cut on a wide class of graphs in these models. In
particular, for any $\epsilon > 0$, we develop randomized approximation
algorithms achieving a ratio of $(1-\epsilon)$ to the optimum for Max-Cut on
bipartite graphs in the $\mathcal{CONGEST}$ model, and on general graphs in the
$\mathcal{LOCAL}$ model.
  We further present efficient deterministic algorithms, including a
$1/3$-approximation for Max-Dicut in our models, thus improving the best known
(randomized) ratio of $1/4$. Our algorithms make non-trivial use of the greedy
approach of Buchbinder et al. (SIAM Journal on Computing, 2015) for maximizing
an unconstrained (non-monotone) submodular function, which may be of
independent interest.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 15:29:24 GMT'}]",2017-07-27,"[['Censor-Hillel', 'Keren', ''], ['Levy', 'Rina', ''], ['Shachnai', 'Hadas', '']]","['Distributed graph algorithms', 'Max-Cut', 'Coloring', 'Clustering', 'Approximation Algorithms']"
13497,0803.1600,Uwe Aickelin,"Peer-Olaf Siebers, Uwe Aickelin, Helen Celia and Christopher Clegg",Understanding Retail Productivity by Simulating Management Practise,,"Proceedings of the EUROSIM Congress on Modelling and Simulation
  (EUROSIM 2007), pp 1-12, Ljubljana, Slovenia 2007",,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intelligent agents offer a new and exciting way of understanding the world of
work. In this paper we apply agent-based modeling and simulation to investigate
a set of problems in a retail context. Specifically, we are working to
understand the relationship between human resource management practices and
retail productivity. Despite the fact we are working within a relatively novel
and complex domain, it is clear that intelligent agents could offer potential
for fostering sustainable organizational capabilities in the future. Our
research so far has led us to conduct case study work with a top ten UK
retailer, collecting data in four departments in two stores. Based on our case
study data we have built and tested a first version of a department store
simulator. In this paper we will report on the current development of our
simulator which includes new features concerning more realistic data on the
pattern of footfall during the day and the week, a more differentiated view of
customers, and the evolution of customers over time. This allows us to
investigate more complex scenarios and to analyze the impact of various
management practices.
","[{'version': 'v1', 'created': 'Tue, 11 Mar 2008 14:46:10 GMT'}]",2008-12-18,"[['Siebers', 'Peer-Olaf', ''], ['Aickelin', 'Uwe', ''], ['Celia', 'Helen', ''], ['Clegg', 'Christopher', '']]","['Agent-Based Modeling and Simulation', 'Retail Productivity', 'Management Practices', 'Shopping Behavior', 'Multi-Disciplinary Research']"
13498,1610.05847,Mazen Alamir Prof,Mazen Alamir and Jean Dobrowolski and Amgad tarek Mohammed,"Output Feedback Control of a Class of Uncertain Systems Under
  Control-derivative dependent disturbances","6 pages, 5 figures",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the design of robust dynamic output feedback control for
highly uncertain systems in which the unknown disturbance might be excited by
the derivative of the control input. This context appears in many industrial
problems such as the speed control of the hydraulic turbines and the frequency
stabilization in micro grids to cite but few examples. A key feature that has
to be carefully addressed in this context is that too agressive feedback might
lead to the loss of controllability and/or a significant drop in the
closed-loop performance. The paper formulates the problem, underlines its
relevance and gives a rigorous solution in which a dynamic output feedback is
given together with a realistic set of sufficient conditions on the
controller's parameters that enable to assess the behavior of the closed-loop
under different circumstances. A numerical example is given to illustrate the
relevance of the proposed successful design characterization.
","[{'version': 'v1', 'created': 'Wed, 19 Oct 2016 02:16:00 GMT'}]",2016-10-20,"[['Alamir', 'Mazen', ''], ['Dobrowolski', 'Jean', ''], ['Mohammed', 'Amgad tarek', '']]","['Robust Control', 'control-dependent uncertainties', 'low gain feedback']"
13499,0909.1779,Sam Madden,"Philippe Cudre-Mauroux (MIT), Eugene Wu (MIT), Sam Madden (MIT)","The Case for RodentStore, an Adaptive, Declarative Storage System",CIDR 2009,,,,cs.DB,http://creativecommons.org/licenses/by/3.0/,"  Recent excitement in the database community surrounding new
applications?analytic, scientific, graph, geospatial, etc.?has led to an
explosion in research on database storage systems. New storage systems are
vital to the database community, as they are at the heart of making database
systems perform well in new application domains. Unfortunately, each such
system also represents a substantial engineering effort including a great deal
of duplication of mechanisms for features such as transactions and caching. In
this paper, we make the case for RodentStore, an adaptive and declarative
storage system providing a high-level interface for describing the physical
representation of data. Specifically, RodentStore uses a declarative storage
algebra whereby administrators (or database design tools) specify how a logical
schema should be grouped into collections of rows, columns, and/or arrays, and
the order in which those groups should be laid out on disk. We describe the key
operators and types of our algebra, outline the general architecture of
RodentStore, which interprets algebraic expressions to generate a physical
representation of the data, and describe the interface between RodentStore and
other parts of a database system, such as the query optimizer and executor. We
provide a case study of the potential use of RodentStore in representing dense
geospatial data collected from a mobile sensor network, showing the ease with
which different storage layouts can be expressed using some of our algebraic
constructs and the potential performance gains that a RodentStore-built storage
system can offer.
","[{'version': 'v1', 'created': 'Wed, 9 Sep 2009 18:10:20 GMT'}]",2009-09-15,"[['Cudre-Mauroux', 'Philippe', '', 'MIT'], ['Wu', 'Eugene', '', 'MIT'], ['Madden', 'Sam', '', 'MIT']]","['Decomposition Storage Model', 'Adaptive Layout', 'Storage Algebra', 'Storage Transforms']"
13500,1003.1449,Rdv Ijcsis,"V. S. Meenakshi, G. Padmavathi","Securing Iris Templates using Combined User and Soft Biometric based
  Password Hardened Fuzzy Vault","Pages IEEE format, Computer Science ISSN 19475500, International
  Journal of Computer Science and Information Security, IJCSIS February 2010,
  ISSN 1947 5500, http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 7, No. 2, pp. 001-008, February 2010, USA",,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Personal identification and authentication is very crucial in the current
scenario. Biometrics plays an important role in this area. Biometric based
authentication has proved superior compared to traditional password based
authentication. Anyhow biometrics is permanent feature of a person and cannot
be reissued when compromised as passwords. To over come this problem, instead
of storing the original biometric templates transformed templates can be
stored. Whenever the transformation function is changed new
revocable/cancelable templates are generated. Soft biometrics is ancillary
information that can be combined with primary biometrics to identify a person
in a better way. Iris has certain advantage compared to other biometric traits
like fingerprint. Iris is an internal part that is less prone to damage.
Moreover is very difficult for an attacker to capture an iris. The key
advantage of iris biometrics is its stability or template longevity. Biometric
systems are vulnerable to a variety of attacks. This work generates cancelable
iris templates by applying user and soft biometric based password
transformations and further secures the templates by biometric cryptographic
construct fuzzy vault.
","[{'version': 'v1', 'created': 'Sun, 7 Mar 2010 11:03:18 GMT'}]",2011-02-19,"[['Meenakshi', 'V. S.', ''], ['Padmavathi', 'G.', '']]","['Cancelable Biometrics', 'Password', 'Soft Biometrics', 'Iris', 'Eye color', 'Template security', 'Fuzzy Vault']"
13501,0909.3997,Pascal Vanier,"Emmanuel Jeandel, Pascal Vanier",Periodicity in tilings,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tilings and tiling systems are an abstract concept that arise both as a
computational model and as a dynamical system. In this paper, we characterize
the sets of periods that a tiling system can produce. We prove that up to a
slight recoding, they correspond exactly to languages in the complexity classes
$\nspace{n}$ and $\cne$.
","[{'version': 'v1', 'created': 'Tue, 22 Sep 2009 13:49:42 GMT'}]",2009-09-23,"[['Jeandel', 'Emmanuel', ''], ['Vanier', 'Pascal', '']]","['Computational and structural complexity', 'tilings', 'dynamicalsystems']"
13502,1011.2152,Pierre Fraigniaud,"Pierre Fraigniaud, Amos Korman, David Peleg",Local Distributed Decision,,,,,cs.DC cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A central theme in distributed network algorithms concerns understanding and
coping with the issue of locality. Inspired by sequential complexity theory, we
focus on a complexity theory for distributed decision problems. In the context
of locality, solving a decision problem requires the processors to
independently inspect their local neighborhoods and then collectively decide
whether a given global input instance belongs to some specified language. This
paper introduces several classes of distributed decision problems, proves
separation among them and presents some complete problems. More specifically,
we consider the standard LOCAL model of computation and define LD (for local
decision) as the class of decision problems that can be solved in constant
number of communication rounds. We first study the intriguing question of
whether randomization helps in local distributed computing, and to what extent.
Specifically, we define the corresponding randomized class BPLD, and ask
whether LD=BPLD. We provide a partial answer to this question by showing that
in many cases, randomization does not help for deciding hereditary languages.
In addition, we define the notion of local many-one reductions, and introduce
the (nondeterministic) class NLD of decision problems for which there exists a
certificate that can be verified in constant number of communication rounds. We
prove that there exists an NLD-complete problem. We also show that there exist
problems not in NLD. On the other hand, we prove that the class NLD#n, which is
NLD assuming that each processor can access an oracle that provides the number
of nodes in the network, contains all (decidable) languages. For this class we
provide a natural complete problem as well.
","[{'version': 'v1', 'created': 'Tue, 9 Nov 2010 17:13:13 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Mar 2011 12:50:32 GMT'}]",2011-03-04,"[['Fraigniaud', 'Pierre', ''], ['Korman', 'Amos', ''], ['Peleg', 'David', '']]","['Local distributed algorithms', 'local decision', 'nondeterminism', 'randomized algo']"
13503,1110.3002,Carlos Gershenson,Carlos Gershenson,Are Minds Computable?,"7 pages, comments welcome",,,C3 Report 2011.08,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This essay explores the limits of Turing machines concerning the modeling of
minds and suggests alternatives to go beyond those limits.
","[{'version': 'v1', 'created': 'Thu, 13 Oct 2011 17:26:03 GMT'}]",2011-10-14,"[['Gershenson', 'Carlos', '']]","['computability', 'mind', 'Turing', 'interactions']"
13504,1502.03985,Elmar Langetepe,"Rolf Klein, David Kriesel, Elmar Langetepe","A local strategy for cleaning expanding cellular domains by simple
  robots",,,,,cs.DS cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a strategy SEP for finite state machines tasked with cleaning a
cellular environment in which a contamination spreads. Initially, the
contaminated area is of height $h$ and width $w$. It may be bounded by four
monotonic chains, and contain rectangular holes. The robot does not know the
initial contamination, sensing only the eight cells in its neighborhood. It
moves from cell to cell, $d$ times faster than the contamination spreads, and
is able to clean its current cell. A speed of $d<\sqrt{2}(h+w)$ is in general
not sufficient to contain the contamination. Our strategy SEP succeeds if $d
\geq 3(h+w)$ holds. It ensures that the contaminated cells stay connected.
Greedy strategies violating this principle need speed at least $d \geq 4(h+w)$;
all bounds are up to small additive constants.
","[{'version': 'v1', 'created': 'Fri, 13 Feb 2015 13:45:35 GMT'}]",2015-02-16,"[['Klein', 'Rolf', ''], ['Kriesel', 'David', ''], ['Langetepe', 'Elmar', '']]","['Motion planning', 'finite automata', 'expanding contamination', 'cleaning strategy']"
13505,1603.06542,Vassil Roussev,"Vassil Roussev, Andres Barreto, Irfan Ahmed",Forensic Acquisition of Cloud Drives,20 pages,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing and cloud storage services, in particular, pose a new
challenge to digital forensic investigations. Currently, evidence acquisition
for such services still follows the traditional method of collecting artifacts
on a client device. This approach requires labor-intensive reverse engineering
efforts, and ultimately results in an acquisition that is inherently
incomplete. Specifically, it makes the incorrect assumption that all storage
content for an account is fully replicated on the client; further, there are no
means to acquire historical data in the form of document revisions, nor is
there a way to acquire cloud-native artifacts, such as Google Docs.
  In this work, we introduce the concept of API-based evidence acquisition for
cloud services, which addresses these concerns by utilizing the officially
supported API of the service. To demonstrate the utility of this approach, we
present a proof-of-concept acquisition tool, kumodd, which can acquire evidence
from four major cloud drive providers: Google Drive, Microsoft OneDrive,
Dropbox, and Box. The implementation provides both command-line and web user
interfaces, and can be readily incorporated into established forensic
processes.
","[{'version': 'v1', 'created': 'Tue, 26 Jan 2016 06:07:39 GMT'}]",2016-03-22,"[['Roussev', 'Vassil', ''], ['Barreto', 'Andres', ''], ['Ahmed', 'Irfan', '']]","['Cloud forensics', 'cloud storage forensics', 'kumodd', 'API-based evidence acquisition', 'Google']"
13506,1110.2055,Jan Sykora,J.Sykora and T. Krejci and J. Kruis and M. Sejnoha,"Computational homogenization of non-stationary transport processes in
  masonry structures",,,,,cs.CE physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A fully coupled transient heat and moisture transport in a masonry structure
is examined in this paper. Supported by several successful applications in
civil engineering the nonlinear diffusion model proposed by K\""{u}nzel is
adopted in the present study. A strong material heterogeneity together with a
significant dependence of the model parameters on initial conditions as well as
the gradients of heat and moisture fields vindicates the use of a hierarchical
modeling strategy to solve the problem of this kind. Attention is limited to
the classical first order homogenization in a spatial domain developed here in
the framework of a two step (meso-macro) multi-scale computational scheme (FE^2
problem). Several illustrative examples are presented to investigate the
influence of transient flow at the level of constituents (meso-scale) on the
macroscopic response including the effect of macro-scale boundary conditions. A
two-dimensional section of Charles Bridge subjected to actual climatic
conditions is analyzed next to confirm the suitability of algorithmic format of
FE^2 scheme for the parallel computing.
","[{'version': 'v1', 'created': 'Mon, 10 Oct 2011 14:34:59 GMT'}]",2011-10-11,"[['Sykora', 'J.', ''], ['Krejci', 'T.', ''], ['Kruis', 'J.', ''], ['Sejnoha', 'M.', '']]","['Computational homogenization', 'Masonry', 'Coupled heat andmoisture transport', 'Parallel computing']"
13507,1303.5430,Philippe Smets,Philippe Smets,"The Nature of the Unnormalized Beliefs Encountered in the Transferable
  Belief Model","Appears in Proceedings of the Eighth Conference on Uncertainty in
  Artificial Intelligence (UAI1992)",,,UAI-P-1992-PG-292-297,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Within the transferable belief model, positive basic belief masses can be
allocated to the empty set, leading to unnormalized belief functions. The
nature of these unnormalized beliefs is analyzed.
","[{'version': 'v1', 'created': 'Wed, 13 Mar 2013 12:55:17 GMT'}]",2013-03-25,"[['Smets', 'Philippe', '']]","['Transferable belief model', 'belief functions', 'Dempster-Shafer theory', ""Dempster's rule of conditioning"", 'normalization factors']"
13508,1212.5596,Jos van Wezel,"Jos van Wezel, Achim Streit, Christopher Jung, Rainer Stotzka, Silke
  Halstenberg, Fabian Rigoll, Ariel Garcia, Andreas Heiss, Kilian Schwarz,
  Martin Gasthuber, Andr\'e Giesler","Data Life Cycle Labs, A New Concept to Support Data-Intensive Science","8 pages, project white paper",,,,cs.DL physics.comp-ph q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many sciences the increasing amounts of data are reaching the limit of
established data handling and processing. With four large research centers of
the German Helmholtz association the Large Scale Data Management and Analysis
(LSDMA) project supports an initial set of scientific projects, initiatives and
instruments to organize and efficiently analyze the increasing amount of data
produced in modern science. LSDMA bridges the gap between data production and
data analysis using a novel approach by combining specific community support
and generic, cross community development. In the Data Life Cycle Labs (DLCL)
experts from the data domain work closely with scientific groups of selected
research domains in joint R&D where community-specific data life cycles are
iteratively optimized, data and meta-data formats are defined and standardized,
simple access and use is established as well as data and scientific insights
are preserved in long-term and open accessible archives.
","[{'version': 'v1', 'created': 'Fri, 21 Dec 2012 16:16:25 GMT'}]",2012-12-27,"[['van Wezel', 'Jos', ''], ['Streit', 'Achim', ''], ['Jung', 'Christopher', ''], ['Stotzka', 'Rainer', ''], ['Halstenberg', 'Silke', ''], ['Rigoll', 'Fabian', ''], ['Garcia', 'Ariel', ''], ['Heiss', 'Andreas', ''], ['Schwarz', 'Kilian', ''], ['Gasthuber', 'Martin', ''], ['Giesler', 'André', '']]","['data management', 'data life cycle', 'data intensive computing', 'data analysis', 'data exploration', 'LSDMA', 'support', 'data infrastructure']"
13509,1111.2208,Ruchi Tuli Dr.,"Ruchi Tuli, Parveen Kumar",Minimum Process Coordinated Checkpointing Scheme for Ad Hoc Networks,,,,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The wireless mobile ad hoc network (MANET) architecture is one consisting of
a set of mobile hosts capable of communicating with each other without the
assistance of base stations. This has made possible creating a mobile
distributed computing environment and has also brought several new challenges
in distributed protocol design. In this paper, we study a very fundamental
problem, the fault tolerance problem, in a MANET environment and propose a
minimum process coordinated checkpointing scheme. Since potential problems of
this new environment are insufficient power and limited storage capacity, the
proposed scheme tries to reduce the amount of information saved for recovery.
The MANET structure used in our algorithm is hierarchical based. The scheme is
based for Cluster Based Routing Protocol (CBRP) which belongs to a class of
Hierarchical Reactive routing protocols. The protocol proposed by us is
nonblocking coordinated checkpointing algorithm suitable for ad hoc
environments. It produces a consistent set of checkpoints; the algorithm makes
sure that only minimum number of nodes in the cluster are required to take
checkpoints; it uses very few control messages. Performance analysis shows that
our algorithm outperforms the existing related works and is a novel idea in the
field. Firstly, we describe an organization of the cluster. Then we propose a
minimum process coordinated checkpointing scheme for cluster based ad hoc
routing protocols.
","[{'version': 'v1', 'created': 'Wed, 9 Nov 2011 14:01:07 GMT'}]",2011-11-10,"[['Tuli', 'Ruchi', ''], ['Kumar', 'Parveen', '']]","['Ad hoc routing', 'checkpointing', 'fault tolerance', 'mobile computing', 'clusterheads', 'clustering routingprotocol']"
13510,1605.02905,Carine Pivoteau,Nicolas Auger and Mathilde Bouvel and Cyril Nicaud and Carine Pivoteau,"Analysis of Algorithms for Permutations Biased by Their Number of
  Records",,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The topic of the article is the parametric study of the complexity of
algorithms on arrays of pairwise distinct integers. We introduce a model that
takes into account the non-uniformness of data, which we call the Ewens-like
distribution of parameter $\theta$ for records on permutations: the weight
$\theta^r$ of a permutation depends on its number $r$ of records. We show that
this model is meaningful for the notion of presortedness, while still being
mathematically tractable. Our results describe the expected value of several
classical permutation statistics in this model, and give the expected running
time of three algorithms: the Insertion Sort, and two variants of the Min-Max
search.
","[{'version': 'v1', 'created': 'Tue, 10 May 2016 09:39:56 GMT'}]",2016-05-11,"[['Auger', 'Nicolas', ''], ['Bouvel', 'Mathilde', ''], ['Nicaud', 'Cyril', ''], ['Pivoteau', 'Carine', '']]","['permutation', 'Ewens distribution', 'random generation', 'analysis of algorithms']"
13511,1606.03510,Shiang-Yen Tan,Shiang-Yen Tan and Taizan Chan,"Defining and Conceptualizing Actionable Insight: A Conceptual Framework
  for Decision-centric Analytics","ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
  Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/203,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Despite actionable insight is widely recognized as the outcome of data
analytics, there is a lack of a systematic and commonly-shared definition for
the term. More importantly, existing definitions are generally too abstract for
informing the design of data analytics systems. This study proposes a
definition for actionable insight in data analytics. For this purpose, this
study conceptualizes actionable insight as a multi-component concept. The
components, namely analytics insight, synergic insight, and prognostic insights
are grounded in theories from multiple disciplines. Collectively, the
components provide a holistic definition for actionable insight. Based on the
multi-component view, a conceptual framework is introduced to actionable
insight in detail, at both the concept-level and component-level. Each
component's analytical, cognitive, and computational requirements are explained
and relevant design considerations are suggested. We hope this study could be a
rudimentary step toward the realization of data-centric data analytics that can
deliver the promised actionable insight.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 00:25:19 GMT'}]",2016-06-14,"[['Tan', 'Shiang-Yen', ''], ['Chan', 'Taizan', '']]","['Actionable insight', 'Data analytics', 'Theory development', 'Decision support', 'Problem Solving']"
13512,1208.4536,Alexandre Bartel,"Alexandre Bartel (SnT), Jacques Klein (SnT), Martin Monperrus (INRIA
  Lille - Nord Europe), Kevin Allix (SnT), Yves Le Traon (SnT)","In-Vivo Bytecode Instrumentation for Improving Privacy on Android
  Smartphones in Uncertain Environments",ISBN: 978-2-87971-111-9,,,,cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we claim that an efficient and readily applicable means to
improve privacy of Android applications is: 1) to perform runtime monitoring by
instrumenting the application bytecode and 2) in-vivo, i.e. directly on the
smartphone. We present a tool chain to do this and present experimental results
showing that this tool chain can run on smartphones in a reasonable amount of
time and with a realistic effort. Our findings also identify challenges to be
addressed before running powerful runtime monitoring and instrumentations
directly on smartphones. We implemented two use-cases leveraging the tool
chain: BetterPermissions, a fine-grained user centric permission policy system
and AdRemover an advertisement remover. Both prototypes improve the privacy of
Android systems thanks to in-vivo bytecode instrumentation.
","[{'version': 'v1', 'created': 'Tue, 5 Jun 2012 06:31:41 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Oct 2013 08:59:40 GMT'}]",2013-10-09,"[['Bartel', 'Alexandre', '', 'SnT'], ['Klein', 'Jacques', '', 'SnT'], ['Monperrus', 'Martin', '', 'INRIA\n  Lille - Nord Europe'], ['Allix', 'Kevin', '', 'SnT'], ['Traon', 'Yves Le', '', 'SnT']]","['Android Security', 'Bytecode Manipulation', 'Privacy', 'Fine-grained permission policy']"
13513,1002.3984,William Jackson,"Deepak Aggarwal, Kanwalvir Singh Dhindsa",Effect of Embedding Watermark on Compression of the Digital Images,,"Journal of Computing, Volume 2, Issue 2, February 2010,
  https://sites.google.com/site/journalofcomputing/",,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image Compression plays a very important role in image processing especially
when we are to send the image on the internet. The threat to the information on
the internet increases and image is no exception. Generally the image is sent
on the internet as the compressed image to optimally use the bandwidth of the
network. But as we are on the network, at any intermediate level the image can
be changed intentionally or unintentionally. To make sure that the correct
image is being delivered at the other end we embed the water mark to the image.
The watermarked image is then compressed and sent on the network. When the
image is decompressed at the other end we can extract the watermark and make
sure that the image is the same that was sent by the other end. Though
watermarking the image increases the size of the uncompressed image but that
has to done to achieve the high degree of robustness i.e. how an image sustains
the attacks on it. The present paper is an attempt to make transmission of the
images secure from the intermediate attacks by applying the generally used
compression transforms.
","[{'version': 'v1', 'created': 'Sun, 21 Feb 2010 18:29:53 GMT'}]",2010-03-25,"[['Aggarwal', 'Deepak', ''], ['Dhindsa', 'Kanwalvir Singh', '']]","['Compression', 'Threshold', 'PSNR and Watermark']"
13514,1505.02820,Carlos Ochoa,"Jeremy Barbay, Carlos Ochoa and Pablo Perez-Lantero",Refining the Analysis of Divide and Conquer: How and When,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Divide-and-conquer is a central paradigm for the design of algorithms,
through which some fundamental computational problems, such as sorting arrays
and computing convex hulls, are solved in optimal time within
$\Theta(n\log{n})$ in the worst case over instances of size $n$. A finer
analysis of those problems yields complexities within $O(n(1 + \mathcal{H}(n_1,
\dots, n_k))) \subseteq O(n(1{+}\log{k})) \subseteq O(n\log{n})$ in the worst
case over all instances of size $n$ composed of $k$ ""easy"" fragments of
respective sizes $n_1, \dots, n_k$ summing to $n$, where the entropy function
$\mathcal{H}(n_1, \dots, n_k) = \sum_{i=1}^k{\frac{n_i}{n}}\log{\frac{n}{n_i}}$
measures the ""difficulty"" of the instance. We consider whether such refined
analysis can be applied to other algorithms based on divide-and-conquer, such
as polynomial multiplication, input-order adaptive computation of convex hulls
in 2D and 3D, and computation of Delaunay triangulations.
","[{'version': 'v1', 'created': 'Mon, 11 May 2015 22:12:23 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Aug 2015 04:04:21 GMT'}, {'version': 'v3', 'created': 'Fri, 25 Sep 2015 13:48:21 GMT'}]",2015-09-28,"[['Barbay', 'Jeremy', ''], ['Ochoa', 'Carlos', ''], ['Perez-Lantero', 'Pablo', '']]","['Adaptive Analysis', 'Convex Hull', 'Delaunay Triangulation', 'Divide and Conquer', 'Voronoi Diagrams']"
13515,1003.3619,Boris Ryabko,Boris Ryabko,"Using Information Theory to Study the Efficiency and Capacity of
  Computers and Similar Devices",,,,,cs.IT cs.CC math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the problems of estimating the computer efficiency and the
computer capacity. We define the computer efficiency and capacity and suggest a
method for their estimation, based on the analysis of processor instructions
and kinds of accessible memory. It is shown how the suggested method can be
applied to estimate the computer capacity. In particular, this consideration
gives a new look at the organization of the memory of a computer. Obtained
results can be of some interest for practical applications
","[{'version': 'v1', 'created': 'Thu, 18 Mar 2010 16:13:37 GMT'}]",2010-03-19,"[['Ryabko', 'Boris', '']]","['computer capacity', 'computer efficiency', 'Shannon theory', 'cache memory', 'Information Theory']"
13516,1511.01861,Marijn ten Thij,"Marijn ten Thij, Sandjai Bhulai",Modeling trend progression through an extension of the Polya Urn Process,"11 pages, 2 figures, NetSci-X Conference, Wroclaw, Poland, 11-13
  January 2016. arXiv admin note: text overlap with arXiv:1502.00166",,,,cs.SI math.PR physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowing how and when trends are formed is a frequently visited research goal.
In our work, we focus on the progression of trends through (social) networks.
We use a random graph (RG) model to mimic the progression of a trend through
the network. The context of the trend is not included in our model. We show
that every state of the RG model maps to a state of the Polya process. We find
that the limit of the component size distribution of the RG model shows
power-law behaviour. These results are also supported by simulations.
","[{'version': 'v1', 'created': 'Thu, 5 Nov 2015 19:31:28 GMT'}]",2015-11-06,"[['Thij', 'Marijn ten', ''], ['Bhulai', 'Sandjai', '']]","['Retweet graph', 'Twitter', 'graph dynamics', 'random graph model', 'Polya process']"
13517,1802.08974,Kun Hu,"Kun Hu, Zhe Li, Ying Liu, Luyin Cheng, Qi Yang, and Yan Li","A Framework in CRM Customer Lifecycle: Identify Downward Trend and
  Potential Issues Detection","14 pages, 6 Figures",,,,cs.CY cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Customer retention is one of the primary goals in the area of customer
relationship management. A mass of work exists in which machine learning models
or business rules are established to predict churn. However, targeting users at
an early stage when they start to show a downward trend is a better strategy.
In downward trend prediction, the reasons why customers show a downward trend
is of great interest in the industry as it helps the business to understand the
pain points that customers suffer and to take early action to prevent them from
churning. A commonly used method is to collect feedback from customers by
either aggressively reaching out to them or by passively hearing from them.
However, it is believed that there are a large number of customers who have
unpleasant experiences and never speak out. In the literature, there is limited
research work that provides a comprehensive and scientific approach to identify
these ""silent suffers"". In this study, we propose a novel two-part framework:
developing the downward prediction process and establishing the methodology to
identify the reasons why customers are in the downward trend. In the first
prediction part, we focus on predicting the downward trend, which is an earlier
stage of the customer lifecycle compared to churn. In the second part, we
propose an approach to figuring out the cause (of the downward trend) based on
a causal inference method and semi-supervised learning. The proposed approach
is capable of identifying potential silent sufferers. We take bad shopping
experiences as inputs to develop the framework and validate it via a marketing
A/B test in the real world. The test readout demonstrates the effectiveness of
the framework by driving 88.5% incremental lift in purchase volume.
","[{'version': 'v1', 'created': 'Sun, 25 Feb 2018 09:28:52 GMT'}]",2018-02-27,"[['Hu', 'Kun', ''], ['Li', 'Zhe', ''], ['Liu', 'Ying', ''], ['Cheng', 'Luyin', ''], ['Yang', 'Qi', ''], ['Li', 'Yan', '']]","['Customer Relationship Management', 'Semi-supervised learning', 'Customer Retention', 'Downward Prediction']"
13518,1704.03939,Soumen Kanrar,Soumen Kanrar,Speaker Identification by GMM based i Vector,"6 Pages, 12 figures",,,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Speaker Identification process is to identify a particular vocal cord from a
set of existing speakers. In the speaker identification processes, unknown
speaker voice sample targets each of the existing speakers present in the
system and gives a predication. The predication may be more than one existing
known speaker voice and is very close to the unknown speaker voice. The model
is a Gaussian mixture model built by the extracted acoustic feature vectors
from voice. The i-vector based dimension compression mapping function of the
channel depended speaker, and super vector give better predicted scores
according to cosine distance scoring associated with the order pair of
speakers. In the order pair, the first coordinate is the unknown speaker i.e.
test speaker, and the second coordinates is the existing known speaker i.e.
target speaker. This paper presents the enhancement of the prediction based on
i- vector in compare to the normalized set of predicted score. In the
simulation, known speaker voices are collected through different channels and
in different languages. In the testing, the GMM voice models, and GMM based
i-Vector speaker voice models of the known speakers are used among the numbers
of clusters in the test data set.
","[{'version': 'v1', 'created': 'Wed, 12 Apr 2017 21:43:20 GMT'}]",2017-04-14,"[['Kanrar', 'Soumen', '']]","['Speaker Identification', 'Gaussian mixture mode(GMM)', 'Acousticfeature vectors', 'Decision threshold', 'i-Vector']"
13519,1610.03577,Jihun Hamm,Jihun Hamm,Minimax Filter: Learning to Preserve Privacy from Inference Attacks,Revision 2: minor revision,Journal of Machine Learning Research 18 (2017) 1-31,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Preserving privacy of continuous and/or high-dimensional data such as images,
videos and audios, can be challenging with syntactic anonymization methods
which are designed for discrete attributes. Differential privacy, which
provides a more formal definition of privacy, has shown more success in
sanitizing continuous data. However, both syntactic and differential privacy
are susceptible to inference attacks, i.e., an adversary can accurately infer
sensitive attributes from sanitized data. The paper proposes a novel
filter-based mechanism which preserves privacy of continuous and
high-dimensional attributes against inference attacks. Finding the optimal
utility-privacy tradeoff is formulated as a min-diff-max optimization problem.
The paper provides an ERM-like analysis of the generalization error and also a
practical algorithm to perform the optimization. In addition, the paper
proposes an extension that combines minimax filter and differentially-private
noisy mechanism. Advantages of the method over purely noisy mechanisms is
explained and demonstrated with examples. Experiments with several real-world
tasks including facial expression classification, speech emotion
classification, and activity classification from motion, show that the minimax
filter can simultaneously achieve similar or better target task accuracy and
lower inference accuracy, often significantly lower than previous methods.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2016 01:57:20 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Sep 2017 18:40:30 GMT'}, {'version': 'v3', 'created': 'Fri, 1 Dec 2017 05:07:49 GMT'}]",2017-12-04,"[['Hamm', 'Jihun', '']]","['inference attack', 'empirical risk minimization', 'minimax optimization', 'differential privacy', 'k-anonymity']"
13520,0907.4273,Berndt Gammel,Berndt M. Gammel and Stefan Mangard,On the Duality of Probing and Fault Attacks,,"Cryptology ePrint Archive, Report 2009/352",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we investigate the problem of simultaneous privacy and integrity
protection in cryptographic circuits. We consider a white-box scenario with a
powerful, yet limited attacker. A concise metric for the level of probing and
fault security is introduced, which is directly related to the capabilities of
a realistic attacker. In order to investigate the interrelation of probing and
fault security we introduce a common mathematical framework based on the
formalism of information and coding theory. The framework unifies the known
linear masking schemes. We proof a central theorem about the properties of
linear codes which leads to optimal secret sharing schemes. These schemes
provide the lower bound for the number of masks needed to counteract an
attacker with a given strength. The new formalism reveals an intriguing duality
principle between the problems of probing and fault security, and provides a
unified view on privacy and integrity protection using error detecting codes.
Finally, we introduce a new class of linear tamper-resistant codes. These are
eligible to preserve security against an attacker mounting simultaneous probing
and fault attacks.
","[{'version': 'v1', 'created': 'Fri, 24 Jul 2009 12:49:11 GMT'}]",2009-07-27,"[['Gammel', 'Berndt M.', ''], ['Mangard', 'Stefan', '']]","['probing attacks', 'fault attacks', 'side channel attacks', 'coding theory', 'secret sharing', 'securecomputation']"
13521,1403.2319,Peter Schrammel,David Monniaux and Peter Schrammel,Speeding Up Logico-Numerical Strategy Iteration (extended version),Extended version of a paper submitted to SAS 2014,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce an efficient combination of polyhedral analysis and predicate
partitioning. Template polyhedral analysis abstracts numerical variables inside
a program by one polyhedron per control location, with a priori fixed
directions for the faces. The strongest inductive invariant in such an abstract
domain may be computed by upward strategy iteration. If the transition relation
includes disjunctions and existential quantifiers (a succinct representation
for an exponential set of paths), this invariant can be computed by a
combination of strategy iteration and satisfiability modulo theory (SMT)
solving. Unfortunately, the above approaches lead to unacceptable space and
time costs if applied to a program whose control states have been partitioned
according to predicates. We therefore propose a modification of the strategy
iteration algorithm where the strategies are stored succinctly, and the linear
programs to be solved at each iteration step are simplified according to an
equivalence relation. We have implemented the technique in a prototype tool and
we demonstrate on a series of examples that the approach performs significantly
better than previous strategy iteration techniques.
","[{'version': 'v1', 'created': 'Mon, 10 Mar 2014 17:49:37 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Oct 2014 20:52:41 GMT'}]",2014-10-06,"[['Monniaux', 'David', ''], ['Schrammel', 'Peter', '']]","['Static analysis', 'abstract interpretation', 'strategy iteration', 'predicate abstraction']"
13522,1303.6022,Zhe Zhang,"Zhe Zhang, Xudong Liu, Hailong Sun, Richong Zhang, Fei Wang",A Cooperation Model Towards the Federated Internet of Applications,,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As Internet is changing from network of data into network of functionalities,
a federated Internet of applications, that every application can cooperate with
each other smoothly, is a natural trending topic. However, existing integration
techniques did not pay enough attention to multiple control domains for
participants, i.e. application providers and end-users. In this study, we
advocate a global cooperation model for all the participants counts. In
particular, we propose a hybrid model to manage the cooperation among
applications to achieve more optimized allocation of efforts, which means users
perform lighter actions and application providers concerning less
uncontrollable information. In addition, we implement the required system and
show a case study which demonstrates the effectiveness of this model.
","[{'version': 'v1', 'created': 'Mon, 25 Mar 2013 03:44:53 GMT'}]",2013-03-26,"[['Zhang', 'Zhe', ''], ['Liu', 'Xudong', ''], ['Sun', 'Hailong', ''], ['Zhang', 'Richong', ''], ['Wang', 'Fei', '']]","['Internet of Applications', 'Multiple Participants', 'CooperationModel']"
13523,1607.02717,Manuel Mazzara,"Roman Bauer, Lukas Breitwieser, Alberto Di Meglio, Leonard Johard,
  Marcus Kaiser, Marco Manca, Manuel Mazzara, Max Talanov",The BioDynaMo Project,,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer simulations have become a very powerful tool for scientific
research. Given the vast complexity that comes with many open scientific
questions, a purely analytical or experimental approach is often not viable.
For example, biological systems (such as the human brain) comprise an extremely
complex organization and heterogeneous interactions across different spatial
and temporal scales. In order to facilitate research on such problems, the
BioDynaMo project (\url{https://biodynamo.web.cern.ch/}) aims at a general
platform for computer simulations for biological research. Since the scientific
investigations require extensive computer resources, this platform should be
executable on hybrid cloud computing systems, allowing for the efficient use of
state-of-the-art computing technology. This paper describes challenges during
the early stages of the software development process. In particular, we
describe issues regarding the implementation and the highly interdisciplinary
as well as international nature of the collaboration. Moreover, we explain the
methodologies, the approach, and the lessons learnt by the team during these
first stages.
","[{'version': 'v1', 'created': 'Sun, 10 Jul 2016 08:54:30 GMT'}]",2016-07-12,"[['Bauer', 'Roman', ''], ['Breitwieser', 'Lukas', ''], ['Di Meglio', 'Alberto', ''], ['Johard', 'Leonard', ''], ['Kaiser', 'Marcus', ''], ['Manca', 'Marco', ''], ['Mazzara', 'Manuel', ''], ['Talanov', 'Max', '']]","['Computer simulation', 'Biological development', 'Biological dynamics', 'Brain']"
13524,1108.4098,Firouz Wassai,"Firouz Abdullah Al-Wassai, N.V. Kalyankar, Ali A. Al-Zaky",Multisensor Images Fusion Based on Feature-Level,"Keywords: Image fusion, Feature, Edge Fusion, Segment Fusion, IHS,
  PCA","International Journal of Latest Technology in
  Engineering,Management & Applied Science (IJLTEMAS),Vol. I, Issue V, 2012,
  124-138",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Until now, of highest relevance for remote sensing data processing and
analysis have been techniques for pixel level image fusion. So, This paper
attempts to undertake the study of Feature-Level based image fusion. For this
purpose, feature based fusion techniques, which are usually based on empirical
or heuristic rules, are employed. Hence, in this paper we consider feature
extraction (FE) for fusion. It aims at finding a transformation of the original
space that would produce such new features, which preserve or improve as much
as possible. This study introduces three different types of Image fusion
techniques including Principal Component Analysis based Feature Fusion (PCA),
Segment Fusion (SF) and Edge fusion (EF). This paper also devotes to
concentrate on the analytical techniques for evaluating the quality of image
fusion (F) by using various methods including (SD), (En), (CC), (SNR), (NRMSE)
and (DI) to estimate the quality and degree of information improvement of a
fused image quantitatively.
","[{'version': 'v1', 'created': 'Sat, 20 Aug 2011 07:43:46 GMT'}]",2012-09-18,"[['Al-Wassai', 'Firouz Abdullah', ''], ['Kalyankar', 'N. V.', ''], ['Al-Zaky', 'Ali A.', '']]","['Image fusion', 'Feature', 'Edge Fusion', 'Segment Fusion', 'IHS', 'PCA']"
13525,1205.1986,Khalid Raza,Khalid Raza and Rafat Parveen,Evolutionary algorithms in genetic regulatory networks model,"10 pages, 3 figures and 1 table","Journal of Advanced Bioinformatics Applications and Research
  3(1):271-280, 2012",,,cs.CE q-bio.MN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Genetic Regulatory Networks (GRNs) plays a vital role in the understanding of
complex biological processes. Modeling GRNs is significantly important in order
to reveal fundamental cellular processes, examine gene functions and
understanding their complex relationships. Understanding the interactions
between genes gives rise to develop better method for drug discovery and
diagnosis of the disease since many diseases are characterized by abnormal
behaviour of the genes. In this paper we have reviewed various evolutionary
algorithms-based approach for modeling GRNs and discussed various opportunities
and challenges.
","[{'version': 'v1', 'created': 'Wed, 9 May 2012 14:04:35 GMT'}]",2012-05-10,"[['Raza', 'Khalid', ''], ['Parveen', 'Rafat', '']]","['Genetic regulatory network', 'reverse-engineering of genetic networks', 'network inference', 'evolutionary algorithms', 'genetic programming']"
13526,0705.4584,Stefan Johansson,Magnus Boman and Stefan J. Johansson,"Modeling Epidemic Spread in Synthetic Populations - Virtual Plagues in
  Massively Multiplayer Online Games","Accepted for presentation at Digital Games Research Association
  (DiGRA) conference in Tokyo in September 2007. All comments to the authors
  (mail addresses are in the paper) are welcome",,,,cs.CY cs.AI cs.MA,,"  A virtual plague is a process in which a behavior-affecting property spreads
among characters in a Massively Multiplayer Online Game (MMOG). The MMOG
individuals constitute a synthetic population, and the game can be seen as a
form of interactive executable model for studying disease spread, albeit of a
very special kind. To a game developer maintaining an MMOG, recognizing,
monitoring, and ultimately controlling a virtual plague is important,
regardless of how it was initiated. The prospect of using tools, methods and
theory from the field of epidemiology to do this seems natural and appealing.
We will address the feasibility of such a prospect, first by considering some
basic measures used in epidemiology, then by pointing out the differences
between real world epidemics and virtual plagues. We also suggest directions
for MMOG developer control through epidemiological modeling. Our aim is
understanding the properties of virtual plagues, rather than trying to
eliminate them or mitigate their effects, as would be in the case of real
infectious disease.
","[{'version': 'v1', 'created': 'Thu, 31 May 2007 12:15:05 GMT'}]",2007-06-01,"[['Boman', 'Magnus', ''], ['Johansson', 'Stefan J.', '']]","['Virtual Plagues', 'Digital Plague', 'Infectious Disease', 'Epidemiology', 'Synthetic Population']"
13527,1402.1257,Nishant Vadnere,"Nishant Vadnere, R.G.Mehta, D.P.Rana, N.J.Mistry and M.M.Raghuwanshi",Incremental classification using Feature Tree,"5 Pages, 1 figure, International conference on recent trends and
  innovations in engineering and technology - 2013 (ICRTIET-2013)",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, stream data have become an immensely growing area of
research for the database, computer science and data mining communities. Stream
data is an ordered sequence of instances. In many applications of data stream
mining data can be read only once or a small number of times using limited
computing and storage capabilities. Some of the issues occurred in classifying
stream data that have significant impact in algorithm development are size of
database, online streaming, high dimensionality and concept drift. The concept
drift occurs when the properties of the historical data and target variable
change over time abruptly in such a case that the predictions will become
inaccurate as time passes. In this paper the framework of incremental
classification is proposed to solve the issues for the classification of stream
data. The Trie structure based incremental feature tree, Trie structure based
incremental FP (Frequent Pattern) growth tree and tree based incremental
classification algorithm are introduced in the proposed framework.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2014 06:17:18 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Feb 2014 17:34:51 GMT'}]",2014-02-10,"[['Vadnere', 'Nishant', ''], ['Mehta', 'R. G.', ''], ['Rana', 'D. P.', ''], ['Mistry', 'N. J.', ''], ['Raghuwanshi', 'M. M.', '']]","['Stream Data', 'Trie', 'Discretization', 'Incremental Classification', 'Feature-Tree']"
13528,1506.01491,Tehreem Masood,"Tehreem Masood, Chantal Bonner Cherifi, N\'ejib Moalla",Service Networks Monitoring for better Quality of Service,"6 figures, 2tables, ICIST2015. 5th International Conference on
  Information Society and Techology, ICIST 2015",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today, the deployment of Web services in many enterprise applications has
gained much attention. Service network inhibits certain common properties as
they arise spontaneously and are subject to high fluctuation. The objective of
consumer is to compose services for stable business processes in coherence with
their legacy system capabilities and with better quality of services. For this
purpose we have proposed a dynamic decision model that integrates several
performance metrics and attributes to monitor the performance of service
oriented systems in order to ensure their sustainability. Based on the
available metrics, we have identified performance metrics criteria and
classified into categories like time based QoS, size based QoS, combined QoS
and estimated attributes. Then we have designed service network monitoring
ontology (SNM). Our decision model will take user query and SNM as input,
measures the performance capabilities and suggests some new performance
configurations like selected service is not available, physical resource is not
available and no maintenance will be available for the selected service for
composition.
","[{'version': 'v1', 'created': 'Thu, 4 Jun 2015 07:38:03 GMT'}]",2015-06-05,"[['Masood', 'Tehreem', ''], ['Cherifi', 'Chantal Bonner', ''], ['Moalla', 'Néjib', '']]","['Web Services', 'SOAP', 'Service-Oriented Architecture', 'Monitoring', 'Simulation', 'Quality of Service parameters', 'Performance', 'Decision model']"
13529,1106.2207,Maurice Pillet,"Barbara Lyonnet (SYMME), Maurice Pillet (SYMME), Magali Pralus (SYMME)","Optimisation de la taille de la s\'erie: illustration par un cas
  industriel de sous-traitance m\'ecanique",,"Congr\`es International de G\'enie Industriel CIGI'09, Tarbes :
  France (2009)",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reducing costs of manufactured products is one of the key issues of
companies. Bar turning companies (mechanical subcontracting companies) are
faced with the following dilemma: use a pull strategy or use a push strategy.
Instinctively these companies produce more than demand required by customers.
This strategy allows them to respond to requests forecasts and reduce their
cost of changeover time. These companies make a bet on sales opportunities and
think to realize an additional profit. We have tried to find in this study to
provide elements to know the limits of this strategy. Our proposal focuses on
developing a model to support the decision taking into account the mix of
opportunities, economic constraints and mean constraints. This model features
the particular importance of high rates of ownership and the risk of not
selling.
  R\'eduire les co\^uts de revient des produits fabriqu\'es est une des
probl\'ematiques essentielles des entreprises d'aujourd'hui. Les entreprises de
d\'ecolletage (entreprises de sous-traitance m\'ecanique) sont confront\'ees au
dilemme suivant : produire juste la demande client ou produire plus.
Instinctivement ces entreprises, dont les temps de changement de s\'erie sont
\'elev\'es, cherchent \`a produire plus que la demande exig\'ee par le client.
Cette strat\'egie leur permet de r\'epondre \`a des demandes pr\'evisionnelles
et r\'eduire ainsi le co\^ut de revient des produits. Ces entreprises
r\'ealisent un pari sur les opportunit\'es de vente et pensent r\'ealiser un
gain suppl\'ementaire en r\'ealisant des stocks. Nous avons cherch\'e dans
cette \'etude \`a fournir des \'el\'ements de d\'ecision pour conna\^itre les
limites de cette r\`egle de gestion. Notre proposition porte sur le
d\'eveloppement d'un mod\`ele d'aide \`a la d\'ecision prenant en
consid\'eration le mixte entre opportunit\'es commerciales, contraintes
\'economiques et contraintes de moyen. Ce mod\`ele souligne l'importance
particuli\`ere du taux de possession et du risque de non vente.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2011 06:07:42 GMT'}]",2011-06-14,"[['Lyonnet', 'Barbara', '', 'SYMME'], ['Pillet', 'Maurice', '', 'SYMME'], ['Pralus', 'Magali', '', 'SYMME']]","['batch size', 'pull strategy', 'push strategy', 'economic constraint', 'sales opportunities']"
13530,0805.0850,Michael Hilker,Michael Hilker and Christoph Schommer,"Service Oriented Architecture in Network Security - a novel Organisation
  in Security Systems",4 pages,"Proceedings of the 3rd International Workshop on Theory of
  Computer Viruses (TCV 2008), May 2008, Nancy, France",,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current network security systems are a collection of various security
components, which are directly installed in the operating system. These check
the whole node for suspicious behaviour. Armouring intrusions e.g. have the
ability to hide themselves from being checked. We present in this paper an
alternative organisation of security systems. The node is completely
virtualized with current virtualization systems so that the operating system
with applications and the security system is distinguished. The security system
then checks the node from outside and the right security components are
provided through a service oriented architecture. Due to the running in a
virtual machine, the infected nodes can be halted, duplicated, and moved to
other nodes for further analysis and legal aspects. This organisation is in
this article analysed and a preliminary implementation showing promising
results are discussed.
","[{'version': 'v1', 'created': 'Wed, 7 May 2008 14:13:32 GMT'}]",2008-05-08,"[['Hilker', 'Michael', ''], ['Schommer', 'Christoph', '']]","['Network Protection', 'Artificial Immune Systems', 'Bio-Inspired Computing', 'DistributedArchitectures', 'Information Management']"
13531,1205.4699,Leonardo Minora,"Leonardo Minora (DIMAp, IRISA (UBS)), J\'er\'emy Buisson (IRISA (UBS),
  INFO), Flavio Oquendo (IRISA (UBS)), Thais Batista (DIMAp)","Issues of Architectural Description Languages for Handling Dynamic
  Reconfiguration","6\`eme Conf\'erence francophone sur les architectures logicielles
  (CAL'2012), Montpellier : France (2012)",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dynamic reconfiguration is the action of modifying a software system at
runtime. Several works have been using architectural specification as the basis
for dynamic reconfiguration. Indeed ADLs (architecture description languages)
let architects describe the elements that could be reconfigured as well as the
set of constraints to which the system must conform during reconfiguration. In
this work, we investigate the ADL literature in order to illustrate how
reconfiguration is supported in four well-known ADLs: pi-ADL, ACME, C2SADL and
Dynamic Wright. From this review, we conclude that none of these ADLs: (i)
addresses the issue of consistently reconfiguring both instances and types;
(ii) takes into account the behaviour of architectural elements during
reconfiguration; and (iii) provides support for assessing reconfiguration,
e.g., verifying the transition against properties.
","[{'version': 'v1', 'created': 'Mon, 21 May 2012 19:20:01 GMT'}]",2012-05-22,"[['Minora', 'Leonardo', '', 'DIMAp, IRISA'], ['Buisson', 'Jérémy', '', 'IRISA'], ['Oquendo', 'Flavio', '', 'IRISA'], ['Batista', 'Thais', '', 'DIMAp']]","['dynamic reconfiguration', 'software architecture', 'architecturedescription language', 'ADL', 'π-ADL', 'ACME', 'C2SADL', 'Dynamic Wright']"
13532,1307.3216,Baisakh,"Baisakh, Chinmayee Mishra, Abhilipsa Pradhan","A Novel Grid Based Dynamic Energy Efficient Routing Approach for Highly
  Dense Mobile Ad Hoc Networks",,"International Journal of Ad hoc, Sensor & Ubiquitous Computing
  (IJASUC) Vol.4, No.3, June 2013",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We have proposed a novel Grid Based Dynamic Energy Efficient Routing (GBDEER)
approach which is aimed to construct an energy efficient path from source to
destination based on grid area, where each grid will have three deferent levels
of transmission power.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2013 19:02:20 GMT'}]",2013-07-12,"[['Baisakh', '', ''], ['Mishra', 'Chinmayee', ''], ['Pradhan', 'Abhilipsa', '']]","['Mobile Ad-hoc Networks', 'Routing Protocols', 'Energy Efficient Routing Protocols', 'GBDEER Protocol']"
13533,1712.05142,Linda Kleist,"Michael G. Dobbins and Linda Kleist and Tillmann Miltzow and Pawe{\l}
  Rz\k{a}\.zewski","Completeness for the Complexity Class $\forall \exists \mathbb{R}$ and
  Area-Universality","36 pages, 17 figures",,,,cs.CG cs.CC cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Exhibiting a deep connection between purely geometric problems and real
algebra, the complexity class $\exists \mathbb{R}$ plays a crucial role in the
study of geometric problems. Sometimes $\exists \mathbb{R}$ is referred to as
the 'real analog' of NP. While NP is a class of computational problems that
deals with existentially quantified boolean variables, $\exists \mathbb{R}$
deals with existentially quantified real variables.
  In analogy to $\Pi_2^p$ and $\Sigma_2^p$ in the famous polynomial hierarchy,
we study the complexity classes $\forall \exists \mathbb{R}$ and $\exists
\forall \mathbb{R}$ with real variables. Our main interest is the
area-universality problem, where we are given a plane graph $G$, and ask if for
each assignment of areas to the inner faces of $G$, there exists a
straight-line drawing of $G$ realizing the assigned areas. We conjecture that
area-universality is $\forall \exists \mathbb{R}$-complete and support this
conjecture by proving $\exists \mathbb{R}$- and $\forall \exists
\mathbb{R}$-completeness of two variants of area-universality. To this end, we
introduce tools to prove $\forall \exists \mathbb{R}$-hardness and membership.
Finally, we present geometric problems as candidates for $\forall \exists
\mathbb{R}$-complete problems. These problems have connections to the concepts
of imprecision, robustness, and extendability.
","[{'version': 'v1', 'created': 'Thu, 14 Dec 2017 09:42:24 GMT'}, {'version': 'v2', 'created': 'Sat, 6 Nov 2021 19:07:36 GMT'}, {'version': 'v3', 'created': 'Thu, 11 Nov 2021 19:13:45 GMT'}]",2021-11-15,"[['Dobbins', 'Michael G.', ''], ['Kleist', 'Linda', ''], ['Miltzow', 'Tillmann', ''], ['Rzążewski', 'Paweł', '']]","['complexity class', 'existential theory of the reals', 'universal existential theoryof the reals', 'planar graph', 'face area', 'area-universality']"
13534,1207.4265,Ibrahim Sabek,Ibrahim Sabek and Moustafa Youssef,"Spot: An accurate and efficient multi-entity device-free WLAN
  localization system","14 pages, 24 figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Device-free (DF) localization in WLANs has been introduced as a value-added
service that allows tracking indoor entities that do not carry any devices.
Previous work in DF WLAN localization focused on the tracking of a single
entity due to the intractability of the multi-entity tracking problem whose
complexity grows exponentially with the number of humans being tracked. In this
paper, we introduce Spot as an accurate and efficient system for multi-entity
DF detection and tracking. Spot is based on a probabilistic energy minimization
framework that combines a conditional random field with a Markov model to
capture the temporal and spatial relations between the entities' poses. A novel
cross-calibration technique is introduced to reduce the calibration overhead of
multiple entities to linear, regardless of the number of humans being tracked.
This also helps in increasing the system accuracy. We design the energy
minimization function with the goal of being efficiently solved in mind. We
show that the designed function can be mapped to a binary graph-cut problem
whose solution has a linear complexity on average and a third order polynomial
in the worst case. We further employ clustering on the estimated location
candidates to reduce outliers and obtain more accurate tracking. Experimental
evaluation in two typical testbeds, with a side-by-side comparison with the
state-of-the-art, shows that Spot can achieve a multi-entity tracking accuracy
of less than 1.1m. This corresponds to at least 36% enhancement in median
distance error over the state-of-the-art DF localization systems, which can
only track a single entity. In addition, Spot can estimate the number of
entities correctly to within one difference error. This highlights that Spot
achieves its goals of having an accurate and efficient software-only DF
tracking solution of multiple entities in indoor environments.
","[{'version': 'v1', 'created': 'Wed, 18 Jul 2012 04:57:22 GMT'}]",2012-07-19,"[['Sabek', 'Ibrahim', ''], ['Youssef', 'Moustafa', '']]","['Binary graph-cut', 'conditional random fields', 'device-freelocalization', 'energy minimization', 'Markov models', 'multientity tracking']"
13535,1704.08383,Qingyang Li,"Qingyang Li, Dajiang Zhu, Jie Zhang, Derrek Paul Hibar, Neda
  Jahanshad, Yalin Wang, Jieping Ye, Paul M. Thompson, Jie Wang","Large-scale Feature Selection of Risk Genetic Factors for Alzheimer's
  Disease via Distributed Group Lasso Regression",,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Genome-wide association studies (GWAS) have achieved great success in the
genetic study of Alzheimer's disease (AD). Collaborative imaging genetics
studies across different research institutions show the effectiveness of
detecting genetic risk factors. However, the high dimensionality of GWAS data
poses significant challenges in detecting risk SNPs for AD. Selecting relevant
features is crucial in predicting the response variable. In this study, we
propose a novel Distributed Feature Selection Framework (DFSF) to conduct the
large-scale imaging genetics studies across multiple institutions. To speed up
the learning process, we propose a family of distributed group Lasso screening
rules to identify irrelevant features and remove them from the optimization.
Then we select the relevant group features by performing the group Lasso
feature selection process in a sequence of parameters. Finally, we employ the
stability selection to rank the top risk SNPs that might help detect the early
stage of AD. To the best of our knowledge, this is the first distributed
feature selection model integrated with group Lasso feature selection as well
as detecting the risk genetic factors across multiple research institutions
system. Empirical studies are conducted on 809 subjects with 5.9 million SNPs
which are distributed across several individual institutions, demonstrating the
efficiency and effectiveness of the proposed method.
","[{'version': 'v1', 'created': 'Thu, 27 Apr 2017 00:02:34 GMT'}]",2017-04-28,"[['Li', 'Qingyang', ''], ['Zhu', 'Dajiang', ''], ['Zhang', 'Jie', ''], ['Hibar', 'Derrek Paul', ''], ['Jahanshad', 'Neda', ''], ['Wang', 'Yalin', ''], ['Ye', 'Jieping', ''], ['Thompson', 'Paul M.', ''], ['Wang', 'Jie', '']]","['Alzheimer’s Disease', 'GWAS', 'Image Genetics Studies', 'Feature Selection', 'Group Lasso', 'Large-scale Machine Learning']"
13536,1207.7103,John Whitbeck,"John Whitbeck, Marcelo Dias de Amorim, Vania Conan, Jean-Loup
  Guillaume",Temporal Reachability Graphs,In proceedings ACM Mobicom 2012,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While a natural fit for modeling and understanding mobile networks,
time-varying graphs remain poorly understood. Indeed, many of the usual
concepts of static graphs have no obvious counterpart in time-varying ones. In
this paper, we introduce the notion of temporal reachability graphs. A
(tau,delta)-reachability graph} is a time-varying directed graph derived from
an existing connectivity graph. An edge exists from one node to another in the
reachability graph at time t if there exists a journey (i.e., a spatiotemporal
path) in the connectivity graph from the first node to the second, leaving
after t, with a positive edge traversal time tau, and arriving within a maximum
delay delta. We make three contributions. First, we develop the theoretical
framework around temporal reachability graphs. Second, we harness our
theoretical findings to propose an algorithm for their efficient computation.
Finally, we demonstrate the analytic power of the temporal reachability graph
concept by applying it to synthetic and real-life datasets. On top of defining
clear upper bounds on communication capabilities, reachability graphs highlight
asymmetric communication opportunities and offloading potential.
","[{'version': 'v1', 'created': 'Mon, 30 Jul 2012 21:05:54 GMT'}]",2012-08-01,"[['Whitbeck', 'John', ''], ['de Amorim', 'Marcelo Dias', ''], ['Conan', 'Vania', ''], ['Guillaume', 'Jean-Loup', '']]","['Time-varying graphs', 'Reachability', 'Opportunistic networks', 'Communication performance bounds']"
13537,1504.07563,Olayinka Olafare,"Olayinka Olafare, Hani Parhizkar, Silas Vem",A New Secure Mobile Cloud Architecture,"15 Pages, 8 Figures, 9 Tables, A New Secure Mobile Cloud Architecture
  2015",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The demand and use of mobile phones, PDAs and smart phones are constantly on
the rise as such, manufacturers of these devices are improving the technology
and usability of these devices constantly. Due to the handy shape and size
these devices come in, their processing capabilities and functionalities, they
are preferred by many over the conventional desktop or laptop computers. Mobile
devices are being used today to perform most tasks that a desktop or laptop
computer could be used for. On this premise, mobile devices are also used to
connect to the resources of cloud computing hence, mobile cloud computing
(MCC). The seemingly ubiquitous and pervasive nature of most mobile devices has
made it acceptable and adequate to match the ubiquitous and pervasive nature of
cloud computing. Mobile cloud computing is said to have increased the
challenges known to cloud computing due to the security loop holes that most
mobile devices have.
","[{'version': 'v1', 'created': 'Sat, 25 Apr 2015 08:28:46 GMT'}]",2015-04-29,"[['Olafare', 'Olayinka', ''], ['Parhizkar', 'Hani', ''], ['Vem', 'Silas', '']]","['Mobile Cloud Computing (MCC)', 'Cloud Computing (CC)', 'Security Issue', 'Security Components', 'Secure Mobile Cloud Architecture']"
13538,0910.0456,Kamiar Rahnama Rad,Kamiar Rahnama Rad,Sharp Sufficient Conditions on Exact Sparsity Pattern Recovery,submitted to IEEE Trans. on Information Theory,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consider the $n$-dimensional vector $y=X\be+\e$, where $\be \in \R^p$ has
only $k$ nonzero entries and $\e \in \R^n$ is a Gaussian noise. This can be
viewed as a linear system with sparsity constraints, corrupted by noise. We
find a non-asymptotic upper bound on the probability that the optimal decoder
for $\beta$ declares a wrong sparsity pattern, given any generic perturbation
matrix $X$. In the case when $X$ is randomly drawn from a Gaussian ensemble, we
obtain asymptotically sharp sufficient conditions for exact recovery, which
agree with the known necessary conditions previously established.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2009 17:55:28 GMT'}, {'version': 'v2', 'created': 'Mon, 5 Oct 2009 16:35:40 GMT'}, {'version': 'v3', 'created': 'Tue, 13 Oct 2009 04:46:06 GMT'}]",2009-10-13,"[['Rad', 'Kamiar Rahnama', '']]","['Subset selection', 'compressive sensing', 'information theoretic bounds', 'random pro']"
13539,1208.1982,Ravi Tandon,Ravi Tandon,Determination Of Optimal Number Of Clusters In Wireless Sensor Networks,"18 pages, 14 figures","International Journal of Computer Networks & Communications
  (IJCNC) Vol.4, No.4, July 2012, 235-249",,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Prolonged network lifetime, scalability and efficient load balancing are
essential for optimal performance of a wireless sensor network. Clustering
provides an effective way of extending the lifetime of a sensor network.
Clustering is the process that divides sensor networks into smaller localized
group (called clusters) of members with a cluster head. Clustering protocols
need to elect optimal number of clusters in hierarchically structured wireless
sensor networks. Any clustering scheme that elects clusters uniformly
(irrespective of the distance from Base Station) incurs excessive energy usage
on clusters proximal and distant to Base Station. In single hop networks a
gradual increment in the energy depletion rate is observed as the distance from
the cluster head increases. This work focuses on the analysis of wasteful
energy consumption within a uniform cluster head election model (EPEM) and
provides an analytic solution to reduce the overall consumption of energy usage
amongst the clusters elected in a wireless sensor network. A circular model of
sensor network is considered, where the sensor nodes are deployed around a
centrally located Base Station. The sensor network is divided into several
concentric rings centred at the Base Station. A model, Unequal Probability
Election Model (UEPEM), which elects cluster heads non-uniformly is proposed.
The probability of cluster head election depends on the distance from the Base
Station. UEPEM reduces the overall energy usage by about 21% over EPEM. The
performance of UEPEM improves as the number of rings is increased.
","[{'version': 'v1', 'created': 'Thu, 9 Aug 2012 17:46:24 GMT'}]",2012-08-10,"[['Tandon', 'Ravi', '']]","['Wireless sensor networks', 'Ad-hoc networks', 'clustering']"
13540,1604.08137,Valmir C. Barbosa,"Fabiano de S. Oliveira, Valmir C. Barbosa",On the mediation of program allocation in high-demand environments,This version addresses a few minor issues and fixes a derivative,,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we challenge the widely accepted premise that, in order to
carry out a distributed computation, say on the cloud, users have to inform,
along with all the inputs that the algorithm in use requires, the number of
processors to be used. We discuss the complicated nature of deciding the value
of such parameter, should it be chosen optimally, and propose the alternative
scenario in which this choice is passed on to the server side for automatic
determination. We show that the allocation problem arising from this
alternative is NP-hard only weakly, being therefore solvable in
pseudo-polynomial time. In our proposal, one key component on which the
automatic determination of the number of processors is based is the cost model.
The one we use, which is being increasingly adopted in the wake of the
cloud-computing movement, posits that each single execution of a program is to
be subject to current circumstances on both user and server side, and as such
be priced independently of all others. Running through our proposal is thus a
critique of the established common sense that sizing a set of processors to
handle a submission to some provider is entirely up to the user.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2016 16:48:45 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Apr 2016 17:43:43 GMT'}, {'version': 'v3', 'created': 'Mon, 6 May 2019 17:48:56 GMT'}, {'version': 'v4', 'created': 'Fri, 20 Sep 2019 17:22:17 GMT'}]",2019-09-23,"[['Oliveira', 'Fabiano de S.', ''], ['Barbosa', 'Valmir C.', '']]","['Cloud computing', 'Distributed computing', 'Program allocation']"
13541,1506.00290,Ilan Komargodski,Yael Tauman Kalai and Ilan Komargodski,Compressing Communication in Distributed Protocols,21 pages + 1 title page,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show how to compress communication in selection protocols, where the goal
is to agree on a sequence of random bits using only a broadcast channel. More
specifically, we present a generic method for converting any selection
protocol, into another selection protocol where each message is ``short'' while
preserving the same number of rounds, the same output distribution, and the
same resilience to error. Assuming that the output of the protocol lies in some
universe of size $M$, in our resulting protocol each message consists of only
$\mathsf{polylog}(M,n,d)$ many bits, where $n$ is the number of parties and $d$
is the number of rounds. Our transformation works in the presence of either
static or adaptive Byzantine faults.
  As a corollary, we conclude that for any $\mathsf{poly}(n)$-round collective
coin-flipping protocol, leader election protocol, or general selection
protocols, messages of length $\mathsf{polylog}(n)$ suffice (in the presence of
either static or adaptive Byzantine faults).
","[{'version': 'v1', 'created': 'Sun, 31 May 2015 21:00:39 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Aug 2015 10:18:20 GMT'}, {'version': 'v3', 'created': 'Thu, 10 May 2018 19:14:51 GMT'}]",2018-05-14,"[['Kalai', 'Yael Tauman', ''], ['Komargodski', 'Ilan', '']]","['Communication complexity', 'compression', 'coin-flipping']"
13542,1701.04290,Nadir Durrani Dr,"Nadeem Jadoon Khan, Waqas Anwar, Nadir Durrani",Machine Translation Approaches and Survey for Indian Languages,,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, we present an analysis regarding the performance of the
state-of-art Phrase-based Statistical Machine Translation (SMT) on multiple
Indian languages. We report baseline systems on several language pairs. The
motivation of this study is to promote the development of SMT and linguistic
resources for these language pairs, as the current state-of-the-art is quite
bleak due to sparse data resources. The success of an SMT system is contingent
on the availability of a large parallel corpus. Such data is necessary to
reliably estimate translation probabilities. We report the performance of
baseline systems translating from Indian languages (Bengali, Guajarati, Hindi,
Malayalam, Punjabi, Tamil, Telugu and Urdu) into English with average 10%
accurate results for all the language pairs.
","[{'version': 'v1', 'created': 'Mon, 16 Jan 2017 13:55:01 GMT'}]",2017-01-17,"[['Khan', 'Nadeem Jadoon', ''], ['Anwar', 'Waqas', ''], ['Durrani', 'Nadir', '']]","['Statistical Machine Translation (SMT)', 'Parallel Corpus', 'Natural Language Processing (NLP)', 'Phrase-based Translation']"
13543,1306.4624,Charles Morisset,"Andreas Griesmayer, Charles Morisset",Automated Certification of Authorisation Policy Resistance,"20 pages, 4 figures, version including proofs of the paper that will
  be presented at ESORICS 2013",,,,cs.CR cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Attribute-based Access Control (ABAC) extends traditional Access Control by
considering an access request as a set of pairs attribute name-value, making it
particularly useful in the context of open and distributed systems, where
security relevant information can be collected from different sources. However,
ABAC enables attribute hiding attacks, allowing an attacker to gain some access
by withholding information. In this paper, we first introduce the notion of
policy resistance to attribute hiding attacks. We then propose the tool ATRAP
(Automatic Term Rewriting for Authorisation Policies), based on the recent
formal ABAC language PTaCL, which first automatically searches for resistance
counter-examples using Maude, and then automatically searches for an Isabelle
proof of resistance. We illustrate our approach with two simple examples of
policies and propose an evaluation of ATRAP performances.
","[{'version': 'v1', 'created': 'Wed, 19 Jun 2013 17:35:43 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Jun 2013 10:33:43 GMT'}]",2013-06-21,"[['Griesmayer', 'Andreas', ''], ['Morisset', 'Charles', '']]","['Attribute-based Access Control', 'Monotonicity', 'Attributehiding', 'Model Checking', 'Proof assistant']"
13544,1705.05893,Indrasen Bhattacharya,"Brett Kelly, Indrasen Bhattacharya, Maxim Shusteff, Robert M. Panas,
  Hayden K. Taylor, Christopher M. Spadaccini","Computed Axial Lithography (CAL): Toward Single Step 3D Printing of
  Arbitrary Geometries","10 pages, 17 figure, ACM SIGGRAPH format",,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most additive manufacturing processes today operate by printing voxels (3D
pixels) serially point-by-point to build up a 3D part. In some more
recently-developed techniques, for example optical printing methods such as
projection stereolithography [Zheng et al. 2012], [Tumbleston et al. 2015],
parts are printed layer-by-layer by curing full 2d (very thin in one dimension)
layers of the 3d part in each print step. There does not yet exist a technique
which is able to print arbitrarily-defined 3D geometries in a single print
step. If such a technique existed, it could be used to expand the range of
printable geometries in additive manufacturing and relax constraints on factors
such as overhangs in topology optimization. It could also vastly increase print
speed for 3D parts. In this work, we develop the principles for an approach for
single exposure 3D printing of arbitrarily defined geometries. The approach,
termed Computed Axial Lithgography (CAL), is based on tomographic
reconstruction, with mathematical optimization to generate a set of projections
to optically define an arbitrary dose distribution within a target volume. We
demonstrate the potential ability of the technique to print 3D parts using a
prototype CAL system based on sequential illumination from many angles. We also
propose new hardware designs which will help us to realize true single-shot
arbitrary-geometry 3D CAL.
","[{'version': 'v1', 'created': 'Tue, 16 May 2017 19:56:58 GMT'}]",2017-05-18,"[['Kelly', 'Brett', ''], ['Bhattacharya', 'Indrasen', ''], ['Shusteff', 'Maxim', ''], ['Panas', 'Robert M.', ''], ['Taylor', 'Hayden K.', ''], ['Spadaccini', 'Christopher M.', '']]","['Stereolithography', 'Additive Manufacturing', 'Computed Tomography']"
13545,1410.4453,Kato Mivule,"Kato Mivule, Benjamin Harvey, Crystal Cobb, and Hoda El Sayed","A Review of CUDA, MapReduce, and Pthreads Parallel Computing Models","10 Pages, 18 Figures",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The advent of high performance computing (HPC) and graphics processing units
(GPU), present an enormous computation resource for Large data transactions
(big data) that require parallel processing for robust and prompt data
analysis. While a number of HPC frameworks have been proposed, parallel
programming models present a number of challenges, for instance, how to fully
utilize features in the different programming models to implement and manage
parallelism via multi-threading in both CPUs and GPUs. In this paper, we take
an overview of three parallel programming models, CUDA, MapReduce, and
Pthreads. The goal is to explore literature on the subject and provide a high
level view of the features presented in the programming models to assist high
performance users with a concise understanding of parallel programming concepts
and thus faster implementation of big data projects using high performance
computing.
","[{'version': 'v1', 'created': 'Thu, 16 Oct 2014 14:44:02 GMT'}]",2014-10-17,"[['Mivule', 'Kato', ''], ['Harvey', 'Benjamin', ''], ['Cobb', 'Crystal', ''], ['Sayed', 'Hoda El', '']]","['Parallel programming models', 'GPUs', 'Big data', 'CUDA', 'MapReduce', 'Pthreads']"
13546,1606.04288,Polyvios Pratikakis,"Alexandros Labrineas, Polyvios Pratikakis, Dimitrios S. Nikolopoulos,
  Angelos Bilas",BDDT-SCC: A Task-parallel Runtime for Non Cache-Coherent Multicores,,,,,cs.DC cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents BDDT-SCC, a task-parallel runtime system for non
cache-coherent multicore processors, implemented for the Intel Single-Chip
Cloud Computer. The BDDT-SCC runtime includes a dynamic dependence analysis and
automatic synchronization, and executes OpenMP-Ss tasks on a non cache-coherent
architecture. We design a runtime that uses fast on-chip inter-core
communication with small messages. At the same time, we use non coherent shared
memory to avoid large core-to-core data transfers that would incur a high
volume of unnecessary copying. We evaluate BDDT-SCC on a set of representative
benchmarks, in terms of task granularity, locality, and communication. We find
that memory locality and allocation plays a very important role in performance,
as the architecture of the SCC memory controllers can create strong contention
effects. We suggest patterns that improve memory locality and thus the
performance of applications, and measure their impact.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2016 10:09:42 GMT'}]",2016-06-15,"[['Labrineas', 'Alexandros', ''], ['Pratikakis', 'Polyvios', ''], ['Nikolopoulos', 'Dimitrios S.', ''], ['Bilas', 'Angelos', '']]","['Scheduling', 'Task Parallelism', 'Runtime System', 'Distributed Memory']"
13547,1510.06883,Paolo Giulio Franciosa,"Nicola Apollonio, Paolo Giulio Franciosa",On Computing the Galois Lattice of Bipartite Distance Hereditary Graphs,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The class of Bipartite Distance Hereditary (BDH) graphs is the intersection
between bipartite domino-free and chordal bipartite graphs.\ Graphs in both the
latter classes have linearly many maximal bicliques, implying the existence of
polynomial-time algorithms for computing the associated Galois lattice.\ Such a
lattice can indeed be built in $O(m\times n)$ worst case-time for a domino-free
graph with $m$ edges and $n$ vertices.\ In this paper we give a sharp estimate
on the number of the maximal bicliques of BDH graphs and exploit such result to
give an $O(m)$ worst case time algorithm for computing the Galois lattice of
BDH graphs. By relying on the fact that neighborhoods of vertices of BDH graphs
can be realized as directed paths in a arborescence, we give an $O(n)$
worst-case space and time encoding of both the input graph and its Galois
lattice, provided that the reverse of a Bandelt and Mulder building sequence is
given.
","[{'version': 'v1', 'created': 'Fri, 23 Oct 2015 10:35:14 GMT'}]",2015-10-26,"[['Apollonio', 'Nicola', ''], ['Franciosa', 'Paolo Giulio', '']]","['Bipartite graphs', 'distance hereditary graphs', 'maximal bicliques', 'Galois lattices']"
13548,1506.01872,Jie Fan,Jie Fan,Logics of Essence and Accident,"under submission. arXiv admin note: substantial text overlap with
  arXiv:1505.03950",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the literature, essence is formalized in two different ways, either de
dicto, or de re. Following \cite{Marcos:2005}, we adopt its de dicto
formalization: a formula is essential, if once it is true, it is necessarily
true; otherwise, it is accidental. In this article, we study the model theory
and axiomatization of the logic of essence and accident, i.e. the logic with
essence operator (or accident operator) as the only primitive modality. We show
that the logic of essence and accident is less expressive than modal logic on
non-reflexive models, but the two logics are equally expressive on reflexive
models. We prove that some frame properties are undefinable in the logic of
essence and accident, while some are. We propose the suitable bisimulation for
this logic, based on which we characterize the expressive power of this logic
within modal logic and within first-order logic. We axiomatize this logic over
various frame classes, among which the symmetric case is missing, and our
method is more suitable than those in the literature. We also find a method to
compute certain axioms used to axiomatize this logic over special frames in the
literature. As a side effect, we answer some open questions raised in
\cite{Marcos:2005}.
","[{'version': 'v1', 'created': 'Fri, 5 Jun 2015 11:33:42 GMT'}]",2015-06-08,"[['Fan', 'Jie', '']]","['essence', 'accident', 'expressivity', 'frame definability', 'bisimulation', 'axiomatization']"
13549,1504.01861,Balaji Dhanasekaran,"R.D. Balaji, Fatma Al-Mahri, Tarek Al-Fatnaasi",Social Impact of MOOC's in Oman Higher Education,"ICOET 2015, Oman",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The word E transformed everything is this world, as well as the whole globe
itself. To a great extend this helps for eco friendly green world. In
educational field, electronic medium has played a major role. It influenced and
changed almost every component of it to electronic medium like e-book, online
courses, etc. Throughout the world, leading universities are offering online
courses voluntarily. Generally we refer to it as Massive Online Open Courses
(MOOCs). There are many debates going on related to success and consequences of
MOOCs. Many are highlighting that these courses are self-paced, economical, and
provide quality training to all irrespective of geographical constraints. But
many other academic people go against these points and keep listing many other
disadvantages of MOOCs. This paper explores the basics of MOOCs at the initial
section. Following section will deal with advantages and disadvantages of MOOCs
in general. We the researchers collected the details about the awareness of
MOOCs among teachers and students in a higher education institution in Oman. We
have also collected the details about MOOCs implementation and usage within
Oman educational society. Based on the collected information, we have evaluated
and presented the findings about MOOCs impact in Oman higher education. We have
felt that doing appropriate improvements in MOOCs may become an imperative
medium in Oman educational institutions. The suggestions are listed in the
discussion and recommendation section.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2015 08:12:45 GMT'}]",2015-04-09,"[['Balaji', 'R. D.', ''], ['Al-Mahri', 'Fatma', ''], ['Al-Fatnaasi', 'Tarek', '']]","['MOOC', 'ICT', 'Higher Education', 'Flipped Classroom', 'M-Learning', 'E-Learning']"
13550,1505.06701,Alexandre Luna PhD,"Alexandre J.H. de O. Luna, Philippe Kruchten, and Hermano P. de Moura",Agile Governance Theory: conceptual development,"Conference Proceedings of 12th International Conference on Management
  of Technology and Information Systems, 22 pages, 8 figures. In 12th
  International Conference on Management of Technology and Information Systems.
  Sao Paulo: FEA-USP",,,"2423-14033-1-PB, FEA-USP, Sao Paulo, SP, Brazil",cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Competitiveness is the key to a sustainable development and it
demands agility at the business and organizational levels, which in turn
requires a flexible and customizable IT environment and effective and
responsive governance in order to deliver value to the business. Objective:
This paper describes the conceptual development of a theory for analyze and
describe agile governance in order to increasing the success rate of their
practice, achieving organizational performance and business competitiveness.
Method: We adopt a multi-method research, framing the theory conceptual
development using Dubin's method of theory building. Results: We have developed
a conceptual framework of the theory encompassing its constructs, laws of
interaction, boundaries and system states. Conclusion: This theory can provide
a better understanding of the nature of agile governance, by mapping of its
constructs, mediators, moderators and disturbing factors, in order to help
organizations reach better results.
","[{'version': 'v1', 'created': 'Mon, 25 May 2015 17:42:42 GMT'}]",2015-05-26,"[['Luna', 'Alexandre J. H. de O.', ''], ['Kruchten', 'Philippe', ''], ['de Moura', 'Hermano P.', '']]","['Information Systems', 'Agile Governance', 'IT Management', 'Project Management', 'Software Engineering']"
13551,1111.2259,Giovanni Viglietta,"Alberto Bandettini, Fabio Luporini, Giovanni Viglietta",A Survey on Open Problems for Mobile Robots,"28 pages, 4 figures",,,,cs.RO cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Gathering mobile robots is a widely studied problem in robotic research. This
survey first introduces the related work, summarizing models and results. Then,
the focus shifts on the open problem of gathering fat robots. In this context,
""fat"" means that the robot is not represented by a point in a bidimensional
space, but it has an extent. Moreover, it can be opaque in the sense that other
robots cannot ""see through"" it. All these issues lead to a redefinition of the
original problem and an extension of the CORDA model. For at most 4 robots an
algorithm is provided in the literature, but is gathering always possible for
n>4 fat robots? Another open problem is considered: Boundary Patrolling by
mobile robots. A set of mobile robots with constraints only on speed and
visibility is working in a polygonal environment having boundary and possibly
obstacles. The robots have to perform a perpetual movement (possibly within the
environment) so that the maximum timespan in which a point of the boundary is
not being watched by any robot is minimized.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2011 10:59:41 GMT'}]",2011-11-10,"[['Bandettini', 'Alberto', ''], ['Luporini', 'Fabio', ''], ['Viglietta', 'Giovanni', '']]","['gathering', 'mobile', 'fat', 'opaque', 'robots', 'CORDA', 'boundary patrolling']"
13552,1111.5684,Loet Leydesdorff,"Michelina Venditti, Emanuela Reale, and Loet Leydesdorff","The Disclosure of University Research for Third Parties: A Non-Market
  Perspective on an Italian University",Science and Public Policy (in press; 2013),,,,cs.CY cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nations, universities, and regional governments commit resources to promote
the dissemination of scientific and technical knowledge. One focuses on
knowledge-based innovations and the economic function of the university in
terms of technology transfer, intellectual property,
university-industry-government relations, etc. Faculties other than engineering
or applied sciences, however, may not be able to recognize opportunities in
this ""linear model"" of technology transfer. We elaborate a non-market
perspective on the third mission in terms of disclosure of the knowledge and
areas of expertise available for disclosure to other audiences at a provincial
university. The use of ICT can enhance communication between actors on the
supply and demand sides. Using an idea originally developed in the context of
the Dutch science shops, the university staff was questionnaired about keywords
and areas of expertise with the specific purpose of disclosing this information
to audiences other than academic colleagues. The results were brought online in
a thesaurus-like structure that enables users to access the university at the
level of individual email address. This model stimulates variation on both the
supply and demand side of the innovation process, and strengthens the
accessibility and embeddedness of the knowledge base in a regional economy.
","[{'version': 'v1', 'created': 'Thu, 24 Nov 2011 07:05:29 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Feb 2013 11:12:44 GMT'}]",2013-02-12,"[['Venditti', 'Michelina', ''], ['Reale', 'Emanuela', ''], ['Leydesdorff', 'Loet', '']]","['Third Mission', 'disclosure', 'research expertise', 'innovation', 'transfer']"
13553,1301.0669,Guanghui Zhang,"Guanghui Zhang, Bocong Chen",Constacyclic Codes over $F_p+vF_p$,12 pages,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study constacyclic codes over $F_p+vF_p$, where $p$ is an
odd prime and $v^2=v$. The polynomial generators of all constacyclic codes over
$F_p+vF_p$ are characterized and their dual codes are also determined.
","[{'version': 'v1', 'created': 'Fri, 4 Jan 2013 04:02:13 GMT'}]",2013-01-07,"[['Zhang', 'Guanghui', ''], ['Chen', 'Bocong', '']]","['Constacyclic code', 'polynomial generator', 'generating setin standard form']"
13554,1206.6722,Andrew Clark,Andrew Clark,"Piecewise Linear Topology, Evolutionary Algorithms, and Optimization
  Problems","PDF from Word docx, 11 pages, no figures",,,,cs.NE math.GN math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Schemata theory, Markov chains, and statistical mechanics have been used to
explain how evolutionary algorithms (EAs) work. Incremental success has been
achieved with all of these methods, but each has been stymied by limitations
related to its less-than-global view. We show that moving the investigation
into topological space improves our understanding of why EAs work.
","[{'version': 'v1', 'created': 'Thu, 28 Jun 2012 15:13:37 GMT'}]",2012-06-29,"[['Clark', 'Andrew', '']]","['Piecewise linear topology', 'convex optimization', 'Borel algebra', 'stochastic']"
13555,1409.6856,Julia Padberg,Julia Padberg,"Reconfigurable Decorated PT Nets with Inhibitor Arcs and Transition
  Priorities",,,,,cs.LO cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we deal with additional control structures for decorated PT
Nets. The main contribution are inhibitor arcs and priorities. The first ensure
that a marking can inhibit the firing of a transition. Inhibitor arcs force
that the transition may only fire when the place is empty. an order of
transitions restrict the firing, so that an transition may fire only if it has
the highest priority of all enabled transitions. This concept is shown to be
compatible with reconfigurable Petri nets.
","[{'version': 'v1', 'created': 'Wed, 24 Sep 2014 08:30:53 GMT'}]",2014-09-25,"[['Padberg', 'Julia', '']]","['reconfigurable Petri nets', 'decorated Petri nets', 'category of partiallyordered sets', 'inhibitor arcs', 'transition priorities']"
13556,1304.7073,Dr Brij Gupta,"Priyanka Negi, Anupama Mishra, B. B. Gupta","Enhanced CBF Packet Filtering Method to Detect DDoS Attack in Cloud
  Computing Environment",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tremendous and extraordinary growths in the field of internet, intranet,
extranet and its users have developed an innovative era of great global
competition and contention. Denial of service attack by multiple nodes is
accomplished of disturbing the services of rival servers. The attack can be for
multiple reasons. So it is a major threat for cloud environment. Due to low
effectiveness and large storage conventional defending approaches cannot be
easily applied in cloud security. The effects of various attacks can decrease
the influence of a cloud. So, in view of this challenge task, this paper aims
at enhancing a proposed method for cloud security. We propose a modification to
the confidence Based Filtering method (CBF) which is investigated for cloud
computing environment based on correlation pattern to mitigate DDoS attacks on
Cloud. The modification introduces nominal additional bandwidth and tries to
increase the processing speed of the victim initiated server.
","[{'version': 'v1', 'created': 'Fri, 26 Apr 2013 06:08:48 GMT'}]",2013-04-29,"[['Negi', 'Priyanka', ''], ['Mishra', 'Anupama', ''], ['Gupta', 'B. B.', '']]","['Cloud Computing', 'Cloud Security', 'DDoS attacks', 'Filtering Method', 'Correlation Pattern']"
13557,1008.3346,Md. Saiful Islam,"Md. Saiful Islam, Md. Haider Ali",A Miniature-Based Image Retrieval System,"9 pages, 4 figures, 4 tables","Dhaka University Journal of Science,Vol. 57, No. 2, pp. 187-191,
  July 2009",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the rapid development of World Wide Web (WWW) and imaging technology,
more and more images are available in the Internet and stored in databases.
Searching the related images by the querying image is becoming tedious and
difficult. Most of the images on the web are compressed by methods based on
discrete cosine transform (DCT) including Joint Photographic Experts
Group(JPEG) and H.261. This paper presents an efficient content-based image
indexing technique for searching similar images using discrete cosine transform
features. Experimental results demonstrate its superiority with the existing
techniques.
","[{'version': 'v1', 'created': 'Thu, 19 Aug 2010 16:38:35 GMT'}]",2010-08-20,"[['Islam', 'Md. Saiful', ''], ['Ali', 'Md. Haider', '']]","['CBIR', 'DCT', 'DC Image', 'MRDCT', 'Miniature', 'Similarity Searching']"
13558,1109.0752,Huaxi Gu,"Jing Zhang, Huaxi Gu, Yintang Yang",An improved distributed routing algorithm for Benes based optical NoC,"6 pages, 3 figures",,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Integrated optical interconnect is believed to be one of the main
technologies to replace electrical wires. Optical Network-on-Chip (ONoC) has
attracted more attentions nowadays. Benes topology is a good choice for ONoC
for its rearrangeable non-blocking character, multistage feature and easy
scalability. Routing algorithm plays an important role in determining the
performance of ONoC. But traditional routing algorithms for Benes network are
not suitable for ONoC communication, we developed a new distributed routing
algorithm for Benes ONoC in this paper. Our algorithm selected the routing path
dynamically according to network condition and enables more path choices for
the message traveling in the network. We used OPNET to evaluate the performance
of our routing algorithm and also compared it with a well-known bit-controlled
routing algorithm. ETE delay and throughput were showed under different packet
length and network sizes. Simulation results show that our routing algorithm
can provide better performance for ONoC.
","[{'version': 'v1', 'created': 'Sun, 4 Sep 2011 20:02:53 GMT'}]",2011-09-06,"[['Zhang', 'Jing', ''], ['Gu', 'Huaxi', ''], ['Yang', 'Yintang', '']]","['Optical NoC', 'Benes network', 'distributed routing algorithm', 'bit-controlled routing algorithm']"
13559,0802.1393,Clement Jonquet,"Cl\'ement Jonquet (LIRMM), Stefano A. Cerri (LIRMM)","Les Agents comme des interpr\'eteurs Scheme : Sp\'ecification dynamique
  par la communication",,"Dans 14\`eme Congr\`es Francophone AFRIF-AFIA de Reconnaissance
  des Formes et Intelligence Artificielle - RFIA'04, Toulouse : France (2004)",,,cs.MA cs.AI,,"  We proposed in previous papers an extension and an implementation of the
STROBE model, which regards the Agents as Scheme interpreters. These Agents are
able to interpret messages in a dedicated environment including an interpreter
that learns from the current conversation therefore representing evolving
meta-level Agent's knowledge. When the Agent's interpreter is a
nondeterministic one, the dialogues may consist of subsequent refinements of
specifications in the form of constraint sets. The paper presents a worked out
example of dynamic service generation - such as necessary on Grids - by
exploiting STROBE Agents equipped with a nondeterministic interpreter. It shows
how enabling dynamic specification of a problem. Then it illustrates how these
principles could be effective for other applications. Details of the
implementation are not provided here, but are available.
","[{'version': 'v1', 'created': 'Mon, 11 Feb 2008 08:55:46 GMT'}]",2008-02-12,"[['Jonquet', 'Clément', '', 'LIRMM'], ['Cerri', 'Stefano A.', '', 'LIRMM']]","['Agent communication', 'message dynamic interpretation', 'nondeterministic interpretation', 'STROBE model', 'ACL', 'dynamic specification', 'constraints', 'dialogue']"
13560,1710.02973,Panagiotis Papadakos,"Alexandros Papangelis, Panagiotis Papadakos, Margarita Kotti, Yannis
  Stylianou, Yannis Tzitzikas, Dimitris Plexousakis","LD-SDS: Towards an Expressive Spoken Dialogue System based on
  Linked-Data","Presented in Search Oriented Conversational AI SCAI 17 Workshop,
  Co-located with ICTIR 17, 2017",,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we discuss the related challenges and describe an approach
towards the fusion of state-of-the-art technologies from the Spoken Dialogue
Systems (SDS) and the Semantic Web and Information Retrieval domains. We
envision a dialogue system named LD-SDS that will support advanced, expressive,
and engaging user requests, over multiple, complex, rich, and open-domain data
sources that will leverage the wealth of the available Linked Data.
Specifically, we focus on: a) improving the identification, disambiguation and
linking of entities occurring in data sources and user input; b) offering
advanced query services for exploiting the semantics of the data, with
reasoning and exploratory capabilities; and c) expanding the typical
information seeking dialogue model (slot filling) to better reflect real-world
conversational search scenarios.
","[{'version': 'v1', 'created': 'Mon, 9 Oct 2017 07:36:18 GMT'}]",2017-10-10,"[['Papangelis', 'Alexandros', ''], ['Papadakos', 'Panagiotis', ''], ['Kotti', 'Margarita', ''], ['Stylianou', 'Yannis', ''], ['Tzitzikas', 'Yannis', ''], ['Plexousakis', 'Dimitris', '']]","['Spoken Dialogue Systems', 'Semantic Web', 'Linked Data', 'Advanced Query Services', 'Exploratory Search']"
13561,1511.06660,Bjarke Felbo,"Bjarke Felbo, P{\aa}l Sunds{\o}y, Alex 'Sandy' Pentland, Sune Lehmann,
  Yves-Alexandre de Montjoye","Modeling the Temporal Nature of Human Behavior for Demographics
  Prediction","Accepted at ECML 2017. A previous version of this paper was titled
  'Using Deep Learning to Predict Demographics from Mobile Phone Metadata' and
  was accepted at the ICLR 2016 workshop",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile phone metadata is increasingly used for humanitarian purposes in
developing countries as traditional data is scarce. Basic demographic
information is however often absent from mobile phone datasets, limiting the
operational impact of the datasets. For these reasons, there has been a growing
interest in predicting demographic information from mobile phone metadata.
Previous work focused on creating increasingly advanced features to be modeled
with standard machine learning algorithms. We here instead model the raw mobile
phone metadata directly using deep learning, exploiting the temporal nature of
the patterns in the data. From high-level assumptions we design a data
representation and convolutional network architecture for modeling patterns
within a week. We then examine three strategies for aggregating patterns across
weeks and show that our method reaches state-of-the-art accuracy on both age
and gender prediction using only the temporal modality in mobile metadata. We
finally validate our method on low activity users and evaluate the modeling
assumptions.
","[{'version': 'v1', 'created': 'Fri, 20 Nov 2015 16:07:21 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Nov 2015 17:13:22 GMT'}, {'version': 'v3', 'created': 'Thu, 7 Jan 2016 21:00:39 GMT'}, {'version': 'v4', 'created': 'Sat, 13 Feb 2016 14:08:15 GMT'}, {'version': 'v5', 'created': 'Wed, 15 Nov 2017 18:06:50 GMT'}]",2017-11-16,"[['Felbo', 'Bjarke', ''], ['Sundsøy', 'Pål', ''], ['Pentland', ""Alex 'Sandy'"", ''], ['Lehmann', 'Sune', ''], ['de Montjoye', 'Yves-Alexandre', '']]","['Call detail records', 'mobile phone metadata', 'temporal patterns', 'user modeling', 'demographics prediction']"
13562,1602.07729,Takeharu Shiraga,Takeharu Shiraga,"The Cover Time of Deterministic Random Walks for General Transition
  Probabilities",,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The deterministic random walk is a deterministic process analogous to a
random walk. While there are some results on the cover time of the rotor-router
model, which is a deterministic random walk corresponding to a simple random
walk, nothing is known about the cover time of deterministic random walks
emulating general transition probabilities. This paper is concerned with the
SRT-router model with multiple tokens, which is a deterministic process coping
with general transition probabilities possibly containing irrational numbers.
For the model, we give an upper bound of the cover time, which is the first
result on the cover time of deterministic random walks for general transition
probabilities. Our upper bound also improves the existing bounds for the
rotor-router model in some cases.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2016 22:15:58 GMT'}, {'version': 'v2', 'created': 'Fri, 13 May 2016 04:43:37 GMT'}]",2016-05-16,"[['Shiraga', 'Takeharu', '']]","['rotor router model', 'stack walk', 'multiple random walk', 'mixing time', 'cover time']"
13563,1107.4376,Alejandro Vaisman Dr.,Maria Teresa Noguera,Enhancing Knowledge Sharing Between Educational Portals,27 pages. Typos corrected,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information and knowledge in exchange in public networks is a crucial
challenge that needs to be overcome in order to consolidate the benefits
associated with such structures. We study the impact of the nature of the
information exchanged over the possibilities of success of this process, basing
ourselves on the analysis of the information produced by the members of the
Network of National Educational Portals. One of the main challenges that the
Network of National Educational Portals faces consists in finding effective
ways of sharing information that can promote knowledge transfer between members
of the network. We argue that a key factor that prevents information sharing is
the use of performance metrics by portal responsibles to evaluate the results
of their decisions. These metrics are highly sensitive, context-dependent, and
produced through non-standardized methods, all of which reduce the willingness
of knowledge sharing. We present a different approach: based on the Network of
National Educational Portals case, we propose creating a comprehensive
information system aimed at providing reliable and timely information in a
systematic fashion. We believe that adopting standardized procedures and
indicators of less sensitive nature, we can produce information for all
partners without the shortcomings of the usual practices.
","[{'version': 'v1', 'created': 'Wed, 20 Jul 2011 14:23:47 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Jul 2011 09:46:21 GMT'}]",2011-07-26,"[['Noguera', 'Maria Teresa', '']]","['Educational portals', 'information sharing', 'transnational networks', 'public administration and']"
13564,1207.6873,Ravindranath Chowdary C,Surendranath Chowdary Chandra and Ravindranath Chowdary C,JASF: Jasta Security Framework,,,,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  JASM is a model designed to increase the security level in authentication
systems. It uses IP Address of the user in the authentication process to
enhance the security.
","[{'version': 'v1', 'created': 'Mon, 30 Jul 2012 09:16:14 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Aug 2012 16:49:54 GMT'}]",2012-08-07,"[['Chandra', 'Surendranath Chowdary', ''], ['C', 'Ravindranath Chowdary', '']]","['Security', 'Authentication', 'Phishing']"
13565,1504.05655,David Burth Kurka,"David Burth Kurka, Alan Godoy, Fernando J. Von Zuben","Online Social Network Analysis: A Survey of Research Applications in
  Computer Science",,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The emergence and popularization of online social networks suddenly made
available a large amount of data from social organization, interaction and
human behavior. All this information opens new perspectives and challenges to
the study of social systems, being of interest to many fields. Although most
online social networks are recent (less than fifteen years old), a vast amount
of scientific papers was already published on this topic, dealing with a broad
range of analytical methods and applications. This work describes how
computational researches have approached this subject and the methods used to
analyze such systems. Founded on a wide though non-exaustive review of the
literature, a taxonomy is proposed to classify and describe different
categories of research. Each research category is described and the main works,
discoveries and perspectives are highlighted.
","[{'version': 'v1', 'created': 'Wed, 22 Apr 2015 05:01:39 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Apr 2016 18:41:11 GMT'}]",2016-04-05,"[['Kurka', 'David Burth', ''], ['Godoy', 'Alan', ''], ['Von Zuben', 'Fernando J.', '']]","['Online Social Networks', 'Survey', 'Computational Research', 'Machine Learning', 'Complex Systems']"
13566,1611.00201,Jay Wong,Jay M. Wong,"Towards Lifelong Self-Supervision: A Deep Learning Direction for
  Robotics",,,,,cs.RO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite outstanding success in vision amongst other domains, many of the
recent deep learning approaches have evident drawbacks for robots. This
manuscript surveys recent work in the literature that pertain to applying deep
learning systems to the robotics domain, either as means of estimation or as a
tool to resolve motor commands directly from raw percepts. These recent
advances are only a piece to the puzzle. We suggest that deep learning as a
tool alone is insufficient in building a unified framework to acquire general
intelligence. For this reason, we complement our survey with insights from
cognitive development and refer to ideas from classical control theory,
producing an integrated direction for a lifelong learning architecture.
","[{'version': 'v1', 'created': 'Tue, 1 Nov 2016 12:47:50 GMT'}]",2016-11-02,"[['Wong', 'Jay M.', '']]","['Robotics', 'Deep Learning', 'Cognition', 'Autonomy', 'Lifelong Learning']"
13567,1701.08108,Themistoklis Melissourgos,Themistoklis Melissourgos and Paul Spirakis,"Existence of Evolutionarily Stable Strategies Remains Hard to Decide for
  a Wide Range of Payoff Values","24 pages, 4 figures",,,,cs.CC cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The concept of an evolutionarily stable strategy (ESS), introduced by Smith
and Price, is a refinement of Nash equilibrium in 2-player symmetric games in
order to explain counter-intuitive natural phenomena, whose existence is not
guaranteed in every game. The problem of deciding whether a game possesses an
ESS has been shown to be $\Sigma_{2}^{P}$-complete by Conitzer using the
preceding important work by Etessami and Lochbihler. The latter, among other
results, proved that deciding the existence of ESS is both NP-hard and
coNP-hard. In this paper we introduce a ""reduction robustness"" notion and we
show that deciding the existence of an ESS remains coNP-hard for a wide range
of games even if we arbitrarily perturb within some intervals the payoff values
of the game under consideration. In contrast, ESS exist almost surely for large
games with random and independent payoffs chosen from the same distribution.
","[{'version': 'v1', 'created': 'Fri, 27 Jan 2017 16:37:45 GMT'}]",2017-01-30,"[['Melissourgos', 'Themistoklis', ''], ['Spirakis', 'Paul', '']]","['Game theory', 'Computational complexity', 'Evolutionarily stable strategies', 'Robust reduction']"
13568,1510.02526,F\'abio Botler,F\'abio Botler and Andrea Jim\'enez,On path decompositions of 2k-regular graphs,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tibor Gallai conjectured that the edge set of every connected graph $G$ on
$n$ vertices can be partitioned into $\lceil n/2\rceil$ paths. Let
$\mathcal{G}_{k}$ be the class of all $2k$-regular graphs of girth at least
$2k-2$ that admit a pair of disjoint perfect matchings. In this work, we show
that Gallai's conjecture holds in $\mathcal{G}_{k}$, for every $k \geq 3$.
Further, we prove that for every graph $G$ in $\mathcal{G}_{k}$ on $n$
vertices, there exists a partition of its edge set into $n/2$ paths of lengths
in $\{2k-1,2k,2k+1\}$.
","[{'version': 'v1', 'created': 'Thu, 8 Oct 2015 23:10:00 GMT'}]",2015-10-12,"[['Botler', 'Fábio', ''], ['Jiménez', 'Andrea', '']]","['Path decomposition', 'length-constrained', '2k-regular graphs', 'perfect matchings']"
13569,1204.6459,Jean-Pierre  Tillich,Val\'erie Gauthier and Ayoub Otmani and Jean-Pierre Tillich,"A Distinguisher-Based Attack on a Variant of McEliece's Cryptosystem
  Based on Reed-Solomon Codes",arXiv admin note: substantial text overlap with arXiv:1203.6686,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Baldi et \textit{al.} proposed a variant of McEliece's cryptosystem. The main
idea is to replace its permutation matrix by adding to it a rank 1 matrix. The
motivation for this change is twofold: it would allow the use of codes that
were shown to be insecure in the original McEliece's cryptosystem, and it would
reduce the key size while keeping the same security against generic decoding
attacks. The authors suggest to use generalized Reed-Solomon codes instead of
Goppa codes. The public code built with this method is not anymore a
generalized Reed-Solomon code. On the other hand, it contains a very large
secret generalized Reed-Solomon code. In this paper we present an attack that
is built upon a distinguisher which is able to identify elements of this secret
code. The distinguisher is constructed by considering the code generated by
component-wise products of codewords of the public code (the so-called ""square
code""). By using square-code dimension considerations, the initial generalized
Reed-Solomon code can be recovered which permits to decode any ciphertext. A
similar technique has already been successful for mounting an attack against a
homomorphic encryption scheme suggested by Bogdanoc et \textit{al.}. This work
can be viewed as another illustration of how a distinguisher of Reed-Solomon
codes can be used to devise an attack on cryptosystems based on them.
","[{'version': 'v1', 'created': 'Sun, 29 Apr 2012 07:34:55 GMT'}]",2012-05-01,"[['Gauthier', 'Valérie', ''], ['Otmani', 'Ayoub', ''], ['Tillich', 'Jean-Pierre', '']]","['Code-based cryptography', 'McEliece', 'distinguisher']"
13570,0908.3523,Gene Golovchinsky,Gene Golovchinsky,Cognitive Dimensions Analysis of Interfaces for Information Seeking,Submitted to HCIR'09 http://cuaslis.org/hcir2009/,,,,cs.HC cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cognitive Dimensions is a framework for analyzing human-computer interaction.
It is used for meta-analysis, that is, for talking about characteristics of
systems without getting bogged down in details of a particular implementation.
In this paper, I discuss some of the dimensions of this theory and how they can
be applied to analyze information seeking interfaces. The goal of this analysis
is to introduce a useful vocabulary that practitioners and researchers can use
to describe systems, and to guide interface design toward more usable and
useful systems
","[{'version': 'v1', 'created': 'Tue, 25 Aug 2009 01:37:59 GMT'}]",2009-08-26,"[['Golovchinsky', 'Gene', '']]","['Information seeking', 'user interfaces', 'evaluation']"
13571,1206.6016,Anasuya Threse Innocent A.,A. Anasuya Threse Innocent,Cloud Infrastructure Service Management - A Review,6 pages,"International Journal of Computer Science Issues, Volume 9, Number
  2, March 2012, Pg. 287 - 292",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The new era of computing called Cloud Computing allows the user to access the
cloud services dynamically over the Internet wherever and whenever needed.
Cloud consists of data and resources; and the cloud services include the
delivery of software, infrastructure, applications, and storage over the
Internet based on user demand through Internet. In short, cloud computing is a
business and economic model allowing the users to utilize high-end computing
and storage virtually with minimal infrastructure on their end. Cloud has three
service models namely, Cloud Software-as-a-Service (SaaS), Cloud
Platform-as-a-Service (PaaS), and Cloud Infrastructure-as-a-Service (IaaS).
This paper talks in depth of cloud infrastructure service management.
","[{'version': 'v1', 'created': 'Wed, 30 May 2012 09:45:54 GMT'}]",2012-06-27,"[['Innocent', 'A. Anasuya Threse', '']]","['Cloud Computing', 'IaaS', 'PaaS', 'SaaS', 'Cloud Infrastructure']"
13572,1410.0105,Yao Sun,"Yao Sun, Dingkang Wang, Zhenyu Huang, Dongdai Lin","A Monomial-Oriented GVW for Computing Gr\""obner Bases",,,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The GVW algorithm, presented by Gao et al., is a signature-based algorithm
for computing Gr\""obner bases. In this paper, a variant of GVW is presented.
This new algorithm is called a monomial-oriented GVW algorithm or mo-GVW
algorithm for short. The mo-GVW algorithm presents a new frame of GVW and
regards {\em labeled monomials} instead of {\em labeled polynomials} as basic
elements of the algorithm. Being different from the original GVW algorithm, for
each labeled monomial, the mo-GVW makes efforts to find the smallest signature
that can generate this monomial. The mo-GVW algorithm also avoids generating
J-pairs, and uses efficient methods of searching reducers and checking
criteria. Thus, the mo-GVW algorithm has a better performance during practical
implementations.
","[{'version': 'v1', 'created': 'Wed, 1 Oct 2014 04:16:01 GMT'}]",2014-10-02,"[['Sun', 'Yao', ''], ['Wang', 'Dingkang', ''], ['Huang', 'Zhenyu', ''], ['Lin', 'Dongdai', '']]","['Gr¨obner basis', 'GVW', 'F5', 'signature', 'a monomial-oriented algorithm']"
13573,1705.08849,Amir Geranmayeh Dr.-Ing.,Amir Geranmayeh,"Parallel Matrix-Free Implementation of Frequency-Domain Finite
  Difference Methods for Cluster Computing","7 pages, 10 figures including: Matrix-free 3D finite-difference
  frequency-domain (FDFD) methods, Simultaneous reduction in memory usage and
  computational costs of FDFD, Broadband impedance calculation of electrically
  large interconnects, Ease of solver modification for mutual field coupling
  simulation between many ports, Domain decomposition for passing the mesh
  information to parallel machines",,,,cs.CE cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Full-wave 3D electromagnetic simulations of complex planar devices,
multilayer interconnects, and chip packages are presented for wide-band
frequency-domain analysis using the finite difference integration technique
developed in the PETSc software package. Initial reordering of the index
assignment to the unknowns makes the resulting system matrix diagonally
dominant. The rearrangement also facilitates the decomposition of large domain
into slices for passing the mesh information to different machines. Matrix-free
methods are then exploited to minimize the number of element-wise
multiplications and memory requirements in the construction of the system of
linear equations. Besides, the recipes provide extreme ease of modifications in
the kernel of the code. The applicability of different Krylov subspace solvers
is investigated. The accuracy is checked through comparisons with CST MICROWAVE
STUDIO transient solver results. The parallel execution of the compiled code on
specific number of processors in multi-core distributed-memory architectures
demonstrate high scalability of the computational algorithm.
","[{'version': 'v1', 'created': 'Tue, 23 May 2017 16:45:20 GMT'}]",2017-05-25,"[['Geranmayeh', 'Amir', '']]","['finite difference frequency domain (FDFD)', 'finiteintegration technique', 'matrix-free method', 'parallel programming', 'computational electromagnetics']"
13574,1602.08507,Zhenhao Ge,"Qian Huang, Zhenhao Ge, Chao Lu","Occupancy Estimation in Smart Buildings using Audio-Processing
  Techniques","International Conference on Computing in Civil and Building
  Engineering (ICCCBE) 2016",,,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the past few years, several case studies have illustrated that the use of
occupancy information in buildings leads to energy-efficient and low-cost HVAC
operation. The widely presented techniques for occupancy estimation include
temperature, humidity, CO2 concentration, image camera, motion sensor and
passive infrared (PIR) sensor. So far little studies have been reported in
literature to utilize audio and speech processing as indoor occupancy
prediction technique. With rapid advances of audio and speech processing
technologies, nowadays it is more feasible and attractive to integrate
audio-based signal processing component into smart buildings. In this work, we
propose to utilize audio processing techniques (i.e., speaker recognition and
background audio energy estimation) to estimate room occupancy (i.e., the
number of people inside a room). Theoretical analysis and simulation results
demonstrate the accuracy and effectiveness of this proposed occupancy
estimation technique. Based on the occupancy estimation, smart buildings will
adjust the thermostat setups and HVAC operations, thus, achieving greater
quality of service and drastic cost savings.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2016 04:52:01 GMT'}]",2016-03-01,"[['Huang', 'Qian', ''], ['Ge', 'Zhenhao', ''], ['Lu', 'Chao', '']]","['smart building', 'occupancy estimation', 'audio processing', 'speaker recognition  1']"
13575,1603.08307,Shouhuai Xu,Maochao Xu and Gaofeng Da and Shouhuai Xu,Cyber Epidemic Models with Dependences,,"Internet Mathematics, 11:1, 62-92 (2015)",,,cs.CR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Studying models of cyber epidemics over arbitrary complex networks can deepen
our understanding of cyber security from a whole-system perspective. In this
paper, we initiate the investigation of cyber epidemic models that accommodate
the {\em dependences} between the cyber attack events. Due to the notorious
difficulty in dealing with such dependences, essentially all existing cyber
epidemic models have assumed them away. Specifically, we introduce the idea of
Copulas into cyber epidemic models for accommodating the dependences between
the cyber attack events. We investigate the epidemic equilibrium thresholds as
well as the bounds for both equilibrium and non-equilibrium infection
probabilities. We further characterize the side-effects of assuming away the
due dependences between the cyber attack events, by showing that the results
thereof are unnecessarily restrictive or even incorrect.
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2016 04:52:04 GMT'}]",2016-03-29,"[['Xu', 'Maochao', ''], ['Da', 'Gaofeng', ''], ['Xu', 'Shouhuai', '']]","['Copula', 'Cyber epidemics', 'dependence', 'epidemic threshold', 'spectral radius', 'infection probability']"
13576,1701.07895,Adarsh Barik,"Adarsh Barik, Jean Honorio, Mohit Tawarmalani","Information Theoretic Limits for Linear Prediction with Graph-Structured
  Sparsity",,2017 IEEE International Symposium on Information Theory (ISIT),,,cs.LG cs.IT math.IT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze the necessary number of samples for sparse vector recovery in a
noisy linear prediction setup. This model includes problems such as linear
regression and classification. We focus on structured graph models. In
particular, we prove that sufficient number of samples for the weighted graph
model proposed by Hegde and others is also necessary. We use the Fano's
inequality on well constructed ensembles as our main tool in establishing
information theoretic lower bounds.
","[{'version': 'v1', 'created': 'Thu, 26 Jan 2017 22:43:20 GMT'}, {'version': 'v2', 'created': 'Sat, 6 May 2017 23:11:33 GMT'}]",2018-11-19,"[['Barik', 'Adarsh', ''], ['Honorio', 'Jean', ''], ['Tawarmalani', 'Mohit', '']]","['Compressive sensing', 'Linear Prediction', 'Classification', 'Fano’s Inequality', 'Mutual Information', 'Kullback Leibler divergence']"
13577,1603.08047,Kevin Hecke Van,"Kevin van Hecke, Guido de Croon, Laurens van der Maaten, Daniel
  Hennes, Dario Izzo","Persistent self-supervised learning principle: from stereo to monocular
  vision for obstacle avoidance",,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-Supervised Learning (SSL) is a reliable learning mechanism in which a
robot uses an original, trusted sensor cue for training to recognize an
additional, complementary sensor cue. We study for the first time in SSL how a
robot's learning behavior should be organized, so that the robot can keep
performing its task in the case that the original cue becomes unavailable. We
study this persistent form of SSL in the context of a flying robot that has to
avoid obstacles based on distance estimates from the visual cue of stereo
vision. Over time it will learn to also estimate distances based on monocular
appearance cues. A strategy is introduced that has the robot switch from stereo
vision based flight to monocular flight, with stereo vision purely used as
'training wheels' to avoid imminent collisions. This strategy is shown to be an
effective approach to the 'feedback-induced data bias' problem as also
experienced in learning from demonstration. Both simulations and real-world
experiments with a stereo vision equipped AR drone 2.0 show the feasibility of
this approach, with the robot successfully using monocular vision to avoid
obstacles in a 5 x 5 room. The experiments show the potential of persistent SSL
as a robust learning approach to enhance the capabilities of robots. Moreover,
the abundant training data coming from the own sensors allows to gather large
data sets necessary for deep learning approaches.
","[{'version': 'v1', 'created': 'Fri, 25 Mar 2016 22:13:50 GMT'}]",2016-03-29,"[['van Hecke', 'Kevin', ''], ['de Croon', 'Guido', ''], ['van der Maaten', 'Laurens', ''], ['Hennes', 'Daniel', ''], ['Izzo', 'Dario', '']]","['Persistent self-supervised learning', 'stereo vision', 'monocular depth estimation', 'robotics']"
13578,1111.1958,Debojyoti Dutta,"Noah Burbank and Debojyoti Dutta and Ashish Goel and David Lee and Eli
  Marschner and Narayanan Shivakumar",Widescope - A social platform for serious conversations on the Web,,,,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are several web platforms that people use to interact and exchange
ideas, such as social networks like Facebook, Twitter, and Google+; Q&A sites
like Quora and Yahoo! Answers; and myriad independent fora. However, there is a
scarcity of platforms that facilitate discussion of complex subjects where
people with divergent views can easily rationalize their points of view using a
shared knowledge base, and leverage it towards shared objectives, e.g. to
arrive at a mutually acceptable compromise.
  In this paper, as a first step, we present Widescope, a novel collaborative
web platform for catalyzing shared understanding of the US Federal and State
budget debates in order to help users reach data-driven consensus about the
complex issues involved. It aggregates disparate sources of financial data from
different budgets (i.e. from past, present, and proposed) and presents a
unified interface using interactive visualizations. It leverages distributed
collaboration to encourage exploration of ideas and debate. Users can propose
budgets ab-initio, support existing proposals, compare between different
budgets, and collaborate with others in real time.
  We hypothesize that such a platform can be useful in bringing people's
thoughts and opinions closer. Toward this, we present preliminary evidence from
a simple pilot experiment, using triadic voting (which we also formally analyze
to show that is better than hot-or-not voting), that 5 out of 6 groups of users
with divergent views (conservatives vs liberals) come to a consensus while
aiming to halve the deficit using Widescope. We believe that tools like
Widescope could have a positive impact on other complex, data-driven social
issues.
","[{'version': 'v1', 'created': 'Tue, 8 Nov 2011 16:28:52 GMT'}]",2011-11-09,"[['Burbank', 'Noah', ''], ['Dutta', 'Debojyoti', ''], ['Goel', 'Ashish', ''], ['Lee', 'David', ''], ['Marschner', 'Eli', ''], ['Shivakumar', 'Narayanan', '']]","['User Interfaces', 'Crowdsourcing', 'User trials', 'Voting']"
13579,1407.2407,Filip Paveti\'c,"Filip Paveti\'c, Goran \v{Z}u\v{z}i\'c, Mile \v{S}iki\'c",$LCSk$++: Practical similarity metric for long strings,,"Proceedings of the Prague Stringology Conference 2018, (2018)
  50-60",,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present $LCSk$++: a new metric for measuring the similarity
of long strings, and provide an algorithm for its efficient computation. With
ever increasing size of strings occuring in practice, e.g. large genomes of
plants and animals, classic algorithms such as Longest Common Subsequence (LCS)
fail due to demanding computational complexity. Recently, Benson et al. defined
a similarity metric named $LCSk$. By relaxing the requirement that the
$k$-length substrings should not overlap, we extend their definition into a new
metric. An efficient algorithm is presented which computes $LCSk$++ with
complexity of $O((|X|+|Y|)\log(|X|+|Y|))$ for strings $X$ and $Y$ under a
realistic random model. The algorithm has been designed with implementation
simplicity in mind. Additionally, we describe how it can be adjusted to compute
$LCSk$ as well, which gives an improvement of the $O(|X|\dot|Y|)$ algorithm
presented in the original $LCSk$ paper.
","[{'version': 'v1', 'created': 'Wed, 9 Jul 2014 09:42:36 GMT'}]",2019-08-27,"[['Pavetić', 'Filip', ''], ['Žužić', 'Goran', ''], ['Šikić', 'Mile', '']]","['Efficient longest common subsequence', 'Similarity of longstrings', 'Bioinformatics', 'Sparse dynamic programming']"
13580,1610.07258,Zhiguang Wang,"Zhiguang Wang, Wei Song, Lu Liu, Fan Zhang, Junxiao Xue, Yangdong Ye,
  Ming Fan, Mingliang Xu","Representation Learning with Deconvolution for Multivariate Time Series
  Classification and Visualization",arXiv admin note: text overlap with arXiv:1505.04366 by other authors,,,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new model based on the deconvolutional networks and SAX
discretization to learn the representation for multivariate time series.
Deconvolutional networks fully exploit the advantage the powerful
expressiveness of deep neural networks in the manner of unsupervised learning.
We design a network structure specifically to capture the cross-channel
correlation with deconvolution, forcing the pooling operation to perform the
dimension reduction along each position in the individual channel.
Discretization based on Symbolic Aggregate Approximation is applied on the
feature vectors to further extract the bag of features. We show how this
representation and bag of features helps on classification. A full comparison
with the sequence distance based approach is provided to demonstrate the
effectiveness of our approach on the standard datasets. We further build the
Markov matrix from the discretized representation from the deconvolution to
visualize the time series as complex networks, which show more class-specific
statistical properties and clear structures with respect to different labels.
","[{'version': 'v1', 'created': 'Mon, 24 Oct 2016 01:53:12 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Oct 2016 00:17:45 GMT'}, {'version': 'v3', 'created': 'Sat, 26 Nov 2016 21:02:49 GMT'}]",2016-12-04,"[['Wang', 'Zhiguang', ''], ['Song', 'Wei', ''], ['Liu', 'Lu', ''], ['Zhang', 'Fan', ''], ['Xue', 'Junxiao', ''], ['Ye', 'Yangdong', ''], ['Fan', 'Ming', ''], ['Xu', 'Mingliang', '']]","['Multivariate time-series', 'Deconvolution', 'Symbolic Aggregate Approximation', 'Deep Learning', 'Markov Matrix', 'Visualization']"
13581,1410.5416,Dimitrios Kallergis,"Michael Mpasios, Dimitrios Kallergis, Konstantinos Chimos, Theodoros
  Karvounidis, Christos Douligeris","Software in e-Learning Architecture, Processes and Management","9 pages, 6th International Conference of Education, Research and
  Innovation (iCERI2013), November 18-20, Seville, Spain. ISBN:
  978-84-616-3847-5",,,,cs.SE cs.CY,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Our entire society is becoming more and more dependent on technology and
specifically on software. The integration of e-learning software systems into
our day by day life especially in e-learning applications generates
modifications upon the society and, at the same time, the society itself
changes the process of software development. This circle of continuous
determination engenders a highly dynamic environment. Lehman describes the
software development environment as being characterized by a high, necessary
and inevitable pressure for change. Changes are reflected in specific
uncertainties which impact the success and performance of the software project
development.
","[{'version': 'v1', 'created': 'Sun, 19 Oct 2014 07:37:13 GMT'}]",2014-10-22,"[['Mpasios', 'Michael', ''], ['Kallergis', 'Dimitrios', ''], ['Chimos', 'Konstantinos', ''], ['Karvounidis', 'Theodoros', ''], ['Douligeris', 'Christos', '']]","['e-learning software development', 'e-learning software Architecture', 'e-learning software flexibility']"
13582,1609.04112,C.-C. Jay Kuo,C.-C. Jay Kuo,Understanding Convolutional Neural Networks with A Mathematical Model,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work attempts to address two fundamental questions about the structure
of the convolutional neural networks (CNN): 1) why a non-linear activation
function is essential at the filter output of every convolutional layer? 2)
what is the advantage of the two-layer cascade system over the one-layer
system? A mathematical model called the ""REctified-COrrelations on a Sphere""
(RECOS) is proposed to answer these two questions. After the CNN training
process, the converged filter weights define a set of anchor vectors in the
RECOS model. Anchor vectors represent the frequently occurring patterns (or the
spectral components). The necessity of rectification is explained using the
RECOS model. Then, the behavior of a two-layer RECOS system is analyzed and
compared with its one-layer counterpart. The LeNet-5 and the MNIST dataset are
used to illustrate discussion points. Finally, the RECOS model is generalized
to a multi-layer system with the AlexNet as an example.
  Keywords: Convolutional Neural Network (CNN), Nonlinear Activation, RECOS
Model, Rectified Linear Unit (ReLU), MNIST Dataset.
","[{'version': 'v1', 'created': 'Wed, 14 Sep 2016 02:17:09 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Nov 2016 21:55:26 GMT'}]",2016-11-04,"[['Kuo', 'C. -C. Jay', '']]","['Convolutional Neural Network (CNN)', 'Nonlinear Activation', 'RECOS Model', 'Rectified Linear Unit (ReLU)', 'MNIST Dataset']"
13583,1701.01850,Changlong Wang,"Changlong Wang, Jigen Peng",Analysis of equivalence relation in joint sparse recovery,"22 pages, 7 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The joint sparse recovery problem is a generalization of the single
measurement vector problem which is widely studied in Compressed Sensing and it
aims to recovery a set of jointly sparse vectors. i.e. have nonzero entries
concentrated at common location. Meanwhile l_p-minimization subject to matrices
is widely used in a large number of algorithms designed for this problem.
Therefore the main contribution in this paper is two theoretical results about
this technique. The first one is to prove that in every multiple systems of
linear equation, there exists a constant p* such that the original unique
sparse solution also can be recovered from a minimization in l_p quasi-norm
subject to matrices whenever 0< p<p*. The other one is to show an analysis
expression of such p*. Finally, we display the results of one example to
confirm the validity of our conclusions.
","[{'version': 'v1', 'created': 'Sat, 7 Jan 2017 16:18:28 GMT'}]",2017-01-10,"[['Wang', 'Changlong', ''], ['Peng', 'Jigen', '']]","['sparse recovery', 'multiple measurement vectors', 'joint sparse recovery', 'null']"
13584,1708.00129,Andy Kitchen,"Andy Kitchen, Jarrel Seah","Deep Generative Adversarial Neural Networks for Realistic Prostate
  Lesion MRI Synthesis","8 pages, 5 figures, 2 tables",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generative Adversarial Neural Networks (GANs) are applied to the synthetic
generation of prostate lesion MRI images. GANs have been applied to a variety
of natural images, is shown show that the same techniques can be used in the
medical domain to create realistic looking synthetic lesion images. 16mm x 16mm
patches are extracted from 330 MRI scans from the SPIE ProstateX Challenge 2016
and used to train a Deep Convolutional Generative Adversarial Neural Network
(DCGAN) utilizing cutting edge techniques. Synthetic outputs are compared to
real images and the implicit latent representations induced by the GAN are
explored. Training techniques and successful neural network architectures are
explained in detail.
","[{'version': 'v1', 'created': 'Tue, 1 Aug 2017 02:09:12 GMT'}]",2017-08-02,"[['Kitchen', 'Andy', ''], ['Seah', 'Jarrel', '']]","['Deep Learning', 'Generative Adversarial Networks', 'MRI', 'Convolutional Neural Network']"
13585,1505.01606,Harsh Thakkar,"Harsh Thakkar, Ganesh Iyer, Prasenjit Majumder","A comparative study of approaches in user-centered health information
  retrieval","6 pages, 2 figures, 1 table",,,,cs.IR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper, we survey various user-centered or context-based biomedical
health information retrieval systems. We present and discuss the performance of
systems submitted in CLEF eHealth 2014 Task 3 for this purpose. We classify and
focus on comparing the two most prevalent retrieval models in biomedical
information retrieval namely: Language Model (LM) and Vector Space Model (VSM).
We also report on the effectiveness of using external medical resources and
ontologies like MeSH, Metamap, UMLS, etc. We observed that the L.M. based
retrieval systems outperform VSM based systems on various fronts. From the
results we conclude that the state-of-art system scores for MAP was 0.4146,
P@10 was 0.7560 and NDCG@10 was 0.7445, respectively. All of these score were
reported by systems built on language modelling approaches.
","[{'version': 'v1', 'created': 'Thu, 7 May 2015 07:32:33 GMT'}]",2015-05-08,"[['Thakkar', 'Harsh', ''], ['Iyer', 'Ganesh', ''], ['Majumder', 'Prasenjit', '']]","['concept-based information retrieval', 'clinical document retrieval', 'query expansion', 'language models', 'vector space models']"
13586,1712.03411,Guanshun Yu,"Guanshun Yu, Tom Y. Cheng, Blayne Kettlewell, Harrison Liew, Mingoo
  Seok, Peter R. Kinget","FPGA with Improved Routability and Robustness in 130nm CMOS with
  Open-Source CAD Targetability","4 pages, 11 figures, 1 table",,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper outlines an FPGA VLSI design methodology that was used to realize
a fully functioning FPGA chip in 130nm CMOS with improved routability and
memory robustness. The architectural design space exploration and synthesis
capability were enabled by the Verilog-to-Routing CAD tool. The capabilities of
this tool were extended to enable bitstream generation and deployment. To
validate the architecture and bitstream implementation, a Chisel (Constructing
Hardware in the Embedded Scala Language) model of the FPGA was created to
rapidly verify the microarchitectural details of the device prior to schematic
design. A custom carrier board and configuration tool were used to verify
correct operational characteristics of the FPGA over various resource
utilizations and clock frequencies.
","[{'version': 'v1', 'created': 'Sat, 9 Dec 2017 16:46:08 GMT'}]",2017-12-12,"[['Yu', 'Guanshun', ''], ['Cheng', 'Tom Y.', ''], ['Kettlewell', 'Blayne', ''], ['Liew', 'Harrison', ''], ['Seok', 'Mingoo', ''], ['Kinget', 'Peter R.', '']]","['FPGA design', 'Verilog-to-Routing', 'Wilton switch']"
13587,1410.2195,Bahman Kalantari,"Sharareh Alipour, Bahman Kalantari, Hamid Homapour",Fast Approximation and Randomized Algorithms for Diameter,"13 pages, 6 figures, 3 tables",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider approximation of diameter of a set $S$ of $n$ points in dimension
$m$. E$\tilde{g}$ecio$\tilde{g}$lu and Kalantari \cite{kal} have shown that
given any $p \in S$, by computing its farthest in $S$, say $q$, and in turn the
farthest point of $q$, say $q'$, we have ${\rm diam}(S) \leq \sqrt{3} d(q,q')$.
Furthermore, iteratively replacing $p$ with an appropriately selected point on
the line segment $pq$, in at most $t \leq n$ additional iterations, the
constant bound factor is improved to $c_*=\sqrt{5-2\sqrt{3}} \approx 1.24$.
Here we prove when $m=2$, $t=1$. This suggests in practice a few iterations may
produce good solutions in any dimension. Here we also propose a randomized
version and present large scale computational results with these algorithm for
arbitrary $m$. The algorithms outperform many existing algorithms. On sets of
data as large as $1,000,000$ points, the proposed algorithms compute solutions
to within an absolute error of $10^{-4}$.
","[{'version': 'v1', 'created': 'Wed, 8 Oct 2014 17:41:19 GMT'}]",2014-10-09,"[['Alipour', 'Sharareh', ''], ['Kalantari', 'Bahman', ''], ['Homapour', 'Hamid', '']]","['Diameter', 'Approxiamtion Algorithms', 'Randomized Algorithms']"
13588,1306.3054,Uwe Aickelin,"Haichang Gao, Zhongjie Ren, Xiuling Chang, Xiyang Liu, Uwe Aickelin",The effect of baroque music on the PassPoints graphical password,"ACM International Conference on Image and Video Retrieval, 129-134,
  2010",,,,cs.CR cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graphical passwords have been demonstrated to be the possible alternatives to
traditional alphanumeric passwords. However, they still tend to follow
predictable patterns that are easier to attack. The crux of the problem is
users' memory limitations. Users are the weakest link in password
authentication mechanism. It shows that baroque music has positive effects on
human memorizing and learning. We introduce baroque music to the PassPoints
graphical password scheme and conduct a laboratory study in this paper. Results
shown that there is no statistic difference between the music group and the
control group without music in short-term recall experiments, both had high
recall success rates. But in long-term recall, the music group performed
significantly better. We also found that the music group tended to set
significantly more complicated passwords, which are usually more resistant to
dictionary and other guess attacks. But compared with the control group, the
music group took more time to log in both in short-term and long-term tests.
Besides, it appears that background music does not work in terms of hotspots.
","[{'version': 'v1', 'created': 'Thu, 13 Jun 2013 08:20:38 GMT'}]",2013-06-14,"[['Gao', 'Haichang', ''], ['Ren', 'Zhongjie', ''], ['Chang', 'Xiuling', ''], ['Liu', 'Xiyang', ''], ['Aickelin', 'Uwe', '']]","['Graphical password', 'Baroque music', 'Memorability', 'PassPoints']"
13589,1410.0553,Vincent Cohen-Addad,Vincent Cohen-Addad and Claire Mathieu,The Unreasonable Success of Local Search: Geometric Optimization,,,,,cs.CG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  What is the effectiveness of local search algorithms for geometric problems
in the plane? We prove that local search with neighborhoods of magnitude
$1/\epsilon^c$ is an approximation scheme for the following problems in the
Euclidian plane: TSP with random inputs, Steiner tree with random inputs,
facility location (with worst case inputs), and bicriteria $k$-median (also
with worst case inputs). The randomness assumption is necessary for TSP.
","[{'version': 'v1', 'created': 'Thu, 2 Oct 2014 13:56:25 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Oct 2014 18:23:31 GMT'}, {'version': 'v3', 'created': 'Thu, 15 Jan 2015 08:37:07 GMT'}, {'version': 'v4', 'created': 'Wed, 9 Sep 2015 07:36:27 GMT'}]",2015-09-10,"[['Cohen-Addad', 'Vincent', ''], ['Mathieu', 'Claire', '']]","['Local Search', 'PTAS', 'Facility Location', 'k-Median', 'TSP', 'Steiner Tree']"
13590,1606.05136,Youcef Abdelsadek,"Youcef Abdelsadek, Kamel Chelghoum, Francine Herrmann, Imed Kacem and
  Beno\^it Otjacques","Triangles as basis to detect communities: an application to Twitter's
  network","19 pages, 18 figures",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, the interest given by the scientific community to the investigation
of the data generated by social networks is increasing as much as the
exponential increasing of social network data. The data structure complexity is
one among the snags, which slowdown their understanding. On the other hand,
community detection in social networks helps the analyzers to reveal the
structure and the underlying semantic within communities. In this paper we
propose an interactive visualization approach relying on our application
NLCOMS, which uses synchronous and related views for graph and community
visualization. Additionally, we present our algorithm for community detection
in networks. A computation study is conducted on instances generated with the
LFR [9]-[10] benchmark. Finally, in order to assess our approach on real-world
data, we consider the data of the ANR-Info-RSN project. The latter addresses
community detection in Twitter.
","[{'version': 'v1', 'created': 'Thu, 16 Jun 2016 10:59:38 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Jun 2016 14:21:07 GMT'}]",2016-06-20,"[['Abdelsadek', 'Youcef', ''], ['Chelghoum', 'Kamel', ''], ['Herrmann', 'Francine', ''], ['Kacem', 'Imed', ''], ['Otjacques', 'Benoît', '']]","['Social network analysis', 'weighted graphs', 'interactive visualization', 'community detection algorithm', 'visualization tool']"
13591,1407.3263,Hyung-Chan An,"Hyung-Chan An, Mohit Singh, Ola Svensson",LP-Based Algorithms for Capacitated Facility Location,"25 pages, 6 figures; minor revisions",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linear programming has played a key role in the study of algorithms for
combinatorial optimization problems. In the field of approximation algorithms,
this is well illustrated by the uncapacitated facility location problem. A
variety of algorithmic methodologies, such as LP-rounding and primal-dual
method, have been applied to and evolved from algorithms for this problem.
Unfortunately, this collection of powerful algorithmic techniques had not yet
been applicable to the more general capacitated facility location problem. In
fact, all of the known algorithms with good performance guarantees were based
on a single technique, local search, and no linear programming relaxation was
known to efficiently approximate the problem.
  In this paper, we present a linear programming relaxation with constant
integrality gap for capacitated facility location. We demonstrate that the
fundamental theories of multi-commodity flows and matchings provide key
insights that lead to the strong relaxation. Our algorithmic proof of
integrality gap is obtained by finally accessing the rich toolbox of LP-based
methodologies: we present a constant factor approximation algorithm based on
LP-rounding.
","[{'version': 'v1', 'created': 'Fri, 11 Jul 2014 19:51:06 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Sep 2014 19:51:52 GMT'}]",2014-09-16,"[['An', 'Hyung-Chan', ''], ['Singh', 'Mohit', ''], ['Svensson', 'Ola', '']]","['approximation algorithms', 'facility location', 'linear programming']"
13592,1212.6086,"Nouh Sa\""id Mr","Said Nouh, Bouchaib Aylaj and Mostafa Belkasmi",A Method to determine Partial Weight Enumerator for Linear Block Codes,"Computer Engineering and Intelligent Systems Vol 3, No.11, 2012",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a fast and efficient method to find partial weight
enumerator (PWE) for binary linear block codes by using the error impulse
technique and Monte Carlo method. This PWE can be used to compute an upper
bound of the error probability for the soft decision maximum likelihood decoder
(MLD). As application of this method we give partial weight enumerators and
analytical performances of the BCH(130,66), BCH(103,47) and BCH(111,55)
shortened codes; the first code is obtained by shortening the binary primitive
BCH (255,191,17) code and the two other codes are obtained by shortening the
binary primitive BCH(127,71,19) code. The weight distributions of these three
codes are unknown at our knowledge.
","[{'version': 'v1', 'created': 'Tue, 25 Dec 2012 21:25:10 GMT'}]",2012-12-27,"[['Nouh', 'Said', ''], ['Aylaj', 'Bouchaib', ''], ['Belkasmi', 'Mostafa', '']]","['Error impulse technique', 'partial weight enumerator', 'maximum likelihood performance', 'error correcting codes', 'shortened BCH codes', 'Monte Carlo method']"
13593,1406.3100,Jonathan Tapson,"Philip de Chazal, Jonathan Tapson and Andr\'e van Schaik",Learning ELM network weights using linear discriminant analysis,In submission to the ELM 2014 conference,,,,cs.NE cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an alternative to the pseudo-inverse method for determining the
hidden to output weight values for Extreme Learning Machines performing
classification tasks. The method is based on linear discriminant analysis and
provides Bayes optimal single point estimates for the weight values.
","[{'version': 'v1', 'created': 'Thu, 12 Jun 2014 02:08:31 GMT'}]",2014-06-13,"[['de Chazal', 'Philip', ''], ['Tapson', 'Jonathan', ''], ['van Schaik', 'André', '']]","['Extreme learning machine', 'Linear discriminant analysis', 'Hidden to output weight optimization', 'MNIST database']"
13594,1004.2522,Sreekanth Malladi,Sreekanth Malladi,"How to prevent type-flaw and multi-protocol attacks on cryptographic
  protocols under Exclusive-OR",37 pages plus 14 pages in the Appendix,,,DSU-BIS-IA-Mall2010A,cs.CR cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Type-flaw attacks and multi-protocol attacks on security protocols have been
frequently reported in the literature. Heather et al. and Guttman et al. have
proven that these could be prevented by tagging encrypted components with
distinct constants in a standard protocol model with free message algebra and
perfect encryption. However, most ""real-world"" protocols such as SSL 3.0 are
designed with the Exclusive-OR (XOR) operator that possesses algebraic
properties, breaking the free algebra assumption. These algebraic properties
induce equational theories that need to be considered when analyzing protocols
that use the operator. This is the problem we consider in this paper: We prove
that, under certain assumptions, tagging encrypted components still prevents
type-flaw and multi-protocol attacks even in the presence of the XOR operator
and its algebraic properties.
","[{'version': 'v1', 'created': 'Wed, 14 Apr 2010 23:09:53 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Jun 2010 08:01:59 GMT'}, {'version': 'v3', 'created': 'Sat, 19 Jun 2010 17:13:47 GMT'}]",2010-06-22,"[['Malladi', 'Sreekanth', '']]","['Cryptographic protocols', 'Type-flaw attacks', 'Multi-protocol attacks', 'Tagging', 'Exclusive-OR', 'Algebraic properties', 'Equational theories', 'Constraint solving']"
13595,1305.1059,Jaroslav Hor\'a\v{c}ek,"Jaroslav Hor\'a\v{c}ek, Milan Hlad\'ik","Subsquares Approach - Simple Scheme for Solving Overdetermined Interval
  Linear Systems",submitted to PPAM 2013,,,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we present a new simple but efficient scheme - Subsquares
approach - for development of algorithms for enclosing the solution set of
overdetermined interval linear systems. We are going to show two algorithms
based on this scheme and discuss their features. We start with a simple
algorithm as a motivation, then we continue with a sequential algorithm. Both
algorithms can be easily parallelized. The features of both algorithms will be
discussed and numerically tested.
","[{'version': 'v1', 'created': 'Sun, 5 May 2013 22:13:57 GMT'}]",2013-05-07,"[['Horáček', 'Jaroslav', ''], ['Hladík', 'Milan', '']]","['interval linear systems', 'interval enclosure', 'overdetermined systems', 'parallel computing']"
13596,1603.03203,Vinod Prasad,Vinodprasad P,A Novel Algorithm for String Matching with Mismatches,"6 pages, 2 figures. First published in the proceedings of the ICPRAM
  2016, Rome 22-26 Feb 2016","ICPRAM 2016, 5th International Conference on Pattern Recognition
  Methods and Applications, Rome 22-26 Feb 2016, pp 638-644",,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an online algorithm to deal with pattern matching in strings. The
problem we investigate is commonly known as string matching with mismatches in
which the objective is to report the number of characters that match when a
pattern is aligned with every location in the text. The novel method we propose
is based on the frequencies of individual characters in the pattern and the
text. The algorithm consumes minimal space in the form of simple arrays, which
reduces the cost overhead to maintain the complex data structures such as
suffix trees or automaton.
","[{'version': 'v1', 'created': 'Thu, 10 Mar 2016 09:55:03 GMT'}]",2016-03-11,"[['P', 'Vinodprasad', '']]","['Pattern Matching in Strings', 'String Matching with Mismatches', 'Similarity Search']"
13597,1108.1478,Ndoundam Rene,"Rene Ndoundam, Juvet Karnel Sadie",Collision-resistant hash function based on composition of functions,"18 pages, 1 figure. The preliminary version of this paper was
  published in the Conference CARI'10, pages 141-148, Yamoussoukro, Ivory
  Coast. The preliminary version was also published in the arXiv August 6, 2011
  under number arXiv:1108.1478v1. This version was submittted to the journal
  ARIMA (January 2011)","ARIMA, Vol. 14 - pp. 167-183, 2011",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  cryptographic hash function is a deterministic procedure that compresses an
arbitrary block of numerical data and returns a fixed-size bit string. There
exist many hash functions: MD5, HAVAL, SHA, ... It was reported that these hash
functions are not longer secure. Our work is focused in the construction of a
new hash function based on composition of functions. The construction used the
NP-completeness of Three-dimensional contingency tables and the relaxation of
the constraint that a hash function should also be a compression function.
","[{'version': 'v1', 'created': 'Sat, 6 Aug 2011 11:58:33 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Sep 2011 07:39:11 GMT'}]",2011-11-23,"[['Ndoundam', 'Rene', ''], ['Sadie', 'Juvet Karnel', '']]","['NP-complete', 'One-way function', 'Matrix of zeros and ones', 'Three-dimensional contingency table', 'Collision-resistant hash function']"
13598,1412.3243,Christian Mayr,"Marko Noack, Johannes Partzsch, Christian Mayr, Stefan H\""anzsche,
  Stefan Scholze, Sebastian H\""oppner, Georg Ellguth, Rene Sch\""uffny","Switched-Capacitor Realization of Presynaptic Short-Term-Plasticity and
  Stop-Learning Synapses in 28 nm CMOS",,,,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Synaptic dynamics, such as long- and short-term plasticity, play an important
role in the complexity and biological realism achievable when running neural
networks on a neuromorphic IC. For example, they endow the IC with an ability
to adapt and learn from its environment. In order to achieve the mil- lisecond
to second time constants required for these synaptic dynamics, analog
subthreshold circuits are usually employed. However, due to process variation
and leakage problems, it is almost impossible to port these types of circuits
to modern sub-100nm technologies. In contrast, we present a neuromor- phic
system in a 28 nm CMOS process that employs switched capacitor (SC) circuits to
implement 128 short term plasticity presynapses as well as 8192 stop-learning
synapses. The neuromorphic system consumes an area of 0.36 mm2 and runs at a
power consumption of 1.9 mW. The circuit makes use of a technique for
minimizing leakage effects allowing for real-time operation with time constants
up to sev- eral seconds. Since we rely on SC techniques for all calculations,
the system is composed of only generic mixed-signal building blocks. These
generic building blocks make the system easy to port between technologies and
the large digital circuit part inherent in an SC system benefits fully from
technology scaling.
","[{'version': 'v1', 'created': 'Wed, 10 Dec 2014 10:04:46 GMT'}]",2014-12-11,"[['Noack', 'Marko', ''], ['Partzsch', 'Johannes', ''], ['Mayr', 'Christian', ''], ['Hänzsche', 'Stefan', ''], ['Scholze', 'Stefan', ''], ['Höppner', 'Sebastian', ''], ['Ellguth', 'Georg', ''], ['Schüffny', 'Rene', '']]","['switched-capacitor neuromorphic', 'stop-learning synapse', 'dynamic synapse', 'deepsubmicron neuromorphic', 'low leakage switchedcapacitor circuits']"
13599,1409.7853,Fatiha Merazka FM,"Aziz Mouzali, Fatiha Merazka",Quantum correction with three codes,24 pages,,,,cs.IT math.IT quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we provise an implementation of five, seven and nine-qubits
error correcting codes on a classical computer using the quantum simulator
Feynman program. We also compare the three codes by computing the fidelity when
double errors occurs in a depolarizing channel. As triple errors and more are
considered very unlikely, it has negligible effect on the next results
","[{'version': 'v1', 'created': 'Sat, 27 Sep 2014 22:46:57 GMT'}]",2014-09-30,"[['Mouzali', 'Aziz', ''], ['Merazka', 'Fatiha', '']]","['Quantum error correction', 'qubits', 'Feynman program', 'Maple', 'Fidelity']"
13600,1204.5442,Qin Xin,Qin Xin,Faster Treasure Hunt and Better Strongly Universal Exploration Sequences,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate the explicit deterministic treasure hunt
problem in a $n$-vertex network. This problem was firstly introduced by Ta-Shma
and Zwick in \cite{TZ07} [SODA'07]. Note also it is a variant of the well known
rendezvous problem in which one of the robot (the treasure) is always
stationary. In this paper, we propose an $O(n^{c(1+\frac{1}{\lambda})})$-time
algorithm for the treasure hunt problem, which significantly improves the
currently best known result of running time $O(n^{2c})$ in \cite{TZ07}, where
$c$ is a constant induced from the construction of an universal exploration
sequence in \cite{R05,TZ07}, and $\lambda \gg 1$ is an arbitrary large, but
fixed, integer constant. The treasure hunt problem also motivates the study of
strongly universal exploration sequences. In this paper, we also propose a much
better explicit construction for strongly universal exploration sequences
compared to the one in \cite{TZ07}.
","[{'version': 'v1', 'created': 'Tue, 24 Apr 2012 17:33:56 GMT'}]",2012-04-25,"[['Xin', 'Qin', '']]","['Design and analysis of algorithms', 'distributed computing', 'graphsearching and robotics', 'rendezvous', 'strongly universal exploration sequences']"
13601,1406.4291,Christopher Meiklejohn,Christopher Meiklejohn,Vector Clocks in Coq: An Experience Report,,,,,cs.DC cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This report documents the process of implementing vector clocks in the Coq
proof assistant for extraction and use in the distributed Dynamo-inspired data
store, Riak. In this report, we focus on the technical challenges of using Core
Erlang code extracted from the proof assistant in a production-grade Erlang
application, as opposed to verification of the model itself.
","[{'version': 'v1', 'created': 'Tue, 17 Jun 2014 09:32:16 GMT'}]",2014-06-18,"[['Meiklejohn', 'Christopher', '']]","['Dynamo', 'Erlang', 'Riak', 'vector clocks']"
13602,1004.3260,Vishal Goyal,"Rosmayati Mohemad, Abdul Razak Hamdan, Zulaiha Ali Othman, Noor
  Maizura Mohamad Noor",Decision Support Systems (DSS) in Construction Tendering Processes,"International Journal of Computer Science Issues online at
  http://ijcsi.org/articles/Decision-Support-Systems-DSS-in-Construction-Tendering-Processes.php","IJCSI, Volume 7, Issue 2, March 2010",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The successful execution of a construction project is heavily impacted by
making the right decision during tendering processes. Managing tender
procedures is very complex and uncertain involving coordination of many tasks
and individuals with different priorities and objectives. Bias and inconsistent
decision are inevitable if the decision-making process is totally depends on
intuition, subjective judgement or emotion. In making transparent decision and
healthy competition tendering, there exists a need for flexible guidance tool
for decision support. Aim of this paper is to give a review on current
practices of Decision Support Systems (DSS) technology in construction
tendering processes. Current practices of general tendering processes as
applied to the most countries in different regions such as United States,
Europe, Middle East and Asia are comprehensively discussed. Applications of
Web-based tendering processes is also summarised in terms of its properties.
Besides that, a summary of Decision Support System (DSS) components is included
in the next section. Furthermore, prior researches on implementation of DSS
approaches in tendering processes are discussed in details. Current issues
arise from both of paper-based and Web-based tendering processes are outlined.
Finally, conclusion is included at the end of this paper.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2010 17:56:06 GMT'}]",2010-04-20,"[['Mohemad', 'Rosmayati', ''], ['Hamdan', 'Abdul Razak', ''], ['Othman', 'Zulaiha Ali', ''], ['Noor', 'Noor Maizura Mohamad', '']]","['Construction industry', 'decision-making', 'decision support systems', 'tendering']"
13603,0906.5034,R Doomun,"Anshika Pal, Deepak Singh Tomar, S.C. Shrivastava",Effective Focused Crawling Based on Content and Link Structure Analysis,"5 Pages, International Journal of Computer Science and Information
  Security (IJCSIS)","IJCSIS June 2009 Issue, Vol. 2, No. 1",,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A focused crawler traverses the web selecting out relevant pages to a
predefined topic and neglecting those out of concern. While surfing the
internet it is difficult to deal with irrelevant pages and to predict which
links lead to quality pages. In this paper a technique of effective focused
crawling is implemented to improve the quality of web navigation. To check the
similarity of web pages w.r.t. topic keywords a similarity function is used and
the priorities of extracted out links are also calculated based on meta data
and resultant pages generated from focused crawler. The proposed work also uses
a method for traversing the irrelevant pages that met during crawling to
improve the coverage of a specific topic.
","[{'version': 'v1', 'created': 'Sat, 27 Jun 2009 03:50:59 GMT'}]",2009-06-30,"[['Pal', 'Anshika', ''], ['Tomar', 'Deepak Singh', ''], ['Shrivastava', 'S. C.', '']]","['focused crawler', 'metadata', 'weight table', 'World-Wide Web', 'Search Engine', 'links ranking']"
13604,1603.05962,Stanislas Lauly,"Stanislas Lauly, Yin Zheng, Alexandre Allauzen, Hugo Larochelle",Document Neural Autoregressive Distribution Estimation,,,,,cs.LG cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an approach based on feed-forward neural networks for learning the
distribution of textual documents. This approach is inspired by the Neural
Autoregressive Distribution Estimator(NADE) model, which has been shown to be a
good estimator of the distribution of discrete-valued igh-dimensional vectors.
In this paper, we present how NADE can successfully be adapted to the case of
textual data, retaining from NADE the property that sampling or computing the
probability of observations can be done exactly and efficiently. The approach
can also be used to learn deep representations of documents that are
competitive to those learned by the alternative topic modeling approaches.
Finally, we describe how the approach can be combined with a regular neural
network N-gram model and substantially improve its performance, by making its
learned representation sensitive to the larger, document-specific context.
","[{'version': 'v1', 'created': 'Fri, 18 Mar 2016 19:24:44 GMT'}]",2016-03-21,"[['Lauly', 'Stanislas', ''], ['Zheng', 'Yin', ''], ['Allauzen', 'Alexandre', ''], ['Larochelle', 'Hugo', '']]","['Neural networks', 'Deep learning', 'Topic models', 'Language models', 'Autoregressivemodels']"
13605,1203.0970,Yuyang Wang,"Yuyang Wang, Roni Khardon, Pavlos Protopapas","Infinite Shift-invariant Grouped Multi-task Learning for Gaussian
  Processes","This is an extended version of our ECML 2010 paper entitled
  ""Shift-invariant Grouped Multi-task Learning for Gaussian Processes""; ECML
  PKDD'10 Proceedings of the 2010 European conference on Machine learning and
  knowledge discovery in databases: Part III",,,,cs.LG astro-ph.IM stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-task learning leverages shared information among data sets to improve
the learning performance of individual tasks. The paper applies this framework
for data where each task is a phase-shifted periodic time series. In
particular, we develop a novel Bayesian nonparametric model capturing a mixture
of Gaussian processes where each task is a sum of a group-specific function and
a component capturing individual variation, in addition to each task being
phase shifted. We develop an efficient \textsc{em} algorithm to learn the
parameters of the model. As a special case we obtain the Gaussian mixture model
and \textsc{em} algorithm for phased-shifted periodic time series. Furthermore,
we extend the proposed model by using a Dirichlet Process prior and thereby
leading to an infinite mixture model that is capable of doing automatic model
selection. A Variational Bayesian approach is developed for inference in this
model. Experiments in regression, classification and class discovery
demonstrate the performance of the proposed models using both synthetic data
and real-world time series data from astrophysics. Our methods are particularly
useful when the time series are sparsely and non-synchronously sampled.
","[{'version': 'v1', 'created': 'Mon, 5 Mar 2012 17:07:10 GMT'}, {'version': 'v2', 'created': 'Mon, 20 May 2013 04:07:12 GMT'}]",2015-03-20,"[['Wang', 'Yuyang', ''], ['Khardon', 'Roni', ''], ['Protopapas', 'Pavlos', '']]","['Gaussian processes', 'Dirichlet process', 'Multi-task learning', 'em algorithm', 'Variational Inference']"
13606,0706.2746,Stefano Tessaro,"Robert Koenig, Ueli Maurer, Stefano Tessaro",Abstract Storage Devices,20 pages,,,,cs.DM cs.CC cs.IT math.IT,,"  A quantum storage device differs radically from a conventional physical
storage device. Its state can be set to any value in a certain (infinite) state
space, but in general every possible read operation yields only partial
information about the stored state.
  The purpose of this paper is to initiate the study of a combinatorial
abstraction, called abstract storage device (ASD), which models deterministic
storage devices with the property that only partial information about the state
can be read, but that there is a degree of freedom as to which partial
information should be retrieved.
  This concept leads to a number of interesting problems which we address, like
the reduction of one device to another device, the equivalence of devices,
direct products of devices, as well as the factorization of a device into
primitive devices. We prove that every ASD has an equivalent ASD with minimal
number of states and of possible read operations. Also, we prove that the
reducibility problem for ASD's is NP-complete, that the equivalence problem is
at least as hard as the graph isomorphism problem, and that the factorization
into binary-output devices (if it exists) is unique.
","[{'version': 'v1', 'created': 'Tue, 19 Jun 2007 17:14:24 GMT'}]",2007-07-13,"[['Koenig', 'Robert', ''], ['Maurer', 'Ueli', ''], ['Tessaro', 'Stefano', '']]","['Discrete Structures', 'Storage Devices', 'NP-Completeness', 'Computational Complexity', 'Factorizations']"
13607,1310.1042,Jan Mazak,Edita M\'a\v{c}ajov\'a and J\'an Maz\'ak,Cubic graphs with large circumference deficit,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The circumference $c(G)$ of a graph $G$ is the length of a longest cycle. By
exploiting our recent results on resistance of snarks, we construct infinite
classes of cyclically $4$-, $5$- and $6$-edge-connected cubic graphs with
circumference ratio $c(G)/|V(G)|$ bounded from above by $0.876$, $0.960$ and
$0.990$, respectively. In contrast, the dominating cycle conjecture implies
that the circumference ratio of a cyclically $4$-edge-connected cubic graph is
at least $0.75$.
  In addition, we construct snarks with large girth and large circumference
deficit, solving Problem 1 proposed in [J. H\""agglund and K. Markstr\""om, On
stable cycles and cycle double covers of graphs with large circumference, Disc.
Math. 312 (2012), 2540--2544].
","[{'version': 'v1', 'created': 'Thu, 3 Oct 2013 17:56:39 GMT'}, {'version': 'v2', 'created': 'Sat, 9 Nov 2013 22:58:44 GMT'}]",2013-11-12,"[['Máčajová', 'Edita', ''], ['Mazák', 'Ján', '']]","['circumference', 'cubic graph', 'snark', 'girth']"
13608,2006.04255,Koushik Nagasubramanian,"Koushik Nagasubramanian, Talukder Z. Jubery, Fateme Fotouhi Ardakani,
  Seyed Vahid Mirnezami, Asheesh K. Singh, Arti Singh, Soumik Sarkar, and
  Baskar Ganapathysubramanian",How useful is Active Learning for Image-based Plant Phenotyping?,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning models have been successfully deployed for a diverse array of
image-based plant phenotyping applications including disease detection and
classification. However, successful deployment of supervised deep learning
models requires large amount of labeled data, which is a significant challenge
in plant science (and most biological) domains due to the inherent complexity.
Specifically, data annotation is costly, laborious, time consuming and needs
domain expertise for phenotyping tasks, especially for diseases. To overcome
this challenge, active learning algorithms have been proposed that reduce the
amount of labeling needed by deep learning models to achieve good predictive
performance. Active learning methods adaptively select samples to annotate
using an acquisition function to achieve maximum (classification) performance
under a fixed labeling budget. We report the performance of four different
active learning methods, (1) Deep Bayesian Active Learning (DBAL), (2) Entropy,
(3) Least Confidence, and (4) Coreset, with conventional random sampling-based
annotation for two different image-based classification datasets. The first
image dataset consists of soybean [Glycine max L. (Merr.)] leaves belonging to
eight different soybean stresses and a healthy class, and the second consists
of nine different weed species from the field. For a fixed labeling budget, we
observed that the classification performance of deep learning models with
active learning-based acquisition strategies is better than random
sampling-based acquisition for both datasets. The integration of active
learning strategies for data annotation can help mitigate labelling challenges
in the plant sciences applications particularly where deep domain knowledge is
required.
","[{'version': 'v1', 'created': 'Sun, 7 Jun 2020 20:32:42 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Jul 2020 08:20:24 GMT'}, {'version': 'v3', 'created': 'Sat, 11 Jul 2020 07:07:28 GMT'}]",2020-07-14,"[['Nagasubramanian', 'Koushik', ''], ['Jubery', 'Talukder Z.', ''], ['Ardakani', 'Fateme Fotouhi', ''], ['Mirnezami', 'Seyed Vahid', ''], ['Singh', 'Asheesh K.', ''], ['Singh', 'Arti', ''], ['Sarkar', 'Soumik', ''], ['Ganapathysubramanian', 'Baskar', '']]","['Active Learning', 'Deep Learning', 'Plant Phenotyping']"
13609,1606.03543,Emily Keen,"Emily Keen, Simon Milton and Rachelle Bosua","Using stories to bridge the chasm between perspectives: How metaphors
  and genres are used to share meaning","Research-in-progress ISBN# 978-0-646-95337-3 Presented at the
  Australasian Conference on Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/226,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Natural language, although complex in structure, contains considerable
detail. All instances of language serve the purpose of making sense of
experience and the intent of actors. Language conveys actor's personal
reference to goals, responsibility, and values. In this paper we consider how
actors from distinct perspectives communicate when they have share common
goals. We have observed the planning of a community and cultural event where
actors are variously responsible for management and for artistic merit.
  Specifically, we consider actor's use of language as a tool to span
perspectives and how functional discourse analysis tools and techniques enable
a deeper interpretive understanding of the layers of discourse when derived
from a rich context. We will also illustrate patterns we have found in the use
of discourse and actor's ability to bridge the reasoning and logical gap
between distinct perspectives through actor's reference to metaphors and
genres.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 03:39:39 GMT'}]",2016-06-14,"[['Keen', 'Emily', ''], ['Milton', 'Simon', ''], ['Bosua', 'Rachelle', '']]","['Metaphors', 'Genres', 'Perspectivism', 'Ontology Concept Formulation', 'Discourse', 'Domain Mapping']"
13610,1212.6492,David  Gao,"Changzhi Wu, Chaojie Li, and David Yang Gao","Canonical Primal-Dual Method for Solving Non-convex Minimization
  Problems","21 pages, 6 figures and 4 tables",,,,cs.NA cs.DS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new primal-dual algorithm is presented for solving a class of non-convex
minimization problems. This algorithm is based on canonical duality theory such
that the original non-convex minimization problem is first reformulated as a
convex-concave saddle point optimization problem, which is then solved by a
quadratically perturbed primal-dual method. %It is proved that the popular SDP
method is indeed a special case of the canonical duality theory. Numerical
examples are illustrated. Comparing with the existing results, the proposed
algorithm can achieve better performance.
","[{'version': 'v1', 'created': 'Fri, 28 Dec 2012 09:30:57 GMT'}]",2013-01-01,"[['Wu', 'Changzhi', ''], ['Li', 'Chaojie', ''], ['Gao', 'David Yang', '']]","['Global optimization', 'canonical duality theory', 'quadratic perturbation', 'sensor networkoptimization']"
13611,1705.05452,Bernd Schuh,Bernd R. Schuh,Polynomial time estimates for #SAT,,,,,cs.CC cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Limits on the number of satisfying assignments for CNS instances with n
variables and m clauses are derived from various inequalities. Some bounds can
be calculated in polynomial time, sharper bounds demand information about the
distribution of the number of unsatisfied clauses. Quite generally, the number
of satisfying assignments involve variance and mean of this distribution. For
large formulae, m>>1, bounds vary with 2**n/n, so they may be of use only for
instances with a large number of satisfying assignments.
","[{'version': 'v1', 'created': 'Mon, 1 May 2017 08:25:30 GMT'}]",2017-05-17,"[['Schuh', 'Bernd R.', '']]","['complexity', 'satisfiability', '#P', 'NP', 'SAT', '3-SAT', 'READ-3', 'inequalities']"
13612,1212.0892,Vasiliy Tereshkov,Vasiliy M. Tereshkov,An Intuitive Approach to Inertial Sensor Bias Estimation,"6 pages, 7 figures",,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A simple approach to gyro and accelerometer bias estimation is proposed. It
does not involve Kalman filtering or similar formal techniques. Instead, it is
based on physical intuition and exploits a duality between gimbaled and
strapdown inertial systems. The estimation problem is decoupled into two
separate stages. At the first stage, inertial system attitude errors are
corrected by means of a feedback from an external aid. In the presence of
uncompensated biases, the steady-state feedback rebalances those biases and can
be used to estimate them. At the second stage, the desired bias estimates are
expressed in a closed form in terms of the feedback signal. The estimator has
only three tunable parameters and is easy to implement and use. The tests
proved the feasibility of the proposed approach for the estimation of low-cost
MEMS inertial sensor biases on a moving land vehicle.
","[{'version': 'v1', 'created': 'Tue, 4 Dec 2012 22:11:10 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Jun 2013 09:12:46 GMT'}, {'version': 'v3', 'created': 'Mon, 1 Jul 2013 13:04:41 GMT'}]",2013-07-02,"[['Tereshkov', 'Vasiliy M.', '']]","['Inertial navigation', 'Kalman filters', 'Sensor systems', 'State estimation']"
13613,0710.4850,EDA Publishing Association,"Michael Ullmann, Wansheng Jin, Jurgen Becker","Hardware Support for QoS-based Function Allocation in Reconfigurable
  Systems",Submitted on behalf of EDAA (http://www.edaa.com/),"Dans Design, Automation and Test in Europe | Designers'Forum -
  DATE'05, Munich : Allemagne (2005)",,,cs.AR,,"  This contribution presents a new approach for allocating suitable
function-implementation variants depending on given quality-of-service
function-requirements for run-time reconfigurable multi-device systems. Our
approach adapts methodologies from the domain of knowledge-based systems which
can be used for doing run-time hardware/software resource usage optimizations.
","[{'version': 'v1', 'created': 'Thu, 25 Oct 2007 12:24:59 GMT'}]",2011-11-09,"[['Ullmann', 'Michael', ''], ['Jin', 'Wansheng', ''], ['Becker', 'Jurgen', '']]","['CBR', 'Algorithm', 'Resource Management']"
13614,1304.4086,Ramon Ferrer i Cancho,Ramon Ferrer-i-Cancho,"Hubiness, length, crossings and their relationships in dependency trees",The upper bound for for the number of crossings has been improved,"Ferrer-i-Cancho, R. (2013). Hubiness, length, crossings and their
  relationships in dependency trees. Glottometrics 25, 1-21",,,cs.CL cs.DM cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Here tree dependency structures are studied from three different
perspectives: their degree variance (hubiness), the mean dependency length and
the number of dependency crossings. Bounds that reveal pairwise dependencies
among these three metrics are derived. Hubiness (the variance of degrees) plays
a central role: the mean dependency length is bounded below by hubiness while
the number of crossings is bounded above by hubiness. Our findings suggest that
the online memory cost of a sentence might be determined not just by the
ordering of words but also by the hubiness of the underlying structure. The 2nd
moment of degree plays a crucial role that is reminiscent of its role in large
complex networks.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2013 13:10:22 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Apr 2013 14:01:35 GMT'}, {'version': 'v3', 'created': 'Thu, 18 Apr 2013 10:30:09 GMT'}, {'version': 'v4', 'created': 'Fri, 19 Apr 2013 10:08:50 GMT'}, {'version': 'v5', 'created': 'Wed, 15 May 2013 13:45:21 GMT'}]",2013-05-16,"[['Ferrer-i-Cancho', 'Ramon', '']]","['syntactic dependency', 'syntax', 'dependency length', 'crossings']"
13615,1710.03559,Zheng Wang,"Jie Ren, Ling Gao, Hai Wang, Zheng Wang",Energy-aware Web Browsing on Heterogeneous Mobile Platforms,Appeared at IEEE INFOCOM 2017,,,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Web browsing is an activity that billions of mobile users perform on a daily
basis. Battery life is a primary concern to many mobile users who often find
their phone has died at most inconvenient times. The heterogeneous multi-core
architecture is a solution for energy-efficient processing. However, the
current mobile web browsers rely on the operating system to exploit the
underlying hardware, which has no knowledge of individual web contents and
often leads to poor energy efficiency. This paper describes an automatic
approach to render mobile web workloads for performance and energy efficiency.
It achieves this by developing a machine learning based approach to predict
which processor to use to run the web rendering engine and at what frequencies
the processors should operate. Our predictor learns offline from a set of
training web workloads. The built predictor is then integrated into the browser
to predict the optimal processor configuration at runtime, taking into account
the web workload characteristics and the optimisation goal: whether it is load
time, energy consumption or a trade-off between them. We evaluate our approach
on a representative ARM big.LITTLE mobile architecture using the hottest 500
webpages. Our approach achieves 80% of the performance delivered by an ideal
predictor. We obtain, on average, 45%, 63.5% and 81% improvement respectively
for load time, energy consumption and the energy delay product, when compared
to the Linux heterogeneous multi-processing scheduler.
","[{'version': 'v1', 'created': 'Mon, 9 Oct 2017 09:33:01 GMT'}]",2017-10-11,"[['Ren', 'Jie', ''], ['Gao', 'Ling', ''], ['Wang', 'Hai', ''], ['Wang', 'Zheng', '']]","['MobileWebBrowsing', 'EnergyOptimisation', 'big']"
13616,1501.04789,Charles Grellois,Charles Grellois and Paul-Andr\'e Melli\`es,Relational semantics of linear logic and higher-order model-checking,24 pages. Submitted,,,,cs.LO cs.PL math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, we develop a new and somewhat unexpected connection between
higher-order model-checking and linear logic. Our starting point is the
observation that once embedded in the relational semantics of linear logic, the
Church encoding of any higher-order recursion scheme (HORS) comes together with
a dual Church encoding of an alternating tree automata (ATA) of the same
signature. Moreover, the interaction between the relational interpretations of
the HORS and of the ATA identifies the set of accepting states of the tree
automaton against the infinite tree generated by the recursion scheme. We show
how to extend this result to alternating parity automata (APT) by introducing a
parametric version of the exponential modality of linear logic, capturing the
formal properties of colors (or priorities) in higher-order model-checking. We
show in particular how to reunderstand in this way the type-theoretic approach
to higher-order model-checking developed by Kobayashi and Ong. We briefly
explain in the end of the paper how his analysis driven by linear logic results
in a new and purely semantic proof of decidability of the formulas of the
monadic second-order logic for higher-order recursion schemes.
","[{'version': 'v1', 'created': 'Tue, 20 Jan 2015 12:51:34 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Apr 2015 14:35:28 GMT'}, {'version': 'v3', 'created': 'Fri, 1 May 2015 10:11:26 GMT'}]",2016-09-29,"[['Grellois', 'Charles', ''], ['Melliès', 'Paul-André', '']]","['Higher-order model-checking', 'linear logic', 'relational semantics', 'paritygames', 'parametric comonads']"
13617,1209.0835,Neil Zhenqiang Gong,"Neil Zhenqiang Gong, Wenchang Xu, Ling Huang, Prateek Mittal, Emil
  Stefanov, Vyas Sekar, Dawn Song","Evolution of Social-Attribute Networks: Measurements, Modeling, and
  Implications using Google+","14 pages, 19 figures. will appear in IMC'12",,,,cs.SI cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding social network structure and evolution has important
implications for many aspects of network and system design including
provisioning, bootstrapping trust and reputation systems via social networks,
and defenses against Sybil attacks. Several recent results suggest that
augmenting the social network structure with user attributes (e.g., location,
employer, communities of interest) can provide a more fine-grained
understanding of social networks. However, there have been few studies to
provide a systematic understanding of these effects at scale. We bridge this
gap using a unique dataset collected as the Google+ social network grew over
time since its release in late June 2011. We observe novel phenomena with
respect to both standard social network metrics and new attribute-related
metrics (that we define). We also observe interesting evolutionary patterns as
Google+ went from a bootstrap phase to a steady invitation-only stage before a
public release. Based on our empirical observations, we develop a new
generative model to jointly reproduce the social structure and the node
attributes. Using theoretical analysis and empirical evaluations, we show that
our model can accurately reproduce the social and attribute structure of real
social networks. We also demonstrate that our model provides more accurate
predictions for practical application contexts.
","[{'version': 'v1', 'created': 'Wed, 5 Sep 2012 01:01:47 GMT'}, {'version': 'v2', 'created': 'Sat, 8 Sep 2012 04:12:28 GMT'}, {'version': 'v3', 'created': 'Tue, 11 Sep 2012 17:17:36 GMT'}, {'version': 'v4', 'created': 'Wed, 19 Sep 2012 02:24:50 GMT'}]",2012-09-20,"[['Gong', 'Neil Zhenqiang', ''], ['Xu', 'Wenchang', ''], ['Huang', 'Ling', ''], ['Mittal', 'Prateek', ''], ['Stefanov', 'Emil', ''], ['Sekar', 'Vyas', ''], ['Song', 'Dawn', '']]","['Social network measurement', 'Node attributes', 'Social network evolution', 'Heterogeneous network measurement and modeling', 'Google+']"
13618,1007.0730,Frederic Thouin,"Frederic Thouin, Mark Coates, Michael Rabbat",Large scale probabilistic available bandwidth estimation,Submitted to Computer Networks,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The common utilization-based definition of available bandwidth and many of
the existing tools to estimate it suffer from several important weaknesses: i)
most tools report a point estimate of average available bandwidth over a
measurement interval and do not provide a confidence interval; ii) the commonly
adopted models used to relate the available bandwidth metric to the measured
data are invalid in almost all practical scenarios; iii) existing tools do not
scale well and are not suited to the task of multi-path estimation in
large-scale networks; iv) almost all tools use ad-hoc techniques to address
measurement noise; and v) tools do not provide enough flexibility in terms of
accuracy, overhead, latency and reliability to adapt to the requirements of
various applications. In this paper we propose a new definition for available
bandwidth and a novel framework that addresses these issues. We define
probabilistic available bandwidth (PAB) as the largest input rate at which we
can send a traffic flow along a path while achieving, with specified
probability, an output rate that is almost as large as the input rate. PAB is
expressed directly in terms of the measurable output rate and includes
adjustable parameters that allow the user to adapt to different application
requirements. Our probabilistic framework to estimate network-wide
probabilistic available bandwidth is based on packet trains, Bayesian
inference, factor graphs and active sampling. We deploy our tool on the
PlanetLab network and our results show that we can obtain accurate estimates
with a much smaller measurement overhead compared to existing approaches.
","[{'version': 'v1', 'created': 'Mon, 5 Jul 2010 17:42:44 GMT'}]",2010-07-06,"[['Thouin', 'Frederic', ''], ['Coates', 'Mark', ''], ['Rabbat', 'Michael', '']]","['Bayesian inference', 'active sampling', 'belief propagation', 'network monitoring']"
13619,1501.01694,Mayank Kejriwal,"Mayank Kejriwal, Daniel P. Miranker",A DNF Blocking Scheme Learner for Heterogeneous Datasets,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Entity Resolution concerns identifying co-referent entity pairs across
datasets. A typical workflow comprises two steps. In the first step, a blocking
method uses a one-many function called a blocking scheme to map entities to
blocks. In the second step, entities sharing a block are paired and compared.
Current DNF blocking scheme learners (DNF-BSLs) apply only to structurally
homogeneous tables. We present an unsupervised algorithmic pipeline for
learning DNF blocking schemes on RDF graph datasets, as well as structurally
heterogeneous tables. Previous DNF-BSLs are admitted as special cases. We
evaluate the pipeline on six real-world dataset pairs. Unsupervised results are
shown to be competitive with supervised and semi-supervised baselines. To the
best of our knowledge, this is the first unsupervised DNF-BSL that admits RDF
graphs and structurally heterogeneous tables as inputs.
","[{'version': 'v1', 'created': 'Thu, 8 Jan 2015 00:37:09 GMT'}]",2015-01-09,"[['Kejriwal', 'Mayank', ''], ['Miranker', 'Daniel P.', '']]","['Heterogeneity', 'Entity Resolution', 'Unsupervised Learning']"
13620,1611.00580,Jad Hamza,"Ahmed Bouajjani, Constantin Enea, Rachid Guerraoui, Jad Hamza",On Verifying Causal Consistency,extended version of POPL 2017,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Causal consistency is one of the most adopted consistency criteria for
distributed implementations of data structures. It ensures that operations are
executed at all sites according to their causal precedence. We address the
issue of verifying automatically whether the executions of an implementation of
a data structure are causally consistent. We consider two problems: (1)
checking whether one single execution is causally consistent, which is relevant
for developing testing and bug finding algorithms, and (2) verifying whether
all the executions of an implementation are causally consistent.
  We show that the first problem is NP-complete. This holds even for the
read-write memory abstraction, which is a building block of many modern
distributed systems. Indeed, such systems often store data in key-value stores,
which are instances of the read-write memory abstraction. Moreover, we prove
that, surprisingly, the second problem is undecidable, and again this holds
even for the read-write memory abstraction. However, we show that for the
read-write memory abstraction, these negative results can be circumvented if
the implementations are data independent, i.e., their behaviors do not depend
on the data values that are written or read at each moment, which is a
realistic assumption.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2016 13:01:50 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Nov 2016 11:50:13 GMT'}]",2016-11-16,"[['Bouajjani', 'Ahmed', ''], ['Enea', 'Constantin', ''], ['Guerraoui', 'Rachid', ''], ['Hamza', 'Jad', '']]","['distributed systems', 'causal consistency', 'model checking', 'static program analysis']"
13621,1111.3165,Pardeep Kumar,"Pardeep Kumar, Vivek Kumar Sehgal, Durg Singh Chauhan, P. K. Gupta and
  Manoj Diwakar","Effective Ways of Secure, Private and Trusted Cloud Computing","10 pages,6 figures; IJCSI International Journal of Computer Science
  Issues, May 2011",,,,cs.DC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing is an Internet-based computing, where shared resources,
software and information, are provided to computers and devices on-demand. It
provides people the way to share distributed resources and services that belong
to different organization. Since cloud computing uses distributed resources in
open environment, thus it is important to provide the security and trust to
share the data for developing cloud computing applications. In this paper we
assess how can cloud providers earn their customers' trust and provide the
security, privacy and reliability, when a third party is processing sensitive
data in a remote machine located in various countries? A concept of utility
cloud has been represented to provide the various services to the users.
Emerging technologies can help address the challenges of Security, Privacy and
Trust in cloud computing.
","[{'version': 'v1', 'created': 'Mon, 14 Nov 2011 10:28:59 GMT'}]",2011-11-15,"[['Kumar', 'Pardeep', ''], ['Sehgal', 'Vivek Kumar', ''], ['Chauhan', 'Durg Singh', ''], ['Gupta', 'P. K.', ''], ['Diwakar', 'Manoj', '']]","['Cloud Computing', 'Utility computing', 'Risk Management', 'Access Control Model', 'Quality Assurance']"
13622,1206.4710,Serban Vlad E.,Serban E. Vlad,"On the basins of attraction of the regular autonomous asynchronous
  systems","21 pages, Acta universitatis apulensis, Mathematics-informatics,
  special issue, 2011. arXiv admin note: substantial text overlap with
  arXiv:1012.5838",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Boolean autonomous dynamical systems, also called regular autonomous
asynchronous systems are systems whose 'vector field' is a function
{\Phi}:{0,1}^{n}{\to}{0,1}^{n} and time is discrete or continuous. While the
synchronous systems have their coordinate functions {\Phi}_{1},...,{\Phi}_{n}
computed at the same time:
{\Phi},{\Phi}{\circ}{\Phi},{\Phi}{\circ}{\Phi}{\circ}{\Phi},... the
asynchronous systems have {\Phi}_{1},...,{\Phi}_{n} computed independently on
each other. The purpose of the paper is that of studying the basins of
attraction of the fixed points, of the orbits and of the {\omega}-limit sets of
the regular autonomous asynchronous systems. The bibliography consists in
analogies.
","[{'version': 'v1', 'created': 'Wed, 20 Jun 2012 20:26:00 GMT'}, {'version': 'v2', 'created': 'Sat, 20 Jul 2013 21:47:03 GMT'}]",2013-07-23,"[['Vlad', 'Serban E.', '']]","['asynchronous system', 'ω−limit set', 'invariance', 'basin ofattraction']"
13623,1507.01771,Keehang Kwon,Keehang Kwon,A New Execution Model for the logic of hereditary Harrop formulas,"6 pages. arXiv admin note: substantial text overlap with
  arXiv:1211.6535",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The class of first-order Hereditary Harrop formulas ($fohh$) is a
well-established extension of first-order Horn clauses. Its operational
semantics is based on intuitionistic provability.
  We propose another operational semantics for $fohh$ which is based on game
semantics. This new semantics has several interesting aspects: in particular,
it gives a logical status to the $read$ predicate in Prolog.
","[{'version': 'v1', 'created': 'Tue, 7 Jul 2015 12:08:39 GMT'}]",2015-07-08,"[['Kwon', 'Keehang', '']]","['interaction', 'game semantics', 'read', 'computability logic']"
13624,1409.6231,Alexandr Klimchik,"Alexandr Klimchik (EM NANTES, IRCCyN), Dmitry Bondarenko (IRCCyN),
  Anatol Pashkevich (EM NANTES, IRCCyN), S\'ebastien Briot (IRCCyN), Beno\^it
  Furet (IRCCyN)",Compliance error compensation in robotic-based milling,,"Informatics in Control, Automation and Robotics, .-L. Ferrier, A.
  Bernard, O. Gusikhin, K. Madani (Ed.) (2014) 197-216",,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper deals with the problem of compliance errors compensation in
robotic-based milling. Contrary to previous works that assume that the
forces/torques generated by the manufacturing process are constant, the
interaction between the milling tool and the workpiece is modeled in details.
It takes into account the tool geometry, the number of teeth, the feed rate,
the spindle rotation speed and the properties of the material to be processed.
Due to high level of the disturbing forces/torques, the developed compensation
technique is based on the non-linear stiffness model that allows us to modify
the target trajectory taking into account nonlinearities and to avoid the
chattering effect. Illustrative example is presented that deals with
robotic-based milling of aluminum alloy.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 16:36:31 GMT'}]",2014-09-23,"[['Klimchik', 'Alexandr', '', 'EM NANTES, IRCCyN'], ['Bondarenko', 'Dmitry', '', 'IRCCyN'], ['Pashkevich', 'Anatol', '', 'EM NANTES, IRCCyN'], ['Briot', 'Sébastien', '', 'IRCCyN'], ['Furet', 'Benoît', '', 'IRCCyN']]","['Industrial robot', 'milling', 'compliance error compensation', 'dynamic machining force model', 'non-linear stiffness model']"
13625,1111.0382,Jaydip Sen,Jaydip Sen,A Distributed Intrusion Detection System Using Cooperating Agents,"10 pages, 4 figures, 1 table. In Proceedings of the 3rd International
  Conference on Information Processing (ICIP'09), August 7 - 9, Bangalore,
  2009, pp. 559 - 568",,,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The current intrusion detection systems have a number of problems that limit
their configurability, scalability and efficiency. There have been some
propositions about distributed architectures based on multiple independent
agents working collectively for intrusion detection. However, these distributed
intrusion detection systems are not fully distributed as most of them centrally
analyze data collected from distributed nodes which may lead to a single point
of failure. In this paper, a distributed intrusion detection architecture is
presented that is based on autonomous and cooperating agents without any
centralized analysis components. The agents cooperate by using a hierarchical
communication of interests and data, and the analysis of intrusion data is made
by the agents at the lowest level of the hierarchy. This architecture provides
significant advantages in scalability, flexibility, extensibility, fault
tolerance, and resistance to compromise. A proof-of-concept prototype is
developed and experiments have been conducted on it. The results show the
effectiveness of the system in detecting intrusive activities.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2011 04:33:48 GMT'}]",2011-11-03,"[['Sen', 'Jaydip', '']]","['Distributed intrusion detection', 'agents', 'multi-agent systems', 'Java agent development environment (JADE)']"
13626,1407.1610,Pulkit Agrawal,"Pulkit Agrawal, Ross Girshick, Jitendra Malik","Analyzing the Performance of Multilayer Neural Networks for Object
  Recognition",Published in European Conference on Computer Vision 2014 (ECCV-2014),,,,cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last two years, convolutional neural networks (CNNs) have achieved an
impressive suite of results on standard recognition datasets and tasks.
CNN-based features seem poised to quickly replace engineered representations,
such as SIFT and HOG. However, compared to SIFT and HOG, we understand much
less about the nature of the features learned by large CNNs. In this paper, we
experimentally probe several aspects of CNN feature learning in an attempt to
help practitioners gain useful, evidence-backed intuitions about how to apply
CNNs to computer vision problems.
","[{'version': 'v1', 'created': 'Mon, 7 Jul 2014 08:00:57 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Sep 2014 17:49:01 GMT'}]",2014-09-23,"[['Agrawal', 'Pulkit', ''], ['Girshick', 'Ross', ''], ['Malik', 'Jitendra', '']]","['convolutional neural networks', 'object recognition', 'empirical analysis']"
13627,1407.2899,Gabriela Montoya,"Gabriela Montoya (LINA), Hala Skaf-Molli (LINA), Pascal Molli (LINA),
  Maria-Esther Vidal",Fedra: Query Processing for SPARQL Federations with Divergence,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data replication and deployment of local SPARQL endpoints improve scalability
and availability of public SPARQL endpoints, making the consumption of Linked
Data a reality. This solution requires synchronization and specific query
processing strategies to take advantage of replication. However, existing
replication aware techniques in federations of SPARQL endpoints do not consider
data dynamicity. We propose Fedra, an approach for querying federations of
endpoints that benefits from replication. Participants in Fedra federations can
copy fragments of data from several datasets, and describe them using
provenance and views. These descriptions enable Fedra to reduce the number of
selected endpoints while satisfying user divergence requirements. Experiments
on real-world datasets suggest savings of up to three orders of magnitude.
","[{'version': 'v1', 'created': 'Thu, 10 Jul 2014 18:39:47 GMT'}]",2014-07-11,"[['Montoya', 'Gabriela', '', 'LINA'], ['Skaf-Molli', 'Hala', '', 'LINA'], ['Molli', 'Pascal', '', 'LINA'], ['Vidal', 'Maria-Esther', '']]","['Source Selection', 'SPARQL Endpoints', 'Data Replication']"
13628,1407.0097,Qi Zhang,"Qi Zhang, Meizhu Li, Yong Deng",A betweenness structure entropy of complex networks,"18 pages, 10 figures",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The structure entropy is an important index to illuminate the structure
property of the complex network. Most of the existing structure entropies are
based on the degree distribution of the complex network. But the structure
entropy based on the degree can not illustrate the structure property of the
weighted networks. In order to study the structure property of the weighted
networks, a new structure entropy of the complex networks based on the
betweenness is proposed in this paper. Comparing with the existing structure
entropy, the proposed method is more reasonable to describe the structure
property of the complex weighted networks.
","[{'version': 'v1', 'created': 'Tue, 1 Jul 2014 04:09:24 GMT'}]",2014-08-27,"[['Zhang', 'Qi', ''], ['Li', 'Meizhu', ''], ['Deng', 'Yong', '']]","['complex networks', 'structure entropy', 'betweenness', 'weighted']"
13629,0906.3956,R Doomun,"Joe Prathap P M., V. Vasudevan","Analysis of the various key management algorithms and new proposal in
  the secure multicast communications","8 pages, International Journal of Computer Science and Information
  Security","IJCSIS 2009, June Issue, Vol.2. No.1",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the evolution of the Internet, multicast communications seem
particularly well adapted for large scale commercial distribution applications,
for example, the pay TV channels and secure videoconferencing. Key management
for multicast remains an open topic in secure Communications today. Key
management mainly has to do with the distribution and update of keying material
during the group life. Several key tree based approach has been proposed by
various authors to create and distribute the multicast group key in effective
manner. There are different key management algorithms that facilitate efficient
distribution and rekeying of the group key. These protocols normally add
communication overhead as well as computation overhead at the group key
controller and at the group members. This paper explores the various algorithms
along with the performances and derives an improved method.
","[{'version': 'v1', 'created': 'Mon, 22 Jun 2009 08:55:33 GMT'}]",2009-06-23,"[['M.', 'Joe Prathap P', ''], ['Vasudevan', 'V.', '']]","['Group key management', 'Key tree', 'Multicast security', 'Rekeying']"
13630,1704.01977,Susanne Claus,"Susanne Claus, Pierre Kerfriden","A stable and optimally convergent LaTIn-Cut Finite Element Method for
  multiple unilateral contact problems",,,,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel unfitted finite element method for the
simulation of multiple body contact. The computational mesh is generated
independently of the geometry of the interacting solids, which can be
arbitrarily complex. The key novelty of the approach is the combination of
elements of the CutFEM technology, namely the enrichment of the solution field
via the definition of overlapping fictitious domains with a dedicated
penalty-type regularisation of discrete operators, and the LaTIn hybrid-mixed
formulation of complex interface conditions. Furthermore, the novel P1-P1
discretisation scheme that we propose for the unfitted LaTIn solver is shown to
be stable, robust and optimally convergent with mesh refinement. Finally, the
paper introduces a high-performance 3D level-set/CutFEM framework for the
versatile and robust solution of contact problems involving multiple bodies of
complex geometries, with more than two bodies interacting at a single point.
","[{'version': 'v1', 'created': 'Thu, 6 Apr 2017 18:06:01 GMT'}]",2017-04-10,"[['Claus', 'Susanne', ''], ['Kerfriden', 'Pierre', '']]","['unilateral contact', 'LaTIn', 'nonconforming finite element', 'CutFEM', 'ghostpenalty', 'multiple level sets', 'composite materials']"
13631,1212.1918,Juan Manuel Torres Moreno,"Juan-Manuel Torres-Moreno, Patricia Vel\'azquez-Morales, Jean-Guy
  Meunier",Condens\'es de textes par des m\'ethodes num\'eriques,"Conf\'erence JADT 2002, Saint-Malo/France. 12 pages, 7 figures",,,,cs.IR cs.CL,http://creativecommons.org/licenses/by/3.0/,"  Since information in electronic form is already a standard, and that the
variety and the quantity of information become increasingly large, the methods
of summarizing or automatic condensation of texts is a critical phase of the
analysis of texts. This article describes CORTEX a system based on numerical
methods, which allows obtaining a condensation of a text, which is independent
of the topic and of the length of the text. The structure of the system enables
it to find the abstracts in French or Spanish in very short times.
","[{'version': 'v1', 'created': 'Sun, 9 Dec 2012 20:55:52 GMT'}]",2012-12-11,"[['Torres-Moreno', 'Juan-Manuel', ''], ['Velázquez-Morales', 'Patricia', ''], ['Meunier', 'Jean-Guy', '']]","['Condensés de textes', 'résumés automatiques', 'analyse de textes', 'catégorisation', 'méthodes statistiques']"
13632,1710.05947,Nima Fazeli,"Nima Fazeli, Samuel Zapolsky, Evan Drumwright, Alberto Rodriguez","Learning Data-Efficient Rigid-Body Contact Models: Case Study of Planar
  Impact",10 pages,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we demonstrate the limitations of common rigid-body contact
models used in the robotics community by comparing them to a collection of
data-driven and data-reinforced models that exploit underlying structure
inspired by the rigid contact paradigm. We evaluate and compare the analytical
and data-driven contact models on an empirical planar impact data-set, and show
that the learned models are able to outperform their analytical counterparts
with a small training set.
","[{'version': 'v1', 'created': 'Mon, 16 Oct 2017 18:13:41 GMT'}]",2017-10-18,"[['Fazeli', 'Nima', ''], ['Zapolsky', 'Samuel', ''], ['Drumwright', 'Evan', ''], ['Rodriguez', 'Alberto', '']]","['Contact Modeling', 'Rigid-Body Dynamics', 'Data-Efficient Learning']"
13633,1209.4554,Erez Buchnik,Erez M. Buchnik,"Bouma2 - A Quasi-Stateless, Tunable Multiple String-Match Algorithm","33 pages, 3 figures",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Bouma2 algorithm attempts to challenge the prevalent ""stateful"" exact
string-match paradigms by suggesting a ""quasi-stateless"" approach. We claim
that using state-machines to solve the multiple exact string-match problem
introduces a hidden artificial constraint, namely the Consume-Order Dependency,
which results in unnecessary overhead. Bouma2 is not restricted in this sense;
we postulate that this allows memory-efficiency and improved performance versus
its state-machine equivalents. The heart of the Bouma2 preprocessing problem is
formulated as a weighted Integer Linear Programming problem, that can be tuned
for memory footprint and performance optimization. Specifically, this allows
Bouma2 to be input-sensitive, as tuning can be based on input characteristics.
Evaluating Bouma2 against the Aho-Corasick variant of the popular Snort
Intrusion Prevention System, we demonstrate double the throughput while using
about 10% of the memory.
","[{'version': 'v1', 'created': 'Thu, 20 Sep 2012 14:59:48 GMT'}]",2012-09-21,"[['Buchnik', 'Erez M.', '']]","['pattern match', 'hash function', 'integer linear programming', 'motif', 'deep packet inspection', 'Snort']"
13634,1002.1188,Vishal Goyal,"Akepogu Anand Rao, Karanam Madhavi","Framework for Visualizing Model-Driven Software Evolution and its
  Application","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 3, January 2010,
  http://ijcsi.org/articles/Framework-for-Visualizing-Model-Driven-Software-Evolution-and-its-Application.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 3, January 2010,
  http://ijcsi.org/articles/Framework-for-Visualizing-Model-Driven-Software-Evolution-and-its-Application.php",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software Visualization encompasses the development and evaluation of methods
for graphically representing different aspects of methods of software,
including its structure, execution and evolution. Creating visualizations helps
the user to better understand complex phenomena. It is also found by the
software engineering community that visualization is essential and important.
In order to visualize the evolution of the models in Model-Driven Software
Evolution, authors have proposed a framework which consists of 7 key areas
(views) and 22 key features for the assessment of Model Driven Software
Evolution process and addresses a number of stakeholder concerns. The framework
is derived by the application of the Goal Question Metric Paradigm. This paper
aims to describe an application of the framework by considering different
visualization tools/CASE tools which are used to visualize the models in
different views and to capture the information of models during their
evolution. Comparison of such tools is also possible by using the framework.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 10:35:59 GMT'}]",2010-02-08,"[['Rao', 'Akepogu Anand', ''], ['Madhavi', 'Karanam', '']]","['Model-Driven Software Evolution', 'Software Visualization', 'Visualization tools']"
13635,1502.05090,Aldo Pacchiano,"Aldo Pacchiano, Oliver Williams",Real time clustering of time series using triangular potentials,AIFU15,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by the problem of computing investment portfolio weightings we
investigate various methods of clustering as alternatives to traditional
mean-variance approaches. Such methods can have significant benefits from a
practical point of view since they remove the need to invert a sample
covariance matrix, which can suffer from estimation error and will almost
certainly be non-stationary. The general idea is to find groups of assets which
share similar return characteristics over time and treat each group as a single
composite asset. We then apply inverse volatility weightings to these new
composite assets. In the course of our investigation we devise a method of
clustering based on triangular potentials and we present associated theoretical
results as well as various examples based on synthetic data.
","[{'version': 'v1', 'created': 'Wed, 18 Feb 2015 00:27:39 GMT'}]",2015-02-19,"[['Pacchiano', 'Aldo', ''], ['Williams', 'Oliver', '']]","['Clustering', 'Expected Utility', 'Graphical Models', 'k-Clique Problem']"
13636,1010.1938,Sugata Sanyal,"Sugata Sanyal, Ajit Shelat, Amit Gupta",New Frontiers of Network Security: The Threat Within,"4 Pages, Invited Paper in VCON'10: 2nd Vaagdevi International
  Conference on Information Technology for Real World Problems Vaagdevi College
  of Engineering, Warangal, Andhra Pradesh, India, December 9-11, 2010",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nearly 70% of information security threats originate from inside an
organization. Opportunities for insider threats have been increasing at an
alarming rate with the latest trends of mobility (portable devices like Laptop,
smart phones etc.), ubiquitous connectivity (wireless or through 3G
connectivity) and this trend increases as more and more web-based applications
are made available over the Internet. Insider threats are generally caused by
current or ex-employees, contractors or partners, who have authorized access to
the organization's network and servers. Theft of confidential information is
often for either material gain or for willful damage. Easy availability of
hacking tools on the Internet, USB devices and wireless connectivity provide
for easy break-ins. The net result is losses worth millions of dollars in terms
of IP theft, leakage of customer / individual information, etc. This paper
presents an understanding of Insider threats, attackers and their motives and
suggests mitigation techniques at the organization level
","[{'version': 'v1', 'created': 'Sun, 10 Oct 2010 16:51:22 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Oct 2010 10:47:58 GMT'}]",2010-10-14,"[['Sanyal', 'Sugata', ''], ['Shelat', 'Ajit', ''], ['Gupta', 'Amit', '']]","['Insider’s Threats', 'Loss of Intellectual Property', 'Network Access Control (NAC)', 'Information Security Strategy', 'Policy enforcement']"
13637,1110.2773,Cristina Feier,Cristina Feier and Stijn Heymans,Reasoning with Forest Logic Programs and f-hybrid Knowledge Bases,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Open Answer Set Programming (OASP) is an undecidable framework for
integrating ontologies and rules. Although several decidable fragments of OASP
have been identified, few reasoning procedures exist. In this article, we
provide a sound, complete, and terminating algorithm for satisfiability
checking w.r.t. Forest Logic Programs (FoLPs), a fragment of OASP where rules
have a tree shape and allow for inequality atoms and constants. The algorithm
establishes a decidability result for FoLPs. Although believed to be decidable,
so far only the decidability for two small subsets of FoLPs, local FoLPs and
acyclic FoLPs, has been shown. We further introduce f-hybrid knowledge bases, a
hybrid framework where \SHOQ{} knowledge bases and forest logic programs
co-exist, and we show that reasoning with such knowledge bases can be reduced
to reasoning with forest logic programs only. We note that f-hybrid knowledge
bases do not require the usual (weakly) DL-safety of the rule component,
providing thus a genuine alternative approach to current integration approaches
of ontologies and rules.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2011 10:43:05 GMT'}]",2011-10-14,"[['Feier', 'Cristina', ''], ['Heymans', 'Stijn', '']]","['Forest Logic Programs', 'finite model property', 'f-hybrid knowledge bases', 'open answersets', 'integration of rules', 'ontologies']"
13638,1304.4287,Barnaby Martin,Stefan Dantchev and Barnaby Martin,Relativisation makes contradictions harder for Resolution,,Ann. Pure Appl. Logic 165(3): 837-857 (2014),,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide a number of simplified and improved separations between pairs of
Resolution-with-bounded-conjunction refutation systems, Res(d), as well as
their tree-like versions, Res*(d). The contradictions we use are natural
combinatorial principles: the Least number principle, LNP_n and an ordered
variant thereof, the Induction principle, IP_n.
  LNP_n is known to be easy for Resolution. We prove that its relativisation is
hard for Resolution, and more generally, the relativisation of LNP_n iterated d
times provides a separation between Res(d) and Res(d+1). We prove the same
result for the iterated relativisation of IP_n, where the tree-like variant
Res*(d) is considered instead of Res(d).
  We go on to provide separations between the parameterized versions of Res(1)
and Res(2). Here we are able again to use the relativisation of the LNP_n, but
the classical proof breaks down and we are forced to use an alternative.
Finally, we separate the parameterized versions of Res*(1) and Res*(2). Here,
the relativisation of IP_n will not work as it is, and so we make a vectorising
amendment to it in order to address this shortcoming
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2013 22:59:03 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Oct 2014 14:09:57 GMT'}]",2014-10-30,"[['Dantchev', 'Stefan', ''], ['Martin', 'Barnaby', '']]","['Proof complexity', 'Lower bounds', 'Resolution-with-bounded-conjunction', 'Parameterized proof complexity']"
13639,1109.2306,Loet Leydesdorff,Loet Leydesdorff,"An Evaluation of Impacts in ""Nanoscience & nanotechnology:"" Steps
  towards standards for citation analysis","Scientometrics (in press). Paper to be presented at the 2011 Atlanta
  Conference on Science, Technology, and Innovation Policy, September 15-17,
  Atlanta GA",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One is inclined to conceptualize impact in terms of citations per
publication, and thus as an average. However, citation distributions are
skewed, and the average has the disadvantage that the number of publications is
used in the denominator. Using hundred percentiles, one can integrate the
normalized citation curve and develop an indicator that can be compared across
document sets because percentile ranks are defined at the article level. I
apply this indicator to the set of 58 journals in the ISI Subject Category of
""Nanoscience & nanotechnology,"" and rank journals, countries, cities, and
institutes using non-parametric statistics. The significance levels of results
can thus be indicated. The results are first compared with the ISI-Impact
Factors, but this Integrated Impact Indicator (I3) can be used with any set
downloaded from the (Social) Science Citation Index. The software is made
publicly available at the Internet. Visualization techniques are also specified
for evaluation by positioning institutes on Google Map overlays.
","[{'version': 'v1', 'created': 'Sun, 11 Sep 2011 11:22:01 GMT'}, {'version': 'v2', 'created': 'Sat, 7 Apr 2012 11:52:11 GMT'}]",2012-04-10,"[['Leydesdorff', 'Loet', '']]","['citation', 'impact', 'evaluation', 'nanotechnology', 'statistics', 'standards']"
13640,1107.2188,Yajun Wang,"Tengyu Ma, Bo Tang, Yajun Wang","The Simulated Greedy Algorithm for Several Submodular Matroid Secretary
  Problems",preliminary version appeared in STACS 2013,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the matroid secretary problems with submodular valuation functions.
In these problems, the elements arrive in random order. When one element
arrives, we have to make an immediate and irrevocable decision on whether to
accept it or not. The set of accepted elements must form an {\em independent
set} in a predefined matroid. Our objective is to maximize the value of the
accepted elements. In this paper, we focus on the case that the valuation
function is a non-negative and monotonically non-decreasing submodular
function.
  We introduce a general algorithm for such {\em submodular matroid secretary
problems}. In particular, we obtain constant competitive algorithms for the
cases of laminar matroids and transversal matroids. Our algorithms can be
further applied to any independent set system defined by the intersection of a
{\em constant} number of laminar matroids, while still achieving constant
competitive ratios. Notice that laminar matroids generalize uniform matroids
and partition matroids.
  On the other hand, when the underlying valuation function is linear, our
algorithm achieves a competitive ratio of 9.6 for laminar matroids, which
significantly improves the previous result.
","[{'version': 'v1', 'created': 'Tue, 12 Jul 2011 04:35:02 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Sep 2012 20:35:31 GMT'}, {'version': 'v3', 'created': 'Tue, 26 Feb 2013 05:49:05 GMT'}]",2013-02-27,"[['Ma', 'Tengyu', ''], ['Tang', 'Bo', ''], ['Wang', 'Yajun', '']]","['Secretary Problem', 'Submodular Function', 'Matroid']"
13641,0705.1013,Elizeu Santos-Neto,"Elizeu Santos-Neto, Matei Ripeanu and Adriana Iamnitchi",Tracking User Attention in Collaborative Tagging Communities,"8 pages. Proceedings of International ACM/IEEE Workshop on
  Contextualized Attention Metadata: personalized access to digital resources
  (http://ariadne.cs.kuleuven.ac.be/mediawiki/index.php/Cama2007)",,,,cs.DL cs.CY,,"  Collaborative tagging has recently attracted the attention of both industry
and academia due to the popularity of content-sharing systems such as
CiteULike, del.icio.us, and Flickr. These systems give users the opportunity to
add data items and to attach their own metadata (or tags) to stored data. The
result is an effective content management tool for individual users. Recent
studies, however, suggest that, as tagging communities grow, the added content
and the metadata become harder to manage due to an ease in content diversity.
Thus, mechanisms that cope with increase of diversity are fundamental to
improve the scalability and usability of collaborative tagging systems. This
paper analyzes whether usage patterns can be harnessed to improve navigability
in a growing knowledge space. To this end, it presents a characterization of
two collaborative tagging communities that target scientific literature:
CiteULike and Bibsonomy. We explore three main directions: First, we analyze
the tagging activity distribution across the user population. Second, we define
new metrics for similarity in user interest and use these metrics to uncover
the structure of the tagging communities we study. The structure we uncover
suggests a clear segmentation of interests into a large number of individuals
with unique preferences and a core set of users with interspersed interests.
Finally, we offer preliminary results that demonstrate that the interest-based
structure of the tagging community can be used to facilitate content usage as
communities scale.
","[{'version': 'v1', 'created': 'Mon, 7 May 2007 23:57:46 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Jun 2007 19:38:28 GMT'}, {'version': 'v3', 'created': 'Thu, 14 Jun 2007 19:44:46 GMT'}, {'version': 'v4', 'created': 'Sun, 24 Jun 2007 05:24:07 GMT'}]",2007-06-24,"[['Santos-Neto', 'Elizeu', ''], ['Ripeanu', 'Matei', ''], ['Iamnitchi', 'Adriana', '']]","['Collaborative Tagging', 'Usage Patterns', 'Modeling User Attention', 'CiteULike', 'Bibsonomy']"
13642,1702.06162,Teresa Brooks,Teresa Nicole Brooks,"Survey of Automated Vulnerability Detection and Exploit Generation
  Techniques in Cyber Reasoning Systems","An updated version of this article has been accepted for publication
  in the proceedings of 2018 Computing Conference",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software is everywhere, from mission critical systems such as industrial
power stations, pacemakers and even household appliances. This growing
dependence on technology and the increasing complexity software has serious
security implications as it means we are potentially surrounded by software
that contain exploitable vulnerabilities. These challenges have made binary
analysis an important area of research in computer science and has emphasized
the need for building automated analysis systems that can operate at scale,
speed and efficacy; all while performing with the skill of a human expert.
Though great progress has been made in this area of research, there remains
limitations and open challenges to be addressed. Recognizing this need, DARPA
sponsored the Cyber Grand Challenge (CGC), a competition to showcase the
current state of the art in systems that perform; automated vulnerability
detection, exploit generation and software patching. This paper is a survey of
the vulnerability detection and exploit generation techniques, underlying
technologies and related works of two of the winning systems Mayhem and
Mechanical Phish.
","[{'version': 'v1', 'created': 'Mon, 20 Feb 2017 20:07:49 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Sep 2017 23:10:30 GMT'}, {'version': 'v3', 'created': 'Thu, 5 Oct 2017 00:18:27 GMT'}, {'version': 'v4', 'created': 'Tue, 7 Aug 2018 04:08:39 GMT'}]",2018-08-08,"[['Brooks', 'Teresa Nicole', '']]","['Cyber reasoning systems', 'automated binary analysis', 'automated exploit generation', 'dynamic symbolic execution', 'fuzzing']"
13643,1802.06660,S{\l}awomir Lasota,Piotr Hofman and S{\l}awomir Lasota,Linear Equations with Ordered Data,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Following a recently considered generalization of linear equations to
unordered data vectors, we perform a further generalization to ordered data
vectors. These generalized equations naturally appear in the analysis of vector
addition systems (or Petri nets) extended with ordered data. We show that
nonnegative-integer solvability of linear equations is computationally
equivalent (up to an exponential blowup) with the reachability problem for
(plain) vector addition systems. This high complexity is surprising, and
contrasts with NP-completeness for unordered data vectors. Also surprisingly,
we achieve polynomial time complexity of the solvability problem when the
nonnegative-integer restriction on solutions is dropped.
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 15:02:11 GMT'}]",2018-02-20,"[['Hofman', 'Piotr', ''], ['Lasota', 'Sławomir', '']]","['Linear equations', 'Petri nets', 'Petri nets with data', 'vectoraddition systems', 'sets with atoms', 'orbit-finite sets']"
13644,1403.6600,Dirk Sudholt,Dirk Sudholt,How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms,,,,,cs.NE cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We re-investigate a fundamental question: how effective is crossover in
Genetic Algorithms in combining building blocks of good solutions? Although
this has been discussed controversially for decades, we are still lacking a
rigorous and intuitive answer. We provide such answers for royal road functions
and OneMax, where every bit is a building block. For the latter we show that
using crossover makes every ($\mu$+$\lambda$) Genetic Algorithm at least twice
as fast as the fastest evolutionary algorithm using only standard bit mutation,
up to small-order terms and for moderate $\mu$ and $\lambda$. Crossover is
beneficial because it effectively turns fitness-neutral mutations into
improvements by combining the right building blocks at a later stage. Compared
to mutation-based evolutionary algorithms, this makes multi-bit mutations more
useful. Introducing crossover changes the optimal mutation rate on OneMax from
$1/n$ to $(1+\sqrt{5})/2 \cdot 1/n \approx 1.618/n$. This holds both for
uniform crossover and $k$-point crossover. Experiments and statistical tests
confirm that our findings apply to a broad class of building-block functions.
","[{'version': 'v1', 'created': 'Wed, 26 Mar 2014 09:28:56 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Nov 2014 11:46:21 GMT'}]",2014-11-27,"[['Sudholt', 'Dirk', '']]","['Genetic algorithms', 'crossover', 'recombination', 'mutation rate', 'runtime analysis', 'theory']"
13645,1511.07826,Nikhil Bansal,"Nikhil Bansal, Aravind Srinivasan and Ola Svensson",Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines,"21 pages, 4 figures",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of scheduling jobs on unrelated machines so as to
minimize the sum of weighted completion times. Our main result is a
$(3/2-c)$-approximation algorithm for some fixed $c>0$, improving upon the
long-standing bound of 3/2 (independently due to Skutella, Journal of the ACM,
2001, and Sethuraman & Squillante, SODA, 1999). To do this, we first introduce
a new lift-and-project based SDP relaxation for the problem. This is necessary
as the previous convex programming relaxations have an integrality gap of
$3/2$. Second, we give a new general bipartite-rounding procedure that produces
an assignment with certain strong negative correlation properties.
","[{'version': 'v1', 'created': 'Tue, 24 Nov 2015 18:08:10 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Dec 2015 18:52:14 GMT'}]",2015-12-02,"[['Bansal', 'Nikhil', ''], ['Srinivasan', 'Aravind', ''], ['Svensson', 'Ola', '']]","['Approximation algorithms', 'semidefinite programming', 'scheduling']"
13646,1506.00765,Rongrong Ji Rongrong Ji,"Zheng Cai, Donglin Cao, Rongrong Ji",Video (GIF) Sentiment Analysis using Large-Scale Mid-Level Ontology,,,,,cs.MM cs.CL cs.IR,http://creativecommons.org/licenses/by/3.0/,"  With faster connection speed, Internet users are now making social network a
huge reservoir of texts, images and video clips (GIF). Sentiment analysis for
such online platform can be used to predict political elections, evaluates
economic indicators and so on. However, GIF sentiment analysis is quite
challenging, not only because it hinges on spatio-temporal visual
contentabstraction, but also for the relationship between such abstraction and
final sentiment remains unknown.In this paper, we dedicated to find out such
relationship.We proposed a SentiPairSequence basedspatiotemporal visual
sentiment ontology, which forms the midlevel representations for GIFsentiment.
The establishment process of SentiPair contains two steps. First, we construct
the Synset Forest to define the semantic tree structure of visual sentiment
label elements. Then, through theSynset Forest, we organically select and
combine sentiment label elements to form a mid-level visual sentiment
representation. Our experiments indicate that SentiPair outperforms other
competing mid-level attributes. Using SentiPair, our analysis frameworkcan
achieve satisfying prediction accuracy (72.6%). We also opened ourdataset
(GSO-2015) to the research community. GSO-2015 contains more than 6,000
manually annotated GIFs out of more than 40,000 candidates. Each is labeled
with both sentiment and SentiPair Sequence.
","[{'version': 'v1', 'created': 'Tue, 2 Jun 2015 06:31:57 GMT'}]",2015-06-03,"[['Cai', 'Zheng', ''], ['Cao', 'Donglin', ''], ['Ji', 'Rongrong', '']]","['Sentiment Analysis', 'Concept Detection', 'Ontology']"
13647,1110.1485,Hafiz Imtiaz,Hafiz Imtiaz and Shaikh Anowarul Fattah,A Face Recognition Scheme using Wavelet Based Dominant Features,"12 pages, 12 figures, Published in Signal and Image Processing: An
  International Journal Vol 2 No 3","Signal and Image Processing: An International Journal, Vol. 2, No.
  3, Sept 2011",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a multi-resolution feature extraction algorithm for face
recognition is proposed based on two-dimensional discrete wavelet transform
(2D-DWT), which efficiently exploits the local spatial variations in a face
image. For the purpose of feature extraction, instead of considering the entire
face image, an entropy-based local band selection criterion is developed, which
selects high-informative horizontal segments from the face image. In order to
capture the local spatial variations within these highinformative horizontal
bands precisely, the horizontal band is segmented into several small spatial
modules. Dominant wavelet coefficients corresponding to each local region
residing inside those horizontal bands are selected as features. In the
selection of the dominant coefficients, a threshold criterion is proposed,
which not only drastically reduces the feature dimension but also provides high
within-class compactness and high between-class separability. A principal
component analysis is performed to further reduce the dimensionality of the
feature space. Extensive experimentation is carried out upon standard face
databases and a very high degree of recognition accuracy is achieved by the
proposed method in comparison to those obtained by some of the existing
methods.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2011 11:16:17 GMT'}]",2011-10-10,"[['Imtiaz', 'Hafiz', ''], ['Fattah', 'Shaikh Anowarul', '']]","['Feature extraction', 'two-dimensional discrete wavelet transform (2D-DWT)', 'local intensity variation', 'face recognition', 'entropy & modularization']"
13648,1701.07579,Vitaly Skachek,Eldho K. Thomas and Vitaly Skachek,"Explicit Constructions and Bounds for Batch Codes with Restricted Size
  of Reconstruction Sets",To appear in 5ICMCTA,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linear batch codes and codes for private information retrieval (PIR) with a
query size $t$ and a restricted size $r$ of the reconstruction sets are
studied. New bounds on the parameters of such codes are derived for small
values of $t$ or of $r$ by providing corresponding constructions. By building
on the ideas of Cadambe and Mazumdar, a new bound in a recursive form is
derived for batch codes and PIR codes.
","[{'version': 'v1', 'created': 'Thu, 26 Jan 2017 05:16:28 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Jul 2017 14:07:13 GMT'}]",2017-07-05,"[['Thomas', 'Eldho K.', ''], ['Skachek', 'Vitaly', '']]","['PIR codes', 'batch codes', 'private information retrieval', 'locally repairable codes', 'distributed data storage']"
13649,0909.3877,James Nastos,"James Nastos, Yong Gao",A note on the hardness of graph diameter augmentation problems,No figures,,,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A graph has \emph{diameter} D if every pair of vertices are connected by a
path of at most D edges. The Diameter-D Augmentation problem asks how to add
the a number of edges to a graph in order to make the resulting graph have
diameter D. It was previously known that this problem is NP-hard \cite{GJ},
even in the D=2 case. In this note, we give a simpler reduction to arrive at
this fact and show that this problem is W[2]-hard.
","[{'version': 'v1', 'created': 'Mon, 21 Sep 2009 23:26:00 GMT'}]",2009-09-23,"[['Nastos', 'James', ''], ['Gao', 'Yong', '']]","['Graph augmentation', 'graph diameter', 'algorithms', 'fixedparameter tractability', 'W[2]-hard', 'domination', 'reduction']"
13650,1111.1491,Sushant Sachdeva,"Lorenzo Orecchia, Sushant Sachdeva, Nisheeth K. Vishnoi","Approximating the Exponential, the Lanczos Method and an
  \tilde{O}(m)-Time Spectral Algorithm for Balanced Separator",,,,,cs.DS cs.NA math.CA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give a novel spectral approximation algorithm for the balanced separator
problem that, given a graph G, a constant balance b \in (0,1/2], and a
parameter \gamma, either finds an \Omega(b)-balanced cut of conductance
O(\sqrt(\gamma)) in G, or outputs a certificate that all b-balanced cuts in G
have conductance at least \gamma, and runs in time \tilde{O}(m). This settles
the question of designing asymptotically optimal spectral algorithms for
balanced separator. Our algorithm relies on a variant of the heat kernel random
walk and requires, as a subroutine, an algorithm to compute \exp(-L)v where L
is the Laplacian of a graph related to G and v is a vector. Algorithms for
computing the matrix-exponential-vector product efficiently comprise our next
set of results. Our main result here is a new algorithm which computes a good
approximation to \exp(-A)v for a class of PSD matrices A and a given vector u,
in time roughly \tilde{O}(m_A), where m_A is the number of non-zero entries of
A. This uses, in a non-trivial way, the result of Spielman and Teng on
inverting SDD matrices in \tilde{O}(m_A) time. Finally, we prove e^{-x} can be
uniformly approximated up to a small additive error, in a non-negative interval
[a,b] with a polynomial of degree roughly \sqrt{b-a}. While this result is of
independent interest in approximation theory, we show that, via the Lanczos
method from numerical analysis, it yields a simple algorithm to compute
\exp(-A)v for PSD matrices that runs in time roughly O(t_A \sqrt{||A||}), where
t_A is the time required for computation of the vector Aw for given vector w.
As an application, we obtain a simple and practical algorithm, with output
conductance O(\sqrt(\gamma)), for balanced separator that runs in time
\tilde{O}(m/\sqrt(\gamma)). This latter algorithm matches the running time, but
improves on the approximation guarantee of the algorithm by Andersen and Peres.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2011 05:24:34 GMT'}]",2011-11-08,"[['Orecchia', 'Lorenzo', ''], ['Sachdeva', 'Sushant', ''], ['Vishnoi', 'Nisheeth K.', '']]","['Spectral Algorithms', 'Balanced Graph Partitioning', 'Matrix Exponential', 'LanczosMethod', 'Uniform Approximation']"
13651,1704.05698,Majd Zreik,"Majd Zreik, Tim Leiner, Bob D. de Vos, Robbert W. van Hamersvelt, Max
  A. Viergever, Ivana Isgum","Automatic Segmentation of the Left Ventricle in Cardiac CT Angiography
  Using Convolutional Neural Network","This work has been published as: Zreik, M., Leiner, T., de Vos, B.
  D., van Hamersvelt, R. W., Viergever, M. A., I\v{s}gum, I. (2016, April).
  Automatic segmentation of the left ventricle in cardiac CT angiography using
  convolutional neural networks. In Biomedical Imaging (ISBI), 2016 IEEE 13th
  International Symposium on (pp. 40-43). IEEE",,,,cs.CV physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate delineation of the left ventricle (LV) is an important step in
evaluation of cardiac function. In this paper, we present an automatic method
for segmentation of the LV in cardiac CT angiography (CCTA) scans. Segmentation
is performed in two stages. First, a bounding box around the LV is detected
using a combination of three convolutional neural networks (CNNs).
Subsequently, to obtain the segmentation of the LV, voxel classification is
performed within the defined bounding box using a CNN. The study included CCTA
scans of sixty patients, fifty scans were used to train the CNNs for the LV
localization, five scans were used to train LV segmentation and the remaining
five scans were used for testing the method. Automatic segmentation resulted in
the average Dice coefficient of 0.85 and mean absolute surface distance of 1.1
mm. The results demonstrate that automatic segmentation of the LV in CCTA scans
using voxel classification with convolutional neural networks is feasible.
","[{'version': 'v1', 'created': 'Wed, 19 Apr 2017 11:29:59 GMT'}]",2017-04-20,"[['Zreik', 'Majd', ''], ['Leiner', 'Tim', ''], ['de Vos', 'Bob D.', ''], ['van Hamersvelt', 'Robbert W.', ''], ['Viergever', 'Max A.', ''], ['Isgum', 'Ivana', '']]","['Left ventricle segmentation', 'Convolutional Neural Network', 'Cardiac CT Angiography', 'Classification', 'Deep learning']"
13652,1504.05038,Ali Assaf,Ali Assaf,"Conservativity of embeddings in the lambda Pi calculus modulo rewriting
  (long version)",Long version of TLCA 2015 paper,,,,cs.LO,http://creativecommons.org/licenses/by/3.0/,"  The lambda Pi calculus can be extended with rewrite rules to embed any
functional pure type system. In this paper, we show that the embedding is
conservative by proving a relative form of normalization, thus justifying the
use of the lambda Pi calculus modulo rewriting as a logical framework for
logics based on pure type systems. This result was previously only proved under
the condition that the target system is normalizing. Our approach does not
depend on this condition and therefore also works when the source system is not
normalizing.
","[{'version': 'v1', 'created': 'Mon, 20 Apr 2015 12:48:54 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Apr 2015 10:09:20 GMT'}]",2015-04-22,"[['Assaf', 'Ali', '']]","['λΠ calculus modulo rewriting', 'pure type systems', 'logical framework', 'normalization', 'conservativity']"
13653,1802.06357,Yunwen Lei,Yunwen Lei and Ding-Xuan Zhou,Convergence of Online Mirror Descent,"Published in Applied and Computational Harmonic Analysis, 2020",,,,cs.LG cs.AI math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider online mirror descent (OMD) algorithms, a class of
scalable online learning algorithms exploiting data geometric structures
through mirror maps. Necessary and sufficient conditions are presented in terms
of the step size sequence $\{\eta_t\}_{t}$ for the convergence of an OMD
algorithm with respect to the expected Bregman distance induced by the mirror
map. The condition is $\lim_{t\to\infty}\eta_t=0,
\sum_{t=1}^{\infty}\eta_t=\infty$ in the case of positive variances. It is
reduced to $\sum_{t=1}^{\infty}\eta_t=\infty$ in the case of zero variances for
which the linear convergence may be achieved by taking a constant step size
sequence. A sufficient condition on the almost sure convergence is also given.
We establish tight error bounds under mild conditions on the mirror map, the
loss function, and the regularizer. Our results are achieved by some novel
analysis on the one-step progress of the OMD algorithm using smoothness and
strong convexity of the mirror map and the loss function.
","[{'version': 'v1', 'created': 'Sun, 18 Feb 2018 09:36:09 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Dec 2019 05:44:02 GMT'}]",2019-12-16,"[['Lei', 'Yunwen', ''], ['Zhou', 'Ding-Xuan', '']]","['Mirror descent', 'Online learning', 'Bregman distance', 'Convergence analysis', 'Learning theory']"
13654,1710.03888,Nalin Asanka Gamagedara Arachchilage,Nicholas Micallef and Nalin Asanka Gamagedara Arachchilage,"Involving Users in the Design of a Serious Game for Security Questions
  Education","10; International Symposium on Human Aspects of Information Security
  & Assurance (HAISA), 2017",,,,cs.CR cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When using security questions most users still trade-off security for the
convenience of memorability. This happens because most users find strong
answers to security questions difficult to remember. Previous research in
security education was successful in motivating users to change their behaviour
towards security issues, through the use of serious games (i.e. games designed
for a primary purpose other than pure entertainment). Hence, in this paper we
evaluate the design of a serious game, to investigate the features and
functionalities that users would find desirable in a game that aims to educate
them to provide strong and memorable answers to security questions. Our
findings reveal that: (1) even for security education games, rewards seem to
motivate users to have a better learning experience; (2) functionalities which
contain a social element (e.g. getting help from other players) do not seem
appropriate for serious games related to security questions, because users fear
that their acquaintances could gain access to their security questions; (3)
even users who do not usually play games would seem to prefer to play security
education games on a mobile device.
","[{'version': 'v1', 'created': 'Wed, 11 Oct 2017 03:00:31 GMT'}]",2017-10-12,"[['Micallef', 'Nicholas', ''], ['Arachchilage', 'Nalin Asanka Gamagedara', '']]","['Usable Security', 'Security Questions', 'Serious Games', 'Cyber Security Education']"
13655,1510.06646,Osama Khalifa,"Osama Khalifa, David Wolfe Corne, Mike Chantler","A 'Gibbs-Newton' Technique for Enhanced Inference of Multivariate Polya
  Parameters and Topic Models",,,,,cs.LG cs.CL stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hyper-parameters play a major role in the learning and inference process of
latent Dirichlet allocation (LDA). In order to begin the LDA latent variables
learning process, these hyper-parameters values need to be pre-determined. We
propose an extension for LDA that we call 'Latent Dirichlet allocation Gibbs
Newton' (LDA-GN), which places non-informative priors over these
hyper-parameters and uses Gibbs sampling to learn appropriate values for them.
At the heart of LDA-GN is our proposed 'Gibbs-Newton' algorithm, which is a new
technique for learning the parameters of multivariate Polya distributions. We
report Gibbs-Newton performance results compared with two prominent existing
approaches to the latter task: Minka's fixed-point iteration method and the
Moments method. We then evaluate LDA-GN in two ways: (i) by comparing it with
standard LDA in terms of the ability of the resulting topic models to
generalize to unseen documents; (ii) by comparing it with standard LDA in its
performance on a binary classification task.
","[{'version': 'v1', 'created': 'Thu, 22 Oct 2015 14:39:58 GMT'}, {'version': 'v2', 'created': 'Sat, 27 Feb 2016 12:29:43 GMT'}]",2016-03-01,"[['Khalifa', 'Osama', ''], ['Corne', 'David Wolfe', ''], ['Chantler', 'Mike', '']]","['Topic Modelling', 'LDA', 'Gibbs Sampling', 'Perplexity', 'Dirichlet', 'MultivariatePolya']"
13656,1212.3964,Sourav Dutta,"Suman K. Bera, Sourav Dutta, Ankur Narang and Souvik Bhattacherjee","Advanced Bloom Filter Based Algorithms for Efficient Approximate Data
  De-Duplication in Streams",41 pages,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Applications involving telecommunication call data records, web pages, online
transactions, medical records, stock markets, climate warning systems, etc.,
necessitate efficient management and processing of such massively exponential
amount of data from diverse sources. De-duplication or Intelligent Compression
in streaming scenarios for approximate identification and elimination of
duplicates from such unbounded data stream is a greater challenge given the
real-time nature of data arrival. Stable Bloom Filters (SBF) addresses this
problem to a certain extent. .
  In this work, we present several novel algorithms for the problem of
approximate detection of duplicates in data streams. We propose the Reservoir
Sampling based Bloom Filter (RSBF) combining the working principle of reservoir
sampling and Bloom Filters. We also present variants of the novel Biased
Sampling based Bloom Filter (BSBF) based on biased sampling concepts. We also
propose a randomized load balanced variant of the sampling Bloom Filter
approach to efficiently tackle the duplicate detection. In this work, we thus
provide a generic framework for de-duplication using Bloom Filters. Using
detailed theoretical analysis we prove analytical bounds on the false positive
rate, false negative rate and convergence rate of the proposed structures. We
exhibit that our models clearly outperform the existing methods. We also
demonstrate empirical analysis of the structures using real-world datasets (3
million records) and also with synthetic datasets (1 billion records) capturing
various input distributions.
","[{'version': 'v1', 'created': 'Mon, 17 Dec 2012 11:47:09 GMT'}]",2012-12-18,"[['Bera', 'Suman K.', ''], ['Dutta', 'Sourav', ''], ['Narang', 'Ankur', ''], ['Bhattacherjee', 'Souvik', '']]","['De-duplication', 'Reservoir Sampling', 'Bloom Filter', 'Biased Sampling', 'Data streams']"
13657,1004.4216,Alan Sexton,Alan P. Sexton and Richard Swinbank,Symmetric M-tree,"8 pages, 10 figures",,,CSR-04-2,cs.DB cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The M-tree is a paged, dynamically balanced metric access method that
responds gracefully to the insertion of new objects. To date, no algorithm has
been published for the corresponding Delete operation. We believe this to be
non-trivial because of the design of the M-tree's Insert algorithm. We propose
a modification to Insert that overcomes this problem and give the corresponding
Delete algorithm. The performance of the tree is comparable to the M-tree and
offers additional benefits in terms of supported operations, which we briefly
discuss.
","[{'version': 'v1', 'created': 'Fri, 23 Apr 2010 20:04:57 GMT'}]",2010-04-27,"[['Sexton', 'Alan P.', ''], ['Swinbank', 'Richard', '']]","['Metric access methods', 'similarity queries', 'dynamic metric trees', 'triangle inequality']"
13658,1208.4081,Igor Vladimirov,"Eugene A. Maximov, Alexander P. Kurdyukov, and Igor G. Vladimirov","Anisotropic Norm Bounded Real Lemma for Linear Discrete Time Varying
  Systems","7 pages, 1 figure, published in the Proceedings of the 18th IFAC
  World Congress, 28 August - 2 September 2011, Milano, Italy, pp. 4701-4706",,,,cs.SY cs.IT math.IT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a finite horizon linear discrete time varying system whose input
is a random noise with an imprecisely known probability law. The statistical
uncertainty is described by a nonnegative parameter a which constrains the
anisotropy of the noise as an entropy theoretic measure of deviation of the
actual noise distribution from Gaussian white noise laws with scalar covariance
matrices. The worst-case disturbance attenuation capabilities of the system
with respect to the statistically uncertain random inputs are quantified by the
a-anisotropic norm which is an appropriately constrained operator norm of the
system. We establish an anisotropic norm bounded real lemma which provides a
state-space criterion for the a-anisotropic norm of the system not to exceed a
given threshold. The criterion is organized as an inequality on the
determinants of matrices associated with a difference Riccati equation and
extends the Bounded Real Lemma of the H-infinity-control theory. We also
provide a necessary background on the anisotropy-based robust performance
analysis.
","[{'version': 'v1', 'created': 'Mon, 20 Aug 2012 18:49:32 GMT'}]",2012-08-21,"[['Maximov', 'Eugene A.', ''], ['Kurdyukov', 'Alexander P.', ''], ['Vladimirov', 'Igor G.', '']]","['stochastic robust control', 'anisotropic norm', 'Bounded Real Lemma', 'difference Riccatiequation']"
13659,1203.0432,Pierre de Leusse,Pierre de Leusse and Krzysztof Zielinski,Toward Governance of Cross-Cloud Application Deployment,,"ServiceWave 2011, Second Optimising Cloud Services Workshop",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, the authors introduce the main ideas around the governance
of cross-Cloud application deployment and their related concepts. It is argued
that, due to the increasing complexity and nature of the Cloud market, an
intermediary specialized in brokering the deployment of different components of
a same application onto different Cloud products could both facilitate said
deployment and in some cases improve its quality in terms of cost, security &
reliability and QoS. In order to fulfill these objectives, the authors propose
a high level architecture that relies on their previous work on governance of
policy & rule driven distributed systems. This architecture aims at supplying
five main functions of 1) translation of Service Level Agreements (SLAs) and
pricing into a common shared DSL, 2) correlation of analytical data (e.g.
monitoring, metering), 3) combination of Cloud products, 4) information from
third parties regarding different aspects of Quality of Service (QoS) and 5)
cross-Cloud application deployment specification and governance.
","[{'version': 'v1', 'created': 'Fri, 2 Mar 2012 12:03:02 GMT'}]",2012-03-05,"[['de Leusse', 'Pierre', ''], ['Zielinski', 'Krzysztof', '']]","['Cloud computing', 'cross-Cloud deployment', 'cross-Cloud governance']"
13660,1609.06290,C Aiswarya,"C. Aiswarya, Paul Gastin, Prakash Saivasan",Nested Words for Order-2 Pushdown Systems,,,,,cs.FL cs.LO,http://creativecommons.org/licenses/by/4.0/,"  We study linear time model checking of collapsible higher-order pushdown
systems (CPDS) of order 2 (manipulating stack of stacks) against MSO and PDL
(propositional dynamic logic with converse and loop) enhanced with push/pop
matching relations. To capture these linear time behaviours with matchings, we
propose order-2 nested words. These graphs consist of a word structure
augmented with two binary matching relations, one for each order of stack,
which relate a push with matching pops (or collapse) on the respective stack.
Due to the matching relations, satisfiability and model checking are
undecidable. Hence we propose an under-approximation, bounding the number of
times an order-1 push can be popped. With this under-approximation, which still
allows unbounded stack height, we get decidability for satisfiability and model
checking of both MSO and PDL. The problems are ExpTime-Complete for PDL.
","[{'version': 'v1', 'created': 'Tue, 20 Sep 2016 18:52:07 GMT'}]",2016-09-21,"[['Aiswarya', 'C.', ''], ['Gastin', 'Paul', ''], ['Saivasan', 'Prakash', '']]","['Higher-order pushdown systems', 'Nested words', 'Model checking', 'splitwidth']"
13661,1412.7703,Mohammad Rasouli,Mohammad Rasouli,"A Game-Theoretic Framework for Studying Dynamics of Multi Decision-maker
  Systems",,,,,cs.GT cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  System Dynamics (SD) main aim is to study dynamic behavior of systems based
on causal relations. The other purpose of the science is to design policies,
both in initial values and causal relation, to change system behavior as we
desire. Especially we are interested in making systems behavior a convergent
one. Although now SD is mainly used in situations of single policy maker, there
are major parts of situations in which there are multi policy makers playing
role. Game Theory (GT) is an appropriate tool for studying such cases.GT is the
theory of studying multi decision-maker conditions. In this paper we will
introduce GT and explain how to apply it in SD. Also we will provide some
examples of microeconomic systems and show how to use GT for studying and
simulating dynamics of these example systems. We will also have a short discuss
on how SD can help GT studies.
","[{'version': 'v1', 'created': 'Wed, 24 Dec 2014 16:20:35 GMT'}]",2014-12-25,"[['Rasouli', 'Mohammad', '']]","['System Dynamics', 'Game theory', 'multi decision-maker systems', 'Nash']"
13662,1307.6328,Md. Maklachur Rahman,"Mohammad Ibrahim Khan, Md. Maklachur Rahman and Md. Iqbal Hasan Sarker","Digital Watermarking for Image AuthenticationBased on Combined DCT, DWT
  and SVD Transformation","8 pages, 7 figures and 2 tables","IJCSI International Journal of Computer Science Issues, Vol. 10,
  Issue 3, No 1, May 2013",,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a hybrid digital image watermarking based on Discrete
Wavelet Transform (DWT), Discrete Cosine Transform (DCT) and Singular Value
Decomposition (SVD) in a zigzag order. From DWT we choose the high band to
embed the watermark that facilities to add more information, gives more
invisibility and robustness against some attacks. Such as geometric attack.
Zigzag method is applied to map DCT coefficients into four quadrants that
represent low, mid and high bands. Finally, SVD is applied to each quadrant.
","[{'version': 'v1', 'created': 'Wed, 24 Jul 2013 08:32:38 GMT'}]",2013-07-25,"[['Khan', 'Mohammad Ibrahim', ''], ['Rahman', 'Md. Maklachur', ''], ['Sarker', 'Md. Iqbal Hasan', '']]","['Watermarking', 'DWT', 'DCT', 'SVD', 'Zigzag method.   1']"
13663,1208.0891,Mutaz M. Al-Debei,Enas M. Al-Lozi and Mutaz M. Al-Debei,A Framework of Value Exchange and Role Playing in Web 2.0 WebSites,,"European, Mediterranean & Middle Eastern Conference on Information
  Systems (EMCIS 2012), 2012",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Digitally engaged communities can be described as communities created and
evolved within Web 2.0 Websites such as Facebook, Bebo, and Twitter. The
growing importance of digitally engaged communities calls for the need to
efficiently manage the building blocks of sustaining a healthy community. The
initial operation of any digitally-engaged community depends on the existence
of its own members, the beneficial values created and exchanged, and the
relationships interlinking both. However, the level of contribution and
involvement might vary depending on the benefits being gratified from engaging
in such communities. In other words, motivations for participating and getting
involved are purposive; individuals are driven into joining and /or taking part
in any digitallyengaged network for capturing and purtaining certain beneficial
values. Accordingly, this paper proposes a framework that classifies the values
created and exchanged within these communities as well as the roles adopted and
played by users of these communities. Utilizing ethnography as the primay
methodological strategy to study Bebo digitally-engaged community, this
research identifies five different roles of users: Newbie, Lurker, Novice,
Insider, and Leader. Moreover, the research also identifies five value elements
that could be captured by different users: Social, Hedonic, Epistemic, Gift,
and Utilitarian. The results of this study provides insights for decision and
policy makers, service providers, and developers; as it inspires them in
knowing and meeting the needs and values of participants based on the roles
adopted by users.
","[{'version': 'v1', 'created': 'Sat, 4 Aug 2012 05:28:51 GMT'}]",2012-08-07,"[['Al-Lozi', 'Enas M.', ''], ['Al-Debei', 'Mutaz M.', '']]","['Social Networking Sites', 'Digitally Engaged Communities', 'Values', 'Roles', 'Online Communities', 'Gift Economy', 'Web 2.0', 'SNS']"
13664,1504.06451,Marios Meimaris,"Marios Meimaris, George Papastefanatos, Christos Pateritsas, Theodora
  Galani and Yannis Stavrakas",A Framework for Managing Evolving Information Resources on the Data Web,arXiv admin note: text overlap with arXiv:1504.01891,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The web of data has brought forth the need to preserve and sustain evolving
information within linked datasets; however, a basic requirement of data
preservation is the maintenance of the datasets' structural characteristics as
well. As open data are often found using different and/or heterogeneous data
models and schemata from one source to another, there is a need to reconcile
these mismatches and provide common denominations of interpretation on a
multitude of levels, in order to be able to preserve and manage the evolution
of the generated resources. In this paper, we present a linked data approach
for the preservation and archiving of open heterogeneous datasets that evolve
through time, at both the structural and the semantic layer. We first propose a
set of re-quirements for modelling evolving linked datasets. We then proceed on
concep-tualizing a modelling framework for evolving entities and place these in
a 2x2 model space that consists of the semantic and the temporal dimensions.
","[{'version': 'v1', 'created': 'Fri, 24 Apr 2015 10:02:01 GMT'}, {'version': 'v2', 'created': 'Tue, 5 May 2015 14:43:54 GMT'}]",2015-05-06,"[['Meimaris', 'Marios', ''], ['Papastefanatos', 'George', ''], ['Pateritsas', 'Christos', ''], ['Galani', 'Theodora', ''], ['Stavrakas', 'Yannis', '']]","['Data Evolution', 'Change Management', 'Linked Data Dynamics']"
13665,1010.5128,Ahmed Ayadi,Ahmed Ayadi and Patrick Maill\'e and David Ros,"TCP over low-power and lossy networks: tuning the segment size to
  minimize energy consumption",TELECOM Bretagne Research Report,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Low-power and Lossy Networks (LLNs), like wireless networks based upon the
IEEE 802.15.4 standard, have strong energy constraints, and are moreover
subject to frequent transmission errors, not only due to congestion but also to
collisions and to radio channel conditions. This paper introduces an analytical
model to compute the total energy consumption in an LLN due to the TCP
protocol. The model allows us to highlight some tradeoffs as regards the choice
of the TCP maximum segment size, of the Forward Error Correction (FEC)
redundancy ratio, and of the number of link-layer retransmissions, in order to
minimize the total energy consumption.
","[{'version': 'v1', 'created': 'Mon, 25 Oct 2010 13:52:40 GMT'}]",2010-10-26,"[['Ayadi', 'Ahmed', ''], ['Maillé', 'Patrick', ''], ['Ros', 'David', '']]","['Multi-Hop Wireless Networks', 'Low-Power and Lossy Networks', 'Energy Efficiency', 'TCP']"
13666,1401.4447,Abdul Kadir,"Abdul Kadir, Lukito Edi Nugroho, Adhi Susanto, Paulus Insap Santosa","Leaf Classification Using Shape, Color, and Texture Features","6 pages, International Journal of Computer Trends and Technology-
  July to Aug Issue 2011",,,,cs.CV cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several methods to identify plants have been proposed by several researchers.
Commonly, the methods did not capture color information, because color was not
recognized as an important aspect to the identification. In this research,
shape and vein, color, and texture features were incorporated to classify a
leaf. In this case, a neural network called Probabilistic Neural network (PNN)
was used as a classifier. The experimental result shows that the method for
classification gives average accuracy of 93.75% when it was tested on Flavia
dataset, that contains 32 kinds of plant leaves. It means that the method gives
better performance compared to the original work.
","[{'version': 'v1', 'created': 'Wed, 20 Nov 2013 07:55:40 GMT'}]",2014-01-20,"[['Kadir', 'Abdul', ''], ['Nugroho', 'Lukito Edi', ''], ['Susanto', 'Adhi', ''], ['Santosa', 'Paulus Insap', '']]","['Color features', 'Foliage plants', 'Lacunarity', 'Leaf classification', 'PFT', 'PNN', 'Texture features']"
13667,1603.07243,Paul Dorbec,"Paul Dorbec (LaBRI), Seethu Varghese, Ambat Vijayakumar",Heredity for generalized power domination,"Discrete Mathematics and Theoretical Computer Science, 2016",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the behaviour of the generalized power domination
number of a graph by small changes on the graph, namely edge and vertex
deletion and edge contraction. We prove optimal bounds for
$\gamma\_{p,k}(G-e)$, $\gamma\_{p,k}(G/e)$ and for $\gamma\_{p,k}(G-v)$ in
terms of $\gamma\_{p,k}(G)$, and give examples for which these bounds are
tight. We characterize all graphs for which $\gamma\_{p,k}(G-e) =
\gamma\_{p,k}(G)+1$ for any edge $e$. We also consider the behaviour of the
propagation radius of graphs by similar modifications.
","[{'version': 'v1', 'created': 'Wed, 23 Mar 2016 15:44:24 GMT'}]",2016-03-24,"[['Dorbec', 'Paul', '', 'LaBRI'], ['Varghese', 'Seethu', ''], ['Vijayakumar', 'Ambat', '']]","['power domination', 'electrical network monitoring', 'domination', 'edge critical graphs', 'propagation radius']"
13668,1708.02029,Xiu Fang,"Xiu Susie Fang and Quan Z. Sheng and Xianzhi Wang and Wei Emma Zhang
  and Anne H.H. Ngu","From Appearance to Essence: Comparing Truth Discovery Methods without
  Using Ground Truth",,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Truth discovery has been widely studied in recent years as a fundamental
means for resolving the conflicts in multi-source data. Although many truth
discovery methods have been proposed based on different considerations and
intuitions, investigations show that no single method consistently outperforms
the others. To select the right truth discovery method for a specific
application scenario, it becomes essential to evaluate and compare the
performance of different methods. A drawback of current research efforts is
that they commonly assume the availability of certain ground truth for the
evaluation of methods. However, the ground truth may be very limited or even
out-of-reach in practice, rendering the evaluation biased by the small ground
truth or even unfeasible. In this paper, we present CompTruthHyp, a general
approach for comparing the performance of truth discovery methods without using
ground truth. In particular, our approach calculates the probability of
observations in a dataset based on the output of different methods. The
probability is then ranked to reflect the performance of these methods. We
review and compare twelve existing truth discovery methods and consider both
single-valued and multi-valued objects. Empirical studies on both real-world
and synthetic datasets demonstrate the effectiveness of our approach for
comparing truth discovery methods.
","[{'version': 'v1', 'created': 'Mon, 7 Aug 2017 08:12:22 GMT'}]",2017-08-08,"[['Fang', 'Xiu Susie', ''], ['Sheng', 'Quan Z.', ''], ['Wang', 'Xianzhi', ''], ['Zhang', 'Wei Emma', ''], ['Ngu', 'Anne H. H.', '']]","['Big Data', 'Truth Discovery Methods', 'Sparse Ground Truth', 'Performance Evaluation', 'Single-Valued Objects', 'Multi-Valued Objects']"
13669,1105.0653,Joachim Wehler,"Christoph Schneider, Joachim Wehler",Model Checking of Boolean Process Models,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the field of Business Process Management formal models for the control
flow of business processes have been designed since more than 15 years. Which
methods are best suited to verify the bulk of these models? The first step is
to select a formal language which fixes the semantics of the models. We adopt
the language of Boolean systems as reference language for Boolean process
models. Boolean systems form a simple subclass of coloured Petri nets. Their
characteristics are low tokens to model explicitly states with a subsequent
skipping of activations and arbitrary logical rules of type AND, XOR, OR etc.
to model the split and join of the control flow. We apply model checking as a
verification method for the safeness and liveness of Boolean systems. Model
checking of Boolean systems uses the elementary theory of propositional logic,
no modal operators are needed. Our verification builds on a finite complete
prefix of a certain T-system attached to the Boolean system. It splits the
processes of the Boolean system into a finite set of base processes of bounded
length. Their behaviour translates to formulas from propositional logic. Our
verification task consists in checking the satisfiability of these formulas. In
addition we have implemented our model checking algorithm as a java program.
The time needed to verify a given Boolean system depends critically on the
number of initial tokens. Because the algorithm has to solve certain
SAT-problems, polynomial complexity cannot be expected. The paper closes with
the model checking of some Boolean process models which have been designed as
Event-driven Process Chains.
","[{'version': 'v1', 'created': 'Tue, 3 May 2011 18:49:18 GMT'}]",2011-05-04,"[['Schneider', 'Christoph', ''], ['Wehler', 'Joachim', '']]","['Base process', 'Boolean system', 'EPC', 'model checking', 'SAT-problem', 'verification']"
13670,0905.1751,Chao-Yang Pang,"Chao-Yang Pang, Chong-Bao Wang and Ben-Qiong Hu",Experiment Study of Entropy Convergence of Ant Colony Optimization,"21 papges, 8 figures",,,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ant colony optimization (ACO) has been applied to the field of combinatorial
optimization widely. But the study of convergence theory of ACO is rare under
general condition. In this paper, the authors try to find the evidence to prove
that entropy is related to the convergence of ACO, especially to the estimation
of the minimum iteration number of convergence. Entropy is a new view point
possibly to studying the ACO convergence under general condition. Key Words:
Ant Colony Optimization, Convergence of ACO, Entropy
","[{'version': 'v1', 'created': 'Tue, 12 May 2009 12:38:57 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Jun 2009 14:50:03 GMT'}, {'version': 'v3', 'created': 'Fri, 24 Jul 2009 08:11:20 GMT'}, {'version': 'v4', 'created': 'Sun, 25 Oct 2009 03:08:14 GMT'}]",2009-10-25,"[['Pang', 'Chao-Yang', ''], ['Wang', 'Chong-Bao', ''], ['Hu', 'Ben-Qiong', '']]","['Ant Colony Optimization', 'Convergence of ACO', 'Entropy']"
13671,1605.01014,Xiang Yu,Xiang Yu and Feng Zhou and Manmohan Chandraker,Deep Deformation Network for Object Landmark Localization,This work is going to appear at ECCV,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel cascaded framework, namely deep deformation network (DDN),
for localizing landmarks in non-rigid objects. The hallmarks of DDN are its
incorporation of geometric constraints within a convolutional neural network
(CNN) framework, ease and efficiency of training, as well as generality of
application. A novel shape basis network (SBN) forms the first stage of the
cascade, whereby landmarks are initialized by combining the benefits of CNN
features and a learned shape basis to reduce the complexity of the highly
nonlinear pose manifold. In the second stage, a point transformer network (PTN)
estimates local deformation parameterized as thin-plate spline transformation
for a finer refinement. Our framework does not incorporate either handcrafted
features or part connectivity, which enables an end-to-end shape prediction
pipeline during both training and testing. In contrast to prior cascaded
networks for landmark localization that learn a mapping from feature space to
landmark locations, we demonstrate that the regularization induced through
geometric priors in the DDN makes it easier to train, yet produces superior
results. The efficacy and generality of the architecture is demonstrated
through state-of-the-art performances on several benchmarks for multiple tasks
such as facial landmark localization, human body pose estimation and bird part
localization.
","[{'version': 'v1', 'created': 'Tue, 3 May 2016 18:31:12 GMT'}, {'version': 'v2', 'created': 'Sun, 24 Jul 2016 06:46:58 GMT'}]",2016-07-26,"[['Yu', 'Xiang', ''], ['Zhou', 'Feng', ''], ['Chandraker', 'Manmohan', '']]","['Landmark localization', 'convolutional neural network', 'non-rigid shapeanalysis']"
13672,1402.2509,Subha,"M.Subha, K.Saravanan","Achieve Better Ranking Accuracy Using CloudRank Framework for Cloud
  Services","6 pages, 10 figures, Published with International Journal of
  Engineering Trends and Technology (IJETT)","International Journal of Engineering Trends and Technology (IJETT)
  6(6):307-312, December 2013",,,cs.DC cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Building high quality cloud applications becomes an urgently required
research problem. Nonfunctional performance of cloud services is usually
described by quality-of-service (QoS). In cloud applications, cloud services
are invoked remotely by internet connections. The QoS Ranking of cloud services
for a user cannot be transferred directly to another user, since the locations
of the cloud applications are quite different. Personalized QoS Ranking is
required to evaluate all candidate services at the user - side but it is
impractical in reality. To get QoS values, the service candidates are usually
required and it is very expensive. To avoid time consuming and expensive
realworld service invocations, this paper proposes a CloudRank framework which
predicts the QoS ranking directly without predicting the corresponding QoS
values. This framework provides an accurate ranking but the QoS values are same
in both algorithms so, an optimal VM allocation policy is used to improve the
QoS performance of cloud services and it also provides better ranking accuracy
than CloudRank2 algorithm.
","[{'version': 'v1', 'created': 'Tue, 11 Feb 2014 14:51:11 GMT'}]",2014-02-12,"[['Subha', 'M.', ''], ['Saravanan', 'K.', '']]","['Quality-of-Service', 'Cloud Services', 'Cloud']"
13673,1410.5652,Andr\'as Kir\'aly Ph.D.,"Tam\'as Varga, Andr\'as Kir\'aly, J\'anos Abonyi","Improvement of PSO algorithm by memory based gradient search -
  application in inventory management","book chapter, 20 pages, 7 figures, 2 tables","Swarm Intelligence and Bio-Inspired Computation: Theory and
  Applications, 1st Edition, pages 403-422. Elsevier, Oxford, 2013",,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advanced inventory management in complex supply chains requires effective and
robust nonlinear optimization due to the stochastic nature of supply and demand
variations. Application of estimated gradients can boost up the convergence of
Particle Swarm Optimization (PSO) algorithm but classical gradient calculation
cannot be applied to stochastic and uncertain systems. In these situations
Monte-Carlo (MC) simulation can be applied to determine the gradient. We
developed a memory based algorithm where instead of generating and evaluating
new simulated samples the stored and shared former function evaluations of the
particles are sampled to estimate the gradients by local weighted least squares
regression. The performance of the resulted regional gradient-based PSO is
verified by several benchmark problems and in a complex application example
where optimal reorder points of a supply chain are determined.
","[{'version': 'v1', 'created': 'Tue, 21 Oct 2014 13:40:23 GMT'}]",2014-10-22,"[['Varga', 'Tamás', ''], ['Király', 'András', ''], ['Abonyi', 'János', '']]","['particle swarm optimization', 'gradient', 'Monte-Carlo simulation', 'inventory']"
13674,1212.2563,Krishna Prakash K,"Balachandra Muniyal, Krishna Prakash and Shashank Sharma",Wireless Public key Infrastructure for Mobile Phones,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile devices play an important role in the wireless network environment for
providing different services over internet. The business transactions over
wireless electronic devices are not secure and hence the messages are prone to
be intercepted and modified by an intruder. So, devices supporting wireless
internet must be guaranteed at the same level of security as the wired network.
PKI (Public Key Infrastructure) used in the wired environment is not suitable
for wireless environment because of the less powerful processor and small
memory. This arises a need for the development of a Wireless Public Key
Infrastructure (WPKI) that provides the similar security level as the wired PKI
suitable for mobile phone. In this paper, a discussion of public key
infrastructure and an experimental set up for Wireless Public key
Infrastructure for mobile phones are made.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2012 17:59:48 GMT'}]",2012-12-12,"[['Muniyal', 'Balachandra', ''], ['Prakash', 'Krishna', ''], ['Sharma', 'Shashank', '']]","['WPKI', 'Digital Certificate', 'Wireless internet', 'M-commerce']"
13675,1604.07187,Othon Michail,"Othon Michail, Paul G. Spirakis",How Many Cooks Spoil the Soup?,19 pages,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we study the following basic question: ""How much parallelism
does a distributed task permit?"" Our definition of parallelism (or symmetry)
here is not in terms of speed, but in terms of identical roles that processes
have at the same time in the execution. We initiate this study in population
protocols, a very simple model that not only allows for a straightforward
definition of what a role is, but also encloses the challenge of isolating the
properties that are due to the protocol from those that are due to the
adversary scheduler, who controls the interactions between the processes. We
(i) give a partial characterization of the set of predicates on input
assignments that can be stably computed with maximum symmetry, i.e.,
$\Theta(N_{min})$, where $N_{min}$ is the minimum multiplicity of a state in
the initial configuration, and (ii) we turn our attention to the remaining
predicates and prove a strong impossibility result for the parity predicate:
the inherent symmetry of any protocol that stably computes it is upper bounded
by a constant that depends on the size of the protocol.
","[{'version': 'v1', 'created': 'Mon, 25 Apr 2016 09:55:56 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Aug 2016 23:32:59 GMT'}]",2016-08-19,"[['Michail', 'Othon', ''], ['Spirakis', 'Paul G.', '']]","['coordinator', 'parallelism', 'symmetry', 'symmetry breaking', 'population protocol', 'leader election', 'majority', 'parity']"
13676,1106.1770,Jan Oksanen,"Jan Oksanen, Jarmo Lund\'en, Visa Koivunen","Reinforcement learning based sensing policy optimization for energy
  efficient cognitive radio networks","10 pages, 13 figures, Accepted to Neurocomputing special issue:
  Machine learning for signal processing, 2011",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a machine learning based collaborative multi-band
spectrum sensing policy for cognitive radios. The proposed sensing policy
guides secondary users to focus the search of unused radio spectrum to those
frequencies that persistently provide them high data rate. The proposed policy
is based on machine learning, which makes it adaptive with the temporally and
spatially varying radio spectrum. Furthermore, there is no need for dynamic
modeling of the primary activity since it is implicitly learned over time.
Energy efficiency is achieved by minimizing the number of assigned sensors per
each subband under a constraint on miss detection probability. It is important
to control the missed detections because they cause collisions with primary
transmissions and lead to retransmissions at both the primary and secondary
user. Simulations show that the proposed machine learning based sensing policy
improves the overall throughput of the secondary network and improves the
energy efficiency while controlling the miss detection probability.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2011 10:40:08 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Jul 2011 11:08:21 GMT'}, {'version': 'v3', 'created': 'Tue, 4 Oct 2011 06:02:16 GMT'}]",2011-10-05,"[['Oksanen', 'Jan', ''], ['Lundén', 'Jarmo', ''], ['Koivunen', 'Visa', '']]","['Cognitive radio', 'Frequency hopping', 'Machine learning', 'Sensing policy', 'Spatial diversity', 'Spectrum sensing']"
13677,1702.05807,Ankush Das,Ankush Das and Akash Lal,Precise Null Pointer Analysis Through Global Value Numbering,"17 pages, 1 section in Appendix",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Precise analysis of pointer information plays an important role in many
static analysis techniques and tools today. The precision, however, must be
balanced against the scalability of the analysis. This paper focusses on
improving the precision of standard context and flow insensitive alias analysis
algorithms at a low scalability cost. In particular, we present a
semantics-preserving program transformation that drastically improves the
precision of existing analyses when deciding if a pointer can alias NULL. Our
program transformation is based on Global Value Numbering, a scheme inspired
from compiler optimizations literature. It allows even a flow-insensitive
analysis to make use of branch conditions such as checking if a pointer is NULL
and gain precision. We perform experiments on real-world code to measure the
overhead in performing the transformation and the improvement in the precision
of the analysis. We show that the precision improves from 86.56% to 98.05%,
while the overhead is insignificant.
","[{'version': 'v1', 'created': 'Sun, 19 Feb 2017 22:10:29 GMT'}]",2017-02-21,"[['Das', 'Ankush', ''], ['Lal', 'Akash', '']]","['Alias Analysis', 'Global Value Numbering', 'Static Single Assignment']"
13678,1004.1230,Rdv Ijcsis,"Phanu Waraporn, Phayung Meesad, Gareth Clayton","Ontology-supported processing of clinical text using medical knowledge
  integration for multi-label classification of diagnosis coding","IEEE Publication format, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","IJCSIS, Vol. 7 No. 3, March 2010,",,,cs.LG cs.AI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper discusses the knowledge integration of clinical information
extracted from distributed medical ontology in order to ameliorate a machine
learning-based multi-label coding assignment system. The proposed approach is
implemented using a decision tree based cascade hierarchical technique on the
university hospital data for patients with Coronary Heart Disease (CHD). The
preliminary results obtained show a satisfactory finding.
","[{'version': 'v1', 'created': 'Thu, 8 Apr 2010 03:06:24 GMT'}]",2010-04-09,"[['Waraporn', 'Phanu', ''], ['Meesad', 'Phayung', ''], ['Clayton', 'Gareth', '']]","['component; medical ontology', 'diagnosis coding', 'knowledge integration', 'machine learing', 'decision tree']"
13679,1609.05662,Raka Jovanovic,"Raka Jovanovic, Islam Safak Bayram, Stefan Voss",A GRASP approach for solving the 2-connected m-dominating set problem,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a constructive heuristic algorithm for the
$2$-connected $m$-dominating set problem. It is based on a greedy heuristic in
which a 2-connected subgraph is iteratively extended with suitable open ears.
The growth procedure is an adaptation of the breadth-first-search which
efficiently manages to find open ears. Further, a heuristic function is defined
for selecting the best ear out of a list of candidates. The performance of the
basic approach is improved by adding a correction procedure which removes
unnecessary nodes from a generated solution. Finally, randomization is included
and the method is extended towards the GRASP metaheuristic. In our
computational experiments, we compare the performance of the proposed algorithm
to recently published results and show that the method is highly competitive
and especially suitable for dense graphs.
","[{'version': 'v1', 'created': 'Mon, 19 Sep 2016 10:53:37 GMT'}]",2016-09-20,"[['Jovanovic', 'Raka', ''], ['Bayram', 'Islam Safak', ''], ['Voss', 'Stefan', '']]","['dominating sets', '2-connected graphs', 'GRASP', 'fault tolerant']"
13680,0804.0409,Ayoub Otmani,"Ayoub Otmani, Jean-Pierre Tillich, Leonard Dallot",Cryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes,Major corrections. This version supersedes previuos ones,,,,cs.CR cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We cryptanalyse here two variants of the McEliece cryptosystem based on
quasi-cyclic codes. Both aim at reducing the key size by restricting the public
and secret generator matrices to be in quasi-cyclic form. The first variant
considers subcodes of a primitive BCH code. We prove that this variant is not
secure by finding and solving a linear system satisfied by the entries of the
secret permutation matrix.
  The other variant uses quasi-cyclic low density parity-check codes. This
scheme was devised to be immune against general attacks working for McEliece
type cryptosystems based on low density parity-check codes by choosing in the
McEliece scheme more general one-to-one mappings than permutation matrices. We
suggest here a structural attack exploiting the quasi-cyclic structure of the
code and a certain weakness in the choice of the linear transformations that
hide the generator matrix of the code. Our analysis shows that with high
probability a parity-check matrix of a punctured version of the secret code can
be recovered in cubic time complexity in its length. The complete
reconstruction of the secret parity-check matrix of the quasi-cyclic low
density parity-check codes requires the search of codewords of low weight which
can be done with about $2^{37}$ operations for the specific parameters
proposed.
","[{'version': 'v1', 'created': 'Wed, 2 Apr 2008 18:27:59 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Apr 2008 13:28:41 GMT'}, {'version': 'v3', 'created': 'Sun, 3 Jan 2010 22:28:04 GMT'}]",2010-01-04,"[['Otmani', 'Ayoub', ''], ['Tillich', 'Jean-Pierre', ''], ['Dallot', 'Leonard', '']]","['McEliece cryptosystem', 'quasi-cyclic codes', 'BCH codes', 'LDPCcodes', 'cryptanalysis']"
13681,0705.0453,Jerome Darmont,"J\'er\^ome Darmont (LIMOS), Bertrand Petit (LIMOS), Michel Schneider
  (LIMOS)","OCB: A Generic Benchmark to Evaluate the Performances of Object-Oriented
  Database Systems",,"LNCS, Vol. 1377 (03/1998) 326-340",,,cs.DB,,"  We present in this paper a generic object-oriented benchmark (the Object
Clustering Benchmark) that has been designed to evaluate the performances of
clustering policies in object-oriented databases. OCB is generic because its
sample database may be customized to fit the databases introduced by the main
existing benchmarks (e.g., OO1). OCB's current form is clustering-oriented
because of its clustering-oriented workload, but it can be easily adapted to
other purposes. Lastly, OCB's code is compact and easily portable. OCB has been
implemented in a real system (Texas, running on a Sun workstation), in order to
test a specific clustering policy called DSTC. A few results concerning this
test are presented.
","[{'version': 'v1', 'created': 'Thu, 3 May 2007 12:54:30 GMT'}]",2007-05-23,"[['Darmont', 'Jérôme', '', 'LIMOS'], ['Petit', 'Bertrand', '', 'LIMOS'], ['Schneider', 'Michel', '', 'LIMOS']]","['object-oriented databases', 'clustering', 'performance evaluation', 'benchmarking', 'DSTC']"
13682,1205.0480,Hassan Keshavarz,"Hassan Keshavarz, Mohammad Reza Jabbarpour Sattari and Rafidah Md Noor",Session Initiation Protocol Attacks and Challenges,,,,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  In recent years, Session Initiation Protocol (SIP) has become widely used in
current internet protocols. It is a text-based protocol much like Hyper Text
Transport Protocol (HTTP) and Simple Mail Transport Protocol (SMTP). SIP is a
strong enough signaling protocol on the internet for establishing, maintaining,
and terminating session. In this paper the areas of security and attacks in SIP
are discussed. We consider attacks from diverse related perspectives. The
authentication schemes are compared, the representative existing solutions are
highlighted, and several remaining research challenges are identified. Finally,
the taxonomy of SIP threat will be presented.
","[{'version': 'v1', 'created': 'Wed, 2 May 2012 16:12:33 GMT'}]",2012-05-03,"[['Keshavarz', 'Hassan', ''], ['Sattari', 'Mohammad Reza Jabbarpour', ''], ['Noor', 'Rafidah Md', '']]","['Cryptography', 'Cryptanalysis', 'SIP']"
13683,0904.0578,Gergely Luk\'acsy,"Gergely Luk\'acsy, P\'eter Szeredi",Efficient Description Logic Reasoning in Prolog: The DLog system,"73 pages, 5 Postscript figures, uses
  {rotating,multirow,fancyvrb,psfrag}.sty To appear in Theory and Practice of
  Logic Programming (TPLP)",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a resolution based Description Logic reasoning system
called DLog. DLog transforms Description Logic axioms into a Prolog program and
uses the standard Prolog execution for efficiently answering instance retrieval
queries. From the Description Logic point of view, DLog is an ABox reasoning
engine for the full SHIQ language. The DLog approach makes it possible to store
the individuals in a database instead of memory, which results in better
scalability and helps using description logic ontologies directly on top of
existing information sources.
  To appear in Theory and Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Fri, 3 Apr 2009 13:52:57 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Apr 2009 13:31:10 GMT'}]",2009-04-09,"[['Lukácsy', 'Gergely', ''], ['Szeredi', 'Péter', '']]","['description logic', 'logic programming', 'resolution', 'large data sets', 'open world']"
13684,1412.6145,Lenka Skanderova,Lenka Skanderova and Tomas Fabian,"Study of the Influence of the Number Normalization Scheme Used in Two
  Chaotic Pseudo Random Number Generators Used as the Source of Randomness in
  Differential Evolution",Pre-print for Impact Factor Journal Natural Computing,,,,cs.NE cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many publications, authors showed that chaotic pseudo random number
generators (PRNGs) may improve performance of the evolutionary algorithms. In
this paper, we use two chaotic maps Gingerbread man and Tinkerbell as the
chaotic PRNGs instead of the classical PRNG in the differential evolution.
Numbers generated by this maps are normalized to the unit interval by three
different methods -- operation modulo, straightforward number normalization
where we know minimal and maximal generated number and arctangent of the two
variables $x$ and $y$, where numbers $x$ and $y$ are generated by the
Gingerbread man map and Tinkerbell map. The first goal of this paper is to show
whether the differential evolution convergence speed might be affected by the
way how we normalize number generated by the chaotic map. The second goal is to
find out the influence of the probability distribution function of the selected
chaotic PRNGs. The results mentioned below showed that the selected
normalization method may improve differential evolution convergence speed,
especially in the case of arctangent and straightforward number normalization,
where we know the minimal and maximal generated numbers.
","[{'version': 'v1', 'created': 'Mon, 1 Dec 2014 14:44:15 GMT'}]",2014-12-22,"[['Skanderova', 'Lenka', ''], ['Fabian', 'Tomas', '']]","['Differential evolution', 'pseudo random number generator', 'number normalization scheme', 'chaos', 'Gingerbread man', 'Tinkerbell']"
13685,0801.2201,Ed Harcourt,Ed Harcourt,Policies of System Level Pipeline Modeling,,,,,cs.AR cs.PL,,"  Pipelining is a well understood and often used implementation technique for
increasing the performance of a hardware system. We develop several SystemC/C++
modeling techniques that allow us to quickly model, simulate, and evaluate
pipelines. We employ a small domain specific language (DSL) based on resource
usage patterns that automates the drudgery of boilerplate code needed to
configure connectivity in simulation models. The DSL is embedded directly in
the host modeling language SystemC/C++. Additionally we develop several
techniques for parameterizing a pipeline's behavior based on policies of
function, communication, and timing (performance modeling).
","[{'version': 'v1', 'created': 'Tue, 15 Jan 2008 15:44:28 GMT'}]",2008-01-16,"[['Harcourt', 'Ed', '']]","['pipeline', 'system level design', 'discrete-event simulation', 'generic programming', 'hardwaremodeling', 'policies', 'SystemC']"
13686,1401.6420,Ronald Hochreiter,Ronald Hochreiter and Christoph Waldhauser,"Zombie Politics: Evolutionary Algorithms to Counteract the Spread of
  Negative Opinions",,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is about simulating the spread of opinions in a society and about
finding ways to counteract that spread. To abstract away from potentially
emotionally laden opinions, we instead simulate the spread of a zombie outbreak
in a society. The virus causing this outbreak is different from traditional
approaches: it not only causes a binary outcome (healthy vs infected) but
rather a continuous outcome. To counteract the outbreak, a discrete number of
infection-level specific treatments is available. This corresponds to acts of
mild persuasion or the threats of legal action in the opinion spreading use
case. This paper offers a genetic and a cultural algorithm that find the
optimal mixture of treatments during the run of the simulation. They are
assessed in a number of different scenarios. It is shown, that albeit far from
being perfect, the cultural algorithm delivers superior performance at lower
computational expense.
","[{'version': 'v1', 'created': 'Wed, 22 Jan 2014 15:49:09 GMT'}]",2014-01-27,"[['Hochreiter', 'Ronald', ''], ['Waldhauser', 'Christoph', '']]","['dynamic optimization', 'opinion propagation', 'epidemiology', 'evolutionary computing']"
13687,1304.4634,Leonardo Torres,"Leonardo Torres and Sidnei J. S. Sant'Anna and Corina C. Freitas and
  Alejandro C. Frery","Speckle Reduction in Polarimetric SAR Imagery with Stochastic Distances
  and Nonlocal Means",Accepted for publication in Pattern Recognition,,,,cs.IT cs.CV cs.GR math.IT stat.AP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a technique for reducing speckle in Polarimetric
Synthetic Aperture Radar (PolSAR) imagery using Nonlocal Means and a
statistical test based on stochastic divergences. The main objective is to
select homogeneous pixels in the filtering area through statistical tests
between distributions. This proposal uses the complex Wishart model to describe
PolSAR data, but the technique can be extended to other models. The weights of
the location-variant linear filter are function of the p-values of tests which
verify the hypothesis that two samples come from the same distribution and,
therefore, can be used to compute a local mean. The test stems from the family
of (h-phi) divergences which originated in Information Theory. This novel
technique was compared with the Boxcar, Refined Lee and IDAN filters. Image
quality assessment methods on simulated and real data are employed to validate
the performance of this approach. We show that the proposed filter also
enhances the polarimetric entropy and preserves the scattering information of
the targets.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2013 22:11:53 GMT'}]",2013-04-18,"[['Torres', 'Leonardo', ''], [""Sant'Anna"", 'Sidnei J. S.', ''], ['Freitas', 'Corina C.', ''], ['Frery', 'Alejandro C.', '']]","['Hypothesis testing', 'Information theory', 'Multiplicative noise', 'PolSAR imagery', 'Speckle reduction', 'Stochastic distances', 'Synthetic Aperture Radar']"
13688,1304.0829,Tony Tan,Eryk Kopczynski and Tony Tan,Regular graphs and the spectra of two-variable logic with counting,30 pages,,,,cs.LO cs.CC cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The {\em spectrum} of a first-order logic sentence is the set of natural
numbers that are cardinalities of its finite models. In this paper we show that
when restricted to using only two variables, but allowing counting quantifiers,
the spectra of first-order logic sentences are semilinear and hence, closed
under complement. At the heart of our proof are semilinear characterisations
for the existence of regular and biregular graphs, the class of graphs in which
there are a priori bounds on the degrees of the vertices.
  Our proof also provides a simple characterisation of models of two-variable
logic with counting -- that is, up to renaming and extending the relation
names, they are simply a collection of regular and biregular graphs.
","[{'version': 'v1', 'created': 'Wed, 3 Apr 2013 03:15:45 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Oct 2013 19:06:16 GMT'}, {'version': 'v3', 'created': 'Fri, 22 Nov 2013 23:04:12 GMT'}, {'version': 'v4', 'created': 'Wed, 11 Jun 2014 16:18:28 GMT'}]",2014-06-12,"[['Kopczynski', 'Eryk', ''], ['Tan', 'Tony', '']]","['two-variable logic with counting', 'first-order spectra', 'regular graphs', 'semi-linear', 'Presburger arithmetic']"
13689,1004.3258,Vishal Goyal,A. Mosavi,Multiple Criteria Decision-Making Preprocessing Using Data Mining Tools,"International Journal of Computer Science Issues at
  http://ijcsi.org/articles/Multiple-Criteria-Decision-Making-Preprocessing-Using-Data-Mining-Tools.php","IJCSI, Volume 7, Issue 2, March 2010",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real-life engineering optimization problems need Multiobjective Optimization
(MOO) tools. These problems are highly nonlinear. As the process of Multiple
Criteria Decision-Making (MCDM) is much expanded most MOO problems in different
disciplines can be classified on the basis of it. Thus MCDM methods have gained
wide popularity in different sciences and applications. Meanwhile the
increasing number of involved components, variables, parameters, constraints
and objectives in the process, has made the process very complicated. However
the new generation of MOO tools has made the optimization process more
automated, but still initializing the process and setting the initial value of
simulation tools and also identifying the effective input variables and
objectives in order to reach the smaller design space are still complicated. In
this situation adding a preprocessing step into the MCDM procedure could make a
huge difference in terms of organizing the input variables according to their
effects on the optimization objectives of the system. The aim of this paper is
to introduce the classification task of data mining as an effective option for
identifying the most effective variables of the MCDM systems. To evaluate the
effectiveness of the proposed method an example has been given for 3D wing
design.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2010 17:53:38 GMT'}]",2010-04-20,"[['Mosavi', 'A.', '']]","['Multiple Criteria Decision-Making', 'Multiobjective optimization', 'preprocessing', 'Data Mining']"
13690,1603.08511,Richard Zhang,"Richard Zhang, Phillip Isola, Alexei A. Efros",Colorful Image Colorization,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a grayscale photograph as input, this paper attacks the problem of
hallucinating a plausible color version of the photograph. This problem is
clearly underconstrained, so previous approaches have either relied on
significant user interaction or resulted in desaturated colorizations. We
propose a fully automatic approach that produces vibrant and realistic
colorizations. We embrace the underlying uncertainty of the problem by posing
it as a classification task and use class-rebalancing at training time to
increase the diversity of colors in the result. The system is implemented as a
feed-forward pass in a CNN at test time and is trained on over a million color
images. We evaluate our algorithm using a ""colorization Turing test,"" asking
human participants to choose between a generated and ground truth color image.
Our method successfully fools humans on 32% of the trials, significantly higher
than previous methods. Moreover, we show that colorization can be a powerful
pretext task for self-supervised feature learning, acting as a cross-channel
encoder. This approach results in state-of-the-art performance on several
feature learning benchmarks.
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2016 19:58:19 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Aug 2016 04:11:07 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Aug 2016 17:58:58 GMT'}, {'version': 'v4', 'created': 'Fri, 2 Sep 2016 05:06:19 GMT'}, {'version': 'v5', 'created': 'Wed, 5 Oct 2016 18:01:05 GMT'}]",2016-10-06,"[['Zhang', 'Richard', ''], ['Isola', 'Phillip', ''], ['Efros', 'Alexei A.', '']]","['Colorization', 'Vision for Graphics', 'CNNs', 'Self-supervisedlearning']"
13691,1307.1827,Sivan Sabato,Daniel Hsu and Sivan Sabato,Loss minimization and parameter estimation with heavy tails,Final version as published in JMLR,"Journal of Machine Learning Research, 17(18):1--40, 2016",,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work studies applications and generalizations of a simple estimation
technique that provides exponential concentration under heavy-tailed
distributions, assuming only bounded low-order moments. We show that the
technique can be used for approximate minimization of smooth and strongly
convex losses, and specifically for least squares linear regression. For
instance, our $d$-dimensional estimator requires just
$\tilde{O}(d\log(1/\delta))$ random samples to obtain a constant factor
approximation to the optimal least squares loss with probability $1-\delta$,
without requiring the covariates or noise to be bounded or subgaussian. We
provide further applications to sparse linear regression and low-rank
covariance matrix estimation with similar allowances on the noise and covariate
distributions. The core technique is a generalization of the median-of-means
estimator to arbitrary metric spaces.
","[{'version': 'v1', 'created': 'Sun, 7 Jul 2013 01:38:16 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Aug 2013 19:48:02 GMT'}, {'version': 'v3', 'created': 'Fri, 9 Aug 2013 16:50:15 GMT'}, {'version': 'v4', 'created': 'Tue, 5 Nov 2013 16:32:14 GMT'}, {'version': 'v5', 'created': 'Fri, 28 Feb 2014 02:57:37 GMT'}, {'version': 'v6', 'created': 'Tue, 8 Jul 2014 19:55:25 GMT'}, {'version': 'v7', 'created': 'Mon, 18 Apr 2016 09:05:38 GMT'}]",2016-04-19,"[['Hsu', 'Daniel', ''], ['Sabato', 'Sivan', '']]","['Heavy-tailed distributions', 'unbounded losses', 'linear regression', 'least squares']"
13692,1005.0213,Olivier Teste,"Franck Ravat (IRIT), Olivier Teste (IRIT), Gilles Zurfluh (IRIT)",Alg\`ebre OLAP et langage graphique,,"Congr\`es Informatique des Organisations et Syst\`emes
  d'Information et de D\'ecision - INFORSID'06, Hammamet : Tunisie (2006)",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article deals with OLAP systems based on multidimensional model. The
conceptual model we provide, represents data through a constellation
(multi-facts) composed of several multi-hierarchy dimensions. In this model,
data are displayed through multidimensional tables. We define a query algebra
handling these tables. This user oriented algebra is composed of a closure core
of OLAP operators as soon as advanced operators dedicated to complex analysis.
Finally, we specify a graphical OLAP language based on this algebra. This
language facilitates analyses of decision makers.
","[{'version': 'v1', 'created': 'Mon, 3 May 2010 07:43:25 GMT'}]",2010-05-20,"[['Ravat', 'Franck', '', 'IRIT'], ['Teste', 'Olivier', '', 'IRIT'], ['Zurfluh', 'Gilles', '', 'IRIT']]","['OLAP', 'multidimensional algebra', 'graphical language']"
13693,1004.2364,DaoShun Wang,"Daoshun Wang, Lin Dong, Xiaobo Li",Towards Shift Tolerant Visual Secret Sharing Schemes,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In (k, n) visual secret sharing (VSS) scheme, secret image can be visually
reconstructed when k or more participants printing theirs shares on
transparencies and stack them together. No secret is revealed with fewer than k
shares. The alignment of the transparencies is important to the visual quality
of the reconstructed secret image. In VSS scheme, each pixel of the original
secret image is expanded to m sub-pixels in a share image. If a share image is
printed on paper with the same size as the original secret image, the alignment
or the registration of the sub-pixels, which is only m times smaller than that
in the original secret, could be troublesome. Liu et al. [4] has noticed this
alignment problem and observed that some information of the secret image may
still be revealed even when the shares are not precisely registered in the
horizontal direction. Yang et al. [9] introduced a general approach to
construct a misalignment tolerant (k, n)-VSS scheme using big and small blocks
for the situation where the original secret image has a certain degree of
redundancy in shape accuracy. In this paper, we propose a (2, n)-VSS scheme
that allows a relative shift between the shares in the horizontal direction and
vertical direction. When the shares are perfectly aligned, the contrast of the
reconstructed image is equal to that of traditional VSS shceme. When there is a
shift, average contrast in the reconstructed image is higher than that of the
traditional VSS scheme, and the scheme can still work in the cases where very
little shape redundancy presents in the image. The trade-off is that our method
involves a larger pixel expansion. The basic building block of our scheme is
duplication and concatenation of certain rows or columns of the basic matrices.
This seemingly simple but very powerful construction principle can be easily
used to create more general (k, n)-VSS schemes.
","[{'version': 'v1', 'created': 'Wed, 14 Apr 2010 09:45:10 GMT'}]",2010-04-15,"[['Wang', 'Daoshun', ''], ['Dong', 'Lin', ''], ['Li', 'Xiaobo', '']]","['Visual secret sharing', 'pixel expansion', 'share alignment', 'registration']"
13694,1505.07630,Alexey Lastovetsky,"Amani AlOnazi, David Keyes, Alexey Lastovetsky, Vladimir Rychkov","Design and Optimization of OpenFOAM-based CFD Applications for Hybrid
  and Heterogeneous HPC Platforms","Presented at ParCFD 2014, prepared for submission to Computer and
  Fluids. 12 pages, 9 figures, 2 tables",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hardware-aware design and optimization is crucial in exploiting emerging
architectures for PDE-based computational fluid dynamics applications. In this
work, we study optimizations aimed at acceleration of OpenFOAM-based
applications on emerging hybrid heterogeneous platforms. OpenFOAM uses MPI to
provide parallel multi-processor functionality, which scales well on
homogeneous systems but does not fully utilize the potential per-node
performance on hybrid heterogeneous platforms. In our study, we use two
OpenFOAM applications, icoFoam and laplacianFoam, both based on Krylov
iterative methods. We propose a number of optimizations of the dominant kernel
of the Krylov solver, aimed at acceleration of the overall execution of the
applications on modern GPU-accelerated heterogeneous platforms. Experimental
results show that the proposed hybrid implementation significantly outperforms
the state-of-the-art implementation.
","[{'version': 'v1', 'created': 'Thu, 28 May 2015 10:24:35 GMT'}]",2015-05-29,"[['AlOnazi', 'Amani', ''], ['Keyes', 'David', ''], ['Lastovetsky', 'Alexey', ''], ['Rychkov', 'Vladimir', '']]","['hybrid multi-GPU multicore solver', 'conjugate gradient', 'OpenFOAM']"
13695,1401.6070,Adrian Dumitrescu,Adrian Dumitrescu and Anirban Ghosh and Csaba D. T\'oth,On Fence Patrolling by Mobile Agents,"13 pages, 6 figures",,,,cs.DS cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Suppose that a fence needs to be protected (perpetually) by $k$ mobile agents
with maximum speeds $v_1,\ldots,v_k$ so that no point on the fence is left
unattended for more than a given amount of time. The problem is to determine if
this requirement can be met, and if so, to design a suitable patrolling
schedule for the agents. Alternatively, one would like to find a schedule that
minimizes the \emph{idle time}, that is, the longest time interval during which
some point is not visited by any agent. We revisit this problem, introduced by
Czyzowicz et al.(2011), and discuss several strategies for the cases where the
fence is an open and a closed curve, respectively.
  In particular: (i) we disprove a conjecture by Czyzowicz et al. regarding the
optimality of their Algorithm ${\mathcal A_2}$ for unidirectional patrolling of
a closed fence; (ii) we present an algorithm with a lower idle time for
patrolling an open fence, improving an earlier result of Kawamura and
Kobayashi.
","[{'version': 'v1', 'created': 'Thu, 23 Jan 2014 17:56:52 GMT'}]",2014-01-25,"[['Dumitrescu', 'Adrian', ''], ['Ghosh', 'Anirban', ''], ['Tóth', 'Csaba D.', '']]","['mobile agents', 'fence patrolling', 'idle time', 'approximation algorithm']"
13696,1607.02705,Charmgil Hong,"Charmgil Hong, Rumi Ghosh, Soundar Srinivasan",Dealing with Class Imbalance using Thresholding,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose thresholding as an approach to deal with class imbalance. We
define the concept of thresholding as a process of determining a decision
boundary in the presence of a tunable parameter. The threshold is the maximum
value of this tunable parameter where the conditions of a certain decision are
satisfied. We show that thresholding is applicable not only for linear
classifiers but also for non-linear classifiers. We show that this is the
implicit assumption for many approaches to deal with class imbalance in linear
classifiers. We then extend this paradigm beyond linear classification and show
how non-linear classification can be dealt with under this umbrella framework
of thresholding. The proposed method can be used for outlier detection in many
real-life scenarios like in manufacturing. In advanced manufacturing units,
where the manufacturing process has matured over time, the number of instances
(or parts) of the product that need to be rejected (based on a strict regime of
quality tests) becomes relatively rare and are defined as outliers. How to
detect these rare parts or outliers beforehand? How to detect combination of
conditions leading to these outliers? These are the questions motivating our
research. This paper focuses on prediction of outliers and conditions leading
to outliers using classification. We address the problem of outlier detection
using classification. The classes are good parts (those passing the quality
tests) and bad parts (those failing the quality tests and can be considered as
outliers). The rarity of outliers transforms this problem into a
class-imbalanced classification problem.
","[{'version': 'v1', 'created': 'Sun, 10 Jul 2016 07:34:27 GMT'}]",2016-07-12,"[['Hong', 'Charmgil', ''], ['Ghosh', 'Rumi', ''], ['Srinivasan', 'Soundar', '']]","['scrap detection', 'class imbalance', 'decision trees', 'classification']"
13697,1301.2476,Federica Panella,"Federica Panella, Matteo Pradella, Dino Mandrioli and Violetta Lonati",Operator Precedence \omega-languages,"38 pages. Added new proofs regarding the relationships among classes
  of Operator precedence \omega-languages and their closure properties",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  \omega-languages are becoming more and more relevant nowadays when most
applications are 'ever-running'. Recent literature, mainly under the motivation
of widening the application of model checking techniques, extended the analysis
of these languages from the simple regular ones to various classes of languages
with 'visible syntax structure', such as visibly pushdown languages (VPLs).
Operator precedence languages (OPLs), instead, were originally defined to
support deterministic parsing and, though seemingly unrelated, exhibit
interesting relations with these classes of languages: OPLs strictly include
VPLs, enjoy all relevant closure properties and have been characterized by a
suitable automata family and a logic notation. In this paper we introduce
operator precedence \omega-languages (\omega OPLs), investigating various
acceptance criteria and their closure properties. Whereas some properties are
natural extensions of those holding for regular languages, others required
novel investigation techniques. Application-oriented examples show the gain in
expressiveness and verifiability offered by \omega OPLs w.r.t. smaller classes.
","[{'version': 'v1', 'created': 'Fri, 11 Jan 2013 12:29:58 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Jul 2013 10:52:39 GMT'}]",2013-07-03,"[['Panella', 'Federica', ''], ['Pradella', 'Matteo', ''], ['Mandrioli', 'Dino', ''], ['Lonati', 'Violetta', '']]","['ω-languages', 'Operator precedence languages', 'Push-down automata', 'Closure properties', 'Infinite-state model checking']"
13698,1511.06297,Emmanuel Bengio,"Emmanuel Bengio, Pierre-Luc Bacon, Joelle Pineau and Doina Precup",Conditional Computation in Neural Networks for faster models,"ICLR 2016 submission, revised",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning has become the state-of-art tool in many applications, but the
evaluation and training of deep models can be time-consuming and
computationally expensive. The conditional computation approach has been
proposed to tackle this problem (Bengio et al., 2013; Davis & Arel, 2013). It
operates by selectively activating only parts of the network at a time. In this
paper, we use reinforcement learning as a tool to optimize conditional
computation policies. More specifically, we cast the problem of learning
activation-dependent policies for dropping out blocks of units as a
reinforcement learning problem. We propose a learning scheme motivated by
computation speed, capturing the idea of wanting to have parsimonious
activations while maintaining prediction accuracy. We apply a policy gradient
algorithm for learning policies that optimize this loss function and propose a
regularization mechanism that encourages diversification of the dropout policy.
We present encouraging empirical results showing that this approach improves
the speed of computation without impacting the quality of the approximation.
","[{'version': 'v1', 'created': 'Thu, 19 Nov 2015 18:40:22 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jan 2016 22:41:10 GMT'}]",2016-01-11,"[['Bengio', 'Emmanuel', ''], ['Bacon', 'Pierre-Luc', ''], ['Pineau', 'Joelle', ''], ['Precup', 'Doina', '']]","['Neural Networks', 'Conditional Computing', 'REINFORCE']"
13699,1401.2911,Raju Dara,"Raju Dara, Dr.Ch. Satyanarayana, Dr.A.Govardhan","Front End Data Cleaning And Transformation In Standard Printed Form
  Using Neural Models","11 pages, 13 figures, International Journal on Computational Sciences
  & Applications (IJCSA) Vol.3, No.6, December 2013",,,,cs.DB,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Front end of data collection and loading into database manually may cause
potential errors in data sets and a very time consuming process. Scanning of a
data document in the form of an image and recognition of corresponding
information in that image can be considered as a possible solution of this
challenge. This paper presents an automated solution for the problem of data
cleansing and recognition of user written data to transform into standard
printed format with the help of artificial neural networks. Three different
neural models namely direct, correlation based and hierarchical have been
developed to handle this issue. In a very hostile input environment, the
solution is developed to justify the proposed logic.
","[{'version': 'v1', 'created': 'Thu, 9 Jan 2014 13:55:29 GMT'}]",2014-01-14,"[['Dara', 'Raju', ''], ['Satyanarayana', 'Dr. Ch.', ''], ['Govardhan', 'Dr. A.', '']]","['Data cleaning', 'Data transformation', 'Artificial neural networks.  1']"
13700,1401.0987,Chi Jin,"Chi Jin, Ziteng Wang, Junliang Huang, Yiqiao Zhong, Liwei Wang","Differentially Private Data Releasing for Smooth Queries with Synthetic
  Database Output",,,,,cs.DB stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider accurately answering smooth queries while preserving differential
privacy. A query is said to be $K$-smooth if it is specified by a function
defined on $[-1,1]^d$ whose partial derivatives up to order $K$ are all
bounded. We develop an $\epsilon$-differentially private mechanism for the
class of $K$-smooth queries. The major advantage of the algorithm is that it
outputs a synthetic database. In real applications, a synthetic database output
is appealing. Our mechanism achieves an accuracy of $O
(n^{-\frac{K}{2d+K}}/\epsilon )$, and runs in polynomial time. We also
generalize the mechanism to preserve $(\epsilon, \delta)$-differential privacy
with slightly improved accuracy. Extensive experiments on benchmark datasets
demonstrate that the mechanisms have good accuracy and are efficient.
","[{'version': 'v1', 'created': 'Mon, 6 Jan 2014 05:12:01 GMT'}]",2014-01-07,"[['Jin', 'Chi', ''], ['Wang', 'Ziteng', ''], ['Huang', 'Junliang', ''], ['Zhong', 'Yiqiao', ''], ['Wang', 'Liwei', '']]","['Differential privacy', 'smooth queries', 'synthetic database']"
13701,1003.1499,Rdv Ijcsis,Mofreh A. Hogo,"Evaluation of E-Learners Behaviour using Different Fuzzy Clustering
  Models: A Comparative Study","Pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS, Vol. 7 No. 2, February 2010, USA. ISSN 1947
  5500, http://sites.google.com/site/ijcsis/",,,,cs.CY cs.LG,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper introduces an evaluation methodologies for the e-learners'
behaviour that will be a feedback to the decision makers in e-learning system.
Learner's profile plays a crucial role in the evaluation process to improve the
e-learning process performance. The work focuses on the clustering of the
e-learners based on their behaviour into specific categories that represent the
learner's profiles. The learners' classes named as regular, workers, casual,
bad, and absent. The work may answer the question of how to return bad students
to be regular ones. The work presented the use of different fuzzy clustering
techniques as fuzzy c-means and kernelized fuzzy c-means to find the learners'
categories and predict their profiles. The paper presents the main phases as
data description, preparation, features selection, and the experiments design
using different fuzzy clustering models. Analysis of the obtained results and
comparison with the real world behavior of those learners proved that there is
a match with percentage of 78%. Fuzzy clustering reflects the learners'
behavior more than crisp clustering. Comparison between FCM and KFCM proved
that the KFCM is much better than FCM in predicting the learners' behaviour.
","[{'version': 'v1', 'created': 'Sun, 7 Mar 2010 17:36:26 GMT'}]",2010-03-09,"[['Hogo', 'Mofreh A.', '']]","['E-Learning', 'Learner Profile', 'Fuzzy C-Means Clustering', 'Kernelized FCM']"
13702,1407.0466,Tingshao Zhu,"Li Guan, Bibo Hao, and Tingshao Zhu","How did the Suicide Act and Speak Differently Online? Behavioral and
  Linguistic Features of China's Suicide Microblog Users","17 pages, 5 tables",,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Suicide issue is of great concern in China. Social media provides
an active approach to understanding suicide individuals in terms of their
behavior and language use. Aims: This study investigates how suicide Microblog
users in China act and speak differently on social media from others. Methods:
Hypothesis testing in behavioral and linguistic features was performed between
a target group of 33 Chinese Microblog users who have committed suicide and a
control group of 30 active users without suicidal ideation. Results: Suicide
group significantly outnumbered control group in the extent of openly published
posts and self-reference, and the intensity of using 7 word categories:
negative words/social process words/cognitive process words/emotion process
words/negative emotion words/exclusive words/physiological process words.
Limitations: Information collection and confirmation of suicide users remain
difficult. Conclusions: It is revealed that suicide people vary from others in
certain behavioral and linguistic features in social media. This study fills
the niche of suicide studies by noting specified indicators of suicide ideation
for Chinese individuals online, providing insights of constructing an online
alarm system for early detection and intervention of suicidal individuals.
","[{'version': 'v1', 'created': 'Wed, 2 Jul 2014 06:49:11 GMT'}]",2014-07-03,"[['Guan', 'Li', ''], ['Hao', 'Bibo', ''], ['Zhu', 'Tingshao', '']]","['Microblog', 'Chinese', 'online behavior', 'text analysis', 'social media']"
13703,1707.08361,Lucia Vadicamo,"Richard Connor, Lucia Vadicamo, Franco Alberto Cardillo, Fausto
  Rabitti",Supermetric Search,,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Metric search is concerned with the efficient evaluation of queries in metric
spaces. In general,a large space of objects is arranged in such a way that,
when a further object is presented as a query, those objects most similar to
the query can be efficiently found. Most mechanisms rely upon the triangle
inequality property of the metric governing the space. The triangle inequality
property is equivalent to a finite embedding property, which states that any
three points of the space can be isometrically embedded in two-dimensional
Euclidean space. In this paper, we examine a class of semimetric space which is
finitely four-embeddable in three-dimensional Euclidean space. In mathematics
this property has been extensively studied and is generally known as the
four-point property. All spaces with the four-point property are metric spaces,
but they also have some stronger geometric guarantees. We coin the term
supermetric space as, in terms of metric search, they are significantly more
tractable. Supermetric spaces include all those governed by Euclidean, Cosine,
Jensen-Shannon and Triangular distances, and are thus commonly used within many
domains. In previous work we have given a generic mathematical basis for the
supermetric property and shown how it can improve indexing performance for a
given exact search structure. Here we present a full investigation into its use
within a variety of different hyperplane partition indexing structures, and go
on to show some more of its flexibility by examining a search structure whose
partition and exclusion conditions are tailored, at each node, to suit the
individual reference points and data set present there. Among the results
given, we show a new best performance for exact search using a well-known
benchmark.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 10:32:21 GMT'}, {'version': 'v2', 'created': 'Sun, 22 Oct 2017 16:46:24 GMT'}]",2017-10-24,"[['Connor', 'Richard', ''], ['Vadicamo', 'Lucia', ''], ['Cardillo', 'Franco Alberto', ''], ['Rabitti', 'Fausto', '']]","['Similarity Search', 'Metric Space', 'Supermetric Space', 'MetricIndexing', 'Four-point Property', 'Hilbert Exclusion']"
13704,0705.1457,Jerome Darmont,"Sami Miniaoui (ERIC), J\'er\^ome Darmont (ERIC), Omar Boussa\""id
  (ERIC)",Web data modeling for integration in data warehouses,,"First International Workshop on Multimedia Data and Document
  Engineering (MDDE 01) (07/2001) 88-97",,,cs.DB,,"  In a data warehousing process, the data preparation phase is crucial.
Mastering this phase allows substantial gains in terms of time and performance
when performing a multidimensional analysis or using data mining algorithms.
Furthermore, a data warehouse can require external data. The web is a prevalent
data source in this context, but the data broadcasted on this medium are very
heterogeneous. We propose in this paper a UML conceptual model for a complex
object representing a superclass of any useful data source (databases, plain
texts, HTML and XML documents, images, sounds, video clips...). The translation
into a logical model is achieved with XML, which helps integrating all these
diverse, heterogeneous data into a unified format, and whose schema definition
provides first-rate metadata in our data warehousing context. Moreover, we
benefit from XML's flexibility, extensibility and from the richness of the
semi-structured data model, but we are still able to later map XML documents
into a database if more structuring is needed.
","[{'version': 'v1', 'created': 'Thu, 10 May 2007 12:30:19 GMT'}]",2007-05-23,"[['Miniaoui', 'Sami', '', 'ERIC'], ['Darmont', 'Jérôme', '', 'ERIC'], ['Boussaïd', 'Omar', '', 'ERIC']]","['Multiform data', 'Data warehousing', 'Integration', 'Modeling']"
13705,1306.4966,Rui Hu,Rui Hu and Stephen M. Watt,Determining Points on Handwritten Mathematical Symbols,"16 pages; 19 figures; Conferences on Intelligent Computer Mathematics
  (CICM2013), July 8-12, 2013, University of Bath, Bath, UK",,,,cs.CV cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a variety of applications, such as handwritten mathematics and diagram
labelling, it is common to have symbols of many different sizes in use and for
the writing not to follow simple baselines. In order to understand the scale
and relative positioning of individual characters, it is necessary to identify
the location of certain expected features. These are typically identified by
particular points in the symbols, for example, the baseline of a lower case ""p""
would be identified by the lowest part of the bowl, ignoring the descender. We
investigate how to find these special points automatically so they may be used
in a number of problems, such as improving two-dimensional mathematical
recognition and in handwriting neatening, while preserving the original style.
","[{'version': 'v1', 'created': 'Thu, 20 Jun 2013 19:38:07 GMT'}]",2013-06-21,"[['Hu', 'Rui', ''], ['Watt', 'Stephen M.', '']]","['Handwriting analysis', 'Handwriting neatening', 'Mathematical handwriting recognition', 'Pen computing']"
13706,1002.4569,Vincent Verneuil,"Christophe Giraud, Vincent Verneuil (INRIA Bordeaux - Sud-Ouest)",Atomicity Improvement for Elliptic Curve Scalar Multiplication,,"CARDIS 2010, Passau : Germany (2010)",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we address the problem of protecting elliptic curve scalar
multiplication implementations against side-channel analysis by using the
atomicity principle. First of all we reexamine classical assumptions made by
scalar multiplication designers and we point out that some of them are not
relevant in the context of embedded devices. We then describe the
state-of-the-art of atomic scalar multiplication and propose an atomic pattern
improvement method. Compared to the most efficient atomic scalar multiplication
published so far, our technique shows an average improvement of up to 10.6%.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2010 15:59:26 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Mar 2010 13:39:29 GMT'}]",2016-12-09,"[['Giraud', 'Christophe', '', 'INRIA Bordeaux - Sud-Ouest'], ['Verneuil', 'Vincent', '', 'INRIA Bordeaux - Sud-Ouest']]","['Elliptic Curves', 'Scalar Multiplication', 'Atomicity', 'Side-Channel Analysis']"
13707,1712.04382,Michael Freitag,"Michael Freitag, Shahin Amiriparian, Sergey Pugachevskiy, Nicholas
  Cummins, Bj\""orn Schuller","auDeep: Unsupervised Learning of Representations from Audio with Deep
  Recurrent Neural Networks",,,,,cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  auDeep is a Python toolkit for deep unsupervised representation learning from
acoustic data. It is based on a recurrent sequence to sequence autoencoder
approach which can learn representations of time series data by taking into
account their temporal dynamics. We provide an extensive command line interface
in addition to a Python API for users and developers, both of which are
comprehensively documented and publicly available at
https://github.com/auDeep/auDeep. Experimental results indicate that auDeep
features are competitive with state-of-the art audio classification.
","[{'version': 'v1', 'created': 'Tue, 12 Dec 2017 16:43:33 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Dec 2017 17:33:47 GMT'}]",2017-12-25,"[['Freitag', 'Michael', ''], ['Amiriparian', 'Shahin', ''], ['Pugachevskiy', 'Sergey', ''], ['Cummins', 'Nicholas', ''], ['Schuller', 'Björn', '']]","['deep feature learning', 'sequence to sequence learning', 'recurrent neural networks', 'autoencoders', 'audio processing']"
13708,1105.1929,Fabian Suchanek,"Fabian Suchanek (INRIA Saclay - Ile de France), Aparna Varde, Richi
  Nayak (QUT), Pierre Senellart","The Hidden Web, XML and Semantic Web: A Scientific Data Management
  Perspective",EDBT - Tutorial (2011),,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The World Wide Web no longer consists just of HTML pages. Our work sheds
light on a number of trends on the Internet that go beyond simple Web pages.
The hidden Web provides a wealth of data in semi-structured form, accessible
through Web forms and Web services. These services, as well as numerous other
applications on the Web, commonly use XML, the eXtensible Markup Language. XML
has become the lingua franca of the Internet that allows customized markups to
be defined for specific domains. On top of XML, the Semantic Web grows as a
common structured data source. In this work, we first explain each of these
developments in detail. Using real-world examples from scientific domains of
great interest today, we then demonstrate how these new developments can assist
the managing, harvesting, and organization of data on the Web. On the way, we
also illustrate the current research avenues in these domains. We believe that
this effort would help bridge multiple database tracks, thereby attracting
researchers with a view to extend database technology.
","[{'version': 'v1', 'created': 'Tue, 10 May 2011 12:33:41 GMT'}]",2011-05-11,"[['Suchanek', 'Fabian', '', 'INRIA Saclay - Ile de France'], ['Varde', 'Aparna', '', 'QUT'], ['Nayak', 'Richi', '', 'QUT'], ['Senellart', 'Pierre', '']]","['Deep Web', 'Domain-Specific Markup Languages', 'Hidden Web', 'Multidisciplinary work', 'Scientific data', 'Semantic Web', 'XML']"
13709,1511.06954,Tyrone Strangway,"Allan Borodin, Omer Lev, Tyrone Strangway",Budgetary Effects on Pricing Equilibrium in Online Markets,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Following the work of Babaioff et al, we consider the pricing game with
strategic vendors and a single buyer, modeling a scenario in which multiple
competing vendors have very good knowledge of a buyer, as is common in online
markets. We add to this model the realistic assumption that the buyer has a
fixed budget and does not have unlimited funds. When the buyer's valuation
function is additive, we are able to completely characterize the different
possible pure Nash Equilibria (PNE) and in particular obtain a necessary and
sufficient condition for uniqueness. Furthermore, we characterize the market
clearing (or Walresian) equilibria for all submodular valuations.
  Surprisingly, for certain monotone submodular function valuations, we show
that the pure NE can exhibit some counterintuitive phenomena; namely, there is
a valuation such that the pricing will be market clearing and within budget if
the buyer does not reveal the budget but will result in a smaller set of
allocated items (and higher prices for items) if the buyer does reveal the
budget. It is also the case that the conditions that guarantee market clearing
in Babaioff et al for submodular functions are not necessarily market clearing
when there is a budget. Furthermore, with respect to social welfare, while
without budgets all equilibria are optimal (i.e. POA = POS = 1), we show that
with budgets the worst equilibrium may only achieve 1/(n-2) of the best
equilibrium.
","[{'version': 'v1', 'created': 'Sun, 22 Nov 2015 03:03:23 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Feb 2016 00:54:11 GMT'}]",2016-02-10,"[['Borodin', 'Allan', ''], ['Lev', 'Omer', ''], ['Strangway', 'Tyrone', '']]","['pricing', 'price of anarchy', 'budget', 'Nash equilibrium']"
13710,1705.08943,Clement Zotti,"Clement Zotti, Zhiming Luo, Alain Lalande, Olivier Humbert,
  Pierre-Marc Jodoin","GridNet with automatic shape prior registration for automatic MRI
  cardiac segmentation","8 pages, 1 tables, 2 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a fully automatic MRI cardiac segmentation method
based on a novel deep convolutional neural network (CNN) designed for the 2017
ACDC MICCAI challenge. The novelty of our network comes with its embedded shape
prior and its loss function tailored to the cardiac anatomy. Our model includes
a cardiac centerof-mass regression module which allows for an automatic shape
prior registration. Also, since our method processes raw MR images without any
manual preprocessing and/or image cropping, our CNN learns both high-level
features (useful to distinguish the heart from other organs with a similar
shape) and low-level features (useful to get accurate segmentation results).
Those features are learned with a multi-resolution conv-deconv ""grid""
architecture which can be seen as an extension of the U-Net. Experimental
results reveal that our method can segment the left and right ventricles as
well as the myocardium from a 3D MRI cardiac volume in 0.4 second with an
average Dice coefficient of 0.90 and an average Hausdorff distance of 10.4 mm.
","[{'version': 'v1', 'created': 'Wed, 24 May 2017 19:44:45 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Sep 2017 19:48:38 GMT'}]",2017-09-14,"[['Zotti', 'Clement', ''], ['Luo', 'Zhiming', ''], ['Lalande', 'Alain', ''], ['Humbert', 'Olivier', ''], ['Jodoin', 'Pierre-Marc', '']]","['Convolutional neural networks', 'MRI', 'Heart', 'segmentation']"
13711,1802.07119,Behrouz Bolourian Haghighi,"Behrouz Bolourian Haghighi, Amir Hossein Taherinia, Reza Monsefi","TRLF: An Effective Semi-fragile Watermarking Method for Tamper Detection
  and Recovery based on LWT and FNN",,,,,cs.CR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a novel method for tamper detection and recovery using
semi-fragile data hiding, based on Lifting Wavelet Transform (LWT) and
Feed-Forward Neural Network (FNN). In TRLF, first, the host image is decomposed
up to one level using LWT, and the Discrete Cosine Transform (DCT) is applied
to each 2*2 blocks of diagonal details. Next, a random binary sequence is
embedded in each block as the watermark by correlating $DC$ coefficients. In
authentication stage, first, the watermarked image geometry is reconstructed by
using Speeded Up Robust Features (SURF) algorithm and extract watermark bits by
using FNN. Afterward, logical exclusive-or operation between original and
extracted watermark is applied to detect tampered region. Eventually, in the
recovery stage, tampered regions are recovered by image digest which is
generated by inverse halftoning technique. The performance and efficiency of
TRLF and its robustness against various geometric, non-geometric and hybrid
attacks are reported. From the experimental results, it can be seen that TRLF
is superior in terms of robustness and quality of the digest and watermarked
image respectively, compared to the-state-of-the-art fragile and semi-fragile
watermarking methods. In addition, imperceptibility has been improved by using
different correlation steps as the gain factor for flat (smooth) and texture
(rough) blocks.
","[{'version': 'v1', 'created': 'Sun, 18 Feb 2018 18:36:35 GMT'}]",2018-02-21,"[['Haghighi', 'Behrouz Bolourian', ''], ['Taherinia', 'Amir Hossein', ''], ['Monsefi', 'Reza', '']]","['Watermarking', 'Tamper Detection and Recovery', 'Image Authentication', 'Lifting Wavelet Transform', 'HalftoneTechnique', 'Feed-Forward Neural Network']"
13712,1407.6126,Georg Nawratil,Georg Nawratil and Josef Schicho,Self-motions of pentapods with linear platform,"28 pages, 5 figures",,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give a full classification of all pentapods with linear platform
possessing a self-motion beside the trivial rotation about the platform. Recent
research necessitates a contemporary and accurate re-examination of old results
on this topic given by Darboux, Mannheim, Duporcq and Bricard, which also takes
the coincidence of platform anchor points into account. For our study we use
bond theory with respect to a novel kinematic mapping for pentapods with linear
platform, beside the method of singular-invariant leg-rearrangements. Based on
our results we design pentapods with linear platform, which have a simplified
direct kinematics concerning their number of (real) solutions.
","[{'version': 'v1', 'created': 'Wed, 23 Jul 2014 08:09:06 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Apr 2015 07:19:49 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Sep 2015 09:40:04 GMT'}, {'version': 'v4', 'created': 'Fri, 16 Oct 2015 10:56:54 GMT'}]",2015-10-19,"[['Nawratil', 'Georg', ''], ['Schicho', 'Josef', '']]","['Pentapod', 'Borel Bricard Problem', 'Bond Theory', 'Self-Motion', 'Direct Kinematic', 'Kinematic Mapping']"
13713,1702.06017,Rahul Savani,"John Fearnley, Spencer Gordon, Ruta Mehta, Rahul Savani",CLS: New Problems and Completeness,,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The complexity class CLS was introduced by Daskalakis and Papadimitriou with
the goal of capturing the complexity of some well-known problems in
PPAD$~\cap~$PLS that have resisted, in some cases for decades, attempts to put
them in polynomial time. No complete problem was known for CLS, and in previous
work, the problems ContractionMap, i.e., the problem of finding an approximate
fixpoint of a contraction map, and PLCP, i.e., the problem of solving a
P-matrix Linear Complementarity Problem, were identified as prime candidates.
  First, we present a new CLS-complete problem MetaMetricContractionMap, which
is closely related to the ContractionMap. Second, we introduce
EndOfPotentialLine, which captures aspects of PPAD and PLS directly via a
monotonic directed path, and show that EndOfPotentialLine is in CLS via a
two-way reduction to EndOfMeteredLine. The latter was defined to keep track of
how far a vertex is on the PPAD path via a restricted potential function.
Third, we reduce PLCP to EndOfPotentialLine, thus making EndOfPotentialLine and
EndOfMeteredLine at least as likely to be hard for CLS as PLCP. This last
result leverages the monotonic structure of Lemke paths for PLCP problems,
making EndOfPotentialLine a likely candidate to capture the exact complexity of
PLCP; we note that the structure of Lemke-Howson paths for finding a Nash
equilibrium in a two-player game very directly motivated the definition of the
complexity class PPAD, which eventually ended up capturing this problem's
complexity exactly.
","[{'version': 'v1', 'created': 'Mon, 20 Feb 2017 15:39:13 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Apr 2017 15:55:54 GMT'}]",2017-04-10,"[['Fearnley', 'John', ''], ['Gordon', 'Spencer', ''], ['Mehta', 'Ruta', ''], ['Savani', 'Rahul', '']]","['CLS', 'PPAD', 'PLS', 'Contraction Map', 'P-matrix LCP']"
13714,1512.00665,Weidong Wang,"Weidong Wang, Chunhua Liao, Liqiang Wang, Daniel J. Quinlan, Wei Lu","HBTM: A Heartbeat-based Behavior Detection Mechanism for POSIX Threads
  and OpenMP Applications","7 pages, 7 figures",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Extreme-scale computing involves hundreds of millions of threads with
multi-level parallelism running on large-scale hierarchical and heterogeneous
hardware. In POSIX threads and OpenMP applications, some key behaviors
occurring in runtime such as thread failure, busy waiting, and exit need to be
accurately and timely detected. However, for the most of these applications,
there are lack of unified and efficient detection mechanisms to do this. In
this paper, a heartbeat-based behavior detection mechanism for POSIX threads
(Pthreads) and OpenMP applications (HBTM) is proposed. In the design, two types
of implementations are conducted, centralized and decentralized respectively.
In both implementations, unified API has been designed to guarantee the
generality of the mechanism. Meanwhile, a ring-based detection algorithm is
designed to ease the burden of the centra thread at runtime. To evaluate the
mechanism, the NAS Parallel Benchmarks (NPB) are used to test the performance
of the HBTM. The experimental results show that the HBTM supports detection of
behaviors of POSIX threads and OpenMP applications while acquiring a short
latency and near 1% overhead.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2015 12:24:06 GMT'}]",2015-12-03,"[['Wang', 'Weidong', ''], ['Liao', 'Chunhua', ''], ['Wang', 'Liqiang', ''], ['Quinlan', 'Daniel J.', ''], ['Lu', 'Wei', '']]","['Decentralized', 'heartbeat', 'OpenMP', 'behavior detection']"
13715,1004.3571,Vishal Goyal,"Vikas Gupta, K.S.Kasana, Puneet Tandon",Computer Aided Design Modeling for Heterogeneous Objects,"International Journal of Computer Science Issues online at
  http://ijcsi.org/articles/Computer-Aided-Design-Modeling-for-Heterogeneous-Objects.php","IJCSI, Volume 7, Issue 2, March 2010",,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Heterogeneous object design is an active research area in recent years. The
conventional CAD modeling approaches only provide geometry and topology of the
object, but do not contain any information with regard to the materials of the
object and so can not be used for the fabrication of heterogeneous objects (HO)
through rapid prototyping. Current research focuses on computer-aided design
issues in heterogeneous object design. A new CAD modeling approach is proposed
to integrate the material information into geometric regions thus model the
material distributions in the heterogeneous object. The gradient references are
used to represent the complex geometry heterogeneous objects which have
simultaneous geometry intricacies and accurate material distributions. The
gradient references helps in flexible manipulability and control to
heterogeneous objects, which guarantees the local control over gradient regions
of developed heterogeneous objects. A systematic approach on data flow,
processing, computer visualization, and slicing of heterogeneous objects for
rapid prototyping is also presented.
","[{'version': 'v1', 'created': 'Tue, 20 Apr 2010 20:42:34 GMT'}]",2010-04-22,"[['Gupta', 'Vikas', ''], ['Kasana', 'K. S.', ''], ['Tandon', 'Puneet', '']]","['HO', 'Gradient Reference', 'Visualization', 'Slicing', 'Rapid Prototyping']"
13716,1501.05392,Victor Pan,"Victor Y. Pan, Elias P. Tsigaridas, Vitaly Zaderman, and Liang Zhao","Accelerated Approximation of the Complex Roots and Factors of a
  Univariate Polynomial",16 pages,,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The algorithms of Pan (1995) and(2002) approximate the roots of a complex
univariate polynomial in nearly optimal arithmetic and Boolean time but require
precision of computing that exceeds the degree of the polynomial. This causes
numerical stability problems when the degree is large. We observe, however,
that such a difficulty disappears at the initial stage of the algorithms, and
in our present paper we extend this stage to root-finding within a nearly
optimal arithmetic and Boolean complexity bounds provided that some mild
initial isolation of the roots of the input polynomial has been ensured.
Furthermore our algorithm is nearly optimal for the approximation of the roots
isolated in a fixed disc, square or another region on the complex plane rather
than all complex roots of a polynomial. Moreover the algorithm can be applied
to a polynomial given by a black box for its evaluation (even if its
coefficients are not known); it promises to be of practical value for
polynomial root-finding and factorization, the latter task being of interest on
its own right. We also provide a new support for a winding number algorithm,
which enables extension of our progress to obtaining mild initial
approximations to the roots. We conclude with summarizing our algorithms and
their extension to the approximation of isolated multiple roots and root
clusters.
","[{'version': 'v1', 'created': 'Thu, 22 Jan 2015 04:39:26 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Aug 2015 04:07:42 GMT'}, {'version': 'v3', 'created': 'Wed, 9 Nov 2016 04:45:07 GMT'}]",2016-11-10,"[['Pan', 'Victor Y.', ''], ['Tsigaridas', 'Elias P.', ''], ['Zaderman', 'Vitaly', ''], ['Zhao', 'Liang', '']]","['polynomial equation', 'roots', 'root-finding', 'root-refinement', 'power sums', 'winding number', 'complexity']"
13717,1407.1487,Ananthanarayanan Chockalingam,T. Lakshmi Narasimhan and A. Chockalingam,Precoder Index Modulation,arXiv admin note: substantial text overlap with arXiv:1401.6543,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Index modulation, where information bits are conveyed through antenna indices
(spatial modulation) and subcarrier indices (subcarrier index modulation) in
addition to information bits conveyed through conventional modulation symbols,
is getting increased research attention. In this paper, we introduce {\em
precoder index modulation}, where information bits are conveyed through the
choice of a precoder matrix at the transmitter from a set of pre-determined
pseudo-random phase precoder (PRPP) matrices. Combining precoder index
modulation (PIM) and spatial modulation (SM), we introduce a PIM-SM scheme
which conveys information bits through both antenna index as well as precoder
index. Spectral efficiency (in bits per channel use) and bit error performance
of these index modulation schemes are presented.
","[{'version': 'v1', 'created': 'Sun, 6 Jul 2014 11:51:06 GMT'}]",2014-07-08,"[['Narasimhan', 'T. Lakshmi', ''], ['Chockalingam', 'A.', '']]","['Index modulation', 'spatial modulation', 'pseudorandom phase precoding']"
13718,1401.0379,Pierre Lescanne,"Katarzyna Grygiel, Pierre Lescanne (LIP)",Counting Terms in the Binary Lambda Calculus,,,,,cs.LO cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a paper entitled Binary lambda calculus and combinatory logic, John Tromp
presents a simple way of encoding lambda calculus terms as binary sequences. In
what follows, we study the numbers of binary strings of a given size that
represent lambda terms and derive results from their generating functions,
especially that the number of terms of size n grows roughly like 1.963447954^n.
","[{'version': 'v1', 'created': 'Thu, 2 Jan 2014 07:43:54 GMT'}]",2014-01-03,"[['Grygiel', 'Katarzyna', '', 'LIP'], ['Lescanne', 'Pierre', '', 'LIP']]","['lambda calculus', 'combinatorics', 'functional programming', 'test', 'random generator', 'ranking', 'unranking']"
13719,1712.04263,Ghassan Samara,"Ghassan Samara, Yousef Al-Raba'nah",Security Issues in Vehicular Ad Hoc Networks (VANET): a survey,,"International Journal of Sciences & Applied Research, 2015",,"IJSAR, 2(4), 2015; 50-55",cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vehicular Ad Hoc Networks (VANET) is a technology that has been recently
emerged, and bring a lot of interests. VANET can be used to improve road
safety, reduce road traffic, serve interests of its users, and provide
emergency services. The security is one of the most important issues in VANET,
it is considered a critical point in the development of robust VANET systems.
In this paper, a diverse types of security challenges and requirements of VANET
will be discussed, and a set of possible solutions for VANET security problems
and attacks will be presented and analyzed. Also this paper will propose a new
protocol that is called the reply protocol, this protocol aims to protect VANET
against several attacks.
","[{'version': 'v1', 'created': 'Tue, 12 Dec 2017 12:29:22 GMT'}]",2017-12-13,"[['Samara', 'Ghassan', ''], [""Al-Raba'nah"", 'Yousef', '']]","['Vehicular ad hoc networks', 'security', 'attacks', 'certificate validity', 'mobility  Introduction Rapid developments in wireless']"
13720,1107.3194,Thai Le,Le Hoang Thai and Ha Nhat Tam,Fingerprint recognition using standardized fingerprint model,"7 pages, 16 figures, 3 tables, IJCSI International Journal of
  Computer Science Issues, Vol. 7, Issue 3, No 7, May 2010","IJCSI International Journal of Computer Science Issues, Vol. 7,
  Issue 3, No 7, May 2010, ISSN (Online): 1694-0784, ISSN (Print): 1694-0814",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fingerprint recognition is one of most popular and accuracy Biometric
technologies. Nowadays, it is used in many real applications. However,
recognizing fingerprints in poor quality images is still a very complex
problem. In recent years, many algorithms, models...are given to improve the
accuracy of recognition system. This paper discusses on the standardized
fingerprint model which is used to synthesize the template of fingerprints. In
this model, after pre-processing step, we find the transformation between
templates, adjust parameters, synthesize fingerprint, and reduce noises. Then,
we use the final fingerprint to match with others in FVC2004 fingerprint
database (DB4) to show the capability of the model.
","[{'version': 'v1', 'created': 'Sat, 16 Jul 2011 03:04:22 GMT'}]",2011-07-19,"[['Thai', 'Le Hoang', ''], ['Tam', 'Ha Nhat', '']]","['Biometric systems', 'Fingerprints', 'Standardized fingerprint model', 'synthesize fingerprint']"
13721,0804.2487,"Alexander Sch\""onhuth",Alexander Schoenhuth,"The ergodic decomposition of asymptotically mean stationary random
  sources","Submitted to IEEE Transactions on Information Theory, Apr. 2008",,,,cs.IT math.IT math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is demonstrated how to represent asymptotically mean stationary (AMS)
random sources with values in standard spaces as mixtures of ergodic AMS
sources. This an extension of the well known decomposition of stationary
sources which has facilitated the generalization of prominent source coding
theorems to arbitrary, not necessarily ergodic, stationary sources. Asymptotic
mean stationarity generalizes the definition of stationarity and covers a much
larger variety of real-world examples of random sources of practical interest.
It is sketched how to obtain source coding and related theorems for arbitrary,
not necessarily ergodic, AMS sources, based on the presented ergodic
decomposition.
","[{'version': 'v1', 'created': 'Tue, 15 Apr 2008 20:25:21 GMT'}]",2008-04-17,"[['Schoenhuth', 'Alexander', '']]","['Asymptotic mean stationarity', 'ergodicity', 'ergodic decomposition', 'ergodic theorem', 'source coding', 'stationarity']"
13722,1506.04229,Grigor Iliev,"Elena Karashtranova, Grigor Iliev, Nadezhda Borisova, Yana Chankova,
  Irena Atanasova",Evaluation of the Accuracy of the BGLemmatizer,"5 pages, Sixth International Scientific Conference - FMNS2015",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper reveals the results of an analysis of the accuracy of developed
software for automatic lemmatization for the Bulgarian language. This
lemmatization software is written entirely in Java and is distributed as a GATE
plugin. Certain statistical methods are used to define the accuracy of this
software. The results of the analysis show 95% lemmatization accuracy.
","[{'version': 'v1', 'created': 'Sat, 13 Jun 2015 05:53:57 GMT'}]",2015-06-16,"[['Karashtranova', 'Elena', ''], ['Iliev', 'Grigor', ''], ['Borisova', 'Nadezhda', ''], ['Chankova', 'Yana', ''], ['Atanasova', 'Irena', '']]","['Bulgarian grammar', 'NLP', 'GATE']"
13723,1108.0486,Richard Brent,"Nimalan Nandapalan, Richard P. Brent, Lawrence M. Murray and Alistair
  Rendell","High-Performance Pseudo-Random Number Generation on Graphics Processing
  Units","10 pages, submitted to PPAM 2011 (Torun, Poland, 11-14 Sept. 2011).
  For further information, see http://maths.anu.edu.au/~brent/pub/pub241.html","Lecture Notes in Computer Science, Vol. 7203 (2012), 609-618",,,cs.DC math.NT stat.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work considers the deployment of pseudo-random number generators (PRNGs)
on graphics processing units (GPUs), developing an approach based on the
xorgens generator to rapidly produce pseudo-random numbers of high statistical
quality. The chosen algorithm has configurable state size and period, making it
ideal for tuning to the GPU architecture. We present a comparison of both speed
and statistical quality with other common parallel, GPU-based PRNGs,
demonstrating favourable performance of the xorgens-based approach.
","[{'version': 'v1', 'created': 'Tue, 2 Aug 2011 05:41:44 GMT'}]",2013-03-13,"[['Nandapalan', 'Nimalan', ''], ['Brent', 'Richard P.', ''], ['Murray', 'Lawrence M.', ''], ['Rendell', 'Alistair', '']]","['Pseudo-random number generation', 'graphics processing units', 'Monte Carlo']"
13724,1504.06260,Jorge Perez Heredia,"Tiago Paix\~ao and Jorge P\'erez Heredia and Dirk Sudholt and Barbora
  Trubenov\'a","First Steps Towards a Runtime Comparison of Natural and Artificial
  Evolution",,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evolutionary algorithms (EAs) form a popular optimisation paradigm inspired
by natural evolution. In recent years the field of evolutionary computation has
developed a rigorous analytical theory to analyse their runtime on many
illustrative problems. Here we apply this theory to a simple model of natural
evolution. In the Strong Selection Weak Mutation (SSWM) evolutionary regime the
time between occurrence of new mutations is much longer than the time it takes
for a new beneficial mutation to take over the population. In this situation,
the population only contains copies of one genotype and evolution can be
modelled as a (1+1)-type process where the probability of accepting a new
genotype (improvements or worsenings) depends on the change in fitness.
  We present an initial runtime analysis of SSWM, quantifying its performance
for various parameters and investigating differences to the (1+1)EA. We show
that SSWM can have a moderate advantage over the (1+1)EA at crossing fitness
valleys and study an example where SSWM outperforms the (1+1)EA by taking
advantage of information on the fitness gradient.
","[{'version': 'v1', 'created': 'Thu, 23 Apr 2015 17:13:31 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Oct 2015 12:26:24 GMT'}]",2015-10-02,"[['Paixão', 'Tiago', ''], ['Heredia', 'Jorge Pérez', ''], ['Sudholt', 'Dirk', ''], ['Trubenová', 'Barbora', '']]","['Runtime analysis', 'natural evolution', 'population genetics', 'theory', 'strong selection weak mutation regime']"
13725,0708.3048,Alexandre d'Aspremont,Alexandre d'Aspremont,Identifying Small Mean Reverting Portfolios,,,,,cs.CE,,"  Given multivariate time series, we study the problem of forming portfolios
with maximum mean reversion while constraining the number of assets in these
portfolios. We show that it can be formulated as a sparse canonical correlation
analysis and study various algorithms to solve the corresponding sparse
generalized eigenvalue problems. After discussing penalized parameter
estimation procedures, we study the sparsity versus predictability tradeoff and
the impact of predictability in various markets.
","[{'version': 'v1', 'created': 'Wed, 22 Aug 2007 16:25:17 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Feb 2008 16:29:01 GMT'}]",2008-02-26,"[[""d'Aspremont"", 'Alexandre', '']]","['Mean reversion', 'sparse estimation', 'convergence trading', 'momentum trading', 'covariance selection']"
13726,1510.06535,Uri Zwick,"Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick",Hollow Heaps,"27 pages, 7 figures, preliminary version appeared in ICALP 2015",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the hollow heap, a very simple data structure with the same
amortized efficiency as the classical Fibonacci heap. All heap operations
except delete and delete-min take $O(1)$ time, worst case as well as amortized;
delete and delete-min take $O(\log n)$ amortized time on a heap of $n$ items.
Hollow heaps are by far the simplest structure to achieve this. Hollow heaps
combine two novel ideas: the use of lazy deletion and re-insertion to do
decrease-key operations, and the use of a dag (directed acyclic graph) instead
of a tree or set of trees to represent a heap. Lazy deletion produces hollow
nodes (nodes without items), giving the data structure its name.
","[{'version': 'v1', 'created': 'Thu, 22 Oct 2015 09:09:11 GMT'}]",2015-10-23,"[['Hansen', 'Thomas Dueholm', ''], ['Kaplan', 'Haim', ''], ['Tarjan', 'Robert E.', ''], ['Zwick', 'Uri', '']]","['data structures', 'priority queues', 'heaps', 'amortized analysis']"
13727,1312.4071,Srinjoy Ganguly Mr.,"Srinjoy Ganguly, Arpita Chakraborty and Mrinal Kanti Naskar","A Trust-based Framework for Congestion-aware Energy Efficient Routing in
  Wireless Multimedia Sensor Networks","5 pages, 3 figures and 0 tables. Poster Paper at the Student Research
  Symposium of the International Conference on High Performance Computing
  (HiPC), 2013",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new era in wireless sensor network technology has been ushered in through
the introduction of multimedia sensor networks, which has a major bottleneck in
the form of network congestion. Congestion occurs when resources are in high
demand during the active period while the data processing and transmission
speeds lag behind the speed of the incoming traffic. This may disrupt normal
network operations by buffer overflow, packet loss, increased latency,
excessive energy consumption and even worse, a collapse of the entire
operation. In this paper we propose a novel Trust Integrated Congestion-aware
Energy Efficient Routing algorithm (TCEER) in which the potential of a node is
computed using its trust value, congestion status, residual energy, distance
from the current packet-forwarding node and the distance from the base station
using a Fuzzy Logic Controller. The source node selects the node of highest
potential in its one hop radio range for data transmission. Hop by hop data
routing from source to base station is obtained which is light-weight as well
as energy-efficient. Finally, the merits of the proposed scheme are discussed
by comparing it with the existing protocols and the study shows promising
improvements in network performance.
","[{'version': 'v1', 'created': 'Sat, 14 Dec 2013 17:49:43 GMT'}]",2013-12-17,"[['Ganguly', 'Srinjoy', ''], ['Chakraborty', 'Arpita', ''], ['Naskar', 'Mrinal Kanti', '']]","['Wireless Multimedia Sensor Network (WMSN)', 'Node Potential (NP)', 'Fuzzy Logic Controller (FLC)', 'Trust', 'Congestion']"
13728,1511.09142,Dr. Zubair Asghar,"Muhammad Zubair Asghar, Shakeel Ahmad, Afsana Marwat, Fazal Masud
  Kundi",Sentiment Analysis on YouTube: A Brief Survey,,"MAGNT Research Report (ISSN. 1444-8939), Vol.3 (1). PP: 1250-1257,
  2015",,,cs.SI cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Sentiment analysis or opinion mining is the field of study related to analyze
opinions, sentiments, evaluations, attitudes, and emotions of users which they
express on social media and other online resources. The revolution of social
media sites has also attracted the users towards video sharing sites, such as
YouTube. The online users express their opinions or sentiments on the videos
that they watch on such sites. This paper presents a brief survey of techniques
to analyze opinions posted by users about a particular video.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2015 03:12:12 GMT'}]",2015-12-04,"[['Asghar', 'Muhammad Zubair', ''], ['Ahmad', 'Shakeel', ''], ['Marwat', 'Afsana', ''], ['Kundi', 'Fazal Masud', '']]","['Opinion Mining', 'Sentiment Analysis', 'Social Media', 'Social Networking', 'User                         Reviews', 'Video Sharing', 'YouTube.  1']"
13729,1309.6722,Duyu Tang,"Tang Duyu, Qin Bing, Zhou LanJun, Wong KamFai, Zhao Yanyan, Liu Ting","Domain-Specific Sentiment Word Extraction by Seed Expansion and Pattern
  Generation",,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper focuses on the automatic extraction of domain-specific sentiment
word (DSSW), which is a fundamental subtask of sentiment analysis. Most
previous work utilizes manual patterns for this task. However, the performance
of those methods highly relies on the labelled patterns or selected seeds. In
order to overcome the above problem, this paper presents an automatic framework
to detect large-scale domain-specific patterns for DSSW extraction. To this
end, sentiment seeds are extracted from massive dataset of user comments.
Subsequently, these sentiment seeds are expanded by synonyms using a
bootstrapping mechanism. Simultaneously, a synonymy graph is built and the
graph propagation algorithm is applied on the built synonymy graph. Afterwards,
syntactic and sequential relations between target words and high-ranked
sentiment words are extracted automatically to construct large-scale patterns,
which are further used to extracte DSSWs. The experimental results in three
domains reveal the effectiveness of our method.
","[{'version': 'v1', 'created': 'Thu, 26 Sep 2013 05:18:12 GMT'}]",2013-09-27,"[['Duyu', 'Tang', ''], ['Bing', 'Qin', ''], ['LanJun', 'Zhou', ''], ['KamFai', 'Wong', ''], ['Yanyan', 'Zhao', ''], ['Ting', 'Liu', '']]","['sentiment lexicon', 'patten generation', 'unsupervised framework', 'graph propagation']"
13730,1307.0191,A B M Moniruzzaman Mr.,A B M Moniruzzaman and Syed Akhter Hossain,"NoSQL Database: New Era of Databases for Big data Analytics -
  Classification, Characteristics and Comparison","14 pages, 10 figures, 44 references used and with authors biographies",,,,cs.DB,http://creativecommons.org/licenses/by/3.0/,"  Digital world is growing very fast and become more complex in the volume
(terabyte to petabyte), variety (structured and un-structured and hybrid),
velocity (high speed in growth) in nature. This refers to as Big Data that is a
global phenomenon. This is typically considered to be a data collection that
has grown so large it can not be effectively managed or exploited using
conventional data management tools: e.g., classic relational database
management systems (RDBMS) or conventional search engines. To handle this
problem, traditional RDBMS are complemented by specifically designed a rich set
of alternative DBMS; such as - NoSQL, NewSQL and Search-based systems. This
paper motivation is to provide - classification, characteristics and evaluation
of NoSQL databases in Big Data Analytics. This report is intended to help
users, especially to the organizations to obtain an independent understanding
of the strengths and weaknesses of various NoSQL database approaches to
supporting applications that process huge volumes of data.
","[{'version': 'v1', 'created': 'Sun, 30 Jun 2013 09:53:16 GMT'}]",2013-07-02,"[['Moniruzzaman', 'A B M', ''], ['Hossain', 'Syed Akhter', '']]","['NoSQL Database', 'Big Data', 'NewSQL Database', 'Big Data Analytics']"
13731,1511.03766,Lijun Zhang,"Lijun Zhang, Tianbao Yang, Rong Jin, Zhi-Hua Zhou","Sparse Learning for Large-scale and High-dimensional Data: A Randomized
  Convex-concave Optimization Approach","Proceedings of the 27th International Conference on Algorithmic
  Learning Theory (ALT 2016)",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we develop a randomized algorithm and theory for learning a
sparse model from large-scale and high-dimensional data, which is usually
formulated as an empirical risk minimization problem with a sparsity-inducing
regularizer. Under the assumption that there exists a (approximately) sparse
solution with high classification accuracy, we argue that the dual solution is
also sparse or approximately sparse. The fact that both primal and dual
solutions are sparse motivates us to develop a randomized approach for a
general convex-concave optimization problem. Specifically, the proposed
approach combines the strength of random projection with that of sparse
learning: it utilizes random projection to reduce the dimensionality, and
introduces $\ell_1$-norm regularization to alleviate the approximation error
caused by random projection. Theoretical analysis shows that under favored
conditions, the randomized algorithm can accurately recover the optimal
solutions to the convex-concave optimization problem (i.e., recover both the
primal and dual solutions).
","[{'version': 'v1', 'created': 'Thu, 12 Nov 2015 03:11:48 GMT'}, {'version': 'v2', 'created': 'Sun, 16 Oct 2016 14:36:01 GMT'}]",2016-10-18,"[['Zhang', 'Lijun', ''], ['Yang', 'Tianbao', ''], ['Jin', 'Rong', ''], ['Zhou', 'Zhi-Hua', '']]","['Random projection', 'Sparse learning', 'Convex-concave optimization', 'Primalsolution', 'Dual solution']"
13732,1306.0491,Uwe Aickelin,"Tao Zhang, Peer-Olaf Siebers, Uwe Aickelin","A Three-Dimensional Model of Residential Energy Consumer Archetypes for
  Local Energy Policy Design in the UK","Energy Policy 47, 102-110, 2012",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper reviews major studies in three traditional lines of research in
residential energy consumption in the UK, i.e. economic/infrastructure,
behaviour, and load profiling. Based on the review the paper proposes a
three-dimensional model for archetyping residential energy consumers in the UK
by considering property energy efficiency levels, the greenness of household
behaviour of using energy, and the duration of property daytime occupancy. With
the proposed model, eight archetypes of residential energy consumers in the UK
have been identified. They are: pioneer greens, follower greens, concerned
greens, home stayers, unconscientious wasters, regular wasters, daytime
wasters, and disengaged wasters. Using a case study, these archetypes of
residential energy consumers demonstrate the robustness of the 3-D model in
aiding local energy policy/intervention design in the UK.
","[{'version': 'v1', 'created': 'Fri, 31 May 2013 15:13:05 GMT'}]",2013-06-06,"[['Zhang', 'Tao', ''], ['Siebers', 'Peer-Olaf', ''], ['Aickelin', 'Uwe', '']]","['archetype', 'three-dimensional model', 'residential energy consumer', 'local energy']"
13733,1504.06080,Nicolas Turenne,Nicolas Turenne,"svcR: An R Package for Support Vector Clustering improved with Geometric
  Hashing applied to Lexical Pattern Discovery",,,,,cs.LG cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new R package which takes a numerical matrix format as data
input, and computes clusters using a support vector clustering method (SVC). We
have implemented an original 2D-grid labeling approach to speed up cluster
extraction. In this sense, SVC can be seen as an efficient cluster extraction
if clusters are separable in a 2-D map. Secondly we showed that this SVC
approach using a Jaccard-Radial base kernel can help to classify well enough a
set of terms into ontological classes and help to define regular expression
rules for information extraction in documents; our case study concerns a set of
terms and documents about developmental and molecular biology.
","[{'version': 'v1', 'created': 'Thu, 23 Apr 2015 08:29:11 GMT'}]",2015-04-24,"[['Turenne', 'Nicolas', '']]","['unsupervised learning', 'support vector clustering', 'lexical clustering', 'pattern discovery', 'grid-based labeling', 'ontology', 'terminology', 'jaccard-radialkernel']"
13734,1505.03998,Sophea Chhun,"Sophea Chhun, Chantal Cherifi, Nejib Moalla, Yacine Ouzrout","A multi-criteria service selection algorithm for business process
  requirements",15 pages,,,,cs.SE,http://creativecommons.org/licenses/by/3.0/,"  The selection of the most appropriate Web services to realize business tasks
still remain an open issue. We propose a multi-criteria algorithm for efficient
service selection. Web services and their QoS values are stored in a Web
service ontology (WSOnto) and business processes are modeled with the BPMN2.0
specifications. Our algorithm performs an instance-based ontology matching
between the WSOnto and the business process ontology. The business context,
functional properties and QoS values of Web services are considered. The
algorithm computes the variation of QoS values over times. This strategy allows
better accurate Web services ranking relevant to a user's request.
","[{'version': 'v1', 'created': 'Fri, 15 May 2015 09:32:59 GMT'}]",2015-05-18,"[['Chhun', 'Sophea', ''], ['Cherifi', 'Chantal', ''], ['Moalla', 'Nejib', ''], ['Ouzrout', 'Yacine', '']]","['business process', 'multi-criteria service selection', 'ontology', 'dynamic QoS']"
13735,0906.3923,Daiki Koizumi,"Daiki Koizumi, Toshiyasu Matsushima, and Shigeichi Hirasawa",Bayesian Forecasting of WWW Traffic on the Time Varying Poisson Model,"8 pages, 6 figures. This paper was published in Proceeding of The
  2009 International Conference on Parallel and Distributed Processing
  Techniques and Applications (PDPTA'09) in July, 2009. In version of v4,
  research grants are included in acknowledgment",,,,cs.NI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traffic forecasting from past observed traffic data with small calculation
complexity is one of important problems for planning of servers and networks.
Focusing on World Wide Web (WWW) traffic as fundamental investigation, this
paper would deal with Bayesian forecasting of network traffic on the time
varying Poisson model from a viewpoint from statistical decision theory. Under
this model, we would show that the estimated forecasting value is obtained by
simple arithmetic calculation and expresses real WWW traffic well from both
theoretical and empirical points of view.
","[{'version': 'v1', 'created': 'Mon, 22 Jun 2009 07:48:12 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Nov 2009 08:41:17 GMT'}, {'version': 'v3', 'created': 'Fri, 20 Nov 2009 07:02:06 GMT'}, {'version': 'v4', 'created': 'Thu, 3 Dec 2009 02:15:11 GMT'}]",2009-12-03,"[['Koizumi', 'Daiki', ''], ['Matsushima', 'Toshiyasu', ''], ['Hirasawa', 'Shigeichi', '']]","['World Wide Web (WWW) traffic', 'traffic engineering', 'statistical decision theory', 'time varying Poisson distribution', 'longrange dependence (LRD)']"
13736,1105.0074,Rajesh Sharma,Rajesh Sharma and Anwitaman Datta,"SuperNova: Super-peers Based Architecture for Decentralized Online
  Social Networks","20 Pages, 10 Figures",,,,cs.SI cs.DC physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent years have seen several earnest initiatives from both academic
researchers as well as open source communities to implement and deploy
decentralized online social networks (DOSNs). The primary motivations for DOSNs
are privacy and autonomy from big brotherly service providers. The promise of
decentralization is complete freedom for end-users from any service providers
both in terms of keeping privacy about content and communication, and also from
any form of censorship. However decentralization introduces many challenges.
One of the principal problems is to guarantee availability of data even when
the data owner is not online, so that others can access the said data even when
a node is offline or down. In this paper, we argue that a pragmatic design
needs to explicitly allow for and leverage on system heterogeneity, and provide
incentives for the resource rich participants in the system to contribute such
resources. To that end we introduce SuperNova - a super-peer based DOSN
architecture. While proposing the SuperNova architecture, we envision a dynamic
system driven by incentives and reputation, however, investigation of such
incentives and reputation, and its effect on determining peer behaviors is a
subject for our future study. In this paper we instead investigate the efficacy
of a super-peer based system at any time point (a snap-shot of the envisioned
dynamic system), that is to say, we try to quantify the performance of
SuperNova system given any (fixed) mix of peer population and strategies.
","[{'version': 'v1', 'created': 'Sat, 30 Apr 2011 10:49:27 GMT'}, {'version': 'v2', 'created': 'Wed, 25 May 2011 13:56:50 GMT'}]",2011-05-26,"[['Sharma', 'Rajesh', ''], ['Datta', 'Anwitaman', '']]","['System architecture', 'Super-peers', 'Storage', 'Self-organization']"
13737,1606.09549,Andrea Vedaldi,"Luca Bertinetto, Jack Valmadre, Jo\~ao F. Henriques, Andrea Vedaldi,
  Philip H. S. Torr",Fully-Convolutional Siamese Networks for Object Tracking,"The first two authors contributed equally, and are listed in
  alphabetical order. Code available at
  http://www.robots.ox.ac.uk/~luca/siamese-fc.html",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of arbitrary object tracking has traditionally been tackled by
learning a model of the object's appearance exclusively online, using as sole
training data the video itself. Despite the success of these methods, their
online-only approach inherently limits the richness of the model they can
learn. Recently, several attempts have been made to exploit the expressive
power of deep convolutional networks. However, when the object to track is not
known beforehand, it is necessary to perform Stochastic Gradient Descent online
to adapt the weights of the network, severely compromising the speed of the
system. In this paper we equip a basic tracking algorithm with a novel
fully-convolutional Siamese network trained end-to-end on the ILSVRC15 dataset
for object detection in video. Our tracker operates at frame-rates beyond
real-time and, despite its extreme simplicity, achieves state-of-the-art
performance in multiple benchmarks.
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2016 16:00:43 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Sep 2016 11:48:29 GMT'}, {'version': 'v3', 'created': 'Wed, 1 Dec 2021 19:21:43 GMT'}]",2021-12-03,"[['Bertinetto', 'Luca', ''], ['Valmadre', 'Jack', ''], ['Henriques', 'João F.', ''], ['Vedaldi', 'Andrea', ''], ['Torr', 'Philip H. S.', '']]","['object-tracking', 'Siamese-network', 'similarity-learning', 'deeplearning']"
13738,1207.6452,Frank Ruskey,Khalegh Mamakani and Frank Ruskey,A New Rose : The First Simple Symmetric 11-Venn Diagram,,,,,cs.CG math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A symmetric Venn diagram is one that is invariant under rotation, up to a
relabeling of curves. A simple Venn diagram is one in which at most two curves
intersect at any point. In this paper we introduce a new property of Venn
diagrams called crosscut symmetry, which is related to dihedral symmetry.
Utilizing a computer search restricted to crosscut symmetry we found many
simple symmetric Venn diagrams with 11 curves. This answers an existence
question that has been open since the 1960's. The first such diagram that was
discovered is shown here.
","[{'version': 'v1', 'created': 'Fri, 27 Jul 2012 05:57:49 GMT'}]",2012-07-30,"[['Mamakani', 'Khalegh', ''], ['Ruskey', 'Frank', '']]","['Venn diagram', 'crosscut symmetry', 'symmetric graphs', 'hypercube']"
13739,1110.2416,Frank-Michael Schleif,"F.-M. Schleif, A. Gisbrecht, B. Hammer","Supervised learning of short and high-dimensional temporal sequences for
  life science measurements",,,,DPA-11341,cs.LG,http://creativecommons.org/licenses/by/3.0/,"  The analysis of physiological processes over time are often given by
spectrometric or gene expression profiles over time with only few time points
but a large number of measured variables. The analysis of such temporal
sequences is challenging and only few methods have been proposed. The
information can be encoded time independent, by means of classical expression
differences for a single time point or in expression profiles over time.
Available methods are limited to unsupervised and semi-supervised settings. The
predictive variables can be identified only by means of wrapper or
post-processing techniques. This is complicated due to the small number of
samples for such studies. Here, we present a supervised learning approach,
termed Supervised Topographic Mapping Through Time (SGTM-TT). It learns a
supervised mapping of the temporal sequences onto a low dimensional grid. We
utilize a hidden markov model (HMM) to account for the time domain and
relevance learning to identify the relevant feature dimensions most predictive
over time. The learned mapping can be used to visualize the temporal sequences
and to predict the class of a new sequence. The relevance learning permits the
identification of discriminating masses or gen expressions and prunes
dimensions which are unnecessary for the classification task or encode mainly
noise. In this way we obtain a very efficient learning system for temporal
sequences. The results indicate that using simultaneous supervised learning and
metric adaptation significantly improves the prediction accuracy for
synthetically and real life data in comparison to the standard techniques. The
discriminating features, identified by relevance learning, compare favorably
with the results of alternative methods. Our method permits the visualization
of the data on a low dimensional grid, highlighting the observed temporal
structure.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2011 16:19:06 GMT'}]",2011-10-12,"[['Schleif', 'F. -M.', ''], ['Gisbrecht', 'A.', ''], ['Hammer', 'B.', '']]","['high-dimensional time series', 'short time series', 'prototype learning', 'relevance learning', 'topographic mapping']"
13740,0705.0450,Jerome Darmont,"J\'er\^ome Darmont (LIMOS), Michel Schneider (LIMOS)","VOODB: A Generic Discrete-Event Random Simulation Model to Evaluate the
  Performances of OODBs",,"25th International Conference on Very Large Databases (VLDB 99)
  (09/1999) 254-265",,,cs.DB,,"  Performance of object-oriented database systems (OODBs) is still an issue to
both designers and users nowadays. The aim of this paper is to propose a
generic discrete-event random simulation model, called VOODB, in order to
evaluate the performances of OODBs in general, and the performances of
optimization methods like clustering in particular. Such optimization methods
undoubtedly improve the performances of OODBs. Yet, they also always induce
some kind of overhead for the system. Therefore, it is important to evaluate
their exact impact on the overall performances. VOODB has been designed as a
generic discrete-event random simulation model by putting to use a modelling
approach, and has been validated by simulating the behavior of the O2 OODB and
the Texas persistent object store. Since our final objective is to compare
object clustering algorithms, some experiments have also been conducted on the
DSTC clustering technique, which is implemented in Texas. To validate VOODB,
performance results obtained by simulation for a given experiment have been
compared to the results obtained by benchmarking the real systems in the same
conditions. Benchmarking and simulation performance evaluations have been
observed to be consistent, so it appears that simulation can be a reliable
approach to evaluate the performances of OODBs.
","[{'version': 'v1', 'created': 'Thu, 3 May 2007 12:50:04 GMT'}]",2007-05-23,"[['Darmont', 'Jérôme', '', 'LIMOS'], ['Schneider', 'Michel', '', 'LIMOS']]","['Object-oriented database systems', 'Object clustering', 'Performance evaluation', 'Discrete-event random simulation']"
13741,1510.07898,Oana Andrei,"Oana Andrei, Muffy Calder, Matthew Chalmers, Alistair Morrison,
  Mattias Rost",Probabilistic Formal Analysis of App Usage to Inform Redesign,"13 pages, 6 figures, 7 tables, under review",,,,cs.SE cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper sets out a process of app analysis intended to support
understanding of use but also redesign. From usage logs we infer activity
patterns - Markov models - and employ probabilistic formal analysis to ask
questions about the use of the app. The core of this paper's contribution is a
bridging of stochastic and formal modelling, but we also describe the work to
make that analytic core utile within a design team. We illustrate our work via
a case study of a mobile app presenting analytic findings and discussing how
they are feeding into redesign. We had posited that two activity patterns
indicated two separable sets of users, each of which might benefit from a
differently tailored app version, but our subsequent analysis detailed users'
interleaving of activity patterns over time - evidence speaking more in favour
of redesign that supports each pattern in an integrated way. We uncover
patterns consisting of brief glances at particular data and recommend them as
possible candidates for new design work on widget extensions: small displays
available while users use other apps.
","[{'version': 'v1', 'created': 'Tue, 27 Oct 2015 13:30:44 GMT'}]",2015-10-28,"[['Andrei', 'Oana', ''], ['Calder', 'Muffy', ''], ['Chalmers', 'Matthew', ''], ['Morrison', 'Alistair', ''], ['Rost', 'Mattias', '']]","['Log Analysis', 'Inference', 'Markov Models', 'Model Checking']"
13742,1510.03146,Jai Manral,Jai Manral,IoT enabled Insurance Ecosystem - Possibilities Challenges and Risks,"Internet of Things, Insurance, Smart Cars, M2M",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet of Thing (IoT) is looking over to overhaul the business processes of
many industries including insurance domain. The current line of business such
as Property and Casualty, Health, and Life Insurance can avail tremendous
benefits from the contextual and relevant data being generated from billions of
connected devices; Smartphone's, wearable gadget and other electronic smart
sensors. For P&C insurer's the biggest challenges is not the rapidly changing
environment but tackling these challenges with strategies linked to the past.
  This paper presents the key opportunities, challenges, potential applications
and risks of IoT in Insurance domain. It crystallomancy on the efficient use of
data analytics from data generated in IoT ecosystem and highlights business
model changes that Insurance industries may face in near future.
","[{'version': 'v1', 'created': 'Mon, 12 Oct 2015 05:44:41 GMT'}]",2015-10-13,"[['Manral', 'Jai', '']]","['Internet of Things', 'Insurance', 'Smart Cars', 'M2M']"
13743,1305.1713,Meenesh  bhardwaj,Meenesh Bhardwaj,Optimization of stochastic database cracking,,,,,cs.DB,http://creativecommons.org/licenses/by/3.0/,"  Variant Stochastic cracking is a significantly more resilient approach to
adaptive indexing. It showed [1]that Stochastic cracking uses each query as a
hint on how to reorganize data, but not blindly so; it gains resilience and
avoids performance bottlenecks by deliberately applying certain arbitrary
choices in its decision making. Therefore bring, adaptive indexing forward to a
mature formulation that confers the workload-robustness that previous
approaches lacked. Original cracking relies on the randomness of the workloads
to converge well. [2][3] However, where the workload is non-random, cracking
needs to introduce randomness on its own. Stochastic Cracking clearly improves
over original cracking by being robust in workload changes while maintaining
all original cracking features when it comes to adaptation. But looking at both
types of cracking, it conveyed an incomplete picture as at some point of time
it is must to know whether the workload is random or sequential. In this paper
our focus is on optimization of variant stochastic cracking, that could be
achieved in two ways either by reducing the initialization cost to make
stochastic cracking even more transparent to the user, especially for queries
that initiate a workload change and hence incur a higher cost or by combining
the strengths of the various stochastic cracking algorithms via a dynamic
component that decides which algorithm to choose for a query on the fly. The
efforts have been put in to make an algorithm that reduces the initialization
cost by using the main notion of both cracking, while considering the
requirements of adaptive indexing [2].
","[{'version': 'v1', 'created': 'Wed, 8 May 2013 04:26:10 GMT'}]",2013-05-09,"[['Bhardwaj', 'Meenesh', '']]","['{Variant stochastic cracking', 'Optimization}  General Terms {Physical organization', 'Workload', 'Cracking}']"
13744,1205.1853,Priya Iyer  K B,"K. B. Priya Iyer, V. Shanthi",Goal Directed Relative Skyline Queries in Time Dependent Road Networks,,,,,cs.NI cs.DB,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The Wireless GIS technology is progressing rapidly in the area of mobile
communications. Location-based spatial queries are becoming an integral part of
many new mobile applications. The Skyline queries are latest apps under
Location-based services. In this paper we introduce Goal Directed Relative
Skyline queries on Time dependent (GD-RST) road networks. The algorithm uses
travel time as a metric in finding the data object by considering multiple
query points (multi-source skyline) relative to user location and in the user
direction of travelling. We design an efficient algorithm based on Filter
phase, Heap phase and Refine Skyline phases. At the end, we propose a dynamic
skyline caching (DSC) mechanism which helps to reduce the computation cost for
future skyline queries. The experimental evaluation reflects the performance of
GD-RST algorithm over the traditional branch and bound algorithm for skyline
queries in real road networks.
","[{'version': 'v1', 'created': 'Wed, 9 May 2012 01:16:34 GMT'}]",2012-05-10,"[['Iyer', 'K. B. Priya', ''], ['Shanthi', 'V.', '']]","['GD-RST', 'Spatial Databases', 'Skyline Queries', 'GIS', 'Location based services', 'GPS']"
13745,0711.3663,P.F. Wang,"P.F. Wang, J.P. Li",The one-way function based on computational uncertainty principle,11 pages,,,,cs.CR,,"  This paper presents how to make use of the advantage of round-off error
effect in some research areas. The float-point operation complies with the
reproduce theorem without the external random perturbation. The computation
uncertainty principle and the high nonlinear of chaotic system guarantee the
numerical error is random and departure from the analytical result. Combining
these two properties we can produce unilateral one-way function and provide a
case of utilizing this function to construct encryption algorithm. The
multiple-precision (MP) library is used to analyze nonlinear dynamics systems
and achieve the code. As an example, we provide a scheme of encrypting a
plaintext by employing the one-way function with Lorenz system. Since the
numerical solution used in this scheme is beyond the maximum effective
computation time (MECT) and it cannot satisfy the requirements of return-map
analysis and phase space reconstruction, it can block some existing attacks.
","[{'version': 'v1', 'created': 'Fri, 23 Nov 2007 02:37:12 GMT'}]",2007-11-26,"[['Wang', 'P. F.', ''], ['Li', 'J. P.', '']]","['computational uncertainty principle', 'MECT', 'one-way function', 'encryption']"
13746,1312.4569,Vu Pham,"Vu Pham, Th\'eodore Bluche, Christopher Kermorvant, J\'er\^ome
  Louradour",Dropout improves Recurrent Neural Networks for Handwriting Recognition,,,,,cs.CV cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recurrent neural networks (RNNs) with Long Short-Term memory cells currently
hold the best known results in unconstrained handwriting recognition. We show
that their performance can be greatly improved using dropout - a recently
proposed regularization method for deep architectures. While previous works
showed that dropout gave superior performance in the context of convolutional
networks, it had never been applied to RNNs. In our approach, dropout is
carefully used in the network so that it does not affect the recurrent
connections, hence the power of RNNs in modeling sequence is preserved.
Extensive experiments on a broad range of handwritten databases confirm the
effectiveness of dropout on deep architectures even when the network mainly
consists of recurrent and shared connections.
","[{'version': 'v1', 'created': 'Tue, 5 Nov 2013 10:45:48 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Mar 2014 15:34:55 GMT'}]",2014-03-11,"[['Pham', 'Vu', ''], ['Bluche', 'Théodore', ''], ['Kermorvant', 'Christopher', ''], ['Louradour', 'Jérôme', '']]","['Recurrent Neural Networks', 'Dropout', 'HandwritingRecognition']"
13747,2006.04448,Vinayak Jagannathrao Kalas,"Vinayak Jagannathrao Kalas (DEXTER), Alain Vissiere (DEXTER, CNAM),
  Olivier Company (DEXTER), S\'ebastien Krut (DEXTER), Pierre Noir\'e, Thierry
  Roux, Fran\c{c}ois Pierrot (DEXTER)",Thermal deflection decoupled 6-DOF pose measurement of hexapods,,"Proceedings of the 20th international conference of the European
  Society for Precision Engineering and Nanotechnology, European Society for
  Precision Engineering and Nanotechnology (euspen), Jun 2020, Geneva,
  Switzerland",,,cs.RO physics.class-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Calibration is crucial for hexapods with high-accuracy positioning
capability. Many of these calibration procedures require measurement of
hexapod's platform pose (position and orientation) at constant temperature.
Consequently, thermal deflection of the hexapod's platform during pose
measurements impacts the accuracy of calibrated parameters. This paper presents
a method to eliminate the impact of thermal deflection of hexapods on their
pose measurement. In this method, a reference pose is measured before each
measurement of any particular pose. The measurements of reference pose are used
to estimate thermal deflection of hexapod's legs. This is in turn used to
estimate and correct the resulting pose error at the particular pose to be
measured. The advantage of using the proposed method is demonstrated
experimentally by means of pose measurements of a high-precision hexapod using
a CMM.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2020 10:07:03 GMT'}]",2020-06-09,"[['Kalas', 'Vinayak Jagannathrao', '', 'DEXTER'], ['Vissiere', 'Alain', '', 'DEXTER, CNAM'], ['Company', 'Olivier', '', 'DEXTER'], ['Krut', 'Sébastien', '', 'DEXTER'], ['Noiré', 'Pierre', '', 'DEXTER'], ['Roux', 'Thierry', '', 'DEXTER'], ['Pierrot', 'François', '', 'DEXTER']]","['pose measurement', 'accuracy', 'thermal error', 'hexapod', 'positioning system']"
13748,1403.6919,Malini  P,"Harikrishnan.R, Shajna S. Hammed, P.Malini","Marine Buoy Location Finding and Tracking System for Linux Supporting
  Mobiles","3pages, 5figures","International Journal of Engineering Trends and Technology Volume
  9 Number 8 - Mar 2014",,,cs.OH,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Marine buoy is an important part of underwater acoustic communication system.
It is of great significance to track and locate it. It is widely used in ocean
environment three - dimensional monitoring, underwater multimedia
communication, underwater mobile carrier navigation and positioning, marine
resources detection, remote control of submarine topography mapping and
offshore oil industry, data acquisition, etc. This paper describes the
application of the monitoring service of GPRS / GPS module at Marine buoy. It
can achieve real - time location of underwater acoustic communication devices
and route tracking to avoid the loss of the device, as well as assist to
retrieve the lost device.
","[{'version': 'v1', 'created': 'Thu, 27 Mar 2014 05:57:10 GMT'}]",2014-03-28,"[['R', 'Harikrishnan.', ''], ['Hammed', 'Shajna S.', ''], ['Malini', 'P.', '']]","['Underwater acoustic communication', 'sea buoy', 'track and locate', 'GPRS/GPS']"
13749,1610.09650,Bharat Sau,Bharat Bhusan Sau and Vineeth N. Balasubramanian,Deep Model Compression: Distilling Knowledge from Noisy Teachers,"9 pages, 3 figures",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The remarkable successes of deep learning models across various applications
have resulted in the design of deeper networks that can solve complex problems.
However, the increasing depth of such models also results in a higher storage
and runtime complexity, which restricts the deployability of such very deep
models on mobile and portable devices, which have limited storage and battery
capacity. While many methods have been proposed for deep model compression in
recent years, almost all of them have focused on reducing storage complexity.
In this work, we extend the teacher-student framework for deep model
compression, since it has the potential to address runtime and train time
complexity too. We propose a simple methodology to include a noise-based
regularizer while training the student from the teacher, which provides a
healthy improvement in the performance of the student network. Our experiments
on the CIFAR-10, SVHN and MNIST datasets show promising improvement, with the
best performance on the CIFAR-10 dataset. We also conduct a comprehensive
empirical evaluation of the proposed method under related settings on the
CIFAR-10 dataset to show the promise of the proposed approach.
","[{'version': 'v1', 'created': 'Sun, 30 Oct 2016 13:54:39 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Nov 2016 16:32:23 GMT'}]",2016-11-03,"[['Sau', 'Bharat Bhusan', ''], ['Balasubramanian', 'Vineeth N.', '']]","['Deep Learning', 'Model Compression', 'TeacherStudent Learning', 'Regularization', 'Noise']"
13750,1108.2018,Ali Kakhbod,Ali Kakhbod,Resource allocation with costly participation,,,,,cs.GT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new all-pay auction format in which risk-loving bidders pay a
constant fee each time they bid for an object whose monetary value is common
knowledge among the bidders, and bidding fees are the only source of benefit
for the seller. We show that for the proposed model there exists a {unique}
Symmetric Subgame Perfect Equilibrium (SSPE). The characterized SSPE is
stationary when re-entry in the auction is allowed, and it is Markov perfect
when re-entry is forbidden. Furthermore, we fully characterize the expected
revenue of the seller. Generally, with or without re-entry, it is more
beneficial for the seller to choose $v$ (value of the object), $s$ (sale
price), and $c$ (bidding fee) such that $\frac{v-s}{c}$ becomes sufficiently
large. In particular, when re-entry is permitted: the expected revenue of the
seller is \emph{independent} of the number of bidders, decreasing in the sale
price, increasing in the value of the object, and decreasing in the bidding
fee; Moreover, the seller's revenue is equal to the value of the object when
players are risk neutral, and it is strictly greater than the value of the
object when bidders are risk-loving. We further show that allowing re-entry can
be important in practice. Because, if the seller were to run such an auction
without allowing re-entry, the auction would last a long time, and for almost
all of its duration have only two remaining players. Thus, the seller's revenue
relies on those two players being willing to participate, without any breaks,
in an auction that might last for thousands of rounds
","[{'version': 'v1', 'created': 'Tue, 9 Aug 2011 19:34:04 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Sep 2011 06:38:03 GMT'}, {'version': 'v3', 'created': 'Wed, 5 Oct 2011 15:54:47 GMT'}, {'version': 'v4', 'created': 'Fri, 10 Feb 2012 18:54:33 GMT'}, {'version': 'v5', 'created': 'Fri, 15 Mar 2013 21:09:58 GMT'}, {'version': 'v6', 'created': 'Wed, 2 Mar 2016 02:03:14 GMT'}]",2016-03-03,"[['Kakhbod', 'Ali', '']]","['Pay-to-bid auctions', 'risk-loving bidders', 'risk neutral bidders', 'revenue']"
13751,1109.3651,Tomoyuki Yamakami,Tomoyuki Yamakami,"Optimization, Randomized Approximability, and Boolean Constraint
  Satisfaction Problems","A4, 11pt, 9 pages. This is an extended abstract",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give a unified treatment to optimization problems that can be expressed in
the form of nonnegative-real-weighted Boolean constraint satisfaction problems.
Creignou, Khanna, Sudan, Trevisan, and Williamson studied the complexity of
approximating their optimal solutions whose optimality is measured by the sums
of outcomes of constraints. To explore a wider range of optimization constraint
satisfaction problems, following an early work of Marchetti-Spaccamela and
Romano, we study the case where the optimality is measured by products of
constraints' outcomes. We completely classify those problems into three
categories: PO problems, NPO-hard problems, and intermediate problems that lie
between the former two categories. To prove this trichotomy theorem, we analyze
characteristics of nonnegative-real-weighted constraints using a variant of the
notion of T-constructibility developed earlier for complex-weighted counting
constraint satisfaction problems.
","[{'version': 'v1', 'created': 'Fri, 16 Sep 2011 15:56:06 GMT'}]",2011-09-19,"[['Yamakami', 'Tomoyuki', '']]","['optimization problem', 'approximation algorithm', 'constraint satisfactionproblem', 'PO', 'APX', 'approximation-preserving reducibility']"
13752,1111.3270,Mehdi Kaytoue,"Mehdi Kaytoue (DCC - UFMG), Sergei O. Kuznetsov, Juraj Macko, Wagner
  Meira (DCC - UFMG), Amedeo Napoli (INRIA Lorraine - LORIA)",Mining Biclusters of Similar Values with Triadic Concept Analysis,Concept Lattices and their Applications (CLA) (2011),,,,cs.DS cs.AI cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Biclustering numerical data became a popular data-mining task in the
beginning of 2000's, especially for analysing gene expression data. A bicluster
reflects a strong association between a subset of objects and a subset of
attributes in a numerical object/attribute data-table. So called biclusters of
similar values can be thought as maximal sub-tables with close values. Only few
methods address a complete, correct and non redundant enumeration of such
patterns, which is a well-known intractable problem, while no formal framework
exists. In this paper, we introduce important links between biclustering and
formal concept analysis. More specifically, we originally show that Triadic
Concept Analysis (TCA), provides a nice mathematical framework for
biclustering. Interestingly, existing algorithms of TCA, that usually apply on
binary data, can be used (directly or with slight modifications) after a
preprocessing step for extracting maximal biclusters of similar values.
","[{'version': 'v1', 'created': 'Mon, 14 Nov 2011 16:22:33 GMT'}]",2011-11-15,"[['Kaytoue', 'Mehdi', '', 'DCC - UFMG'], ['Kuznetsov', 'Sergei O.', '', 'DCC - UFMG'], ['Macko', 'Juraj', '', 'DCC - UFMG'], ['Meira', 'Wagner', '', 'DCC - UFMG'], ['Napoli', 'Amedeo', '', 'INRIA Lorraine - LORIA']]","['Triadic concept analysis', 'numerical biclustering', 'scaling']"
13753,1206.1953,Sohrab MIrsaeidi,"Mojtaba Nouri, Mahdi Bayat Mokhtari, Sohrab Mirsaeidi, Mohammad Reza
  Miveh","Improvement of Loadability in Distribution System Using Genetic
  Algorithm",,,,,cs.SY cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generally during recent decades due to development of power systems, the
methods for delivering electrical energy to consumers, and because of voltage
variations is a very important problem, the power plants follow this criteria.
The good solution for improving transfer and distribution of electrical power
the majority of consumers prefer to use energy near the loads .So small units
that are connected to distribution system named ""Decentralized Generation"" or
""Dispersed Generation"". Deregulated in power industry and development of
renewable energies are the most important factors in developing this type of
electricity generation. Today DG has a key role in electrical distribution
systems. For example we can refer to improving reliability indices, improvement
of stability and reduction of losses in power system. One of the key problems
in using DG's, is allocation of these sources in distribution networks. Load
ability in distribution systems and its improvement has an effective role in
the operation of power systems. However, placement of distributed generation
sources in order to improve the distribution system load ability index was not
considered, we show DG placement and allocation with genetic algorithm
optimization method maximize load ability of power systems .This method
implemented on the IEEE Standard bench marks. The results show the
effectiveness of the proposed algorithm .Another benefits of DG in selected
positions are also studied and compared.
","[{'version': 'v1', 'created': 'Sat, 9 Jun 2012 16:23:34 GMT'}]",2012-06-12,"[['Nouri', 'Mojtaba', ''], ['Mokhtari', 'Mahdi Bayat', ''], ['Mirsaeidi', 'Sohrab', ''], ['Miveh', 'Mohammad Reza', '']]","['Voltage Profile', 'Electric Power Losses', 'Distributed Generation (DG)', 'Distribution System']"
13754,1707.08821,Marc Bola\~nos,"Gabriel Oliveira-Barra and Marc Bola\~nos and Estefania Talavera and
  Adri\'an Due\~nas and Olga Gelonch and Maite Garolera",Serious Games Application for Memory Training Using Egocentric Images,11 pages,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mild cognitive impairment is the early stage of several neurodegenerative
diseases, such as Alzheimer's. In this work, we address the use of lifelogging
as a tool to obtain pictures from a patient's daily life from an egocentric
point of view. We propose to use them in combination with serious games as a
way to provide a non-pharmacological treatment to improve their quality of
life. To do so, we introduce a novel computer vision technique that classifies
rich and non rich egocentric images and uses them in serious games. We present
results over a dataset composed by 10,997 images, recorded by 7 different
users, achieving 79% of F1-score. Our model presents the first method used for
automatic egocentric images selection applicable to serious games.
","[{'version': 'v1', 'created': 'Thu, 27 Jul 2017 11:36:26 GMT'}]",2017-07-28,"[['Oliveira-Barra', 'Gabriel', ''], ['Bolaños', 'Marc', ''], ['Talavera', 'Estefania', ''], ['Dueñas', 'Adrián', ''], ['Gelonch', 'Olga', ''], ['Garolera', 'Maite', '']]","['lifelogging', 'serious games', 'egocentric vision', 'mild cognitiveimpairment', 'machine learning', 'computer vision']"
13755,1105.3716,Marco Valerio Barbera,Marco Valerio Barbera and Alessandro Mei,"Personal Marks and Community Certificates: Detecting Clones in Mobile
  Wireless Networks of Smart-Phones","12 pages, 22 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of detecting clones in wireless mobile adhoc
networks. We assume that one of the devices of the network has been cloned.
Everything, including certificates and secret keys. This can happen quite
easily, because of a virus that immediately after sending all the content of
the infected device to the adversary destroys itself, or just because the owner
has left his device unattended for a few minutes in a hostile environment. The
problem is to detect this attack. We propose a solution in networks of mobile
devices carried by individuals. These networks are composed by nodes that have
the capability of using short-range communication technology like blue-tooth or
Wi-Fi, where nodes are carried by mobile users, and where links appear and
disappear according to the social relationships between the users. Our idea is
to use social physical contacts, securely collected by wireless personal
smart-phones, as a biometric way to authenticate the legitimate owner of the
device and detect the clone attack. We introduce two mechanisms: Personal Marks
and Community Certificates. Personal Marks is a simple cryptographic protocol
that works very well when the adversary is an insider, a malicious node in the
network that is part, or not very far, from the social community of the
original device that has been cloned. Community Certificates work very well
when the adversary is an outsider, a node that has the goal of using the stolen
credentials when interacting with other nodes that are far in the social
network from the original device. When combined, these mechanisms provide an
excellent protection against this very strong attack. We prove our ideas and
solutions with extensive simulations in a real world scenario-with mobility
traces collected in a real life experiment
","[{'version': 'v1', 'created': 'Wed, 18 May 2011 19:09:04 GMT'}]",2015-03-19,"[['Barbera', 'Marco Valerio', ''], ['Mei', 'Alessandro', '']]","['Delay tolerant networks', 'pocket switched networks', 'clone detection', 'community authentication']"
13756,1704.05952,Raydonal Ospina,"Luis Gomez, Raydonal Ospina and Alejandro C. Frery",Unassisted Quantitative Evaluation Of Despeckling Filters,Accepted for publication in Remote Sensing - Open Access Journal,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  SAR (Synthetic Aperture Radar) imaging plays a central role in Remote Sensing
due to, among other important features, its ability to provide high-resolution,
day-and-night and almost weather-independent images. SAR images are affected
from a granular contamination, speckle, that can be described by a
multiplicative model. Many despeckling techniques have been proposed in the
literature, as well as measures of the quality of the results they provide.
Assuming the multiplicative model, the observed image $Z$ is the product of two
independent fields: the backscatter $X$ and the speckle $Y$. The result of any
speckle filter is $\widehat X$, an estimator of the backscatter $X$, based
solely on the observed data $Z$. An ideal estimator would be the one for which
the ratio of the observed image to the filtered one $I=Z/\widehat X$ is only
speckle: a collection of independent identically distributed samples from Gamma
variates. We, then, assess the quality of a filter by the closeness of $I$ to
the hypothesis that it is adherent to the statistical properties of pure
speckle. We analyze filters through the ratio image they produce with regards
to first- and second-order statistics: the former check marginal properties,
while the latter verifies lack of structure. A new quantitative image-quality
index is then defined, and applied to state-of-the-art despeckling filters.
This new measure provides consistent results with commonly used quality
measures (equivalent number of looks, PSNR, MSSIM, $\beta$ edge correlation,
and preservation of the mean), and ranks the filters results also in agreement
with their visual analysis. We conclude our study showing that the proposed
measure can be successfully used to optimize the (often many) parameters that
define a speckle filter.
","[{'version': 'v1', 'created': 'Wed, 19 Apr 2017 23:01:30 GMT'}]",2017-04-21,"[['Gomez', 'Luis', ''], ['Ospina', 'Raydonal', ''], ['Frery', 'Alejandro C.', '']]","['Quality assessment', 'ratio images', 'Synthetic Aperture Radar (SAR)', 'speckle', 'specklefilters']"
13757,1412.8125,Lanbo Zhang,Lanbo Zhang and Yi Zhang and Qianli Xing,Learning from Labeled Features for Document Filtering,,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing document filtering systems learn user profiles based on user
relevance feedback on documents. In some cases, users may have prior knowledge
about what features are important. For example, a Spanish speaker may only want
news written in Spanish, and thus a relevant document should contain the
feature ""Language: Spanish""; a researcher focusing on HIV knows an article with
the medical subject ""Subject: AIDS"" is very likely to be relevant to him/her.
  Semi-structured documents with rich metadata are increasingly prevalent on
the Internet. Motivated by the well-adopted faceted search interface in
e-commerce, we study the exploitation of user prior knowledge on faceted
features for semi-structured document filtering. We envision two faceted
feedback mechanisms, and propose a novel user profile learning algorithm that
can incorporate user feedback on features. To evaluate the proposed work, we
use two data sets from the TREC filtering track, and conduct a user study on
Amazon Mechanical Turk. Our experiment results show that user feedback on
faceted features is useful for filtering. The proposed user profile learning
algorithm can effectively learn from user feedback on both documents and
features, and performs better than several existing methods.
","[{'version': 'v1', 'created': 'Sun, 28 Dec 2014 07:32:09 GMT'}]",2014-12-30,"[['Zhang', 'Lanbo', ''], ['Zhang', 'Yi', ''], ['Xing', 'Qianli', '']]","['Adaptive Filtering', 'Content-Based Filtering', 'User Feedback', 'Faceted Feedback', 'Labeled Features', 'Semi-structured Documents', 'Document Facets']"
13758,1704.07878,Shayan Taheri,Shayan Taheri and Jiann-Shiun Yuan,"Security Analysis of Tunnel Field-Effect Transistor for Low Power
  Hardware",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security and energy are considered as the most important parameters for
designing and building a computing system nowadays. Today's attacks target
different layers of the computing system (i.e. software and hardware).
Introduction of new transistor technologies to the integrated circuits design
is beneficial, especially for low energy requirements. The new devices have
unique features and properties that provide security advantages. However, these
properties may come to the aid of an adversary to design stronger attacks.
Therefore, the advantages as well as the disadvantages of these technologies
need to be well studied. This paper demonstrates the area and power efficiency
of the tunnel field-effect transistor (TFET) technology along with analyzing
its security aspects.
","[{'version': 'v1', 'created': 'Tue, 25 Apr 2017 19:33:21 GMT'}]",2017-04-27,"[['Taheri', 'Shayan', ''], ['Yuan', 'Jiann-Shiun', '']]","['Hardware Security', 'Tunnel Field Effect Transistor', 'Advanced Encryption Standard', 'FabScalar']"
13759,1510.07480,Felipe Olmos,"Felipe Olmos, Bruno Kauffmann",An Inverse Problem Approach for Content Popularity Estimation,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Internet increasingly focuses on content, as exemplified by the now
popular Information Centric Networking paradigm. This means, in particular,
that estimating content popularities becomes essential to manage and distribute
content pieces efficiently. In this paper, we show how to properly estimate
content popularities from a traffic trace.
  Specifically, we consider the problem of the popularity inference in order to
tune content-level performance models, e.g. caching models. In this context,
special care must be brought on the fact that an observer measures only the
flow of requests, which differs from the model parameters, though both
quantities are related by the model assumptions. Current studies, however,
ignore this difference and use the observed data as model parameters. In this
paper, we highlight the inverse problem that consists in determining parameters
so that the flow of requests is properly predicted by the model. We then show
how such an inverse problem can be solved using Maximum Likelihood Estimation.
Based on two large traces from the Orange network and two synthetic datasets,
we eventually quantify the importance of this inversion step for the
performance evaluation accuracy.
","[{'version': 'v1', 'created': 'Mon, 26 Oct 2015 13:54:47 GMT'}]",2015-10-27,"[['Olmos', 'Felipe', ''], ['Kauffmann', 'Bruno', '']]","['Popularity Distribution', 'Mixture Model', 'Maximum Likelihood Estimation', 'Performance models', 'Caching']"
13760,1701.04783,Lei Zheng,"Lei Zheng, Vahid Noroozi, Philip S. Yu",Joint Deep Modeling of Users and Items Using Reviews for Recommendation,WSDM 2017,,,,cs.LG cs.IR,http://creativecommons.org/licenses/by/4.0/,"  A large amount of information exists in reviews written by users. This source
of information has been ignored by most of the current recommender systems
while it can potentially alleviate the sparsity problem and improve the quality
of recommendations. In this paper, we present a deep model to learn item
properties and user behaviors jointly from review text. The proposed model,
named Deep Cooperative Neural Networks (DeepCoNN), consists of two parallel
neural networks coupled in the last layers. One of the networks focuses on
learning user behaviors exploiting reviews written by the user, and the other
one learns item properties from the reviews written for the item. A shared
layer is introduced on the top to couple these two networks together. The
shared layer enables latent factors learned for users and items to interact
with each other in a manner similar to factorization machine techniques.
Experimental results demonstrate that DeepCoNN significantly outperforms all
baseline recommender systems on a variety of datasets.
","[{'version': 'v1', 'created': 'Tue, 17 Jan 2017 17:46:04 GMT'}]",2017-01-18,"[['Zheng', 'Lei', ''], ['Noroozi', 'Vahid', ''], ['Yu', 'Philip S.', '']]","['Recommender Systems', 'Deep Learning', 'Convolutional Neural Networks', 'Rating Prediction']"
13761,1406.6012,Georg Groh,"Niklas Kl\""ugel and Timo Becker and Georg Groh",Designing Sound Collaboratively - Perceptually Motivated Audio Synthesis,Extended version of submission to conference proceedings,,,,cs.MM cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this contribution, we will discuss a prototype that allows a group of
users to design sound collaboratively in real time using a multi-touch
tabletop. We make use of a machine learning method to generate a mapping from
perceptual audio features to synthesis parameters. This mapping is then used
for visualization and interaction. Finally, we discuss the results of a
comparative evaluation study.
","[{'version': 'v1', 'created': 'Mon, 23 Jun 2014 18:29:59 GMT'}]",2014-06-24,"[['Klügel', 'Niklas', ''], ['Becker', 'Timo', ''], ['Groh', 'Georg', '']]","['Collaborative Music Making', 'Creativity Support', 'MachineLearning', 'Sound Design']"
13762,1708.01696,Rodrigo de Lamare,Andr\'e Flores and Rodrigo C. de Lamare,"Study of Sparsity-Aware Set-Membership Adaptive Algorithms with
  Adjustable Penalties","4 figures, 2 tables",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose sparsity-aware data-selective adaptive filtering
algorithms with adjustable penalties. Prior work incorporates a penalty
function into the cost function used in the optimization that originates the
algorithms to improve their performance by exploiting sparsity. However, the
strength of the penalty function is controlled by a scalar that is often a
fixed parameter. In contrast to prior work, we develop a framework to derive
algorithms that automatically adjust the penalty function parameter and the
step size to achieve a better performance. Simulations for a system
identification application show that the proposed algorithms outperform in
convergence speed existing sparsity-aware algorithms.
","[{'version': 'v1', 'created': 'Sat, 5 Aug 2017 01:41:00 GMT'}]",2017-08-08,"[['Flores', 'André', ''], ['de Lamare', 'Rodrigo C.', '']]","['Adaptive filtering', 'sparsity-aware algorithms', 'setmembership algorithms']"
13763,1510.01125,Paul Muhlethaler,"Fatma Marzouk, Rachid Zagrouba, Anis Laouiti (SAMOVAR), Paul
  Muhlethaler (EVA)",An empirical study of Unfairness and Oscillation in ETSI DCC,,"International Conference on Performance Evalutaion and Modeling in
  Wired and Wireless networks PEMWN' 2015, Nov 2015, Hammamet, Tunisia",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  -Performance of Vehicular Adhoc Networks (VANETs) in high node density
situation has long been a major field of studies. Particular attention has been
paid to the frequent exchange of Cooperative Awareness Messages (CAMs) on which
many road safety applications rely. In the present paper, se focus on the
European Telecommunications Standard Institute (ETSI) Decentralized Congestion
Control (DCC) mechanism, particularly on the evaluation of its facility layers
component when applied in the context of dense networks. For this purpose, a
set of simulations has been conducted over several scenarios, considering rural
highway and urban mobility in order to investigate unfairness and oscillation
issues, and analyze the triggering factors. The experimental results show that
the latest technical specification of the ETSI DCC presents a significant
enhancement in terms of fairness. In contrast, the stability criterion leaves
room for improvement as channel load measurement presents (i) considerable
fluctuations when only the facility layer control is applied and (i.i) severe
state oscillation when different DCC control methods are combined.
","[{'version': 'v1', 'created': 'Mon, 5 Oct 2015 12:22:15 GMT'}]",2015-10-06,"[['Marzouk', 'Fatma', '', 'SAMOVAR'], ['Zagrouba', 'Rachid', '', 'SAMOVAR'], ['Laouiti', 'Anis', '', 'SAMOVAR'], ['Muhlethaler', 'Paul', '', 'EVA']]","['component; CAM', 'DCC', 'VANET', 'ETSI-ITS']"
13764,1410.0531,Fredrick Ishengoma,Fredrick Romanus Ishengoma,Online Social Networks and Terrorism 2.0 in Developing Countries,11 pages,"International Journal of Computer Science and Network Solutions,
  Volume 1, Issue 4, December 2013",,,cs.CY cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The advancement in technology has brought a new era in terrorism where Online
Social Networks have become a major platform of communication with wide range
of usage from message channeling to propaganda and recruitment of new followers
in terrorist groups. Meanwhile, during the terrorist attacks people use social
networks for information exchange, mobilizing and uniting and raising money for
the victims. This paper critically analyses the specific usage of social
networks in the times of terrorism attacks in developing countries.
","[{'version': 'v1', 'created': 'Thu, 2 Oct 2014 12:52:24 GMT'}]",2014-10-03,"[['Ishengoma', 'Fredrick Romanus', '']]","['Developing Countries', 'Online Social Networks', 'Terrorism 2.0', 'Twitter and Westgate']"
13765,1606.03871,Wenhan Yang,"Jiaying Liu, Wenhan Yang, Xiaoyan Sun, Wenjun Zeng","Photo Stylistic Brush: Robust Style Transfer via Superpixel-Based
  Bipartite Graph",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rapid development of social network and multimedia technology,
customized image and video stylization has been widely used for various
social-media applications. In this paper, we explore the problem of
exemplar-based photo style transfer, which provides a flexible and convenient
way to invoke fantastic visual impression. Rather than investigating some fixed
artistic patterns to represent certain styles as was done in some previous
works, our work emphasizes styles related to a series of visual effects in the
photograph, e.g. color, tone, and contrast. We propose a photo stylistic brush,
an automatic robust style transfer approach based on Superpixel-based BIpartite
Graph (SuperBIG). A two-step bipartite graph algorithm with different
granularity levels is employed to aggregate pixels into superpixels and find
their correspondences. In the first step, with the extracted hierarchical
features, a bipartite graph is constructed to describe the content similarity
for pixel partition to produce superpixels. In the second step, superpixels in
the input/reference image are rematched to form a new superpixel-based
bipartite graph, and superpixel-level correspondences are generated by a
bipartite matching. Finally, the refined correspondence guides SuperBIG to
perform the transformation in a decorrelated color space. Extensive
experimental results demonstrate the effectiveness and robustness of the
proposed method for transferring various styles of exemplar images, even for
some challenging cases, such as night images.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2016 09:28:19 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Jul 2016 09:05:02 GMT'}]",2016-07-18,"[['Liu', 'Jiaying', ''], ['Yang', 'Wenhan', ''], ['Sun', 'Xiaoyan', ''], ['Zeng', 'Wenjun', '']]","['Image stylization', 'superpixel', 'bipartite graph', 'stylistic brush']"
13766,1403.6367,Shuling  Wang,Shuling Wang and Flemming Nielson and Hanne Riis Nielson,A Framework for Hybrid Systems with Denial-of-Service Security Attack,"19 pages, 1 figures, the short version was accepted by FORTE 2014",,,,cs.LO cs.CR cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hybrid systems are integrations of discrete computation and continuous
physical evolution. The physical components of such systems introduce safety
requirements, the achievement of which asks for the correct monitoring and
control from the discrete controllers. However, due to denial-of-service
security attack, the expected information from the controllers is not received
and as a consequence the physical systems may fail to behave as expected. This
paper proposes a formal framework for expressing denial-of-service security
attack in hybrid systems. As a virtue, a physical system is able to plan for
reasonable behavior in case the ideal control fails due to unreliable
communication, in such a way that the safety of the system upon
denial-of-service is still guaranteed. In the context of the modeling language,
we develop an inference system for verifying safety of hybrid systems, without
putting any assumptions on how the environments behave. Based on the inference
system, we implement an interactive theorem prover and have applied it to check
an example taken from train control system.
","[{'version': 'v1', 'created': 'Mon, 24 Mar 2014 14:51:26 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Mar 2014 04:05:18 GMT'}]",2014-03-28,"[['Wang', 'Shuling', ''], ['Nielson', 'Flemming', ''], ['Nielson', 'Hanne Riis', '']]","['Hybrid systems', 'Denial-of-service', 'Safety verification', 'Inference system']"
13767,1610.09080,Taras Lakoba,"Taras I. Lakoba, Zihao Deng","Stability analysis of the numerical Method of characteristics applied to
  a class of energy-preserving systems. Part II: Nonreflecting boundary
  conditions","38 pages, 13 figures",,,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that imposition of non-periodic, in place of periodic, boundary
conditions (BC) can alter stability of modes in the Method of characteristics
(MoC) employing certain ordinary-differential equation (ODE) numerical solvers.
Thus, using non-periodic BC may render some of the MoC schemes stable for most
practical computations, even though they are unstable for periodic BC. This
fact contradicts a statement, found in some literature, that an instability
detected by the von Neumann analysis for a given numerical scheme implies an
instability of that scheme with arbitrary (i.e., non-periodic) BC. We explain
the mechanism behind this contradiction. We also show that, and explain why,
for the MoC employing some other ODE solvers, stability of the modes may be
unaffected by the BC.
","[{'version': 'v1', 'created': 'Fri, 28 Oct 2016 04:47:59 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Jul 2017 18:28:22 GMT'}]",2017-07-31,"[['Lakoba', 'Taras I.', ''], ['Deng', 'Zihao', '']]","['Method of characteristics', 'Coupled-wave equations', 'Numerical instability', 'Non']"
13768,1307.3586,Noah Stein,"Noah D. Stein, Asuman Ozdaglar, Pablo A. Parrilo","Exchangeable Equilibria, Part I: Symmetric Bimatrix Games",,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the notion of exchangeable equilibria of a symmetric bimatrix
game, defined as those correlated equilibria in which players' strategy choices
are conditionally independently and identically distributed given some hidden
variable. We give several game-theoretic interpretations and a version of the
""revelation principle"". Geometrically, the set of exchangeable equilibria is
convex and lies between the symmetric Nash equilibria and the symmetric
correlated equilibria. Exchangeable equilibria can achieve higher expected
utility than symmetric Nash equilibria.
","[{'version': 'v1', 'created': 'Fri, 12 Jul 2013 21:33:05 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Sep 2013 14:37:26 GMT'}, {'version': 'v3', 'created': 'Mon, 20 Jan 2014 15:14:14 GMT'}]",2014-01-21,"[['Stein', 'Noah D.', ''], ['Ozdaglar', 'Asuman', ''], ['Parrilo', 'Pablo A.', '']]","['Correlated equilibrium', 'exchangeability', 'equilibrium concepts', 'symmetric games']"
13769,0909.1412,Prashant Kushwah,"Munendra Agrawal, Prashant Kushwah and Sunder Lal",An Efficient and Publicly Verifiable Id-Based Multi-Signcryption Scheme,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-signcryption is used when different senders wants to authenticate a
single message without revealing it. This paper proposes a multi signcryption
scheme in which no pairing is computed on the signcryption stage and the
signatures can be verified publicly.
","[{'version': 'v1', 'created': 'Tue, 8 Sep 2009 07:39:31 GMT'}]",2009-09-09,"[['Agrawal', 'Munendra', ''], ['Kushwah', 'Prashant', ''], ['Lal', 'Sunder', '']]","['Identity based cryptography', 'Signcryption', 'Multi']"
13770,1712.03586,Reuben Binns Dr,Reuben Binns,Fairness in Machine Learning: Lessons from Political Philosophy,,"Proceedings of Machine Learning Research 81:149-159, 2018
  Conference on Fairness, Accountability, and Transparency",,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  What does it mean for a machine learning model to be `fair', in terms which
can be operationalised? Should fairness consist of ensuring everyone has an
equal probability of obtaining some benefit, or should we aim instead to
minimise the harms to the least advantaged? Can the relevant ideal be
determined by reference to some alternative state of affairs in which a
particular social pattern of discrimination does not exist? Various definitions
proposed in recent literature make different assumptions about what terms like
discrimination and fairness mean and how they can be defined in mathematical
terms. Questions of discrimination, egalitarianism and justice are of
significant interest to moral and political philosophers, who have expended
significant efforts in formalising and defending these central concepts. It is
therefore unsurprising that attempts to formalise `fairness' in machine
learning contain echoes of these old philosophical debates. This paper draws on
existing work in moral and political philosophy in order to elucidate emerging
debates about fair machine learning.
","[{'version': 'v1', 'created': 'Sun, 10 Dec 2017 20:39:03 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Jan 2018 14:10:09 GMT'}, {'version': 'v3', 'created': 'Tue, 23 Mar 2021 17:37:15 GMT'}]",2021-03-24,"[['Binns', 'Reuben', '']]","['fairness', 'discrimination', 'machinelearning', 'algorithmicdecisionmaking', 'egalitarianism']"
13771,1409.4507,Awny Sayed,Awny Sayed and Amal Almaqrashi,Scalable and Efficient Self-Join Processing technique in RDF data,"8-pages, 5-figures, International Journal of Computer Science Issues
  (IJCSI), Volume 11, Issue 2. April 2014",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efficient management of RDF data plays an important role in successfully
understanding and fast querying data. Although the current approaches of
indexing in RDF Triples such as property tables and vertically partitioned
solved many issues; however, they still suffer from the performance in the
complex self-join queries and insert data in the same table. As an improvement
in this paper, we propose an alternative solution to facilitate flexibility and
efficiency in that queries and try to reach to the optimal solution to decrease
the self-joins as much as possible, this solution based on the idea of
""Recursive Mapping of Twin Tables"". Our main goal of Recursive Mapping of Twin
Tables (RMTT) approach is divided the main RDF Triple into two tables which
have the same structure of RDF Triple and insert the RDF data recursively. Our
experimental results compared the performance of join queries in vertically
partitioned approach and the RMTT approach using very large RDF data, like DBLP
and DBpedia datasets. Our experimental results with a number of complex
submitted queries shows that our approach is highly scalable compared with
RDF-3X approach and RMTT reduces the number of self-joins especially in complex
queries 3-4 times than RDF-3X approach
","[{'version': 'v1', 'created': 'Tue, 16 Sep 2014 05:21:06 GMT'}]",2014-09-17,"[['Sayed', 'Awny', ''], ['Almaqrashi', 'Amal', '']]","['Semantic Web', 'RDF', 'RDF Storing', 'RDF Indexing', 'Self-join', 'Query Processing.   1']"
13772,1106.4141,Stefan Kratsch,Hans L. Bodlaender and Bart M. P. Jansen and Stefan Kratsch,Kernel Bounds for Path and Cycle Problems,,,,,cs.DS cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Connectivity problems like k-Path and k-Disjoint Paths relate to many
important milestones in parameterized complexity, namely the Graph Minors
Project, color coding, and the recent development of techniques for obtaining
kernelization lower bounds. This work explores the existence of polynomial
kernels for various path and cycle problems, by considering nonstandard
parameterizations. We show polynomial kernels when the parameters are a given
vertex cover, a modulator to a cluster graph, or a (promised) max leaf number.
We obtain lower bounds via cross-composition, e.g., for Hamiltonian Cycle and
related problems when parameterized by a modulator to an outerplanar graph.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2011 09:14:42 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Dec 2011 10:51:54 GMT'}]",2015-03-19,"[['Bodlaender', 'Hans L.', ''], ['Jansen', 'Bart M. P.', ''], ['Kratsch', 'Stefan', '']]","['parameterized complexity', 'kernelization', 'upper and lower bounds', 'graphs', 'path andcycle problems']"
13773,1603.07766,Ali Vatankhah Barenji Dr,"Ali Vatankhah barenji, Amir Shaygan, Reza Vatankhah Barenji","Simulation Platform for Multi Agent Based Manufacturing Control System
  Based on The Hybrid Agent",,,,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Agent based distributed manufacturing control and scheduling systems are
subsets of new manufacturing systems. Multi agent systems (MAS) not only drive
design and engineering control solutions but also influence flexibility,
agility, and re-configurability, which makes MASs a better centralized systems
than its traditional counterparts. However, implementation of all MASs in the
real factories are timely, also extremely costly. A simulation environment that
would allow independent development and testing of the services and business
processes of the related manufacturing hardware is needed. This paper presents
the design and implementation of a userfriendly simulation platform for multi
agent based manufacturing control systems by considering the shop floor level.
The proposed simulation platform can simulate the software level of the factory
by considering the hardware level of the mentioned factory. An example of the
simulation platform is presented for a flexible manufacturing system, which is
located in EMU CIM lab.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2016 21:59:32 GMT'}]",2016-04-05,"[['barenji', 'Ali Vatankhah', ''], ['Shaygan', 'Amir', ''], ['Barenji', 'Reza Vatankhah', '']]","['Multi-agent distributed manufacturing control system', 'Agility', 'Simulation']"
13774,1506.00590,Long Thai MSc,"Long Thai, Blesson Varghese, Adam Barker","Executing Bag of Distributed Tasks on Virtually Unlimited Cloud
  Resources",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bag-of-Distributed-Tasks (BoDT) application is the collection of identical
and independent tasks each of which requires a piece of input data located
around the world. As a result, Cloud computing offers an ef- fective way to
execute BoT application as it not only consists of multiple geographically
distributed data centres but also allows a user to pay for what she actually
uses only. In this paper, BoDT on the Cloud using virtually unlimited cloud
resources. A heuristic algorithm is proposed to find an execution plan that
takes budget constraints into account. Compared with other approaches, with the
same given budget, our algorithm is able to reduce the overall execution time
up to 50%.
","[{'version': 'v1', 'created': 'Mon, 1 Jun 2015 17:57:09 GMT'}]",2015-06-02,"[['Thai', 'Long', ''], ['Varghese', 'Blesson', ''], ['Barker', 'Adam', '']]","['Cloud Computing', 'Bag of Distributed Tasks', 'Cost And Performance Trade-off', 'Decentralised Execution']"
13775,1501.05425,Dmitriy Traytel,Jasmin Christian Blanchette and Andrei Popescu and Dmitriy Traytel,Foundational Extensible Corecursion,,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a formalized framework for defining corecursive functions
safely in a total setting, based on corecursion up-to and relational
parametricity. The end product is a general corecursor that allows corecursive
(and even recursive) calls under well-behaved operations, including
constructors. Corecursive functions that are well behaved can be registered as
such, thereby increasing the corecursor's expressiveness. The metatheory is
formalized in the Isabelle proof assistant and forms the core of a prototype
tool. The corecursor is derived from first principles, without requiring new
axioms or extensions of the logic.
","[{'version': 'v1', 'created': 'Thu, 22 Jan 2015 08:45:10 GMT'}]",2015-01-23,"[['Blanchette', 'Jasmin Christian', ''], ['Popescu', 'Andrei', ''], ['Traytel', 'Dmitriy', '']]","['(Co)recursion', 'parametricity', 'proof assistants', 'higher-order logic', 'Isabelle']"
13776,1207.4328,Zeno Toffano,Zeno Toffano and Bich-Lien Doan,Quantum-like Tests for Contextual Querying,"11 pages, 5 tables",,,,cs.IR quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tests are essential in Information Retrieval (IR), in order to evaluate the
effectiveness of a query. Tests intended to exhibit the sense of words in
con-text were undertaken and linked with Quantum Mechanics (QM). Poll tests
were undertaken on heterogeneous media such as music and polysemy in foreign
languages. Interference effects are shown in the results. Bell inequality was
used leading to a significant spread in the results of the poll tests but
without violating the classical limit. Then an automatic pertinence measure
tool on texts has been developed using the HAL algorithm using an orthonormal
vector decomposition model. In this case the spread in the values can lead to
the violation of the Bell inequality even beyond Cirel'son bound.
","[{'version': 'v1', 'created': 'Wed, 18 Jul 2012 10:23:37 GMT'}]",2012-07-19,"[['Toffano', 'Zeno', ''], ['Doan', 'Bich-Lien', '']]","['information retrieval', 'tests', 'context', 'IR algorithms', 'quantum mechanics', 'interference', 'Bell inequality', 'entanglement']"
13777,1512.00524,Marc Juarez,"Marc Juarez, Mohsen Imani, Mike Perry, Claudia Diaz, Matthew Wright",Toward an Efficient Website Fingerprinting Defense,"To appear In the proceedings of the European Symposium on Research in
  Computer Security (ESORICS), pp. 20, Springer, 2016",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Website Fingerprinting attacks enable a passive eavesdropper to recover the
user's otherwise anonymized web browsing activity by matching the observed
traffic with prerecorded web traffic templates. The defenses that have been
proposed to counter these attacks are impractical for deployment in real-world
systems due to their high cost in terms of added delay and bandwidth overhead.
Further, these defenses have been designed to counter attacks that, despite
their high success rates, have been criticized for assuming unrealistic attack
conditions in the evaluation setting. In this paper, we propose a novel,
lightweight defense based on Adaptive Padding that provides a sufficient level
of security against website fingerprinting, particularly in realistic
evaluation conditions. In a closed-world setting, this defense reduces the
accuracy of the state-of-the-art attack from 91% to 20%, while introducing zero
latency overhead and less than 60% bandwidth overhead. In an open-world, the
attack precision is just 1% and drops further as the number of sites grows.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2015 00:14:16 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Mar 2016 19:25:56 GMT'}, {'version': 'v3', 'created': 'Tue, 19 Jul 2016 10:18:51 GMT'}]",2016-07-20,"[['Juarez', 'Marc', ''], ['Imani', 'Mohsen', ''], ['Perry', 'Mike', ''], ['Diaz', 'Claudia', ''], ['Wright', 'Matthew', '']]","['privacy', 'anonymous communications', 'website fingerprinting']"
13778,1412.2196,Hongyang Zhang,"Hongyang Zhang, Zhouchen Lin, Chao Zhang, Junbin Gao",Relations among Some Low Rank Subspace Recovery Models,Submitted to Neural Computation,,,,cs.LG math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recovering intrinsic low dimensional subspaces from data distributed on them
is a key preprocessing step to many applications. In recent years, there has
been a lot of work that models subspace recovery as low rank minimization
problems. We find that some representative models, such as Robust Principal
Component Analysis (R-PCA), Robust Low Rank Representation (R-LRR), and Robust
Latent Low Rank Representation (R-LatLRR), are actually deeply connected. More
specifically, we discover that once a solution to one of the models is
obtained, we can obtain the solutions to other models in closed-form
formulations. Since R-PCA is the simplest, our discovery makes it the center of
low rank subspace recovery models. Our work has two important implications.
First, R-PCA has a solid theoretical foundation. Under certain conditions, we
could find better solutions to these low rank models at overwhelming
probabilities, although these models are non-convex. Second, we can obtain
significantly faster algorithms for these models by solving R-PCA first. The
computation cost can be further cut by applying low complexity randomized
algorithms, e.g., our novel $\ell_{2,1}$ filtering algorithm, to R-PCA.
Experiments verify the advantages of our algorithms over other state-of-the-art
ones that are based on the alternating direction method.
","[{'version': 'v1', 'created': 'Sat, 6 Dec 2014 03:25:12 GMT'}]",2014-12-09,"[['Zhang', 'Hongyang', ''], ['Lin', 'Zhouchen', ''], ['Zhang', 'Chao', ''], ['Gao', 'Junbin', '']]","['Low Rank', 'Relations among Models', 'ℓ2', '1 Filtering Algorithm']"
13779,1205.1190,Sidiq Hidayat Sidiq Syamsul Hidayat,"Sidiq S. Hidayat, Bong Keung Kim and Kohtaro Ohba",An Approach For Robots To Deal With Objects,,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding object and its context are very important for robots when
dealing with objects for completion of a mission. In this paper, an
Affordance-based Ontology (ABO) is proposed for easy robot dealing with
substantive and non-substantive objects. An ABO is a machine-understandable
representation of objects and their relationships by what it's related to and
how it's related. By using ABO, when dealing with a substantive object, robots
can understand the representation of its object and its relation with other
non-substantive objects. When the substantive object is not available, the
robots have the understanding ability, in term of objects and their functions
to select a non substantive object in order to complete the mission, such as
giving raincoat or hat instead of getting stuck due to the unavailability of
substantive object, e.g. umbrella. The experiment is done in the Ubiquitous
Robotics Technology (u-RT) Space of National Institute of Advanced Industrial
Science and Technology (AIST), Tsukuba, Japan.
","[{'version': 'v1', 'created': 'Sun, 6 May 2012 08:08:03 GMT'}]",2012-05-08,"[['Hidayat', 'Sidiq S.', ''], ['Kim', 'Bong Keung', ''], ['Ohba', 'Kohtaro', '']]","['affordances', 'ontology', 'object & context understanding']"
13780,1401.1140,Axel Bacher,"Axel Bacher, Olivier Bodini, Alice Jacquot","Efficient random sampling of binary and unary-binary trees via holonomic
  equations",,,,,cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new uniform random sampler for binary trees with $n$ internal
nodes consuming $2n + \Theta(\log(n)^2)$ random bits on average. This makes it
quasi-optimal and out-performs the classical Remy algorithm. We also present a
sampler for unary-binary trees with $n$ nodes taking $\Theta(n)$ random bits on
average. Both are the first linear-time algorithms to be optimal up to a
constant.
","[{'version': 'v1', 'created': 'Mon, 6 Jan 2014 17:04:52 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Jan 2014 08:36:22 GMT'}]",2018-02-20,"[['Bacher', 'Axel', ''], ['Bodini', 'Olivier', ''], ['Jacquot', 'Alice', '']]","['Random Sampling', 'Remy Algorithm', 'Holonomic Equation', 'PlaneTrees']"
13781,1604.07564,Dietmar Berwanger,"Dietmar Berwanger, Anup Basil Mathew, R. Ramanujam",A Retraction Theorem for Distributed Synthesis,,,,,cs.DC cs.FL cs.GT cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a general theorem for distributed synthesis problems in
coordination games with $\omega$-regular objectives of the form: If there
exists a winning strategy for the coalition, then there exists an ""essential""
winning strategy, that is obtained by a retraction of the given one. In
general, this does not lead to finite-state winning strategies, but when the
knowledge of agents remains bounded, we can solve the synthesis problem. Our
study is carried out in a setting where objectives are expressed in terms of
events that may \emph{not} be observable. This is natural in games of imperfect
information, rather than the common assumption that objectives are expressed in
terms of events that are observable to all agents. We characterise decidable
distributed synthesis problems in terms of finiteness of knowledge states and
finite congruence classes induced by them.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2016 08:32:29 GMT'}]",2016-04-27,"[['Berwanger', 'Dietmar', ''], ['Mathew', 'Anup Basil', ''], ['Ramanujam', 'R.', '']]","['distributed synthesis', 'imperfect information', 'infinite games']"
13782,1004.2642,Mathieu Chapelle,Mathieu Chapelle,"W[1]-hardness of some domination-like problems parameterized by
  tree-width","Updated and corrected version; submitted to Theoretical Computer
  Science",,,,cs.CC cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The concept of generalized domination unifies well-known variants of
domination-like and independence problems, such as Dominating Set, Independent
Set, Perfect Code, etc. A generalized domination (also called
$[\sigma,\rho]$-Dominating Set}) problem consists in finding a subset of
vertices in a graph such that every vertex is satisfied with respect to two
given sets of constraints $\sigma$ and $\rho$. Very few problems are known not
to be FPT when parameterized by tree-width, as usually this restriction allows
one to write efficient algorithms to solve the considered problems. The main
result of this article is a proof that for some (infinitely many) sets $\sigma$
and $\rho$, the problem $\exists[\sigma,\rho]$-Dominating Set} is W[1]-hard
when parameterized by the tree-width of the input graph. This contrasts with
the current knowledge on the parameterized complexity of this problem when
parameterized by tree-width, which had only been studied for finite and
cofinite sets $\sigma$ and $\rho$ and for which it has been shown to be FPT.
","[{'version': 'v1', 'created': 'Thu, 15 Apr 2010 14:49:00 GMT'}, {'version': 'v2', 'created': 'Fri, 28 May 2010 08:00:53 GMT'}, {'version': 'v3', 'created': 'Tue, 29 Jun 2010 12:12:43 GMT'}, {'version': 'v4', 'created': 'Fri, 9 Jul 2010 16:26:39 GMT'}, {'version': 'v5', 'created': 'Thu, 28 Oct 2010 16:15:06 GMT'}, {'version': 'v6', 'created': 'Thu, 3 Apr 2014 14:09:48 GMT'}]",2014-04-04,"[['Chapelle', 'Mathieu', '']]","['parameterized complexity', 'domination-like problem', 'tree-width', 'graph algorithm']"
13783,1403.6290,Zhenfang Hu,"Zhenfang Hu, Gang Pan, Yueming Wang, Zhaohui Wu","Spectral Sparse Representation for Clustering: Evolved from PCA,
  K-means, Laplacian Eigenmap, and Ratio Cut",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dimensionality reduction, cluster analysis, and sparse representation are
basic components in machine learning. However, their relationships have not yet
been fully investigated. In this paper, we find that the spectral graph theory
underlies a series of these elementary methods and can unify them into a
complete framework. The methods include PCA, K-means, Laplacian eigenmap (LE),
ratio cut (Rcut), and a new sparse representation method developed by us,
called spectral sparse representation (SSR). Further, extended relations to
conventional over-complete sparse representations (e.g., method of optimal
directions, KSVD), manifold learning (e.g., kernel PCA, multidimensional
scaling, Isomap, locally linear embedding), and subspace clustering (e.g.,
sparse subspace clustering, low-rank representation) are incorporated. We show
that, under an ideal condition from the spectral graph theory, PCA, K-means,
LE, and Rcut are unified together. And when the condition is relaxed, the
unification evolves to SSR, which lies in the intermediate between PCA/LE and
K-mean/Rcut. An efficient algorithm, NSCrt, is developed to solve the sparse
codes of SSR. SSR combines merits of both sides: its sparse codes reduce
dimensionality of data meanwhile revealing cluster structure. For its inherent
relation to cluster analysis, the codes of SSR can be directly used for
clustering. Scut, a clustering approach derived from SSR reaches the
state-of-the-art performance in the spectral clustering family. The one-shot
solution obtained by Scut is comparable to the optimal result of K-means that
are run many times. Experiments on various data sets demonstrate the properties
and strengths of SSR, NSCrt, and Scut.
","[{'version': 'v1', 'created': 'Tue, 25 Mar 2014 10:52:15 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Sep 2014 14:18:15 GMT'}, {'version': 'v3', 'created': 'Thu, 28 Jul 2016 13:26:56 GMT'}, {'version': 'v4', 'created': 'Fri, 19 May 2017 09:30:55 GMT'}]",2017-05-22,"[['Hu', 'Zhenfang', ''], ['Pan', 'Gang', ''], ['Wang', 'Yueming', ''], ['Wu', 'Zhaohui', '']]","['sparse representation', 'spectral graph', 'dimensionality reduction', 'cluster analysis', 'PCA', 'K-means', 'spectral clustering', 'Laplacian eigenmap']"
13784,1301.3482,Fatemeh Rajabi-Alni,"Fatemeh Rajabi-Alni, Alireza Bagheri",Many to Many Matching with Demands and Capacities,"8 pages, 1 figure",,,,cs.DS cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let A and B be two finite sets of points with total cardinality n, the many
to many point matching with demands and capacities matches each point ai in A
to at least alpha'i and at most alphai points in B, and each point bj in B to
at least betaj and at most beta'j points in A for all 1 <= i <= s and 1 <= j <=
t. In this paper, we present an upper bound for this problem using our new
polynomial time algorithm.
","[{'version': 'v1', 'created': 'Tue, 15 Jan 2013 20:43:38 GMT'}]",2013-01-16,"[['Rajabi-Alni', 'Fatemeh', ''], ['Bagheri', 'Alireza', '']]","['many to many matching', 'Hungarian method', 'bipartite graph', 'points withdemands and capacities', 'minimum perfect matching']"
13785,1104.5534,F. Richard Yu,"F. Richard Yu, Bo Sun, Vikram Krishnamurthy, and Saqib Ali",QoS Provisioning for Multimedia Transmission in Cognitive Radio Networks,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In cognitive radio (CR) networks, the perceived reduction of application
layer quality of service (QoS), such as multimedia distortion, by secondary
users may impede the success of CR technologies. Most previous work in CR
networks ignores application layer QoS. In this paper we take an integrated
design approach to jointly optimize multimedia intra refreshing rate, an
application layer parameter, together with access strategy, and spectrum
sensing for multimedia transmission in a CR system with time varying wireless
channels. Primary network usage and channel gain are modeled as a finite state
Markov process. With channel sensing and channel state information errors, the
system state cannot be directly observed. We formulate the QoS optimization
problem as a partially observable Markov decision process (POMDP). A low
complexity dynamic programming framework is presented to obtain the optimal
policy. Simulation results show the effectiveness of the proposed scheme.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2011 02:01:25 GMT'}]",2011-05-02,"[['Yu', 'F. Richard', ''], ['Sun', 'Bo', ''], ['Krishnamurthy', 'Vikram', ''], ['Ali', 'Saqib', '']]","['Cognitive radio networks', 'multimedia', 'wireless networks']"
13786,1304.1000,Wil van der Aalst,Wil van der Aalst,Passages in Graphs,8 pages,,,BPM Center Report BPM-12-19,cs.DM math.CO,http://creativecommons.org/licenses/by/3.0/,"  Directed graphs can be partitioned in so-called passages. A passage P is a
set of edges such that any two edges sharing the same initial vertex or sharing
the same terminal vertex are both inside $P$ or are both outside of P. Passages
were first identified in the context of process mining where they are used to
successfully decompose process discovery and conformance checking problems. In
this article, we examine the properties of passages. We will show that passages
are closed under set operators such as union, intersection and difference.
Moreover, any passage is composed of so-called minimal passages. These
properties can be exploited when decomposing graph-based analysis and
computation problems.
","[{'version': 'v1', 'created': 'Wed, 3 Apr 2013 16:07:46 GMT'}]",2013-04-04,"[['van der Aalst', 'Wil', '']]","['Directed graphs', 'Process modeling', 'Decomposition']"
13787,1502.06230,Andjela Draganic,"Andjela Draganic, Irena Orovic, Nedjeljko Lekic, Milos Dakovic, Srdjan
  Stankovic",Hardware Architecture for Single Iteration Reconstruction Algorithm,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A hardware architecture for the single iteration algorithm is proposed in
this paper. Single iteration algorithm enables reconstruction of the full
signal when small number of signal samples is available. The algorithm is based
on the threshold calculation, and allows distinguishing between signal
components and noise that appears as a consequence of missing samples. The
proposed system for hardware realization is divided into three parts, each part
with different functionality. The system is suitable for the FPGA realization.
Realization of the blocks for which there are no standard components in FPGA,
is discussed as well.
","[{'version': 'v1', 'created': 'Sun, 22 Feb 2015 14:24:09 GMT'}]",2015-02-24,"[['Draganic', 'Andjela', ''], ['Orovic', 'Irena', ''], ['Lekic', 'Nedjeljko', ''], ['Dakovic', 'Milos', ''], ['Stankovic', 'Srdjan', '']]","['Compressive Sensing', 'FPGA', 'hardware', 'single iteration reconstruction algorithm', 'sparsity']"
13788,0802.1076,Damien Vergnaud,Damien Vergnaud,"New Extensions of Pairing-based Signatures into Universal (Multi)
  Designated Verifier Signatures",23 pages,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The concept of universal designated verifier signatures was introduced by
Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003. These signatures can be
used as standard publicly verifiable digital signatures but have an additional
functionality which allows any holder of a signature to designate the signature
to any desired verifier. This designated verifier can check that the message
was indeed signed, but is unable to convince anyone else of this fact. We
propose new efficient constructions for pairing-based short signatures. Our
first scheme is based on Boneh-Boyen signatures and its security can be
analyzed in the standard security model. We prove its resistance to forgery
assuming the hardness of the so-called strong Diffie-Hellman problem, under the
knowledge-of-exponent assumption. The second scheme is compatible with the
Boneh-Lynn-Shacham signatures and is proven unforgeable, in the random oracle
model, under the assumption that the computational bilinear Diffie-Hellman
problem is untractable. Both schemes are designed for devices with constrained
computation capabilities since the signing and the designation procedure are
pairing-free. Finally, we present extensions of these schemes in the multi-user
setting proposed by Desmedt in 2003.
","[{'version': 'v1', 'created': 'Thu, 7 Feb 2008 23:35:41 GMT'}]",2008-02-11,"[['Vergnaud', 'Damien', '']]","['pairing-based cryptography', 'designated verifier signature', 'security analysis']"
13789,1412.4737,Volker Diekert,"Volker Diekert, Florent Martin, Geraud Senizergues, Pedro V. Silva",Equations over free inverse monoids with idempotent variables,"28 pages. The conference version of this paper appeared in the
  proceedings of 10th International Computer Science Symposium in Russia, CSR
  2015, Listvyanka, Russia, July 13-17, 2015. Springer LNCS 9139, pp. 173-188
  (2015)",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the notion of idempotent variables for studying equations in
inverse monoids.
  It is proved that it is decidable in singly exponential time (DEXPTIME)
whether a system of equations in idempotent variables over a free inverse
monoid has a solution. The result is proved by a direct reduction to solve
language equations with one-sided concatenation and a known complexity result
by Baader and Narendran: Unification of concept terms in description logics,
2001. We also show that the problem becomes DEXPTIME hard , as soon as the
quotient group of the free inverse monoid has rank at least two.
  Decidability for systems of typed equations over a free inverse monoid with
one irreducible variable and at least one unbalanced equation is proved with
the same complexity for the upper bound.
  Our results improve known complexity bounds by Deis, Meakin, and Senizergues:
Equations in free inverse monoids, 2007.
  Our results also apply to larger families of equations where no decidability
has been previously known.
","[{'version': 'v1', 'created': 'Thu, 11 Dec 2014 17:01:12 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Sep 2015 10:38:55 GMT'}]",2015-09-28,"[['Diekert', 'Volker', ''], ['Martin', 'Florent', ''], ['Senizergues', 'Geraud', ''], ['Silva', 'Pedro V.', '']]","['equation', 'language equation', 'free inverse monoid', 'idempotentvariable', 'one-variable equation']"
13790,1605.01741,Norah Abokhodair,"Norah Abokhodair, Sofiane Abbar, Sarah Vieweg, Yelena Mejova",Privacy and Twitter in Qatar: Traditional Values in the Digital World,"10 pages, Conference paper published at WebSci",,,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore the meaning of privacy from the perspective of Qatari nationals as
it manifests in digital environments. Although privacy is an essential and
widely respected value in many cultures, the way in which it is understood and
enacted depends on context. It is especially vital to understand user behaviors
regarding privacy in the digital sphere, where individuals increasingly publish
personal information. Our mixed-methods analysis of 18K Twitter posts that
mention privacy focuses on the face to face and digital contexts in which
privacy is mentioned, and how those contexts lead to varied ideologies
regarding privacy. We find that in the Arab Gulf, the need for privacy is often
supported by Quranic text, advice on how to protect privacy is frequently
discussed, and the use of paternalistic language by men when discussing women
related privacy is common. Above all, privacy is framed as a communal
attribute, including not only the individual, but the behavior of those around
them; it even extends beyond the individual lifespan. We contribute an analysis
and description of these previously unexplored interpretations of privacy,
which play a role in how users navigate social media.
","[{'version': 'v1', 'created': 'Thu, 5 May 2016 20:03:58 GMT'}]",2016-05-09,"[['Abokhodair', 'Norah', ''], ['Abbar', 'Sofiane', ''], ['Vieweg', 'Sarah', ''], ['Mejova', 'Yelena', '']]","['• Security', 'privacy à\uf0e0Social aspects of security', 'privacy   • Human-centered computing à\uf0e0Social media']"
13791,1110.4285,Leto Peel,Leto Peel,Topological Feature Based Classification,"Awarded 3rd Best Student Paper at 14th International Conference on
  Information Fusion 2011",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There has been a lot of interest in developing algorithms to extract clusters
or communities from networks. This work proposes a method, based on
blockmodelling, for leveraging communities and other topological features for
use in a predictive classification task. Motivated by the issues faced by the
field of community detection and inspired by recent advances in Bayesian topic
modelling, the presented model automatically discovers topological features
relevant to a given classification task. In this way, rather than attempting to
identify some universal best set of clusters for an undefined goal, the aim is
to find the best set of clusters for a particular purpose.
  Using this method, topological features can be validated and assessed within
a given context by their predictive performance.
  The proposed model differs from other relational and semi-supervised learning
models as it identifies topological features to explain the classification
decision. In a demonstration on a number of real networks the predictive
capability of the topological features are shown to rival the performance of
content based relational learners. Additionally, the model is shown to
outperform graph-based semi-supervised methods on directed and approximately
bipartite networks.
","[{'version': 'v1', 'created': 'Tue, 18 Oct 2011 15:16:25 GMT'}]",2011-10-20,"[['Peel', 'Leto', '']]","['Social Networks', 'Blockmodelling', 'Node Classification']"
13792,1407.2323,Guillaume Ducoffe,"Mathias Lecuyer, Guillaume Ducoffe, Francis Lan, Andrei Papancea,
  Theofilos Petsios, Riley Spahn, Augustin Chaintreau, and Roxana Geambasu",XRay: Enhancing the Web's Transparency with Differential Correlation,"Extended version of a paper presented at the 23rd USENIX Security
  Symposium (USENIX Security 14)",,,,cs.NI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today's Web services - such as Google, Amazon, and Facebook - leverage user
data for varied purposes, including personalizing recommendations, targeting
advertisements, and adjusting prices. At present, users have little insight
into how their data is being used. Hence, they cannot make informed choices
about the services they choose. To increase transparency, we developed XRay,
the first fine-grained, robust, and scalable personal data tracking system for
the Web. XRay predicts which data in an arbitrary Web account (such as emails,
searches, or viewed products) is being used to target which outputs (such as
ads, recommended products, or prices). XRay's core functions are service
agnostic and easy to instantiate for new services, and they can track data
within and across services. To make predictions independent of the audited
service, XRay relies on the following insight: by comparing outputs from
different accounts with similar, but not identical, subsets of data, one can
pinpoint targeting through correlation. We show both theoretically, and through
experiments on Gmail, Amazon, and YouTube, that XRay achieves high precision
and recall by correlating data from a surprisingly small number of extra
accounts.
","[{'version': 'v1', 'created': 'Wed, 9 Jul 2014 00:48:37 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Oct 2014 09:25:02 GMT'}]",2014-10-08,"[['Lecuyer', 'Mathias', ''], ['Ducoffe', 'Guillaume', ''], ['Lan', 'Francis', ''], ['Papancea', 'Andrei', ''], ['Petsios', 'Theofilos', ''], ['Spahn', 'Riley', ''], ['Chaintreau', 'Augustin', ''], ['Geambasu', 'Roxana', '']]","['such as “cancer', '” “AIDS', '” “bankruptcy', '” and “unemployment']"
13793,1412.3984,Frank Hoffmann,"Frank Hoffmann, Klaus Kriegel, and Max Willert","Almost Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal
  Galleries","18 pages, 9 figures",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address recently proposed chromatic versions of the classic Art Gallery
Problem. Assume a simple polygon $P$ is guarded by a finite set of point guards
and each guard is assigned one of $t$ colors. Such a chromatic guarding is said
to be conflict-free if each point $p\in P$ sees at least one guard with a
unique color among all guards visible from $p$. The goal is to establish bounds
on the function $\chi_{cf}(n)$ of the number of colors sufficient to guarantee
the existence of a conflict-free chromatic guarding for any $n$-vertex polygon.
B\""artschi and Suri showed $\chi_{cf}(n)\in O(\log n)$ (Algorithmica, 2014) for
simple orthogonal polygons and the same bound applies to general simple
polygons (B\""artschi et al., SoCG 2014). In this paper, we assume the
r-visibility model instead of standard line visibility. Points $p$ and $q$ in
an orthogonal polygon are r-visible to each other if the rectangle spanned by
the points is contained in $P$. For this model we show $\chi_{cf}(n)\in
O(\log\log n)$ and $\chi_{cf}(n)\in \Omega(\log\log n /\log\log\log n)$. Most
interestingly, we can show that the lower bound proof extends to guards with
line visibility. To this end we introduce and utilize a novel discrete
combinatorial structure called multicolor tableau. This is the first
non-trivial lower bound for this problem setting.Furthermore, for the strong
chromatic version of the problem, where all guards r-visible from a point must
have distinct colors, we prove a $\Theta(\log n)$-bound. Our results can be
interpreted as coloring results for special geometric hypergraphs.
","[{'version': 'v1', 'created': 'Fri, 12 Dec 2014 13:18:47 GMT'}]",2014-12-15,"[['Hoffmann', 'Frank', ''], ['Kriegel', 'Klaus', ''], ['Willert', 'Max', '']]","['Orthogonal polygons', 'art gallery problem', 'hypergraph coloring']"
13794,1504.02333,Maciej  Skorski,Maciej Skorski,"Lower bounds on $q$-wise independence tails and applications to
  min-entropy condensers",,,,,cs.CR math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present novel and sharp lower bounds for higher load moments in the
classical problem of mapping $M$ balls into $N$ bins by $q$-universal hashing,
specialized to the case when $M=N$. As a corollary we prove a tight counterpart
for the result about min-entropy condensers due to Dodis, Pietrzak and Wichs
(CRYPTO'14), which has found important applications in key derivation. It
states that condensing $k$ bits of min-entropy into a $k$-bit string
$\epsilon$-close to almost full min-entropy (precisely $
k-\log\log(1/\epsilon)$ bits of entropy) can be achieved by the use of
$q$-independent hashing with $q= \log(1/\epsilon)$. We prove that when given a
source of min-entropy $k$ and aiming at entropy loss $\ell = \log\log
(1/\epsilon) - 3$, the independence level $q=(1-o(1))\log(1/\epsilon)$ is
necessary (for small values of $\epsilon$), which almost matches the positive
result. Besides these asymptotic bounds, we provide clear hard bounds in terms
of Bell numbers and some numerical examples. Our technique is based on an
explicit representation of the load moments in terms of Stirling numbers, some
asymptotic estimates on Stirling numbers and a tricky application of the
Paley-Zygmund inequality. \keywords{ min-entropy condensers, key derivation,
balls and bins hashing, anti-concentration inequalities }
","[{'version': 'v1', 'created': 'Thu, 9 Apr 2015 14:36:37 GMT'}]",2015-04-10,"[['Skorski', 'Maciej', '']]","['min-entropy condensers', 'key derivation', 'balls and bins hashing', 'anti-concentration inequalities']"
13795,1312.7223,Mahima Sharma,"Rashmi Gupta, Nisheeth Joshi, Iti Mathur",Quality Estimation of English-Hindi Outputs using Naive Bayes Classifier,"In Proceedings of 2013 International Conference on Advances in
  Computing, Communications and Informatics",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present an approach for estimating the quality of machine
translation system. There are various methods for estimating the quality of
output sentences, but in this paper we focus on Na\""ive Bayes classifier to
build model using features which are extracted from the input sentences. These
features are used for finding the likelihood of each of the sentences of the
training data which are then further used for determining the scores of the
test data. On the basis of these scores we determine the class labels of the
test data.
","[{'version': 'v1', 'created': 'Fri, 27 Dec 2013 09:39:52 GMT'}]",2013-12-30,"[['Gupta', 'Rashmi', ''], ['Joshi', 'Nisheeth', ''], ['Mathur', 'Iti', '']]","['Quality Estimation', 'Confidence Estimation', 'Naïve Bayes']"
13796,1712.03935,Gaurav Bhatt,"Gaurav Bhatt, Aman Sharma, Shivam Sharma, Ankush Nagpal,
  Balasubramanian Raman, and Ankush Mittal","On the Benefit of Combining Neural, Statistical and External Features
  for Fake News Identification",Source code available at - www.deeplearn-ai.com,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identifying the veracity of a news article is an interesting problem while
automating this process can be a challenging task. Detection of a news article
as fake is still an open question as it is contingent on many factors which the
current state-of-the-art models fail to incorporate. In this paper, we explore
a subtask to fake news identification, and that is stance detection. Given a
news article, the task is to determine the relevance of the body and its claim.
We present a novel idea that combines the neural, statistical and external
features to provide an efficient solution to this problem. We compute the
neural embedding from the deep recurrent model, statistical features from the
weighted n-gram bag-of-words model and handcrafted external features with the
help of feature engineering heuristics. Finally, using deep neural layer all
the features are combined, thereby classifying the headline-body news pair as
agree, disagree, discuss, or unrelated. We compare our proposed technique with
the current state-of-the-art models on the fake news challenge dataset. Through
extensive experiments, we find that the proposed model outperforms all the
state-of-the-art techniques including the submissions to the fake news
challenge.
","[{'version': 'v1', 'created': 'Mon, 11 Dec 2017 18:32:11 GMT'}]",2017-12-12,"[['Bhatt', 'Gaurav', ''], ['Sharma', 'Aman', ''], ['Sharma', 'Shivam', ''], ['Nagpal', 'Ankush', ''], ['Raman', 'Balasubramanian', ''], ['Mittal', 'Ankush', '']]","['External features', 'Statistical features', 'Word embeddings', 'Fake news', 'Deep learning']"
13797,1307.3638,Gaurav  Soni GS,"Gaurav Soni, Kamlesh Chandravanshi",A Nobel Defence Scheme Against Selfish Node Attack in MANET,"5 tables, 4 figures, 13 references","International Journal on Computational Science &
  Applications(IJCSA) 2013 ISSN: 2200-0011 is a AIRCC journel",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security is one of the major issue in wired and wireless network but due to
the presence of centralized administration not difficult to find out
misbehavior in network other than in Mobile Ad hoc Network due to the absence
of centralized management and frequently changes in topology security is one of
a major issue in MANET. Only prevention methods for attack are not enough. In
this paper a new Intrusion Detection System (IDS) algorithm has proposed
against selfish node attack to secure MANET. Here the behavior of selfish node
is unnecessary flooding the information in network and block all types of
packets transferring between the reliable nodes. Proposed IDS Algorithm
identifies the behavior of selfish node and also blocked their misbehavior
activities. In case of selfish node attack network performance is almost
negligible but after applying IDS on attack network performance is enhanced up
to 92% and provides 0% Infection rate from attack.
","[{'version': 'v1', 'created': 'Sat, 13 Jul 2013 10:15:55 GMT'}]",2013-07-16,"[['Soni', 'Gaurav', ''], ['Chandravanshi', 'Kamlesh', '']]","['IDS', 'Misbehavio', 'MANET', 'Security', 'Selfish node attack']"
13798,1705.07410,Joydeep Banerjee,"Joydeep Banerjee, Anamitra Pal, Kaustav Basu, Malhar Padhee, Arunabha
  Sen","Finding $K$ Contingency List in Power Networks using a New Model of
  Dependency",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smart grid systems are composed of power and communication network
components. The components in either network exhibit complex dependencies on
components in its own as well as the other network to drive their
functionality. Existing, models fail to capture these complex dependencies. In
this paper, we restrict to the dependencies in the power network and propose
the Multi-scale Implicative Interdependency Relation (MIIR) model that address
the existing limitations. A formal description of the model along with its
working dynamics and a brief validation with respect to the 2011 Southwest
blackout are provided. Utilizing the MIIR model, the $K$ Contingency List
problem is proposed. For a given time instant, the problem solves for a set of
$K$ entities in a power network which when failed at that time instant would
cause the maximum number of entities to fail eventually. Owing to the problem
being NP-complete we devised a Mixed Integer Program (MIP) to obtain the
optimal solution and a polynomial time sub-optimal heuristic. The efficacy of
the heuristic with respect to the MIP is compared by using different bus system
data. In general, the heuristic is shown to provide near optimal solution at a
much faster time than the MIP.
","[{'version': 'v1', 'created': 'Sun, 21 May 2017 08:09:54 GMT'}]",2017-05-23,"[['Banerjee', 'Joydeep', ''], ['Pal', 'Anamitra', ''], ['Basu', 'Kaustav', ''], ['Padhee', 'Malhar', ''], ['Sen', 'Arunabha', '']]","['MIIR model', 'Power Network', 'Cascading failure', 'Mixed Integer Program', 'Heuristic', 'Contingency List']"
13799,1606.03898,Daniela Bubboloni,Daniela Bubboloni and Michele Gori,The flow network method,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose an in-depth analysis of a method, called the flow
network method, which associates with any network a complete and
quasi-transitive binary relation on its vertices. Such a method, originally
proposed by Gvozdik (1987), is based on the concept of maximum flow. Given a
competition involving two or more teams, the flow network method can be used to
build a relation on the set of teams which establishes, for every ordered pair
of teams, if the first one did at least as good as the second one in the
competition. Such a relation naturally induces procedures for ranking teams and
selecting the best $k$ teams of a competition. Those procedures are proved to
satisfy many desirable properties.
","[{'version': 'v1', 'created': 'Wed, 1 Jun 2016 15:35:01 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Feb 2017 20:34:27 GMT'}, {'version': 'v3', 'created': 'Fri, 12 Jan 2018 14:34:03 GMT'}]",2018-01-15,"[['Bubboloni', 'Daniela', ''], ['Gori', 'Michele', '']]","['Network', 'network flow', 'quasi-transitive relation', 'pairs comparison', 'ranking problem', 'Schulze method']"
13800,1702.07409,Suayb Arslan,\c{S}uayb \c{S}. Arslan,"Founsure 1.0: An Erasure Code Library with Efficient Repair and Update
  Features","Accepted to Elsevier SoftwareX, 2021",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Founsure is an open-source software library that implements a
multi-dimensional graph-based erasure coding entirely based on fast exclusive
OR (XOR) logic. Its implementation utilizes compiler optimizations and
multi-threading to generate the right assembly code for the given multi-core
CPU architecture with vector processing capabilities. Founsure possesses
important features that shall find various applications in modern data storage,
communication, and networked computer systems, in which the data needs
protection against device, hardware, and node failures. As data size reached
unprecedented levels, these systems have become hungry for network bandwidth,
computational resources, and average consumed power. To address that, the
proposed library provides a three-dimensional design space that trades off the
computational complexity, coding overhead, and data/node repair bandwidth to
meet different requirements of modern distributed data storage and processing
systems. Founsure library enables efficient encoding, decoding,
repairs/rebuilds, and updates while all the required data storage and
computations are distributed across the network nodes.
","[{'version': 'v1', 'created': 'Thu, 23 Feb 2017 22:22:18 GMT'}, {'version': 'v2', 'created': 'Sun, 14 Jan 2018 20:19:44 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Jan 2021 22:33:07 GMT'}]",2021-01-15,"[['Arslan', 'Şuayb Ş.', '']]","['Distributed Storage', 'Erasure Coding', 'Fountain Coding', 'Single InstructionMultiple Data (SIMD)', 'openMP', 'Reliability']"
13801,1610.06023,Jarek Duda dr,Jarek Duda,"Practical estimation of rotation distance and induced partial order for
  binary trees","5 pages, 8 figures",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tree rotations (left and right) are basic local deformations allowing to
transform between two unlabeled binary trees of the same size. Hence, there is
a natural problem of practically finding such transformation path with low
number of rotations, the optimal minimal number is called the rotation
distance. Such distance could be used for instance to quantify similarity
between two trees for various machine learning problems, for example to compare
hierarchical clusterings or arbitrarily chosen spanning trees of two graphs,
like in SMILES notation popular for describing chemical molecules.
  There will be presented inexpensive practical greedy algorithm for finding a
short rotation path, optimality of which has still to be determined. It uses
introduced partial order for binary trees of the same size: $t_1 \leq t_2$ iff
$t_2$ can be obtained from $t_1$ by a sequence of only right rotations.
Intuitively, the shortest rotation path should go through the least upper bound
or the greatest lower bound for this partial order. The algorithm finds a path
through candidates for both points in representation of binary tree as stack
graph: describing evolution of content of stack while processing a formula
described by a given binary tree. The article is accompanied with Mathematica
implementation of all used procedures (Appendix).
","[{'version': 'v1', 'created': 'Wed, 19 Oct 2016 14:17:15 GMT'}]",2016-10-20,"[['Duda', 'Jarek', '']]","['tree rotation', 'algorithmics', 'machine learning']"
13802,1511.00322,Cunsheng Ding,Cunsheng Ding and Pingzhi Yuan,Five Constructions of Permutation Polynomials over $\gf(q^2)$,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Four recursive constructions of permutation polynomials over $\gf(q^2)$ with
those over $\gf(q)$ are developed and applied to a few famous classes of
permutation polynomials. They produce infinitely many new permutation
polynomials over $\gf(q^{2^\ell})$ for any positive integer $\ell$ with any
given permutation polynomial over $\gf(q)$. A generic construction of
permutation polynomials over $\gf(2^{2m})$ with o-polynomials over $\gf(2^m)$
is also presented, and a number of new classes of permutation polynomials over
$\gf(2^{2m})$ are obtained.
","[{'version': 'v1', 'created': 'Sun, 1 Nov 2015 22:27:25 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Nov 2015 00:26:08 GMT'}]",2015-11-12,"[['Ding', 'Cunsheng', ''], ['Yuan', 'Pingzhi', '']]","['Hyperoval', 'permutation polynomials', 'o-polynomials']"
13803,1109.3911,Arun Maiya,"Arun S. Maiya, Tanya Y. Berger-Wolf",Benefits of Bias: Towards Better Characterization of Network Sampling,"9 pages; KDD 2011: 17th ACM SIGKDD Conference on Knowledge Discovery
  and Data Mining",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  From social networks to P2P systems, network sampling arises in many
settings. We present a detailed study on the nature of biases in network
sampling strategies to shed light on how best to sample from networks. We
investigate connections between specific biases and various measures of
structural representativeness. We show that certain biases are, in fact,
beneficial for many applications, as they ""push"" the sampling process towards
inclusion of desired properties. Finally, we describe how these sampling biases
can be exploited in several, real-world applications including disease outbreak
detection and market research.
","[{'version': 'v1', 'created': 'Sun, 18 Sep 2011 21:14:15 GMT'}]",2011-09-20,"[['Maiya', 'Arun S.', ''], ['Berger-Wolf', 'Tanya Y.', '']]","['sampling', 'bias', 'social network analysis', 'complex networks', 'graph mining', 'link mining', 'online sampling', 'crawling']"
13804,1002.0414,Dakshina Ranjan Kisku,"Dakshina Ranjan Kisku, Phalguni Gupta, Jamuna Kanta Sing","Feature Level Fusion of Biometrics Cues: Human Identification with
  Doddingtons Caricature","8 pages, 3 figures",,,,cs.CV cs.AI,http://creativecommons.org/licenses/by/3.0/,"  This paper presents a multimodal biometric system of fingerprint and ear
biometrics. Scale Invariant Feature Transform (SIFT) descriptor based feature
sets extracted from fingerprint and ear are fused. The fused set is encoded by
K-medoids partitioning approach with less number of feature points in the set.
K-medoids partition the whole dataset into clusters to minimize the error
between data points belonging to the clusters and its center. Reduced feature
set is used to match between two biometric sets. Matching scores are generated
using wolf-lamb user-dependent feature weighting scheme introduced by
Doddington. The technique is tested to exhibit its robust performance.
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2010 08:12:23 GMT'}]",2010-02-03,"[['Kisku', 'Dakshina Ranjan', ''], ['Gupta', 'Phalguni', ''], ['Sing', 'Jamuna Kanta', '']]","['Multimodal Biometrics', 'Fingerprint', 'Ear', 'SIFT Features', 'KMedoids', 'Doddington’s Concept']"
13805,1603.07745,Ganesh Sundaramoorthi,"Ganesh Sundaramoorthi, Naeemullah Khan, Byung-Woo Hong",Coarse-to-Fine Segmentation With Shape-Tailored Scale Spaces,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We formulate a general energy and method for segmentation that is designed to
have preference for segmenting the coarse structure over the fine structure of
the data, without smoothing across boundaries of regions. The energy is
formulated by considering data terms at a continuum of scales from the scale
space computed from the Heat Equation within regions, and integrating these
terms over all time. We show that the energy may be approximately optimized
without solving for the entire scale space, but rather solving time-independent
linear equations at the native scale of the image, making the method
computationally feasible. We provide a multi-region scheme, and apply our
method to motion segmentation. Experiments on a benchmark dataset shows that
our method is less sensitive to clutter or other undesirable fine-scale
structure, and leads to better performance in motion segmentation.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2016 20:39:24 GMT'}]",2016-03-28,"[['Sundaramoorthi', 'Ganesh', ''], ['Khan', 'Naeemullah', ''], ['Hong', 'Byung-Woo', '']]","['Scale space', 'Heat Equation', 'segmentation', 'multi-scale methods', 'continuous optimization', 'motion segmentation']"
13806,1108.0065,Michael Chertkov,M. Chertkov and A. B. Yedidia,Approximating the Permanent with Fractional Belief Propagation,"42 pages, 14 figures",,,LA-UR 11-04333,cs.DM cond-mat.stat-mech cs.CC cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We discuss schemes for exact and approximate computations of permanents, and
compare them with each other. Specifically, we analyze the Belief Propagation
(BP) approach and its Fractional Belief Propagation (FBP) generalization for
computing the permanent of a non-negative matrix. Known bounds and conjectures
are verified in experiments, and some new theoretical relations, bounds and
conjectures are proposed. The Fractional Free Energy (FFE) functional is
parameterized by a scalar parameter $\gamma\in[-1;1]$, where $\gamma=-1$
corresponds to the BP limit and $\gamma=1$ corresponds to the exclusion
principle (but ignoring perfect matching constraints) Mean-Field (MF) limit.
FFE shows monotonicity and continuity with respect to $\gamma$. For every
non-negative matrix, we define its special value $\gamma_*\in[-1;0]$ to be the
$\gamma$ for which the minimum of the $\gamma$-parameterized FFE functional is
equal to the permanent of the matrix, where the lower and upper bounds of the
$\gamma$-interval corresponds to respective bounds for the permanent. Our
experimental analysis suggests that the distribution of $\gamma_*$ varies for
different ensembles but $\gamma_*$ always lies within the $[-1;-1/2]$ interval.
Moreover, for all ensembles considered the behavior of $\gamma_*$ is highly
distinctive, offering an emprirical practical guidance for estimating
permanents of non-negative matrices via the FFE approach.
","[{'version': 'v1', 'created': 'Sat, 30 Jul 2011 12:55:38 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Aug 2011 23:20:47 GMT'}, {'version': 'v3', 'created': 'Sun, 6 May 2012 16:11:34 GMT'}, {'version': 'v4', 'created': 'Sat, 5 Jan 2013 14:10:30 GMT'}]",2013-01-08,"[['Chertkov', 'M.', ''], ['Yedidia', 'A. B.', '']]","['Permanent', 'Graphical Models', 'Belief Propagation', 'Exact and ApproximateAlgorithms', 'Learning Flow Models']"
13807,0906.4474,Jon Sneyers,"Jon Sneyers, Peter Van Weert, Tom Schrijvers, Leslie De Koninck","As time goes by: Constraint Handling Rules - A survey of CHR research
  from 1998 to 2007",49 pages. To appear in Theory and Practice of Logic Programming,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Constraint Handling Rules (CHR) is a high-level programming language based on
multi-headed multiset rewrite rules. Originally designed for writing
user-defined constraint solvers, it is now recognized as an elegant general
purpose language. CHR-related research has surged during the decade following
the previous survey by Fruehwirth. Covering more than 180 publications, this
new survey provides an overview of recent results in a wide range of research
areas, from semantics and analysis to systems, extensions and applications.
","[{'version': 'v1', 'created': 'Wed, 24 Jun 2009 13:54:41 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Jun 2009 13:17:41 GMT'}]",2009-06-25,"[['Sneyers', 'Jon', ''], ['Van Weert', 'Peter', ''], ['Schrijvers', 'Tom', ''], ['De Koninck', 'Leslie', '']]","['Constraint Handling Rules', 'CHR', 'survey']"
13808,1009.2832,Sahasranand K.R.,K. R. Sahasranand and Nithin Nagaraj,Sharing Graphs,"17 pages, 6 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Almost all known secret sharing schemes work on numbers. Such methods will
have difficulty in sharing graphs since the number of graphs increases
exponentially with the number of nodes. We propose a secret sharing scheme for
graphs where we use graph intersection for reconstructing the secret which is
hidden as a sub graph in the shares. Our method does not rely on heavy
computational operations such as modular arithmetic or polynomial interpolation
but makes use of very basic operations like assignment and checking for
equality, and graph intersection can also be performed visually. In certain
cases, the secret could be reconstructed using just pencil and paper by
authorised parties but cannot be broken by an adversary even with unbounded
computational power. The method achieves perfect secrecy for (2, n) scheme and
requires far fewer operations compared to Shamir's algorithm. The proposed
method could be used to share objects such as matrices, sets, plain text and
even a heterogeneous collection of these. Since we do not require a previously
agreed upon encoding scheme, the method is very suitable for sharing
heterogeneous collection of objects in a dynamic fashion.
","[{'version': 'v1', 'created': 'Wed, 15 Sep 2010 04:26:32 GMT'}]",2010-09-16,"[['Sahasranand', 'K. R.', ''], ['Nagaraj', 'Nithin', '']]","['cryptography', 'graph', 'secret sharing', 'set intersection']"
13809,1705.07465,Aleksandr Cariow,Aleksandr Cariow and Galina Cariowa,"Some Schemes for Implementation of Arithmetic Operations with Complex
  Numbers Using Squaring Units","3 pages. 3 figures, 2 tables",,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, new schemes for a squarer, multiplier and divider of complex
numbers are proposed. Traditional structural solutions for each of these
operations require the presence some number of general-purpose binary
multipliers. The advantage of our solutions is a removing of multiplications
through replacing them by less costly squarers. We use Logan's trick and
quarter square technique, which propose to replace the calculation of the
product of two real numbers by summing the squares. Replacing usual multipliers
on digital squares implies reducing power consumption as well as decreases
hardware circuit complexity. The squarer requiring less area and power as
compared to general-purpose multiplier, it is interesting to assess the use of
squarers to implementation of complex arithmetic.
","[{'version': 'v1', 'created': 'Sun, 21 May 2017 15:56:04 GMT'}]",2017-05-23,"[['Cariow', 'Aleksandr', ''], ['Cariowa', 'Galina', '']]","['complex number arithmetic', 'squaring unit', 'implementation complexity reduction', 'hardware implementation  1']"
13810,1212.3060,Zahid  Hussain Qaisar,"Muhammad Touseef (UIIT, PMAS, Arid Agriculture University, Rawalpindi,
  Pakistan), Zahid Hussain Qaisar (Institute of Engineering and Technology,
  National Fertilizers Corporation (NFC-IET) Multan, Pakistan)",A use case driven approach for system level testing,,"IJCSI International Journal of Computer Science Issues, Vol. 9,
  Issue 5, No 1, September 2012 ISSN (Online): 1694-0814 www.IJCSI.org",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Use case scenarios are created during the analysis phase to specify software
system requirements and can also be used for creating system level test cases.
Using use cases to get system tests has several benefits including test design
at early stages of software development life cycle that reduces over all
development cost of the system. Current approaches for system testing using use
cases involve functional details and does not include guards as passing
criteria i.e. use of class diagram that seem to be difficult at very initial
level which lead the need of specification based testing without involving
functional details. In this paper, we proposed a technique for system testing
directly derived from the specification without involving functional details.
We utilize initial and post conditions applied as guards at each level of the
use cases that enables us generation of formalized test cases and makes it
possible to generate test cases for each flow of the system. We used use case
scenarios to generate system level test cases, whereas system sequence diagram
is being used to bridge the gap between the test objective and test cases,
derived from the specification of the system. Since, a state chart derived from
the combination of sequence diagrams can model the entire behavior of the
system.Generated test cases can be employed and executed to state chart in
order to capture behavior of the system with the state change.All these steps
enable us to systematically refine the specification to achieve the goals of
system testing at early development stages.
","[{'version': 'v1', 'created': 'Thu, 13 Dec 2012 06:07:22 GMT'}]",2012-12-14,"[['Touseef', 'Muhammad', '', 'UIIT, PMAS, Arid Agriculture University, Rawalpindi,\n  Pakistan'], ['Qaisar', 'Zahid Hussain', '', 'Institute of Engineering and Technology,\n  National Fertilizers Corporation']]","['UML', 'Model Based Testing', 'System Level Testing']"
13811,1712.04216,Quentin Galvane,"Quentin Galvane, Christophe Lino, Marc Christie, Julien Fleureau,
  Fabien Servant, Francois-Louis Tariolle, Philippe Guillotel",Directing Cinematographic Drones,,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quadrotor drones equipped with high quality cameras have rapidely raised as
novel, cheap and stable devices for filmmakers. While professional drone pilots
can create aesthetically pleasing videos in short time, the smooth -- and
cinematographic -- control of a camera drone remains challenging for most
users, despite recent tools that either automate part of the process or enable
the manual design of waypoints to create drone trajectories. This paper
proposes to move a step further towards more accessible cinematographic drones
by designing techniques to automatically or interactively plan quadrotor drone
motions in 3D dynamic environments that satisfy both cinematographic and
physical quadrotor constraints. We first propose the design of a Drone Toric
Space as a dedicated camera parameter space with embedded constraints and
derive some intuitive on-screen viewpoint manipulators. Second, we propose a
specific path planning technique which ensures both that cinematographic
properties can be enforced along the path, and that the path is physically
feasible by a quadrotor drone. At last, we build on the Drone Toric Space and
the specific path planning technique to coordinate the motion of multiple
drones around dynamic targets. A number of results then demonstrate the
interactive and automated capacities of our approaches on a number of
use-cases.
","[{'version': 'v1', 'created': 'Tue, 12 Dec 2017 10:35:46 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Dec 2017 09:54:06 GMT'}]",2017-12-15,"[['Galvane', 'Quentin', ''], ['Lino', 'Christophe', ''], ['Christie', 'Marc', ''], ['Fleureau', 'Julien', ''], ['Servant', 'Fabien', ''], ['Tariolle', 'Francois-Louis', ''], ['Guillotel', 'Philippe', '']]","['animation', 'cinematography', 'drones', 'interactive control']"
13812,0909.2377,Nevin Vunka Jungum,"Soumaya Zirari, Philippe Canalda and Francois Spies",Geometric and Signal Strength Dilution of Precision (DoP)Wi-Fi,"International Journal of Computer Science Issues (IJCSI), Volume 3,
  pp35-44, August 2009","S.Zirari,P. Canalda and F.Spies, "" Geometric and Signal Strength
  Dilution of Precision (DoP)Wi-Fi"", International Journal of Computer Science
  Issues (IJCSI), Volume 3, pp35-44, August 2009",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The democratization of wireless networks combined to the emergence of mobile
devices increasingly autonomous and efficient lead to new services. Positioning
services become overcrowded. Accuracy is the main quality criteria in
positioning. But to better appreciate this one a coefficient is needed. In this
paper we present Geometric and Signal Strength Dilution of Precision (DOP) for
positioning systems based on Wi-Fi and Signal Strength measurements.
","[{'version': 'v1', 'created': 'Sat, 12 Sep 2009 22:24:52 GMT'}]",2009-09-15,"[['Zirari', 'Soumaya', ''], ['Canalda', 'Philippe', ''], ['Spies', 'Francois', '']]","['Wireless LAN', 'Radio position measurement', 'Indoor radio communication']"
13813,1203.0478,Liyong Shen,"Liyong Shen, Chunming Yuan, Xiao-Shan Gao","Certified Approximation of Parametric Space Curves with Cubic B-spline
  Curves","26 pages, 18 figures",,,,cs.CG math.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Approximating complex curves with simple parametric curves is widely used in
CAGD, CG, and CNC. This paper presents an algorithm to compute a certified
approximation to a given parametric space curve with cubic B-spline curves. By
certified, we mean that the approximation can approximate the given curve to
any given precision and preserve the geometric features of the given curve such
as the topology, singular points, etc. The approximated curve is divided into
segments called quasi-cubic B\'{e}zier curve segments which have properties
similar to a cubic rational B\'{e}zier curve. And the approximate curve is
naturally constructed as the associated cubic rational B\'{e}zier curve of the
control tetrahedron of a quasi-cubic curve. A novel optimization method is
proposed to select proper weights in the cubic rational B\'{e}zier curve to
approximate the given curve. The error of the approximation is controlled by
the size of its tetrahedron, which converges to zero by subdividing the curve
segments. As an application, approximate implicit equations of the approximated
curves can be computed. Experiments show that the method can approximate space
curves of high degrees with high precision and very few cubic B\'{e}zier curve
segments.
","[{'version': 'v1', 'created': 'Fri, 2 Mar 2012 14:49:58 GMT'}]",2012-03-05,"[['Shen', 'Liyong', ''], ['Yuan', 'Chunming', ''], ['Gao', 'Xiao-Shan', '']]","['Space parametric curve', 'certified approximation', 'geometric feature', 'cubicB´ezier curve', 'cubic B-spline curve']"
13814,0705.1280,Damien Chablat,"F\'elix Majou (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat
  (IRCCyN)","A Novel method for the design of 2-DOF Parallel mechanisms for machining
  applications",,"8th International Symposium on Advances in Robot Kinematics (2002)
  1-11",,,cs.RO,,"  Parallel Kinematic Mechanisms (PKM) are interesting alternative designs for
machine tools. A design method based on velocity amplification factors analysis
is presented in this paper. The comparative study of two simple
two-degree-of-freedom PKM dedicated to machining applications is led through
this method: the common desired properties are the largest square Cartesian
workspace for given kinetostatic performances. The orientation and position of
the Cartesian workspace are chosen to avoid singularities and to produce the
best ratio between Cartesian workspace size and mechanism size. The machine
size of each resulting design is used as a comparative criterion.
","[{'version': 'v1', 'created': 'Wed, 9 May 2007 13:18:59 GMT'}]",2007-05-23,"[['Majou', 'Félix', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN'], ['Chablat', 'Damien', '', 'IRCCyN']]","['Parallel Kinematic Machine Tool', 'Velocity Amplification Factors', 'Optimal Workspace Design']"
13815,1107.4651,Nittaya Kerdprasop Prof.,Nittaya Kerdprasop and Kittisak Kerdprasop,"Higher Order Programming to Mine Knowledge for a Modern Medical Expert
  System",9 pages,"IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 3, May 2011 ISSN (Online): 1694-0814 www.IJCSI.org",,,cs.LO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge mining is the process of deriving new and useful knowledge from
vast volumes of data and background knowledge. Modern healthcare organizations
regularly generate huge amount of electronic data stored in the databases.
These data are a valuable resource for mining useful knowledge to help medical
practitioners making appropriate and accurate decision on the diagnosis and
treatment of diseases. In this paper, we propose the design of a novel medical
expert system based on a logic-programming framework. The proposed system
includes a knowledge-mining component as a repertoire of tools for discovering
useful knowledge. The implementation of classification and association mining
tools based on the higher order and meta-level programming schemes using Prolog
has been presented to express the power of logic-based language. Such language
also provides a pattern matching facility, which is an essential function for
the development of knowledge-intensive tasks. Besides the major goal of medical
decision support, the knowledge discovered by our logic-based knowledge-mining
component can also be deployed as background knowledge to pre-treatment data
from other sources as well as to guard the data repositories against constraint
violation. A framework for knowledge deployment is also presented.
","[{'version': 'v1', 'created': 'Sat, 23 Jul 2011 03:04:22 GMT'}]",2011-07-26,"[['Kerdprasop', 'Nittaya', ''], ['Kerdprasop', 'Kittisak', '']]","['Knowledge Mining', 'Association Mining', 'Decisiontree Induction', 'Higher-order Logic Programming', 'Medical Expert System']"
13816,0706.3295,Beniamin Mounits Mr,Beniamin Mounits,Lower bounds on the minimum average distance of binary codes,19 pages,,,,cs.IT math.CO math.IT,,"  New lower bounds on the minimum average Hamming distance of binary codes are
derived. The bounds are obtained using linear programming approach.
","[{'version': 'v1', 'created': 'Fri, 22 Jun 2007 09:32:50 GMT'}]",2007-07-13,"[['Mounits', 'Beniamin', '']]","['Binary codes', 'minimum average distance', 'linear programming']"
13817,1301.3592,Ian Lenz,Ian Lenz and Honglak Lee and Ashutosh Saxena,Deep Learning for Detecting Robotic Grasps,"Current version was accepted to IJRR Special Issue on Robot Vision
  2014 Workshop version accepted to ICLR 2013. Conference version accepted to
  RSS 2013",,,,cs.LG cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of detecting robotic grasps in an RGB-D view of a
scene containing objects. In this work, we apply a deep learning approach to
solve this problem, which avoids time-consuming hand-design of features. This
presents two main challenges. First, we need to evaluate a huge number of
candidate grasps. In order to make detection fast, as well as robust, we
present a two-step cascaded structure with two deep networks, where the top
detections from the first are re-evaluated by the second. The first network has
fewer features, is faster to run, and can effectively prune out unlikely
candidate grasps. The second, with more features, is slower but has to run only
on the top few detections. Second, we need to handle multimodal inputs well,
for which we present a method to apply structured regularization on the weights
based on multimodal group regularization. We demonstrate that our method
outperforms the previous state-of-the-art methods in robotic grasp detection,
and can be used to successfully execute grasps on two different robotic
platforms.
","[{'version': 'v1', 'created': 'Wed, 16 Jan 2013 05:33:56 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Jan 2013 00:10:20 GMT'}, {'version': 'v3', 'created': 'Thu, 21 Feb 2013 00:40:34 GMT'}, {'version': 'v4', 'created': 'Fri, 3 May 2013 06:54:42 GMT'}, {'version': 'v5', 'created': 'Fri, 2 Aug 2013 18:15:54 GMT'}, {'version': 'v6', 'created': 'Thu, 21 Aug 2014 18:17:37 GMT'}]",2014-08-22,"[['Lenz', 'Ian', ''], ['Lee', 'Honglak', ''], ['Saxena', 'Ashutosh', '']]","['Robotic Grasping', 'deep learning', 'RGB-D multimodal data', 'Baxter', 'PR2', '3D feature learning']"
13818,1607.01958,Kalyani Joshi Ms,"Joshi Kalyani, Prof. H. N. Bharathi, Prof. Rao Jyothi",Stock trend prediction using news sentiment analysis,"11 PAGES, 4 FIGURES",,,,cs.CL cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efficient Market Hypothesis is the popular theory about stock prediction.
With its failure much research has been carried in the area of prediction of
stocks. This project is about taking non quantifiable data such as financial
news articles about a company and predicting its future stock trend with news
sentiment classification. Assuming that news articles have impact on stock
market, this is an attempt to study relationship between news and stock trend.
To show this, we created three different classification models which depict
polarity of news articles being positive or negative. Observations show that RF
and SVM perform well in all types of testing. Na\""ive Bayes gives good result
but not compared to the other two. Experiments are conducted to evaluate
various aspects of the proposed model and encouraging results are obtained in
all of the experiments. The accuracy of the prediction model is more than 80%
and in comparison with news random labeling with 50% of accuracy; the model has
increased the accuracy by 30%.
","[{'version': 'v1', 'created': 'Thu, 7 Jul 2016 10:48:34 GMT'}]",2016-07-08,"[['Kalyani', 'Joshi', ''], ['Bharathi', 'Prof. H. N.', ''], ['Jyothi', 'Prof. Rao', '']]","['Text Mining', 'Sentiment analysis', 'Naive Bayes', 'Random Forest', 'SVM', 'Stock trends']"
13819,1606.08480,Charith Perera,"Charith Perera, Chang Liu, Rajiv Ranjan, Lizhe Wang, Albert Y. Zomaya",Privacy Knowledge Modelling for Internet of Things: A Look Back,IEEE Computer Magazine 2016,,,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet of Things (IoT) and cloud computing together give us the ability to
sense, collect, process, and analyse data so we can use them to better
understand behaviours, habits, preferences and life patterns of users and lead
them to consume resources more efficiently. In such knowledge discovery
activities, privacy becomes a significant challenge due to the extremely
personal nature of the knowledge that can be derived from the data and the
potential risks involved. Therefore, understanding the privacy expectations and
preferences of stakeholders is an important task in the IoT domain. In this
paper, we review how privacy knowledge has been modelled and used in the past
in different domains. Our goal is not only to analyse, compare and consolidate
past research work but also to appreciate their findings and discuss their
applicability towards the IoT. Finally, we discuss major research challenges
and opportunities.
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2016 20:34:35 GMT'}]",2016-06-29,"[['Perera', 'Charith', ''], ['Liu', 'Chang', ''], ['Ranjan', 'Rajiv', ''], ['Wang', 'Lizhe', ''], ['Zomaya', 'Albert Y.', '']]","['Internet of Things', 'Privacy Preferences', 'Knowledge Modelling']"
13820,1701.04086,Barnaby Martin,"Catarina Carvalho, Barnaby Martin and Dmitriy Zhuk",The complexity of quantified constraints using the algebraic formulation,,,,,cs.LO cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let A be an idempotent algebra on a finite domain. We combine results of
Chen, Zhuk and Carvalho et al. to argue that if A satisfies the polynomially
generated powers property (PGP), then QCSP(Inv(A)) is in NP. We then use the
result of Zhuk to prove a converse, that if QCSP(Inv(A)) satisfies the
exponentially generated powers property (EGP), then QCSP(Inv(A)) is co-NP-hard.
Since Zhuk proved that only PGP and EGP are possible, we derive a full
dichotomy for the QCSP, justifying the moral correctness of what we term the
Chen Conjecture.
  We examine in closer detail the situation for domains of size three. Over any
finite domain, the only type of PGP that can occur is switchability.
Switchability was introduced by Chen as a generalisation of the already-known
Collapsibility. For three-element domain algebras A that are Switchable, we
prove that for every finite subset Delta of Inv(A), Pol(Delta) is Collapsible.
The significance of this is that, for QCSP on finite structures (over
three-element domain), all QCSP tractability explained by Switchability is
already explained by Collapsibility.
  Finally, we present a three-element domain complexity classification
vignette, using known as well as derived results.
","[{'version': 'v1', 'created': 'Sun, 15 Jan 2017 17:54:19 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Apr 2017 13:05:46 GMT'}]",2017-04-28,"[['Carvalho', 'Catarina', ''], ['Martin', 'Barnaby', ''], ['Zhuk', 'Dmitriy', '']]","['Quantified Constraints', 'Computational Complexity', 'Universal Algebra', 'Constraint Satisfaction']"
13821,1610.07175,Tomoyuki Yamakami,Tomoyuki Yamakami,"Not All Multi-Valued Partial CFL Functions Are Refined by Single-Valued
  Functions","(A4 size, 10 pt, 18 pages, 2 figures) This is a complete and
  corrected version of an extended abstract that appeared in the Proceedings of
  the 8th IFIP International Conference on Theoretical Computer Science (IFIP
  TCS 2014), Rome, Italy, September 1-3, 2014, Lecture Notes in Computer
  Science, Springer, vol. 8705, pp. 136-150, 2014",,,,cs.FL cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-valued partial CFL functions are functions computed along accepting
computation paths by one-way nondeterministic pushdown automata, equipped with
write-only output tapes, which are allowed to reject an input, in comparison
with single-valued partial CFL functions. We give an answer to a fundamental
question, raised by Konstantinidis, Santean, and Yu [Act. Inform. 43 (2007)
395-417], of whether all such multi-valued partial CFL functions can be refined
by single-valued partial CFL functions. We negatively solve this open question
by presenting a special multi-valued partial CFL function as an example
function and by proving that no refinement of this particular function becomes
a single-valued partial CFL function. This contrasts an early result of
Kobayashi [Inform. Control 15 (1969) 95-109] that multi-valued partial NFA
functions are always refined by single-valued NFA functions, where NFA
functions are computed by one-way nondeterministic finite automata with output
tapes. Our example function turns out to be unambiguously 2-valued, and thus we
obtain a stronger separation result, in which no refinement of unambiguously
2-valued partial CFL functions can be single-valued. For the proof of this
fact, we first introduce a new concept of colored automata having no output
tapes but having ""colors,"" which can simulate pushdown automata equipped with
constant-space output tapes. We then conduct an extensive combinatorial
analysis on the behaviors of transition records of stack contents (called stack
histories) of these colored automata.
","[{'version': 'v1', 'created': 'Sun, 23 Oct 2016 14:21:40 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Apr 2020 08:22:41 GMT'}]",2020-04-27,"[['Yamakami', 'Tomoyuki', '']]","['multi-valued partial function', 'CFL function', 'NFA function', 'refinement', 'pushdownautomaton', 'context-free language', 'colored automaton', 'stack history']"
13822,1306.1955,Alexey Markov,"Alexander Barabanov, Maxim Grishin and Alexey Markov","The Formal Metabasis For Conformity Assessment of Information Security
  Software and Hardware","Keywords: information security, information protection, information
  security tools, certification, conformity assessment, security testing",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An approach to the development of security test procedures for information
security controls is presented. The recommendations for optimizing the test
procedure are obtained
","[{'version': 'v1', 'created': 'Sat, 8 Jun 2013 20:25:58 GMT'}]",2013-06-11,"[['Barabanov', 'Alexander', ''], ['Grishin', 'Maxim', ''], ['Markov', 'Alexey', '']]","['information security', 'information protection', 'information security tools', 'certification', 'conformity']"
13823,1710.04771,Cong Luong Nguyen,"Nguyen Cong Luong, Ping Wang, Dusit Niyato, Ying-Chang Liang, Fen Hou,
  Zhu Han","Applications of Economic and Pricing Models for Resource Management in
  5G Wireless Networks: A Survey",,,,,cs.GT cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a comprehensive literature review on applications of
economic and pricing theory for resource management in the evolving fifth
generation (5G) wireless networks. The 5G wireless networks are envisioned to
overcome existing limitations of cellular networks in terms of data rate,
capacity, latency, energy efficiency, spectrum efficiency, coverage,
reliability, and cost per information transfer. To achieve the goals, the 5G
systems will adopt emerging technologies such as massive Multiple-Input
Multiple-Output (MIMO), mmWave communications, and dense Heterogeneous Networks
(HetNets). However, 5G involves multiple entities and stakeholders that may
have different objectives, e.g., high data rate, low latency, utility
maximization, and revenue/profit maximization. This poses a number of
challenges to resource management designs of 5G. While the traditional
solutions may neither efficient nor applicable, economic and pricing models
have been recently developed and adopted as useful tools to achieve the
objectives. In this paper, we review economic and pricing approaches proposed
to address resource management issues in the 5G wireless networks including
user association, spectrum allocation, and interference and power management.
Furthermore, we present applications of economic and pricing models for
wireless caching and mobile data offloading. Finally, we highlight important
challenges, open issues and future research directions of applying economic and
pricing models to the 5G wireless networks.
","[{'version': 'v1', 'created': 'Fri, 13 Oct 2017 01:29:36 GMT'}]",2017-10-16,"[['Luong', 'Nguyen Cong', ''], ['Wang', 'Ping', ''], ['Niyato', 'Dusit', ''], ['Liang', 'Ying-Chang', ''], ['Hou', 'Fen', ''], ['Han', 'Zhu', '']]","['5G wireless networks', 'massive MIMO', 'mmWavecommunications', 'C-RAN', 'HetNets', 'resource management', 'pricingmodels', 'economic theories']"
13824,1710.04130,Nicole Radziwill,"Morgan C. Benton, Nicole M. Radziwill",Quality and Innovation with Blockchain Technology,,"Software Quality Professional, Dec 2017",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, hype surrounding the proliferation of blockchain-based
technology has been significant. Apart from the creation of bitcoin and other
cryptocurrencies, it has been difficult to determine what practical utility
might lie in the adoption of blockchain, mainly because there are so few in
existence at present. Even so, interest in the technology has increased
tremendously. This paper is a primer for software quality professionals. It
briefly describes the history of blockchain technology, attempts to define and
disambiguate terminology, fosters a general understanding of how blockchain
works, and discusses how and why software quality professionals might want to
invest time and energy in learning about, implementing, or using
blockchain-based technologies in their own organizations -- or alternatively,
improving the quality of blockchain technology itself.
","[{'version': 'v1', 'created': 'Thu, 5 Oct 2017 16:47:17 GMT'}]",2017-10-12,"[['Benton', 'Morgan C.', ''], ['Radziwill', 'Nicole M.', '']]","['Distributed\u200b \u200bsystems', '\u200b \u200bblockchain', '\u200b \u200bBitcoin', '\u200b \u200bcryptocurrency', '\u200b \u200binnovation', '\u200b \u200bsupply\u200b \u200bchain']"
13825,1402.5708,Lavdim Kurtaj,"Lavdim Kurtaj, Ilir Limani, Vjosa Shatri and Avni Skeja","The Cerebellum: New Computational Model that Reveals its Primary
  Function to Calculate Multibody Dynamics Conform to Lagrange-Euler
  Formulation","18 pages, 4 figures","IJCSI International Journal of Computer Science Issues, Vol. 10,
  Issue 5, No 2, September 2013",,,cs.NE cs.CE cs.RO q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cerebellum is part of the brain that occupies only 10% of the brain volume,
but it contains about 80% of total number of brain neurons. New cerebellar
function model is developed that sets cerebellar circuits in context of
multibody dynamics model computations, as important step in controlling balance
and movement coordination, functions performed by two oldest parts of the
cerebellum. Model gives new functional interpretation for granule cells-Golgi
cell circuit, including distinct function for upper and lower Golgi cell
dendritc trees, and resolves issue of sharing Granule cells between Purkinje
cells. Sets new function for basket cells, and for stellate cells according to
position in molecular layer. New model enables easily and direct integration of
sensory information from vestibular system and cutaneous mechanoreceptors, for
balance, movement and interaction with environments. Model gives explanation of
Purkinje cells convergence on deep-cerebellar nuclei.
","[{'version': 'v1', 'created': 'Mon, 24 Feb 2014 02:40:05 GMT'}]",2014-02-25,"[['Kurtaj', 'Lavdim', ''], ['Limani', 'Ilir', ''], ['Shatri', 'Vjosa', ''], ['Skeja', 'Avni', '']]","['New Cerebellar function model', 'CMAC', 'Cerebellar elementary processing unit', 'Golgi cell', 'Basket cell', 'Stellate cell']"
13826,1510.08419,Nadia Polikarpova,Nadia Polikarpova and Ivan Kuraj and Armando Solar-Lezama,Program Synthesis from Polymorphic Refinement Types,,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a method for synthesizing recursive functions that provably
satisfy a given specification in the form of a polymorphic refinement type. We
observe that such specifications are particularly suitable for program
synthesis for two reasons. First, they offer a unique combination of expressive
power and decidability, which enables automatic verification---and hence
synthesis---of nontrivial programs. Second, a type-based specification for a
program can often be effectively decomposed into independent specifications for
its components, causing the synthesizer to consider fewer component
combinations and leading to a combinatorial reduction in the size of the search
space. At the core of our synthesis procedure is a new algorithm for refinement
type checking, which supports specification decomposition.
  We have evaluated our prototype implementation on a large set of synthesis
problems and found that it exceeds the state of the art in terms of both
scalability and usability. The tool was able to synthesize more complex
programs than those reported in prior work (several sorting algorithms and
operations on balanced search trees), as well as most of the benchmarks tackled
by existing synthesizers, often starting from a more concise and intuitive user
input.
","[{'version': 'v1', 'created': 'Wed, 28 Oct 2015 19:05:11 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Feb 2016 22:01:58 GMT'}, {'version': 'v3', 'created': 'Thu, 21 Apr 2016 16:06:38 GMT'}]",2016-04-22,"[['Polikarpova', 'Nadia', ''], ['Kuraj', 'Ivan', ''], ['Solar-Lezama', 'Armando', '']]","['Program Synthesis', 'Functional Programming', 'Refinement Types', 'Predicate Abstraction']"
13827,1609.01475,Kardi Teknomo,Allan Lao and Kardi Teknomo,Multi Exit Configuration of Mesoscopic Pedestrian Simulation,"7 pages, Lao, A. and Teknomo, K. (2014) Multi Exit Configuration of
  Mesoscopic Pedestrian Simulation, Proceeding of the 12th National Conference
  in Information Technology Education (NCITE 2014), October 23 - 25, 2014,
  Boracay, Philippines",,,,cs.MA cs.AI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A mesoscopic approach to modeling pedestrian simulation with multiple exits
is proposed in this paper. A floor field based on Qlearning Algorithm is used.
Attractiveness of exits to pedestrian typically is based on shortest path.
However, several factors may influence pedestrian choice of exits. Scenarios
with multiple exits are presented and effect of Q-learning rewards system on
navigation is investigated
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2016 10:18:25 GMT'}]",2016-09-07,"[['Lao', 'Allan', ''], ['Teknomo', 'Kardi', '']]","['Pedestrian Simulation', 'Artificial Intelligence', 'Multi Agent', 'Mesoscopic', 'Q-learning', 'Multi Exit']"
13828,1505.01350,Ozgur Yilmaz,Ozgur Yilmaz,Classification of Occluded Objects using Fast Recurrent Processing,arXiv admin note: text overlap with arXiv:1409.8576 by other authors,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recurrent neural networks are powerful tools for handling incomplete data
problems in computer vision, thanks to their significant generative
capabilities. However, the computational demand for these algorithms is too
high to work in real time, without specialized hardware or software solutions.
In this paper, we propose a framework for augmenting recurrent processing
capabilities into a feedforward network without sacrificing much from
computational efficiency. We assume a mixture model and generate samples of the
last hidden layer according to the class decisions of the output layer, modify
the hidden layer activity using the samples, and propagate to lower layers. For
visual occlusion problem, the iterative procedure emulates feedforward-feedback
loop, filling-in the missing hidden layer activity with meaningful
representations. The proposed algorithm is tested on a widely used dataset, and
shown to achieve 2$\times$ improvement in classification accuracy for occluded
objects. When compared to Restricted Boltzmann Machines, our algorithm shows
superior performance for occluded object classification.
","[{'version': 'v1', 'created': 'Wed, 6 May 2015 12:58:58 GMT'}]",2015-05-07,"[['Yilmaz', 'Ozgur', '']]","['Missing Data', 'Neural Networks', 'Recurrent Processing', 'Visual Occlusion']"
13829,1212.5095,Tamal Ghosh Tamal Ghosh,"T. Ghosh, P.K. Dan","Modelling of Optimal Design of Manufacturing Cell Layout Considering
  Material Flow and Closeness Rating Factors","Proceedings of 4th International & 25th AIMTDR Conference, December
  2012",,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Developing a group of machine cells and their corresponding part families to
minimize the inter-cell and intra-cell material flow is the basic objective of
the designing of a cellular manufacturing system (CMS). Afterwards achieving a
competent cell layout is essential in order to minimize the total inter-cell
part travels, which is principally noteworthy. There are plentiful articles of
CMS literature which considered cell formation problems; however cell layout
topic has rarely been addressed. Therefore this research is intended to focus
on an adapted mathematical model of the layout design problem considering
material handling cost and closeness ratings of manufacturing cells. Owing to
the combinatorial class of the said problem, an efficient NP-hard technique
based on Simulated Annealing metaheuristic is proposed henceforth. Some test
problems are solved using the proposed technique. Computational results show
that the proposed metaheuristic approach is extremely effective and efficient
in terms of solution quality and computational complexity.
","[{'version': 'v1', 'created': 'Thu, 20 Dec 2012 15:47:50 GMT'}]",2012-12-21,"[['Ghosh', 'T.', ''], ['Dan', 'P. K.', '']]","['Cellular Layout', 'Inter-Cell Material Flow', 'Simulated Annealing', 'Closeness Ratings']"
13830,1312.4454,Jonathan Heras,"Ekaterina Komendantskaya, Martin Schmidt, J\'onathan Heras",Exploiting Parallelism in Coalgebraic Logic Programming,,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a parallel implementation of Coalgebraic Logic Programming (CoALP)
in the programming language Go. CoALP was initially introduced to reflect
coalgebraic semantics of logic programming, with coalgebraic derivation
algorithm featuring both corecursion and parallelism. Here, we discuss how the
coalgebraic semantics influenced our parallel implementation of logic
programming.
","[{'version': 'v1', 'created': 'Mon, 16 Dec 2013 18:39:55 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Dec 2013 07:39:12 GMT'}]",2013-12-20,"[['Komendantskaya', 'Ekaterina', ''], ['Schmidt', 'Martin', ''], ['Heras', 'Jónathan', '']]","['Coinduction', 'Corecursion', 'Guardedness', 'Parallelism', 'GoLang']"
13831,1704.03660,Weidi Xie,"Davis M. Vigneault, Weidi Xie, David A. Bluemke, and J. Alison Noble","Feature Tracking Cardiac Magnetic Resonance via Deep Learning and Spline
  Optimization",Accepted to Functional Imaging and Modeling of the Heart (FIMH) 2017,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feature tracking Cardiac Magnetic Resonance (CMR) has recently emerged as an
area of interest for quantification of regional cardiac function from balanced,
steady state free precession (SSFP) cine sequences. However, currently
available techniques lack full automation, limiting reproducibility. We propose
a fully automated technique whereby a CMR image sequence is first segmented
with a deep, fully convolutional neural network (CNN) architecture, and
quadratic basis splines are fitted simultaneously across all cardiac frames
using least squares optimization. Experiments are performed using data from 42
patients with hypertrophic cardiomyopathy (HCM) and 21 healthy control
subjects. In terms of segmentation, we compared state-of-the-art CNN
frameworks, U-Net and dilated convolution architectures, with and without
temporal context, using cross validation with three folds. Performance relative
to expert manual segmentation was similar across all networks: pixel accuracy
was ~97%, intersection-over-union (IoU) across all classes was ~87%, and IoU
across foreground classes only was ~85%. Endocardial left ventricular
circumferential strain calculated from the proposed pipeline was significantly
different in control and disease subjects (-25.3% vs -29.1%, p = 0.006), in
agreement with the current clinical literature.
","[{'version': 'v1', 'created': 'Wed, 12 Apr 2017 08:43:35 GMT'}]",2017-04-13,"[['Vigneault', 'Davis M.', ''], ['Xie', 'Weidi', ''], ['Bluemke', 'David A.', ''], ['Noble', 'J. Alison', '']]","['regional cardiac function', 'cardiac magnetic resonance', 'deepconvolutional neural networks', 'quadratic basis splines', 'least squares optimization']"
13832,1401.0598,Wu Wu,"Wu Wu, Jiulin Hu, Xiaofang Huang, Huijie Chen, Bo Sun","Flight trajectory recreation and playback system of aerial mission based
  on ossimplanet",,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recreation of flight trajectory is important among research areas. The design
of a flight trajectory recreation and playback system is presented in this
paper. Rather than transferring the flight data to diagram, graph and table,
flight data is visualized on the 3D global of ossimPlanet. ossimPlanet is an
open-source 3D global geo-spatial viewer and the system realization is based on
analysis it. Users are allowed to choose their interested flight of aerial
mission. The aerial photographs and corresponding configuration files in which
flight data is included would be read in. And the flight statuses would be
stored. The flight trajectory is then recreated. Users can view the photographs
and flight trajectory marks on the correct positions of 3D global. The scene
along flight trajectory is also simulated at the plane's eye point. This paper
provides a more intuitive way for recreation of flight trajectory. The cost is
decreased remarkably and security is ensured by secondary development on
open-source platform.
","[{'version': 'v1', 'created': 'Fri, 3 Jan 2014 07:10:25 GMT'}]",2014-01-06,"[['Wu', 'Wu', ''], ['Hu', 'Jiulin', ''], ['Huang', 'Xiaofang', ''], ['Chen', 'Huijie', ''], ['Sun', 'Bo', '']]","['flight trajectory', 'open-source platform', '3D global', 'ossimPlanet', 'KML']"
13833,1307.3091,Gra\c{c}a Marietto Dr,"Maria das Gra\c{c}as Bruno Marietto, Rafael Varago de Aguiar, Gislene
  de Oliveira Barbosa, Wagner Tanaka Botelho, Edson Pimentel, Robson dos Santos
  Fran\c{c}a and Vera L\'ucia da Silva",Artificial Intelligence MArkup Language: A Brief Tutorial,"International Journal of Computer science and engineering Survey
  (IJCSES) - 2013",,,,cs.AI cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this paper is to serve as a reference guide for the
development of chatterbots implemented with the AIML language. In order to
achieve this, the main concepts in Pattern Recognition area are described
because the AIML uses such theoretical framework in their syntactic and
semantic structures. After that, AIML language is described and each AIML
command/tag is followed by an application example. Also, the usage of AIML
embedded tags for the handling of sequence dialogue limitations between humans
and machines is shown. Finally, computer systems that assist in the design of
chatterbots with the AIML language are classified and described.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2013 12:49:43 GMT'}]",2013-07-12,"[['Marietto', 'Maria das Graças Bruno', ''], ['de Aguiar', 'Rafael Varago', ''], ['Barbosa', 'Gislene de Oliveira', ''], ['Botelho', 'Wagner Tanaka', ''], ['Pimentel', 'Edson', ''], ['França', 'Robson dos Santos', ''], ['da Silva', 'Vera Lúcia', '']]","['Artificial Intelligence', 'Chatterbot', 'Pattern Recognition', 'Artificial Intelligence Markup Language (AIML)', 'Tutorial']"
13834,1505.01998,Artur Gramacki,"Witold Andrzejewski, Artur Gramacki, Jaros{\l}aw Gramacki","Density Estimations for Approximate Query Processing on SIMD
  Architectures",,,,,cs.DC cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Approximate query processing (AQP) is an interesting alternative for exact
query processing. It is a tool for dealing with the huge data volumes where
response time is more important than perfect accuracy (this is typically the
case during initial phase of data exploration). There are many techniques for
AQP, one of them is based on probability density functions (PDF). PDFs are
typically calculated using nonparametric data-driven methods. One of the most
popular nonparametric method is the kernel density estimator (KDE). However, a
very serious drawback of using KDEs is the large number of calculations
required to compute them. The shape of final density function is very sensitive
to an entity called bandwidth or smoothing parameter. Calculating it's optimal
value is not a trivial task and in general is very time consuming. In this
paper we investigate the possibility of utilizing two SIMD architectures: SSE
CPU extensions and NVIDIA's CUDA architecture to accelerate finding of the
bandwidth. Our experiments show orders of magnitude improvements over a simple
sequential implementation of classical algorithms used for that task.
","[{'version': 'v1', 'created': 'Fri, 8 May 2015 11:16:49 GMT'}]",2015-05-11,"[['Andrzejewski', 'Witold', ''], ['Gramacki', 'Artur', ''], ['Gramacki', 'Jarosław', '']]","['approximate query processing', 'graphics processing unit', 'probability density function', 'nonparametric estimation', 'kernel estimation', 'bandwidth selection']"
13835,1212.2669,Ignacio Algredo-Badillo Dr.,"Francisco Rub\'en Castillo Soria, Gustavo Fern\'andez Torres, Ignacio
  Algredo-Badillo",A Lossless Data Hiding Technique based on AES-DWT,"9 pages, 15 figures, 2 tables; IJCSI International Journal of
  Computer Science Issues, Vol. 9, Issue 5, No 3, September 2012. ISSN
  (Online): 1694-0814. www.IJCSI.org",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a new data hiding technique. The new technique uses
steganography and cryptography on images with a size of 256x256 pixels and an
8-bit grayscale format. There are design restrictions such as a fixed-size
cover image, and reconstruction without error of the hidden image. The
steganography technique uses a Haar-DWT (Discrete Wavelet Transform) with hard
thresholding and LSB (Less Significant Bit) technique on the cover image. The
algorithms used for compressing and ciphering the secret image are lossless JPG
and AES, respectively. The proposed technique is used to generate a stego image
which provides a double type of security that is robust against attacks.
Results are reported for different thresholds levels in terms of PSNR.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2012 22:45:14 GMT'}]",2012-12-13,"[['Soria', 'Francisco Rubén Castillo', ''], ['Torres', 'Gustavo Fernández', ''], ['Algredo-Badillo', 'Ignacio', '']]","['Hiding Technique', 'Haar transform', 'AES algorithm', 'Steganography', 'Cryptography']"
13836,0909.2373,Nevin Vunka Jungum,"M. Nageshkumar, P.K. Mahesh and M.N.S. Swamy","An Efficient Secure Multimodal Biometric Fusion Using Palmprint and Face
  Image","International Journal of Computer Science Issues (IJCSI), Volume 1,
  pp49-53, August 2009","M.Nageshkumar,P.K.Mahesh and M.N.S.Swamy, ""An Efficient Secure
  Multimodal Biometric Fusion Using Palmprint and Face Image"", International
  Journal of Computer Science Issues (IJCSI), Volume 1, pp49-53, August 2009",,,cs.CV cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Biometrics based personal identification is regarded as an effective method
for automatically recognizing, with a high confidence a person's identity. A
multimodal biometric systems consolidate the evidence presented by multiple
biometric sources and typically better recognition performance compare to
system based on a single biometric modality. This paper proposes an
authentication method for a multimodal biometric system identification using
two traits i.e. face and palmprint. The proposed system is designed for
application where the training data contains a face and palmprint. Integrating
the palmprint and face features increases robustness of the person
authentication. The final decision is made by fusion at matching score level
architecture in which features vectors are created independently for query
measures and are then compared to the enrolment template, which are stored
during database preparation. Multimodal biometric system is developed through
fusion of face and palmprint recognition.
","[{'version': 'v1', 'created': 'Sat, 12 Sep 2009 21:31:22 GMT'}]",2009-09-15,"[['Nageshkumar', 'M.', ''], ['Mahesh', 'P. K.', ''], ['Swamy', 'M. N. S.', '']]","['Biometrics', 'multimodal', 'face', 'palmprint', 'fusion module', 'matching module', 'decision module']"
13837,1604.08066,Johanne Cohen,"Johanne Cohen, Jonas Lef\`evre, Khaled Ma\^amra, George Manoussakis,
  Laurence Pilard","The Manne et al. self-stabilizing 2/3-approximation matching algorithm
  is sub-exponential",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Manne et al. designed the first algorithm computing a maximal matching that
is a 2/3 -approximation of the maximum matching in $O(^2n)$ moves. However, the
complexity tightness was not proved. In this paper, we exhibit a
sub-exponential execution of this matching algorithm.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2016 13:40:55 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Jul 2016 10:29:52 GMT'}, {'version': 'v3', 'created': 'Tue, 18 Apr 2017 13:06:49 GMT'}]",2017-04-19,"[['Cohen', 'Johanne', ''], ['Lefèvre', 'Jonas', ''], ['Maâmra', 'Khaled', ''], ['Manoussakis', 'George', ''], ['Pilard', 'Laurence', '']]","['Search games', 'randomized algorithms', 'competitive analysis', 'game theory']"
13838,1212.2207,Youssef Bassil,Youssef Bassil,A Two Intermediates Audio Steganography Technique,"LACSC - Lebanese Association for Computational Sciences,
  http://www.lacsc.org. arXiv admin note: substantial text overlap with
  arXiv:1212.2064","Journal of Emerging Trends in Computing and Information Sciences
  (CIS), vol. 3, no.11, pp.1459-1465, 2012",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  On the rise of the Internet, digital data became openly public which has
driven IT industries to pay special consideration to data confidentiality. At
present, two main techniques are being used: Cryptography and Steganography. In
effect, cryptography garbles a secret message turning it into a meaningless
form; while, steganography hides the very existence of the message by embedding
it into an intermediate such as a computer file. In fact, in audio
steganography, this computer file is a digital audio file in which secret data
are concealed, predominantly, into the bits that make up its audio samples.
This paper proposes a novel steganography technique for hiding digital data
into uncompressed audio files using a randomized algorithm and a context-free
grammar coupled with a lexicon of words. Furthermore, the proposed technique
uses two intermediates to transmit the secret data between communicating
parties: The first intermediate is an audio file whose audio samples, which are
selected randomly, are used to conceal the secret data; whereas, the second
intermediate is a grammatically correct English text that is generated at
runtime using a context-free grammar and it encodes the location of the random
audio samples in the audio file. The proposed technique is stealthy and
irrecoverable in a sense that it is difficult for unauthorized third parties to
detect the presence of and recover the secret data. Experiments conducted
showed how the covering and the uncovering processes of the proposed technique
work. As future work, a semantic analyzer is to be developed so as to make the
intermediate text not only grammatically correct but also semantically
plausible.
","[{'version': 'v1', 'created': 'Mon, 10 Dec 2012 14:05:52 GMT'}]",2012-12-12,"[['Bassil', 'Youssef', '']]","['Computer Security', 'Information Hiding', 'Audio Steganography', 'Context-Free Grammar']"
13839,1205.6572,Amiya Halder,Amiya Halder and Soumajit Pramanik,"An Unsupervised Dynamic Image Segmentation using Fuzzy Hopfield Neural
  Network based Genetic Algorithm",8 pages,IJCSI March 2012,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a Genetic Algorithm based segmentation method that can
automatically segment gray-scale images. The proposed method mainly consists of
spatial unsupervised grayscale image segmentation that divides an image into
regions. The aim of this algorithm is to produce precise segmentation of images
using intensity information along with neighborhood relationships. In this
paper, Fuzzy Hopfield Neural Network (FHNN) clustering helps in generating the
population of Genetic algorithm which there by automatically segments the
image. This technique is a powerful method for image segmentation and works for
both single and multiple-feature data with spatial information. Validity index
has been utilized for introducing a robust technique for finding the optimum
number of components in an image. Experimental results shown that the algorithm
generates good quality segmented image.
","[{'version': 'v1', 'created': 'Wed, 30 May 2012 08:10:59 GMT'}]",2012-05-31,"[['Halder', 'Amiya', ''], ['Pramanik', 'Soumajit', '']]","['Clustering', 'Image Segmentation', 'Fuzzy Hopfield Neural Network', 'Genetic Algorithm']"
13840,1702.04013,Piotr Szyma\'nski,Piotr Szyma\'nski and Tomasz Kajdanowicz,"Is a Data-Driven Approach still Better than Random Choice with Naive
  Bayes classifiers?",,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the performance of data-driven, a priori and random approaches to
label space partitioning for multi-label classification with a Gaussian Naive
Bayes classifier. Experiments were performed on 12 benchmark data sets and
evaluated on 5 established measures of classification quality: micro and macro
averaged F1 score, Subset Accuracy and Hamming loss. Data-driven methods are
significantly better than an average run of the random baseline. In case of F1
scores and Subset Accuracy - data driven approaches were more likely to perform
better than random approaches than otherwise in the worst case. There always
exists a method that performs better than a priori methods in the worst case.
The advantage of data-driven methods against a priori methods with a weak
classifier is lesser than when tree classifiers are used.
","[{'version': 'v1', 'created': 'Mon, 13 Feb 2017 23:04:31 GMT'}]",2017-02-15,"[['Szymański', 'Piotr', ''], ['Kajdanowicz', 'Tomasz', '']]","['multi-label classification', 'label space clustering', 'data-driven classification']"
13841,1412.8690,Francis Bach,"Francis Bach (LIENS, SIERRA)",Breaking the Curse of Dimensionality with Convex Neural Networks,,,,,cs.LG math.OC math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider neural networks with a single hidden layer and non-decreasing
homogeneous activa-tion functions like the rectified linear units. By letting
the number of hidden units grow unbounded and using classical non-Euclidean
regularization tools on the output weights, we provide a detailed theoretical
analysis of their generalization performance, with a study of both the
approximation and the estimation errors. We show in particular that they are
adaptive to unknown underlying linear structures, such as the dependence on the
projection of the input variables onto a low-dimensional subspace. Moreover,
when using sparsity-inducing norms on the input weights, we show that
high-dimensional non-linear variable selection may be achieved, without any
strong assumption regarding the data and with a total number of variables
potentially exponential in the number of ob-servations. In addition, we provide
a simple geometric interpretation to the non-convex problem of addition of a
new unit, which is the core potentially hard computational element in the
framework of learning from continuously many basis functions. We provide simple
conditions for convex relaxations to achieve the same generalization error
bounds, even when constant-factor approxi-mations cannot be found (e.g.,
because it is NP-hard such as for the zero-homogeneous activation function). We
were not able to find strong enough convex relaxations and leave open the
existence or non-existence of polynomial-time algorithms.
","[{'version': 'v1', 'created': 'Tue, 30 Dec 2014 17:08:00 GMT'}, {'version': 'v2', 'created': 'Mon, 31 Oct 2016 08:38:03 GMT'}]",2016-11-01,"[['Bach', 'Francis', '', 'LIENS, SIERRA']]","['Neural networks', 'non-parametric estimation', 'convex optimization', 'convex relaxation']"
13842,1111.2160,Sudir Lande b.,"Sudhir B. Lande, J. B. Helonde, Rajesh Pande, S. S. Pathak","Adaptive Subcarrier and Bit Allocation for Downlink OFDMA System with
  Proportional Fairness",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates the adaptive subcarrier and bit allocation algorithm
for OFDMA systems. To minimize overall transmitted power, we propose a novel
adaptive subcarrier and bit allocation algorithm based on channel state
information (CSI) and quality state information (QSI). A suboptimal approach
that separately performs subcarrier allocation and bit loading is proposed. It
is shown that a near optimal solution is obtained by the proposed algorithm
which has low complexity compared to that of other conventional algorithm. We
will study the problem of finding an optimal sub-carrier and power allocation
strategy for downlink communication to multiple users in an OFDMA based
wireless system. Assuming knowledge of the instantaneous channel gains for all
users, we propose a multiuser OFDMA subcarrier, and bit allocation algorithm to
minimize the total transmit power. This is done by assigning each user a set of
subcarriers and by determining the number of bits and the transmit power level
for each subcarrier. The objective is to minimize the total transmitted power
over the entire network to satisfy the application layer and physical layer. We
formulate this problem as a constrained optimization problem and present
centralized algorithms. The simulation results will show that our approach
results in an efficient assignment of subcarriers and transmitter power levels
in terms of the energy required for transmitting each bit of information, to
address this need, we also present a bit loading algorithm for allocating
subcarriers and bits in order to satisfy the rate requirements of the links.
","[{'version': 'v1', 'created': 'Wed, 9 Nov 2011 10:23:42 GMT'}]",2011-11-10,"[['Lande', 'Sudhir B.', ''], ['Helonde', 'J. B.', ''], ['Pande', 'Rajesh', ''], ['Pathak', 'S. S.', '']]","['Orthogonal frequency division multiplexing', 'OFDMA', 'QSI', 'QoS', 'Dynamic resource allocation', 'Waterfilling', 'SNR']"
13843,1310.0365,Pavel Golovinski,"P.A. Golovinski, V.A. Astapenko",The complex-valued encoding for dicision-making based on aliasing data,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is proposed a complex valued channel encoding for multidimensional data.
The basic approach contains overlapping of complex nonlinear mappings. Its
development leads to sparse representation of multi-channel data, increasing
their dimensions and the distance between the images.
","[{'version': 'v1', 'created': 'Tue, 1 Oct 2013 16:06:00 GMT'}]",2013-10-02,"[['Golovinski', 'P. A.', ''], ['Astapenko', 'V. A.', '']]","['multi-channel encoding', 'non-linear mapping', 'sparse data', 'pattern recognition']"
13844,1409.5330,Shaobo Lin,"Jian Fang, Shaobo Lin, Zongben Xu","Learning and approximation capability of orthogonal super greedy
  algorithm","30 pages,14 figures",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the approximation capability of orthogonal super greedy
algorithms (OSGA) and its applications in supervised learning. OSGA is
concerned with selecting more than one atoms in each iteration step, which, of
course, greatly reduces the computational burden when compared with the
conventional orthogonal greedy algorithm (OGA). We prove that even for function
classes that are not the convex hull of the dictionary, OSGA does not degrade
the approximation capability of OGA provided the dictionary is incoherent.
Based on this, we deduce a tight generalization error bound for OSGA learning.
Our results show that in the realm of supervised learning, OSGA provides a
possibility to further reduce the computational burden of OGA in the premise of
maintaining its prominent generalization capability.
","[{'version': 'v1', 'created': 'Thu, 18 Sep 2014 15:09:47 GMT'}]",2014-09-19,"[['Fang', 'Jian', ''], ['Lin', 'Shaobo', ''], ['Xu', 'Zongben', '']]","['supervised learning', 'nonlinear approximation', 'orthogonal super greedy']"
13845,0907.0332,James Whitacre,James M Whitacre,"Survival of the flexible: explaining the recent dominance of
  nature-inspired optimization within a rapidly evolving world",,,,,cs.NE cs.AI,http://creativecommons.org/licenses/by/3.0/,"  Although researchers often comment on the rising popularity of
nature-inspired meta-heuristics (NIM), there has been a paucity of data to
directly support the claim that NIM are growing in prominence compared to other
optimization techniques. This study presents evidence that the use of NIM is
not only growing, but indeed appears to have surpassed mathematical
optimization techniques (MOT) in several important metrics related to academic
research activity (publication frequency) and commercial activity (patenting
frequency). Motivated by these findings, this article discusses some of the
possible origins of this growing popularity. I review different explanations
for NIM popularity and discuss why some of these arguments remain unsatisfying.
I argue that a compelling and comprehensive explanation should directly account
for the manner in which most NIM success has actually been achieved, e.g.
through hybridization and customization to different problem environments. By
taking a problem lifecycle perspective, this paper offers a fresh look at the
hypothesis that nature-inspired meta-heuristics derive much of their utility
from being flexible. I discuss global trends within the business environments
where optimization algorithms are applied and I speculate that highly flexible
algorithm frameworks could become increasingly popular within our diverse and
rapidly changing world.
","[{'version': 'v1', 'created': 'Thu, 2 Jul 2009 10:27:23 GMT'}, {'version': 'v2', 'created': 'Sat, 12 Dec 2009 15:38:31 GMT'}, {'version': 'v3', 'created': 'Fri, 21 Jan 2011 09:28:20 GMT'}]",2011-01-24,"[['Whitacre', 'James M', '']]","['decision theory', 'evolutionary algorithms', 'mathematical programming', 'nature-inspired meta-heuristics', 'operations research', 'optimization']"
13846,1712.02441,Farzaneh S. Fard,"Farzaneh S. Fard, and Thomas P. Trappenberg","A Novel Model for Arbitration between Planning and Habitual Control
  Systems",,,,,cs.SY stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is well established that humans decision making and instrumental control
uses multiple systems, some which use habitual action selection and some which
require deliberate planning. Deliberate planning systems use predictions of
action-outcomes using an internal model of the agent's environment, while
habitual action selection systems learn to automate by repeating previously
rewarded actions. Habitual control is computationally efficient but may be
inflexible in changing environments. Conversely, deliberate planning may be
computationally expensive, but flexible in dynamic environments. This paper
proposes a general architecture comprising both control paradigms by
introducing an arbitrator that controls which subsystem is used at any time.
This system is implemented for a target-reaching task with a simulated
two-joint robotic arm that comprises a supervised internal model and deep
reinforcement learning. Through permutation of target-reaching conditions, we
demonstrate that the proposed is capable of rapidly learning kinematics of the
system without a priori knowledge, and is robust to (A) changing environmental
reward and kinematics, and (B) occluded vision. The arbitrator model is
compared to exclusive deliberate planning with the internal model and exclusive
habitual control instances of the model. The results show how such a model can
harness the benefits of both systems, using fast decisions in reliable
circumstances while optimizing performance in changing environments. In
addition, the proposed model learns very fast. Finally, the system which
includes internal models is able to reach the target under the visual
occlusion, while the pure habitual system is unable to operate sufficiently
under such conditions.
","[{'version': 'v1', 'created': 'Wed, 6 Dec 2017 23:33:40 GMT'}]",2017-12-11,"[['Fard', 'Farzaneh S.', ''], ['Trappenberg', 'Thomas P.', '']]","['Machine Learning', 'Reinforcement Learning', 'SupervisedLearning', 'Habitual controller', 'Planning', 'Internal Models', 'Decision Making']"
13847,1305.5823,Anna Harutyunyan,Glencora Borradaile and Anna Harutyunyan,Maximum st-flow in directed planar graphs via shortest paths,"20 pages, 4 figures. Short version to be published in proceedings of
  IWOCA'13",,,,cs.DS cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Minimum cuts have been closely related to shortest paths in planar graphs via
planar duality - so long as the graphs are undirected. Even maximum flows are
closely related to shortest paths for the same reason - so long as the source
and the sink are on a common face. In this paper, we give a correspondence
between maximum flows and shortest paths via duality in directed planar graphs
with no constraints on the source and sink. We believe this a promising avenue
for developing algorithms that are more practical than the current
asymptotically best algorithms for maximum st-flow.
","[{'version': 'v1', 'created': 'Fri, 24 May 2013 18:42:49 GMT'}]",2013-05-27,"[['Borradaile', 'Glencora', ''], ['Harutyunyan', 'Anna', '']]","['maximum flows', 'shortest paths', 'planar graphs']"
13848,1510.00240,Denis Gordeev,Rodmonga Potapova and Denis Gordeev,"Determination of the Internet Anonymity Influence on the Level of
  Aggression and Usage of Obscene Lexis",,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article deals with the analysis of the semantic content of the anonymous
Russian-speaking forum 2ch.hk, different verbal means of expressing of the
emotional state of aggression are revealed for this site, and aggression is
classified by its directions. The lexis of different Russian-and English-
speaking anonymous forums (2ch.hk and iichan.hk, 4chan.org) and public
community ""MDK"" of the Russian-speaking social network VK is analyzed and
compared with the Open Corpus of the Russian language (Opencorpora.org and
Brown corpus). The analysis shows that anonymity has no influence on the amount
of invective items usage. The effectiveness of moderation was shown for
anonymous forums. It was established that Russian obscene lexis was used to
express the emotional state of aggression only in 60.4% of cases for 2ch.hk.
These preliminary results show that the Russian obscene lexis on the Internet
does not have direct dependence on the emotional state of aggression.
","[{'version': 'v1', 'created': 'Thu, 1 Oct 2015 14:01:32 GMT'}]",2015-10-02,"[['Potapova', 'Rodmonga', ''], ['Gordeev', 'Denis', '']]","['imageboard', '2ch.hk', 'verbal corpus', 'Internet', 'aggression', 'obscene', 'invective', 'VK; 4chan']"
13849,1606.02686,J\'anos V\'egh,J\'anos V\'egh and P\'eter Moln\'ar and J\'ozsef V\'as\'arhelyi,"A figure of merit for describing the performance of scaling of
  parallelization","14 pages, 6 figures. Contains qualifying merits for scaling in case
  of compiling methods, HW architectures and algorithms",,,,cs.PF cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the spread of multi- and many-core processors more and more typical task
is to re-implement some source code written originally for a single processor
to run on more than one cores. Since it is a serious investment, it is
important to decide how much efforts pays off, and whether the resulting
implementation has as good performability as it could be. The Amdahl's law
provides some theoretical upper limits for the performance gain reachable
through parallelizing the code, but it needs the detailed architectural
knowledge of the program code, does not consider the housekeeping activity
needed for parallelization and cannot tell how the actual stage of
parallelization implementation performs. The present paper suggests a
quantitative measure for that goal. This figure of merit is derived
experimentally, from measured running time, and number of threads/cores. It can
be used to quantify the used parallelization technology, the connection between
the computing units, the acceleration technology under the given conditions,
communication method within SoC, or the performance of the software
team/compiler.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2016 18:55:10 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Jul 2016 06:40:18 GMT'}, {'version': 'v3', 'created': 'Fri, 22 Jul 2016 06:58:52 GMT'}]",2016-07-25,"[['Végh', 'János', ''], ['Molnár', 'Péter', ''], ['Vásárhelyi', 'József', '']]","['multi-core', 'parallelization', 'performance', 'scaling', 'figure of merit']"
13850,1206.1492,Georg Singer,"Georg Singer, Ulrich Norbisrath, Dirk Lewandowski",Ordinary Search Engine Users Carrying Out Complex Search Tasks,60 pages,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web search engines have become the dominant tools for finding information on
the Internet. Due to their popularity, users apply them to a wide range of
search needs, from simple look-ups to rather complex information tasks. This
paper presents the results of a study to investigate the characteristics of
these complex information needs in the context of Web search engines. The aim
of the study is to find out more about (1) what makes complex search tasks
distinct from simple tasks and if it is possible to find simple measures for
describing their complexity, (2) if search success for a task can be predicted
by means of unique measures, and (3) if successful searchers show a different
behavior than unsuccessful ones. The study includes 60 people who carried out a
set of 12 search tasks with current commercial search engines. Their behavior
was logged with the Search-Logger tool. The results confirm that complex tasks
show significantly different characteristics than simple tasks. Yet it seems to
be difficult to distinguish successful from unsuccessful search behaviors. Good
searchers can be differentiated from bad searchers by means of measurable
parameters. The implications of these findings for search engine vendors are
discussed.
","[{'version': 'v1', 'created': 'Thu, 7 Jun 2012 13:45:05 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Jun 2012 10:30:36 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Jul 2012 13:29:45 GMT'}]",2012-07-05,"[['Singer', 'Georg', ''], ['Norbisrath', 'Ulrich', ''], ['Lewandowski', 'Dirk', '']]","['Web search engines', 'complex search', 'exploratory search', 'user study', 'simple', 'complex search tasks']"
13851,0906.4618,Pedro Peris-Lopez,"Pedro Peris-Lopez, Julio C. Hernandez-Castro, Christos Dimitrakakis,
  Aikaterini Mitrokotsa, Juan M. E. Tapiador","Shedding Light on RFID Distance Bounding Protocols and Terrorist Fraud
  Attacks","31 pages, 10 figures, 1 table",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The vast majority of RFID authentication protocols assume the proximity
between readers and tags due to the limited range of the radio channel.
However, in real scenarios an intruder can be located between the prover (tag)
and the verifier (reader) and trick this last one into thinking that the prover
is in close proximity. This attack is generally known as a relay attack in
which scope distance fraud, mafia fraud and terrorist attacks are included.
Distance bounding protocols represent a promising countermeasure to hinder
relay attacks. Several protocols have been proposed during the last years but
vulnerabilities of major or minor relevance have been identified in most of
them. In 2008, Kim et al. [1] proposed a new distance bounding protocol with
the objective of being the best in terms of security, privacy, tag
computational overhead and fault tolerance. In this paper, we analyze this
protocol and we present a passive full disclosure attack, which allows an
adversary to discover the long-term secret key of the tag. The presented attack
is very relevant, since no security objectives are met in Kim et al.'s
protocol. Then, design guidelines are introduced with the aim of facilitating
protocol designers the stimulating task of designing secure and efficient
schemes against relay attacks. Finally a new protocol, named Hitomi and
inspired by [1], is designed conforming the guidelines proposed previously.
","[{'version': 'v1', 'created': 'Thu, 25 Jun 2009 07:12:26 GMT'}, {'version': 'v2', 'created': 'Sun, 20 Jun 2010 19:35:19 GMT'}]",2010-06-22,"[['Peris-Lopez', 'Pedro', ''], ['Hernandez-Castro', 'Julio C.', ''], ['Dimitrakakis', 'Christos', ''], ['Mitrokotsa', 'Aikaterini', ''], ['Tapiador', 'Juan M. E.', '']]","['RFID', 'distance bounding protocols', 'relay attacks', 'terrorist fraud attacks', 'full disclosure attacks']"
13852,1406.3728,Jubair Basha N Md,"N.Md Jubair Basha, Salman Abdul Moiz",Component Based Software Development: A State of Art,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the goals of Software design is to model a system in such a way that
it is reused. Actively reusing designs or code allows taking advantage of the
investment made on reusable components. However development of domain specific
components and its impact on effort in terms of cost and time is still a
challenging issue. The component based technology has transformed over a period
of time from a simple component to the domain specific components. This paper
presents a state of art of the drastic change in component technology from
component engineering to domain engineering.
","[{'version': 'v1', 'created': 'Sat, 14 Jun 2014 13:27:51 GMT'}]",2014-06-17,"[['Basha', 'N. Md Jubair', ''], ['Moiz', 'Salman Abdul', '']]","['Components;CBD', 'DE', 'product lines', 'Domain']"
13853,1710.05958,Sayna Ebrahimi,"Sayna Ebrahimi, Anna Rohrbach, Trevor Darrell",Gradient-free Policy Architecture Search and Adaptation,"Accepted in Conference on Robot Learning, 2017",,,,cs.LG cs.AI cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop a method for policy architecture search and adaptation via
gradient-free optimization which can learn to perform autonomous driving tasks.
By learning from both demonstration and environmental reward we develop a model
that can learn with relatively few early catastrophic failures. We first learn
an architecture of appropriate complexity to perceive aspects of world state
relevant to the expert demonstration, and then mitigate the effect of
domain-shift during deployment by adapting a policy demonstrated in a source
domain to rewards obtained in a target environment. We show that our approach
allows safer learning than baseline methods, offering a reduced cumulative
crash metric over the agent's lifetime as it learns to drive in a realistic
simulated environment.
","[{'version': 'v1', 'created': 'Mon, 16 Oct 2017 18:47:35 GMT'}]",2017-10-18,"[['Ebrahimi', 'Sayna', ''], ['Rohrbach', 'Anna', ''], ['Darrell', 'Trevor', '']]","['gradient-free optimization', 'architecture search', 'domain adaptation', 'autonomous driving']"
13854,1109.1087,Martin Aruldoss Mr,"A.Martin, M.Manjula, Dr.V.Prasanna Venkatesan","A Business Intelligence Model to Predict Bankruptcy using Financial
  Domain Ontology with Association Rule Mining Algorithm","Bankruptcy, Financial domain Ontology, Data Mining, Z-Score Model,
  Business Intelligence, Altman Bankruptcy model","IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 3, No. 2, May 2011 ISSN (Online): 1694-0814",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today in every organization financial analysis provides the basis for
understanding and evaluating the results of business operations and delivering
how well a business is doing. This means that the organizations can control the
operational activities primarily related to corporate finance. One way that
doing this is by analysis of bankruptcy prediction. This paper develops an
ontological model from financial information of an organization by analyzing
the Semantics of the financial statement of a business. One of the best
bankruptcy prediction models is Altman Z-score model. Altman Z-score method
uses financial rations to predict bankruptcy. From the financial ontological
model the relation between financial data is discovered by using data mining
algorithm. By combining financial domain ontological model with association
rule mining algorithm and Zscore model a new business intelligence model is
developed to predict the bankruptcy.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2011 07:02:35 GMT'}]",2011-09-07,"[['Martin', 'A.', ''], ['Manjula', 'M.', ''], ['Venkatesan', 'Dr. V. Prasanna', '']]","['Bankruptcy', 'Financial domain Ontology', 'Data Mining', 'Z-Score Model']"
13855,1312.7522,Piotr Borowiecki,"Gabor Bacso, Piotr Borowiecki, Mihaly Hujter and Zsolt Tuza",Minimum order of graphs with given coloring parameters,"23 pages, 6 figures",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A complete $k$-coloring of a graph $G=(V,E)$ is an assignment
$\varphi:V\to\{1,\ldots,k\}$ of colors to the vertices such that no two
vertices of the same color are adjacent, and the union of any two color classes
contains at least one edge. Three extensively investigated graph invariants
related to complete colorings are the minimum and maximum number of colors in a
complete coloring (chromatic number $\chi(G)$ and achromatic number $\psi(G)$,
respectively), and the Grundy number $\Gamma(G)$ defined as the largest $k$
admitting a complete coloring $\varphi$ with exactly $k$ colors such that every
vertex $v\in V$ of color $\varphi(v)$ has a neighbor of color $i$ for all $1\le
i<\varphi(v)$. The inequality chain $\chi(G)\le \Gamma(G)\le \psi(G)$ obviously
holds for all graphs $G$. A triple $(f,g,h)$ of positive integers at least 2 is
called realizable if there exists a connected graph $G$ with $\chi(G)=f$,
$\Gamma(G)=g$, and $\psi(G)=h$. Chartrand et al. (A note on graphs with
prescribed complete coloring numbers, J. Combin. Math. Combin. Comput. LXXIII
(2010) 77-84) found the list of realizable triples. In this paper we determine
the minimum number of vertices in a connected graph with chromatic number $f$,
Grundy number $g$, and achromatic number $h$, for all realizable triples
$(f,g,h)$ of integers. Furthermore, for $f=g=3$ we describe the (two) extremal
graphs for each $h \geq 6$. For $h=4$ and $5$, there are more extremal graphs,
their description is contained as well.
","[{'version': 'v1', 'created': 'Sun, 29 Dec 2013 11:31:32 GMT'}]",2013-12-31,"[['Bacso', 'Gabor', ''], ['Borowiecki', 'Piotr', ''], ['Hujter', 'Mihaly', ''], ['Tuza', 'Zsolt', '']]","['graph coloring', 'Grundy number', 'achromatic number', 'greedy algorithm', 'extremal graph', 'bipartite graph']"
13856,1511.09289,Lijun Ji,"Jingyuan Chen, Yun Li and Lijun Ji","Combinatorial Constructions of Optimal $(m, n,4,2)$ Optical Orthogonal
  Signature Pattern Codes","24 pages. arXiv admin note: text overlap with arXiv:1312.7589 by
  other authors",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optical orthogonal signature pattern codes (OOSPCs) play an important role in
a novel type of optical code-division multiple-access (CDMA) network for
2-dimensional image transmission. There is a one-to-one correspondence between
an $(m, n, w, \lambda)$-OOSPC and a $(\lambda+1)$-$(mn,w,1)$ packing design
admitting an automorphism group isomorphic to $\mathbb{Z}_m\times
\mathbb{Z}_n$. In 2010, Sawa gave the first infinite class of $(m, n, 4,
2)$-OOSPCs by using $S$-cyclic Steiner quadruple systems. In this paper, we use
various combinatorial designs such as strictly $\mathbb{Z}_m\times
\mathbb{Z}_n$-invariant $s$-fan designs, strictly $\mathbb{Z}_m\times
\mathbb{Z}_n$-invariant $G$-designs and rotational Steiner quadruple systems to
present some constructions for $(m, n, 4, 2)$-OOSPCs. As a consequence, our new
constructions yield more infinite families of optimal $(m, n, 4, 2)$-OOSPCs.
Especially, we shall see that in some cases an optimal $(m, n, 4, 2)$-OOSPC can
not achieve the Johnson bound.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2015 13:08:29 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Sep 2016 01:52:04 GMT'}]",2016-09-26,"[['Chen', 'Jingyuan', ''], ['Li', 'Yun', ''], ['Ji', 'Lijun', '']]","['Automorphism group', 'packing design', 'optical orthogonal code', 'optical orthogonalsignature pattern code', 'spatial optical CDMA']"
13857,0806.1271,Andreas Klappenecker,"Andreas Klappenecker, Hyunyoung Lee, Jennifer L. Welch (Texas A&M
  University)",Scheduling Sensors by Tiling Lattices,"9 pages, 11 figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Suppose that wirelessly communicating sensors are placed in a regular fashion
on the points of a lattice. Common communication protocols allow the sensors to
broadcast messages at arbitrary times, which can lead to problems should two
sensors broadcast at the same time. It is shown that one can exploit a tiling
of the lattice to derive a deterministic periodic schedule for the broadcast
communication of sensors that is guaranteed to be collision-free. The proposed
schedule is shown to be optimal in the number of time slots.
","[{'version': 'v1', 'created': 'Sat, 7 Jun 2008 07:36:34 GMT'}]",2008-06-10,"[['Klappenecker', 'Andreas', '', 'Texas A&M\n  University'], ['Lee', 'Hyunyoung', '', 'Texas A&M\n  University'], ['Welch', 'Jennifer L.', '', 'Texas A&M\n  University']]","['distributed computing', 'scheduling sensors', 'lattice tiling', 'wireless communication']"
13858,1306.4793,Larry Bull,Larry Bull,Evolving Boolean Regulatory Networks with Epigenetic Control,"18 pages, 10 figures. arXiv admin note: substantial text overlap with
  arXiv:1303.7220",,,,cs.NE q-bio.MN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The significant role of epigenetic mechanisms within natural systems has
become increasingly clear. This paper uses a recently presented abstract,
tunable Boolean genetic regulatory network model to explore aspects of
epigenetics. It is shown how dynamically controlling transcription via a DNA
methylation-inspired mechanism can be selected for by simulated evolution under
various single and multiple cell scenarios. Further, it is shown that the
effects of such control can be inherited without detriment to fitness.
","[{'version': 'v1', 'created': 'Thu, 20 Jun 2013 09:00:40 GMT'}]",2013-06-21,"[['Bull', 'Larry', '']]","['Development', 'Dynamical systems', 'Methylation', 'Multicellularity', 'RBNK model']"
13859,1202.6609,Gilles Falquet,"Claudine M\'etral, Nizar Ghoula, Gilles Falquet","Towards an Integrated Visualization Of Semantically Enriched 3D City
  Models: An Ontology of 3D Visualization Techniques",,,,,cs.AI cs.GR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  3D city models - which represent in 3 dimensions the geometric elements of a
city - are increasingly used for an intended wide range of applications. Such
uses are made possible by using semantically enriched 3D city models and by
presenting such enriched 3D city models in a way that allows decision-making
processes to be carried out from the best choices among sets of objectives, and
across issues and scales. In order to help in such a decision-making process we
have defined a framework to find the best visualization technique(s) for a set
of potentially heterogeneous data that have to be visualized within the same 3D
city model, in order to perform a given task in a specific context. We have
chosen an ontology-based approach. This approach and the specification and use
of the resulting ontology of 3D visualization techniques are described in this
paper.
","[{'version': 'v1', 'created': 'Wed, 29 Feb 2012 17:15:53 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Apr 2012 13:33:10 GMT'}]",2012-04-19,"[['Métral', 'Claudine', ''], ['Ghoula', 'Nizar', ''], ['Falquet', 'Gilles', '']]","['3D visualization technique', 'integrated visualization', 'ontology', 'enriched 3D city models  1']"
13860,1609.02638,Richard Wang,Guanghui Wang,"Robust Structure from Motion in the Presence of Outliers and Missing
  Data",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Structure from motion is an import theme in computer vision. Although great
progress has been made both in theory and applications, most of the algorithms
only work for static scenes and rigid objects. In recent years, structure and
motion recovery of non-rigid objects and dynamic scenes have received a lot of
attention. In this paper, the state-of-the-art techniques for structure and
motion factorization of non-rigid objects are reviewed and discussed. First, an
introduction of the structure from motion problem is presented, followed by a
general formulation of non-rigid structure from motion. Second, an augmented
affined factorization framework, by using homogeneous representation, is
presented to solve the registration issue in the presence of outlying and
missing data. Third, based on the observation that the reprojection residuals
of outliers are significantly larger than those of inliers, a robust
factorization strategy with outlier rejection is proposed by means of the
reprojection residuals, followed by some comparative experimental evaluations.
Finally, some future research topics in non-rigid structure from motion are
discussed.
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2016 02:00:20 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Dec 2016 21:55:01 GMT'}]",2017-01-02,"[['Wang', 'Guanghui', '']]","['Structure from motion', 'nonrigid object', 'robust algorithm', 'matrix factorization', 'outlier rejection']"
13861,1003.3139,Andrea Cal\`i,Andrea Cali and Davide Martinenghi,Querying Incomplete Data over Extended ER Schemata,"40 pages, 1 figure.",,,,cs.DB cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since Chen's Entity-Relationship (ER) model, conceptual modeling has been
playing a fundamental role in relational data design. In this paper we consider
an extended ER (EER) model enriched with cardinality constraints, disjointness
assertions, and is-a relations among both entities and relationships. In this
setting, we consider the case of incomplete data, which is likely to occur, for
instance, when data from different sources are integrated. In such a context,
we address the problem of providing correct answers to conjunctive queries by
reasoning on the schema. Based on previous results about decidability of the
problem, we provide a query answering algorithm that performs rewriting of the
initial query into a recursive Datalog query encoding the information about the
schema. We finally show extensions to more general settings. This paper will
appear in the special issue of Theory and Practice of Logic Programming (TPLP)
titled Logic Programming in Databases: From Datalog to Semantic-Web Rules.
","[{'version': 'v1', 'created': 'Tue, 16 Mar 2010 12:55:21 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Apr 2010 19:37:01 GMT'}]",2015-03-13,"[['Cali', 'Andrea', ''], ['Martinenghi', 'Davide', '']]","['Extended ER model', 'Dependencies', 'Chase', 'Incomplete Data']"
13862,1603.02130,Jing (Janet) Liu,Jing Liu and John D. Backes and Darren Cofer and Andrew Gacek,From Design Contracts to Component Requirements Verification,"15 pages, 2 figures, conference submission",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During the development and verification of complex airborne systems, a
variety of languages and development environments are used for different levels
of the system hierarchy. As a result, there may be manual steps to translate
requirements between these different environments. This paper presents a
tool-supported export technique that translates high-level requirements from
the software architecture modeling environment into observers of requirements
that can be used for verification in the software component environment. This
allows efficient verification that the component designs comply with their
high-level requirements. It also provides an automated tool chain supporting
formal verification from system requirements down to low-level software
requirements that is consistent with certification guidance for avionics
systems. The effectiveness of the technique has been evaluated and demonstrated
on a medical infusion pump and an aircraft wheel braking system.
","[{'version': 'v1', 'created': 'Mon, 7 Mar 2016 16:09:42 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Apr 2016 21:28:19 GMT'}]",2016-04-26,"[['Liu', 'Jing', ''], ['Backes', 'John D.', ''], ['Cofer', 'Darren', ''], ['Gacek', 'Andrew', '']]","['design contracts', 'specification model', 'design model', 'AGREE', 'Simulink', 'requirements-based verification', 'certification']"
13863,1206.1579,Daniel Karapetyan Dr,Mohammad Reihaneh and Daniel Karapetyan,"An Efficient Hybrid Ant Colony System for the Generalized Traveling
  Salesman Problem",7 pages,Algorithmic Operations Research Vol. 7 (2012) 21-28,,,cs.AI math.CO math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Generalized Traveling Salesman Problem (GTSP) is an extension of the
well-known Traveling Salesman Problem (TSP), where the node set is partitioned
into clusters, and the objective is to find the shortest cycle visiting each
cluster exactly once. In this paper, we present a new hybrid Ant Colony System
(ACS) algorithm for the symmetric GTSP. The proposed algorithm is a
modification of a simple ACS for the TSP improved by an efficient GTSP-specific
local search procedure. Our extensive computational experiments show that the
use of the local search procedure dramatically improves the performance of the
ACS algorithm, making it one of the most successful GTSP metaheuristics to
date.
","[{'version': 'v1', 'created': 'Thu, 7 Jun 2012 19:01:11 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Jul 2012 05:53:19 GMT'}]",2012-07-06,"[['Reihaneh', 'Mohammad', ''], ['Karapetyan', 'Daniel', '']]","['Generalized Traveling Salesman Problem', 'Ant Colony Optimization', 'Ant Colony System']"
13864,1504.04640,Daviid Dice,"Dave Dice, Tim Harris, Alex Kogan, Yossi Lev",The Influence of Malloc Placement on TSX Hardware Transactional Memory,,,,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The hardware transactional memory (HTM) implementation in Intel's i7-4770
""Haswell"" processor tracks the transactional read-set in the L1 (level-1), L2
(level-2) and L3 (level-3) caches and the write-set in the L1 cache.
Displacement or eviction of read-set entries from the cache hierarchy or
write-set entries from the L1 results in abort. We show that the placement
policies of dynamic storage allocators -- such as those found in common
""malloc"" implementations -- can influence the L1 conflict miss rate in the L1.
Conflict misses -- sometimes called mapping misses -- arise because of less
than ideal associativity and represent imbalanced distribution of active memory
blocks over the set of available L1 indices. Under transactional execution
conflict misses may manifest as aborts, representing wasted or futile effort
instead of a simple stall as would occur in normal execution mode.
  Furthermore, when HTM is used for transactional lock elision (TLE),
persistent aborts arising from conflict misses can force the offending thread
through the so-called ""slow path"". The slow path is undesirable as the thread
must acquire the lock and run the critical section in normal execution mode,
precluding the concurrent execution of threads in the ""fast path"" that monitor
that same lock and run their critical sections in transactional mode. For a
given lock, multiple threads can concurrently use the transactional fast path,
but at most one thread can use the non-transactional slow path at any given
time. Threads in the slow path preclude safe concurrent fast path execution.
Aborts rising from placement policies and L1 index imbalance can thus result in
loss of concurrency and reduced aggregate throughput.
","[{'version': 'v1', 'created': 'Fri, 17 Apr 2015 21:13:07 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Apr 2015 20:05:56 GMT'}]",2015-05-01,"[['Dice', 'Dave', ''], ['Harris', 'Tim', ''], ['Kogan', 'Alex', ''], ['Lev', 'Yossi', '']]","['Concurrency', 'threads', 'caches', 'multicore', 'malloc', 'dynamic memory allocation', 'hardware transactional memory']"
13865,1702.02144,Jarek Duda dr,Jarek Duda,Rapid parametric density estimation,"8 pages, 4 figures",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parametric density estimation, for example as Gaussian distribution, is the
base of the field of statistics. Machine learning requires inexpensive
estimation of much more complex densities, and the basic approach is relatively
costly maximum likelihood estimation (MLE). There will be discussed inexpensive
density estimation, for example literally fitting a polynomial (or Fourier
series) to the sample, which coefficients are calculated by just averaging
monomials (or sine/cosine) over the sample. Another discussed basic application
is fitting distortion to some standard distribution like Gaussian - analogously
to ICA, but additionally allowing to reconstruct the disturbed density.
Finally, by using weighted average, it can be also applied for estimation of
non-probabilistic densities, like modelling mass distribution, or for various
clustering problems by using negative (or complex) weights: fitting a function
which sign (or argument) determines clusters. The estimated parameters are
approaching the optimal values with error dropping like $1/\sqrt{n}$, where $n$
is the sample size.
","[{'version': 'v1', 'created': 'Tue, 7 Feb 2017 16:55:37 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Feb 2017 14:29:27 GMT'}]",2017-02-21,"[['Duda', 'Jarek', '']]","['machine learning', 'statistics', 'density estimation', 'independent component analysis', 'clustering']"
13866,1710.05519,Kiem-Hieu Nguyen,Kiem-Hieu Nguyen,BKTreebank: Building a Vietnamese Dependency Treebank,Accepted for LREC 2018,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dependency treebank is an important resource in any language. In this paper,
we present our work on building BKTreebank, a dependency treebank for
Vietnamese. Important points on designing POS tagset, dependency relations, and
annotation guidelines are discussed. We describe experiments on POS tagging and
dependency parsing on the treebank. Experimental results show that the treebank
is a useful resource for Vietnamese language processing.
","[{'version': 'v1', 'created': 'Mon, 16 Oct 2017 05:49:29 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Feb 2018 10:45:32 GMT'}]",2018-02-22,"[['Nguyen', 'Kiem-Hieu', '']]","['treebank', 'dependency parsing', 'POS tagging', 'word segmentation', 'Vietnamese', 'less-resourced language']"
13867,1108.6195,Ruchi Tuli Dr.,"Ruchi Tuli, Parveen Kumar",Analysis of Recent Checkpointing Techniques for Mobile Computing Systems,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recovery from transient failures is one of the prime issues in the context of
distributed systems. These systems demand to have transparent yet efficient
techniques to achieve the same. Checkpoint is defined as a designated place in
a program where normal processing of a system is interrupted to preserve the
status information. Checkpointing is a process of saving status information.
Mobile computing systems often suffer from high failure rates that are
transient and independent in nature. To add reliability and high availability
to such distributed systems, checkpoint based rollback recovery is one of the
widely used techniques for applications such as scientific computing, database,
telecommunication applications and mission critical applications. This paper
surveys the algorithms which have been reported in the literature for
checkpointing in Mobile Computing Systems.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2011 11:38:29 GMT'}]",2011-09-01,"[['Tuli', 'Ruchi', ''], ['Kumar', 'Parveen', '']]","['Mobile computing systems', 'Co-ordinated checkpoint', 'rollback recovery', 'mobile host']"
13868,1511.08250,Bernardino Romera-Paredes,"Bernardino Romera-Paredes, Philip H. S. Torr",Recurrent Instance Segmentation,14 pages (main paper). 24 pages including references and appendix,ECCV 2016. 14th European Conference on Computer Vision,,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Instance segmentation is the problem of detecting and delineating each
distinct object of interest appearing in an image. Current instance
segmentation approaches consist of ensembles of modules that are trained
independently of each other, thus missing opportunities for joint learning.
Here we propose a new instance segmentation paradigm consisting in an
end-to-end method that learns how to segment instances sequentially. The model
is based on a recurrent neural network that sequentially finds objects and
their segmentations one at a time. This net is provided with a spatial memory
that keeps track of what pixels have been explained and allows occlusion
handling. In order to train the model we designed a principled loss function
that accurately represents the properties of the instance segmentation problem.
In the experiments carried out, we found that our method outperforms recent
approaches on multiple person segmentation, and all state of the art approaches
on the Plant Phenotyping dataset for leaf counting.
","[{'version': 'v1', 'created': 'Wed, 25 Nov 2015 23:28:14 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Apr 2016 22:45:04 GMT'}, {'version': 'v3', 'created': 'Mon, 24 Oct 2016 23:57:19 GMT'}]",2016-10-26,"[['Romera-Paredes', 'Bernardino', ''], ['Torr', 'Philip H. S.', '']]","['Instance segmentation', 'recurrent neural nets', 'deep learning']"
13869,1206.0133,Abdelaali Chaoub,Abdelaali Chaoub and Elhassane Ibn-Elhaj,"Comparison between Poissonian and Markovian Primary Traffics in
  Cognitive Radio Networks","IJCSI International Journal of Computer Science Issues, Vol. 9, Issue
  2, No 3, March 2012",,,,cs.NI stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cognitive Radio generates a big interest as a key cost-effective solution for
the underutilization of frequency spectrum in legacy communication networks.
The objective of this work lies in conducting a performance evaluation of the
end-to-end message delivery under both Markovian and Poissonian primary
traffics in lossy Cognitive Radio networks. We aim at inferring the most
appropriate conditions for an efficient secondary service provision according
to the Cognitive Radio network characteristics. Meanwhile, we have performed a
general analysis for many still open issues in Cognitive Radio, but at the end
only two critical aspects have been considered, namely, the unforeseen primary
reclaims in addition to the collided cognitive transmissions due to the
Opportunistic Spectrum Sharing. Some graphs, in view of the average Spectral
Efficiency, have been computed and plotted to report some comparative results
for a given video transmission under the Markovian and the Poissonian primary
interruptions.
","[{'version': 'v1', 'created': 'Fri, 1 Jun 2012 09:42:18 GMT'}]",2012-06-04,"[['Chaoub', 'Abdelaali', ''], ['Ibn-Elhaj', 'Elhassane', '']]","['Cognitive Radio Network', 'Multimedia Traffic Transmission', 'Spectral Efficiency', 'Markovian Traffic', 'Poissonian Traffic']"
13870,0907.2268,Martin Klein,"Martin Klein, Michael L Nelson","Evaluating Methods to Rediscover Missing Web Pages from the Web
  Infrastructure","10 pages, 11 figures, 5 tables, 40 references, accepted for
  publication at JCDL 2010 in Brisbane, Australia",,,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Missing web pages (pages that return the 404 ""Page Not Found"" error) are part
of the browsing experience. The manual use of search engines to rediscover
missing pages can be frustrating and unsuccessful. We compare four automated
methods for rediscovering web pages. We extract the page's title, generate the
page's lexical signature (LS), obtain the page's tags from the bookmarking
website delicious.com and generate a LS from the page's link neighborhood. We
use the output of all methods to query Internet search engines and analyze
their retrieval performance. Our results show that both LSs and titles perform
fairly well with over 60% URIs returned top ranked from Yahoo!. However, the
combination of methods improves the retrieval performance. Considering the
complexity of the LS generation, querying the title first and in case of
insufficient results querying the LSs second is the preferable setup. This
combination accounts for more than 75% top ranked URIs.
","[{'version': 'v1', 'created': 'Tue, 14 Jul 2009 15:47:57 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Apr 2010 03:27:17 GMT'}]",2010-04-19,"[['Klein', 'Martin', ''], ['Nelson', 'Michael L', '']]","['Web Page Discovery', 'Digital Preservation', 'Search Engines']"
13871,1710.03890,Nalin Asanka Gamagedara Arachchilage,Awanthika Rasanjalee Senarath and Nalin Asanka Gamagedara Arachchilage,Understanding Organizational Approach towards End User Privacy,12,"Australasian Conference on Information Systems, 2017, Hobart,
  Australia",,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  End user privacy is a critical concern for all organizations that collect,
process and store user data as a part of their business. Privacy concerned
users, regulatory bodies and privacy experts continuously demand organizations
provide users with privacy protection. Current research lacks an understanding
of organizational characteristics that affect an organization's motivation
towards user privacy. This has resulted in a ""one solution fits all"" approach,
which is incapable of providing sustainable solutions for organizational issues
related to user privacy. In this work, we have empirically investigated 40
diverse organizations on their motivations and approaches towards user privacy.
Resources such as newspaper articles, privacy policies and internal privacy
reports that display information about organizational motivations and
approaches towards user privacy were used in the study. We could observe
organizations to have two primary motivations to provide end users with privacy
as voluntary driven inherent motivation, and risk driven compliance motivation.
Building up on these findings we developed a taxonomy of organizational privacy
approaches and further explored the taxonomy through limited exclusive
interviews. With his work, we encourage authorities and scholars to understand
organizational characteristics that define an organization's approach towards
privacy, in order to effectively communicate regulations that enforce and
encourage organizations to consider privacy within their business practices.
","[{'version': 'v1', 'created': 'Wed, 11 Oct 2017 03:08:35 GMT'}]",2017-10-12,"[['Senarath', 'Awanthika Rasanjalee', ''], ['Arachchilage', 'Nalin Asanka Gamagedara', '']]","['organizational behaviour', 'end user privacy', 'organizational motivations', 'risk management', 'regulatory compliance']"
13872,1610.06715,Jonathan Behaegel,"Jonathan Behaegel, Jean-Paul Comet and Maxime Folschette",A Hybrid Hoare Logic for Gene Network Models,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The main difficulty when modelling gene networks is the identification of the
parameters that govern their dynamics. It is particularly difficult for models
in which time is continuous: parameters have real values which cannot be
enumerated. The widespread idea is to infer new constraints that reduce the
range of possible values. Here we present a new work based on a particular
class of Hybrid automata (inspired by Thomas discrete models) where discrete
parameters are replaced by signed celerities. We propose a new approach
involving Hoare logic and weakest precondition calculus (a la Dijkstra) that
generates constraints on the parameter values. Indeed, once proper
specifications are extracted from biological traces with duration information
(found in the literature or biological experiments), they play a role similar
to imperative programs in the classical Hoare logic. We illustrate our hybrid
Hoare logic on a small model controlling the lacI repressor of the lactose
operon.
","[{'version': 'v1', 'created': 'Fri, 21 Oct 2016 09:30:12 GMT'}]",2016-10-24,"[['Behaegel', 'Jonathan', ''], ['Comet', 'Jean-Paul', ''], ['Folschette', 'Maxime', '']]","['gene networks', 'hybrid automata', 'constraint synthesis', 'Hoarelogic', 'weakest precondition']"
13873,1011.0350,Laszlo Juracz,Laszlo Juracz,"Developing courses with HoloRena, a framework for scenario- and game
  based e-learning environments",18 pages,"International Journal of Software Engineering & Applications
  (IJSEA), October 2010, Volume 1, Number 4",,,cs.LG cs.HC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  However utilizing rich, interactive solutions can make learning more
effective and attractive, scenario- and game-based educational resources on the
web are not widely used. Creating these applications is a complex, expensive
and challenging process. Development frameworks and authoring tools hardly
support reusable components, teamwork and learning management
system-independent courseware architecture. In this article we initiate the
concept of a low-level, thick-client solution addressing these problems. With
some example applications we try to demonstrate, how a framework, based on this
concept can be useful for developing scenario- and game-based e-learning
environments.
","[{'version': 'v1', 'created': 'Mon, 1 Nov 2010 15:40:31 GMT'}]",2010-11-02,"[['Juracz', 'Laszlo', '']]","['Game-based Learning', 'Scenario-based Learning', 'e-learning History', 'Adaptive e-learning', 'RIA']"
13874,0910.0317,Rdv Ijcsis,"Abbas Karimi, Faraneh Zarafshan, Adznan.b. Jantan, A.R Ramli, M.Iqbal
  b.Saripan",A New Fuzzy Approach for Dynamic Load Balancing Algorithm,"5 pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 6, No. 1, pp. 01-05, October 2009, USA",,ISSN 1947 5500,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Load balancing is the process of improving the Performance of a parallel and
distributed system through is distribution of load among the processors [1-2].
Most of the previous work in load balancing and distributed decision making in
general, do not effectively take into account the uncertainty and inconsistency
in state information but in fuzzy logic, we have advantage of using crisps
inputs. In this paper, we present a new approach for implementing dynamic load
balancing algorithm with fuzzy logic, which can face to uncertainty and
inconsistency of previous algorithms, further more our algorithm shows better
response time than round robin and randomize algorithm respectively 30.84
percent and 45.45 percent.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2009 03:32:09 GMT'}]",2009-10-05,"[['Karimi', 'Abbas', ''], ['Zarafshan', 'Faraneh', ''], ['Jantan', 'Adznan. b.', ''], ['Ramli', 'A. R', ''], ['Saripan', 'M. Iqbal b.', '']]","['Load balancing', 'Fuzzy logic', 'Distributed systems']"
13875,1710.05917,Joos Buijs,"Remi Brochenin and Joos Buijs and Mehrnoosh Vahdat and Wil van der
  Aalst",Resource Usage Analysis from a Different Perspective on MOOC Dropout,"30 pages, 40 figures",,,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  We present a novel learning analytics approach, for analyzing the usage of
resources in MOOCs. Our target stakeholders are the course designers who aim to
evaluate their learning materials. In order to gain insight into the way
educational resources are used, we view dropout behaviour in an atypical
manner: Instead of using it as an indicator of failure, we use it as a mean to
compute other features. For this purpose, we developed a prototype, called
RUAF, that can be applied to the data format provided by FutureLearn. As a
proof of concept, we perform a study by applying this tool to the interaction
data of learners from four MOOCs. We also study the quality of our
computations, by comparing them to existing process mining approaches. We
present results that highlight patterns showing how learners use resources. We
also show examples of practical conclusions a course designer may benefit from.
","[{'version': 'v1', 'created': 'Mon, 16 Oct 2017 13:28:57 GMT'}]",2017-10-18,"[['Brochenin', 'Remi', ''], ['Buijs', 'Joos', ''], ['Vahdat', 'Mehrnoosh', ''], ['van der Aalst', 'Wil', '']]","['MOOC', 'Learning Analytics', 'Educational Data Mining', 'FutureLearn', 'Dropout']"
13876,1206.4256,Mehdi Khalili,Mehdi Khalili,"A Novel Effective, Secure and Robust CDMA Digital Image Watermarking in
  YUV Color Space Using DWT2","9 Pages, 16 Figures, International Journal of Computer Science
  Issues,May 2011",,,,cs.CR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is allocated to CDMA digital images watermarking for ownership
verification and image authentication applications, which for more security,
watermark W is converted to a sequence and then a random binary sequence R of
size n is adopted to encrypt the watermark; where n is the size of the
watermark. This adopting process uses a pseudo-random number generator to
determine the pixel to be used on a given key. After converting the host image
to YUV color space and then wavelet decomposition of Y channel, this adopted
watermark is embedded into the selected subbands coefficients of Y channel
using the correlation properties of additive pseudo- random noise patterns. The
experimental results show that the proposed approach provides extra
imperceptibility, security and robustness against JPEG compression and
different noises attacks compared to the similar proposed methods. Moreover,
the proposed approach has no need of the original image to extract watermarks.
","[{'version': 'v1', 'created': 'Tue, 19 Jun 2012 16:30:49 GMT'}]",2012-06-20,"[['Khalili', 'Mehdi', '']]","['CDMA', 'DWT2', 'Image watermarking', 'Pseudorandom number generator', 'YUV color space']"
13877,1304.2514,Kamala Sundararaman,"B. Kamala, J. M. Nandhini",Automatic Structuring Of Semantic Web Services An Approach,"ICRTCT, 2013 Coimbatore, International Journal of Computer and
  Communication Technology, Jan 2013",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ontologies have become the effective modeling for various applications and
significantly in the semantic web. The difficulty of extracting information
from the web, which was created mainly for visualising information, has driven
the birth of the semantic web, which will contain much more resources than the
web and will attach machine-readable semantic information to these resources.
Ontological bootstrapping on a set of predefined sources, such as web services,
must address the problem of multiple, largely unrelated concepts. The web
services consist of basically two components, Web Services Description Language
(WSDL) descriptors and free text descriptors. The WSDL descriptor is evaluated
using two methods, namely Term Frequency/Inverse Document Frequency (TF/IDF)
and web context generation. The proposed bootstrapping ontological process
integrates TF/IDF and web context generation and applies validation using the
free text descriptor service, so that, it offers more accurate definition of
ontologies. This paper uses ranking adaption model which predicts the rank for
a collection of web service documents which leads to the automatic
construction, enrichment and adaptation of ontologies.
","[{'version': 'v1', 'created': 'Tue, 9 Apr 2013 10:23:05 GMT'}]",2013-04-10,"[['Kamala', 'B.', ''], ['Nandhini', 'J. M.', '']]","['Ontology', 'Semantic web', 'WSDL Descriptors', 'Free Text Descriptors', 'Web Context Generation', 'TF/IDF', 'Web Context Generation    1']"
13878,1510.01113,Paul Guerrero,"Paul Guerrero, Niloy J. Mitra, Peter Wonka",RAID: A Relation-Augmented Image Descriptor,Fixed affiliation and email address of first author,,,,cs.GR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As humans, we regularly interpret images based on the relations between image
regions. For example, a person riding object X, or a plank bridging two
objects. Current methods provide limited support to search for images based on
such relations. We present RAID, a relation-augmented image descriptor that
supports queries based on inter-region relations. The key idea of our
descriptor is to capture the spatial distribution of simple point-to-region
relationships to describe more complex relationships between two image regions.
We evaluate the proposed descriptor by querying into a large subset of the
Microsoft COCO database and successfully extract nontrivial images
demonstrating complex inter-region relations, which are easily missed or
erroneously classified by existing methods.
","[{'version': 'v1', 'created': 'Mon, 5 Oct 2015 11:58:12 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Oct 2015 12:54:01 GMT'}]",2015-10-07,"[['Guerrero', 'Paul', ''], ['Mitra', 'Niloy J.', ''], ['Wonka', 'Peter', '']]","['spatial relationships', 'image descriptors', 'relation-basedquery', 'image retrieval']"
13879,1409.5308,Mohammed El-Kebir,Mohammed El-Kebir and Gunnar W. Klau,Solving the Maximum-Weight Connected Subgraph Problem to Optimality,11th DIMACS implementation challenge,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given an undirected node-weighted graph, the Maximum-Weight Connected
Subgraph problem (MWCS) is to identify a subset of nodes of maximalsum of
weights that induce a connected subgraph. MWCS is closely related to the
well-studied Prize Collecting Steiner Tree problem and has many applications in
different areas, including computational biology, network design and computer
vision. The problem is NP-hard and even hard to approximate within a constant
factor. In this work we describe an algorithmic scheme for solving MWCS to
provable optimality, which is based on preprocessing rules, new results on
decomposing an instance into its biconnected and triconnected components and a
branch-and-cut approach combined with a primal heuristic. We demonstrate the
performance of our method on the benchmark instances of the 11th DIMACS
implementation challenge consisting of MWCS as well as transformed PCST
instances.
","[{'version': 'v1', 'created': 'Thu, 18 Sep 2014 14:15:45 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Dec 2014 22:13:05 GMT'}]",2014-12-03,"[['El-Kebir', 'Mohammed', ''], ['Klau', 'Gunnar W.', '']]","['maximum-weight connected subgraph', 'algorithm engineering', 'divide-and-conquer', 'SPQR tree', 'prize-collecting Steiner tree', 'branchand-cut']"
13880,1007.0767,Wojciech Mazurczyk,"Wojciech Mazurczyk, Milosz Smolarczyk, Krzysztof Szczypiorski",Retransmission Steganography Applied,"5 pages, 6 figures, 1 table",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents experimental results of the implementation of network
steganography method called RSTEG (Retransmission Steganography). The main idea
of RSTEG is to not acknowledge a successfully received packet to intentionally
invoke retransmission. The retransmitted packet carries a steganogram instead
of user data in the payload field. RSTEG can be applied to many network
protocols that utilize retransmissions. We present experimental results for
RSTEG applied to TCP (Transmission Control Protocol) as TCP is the most popular
network protocol which ensures reliable data transfer. The main aim of the
performed experiments was to estimate RSTEG steganographic bandwidth and
detectability by observing its influence on the network retransmission level.
","[{'version': 'v1', 'created': 'Mon, 5 Jul 2010 20:37:57 GMT'}]",2010-07-07,"[['Mazurczyk', 'Wojciech', ''], ['Smolarczyk', 'Milosz', ''], ['Szczypiorski', 'Krzysztof', '']]","['RSTEG', 'steganography', 'TCP', 'retransmission mechanism']"
13881,1412.5831,"Janis N\""otzel","Janis N\""otzel, Walter Swetly",Deducing Truth from Correlation,"13 pages, 3 figures. Published in IEEE Transactions on Information
  Theory. Typo in Theorem 4 and Conjecture 1 corrected in this version",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work is motivated by a question at the heart of unsupervised learning
approaches: Assume we are collecting a number K of (subjective) opinions about
some event E from K different agents. Can we infer E from them? Prima facie
this seems impossible, since the agents may be lying. We model this task by
letting the events be distributed according to some distribution p and the task
is to estimate p under unknown noise. Again, this is impossible without
additional assumptions. We report here the finding of very natural such
assumptions - the availability of multiple copies of the true data, each under
independent and invertible (in the sense of matrices) noise, is already
sufficient: If the true distribution and the observations are modeled on the
same finite alphabet, then the number of such copies needed to determine p to
the highest possible precision is exactly three! This result can be seen as a
counterpart to independent component analysis. Therefore, we call our approach
'dependent component analysis'. In addition, we present generalizations of the
model to different alphabet sizes at in- and output. A second result is found:
the 'activation' of invertibility through multiple parallel uses.
","[{'version': 'v1', 'created': 'Thu, 18 Dec 2014 12:07:55 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Jun 2015 06:18:27 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Apr 2016 07:53:57 GMT'}, {'version': 'v4', 'created': 'Tue, 4 Oct 2016 20:03:22 GMT'}, {'version': 'v5', 'created': 'Mon, 14 May 2018 09:36:33 GMT'}]",2018-05-15,"[['Nötzel', 'Janis', ''], ['Swetly', 'Walter', '']]","['unsupervised learning', 'spatial diversity', 'blindsource estimation', 'dependent component analysis', 'independentcomponent analysis']"
13882,1107.3421,Gabriel Nivasch,Boris Bukh and Gabriel Nivasch,Upper bounds for centerlines,"This paper (without the appendix) has been published in Journal of
  Computational Geometry 3:20--30, 2012. 17 pages; 10 figures","Journal of Computational Geometry 3:20--30, 2012",,,cs.CG math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 2008, Bukh, Matousek, and Nivasch conjectured that for every n-point set S
in R^d and every k, 0 <= k <= d-1, there exists a k-flat f in R^d (a
""centerflat"") that lies at ""depth"" (k+1) n / (k+d+1) - O(1) in S, in the sense
that every halfspace that contains f contains at least that many points of S.
This claim is true and tight for k=0 (this is Rado's centerpoint theorem), as
well as for k = d-1 (trivial). Bukh et al. showed the existence of a (d-2)-flat
at depth (d-1) n / (2d-1) - O(1) (the case k = d-2).
  In this paper we concentrate on the case k=1 (the case of ""centerlines""), in
which the conjectured value for the leading constant is 2/(d+2). We prove that
2/(d+2) is an *upper bound* for the leading constant. Specifically, we show
that for every fixed d and every n there exists an n-point set in R^d for which
no line in R^d lies at depth larger than 2n/(d+2) + o(n). This point set is the
""stretched grid""---a set which has been previously used by Bukh et al. for
other related purposes.
  Hence, in particular, the conjecture is now settled for R^3.
","[{'version': 'v1', 'created': 'Mon, 18 Jul 2011 12:54:49 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Oct 2011 16:58:19 GMT'}, {'version': 'v3', 'created': 'Wed, 2 May 2012 10:34:22 GMT'}]",2012-05-03,"[['Bukh', 'Boris', ''], ['Nivasch', 'Gabriel', '']]","['centerpoint', 'centerline', 'centerflat', 'stair-convexity', 'stretched grid']"
13883,1109.6263,Greg Linden,"Greg Linden (Microsoft), Christopher Meek (Microsoft Research), Max
  Chickering (Microsoft)","The Pollution Effect: Optimizing Keyword Auctions by Favoring Relevant
  Advertising","Presented at the Fifth Workshop on Ad Auctions, July 6, 2009,
  Stanford, CA, USA",,,,cs.GT cs.CY cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most search engines sell slots to place advertisements on the search results
page through keyword auctions. Advertisers offer bids for how much they are
willing to pay when someone enters a search query, sees the search results, and
then clicks on one of their ads. Search engines typically order the
advertisements for a query by a combination of the bids and expected
clickthrough rates for each advertisement. In this paper, we extend a model of
Yahoo's and Google's advertising auctions to include an effect where repeatedly
showing less relevant ads has a persistent impact on all advertising on the
search engine, an impact we designate as the pollution effect. In Monte-Carlo
simulations using distributions fitted to Yahoo data, we show that a modest
pollution effect is sufficient to dramatically change the advertising rank
order that yields the optimal advertising revenue for a search engine. In
addition, if a pollution effect exists, it is possible to maximize revenue
while also increasing advertiser, and publisher utility. Our results suggest
that search engines could benefit from making relevant advertisements less
expensive and irrelevant advertisements more costly for advertisers than is the
current practice.
","[{'version': 'v1', 'created': 'Wed, 28 Sep 2011 16:33:38 GMT'}]",2011-09-29,"[['Linden', 'Greg', '', 'Microsoft'], ['Meek', 'Christopher', '', 'Microsoft Research'], ['Chickering', 'Max', '', 'Microsoft']]","['Sponsored search', 'search engines', 'keyword auctions', 'auction theory', 'search advertising', 'web advertising', 'advertising auctions']"
13884,1410.0228,Ousmane Thiare OT,"Dame Diongue, Ousmane Thiare","An Energy Efficient Self-healing Mechanism for Long Life Wireless Sensor
  Networks","6 pages, 8 figures. arXiv admin note: text overlap with
  arXiv:1309.6000",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we provide an energy efficient self- healing mechanism for
Wireless Sensor Networks. The proposed solution is based on our probabilistic
sentinel scheme. To reduce energy consumption while maintaining good
connectivity between sentinel nodes, we compose our solution on two main
concepts, node adaptation and link adaptation. The first algorithm uses node
adaptation technique and permits to distributively schedule nodes activities
and select a minimum subset of active nodes (sentry) to monitor the interest
region. And secondly, we in- troduce a link control algorithm to ensure better
connectiv- ity between sentinel nodes while avoiding outliers appearance.
Without increasing control messages overhead, performances evaluations show
that our solution is scalable with a steady energy consumption. Simulations
carried out also show that the proposed mechanism ensures good connectivity
between sentry nodes while considerably reducing the total energy spent.
","[{'version': 'v1', 'created': 'Tue, 30 Sep 2014 18:20:56 GMT'}]",2014-10-02,"[['Diongue', 'Dame', ''], ['Thiare', 'Ousmane', '']]","['component—Wireless Sensor Networks', 'Self-healing', 'Energy efficiency', 'Node adaptation', 'Link adaptation']"
13885,1412.4471,Dmitry Kosolobov,Dmitry Kosolobov,Online Detection of Repetitions with Backtracking,"12 pages, 5 figures, accepted to CPM 2015",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present two algorithms for the following problem: given a
string and a rational $e > 1$, detect in the online fashion the earliest
occurrence of a repetition of exponent $\ge e$ in the string.
  1. The first algorithm supports the backtrack operation removing the last
letter of the input string. This solution runs in $O(n\log m)$ time and $O(m)$
space, where $m$ is the maximal length of a string generated during the
execution of a given sequence of $n$ read and backtrack operations.
  2. The second algorithm works in $O(n\log\sigma)$ time and $O(n)$ space,
where $n$ is the length of the input string and $\sigma$ is the number of
distinct letters. This algorithm is relatively simple and requires much less
memory than the previously known solution with the same working time and space.
a string generated during the execution of a given sequence of $n$ read and
backtrack operations.
","[{'version': 'v1', 'created': 'Mon, 15 Dec 2014 06:13:22 GMT'}, {'version': 'v2', 'created': 'Sun, 1 Feb 2015 18:02:46 GMT'}, {'version': 'v3', 'created': 'Fri, 1 May 2015 12:14:47 GMT'}]",2015-05-04,"[['Kosolobov', 'Dmitry', '']]","['repetition-free square-free', 'online algorithm', 'backtracking']"
13886,1401.4648,Rafid Siddiqui,"Rafid Siddiqui, Siamak Khatibi",Visual Tracking using Particle Swarm Optimization,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of robust extraction of visual odometry from a sequence of images
obtained by an eye in hand camera configuration is addressed. A novel approach
toward solving planar template based tracking is proposed which performs a
non-linear image alignment for successful retrieval of camera transformations.
In order to obtain global optimum a bio-metaheuristic is used for optimization
of similarity among the planar regions. The proposed method is validated on
image sequences with real as well as synthetic transformations and found to be
resilient to intensity variations. A comparative analysis of the various
similarity measures as well as various state-of-art methods reveal that the
algorithm succeeds in tracking the planar regions robustly and has good
potential to be used in real applications.
","[{'version': 'v1', 'created': 'Sun, 19 Jan 2014 09:52:19 GMT'}]",2014-01-21,"[['Siddiqui', 'Rafid', ''], ['Khatibi', 'Siamak', '']]","['camera tracking', 'visual odometry', 'planar template based tracking', 'particle swarm optimization']"
13887,1610.04306,Kong Hyeok,"Hyeok Kong, Cholyong Jong, Unhyok Ryang",Rare Association Rule Mining for Network Intrusion Detection,"13 pages, 3 tables, 2 figures, 5 references",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a new practical association rule mining algorithm
for anomaly detection in Intrusion Detection System (IDS). First, with a view
of anomaly cases being relatively rarely occurred in network packet database,
we define a rare association rule among infrequent itemsets rather than the
traditional association rule mining method. And then, we discuss an interest
measure to catch differences between interesting relations and uninteresting
ones, and what interest there is, and develop a hash based rare association
rule mining algorithm for finding rare, but useful anomaly patterns to user.
Finally, we define a quantitative association rule in relational database,
propose a practical algorithm to mine rare association rules from network
packet database, and show advantages of it giving a concrete example. Our
algorithm can be applied to fields need to mine hidden patterns which are rare,
but valuable, like IDS, and it is based on hashing method among infrequent
itemsets, so that it has obvious advantages of speed and memory space
limitation problems over the traditional association rule mining algorithms.
Keywords: rare association mining algorithm, infrequent itemsets, quantitative
association rule, network intrusion detection system, anomaly detection
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2016 00:58:46 GMT'}]",2016-10-17,"[['Kong', 'Hyeok', ''], ['Jong', 'Cholyong', ''], ['Ryang', 'Unhyok', '']]","['rare association mining algorithm', 'infrequent itemsets', 'quantitative']"
13888,0806.1340,Prasun Dutta,"Prasun Dutta, S. Pratik Khastgir and Anushree Roy",Steiner trees and spanning trees in six-pin soap films,,,,,cs.CG cond-mat.other physics.class-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We have studied the Steiner tree problem using six-pin soap films in detail.
We extend the existing method of experimental realisation of Steiner trees in
$n$-terminal problem through soap films to observe new non-minimal Steiner
trees. We also produced spanning tree configurations for the first time by our
method. Experimentally, by varying the pin diameter, we have achieved these new
stable soap film configurations. A new algorithm is presented for creating
these Steiner trees theoretically.
  Exact lengths of these Steiner tree configurations are calculated using a
geometrical method. An exact two-parameter empirical formula is proposed for
estimating the lengths of these soap film configurations in six-pin soap film
problem.
","[{'version': 'v1', 'created': 'Sun, 8 Jun 2008 16:58:31 GMT'}]",2008-06-15,"[['Dutta', 'Prasun', ''], ['Khastgir', 'S. Pratik', ''], ['Roy', 'Anushree', '']]","['Steiner trees', 'Spanning trees', 'Soap films']"
13889,1312.6349,Joongheon Kim,Aziz Mohaisen and Joongheon Kim,The Sybil Attacks and Defenses: A Survey,"10 pages, 1 figure","Smart Computing Review, vol. 3, no. 6 pp 480-489, 2013",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we have a close look at the Sybil attack and advances in
defending against it, with particular emphasis on the recent work. We identify
three major veins of literature work to defend against the attack: using
trusted certification, using resources testing, and using social networks. The
first vein of literature considers defending against the attack using trusted
certification, which is done by either centralized certification or distributed
certification using cryptographic primitives that can replace the centralized
certification entity. The second vein of literature considers defending against
the attack by resources testing, which can by in the form of IP testing,
network coordinates, recurring cost as by requiring clients to solve puzzles.
The third and last vein of literature is by mitigating the attack combining
social networks used as bootstrapping security and tools from random walk
theory that have shown to be effective in defending against the attack under
certain assumptions. Our survey and analyses of the different schemes in the
three veins of literature show several shortcomings which form several
interesting directions and research questions worthy of investigation.
","[{'version': 'v1', 'created': 'Sun, 22 Dec 2013 07:05:44 GMT'}]",2013-12-24,"[['Mohaisen', 'Aziz', ''], ['Kim', 'Joongheon', '']]","['Social networks', 'Sybil defenses', 'Survey']"
13890,1412.8313,Ke Xiong,"Guanyao Du, Zhilong Dong, Ke Xiong and Zhengding Qiu","Wireless Information and Energy Transfer for Decode-and-Forward Relaying
  MIMO-OFDM Networks","7 pages, 3 Figures, to appear in ICIC Express Letter",,,,cs.IT math.IT,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper investigates the system achievable rate and optimization for the
multiple-input multiple-output (MIMO)-orthogonal frequency division
multiplexing (OFDM) system with an energy harvesting (EH) relay. Firstly we
propose a time switchingbased relaying (TSR) protocol to enable the
simultaneous information processing and energy harvesting at the relay. Then,
we discuss its achievable rate performance theoretically and formulated an
optimization problem to maximize the system achievable rate. As the problem is
difficult to solve, we design an Augmented Lagrangian Penalty Function (ALPF)
method for it. Extensive simulation results are provided to demonstrate the
accuracy of the analytical results and the effectiveness of the ALPF method.
","[{'version': 'v1', 'created': 'Mon, 29 Dec 2014 11:28:04 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Jan 2015 01:32:37 GMT'}]",2015-01-06,"[['Du', 'Guanyao', ''], ['Dong', 'Zhilong', ''], ['Xiong', 'Ke', ''], ['Qiu', 'Zhengding', '']]","['Energy harvesting', 'MIMO-OFDM', 'Decode-and-forward (DF)', 'AugmentedLagrangian Penalty Function (ALPF)']"
13891,1603.04627,Basel Halak,Basel Halak and Hsien-Chih Chiu,"Modified Micropipline Architecture for Synthesizable Asynchronous FIR
  Filter Design",in International Journal of VLSI Design & Communication Systems 2016,,,,cs.AR,http://creativecommons.org/licenses/by/4.0/,"  The use of asynchronous design approaches to construct digital signal
processing (DSP) systems is a rapidly growing research area driven by a wide
range of emerging energy constrained applications such as wireless sensor
network, portable medical devices and brain implants. The asynchronous design
techniques allow the construction of systems which are samples driven, which
means they only dissipate dynamic energy when there processing data and idle
otherwise. This inherent advantage of asynchronous design over conventional
synchronous circuits allows them to be energy efficient. However the
implementation flow of asynchronous systems is still difficult due to its lack
of compatibility with industry-standard synchronous design tools and modelling
languages. This paper devises a novel asynchronous design for a finite impulse
response (FIR) filter, an essential building block of DSP systems, which is
synthesizable and suitable for implementation using conventional synchronous
systems design flow and tools. The proposed design is based on a modified
version of the micropipline architecture and it is constructed using four phase
bundled data protocol. A hardware prototype of the proposed filter has been
developed on an FPGA, and systematically verified. The results prove correct
functionality of the novel design and a superior performance compared to a
synchronous FIR implementation. The findings of this work will allow a wider
adoption of asynchronous circuits by DSP designers to harness their energy and
performance benefits.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2016 10:44:29 GMT'}]",2016-03-16,"[['Halak', 'Basel', ''], ['Chiu', 'Hsien-Chih', '']]","['Asynchronous Design', 'Finite Impulse Response (FIR) Filter', 'Hardware Description Language (HDL)', 'FPGA']"
13892,1702.01780,Randal Olson,Andrew Sohn and Randal S. Olson and Jason H. Moore,"Toward the automated analysis of complex diseases in genome-wide
  association studies using genetic programming","9 pages, 4 figures, submitted to GECCO 2017 conference and currently
  under review",,,,cs.NE cs.LG q-bio.QM stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning has been gaining traction in recent years to meet the demand
for tools that can efficiently analyze and make sense of the ever-growing
databases of biomedical data in health care systems around the world. However,
effectively using machine learning methods requires considerable domain
expertise, which can be a barrier of entry for bioinformaticians new to
computational data science methods. Therefore, off-the-shelf tools that make
machine learning more accessible can prove invaluable for bioinformaticians. To
this end, we have developed an open source pipeline optimization tool
(TPOT-MDR) that uses genetic programming to automatically design machine
learning pipelines for bioinformatics studies. In TPOT-MDR, we implement
Multifactor Dimensionality Reduction (MDR) as a feature construction method for
modeling higher-order feature interactions, and combine it with a new expert
knowledge-guided feature selector for large biomedical data sets. We
demonstrate TPOT-MDR's capabilities using a combination of simulated and real
world data sets from human genetics and find that TPOT-MDR significantly
outperforms modern machine learning methods such as logistic regression and
eXtreme Gradient Boosting (XGBoost). We further analyze the best pipeline
discovered by TPOT-MDR for a real world problem and highlight TPOT-MDR's
ability to produce a high-accuracy solution that is also easily interpretable.
","[{'version': 'v1', 'created': 'Mon, 6 Feb 2017 20:10:10 GMT'}]",2017-02-08,"[['Sohn', 'Andrew', ''], ['Olson', 'Randal S.', ''], ['Moore', 'Jason H.', '']]","['genetics', 'bioinformatics', 'automated machine learning', 'multifactor dimensionality reduction', 'genetic programming', 'Python']"
13893,1403.2482,Haijuan Hu,"Haijuan Hu, Bing Li, Quansheng Liu","Removing Mixture of Gaussian and Impulse Noise by Patch-Based Weighted
  Means",5 figures,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We first establish a law of large numbers and a convergence theorem in
distribution to show the rate of convergence of the non-local means filter for
removing Gaussian noise. We then introduce the notion of degree of similarity
to measure the role of similarity for the non-local means filter. Based on the
convergence theorems, we propose a patch-based weighted means filter for
removing impulse noise and its mixture with Gaussian noise by combining the
essential idea of the trilateral filter and that of the non-local means filter.
Our experiments show that our filter is competitive compared to recently
proposed methods.
","[{'version': 'v1', 'created': 'Tue, 11 Mar 2014 06:48:58 GMT'}]",2014-03-12,"[['Hu', 'Haijuan', ''], ['Li', 'Bing', ''], ['Liu', 'Quansheng', '']]","['Gaussian noise', 'Impulse noise', 'Trilateral filter', 'Non-localmeans filter', 'Convergence theorem', 'Degree of similarity']"
13894,1403.6953,Afrooz Ebadat,"A. Ebadat, B. Wahlberg, H. Hjalmarsson, C. R. Rojas, P. Hagg, C. A.
  Larsson",Applications Oriented Input Design in Time-Domain Through Cyclic Methods,,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a method for applications oriented input design for
linear systems under time-domain constraints on the amplitude of input and
output signals. The method guarantees a desired control performance for the
estimated model in minimum time, by imposing some lower bound on the
information matrix. The problem is formulated as a time domain optimization
problem, which is non-convex. This is addressed through an alternating method,
where we separate the problem into two steps and at each step we optimize the
cost function with respect to one of two variables. We alternate between these
two steps until convergence. A time recursive input design algorithm is
performed, which enables us to use the algorithm with control. Therefore, a
receding horizon framework is used to solve each optimization problem. Finally,
we illustrate the method with two numerical examples which show the good
ability of the proposed approach in generating an optimal input signal.
","[{'version': 'v1', 'created': 'Thu, 27 Mar 2014 08:54:32 GMT'}]",2014-03-28,"[['Ebadat', 'A.', ''], ['Wahlberg', 'B.', ''], ['Hjalmarsson', 'H.', ''], ['Rojas', 'C. R.', ''], ['H\x7fagg', 'P.', ''], ['Larsson', 'C. A.', '']]","['System identification', 'Applications oriented input design', 'Alternating methods']"
13895,0801.3654,Mikhail Zaslavskiy,"Mikhail Zaslavskiy, Francis Bach, and Jean-Philippe Vert",A path following algorithm for the graph matching problem,"23 pages, 13 figures,typo correction, new results in sections 4,5,6",,,,cs.CV cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a convex-concave programming approach for the labeled weighted
graph matching problem. The convex-concave programming formulation is obtained
by rewriting the weighted graph matching problem as a least-square problem on
the set of permutation matrices and relaxing it to two different optimization
problems: a quadratic convex and a quadratic concave optimization problem on
the set of doubly stochastic matrices. The concave relaxation has the same
global minimum as the initial graph matching problem, but the search for its
global minimum is also a hard combinatorial problem. We therefore construct an
approximation of the concave problem solution by following a solution path of a
convex-concave problem obtained by linear interpolation of the convex and
concave formulations, starting from the convex relaxation. This method allows
to easily integrate the information on graph label similarities into the
optimization problem, and therefore to perform labeled weighted graph matching.
The algorithm is compared with some of the best performing graph matching
methods on four datasets: simulated graphs, QAPLib, retina vessel images and
handwritten chinese characters. In all cases, the results are competitive with
the state-of-the-art.
","[{'version': 'v1', 'created': 'Wed, 23 Jan 2008 20:20:32 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Oct 2008 14:16:01 GMT'}]",2008-10-27,"[['Zaslavskiy', 'Mikhail', ''], ['Bach', 'Francis', ''], ['Vert', 'Jean-Philippe', '']]","['Graph algorithms', 'graph matching', 'convex programming', 'gradient methods', 'machine learning', 'classification', 'image processing']"
13896,0907.4743,Ersin Uzun,"Arun Kumar, Nitesh Saxena, Ersin Uzun","Alice Meets Bob: A Comparative Usability Study of Wireless Device
  Pairing Methods for a ""Two-User"" Setting","16 pages manuscript. Keywords: Wireless Security, Device
  Authentication, Pairing, Usability",,,,cs.CR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When users want to establish wireless communication between/among their
devices, the channel has to be bootstrapped first. To prevent any malicious
control of or eavesdropping over the communication, the channel is desired to
be authenticated and confidential. The process of setting up a secure
communication channel between two previously unassociated devices is referred
to as ""Secure Device Pairing"". When there is no prior security context, e.g.,
shared secrets, common key servers or public key certificates, device pairing
requires user involvement into the process. The idea usually involves
leveraging an auxiliary human-perceptible channel to authenticate the data
exchanged over the insecure wireless channel.
  We observe that the focus of prior research has mostly been limited to
pairing scenarios where a single user controls both the devices. In this paper,
we consider more general and emerging ""two-user"" scenarios, where two different
users establish pairing between their respective devices. Although a number of
pairing methods exists in the literature, only a handful of those are
applicable to the two-user setting. We present the first study to identify the
methods practical for two-user pairing scenarios, and comparatively evaluate
the usability of these methods. Our results identify methods best-suited for
users, in terms of efficiency, error-tolerance and of course, usability. Our
work sheds light on the applicability and usability of pairing methods for
emerging two-user scenarios, a topic largely ignored so far.
","[{'version': 'v1', 'created': 'Mon, 27 Jul 2009 19:34:20 GMT'}]",2009-07-28,"[['Kumar', 'Arun', ''], ['Saxena', 'Nitesh', ''], ['Uzun', 'Ersin', '']]","['Wireless Security', 'Device Authentication', 'Pairing', 'Usability']"
13897,1212.2845,Jonathan Hiller,Jonathan Hiller and Hod Lipson,Dynamic Simulation of Soft Heterogeneous Objects,"Source code download at: http://www.voxcad.com or
  http://sourceforge.net/projects/voxcad/",,,,cs.GR cs.RO physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a 2D and 3D simulation engine that quantitatively models
the statics, dynamics, and non-linear deformation of heterogeneous soft bodies
in a computationally efficient manner. There is a large body of work simulating
compliant mechanisms. These normally assume small deformations with homogeneous
material properties actuated with external forces. There is also a large body
of research on physically-based deformable objects for applications in computer
graphics with the purpose of generating realistic appearances at the expense of
accuracy. Here we present a simulation framework in which an object may be
composed of any number of interspersed materials with varying properties
(stiffness, density, etc.) to enable true heterogeneous multi-material
simulation. Collisions are handled to prevent self-penetration due to large
deformation, which also allows multiple bodies to interact. A volumetric
actuation method is implemented to impart motion to the structures which opens
the door to the design of novel structures and mechanisms. The simulator was
implemented efficiently such that objects with thousands of degrees of freedom
can be simulated at suitable framerates for user interaction using a single
thread of a typical desktop computer. The code is written in platform agnostic
C++ and is fully open source. This research opens the door to the dynamic
simulation of freeform 3D multi-material mechanisms and objects in a manner
suitable for design automation.
","[{'version': 'v1', 'created': 'Wed, 12 Dec 2012 15:41:08 GMT'}]",2012-12-13,"[['Hiller', 'Jonathan', ''], ['Lipson', 'Hod', '']]","['Soft body', 'non-linear mechanism', 'heterogeneousmaterials']"
13898,1401.4245,Ekta Gupta,"Ekta Gupta, Kalyani and Nitin",Preserving the Basic Property of Stable Matching by Deleting a pair,"5 pages, 6 tables, 2 figures, International Conference in Distributed
  Computing & Internet Technology (ICDCIT-2014)
  http://www.ijcaonline.org/proceedings/icdcit2014/number1/14379-1303",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the transition of a male-pessimal matching set to
optimal when it is a man-oriented approach by deleting a pair from matching set
considering the score based approach. A descriptive explanation of the proposed
algorithm both in a sequential and parallel manner is given. The comparison
based theoretical analysis shows that the best case of the algorithm is lower
bound of n3.
","[{'version': 'v1', 'created': 'Fri, 17 Jan 2014 05:56:23 GMT'}]",2014-01-20,"[['Gupta', 'Ekta', ''], ['Kalyani', '', ''], ['Nitin', '', '']]","['Stable Matching', 'Stable Marriage', 'Complete', 'Strictly Ordered', 'Rank', 'Score', 'Matching Set', 'Happiness']"
13899,1710.03178,Avery Miller,"Faith Ellen, Barun Gorain, Avery Miller, Andrzej Pelc",Constant-Length Labeling Schemes for Deterministic Radio Broadcast,"updated version of the paper that appeared in SPAA 2019: now contains
  a solution for the case where the source node is not designated when the
  labeling scheme is applied",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Broadcast is one of the fundamental network communication primitives. One
node of a network, called the $\mathit{source}$, has a message that has to be
learned by all other nodes. We consider the feasibility of deterministic
broadcast in radio networks. If nodes of the network do not have any labels,
deterministic broadcast is impossible even in the four-cycle. On the other
hand, if all nodes have distinct labels, then broadcast can be carried out,
e.g., in a round-robin fashion, and hence $O(\log n)$-bit labels are sufficient
for this task in $n$-node networks. In fact, $O(\log \Delta)$-bit labels, where
$\Delta$ is the maximum degree, are enough to broadcast successfully. Hence, it
is natural to ask if very short labels are sufficient for broadcast. Our main
result is a positive answer to this question. We show that every radio network
can be labeled using 2 bits in such a way that broadcast can be accomplished by
some universal deterministic algorithm that does not know the network topology
nor any bound on its size. Moreover, at the expense of an extra bit in the
labels, we get the additional strong property that there exists a common round
in which all nodes know that broadcast has been completed. Finally, we show
that 3-bit labels are also sufficient to solve both versions of broadcast in
the case where the labeling scheme does not know which node is the source.
","[{'version': 'v1', 'created': 'Mon, 9 Oct 2017 16:24:10 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Aug 2019 20:37:18 GMT'}]",2019-08-06,"[['Ellen', 'Faith', ''], ['Gorain', 'Barun', ''], ['Miller', 'Avery', ''], ['Pelc', 'Andrzej', '']]","['broadcast', 'radio network', 'labeling scheme', 'feasibility']"
13900,1606.04427,Tim Dykes,"Timothy Dykes, Claudio Gheller, Marzia Rivi, Mel Krokos",Splotch: porting and optimizing for the Xeon Phi,"Version 1, 11 pages, 14 figures. Accepted for publication in
  International Journal of High Performance Computing Applications (IJHPCA)",,,,cs.DC astro-ph.IM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the increasing size and complexity of data produced by large scale
numerical simulations, it is of primary importance for scientists to be able to
exploit all available hardware in heterogenous High Performance Computing
environments for increased throughput and efficiency. We focus on the porting
and optimization of Splotch, a scalable visualization algorithm, to utilize the
Xeon Phi, Intel's coprocessor based upon the new Many Integrated Core
architecture. We discuss steps taken to offload data to the coprocessor and
algorithmic modifications to aid faster processing on the many-core
architecture and make use of the uniquely wide vector capabilities of the
device, with accompanying performance results using multiple Xeon Phi. Finally
performance is compared against results achieved with the GPU implementation of
Splotch.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2016 15:36:58 GMT'}]",2016-06-15,"[['Dykes', 'Timothy', ''], ['Gheller', 'Claudio', ''], ['Rivi', 'Marzia', ''], ['Krokos', 'Mel', '']]","['Xeon Phi', 'High Performance Computing', 'Visualization', 'Optimization', 'Porting', 'GPU']"
13901,1208.3730,Joaquin Garcia-Alfaro,Sergio Castillo-Perez and Joaquin Garcia-Alfaro,On the Use of Latency Graphs for the Construction of Tor Circuits,34,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of anonymity-based infrastructures and anonymisers is a plausible
solution to mitigate privacy problems on the Internet. Tor (short for The onion
router) is a popular low-latency anonymity system that can be installed as an
end-user application on a wide range of operating systems to redirect the
traffic through a series of anonymising proxy circuits. The construction of
these circuits determines both the latency and the anonymity degree of the Tor
anonymity system. While some circuit construction strategies lead to delays
which are tolerated for activities like Web browsing, they can make the system
vulnerable to linking attacks. We evaluate in this paper three classical
strategies for the construction of Tor circuits, with respect to their
de-anonymisation risk and latency performance. We then develop a new circuit
selection algorithm that considerably reduces the success probability of
linking attacks while keeping a good degree of performance. We finally conduct
experiments on a real-world Tor deployment over PlanetLab. Our experimental
results confirm the validity of our strategy and its performance increase for
Web browsing.
","[{'version': 'v1', 'created': 'Sat, 18 Aug 2012 08:21:30 GMT'}]",2012-08-21,"[['Castillo-Perez', 'Sergio', ''], ['Garcia-Alfaro', 'Joaquin', '']]","['Anonymity', 'Privacy', 'Entropy', 'Graphs', 'Algorithmics']"
13902,1407.5126,Guangmo Tong,Guangmo Tong and Cong Liu,"Supporting Read/Write Applications in Embedded Real-time Systems via
  Suspension-aware Analysis",,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many embedded real-time systems, applications often interact with I/O
devices via read/write operations, which may incur considerable suspension
delays. Unfortunately, prior analysis methods for validating timing correctness
in embedded systems become quite pessimistic when suspension delays are
present. In this paper, we consider the problem of supporting two common types
of I/O applications in a multiprocessor system, that is, write-only
applications and read-write applications. For the write-only application model,
we present a much improved analysis technique that results in only O(m)
suspension-related utilization loss, where m is the number of processors. For
the second application model, we present a flexible I/O placement strategy and
a corresponding new scheduling algorithm, which can completely circumvent the
negative impact due to read- and write-induced suspension delays. We illustrate
the feasibility of the proposed I/O-placement-based schedule via a case study
implementation. Furthermore, experiments presented herein show that the
improvement with respect to system utilization over prior methods is often
significant.
","[{'version': 'v1', 'created': 'Fri, 18 Jul 2014 22:30:33 GMT'}]",2014-07-22,"[['Tong', 'Guangmo', ''], ['Liu', 'Cong', '']]","['I/O-intensive applications', 'scheduling algorithm', 'timing validation']"
13903,1506.02212,Jiawang Yi,"Jiawang Yi, Guanzheng Tan","Nonlinear compressed sensing based on composite mappings and its
  pointwise linearization",16 pages,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classical compressed sensing (CS) allows us to recover structured signals
from far few linear measurements than traditionally prescribed, thereby
efficiently decreasing sampling rates. However, if there exist nonlinearities
in the measurements, is it still possible to recover sparse or structured
signals from the nonlinear measurements? The research of nonlinear CS is
devoted to answering this question. In this paper, unlike the existing research
angles of nonlinear CS, we study it from the perspective of mapping
decomposition, and propose a new concept, namely, nonlinear CS based on
composite mappings. Through the analysis of two forms of a nonlinear composite
mapping Phi, i.e., Phi(x) = F(Ax) and Phi(x) = AF(x), we give the requirements
respectively for the sensing matrix A and the nonlinear mapping F when
reconstructing all sparse signals exactly from the nonlinear measurements
Phi(x). Besides, we also provide a special pointwise linearization method,
which can turn the nonlinear composite mapping Phi, at each point in its
domain, into an equivalent linear composite mapping. This linearization method
can guarantee the exact recovery of all given sparse signals even if Phi is not
an injection for all sparse signals. It may help us build an algorithm
framework for the composite nonlinear CS in which we can take full advantage of
the existing recovery algorithms belonging to linear CS.
","[{'version': 'v1', 'created': 'Sun, 7 Jun 2015 02:41:35 GMT'}]",2015-06-09,"[['Yi', 'Jiawang', ''], ['Tan', 'Guanzheng', '']]","['：Compressed sensing', 'Nonlinear measurements', 'Composite mappings', 'Restricted isometry property', 'Invariance', 'Pointwise linearization']"
13904,1702.02746,Supriyo Maji,Supriyo Maji,"Spin Transfer Torque Driven Coupled Oscillators for Self-Oscillating RF
  Mixers",Accepted for publication in 60th IEEE MWSCAS 2017,,,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spin transfer torque oscillators (STOs) based on magnetic tunnel junction
(MTJ) devices are emerging as a possible replacement for complementary
metal-oxide semiconductors for radio-frequency (RF) signal generation.
Advantages include low power consumption, small device area, and large
frequency tunability. But such a single device cannot achieve the necessary
noise performance for RF applications. It has been reported lately that a
network of globally coupled STOs achieves significant improvement in phase
noise. The study here is to propose use of such coupled STOs as
self-oscillating RF mixers. Critical mixer performance parameters, including
conversion gain, output power, and linearity, are discussed.
","[{'version': 'v1', 'created': 'Thu, 9 Feb 2017 08:39:20 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Feb 2017 04:57:27 GMT'}, {'version': 'v3', 'created': 'Wed, 1 Mar 2017 05:53:27 GMT'}, {'version': 'v4', 'created': 'Thu, 6 Apr 2017 03:18:22 GMT'}, {'version': 'v5', 'created': 'Sun, 2 Jul 2017 13:38:51 GMT'}]",2017-07-04,"[['Maji', 'Supriyo', '']]","['Spin torque oscillator', 'Mixers', 'Coupling', 'Phase']"
13905,1507.01062,Ashish Sureka,Ashish Sureka,"Intention-Oriented Process Model Discovery from Incident Management
  Event Logs",,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intention-oriented process mining is based on the belief that the fundamental
nature of processes is mostly intentional (unlike activity-oriented process)
and aims at discovering strategy and intentional process models from event-logs
recorded during the process enactment. In this paper, we present an application
of intention-oriented process mining for the domain of incident management of
an Information Technology Infrastructure Library (ITIL) process. We apply the
Map Miner Method (MMM) on a large real-world dataset for discovering hidden and
unobservable user behavior, strategies and intentions. We first discover user
strategies from the given activity sequence data by applying Hidden Markov
Model (HMM) based unsupervised learning technique. We then process the emission
and transition matrices of the discovered HMM to generate a coarse-grained Map
Process Model. We present the first application or study of the new and
emerging field of Intention-oriented process mining on an incident management
event-log dataset and discuss its applicability, effectiveness and challenges.
","[{'version': 'v1', 'created': 'Sat, 4 Jul 2015 04:17:14 GMT'}]",2015-07-07,"[['Sureka', 'Ashish', '']]","['Business Process Intelligence (BPI)', 'Hidden Markov Models(HMM)', 'Incident Management Event Logs', 'Intention Mining', 'Process Mining', 'Unsupervised Learning']"
13906,1410.0128,Zheng Chang,"Zheng Chang, Jie Gong, Tapani Ristaniemi, Zhisheng Niu","Energy Efficient Resource Allocation and User Scheduling for
  Collaborative Mobile Clouds with Hybrid Receivers",arXiv admin note: text overlap with arXiv:1303.4006 by other authors,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the resource allocation and user scheduling algorithm
for minimizing the energy cost of data transmission in the context of OFDMA
collaborative mobile cloud (CMC) with simultaneous wireless information and
power transfer (SWIPT) receivers. The CMC, which consists of several
collaborating MTs offers one potential solution for downlink content
distribution and for the energy consumption reduction at the terminal side.
Meanwhile, as RF signal can carry both information and energy simultaneously,
the induced SWIPT has gained much attention for energy efficiency design of
mobile nodes. Previous work on the design of CMC system mainly focused on the
cloud formulation or energy efficiency investigation, while how to allocate the
radio resource and schedule user transmission lacks attention. With the
objective to minimize the system energy consumption, an optimization problem
which jointly considers subchannel assignment, power allocation and user
scheduling for a group of SWIPT receivers has been presented. The formulated
problem is addressed through the convex optimization technique. Simulation
results demonstrate that the proposed user scheduling and resource allocation
algorithms can achieve significant energy saving performance.
","[{'version': 'v1', 'created': 'Wed, 1 Oct 2014 07:14:36 GMT'}]",2014-10-02,"[['Chang', 'Zheng', ''], ['Gong', 'Jie', ''], ['Ristaniemi', 'Tapani', ''], ['Niu', 'Zhisheng', '']]","['content distribution', 'content sharing', 'resource alloca']"
13907,1701.08918,Padmavathi K,"Padmavathi K, Mahima Bhat and Maya V Karki","Feature Selection based on PCA and PSO for Multimodal Medical Image
  Fusion using DTCWT","8 pages, 6 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multimodal medical image fusion helps to increase efficiency in medical
diagnosis. This paper presents multimodal medical image fusion by selecting
relevant features using Principle Component Analysis (PCA) and Particle Swarm
Optimization techniques (PSO). DTCWT is used for decomposition of the images
into low and high frequency coefficients. Fusion rules such as combination of
minimum, maximum and simple averaging are applied to approximate and detailed
coefficients. The fused image is reconstructed by inverse DTCWT. Performance
metrics are evaluated and it shows that DTCWT-PCA performs better than
DTCWT-PSO in terms of Structural Similarity Index Measure (SSIM) and Cross
Correlation (CC). Computation time and feature vector size is reduced in
DTCWT-PCA compared to DTCWT-PSO for feature selection which proves robustness
and storage capacity.
","[{'version': 'v1', 'created': 'Tue, 31 Jan 2017 05:12:34 GMT'}]",2017-02-01,"[['K', 'Padmavathi', ''], ['Bhat', 'Mahima', ''], ['Karki', 'Maya V', '']]","['Feature selection', 'PCA', 'PSO', 'image fusion', 'DTCWT']"
13908,1511.04934,Wiharto Wiharto,"Esti Suryani, Wiharto Wiharto, Nizomjon Polvonov","Identification and Counting White Blood Cells and Red Blood Cells using
  Image Processing Case Study of Leukemia",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Leukemia is diagnosed with complete blood counts which is by calculating all
blood cells and compare the number of white blood cells (White Blood Cells /
WBC) and red blood cells (Red Blood Cells / RBC). Information obtained from a
complete blood count, has become a cornerstone in the hematology laboratory for
diagnostic purposes and monitoring of hematological disorders. However, the
traditional procedure for counting blood cells manually requires effort and a
long time, therefore this method is one of the most expensive routine tests in
laboratory hematology clinic. Solution for such kind of time consuming task and
necessity of data tracability can be found in image processing techniques based
on blood cell morphology . This study aims to identify Acute Lymphocytic
Leukemia (ALL) and Acute Myeloid Leukemia type M3 (AML M3) using Fuzzy Rule
Based System based on morphology of white blood cells. Characteristic
parameters witch extractedare WBC Area, Nucleus and Granule Ratio of white
blood cells. Image processing algorithms such as thresholding, Canny edge
detection and color identification filters are used.Then for identification of
ALL, AML M3 and Healthy cells used Fuzzy Rule Based System with Sugeno method.
In the testing process used 104 images out of which 29 ALL - Positive, 50 AML
M3 - Positive and 25 Healthy cells. Test results showed 83.65 % accuracy .
","[{'version': 'v1', 'created': 'Mon, 16 Nov 2015 12:41:06 GMT'}]",2015-11-17,"[['Suryani', 'Esti', ''], ['Wiharto', 'Wiharto', ''], ['Polvonov', 'Nizomjon', '']]","['ALL', 'AML', 'Fuzzy Rule-Based System', 'Granule Ratio', 'Nucleus Ratio', 'WBC Area', 'White Blood Cell Morphology']"
13909,1301.0997,Perrot K\'evin,K\'evin Perrot and Eric R\'emila,"Kadanoff Sand Piles, following the snowball","Research report. 26 pages, 9 figures",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is about cubic sand grains moving around on nicely packed columns
in one dimension (the physical sand pile is two dimensional, but the support of
sand columns is one dimensional). The Kadanoff Sand Pile Model is a discrete
dynamical system describing the evolution of a finite number of stacked grains
--as they would fall from an hourglass-- to a stable configuration. Grains move
according to the repeated application of a simple local rule until reaching a
stable configuration from which no rule can be applied, namely a fixed point.
  The main interest of the model relies in the difficulty of understanding its
behavior, despite the simplicity of the rule. We are interested in describing
the shape of fixed point configurations according to the number of initially
stacked sand grains. In this paper, we prove the emergence of a wavy shape on
fixed points, i.e., a regular pattern is (nearly) periodically repeated on
fixed points. Interestingly, the regular pattern does not cover the entire
fixed point, but eventually emerges from a seemingly highly disordered segment.
Fortunately, the relative size of the part of fixed points non-covered by the
pattern repetition is asymptotically null.
","[{'version': 'v1', 'created': 'Sun, 6 Jan 2013 11:57:32 GMT'}]",2013-01-08,"[['Perrot', 'Kévin', ''], ['Rémila', 'Eric', '']]","['Sand pile model', 'discrete dynamical system', 'self-organized criticality', 'fixed point']"
13910,1306.6206,Uwe Aickelin,"Grazziela P. Figueredo, Uwe Aickelin","Investigating Immune System Aging: System Dynamics and Agent-Based
  Modeling","Proceedings of the International Summer Computer Simulation
  Conference 2010, 174-181, 2010. arXiv admin note: text overlap with
  arXiv:1306.2898",,,,cs.CE q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  System dynamics and agent based simulation models can both be used to model
and understand interactions of entities within a population. Our modeling work
presented here is concerned with understanding the suitability of the different
types of simulation for the immune system aging problems and comparing their
results. We are trying to answer questions such as: How fit is the immune
system given a certain age? Would an immune boost be of therapeutic value, e.g.
to improve the effectiveness of a simultaneous vaccination? Understanding the
processes of immune system aging and degradation may also help in development
of therapies that reverse some of the damages caused thus improving life
expectancy. Therefore as a first step our research focuses on T cells; major
contributors to immune system functionality. One of the main factors
influencing immune system aging is the output rate of naive T cells. Of further
interest is the number and phenotypical variety of these cells in an
individual, which will be the case study focused on in this paper.
","[{'version': 'v1', 'created': 'Wed, 26 Jun 2013 11:32:38 GMT'}]",2013-06-27,"[['Figueredo', 'Grazziela P.', ''], ['Aickelin', 'Uwe', '']]","['Immunosenescence', 'thymic output', 'naive T celldynamics', 'system dynamics', 'agent based simulation']"
13911,0804.0970,Marie-Claude Gaudel,"Marie-Claude Gaudel (LRI), Pascale Le Gall (IBISC)",Testing data types implementations from algebraic specifications,,"Formal Methods and Testing, Springer-Verlag (Ed.) (2008) 209-239",,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Algebraic specifications of data types provide a natural basis for testing
data types implementations. In this framework, the conformance relation is
based on the satisfaction of axioms. This makes it possible to formally state
the fundamental concepts of testing: exhaustive test set, testability
hypotheses, oracle. Various criteria for selecting finite test sets have been
proposed. They depend on the form of the axioms, and on the possibilities of
observation of the implementation under test. This last point is related to the
well-known oracle problem. As the main interest of algebraic specifications is
data type abstraction, testing a concrete implementation raises the issue of
the gap between the abstract description and the concrete representation. The
observational semantics of algebraic specifications bring solutions on the
basis of the so-called observable contexts. After a description of testing
methods based on algebraic specifications, the chapter gives a brief
presentation of some tools and case studies, and presents some applications to
other formal methods involving datatypes.
","[{'version': 'v1', 'created': 'Mon, 7 Apr 2008 06:35:44 GMT'}]",2008-12-18,"[['Gaudel', 'Marie-Claude', '', 'LRI'], ['Gall', 'Pascale Le', '', 'IBISC']]","['Specification-based testing', 'algebraic specifications', 'testability hypotheses', 'regularity and uniformity hypotheses', 'observability']"
13912,0807.1211,James Cheney,James Cheney,Flux: FunctionaL Updates for XML (extended report),Extended version of ICFP 2008 paper,,,,cs.PL cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  XML database query languages have been studied extensively, but XML database
updates have received relatively little attention, and pose many challenges to
language design. We are developing an XML update language called Flux, which
stands for FunctionaL Updates for XML, drawing upon ideas from functional
programming languages. In prior work, we have introduced a core language for
Flux with a clear operational semantics and a sound, decidable static type
system based on regular expression types.
  Our initial proposal had several limitations. First, it lacked support for
recursive types or update procedures. Second, although a high-level source
language can easily be translated to the core language, it is difficult to
propagate meaningful type errors from the core language back to the source.
Third, certain updates are well-formed yet contain path errors, or ``dead''
subexpressions which never do any useful work. It would be useful to detect
path errors, since they often represent errors or optimization opportunities.
  In this paper, we address all three limitations. Specifically, we present an
improved, sound type system that handles recursion. We also formalize a source
update language and give a translation to the core language that preserves and
reflects typability. We also develop a path-error analysis (a form of dead-code
analysis) for updates.
","[{'version': 'v1', 'created': 'Tue, 8 Jul 2008 17:10:51 GMT'}]",2008-07-09,"[['Cheney', 'James', '']]","['XML', 'update languages', 'type systems', 'static analysis']"
13913,0908.0980,R Doomun,"Syed S. Rizvi, Khaled M. Elleithy, Aasia Riasat","Deterministic Formulization of SNR for Wireless Multiuser DS-CDMA
  Networks","9 pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS July 2009, ISSN 1947 5500, Impact Factor 0.423","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 3, No. 1, July 2009, USA",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless Multiuser receivers suffer from their relatively higher
computational complexity that prevents widespread use of this technique. In
addition, one of the main characteristics of multi-channel communications that
can severely degrade the performance is the inconsistent and low values of SNR
that result in high BER and poor channel capacity. It has been shown that the
computational complexity of a multiuser receiver can be reduced by using the
transformation matrix (TM) algorithm [4]. In this paper, we provide
quantification of SNR based on the computational complexity of TM algorithm. We
show that the reduction of complexity results high and consistent values of SNR
that can consequently be used to achieve a desirable BER performance. In
addition, our simulation results suggest that the high and consistent values of
SNR can be achieved for a desirable BER performance. The performance measure
adopted in this paper is the consistent values of SNR.
","[{'version': 'v1', 'created': 'Sun, 9 Aug 2009 06:57:39 GMT'}]",2009-08-10,"[['Rizvi', 'Syed S.', ''], ['Elleithy', 'Khaled M.', ''], ['Riasat', 'Aasia', '']]","['Computational complexity', 'DS-CDMA', 'wireless multiuser receivers', 'signal to noise ratio']"
13914,0910.4172,Minghui Jiang,Adrian Dumitrescu and Minghui Jiang,Piercing translates and homothets of a convex body,An earlier version of this manuscript appeared in ESA 2009,,,,cs.CG cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  According to a classical result of Gr\""unbaum, the transversal number
$\tau(\F)$ of any family $\F$ of pairwise-intersecting translates or homothets
of a convex body $C$ in $\RR^d$ is bounded by a function of $d$. Denote by
$\alpha(C)$ (resp. $\beta(C)$) the supremum of the ratio of the transversal
number $\tau(\F)$ to the packing number $\nu(\F)$ over all families $\F$ of
translates (resp. homothets) of a convex body $C$ in $\RR^d$. Kim et al.
recently showed that $\alpha(C)$ is bounded by a function of $d$ for any convex
body $C$ in $\RR^d$, and gave the first bounds on $\alpha(C)$ for convex bodies
$C$ in $\RR^d$ and on $\beta(C)$ for convex bodies $C$ in the plane.
  Here we show that $\beta(C)$ is also bounded by a function of $d$ for any
convex body $C$ in $\RR^d$, and present new or improved bounds on both
$\alpha(C)$ and $\beta(C)$ for various convex bodies $C$ in $\RR^d$ for all
dimensions $d$. Our techniques explore interesting inequalities linking the
covering and packing densities of a convex body. Our methods for obtaining
upper bounds are constructive and lead to efficient constant-factor
approximation algorithms for finding a minimum-cardinality point set that
pierces a set of translates or homothets of a convex body.
","[{'version': 'v1', 'created': 'Wed, 21 Oct 2009 20:30:19 GMT'}]",2009-10-23,"[['Dumitrescu', 'Adrian', ''], ['Jiang', 'Minghui', '']]","['Geometric transversals', 'Gallai-type problems', 'packing and covering', 'approximation algorithms']"
13915,0906.1900,Philippe Thomas,"Philippe Thomas (CRAN), Andr\'e Thomas (CRAN)","How deals with discrete data for the reduction of simulation models
  using neural network",,"13th IFAC Symp. On Information Control Problems in Manufacturing
  INCOM'09, Moscou : Russie (2009)",,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Simulation is useful for the evaluation of a Master Production/distribution
Schedule (MPS). Also, the goal of this paper is the study of the design of a
simulation model by reducing its complexity. According to theory of
constraints, we want to build reduced models composed exclusively by
bottlenecks and a neural network. Particularly a multilayer perceptron, is
used. The structure of the network is determined by using a pruning procedure.
This work focuses on the impact of discrete data on the results and compares
different approaches to deal with these data. This approach is applied to
sawmill internal supply chain
","[{'version': 'v1', 'created': 'Wed, 10 Jun 2009 09:56:29 GMT'}]",2009-06-11,"[['Thomas', 'Philippe', '', 'CRAN'], ['Thomas', 'André', '', 'CRAN']]","['multilayer perceptron', 'reduced model', 'simulation', 'neural network', 're-scheduling', 'supply chain']"
13916,1109.1088,Martin Aruldoss Mr,"A. Martin, D. Maladhy, V. Prasanna Venkatesan","A Framework for Business Intelligence Application using Ontological
  Classification","Classification, Ontology, Business Intelligence, Datamining, Inverted
  Index, Ontology Tree Index","International Journal of Engineering Science and Technology
  (IJEST) Vol. 3 No. 2, (2011) 1213-1221",,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Every business needs knowledge about their competitors to survive better. One
of the information repositories is web. Retrieving Specific information from
the web is challenging. An Ontological model is developed to capture specific
information by using web semantics. From the Ontology model, the relations
between the data are mined using decision tree. From all these a new framework
is developed for Business Intelligence.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2011 07:07:26 GMT'}]",2011-09-07,"[['Martin', 'A.', ''], ['Maladhy', 'D.', ''], ['Venkatesan', 'V. Prasanna', '']]","['Classification', 'Ontology', 'Business Intelligence', 'Datamining', 'Inverted Index', 'Ontology Tree Index']"
13917,1701.03230,Oussama Remil,"Oussama Remil, Qian Xie, Xingyu Xie, Kai Xu, Jun Wang",Surface Reconstruction with Data-driven Exemplar Priors,"13 pages, 15 figures, 1 table, Preprint submitted to CAD",,,,cs.CG cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a framework to reconstruct 3D models from raw
scanned points by learning the prior knowledge of a specific class of objects.
Unlike previous work that heuristically specifies particular regularities and
defines parametric models, our shape priors are learned directly from existing
3D models under a framework based on affinity propagation. Given a database of
3D models within the same class of objects, we build a comprehensive library of
3D local shape priors. We then formulate the problem to select
as-few-as-possible priors from the library, referred to as exemplar priors.
These priors are sufficient to represent the 3D shapes of the whole class of
objects from where they are generated. By manipulating these priors, we are
able to reconstruct geometrically faithful models with the same class of
objects from raw point clouds. Our framework can be easily generalized to
reconstruct various categories of 3D objects that have more geometrically or
topologically complex structures. Comprehensive experiments exhibit the power
of our exemplar priors for gracefully solving several problems in 3D shape
reconstruction such as preserving sharp features, recovering fine details and
so on.
","[{'version': 'v1', 'created': 'Thu, 12 Jan 2017 04:51:15 GMT'}]",2017-01-13,"[['Remil', 'Oussama', ''], ['Xie', 'Qian', ''], ['Xie', 'Xingyu', ''], ['Xu', 'Kai', ''], ['Wang', 'Jun', '']]","['3D local shape priors', 'data-driven exemplar priors', 'affinity propagation', 'surface reconstruction']"
13918,1111.3069,Laika Satish Mrs.,"Laika Satish (1), Sami Halawani (2) ((1) Lecturer, Faculty of
  Computing and IT, King Abdul Aziz University, Rabigh, Saudi Arabia, (2) Dean,
  Faculty of Computing and IT, King Abdul Aziz University Rabigh, Saudi Arabia)","A fusion algorithm for joins based on collections in Odra (Object
  Database for Rapid Application development)",ISSN (Online): 1694-0814 http://www.IJCSI.org,"IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 4, No 2, 2011, 289-293",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present the functionality of a currently under development
database programming methodology called ODRA (Object Database for Rapid
Application development) which works fully on the object oriented principles.
The database programming language is called SBQL (Stack based query language).
We discuss some concepts in ODRA for e.g. the working of ODRA, how ODRA runtime
environment operates, the interoperability of ODRA with .net and java .A view
of ODRA's working with web services and xml. Currently the stages under
development in ODRA are query optimization. So we present the prior work that
is done in ODRA related to Query optimization and we also present a new fusion
algorithm of how ODRA can deal with joins based on collections like set, lists,
and arrays for query optimization.
","[{'version': 'v1', 'created': 'Sun, 13 Nov 2011 22:06:36 GMT'}]",2011-11-15,"[['Satish', 'Laika', ''], ['Halawani', 'Sami', '']]","['ODRA environment', 'query optimization', 'SBQL', 'Object oriented databases', 'Collections in OOD']"
13919,1009.4970,Quan-Lin Li,Quan-Lin Li and John C.S. Lui,"Doubly Exponential Solution for Randomized Load Balancing Models with
  Markovian Arrival Processes and PH Service Times","Randomized load balancing, supermarket model, matrix-analytic
  approach, doubly exponential solution, density dependent jump Markov process,
  Markovian Arrival Process (MAP), phase type (PH) distribution, fixed point,
  exponential convergence, Lipschitz condition",,,,cs.DM cs.DC,http://creativecommons.org/licenses/by/3.0/,"  In this paper, we provide a novel matrix-analytic approach for studying
doubly exponential solutions of randomized load balancing models (also known as
supermarket models) with Markovian arrival processes (MAPs) and phase-type (PH)
service times. We describe the supermarket model as a system of differential
vector equations by means of density dependent jump Markov processes, and
obtain a closed-form solution with a doubly exponential structure to the fixed
point of the system of differential vector equations. Based on this, we show
that the fixed point can be decomposed into the product of two factors
inflecting arrival information and service information, and further find that
the doubly exponential solution to the fixed point is not always unique for
more general supermarket models. Furthermore, we analyze the exponential
convergence of the current location of the supermarket model to its fixed
point, and apply the Kurtz Theorem to study density dependent jump Markov
process given in the supermarket model with MAPs and PH service times, which
leads to the Lipschitz condition under which the fraction measure of the
supermarket model weakly converges the system of differential vector equations.
This paper gains a new understanding of how workload probing can help in load
balancing jobs with non-Poisson arrivals and non-exponential service times.
","[{'version': 'v1', 'created': 'Sat, 25 Sep 2010 04:23:50 GMT'}, {'version': 'v2', 'created': 'Sun, 12 Dec 2010 01:29:42 GMT'}]",2010-12-14,"[['Li', 'Quan-Lin', ''], ['Lui', 'John C. S.', '']]","['Randomized load balancing', 'supermarket model', 'matrix-analytic ap']"
13920,1303.5972,Nilanjan  Dey,"Arijit Kumar Pal, Poulami Das, Nilanjan Dey","Odd-Even Embedding Scheme Based Modified Reversible Watermarking
  Technique using Blueprint","10 Pages, Figure 2, Table 1, FOSET, Academic Meet, Kolkata, India,
  22-23 March 2013",,,,cs.MM cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Digital watermarking is a technique of information adding or information
hiding in order to identify the owner of the data in multimedia content. It
seems that a signal or digital image can permanently embed over another digital
data providing a good way to protect intellectual property from illegal
replication. The cover data that is transmitted through the internet hides the
watermark in a computer aided assertion method such that it becomes
undetectable. Finally it stands as a hindrance over many operations without
harming the embedded host document. Unfortunately, many owners of the digital
materials such as images, text, audio and video are reluctant to the spreading
of their documents on the web or other networked environment, because the ease
of duplicating digital materials facilitates copyright violation. Digital media
distribution occurs through various channels. The cover data may or may not
hold any relation with the watermark information. In the last two decades, a
considerable amount of research has been done on the digital watermarking of
multimedia files such as audio, video, images and text. Different type of
watermarking algorithms has been proposed by the researchers to achieve high
level of security and authenticity. In our proposed method, a modified
reversible watermarking technique is introduced, which employs a blueprint
generation of original image based on odd-even embedding methodology to yield
large data hiding capacity, security as well as high watermarked quality. The
experimental results demonstrate that, no matter how much secret data is
embedded, the watermarked quality is about 51dB in this proposed scheme.
","[{'version': 'v1', 'created': 'Sun, 24 Mar 2013 17:52:45 GMT'}]",2013-03-26,"[['Pal', 'Arijit Kumar', ''], ['Das', 'Poulami', ''], ['Dey', 'Nilanjan', '']]","['Data Hiding', 'Reversible Watermarking', 'Blueprint', 'Hiding Capacity', 'PSNR']"
13921,1506.04608,Daja Abdul,"Javairia Nazir, Mehreen Sirshar",Flow Segmentation in Dense Crowds,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A framework is proposed in this paper that is used to segment flow of dense
crowds. The flow field that is generated by the movement in the crowd is
treated just like an aperiodic dynamic system. On this flow field a grid of
particles is put over for particle advection by the use of a numerical
integration scheme. Then flow maps are generated which associates the initial
position of the particles with final position. The gradient of the flow maps
gives the amount of divergence of the neighboring particles. For forward
integration and analysis forward Finite time Lyapunov Exponent is calculated
and backward Finite time Lyapunov Exponent is also calculated it gives the
Lagrangian coherent structures of the flow in crowd. Lagrangian Coherent
Structures basically divides the flow in crowd into regions and these regions
have different dynamics. These regions are then used to get the boundary in the
different flow segments by using water shed algorithm. The experiment is
conducted on the crowd dataset of UCF (University of central Florida).
","[{'version': 'v1', 'created': 'Mon, 15 Jun 2015 14:14:20 GMT'}]",2015-06-16,"[['Nazir', 'Javairia', ''], ['Sirshar', 'Mehreen', '']]","['FTLE (Finite Time Lyapunov Exponent)', 'LCS (Lagrangian Coherent Structures)', 'CS(coherent structure)']"
13922,1506.03562,Gabriele Fici,Gabriele Fici and Filippo Mignosi,Words with the Maximum Number of Abelian Squares,To appear in the proceedings of WORDS 2015,,,,cs.DM cs.FL math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An abelian square is the concatenation of two words that are anagrams of one
another. A word of length $n$ can contain $\Theta(n^2)$ distinct factors that
are abelian squares. We study infinite words such that the number of abelian
square factors of length $n$ grows quadratically with $n$.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2015 06:42:19 GMT'}]",2015-06-12,"[['Fici', 'Gabriele', ''], ['Mignosi', 'Filippo', '']]","['Abelian square', 'Thue-Morse word', 'Sturmian words', 'abelian-squarerich word']"
13923,1206.0111,Bjoern Andres,"Bjoern Andres, Thorsten Beier, Joerg H. Kappes",OpenGM: A C++ Library for Discrete Graphical Models,5 pages,,,,cs.AI cs.MS stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  OpenGM is a C++ template library for defining discrete graphical models and
performing inference on these models, using a wide range of state-of-the-art
algorithms. No restrictions are imposed on the factor graph to allow for
higher-order factors and arbitrary neighborhood structures. Large models with
repetitive structure are handled efficiently because (i) functions that occur
repeatedly need to be stored only once, and (ii) distinct functions can be
implemented differently, using different encodings alongside each other in the
same model. Several parametric functions (e.g. metrics), sparse and dense value
tables are provided and so is an interface for custom C++ code. Algorithms are
separated by design from the representation of graphical models and are easily
exchangeable. OpenGM, its algorithms, HDF5 file format and command line tools
are modular and extendible.
","[{'version': 'v1', 'created': 'Fri, 1 Jun 2012 07:36:54 GMT'}]",2012-06-04,"[['Andres', 'Bjoern', ''], ['Beier', 'Thorsten', ''], ['Kappes', 'Joerg H.', '']]","['Graphical Model', 'Combinatorial Optimization', 'Inference', 'C++']"
13924,1305.7200,Philippe Martin,Philippe A. Martin,Organizing Linked Data Quality Related Methods,"7 pages, 10 tables, conference",IKE (2012) 376-382,,,cs.DL cs.AI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents the top-level of an ontology categorizing and
generalizing best practices and quality criteria or measures for Linked Data.
It permits to compare these techniques and have a synthetic organized view of
what can or should be done for knowledge sharing purposes. This ontology is
part of a general knowledge base that can be accessed and complemented by any
Web user. Thus, it can be seen as a cooperatively built library for the above
cited elements. Since they permit to evaluate information objects and create
better ones, these elements also permit knowledge-based tools and techniques -
as well as knowledge providers - to be evaluated and categorized based on their
input/output information objects. One top-level distinction permitting to
organize this ontology is the one between content, medium and containers of
descriptions. Various structural, ontological, syntactical and lexical
distinctions are then used.
","[{'version': 'v1', 'created': 'Thu, 30 May 2013 18:40:30 GMT'}]",2013-05-31,"[['Martin', 'Philippe A.', '']]","['Knowledge quality  evaluation', 'Knowledge sharing ontology', 'Knowledge organization', 'best practices']"
13925,1307.5720,Lucas Paletta,"Esther L. Colombini, Alexandre S. Sim\~oes and Carlos H. C. Ribeiro","Top-down and Bottom-up Feature Combination for Multi-sensor Attentive
  Robots",,,,ISACS/2013/07,cs.RO cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The information available to robots in real tasks is widely distributed both
in time and space, requiring the agent to search for relevant data. In humans,
that face the same problem when sounds, images and smells are presented to
their sensors in a daily scene, a natural system is applied: Attention. As
vision plays an important role in our routine, most research regarding
attention has involved this sensorial system and the same has been replicated
to the robotics field. However,most of the robotics tasks nowadays do not rely
only in visual data, that are still costly. To allow the use of attentive
concepts with other robotics sensors that are usually used in tasks such as
navigation, self-localization, searching and mapping, a generic attentional
model has been previously proposed. In this work, feature mapping functions
were designed to build feature maps to this attentive model from data from
range scanner and sonar sensors. Experiments were performed in a high fidelity
simulated robotics environment and results have demonstrated the capability of
the model on dealing with both salient stimuli and goal-driven attention over
multiple features extracted from multiple sensors.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2013 14:09:30 GMT'}]",2013-07-23,"[['Colombini', 'Esther L.', ''], ['Simões', 'Alexandre S.', ''], ['Ribeiro', 'Carlos H. C.', '']]","['Robotics', 'Attention', 'Sonar', 'Range Scanner', 'Multi-Sensor', 'Bottomup Attention', 'Top-Down Attention']"
13926,1606.08510,Gerardo Vega,Gerardo Vega,"Determining the full weight distribution of any irreducible cyclic code
  over any finite field of dimension two",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In coding theory, a very interesting problem (but at the same time, a very
difficult one) is to determine the weight distribution of a given code. This
problem is even more interesting for cyclic codes, and this is so, mainly
because they possess a rich algebraic structure, which can be utilized in a
variety of ways. For example, in Engineering Telecommunications, this structure
is commonly employed to design very efficient coding and decoding algorithms.
In this note, we are going to use a characterization of all semiprimitive
two-weight irreducible cyclic codes over any finite field, recently presented
in [8], in order to determine the full weight distribution of any irreducible
cyclic code over any finite field of dimension two. In fact, the relevance of
our results is that by means of them we can actually directly determine the
full weight distribution of any irreducible cyclic code, of dimension one or
two, just by knowing its length.
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2016 23:29:04 GMT'}]",2016-06-29,"[['Vega', 'Gerardo', '']]","['Irreducible cyclic codes', 'semiprimitive codes', 'weight distribution']"
13927,1707.09030,Marylesa Howard,"Marylesa Howard, Margaret C. Hock, B. T. Meehan, Leora
  Dresselhaus-Cooper","A Locally Adapting Technique for Boundary Detection using Image
  Segmentation",,,,DOE/NV/25946--3282,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rapid growth in the field of quantitative digital image analysis is paving
the way for researchers to make precise measurements about objects in an image.
To compute quantities from the image such as the density of compressed
materials or the velocity of a shockwave, we must determine object boundaries.
Images containing regions that each have a spatial trend in intensity are of
particular interest. We present a supervised image segmentation method that
incorporates spatial information to locate boundaries between regions with
overlapping intensity histograms. The segmentation of a pixel is determined by
comparing its intensity to distributions from local, nearby pixel intensities.
Because of the statistical nature of the algorithm, we use maximum likelihood
estimation theory to quantify uncertainty about each boundary. We demonstrate
the success of this algorithm on a radiograph of a multicomponent cylinder and
on an optical image of a laser-induced shockwave, and we provide final boundary
locations with associated bands of uncertainty.
","[{'version': 'v1', 'created': 'Thu, 27 Jul 2017 20:06:52 GMT'}]",2017-07-31,"[['Howard', 'Marylesa', ''], ['Hock', 'Margaret C.', ''], ['Meehan', 'B. T.', ''], ['Dresselhaus-Cooper', 'Leora', '']]","['boundary detection', 'image processing', 'statistical segmentation', 'discriminantanalysis', 'maximum likelihood estimation']"
13928,1606.06399,Jonathan Gorard,Jonathan Gorard,"Uniqueness Trees: A Possible Polynomial Approach to the Graph
  Isomorphism Problem","14 pages + appendix, 17 figures",,,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the novel `uniqueness tree' algorithm, as one possible
method for determining whether two finite, undirected graphs are isomorphic. We
prove that the algorithm has polynomial time complexity in the worst case, and
that it will always detect the presence of an isomorphism whenever one exists.
We also propose that the algorithm will equivalently discern the lack of an
isomorphism whenever one does not exist, and some initial justifications are
given for this proposition, although it cannot yet be rigorously proven.
Finally, we present experimental evidence for both the effectiveness and
efficiency of the uniqueness tree method, using data gathered from a practical
implementation of the algorithm. Some consequences and directions for further
research are discussed.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2016 02:04:13 GMT'}]",2016-06-22,"[['Gorard', 'Jonathan', '']]","['graph isomorphism', 'computational complexity', 'canonical labelling']"
13929,1312.6833,Feng Xia,"Haifeng Liu, Feng Xia, Zhuo Yang, and Yang Cao",An Energy-Efficient Localization Strategy for Smartphones,,"Computer Science and Information Systems, Vol.8, No.4, 1117-1128,
  2011",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, smartphones have become prevalent. Much attention is being
paid to developing and making use of mobile applications that require position
information. The Global Positioning System (GPS) is a very popular localization
technique used by these applications because of its high accuracy. However, GPS
incurs an unacceptable energy consumption, which severely limits the use of
smartphones and reduces the battery lifetime. Then an urgent requirement for
these applications is a localization strategy that not only provides enough
accurate position information to meet users' need but also consumes less
energy. In this paper, we present an energy-efficient localization strategy for
smartphone applications. On one hand, it can dynamically estimate the next
localization time point to avoid unnecessary localization operations. On the
other hand, it can also automatically select the energy-optimal localization
method. We evaluate the strategy through a series of simulations. Experimental
results show that it can significantly reduce the localization energy
consumption of smartphones while ensuring a good satisfaction degree.
","[{'version': 'v1', 'created': 'Tue, 24 Dec 2013 15:00:53 GMT'}]",2013-12-25,"[['Liu', 'Haifeng', ''], ['Xia', 'Feng', ''], ['Yang', 'Zhuo', ''], ['Cao', 'Yang', '']]","['smartphone', 'energy efficiency', 'localization', 'mobile']"
13930,1307.1417,Marius Nicolae,Sanguthevar Rajasekaran and Marius Nicolae,An Elegant Algorithm for the Construction of Suffix Arrays,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The suffix array is a data structure that finds numerous applications in
string processing problems for both linguistic texts and biological data. It
has been introduced as a memory efficient alternative for suffix trees. The
suffix array consists of the sorted suffixes of a string. There are several
linear time suffix array construction algorithms (SACAs) known in the
literature. However, one of the fastest algorithms in practice has a worst case
run time of $O(n^2)$. The problem of designing practically and theoretically
efficient techniques remains open. In this paper we present an elegant
algorithm for suffix array construction which takes linear time with high
probability; the probability is on the space of all possible inputs. Our
algorithm is one of the simplest of the known SACAs and it opens up a new
dimension of suffix array construction that has not been explored until now.
Our algorithm is easily parallelizable. We offer parallel implementations on
various parallel models of computing. We prove a lemma on the $\ell$-mers of a
random string which might find independent applications. We also present
another algorithm that utilizes the above algorithm. This algorithm is called
RadixSA and has a worst case run time of $O(n\log{n})$. RadixSA introduces an
idea that may find independent applications as a speedup technique for other
SACAs. An empirical comparison of RadixSA with other algorithms on various
datasets reveals that our algorithm is one of the fastest algorithms to date.
The C++ source code is freely available at
http://www.engr.uconn.edu/~man09004/radixSA.zip
","[{'version': 'v1', 'created': 'Thu, 4 Jul 2013 17:10:08 GMT'}]",2013-07-05,"[['Rajasekaran', 'Sanguthevar', ''], ['Nicolae', 'Marius', '']]","['suffix array construction algorithm', 'parallel algorithm', 'high']"
13931,1702.07481,Loet Leydesdorff,"Loet Leydesdorff, Dieter Franz Kogler and Bowen Yan","Mapping Patent Classifications: Portfolio and Statistical Analysis, and
  the Comparison of Strengths and Weaknesses","Scientometrics 112(3) (2017) 1573-1591;
  http://link.springer.com/article/10.1007/s11192-017-2449-0",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Cooperative Patent Classifications (CPC) jointly developed by the
European and US Patent Offices provide a new basis for mapping and portfolio
analysis. This update provides an occasion for rethinking the parameter
choices. The new maps are significantly different from previous ones, although
this may not always be obvious on visual inspection. Since these maps are
statistical constructs based on index terms, their quality--as different from
utility--can only be controlled discursively. We provide nested maps online and
a routine for portfolio overlays and further statistical analysis. We add a new
tool for ""difference maps"" which is illustrated by comparing the portfolios of
patents granted to Novartis and MSD in 2016.
","[{'version': 'v1', 'created': 'Fri, 24 Feb 2017 07:29:46 GMT'}, {'version': 'v2', 'created': 'Sat, 14 Oct 2017 13:01:52 GMT'}]",2017-10-17,"[['Leydesdorff', 'Loet', ''], ['Kogler', 'Dieter Franz', ''], ['Yan', 'Bowen', '']]","['patent', 'map', 'portfolio', 'CPC', 'diversity', 'city', 'comparisons', 'SWOT']"
13932,0910.1868,N Vunka Jungum,Vishal Goyal and Gurpreet Singh Lehal,Evaluation of Hindi to Punjabi Machine Translation System,"""International Journal of Computer Science Issues, IJCSI, Volume 4,
  Issue 1, pp36-39, September 2009""","V.Goyal and G. Singh Lehal, ""Evaluation of Hindi to Punjabi
  Machine Translation System"", International Journal of Computer Science
  Issues, IJCSI, Volume 4, Issue 1, pp36-39, September 2009",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine Translation in India is relatively young. The earliest efforts date
from the late 80s and early 90s. The success of every system is judged from its
evaluation experimental results. Number of machine translation systems has been
started for development but to the best of author knowledge, no high quality
system has been completed which can be used in real applications. Recently,
Punjabi University, Patiala, India has developed Punjabi to Hindi Machine
translation system with high accuracy of about 92%. Both the systems i.e.
system under question and developed system are between same closely related
languages. Thus, this paper presents the evaluation results of Hindi to Punjabi
machine translation system. It makes sense to use same evaluation criteria as
that of Punjabi to Hindi Punjabi Machine Translation System. After evaluation,
the accuracy of the system is found to be about 95%.
","[{'version': 'v1', 'created': 'Fri, 9 Oct 2009 21:40:26 GMT'}]",2009-10-13,"[['Goyal', 'Vishal', ''], ['Lehal', 'Gurpreet Singh', '']]","['Hindi to Punjabi Machine Translation System', 'Evaluation of MT between closely related languages', 'Cognitive Science']"
13933,1712.02875,Irina Pashchenko,Irina Pashchenko,One More Way to Encrypt a Message,"33 pages, 5 formulas, 3 C++ programs",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work describes an example of an application of a novel method for
symmetric cryptography. Its purpose is to show how a regular message can be
encrypted and then decrypted in an easy, yet secure way. The encrypting method
introduced in this work is different from others because it involves decimals
as well as integers, encrypting the same initial message differently every
time, and inserting misleading digits into every encrypted message, thus making
the task of breaking the code even harder. A C++ program was written to support
each chapter.
","[{'version': 'v1', 'created': 'Thu, 7 Dec 2017 22:06:18 GMT'}]",2017-12-11,"[['Pashchenko', 'Irina', '']]","['cryptography', 'cipher', 'hash function', 'encrypting', 'decrypting', 'secret code', 'cryptanalysis']"
13934,1603.04110,Seyed Morteza Mousavi Barroudi,"Seyed Morteza Mousavi, Aaron Harwood, Shanika Karunasekera, Mojtaba
  Maghrebi","Geometry of Interest (GOI): Spatio-Temporal Destination Extraction and
  Partitioning in GPS Trajectory Data","A version of this technical report has been submitted to the Springer
  Journal of Ambient Intelligence and Humanized Computing and it is under
  review",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays large amounts of GPS trajectory data is being continuously collected
by GPS-enabled devices such as vehicles navigation systems and mobile phones.
GPS trajectory data is useful for applications such as traffic management,
location forecasting, and itinerary planning. Such applications often need to
extract the time-stamped Sequence of Visited Locations (SVLs) of the mobile
objects. The nearest neighbor query (NNQ) is the most applied method for
labeling the visited locations based on the IDs of the POIs in the process of
SVL generation. NNQ in some scenarios is not accurate enough. To improve the
quality of the extracted SVLs, instead of using NNQ, we label the visited
locations as the IDs of the POIs which geometrically intersect with the GPS
observations. Intersection operator requires the accurate geometry of the
points of interest which we refer to them as the Geometries of Interest (GOIs).
In some application domains (e.g. movement trajectories of animals), adequate
information about the POIs and their GOIs may not be available a priori, or
they may not be publicly accessible and, therefore, they need to be derived
from GPS trajectory data. In this paper we propose a novel method for
estimating the POIs and their GOIs, which consists of three phases: (i)
extracting the geometries of the stay regions; (ii) constructing the geometry
of destination regions based on the extracted stay regions; and (iii)
constructing the GOIs based on the geometries of the destination regions. Using
the geometric similarity to known GOIs as the major evaluation criterion, the
experiments we performed using long-term GPS trajectory data show that our
method outperforms the existing approaches.
","[{'version': 'v1', 'created': 'Mon, 14 Mar 2016 01:52:28 GMT'}, {'version': 'v2', 'created': 'Mon, 16 May 2016 20:24:07 GMT'}]",2016-05-18,"[['Mousavi', 'Seyed Morteza', ''], ['Harwood', 'Aaron', ''], ['Karunasekera', 'Shanika', ''], ['Maghrebi', 'Mojtaba', '']]","['Trajectory Data', 'Spatio-Temporal Partitioning', 'Geometry of Interest', 'Time-Value', 'TimeWeighted Centroid', 'Destination Extraction']"
13935,1406.6631,Aggelos Biboudis,"Aggelos Biboudis, Nick Palladinos and Yannis Smaragdakis",Clash of the Lambdas,"In the revised version: 1) we used a fixed heap with 3GB. The GC
  throughput was improved and results are more balanced, 2) we discussed
  briefly why we chose not to use targeted JVM flags, 3) we discussed
  @specialized and miniboxing, 4) we added a new benchmark that tests a
  streaming operation that avoids automatic boxing of our input data and 5) a
  subtitle was added",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The introduction of lambdas in Java 8 completes the slate of
statically-typed, mainstream languages with both object-oriented and functional
features. The main motivation for lambdas in Java has been to facilitate
stream-based declarative APIs, and, therefore, easier parallelism. In this
paper, we evaluate the performance impact of lambda abstraction employed in
stream processing, for a variety of high-level languages that run on a virtual
machine (C#, F#, Java and Scala) and runtime platforms (JVM on Linux and
Windows, .NET CLR for Windows, Mono for Linux). Furthermore, we evaluate the
performance gain that two optimizing libraries (ScalaBlitz and LinqOptimizer)
can offer for C#, F# and Scala. Our study is based on small-scale
throughput-benchmarking, with significant care to isolate different factors,
consult experts on the systems involved, and identify causes and opportunities.
We find that Java exhibits high implementation maturity, which is a dominant
factor in benchmarks. At the same time, optimizing frameworks can be highly
effective for common query patterns.
","[{'version': 'v1', 'created': 'Wed, 25 Jun 2014 16:33:11 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Jul 2014 11:24:58 GMT'}]",2014-07-15,"[['Biboudis', 'Aggelos', ''], ['Palladinos', 'Nick', ''], ['Smaragdakis', 'Yannis', '']]","['lambdas', 'java', 'scala', 'c#', 'f#', 'query optimization', 'querylanguages', 'declarative']"
13936,1412.2204,Andrea Detti PhD,"Andrea Detti, Claudio Pisa, Nicola Blefari-Melazzi","Multipath forwarding strategies in Information Centric Networks with
  AIMD congestion control",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A content can be replicated in more than one node, in Information Centric
Networks (ICNs). Thus, more than one path can be followed to reach the same
content, and it is necessary to decide the interface(s) to be selected in every
network node to forward content requests towards such multiple content
containers. A multipath forwarding strategy defines how to perform this choice.
In this paper we propose a general analytical model to evaluate the effect of
multipath forwarding strategies on the performance of an ICN content delivery,
whose congestion control follows a receiver driven, loss-based AIMD scheme. We
use the model to understand the behavior of ICN multipath forwarding strategies
proposed in the literature so far, and to devise and evaluate a novel strategy.
The considered multipath forwarding strategies are also evaluated in a
realistic network setting, by using the PlanetLab testbed.
","[{'version': 'v1', 'created': 'Sat, 6 Dec 2014 07:24:37 GMT'}]",2014-12-09,"[['Detti', 'Andrea', ''], ['Pisa', 'Claudio', ''], ['Blefari-Melazzi', 'Nicola', '']]","['Information Centric Networks', 'multipath forwarding', 'congestion control', 'analytical model', 'test-bed']"
13937,1704.06802,Thanh Thoa Pham Thi Dr.,"Thanh Thoa Pham Thi, Joe Timoney, Shyram Ravichandran, Peter Mooney,
  Adam Winstanley",Bike Renting Data Analysis: The Case of Dublin City,GISRUK 2017,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Public bike renting is more and more popular in cities to incentivise a
reduction in car journeys and to boost the use of green transportation
alternatives. One of the challenges of this application is to effectively plan
the resources usage. This paper presents some analysis of Dublin bike renting
scheme based on statistics and data mining. It provides available bike patterns
at the most interesting bike stations, that is, the busiest and the quietest
stations. Consistency checking with new data reinforces confidence in the
patterns obtained. Identifying available bike patterns helps to better address
user needs such as organising the rebalancing of the bike numbers between
stations in advance of demand.
","[{'version': 'v1', 'created': 'Sat, 22 Apr 2017 13:49:43 GMT'}]",2017-04-25,"[['Thi', 'Thanh Thoa Pham', ''], ['Timoney', 'Joe', ''], ['Ravichandran', 'Shyram', ''], ['Mooney', 'Peter', ''], ['Winstanley', 'Adam', '']]","['bike renting', 'data analysis', 'clustering', 'data visualisation', 'Open Street Maps']"
13938,1309.7685,Amey Karkare,Saravana Perumal P and Amey Karkare,Retargeting GCC: Do We Reinvent the Wheel Every Time?,"4 pages, accepted at The Second Asia-Pacific Programming Languages
  and Compilers Workshop (APPLC), Shenzen, China, Feb 2013",,,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Porting GCC to new architecture requires writing a Machine Description (MD)
file that contains mapping from GCC's intermediate form to the target assembly
code. Constructing an MD file is a difficult task because it requires the user
to understand both (a) the internals of GCC, and (b) the intricacies of the
target architecture. Instruction sets of different architectures exhibit
significant amount of semantic similarities across a large class (for example,
the instruction sets for RISC architectures) and differ only in syntax.
Therefore, it is expected that MD files of machines with similar architectures
should also have similarities. To confirm our hypothesis, we created
""mdcompare"", a tool to (a) extract RTL patterns (machine independent
abstraction of RTL templates) from MD files of well known architectures and (b)
compare the similarity of patterns across architectures. The results are
encouraging; we found that 28% -- 70% RTL expressions are similar across pairs
of MD files, the similarity percentage being on the higher side for pairs of
similar architectures.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2013 00:48:02 GMT'}]",2013-10-04,"[['P', 'Saravana Perumal', ''], ['Karkare', 'Amey', '']]","['Compiler', 'Retargetable Compilers', 'GCC', 'Machine Descriptions', 'Code Generation']"
13939,1111.1022,Carlos Alberto Fernandez-y-Fernandez,Carlos Alberto Fernandez-y-Fernandez and Mart\'in Jos\'e Jos\'e,"Towards the integration of formal specification in the \'Ancora
  methodology",,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are some non-formal methodologies such as RUP, OpenUP, agile
methodologies such as SCRUP, XP and techniques like those proposed by UML,
which allow the development of software. The software industry has struggled to
generate quality software, as importance has not been given to the engineering
requirements, resulting in a poor specification of requirements and software of
poor quality. In order to generate a contribution to the specification of
requirements, this article describes a methodological proposal, implementing
formal methods to the results of the process of requirements analysis of the
methodology \'Ancora.
","[{'version': 'v1', 'created': 'Fri, 4 Nov 2011 00:52:06 GMT'}]",2011-11-07,"[['Fernandez-y-Fernandez', 'Carlos Alberto', ''], ['José', 'Martín José', '']]","['Software Engineering (SE)', 'Requirements Engineering (RE)', 'Software Requirements Specification (SRS)', 'Formal Methods (FM)']"
13940,1107.0350,David Insa,"David Insa, Josep Silva",Optimal Divide and Query (extended version),,,,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Algorithmic debugging is a semi-automatic debugging technique that allows the
programmer to precisely identify the location of bugs without the need to
inspect the source code. The technique has been successfully adapted to all
paradigms and mature implementations have been released for languages such as
Haskell, Prolog or Java. During three decades, the algorithm introduced by
Shapiro and later improved by Hirunkitti has been thought optimal. In this
paper we first show that this algorithm is not optimal, and moreover, in some
situations it is unable to find all possible solutions, thus it is incomplete.
Then, we present a new version of the algorithm that is proven optimal, and we
introduce some equations that allow the algorithm to identify all optimal
solutions.
","[{'version': 'v1', 'created': 'Sat, 2 Jul 2011 01:35:07 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Jul 2011 15:09:51 GMT'}, {'version': 'v3', 'created': 'Tue, 26 Jul 2011 14:08:07 GMT'}]",2011-07-27,"[['Insa', 'David', ''], ['Silva', 'Josep', '']]","['Algorithmic Debugging', 'Strategy', 'Divide & Query']"
13941,1307.5839,Masoumeh Vali,Masoumeh Vali,"A New Approach for Finding the Global Optimal Point Using Subdividing
  Labeling Method (SLM)","arXiv admin note: text overlap with arXiv:1307.5667, arXiv:1307.5840",,,,cs.NE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In most global optimization problems, finding global optimal point inthe
multidimensional and great search space needs high computations. In this paper,
we present a new approach to find global optimal point with the low computation
and few steps using subdividing labeling method (SLM) which can also be used in
the multi-dimensional and great search space. In this approach, in each step,
crossing points will be labeled and complete label polytope search space of
selected polytope will be subdivided after being selected. SLM algorithm finds
the global point until h (subdivision function) turns into zero. SLM will be
implemented on five applications and compared with the latest techniques such
as random search, random search-walk and simulated annealing method. The
results of the proposed method demonstrate that our new approach is faster and
more reliable and presents an optimal time complexity O (logn).
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2013 12:20:16 GMT'}]",2013-07-24,"[['Vali', 'Masoumeh', '']]","['Global Optimization Problems', 'Subdivision Labeling Method (SLM)', 'MultiDimensional', 'Crossing Point    1 Introduction']"
13942,1610.09205,Pablo Baldivieso Monasterios,"Pablo R Baldivieso Monasterios and Bernardo Hernandez and Paul A
  Trodden",Nested Distributed Model Predictive Control,"7 pages, 1 figure, submitted to IFAC 2017 conference",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a distributed model predictive control approach for linear
time-invariant systems coupled via dynamics. The proposed approach uses the
tube MPC concept for robustness to handle the disturbances induced by mutual
interactions between subsystems; however, the main novelty here is to replace
the conventional linear disturbance rejection controller with a second MPC
controller, as is done in tube-based nonlinear MPC. In the distributed setting,
this has the advantages that the disturbance rejection controller is able to
consider the plans of neighbours, and the reliance on explicit robust invariant
sets is removed.
","[{'version': 'v1', 'created': 'Fri, 28 Oct 2016 13:27:31 GMT'}]",2016-10-31,"[['Monasterios', 'Pablo R Baldivieso', ''], ['Hernandez', 'Bernardo', ''], ['Trodden', 'Paul A', '']]","['Control of constrained systems; Decentralized', 'distributed control; Distributedcontrol', 'estimation; Model predictive', 'optimization-based control']"
13943,1501.04867,Andrei Romashchenko,"Tarik Kaced, Andrei Romashchenko, Nikolay Vereshchagin",Conditional Information Inequalities and Combinatorial Applications,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that the inequality $H(A \mid B,X) + H(A \mid B,Y) \le H(A\mid B)$
for jointly distributed random variables $A,B,X,Y$, which does not hold in
general case, holds under some natural condition on the support of the
probability distribution of $A,B,X,Y$. This result generalizes a version of the
conditional Ingleton inequality: if for some distribution $I(X: Y \mid A) =
H(A\mid X,Y)=0$, then $I(A : B) \le I(A : B \mid X) + I(A: B \mid Y) + I(X :
Y)$.
  We present two applications of our result. The first one is the following
easy-to-formulate combinatorial theorem: assume that the edges of a bipartite
graph are partitioned into $K$ matchings such that for each pair (left vertex
$x$, right vertex $y$) there is at most one matching in the partition involving
both $x$ and $y$; assume further that the degree of each left vertex is at
least $L$ and the degree of each right vertex is at least $R$. Then $K\ge LR$.
The second application is a new method to prove lower bounds for biclique
coverings of bipartite graphs.
","[{'version': 'v1', 'created': 'Tue, 20 Jan 2015 16:28:01 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Jan 2015 07:21:42 GMT'}, {'version': 'v3', 'created': 'Mon, 25 Jan 2016 12:53:25 GMT'}, {'version': 'v4', 'created': 'Wed, 13 Sep 2017 16:21:08 GMT'}]",2017-09-14,"[['Kaced', 'Tarik', ''], ['Romashchenko', 'Andrei', ''], ['Vereshchagin', 'Nikolay', '']]","['Shannon entropy', 'conditional information inequalities', 'non Shannon type information inequalities', 'biclique cover', 'edge coloring']"
13944,1307.2641,Timothy Wang,"Timothy Wang and Romain Jobredeaux and Heber Herencia and Pierre-Loic
  Garoche and Arnaud Dieumegard and Eric Feron and Marc Pantel","From Design to Implementation: an Automated, Credible Autocoding Chain
  for Control Systems",,,,,cs.SY cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article describes a fully automated, credible autocoding chain for
control systems. The framework generates code, along with guarantees of high
level functional properties which can be independently verified. It relies on
domain specific knowledge and fomal methods of analysis to address a context of
heightened safety requirements for critical embedded systems and
ever-increasing costs of verification and validation. The platform strives to
bridge the semantic gap between domain expert and code verification expert.
First, a graphical dataflow language is extended with annotation symbols
enabling the control engineer to express high level properties of its control
law within the framework of a familiar language. An existing autocoder is
enhanced to both generate the code implementing the initial design, but also to
carry high level properties down to annotations at the level of the code.
Finally, using customized code analysis tools, certificates are generated which
guarantee the correctness of the annotations with respect to the code, and can
be verified using existing static analysis tools. Only a subset of properties
and controllers are handled at this point.
","[{'version': 'v1', 'created': 'Wed, 10 Jul 2013 01:14:29 GMT'}, {'version': 'v2', 'created': 'Sun, 25 Aug 2013 16:30:25 GMT'}]",2013-08-27,"[['Wang', 'Timothy', ''], ['Jobredeaux', 'Romain', ''], ['Herencia', 'Heber', ''], ['Garoche', 'Pierre-Loic', ''], ['Dieumegard', 'Arnaud', ''], ['Feron', 'Eric', ''], ['Pantel', 'Marc', '']]","['Control Engineering', 'Autocoding', 'Lyapunov proofs', 'FormalVerification', 'Control Software']"
13945,1106.0217,Philipp Schaer,Philipp Schaer,Using Lotkaian Informetrics for Ranking in Digital Libraries,4 pages; Proceedings of the ASIS&T European Workshop 2011 (AEW 2011),,,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this paper is to propose the use of models, theories and laws
in bibliometrics and scientometrics to enhance information retrieval processes,
especially ranking. A common pattern in many man-made data sets is Lotka's Law
which follows the well-known power-law distributions. These informetric
distributions can be used to give an alternative order to large and scattered
result sets and can be applied as a new ranking mechanism. The
polyrepresentation of information in Digital Library systems is used to enhance
the retrieval quality, to overcome the drawbacks of the typical term-based
ranking approaches and to enable users to explore retrieved document sets from
a different perspective.
","[{'version': 'v1', 'created': 'Wed, 1 Jun 2011 16:13:18 GMT'}]",2011-06-02,"[['Schaer', 'Philipp', '']]","['Lotka’s Law', 'informetrics', 'scientometrics', 'information retrieval', 'non-textual ranking', 'Digital Libraries']"
13946,1502.05968,Javad Ghaderi,"Javad Ghaderi, Sanjay Shakkottai, R Srikant",Scheduling Storms and Streams in the Cloud,14 pages,,,,cs.NI cs.DC math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by emerging big streaming data processing paradigms (e.g., Twitter
Storm, Streaming MapReduce), we investigate the problem of scheduling graphs
over a large cluster of servers. Each graph is a job, where nodes represent
compute tasks and edges indicate data-flows between these compute tasks. Jobs
(graphs) arrive randomly over time, and upon completion, leave the system. When
a job arrives, the scheduler needs to partition the graph and distribute it
over the servers to satisfy load balancing and cost considerations.
Specifically, neighboring compute tasks in the graph that are mapped to
different servers incur load on the network; thus a mapping of the jobs among
the servers incurs a cost that is proportional to the number of ""broken edges"".
We propose a low complexity randomized scheduling algorithm that, without
service preemptions, stabilizes the system with graph arrivals/departures; more
importantly, it allows a smooth trade-off between minimizing average
partitioning cost and average queue lengths. Interestingly, to avoid service
preemptions, our approach does not rely on a Gibbs sampler; instead, we show
that the corresponding limiting invariant measure has an interpretation
stemming from a loss system.
","[{'version': 'v1', 'created': 'Fri, 20 Feb 2015 18:45:45 GMT'}]",2015-02-23,"[['Ghaderi', 'Javad', ''], ['Shakkottai', 'Sanjay', ''], ['Srikant', 'R', '']]","['Graph Partitioning', 'Dynamic Resource Allocation', 'MarkovChains', 'Probabilistic Algorithms']"
13947,1301.6324,Togerchety Hitendra sarma,"T. Hitendra Sarma, P. Viswanath, D. Sai Koti Reddy and S. Sri Raghava",An improvement to k-nearest neighbor classifier,"Appeared in Third International Conference on Data Management, IMT
  Ghaziabad, March 11-12, 2010",,,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  K-Nearest neighbor classifier (k-NNC) is simple to use and has little design
time like finding k values in k-nearest neighbor classifier, hence these are
suitable to work with dynamically varying data-sets. There exists some
fundamental improvements over the basic k-NNC, like weighted k-nearest
neighbors classifier (where weights to nearest neighbors are given based on
linear interpolation), using artificially generated training set called
bootstrapped training set, etc. These improvements are orthogonal to space
reduction and classification time reduction techniques, hence can be coupled
with any of them. The paper proposes another improvement to the basic k-NNC
where the weights to nearest neighbors are given based on Gaussian distribution
(instead of linear interpolation as done in weighted k-NNC) which is also
independent of any space reduction and classification time reduction technique.
We formally show that our proposed method is closely related to non-parametric
density estimation using a Gaussian kernel. We experimentally demonstrate using
various standard data-sets that the proposed method is better than the existing
ones in most cases.
","[{'version': 'v1', 'created': 'Sun, 27 Jan 2013 06:55:55 GMT'}]",2013-01-29,"[['Sarma', 'T. Hitendra', ''], ['Viswanath', 'P.', ''], ['Reddy', 'D. Sai Koti', ''], ['Raghava', 'S. Sri', '']]","['Pattern Classification', 'Nearest Neighbor Classifier', 'GaussianWeights']"
13948,1605.01580,Nazia Hameed Miss,"Nazia Hameed, Maqbool ud din shaikh, Fozia Hameed",Effect of Cultural Factors on Students of Pakistan,"International Journal of Education and Information Technologies
  (Issue 4, Volume 6, 2012). Pages: 310-318 Issue 4, Volume 6, 2012",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pakistan as culturally diverse country possesses wide range of cultural
factors. These cultural factors affect the living style, traditions, values and
norms as well as the education. As e-learning is global mode of education so
learners from different backgrounds enrolled in learning management system.
Diversity of culture and learning styles should keep under considerations while
designing e-learning environment. In this research work e learning cultural
factors highlighted by Bentley ET. AL are incorporated to find the learner
level. After assignment of level, learner respective Learning Management System
is allocated to learner. The focus is to concentrate on cultural factor in
e-learning system. Furthermore; a prototype of the proposed system is
implemented for the validation of proposed architecture.
","[{'version': 'v1', 'created': 'Thu, 5 May 2016 13:17:29 GMT'}]",2016-05-06,"[['Hameed', 'Nazia', ''], ['shaikh', 'Maqbool ud din', ''], ['Hameed', 'Fozia', '']]","['Culture', 'Culture Diversity', 'E -learning', 'Online learning', 'E-learning architecture']"
13949,1310.1249,Andrzej Jarynowski,"Andrzej Jarynowski, Amir Rostami",Reading Stockholm Riots 2013 in social media by text-mining,5p,,,,cs.SI cs.CL physics.soc-ph stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The riots in Stockholm in May 2013 were an event that reverberated in the
world media for its dimension of violence that had spread through the Swedish
capital. In this study we have investigated the role of social media in
creating media phenomena via text mining and natural language processing. We
have focused on two channels of communication for our analysis: Twitter and
Poloniainfo.se (Forum of Polish community in Sweden). Our preliminary results
show some hot topics driving discussion related mostly to Swedish Police and
Swedish Politics by counting word usage. Typical features for media
intervention are presented. We have built networks of most popular phrases,
clustered by categories (geography, media institution, etc.). Sentiment
analysis shows negative connotation with Police. The aim of this preliminary
exploratory quantitative study was to generate questions and hypotheses, which
we could carefully follow by deeper more qualitative methods.
","[{'version': 'v1', 'created': 'Fri, 4 Oct 2013 13:04:45 GMT'}]",2013-10-07,"[['Jarynowski', 'Andrzej', ''], ['Rostami', 'Amir', '']]","['text-mining', 'cyberemotions', 'social networks', 'riots', 'sentiment analysis', 'language semantics']"
13950,1107.2443,Taisuke Izumi,"Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Horotaka Ono, Monika
  Steinova, Koichi Wada","On the Approximability and Hardness of Minimum Topic Connected Overlay
  and Its Special Instances",20 pages,,,,cs.DS cs.DC cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the context of designing a scalable overlay network to support
decentralized topic-based pub/sub communication, the Minimum Topic-Connected
Overlay problem (Min-TCO in short) has been investigated: Given a set of t
topics and a collection of n users together with the lists of topics they are
interested in, the aim is to connect these users to a network by a minimum
number of edges such that every graph induced by users interested in a common
topic is connected. It is known that Min-TCO is NP-hard and approximable within
O(log t) in polynomial time. In this paper, we further investigate the problem
and some of its special instances. We give various hardness results for
instances where the number of topics in which an user is interested in is
bounded by a constant, and also for the instances where the number of users
interested in a common topic is constant. For the latter case, we present a
first constant approximation algorithm. We also present some polynomial-time
algorithms for very restricted instances of Min-TCO.
","[{'version': 'v1', 'created': 'Wed, 13 Jul 2011 00:51:53 GMT'}]",2016-11-25,"[['Hosoda', 'Jun', ''], ['Hromkovic', 'Juraj', ''], ['Izumi', 'Taisuke', ''], ['Ono', 'Horotaka', ''], ['Steinova', 'Monika', ''], ['Wada', 'Koichi', '']]","['topic-connected overlay', 'approximation algorithm', 'APX', 'hardness']"
13951,1504.07862,Marek Trt\'ik,Marek Trtik,Anonymous On-line Communication Between Program Analyses,"Technical report / Specification, 50 pages",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a light-weight client-server model of communication between
existing implementations of different program analyses. The communication is
on-line and anonymous which means that all analyses simultaneously analyse the
same program and an analysis does not know what other analyses participate in
the communication. The anonymity and model's strong emphasis on independence of
analyses allow to preserve almost everything in existing implementations. An
analysis only has to add an implementation of a proposed communication
protocol, determine places in its code where information from others would
help, and then check whether there is no communication scenario, which would
corrupt its result. We demonstrate functionality and effectiveness of the
proposed communication model in a detailed case study with three analyses: two
abstract interpreters and the classic symbolic execution. Results of the
evaluation on SV-COMP benchmarks show impressive improvements in computed
invariants and increased counts of successfully analysed benchmarks.
","[{'version': 'v1', 'created': 'Wed, 29 Apr 2015 13:58:42 GMT'}]",2015-04-30,"[['Trtik', 'Marek', '']]","['Communication', 'program analysis', 'anonymous', 'online', 'Apron', 'Box', 'Polka', 'Symbolic execution']"
13952,1606.02580,Chrisantha Fernando Dr,"Chrisantha Fernando, Dylan Banarse, Malcolm Reynolds, Frederic Besse,
  David Pfau, Max Jaderberg, Marc Lanctot, Daan Wierstra",Convolution by Evolution: Differentiable Pattern Producing Networks,,,,,cs.NE cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we introduce a differentiable version of the Compositional
Pattern Producing Network, called the DPPN. Unlike a standard CPPN, the
topology of a DPPN is evolved but the weights are learned. A Lamarckian
algorithm, that combines evolution and learning, produces DPPNs to reconstruct
an image. Our main result is that DPPNs can be evolved/trained to compress the
weights of a denoising autoencoder from 157684 to roughly 200 parameters, while
achieving a reconstruction accuracy comparable to a fully connected network
with more than two orders of magnitude more parameters. The regularization
ability of the DPPN allows it to rediscover (approximate) convolutional network
architectures embedded within a fully connected architecture. Such
convolutional architectures are the current state of the art for many computer
vision applications, so it is satisfying that DPPNs are capable of discovering
this structure rather than having to build it in by design. DPPNs exhibit
better generalization when tested on the Omniglot dataset after being trained
on MNIST, than directly encoded fully connected autoencoders. DPPNs are
therefore a new framework for integrating learning and evolution.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2016 14:37:39 GMT'}]",2016-06-09,"[['Fernando', 'Chrisantha', ''], ['Banarse', 'Dylan', ''], ['Reynolds', 'Malcolm', ''], ['Besse', 'Frederic', ''], ['Pfau', 'David', ''], ['Jaderberg', 'Max', ''], ['Lanctot', 'Marc', ''], ['Wierstra', 'Daan', '']]","['CPPNs', 'Compositional Pattern Producing Networks', 'denoising autoencoder', 'MNIST']"
13953,0711.1533,Lalana Kagal,"Tim Berners-Lee, Dan Connolly, Lalana Kagal, Yosi Scharf, and Jim
  Hendler",N3Logic: A Logical Framework For the World Wide Web,To appear in Theory and Practice of Logic Programming (TPLP),,,,cs.NI,,"  The Semantic Web drives towards the use of the Web for interacting with
logically interconnected data. Through knowledge models such as Resource
Description Framework (RDF), the Semantic Web provides a unifying
representation of richly structured data. Adding logic to the Web implies the
use of rules to make inferences, choose courses of action, and answer
questions. This logic must be powerful enough to describe complex properties of
objects but not so powerful that agents can be tricked by being asked to
consider a paradox. The Web has several characteristics that can lead to
problems when existing logics are used, in particular, the inconsistencies that
inevitably arise due to the openness of the Web, where anyone can assert
anything. N3Logic is a logic that allows rules to be expressed in a Web
environment. It extends RDF with syntax for nested graphs and quantified
variables and with predicates for implication and accessing resources on the
Web, and functions including cryptographic, string, math. The main goal of
N3Logic is to be a minimal extension to the RDF data model such that the same
language can be used for logic and data. In this paper, we describe N3Logic and
illustrate through examples why it is an appropriate logic for the Web.
","[{'version': 'v1', 'created': 'Fri, 9 Nov 2007 20:41:53 GMT'}]",2007-11-12,"[['Berners-Lee', 'Tim', ''], ['Connolly', 'Dan', ''], ['Kagal', 'Lalana', ''], ['Scharf', 'Yosi', ''], ['Hendler', 'Jim', '']]","['logic', 'Web', 'Semantic Web', 'scoped negation', 'quoting', 'RDF', 'N3']"
13954,1401.0052,Janne Lindqvist,"Bernhard Firner, Shridatt Sugrim, Yulong Yang, Janne Lindqvist",Elastic Pathing: Your Speed is Enough to Track You,,,,Technical Report - Rutgers University - WINLAB - TR-429,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today people increasingly have the opportunity to opt-in to ""usage-based""
automotive insurance programs for reducing insurance premiums. In these
programs, participants install devices in their vehicles that monitor their
driving behavior, which raises some privacy concerns. Some devices collect
fine-grained speed data to monitor driving habits. Companies that use these
devices claim that their approach is privacy-preserving because speedometer
measurements do not have physical locations. However, we show that with
knowledge of the user's home location, as the insurance companies have, speed
data is sufficient to discover driving routes and destinations when trip data
is collected over a period of weeks. To demonstrate the real-world
applicability of our approach we applied our algorithm, elastic pathing, to
data collected over hundreds of driving trips occurring over several months.
With this data and our approach, we were able to predict trip destinations to
within 250 meters of ground truth in 10% of the traces and within 500 meters in
20% of the traces. This result, combined with the amount of speed data that is
being collected by insurance companies, constitutes a substantial breach of
privacy because a person's regular driving pattern can be deduced with repeated
examples of the same paths with just a few weeks of monitoring.
","[{'version': 'v1', 'created': 'Mon, 30 Dec 2013 23:11:50 GMT'}]",2014-01-03,"[['Firner', 'Bernhard', ''], ['Sugrim', 'Shridatt', ''], ['Yang', 'Yulong', ''], ['Lindqvist', 'Janne', '']]","['location privacy', 'usage-based automotive insurance', 'elasticpathing']"
13955,1802.07931,Sikun Lin,"Sikun Lin, Pan Hui",Where's YOUR focus: Personalized Attention,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human visual attention is subjective and biased according to the personal
preference of the viewer, however, current works of saliency detection are
general and objective, without counting the factor of the observer. This will
make the attention prediction for a particular person not accurate enough. In
this work, we present the novel idea of personalized attention prediction and
develop Personalized Attention Network (PANet), a convolutional network that
predicts saliency in images with personal preference. The model consists of two
streams which share common feature extraction layers, and one stream is
responsible for saliency prediction, while the other is adapted from the
detection model and used to fit user preference. We automatically collect user
preference from their albums and leaves them freedom to define what and how
many categories their preferences are divided into. To train PANet, we
dynamically generate ground truth saliency maps upon existing detection labels
and saliency labels, and the generation parameters are based upon our collected
datasets consists of 1k images. We evaluate the model with saliency prediction
metrics and test the trained model on different preference vectors. The results
have shown that our system is much better than general models in personalized
saliency prediction and is efficient to use for different preferences.
","[{'version': 'v1', 'created': 'Thu, 22 Feb 2018 07:58:18 GMT'}]",2018-02-23,"[['Lin', 'Sikun', ''], ['Hui', 'Pan', '']]","['Saliency Prediction', 'Personalized HCI', 'Deep Network']"
13956,1609.06526,Ladan Golshanara,"Ladan Golshanara, Jan Chomicki",Temporal Data Exchange,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data exchange is the problem of transforming data that is structured under a
source schema into data structured under another schema, called the target
schema, so that both the source and target data satisfy the relationship
between the schemas. Even though the formal framework of data exchange for
relational database systems is well-established, it does not immediately carry
over to the settings of temporal data, which necessitates reasoning over
unbounded periods of time. In this work, we study data exchange for temporal
data. We first motivate the need for two views of temporal data: the concrete
view, which depicts how temporal data is compactly represented and on which the
implementations are based, and the abstract view, which defines the semantics
of temporal data as a sequence of snapshots. We first extend the chase
procedure for the abstract view to have a conceptual basis for the data
exchange for temporal databases. Considering non-temporal source-to-target
tuple generating dependencies and equality generating dependencies, the chase
algorithm can be applied on each snapshot independently. Then we define a chase
procedure (called c-chase) on concrete instances and show the result of c-chase
on a concrete instance is semantically aligned with the result of chase on the
corresponding abstract instance. In order to interpret intervals as constants
while checking if a dependency or a query is satisfied by a concrete database,
we will normalize the instance with respect to the dependency or the query. To
obtain the semantic alignment, the nulls in the concrete view are annotated
with temporal information. Furthermore, we show that the result of the concrete
chase provides a foundation for query answering. We define naive evaluation on
the result of the c-chase and show it produces certain answers.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2016 12:32:06 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Feb 2019 22:13:48 GMT'}]",2019-02-18,"[['Golshanara', 'Ladan', ''], ['Chomicki', 'Jan', '']]","['Data Exchange', 'Temporal Database', 'Chase', 'Incomplete information', 'Abstract view', 'Concrete view']"
13957,1605.03045,Micha{\l} Pilipczuk,Miko{\l}aj Boja\'nczyk and Micha{\l} Pilipczuk,Definability equals recognizability for graphs of bounded treewidth,"21 pages, an extended abstract will appear in the proceedings of LICS
  2016",,,,cs.LO cs.CC cs.DM cs.DS cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove a conjecture of Courcelle, which states that a graph property is
definable in MSO with modular counting predicates on graphs of constant
treewidth if, and only if it is recognizable in the following sense:
constant-width tree decompositions of graphs satisfying the property can be
recognized by tree automata. While the forward implication is a classic fact
known as Courcelle's theorem, the converse direction remained open
","[{'version': 'v1', 'created': 'Tue, 10 May 2016 15:03:07 GMT'}]",2016-05-11,"[['Bojańczyk', 'Mikołaj', ''], ['Pilipczuk', 'Michał', '']]","['treewidth', 'tree decomposition', 'Monadic Second-OrderLogic', 'recognizability', 'Simon’s factorization forest']"
13958,1109.5531,Anatoly Plotnikov D.,Anatoly D. Plotnikov,On the relationship between classes P and NP,9 pages,"On the relationship between classes P and NP. J. Comput. Sci., 8,
  2012: p.1036-1040",,,cs.DM cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we discusses the relationship between the known classes P and
NP. We show that the difficulties in solving problem ""P versus NP"" have
methodological in nature. An algorithm for solving any problem is sensitive to
even small changes in its formulation. As we will shown in the paper, these
difficulties are exactly in the formulation of some problems of the class NP.
","[{'version': 'v1', 'created': 'Mon, 26 Sep 2011 11:57:19 GMT'}]",2016-03-03,"[['Plotnikov', 'Anatoly D.', '']]","['Class P', 'class NP', 'set-theoretic model', 'problem withoutforesight', 'NP-complete']"
13959,1610.02445,Steve Chang,Steve Chang,Instagram Post Data Analysis,,,,,cs.HC cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Because of the spread of the Internet, social platforms become big data
pools. From there we can learn about the trends, culture and hot topics. This
project focuses on analyzing the data from Instagram. It shows the relationship
of Instagram filter data with location and number of likes to give users filter
suggestion on achieving more likes based on their location. It also analyzes
the popular hashtags in different locations to show visual culture differences
between different cities.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2016 23:29:23 GMT'}]",2016-10-11,"[['Chang', 'Steve', '']]","['data visualization', 'instagram', 'filter', 'hashtag']"
13960,1306.0258,Andrew Adamatzky,Andrew Adamatzky,Slime mould tactile sensor,,,,,cs.ET nlin.AO physics.bio-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Slime mould P. polycephalum is a single cells visible by unaided eye. The
cells shows a wide spectrum of intelligent behaviour. By interpreting the
behaviour in terms of computation one can make a slime mould based computing
device. The Physarum computers are capable to solve a range of tasks of
computational geometry, optimisation and logic. Physarum computers designed so
far lack of localised inputs. Commonly used inputs --- illumination and
chemo-attractants and -repellents --- usually act on extended domains of the
slime mould's body. Aiming to design massive-parallel tactile inputs for slime
mould computers we analyse a temporal dynamic of P. polycephalum's electrical
response to tactile stimulation. In experimental laboratory studies we discover
how the Physarum responds to application and removal of a local mechanical
pressure with electrical potential impulses and changes in its electrical
potential oscillation patterns.
","[{'version': 'v1', 'created': 'Sun, 2 Jun 2013 22:38:48 GMT'}]",2013-06-04,"[['Adamatzky', 'Andrew', '']]","['slime mould', 'bionic', 'bioengineering', 'sensor']"
13961,1409.4760,Hasan Tavakoli,Hassan Tavakoli,"A Fast Convergence Density Evolution Algorithm for Optimal Rate LDPC
  Codes in BEC","This Paper is a draft of final paper which represented in 7th
  International Symposium on Telecommunications (IST'2014)",,,,cs.IT math.IT,http://creativecommons.org/licenses/by/3.0/,"  We derive a new fast convergent Density Evolution algorithm for finding
optimal rate Low-Density Parity-Check (LDPC) codes used over the binary erasure
channel (BEC). The fast convergence property comes from the modified Density
Evolution (DE), a numerical method for analyzing the behavior of iterative
decoding convergence of a LDPC code. We have used the method of [16] for
designing of a LDPC code with optimal rate. This has been done for a given
parity check node degree distribution, erasure probability and specified DE
constraint. The fast behavior of DE and found optimal rate with this method
compare with the previous DE constraint.
","[{'version': 'v1', 'created': 'Tue, 16 Sep 2014 18:13:47 GMT'}]",2014-09-18,"[['Tavakoli', 'Hassan', '']]","['component; LDPC code', 'Infinite analysis method', 'Density evolution', 'SDP', 'LP']"
13962,1106.6206,Ludo M.G.M. Tolhuizen,Ludo Tolhuizen,"A generalisation of the Gilbert-Varshamov bound and its asymptotic
  evaluation","To be presented at 3ICMCTA, the 3rd International Castle Meeting on
  Coding Theory and Applications, Sept. 11-15, 2011",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Gilbert-Varshamov (GV) lower bound on the maximum cardinality of a q-ary
code of length n with minimum Hamming distance at least d can be obtained by
application of Turan's theorem to the graph with vertex set {0,1,..,q-1}^n in
which two vertices are joined if and only if their Hamming distance is at least
d. We generalize the GV bound by applying Turan's theorem to the graph with
vertex set C^n, where C is a q-ary code of length m and two vertices are joined
if and only if their Hamming distance at least d. We asymptotically evaluate
the resulting bound for n-> \infty and d \delta mn for fixed \delta > 0, and
derive conditions on the distance distribution of C that are necessary and
sufficient for the asymptotic generalized bound to beat the asymptotic GV
bound. By invoking the Delsarte inequalities, we conclude that no improvement
on the asymptotic GV bound is obtained. By using a sharpening of Turan's
theorem due to Caro and Wei, we improve on our bound. It is undecided if there
exists a code C for which the improved bound can beat the asymptotic GV bound.
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2011 12:32:57 GMT'}]",2011-07-01,"[['Tolhuizen', 'Ludo', '']]","['Error-correcting codes', 'minimum Hamming distance', 'GilbertVarshamov bound', 'Tur´an’s theorem', 'Delsarte inequalities']"
13963,1607.01827,Albert Fannjiang,Albert Fannjiang,"Compressive Spectral Estimation with Single-Snapshot ESPRIT: Stability
  and Resolution",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper Estimation of Signal Parameters via Rotational Invariance
Techniques (ESPRIT) is developed for spectral estimation with single-snapshot
measurement. Stability and resolution analysis with performance guarantee for
Single-Snapshot ESPRIT (SS-ESPRIT) is the main focus. In the noise-free case,
exact reconstruction is guaranteed for any arbitrary set of frequencies as long
as the number of measurement data is at least twice the number of distinct
frequencies to be recovered. In the presence of noise and under the assumption
that the true frequencies are separated by at least two times Rayleigh's
Resolution Length, an explicit error bound for frequency reconstruction is
given in terms of the dynamic range and the separation of the frequencies. The
separation and sparsity constraint compares favorably with those of the leading
approaches to compressed sensing in the continuum.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2016 22:17:31 GMT'}]",2016-07-08,"[['Fannjiang', 'Albert', '']]","['ESPRIT', 'spectral estimation', 'stability', 'resolution', 'compressed sensing']"
13964,1305.1887,Gaurav Pande,Gaurav Pande,Performance Evaluation of Video Communications over 4G Network,"Accepted in ICACNI 2013. arXiv admin note: substantial text overlap
  with arXiv:1304.3758",,,,cs.MM cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With exponential increase in the volumes of video traffic in cellular
net-works, there is an increasing need for optimizing the quality of video
delivery. 4G networks (Long Term Evolution Advanced or LTE A) are being
introduced in many countries worldwide, which allow a downlink speed of upto 1
Gbps and uplink of 100 Mbps over a single base station. In this paper, we
characterize the performance of LTE A physical layer in terms of transmitted
video quality when the channel condi-tions and LTE settings are varied. We test
the performance achieved as the channel quality is changed and HARQ features
are enabled in physical layer. Blocking and blurring metrics were used to model
image quality.
","[{'version': 'v1', 'created': 'Wed, 8 May 2013 17:19:50 GMT'}]",2013-05-09,"[['Pande', 'Gaurav', '']]","['LTE-A', 'mobile video', 'quality assessment', 'Matlab', 'blocking', 'blurring']"
13965,1701.01793,Rajan Vaish,"Rajan Vaish, Andr\'es Monroy-Hern\'andez",CrowdTone: Crowd-powered tone feedback and improvement system for emails,"10 pages, 14 figures",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present CrowdTone, a system designed to help people set the
appropriate tone in their email communication. CrowdTone utilizes the context
and content of an email message to identify and set the appropriate tone
through a consensus-building process executed by crowd workers. We evaluated
CrowdTone with 22 participants, who provided a total of 29 emails that they had
received in the past, and ran them through CrowdTone. Participants and
professional writers assessed the quality of improvements finding a substantial
increase in the percentage of emails deemed ""appropriate"" or ""very appropriate""
- from 25% to more than 90% by recipients, and from 45% to 90% by professional
writers. Additionally, the recipients' feedback indicated that more than 90% of
the CrowdTone processed emails showed improvement.
","[{'version': 'v1', 'created': 'Sat, 7 Jan 2017 05:35:10 GMT'}]",2017-01-10,"[['Vaish', 'Rajan', ''], ['Monroy-Hernández', 'Andrés', '']]","['Crowdsourcing', 'Amazon Mechanical Turk', 'Toneimprovement', 'Email writing']"
13966,1701.02145,Elike Hodo Mr,"Elike Hodo, Xavier Bellekens, Andrew Hamilton, Christos Tachtatzis and
  Robert Atkinson","Shallow and Deep Networks Intrusion Detection System: A Taxonomy and
  Survey",,,,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intrusion detection has attracted a considerable interest from researchers
and industries. The community, after many years of research, still faces the
problem of building reliable and efficient IDS that are capable of handling
large quantities of data, with changing patterns in real time situations. The
work presented in this manuscript classifies intrusion detection systems (IDS).
Moreover, a taxonomy and survey of shallow and deep networks intrusion
detection systems is presented based on previous and current works. This
taxonomy and survey reviews machine learning techniques and their performance
in detecting anomalies. Feature selection which influences the effectiveness of
machine learning (ML) IDS is discussed to explain the role of feature selection
in the classification and training phase of ML IDS. Finally, a discussion of
the false and true positive alarm rates is presented to help researchers model
reliable and efficient machine learning based intrusion detection systems.
","[{'version': 'v1', 'created': 'Mon, 9 Jan 2017 11:46:58 GMT'}]",2017-01-10,"[['Hodo', 'Elike', ''], ['Bellekens', 'Xavier', ''], ['Hamilton', 'Andrew', ''], ['Tachtatzis', 'Christos', ''], ['Atkinson', 'Robert', '']]","['Shallow network', 'Deep networks', 'Intrusion detection', 'False positive']"
13967,1702.07651,Harsh Thakkar,Shubhanshu Gupta and Vaibhavi Desai and Harsh Thakkar,Social Data Analysis: A Study on Friend Rating Influence,Lighting Talk at WWC Connect India 2017,,,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Social Networking accounts for a significant chunk of interest among various
online activities~\cite{smith2009social}. The proclivity of being social,
online, has been ingrained in us so much that we are actively producing content
for the rest of the world to see or take interest in our whereabouts, our
meals, our opinions, photographs etc. Yelp (https://www.yelp.com/), seamlessly,
integrates this very aspect of people in its portal. It engages people to write
reviews about the businesses they have availed the services of, rate them, add
photographs, tags, follow other people and their activities, etc. In this paper
we examine and present the co-relation between a user's rating and the
influence of the people, that the user follows, on the user for a particular
business. The group of people that the user follows is commonly referred as
friends of the user. We also analyze if a user can get influenced, if a
business has a certain number of reviews already present or if the reviews have
been written by elite reviewers (a reviewer who, according to Yelp, has
contributed exceptionally in engaging the community in the form of consistency
in writing reviews, as well as the quality of the reviews). Our analysis,
through correlation and regression techniques, is able to prove that the user's
rating remains unaffected by the number of people a user was friends with nor
does the existing number of reviews and presence of elite reviewers helps in
influencing a user. What shapes a user's rating is the overall experience, that
the user had at the restaurant.
","[{'version': 'v1', 'created': 'Fri, 24 Feb 2017 16:32:37 GMT'}]",2017-02-27,"[['Gupta', 'Shubhanshu', ''], ['Desai', 'Vaibhavi', ''], ['Thakkar', 'Harsh', '']]","['Yelp data analysis', 'social network analysis', 'regression', 'visualization', 'correlation']"
13968,1205.5373,Gang Liao,"Gang Liao, Lei Liu, Lian Luo",An Adaptive XP-based approach to Agile Development,"15 pages,6 figures",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software design is gradually becoming open, distributed, pervasive, and
connected. It is a sad statistical fact that software projects are
scientifically fragile and tend to fail more than other engineering fields.
Agile development is a philosophy. And agile methods are processes that support
the agile philosophy. XP places a strong emphasis on technical practices in
addition to the more common teamwork and structural practices. In this paper,
we elaborate how XP practices can be used to thinking, collaborating,
releasing, planning, developing. And the state that make your team and
organization more successful.
","[{'version': 'v1', 'created': 'Thu, 24 May 2012 08:55:38 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Jul 2012 10:57:04 GMT'}]",2012-07-24,"[['Liao', 'Gang', ''], ['Liu', 'Lei', ''], ['Luo', 'Lian', '']]","['agile method', 'Extreme programming', 'software engineering']"
13969,1306.2599,Joyeeta Singha,Joyeeta Singha and Karen Das,Hand Gesture Recognition Based on Karhunen-Loeve Transform,"7 pages,9 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we have proposed a system based on K-L Transform to recognize
different hand gestures. The system consists of five steps: skin filtering,
palm cropping, edge detection, feature extraction, and classification. Firstly
the hand is detected using skin filtering and palm cropping was performed to
extract out only the palm portion of the hand. The extracted image was then
processed using the Canny Edge Detection technique to extract the outline
images of palm. After palm extraction, the features of hand were extracted
using K-L Transform technique and finally the input gesture was recognized
using proper classifier. In our system, we have tested for 10 different hand
gestures, and recognizing rate obtained was 96%. Hence we propose an easy
approach to recognize different hand gestures.
","[{'version': 'v1', 'created': 'Tue, 11 Jun 2013 18:03:06 GMT'}]",2013-06-12,"[['Singha', 'Joyeeta', ''], ['Das', 'Karen', '']]","['Hand Gesture Recognition', 'Karhunen-Loeve (K-L) Transform', 'Skin Filtering', 'Canny Edge Detection', 'Image Segmentation', 'Human Computer Interaction']"
13970,1108.5428,Kishore Angrishi,"Kishore Angrishi, Ulrich Killat","Probabilistic Performance Analysis of Networks using an Improved Network
  Service Envelope Approach",20 Pages,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stochastic network calculus is an evolving theory which accounts for
statistical multiplexing and uses an envelope approach for probabilistic delay
and backlog analysis of networks. One of the key ideas of stochastic network
calculus is the possibility to describe service offered at network node as a
stochastic service envelope, which in turn can be used to describe the
stochastic service available in a network of nodes and determine end-to-end
probabilistic delay and backlog bounds. This paper introduces a new definition
of stochastic service envelopes which yield a simple network service envelope
and tighter end-to-end performance bounds. It is shown for ($\sigma(\theta),
\rho(\theta)$) - constrained traffic model that the end-to-end performance
measures computed using the new stochastic network service envelope are tight
in comparison to the ones obtained using the existing start-of-the-art
definition of statistical network service envelope and are bounded by ${\cal
O}(H \log{H})$, where $H$ is the number of nodes traversed by the arrival
traffic.
","[{'version': 'v1', 'created': 'Sat, 27 Aug 2011 08:25:27 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Sep 2011 08:46:54 GMT'}, {'version': 'v3', 'created': 'Tue, 20 Sep 2011 09:43:41 GMT'}, {'version': 'v4', 'created': 'Wed, 28 Sep 2011 12:46:04 GMT'}, {'version': 'v5', 'created': 'Thu, 29 Sep 2011 15:52:30 GMT'}]",2011-09-30,"[['Angrishi', 'Kishore', ''], ['Killat', 'Ulrich', '']]","['Stochastic Network Calculus', 'Network Service Envelope', 'Quality of Service']"
13971,1105.0974,Seyed Salim Tabatabaei,Seyed Salim Tabatabaei and Mark Coates and Michael Rabbat,GANC: Greedy Agglomerative Normalized Cut,"Submitted to Pattern Recognition. 27 pages, 5 figures",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a graph clustering algorithm that aims to minimize the
normalized cut criterion and has a model order selection procedure. The
performance of the proposed algorithm is comparable to spectral approaches in
terms of minimizing normalized cut. However, unlike spectral approaches, the
proposed algorithm scales to graphs with millions of nodes and edges. The
algorithm consists of three components that are processed sequentially: a
greedy agglomerative hierarchical clustering procedure, model order selection,
and a local refinement.
  For a graph of n nodes and O(n) edges, the computational complexity of the
algorithm is O(n log^2 n), a major improvement over the O(n^3) complexity of
spectral methods. Experiments are performed on real and synthetic networks to
demonstrate the scalability of the proposed approach, the effectiveness of the
model order selection procedure, and the performance of the proposed algorithm
in terms of minimizing the normalized cut metric.
","[{'version': 'v1', 'created': 'Thu, 5 May 2011 04:55:53 GMT'}]",2011-05-06,"[['Tabatabaei', 'Seyed Salim', ''], ['Coates', 'Mark', ''], ['Rabbat', 'Michael', '']]","['Graph Clustering', 'Normalized Cut', 'Model Order Selection', 'Large Scale']"
13972,1307.1895,Arindam Chaudhuri AC,"Arindam Chaudhuri, Kajal De, Dipak Chatterjee","Discovering Stock Price Prediction Rules of Bombay Stock Exchange Using
  Rough Fuzzy Multi Layer Perception Networks","Book Chapter: Forecasting Financial Markets in India, Rudra P.
  Pradhan, Indian Institute of Technology Kharagpur, (Editor), Allied
  Publishers, India, 2009",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In India financial markets have existed for many years. A functionally
accented, diverse, efficient and flexible financial system is vital to the
national objective of creating a market driven, productive and competitive
economy. Today markets of varying maturity exist in equity, debt, commodities
and foreign exchange. In this work we attempt to generate prediction rules
scheme for stock price movement at Bombay Stock Exchange using an important
Soft Computing paradigm viz., Rough Fuzzy Multi Layer Perception. The use of
Computational Intelligence Systems such as Neural Networks, Fuzzy Sets, Genetic
Algorithms, etc. for Stock Market Predictions has been widely established. The
process is to extract knowledge in the form of rules from daily stock
movements. These rules can then be used to guide investors. To increase the
efficiency of the prediction process, Rough Sets is used to discretize the
data. The methodology uses a Genetic Algorithm to obtain a structured network
suitable for both classification and rule extraction. The modular concept,
based on divide and conquer strategy, provides accelerated training and a
compact network suitable for generating a minimum number of rules with high
certainty values. The concept of variable mutation operator is introduced for
preserving the localized structure of the constituting Knowledge Based
sub-networks, while they are integrated and evolved. Rough Set Dependency Rules
are generated directly from the real valued attribute table containing Fuzzy
membership values. The paradigm is thus used to develop a rule extraction
algorithm. The extracted rules are compared with some of the related rule
extraction techniques on the basis of some quantitative performance indices.
The proposed methodology extracts rules which are less in number, are accurate,
have high certainty factor and have low confusion with less computation time.
","[{'version': 'v1', 'created': 'Sun, 7 Jul 2013 18:47:19 GMT'}]",2013-07-09,"[['Chaudhuri', 'Arindam', ''], ['De', 'Kajal', ''], ['Chatterjee', 'Dipak', '']]","['Financial Markets', 'Rough Fuzzy Multi Layer Perception', 'prediction', 'Bombay Stock Exchange']"
13973,1406.3466,Helena Astola Ms,"Helena Astola, Ioan Tabus",On the Linear Programming Bound for Lee-codes,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finding the largest code with a given minimum distance is one of the most
basic problems in coding theory. In this paper, we study the linear programming
bound for codes in the Lee metric. We introduce refinements on the linear
programming bound for linear codes in the Lee metric, which give a tighter
bound for linear codes. We also discuss the computational aspects of the
problem and introduce a more compact program by the obtained refinements, and a
recursive method for computing the so-called Lee-numbers, which are important
in the computation of the linear programming bound.
","[{'version': 'v1', 'created': 'Fri, 13 Jun 2014 09:54:08 GMT'}]",2014-06-16,"[['Astola', 'Helena', ''], ['Tabus', 'Ioan', '']]","['Lee-codes', 'association schemes', 'linear programming bound', 'linear codes']"
13974,1212.6510,Bilel Derbel,"Houda Derbel, Bilel Derbel (LIFL, INRIA Lille - Nord Europe)",On Neighborhood Tree Search,Genetic and Evolutionary Computation Conference (GECCO'12) (2012),,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the neighborhood tree induced by alternating the use of different
neighborhood structures within a local search descent. We investigate the issue
of designing a search strategy operating at the neighborhood tree level by
exploring different paths of the tree in a heuristic way. We show that allowing
the search to 'backtrack' to a previously visited solution and resuming the
iterative variable neighborhood descent by 'pruning' the already explored
neighborhood branches leads to the design of effective and efficient search
heuristics. We describe this idea by discussing its basic design components
within a generic algorithmic scheme and we propose some simple and intuitive
strategies to guide the search when traversing the neighborhood tree. We
conduct a thorough experimental analysis of this approach by considering two
different problem domains, namely, the Total Weighted Tardiness Problem
(SMTWTP), and the more sophisticated Location Routing Problem (LRP). We show
that independently of the considered domain, the approach is highly
competitive. In particular, we show that using different branching and
backtracking strategies when exploring the neighborhood tree allows us to
achieve different trade-offs in terms of solution quality and computing cost.
","[{'version': 'v1', 'created': 'Fri, 28 Dec 2012 12:31:19 GMT'}]",2013-01-01,"[['Derbel', 'Houda', '', 'LIFL, INRIA Lille - Nord Europe'], ['Derbel', 'Bilel', '', 'LIFL, INRIA Lille - Nord Europe']]","['Metaheuristics', 'neighborhood combination', 'VND', 'VNS']"
13975,1607.01119,Ahmed Hamdi Sakr,"Ahmed Hamdi Sakr, Ekram Hossain",On User Association in Multi-Tier Full-Duplex Cellular Networks,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the user association problem in multi-tier in-band full-duplex
(FD) networks. Specifically, we consider the case of decoupled user association
(DUA) in which users (UEs) are not necessarily served by the same base station
(BS) for uplink (UL) and downlink (DL) transmissions. Instead, UEs can
simultaneously associate to different BSs based on two independent weighted
path-loss user association criteria for UL and DL. We use stochastic geometry
to develop a comprehensive modeling framework for the proposed system model
where BSs and UEs are spatially distributed according to independent point
processes. We derive closed-form expressions for the mean rate utility in FD,
half-duplex (HD) DL, and HD UL networks as well as the mean rate utility of
legacy nodes with only HD capabilities in a multi-tier FD network. We formulate
and solve an optimization problem that aims at maximizing the mean rate utility
of the FD network by optimizing the DL and UL user association criteria. We
investigate the effects of different network parameters including the spatial
density of BSs and power control parameter. We also investigate the effect of
imperfect self-interference cancellation (SIC) and show that it is more severe
at UL, where there exist minimum required SIC capabilities for BSs and UEs for
which FD networks are preferable to HD networks; otherwise, HD networks are
preferable. In addition, we discuss several special cases and provide
guidelines on the possible extensions of the proposed framework. We conclude
that DUA outperforms coupled user association (CUA) in which UEs associate to
the same BS for both UL and DL transmissions.
","[{'version': 'v1', 'created': 'Tue, 5 Jul 2016 05:46:42 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Dec 2016 22:38:08 GMT'}, {'version': 'v3', 'created': 'Mon, 8 May 2017 20:37:39 GMT'}, {'version': 'v4', 'created': 'Tue, 13 Jun 2017 01:31:22 GMT'}]",2017-06-14,"[['Sakr', 'Ahmed Hamdi', ''], ['Hossain', 'Ekram', '']]","['Multi-tier cellular networks', 'in-band full-duplex (FD)', 'decoupled user association']"
13976,1609.01380,Hang Yang,"Hang Yang, Zhongbo Zhang and Yujing Guan","An Adaptive Parameter Estimation for Guided Filter based Image
  Deconvolution","10 pages, 8 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image deconvolution is still to be a challenging ill-posed problem for
recovering a clear image from a given blurry image, when the point spread
function is known. Although competitive deconvolution methods are numerically
impressive and approach theoretical limits, they are becoming more complex,
making analysis, and implementation difficult. Furthermore, accurate estimation
of the regularization parameter is not easy for successfully solving image
deconvolution problems. In this paper, we develop an effective approach for
image restoration based on one explicit image filter - guided filter. By
applying the decouple of denoising and deblurring techniques to the
deconvolution model, we reduce the optimization complexity and achieve a simple
but effective algorithm to automatically compute the parameter in each
iteration, which is based on Morozov's discrepancy principle. Experimental
results demonstrate that the proposed algorithm outperforms many
state-of-the-art deconvolution methods in terms of both ISNR and visual
quality.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2016 03:43:32 GMT'}]",2016-09-07,"[['Yang', 'Hang', ''], ['Zhang', 'Zhongbo', ''], ['Guan', 'Yujing', '']]","['Image deconvolution', 'guided filter', 'edge-preserving', 'adaptive parameter estimation']"
13977,1107.1847,Prashant Kushwah,Prashant Kushwah and Sunder Lal,Efficient Identity Based Public Verifiable Signcryption Scheme,11 pages,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Signcryption is a cryptographic primitive which performs encryption and
signature in a single logical step. In conventional signcryption only receiver
of the signcrypted text can verify the authenticity of the origin i.e.
signature of the sender on the message after decrypting the cipher text. In
public verifiable signcryption scheme anyone can verify the authenticity of the
origin who can access the signcrypted text i.e. signature of the sender on the
cipher text. Public verifiable signcryption scheme in which the receiver can
convince a third party, by providing additional information other than his
private key along with the signcryption is called third party verifiable
signcryption schemes. In this paper we proposed an efficient identity based
public verifiable signcryption scheme with third party verification and proved
its security in the random oracle model.
","[{'version': 'v1', 'created': 'Sun, 10 Jul 2011 09:43:26 GMT'}]",2011-07-12,"[['Kushwah', 'Prashant', ''], ['Lal', 'Sunder', '']]","['signcryption', 'public verifiable signcryption', 'identity based cryptography', 'provable security']"
13978,1710.02365,Pavel Kral,"Pavel Kr\'al, Ladislav Lenc",Czech Text Document Corpus v 2.0,Accepted for LREC 2018,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces ""Czech Text Document Corpus v 2.0"", a collection of
text documents for automatic document classification in Czech language. It is
composed of the text documents provided by the Czech News Agency and is freely
available for research purposes at http://ctdc.kiv.zcu.cz/. This corpus was
created in order to facilitate a straightforward comparison of the document
classification approaches on Czech data. It is particularly dedicated to
evaluation of multi-label document classification approaches, because one
document is usually labelled with more than one label. Besides the information
about the document classes, the corpus is also annotated at the morphological
layer. This paper further shows the results of selected state-of-the-art
methods on this corpus to offer the possibility of an easy comparison with
these approaches.
","[{'version': 'v1', 'created': 'Fri, 6 Oct 2017 12:22:44 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Jan 2018 21:29:21 GMT'}]",2018-02-01,"[['Král', 'Pavel', ''], ['Lenc', 'Ladislav', '']]","['corpus', 'Czech', 'document classification', 'multi-label', 'text']"
13979,1510.02519,Bilal Sadiq,"Bilal Sadiq, Saurabh Tavildar, Junyi Li",Inband device-to-device relays in cellular networks,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new design for two-hop opportunistic relaying in cellular networks is
proposed, with the objective of throughput improvement. We propose using idle
UEs in a cellular system with better channel to the base station to relay
traffic for active UEs. One of the key ideas proposed is the use of (only)
uplink spectrum for the Access links, and corresponding interference management
schemes for managing interference between Access and Backhaul links. The
proposed algorithms and architecture show a median throughput gain of 110% for
downlink and 40% for uplink in system simulations performed according to the
3GPP methodology.
","[{'version': 'v1', 'created': 'Thu, 8 Oct 2015 21:55:37 GMT'}]",2015-10-12,"[['Sadiq', 'Bilal', ''], ['Tavildar', 'Saurabh', ''], ['Li', 'Junyi', '']]","['Device to device communication', 'cellular relay', 'relay interference management']"
13980,1407.6104,Andrew Connor,"Andy M. Connor, Jacqui Finlay, Russel Pears",Mining developer communication data streams,,"Proceedings of the Fourth International Conference on Computer
  Science and Information Technology (CCSIT 2014)",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper explores the concepts of modelling a software development project
as a process that results in the creation of a continuous stream of data. In
terms of the Jazz repository used in this research, one aspect of that stream
of data would be developer communication. Such data can be used to create an
evolving social network characterized by a range of metrics. This paper
presents the application of data stream mining techniques to identify the most
useful metrics for predicting build outcomes. Results are presented from
applying the Hoeffding Tree classification method used in conjunction with the
Adaptive Sliding Window (ADWIN) method for detecting concept drift. The results
indicate that only a small number of the available metrics considered have any
significance for predicting the outcome of a build.
","[{'version': 'v1', 'created': 'Wed, 23 Jul 2014 03:53:21 GMT'}]",2014-07-24,"[['Connor', 'Andy M.', ''], ['Finlay', 'Jacqui', ''], ['Pears', 'Russel', '']]","['Data Mining', 'Data Stream Mining', 'Hoeffding Tree', 'Adaptive Sliding Window', 'Jazz']"
13981,1407.7136,Prof. Dr. Vladimir Rybakov Mr,Alexandra Lukyanchuk and Vladimir Rybakov,"Linear Intransitive Temporal Logic of Knowledge LTK_r, Decision
  Algorithms, Inference Rules",,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our paper investigates the linear logic of knowledge and time LTK_r with
reflexive intransitive time relation. The logic is defined semantically, -- as
the set of formulas which are true at special frames with intransitive and
reflexive time binary relation. The LTK_r -frames are linear chains of clusters
connected by a reflexive intransitive relation $R_T$. Elements inside a cluster
are connected by several equivalence relations imitating the knowledge of
different agents. We study the decidability problem for formulas and inference
rules. Decidability for formulas follows from decidability w.r.t. admissible
inference rules.To study admissibility, we introduce some special constructive
Kripke models useful for description of admissibility of inference rules. With
a special technique of definable valuations we find an algorithm determining
admissible inference rules in LTK_r. That is, we show that the logic LTK_r is
decidable and decidable with respect to admissibility of inference rules.
","[{'version': 'v1', 'created': 'Sat, 26 Jul 2014 14:50:16 GMT'}]",2014-07-29,"[['Lukyanchuk', 'Alexandra', ''], ['Rybakov', 'Vladimir', '']]","['Multi-modal logic', 'Temporal logic', 'Epistemic logic', 'DecisionAlgorithms', 'n-characterizing models', 'Admissible rules']"
13982,1506.02776,Sumith Yd,Sumith YD,Fast Geometric Fit Algorithm for Sphere Using Exact Solution,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sphere fitting is a common problem in almost all science and engineering
disciplines. Most of methods available are iterative in behavior. This involves
fitting of the parameters in a least square sense or in a geometric sense. Here
we extend the methods of Thomas Chan and Landau who fitted the 2D data using
circle. This work closely resemble their work in redefining the error estimate
and solving the sphere fitting problem exactly. The solutions for center and
radius of the sphere can be found exactly and the equations can be hard coded
for high performance. We have also shown some comparison with other popular
methods and how this method behaves.
","[{'version': 'v1', 'created': 'Tue, 9 Jun 2015 05:03:47 GMT'}]",2015-06-10,"[['YD', 'Sumith', '']]","['Sphere fit', 'Geometric fit', 'Non iterative fits']"
13983,1610.01052,Md Momin Al Aziz,"Rezaul Karim, Md. Momin Al Aziz, Swakkhar Shatabda, M. Sohel Rahman","A novel and effective scoring scheme for structure classification and
  pairwise similarity measurement",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Protein tertiary structure defines its functions, classification and binding
sites. Similar structural characteristics between two proteins often lead to
the similar characteristics thereof. Determining structural similarity
accurately in real time is a crucial research issue. In this paper, we present
a novel and effective scoring scheme that is dependent on novel features
extracted from protein alpha carbon distance matrices. Our scoring scheme is
inspired from pattern recognition and computer vision. Our method is
significantly better than the current state of the art methods in terms of
family match of pairs of protein structures and other statistical measurements.
The effectiveness of our method is tested on standard benchmark structures. A
web service is available at http://research.buet.ac.bd:8080/Comograd/score.html
where you can get the similarity measurement score between two protein
structures based on our method.
","[{'version': 'v1', 'created': 'Tue, 4 Oct 2016 15:47:45 GMT'}]",2016-10-05,"[['Karim', 'Rezaul', ''], ['Aziz', 'Md. Momin Al', ''], ['Shatabda', 'Swakkhar', ''], ['Rahman', 'M. Sohel', '']]","['Pairwiseproteinstructurecomparison', 'scoringfunction', 'structural similarity']"
13984,1410.4095,Ana  Salagean,"Ana S\u{a}l\u{a}gean, Matei Mandache-S\u{a}l\u{a}gean, Richard Winter,
  Raphael C.-W. Phan","Higher Order Differentiation over Finite Fields with Applications to
  Generalising the Cube Attack",submitted to a journal,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Higher order differentiation was introduced in a cryptographic context by
Lai. Several attacks can be viewed in the context of higher order
differentiations, amongst them the cube attack and the AIDA attack. All of the
above have been developed for the binary case.
  We examine differentiation in larger fields, starting with the field $GF(p)$
of integers modulo a prime $p$. We prove a number of results on differentiating
polynomials over such fields and then apply these techniques to generalising
the cube attack to $GF(p)$. The crucial difference is that now the degree in
each variable can be higher than one, and our proposed attack will
differentiate several times with respect to each variable (unlike the classical
cube attack and its larger field version described by Dinur and Shamir, both of
which differentiate at most once with respect to each variable).
  Finally we describe differentiation over finite fields $GF(p^m)$ with $p^m$
elements and prove that it can be reduced to differentiation over $GF(p)$, so a
cube attack over $GF(p^m)$ would be equivalent to cube attacks over $GF(p)$.
","[{'version': 'v1', 'created': 'Wed, 15 Oct 2014 15:13:08 GMT'}]",2014-10-16,"[['Sălăgean', 'Ana', ''], ['Mandache-Sălăgean', 'Matei', ''], ['Winter', 'Richard', ''], ['Phan', 'Raphael C. -W.', '']]","['Higher order differentiation', 'cube attack', 'higher order derivative']"
13985,1208.1679,Ou Wu,Ou Wu,Color Assessment and Transfer for Web Pages,10pages,,,,cs.HC cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Colors play a particularly important role in both designing and accessing Web
pages. A well-designed color scheme improves Web pages' visual aesthetic and
facilitates user interactions. As far as we know, existing color assessment
studies focus on images; studies on color assessment and editing for Web pages
are rare. This paper investigates color assessment for Web pages based on
existing online color theme-rating data sets and applies this assessment to Web
color edit. This study consists of three parts. First, we study the extraction
of a Web page's color theme. Second, we construct color assessment models that
score the color compatibility of a Web page by leveraging machine learning
techniques. Third, we incorporate the learned color assessment model into a new
application, namely, color transfer for Web pages. Our study combines
techniques from computer graphics, Web mining, computer vision, and machine
learning. Experimental results suggest that our constructed color assessment
models are effective, and useful in the color transfer for Web pages, which has
received little attention in both Web mining and computer graphics communities.
","[{'version': 'v1', 'created': 'Tue, 7 Aug 2012 02:24:36 GMT'}]",2012-08-16,"[['Wu', 'Ou', '']]","['Color assessment', 'Color transfer', 'Web mining', 'Transfer learning']"
13986,1610.01287,Bikash Kumar Dey,"Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg",Sufficiently Myopic Adversaries are Blind,18 pages,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we consider a communication problem in which a sender, Alice,
wishes to communicate with a receiver, Bob, over a channel controlled by an
adversarial jammer, James, who is {\em myopic}. Roughly speaking, for
blocklength $n$, the codeword $X^n$ transmitted by Alice is corrupted by James
who must base his adversarial decisions (of which locations of $X^n$ to corrupt
and how to corrupt them) not on the codeword $X^n$ but on $Z^n$, an image of
$X^n$ through a noisy memoryless channel. More specifically, our communication
model may be described by two channels. A memoryless channel $p(z|x)$ from
Alice to James, and an {\it Arbitrarily Varying Channel} from Alice to Bob,
$p(y|x,s)$ governed by a state $X^n$ determined by James. In standard
adversarial channels the states $S^n$ may depend on the codeword $X^n$, but in
our setting $S^n$ depends only on James's view $Z^n$.
  The myopic channel captures a broad range of channels and bridges between the
standard models of memoryless and adversarial (zero-error) channels. In this
work we present upper and lower bounds on the capacity of myopic channels. For
a number of special cases of interest we show that our bounds are tight. We
extend our results to the setting of {\em secure} communication in which we
require that the transmitted message remain secret from James. For example, we
show that if (i) James may flip at most a $p$ fraction of the bits communicated
between Alice and Bob, and (ii) James views $X^n$ through a binary symmetric
channel with parameter $q$, then once James is ""sufficiently myopic"" (in this
case, when $q>p$), then the optimal communication rate is that of an adversary
who is ""blind"" (that is, an adversary that does not see $X^n$ at all), which is
$1-H(p)$ for standard communication, and $H(q)-H(p)$ for secure communication.
A similar phenomenon exists for our general model of communication.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2016 07:08:14 GMT'}]",2016-10-06,"[['Dey', 'Bikash Kumar', ''], ['Jaggi', 'Sidharth', ''], ['Langberg', 'Michael', '']]","['Arbitrarily Varying Channels', 'Myopic Jamming', 'Information Theoretic Secrecy']"
13987,1406.2795,Adrian Kosowski,"Shantanu Das (LIF), Dariusz Dereniowski, Adrian Kosowski (INRIA
  Rocquencourt, LIAFA), Przemyslaw Uznanski (LIF)",Rendezvous of Distance-aware Mobile Agents in Unknown Graphs,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of rendezvous of two mobile agents starting at distinct
locations in an unknown graph. The agents have distinct labels and walk in
synchronous steps. However the graph is unlabelled and the agents have no means
of marking the nodes of the graph and cannot communicate with or see each other
until they meet at a node. When the graph is very large we want the time to
rendezvous to be independent of the graph size and to depend only on the
initial distance between the agents and some local parameters such as the
degree of the vertices, and the size of the agent's label. It is well known
that even for simple graphs of degree $\Delta$, the rendezvous time can be
exponential in $\Delta$ in the worst case. In this paper, we introduce a new
version of the rendezvous problem where the agents are equipped with a device
that measures its distance to the other agent after every step. We show that
these \emph{distance-aware} agents are able to rendezvous in any unknown graph,
in time polynomial in all the local parameters such the degree of the nodes,
the initial distance $D$ and the size of the smaller of the two agent labels $l
= \min(l_1, l_2)$. Our algorithm has a time complexity of
$O(\Delta(D+\log{l}))$ and we show an almost matching lower bound of
$\Omega(\Delta(D+\log{l}/\log{\Delta}))$ on the time complexity of any
rendezvous algorithm in our scenario. Further, this lower bound extends
existing lower bounds for the general rendezvous problem without distance
awareness.
","[{'version': 'v1', 'created': 'Wed, 11 Jun 2014 07:01:42 GMT'}]",2014-06-12,"[['Das', 'Shantanu', '', 'LIF'], ['Dereniowski', 'Dariusz', '', 'INRIA\n  Rocquencourt, LIAFA'], ['Kosowski', 'Adrian', '', 'INRIA\n  Rocquencourt, LIAFA'], ['Uznanski', 'Przemyslaw', '', 'LIF']]","['Mobile Agent', 'Rendezvous', 'Synchronous', 'Anonymous Networks', 'Distance Oracle', 'Lower Bounds']"
13988,1106.0216,Alexander Gamkrelidze,Alexander Gamkrelidze,Algorithms for Low-Dimensional Topology,"17 pages, 21 figures. arXiv admin note: text overlap with
  arXiv:math/9810026, arXiv:math/0501040 by other authors",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, we re-introduce the so called ""Arkaden-Faden-Lage"" (AFL for
short) representation of knots in 3 dimensional space introduced by Kurt
Reidemeister and show how it can be used to develop efficient algorithms to
compute some important topological knot structures. In particular, we introduce
an efficient algorithm to calculate holonomic representation of knots
introduced by V. Vassiliev and give the main ideas how to use the AFL
representations of knots to compute the Kontsevich Integral.
  The methods introduced here are to our knowledge novel and can open new
perspectives in the development of fast algorithms in low dimensional topology.
","[{'version': 'v1', 'created': 'Wed, 1 Jun 2011 16:03:04 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Jul 2012 22:18:05 GMT'}]",2012-07-13,"[['Gamkrelidze', 'Alexander', '']]","['knots', 'AFL representation of knots', 'knot invariants', 'holonomic representation of knots', 'kontsevich integral', 'efficient algorithms']"
13989,1701.01996,Hamid Shahdoosti,Hamid Reza Shahdoosti,MS and PAN image fusion by combining Brovey and wavelet methods,"9 pages; 2 figures, conference",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Among the existing fusion algorithms, the wavelet fusion method is the most
frequently discussed one in recent publications because the wavelet approach
preserves the spectral characteristics of the multispectral image better than
other methods. The Brovey is also a popular fusion method used for its ability
in preserving the spatial information of the PAN image. This study presents a
new fusion approach that integrates the advantages of both the Brovey (which
preserves a high degree of spatial information) and the wavelet (which
preserves a high degree of spectral information) techniques to reduce the
colour distortion of fusion results. Visual and statistical analyzes show that
the proposed algorithm clearly improves the merging quality in terms of:
correlation coefficient and UIQI; compared to fusion methods including, IHS,
Brovey, PCA , HPF, discrete wavelet transform (DWT), and a-trous wavelet.
","[{'version': 'v1', 'created': 'Sun, 8 Jan 2017 18:39:04 GMT'}]",2017-01-10,"[['Shahdoosti', 'Hamid Reza', '']]","['Image fusion', 'Brovey Transform', 'multispectral image', 'wavelet']"
13990,1106.4907,H.R.  Chennamma,H. R. Chennamma and Lalitha Rangarajan and Veerabhadrappa,Face Identification from Manipulated Facial Images using SIFT,"4 pages, 4 figures, IEEE 3rd International Conference on Emerging
  Trends in Engineering & Technology (ICETET'2010), Nov 19-21, 2010, Goa, India",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Editing on digital images is ubiquitous. Identification of deliberately
modified facial images is a new challenge for face identification system. In
this paper, we address the problem of identification of a face or person from
heavily altered facial images. In this face identification problem, the input
to the system is a manipulated or transformed face image and the system reports
back the determined identity from a database of known individuals. Such a
system can be useful in mugshot identification in which mugshot database
contains two views (frontal and profile) of each criminal. We considered only
frontal view from the available database for face identification and the query
image is a manipulated face generated by face transformation software tool
available online. We propose SIFT features for efficient face identification in
this scenario. Further comparative analysis has been given with well known
eigenface approach. Experiments have been conducted with real case images to
evaluate the performance of both methods.
","[{'version': 'v1', 'created': 'Fri, 24 Jun 2011 08:30:15 GMT'}]",2011-06-27,"[['Chennamma', 'H. R.', ''], ['Rangarajan', 'Lalitha', ''], ['Veerabhadrappa', '', '']]","['Mugshots', 'Image Tampering', 'SIFT', 'PCA']"
13991,1702.05578,Qiang Yin,"Qiang Yin, Mingzhang Huang, and Chaodong He",Two Lower Bounds for BPA,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Branching bisimilarity on normed Basic Process Algebra (BPA) was claimed to
be EXPTIME-hard in previous papers without any explicit proof. Recently it is
reminded by Jan\v{c}ar that the claim is not so dependable. In this paper, we
develop a new complete proof for EXPTIME-hardness of branching bisimilarity on
normed BPA. We also prove the associate regularity problem on normed BPA is
PSPACE-hard and in EXPTIME. This improves previous P-hard and NEXPTIME result.
","[{'version': 'v1', 'created': 'Sat, 18 Feb 2017 06:53:15 GMT'}]",2017-02-21,"[['Yin', 'Qiang', ''], ['Huang', 'Mingzhang', ''], ['He', 'Chaodong', '']]","['BPA', 'branching bisimulation', 'weak bisimulation', 'regularity']"
13992,0805.0925,EDA Publishing Association,"El Mehdi Boujamaa (LIRMM), Yannick Soulie (LIRMM), Fr\'ed\'erick
  Mailly (LIRMM), Laurent Latorre (LIRMM), Pascal Nouet (LIRMM)","Rejection of Power Supply Noise in Wheatstone Bridges : Application to
  Piezoresistive MEMS","Submitted on behalf of EDA Publishing Association
  (http://irevues.inist.fr/handle/2042/16838)","Dans Symposium on Design, Test, Integration and Packaging of
  MEMS/MOEMS - DTIP 2008, Nice : France (2008)",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with the design of MEMS using piezoresistivity as
transduction principle. It is demonstrated that when the sensor topology
doesn't allow a perfect matching of strain gauges, the resolution is limited by
the ability of the conditioning circuit (typically a Wheatstone bridge) to
reject power supply noise. As this ability is strongly reduced when an offset
voltage is present at the output of the bridge, the proposed architecture
implements a feedback loop to control MOS transistors inserted in the
Wheatstone bridge to compensate resistor mismatches. This feedback exhibits a
very good offset cancellation and therefore a better resolution is achieved.
","[{'version': 'v1', 'created': 'Wed, 7 May 2008 09:41:20 GMT'}]",2008-12-18,"[['Boujamaa', 'El Mehdi', '', 'LIRMM'], ['Soulie', 'Yannick', '', 'LIRMM'], ['Mailly', 'Frédérick', '', 'LIRMM'], ['Latorre', 'Laurent', '', 'LIRMM'], ['Nouet', 'Pascal', '', 'LIRMM']]","['MEMS', 'conditioning electronics', 'noise optimisation']"
13993,1610.05566,Amol Patwardhan,Amol Patwardhan,Edge Based Grid Super-Imposition for Crowd Emotion Recognition,"6 pages, 6 figure, 1 table, emotion, crowd, group, spontaneous,
  indoor, edge, grid, mesh, tracking, temporal feature",,,,cs.CV cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Numerous automatic continuous emotion detection system studies have examined
mostly use of videos and images containing individual person expressing
emotions. This study examines the detection of spontaneous emotions in a group
and crowd settings. Edge detection was used with a grid of lines
superimposition to extract the features. The feature movement in terms of
movement from the reference point was used to track across sequences of images
from the color channel. Additionally the video data capturing was done on
spontaneous emotions invoked by watching sports events from group of
participants. The method was view and occlusion independent and the results
were not affected by presence of multiple people chaotically expressing various
emotions. The edge thresholds of 0.2 and grid thresholds of 20 showed the best
accuracy results. The overall accuracy of the group emotion classifier was
70.9%.
","[{'version': 'v1', 'created': 'Sun, 7 Aug 2016 17:00:17 GMT'}]",2016-10-19,"[['Patwardhan', 'Amol', '']]","['Group emotion', 'crowd emotion', 'SVM', 'edge detection', 'spontaneous emotion recognition']"
13994,1606.03978,Jakub Jura,"Jakub Jura, Jan Chysky, Lukas Novak",Optimisation Of Pressure Sewer Operation,6 pages,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper deals with the new control method developed for the pressure sewer
systems. This method eliminates the disadvantages of currently common used
on-off regulation. The major disadvantage is a transition of inconstancies of
the effluent production into the sewage system. The propose method is primarily
based on the principle of an allocation of the drawing off into the given time
slots. This control method is further improved by the extended modules provide
higher level of the optimization (learning mode and emergent drawing off).
Proposed method is able to decrease of the standard deviation of pumping even
by 80%.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2016 14:44:16 GMT'}]",2016-06-14,"[['Jura', 'Jakub', ''], ['Chysky', 'Jan', ''], ['Novak', 'Lukas', '']]","['Pressure sewer', 'control algorithm', 'distributed control system', 'time slot', 'optimization', 'waste management']"
13995,1301.4839,Adrian Klein,Adrian Klein and Fuyuki Ishikawa and Shinichi Honiden,"A Scalable Distributed Architecture for Network- and QoS-aware Service
  Composition","8 pages, 12 figures. This paper has been accepted and published at
  the 3rd International Joint Agent Workshop and Symposium (IJAWS) 2012,
  Kakegawa, Shizuoka, Japan, October 2012. This version has been copy-edited
  for publication at arXiv.org, but left unchanged besides. Refer to
  http://www.adrianobits.de for the original submission in the IJAWS format",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Service-Oriented Computing (SOC) enables the composition of loosely coupled
service agents provided with varying Quality of Service (QoS) levels,
effectively forming a multiagent system (MAS). Selecting a (near-)optimal set
of services for a composition in terms of QoS is crucial when many functionally
equivalent services are available. As the number of distributed services,
especially in the cloud, is rising rapidly, the impact of the network on the
QoS keeps increasing. Despite this and opposed to most MAS approaches, current
service approaches depend on a centralized architecture which cannot adapt to
the network. Thus, we propose a scalable distributed architecture composed of a
flexible number of distributed control nodes. Our architecture requires no
changes to existing services and adapts from a centralized to a completely
distributed realization by adding control nodes as needed. Also, we propose an
extended QoS aggregation algorithm that allows to accurately estimate network
QoS. Finally, we evaluate the benefits and optimality of our architecture in a
distributed environment.
","[{'version': 'v1', 'created': 'Mon, 21 Jan 2013 12:25:16 GMT'}]",2013-01-22,"[['Klein', 'Adrian', ''], ['Ishikawa', 'Fuyuki', ''], ['Honiden', 'Shinichi', '']]","['Service Composition', 'Quality of Service', 'Distributed System', 'Network']"
13996,1304.5869,Reza Chandra,"Renny, Reza Chandra, Syamsi Ruhama, Mochammad Wisuda Sarjono","Exploring Tracer Study Service in Career Center Web Site of Indonesia
  Higher Education",,"Vol. 11 No. 3 March 2013 International Journal of Computer Science
  and Information Security",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quality competence of worker the present do not meet labor market criteria
and the low level of labor productivity, the lack of communication between the
labor market with education, changing of socio-economic structure and global
political influence labor market, the development of science and technology
very rapidly lead to fundamental changes in terms of qualifications,
competencies and requirements for entering the workforce. Tracer Study results
can be used by universities to determine the success of the educational process
that has been done towards their students. Therefore, universities need a
technology services to support the optimization of the use of tracer study. One
of that is the use of a website to facilitate the conduct tracer study. Most
services tracer study provides information to college, like year graduated, got
a job waiting period, the first salary to work, first job, the relevance of the
curriculum to the work, and compliance with the major areas of work taken in
college. Tracer study feature in Career Center Website affect the popularity
website especially in traffic and rich file website.
","[{'version': 'v1', 'created': 'Mon, 22 Apr 2013 08:39:02 GMT'}, {'version': 'v2', 'created': 'Sun, 12 May 2013 14:26:03 GMT'}]",2013-05-14,"[['Renny', '', ''], ['Chandra', 'Reza', ''], ['Ruhama', 'Syamsi', ''], ['Sarjono', 'Mochammad Wisuda', '']]","['career center', 'tracer study', 'traffic', 'popularity']"
13997,1605.00167,Bahman Kalantari,Bahman Kalantari,Approximating Nash Equilibrium Via Multilinear Minimax,8 pages,,,,cs.GT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nash equilibrium} (NE) can be stated as a formal theorem on a multilinear
form, free of game theory terminology. On the other hand, inspired by this
formalism, we state and prove a {\it multilinear minimax theorem}, a
generalization of von Neumann's bilinear minimax theorem. As in the bilinear
case, the proof is based on relating the underlying optimizations to a
primal-dual pair of linear programming problems, albeit more complicated LPs.
The theorem together with its proof is of independent interest. Next, we use
the theorem to associate to a multilinear form in NE a {\it multilinear minimax
relaxation} (MMR), where the primal-dual pair of solutions induce an
approximate equilibrium point that provides a nontrivial upper bound on a
convex combination of {\it expected payoffs} in any NE solution. In fact we
show any positive probability vector associated to the players induces a
corresponding {\it diagonally-scaled} MMR approximate equilibrium with its
associated upper bound. By virtue of the proof of the multilinear minimax
theorem, MMR solution can be computed in polynomial-time. On the other hand, it
is known that even in bimatrix games NE is {\it PPAD-complete}, a complexity
class in NP not known to be in P. The quality of MMR solution and the
efficiency of solving the underlying LPs are the subject of further
investigation. However, as shown in a separate article, for a large set of test
problems in bimatrix games, not only the MMR payoffs for both players are
better than any NE payoffs, so is the computing time of MMR in contrast with
that of Lemke-Howsen algorithm. In large size problems the latter algorithm
even fails to produce a Nash equilibrium. In summary, solving MMR provides a
worthy approximation even if Nash equilibrium is shown to be computable in
polynomial-time.
","[{'version': 'v1', 'created': 'Sat, 30 Apr 2016 21:07:16 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Jul 2019 17:47:26 GMT'}]",2019-07-08,"[['Kalantari', 'Bahman', '']]","['Nash Equilibrium', 'von Neumann Minimax Theorem', 'Linear Programming', 'Matrix Scaling', 'NP', 'PPAD-complete']"
13998,1004.2027,Mohammad Gheshlaghi Azar,"Mohammad Gheshlaghi Azar, Vicenc Gomez and Hilbert J. Kappen",Dynamic Policy Programming,Submitted to Journal of Machine Learning Research,,,,cs.LG cs.AI cs.SY math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel policy iteration method, called dynamic
policy programming (DPP), to estimate the optimal policy in the
infinite-horizon Markov decision processes. We prove the finite-iteration and
asymptotic l\infty-norm performance-loss bounds for DPP in the presence of
approximation/estimation error. The bounds are expressed in terms of the
l\infty-norm of the average accumulated error as opposed to the l\infty-norm of
the error in the case of the standard approximate value iteration (AVI) and the
approximate policy iteration (API). This suggests that DPP can achieve a better
performance than AVI and API since it averages out the simulation noise caused
by Monte-Carlo sampling throughout the learning process. We examine this
theoretical results numerically by com- paring the performance of the
approximate variants of DPP with existing reinforcement learning (RL) methods
on different problem domains. Our results show that, in all cases, DPP-based
algorithms outperform other RL methods by a wide margin.
","[{'version': 'v1', 'created': 'Mon, 12 Apr 2010 19:09:43 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Sep 2011 20:23:59 GMT'}]",2011-09-09,"[['Azar', 'Mohammad Gheshlaghi', ''], ['Gomez', 'Vicenc', ''], ['Kappen', 'Hilbert J.', '']]","['Approximate dynamic programming', 'reinforcement learning', 'Markov decision processes', 'Monte-Carlo methods', 'function approximation']"
13999,1606.03544,Sisira Adikari,"Sisira Adikari, Craig McDonald and John Campbell",Quantitative Analysis of Desirability in User Experience,"ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
  Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/230,cs.CY cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The multi-dimensional nature of user experience warrants rigorous assessment
of the interactive experience in systems. User experience assessments are based
on product evaluations and subsequent analysis of the collected data using
quantitative and qualitative techniques. The quality of user experience
assessments are dependent on the effectiveness of the techniques deployed. This
paper presents the results of a quantitative analysis of desirability aspects
of the user experience in a comparative product evaluation study. The data
collection was conducted using 118 item Microsoft Product Reaction Cards (PRC)
tool followed by data analysis based on the Surface Measure of Overall
Performance (SMOP) approach. The results of this study suggest that the
incorporation of SMOP as an approach for PRC data analysis derive conclusive
evidence of desirability in user experience. The significance of the paper is
that it presents a novel analysis method incorporating product reaction cards
and surface measure of overall performance approach for an effective
quantitative analysis which can be used in academic research and industrial
practice.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 03:43:39 GMT'}]",2016-06-14,"[['Adikari', 'Sisira', ''], ['McDonald', 'Craig', ''], ['Campbell', 'John', '']]","['User Experience', 'Product Reaction Cards', 'Surface Measure of Overall Performance']"
14000,1401.7733,Sunil Kumar c,"C.Sunil Kumar, J.Seetha, S.R.Vinotha",Security Implications of Distributed Database Management System Models,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security features must be addressed when escalating a distributed database.
The choice between the object oriented and the relational data model, several
factors should be considered. The most important of these factors are single
and multilevel access controls (MAC), protection and integrity maintenance.
While determining which distributed database replica will be more secure for a
particular function, the choice should not be made exclusively on the basis of
available security features. One should also query the effectiveness and
efficiency of the delivery of these characteristics. In this paper, the
security strengths and weaknesses of both database models and the thorough
problems initiate in the distributed environment are conversed.
","[{'version': 'v1', 'created': 'Thu, 30 Jan 2014 04:43:22 GMT'}]",2014-01-31,"[['Kumar', 'C. Sunil', ''], ['Seetha', 'J.', ''], ['Vinotha', 'S. R.', '']]","['DDBMS', 'RDBMS', 'CDBMS', 'Security', 'Integrity']"
14001,1603.04153,Changho Suh,"Minje Jang, Sunghyun Kim, Changho Suh, Sewoong Oh","Top-$K$ Ranking from Pairwise Comparisons: When Spectral Ranking is
  Optimal","23 pages, 3 figures, submitted to the Journals of Machine Learning
  Research",,,,cs.LG cs.IT cs.SI math.IT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore the top-$K$ rank aggregation problem. Suppose a collection of
items is compared in pairs repeatedly, and we aim to recover a consistent
ordering that focuses on the top-$K$ ranked items based on partially revealed
preference information. We investigate the Bradley-Terry-Luce model in which
one ranks items according to their perceived utilities modeled as noisy
observations of their underlying true utilities. Our main contributions are
two-fold. First, in a general comparison model where item pairs to compare are
given a priori, we attain an upper and lower bound on the sample size for
reliable recovery of the top-$K$ ranked items. Second, more importantly,
extending the result to a random comparison model where item pairs to compare
are chosen independently with some probability, we show that in slightly
restricted regimes, the gap between the derived bounds reduces to a constant
factor, hence reveals that a spectral method can achieve the minimax optimality
on the (order-wise) sample size required for top-$K$ ranking. That is to say,
we demonstrate a spectral method alone to be sufficient to achieve the
optimality and advantageous in terms of computational complexity, as it does
not require an additional stage of maximum likelihood estimation that a
state-of-the-art scheme employs to achieve the optimality. We corroborate our
main results by numerical experiments.
","[{'version': 'v1', 'created': 'Mon, 14 Mar 2016 07:01:28 GMT'}]",2016-03-15,"[['Jang', 'Minje', ''], ['Kim', 'Sunghyun', ''], ['Suh', 'Changho', ''], ['Oh', 'Sewoong', '']]","['Bradley-Terry-Luce models', 'Optimal sample complexity', 'Pairwise measurements', 'Spectral methods', 'Top-K ranking']"
14002,1410.2013,Biju Issac,"A. Albkerat, and B. Issac",Analysis of IPv6 Transition Technologies,"pages 19-38, Online link:
  http://airccse.org/journal/cnc/6514cnc02.pdf","International Journal of Computer Networks and Communications
  (IJCNC), 6(5), 19-38.",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Currently IPv6 is extremely popular with companies, organizations and
Internet service providers (ISP) due to the limitations of IPv4. In order to
prevent an abrupt change from IPv4 to IPv6, three mechanisms will be used to
provide a smooth transition from IPv4 to IPv6 with minimum effect on the
network. These mechanisms are Dual-Stack, Tunnel and Translation. This research
will shed the light on IPv4 and IPv6 and assess the automatic and manual
transition strategies of the IPv6 by comparing their performances in order to
show how the transition strategy affects network behaviour. The experiment will
be executed using OPNET Modeler that simulates a network containing a Wide Area
Network (WAN), a Local Area Network (LAN), hosts and servers. The results will
be presented in graphs and tables, with further explanation. The experiment
will use different measurements such as throughput, latency (delay), queuing
delay, and TCP delay.
","[{'version': 'v1', 'created': 'Wed, 8 Oct 2014 08:11:32 GMT'}]",2014-10-09,"[['Albkerat', 'A.', ''], ['Issac', 'B.', '']]","['IPv6', 'IPv4', '6to4 Tunnel', 'Manual Tunnel', 'Dual-Stack', 'Opnet Modeler', 'Delay and Throughput  1']"
14003,1203.1728,Ajith Nongmaithem Mr.,N. Ajith Singh and M. Hemalatha,"High performance computing network for cloud environment using
  simulators",5 pages,,,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing is the next generation computing. Adopting the cloud
computing is like signing up new form of a website. The GUI which controls the
cloud computing make is directly control the hardware resource and your
application. The difficulty part in cloud computing is to deploy in real
environment. Its' difficult to know the exact cost and it's requirement until
and unless we buy the service not only that whether it will support the
existing application which is available on traditional data center or had to
design a new application for the cloud computing environment. The security
issue, latency, fault tolerance are some parameter which we need to keen care
before deploying, all this we only know after deploying but by using simulation
we can do the experiment before deploying it to real environment. By simulation
we can understand the real environment of cloud computing and then after it
successful result we can start deploying your application in cloud computing
environment. By using the simulator it will save us lots of time and money.
","[{'version': 'v1', 'created': 'Thu, 8 Mar 2012 10:06:49 GMT'}]",2012-03-09,"[['Singh', 'N. Ajith', ''], ['Hemalatha', 'M.', '']]","['Cloud Computing', 'Simulator', 'CloudSim', 'GridSim', 'Virtual Machine']"
14004,1002.2829,Selva Rani R,"NR Shashi Kumar, TP Pushpavathi, R Selvarani","Dynamic Cognitive Process Application of Blooms Taxonomy for Complex
  Software Design in the Cognitive Domain","13 pages, 6 figures","Awarded as the Best paper, International Conference, Team Tech,
  IISc., pp 101, 2008",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software design in Software Engineering is a critical and dynamic cognitive
process. Accurate and flawless system design will lead to fast coding and early
completion of a software project. Blooms taxonomy classifies cognitive domain
into six dynamic levels such as Knowledge at base level to Comprehension,
Application, Analysis, Synthesis and Evaluation at the highest level in the
order of increasing complexity. A case study indicated in this paper is a gira
system, which is a gprs based Intranet Remote Administration which monitors and
controls the intranet from a mobile device. This paper investigates from this
case study that the System Design stage in Software Engineering uses all the
six levels of Blooms Taxonomy. The application of the highest levels of Blooms
Taxonomy such as Synthesis and Evaluation in the design of gira indicates that
Software Design in Software Development Life Cycle is a complex and critical
cognitive process.
","[{'version': 'v1', 'created': 'Mon, 15 Feb 2010 08:30:48 GMT'}]",2016-09-08,"[['Kumar', 'NR Shashi', ''], ['Pushpavathi', 'TP', ''], ['Selvarani', 'R', '']]","['Bloom’s Taxonomy', 'Cognitive Informatics', 'Cognitive Process', 'Software Design', 'Software Engineering']"
14005,1309.6908,Anuj Sharma Dr,"Sanjog Ray, Anuj Sharma","A Collaborative Filtering Based Approach for Recommending Elective
  Courses","10 Pages, Ray, S., & Sharma, A. (2011). A Collaborative Filtering
  Based Approach for Recommending Elective Courses. 5th International
  Conference on Information Systems, Technology and Management (ICISTM-2011).
  Gurgaon, India",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In management education programmes today, students face a difficult time in
choosing electives as the number of electives available are many. As the range
and diversity of different elective courses available for selection have
increased, course recommendation systems that help students in making choices
about courses have become more relevant. In this paper we extend the concept of
collaborative filtering approach to develop a course recommendation system. The
proposed approach provides student an accurate prediction of the grade they may
get if they choose a particular course, which will be helpful when they decide
on selecting elective courses, as grade is an important parameter for a student
while deciding on an elective course. We experimentally evaluate the
collaborative filtering approach on a real life data set and show that the
proposed system is effective in terms of accuracy.
","[{'version': 'v1', 'created': 'Thu, 26 Sep 2013 14:15:07 GMT'}]",2013-09-27,"[['Ray', 'Sanjog', ''], ['Sharma', 'Anuj', '']]","['Course Recommender System', 'Collaborative Filtering', 'User based Collaborative Filtering', 'Item based Collaborative Filtering']"
14006,1511.06480,Felix X. Yu,"Felix X. Yu, Aditya Bhaskara, Sanjiv Kumar, Yunchao Gong, Shih-Fu
  Chang",On Binary Embedding using Circulant Matrices,"This is an extended version of a paper by the first, third, fourth
  and fifth authors that appeared in ICML 2014 [arXiv:1405.3162]",,,,cs.DS cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Binary embeddings provide efficient and powerful ways to perform operations
on large scale data. However binary embedding typically requires long codes in
order to preserve the discriminative power of the input space. Thus binary
coding methods traditionally suffer from high computation and storage costs in
such a scenario. To address this problem, we propose Circulant Binary Embedding
(CBE) which generates binary codes by projecting the data with a circulant
matrix. The circulant structure allows us to use Fast Fourier Transform
algorithms to speed up the computation. For obtaining $k$-bit binary codes from
$d$-dimensional data, this improves the time complexity from $O(dk)$ to
$O(d\log{d})$, and the space complexity from $O(dk)$ to $O(d)$.
  We study two settings, which differ in the way we choose the parameters of
the circulant matrix. In the first, the parameters are chosen randomly and in
the second, the parameters are learned using the data. For randomized CBE, we
give a theoretical analysis comparing it with binary embedding using an
unstructured random projection matrix. The challenge here is to show that the
dependencies in the entries of the circulant matrix do not lead to a loss in
performance. In the second setting, we design a novel time-frequency
alternating optimization to learn data-dependent circulant projections, which
alternatively minimizes the objective in original and Fourier domains. In both
the settings, we show by extensive experiments that the CBE approach gives much
better performance than the state-of-the-art approaches if we fix a running
time, and provides much faster computation with negligible performance
degradation if we fix the number of bits in the embedding.
","[{'version': 'v1', 'created': 'Fri, 20 Nov 2015 03:05:15 GMT'}, {'version': 'v2', 'created': 'Sat, 5 Dec 2015 02:36:10 GMT'}]",2015-12-08,"[['Yu', 'Felix X.', ''], ['Bhaskara', 'Aditya', ''], ['Kumar', 'Sanjiv', ''], ['Gong', 'Yunchao', ''], ['Chang', 'Shih-Fu', '']]","['Circulant Matrix', 'Dimension Reduction', 'Binary Embedding']"
14007,1702.05867,Qi Zhang,"Qi Zhang, Jing Yang","Multiplicities of Character Values of Binary
  Sidel'nikov-Lempel-Cohn-Eastman Sequences",10 pages,,,,cs.IT math.IT math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Binary Sidel'nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F 2
have even period and almost perfect autocorrelation. However, the evaluation of
the linear complexity of these sequences is really difficult. In this paper, we
continue the study of [1]. We first express the multiple roots of character
polynomials of SLCE sequences into certain kinds of Jacobi sums. Then by making
use of Gauss sums and Jacobi sums in the ""semiprimitive"" case, we derive new
divisibility results for SLCE sequences.
","[{'version': 'v1', 'created': 'Mon, 20 Feb 2017 06:07:23 GMT'}]",2017-02-21,"[['Zhang', 'Qi', ''], ['Yang', 'Jing', '']]","['Linear complexity', 'Sidel’nikov sequence', 'Stream cipher', 'Gauss sums', 'Jacobi sums']"
14008,1004.0765,Secretary Aircc Journal,"E.Sathiyamoorthy, N.Ch.Sriman Narayana Iyenger, V.Ramachandran (VIT
  University, India)","Agent Based Trust Management Model Based on Weight Value Model for
  Online Auctions",17Pages,"International Journal of Network Security & Its Applications 1.3
  (2009) 15-31",,,cs.GT cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper is aimed at the stipulations which arise in the traditional online
auctions as a result of various anomalies in the reputation and trust
calculation mechanism. We try to improve the scalability and efficiency of the
online auctions by providing efficient trust management methodology considering
several factors into consideration. A comparison between the performance of the
auctions system with and without the agent methodology is done with good
results
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2010 03:43:17 GMT'}]",2010-07-15,"[['Sathiyamoorthy', 'E.', '', 'VIT\n  University, India'], ['Iyenger', 'N. Ch. Sriman Narayana', '', 'VIT\n  University, India'], ['Ramachandran', 'V.', '', 'VIT\n  University, India']]","['Agent Technology', 'JADE', 'Optimal Price', 'Trust Management']"
14009,1209.0054,Nilanjan  Dey,"Tanmay Bhattacharya, Nilanjan Dey, S. R. Bhadra Chaudhuri","A Novel Session Based Dual Steganographic Technique Using DWT and Spread
  Spectrum","5 pages, 9 figures. arXiv admin note: substantial text overlap with
  arXiv:1208.0803","International Journal of Modern Engineering Research
  (IJMER),Vol.1, Dec 2011, Issue1, pp-157-161,ISSN: 2249-6645",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposed a DWT based Steganographic technique. Cover image is
decomposed into four sub bands using DWT. Two secret images are embedded within
the HL and HH sub bands respectively. During embedding secret images are
dispersed within each band using a pseudo random sequence and a Session key.
Secret images are extracted using the session key and the size of the images.
In this approach the stego image generated is of acceptable level of
imperceptibility and distortion compared to the cover image and the overall
security is high.
","[{'version': 'v1', 'created': 'Sat, 1 Sep 2012 04:25:31 GMT'}]",2012-09-04,"[['Bhattacharya', 'Tanmay', ''], ['Dey', 'Nilanjan', ''], ['Chaudhuri', 'S. R. Bhadra', '']]","['DWT', 'Session Based Key', 'Pseudo Random']"
14010,0806.4020,Agus Budiyono PhD,"Muljowidodo, Said D. Jenie, Agus Budiyono, Sapto A. Nugroho","Design, Development and Testing of Underwater Vehicles: ITB Experience","6 pages, 8 figures, 1 table; The International Conference on
  Underwater System Technology: Theory and Application, Penang, Malaysia, 18-21
  July 2006",,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The last decade has witnessed increasing worldwide interest in the research
of underwater robotics with particular focus on the area of autonomous
underwater vehicles (AUVs). The underwater robotics technology has enabled
human to access the depth of the ocean to conduct environmental surveys,
resources mapping as well as scientific and military missions. This capability
is especially valuable for countries with major water or oceanic resources. As
an archipelagic nation with more than 13,000 islands, Indonesia has one of the
most abundant living and non-organic oceanic resources. The needs for the
mapping, exploration, and environmental preservation of the vast marine
resources are therefore imperative. The challenge of the deep water exploration
has been the complex issues associated with hazardous and unstructured undersea
and sea-bed environments. The paper reports the design, development and testing
efforts of underwater vehicle that have been conducted at Institut Teknologi
Bandung. Key technology areas have been identified and step-by-step development
is presented in conjunction with the need to meet the challenge of underwater
vehicle operation. A number of future research directions are also highlighted.
","[{'version': 'v1', 'created': 'Wed, 25 Jun 2008 03:56:40 GMT'}]",2008-06-26,"[['Muljowidodo', '', ''], ['Jenie', 'Said D.', ''], ['Budiyono', 'Agus', ''], ['Nugroho', 'Sapto A.', '']]","['Underwater robotics', 'autonomous underwater vehicle (AUV)', 'remotely operated vehicle (ROV)', 'underwater navigation', 'control']"
14011,1407.4723,Ana Mestrovic,"Slobodan Beliga, Ana Me\v{s}trovi\'c, Sanda
  Martin\v{c}i\'c-Ip\v{s}i\'c",Toward Selectivity Based Keyword Extraction for Croatian News,,,,,cs.CL cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Preliminary report on network based keyword extraction for Croatian is an
unsupervised method for keyword extraction from the complex network. We build
our approach with a new network measure the node selectivity, motivated by the
research of the graph based centrality approaches. The node selectivity is
defined as the average weight distribution on the links of the single node. We
extract nodes (keyword candidates) based on the selectivity value. Furthermore,
we expand extracted nodes to word-tuples ranked with the highest in/out
selectivity values. Selectivity based extraction does not require linguistic
knowledge while it is purely derived from statistical and structural
information en-compassed in the source text which is reflected into the
structure of the network. Obtained sets are evaluated on a manually annotated
keywords: for the set of extracted keyword candidates average F1 score is
24,63%, and average F2 score is 21,19%; for the exacted words-tuples candidates
average F1 score is 25,9% and average F2 score is 24,47%.
","[{'version': 'v1', 'created': 'Thu, 17 Jul 2014 16:12:04 GMT'}]",2018-02-15,"[['Beliga', 'Slobodan', ''], ['Meštrović', 'Ana', ''], ['Martinčić-Ipšić', 'Sanda', '']]","['keywords extraction', 'complex networks', 'Croatian texts', 'selectivity']"
14012,1406.4619,Alexandre Chotard,"Alexandre Chotard (INRIA Saclay - Ile de France, LRI), Martin Holena","A Generalized Markov-Chain Modelling Approach to $(1,\lambda)$-ES Linear
  Optimization: Technical Report",,,,,cs.NA cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several recent publications investigated Markov-chain modelling of linear
optimization by a $(1,\lambda)$-ES, considering both unconstrained and linearly
constrained optimization, and both constant and varying step size. All of them
assume normality of the involved random steps, and while this is consistent
with a black-box scenario, information on the function to be optimized (e.g.
separability) may be exploited by the use of another distribution. The
objective of our contribution is to complement previous studies realized with
normal steps, and to give sufficient conditions on the distribution of the
random steps for the success of a constant step-size $(1,\lambda)$-ES on the
simple problem of a linear function with a linear constraint. The decomposition
of a multidimensional distribution into its marginals and the copula combining
them is applied to the new distributional assumptions, particular attention
being paid to distributions with Archimedean copulas.
","[{'version': 'v1', 'created': 'Wed, 18 Jun 2014 06:58:38 GMT'}]",2014-06-19,"[['Chotard', 'Alexandre', '', 'INRIA Saclay - Ile de France, LRI'], ['Holena', 'Martin', '']]","['evolution strategies', 'continuous optimization', 'linear optimization', 'linear constraint', 'linear function', 'Markov chain models', 'Archimedeancopulas']"
14013,1610.06382,Andreas M. Wahl,"Andreas M. Wahl, Gregor Endler, Peter K. Schwab, Sebastian Herbst,
  Richard Lenz","Anfrage-getriebener Wissenstransfer zur Unterstuetzung von
  Datenanalysten",in German,,,,cs.DB cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In larger organizations, multiple teams of data scientists have to integrate
data from heterogeneous data sources as preparation for data analysis tasks.
Writing effective analytical queries requires data scientists to have in-depth
knowledge of the existence, semantics, and usage context of data sources. Once
gathered, such knowledge is informally shared within a specific team of data
scientists, but usually is neither formalized nor shared with other teams.
Potential synergies remain unused. We therefore introduce a novel approach
which extends data management systems with additional knowledge-sharing
capabilities to facilitate user collaboration without altering established data
analysis workflows. Relevant collective knowledge from the query log is
extracted to support data source discovery and incremental data integration.
Extracted knowledge is formalized and provided at query time.
","[{'version': 'v1', 'created': 'Thu, 20 Oct 2016 12:41:31 GMT'}]",2016-10-21,"[['Wahl', 'Andreas M.', ''], ['Endler', 'Gregor', ''], ['Schwab', 'Peter K.', ''], ['Herbst', 'Sebastian', ''], ['Lenz', 'Richard', '']]","['Datenintegration', 'Kollaboration', 'Anfrageverarbeitung']"
14014,1606.06909,Sanjay Sahay,"Ashu Sharma, Sanjay K. Sahay and Abhishek Kumar","Improving the detection accuracy of unknown malware by partitioning the
  executables in groups","Proceedings 9th ICACCT, 2015, 8 Pages, 7 Figures","Springer, Advances in Intelligent System and Computing, Vol. 452,
  pp. 421 - 431, 2016",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detection of unknown malware with high accuracy is always a challenging task.
Therefore, in this paper, we study the classification of unknown malware by two
methods. In the first/regular method, similar to other authors [17][16][20]
approaches we select the features by taking all dataset in one group and in the
second method, we select the features by partitioning the dataset in the range
of file 5 KB size. We find that the second method to detect the malware with
~8.7% more accurate than the first/regular method.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2016 11:46:10 GMT'}]",2018-09-18,"[['Sharma', 'Ashu', ''], ['Sahay', 'Sanjay K.', ''], ['Kumar', 'Abhishek', '']]","['Malware detection', 'Computer security', 'Machine learning', 'Naive Bayes', 'Profiling']"
14015,1304.4002,Manik Lal Das,"Harsh N Thakker, Mayank Saha, Manik Lal Das",Reputation Algebra for Cloud-based Anonymous Data Storage Systems,9 pages,,,,cs.DC cs.CR,http://creativecommons.org/licenses/publicdomain/,"  Given a cloud-based anonymous data storage system, there are two ways for
managing the nodes involved in file transfers. One of them is using reputations
and the other uses a micropayment system. In reputation-based approach, each
node has a reputation associated with it, which is used as a currency or
feedback collection for file exchange operations. There have been several
attempts over the years to develop a strong and efficient reputation system
that provides credibility, fairness, and accountability. One such attempt was
the Free Haven Project that provides a strong foundation for cloud-based
anonymous data storage systems. The work proposed in this paper is motivated by
the Free Haven Project aimed at developing a reputation system that facilitates
dynamic operations such as adding servers, removing servers and changing role
of authorities. The proposed system also provides algorithm for scoring and
maintaining reputations of the servers in order to achieve credibility,
accountability and fairness.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2013 07:04:32 GMT'}]",2013-04-16,"[['Thakker', 'Harsh N', ''], ['Saha', 'Mayank', ''], ['Das', 'Manik Lal', '']]","['reputation', 'cloud system', 'data storage', 'accountability', 'fairness', 'credibility']"
14016,1205.4377,Kirill Trapeznikov,"Kirill Trapeznikov, Venkatesh Saligrama, David Castanon",Multi-Stage Classifier Design,,,,,cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many classification systems, sensing modalities have different acquisition
costs. It is often {\it unnecessary} to use every modality to classify a
majority of examples. We study a multi-stage system in a prediction time cost
reduction setting, where the full data is available for training, but for a
test example, measurements in a new modality can be acquired at each stage for
an additional cost. We seek decision rules to reduce the average measurement
acquisition cost. We formulate an empirical risk minimization problem (ERM) for
a multi-stage reject classifier, wherein the stage $k$ classifier either
classifies a sample using only the measurements acquired so far or rejects it
to the next stage where more attributes can be acquired for a cost. To solve
the ERM problem, we show that the optimal reject classifier at each stage is a
combination of two binary classifiers, one biased towards positive examples and
the other biased towards negative examples. We use this parameterization to
construct stage-by-stage global surrogate risk, develop an iterative algorithm
in the boosting framework and present convergence and generalization results.
We test our work on synthetic, medical and explosives detection datasets. Our
results demonstrate that substantial cost reduction without a significant
sacrifice in accuracy is achievable.
","[{'version': 'v1', 'created': 'Sun, 20 May 2012 03:15:13 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Jan 2013 16:54:30 GMT'}]",2013-01-30,"[['Trapeznikov', 'Kirill', ''], ['Saligrama', 'Venkatesh', ''], ['Castanon', 'David', '']]","['multi-stage classification', 'sequential decision', 'boosting', 'cost sensitive learning']"
14017,1306.1323,E.N.Sathishkumar,"T. Chandrasekhar, K. Thangavel, E.N. Sathishkumar","Verdict Accuracy of Quick Reduct Algorithm using Clustering and
  Classification Techniques for Gene Expression Data","7 pages, 3 figures","IJCSI International Journal of Computer Science Issues, Vol. 9,
  Issue 1, No 1, January 2012, page no. 357-363",,,cs.LG cs.CE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In most gene expression data, the number of training samples is very small
compared to the large number of genes involved in the experiments. However,
among the large amount of genes, only a small fraction is effective for
performing a certain task. Furthermore, a small subset of genes is desirable in
developing gene expression based diagnostic tools for delivering reliable and
understandable results. With the gene selection results, the cost of biological
experiment and decision can be greatly reduced by analyzing only the marker
genes. An important application of gene expression data in functional genomics
is to classify samples according to their gene expression profiles. Feature
selection (FS) is a process which attempts to select more informative features.
It is one of the important steps in knowledge discovery. Conventional
supervised FS methods evaluate various feature subsets using an evaluation
function or metric to select only those features which are related to the
decision classes of the data under consideration. This paper studies a feature
selection method based on rough set theory. Further K-Means, Fuzzy C-Means
(FCM) algorithm have implemented for the reduced feature set without
considering class labels. Then the obtained results are compared with the
original class labels. Back Propagation Network (BPN) has also been used for
classification. Then the performance of K-Means, FCM, and BPN are analyzed
through the confusion matrix. It is found that the BPN is performing well
comparatively.
","[{'version': 'v1', 'created': 'Thu, 6 Jun 2013 07:26:06 GMT'}]",2013-06-07,"[['Chandrasekhar', 'T.', ''], ['Thangavel', 'K.', ''], ['Sathishkumar', 'E. N.', '']]","['Rough set theory', 'Feature Selection', 'Gene Expression', 'Quick Reduct', 'K-means', 'Fuzzy C means', 'BPN']"
14018,1209.4777,Ahmed Bashir Ahmed Bashir,"Ahmed Bashir Abugharsa, Abd Samad Bin Hasan Basari and Hamida
  Almangush","A Novel Image Encryption Using an Integration Technique of Blocks
  Rotation Based on the Magic Cube and the AES Algorithm",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, several encryption algorithms have been proposed to protect
digital images from cryptographic attacks. These encryption algorithms
typically use a relatively small key space and therefore, provide safe,
especially if they are of a dimension. In this paper proposes an encryption
algorithm for a new image protection scheme based on the rotation of the faces
of a Magic Cube. The original image is divided into six sub-images and these
sub-images are divided amongst a number of blocks and attached to the faces of
a Magic Cube. The faces are then scrambled using rotation of the Magic Cube.
Then the rotated image is fed to the AES algorithm which is applied to the
pixels of the image to encrypt the scrambled image. Finally, experimental
results and security analysis show that the proposed image encryption scheme
not only encrypts the picture to achieve perfect hiding, but the algorithm can
also withstand exhaustive, statistical and differential attacks.
","[{'version': 'v1', 'created': 'Fri, 21 Sep 2012 10:39:18 GMT'}]",2012-09-24,"[['Abugharsa', 'Ahmed Bashir', ''], ['Basari', 'Abd Samad Bin Hasan', ''], ['Almangush', 'Hamida', '']]","['Image encryption', 'AES', 'Magic cube', 'Image Entropy', 'Block Image Encryption', 'Correlation']"
14019,1410.0046,Ramoni Adeogun,Ramoni Adeogun,"A Robust MUSIC Based Scheme for Interference Location in Satellite
  Systems with Multibeam Antennas",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate methods for interference location in satellite
communication system using satellite multi-beam antenna with subspace based
schemes. A novel MUSIC based approach is proposed for estimating the direction
of arrival of the interfering sources. The proposed method provides super
resolution and asymptotic maximum likelihood estimates of the direction of
arrivals even at low SNR values. Simulations were performed using typical
satellite multi-beam antenna configurations and results show that the proposed
scheme can effectively estimates the direction of arrival in the azimuth and
elevation spectra. Compared to the support vector regression method, the
proposed approach offer improved estimation accuracy at low SNR values.
","[{'version': 'v1', 'created': 'Sat, 9 Aug 2014 05:38:26 GMT'}]",2014-10-02,"[['Adeogun', 'Ramoni', '']]","['Satellite interference location', 'MUSIC', 'direction estimation', 'subspace methods', 'geostationary orbit']"
14020,1710.04144,Booma Sowkarthiga Balasubramani,"Booma Sowkarthiga Balasubramani, Omar Belingheri, Eric S. Boria,
  Isabel F. Cruz, Sybil Derrible, Michael D. Siciliano",GUIDES - Geospatial Urban Infrastructure Data Engineering Solutions,"4 pages, SIGSPATIAL'17, November 7-10, 2017, Los Angeles Area, CA,
  USA",,,,cs.CY cs.DB,http://creativecommons.org/licenses/by/4.0/,"  As the underground infrastructure systems of cities age, maintenance and
repair become an increasing concern. Cities face difficulties in planning
maintenance, predicting and responding to infrastructure related issues, and in
realizing their vision to be a smart city due to their incomplete understanding
of the existing state of the infrastructure. Only few cities have accurate and
complete digital information on their underground infrastructure (e.g.,
electricity, water, natural gas) systems, which poses problems to those
planning and performing construction projects. To address these issues, we
introduce GUIDES as a new data conversion and management framework for urban
underground infrastructure systems that enable city administrators, workers,
and contractors along with the general public and other users to query
digitized and integrated data to make smarter decisions. This demo paper
presents the GUIDES architecture and describes two of its central components:
(i) mapping of underground infrastructure systems, and (ii) integration of
heterogeneous geospatial data.
","[{'version': 'v1', 'created': 'Wed, 11 Oct 2017 15:58:21 GMT'}]",2017-10-12,"[['Balasubramani', 'Booma Sowkarthiga', ''], ['Belingheri', 'Omar', ''], ['Boria', 'Eric S.', ''], ['Cruz', 'Isabel F.', ''], ['Derrible', 'Sybil', ''], ['Siciliano', 'Michael D.', '']]","['GIS', 'Geospatial data', 'Data integration', 'Ontology', 'Data analytics', 'Data management', 'Urban underground infrastructure', 'Smart cities1INTRODUCTION AND MOTIVATION']"
14021,1209.4893,Xin Xiao,Kasturi Varadarajan and Xin Xiao,On the Sensitivity of Shape Fitting Problems,,,,,cs.CG cs.LG,http://creativecommons.org/licenses/by/3.0/,"  In this article, we study shape fitting problems, $\epsilon$-coresets, and
total sensitivity. We focus on the $(j,k)$-projective clustering problems,
including $k$-median/$k$-means, $k$-line clustering, $j$-subspace
approximation, and the integer $(j,k)$-projective clustering problem. We derive
upper bounds of total sensitivities for these problems, and obtain
$\epsilon$-coresets using these upper bounds. Using a dimension-reduction type
argument, we are able to greatly simplify earlier results on total sensitivity
for the $k$-median/$k$-means clustering problems, and obtain
positively-weighted $\epsilon$-coresets for several variants of the
$(j,k)$-projective clustering problem. We also extend an earlier result on
$\epsilon$-coresets for the integer $(j,k)$-projective clustering problem in
fixed dimension to the case of high dimension.
","[{'version': 'v1', 'created': 'Fri, 21 Sep 2012 19:55:53 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Oct 2012 22:22:46 GMT'}]",2012-10-12,"[['Varadarajan', 'Kasturi', ''], ['Xiao', 'Xin', '']]","['Coresets', 'shape fitting', 'k-means', 'subspace approximation']"
14022,1301.0001,Nivedita Daimiwal,"Nivedita Daimiwal, M. Sundhararajan, Revati Shriram",Applications of fMRI for Brain Mapping,,,,,cs.ET q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Brain-mapping techniques have proven to be vital in understanding the
molecular, cellular, and functional mechanisms of the brain. Normal anatomical
imaging can provide structural information on certain abnormalities in the
brain. However there are many neurological disorders for which only structure
studies are not sufficient. In such cases it is required to investigate the
functional organization of the brain. Further it is necessary to study the
brain functions under normal as well as diseased conditions. Brain mapping
techniques can help in deriving useful and important information on these
issues. Brain functions and brain area responsible for the particular
activities like motor, sensory speech and memory process could be investigated.
The authors provide an overview of various Brain Mapping techniques and fMRI
signal processing methods.
","[{'version': 'v1', 'created': 'Thu, 27 Dec 2012 11:00:36 GMT'}]",2013-01-03,"[['Daimiwal', 'Nivedita', ''], ['Sundhararajan', 'M.', ''], ['Shriram', 'Revati', '']]","['Functional MRI (fMRI)', 'Signal Processing', 'Brain Mapping']"
14023,1403.6955,Sheetal Bairwa,"Sheetal Bairwa, Bhawna Mewara and Jyoti Gajrani","Vulnerability Scanners-A Proactive Approach To Assess Web Application
  Security","12 pages, 6 figures, 3 tables, SCNDS 2013 Conference. International
  Journal on Computational Sciences & Applications (IJCSA)2014",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the increasing concern for security in the network, many approaches are
laid out that try to protect the network from unauthorised access. New methods
have been adopted in order to find the potential discrepancies that may damage
the network. Most commonly used approach is the vulnerability assessment. By
vulnerability, we mean, the potential flaws in the system that make it prone to
the attack. Assessment of these system vulnerabilities provide a means to
identify and develop new strategies so as to protect the system from the risk
of being damaged. This paper focuses on the usage of various vulnerability
scanners and their related methodology to detect the various vulnerabilities
available in the web applications or the remote host across the network and
tries to identify new mechanisms that can be deployed to secure the network.
","[{'version': 'v1', 'created': 'Thu, 27 Mar 2014 09:20:40 GMT'}]",2014-03-28,"[['Bairwa', 'Sheetal', ''], ['Mewara', 'Bhawna', ''], ['Gajrani', 'Jyoti', '']]","['Vulnerability', 'Static analysis', 'Attack graph', 'Scanners', 'Test–Bed']"
14024,1409.7386,Rushdi Shams Mr,Rushdi Shams,Performance of Stanford and Minipar Parser on Biomedical Texts,,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the performance of two dependency parsers, namely Stanford and
Minipar, on biomedical texts has been reported. The performance of te parsers
to assignm dependencies between two biomedical concepts that are already proved
to be connected is not satisfying. Both Stanford and Minipar, being statistical
parsers, fail to assign dependency relation between two connected concepts if
they are distant by at least one clause. Minipar's performance, in terms of
precision, recall and the F-score of the attachment score (e.g., correctly
identified head in a dependency), to parse biomedical text is also measured
taking the Stanford's as a gold standard. The results suggest that Minipar is
not suitable yet to parse biomedical texts. In addition, a qualitative
investigation reveals that the difference between working principles of the
parsers also play a vital role for Minipar's degraded performance.
","[{'version': 'v1', 'created': 'Thu, 25 Sep 2014 15:35:27 GMT'}]",2014-09-29,"[['Shams', 'Rushdi', '']]","['Dependency Parse', 'Stanford Parser', 'Minipar Parser', 'F-Score', 'Attachment Score']"
14025,1004.0048,Sudipto Das,"Sudipto Das, Omer Egecioglu and Amr El Abbadi","Anonimos: An LP based Approach for Anonymizing Weighted Social Network
  Graphs",15 pages.,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing popularity of social networks has initiated a fertile research
area in information extraction and data mining. Anonymization of these social
graphs is important to facilitate publishing these data sets for analysis by
external entities. Prior work has concentrated mostly on node identity
anonymization and structural anonymization. But with the growing interest in
analyzing social networks as a weighted network, edge weight anonymization is
also gaining importance. We present An\'onimos, a Linear Programming based
technique for anonymization of edge weights that preserves linear properties of
graphs. Such properties form the foundation of many important graph-theoretic
algorithms such as shortest paths problem, k-nearest neighbors, minimum cost
spanning tree, and maximizing information spread. As a proof of concept, we
apply An\'onimos to the shortest paths problem and its extensions, prove the
correctness, analyze complexity, and experimentally evaluate it using real
social network data sets. Our experiments demonstrate that An\'onimos
anonymizes the weights, improves k-anonymity of the weights, and also scrambles
the relative ordering of the edges sorted by weights, thereby providing robust
and effective anonymization of the sensitive edge-weights. Additionally, we
demonstrate the composability of different models generated using An\'onimos, a
property that allows a single anonymized graph to preserve multiple linear
properties.
","[{'version': 'v1', 'created': 'Thu, 1 Apr 2010 03:39:33 GMT'}]",2015-03-13,"[['Das', 'Sudipto', ''], ['Egecioglu', 'Omer', ''], ['Abbadi', 'Amr El', '']]","['Anonymization', 'Social Networks', 'Weighted network models', 'Shortest paths', 'Linear Programming']"
14026,1108.3223,Guodong Shi,Guodong Shi and Karl Henrik Johansson,Randomized Optimal Consensus of Multi-agent Systems,,,,,cs.MA cs.CG cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we formulate and solve a randomized optimal consensus problem
for multi-agent systems with stochastically time-varying interconnection
topology. The considered multi-agent system with a simple randomized iterating
rule achieves an almost sure consensus meanwhile solving the optimization
problem $\min_{z\in \mathds{R}^d}\ \sum_{i=1}^n f_i(z),$ in which the optimal
solution set of objective function $f_i$ can only be observed by agent $i$
itself. At each time step, simply determined by a Bernoulli trial, each agent
independently and randomly chooses either taking an average among its neighbor
set, or projecting onto the optimal solution set of its own optimization
component. Both directed and bidirectional communication graphs are studied.
Connectivity conditions are proposed to guarantee an optimal consensus almost
surely with proper convexity and intersection assumptions. The convergence
analysis is carried out using convex analysis. We compare the randomized
algorithm with the deterministic one via a numerical example. The results
illustrate that a group of autonomous agents can reach an optimal opinion by
each node simply making a randomized trade-off between following its neighbors
or sticking to its own opinion at each time step.
","[{'version': 'v1', 'created': 'Tue, 16 Aug 2011 12:33:07 GMT'}, {'version': 'v2', 'created': 'Sun, 18 Mar 2012 18:08:46 GMT'}]",2015-03-19,"[['Shi', 'Guodong', ''], ['Johansson', 'Karl Henrik', '']]","['Multi-agent systems', 'Optimal consensus', 'Set convergence', 'Distributed opti']"
14027,1105.2443,Philipp Mayr,"Mark Thamm, Philipp Mayr","Comparing webometric with web-independent rankings: a case study with
  German universities","3 pages, ACM Web Science 2011",,,,cs.SI cs.DL physics.soc-ph,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper we examine if hyperlink-based (webometric) indicators can be
used to rank academic websites. Therefore we analyzed the interlinking
structure of German university websites and compared our simple hyperlink-based
ranking with official and web-independent rankings of universities. We found
that link impact could not easily be seen as a prestige factor for
universities.
","[{'version': 'v1', 'created': 'Thu, 12 May 2011 12:14:47 GMT'}]",2011-05-13,"[['Thamm', 'Mark', ''], ['Mayr', 'Philipp', '']]","['Webometrics', 'link analysis', 'university ranking', 'academic websites', 'correlation']"
14028,1611.00872,Meisam Hejazi Nia,Meisam Hejazi Nia,"A Decision Support System for Inbound Marketers: An Empirical Use of
  Latent Dirichlet Allocation Topic Model to Guide Infographic Designers",,,,,cs.HC cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Infographic is a type of information presentation that inbound marketers use.
I suggest a method that can allow the infographic designers to benchmark their
design against the previous viral infographics to measure whether a given
design decision can help or hurt the probability of the design becoming viral.
","[{'version': 'v1', 'created': 'Thu, 3 Nov 2016 03:53:25 GMT'}]",2016-11-04,"[['Nia', 'Meisam Hejazi', '']]","['inbound marketing', 'infographics', 'computer vision', 'latent Dirichlet model', 'variational expectationmaximization']"
14029,1002.1060,Roberto da Silva,"Roberto da Silva, Jose Palazzo de Oliveira, Jose Valdeni de Lima,
  Viviane Moreira",Statistics for Ranking Program Committees and Editorial Boards,,,,,cs.IT cs.IR math.IT physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ranking groups of researchers is important in several contexts and can serve
many purposes such as the fair distribution of grants based on the scientist's
publication output, concession of research projects, classification of journal
editorial boards and many other applications in a social context. In this
paper, we propose a method for measuring the performance of groups of
researchers. The proposed method is called alpha-index and it is based on two
parameters: (i) the homogeneity of the h-indexes of the researchers in the
group; and (ii) the h-group, which is an extension of the h-index for groups.
Our method integrates the concepts of homogeneity and absolute value of the
h-index into a single measure which is appropriate for the evaluation of
groups. We report on experiments that assess computer science conferences based
on the h-indexes of their program committee members. Our results are similar to
a manual classification scheme adopted by a research agency.
","[{'version': 'v1', 'created': 'Thu, 4 Feb 2010 19:27:48 GMT'}]",2010-02-05,"[['da Silva', 'Roberto', ''], ['de Oliveira', 'Jose Palazzo', ''], ['de Lima', 'Jose Valdeni', ''], ['Moreira', 'Viviane', '']]","['Gini coefficient', 'h-index', 'Metrics in Science', 'Bibliometrics']"
14030,1712.04850,Huaizu Jiang,"Huaizu Jiang, Erik Learned-Miller, Gustav Larsson, Michael Maire, Greg
  Shakhnarovich",Self-Supervised Relative Depth Learning for Urban Scene Understanding,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As an agent moves through the world, the apparent motion of scene elements is
(usually) inversely proportional to their depth. It is natural for a learning
agent to associate image patterns with the magnitude of their displacement over
time: as the agent moves, faraway mountains don't move much; nearby trees move
a lot. This natural relationship between the appearance of objects and their
motion is a rich source of information about the world. In this work, we start
by training a deep network, using fully automatic supervision, to predict
relative scene depth from single images. The relative depth training images are
automatically derived from simple videos of cars moving through a scene, using
recent motion segmentation techniques, and no human-provided labels. This proxy
task of predicting relative depth from a single image induces features in the
network that result in large improvements in a set of downstream tasks
including semantic segmentation, joint road segmentation and car detection, and
monocular (absolute) depth estimation, over a network trained from scratch. The
improvement on the semantic segmentation task is greater than those produced by
any other automatically supervised methods. Moreover, for monocular depth
estimation, our unsupervised pre-training method even outperforms supervised
pre-training with ImageNet. In addition, we demonstrate benefits from learning
to predict (unsupervised) relative depth in the specific videos associated with
various downstream tasks. We adapt to the specific scenes in those tasks in an
unsupervised manner to improve performance. In summary, for semantic
segmentation, we present state-of-the-art results among methods that do not use
supervised pre-training, and we even exceed the performance of supervised
ImageNet pre-trained models for monocular depth estimation, achieving results
that are comparable with state-of-the-art methods.
","[{'version': 'v1', 'created': 'Wed, 13 Dec 2017 16:39:14 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Apr 2018 15:39:03 GMT'}]",2018-04-03,"[['Jiang', 'Huaizu', ''], ['Learned-Miller', 'Erik', ''], ['Larsson', 'Gustav', ''], ['Maire', 'Michael', ''], ['Shakhnarovich', 'Greg', '']]","['self-supervised learning', 'unsupervised domain adaptation', 'urban sceneunderstanding', 'semantic segmentation', 'monocular depth estimation']"
14031,1702.07617,Chen Wu,"Chen Wu, Rodrigo Tobar, Kevin Vinsen, Andreas Wicenec, Dave Pallot,
  Baoqiang Lao, Ruonan Wang, Tao An, Mark Boulton, Ian Cooper, Richard Dodson,
  Markus Dolensky, Ying Mei, Feng Wang","DALiuGE: A Graph Execution Framework for Harnessing the Astronomical
  Data Deluge","31 pages, 12 figures, currently under review by Astronomy and
  Computing",,,,cs.DC physics.ins-det,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Data Activated Liu Graph Engine - DALiuGE - is an execution framework for
processing large astronomical datasets at a scale required by the Square
Kilometre Array Phase 1 (SKA1). It includes an interface for expressing complex
data reduction pipelines consisting of both data sets and algorithmic
components and an implementation run-time to execute such pipelines on
distributed resources. By mapping the logical view of a pipeline to its
physical realisation, DALiuGE separates the concerns of multiple stakeholders,
allowing them to collectively optimise large-scale data processing solutions in
a coherent manner. The execution in DALiuGE is data-activated, where each
individual data item autonomously triggers the processing on itself. Such
decentralisation also makes the execution framework very scalable and flexible,
supporting pipeline sizes ranging from less than ten tasks running on a laptop
to tens of millions of concurrent tasks on the second fastest supercomputer in
the world. DALiuGE has been used in production for reducing interferometry data
sets from the Karl E. Jansky Very Large Array and the Mingantu Ultrawide
Spectral Radioheliograph; and is being developed as the execution framework
prototype for the Science Data Processor (SDP) consortium of the Square
Kilometre Array (SKA) telescope. This paper presents a technical overview of
DALiuGE and discusses case studies from the CHILES and MUSER projects that use
DALiuGE to execute production pipelines. In a companion paper, we provide
in-depth analysis of DALiuGE's scalability to very large numbers of tasks on
two supercomputing facilities.
","[{'version': 'v1', 'created': 'Fri, 24 Feb 2017 14:54:45 GMT'}]",2017-02-27,"[['Wu', 'Chen', ''], ['Tobar', 'Rodrigo', ''], ['Vinsen', 'Kevin', ''], ['Wicenec', 'Andreas', ''], ['Pallot', 'Dave', ''], ['Lao', 'Baoqiang', ''], ['Wang', 'Ruonan', ''], ['An', 'Tao', ''], ['Boulton', 'Mark', ''], ['Cooper', 'Ian', ''], ['Dodson', 'Richard', ''], ['Dolensky', 'Markus', ''], ['Mei', 'Ying', ''], ['Wang', 'Feng', '']]","['Dataflow', 'Graph Execution Engine', 'Data Driven', 'Square Kilometre Array', 'Many-Task Computing']"
14032,1602.08447,Le Hoang Son,"Mumtaz Ali, Nguyen Van Minh, Le Hoang Son","A Neutrosophic Recommender System for Medical Diagnosis Based on
  Algebraic Neutrosophic Measures","Keywords: Medical diagnosis, neutrosophic set, neutrosophic
  recommender system, non-linear regression model",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neutrosophic set has the ability to handle uncertain, incomplete,
inconsistent, indeterminate information in a more accurate way. In this paper,
we proposed a neutrosophic recommender system to predict the diseases based on
neutrosophic set which includes single-criterion neutrosophic recommender
system (SC-NRS) and multi-criterion neutrosophic recommender system (MC-NRS).
Further, we investigated some algebraic operations of neutrosophic recommender
system such as union, complement, intersection, probabilistic sum, bold sum,
bold intersection, bounded difference, symmetric difference, convex linear sum
of min and max operators, Cartesian product, associativity, commutativity and
distributive. Based on these operations, we studied the algebraic structures
such as lattices, Kleen algebra, de Morgan algebra, Brouwerian algebra, BCK
algebra, Stone algebra and MV algebra. In addition, we introduced several types
of similarity measures based on these algebraic operations and studied some of
their theoretic properties. Moreover, we accomplished a prediction formula
using the proposed algebraic similarity measure. We also proposed a new
algorithm for medical diagnosis based on neutrosophic recommender system.
Finally to check the validity of the proposed methodology, we made experiments
on the datasets Heart, RHC, Breast cancer, Diabetes and DMD. At the end, we
presented the MSE and computational time by comparing the proposed algorithm
with the relevant ones such as ICSM, DSM, CARE, CFMD, as well as other variants
namely Variant 67, Variant 69, and Varian 71 both in tabular and graphical form
to analyze the efficiency and accuracy. Finally we analyzed the strength of all
8 algorithms by ANOVA statistical tool.
","[{'version': 'v1', 'created': 'Thu, 25 Feb 2016 03:20:00 GMT'}]",2016-02-29,"[['Ali', 'Mumtaz', ''], ['Van Minh', 'Nguyen', ''], ['Son', 'Le Hoang', '']]","['Medical diagnosis', 'neutrosophic set', 'neutrosophic recommender system', 'non-linear regression']"
14033,1802.09089,Yisroel Mirsky Mr.,"Yisroel Mirsky, Tomer Doitshman, Yuval Elovici, Asaf Shabtai","Kitsune: An Ensemble of Autoencoders for Online Network Intrusion
  Detection","Appears in Network and Distributed Systems Security Symposium (NDSS)
  2018",,,,cs.CR cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural networks have become an increasingly popular solution for network
intrusion detection systems (NIDS). Their capability of learning complex
patterns and behaviors make them a suitable solution for differentiating
between normal traffic and network attacks. However, a drawback of neural
networks is the amount of resources needed to train them. Many network gateways
and routers devices, which could potentially host an NIDS, simply do not have
the memory or processing power to train and sometimes even execute such models.
More importantly, the existing neural network solutions are trained in a
supervised manner. Meaning that an expert must label the network traffic and
update the model manually from time to time.
  In this paper, we present Kitsune: a plug and play NIDS which can learn to
detect attacks on the local network, without supervision, and in an efficient
online manner. Kitsune's core algorithm (KitNET) uses an ensemble of neural
networks called autoencoders to collectively differentiate between normal and
abnormal traffic patterns. KitNET is supported by a feature extraction
framework which efficiently tracks the patterns of every network channel. Our
evaluations show that Kitsune can detect various attacks with a performance
comparable to offline anomaly detectors, even on a Raspberry PI. This
demonstrates that Kitsune can be a practical and economic NIDS.
","[{'version': 'v1', 'created': 'Sun, 25 Feb 2018 21:42:56 GMT'}, {'version': 'v2', 'created': 'Sun, 27 May 2018 09:50:10 GMT'}]",2018-05-29,"[['Mirsky', 'Yisroel', ''], ['Doitshman', 'Tomer', ''], ['Elovici', 'Yuval', ''], ['Shabtai', 'Asaf', '']]","['Anomaly detection', 'network intrusion detection', 'online algorithms', 'autoencoders', 'ensemble learning']"
14034,1410.4865,Kush Varshney,Kush R. Varshney and Lav R. Varshney,Olfactory Signal Processing,,,,,cs.IT cs.MM math.IT stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Olfaction, the sense of smell, has received scant attention from a signal
processing perspective in comparison to audition and vision. In this paper, we
develop a signal processing paradigm for olfactory signals based on new
scientific discoveries including the psychophysics concept of olfactory white.
We describe a framework for predicting the perception of odorant compounds from
their physicochemical features and use the prediction as a foundation for
several downstream processing tasks. We detail formulations for odor
cancellation and food steganography, and provide real-world empirical examples
for the two tasks. We also discuss adaptive filtering and other olfactory
signal processing tasks at a high level.
","[{'version': 'v1', 'created': 'Fri, 17 Oct 2014 21:09:55 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Sep 2015 17:13:30 GMT'}]",2015-09-16,"[['Varshney', 'Kush R.', ''], ['Varshney', 'Lav R.', '']]","['Adaptive filtering', 'food steganography', 'noise cancellation', 'odor']"
14035,1305.1344,Faouzi Benzarti,Faouzi Benzarti and Hamid Amiri,Speckle Noise Reduction in Medical Ultrasound Images,,"International Journal of Computer Science Issues, Vol 9, Issue 2,
  No 3, March 2012 ISSN 1694-0814",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ultrasound imaging is an incontestable vital tool for diagnosis, it provides
in non-invasive manner the internal structure of the body to detect eventually
diseases or abnormalities tissues. Unfortunately, the presence of speckle noise
in these images affects edges and fine details which limit the contrast
resolution and make diagnostic more difficult. In this paper, we propose a
denoising approach which combines logarithmic transformation and a non linear
diffusion tensor. Since speckle noise is multiplicative and nonwhite process,
the logarithmic transformation is a reasonable choice to convert
signaldependent or pure multiplicative noise to an additive one. The key idea
from using diffusion tensor is to adapt the flow diffusion towards the local
orientation by applying anisotropic diffusion along the coherent structure
direction of interesting features in the image. To illustrate the effective
performance of our algorithm, we present some experimental results on
synthetically and real echographic images.
","[{'version': 'v1', 'created': 'Mon, 6 May 2013 22:25:52 GMT'}]",2013-05-08,"[['Benzarti', 'Faouzi', ''], ['Amiri', 'Hamid', '']]","['Ultrasound images', 'Homomorphic transformation', 'Anisotropic diffusion', 'Denoising', 'Structure tensor', 'Diffusion tensor']"
14036,1002.2477,Qiqi Yan,Mukund Sundararajan and Qiqi Yan,Robust Mechanisms for Risk-Averse Sellers,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The existing literature on optimal auctions focuses on optimizing the
expected revenue of the seller, and is appropriate for risk-neutral sellers. In
this paper, we identify good mechanisms for risk-averse sellers. As is standard
in the economics literature, we model the risk-aversion of a seller by endowing
the seller with a monotone concave utility function. We then seek robust
mechanisms that are approximately optimal for all sellers, no matter what their
levels of risk-aversion are. We have two main results for multi-unit auctions
with unit-demand bidders whose valuations are drawn i.i.d. from a regular
distribution. First, we identify a posted-price mechanism called the Hedge
mechanism, which gives a universal constant factor approximation; we also show
for the unlimited supply case that this mechanism is in a sense the best
possible. Second, we show that the VCG mechanism gives a universal constant
factor approximation when the number of bidders is even only a small multiple
of the number of items. Along the way we point out that Myerson's
characterization of the optimal mechanisms fails to extend to
utility-maximization for risk-averse sellers, and establish interesting
properties of regular distributions and monotone hazard rate distributions.
","[{'version': 'v1', 'created': 'Fri, 12 Feb 2010 06:31:35 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Apr 2010 03:08:43 GMT'}]",2010-04-02,"[['Sundararajan', 'Mukund', ''], ['Yan', 'Qiqi', '']]","['risk-aversion', 'optimal auctions', 'revenue maximization', 'utility']"
14037,1702.03587,Pedro Hecht,Pedro Hecht,"Post-Quantum Cryptography(PQC): Generalized ElGamal Cipher over
  GF(251^8)","6 pages, 6 Tables, 14 Figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Post-Quantum Cryptography (PQC) attempts to find cryptographic protocols
resistant to attacks by means of for instance Shor's polynomial time algorithm
for numerical field problems like integer factorization (IFP) or the discrete
logarithm (DLP). Other aspects are the backdoors discovered in deterministic
random generators or recent advances in solving some instances of DLP. The use
of alternative algebraic structures like non-commutative or non-associative
partial groupoids, magmas, monoids, semigroups, quasigroups or groups, are
valid choices for these new kinds of protocols. In this paper, we focus in an
asymmetric cipher based on a generalized ElGamal non-arbitrated protocol using
a non-commutative general linear group. The developed protocol forces a hard
subgroup membership search problem into a non-commutative structure. The
protocol involves at first a generalized Diffie-Hellman key interchange and
further on the private and public parameters are recursively updated each time
a new cipher session is launched. Security is based on a hard variation of the
Generalized Symmetric Decomposition Problem (GSDP). Working with GF(251^8) a
64-bits security is achieved, and if GF(251^16) is chosen, the security rises
to 127-bits. An appealing feature is that there is no need for big number
libraries as all arithmetic if performed in Z_251 and therefore the new
protocol is particularly useful for computational platforms with very limited
capabilities like smartphones or smartcards.
","[{'version': 'v1', 'created': 'Sun, 12 Feb 2017 22:50:28 GMT'}]",2017-02-14,"[['Hecht', 'Pedro', '']]","['Post-Quantum Cryptography', 'Non-Commutative Cryptography', 'Finite Fields', 'Asymmetric Cryptography', 'Generalized ElGamal Protocol']"
14038,1105.0043,Mandeep Gondara,Mandeep Kaur Gondara and Sanjay Kadam,Requirements of Vertical Handoff Mechanism in 4G Wireless Networks,"10 pages,1 figure,2 tables","International Journal of Wireless & Mobile Networks (IJWMN) Vol.
  3, No. 2, April 2011",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The importance of wireless communication is increasing day by day throughout
the world due to cellular and broadband technologies. Everyone around the world
would like to be connected seamlessly anytime anywhere through the best
network. The 4G wireless system must have the capability to provide high data
transfer rates, quality of services and seamless mobility. In 4G, there are a
large variety of heterogeneous networks. The users for variety of applications
would like to utilize heterogeneous networks on the basis of their preferences
such as real time, high availability and high bandwidth. When connections have
to switch between heterogeneous networks for performance and high availability
reasons, seamless vertical handoff is necessary. The requirements like
capability of the network, handoff latency, network cost, network conditions,
power consumption and user's preferences must be taken into consideration
during vertical handoff. In this paper, we have extracted the requirements of a
vertical handoff from the literature surveyed. The evaluation of the existing
work is also being done on the basis of required parameters for vertical
handoff. A sophisticated, adaptive and intelligent approach is required to
implement the vertical handoff mechanism in 4G wireless networks to produce an
effective service for the user by considering dynamic and non dynamic
parameters.
","[{'version': 'v1', 'created': 'Sat, 30 Apr 2011 03:37:55 GMT'}]",2011-05-03,"[['Gondara', 'Mandeep Kaur', ''], ['Kadam', 'Sanjay', '']]","['4G wireless networks', 'VHO', 'Requirements', 'RSS', 'Parameters', 'Performance']"
14039,1206.2082,Reza Bosagh Zadeh,"Reza Bosagh Zadeh, Ashish Goel",Dimension Independent Similarity Computation,,,,,cs.DS cs.AI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a suite of algorithms for Dimension Independent Similarity
Computation (DISCO) to compute all pairwise similarities between very high
dimensional sparse vectors. All of our results are provably independent of
dimension, meaning apart from the initial cost of trivially reading in the
data, all subsequent operations are independent of the dimension, thus the
dimension can be very large. We study Cosine, Dice, Overlap, and the Jaccard
similarity measures. For Jaccard similiarity we include an improved version of
MinHash. Our results are geared toward the MapReduce framework. We empirically
validate our theorems at large scale using data from the social networking site
Twitter. At time of writing, our algorithms are live in production at
twitter.com.
","[{'version': 'v1', 'created': 'Mon, 11 Jun 2012 02:19:27 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Nov 2012 04:40:52 GMT'}, {'version': 'v3', 'created': 'Tue, 2 Apr 2013 03:54:28 GMT'}, {'version': 'v4', 'created': 'Thu, 23 May 2013 07:56:18 GMT'}]",2013-05-24,"[['Zadeh', 'Reza Bosagh', ''], ['Goel', 'Ashish', '']]","['Cosine', 'Jaccard', 'Overlap', 'Dice', 'Similarity', 'MapReduce', 'Dimension Independent']"
14040,1603.05347,Thanh Long Vu Dr,Thanh Long Vu and Konstantin Turitsyn,"A Hierarchical Approach to Stability Assessment of Large Scale
  Interconnected Networks",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interconnected networks describe the dynamics of important systems in a wide
range such as biological systems and electrical power grids. Some important
features of these systems were successfully studied and understood through
simplified model of linear interconnection of linear subsystems, where provably
global properties, e.g. global convergence to a specific state, usually hold
true. However, in severely disturbed conditions many of those systems exhibit
strongly nonlinear behaviour. Particularly, multiple equilibrium points may
coexist and make the dynamical behavior of the system difficult to predict.
Aiming at understanding the fragility of interconnected systems, we will
provide a hierarchical framework to assess the metastability and resilience of
such systems. This framework is based on independently characterizing stability
of individual subsystems when they are uncoupled from the network, and then
enforcing the diagonal dominance property on a structure matrix capturing the
subsystems stability and the input-to-output gains of interconnection network.
Since the subsystems are usually of low order and the structure matrix has size
equal to the number of subsystems, this framework is easy to implement and thus
scalable to large scale interconnected systems. Possible application of this
framework in assessing stability of microgrids will be discussed at the end of
this paper.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2016 03:14:34 GMT'}]",2016-03-18,"[['Vu', 'Thanh Long', ''], ['Turitsyn', 'Konstantin', '']]","['Interconnected network', 'hierarchy', 'fragility', 'resilience']"
14041,1606.02903,Bernhard Rumpe,"Timo Greifenberg and Klaus M\""uller and Alexander Roth and Bernhard
  Rumpe and Christoph Schulze and Andreas Wortmann","Modeling Variability in Template-based Code Generators for Product Line
  Engineering","16 pages, 3 figures, Modellierung 2016 Conference",Modellierung 2016 Conference,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generating software from abstract models is a prime activity in
model-drivenengineering. Adaptable and extendable code generators are important
to address changing technologies as well as user needs. However, theyare less
established, as variability is often designed as configuration options of
monolithic systems. Thus, code generation is often tied to a fixed set of
features, hardly reusable in different contexts, and without means for
configuration of variants. In this paper,we present an approach for developing
product lines of template-based code generators. This approach applies concepts
from feature-oriented programming to make variability explicit and manageable.
Moreover, it relies on explicit variability regions (VR) in a code generators
templates, refinements of VRs, and the aggregation of templates and refinements
into reusable layers. Aconcrete product is defined by selecting one or multiple
layers. If necessary, additional layers required due to VR refinements are
automatically selected.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2016 10:47:43 GMT'}]",2016-06-10,"[['Greifenberg', 'Timo', ''], ['Müller', 'Klaus', ''], ['Roth', 'Alexander', ''], ['Rumpe', 'Bernhard', ''], ['Schulze', 'Christoph', ''], ['Wortmann', 'Andreas', '']]","['Model-Driven Engineering', 'Code Generator Development', 'Variability Modeling']"
14042,1501.02336,Chandrakana Nandi,"Chandrakana Nandi, Aurelien Monot, Manuel Oriol","Stochastic Contracts for Runtime Checking of Component-based Real-time
  Systems","6 pages, 4 figures",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a new technique for dynamic verification of
component-based real-time systems based on statistical inference. Verifying
such systems requires checking two types of properties: functional and
real-time. For functional properties, a standard approach for ensuring
correctness is Design by Contract: annotating programs with executable pre- and
postconditions. We extend contracts for specifying real-time properties. In the
industry, components are often bought from vendors and meant to be used
off-the-shelf which makes it very difficult to determine their execution times
and express related properties. We present a solution to this problem by using
statistical inference for estimating the properties. The contract framework
allows application developers to express contracts like ""the execution time of
component $X$ lies within $\gamma$ standard deviations from the mean execution
time"". Experiments based on industrial case studies show that this framework
can be smoothly integrated into existing control applications, thereby
increasing their reliability while having an acceptable execution time overhead
(less than 10%).
","[{'version': 'v1', 'created': 'Sat, 10 Jan 2015 11:22:06 GMT'}]",2015-01-13,"[['Nandi', 'Chandrakana', ''], ['Monot', 'Aurelien', ''], ['Oriol', 'Manuel', '']]","['Design by Contract', 'runtime verification', 'real-time systems', 'statistical inference', 'component-based engineering']"
14043,1606.04157,Guohui Lin,"Wenchang Luo, Yao Xu, Weitian Tong, Guohui Lin",Single machine scheduling with job-dependent machine deterioration,15 pages,"Proceedings of ISAAC 2016, LIPIcs55, pages 1-13",,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the single machine scheduling problem with job-dependent machine
deterioration. In the problem, we are given a single machine with an initial
non-negative maintenance level, and a set of jobs each with a non-preemptive
processing time and a machine deterioration. Such a machine deterioration
quantifies the decrement in the machine maintenance level after processing the
job. To avoid machine breakdown, one should guarantee a non-negative
maintenance level at any time point; and whenever necessary, a maintenance
activity must be allocated for restoring the machine maintenance level. The
goal of the problem is to schedule the jobs and the maintenance activities such
that the total completion time of jobs is minimized. There are two variants of
maintenance activities: in the partial maintenance case each activity can be
allocated to increase the machine maintenance level to any level not exceeding
the maximum; in the full maintenance case every activity must be allocated to
increase the machine maintenance level to the maximum. In a recent work, the
problem in the full maintenance case has been proven NP-hard; several special
cases of the problem in the partial maintenance case were shown solvable in
polynomial time, but the complexity of the general problem is left open. In
this paper we first prove that the problem in the partial maintenance case is
NP-hard, thus settling the open problem; we then design a $2$-approximation
algorithm.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2016 22:21:04 GMT'}]",2017-02-23,"[['Luo', 'Wenchang', ''], ['Xu', 'Yao', ''], ['Tong', 'Weitian', ''], ['Lin', 'Guohui', '']]","['Scheduling', 'machine deterioration', 'maintenance', 'NP-hard', 'approximation algorithm']"
14044,0910.2285,Guoqiang Zhang,"Guoqing Zhang, Shi Zhou, Di Wang, Gang Yan, Guoqiang Zhang","Enhancing network transmission capacity by efficiently allocating node
  capability","9 pages, 2 figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A network's transmission capacity is the maximal rate of traffic inflow that
the network can handle without causing congestion. Here we study how to enhance
this quantity by redistributing the capability of individual nodes while
preserving the total sum of node capability. We propose a practical and
effective node-capability allocation scheme which allocates a node's capability
based on the local knowledge of the node's connectivity. We show the scheme
enhances the transmission capacity by two orders of magnitude for networks with
heterogenous structures.
","[{'version': 'v1', 'created': 'Tue, 13 Oct 2009 02:03:08 GMT'}]",2009-10-14,"[['Zhang', 'Guoqing', ''], ['Zhou', 'Shi', ''], ['Wang', 'Di', ''], ['Yan', 'Gang', ''], ['Zhang', 'Guoqiang', '']]","['Networks', 'transmission capacity', 'traffic flow simulation', 'network modeling', 'network topology', 'betweenness']"
14045,1304.0913,Morteza Ansarinia,"Ahmad Salahi, Morteza Ansarinia",Predicting Network Attacks Using Ontology-Driven Inference,9 pages,"International Journal of Information and Communication Technology
  (IJICT), Volume 4, Issue 1, 2012",,,cs.AI cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph knowledge models and ontologies are very powerful modeling and re
asoning tools. We propose an effective approach to model network attacks and
attack prediction which plays important roles in security management. The goals
of this study are: First we model network attacks, their prerequisites and
consequences using knowledge representation methods in order to provide
description logic reasoning and inference over attack domain concepts. And
secondly, we propose an ontology-based system which predicts potential attacks
using inference and observing information which provided by sensory inputs. We
generate our ontology and evaluate corresponding methods using CAPEC, CWE, and
CVE hierarchical datasets. Results from experiments show significant capability
improvements comparing to traditional hierarchical and relational models.
Proposed method also reduces false alarms and improves intrusion detection
effectiveness.
","[{'version': 'v1', 'created': 'Wed, 3 Apr 2013 11:04:38 GMT'}]",2013-04-04,"[['Salahi', 'Ahmad', ''], ['Ansarinia', 'Morteza', '']]","['Knowledge Engineering', 'Network Security', 'Ontology']"
14046,0907.5443,R Doomun,"H S Guruprasad, H D Maheshappa","Dynamic Bandwidth Management in Distributed VoD based on the User Class
  Using Agents","7 pages, International Journal of Computer Science and Information
  Security, ISSN 1947 5500, Impact Factor 0.423","International Journal of Computer Science and Information
  Security, IJCSIS, July 2009, Volume 3. No.1, USA",,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a dynamic bandwidth management algorithm in which more
bandwidth is allocated for higher class users and also higher priority is given
to the videos with higher popularity within a class using agent technology. The
popularity and weight profile of the videos which is used for efficiently
allocating bandwidth is periodically updated by a mobile agent. The proposed
approach allocates more bandwidth for higher class users and gives higher
priority for higher weight videos [popular videos] so that they can be served
with high QoS, reduces the load on the central multimedia server and maximizes
the channel utilization between the neighboring proxy servers and the central
multimedia server and lower video rejection ratio. The simulation results prove
the reduction of load on central multimedia server by load sharing among the
neighboring proxy servers, maximum bandwidth utilization, and more bandwidth
allocation for higher class users.
","[{'version': 'v1', 'created': 'Thu, 30 Jul 2009 22:53:48 GMT'}]",2009-08-03,"[['Guruprasad', 'H S', ''], ['Maheshappa', 'H D', '']]","['Bandwidth management', 'user class', 'mobile agent', 'Distributed VoD  I']"
14047,1301.2200,Tarek Zlitni,Tarek Zlitni and Walid Mahdi,A Visual Grammar Approach for TV Program Identification,"8 pages, 6 figures, (IJCNS) International Journal of Computer and
  Network Security, Vol. 2, No. 9, September 2010",,,,cs.MM cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic identification of TV programs within TV streams is an important
task for archive exploitation. This paper proposes a new spatial-temporal
approach to identify programs in TV streams in two main steps: First, a
reference catalogue for video grammars of visual jingles is constructed. We
exploit visual grammars characterizing instances of the same program type in
order to identify the various program types in the TV stream. The role of video
grammar is to represent the visual invariants for each visual jingle using a
set of descriptors appropriate for each TV program. Secondly, programs in TV
streams are identified by examining the similarity of the video signal to the
visual grammars in the catalogue. The main idea of identification process
consists in comparing the visual similarity of the video signal signature in TV
stream to the catalogue elements. After presenting the proposed approach, the
paper overviews the encouraging experimental results on several streams
extracted from different channels and composed of several programs.
","[{'version': 'v1', 'created': 'Thu, 10 Jan 2013 17:56:02 GMT'}]",2013-01-11,"[['Zlitni', 'Tarek', ''], ['Mahdi', 'Walid', '']]","['Visual grammar', 'TV programs identification', 'TV stream segmentation', 'video signature']"
14048,1304.7820,Jianguo Ding,"Jianguo Ding, Pascal Bouvry",Challenges on Probabilistic Modeling for Evolving Networks,"18 pages. Book chapter. arXiv admin note: text overlap with
  arXiv:1012.0009 by other authors",,,,cs.SI cs.AI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the emerging of new networks, such as wireless sensor networks, vehicle
networks, P2P networks, cloud computing, mobile Internet, or social networks,
the network dynamics and complexity expands from system design, hardware,
software, protocols, structures, integration, evolution, application, even to
business goals. Thus the dynamics and uncertainty are unavoidable
characteristics, which come from the regular network evolution and unexpected
hardware defects, unavoidable software errors, incomplete management
information and dependency relationship between the entities among the emerging
complex networks. Due to the complexity of emerging networks, it is not always
possible to build precise models in modeling and optimization (local and
global) for networks. This paper presents a survey on probabilistic modeling
for evolving networks and identifies the new challenges which emerge on the
probabilistic models and optimization strategies in the potential application
areas of network performance, network management and network security for
evolving networks.
","[{'version': 'v1', 'created': 'Tue, 30 Apr 2013 00:09:28 GMT'}, {'version': 'v2', 'created': 'Sat, 4 May 2013 11:21:35 GMT'}]",2013-05-07,"[['Ding', 'Jianguo', ''], ['Bouvry', 'Pascal', '']]","['network evolution', 'probabilistic modeling', 'dynamics anduncertainty']"
14049,1312.3251,Nayan Jyoti Kalita,"Nayan Jyoti Kalita, Navanath Saharia and Smriti Kumar Sinha",Towards The Development of a Bishnupriya Manipuri Corpus,"5 pages, conference at National Conference on Recent Trends in
  Computer Sciences at Bodoland University, 25th-26th March, 2013",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For any deep computational processing of language we need evidences, and one
such set of evidences is corpus. This paper describes the development of a
text-based corpus for the Bishnupriya Manipuri language. A Corpus is considered
as a building block for any language processing tasks. Due to the lack of
awareness like other Indian languages, it is also studied less frequently. As a
result the language still lacks a good corpus and basic language processing
tools. As per our knowledge this is the first effort to develop a corpus for
Bishnupriya Manipuri language.
","[{'version': 'v1', 'created': 'Wed, 11 Dec 2013 17:24:35 GMT'}]",2013-12-12,"[['Kalita', 'Nayan Jyoti', ''], ['Saharia', 'Navanath', ''], ['Sinha', 'Smriti Kumar', '']]","['Corpus', 'language', 'Bishnupriya Manipuri', 'word analysis', 'word frequency']"
14050,1707.08607,Kevin Xu,Rehan Ahmad and Kevin S. Xu,Effects of Contact Network Models on Stochastic Epidemic Simulations,"To appear at International Conference on Social Informatics (SocInfo)
  2017",,,,cs.SI cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The importance of modeling the spread of epidemics through a population has
led to the development of mathematical models for infectious disease
propagation. A number of empirical studies have collected and analyzed data on
contacts between individuals using a variety of sensors. Typically one uses
such data to fit a probabilistic model of network contacts over which a disease
may propagate. In this paper, we investigate the effects of different contact
network models with varying levels of complexity on the outcomes of simulated
epidemics using a stochastic Susceptible-Infectious-Recovered (SIR) model. We
evaluate these network models on six datasets of contacts between people in a
variety of settings. Our results demonstrate that the choice of network model
can have a significant effect on how closely the outcomes of an epidemic
simulation on a simulated network match the outcomes on the actual network
constructed from the sensor data. In particular, preserving degrees of nodes
appears to be much more important than preserving cluster structure for
accurate epidemic simulations.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 18:59:37 GMT'}]",2017-07-28,"[['Ahmad', 'Rehan', ''], ['Xu', 'Kevin S.', '']]","['network model', 'stochastic epidemic model', 'contact network', 'degree-corrected stochastic block model']"
14051,1007.1268,Huy Nguyen,Huy Nguyen and Deokjai Choi,"Application of Data Mining to Network Intrusion Detection: Classifier
  Selection Model","Presented at The 11th Asia-Pacific Network Operations and Management
  Symposium (APNOMS 2008)",,,,cs.NI cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As network attacks have increased in number and severity over the past few
years, intrusion detection system (IDS) is increasingly becoming a critical
component to secure the network. Due to large volumes of security audit data as
well as complex and dynamic properties of intrusion behaviors, optimizing
performance of IDS becomes an important open problem that is receiving more and
more attention from the research community. The uncertainty to explore if
certain algorithms perform better for certain attack classes constitutes the
motivation for the reported herein. In this paper, we evaluate performance of a
comprehensive set of classifier algorithms using KDD99 dataset. Based on
evaluation results, best algorithms for each attack category is chosen and two
classifier algorithm selection models are proposed. The simulation result
comparison indicates that noticeable performance improvement and real-time
intrusion detection can be achieved as we apply the proposed models to detect
different kinds of network attacks.
","[{'version': 'v1', 'created': 'Thu, 8 Jul 2010 00:23:40 GMT'}]",2010-07-09,"[['Nguyen', 'Huy', ''], ['Choi', 'Deokjai', '']]","['Data mining', 'Machine learning', 'Classifier', 'Network security', 'Intrusion detection', 'Algorithm selection', 'KDD dataset']"
14052,1701.04739,Octavian Suciu,"Rock Stevens, Octavian Suciu, Andrew Ruef, Sanghyun Hong, Michael
  Hicks, Tudor Dumitra\c{s}",Summoning Demons: The Pursuit of Exploitable Bugs in Machine Learning,,,,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Governments and businesses increasingly rely on data analytics and machine
learning (ML) for improving their competitive edge in areas such as consumer
satisfaction, threat intelligence, decision making, and product efficiency.
However, by cleverly corrupting a subset of data used as input to a target's ML
algorithms, an adversary can perturb outcomes and compromise the effectiveness
of ML technology. While prior work in the field of adversarial machine learning
has studied the impact of input manipulation on correct ML algorithms, we
consider the exploitation of bugs in ML implementations. In this paper, we
characterize the attack surface of ML programs, and we show that malicious
inputs exploiting implementation bugs enable strictly more powerful attacks
than the classic adversarial machine learning techniques. We propose a
semi-automated technique, called steered fuzzing, for exploring this attack
surface and for discovering exploitable bugs in machine learning programs, in
order to demonstrate the magnitude of this threat. As a result of our work, we
responsibly disclosed five vulnerabilities, established three new CVE-IDs, and
illuminated a common insecure practice across many machine learning systems.
Finally, we outline several research directions for further understanding and
mitigating this threat.
","[{'version': 'v1', 'created': 'Tue, 17 Jan 2017 15:59:17 GMT'}]",2017-01-18,"[['Stevens', 'Rock', ''], ['Suciu', 'Octavian', ''], ['Ruef', 'Andrew', ''], ['Hong', 'Sanghyun', ''], ['Hicks', 'Michael', ''], ['Dumitraş', 'Tudor', '']]","['Machine learning', 'vulnerability research', 'application security', 'vulnerability exploitation', 'fuzzing']"
14053,0705.1455,Jerome Darmont,"Fadila Bentayeb (ERIC), J\'er\^ome Darmont (ERIC)",Decision tree modeling with relational views,,"LNAI, Vol. 2366 (06/2002) 423-431",,,cs.DB,,"  Data mining is a useful decision support technique that can be used to
discover production rules in warehouses or corporate data. Data mining research
has made much effort to apply various mining algorithms efficiently on large
databases. However, a serious problem in their practical application is the
long processing time of such algorithms. Nowadays, one of the key challenges is
to integrate data mining methods within the framework of traditional database
systems. Indeed, such implementations can take advantage of the efficiency
provided by SQL engines. In this paper, we propose an integrating approach for
decision trees within a classical database system. In other words, we try to
discover knowledge from relational databases, in the form of production rules,
via a procedure embedding SQL queries. The obtained decision tree is defined by
successive, related relational views. Each view corresponds to a given
population in the underlying decision tree. We selected the classical Induction
Decision Tree (ID3) algorithm to build the decision tree. To prove that our
implementation of ID3 works properly, we successfully compared the output of
our procedure with the output of an existing and validated data mining
software, SIPINA. Furthermore, since our approach is tuneable, it can be
generalized to any other similar decision tree-based method.
","[{'version': 'v1', 'created': 'Thu, 10 May 2007 12:25:57 GMT'}]",2007-05-23,"[['Bentayeb', 'Fadila', '', 'ERIC'], ['Darmont', 'Jérôme', '', 'ERIC']]","['Integration', 'Databases', 'Data Mining', 'Decision trees', 'Relational views']"
14054,1506.04776,Jeff Heaton,Jeff Heaton,"Encog: Library of Interchangeable Machine Learning Models for Java and
  C#",,,,,cs.MS cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces the Encog library for Java and C#, a scalable,
adaptable, multiplatform machine learning framework that was 1st released in
2008. Encog allows a variety of machine learning models to be applied to
datasets using regression, classification, and clustering. Various supported
machine learning models can be used interchangeably with minimal recoding.
Encog uses efficient multithreaded code to reduce training time by exploiting
modern multicore processors. The current version of Encog can be downloaded
from http://www.encog.org.
","[{'version': 'v1', 'created': 'Mon, 15 Jun 2015 21:20:06 GMT'}]",2015-06-17,"[['Heaton', 'Jeff', '']]","['java', 'c#', 'neural network', 'support vector machine', 'open source software']"
14055,1802.07023,Gewu Bu,"Gewu Bu, Maria Potop-Butucaru","BAN-GZKP: Optimal Zero Knowledge Proof based Scheme for Wireless Body
  Area Networks",,,,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  BANZKP is the best to date Zero Knowledge Proof (ZKP) based secure
lightweight and energy efficient authentication scheme designed for Wireless
Area Network (WBAN). It is vulnerable to several security attacks such as the
replay attack, Distributed Denial-of-Service (DDoS) attacks at sink and
redundancy information crack. However, BANZKP needs an end-to-end
authentication which is not compliant with the human body postural mobility. We
propose a new scheme BAN-GZKP. Our scheme improves both the security and
postural mobility resilience of BANZKP. Moreover, BAN-GZKP uses only a
three-phase authentication which is optimal in the class of ZKP protocols. To
fix the security vulnerabilities of BANZKP, BAN-GZKP uses a novel random key
allocation and a Hop-by-Hop authentication definition. We further prove the
reliability of our scheme to various attacks including those to which BANZKP is
vulnerable. Furthermore, via extensive simulations we prove that our scheme,
BAN-GZKP, outperforms BANZKP in terms of reliability to human body postural
mobility for various network parameters (end-to-end delay, number of packets
exchanged in the network, number of transmissions). We compared both schemes
using representative convergecast strategies with various transmission rates
and human postural mobility. Finally, it is important to mention that BAN-GZKP
has no additional cost compared to BANZKP in terms memory, computational
complexity or energy consumption.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 09:19:11 GMT'}]",2018-02-21,"[['Bu', 'Gewu', ''], ['Potop-Butucaru', 'Maria', '']]","['Wireless Body Area Network (WBAN)', 'Mobile and wireless security', 'Network performanceanalysis', 'Zero Knowledge Proof (ZKP)']"
14056,1407.5931,Sandeep Kumar,"Sandeep Kumar, Pooja Jadon",A Novel Hybrid Algorithm for Permutation Flow Shop Scheduling,,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the present scenario the recent engineering and industrial built-up units
are facing hodgepodge of problems in a lot of aspects such as machining time,
electricity, man power, raw material and customers constraints. The job-shop
scheduling is one of the most significant industrial behaviours, particularly
in manufacturing planning. This paper proposes the permutation flow shop
sequencing problem with the objective of makespan minimization using the new
modified proposed method of johnsons algorithm as well as the guptas heuristic
algorithm. This paper involves the determination of the order of processing of
n jobs in m machines. Although since the problem is known to be np-hard for
three or more machines, that produces near optimal solution of the given
problem. The proposed method is very simple and easy to understand followed by
a numerical illustration is given.
","[{'version': 'v1', 'created': 'Mon, 21 Jul 2014 16:57:04 GMT'}]",2014-07-23,"[['Kumar', 'Sandeep', ''], ['Jadon', 'Pooja', '']]","['Johnson’s technique', 'gupta’s method', 'optimal sequence', 'flow shop scheduling', 'heuristic', 'makespan']"
14057,1004.0770,Secretary Aircc Journal,"M Prabu Kumar and K Praneesh Kumar Yadav (VIT University, India)",Data security in mobile devices by geo locking,10Pages,"International Journal of Network Security & Its Applications 1.3
  (2009) 52-61",,,cs.CR cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper we present a way of hiding the data in mobile devices from
being compromised. We use two level data hiding technique, where in its first
level data is encrypted and stored in special records and the second level
being a typical password protection scheme. The second level is for secure
access of information from the device. In the first level, encryption of the
data is done using the location coordinates as key. Location Coordinates are
rounded up figures of longitude and latitude information. In the second phase
the password entry differs from conventional schemes. Here we have used the
patterns of traditional Rangoli for specifying the password and gaining access,
thus minimising the chances of data leak in hostile situations. The proposed
structure would be a better trade off in comparison with the previous models
which use Bio Metric authentication -- a relatively costly way of
authentication.
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2010 04:15:13 GMT'}]",2010-07-15,"[['Kumar', 'M Prabu', '', 'VIT University, India'], ['Yadav', 'K Praneesh Kumar', '', 'VIT University, India']]","['Rangoli', 'Encryption', 'Decryption', 'Transposition Cipher', 'Location Coordinates', 'Latitudes', 'Longitudes']"
14058,1609.01893,Ali Ben Ammar,Ali Ben Ammar,Query Optimization Techniques In Graph Databases,,"International Journal of Database Management Systems ( IJDMS )
  Vol.8, No.4, August 2016",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph databases (GDB) have recently been arisen to overcome the limits of
traditional databases for storing and managing data with graph-like structure.
Today, they represent a requirement for many applications that manage
graph-like data, like social networks. Most of the techniques, applied to
optimize queries in graph databases, have been used in traditional databases,
distribution systems... or they are inspired from graph theory. However, their
reuse in graph databases should take care of the main characteristics of graph
databases, such as dynamic structure, highly interconnected data, and ability
to efficiently access data relationships. In this paper, we survey the query
optimization techniques in graph databases. In particular, we focus on the
features they have introduced to improve querying graph-like data.
","[{'version': 'v1', 'created': 'Wed, 7 Sep 2016 09:08:28 GMT'}]",2016-09-08,"[['Ammar', 'Ali Ben', '']]","['Query optimization', 'Graph database', 'Distribution', 'Query decomposition', 'Sketching']"
14059,1301.5943,Lu\'is Filipe Te\'ofilo,"Lu\'is Filipe Te\'ofilo, Luis Paulo Reis","Identifying Player\'s Strategies in No Limit Texas Hold\'em Poker
  through the Analysis of Individual Moves",,,,,cs.AI cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The development of competitive artificial Poker playing agents has proven to
be a challenge, because agents must deal with unreliable information and
deception which make it essential to model the opponents in order to achieve
good results. This paper presents a methodology to develop opponent modeling
techniques for Poker agents. The approach is based on applying clustering
algorithms to a Poker game database in order to identify player types based on
their actions. First, common game moves were identified by clustering all
players\' moves. Then, player types were defined by calculating the frequency
with which the players perform each type of movement. With the given dataset, 7
different types of players were identified with each one having at least one
tactic that characterizes him. The identification of player types may improve
the overall performance of Poker agents, because it helps the agents to predict
the opponent\'s moves, by associating each opponent to a distinct cluster.
","[{'version': 'v1', 'created': 'Fri, 25 Jan 2013 01:49:15 GMT'}]",2013-01-28,"[['Teófilo', 'Luís Filipe', ''], ['Reis', 'Luis Paulo', '']]","['Poker', 'Clustering', 'Opponent Modeling', 'Expectation-maximization']"
14060,1111.6730,M. Aqeel Iqbal Aqeel,"Humaira Farid, Farooque Azam and M. Aqeel Iqbal","Minimizing the Risk of Architectural Decay by using Architecture-Centric
  Evolution Process","12 Pages 8 Figures Journal Paper; International Journal of Computer
  Science, Engineering and Applications (IJCSEA) Vol.1, No.5, October 2011",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software systems endure many noteworthy changes throughout their life-cycle
in order to follow the evolution of the problem domains. Generally, the
software system architecture cannot follow the rapid evolution of a problem
domain which results in the discrepancies between the implemented and designed
architecture. Software architecture illustrates a system's structure and global
properties and consequently determines not only how the system should be
constructed but also leads its evolution. Architecture plays an important role
to ensure that a system satisfies its business and mission goals during
implementation and evolution. However, the capabilities of the designed
architecture may possibly be lost when the implementation does not conform to
the designed architecture. Such a loss of consistency causes the risk of
architectural decay. The architectural decay can be avoided if architectural
changes are made as early as possible. The paper presents the Process Model for
Architecture-Centric Evolution which improves the quality of software systems
through maintaining consistency between designed architecture and
implementation. It also increases architecture awareness of developers which
assists in minimizing the risk of architectural decay. In the proposed approach
consistency checks are performed before and after the change implementation.
","[{'version': 'v1', 'created': 'Tue, 29 Nov 2011 08:54:22 GMT'}]",2011-11-30,"[['Farid', 'Humaira', ''], ['Azam', 'Farooque', ''], ['Iqbal', 'M. Aqeel', '']]","['Software Architecture', 'Software Evolution', 'Architectural Decay', 'Architecture Versioning', 'ArchitectureAssessment']"
14061,1105.0558,Rustam Tagiew,Rustam Tagiew,"If more than Analytical Modeling is Needed to Predict Real Agents'
  Strategic Interaction",,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the research on the interdisciplinary research
infrastructure for understanding human reasoning in game-theoretic terms.
Strategic reasoning is considered to impact human decision making in social,
economical and competitive interactions. The provided introduction explains and
connects concepts from AI, game theory and psychology. First result is a
concept of interdisciplinary game description language as a part of the focused
interdisciplinary research infrastructure. The need of this domain-specific
language is motivated and is aimed to accelerate the current developments. As
second result, the paper provides a summary of ongoing research and its
significance.
","[{'version': 'v1', 'created': 'Tue, 3 May 2011 11:43:36 GMT'}]",2011-05-04,"[['Tagiew', 'Rustam', '']]","['behavioral game theory', 'interdisciplinary researchinfrastructure', 'multi-agent systems', 'domain-specific languages', 'z-Tree', 'GDL-II', 'Gala', 'cognitive architectures']"
14062,1111.6387,Kassimi My Abdellah,My Abdellah Kassimi and Omar El beqqali,3D Model Retrieval Based on Semantic and Shape Indexes,"IJCSI International Journal of Computer Science Issues, Vol. 8, Issue
  3, May 2011",,,,cs.IR cs.AI cs.CV,http://creativecommons.org/licenses/publicdomain/,"  The size of 3D models used on the web or stored in databases is becoming
increasingly high. Then, an efficient method that allows users to find similar
3D objects for a given 3D model query has become necessary. Keywords and the
geometry of a 3D model cannot meet the needs of users' retrieval because they
do not include the semantic information. In this paper, a new method has been
proposed to 3D models retrieval using semantic concepts combined with shape
indexes. To obtain these concepts, we use the machine learning methods to label
3D models by k-means algorithm in measures and shape indexes space. Moreover,
semantic concepts have been organized and represented by ontology language OWL
and spatial relationships are used to disambiguate among models of similar
appearance. The SPARQL query language has been used to question the information
displayed in this language and to compute the similarity between two 3D models.
We interpret our results using the Princeton Shape Benchmark Database and the
results show the performance of the proposed new approach to retrieval 3D
models. Keywords: 3D Model, 3D retrieval, measures, shape indexes, semantic,
ontology
","[{'version': 'v1', 'created': 'Mon, 28 Nov 2011 10:07:41 GMT'}]",2011-11-29,"[['Kassimi', 'My Abdellah', ''], ['beqqali', 'Omar El', '']]","['3D Model', 'Classification', '3D retrieval', 'shape indexes', 'semantic', 'ontology']"
14063,1402.1986,Djallel Bouneffouf,Djallel Bouneffouf,"Recommandation mobile, sensible au contexte de contenus \'evolutifs:
  Contextuel-E-Greedy",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce in this paper an algorithm named Contextuel-E-Greedy that
tackles the dynamicity of the user's content. It is based on dynamic
exploration/exploitation tradeoff and can adaptively balance the two aspects by
deciding which situation is most relevant for exploration or exploitation. The
experimental results demonstrate that our algorithm outperforms surveyed
algorithms.
","[{'version': 'v1', 'created': 'Sun, 9 Feb 2014 20:28:55 GMT'}]",2014-02-11,"[['Bouneffouf', 'Djallel', '']]","['recommender system', 'exploration exploitation', 'machine learning']"
14064,1505.03231,May ElSherif,"Mai ElSherief, Tamer ElBatt, Ahmed Zahran and Ahmed Helmy","An Information-theoretic Model for Knowledge Sharing in Opportunistic
  Social Networks",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we establish fundamental limits on the performance of knowledge
sharing in opportunistic social net- works. In particular, we introduce a novel
information-theoretic model to characterize the performance limits of knowledge
sharing policies. Towards this objective, we first introduce the notions of
knowledge gain and its upper bound, knowledge gain limit, per user. Second, we
characterize these quantities for a number of network topologies and sharing
policies. This work constitutes a first step towards defining and
characterizing the performance limits and trade-offs associated with knowledge
sharing in opportunistic social networks. Finally, we present nu- merical
results characterizing the cumulative knowledge gain over time and its upper
bound, using publicly available smartphone data. The results confirm the key
role of the proposed model to motivate future research in this ripe area of
research as well as new knowledge sharing policies.
","[{'version': 'v1', 'created': 'Wed, 13 May 2015 03:52:44 GMT'}]",2015-05-14,"[['ElSherief', 'Mai', ''], ['ElBatt', 'Tamer', ''], ['Zahran', 'Ahmed', ''], ['Helmy', 'Ahmed', '']]","['Modeling', 'information theory', 'opportunistic socialnetworks', 'fundamental limits', 'numerical results.I']"
14065,1605.02168,Alexander Loboda,"Alexander A. Loboda, Maxim N. Artyomov, Alexey A. Sergushichev","Solving generalized maximum-weight connected subgraph problem for
  network enrichment analysis",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network enrichment analysis methods allow to identify active modules without
being biased towards a priori defined pathways. One of mathematical
formulations of such analysis is a reduction to a maximum-weight connected
subgraph problem. In particular, in analysis of metabolic networks a
generalized maximum-weight connected subgraph (GMWCS) problem, where both nodes
and edges are scored, naturally arises. Here we present the first to our
knowledge practical exact GMWCS solver. We have tested it on real-world
instances and compared to similar solvers. First, the results show that on
node-weighted instances GMWCS solver has a similar performance to the best
solver for that problem. Second, GMWCS solver is faster compared to the closest
analogue when run on GMWCS instances with edge weights.
","[{'version': 'v1', 'created': 'Sat, 7 May 2016 10:32:57 GMT'}]",2016-05-10,"[['Loboda', 'Alexander A.', ''], ['Artyomov', 'Maxim N.', ''], ['Sergushichev', 'Alexey A.', '']]","['network enrichment', 'maximum weight connected subgraphproblem', 'exact solver', 'mixed integer programming']"
14066,1603.01925,Longkun Guo l,"Longkun Guo, Peng Li",On the Complexity of Detecting Constrained Negative Cost Cycles,,,,,cs.CC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a positive integer $k$ and a directed graph with a cost on each edge,
the $k$-length negative cost cycle ($k$\emph{LNCC}) problem is to determine
whether there exists a negative cost cycle with at least $k$ edges, and the
fixed-point \emph{$k$-}length negative cost cycle \emph{trail (FP$k$LNCCT)}
problem is to determine whether there exists a negative trail enrouting a given
vertex (as the fixed point) and containing only cycles with at least $k$ edges.
The $k$\emph{LNCC} problem first emerged in deadlock avoidance in synchronized
streaming computing network \cite{spaa10}, generalizing two famous problems:
negative cycle detection and the $k$-cycle problem. As a warmup by-production,
the paper first shows that \emph{FP$k$LNCCT is }${\cal NP}$-complete in
multigraph\emph{ }even for\emph{ $k=3$} by reducing from the \emph{3SAT}
problem. Then as the main result, we prove the ${\cal NP}$-completeness of
$k$\emph{LNCC} by giving a sophisticated reduction from the 3 Occurrence
3-Satisfiability (\emph{3O3SAT}) problem, a known ${\cal NP}$-complete special
case of 3SAT in which a variable occurs at most three times. The complexity
result is interesting, since polynomial time algorithms are known for both
$2$\emph{LNCC} (essentially no restriction on the value of $k$) and the
$k$-cycle problem of fixed $k$. This paper closes the open problem proposed by
Li et al. in \cite{spaa10} whether $k$\emph{LNCC} admits polynomial-time
algorithms.
","[{'version': 'v1', 'created': 'Mon, 7 Mar 2016 03:53:17 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Feb 2017 17:28:39 GMT'}, {'version': 'v3', 'created': 'Sat, 20 May 2017 03:08:53 GMT'}]",2017-05-23,"[['Guo', 'Longkun', ''], ['Li', 'Peng', '']]","['k-length negative cost cycle', 'NP-complete', '3 occurrence']"
14067,1504.05222,Yangbo Song,Yangbo Song,Social Learning with Endogenous Network Formation,,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  I study the problem of social learning in a model where agents move
sequentially. Each agent receives a private signal about the underlying state
of the world, observes the past actions in a neighborhood of individuals, and
chooses her action attempting to match the true state. Earlier research in this
field emphasizes that herding behavior occurs with a positive probability in
certain special cases; recent studies show that asymptotic learning is
achievable under a more general observation structure. In particular, with
unbounded private beliefs, asymptotic learning occurs if and only if agents
observe a close predecessor, i.e., the action of a close predecessor reveals
the true state in the limit. However, a prevailing assumption in these studies
is that the observation structure in the society is exogenous. In contrast to
most of the previous literature, I assume in this paper that observation is
endogenous and costly. More specifically, each agent must pay a specific cost
to make any observation and can strategically choose the set of actions to
observe privately. I introduce the notion of maximal learning (relative to
cost) as a natural extension of asymptotic learning: society achieves maximal
learning when agents can learn the true state with probability 1 in the limit
after paying the cost of observation. I show that observing only a close
predecessor is no longer sufficient for learning the true state with unbounded
private beliefs and positive costs. Instead, maximal learning occurs if and
only if the size of the observations extends to infinity. I provide interesting
comparative statics as to how various settings in the model affect the learning
probability. For instance, the probability to learn the true state may be
higher under positive costs than under zero cost; in addition, the probability
to learn the true state may be higher under weaker private signals.
","[{'version': 'v1', 'created': 'Mon, 20 Apr 2015 20:37:01 GMT'}, {'version': 'v2', 'created': 'Wed, 11 May 2016 15:48:30 GMT'}]",2016-05-12,"[['Song', 'Yangbo', '']]","['Information aggregation', 'Social earning', 'Network formation', 'Herding', 'Information']"
14068,1312.4917,Pierre Lescanne,Pierre Lescanne (LIP),An exercise on streams: convergence acceleration,,,,,cs.NA cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents convergence acceleration, a method for computing
efficiently the limit of numerical sequences as a typical application of
streams and higher-order functions.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2013 19:53:28 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Mar 2014 19:43:27 GMT'}]",2014-03-04,"[['Lescanne', 'Pierre', '', 'LIP']]","['convergence acceleration', 'streams', 'numerical analysis', 'co-algebra']"
14069,1407.4242,Jorge A. P\'erez,Lu\'is Caires and Jorge A. P\'erez,"A Typeful Characterization of Multiparty Structured Conversations Based
  on Binary Sessions",,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Relating the specification of the global communication behavior of a
distributed system and the specifications of the local communication behavior
of each of its nodes/peers (e.g., to check if the former is realizable by the
latter under some safety and/or liveness conditions) is a challenging problem
addressed in many relevant scenarios. In the context of networked software
services, a widespread programming language-based approach relies on global
specifications defined by session types or behavioral contracts. Static type
checking can then be used to ensure that components follow the prescribed
interaction protocols. In the case of session types, developments have been
mostly framed within quite different type theories for either binary
(two-party) or multiparty (n-party) protocols. Unfortunately, the precise
relationship between analysis techniques for multiparty and binary protocols is
yet to be understood.
  In this work, we bridge this previously open gap in a principled way: we show
that the analysis of multiparty protocols can also be developed within a much
simpler type theory for binary protocols, ensuring protocol fidelity and
deadlock-freedom. We present characterization theorems which provide new
insights on the relation between two existing, yet very differently motivated,
session type systems---one based on linear logic, the other based on automata
theory---and suggest useful type-based verification techniques for multiparty
systems relying on reductions to the binary case.
","[{'version': 'v1', 'created': 'Wed, 16 Jul 2014 09:47:01 GMT'}]",2014-07-17,"[['Caires', 'Luís', ''], ['Pérez', 'Jorge A.', '']]","['Concurrency', 'Behavioral Types', 'Multiparty Communication', 'Linear Logic', 'Session Types', 'Process Calculi']"
14070,1402.3797,Pratik Vinay Gupte,Pratik Vinay Gupte and Balaraman Ravindran,Scalable Positional Analysis for Studying Evolution of Nodes in Networks,"Presented at the workshop on Mining Networks and Graphs: A Big Data
  Analytic Challenge, held in conjunction with the SIAM Data Mining (SDM)
  Conference in April 2014. 13 pages",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In social network analysis, the fundamental idea behind the notion of
position is to discover actors who have similar structural signatures.
Positional analysis of social networks involves partitioning the actors into
disjoint sets using a notion of equivalence which captures the structure of
relationships among actors. Classical approaches to Positional Analysis, such
as Regular equivalence and Equitable Partitions, are too strict in grouping
actors and often lead to trivial partitioning of actors in real world networks.
An Epsilon Equitable Partition (EEP) of a graph, which is similar in spirit to
Stochastic Blockmodels, is a useful relaxation to the notion of structural
equivalence which results in meaningful partitioning of actors. In this paper
we propose and implement a new scalable distributed algorithm based on
MapReduce methodology to find EEP of a graph. Empirical studies on random
power-law graphs show that our algorithm is highly scalable for sparse graphs,
thereby giving us the ability to study positional analysis on very large scale
networks. We also present the results of our algorithm on time evolving
snapshots of the facebook and flickr social graphs. Results show the importance
of positional analysis on large dynamic networks.
","[{'version': 'v1', 'created': 'Sun, 16 Feb 2014 13:09:43 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Jan 2015 18:46:36 GMT'}]",2015-01-21,"[['Gupte', 'Pratik Vinay', ''], ['Ravindran', 'Balaraman', '']]","['ϵ-EquitablePartition', 'StructuralEquivalence', 'Positional Analysis', 'Distributed Graph Partitioning']"
14071,1011.1560,Abdelkader Gouaich,"Ines Di Loreto Ines and Abdelkader Goua\""ich",Mixed Reality Serious Games: The Therapist Perspective,,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The objective of this paper is to present a Mixed Reality System (MRS) for
rehabilitation of the upper limb after stroke. The system answers the following
challenges: (i) increase motivation of patients by making the training a
personalized experience; (ii) take into account patients' impairments by
offering intuitive and easy to use interaction modalities; (iii) make it
possible to therapists to track patient's activities and to evaluate/track
their progress; (iv) open opportunities for telemedicine and tele
rehabilitation; (v) and provide an economically acceptable system by reducing
both equipment and management costs. In order to test this system a pilot study
has been conducted in conjunction with a French hospital in order to understand
the potential and benefits of mixed reality. The pilot involved 3 therapists
who 'played the role' of patients. Three sessions, one using conventional
rehabilitation, another using an ad hoc developed game on a PC, and another
using a mixed reality version of the same game were held. Results have shown
the MRS and the PC game to be accepted more than physical rehabilitation.
","[{'version': 'v1', 'created': 'Sat, 6 Nov 2010 12:58:05 GMT'}]",2010-11-09,"[['Ines', 'Ines Di Loreto', ''], ['Gouaïch', 'Abdelkader', '']]","['Mixed reality', 'Post stroke rehabilitation', 'Serious Games']"
14072,1510.00817,Qi Li,Qi Li,Distributed Parameter Map-Reduce,,,,,cs.DC cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes how to convert a machine learning problem into a series
of map-reduce tasks. We study logistic regression algorithm. In logistic
regression algorithm, it is assumed that samples are independent and each
sample is assigned a probability. Parameters are obtained by maxmizing the
product of all sample probabilities. Rapid expansion of training samples brings
challenges to machine learning method. Training samples are so many that they
can be only stored in distributed file system and driven by map-reduce style
programs. The main step of logistic regression is inference. According to
map-reduce spirit, each sample makes inference through a separate map
procedure. But the premise of inference is that the map procedure holds
parameters for all features in the sample. In this paper, we propose
Distributed Parameter Map-Reduce, in which not only samples, but also
parameters are distributed in nodes of distributed filesystem. Through a series
of map-reduce tasks, we assign each sample parameters for its features, make
inference for the sample and update paramters of the model. The above processes
are excuted looply until convergence. We test the proposed algorithm in actual
hadoop production environment. Experiments show that the acceleration of the
algorithm is in linear relationship with the number of cluster nodes.
","[{'version': 'v1', 'created': 'Sat, 3 Oct 2015 13:12:28 GMT'}]",2015-10-06,"[['Li', 'Qi', '']]","['Distributed Machine Learning', 'Logistic Regression', 'Map-Reduce', 'Hadoop', 'Large-scale Machine Learning']"
14073,1603.04871,Zhicheng Yan,"Zhicheng Yan, Hao Zhang, Yangqing Jia, Thomas Breuel, Yizhou Yu","Combining the Best of Convolutional Layers and Recurrent Layers: A
  Hybrid Network for Semantic Segmentation",14 pages,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  State-of-the-art results of semantic segmentation are established by Fully
Convolutional neural Networks (FCNs). FCNs rely on cascaded convolutional and
pooling layers to gradually enlarge the receptive fields of neurons, resulting
in an indirect way of modeling the distant contextual dependence. In this work,
we advocate the use of spatially recurrent layers (i.e. ReNet layers) which
directly capture global contexts and lead to improved feature representations.
We demonstrate the effectiveness of ReNet layers by building a Naive deep ReNet
(N-ReNet), which achieves competitive performance on Stanford Background
dataset. Furthermore, we integrate ReNet layers with FCNs, and develop a novel
Hybrid deep ReNet (H-ReNet). It enjoys a few remarkable properties, including
full-image receptive fields, end-to-end training, and efficient network
execution. On the PASCAL VOC 2012 benchmark, the H-ReNet improves the results
of state-of-the-art approaches Piecewise, CRFasRNN and DeepParsing by 3.6%,
2.3% and 0.2%, respectively, and achieves the highest IoUs for 13 out of the 20
object classes.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2016 20:10:48 GMT'}]",2016-03-17,"[['Yan', 'Zhicheng', ''], ['Zhang', 'Hao', ''], ['Jia', 'Yangqing', ''], ['Breuel', 'Thomas', ''], ['Yu', 'Yizhou', '']]","['semantic segmentation', 'CNN', 'RNN', 'CRF']"
14074,1606.04648,Liang Pang,"Liang Pang, Yanyan Lan, Jiafeng Guo, Jun Xu, Xueqi Cheng",A Study of MatchPyramid Models on Ad-hoc Retrieval,Neu-IR '16 SIGIR Workshop on Neural Information Retrieval,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks have been successfully applied to many text matching
tasks, such as paraphrase identification, question answering, and machine
translation. Although ad-hoc retrieval can also be formalized as a text
matching task, few deep models have been tested on it. In this paper, we study
a state-of-the-art deep matching model, namely MatchPyramid, on the ad-hoc
retrieval task. The MatchPyramid model employs a convolutional neural network
over the interactions between query and document to produce the matching score.
We conducted extensive experiments to study the impact of different pooling
sizes, interaction functions and kernel sizes on the retrieval performance.
Finally, we show that the MatchPyramid models can significantly outperform
several recently introduced deep matching models on the retrieval task, but
still cannot compete with the traditional retrieval models, such as BM25 and
language models.
","[{'version': 'v1', 'created': 'Wed, 15 Jun 2016 05:39:30 GMT'}]",2016-06-16,"[['Pang', 'Liang', ''], ['Lan', 'Yanyan', ''], ['Guo', 'Jiafeng', ''], ['Xu', 'Jun', ''], ['Cheng', 'Xueqi', '']]","['Deep Matching Models', 'Ranking Models', 'Convolutional Neural Networks']"
14075,1509.09207,Yukiko Yamauchi,"Yukiko Yamauchi, Taichi Uehara, Masafumi Yamashita","Pattern Formation Problem for Synchronous Mobile Robots in the Three
  Dimensional Euclidean Space",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a swarm of autonomous mobile robots each of which is an anonymous
point in the three-dimensional Euclidean space (3D-space) and synchronously
executes a common distributed algorithm. We investigate the pattern formation
problem that requires the robots to form a given target pattern from an initial
configuration and characterize the problem by showing a necessary and
sufficient condition for the robots to form a given target pattern.
  The pattern formation problem in the two dimensional Euclidean space
(2D-space) has been investigated by Suzuki and Yamashita (SICOMP 1999, TCS
2010), and Fujinaga et al. (SICOMP 2015). The symmetricity $\rho(P)$ of a
configuration (i.e., the positions of robots) $P$ is intuitively the order of
the cyclic group that acts on $P$. It has been shown that fully-synchronous
(FSYNC) robots can form a target pattern $F$ from an initial configuration $P$
if and only if $\rho(P)$ divides $\rho(F)$.
  We extend the notion of symmetricity to 3D-space by using the rotation groups
each of which is defined by a set of rotation axes and their arrangement. We
define the symmetricity $\varrho(P)$ of configuration $P$ in 3D-space as the
set of rotation groups that acts on $P$ and whose rotation axes do not contain
any robot. We show the following necessary and sufficient condition for the
pattern formation problem which is a natural extension of the existing results
of the pattern formation problem in 2D-space: FSYNC robots in 3D-space can form
a target pattern $F$ from an initial configuration $P$ if and only if
$\varrho(P) \subseteq \varrho(F)$. For solvable instances, we present a pattern
formation algorithm for oblivious FSYNC robots. The insight of this paper is
that symmetry of mobile robots in 3D-space is sometimes lower than the symmetry
of their positions and the robots can show their symmetry by their movement.
","[{'version': 'v1', 'created': 'Wed, 30 Sep 2015 15:05:06 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Feb 2016 08:33:23 GMT'}]",2016-02-25,"[['Yamauchi', 'Yukiko', ''], ['Uehara', 'Taichi', ''], ['Yamashita', 'Masafumi', '']]","['Mobile robots in the three dimensional Euclidean space', 'pattern formation', 'rotation group', 'symmetry breaking']"
14076,1209.6486,Deepak Garg Dr,Megha Tyagi and Deepak Garg,Comparative Analysis of dynamic graph techniques and data strucutre,,"International Journal of Computer Applications 45(5):41-46, 2012",,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dynamically changing graphs are used in many applications of graph
algorithms. The scope of these graphs are in graphics, communication networks
and in VLSI designs where graphs are subjected to change, such as addition and
deletion of edges and vertices. There is a rich body of the algorithms and data
structures used for dynamic graphs. The paper overview the techniques and data
structures used in various dynamic algorithms. The effort is tried to find out
the comparison in these techniques namely the hierarchical decomposition of
graphs and highlighting the ingenuity used in designing these algorithms.
","[{'version': 'v1', 'created': 'Fri, 28 Sep 2012 11:38:47 GMT'}]",2012-10-01,"[['Tyagi', 'Megha', ''], ['Garg', 'Deepak', '']]","['Dynamic graph algorithm', 'Dynamic graphs', 'Undirected Graph', 'Trees']"
14077,1005.3835,Fei Li,Fei Li,"A Better Memoryless Online Algorithm for FIFO Buffering Packets with Two
  Values",8 pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider scheduling packets with values in a capacity-bounded buffer in an
online setting. In this model, there is a buffer with limited capacity $B$. At
any time, the buffer cannot accommodate more than $B$ packets. Packets arrive
over time. Each packet is associated with a non-negative value. Packets leave
the buffer only because they are either sent or dropped. Those packets that
have left the buffer will not be reconsidered for delivery any more. In each
time step, at most one packet in the buffer can be sent. The order in which the
packets are sent should comply with the order of their arrival time. The
objective is to maximize the total value of the packets sent in an online
manner. In this paper, we study a variant of this FIFO buffering model in which
a packet's value is either 1 or $\alpha > 1$. We present a deterministic
memoryless 1.304-competitive algorithm. This algorithm has the same competitive
ratio as the one presented in (Lotker and Patt-Shamir. PODC 2002, Computer
Networks 2003). However, our algorithm is simpler and does not employ any
marking bits. The idea used in our algorithm is novel and different from all
previous approaches applied for the general model and its variants. We do not
proactively preempt one packet when a new packet arrives. Instead, we may
preempt more than one 1-value packet when the buffer contains sufficiently many
$\alpha$-value packets.
","[{'version': 'v1', 'created': 'Thu, 20 May 2010 20:34:14 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Oct 2010 05:07:47 GMT'}, {'version': 'v3', 'created': 'Mon, 1 Aug 2011 19:07:16 GMT'}]",2011-08-02,"[['Li', 'Fei', '']]","['online algorithm', 'competitive analysis', 'buffer management', 'packet scheduling']"
14078,1403.1694,Anton Petrov A,Anton Petrov,Methods of executable code protection,"11 pages, 5 figures",,,,cs.PL cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The article deals with the problems in constructing a protection system of
executable code. The techniques of breaking the integrity of executable code
and ways to eliminate them are described. The adoption of virtual machine
technology in the context of executable code protection from analysis is
considered. The substantiation of the application of virtual machines as the
best way to oppose the analysis of executable code is made. The protection of
executable code by transferring the protected code in a virtual execution
environment is considered. An efficient implementation of the method is
proposed.
","[{'version': 'v1', 'created': 'Fri, 7 Mar 2014 09:30:38 GMT'}]",2014-03-10,"[['Petrov', 'Anton', '']]","['program code', 'executable code protection', 'virtual machine', 'interpretation', 'disassembling']"
14079,1702.01205,Shumeet Baluja,"Shumeet Baluja, Michele Covell, Rahul Sukthankar","Traffic Lights with Auction-Based Controllers: Algorithms and Real-World
  Data",,,,,cs.AI cs.LG cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real-time optimization of traffic flow addresses important practical
problems: reducing a driver's wasted time, improving city-wide efficiency,
reducing gas emissions and improving air quality. Much of the current research
in traffic-light optimization relies on extending the capabilities of traffic
lights to either communicate with each other or communicate with vehicles.
However, before such capabilities become ubiquitous, opportunities exist to
improve traffic lights by being more responsive to current traffic situations
within the current, already deployed, infrastructure. In this paper, we
introduce a traffic light controller that employs bidding within micro-auctions
to efficiently incorporate traffic sensor information; no other outside sources
of information are assumed. We train and test traffic light controllers on
large-scale data collected from opted-in Android cell-phone users over a period
of several months in Mountain View, California and the River North neighborhood
of Chicago, Illinois. The learned auction-based controllers surpass (in both
the relevant metrics of road-capacity and mean travel time) the currently
deployed lights, optimized static-program lights, and longer-term planning
approaches, in both cities, measured using real user driving data.
","[{'version': 'v1', 'created': 'Fri, 3 Feb 2017 23:44:02 GMT'}]",2017-02-07,"[['Baluja', 'Shumeet', ''], ['Covell', 'Michele', ''], ['Sukthankar', 'Rahul', '']]","['Traffic Lights', 'Traffic Flow', 'Signal Timing', 'Traffic Estimation', 'Adaptive Traffic Management', 'Light ScheduleEstimation', 'Machine Learning', 'Stochastic Search']"
14080,1403.0974,Juli\'an Mestre,Haris Aziz and Juli\'an Mestre,Parametrized Algorithms for Random Serial Dictatorship,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Voting and assignment are two of the most fundamental settings in social
choice theory. For both settings, random serial dictatorship (RSD) is a
well-known rule that satisfies anonymity, ex post efficiency, and
strategyproofness. Recently, it was shown that computing the resulting
probabilities is #P-complete both in the voting and assignment setting. In this
paper, we study RSD from a parametrized complexity perspective. More
specifically, we present efficient algorithms to compute the RSD probabilities
under the condition that the number of agent types, alternatives, or objects is
bounded.
","[{'version': 'v1', 'created': 'Tue, 4 Mar 2014 23:25:44 GMT'}, {'version': 'v2', 'created': 'Fri, 30 May 2014 05:26:41 GMT'}, {'version': 'v3', 'created': 'Mon, 4 Aug 2014 03:38:20 GMT'}]",2014-08-05,"[['Aziz', 'Haris', ''], ['Mestre', 'Julián', '']]","['Social choice theory', 'random serial dictatorship', 'random priority', 'computational complexity', 'assignment setting.JEL C6', 'C7']"
14081,1106.5158,Ciprian Dobre,"Ciprian Dobre, Corina Stratan",MONARC Simulation Framework,"Buletinul Stiintific al Universitatii ""Politehnica"" din Timisoara,
  Romania, Seria Automatica si Calculatoare, Periodica Politechnica,
  Transactions on Automatic Control and Computer Science Vol.49 (63), 2004,
  ISSN 1224-600X Special issue on 3rd Edition of RoEduNet International
  Conference, Timisoara, Romania, 2004",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses the latest generation of the MONARC (MOdels of Networked
Analysis at Regional Centers) simulation framework, as a design and modelling
tool for large scale distributed systems applied to HEP experiments. A
process-oriented approach for discrete event simulation is well-suited for
describing concurrent running programs, as well as the stochastic arrival
patterns that characterize how such systems are used. The simulation engine is
based on Threaded Objects (or Active Objects), which offer great flexibility in
simulating the complex behavior of distributed data processing programs. The
engine provides an appropriate scheduling mechanism for the Active objects with
support for interrupts. This approach offers a natural way of describing
complex running programs that are data dependent and which concurrently compete
for shared resources as well as large numbers of concurrent data transfers on
shared resources. The framework provides a complete set of basic components
(processing nodes, data servers, network components) together with dynamically
loadable decision units (scheduling or data replication modules) for easily
building complex Computing Model simulations. Examples of simulating complex
data processing systems are presented, and the way the framework is used to
compare different decision making algorithms or to optimize the overall Grid
architecture and/or the policies that govern the Grid's use.
","[{'version': 'v1', 'created': 'Sat, 25 Jun 2011 19:40:21 GMT'}]",2011-06-28,"[['Dobre', 'Ciprian', ''], ['Stratan', 'Corina', '']]","['simulation', 'distributed systems', 'architecture validation', 'design models']"
14082,1701.03869,Wenwen Ding,"Wenwen Ding, Kai Liu","Learning Linear Dynamical Systems with High-Order Tensor Data for
  Skeleton based Action Recognition",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, there has been renewed interest in developing methods for
skeleton-based human action recognition. A skeleton sequence can be naturally
represented as a high-order tensor time series. In this paper, we model and
analyze tensor time series with Linear Dynamical System (LDS) which is the most
common for encoding spatio-temporal time-series data in various disciplines dut
to its relative simplicity and efficiency. However, the traditional LDS treats
the latent and observation state at each frame of video as a column vector.
Such a vector representation fails to take into account the curse of
dimensionality as well as valuable structural information with human action.
Considering this fact, we propose generalized Linear Dynamical System (gLDS)
for modeling tensor observation in the time series and employ Tucker
decomposition to estimate the LDS parameters as action descriptors. Therefore,
an action can be represented as a subspace corresponding to a point on a
Grassmann manifold. Then we perform classification using dictionary learning
and sparse coding over Grassmann manifold. Experiments on MSR Action3D Dataset,
UCF Kinect Dataset and Northwestern-UCLA Multiview Action3D Dataset demonstrate
that our proposed method achieves superior performance to the state-of-the-art
algorithms.
","[{'version': 'v1', 'created': 'Sat, 14 Jan 2017 02:07:23 GMT'}]",2017-01-17,"[['Ding', 'Wenwen', ''], ['Liu', 'Kai', '']]","['skeleton joints', 'ARMA model', 'Grassmann manifold', 'dictionary']"
14083,1605.00381,Wataru Hino,"Wataru Hino, Hiroki Kobayashi, Ichiro Hasuo and Bart Jacobs",Healthiness from Duality,"13 pages, Extended version with appendices of a paper accepted to
  LICS 2016",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Healthiness is a good old question in program logics that dates back to
Dijkstra. It asks for an intrinsic characterization of those predicate
transformers which arise as the (backward) interpretation of a certain class of
programs. There are several results known for healthiness conditions: for
deterministic programs, nondeterministic ones, probabilistic ones, etc.
Building upon our previous works on so-called state-and-effect triangles, we
contribute a unified categorical framework for investigating healthiness
conditions. We find the framework to be centered around a dual adjunction
induced by a dualizing object, together with our notion of relative
Eilenberg-Moore algebra playing fundamental roles too. The latter notion seems
interesting in its own right in the context of monads, Lawvere theories and
enriched categories.
","[{'version': 'v1', 'created': 'Mon, 2 May 2016 07:58:04 GMT'}]",2016-05-03,"[['Hino', 'Wataru', ''], ['Kobayashi', 'Hiroki', ''], ['Hasuo', 'Ichiro', ''], ['Jacobs', 'Bart', '']]","['program logic', 'category theory', 'duality']"
14084,1412.8299,Daniel Langr,Daniel Langr and Ivan \v{S}ime\v{c}ek and Pavel Tvrd\'ik,"Loading Large Sparse Matrices Stored in Files in the Adaptive-Blocking
  Hierarchical Storage Format",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The parallel algorithm for loading large sparse matrices from files into
distributed memories of high performance computing (HPC) systems is presented.
This algorithm was designed specially for matrices stored in files in the
space-effcient adaptive-blocking hierarchical storage format (ABHSF). The
algorithm can be used even if matrix storing and loading procedures use a
different number of processes, different matrix-processes mapping, or different
in-memory storage format. The file format based on the utilization of the HDF5
library is described as well. Finally, the presented experimental study
evaluates the proposed algorithm empirically.
","[{'version': 'v1', 'created': 'Mon, 29 Dec 2014 10:38:42 GMT'}]",2014-12-30,"[['Langr', 'Daniel', ''], ['Šimeček', 'Ivan', ''], ['Tvrdík', 'Pavel', '']]","['adaptive-blocking hierarchical storage format', 'high performance computing', 'hierarchical data format', 'loading algorihtm', 'parallel I/O', 'sparse matrix']"
14085,0909.2371,Nevin Vunka Jungum,Payal N. Raj and Prashant B. Swadas,"Dpraodv: A Dyanamic Learning System Against Blackhole Attack in Aodv
  Based Manet","International Journal of Computer Science Issues (IJCSI), Volume 1,
  pp54-59, August 2009","P. N. Raj and P. B. Swadas, ""DPRAODV: A DYANAMIC LEARNING SYSTEM
  AGAINST BLACKHOLE ATTACK IN AODV BASED MANET"", International Journal of
  Computer Science Issues (IJCSI), Volume 1, pp54-59, August 2009",,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security is an essential requirement in mobile ad hoc networks to provide
protected communication between mobile nodes. Due to unique characteristics of
MANETS, it creates a number of consequential challenges to its security design.
To overcome the challenges, there is a need to build a multifence security
solution that achieves both broad protection and desirable network performance.
MANETs are vulnerable to various attacks, blackhole, is one of the possible
attacks. Black hole is a type of routing attack where a malicious node
advertise itself as having the shortest path to all nodes in the environment by
sending fake route reply. By doing this, the malicious node can deprive the
traffic from the source node. It can be used as a denial-of-service attack
where it can drop the packets later. In this paper, we proposed a DPRAODV
(Detection, Prevention and Reactive AODV) to prevent security threats of
blackhole by notifying other nodes in the network of the incident. The
simulation results in ns2 (ver- 2.33) demonstrate that our protocol not only
prevents blackhole attack but consequently improves the overall performance of
(normal) AODV in presence of black hole attack.
","[{'version': 'v1', 'created': 'Sat, 12 Sep 2009 21:10:41 GMT'}]",2009-09-15,"[['Raj', 'Payal N.', ''], ['Swadas', 'Prashant B.', '']]","['MANETs', 'AODV', 'Routing protocol', 'blackhole attack']"
14086,1109.1302,Hakik Paci,"Hakik Paci, Elinda Kajo, Igli Tafa and Aleksander Xhuvani","Adding a new site in an existing Oracle Multimaster replication without
  quiescing the replication","9 pages, 4 figures, in International Journal of Database Management
  Systems (IJDMS) (2011)","International Journal of Database Management Systems (IJDMS),
  Vol.3, No.3, (2011) 58-67",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new solution, which adds a new database server on an
existing Oracle Multimaster Data replication system with Online Instantiation
method. During this time the system is down, because we cannot execute DML
statements on replication objects but we can only make queries. The time for
adding the new database server depends on the number of objects, on the
replication group and on the network conditions. We propose to add a new layer
between replication objects and the database sessions, which contain DML
statements. The layer eliminates the system down time exploiting our developed
packages. The packages will be active only during the addition of a new site
process and will modify all DML statements and queries based on replication
objects.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2011 21:12:33 GMT'}]",2012-09-17,"[['Paci', 'Hakik', ''], ['Kajo', 'Elinda', ''], ['Tafa', 'Igli', ''], ['Xhuvani', 'Aleksander', '']]","['Oracle database', 'dba', 'sessions', 'DML', 'DDL', 'Multimaster Replication']"
14087,1506.04485,Anna Mikhailovich,"V.V. Kochergin (Lomonosov Moscow State University, Faculty of
  Mechanics and Mathematics, Bogoliubov Institute for Theoretical Problems of
  Microphysics), A.V. Mikhailovich (National Research University Higher School
  of Economics)",Some Extensions of the Inversion Complexity of Boolean Functions,5 pages,,,,cs.DM math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The minimum number of NOT gates in a Boolean circuit computing a Boolean
function is called the inversion complexity of the function. In 1957, A. A.
Markov determined the inversion complexity of every Boolean function and proved
that $\lceil\log_{2}(d(f)+1)\rceil$ NOT gates are necessary and sufficient to
compute any Boolean function $f$ (where $d(f)$ is maximum number of value
changes from 1 to 0 over all increasing chains of tuples of variables values).
In this paper we consider Boolean circuits over an arbitrary basis that
consists of all monotone functions (with zero weight) and finite nonempty set
of non-monotone functions (with unit weight). It is shown that the minimal
sufficient for a realization of the Boolean function $f$ number of non-monotone
gates is equal to $\lceil\log_{2}(d(f)+1)\rceil - O(1)$. Similar extends of
another classical result of A. A. Markov for the inversion complexity of system
of Boolean functions has been obtained.
","[{'version': 'v1', 'created': 'Mon, 15 Jun 2015 06:04:24 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Jun 2015 00:08:32 GMT'}, {'version': 'v3', 'created': 'Mon, 31 Aug 2015 12:36:21 GMT'}]",2015-09-01,"[['Kochergin', 'V. V.', '', 'Lomonosov Moscow State University, Faculty of\n  Mechanics and Mathematics, Bogoliubov Institute for Theoretical Problems of\n  Microphysics'], ['Mikhailovich', 'A. V.', '', 'National Research University Higher School\n  of Economics']]","['Boolean function complexity', 'circuit complexity', 'Boolean circuit complexity', 'inversion complexity', 'Markov’s theorem']"
14088,1108.3915,Tien Tuan Anh Dinh,Dinh Tien Tuan Anh and Wang Wenqiang and Anwitaman Datta,"City on the Sky: Flexible, Secure Data Sharing on the Cloud",,,,,cs.DB cs.NI,http://creativecommons.org/licenses/by/3.0/,"  Sharing data from various sources and of diverse kinds, and fusing them
together for sophisticated analytics and mash-up applications are emerging
trends, and are prerequisites for grand visions such as that of cyber-physical
systems enabled smart cities. Cloud infrastructure can enable such data sharing
both because it can scale easily to an arbitrary volume of data and computation
needs on demand, as well as because of natural collocation of diverse such data
sets within the infrastructure. However, in order to convince data owners that
their data are well protected while being shared among cloud users, the cloud
platform needs to provide flexible mechanisms for the users to express the
constraints (access rules) subject to which the data should be shared, and
likewise, enforce them effectively. We study a comprehensive set of practical
scenarios where data sharing needs to be enforced by methods such as
aggregation, windowed frame, value constrains, etc., and observe that existing
basic access control mechanisms do not provide adequate flexibility to enable
effective data sharing in a secure and controlled manner. In this paper, we
thus propose a framework for cloud that extends popular XACML model
significantly by integrating flexible access control decisions and data access
in a seamless fashion. We have prototyped the framework and deployed it on
commercial cloud environment for experimental runs to test the efficacy of our
approach and evaluate the performance of the implemented prototype.
","[{'version': 'v1', 'created': 'Fri, 19 Aug 2011 08:46:28 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Aug 2011 03:44:11 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Sep 2011 19:01:12 GMT'}]",2011-09-22,"[['Anh', 'Dinh Tien Tuan', ''], ['Wenqiang', 'Wang', ''], ['Datta', 'Anwitaman', '']]","['cloud computing', 'access control', 'flexible sharing', 'fine-grained policies', 'XACML']"
14089,1307.6765,Nadine Rons,"Lucy Amez, Nadine Rons","Composing a Publication List for Individual Researcher Assessment by
  Merging Information from Different Sources",3 pages,"Book of Abstracts, 10th International Conference on Science and
  Technology Indicators, Vienna, Austria, 17-20 September 2008, 435-437",,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Citation and publication profiles are gaining importance for the evaluation
of top researchers when it comes to the appropriation of funding for excellence
programs or career promotion judgments. Indicators like the Normalized Mean
Citation Rate, the hindex or other distinguishing measures are increasingly
used to picture the characteristics of individual scholars. Using bibliometric
techniques for individual assessment is known to be particularly delicate, as
the chance of errors being averaged away becomes smaller whereas a minor
incompleteness can have a significant influence on the evaluation outcome. The
quality of the data becomes as such crucial to the legitimacy of the methods
used.
","[{'version': 'v1', 'created': 'Thu, 25 Jul 2013 14:57:55 GMT'}]",2013-07-26,"[['Amez', 'Lucy', ''], ['Rons', 'Nadine', '']]","['Individual assessment', 'bibliometrics', 'data quality', 'merging of information', 'linguistics']"
14090,1412.3670,Sagar Jha,"Devendra Bhave, Sagar Jha, Shankara Narayanan Krishna, Sven Schewe,
  Ashutosh Trivedi",Bounded-Rate Multi-Mode Systems Based Motion Planning,"14 pages, 12 figures, HSCC - 2015",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bounded-rate multi-mode systems are hybrid systems that can switch among a
finite set of modes. Its dynamics is specified by a finite number of
real-valued variables with mode-dependent rates that can vary within given
bounded sets. Given an arbitrary piecewise linear trajectory, we study the
problem of following the trajectory with arbitrary precision, using motion
primitives given as bounded-rate multi-mode systems. We give an algorithm to
solve the problem and show that the problem is co-NP complete. We further prove
that the problem can be solved in polynomial time for multi-mode systems with
fixed dimension. We study the problem with dwell-time requirement and show the
decidability of the problem under certain positivity restriction on the rate
vectors. Finally, we show that introducing structure to the multi-mode systems
leads to undecidability, even when using only a single clock variable.
","[{'version': 'v1', 'created': 'Tue, 9 Dec 2014 19:26:03 GMT'}]",2014-12-12,"[['Bhave', 'Devendra', ''], ['Jha', 'Sagar', ''], ['Krishna', 'Shankara Narayanan', ''], ['Schewe', 'Sven', ''], ['Trivedi', 'Ashutosh', '']]","['Switched Systems', 'Motion Planning', 'Hybrid Automata']"
14091,1602.07120,Sivan Sabato,Sivan Sabato,Submodular Learning and Covering with Response-Dependent Costs,,"S. Sabato, ""Submodular Learning and Covering with
  Response-Dependent Costs "", Theoretical Computer Science, 742:98--113, 2018",,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider interactive learning and covering problems, in a setting where
actions may incur different costs, depending on the response to the action. We
propose a natural greedy algorithm for response-dependent costs. We bound the
approximation factor of this greedy algorithm in active learning settings as
well as in the general setting. We show that a different property of the cost
function controls the approximation factor in each of these scenarios. We
further show that in both settings, the approximation factor of this greedy
algorithm is near-optimal among all greedy algorithms. Experiments demonstrate
the advantages of the proposed algorithm in the response-dependent cost
setting.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2016 11:20:37 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Aug 2016 12:10:15 GMT'}, {'version': 'v3', 'created': 'Sun, 18 Nov 2018 12:25:25 GMT'}]",2018-11-21,"[['Sabato', 'Sivan', '']]","['Interactive learning', 'submodular functions', 'outcome costs']"
14092,1401.0092,Shraddha Shinde,Shraddha S. Shinde and Prof. Anagha P. Khedkar,A Novel Approach For Generating Face Template Using Bda,"11 pages, ITCSE 2013 conference",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In identity management system, commonly used biometric recognition system
needs attention towards issue of biometric template protection as far as more
reliable solution is concerned. In view of this biometric template protection
algorithm should satisfy security, discriminability and cancelability. As no
single template protection method is capable of satisfying the basic
requirements, a novel technique for face template generation and protection is
proposed. The novel approach is proposed to provide security and accuracy in
new user enrollment as well as authentication process. This novel technique
takes advantage of both the hybrid approach and the binary discriminant
analysis algorithm. This algorithm is designed on the basis of random
projection, binary discriminant analysis and fuzzy commitment scheme. Three
publicly available benchmark face databases are used for evaluation. The
proposed novel technique enhances the discriminability and recognition accuracy
by 80% in terms of matching score of the face images and provides high
security.
","[{'version': 'v1', 'created': 'Tue, 31 Dec 2013 04:48:43 GMT'}]",2014-01-03,"[['Shinde', 'Shraddha S.', ''], ['Khedkar', 'Prof. Anagha P.', '']]","['Cancelability', 'discriminability', 'revocability', 'fuzzy commitment']"
14093,1207.5747,Evangelia Kokolaki,"Evangelia Kokolaki, Merkouris Karaliopoulos, Ioannis Stavrakakis",Leveraging information in vehicular parking games,,,,,cs.GT cs.NI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our paper approaches the parking assistance service in urban environments as
an instance of service provision in non-cooperative network environments. We
propose normative abstractions for the way drivers pursue parking space and the
way they respond to partial or complete information for parking demand and
supply as well as specific pricing policies on public and private parking
facilities. The drivers are viewed as strategic agents who make rational
decisions attempting to minimize the cost of the acquired parking spot. We
formulate the resulting games as resource selection games and derive their
equilibria under different expressions of uncertainty about the overall parking
demand. The efficiency of the equilibrium states is compared against the
optimal assignment that could be determined by a centralized entity and
conditions are derived for minimizing the related price of anarchy value. Our
results provide useful hints for the pricing and practical management of
on-street and private parking resources. More importantly, they exemplify
counterintuitive less-is-more effects about the way information availability
modulates the service cost, which underpin general competitive service
provision settings and contribute to the better understanding of effective
information mechanisms.
","[{'version': 'v1', 'created': 'Tue, 24 Jul 2012 17:01:25 GMT'}]",2012-07-25,"[['Kokolaki', 'Evangelia', ''], ['Karaliopoulos', 'Merkouris', ''], ['Stavrakakis', 'Ioannis', '']]","['Parking assistance service', 'vehicular networks', 'parkinggames', 'uncertainty', 'price of anarchy']"
14094,1301.0302,Paulo Shakarian,"Paulo Shakarian, Gerardo I. Simari, Robert Schroeder","MANCaLog: A Logic for Multi-Attribute Network Cascades (Technical
  Report)",,,,,cs.AI cs.LO cs.MA cs.SI physics.soc-ph,http://creativecommons.org/licenses/publicdomain/,"  The modeling of cascade processes in multi-agent systems in the form of
complex networks has in recent years become an important topic of study due to
its many applications: the adoption of commercial products, spread of disease,
the diffusion of an idea, etc. In this paper, we begin by identifying a
desiderata of seven properties that a framework for modeling such processes
should satisfy: the ability to represent attributes of both nodes and edges, an
explicit representation of time, the ability to represent non-Markovian
temporal relationships, representation of uncertain information, the ability to
represent competing cascades, allowance of non-monotonic diffusion, and
computational tractability. We then present the MANCaLog language, a formalism
based on logic programming that satisfies all these desiderata, and focus on
algorithms for finding minimal models (from which the outcome of cascades can
be obtained) as well as how this formalism can be applied in real world
scenarios. We are not aware of any other formalism in the literature that meets
all of the above requirements.
","[{'version': 'v1', 'created': 'Wed, 2 Jan 2013 20:01:04 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Jan 2013 01:54:12 GMT'}]",2013-01-22,"[['Shakarian', 'Paulo', ''], ['Simari', 'Gerardo I.', ''], ['Schroeder', 'Robert', '']]","['Complex Networks', 'Cascades', 'Logic Programming']"
14095,1004.3262,Meenakshi Lakshmanan,"N. Rama, Meenakshi Lakshmanan",A Computational Algorithm for Metrical Classification of Verse,"IJCSI, Volume 7, Issue 2, March 2010, International Journal of
  Computer Science Issues online at
  http://ijcsi.org/articles/A-Computational-Algorithm-for-Metrical-Classification-of-Verse.php",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The science of versification and analysis of verse in Sanskrit is governed by
rules of metre or chandas. Such metre-wise classification of verses has
numerous uses for scholars and researchers alike, such as in the study of poets
and their style of Sanskrit poetical works. This paper presents a comprehensive
computational scheme and set of algorithms to identify the metre of verses
given as Sanskrit (Unicode) or English E-text (Latin Unicode). The paper also
demonstrates the use of euphonic conjunction rules to correct verses in which
these conjunctions, which are compulsory in verse, have erroneously not been
implemented.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2010 17:58:21 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Apr 2010 20:07:43 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Sep 2014 18:34:43 GMT'}]",2014-09-16,"[['Rama', 'N.', ''], ['Lakshmanan', 'Meenakshi', '']]","['Sanskrit', 'verse', 'hashing', 'metre', 'chandas', 'metrical classification', 'sandhi']"
14096,1111.5135,Nithyanandam Subramanian,"S. Nithyanandam, K. S. Gayathri, P. L. K. Priyadarshini","A New IRIS Normalization Process For Recognition System With
  Cryptographic Techniques","7 Pages,16 Figures; ISSN (Online): 1694-0814","IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 4, No 1, 2011, 342-348",,,cs.CV cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Biometric technologies are the foundation of personal identification systems.
It provides an identification based on a unique feature possessed by the
individual. This paper provides a walkthrough for image acquisition,
segmentation, normalization, feature extraction and matching based on the Human
Iris imaging. A Canny Edge Detection scheme and a Circular Hough Transform, is
used to detect the iris boundaries in the eye's digital image. The extracted
IRIS region was normalized by using Image Registration technique. A phase
correlation base method is used for this iris image registration purpose. The
features of the iris region is encoded by convolving the normalized iris region
with 2D Gabor filter. Hamming distance measurement is used to compare the
quantized vectors and authenticate the users. To improve the security,
Reed-Solomon technique is employed directly to encrypt and decrypt the data.
Experimental results show that our system is quite effective and provides
encouraging performance. Keywords: Biometric, Iris Recognition, Phase
correlation, cryptography, Reed-Solomon
","[{'version': 'v1', 'created': 'Tue, 22 Nov 2011 09:38:39 GMT'}]",2011-11-23,"[['Nithyanandam', 'S.', ''], ['Gayathri', 'K. S.', ''], ['Priyadarshini', 'P. L. K.', '']]","['Biometric', 'Iris Recognition', 'Phase correlation', 'cryptography', 'Reed-Solomon']"
14097,1212.2671,Ignacio Algredo-Badillo Dr.,"Ernesto Cort\'es P\'erez, Ignacio Algredo-Badillo, V\'ictor Hugo
  Garc\'ia Rodr\'iguez",Performance Analysis of ANFIS in short term Wind Speed Prediction,"9 pages, 11 figures, 1 table; IJCSI International Journal of Computer
  Science Issues, Vol. 9, Issue 5, No 3, September 2012. ISSN (Online):
  1694-0814. www.IJCSI.org",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Results are presented on the performance of Adaptive Neuro-Fuzzy Inference
system (ANFIS) for wind velocity forecasts in the Isthmus of Tehuantepec region
in the state of Oaxaca, Mexico. The data bank was provided by the
meteorological station located at the University of Isthmus, Tehuantepec
campus, and this data bank covers the period from 2008 to 2011. Three data
models were constructed to carry out 16, 24 and 48 hours forecasts using the
following variables: wind velocity, temperature, barometric pressure, and date.
The performance measure for the three models is the mean standard error (MSE).
In this work, performance analysis in short-term prediction is presented,
because it is essential in order to define an adequate wind speed model for
eolian parks, where a right planning provide economic benefits.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2012 22:48:36 GMT'}]",2012-12-13,"[['Pérez', 'Ernesto Cortés', ''], ['Algredo-Badillo', 'Ignacio', ''], ['Rodríguez', 'Víctor Hugo García', '']]","['Wind', 'fuzzy', 'neural', 'ANFIS', 'prediction']"
14098,0908.1033,R Doomun,"Kamalesh V.N, S. K. Srivatsa","Topological design of minimum cost survivable computer communication
  networks, Bipartite Graph Method","5 Pages, International Journal of Computer Science and Information
  Security, IJCSIS July 2009, ISSN 1947 5500, Impact Factor 0.423","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 3, No. 1, July 2009, USA",,ISSN 1947 5500,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A good computer network is hard to disrupt. It is desired that the computer
communication network remains connected even when some of the links or nodes
fail. Since the communication links are expensive, one wants to achieve these
goals with fewer links. The computer communication network is fault tolerant if
it has alternative paths between vertices, the more disjoint paths, the better
is the survivability. This paper presents a method for generating k-connected
computer communication network with optimal number of links using bipartite
graph concept.
","[{'version': 'v1', 'created': 'Fri, 7 Aug 2009 12:37:26 GMT'}]",2009-08-10,"[['N', 'Kamalesh V.', ''], ['Srivatsa', 'S. K.', '']]","['; computer network', 'link deficit algorithm', 'wireless network', 'k-connected networks', 'survivable network', 'bipartite graph']"
14099,1206.3078,Saurabh  Pal,Saurabh Pal,"Mining Educational Data Using Classification to Decrease Dropout Rate of
  Students","5 pages. arXiv admin note: substantial text overlap with
  arXiv:1203.2987, arXiv:1203.3832, arXiv:1202.4815, arXiv:1201.3418,
  arXiv:1201.3417, and with arXiv:1002.1144 by other authors","International journal of multidisciplinary sciences and
  engineering, vol. 3, no. 5, May 2012, 35-39",,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last two decades, number of Higher Education Institutions (HEI) grows
rapidly in India. Since most of the institutions are opened in private mode
therefore, a cut throat competition rises among these institutions while
attracting the student to got admission. This is the reason for institutions to
focus on the strength of students not on the quality of education. This paper
presents a data mining application to generate predictive models for
engineering student's dropout management. Given new records of incoming
students, the predictive model can produce short accurate prediction list
identifying students who tend to need the support from the student dropout
program most. The results show that the machine learning algorithm is able to
establish effective predictive model from the existing student dropout data.
","[{'version': 'v1', 'created': 'Thu, 14 Jun 2012 12:10:23 GMT'}]",2012-06-15,"[['Pal', 'Saurabh', '']]","['Data Mining', 'Machine Learning Algorithms', 'Dropout Management', 'Predictive Models']"
14100,0804.0924,Ratthachat Chatpatanasiri,Ratthachat Chatpatanasiri and Boonserm Kijsirikul,"A Unified Semi-Supervised Dimensionality Reduction Framework for
  Manifold Learning","22 pages, 9 figures",,,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a general framework of semi-supervised dimensionality reduction
for manifold learning which naturally generalizes existing supervised and
unsupervised learning frameworks which apply the spectral decomposition.
Algorithms derived under our framework are able to employ both labeled and
unlabeled examples and are able to handle complex problems where data form
separate clusters of manifolds. Our framework offers simple views, explains
relationships among existing frameworks and provides further extensions which
can improve existing algorithms. Furthermore, a new semi-supervised
kernelization framework called ``KPCA trick'' is proposed to handle non-linear
problems.
","[{'version': 'v1', 'created': 'Sun, 6 Apr 2008 18:14:34 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jul 2009 04:25:24 GMT'}]",2009-07-29,"[['Chatpatanasiri', 'Ratthachat', ''], ['Kijsirikul', 'Boonserm', '']]","['Semi-supervised Learning', 'Transductive Learning', 'Spectral Methods', 'Dimensionality Reduction', 'Manifold Learning', 'KPCA Trick']"
14101,1307.4258,Tobias Harks,Martin Gairing and Tobias Harks and Max Klimm,Complexity and Approximation of the Continuous Network Design Problem,27 pages,,,,cs.GT cs.DS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We revisit a classical problem in transportation, known as the continuous
(bilevel) network design problem, CNDP for short. We are given a graph for
which the latency of each edge depends on the ratio of the edge flow and the
capacity installed. The goal is to find an optimal investment in edge
capacities so as to minimize the sum of the routing cost of the induced Wardrop
equilibrium and the investment cost. While this problem is considered as
challenging in the literature, its complexity status was still unknown. We
close this gap showing that CNDP is strongly NP-complete and APX-hard, both on
directed and undirected networks and even for instances with affine latencies.
  As for the approximation of the problem, we first provide a detailed analysis
for a heuristic studied by Marcotte for the special case of monomial latency
functions (Mathematical Programming, Vol.~34, 1986). Specifically, we derive a
closed form expression of its approximation guarantee for arbitrary sets S of
allowed latency functions. Second, we propose a different approximation
algorithm and show that it has the same approximation guarantee. As our final
-- and arguably most interesting -- result regarding approximation, we show
that using the better of the two approximation algorithms results in a strictly
improved approximation guarantee for which we give a closed form expression.
For affine latencies, e.g., this algorithm achieves a 1.195-approximation which
improves on the 5/4 that has been shown before by Marcotte. We finally discuss
the case of hard budget constraints on the capacity investment.
","[{'version': 'v1', 'created': 'Tue, 16 Jul 2013 12:28:11 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Nov 2013 14:15:07 GMT'}]",2013-11-13,"[['Gairing', 'Martin', ''], ['Harks', 'Tobias', ''], ['Klimm', 'Max', '']]","['Bilevel optimization', 'Optimization under equilibrium constraints', 'Network design', 'Wardrop equilibrium', 'Computational complexity', 'Approximation algorithms']"
14102,1511.03927,Emanuele Natale,"Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale,
  Luca Trevisan",Find Your Place: Simple Distributed Algorithms for Community Detection,33 pages,,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given an underlying graph, we consider the following \emph{dynamics}:
Initially, each node locally chooses a value in $\{-1,1\}$, uniformly at random
and independently of other nodes. Then, in each consecutive round, every node
updates its local value to the average of the values held by its neighbors, at
the same time applying an elementary, local clustering rule that only depends
on the current and the previous values held by the node.
  We prove that the process resulting from this dynamics produces a clustering
that exactly or approximately (depending on the graph) reflects the underlying
cut in logarithmic time, under various graph models that exhibit a sparse
balanced cut, including the stochastic block model. We also prove that a
natural extension of this dynamics performs community detection on a
regularized version of the stochastic block model with multiple communities.
  Rather surprisingly, our results provide rigorous evidence for the ability of
an extremely simple and natural dynamics to address a computational problem
that is non-trivial even in a centralized setting.
","[{'version': 'v1', 'created': 'Thu, 12 Nov 2015 15:30:00 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Feb 2016 10:04:27 GMT'}, {'version': 'v3', 'created': 'Fri, 8 Apr 2016 07:29:04 GMT'}, {'version': 'v4', 'created': 'Sat, 23 Jul 2016 22:26:26 GMT'}]",2016-07-26,"[['Becchetti', 'Luca', ''], ['Clementi', 'Andrea', ''], ['Natale', 'Emanuele', ''], ['Pasquale', 'Francesco', ''], ['Trevisan', 'Luca', '']]","['Distributed Algorithms', 'Averaging Dynamics', 'Community Detection', 'SpectralAnalysis', 'Stochastic Block Models']"
14103,1707.08482,Joachim Biskup,"Joachim Biskup, Cornelia Tadros, Jaouad Zarouali",Confidentiality enforcement by hybrid control of information flows,44 pages,,,,cs.CR cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An information owner, possessing diverse data sources, might want to offer
information services based on these sources to cooperation partners and to this
end interact with these partners by receiving and sending messages, which the
owner on his part generates by program execution. Independently from data
representation or its physical storage, information release to a partner might
be restricted by the owner's confidentiality policy on an integrated, unified
view of the sources. Such a policy should even be enforced if the partner as an
intelligent and only semi-honest attacker attempts to infer hidden information
from message data, also employing background knowledge. For this problem of
inference control, we present a framework for a unified, holistic control of
information flow induced by program-based processing of the data sources to
messages sent to a cooperation partner. Our framework expands on and combines
established concepts for confidentiality enforcement and its verification and
is instantiated in a Java environment. More specifically, as a hybrid control
we combine gradual release of information via declassification, enforced by
static program analysis using a security type system, with a dynamic monitoring
approach. The dynamic monitoring employs flow tracking for generalizing values
to be declassified under confidentiality policy compliance.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 15:02:45 GMT'}]",2017-07-27,"[['Biskup', 'Joachim', ''], ['Tadros', 'Cornelia', ''], ['Zarouali', 'Jaouad', '']]","['confidentiality policy', 'inference-usability confinement', 'declassification', 'inference control', 'language-based informationflow control']"
14104,1402.3926,Hideitsu Hino,"Toshiyuki Kato, Hideitsu Hino, and Noboru Murata",Sparse Coding Approach for Multi-Frame Image Super Resolution,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An image super-resolution method from multiple observation of low-resolution
images is proposed. The method is based on sub-pixel accuracy block matching
for estimating relative displacements of observed images, and sparse signal
representation for estimating the corresponding high-resolution image. Relative
displacements of small patches of observed low-resolution images are accurately
estimated by a computationally efficient block matching method. Since the
estimated displacements are also regarded as a warping component of image
degradation process, the matching results are directly utilized to generate
low-resolution dictionary for sparse image representation. The matching scores
of the block matching are used to select a subset of low-resolution patches for
reconstructing a high-resolution patch, that is, an adaptive selection of
informative low-resolution images is realized. When there is only one
low-resolution image, the proposed method works as a single-frame
super-resolution method. The proposed method is shown to perform comparable or
superior to conventional single- and multi-frame super-resolution methods
through experiments using various real-world datasets.
","[{'version': 'v1', 'created': 'Mon, 17 Feb 2014 08:23:35 GMT'}]",2014-02-18,"[['Kato', 'Toshiyuki', ''], ['Hino', 'Hideitsu', ''], ['Murata', 'Noboru', '']]","['image super-resolution', 'multi-frame super-resolution', 'sparse coding']"
14105,1108.3342,Xiaohong Yuan,Xiaohong Yuan and Eduardo B. Fernandez,Patterns for Business-to-consumer E-Commerce Applications,"20 pages, 17 figures","International Journal of Software Engineering and Applications,
  Vol. 2, No. 3, July, 2011, pp. 1-20",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  E-commerce is one of the most important web applications. We present here a
set of patterns that describe shopping carts, products, catalogue, customer
accounts, shipping, and invoices. We combine them in the form of composite
patterns, which in turn make up a domain model for business-to-consumer
e-commerce. We also indicate how to add security constraints to this model.
This domain model can be used as a computation-independent model from which
specific applications can be produced using a model-driven architecture
approach.
","[{'version': 'v1', 'created': 'Tue, 16 Aug 2011 20:03:01 GMT'}]",2011-08-18,"[['Yuan', 'Xiaohong', ''], ['Fernandez', 'Eduardo B.', '']]","['semantic analysis pattern', 'e-commerce', 'model-driven architecture', 'computation-independent model']"
14106,1412.6012,Gundram Leifert,"Gundram Leifert, Tobias Gr\""uning, Tobias Strau{\ss}, Roger Labahn
  (for the University of Rostock - CITlab)",CITlab ARGUS for historical data tables,arXiv admin note: text overlap with arXiv:1412.3949,,,,cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe CITlab's recognition system for the ANWRESH-2014 competition
attached to the 14. International Conference on Frontiers in Handwriting
Recognition, ICFHR 2014. The task comprises word recognition from segmented
historical documents. The core components of our system are based on
multi-dimensional recurrent neural networks (MDRNN) and connectionist temporal
classification (CTC). The software modules behind that as well as the basic
utility technologies are essentially powered by PLANET's ARGUS framework for
intelligent text recognition and image processing.
","[{'version': 'v1', 'created': 'Mon, 15 Dec 2014 06:54:47 GMT'}]",2019-08-14,"[['Leifert', 'Gundram', '', 'for the University of Rostock - CITlab'], ['Grüning', 'Tobias', '', 'for the University of Rostock - CITlab'], ['Strauß', 'Tobias', '', 'for the University of Rostock - CITlab'], ['Labahn', 'Roger', '', 'for the University of Rostock - CITlab']]","['MDRNN', 'LSTM', 'CTC', 'handwriting recognition', 'neural network']"
14107,0802.3528,Fionn Murtagh,Fionn Murtagh and Jean-Luc Starck,"Wavelet and Curvelet Moments for Image Classification: Application to
  Aggregate Mixture Grading",Submitted to Pattern Recognition Letters,"Pattern Recognition Letters, 29, 1557-1564, 2008",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show the potential for classifying images of mixtures of aggregate, based
themselves on varying, albeit well-defined, sizes and shapes, in order to
provide a far more effective approach compared to the classification of
individual sizes and shapes. While a dominant (additive, stationary) Gaussian
noise component in image data will ensure that wavelet coefficients are of
Gaussian distribution, long tailed distributions (symptomatic, for example, of
extreme values) may well hold in practice for wavelet coefficients. Energy (2nd
order moment) has often been used for image characterization for image
content-based retrieval, and higher order moments may be important also, not
least for capturing long tailed distributional behavior. In this work, we
assess 2nd, 3rd and 4th order moments of multiresolution transform -- wavelet
and curvelet transform -- coefficients as features. As analysis methodology,
taking account of image types, multiresolution transforms, and moments of
coefficients in the scales or bands, we use correspondence analysis as well as
k-nearest neighbors supervised classification.
","[{'version': 'v1', 'created': 'Sun, 24 Feb 2008 18:25:51 GMT'}]",2010-11-16,"[['Murtagh', 'Fionn', ''], ['Starck', 'Jean-Luc', '']]","['image grading', 'wavelet and curvelet transforms', 'moments', 'variance', 'skewness', 'kurtosis']"
14108,0907.3200,Yong-Hyuk Kim,"Yourim Yoon, Yong-Hyuk Kim, Alberto Moraglio, Byung-Ro Moon","A Mathematical Unification of Geometric Crossovers Defined on Phenotype
  Space","20 pages, 2 figures",,,,cs.NE cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Geometric crossover is a representation-independent definition of crossover
based on the distance of the search space interpreted as a metric space. It
generalizes the traditional crossover for binary strings and other important
recombination operators for the most frequently used representations. Using a
distance tailored to the problem at hand, the abstract definition of crossover
can be used to design new problem specific crossovers that embed problem
knowledge in the search. This paper is motivated by the fact that
genotype-phenotype mapping can be theoretically interpreted using the concept
of quotient space in mathematics. In this paper, we study a metric
transformation, the quotient metric space, that gives rise to the notion of
quotient geometric crossover. This turns out to be a very versatile notion. We
give many example applications of the quotient geometric crossover.
","[{'version': 'v1', 'created': 'Sat, 18 Jul 2009 10:15:49 GMT'}]",2009-07-21,"[['Yoon', 'Yourim', ''], ['Kim', 'Yong-Hyuk', ''], ['Moraglio', 'Alberto', ''], ['Moon', 'Byung-Ro', '']]","['Geometric crossover', 'metric transformation', 'quotient metric space', 'quotientgeometric crossover']"
14109,1710.06100,Mengdi Wang,Mengdi Wang,"Primal-Dual $\pi$ Learning: Sample Complexity and Sublinear Run Time for
  Ergodic Markov Decision Problems",,,,,cs.LG cs.CC math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consider the problem of approximating the optimal policy of a Markov decision
process (MDP) by sampling state transitions. In contrast to existing
reinforcement learning methods that are based on successive approximations to
the nonlinear Bellman equation, we propose a Primal-Dual $\pi$ Learning method
in light of the linear duality between the value and policy. The $\pi$ learning
method is model-free and makes primal-dual updates to the policy and value
vectors as new data are revealed. For infinite-horizon undiscounted Markov
decision process with finite state space $S$ and finite action space $A$, the
$\pi$ learning method finds an $\epsilon$-optimal policy using the following
number of sample transitions $$ \tilde{O}( \frac{(\tau\cdot t^*_{mix})^2 |S|
|A| }{\epsilon^2} ),$$ where $t^*_{mix}$ is an upper bound of mixing times
across all policies and $\tau$ is a parameter characterizing the range of
stationary distributions across policies. The $\pi$ learning method also
applies to the computational problem of MDP where the transition probabilities
and rewards are explicitly given as the input. In the case where each state
transition can be sampled in $\tilde{O}(1)$ time, the $\pi$ learning method
gives a sublinear-time algorithm for solving the averaged-reward MDP.
","[{'version': 'v1', 'created': 'Tue, 17 Oct 2017 05:03:19 GMT'}]",2017-10-18,"[['Wang', 'Mengdi', '']]","['Markov decision process', 'reinforcement learning', 'sample complexity', 'run-time complexity', 'duality', 'primal-dual method', 'mixing time']"
14110,1603.04000,Shumeet Baluja,Shumeet Baluja,Learning Typographic Style,,,,,cs.CV cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Typography is a ubiquitous art form that affects our understanding,
perception, and trust in what we read. Thousands of different font-faces have
been created with enormous variations in the characters. In this paper, we
learn the style of a font by analyzing a small subset of only four letters.
From these four letters, we learn two tasks. The first is a discrimination
task: given the four letters and a new candidate letter, does the new letter
belong to the same font? Second, given the four basis letters, can we generate
all of the other letters with the same characteristics as those in the basis
set? We use deep neural networks to address both tasks, quantitatively and
qualitatively measure the results in a variety of novel manners, and present a
thorough investigation of the weaknesses and strengths of the approach.
","[{'version': 'v1', 'created': 'Sun, 13 Mar 2016 05:44:57 GMT'}]",2016-03-15,"[['Baluja', 'Shumeet', '']]","['Style Analysis', 'Typography', 'Image Generation', 'Learning']"
14111,1205.5569,Jagadeesh Gorla,"Jagadeesh Gorla, Stephen Robertson, Jun Wang and Tamas Jambor",A Theory of Information Matching,,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we propose a theory for information matching. It is motivated
by the observation that retrieval is about the relevance matching between two
sets of properties (features), namely, the information need representation and
information item representation. However, many probabilistic retrieval models
rely on fixing one representation and optimizing the other (e.g. fixing the
single information need and tuning the document) but not both. Therefore, it is
difficult to use the available related information on both the document and the
query at the same time in calculating the probability of relevance. In this
paper, we address the problem by hypothesizing the relevance as a logical
relationship between the two sets of properties; the relationship is defined on
two separate mappings between these properties. By using the hypothesis we
develop a unified probabilistic relevance model which is capable of using all
the available information. We validate the proposed theory by formulating and
developing probabilistic relevance ranking functions for both ad-hoc text
retrieval and collaborative filtering. Our derivation in text retrieval
illustrates the use of the theory in the situation where no relevance
information is available. In collaborative filtering, we show that the
resulting recommender model unifies the user and item information into a
relevance ranking function without applying any dimensionality reduction
techniques or computing explicit similarity between two different users (or
items), in contrast to the state-of-the-art recommender models.
","[{'version': 'v1', 'created': 'Thu, 24 May 2012 20:56:16 GMT'}, {'version': 'v2', 'created': 'Mon, 28 May 2012 01:02:35 GMT'}, {'version': 'v3', 'created': 'Fri, 1 Jun 2012 18:59:09 GMT'}]",2012-06-04,"[['Gorla', 'Jagadeesh', ''], ['Robertson', 'Stephen', ''], ['Wang', 'Jun', ''], ['Jambor', 'Tamas', '']]","['Information Retrieval', 'Relevance', 'Unified Theory', 'Search', 'Collaborative Filtering']"
14112,1108.1447,Rahul Thakurta Dr,"Rahul Thakurta, Subhajit Dasgupta","Impact of Software Requirement Volatility Pattern on Project Dynamics:
  Evidences from a Case Study",,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Requirements are found to change in various ways during the course of a
project. This can affect the process in widely different manner and extent.
Here we present a case study where-in we investigate the impact of requirement
volatility pattern on project performance. The project setting described in the
case is emulated on a validated system dynamics model representing the
waterfall model. The findings indicate deviations in project outcome from the
estimated thereby corroborating to previous findings. The results reinforce the
applicability of system dynamics approach to analyze project performance under
requirement volatility, which is expected to speed up adoption of the same in
organizations and in the process contribute to more project successes.
","[{'version': 'v1', 'created': 'Sat, 6 Aug 2011 04:06:55 GMT'}]",2011-08-09,"[['Thakurta', 'Rahul', ''], ['Dasgupta', 'Subhajit', '']]","['Requirement Volatility', 'Software Development', 'Project Performance', 'System Dynamics', 'Case Study']"
14113,1004.3254,Vishal Goyal,"Laura De Giusti, Franco Chichizola, Marcelo Naiouf, Armando De Giusti,
  Emilio Luque","Automatic Mapping Tasks to Cores - Evaluating AMTHA Algorithm in
  Multicore Architectures",http://ijcsi.org/articles/Automatic-Mapping-Tasks-to-Cores-Evaluating-AMTHA-Algorithm-in-Multicore-Architectures.php,"IJCSI, Volume 7, Issue 2, March 2010",,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The AMTHA (Automatic Mapping Task on Heterogeneous Architectures) algorithm
for task-to-processors assignment and the MPAHA (Model of Parallel Algorithms
on Heterogeneous Architectures) model are presented. The use of AMTHA is
analyzed for multicore processor-based architectures, considering the
communication model among processes in use. The results obtained in the tests
carried out are presented, comparing the real execution times on multicores of
a set of synthetic applications with the predictions obtained with AMTHA.
Finally current lines of research are presented, focusing on clusters of
multicores and hybrid programming paradigms.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2010 17:42:16 GMT'}]",2010-04-20,"[['De Giusti', 'Laura', ''], ['Chichizola', 'Franco', ''], ['Naiouf', 'Marcelo', ''], ['De Giusti', 'Armando', ''], ['Luque', 'Emilio', '']]","['Parallel Algorithm Models', 'Task-to-Processor Mapping', 'Performance Prediction', 'Multicore Architectures']"
14114,1401.5871,Pramod Verma,Pramod Verma,Serefind: A Social Networking Website for Classifieds,"A prototype is available at http://www.serefind.com. Pramod Verma.
  2013. Serefind: a social networking website for classifieds. In Proceedings
  of the 22nd international conference on World Wide Web companion (WWW '13
  Companion), 289-292",,,,cs.SI cs.CY,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper presents the design and implementation of a social networking
website for classifieds, called Serefind. We designed search interfaces with
focus on security, privacy, usability, design, ranking, and communications. We
deployed this site at the Johns Hopkins University, and the results show it can
be used as a self-sustaining classifieds site for public or private
communities.
","[{'version': 'v1', 'created': 'Thu, 23 Jan 2014 04:44:20 GMT'}]",2014-01-24,"[['Verma', 'Pramod', '']]","['Classifieds', 'Search Interfaces', 'Security and Privacy']"
14115,1602.08800,Vitaly Bulgakov,Vitaly Bulgakov,"Iterative Aggregation Method for Solving Principal Component Analysis
  Problems",,,,,cs.NA cs.IR cs.LG,http://creativecommons.org/publicdomain/zero/1.0/,"  Motivated by the previously developed multilevel aggregation method for
solving structural analysis problems a novel two-level aggregation approach for
efficient iterative solution of Principal Component Analysis (PCA) problems is
proposed. The course aggregation model of the original covariance matrix is
used in the iterative solution of the eigenvalue problem by a power iterations
method. The method is tested on several data sets consisting of large number of
text documents.
","[{'version': 'v1', 'created': 'Mon, 29 Feb 2016 02:40:05 GMT'}]",2016-03-01,"[['Bulgakov', 'Vitaly', '']]","['principal component analysis', 'clustering method', 'power iteration method', 'aggregation method', 'eigenvalue problem']"
14116,1304.1677,Sowmya Kamath S,"Sunil Joy Dommati, Ruchi Agrawal, Ram Mohana Reddy G. and S. Sowmya
  Kamath","Bug Classification: Feature Extraction and Comparison of Event Model
  using Na\""ive Bayes Approach","5 pages, International Conference on Recent Trends in Computer and
  Information Engineering (ICRTCIE'2012) April 13-15, 2012 Pattaya,
  http://psrcentre.org/images/extraimages/412138.pdf",,,,cs.SE cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In software industries, individuals at different levels from customer to an
engineer apply diverse mechanisms to detect to which class a particular bug
should be allocated. Sometimes while a simple search in Internet might help, in
many other cases a lot of effort is spent in analyzing the bug report to
classify the bug. So there is a great need of a structured mining algorithm -
where given a crash log, the existing bug database could be mined to find out
the class to which the bug should be allocated. This would involve Mining
patterns and applying different classification algorithms. This paper focuses
on the feature extraction, noise reduction in data and classification of
network bugs using probabilistic Na\""ive Bayes approach. Different event models
like Bernoulli and Multinomial are applied on the extracted features. When new,
unseen bugs are given as input to the algorithms, the performance comparison of
different algorithms is done on the basis of accuracy and recall parameters.
","[{'version': 'v1', 'created': 'Fri, 5 Apr 2013 11:05:18 GMT'}]",2013-04-08,"[['Dommati', 'Sunil Joy', ''], ['Agrawal', 'Ruchi', ''], ['G.', 'Ram Mohana Reddy', ''], ['Kamath', 'S. Sowmya', '']]","['Classification', 'Multinomial Model', 'Bayesian', 'Network Bugs']"
14117,1609.02613,Wei Fu,Wei Fu and Vivek Nair and Tim Menzies,"Why is Differential Evolution Better than Grid Search for Tuning Defect
  Predictors?","12 pages, 8 figures, submitted to Information and Software Technology",,,,cs.SE cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: One of the black arts of data mining is learning the magic
parameters which control the learners. In software analytics, at least for
defect prediction, several methods, like grid search and differential evolution
(DE), have been proposed to learn these parameters, which has been proved to be
able to improve the performance scores of learners.
  Objective: We want to evaluate which method can find better parameters in
terms of performance score and runtime cost.
  Methods: This paper compares grid search to differential evolution, which is
an evolutionary algorithm that makes extensive use of stochastic jumps around
the search space.
  Results: We find that the seemingly complete approach of grid search does no
better, and sometimes worse, than the stochastic search. When repeated 20 times
to check for conclusion validity, DE was over 210 times faster than grid search
to tune Random Forests on 17 testing data sets with F-Measure
  Conclusions: These results are puzzling: why does a quick partial search be
just as effective as a much slower, and much more, extensive search? To answer
that question, we turned to the theoretical optimization literature. Bergstra
and Bengio conjecture that grid search is not more effective than more
randomized searchers if the underlying search space is inherently low
dimensional. This is significant since recent results show that defect
prediction exhibits very low intrinsic dimensionality-- an observation that
explains why a fast method like DE may work as well as a seemingly more
thorough grid search. This suggests, as a future research direction, that it
might be possible to peek at data sets before doing any optimization in order
to match the optimization algorithm to the problem at hand.
","[{'version': 'v1', 'created': 'Thu, 8 Sep 2016 22:32:44 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Sep 2016 02:15:12 GMT'}, {'version': 'v3', 'created': 'Fri, 10 Mar 2017 17:29:06 GMT'}]",2017-03-13,"[['Fu', 'Wei', ''], ['Nair', 'Vivek', ''], ['Menzies', 'Tim', '']]","['Defect prediction', 'tuning', 'differential evolution', 'grid search', 'intrinsic dimensionality']"
14118,1504.06206,Lu\'is Pinto,"Isabel N. Figueiredo, Carlos Leal, Lu\'is Pinto, Pedro N. Figueiredo,
  Richard Tsai","An Elastic Image Registration Approach for Wireless Capsule Endoscope
  Localization",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless Capsule Endoscope (WCE) is an innovative imaging device that permits
physicians to examine all the areas of the Gastrointestinal (GI) tract. It is
especially important for the small intestine, where traditional invasive
endoscopies cannot reach. Although WCE represents an extremely important
advance in medical imaging, a major drawback that remains unsolved is the WCE
precise location in the human body during its operating time. This is mainly
due to the complex physiological environment and the inherent capsule effects
during its movement. When an abnormality is detected, in the WCE images,
medical doctors do not know precisely where this abnormality is located
relative to the intestine and therefore they can not proceed efficiently with
the appropriate therapy. The primary objective of the present paper is to give
a contribution to WCE localization, using image-based methods. The main focus
of this work is on the description of a multiscale elastic image registration
approach, its experimental application on WCE videos, and comparison with a
multiscale affine registration. The proposed approach includes registrations
that capture both rigid-like and non-rigid deformations, due respectively to
the rigid-like WCE movement and the elastic deformation of the small intestine
originated by the GI peristaltic movement. Under this approach a qualitative
information about the WCE speed can be obtained, as well as the WCE location
and orientation via projective geometry. The results of the experimental tests
with real WCE video frames show the good performance of the proposed approach,
when elastic deformations of the small intestine are involved in successive
frames, and its superiority with respect to a multiscale affine image
registration, which accounts for rigid-like deformations only and discards
elastic deformations.
","[{'version': 'v1', 'created': 'Thu, 23 Apr 2015 14:41:07 GMT'}]",2015-04-24,"[['Figueiredo', 'Isabel N.', ''], ['Leal', 'Carlos', ''], ['Pinto', 'Luís', ''], ['Figueiredo', 'Pedro N.', ''], ['Tsai', 'Richard', '']]","['Elastic and Parametric Image Registration', 'Multiscale Representation', 'Wireless CapsuleEndoscope']"
14119,1505.02140,Umair  Siddique,"Umair Siddique, Osman Hasan and Sofi\`ene Tahar",Towards the Formalization of Fractional Calculus in Higher-Order Logic,9 pages,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fractional calculus is a generalization of classical theories of integration
and differentiation to arbitrary order (i.e., real or complex numbers). In the
last two decades, this new mathematical modeling approach has been widely used
to analyze a wide class of physical systems in various fields of science and
engineering. In this paper, we describe an ongoing project which aims at
formalizing the basic theories of fractional calculus in the HOL Light theorem
prover. Mainly, we present the motivation and application of such formalization
efforts, a roadmap to achieve our goals, current status of the project and
future milestones.
","[{'version': 'v1', 'created': 'Fri, 8 May 2015 19:13:27 GMT'}]",2016-08-10,"[['Siddique', 'Umair', ''], ['Hasan', 'Osman', ''], ['Tahar', 'Sofiène', '']]","['Fractional Calculus', 'Higher-Order Logic', 'Theorem Proving']"
14120,1704.06910,Lu-Xing Yang,"Tianrui Zhang, Xiaofan Yang, Lu-Xing Yang, Yuan Yan Tang, Yingbo Wu",A discount strategy in word-of-mouth marketing and its assessment,"word-of-mouth marketing, discount strategy, marketing profit, dynamic
  model",,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the discount pricing in word-of-mouth (WOM) marketing. A
new discount strategy known as the Infection-Based Discount (IBD) strategy is
proposed. The basic idea of the IBD strategy lies in that each customer enjoys
a discount that is linearly proportional to his/her influence in the WOM
network. To evaluate the performance of the IBD strategy, the WOM spreading
process is modeled as a dynamic model known as the DPA model, and the
performance of the IBD strategy is modeled as a function of the basic discount.
Next, the influence of different factors, including the basic discount and the
WOM network, on the dynamics of the DPA model is revealed experimentally.
Finally, the influence of different factors on the performance of the IBD
strategy is uncovered experimentally. On this basis, some promotional measures
are recommended.
","[{'version': 'v1', 'created': 'Sun, 23 Apr 2017 11:14:21 GMT'}]",2017-04-25,"[['Zhang', 'Tianrui', ''], ['Yang', 'Xiaofan', ''], ['Yang', 'Lu-Xing', ''], ['Tang', 'Yuan Yan', ''], ['Wu', 'Yingbo', '']]","['word-of-mouth marketing', 'discount strategy', 'marketing profit', 'dynamic model']"
14121,1603.06227,Swaroop Ghosh,"Nitin Rathi, Asmit De, Helia Naeimi and Swaroop Ghosh","Cache Bypassing and Checkpointing to Circumvent Data Security Attacks on
  STTRAM",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spin-Transfer Torque RAM (STTRAM) is promising for cache applications.
However, it brings new data security issues that were absent in volatile memory
counterparts such as Static RAM (SRAM) and embedded Dynamic RAM (eDRAM). This
is primarily due to the fundamental dependency of this memory technology on
ambient parameters such as magnetic field and temperature that can be exploited
to tamper with the stored data. In this paper we propose three techniques to
enable error free computation without stalling the system, (a) stalling where
the system is halted during attack; (b) cache bypass during gradually ramping
attack where the last level cache (LLC) is bypassed and the upper level caches
interact directly with the main memory; and, (c) checkpointing along with
bypass during sudden attack where the processor states are saved periodically
and the LLC is written back at regular intervals. During attack the system goes
back to the last checkpoint and the computation continues with bypassed cache.
We performed simulation for different duration and frequency of attack on
SPLASH benchmark suite and the results show an average of 8% degradation in IPC
for a one-time attack lasting for 50% of the execution time. The energy
overhead is 2% for an attack lasting for the entire duration of execution.
","[{'version': 'v1', 'created': 'Sun, 20 Mar 2016 15:29:37 GMT'}]",2016-03-22,"[['Rathi', 'Nitin', ''], ['De', 'Asmit', ''], ['Naeimi', 'Helia', ''], ['Ghosh', 'Swaroop', '']]","['Data security', 'magnetic attack', 'STTRAM', 'cache bypass', 'checkpointing']"
14122,1304.0528,Ver\'onica  Becher,Veronica Becher and Alejandro Deymonnaz and Pablo Ariel Heiber,Efficient repeat finding via suffix arrays,14 pages,"Bioinformatics, 25(14):1746-1753, 2009",,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We solve the problem of finding interspersed maximal repeats using a suffix
array construction. As it is well known, all the functionality of suffix trees
can be handled by suffix arrays, gaining practicality. Our solution improves
the suffix tree based approaches for the repeat finding problem, being
particularly well suited for very large inputs. We prove the corrrectness and
complexity of the algorithms.
","[{'version': 'v1', 'created': 'Tue, 2 Apr 2013 04:41:33 GMT'}]",2013-04-03,"[['Becher', 'Veronica', ''], ['Deymonnaz', 'Alejandro', ''], ['Heiber', 'Pablo Ariel', '']]","['repeats', 'suffix array', 'longest maximal substring']"
14123,1505.06542,Ruby Annette,"Ruby Annette, Aisha Banu",A Service Broker Model for Cloud based Render Farm Selection,,International Journal of Computer Applications 96.24 (2014): 11-14,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing is gaining popularity in the 3D Animation industry for
rendering the 3D images. Rendering is an inevitable task in creating the 3d
animated scenes. It is a process where the scene files to be animated is read
and converted into 3D photorealistic images automatically. Since it is a
computationally intensive task, this process consumes the majority of the time
taken for 3D images production. As the scene files could be processed in
parallel, clusters of computers called render farms can be used to speed up the
rendering process. The advantage of using Cloud based render farms is that it
is scalable and can be availed on demand. One of the important challenges faced
by the 3D studios is the comparison and selection of the cloud based render
farm service provider who could satisfy their functional and the non functional
Quality of Service (QoS) requirements. In this paper we propose, a frame work
for Cloud Service Broker (CSB) responsible for the selection and provision of
the cloud based render farm. The Cloud Service Broker matches the functional
and the non functional Quality of Service requirements (QoS) of the user with
the service offerings of the render farm service providers and helps the user
in selecting the right service provider using an aggregate utility function.
The CSB also facilitates the process of Service Level Agreement (SLA)
negotiation and monitoring by the third party monitoring services.
","[{'version': 'v1', 'created': 'Mon, 25 May 2015 05:20:18 GMT'}]",2015-05-26,"[['Annette', 'Ruby', ''], ['Banu', 'Aisha', '']]","['3D Animation', 'Rendering', 'Cloud Render farms', 'Cloud Services Brokerage', 'Aggregated Utility Function']"
14124,1304.7615,Adrian Jackson,"Adrian Jackson, Par Strand",MDMP: Managed Data Message Passing,"Submitted to SC13, 10 pages, 5 figures",,,,cs.DC cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  MDMP is a new parallel programming approach that aims to provide users with
an easy way to add parallelism to programs, optimise the message passing costs
of traditional scientific simulation algorithms, and enable existing MPI-based
parallel programs to be optimised and extended without requiring the whole code
to be re-written from scratch. MDMP utilises a directives based approach to
enable users to specify what communications should take place in the code, and
then implements those communications for the user in an optimal manner using
both the information provided by the user and data collected from instrumenting
the code and gathering information on the data to be communicated. This work
will present the basic concepts and functionality of MDMP and discuss the
performance that can be achieved using our prototype implementation of MDMP on
some model scientific simulation applications.
","[{'version': 'v1', 'created': 'Mon, 29 Apr 2013 10:35:48 GMT'}]",2013-04-30,"[['Jackson', 'Adrian', ''], ['Strand', 'Par', '']]","['Parallel Languages', 'Message Passing', 'MPI']"
14125,1306.6812,Augusto Santos J. A.,"Augusto Santos, Jos\'e M. F. Moura, and Jo\~ao Xavier",Epidemics in Multipartite Networks: Emergent Dynamics,"32 pages, Submitted to the IEEE Transactions on Automatic Control",,,,cs.SI physics.soc-ph q-bio.PE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Single virus epidemics over complete networks are widely explored in the
literature as the fraction of infected nodes is, under appropriate microscopic
modeling of the virus infection, a Markov process. With non-complete networks,
this macroscopic variable is no longer Markov. In this paper, we study virus
diffusion, in particular, multi-virus epidemics, over non-complete stochastic
networks. We focus on multipartite networks. In companying work
http://arxiv.org/abs/1306.6198, we show that the peer-to-peer local random
rules of virus infection lead, in the limit of large multipartite networks, to
the emergence of structured dynamics at the macroscale. The exact fluid limit
evolution of the fraction of nodes infected by each virus strain across islands
obeys a set of nonlinear coupled differential equations, see
http://arxiv.org/abs/1306.6198. In this paper, we develop methods to analyze
the qualitative behavior of these limiting dynamics, establishing conditions on
the virus micro characteristics and network structure under which a virus
persists or a natural selection phenomenon is observed.
","[{'version': 'v1', 'created': 'Fri, 28 Jun 2013 12:36:07 GMT'}]",2013-07-01,"[['Santos', 'Augusto', ''], ['Moura', 'José M. F.', ''], ['Xavier', 'João', '']]","['Virus diffusion', 'epidemics', 'multipartite network', 'qualitative behavior']"
14126,1603.07011,Mohammadreza Ashouri,"Mohammadreza Ashouri, Ali Golshani, Dara Moazzmi, Mandana Ghasemi",Graphs Drawing through Fuzzy Clustering,26 pages,,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many problems can be presented in an abstract form through a wide range of
binary objects and relations which are defined over problem domain. In these
problems, graphical demonstration of defined binary objects and solutions is
the most suitable representation approach. In this regard, graph drawing
problem discusses the methods for transforming combinatorial graphs to
geometrical drawings in order to visualize them. This paper studies the
force-directed algorithms and multi-surface techniques for drawing general
undirected graphs. Particularly, this research describes force-directed
approach to model the drawing of a general graph as a numerical optimization
problem. So, it can use rich knowledge which is presented as an established
system by the numerical optimization. Moreover, this research proposes the
multi-surface approach as an efficient tool for overcoming local minimums in
standard force-directed algorithms. Next, we introduce a new method for
multi-surface approach based on fuzzy clustering algorithms.
","[{'version': 'v1', 'created': 'Tue, 22 Mar 2016 22:14:01 GMT'}]",2016-03-24,"[['Ashouri', 'Mohammadreza', ''], ['Golshani', 'Ali', ''], ['Moazzmi', 'Dara', ''], ['Ghasemi', 'Mandana', '']]","['graph drawing', 'force-directed approach', 'multi-surface approach', 'numerical optimization', 'fuzzy clustering']"
14127,1312.7469,Sheng Huang,Sheng Huang and Dan Yang and Dong Yang and Ahmed Elgammal,"Collaborative Discriminant Locality Preserving Projections With its
  Application to Face Recognition",second version,,,,cs.CV,http://creativecommons.org/licenses/by/3.0/,"  We present a novel Discriminant Locality Preserving Projections (DLPP)
algorithm named Collaborative Discriminant Locality Preserving Projection
(CDLPP). In our algorithm, the discriminating power of DLPP are further
exploited from two aspects. On the one hand, the global optimum of class
scattering is guaranteed via using the between-class scatter matrix to replace
the original denominator of DLPP. On the other hand, motivated by collaborative
representation, an $L_2$-norm constraint is imposed to the projections to
discover the collaborations of dimensions in the sample space. We apply our
algorithm to face recognition. Three popular face databases, namely AR, ORL and
LFW-A, are employed for evaluating the performance of CDLPP. Extensive
experimental results demonstrate that CDLPP significantly improves the
discriminating power of DLPP and outperforms the state-of-the-arts.
","[{'version': 'v1', 'created': 'Sat, 28 Dec 2013 20:12:17 GMT'}, {'version': 'v2', 'created': 'Sat, 8 Feb 2014 20:43:10 GMT'}]",2014-02-11,"[['Huang', 'Sheng', ''], ['Yang', 'Dan', ''], ['Yang', 'Dong', ''], ['Elgammal', 'Ahmed', '']]","['Discriminant Locality Preserving Projections', 'Face recognition', 'Dimensionality reduction', 'Featureextraction', 'Collaborative representation']"
14128,1109.2114,Daniel Kharitonov,Daniel Kharitonov,Net-Centric World: Lifestyle of the 21st Century,Preprint for ITU-T Kaleidoscope 2011,,,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we research the potential of information communication
technologies (ICTs) for changing our society from a commute-centric to a
network-centric environment. We propose to formalize the key attributes of
ICT-based telecommuting experiences from both economic and human interactivity
perspective. We introduce the notion of network-eligible transactions and
disclose the link between degree of network centricity and worker settlement
radius, postulating that media-rich network services have a strong potential to
increase the physical distance between work and home locations. We also
highlight notable technology challenges and opportunities of migration from
location-based to mobile living, signifying the needs for new services and
standards development.
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2011 19:22:42 GMT'}]",2011-09-13,"[['Kharitonov', 'Daniel', '']]","['ICT', 'net-centric', 'telecommuting', 'nomadic']"
14129,0704.3520,Jerome Darmont,"Kamel Aouiche (ERIC), J\'er\^ome Darmont (ERIC)",Vers l'auto-administration des entrep\^ots de donn\'ees,Version courte de 4 pages,"XXXV\`emes Journ\'ees de Statistique, Session sp\'eciale
  Entreposage et Fouille de Donn\'ees, Lyon (02/06/2003) 105-108",,,cs.DB,,"  With the wide development of databases in general and data warehouses in
particular, it is important to reduce the tasks that a database administrator
must perform manually. The idea of using data mining techniques to extract
useful knowledge for administration from the data themselves has existed for
some years. However, little research has been achieved. The aim of this study
is to search for a way of extracting useful knowledge from stored data to
automatically apply performance optimization techniques, and more particularly
indexing techniques. We have designed a tool that extracts frequent itemsets
from a given workload to compute an index configuration that helps optimizing
data access time. The experiments we performed showed that the index
configurations generated by our tool allowed performance gains of 15% to 25% on
a test database and a test data warehouse.
","[{'version': 'v1', 'created': 'Thu, 26 Apr 2007 11:47:35 GMT'}]",2007-05-23,"[['Aouiche', 'Kamel', '', 'ERIC'], ['Darmont', 'Jérôme', '', 'ERIC']]","['Databases and data warehouses', 'Auto-indexing', 'Data mining', 'Frequent itemsets']"
14130,0909.1475,Damien Chablat,"Anatoly Pashkevich (IRCCyN), Damien Chablat (IRCCyN), Philippe Wenger
  (IRCCyN)","Design optimization of parallel manipulators for high-speed precision
  machining applications",,"13th IFAC Symposium on Information Control Problems in
  Manufacturing, Moscou : Russian Federation (2009)",,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper proposes an integrated approach to the design optimization of
parallel manipulators, which is based on the concept of the workspace grid and
utilizes the goal-attainment formulation for the global optimization. To
combine the non-homogenous design specification, the developed optimization
technique transforms all constraints and objectives into similar performance
indices related to the maximum size of the prescribed shape workspace. This
transformation is based on the dedicated dynamic programming procedures that
satisfy computational requirements of modern CAD. Efficiency of the developed
technique is demonstrated via two case studies that deal with optimization of
the kinematical and stiffness performances for parallel manipulators of the
Orthoglide family.
","[{'version': 'v1', 'created': 'Tue, 8 Sep 2009 12:39:11 GMT'}]",2009-09-09,"[['Pashkevich', 'Anatoly', '', 'IRCCyN'], ['Chablat', 'Damien', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN']]","['Computer-aided design', 'operation research application', 'multiobjective optimization', 'parallel robotic manipulators', 'Orthoglide robot']"
14131,1609.03283,Benjamin Cowley PhD,Ilkka Kosunen and Benjamin Cowley,"A short review and primer on respiration in human computer interaction
  applications","6 pages, 1 figure. To be published in a journal",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The application of psychophysiology in human-computer interaction is a
growing field with significant potential for future smart personalised systems.
Working in this emerging field requires comprehension of an array of
physiological signals and analysis techniques.
  Respiration is unique among physiological signals in that it can be
consciously controlled which has to be taken into account when designing
applications. Respiration is tightly connected to other physiological signals,
especially cardiovascular activity, and often analyzed in conjunction with
other signals. When analyzed separately, an increase in the rate of respiration
can be seen as an increase in metabolic demand which indicates activate states
such as engagement and attention. We present a short review on the application
of respiration in human-computer interaction.
  This paper aims to serve as a primer for the novice, enabling rapid
familiarisation with the latest core concepts. We put special emphasis on
everyday human-computer interface applications to distinguish from the more
common clinical or sports uses of psychophysiology.
  This paper is an extract from a comprehensive review of the entire field of
ambulatory psychophysiology, including 12 similar chapters, plus application
guidelines and systematic review. Thus any citation should be made using the
following reference:
  B. Cowley, M. Filetti, K. Lukander, J. Torniainen, A. Henelius, L. Ahonen, O.
Barral, I. Kosunen, T. Valtonen, M. Huotilainen, N. Ravaja, G. Jacucci. The
Psychophysiology Primer: a guide to methods and a broad review with a focus on
human-computer interaction. Foundations and Trends in Human-Computer
Interaction, vol. 9, no. 3-4, pp. 150--307, 2016.
","[{'version': 'v1', 'created': 'Mon, 12 Sep 2016 07:20:10 GMT'}]",2016-09-13,"[['Kosunen', 'Ilkka', ''], ['Cowley', 'Benjamin', '']]","['electrodermal activity', 'psychophysiology', 'human-computerinteraction', 'primer', 'review']"
14132,1010.4816,Anvesh Reddy Aileni,Anvesh Aileni,Cluster based Key Management in Wireless Sensor Networks,"11 pages, 5 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless sensor networks consist of sensor nodes with limited computational
and communication capabilities. In this paper, the whole network of sensor
nodes is divided into clusters based on their physical locations. In addition,
efficient ways of key distribution among the nodes within the cluster and among
controllers of each cluster are discussed. Also, inter and intra cluster
communications are presented in detail. The security of the entire network
through efficient key management by taking into consideration the network's
power capabilities is discussed. A graphical representation of the simulation
on the scheme is also presented.
","[{'version': 'v1', 'created': 'Fri, 22 Oct 2010 21:08:20 GMT'}]",2010-11-13,"[['Aileni', 'Anvesh', '']]","['Sensor network', 'clusters', 'nodes', 'sub controller', 'main controller', 'key distribution', 'k-means++']"
14133,1402.0116,Sehrish Basir Nizamani,"Sehrish Nizamani, Khalil Khoumbati, Imdad Ali Ismaili, Saad Nizamani",A Conceptual Framework for ERP Evaluation in Universities of Pakistan,,"Sindh University Research Journal (Science Series) Vol. 45
  (3)467-475 (2013)",,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The higher education has been greatly impacted by worldwide trends. In a
result, the universities throughout the world are focusing to enhance
performance and efficiency in their workings. Therefore, the higher education
has moved their systems to Enterprise Resource Planning (ERP) systems to cope
with the needs of changing environment. However, the literature review
indicates that there is void on the evaluation of success or failure of ERP
systems in higher education Institutes in Pakistan. In overall, ERP systems
implementation in higher education of Pakistan has not been given appropriate
research focus. Thus, in this paper the authors have attempted to develop a
conceptual framework for ERP evaluation in Universities of Pakistan. This seeks
to expand the knowledge on ERP in higher educational institutes of Pakistan and
focuses on understanding the ERP related critical success factors.
","[{'version': 'v1', 'created': 'Sat, 1 Feb 2014 19:37:18 GMT'}]",2014-02-04,"[['Nizamani', 'Sehrish', ''], ['Khoumbati', 'Khalil', ''], ['Ismaili', 'Imdad Ali', ''], ['Nizamani', 'Saad', '']]","['ERP Implementation', 'Success Evaluation Framework', 'Higher Educational']"
14134,1309.7750,Stefanos Ougiaroglou,"Stefanos Ougiaroglou, Georgios Evangelidis, Dimitris A. Dervos","An Extensive Experimental Study on the Cluster-based Reference Set
  Reduction for speeding-up the k-NN Classifier","Proceeding of International Conference on Integrated Information
  (IC-InInfo 2011), pp. 12-15, Kos island, Greece, 2011",,,,cs.LG,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The k-Nearest Neighbor (k-NN) classification algorithm is one of the most
widely-used lazy classifiers because of its simplicity and ease of
implementation. It is considered to be an effective classifier and has many
applications. However, its major drawback is that when sequential search is
used to find the neighbors, it involves high computational cost. Speeding-up
k-NN search is still an active research field. Hwang and Cho have recently
proposed an adaptive cluster-based method for fast Nearest Neighbor searching.
The effectiveness of this method is based on the adjustment of three
parameters. However, the authors evaluated their method by setting specific
parameter values and using only one dataset. In this paper, an extensive
experimental study of this method is presented. The results, which are based on
five real life datasets, illustrate that if the parameters of the method are
carefully defined, one can achieve even better classification performance.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2013 08:24:14 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Feb 2014 22:46:36 GMT'}]",2014-02-13,"[['Ougiaroglou', 'Stefanos', ''], ['Evangelidis', 'Georgios', ''], ['Dervos', 'Dimitris A.', '']]","['k-NN classification', 'clustering', 'datareduction', 'scalability']"
14135,1210.0576,Jaswinder  Dilawari Singh,"Jaswinder Singh Dilawari, Gurpreet Singh Sandhu",A Review Paper on Microprocessor Based Controller Programming,"5 pages,4 Figures","International Journal of Advanced Research in Computer Science and
  Software Engineering ,Volume 2,Issue 8,August2012",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Designing of microprocessor based controllers requires specific hardware as
well as software programming. Programming depends upon type of the software
whether operating software or application software. Programming requires
knowledge of system configuration and controller specific programming. Programs
are always in digital form so microprocessor can control directly at digital
level called Direct Digital Control (DDC).
","[{'version': 'v1', 'created': 'Mon, 1 Oct 2012 21:03:03 GMT'}]",2015-03-13,"[['Dilawari', 'Jaswinder Singh', ''], ['Sandhu', 'Gurpreet Singh', '']]","['Controller Software', 'DDC', 'Controller Configuration', 'Controller Programming', 'Custom Level Programming', 'Digital Form']"
14136,1307.6711,Rahul Upadhyay,Rahul R Upadhyay,Study of Encryption and Decryption of Wave File in Image Formats,"6 pages, 16 figures, 3 tables",,,,cs.CR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a novel method of encrypting wave files in popular image
formats like JPEG, TIF and PNG along with retrieving them from these image
files. MATLAB software is used to perform matrix manipulation to encrypt and
decrypt sound files into and from image files. This method is not only a
stenographic means but also a data compression technique.
","[{'version': 'v1', 'created': 'Thu, 25 Jul 2013 12:12:47 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Aug 2013 16:29:03 GMT'}]",2013-08-27,"[['Upadhyay', 'Rahul R', '']]","['Stenography', 'Rasterization', 'Matlab', 'Grayscale Image']"
14137,1208.4650,Janusz Brzozowski,"Janusz Brzozowski, Baiyu Li",Syntactic Complexity of R- and J-Trivial Regular Languages,"17 pages, 5 figures, 1 table",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The syntactic complexity of a regular language is the cardinality of its
syntactic semigroup. The syntactic complexity of a subclass of the class of
regular languages is the maximal syntactic complexity of languages in that
class, taken as a function of the state complexity n of these languages. We
study the syntactic complexity of R- and J-trivial regular languages, and prove
that n! and floor of [e(n-1)!] are tight upper bounds for these languages,
respectively. We also prove that 2^{n-1} is the tight upper bound on the state
complexity of reversal of J-trivial regular languages.
","[{'version': 'v1', 'created': 'Thu, 23 Aug 2012 00:28:23 GMT'}, {'version': 'v2', 'created': 'Sun, 3 Feb 2013 20:45:15 GMT'}]",2015-03-20,"[['Brzozowski', 'Janusz', ''], ['Li', 'Baiyu', '']]","['finite automaton', 'J -trivial', 'monoid', 'regular language', 'reversal', 'R-trivial', 'semigroup', 'syntactic complexity']"
14138,1401.0823,Madhumangal Pal Dr.,Hossein Rashmanlou and Madhumangal Pal,Antipodal Interval-Valued Fuzzy Graphs,24 pages; 9 figures; 32 referenes,"International Journal of Applications of Fuzzy Sets and Artificial
  Intelligence (ISSN 2241-1240), Vol. 3 ( 2013), 107-130",,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Concepts of graph theory have applications in many areas of computer science
including data mining, image segmentation, clustering, image capturing,
networks, etc . An interval-valued fuzzy set is a generalization of the notion
of a fuzzy set. Interval-valued fuzzy models give more precision, flexibility
and compatibility to the system as compared to the fuzzy models. In this paper,
we introduce the concept of antipodal interval - valued fuzzy graph and self
median interval-valued fuzzy graph of the given interval-valued fuzzy graph. We
investigate isomorphism properties of antipodal interval - valued fuzzy graphs.
","[{'version': 'v1', 'created': 'Sat, 4 Jan 2014 15:45:34 GMT'}]",2014-01-07,"[['Rashmanlou', 'Hossein', ''], ['Pal', 'Madhumangal', '']]","['Antipodal interval -valued fuzzy graph', 'Median interval-valued fuzzy graph', 'µ -Status', 'υ -Status']"
14139,1007.3663,Piero Bonatti,Sabrina Baselice and Piero A. Bonatti,A decidable subclass of finitary programs,,"Theory and Practice of Logic Programming (2010), 10:481-496
  Cambridge University Press",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Answer set programming - the most popular problem solving paradigm based on
logic programs - has been recently extended to support uninterpreted function
symbols. All of these approaches have some limitation. In this paper we propose
a class of programs called FP2 that enjoys a different trade-off between
expressiveness and complexity. FP2 programs enjoy the following unique
combination of properties: (i) the ability of expressing predicates with
infinite extensions; (ii) full support for predicates with arbitrary arity;
(iii) decidability of FP2 membership checking; (iv) decidability of skeptical
and credulous stable model reasoning for call-safe queries. Odd cycles are
supported by composing FP2 programs with argument restricted programs.
","[{'version': 'v1', 'created': 'Wed, 21 Jul 2010 14:00:14 GMT'}]",2010-07-22,"[['Baselice', 'Sabrina', ''], ['Bonatti', 'Piero A.', '']]","['Answer set programming with function symbols', 'Infinite stable models', 'Norms']"
14140,1705.08550,Wentao Zhu,"Wentao Zhu, Qi Lou, Yeeleng Scott Vang, and Xiaohui Xie","Deep Multi-instance Networks with Sparse Label Assignment for Whole
  Mammogram Classification",MICCAI 2017 Camera Ready,,,,cs.CV cs.LG cs.NE,http://creativecommons.org/licenses/by/4.0/,"  Mammogram classification is directly related to computer-aided diagnosis of
breast cancer. Traditional methods rely on regions of interest (ROIs) which
require great efforts to annotate. Inspired by the success of using deep
convolutional features for natural image analysis and multi-instance learning
(MIL) for labeling a set of instances/patches, we propose end-to-end trained
deep multi-instance networks for mass classification based on whole mammogram
without the aforementioned ROIs. We explore three different schemes to
construct deep multi-instance networks for whole mammogram classification.
Experimental results on the INbreast dataset demonstrate the robustness of
proposed networks compared to previous work using segmentation and detection
annotations.
","[{'version': 'v1', 'created': 'Tue, 23 May 2017 22:16:20 GMT'}]",2017-05-25,"[['Zhu', 'Wentao', ''], ['Lou', 'Qi', ''], ['Vang', 'Yeeleng Scott', ''], ['Xie', 'Xiaohui', '']]","['Deep multi-instance learning', 'whole mammogram classification', 'maxpooling-based MIL', 'label assignment-based MIL', 'sparse MIL']"
14141,1504.04116,Mohammad Rahaman,"Farzana Afrin, Mohammad Saiedur Rahaman, Mohammad Saidur Rahman,
  Mashiour Rahman",Student Satisfaction mining in a typical core course of Computer Science,AIUB Journal of Science and Engineering (AJSE) Vol.11 No.1 (2012),,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Students' satisfaction plays a vital role in success of an educational
institute. Hence, many educational institutes continuously improve their
service to produce a supportive learning environment to satisfy the student
need. For this reason, educational institutions collect student satisfaction
data to make decision about institutional quality, but till now it cannot be
determined because student satisfaction is a complex matter which is influenced
by variety of characteristics of students and institutions. There are many
studies have been performed to inspect student satisfaction in the form of
college services, programs, student accommodation facility, student-faculty
interaction, consulting hours etc. So, still we cannot have a standard method
to know what is going on about satisfaction in the case of a core course. In
this research we determined the attributes that heavily affect student
satisfaction in a core course of computer science and the current status of
other attributes as well.
","[{'version': 'v1', 'created': 'Thu, 16 Apr 2015 07:30:59 GMT'}]",2015-04-17,"[['Afrin', 'Farzana', ''], ['Rahaman', 'Mohammad Saiedur', ''], ['Rahman', 'Mohammad Saidur', ''], ['Rahman', 'Mashiour', '']]","['Satisfaction mining', 'satisfaction attributes', 'satisfaction in core course']"
14142,1705.05479,Debajyoti Mondal,Debajyoti Mondal and Lev Nachmanson,"A New Approach to GraphMaps, a System Browsing Large Graphs as
  Interactive Maps","Appears in the Proceedings of the 8th International Conference on
  Information Visualization Theory and Applications (IVAPP 2018)",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A GraphMaps is a system that visualizes a graph using zoom levels, which is
similar to a geographic map visualization. GraphMaps reveals the structural
properties of the graph and enables users to explore the graph in a natural way
by using the standard zoom and pan operations. The available implementation of
GraphMaps faces many challenges such as the number of zoom levels may be large,
nodes may be unevenly distributed to different levels, shared edges may create
ambiguity due to the selection of multiple nodes. In this paper, we develop an
algorithmic framework to construct GraphMaps from any given mesh (generated
from a 2D point set), and for any given number of zoom levels. We demonstrate
our approach introducing competition mesh, which is simple to construct, has a
low dilation and high angular resolution. We present an algorithm for assigning
nodes to zoom levels that minimizes the change in the number of nodes on
visible on the screen while the user zooms in and out between the levels. We
think that keeping this change small facilitates smooth browsing of the graph.
We also propose new node selection techniques to cope with some of the
challenges of the GraphMaps approach.
","[{'version': 'v1', 'created': 'Mon, 15 May 2017 23:25:07 GMT'}, {'version': 'v2', 'created': 'Sun, 12 Aug 2018 04:19:52 GMT'}]",2018-08-14,"[['Mondal', 'Debajyoti', ''], ['Nachmanson', 'Lev', '']]","['Network Visualization', 'Layered Drawing', 'Geometric Spanners', 'Competition Mesh', 'Network Flow']"
14143,1606.06428,Wei Zhao,"Wei Zhao, Xilin Tang, Ze Gu","All $\alpha+u\beta$-constacyclic codes of length $np^{s}$ over
  $\mathbb{F}_{p^{m}}+u\mathbb{F}_{p^{m}}$",arXiv admin note: text overlap with arXiv:1512.01406 by other authors,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $\mathbb{F}_{p^{m}}$ be a finite field with cardinality $p^{m}$ and
$R=\mathbb{F}_{p^{m}}+u\mathbb{F}_{p^{m}}$ with $u^{2}=0$. We aim to determine
all $\alpha+u\beta$-constacyclic codes of length $np^{s}$ over $R$, where
$\alpha,\beta\in\mathbb{F}_{p^{m}}^{*}$, $n, s\in\mathbb{N}_{+}$ and
$\gcd(n,p)=1$. Let $\alpha_{0}\in\mathbb{F}_{p^{m}}^{*}$ and
$\alpha_{0}^{p^{s}}=\alpha$. The residue ring $R[x]/\langle
x^{np^{s}}-\alpha-u\beta\rangle$ is a chain ring with the maximal ideal
$\langle x^{n}-\alpha_{0}\rangle$ in the case that $x^{n}-\alpha_{0}$ is
irreducible in $\mathbb{F}_{p^{m}}[x]$. If $x^{n}-\alpha_{0}$ is reducible in
$\mathbb{F}_{p^{m}}[x]$, we give the explicit expressions of the ideals of
$R[x]/\langle x^{np^{s}}-\alpha-u\beta\rangle$. Besides, the number of
codewords and the dual code of every $\alpha+u\beta$-constacyclic code are
provided.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2016 05:20:55 GMT'}]",2016-06-22,"[['Zhao', 'Wei', ''], ['Tang', 'Xilin', ''], ['Gu', 'Ze', '']]","['Constacyclic code', 'Dual code', 'Self dual code', 'Repeated-root']"
14144,0710.2659,Julien Hendrickx,"Julien M. Hendrickx, Changbin Yu, Baris Fidan and Brian D.O. Anderson","Rigidity and persistence for ensuring shape maintenance of multiagent
  meta formations (ext'd version)","1 zip file containing 1 .tex files, and 39 .eps files. The paper
  (including the appendix) contains 13 Figures",,,,cs.MA cs.DM,,"  This paper treats the problem of the merging of formations, where the
underlying model of a formation is graphical. We first analyze the rigidity and
persistence of meta-formations, which are formations obtained by connecting
several rigid or persistent formations. Persistence is a generalization to
directed graphs of the undirected notion of rigidity. In the context of moving
autonomous agent formations, persistence characterizes the efficacy of a
directed structure of unilateral distance constraints seeking to preserve a
formation shape. We derive then, for agents evolving in a two- or
three-dimensional space, the conditions under which a set of persistent
formations can be merged into a persistent meta-formation, and give the minimal
number of interconnections needed for such a merging. We also give conditions
for a meta-formation obtained by merging several persistent formations to be
persistent.
","[{'version': 'v1', 'created': 'Sun, 14 Oct 2007 13:51:09 GMT'}]",2007-10-16,"[['Hendrickx', 'Julien M.', ''], ['Yu', 'Changbin', ''], ['Fidan', 'Baris', ''], ['Anderson', 'Brian D. O.', '']]","['Formations', 'Meta-formations', 'Rigidity', 'Persistence', 'Autonomous Agents']"
14145,2007.05556,Panagiotis Papadopoulos,"Gon\c{c}alo Pestana, I\~nigo Querejeta-Azurmendi, Panagiotis
  Papadopoulos, Benjamin Livshits",THEMIS: Decentralized and Trustless Ad Platform with Reporting Integrity,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online advertising fuels the (seemingly) free internet. However, although
users can access most websites free of charge, they need to pay a heavy cost on
their privacy and blindly trust third parties and intermediaries that absorb
great amounts of adrevenues and user data. This is one of the reasons users opt
out from advertising by resorting ad blockers thatin turn cost publishers
millions of dollars in lost adrevenues. Existing privacy-preserving advertising
approaches(e.g., Adnostic, Privad, Brave Ads) from both industry and academia
cannot guarantee the integrity of the performance analytics they provide to
advertisers, while they also rely on centralized management that users have to
trust without being able to audit. In this paper, we propose THEMIS, a novel
privacy-by-design ad platform that is decentralized and requires zero trust
from users. THEMIS (i) provides auditability to all participants, (ii) rewards
users for viewing ads, and (iii) allows advertisers to verify the performance
and billing reports of their ad campaigns. To demonstrate the feasibility and
practicability of our approach, we implemented a prototype of THEMIS using a
combination of smart contracts and zero-knowledge schemes. Performance
evaluation results show that during adreward payouts, THEMIS can support more
than 51M users on a single-sidechain setup or 153M users ona multi-sidechain
setup, thus proving that THEMIS scales linearly.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 18:24:19 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Aug 2020 17:13:38 GMT'}]",2020-08-05,"[['Pestana', 'Gonçalo', ''], ['Querejeta-Azurmendi', 'Iñigo', ''], ['Papadopoulos', 'Panagiotis', ''], ['Livshits', 'Benjamin', '']]","['Blockchain', 'Ad Platform', 'Trustless', 'Reporting Integrity', 'User Privacy', 'Zero Knowledge']"
14146,1610.08854,Manish Sahu,"Manish Sahu, Anirban Mukhopadhyay, Angelika Szengel and Stefan Zachow",Tool and Phase recognition using contextual CNN features,MICCAI M2CAI 2016 Surgical tool & phase detection challenge report,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A transfer learning method for generating features suitable for surgical
tools and phase recognition from the ImageNet classification features [1] is
proposed here. In addition, methods are developed for generating contextual
features and combining them with time series analysis for final classification
using multi-class random forest. The proposed pipeline is tested over the
training and testing datasets of M2CAI16 challenges: tool and phase detection.
Encouraging results are obtained by leave-one-out cross validation evaluation
on the training dataset.
","[{'version': 'v1', 'created': 'Thu, 27 Oct 2016 15:54:41 GMT'}]",2016-10-28,"[['Sahu', 'Manish', ''], ['Mukhopadhyay', 'Anirban', ''], ['Szengel', 'Angelika', ''], ['Zachow', 'Stefan', '']]","['Surgical Tool Detection', 'Surgical Phase Detection', 'CNN', 'Contextual Features', 'Random Forest', 'Transfer Learning']"
14147,1604.07724,Hendrik Molter,"Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik
  Molter, Rolf Niedermeier, Manuel Sorge",Assessing the Computational Complexity of Multi-Layer Subgraph Detection,,,,,cs.CC cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-layer graphs consist of several graphs (layers) over the same vertex
set. They are motivated by real-world problems where entities (vertices) are
associated via multiple types of relationships (edges in different layers). We
chart the border of computational (in)tractability for the class of subgraph
detection problems on multi-layer graphs, including fundamental problems such
as maximum matching, finding certain clique relaxations (motivated by community
detection), or path problems. Mostly encountering hardness results, sometimes
even for two or three layers, we can also spot some islands of tractability.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2016 15:45:55 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Oct 2019 18:00:29 GMT'}]",2019-10-23,"[['Bredereck', 'Robert', ''], ['Komusiewicz', 'Christian', ''], ['Kratsch', 'Stefan', ''], ['Molter', 'Hendrik', ''], ['Niedermeier', 'Rolf', ''], ['Sorge', 'Manuel', '']]","['Parameterized Computational Complexity', 'Exact Algorithms', 'Multi-modal Data', 'Matching', 'Hamiltonian Path', 'Community Detection']"
14148,1610.05361,Hassan Taherian,Hassan Taherian,End-to-end attention-based distant speech recognition with Highway LSTM,"8 pages, 2 figures",,,,cs.CL,http://creativecommons.org/publicdomain/zero/1.0/,"  End-to-end attention-based models have been shown to be competitive
alternatives to conventional DNN-HMM models in the Speech Recognition Systems.
In this paper, we extend existing end-to-end attention-based models that can be
applied for Distant Speech Recognition (DSR) task. Specifically, we propose an
end-to-end attention-based speech recognizer with multichannel input that
performs sequence prediction directly at the character level. To gain a better
performance, we also incorporate Highway long short-term memory (HLSTM) which
outperforms previous models on AMI distant speech recognition task.
","[{'version': 'v1', 'created': 'Mon, 17 Oct 2016 21:16:56 GMT'}]",2016-10-19,"[['Taherian', 'Hassan', '']]","['Distant Speech Recognition', 'Attention', 'Highway LSTM']"
14149,1708.02018,Xiu Fang,Xiu Susie Fang and Quan Z. Sheng and Xianzhi Wang and Anne H.H. Ngu,SmartMTD: A Graph-Based Approach for Effective Multi-Truth Discovery,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Big Data era features a huge amount of data that are contributed by
numerous sources and used by many critical data-driven applications. Due to the
varying reliability of sources, it is common to see conflicts among the
multi-source data, making it difficult to determine which data sources to
trust. Recently, truth discovery has emerged as a means of addressing this
challenging issue by determining data veracity jointly with estimating the
reliability of data sources. A fundamental issue with current truth discovery
methods is that they generally assume only one true value for each object,
while in reality, objects may have multiple true values. In this paper, we
propose a graph-based approach, called SmartMTD, to unravel the truth discovery
problem beyond the single-truth assumption, or the multi-truth discovery
problem. SmartMTD models and quantifies two types of source relations to
estimate source reliability precisely and to detect malicious agreement among
sources for effective multi-truth discovery. In particular, two graphs are
constructed based on the modeled source relations. They are further used to
derive the two aspects of source reliability (i.e., positive precision and
negative precision) via random walk computation. Empirical studies on two large
real-world datasets demonstrate the effectiveness of our approach.
","[{'version': 'v1', 'created': 'Mon, 7 Aug 2017 07:36:33 GMT'}]",2017-08-08,"[['Fang', 'Xiu Susie', ''], ['Sheng', 'Quan Z.', ''], ['Wang', 'Xianzhi', ''], ['Ngu', 'Anne H. H.', '']]","['Big Data', 'Truth Discovery', 'MultipleTrue Values', 'Object Popularity', 'Copy Detection']"
14150,1307.4124,Atta ur Rehman Khan,"Sardar M. Bilal, Muhammad Naveed Dilber, Atta ur Rehman Khan",Routing Proposals for Multipath Interdomain Routing,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet is composed of numbers of independent autonomous systems. BGP is
used to disseminate reachability information and establishing path between
autonomous systems. Each autonomous system is allowed to select a single route
to a destination and then export the selected route to its neighbors. The
selection of single best route imposes restrictions on the use of alternative
paths during interdomain link failure and thus, incurred packet loss. Packet
loss still occurs even when multiple paths exist between source and destination
but these paths have not been utilized. To minimize the packet loss, when
multiple paths exist, multipath routing techniques are introduced. Multipath
routing techniques ensure the use of alternative paths on link failure. It
computes set of paths which can be used when primary path is not available and
it also provides a way to transit domains to have control over the traffic
flow. This can be achieved by little modification to current BGP. This paper
highlights different multipath routing techniques and also discusses the
overhead incurred by each of them.
","[{'version': 'v1', 'created': 'Mon, 15 Jul 2013 22:50:59 GMT'}]",2013-07-17,"[['Bilal', 'Sardar M.', ''], ['Dilber', 'Muhammad Naveed', ''], ['Khan', 'Atta ur Rehman', '']]","['BGP', 'Interdomain Routing', 'Multipath', 'Transient disconnectivity']"
14151,2006.04515,Vittorio Lippi,"Vittorio Lippi, Thomas Mergner, Christoph Maurer","Deep Learning for Posture Control Nonlinear Model System and Noise
  Identification","to be published in ICINCO 2020, Camera ready version",,,,cs.RO cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we present a system identification procedure based on
Convolutional Neural Networks (CNN) for human posture control models. A usual
approach to the study of human posture control consists in the identification
of parameters for a control system. In this context, linear models are
particularly popular due to the relative simplicity in identifying the required
parameters and to analyze the results. Nonlinear models, conversely, are
required to predict the real behavior exhibited by human subjects and hence it
is desirable to use them in posture control analysis. The use of CNN aims to
overcome the heavy computational requirement for the identification of
nonlinear models, in order to make the analysis of experimental data less time
consuming and, in perspective, to make such analysis feasible in the context of
clinical tests. Some potential implications of the method for humanoid robotics
are also discussed.
","[{'version': 'v1', 'created': 'Thu, 4 Jun 2020 19:34:24 GMT'}]",2020-06-09,"[['Lippi', 'Vittorio', ''], ['Mergner', 'Thomas', ''], ['Maurer', 'Christoph', '']]","['Posture Control', 'Deep Learning', 'System Identification', 'Parametric Nonlinear System']"
14152,1501.05286,Luigi Mascolo,"Luigi Mascolo, Marco Quartulli, Pietro Guccione, Giovanni Nico, Igor
  G. Olaizola","Distributed mining of large scale remote sensing image archives on
  public computing infrastructures",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Earth Observation (EO) mining aims at supporting efficient access and
exploration of petabyte-scale space- and airborne remote sensing archives that
are currently expanding at rates of terabytes per day. A significant challenge
is performing the analysis required by envisaged applications --- like for
instance process mapping for environmental risk management --- in reasonable
time. In this work, we address the problem of content-based image retrieval via
example-based queries from EO data archives. In particular, we focus on the
analysis of polarimetric SAR data, for which target decomposition theorems have
proved fundamental in discovering patterns in data and characterize the ground
scattering properties. To this end, we propose an interactive region-oriented
content-based image mining system in which 1) unsupervised ingestion processes
are distributed onto virtual machines in elastic, on-demand computing
infrastructures 2) archive-scale content hierarchical indexing is implemented
in terms of a ""big data"" analytics cluster-computing framework 3) query
processing amounts to traversing the generated binary tree index, computing
distances that correspond to descriptor-based similarity measures between image
groups and a query image tile. We describe in depth both the strategies and the
actual implementations for the ingestion and indexing components, and verify
the approach by experiments carried out on the NASA/JPL UAVSAR full
polarimetric data archive. We report the results of the tests performed on
computer clusters by using a public Infrastructure-as-a-Service and evaluating
the impact of cluster configuration on system performance. Results are
promising for data mapping and information retrieval applications.
","[{'version': 'v1', 'created': 'Sat, 17 Jan 2015 08:37:44 GMT'}]",2015-01-22,"[['Mascolo', 'Luigi', ''], ['Quartulli', 'Marco', ''], ['Guccione', 'Pietro', ''], ['Nico', 'Giovanni', ''], ['Olaizola', 'Igor G.', '']]","['Content–Based Retrieval', 'Remote Sensing', 'Cloude-Pottier decomposition', 'Cloud Computing', 'Big Data']"
14153,1410.3582,Abid Mehmood,Abid Mehmood and Dayang N.A. Jawawi,"An exploratory study of the suitability of UML-based aspect modeling
  techniques with respect to their integration into Model-Driven Engineering
  context",,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The integration of aspect oriented modeling approaches with model-driven
engineering process achieved through their direct transformation to
aspect-oriented code is expected to enhance the software development from many
perspectives. However, since no aspect modeling technique has been adopted as
the standard while the code generation has to be fully dependent on the input
model, it becomes imperative to compare all ubiquitous techniques on the basis
of some appropriate criteria. This study aims to assess existing UML-based
aspect-oriented modeling techniques from the perspective of their suitability
with regards to integration into model-driven engineering process through
aspect-oriented code generation. We defined an evaluation framework and
employed it to evaluate 14 well-published, UML-based aspect-oriented modeling
approaches. Further, based on the comparison results, we selected 2 modeling
approaches, Reusable Aspect Models and Theme/UML, and proceeded to evaluate
them in a detailed way from specific perspectives of design and its mapping to
the implementation code. Results of the comparison of 14 approaches show that
majority of aspect modeling approaches lack from different perspectives, which
results in reducing their use in practice within the context of model-driven
engineering. The in-depth comparison of Reusable Aspect Models and Theme/UML
reveals some points equally shared by both approaches, and identifies some
areas where the former has advantage over the latter.
","[{'version': 'v1', 'created': 'Tue, 14 Oct 2014 06:11:11 GMT'}]",2014-10-15,"[['Mehmood', 'Abid', ''], ['Jawawi', 'Dayang N. A.', '']]","['aspect‐oriented\tmodeling', 'model‐driven\tengineering', 'code\tgeneration']"
14154,1704.05521,Riccardo Lazzeretti PhD,"Antonella Del Pozzo, Silvia Bonomi, Riccardo Lazzeretti and Roberto
  Baldoni","Building Regular Registers with Rational Malicious Servers and Anonymous
  Clients -- Extended Version","Extended version of paper accepted at 2017 International Symposium on
  Cyber Security Cryptography and Machine Learning (CSCML 2017)",,,,cs.DC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper addresses the problem of emulating a regular register in a
synchronous distributed system where clients invoking ${\sf read}()$ and ${\sf
write}()$ operations are anonymous while server processes maintaining the state
of the register may be compromised by rational adversaries (i.e., a server
might behave as \emph{rational malicious Byzantine} process). We first model
our problem as a Bayesian game between a client and a rational malicious server
where the equilibrium depends on the decisions of the malicious server (behave
correctly and not be detected by clients vs returning a wrong register value to
clients with the risk of being detected and then excluded by the computation).
We prove such equilibrium exists and finally we design a protocol implementing
the regular register that forces the rational malicious server to behave
correctly.
","[{'version': 'v1', 'created': 'Tue, 18 Apr 2017 20:37:46 GMT'}]",2017-04-20,"[['Del Pozzo', 'Antonella', ''], ['Bonomi', 'Silvia', ''], ['Lazzeretti', 'Riccardo', ''], ['Baldoni', 'Roberto', '']]","['Regular Register', 'Rational Malicious Processes', 'Anonymity', 'Bayesian Game']"
14155,1205.1657,Maher Heni,Maher Heni and Ridha Bouallegue,Power control in reactive routing protocol for Mobile Ad Hoc Network,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of this work is to change the routing strategy of AODV protocol (Ad
hoc On Demand Vector) in order to improve the energy consumption in mobile ad
hoc networks (MANET). The purpose is to minimize the regular period of HELLO
messages generated by the AODV protocol used for the research, development and
maintenance of routes. This information is useful to have an idea about battery
power levels of different network hosts. After storing this information, the
node elect the shortest path following the classical model used this
information to elect safest path (make a compromise) in terms of energy.
Transmitter node does not select another node as its battery will be exhausted
soon. Any node of the network can have the same information's about the
neighborhoods as well as other information about the energy level of the
different terminal to avoid routing using a link that will be lost due to an
exhausted battery of a node in this link. Analytical study and simulations by
Jist/SWANS have been conducted to note that no divergence relatively to the
classical AODV, a node can have this type of information that improves the
energy efficiency in ad hoc networks.
","[{'version': 'v1', 'created': 'Tue, 8 May 2012 10:35:54 GMT'}]",2012-05-09,"[['Heni', 'Maher', ''], ['Bouallegue', 'Ridha', '']]","['Ad-hoc Network', 'Routing protocol', 'energy consumption', 'AODV routing protocol', 'performance evaluation   1']"
14156,1606.05675,Chang Liu,"Chang Liu, Yu Cao, Yan Luo, Guanling Chen, Vinod Vokkarane and
  Yunsheng Ma","DeepFood: Deep Learning-Based Food Image Recognition for Computer-Aided
  Dietary Assessment","12 pages, 2 figures, 6 tables, ICOST 2016",,,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Worldwide, in 2014, more than 1.9 billion adults, 18 years and older, were
overweight. Of these, over 600 million were obese. Accurately documenting
dietary caloric intake is crucial to manage weight loss, but also presents
challenges because most of the current methods for dietary assessment must rely
on memory to recall foods eaten. The ultimate goal of our research is to
develop computer-aided technical solutions to enhance and improve the accuracy
of current measurements of dietary intake. Our proposed system in this paper
aims to improve the accuracy of dietary assessment by analyzing the food images
captured by mobile devices (e.g., smartphone). The key technique innovation in
this paper is the deep learning-based food image recognition algorithms.
Substantial research has demonstrated that digital imaging accurately estimates
dietary intake in many environments and it has many advantages over other
methods. However, how to derive the food information (e.g., food type and
portion size) from food image effectively and efficiently remains a challenging
and open research problem. We propose a new Convolutional Neural Network
(CNN)-based food image recognition algorithm to address this problem. We
applied our proposed approach to two real-world food image data sets (UEC-256
and Food-101) and achieved impressive results. To the best of our knowledge,
these results outperformed all other reported work using these two data sets.
Our experiments have demonstrated that the proposed approach is a promising
solution for addressing the food image recognition problem. Our future work
includes further improving the performance of the algorithms and integrating
our system into a real-world mobile and cloud computing-based system to enhance
the accuracy of current measurements of dietary intake.
","[{'version': 'v1', 'created': 'Fri, 17 Jun 2016 21:03:19 GMT'}]",2016-06-21,"[['Liu', 'Chang', ''], ['Cao', 'Yu', ''], ['Luo', 'Yan', ''], ['Chen', 'Guanling', ''], ['Vokkarane', 'Vinod', ''], ['Ma', 'Yunsheng', '']]","['Deep learning', 'food image recognition', 'dietary assessment']"
14157,1409.4995,Xirong Li,"Xixi He, Xirong Li, Gang Yang, Jieping Xu, Qin Jin",Adaptive Tag Selection for Image Annotation,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Not all tags are relevant to an image, and the number of relevant tags is
image-dependent. Although many methods have been proposed for image
auto-annotation, the question of how to determine the number of tags to be
selected per image remains open. The main challenge is that for a large tag
vocabulary, there is often a lack of ground truth data for acquiring optimal
cutoff thresholds per tag. In contrast to previous works that pre-specify the
number of tags to be selected, we propose in this paper adaptive tag selection.
The key insight is to divide the vocabulary into two disjoint subsets, namely a
seen set consisting of tags having ground truth available for optimizing their
thresholds and a novel set consisting of tags without any ground truth. Such a
division allows us to estimate how many tags shall be selected from the novel
set according to the tags that have been selected from the seen set. The
effectiveness of the proposed method is justified by our participation in the
ImageCLEF 2014 image annotation task. On a set of 2,065 test images with ground
truth available for 207 tags, the benchmark evaluation shows that compared to
the popular top-$k$ strategy which obtains an F-score of 0.122, adaptive tag
selection achieves a higher F-score of 0.223. Moreover, by treating the
underlying image annotation system as a black box, the new method can be used
as an easy plug-in to boost the performance of existing systems.
","[{'version': 'v1', 'created': 'Wed, 17 Sep 2014 13:50:37 GMT'}]",2014-09-18,"[['He', 'Xixi', ''], ['Li', 'Xirong', ''], ['Yang', 'Gang', ''], ['Xu', 'Jieping', ''], ['Jin', 'Qin', '']]","['Image annotation', 'adaptive tag selection', 'ImageCLEF evaluation']"
14158,1512.00939,Deepika Banchhor,"Siddharth Choubey, Deepika Banchhor","A Literature Survey of various Fingerprint De-noising Techniques to
  justify the need of a new De-noising model based upon Pixel Component
  Analysis",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image Preprocessing is a vital step in the field of image processing for
biometric pattern recognition. This paper studies and reviews various classical
and modern fingerprint image de-noising models. The various model used for
de-noising ranges widely from transform matrix using frequency, histogram model
de-noising, de-noising by introducing Gabor filter and its types to enhance
fingerprint images.
  The output efficiency of various de-noising model proposed earlier is
calculated on the basis of SNR (signal to noise ratio) and MSE (mean square
error rate). Our simulated experimental results indicates that incorporating
the de-noising model based on Gabor filter inside domain of wavelet ranges with
composite method only betters MSE (Mean Square Error). Improved MSE without
significant improvement in SNR improves the fingerprint images only by a little
margin which is non-optimal in nature. Thus the objective of this research
paper is to build an optimal de-noising model for fingerprint images so that
its usage in biometric authentication can be more robust in nature.
","[{'version': 'v1', 'created': 'Thu, 3 Dec 2015 04:13:38 GMT'}]",2015-12-04,"[['Choubey', 'Siddharth', ''], ['Banchhor', 'Deepika', '']]","['FPI (Fingerprint Image)', 'PCA (Pixel Component Analysis)', 'Gabor Filters', 'SNR (Signal-to-noise ratio)', 'MSE (Mean Square Error)']"
14159,1609.02489,Christian Bracher,"Christian Bracher, Sebastian Heinz and Roland Vollgraf","Fashion DNA: Merging Content and Sales Data for Recommendation and
  Article Mapping","10 pages, 13 figures. Paper presented at the workshop ""Machine
  Learning Meets Fashion,"" KDD 2016 Conference, San Francisco, USA, March 14,
  2016",,,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a method to determine Fashion DNA, coordinate vectors locating
fashion items in an abstract space. Our approach is based on a deep neural
network architecture that ingests curated article information such as tags and
images, and is trained to predict sales for a large set of frequent customers.
In the process, a dual space of customer style preferences naturally arises.
Interpretation of the metric of these spaces is straightforward: The product of
Fashion DNA and customer style vectors yields the forecast purchase likelihood
for the customer-item pair, while the angle between Fashion DNA vectors is a
measure of item similarity. Importantly, our models are able to generate
unbiased purchase probabilities for fashion items based solely on article
information, even in absence of sales data, thus circumventing the ""cold-start
problem"" of collaborative recommendation approaches. Likewise, it generalizes
easily and reliably to customers outside the training set. We experiment with
Fashion DNA models based on visual and/or tag item data, evaluate their
recommendation power, and discuss the resulting article similarities.
","[{'version': 'v1', 'created': 'Thu, 8 Sep 2016 16:48:20 GMT'}]",2016-09-09,"[['Bracher', 'Christian', ''], ['Heinz', 'Sebastian', ''], ['Vollgraf', 'Roland', '']]","['Fashion data', 'neural networks', 'recommendations']"
14160,0806.0128,Feng Xia,Feng Xia,QoS Challenges and Opportunities in Wireless Sensor/Actuator Networks,"12 pages, 1 figure; review","Sensors 2008, 8(2), 1099-1110",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A wireless sensor/actuator network (WSAN) is a group of sensors and actuators
that are geographically distributed and interconnected by wireless networks.
Sensors gather information about the state of physical world. Actuators react
to this information by performing appropriate actions. WSANs thus enable cyber
systems to monitor and manipulate the behavior of the physical world. WSANs are
growing at a tremendous pace, just like the exploding evolution of Internet.
Supporting quality of service (QoS) will be of critical importance for
pervasive WSANs that serve as the network infrastructure of diverse
applications. To spark new research and development interests in this field,
this paper examines and discusses the requirements, critical challenges, and
open research issues on QoS management in WSANs. A brief overview of recent
progress is given.
","[{'version': 'v1', 'created': 'Sun, 1 Jun 2008 07:27:05 GMT'}]",2008-12-18,"[['Xia', 'Feng', '']]","['wireless sensor/actuator network', 'quality of service', 'service-oriented architecture', 'communication protocol', 'self-management', 'power management']"
14161,1609.06741,Kate\v{r}ina Henclov\'a,Katerina Henclova,"Using CMA-ES for tuning coupled PID controllers within models of
  combustion engines","28 pages (single column); after major revision; comparison with SHADE
  method added; author's name and affiliation have changed",,,,cs.SY cs.NE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Proportional integral derivative (PID) controllers are important and widely
used tools in system control. Tuning of the controller gains is a laborious
task, especially for complex systems such as combustion engines. To minimize
the time of an engineer for tuning of the gains in a simulation software, we
propose to formulate a part of the problem as a black-box optimization task. In
this paper, we summarize the properties and practical limitations of tuning of
the gains in this particular application. We investigate the latest methods of
black-box optimization and conclude that the Covariance Matrix Adaptation
Evolution Strategy (CMA-ES) with bi-population restart strategy, elitist parent
selection and active covariance matrix adaptation is best suited for this task.
Details of the algorithm's experiment-based calibration are explained as well
as derivation of a suitable objective function. The method's performance is
compared with that of PSO and SHADE. Finally, its usability is verified on six
models of real engines.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2016 20:35:56 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Oct 2016 11:20:18 GMT'}, {'version': 'v3', 'created': 'Wed, 9 Nov 2016 15:33:24 GMT'}, {'version': 'v4', 'created': 'Mon, 5 Jun 2017 18:39:55 GMT'}]",2017-06-07,"[['Henclova', 'Katerina', '']]","['PID controller', 'tuning coupled controllers', 'CMA-ES', 'black-boxoptimization']"
14162,1603.01056,Chao Wang,Chao Wang,"A novel and automatic pectoral muscle identification algorithm for
  mediolateral oblique (MLO) view mammograms using ImageJ","11 pages, 6 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pectoral muscle identification is often required for breast cancer risk
analysis, such as estimating breast density. Traditional methods are
overwhelmingly based on manual visual assessment or straight line fitting for
the pectoral muscle boundary, which are inefficient and inaccurate since
pectoral muscle in mammograms can have curved boundaries.
  This paper proposes a novel and automatic pectoral muscle identification
algorithm for MLO view mammograms. It is suitable for both scanned film and
full field digital mammograms. This algorithm is demonstrated using a public
domain software ImageJ. A validation of this algorithm has been performed using
real-world data and it shows promising result.
","[{'version': 'v1', 'created': 'Thu, 3 Mar 2016 11:20:23 GMT'}]",2016-03-04,"[['Wang', 'Chao', '']]","['pectoral muscle', 'mammograms', 'MLO', 'ImageJ', 'morphology', 'image analysis']"
14163,1407.3507,Mirela Damian,Mirela Damian and Dumitru V. Voicu,Spanning Properties of Theta-Theta Graphs,"20 pages, 6 figures, 3 tables",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the spanning properties of Theta-Theta graphs. Similar in spirit
with the Yao-Yao graphs, Theta-Theta graphs partition the space around each
vertex into a set of k cones, for some fixed integer k > 1, and select at most
one edge per cone. The difference is in the way edges are selected. Yao-Yao
graphs select an edge of minimum length, whereas Theta-Theta graphs select an
edge of minimum orthogonal projection onto the cone bisector. It has been
established that the Yao-Yao graphs with parameter k = 6k' have spanning ratio
11.67, for k' >= 6. In this paper we establish a first spanning ratio of $7.82$
for Theta-Theta graphs, for the same values of $k$. We also extend the class of
Theta-Theta spanners with parameter 6k', and establish a spanning ratio of
$16.76$ for k' >= 5. We surmise that these stronger results are mainly due to a
tighter analysis in this paper, rather than Theta-Theta being superior to
Yao-Yao as a spanner. We also show that the spanning ratio of Theta-Theta
graphs decreases to 4.64 as k' increases to 8. These are the first results on
the spanning properties of Theta-Theta graphs.
","[{'version': 'v1', 'created': 'Sun, 13 Jul 2014 22:17:06 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Jul 2014 19:44:13 GMT'}]",2014-07-30,"[['Damian', 'Mirela', ''], ['Voicu', 'Dumitru V.', '']]","['Yao graph', 'Theta graph', 'Yao-Yao', 'Theta-Theta', 'spanner']"
14164,1704.04900,Sujay Kadam,"Roshan A. Chavan, Sujay D. Kadam, Abhijith Rajiv and Harish J.
  Palanthandalam-Madapusi","An Input Reconstruction Approach for Command Following in Linear MIMO
  Systems",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The idea of posing a command following or tracking control problem as an
input reconstruction problem is explored in the paper. For a class of square
MIMO systems with known dynamics, by pretending that reference commands are
actual outputs of the system, input reconstruction methods can be used to
determine control action that will result in a system following desired
reference commands. A feedback controller which is a combination of an unbiased
state estimator and an input reconstructor that ensures unbiased tracking of
reference commands is proposed. Simulations and real-time implementation are
presented to demonstrate utility of the proposed idea. Conditions under which
proposed controller may be used for non-square systems are also discussed.
","[{'version': 'v1', 'created': 'Mon, 17 Apr 2017 08:00:53 GMT'}]",2017-04-18,"[['Chavan', 'Roshan A.', ''], ['Kadam', 'Sujay D.', ''], ['Rajiv', 'Abhijith', ''], ['Palanthandalam-Madapusi', 'Harish J.', '']]","['Command following', 'input reconstruction', 'Kalman filter', 'state']"
14165,1505.04693,Jian-Jia Chen,Jian-Jia Chen,"Partitioned Multiprocessor Fixed-Priority Scheduling of Sporadic
  Real-Time Tasks",Extended version of ECRTS 2016,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Partitioned multiprocessor scheduling has been widely accepted in academia
and industry to statically assign and partition real-time tasks onto identical
multiprocessor systems. This paper studies fixed-priority partitioned
multiprocessor scheduling for sporadic real-time systems, in which
deadline-monotonic scheduling is applied on each processor. Prior to this
paper, the best known results are by Fisher, Baruah, and Baker with speedup
factors $4-\frac{2}{M}$ and $3-\frac{1}{M}$ for arbitrary-deadline and
constrained-deadline sporadic real-time task systems, respectively, where $M$
is the number of processors. We show that a greedy mapping strategy has a
speedup factor $3-\frac{1}{M}$ when considering task systems with arbitrary
deadlines. Such a factor holds for polynomial-time schedulability tests and
exponential-time (exact) schedulability tests. Moreover, we also improve the
speedup factor to $2.84306$ when considering constrained-deadline task systems.
We also provide tight examples when the fitting strategy in the mapping stage
is arbitrary and $M$ is sufficiently large. For both constrained- and
arbitrary-deadline task systems, the analytical result surprisingly shows that
using exact tests does not gain theoretical benefits (with respect to speedup
factors) for an arbitrary fitting strategy.
","[{'version': 'v1', 'created': 'Mon, 18 May 2015 15:54:58 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Feb 2016 21:40:33 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Jun 2016 18:32:38 GMT'}]",2016-06-23,"[['Chen', 'Jian-Jia', '']]","['Sporadic real-time tasks', 'resource augmentation', 'approximation', 'schedulability analysis']"
14166,0805.2368,Alex Smola J,"Arthur Gretton, Karsten Borgwardt, Malte J. Rasch, Bernhard Scholkopf,
  Alexander J. Smola",A Kernel Method for the Two-Sample Problem,,,,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a framework for analyzing and comparing distributions, allowing us
to design statistical tests to determine if two samples are drawn from
different distributions. Our test statistic is the largest difference in
expectations over functions in the unit ball of a reproducing kernel Hilbert
space (RKHS). We present two tests based on large deviation bounds for the test
statistic, while a third is based on the asymptotic distribution of this
statistic. The test statistic can be computed in quadratic time, although
efficient linear time approximations are available. Several classical metrics
on distributions are recovered when the function space used to compute the
difference in expectations is allowed to be more general (eg. a Banach space).
We apply our two-sample tests to a variety of problems, including attribute
matching for databases using the Hungarian marriage method, where they perform
strongly. Excellent performance is also obtained when comparing distributions
over graphs, for which these are the first such tests.
","[{'version': 'v1', 'created': 'Thu, 15 May 2008 17:46:53 GMT'}]",2008-05-16,"[['Gretton', 'Arthur', ''], ['Borgwardt', 'Karsten', ''], ['Rasch', 'Malte J.', ''], ['Scholkopf', 'Bernhard', ''], ['Smola', 'Alexander J.', '']]","['Kernel methods', 'two sample test', 'uniform convergence bounds', 'schemamatching', 'asymptotic analysis', 'hypothesis testing']"
14167,1802.08729,Waleed Alomoush,"Waleed Alomoush, Ayat Alrosan",Review: Metaheuristic Search-Based Fuzzy Clustering Algorithms,,,,,cs.NE cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Fuzzy clustering is a famous unsupervised learning method used to collecting
similar data elements within cluster according to some similarity measurement.
But, clustering algorithms suffer from some drawbacks. Among the main weakness
including, selecting the initial cluster centres and the appropriate clusters
number is normally unknown. These weaknesses are considered the most
challenging tasks in clustering algorithms. This paper introduces a
comprehensive review of metahueristic search to solve fuzzy clustering
algorithms problems.
","[{'version': 'v1', 'created': 'Sun, 21 Jan 2018 17:24:31 GMT'}]",2018-02-27,"[['Alomoush', 'Waleed', ''], ['Alrosan', 'Ayat', '']]","['Fuzzy clustering', 'Metaheuristic search', 'Local Search.   1']"
14168,1606.06974,Anushri Jana,"Anushri Jana, Uday P. Khedker, Advaita Datar, R Venkatesh, C Niyas",Scaling Bounded Model Checking By Transforming Programs With Arrays,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bounded Model Checking is one the most successful techniques for finding bugs
in program. However, model checkers are resource hungry and are often unable to
verify programs with loops iterating over large arrays.We present a
transformation that enables bounded model checkers to verify a certain class of
array properties. Our technique transforms an array-manipulating (ANSI-C)
program to an array-free and loop-free (ANSI-C) program thereby reducing the
resource requirements of a model checker significantly. Model checking of the
transformed program using an off-the-shelf bounded model checker simulates the
loop iterations efficiently. Thus, our transformed program is a sound
abstraction of the original program and is also precise in a large number of
cases - we formally characterize the class of programs for which it is
guaranteed to be precise. We demonstrate the applicability and usefulness of
our technique on both industry code as well as academic benchmarks.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2016 15:01:42 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jun 2016 10:42:47 GMT'}, {'version': 'v3', 'created': 'Thu, 1 Dec 2016 13:15:56 GMT'}, {'version': 'v4', 'created': 'Tue, 7 Mar 2017 08:43:20 GMT'}]",2017-03-08,"[['Jana', 'Anushri', ''], ['Khedker', 'Uday P.', ''], ['Datar', 'Advaita', ''], ['Venkatesh', 'R', ''], ['Niyas', 'C', '']]","['Program Transformation', 'Bounded Model Checking', 'Array', 'Verification']"
14169,1205.5927,Youcheng Lou,"Youcheng Lou, Guodong Shi, Karl Henrik Johansson, Yiguang Hong","An Approximate Projected Consensus Algorithm for Computing Intersection
  of Convex Sets",,,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose an approximate projected consensus algorithm for a
network to cooperatively compute the intersection of convex sets. Instead of
assuming the exact convex projection proposed in the literature, we allow each
node to compute an approximate projection and communicate it to its neighbors.
The communication graph is directed and time-varying. Nodes update their states
by weighted averaging. Projection accuracy conditions are presented for the
considered algorithm. They indicate how much projection accuracy is required to
ensure global consensus to a point in the intersection set when the
communication graph is uniformly jointly strongly connected. We show that
$\pi/4$ is a critical angle error of the projection approximation to ensure a
bounded state. A numerical example indicates that this approximate projected
consensus algorithm may achieve better performance than the exact projected
consensus algorithm in some cases.
","[{'version': 'v1', 'created': 'Sat, 26 May 2012 23:22:40 GMT'}]",2012-05-29,"[['Lou', 'Youcheng', ''], ['Shi', 'Guodong', ''], ['Johansson', 'Karl Henrik', ''], ['Hong', 'Yiguang', '']]","['Multi-agent systems', 'approximate projection', 'intersection computation', 'optimal consensus']"
14170,1610.06671,Dewei Li,Dewei Li and Yingjie Tian,Multi-view metric learning for multi-instance image classification,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is critical and meaningful to make image classification since it can help
human in image retrieval and recognition, object detection, etc. In this paper,
three-sides efforts are made to accomplish the task. First, visual features
with bag-of-words representation, not single vector, are extracted to
characterize the image. To improve the performance, the idea of multi-view
learning is implemented and three kinds of features are provided, each one
corresponds to a single view. The information from three views is complementary
to each other, which can be unified together. Then a new distance function is
designed for bags by computing the weighted sum of the distances between
instances. The technique of metric learning is explored to construct a
data-dependent distance metric to measure the relationships between instances,
meanwhile between bags and images, more accurately. Last, a novel approach,
called MVML, is proposed, which optimizes the joint probability that every
image is similar with its nearest image. MVML learns multiple distance metrics,
each one models a single view, to unifies the information from multiple views.
The method can be solved by alternate optimization iteratively. Gradient ascent
and positive semi-definite projection are utilized in the iterations. Distance
comparisons verified that the new bag distance function is prior to previous
functions. In model evaluation, numerical experiments show that MVML with
multiple views performs better than single view condition, which demonstrates
that our model can assemble the complementary information efficiently and
measure the distance between images more precisely. Experiments on influence of
parameters and instance number validate the consistency of the method.
","[{'version': 'v1', 'created': 'Fri, 21 Oct 2016 04:46:53 GMT'}]",2016-10-24,"[['Li', 'Dewei', ''], ['Tian', 'Yingjie', '']]","['metric learning', 'multi-view', 'multi-instance', 'image classification']"
14171,1105.0208,Alexander Sakhnovich,Lev Sakhnovich,"Algorithmic entropy, thermodynamics, and game interpretation",,,,,cs.IT math-ph math.IT math.LO math.MP math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Basic relations for the mean length and algorithmic entropy are obtained by
solving a new extremal problem. Using this extremal problem, they are obtained
in a most simple and general way. The length and entropy are considered as two
players of a new type of a game, in which we follow the scheme of our previous
work on thermodynamic characteristics in quantum and classical approaches.
","[{'version': 'v1', 'created': 'Sun, 1 May 2011 21:32:04 GMT'}]",2011-05-03,"[['Sakhnovich', 'Lev', '']]","['Length of program', 'Gibbs ensemble', 'game theory', 'statisticalphysics']"
14172,0803.0439,Christoph Lauter,"Florent De Dinechin (LIP), Christoph Quirin Lauter (LIP)",Optimizing polynomials for floating-point implementation,12 pages,,,,cs.NA cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The floating-point implementation of a function on an interval often reduces
to polynomial approximation, the polynomial being typically provided by Remez
algorithm. However, the floating-point evaluation of a Remez polynomial
sometimes leads to catastrophic cancellations. This happens when some of the
polynomial coefficients are very small in magnitude with respects to others. In
this case, it is better to force these coefficients to zero, which also reduces
the operation count. This technique, classically used for odd or even
functions, may be generalized to a much larger class of functions. An algorithm
is presented that forces to zero the smaller coefficients of the initial
polynomial thanks to a modified Remez algorithm targeting an incomplete
monomial basis. One advantage of this technique is that it is purely numerical,
the function being used as a numerical black box. This algorithm is implemented
within a larger polynomial implementation tool that is demonstrated on a range
of examples, resulting in polynomials with less coefficients than those
obtained the usual way.
","[{'version': 'v1', 'created': 'Tue, 4 Mar 2008 13:49:44 GMT'}]",2008-12-18,"[['De Dinechin', 'Florent', '', 'LIP'], ['Lauter', 'Christoph Quirin', '', 'LIP']]","['Polynomial evaluation', 'floating-point', 'elementary functions']"
14173,1506.02531,Cl\'ement Duhart Mr,Cl\'ement Duhart and Pierre Sauvage and Cyrille Bertelle,"EMMA: A Resource Oriented Framework for Service Choreography over
  Wireless Sensor and Actor Networks",23 pages,,,,cs.NI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current Internet of Things (IoT) development requires service distribution
over Wireless Sensor and Actor Networks (WSAN) to deal with the drastic
increasing of network management complexity. Because of the specific
constraints of WSAN, centralized approaches are strongly limited. Multi-hop
communication used by WSAN introduces transmission latency, packet errors,
router congestion and security issues. As it uses local services, a
decentralized service model avoid long path communications between nodes and
applications. But the main issue is then to have such local services installed
on the desired nodes. Environment Monitoring and Management Agent (EMMA) system
proposes a set of software to deploy and to execute such services over Wireless
Sensor and Actor Networks (WSAN) through a middleware based on Resource
Oriented Architecture (ROA). Its Internet integration and the local management
of data heterogeneity are facilitated through the use of current standard
protocols such as IPv6 LoW Power Wireless Area Networks (6LoWPAN) and
Constrained Application Protocol (CoAP). This contribution presents EMMA
middleware, methodology and tools used to determine efficient service mapping
and its deployment.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2015 14:54:24 GMT'}]",2015-06-09,"[['Duhart', 'Clément', ''], ['Sauvage', 'Pierre', ''], ['Bertelle', 'Cyrille', '']]","['Internet of Things (IoT)', 'Wireless Sensor Network (WSN)', 'Service Choreography (SC)', 'Middleware', 'Mobile Agent and Petri Network']"
14174,1010.0168,Mohammad Momani,"Mohammad Momani, Subhash Challa",Survey of trust models in different network domains,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces the security and trust concepts in wireless sensor
networks and explains the difference between them, stating that even though
both terms are used interchangeably when defining a secure system, they are not
the same. The difference between reputation and trust is also explained,
highlighting that reputation partially affects trust. A survey of trust and
reputation systems in various domains is conducted, with more details given to
models in ad-hoc and sensor networks as they are closely related to each other
and to our research interests. The methodologies used to model trust and their
references are presented. The factors affecting trust updating are summarised
and some examples of the systems in which these factors have been implemented
are given. The survey states that, even though researchers have started to
explore the issue of trust in wireless sensor networks, they are still
examining the trust associated with routing messages between nodes (binary
events). However, wireless sensor networks are mainly deployed to monitor
events and report data, both continuous and discrete. This leads to the
development of new trust models addressing the continuous data issue and also
to combine the data trust and the communication trust to infer the total trust.
","[{'version': 'v1', 'created': 'Fri, 1 Oct 2010 14:10:51 GMT'}]",2010-10-04,"[['Momani', 'Mohammad', ''], ['Challa', 'Subhash', '']]","['Trust', 'Reputation', 'Sensor', 'Network', 'Data', 'Communication', 'Mobile']"
14175,1402.1270,Abderrahim Mohammed El Amine,Abderrahim Mohammed El Amine,"Vers une interface pour l enrichissement des requetes en arabe dans un
  systeme de recherche d information","9 pages, in French","CIIA'2009 : 2eme Conference Internationale sur Informatique et ses
  Applications, Saida - Algerie, 03 -04 Mai 2009",,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This presentation focuses on the automatic expansion of Arabic request using
morphological analyzer and Arabic Wordnet. The expanded request is sent to
Google.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2014 08:29:19 GMT'}]",2014-02-07,"[['Amine', 'Abderrahim Mohammed El', '']]","['Arabic Information Retrieval', 'Arabic NLP', 'request expansion', 'Arabic Wordnet']"
14176,1701.06551,Maryam Ahmadi,Masood Tehrani and Mary Ahmadi,"On the Parametric Study of Lubricating Oil Production using an
  Artificial Neural Network (ANN) Approach","7 pages, 2 figures",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, an Artificial Neural Network (ANN) approach is utilized to
perform a parametric study on the process of extraction of lubricants from
heavy petroleum cuts. To train the model, we used field data collected from an
industrial plant. Operational conditions of feed and solvent flow rate,
Temperature of streams and mixing rate were considered as the input to the
model, whereas the flow rate of the main product was considered as the output
of the ANN model. A feed-forward Multi-Layer Perceptron Neural Network was
successfully applied to capture the relationship between inputs and output
parameters.
","[{'version': 'v1', 'created': 'Mon, 21 Nov 2016 18:13:42 GMT'}]",2017-01-24,"[['Tehrani', 'Masood', ''], ['Ahmadi', 'Mary', '']]","['Solvent extraction', 'Lubricating oil', 'Machine Learning', 'Artificial Neural Network']"
14177,1407.4364,Muhammad Marwan Muhammad Fuad,Muhammad Marwan Muhammad Fuad,"One-Step or Two-Step Optimization and the Overfitting Phenomenon: A Case
  Study on Time Series Classification",,"Proceedings of the 6th International Conference on Agents and
  Artificial Intelligence -6 - 8 March, 2014",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For the last few decades, optimization has been developing at a fast rate.
Bio-inspired optimization algorithms are metaheuristics inspired by nature.
These algorithms have been applied to solve different problems in engineering,
economics, and other domains. Bio-inspired algorithms have also been applied in
different branches of information technology such as networking and software
engineering. Time series data mining is a field of information technology that
has its share of these applications too. In previous works we showed how
bio-inspired algorithms such as the genetic algorithms and differential
evolution can be used to find the locations of the breakpoints used in the
symbolic aggregate approximation of time series representation, and in another
work we showed how we can utilize the particle swarm optimization, one of the
famous bio-inspired algorithms, to set weights to the different segments in the
symbolic aggregate approximation representation. In this paper we present, in
two different approaches, a new meta optimization process that produces optimal
locations of the breakpoints in addition to optimal weights of the segments.
The experiments of time series classification task that we conducted show an
interesting example of how the overfitting phenomenon, a frequently encountered
problem in data mining which happens when the model overfits the training set,
can interfere in the optimization process and hide the superior performance of
an optimization algorithm.
","[{'version': 'v1', 'created': 'Wed, 16 Jul 2014 16:12:16 GMT'}]",2014-07-17,"[['Fuad', 'Muhammad Marwan Muhammad', '']]","['Bio-inspired Optimization', 'Differential Evolution', 'Overfitting', 'Time Series Classification']"
14178,1108.3430,Bogdan Aman,"Florentin Ipate, Radu Nicolescu, Ionut-Mihai Niculescu, Cristian
  Stefan",Synchronization of P Systems with Simplex Channels,Presented at MeCBIC 2011,,,MeCBIC/2011/07,cs.DC cs.ET cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We solve the Firing Squad Synchronization Problem (FSSP), for P systems based
on digraphs with simplex channels, where communication is restricted by the
direction of structural arcs. Previous work on FSSP for P systems focused
exclusively on P systems with duplex channels, where communication between
parents and children is bidirectional. Our P solution, the first for simplex
channels, requires cell IDs, strongly connected digraphs and some awareness of
the local topology (such as each cell's outdegree)---we argue that these
requirements are necessary. Compared to the known solutions for cellular
automata, our solution is substantially simpler and faster.
","[{'version': 'v1', 'created': 'Wed, 17 Aug 2011 09:12:43 GMT'}]",2011-08-18,"[['Ipate', 'Florentin', ''], ['Nicolescu', 'Radu', ''], ['Niculescu', 'Ionut-Mihai', ''], ['Stefan', 'Cristian', '']]","['P systems', 'digraphs', 'strongly connected', 'simplex channels', 'firing squad synchronization', 'cellular automata']"
14179,1505.03048,Jean-Francois Lalande,"Ghada Arfaoui (LIFO), Jean-Fran\c{c}ois Lalande (INRIA - SUPELEC,
  LIFO), Jacques Traor\'e, Nicolas Desmoulins, Pascal Berthom\'e (LIFO), Sa\""id
  Gharout","A Practical Set-Membership Proof for Privacy-Preserving NFC Mobile
  Ticketing",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To ensure the privacy of users in transport systems, researchers are working
on new protocols providing the best security guarantees while respecting
functional requirements of transport operators. In this paper, we design a
secure NFC m-ticketing protocol for public transport that preserves users'
anonymity and prevents transport operators from tracing their customers' trips.
To this end, we introduce a new practical set-membership proof that does not
require provers nor verifiers (but in a specific scenario for verifiers) to
perform pairing computations. It is therefore particularly suitable for our
(ticketing) setting where provers hold SIM/UICC cards that do not support such
costly computations. We also propose several optimizations of Boneh-Boyen type
signature schemes, which are of independent interest, increasing their
performance and efficiency during NFC transactions. Our m-ticketing protocol
offers greater flexibility compared to previous solutions as it enables the
post-payment and the off-line validation of m-tickets. By implementing a
prototype using a standard NFC SIM card, we show that it fulfils the stringent
functional requirement imposed by transport operators whilst using strong
security parameters. In particular, a validation can be completed in 184.25 ms
when the mobile is switched on, and in 266.52 ms when the mobile is switched
off or its battery is flat.
","[{'version': 'v1', 'created': 'Tue, 12 May 2015 15:07:24 GMT'}]",2015-05-13,"[['Arfaoui', 'Ghada', '', 'LIFO'], ['Lalande', 'Jean-François', '', 'INRIA - SUPELEC,\n  LIFO'], ['Traoré', 'Jacques', '', 'LIFO'], ['Desmoulins', 'Nicolas', '', 'LIFO'], ['Berthomé', 'Pascal', '', 'LIFO'], ['Gharout', 'Saïd', '']]","['Set membership proof', 'zero-knowledge proof', 'm-ticketing', 'privacy', 'anonymity', 'unlinkability', 'postpayment']"
14180,1702.03008,K. Alex Mills,K. Alex Mills and James Smith,Finer-grained Locking in Concurrent Dynamic Planar Convex Hulls,4 pages; 2 figures; brief announcement submitted to SPAA 2017,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The convex hull of a planar point set is the smallest convex polygon
containing each point in the set. The dynamic convex hull problem concerns
efficiently maintaining the convex hull of a set of points subject to additions
and removals. One algorithm for this problem uses two external balanced binary
search trees (BSTs) (M. H. Overmars, J. van Leeuwen 1981). We present the first
concurrent solution for this problem, which uses a single BST that stores
references to intermediate convex hull solutions at each node. We implement and
evaluate two lock-based approaches: a) fine-grained locking, where each node of
the tree is protected by a lock, and b) ""finer-grained locking"", where each
node contains a separate lock for each of the left and right chains. In our
throughput experiments, we observe that finer-grained locking yields an 8-60%
improvement over fine-grained locking, and a 38-61x improvement over
coarsegrained locking and software transactional memory (STM). When applied to
find the convex hull of static point sets, our approach outperforms a parallel
divide-and-conquer implementation by 2-4x using an equivalent number of
threads.
","[{'version': 'v1', 'created': 'Thu, 9 Feb 2017 22:51:07 GMT'}]",2017-02-13,"[['Mills', 'K. Alex', ''], ['Smith', 'James', '']]","['Dynamic planar convex hull', 'concurrent data structures', 'parallel convex hull']"
14181,1511.03174,Wei Li,"Wei Li, Mingquan Qiu, Zhencai Zhu, Fan Jiang, Gongbo Zhou","Fault Diagnosis of Rolling Element Bearings with a Spectrum Searching
  Method",,,,,cs.SD cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rolling element bearing faults in rotating systems are observed as impulses
in the vibration signals, which are usually buried in noises. In order to
effectively detect the fault of bearings, a novel spectrum searching method is
proposed. The structural information of spectrum (SIOS) on a predefined basis
is constructed through a searching algorithm, such that the harmonics of
impulses generated by faults can be clearly identified and analyzed. Local
peaks of the spectrum are located on a certain bin of the basis, and then the
SIOS can interpret the spectrum via the number and energy of harmonics related
to frequency bins of the basis. Finally bearings can be diagnosed based on the
SIOS by identifying its dominant components. Mathematical formulation is
developed to guarantee the correct construction of the SISO through searching.
The effectiveness of the proposed method is verified with a simulation signal
and a benchmark study of bearings.
","[{'version': 'v1', 'created': 'Tue, 10 Nov 2015 16:39:01 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Oct 2016 10:20:39 GMT'}, {'version': 'v3', 'created': 'Mon, 12 Dec 2016 13:19:16 GMT'}]",2016-12-13,"[['Li', 'Wei', ''], ['Qiu', 'Mingquan', ''], ['Zhu', 'Zhencai', ''], ['Jiang', 'Fan', ''], ['Zhou', 'Gongbo', '']]","['rotating machinery', 'bearings', 'fault diagnosis', 'spectrum']"
14182,1610.01297,Christos Verginis PhD student,"Christos K. Verginis, Matteo Mastellaro and Dimos V. Dimarogonas","Robust Quaternion-based Cooperative Manipulation without Force/Torque
  Information","To appear in the World Congress of the International Federation of
  Automatic Control (IFAC), Toulouse, France, July 2017",,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a task-space control protocol for the collaborative
manipulation of a single object by N robotic agents. The proposed methodology
is decentralized in the sense that each agent utilizes information associated
with its own and the object's dynamic/kinematic parameters and no on-line
communication takes place. Moreover, no feedback of the contact forces/torques
is required, therefore employment of corresponding sensors is avoided. An
adaptive version of the control scheme is also introduced, where the agents'
and object's dynamic parameters are considered unknown. We also use unit
quaternions to represent the object's orientation. In addition, load sharing
coefficients between the agents are employed and internal force regulation is
guaranteed. Finally, experimental studies with two robotic arms verify the
validity and effectiveness of the proposed control protocol.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2016 07:35:49 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Nov 2016 11:26:58 GMT'}, {'version': 'v3', 'created': 'Fri, 31 Mar 2017 15:50:14 GMT'}, {'version': 'v4', 'created': 'Fri, 7 Apr 2017 09:38:38 GMT'}]",2017-04-10,"[['Verginis', 'Christos K.', ''], ['Mastellaro', 'Matteo', ''], ['Dimarogonas', 'Dimos V.', '']]","['Robotic manipulators', 'Multi-agent systems', 'Cooperative control', 'Adaptive control', 'Robust control']"
14183,1704.09007,Maciej  Skorski,Maciej Skorski,"Entropy of Independent Experiments, Revisited",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The weak law of large numbers implies that, under mild assumptions on the
source, the Renyi entropy per produced symbol converges (in probability)
towards the Shannon entropy rate. This paper quantifies the speed of this
convergence for sources with independent (but not iid) outputs, generalizing
and improving the result of Holenstein and Renner (IEEE Trans. Inform. Theory,
2011). (a) we characterize sources with \emph{slowest convergence} (for given
entropy): their outputs are mixtures of a uniform distribution and a unit mass.
(b) based on the above characterization, we establish faster convergences in
\emph{high-entropy} regimes.
  We discuss how these improved bounds may be used to better quantify security
of outputs of random number generators. In turn, the characterization of
""worst"" distributions can be used to derive sharp ""extremal"" inequalities
between Renyi and Shannon entropy. The main technique is \emph{non-convex
programming}, used to characterize distributions of possibly large exponential
moments under certain entropy.
","[{'version': 'v1', 'created': 'Fri, 28 Apr 2017 17:04:44 GMT'}]",2017-05-01,"[['Skorski', 'Maciej', '']]","['Asymptotic Equipartition Property', 'Smooth Entropy', 'ExponentialMoments Method']"
14184,1708.01089,Pedram Ghamisi Dr.,Shaghayegh Kargozar Nahavandya and Lalit Kumar and Pedram Ghamisi,"Using the SLEUTH urban growth model to simulate the impacts of future
  policy scenarios on urban land use in the Tehran metropolitan area in Iran","27 pages, 6 figures, and 6 tables",,,,cs.CV cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The SLEUTH model, based on the Cellular Automata (CA), can be applied to city
development simulation in metropolitan areas. In this study the SLEUTH model
was used to model the urban expansion and predict the future possible behavior
of the urban growth in Tehran. The fundamental data were five Landsat TM and
ETM images of 1988, 1992, 1998, 2001 and 2010. Three scenarios were designed to
simulate the spatial pattern. The first scenario assumed historical
urbanization mode would persist and the only limitations for development were
height and slope. The second one was a compact scenario which makes the growth
mostly internal and limited the expansion of suburban areas. The last scenario
proposed a polycentric urban structure which let the little patches grow
without any limitation and would not consider the areas beyond the specific
buffer zone from the larger patches for development. Results showed that the
urban growth rate was greater in the first scenario in comparison with the
other two scenarios. Also it was shown that the third scenario was more
suitable for Tehran since it could avoid undesirable effects such as congestion
and pollution and was more in accordance with the conditions of Tehran city.
","[{'version': 'v1', 'created': 'Thu, 3 Aug 2017 10:38:51 GMT'}]",2017-08-04,"[['Nahavandya', 'Shaghayegh Kargozar', ''], ['Kumar', 'Lalit', ''], ['Ghamisi', 'Pedram', '']]","['Urban growth', 'Cellular Automata (CA)', 'SLEUTH']"
14185,1510.01866,Christine Markarian,"Faisal N. Abu-Khzam, Christine Markarian, Friedhelm Meyer auf der
  Heide, Michael Schubert","Approximation and Heuristic Algorithms for Computing Backbones in
  Asymmetric Ad-Hoc Networks","17 pages, 6 figures",,,,cs.NI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of dominating set-based virtual backbone used for
routing in asymmetric wireless ad-hoc networks. These networks have non-uniform
transmission ranges and are modeled using the well-established disk graphs. The
corresponding graph theoretic problem seeks a strongly connected
dominating-absorbent set of minimum cardinality in a digraph. A subset of nodes
in a digraph is a strongly connected dominating-absorbent set if the subgraph
induced by these nodes is strongly connected and each node in the graph is
either in the set or has both an in-neighbor and an out-neighbor in it.
Distributed algorithms for this problem are of practical significance due to
the dynamic nature of ad-hoc networks. We present a first distributed
approximation algorithm, with a constant approximation factor and O(Diam)
running time, where Diam is the diameter of the graph. Moreover we present a
simple heuristic algorithm and conduct an extensive simulation study showing
that our heuristic outperforms previously known approaches for the problem.
","[{'version': 'v1', 'created': 'Wed, 7 Oct 2015 09:12:10 GMT'}]",2015-10-08,"[['Abu-Khzam', 'Faisal N.', ''], ['Markarian', 'Christine', ''], ['der Heide', 'Friedhelm Meyer auf', ''], ['Schubert', 'Michael', '']]","['ad-hoc networks', 'virtual backbone', 'dominating sets', 'disk graphs', 'distributed algorithms']"
14186,1802.08812,Simon Mak,"Yu-Hung Chang, Liwei Zhang, Xingjian Wang, Shiang-Ting Yeh, Simon Mak,
  Chih-Li Sung, C. F. Jeff Wu, Vigor Yang","Kernel-smoothed proper orthogonal decomposition (KSPOD)-based emulation
  for prediction of spatiotemporally evolving flow dynamics",,,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This interdisciplinary study, which combines machine learning, statistical
methodologies, high-fidelity simulations, and flow physics, demonstrates a new
process for building an efficient surrogate model for predicting
spatiotemporally evolving flow dynamics. In our previous work, a common-grid
proper-orthogonal-decomposition (CPOD) technique was developed to establish a
physics-based surrogate (emulation) model for prediction of mean flowfields and
design exploration over a wide parameter space. The CPOD technique is
substantially improved upon here using a kernel-smoothed POD (KSPOD) technique,
which leverages kriging-based weighted functions from the design matrix. The
resultant emulation model is then trained using a dataset obtained through
high-fidelity simulations. As an example, the flow evolution in a swirl
injector is considered for a wide range of design parameters and operating
conditions. The KSPOD-based emulation model performs well, and can faithfully
capture the spatiotemporal flow dynamics. The model enables effective design
surveys utilizing high-fidelity simulation data, achieving a turnaround time
for evaluating new design points that is 42,000 times faster than the original
simulation.
","[{'version': 'v1', 'created': 'Sat, 24 Feb 2018 07:22:27 GMT'}]",2018-02-27,"[['Chang', 'Yu-Hung', ''], ['Zhang', 'Liwei', ''], ['Wang', 'Xingjian', ''], ['Yeh', 'Shiang-Ting', ''], ['Mak', 'Simon', ''], ['Sung', 'Chih-Li', ''], ['Wu', 'C. F. Jeff', ''], ['Yang', 'Vigor', '']]","['design study', 'high-fidelity simulation', 'kriging', 'machine learning', 'reduced basis', 'swirl injector']"
14187,1704.02426,Edward L Platt,Edward L. Platt and Daniel M. Romero,"Towards Attack-Tolerant Networks: Concurrent Multipath Routing and the
  Butterfly Network",,,,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Targeted attacks against network infrastructure are notoriously difficult to
guard against. In the case of communication networks, such attacks can leave
users vulnerable to censorship and surveillance, even when cryptography is
used. Much of the existing work on network fault-tolerance focuses on random
faults and does not apply to adversarial faults (attacks). Centralized networks
have single points of failure by definition, leading to a growing popularity in
decentralized architectures and protocols for greater fault-tolerance. However,
centralized network structure can arise even when protocols are decentralized.
Despite their decentralized protocols, the Internet and World-Wide Web have
been shown both theoretically and historically to be highly susceptible to
attack, in part due to emergent structural centralization. When single points
of failure exist, they are potentially vulnerable to non-technological (i.e.,
coercive) attacks, suggesting the importance of a structural approach to
attack-tolerance. We show how the assumption of partial trust transitivity,
while more realistic than the assumption underlying webs of trust, can be used
to quantify the effective redundancy of a network as a function of trust
transitivity. We also prove that the effective redundancy of the wrap-around
butterfly topology increases exponentially with trust transitivity and describe
a novel concurrent multipath routing algorithm for constructing paths to
utilize that redundancy. When portions of network structure can be dictated our
results can be used to create scalable, attack-tolerant infrastructures. More
generally, our results provide a theoretical formalism for evaluating the
effects of network structure on adversarial fault-tolerance.
","[{'version': 'v1', 'created': 'Sat, 8 Apr 2017 02:34:16 GMT'}]",2017-04-11,"[['Platt', 'Edward L.', ''], ['Romero', 'Daniel M.', '']]","['Butterfly Topology', 'Fault Tolerance', 'Adversarial Faults', 'Multipath Routing', 'Censorship', 'Decentralization']"
14188,1008.3443,Jose Ignacio Alvarez-Hamelin,"Jos\'e Ignacio Alvarez-Hamelin (FIUBA, INTECIN), Beir\'o Mariano
  Gast\'on (FIUBA), Jorge Rodolfo Busch (FIUBA)",On weakly optimal partitions in modular networks,,,,,cs.SI cond-mat.stat-mech physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modularity was introduced as a measure of goodness for the community
structure induced by a partition of the set of vertices in a graph. Then, it
also became an objective function used to find good partitions, with high
success. Nevertheless, some works have shown a scaling limit and certain
instabilities when finding communities with this criterion. Modularity has been
studied proposing several formalisms, as hamiltonians in a Potts model or
laplacians in spectral partitioning. In this paper we present a new
probabilistic formalism to analyze modularity, and from it we derive an
algorithm based on weakly optimal partitions. This algorithm obtains good
quality partitions and also scales to large graphs.
","[{'version': 'v1', 'created': 'Fri, 20 Aug 2010 06:49:04 GMT'}]",2010-08-25,"[['Alvarez-Hamelin', 'José Ignacio', '', 'FIUBA, INTECIN'], ['Gastón', 'Beiró Mariano', '', 'FIUBA'], ['Busch', 'Jorge Rodolfo', '', 'FIUBA']]","['modularity', 'community structure', 'algorithms', 'complex systems']"
14189,1710.04681,Koushik Nagasubramanian,"Koushik Nagasubramanian, Sarah Jones, Soumik Sarkar, Asheesh K. Singh,
  Arti Singh, Baskar Ganapathysubramanian","Hyperspectral band selection using genetic algorithm and support vector
  machines for early identification of charcoal rot disease in soybean",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Charcoal rot is a fungal disease that thrives in warm dry conditions and
affects the yield of soybeans and other important agronomic crops worldwide.
There is a need for robust, automatic and consistent early detection and
quantification of disease symptoms which are important in breeding programs for
the development of improved cultivars and in crop production for the
implementation of disease control measures for yield protection. Current
methods of plant disease phenotyping are predominantly visual and hence are
slow and prone to human error and variation. There has been increasing interest
in hyperspectral imaging applications for early detection of disease symptoms.
However, the high dimensionality of hyperspectral data makes it very important
to have an efficient analysis pipeline in place for the identification of
disease so that effective crop management decisions can be made. The focus of
this work is to determine the minimal number of most effective hyperspectral
bands that can distinguish between healthy and diseased specimens early in the
growing season. Healthy and diseased hyperspectral data cubes were captured at
3, 6, 9, 12, and 15 days after inoculation. We utilized inoculated and control
specimens from 4 different genotypes. Each hyperspectral image was captured at
240 different wavelengths in the range of 383 to 1032 nm. We used a combination
of genetic algorithm as an optimizer and support vector machines as a
classifier for identification of maximally effective band combinations. A
binary classification between healthy and infected samples using six selected
band combinations obtained a classification accuracy of 97% and a F1 score of
0.97 for the infected class. The results demonstrated that these carefully
chosen bands are more informative than RGB images, and could be used in a
multispectral camera for remote identification of charcoal rot infection in
soybean.
","[{'version': 'v1', 'created': 'Thu, 12 Oct 2017 18:27:41 GMT'}]",2017-10-16,"[['Nagasubramanian', 'Koushik', ''], ['Jones', 'Sarah', ''], ['Sarkar', 'Soumik', ''], ['Singh', 'Asheesh K.', ''], ['Singh', 'Arti', ''], ['Ganapathysubramanian', 'Baskar', '']]","['Charcoal rot', 'Band selection', 'Genetic Algorithm', 'Support Vector Machines', 'Hyperspectral']"
14190,1507.00073,Armando Casta\~neda,"Armando Castaneda, Michel Raynal and Sergio Rajsbaum",Specifying Concurrent Problems: Beyond Linearizability,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tasks and objects are two predominant ways of specifying distributed
problems. A task is specified by an input/output relation, defining for each
set of processes that may run concurrently, and each assignment of inputs to
the processes in the set, the valid outputs of the processes. An object is
specified by an automaton describing the outputs the object may produce when it
is accessed sequentially. Thus, tasks explicitly state what may happen only
when sets of processes run concurrently, while objects only specify what
happens when processes access the object sequentially. Each one requires its
own implementation notion, to tell when an execution satisfies the
specification. For objects linearizability is commonly used, a very elegant and
useful consistency condition. For tasks implementation notions are less
explored.
  The paper introduces the notion of interval-sequential object. The
corresponding implementation notion of interval-linearizability generalizes
linearizability, and allows to associate states along the interval of execution
of an operation. Interval-linearizability allows to specify any task, however,
there are sequential one-shot objects that cannot be expressed as tasks, under
the simplest interpretation of a task. It also shows that a natural extension
of the notion of a task is expressive enough to specify any interval-sequential
object.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2015 00:12:35 GMT'}]",2015-07-02,"[['Castaneda', 'Armando', ''], ['Raynal', 'Michel', ''], ['Rajsbaum', 'Sergio', '']]","['asynchronous system', 'concurrent object', 'distributed task', 'linearizability', 'object composability', 'sequential specification']"
14191,1507.01168,Ashish Sureka,Ashish Sureka,"Kernel Based Sequential Data Anomaly Detection in Business Process Event
  Logs",,,,,cs.SE cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Business Process Management Systems (BPMS) log events and traces of
activities during the execution of a process. Anomalies are defined as
deviation or departure from the normal or common order. Anomaly detection in
business process logs has several applications such as fraud detection and
understanding the causes of process errors. In this paper, we present a novel
approach for anomaly detection in business process logs. We model the event
logs as a sequential data and apply kernel based anomaly detection techniques
to identify outliers and discordant observations. Our technique is unsupervised
(does not require a pre-annotated training dataset), employs kNN (k-nearest
neighbor) kernel based technique and normalized longest common subsequence
(LCS) similarity measure. We conduct experiments on a recent, large and
real-world incident management data of an enterprise and demonstrate that our
approach is effective.
","[{'version': 'v1', 'created': 'Sun, 5 Jul 2015 05:33:22 GMT'}]",2015-07-07,"[['Sureka', 'Ashish', '']]","['Anomaly Detection', 'Business Process Intelligence (BPI)', 'Incident Management Event Logs', 'Kernel Based Techniques', 'Process Mining', 'Unsupervised Learning']"
14192,1111.5767,Charles Morisset,"Jason Crampton, Charles Morisset",PTaCL: A Language for Attribute-Based Access Control in Open Systems,"26 pages, submitted to Principles of Security and Trust (POST)",,,,cs.CR cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many languages and algebras have been proposed in recent years for the
specification of authorization policies. For some proposals, such as XACML, the
main motivation is to address real-world requirements, typically by providing a
complex policy language with somewhat informal evaluation methods; others try
to provide a greater degree of formality (particularly with respect to policy
evaluation) but support far fewer features. In short, there are very few
proposals that combine a rich set of language features with a well-defined
semantics, and even fewer that do this for authorization policies for
attribute-based access control in open environments. In this paper, we
decompose the problem of policy specification into two distinct sub-languages:
the policy target language (PTL) for target specification, which determines
when a policy should be evaluated; and the policy composition language (PCL)
for building more complex policies from existing ones. We define syntax and
semantics for two such languages and demonstrate that they can be both simple
and expressive. PTaCL, the language obtained by combining the features of these
two sub-languages, supports the specification of a wide range of policies.
However, the power of PTaCL means that it is possible to define policies that
could produce unexpected results. We provide an analysis of how PTL should be
restricted and how policies written in PCL should be evaluated to minimize the
likelihood of undesirable results.
","[{'version': 'v1', 'created': 'Thu, 24 Nov 2011 14:01:47 GMT'}]",2011-11-28,"[['Crampton', 'Jason', ''], ['Morisset', 'Charles', '']]","['Target', 'Policy', 'Composition', 'PCL', 'PTL', 'PTaCL']"
14193,1501.04784,Francisco Javier Ramirez Gil,"Francisco Javier Ram\'irez-Gil, Marcos de Sales Guerra Tsuzuki and
  Wilfredo Montealegre-Rubio","Global finite element matrix construction based on a CPU-GPU
  implementation",,,,,cs.NA cs.CE cs.DC cs.PF math.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The finite element method (FEM) has several computational steps to
numerically solve a particular problem, to which many efforts have been
directed to accelerate the solution stage of the linear system of equations.
However, the finite element matrix construction, which is also time-consuming
for unstructured meshes, has been less investigated. The generation of the
global finite element matrix is performed in two steps, computing the local
matrices by numerical integration and assembling them into a global system,
which has traditionally been done in serial computing. This work presents a
fast technique to construct the global finite element matrix that arises by
solving the Poisson's equation in a three-dimensional domain. The proposed
methodology consists in computing the numerical integration, due to its
intrinsic parallel opportunities, in the graphics processing unit (GPU) and
computing the matrix assembly, due to its intrinsic serial operations, in the
central processing unit (CPU). In the numerical integration, only the lower
triangular part of each local stiffness matrix is computed thanks to its
symmetry, which saves GPU memory and computing time. As a result of symmetry,
the global sparse matrix also contains non-zero elements only in its lower
triangular part, which reduces the assembly operations and memory usage. This
methodology allows generating the global sparse matrix from any unstructured
finite element mesh size on GPUs with little memory capacity, only limited by
the CPU memory.
","[{'version': 'v1', 'created': 'Tue, 20 Jan 2015 12:41:28 GMT'}]",2015-01-21,"[['Ramírez-Gil', 'Francisco Javier', ''], ['Tsuzuki', 'Marcos de Sales Guerra', ''], ['Montealegre-Rubio', 'Wilfredo', '']]","['Finite element method (FEM)', 'unstructured mesh', 'matrix']"
14194,0907.1597,Thomas Hinton,James A. R. Marshall and Thomas G. Hinton,Beyond No Free Lunch: Realistic Algorithms for Arbitrary Problem Classes,(V3 fixed some other typos and improved some results),,,,cs.IT cs.NE math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show how the necessary and sufficient conditions for the NFL to apply can
be reduced to the single requirement of the set of objective functions under
consideration being closed under permutation, and quantify the extent to which
a set of objectives not closed under permutation can give rise to a performance
difference between two algorithms. Then we provide a more refined definition of
performance under which we show that revisiting algorithms are always trumped
by enumerative ones.
","[{'version': 'v1', 'created': 'Thu, 9 Jul 2009 16:10:43 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Jul 2009 09:21:22 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Mar 2010 15:44:37 GMT'}]",2010-03-17,"[['Marshall', 'James A. R.', ''], ['Hinton', 'Thomas G.', '']]","['combinatorial problems', 'search', 'neutrality', 'permutation closure', 'randomised algorithms', 'No Free Lunch']"
14195,1504.02866,Bhaskar Bhuyan,Bhaskar Bhuyan and Nityananda Sarma,A Delay Aware Routing Protocol for Wireless Sensor Networks,"6 Pages, 8 Figures, journal","IJCSI International Journal of Computer Science Issues, Volume 11,
  Issue 6, No 2, November 2014",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless Sensor Networks (WSNs) consist of sensor nodes which can be deployed
for various operations such as agriculture and environmental sensing, wild life
monitoring, health care, military surveillance, industrial control, home
automation, security etc. Quality of Service (QoS) is an important issue in
wireless sensor networks (WSNs) and providing QoS support in WSNs is an
emerging area of research. Due to resource constraints nature of sensor
networks like processing power, memory, bandwidth, energy etc. providing QoS
support in WSNs is a challenging task. Delay is an important QoS parameter for
forwarding data in a time constraint WSNs environment. In this paper we propose
a delay aware routing protocol for transmission of time critical event
information to the Sink of WSNs. The performance of the proposed protocol is
evaluated by NS2 simulations under different scenarios.
","[{'version': 'v1', 'created': 'Sat, 11 Apr 2015 12:37:09 GMT'}]",2015-04-14,"[['Bhuyan', 'Bhaskar', ''], ['Sarma', 'Nityananda', '']]","['Wireless Sensor Network', 'Quality of Service', 'Delay', 'time critical']"
14196,1712.05010,Panos Giannopoulos,"\'Edouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawe{\l}
  Rz\k{a}\.zewski, Florian Sikora",QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs,"20 pages, 12 figures, to appear at SoCG 2018. This is the full
  version",,,,cs.CG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A (unit) disk graph is the intersection graph of closed (unit) disks in the
plane. Almost three decades ago, an elegant polynomial-time algorithm was found
for \textsc{Maximum Clique} on unit disk graphs [Clark, Colbourn, Johnson;
Discrete Mathematics '90]. Since then, it has been an intriguing open question
whether or not tractability can be extended to general disk graphs. We show the
rather surprising structural result that a disjoint union of cycles is the
complement of a disk graph if and only if at most one of those cycles is of odd
length. From that, we derive the first QPTAS and subexponential algorithm
running in time $2^{\tilde{O}(n^{2/3})}$ for \textsc{Maximum Clique} on disk
graphs. In stark contrast, \textsc{Maximum Clique} on intersection graphs of
filled ellipses or filled triangles is unlikely to have such algorithms, even
when the ellipses are close to unit disks. Indeed, we show that there is a
constant approximation which is not attainable even in time
$2^{n^{1-\varepsilon}}$, unless the Exponential Time Hypothesis fails.
","[{'version': 'v1', 'created': 'Wed, 13 Dec 2017 21:10:13 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Feb 2018 16:25:35 GMT'}]",2018-03-01,"[['Bonnet', 'Édouard', ''], ['Giannopoulos', 'Panos', ''], ['Kim', 'Eun Jung', ''], ['Rzążewski', 'Paweł', ''], ['Sikora', 'Florian', '']]","['disk graph', 'maximum clique', 'computational complexity']"
14197,1403.6661,Fran\c{c}ois Simon,Francois Simon,One-sided asymptotically mean stationary channels,,"Advances in applied mathematics, volume 50, issue 5, May 2013,
  pages 675-701",,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes an analysis of asymptotically mean stationary (AMS)
communication channels. A hierarchy based on stability properties
(stationarity, quasi-stationarity, recurrence and asymptotically mean
stationarity) of channels is identified. Stationary channels are a subclass of
quasi-stationary channels which are a subclass of recurrent AMS channels which
are a subclass of AMS channels. These classes are proved to be stable under
Markovian composition of channels (e.g., the cascade of AMS channels is an AMS
channel). Characterizations of channels of each class are given. Some
properties of the quasi-stationary mean of a channel are established. Finally,
ergodicity conditions of AMS channels are gathered.
","[{'version': 'v1', 'created': 'Wed, 26 Mar 2014 13:11:23 GMT'}]",2014-03-27,"[['Simon', 'Francois', '']]","['Communication channels', 'one-sided channels', 'asymptotic mean stationarychannels', 'ergodic AMS channels', 'quasi-stationary mean of a channel']"
14198,1510.00889,Kardi Teknomo,Kardi Teknomo and Proceso Fernandez,Background Image Generation Using Boolean Operations,,"Philippine Computing Journal Vol 4 No 2, December 2009, pp. 43-49",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tracking moving objects from a video sequence requires segmentation of these
objects from the background image. However, getting the actual background image
automatically without object detection and using only the video is difficult.
In this paper, we describe a novel algorithm that generates background from
real world images without foreground detection. The algorithm assumes that the
background image is shown in the majority of the video. Given this simple
assumption, the method described in this paper is able to accurately generate,
with high probability, the background image from a video using only a small
number of binary operations.
","[{'version': 'v1', 'created': 'Sun, 4 Oct 2015 00:34:56 GMT'}]",2015-10-06,"[['Teknomo', 'Kardi', ''], ['Fernandez', 'Proceso', '']]","['Boolean mode', 'background modeling', 'bit operation']"
14199,1610.09629,Beno\^it Valiron,"Ugo Dal Lago, Claudia Faggian, Benoit Valiron, Akira Yoshimizu","The Geometry of Parallelism. Classical, Probabilistic, and Quantum
  Effects","21 pages, extended version of the conference paper ; July 2017:
  removed a spurious and unused lemma",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a Geometry of Interaction model for higher-order quantum
computation, and prove its adequacy for a full quantum programming language in
which entanglement, duplication, and recursion are all available. Our model
comes with a multi-token machine, a proof net system, and a PCF-style language.
The approach we develop is not specific to quantum computation, and our model
is an instance of a new framework whose main feature is the ability to model
commutative effects in a parallel setting. Being based on a multi-token machine
equipped with a memory, it has a concrete nature which makes it well suited for
building low-level operational descriptions of higher-order languages.
","[{'version': 'v1', 'created': 'Sun, 30 Oct 2016 10:54:43 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Nov 2016 12:10:01 GMT'}, {'version': 'v3', 'created': 'Sat, 15 Jul 2017 14:32:53 GMT'}]",2017-07-18,"[['Lago', 'Ugo Dal', ''], ['Faggian', 'Claudia', ''], ['Valiron', 'Benoit', ''], ['Yoshimizu', 'Akira', '']]","['Geometry of Interaction', 'memory structure', 'quantum', 'probabilistic', 'PCF']"
14200,0906.0202,Abedelaziz Mohaisen,Abedelaziz Mohaisen and Dowon Hong,"Mitigating the ICA Attack against Rotation Based Transformation for
  Privacy Preserving Clustering","3 pages, 1 figure, appeared as a letter in ETRI journal","Abedelaziz Mohaisen, and Dowon Hong: Mitigating the ICA Attack
  against Rotation-Based Transformation for Privacy Preserving Clustering, ETRI
  Journal, vol.30, no.6, Dec. 2008, pp.868-870",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rotation based transformation (RBT) for privacy preserving data mining
(PPDM) is vulnerable to the independent component analysis (ICA) attack. This
paper introduces a modified multiple rotation based transformation (MRBT)
technique for special mining applications mitigating the ICA attack while
maintaining the advantages of the RBT.
","[{'version': 'v1', 'created': 'Mon, 1 Jun 2009 03:31:26 GMT'}]",2009-06-02,"[['Mohaisen', 'Abedelaziz', ''], ['Hong', 'Dowon', '']]","['⎯RBT', 'ICA', 'Multiple rotations', 'data clustering']"
14201,1406.7338,Li-Yi Wei,Li-Yi Wei and Marc Levoy,Order-Independent Texture Synthesis,"This is a combination of Stanford Computer Science Department
  Technical Report 2002-01 and a subsequent submission to SIGGRAPH 2003",,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Search-based texture synthesis algorithms are sensitive to the order in which
texture samples are generated; different synthesis orders yield different
textures. Unfortunately, most polygon rasterizers and ray tracers do not
guarantee the order with which surfaces are sampled. To circumvent this
problem, textures are synthesized beforehand at some maximum resolution and
rendered using texture mapping.
  We describe a search-based texture synthesis algorithm in which samples can
be generated in arbitrary order, yet the resulting texture remains identical.
The key to our algorithm is a pyramidal representation in which each texture
sample depends only on a fixed number of neighboring samples at each level of
the pyramid. The bottom (coarsest) level of the pyramid consists of a noise
image, which is small and predetermined. When a sample is requested by the
renderer, all samples on which it depends are generated at once. Using this
approach, samples can be generated in any order. To make the algorithm
efficient, we propose storing texture samples and their dependents in a
pyramidal cache. Although the first few samples are expensive to generate,
there is substantial reuse, so subsequent samples cost less. Fortunately, most
rendering algorithms exhibit good coherence, so cache reuse is high.
","[{'version': 'v1', 'created': 'Sat, 28 Jun 2014 00:47:30 GMT'}]",2014-07-01,"[['Wei', 'Li-Yi', ''], ['Levoy', 'Marc', '']]","['Texture Synthesis', 'Texture Mapping', 'Graphics Hardware']"
14202,1002.0270,Serge Samper,"Pierre-Antoine Adragna (SYMME), Maurice Pillet (SYMME), Fabien Formosa
  (SYMME), Serge Samper (SYMME)",Inertial tolerancing and capability indices in an assembly production,,"Revue Internationale d Ingenierie Numerique 2, 1-2 (2006) 71-88",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional tolerancing considers the conformity of a batch when the batch
satisfies the specifications. The characteristic is considered for itself and
not according to its incidence in the assembly. Inertial tolerancing proposes
another alternative of tolerancing in order to guarantee the final assembly
characteristic. The inertia I2 = \sqrt{\delta^2 + \sigma^2} is not toleranced
by a tolerance interval but by a scalar representing the maximum inertia that
the characteristic should not exceed. We detail how to calculate the inertial
tolerances according to two cases, one aims to guarantee an inertia of the
assembly characteristic the other a tolerance interval on the assembly
characteristic by a Cpk capability index, in the particular but common case of
uniform tolerances or more general with non uniform tolerances. An example will
be detailed to show the results of the different tolerancing methods.
","[{'version': 'v1', 'created': 'Mon, 1 Feb 2010 15:10:56 GMT'}]",2010-02-02,"[['Adragna', 'Pierre-Antoine', '', 'SYMME'], ['Pillet', 'Maurice', '', 'SYMME'], ['Formosa', 'Fabien', '', 'SYMME'], ['Samper', 'Serge', '', 'SYMME']]","['assembly', 'inertial', 'tolerancing', 'capability', 'index']"
14203,1403.7495,Nicolas Gastineau,"Nicolas Gastineau (GrAMA), Olivier Togni (Le2i)",S-Packing Colorings of Cubic Graphs,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a non-decreasing sequence $S=(s\_1,s\_2, \ldots, s\_k)$ of positive
integers, an {\em $S$-packing coloring} of a graph $G$ is a mapping $c$ from
$V(G)$ to $\{s\_1,s\_2, \ldots, s\_k\}$ such that any two vertices with color
$s\_i$ are at mutual distance greater than $s\_i$, $1\le i\le k$. This paper
studies $S$-packing colorings of (sub)cubic graphs. We prove that subcubic
graphs are $(1,2,2,2,2,2,2)$-packing colorable and $(1,1,2,2,3)$-packing
colorable. For subdivisions of subcubic graphs we derive sharper bounds, and we
provide an example of a cubic graph of order $38$ which is not
$(1,2,\ldots,12)$-packing colorable.
","[{'version': 'v1', 'created': 'Fri, 28 Mar 2014 19:13:02 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Apr 2016 13:29:38 GMT'}]",2016-05-02,"[['Gastineau', 'Nicolas', '', 'GrAMA'], ['Togni', 'Olivier', '', 'Le2i']]","['graph', 'coloring', 'packing chromatic number', 'cubic graph']"
14204,0807.2023,Hamed Haddadi MSc MIEE,"Hamed Haddadi, Damien Fay, Almerima Jamakovic, Olaf Maennel, Andrew W.
  Moore, Richard Mortier, Miguel Rio, Steve Uhlig",Beyond Node Degree: Evaluating AS Topology Models,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many models have been proposed to generate Internet Autonomous System (AS)
topologies, most of which make structural assumptions about the AS graph. In
this paper we compare AS topology generation models with several observed AS
topologies. In contrast to most previous works, we avoid making assumptions
about which topological properties are important to characterize the AS
topology. Our analysis shows that, although matching degree-based properties,
the existing AS topology generation models fail to capture the complexity of
the local interconnection structure between ASs. Furthermore, we use BGP data
from multiple vantage points to show that additional measurement locations
significantly affect local structure properties, such as clustering and node
centrality. Degree-based properties, however, are not notably affected by
additional measurements locations. These observations are particularly valid in
the core. The shortcomings of AS topology generation models stems from an
underestimation of the complexity of the connectivity in the core caused by
inappropriate use of BGP data.
","[{'version': 'v1', 'created': 'Sun, 13 Jul 2008 11:04:59 GMT'}]",2008-07-15,"[['Haddadi', 'Hamed', ''], ['Fay', 'Damien', ''], ['Jamakovic', 'Almerima', ''], ['Maennel', 'Olaf', ''], ['Moore', 'Andrew W.', ''], ['Mortier', 'Richard', ''], ['Rio', 'Miguel', ''], ['Uhlig', 'Steve', '']]","['Internet', 'BGP', 'Topology generation', 'Graph metrics']"
14205,1611.01141,Heide Gluesing-Luerssen,"Heide Gluesing-Luerssen, Tefjol Pllaha",Extension Theorems for Various Weight Functions over Frobenius Bimodules,,,,,cs.IT math.IT math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we study codes where the alphabet is a finite Frobenius
bimodule over a finite ring. We discuss the extension property for various
weight functions. Employing an entirely character-theoretic approach and a
duality theory for partitions on Frobenius bimodules we derive alternative
proofs for the facts that the Hamming weight and the homogeneous weight satisfy
the extension property. We also use the same techniques to derive the extension
property for other weights, such as the Rosenbloom-Tsfasman weight.
","[{'version': 'v1', 'created': 'Thu, 3 Nov 2016 19:46:15 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Nov 2016 21:27:59 GMT'}]",2016-11-14,"[['Gluesing-Luerssen', 'Heide', ''], ['Pllaha', 'Tefjol', '']]","['Frobenius bimodules', 'codes', 'weight functions', 'extension property']"
14206,1410.4168,Adrien Devresse,"Adrien Devresse, Fabrizio Furano","Efficient HTTP based I/O on very large datasets for high performance
  computing with the libdavix library","Presented at: Very large Data Bases (VLDB) 2014, Hangzhou",,,,cs.PF cs.DC,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Remote data access for data analysis in high performance computing is
commonly done with specialized data access protocols and storage systems. These
protocols are highly optimized for high throughput on very large datasets,
multi-streams, high availability, low latency and efficient parallel I/O. The
purpose of this paper is to describe how we have adapted a generic protocol,
the Hyper Text Transport Protocol (HTTP) to make it a competitive alternative
for high performance I/O and data analysis applications in a global computing
grid: the Worldwide LHC Computing Grid. In this work, we first analyze the
design differences between the HTTP protocol and the most common high
performance I/O protocols, pointing out the main performance weaknesses of
HTTP. Then, we describe in detail how we solved these issues. Our solutions
have been implemented in a toolkit called davix, available through several
recent Linux distributions. Finally, we describe the results of our benchmarks
where we compare the performance of davix against a HPC specific protocol for a
data analysis use case.
","[{'version': 'v1', 'created': 'Wed, 15 Oct 2014 18:57:12 GMT'}]",2014-10-16,"[['Devresse', 'Adrien', ''], ['Furano', 'Fabrizio', '']]","['High Performance Computing', 'Big Data', 'HTTP Protocol', 'Data Access', 'Performance Optimization', 'I/O']"
14207,1501.05851,Antonio Sassano,Paolo Nobili and Antonio Sassano,"An ${\cal O}(n\sqrt{m})$ algorithm for the weighted stable set problem
  in {claw, net}-free graphs with $\alpha(G) \ge 4$",,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we show that a connected {claw, net}-free graph $G(V, E)$ with
$\alpha(G) \ge 4$ is the union of a strongly bisimplicial clique $Q$ and at
most two clique-strips. A clique is strongly bisimplicial if its neighborhood
is partitioned into two cliques which are mutually non-adjacent and a
clique-strip is a sequence of cliques $\{H_0, \dots, H_p\}$ with the property
that $H_i$ is adjacent only to $H_{i-1}$ and $H_{i+1}$. By exploiting such a
structure we show how to solve the Maximum Weight Stable Set Problem in such a
graph in time ${\cal O}(|V|\sqrt{|E|})$.
","[{'version': 'v1', 'created': 'Fri, 23 Jan 2015 16:04:19 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Oct 2015 13:05:24 GMT'}]",2015-10-26,"[['Nobili', 'Paolo', ''], ['Sassano', 'Antonio', '']]","['claw-free graphs', 'net-free graphs', 'stable set', 'matching']"
14208,1510.03482,Luke Mathieson,Luke Mathieson,Graph Editing Problems with Extended Regularity Constraints,28 pages,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph editing problems offer an interesting perspective on sub- and
supergraph identification problems for a large variety of target properties.
They have also attracted significant attention in recent years, particularly in
the area of parameterized complexity as the problems have rich parameter
ecologies.
  In this paper we examine generalisations of the notion of editing a graph to
obtain a regular subgraph. In particular we extend the notion of regularity to
include two variants of edge-regularity along with the unifying constraint of
strong regularity. We present a number of results, with the central observation
that these problems retain the general complexity profile of their
regularity-based inspiration: when the number of edits $k$ and the maximum
degree $r$ are taken together as a combined parameter, the problems are
tractable (i.e. in \FPT{}), but are otherwise intractable.
  We also examine variants of the basic editing to obtain a regular subgraph
problem from the perspective of parameterizing by the treewidth of the input
graph. In this case the treewidth of the input graph essentially becomes a
limiting parameter on the natural $k+r$ parameterization.
","[{'version': 'v1', 'created': 'Mon, 12 Oct 2015 23:16:20 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Mar 2017 06:14:46 GMT'}]",2017-03-06,"[['Mathieson', 'Luke', '']]","['graph algorithms', 'computational complexity', 'algorithms', 'parameterized complexity', 'graph editing']"
14209,1407.5380,Dongmo Zhang,Dongmo Zhang and Michael Thielsher,Representing and Reasoning about Game Strategies,,,,,cs.AI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  As a contribution to the challenge of building game-playing AI systems, we
develop and analyse a formal language for representing and reasoning about
strategies. Our logical language builds on the existing general Game
Description Language (GDL) and extends it by a standard modality for linear
time along with two dual connectives to express preferences when combining
strategies. The semantics of the language is provided by a standard
state-transition model. As such, problems that require reasoning about games
can be solved by the standard methods for reasoning about actions and change.
We also endow the language with a specific semantics by which strategy formulas
are understood as move recommendations for a player. To illustrate how our
formalism supports automated reasoning about strategies, we demonstrate two
example methods of implementation\/: first, we formalise the semantic
interpretation of our language in conjunction with game rules and strategy
rules in the Situation Calculus; second, we show how the reasoning problem can
be solved with Answer Set Programming.
","[{'version': 'v1', 'created': 'Mon, 21 Jul 2014 06:15:27 GMT'}]",2014-07-22,"[['Zhang', 'Dongmo', ''], ['Thielsher', 'Michael', '']]","['strategic reasoning', 'reasoning about actions', 'general game playing']"
14210,1301.6789,D P Acharjya Ph.D,B.K.Tripathy and D.P.Acharjya,"Approximation of Classification and Measures of Uncertainty in Rough Set
  on Two Universal Sets","14 pages, International Journal of Advanced Science and Technology
  Vol. 40, March, 2012",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The notion of rough set captures indiscernibility of elements in a set. But,
in many real life situations, an information system establishes the relation
between different universes. This gave the extension of rough set on single
universal set to rough set on two universal sets. In this paper, we introduce
approximation of classifications and measures of uncertainty basing upon rough
set on two universal sets employing the knowledge due to binary relations.
","[{'version': 'v1', 'created': 'Fri, 25 Jan 2013 11:58:23 GMT'}]",2013-01-30,"[['Tripathy', 'B. K.', ''], ['Acharjya', 'D. P.', '']]","['Rough set', 'solitary set', 'Boolean matrix', 'accuracy of approximation', 'quality of']"
14211,1712.04417,Binanda Sengupta,Binanda Sengupta and Sushmita Ruj,Keyword-Based Delegable Proofs of Storage,"A preliminary version of this work has been published in
  International Conference on Information Security Practice and Experience
  (ISPEC 2018)",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud users (clients) with limited storage capacity at their end can
outsource bulk data to the cloud storage server. A client can later access her
data by downloading the required data files. However, a large fraction of the
data files the client outsources to the server is often archival in nature that
the client uses for backup purposes and accesses less frequently. An untrusted
server can thus delete some of these archival data files in order to save some
space (and allocate the same to other clients) without being detected by the
client (data owner). Proofs of storage enable the client to audit her data
files uploaded to the server in order to ensure the integrity of those files.
In this work, we introduce one type of (selective) proofs of storage that we
call keyword-based delegable proofs of storage, where the client wants to audit
all her data files containing a specific keyword (e.g., ""important""). Moreover,
it satisfies the notion of public verifiability where the client can delegate
the auditing task to a third-party auditor who audits the set of files
corresponding to the keyword on behalf of the client. We formally define the
security of a keyword-based delegable proof-of-storage protocol. We construct
such a protocol based on an existing proof-of-storage scheme and analyze the
security of our protocol. We argue that the techniques we use can be applied
atop any existing publicly verifiable proof-of-storage scheme for static data.
Finally, we discuss the efficiency of our construction.
","[{'version': 'v1', 'created': 'Tue, 12 Dec 2017 18:18:55 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Dec 2017 13:40:49 GMT'}, {'version': 'v3', 'created': 'Tue, 2 Jan 2018 16:34:44 GMT'}, {'version': 'v4', 'created': 'Wed, 21 Feb 2018 10:31:29 GMT'}, {'version': 'v5', 'created': 'Sun, 25 Feb 2018 10:47:56 GMT'}, {'version': 'v6', 'created': 'Sun, 3 Jun 2018 13:28:01 GMT'}, {'version': 'v7', 'created': 'Sun, 10 Jun 2018 16:58:13 GMT'}, {'version': 'v8', 'created': 'Tue, 25 Sep 2018 13:16:55 GMT'}]",2018-09-26,"[['Sengupta', 'Binanda', ''], ['Ruj', 'Sushmita', '']]","['Cryptographic protocols', 'proofs of storage', 'cloud computing', 'keyword-based audits', 'public verifiability']"
14212,1010.5377,Leto Peel,Leto Peel,"Estimating Network Parameters for Selecting Community Detection
  Algorithms","In proceedings of The 13th International Conference on Information
  Fusion",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the problem of algorithm selection for community
detection. The aim of community detection is to identify sets of nodes in a
network which are more interconnected relative to their connectivity to the
rest of the network. A large number of algorithms have been developed to tackle
this problem, but as with any machine learning task there is no
""one-size-fits-all"" and each algorithm excels in a specific part of the problem
space. This paper examines the performance of algorithms developed for weighted
networks against those using unweighted networks for different parts of the
problem space (parameterised by the intra/inter community links). It is then
demonstrated how the choice of algorithm (weighted/unweighted) can be made
based only on the observed network.
","[{'version': 'v1', 'created': 'Tue, 26 Oct 2010 12:32:10 GMT'}]",2010-10-27,"[['Peel', 'Leto', '']]","['Community detection', 'algorithm selection', 'interaction networks']"
14213,1407.6153,Robert Obryk,Robert Obryk,Write-and-f-array: implementation and an application,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a new shared memory object: the write-and-f-array, provide its
wait-free implementation and use it to construct an improved wait-free
implementation of the fetch-and-add object. The write-and-f-array generalizes
single-writer write-and-snapshot object in a similar way that the f-array
generalizes the multi-writer snapshot object. More specifically, a
write-and-f-array is parameterized by an associative operator $f$ and is
conceptually an array with two atomic operations:
  - write-and-f modifies a single array's element and returns the result of
applying $f$ to all the elements,
  - read returns the result of applying $f$ to all the array's elements.
  We provide a wait-free implementation of an $N$-element write-and-f-array
with $O(N \log N)$ memory complexity, $O(\log^3 N)$ step complexity of the
write-and-f operation and $O(1)$ step complexity of the read operation. The
implementation uses CAS objects and requires their size to be $\Omega(\log M)$,
where $M$ is the total number of write-and-f operations executed. We also show,
how it can be modified to achieve $O(\log^2 N)$ step complexity of write-and-f,
while increasing the memory complexity to $O(N \log^2 N)$.
  The write-and-f-array can be applied to create a fetch-and-add object for $P$
processes with $O(P \log P)$ memory complexity and $O(\log^3 P)$ step
complexity of the fetch-and-add operation. This is the first implementation of
fetch-and-add with polylogarithmic step complexity and subquadratic memory
complexity that can be implemented without CAS or LL/SC objects of unrealistic
size.
","[{'version': 'v1', 'created': 'Wed, 23 Jul 2014 09:47:57 GMT'}]",2014-07-24,"[['Obryk', 'Robert', '']]","['concurrency', 'wait-free', 'snapshot', 'fetch-and-add']"
14214,1604.07036,Robert Betts Mister,Robert J Betts,"A Radix Representation for each van der Waerden number $W(r, k)$ with
  $r$ colors: Why $\log_{r}W(r, k) < k^{2}$ is true whenever $k$ is the number
  of terms in the arithmetic progression","Seven pages, two tables, no figures. Two sentences added to Section
  1, paragraph two. Additional section added (Section 2) to derive a
  mathematical expression for the rational number $\frac{W(r, k + 1)}{W(r, k)}$",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Here we show that by expressing a van der Waerden number $W(r, k)$ by its
radix polynomial representation, it not only is possible to locate each proper
subset on $\mathbb{R}$ in which the van der Waerden number lies, but also to
show that conditions exist for which the logarithm of the van der Waerden
number necessarily is bounded above by the square of the number of terms $k$ in
the arithmetic progression. Furthermore we also use the method to find a
mathematical expression or formula for the ratio of two ""consecutive"" van der
Waerden numbers of the kind $W(r, k)$, $W(r, k + 1)$.
","[{'version': 'v1', 'created': 'Sun, 24 Apr 2016 14:36:07 GMT'}, {'version': 'v2', 'created': 'Sat, 30 Apr 2016 12:37:16 GMT'}, {'version': 'v3', 'created': 'Sat, 7 May 2016 21:41:38 GMT'}]",2016-05-10,"[['Betts', 'Robert J', '']]","['Arithmetic progression', 'integer colorings', 'monochromatic', 'van der Waerden number']"
14215,1602.07480,Lluis Gomez,"Lluis Gomez, Anguelos Nicolaou, Dimosthenis Karatzas","Improving patch-based scene text script identification with ensembles of
  conjoined networks",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper focuses on the problem of script identification in scene text
images. Facing this problem with state of the art CNN classifiers is not
straightforward, as they fail to address a key characteristic of scene text
instances: their extremely variable aspect ratio. Instead of resizing input
images to a fixed aspect ratio as in the typical use of holistic CNN
classifiers, we propose here a patch-based classification framework in order to
preserve discriminative parts of the image that are characteristic of its
class. We describe a novel method based on the use of ensembles of conjoined
networks to jointly learn discriminative stroke-parts representations and their
relative importance in a patch-based classification scheme. Our experiments
with this learning procedure demonstrate state-of-the-art results in two public
script identification datasets. In addition, we propose a new public benchmark
dataset for the evaluation of multi-lingual scene text end-to-end reading
systems. Experiments done in this dataset demonstrate the key role of script
identification in a complete end-to-end system that combines our script
identification method with a previously published text detector and an
off-the-shelf OCR engine.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2016 12:33:25 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Feb 2017 13:17:57 GMT'}]",2017-02-02,"[['Gomez', 'Lluis', ''], ['Nicolaou', 'Anguelos', ''], ['Karatzas', 'Dimosthenis', '']]","['script identification', 'scene text understanding', 'multi-language']"
14216,0908.4290,Khaled Khalil,"Khaled M. Khalil, M. Abdel-Aziz, Taymour T. Nazmy, Abdel-Badeeh M.
  Salem",Bridging the Gap between Crisis Response Operations and Systems,"6 pages, 1 figure, 2 tables, accepted at The 9th International
  Conference on Artificial Intelligence and Digital Communications",,,,cs.CY cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There exist huge problems in the current practice of crisis response
operations. Response problems are projected as a combination of failure in
communication, failure in technology, failure in methodology, failure of
management, and finally failure of observation. In this paper we compare eight
crisis response systems namely: DrillSim [2, 13], DEFACTO [12, 17], ALADDIN [1,
6], RoboCup Rescue [11, 15], FireGrid [3, 8, 18], WIPER [16], D-AESOP [4], and
PLAN C [14]. Comparison results will disclose the cause of failure of current
crisis response operations (the response gap). Based on comparison results; we
provide recommendations for bridging this gap between response operations and
systems.
","[{'version': 'v1', 'created': 'Fri, 28 Aug 2009 20:58:45 GMT'}]",2009-09-01,"[['Khalil', 'Khaled M.', ''], ['Abdel-Aziz', 'M.', ''], ['Nazmy', 'Taymour T.', ''], ['Salem', 'Abdel-Badeeh M.', '']]","['Crisis Management', 'Crisis Response', 'Crisis Response Systems', 'Multiagent Systems', 'Disaster Management', 'Gap Analysis']"
14217,1609.03605,Weilin Huang,"Zhi Tian, Weilin Huang, Tong He, Pan He, and Yu Qiao",Detecting Text in Natural Image with Connectionist Text Proposal Network,"To appear in ECCV, 2016",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel Connectionist Text Proposal Network (CTPN) that accurately
localizes text lines in natural image. The CTPN detects a text line in a
sequence of fine-scale text proposals directly in convolutional feature maps.
We develop a vertical anchor mechanism that jointly predicts location and
text/non-text score of each fixed-width proposal, considerably improving
localization accuracy. The sequential proposals are naturally connected by a
recurrent neural network, which is seamlessly incorporated into the
convolutional network, resulting in an end-to-end trainable model. This allows
the CTPN to explore rich context information of image, making it powerful to
detect extremely ambiguous text. The CTPN works reliably on multi-scale and
multi- language text without further post-processing, departing from previous
bottom-up methods requiring multi-step post-processing. It achieves 0.88 and
0.61 F-measure on the ICDAR 2013 and 2015 benchmarks, surpass- ing recent
results [8, 35] by a large margin. The CTPN is computationally efficient with
0:14s/image, by using the very deep VGG16 model [27]. Online demo is available
at: http://textdet.com/.
","[{'version': 'v1', 'created': 'Mon, 12 Sep 2016 21:12:46 GMT'}]",2016-10-02,"[['Tian', 'Zhi', ''], ['Huang', 'Weilin', ''], ['He', 'Tong', ''], ['He', 'Pan', ''], ['Qiao', 'Yu', '']]","['Scene text detection', 'convolutional network', 'recurrent neural network', 'anchor mechanism']"
14218,1707.08771,Kaidong Wu,"Kaidong Wu, Xiao He, Xing Chen and Gang Huang",Runtime Model Based Approach to Smart Home System Development,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When developing smart home systems, developers integrate and compose smart
devices and software applications. Because of their diversity and
heterogeneity, developers usually encounter many problems. In this paper, we
present a runtime model based approach to smart home system development. First,
we analyze mobile applications associated with smart devices and then extract
some device control APIs. Second, we use SM@RT framework to build the device
runtime model. Third, we define the scenario model, that is an abstraction of
devices and objects which the system consists of. Fourth, we specify mapping
rules from the scenario model to the runtime model and employ a synchronizer,
which can interpret the mapping rules, to keep the synchronization between the
scenario model and the device runtime model. The mapping handler reads the
mapping rules that are defined by developers and does the mapping in terms of
them. At last, developers can program smart home systems upon the MOF-compliant
scenario model using the state-of-the-art model driven technologies.
https://youtu.be/SP12OtmHj50
","[{'version': 'v1', 'created': 'Thu, 27 Jul 2017 08:14:40 GMT'}]",2017-07-28,"[['Wu', 'Kaidong', ''], ['He', 'Xiao', ''], ['Chen', 'Xing', ''], ['Huang', 'Gang', '']]","['Runtime Model', 'Smart Home System', 'Model-driven Engineering']"
14219,1108.5405,Jose Antonio Martin H.,H. Jose Antonio Martin,"Solving Hard Computational Problems Efficiently: Asymptotic Parametric
  Complexity 3-Coloring Algorithm",Working paper,,,,cs.DS cs.CC cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many practical problems in almost all scientific and technological
disciplines have been classified as computationally hard (NP-hard or even
NP-complete). In life sciences, combinatorial optimization problems frequently
arise in molecular biology, e.g., genome sequencing; global alignment of
multiple genomes; identifying siblings or discovery of dysregulated pathways.In
almost all of these problems, there is the need for proving a hypothesis about
certain property of an object that can be present only when it adopts some
particular admissible structure (an NP-certificate) or be absent (no admissible
structure), however, none of the standard approaches can discard the hypothesis
when no solution can be found, since none can provide a proof that there is no
admissible structure. This article presents an algorithm that introduces a
novel type of solution method to ""efficiently"" solve the graph 3-coloring
problem; an NP-complete problem. The proposed method provides certificates
(proofs) in both cases: present or absent, so it is possible to accept or
reject the hypothesis on the basis of a rigorous proof. It provides exact
solutions and is polynomial-time (i.e., efficient) however parametric. The only
requirement is sufficient computational power, which is controlled by the
parameter $\alpha\in\mathbb{N}$. Nevertheless, here it is proved that the
probability of requiring a value of $\alpha>k$ to obtain a solution for a
random graph decreases exponentially: $P(\alpha>k) \leq 2^{-(k+1)}$, making
tractable almost all problem instances. Thorough experimental analyses were
performed. The algorithm was tested on random graphs, planar graphs and
4-regular planar graphs. The obtained experimental results are in accordance
with the theoretical expected results.
","[{'version': 'v1', 'created': 'Fri, 26 Aug 2011 23:44:09 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Sep 2011 22:50:57 GMT'}, {'version': 'v3', 'created': 'Tue, 20 Sep 2011 15:43:41 GMT'}, {'version': 'v4', 'created': 'Mon, 24 Oct 2011 17:48:37 GMT'}, {'version': 'v5', 'created': 'Wed, 2 Nov 2011 23:08:34 GMT'}, {'version': 'v6', 'created': 'Sat, 22 Sep 2012 15:51:07 GMT'}]",2015-03-19,"[['Martin', 'H. Jose Antonio', '']]","['Graph-Coloring', 'Planar-Graphs', 'Co-NP', 'Computational-Complexity', '3-colorability', 'automatic theoremproving']"
14220,1602.08653,Vinicius Gusmao Pereira de Sa,"Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado,
  Fl\'avio K. Miyazawa, Vin\'icius G. Pereira de S\'a, Jayme L. Szwarcfiter",Dijkstra Graphs,"20 pages, 9 figures",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We revisit a concept that has been central in some early stages of computer
science, that of structured programming: a set of rules that an algorithm must
follow in order to acquire a structure that is desirable in many aspects. While
much has been written about structured programming, an important issue has been
left unanswered: given an arbitrary, compiled program, describe an algorithm to
decide whether or not it is structured, that is, whether it conforms to the
stated principles of structured programming. We refer to the classical concept
of structured programming, as described by Dijkstra. By employing a graph model
and graph-theoretic techniques, we formulate an efficient algorithm for
answering this question. To do so, we first introduce the class of graphs which
correspond to structured programs, which we call Dijkstra Graphs. Our problem
then becomes the recognition of such graphs, for which we present a greedy
$O(n)$-time algorithm. Furthermore, we describe an isomorphism algorithm for
Dijkstra graphs, whose complexity is also linear in the number of vertices of
the graph. Both the recognition and isomorphism algorithms have potential
important applications, such as in code similarity analysis.
","[{'version': 'v1', 'created': 'Sun, 28 Feb 2016 01:04:33 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Jun 2016 15:17:35 GMT'}]",2016-06-21,"[['Bento', 'Lucila M. S.', ''], ['Boccardo', 'Davidson R.', ''], ['Machado', 'Raphael C. S.', ''], ['Miyazawa', 'Flávio K.', ''], ['de Sá', 'Vinícius G. Pereira', ''], ['Szwarcfiter', 'Jayme L.', '']]","['graph algorithms', 'graph isomorphism', 'reducibility', 'structured programming']"
14221,1606.06508,Walter Mascarenhas,Walter F. Mascarenhas,Fast and accurate normalization of vectors and quaternions,"In this version I fixed some minor details in the text and moved all
  tables to the experiments section",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present fast and accurate ways to normalize two and three dimensional
vectors and quaternions and compute their length. Our approach is an adaptation
of ideas used in the linear algebra library LAPACK, and we believe that the
computational geometry and computer aided design communities are not aware of
the possibility of speeding up these fundamental operations in the robust way
proposed here.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2016 10:52:59 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Jan 2018 18:48:27 GMT'}]",2018-01-17,"[['Mascarenhas', 'Walter F.', '']]","['vectors', 'quaternions', 'normalization', 'efficiency', 'accuracy']"
14222,1005.4379,Zachary Snow,Zachary Snow and David Baelde and Gopalan Nadathur,"A Meta-Programming Approach to Realizing Dependently Typed Logic
  Programming",,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dependently typed lambda calculi such as the Logical Framework (LF) can
encode relationships between terms in types and can naturally capture
correspondences between formulas and their proofs. Such calculi can also be
given a logic programming interpretation: the Twelf system is based on such an
interpretation of LF. We consider here whether a conventional logic programming
language can provide the benefits of a Twelf-like system for encoding type and
proof-and-formula dependencies. In particular, we present a simple mapping from
LF specifications to a set of formulas in the higher-order hereditary Harrop
(hohh) language, that relates derivations and proof-search between the two
frameworks. We then show that this encoding can be improved by exploiting
knowledge of the well-formedness of the original LF specifications to elide
much redundant type-checking information. The resulting logic program has a
structure that closely resembles the original specification, thereby allowing
LF specifications to be viewed as hohh meta-programs. Using the Teyjus
implementation of lambdaProlog, we show that our translation provides an
efficient means for executing LF specifications, complementing the ability that
the Twelf system provides for reasoning about them.
","[{'version': 'v1', 'created': 'Mon, 24 May 2010 17:03:47 GMT'}]",2010-05-25,"[['Snow', 'Zachary', ''], ['Baelde', 'David', ''], ['Nadathur', 'Gopalan', '']]","['logical frameworks', 'dependently typed lambda calculi', 'higher-order logic programming', 'translation']"
14223,1511.08290,Taniya Shafique,"Taniya Shafique, Zia Muhammad and Huy-Dung Han","Cross-layer Chase Combining with Selective Retransmission, Analysis and
  Throughput Optimization for OFDM Systems",arXiv admin note: text overlap with arXiv:1503.05819,,,,cs.IT cs.PF math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present bandwidth efficient retransmission method employong
selective retransmission approach at modulation layer under orthogonal
frequency division multiplexing (OFDM) signaling. Our proposed cross-layer
design embeds a selective retransmission sublayer in physical layer (PHY) that
targets retransmission of information symbols transmitted over poor quality
OFDM sub-carriers. Most of the times, few errors in decoded bit stream result
in packet failure at medium access control (MAC) layer. The unnecessary
retransmission of good quality information symbols of a failed packet has
detrimental effect on overall throughput of transceiver. We propose a
cross-layer Chase combining with selective retransmission (CCSR) method by
blending Chase combining at MAC layer and selective retransmission in PHY. The
selective retransmission in PHY targets the poor quality information symbols
prior to decoding, which results into lower hybrid automatic repeat reQuest
(HARQ) retransmissions at MAC layer. We also present tight bit-error rate (BER)
upper bound and tight throughput lower bound for CCSR method. In order to
maximize throughput of the proposed method, we formulate optimization problem
with respect to the amount of information to be retransmitted in selective
retransmission. The simulation results demonstrate significant throughput gain
of the proposed CCSR method as compared to conventional Chase combining method.
","[{'version': 'v1', 'created': 'Thu, 26 Nov 2015 04:58:45 GMT'}]",2015-11-30,"[['Shafique', 'Taniya', ''], ['Muhammad', 'Zia', ''], ['Han', 'Huy-Dung', '']]","['Hybrid ARQ', 'LDPC', 'throughput', 'OFDM', 'retransmission', 'cross-layer', 'LTE']"
14224,1009.2706,Sergey Verlan,"Artiom Alhazov, Sergey Verlan","Minimization Strategies for Maximally Parallel Multiset Rewriting
  Systems",This article is an improved version of [1],,,,cs.FL cs.CC cs.CL cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Maximally parallel multiset rewriting systems (MPMRS) give a convenient way
to express relations between unstructured objects. The functioning of various
computational devices may be expressed in terms of MPMRS (e.g., register
machines and many variants of P systems). In particular, this means that MPMRS
are computationally complete; however, a direct translation leads to quite a
big number of rules. Like for other classes of computationally complete
devices, there is a challenge to find a universal system having the smallest
number of rules. In this article we present different rule minimization
strategies for MPMRS based on encodings and structural transformations. We
apply these strategies to the translation of a small universal register machine
(Korec, 1996) and we show that there exists a universal MPMRS with 23 rules.
Since MPMRS are identical to a restricted variant of P systems with antiport
rules, the results we obtained improve previously known results on the number
of rules for those systems.
","[{'version': 'v1', 'created': 'Tue, 14 Sep 2010 16:06:02 GMT'}]",2010-09-15,"[['Alhazov', 'Artiom', ''], ['Verlan', 'Sergey', '']]","['Multiset rewriting', 'Universal computations', 'Small register machines', 'P systems', 'Symport', 'Antiport']"
14225,1704.06874,Ehab Salahat Mr,"Ehab Salahat, Ahmed Kulaib, Nazar Ali, Raed Shubair",Exploring Symmetry in Wireless Propagation Channels,"Accepted in IEEE European Conference on Networks and Communications
  (EuCNC17), Oulu, Finland,12-15 Jun. 2017",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless communications literature is very rich with empirical studies and
measurement campaigns that study the nature of the wireless propagation
channel. However, despite their undoubted usefulness, many of these studies
have omitted a fundamental yet key feature of the physical signal propagation,
that is, wireless propagation asymmetry. This feature does not agree with the
electromagnetic reciprocity theorem, and the many research papers that adopt
wireless channel symmetry, and hence rendering their modeling, unexpectedly,
inaccurate. Besides, asymmetry is unquestionably an important characteristic of
wireless channels, which needs to be accurately characterized for
vehicular/mobile communications, 5G networks, and associated applications such
as indoor/outdoor localization. This paper presents a modest and a preliminary
study that reports potential causes of propagation asymmetry. Measurements
conducted on Khalifa University campus in UAE show that wireless channels are
symmetric in the absence of symmetry impairments. Therefore, care should be
taken when considering some practical wireless propagation scenarios. Key
conclusions and recommendation are summarized. We believe that this study will
be inspiring for the academic community and will trigger further investigations
within wireless propagation assumptions.
","[{'version': 'v1', 'created': 'Sun, 23 Apr 2017 02:47:59 GMT'}]",2017-04-25,"[['Salahat', 'Ehab', ''], ['Kulaib', 'Ahmed', ''], ['Ali', 'Nazar', ''], ['Shubair', 'Raed', '']]","['Channels Asymmetry', 'Multipath Fading', 'Wireless Propagation', 'Localization', 'Synchronization']"
14226,1802.06863,Upulee Kanewala,Karishma Rahman and Upulee Kanewala,Predicting Metamorphic Relation for Matrix Calculation Programs,,,,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Matrices often represent important information in scientific applications and
are involved in performing complex calculations. But systematically testing
these applications is hard due to the oracle problem. Metamorphic testing is an
effective approach to test such applications because it uses metamorphic
relations to determine whether test cases have passed or failed. Metamorphic
relations are typically identified with the help of a domain expert and is a
labor intensive task. In this work we use a graph kernel based machine learning
approach to predict metamorphic relations for matrix calculation programs.
Previously, this graph kernel based machine learning approach was used to
successfully predict metamorphic relations for programs that perform numerical
calculations. Results of this study show that this approach can be used to
predict metamorphic relations for matrix calculation programs as well.
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 21:32:55 GMT'}]",2018-02-21,"[['Rahman', 'Karishma', ''], ['Kanewala', 'Upulee', '']]","['Metamorphic testing', 'metamorphic relation', 'supervised learning', 'support vector machine', 'random walk kernel']"
14227,1603.06212,Randal Olson,"Randal S. Olson, Nathan Bartley, Ryan J. Urbanowicz, Jason H. Moore","Evaluation of a Tree-based Pipeline Optimization Tool for Automating
  Data Science","8 pages, 5 figures, preprint to appear in GECCO 2016, edits not yet
  made from reviewer comments",,,,cs.NE cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As the field of data science continues to grow, there will be an
ever-increasing demand for tools that make machine learning accessible to
non-experts. In this paper, we introduce the concept of tree-based pipeline
optimization for automating one of the most tedious parts of machine
learning---pipeline design. We implement an open source Tree-based Pipeline
Optimization Tool (TPOT) in Python and demonstrate its effectiveness on a
series of simulated and real-world benchmark data sets. In particular, we show
that TPOT can design machine learning pipelines that provide a significant
improvement over a basic machine learning analysis while requiring little to no
input nor prior knowledge from the user. We also address the tendency for TPOT
to design overly complex pipelines by integrating Pareto optimization, which
produces compact pipelines without sacrificing classification accuracy. As
such, this work represents an important step toward fully automating machine
learning pipeline design.
","[{'version': 'v1', 'created': 'Sun, 20 Mar 2016 13:32:27 GMT'}]",2016-03-22,"[['Olson', 'Randal S.', ''], ['Bartley', 'Nathan', ''], ['Urbanowicz', 'Ryan J.', ''], ['Moore', 'Jason H.', '']]","['pipeline optimization', 'hyperparameter optimization', 'datascience', 'machine learning', 'genetic programming', 'Pareto optimization', 'Python']"
14228,1108.4080,Alex Ter-Sarkissov,"Aram Ter-Sarkisov, Stephen Marsland","Convergence Properties of Two ({\mu} + {\lambda}) Evolutionary
  Algorithms On OneMax and Royal Roads Test Functions",accepted for ECTA 2011,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a number of bounds on convergence time for two elitist
population-based Evolutionary Algorithms using a recombination operator
k-Bit-Swap and a mainstream Randomized Local Search algorithm. We study the
effect of distribution of elite species and population size.
","[{'version': 'v1', 'created': 'Sat, 20 Aug 2011 02:11:57 GMT'}]",2011-08-23,"[['Ter-Sarkisov', 'Aram', ''], ['Marsland', 'Stephen', '']]","['Evolutionary Algorithms', 'Computational Complexity', 'Recombination Operators']"
14229,1310.0867,Zheng Dong,Zheng Dong and Arjmand Samuel,Touch-enabled Programming for the Lab of Things,"3 pages, 3 figures, PROMOTO 2013, 1309.5500",,,PrMoTo/2013/06,cs.PL cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lab of Things (LoT, lab-of-things.com) is a research platform for
interconnection, programming, and large scale deployment of devices and
sensors. These devices and sensors can then be used for deployment of field
studies in a variety of research areas including elderly care, energy
management, and the like. LoT is built on top of HomeOS, a middle-ware
component, making interconnection of a wide range of devices possible. LoT also
provides cloud storage and remote monitoring capabilities. Traditionally
programming on the LoT platform has been done using C# in Microsoft Visual
Studio. While LoT programs developed on the .NET framework offer a rich set of
functionality, writing programs on LoT can be challenging for developers who
are not experienced with the technology involved. In this demonstration, we
introduce an innovative programming approach on the LoT platform by building a
Generic Application and creating corresponding libraries on the user-friendly
TouchDevelop (touchdevelop.com) programming environment. As an example, we
implemented the same functionality of the Lab of Things Alerts application
using the new Generic App. In addition to a touch-enabled programming
environment, the new approach also significantly saves time and effort
developers have to devote when creating a customized Lab of Things application.
","[{'version': 'v1', 'created': 'Thu, 3 Oct 2013 00:21:53 GMT'}]",2013-10-04,"[['Dong', 'Zheng', ''], ['Samuel', 'Arjmand', '']]","['Programming Environment', 'Touch-based programming', 'devices', 'sensors', 'Internet of Things']"
14230,1710.01217,Varun Arvind,"Varun Arvind, Anthony Costa, Marcus Badgeley, Samuel Cho, Eric Oermann","Wide and deep volumetric residual networks for volumetric image
  classification",,,,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  3D shape models that directly classify objects from 3D information have
become more widely implementable. Current state of the art models rely on deep
convolutional and inception models that are resource intensive. Residual neural
networks have been demonstrated to be easier to optimize and do not suffer from
vanishing/exploding gradients observed in deep networks. Here we implement a
residual neural network for 3D object classification of the 3D Princeton
ModelNet dataset. Further, we show that widening network layers dramatically
improves accuracy in shallow residual nets, and residual neural networks
perform comparable to state-of-the-art 3D shape net models, and we show that
widening network layers improves classification accuracy. We provide extensive
training and architecture parameters providing a better understanding of
available network architectures for use in 3D object classification.
","[{'version': 'v1', 'created': 'Mon, 18 Sep 2017 04:30:13 GMT'}]",2017-10-04,"[['Arvind', 'Varun', ''], ['Costa', 'Anthony', ''], ['Badgeley', 'Marcus', ''], ['Cho', 'Samuel', ''], ['Oermann', 'Eric', '']]","['Convolutional neural network', 'volumetric', '3D', 'residual block', 'deep learning', 'imaging']"
14231,0803.2306,Valentin Goranko,Valentin Goranko and Dmitry Shkatov,"Tableau-based decision procedures for logics of strategic ability in
  multi-agent systems",To appear in ACM Transactions on Computational Logic. 48 pages,,,,cs.LO cs.AI cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop an incremental tableau-based decision procedures for the
  Alternating-time temporal logic ATL and some of its variants.
  While running within the theoretically established complexity upper bound, we
claim that our tableau is practically more efficient in the average case than
other decision procedures for ATL known so far. Besides, the ease of its
adaptation to variants of ATL demonstrates the flexibility of the proposed
procedure.
","[{'version': 'v1', 'created': 'Sat, 15 Mar 2008 16:22:53 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Sep 2008 10:53:22 GMT'}]",2008-09-09,"[['Goranko', 'Valentin', ''], ['Shkatov', 'Dmitry', '']]","['logics for multiagent systems', 'alternating-time temporal logic', 'decision procedure', 'tableaux']"
14232,1306.3083,Philippe Thomas,"M\'elanie Noyel (CRAN), Philippe Thomas (CRAN), Patrick Charpentier
  (CRAN), Andr\'e Thomas (CRAN), Bruno Beaupretre",Improving production process performance thanks to neuronal analysis,,"11th IFAC Workshop on Intelligent Manufacturing System IMS'13, Sao
  Paulo : Brazil (2013)",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Product quality level is become a key factor for companies' competitiveness.
A lot of time and money are required to ensure and guaranty it. Besides,
motivated by the need of traceability, collecting production data is now
commonplace in most companies. Our paper aims to show that we can ensure the
required quality thanks to an ""on-line quality approch"" and proposes a neural
network based process to determine the optimal setting for production machines.
We will illustrate this with the Acta-Mobilier case, which is a high quality
lacquerer company.
","[{'version': 'v1', 'created': 'Thu, 13 Jun 2013 11:23:18 GMT'}]",2013-06-14,"[['Noyel', 'Mélanie', '', 'CRAN'], ['Thomas', 'Philippe', '', 'CRAN'], ['Charpentier', 'Patrick', '', 'CRAN'], ['Thomas', 'André', '', 'CRAN'], ['Beaupretre', 'Bruno', '']]","['Multivariate quality control', 'product quality', 'neural networks', 'computer experiments', 'Optimal experimental Design', 'on-line control']"
14233,1512.01563,Marlos C. Machado,"Yitao Liang, Marlos C. Machado, Erik Talvitie, Michael Bowling","State of the Art Control of Atari Games Using Shallow Reinforcement
  Learning","A shorter version of this paper appears in the Proceedings of the
  15th International Conference on Autonomous Agents and Multiagent Systems
  (AAMAS 2016)",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The recently introduced Deep Q-Networks (DQN) algorithm has gained attention
as one of the first successful combinations of deep neural networks and
reinforcement learning. Its promise was demonstrated in the Arcade Learning
Environment (ALE), a challenging framework composed of dozens of Atari 2600
games used to evaluate general competency in AI. It achieved dramatically
better results than earlier approaches, showing that its ability to learn good
representations is quite robust and general. This paper attempts to understand
the principles that underlie DQN's impressive performance and to better
contextualize its success. We systematically evaluate the importance of key
representational biases encoded by DQN's network by proposing simple linear
representations that make use of these concepts. Incorporating these
characteristics, we obtain a computationally practical feature set that
achieves competitive performance to DQN in the ALE. Besides offering insight
into the strengths and weaknesses of DQN, we provide a generic representation
for the ALE, significantly reducing the burden of learning a representation for
each game. Moreover, we also provide a simple, reproducible benchmark for the
sake of comparison to future work in the ALE.
","[{'version': 'v1', 'created': 'Fri, 4 Dec 2015 21:06:04 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Apr 2016 21:55:54 GMT'}]",2016-04-25,"[['Liang', 'Yitao', ''], ['Machado', 'Marlos C.', ''], ['Talvitie', 'Erik', ''], ['Bowling', 'Michael', '']]","['Reinforcement Learning', 'Function Approximation', 'DQN', 'Representation Learning', 'Arcade Learning Environment']"
14234,1410.1080,Vladimir Bochkarev,"Valery D. Solovyev, Vladimir V. Bochkarev",Generating abbreviations using Google Books library,"5 pages, 3 figures",,,,cs.CL stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The article describes the original method of creating a dictionary of
abbreviations based on the Google Books Ngram Corpus. The dictionary of
abbreviations is designed for Russian, yet as its methodology is universal it
can be applied to any language. The dictionary can be used to define the
function of the period during text segmentation in various applied systems of
text processing. The article describes difficulties encountered in the process
of its construction as well as the ways to overcome them. A model of evaluating
a probability of first and second type errors (extraction accuracy and
fullness) is constructed. Certain statistical data for the use of abbreviations
are provided.
","[{'version': 'v1', 'created': 'Sat, 4 Oct 2014 19:00:54 GMT'}]",2014-10-07,"[['Solovyev', 'Valery D.', ''], ['Bochkarev', 'Vladimir V.', '']]","['Information extraction', 'abbreviation', 'Google Books Ngram;']"
14235,1409.7411,Paulo Oliva,"Jules Hedges, Paulo Oliva, Evguenia Winschel, Viktor Winschel, Philipp
  Zahn",A Higher-order Framework for Decision Problems and Games,45 pages,,,,cs.LO cs.GT math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a new unified framework for modelling both decision problems and
finite games based on quantifiers and selection functions. We show that the
canonical utility maximisation is one special case of a quantifier and that our
more abstract framework provides several additional degrees of freedom in
modelling. In particular, incomplete preferences, non-maximising heuristics,
and context-dependent motives can be taken into account when describing an
agent's goal. We introduce a suitable generalisation of Nash equilibrium for
games in terms of quantifiers and selection functions. Moreover, we introduce a
refinement of Nash that captures context-dependency of goals. Modelling in our
framework is compositional as the parts of the game are modular and can be
easily exchanged. We provide an extended example where we illustrate concepts
and highlight the benefits of our alternative modelling approach.
","[{'version': 'v1', 'created': 'Thu, 25 Sep 2014 20:19:52 GMT'}]",2014-09-29,"[['Hedges', 'Jules', ''], ['Oliva', 'Paulo', ''], ['Winschel', 'Evguenia', ''], ['Winschel', 'Viktor', ''], ['Zahn', 'Philipp', '']]","['behavioural economics', 'foundations of game theory', 'decisiontheory', 'beauty contest', 'higher order functions', 'quantifiers', 'selection functions']"
14236,1305.1744,Joong Chae Na,"Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S.
  Iliopoulos, Laurent Mouchard, and Kunsoo Park",Suffix Tree of Alignment: An Efficient Index for Similar Data,12 pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider an index data structure for similar strings. The generalized
suffix tree can be a solution for this. The generalized suffix tree of two
strings $A$ and $B$ is a compacted trie representing all suffixes in $A$ and
$B$. It has $|A|+|B|$ leaves and can be constructed in $O(|A|+|B|)$ time.
However, if the two strings are similar, the generalized suffix tree is not
efficient because it does not exploit the similarity which is usually
represented as an alignment of $A$ and $B$.
  In this paper we propose a space/time-efficient suffix tree of alignment
which wisely exploits the similarity in an alignment. Our suffix tree for an
alignment of $A$ and $B$ has $|A| + l_d + l_1$ leaves where $l_d$ is the sum of
the lengths of all parts of $B$ different from $A$ and $l_1$ is the sum of the
lengths of some common parts of $A$ and $B$. We did not compromise the pattern
search to reduce the space. Our suffix tree can be searched for a pattern $P$
in $O(|P|+occ)$ time where $occ$ is the number of occurrences of $P$ in $A$ and
$B$. We also present an efficient algorithm to construct the suffix tree of
alignment. When the suffix tree is constructed from scratch, the algorithm
requires $O(|A| + l_d + l_1 + l_2)$ time where $l_2$ is the sum of the lengths
of other common substrings of $A$ and $B$. When the suffix tree of $A$ is
already given, it requires $O(l_d + l_1 + l_2)$ time.
","[{'version': 'v1', 'created': 'Wed, 8 May 2013 08:36:07 GMT'}]",2013-05-09,"[['Na', 'Joong Chae', ''], ['Park', 'Heejin', ''], ['Crochemore', 'Maxime', ''], ['Holub', 'Jan', ''], ['Iliopoulos', 'Costas S.', ''], ['Mouchard', 'Laurent', ''], ['Park', 'Kunsoo', '']]","['Indexes for similar data', 'suffix trees', 'alignments']"
14237,1412.2880,Iza Marfisi-Schottman,"Iza Marfisi-Schottman, S\'ebastien George, Franck Tarpin-Bernard (LIG)",Evaluating Learning Games during their Conception,"European Conference on Game Based Learning, ECGBL, Oct 2014, Berlin,
  Germany",,,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning Games (LGs) are educational environments based on a playful approach
to learning. Their use has proven to be promising in many domains, but is at
present restricted by the time consuming and costly nature of the developing
process. In this paper, we propose a set of quality indicators that can help
the conception team to evaluate the quality of their LG during the designing
process, and before it is developed. By doing so, the designers can identify
and repair problems in the early phases of the conception and therefore reduce
the alteration phases, that occur after testing the LG's prototype. These
quality indicators have been validated by 6 LG experts that used them to assess
the quality of 24 LGs in the process of being designed. They have also proven
to be useful as design guidelines for novice LG designers.
","[{'version': 'v1', 'created': 'Tue, 9 Dec 2014 08:00:41 GMT'}]",2014-12-11,"[['Marfisi-Schottman', 'Iza', '', 'LIG'], ['George', 'Sébastien', '', 'LIG'], ['Tarpin-Bernard', 'Franck', '', 'LIG']]","['Learning Games', 'Serious Games', 'evaluation', 'quality', 'cost', 'design', 'conception', 'development']"
14238,1504.02576,Loet Leydesdorff,"Johann Bauer, Loet Leydesdorff and Lutz Bornmann","Highly-cited papers in Library and Information Science (LIS): Authors,
  institutions, and network structures","accepted for publication in the Journal of the Association for
  Information Science and Technology (JASIST)",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As a follow-up to the highly-cited authors list published by Thomson Reuters
in June 2014, we analyze the top-1% most frequently cited papers published
between 2002 and 2012 included in the Web of Science (WoS) subject category
""Information Science & Library Science."" 798 authors contributed to 305 top-1%
publications; these authors were employed at 275 institutions. The authors at
Harvard University contributed the largest number of papers, when the addresses
are whole-number counted. However, Leiden University leads the ranking, if
fractional counting is used.
  Twenty-three of the 798 authors were also listed as most highly-cited authors
by Thomson Reuters in June 2014 (http://highlycited.com/). Twelve of these 23
authors were involved in publishing four or more of the 305 papers under study.
Analysis of co-authorship relations among the 798 highly-cited scientists shows
that co-authorships are based on common interests in a specific topic. Three
topics were important between 2002 and 2012: (1) collection and exploitation of
information in clinical practices, (2) the use of internet in public
communication and commerce, and (3) scientometrics.
","[{'version': 'v1', 'created': 'Fri, 10 Apr 2015 08:00:29 GMT'}]",2015-04-13,"[['Bauer', 'Johann', ''], ['Leydesdorff', 'Loet', ''], ['Bornmann', 'Lutz', '']]","['highly-cited', 'library and information science', 'ranking', 'author', 'institution', 'co']"
14239,1407.0420,Yair Zick Dr.,"Yair Zick, Georgios Chalkiadakis, Edith Elkind, Evangelos Markakis","Cooperative Games with Overlapping Coalitions: Charting the Tractability
  Frontier",,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many multiagent scenarios, agents distribute resources, such as time or
energy, among several tasks. Having completed their tasks and generated
profits, task payoffs must be divided among the agents in some reasonable
manner. Cooperative games with overlapping coalitions (OCF games) are a recent
framework proposed by Chalkiadakis et al. (2010), generalizing classic
cooperative games to the case where agents may belong to more than one
coalition. Having formed overlapping coalitions and divided profits, some
agents may feel dissatisfied with their share of the profits, and would like to
deviate from the given outcome. However, deviation in OCF games is a
complicated matter: agents may decide to withdraw only some of their weight
from some of the coalitions they belong to; that is, even after deviation, it
is possible that agents will still be involved in tasks with non-deviators.
This means that the desirability of a deviation, and the stability of formed
coalitions, is to a great extent determined by the reaction of non-deviators.
In this work, we explore algorithmic aspects of OCF games, focusing on the core
in OCF games. We study the problem of deciding if the core of an OCF game is
not empty, and whether a core payoff division can be found in polynomial time;
moreover, we identify conditions that ensure that the problem admits polynomial
time algorithms. Finally, we introduce and study a natural class of OCF games,
Linear Bottleneck Games. Interestingly, we show that such games always have a
non-empty core, even assuming a highly lenient reaction to deviations.
","[{'version': 'v1', 'created': 'Tue, 1 Jul 2014 22:30:45 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Jul 2014 15:27:38 GMT'}, {'version': 'v3', 'created': 'Tue, 15 Jul 2014 14:26:34 GMT'}]",2014-07-16,"[['Zick', 'Yair', ''], ['Chalkiadakis', 'Georgios', ''], ['Elkind', 'Edith', ''], ['Markakis', 'Evangelos', '']]","['Cooperative Games', 'Overlapping Coalition Formation', 'Core', 'Treewidth', 'Arbitration Functions']"
14240,1710.05233,Jonathan Shafer,"Raef Bassily, Shay Moran, Ido Nachum, Jonathan Shafer, Amir Yehudayoff",Learners that Use Little Information,,,,,cs.LG cs.AI cs.CR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study learning algorithms that are restricted to using a small amount of
information from their input sample. We introduce a category of learning
algorithms we term $d$-bit information learners, which are algorithms whose
output conveys at most $d$ bits of information of their input. A central theme
in this work is that such algorithms generalize.
  We focus on the learning capacity of these algorithms, and prove sample
complexity bounds with tight dependencies on the confidence and error
parameters. We also observe connections with well studied notions such as
sample compression schemes, Occam's razor, PAC-Bayes and differential privacy.
  We discuss an approach that allows us to prove upper bounds on the amount of
information that algorithms reveal about their inputs, and also provide a lower
bound by showing a simple concept class for which every (possibly randomized)
empirical risk minimizer must reveal a lot of information. On the other hand,
we show that in the distribution-dependent setting every VC class has empirical
risk minimizers that do not reveal a lot of information.
","[{'version': 'v1', 'created': 'Sat, 14 Oct 2017 20:40:46 GMT'}, {'version': 'v2', 'created': 'Sun, 24 Dec 2017 10:51:35 GMT'}, {'version': 'v3', 'created': 'Wed, 28 Feb 2018 03:14:32 GMT'}]",2018-03-01,"[['Bassily', 'Raef', ''], ['Moran', 'Shay', ''], ['Nachum', 'Ido', ''], ['Shafer', 'Jonathan', ''], ['Yehudayoff', 'Amir', '']]","['PAC Learning', 'Information Theory', 'Compression', 'PAC-Bayes', 'Sample CompressionScheme', 'Occam’s Razor', 'Differential Privacy']"
14241,1702.00992,Eric Malmi,"Eric Malmi, Daniele Pighin, Sebastian Krause, Mikhail Kozhevnikov",Automatic Prediction of Discourse Connectives,This is a pre-print of an article appearing at LREC 2018,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate prediction of suitable discourse connectives (however, furthermore,
etc.) is a key component of any system aimed at building coherent and fluent
discourses from shorter sentences and passages. As an example, a dialog system
might assemble a long and informative answer by sampling passages extracted
from different documents retrieved from the Web. We formulate the task of
discourse connective prediction and release a dataset of 2.9M sentence pairs
separated by discourse connectives for this task. Then, we evaluate the
hardness of the task for human raters, apply a recently proposed decomposable
attention (DA) model to this task and observe that the automatic predictor has
a higher F1 than human raters (32 vs. 30). Nevertheless, under specific
conditions the raters still outperform the DA model, suggesting that there is
headroom for future improvements.
","[{'version': 'v1', 'created': 'Fri, 3 Feb 2017 13:06:25 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Feb 2018 15:43:28 GMT'}]",2018-02-02,"[['Malmi', 'Eric', ''], ['Pighin', 'Daniele', ''], ['Krause', 'Sebastian', ''], ['Kozhevnikov', 'Mikhail', '']]","['discourse connectives', 'decomposable attention model', 'discourse relation prediction']"
14242,1312.6836,Sonia,"Sonia, Archana Singhal, Hema Banati","Fuzzy Logic Approach for Threat Prioritization in Agile Security
  Framework using DREAD Model",,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For a qualitative system sound security practices must be a crucial part
throughout the entire software lifecycle. Furthermore, agile software
development has paved the way for overcoming the problems faced by developers
during traditional development process. In the given paper we are using an
Agile Security Framework that is compatible with practices of agile processes
and inherit in it the benefits of security engineering activities in the form
of risk assessment and threat prioritization. One of the most popular
techniques to deal with ever growing risks associated with security threats is
DREAD model. It is used for rating risk of threats identified in the abuser
stories. In this model threats needs to be defined by sharp cutoffs. However,
such precise distribution is not suitable for risk categorization as risks are
vague in nature and deals with high level of uncertainty. In view of these risk
factors, our paper proposes a novel fuzzy approach using DREAD model for
computing risk level that ensures better evaluation of imprecise concepts. Thus
it provides the capacity to include subjectivity and uncertainty during risk
ranking. A case study has been presented to illustrate and compare the proposed
approach with the existing one using Matlab.
","[{'version': 'v1', 'created': 'Tue, 24 Dec 2013 15:06:29 GMT'}]",2013-12-25,"[['Sonia', '', ''], ['Singhal', 'Archana', ''], ['Banati', 'Hema', '']]","['Fuzzy logic', 'Agile Security Framework', 'Risk ranking', 'DREAD Model', 'Fuzzy Inference System']"
14243,1208.4484,Sruti  Gan Chaudhuri SGC,Sruti Gan Chaudhuri and Krishnendu Mukhopadhyaya,"Leader Election and Gathering for Asynchronous Transparent Fat Robots
  without Chirality",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a distributed algorithm which deterministically gathers n
(n > 4) asynchronous, fat robots. The robots are assumed to be transparent and
they have full visibility. The robots are initially considered to be
stationary. A robot is visible in its motion. The robots do not store past
actions. They are anonymous and can not be distinguished by their appearances
and do not have common coordinate system or chirality. The robots do not
communicate through message passing. In the proposed gathering algorithm one
robot moves at a time towards its destination. The robot which moves, is
selected in such a way that, it will be the only robot eligible to move, until
it reaches its destination. In case of a tie, this paper proposes a leader
election algorithm which produces an ordering of the robots and the first robot
in the ordering becomes the leader. The ordering is unique in the sense that,
each robot, characterized by its location, agrees on the same ordering. We show
that if a set of robots can be ordered then they can gather deterministically.
The paper also characterizes the cases, where ordering is not possible. This
paper also presents an important fact that, if leader election is possible then
gathering pattern formation is possible even with no chirality.
","[{'version': 'v1', 'created': 'Wed, 22 Aug 2012 12:10:15 GMT'}]",2015-03-20,"[['Chaudhuri', 'Sruti Gan', ''], ['Mukhopadhyaya', 'Krishnendu', '']]","['Asynchronous', 'fat robots', 'gathering', 'leader election', 'chirality']"
14244,0709.0426,Noelle Carbonell,"No\""elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA),
  Suzanne Kieffer (INRIA Rocquencourt / INRIA Lorraine - LORIA)",Do oral messages help visual search?,26 pages,"Advances in Natural Multimodal Dialogue Systems, Dordrecht (NL)
  Springer (Ed.) (2005) pp. 131-157",,,cs.HC,,"  A preliminary experimental study is presented, that aims at eliciting the
contribution of oral messages to facilitating visual search tasks on crowded
visual displays. Results of quantitative and qualitative analyses suggest that
appropriate verbal messages can improve both target selection time and
accuracy. In particular, multimodal messages including a visual presentation of
the isolated target together with absolute spatial oral information on its
location in the displayed scene seem most effective. These messages also got
top-ranking ratings from most subjects.
","[{'version': 'v1', 'created': 'Tue, 4 Sep 2007 13:23:40 GMT'}]",2007-09-05,"[['Carbonell', 'Noëlle', '', 'INRIA Rocquencourt / INRIA Lorraine - LORIA'], ['Kieffer', 'Suzanne', '', 'INRIA Rocquencourt / INRIA Lorraine - LORIA']]","['multimodal interaction', 'multimedia presentations', 'visual search', 'spatial oral messages', 'speech and graphics', 'usability experimental study']"
14245,1212.4756,Matthew Patitz,"Erik D. Demaine, Martin L. Demaine, S\'andor P. Fekete, Matthew J.
  Patitz, Robert T. Schweller, Andrew Winslow, and Damien Woods","One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly
  System, or Tiling System with a Single Puzzle Piece",,,,,cs.DS cs.CC cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we explore the power of tile self-assembly models that extend
the well-studied abstract Tile Assembly Model (aTAM) by permitting tiles of
shapes beyond unit squares. Our main result shows the surprising fact that any
aTAM system, consisting of many different tile types, can be simulated by a
single tile type of a general shape. As a consequence, we obtain a single
universal tile type of a single (constant-size) shape that serves as a
""universal tile machine"": the single universal tile type can simulate any
desired aTAM system when given a single seed assembly that encodes the desired
aTAM system. We also show how to adapt this result to convert any of a variety
of plane tiling systems (such as Wang tiles) into a ""nearly"" plane tiling
system with a single tile (but with small gaps between the tiles). All of these
results rely on the ability to both rotate and translate tiles; by contrast, we
show that a single nonrotatable tile, of arbitrary shape, can produce
assemblies which either grow infinitely or cannot grow at all, implying
drastically limited computational power.
  On the positive side, we show how to simulate arbitrary cellular automata for
a limited number of steps using a single nonrotatable tile and a linear-size
seed assembly.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2012 17:37:27 GMT'}]",2012-12-20,"[['Demaine', 'Erik D.', ''], ['Demaine', 'Martin L.', ''], ['Fekete', 'Sándor P.', ''], ['Patitz', 'Matthew J.', ''], ['Schweller', 'Robert T.', ''], ['Winslow', 'Andrew', ''], ['Woods', 'Damien', '']]","['Self-assembly', 'tiling', 'aperiodic tile set', 'universality', 'one']"
14246,1312.6832,Eugene Feinberg,Eugene A. Feinberg and Jefferson Huang,"The Value Iteration Algorithm is Not Strongly Polynomial for Discounted
  Dynamic Programming",,,,,cs.AI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This note provides a simple example demonstrating that, if exact computations
are allowed, the number of iterations required for the value iteration
algorithm to find an optimal policy for discounted dynamic programming problems
may grow arbitrarily quickly with the size of the problem. In particular, the
number of iterations can be exponential in the number of actions. Thus, unlike
policy iterations, the value iteration algorithm is not strongly polynomial for
discounted dynamic programming.
","[{'version': 'v1', 'created': 'Thu, 19 Dec 2013 23:54:50 GMT'}]",2013-12-25,"[['Feinberg', 'Eugene A.', ''], ['Huang', 'Jefferson', '']]","['Markov Decision Process', 'value iteration', 'strongly polynomial', 'policy', 'algorithm']"
14247,1506.04228,Grigor Iliev,"Grigor Iliev, Nadezhda Borisova, Elena Karashtranova, Dafina
  Kostadinova",A Publicly Available Cross-Platform Lemmatizer for Bulgarian,"5 pages, Sixth International Scientific Conference - FMNS2015",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our dictionary-based lemmatizer for the Bulgarian language presented here is
distributed as free software, publicly available to download and use under the
GPL v3 license. The presented software is written entirely in Java and is
distributed as a GATE plugin. To our best knowledge, at the time of writing
this article, there are not any other free lemmatization tools specifically
targeting the Bulgarian language. The presented lemmatizer is a work in
progress and currently yields an accuracy of about 95% in comparison to the
manually annotated corpus BulTreeBank-Morph, which contains 273933 tokens.
","[{'version': 'v1', 'created': 'Sat, 13 Jun 2015 05:47:50 GMT'}]",2015-06-16,"[['Iliev', 'Grigor', ''], ['Borisova', 'Nadezhda', ''], ['Karashtranova', 'Elena', ''], ['Kostadinova', 'Dafina', '']]","['Bulgarian grammar', 'NLP', 'GATE']"
14248,1410.4262,Adrien Ickowicz,Adrien Ickowicz,"Approximate Bayesian algorithms for multiple target tracking with binary
  sensors","19 pages, 6 figures",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose an approximate Bayesian computation approach to
perform a multiple target tracking within a binary sensor network. The nature
of the binary sensors (getting closer - moving away information) do not allow
the use of the classical tools (e.g. Kalman Filter, Particle Filer), because
the exact likelihood is intractable. To overcome this, we use the particular
feature of the likelihood-free algorithms to produce an efficient multiple
target tracking methodology.
","[{'version': 'v1', 'created': 'Thu, 16 Oct 2014 00:07:07 GMT'}]",2014-10-17,"[['Ickowicz', 'Adrien', '']]","['approximate Bayesian computation', 'multiple target tracking', 'binarysensors']"
14249,2007.05614,Roi Bar Zur,"Roi Bar-Zur, Ittay Eyal and Aviv Tamar",Efficient MDP Analysis for Selfish-Mining in Blockchains,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A proof of work (PoW) blockchain protocol distributes rewards to its
participants, called miners, according to their share of the total
computational power. Sufficiently large miners can perform selfish mining -
deviate from the protocol to gain more than their fair share. Such systems are
thus secure if all miners are smaller than a threshold size so their best
response is following the protocol.
  To find the threshold, one has to identify the optimal strategy for miners of
different sizes, i.e., solve a Markov Decision Process (MDP). However, because
of the PoW difficulty adjustment mechanism, the miners' utility is a non-linear
ratio function. We therefore call this an Average Reward Ratio (ARR) MDP.
Sapirshtein et al.\ were the first to solve ARR MDPs by solving a series of
standard MDPs that converge to the ARR MDP solution.
  In this work, we present a novel technique for solving an ARR MDP by solving
a single standard MDP. The crux of our approach is to augment the MDP such that
it terminates randomly, within an expected number of rounds. We call this
Probabilistic Termination Optimization (PTO), and the technique applies to any
MDP whose utility is a ratio function. We bound the approximation error of PTO
- it is inversely proportional to the expected number of rounds before
termination, a parameter that we control. Empirically, PTO's complexity is an
order of magnitude lower than the state of the art.
  PTO can be easily applied to different blockchains. We use it to tighten the
bound on the threshold for selfish mining in Ethereum.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 21:22:03 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Sep 2020 17:36:40 GMT'}]",2020-09-16,"[['Bar-Zur', 'Roi', ''], ['Eyal', 'Ittay', ''], ['Tamar', 'Aviv', '']]","['Blockchain', 'Cryptocurrency', 'Markov Decision Process', 'Selfish Mining', 'Bitcoin', 'Ethereum', 'Proof of Work', 'Optimal Selfish Mining']"
14250,1003.2614,Sugata Sanyal,"Alok Ojha, Hongmei Deng, Dharma P. Agrawal, S. Sanyal",Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks,"4 Pages, 5 Figures, International Conference on Computers and Device
  Communication, CODEC-2004, Jan 1-3, 2004, Kolkata, India",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In cluster-based routing protocol (CBRP), two-level hierarchical structure is
successfully used to reduce over-flooding in wireless Ad Hoc networks. As it is
vulnerable to a single point of failure, we propose a new adaptive distributed
threshold scheme to replace the cluster head by a group of cluster heads within
each cluster, called COUNCIL, and distribute the service of single cluster head
to multiple cluster heads using (k,n) threshold secret sharing scheme. An Ad
Hoc network formed by COUNCIL based clusters can work correctly when the number
of compromised cluster heads is smaller than k. To implement this adaptive
threshold scheme in wireless Ad Hoc Networks, membership of the clusters should
be defined in an adaptive way. In this paper, we mainly discuss our algorithm
for forming COUNCIL based clusters using the concept of dominating set from
graph theory.
","[{'version': 'v1', 'created': 'Fri, 12 Mar 2010 20:31:24 GMT'}]",2010-03-15,"[['Ojha', 'Alok', ''], ['Deng', 'Hongmei', ''], ['Agrawal', 'Dharma P.', ''], ['Sanyal', 'S.', '']]","['Wireless Ad Hoc Networks', 'Network Security', 'Threshold Secret Sharing']"
14251,1305.2006,Jierui Xie,"Jierui Xie, Mingming Chen, Boleslaw K. Szymanski","LabelRankT: Incremental Community Detection in Dynamic Networks via
  Label Propagation","DyNetMM 2013, New York, USA (conjunction with SIGMOD/PODS 2013)","Proc. DyNetMM 2013 at SIGMOD/PODS 2013, New York, NY, 2013",,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An increasingly important challenge in network analysis is efficient
detection and tracking of communities in dynamic networks for which changes
arrive as a stream. There is a need for algorithms that can incrementally
update and monitor communities whose evolution generates huge realtime data
streams, such as the Internet or on-line social networks. In this paper, we
propose LabelRankT, an online distributed algorithm for detection of
communities in large-scale dynamic networks through stabilized label
propagation. Results of tests on real-world networks demonstrate that
LabelRankT has much lower computational costs than other algorithms. It also
improves the quality of the detected communities compared to dynamic detection
methods and matches the quality achieved by static detection approaches. Unlike
most of other algorithms which apply only to binary networks, LabelRankT works
on weighted and directed networks, which provides a flexible and promising
solution for real-world applications.
","[{'version': 'v1', 'created': 'Thu, 9 May 2013 04:01:46 GMT'}, {'version': 'v2', 'created': 'Sun, 12 May 2013 18:41:13 GMT'}]",2013-05-15,"[['Xie', 'Jierui', ''], ['Chen', 'Mingming', ''], ['Szymanski', 'Boleslaw K.', '']]","['social network', 'community detection', 'clustering', 'networkevolution', 'dynamic network', 'temporal']"
14252,1701.08528,"Martin J\""anicke","David Bannach, Martin J\""anicke, Vitor F. Rey, Sven Tomforde, Bernhard
  Sick, Paul Lukowicz",Self-Adaptation of Activity Recognition Systems to New Sensors,"26 pages, very descriptive figures, comprehensive evaluation on
  real-life datasets",,,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional activity recognition systems work on the basis of training,
taking a fixed set of sensors into account. In this article, we focus on the
question how pattern recognition can leverage new information sources without
any, or with minimal user input. Thus, we present an approach for opportunistic
activity recognition, where ubiquitous sensors lead to dynamically changing
input spaces. Our method is a variation of well-established principles of
machine learning, relying on unsupervised clustering to discover structure in
data and inferring cluster labels from a small number of labeled dates in a
semi-supervised manner. Elaborating the challenges, evaluations of over 3000
sensor combinations from three multi-user experiments are presented in detail
and show the potential benefit of our approach.
","[{'version': 'v1', 'created': 'Mon, 30 Jan 2017 10:01:38 GMT'}]",2017-01-31,"[['Bannach', 'David', ''], ['Jänicke', 'Martin', ''], ['Rey', 'Vitor F.', ''], ['Tomforde', 'Sven', ''], ['Sick', 'Bernhard', ''], ['Lukowicz', 'Paul', '']]","['Opportunistic Activity Recognition', 'Unsupervised Learning', 'Semi-supervisedLearning', 'Classifier Adaptation']"
14253,1206.3891,Venkata Krishna P,"Deeksha Jain, P. Venkata Krishna and V. Saritha",A Study on Internet of Things based Applications,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper gives a detail analysis of various applications based on Internet
of Thing (IoT)s. This explains about how internet of things evolved from mobile
computing and ubiquitous computing. It emphasises the fact that objects are
connected over the internet rather than people. The properties of Internet of
Things (IOT) are product information, electronic tag, standard expressed and
uploading information. It utilises the Radio Frequency Identification (RFID)
technology and wireless sensor networks (WSN). IOT applications are used in
domains such as healthcare, supply chain management, defence and agriculture.
Lastly the paper focuses on issues involved in IOT. Though it is a boon, IOT
faces certain crucial issues like privacy and security.
","[{'version': 'v1', 'created': 'Mon, 18 Jun 2012 11:20:56 GMT'}]",2012-06-19,"[['Jain', 'Deeksha', ''], ['Krishna', 'P. Venkata', ''], ['Saritha', 'V.', '']]","['Internet Of Things', 'RFID', 'Electronic Tag', 'WSN']"
14254,1511.08920,Jan Zeman,"Filip Kola\v{r}\'ik, Bo\v{r}ek Patz\'ak, Jan Zeman","Computational Homogenization of Fresh Concrete Flow Around Reinforcing
  Bars","23 pages, 15 figures",,,,cs.CE physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by casting of fresh concrete in reinforced concrete structures, we
introduce a numerical model of a steady-state non-Newtonian fluid flow through
a porous domain. Our approach combines homogenization techniques to represent
the reinforced domain by the Darcy law with an interface coupling of the Stokes
and Darcy flows through the Beavers-Joseph-Saffman conditions. The ensuing
two-scale problem is solved by the Finite Element Method with consistent
linearization and the results obtained from the homogenization approach are
verified against fully resolved direct numerical simulations.
","[{'version': 'v1', 'created': 'Sat, 28 Nov 2015 19:08:03 GMT'}]",2016-06-07,"[['Kolařík', 'Filip', ''], ['Patzák', 'Bořek', ''], ['Zeman', 'Jan', '']]","['fresh concrete flow', 'porous media flow', 'homogenization', 'Stokes-Darcy coupling']"
14255,1412.8576,Da Zheng,"Heng Wang, Da Zheng, Randal Burns, Carey Priebe",Active Community Detection in Massive Graphs,published in SDM-Networks 2015,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A canonical problem in graph mining is the detection of dense communities.
This problem is exacerbated for a graph with a large order and size -- the
number of vertices and edges -- as many community detection algorithms scale
poorly. In this work we propose a novel framework for detecting active
communities that consist of the most active vertices in massive graphs. The
framework is applicable to graphs having billions of vertices and hundreds of
billions of edges. Our framework utilizes a parallelizable trimming algorithm
based on a locality statistic to filter out inactive vertices, and then
clusters the remaining active vertices via spectral decomposition on their
similarity matrix. We demonstrate the validity of our method with synthetic
Stochastic Block Model graphs, using Adjusted Rand Index as the performance
metric. We further demonstrate its practicality and efficiency on a most recent
real-world Hyperlink Web graph consisting of over 3.5 billion vertices and 128
billion edges.
","[{'version': 'v1', 'created': 'Tue, 30 Dec 2014 07:56:02 GMT'}, {'version': 'v2', 'created': 'Sun, 11 Jan 2015 18:45:45 GMT'}, {'version': 'v3', 'created': 'Fri, 13 Feb 2015 22:26:29 GMT'}]",2015-02-17,"[['Wang', 'Heng', ''], ['Zheng', 'Da', ''], ['Burns', 'Randal', ''], ['Priebe', 'Carey', '']]","['communitydetection', 'webgraph', 'massivegraph', 'graph clustering', 'locality statistic']"
14256,1111.5500,Armanda Rodrigues,Andr\'e Sabino and Armanda Rodrigues,Understanding the Role of Cooperation in Emergency Plan Construction,"5 pages, 1 figure, 1 table, The 8th International Conference on
  Information Systems for Crisis Response and Management -- ISCRAM 2011, held
  in Lisbon, Portugal, May 8-11, 2011",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we describe a proposal for information organization for
computer supported cooperative work, while working with spatial information. It
is focused on emergency response plan construction, and the requirements
extracted from that task. At the centre of our proposal is the analysis of the
structure of the cooperative workspace. We argue that the internal information
representation should follow a spatial approach, tying the structure used to
manage users with the structure used to manage information, suggesting the use
of different spaces to represent the information. The gain we expect from this
approach is the improved capacity to extract information on how people are
cooperating and their relationship with the information they are working with.
The ideas are introduced while focusing on real life emergency planning
activities, where we discuss the current shortcomings of the cooperation
strategies in use and propose a solution.
","[{'version': 'v1', 'created': 'Tue, 15 Nov 2011 11:53:01 GMT'}]",2011-11-24,"[['Sabino', 'André', ''], ['Rodrigues', 'Armanda', '']]","['Emergency planning', 'computer supported cooperative work', 'geographic information systems']"
14257,1304.0844,Nina Narodytska,"Serge Gaspers, Thomas Kalinowski, Nina Narodytska, Toby Walsh",Coalitional Manipulation for Schulze's Rule,,,,,cs.AI cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Schulze's rule is used in the elections of a large number of organizations
including Wikimedia and Debian. Part of the reason for its popularity is the
large number of axiomatic properties, like monotonicity and Condorcet
consistency, which it satisfies. We identify a potential shortcoming of
Schulze's rule: it is computationally vulnerable to manipulation. In
particular, we prove that computing an unweighted coalitional manipulation
(UCM) is polynomial for any number of manipulators. This result holds for both
the unique winner and the co-winner versions of UCM. This resolves an open
question stated by Parkes and Xia (2012). We also prove that computing a
weighted coalitional manipulation (WCM) is polynomial for a bounded number of
candidates. Finally, we discuss the relation between the unique winner UCM
problem and the co-winner UCM problem and argue that they have substantially
different necessary and sufficient conditions for the existence of a successful
manipulation.
","[{'version': 'v1', 'created': 'Wed, 3 Apr 2013 05:14:08 GMT'}]",2013-04-04,"[['Gaspers', 'Serge', ''], ['Kalinowski', 'Thomas', ''], ['Narodytska', 'Nina', ''], ['Walsh', 'Toby', '']]","['social choice', 'voting', 'manipulation']"
14258,1701.05965,Cunsheng Ding,Cunsheng Ding,"An infinite family of Steiner systems $S(2, 4, 2^m)$ from cyclic codes",arXiv admin note: text overlap with arXiv:1605.03796,,,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Steiner systems are a fascinating topic of combinatorics. The most studied
Steiner systems are $S(2, 3, v)$ (Steiner triple systems), $S(3, 4, v)$
(Steiner quadruple systems), and $S(2, 4, v)$. There are a few infinite
families of Steiner systems $S(2, 4, v)$ in the literature. The objective of
this paper is to present an infinite family of Steiner systems $S(2, 4, 2^m)$
for all $m \equiv 2 \pmod{4} \geq 6$ from cyclic codes. This may be the first
coding-theoretic construction of an infinite family of Steiner systems $S(2, 4,
v)$. As a by-product, many infinite families of $2$-designs are also reported
in this paper.
","[{'version': 'v1', 'created': 'Sat, 21 Jan 2017 01:40:57 GMT'}]",2017-06-02,"[['Ding', 'Cunsheng', '']]","['Cyclc code', 'linear code', 'Steiner system', 't-design']"
14259,1312.2784,Srishti Gupta,"Srishti Gupta, Ponnurangam Kumaraguru","OCEAN: Open-source Collation of eGovernment data And Networks -
  Understanding Privacy Leaks in Open Government Data",,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The awareness and sense of privacy has increased in the minds of people over
the past few years. Earlier, people were not very restrictive in sharing their
personal information, but now they are more cautious in sharing it with
strangers, either in person or online. With such privacy expectations and
attitude of people, it is difficult to embrace the fact that a lot of
information is publicly available on the web. Information portals in the form
of the e-governance websites run by Delhi Government in India provide access to
such PII without any anonymization. Several databases e.g., Voterrolls, Driving
Licence number, MTNL phone directory, PAN card serve as repositories of
personal information of Delhi residents. This large amount of available
personal information can be exploited due to the absence of proper written law
on privacy in India. PII can also be collected from various social networking
sites like Facebook, Twitter, GooglePlus etc. where the users share some
information about them. Since users themselves put this information, it may not
be considered as a privacy breach, but if the information is aggregated, it may
give out much more information resulting in a bigger threat. To bring such
issues to public notice, we developed Open-source Collation of eGovernment data
And Networks (OCEAN), a system where the user enters little information (e.g.
Name) about a person and gets large amount of personal information about him /
her like name, age, address, date of birth, mother's name, father's name, voter
ID, driving licence number, PAN.
","[{'version': 'v1', 'created': 'Tue, 10 Dec 2013 12:39:06 GMT'}]",2016-11-25,"[['Gupta', 'Srishti', ''], ['Kumaraguru', 'Ponnurangam', '']]","['Online social networks', 'Personally Identifiable Information (PII)', 'personal attributes', 'privacy', 'government']"
14260,1506.00034,Charles R Doss,Charles R. Doss,Bracketing numbers of convex and $m$-monotone functions on polytopes,42 pages,,,,cs.IT math.IT math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study bracketing covering numbers for spaces of bounded convex functions
in the $L_p$ norms. Bracketing numbers are crucial quantities for understanding
asymptotic behavior for many statistical nonparametric estimators. Bracketing
number upper bounds in the supremum distance are known for bounded classes that
also have a fixed Lipschitz constraint. However, in most settings of interest,
the classes that arise do not include Lipschitz constraints, and so standard
techniques based on known bracketing numbers cannot be used. In this paper, we
find upper bounds for bracketing numbers of classes of convex functions without
Lipschitz constraints on arbitrary polytopes. Our results are of particular
interest in many multidimensional estimation problems based on convexity shape
constraints.
  Additionally, we show other applications of our proof methods; in particular
we define a new class of multivariate functions, the so-called $m$-monotone
functions. Such functions have been considered mathematically and statistically
in the univariate case but never in the multivariate case. We show how our
proof for convex bracketing upper bounds also applies to the $m$-monotone case.
","[{'version': 'v1', 'created': 'Fri, 29 May 2015 21:34:24 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Nov 2017 20:51:22 GMT'}, {'version': 'v3', 'created': 'Tue, 14 Apr 2020 18:28:40 GMT'}]",2020-04-16,"[['Doss', 'Charles R.', '']]","['bracketing entropy', 'Kolmogorov metric entropy', 'convex functions', 'convex']"
14261,1710.06540,Bassem Khalfi,"Bassem Khalfi, Mahdi Ben Ghorbel, Bechir Hamdaoui, Mohsen Guizani, and
  Nizar Zorba","A Particle Filtering Approach for Enabling Distributed and Scalable
  Sharing of DSA Network Resources",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Handling the massive number of devices needed in numerous applications such
as smart cities is a major challenge given the scarcity of spectrum resources.
Dynamic spectrum access (DSA) is seen as a potential candidate to support the
connectivity and spectrum access of these devices. We propose an efficient
technique that relies on particle filtering to enable distributed resource
allocation and sharing for large-scale dynamic spectrum access networks. More
specifically, we take advantage of the high tracking capability of particle
filtering to efficiently assign the available spectrum and power resources
among cognitive users. Our proposed technique maximizes the per-user throughput
while ensuring fairness among users, and it does so while accounting for the
different users' quality of service requirements and the channel gains'
variability. Through intensive simulations, we show that our proposed approach
performs well by achieving high overall throughput while improving user's
fairness under different objective functions. Furthermore, it achieves higher
performance when compared to state-of-the-art techniques.
","[{'version': 'v1', 'created': 'Wed, 18 Oct 2017 00:47:30 GMT'}]",2017-10-19,"[['Khalfi', 'Bassem', ''], ['Ghorbel', 'Mahdi Ben', ''], ['Hamdaoui', 'Bechir', ''], ['Guizani', 'Mohsen', ''], ['Zorba', 'Nizar', '']]","['Dynamic spectrum access', 'resource management', 'large-scale systems', 'particle filtering']"
14262,1207.5007,Madhur Srivastava,"Madhur Srivastava, Yashwant Yashu, Satish K. Singh, Prasanta K.
  Panigrahi","Multisegmentation through wavelets: Comparing the efficacy of Daubechies
  vs Coiflets",4 pages,"Proceedings in Signal Processing and Real Time Operating System (
  SPRTOS), March 26 - 27 , 2011",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we carry out a comparative study of the efficacy of wavelets
belonging to Daubechies and Coiflet family in achieving image segmentation
through a fast statistical algorithm.The fact that wavelets belonging to
Daubechies family optimally capture the polynomial trends and those of Coiflet
family satisfy mini-max condition, makes this comparison interesting. In the
context of the present algorithm, it is found that the performance of Coiflet
wavelets is better, as compared to Daubechies wavelet.
","[{'version': 'v1', 'created': 'Fri, 20 Jul 2012 17:37:27 GMT'}]",2013-07-18,"[['Srivastava', 'Madhur', ''], ['Yashu', 'Yashwant', ''], ['Singh', 'Satish K.', ''], ['Panigrahi', 'Prasanta K.', '']]","['Peak Signal to Noise Ratio', 'Segmentation', 'Standard deviation', 'Thresholding', 'Weighted mean']"
14263,1401.0655,Robert Gilles,Owen Sims and Robert P. Gilles,Critical Nodes In Directed Networks,"28 pages, 6 figures, 2 tables",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Critical nodes or ""middlemen"" have an essential place in both social and
economic networks when considering the flow of information and trade. This
paper extends the concept of critical nodes to directed networks. We identify
strong and weak middlemen. Node contestability is introduced as a form of
competition in networks; a duality between uncontested intermediaries and
middlemen is established. The brokerage power of middlemen is formally
expressed and a general algorithm is constructed to measure the brokerage power
of each node from the networks adjacency matrix. Augmentations of the brokerage
power measure are discussed to encapsulate relevant centrality measures. We use
these concepts to identify and measure middlemen in two empirical
socio-economic networks, the elite marriage network of Renaissance Florence and
Krackhardt's advice network.
","[{'version': 'v1', 'created': 'Fri, 3 Jan 2014 15:16:31 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Feb 2014 16:03:36 GMT'}]",2014-02-04,"[['Sims', 'Owen', ''], ['Gilles', 'Robert P.', '']]","['socio-economic networks', 'critical nodes', 'network analysis', 'contestability']"
14264,1510.08865,Kai Wei,"Kai Wei, Rishabh Iyer, Shengjie Wang, Wenruo Bai, Jeff Bilmes","Mixed Robust/Average Submodular Partitioning: Fast Algorithms,
  Guarantees, and Applications to Parallel Machine Learning and Multi-Label
  Image Segmentation",,,,,cs.DS cs.DM cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study two mixed robust/average-case submodular partitioning problems that
we collectively call Submodular Partitioning. These problems generalize both
purely robust instances of the problem (namely max-min submodular fair
allocation (SFA) and min-max submodular load balancing (SLB) and also
generalize average-case instances (that is the submodular welfare problem (SWP)
and submodular multiway partition (SMP). While the robust versions have been
studied in the theory community, existing work has focused on tight
approximation guarantees, and the resultant algorithms are not, in general,
scalable to very large real-world applications. This is in contrast to the
average case, where most of the algorithms are scalable. In the present paper,
we bridge this gap, by proposing several new algorithms (including those based
on greedy, majorization-minimization, minorization-maximization, and relaxation
algorithms) that not only scale to large sizes but that also achieve
theoretical approximation guarantees close to the state-of-the-art, and in some
cases achieve new tight bounds. We also provide new scalable algorithms that
apply to additive combinations of the robust and average-case extreme
objectives. We show that these problems have many applications in machine
learning (ML). This includes: 1) data partitioning and load balancing for
distributed machine algorithms on parallel machines; 2) data clustering; and 3)
multi-label image segmentation with (only) Boolean submodular functions via
pixel partitioning. We empirically demonstrate the efficacy of our algorithms
on real-world problems involving data partitioning for distributed optimization
of standard machine learning objectives (including both convex and deep neural
network objectives), and also on purely unsupervised (i.e., no supervised or
semi-supervised learning, and no interactive segmentation) image segmentation.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2015 20:07:32 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Aug 2016 04:00:41 GMT'}]",2016-08-17,"[['Wei', 'Kai', ''], ['Iyer', 'Rishabh', ''], ['Wang', 'Shengjie', ''], ['Bai', 'Wenruo', ''], ['Bilmes', 'Jeff', '']]","['Submodular optimization', 'submodular partitioning', 'data partitioning', 'parallelcomputing', 'greedy algorithm', 'multi-label image segmentation', 'data science']"
14265,1407.2330,Andrew Connor,"Russel Pears, Jacqui Finlay and Andy M. Connor","Synthetic Minority Over-sampling TEchnique(SMOTE) for Predicting
  Software Build Outcomes",,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this research we use a data stream approach to mining data and construct
Decision Tree models that predict software build outcomes in terms of software
metrics that are derived from source code used in the software construction
process. The rationale for using the data stream approach was to track the
evolution of the prediction model over time as builds are incrementally
constructed from previous versions either to remedy errors or to enhance
functionality. As the volume of data available for mining from the software
repository that we used was limited, we synthesized new data instances through
the application of the SMOTE oversampling algorithm. The results indicate that
a small number of the available metrics have significance for prediction
software build outcomes. It is observed that classification accuracy steadily
improves after approximately 900 instances of builds have been fed to the
classifier. At the end of the data streaming process classification accuracies
of 80% were achieved, though some bias arises due to the distribution of data
across the two classes over time.
","[{'version': 'v1', 'created': 'Wed, 9 Jul 2014 01:10:33 GMT'}]",2014-07-10,"[['Pears', 'Russel', ''], ['Finlay', 'Jacqui', ''], ['Connor', 'Andy M.', '']]","['SMOTE', 'Data Stream Mining', 'Jazz', 'Software Metrics', 'Software Repositories']"
14266,1610.01790,Karim Keramat Jahromi,"Karim Karamat Jahromi, Matteo Zignani, Sabrina Gaito and Gian Paolo
  Rossi",Predicting encounter and colocation events in metropolitan areas,,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite an extensive literature has been devoted to mine and model mobility
features, forecasting where, when and whom people will encounter/colocate still
deserve further research efforts. Forecasting people's encounter and colocation
features is the key point for the success of many applications ranging from
epidemiology to the design of new networking paradigms and services such as
delay tolerant and opportunistic networks. While many algorithms which rely on
both mobility and social information have been proposed, we propose a novel
encounter and colocation predictive model which predicts user's encounter and
colocation events and their features by exploiting the spatio-temporal
regularity in the history of these events. We adopt weighted features Bayesian
predictor and evaluate its accuracy on two large scales WiFi and cellular
datasets. Results show that our approach could improve prediction accuracy
w.r.t standard naive Bayesian and some of the state-of-the-art predictors.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2016 09:39:06 GMT'}]",2016-10-07,"[['Jahromi', 'Karim Karamat', ''], ['Zignani', 'Matteo', ''], ['Gaito', 'Sabrina', ''], ['Rossi', 'Gian Paolo', '']]","['human mobility', 'encounter and colocation prediction', 'weighted featuresBayesian predictor']"
14267,1701.02030,Timotheos Aslanidis,Timotheos Aslanidis and Stavros Birmpilis,"An open shop approach in approximating optimal data transmission
  duration in WDM networks","9 pages, 5 figures, Second International Conference on Computer
  Science, Information Technology and Applications (CSITA 2016)",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the past decade Optical WDM Networks (Wavelength Division Multiplexing)
are being used quite often and especially as far as broadband applications are
concerned. Message packets transmitted through such networks can be interrupted
using time slots in order to maximize network usage and minimize the time
required for all messages to reach their destination. However, preempting a
packet will result in time cost. The problem of scheduling message packets
through such a network is referred to as PBS and is known to be NP-Hard. In
this paper we have reduced PBS to Open Shop Scheduling and designed variations
of polynomially solvable instances of Open Shop to approximate PBS. We have
combined these variations and called the induced algorithm HSA (Hybridic
Scheduling Algorithm). We ran experiments to establish the efficiency of HSA
and found that in all datasets used it produces schedules very close to the
optimal. To further establish HSAs efficiency we ran tests to compare it to
SGA, another algorithm which when tested in the past has yielded excellent
results.
","[{'version': 'v1', 'created': 'Sun, 8 Jan 2017 22:35:38 GMT'}]",2017-01-10,"[['Aslanidis', 'Timotheos', ''], ['Birmpilis', 'Stavros', '']]","['WDM  networks', 'packet scheduling', 'preemption', 'approximation']"
14268,1409.2710,Gopinath Chennupati,Gopinath Chennupati,eAnt-Miner : An Ensemble Ant-Miner to Improve the ACO Classification,"13 pages, 2 figures, 6 tables",,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ant Colony Optimization (ACO) has been applied in supervised learning in
order to induce classification rules as well as decision trees, named
Ant-Miners. Although these are competitive classifiers, the stability of these
classifiers is an important concern that owes to their stochastic nature. In
this paper, to address this issue, an acclaimed machine learning technique
named, ensemble of classifiers is applied, where an ACO classifier is used as a
base classifier to prepare the ensemble. The main trade-off is, the predictions
in the new approach are determined by discovering a group of models as opposed
to the single model classification. In essence, we prepare multiple models from
the randomly replaced samples of training data from which, a unique model is
prepared by aggregating the models to test the unseen data points. The main
objective of this new approach is to increase the stability of the Ant-Miner
results there by improving the performance of ACO classification. We found that
the ensemble Ant-Miners significantly improved the stability by reducing the
classification error on unseen data.
","[{'version': 'v1', 'created': 'Tue, 9 Sep 2014 12:24:22 GMT'}]",2014-09-10,"[['Chennupati', 'Gopinath', '']]","['Ant Colony Optimization', 'Ant Miner', 'Machine Learning', 'Ensembles', 'Stability', 'Classification Error']"
14269,1206.1147,Jia Zeng,"Jia Zeng, Zhi-Qiang Liu and Xiao-Qin Cao",Memory-Efficient Topic Modeling,"20 pages, 7 figures",,,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As one of the simplest probabilistic topic modeling techniques, latent
Dirichlet allocation (LDA) has found many important applications in text
mining, computer vision and computational biology. Recent training algorithms
for LDA can be interpreted within a unified message passing framework. However,
message passing requires storing previous messages with a large amount of
memory space, increasing linearly with the number of documents or the number of
topics. Therefore, the high memory usage is often a major problem for topic
modeling of massive corpora containing a large number of topics. To reduce the
space complexity, we propose a novel algorithm without storing previous
messages for training LDA: tiny belief propagation (TBP). The basic idea of TBP
relates the message passing algorithms with the non-negative matrix
factorization (NMF) algorithms, which absorb the message updating into the
message passing process, and thus avoid storing previous messages. Experimental
results on four large data sets confirm that TBP performs comparably well or
even better than current state-of-the-art training algorithms for LDA but with
a much less memory consumption. TBP can do topic modeling when massive corpora
cannot fit in the computer memory, for example, extracting thematic topics from
7 GB PUBMED corpora on a common desktop computer with 2GB memory.
","[{'version': 'v1', 'created': 'Wed, 6 Jun 2012 08:34:43 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Jun 2012 14:07:26 GMT'}]",2012-06-11,"[['Zeng', 'Jia', ''], ['Liu', 'Zhi-Qiang', ''], ['Cao', 'Xiao-Qin', '']]","['Topic models', 'latent Dirichlet allocation', 'tiny belief propagation', 'nonnegative matrix factorization', 'memory usage']"
14270,0907.4068,Masud Hasan,"Syed Ishtiaque Ahmed, Masud Hasan, and Md. Ariful Islam",Cutting a Convex Polyhedron Out of a Sphere,10 pages,,,,cs.CG cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a convex polyhedron $P$ of $n$ vertices inside a sphere $Q$, we give an
$O(n^3)$-time algorithm that cuts $P$ out of $Q$ by using guillotine cuts and
has cutting cost $O((\log n)^2)$ times the optimal.
","[{'version': 'v1', 'created': 'Thu, 23 Jul 2009 14:11:59 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Mar 2010 17:26:51 GMT'}]",2010-03-10,"[['Ahmed', 'Syed Ishtiaque', ''], ['Hasan', 'Masud', ''], ['Islam', 'Md. Ariful', '']]","['Approximation algorithm', 'guillotine cut', 'polyhedra cutting']"
14271,1312.2048,Brian Hanley,Brian P. Hanley,The False Premises and Promises of Bitcoin,"28 pages, 6 figures. JEL: E21, E22, E42, E51, G21, G29, G28 Section
  2.6 has been broken out into a separate paper, and that unwieldy section is
  replaced by a short bit referencing that new paper titled, ""A zero-sum
  monetary system, interest rates, and implications.""",,,,cs.CE q-fin.GN,http://creativecommons.org/licenses/by-sa/4.0/,"  Designed to compete with fiat currencies, bitcoin proposes it is a
crypto-currency alternative. Bitcoin makes a number of false claims, including:
solving the double-spending problem is a good thing; bitcoin can be a reserve
currency for banking; hoarding equals saving, and that we should believe
bitcoin can expand by deflation to become a global transactional currency
supply. Bitcoin's developers combine technical implementation proficiency with
ignorance of currency and banking fundamentals. This has resulted in a failed
attempt to change finance. A set of recommendations to change finance are
provided in the Afterword: Investment/venture banking for the masses; Venture
banking to bring back what investment banks once were; Open-outcry exchange for
all CDS contracts; Attempting to develop CDS type contracts on investments in
startup and existing enterprises; and Improving the connection between startup
tech/ideas, business organization and investment.
","[{'version': 'v1', 'created': 'Sat, 7 Dec 2013 01:41:50 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Dec 2013 18:09:35 GMT'}, {'version': 'v3', 'created': 'Mon, 23 Dec 2013 18:55:19 GMT'}, {'version': 'v4', 'created': 'Tue, 31 Dec 2013 01:10:46 GMT'}, {'version': 'v5', 'created': 'Fri, 7 Feb 2014 20:49:25 GMT'}, {'version': 'v6', 'created': 'Tue, 25 Feb 2014 01:46:41 GMT'}, {'version': 'v7', 'created': 'Fri, 26 Jun 2015 22:31:15 GMT'}, {'version': 'v8', 'created': 'Wed, 4 Jul 2018 20:15:21 GMT'}]",2018-07-06,"[['Hanley', 'Brian P.', '']]","['Bitcoin', 'crypto-currency', 'cyber-currency', 'private currencies', 'alternative currencies']"
14272,1712.05191,Sachin Pawar,"Sachin Pawar, Girish K. Palshikar, Pushpak Bhattacharyya",Relation Extraction : A Survey,,,,,cs.CL cs.AI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the advent of the Internet, large amount of digital text is generated
everyday in the form of news articles, research publications, blogs, question
answering forums and social media. It is important to develop techniques for
extracting information automatically from these documents, as lot of important
information is hidden within them. This extracted information can be used to
improve access and management of knowledge hidden in large text corpora.
Several applications such as Question Answering, Information Retrieval would
benefit from this information. Entities like persons and organizations, form
the most basic unit of the information. Occurrences of entities in a sentence
are often linked through well-defined relations; e.g., occurrences of person
and organization in a sentence may be linked through relations such as employed
at. The task of Relation Extraction (RE) is to identify such relations
automatically. In this paper, we survey several important supervised,
semi-supervised and unsupervised RE techniques. We also cover the paradigms of
Open Information Extraction (OIE) and Distant Supervision. Finally, we describe
some of the recent trends in the RE techniques and possible future research
directions. This survey would be useful for three kinds of readers - i)
Newcomers in the field who want to quickly learn about RE; ii) Researchers who
want to know how the various RE techniques evolved over time and what are
possible future research directions and iii) Practitioners who just need to
know which RE technique works best in various settings.
","[{'version': 'v1', 'created': 'Thu, 14 Dec 2017 12:04:10 GMT'}]",2017-12-15,"[['Pawar', 'Sachin', ''], ['Palshikar', 'Girish K.', ''], ['Bhattacharyya', 'Pushpak', '']]","['Relation Extraction', 'Supervised Learning', 'Kernel Methods', 'Unsupervised Learning', 'Semi-supervised Learning', 'Open InformationExtraction', 'Distant Supervision']"
14273,1707.08358,Jacopo Pantaleoni,"Jacopo Pantaleoni, Eric Heitz",Notes on optimal approximations for importance sampling,"4 pages, 1 figure",,,,cs.GR cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this manuscript, we derive optimal conditions for building function
approximations that minimize variance when used as importance sampling
estimators for Monte Carlo integration problems. Particularly, we study the
problem of finding the optimal projection $g$ of an integrand $f$ onto certain
classes of piecewise constant functions, in order to minimize the variance of
the unbiased importance sampling estimator $E_g[f/g]$, as well as the related
problem of finding optimal mixture weights to approximate and importance sample
a target mixture distribution $f = \sum_i \alpha_i f_i$ with components $f_i$
in a family $\mathcal{F}$, through a corresponding mixture of importance
sampling densities $g_i$ that are only approximately proportional to $f_i$. We
further show that in both cases the optimal projection is different from the
commonly used $\ell_1$ projection, and provide an intuitive explanation for the
difference.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 10:26:08 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Jul 2017 10:57:27 GMT'}]",2017-07-31,"[['Pantaleoni', 'Jacopo', ''], ['Heitz', 'Eric', '']]","['Monte Carlo', 'importance sampling', 'variancereduction', 'light transport simulation']"
14274,1212.5663,Morgan Barbier,"Morgan Barbier (GREYC), Cl\'ement Pernet (INRIA Grenoble Rh\^one-Alpes
  / LIG Laboratoire d'Informatique de Grenoble), Guillaume Quintin (LIX)",On the decoding of quasi-BCH codes,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we investigate the structure of quasi-BCH codes. In the first
part of this paper we show that quasi-BCH codes can be derived from
Reed-Solomon codes over square matrices extending the known relation about
classical BCH and Reed-Solomon codes. This allows us to adapt the
Welch-Berlekamp algorithm to quasi-BCH codes. In the second part of this paper
we show that quasi-BCH codes can be seen as subcodes of interleaved
Reed-Solomon codes over finite fields. This provides another approach for
decoding quasi-BCH codes.
","[{'version': 'v1', 'created': 'Sat, 22 Dec 2012 07:38:34 GMT'}]",2013-01-01,"[['Barbier', 'Morgan', '', 'GREYC'], ['Pernet', 'Clément', '', ""INRIA Grenoble Rhône-Alpes\n  / LIG Laboratoire d'Informatique de Grenoble""], ['Quintin', 'Guillaume', '', 'LIX']]","['Quasi-cyclic code', 'quasi-BCH code', 'BCH code', 'Reed-Solomon', 'interleaved code']"
14275,1011.0279,Majid Taghiloo,"Majid Taghiloo, Mohammad Ali Agheli, and Mohammad Reza Rezaeinezhad",Mobile Based Secure Digital Wallet for Peer to Peer Payment System,,"International Journal of UbiComp (IJU), Vol.1, No.4, October 2010",,,cs.CE,http://creativecommons.org/licenses/by/3.0/,"  E-commerce in today's conditions has the highest dependence on network
infrastructure of banking. However, when the possibility of communicating with
the Banking network is not provided, business activities will suffer. This
paper proposes a new approach of digital wallet based on mobile devices without
the need to exchange physical money or communicate with banking network. A
digital wallet is a software component that allows a user to make an electronic
payment in cash (such as a credit card or a digital coin), and hides the
low-level details of executing the payment protocol that is used to make the
payment. The main features of proposed architecture are secure awareness, fault
tolerance, and infrastructure-less protocol.
","[{'version': 'v1', 'created': 'Mon, 1 Nov 2010 09:55:23 GMT'}]",2010-11-02,"[['Taghiloo', 'Majid', ''], ['Agheli', 'Mohammad Ali', ''], ['Rezaeinezhad', 'Mohammad Reza', '']]","['Wireless Network', 'Mobile Network', 'Digital Wallet', 'E-Payment System', 'Peer to Peer Communication & Security']"
14276,1607.02355,Dr. Zubair Asghar,"Aurangzeb khan, Khairullah khan, Shakeel Ahmad, Fazal Masood Kundi,
  Irum Tareen, Muhammad Zubair Asghar",Lexical Based Semantic Orientation of Online Customer Reviews and Blogs,,"Journal of American Science 2014;10(8)
  http://www.jofamericanscience.org",,,cs.CL cs.IR,http://creativecommons.org/licenses/by/4.0/,"  Rapid increase in internet users along with growing power of online review
sites and social media has given birth to sentiment analysis or opinion mining,
which aims at determining what other people think and comment. Sentiments or
Opinions contain public generated content about products, services, policies
and politics. People are usually interested to seek positive and negative
opinions containing likes and dislikes, shared by users for features of
particular product or service. This paper proposed sentence-level lexical based
domain independent sentiment classification method for different types of data
such as reviews and blogs. The proposed method is based on general lexicons
i.e. WordNet, SentiWordNet and user defined lexical dictionaries for semantic
orientation. The relations and glosses of these dictionaries provide solution
to the domain portability problem. The method performs better than word and
text level corpus based machine learning methods for semantic orientation. The
results show the proposed method performs better as it shows precision of 87%
and83% at document and sentence levels respectively for online comments.
","[{'version': 'v1', 'created': 'Fri, 8 Jul 2016 13:20:35 GMT'}]",2016-07-12,"[['khan', 'Aurangzeb', ''], ['khan', 'Khairullah', ''], ['Ahmad', 'Shakeel', ''], ['Kundi', 'Fazal Masood', ''], ['Tareen', 'Irum', ''], ['Asghar', 'Muhammad Zubair', '']]","['sentiment analysis', 'opinion mining', 'classification', 'semantic orientation', 'Introduction']"
14277,1110.5722,Fidelia Ibekwe-Sanjuan,"Fidelia Ibekwe-Sanjuan (ELICO), Fernandez Silvia (LIA), Sanjuan Eric
  (LIA), Charton Eric (LIA)",Annotation of Scientific Summaries for Information Retrieval,"ECIR'08 Workshop on: Exploiting Semantic Annotations for Information
  Retrieval, Glasgow : United Kingdom (2008)",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a methodology combining surface NLP and Machine Learning
techniques for ranking asbtracts and generating summaries based on annotated
corpora. The corpora were annotated with meta-semantic tags indicating the
category of information a sentence is bearing (objective, findings, newthing,
hypothesis, conclusion, future work, related work). The annotated corpus is fed
into an automatic summarizer for query-oriented abstract ranking and multi-
abstract summarization. To adapt the summarizer to these two tasks, two novel
weighting functions were devised in order to take into account the distribution
of the tags in the corpus. Results, although still preliminary, are encouraging
us to pursue this line of work and find better ways of building IR systems that
can take into account semantic annotations in a corpus.
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2011 07:26:22 GMT'}]",2011-10-27,"[['Ibekwe-Sanjuan', 'Fidelia', '', 'ELICO'], ['Silvia', 'Fernandez', '', 'LIA'], ['Eric', 'Sanjuan', '', 'LIA'], ['Eric', 'Charton', '', 'LIA']]","['Corpus annotation', 'discourse structure analysis', 'automatic summarization', 'document ranking', 'term weighting']"
14278,1106.5303,Florin Pop Mr.,"Florin Pop, Valentin Cristea","Intelligent strategies for DAG scheduling optimization in Grid
  environments","Printech, ISBN 978-973-718-743-7","Proceedings of the 16th International Conference on Control
  Systems and Computer Science (CSCS16'07), pp. 98-103, May 22-25, Bucharest,
  Romania, 2007",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents a solution to the dynamic DAG scheduling problem in Grid
environments. It presents a distributed, scalable, efficient and fault-tolerant
algorithm for optimizing tasks assignment. The scheduler algorithm for tasks
with dependencies uses a heuristic model to optimize the total cost of tasks
execution. Also, a method based on genetic algorithms is proposed to optimize
the procedure of resources assignment. The experiments used the MonALISA
monitoring environment and its extensions. The results demonstrate very good
behavior in comparison with other scheduling approaches for this kind of DAG
scheduling algorithms.
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2011 06:03:42 GMT'}]",2011-06-28,"[['Pop', 'Florin', ''], ['Cristea', 'Valentin', '']]","['Grid Computing', 'Task DAG Scheduling', 'Optimization', 'Genetics algorithms', 'Heuristic model', 'Monitoring system']"
14279,1708.01650,Daniela Micucci,"Fabrizio Pastore, Leonardo Mariani, Daniela Micucci",BDCI: Behavioral Driven Conflict Identification,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Source Code Management (SCM) systems support software evolution by providing
features, such as version control, branching, and conflict detection. Despite
the presence of these features, support to parallel software development is
often limited. SCM systems can only address a subset of the conflicts that
might be introduced by developers when concurrently working on multiple
parallel branches. In fact, SCM systems can detect textual conflicts, which are
generated by the concurrent modification of the same program locations, but
they are unable to detect higher-order conflicts, which are generated by the
concurrent modification of different program locations that generate program
misbehaviors once merged. Higher-order conflicts are painful to detect and
expensive to fix because they might be originated by the interference of
apparently unrelated changes. In this paper we present Behavioral Driven
Conflict Identification (BDCI), a novel approach to conflict detection. BDCI
moves the analysis of conflicts from the source code level to the level of
program behavior by generating and comparing behavioral models. The analysis
based on behavioral models can reveal interfering changes as soon as they are
introduced in the SCM system, even if they do not introduce any textual
conflict. To evaluate the effectiveness and the cost of the proposed approach,
we developed BDCIf , a specific instance of BDCI dedicated to the detection of
higher-order conflicts related to the functional behavior of a program. The
evidence collected by analyzing multiple versions of Git and Redis suggests
that BDCIf can effectively detect higher-order conflicts and report how changes
might interfere.
","[{'version': 'v1', 'created': 'Fri, 4 Aug 2017 19:36:16 GMT'}]",2017-08-08,"[['Pastore', 'Fabrizio', ''], ['Mariani', 'Leonardo', ''], ['Micucci', 'Daniela', '']]","['Software evolution', 'conflict detection', 'specification mining', 'testing']"
14280,1704.03527,Nhien-An Le-Khac,"V-H Cao, K-X Chu, Nhien-An Le-Khac, M-T Kechadi, Debra F. Laefer, Linh
  Truong-Hong",Toward a new approach for massive LiDAR data processing,,,,,cs.DC cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Laser scanning (also known as Light Detection And Ranging) has been widely
applied in various application. As part of that, aerial laser scanning (ALS)
has been used to collect topographic data points for a large area, which
triggers to million points to be acquired. Furthermore, today, with integrating
full wareform (FWF) technology during ALS data acquisition, all return
information of laser pulse is stored. Thus, ALS data are to be massive and
complexity since the FWF of each laser pulse can be stored up to 256 samples
and density of ALS data is also increasing significantly. Processing LiDAR data
demands heavy operations and the traditional approaches require significant
hardware and running time. On the other hand, researchers have recently
proposed parallel approaches for analysing LiDAR data. These approaches are
normally based on parallel architecture of target systems such as multi-core
processors, GPU, etc. However, there is still missing efficient
approaches/tools supporting the analysis of LiDAR data due to the lack of a
deep study on both library tools and algorithms used in processing this data.
In this paper, we present a comparative study of software libraries and
algorithms to optimise the processing of LiDAR data. We also propose new method
to improve this process with experiments on large LiDAR data. Finally, we
discuss on a parallel solution of our approach where we integrate parallel
computing in processing LiDAR data.
","[{'version': 'v1', 'created': 'Tue, 11 Apr 2017 20:33:28 GMT'}]",2017-04-13,"[['Cao', 'V-H', ''], ['Chu', 'K-X', ''], ['Le-Khac', 'Nhien-An', ''], ['Kechadi', 'M-T', ''], ['Laefer', 'Debra F.', ''], ['Truong-Hong', 'Linh', '']]","['LiDar data', 'parallel processing', 'kd-tree', 'TreeP']"
14281,1501.03616,Igal Sason,Igal Sason,"On the Renyi Divergence, Joint Range of Relative Entropies, and a
  Channel Coding Theorem","Submitted to IEEE Trans. on Information Theory in March 2015; revised
  in October 2015",,,,cs.IT math.IT math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper starts by considering the minimization of the Renyi divergence
subject to a constraint on the total variation distance. Based on the solution
of this optimization problem, the exact locus of the points $\bigl( D(Q\|P_1),
D(Q\|P_2) \bigr)$ is determined when $P_1, P_2, Q$ are arbitrary probability
measures which are mutually absolutely continuous, and the total variation
distance between $P_1$ and $P_2$ is not below a given value. It is further
shown that all the points of this convex region are attained by probability
measures which are defined on a binary alphabet. This characterization yields a
geometric interpretation of the minimal Chernoff information subject to a
constraint on the total variation distance. This paper also derives an
exponential upper bound on the performance of binary linear block codes (or
code ensembles) under maximum-likelihood decoding. Its derivation relies on the
Gallager bounding technique, and it reproduces the Shulman-Feder bound as a
special case. The bound is expressed in terms of the Renyi divergence from the
normalized distance spectrum of the code (or the average distance spectrum of
the ensemble) to the binomially distributed distance spectrum of the
capacity-achieving ensemble of random block codes. This exponential bound
provides a quantitative measure of the degradation in performance of binary
linear block codes (or code ensembles) as a function of the deviation of their
distance spectra from the binomial distribution. An efficient use of this bound
is considered.
","[{'version': 'v1', 'created': 'Thu, 15 Jan 2015 10:03:57 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Feb 2015 07:22:27 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Mar 2015 00:15:01 GMT'}, {'version': 'v4', 'created': 'Mon, 26 Oct 2015 13:52:57 GMT'}]",2015-10-27,"[['Sason', 'Igal', '']]","['Chernoff information', 'distance spectrum', 'error exponent', 'maximum-likelihood']"
14282,1301.1013,Loet Leydesdorff,"Loet Leydesdorff, Ismael Rafols, and Chaomei Chen","Interactive Overlays of Journals and the Measurement of
  Interdisciplinarity on the basis of Aggregated Journal-Journal Citations","Journal of the American Society for Information Science and
  Technology (in press)",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using ""Analyze Results"" at the Web of Science, one can directly generate
overlays onto global journal maps of science. The maps are based on the 10,000+
journals contained in the Journal Citation Reports (JCR) of the Science and
Social Science Citation Indices (2011). The disciplinary diversity of the
retrieval is measured in terms of Rao-Stirling's ""quadratic entropy."" Since
this indicator of interdisciplinarity is normalized between zero and one, the
interdisciplinarity can be compared among document sets and across years, cited
or citing. The colors used for the overlays are based on Blondel et al.'s
(2008) community-finding algorithms operating on the relations journals
included in JCRs. The results can be exported from VOSViewer with different
options such as proportional labels, heat maps, or cluster density maps. The
maps can also be web-started and/or animated (e.g., using PowerPoint). The
""citing"" dimension of the aggregated journal-journal citation matrix was found
to provide a more comprehensive description than the matrix based on the cited
archive. The relations between local and global maps and their different
functions in studying the sciences in terms of journal litteratures are further
discussed: local and global maps are based on different assumptions and can be
expected to serve different purposes for the explanation.
","[{'version': 'v1', 'created': 'Sun, 6 Jan 2013 15:34:00 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Jan 2013 20:11:49 GMT'}]",2013-01-29,"[['Leydesdorff', 'Loet', ''], ['Rafols', 'Ismael', ''], ['Chen', 'Chaomei', '']]","['interdisciplinary research', 'map', 'journal', 'overlay', 'interactive', 'citation']"
14283,1304.6945,Mark Levene,Mark Levene and Trevor Fenner and Judit Bar-Ilan,A bibliometric index based on the complete list of cited publications,12 pages,,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new index, the $j$-index, which is defined for an author as the
sum of the square roots of the numbers of citations to each of the author's
publications. The idea behind the $j$-index it to remedy a drawback of the
$h$-index $-$ that the $h$-index does not take into account the full citation
record of a researcher. The square root function is motivated by our desire to
avoid the possible bias that may occur with a simple sum when an author has
several very highly cited papers. We compare the $j$-index to the $h$-index,
the $g$-index and the total citation count for three subject areas using
several association measures.
  Our results indicate that that the association between the $j$-index and the
other indices varies according to the subject area. One explanation of this
variation may be due to the proportion of citations to publications of the
researcher that are in the $h$-core. The $j$-index is {\em not} an $h$-index
variant, and as such is intended to complement rather than necessarily replace
the $h$-index and other bibliometric indicators, thus providing a more complete
picture of a researcher's achievements.
","[{'version': 'v1', 'created': 'Thu, 25 Apr 2013 15:54:24 GMT'}]",2013-04-26,"[['Levene', 'Mark', ''], ['Fenner', 'Trevor', ''], ['Bar-Ilan', 'Judit', '']]","['h-index', 'g-index', 'j-index']"
14284,1205.2292,George Papastefanatos Dr.,"Yannis Stavrakas, George Papastefanatos, Theodore Dalamagas, Vassilis
  Christophides","Diachronic Linked Data: Towards Long-Term Preservation of Structured
  Interrelated Information","Presented at the First International Workshop On Open Data, WOD-2012
  (http://arxiv.org/abs/1204.3726)",,,WOD/2012/NANTES/10,cs.DB cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Linked Data Paradigm is one of the most promising technologies for
publishing, sharing, and connecting data on the Web, and offers a new way for
data integration and interoperability. However, the proliferation of
distributed, inter-connected sources of information and services on the Web
poses significant new challenges for managing consistently a huge number of
large datasets and their interdependencies. In this paper we focus on the key
problem of preserving evolving structured interlinked data. We argue that a
number of issues that hinder applications and users are related to the temporal
aspect that is intrinsic in linked data. We present a number of real use cases
to motivate our approach, we discuss the problems that occur, and propose a
direction for a solution.
","[{'version': 'v1', 'created': 'Thu, 10 May 2012 15:28:30 GMT'}]",2012-05-11,"[['Stavrakas', 'Yannis', ''], ['Papastefanatos', 'George', ''], ['Dalamagas', 'Theodore', ''], ['Christophides', 'Vassilis', '']]","['Linked data lifecycle', 'Data preservation', 'Data provenance', 'Data evolution']"
14285,1002.1144,Vishal Goyal,"M. Ramaswami, R. Bhaskaran",A CHAID Based Performance Prediction Model in Educational Data Mining,"International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 1, January 2010,
  http://ijcsi.org/articles/A-CHAID-Based-Performance-Prediction-Model-in-Educational-Data-Mining.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 1, January 2010,
  http://ijcsi.org/articles/A-CHAID-Based-Performance-Prediction-Model-in-Educational-Data-Mining.php",,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The performance in higher secondary school education in India is a turning
point in the academic lives of all students. As this academic performance is
influenced by many factors, it is essential to develop predictive data mining
model for students' performance so as to identify the slow learners and study
the influence of the dominant factors on their academic performance. In the
present investigation, a survey cum experimental methodology was adopted to
generate a database and it was constructed from a primary and a secondary
source. While the primary data was collected from the regular students, the
secondary data was gathered from the school and office of the Chief Educational
Officer (CEO). A total of 1000 datasets of the year 2006 from five different
schools in three different districts of Tamilnadu were collected. The raw data
was preprocessed in terms of filling up missing values, transforming values in
one form into another and relevant attribute/ variable selection. As a result,
we had 772 student records, which were used for CHAID prediction model
construction. A set of prediction rules were extracted from CHIAD prediction
model and the efficiency of the generated CHIAD prediction model was found. The
accuracy of the present model was compared with other model and it has been
found to be satisfactory.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 08:27:17 GMT'}]",2010-02-08,"[['Ramaswami', 'M.', ''], ['Bhaskaran', 'R.', '']]","['student performance', 'higher secondary education', 'feature selection', 'potential features', 'data mining', 'CHAID prediction model', 'predictive accuracy']"
14286,1011.0755,Nikolai Stoianov,"Nikolai Todorov Stoianov, Veselin Tsenov Tselkov",E-Net Models of a Software System for Web Pages Security SECURITY,"6 pages, 3 figures, Mathematics and Education in Mathematics, 2003
  Proceedings of the Thirty Second Spring Conference of the Union of Bulgarian
  Mathematicians,pp.285-290, ISBN 954-8880-14-8",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents solutions for cryptography protection for web pages. The
solutions comprise the authors' experience in development and implementation of
systems for information security in the Automated Information Systems of
Bulgarian Armed Forces. The architecture, the models and the methods are being
explained.
","[{'version': 'v1', 'created': 'Tue, 2 Nov 2010 21:21:24 GMT'}]",2010-11-04,"[['Stoianov', 'Nikolai Todorov', ''], ['Tselkov', 'Veselin Tsenov', '']]","['computer security', 'information security', 'web pages', 'web security.  1']"
14287,1209.4927,Uli Fahrenberg,Uli Fahrenberg and Axel Legay,"History-Preserving Bisimilarity for Higher-Dimensional Automata via Open
  Maps","Minor updates in accordance with reviewer comments. Submitted to MFPS
  2013",,,,cs.LO math.CT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that history-preserving bisimilarity for higher-dimensional automata
has a simple characterization directly in terms of higher-dimensional
transitions. This implies that it is decidable for finite higher-dimensional
automata. To arrive at our characterization, we apply the open-maps framework
of Joyal, Nielsen and Winskel in the category of unfoldings of precubical sets.
","[{'version': 'v1', 'created': 'Fri, 21 Sep 2012 22:10:33 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Apr 2013 21:29:19 GMT'}]",2013-04-17,"[['Fahrenberg', 'Uli', ''], ['Legay', 'Axel', '']]","['higher-dimensional automaton', 'history-preserving bisimilarity', 'homotopy', 'unfolding', 'concurrency']"
14288,0804.1928,Pietro Michiardi Dr.,"Chi-Anh La, Pietro Michiardi",Characterizing User Mobility in Second Life,,,,rr08212,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we present a measurement study of user mobility in Second Life.
We first discuss different techniques to collect user traces and then focus on
results obtained using a crawler that we built. Tempted by the question whether
our methodology could provide similar results to those obtained in real-world
experiments, we study the statistical distribution of user contacts and show
that from a qualitative point of view user mobility in Second Life presents
similar traits to those of real humans. We further push our analysis to line of
sight networks that emerge from user interaction and show that they are highly
clustered. Lastly, we focus on the spatial properties of user movements and
observe that users in Second Life revolve around several point of interests
traveling in general short distances. Besides our findings, the traces
collected in this work can be very useful for trace-driven simulations of
communication schemes in delay tolerant networks and their performance
evaluation.
","[{'version': 'v1', 'created': 'Fri, 11 Apr 2008 16:32:44 GMT'}, {'version': 'v2', 'created': 'Sat, 12 Apr 2008 00:12:03 GMT'}]",2009-09-29,"[['La', 'Chi-Anh', ''], ['Michiardi', 'Pietro', '']]","['Contact times', 'Spatial Distribution', 'Line of sight networks']"
14289,1401.8074,Kevin Leyton-Brown,"Erik Zawadzki, Asher Lipson, Kevin Leyton-Brown",Empirically Evaluating Multiagent Learning Algorithms,,,,,cs.GT cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There exist many algorithms for learning how to play repeated bimatrix games.
Most of these algorithms are justified in terms of some sort of theoretical
guarantee. On the other hand, little is known about the empirical performance
of these algorithms. Most such claims in the literature are based on small
experiments, which has hampered understanding as well as the development of new
multiagent learning (MAL) algorithms. We have developed a new suite of tools
for running multiagent experiments: the MultiAgent Learning Testbed (MALT).
These tools are designed to facilitate larger and more comprehensive
experiments by removing the need to build one-off experimental code. MALT also
provides baseline implementations of many MAL algorithms, hopefully eliminating
or reducing differences between algorithm implementations and increasing the
reproducibility of results. Using this test suite, we ran an experiment
unprecedented in size. We analyzed the results according to a variety of
performance metrics including reward, maxmin distance, regret, and several
notions of equilibrium convergence. We confirmed several pieces of conventional
wisdom, but also discovered some surprising results. For example, we found that
single-agent $Q$-learning outperformed many more complicated and more modern
MAL algorithms.
","[{'version': 'v1', 'created': 'Fri, 31 Jan 2014 07:02:58 GMT'}]",2014-02-03,"[['Zawadzki', 'Erik', ''], ['Lipson', 'Asher', ''], ['Leyton-Brown', 'Kevin', '']]","['Game theory', 'multiagent systems', 'reinforcement learning', 'empirical algorithmics']"
14290,1603.04891,"Robert Kl\""ofkorn","Martin Alk\""amper and Robert Kl\""ofkorn",Distributed Newest Vertex Bisection,"18 pages, 13 pictures, 4 algorithms",,,,cs.DC math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed adaptive conforming refinement requires multiple iterations of
the serial refinement algorithm and global communication as the refinement can
be propagated over several processor boundaries. We show bounds on the maximum
number of iterations. The algorithm is implemented within the software package
DUNE-ALUGrid.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2016 21:36:44 GMT'}]",2016-03-17,"[['Alkämper', 'Martin', ''], ['Klöfkorn', 'Robert', '']]","['Adaptive method', 'mesh refinement', 'parallel', 'Dune']"
14291,1401.1318,Chandra Sekhar Mr,Vorugunti Chandra Sekhar and Mrudula Sarvabhatla,A Robust Biometric-Based Three-factor Remote User Authentication Scheme,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rapid development of Internet of Things (IoT) technology, which is an
inter connection of networks through an insecure public channel i.e. Internet
demands for authenticating the remote user trying to access the secure network
resources. In 2013, Ankita et al. proposed an improved three factor remote user
authentication scheme. In this poster we will show that Ankita et al scheme is
vulnerable to known session specific temporary information attack, on
successfully performing the attack, the adversary can perform all other major
cryptographic attacks. As a part of our contribution, we will propose an
improved scheme which is resistance to all major cryptographic attacks and
overcomes the defects in Ankita et al. scheme.
","[{'version': 'v1', 'created': 'Tue, 7 Jan 2014 09:29:57 GMT'}]",2014-01-08,"[['Sekhar', 'Vorugunti Chandra', ''], ['Sarvabhatla', 'Mrudula', '']]","['Biometric', 'Authentication', 'Session Key', 'Remote User Authentication']"
14292,1610.03779,Loet Leydesdorff,"Loet Leydesdorff, Lutz Bornmann, and Caroline S. Wagner","Generating Clustered Journal Maps: An Automated System for Hierarchical
  Classification","Accepted for publication in Scientometrics. Full set of journal
  clusters at http://www.leydesdorff.net/jcr15/",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Journal maps and classifications for 11,359 journals listed in the combined
Journal Citation Reports 2015 of the Science and Social Sciences Citation
Indexes are provided at http://www.leydesdorff.net/jcr15. A routine using
VOSviewer for integrating the journal mapping and their hierarchical clustering
is also made available. In this short communication, we provide background on
the journal mapping/clustering and an explanation and instructions about the
routine. We compare 2015 journal maps with those for 2014 and show the
delineations among fields and subfields to be sensitive to fluctuations. Labels
for fields and sub-fields are not provided by the routine, but can be added by
an analyst for pragmatic or intellectual reasons. The routine provides a means
for testing one's assumptions against a baseline without claiming authority,
clusters of related journals can be visualized to understand communities. The
routine is generic and can be used for any 1-mode network.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2016 16:40:16 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Dec 2016 19:50:38 GMT'}, {'version': 'v3', 'created': 'Tue, 10 Jan 2017 07:23:30 GMT'}]",2017-01-11,"[['Leydesdorff', 'Loet', ''], ['Bornmann', 'Lutz', ''], ['Wagner', 'Caroline S.', '']]","['classification', 'visualization', 'journal', 'scientific field', 'citation', 'decomposition']"
14293,0903.2108,Maurice Margenstern,Maurice Margenstern,A new universal cellular automaton on the ternary heptagrid,"35 pages, 33 figures",,,,cs.FL cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we construct a new weakly universal cellular automaton on the
ternary heptagrid. The previous result, obtained by the same author and Y. Song
required six states only. This time, the number of states is four. This is the
best result up to date for cellular automata in the hyperbolic plane.
","[{'version': 'v1', 'created': 'Thu, 12 Mar 2009 15:15:39 GMT'}]",2009-03-13,"[['Margenstern', 'Maurice', '']]","['cellular automata', 'hyperbolic plane', 'tessellations']"
14294,1410.4673,Zhiding Yu,"Weiyang Liu, Zhiding Yu, Lijia Lu, Yandong Wen, Hui Li and Yuexian Zou","KCRC-LCD: Discriminative Kernel Collaborative Representation with
  Locality Constrained Dictionary for Visual Categorization",,,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the image classification problem via kernel collaborative
representation classification with locality constrained dictionary (KCRC-LCD).
Specifically, we propose a kernel collaborative representation classification
(KCRC) approach in which kernel method is used to improve the discrimination
ability of collaborative representation classification (CRC). We then measure
the similarities between the query and atoms in the global dictionary in order
to construct a locality constrained dictionary (LCD) for KCRC. In addition, we
discuss several similarity measure approaches in LCD and further present a
simple yet effective unified similarity measure whose superiority is validated
in experiments. There are several appealing aspects associated with LCD. First,
LCD can be nicely incorporated under the framework of KCRC. The LCD similarity
measure can be kernelized under KCRC, which theoretically links CRC and LCD
under the kernel method. Second, KCRC-LCD becomes more scalable to both the
training set size and the feature dimension. Example shows that KCRC is able to
perfectly classify data with certain distribution, while conventional CRC fails
completely. Comprehensive experiments on many public datasets also show that
KCRC-LCD is a robust discriminative classifier with both excellent performance
and good scalability, being comparable or outperforming many other
state-of-the-art approaches.
","[{'version': 'v1', 'created': 'Fri, 17 Oct 2014 09:40:20 GMT'}]",2014-10-20,"[['Liu', 'Weiyang', ''], ['Yu', 'Zhiding', ''], ['Lu', 'Lijia', ''], ['Wen', 'Yandong', ''], ['Li', 'Hui', ''], ['Zou', 'Yuexian', '']]","['Kernel Collaborative Representation', 'Regularized Least Square Algorithm', 'Nearest Neighbor', 'Locality Constrained Dictionary']"
14295,1208.1921,Jean-Louis Dessalles,Jean-Louis Dessalles,Algorithmic Simplicity and Relevance,"Presented at the Solomonoff 85th Memorial Conference, Monash
  University, Melbourne, December 2011 12 pages",,,,cs.AI cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The human mind is known to be sensitive to complexity. For instance, the
visual system reconstructs hidden parts of objects following a principle of
maximum simplicity. We suggest here that higher cognitive processes, such as
the selection of relevant situations, are sensitive to variations of
complexity. Situations are relevant to human beings when they appear simpler to
describe than to generate. This definition offers a predictive (i.e.
falsifiable) model for the selection of situations worth reporting
(interestingness) and for what individuals consider an appropriate move in
conversation.
","[{'version': 'v1', 'created': 'Thu, 9 Aug 2012 14:32:06 GMT'}]",2012-08-10,"[['Dessalles', 'Jean-Louis', '']]","['Simplicity', 'relevance', 'interestingness', 'unexpectedness']"
14296,1209.4420,Chao Wang,Lan-Ting LI,"An Efficient Color Face Verification Based on 2-Directional
  2-Dimensional Feature Extraction",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel and uniform framework for face verification is presented in this
paper. First of all, a 2-directional 2-dimensional feature extraction method is
adopted to extract client-specific template - 2D discrimant projection matrix.
Then the face skin color information is utilized as an additive feature to
enhance decision making strategy that makes use of not only 2D grey feature but
also 2D skin color feature. A fusion decision of both is applied to experiment
the performance on the XM2VTS database according to Lausanne protocol.
Experimental results show that the framework achieves high verification
accuracy and verification speed.
","[{'version': 'v1', 'created': 'Thu, 20 Sep 2012 04:20:40 GMT'}]",2012-09-21,"[['LI', 'Lan-Ting', '']]","['face verification', 'skin color feature', '2-directional 2-dimensional feature extraction']"
14297,1003.5886,Sandip Rakshit,"Sandip Rakshit, Subhadip Basu","Development of a multi-user handwriting recognition system using
  Tesseract open source OCR engine",Proc. International Conference on C3IT (2009) 240-247,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The objective of the paper is to recognize handwritten samples of lower case
Roman script using Tesseract open source Optical Character Recognition (OCR)
engine under Apache License 2.0. Handwritten data samples containing isolated
and free-flow text were collected from different users. Tesseract is trained
with user-specific data samples of both the categories of document pages to
generate separate user-models representing a unique language-set. Each such
language-set recognizes isolated and free-flow handwritten test samples
collected from the designated user. On a three user model, the system is
trained with 1844, 1535 and 1113 isolated handwritten character samples
collected from three different users and the performance is tested on 1133,
1186 and 1204 character samples, collected form the test sets of the three
users respectively. The user specific character level accuracies were obtained
as 87.92%, 81.53% and 65.71% respectively. The overall character-level accuracy
of the system is observed as 78.39%. The system fails to segment 10.96%
characters and erroneously classifies 10.65% characters on the overall dataset.
","[{'version': 'v1', 'created': 'Tue, 30 Mar 2010 18:22:44 GMT'}]",2010-03-31,"[['Rakshit', 'Sandip', ''], ['Basu', 'Subhadip', '']]","['handwriting recognition', 'isolated roman characters', 'Tesseract', 'OCR engine    1']"
14298,0906.0237,Thomas Roche,Thomas Roche and C\'edric Tavernier,Multi-Linear cryptanalysis in Power Analysis Attacks MLPA,16 pages,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Power analysis attacks against embedded secret key cryptosystems are widely
studied since the seminal paper of Paul Kocher, Joshua Ja, and Benjamin Jun in
1998 where has been introduced the powerful Differential Power Analysis. The
strength of DPA is such that it became necessary to develop sound and efficient
countermeasures. Nowadays embedded cryptographic primitives usually integrate
one or several of these countermeasures (e.g. masking techniques, asynchronous
designs, balanced dynamic dual-rail gates designs, noise adding, power
consumption smoothing, etc. ...). This document presents a simple, yet
interesting, countermeasure to DPA and HO-DPA attacks, called brutal
countermeasure and new power analysis attacks using multi-linear approximations
(MLPA attacks) based on very recent and still unpublished results of Tavernier
et al..
","[{'version': 'v1', 'created': 'Mon, 1 Jun 2009 08:34:50 GMT'}]",2009-06-02,"[['Roche', 'Thomas', ''], ['Tavernier', 'Cédric', '']]","['Power Analysis', 'MLPA', 'multi-linear cryptanalysis', 'Reed-Muller codes']"
14299,1209.6037,Jaswinder  Dilawari Singh,"Jaswinder Singh Dilawari, Ravinder Khanna","Reproduction of Images by Gamut Mapping and Creation of New Test Charts
  in Prepress Process","5 Pages,10 Figures; International Journal of Scientific and
  Engineering Research,Volume 3, Issue 10, October 2012 Edition",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the advent of digital images the problem of keeping picture
visualization uniformity arises because each printing or scanning device has
its own color chart. So, universal color profiles are made by ICC to bring
uniformity in various types of devices. Keeping that color profile in mind
various new color charts are created and calibrated with the help of standard
IT8 test charts available in the market. The main objective to color
reproduction is to produce the identical picture at device output. For that
principles for gamut mapping has been designed
","[{'version': 'v1', 'created': 'Wed, 26 Sep 2012 19:25:56 GMT'}]",2015-03-13,"[['Dilawari', 'Jaswinder Singh', ''], ['Khanna', 'Ravinder', '']]","['Test charts', 'Color Charts', 'Gamut mapping', 'New Test Charts', 'IT8 test charts', 'Gray Scale Image', 'Image Pixels', 'Tristimulus']"
14300,0712.2168,Francoise Sandoz-Guermond,"Marc-Eric Bobiller-Chaumon (GRePS), Michel Dubois (LIP - PC2S),
  Fran\c{c}oise Sandoz-Guermond (LIESP)","Study of conditions of use of E-services accessible to visually disabled
  persons",4 pages visible \`a http://ceur-ws.org/Vol-285,"Dans CEUR Workshop Proceedings - DEGAS'07 : Workshop of Design &
  Evaluation of e-Government Applications and services, Rio de Janeiro :
  Br\'esil (2006)",,,cs.HC,,"  The aim of this paper is to determine the expectations that French-speaking
disabled persons have for electronic administrative sites (utility). At the
same time, it is a matter of identifying the difficulties of use that the
manipulation of these E-services poses concretely for blind people (usability)
and of evaluating the psychosocial impacts on the way of life of these people
with specific needs. We show that the lack of numerical accessibility is likely
to accentuate the social exclusion of which these people are victim by
establishing a numerical glass ceiling.
","[{'version': 'v1', 'created': 'Thu, 13 Dec 2007 15:14:01 GMT'}]",2007-12-14,"[['Bobiller-Chaumon', 'Marc-Eric', '', 'GRePS'], ['Dubois', 'Michel', '', 'LIP - PC2S'], ['Sandoz-Guermond', 'Françoise', '', 'LIESP']]","['Accessibility', 'Visually disabled persons', 'E-Government']"
14301,0803.3900,Uwe Aickelin,"Jingpeng Li, Uwe Aickelin and Edmund Burke","A Component Based Heuristic Search method with Adaptive Perturbations
  for Hospital Personnel Scheduling",,"Technical Report NOTTCS-TR-2007-4, University of Nottingham, UK,,
  2006",,,cs.NE cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nurse rostering is a complex scheduling problem that affects hospital
personnel on a daily basis all over the world. This paper presents a new
component-based approach with adaptive perturbations, for a nurse scheduling
problem arising at a major UK hospital. The main idea behind this technique is
to decompose a schedule into its components (i.e. the allocated shift pattern
of each nurse), and then mimic a natural evolutionary process on these
components to iteratively deliver better schedules. The worthiness of all
components in the schedule has to be continuously demonstrated in order for
them to remain there. This demonstration employs a dynamic evaluation function
which evaluates how well each component contributes towards the final
objective. Two perturbation steps are then applied: the first perturbation
eliminates a number of components that are deemed not worthy to stay in the
current schedule; the second perturbation may also throw out, with a low level
of probability, some worthy components. The eliminated components are
replenished with new ones using a set of constructive heuristics using local
optimality criteria. Computational results using 52 data instances demonstrate
the applicability of the proposed approach in solving real-world problems.
","[{'version': 'v1', 'created': 'Thu, 27 Mar 2008 12:15:43 GMT'}]",2010-07-05,"[['Li', 'Jingpeng', ''], ['Aickelin', 'Uwe', ''], ['Burke', 'Edmund', '']]","['Nurse Rostering', 'Constructive Heuristic', 'Local Search', 'Adaptive Perturbation']"
14302,1401.7419,Orit E. Raz,"Orit E. Raz, Micha Sharir and J\'ozsef Solymosi",Polynomials vanishing on grids: The Elekes-R\'onyai problem revisited,,,,,cs.CG math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we characterize real bivariate polynomials which have a small
range over large Cartesian products. We show that for every constant-degree
bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every
pair of finite sets $A,B\subset{\mathbb R}$, with $|A|=|B|=n$ (where the
constant of proportionality depends on ${\rm deg} f$), or else $f$ must be of
one of the special forms $f(u,v)=h(\varphi(u)+\psi(v))$, or
$f(u,v)=h(\varphi(u)\cdot\psi(v))$, for some univariate polynomials
$\varphi,\psi,h$ over ${\mathbb R}$. This significantly improves a result of
Elekes and R\'onyai (2000).
  Our results are cast in a more general form, in which we give an upper bound
for the number of zeros of $z=f(x,y)$ on a triple Cartesian product $A\times
B\times C$, when the sizes $|A|$, $|B|$, $|C|$ need not be the same; the upper
bound is $O(n^{11/6})$ when $|A|=|B|=|C|=n$, where the constant of
proportionality depends on ${\rm deg} f$, unless $f$ has one of the
aforementioned special forms.
  This result provides a unified tool for improving bounds in various Erd\H
os-type problems in geometry and additive combinatorics. Several applications
of our results to problems of these kinds are presented. For example, we show
that the number of distinct distances between $n$ points lying on a
constant-degree parametric algebraic curve which does not contain a line, in
any dimension, is $\Omega(n^{4/3})$, extending the result of Pach and de Zeeuw
(2013) and improving the bound of Charalambides (2012), for the special case
where the curve under consideration has a polynomial parameterization. We also
derive improved lower bounds for several variants of the sum-product problem in
additive combinatorics.
","[{'version': 'v1', 'created': 'Wed, 29 Jan 2014 07:09:37 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Mar 2014 19:44:42 GMT'}]",2014-03-20,"[['Raz', 'Orit E.', ''], ['Sharir', 'Micha', ''], ['Solymosi', 'József', '']]","['Combinatorial geometry', 'incidences', 'polynomials']"
14303,1704.02803,Nasser Al-Fannah,Nasser Mohammed Al-Fannah,Making Defeating CAPTCHAs Harder for Bots,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For a number of years, many websites have used CAPTCHAs to filter out
interactions by bots. However, attackers have found ways to circumvent CAPTCHAs
by programming bots to solve or bypass them, or even relay them for humans to
solve. In order to reduce the chances of success of such attacks, CAPTCHAs can
be strengthened by the addition of certain safeguards. In this paper, we
discuss seven existing safeguards as well as five novel safeguards designed to
make circumventing CAPTCHAs harder. These safeguards are not mutually exclusive
and can add multiple layers of protection to a CAPTCHA. We further provide a
high-level comparison of their effectiveness in addressing the threat posed by
CAPTCHA-defeating techniques. In order to focus on safeguards that are usable,
we restrict our attention to those which have minimal adverse effect on the
user experience.
","[{'version': 'v1', 'created': 'Mon, 10 Apr 2017 11:07:59 GMT'}]",2017-04-11,"[['Al-Fannah', 'Nasser Mohammed', '']]","['captcha', 'attacks', 'safeguards', 'bots']"
14304,1412.7860,Christopher Tucker Ph.D.,Christopher A. Tucker,A self-organizing geometric algorithm for autonomous data partitioning,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A model of a geometric algorithm is introduced and methodology of its
operation is presented for the dynamic partitioning of data spaces.
","[{'version': 'v1', 'created': 'Thu, 25 Dec 2014 20:32:32 GMT'}]",2014-12-30,"[['Tucker', 'Christopher A.', '']]","['Geometric algorithm', 'self-organizing systems', 'autonomous data partitioning', 'theory of automata']"
14305,1511.02171,Francisco Igual,"Sandra Catal\'an, Jos\'e R. Herrero, Francisco D. Igual, Rafael
  Rodr\'iguez-S\'anchez, Enrique S. Quintana-Ort\'i","Multi-Threaded Dense Linear Algebra Libraries for Low-Power Asymmetric
  Multicore Processors",,,,,cs.MS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dense linear algebra libraries, such as BLAS and LAPACK, provide a relevant
collection of numerical tools for many scientific and engineering applications.
While there exist high performance implementations of the BLAS (and LAPACK)
functionality for many current multi-threaded architectures,the adaption of
these libraries for asymmetric multicore processors (AMPs)is still pending. In
this paper we address this challenge by developing an asymmetry-aware
implementation of the BLAS, based on the BLIS framework, and tailored for AMPs
equipped with two types of cores: fast/power hungry versus slow/energy
efficient. For this purpose, we integrate coarse-grain and fine-grain
parallelization strategies into the library routines which, respectively,
dynamically distribute the workload between the two core types and statically
repartition this work among the cores of the same type.
  Our results on an ARM big.LITTLE processor embedded in the Exynos 5422 SoC,
using the asymmetry-aware version of the BLAS and a plain migration of the
legacy version of LAPACK, experimentally assess the benefits, limitations, and
potential of this approach.
","[{'version': 'v1', 'created': 'Fri, 6 Nov 2015 17:36:20 GMT'}]",2015-11-09,"[['Catalán', 'Sandra', ''], ['Herrero', 'José R.', ''], ['Igual', 'Francisco D.', ''], ['Rodríguez-Sánchez', 'Rafael', ''], ['Quintana-Ortí', 'Enrique S.', '']]","['Dense linear algebra', 'BLAS', 'LAPACK', 'asymmetric multicoreprocessors', 'multi-threading', 'high performance computing']"
14306,1510.04597,Damien Fay,Damien Fay,Predictive partitioning for efficient BFS traversal in social networks,,,,,cs.DS cs.SI stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we show how graph structure can be used to drastically reduce
the computational bottleneck of the Breadth First Search algorithm (the
foundation of many graph traversal techniques). In particular, we address
parallel implementations where the bottleneck is the number of messages between
processors emitted at the peak iteration. First, we derive an expression for
the expected degree distribution of vertices in the frontier of the algorithm
which is shown to be highly skewed. Subsequently, we derive an expression for
the expected message along an edge in a particular iteration. This skew
suggests a weighted, iteration based, partition would be advantageous.
Employing the METIS algorithm we then show empirically that such partitions can
reduce the message overhead by up to 50% in some particular instances and in
the order of 20% on average. These results have implications for graph
processing in multiprocessor and distributed computing environments.
","[{'version': 'v1', 'created': 'Thu, 15 Oct 2015 15:50:51 GMT'}]",2015-11-30,"[['Fay', 'Damien', '']]","['BFS', 'graph structure', 'social network properties']"
14307,1011.0250,Yogendra Namjoshi Mr.,Sangeeta Soni and Yogendra Namjoshi,"Delineation of Raw Plethysmograph using Wavelets for Mobile based Pulse
  Oximeters","Proceedings of 5th Innovative Conference on Embedded Systems, Mobile
  Communication and Computing, Pg. 74-84, ISBN 023-033-045-2",,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The non-invasive pulse-oximeter is a crucial parameter in continuous
monitoring systems. It plays a vital role from admission of the patient to
surgeries with general anaesthesia. The paper proposes the application of
wavelet transform to delineate the raw plethysmograph signals obtained from
basic portable and mobile-powered electronic hardware. The paper primarily
focuses on finding peaks and baseline from noisy infrared and red waveforms
which are responsible for calculating heart-rate and oxygen saturation
percentages.
","[{'version': 'v1', 'created': 'Mon, 1 Nov 2010 04:54:50 GMT'}]",2010-11-02,"[['Soni', 'Sangeeta', ''], ['Namjoshi', 'Yogendra', '']]","['Mobile', 'Pulse-oximeter', 'Plethysmography', 'Wavelet Transform', 'Peak Detection']"
14308,1207.4804,Hosam Abdo,"Hosam Abdo, Nathann Cohen, and Darko Dimitrov",Bounds and Computation of Irregularity of a Graph,"13 Pages, 3 figures, Journal Paper",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Albertson has defined the irregularity of a simple undirected graph $G=(V,E)$
as $ \irr(G) = \sum_{uv\in E}|d_G(u)-d_G(v)|,$ where $d_G(u)$ denotes the
degree of a vertex $u \in V$. Recently, this graph invariant gained interest in
the chemical graph theory, where it occured in some bounds on the first and the
second Zagreb index, and was named the third Zagreb index Fath-Tabar. For
general graphs with $n$ vertices, Albertson has obtained an asymptotically
tight upper bound on the irregularity of $4 n^3 /27.$ Here, by exploiting a
different approach than in Albertson, we show that for general graphs with $n$
vertices the upper bound $\lfloor \frac{n}{3} \rfloor \lceil \frac{2 n}{3}
\rceil (\lceil \frac{2 n}{3} \rceil -1)$ is sharp. Next, we determine
$k$-cyclic graphs with maximal irregularity. We also present some bounds on the
maximal/minimal irregularity of graphs with fixed minimal and/or maximal vertex
degrees, and consider an approximate computation of the irregularity of a
graph.
","[{'version': 'v1', 'created': 'Thu, 19 Jul 2012 20:27:21 GMT'}]",2015-03-20,"[['Abdo', 'Hosam', ''], ['Cohen', 'Nathann', ''], ['Dimitrov', 'Darko', '']]","['irregularity of a graph', 'Zagreb indices', 'third Zagreb index']"
14309,1401.0794,Taraka Rama Kasicheyanula,"Taraka Rama, Lars Borin",Properties of phoneme N -grams across the world's language families,,,,,cs.CL stat.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, we investigate the properties of phoneme N-grams across half
of the world's languages. We investigate if the sizes of three different N-gram
distributions of the world's language families obey a power law. Further, the
N-gram distributions of language families parallel the sizes of the families,
which seem to obey a power law distribution. The correlation between N-gram
distributions and language family sizes improves with increasing values of N.
We applied statistical tests, originally given by physicists, to test the
hypothesis of power law fit to twelve different datasets. The study also raises
some new questions about the use of N-gram distributions in linguistic
research, which we answer by running a statistical test.
","[{'version': 'v1', 'created': 'Sat, 4 Jan 2014 09:50:55 GMT'}]",2014-01-07,"[['Rama', 'Taraka', ''], ['Borin', 'Lars', '']]","['N-grams', 'ASJP', 'language families']"
14310,1107.4786,Frederic Le Mouel,"Roya Golchay (CITI Insa Lyon / Inria Grenoble Rh\^one-Alpes),
  Fr\'ed\'eric Le Mou\""el (CITI Insa Lyon / Inria Grenoble Rh\^one-Alpes),
  St\'ephane Fr\'enot (CITI Insa Lyon / Inria Grenoble Rh\^one-Alpes), Julien
  Ponge (CITI Insa Lyon / Inria Grenoble Rh\^one-Alpes)","Towards Bridging IoT and Cloud Services: Proposing Smartphones as Mobile
  and Autonomic Service Gateways",Position Paper,UbiMob'2011 (2011) 45--48,,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computing is currently getting at the same time incredibly in the small with
sensors/actuators embedded in our every- day objects and also greatly in the
large with data and ser- vice clouds accessible anytime, anywhere. This
Internet of Things is physically closed to the user but suffers from weak
run-time execution environments. Cloud Environments provide powerful data
storage and computing power but can not be easily accessed and integrate the
final-user context- awareness. We consider smartphones are set to become the
universal interface between these two worlds. In this position paper, we
propose a middleware approach where smartphones provide service gateways to
bridge the gap between IoT services and Cloud services. Since smartphones are
mobile gateways, they should be able to (re)configure themself according to
their place, things discovered around, and their own resources such battery.
Several issues are discussed: collaborative event-based context management,
adaptive and opportunistic service deployment and invocation, multi-criteria
(user- and performance-oriented) optimization decision algorithm.
","[{'version': 'v1', 'created': 'Sun, 24 Jul 2011 19:39:02 GMT'}]",2011-07-26,"[['Golchay', 'Roya', '', 'CITI Insa Lyon / Inria Grenoble Rhône-Alpes'], ['Mouël', 'Frédéric Le', '', 'CITI Insa Lyon / Inria Grenoble Rhône-Alpes'], ['Frénot', 'Stéphane', '', 'CITI Insa Lyon / Inria Grenoble Rhône-Alpes'], ['Ponge', 'Julien', '', 'CITI Insa Lyon / Inria Grenoble Rhône-Alpes']]","['Cloud Computing', 'Internet of Things', 'Service-oriented Applications', 'Middleware', 'Smart and Autonomic Gateways', 'Smartphone']"
14311,1304.1676,Sowmya Kamath S,A Anji Reddy and S Sowmya Kamath,Research on Potential Semantic Web Service Discovery Mechanisms,"6 pages, International Conference on Recent Trends in Computer
  Science and Engineering (ICRTCSE' 2012) May 3 - 4, 2012 Chennai, INDIA ISBN:
  978-81-9089-807-2",,,,cs.SE cs.CY cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The field of Web services is an important paradigm in distributed application
development. Currently, many businesses are seeking to convert their
applications into web services because of its ability to promote
inter-operability among applications. As a number of web services increase, the
process of discovering appropriate web services for consumption from user's
perspective gains importance. In this paper, we present a study of potential
ways of discovering web services and issues related to each of them. In
addition, we discuss ontology concepts and related technologies, which
incorporate semantic meaning and hence give domain knowledge about a web
service to improve the discovery mechanism. The paper also presents an overview
of related research work, identifying metrics useful in filtering web service
search mechanisms.
","[{'version': 'v1', 'created': 'Fri, 5 Apr 2013 11:04:26 GMT'}]",2013-04-08,"[['Reddy', 'A Anji', ''], ['Kamath', 'S Sowmya', '']]","['Semantic Web Service', 'Web Service Discovery', 'OWL-S', 'UDDI', 'Search', 'Ontology', 'Web Crawlers', 'SOA']"
14312,1708.02000,Stanis{\l}aw Saganowski,Stanis{\l}aw Saganowski,Analysis of Social Group Dynamics,"My MSc thesis defended in June 2011. Please cite as: Saganowski S.
  Analysis of Social Group Dynamics, MSc thesis 2011",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this thesis the method for social group evolution discovery, called GED,
is analyzed. Especially, GED method is compared with other methods tracking
changes in groups over time with focus on accuracy, computational cost, ease of
implementation and flexibility of the methods. The methods are evaluated on
overlapping and disjoint social groups. Finally, GED method is run with
different user importance measures.
","[{'version': 'v1', 'created': 'Mon, 7 Aug 2017 06:23:53 GMT'}]",2017-08-08,"[['Saganowski', 'Stanisław', '']]","['social network', 'community evolution', 'communities in social networks', 'social']"
14313,1011.2107,Jocelyne Troccaz,"Janssoone Thomas (TIMC), Gr\'egoire Chevreau (TIMC), Lucile Vadcard
  (LSE), Pierre Mozer, Jocelyne Troccaz (TIMC)","Biopsym : a learning environment for transrectal ultrasound guided
  prostate biopsies",,"18th ""Medecine Meets Virtual Reality"", Newport beach : United
  States (2011)",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a learning environment for image-guided prostate
biopsies in cancer diagnosis; it is based on an ultrasound probe simulator
virtually exploring real datasets obtained from patients. The aim is to make
the training of young physicians easier and faster with a tool that combines
lectures, biopsy simulations and recommended exercises to master this medical
gesture. It will particularly help acquiring the three-dimensional
representation of the prostate needed for practicing biopsy sequences. The
simulator uses a haptic feedback to compute the position of the virtual probe
from three-dimensional (3D) ultrasound recorded data. This paper presents the
current version of this learning environment.
","[{'version': 'v1', 'created': 'Mon, 8 Nov 2010 15:54:10 GMT'}]",2010-11-10,"[['Thomas', 'Janssoone', '', 'TIMC'], ['Chevreau', 'Grégoire', '', 'TIMC'], ['Vadcard', 'Lucile', '', 'LSE'], ['Mozer', 'Pierre', '', 'TIMC'], ['Troccaz', 'Jocelyne', '', 'TIMC']]","['Simulator', 'ultrasound', 'biopsy', 'educational content']"
14314,0805.1787,Michael Hilker,Michael Hilker and Christoph Schommer,A Network Protection Framework through Artificial Immunity,"24 pages, 2 figures",,,,cs.MA cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current network protection systems use a collection of intelligent components
- e.g. classifiers or rule-based firewall systems to detect intrusions and
anomalies and to secure a network against viruses, worms, or trojans. However,
these network systems rely on individuality and support an architecture with
less collaborative work of the protection components. They give less
administration support for maintenance, but offer a large number of individual
single points of failures - an ideal situation for network attacks to succeed.
In this work, we discuss the required features, the performance, and the
problems of a distributed protection system called {\it SANA}. It consists of a
cooperative architecture, it is motivated by the human immune system, where the
components correspond to artificial immune cells that are connected for their
collaborative work. SANA promises a better protection against intruders than
common known protection systems through an adaptive self-management while
keeping the resources efficiently by an intelligent reduction of redundancies.
We introduce a library of several novel and common used protection components
and evaluate the performance of SANA by a proof-of-concept implementation.
","[{'version': 'v1', 'created': 'Tue, 13 May 2008 06:51:35 GMT'}]",2008-05-14,"[['Hilker', 'Michael', ''], ['Schommer', 'Christoph', '']]","['Network Protection', 'Artificial Immune Systems', 'Bio-Inspired Computing', 'Distributed Architectures', 'Information Management', 'Network Simulation']"
14315,1704.05841,Kevin Jasberg,Kevin Jasberg and Sergej Sizov,"The Magic Barrier Revisited: Accessing Natural Limitations of
  Recommender Assessment",,,,,cs.HC cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender systems nowadays have many applications and are of great economic
benefit. Hence, it is imperative for success-oriented companies to compare
different of such systems and select the better one for their purposes. To this
end, various metrics of predictive accuracy are commonly used, such as the Root
Mean Square Error (RMSE), or precision and recall. All these metrics more or
less measure how well a recommender system can predict human behaviour.
  Unfortunately, human behaviour is always associated with some degree of
uncertainty, making the evaluation difficult, since it is not clear whether a
deviation is system-induced or just originates from the natural variability of
human decision making. At this point, some authors speculated that we may be
reaching some Magic Barrier where this variability prevents us from getting
much more accurate.
  In this article, we will extend the existing theory of the Magic Barrier into
a new probabilistic but a yet pragmatic model. In particular, we will use
methods from metrology and physics to develop easy-to-handle quantities for
computation to describe the Magic Barrier for different accuracy metrics and
provide suggestions for common application. This discussion is substantiated by
comprehensive experiments with real users and large-scale simulations on a
high-performance cluster.
","[{'version': 'v1', 'created': 'Wed, 19 Apr 2017 16:57:25 GMT'}]",2017-04-21,"[['Jasberg', 'Kevin', ''], ['Sizov', 'Sergej', '']]","['Magic Barrier', 'Noise', 'Uncertainty', 'Distribution-Paradigm', 'PointParadigm', 'RMSE']"
14316,1501.04228,Hugh Kennedy Dr.,Hugh L. Kennedy,Improved IIR Low-Pass Smoothers and Differentiators with Tunable Delay,"To appear in Proc. International Conference on Digital Image
  Computing: Techniques and Applications (DICTA), Adelaide, 23rd-25th Nov. 2015",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Regression analysis using orthogonal polynomials in the time domain is used
to derive closed-form expressions for causal and non-causal filters with an
infinite impulse response (IIR) and a maximally-flat magnitude and delay
response. The phase response of the resulting low-order smoothers and
differentiators, with low-pass characteristics, may be tuned to yield the
desired delay in the pass band or for zero gain at the Nyquist frequency. The
filter response is improved when the shape of the exponential weighting
function is modified and discrete associated Laguerre polynomials are used in
the analysis. As an illustrative example, the derivative filters are used to
generate an optical-flow field and to detect moving ground targets, in real
video data collected from an airborne platform with an electro-optic sensor.
","[{'version': 'v1', 'created': 'Sat, 17 Jan 2015 20:32:24 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Feb 2015 05:58:39 GMT'}, {'version': 'v3', 'created': 'Wed, 25 Feb 2015 05:00:57 GMT'}, {'version': 'v4', 'created': 'Sat, 18 Jul 2015 01:43:21 GMT'}, {'version': 'v5', 'created': 'Thu, 20 Aug 2015 04:40:13 GMT'}]",2015-08-21,"[['Kennedy', 'Hugh L.', '']]","['Digital filters', 'IIR filters', 'Low-pass filters', 'Moving target indication', 'Recursive estimation']"
14317,1110.1488,A S N Chakravarthy ASN CHAKRAVARTHY,"A. S. N. Chakravarthy, Penmetsa V. Krishna Raja, P. S. Avadhani",Handwritten Text Image Authentication using Back Propagation,10 pages pdf file,"International Journal of Network Security & Its Applications
  (IJNSA), Vol.3, No.5, Sep 2011",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Authentication is the act of confirming the truth of an attribute of a datum
or entity. This might involve confirming the identity of a person, tracing the
origins of an artefact, ensuring that a product is what it's packaging and
labelling claims to be, or assuring that a computer program is a trusted one.
The authentication of information can pose special problems (especially
man-in-the-middle attacks), and is often wrapped up with authenticating
identity. Literary can involve imitating the style of a famous author. If an
original manuscript, typewritten text, or recording is available, then the
medium itself (or its packaging - anything from a box to e-mail headers) can
help prove or disprove the authenticity of the document. The use of digital
images of handwritten historical documents has become more popular in recent
years. Volunteers around the world now read thousands of these images as part
of their indexing process. Handwritten text images of old documents are
sometimes difficult to read or noisy due to the preservation of the document
and quality of the image [1]. Handwritten text offers challenges that are
rarely encountered in machine-printed text. In addition, most problems faced in
reading machine- printed text (e.g., character recognition, word segmentation,
letter segmentation, etc.) are more severe, in handwritten text. In this paper
we Here in this paper we proposed a method for authenticating hand written text
images using back propagation algorithm..
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2011 11:40:18 GMT'}]",2011-10-10,"[['Chakravarthy', 'A. S. N.', ''], ['Raja', 'Penmetsa V. Krishna', ''], ['Avadhani', 'P. S.', '']]","['Optical Character Recognition', 'Handwritten text image', 'Handwriting Recognition']"
14318,1602.07267,Dmitry Ignatov,Dmitry I. Ignatov,"On closure operators related to maximal tricliques in tripartite
  hypergraphs",Draft for spec. issue of DAM (2015),,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Triadic Formal Concept Analysis (3FCA) was introduced by Lehman and Wille
almost two decades ago. And many researchers work in Data Mining and Formal
Concept Analysis using the notions of closed sets, Galois and closure
operators, closure systems, but up-to-date even though that different
researchers actively work on mining triadic and n-ary relations, a proper
closure operator for enumeration of triconcepts, i.e. maximal triadic cliques
of tripartite hypergaphs, was not introduced. In this paper we show that the
previously introduced operators for obtaining triconcepts and maximal connected
and complete sets (MCCSs) are not always consistent and provide the reader with
a definition of valid closure operator and associated set system. Moreover, we
study the difficulties of related problems from order-theoretic and
combinatorial point view as well as provide the reader with justifications of
the complexity classes of these problems.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2016 19:13:00 GMT'}, {'version': 'v2', 'created': 'Sun, 26 Feb 2017 12:16:05 GMT'}]",2017-02-28,"[['Ignatov', 'Dmitry I.', '']]","['Triaidic Formal Concept Analysis', 'Closure operator', 'triadic']"
14319,1505.07130,Kemele M. Endris,"Kemele M. Endris, Sidra Faisal, Fabrizio Orlandi, S\""oren Auer, Simon
  Scerri",Interest-based RDF Update Propagation,"16 pages, Keywords: Change Propagation, Dataset Dynamics, Linked
  Data, Replication",,,,cs.DC cs.DB cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many LOD datasets, such as DBpedia and LinkedGeoData, are voluminous and
process large amounts of requests from diverse applications. Many data products
and services rely on full or partial local LOD replications to ensure faster
querying and processing. While such replicas enhance the flexibility of
information sharing and integration infrastructures, they also introduce data
duplication with all the associated undesirable consequences. Given the
evolving nature of the original and authoritative datasets, to ensure
consistent and up-to-date replicas frequent replacements are required at a
great cost. In this paper, we introduce an approach for interest-based RDF
update propagation, which propagates only interesting parts of updates from the
source to the target dataset. Effectively, this enables remote applications to
`subscribe' to relevant datasets and consistently reflect the necessary changes
locally without the need to frequently replace the entire dataset (or a
relevant subset). Our approach is based on a formal definition for
graph-pattern-based interest expressions that is used to filter interesting
parts of updates from the source. We implement the approach in the iRap
framework and perform a comprehensive evaluation based on DBpedia Live updates,
to confirm the validity and value of our approach.
","[{'version': 'v1', 'created': 'Tue, 26 May 2015 20:36:42 GMT'}]",2015-05-28,"[['Endris', 'Kemele M.', ''], ['Faisal', 'Sidra', ''], ['Orlandi', 'Fabrizio', ''], ['Auer', 'Sören', ''], ['Scerri', 'Simon', '']]","['Change Propagation', 'Dataset Dynamics', 'Linked Data', 'Replication']"
14320,1007.4749,Loet Leydesdorff,Loet Leydesdorff and Lutz Bornmann,"How fractional counting affects the Impact Factor: Normalization in
  terms of differences in citation potentials among fields of science",,,,,cs.DL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ISI-Impact Factors suffer from a number of drawbacks, among them the
statistics-why should one use the mean and not the median?-and the
incomparability among fields of science because of systematic differences in
citation behavior among fields. Can these drawbacks be counteracted by counting
citation weights fractionally instead of using whole numbers in the numerators?
(i) Fractional citation counts are normalized in terms of the citing sources
and thus would take into account differences in citation behavior among fields
of science. (ii) Differences in the resulting distributions can be tested
statistically for their significance at different levels of aggregation. (iii)
Fractional counting can be generalized to any document set including journals
or groups of journals, and thus the significance of differences among both
small and large sets can be tested. A list of fractionally counted Impact
Factors for 2008 is available online at
http://www.leydesdorff.net/weighted_if/weighted_if.xls. The in-between group
variance among the thirteen fields of science identified in the U.S. Science
and Engineering Indicators is not statistically significant after this
normalization. Although citation behavior differs largely between disciplines,
the reflection of these differences in fractionally counted citation
distributions could not be used as a reliable instrument for the
classification.
","[{'version': 'v1', 'created': 'Tue, 27 Jul 2010 15:26:12 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Sep 2010 07:22:19 GMT'}]",2010-09-23,"[['Leydesdorff', 'Loet', ''], ['Bornmann', 'Lutz', '']]","['citation', 'evaluation', 'journal', 'impact', 'indicator', 'fractional counting']"
14321,0805.1786,Michael Hilker,Michael Hilker,"Next Challenges in Bringing Artificial Immune Systems to Production in
  Network Security","7 pages, 1 figure",,,,cs.MA cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The human immune system protects the human body against various pathogens
like e.g. biological viruses and bacteria. Artificial immune systems reuse the
architecture, organization, and workflows of the human immune system for
various problems in computer science. In the network security, the artificial
immune system is used to secure a network and its nodes against intrusions like
viruses, worms, and trojans. However, these approaches are far away from
production where they are academic proof-of-concept implementations or use only
a small part to protect against a certain intrusion. This article discusses the
required steps to bring artificial immune systems into production in the
network security domain. It furthermore figures out the challenges and provides
the description and results of the prototype of an artificial immune system,
which is SANA called.
","[{'version': 'v1', 'created': 'Tue, 13 May 2008 06:40:39 GMT'}]",2008-05-14,"[['Hilker', 'Michael', '']]","['Network Security', 'Artificial Immune Systems', 'Bio-InspiredComputing', 'Distributed Systems']"
14322,0802.0552,Vincent Gramoli,"Vincent Gramoli (INRIA Futurs), Michel Raynal (IRISA)",Timed Quorum System for Large-Scale and Dynamic Environments,,"Dans 11th International Conference On Principles Of Distributed
  Systems 4878 (2007) 429--442",,,cs.DC cs.NI,,"  This paper presents Timed Quorum System (TQS), a new quorum system especially
suited for large-scale and dynamic systems. TQS requires that two quorums
intersect with high probability if they are used in the same small period of
time. It proposed an algorithm that implements TQS and that verifies
probabilistic atomicity: a consistency criterion that requires each operation
to respect atomicity with high probability. This TQS implementation has quorum
of size O(\sqrt{nD}) and expected access time of O(log \sqrt{nD}) message
delays, where n measures the size of the system and D is a required parameter
to handle dynamism.
","[{'version': 'v1', 'created': 'Tue, 5 Feb 2008 07:09:08 GMT'}]",2008-02-06,"[['Gramoli', 'Vincent', '', 'INRIA Futurs'], ['Raynal', 'Michel', '', 'IRISA']]","['Time', 'Quorums', 'Churn', 'Scalability', 'Probabilistic atomicity']"
14323,1108.2754,Karthik Raman,"Karthik Raman, Thorsten Joachims and Pannaga Shivaswamy",Structured Learning of Two-Level Dynamic Rankings,"10 Pages (Longer Version of CIKM 2011 paper containing more details
  and experiments)",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For ambiguous queries, conventional retrieval systems are bound by two
conflicting goals. On the one hand, they should diversify and strive to present
results for as many query intents as possible. On the other hand, they should
provide depth for each intent by displaying more than a single result. Since
both diversity and depth cannot be achieved simultaneously in the conventional
static retrieval model, we propose a new dynamic ranking approach. Dynamic
ranking models allow users to adapt the ranking through interaction, thus
overcoming the constraints of presenting a one-size-fits-all static ranking. In
particular, we propose a new two-level dynamic ranking model for presenting
search results to the user. In this model, a user's interactions with the
first-level ranking are used to infer this user's intent, so that second-level
rankings can be inserted to provide more results relevant for this intent.
Unlike for previous dynamic ranking models, we provide an algorithm to
efficiently compute dynamic rankings with provable approximation guarantees for
a large family of performance measures. We also propose the first principled
algorithm for learning dynamic ranking functions from training data. In
addition to the theoretical results, we provide empirical evidence
demonstrating the gains in retrieval quality that our method achieves over
conventional approaches.
","[{'version': 'v1', 'created': 'Sat, 13 Aug 2011 03:22:48 GMT'}]",2015-03-19,"[['Raman', 'Karthik', ''], ['Joachims', 'Thorsten', ''], ['Shivaswamy', 'Pannaga', '']]","['Diversified Retrieval', 'Structured Learning', 'Submodular Optimization', 'Web Search & Information Retrieval']"
14324,1306.4934,Igal Sason,Igal Sason,"On the Corner Points of the Capacity Region of a Two-User Gaussian
  Interference Channel","Submitted to the IEEE Trans. on Information Theory in July 17, 2014,
  and revised in April 5, 2015. Presented in part at Allerton 2013, and also
  presented in part with improved results at ISIT 2014",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work considers the corner points of the capacity region of a two-user
Gaussian interference channel (GIC). In a two-user GIC, the rate pairs where
one user transmits its data at the single-user capacity (without interference),
and the other at the largest rate for which reliable communication is still
possible are called corner points. This paper relies on existing outer bounds
on the capacity region of a two-user GIC that are used to derive informative
bounds on the corner points of the capacity region. The new bounds refer to a
weak two-user GIC (i.e., when both cross-link gains in standard form are
positive and below 1), and a refinement of these bounds is obtained for the
case where the transmission rate of one user is within $\varepsilon > 0$ of the
single-user capacity. The bounds on the corner points are asymptotically tight
as the transmitted powers tend to infinity, and they are also useful for the
case of moderate SNR and INR. Upper and lower bounds on the gap (denoted by
$\Delta$) between the sum-rate and the maximal achievable total rate at the two
corner points are derived. This is followed by an asymptotic analysis analogous
to the study of the generalized degrees of freedom (where the SNR and INR
scalings are coupled such that $\frac{\log(\text{INR})}{\log(\text{SNR})} =
\alpha \geq 0$), leading to an asymptotic characterization of this gap which is
exact for the whole range of $\alpha$. The upper and lower bounds on $\Delta$
are asymptotically tight in the sense that they achieve the exact asymptotic
characterization. Improved bounds on $\Delta$ are derived for finite SNR and
INR, and their improved tightness is exemplified numerically.
","[{'version': 'v1', 'created': 'Thu, 20 Jun 2013 16:42:39 GMT'}, {'version': 'v2', 'created': 'Sun, 23 Jun 2013 22:06:09 GMT'}, {'version': 'v3', 'created': 'Thu, 27 Jun 2013 14:04:13 GMT'}, {'version': 'v4', 'created': 'Tue, 6 Aug 2013 12:09:43 GMT'}, {'version': 'v5', 'created': 'Wed, 14 Aug 2013 20:52:56 GMT'}, {'version': 'v6', 'created': 'Wed, 9 Oct 2013 15:44:48 GMT'}, {'version': 'v7', 'created': 'Sun, 8 Dec 2013 09:58:03 GMT'}, {'version': 'v8', 'created': 'Thu, 19 Dec 2013 20:19:53 GMT'}, {'version': 'v9', 'created': 'Tue, 7 Apr 2015 20:14:47 GMT'}]",2015-04-09,"[['Sason', 'Igal', '']]","['Corner point', 'Gaussian interference channel', 'inner/ outer bound', 'interference to noise ratio', 'sum-rate']"
14325,1609.01490,Crist\'obal A. Navarro,"Crist\'obal A. Navarro, Benjam\'in Bustos, Nancy Hitschfeld",A Non-linear GPU Thread Map for Triangular Domains,"16 pages, 7 Figures",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a stage in the GPU computing pipeline where a grid of thread-blocks,
in \textit{parallel space}, is mapped onto the problem domain, in \textit{data
space}. Since the parallel space is restricted to a box type geometry, the
mapping approach is typically a $k$-dimensional bounding box (BB) that covers a
$p$-dimensional data space. Threads that fall inside the domain perform
computations while threads that fall outside are discarded at runtime. In this
work we study the case of mapping threads efficiently onto triangular domain
problems and propose a block-space linear map $\lambda(\omega)$, based on the
properties of the lower triangular matrix, that reduces the number of
unnnecessary threads from $\mathcal{O}(n^2)$ to $\mathcal{O}(n)$. Performance
results for global memory accesses show an improvement of up to $18\%$ with
respect to the \textit{bounding-box} approach, placing $\lambda(\omega)$ on
second place below the \textit{rectangular-box} approach and above the
\textit{recursive-partition} and \textit{upper-triangular} approaches. For
shared memory scenarios $\lambda(\omega)$ was the fastest approach achieving
$7\%$ of performance improvement while preserving thread locality. The results
obtained in this work make $\lambda(\omega)$ an interesting map for efficient
GPU computing on parallel problems that define a triangular domain with or
without neighborhood interactions. The extension to tetrahedral domains is
analyzed, with applications to triplet-interaction n-body applications.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2016 11:23:13 GMT'}]",2016-09-07,"[['Navarro', 'Cristóbal A.', ''], ['Bustos', 'Benjamín', ''], ['Hitschfeld', 'Nancy', '']]","['block-space mapping', 'data re-organization', 'trianglular domainkeywords here', 'in the form keyword', 'keyword']"
14326,1409.4150,Christos Tzamos,"Constantinos Daskalakis, Alan Deckelbaum, Christos Tzamos",Strong Duality for a Multiple-Good Monopolist,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We characterize optimal mechanisms for the multiple-good monopoly problem and
provide a framework to find them. We show that a mechanism is optimal if and
only if a measure $\mu$ derived from the buyer's type distribution satisfies
certain stochastic dominance conditions. This measure expresses the marginal
change in the seller's revenue under marginal changes in the rent paid to
subsets of buyer types. As a corollary, we characterize the optimality of
grand-bundling mechanisms, strengthening several results in the literature,
where only sufficient optimality conditions have been derived. As an
application, we show that the optimal mechanism for $n$ independent uniform
items each supported on $[c,c+1]$ is a grand-bundling mechanism, as long as $c$
is sufficiently large, extending Pavlov's result for $2$ items [Pavlov'11]. At
the same time, our characterization also implies that, for all $c$ and for all
sufficiently large $n$, the optimal mechanism for $n$ independent uniform items
supported on $[c,c+1]$ is not a grand bundling mechanism.
","[{'version': 'v1', 'created': 'Mon, 15 Sep 2014 03:54:55 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Apr 2016 02:59:52 GMT'}, {'version': 'v3', 'created': 'Tue, 5 Sep 2017 22:59:23 GMT'}]",2017-09-07,"[['Daskalakis', 'Constantinos', ''], ['Deckelbaum', 'Alan', ''], ['Tzamos', 'Christos', '']]","['Revenue maximization', 'mechanism design', 'strong duality', 'grand bundling']"
14327,1407.6932,Albert Saa-Garriga,"Albert Sa\`a-Garriga, David Castells-Rufas, Jordi Carrabina","OMP2HMPP: HMPP Source Code Generation from Programs with Pragma
  Extensions","Proceedings of HIP3ES Workshop, Vienna, January, 21st 2014",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  High-performance computing are based more and more in heterogeneous
architectures and GPGPUs have become one of the main integrated blocks in
these, as the recently emerged Mali GPU in embedded systems or the NVIDIA GPUs
in HPC servers. In both GPGPUs, programming could become a hurdle that can
limit their adoption, since the programmer has to learn the hardware
capabilities and the language to work with these. We present OMP2HMPP, a tool
that, automatically trans-lates a high-level C source code(OpenMP) code into
HMPP. The generated version rarely will differs from a hand-coded HMPP version,
and will provide an important speedup, near 113%, that could be later improved
by hand-coded CUDA. The generated code could be transported either to HPC
servers and to embedded GPUs, due to the commonalities between them.
","[{'version': 'v1', 'created': 'Fri, 25 Jul 2014 15:14:08 GMT'}]",2014-07-28,"[['Saà-Garriga', 'Albert', ''], ['Castells-Rufas', 'David', ''], ['Carrabina', 'Jordi', '']]","['Source to Source Compiler', 'GPGPUS', 'HMPP', 'EmbeddedGPUs', 'parallel computing', 'program understanding', 'compiler Optimizations']"
14328,1607.00847,Majdi Khalid,"Majdi Khalid, Indrakshi Ray, and Hamidreza Chitsaz",Confidence-Weighted Bipartite Ranking,"15 pages, 6 tables, and 2 figures",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bipartite ranking is a fundamental machine learning and data mining problem.
It commonly concerns the maximization of the AUC metric. Recently, a number of
studies have proposed online bipartite ranking algorithms to learn from massive
streams of class-imbalanced data. These methods suggest both linear and
kernel-based bipartite ranking algorithms based on first and second-order
online learning. Unlike kernelized ranker, linear ranker is more scalable
learning algorithm. The existing linear online bipartite ranking algorithms
lack either handling non-separable data or constructing adaptive large margin.
These limitations yield unreliable bipartite ranking performance. In this work,
we propose a linear online confidence-weighted bipartite ranking algorithm
(CBR) that adopts soft confidence-weighted learning. The proposed algorithm
leverages the same properties of soft confidence-weighted learning in a
framework for bipartite ranking. We also develop a diagonal variation of the
proposed confidence-weighted bipartite ranking algorithm to deal with
high-dimensional data by maintaining only the diagonal elements of the
covariance matrix. We empirically evaluate the effectiveness of the proposed
algorithms on several benchmark and high-dimensional datasets. The experimental
results validate the reliability of the proposed algorithms. The results also
show that our algorithms outperform or are at least comparable to the competing
online AUC maximization methods.
","[{'version': 'v1', 'created': 'Mon, 4 Jul 2016 12:21:04 GMT'}, {'version': 'v2', 'created': 'Sat, 9 Jul 2016 06:20:07 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Jul 2016 19:07:44 GMT'}, {'version': 'v4', 'created': 'Sun, 24 Jul 2016 22:04:09 GMT'}, {'version': 'v5', 'created': 'Mon, 26 Sep 2016 19:15:22 GMT'}, {'version': 'v6', 'created': 'Tue, 27 Sep 2016 01:55:44 GMT'}, {'version': 'v7', 'created': 'Wed, 28 Sep 2016 18:21:00 GMT'}, {'version': 'v8', 'created': 'Thu, 24 Nov 2016 20:04:28 GMT'}, {'version': 'v9', 'created': 'Sun, 10 Mar 2019 08:17:05 GMT'}]",2019-03-12,"[['Khalid', 'Majdi', ''], ['Ray', 'Indrakshi', ''], ['Chitsaz', 'Hamidreza', '']]","['online ranking', 'imbalanced learning', 'AUC maximization']"
14329,1403.0802,Jianting Zhang,Jianting Zhang Simin You,"Large-Scale Geospatial Processing on Multi-Core and Many-Core
  Processors: Evaluations on CPUs, GPUs and MICs",10 pages,,,,cs.DB cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Geospatial Processing, such as queries based on point-to-polyline shortest
distance and point-in-polygon test, are fundamental to many scientific and
engineering applications, including post-processing large-scale environmental
and climate model outputs and analyzing traffic and travel patterns from
massive GPS collections in transportation engineering and urban studies.
Commodity parallel hardware, such as multi-core CPUs, many-core GPUs and Intel
MIC accelerators, provide enormous computing power which can potentially
achieve significant speedups on existing geospatial processing and open the
opportunities for new applications. However, the realizable potential for
geospatial processing on these new hardware devices is largely unknown due to
the complexity in porting serial algorithms to diverse parallel hardware
platforms. In this study, we aim at experimenting our data-parallel designs and
implementations of point-to-polyline shortest distance computation (P2P) and
point-in-polygon topological test (PIP) on different commodity hardware using
real large-scale geospatial data, comparing their performance and discussing
important factors that may significantly affect the performance. Our
experiments have shown that, while GPUs can be several times faster than
multi-core CPUs without utilizing the increasingly available SIMD computing
power on Vector Processing Units (VPUs) that come with multi-core CPUs and
MICs, multi-core CPUs and MICs can be several times faster than GPUs when VPUs
are utilized. By adopting a Domain Specific Language (DSL) approach to
exploiting the VPU computing power in geospatial processing, we are free from
programming SIMD intrinsic functions directly which makes the new approach more
effective, portable and scalable. Our designs, implementations and experiments
can serve as case studies for parallel geospatial computing on modern commodity
parallel hardware.
","[{'version': 'v1', 'created': 'Tue, 4 Mar 2014 14:46:29 GMT'}]",2014-03-05,"[['You', 'Jianting Zhang Simin', '']]","['Geospatial Data', 'Spatial Operation', 'Multi-Core CPU', 'GPU', 'MIC', 'VPU', 'SIMD', 'DSL']"
14330,1606.08303,Marco Compagnoni,"Marco Compagnoni, Roberto Notari, Fabio Antonacci, Augusto Sarti","On the Statistical Model of Source Localization based on Range
  Difference Measurements","24 pages, 12 figures",,,,cs.IT cs.SD math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we study the statistical model of source localization based on
Range Difference measurements. We investigate the case of planar localization
of a source using a minimal configuration of three non aligned receivers. Our
analysis is based on a previous work of the same authors concerning the
localization in a noiseless scenario. As the set of feasible measurements is a
semialgebraic variety, this investigation makes use of techniques from
Algebraic Statistics and Information Geometry.
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2016 15:01:03 GMT'}]",2016-06-28,"[['Compagnoni', 'Marco', ''], ['Notari', 'Roberto', ''], ['Antonacci', 'Fabio', ''], ['Sarti', 'Augusto', '']]","['Source localization', 'range differences', 'statistical modeling', 'parameters estimation']"
14331,1705.05551,Katsunari Shibata,Katsunari Shibata and Yuki Goto,"New Reinforcement Learning Using a Chaotic Neural Network for Emergence
  of ""Thinking"" - ""Exploration"" Grows into ""Thinking"" through Learning -","The Multi-disciplinary Conference on Reinforcement Learning and
  Decision Making (RLDM) 2017, 5 pages, 6 figures",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Expectation for the emergence of higher functions is getting larger in the
framework of end-to-end reinforcement learning using a recurrent neural
network. However, the emergence of ""thinking"" that is a typical higher function
is difficult to realize because ""thinking"" needs non fixed-point, flow-type
attractors with both convergence and transition dynamics. Furthermore, in order
to introduce ""inspiration"" or ""discovery"" in ""thinking"", not completely random
but unexpected transition should be also required.
  By analogy to ""chaotic itinerancy"", we have hypothesized that ""exploration""
grows into ""thinking"" through learning by forming flow-type attractors on
chaotic random-like dynamics. It is expected that if rational dynamics are
learned in a chaotic neural network (ChNN), coexistence of rational state
transition, inspiration-like state transition and also random-like exploration
for unknown situation can be realized.
  Based on the above idea, we have proposed new reinforcement learning using a
ChNN as an actor. The positioning of exploration is completely different from
the conventional one. The chaotic dynamics inside the ChNN produces exploration
factors by itself. Since external random numbers for stochastic action
selection are not used, exploration factors cannot be isolated from the output.
Therefore, the learning method is also completely different from the
conventional one.
  At each non-feedback connection, one variable named causality trace takes in
and maintains the input through the connection according to the change in its
output. Using the trace and TD error, the weight is updated.
  In this paper, as the result of a recent simple task to see whether the new
learning works or not, it is shown that a robot with two wheels and two visual
sensors reaches a target while avoiding an obstacle after learning though there
are still many rooms for improvement.
","[{'version': 'v1', 'created': 'Tue, 16 May 2017 06:54:04 GMT'}]",2017-05-17,"[['Shibata', 'Katsunari', ''], ['Goto', 'Yuki', '']]","['thinking', 'chaotic neural network (ChNN)', 'exploration', 'reinforcement learning (RL)', 'function emergence']"
14332,1402.2372,Reena Philips Mrs,"Poornima. U. S., Suma. V, Vasanth Kumar. H","Design Patterns as Quality Influencing Factor in Object Oriented Design
  Approach","4 Pages, 6 Figures",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Object Oriented Design methodology is an emerging software development
approach for complex systems with huge set of requirements. Unlike procedural
approach, it captures the requirements as a set of data rather than services,
encapsulated as a single entity. The success such a project relies on major
factors like design patterns framework, key principles, metric standards and
best practices adapted by the industry. The patterns are key structures for
recursive problem bits in the problem domain. The combination of design
patterns forms a framework which suits the problem statement in hand. The
pattern includes static design and dynamic behavior of different types of
entities which can be mapped as a functional diagram with cardinalities between
them. The degree of cardinality represents the coupling factor which the
industry perceives and measures for software design quality. The organization
specific design principles and rich repository of on-the-shelf patterns are the
major design-quality-influencing-factor contribute to software success. These
are the asset of an industry to deliver a quality product to sustain itself in
the competitive market.
","[{'version': 'v1', 'created': 'Tue, 11 Feb 2014 04:58:01 GMT'}]",2014-02-12,"[['S.', 'Poornima. U.', ''], ['V', 'Suma.', ''], ['H', 'Vasanth Kumar.', '']]","['Modules', 'Solution-domain', 'Design Quality', 'Patterns', 'MVC', 'Cohesion and Coupling;']"
14333,1610.09079,Taras Lakoba,"Taras I. Lakoba, Zihao Deng","Stability analysis of the numerical Method of characteristics applied to
  a class of energy-preserving systems. Part I: Periodic boundary conditions","20 pages, 5 figures",,,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study numerical (in)stability of the Method of characteristics (MoC)
applied to a system of non-dissipative hyperbolic partial differential
equations (PDEs) with periodic boundary conditions. We consider three different
solvers along the characteristics: simple Euler (SE), modified Euler (ME), and
Leap-frog (LF). The two former solvers are well known to exhibit a mild, but
unconditional, numerical instability for non-dissipative ordinary differential
equations (ODEs). They are found to have a similar (or stronger, for the
MoC-ME) instability when applied to non-dissipative PDEs. On the other hand,
the LF solver is known to be stable when applied to non-dissipative ODEs.
However, when applied to non-dissipative PDEs within the MoC framework, it was
found to have by far the strongest instability among all three solvers. We also
comment on the use of the fourth-order Runge--Kutta solver within the MoC
framework.
","[{'version': 'v1', 'created': 'Fri, 28 Oct 2016 04:29:38 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Jul 2017 18:21:32 GMT'}]",2017-07-31,"[['Lakoba', 'Taras I.', ''], ['Deng', 'Zihao', '']]","['Method of characteristics', 'Coupled-wave equations', 'Numerical instability']"
14334,2007.05667,Sara Elkerdawy,"Sara Elkerdawy, Mostafa Elhoushi, Abhineet Singh, Hong Zhang and
  Nilanjan Ray","To Filter Prune, or to Layer Prune, That Is The Question",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advances in pruning of neural networks have made it possible to remove
a large number of filters or weights without any perceptible drop in accuracy.
The number of parameters and that of FLOPs are usually the reported metrics to
measure the quality of the pruned models. However, the gain in speed for these
pruned models is often overlooked in the literature due to the complex nature
of latency measurements. In this paper, we show the limitation of filter
pruning methods in terms of latency reduction and propose LayerPrune framework.
LayerPrune presents a set of layer pruning methods based on different criteria
that achieve higher latency reduction than filter pruning methods on similar
accuracy. The advantage of layer pruning over filter pruning in terms of
latency reduction is a result of the fact that the former is not constrained by
the original model's depth and thus allows for a larger range of latency
reduction. For each filter pruning method we examined, we use the same filter
importance criterion to calculate a per-layer importance score in one-shot. We
then prune the least important layers and fine-tune the shallower model which
obtains comparable or better accuracy than its filter-based pruning
counterpart. This one-shot process allows to remove layers from single path
networks like VGG before fine-tuning, unlike in iterative filter pruning, a
minimum number of filters per layer is required to allow for data flow which
constraint the search space. To the best of our knowledge, we are the first to
examine the effect of pruning methods on latency metric instead of FLOPs for
multiple networks, datasets and hardware targets. LayerPrune also outperforms
handcrafted architectures such as Shufflenet, MobileNet, MNASNet and ResNet18
by 7.3%, 4.6%, 2.8% and 0.5% respectively on similar latency budget on ImageNet
dataset.
","[{'version': 'v1', 'created': 'Sat, 11 Jul 2020 02:51:40 GMT'}, {'version': 'v2', 'created': 'Sun, 11 Oct 2020 20:53:28 GMT'}, {'version': 'v3', 'created': 'Sun, 8 Nov 2020 17:48:23 GMT'}]",2020-11-10,"[['Elkerdawy', 'Sara', ''], ['Elhoushi', 'Mostafa', ''], ['Singh', 'Abhineet', ''], ['Zhang', 'Hong', ''], ['Ray', 'Nilanjan', '']]","['CNN pruning', 'layer pruning', 'filter pruning', 'latency metric']"
14335,1505.06661,Syama Sundar Rangapuram,"Syama Sundar Rangapuram, Thomas B\""uhler and Matthias Hein","Towards Realistic Team Formation in Social Networks based on Densest
  Subgraphs",Technical report of paper accepted at WWW 2013,,,,cs.SI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a task $\mathcal{T}$, a set of experts $V$ with multiple skills and a
social network $G(V, W)$ reflecting the compatibility among the experts, team
formation is the problem of identifying a team $C \subseteq V$ that is both
competent in performing the task $\mathcal{T}$ and compatible in working
together. Existing methods for this problem make too restrictive assumptions
and thus cannot model practical scenarios. The goal of this paper is to
consider the team formation problem in a realistic setting and present a novel
formulation based on densest subgraphs. Our formulation allows modeling of many
natural requirements such as (i) inclusion of a designated team leader and/or a
group of given experts, (ii) restriction of the size or more generally cost of
the team (iii) enforcing locality of the team, e.g., in a geographical sense or
social sense, etc.
  The proposed formulation leads to a generalized version of the classical
densest subgraph problem with cardinality constraints (DSP), which is an NP
hard problem and has many applications in social network analysis. In this
paper, we present a new method for (approximately) solving the generalized DSP
(GDSP). Our method, FORTE, is based on solving an equivalent continuous
relaxation of GDSP. The solution found by our method has a quality guarantee
and always satisfies the constraints of GDSP. Experiments show that the
proposed formulation (GDSP) is useful in modeling a broader range of team
formation problems and that our method produces more coherent and compact teams
of high quality. We also show, with the help of an LP relaxation of GDSP, that
our method gives close to optimal solutions to GDSP.
","[{'version': 'v1', 'created': 'Mon, 25 May 2015 15:17:46 GMT'}]",2015-05-26,"[['Rangapuram', 'Syama Sundar', ''], ['Bühler', 'Thomas', ''], ['Hein', 'Matthias', '']]","['Team formation', 'Social networks', 'Densest subgraphs']"
14336,1407.6655,Jerome Delatour,"Fr\'ed\'eric Thomas (LISE), J\'er\^ome Delatour, Fran\c{c}ois Terrier
  (LIST), Matthias Brun, S\'ebastien G\'erard","Contribution \`a la mod\'elisation explicite des plates-formes
  d'ex\'ecution pour l'IDM","23 pages, in French","L'Objet, logiciel, base de donn\'ees, r\'eseaux (RSTI s\'erie) 13,
  4 (2007) 9-31",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One foundation of the model driven engineering (MDE) is to separate the
modelling application description from its technological implementation (i.e.
platform). Some of them are dedicated to the system execution. Hence, one
promise solution of the MDE is to automate transformations from platform
independent models to platform specific models. Little work has explicitly
described platform characteristics. Yet, an explicit modelling allows taking in
account their characteristics more easily (par ex., performances,
maintainability,portability). This paper presents both an execution platform
modelling state of art and a pattern to describe execution platform modelling
framework. It intends to confirm the feasibility and the interests in
describing an execution platform metamodel.
","[{'version': 'v1', 'created': 'Thu, 24 Jul 2014 17:23:49 GMT'}]",2014-07-25,"[['Thomas', 'Frédéric', '', 'LISE'], ['Delatour', 'Jérôme', '', 'LIST'], ['Terrier', 'François', '', 'LIST'], ['Brun', 'Matthias', ''], ['Gérard', 'Sébastien', '']]","['Model driven Engineering', 'execution platform', 'SRM']"
14337,1106.2305,Linh Anh Nguyen D.Sc.,Linh Anh Nguyen,"Cut-Free ExpTime Tableaux for Checking Satisfiability of a Knowledge
  Base in the Description Logic SHI","a long version of the paper ""Linh Anh Nguyen. A Cut-Free ExpTime
  Tableau Decision Procedure for the Description Logic SHI. In Proceedings of
  ICCCI'2011, LNAI 6922, pages 572-581, Springer-Verlag, 2011"", 27 pages",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give the first cut-free ExpTime (optimal) tableau decision procedure for
checking satisfiability of a knowledge base in the description logic SHI, which
extends the description logic ALC with transitive roles, inverse roles and role
hierarchies.
","[{'version': 'v1', 'created': 'Sun, 12 Jun 2011 12:07:18 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Jul 2012 11:58:10 GMT'}]",2012-07-17,"[['Nguyen', 'Linh Anh', '']]","['description logics', 'automated reasoning', 'tableaux', 'globalcaching']"
14338,1712.06919,Rafael Crescenzi,"Rafael Crescenzi, Marcelo Fernandez, Federico A. Garcia Calabria,
  Pablo Albani, Diego Tauziet, Adriana Baravalle, Andr\'es Sebasti\'an
  D'Ambrosio (Austral University)","A Production Oriented Approach for Vandalism Detection in Wikidata - The
  Buffaloberry Vandalism Detector at WSDM Cup 2017","Vandalism Detector at WSDM Cup 2017, see arXiv:1712.05956",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wikidata is a free and open knowledge base from the Wikimedia Foundation,
that not only acts as a central storage of structured data for other projects
of the organization, but also for a growing array of information systems,
including search engines. Like Wikipedia, Wikidata's content can be created and
edited by anyone; which is the main source of its strength, but also allows for
malicious users to vandalize it, risking the spreading of misinformation
through all the systems that rely on it as a source of structured facts. Our
task at the WSDM Cup 2017 was to come up with a fast and reliable prediction
system that narrows down suspicious edits for human revision. Elaborating on
previous works by Heindorf et al. we were able to outperform all other
contestants, while incorporating new interesting features, unifying the
programming language used to only Python and refactoring the feature extractor
into a simpler and more compact code base.
","[{'version': 'v1', 'created': 'Tue, 19 Dec 2017 13:39:37 GMT'}]",2017-12-20,"[['Crescenzi', 'Rafael', '', 'Austral University'], ['Fernandez', 'Marcelo', '', 'Austral University'], ['Calabria', 'Federico A. Garcia', '', 'Austral University'], ['Albani', 'Pablo', '', 'Austral University'], ['Tauziet', 'Diego', '', 'Austral University'], ['Baravalle', 'Adriana', '', 'Austral University'], [""D'Ambrosio"", 'Andrés Sebastián', '', 'Austral University']]","['Knowledge Base', 'Vandalism', 'Wikidata']"
14339,1606.03507,Tahir Hameed,Tahir Hameed and Bobby Swar,Social value and information quality in online health information search,"Research-in-progress ISBN# 978-0-646-95337-3 Presented at the
  Australasian Conference on Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/196,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper extends and validates a model of value-driven online healthcare
information search in online shared contexts. Perceived value is an important
factor behind users' decisions concerning search, consumption and reuse of
products and services. The role of utilitarian, hedonic and epistemic value of
information in user satisfaction and intention to repeat online search is well
recognized, but little support has been found for social value affecting user
satisfaction critical for such decisions. Therefore, a value-based model of
online healthcare information search was extended adding detailed information
quality measures. Our survey data collected from 143 college going students
from more than 10 countries studying in South Korea demonstrated two novel
results. At first, unlike existing studies, strong support was found for
perceived social value affecting the user satisfaction. As a second substantial
finding, the significance of social value could only be appreciated by using
comprehensive constructs of information quality than simpler measures.
Therefore, this study shows for social and shared HIS, users consider access,
representation and context quality of healthcare information to be more
important from social perspective than intrinsic (or content) quality.
Therefore, developers and healthcare organizations interested in traction of
their online healthcare information delivery systems (HIS), especially those
using internet and social media networks, should focus on enhancing information
quality of their systems accordingly.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 00:12:51 GMT'}]",2016-06-14,"[['Hameed', 'Tahir', ''], ['Swar', 'Bobby', '']]","['Healthcare information systems', 'Online health information search', 'Information quality', 'Information Value', 'Social value', 'Information sharing']"
14340,1208.4475,Greg Ver Steeg,Greg Ver Steeg and Aram Galstyan,Information-Theoretic Measures of Influence Based on Content Dynamics,"10 pages, 10 figures. In Proceedings of the 6th International
  Conference on Web Search and Data Mining. (v2: title change, v3: minor edits)",,,,cs.SI physics.soc-ph stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The fundamental building block of social influence is for one person to
elicit a response in another. Researchers measuring a ""response"" in social
media typically depend either on detailed models of human behavior or on
platform-specific cues such as re-tweets, hash tags, URLs, or mentions. Most
content on social networks is difficult to model because the modes and
motivation of human expression are diverse and incompletely understood. We
introduce content transfer, an information-theoretic measure with a predictive
interpretation that directly quantifies the strength of the effect of one
user's content on another's in a model-free way. Estimating this measure is
made possible by combining recent advances in non-parametric entropy estimation
with increasingly sophisticated tools for content representation. We
demonstrate on Twitter data collected for thousands of users that content
transfer is able to capture non-trivial, predictive relationships even for
pairs of users not linked in the follower or mention graph. We suggest that
this measure makes large quantities of previously under-utilized social media
content accessible to rigorous statistical causal analysis.
","[{'version': 'v1', 'created': 'Wed, 22 Aug 2012 11:05:28 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Sep 2012 16:30:50 GMT'}, {'version': 'v3', 'created': 'Sun, 2 Dec 2012 22:45:41 GMT'}, {'version': 'v4', 'created': 'Fri, 15 Feb 2013 21:03:51 GMT'}]",2013-02-19,"[['Steeg', 'Greg Ver', ''], ['Galstyan', 'Aram', '']]","['entropy', 'link prediction', 'causality', 'social networks']"
14341,1212.2071,Youssef Bassil,Youssef Bassil,A Data Warehouse Design for a Typical University Information System,"LACSC - Lebanese Association for Computational Sciences,
  http://www.lacsc.org","Journal of Computer Science & Research (JCSCR), vol. 1, no. 6, pp.
  12-17, 2012",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Presently, large enterprises rely on database systems to manage their data
and information. These databases are useful for conducting daily business
transactions. However, the tight competition in the marketplace has led to the
concept of data mining in which data are analyzed to derive effective business
strategies and discover better ways in carrying out business. In order to
perform data mining, regular databases must be converted into what so called
informational databases also known as data warehouse. This paper presents a
design model for building data warehouse for a typical university information
system. It is based on transforming an operational database into an
informational warehouse useful for decision makers to conduct data analysis,
predication, and forecasting. The proposed model is based on four stages of
data migration: Data extraction, data cleansing, data transforming, and data
indexing and loading. The complete system is implemented under MS Access 2010
and is meant to serve as a repository of data for data mining operations.
","[{'version': 'v1', 'created': 'Mon, 10 Dec 2012 14:09:03 GMT'}]",2012-12-11,"[['Bassil', 'Youssef', '']]","['Data Warehouse', 'DBMS', 'Data Mining', 'Information System']"
14342,1410.0310,Alexey Milovanov,Alexey Milovanov,Some properties of antistochastic strings,"18 pages, 2 figures. Presented at CSR'2015, Yandex Best Student Paper
  Award",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Antistochastic strings are those strings that lack any reasonable statistical
explanations. We establish the follow property of such strings: every
absolutely non-stochastic string $x$ is ""holographic"" in the sense that it can
be restored by a short program from any its part whose length equals the
Kolmogorov complexity of $x$. Further we will show how it can be used for list
decoding from erasing and for prove that symmetry of information fails for
total conditional complexity.
","[{'version': 'v1', 'created': 'Fri, 12 Sep 2014 22:04:15 GMT'}, {'version': 'v2', 'created': 'Sat, 13 Dec 2014 18:22:15 GMT'}, {'version': 'v3', 'created': 'Fri, 27 Nov 2015 18:32:18 GMT'}, {'version': 'v4', 'created': 'Wed, 9 Mar 2016 21:44:55 GMT'}]",2016-03-11,"[['Milovanov', 'Alexey', '']]","['Kolmogorov complexity', 'algorithmic statistics', 'stochasticstrings', 'total conditional complexity', 'symmetry of information']"
14343,0908.0660,Laurent Jacques,Laurent Jacques,A Short Note on Compressed Sensing with Partially Known Signal Support,,,,TR-LJ-2009.02,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This short note studies a variation of the Compressed Sensing paradigm
introduced recently by Vaswani et al., i.e. the recovery of sparse signals from
a certain number of linear measurements when the signal support is partially
known. The reconstruction method is based on a convex minimization program
coined ""innovative Basis Pursuit DeNoise"" (or iBPDN). Under the common
$\ell_2$-fidelity constraint made on the available measurements, this
optimization promotes the ($\ell_1$) sparsity of the candidate signal over the
complement of this known part. In particular, this paper extends the results of
Vaswani et al. to the cases of compressible signals and noisy measurements. Our
proof relies on a small adaption of the results of Candes in 2008 for
characterizing the stability of the Basis Pursuit DeNoise (BPDN) program. We
emphasize also an interesting link between our method and the recent work of
Davenport et al. on the $\delta$-stable embeddings and the
""cancel-then-recover"" strategy applied to our problem. For both approaches,
reconstructions are indeed stabilized when the sensing matrix respects the
Restricted Isometry Property for the same sparsity order. We conclude by
sketching an easy numerical method relying on monotone operator splitting and
proximal methods that iteratively solves iBPDN.
","[{'version': 'v1', 'created': 'Wed, 5 Aug 2009 12:46:59 GMT'}, {'version': 'v2', 'created': 'Sun, 21 Feb 2010 21:05:31 GMT'}]",2010-02-21,"[['Jacques', 'Laurent', '']]","['Sparse Signal Recovery', 'Compressed Sensing', 'Convex Optimization', 'Instance Optimality']"
14344,1306.1334,Hitesh Chhinkaniwala,Hitesh Chhinkaniwala and Sanjay Garg,"Tuple Value Based Multiplicative Data Perturbation Approach To Preserve
  Privacy In Data Stream Mining","International Journal of Data Mining & Knowledge Management Process
  (IJDKP) 9 pages","International Journal of Data Mining & Knowledge Management
  Process (IJDKP) Vol.3, No.3, May 2013",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Huge volume of data from domain specific applications such as medical,
financial, library, telephone, shopping records and individual are regularly
generated. Sharing of these data is proved to be beneficial for data mining
application. On one hand such data is an important asset to business decision
making by analyzing it. On the other hand data privacy concerns may prevent
data owners from sharing information for data analysis. In order to share data
while preserving privacy, data owner must come up with a solution which
achieves the dual goal of privacy preservation as well as an accuracy of data
mining task - clustering and classification. An efficient and effective
approach has been proposed that aims to protect privacy of sensitive
information and obtaining data clustering with minimum information loss.
","[{'version': 'v1', 'created': 'Thu, 6 Jun 2013 08:15:22 GMT'}]",2013-06-07,"[['Chhinkaniwala', 'Hitesh', ''], ['Garg', 'Sanjay', '']]","['Data Perturbation', 'Data Stream', 'Data Stream Clustering', 'Precision', 'Recall']"
14345,1502.04250,Enrique Ordu\~na-Malea,"Enrique Orduna-Malea, Daniel Torres-Salinas and Emilio Delgado
  Lopez-Cozar","Hyperlinks embedded in Twitter as a proxy for total external inlinks to
  international university websites","38 pages, 5 figures and 8 tables",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article analyzes Twitter as a potential alternative source of external
links for use in webometric analysis because of its capacity to embed
hyperlinks in different tweets. Given the limitations on searching Twitter's
public API, we decided to use the Topsy search engine as a source for compiling
tweets. To this end, we took a global sample of 200 universities and compiled
all the tweets with hyperlinks to any of these institutions. Further link data
was obtained from alternative sources (MajesticSEO and OpenSiteExplorer) in
order to compare the results. Thereafter, various statistical tests were
performed to determine the correlation between the indicators and the ability
to predict external links from the collected tweets. The results indicate a
high volume of tweets, although they are skewed by the presence and performance
of specific universities and countries. The data provided by Topsy correlated
significantly with all link indicators, particularly with OpenSiteExplorer
(r=0.769). Finally, prediction models do not provide optimum results because of
high error rates, which fall slightly in nonlinear models applied to specific
environments. We conclude that the use of Twitter (via Topsy) as a source of
hyperlinks to universities produces promising results due to its high
correlation with link indicators, though limited by policies and culture
regarding use and presence in social networks.
","[{'version': 'v1', 'created': 'Sat, 14 Feb 2015 21:50:57 GMT'}]",2015-02-17,"[['Orduna-Malea', 'Enrique', ''], ['Torres-Salinas', 'Daniel', ''], ['Lopez-Cozar', 'Emilio Delgado', '']]","['Universities', 'Webometrics', 'Link analysis', 'Twitter', 'Topsy', 'Web visibility', 'Prediction model']"
14346,1505.01888,Waldemar Koczkodaj Prof.,"M.W. Herman, W.W. Koczkodaj",A Monte Carlo Study of Pairwise Comparisons,,Information Processing Letters 57 (1996) 25-29,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consistent approximations obtained by geometric means ($GM$) and the
principal eigenvector ($EV$), turned out to be close enough for 1,000,000
not-so-inconsistent pairwise comparisons matrices. In this respect both methods
are accurate enough for most practical applications. As the enclosed Table 1
demonstrates, the biggest difference between average deviations of $GM$ and
$EV$ solutions is 0.00019 for the Euclidean metric and 0.00355 for the
Tchebychev metric.
  For practical applications, this precision is far better than expected. After
all we are talking, in most cases, about relative subjective comparisons and
one tenth of a percent is usually below our threshold of perception.
","[{'version': 'v1', 'created': 'Thu, 7 May 2015 23:12:02 GMT'}]",2015-05-11,"[['Herman', 'M. W.', ''], ['Koczkodaj', 'W. W.', '']]","['Monte Carlo method', 'knowledge acquisition', 'pairwise comparisons', 'inconsistency analysis', 'experts’ opinions', 'solution accuracy']"
14347,1008.0064,Anwitaman Datta,Frederique Oggier and Anwitaman Datta,Self-repairing Homomorphic Codes for Distributed Storage Systems,,"Infocom 2011, The 30th IEEE International Conference on Computer
  Communications",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Erasure codes provide a storage efficient alternative to replication based
redundancy in (networked) storage systems. They however entail high
communication overhead for maintenance, when some of the encoded fragments are
lost and need to be replenished. Such overheads arise from the fundamental need
to recreate (or keep separately) first a copy of the whole object before any
individual encoded fragment can be generated and replenished. There has been
recently intense interest to explore alternatives, most prominent ones being
regenerating codes (RGC) and hierarchical codes (HC). We propose as an
alternative a new family of codes to improve the maintenance process, which we
call self-repairing codes (SRC), with the following salient features: (a)
encoded fragments can be repaired directly from other subsets of encoded
fragments without having to reconstruct first the original data, ensuring that
(b) a fragment is repaired from a fixed number of encoded fragments, the number
depending only on how many encoded blocks are missing and independent of which
specific blocks are missing. These properties allow for not only low
communication overhead to recreate a missing fragment, but also independent
reconstruction of different missing fragments in parallel, possibly in
different parts of the network. We analyze the static resilience of SRCs with
respect to traditional erasure codes, and observe that SRCs incur marginally
larger storage overhead in order to achieve the aforementioned properties. The
salient SRC properties naturally translate to low communication overheads for
reconstruction of lost fragments, and allow reconstruction with lower latency
by facilitating repairs in parallel. These desirable properties make
self-repairing codes a good and practical candidate for networked distributed
storage systems.
","[{'version': 'v1', 'created': 'Sat, 31 Jul 2010 07:37:26 GMT'}]",2010-11-24,"[['Oggier', 'Frederique', ''], ['Datta', 'Anwitaman', '']]","['coding', 'networked storage', 'self-repair']"
14348,1504.02651,Lorenzo Clemente Lorenzo Clemente,"Lorenzo Clemente, S{\l}awomir Lasota",Reachability analysis of first-order definable pushdown systems,to appear in CSL'15,,,,cs.FL cs.LO,http://creativecommons.org/licenses/by/4.0/,"  We study pushdown systems where control states, stack alphabet, and
transition relation, instead of being finite, are first-order definable in a
fixed countably-infinite structure. We show that the reachability analysis can
be addressed with the well-known saturation technique for the wide class of
oligomorphic structures. Moreover, for the more restrictive homogeneous
structures, we are able to give concrete complexity upper bounds. We show ample
applicability of our technique by presenting several concrete examples of
homogeneous structures, subsuming, with optimal complexity, known results from
the literature. We show that infinitely many such examples of homogeneous
structures can be obtained with the classical wreath product construction.
","[{'version': 'v1', 'created': 'Fri, 10 Apr 2015 12:14:28 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Jul 2015 09:10:56 GMT'}]",2015-07-20,"[['Clemente', 'Lorenzo', ''], ['Lasota', 'Sławomir', '']]","['automata theory', 'pushdown systems', 'sets with atoms', 'saturation technique']"
14349,1109.0758,Mao Ye,Mao Ye and Xingjie Liu and Wang-Chien Lee,"Exploring Social Influence for Recommendation - A Probabilistic
  Generative Model Approach",,,,,cs.SI cs.IR physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a probabilistic generative model, called unified
model, which naturally unifies the ideas of social influence, collaborative
filtering and content-based methods for item recommendation. To address the
issue of hidden social influence, we devise new algorithms to learn the model
parameters of our proposal based on expectation maximization (EM). In addition
to a single-machine version of our EM algorithm, we further devise a
parallelized implementation on the Map-Reduce framework to process two
large-scale datasets we collect. Moreover, we show that the social influence
obtained from our generative models can be used for group recommendation.
Finally, we conduct comprehensive experiments using the datasets crawled from
last.fm and whrrl.com to validate our ideas. Experimental results show that the
generative models with social influence significantly outperform those without
incorporating social influence. The unified generative model proposed in this
paper obtains the best performance. Moreover, our study on social influence
finds that users in whrrl.com are more likely to get influenced by friends than
those in last.fm. The experimental results also confirm that our social
influence based group recommendation algorithm outperforms the state-of-the-art
algorithms for group recommendation.
","[{'version': 'v1', 'created': 'Sun, 4 Sep 2011 21:15:12 GMT'}]",2011-09-06,"[['Ye', 'Mao', ''], ['Liu', 'Xingjie', ''], ['Lee', 'Wang-Chien', '']]","['Recommender Systems', 'Probabilistic Generative Model', 'Social Networks', 'Social Influence', 'Group Recommendation']"
14350,1610.07231,Nazanin Hashemi,"Nazanin Sadat Hashemi, Roya Babaie Aghdam, Atieh Sadat Bayat Ghiasi
  and Parastoo Fatemi",Template Matching Advances and Applications in Image Analysis,,,,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In most computer vision and image analysis problems, it is necessary to
define a similarity measure between two or more different objects or images.
Template matching is a classic and fundamental method used to score
similarities between objects using certain mathematical algorithms. In this
paper, we reviewed the basic concept of matching, as well as advances in
template matching and applications such as invariant features or novel
applications in medical image analysis. Additionally, deformable models and
templates originating from classic template matching were discussed. These
models have broad applications in image registration, and they are a
fundamental aspect of novel machine vision or deep learning algorithms, such as
convolutional neural networks (CNN), which perform shift and scale invariant
functions followed by classification. In general, although template matching
methods have restrictions which limit their application, they are recommended
for use with other object recognition methods as pre- or post-processing steps.
Combining a template matching technique such as normalized cross-correlation or
dice coefficient with a robust decision-making algorithm yields a significant
improvement in the accuracy rate for object detection and recognition.
","[{'version': 'v1', 'created': 'Sun, 23 Oct 2016 20:48:17 GMT'}]",2016-10-25,"[['Hashemi', 'Nazanin Sadat', ''], ['Aghdam', 'Roya Babaie', ''], ['Ghiasi', 'Atieh Sadat Bayat', ''], ['Fatemi', 'Parastoo', '']]","['Template Matching', 'Image Processing', 'Image Analysis']"
14351,1705.08666,Joel Obstfeld,"Joel Obstfeld, Xiaoyu Chen, Olivier Frebourg and Pavan Sudheendra",Towards Near Real-Time BGP Deep Analysis: A Big-Data Approach,"7 pages, 7 figures, 2 Tables, submitted to ACM Internet Measurement
  Conference 2017",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  BGP (Border Gateway Protocol) serves as the primary routing protocol for the
Internet, enabling Autonomous Systems (individual network operators) to
exchange network reachability information. Alongside significant on-going
research and development efforts, there is a practical need to understand the
nature of events that occur on the Internet.
  Network operators are acutely aware of security-related incidents such as
'Prefix Hijacking' as well as the impact of network instabilities that ripple
through the Internet. Recent research focused on the study of BGP anomalies
(both network/prefix instability and security-related incidents) has been based
on the analysis of historical logs. Further analysis to understand the nature
of these anomalous events is not always sufficient to be able to differentiate
malicious activities, such as prefix- or sub-prefix- hijacking, from those
events caused by inadvertent misconfigurations. In addition, such techniques
are challenged by a lack of sufficient resources to store and process data
feeds in real-time from multiple BGP Vantage Points (VPs).
  In this paper, we present a BGP Deep-analysis application developed using the
PNDA (Platform for Network Data Analytics) 'Big-Data' platform. PNDA provides a
highly scalable environment that enables the ingestion and processing of 'live'
BGP feeds from many vantage points in a schema-agnostic manner. The Apache
Spark-based application, in conjunction with PNDA's distributed processing
capabilities, is able to perform high-level insights as well as
near-to-real-time statistical analysis
","[{'version': 'v1', 'created': 'Wed, 24 May 2017 09:14:42 GMT'}]",2017-05-25,"[['Obstfeld', 'Joel', ''], ['Chen', 'Xiaoyu', ''], ['Frebourg', 'Olivier', ''], ['Sudheendra', 'Pavan', '']]","['Border Gateway Protocol', 'Big-data', 'Anomaly detection', 'Apache Spark', 'Hadoop']"
14352,1402.2536,Amandeep Singh,"Amandeep Singh, Balwinder Singh",Design and Implementation of Bit Transition Counter,International Journal Paper,"Circuits and Systems: An International Journal (CSIJ), Vol. 1, No.
  1, January 2014",,,cs.AR,http://creativecommons.org/licenses/by/3.0/,"  In today VLSI system design, power consumption is gaining more attention as
compared to performance and area. This is due to battery life in portable
devices and operating frequency of the design. Power consumption mainly
consists of static power, dynamic power, leakage power and short circuit power.
Dynamic power is dominant among all which depends on many factors viz. power
supply, load capacitance and frequency. Switching activity also affects dynamic
power consumption of bus which is determined by calculating the number of bit
transitions on bus. The purpose of this paper is to design a bit transition
counter which can be used to calculate the switching activity of the circuit
nodes. The novel feature is that it can be inserted at any node of the circuit,
thus helpful for calculating power consumption of bus.
","[{'version': 'v1', 'created': 'Tue, 11 Feb 2014 15:51:52 GMT'}]",2014-02-12,"[['Singh', 'Amandeep', ''], ['Singh', 'Balwinder', '']]","['Address Generator', 'Bit Transition', 'Linear Feedback Shift Register', 'Switching Activity', 'Test PatternGenerator']"
14353,0709.0370,Damien Chablat,"Ying Wang (DIE), Wei Zhang (DIE), Fouad Bennis (IRCCyN), Damien
  Chablat (IRCCyN)",An Integrated Simulation System for Human Factors Study,,"Dans The Institute of Industrial Engineers Annual Conference - The
  Institute of Industrial Engineers Annual Conference, Orlando : \'Etats-Unis
  d'Am\'erique (2006)",,,cs.HC,,"  It has been reported that virtual reality can be a useful tool for ergonomics
study. The proposed integrated simulation system aims at measuring operator's
performance in an interactive way for 2D control panel design. By incorporating
some sophisticated virtual reality hardware/software, the system allows natural
human-system and/or human-human interaction in a simulated virtual environment;
enables dynamic objective measurement of human performance; and evaluates the
quality of the system design in human factors perspective based on the
measurement. It can also be for operation training for some 2D control panels.
","[{'version': 'v1', 'created': 'Tue, 4 Sep 2007 09:20:03 GMT'}]",2007-09-05,"[['Wang', 'Ying', '', 'DIE'], ['Zhang', 'Wei', '', 'DIE'], ['Bennis', 'Fouad', '', 'IRCCyN'], ['Chablat', 'Damien', '', 'IRCCyN']]","['virtual reality', 'human factors', 'ergonomics', 'simulation', 'manikin']"
14354,1710.01301,Xiao-Shan Gao,Qiao-Long Huang and Xiao-Shan Gao,"Deterministic Interpolation of Sparse Black-box Multivariate Polynomials
  using Kronecker Type Substitutions",,,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose two new deterministic interpolation algorithms for
a sparse multivariate polynomial given as a standard black-box by introducing
new Kronecker type substitutions. Let $f\in \RB[x_1,\dots,x_n]$ be a sparse
black-box polynomial with a degree bound $D$. When $\RB=\C$ or a finite field,
our algorithms either have better bit complexity or better bit complexity in
$D$ than existing deterministic algorithms. In particular, in the case of
deterministic algorithms for standard black-box models, our second algorithm
has the current best complexity in $D$ which is the dominant factor in the
complexity.
","[{'version': 'v1', 'created': 'Tue, 3 Oct 2017 11:38:08 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Aug 2018 07:26:33 GMT'}]",2018-08-09,"[['Huang', 'Qiao-Long', ''], ['Gao', 'Xiao-Shan', '']]","['Sparse polynomial interpolation', 'Kronecker substitution', 'black-box model']"
14355,0801.1307,Chris Pollett,Chris Pollett and Eric Miles,Alternating Hierarchies for Time-Space Tradeoffs,14 pages,,,,cs.CC cs.LO,,"  Nepomnjascii's Theorem states that for all 0 <= \epsilon < 1 and k > 0 the
class of languages recognized in nondeterministic time n^k and space
n^\epsilon, NTISP[n^k, n^\epsilon ], is contained in the linear time hierarchy.
By considering restrictions on the size of the universal quantifiers in the
linear time hierarchy, this paper refines Nepomnjascii's result to give a sub-
hierarchy, Eu-LinH, of the linear time hierarchy that is contained in NP and
which contains NTISP[n^k, n^\epsilon ]. Hence, Eu-LinH contains NL and SC. This
paper investigates basic structural properties of Eu-LinH. Then the
relationships between Eu-LinH and the classes NL, SC, and NP are considered to
see if they can shed light on the NL = NP or SC = NP questions. Finally, a new
hierarchy, zeta -LinH, is defined to reduce the space requirements needed for
the upper bound on Eu-LinH.
","[{'version': 'v1', 'created': 'Tue, 8 Jan 2008 19:59:05 GMT'}]",2008-01-09,"[['Pollett', 'Chris', ''], ['Miles', 'Eric', '']]","['structural complexity', 'linear time hierarchy', 'Nepomnjaˇsˇciˇı’s Theorem']"
14356,1704.03286,Yuan Ziyang,Ziyang Yuan and Qi Wang and Hongxia Wang,Phase Retrieval via Sparse Wirtinger Flow,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Phase retrieval(PR) problem is a kind of ill-condition inverse problem which
can be found in various of applications. Utilizing the sparse priority, an
algorithm called SWF(Sparse Wirtinger Flow) is proposed in this paper to deal
with sparse PR problem based on the Wirtinger flow method. SWF firstly recovers
the support of the signal and then updates the evaluation by hard thresholding
method with an elaborate initialization. Theoretical analyses show that SWF has
a geometric convergence for any $k$ sparse $n$ length signal with the sampling
complexity $\mathcal{O}(k^2\mathrm{log}n)$. To get $\varepsilon$ accuracy, the
computational complexity of SWF is
$\mathcal{O}(k^3n\mathrm{log}n\mathrm{log}\frac{1}{\varepsilon})$.
  Numerical tests also demonstrate that SWF performs better than
state-of-the-art methods especially when we have no priori knowledge about
sparsity $k$. Moreover, SWF is also robust to the noise
","[{'version': 'v1', 'created': 'Tue, 11 Apr 2017 13:44:46 GMT'}]",2017-04-12,"[['Yuan', 'Ziyang', ''], ['Wang', 'Qi', ''], ['Wang', 'Hongxia', '']]","['sparse phase retrieval', 'Wirtinger flow', 'gradient descent', 'hard thresholding']"
14357,1502.05773,Pradeep Kr. Banerjee,Pradeep Kr. Banerjee,"Multipartite Monotones for Secure Sampling by Public Discussion From
  Noisy Correlations","6 pages, 2 figures, v2: Improved readability",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the problem of quantifying the cryptographic content of
probability distributions, in relation to an application to secure multi-party
sampling against a passive t-adversary. We generalize a recently introduced
notion of assisted common information of a pair of correlated sources to that
of K sources and define a family of monotone rate regions indexed by K. This
allows for a simple characterization of all t-private distributions that can be
statistically securely sampled without any auxiliary setup of pre-shared noisy
correlations. We also give a new monotone called the residual total correlation
that admits a simple operational interpretation. Interestingly, for sampling
with non-trivial setups (K > 2) in the public discussion model, our definition
of a monotone region differs from the one by Prabhakaran and Prabhakaran (ITW
2012).
","[{'version': 'v1', 'created': 'Fri, 20 Feb 2015 04:58:53 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Apr 2015 07:53:47 GMT'}]",2015-04-21,"[['Banerjee', 'Pradeep Kr.', '']]","['assisted common information', 'monotones', 'unconditional security', 'secure multi-party sampling']"
14358,0806.2548,Frederic Goualard,"Fr\'ed\'eric Goualard (LINA), Alexandre Goldsztejn (LINA)","A Data-Parallel Algorithm to Reliably Solve Systems of Nonlinear
  Equations",10 pages,,,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Numerical methods based on interval arithmetic are efficient means to
reliably solve nonlinear systems of equations. Algorithm bc3revise is an
interval method that tightens variables' domains by enforcing a property called
box consistency. It has been successfully used on difficult problems whose
solving eluded traditional numerical methods. We present a new algorithm to
enforce box consistency that is simpler than bc3revise, faster, and easily data
parallelizable. A parallel implementation with Intel SSE2 SIMD instructions
shows that an increase in performance of up to an order of magnitude and more
is achievable.
","[{'version': 'v1', 'created': 'Mon, 16 Jun 2008 11:40:07 GMT'}]",2008-12-18,"[['Goualard', 'Frédéric', '', 'LINA'], ['Goldsztejn', 'Alexandre', '', 'LINA']]","['nonlinear equations', 'interval arithmetic', 'SIMD algorithm']"
14359,1110.2096,Philipp Herrmann,"Philipp N. Herrmann, Dennis O. Kundisch, Mohammad S. Rahman","Beating Irrationality: Does Delegating to IT Alleviate the Sunk Cost
  Effect?",,,,,cs.HC cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this research, we investigate the impact of delegating decision making to
information technology (IT) on an important human decision bias - the sunk cost
effect. To address our research question, we use a unique and very rich dataset
containing actual market transaction data for approximately 7,000 pay-per-bid
auctions. Thus, unlike previous studies that are primarily laboratory
experiments, we investigate the effects of using IT on the proneness to a
decision bias in real market transactions. We identify and analyze irrational
decision scenarios of auction participants. We find that participants with a
higher monetary investment have an increased likelihood of violating the
assumption of rationality, due to the sunk cost effect. Interestingly, after
controlling for monetary investments, participants who delegate their decision
making to IT and, consequently, have comparably lower behavioral investments
(e.g., emotional attachment, effort, time) are less prone to the sunk cost
effect. In particular, delegation to IT reduces the impact of overall
investments on the sunk cost effect by approximately 50%.
","[{'version': 'v1', 'created': 'Mon, 10 Oct 2011 16:23:18 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Apr 2012 15:34:53 GMT'}]",2012-04-04,"[['Herrmann', 'Philipp N.', ''], ['Kundisch', 'Dennis O.', ''], ['Rahman', 'Mohammad S.', '']]","['Internet Markets', 'Delegating to IT', 'Sunk Cost Effect', 'Economics of Automated Agents', 'Decision Support Systems', 'Decision Bias']"
14360,1408.0102,Sandeep Kumar,"Sandeep Kumar, Vivek Kumar Sharma, Rajani Kumari",Randomized Memetic Artificial Bee Colony Algorithm,arXiv admin note: text overlap with arXiv:1407.5574,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Artificial Bee Colony (ABC) optimization algorithm is one of the recent
population based probabilistic approach developed for global optimization. ABC
is simple and has been showed significant improvement over other Nature
Inspired Algorithms (NIAs) when tested over some standard benchmark functions
and for some complex real world optimization problems. Memetic Algorithms also
become one of the key methodologies to solve the very large and complex
real-world optimization problems. The solution search equation of Memetic ABC
is based on Golden Section Search and an arbitrary value which tries to balance
exploration and exploitation of search space. But still there are some chances
to skip the exact solution due to its step size. In order to balance between
diversification and intensification capability of the Memetic ABC, it is
randomized the step size in Memetic ABC. The proposed algorithm is named as
Randomized Memetic ABC (RMABC). In RMABC, new solutions are generated nearby
the best so far solution and it helps to increase the exploitation capability
of Memetic ABC. The experiments on some test problems of different complexities
and one well known engineering optimization application show that the proposed
algorithm outperforms over Memetic ABC (MeABC) and some other variant of ABC
algorithm(like Gbest guided ABC (GABC),Hooke Jeeves ABC (HJABC), Best-So-Far
ABC (BSFABC) and Modified ABC (MABC) in case of almost all the problems.
","[{'version': 'v1', 'created': 'Fri, 1 Aug 2014 08:49:25 GMT'}]",2014-10-15,"[['Kumar', 'Sandeep', ''], ['Sharma', 'Vivek Kumar', ''], ['Kumari', 'Rajani', '']]","['Artificial Bee Colony Algorithm', 'Memetic Computing', 'Swarm Intelligence', 'Nature Inspired']"
14361,1106.6267,Nikolaos Triantafyllou,"Katerina Ksystra, Konstantinos Barlas, Nikolaos Triantafyllou and
  Petros Stefaneas",A Dynamic Algebraic Specification for Social Networks,"8 apges, 1 figure, 5 tables",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the help of the Internet, social networks have grown rapidly. This has
increased security requirements. We present a formalization of social networks
as composite behavioral objects, defined using the Observational Transition
System (OTS) approach. Our definition is then translated to the OTS/CafeOBJ
algebraic specification methodology. This translation allows the formal
verification of safety properties for social networks via the Proof Score
method. Finally, using this methodology we formally verify some security
properties.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2011 10:22:20 GMT'}]",2011-07-01,"[['Ksystra', 'Katerina', ''], ['Barlas', 'Konstantinos', ''], ['Triantafyllou', 'Nikolaos', ''], ['Stefaneas', 'Petros', '']]","['social networks', 'formal methods', 'algebraic specifications', 'CafeOBJ', 'OTS', 'proof scores', 'behavioral object composition']"
14362,1410.3942,Niharika  Sachdeva,Ponnurangam Kumaraguru and Niharika Sachdeva,"Privacy4ICTD in India: Exploring Perceptions, Attitudes and Awareness
  about ICT Use",,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several ICT studies give anecdotal evidences showing privacy to be an area of
concern that can influence adoption of technology in the developing world.
However, in-depth understanding of end users' privacy attitudes and awareness
is largely unexplored in developing countries such as India. We conducted a
survey with 10,427 Indian citizens to bring forth various insights on privacy
expectations and perceptions of end users. Our study explores end-users'
privacy expectations on three ICT platforms - mobile phones, OSN (Online Social
Network), and government projects. Our results, though preliminary, show that
users disproportionately consider financial details as personal information in
comparison to medical records. Users heavily use mobile phones to store
personal details and show high trust in mobile service providers for protecting
the private data. However, users show concerns that mobile service provider may
allow improper access of their personal information to third parties and
government. We also find that female participants in the study were marginally
more conscious of their privacy than males. To the best of our knowledge, this
work presents the largest privacy study which benchmarks privacy perceptions
among Indian citizens. Understanding users' privacy perceptions can help
improve technology adoption and develop policies and laws for improving
technology experience and enabling development for a better life in India.
","[{'version': 'v1', 'created': 'Wed, 15 Oct 2014 06:57:44 GMT'}]",2014-10-16,"[['Kumaraguru', 'Ponnurangam', ''], ['Sachdeva', 'Niharika', '']]","['Privacy', 'ICT usage', 'mobile phones', 'Online Social Network', 'government']"
14363,1702.06858,Hugo Gimbert,"Mikolaj Boja\'nczyk, Hugo Gimbert (LaBRI), Edon Kelmendi (LaBRI)",Emptiness of zero automata is decidable,,,,,cs.FL cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Zero automata are a probabilistic extension of parity automata on infinite
trees. The satisfiability of a certain probabilistic variant of mso, called
tmso + zero, reduces to the emptiness problem for zero automata. We introduce a
variant of zero automata called nonzero automata. We prove that for every zero
automaton there is an equivalent nonzero automaton of quadratic size and the
emptiness problem of nonzero automata is decidable and both in NP and in coNP.
These results imply that tmso + zero has decidable satisfiability.
","[{'version': 'v1', 'created': 'Wed, 22 Feb 2017 15:39:12 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Mar 2017 08:07:06 GMT'}]",2017-03-29,"[['Bojańczyk', 'Mikolaj', '', 'LaBRI'], ['Gimbert', 'Hugo', '', 'LaBRI'], ['Kelmendi', 'Edon', '', 'LaBRI']]","['tree automata', 'probabilistic automata', 'monadic second-order logic']"
14364,1504.05353,Ryo Kikuchi,"Dai Ikarashi, Ryo Kikuchi, Koji Chida, Katsumi Takahashi",k-anonymous Microdata Release via Post Randomisation Method,"22 pages, 4 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of the release of anonymized microdata is an important topic in
the fields of statistical disclosure control (SDC) and privacy preserving data
publishing (PPDP), and yet it remains sufficiently unsolved. In these research
fields, k-anonymity has been widely studied as an anonymity notion for mainly
deterministic anonymization algorithms, and some probabilistic relaxations have
been developed. However, they are not sufficient due to their limitations,
i.e., being weaker than the original k-anonymity or requiring strong parametric
assumptions. First we propose Pk-anonymity, a new probabilistic k-anonymity,
and prove that Pk-anonymity is a mathematical extension of k-anonymity rather
than a relaxation. Furthermore, Pk-anonymity requires no parametric
assumptions. This property has a significant meaning in the viewpoint that it
enables us to compare privacy levels of probabilistic microdata release
algorithms with deterministic ones. Second, we apply Pk-anonymity to the post
randomization method (PRAM), which is an SDC algorithm based on randomization.
PRAM is proven to satisfy Pk-anonymity in a controlled way, i.e, one can
control PRAM's parameter so that Pk-anonymity is satisfied. On the other hand,
PRAM is also known to satisfy ${\varepsilon}$-differential privacy, a recent
popular and strong privacy notion. This fact means that our results
significantly enhance PRAM since it implies the satisfaction of both important
notions: k-anonymity and ${\varepsilon}$-differential privacy.
","[{'version': 'v1', 'created': 'Tue, 21 Apr 2015 09:34:07 GMT'}]",2015-04-22,"[['Ikarashi', 'Dai', ''], ['Kikuchi', 'Ryo', ''], ['Chida', 'Koji', ''], ['Takahashi', 'Katsumi', '']]","['Post Randomization Method (PRAM)', 'k-anonymity', 'differential privacy']"
14365,1607.00509,Evangelos Psomakelis Mr,"Evangelos Psomakelis, Fotis Aisopos, Antonios Litke, Konstantinos
  Tserpes, Magdalini Kardara, Pablo Mart\'inez Campo","Big IoT and social networking data for smart cities: Algorithmic
  improvements on Big Data Analysis in the context of RADICAL city applications",Conference,,,,cs.CY cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a SOA (Service Oriented Architecture)-based
platform, enabling the retrieval and analysis of big datasets stemming from
social networking (SN) sites and Internet of Things (IoT) devices, collected by
smart city applications and socially-aware data aggregation services. A large
set of city applications in the areas of Participating Urbanism, Augmented
Reality and Sound-Mapping throughout participating cities is being applied,
resulting into produced sets of millions of user-generated events and online SN
reports fed into the RADICAL platform. Moreover, we study the application of
data analytics such as sentiment analysis to the combined IoT and SN data saved
into an SQL database, further investigating algorithmic and configurations to
minimize delays in dataset processing and results retrieval.
","[{'version': 'v1', 'created': 'Sat, 2 Jul 2016 13:35:02 GMT'}]",2016-07-05,"[['Psomakelis', 'Evangelos', ''], ['Aisopos', 'Fotis', ''], ['Litke', 'Antonios', ''], ['Tserpes', 'Konstantinos', ''], ['Kardara', 'Magdalini', ''], ['Campo', 'Pablo Martínez', '']]","['Internet of Things', 'Social Networking', 'Big Data Aggregation and Analysis', 'Smart City applications', 'Sentiment Analysis', 'Machine Learning']"
14366,1511.04536,Snehanshu Saha,"Sarasvathi V, Snehanshu Saha, N.Ch.S.N. Iyengar and Mahalaxmi Koti","Coefficient of Restitution based Cross Layer Interference Aware Routing
  Protocol in Wireless Mesh Networks",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Multi-Radio Multi-Channel (MRMC) Wireless Mesh Networks (WMN), Partially
Overlapped Channels (POC) has been used to increase the parallel transmission.
But adjacent channel interference is very severe in MRMC environment; it
decreases the network throughput very badly. In this paper, we propose a
Coefficient of Restitution based Cross layer Interference aware Routing
protocol (CoRCiaR) to improve TCP performance in Wireless Mesh Networks. This
approach comprises of two-steps: Initially, the interference detection
algorithm is developed at MAC layer by enhancing the RTS/CTS method. Based on
the channel interference, congestion is identified by Round Trip Time (RTT)
measurements, and subsequently the route discovery module selects the
alternative path to send the data packet. The packets are transmitted to the
congestion free path seamlessly by the source. The performance of the proposed
CoRCiaR protocol is measured by Coefficient of Restitution (COR) parameter. The
impact of the rerouting is experienced on the network throughput performance.
The simulation results show that the proposed cross layer interference aware
dynamic routing enhances the TCP performance on WMN.
  Keywords: Coefficient of Restitution, Wireless Mesh Networks, Partially
Overlapped Channels, Round Trip Time, Multi-Radio, Multi-Channel.
","[{'version': 'v1', 'created': 'Sat, 14 Nov 2015 09:41:22 GMT'}]",2015-11-17,"[['V', 'Sarasvathi', ''], ['Saha', 'Snehanshu', ''], ['Iyengar', 'N. Ch. S. N.', ''], ['Koti', 'Mahalaxmi', '']]","['Coefficient of Restitution', 'Wireless Mesh Networks', 'Partially Overlapped Channels', 'Round Trip Time', 'Multi-Radio', 'Multi-Channel']"
14367,1002.0481,Odile Piton,"Abdelmajid Ben Hamadou (MIRACL), Odile Piton, H\'ela Fehri (MIRACL)","Recognition and translation Arabic-French of Named Entities: case of the
  Sport places",,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The recognition of Arabic Named Entities (NE) is a problem in different
domains of Natural Language Processing (NLP) like automatic translation.
Indeed, NE translation allows the access to multilingual in-formation. This
translation doesn't always lead to expected result especially when NE contains
a person name. For this reason and in order to ameliorate translation, we can
transliterate some part of NE. In this context, we propose a method that
integrates translation and transliteration together. We used the linguis-tic
NooJ platform that is based on local grammars and transducers. In this paper,
we focus on sport domain. We will firstly suggest a refinement of the
typological model presented at the MUC Conferences we will describe the
integration of an Arabic transliteration module into translation system.
Finally, we will detail our method and give the results of the evaluation.
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2010 13:24:38 GMT'}, {'version': 'v2', 'created': 'Mon, 31 May 2010 08:22:36 GMT'}]",2010-07-28,"[['Hamadou', 'Abdelmajid Ben', '', 'MIRACL'], ['Piton', 'Odile', '', 'MIRACL'], ['Fehri', 'Héla', '', 'MIRACL']]","['Named Entities (NE)', 'Typological Model for NE', 'EN retrieval', 'Automatic Translation of NE', 'Morpho-Syntactic Analysis']"
14368,0710.2852,Sebastien Hinderer,"Patrick Blackburn (INRIA Lorraine - LORIA), S\'ebastien Hinderer
  (INRIA Lorraine - LORIA)",Generating models for temporal representations,,Dans Recent Advances in Natural Language Processing (2007) 69-75,,,cs.CL,,"  We discuss the use of model building for temporal representations. We chose
Polish to illustrate our discussion because it has an interesting aspectual
system, but the points we wish to make are not language specific. Rather, our
goal is to develop theoretical and computational tools for temporal model
building tasks in computational semantics. To this end, we present a
first-order theory of time and events which is rich enough to capture
interesting semantic distinctions, and an algorithm which takes minimal models
for first-order theories and systematically attempts to ``perturb'' their
temporal component to provide non-minimal, but semantically significant,
models.
","[{'version': 'v1', 'created': 'Mon, 15 Oct 2007 15:45:13 GMT'}]",2007-10-16,"[['Blackburn', 'Patrick', '', 'INRIA Lorraine - LORIA'], ['Hinderer', 'Sébastien', '', 'INRIA Lorraine - LORIA']]","['model building', 'first-order logic', 'higher-order logic', 'computational semantics', 'events', 'tense', 'aspect']"
14369,0803.4511,Herbert van de Sompel,"Herbert Van de Sompel, Ryan Chute, Patrick Hochstenbach",The aDORe Federation Architecture,"43 pages, 4 figures, 2 tables",,,,cs.DL,http://creativecommons.org/licenses/publicdomain/,"  The need to federate repositories emerges in two distinctive scenarios. In
one scenario, scalability-related problems in the operation of a repository
reach a point beyond which continued service requires parallelization and hence
federation of the repository infrastructure. In the other scenario, multiple
distributed repositories manage collections of interest to certain communities
or applications, and federation is an approach to present a unified perspective
across these repositories. The high-level, 3-Tier aDORe federation architecture
can be used as a guideline to federate repositories in both cases. This paper
describes the architecture, consisting of core interfaces for federated
repositories in Tier-1, two shared infrastructure components in Tier-2, and a
single-point of access to the federation in Tier-3. The paper also illustrates
two large-scale deployments of the aDORe federation architecture: the aDORe
Archive repository (over 100,000,000 digital objects) at the Los Alamos
National Laboratory and the Ghent University Image Repository federation
(multiple terabytes of image files).
","[{'version': 'v1', 'created': 'Mon, 31 Mar 2008 18:02:57 GMT'}]",2008-04-01,"[['Van de Sompel', 'Herbert', ''], ['Chute', 'Ryan', ''], ['Hochstenbach', 'Patrick', '']]","['Interoperability', 'repository federation', 'OAI-PMH', 'OpenURL']"
14370,1701.02543,Junbo Zhang,"Junbo Zhang, Yu Zheng, Dekang Qi, Ruiyuan Li, Xiuwen Yi, Tianrui Li","Predicting Citywide Crowd Flows Using Deep Spatio-Temporal Residual
  Networks","21 pages, 16 figures. arXiv admin note: substantial text overlap with
  arXiv:1610.00081",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Forecasting the flow of crowds is of great importance to traffic management
and public safety, and very challenging as it is affected by many complex
factors, including spatial dependencies (nearby and distant), temporal
dependencies (closeness, period, trend), and external conditions (e.g., weather
and events). We propose a deep-learning-based approach, called ST-ResNet, to
collectively forecast two types of crowd flows (i.e. inflow and outflow) in
each and every region of a city. We design an end-to-end structure of ST-ResNet
based on unique properties of spatio-temporal data. More specifically, we
employ the residual neural network framework to model the temporal closeness,
period, and trend properties of crowd traffic. For each property, we design a
branch of residual convolutional units, each of which models the spatial
properties of crowd traffic. ST-ResNet learns to dynamically aggregate the
output of the three residual neural networks based on data, assigning different
weights to different branches and regions. The aggregation is further combined
with external factors, such as weather and day of the week, to predict the
final traffic of crowds in each and every region. We have developed a real-time
system based on Microsoft Azure Cloud, called UrbanFlow, providing the crowd
flow monitoring and forecasting in Guiyang City of China. In addition, we
present an extensive experimental evaluation using two types of crowd flows in
Beijing and New York City (NYC), where ST-ResNet outperforms nine well-known
baselines.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2017 12:12:39 GMT'}]",2017-01-11,"[['Zhang', 'Junbo', ''], ['Zheng', 'Yu', ''], ['Qi', 'Dekang', ''], ['Li', 'Ruiyuan', ''], ['Yi', 'Xiuwen', ''], ['Li', 'Tianrui', '']]","['Convolutional Neural Networks', 'Spatio-temporal Data', 'Residual Learning', 'Crowd Flows', 'Cloud']"
14371,1701.03487,Orkun Karabasoglu,M. Hadi Amini and Orkun Karabasoglu,"Optimal Operation of Interdependent Power Systems and Electrified
  Transportation Networks",Submitted to Applied Energy,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Electrified transportation and power systems are mutually coupled networks.
In this paper, a novel framework is developed for interdependent power and
transportation networks. Our approach constitutes solving an iterative least
cost vehicle routing process, which utilizes the communication of electrified
vehicles (EVs) with competing charging stations to exchange data, such as
electricity price, energy demand, and time of arrival. EV routing problem is
solved to minimize the total cost of travel using the Dijkstra algorithm with
the input from EVs battery management system, electricity price from charging
stations, powertrain component efficiencies, and transportation network traffic
conditions. Through the bidirectional communication of EVs with competing
charging stations, EVs charging demand estimation is done much more accurately.
Then, the optimal power flow problem is solved for the power system, to find
the locational marginal price at load buses where charging stations are
connected. Finally, the electricity prices are communicated from the charging
stations to the EVs, and the loop is closed. Locational electricity price acts
as the shared parameter between the two optimization problems, i.e. optimal
power flow and optimal routing problem. Electricity price depends on the power
demand, which is affected by the charging of EVs. On the other hand, location
of EV charging stations and their different pricing strategies might affect the
routing decisions of the EVs. Our novel approach that combines the electrified
transportation with power system operation, holds tremendous potential for
solving electrified transportation issues and reducing energy costs. The
effectiveness of the proposed approach is demonstrated using Shanghai
transportation network and IEEE 9-bus test system. The results verify the
cost-savings for both power system and transportation networks.
","[{'version': 'v1', 'created': 'Thu, 12 Jan 2017 19:56:32 GMT'}]",2017-01-16,"[['Amini', 'M. Hadi', ''], ['Karabasoglu', 'Orkun', '']]","['Electrified transportation network', 'power systems operation', 'locational marginal price', 'electrified']"
14372,1209.5431,Tanvir Ahmed,"Tanvir Ahmed, Md. Suzan Miah, Md. Manirul Islam and Md. Rakib Uddin","Automatic Electric Meter Reading System: A Cost-Feasible Alternative
  Approach In Meter Reading For Bangladesh Perspective Using Low-Cost Digital
  Wattmeter And Wimax Technology",8 pages,"International J. Eng. Tech 8(3):800-807, 2011",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Energy meter reading is a monotonous and an expensive task. Now the meter
reader people goes to each meter and take the meter reading manually to issue
the bill which will later be entered in the billing software for billing and
payment automation. If the manual meter reading and bill data entry process can
be automated then it would reduced the laborious task and financial wastage.
""Automatic Electric Meter Reading (AMR) System"" is a metering system that is to
be used for data collecting from the meter and processing the collected data
for billing and other decision purposes. In this paper we have proposed an
automatic meter reading system which is low cost, high performance, highest
data rate, highest coverage area and most appropriate for Bangladesh
perspective. In this AMR system there are four basic units. They are reading
unit, communication unit, data receiving and processing unit and billing
system. For reading unit we identified the disk rotation of the energy meter
and stored the data in microcontroller. So it is not required to change the
current analog energy meter. An external module will be added with the current
energy meter. In the communication unit Wimax transceiver was used for wireless
communication between meter end and the server end because of its wide coverage
area. In the data receiving and processing unit meter reading will be collected
from the transceiver which is controlled by another microcontroller. There will
be a computer application that will take the data from the microcontroller.
This will also help to avoid any tampering or break down of energy meter. There
are various AMR system exists all over the world. Those systems were analyzed
and we found they are not feasible for Bangladesh.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2012 21:25:23 GMT'}]",2012-09-26,"[['Ahmed', 'Tanvir', ''], ['Miah', 'Md. Suzan', ''], ['Islam', 'Md. Manirul', ''], ['Uddin', 'Md. Rakib', '']]","['Digital wattmeter', 'AMR', 'WiMax and PLM']"
14373,1209.3943,Eya Ben Ahmed,Wafa Tebourski Ourida Ben Boubaker Saidi,Formal Concept Analysis Based Association Rules Extraction,8,"IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 4, No. 2, July 2011",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generating a huge number of association rules reduces their utility in the
decision making process, done by domain experts. In this context, based on the
theory of Formal Concept Analysis, we propose to extend the notion of Formal
Concept through the generalization of the notion of itemset in order to
consider the itemset as an intent, its support as the cardinality of the extent
and its relevance which is related to the confidence of rule. Accordingly, we
propose a new approach to extract interesting itemsets through the concept
coverage. This approach uses a new quality-criteria of a rule: the relevance
bringing a semantic added value to formal concept analysis approach to discover
association rules.
","[{'version': 'v1', 'created': 'Tue, 18 Sep 2012 13:04:01 GMT'}]",2012-09-19,"[['Saidi', 'Wafa Tebourski Ourida Ben Boubaker', '']]","['Association rules', 'formal concept analysis', 'quality measure']"
14374,1402.1243,Shafi'i Muhammad Abdulhamid Mr,"Shafii Muhammad Abdulhamid, Gana Usman",Destination Information Management System for Tourist,8 pages. Computer Science and Telecommunications 2010,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of information and communication technology in our day to day
activities is now unavoidable. In tourism developments, destination information
and management systems are used to guide visitors and provide information to
both visitors and management of the tour sites. In this paper, information and
navigation system was designed for tourists, taking some Niger state of Nigeria
tourism destinations into account. The information management system was
designed using Java Applet (NetBeans IDE 6.1), Hypertext MarkUp Language
(HTML), Personal Home Page (PHP), Java script and MySQL as the back-end
integration database. Two different MySQL servers were used, the MySQL query
browser and the WAMP5 server to compare the effectiveness of the system
developed.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2014 04:30:39 GMT'}]",2014-02-07,"[['Abdulhamid', 'Shafii Muhammad', ''], ['Usman', 'Gana', '']]","['Information System', 'Navigation System', 'Destination Management System', 'UML']"
14375,0712.3146,Pierre Lescanne,"Pierre Lescanne (LIP), J\'er\^ome Puiss\'egur (LIP)",Dynamic Logic of Common Knowledge in a Proof Assistant,15 p,,,,cs.GT,,"  Common Knowledge Logic is meant to describe situations of the real world
where a group of agents is involved. These agents share knowledge and make
strong statements on the knowledge of the other agents (the so called
\emph{common knowledge}). But as we know, the real world changes and overall
information on what is known about the world changes as well. The changes are
described by dynamic logic. To describe knowledge changes, dynamic logic should
be combined with logic of common knowledge. In this paper we describe
experiments which we have made about the integration in a unique framework of
common knowledge logic and dynamic logic in the proof assistant \Coq. This
results in a set of fully checked proofs for readable statements. We describe
the framework and how a proof can be
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2007 10:23:14 GMT'}]",2007-12-20,"[['Lescanne', 'Pierre', '', 'LIP'], ['Puisségur', 'Jérôme', '', 'LIP']]","['Common Knowledge', 'Dynamic Logic', 'Proof Assistant']"
14376,1304.0740,Lijun Zhang,"Lijun Zhang, Tianbao Yang, Rong Jin, Xiaofei He","O(logT) Projections for Stochastic Optimization of Smooth and Strongly
  Convex Functions",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional algorithms for stochastic optimization require projecting the
solution at each iteration into a given domain to ensure its feasibility. When
facing complex domains, such as positive semi-definite cones, the projection
operation can be expensive, leading to a high computational cost per iteration.
In this paper, we present a novel algorithm that aims to reduce the number of
projections for stochastic optimization. The proposed algorithm combines the
strength of several recent developments in stochastic optimization, including
mini-batch, extra-gradient, and epoch gradient descent, in order to effectively
explore the smoothness and strong convexity. We show, both in expectation and
with a high probability, that when the objective function is both smooth and
strongly convex, the proposed algorithm achieves the optimal $O(1/T)$ rate of
convergence with only $O(\log T)$ projections. Our empirical study verifies the
theoretical result.
","[{'version': 'v1', 'created': 'Tue, 2 Apr 2013 19:11:23 GMT'}]",2013-04-03,"[['Zhang', 'Lijun', ''], ['Yang', 'Tianbao', ''], ['Jin', 'Rong', ''], ['He', 'Xiaofei', '']]","['Epoch gradient descent', 'extra-gradient descent', 'mini-batch', 'strongly convex', 'smooth']"
14377,1106.1570,Ismaail ElSawy,"Ismaail ElSawy, Hossam Hosny and Mohammed Abdel Razek","A Neural Network Model for Construction Projects Site Overhead Cost
  Estimating in Egypt","11 pages,IJCSI","International Journal of Computer Science Issues, Vol. 8, Issue 3,
  May 2011, 273-283",,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Estimating of the overhead costs of building construction projects is an
important task in the management of these projects. The quality of construction
management depends heavily on their accurate cost estimation. Construction
costs prediction is a very difficult and sophisticated task especially when
using manual calculation methods. This paper uses Artificial Neural Network
(ANN) approach to develop a parametric cost-estimating model for site overhead
cost in Egypt. Fifty-two actual real-life cases of building projects
constructed in Egypt during the seven year period 2002-2009 were used as
training materials. The neural network architecture is presented for the
estimation of the site overhead costs as a percentage from the total project
price.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2011 14:29:41 GMT'}]",2011-06-09,"[['ElSawy', 'Ismaail', ''], ['Hosny', 'Hossam', ''], ['Razek', 'Mohammed Abdel', '']]","['Construction Projects', 'Project Site Overhead Cost', 'Egypt', 'Artificial Neural Network']"
14378,1710.05502,Chen Wang,"Chen Wang, Minh-Chung Hoang, Lihua Xie, Junsong Yuan",Non-iterative RGB-D-inertial Odometry,,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a non-iterative solution to RGB-D-inertial odometry
system. Traditional odometry methods resort to iterative algorithms which are
usually computationally expensive or require well-designed initialization. To
overcome this problem, this paper proposes to combine a non-iterative front-end
(odometry) with an iterative back-end (loop closure) for the RGB-D-inertial
SLAM system. The main contribution lies in the novel non-iterative front-end,
which leverages on inertial fusion and kernel cross-correlators (KCC) to match
point clouds in frequency domain. Dominated by the fast Fourier transform
(FFT), our method is only of complexity $\mathcal{O}(n\log{n})$, where $n$ is
the number of points. Map fusion is conducted by element-wise operations, so
that both time and space complexity are further reduced. Extensive experiments
show that, due to the lightweight of the proposed front-end, the framework is
able to run at a much faster speed yet still with comparable accuracy with the
state-of-the-arts.
","[{'version': 'v1', 'created': 'Mon, 16 Oct 2017 04:29:35 GMT'}, {'version': 'v2', 'created': 'Sun, 8 Apr 2018 08:53:32 GMT'}]",2018-04-10,"[['Wang', 'Chen', ''], ['Hoang', 'Minh-Chung', ''], ['Xie', 'Lihua', ''], ['Yuan', 'Junsong', '']]","['Non-Iterative', 'Odometry', 'Dense Mapping', 'RGB-D', 'Inertial Fusion']"
14379,1501.03188,Ross Sowell,"Alexander Hubers, Emily Andrulis, Levi Scott, Tanner Stirrat, Duc
  Tran, Ruonan Zhang, Ross Sowell, Cindy Grimm, William D. Smart","Video Manipulation Techniques for the Protection of Privacy in Remote
  Presence Systems","14 pages, 8 figures",,,,cs.RO cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Systems that give control of a mobile robot to a remote user raise privacy
concerns about what the remote user can see and do through the robot. We aim to
preserve some of that privacy by manipulating the video data that the remote
user sees. Through two user studies, we explore the effectiveness of different
video manipulation techniques at providing different types of privacy. We
simultaneously examine task performance in the presence of privacy protection.
In the first study, participants were asked to watch a video captured by a
robot exploring an office environment and to complete a series of observational
tasks under differing video manipulation conditions. Our results show that
using manipulations of the video stream can lead to fewer privacy violations
for different privacy types. Through a second user study, it was demonstrated
that these privacy-protecting techniques were effective without diminishing the
task performance of the remote user.
","[{'version': 'v1', 'created': 'Tue, 13 Jan 2015 21:58:16 GMT'}]",2015-01-15,"[['Hubers', 'Alexander', ''], ['Andrulis', 'Emily', ''], ['Scott', 'Levi', ''], ['Stirrat', 'Tanner', ''], ['Tran', 'Duc', ''], ['Zhang', 'Ruonan', ''], ['Sowell', 'Ross', ''], ['Grimm', 'Cindy', ''], ['Smart', 'William D.', '']]","['Privacy interfaces', 'remote presence systems', 'video manipulation']"
14380,1204.5580,Damien Chablat,"Montserrat Manubens, Guillaume Moroz (INRIA Lorraine - LORIA), Damien
  Chablat (IRCCyN), Philippe Wenger (IRCCyN), Fabrice Rouillier (INRIA
  Rocquencourt)","Cusp Points in the Parameter Space of Degenerate 3-RPR Planar Parallel
  Manipulators",ASME Journal of Mechanisms and Robotics (2012) 1-10,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates the conditions in the design parameter space for the
existence and distribution of the cusp locus for planar parallel manipulators.
Cusp points make possible non-singular assembly-mode changing motion, which
increases the maximum singularity-free workspace. An accurate algorithm for the
determination is proposed amending some imprecisions done by previous existing
algorithms. This is combined with methods of Cylindric Algebraic Decomposition,
Gr\""obner bases and Discriminant Varieties in order to partition the parameter
space into cells with constant number of cusp points. These algorithms will
allow us to classify a family of degenerate 3-RPR manipulators.
","[{'version': 'v1', 'created': 'Wed, 25 Apr 2012 08:03:31 GMT'}]",2012-04-26,"[['Manubens', 'Montserrat', '', 'INRIA Lorraine - LORIA'], ['Moroz', 'Guillaume', '', 'INRIA Lorraine - LORIA'], ['Chablat', 'Damien', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN'], ['Rouillier', 'Fabrice', '', 'INRIA\n  Rocquencourt']]","['kinematics', 'parallel manipulator', 'singularities', 'cusp', 'discriminant variety', 'cylindric algebraic decomposition', 'degenerate 3-RP']"
14381,1512.01485,Sander Verdonschot,Prosenjit Bose and Sander Verdonschot,Flips in Edge-Labelled Pseudo-Triangulations,"15 pages, 10 figures, invited to a CGTA special issue for CCCG 2015.
  The paper is a stand-alone version of results that appeared in the second
  author's PhD thesis (arXiv:1509.02563 [cs.CG])",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that $O(n^2)$ exchanging flips suffice to transform any edge-labelled
pointed pseudo-triangulation into any other with the same set of labels. By
using insertion, deletion and exchanging flips, we can transform any
edge-labelled pseudo-triangulation into any other with $O(n \log c + h \log h)$
flips, where $c$ is the number of convex layers and $h$ is the number of points
on the convex hull.
","[{'version': 'v1', 'created': 'Fri, 4 Dec 2015 17:23:37 GMT'}]",2015-12-07,"[['Bose', 'Prosenjit', ''], ['Verdonschot', 'Sander', '']]","['edge flip', 'diagonal flip', 'pseudo-triangulation', 'edge label']"
14382,1409.7313,YuGei Gan,"Yufei Gan, Teng Yang, Chu He",A Deep Graph Embedding Network Model for Face Recognition,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a new deep learning network ""GENet"", it combines
the multi-layer network architec- ture and graph embedding framework. Firstly,
we use simplest unsupervised learning PCA/LDA as first layer to generate the
low- level feature. Secondly, many cascaded dimensionality reduction layers
based on graph embedding framework are applied to GENet. Finally, a linear SVM
classifier is used to classify dimension-reduced features. The experiments
indicate that higher classification accuracy can be obtained by this algorithm
on the CMU-PIE, ORL, Extended Yale B dataset.
","[{'version': 'v1', 'created': 'Thu, 25 Sep 2014 16:14:18 GMT'}]",2014-09-26,"[['Gan', 'Yufei', ''], ['Yang', 'Teng', ''], ['He', 'Chu', '']]","['Deep Learning', 'Graph Embedding framework', 'FaceRecognition']"
14383,1005.4564,Isabel Rodet,"Annie Luciani (ACROE, ICA), Matthieu Evrard (ICA), Damien Courouss\'e
  (ICA), Nicolas Castagn\'e (ACROE, ICA), Claude Cadoz (ACROE, ICA), Jean-Loup
  Florens (ACROE)","A basic gesture and motion format for virtual reality multisensory
  applications","GRAPP'06, Set\`ubal : Portugal (2006)",,,,cs.HC cs.GR cs.MM cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The question of encoding movements such as those produced by human gestures
may become central in the coming years, given the growing importance of
movement data exchanges between heterogeneous systems and applications (musical
applications, 3D motion control, virtual reality interaction, etc.). For the
past 20 years, various formats have been proposed for encoding movement,
especially gestures. Though, these formats, at different degrees, were designed
in the context of quite specific applications (character animation, motion
capture, musical gesture, biomechanical concerns...). The article introduce a
new file format, called GMS (for 'Gesture and Motion Signal'), with the aim of
being more low-level and generic, by defining the minimal features a format
carrying movement/gesture information needs, rather than by gathering all the
information generally given by the existing formats. The article argues that,
given its growing presence in virtual reality situations, the ""gesture signal""
itself must be encoded, and that a specific format is needed. The proposed
format features the inner properties of such signals: dimensionality,
structural features, types of variables, and spatial and temporal properties.
The article first reviews the various situations with multisensory virtual
objects in which gesture controls intervene. The proposed format is then
deduced, as a mean to encode such versatile and variable ""gestural and animated
scene"".
","[{'version': 'v1', 'created': 'Tue, 25 May 2010 13:16:29 GMT'}]",2010-05-26,"[['Luciani', 'Annie', '', 'ACROE, ICA'], ['Evrard', 'Matthieu', '', 'ICA'], ['Couroussé', 'Damien', '', 'ICA'], ['Castagné', 'Nicolas', '', 'ACROE, ICA'], ['Cadoz', 'Claude', '', 'ACROE, ICA'], ['Florens', 'Jean-Loup', '', 'ACROE']]","['File Format', 'Gesture', 'Movement', 'Motion Capture', 'Virtual Reality', 'Computer Animation', 'Multisensoriality']"
14384,1104.5642,Luca Moscardelli,"Angelo Fanelli, Luca Moscardelli and Alexander Skopalik",On the Impact of Fair Best Response Dynamics,,,,,cs.GT cs.CC cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we completely characterize how the frequency with which each
player participates in the game dynamics affects the possibility of reaching
efficient states, i.e., states with an approximation ratio within a constant
factor from the price of anarchy, within a polynomially bounded number of best
responses. We focus on the well known class of congestion games and we show
that, if each player is allowed to play at least once and at most $\beta$ times
any $T$ best responses, states with approximation ratio $O(\beta)$ times the
price of anarchy are reached after $T \lceil \log \log n \rceil$ best
responses, and that such a bound is essentially tight also after exponentially
many ones. One important consequence of our result is that the fairness among
players is a necessary and sufficient condition for guaranteeing a fast
convergence to efficient states. This answers the important question of the
maximum order of $\beta$ needed to fast obtain efficient states, left open by
[9,10] and [3], in which fast convergence for constant $\beta$ and very slow
convergence for $\beta=O(n)$ have been shown, respectively. Finally, we show
that the structure of the game implicitly affects its performances. In
particular, we show that in the symmetric setting, in which all players share
the same set of strategies, the game always converges to an efficient state
after a polynomial number of best responses, regardless of the frequency each
player moves with.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2011 14:59:17 GMT'}]",2011-05-02,"[['Fanelli', 'Angelo', ''], ['Moscardelli', 'Luca', ''], ['Skopalik', 'Alexander', '']]","['Congestion Games', 'Speed of Convergence', 'Best Response Dynamics']"
14385,1701.04648,Eric Sopena,"Olivier Baudon (LaBRI), Monika Pilsniak, Jakub Przybylo, Mohammed
  Senhaji (LaBRI), Eric Sopena (LaBRI), Mariusz Wozniak",Equitable neighbour-sum-distinguishing edge and total colourings,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With any (not necessarily proper) edge $k$-colouring
$\gamma:E(G)\longrightarrow\{1,\dots,k\}$ of a graph $G$,one can associate a
vertex colouring $\sigma\_{\gamma}$ given by $\sigma\_{\gamma}(v)=\sum\_{e\ni
v}\gamma(e)$.A neighbour-sum-distinguishing edge $k$-colouring is an edge
colouring whose associated vertex colouring is proper.The
neighbour-sum-distinguishing index of a graph $G$ is then the smallest $k$ for
which $G$ admitsa neighbour-sum-distinguishing edge $k$-colouring.These notions
naturally extends to total colourings of graphs that assign colours to both
vertices and edges.We study in this paper equitable
neighbour-sum-distinguishing edge colourings andtotal colourings, that is
colourings $\gamma$ for whichthe number of elements in any two colour classes
of $\gamma$ differ by at most one.We determine the equitable
neighbour-sum-distinguishing indexof complete graphs, complete bipartite graphs
and forests,and the equitable neighbour-sum-distinguishing total chromatic
numberof complete graphs and bipartite graphs.
","[{'version': 'v1', 'created': 'Tue, 17 Jan 2017 12:44:23 GMT'}]",2017-01-18,"[['Baudon', 'Olivier', '', 'LaBRI'], ['Pilsniak', 'Monika', '', 'LaBRI'], ['Przybylo', 'Jakub', '', 'LaBRI'], ['Senhaji', 'Mohammed', '', 'LaBRI'], ['Sopena', 'Eric', '', 'LaBRI'], ['Wozniak', 'Mariusz', '']]","['Equitable colouring', 'Neighbour-sum-distinguishing edge colouring', 'Neighbour-sum-distinguishing total colouring']"
14386,1410.2188,Luming Zhang Luming,"Yuxin Hu, Luming Zhang","An Aerial Image Recognition Framework using Discrimination and
  Redundancy Quality Measure",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aerial image categorization plays an indispensable role in remote sensing and
artificial intelligence. In this paper, we propose a new aerial image
categorization framework, focusing on organizing the local patches of each
aerial image into multiple discriminative subgraphs. The subgraphs reflect both
the geometric property and the color distribution of an aerial image. First,
each aerial image is decomposed into a collection of regions in terms of their
color intensities. Thereby region connected graph (RCG), which models the
connection between the spatial neighboring regions, is constructed to encode
the spatial context of an aerial image. Second, a subgraph mining technique is
adopted to discover the frequent structures in the RCGs constructed from the
training aerial images. Thereafter, a set of refined structures are selected
among the frequent ones toward being highly discriminative and low redundant.
Lastly, given a new aerial image, its sub-RCGs corresponding to the refined
structures are extracted. They are further quantized into a discriminative
vector for SVM classification. Thorough experimental results validate the
effectiveness of the proposed method. In addition, the visualized mined
subgraphs show that the discriminative topologies of each aerial image are
discovered.
","[{'version': 'v1', 'created': 'Mon, 6 Oct 2014 16:40:02 GMT'}]",2016-11-04,"[['Hu', 'Yuxin', ''], ['Zhang', 'Luming', '']]","['Aerial Image', 'Categorization', 'Discriminative', 'Subgraph', 'Data mining']"
14387,1208.0163,Mohamed Salah  Gouider Dr,Saida Aissi and Mohamed Salah Gouider,Spatial and Spatio-Temporal Multidimensional Data Modelling: A Survey,,"International Journal of Advanced Research in Computer Science and
  Software (IJARCCE), Volume 1, Issue 1, March 2012",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data warehouse store and provide access to large volume of historical data
supporting the strategic decisions of organisations. Data warehouse is based on
a multidimensional model which allow to express user's needs for supporting the
decision making process. Since it is estimated that 80% of data used for
decision making has a spatial or location component [1, 2], spatial data have
been widely integrated in Data Warehouses and in OLAP systems. Extending a
multidimensional data model by the inclusion of spatial data provides a concise
and organised spatial datawarehouse representation. This paper aims to provide
a comprehensive review of litterature on developed and suggested spatial and
spatio-temporel multidimensional models. A benchmarking study of the proposed
models is presented. Several evaluation criterias are used to identify the
existence of trends as well as potential needs for further investigations.
","[{'version': 'v1', 'created': 'Wed, 1 Aug 2012 10:21:55 GMT'}]",2012-08-02,"[['Aissi', 'Saida', ''], ['Gouider', 'Mohamed Salah', '']]","['Dtawarehouse', 'Spatial data', 'Multidimensionnal modelling', 'Temporal data']"
14388,1505.02445,Tomaso Aste,"Guido Previde Massara, T. Di Matteo, Tomaso Aste",Network Filtering for Big Data: Triangulated Maximally Filtered Graph,"16 pages, 7 Figures, 2 Tables",,,,cs.DS cond-mat.stat-mech cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a network-filtering method, the Triangulated Maximally Filtered
Graph (TMFG), that provides an approximate solution to the Weighted Maximal
Planar Graph problem. The underlying idea of TMFG consists in building a
triangulation that maximizes a score function associated with the amount of
information retained by the network. TMFG uses as weights any arbitrary
similarity measure to arrange data into a meaningful network structure that can
be used for clustering, community detection and modeling. The method is fast,
adaptable and scalable to very large datasets, it allows online updating and
learning as new data can be inserted and deleted with combinations of local and
non-local moves. TMFG permits readjustments of the network in consequence of
changes in the strength of the similarity measure. The method is based on local
topological moves and can therefore take advantage of parallel and GPUs
computing. We discuss how this network-filtering method can be used intuitively
and efficiently for big data studies and its significance from an
information-theoretic perspective.
","[{'version': 'v1', 'created': 'Sun, 10 May 2015 21:47:38 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Aug 2015 16:02:37 GMT'}]",2015-08-26,"[['Massara', 'Guido Previde', ''], ['Di Matteo', 'T.', ''], ['Aste', 'Tomaso', '']]","['TMFG', 'Big Data', 'Network Filtering', 'PMFG', 'Planarization algorithms', 'CorrelationNetwork', 'Markov Random Fields', 'Weighted Maximal Planar Graph (WMPG)']"
14389,1512.02257,Carsten Grimm,"Jean-Lou De Carufel and Carsten Grimm and Anil Maheshwari and Michiel
  Smid","Minimizing the Continuous Diameter when Augmenting Paths and Cycles with
  Shortcuts",,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We seek to augment a geometric network in the Euclidean plane with shortcuts
to minimize its continuous diameter, i.e., the largest network distance between
any two points on the augmented network. Unlike in the discrete setting where a
shortcut connects two vertices and the diameter is measured between vertices,
we take all points along the edges of the network into account when placing a
shortcut and when measuring distances in the augmented network.
  We study this network augmentation problem for paths and cycles. For paths,
we determine an optimal shortcut in linear time. For cycles, we show that a
single shortcut never decreases the continuous diameter and that two shortcuts
always suffice to reduce the continuous diameter. Furthermore, we characterize
optimal pairs of shortcuts for convex and non-convex cycles. Finally, we
develop a linear time algorithm that produces an optimal pair of shortcuts for
convex cycles. Apart from the algorithms, our results extend to rectifiable
curves.
  Our work reveals some of the underlying challenges that must be overcome when
addressing the discrete version of this network augmentation problem, where we
minimize the discrete diameter of a network with shortcuts that connect only
vertices.
","[{'version': 'v1', 'created': 'Mon, 7 Dec 2015 21:44:54 GMT'}]",2015-12-09,"[['De Carufel', 'Jean-Lou', ''], ['Grimm', 'Carsten', ''], ['Maheshwari', 'Anil', ''], ['Smid', 'Michiel', '']]","['Network Augmentation', 'Shortcuts', 'Diameter', 'Paths', 'Cycles']"
14390,1406.5074,Vijendra Singh,Singh Vijendra and Pathak Shivani,Robust Outlier Detection Technique in Data Mining: A Univariate Approach,"arXiv admin note: text overlap with arXiv:1402.6859 by other authors
  without attribution",,,MT CS 2011,cs.CV,http://creativecommons.org/licenses/by/3.0/,"  Outliers are the points which are different from or inconsistent with the
rest of the data. They can be novel, new, abnormal, unusual or noisy
information. Outliers are sometimes more interesting than the majority of the
data. The main challenges of outlier detection with the increasing complexity,
size and variety of datasets, are how to catch similar outliers as a group, and
how to evaluate the outliers. This paper describes an approach which uses
Univariate outlier detection as a pre-processing step to detect the outlier and
then applies K-means algorithm hence to analyse the effects of the outliers on
the cluster analysis of dataset.
","[{'version': 'v1', 'created': 'Thu, 19 Jun 2014 15:12:49 GMT'}]",2014-06-20,"[['Vijendra', 'Singh', ''], ['Shivani', 'Pathak', '']]","['Outlier', 'Univariate outlier detection', 'K-means algorithm']"
14391,1707.09109,Hongwei Lin,"Hongwei Lin, Qi Cao, Xiaoting Zhang","The Convergence of Least-Squares Progressive Iterative Approximation
  with Singular Iterative Matrix","12 pages, 2 figures",,,TR-GDC-2016-001,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Developed in [Deng and Lin, 2014], Least-Squares Progressive Iterative
Approximation (LSPIA) is an efficient iterative method for solving B-spline
curve and surface least-squares fitting systems. In [Deng and Lin 2014], it was
shown that LSPIA is convergent when the iterative matrix is nonsingular. In
this paper, we will show that LSPIA is still convergent even the iterative
matrix is singular.
","[{'version': 'v1', 'created': 'Fri, 28 Jul 2017 05:43:23 GMT'}]",2017-07-31,"[['Lin', 'Hongwei', ''], ['Cao', 'Qi', ''], ['Zhang', 'Xiaoting', '']]","['LSPIA', 'singular linear system', 'least-squares fitting', 'data fitting', 'geometric modeling']"
14392,0704.3496,Frank Gurski,Frank Gurski,"Polynomial algorithms for protein similarity search for restricted mRNA
  structures",10 Pages,,,,cs.DS cs.CC,,"  In this paper we consider the problem of computing an mRNA sequence of
maximal similarity for a given mRNA of secondary structure constraints,
introduced by Backofen et al. in [BNS02] denoted as the MRSO problem. The
problem is known to be NP-complete for planar associated implied structure
graphs of vertex degree at most 3. In [BFHV05] a first polynomial dynamic
programming algorithms for MRSO on implied structure graphs with maximum vertex
degree 3 of bounded cut-width is shown. We give a simple but more general
polynomial dynamic programming solution for the MRSO problem for associated
implied structure graphs of bounded clique-width. Our result implies that MRSO
is polynomial for graphs of bounded tree-width, co-graphs, $P_4$-sparse graphs,
and distance hereditary graphs. Further we conclude that the problem of
comparing two solutions for MRSO is hard for the class of problems which can be
solved in polynomial time with a number of parallel queries to an oracle in NP.
","[{'version': 'v1', 'created': 'Thu, 26 Apr 2007 08:30:14 GMT'}]",2007-05-23,"[['Gurski', 'Frank', '']]","['graph algorithms', 'protein similarity search', 'mRNA structure', 'computationalbiology', 'PNP∥-completeness']"
14393,1406.5376,Leandro Montero,"Raquel \'Agueda, Valentin Borozan, Marina Groshaus, Yannis
  Manoussakis, Gervais Mendy, Leandro Montero",Proper Hamiltonian Paths in Edge-Coloured Multigraphs,21 pages,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a $c$-edge-coloured multigraph, a proper Hamiltonian path is a path
that contains all the vertices of the multigraph such that no two adjacent
edges have the same colour. In this work we establish sufficient conditions for
an edge-coloured multigraph to guarantee the existence of a proper Hamiltonian
path, involving various parameters as the number of edges, the number of
colours, the rainbow degree and the connectivity.
","[{'version': 'v1', 'created': 'Fri, 20 Jun 2014 13:21:58 GMT'}]",2014-06-23,"[['Águeda', 'Raquel', ''], ['Borozan', 'Valentin', ''], ['Groshaus', 'Marina', ''], ['Manoussakis', 'Yannis', ''], ['Mendy', 'Gervais', ''], ['Montero', 'Leandro', '']]","['Multigraph', 'Proper Hamiltonian Path', 'Edge-Coloured Graph']"
14394,1603.07256,Sebastian Muskalla,Luk\'a\v{s} Hol\'ik and Roland Meyer and Sebastian Muskalla,Summaries for Context-Free Games,The conference version of this paper was accepted for FSTTCS 2016,,,,cs.LO cs.FL cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study two-player games played on the infinite graph of sentential forms
induced by a context-free grammar (that comes with an ownership partitioning of
the non-terminals). The winning condition is inclusion of the derived terminal
word in the language of a finite automaton. Our contribution is a new algorithm
to decide the winning player and to compute her strategy. It is based on a
novel representation of all plays starting in a non-terminal. The
representation uses the domain of Boolean formulas over the transition monoid
of the target automaton. The elements of the monoid are essentially procedure
summaries, and our approach can be seen as the first summary-based algorithm
for the synthesis of recursive programs. We show that our algorithm has optimal
(doubly exponential) time complexity, that it is compatible with recent
antichain optimizations, and that it admits a lazy evaluation strategy. Our
preliminary experiments indeed show encouraging results, indicating a speed up
of three orders of magnitude over a competitor.
","[{'version': 'v1', 'created': 'Wed, 23 Mar 2016 16:20:56 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Jul 2016 10:39:17 GMT'}, {'version': 'v3', 'created': 'Fri, 9 Sep 2016 15:52:19 GMT'}, {'version': 'v4', 'created': 'Tue, 1 Nov 2016 13:45:24 GMT'}]",2016-11-02,"[['Holík', 'Lukáš', ''], ['Meyer', 'Roland', ''], ['Muskalla', 'Sebastian', '']]","['summaries', 'context-free games', 'Kleene iteration', 'transition monoid', 'strategy synthesis']"
14395,1510.06967,Anshu S Anand,"Anshu S Anand, R K Shyamasundar, Sathya Peri",Opacity Proof for CaPR+ Algorithm,arXiv admin note: text overlap with arXiv:1307.8256,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we describe an enhanced Automatic Check- pointing and Partial
Rollback algorithm(CaP R + ) to realize Software Transactional Memory(STM) that
is based on con- tinuous conflict detection, lazy versioning with automatic
checkpointing, and partial rollback. Further, we provide a proof of correctness
of CaP R+ algorithm, in particular, Opacity, a STM correctness criterion, that
precisely captures the intuitive correctness guarantees required of
transactional memories. The algorithm provides a natural way to realize a
hybrid system of pure aborts and partial rollbacks. We have also implemented
the algorithm, and shown its effectiveness with reference to the Red-black tree
micro-benchmark and STAMP benchmarks. The results obtained demonstrate the
effectiveness of the Partial Rollback mechanism over pure abort mechanisms,
particularly in applications consisting of large transaction lengths.
","[{'version': 'v1', 'created': 'Fri, 23 Oct 2015 15:25:05 GMT'}]",2015-10-26,"[['Anand', 'Anshu S', ''], ['Shyamasundar', 'R K', ''], ['Peri', 'Sathya', '']]","['STM', 'transaction', 'opacity', 'correctness', 'multi-core']"
14396,1306.0128,Mark Levin,Mark Sh. Levin,Towards Detection of Bottlenecks in Modular Systems,"12 pp., tables 4, figures 15",,,,cs.AI cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper describes some basic approaches to detection of bottlenecks in
composite (modular) systems. The following basic system bottlenecks detection
problems are examined: (1) traditional quality management approaches (Pareto
chart based method, multicriteria analysis as selection of Pareto-efficient
points, and/or multicriteria ranking), (2) selection of critical system
elements (critical components/modules, critical component interconnection), (3)
selection of interconnected system components as composite system faults (via
clique-based fusion), (4) critical elements (e.g., nodes) in networks, and (5)
predictive detection of system bottlenecks (detection of system components
based on forecasting of their parameters). Here, heuristic solving schemes are
used. Numerical examples illustrate the approaches.
","[{'version': 'v1', 'created': 'Sat, 1 Jun 2013 17:22:00 GMT'}]",2013-06-04,"[['Levin', 'Mark Sh.', '']]","['modular systems', 'system bottlenecks', 'engineering frameworks', 'combinatorial optimization', 'multicriteria decision making', 'networked systems', 'heuristics']"
14397,1206.1208,Alexandre Chotard,"Alexandre Adrien Chotard (LRI, INRIA Saclay - Ile de France), Anne
  Auger (INRIA Saclay - Ile de France), Nikolaus Hansen (LRI, INRIA Saclay -
  Ile de France, MSR - INRIA)",Cumulative Step-size Adaptation on Linear Functions: Technical Report,Parallel Problem Solving From Nature (2012),,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The CSA-ES is an Evolution Strategy with Cumulative Step size Adaptation,
where the step size is adapted measuring the length of a so-called cumulative
path. The cumulative path is a combination of the previous steps realized by
the algorithm, where the importance of each step decreases with time. This
article studies the CSA-ES on composites of strictly increasing with affine
linear functions through the investigation of its underlying Markov chains.
Rigorous results on the change and the variation of the step size are derived
with and without cumulation. The step-size diverges geometrically fast in most
cases. Furthermore, the influence of the cumulation parameter is studied.
","[{'version': 'v1', 'created': 'Wed, 6 Jun 2012 13:03:31 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Jun 2012 18:56:20 GMT'}]",2012-07-02,"[['Chotard', 'Alexandre Adrien', '', 'LRI, INRIA Saclay - Ile de France'], ['Auger', 'Anne', '', 'INRIA Saclay - Ile de France'], ['Hansen', 'Nikolaus', '', 'LRI, INRIA Saclay -\n  Ile de France, MSR - INRIA']]","['CSA', 'cumulative path', 'evolution path', 'evolution strategies', 'step-size adaptation']"
14398,1009.4898,Sanat  Sarangi,Sanat Sarangi and Subrat Kar,"Location Estimation with Reactive Routing in Resource Constrained Sensor
  Networks","6 pages, 6 figures","International Conference on Sensors and Related Networks
  (SENNET'09), VIT University, Vellore, India, Dec. 08-10, 2009, pp.563-567",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Routing algorithms for wireless sensor networks can be broadly divided into
two classes - proactive and reactive. Proactive routing is suitable for a
network with a fixed topology. On the other hand, reactive routing is more
suitable for a set of mobile nodes where routes are created on demand and there
is not much time to evaluate the worthiness of a route, the prime concern being
reachability due to constantly changing node positions. Sensor networks route
events of interest from source(s) to destination(s) where appropriate actions
could be taken. However, with mobile sensor nodes, it is not only important to
know the events but the location of the nodes generating the events. Most
sensor nodes are not equipped with expensive GPS or accurate RSSI computation
hardware to aid localization. Keeping these in view, we propose a modified
reactive routing algorithm, with added support for localization, to localize
mobile sensor nodes on the basis of information received from fixed sensor
nodes during mutual exchange of routing control packets. The accuracy of
localization depends on the ratio of the number of fixed nodes to the number of
mobile nodes and the topology of the fixed nodes. A typical application
scenario would be a mix of mobile nodes and fixed nodes, where fixed nodes know
their absolute location and the location of mobile nodes is derived from the
fixed nodes, in step with the reactive routing protocol in action. The modified
algorithm would be suitable for deployments where the approximate position of a
mobile node (i.e. the event location) is required but there is no external
support infrastructure available for localization.
","[{'version': 'v1', 'created': 'Fri, 24 Sep 2010 17:30:56 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Aug 2012 14:28:01 GMT'}]",2012-08-02,"[['Sarangi', 'Sanat', ''], ['Kar', 'Subrat', '']]","['wireless sensor networks', 'localization', 'AODV', 'AODVjr', 'centroid']"
14399,1004.0599,Secretary Aircc Journal,"Yoshito Kanamori(1), Seong-Moo Yoo(2), ((1)University of Alaska
  Anchorage, Alaska, USA, (2)The University of Alabama in Huntsville, Alabama,
  USA)","Quantum Three-Pass protocol: Key distribution using quantum
  superposition states",7Pages,"International Journal of Network Security & Its Applications 1.2
  (2009) 64-70",,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This letter proposes a novel key distribution protocol with no key exchange
in advance, which is secure as the BB84 quantum key distribution protocol. Our
protocol utilizes a photon in superposition state for single-bit data
transmission instead of a classical electrical/optical signal. The security of
this protocol relies on the fact, that the arbitrary quantum state cannot be
cloned, known as the no-cloning theorem. This protocol can be implemented with
current technologies.
","[{'version': 'v1', 'created': 'Mon, 5 Apr 2010 09:15:29 GMT'}]",2010-07-15,"[['Kanamori', 'Yoshito', ''], ['Yoo', 'Seong-Moo', '']]","['Cryptography', 'Key Distribution', 'No Key-Exchange', 'Quantum Superposition State']"
14400,1301.2689,Thirumurugan Shomasundaram,"S. Thirumurugan, E. George Dharma Prakash Raj","An Extended Weighted Partitioning Around Cluster Head Mechanism for Ad
  Hoc Network",IJASUC 2012,,,,cs.NI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The wireless network places vital role in the present day communication
scenario. The ad hoc nature of wireless communication adds flavour to suit
various real world applications. This improves the performance of the network
tremendously while the clustering mechanism gets added to the ad hoc network.
It has been found out that the existing WCA lacks in forming efficient
clusters. Thus, this work proposes an Extended weighted partitioning around
cluster head mechanism by considering W-PAC as a base to form clusters. The
cluster members are configured with IPv6 address. This IPv6 clusters formed
through W-PAC will be taken further for validation to determine the perfectness
of clusters. The cluster formation and maintenance have been implemented in C++
as a programming language. The cluster validation has been carried out using
OMNET++ simulator.
","[{'version': 'v1', 'created': 'Sat, 12 Jan 2013 14:08:52 GMT'}]",2013-01-15,"[['Thirumurugan', 'S.', ''], ['Raj', 'E. George Dharma Prakash', '']]","['W-PAC', 'Validation', 'IPv6', 'WCA']"
14401,1301.4551,Deepali Virmani,Deepali Virmani and Satbir Jain,"Decentralized Lifetime Minimizing Tree for Data Aggregation in Wireless
  Sensor Networks","12 pages, 4 figures","WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY ISSUE 28
  APRIL 2009",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To meet the demands of wireless sensor networks (WSNs) where data are usually
aggregated at a single source prior to transmitting to any distant user, there
is a need to establish a tree structure inside any given event region. In this
paper, we propose a novel technique to create one such tree, which preserves
the energy and minimizes the lifetime of event sources while they are
constantly transmitting for data aggregation in future WSNs. We use the term
Decentralized Lifetime-Minimizing Tree (DLMT) to denote this tree. DLMT
features in nodes with higher energy tend to be chosen as data aggregating
parents so that the time to detect the first broken tree link can be extended
and less energy is involved in tree maintenance. In addition, by constructing
the tree in such a way, the protocol is also able to reduce the frequency of
tree reconstruction, minimizes the amount of data loss, minimizes the delay
during data collection and preserves the energy. Forwarded directed Diffusion
protocol is chosen as the routing platform.
","[{'version': 'v1', 'created': 'Sat, 19 Jan 2013 09:53:45 GMT'}]",2013-01-22,"[['Virmani', 'Deepali', ''], ['Jain', 'Satbir', '']]","['― branch energy', 'decentralized', 'energy level', 'lifetime', 'tree energy']"
14402,1304.5774,Mikhail Berlinkov,Mikhail V. Berlinkov,On the probability of being synchronizable,Numerous fixes in the proof,,,,cs.FL cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove that a random automaton with $n$ states and any fixed non-singleton
alphabet is synchronizing with high probability. Moreover, we also prove that
the convergence rate is exactly $1-\Theta(\frac{1}{n})$ as conjectured by
Cameron \cite{CamConj} for the most interesting binary alphabet case. Finally,
we describe a deterministic algorithm which decides whether a given random
automaton is synchronizing in linear expected time.
","[{'version': 'v1', 'created': 'Sun, 21 Apr 2013 18:16:26 GMT'}, {'version': 'v10', 'created': 'Sun, 27 Oct 2013 05:05:25 GMT'}, {'version': 'v11', 'created': 'Tue, 19 Nov 2013 09:03:27 GMT'}, {'version': 'v12', 'created': 'Wed, 27 Nov 2013 05:58:11 GMT'}, {'version': 'v13', 'created': 'Wed, 8 Jan 2014 07:15:45 GMT'}, {'version': 'v14', 'created': 'Mon, 13 Jan 2014 15:56:16 GMT'}, {'version': 'v15', 'created': 'Mon, 24 Mar 2014 16:09:06 GMT'}, {'version': 'v16', 'created': 'Mon, 16 Feb 2015 17:01:30 GMT'}, {'version': 'v17', 'created': 'Sat, 4 Jul 2015 04:49:56 GMT'}, {'version': 'v18', 'created': 'Tue, 29 Sep 2015 07:47:47 GMT'}, {'version': 'v19', 'created': 'Tue, 17 Nov 2015 13:52:46 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Apr 2013 15:38:07 GMT'}, {'version': 'v20', 'created': 'Wed, 1 Jun 2016 06:27:16 GMT'}, {'version': 'v21', 'created': 'Sat, 6 Jul 2019 00:09:09 GMT'}, {'version': 'v22', 'created': 'Sat, 28 Mar 2020 21:17:54 GMT'}, {'version': 'v3', 'created': 'Sun, 28 Apr 2013 06:13:48 GMT'}, {'version': 'v4', 'created': 'Mon, 20 May 2013 10:52:52 GMT'}, {'version': 'v5', 'created': 'Tue, 21 May 2013 17:21:51 GMT'}, {'version': 'v6', 'created': 'Sun, 7 Jul 2013 10:51:19 GMT'}, {'version': 'v7', 'created': 'Sat, 10 Aug 2013 04:07:49 GMT'}, {'version': 'v8', 'created': 'Thu, 15 Aug 2013 18:27:30 GMT'}, {'version': 'v9', 'created': 'Mon, 19 Aug 2013 16:58:36 GMT'}]",2020-03-31,"[['Berlinkov', 'Mikhail V.', '']]","['synchronizing automata', 'random mappings', 'random digraphs']"
14403,1111.4886,Vijay Mahantesh S M,"S. M. Vijay Mahantesh, Sudarshan Iyengar, M. Vijesh, Shruthi Nayak,
  Nikitha Shenoy",Prediction Of Arrival Of Nodes In A Scale Free Network,,,,,cs.SI cs.NI physics.soc-ph q-bio.PE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most of the networks observed in real life obey power-law degree
distribution. It is hypothesized that the emergence of such a degree
distribution is due to preferential attachment of the nodes. Barabasi-Albert
model is a generative procedure that uses preferential attachment based on
degree and one can use this model to generate networks with power-law degree
distribution. In this model, the network is assumed to grow one node every time
step. After the evolution of such a network, it is impossible for one to
predict the exact order of node arrivals. We present in this article, a novel
strategy to partially predict the order of node arrivals in such an evolved
network. We show that our proposed method outperforms other centrality measure
based approaches. We bin the nodes and predict the order of node arrivals
between the bins with an accuracy of above 80%.
","[{'version': 'v1', 'created': 'Mon, 21 Nov 2011 14:56:11 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Nov 2011 15:07:38 GMT'}]",2011-11-28,"[['Mahantesh', 'S. M. Vijay', ''], ['Iyengar', 'Sudarshan', ''], ['Vijesh', 'M.', ''], ['Nayak', 'Shruthi', ''], ['Shenoy', 'Nikitha', '']]","['preferential attachment', 'scale-free networks', 'node-arrival ordering', 'node aging']"
14404,1110.1046,Reza Sabbaghi,Hamid Javashi and Reza Sabbaghi-Nadooshan,A Novel Elliptic curve cryptography Processor using NoC design,,,,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose an elliptic curve key generation processor over
GF(2m) and GF(P) with Network-on-Chip (NoC) design scheme based on binary
scalar multiplication algorithm. Over the Two last decades, Elliptic Curve
Cryptography (ECC) has gained increasing acceptance in the industry and the
academic community. This interest is mainly caused by the same level of
security with relatively small keys provided by ECC comparing to large key size
in Rivest Shamir Adleman (RSA). Parallelism can be utilized in different
hierarchy levels as shown in many publications. By using NoC, a new method with
the reduced latency of point multiplication (with parallel field arithmetic) is
introduced in this paper.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2011 17:04:04 GMT'}]",2011-10-06,"[['Javashi', 'Hamid', ''], ['Sabbaghi-Nadooshan', 'Reza', '']]","['ECC', 'ECPM', 'NoC', 'parallelism']"
14405,1002.3077,Marc Mezzarobba,Marc Mezzarobba (INRIA Rocquencourt),"NumGfun: a Package for Numerical and Analytic Computation with D-finite
  Functions",,,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article describes the implementation in the software package NumGfun of
classical algorithms that operate on solutions of linear differential equations
or recurrence relations with polynomial coefficients, including what seems to
be the first general implementation of the fast high-precision numerical
evaluation algorithms of Chudnovsky & Chudnovsky. In some cases, our
descriptions contain improvements over existing algorithms. We also provide
references to relevant ideas not currently used in NumGfun.
","[{'version': 'v1', 'created': 'Tue, 16 Feb 2010 13:07:30 GMT'}, {'version': 'v2', 'created': 'Mon, 31 May 2010 08:12:06 GMT'}]",2010-06-01,"[['Mezzarobba', 'Marc', '', 'INRIA Rocquencourt']]","['D-finite functions', 'linear differential equations', 'certified numerical computation', 'bounds', 'Maple']"
14406,1109.6299,Vilem Vychodil,"Radim Belohlavek, Lucie Urbanova, Vilem Vychodil","Sensitivity Analysis for Declarative Relational Query Languages with
  Ordinal Ranks","The paper will appear in Proceedings of the 19th International
  Conference on Applications of Declarative Programming and Knowledge
  Management (INAP 2011)",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present sensitivity analysis for results of query executions in a
relational model of data extended by ordinal ranks. The underlying model of
data results from the ordinary Codd's model of data in which we consider
ordinal ranks of tuples in data tables expressing degrees to which tuples match
queries. In this setting, we show that ranks assigned to tuples are insensitive
to small changes, i.e., small changes in the input data do not yield large
changes in the results of queries.
","[{'version': 'v1', 'created': 'Wed, 28 Sep 2011 19:04:18 GMT'}]",2011-09-29,"[['Belohlavek', 'Radim', ''], ['Urbanova', 'Lucie', ''], ['Vychodil', 'Vilem', '']]","['declarative query languages', 'ordinal ranks', 'relational databases', 'residuated lattices']"
14407,1412.3046,Hanie Sedghi,"Hanie Sedghi, Majid Janzamin, Anima Anandkumar","Provable Tensor Methods for Learning Mixtures of Generalized Linear
  Models",To appear in Proceeding of AI and Statistics (AISTATS) 2016,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of learning mixtures of generalized linear models
(GLM) which arise in classification and regression problems. Typical learning
approaches such as expectation maximization (EM) or variational Bayes can get
stuck in spurious local optima. In contrast, we present a tensor decomposition
method which is guaranteed to correctly recover the parameters. The key insight
is to employ certain feature transformations of the input, which depend on the
input generative model. Specifically, we employ score function tensors of the
input and compute their cross-correlation with the response variable. We
establish that the decomposition of this tensor consistently recovers the
parameters, under mild non-degeneracy conditions. We demonstrate that the
computational and sample complexity of our method is a low order polynomial of
the input and the latent dimensions.
","[{'version': 'v1', 'created': 'Tue, 9 Dec 2014 18:27:48 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Mar 2015 04:43:36 GMT'}, {'version': 'v3', 'created': 'Tue, 13 Oct 2015 06:54:54 GMT'}, {'version': 'v4', 'created': 'Wed, 13 Jan 2016 00:19:00 GMT'}]",2016-01-14,"[['Sedghi', 'Hanie', ''], ['Janzamin', 'Majid', ''], ['Anandkumar', 'Anima', '']]","['Mixture of generalized linear models', 'score function', 'spectral/tensor decomposition']"
14408,1504.04869,Hanna Furmanczyk,"Hanna Furma\'nczyk, Rita Zuazua",Equitable total coloring of corona of cubic graphs,12 pages,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The minimum number of total independent partition sets of $V \cup E$ of a
graph $G=(V,E)$ is called the \emph{total chromatic number} of $G$, denoted by
$\chi''(G)$. If the difference between cardinalities of any two total
independent sets is at most one, then the minimum number of total independent
partition sets of $V \cup E$ is called the \emph{equitable total chromatic
number}, and is denoted by $\chi''_=(G)$.
  In this paper we consider equitable total coloring of coronas of cubic
graphs, $G \circ H$. It turns out that, independly on the values of equitable
total chromatic number of factors $G$ and $H$, equitable total chromatic number
of corona $G \circ H$ is equal to $\Delta(G \circ H) +1$. Thereby, we confirm
Total Coloring Conjecture (TCC), posed by Behzad in 1964, and Equitable Total
Coloring Conjecture (ETCC), posed by Wang in 2002, for coronas of cubic graphs.
As a direct consequence we get that all coronas of cubic graphs are of Type 1.
","[{'version': 'v1', 'created': 'Sun, 19 Apr 2015 18:54:43 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Nov 2018 18:19:56 GMT'}]",2018-11-06,"[['Furmańczyk', 'Hanna', ''], ['Zuazua', 'Rita', '']]","['equitable coloring', 'total coloring', 'equitable total coloring', 'cubicgraphs']"
14409,1205.2465,Julian Eberius,"Julian Eberius, Katrin Braunschweig, Maik Thiele and Wolfgang Lehner",Identifying And Weighting Integration Hypotheses On Open Data Platforms,"Presented at the First International Workshop On Open Data, WOD-2012
  (http://arxiv.org/abs/1204.3726)",,,WOD/2012/NANTES/11,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Open data platforms such as data.gov or opendata.socrata. com provide a huge
amount of valuable information. Their free-for-all nature, the lack of
publishing standards and the multitude of domains and authors represented on
these platforms lead to new integration and standardization problems. At the
same time, crowd-based data integration techniques are emerging as new way of
dealing with these problems. However, these methods still require input in form
of specific questions or tasks that can be passed to the crowd. This paper
discusses integration problems on Open Data Platforms, and proposes a method
for identifying and ranking integration hypotheses in this context. We will
evaluate our findings by conducting a comprehensive evaluation using on one of
the largest Open Data platforms.
","[{'version': 'v1', 'created': 'Fri, 11 May 2012 09:31:27 GMT'}]",2012-05-14,"[['Eberius', 'Julian', ''], ['Braunschweig', 'Katrin', ''], ['Thiele', 'Maik', ''], ['Lehner', 'Wolfgang', '']]","['Open Data Platforms', 'Data Integration', 'Crowdsourcing']"
14410,1212.1896,Muhammad Yasir Malik,Muhammad Yasir Malik,Power Consumption Analysis of a Modern Smartphone,"11 pages, 6 figures, 5 tables",,,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents observations about power consumption of a latest
smartphone. Modern smartphones are powerful devices with different choices of
data connections and other functional modes. This paper provides analysis of
power utilization for these different operation modes. Also, we present power
consumption by vital operating system (OS) components.
","[{'version': 'v1', 'created': 'Sun, 9 Dec 2012 16:00:33 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Jan 2013 06:39:34 GMT'}]",2013-01-11,"[['Malik', 'Muhammad Yasir', '']]","['smart phone', 'power', 'consumption', 'analysis', 'operating system']"
14411,1705.08627,Yoram Moses,Asa Dan and Rajit Manohar and Yoram Moses,On Using Time Without Clocks via Zigzag Causality,This is an extended version of a paper to appear in PODC 2017,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Even in the absence of clocks, time bounds on the duration of actions enable
the use of time for distributed coordination. This paper initiates an
investigation of coordination in such a setting. A new communication structure
called a zigzag pattern is introduced, and shown to guarantee bounds on the
relative timing of events in this clockless model. Indeed, zigzag patterns are
shown to be necessary and sufficient for establishing that events occur in a
manner that satisfies prescribed bounds. We capture when a process can know
that an appropriate zigzag pattern exists, and use this to provide necessary
and sufficient conditions for timed coordination of events using a
full-information protocol in the clockless model.
","[{'version': 'v1', 'created': 'Wed, 24 May 2017 06:42:01 GMT'}]",2017-05-25,"[['Dan', 'Asa', ''], ['Manohar', 'Rajit', ''], ['Moses', 'Yoram', '']]","['coordination', 'time', 'clocks', 'temporal ordering', 'time bounds']"
14412,1205.6845,Hassan Mansour,Hassan Mansour and Ozgur Yilmaz,Weighted-{$\ell_1$} minimization with multiple weighting sets,"Proceedings of the SPIE, Wavelets and Sparsity XIV, San Diego, August
  2011",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the support recovery conditions of weighted $\ell_1$
minimization for signal reconstruction from compressed sensing measurements
when multiple support estimate sets with different accuracy are available. We
identify a class of signals for which the recovered vector from $\ell_1$
minimization provides an accurate support estimate. We then derive stability
and robustness guarantees for the weighted $\ell_1$ minimization problem with
more than one support estimate. We show that applying a smaller weight to
support estimate that enjoy higher accuracy improves the recovery conditions
compared with the case of a single support estimate and the case with standard,
i.e., non-weighted, $\ell_1$ minimization. Our theoretical results are
supported by numerical simulations on synthetic signals and real audio signals.
","[{'version': 'v1', 'created': 'Wed, 30 May 2012 22:07:42 GMT'}]",2012-06-01,"[['Mansour', 'Hassan', ''], ['Yilmaz', 'Ozgur', '']]","['Compressed sensing', 'weighted ℓ1 minimization', 'partial support recovery']"
14413,1710.05104,Farnoosh Ghadiri,"Farnoosh Ghadiri, Robert Bergevin, Masoud Shafiee",An adaptive thresholding approach for automatic optic disk segmentation,Accepted in VISAPP 2015,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optic disk segmentation is a prerequisite step in automatic retinal screening
systems. In this paper, we propose an algorithm for optic disk segmentation
based on a local adaptive thresholding method. Location of the optic disk is
validated by intensity and average vessel width of retinal images. Then an
adaptive thresholding is applied on the temporal and nasal part of the optic
disc separately. Adaptive thresholding, makes our algorithm robust to
illumination variations and various image acquisition conditions. Moreover,
experimental results on the DRIVE and KHATAM databases show promising results
compared to the recent literature. In the DRIVE database, the optic disk in all
images is correctly located and the mean overlap reached to 43.21%. The optic
disk is correctly detected in 98% of the images with the mean overlap of 36.32%
in the KHATAM database.
","[{'version': 'v1', 'created': 'Sat, 14 Oct 2017 00:04:52 GMT'}]",2017-10-17,"[['Ghadiri', 'Farnoosh', ''], ['Bergevin', 'Robert', ''], ['Shafiee', 'Masoud', '']]","['Optic disk segmentation', 'Adaptive threshold', 'Vessel segmentation']"
14414,1105.3287,Laurent Romary,"Laurent Romary (IDSL, INRIA Saclay - Ile de France)",Scholarly Communication,"To appear in Mehler, Romary, Gibbon (eds), Technical Communication,
  M. de Gruyter, Berlin (2011)",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The chapter tackles the role of scholarly publication in the research process
(quality, preservation) and looks at the consequences of new information
technologies in the organization of the scholarly communication ecology. It
will then show how new technologies have had an impact on the scholarly
communication process and made it depart from the traditional publishing
environment. Developments will address new editorial processes, dissemination
of new content and services, as well as the development of publication
archives. This last aspect will be covered on all levels (open access,
scientific, technical and legal aspects). A view on the possible evolutions of
the scientific publishing environment will be provided.
","[{'version': 'v1', 'created': 'Tue, 17 May 2011 07:06:14 GMT'}]",2011-05-18,"[['Romary', 'Laurent', '', 'IDSL, INRIA Saclay - Ile de France']]","['digital libraries & online journals', 'e-print archives', 'communication models', 'communication platforms', 'copyright issues', 'open archive initiative']"
14415,1702.00312,Hui Liu Mr,"Hui Liu, Tao Cui, Wei Leng, Linbo Zhang","Dynamic load balancing for large-scale adaptive finite element
  computation",in Chinese,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For the parallel computation of partial differential equations, one key is
the grid partitioning. It requires that each process owns the same amount of
computations, and also, the partitioning quality should be proper to reduce the
communications among processes. When calculating the partial differential
equations using adaptive finite element methods, the grid and the basis
functions adjust in each iteration, which introduce load balancing issues. The
grid should be redistributed dynamically. This paper studies dynamic load
balancing algorithms and the implementation on the adaptive finite element
platform PHG. The numerical experiments show that algorithms studied in this
paper have good partitioning quality, and they are efficient.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2017 03:17:31 GMT'}]",2017-02-02,"[['Liu', 'Hui', ''], ['Cui', 'Tao', ''], ['Leng', 'Wei', ''], ['Zhang', 'Linbo', '']]","['adaptive finite element methods', 'parallel computing', 'dynamic load balancing', 'space-fillingcurve method', 'refinement tree method']"
14416,1407.7073,Weinan Zhang,"Weinan Zhang, Shuai Yuan, Jun Wang, Xuehua Shen",Real-Time Bidding Benchmarking with iPinYou Dataset,UCL Technical Report 2014,,,,cs.GT cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Being an emerging paradigm for display advertising, Real-Time Bidding (RTB)
drives the focus of the bidding strategy from context to users' interest by
computing a bid for each impression in real time. The data mining work and
particularly the bidding strategy development becomes crucial in this
performance-driven business. However, researchers in computational advertising
area have been suffering from lack of publicly available benchmark datasets,
which are essential to compare different algorithms and systems. Fortunately, a
leading Chinese advertising technology company iPinYou decided to release the
dataset used in its global RTB algorithm competition in 2013. The dataset
includes logs of ad auctions, bids, impressions, clicks, and final conversions.
These logs reflect the market environment as well as form a complete path of
users' responses from advertisers' perspective. This dataset directly supports
the experiments of some important research problems such as bid optimisation
and CTR estimation. To the best of our knowledge, this is the first publicly
available dataset on RTB display advertising. Thus, they are valuable for
reproducible research and understanding the whole RTB ecosystem. In this paper,
we first provide the detailed statistical analysis of this dataset. Then we
introduce the research problem of bid optimisation in RTB and the simple yet
comprehensive evaluation protocol. Besides, a series of benchmark experiments
are also conducted, including both click-through rate (CTR) estimation and bid
optimisation.
","[{'version': 'v1', 'created': 'Fri, 25 Jul 2014 23:20:29 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Aug 2014 11:22:17 GMT'}, {'version': 'v3', 'created': 'Thu, 21 May 2015 18:20:30 GMT'}]",2015-05-22,"[['Zhang', 'Weinan', ''], ['Yuan', 'Shuai', ''], ['Wang', 'Jun', ''], ['Shen', 'Xuehua', '']]","['Benchmark Dataset', 'Real-Time Bidding', 'Demand-Side Platform', 'CTR Prediction']"
14417,1401.7435,Henok Getachew Alemayehu,"Naod Duga Jebessa, Henok Getachew Alemayehu","Mobile Services and ICT4D, To the Network Economy - Bridging the Digital
  Divide, Ethiopia's Case","3rd Scientific Conference on Electrical Engineering, Organized by
  Ethiopian Society of Electrical Engineers and Electrical and Computer
  Engineering Department, Addis Ababa University, 22-23 August 2009. Keywords:
  mobile services, ICT4D, appropriate technologies, telecom in Ethiopia,
  development, Parlay/JAIN, techno-economics",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a development paradigm for Ethiopia, based on appropriate
services and innovative use of mobile communications technologies via
applications tailored for sectors like business, finance, healthcare,
governance, education and infotainment. The experience of other developing
countries like India and Kenya is cited so as to adapt those to the Ethiopian
context. Notable application areas in the aforementioned sectors have been
outlined. The ETC 'next generation network' is taken into consideration, with
an emphasis on mobile service offering by the Telco itself and/or third party
service providers. In addition, enabling technologies like mobile internet,
location-based systems, open interfaces to large telecom networks, specifically
service-oriented architecture (SOA), Parlay/JAIN and the like are discussed.
The paper points out possible endeavors by such stakeholders like: telecom
agencies and network operators; businesses, government and NGOs; entrepreneurs
and innovators; technology companies and professionals; as well as researchers
and academic institutions. ICT4D through mobile services and their role in
bridging the digital divide by building a virtual 'network economy' is
presented.
","[{'version': 'v1', 'created': 'Wed, 29 Jan 2014 08:48:28 GMT'}]",2014-01-30,"[['Jebessa', 'Naod Duga', ''], ['Alemayehu', 'Henok Getachew', '']]","['mobile services', 'ICT4D', 'appropriate technologies', 'telecom in Ethiopia', 'development', 'Parlay/JAIN', 'techno-economics']"
14418,1702.05970,Patrick Christ,"Patrick Ferdinand Christ, Florian Ettlinger, Felix Gr\""un, Mohamed
  Ezzeldin A. Elshaera, Jana Lipkova, Sebastian Schlecht, Freba Ahmaddy, Sunil
  Tatavarty, Marc Bickel, Patrick Bilic, Markus Rempfler, Felix Hofmann, Melvin
  D Anastasi, Seyed-Ahmad Ahmadi, Georgios Kaissis, Julian Holch, Wieland
  Sommer, Rickmer Braren, Volker Heinemann, Bjoern Menze","Automatic Liver and Tumor Segmentation of CT and MRI Volumes using
  Cascaded Fully Convolutional Neural Networks",Under Review,,,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic segmentation of the liver and hepatic lesions is an important step
towards deriving quantitative biomarkers for accurate clinical diagnosis and
computer-aided decision support systems. This paper presents a method to
automatically segment liver and lesions in CT and MRI abdomen images using
cascaded fully convolutional neural networks (CFCNs) enabling the segmentation
of a large-scale medical trial or quantitative image analysis. We train and
cascade two FCNs for a combined segmentation of the liver and its lesions. In
the first step, we train a FCN to segment the liver as ROI input for a second
FCN. The second FCN solely segments lesions within the predicted liver ROIs of
step 1. CFCN models were trained on an abdominal CT dataset comprising 100
hepatic tumor volumes. Validations on further datasets show that CFCN-based
semantic liver and lesion segmentation achieves Dice scores over 94% for liver
with computation times below 100s per volume. We further experimentally
demonstrate the robustness of the proposed method on an 38 MRI liver tumor
volumes and the public 3DIRCAD dataset.
","[{'version': 'v1', 'created': 'Mon, 20 Feb 2017 13:52:57 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Feb 2017 15:02:59 GMT'}]",2017-02-24,"[['Christ', 'Patrick Ferdinand', ''], ['Ettlinger', 'Florian', ''], ['Grün', 'Felix', ''], ['Elshaera', 'Mohamed Ezzeldin A.', ''], ['Lipkova', 'Jana', ''], ['Schlecht', 'Sebastian', ''], ['Ahmaddy', 'Freba', ''], ['Tatavarty', 'Sunil', ''], ['Bickel', 'Marc', ''], ['Bilic', 'Patrick', ''], ['Rempfler', 'Markus', ''], ['Hofmann', 'Felix', ''], ['Anastasi', 'Melvin D', ''], ['Ahmadi', 'Seyed-Ahmad', ''], ['Kaissis', 'Georgios', ''], ['Holch', 'Julian', ''], ['Sommer', 'Wieland', ''], ['Braren', 'Rickmer', ''], ['Heinemann', 'Volker', ''], ['Menze', 'Bjoern', '']]","['Liver', 'Lesion', 'Segmentation', 'FCN', 'CRF', 'Deep Learning']"
14419,1501.03839,Arkady Klimov,Arkady Klimov,"Yet Another Way of Building Exact Polyhedral Model for Weakly Dynamic
  Affine Programs","8 pages, 11 figures, was submitted to IMPACT-2015 (however was not
  accepted)",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Exact polyhedral model (PM) can be built in the general case if the only
control structures are {\tt do}-loops and structured {\tt if}s, and if loop
counter bounds, array subscripts and {\tt if}-conditions are affine expressions
of enclosing loop counters and possibly some integer constants. In more general
dynamic control programs, where arbitrary {\tt if}s and {\tt while}s are
allowed, in the general case the usual dataflow analysis can be only fuzzy.
This is not a problem when PM is used just for guiding the parallelizing
transformations, but is insufficient for transforming source programs to other
computation models (CM) relying on the PM, such as our version of dataflow CM
or the well-known KPN.
  The paper presents a novel way of building the exact polyhedral model and an
extension of the concept of the exact PM, which allowed us to add in a natural
way all the processing related to the data dependent conditions. Currently, in
our system, only arbirary {\tt if}s (not {\tt while}s) are allowed in input
programs. The resulting polyhedral model can be easily put out as an equivalent
program with the dataflow computation semantics.
","[{'version': 'v1', 'created': 'Thu, 15 Jan 2015 22:07:16 GMT'}]",2015-01-19,"[['Klimov', 'Arkady', '']]","['exact polyhedral model', 'weakly dynamic affine programs', 'data dependent conditionals', 'dataflow computation model']"
14420,1202.5482,Richard McClatchey,"Hanene Boussi Rahmouni, Kamran Munir, Mohammed Odeh and Richard
  McClatchey",Risk-Driven Compliant Access Controls for Clouds,"9 pages, 3 figures. International Arab Conference on Information
  Technology (ACIT 2011) / Riyadh, Saudi Arabia. December 2012",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is widespread agreement that cloud computing have proven cost cutting
and agility benefits. However, security and regulatory compliance issues are
continuing to challenge the wide acceptance of such technology both from social
and commercial stakeholders. An important facture behind this is the fact that
clouds and in particular public clouds are usually deployed and used within
broad geographical or even international domains. This implies that the
exchange of private and other protected data within the cloud environment would
be governed by multiple jurisdictions. These jurisdictions have a great degree
of harmonisation; however, they present possible conflicts that are hard to
negotiate at run time. So far, important efforts were played in order to deal
with regulatory compliance management for large distributed systems. However,
measurable solutions are required for the context of cloud. In this position
paper, we are suggesting an approach that starts with a conceptual model of
explicit regulatory requirements for exchanging private data on a
multijurisdictional environment and build on it in order to define metrics for
non-compliance or, in other terms, risks to compliance. These metrics will be
integrated within usual data access-control policies and will be checked at
policy analysis time before a decision to allow/deny the data access is made.
","[{'version': 'v1', 'created': 'Fri, 24 Feb 2012 15:49:39 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Nov 2012 08:55:44 GMT'}]",2012-11-14,"[['Rahmouni', 'Hanene Boussi', ''], ['Munir', 'Kamran', ''], ['Odeh', 'Mohammed', ''], ['McClatchey', 'Richard', '']]","['Cloud', 'Privacy', 'Data Access', 'Semantic Web', 'Requirements Engineering']"
14421,1511.02889,Norbert B\'atfai Ph.D.,Norbert B\'atfai,A disembodied developmental robotic agent called Samu B\'atfai,"21 pages, 16 figures",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The agent program, called Samu, is an experiment to build a disembodied
DevRob (Developmental Robotics) chatter bot that can talk in a natural language
like humans do. One of the main design feature is that Samu can be interacted
with using only a character terminal. This is important not only for practical
aspects of Turing test or Loebner prize, but also for the study of basic
principles of Developmental Robotics. Our purpose is to create a rapid
prototype of Q-learning with neural network approximators for Samu. We sketch
out the early stages of the development process of this prototype, where Samu's
task is to predict the next sentence of tales or conversations. The basic
objective of this paper is to reach the same results using reinforcement
learning with general function approximators that can be achieved by using the
classical Q lookup table on small input samples. The paper is closed by an
experiment that shows a significant improvement in Samu's learning when using
LZW tree to narrow the number of possible Q-actions.
","[{'version': 'v1', 'created': 'Mon, 9 Nov 2015 21:15:22 GMT'}]",2015-11-11,"[['Bátfai', 'Norbert', '']]","['machine intelligence', 'developmental robotics', 'deep Q-learning', 'Liv-Zempel-Welch tree']"
14422,1702.03400,Daniel Jung,"Matthias Fischer, Daniel Jung, Friedhelm Meyer auf der Heide","Gathering Anonymous, Oblivious Robots on a Grid",,,,,cs.DC cs.MA cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a swarm of $n$ autonomous mobile robots, distributed on a
2-dimensional grid. A basic task for such a swarm is the gathering process: All
robots have to gather at one (not predefined) place. A common local model for
extremely simple robots is the following: The robots do not have a common
compass, only have a constant viewing radius, are autonomous and
indistinguishable, can move at most a constant distance in each step, cannot
communicate, are oblivious and do not have flags or states. The only gathering
algorithm under this robot model, with known runtime bounds, needs
$\mathcal{O}(n^2)$ rounds and works in the Euclidean plane. The underlying time
model for the algorithm is the fully synchronous $\mathcal{FSYNC}$ model. On
the other side, in the case of the 2-dimensional grid, the only known gathering
algorithms for the same time and a similar local model additionally require a
constant memory, states and ""flags"" to communicate these states to neighbors in
viewing range. They gather in time $\mathcal{O}(n)$.
  In this paper we contribute the (to the best of our knowledge) first
gathering algorithm on the grid that works under the same simple local model as
the above mentioned Euclidean plane strategy, i.e., without memory (oblivious),
""flags"" and states. We prove its correctness and an $\mathcal{O}(n^2)$ time
bound in the fully synchronous $\mathcal{FSYNC}$ time model. This time bound
matches the time bound of the best known algorithm for the Euclidean plane
mentioned above. We say gathering is done if all robots are located within a
$2\times 2$ square, because in $\mathcal{FSYNC}$ such configurations cannot be
solved.
","[{'version': 'v1', 'created': 'Sat, 11 Feb 2017 09:34:13 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Feb 2017 12:34:24 GMT'}, {'version': 'v3', 'created': 'Thu, 3 Aug 2017 11:05:52 GMT'}]",2017-08-04,"[['Fischer', 'Matthias', ''], ['Jung', 'Daniel', ''], ['der Heide', 'Friedhelm Meyer auf', '']]","['gathering problem', 'autonomous robots', 'distributed algorithms', 'local algorithms', 'mobile agents', 'runtime bound', 'swarm formation problems']"
14423,1704.08526,Kiran Gupta A,"Naveen S Naik, Kiran A Gupta","An Efficient Reconfigurable FIR Digital Filter Using Modified Distribute
  Arithmetic Technique","5 pages,4 figures, journal 2015",,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper provides modified Distributed Arithmetic based technique to
compute sum of products saving appreciable number of Multiply And accumulation
blocks and this consecutively reduces circuit size. In this technique
multiplexer based structure is used to reuse the blocks so as to reduce the
required memory locations. In this technique a Carry Look Ahead based adder
tree is used to have better area-delay product. Designing of FIR filter is done
using VHDL and synthesized using Xilinx 12.2 synthesis tool and ISIM simulator.
The power analysis is done using Xilinx Xpower analyzer. The proposed structure
requires nearly 42% less cells, 40% less LUT flip-flop pairs used, and also 2%
less power compared with existing structure.
","[{'version': 'v1', 'created': 'Thu, 27 Apr 2017 12:07:52 GMT'}]",2017-04-28,"[['Naik', 'Naveen S', ''], ['Gupta', 'Kiran A', '']]","['Distributed arithmetic', 'Look up Table', 'Finite']"
14424,1710.05247,Aditya Aniruddha Shrotri,"Kuldeep S. Meel (1), Aditya A. Shrotri (2), Moshe Y. Vardi (2) ((1)
  National University of Singapore, (2) Rice University)",On Hashing-Based Approaches to Approximate DNF-Counting,"Full version of paper accepted to FSTTCS 2017. 12 pages +
  Acknowledgements + References + Appendix",,,,cs.LO cs.AI,http://creativecommons.org/licenses/by/4.0/,"  Propositional model counting is a fundamental problem in artificial
intelligence with a wide variety of applications, such as probabilistic
inference, decision making under uncertainty, and probabilistic databases.
Consequently, the problem is of theoretical as well as practical interest. When
the constraints are expressed as DNF formulas, Monte Carlo-based techniques
have been shown to provide a fully polynomial randomized approximation scheme
(FPRAS). For CNF constraints, hashing-based approximation techniques have been
demonstrated to be highly successful. Furthermore, it was shown that
hashing-based techniques also yield an FPRAS for DNF counting without usage of
Monte Carlo sampling. Our analysis, however, shows that the proposed
hashing-based approach to DNF counting provides poor time complexity compared
to the Monte Carlo-based DNF counting techniques. Given the success of
hashing-based techniques for CNF constraints, it is natural to ask: Can
hashing-based techniques provide an efficient FPRAS for DNF counting? In this
paper, we provide a positive answer to this question. To this end, we introduce
two novel algorithmic techniques: \emph{Symbolic Hashing} and \emph{Stochastic
Cell Counting}, along with a new hash family of \emph{Row-Echelon hash
functions}. These innovations allow us to design a hashing-based FPRAS for DNF
counting of similar complexity (up to polylog factors) as that of prior works.
Furthermore, we expect these techniques to have potential applications beyond
DNF counting.
","[{'version': 'v1', 'created': 'Sat, 14 Oct 2017 23:22:09 GMT'}]",2017-10-17,"[['Meel', 'Kuldeep S.', ''], ['Shrotri', 'Aditya A.', ''], ['Vardi', 'Moshe Y.', '']]","['Model Counting', 'Approximation', 'DNF', 'Hash Functions']"
14425,1005.5197,Aleksandrs Slivkins,"Aleksandrs Slivkins, Filip Radlinski and Sreenivas Gollapudi","Ranked bandits in metric spaces: learning optimally diverse rankings
  over large document collections","This is the full version of a paper in ICML 2010, with full proofs
  and a significantly revised presentation",,,,cs.LG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most learning to rank research has assumed that the utility of different
documents is independent, which results in learned ranking functions that
return redundant results. The few approaches that avoid this have rather
unsatisfyingly lacked theoretical foundations, or do not scale. We present a
learning-to-rank formulation that optimizes the fraction of satisfied users,
with several scalable algorithms that explicitly takes document similarity and
ranking context into account. Our formulation is a non-trivial common
generalization of two multi-armed bandit models from the literature: ""ranked
bandits"" (Radlinski et al., ICML 2008) and ""Lipschitz bandits"" (Kleinberg et
al., STOC 2008). We present theoretical justifications for this approach, as
well as a near-optimal algorithm. Our evaluation adds optimizations that
improve empirical performance, and shows that our algorithms learn orders of
magnitude more quickly than previous approaches.
","[{'version': 'v1', 'created': 'Fri, 28 May 2010 00:37:22 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Sep 2012 22:23:31 GMT'}]",2012-09-04,"[['Slivkins', 'Aleksandrs', ''], ['Radlinski', 'Filip', ''], ['Gollapudi', 'Sreenivas', '']]","['Online learning', 'clickthrough data', 'diversity', 'multi-armed bandits', 'contextualbandits', 'regret', 'metric spaces']"
14426,1505.05831,Marco Mondelli,"Shrinivas Kudekar, Marco Mondelli, Eren \c{S}a\c{s}o\u{g}lu, R\""udiger
  Urbanke","Reed-Muller Codes Achieve Capacity on the Binary Erasure Channel under
  MAP Decoding",4 pages,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that Reed-Muller codes achieve capacity under maximum a posteriori
bit decoding for transmission over the binary erasure channel for all rates $0
< R < 1$. The proof is generic and applies to other codes with sufficient
amount of symmetry as well. The main idea is to combine the following
observations: (i) monotone functions experience a sharp threshold behavior,
(ii) the extrinsic information transfer (EXIT) functions are monotone, (iii)
Reed--Muller codes are 2-transitive and thus the EXIT functions associated with
their codeword bits are all equal, and (iv) therefore the Area Theorem for the
average EXIT functions implies that RM codes' threshold is at channel capacity.
","[{'version': 'v1', 'created': 'Thu, 21 May 2015 18:41:44 GMT'}]",2015-05-22,"[['Kudekar', 'Shrinivas', ''], ['Mondelli', 'Marco', ''], ['Şaşoğlu', 'Eren', ''], ['Urbanke', 'Rüdiger', '']]","['RM codes', 'MAP decoding', 'capacity-achieving codes', 'BEC', 'EXIT function']"
14427,1408.0574,Adam Sealfon,Adam Sealfon and Aikaterini Sotiraki,Agreement in Partitioned Dynamic Networks,"A summary of these results will appear as a brief announcement in
  DISC 2014",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the dynamic network model, the communication graph is assumed to be
connected in every round but is otherwise arbitrary. We consider the related
setting of $p$-partitioned dynamic networks, in which the communication graph
in each round consists of at most $p$ connected components. We explore the
problem of $k$-agreement in this model for $k\geq p$. We show that if the
number of processes is unknown then it is impossible to achieve $k$-agreement
for any $k$ and any $p\geq 2$. Given an upper bound $n$ on the number of
processes, we provide algorithms achieving $k$-agreement in $p(n-p)$ rounds for
$k=p$ and in $O(n/\epsilon)$ rounds for $k=\lceil (1+\epsilon)p \rceil$.
","[{'version': 'v1', 'created': 'Mon, 4 Aug 2014 03:25:20 GMT'}]",2014-08-05,"[['Sealfon', 'Adam', ''], ['Sotiraki', 'Aikaterini', '']]","['distributed algorithms', 'dynamic networks', 'agreement', 'partitioned networks']"
14428,1504.03095,Junyuan Leng,"Junyuan Leng, Yadong Zhou, Junjie Zhang, Chengchen Hu","An Inference Attack Model for Flow Table Capacity and Usage: Exploiting
  the Vulnerability of Flow Table Overflow in Software-Defined Network",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As the most competitive solution for next-generation network,
software-defined network (SDN) and its dominant implementation OpenFlow, are
attracting more and more interests. But besides convenience and flexibility,
SDN/OpenFlow also introduces new kinds of limitations and security issues. Of
these limitations, the most obvious and maybe the most neglected one, is the
flow table capacity of SDN/OpenFlow switches.
  In this paper, we proposed a novel inference attack targeting at SDN/OpenFlow
network, which is motivated by the limited flow table capacities of
SDN/OpenFlow switches and the following measurable network performance decrease
resulting from frequent interactions between data plane and control plane when
the flow table is full. To our best knowledge, this is the first proposed
inference attack model of this kind for SDN/OpenFlow. We also implemented an
inference attack framework according to our model and examined its efficiency
and accuracy. The simulation results demonstrate that our framework can infer
the network parameters(flow table capacity and flow table usage) with an
accuracy of 80% or higher. These findings give us a deeper understanding of
SDN/OpenFlow limitations and serve as guidelines to future improvements of
SDN/OpenFlow.
","[{'version': 'v1', 'created': 'Mon, 13 Apr 2015 08:21:31 GMT'}]",2015-04-14,"[['Leng', 'Junyuan', ''], ['Zhou', 'Yadong', ''], ['Zhang', 'Junjie', ''], ['Hu', 'Chengchen', '']]","['SDN', 'inference attack', 'information leakage']"
14429,1507.00209,Hai Zhuge Mr,Hai Zhuge,Dimensionality on Summarization,,,,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Summarization is one of the key features of human intelligence. It plays an
important role in understanding and representation. With rapid and continual
expansion of texts, pictures and videos in cyberspace, automatic summarization
becomes more and more desirable. Text summarization has been studied for over
half century, but it is still hard to automatically generate a satisfied
summary. Traditional methods process texts empirically and neglect the
fundamental characteristics and principles of language use and understanding.
This paper summarizes previous text summarization approaches in a
multi-dimensional classification space, introduces a multi-dimensional
methodology for research and development, unveils the basic characteristics and
principles of language use and understanding, investigates some fundamental
mechanisms of summarization, studies the dimensions and forms of
representations, and proposes a multi-dimensional evaluation mechanisms.
Investigation extends to the incorporation of pictures into summary and to the
summarization of videos, graphs and pictures, and then reaches a general
summarization framework.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2015 12:39:50 GMT'}]",2015-07-02,"[['Zhuge', 'Hai', '']]","['Natural language processing', 'classification', 'semantic link', 'dimension', 'text summarization', 'video summarization', 'graph summarization', 'picture summarization']"
14430,1301.0955,Erwan Le Martelot,Erwan Le Martelot and Chris Hankin,"Fast Multi-Scale Community Detection based on Local Criteria within a
  Multi-Threaded Algorithm",arXiv admin note: text overlap with arXiv:1204.1002,,,,cs.DS cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many systems can be described using graphs, or networks. Detecting
communities in these networks can provide information about the underlying
structure and functioning of the original systems. Yet this detection is a
complex task and a large amount of work was dedicated to it in the past decade.
One important feature is that communities can be found at several scales, or
levels of resolution, indicating several levels of organisations. Therefore
solutions to the community structure may not be unique. Also networks tend to
be large and hence require efficient processing. In this work, we present a new
algorithm for the fast detection of communities across scales using a local
criterion. We exploit the local aspect of the criterion to enable parallel
computation and improve the algorithm's efficiency further. The algorithm is
tested against large generated multi-scale networks and experiments demonstrate
its efficiency and accuracy.
","[{'version': 'v1', 'created': 'Sat, 5 Jan 2013 23:44:55 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Feb 2013 16:42:21 GMT'}]",2013-02-06,"[['Martelot', 'Erwan Le', ''], ['Hankin', 'Chris', '']]","['community detection', 'local criterion', 'multi-scale', 'fast computation', 'large networks', 'parallel computation', 'multi-threading']"
14431,1707.09258,Robin Burke,"Robin Burke, Himan Abdollahpouri",Patterns of Multistakeholder Recommendation,"Presented at the 2017 Workshop on Value-Aware and Multistakeholder
  Recommendation",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender systems are personalized information systems. However, in many
settings, the end-user of the recommendations is not the only party whose needs
must be represented in recommendation generation. Incorporating this insight
gives rise to the notion of multistakeholder recommendation, in which the
interests of multiple parties are represented in recommendation algorithms and
evaluation. In this paper, we identify patterns of stakeholder utility that
characterize different multistakeholder recommendation applications, and
provide a taxonomy of the different possible systems, only some of which have
currently been implemented.
","[{'version': 'v1', 'created': 'Fri, 28 Jul 2017 14:42:34 GMT'}]",2017-07-31,"[['Burke', 'Robin', ''], ['Abdollahpouri', 'Himan', '']]","['Multistakeholder Recommendation', 'Recommender systems', 'Reciprocal Recommendation']"
14432,1007.2353,Aleksei Kurgansky,Oleksiy Kurganskyy and Igor Potapov,"A measure of state transition of collective of stateless automata in
  discrete environment","13 pages, 3 figures",,,,cs.FL cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work a collective of interacting stateless automata in a discrete
geometric environment is considered as an integral automata-like computational
dynamic object. For such distributed on the environment object different
approaches to definition of the measure of state transition are possible. We
propose a geometric approach for defining what a state is.
","[{'version': 'v1', 'created': 'Wed, 14 Jul 2010 15:16:27 GMT'}]",2010-07-15,"[['Kurganskyy', 'Oleksiy', ''], ['Potapov', 'Igor', '']]","['Collective of automata', 'cellular automata', 'finite automatatheory', 'special relativity theory']"
14433,1502.04492,Francesco  Palmieri A. N.,Amedeo Buonanno and Francesco A.N. Palmieri,Towards Building Deep Networks with Bayesian Factor Graphs,Submitted for journal publication,,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a Multi-Layer Network based on the Bayesian framework of the
Factor Graphs in Reduced Normal Form (FGrn) applied to a two-dimensional
lattice. The Latent Variable Model (LVM) is the basic building block of a
quadtree hierarchy built on top of a bottom layer of random variables that
represent pixels of an image, a feature map, or more generally a collection of
spatially distributed discrete variables. The multi-layer architecture
implements a hierarchical data representation that, via belief propagation, can
be used for learning and inference. Typical uses are pattern completion,
correction and classification. The FGrn paradigm provides great flexibility and
modularity and appears as a promising candidate for building deep networks: the
system can be easily extended by introducing new and different (in cardinality
and in type) variables. Prior knowledge, or supervised information, can be
introduced at different scales. The FGrn paradigm provides a handy way for
building all kinds of architectures by interconnecting only three types of
units: Single Input Single Output (SISO) blocks, Sources and Replicators. The
network is designed like a circuit diagram and the belief messages flow
bidirectionally in the whole system. The learning algorithms operate only
locally within each block. The framework is demonstrated in this paper in a
three-layer structure applied to images extracted from a standard data set.
","[{'version': 'v1', 'created': 'Mon, 16 Feb 2015 11:01:25 GMT'}]",2015-02-17,"[['Buonanno', 'Amedeo', ''], ['Palmieri', 'Francesco A. N.', '']]","['Bayesian Networks', 'Factor Graphs', 'Deep Belief Networks']"
14434,1407.6082,Igor Milevskiy,"Igor Milevskiy, Yuri Boykov","Joint Energy-based Detection and Classificationon of Multilingual Text
  Lines",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a new hierarchical MDL-based model for a joint detection
and classification of multilingual text lines in im- ages taken by hand-held
cameras. The majority of related text detec- tion methods assume alphabet-based
writing in a single language, e.g. in Latin. They use simple clustering
heuristics specific to such texts: prox- imity between letters within one line,
larger distance between separate lines, etc. We are interested in a
significantly more ambiguous problem where images combine alphabet and
logographic characters from multiple languages and typographic rules vary a lot
(e.g. English, Korean, and Chinese). Complexity of detecting and classifying
text lines in multiple languages calls for a more principled approach based on
information- theoretic principles. Our new MDL model includes data costs
combining geometric errors with classification likelihoods and a hierarchical
sparsity term based on label costs. This energy model can be efficiently
minimized by fusion moves. We demonstrate robustness of the proposed algorithm
on a large new database of multilingual text images collected in the pub- lic
transit system of Seoul.
","[{'version': 'v1', 'created': 'Wed, 23 Jul 2014 01:14:01 GMT'}]",2016-11-25,"[['Milevskiy', 'Igor', ''], ['Boykov', 'Yuri', '']]","['Multi-model fitting', 'Multilingual text detection', 'Energy minimization', 'Minimum description length', 'Graph cuts', 'Fusion moves']"
14435,1301.5375,Nur Jannatul Adnin  Ms.,"A. N. Zainab, K. W. U. Anyi, N. B. Anuar",A Single Journal Study : Malaysian Journal of Computer Science,,,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Single journal studies are reviewed and measures used in the studies are
highlighted. The following quantitative measures are used to study 272 articles
published in Malaysian Journal of Computer Science, (1) the article
productivity of the journal from 1985 to 2007, (2) the observed and expected
authorship productivity tested using Lotka's Law of author productivity,
identification and listing of core authors; (3) the authorship, co-authorship
pattern by authors' country of origin and institutional affiliations; (4) the
subject areas of research; (5) the citation analysis of resources referenced as
well as the age and half-life of citations; the journals referenced and tested
for zonal distribution using Bradford's law of journal scattering; the extent
of web citations; and (6) the citations received by articles published in MJCS
and impact factor of the journal based on information obtained from Google
Scholar, the level of author and journal self-citation.
","[{'version': 'v1', 'created': 'Wed, 23 Jan 2013 01:40:30 GMT'}]",2013-01-24,"[['Zainab', 'A. N.', ''], ['Anyi', 'K. W. U.', ''], ['Anuar', 'N. B.', '']]","['Single journal study; journal productivity', 'authorship pattern', 'citation analysis', 'Bibliometrics']"
14436,1701.02374,Guangmo Tong,"Guangmo Tong, Weili Wu and Ding-Zhu Du",On Rivest-Vuillemin Conjecture for Fourteen Variables,A technique report,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A boolean function $f(x_1,...,x_n)$ is \textit{weakly symmetric} if it is
invariant under a transitive permutation group on its variables. A boolean
function $f(x_1,...,x_n)$ is \textit{elusive} if we have to check all
$x_1$,..., $x_n$ to determine the output of $f(x_1,...,x_n)$ in the worst-case.
It is conjectured that every nontrivial monotone weakly symmetric boolean
function is elusive, which has been open for a long time. In this paper, we
report that this conjecture is true for $n=14$.
","[{'version': 'v1', 'created': 'Mon, 9 Jan 2017 22:08:15 GMT'}]",2017-01-11,"[['Tong', 'Guangmo', ''], ['Wu', 'Weili', ''], ['Du', 'Ding-Zhu', '']]","['Boolean function', 'Decision tree complexity', 'Elusiveness']"
14437,0803.2675,Gerard Briscoe Mr,Gerard Briscoe and Philippe De Wilde,Digital Ecosystems: Self-Organisation of Evolving Agent Populations,"5 pages, 5 figures, ACM Management of Emergent Digital EcoSystems
  (MEDES) 2009",,,,cs.NE cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A primary motivation for our research in Digital Ecosystems is the desire to
exploit the self-organising properties of biological ecosystems. Ecosystems are
thought to be robust, scalable architectures that can automatically solve
complex, dynamic problems. Self-organisation is perhaps one of the most
desirable features in the systems that we engineer, and it is important for us
to be able to measure self-organising behaviour. We investigate the
self-organising aspects of Digital Ecosystems, created through the application
of evolutionary computing to Multi-Agent Systems (MASs), aiming to determine a
macroscopic variable to characterise the self-organisation of the evolving
agent populations within. We study a measure for the self-organisation called
Physical Complexity; based on statistical physics, automata theory, and
information theory, providing a measure of information relative to the
randomness in an organism's genome, by calculating the entropy in a population.
We investigate an extension to include populations of variable length, and then
built upon this to construct an efficiency measure to investigate clustering
within evolving agent populations. Overall an insight has been achieved into
where and how self-organisation occurs in our Digital Ecosystem, and how it can
be quantified.
","[{'version': 'v1', 'created': 'Tue, 18 Mar 2008 16:59:12 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Oct 2008 09:53:30 GMT'}, {'version': 'v3', 'created': 'Fri, 20 Feb 2009 04:14:47 GMT'}, {'version': 'v4', 'created': 'Mon, 5 Oct 2009 00:32:17 GMT'}]",2009-10-05,"[['Briscoe', 'Gerard', ''], ['De Wilde', 'Philippe', '']]","['Complexity', 'entropy', 'clustering', 'evolution', 'population']"
14438,1110.3379,Rahul Saha,Rahul Saha and Dr. G. Geetha,"Identifying Reference Objects by Hierarchical Clustering in Java
  Environment","8 pages,13 tables,2 figures","IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 5, No 3, September 2011 ISSN (Online): 1694-0814",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently Java programming environment has become so popular. Java programming
language is a language that is designed to be portable enough to be executed in
wide range of computers ranging from cell phones to supercomputers. Computer
programs written in Java are compiled into Java Byte code instructions that are
suitable for execution by a Java Virtual Machine implementation. Java virtual
Machine is commonly implemented in software by means of an interpreter for the
Java Virtual Machine instruction set. As an object oriented language, Java
utilizes the concept of objects. Our idea is to identify the candidate objects'
references in a Java environment through hierarchical cluster analysis using
reference stack and execution stack.
","[{'version': 'v1', 'created': 'Sat, 15 Oct 2011 04:25:47 GMT'}]",2011-10-18,"[['Saha', 'Rahul', ''], ['Geetha', 'Dr. G.', '']]","['Proximity Matrix', 'Reference Stack', 'Execution Stack', 'Euclidean Distance', 'Object Reference', 'Dendogram']"
14439,1708.01368,Vin\'icius Veloso de Melo,Vin\'icius Veloso de Melo,"A novel metaheuristic method for solving constrained engineering
  optimization problems: Drone Squadron Optimization",3 pages,,,,cs.NE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several constrained optimization problems have been adequately solved over
the years thanks to advances in the metaheuristics area. In this paper, we
evaluate a novel self-adaptive and auto-constructive metaheuristic called Drone
Squadron Optimization (DSO) in solving constrained engineering design problems.
This paper evaluates DSO with death penalty on three widely tested engineering
design problems. Results show that the proposed approach is competitive with
some very popular metaheuristics.
","[{'version': 'v1', 'created': 'Fri, 4 Aug 2017 03:21:23 GMT'}]",2017-08-07,"[['de Melo', 'Vinícius Veloso', '']]","['Optimization', 'Engineering Design', 'Metaheuristics', 'Self-adaptive']"
14440,1610.03708,Hendrik Heuer,"Hendrik Heuer, Christof Monz, Arnold W.M. Smeulders",Generating captions without looking beyond objects,"This paper was presented at the ECCV2016 2nd Workshop on Storytelling
  with Images and Videos (VisStory)",,,,cs.CV cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper explores new evaluation perspectives for image captioning and
introduces a noun translation task that achieves comparative image caption
generation performance by translating from a set of nouns to captions. This
implies that in image captioning, all word categories other than nouns can be
evoked by a powerful language model without sacrificing performance on n-gram
precision. The paper also investigates lower and upper bounds of how much
individual word categories in the captions contribute to the final BLEU score.
A large possible improvement exists for nouns, verbs, and prepositions.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2016 13:42:03 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Oct 2016 09:35:03 GMT'}]",2016-10-19,"[['Heuer', 'Hendrik', ''], ['Monz', 'Christof', ''], ['Smeulders', 'Arnold W. M.', '']]","['Image captioning', 'evaluation', 'machine translation']"
14441,1607.00242,Mikhail Raskin,M. Raskin,"A linear lower bound for incrementing a space-optimal integer
  representation in the bit-probe model","12 pages, 4 figures",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the first linear lower bound for the number of bits required to be
accessed in the worst case to increment an integer in an arbitrary space-
optimal binary representation. The best previously known lower bound was
logarithmic. It is known that a logarithmic number of read bits in the worst
case is enough to increment some of the integer representations that use one
bit of redundancy, therefore we show an exponential gap between space-optimal
and redundant counters.
  Our proof is based on considering the increment procedure for a space optimal
counter as a permutation and calculating its parity. For every space optimal
counter, the permutation must be odd, and implementing an odd permutation
requires reading at least half the bits in the worst case. The combination of
these two observations explains why the worst-case space-optimal problem is
substantially different from both average-case approach with constant expected
number of reads and almost space optimal representations with logarithmic
number of reads in the worst case.
","[{'version': 'v1', 'created': 'Fri, 1 Jul 2016 13:39:44 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Nov 2016 08:05:27 GMT'}, {'version': 'v3', 'created': 'Wed, 15 Feb 2017 16:51:20 GMT'}]",2017-02-16,"[['Raskin', 'M.', '']]","['binary counter', 'data structure', 'integer representation', 'bit-probe model', 'lower bound']"
14442,1409.6597,Bernhard Rumpe,Bernhard Rumpe,Executable Modeling with UML. A Vision or a Nightmare?,"12 pages, 0 figures","Issues & Trends of Information Technology Management in
  Contemporary Associations, Seattle. Idea Group Publishing, Hershey, London,
  pp. 697-701. 2002",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Extreme Programming is the most prominent new, light-weight (or agile)
methods, defined to contrast the current heavy-weight and partially overloaded
object-oriented methods. It focuses on the core issues of software technology.
One of its principles is not to rely on diagrams to document a system. In this
paper, we examine what properties a modeling language like UML must have in
order to support the Extreme Programming approach effectively. In particular,
we discuss how such a diagrammatic programming language must look like to
replace a textual programming language and what benefits and problems such an
approach may bring.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 17:57:57 GMT'}]",2014-09-24,"[['Rumpe', 'Bernhard', '']]","['UML', 'extreme modeling', 'visual programming language', 'executability']"
14443,1510.03013,Kaushik Mahata,Kaushik Mahata and Johan Schoukens,Gaussian information matrix for Wiener model identification,16 pages,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a closed form expression for the information matrix associated
with the Wiener model identification problem under the assumption that the
input signal is a stationary Gaussian process. This expression holds under
quite generic assumptions. We allow the linear sub-system to have a rational
transfer function of arbitrary order, and the static nonlinearity to be a
polynomial of arbitrary degree. We also present a simple expression for the
determinant of the information matrix. The expressions presented herein has
been used for optimal experiment design for Wiener model identification.
","[{'version': 'v1', 'created': 'Sun, 11 Oct 2015 05:49:03 GMT'}]",2015-10-13,"[['Mahata', 'Kaushik', ''], ['Schoukens', 'Johan', '']]","['Wiener model identification', 'Information matrix', 'Gaussian input', 'Determinant']"
14444,1510.03042,Thuc Le Ph.D,"Thuc Duy Le, Tao Hoang, Jiuyong Li, Lin Liu, Shu Hu","ParallelPC: an R package for efficient constraint based causal
  exploration",,,,,cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Discovering causal relationships from data is the ultimate goal of many
research areas. Constraint based causal exploration algorithms, such as PC,
FCI, RFCI, PC-simple, IDA and Joint-IDA have achieved significant progress and
have many applications. A common problem with these methods is the high
computational complexity, which hinders their applications in real world high
dimensional datasets, e.g gene expression datasets. In this paper, we present
an R package, ParallelPC, that includes the parallelised versions of these
causal exploration algorithms. The parallelised algorithms help speed up the
procedure of experimenting big datasets and reduce the memory used when running
the algorithms. The package is not only suitable for super-computers or
clusters, but also convenient for researchers using personal computers with
multi core CPUs. Our experiment results on real world datasets show that using
the parallelised algorithms it is now practical to explore causal relationships
in high dimensional datasets with thousands of variables in a single multicore
computer. ParallelPC is available in CRAN repository at
https://cran.rproject.org/web/packages/ParallelPC/index.html.
","[{'version': 'v1', 'created': 'Sun, 11 Oct 2015 11:55:39 GMT'}]",2015-10-13,"[['Le', 'Thuc Duy', ''], ['Hoang', 'Tao', ''], ['Li', 'Jiuyong', ''], ['Liu', 'Lin', ''], ['Hu', 'Shu', '']]","['Causality discovery', 'Bayesian networks', 'Parallel computing', 'Constraintbased methods']"
14445,1712.03443,Zicong Zhou,"Zicong Zhou, Xi Chen, Xian Xin Cai and Guojun Liao","Uniqueness of Transformation based on Jacobian Determinant and
  curl-Vector","11 pages, 8 figures",,,,cs.CG,http://creativecommons.org/licenses/by/4.0/,"  Numerical examples demonstrated that a prescribed positive Jacobian
determinant alone can not uniquely determine a diffeomorphism. It is
conjectured that the uniqueness of a transformation can be assured by its
Jacobian determinant and the curl-vector. In this work, we study the uniqueness
problem analytically and propose an approach to the proof of the uniqueness of
a transformation with prescribed Jacobian determinant and curl-vector.
","[{'version': 'v1', 'created': 'Sat, 9 Dec 2017 21:58:20 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Oct 2018 20:18:09 GMT'}]",2018-10-31,"[['Zhou', 'Zicong', ''], ['Chen', 'Xi', ''], ['Cai', 'Xian Xin', ''], ['Liao', 'Guojun', '']]","['diffeomorphism', 'mesh generation', 'Jacobian determinant', 'curlvector', 'Green′s formula', 'Poincare′s inequality']"
14446,1401.5175,Tanmay Sinha,Tanmay Sinha,Supporting MOOC Instruction with Social Network Analysis,"10 pages, 4 figures, 3 tables",,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With an expansive and ubiquitously available gold mine of educational data,
Massive Open Online courses (MOOCs) have become the an important foci of
learning analytics research. In this paper, we investigate potential reasons as
to why are these digitalized learning repositories being plagued with huge
attrition rates. We analyze an ongoing online course offered in Coursera using
a social network perspective, with an objective to identify students who are
actively participating in course discussions and those who are potentially at a
risk of dropping off. We additionally perform extensive forum analysis to
visualize student's posting patterns longitudinally. Our results provide
insights that can assist educational designers in establishing a pedagogical
basis for decision-making while designing MOOCs. We infer prominent
characteristics about the participation patterns of distinct groups of students
in the networked learning community, and effectively discover important
discussion threads. These methods can, despite the otherwise prohibitive number
of students involved, allow an instructor to leverage forum behavior to
identify opportunities for support.
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2014 04:53:41 GMT'}]",2014-01-22,"[['Sinha', 'Tanmay', '']]","['Coursera', 'MOOC', 'Social network analysis']"
14447,1301.4781,Christophe Cruz,"David Werner (Le2i), Christophe Cruz (Le2i), Christophe Nicolle (Le2i)",Ontology-based Recommender System of Economic Articles,,"8th International Conference on Web Information Systems and
  Technologies, Porto : Portugal (2013)",,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Decision makers need economical information to drive their decisions. The
Company Actualis SARL is specialized in the production and distribution of a
press review about French regional economic actors. This economic review
represents for a client a prospecting tool on partners and competitors. To
reduce the overload of useless information, the company is moving towards a
customized review for each customer. Three issues appear to achieve this goal.
First, how to identify the elements in the text in order to extract objects
that match with the recommendation's criteria presented? Second, How to define
the structure of these objects, relationships and articles in order to provide
a source of knowledge usable by the extraction process to produce new knowledge
from articles? The latter issue is the feedback on customer experience to
identify the quality of distributed information in real-time and to improve the
relevance of the recommendations. This paper presents a new type of
recommendation based on the semantic description of both articles and user
profile.
","[{'version': 'v1', 'created': 'Mon, 21 Jan 2013 08:15:16 GMT'}]",2013-01-22,"[['Werner', 'David', '', 'Le2i'], ['Cruz', 'Christophe', '', 'Le2i'], ['Nicolle', 'Christophe', '', 'Le2i']]","['Recommender Systems', 'multi-ontologies', 'Information Extraction', 'OBIE', 'ontology-based', 'knowledge-based']"
14448,1402.7136,Peter Benes Ing.,"Peter Mark Benes, Ivo Bukovsky, Matous Cejnek and Jan Kalivoda",Neural Network Approach to Railway Stand Lateral Skew Control,"P. M. Benes et al., ""Neural Network Approach to Railway Stand Lateral
  Skew Control"" in Computer Science & Information Technology (CS& IT), Sydney,
  NSW, Australia, AIRCC, 2014, pp. 327-339",,,,cs.SY cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents a study of an adaptive approach to lateral skew control
for an experimental railway stand. The preliminary experiments with the real
experimental railway stand and simulations with its 3-D mechanical model,
indicates difficulties of model-based control of the device. Thus, use of
neural networks for identification and control of lateral skew shall be
investigated. This paper focuses on real-data based modeling of the railway
stand by various neural network models, i.e; linear neural unit and quadratic
neural unit architectures. Furthermore, training methods of these neural
architectures as such, real-time-recurrent-learning and a variation of
back-propagation-through-time are examined, accompanied by a discussion of the
produced experimental results.
","[{'version': 'v1', 'created': 'Fri, 28 Feb 2014 05:34:36 GMT'}]",2014-03-03,"[['Benes', 'Peter Mark', ''], ['Bukovsky', 'Ivo', ''], ['Cejnek', 'Matous', ''], ['Kalivoda', 'Jan', '']]","['Roller Rig', 'Linear Neural Unit', 'Quadratic Neural Unit', 'Real-Time-Recurrent-Learning (RTRL)', 'Back-Propagation-Through-Time (BPTT)']"
14449,0802.3106,EDA Publishing Association,"X. C. Shan, Y. C. Liu, H. J. Lu, Z. F. Wang, Y. C. Lam",Studies of Polymer Deformation and Recovery in Hot Embossing,"Submitted on behalf of EDA Publishing Association
  (http://irevues.inist.fr/EDA-Publishing)","Dans Symposium on Design, Test, Integration and Packaging of
  MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)",,,cs.OH,,"  In large area micro hot embossing, the process temperature plays a critical
role to both the local fidelity of microstructure formation and global
uniformity. The significance of low temperature hot embossing is to improve
global flatness of embossed devices. This paper reports on experimental studies
of polymer deformation and relaxation in micro embossing when the process
temperatures are below or near its glass transition temperature (Tg). In this
investigation, an indentation system and a micro embosser were used to
investigate the relationship of microstructure formation versus process
temperature and load pressure. The depth of indentation was controlled and the
load force at a certain indentation depth was measured. Experiments were
carried out using 1 mm thick PMMA films with the process temperature ranging
from Tg-55 degrees C to Tg +20 degrees C. The embossed structures included a
single micro cavity and groups of micro cavity arrays. It was found that at
temperature of Tg-55 degrees C, elastic deformation dominated the formation of
microstructures and significant relaxation happened after embossing. From Tg-20
degrees C to Tg, plastic deformation dominated polymer deformation, and
permanent cavities could be formed on PMMA substrates without obvious
relaxation. However, the formation of protrusive structures as micro pillars
was not complete since there was little polymer flow. With an increase in
process temperature, microstructure could be formed under lower loading
pressure. Considering the fidelity of a single microstructure and global
flatness of embossed substrates, micro hot embossing at a low process
temperature, but with good fidelity, should be preferred.
","[{'version': 'v1', 'created': 'Thu, 21 Feb 2008 13:46:30 GMT'}]",2008-02-22,"[['Shan', 'X. C.', ''], ['Liu', 'Y. C.', ''], ['Lu', 'H. J.', ''], ['Wang', 'Z. F.', ''], ['Lam', 'Y. C.', '']]","['viscoelastic', 'recovery', 'indentation', 'embossing']"
14450,0711.2112,Michel Grabisch,"Michel Grabisch (CES), Christophe Labreuche (TRT)",Bi-capacities -- Part II: the Choquet integral,,Fuzzy Sets and Systems (2005) 237-259,,,cs.DM cs.GT,,"  Bi-capacities arise as a natural generalization of capacities (or fuzzy
measures) in a context of decision making where underlying scales are bipolar.
They are able to capture a wide variety of decision behaviours, encompassing
models such as Cumulative Prospect Theory (CPT). The aim of this paper in two
parts is to present the machinery behind bi-capacities, and thus remains on a
rather theoretical level, although some parts are firmly rooted in decision
theory, notably cooperative game theory. The present second part focuses on the
definition of Choquet integral. We give several expressions of it, including an
expression w.r.t. the M\""obius transform. This permits to express the Choquet
integral for 2-additive bi-capacities w.r.t. the interaction index.
","[{'version': 'v1', 'created': 'Wed, 14 Nov 2007 06:11:57 GMT'}]",2007-11-15,"[['Grabisch', 'Michel', '', 'CES'], ['Labreuche', 'Christophe', '', 'TRT']]","['fuzzy measure', 'capacity', 'bi-capacity', 'Choquet integral']"
14451,1109.3827,Jun He,"Jun He, Laura Balzano, John C.S. Lui",Online Robust Subspace Tracking from Partial Information,"28 pages, 12 figures",,,,cs.IT cs.CV cs.SY math.IT math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents GRASTA (Grassmannian Robust Adaptive Subspace Tracking
Algorithm), an efficient and robust online algorithm for tracking subspaces
from highly incomplete information. The algorithm uses a robust $l^1$-norm cost
function in order to estimate and track non-stationary subspaces when the
streaming data vectors are corrupted with outliers. We apply GRASTA to the
problems of robust matrix completion and real-time separation of background
from foreground in video. In this second application, we show that GRASTA
performs high-quality separation of moving objects from background at
exceptional speeds: In one popular benchmark video example, GRASTA achieves a
rate of 57 frames per second, even when run in MATLAB on a personal laptop.
","[{'version': 'v1', 'created': 'Sun, 18 Sep 2011 00:53:53 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Sep 2011 13:02:04 GMT'}]",2011-09-21,"[['He', 'Jun', ''], ['Balzano', 'Laura', ''], ['Lui', 'John C. S.', '']]","['Grassman manifold', 'Lagrangian alternating direction', 'subspace tracking', 'matrixseparation', 'robust PCA', 'video surveillance']"
14452,1609.05337,Matthew Hammer,"Dakota Fisher, Matthew A. Hammer, William Byrd, Matthew Might","miniAdapton: A Minimal Implementation of Incremental Computation in
  Scheme",,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a complete Scheme implementation of miniAdapton, which implements
the core functionality of the Adapton system for incremental computation (also
known as self-adjusting computation). Like Adapton, miniAdapton allows
programmers to safely combine mutation and memoization. miniAdapton is built on
top of an even simpler system, microAdapton. Both miniAdapton and microAdapton
are designed to be easy to understand, extend, and port to host languages other
than Scheme. We also present adapton variables, a new interface in Adapton for
variables intended to represent expressions.
","[{'version': 'v1', 'created': 'Sat, 17 Sep 2016 13:53:10 GMT'}]",2016-09-20,"[['Fisher', 'Dakota', ''], ['Hammer', 'Matthew A.', ''], ['Byrd', 'William', ''], ['Might', 'Matthew', '']]","['incremental computation', 'self-adjusting computation', 'Adapton', 'memoization', 'Scheme']"
14453,1306.3542,Saadat Anwar,"Saadat Anwar, Chitta Baral, Katsumi Inoue","Encoding Petri Nets in Answer Set Programming for Simulation Based
  Reasoning",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of our long term research goals is to develop systems to answer realistic
questions (e.g., some mentioned in textbooks) about biological pathways that a
biologist may ask. To answer such questions we need formalisms that can model
pathways, simulate their execution, model intervention to those pathways, and
compare simulations under different circumstances. We found Petri Nets to be
the starting point of a suitable formalism for the modeling and simulation
needs. However, we need to make extensions to the Petri Net model and also
reason with multiple simulation runs and parallel state evolutions. Towards
that end Answer Set Programming (ASP) implementation of Petri Nets would allow
us to do both. In this paper we show how ASP can be used to encode basic Petri
Nets in an intuitive manner. We then show how we can modify this encoding to
model several Petri Net extensions by making small changes. We then highlight
some of the reasoning capabilities that we will use to accomplish our ultimate
research goal.
","[{'version': 'v1', 'created': 'Sat, 15 Jun 2013 03:10:56 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Jun 2013 18:27:12 GMT'}]",2013-06-25,"[['Anwar', 'Saadat', ''], ['Baral', 'Chitta', ''], ['Inoue', 'Katsumi', '']]","['Petri Nets', 'ASP', 'Knowledge Representation and Reasoning', 'Modeling and Simulation']"
14454,1010.2881,Rajkumar Buyya,Linlin Wu and Rajkumar Buyya,Service Level Agreement (SLA) in Utility Computing Systems,"27 pages, 4 tables, 6 figures",,,"Technical Report CLOUDS-TR-2010-5, Cloud Computing and Distributed
  Systems Laboratory, The University of Melbourne, Australia, September 3, 2010",cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, extensive research has been conducted in the area of Service
Level Agreement (SLA) for utility computing systems. An SLA is a formal
contract used to guarantee that consumers' service quality expectation can be
achieved. In utility computing systems, the level of customer satisfaction is
crucial, making SLAs significantly important in these environments. Fundamental
issue is the management of SLAs, including SLA autonomy management or trade off
among multiple Quality of Service (QoS) parameters. Many SLA languages and
frameworks have been developed as solutions; however, there is no overall
classification for these extensive works. Therefore, the aim of this chapter is
to present a comprehensive survey of how SLAs are created, managed and used in
utility computing environment. We discuss existing use cases from Grid and
Cloud computing systems to identify the level of SLA realization in
state-of-art systems and emerging challenges for future research.
","[{'version': 'v1', 'created': 'Thu, 14 Oct 2010 11:33:28 GMT'}]",2010-10-15,"[['Wu', 'Linlin', ''], ['Buyya', 'Rajkumar', '']]","['Service Level Agreement', 'Cloud computing', 'Grid computing', 'utility computing', 'SLA lifecycle', 'SLA Negotiation', 'SLA Management', 'SLA Languages and Frameworks']"
14455,1505.06425,Aleksandr Cariow,"Aleksandr Cariow, Galina Cariowa and Rafa{\l} {\L}entek",An algorithm for multipication of Kaluza numbers,"22 pages,3 figures",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the derivation of a new algorithm for multiplying of two
Kaluza numbers. Performing this operation directly requires 1024 real
multiplications and 992 real additions. The proposed algorithm can compute the
same result with only 512 real multiplications and 576 real additions. The
derivation of our algorithm is based on utilizing the fact that multiplication
of two Kaluza numbers can be expressed as a matrixvector product. The matrix
multiplicand that participates in the product calculating has unique structural
properties. Namely exploitation of these specific properties leads to
significant reducing of the complexity of Kaluza numbers multiplication.
","[{'version': 'v1', 'created': 'Sun, 24 May 2015 11:01:54 GMT'}]",2015-05-26,"[['Cariow', 'Aleksandr', ''], ['Cariowa', 'Galina', ''], ['Łentek', 'Rafał', '']]","['Kaluza numbers', 'multiplication of hypercomplex numbers', 'fast algorithms']"
14456,1401.0245,Sujit Gath,S.J Gath and R.V Kulkarni,A Review: Expert System for Diagnosis of Myocardial Infarction,"7 pages. arXiv admin note: text overlap with arXiv:1006.4544 by other
  authors",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A computer Program Capable of performing at a human-expert level in a narrow
problem domain area is called an expert system. Management of uncertainty is an
intrinsically important issue in the design of expert systems because much of
the information in the knowledge base of a typical expert system is imprecise,
incomplete or not totally reliable. In this paper, the author present s the
review of past work that has been carried out by various researchers based on
development of expert systems for the diagnosis of cardiac disease
","[{'version': 'v1', 'created': 'Wed, 1 Jan 2014 03:59:22 GMT'}]",2014-01-03,"[['Gath', 'S. J', ''], ['Kulkarni', 'R. V', '']]","['Expert System', 'Myocardial Infarction', 'coronary artery']"
14457,1607.03434,Manish Gupta,Dixita Limbachiya and Dhaval Trivedi and Manish K Gupta,"DNA Image Pro -- A Tool for Generating Pixel Patterns using DNA Tile
  Assembly","14 pages, draft",,,,cs.ET cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-assembly is a process found everywhere in the Nature. In particular, it
is known that DNA self-assembly is Turing universal. Thus one can do arbitrary
computations or build nano-structures using DNA self-assembly. In order to
understand the DNA self-assembly process, many mathematical models have been
proposed in the literature. In particular, abstract Tile Assembly Model (aTAM)
received much attention. In this work, we investigate pixel pattern generation
using aTAM. For a given image, a tile assembly system is given which can
generate the image by self-assembly process. We also consider image blocks with
specific cyclic pixel patterns (uniform shift and non uniform shift) self
assembly. A software, DNA Image Pro, for generating pixel patterns using DNA
tile assembly is also given.
","[{'version': 'v1', 'created': 'Tue, 12 Jul 2016 16:46:25 GMT'}]",2016-07-14,"[['Limbachiya', 'Dixita', ''], ['Trivedi', 'Dhaval', ''], ['Gupta', 'Manish K', '']]","['DNA self-assembly', 'Algorithmic self-assembly', 'DNA computing', 'DNA Image Pro', 'Xgrow', 'Pixel patterns']"
14458,1603.02767,Abedelaziz  Mohaisen,Jeffrey Spaulding and Shambhu Upadhyaya and Aziz Mohaisen,"The Landscape of Domain Name Typosquatting: Techniques and
  Countermeasures","6 pages, 1 table, 0 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With more than 294 million registered domain names as of late 2015, the
domain name ecosystem has evolved to become a cornerstone for the operation of
the Internet. Domain names today serve everyone, from individuals for their
online presence to big brands for their business operations. Such ecosystem
that facilitated legitimate business and personal uses has also fostered
""creative"" cases of misuse, including phishing, spam, hit and traffic stealing,
online scams, among others. As a first step towards this misuse, the
registration of a legitimately-looking domain is often required. For that,
domain typosquatting provides a great avenue to cybercriminals to conduct their
crimes.
  In this paper, we review the landscape of domain name typosquatting,
highlighting models and advanced techniques for typosquatted domain names
generation, models for their monetization, and the existing literature on
countermeasures. We further highlight potential fruitful directions on
technical countermeasures that are lacking in the literature.
","[{'version': 'v1', 'created': 'Wed, 9 Mar 2016 02:43:54 GMT'}]",2016-03-10,"[['Spaulding', 'Jeffrey', ''], ['Upadhyaya', 'Shambhu', ''], ['Mohaisen', 'Aziz', '']]","['Domain Names', 'Typosquatting', 'Defenses']"
14459,1305.0001,Gobithaasan Rudrusamy,"Rozaimi Zakaria, Abd. Fatah Wahab and R.U. Gobithaasan",Perfectly normal type-2 fuzzy interpolation B-spline curve,arXiv admin note: substantial text overlap with arXiv:1304.7868,"2013 Applied Mathematical Sciences 7 (21-24), Pg.1043-1055",,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we proposed another new form of type-2 fuzzy data
points(T2FDPs) that is perfectly normal type-2 data points(PNT2FDPs). These
kinds of brand-new data were defined by using the existing type-2 fuzzy set
theory(T2FST) and type-2 fuzzy number(T2FN) concept since we dealt with the
problem of defining complex uncertainty data. Along with this restructuring, we
included the fuzzification(alpha-cut operation), type-reduction and
defuzzification processes against PNT2FDPs. In addition, we used interpolation
B-soline curve function to demonstrate the PNT2FDPs.
","[{'version': 'v1', 'created': 'Tue, 30 Apr 2013 05:12:05 GMT'}]",2013-05-02,"[['Zakaria', 'Rozaimi', ''], ['Wahab', 'Abd. Fatah', ''], ['Gobithaasan', 'R. U.', '']]","['Type-2 fuzzy set', 'type-2 fuzzy data points', 'alpha-cut', 'type-reduction', 'defuzzification']"
14460,1606.03539,Srujana Pinjala,"Srujana Pinjala, Rahul Roy and Priya Seetharaman","Firm Growth and Innovation in the ERP Industry: A Systems Thinking
  Approach","Research-in-progress ISBN# 978-0-646-95337-3 Presented at the
  Australasian Conference on Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/219,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Achievement and sustenance of growth are essential themes in organizational
literature. In our paper, we develop models using systems thinking approach to
understand how firms achieve and sustain growth in a technology-intensive
product domain. We augment these to explain the possible impact of a disruptive
technological innovation. We use enterprise software industry as the context
where SAP has been acknowledged as the market leader. We find that product
differentiation and learning effects helped SAP establish itself, and this
growth was further sustained through networks and complementors. Introducing
cloud computing as the disruptive innovation, we explain its impact on a firm.
Analysis reveals that for the next wave of growth to occur, and to tap into
newer markets, it would be imperative for SAP to create attractive cloud based
offerings. We also discuss how the model can be enhanced by considering
competitor dynamics.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 03:22:37 GMT'}]",2016-06-14,"[['Pinjala', 'Srujana', ''], ['Roy', 'Rahul', ''], ['Seetharaman', 'Priya', '']]","['Enterprise Resource Planning', 'cloud computing', 'SAP', 'systems dynamics', 'disruptive innovation']"
14461,1707.09747,Lei Bi,"Lei Bi, Jinman Kim, Ashnil Kumar, Dagan Feng, Michael Fulham","Synthesis of Positron Emission Tomography (PET) Images via Multi-channel
  Generative Adversarial Networks (GANs)","9 pages, 2 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Positron emission tomography (PET) image synthesis plays an important role,
which can be used to boost the training data for computer aided diagnosis
systems. However, existing image synthesis methods have problems in
synthesizing the low resolution PET images. To address these limitations, we
propose multi-channel generative adversarial networks (M-GAN) based PET image
synthesis method. Different to the existing methods which rely on using
low-level features, the proposed M-GAN is capable to represent the features in
a high-level of semantic based on the adversarial learning concept. In
addition, M-GAN enables to take the input from the annotation (label) to
synthesize the high uptake regions e.g., tumors and from the computed
tomography (CT) images to constrain the appearance consistency and output the
synthetic PET images directly. Our results on 50 lung cancer PET-CT studies
indicate that our method was much closer to the real PET images when compared
with the existing methods.
","[{'version': 'v1', 'created': 'Mon, 31 Jul 2017 07:56:34 GMT'}]",2017-08-01,"[['Bi', 'Lei', ''], ['Kim', 'Jinman', ''], ['Kumar', 'Ashnil', ''], ['Feng', 'Dagan', ''], ['Fulham', 'Michael', '']]","['Positron Emission Tomography (PET)', 'Generative Adversarial Networks (GANs)', 'Image Synthesis']"
14462,1301.0278,Wajdi Ghezaiel,"Wajdi Ghezaiel, Amel Ben Slimane Rahmouni, and Ezzedine Ben Braiek","Evaluation of a Multi-Resolution Dyadic Wavelet Transform Method for
  usable Speech Detection",,"WASET Journal, 2011 Vol.79 P. 829-833",,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many applications of speech communication and speaker identification suffer
from the problem of co-channel speech. This paper deals with a multi-resolution
dyadic wavelet transform method for usable segments of co-channel speech
detection that could be processed by a speaker identification system.
Evaluation of this method is performed on TIMIT database referring to the
Target to Interferer Ratio measure. Co-channel speech is constructed by mixing
all possible gender speakers. Results do not show much difference for different
mixtures. For the overall mixtures 95.76% of usable speech is correctly
detected with false alarms of 29.65%.
","[{'version': 'v1', 'created': 'Wed, 2 Jan 2013 17:50:00 GMT'}]",2013-01-03,"[['Ghezaiel', 'Wajdi', ''], ['Rahmouni', 'Amel Ben Slimane', ''], ['Braiek', 'Ezzedine Ben', '']]","['Co-channel speech', 'usable speech', 'multi-resolution analysis', 'speaker identification']"
14463,1701.04143,Vahid Behzadan,Vahid Behzadan and Arslan Munir,Vulnerability of Deep Reinforcement Learning to Policy Induction Attacks,"14 pages, 5 figures, pre-print of submission to MLDM '17",,,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning classifiers are known to be inherently vulnerable to
manipulation by intentionally perturbed inputs, named adversarial examples. In
this work, we establish that reinforcement learning techniques based on Deep
Q-Networks (DQNs) are also vulnerable to adversarial input perturbations, and
verify the transferability of adversarial examples across different DQN models.
Furthermore, we present a novel class of attacks based on this vulnerability
that enable policy manipulation and induction in the learning process of DQNs.
We propose an attack mechanism that exploits the transferability of adversarial
examples to implement policy induction attacks on DQNs, and demonstrate its
efficacy and impact through experimental study of a game-learning scenario.
","[{'version': 'v1', 'created': 'Mon, 16 Jan 2017 02:39:01 GMT'}]",2017-01-17,"[['Behzadan', 'Vahid', ''], ['Munir', 'Arslan', '']]","['Reinforcement Learning', 'Deep Q-Learning', 'Adversarial Examples', 'Policy Induction', 'Manipulation', 'Vulnerability']"
14464,1702.04869,Sergi Valverde,"Sergi Valverde, Mariano Cabezas, Eloy Roura, Sandra
  Gonz\'alez-Vill\`a, Deborah Pareto, Joan-Carles Vilanova, LLu\'is
  Rami\'o-Torrent\`a, \`Alex Rovira, Arnau Oliver and Xavier Llad\'o","Improving automated multiple sclerosis lesion segmentation with a
  cascaded 3D convolutional neural network approach",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a novel automated method for White Matter (WM)
lesion segmentation of Multiple Sclerosis (MS) patient images. Our approach is
based on a cascade of two 3D patch-wise convolutional neural networks (CNN).
The first network is trained to be more sensitive revealing possible candidate
lesion voxels while the second network is trained to reduce the number of
misclassified voxels coming from the first network. This cascaded CNN
architecture tends to learn well from small sets of training data, which can be
very interesting in practice, given the difficulty to obtain manual label
annotations and the large amount of available unlabeled Magnetic Resonance
Imaging (MRI) data. We evaluate the accuracy of the proposed method on the
public MS lesion segmentation challenge MICCAI2008 dataset, comparing it with
respect to other state-of-the-art MS lesion segmentation tools. Furthermore,
the proposed method is also evaluated on two private MS clinical datasets,
where the performance of our method is also compared with different recent
public available state-of-the-art MS lesion segmentation methods. At the time
of writing this paper, our method is the best ranked approach on the MICCAI2008
challenge, outperforming the rest of 60 participant methods when using all the
available input modalities (T1-w, T2-w and FLAIR), while still in the top-rank
(3rd position) when using only T1-w and FLAIR modalities. On clinical MS data,
our approach exhibits a significant increase in the accuracy segmenting of WM
lesions when compared with the rest of evaluated methods, highly correlating
($r \ge 0.97$) also with the expected lesion volume.
","[{'version': 'v1', 'created': 'Thu, 16 Feb 2017 06:23:14 GMT'}]",2017-02-17,"[['Valverde', 'Sergi', ''], ['Cabezas', 'Mariano', ''], ['Roura', 'Eloy', ''], ['González-Villà', 'Sandra', ''], ['Pareto', 'Deborah', ''], ['Vilanova', 'Joan-Carles', ''], ['Ramió-Torrentà', 'LLuís', ''], ['Rovira', 'Àlex', ''], ['Oliver', 'Arnau', ''], ['Lladó', 'Xavier', '']]","['Brain', 'MRI', 'multiple sclerosis', 'automatic lesion segmentation', 'convolutional neural networks']"
14465,1406.2863,Jose Teixeira,Jose Teixeira and Reima Suomi,"A Literature Review on Information Systems Supporting the Physical
  Wellbeing of Elderly People","As presented in the IADIS ICT2012 conference held in Lisbon,
  Portugal, 21-23 July 2012, Proceedings of the IADIS International Conference
  ICT, Society and Human Beings 2012, IADIS press, 2012",,,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper reviews multi-disciplinary research on information systems
supporting the physical wellbeing of the elderly population. By taking a
systematic approach, it screens journals, conference proceedings and books on
how computer-based systems are used for improving both the health and wellbeing
of the most senior individuals. By using different Internet-databases indexing
academic publications and a set of conceptual keywords the authors searched for
and identified 62 major publications on the topic that were carefully reviewed.
Each publication item was classified according different category sets and the
aggregated data was then analyzed from different socio-technological
perspectives. Our findings suggest that research on the topic is very focused
on diseases over health and wellbeing, since most of the studied information
systems focused much more on the protective and curative medical procedures
over other important dimensions such as prevention, education and health
promotion. An overview on what and where the studied systems are used is
presented and a new information systems research agenda is proposed.
","[{'version': 'v1', 'created': 'Wed, 11 Jun 2014 11:26:04 GMT'}]",2014-06-12,"[['Teixeira', 'Jose', ''], ['Suomi', 'Reima', '']]","['Health Information Systems', 'Medical Information Systems', 'Medical Technology', 'Elderly', 'Wellbeing', 'Salutogenesis']"
14466,1205.4343,Andres Munoz,Mehryar Mohri and Andres Munoz Medina,New Analysis and Algorithm for Learning with Drifting Distributions,"15 pages, 2 figures to be published in volume 7568 of the Lecture
  Notes in Computer Science series",,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new analysis of the problem of learning with drifting
distributions in the batch setting using the notion of discrepancy. We prove
learning bounds based on the Rademacher complexity of the hypothesis set and
the discrepancy of distributions both for a drifting PAC scenario and a
tracking scenario. Our bounds are always tighter and in some cases
substantially improve upon previous ones based on the $L_1$ distance. We also
present a generalization of the standard on-line to batch conversion to the
drifting scenario in terms of the discrepancy and arbitrary convex combinations
of hypotheses. We introduce a new algorithm exploiting these learning
guarantees, which we show can be formulated as a simple QP. Finally, we report
the results of preliminary experiments demonstrating the benefits of this
algorithm.
","[{'version': 'v1', 'created': 'Sat, 19 May 2012 16:09:15 GMT'}, {'version': 'v2', 'created': 'Sun, 26 Aug 2012 00:15:55 GMT'}]",2012-08-28,"[['Mohri', 'Mehryar', ''], ['Medina', 'Andres Munoz', '']]","['Drifting environment', 'generalization bound', 'domain adaptation']"
14467,0711.3500,Shiguo Lian,Shiguo Lian,Secure Fractal Image Coding,"21 pages, 8 figures. To be submitted",,,,cs.MM cs.CR,,"  In recent work, various fractal image coding methods are reported, which
adopt the self-similarity of images to compress the size of images. However,
till now, no solutions for the security of fractal encoded images have been
provided. In this paper, a secure fractal image coding scheme is proposed and
evaluated, which encrypts some of the fractal parameters during fractal
encoding, and thus, produces the encrypted and encoded image. The encrypted
image can only be recovered by the correct key. To keep secure and efficient,
only the suitable parameters are selected and encrypted through in-vestigating
the properties of various fractal parameters, including parameter space,
parameter distribu-tion and parameter sensitivity. The encryption process does
not change the file format, keeps secure in perception, and costs little time
or computational resources. These properties make it suitable for secure image
encoding or transmission.
","[{'version': 'v1', 'created': 'Thu, 22 Nov 2007 03:53:29 GMT'}]",2007-11-26,"[['Lian', 'Shiguo', '']]","['fractal image coding', 'image encryption', 'partial encryption', 'fractal parameter']"
14468,1705.08161,Fabian Mies,"Fabian Mies, Britta Peis, Andreas Wierz",Computational Methods for Path-based Robust Flows,,,,,cs.DM math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real world networks are often subject to severe uncertainties which need to
be addressed by any reliable prescriptive model. In the context of the maximum
flow problem subject to arc failure, robust models have gained particular
attention. For a path-based model, the resulting optimization problem is
assumed to be difficult in the literature, yet the complexity status is widely
unknown. We present a computational approach to solve the robust flow problem
to optimality by simultaneous primal and dual separation, the practical
efficacy of which is shown by a computational study.
  Furthermore, we introduce a novel model of robust flows which provides a
compromise between stochastic and robust optimization by assigning
probabilities to groups of scenarios. The new model can be solved by the same
computational techniques as the robust model. A bound on the generalization
error is proven for the case that the probabilities are determined empirically.
The suggested model as well as the computational approach extend to linear
optimization problems more general than robust flows.
","[{'version': 'v1', 'created': 'Tue, 23 May 2017 10:12:48 GMT'}]",2017-05-24,"[['Mies', 'Fabian', ''], ['Peis', 'Britta', ''], ['Wierz', 'Andreas', '']]","['robust flows', 'stochastic optimization', 'robust optimization', 'generalization error', 'computational study']"
14469,1301.4351,Djallel Bouneffouf,Djallel Bouneffouf,"Applying machine learning techniques to improve user acceptance on
  ubiquitous environement",,,,urn:nbn:de:0074-731-7 Vol-731,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ubiquitous information access becomes more and more important nowadays and
research is aimed at making it adapted to users. Our work consists in applying
machine learning techniques in order to adapt the information access provided
by ubiquitous systems to users when the system only knows the user social
group, without knowing anything about the user interest. The adaptation
procedures associate actions to perceived situations of the user. Associations
are based on feedback given by the user as a reaction to the behavior of the
system. Our method brings a solution to some of the problems concerning the
acceptance of the system by users when applying machine learning techniques to
systems at the beginning of the interaction between the system and the user.
","[{'version': 'v1', 'created': 'Fri, 18 Jan 2013 11:26:54 GMT'}]",2013-02-05,"[['Bouneffouf', 'Djallel', '']]","['Context awareness', 'Machine learning', 'User acceptance']"
14470,1003.0723,Chengfang Fang,Chengfang Fang and Ee-Chien Chang,"Securing Interactive Sessions Using Mobile Device through Visual Channel
  and Visual Inspection","16 pages, 10 figures",,,,cs.CR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Communication channel established from a display to a device's camera is
known as visual channel, and it is helpful in securing key exchange protocol.
In this paper, we study how visual channel can be exploited by a network
terminal and mobile device to jointly verify information in an interactive
session, and how such information can be jointly presented in a user-friendly
manner, taking into account that the mobile device can only capture and display
a small region, and the user may only want to authenticate selective
regions-of-interests. Motivated by applications in Kiosk computing and
multi-factor authentication, we consider three security models: (1) the mobile
device is trusted, (2) at most one of the terminal or the mobile device is
dishonest, and (3) both the terminal and device are dishonest but they do not
collude or communicate. We give two protocols and investigate them under the
abovementioned models. We point out a form of replay attack that renders some
other straightforward implementations cumbersome to use. To enhance
user-friendliness, we propose a solution using visual cues embedded into the 2D
barcodes and incorporate the framework of ""augmented reality"" for easy
verifications through visual inspection. We give a proof-of-concept
implementation to show that our scheme is feasible in practice.
","[{'version': 'v1', 'created': 'Wed, 3 Mar 2010 03:31:29 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Jul 2010 04:10:33 GMT'}]",2010-07-09,"[['Fang', 'Chengfang', ''], ['Chang', 'Ee-Chien', '']]","['Visual channel protocol', 'Sub-region authentication', 'User-friendly verification']"
14471,1710.04133,Emanuele Massaro Ph.D.,"Umberto Fugiglando, Emanuele Massaro, Paolo Santi, Sebastiano Milardo,
  Kacem Abida, Rainer Stahlmann, Florian Netter, Carlo Ratti","Driving Behavior Analysis through CAN Bus Data in an Uncontrolled
  Environment",,,,,cs.LG cs.CY physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cars can nowadays record several thousands of signals through the CAN bus
technology and potentially provide real-time information on the car, the driver
and the surrounding environment. This paper proposes a new method for the
analysis and classification of driver behavior using a selected subset of CAN
bus signals, specifically gas pedal position, brake pedal pressure, steering
wheel angle, steering wheel momentum, velocity, RPM, frontal and lateral
acceleration. Data has been collected in a completely uncontrolled experiment,
where 64 people drove 10 cars for or a total of over 2000 driving trips without
any type of pre-determined driving instruction on a wide variety of road
scenarios. We propose an unsupervised learning technique that clusters drivers
in different groups, and offers a validation method to test the robustness of
clustering in a wide range of experimental settings. The minimal amount of data
needed to preserve robust driver clustering is also computed. The presented
study provides a new methodology for near-real-time classification of driver
behavior in uncontrolled environments.
","[{'version': 'v1', 'created': 'Mon, 9 Oct 2017 09:58:23 GMT'}]",2017-10-12,"[['Fugiglando', 'Umberto', ''], ['Massaro', 'Emanuele', ''], ['Santi', 'Paolo', ''], ['Milardo', 'Sebastiano', ''], ['Abida', 'Kacem', ''], ['Stahlmann', 'Rainer', ''], ['Netter', 'Florian', ''], ['Ratti', 'Carlo', '']]","['Driving behavior', 'CAN bus', 'feature extraction', 'unsupervised learning', 'drivers segmentation']"
14472,1312.2237,Sugata Sanyal,"Mustafa H.Hajeer, Alka Singh, Dipankar Dasgupta, Sugata Sanyal",Clustering online social network communities using genetic algorithms,"7 pages, 9 figures, 2 tables",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To analyze the activities in an Online Social network (OSN), we introduce the
concept of ""Node of Attraction"" (NoA) which represents the most active node in
a network community. This NoA is identified as the origin/initiator of a
post/communication which attracted other nodes and formed a cluster at any
point in time. In this research, a genetic algorithm (GA) is used as a data
mining method where the main objective is to determine clusters of network
communities in a given OSN dataset. This approach is efficient in handling
different type of discussion topics in our studied OSN - comments, emails, chat
expressions, etc. and can form clusters according to one or more topics. We
believe that this work can be useful in finding the source for spread of this
GA-based clustering of online interactions and reports some results of
experiments with real-world data and demonstrates the performance of proposed
approach.
","[{'version': 'v1', 'created': 'Sun, 8 Dec 2013 17:37:24 GMT'}]",2013-12-10,"[['Hajeer', 'Mustafa H.', ''], ['Singh', 'Alka', ''], ['Dasgupta', 'Dipankar', ''], ['Sanyal', 'Sugata', '']]","['Online Social Network', 'Node of Attraction', 'GABased clustering.  1']"
14473,1409.7595,Jing Chen,"Hau Chan, Jing Chen",Truthful Multi-unit Procurements with Budgets,To appear at WINE 2014,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study procurement games where each seller supplies multiple units of his
item, with a cost per unit known only to him. The buyer can purchase any number
of units from each seller, values different combinations of the items
differently, and has a budget for his total payment.
  For a special class of procurement games, the {\em bounded knapsack} problem,
we show that no universally truthful budget-feasible mechanism can approximate
the optimal value of the buyer within $\ln n$, where $n$ is the total number of
units of all items available. We then construct a polynomial-time mechanism
that gives a $4(1+\ln n)$-approximation for procurement games with {\em concave
additive valuations}, which include bounded knapsack as a special case. Our
mechanism is thus optimal up to a constant factor. Moreover, for the bounded
knapsack problem, given the well-known FPTAS, our results imply there is a
provable gap between the optimization domain and the mechanism design domain.
  Finally, for procurement games with {\em sub-additive valuations}, we
construct a universally truthful budget-feasible mechanism that gives an
$O(\frac{\log^2 n}{\log \log n})$-approximation in polynomial time with a
demand oracle.
","[{'version': 'v1', 'created': 'Fri, 26 Sep 2014 14:58:42 GMT'}]",2014-09-29,"[['Chan', 'Hau', ''], ['Chen', 'Jing', '']]","['procurement auction', 'budget-feasible mechanism', 'optimal mechanism', 'approximation']"
14474,1110.3655,Jorge Silva L,"Jorge Luiz e Silva and Joelmir Jose Lopes and Bruno de Abreu Silva and
  Antonio Carlos Fernandes da Silva","Accelerating Algorithms using a Dataflow Graph in a Reconfigurable
  System","13 pages, 8 figures, 1 listing, 1 algorithm, 1 Table",,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the acceleration of algorithms using a design of a field
programmable gate array (FPGA) as a prototype of a static dataflow architecture
is discussed. The static dataflow architecture using operators interconnected
by parallel buses was implemented. Accelerating algorithms using a dataflow
graph in a reconfigurable system shows the potential for high computation
rates. The results of benchmarks implemented using the static dataflow
architecture are reported at the end of this paper.
","[{'version': 'v1', 'created': 'Mon, 17 Oct 2011 13:00:10 GMT'}]",2015-03-13,"[['Silva', 'Jorge Luiz e', ''], ['Lopes', 'Joelmir Jose', ''], ['Silva', 'Bruno de Abreu', ''], ['da Silva', 'Antonio Carlos Fernandes', '']]","['Accelerating algorithms', 'Reconfigurable Computing', 'StaticDataflow Graph', 'Modules C to VHDL']"
14475,0908.0124,R Doomun,"Atta E. E. Elalfi, and M. E. ElAlami",Intelligent Advisory System for Supporting University Managers in Law,"6 pages, International Journal of Computer Science and Information
  Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423","International Journal of Computer Science and Information
  Security, IJCSIS July 2009, Vol. 3 No. 1, USA",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rights and duties of both staff members and students are regulated by a
large and different numbers of legal regulations and rules. This large number
of rules and regulations makes the decision-making process time consuming and
error boring. Smart advisory systems could provide rapid and accurate advices
to managers and give the arguments for these advices. This paper presents an
intelligent advisory system in law to assist the legal educational processes in
universities and institutes. The aims of the system are: to provide smart legal
advisors in the universities and institutes, to integrate rules and regulations
of universities and institutes in the e-government, to ease the burden on the
legal advisor and the provision of consulting services to users, to achieve
accurate and timely presentation of the legal opinion to a given problem and to
assure flexibility for accepting changes in the rules and legal regulations.
The system is based on experienced jurists and the rules and regulations of the
law organizing Saudi Arabia universities and institutes.
","[{'version': 'v1', 'created': 'Sun, 2 Aug 2009 11:23:34 GMT'}]",2009-08-04,"[['Elalfi', 'Atta E. E.', ''], ['ElAlami', 'M. E.', '']]","['decision support systems', 'advisory systems', 'rule based systems', 'university rules and regulations', 'e-government']"
14476,1208.3719,Chris Thornton,"Chris Thornton and Frank Hutter and Holger H. Hoos and Kevin
  Leyton-Brown","Auto-WEKA: Combined Selection and Hyperparameter Optimization of
  Classification Algorithms","9 pages, 3 figures",,,Technical Report TR-2012-05,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many different machine learning algorithms exist; taking into account each
algorithm's hyperparameters, there is a staggeringly large number of possible
alternatives overall. We consider the problem of simultaneously selecting a
learning algorithm and setting its hyperparameters, going beyond previous work
that addresses these issues in isolation. We show that this problem can be
addressed by a fully automated approach, leveraging recent innovations in
Bayesian optimization. Specifically, we consider a wide range of feature
selection techniques (combining 3 search and 8 evaluator methods) and all
classification approaches implemented in WEKA, spanning 2 ensemble methods, 10
meta-methods, 27 base classifiers, and hyperparameter settings for each
classifier. On each of 21 popular datasets from the UCI repository, the KDD Cup
09, variants of the MNIST dataset and CIFAR-10, we show classification
performance often much better than using standard selection/hyperparameter
optimization methods. We hope that our approach will help non-expert users to
more effectively identify machine learning algorithms and hyperparameter
settings appropriate to their applications, and hence to achieve improved
performance.
","[{'version': 'v1', 'created': 'Sat, 18 Aug 2012 02:14:47 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Mar 2013 23:27:04 GMT'}]",2013-03-08,"[['Thornton', 'Chris', ''], ['Hutter', 'Frank', ''], ['Hoos', 'Holger H.', ''], ['Leyton-Brown', 'Kevin', '']]","['model selection', 'hyperparameter optimization', 'WEKA']"
14477,1212.6883,Vivek Nittoor,"Vivek S. Nittoor, Reiji Suda","Partition Parameters for Girth Maximum (m, r) BTUs",,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the calculation of the optimal partition parameters such
that the girth maximum (m, r) Balanced Tanner Unit lies in family of BTUs
specified by them using a series of proved results and thus creates a framework
for specifying a search problem for finding the girth maximum (m, r) BTU.
Several open questions for girth maximum (m, r) BTU have been raised.
","[{'version': 'v1', 'created': 'Mon, 31 Dec 2012 12:53:32 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Jan 2013 15:06:22 GMT'}]",2013-01-23,"[['Nittoor', 'Vivek S.', ''], ['Suda', 'Reiji', '']]","['Permutation Groups', 'Cycle Index', 'Balanced Tanner Unit', 'Girth Maximum (m', 'r)BTU']"
14478,1207.5176,Dmitry Zinoviev,Dmitry Zinoviev,Clown: a Microprocessor Simulator for Operating System Studies,"6 pages, 3 figures, 2 tables. Presented at Summer Computer Simulation
  Conference, San Jose, July 2004",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, I present the design and implementation of Clown--a simulator
of a microprocessor-based computer system specifically optimized for teaching
operating system courses at undergraduate or graduate levels. The package
includes the simulator itself, as well as a collection of basic I/O devices, an
assembler, a linker, and a disk formatter. The simulator architecturally
resembles mainstream microprocessors from the Intel 80386 family, but is much
easier to learn and program. The simulator is fast enough to be used as an
emulator--in the direct user interaction mode.
","[{'version': 'v1', 'created': 'Sat, 21 Jul 2012 20:30:54 GMT'}]",2012-07-24,"[['Zinoviev', 'Dmitry', '']]","['operating system', 'microprocessor', 'virtualmachine', 'assembly language']"
14479,1205.3863,Saeed Hajizadeh,Saeed Hajizadeh and Ghosheh Abed Hodtani,Three-Receiver Broadcast Channels with Side Information,"5 pages, 2 figures, This paper was accepted for presentation at IEEE
  ISIT 2012",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Three-receiver broadcast channel (BC) is of interest due to its information
theoretical differences with two receiver one. In this paper, we derive
achievable rate regions for two classes of 3-receiver BC with side information
available at the transmitter, Multilevel BC and 3-receiver less noisy BC, by
using superposition coding, Gel'fand-Pinsker binning scheme and Nair-El Gamal
indirect decoding. Our rate region for multilevel BC subsumes the Steinberg
rate region for 2-receiver degraded BC with side information as its special
case. We also find the capacity region of 3-receiver less noisy BC when side
information is available both at the transmitter and at the receivers.
","[{'version': 'v1', 'created': 'Thu, 17 May 2012 07:00:13 GMT'}, {'version': 'v2', 'created': 'Fri, 18 May 2012 11:51:39 GMT'}]",2012-05-21,"[['Hajizadeh', 'Saeed', ''], ['Hodtani', 'Ghosheh Abed', '']]","['3-receiver broadcast channel', 'less noisy', 'Multilevel broadcast channel']"
14480,1610.02333,Fahim Imam,Fahim T. Imam,Application of Ontologies in Cloud Computing: The State-Of-The-Art,13 pages,,,,cs.DC cs.AI,http://creativecommons.org/licenses/by/4.0/,"  This paper presents a systematic survey on existing literature and seminal
works relevant to the application of ontologies in different aspects of Cloud
computing. Our hypothesis is that ontologies along with their reasoning
capabilities can have significant impact on improving various aspects of the
Cloud computing phenomena. Ontologies can promote intelligent decision support
mechanisms for various Cloud based services. They can also provide effective
interoperability among the Cloud based systems and resources. This survey can
promote a comprehensive understanding on the roles and significance of
ontologies within the overall domain of Cloud Computing. Also, this project can
potentially form the basis of new research area and possibilities for both
ontology and Cloud computing communities.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2016 05:39:37 GMT'}]",2016-10-10,"[['Imam', 'Fahim T.', '']]","['Cloud Computing', 'Ontologies', 'Cloud interoperability']"
14481,1504.04773,Danila Gorodecky,Danila Gorodecky,Reed-Muller Realization of X (mod P),,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article provides a novel technique of X (mod P) realization. It is based
on the Reed-Muller polynomial expansion. The advantage of the approach
concludes in the capability to realize X (mod P) for an arbitrary P. The
approach is competitive with the known realizations on the speed processing.
Advantages and results of comparison with the known approaches for X [9:1] and
P=7 is demonstrated.
","[{'version': 'v1', 'created': 'Sat, 18 Apr 2015 22:52:05 GMT'}]",2015-04-21,"[['Gorodecky', 'Danila', '']]","['modular arithmetic', 'residue number system', 'X (mod']"
14482,0706.3639,Marcus Hutter,Shane Legg and Marcus Hutter,A Collection of Definitions of Intelligence,12 LaTeX pages,"Frontiers in Artificial Intelligence and Applications, Vol.157
  (2007) 17-24",,IDSIA-07-07,cs.AI,,"  This paper is a survey of a large number of informal definitions of
``intelligence'' that the authors have collected over the years. Naturally,
compiling a complete list would be impossible as many definitions of
intelligence are buried deep inside articles and books. Nevertheless, the
70-odd definitions presented here are, to the authors' knowledge, the largest
and most well referenced collection there is.
","[{'version': 'v1', 'created': 'Mon, 25 Jun 2007 13:40:56 GMT'}]",2007-06-26,"[['Legg', 'Shane', ''], ['Hutter', 'Marcus', '']]","['Intelligence definitions', 'collective', 'psychologist', 'artificial', 'universal']"
14483,1301.5201,Anna Zygmunt,"Bogdan Gliwa, Jaros{\l}aw Ko\'zlak, Anna Zygmunt, Krzysztof
  Cetnarowicz","Models of Social Groups in Blogosphere Based on Information about
  Comment Addressees and Sentiments","Gliwa B., Ko\'zlak J., Zygmunt A., Models of Social Groups in
  Blogosphere Based on Information about Comment Addressees and Sentiments, in
  the K. Aberer et al. (Eds.): SocInfo 2012, LNCS 7710, pp. 475-488, Best Paper
  Award","SocInfo 2012, LNCS 7710, pp. 475-488",,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work concerns the analysis of number, sizes and other characteristics of
groups identified in the blogosphere using a set of models identifying social
relations. These models differ regarding identification of social relations,
influenced by methods of classifying the addressee of the comments (they are
either the post author or the author of a comment on which this comment is
directly addressing) and by a sentiment calculated for comments considering the
statistics of words present and connotation. The state of a selected blog
portal was analyzed in sequential, partly overlapping time intervals. Groups in
each interval were identified using a version of the CPM algorithm, on the
basis of them, stable groups, existing for at least a minimal assumed duration
of time, were identified.
","[{'version': 'v1', 'created': 'Tue, 22 Jan 2013 14:49:12 GMT'}]",2013-01-23,"[['Gliwa', 'Bogdan', ''], ['Koźlak', 'Jarosław', ''], ['Zygmunt', 'Anna', ''], ['Cetnarowicz', 'Krzysztof', '']]","['social network analysis', 'groups', 'blogosphere', 'sentiment']"
14484,1511.00021,Fred Glover,"Fred Glover, Vladimir Shylo, Oleg Shylo","Narrow Gauge and Analytical Branching Strategies for Mixed Integer
  Programming",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  State-of-the-art branch and bound algorithms for mixed integer programming
make use of special methods for making branching decisions. Strategies that
have gained prominence include modern variants of so-called strong branching
(Applegate, et al.,1995) and reliability branching (Achterberg, Koch and
Martin, 2005; Hendel, 2015), which select variables for branching by solving
associated linear programs and exploit pseudo-costs (Benichou et al., 1971). We
suggest new branching criteria and propose alternative branching approaches
called narrow gauge and analytical branching. The perspective underlying our
approaches is to focus on prioritization of child nodes to examine fewer
candidate variables at the current node of the B&B tree, balanced with
procedures to extrapolate the implications of choosing these candidates by
generating a small-depth look-ahead tree. Our procedures can also be used in
rules to select among open tree nodes (those whose child nodes have not yet
been generated). We incorporate pre- and post-winnowing procedures to
progressively isolate preferred branching candidates, and employ derivative
(created) variables whose branches are able to explore the solution space more
deeply.
","[{'version': 'v1', 'created': 'Fri, 30 Oct 2015 20:12:27 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jan 2016 16:17:56 GMT'}]",2016-01-08,"[['Glover', 'Fred', ''], ['Shylo', 'Vladimir', ''], ['Shylo', 'Oleg', '']]","['Mixed integer programming', 'branching strategies', 'metaheuristic optimization', 'pseudo-costs']"
14485,0906.5070,R Doomun,"R. Thamilselvan, Dr. P. Balasubramanie","Integrating Genetic Algorithm, Tabu Search Approach for Job Shop
  Scheduling","6 pages, International Journal of Computer Science and Information
  Security (IJCSIS)","IJCSIS June 2009 Issue, Vol. 2, No. 1",,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new algorithm based on integrating Genetic Algorithms
and Tabu Search methods to solve the Job Shop Scheduling problem. The idea of
the proposed algorithm is derived from Genetic Algorithms. Most of the
scheduling problems require either exponential time or space to generate an
optimal answer. Job Shop scheduling (JSS) is the general scheduling problem and
it is a NP-complete problem, but it is difficult to find the optimal solution.
This paper applies Genetic Algorithms and Tabu Search for Job Shop Scheduling
problem and compares the results obtained by each. With the implementation of
our approach the JSS problems reaches optimal solution and minimize the
makespan.
","[{'version': 'v1', 'created': 'Sat, 27 Jun 2009 11:16:30 GMT'}]",2009-06-30,"[['Thamilselvan', 'R.', ''], ['Balasubramanie', 'Dr. P.', '']]","['Genetic Algorithm', 'Tabu Search', 'Simulated Annealing', 'Clustering Algorithm', 'Job Shop Scheduling']"
14486,1707.08373,Guillaume Deffuant,Guillaume Deffuant,Recursive simplex stars,"40 pages, 16 figures",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a new method which builds a simplex based approximation
of a $d-1$-dimensional manifold $M$ separating a $d$-dimensional compact set
into two parts, and an efficient algorithm classifying points according to this
approximation. In a first variant, the approximation is made of simplices that
are defined in the cubes of a regular grid covering the compact set, from
boundary points that approximate the intersection between $M$ and the edges of
the cubes. All the simplices defined in a cube share the barycentre of the
boundary points located in the cube and include simplices similarly defined in
cube facets, and so on recursively. In a second variant, the Kuhn triangulation
is used to break the cubes into simplices and the approximation is defined in
these simplices from the boundary points computed on their edges, with the same
principle. Both the approximation in cubes and in simplices define a separating
surface on the whole grid and classifying a point on one side or the other of
this surface requires only a small number (at most $d$) of simple tests. Under
some conditions on the definition of the boundary points and on the reach of
$M$, for both variants the Hausdorff distance between $M$ and its approximation
decreases like $\mathcal{O}(d n_G^{-2})$, where $n_G$ is the number of points
on each axis of the grid. The approximation in cubes requires computing less
boundary points than the approximation in simplices but the latter is always a
manifold and is more accurate for a given value of $n_G$. The paper reports
tests of the method when varying $n_G$ and the dimensionality of the space (up
to 9).
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 11:03:15 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Oct 2017 06:25:02 GMT'}, {'version': 'v3', 'created': 'Tue, 17 Jul 2018 14:40:58 GMT'}]",2018-07-18,"[['Deffuant', 'Guillaume', '']]","['classification', 'marching cubes', 'simplex star']"
14487,1005.0268,Andri Mirzal M.Sc.,Andri Mirzal and Masashi Furukawa,Node-Context Network Clustering using PARAFAC Tensor Decomposition,"6 pages, 4 figures, International Conference on Information &
  Communication Technology and Systems",,,,cs.IR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We describe a clustering method for labeled link network (semantic graph)
that can be used to group important nodes (highly connected nodes) with their
relevant link's labels by using PARAFAC tensor decomposition. In this kind of
network, the adjacency matrix can not be used to fully describe all information
about the network structure. We have to expand the matrix into 3-way adjacency
tensor, so that not only the information about to which nodes a node connects
to but by which link's labels is also included. And by applying PARAFAC
decomposition on this tensor, we get two lists, nodes and link's labels with
scores attached to each node and labels, for each decomposition group. So
clustering process to get the important nodes along with their relevant labels
can be done simply by sorting the lists in decreasing order. To test the
method, we construct labeled link network by using blog's dataset, where the
blogs are the nodes and labeled links are the shared words among them. The
similarity measures between the results and standard measures look promising,
especially for two most important tasks, finding the most relevant words to
blogs query and finding the most similar blogs to blogs query, about 0.87.
","[{'version': 'v1', 'created': 'Mon, 3 May 2010 12:28:42 GMT'}]",2010-05-04,"[['Mirzal', 'Andri', ''], ['Furukawa', 'Masashi', '']]","['clustering method', 'PARAFAC decomposition', 'adjacency tensor', 'labeled link network', 'blogs   1 INTRODUCTION']"
14488,1609.01592,Siddhartha Jonnalagadda,"Ravi P Garg, Kalpana Raja, Siddhartha R Jonnalagadda",CRTS: A type system for representing clinical recommendations,,,,,cs.CL cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Clinical guidelines and recommendations are the driving wheels of
the evidence-based medicine (EBM) paradigm, but these are available primarily
as unstructured text and are generally highly heterogeneous in nature. This
significantly reduces the dissemination and automatic application of these
recommendations at the point of care. A comprehensive structured representation
of these recommendations is highly beneficial in this regard. Objective: The
objective of this paper to present Clinical Recommendation Type System (CRTS),
a common type system that can effectively represent a clinical recommendation
in a structured form. Methods: CRTS is built by analyzing 125 recommendations
and 195 research articles corresponding to 6 different diseases available from
UpToDate, a publicly available clinical knowledge system, and from the National
Guideline Clearinghouse, a public resource for evidence-based clinical practice
guidelines. Results: We show that CRTS not only covers the recommendations but
also is flexible to be extended to represent information from primary
literature. We also describe how our developed type system can be applied for
clinical decision support, medical knowledge summarization, and citation
retrieval. Conclusion: We showed that our proposed type system is precise and
comprehensive in representing a large sample of recommendations available for
various disorders. CRTS can now be used to build interoperable information
extraction systems that automatically extract clinical recommendations and
related data elements from clinical evidence resources, guidelines, systematic
reviews and primary publications.
  Keywords: guidelines and recommendations, type system, clinical decision
support, evidence-based medicine, information storage and retrieval
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2016 15:02:03 GMT'}]",2016-09-07,"[['Garg', 'Ravi P', ''], ['Raja', 'Kalpana', ''], ['Jonnalagadda', 'Siddhartha R', '']]","['guidelines and recommendations', 'type system', 'clinical decision support', 'evidence']"
14489,1208.2318,Markus Wagner,"Olaf Mersmann, Bernd Bischl, Heike Trautmann, Markus Wagner, Frank
  Neumann","A Novel Feature-Based Approach to Characterize Algorithm Performance for
  the Traveling Salesman Problem","33 pages, 17 figure",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Meta-heuristics are frequently used to tackle NP-hard combinatorial
optimization problems. With this paper we contribute to the understanding of
the success of 2-opt based local search algorithms for solving the traveling
salesman problem (TSP). Although 2-opt is widely used in practice, it is hard
to understand its success from a theoretical perspective. We take a statistical
approach and examine the features of TSP instances that make the problem either
hard or easy to solve. As a measure of problem difficulty for 2-opt we use the
approximation ratio that it achieves on a given instance. Our investigations
point out important features that make TSP instances hard or easy to be
approximated by 2-opt.
","[{'version': 'v1', 'created': 'Sat, 11 Aug 2012 07:31:50 GMT'}]",2012-08-14,"[['Mersmann', 'Olaf', ''], ['Bischl', 'Bernd', ''], ['Trautmann', 'Heike', ''], ['Wagner', 'Markus', ''], ['Neumann', 'Frank', '']]","['TSP', '2-opt', 'Classification', 'Feature Selection', 'MARS']"
14490,1702.02030,Lijun Zhang,"Lijun Zhang, Tianbao Yang, Rong Jin","Empirical Risk Minimization for Stochastic Convex Optimization:
  $O(1/n)$- and $O(1/n^2)$-type of Risk Bounds",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although there exist plentiful theories of empirical risk minimization (ERM)
for supervised learning, current theoretical understandings of ERM for a
related problem---stochastic convex optimization (SCO), are limited. In this
work, we strengthen the realm of ERM for SCO by exploiting smoothness and
strong convexity conditions to improve the risk bounds. First, we establish an
$\widetilde{O}(d/n + \sqrt{F_*/n})$ risk bound when the random function is
nonnegative, convex and smooth, and the expected function is Lipschitz
continuous, where $d$ is the dimensionality of the problem, $n$ is the number
of samples, and $F_*$ is the minimal risk. Thus, when $F_*$ is small we obtain
an $\widetilde{O}(d/n)$ risk bound, which is analogous to the
$\widetilde{O}(1/n)$ optimistic rate of ERM for supervised learning. Second, if
the objective function is also $\lambda$-strongly convex, we prove an
$\widetilde{O}(d/n + \kappa F_*/n )$ risk bound where $\kappa$ is the condition
number, and improve it to $O(1/[\lambda n^2] + \kappa F_*/n)$ when
$n=\widetilde{\Omega}(\kappa d)$. As a result, we obtain an $O(\kappa/n^2)$
risk bound under the condition that $n$ is large and $F_*$ is small, which to
the best of our knowledge, is the first $O(1/n^2)$-type of risk bound of ERM.
Third, we stress that the above results are established in a unified framework,
which allows us to derive new risk bounds under weaker conditions, e.g.,
without convexity of the random function and Lipschitz continuity of the
expected function. Finally, we demonstrate that to achieve an $O(1/[\lambda
n^2] + \kappa F_*/n)$ risk bound for supervised learning, the
$\widetilde{\Omega}(\kappa d)$ requirement on $n$ can be replaced with
$\Omega(\kappa^2)$, which is dimensionality-independent.
","[{'version': 'v1', 'created': 'Tue, 7 Feb 2017 14:14:19 GMT'}]",2017-02-08,"[['Zhang', 'Lijun', ''], ['Yang', 'Tianbao', ''], ['Jin', 'Rong', '']]","['Empirical Risk Minimization', 'Stochastic Convex Optimization', 'Excess Risk']"
14491,1603.08497,Guillaume Noyel,"Guillaume Noyel (CMM), Jesus Angulo (CMM), Dominique Jeulin (CMM)","On distances, paths and connections for hyperspectral image segmentation",,"Proceedings of the 8th International Symposium on Mathematical
  Morphology: Volume 1, pp.399-410, 2007, 978-85-17-00032-5",,N-08/07/MM,cs.CV math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The present paper introduces the $\eta$ and {\eta} connections in order to
add regional information on $\lambda$-flat zones, which only take into account
a local information. A top-down approach is considered. First $\lambda$-flat
zones are built in a way leading to a sub-segmentation. Then a finer
segmentation is obtained by computing $\eta$-bounded regions and $\mu$-geodesic
balls inside the $\lambda$-flat zones. The proposed algorithms for the
construction of new partitions are based on queues with an ordered selection of
seeds using the cumulative distance. $\eta$-bounded regions offers a control on
the variations of amplitude in the class from a point, called center, and
$\mu$-geodesic balls controls the ""size"" of the class. These results are
applied to hyperspectral images.
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2016 09:17:06 GMT'}]",2016-03-29,"[['Noyel', 'Guillaume', '', 'CMM'], ['Angulo', 'Jesus', '', 'CMM'], ['Jeulin', 'Dominique', '', 'CMM']]","['hyperspectral image', 'connection', 'quasi-flat zones', 'η-bounded regions', 'µ-geodesic balls', 'top-down aggregation']"
14492,1704.01652,Christopher Harshaw,"Moran Feldman, Christopher Harshaw, Amin Karbasi","Greed is Good: Near-Optimal Submodular Maximization via Greedy
  Optimization",,,,,cs.LG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is known that greedy methods perform well for maximizing monotone
submodular functions. At the same time, such methods perform poorly in the face
of non-monotonicity. In this paper, we show - arguably, surprisingly - that
invoking the classical greedy algorithm $O(\sqrt{k})$-times leads to the
(currently) fastest deterministic algorithm, called Repeated Greedy, for
maximizing a general submodular function subject to $k$-independent system
constraints. Repeated Greedy achieves $(1 + O(1/\sqrt{k}))k$ approximation
using $O(nr\sqrt{k})$ function evaluations (here, $n$ and $r$ denote the size
of the ground set and the maximum size of a feasible solution, respectively).
We then show that by a careful sampling procedure, we can run the greedy
algorithm only once and obtain the (currently) fastest randomized algorithm,
called Sample Greedy, for maximizing a submodular function subject to
$k$-extendible system constraints (a subclass of $k$-independent system
constrains). Sample Greedy achieves $(k + 3)$-approximation with only $O(nr/k)$
function evaluations. Finally, we derive an almost matching lower bound, and
show that no polynomial time algorithm can have an approximation ratio smaller
than $ k + 1/2 - \varepsilon$. To further support our theoretical results, we
compare the performance of Repeated Greedy and Sample Greedy with prior art in
a concrete application (movie recommendation). We consistently observe that
while Sample Greedy achieves practically the same utility as the best baseline,
it performs at least two orders of magnitude faster.
","[{'version': 'v1', 'created': 'Wed, 5 Apr 2017 21:03:53 GMT'}]",2017-04-07,"[['Feldman', 'Moran', ''], ['Harshaw', 'Christopher', ''], ['Karbasi', 'Amin', '']]","['Submodular maximization', 'k-systems', 'k-extendible systems', 'approximation algorithms']"
14493,1602.07646,Gary Prok,Gary R. Prok,"Life, The Mind, and Everything","25 pages, 5 figures",,,,cs.GL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Incompleteness theorems of Godel, Turing, Chaitin, and Algorithmic
Information Theory have profound epistemological implications. Incompleteness
limits our ability to ever understand every observable phenomenon in the
universe. Incompleteness limits the ability of evolutionary processes from
finding optimal solutions. Incompleteness limits the detectability of machine
consciousness. This is an effort to convey these thoughts and results in a
somewhat entertaining manner.
","[{'version': 'v1', 'created': 'Fri, 19 Feb 2016 18:16:57 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Feb 2016 18:02:20 GMT'}]",2016-02-26,"[['Prok', 'Gary R.', '']]","['incompleteness', 'halting', 'Rice’s theorem', 'algorithmic information theory', 'AIT', 'evolution', 'consciousness', 'epistemology']"
14494,1412.4186,Eugene Borovikov,Eugene Borovikov,An Evaluation of Support Vector Machines as a Pattern Recognition Tool,"A short (6 page) report on evaluation of the SVM as a pattern
  classification tool, as of 1999",,,,cs.LG,http://creativecommons.org/licenses/publicdomain/,"  The purpose of this report is in examining the generalization performance of
Support Vector Machines (SVM) as a tool for pattern recognition and object
classification. The work is motivated by the growing popularity of the method
that is claimed to guarantee a good generalization performance for the task in
hand. The method is implemented in MATLAB. SVMs based on various kernels are
tested for classifying data from various domains.
","[{'version': 'v1', 'created': 'Sat, 13 Dec 2014 03:33:13 GMT'}]",2014-12-16,"[['Borovikov', 'Eugene', '']]","['Statistical Learning Theory', 'Pattern Recognition', 'Support Vector Machine', 'SVM', 'VC Dimension']"
14495,1403.7811,Qing Wang,"Qing Wang, Balaji Rengarajan, Joerg Widmer","Increasing Opportunistic Gain in Small Cells Through Energy-Aware User
  Cooperation","13 pages, 14 figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To meet the increasing demand for wireless capacity, future networks are
likely to consist of dense layouts of small cells. The number of users in each
cell is thus reduced which results in diminished gains from opportunistic
scheduling, particularly under dynamic traffic loads. We propose an
user-initiated base station (BS)-transparent traffic spreading approach that
leverages user-user communication to increase BS scheduling flexibility. The
proposed scheme can increase opportunistic gain and improve user performance.
For a specified tradeoff between performance and power expenditure, we
characterize the optimal policy by modeling the system as a Markov decision
process and also present a heuristic algorithm that yields significant
performance gains. Our simulations show that, in the performance-centric case,
average file transfer delays are lowered by up to 20% even in homogeneous
scenarios, and up to 50% with heterogeneous users. Further, we show that the
bulk of the performance improvement can be achieved with a small increase in
power expenditure, e.g., in an energy-sensitive case, up to 78% of the
performance improvement can be typically achieved at only 20% of the power
expenditure of the performance-centric case.
","[{'version': 'v1', 'created': 'Sun, 30 Mar 2014 20:51:04 GMT'}]",2014-04-01,"[['Wang', 'Qing', ''], ['Rengarajan', 'Balaji', ''], ['Widmer', 'Joerg', '']]","['Small cells', 'opportunistic scheduling', 'user-user communication', 'energy efficiency', 'file transfer delay']"
14496,1205.6192,Johann Schuster,Johann Schuster and Markus Siegle,"Markov Automata: Deciding Weak Bisimulation by means of non-naively
  Vanishing States","Main results stay the same as in the previous versions, but the
  proofs have completely changed",,,,cs.LO cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper develops a decision algorithm for weak bisimulation on Markov
Automata (MA). For that purpose, different notions of vanishing state (a
concept known from the area of Generalised Stochastic Petri Nets) are defined.
Vanishing states are shown to be essential for relating the concepts of
(state-based) naive weak bisimulation and (distribution-based) weak
bisimulation. The bisimulation algorithm presented here follows the
partition-refinement scheme and has exponential time complexity.
","[{'version': 'v1', 'created': 'Mon, 28 May 2012 19:30:57 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Jun 2012 21:38:59 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Mar 2013 18:11:30 GMT'}, {'version': 'v4', 'created': 'Wed, 30 Apr 2014 19:17:21 GMT'}]",2014-05-01,"[['Schuster', 'Johann', ''], ['Siegle', 'Markus', '']]","['Markov automata', 'weak bisimulation', 'vanishing state', 'elimination']"
14497,1505.02100,Marek Sawerwain,Artur Gramacki and Marek Sawerwain and Jaros{\l}aw Gramacki,"FPGA-Based Bandwidth Selection for Kernel Density Estimation Using High
  Level Synthesis Approach","23 pages, 6 figures, extended version of initial paper",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  FPGA technology can offer significantly hi\-gher performance at much lower
power consumption than is available from CPUs and GPUs in many computational
problems. Unfortunately, programming for FPGA (using ha\-rdware description
languages, HDL) is a difficult and not-trivial task and is not intuitive for
C/C++/Java programmers. To bring the gap between programming effectiveness and
difficulty the High Level Synthesis (HLS) approach is promoting by main FPGA
vendors. Nowadays, time-intensive calculations are mainly performed on GPU/CPU
architectures, but can also be successfully performed using HLS approach. In
the paper we implement a bandwidth selection algorithm for kernel density
estimation (KDE) using HLS and show techniques which were used to optimize the
final FPGA implementation. We are also going to show that FPGA speedups,
comparing to highly optimized CPU and GPU implementations, are quite
substantial. Moreover, power consumption for FPGA devices is usually much less
than typical power consumption of the present CPUs and GPUs.
","[{'version': 'v1', 'created': 'Fri, 8 May 2015 16:54:00 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Sep 2015 20:00:15 GMT'}]",2015-10-01,"[['Gramacki', 'Artur', ''], ['Sawerwain', 'Marek', ''], ['Gramacki', 'Jarosław', '']]","['FPGA', 'High Level Synthesis', 'Kernel Density Estima']"
14498,1306.4265,Sasan Maleki,"Sasan Maleki, Long Tran-Thanh, Greg Hines, Talal Rahwan, Alex Rogers","Bounding the Estimation Error of Sampling-based Shapley Value
  Approximation",,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Shapley value is arguably the most central normative solution concept in
cooperative game theory. It specifies a unique way in which the reward from
cooperation can be ""fairly"" divided among players. While it has a wide range of
real world applications, its use is in many cases hampered by the hardness of
its computation. A number of researchers have tackled this problem by (i)
focusing on classes of games where the Shapley value can be computed
efficiently, or (ii) proposing representation formalisms that facilitate such
efficient computation, or (iii) approximating the Shapley value in certain
classes of games. For the classical \textit{characteristic function}
representation, the only attempt to approximate the Shapley value for the
general class of games is due to Castro \textit{et al.} \cite{castro}. While
this algorithm provides a bound on the approximation error, this bound is
\textit{asymptotic}, meaning that it only holds when the number of samples
increases to infinity. On the other hand, when a finite number of samples is
drawn, an unquantifiable error is introduced, meaning that the bound no longer
holds. With this in mind, we provide non-asymptotic bounds on the estimation
error for two cases: where (i) the \textit{variance}, and (ii) the
\textit{range}, of the players' marginal contributions is known. Furthermore,
for the second case, we show that when the range is significantly large
relative to the Shapley value, the bound can be improved (from $O(\frac{r}{m})$
to $O(\sqrt{\frac{r}{m}})$). Finally, we propose, and demonstrate the
effectiveness of using stratified sampling for improving the bounds further.
","[{'version': 'v1', 'created': 'Tue, 18 Jun 2013 16:51:53 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Feb 2014 22:51:33 GMT'}]",2014-02-14,"[['Maleki', 'Sasan', ''], ['Tran-Thanh', 'Long', ''], ['Hines', 'Greg', ''], ['Rahwan', 'Talal', ''], ['Rogers', 'Alex', '']]","['Shapley value', 'Approximation algorithm', 'Game theory']"
14499,1504.05837,Fran\c{c}ois Septier,"Thi Le Thu Nguyen, Francois Septier, Harizo Rajaona, Gareth W. Peters,
  Ido Nevat, Yves Delignon","New Perspectives on Multiple Source Localization in Wireless Sensor
  Networks",,,,,cs.IT math.IT stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we address the challenging problem of multiple source
localization in Wireless Sensor Networks (WSN). We develop an efficient
statistical algorithm, based on the novel application of Sequential Monte Carlo
(SMC) sampler methodology, that is able to deal with an unknown number of
sources given quantized data obtained at the fusion center from different
sensors with imperfect wireless channels. We also derive the Posterior
Cram\'er-Rao Bound (PCRB) of the source location estimate. The PCRB is used to
analyze the accuracy of the proposed SMC sampler algorithm and the impact that
quantization has on the accuracy of location estimates of the sources.
Extensive experiments show that the benefits of the proposed scheme in terms of
the accuracy of the estimation method that are required for model selection
(i.e., the number of sources) and the estimation of the source characteristics
compared to the classical importance sampling method.
","[{'version': 'v1', 'created': 'Wed, 22 Apr 2015 14:56:11 GMT'}]",2015-04-23,"[['Nguyen', 'Thi Le Thu', ''], ['Septier', 'Francois', ''], ['Rajaona', 'Harizo', ''], ['Peters', 'Gareth W.', ''], ['Nevat', 'Ido', ''], ['Delignon', 'Yves', '']]","['Wireless sensor networks', 'localization', 'multiple sources', 'quantized data', 'Sequential Monte Carlo']"
14500,1501.03218,Eelke Folmer,"Halim Cagri Ates, Ilias Apostolopoulos, Eelke Folmer",Expanding the Vocabulary of Multitouch Input using Magnetic Fingerprints,"8 pages, 8 figures",,,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We present magnetic fingerprints; an input technique for mobile touchscreen
devices that uses a small magnet attached to a user's fingernail in order to
differentiate between a normal touch and a magnetic touch. The polarity of the
magnet can be used to create different magnetic fingerprints where this
technique takes advantage of the rich vocabulary offered by the use of
multitouch input. User studies investigate the accuracy of magnetic fingerprint
recognition in relation to magnet size, number of magnetic fingerprints used;
and size of the touchscreen. Studies found our technique to be limited to using
up to two fingerprints non-simultaneously, while achieving a high
classification accuracy (95%) but it nearly triples the number of
distinguishable multi touch events. Potential useful applications of this
technique are presented.
","[{'version': 'v1', 'created': 'Wed, 14 Jan 2015 00:18:53 GMT'}]",2015-01-15,"[['Ates', 'Halim Cagri', ''], ['Apostolopoulos', 'Ilias', ''], ['Folmer', 'Eelke', '']]","['Magnetic fingerprinting', 'touch-screen', 'fingers', 'touch', 'multi-user', 'collaborative', 'security', 'input']"
14501,0806.3325,Chau Yuen,"Chau Yuen, Yong Liang Guan, Tjeng Thiang Tjhung",On the Search for High-Rate Quasi-Orthogonal Space-Time Block Code,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Quasi-Orthogonal Space-Time Block Code (QO-STBC) is attractive because it
achieves higher code rate than Orthogonal STBC and lower decoding complexity
than nonorthogonal STBC. In this paper, we first derive the algebraic structure
of QO-STBC, then we apply it in a novel graph-based search algorithm to find
high-rate QO-STBCs with code rates greater than 1. From the four-antenna codes
found using this approach, it is found that the maximum code rate is limited to
5/4 with symbolwise diversity level of four, and 4 with symbolwise diversity
level of two. The maximum likelihood decoding of these high-rate QO-STBCs can
be performed on two separate sub-groups of symbols. The rate-5/4 codes are the
first known QO-STBCs with code rate greater 1 that has full symbolwise
diversity level.
","[{'version': 'v1', 'created': 'Fri, 20 Jun 2008 06:38:56 GMT'}]",2008-06-23,"[['Yuen', 'Chau', ''], ['Guan', 'Yong Liang', ''], ['Tjhung', 'Tjeng Thiang', '']]","['High code rate', 'Multiple Input Multiple Output (MIMO)', 'Quasi-Orthogonal Space']"
14502,1705.09193,Sultan Imangaliyev,"Sultan Imangaliyev, Monique H. van der Veen, Catherine M. C.
  Volgenant, Bruno G. Loos, Bart J. F. Keijser, Wim Crielaard, Evgeni Levin","Classification of Quantitative Light-Induced Fluorescence Images Using
  Convolutional Neural Network",Full version of ICANN 2017 submission,,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Images are an important data source for diagnosis and treatment of oral
diseases. The manual classification of images may lead to misdiagnosis or
mistreatment due to subjective errors. In this paper an image classification
model based on Convolutional Neural Network is applied to Quantitative
Light-induced Fluorescence images. The deep neural network outperforms other
state of the art shallow classification models in predicting labels derived
from three different dental plaque assessment scores. The model directly
benefits from multi-channel representation of the images resulting in improved
performance when, besides the Red colour channel, additional Green and Blue
colour channels are used.
","[{'version': 'v1', 'created': 'Thu, 25 May 2017 14:21:40 GMT'}]",2017-05-26,"[['Imangaliyev', 'Sultan', ''], ['van der Veen', 'Monique H.', ''], ['Volgenant', 'Catherine M. C.', ''], ['Loos', 'Bruno G.', ''], ['Keijser', 'Bart J. F.', ''], ['Crielaard', 'Wim', ''], ['Levin', 'Evgeni', '']]","['Deep Learning', 'Convolutional Neural Networks', 'Bioinformatics', 'Quantitative Light-Induced Fluorescence']"
14503,1702.06533,Weiran Wang,"Chao Gao, Dan Garber, Nathan Srebro, Jialei Wang, Weiran Wang",Stochastic Canonical Correlation Analysis,Accepted by JMLR,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the sample complexity of canonical correlation analysis (CCA), \ie,
the number of samples needed to estimate the population canonical correlation
and directions up to arbitrarily small error. With mild assumptions on the data
distribution, we show that in order to achieve $\epsilon$-suboptimality in a
properly defined measure of alignment between the estimated canonical
directions and the population solution, we can solve the empirical objective
exactly with $N(\epsilon, \Delta, \gamma)$ samples, where $\Delta$ is the
singular value gap of the whitened cross-covariance matrix and $1/\gamma$ is an
upper bound of the condition number of auto-covariance matrices. Moreover, we
can achieve the same learning accuracy by drawing the same level of samples and
solving the empirical objective approximately with a stochastic optimization
algorithm; this algorithm is based on the shift-and-invert power iterations and
only needs to process the dataset for $\mathcal{O}\left(\log \frac{1}{\epsilon}
\right)$ passes. Finally, we show that, given an estimate of the canonical
correlation, the streaming version of the shift-and-invert power iterations
achieves the same learning accuracy with the same level of sample complexity,
by processing the data only once.
","[{'version': 'v1', 'created': 'Tue, 21 Feb 2017 04:23:41 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Oct 2019 16:21:26 GMT'}]",2019-10-22,"[['Gao', 'Chao', ''], ['Garber', 'Dan', ''], ['Srebro', 'Nathan', ''], ['Wang', 'Jialei', ''], ['Wang', 'Weiran', '']]","['Canonical correlation analysis', 'sample complexity', 'shift-and-invert preconditioning', 'streaming CCA']"
14504,1402.3690,Jonathan Heras,J\'onathan Heras and Ekaterina Komendantskaya and Martin Schmidt,(Co)recursion in Logic Programming: Lazy vs Eager,To appear in Theory and Practice of Logic Programming (TPLP),,,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CoAlgebraic Logic Programming (CoALP) is a dialect of Logic Programming
designed to bring a more precise compile-time and run-time analysis of
termination and productivity for recursive and corecursive functions in Logic
Programming. Its second goal is to introduce guarded lazy (co)recursion akin to
functional theorem provers into logic programming. In this paper, we explain
lazy features of CoALP, and compare them with the loop-analysis and eager
execution in Coinductive Logic Programming (CoLP). We conclude by outlining the
future directions in developing the guarded (co)recursion in logic programming.
","[{'version': 'v1', 'created': 'Sat, 15 Feb 2014 13:28:34 GMT'}, {'version': 'v2', 'created': 'Thu, 15 May 2014 21:25:25 GMT'}, {'version': 'v3', 'created': 'Mon, 19 May 2014 08:07:40 GMT'}, {'version': 'v4', 'created': 'Tue, 20 May 2014 07:46:48 GMT'}]",2014-05-21,"[['Heras', 'Jónathan', ''], ['Komendantskaya', 'Ekaterina', ''], ['Schmidt', 'Martin', '']]","['Logic Programming', 'Recursion', 'Corecursion', 'Termination', 'Productivity', 'Guardedness']"
14505,1502.03913,Smitha M.L.,"B.H. Shekar, Smitha M.L",Skeleton Matching based approach for Text Localization in Scene Images,"10 pages, 8 figures, Eighth International Conference on Image and
  Signal Processing,Elsevier Publications,pp: 145-153, held at UVCE, Bangalore
  in July 2014. ISBN: 9789351072522",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a skeleton matching based approach which aids in
text localization in scene images. The input image is preprocessed and
segmented into blocks using connected component analysis. We obtain the
skeleton of the segmented block using morphology based approach. The
skeletonized images are compared with the trained templates in the database to
categorize into text and non-text blocks. Further, the newly designed
geometrical rules and morphological operations are employed on the detected
text blocks for scene text localization. The experimental results obtained on
publicly available standard datasets illustrate that the proposed method can
detect and localize the texts of various sizes, fonts and colors.
","[{'version': 'v1', 'created': 'Fri, 13 Feb 2015 08:42:00 GMT'}]",2015-02-23,"[['Shekar', 'B. H.', ''], ['L', 'Smitha M.', '']]","['Segmentation', 'Skeletonization', 'Template Matching', 'Text Localization']"
14506,1004.0591,Secretary Aircc Journal,"Eric Ke Wang, Lucas C.K.Hui and S.M.Yiu, (The University of Hong Kong,
  Hong Kong)",A new key establishment scheme for wireless sensor networks,11Pages,"International Journal of Network Security & Its Applications 1.2
  (2009) 17-27",,,cs.CR cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Traditional key management techniques, such as public key cryptography or key
distribution center (e.g., Kerberos), are often not effective for wireless
sensor networks for the serious limitations in terms of computational power,
energy supply, network bandwidth. In order to balance the security and
efficiency, we propose a new scheme by employing LU Composition techniques for
mutual authenticated pairwise key establishment and integrating LU Matrix with
Elliptic Curve Diffie-Hellman for anonymous pathkey establishment. At the
meantime, it is able to achieve efficient group key agreement and management.
Analysis shows that the new scheme has better performance and provides
authenticity and anonymity for sensor to establish multiple kinds of keys,
compared with previous related works.
","[{'version': 'v1', 'created': 'Mon, 5 Apr 2010 08:38:27 GMT'}]",2010-07-15,"[['Wang', 'Eric Ke', ''], ['Hui', 'Lucas C. K.', ''], ['Yiu', 'S. M.', '']]","['LU matrix composition', 'Key management', 'Key establishment', 'Wireless sensor networks']"
14507,1412.5513,Engelbert Mephu Nguifo,"Cyrine Arouri, Engelbert Mephu Nguifo, Sabeur Aridhi, C\'ecile
  Roucelle, Gaelle Bonnet-Loosli, Norbert Tsopz\'e","Towards a constructive multilayer perceptron for regression task using
  non-parametric clustering. A case study of Photo-Z redshift reconstruction",,,,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The choice of architecture of artificial neuron network (ANN) is still a
challenging task that users face every time. It greatly affects the accuracy of
the built network. In fact there is no optimal method that is applicable to
various implementations at the same time. In this paper we propose a method to
construct ANN based on clustering, that resolves the problems of random and ad
hoc approaches for multilayer ANN architecture. Our method can be applied to
regression problems. Experimental results obtained with different datasets,
reveals the efficiency of our method.
","[{'version': 'v1', 'created': 'Wed, 17 Dec 2014 18:36:23 GMT'}]",2014-12-18,"[['Arouri', 'Cyrine', ''], ['Nguifo', 'Engelbert Mephu', ''], ['Aridhi', 'Sabeur', ''], ['Roucelle', 'Cécile', ''], ['Bonnet-Loosli', 'Gaelle', ''], ['Tsopzé', 'Norbert', '']]","['regression', 'ANN architecture', 'accuracy']"
14508,1610.03393,Nahum Kiryati,"Adi Perry, Dor Verbin, Nahum Kiryati",Crossing the Road Without Traffic Lights: An Android-based Safety Device,"Planned submission to ""Pattern Recognition Letters""",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the absence of pedestrian crossing lights, finding a safe moment to cross
the road is often hazardous and challenging, especially for people with visual
impairments. We present a reliable low-cost solution, an Android device
attached to a traffic sign or lighting pole near the crossing, indicating
whether it is safe to cross the road. The indication can be by sound, display,
vibration, and various communication modalities provided by the Android device.
The integral system camera is aimed at approaching traffic. Optical flow is
computed from the incoming video stream, and projected onto an influx map,
automatically acquired during a brief training period. The crossing safety is
determined based on a 1-dimensional temporal signal derived from the
projection. We implemented the complete system on a Samsung Galaxy K-Zoom
Android smartphone, and obtained real-time operation. The system achieves
promising experimental results, providing pedestrians with sufficiently early
warning of approaching vehicles. The system can serve as a stand-alone safety
device, that can be installed where pedestrian crossing lights are ruled out.
Requiring no dedicated infrastructure, it can be powered by a solar panel and
remotely maintained via the cellular network.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2016 15:33:00 GMT'}]",2016-10-12,"[['Perry', 'Adi', ''], ['Verbin', 'Dor', ''], ['Kiryati', 'Nahum', '']]","['pedestrian crossing', 'traffic analysis', 'optical flow', 'blind &visually impaired', 'resource-limited computer vision', 'Android device']"
14509,0910.1760,Laurent Tapie,"Laurent Tapie (LURPA), Kwamiwi Mawussi (LURPA), Bernard Anselmetti
  (LURPA)",Machining strategy choice: performance VIEWER,,"Advances in Integrated Design and Manufacturing in Mechanical
  Engineering II (2007) 343",,Adv-2007-343,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays high speed machining (HSM) machine tool combines productivity and
part quality. So mould and die maker invested in HSM. Die and mould features
are more and more complex shaped. Thus, it is difficult to choose the best
machining strategy according to part shape. Geometrical analysis of machining
features is not sufficient to make an optimal choice. Some research show that
security, technical, functional and economical constrains must be taken into
account to elaborate a machining strategy. During complex shape machining,
production system limits induce feed rate decreases, thus loss of productivity,
in some part areas. In this paper we propose to analyse these areas by
estimating tool path quality. First we perform experiments on HSM machine tool
to determine trajectory impact on machine tool behaviour. Then, we extract
critical criteria and establish models of performance loss. Our work is focused
on machine tool kinematical performance and numerical controller unit
calculation capacity. We implement these models on Esprit CAM Software. During
machining trajectory creation, critical part areas can be visualised and
analysed. Parameters, such as, segment or arc lengths, nature of
discontinuities encountered are used to analyse critical part areas. According
to this visualisation, process development engineer should validate or modify
the trajectory.
","[{'version': 'v1', 'created': 'Fri, 9 Oct 2009 14:36:41 GMT'}]",2009-10-12,"[['Tapie', 'Laurent', '', 'LURPA'], ['Mawussi', 'Kwamiwi', '', 'LURPA'], ['Anselmetti', 'Bernard', '', 'LURPA']]","['High Speed Machining', 'Technical knowledge', 'Performance evaluation']"
14510,1412.6153,Arjun B Krishnan,Arjun B. Krishnan and Jayaram Kollipara,Intelligent Indoor Mobile Robot Navigation Using Stereo Vision,"9 pages, SIPIJ August 2014",,,,cs.RO cs.AI cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Majority of the existing robot navigation systems, which facilitate the use
of laser range finders, sonar sensors or artificial landmarks, has the ability
to locate itself in an unknown environment and then build a map of the
corresponding environment. Stereo vision, while still being a rapidly
developing technique in the field of autonomous mobile robots, are currently
less preferable due to its high implementation cost. This paper aims at
describing an experimental approach for the building of a stereo vision system
that helps the robots to avoid obstacles and navigate through indoor
environments and at the same time remaining very much cost effective. This
paper discusses the fusion techniques of stereo vision and ultrasound sensors
which helps in the successful navigation through different types of complex
environments. The data from the sensor enables the robot to create the two
dimensional topological map of unknown environments and stereo vision systems
models the three dimension model of the same environment.
","[{'version': 'v1', 'created': 'Wed, 10 Sep 2014 20:01:45 GMT'}]",2014-12-22,"[['Krishnan', 'Arjun B.', ''], ['Kollipara', 'Jayaram', '']]","['Arduino', 'SLAM', 'Point clouds', 'Stereo vision system', 'Triangulation']"
14511,1702.06256,Guohui Lin,"Yao Xu, Yong Chen, Guohui Lin, Tian Liu, Taibo Luo and Peng Zhang",A $(1.4 + \epsilon)$-approximation algorithm for the $2$-Max-Duo problem,"14 pages, 10 figures; an extended abstract appears in Proceedings of
  the 28th International Symposium on Algorithms and Computation (ISAAC 2017).
  LIPICS 92, Article No. 66, pp. 66:1--66:12",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The maximum duo-preservation string mapping (Max-Duo) problem is the
complement of the well studied minimum common string partition (MCSP) problem,
both of which have applications in many fields including text compression and
bioinformatics. $k$-Max-Duo is the restricted version of Max-Duo, where every
letter of the alphabet occurs at most $k$ times in each of the strings, which
is readily reduced into the well known maximum independent set (MIS) problem on
a graph of maximum degree $\Delta \le 6(k-1)$. In particular, $2$-Max-Duo can
then be approximated arbitrarily close to $1.8$ using the state-of-the-art
approximation algorithm for the MIS problem. $2$-Max-Duo was proved APX-hard
and very recently a $(1.6 + \epsilon)$-approximation was claimed, for any
$\epsilon > 0$. In this paper, we present a vertex-degree reduction technique,
based on which, we show that $2$-Max-Duo can be approximated arbitrarily close
to $1.4$.
","[{'version': 'v1', 'created': 'Tue, 21 Feb 2017 04:06:15 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Sep 2017 22:04:04 GMT'}]",2017-09-07,"[['Xu', 'Yao', ''], ['Chen', 'Yong', ''], ['Lin', 'Guohui', ''], ['Liu', 'Tian', ''], ['Luo', 'Taibo', ''], ['Zhang', 'Peng', '']]","['Approximation algorithm', 'duo-preservation string mapping', 'string partition', 'independent set']"
14512,1407.4735,Lalit Kumar Saini,"Lalit Kumar Saini, Vishal Shrivastava",A Survey of Digital Watermarking Techniques and its Applications,4 Pages,IJCST V2(3): Page(70-73) May-June 2014,,,cs.MM,http://creativecommons.org/licenses/by/3.0/,"  Digital media is the need of a people now a day as the alternate of paper
media.As the technology grown up digital media required protection while
transferring through internet or others mediums.Watermarking techniques have
been developed to fulfill this requirement.This paper aims to provide a
detailed survey of all watermarking techniques specially focuses on image
watermarking types and its applications in today world.
","[{'version': 'v1', 'created': 'Thu, 17 Jul 2014 16:56:15 GMT'}]",2014-07-18,"[['Saini', 'Lalit Kumar', ''], ['Shrivastava', 'Vishal', '']]","['Watermarking', 'DWT', 'Copyright', 'PSNR']"
14513,1107.1901,Ruy de Queiroz,Ruy J.G.B. de Queiroz and Anjolina G. de Oliveira,"Propositional equality, identity types, and direct computational paths","41 pages, submitted to a scientific journal. arXiv admin note: text
  overlap with arXiv:1010.1810, arXiv:0906.4521 by other authors",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In proof theory the notion of canonical proof is rather basic, and it is
usually taken for granted that a canonical proof of a sentence must be unique
up to certain minor syntactical details (such as, e.g., change of bound
variables). When setting up a proof theory for equality one is faced with a
rather unexpected situation where there may not be a unique canonical proof of
an equality statement. Indeed, in a (1994--5) proposal for the formalisation of
proofs of propositional equality in the Curry--Howard style, we have already
uncovered such a peculiarity. Totally independently, and in a different
setting, Hofmann & Streicher (1994) have shown how to build a model of
Martin-L\""of's Type Theory in which uniqueness of canonical proofs of identity
types does not hold. The intention here is to show that, by considering as
sequences of rewrites and substitution, it comes a rather natural fact that two
(or more) distinct proofs may be yet canonical and are none to be preferred
over one another. By looking at proofs of equality as rewriting (or
computational) paths this approach will be in line with the recently proposed
connections between type theory and homotopy theory via identity types, since
elements of identity types will be, concretely, paths (or homotopies).
","[{'version': 'v1', 'created': 'Sun, 10 Jul 2011 21:28:26 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Mar 2012 13:27:15 GMT'}, {'version': 'v3', 'created': 'Mon, 5 Aug 2013 20:26:40 GMT'}]",2013-08-07,"[['de Queiroz', 'Ruy J. G. B.', ''], ['de Oliveira', 'Anjolina G.', '']]","['equality', 'identity type', 'type theory', 'homotopy theory', 'labelled deduction', 'natural deduction']"
14514,1208.3398,Guodong Shi,"Guodong Shi, Mikael Johansson and Karl Henrik Johansson",How Agreement and Disagreement Evolve over Random Dynamic Networks,,,,,cs.SI cs.MA cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The dynamics of an agreement protocol interacting with a disagreement process
over a common random network is considered. The model can represent the
spreading of true and false information over a communication network, the
propagation of faults in a large-scale control system, or the development of
trust and mistrust in a society. At each time instance and with a given
probability, a pair of network nodes are selected to interact. At random each
of the nodes then updates its state towards the state of the other node
(attraction), away from the other node (repulsion), or sticks to its current
state (neglect). Agreement convergence and disagreement divergence results are
obtained for various strengths of the updates for both symmetric and asymmetric
update rules. Impossibility theorems show that a specific level of attraction
is required for almost sure asymptotic agreement and a specific level of
repulsion is required for almost sure asymptotic disagreement. A series of
sufficient and/or necessary conditions are then established for agreement
convergence or disagreement divergence. In particular, under symmetric updates,
a critical convergence measure in the attraction and repulsion update strength
is found, in the sense that the asymptotic property of the network state
evolution transits from agreement convergence to disagreement divergence when
this measure goes from negative to positive. The result can be interpreted as a
tight bound on how much bad action needs to be injected in a dynamic network in
order to consistently steer its overall behavior away from consensus.
","[{'version': 'v1', 'created': 'Thu, 16 Aug 2012 15:22:01 GMT'}]",2012-08-17,"[['Shi', 'Guodong', ''], ['Johansson', 'Mikael', ''], ['Johansson', 'Karl Henrik', '']]","['Dynamic networks', 'Opinion dynamics', 'Gossiping', 'Social networks', 'Consensus']"
14515,1003.4029,Yakir Reshef,"Yakir Reshef, Salil Vadhan","On Extractors and Exposure-Resilient Functions for Sublogarithmic
  Entropy",,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study deterministic extractors for oblivious bit-fixing sources (a.k.a.
resilient functions) and exposure-resilient functions with small min-entropy:
of the function's n input bits, k << n bits are uniformly random and unknown to
the adversary. We simplify and improve an explicit construction of extractors
for bit-fixing sources with sublogarithmic k due to Kamp and Zuckerman (SICOMP
2006), achieving error exponentially small in k rather than polynomially small
in k. Our main result is that when k is sublogarithmic in n, the short output
length of this construction (O(log k) output bits) is optimal for extractors
computable by a large class of space-bounded streaming algorithms.
  Next, we show that a random function is an extractor for oblivious bit-fixing
sources with high probability if and only if k is superlogarithmic in n,
suggesting that our main result may apply more generally. In contrast, we show
that a random function is a static (resp. adaptive) exposure-resilient function
with high probability even if k is as small as a constant (resp. log log n). No
explicit exposure-resilient functions achieving these parameters are known.
","[{'version': 'v1', 'created': 'Sun, 21 Mar 2010 21:22:56 GMT'}, {'version': 'v2', 'created': 'Sat, 29 May 2010 12:05:04 GMT'}, {'version': 'v3', 'created': 'Sat, 11 Dec 2010 20:07:15 GMT'}]",2010-12-14,"[['Reshef', 'Yakir', ''], ['Vadhan', 'Salil', '']]","['pseudorandomness', 'exposure-resilient function', 'randomness extractor', 'bit-fixing source']"
14516,1108.1378,Anis Ismail,"Anis Ismail, Mohamed Quafafou, Nicolas Durand and Mohammad Hajjar","An Efficient Architecture for Information Retrieval in P2P Context Using
  Hypergraph","2o pages, 8 figures",,,,cs.DB cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Peer-to-peer (P2P) Data-sharing systems now generate a significant portion of
Internet traffic. P2P systems have emerged as an accepted way to share enormous
volumes of data. Needs for widely distributed information systems supporting
virtual organizations have given rise to a new category of P2P systems called
schema-based. In such systems each peer is a database management system in
itself, ex-posing its own schema. In such a setting, the main objective is the
efficient search across peer databases by processing each incoming query
without overly consuming bandwidth. The usability of these systems depends on
successful techniques to find and retrieve data; however, efficient and
effective routing of content-based queries is an emerging problem in P2P
networks. This work was attended as an attempt to motivate the use of mining
algorithms in the P2P context may improve the significantly the efficiency of
such methods. Our proposed method based respectively on combination of
clustering with hypergraphs. We use ECCLAT to build approximate clustering and
discovering meaningful clusters with slight overlapping. We use an algorithm
MTMINER to extract all minimal transversals of a hypergraph (clusters) for
query routing. The set of clusters improves the robustness in queries routing
mechanism and scalability in P2P Network. We compare the performance of our
method with the baseline one considering the queries routing problem. Our
experimental results prove that our proposed methods generate impressive levels
of performance and scalability with with respect to important criteria such as
response time, precision and recall.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2011 18:26:33 GMT'}]",2011-08-08,"[['Ismail', 'Anis', ''], ['Quafafou', 'Mohamed', ''], ['Durand', 'Nicolas', ''], ['Hajjar', 'Mohammad', '']]","['P2P Network', 'Hypergraphs', 'Ecclat', 'Mtminer', 'Query Routing']"
14517,1702.04125,Vedran Vukoti\'c,"Vedran Vukoti\'c, Silvia-Laura Pintea, Christian Raymond, Guillaume
  Gravier, Jan Van Gemert","One-Step Time-Dependent Future Video Frame Prediction with a
  Convolutional Encoder-Decoder Neural Network","11 pages, 1 figures, published in the International Conference of
  Image Analysis and Processing (ICIAP) 2017 and in the Netherlands Conference
  on Computer Vision (NCCV) 2016",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is an inherent need for autonomous cars, drones, and other robots to
have a notion of how their environment behaves and to anticipate changes in the
near future. In this work, we focus on anticipating future appearance given the
current frame of a video. Existing work focuses on either predicting the future
appearance as the next frame of a video, or predicting future motion as optical
flow or motion trajectories starting from a single video frame. This work
stretches the ability of CNNs (Convolutional Neural Networks) to predict an
anticipation of appearance at an arbitrarily given future time, not necessarily
the next video frame. We condition our predicted future appearance on a
continuous time variable that allows us to anticipate future frames at a given
temporal distance, directly from the input video frame. We show that CNNs can
learn an intrinsic representation of typical appearance changes over time and
successfully generate realistic predictions at a deliberate time difference in
the near future.
","[{'version': 'v1', 'created': 'Tue, 14 Feb 2017 09:21:23 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Jul 2017 11:11:25 GMT'}]",2017-07-25,"[['Vukotić', 'Vedran', ''], ['Pintea', 'Silvia-Laura', ''], ['Raymond', 'Christian', ''], ['Gravier', 'Guillaume', ''], ['Van Gemert', 'Jan', '']]","['action forecasting', 'future video frame prediction', 'appearance prediction', 'scene understanding', 'generative models', 'CNNs']"
14518,1010.0696,Masoud Abbaszadeh,Masoud Abbaszadeh and Horacio J. Marquez,"Robust H_infinity Filter Design for Lipschitz Nonlinear Systems via
  Multiobjective Optimization","20 pages, 5 figures",,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a new method of H_infinity observer design for Lipschitz
nonlinear systems is proposed in the form of an LMI optimization problem. The
proposed observer has guaranteed decay rate (exponential convergence) and is
robust against unknown exogenous disturbance. In addition, thanks to the
linearity of the proposed LMIs in the admissible Lipschitz constant, it can be
maximized via LMI optimization. This adds an extra important feature to the
observer, robustness against nonlinear uncertainty. Explicit bound on the
tolerable nonlinear uncertainty is derived. The new LMI formulation also allows
optimizations over the disturbance attenuation level (H_infinity cost). Then,
the admissible Lipschitz constant and the disturbance attenuation level of the
H_infinity filter are simultaneously optimized through LMI multiobjective
optimization.
","[{'version': 'v1', 'created': 'Mon, 4 Oct 2010 20:25:53 GMT'}]",2010-10-06,"[['Abbaszadeh', 'Masoud', ''], ['Marquez', 'Horacio J.', '']]","['Lipschitz nonlinear systems', 'Robust observers', 'Nonlinear H∞ filtering', 'LMIoptimization']"
14519,2007.05303,Chin-Chia Michael Yeh,"Chin-Chia Michael Yeh, Zhongfang Zhuang, Wei Zhang, Liang Wang",Multi-future Merchant Transaction Prediction,,,,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The multivariate time series generated from merchant transaction history can
provide critical insights for payment processing companies. The capability of
predicting merchants' future is crucial for fraud detection and recommendation
systems. Conventionally, this problem is formulated to predict one multivariate
time series under the multi-horizon setting. However, real-world applications
often require more than one future trend prediction considering the
uncertainties, where more than one multivariate time series needs to be
predicted. This problem is called multi-future prediction. In this work, we
combine the two research directions and propose to study this new problem:
multi-future, multi-horizon and multivariate time series prediction. This
problem is crucial as it has broad use cases in the financial industry to
reduce the risk while improving user experience by providing alternative
futures. This problem is also challenging as now we not only need to capture
the patterns and insights from the past but also train a model that has a
strong inference capability to project multiple possible outcomes. To solve
this problem, we propose a new model using convolutional neural networks and a
simple yet effective encoder-decoder structure to learn the time series pattern
from multiple perspectives. We use experiments on real-world merchant
transaction data to demonstrate the effectiveness of our proposed model. We
also provide extensive discussions on different model design choices in our
experimental section.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 11:07:32 GMT'}]",2021-09-22,"[['Yeh', 'Chin-Chia Michael', ''], ['Zhuang', 'Zhongfang', ''], ['Zhang', 'Wei', ''], ['Wang', 'Liang', '']]","['Multivariate Time Series', 'Multi-future', 'Multi-horizon']"
14520,1605.01816,Zhuo Diao,"Xujin Chen, Zhuo Diao, Xiaodong Hu and Zhongzheng Tang","Sufficient Conditions for Tuza's Conjecture on Packing and Covering
  Triangles",,,,,cs.GR math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a simple graph $G=(V,E)$, a subset of $E$ is called a triangle cover if
it intersects each triangle of $G$. Let $\nu_t(G)$ and $\tau_t(G)$ denote the
maximum number of pairwise edge-disjoint triangles in $G$ and the minimum
cardinality of a triangle cover of $G$, respectively. Tuza conjectured in 1981
that $\tau_t(G)/\nu_t(G)\le2$ holds for every graph $G$. In this paper, using a
hypergraph approach, we design polynomial-time combinatorial algorithms for
finding small triangle covers. These algorithms imply new sufficient conditions
for Tuza's conjecture on covering and packing triangles. More precisely,
suppose that the set $\mathscr T_G$ of triangles covers all edges in $G$. We
show that a triangle cover of $G$ with cardinality at most $2\nu_t(G)$ can be
found in polynomial time if one of the following conditions is satisfied: (i)
$\nu_t(G)/|\mathscr T_G|\ge\frac13$, (ii) $\nu_t(G)/|E|\ge\frac14$, (iii)
$|E|/|\mathscr T_G|\ge2$.
  Keywords: Triangle cover, Triangle packing, Linear 3-uniform hypergraphs,
Combinatorial algorithms
","[{'version': 'v1', 'created': 'Fri, 6 May 2016 04:17:12 GMT'}, {'version': 'v2', 'created': 'Wed, 11 May 2016 08:12:30 GMT'}, {'version': 'v3', 'created': 'Tue, 24 May 2016 05:44:40 GMT'}]",2016-05-25,"[['Chen', 'Xujin', ''], ['Diao', 'Zhuo', ''], ['Hu', 'Xiaodong', ''], ['Tang', 'Zhongzheng', '']]","['Triangle cover', 'Triangle packing', 'Linear 3-uniform hypergraphs', 'Combinatorial algorithms']"
14521,0803.1445,Rajesh Ramachandran,R. Rajesh and Vinod Sharma,"Distributed Joint Source-Channel Coding on a Multiple Access Channel
  with Side Information","49 pages, Technical Report, DRDO-IISc programme on Advanced Research
  in Mathematical Engineering, Dept of ECE, Indian Institute of Science,
  Bangalore, India",,,TR-PME-2008-01,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of transmission of several distributed sources over a
multiple access channel (MAC) with side information at the sources and the
decoder. Source-channel separation does not hold for this channel. Sufficient
conditions are provided for transmission of sources with a given distortion.
The source and/or the channel could have continuous alphabets (thus Gaussian
sources and Gaussian MACs are special cases). Various previous results are
obtained as special cases. We also provide several good joint source-channel
coding schemes for a discrete/continuous source and discrete/continuous
alphabet channel. Channels with feedback and fading are also considered.
  Keywords: Multiple access channel, side information, lossy joint
source-channel coding, channels with feedback, fading channels.
","[{'version': 'v1', 'created': 'Mon, 10 Mar 2008 17:39:19 GMT'}]",2008-03-11,"[['Rajesh', 'R.', ''], ['Sharma', 'Vinod', '']]","['Multiple access channel', 'side information', 'lossy joint sourcechannel coding', 'channels with feedback', 'fading channels']"
14522,1107.2090,Carlos Viegas Dam\'asio,"Alexander Sellner, Christopher Schwarz, Erwin Zinser","Semantic-ontological combination of Business Rules and Business
  Processes in IT Service Management","Proceedings of the Doctoral Consortium and Poster Session of the 5th
  International Symposium on Rules (RuleML 2011@IJCAI), pages 33-40
  (arXiv:1107.1686)",,,RuleML-DC/2011/05,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  IT Service Management deals with managing a broad range of items related to
complex system environments. As there is both, a close connection to business
interests and IT infrastructure, the application of semantic expressions which
are seamlessly integrated within applications for managing ITSM environments,
can help to improve transparency and profitability. This paper focuses on the
challenges regarding the integration of semantics and ontologies within ITSM
environments. It will describe the paradigm of relationships and inheritance
within complex service trees and will present an approach of ontologically
expressing them. Furthermore, the application of SBVR-based rules as executable
SQL triggers will be discussed. Finally, the broad range of topics for further
research, derived from the findings, will be presented.
","[{'version': 'v1', 'created': 'Mon, 11 Jul 2011 18:54:36 GMT'}]",2011-07-12,"[['Sellner', 'Alexander', ''], ['Schwarz', 'Christopher', ''], ['Zinser', 'Erwin', '']]","['Semantic IT Service Management', 'SBVR-based SQL statements', 'Ontological ITSM service trees']"
14523,1109.6550,Sumita Mishra,"Sumita Mishra, Naresh K. Chaudhary and Kalyan Singh","Simulation and Optimization of MQW based optical modulator for on chip
  optical interconnect","IJCSI International Journal of Computer Science Issues, Vol. 8, Issue
  3, May 2011 ISSN (Online): 1694-0814 http://www.IJCSI.org","International Journal of Computer Science Issues, Vol. 8, Issue 3,
  May 2011",,,cs.ET physics.ins-det,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optical interconnects are foreseen as a potential solution to improve the
performance of data transmission in high speed integrated circuits since
electrical interconnects operating at high bit rates have several limitations
which creates a bottleneck at the interconnect level. The objective of the work
is to model and then simulate the MQWM based optical interconnect transmitter.
The power output of the simulated modulator is then optimized with respect to
various parameters namely contrast ratio, insertion loss and bias current. The
methodology presented here is suitable for investigation of both analog and
digital modulation performance but it primarily deals with digital modulation.
We have not included the effect of carrier charge density in multiple quantum
well simulation.
","[{'version': 'v1', 'created': 'Thu, 29 Sep 2011 15:03:43 GMT'}]",2011-10-03,"[['Mishra', 'Sumita', ''], ['Chaudhary', 'Naresh K.', ''], ['Singh', 'Kalyan', '']]","['Optical interconnect', 'MQW', 'CR (contrast -ratio)', 'IR (insertion loss)']"
14524,1401.2529,Elif Vural,Elif Vural and Pascal Frossard,A Study of Image Analysis with Tangent Distance,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The computation of the geometric transformation between a reference and a
target image, known as registration or alignment, corresponds to the projection
of the target image onto the transformation manifold of the reference image
(the set of images generated by its geometric transformations). It, however,
often takes a nontrivial form such that the exact computation of projections on
the manifold is difficult. The tangent distance method is an effective
algorithm to solve this problem by exploiting a linear approximation of the
manifold. As theoretical studies about the tangent distance algorithm have been
largely overlooked, we present in this work a detailed performance analysis of
this useful algorithm, which can eventually help its implementation. We
consider a popular image registration setting using a multiscale pyramid of
lowpass filtered versions of the (possibly noisy) reference and target images,
which is particularly useful for recovering large transformations. We first
show that the alignment error has a nonmonotonic variation with the filter
size, due to the opposing effects of filtering on both manifold nonlinearity
and image noise. We then study the convergence of the multiscale tangent
distance method to the optimal solution. We finally examine the performance of
the tangent distance method in image classification applications. Our
theoretical findings are confirmed by experiments on image transformation
models involving translations, rotations and scalings. Our study is the first
detailed study of the tangent distance algorithm that leads to a better
understanding of its efficacy and to the proper selection of its design
parameters.
","[{'version': 'v1', 'created': 'Sat, 11 Jan 2014 13:31:14 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Jun 2014 16:10:06 GMT'}, {'version': 'v3', 'created': 'Tue, 30 Sep 2014 17:05:41 GMT'}]",2014-10-01,"[['Vural', 'Elif', ''], ['Frossard', 'Pascal', '']]","['Image registration', 'tangent distance', 'image analysis', 'hierarchical registrationmethods', 'performance analysis']"
14525,1003.0516,Marcus Hutter,Marcus Hutter and Minh-Ngoc Tran,Model Selection with the Loss Rank Principle,"31 LaTeX pages, 1 figure","Computational Statistics and Data Analysis, 54 (2010) pages
  1288-1306",,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A key issue in statistics and machine learning is to automatically select the
""right"" model complexity, e.g., the number of neighbors to be averaged over in
k nearest neighbor (kNN) regression or the polynomial degree in regression with
polynomials. We suggest a novel principle - the Loss Rank Principle (LoRP) -
for model selection in regression and classification. It is based on the loss
rank, which counts how many other (fictitious) data would be fitted better.
LoRP selects the model that has minimal loss rank. Unlike most penalized
maximum likelihood variants (AIC, BIC, MDL), LoRP depends only on the
regression functions and the loss function. It works without a stochastic noise
model, and is directly applicable to any non-parametric regressor, like kNN.
","[{'version': 'v1', 'created': 'Tue, 2 Mar 2010 08:21:07 GMT'}]",2010-10-04,"[['Hutter', 'Marcus', ''], ['Tran', 'Minh-Ngoc', '']]","['Model selection', 'loss rank principle', 'non-parametric regression', 'classification', 'general loss function', 'k nearest neighbors']"
14526,1607.00405,Ling He,"Ling He, Lee Murphy, and Jiebo Luo","Using Social Media to Promote STEM Education: Matching College Students
  with Role Models","16 pages, 8 figures, accepted by ECML/PKDD 2016, Industrial Track",,,,cs.CY cs.MM cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  STEM (Science, Technology, Engineering, and Mathematics) fields have become
increasingly central to U.S. economic competitiveness and growth. The shortage
in the STEM workforce has brought promoting STEM education upfront. The rapid
growth of social media usage provides a unique opportunity to predict users'
real-life identities and interests from online texts and photos. In this paper,
we propose an innovative approach by leveraging social media to promote STEM
education: matching Twitter college student users with diverse LinkedIn STEM
professionals using a ranking algorithm based on the similarities of their
demographics and interests. We share the belief that increasing STEM presence
in the form of introducing career role models who share similar interests and
demographics will inspire students to develop interests in STEM related fields
and emulate their models. Our evaluation on 2,000 real college students
demonstrated the accuracy of our ranking algorithm. We also design a novel
implementation that recommends matched role models to the students.
","[{'version': 'v1', 'created': 'Fri, 1 Jul 2016 20:58:11 GMT'}]",2016-07-05,"[['He', 'Ling', ''], ['Murphy', 'Lee', ''], ['Luo', 'Jiebo', '']]","['STEM', 'recommendation systems', 'social media', 'text mining']"
14527,1406.3121,Saraswati Mishra,"Saraswati Mishra, Shikha Dhankar and Kavita Choudhary",Impact of Internet Governance,"4 pages, 2 figures, Internation Journal of Computer Trends and
  Technology- IJCTT, Vol 4, Issue 10,October 2013",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper represents the overview of the influence of internet governance in
all the transactions, trading, business, social services, educational
activities, research etc. occurring through the internet. It is very essential
to implement laws and regulations in the field wherever the transaction takes
place, either in the form of money, material or services. To avoid any kind of
fraud and cheating and to establish a peaceful environment in physical as well
as virtual word, it is essential to have some organization which assures safety
and security. Here I-governance is the governing body that tries to take care
of all those requirements.
","[{'version': 'v1', 'created': 'Thu, 12 Jun 2014 05:25:17 GMT'}]",2014-06-13,"[['Mishra', 'Saraswati', ''], ['Dhankar', 'Shikha', ''], ['Choudhary', 'Kavita', '']]","['e-governance', 'I-governance', 'stakeholders']"
14528,1707.09557,Edward Smith,"Edward Smith, David Meger",Improved Adversarial Systems for 3D Object Generation and Reconstruction,"10 pages, accepted at CORL. Figures are best view in color, and
  details only appear when zoomed in",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a new approach for training generative adversarial
networks (GAN) to understand the detailed 3D shape of objects. While GANs have
been used in this domain previously, they are notoriously hard to train,
especially for the complex joint data distribution over 3D objects of many
categories and orientations. Our method extends previous work by employing the
Wasserstein distance normalized with gradient penalization as a training
objective. This enables improved generation from the joint object shape
distribution. Our system can also reconstruct 3D shape from 2D images and
perform shape completion from occluded 2.5D range scans. We achieve notable
quantitative improvements in comparison to existing baselines
","[{'version': 'v1', 'created': 'Sat, 29 Jul 2017 21:03:22 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Aug 2017 15:44:52 GMT'}, {'version': 'v3', 'created': 'Mon, 30 Oct 2017 18:49:29 GMT'}]",2017-11-01,"[['Smith', 'Edward', ''], ['Meger', 'David', '']]","['Model learning', 'Multimodal perception', 'Robotic vision']"
14529,1603.04094,Romesh Laishram,"Aribam Balarampyari Devi, Manoj Kumar and Romesh Laishram",Design and Implementation of an Improved Carry Increment Adder,"vol.7,No.1,February 2016, pp 21-27",,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A complex digital circuit comprises of adder as a basic unit. The performance
of the circuit depends on the design of this basic adder unit. The speed of
operation of a circuit is one of the important performance criteria of many
digital circuits which ultimately depends on the delay of the basic adder unit.
Many research works have been devoted in improving the delay of the adder
circuit. In this paper we have proposed an improved carry increment adder (CIA)
that improves the delay performance of the circuit. The improvement is achieved
by incorporating carry look adder (CLA) in the design of CIA contrary to the
previous design of CIA that employs ripple carry adder (RCA). A simulation
study is carried out for comparative analysis. The coding is done in Verilog
hardware description language (HDL) and the simulation is carried out in Xilinx
ISE 13.1 environment.
","[{'version': 'v1', 'created': 'Thu, 10 Mar 2016 06:32:36 GMT'}]",2016-03-22,"[['Devi', 'Aribam Balarampyari', ''], ['Kumar', 'Manoj', ''], ['Laishram', 'Romesh', '']]","['CIA', 'CLA', 'RCA', 'delay', 'Verilog HDL']"
14530,1108.0186,Yuan Hong,"Yuan Hong, Jaideep Vaidya, Haibing Lu, Mingrui Wu","Differentially Private Search Log Sanitization with Optimal Output
  Utility",12 pages,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web search logs contain extremely sensitive data, as evidenced by the recent
AOL incident. However, storing and analyzing search logs can be very useful for
many purposes (i.e. investigating human behavior). Thus, an important research
question is how to privately sanitize search logs. Several search log
anonymization techniques have been proposed with concrete privacy models.
However, in all of these solutions, the output utility of the techniques is
only evaluated rather than being maximized in any fashion. Indeed, for
effective search log anonymization, it is desirable to derive the optimal
(maximum utility) output while meeting the privacy standard. In this paper, we
propose utility-maximizing sanitization based on the rigorous privacy standard
of differential privacy, in the context of search logs. Specifically, we
utilize optimization models to maximize the output utility of the sanitization
for different applications, while ensuring that the production process
satisfies differential privacy. An added benefit is that our novel
randomization strategy ensures that the schema of the output is identical to
that of the input. A comprehensive evaluation on real search logs validates the
approach and demonstrates its robustness and scalability.
","[{'version': 'v1', 'created': 'Sun, 31 Jul 2011 15:55:48 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Aug 2011 22:12:25 GMT'}, {'version': 'v3', 'created': 'Thu, 13 Oct 2011 01:45:36 GMT'}]",2015-03-19,"[['Hong', 'Yuan', ''], ['Vaidya', 'Jaideep', ''], ['Lu', 'Haibing', ''], ['Wu', 'Mingrui', '']]","['Search Logs', 'Differential Privacy', 'Optimization']"
14531,0804.4808,Pierre Courrieu,Pierre Courrieu (LPC),Solving Time of Least Square Systems in Sigma-Pi Unit Networks,Nombre de pages: 7,"Neural Information Processing - Letters and Reviews 4, 3 (2004)
  39-45",,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The solving of least square systems is a useful operation in
neurocomputational modeling of learning, pattern matching, and pattern
recognition. In these last two cases, the solution must be obtained on-line,
thus the time required to solve a system in a plausible neural architecture is
critical. This paper presents a recurrent network of Sigma-Pi neurons, whose
solving time increases at most like the logarithm of the system size, and of
its condition number, which provides plausible computation times for biological
systems.
","[{'version': 'v1', 'created': 'Wed, 30 Apr 2008 12:23:05 GMT'}]",2008-12-18,"[['Courrieu', 'Pierre', '', 'LPC']]","['\uf02d− Least Square Systems', 'On-line Pattern Matching', 'RBFN Learning', 'Sigma-Pi Neurons', 'Recurrent Neural Network']"
14532,1710.01772,Yunfeng Zhang,"Yedendra B. Shrinivasan, Yunfeng Zhang",CELIO: An application development framework for interactive spaces,,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Developing applications for interactive space is different from developing
cross-platform applications for personal computing. Input, output, and
architectural variations in each interactive space introduce big overhead in
terms of cost and time for developing, deploying and maintaining applications
for interactive spaces. Often, these applications become on-off experience tied
to the deployed spaces. To alleviate this problem and enable rapid responsive
space design applications similar to responsive web design, we present CELIO
application development framework for interactive spaces. The framework is
micro services based and neatly decouples application and design specifications
from hardware and architecture specifications of an interactive space. In this
paper, we describe this framework and its implementation details. Also, we
briefly discuss the use cases developed using this framework.
","[{'version': 'v1', 'created': 'Wed, 4 Oct 2017 19:19:39 GMT'}]",2017-10-06,"[['Shrinivasan', 'Yedendra B.', ''], ['Zhang', 'Yunfeng', '']]","['Large displays', 'Interactive Spaces', 'Public displays', 'Intelligent room']"
14533,0903.2158,Eberhard H.-A. Gerbracht,Eberhard H.-A. Gerbracht,Supernodal Analysis Revisited,"V1: documentclass IEEEtran, 5 pages, 6 figures. Re-release of the
  printed version, with some minor typographical errors corrected, abstract
  rewritten, and short CV according to IEEE standards added","SMACD'04 Proceedings of the International Workshop on Symbolic
  Methods and Applications in Circuit Design, Wroclaw, Poland, 23-24 September
  2004; pp. 113-116",,,cs.SC cs.CE cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we show how to extend the known algorithm of nodal analysis in
such a way that, in the case of circuits without nullors and controlled sources
(but allowing for both, independent current and voltage sources), the system of
nodal equations describing the circuit is partitioned into one part, where the
nodal variables are explicitly given as linear combinations of the voltage
sources and the voltages of certain reference nodes, and another, which
contains the node variables of these reference nodes only and which moreover
can be read off directly from the given circuit. Neither do we need
preparational graph transformations, nor do we need to introduce additional
current variables (as in MNA). Thus this algorithm is more accessible to
students, and consequently more suitable for classroom presentations.
","[{'version': 'v1', 'created': 'Thu, 12 Mar 2009 12:25:45 GMT'}]",2009-03-13,"[['Gerbracht', 'Eberhard H. -A.', '']]","['analog circuits', '(super-)nodal analysis', 'contracted graph', 'paths', 'algorithm']"
14534,1205.6399,Davis Arosemena MSc,Davis Arosemena-Trejos and Sergio Crespo and Clifton Clunie,Forming Teams for Teaching Programming based on Static Code Analysis,"9 pages, 5 equations, 5 figures; IJCSI International Journal of
  Computer Science Issues, Vol. 9, Issue 2, No 3, March 2012. ISSN (Online):
  1694-0814",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of team for teaching programming can be effective in the classroom
because it helps students to generate and acquire new knowledge in less time,
but these groups to be formed without taking into account some respects, may
cause an adverse effect on the teaching-learning process. This paper proposes a
tool for the formation of team based on the semantics of source code (SOFORG).
This semantics is based on metrics extracted from the preferences, styles and
good programming practices. All this is achieved through a static analysis of
code that each student develops. In this way, you will have a record of
students with the information extracted; it evaluates the best formation of
teams in a given course. The team's formations are based on programming styles,
skills, pair programming or with leader.
","[{'version': 'v1', 'created': 'Tue, 29 May 2012 15:45:58 GMT'}]",2012-05-30,"[['Arosemena-Trejos', 'Davis', ''], ['Crespo', 'Sergio', ''], ['Clunie', 'Clifton', '']]","['Work team', 'Teaching programming', 'Programming styles', 'Static Code analyzer', 'Ontology']"
14535,1304.4472,Amr Mohamed,Lamia Romdhani and Amr Mohamed,"An analytic study of a distributed EDCA-based QoS mapping for layered
  video delivery in WLAN","in proceedings of the PEMWN 2012, Tunisia",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the key challenges in multimedia networks is video delivery over
wireless channels. MRC (Multi-Resolution Coding) Layered video, divides video
into a base layer and multiple enhancement layers. In this paper, we aim to
improve video quality, impacted by high channel contention, through mapping
individual video layers to EDCA (Enhanced Distributed Channel Access) access
categories in order to maximize the average number of reconstructed video
layers. We propose an adaptive cross layer video layers mapping technique that
optimally enhances the QoS of wireless video transmission over IEEE 802.11e
EDCA priority queues. The optimization is based on a dynamic program that takes
into account the EDCA parameters and the layered dependency nature of layered
video delivery. Our proposed technique makes use of a channel delay estimation
model and an estimation of average video useful layers delivered. The optimal
mapping strategies are selected by an optimization module based on the
information from the analytical model. The accuracy of our optimized mapping
technique performance is verified through extensive simulations. The obtained
results illustrate significant trade-off between complexity and delivered video
quality for canonical mapping schemes.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2013 14:42:33 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Apr 2013 03:08:14 GMT'}]",2013-04-30,"[['Romdhani', 'Lamia', ''], ['Mohamed', 'Amr', '']]","['EDCA', 'Layered video', 'mapping strategy', 'analyticalmodel']"
14536,1105.1406,Juwita Utami Putri,"I Wayan Simri Wicaksana (1), Bambang Wahyudi (1) ((1) Gunadarma
  University)","Comparison Latent Semantic and WordNet Approach for Semantic Similarity
  Calculation","Keywords: latent semantic, interoperability, WordNet",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information exchange among many sources in Internet is more autonomous,
dynamic and free. The situation drive difference view of concepts among
sources. For example, word 'bank' has meaning as economic institution for
economy domain, but for ecology domain it will be defined as slope of river or
lake. In this aper, we will evaluate latent semantic and WordNet approach to
calculate semantic similarity. The evaluation will be run for some concepts
from different domain with reference by expert or human. Result of the
evaluation can provide a contribution for mapping of concept, query rewriting,
interoperability, etc.
","[{'version': 'v1', 'created': 'Sat, 7 May 2011 01:28:09 GMT'}]",2011-05-10,"[['Wicaksana', 'I Wayan Simri', ''], ['Wahyudi', 'Bambang', '']]","['latent semantic', 'interoperability', 'WordNet']"
14537,1107.5538,Jaydip Sen,Jaydip Sen,"An Anonymous Authentication and Communication Protocol for Wireless Mesh
  Networks","13 pages, 6 figures. First International Conference on Advances in
  Computing and Communication (ACC 2011), Kochi, India, July 22 - 24, 2011",,,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless mesh networks (WMNs) have emerged as a key technology for next
generation wireless broadband networks showing rapid progress and inspiring
numerous compelling applications. A WMN comprises of a set of mesh routers
(MRs) and mesh clients (MCs), where MRs are connected to the Internet backbone
through the Internet gateways (IGWs). The MCs are wireless devices and
communicate among themselves over possibly multi-hop paths with or without the
involvement of MRs. User privacy and security have been primary concerns in
WMNs due to their peer-to-peer network topology, shared wireless medium,
stringent resource constraints, and highly dynamic environment. Moreover, to
support real-time applications, WMNs must also be equipped with robust,
reliable and efficient communication protocols so as to minimize the end-to-end
latency and packet drops. Design of a secure and efficient communication
protocol for WMNs, therefore, is of paramount importance. In this paper, we
propose a security and privacy protocol that provides security and user
anonymity while maintaining communication efficiency in a WMN. The security
protocol ensures secure authentication and encryption in access and the
backbone networks. The user anonymity, authentication and data privacy is
achieved by application of a protocol that is based on Rivest's ring signature
scheme. Simulation results demonstrate that while the protocols have minimal
storage and communication overhead, they are robust and provide high level of
security and privacy to the users of the network services.
","[{'version': 'v1', 'created': 'Wed, 27 Jul 2011 17:01:28 GMT'}]",2011-07-28,"[['Sen', 'Jaydip', '']]","['Wireless mesh network (WMN)', 'user anonymity', 'security', 'authentication', 'key management', 'Rivest ring signature scheme', 'privacy']"
14538,1307.2953,Atta ur Rehman Khan,"Atta ur Rehman Khan, Mazliza Othman, Abdul Nasir Khan, Imran Ali khan",Framework for Ubiquitous Social Networks,"2012 1st International Conference on Future Trends in Computing and
  Communication Technologies",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel framework for ubiquitous social networks (USNs).
Instead of making virtual connections, on the basis of human social networks,
an effort has been made to facilitate interactions among human social networks
with the help of virtual social networks. The imperative domains that support
ubiquitous social networks are highlighted and different scenarios are provided
to project real world applications of proposed framework. Our proposed
framework can provide preliminary foundations for creating ubiquitous social
networks in true essence.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2013 00:34:19 GMT'}]",2013-07-12,"[['Khan', 'Atta ur Rehman', ''], ['Othman', 'Mazliza', ''], ['Khan', 'Abdul Nasir', ''], ['khan', 'Imran Ali', '']]","['Ubiquitous computing', 'ubiquitous social network', 'ubiquitous wearable computers', 'social networks', 'wearable computers', 'mobile ubiquitous computing']"
14539,0802.1471,Ronald de Wolf,Ronald de Wolf (CWI Amsterdam),Error-Correcting Data Structures,"15 pages LaTeX; an abridged version will appear in the Proceedings of
  the STACS 2009 conference",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study data structures in the presence of adversarial noise. We want to
encode a given object in a succinct data structure that enables us to
efficiently answer specific queries about the object, even if the data
structure has been corrupted by a constant fraction of errors. This new model
is the common generalization of (static) data structures and locally decodable
error-correcting codes. The main issue is the tradeoff between the space used
by the data structure and the time (number of probes) needed to answer a query
about the encoded object. We prove a number of upper and lower bounds on
various natural error-correcting data structure problems. In particular, we
show that the optimal length of error-correcting data structures for the
Membership problem (where we want to store subsets of size s from a universe of
size n) is closely related to the optimal length of locally decodable codes for
s-bit strings.
","[{'version': 'v1', 'created': 'Mon, 11 Feb 2008 16:35:49 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Dec 2008 14:25:48 GMT'}]",2008-12-01,"[['de Wolf', 'Ronald', '', 'CWI Amsterdam']]","['data structures', 'fault-tolerance', 'error-correcting codes', 'locally decodable codes', 'membership problem', 'length-queries tradeoff']"
14540,1105.2491,Riccardo Satta,"Riccardo Satta, Giorgio Fumera, Fabio Roli, Marco Cristani and
  Vittorio Murino",A Multiple Component Matching Framework for Person Re-Identification,"Accepted paper, 16th Int. Conf. on Image Analysis and Processing
  (ICIAP 2011), Ravenna, Italy, 14/09/2011",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Person re-identification consists in recognizing an individual that has
already been observed over a network of cameras. It is a novel and challenging
research topic in computer vision, for which no reference framework exists yet.
Despite this, previous works share similar representations of human body based
on part decomposition and the implicit concept of multiple instances. Building
on these similarities, we propose a Multiple Component Matching (MCM) framework
for the person re-identification problem, which is inspired by Multiple
Component Learning, a framework recently proposed for object detection. We show
that previous techniques for person re-identification can be considered
particular implementations of our MCM framework. We then present a novel person
re-identification technique as a direct, simple implementation of our
framework, focused in particular on robustness to varying lighting conditions,
and show that it can attain state of the art performances.
","[{'version': 'v1', 'created': 'Thu, 12 May 2011 14:46:01 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Jun 2011 10:54:55 GMT'}]",2011-06-24,"[['Satta', 'Riccardo', ''], ['Fumera', 'Giorgio', ''], ['Roli', 'Fabio', ''], ['Cristani', 'Marco', ''], ['Murino', 'Vittorio', '']]","['person re-identification', 'multiple instance learning', 'framework']"
14541,1203.2044,Haboub Rachid,Rachid Haboub and Mohammed Ouzzif,Secure and reliable routing in mobile adhoc networks,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The growing diffusion of wireless-enabled portable devices and the recent
advances in Mobile Ad-hoc NETworks (MANETs) open new scenarios where users can
benefit from anywhere and at any time for impromptu collaboration. However,
energy constrained nodes, low channel bandwidth, node mobility, high channel
error rates, channel variability and packet loss are some of the limitations of
MANETs. MANETs presents also security challenges. These networks are prone to
malicious users attack, because any device within the frequency range can get
access to the MANET. There is a need for security mechanisms aware of these
challenges. Thus, this work aims to provide a secure MANET by changing the
frequency of data transmission. This security approach was tested, and the
results shows an interesting decreased of throughput from malicious node when
the number of frequency used is increased, that way the MANET will not waste
it's resources treating malicious packets. The other contribution of this work
is a mobility aware routing approach, which aims to provide a more reliable
routing by handling effectively the nodes mobility.
","[{'version': 'v1', 'created': 'Fri, 9 Mar 2012 11:20:03 GMT'}]",2012-03-12,"[['Haboub', 'Rachid', ''], ['Ouzzif', 'Mohammed', '']]","['Security', 'Reliability', 'Mobile Ad-hoc Networks (MANETs)', 'Routing protocols']"
14542,1506.02061,Vasile Patrascu,Vasile Patrascu,Entropy and Syntropy in the Context of Five-Valued Logics,9 pages. Submitted to journal,,,,cs.AI,http://creativecommons.org/licenses/by/3.0/,"  This paper presents a five-valued representation of bifuzzy sets. This
representation is related to a five-valued logic that uses the following
values: true, false, inconsistent, incomplete and ambiguous. In the framework
of five-valued representation, formulae for similarity, entropy and syntropy of
bifuzzy sets are constructed.
","[{'version': 'v1', 'created': 'Thu, 26 Feb 2015 09:36:49 GMT'}]",2015-06-09,"[['Patrascu', 'Vasile', '']]","['Five-valued logics', 'inconsistency', 'incompleteness', 'ambiguity', 'fuzzy sets', 'intuitionistic fuzzy sets', 'bifuzzy sets']"
14543,1410.3564,Bahman Kalantari,Bahman Kalantari,Randomized Triangle Algorithms for Convex Hull Membership,"8 pages, 3 figures",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present randomized versions of the {\it triangle algorithm} introduced in
\cite{kal14}. The triangle algorithm tests membership of a distinguished point
$p \in \mathbb{R} ^m$ in the convex hull of a given set $S$ of $n$ points in
$\mathbb{R}^m$. Given any {\it iterate} $p' \in conv(S)$, it searches for a
{\it pivot}, a point $v \in S$ so that $d(p',v) \geq d(p,v)$. It replaces $p'$
with the point on the line segment $p'v$ closest to $p$ and repeats this
process. If a pivot does not exist, $p'$ certifies that $p \not \in conv(S)$.
Here we propose two random variations of the triangle algorithm that allow
relaxed steps so as to take more effective steps possible in subsequent
iterations. One is inspired by the {\it chaos game} known to result in the
Sierpinski triangle. The incentive is that randomized iterates together with a
property of Sierpinski triangle would result in effective pivots. Bounds on
their expected complexity coincides with those of the deterministic version
derived in \cite{kal14}.
","[{'version': 'v1', 'created': 'Tue, 14 Oct 2014 03:54:09 GMT'}]",2014-10-15,"[['Kalantari', 'Bahman', '']]","['Convex Hull', 'Linear Programming', 'Approximation Algorithms', 'Randomized Algorithms', 'Triangle Algorithm', 'Chaos Game', 'Sierpinski Triangle']"
14544,1109.6740,Anacleto Correia,"Anacleto Correia, Fernando Brito e Abreu, Vasco Amaral",SLALOM: a Language for SLA specification and monitoring,"12 pages, 5 figures","Universidade de Coimbra, actas da confer\^encia INFORUM'2011, ISBN
  978-989-96001-5-7 pp. 556-567, 8-9 Setembro 2011",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  IT services provisioning is usually underpinned by service level agreements
(SLAs), aimed at guaranteeing services quality. However, there is a gap between
the customer perspective (business oriented) and that of the service provider
(implementation oriented) that becomes more evident while defining and
monitoring SLAs. This paper proposes a domain specific language (SLA Language
for specificatiOn and Monitoring - SLALOM) to bridge the previous gap. The
first step in SLALOM creation was factoring out common concepts, by composing
the BPMN metamodel with that of the SLA life cycle, as described in ITIL. The
derived metamodel expresses the SLALOM abstract syntax model. The second step
was to write concrete syntaxes targeting different aims, such as SLA
representation in process models. An example of SLALOM's concrete syntax model
instantiation for an IT service sup-ported by self-service financial terminals
is presented.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2011 08:09:02 GMT'}]",2011-10-03,"[['Correia', 'Anacleto', ''], ['Abreu', 'Fernando Brito e', ''], ['Amaral', 'Vasco', '']]","['domain specific languages', 'DSL', 'metamodel', 'service level agreements', 'ITIL', 'IT service management']"
14545,1510.07787,Kazuki Yoshizoe,Kazuki Yoshizoe and Aika Terada and Koji Tsuda,Redesigning pattern mining algorithms for supercomputers,,,,,cs.DC cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Upcoming many core processors are expected to employ a distributed memory
architecture similar to currently available supercomputers, but parallel
pattern mining algorithms amenable to the architecture are not comprehensively
studied. We present a novel closed pattern mining algorithm with a
well-engineered communication protocol, and generalize it to find statistically
significant patterns from personal genome data. For distributing communication
evenly, it employs global load balancing with multiple stacks distributed on a
set of cores organized as a hypercube with random edges. Our algorithm achieved
up to 1175-fold speedup by using 1200 cores for solving a problem with 11,914
items and 697 transactions, while the naive approach of separating the search
space failed completely.
","[{'version': 'v1', 'created': 'Tue, 27 Oct 2015 06:59:14 GMT'}]",2015-10-28,"[['Yoshizoe', 'Kazuki', ''], ['Terada', 'Aika', ''], ['Tsuda', 'Koji', '']]","['Frequent itemset mining', 'Distributedmemory parallelization', 'Statistical significance', 'Multiple testing procedure']"
14546,1107.1663,Shahid Latif,"Shahid Latif, Rahat Ullah, Hamid Jan",A Step towards an Easy Interconversion of Various Number Systems,5 pages,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Any system that is used for naming or representing numbers is a number
system, also known as numeral system. The modern civilization is familiar with
decimal number system using ten digits. However digital devices and computers
use binary number system instead of decimal number system, using only two
digits namely, 0 and 1 based on the fundamental concept of the decimal number
system. Various other number systems also used this fundamental concept of
decimal number system, for example octal system and hexadecimal number systems
using eight and sixteen digits respectively. The knowledge of number systems
and their inter conversion is essential for understanding of computers. More
over, successful programming for digital devices requires a precise
understanding of data formats, number systems and their inter conversion. The
inter conversion (a process in which things are each converted into the other)
of number system requires allot of time and techniques to expertise. In this
paper the interconversion of four most common number systems is taken under the
consideration in tabulated form. It is a step towards the easy interconversion
of theses number systems to understand as well as memorise it. The four number
systems are binary, octal, decimal and hexadecimal.
","[{'version': 'v1', 'created': 'Fri, 8 Jul 2011 15:59:35 GMT'}]",2011-07-11,"[['Latif', 'Shahid', ''], ['Ullah', 'Rahat', ''], ['Jan', 'Hamid', '']]","['Digital', 'Binary', 'octal', 'hexadecimal', 'bases or radix', 'inter conversion']"
14547,1310.0768,Matteo Mio,Matteo Mio,Upper-Expectation Bisimilarity and Real-valued Modal Logics,Preprint,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several notions of bisimulation relations for probabilistic non-deterministic
transition systems have been considered in the literature. We consider a novel
testing-based behavioral equivalence called upper-expectation bisimilarity and
develop its theory using standard results from linear algebra and functional
analysis. We show that, for a wide class of systems, our new notion coincides
with Segala's convex bisimilarity. We develop logical characterizations in
terms of expressive probabilistic modal mu-calculi and a novel real-valued
modal logic. We prove that upper-expectation bisimilarity is a congruence for
the wide family of process algebras specified following the probabilistic GSOS
rule format.
","[{'version': 'v1', 'created': 'Wed, 2 Oct 2013 17:03:08 GMT'}]",2013-10-03,"[['Mio', 'Matteo', '']]","['Quantitative Modal Logics', 'Bisimulation', 'Convexity']"
14548,0909.2626,Laurent Romary,"Susanne Salmon-Alt (INRIA Lorraine - LORIA), Laurent Romary (INRIA
  Lorraine - LORIA)",Reference Resolution within the Framework of Cognitive Grammar,Colloque avec actes et comit\'e de lecture. internationale,"International Colloqium on Cognitive Science, San Sebastian :
  Spain (2001)",,A01-R-057 || salmon-alt01a,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Following the principles of Cognitive Grammar, we concentrate on a model for
reference resolution that attempts to overcome the difficulties previous
approaches, based on the fundamental assumption that all reference (independent
on the type of the referring expression) is accomplished via access to and
restructuring of domains of reference rather than by direct linkage to the
entities themselves. The model accounts for entities not explicitly mentioned
but understood in a discourse, and enables exploitation of discursive and
perceptual context to limit the set of potential referents for a given
referring expression. As the most important feature, we note that a single
mechanism is required to handle what are typically treated as diverse
phenomena. Our approach, then, provides a fresh perspective on the relations
between Cognitive Grammar and the problem of reference.
","[{'version': 'v1', 'created': 'Mon, 14 Sep 2009 19:10:59 GMT'}]",2009-09-15,"[['Salmon-Alt', 'Susanne', '', 'INRIA Lorraine - LORIA'], ['Romary', 'Laurent', '', 'INRIA\n  Lorraine - LORIA']]","['reference', 'cognitive grammar', 'context model', 'noun phrase semantics']"
14549,1105.3425,Sanjeev Khanna,Sanjeev Khanna and Madhu Sudan,Delays and the Capacity of Continuous-time Channels,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Any physical channel of communication offers two potential reasons why its
capacity (the number of bits it can transmit in a unit of time) might be
unbounded: (1) Infinitely many choices of signal strength at any given instant
of time, and (2) Infinitely many instances of time at which signals may be
sent. However channel noise cancels out the potential unboundedness of the
first aspect, leaving typical channels with only a finite capacity per instant
of time. The latter source of infinity seems less studied. A potential source
of unreliability that might restrict the capacity also from the second aspect
is delay: Signals transmitted by the sender at a given point of time may not be
received with a predictable delay at the receiving end. Here we examine this
source of uncertainty by considering a simple discrete model of delay errors.
In our model the communicating parties get to subdivide time as microscopically
finely as they wish, but still have to cope with communication delays that are
macroscopic and variable. The continuous process becomes the limit of our
process as the time subdivision becomes infinitesimal. We taxonomize this class
of communication channels based on whether the delays and noise are stochastic
or adversarial; and based on how much information each aspect has about the
other when introducing its errors. We analyze the limits of such channels and
reach somewhat surprising conclusions: The capacity of a physical channel is
finitely bounded only if at least one of the two sources of error (signal noise
or delay noise) is adversarial. In particular the capacity is finitely bounded
only if the delay is adversarial, or the noise is adversarial and acts with
knowledge of the stochastic delay. If both error sources are stochastic, or if
the noise is adversarial and independent of the stochastic delay, then the
capacity of the associated physical channel is infinite.
","[{'version': 'v1', 'created': 'Tue, 17 May 2011 16:18:14 GMT'}]",2011-05-18,"[['Khanna', 'Sanjeev', ''], ['Sudan', 'Madhu', '']]","['Communication', 'Physical Channels', 'Adversarial errors']"
14550,1402.3447,Ioannis Caragiannis,Ioannis Caragiannis and Alexandros A. Voudouris,Welfare guarantees for proportional allocations,15 pages,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  According to the proportional allocation mechanism from the network
optimization literature, users compete for a divisible resource -- such as
bandwidth -- by submitting bids. The mechanism allocates to each user a
fraction of the resource that is proportional to her bid and collects an amount
equal to her bid as payment. Since users act as utility-maximizers, this
naturally defines a proportional allocation game. Recently, Syrgkanis and
Tardos (STOC 2013) quantified the inefficiency of equilibria in this game with
respect to the social welfare and presented a lower bound of 26.8% on the price
of anarchy over coarse-correlated and Bayes-Nash equilibria in the full and
incomplete information settings, respectively. In this paper, we improve this
bound to 50% over both equilibrium concepts. Our analysis is simpler and,
furthermore, we argue that it cannot be improved by arguments that do not take
the equilibrium structure into account. We also extend it to settings with
budget constraints where we show the first constant bound (between 36% and 50%)
on the price of anarchy of the corresponding game with respect to an effective
welfare benchmark that takes budgets into account.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2014 12:21:14 GMT'}]",2014-02-17,"[['Caragiannis', 'Ioannis', ''], ['Voudouris', 'Alexandros A.', '']]","['algorithmic game theory', 'price of anarchy', 'Bayes-Nash equilibrium', 'proportional allocation mechanism']"
14551,1010.4786,Luca Vigan\`o,Matteo Cristani and Erisa Karafili and Luca Vigan\`o,Blocking Underhand Attacks by Hidden Coalitions (Extended Version),"13 pages, short version in Proceedings of ICAART 2011",,,,cs.CR cs.LO cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Similar to what happens between humans in the real world, in open multi-agent
systems distributed over the Internet, such as online social networks or wiki
technologies, agents often form coalitions by agreeing to act as a whole in
order to achieve certain common goals. However, agent coalitions are not always
a desirable feature of a system, as malicious or corrupt agents may collaborate
in order to subvert or attack the system. In this paper, we consider the
problem of hidden coalitions, whose existence and the purposes they aim to
achieve are not known to the system, and which carry out so-called underhand
attacks. We give a first approach to hidden coalitions by introducing a
deterministic method that blocks the actions of potentially dangerous agents,
i.e. possibly belonging to such coalitions. We also give a non-deterministic
version of this method that blocks the smallest set of potentially dangerous
agents. We calculate the computational cost of our two blocking methods, and
prove their soundness and completeness.
","[{'version': 'v1', 'created': 'Fri, 22 Oct 2010 19:37:21 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Oct 2010 12:55:08 GMT'}]",2010-10-27,"[['Cristani', 'Matteo', ''], ['Karafili', 'Erisa', ''], ['Viganò', 'Luca', '']]","['Multi-agent systems', 'coalitions', 'security', 'blocking attacks']"
14552,1502.04132,Zhenzhong Lan,"Zhenzhong Lan, Xuanchong Li, Ming Lin, Alexander G. Hauptmann",Long-short Term Motion Feature for Action Classification and Retrieval,arXiv admin note: text overlap with arXiv:1411.6660,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a method for representing motion information for video
classification and retrieval. We improve upon local descriptor based methods
that have been among the most popular and successful models for representing
videos. The desired local descriptors need to satisfy two requirements: 1) to
be representative, 2) to be discriminative. Therefore, they need to occur
frequently enough in the videos and to be be able to tell the difference among
different types of motions. To generate such local descriptors, the video
blocks they are based on must contain just the right amount of motion
information. However, current state-of-the-art local descriptor methods use
video blocks with a single fixed size, which is insufficient for covering
actions with varying speeds. In this paper, we introduce a long-short term
motion feature that generates descriptors from video blocks with multiple
lengths, thus covering motions with large speed variance. Experimental results
show that, albeit simple, our model achieves state-of-the-arts results on
several benchmark datasets.
","[{'version': 'v1', 'created': 'Fri, 13 Feb 2015 21:15:57 GMT'}]",2015-02-17,"[['Lan', 'Zhenzhong', ''], ['Li', 'Xuanchong', ''], ['Lin', 'Ming', ''], ['Hauptmann', 'Alexander G.', '']]","['Content-based video retrieval', 'visual feature', 'dense trajectory']"
14553,1206.0184,Ali Jarrahi,Ali Jarrahi and Mohammad Reza Kangavari,An Architecture for Context-Aware Knowledge Flow Management Systems,"12 pages; IJCSI International Journal of Computer Science Issues,
  Vol. 9, Issue 2, No 3, March 2012",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The organizational knowledge is one of the most important and valuable assets
of organizations. In such environment, organizations with broad, specialized
and up-to-date knowledge, adequately using knowledge resources, will be more
successful than their competitors. For effective use of knowledge, dynamic
knowledge flow from the sources to destinations is essential. In this regard, a
novel complex concept in knowledge management is the analysis, design and
implementation of knowledge flow management systems. One of the major
challenges in such systems is to explore the knowledge flow from the source to
the recipient and control the flow for quality improvements concerning the
users' needs as possible. Therefore, the purpose of this paper is to provide an
architecture in order to solve this challenge. For this purpose, in addition to
the architecture for knowledge flow management systems, a new node selection
strategy is provided with higher success rate compared to previous strategies.
","[{'version': 'v1', 'created': 'Fri, 1 Jun 2012 13:49:44 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Jun 2012 08:05:18 GMT'}]",2012-06-18,"[['Jarrahi', 'Ali', ''], ['Kangavari', 'Mohammad Reza', '']]","['Knowledge Management', 'knowledge flow management system', 'knowledge sharing', 'knowledge quality improvement']"
14554,1705.09700,Rad Niazadeh,"S\'ebastien Bubeck, Nikhil R. Devanur, Zhiyi Huang, Rad Niazadeh",Multi-scale Online Learning and its Applications to Online Auctions,"Preliminary conference version In the Proc. of 18th ACM conference on
  Economics and Computation (EC 2017)",,,,cs.GT cs.DS cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider revenue maximization in online auction/pricing problems. A seller
sells an identical item in each period to a new buyer, or a new set of buyers.
For the online posted pricing problem, we show regret bounds that scale with
the best fixed price, rather than the range of the values. We also show regret
bounds that are almost scale free, and match the offline sample complexity,
when comparing to a benchmark that requires a lower bound on the market share.
These results are obtained by generalizing the classical learning from experts
and multi-armed bandit problems to their multi-scale versions. In this version,
the reward of each action is in a different range, and the regret w.r.t. a
given action scales with its own range, rather than the maximum range.
","[{'version': 'v1', 'created': 'Fri, 26 May 2017 19:59:50 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Sep 2018 18:59:34 GMT'}]",2018-09-13,"[['Bubeck', 'Sébastien', ''], ['Devanur', 'Nikhil R.', ''], ['Huang', 'Zhiyi', ''], ['Niazadeh', 'Rad', '']]","['online learning', 'multi-scale learning', 'auction theory', 'bandit information', 'sample complexity†']"
14555,0909.0173,Robert Shour,Robert Shour,A theory of intelligence: networked problem solving in animal societies,83 pages; v 2-8 correct proofreading errors,,,,cs.AI nlin.AO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A society's single emergent, increasing intelligence arises partly from the
thermodynamic advantages of networking the innate intelligence of different
individuals, and partly from the accumulation of solved problems. Economic
growth is proportional to the square of the network entropy of a society's
population times the network entropy of the number of the society's solved
problems.
","[{'version': 'v1', 'created': 'Tue, 1 Sep 2009 14:52:50 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Sep 2009 20:19:13 GMT'}, {'version': 'v3', 'created': 'Wed, 9 Sep 2009 20:42:05 GMT'}, {'version': 'v4', 'created': 'Mon, 14 Sep 2009 17:25:26 GMT'}, {'version': 'v5', 'created': 'Mon, 5 Oct 2009 15:25:22 GMT'}, {'version': 'v6', 'created': 'Wed, 4 May 2011 18:05:36 GMT'}, {'version': 'v7', 'created': 'Fri, 3 Jun 2011 17:26:28 GMT'}, {'version': 'v8', 'created': 'Tue, 11 Sep 2012 21:19:14 GMT'}]",2012-09-13,"[['Shour', 'Robert', '']]","['Economic growth', 'entropy', 'intelligence', 'language', 'networks', 'problem solving', 'society', 'thermodynamics']"
14556,1501.04822,Francesco Pasquale,"Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale
  and Gustavo Posta",Self-Stabilizing Repeated Balls-into-Bins,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the following synchronous process that we call ""repeated
balls-into-bins"". The process is started by assigning $n$ balls to $n$ bins in
an arbitrary way. In every subsequent round, from each non-empty bin one ball
is chosen according to some fixed strategy (random, FIFO, etc), and re-assigned
to one of the $n$ bins uniformly at random.
  We define a configuration ""legitimate"" if its maximum load is
$\mathcal{O}(\log n)$. We prove that, starting from any configuration, the
process will converge to a legitimate configuration in linear time and then it
will only take on legitimate configurations over a period of length bounded by
any polynomial in $n$, with high probability (w.h.p.). This implies that the
process is self-stabilizing and that every ball traverses all bins in
$\mathcal{O}(n \log^2 n)$ rounds, w.h.p.
","[{'version': 'v1', 'created': 'Tue, 20 Jan 2015 14:33:59 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Jan 2015 02:05:34 GMT'}, {'version': 'v3', 'created': 'Tue, 24 May 2016 12:53:47 GMT'}]",2016-05-25,"[['Becchetti', 'Luca', ''], ['Clementi', 'Andrea', ''], ['Natale', 'Emanuele', ''], ['Pasquale', 'Francesco', ''], ['Posta', 'Gustavo', '']]","['Balls into Bins', 'Self-Stabilizing Systems', 'Markov Chains', 'Parallel Resource Assignment']"
14557,1710.01260,Aydin Ayanzadeh,"Safar Irandoust-Pakchin, Aydin Ayanzadeh, Siamak Beikzadeh",Gaussian Three-Dimensional kernel SVM for Edge Detection Applications,8 pages,,,COMCONF01_732,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel and uniform algorithm for edge detection based on
SVM (support vector machine) with Three-dimensional Gaussian radial basis
function with kernel. Because of disadvantages in traditional edge detection
such as inaccurate edge location, rough edge and careless on detect soft edge.
The experimental results indicate how the SVM can detect edge in efficient way.
The performance of the proposed algorithm is compared with existing methods,
including Sobel and canny detectors. The results show that this method is
better than classical algorithm such as canny and Sobel detector.
","[{'version': 'v1', 'created': 'Sat, 30 Sep 2017 18:50:10 GMT'}]",2017-10-10,"[['Irandoust-Pakchin', 'Safar', ''], ['Ayanzadeh', 'Aydin', ''], ['Beikzadeh', 'Siamak', '']]","['SVM', 'edge detection', 'Gaussian Kernel', 'pixel', 'image processing']"
14558,1511.04661,Hao Wang,"Hao Wang, Vijay R. Bommireddipalli, Ayman Hanafy, Mohamed Bahgat, Sara
  Noeman and Ossama S. Emam",A System for Extracting Sentiment from Large-Scale Arabic Social Data,,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media data in Arabic language is becoming more and more abundant. It
is a consensus that valuable information lies in social media data. Mining this
data and making the process easier are gaining momentum in the industries. This
paper describes an enterprise system we developed for extracting sentiment from
large volumes of social data in Arabic dialects. First, we give an overview of
the Big Data system for information extraction from multilingual social data
from a variety of sources. Then, we focus on the Arabic sentiment analysis
capability that was built on top of the system including normalizing written
Arabic dialects, building sentiment lexicons, sentiment classification, and
performance evaluation. Lastly, we demonstrate the value of enriching sentiment
results with user profiles in understanding sentiments of a specific user
group.
","[{'version': 'v1', 'created': 'Sun, 15 Nov 2015 05:53:13 GMT'}]",2015-11-17,"[['Wang', 'Hao', ''], ['Bommireddipalli', 'Vijay R.', ''], ['Hanafy', 'Ayman', ''], ['Bahgat', 'Mohamed', ''], ['Noeman', 'Sara', ''], ['Emam', 'Ossama S.', '']]","['Arabic', 'Sentiment Analysis', 'Social Data', 'Big Data']"
14559,1412.4353,Aridj Mohamed,Aridj Mohamed,LH*TH: New fast Scalable Distributed Data Structures (SDDS),,"International Journal of Computer Science Issues,(IJCSI) Volume
  11, Issue 6, No 2, pp 123-128 November 2014",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Proposed in 1993 the Scalable Distributed Data Structures (SDDSs) became a
profile of basis for the data management on Multi computer. In this paper we
propose an organization of a LH* bucket based on the trie hashing in order to
improve times of different access request.
","[{'version': 'v1', 'created': 'Sun, 14 Dec 2014 13:01:39 GMT'}]",2014-12-16,"[['Mohamed', 'Aridj', '']]","['Distributed hashing', 'SDDS', 'multi computers', 'distributed system', 'access method']"
14560,1604.07378,Tiantian Liu,"Tiantian Liu, Sofien Bouaziz, Ladislav Kavan",Towards Real-time Simulation of Hyperelastic Materials,,,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new method for real-time physics-based simulation supporting
many different types of hyperelastic materials. Previous methods such as
Position Based or Projective Dynamics are fast, but support only limited
selection of materials; even classical materials such as the Neo-Hookean
elasticity are not supported. Recently, Xu et al. [2015] introduced new
""spline-based materials"" which can be easily controlled by artists to achieve
desired animation effects. Simulation of these types of materials currently
relies on Newton's method, which is slow, even with only one iteration per
timestep. In this paper, we show that Projective Dynamics can be interpreted as
a quasi-Newton method. This insight enables very efficient simulation of a
large class of hyperelastic materials, including the Neo-Hookean, spline-based
materials, and others. The quasi-Newton interpretation also allows us to
leverage ideas from numerical optimization. In particular, we show that our
solver can be further accelerated using L-BFGS updates (Limited-memory
Broyden-Fletcher-Goldfarb-Shanno algorithm). Our final method is typically more
than 10 times faster than one iteration of Newton's method without compromising
quality. In fact, our result is often more accurate than the result obtained
with one iteration of Newton's method. Our method is also easier to implement,
implying reduced software development costs.
","[{'version': 'v1', 'created': 'Mon, 25 Apr 2016 19:42:37 GMT'}]",2016-04-26,"[['Liu', 'Tiantian', ''], ['Bouaziz', 'Sofien', ''], ['Kavan', 'Ladislav', '']]","['Physics-based animation', 'material models', 'numericaloptimization']"
14561,1710.03403,Djoko Suprijanto -,Irwansyah and Djoko Suprijanto,Structure of linear codes over the ring $B_k$,"18 pages, accepted for publication (Journal of Applied Mathematics
  and Computing)",,,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the structure of linear codes over the ring $B_k$ which is defined
by $\mathbb{F}_{p^r}[v_1,v_2,\ldots,v_k]/\langle v_i^2=v_i,~v_iv_j=v_jv_i
\rangle_{i,j=1}^k.$ In order to study the codes, we begin with studying the
structure of the ring $B_k$ via a Gray map which also induces a relation
between codes over $B_k$ and codes over $\mathbb{F}_{p^r}.$ We consider
Euclidean and Hermitian self-dual codes, MacWilliams relations, as well as
Singleton-type bounds for these codes. Further, we characterize cyclic and
quasi-cyclic codes using their images under the Gray map, and give the
generators for these type of codes.
","[{'version': 'v1', 'created': 'Tue, 10 Oct 2017 05:14:24 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Jan 2018 10:17:52 GMT'}]",2018-01-18,"[['Irwansyah', '', ''], ['Suprijanto', 'Djoko', '']]","['Euclidean self-dual', 'Hermitian self-dual', 'MacWilliams relation', 'Cycliccode', 'Quasi-cyclic code']"
14562,1406.3567,Siamak Sarmady,"Siamak Sarmady, Fazilah Haron and Abdullah Zawawi Talib","Simulation of Pedestrian Movements Using Fine Grid Cellular Automata
  Model",,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crowd simulation is used for evacuation and crowd safety inspections, study
of performance in crowd systems and animations. Cellular automata has been
extensively used in modelling the crowd. In regular cellular automata models,
each pedestrian occupies a single cell with the size of a pedestrian body.
Since the space is divided into relatively large cells, the movements of
pedestrians look like the movements of pieces on a chess board. Furthermore,
all pedestrians have the same body size and speed. In this paper, a method
called fine grid cellular automata is proposed in which smaller cells are used
and pedestrian body may occupy several cells. The model allows the use of
different body sizes, shapes and speeds for pedestrian.
  The proposed model is used for simulating movements of pedestrians toward a
target. A typical walkway scenario is used to test and evaluate the model. The
movements of pedestrians are smoother because of the finer grain discretization
of movements and the simulation results match empirical speed-density graphs
with good accuracy.
","[{'version': 'v1', 'created': 'Fri, 13 Jun 2014 15:25:32 GMT'}]",2014-06-16,"[['Sarmady', 'Siamak', ''], ['Haron', 'Fazilah', ''], ['Talib', 'Abdullah Zawawi', '']]","['Crowd Simulation', 'Pedestrian Movements', 'Cellular Automata', 'Fine Grid', 'Least Effort', 'Microscopic Model']"
14563,1401.1632,Eduardo Vega-Fuentes,"E. Vega-Fuentes, S. Leon-del Rosario, J.M. Cerezo-Sanchez, A.
  Vega-Martinez","Fuzzy Inference System for VOLT/VAR control in distribution substations
  in isolated power systems",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a fuzzy inference system for voltage/reactive power
control in distribution substations. The purpose is go forward to automation
distribution and its implementation in isolated power systems where control
capabilities are limited and it is common using the same applications as in
continental power systems. This means that lot of functionalities do not apply
and computational burden generates high response times. A fuzzy controller,
with logic guidelines embedded based upon heuristic rules resulting from
operators at dispatch control center past experience, has been designed.
Working as an on-line tool, it has been tested under real conditions and it has
managed the operation during a whole day in a distribution substation. Within
the limits of control capabilities of the system, the controller maintained
successfully an acceptable voltage profile, power factor values over 0,98 and
it has ostensibly improved the performance given by an optimal power flow based
automation system.
","[{'version': 'v1', 'created': 'Wed, 8 Jan 2014 09:39:38 GMT'}]",2014-01-09,"[['Vega-Fuentes', 'E.', ''], ['Rosario', 'S. Leon-del', ''], ['Cerezo-Sanchez', 'J. M.', ''], ['Vega-Martinez', 'A.', '']]","['Distribution Automation', 'Fuzzy Inference Systems', 'Isolated Power Systems', 'Reactive Power Control', 'Voltage Control']"
14564,0907.0678,R Doomun,"Piyush Kumar Shukla, Dr. S. Silakari, Dr. Sarita Singh Bhadoria","Design and Analysis of an Attack Resilient and Adaptive Medium access
  Control Protocol for Computer Networks","10 pages, International Journal of Computer Science and Information
  Security","IJCSIS May 2009 Issue, Vol. 1, No. 1",,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The challenge of designing an efficient Medium Access Control (MAC) protocol
and analyzing it has been an important research topic for over 30 years. This
paper focuses on the performance analysis (through simulation) and modification
of a well known MAC protocol CSMA/CD. The existing protocol does not consider
the wastage of bandwidth due to unutilized periods of the channel. By
considering this fact, performance of MAC protocol can be enhanced. The purpose
of this work is to modify the existing protocol by enabling it to adapt
according to state of the network. The modified protocol takes appropriate
action whenever unutilized periods detected. In this way, to increase the
effective bandwidth utilization and determine how it behaves under increasing
load, and varying packet sizes. It will also include effects of attacks i.e.
Denial of service attacks, Replay Attack, Continuous Channel Access or
Exhaustion attack, Flooding attack, Jamming (Radio interference) attack,
Selective forwarding attack which degrade performance of MAC protocol. In
Continuous Channel Access or Exhaustion attack, a malicious node disrupts the
MAC protocol, by continuously requesting or transmitting over the channel. This
eventually leads a starvation for other nodes in the network w.r.t channel
access. remedy may be the network ignores excessive requests without sending
expensive radio transmissions. This limit however cannot drop below the
expected maximum data rate the network has to support. This limit is usually
coded into the protocol during the design phase and requires additional logic
also. Repeated application of these exhaustion or collision based MAC layer
attacks can lead into unfairness.
","[{'version': 'v1', 'created': 'Fri, 3 Jul 2009 17:11:28 GMT'}]",2009-07-06,"[['Shukla', 'Piyush Kumar', ''], ['Silakari', 'Dr. S.', ''], ['Bhadoria', 'Dr. Sarita Singh', '']]","['Attack', 'Wireless Sensor Network', 'ZMAC', 'S-MAC', 'MAC', 'Collision', 'BEB']"
14565,1705.05595,Peng Sun,"Peng Sun, Yonggang Wen, Ta Nguyen Binh Duong, Xiaokui Xiao",GraphH: High Performance Big Graph Analytics in Small Clusters,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is common for real-world applications to analyze big graphs using
distributed graph processing systems. Popular in-memory systems require an
enormous amount of resources to handle big graphs. While several out-of-core
approaches have been proposed for processing big graphs on disk, the high disk
I/O overhead could significantly reduce performance. In this paper, we propose
GraphH to enable high-performance big graph analytics in small clusters.
Specifically, we design a two-stage graph partition scheme to evenly divide the
input graph into partitions, and propose a GAB (Gather-Apply-Broadcast)
computation model to make each worker process a partition in memory at a time.
We use an edge cache mechanism to reduce the disk I/O overhead, and design a
hybrid strategy to improve the communication performance. GraphH can
efficiently process big graphs in small clusters or even a single commodity
server. Extensive evaluations have shown that GraphH could be up to 7.8x faster
compared to popular in-memory systems, such as Pregel+ and PowerGraph when
processing generic graphs, and more than 100x faster than recently proposed
out-of-core systems, such as GraphD and Chaos when processing big graphs.
","[{'version': 'v1', 'created': 'Tue, 16 May 2017 08:50:36 GMT'}, {'version': 'v2', 'created': 'Wed, 17 May 2017 12:02:54 GMT'}, {'version': 'v3', 'created': 'Thu, 25 May 2017 03:09:13 GMT'}, {'version': 'v4', 'created': 'Fri, 28 Jul 2017 13:27:57 GMT'}, {'version': 'v5', 'created': 'Mon, 7 Aug 2017 08:27:59 GMT'}]",2017-08-08,"[['Sun', 'Peng', ''], ['Wen', 'Yonggang', ''], ['Duong', 'Ta Nguyen Binh', ''], ['Xiao', 'Xiaokui', '']]","['Graph Processing', 'Distributed Computing System', 'Network']"
14566,1305.6402,Minh Hoang-Tuan Nguyen,"Minh Hoang-Tuan Nguyen, Kok Kiong Tan",From Parametric Model-based Optimization to robust PID Gain Scheduling,"7 pages, 5 figures, submitted to JPC",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In chemical process applications, model predictive control effectively deals
with input and state constraints during transient operations. However,
industrial PID controllers directly manipulates the actuators, so they play the
key role in small perturbation robustness. This paper considers the problem of
augmenting the commonplace PID with the constraint handling and optimization
functionalities of MPC. First, we review the MPC framework, which employs a
linear feedback gain in its unconstrained region. This linear gain can be any
preexisting multiloop PID design, or based on the two stabilizing PI or PID
designs for multivariable systems proposed in the paper. The resulting
controller is a feedforward PID mapping, a straightforward form without the
need of tuning PID to fit an optimal input. The parametrized solution of MPC
under constraints further leverages a familiar PID gain scheduling structure.
Steady state robustness is achieved along with the PID design so that
additional robustness analysis is avoided.
","[{'version': 'v1', 'created': 'Tue, 28 May 2013 08:20:30 GMT'}]",2013-05-29,"[['Nguyen', 'Minh Hoang-Tuan', ''], ['Tan', 'Kok Kiong', '']]","['Robust tracking', 'constrained linear systems', 'model predictive control', 'PID gain scheduling']"
14567,0710.1976,Yukitaka Ishimoto,Yukitaka Ishimoto,Solving Infinite Kolam in Knot Theory,"13 pages, 2 figures, the final version for FORMA with typo fixed",Forma 22 (2007) 15-30,,OIQP-06-15,cs.DM cond-mat.stat-mech,,"  In south India, there are traditional patterns of line-drawings encircling
dots, called ``Kolam'', among which one-line drawings or the ``infinite Kolam''
provide very interesting questions in mathematics. For example, we address the
following simple question: how many patterns of infinite Kolam can we draw for
a given grid pattern of dots? The simplest way is to draw possible patterns of
Kolam while judging if it is infinite Kolam. Such a search problem seems to be
NP complete. However, it is certainly not. In this paper, we focus on
diamond-shaped grid patterns of dots, (1-3-5-3-1) and (1-3-5-7-5-3-1) in
particular. By using the knot-theory description of the infinite Kolam, we show
how to find the solution, which inevitably gives a sketch of the proof for the
statement ``infinite Kolam is not NP complete.'' Its further discussion will be
given in the final section.
","[{'version': 'v1', 'created': 'Wed, 10 Oct 2007 11:46:53 GMT'}]",2012-02-23,"[['Ishimoto', 'Yukitaka', '']]","['Kolam', 'knot theory', 'Morse link presentation', 'Temperley-Lieb algebra']"
14568,1412.6793,Vadlamudi China Venkaiah Dr.,"V. Ch. Venkaiah, K. Ramanjaneyulu, Neelima Jampala, J. Rajendra Prasad",Equivalence of lower bounds on the number of perfect pairs,8 pages,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let c(F) be the number of perfect pairs of F and c(G) be the maximum of c(F)
over all (near-) one-factorizations F of G. Wagner showed that for odd n,
c(K_{n}) \geq n*phi(n)/2 and for m and n which are odd and co-prime to each
other, c(K_{mn}) \geq 2*c(K_{m})*c(K_{n}). In this note, we establish that both
these results are equivalent in the sense that they both give rise to the same
lower bound.
","[{'version': 'v1', 'created': 'Sun, 21 Dec 2014 14:54:46 GMT'}]",2014-12-23,"[['Venkaiah', 'V. Ch.', ''], ['Ramanjaneyulu', 'K.', ''], ['Jampala', 'Neelima', ''], ['Prasad', 'J. Rajendra', '']]","['complete graph', 'equivalence of lower bounds', 'near-one-factorization', 'near-one-factor of a productgraph', 'number of perfect pairs']"
14569,1004.2280,Robert Burger PhD,John Robert Burger,XOR at a Single Vertex -- Artificial Dendrites,Edited for clarity; added Kandel reference,,,,cs.NE q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  New to neuroscience with implications for AI, the exclusive OR, or any other
Boolean gate may be biologically accomplished within a single region where
active dendrites merge. This is demonstrated below using dynamic circuit
analysis. Medical knowledge aside, this observation points to the possibility
of specially coated conductors to accomplish artificial dendrites.
","[{'version': 'v1', 'created': 'Tue, 13 Apr 2010 22:12:22 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Sep 2010 16:27:39 GMT'}]",2010-09-24,"[['Burger', 'John Robert', '']]","['Action Potentials', 'Dendrites', 'Logic']"
14570,1410.3089,Mustapha Najmeddine,Asmae Drhima and Mustapha Najmeddine,"Duality for Modules and Applications to Decoding Linear Codes over
  Finite Commutative Rings",preprint,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using linear functional-based duality of modules, we generalize the syndrome
decoding algorithm of linear codes over finite fields to those over finite
commutative rings. Moreover, If the ring is local the algorithm is simplified
by introducing the control matrix.
","[{'version': 'v1', 'created': 'Sun, 12 Oct 2014 13:49:34 GMT'}]",2014-10-14,"[['Drhima', 'Asmae', ''], ['Najmeddine', 'Mustapha', '']]","['Control matrix', 'Dual code', 'Finite ring', 'Linear code', 'Syndrome decoding']"
14571,0906.3083,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",Instruction sequence notations with probabilistic instructions,"15 pages, revised because arxiv:1409.6873v1 [cs.LO] has come out",,,PRG0906,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper concerns instruction sequences that contain probabilistic
instructions, i.e. instructions that are themselves probabilistic by nature. We
propose several kinds of probabilistic instructions, provide an informal
operational meaning for each of them, and discuss related work. On purpose, we
refrain from providing an ad hoc formal meaning for the proposed kinds of
instructions. We also discuss the approach of projection semantics, which was
introduced in earlier work on instruction sequences, in the light of
probabilistic instruction sequences.
","[{'version': 'v1', 'created': 'Wed, 17 Jun 2009 07:03:17 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Oct 2014 14:26:01 GMT'}]",2014-10-02,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['instruction sequence', 'probabilistic instruction', 'projection semantics']"
14572,1604.08779,Reino Niskanen,"Reino Niskanen, Igor Potapov, Julien Reichert",Undecidability of Two-dimensional Robot Games,,,,,cs.GT cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robot game is a two-player vector addition game played on the integer lattice
$\mathbb{Z}^n$. Both players have sets of vectors and in each turn the vector
chosen by a player is added to the current configuration vector of the game.
One of the players, called Eve, tries to play the game from the initial
configuration to the origin while the other player, Adam, tries to avoid the
origin. The problem is to decide whether or not Eve has a winning strategy. In
this paper we prove undecidability of the robot game in dimension two answering
the question formulated by Doyen and Rabinovich in 2011 and closing the gap
between undecidable and decidable cases.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2016 11:34:38 GMT'}]",2016-05-02,"[['Niskanen', 'Reino', ''], ['Potapov', 'Igor', ''], ['Reichert', 'Julien', '']]","['reachability games', 'vector addition game', 'decidability', 'winning strategy']"
14573,1510.07545,Tobias Schnabel,"Tobias Schnabel, Paul N. Bennett, Susan T. Dumais and Thorsten
  Joachims","Using Shortlists to Support Decision Making and Improve Recommender
  System Performance",11 pages in WWW 2016,,,,cs.HC cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study shortlists as an interface component for recommender
systems with the dual goal of supporting the user's decision process, as well
as improving implicit feedback elicitation for increased recommendation
quality. A shortlist is a temporary list of candidates that the user is
currently considering, e.g., a list of a few movies the user is currently
considering for viewing. From a cognitive perspective, shortlists serve as
digital short-term memory where users can off-load the items under
consideration -- thereby decreasing their cognitive load. From a machine
learning perspective, adding items to the shortlist generates a new implicit
feedback signal as a by-product of exploration and decision making which can
improve recommendation quality. Shortlisting therefore provides additional data
for training recommendation systems without the increases in cognitive load
that requesting explicit feedback would incur.
  We perform an user study with a movie recommendation setup to compare
interfaces that offer shortlist support with those that do not. From the user
studies we conclude: (i) users make better decisions with a shortlist; (ii)
users prefer an interface with shortlist support; and (iii) the additional
implicit feedback from sessions with a shortlist improves the quality of
recommendations by nearly a factor of two.
","[{'version': 'v1', 'created': 'Mon, 26 Oct 2015 16:49:07 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Feb 2016 12:16:23 GMT'}]",2016-02-09,"[['Schnabel', 'Tobias', ''], ['Bennett', 'Paul N.', ''], ['Dumais', 'Susan T.', ''], ['Joachims', 'Thorsten', '']]","['digital memory', 'interfaces', 'decision making', 'exploration', 'userengagement', 'implicit feedback']"
14574,0908.0100,Florentin Smarandache,"Florentin Smarandache, Mark Alford",A Class of DSm Conditional Rules,9 pages. SUbmitted to COGIS 2009 International Conference in PAris,"Proceedings of COGIS 2009 International Conference, Paris, France,
  16-18 November 2009. Also, presented at this conference",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we introduce two new DSm fusion conditioning rules with
example, and as a generalization of them a class of DSm fusion conditioning
rules, and then extend them to a class of DSm conditioning rules.
","[{'version': 'v1', 'created': 'Sat, 1 Aug 2009 22:40:37 GMT'}]",2009-11-23,"[['Smarandache', 'Florentin', ''], ['Alford', 'Mark', '']]","['conditional fusion rules', 'Dempster’s conditioning rule', 'Dezert-Smarandache Theory', 'DSm conditioning rules']"
14575,1710.04129,Niki Gitinabard,"Niki Gitinabard, Collin F. Lynch, Sarah Heckman, Tiffany Barnes",Identifying Student Communities in Blended Courses,,"Proceedings of the 10th International Conference on Educational
  Data Mining (p. 378-379). 2017. Wuhan, China",,,cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Blended courses have become the norm in post-secondary education.
Universities use large-scale learning management systems to manage class
content. Instructors deliver readings, lectures, and office hours online;
students use intelligent tutors, web forums, and online submission systems; and
classes communicate via web forums. These online tools allow students to form
new social networks or bring social relationships online. They also allow us to
collect data on students' social relationships. In this paper we report on our
research on community formation in blended courses based on online forum
interactions. We found that it was possible to group students into communities
using standard community detection algorithms via their posts and reply
structure and that the students' grades are significantly correlated with their
closest peers.
","[{'version': 'v1', 'created': 'Fri, 29 Sep 2017 02:28:31 GMT'}]",2017-10-12,"[['Gitinabard', 'Niki', ''], ['Lynch', 'Collin F.', ''], ['Heckman', 'Sarah', ''], ['Barnes', 'Tiffany', '']]","['Educational Data Mining', 'Graph data mining', 'Social Networks', 'Blended Courses']"
14576,1304.0494,Kaarthik Sundar,Kaarthik Sundar and Sivakumar Rathinam,"Algorithms for Routing an Unmanned Aerial Vehicle in the presence of
  Refueling Depots","9 pages, 9 figures",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a single Unmanned Aerial Vehicle (UAV) routing problem where
there are multiple depots and the vehicle is allowed to refuel at any depot.
The objective of the problem is to find a path for the UAV such that each
target is visited at least once by the vehicle, the fuel constraint is never
violated along the path for the UAV, and the total fuel required by the UAV is
a minimum. We develop an approximation algorithm for the problem, and propose
fast construction and improvement heuristics to solve the same. Computational
results show that solutions whose costs are on an average within 1.4% of the
optimum can be obtained relatively fast for the problem involving 5 depots and
25 targets.
","[{'version': 'v1', 'created': 'Mon, 1 Apr 2013 23:04:27 GMT'}]",2013-04-03,"[['Sundar', 'Kaarthik', ''], ['Rathinam', 'Sivakumar', '']]","['Traveling Salesman Problem', 'Unmanned Aerial Vehicle', 'Fuel Constraints', 'Heuristics']"
14577,1606.03713,Kai Li,"Kai Li, Chau Yuen, Salil S. Kanhere, Kun Hu, Wei Zhang, Fan Jiang,
  Xiang Liu",SenseFlow: An Experimental Study for Tracking People,"25 pages, 12 figures",,,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The main challenges in large-scale people tracking are the recognition of
people density in a specific area and tracking the people flow path. To address
these challenges, we present SenseFlow, a lightweight people tracking system.
SenseFlow utilises off-the-shelf devices which sniff probe requests
periodically polled by user's smartphones in a passive manner. We demonstrate
the feasibility of SenseFlow by building a proof-of-concept prototype and
undertaking extensive evaluations in real-world settings. We deploy the system
in one laboratory to study office hours of researchers, a crowded public area
in city to evaluate the scalability and performance ""in the wild"", and four
classrooms in the university to monitor the number of students. We also
evaluate SenseFlow with varying walking speeds and different models of
smartphones to investigate the people flow tracking performance.
","[{'version': 'v1', 'created': 'Sun, 12 Jun 2016 14:01:02 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Jun 2016 02:49:50 GMT'}, {'version': 'v3', 'created': 'Thu, 16 Jun 2016 02:13:22 GMT'}, {'version': 'v4', 'created': 'Fri, 17 Jun 2016 06:42:31 GMT'}]",2016-06-20,"[['Li', 'Kai', ''], ['Yuen', 'Chau', ''], ['Kanhere', 'Salil S.', ''], ['Hu', 'Kun', ''], ['Zhang', 'Wei', ''], ['Jiang', 'Fan', ''], ['Liu', 'Xiang', '']]","['Tracking people', 'Probe request', 'Mobile device', 'Experiments']"
14578,1402.0200,David Coyle Dr,"Alison Burrows, Rachel Gooberman-Hill, Ian Craddock and David Coyle",SPHERE: Meaningful and Inclusive Sensor-Based Home Healthcare,"Presented at the ACM CSCW 2014 workshop on Designing with Users for
  Domestic environments: Methods, Challenges, Lessons Learned",,,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given current demographic and health trends, and their economic implications,
home healthcare technology has become a fertile area for research and
development. Motivated by the need for a radical reform of healthcare
provision, SPHERE is a large-scale Interdisciplinary Research Collaboration
that aims to develop home sensor systems to monitor people's health and
wellbeing in the home. This paper outlines the unique circumstances of
designing healthcare technology for the home environment, with a particular
focus on how to ensure future systems are meaningful to and desirable for the
intended users.
","[{'version': 'v1', 'created': 'Sun, 2 Feb 2014 15:15:30 GMT'}]",2014-02-04,"[['Burrows', 'Alison', ''], ['Gooberman-Hill', 'Rachel', ''], ['Craddock', 'Ian', ''], ['Coyle', 'David', '']]","['Home healthcare', 'inclusive design', 'sensing technology']"
14579,1209.4978,Yanfang Liu,Yanfang Liu and William Zhu,Covering matroid,15 pages,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a new type of matroids, namely covering matroids,
and investigate the connections with the second type of covering-based rough
sets and some existing special matroids. Firstly, as an extension of
partitions, coverings are more natural combinatorial objects and can sometimes
be more efficient to deal with problems in the real world. Through extending
partitions to coverings, we propose a new type of matroids called covering
matroids and prove them to be an extension of partition matroids. Secondly,
since some researchers have successfully applied partition matroids to
classical rough sets, we study the relationships between covering matroids and
covering-based rough sets which are an extension of classical rough sets.
Thirdly, in matroid theory, there are many special matroids, such as
transversal matroids, partition matroids, 2-circuit matroid and
partition-circuit matroids. The relationships among several special matroids
and covering matroids are studied.
","[{'version': 'v1', 'created': 'Sat, 22 Sep 2012 09:34:10 GMT'}, {'version': 'v2', 'created': 'Fri, 30 Nov 2012 02:42:55 GMT'}]",2012-12-03,"[['Liu', 'Yanfang', ''], ['Zhu', 'William', '']]","['covering-based rough set', 'covering matroid', 'partition matroid', 'transversal matroid', 'k-rank matroid']"
14580,1306.4479,Talel Bessaoudi,"Bessaoudi Talel, Ben Hmida Fay\c{c}al","Robust State and fault Estimation of Linear Discrete Time Systems with
  Unknown Disturbances","6 pages, 3 figures, CIET'13 conference",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new robust fault and state estimation based on
recursive least square filter for linear stochastic systems with unknown
disturbances. The novel elements of the algorithm are : a simple, easily
implementable, square root method which is shown to solve the numerical
problems affecting the unknown input filter algorithm and related information
filter and smoothing algorithms; an iterative framework, where information and
covariance filters and smoothing are sequentially run in order to estimate the
state and fault. This method provides a direct estimate of the state and fault
in a single block with a simple formulation. A numerical example is given in
order to illustrate the performance of the proposed filter.
","[{'version': 'v1', 'created': 'Wed, 19 Jun 2013 10:25:58 GMT'}]",2013-06-20,"[['Talel', 'Bessaoudi', ''], ['Fayçal', 'Ben Hmida', '']]","['Kalman filtering', 'unbiased minimum-variance', 'stateand fault estimation', 'unknown disturbance', 'square root', 'lineardiscret-time systems']"
14581,0806.4021,Agus Budiyono PhD,"Agus Budiyono, H.Y Sutarto","Linear Parameter Varying Model Identification for Control of
  Rotorcraft-based UAV","6 pages, 6 figures; Fifth Indonesia-Taiwan Workshop on Aeronautical
  Science, Technology and Industry, Tainan, Taiwan, November 13-16, 2006",,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A rotorcraft-based unmanned aerial vehicle exhibits more complex properties
compared to its full-size counterparts due to its increased sensitivity to
control inputs and disturbances and higher bandwidth of its dynamics. As an
aerial vehicle with vertical take-off and landing capability, the helicopter
specifically poses a difficult problem of transition between forward flight and
unstable hover and vice versa. The LPV control technique explicitly takes into
account the change in performance due to the real-time parameter variations.
The technique therefore theoretically guarantees the performance and robustness
over the entire operating envelope. In this study, we investigate a new
approach implementing model identification for use in the LPV control
framework. The identification scheme employs recursive least square technique
implemented on the LPV system represented by dynamics of helicopter during a
transition. The airspeed as the scheduling of parameter trajectory is not
assumed to vary slowly. The exclusion of slow parameter change requirement
allows for the application of the algorithm for aggressive maneuvering
capability without the need of expensive computation. The technique is tested
numerically and will be validated in the autonomous flight of a small scale
helicopter.
","[{'version': 'v1', 'created': 'Wed, 25 Jun 2008 04:09:29 GMT'}]",2008-06-26,"[['Budiyono', 'Agus', ''], ['Sutarto', 'H. Y', '']]","['time varying system', 'model identification', 'LFT', 'LPV', 'autonomous aerial vehicles']"
14582,0802.1244,Shuheng Zhou,Shuheng Zhou,Learning Balanced Mixtures of Discrete Distributions with Small Sample,"24 Pages, 5 figures",,,,cs.LG stat.ML,,"  We study the problem of partitioning a small sample of $n$ individuals from a
mixture of $k$ product distributions over a Boolean cube $\{0, 1\}^K$ according
to their distributions. Each distribution is described by a vector of allele
frequencies in $\R^K$. Given two distributions, we use $\gamma$ to denote the
average $\ell_2^2$ distance in frequencies across $K$ dimensions, which
measures the statistical divergence between them. We study the case assuming
that bits are independently distributed across $K$ dimensions. This work
demonstrates that, for a balanced input instance for $k = 2$, a certain
graph-based optimization function returns the correct partition with high
probability, where a weighted graph $G$ is formed over $n$ individuals, whose
pairwise hamming distances between their corresponding bit vectors define the
edge weights, so long as $K = \Omega(\ln n/\gamma)$ and $Kn = \tilde\Omega(\ln
n/\gamma^2)$. The function computes a maximum-weight balanced cut of $G$, where
the weight of a cut is the sum of the weights across all edges in the cut. This
result demonstrates a nice property in the high-dimensional feature space: one
can trade off the number of features that are required with the size of the
sample to accomplish certain tasks like clustering.
","[{'version': 'v1', 'created': 'Sun, 10 Feb 2008 07:38:49 GMT'}]",2008-02-21,"[['Zhou', 'Shuheng', '']]","['Mixture of Discrete Distributions', 'Graph-based Clustering', 'Max-Cut']"
14583,1702.07514,Salah Attiya,"Hesham Arafat Ali, Salah Attiya, Ibrahim El-henawy","Medical Image Retrieval Based On the Parallelization of the Cluster
  Sampling Algorithm",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we develop parallel cluster sampling algorithms and show that a
multi-chain version is embarrassingly parallel and can be used efficiently for
medical image retrieval among other applications.
","[{'version': 'v1', 'created': 'Fri, 24 Feb 2017 09:44:41 GMT'}]",2017-02-27,"[['Ali', 'Hesham Arafat', ''], ['Attiya', 'Salah', ''], ['El-henawy', 'Ibrahim', '']]","['Parallel programming', 'Medical image reconstruction', 'Inverse problems', 'Bayes’ theorem', 'Markov chain Monte-Carlo', 'Hamiltonian Monte-Carlo']"
14584,1802.06516,Mengying Sun,"Mengying Sun, Inci M. Baytas, Liang Zhan, Zhangyang Wang, Jiayu Zhou","Subspace Network: Deep Multi-Task Censored Regression for Modeling
  Neurodegenerative Diseases",,,,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the past decade a wide spectrum of machine learning models have been
developed to model the neurodegenerative diseases, associating biomarkers,
especially non-intrusive neuroimaging markers, with key clinical scores
measuring the cognitive status of patients. Multi-task learning (MTL) has been
commonly utilized by these studies to address high dimensionality and small
cohort size challenges. However, most existing MTL approaches are based on
linear models and suffer from two major limitations: 1) they cannot explicitly
consider upper/lower bounds in these clinical scores; 2) they lack the
capability to capture complicated non-linear interactions among the variables.
In this paper, we propose Subspace Network, an efficient deep modeling approach
for non-linear multi-task censored regression. Each layer of the subspace
network performs a multi-task censored regression to improve upon the
predictions from the last layer via sketching a low-dimensional subspace to
perform knowledge transfer among learning tasks. Under mild assumptions, for
each layer the parametric subspace can be recovered using only one pass of
training data. Empirical results demonstrate that the proposed subspace network
quickly picks up the correct parameter subspaces, and outperforms
state-of-the-arts in predicting neurodegenerative clinical scores using
information in brain imaging.
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 04:50:14 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Mar 2018 04:34:15 GMT'}]",2018-03-02,"[['Sun', 'Mengying', ''], ['Baytas', 'Inci M.', ''], ['Zhan', 'Liang', ''], ['Wang', 'Zhangyang', ''], ['Zhou', 'Jiayu', '']]","['Censoring', 'Subspace', 'Multi-task Learning', 'Deep Network']"
14585,1304.5199,Frederic Magniez,M.C. Gaudel and R. Lassaigne and F. Magniez and M. de Rougemont,Some approximations in Model Checking and Testing,,,,,cs.LO cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Model checking and testing are two areas with a similar goal: to verify that
a system satisfies a property. They start with different hypothesis on the
systems and develop many techniques with different notions of approximation,
when an exact verification may be computationally too hard. We present some
notions of approximation with their logic and statistics backgrounds, which
yield several techniques for model checking and testing: Bounded Model
Checking, Approximate Model Checking, Approximate Black-Box Checking,
Approximate Model-based Testing and Approximate Probabilistic Model Checking.
All these methods guarantee some quality and efficiency of the verification.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2013 13:20:16 GMT'}]",2013-04-19,"[['Gaudel', 'M. C.', ''], ['Lassaigne', 'R.', ''], ['Magniez', 'F.', ''], ['de Rougemont', 'M.', '']]","['Approximation', 'verification', 'model checking', 'testing']"
14586,1702.05459,Mustafa Abduljabbar,"Mustafa Abduljabbar, George Markomanolis, Huda Ibeid, Rio Yokota,
  David Keyes","Communication Reducing Algorithms for Distributed Hierarchical N-Body
  Problems with Boundary Distributions",arXiv admin note: text overlap with arXiv:1405.7487,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reduction of communication and efficient partitioning are key issues for
achieving scalability in hierarchical $N$-Body algorithms like FMM. In the
present work, we propose four independent strategies to improve partitioning
and reduce communication. First of all, we show that the conventional wisdom of
using space-filling curve partitioning may not work well for boundary integral
problems, which constitute about 50% of FMM's application user base. We propose
an alternative method which modifies orthogonal recursive bisection to solve
the cell-partition misalignment that has kept it from scaling previously.
Secondly, we optimize the granularity of communication to find the optimal
balance between a bulk-synchronous collective communication of the local
essential tree and an RDMA per task per cell. Finally, we take the dynamic
sparse data exchange proposed by Hoefler et al. and extend it to a hierarchical
sparse data exchange, which is demonstrated at scale to be faster than the MPI
library's MPI_Alltoallv that is commonly used.
","[{'version': 'v1', 'created': 'Fri, 17 Feb 2017 17:57:20 GMT'}]",2017-02-20,"[['Abduljabbar', 'Mustafa', ''], ['Markomanolis', 'George', ''], ['Ibeid', 'Huda', ''], ['Yokota', 'Rio', ''], ['Keyes', 'David', '']]","['N-body methods', 'Fast multipole method', 'load balancing', 'communication reduction']"
14587,1610.05948,Dhananjay Ram,"Dhananjay Ram, Debasis Kundu, Rajesh M. Hegde",A Bayesian Approach to Estimation of Speaker Normalization Parameters,"23 Pages, 9 Figures",,,,cs.SD cs.CL stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, a Bayesian approach to speaker normalization is proposed to
compensate for the degradation in performance of a speaker independent speech
recognition system. The speaker normalization method proposed herein uses the
technique of vocal tract length normalization (VTLN). The VTLN parameters are
estimated using a novel Bayesian approach which utilizes the Gibbs sampler, a
special type of Markov Chain Monte Carlo method. Additionally the
hyperparameters are estimated using maximum likelihood approach. This model is
used assuming that human vocal tract can be modeled as a tube of uniform cross
section. It captures the variation in length of the vocal tract of different
speakers more effectively, than the linear model used in literature. The work
has also investigated different methods like minimization of Mean Square Error
(MSE) and Mean Absolute Error (MAE) for the estimation of VTLN parameters. Both
single pass and two pass approaches are then used to build a VTLN based speech
recognizer. Experimental results on recognition of vowels and Hindi phrases
from a medium vocabulary indicate that the Bayesian method improves the
performance by a considerable margin.
","[{'version': 'v1', 'created': 'Wed, 19 Oct 2016 10:16:46 GMT'}]",2016-10-20,"[['Ram', 'Dhananjay', ''], ['Kundu', 'Debasis', ''], ['Hegde', 'Rajesh M.', '']]","['Speaker Normalization', 'Bayesian Estimation', 'Vocal Tract Length Normalization (VTLN)', 'Mean Square Error (MSE)', 'Mean Absolute Error (MAE)', 'Hyperparameters']"
14588,0705.0281,Jerome Darmont,"J\'er\^ome Darmont (LIMOS), Christophe Fromantin (LIMOS), St\'ephane
  R\'egnier (LIMOS), Le Gruenwald, Michel Schneider (LIMOS)","Dynamic Clustering in Object-Oriented Databases: An Advocacy for
  Simplicity",,"LNCS, Vol. 1944 (06/2000) 71-85",,,cs.DB,,"  We present in this paper three dynamic clustering techniques for
Object-Oriented Databases (OODBs). The first two, Dynamic, Statistical &
Tunable Clustering (DSTC) and StatClust, exploit both comprehensive usage
statistics and the inter-object reference graph. They are quite elaborate.
However, they are also complex to implement and induce a high overhead. The
third clustering technique, called Detection & Reclustering of Objects (DRO),
is based on the same principles, but is much simpler to implement. These three
clustering algorithm have been implemented in the Texas persistent object store
and compared in terms of clustering efficiency (i.e., overall performance
increase) and overhead using the Object Clustering Benchmark (OCB). The results
obtained showed that DRO induced a lighter overhead while still achieving
better overall performance.
","[{'version': 'v1', 'created': 'Wed, 2 May 2007 12:50:39 GMT'}]",2007-05-23,"[['Darmont', 'Jérôme', '', 'LIMOS'], ['Fromantin', 'Christophe', '', 'LIMOS'], ['Régnier', 'Stéphane', '', 'LIMOS'], ['Gruenwald', 'Le', '', 'LIMOS'], ['Schneider', 'Michel', '', 'LIMOS']]","['Object-Oriented Databases', 'Dynamic Object Clustering', 'Performance Comparison']"
14589,1208.2079,M. B.  Ghaznavi-Ghoushchi,A. Forootaninia and M. B. Ghaznavi-Ghoushchi,"An Improved Watchdog Technique Based On Power-Aware Hierarchical Design
  For Ids In Wireless Sensor Networks",http://airccse.org/journal/nsa/0712nsa11.pdf,"(2012) International Journal of Network Security & Its
  Applications (IJNSA), 4(4), 161 - 178",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Preserving security and confidentiality in wireless sensor networks (WSN) are
crucial. Wireless sensor networks in comparison with wired networks are more
substantially vulnerable to attacks and intrusions. In WSN, a third person can
eavesdrop to the information or link to the network. So, preventing these
intrusions by detecting them has become one of the most demanding challenges.
This paper, proposes an improved watchdog technique as an effective technique
for detecting malicious nodes based on a power aware hierarchical model. This
technique overcomes the common problems in the original Watchdog mechanism. The
main purpose to present this model is reducing the power consumption as a key
factor for increasing the network's lifetime. For this reason, we simulated our
model with Tiny-OS simulator and then, compared our results with non
hierarchical model to ensure the improvement. The results indicate that, our
proposed model is better in performance than the original models and it has
increased the lifetime of the wireless sensor nodes by around 2611.492 seconds
for a network with 100 sensors.
","[{'version': 'v1', 'created': 'Fri, 10 Aug 2012 02:35:41 GMT'}]",2012-08-13,"[['Forootaninia', 'A.', ''], ['Ghaznavi-Ghoushchi', 'M. B.', '']]","['WSN', 'Intrusion Detection System (IDS)', 'Watchdog', 'Improved Watchdog', 'Low-Power', 'Hierarchical Model']"
14590,1205.4968,Akshara Pande,"Akshara Pande, Vivekanand Pant, S. Nigam",SubGraD- An Approach for Subgraph Detection,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new approach of graph matching is introduced in this paper, which
efficiently solves the problem of graph isomorphism and subgraph isomorphism.
In this paper we are introducing a new approach called SubGraD, for query graph
detection in source graph. Firstly consider the model graph (query graph) and
make the possible sets called model sets starting from the chosen initial node
or starter. Similarly, for the source graph (reference graph), all the possible
sets called reference sets could be made. Our aim is to make the reference set
on the basis of the model set. If it is possible to make the reference set,
then it is said that query graph has been detected in the source graph.
","[{'version': 'v1', 'created': 'Tue, 22 May 2012 16:28:33 GMT'}]",2012-05-23,"[['Pande', 'Akshara', ''], ['Pant', 'Vivekanand', ''], ['Nigam', 'S.', '']]","['model graph', 'reference graph', 'starter', 'model set', 'reference set']"
14591,0707.4104,Jean Mairesse,"Moez Draief (LIAFA), Jean Mairesse (LIAFA), Neil O'Connell (WMI)","Queues, stores, and tableaux","Conference version of the paper: ""Joint Burke's theorem and RSK
  representation for a queue and a store"" (with M. Draief and N. O'Connell). In
  Discrete Random Walks 2003. DMTCS vol. AC, p. 69-82, 2003","Journal of Applied Probability 42, 4 (2005) 1145-1167",,,cs.DM math.CO,,"  Consider the single server queue with an infinite buffer and a FIFO
discipline, either of type M/M/1 or Geom/Geom/1. Denote by A the arrival
process and by s the services. Assume the stability condition to be satisfied.
Denote by D the departure process in equilibrium and by r the time spent by the
customers at the very back of the queue. We prove that (D,r) has the same law
as (A,s) which is an extension of the classical Burke Theorem. In fact, r can
be viewed as the departures from a dual storage model. This duality between the
two models also appears when studying the transient behavior of a tandem by
means of the RSK algorithm: the first and last row of the resulting
semi-standard Young tableau are respectively the last instant of departure in
the queue and the total number of departures in the store.
","[{'version': 'v1', 'created': 'Fri, 27 Jul 2007 14:17:10 GMT'}]",2007-07-31,"[['Draief', 'Moez', '', 'LIAFA'], ['Mairesse', 'Jean', '', 'LIAFA'], [""O'Connell"", 'Neil', '', 'WMI']]","['Single server queue', 'storage model', 'Burke’s theorem', 'non-colliding random walks', 'tandem of queues', 'Robinson-Schensted-Knuth algorithm']"
14592,1009.0368,Sandeep Singh rawat,Sandeep Singh Rawat and Lakshmi Rajamani,"Discovering potential user browsing behaviors using custom-built apriori
  algorithm",10 pages,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most of the organizations put information on the web because they want it to
be seen by the world. Their goal is to have visitors come to the site, feel
comfortable and stay a while and try to know completely about the running
organization. As educational system increasingly requires data mining, the
opportunity arises to mine the resulting large amounts of student information
for hidden useful information (patterns like rule, clustering, and
classification, etc). The education domain offers ground for many interesting
and challenging data mining applications like astronomy, chemistry,
engineering, climate studies, geology, oceanography, ecology, physics, biology,
health sciences and computer science. Collecting the interesting patterns using
the required interestingness measures, which help us in discovering the
sophisticated patterns that are ultimately used for developing the site. We
study the application of data mining to educational log data collected from
Guru Nanak Institute of Technology, Ibrahimpatnam, India. We have proposed a
custom-built apriori algorithm to find the effective pattern analysis. Finally,
analyzing web logs for usage and access trends can not only provide important
information to web site developers and administrators, but also help in
creating adaptive web sites.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2010 10:00:51 GMT'}]",2010-09-03,"[['Rawat', 'Sandeep Singh', ''], ['Rajamani', 'Lakshmi', '']]","['Association Rule Mining', 'Data Mining', 'Web log']"
14593,1701.07166,Shaowei Wang,"Shaowei Wang, Liusheng Huang, Pengzhan Wang, Hongli Xu, Wei Yang","Personalized Classifier Ensemble Pruning Framework for Mobile
  Crowdsourcing",,,,,cs.DC cs.HC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ensemble learning has been widely employed by mobile applications, ranging
from environmental sensing to activity recognitions. One of the fundamental
issue in ensemble learning is the trade-off between classification accuracy and
computational costs, which is the goal of ensemble pruning. During
crowdsourcing, the centralized aggregator releases ensemble learning models to
a large number of mobile participants for task evaluation or as the
crowdsourcing learning results, while different participants may seek for
different levels of the accuracy-cost trade-off. However, most of existing
ensemble pruning approaches consider only one identical level of such
trade-off. In this study, we present an efficient ensemble pruning framework
for personalized accuracy-cost trade-offs via multi-objective optimization.
Specifically, for the commonly used linear-combination style of the trade-off,
we provide an objective-mixture optimization to further reduce the number of
ensemble candidates. Experimental results show that our framework is highly
efficient for personalized ensemble pruning, and achieves much better pruning
performance with objective-mixture optimization when compared to state-of-art
approaches.
","[{'version': 'v1', 'created': 'Wed, 25 Jan 2017 05:22:35 GMT'}]",2017-01-26,"[['Wang', 'Shaowei', ''], ['Huang', 'Liusheng', ''], ['Wang', 'Pengzhan', ''], ['Xu', 'Hongli', ''], ['Yang', 'Wei', '']]","['Ensemble Pruning', 'Mobile Crowdsourcing', 'Bi-objective Optimization', 'Pareto Optimization']"
14594,1307.7159,Heide Gluesing-Luerssen,Aleams Barra and Heide Gluesing-Luerssen,"MacWilliams Extension Theorems and the Local-Global Property for Codes
  over Rings",,,,,cs.IT math.IT math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The MacWilliams extension theorem is investigated for various weight
functions over finite Frobenius rings. The problem is reformulated in terms of
a local-global property for subgroups of the general linear group. Among other
things, it is shown that the extension theorem holds true for poset weights if
and only if the underlying poset is hierarchical. Specifically, the
Rosenbloom-Tsfasman weight for vector codes satisfies the extension theorem,
whereas the Niederreiter-Rosenbloom-Tsfasman weight for matrix codes does not.
A short character-theoretic proof of the well-known MacWilliams extension
theorem for the homogeneous weight is provided. Moreover it is shown that the
extension theorem carries over to direct products of weights, but not to
symmetrized products.
","[{'version': 'v1', 'created': 'Fri, 26 Jul 2013 20:23:15 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Mar 2014 21:49:13 GMT'}]",2014-03-27,"[['Barra', 'Aleams', ''], ['Gluesing-Luerssen', 'Heide', '']]","['MacWilliams extension theorem', 'partitions', 'poset structures']"
14595,1611.00616,Jiafeng Xu,"Jiafeng Xu, Karl Henning Halse",Dual Quaternion Variational Integrator for Rigid Body Dynamic Simulation,,,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a symplectic dual quaternion variational integrator(DQVI) for
simulating single rigid body motion in all six degrees of freedom. Dual
quaternion is used to represent rigid body kinematics and one-step Lie group
variational integrator is used to conserve the geometric structure, energy and
momentum of the system during the simulation. The combination of these two
becomes the first Lie group variational integrator for rigid body simulation
without decoupling translations and rotations. Newton-Raphson method is used to
solve the recursive dynamic equation. This method is suitable for real-time
rigid body simulations with high precision under large time step. DQVI respects
the symplectic structure of the system with excellent long-term conservation of
geometry structure, momentum and energy. It also allows the reference point and
6-by-6 inertia matrix to be arbitrarily defined, which is very convenient for a
variety of engineering problems.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2016 14:02:16 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Mar 2018 15:49:09 GMT'}]",2018-03-14,"[['Xu', 'Jiafeng', ''], ['Halse', 'Karl Henning', '']]","['Dual Quaternion', 'Variational Integrator', 'Lie Group Method', 'Rigid Body Dynamics', 'Realtime simulation']"
14596,1007.3649,Satish N. Srirama,Satish Narayana Srirama and Anton Naumenko,"Secure Communication and Access Control for Mobile Web Service
  Provisioning","Proceedings of the First International Conference on Security of
  Information and Networks (SIN 2007), May 8-10, 2007. Trafford Publishing,
  Canada",,,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is now feasible to host basic web services on a smart phone due to the
advances in wireless devices and mobile communication technologies. While the
applications are quite welcoming, the ability to provide secure and reliable
communication in the vulnerable and volatile mobile ad-hoc topologies is vastly
becoming necessary. The paper mainly addresses the details and issues in
providing secured communication and access control for the mobile web service
provisioning domain. While the basic message-level security can be provided,
providing proper access control mechanisms for the Mobile Host still poses a
great challenge. This paper discusses details of secure communication and
proposes the distributed semantics-based authorization mechanism.
","[{'version': 'v1', 'created': 'Wed, 21 Jul 2010 13:20:33 GMT'}]",2010-07-22,"[['Srirama', 'Satish Narayana', ''], ['Naumenko', 'Anton', '']]","['Access Control', 'Communication system security', 'Mobile Communication', 'Mobile web services']"
14597,1705.08135,Damien Chablat,"P Wenger (IRCCyN), Damien Chablat (IRCCyN)","Kinetostatic Analysis and Solution Classification of a Planar Tensegrity
  Mechanism","7th IFToMM International Workshop on Computational Kinematics, May
  2017, Poitiers, France. 2017",,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tensegrity mechanisms have several interesting properties that make them
suitable for a number of applications. Their analysis is generally challenging
because the static equilibrium conditions often result in complex equations. A
class of planar one-degree-of-freedom (dof) tensegrity mechanisms with three
linear springs is analyzed in detail in this paper. The kinetostatic equations
are derived and solved under several loading and geometric conditions. It is
shown that these mechanisms exhibit up to six equilibrium configurations, of
which one or two are stable. Discriminant varieties and cylindrical algebraic
decomposition combined with Groebner base elimination are used to classify
solutions as function of the input parameters.
","[{'version': 'v1', 'created': 'Tue, 23 May 2017 08:55:08 GMT'}]",2017-05-24,"[['Wenger', 'P', '', 'IRCCyN'], ['Chablat', 'Damien', '', 'IRCCyN']]","['Tensegrity mechanism', 'kinetostatic model', 'geometric design', 'algebraic computation']"
14598,1402.1347,Praboo N N,N.N. Praboo and P.K. Bhaba,"Simulation work on Fractional Order PI{\lambda} Control Strategy for
  speed control of DC motor based on stability boundary locus method","7 pages, 13 figures, Published with International Journal of
  Engineering Trends and Technology (IJETT)","IJETT, 4(8):3403-309, August 2013",,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with the design of Fractional Order Proportional Integral
(FO-PI{\lambda}) controller for the speed control of DC motor. A mathematical
model of DC motor control system is derived and based on this model fractional
order PI{\lambda} controller is designed using stability boundary locus method
to satisfy required gain margin (GM) and phase margin (PM) of the system. Servo
and Regulatory tracking simulation runs are carried out for the speed control
of DC motor. The performance of the fractional order PI{\lambda}
(FO-PI{\lambda}) controller is compared with Integer Order Relay Feedback
Proportional Integral (IO-RFPI) controller. Finally the stability of both
control system is considered.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2014 13:27:01 GMT'}]",2014-02-07,"[['Praboo', 'N. N.', ''], ['Bhaba', 'P. K.', '']]","['Fractional order control', 'PID controllers', 'DC Motor', 'Speed control system', 'Optimization', 'CRONE']"
14599,1802.08826,Muhammad Bilal,Muhammad Bilal,Role of management information system in time saving,"10 pages, 6 figures, accepted in ICCRT conference",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This Case Study will be used in order to investigate and establish the
importance of role of Management Information System in time saving during the
payment of automobile tax in Sindh through e-filling methods. Moreover it will
also highlight the important factors which are involved as barriers and limit
the role of MIS in time saving techniques. The approach which is used in this
case study is descriptive research type along with the survey. The data used
was collected from the specimen of common people working in different
environments along with the officers working at Civic Centre (Automobile Tax
Collection Branch excise department). The audience included were all well
informed by the process and were eligible to give their opinions on the
following research. A system design is also proposed along with an Erd which
can be useful in the coming future. This research could likewise be expanded to
include different of respondents, for example, paid taxpayers and different
types of taxpayers. Paid tax payers are given the rights by their clients to
prepare their assessment matters. They use the e-filing system for different
types of clients and are more frequent users of the e-filing system than
taxpayers who file for themselves. It would be interesting to understand which
facets of hazard are larger to them. Different types of taxpayers, for example,
company authorized cars may deal with more complex exchanges than single car
taxpayers, consequently, they may emphasize different hazard facets when filing
in the government form frame electronically
","[{'version': 'v1', 'created': 'Sat, 24 Feb 2018 09:58:38 GMT'}]",2018-02-27,"[['Bilal', 'Muhammad', '']]","['e-filling', 'taxpayers', 'Management information system', 'Erd']"
14600,1607.01033,Sergey Tarasenko,Sergey Tarasenko,"An Application of the EM-algorithm to Approximate Empirical
  Distributions of Financial Indices with the Gaussian Mixtures","3 pages, 5 figures",,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study I briefly illustrate application of the Gaussian mixtures to
approximate empirical distributions of financial indices (DAX, Dow Jones,
Nikkei, RTSI, S&P 500). The resulting distributions illustrate very high
quality of approximation as evaluated by Kolmogorov-Smirnov test. This implies
further study of application of the Gaussian mixtures to approximate empirical
distributions of financial indices.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2016 12:44:14 GMT'}]",2016-07-06,"[['Tarasenko', 'Sergey', '']]","['financial indices', 'Gaussian distribution', 'mixtures ofGaussian distributions', 'Gaussian mixtures', 'EM-algorithm']"
14601,1511.05619,Anthony Scopatz,"Anthony M. Scopatz, Matthew J. Gidden, Robert W. Carlsen, Robert R.
  Flanagan, Kathryn D. Huff, Meghan B. McGarry, Arrielle C. Opotowsky, Olzhas
  Rakhimov, Zach Welch, Paul P.H. Wilson",Cyclus Archetypes,,,,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  The current state of nuclear fuel cycle simulation exists in highly
customized form. Satisfying a wide range of users requires model modularity
within such a tool. Cyclus is a fuel cycle simulator specifically designed to
combat the lack of adaptability of previous generations of simulators. This is
accomplished through an agent-based infrastructure and treating time
discretely. The Cyclus kernel was developed to allow for models, called
archetypes, of differing fidelity and function depending on need of the users.
To take advantage of this flexibility, a user must write an archetype for their
desired simulation if it does not yet exist within the Cyclus ecosystem. At
this stage, a user graduates to the title of archetype developer.
  Without automation, archetype development is difficult for the uninitiated.
This paper presents the framework developed for simplifying the writing of
archetypes: the Cyclus preprocessor, or cycpp. cycpp addresses the computer
science and software development aspects of archetype development that can be
addressed algorithmically, allowing the developer to focus on modeling the
physics, social policies, and economics. cycpp passes through the code three
times to perform the following tasks: normalizing the code via the C
preprocessor, accumulation of notations, and code generation. Not only does
this reduce the amount of code a developer must write by approximately an order
of magnitude, but the archetypes are automatically validated.
","[{'version': 'v1', 'created': 'Tue, 17 Nov 2015 23:37:04 GMT'}]",2015-11-19,"[['Scopatz', 'Anthony M.', ''], ['Gidden', 'Matthew J.', ''], ['Carlsen', 'Robert W.', ''], ['Flanagan', 'Robert R.', ''], ['Huff', 'Kathryn D.', ''], ['McGarry', 'Meghan B.', ''], ['Opotowsky', 'Arrielle C.', ''], ['Rakhimov', 'Olzhas', ''], ['Welch', 'Zach', ''], ['Wilson', 'Paul P. H.', '']]","['fuel cycle', 'simulation', 'software']"
14602,1710.02801,Manuel Mazzara,"Alexandr Naumchev, Bertrand Meyer, Manuel Mazzara, Florian Galinier,
  Jean-Michel Bruel, Sophie Ebersold",AutoReq: expressing and verifying requirements for control systems,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The considerable effort of writing requirements is only worthwhile if the
result meets two conditions: the requirements reflect stakeholders' needs, and
the implementation satisfies them. In usual approaches, the use of different
notations for requirements (often natural language) and implementations (a
programming language) makes both conditions elusive. AutoReq, presented in this
article, takes a different approach to both the writing of requirements and
their verification. Applying the approach to a well-documented example, a
landing gear system, allowed for a mechanical proof of consistency and
uncovered an error in a published discussion of the problem.
","[{'version': 'v1', 'created': 'Sun, 8 Oct 2017 08:04:18 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Feb 2019 11:01:02 GMT'}]",2019-02-05,"[['Naumchev', 'Alexandr', ''], ['Meyer', 'Bertrand', ''], ['Mazzara', 'Manuel', ''], ['Galinier', 'Florian', ''], ['Bruel', 'Jean-Michel', ''], ['Ebersold', 'Sophie', '']]","['AutoReq', 'seamless requirements', 'Design by Contract', 'AutoProof', 'Eiffel', 'Landing Gear System', 'specification drivers', 'multirequirements']"
14603,0804.1046,Xu Zhiqiang,"Zhiqiang Xu, Guoliang Xu",Discrete schemes for Gaussian curvature and their convergence,,,,,cs.CV cs.CG cs.GR cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, several discrete schemes for Gaussian curvature are surveyed.
The convergence property of a modified discrete scheme for the Gaussian
curvature is considered. Furthermore, a new discrete scheme for Gaussian
curvature is resented. We prove that the new scheme converges at the regular
vertex with valence not less than 5. By constructing a counterexample, we also
show that it is impossible for building a discrete scheme for Gaussian
curvature which converges over the regular vertex with valence 4. Finally,
asymptotic errors of several discrete scheme for Gaussian curvature are
compared.
","[{'version': 'v1', 'created': 'Mon, 7 Apr 2008 14:47:03 GMT'}]",2008-04-09,"[['Xu', 'Zhiqiang', ''], ['Xu', 'Guoliang', '']]","['Discrete Gaussian curvature', 'discrete mean curvature', 'geometricmodeling']"
14604,1108.3756,Vadim E. Levit,Vadim E. Levit and Eugen Mandrescu,On the Intersection of All Critical Sets of a Unicyclic Graph,"8 pages, 5 figures",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A set S is independent in a graph G if no two vertices from S are adjacent.
The independence number alpha(G) is the cardinality of a maximum independent
set, while mu(G) is the size of a maximum matching in G. If alpha(G)+mu(G)=|V|,
then G=(V,E) is called a Konig-Egervary graph. The number
d_{c}(G)=max{|A|-|N(A)|} is called the critical difference of G (Zhang, 1990).
By core(G) (corona(G)) we denote the intersection (union, respectively) of all
maximum independent sets, while by ker(G) we mean the intersection of all
critical independent sets. A connected graph having only one cycle is called
unicyclic. It is known that ker(G) is a subset of core(G) for every graph G,
while the equality is true for bipartite graphs (Levit and Mandrescu, 2011).
For Konig-Egervary unicyclic graphs, the difference |core(G)|-|ker(G)| may
equal any non-negative integer. In this paper we prove that if G is a
non-Konig-Egervary unicyclic graph, then: (i) ker(G)= core(G) and (ii)
|corona(G)|+|core(G)|=2*alpha(G)+1. Pay attention that
|corona(G)|+|core(G)|=2*alpha(G) holds for every Konig-Egervary graph.
","[{'version': 'v1', 'created': 'Thu, 18 Aug 2011 14:05:04 GMT'}]",2011-08-19,"[['Levit', 'Vadim E.', ''], ['Mandrescu', 'Eugen', '']]","['maximum independent set', 'core', 'corona', 'matching', 'critical set', 'unicyclic graph', 'K¨onig-Egerv´ary graph']"
14605,1507.01932,Francisco Diez,"Marco M. Maia, Parth Soni, Francisco J. Diez","Demonstration of an Aerial and Submersible Vehicle Capable of Flight and
  Underwater Navigation with Seamless Air-Water Transition","9 pages, 11 figures, 1 table",,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bio-inspired vehicles are currently leading the way in the quest to produce a
vehicle capable of flight and underwater navigation. However, a fully
functional vehicle has not yet been realized. We present the first fully
functional vehicle platform operating in air and underwater with seamless
transition between both mediums. These unique capabilities combined with the
hovering, high maneuverability and reliability of multirotor vehicles, results
in a disruptive technology for both civil and military application including
air/water search and rescue, inspection, repairs and survey missions among
others. The invention was built on a bio-inspired locomotion force analysis
that combines flight and swimming. Three main advances in the present work has
allowed this invention. The first is the discovery of a seamless transition
method between air and underwater. The second is the design of a multi-medium
propulsion system capable of efficient operation in air and underwater. The
third combines the requirements for lift and thrust for flight (for a given
weight) and the requirements for thrust and neutral buoyancy (in water) for
swimming. The result is a careful balance between lift, thrust, weight, and
neutral buoyancy implemented in the vehicle design. A fully operational
prototype demonstrated the flight, and underwater navigation capabilities as
well as the rapid air/water and water/air transition.
","[{'version': 'v1', 'created': 'Tue, 7 Jul 2015 19:52:41 GMT'}]",2015-07-08,"[['Maia', 'Marco M.', ''], ['Soni', 'Parth', ''], ['Diez', 'Francisco J.', '']]","['bio-inspired vehicle', 'flight', 'swimming', 'unmanned aerial', 'submersible vehicle']"
14606,1305.1488,Nicolas Robinson-Garcia,"\'Alvaro Cabezas-Clavijo, Nicol\'as Robinson-Garc\'ia, Daniel
  Torres-Salinas, Evaristo Jim\'enez-Contreras, Thomas Mikulka, Christian
  Gumpenberger, Ambros Wemisch, Juan Gorraiz","Most borrowed is most cited? Library loan statistics as a proxy for
  monograph selection in citation indexes",Paper accepted in ISSI 2013,,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study aims to analyse whether library loans statistics can be used as a
measure of monograph use and as a selection criteria for inclusion in citation
indexes. For this, we conducted an exploratory study based on loan data (1000
most borrowed monographs) from two non-Anglo-Saxon European university
libraries (Granada and Vienna) with strong social sciences and humanities
components. Loans to scientists only were also analysed at the University of
Vienna. Furthermore, citation counts for the 100 most borrowed scientific
monographs (SM) and textbooks or manuals (MTB) were retrieved from Web of
Science and Google Scholar. The results show considerable similarities in both
libraries: the percentage of loans for books in national languages represents
almost 96 per cent of the total share and SM accounts only for 10 to 13 per
cent. When considering loans to scientists only, the percentage of English
books increases to 30 per cent, the percentage of SM loans also increases
(approx 80 per cent). Furthermore, we found no significant correlations between
loans and citations. Since loan statistics are currently insufficient for
measuring the use of monographs, their suggested use as an applicable selection
criterion for book citation indexes is not yet feasible. Data improvement and
aggregation at different levels is a challenge for modern libraries in order to
enable the exploitation of this invaluable information source for scientometric
purposes.
","[{'version': 'v1', 'created': 'Tue, 7 May 2013 12:31:39 GMT'}]",2013-05-08,"[['Cabezas-Clavijo', 'Álvaro', ''], ['Robinson-García', 'Nicolás', ''], ['Torres-Salinas', 'Daniel', ''], ['Jiménez-Contreras', 'Evaristo', ''], ['Mikulka', 'Thomas', ''], ['Gumpenberger', 'Christian', ''], ['Wemisch', 'Ambros', ''], ['Gorraiz', 'Juan', '']]","['Loans', 'citation', 'usage metric', 'citation metric', 'monographs', 'books', 'book citation index']"
14607,1701.03785,Xu Zhang,Xu Zhang,"Vapor Compression Cycle Control for Automotive Air Conditioning Systems
  with a Linear Parameter Varying Approach","14 pages, 11 fiugres",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates an output tracking problem for the vapor compression
cycle in automotive Air Conditioning (A/C) systems using Linear Parameter
Varying (LPV) techniques. Stemming from a recently developed first-principle
A/C model, Jacobian linearization is first exploited to develop an LPV-based
model that is nonlinearly dependent on time-varying system parameters such as
evaporator pressure and superheat temperature. To facilitate the control
implementation, a Tensor Product (TP) model transformation is applied to
transform the LPV-based model to a TP-type convex polytopic model. LPV
controllers are then designed to guarantee system stability, robustness and
H-infinity performance. Simulations are presented to demonstrate the efficacy
of the developed framework.
","[{'version': 'v1', 'created': 'Fri, 13 Jan 2017 00:26:55 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Nov 2018 05:25:04 GMT'}, {'version': 'v3', 'created': 'Mon, 4 Nov 2019 17:35:13 GMT'}]",2019-11-05,"[['Zhang', 'Xu', '']]","['Air Conditioning System', 'Optimization', 'Linear Parameter Varying Control', 'Moving Boundary Method', 'Tensor-Product Transformation']"
14608,1312.3858,Geetika Pandey Mrs.,"Geetika Silakari Pandey, R.C. Jain",Computational impact of hydrophobicity in protein stability,,"(ijcsis)international journal of computer science and information
  security, vol.11, no. 10, october 2013",,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Among the various features of amino acids, the hydrophobic property has most
visible impact on stability of a sequence folding. This is mentioned in many
protein folding related work, in this paper we more elaborately discuss the
computational impact of the well defined hydrophobic aspect in determining
stability, approach with the help of a developed free energy computing
algorithm covering various aspects preprocessing of an amino acid sequence,
generating the folding and calculating free energy. Later discussing its use in
protein structure related research work.
","[{'version': 'v1', 'created': 'Fri, 13 Dec 2013 16:19:35 GMT'}]",2013-12-16,"[['Pandey', 'Geetika Silakari', ''], ['Jain', 'R. C.', '']]","['amino acids', 'hydrophobicity', 'free']"
14609,1802.06865,Jonas Teuwen,"Timothy de Moor and Alejandro Rodriguez-Ruiz and Albert Gubern
  M\'erida and Ritse Mann and Jonas Teuwen","Automated soft tissue lesion detection and segmentation in digital
  mammography using a u-net deep learning network",To appear in IWBI 2018,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer-aided detection or decision support systems aim to improve breast
cancer screening programs by helping radiologists to evaluate digital
mammography (DM) exams. Commonly such methods proceed in two steps: selection
of candidate regions for malignancy, and later classification as either
malignant or not. In this study, we present a candidate detection method based
on deep learning to automatically detect and additionally segment soft tissue
lesions in DM. A database of DM exams (mostly bilateral and two views) was
collected from our institutional archive. In total, 7196 DM exams (28294 DM
images) acquired with systems from three different vendors (General Electric,
Siemens, Hologic) were collected, of which 2883 contained malignant lesions
verified with histopathology. Data was randomly split on an exam level into
training (50\%), validation (10\%) and testing (40\%) of deep neural network
with u-net architecture. The u-net classifies the image but also provides
lesion segmentation. Free receiver operating characteristic (FROC) analysis was
used to evaluate the model, on an image and on an exam level. On an image
level, a maximum sensitivity of 0.94 at 7.93 false positives (FP) per image was
achieved. Similarly, per exam a maximum sensitivity of 0.98 at 7.81 FP per
image was achieved. In conclusion, the method could be used as a candidate
selection model with high accuracy and with the additional information of
lesion segmentation.
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 21:39:49 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Mar 2018 09:21:11 GMT'}]",2018-03-09,"[['de Moor', 'Timothy', ''], ['Rodriguez-Ruiz', 'Alejandro', ''], ['Mérida', 'Albert Gubern', ''], ['Mann', 'Ritse', ''], ['Teuwen', 'Jonas', '']]","['digital mammography', 'automatic lesion detection', 'automatic lesion segmentation', 'deep learning']"
14610,1409.8211,Pavel Kuksa,Pavel P. Kuksa,Efficient multivariate sequence classification,"multivariate sequence classification, string kernels, vector
  quantization, direct feature quantization, music classification, protein
  classification",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Kernel-based approaches for sequence classification have been successfully
applied to a variety of domains, including the text categorization, image
classification, speech analysis, biological sequence analysis, time series and
music classification, where they show some of the most accurate results.
  Typical kernel functions for sequences in these domains (e.g., bag-of-words,
mismatch, or subsequence kernels) are restricted to {\em discrete univariate}
(i.e. one-dimensional) string data, such as sequences of words in the text
analysis, codeword sequences in the image analysis, or nucleotide or amino acid
sequences in the DNA and protein sequence analysis. However, original sequence
data are often of real-valued multivariate nature, i.e. are not univariate and
discrete as required by typical $k$-mer based sequence kernel functions.
  In this work, we consider the problem of the {\em multivariate} sequence
classification such as classification of multivariate music sequences, or
multidimensional protein sequence representations. To this end, we extend {\em
univariate} kernel functions typically used in sequence analysis and propose
efficient {\em multivariate} similarity kernel method (MVDFQ-SK) based on (1) a
direct feature quantization (DFQ) of each sequence dimension in the original
{\em real-valued} multivariate sequences and (2) applying novel multivariate
discrete kernel measures on these multivariate discrete DFQ sequence
representations to more accurately capture similarity relationships among
sequences and improve classification performance.
  Experiments using the proposed MVDFQ-SK kernel method show excellent
classification performance on three challenging music classification tasks as
well as protein sequence classification with significant 25-40% improvements
over univariate kernel methods and existing state-of-the-art sequence
classification methods.
","[{'version': 'v1', 'created': 'Mon, 29 Sep 2014 18:03:22 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Sep 2014 14:46:42 GMT'}]",2014-10-01,"[['Kuksa', 'Pavel P.', '']]","['multivariate sequence classification', 'string kernels', 'vector quantization', 'direct feature quantization', 'music classification', 'protein classification']"
14611,1505.01319,Clemens Arth,"Clemens Arth and Raphael Grasset and Lukas Gruber and Tobias Langlotz
  and Alessandro Mulloni and Daniel Wagner",The History of Mobile Augmented Reality,"43 pages, 18 figures",,,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  This document summarizes the major milestones in mobile Augmented Reality
between 1968 and 2014. Major parts of the list were compiled by the member of
the Christian Doppler Laboratory for Handheld Augmented Reality in 2010 (author
list in alphabetical order) for the ISMAR society. Later in 2013 it was
updated, and more recent work was added during preparation of this report.
Permission is granted to copy and modify.
","[{'version': 'v1', 'created': 'Wed, 6 May 2015 10:56:12 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Sep 2015 12:12:41 GMT'}, {'version': 'v3', 'created': 'Tue, 10 Nov 2015 10:02:28 GMT'}]",2015-11-11,"[['Arth', 'Clemens', ''], ['Grasset', 'Raphael', ''], ['Gruber', 'Lukas', ''], ['Langlotz', 'Tobias', ''], ['Mulloni', 'Alessandro', ''], ['Wagner', 'Daniel', '']]","['Technical Report', 'Mobile Augmented Reality', 'History']"
14612,1406.5691,John J. Camilleri,"John J. Camilleri, Gabriele Paganelli, Gerardo Schneider",A CNL for Contract-Oriented Diagrams,,,,,cs.CL cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a first step towards a framework for defining and manipulating
normative documents or contracts described as Contract-Oriented (C-O) Diagrams.
These diagrams provide a visual representation for such texts, giving the
possibility to express a signatory's obligations, permissions and prohibitions,
with or without timing constraints, as well as the penalties resulting from the
non-fulfilment of a contract. This work presents a CNL for verbalising C-O
Diagrams, a web-based tool allowing editing in this CNL, and another for
visualising and manipulating the diagrams interactively. We then show how these
proof-of-concept tools can be used by applying them to a small example.
","[{'version': 'v1', 'created': 'Sun, 22 Jun 2014 09:41:24 GMT'}]",2014-06-24,"[['Camilleri', 'John J.', ''], ['Paganelli', 'Gabriele', ''], ['Schneider', 'Gerardo', '']]","['normative texts', 'electronic contracts', 'c-o diagrams', 'controlled natural language', 'grammatical framework']"
14613,1304.1683,Sipendra Sinha Mr.,"Sipendra Sinha, Amol Gaikwad, Deepak Kumar, Snehal Darade, Rohit
  Singh, Mr. Pramod D. Ganjewar",Data Hiding in Binary Image using Block Parity,"4 Pages,Implemented in Java",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Secret data hiding in binary images is more difficult than other formats
since binary images require only one bit representation to indicate black and
white. This study proposes a new method for data hiding in binary images using
optimized bit position to replace a secret bit. This method manipulates blocks,
which are sub-divided. The parity bit for a specified block decides whether to
change or not, to embed a secret bit. By finding the best position to insert a
secret bit for each divided block, the image quality of the resulting
stego-image can be improved, while maintaining low computational complexity.The
experimental results show that the proposed method has an improvement with
respect to a previous work.
","[{'version': 'v1', 'created': 'Fri, 5 Apr 2013 11:36:15 GMT'}]",2013-04-08,"[['Sinha', 'Sipendra', ''], ['Gaikwad', 'Amol', ''], ['Kumar', 'Deepak', ''], ['Darade', 'Snehal', ''], ['Singh', 'Rohit', ''], ['Ganjewar', 'Mr. Pramod D.', '']]","['block parity', 'binary image', 'stegnography', 'bilevel', 'embed']"
14614,1701.02162,Amaury Pouly,"Nathana\""el Fijalkow, Pierre Ohlmann, Jo\""el Ouaknine, Amaury Pouly,
  James Worrell",Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem,,,,,cs.CC cs.LO cs.SC math.AG math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The \emph{Orbit Problem} consists of determining, given a linear
transformation $A$ on $\mathbb{Q}^d$, together with vectors $x$ and $y$,
whether the orbit of $x$ under repeated applications of $A$ can ever reach $y$.
This problem was famously shown to be decidable by Kannan and Lipton in the
1980s.
  In this paper, we are concerned with the problem of synthesising suitable
\emph{invariants} $\mathcal{P} \subseteq \mathbb{R}^d$, \emph{i.e.}, sets that
are stable under $A$ and contain $x$ and not $y$, thereby providing compact and
versatile certificates of non-reachability. We show that whether a given
instance of the Orbit Problem admits a semialgebraic invariant is decidable,
and moreover in positive instances we provide an algorithm to synthesise
suitable invariants of polynomial size.
  It is worth noting that the existence of \emph{semilinear} invariants, on the
other hand, is (to the best of our knowledge) not known to be decidable.
","[{'version': 'v1', 'created': 'Mon, 9 Jan 2017 13:00:53 GMT'}]",2017-01-10,"[['Fijalkow', 'Nathanaël', ''], ['Ohlmann', 'Pierre', ''], ['Ouaknine', 'Joël', ''], ['Pouly', 'Amaury', ''], ['Worrell', 'James', '']]","['Verification', 'algebraic computation', 'Skolem Problem', 'Orbit Problem', 'invariants']"
14615,1511.02486,Stephen Chestnut,Stephen R. Chestnut and Rico Zenklusen,Hardness and Approximation for Network Flow Interdiction,,,,,cs.DS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the Network Flow Interdiction problem an adversary attacks a network in
order to minimize the maximum s-t-flow. Very little is known about the
approximatibility of this problem despite decades of interest in it. We present
the first approximation hardness, showing that Network Flow Interdiction and
several of its variants cannot be much easier to approximate than Densest
k-Subgraph. In particular, any $n^{o(1)}$-approximation algorithm for Network
Flow Interdiction would imply an $n^{o(1)}$-approximation algorithm for Densest
k-Subgraph. We complement this hardness results with the first approximation
algorithm for Network Flow Interdiction, which has approximation ratio 2(n-1).
We also show that Network Flow Interdiction is essentially the same as the
Budgeted Minimum s-t-Cut problem, and transferring our results gives the first
approximation hardness and algorithm for that problem, as well.
","[{'version': 'v1', 'created': 'Sun, 8 Nov 2015 14:02:04 GMT'}]",2015-11-10,"[['Chestnut', 'Stephen R.', ''], ['Zenklusen', 'Rico', '']]","['Network flow interdiction', 'approximation algorithms', 'hardness of approximation', 'budgeted optimization']"
14616,1410.3560,Ryan Rossi,Ryan A. Rossi and Nesreen K. Ahmed,"NetworkRepository: An Interactive Data Repository with Multi-scale
  Visual Analytics",AAAI 2015 DT,,,,cs.DL cs.HC cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network Repository (NR) is the first interactive data repository with a
web-based platform for visual interactive analytics. Unlike other data
repositories (e.g., UCI ML Data Repository, and SNAP), the network data
repository (networkrepository.com) allows users to not only download, but to
interactively analyze and visualize such data using our web-based interactive
graph analytics platform. Users can in real-time analyze, visualize, compare,
and explore data along many different dimensions. The aim of NR is to make it
easy to discover key insights into the data extremely fast with little effort
while also providing a medium for users to share data, visualizations, and
insights. Other key factors that differentiate NR from the current data
repositories is the number of graph datasets, their size, and variety. While
other data repositories are static, they also lack a means for users to
collaboratively discuss a particular dataset, corrections, or challenges with
using the data for certain applications. In contrast, we have incorporated many
social and collaborative aspects into NR in hopes of further facilitating
scientific research (e.g., users can discuss each graph, post observations,
visualizations, etc.).
","[{'version': 'v1', 'created': 'Tue, 14 Oct 2014 03:35:37 GMT'}, {'version': 'v2', 'created': 'Thu, 28 May 2015 19:58:23 GMT'}]",2015-05-29,"[['Rossi', 'Ryan A.', ''], ['Ahmed', 'Nesreen K.', '']]","['Interactive data repository', 'data archive', 'visual analytics', 'interactive graph mining', 'graph visualization', 'network analysis', 'interactive graph generation']"
14617,1702.04663,Abdul Kawsar Tushar,Akm Ashiquzzaman and Abdul Kawsar Tushar,"Handwritten Arabic Numeral Recognition using Deep Learning Neural
  Networks","Conference Name - 2017 IEEE International Conference on Imaging,
  Vision & Pattern Recognition (icIVPR17) 4 pages, 5 figures, 1 table",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Handwritten character recognition is an active area of research with
applications in numerous fields. Past and recent works in this field have
concentrated on various languages. Arabic is one language where the scope of
research is still widespread, with it being one of the most popular languages
in the world and being syntactically different from other major languages. Das
et al. \cite{DBLP:journals/corr/abs-1003-1891} has pioneered the research for
handwritten digit recognition in Arabic. In this paper, we propose a novel
algorithm based on deep learning neural networks using appropriate activation
function and regularization layer, which shows significantly improved accuracy
compared to the existing Arabic numeral recognition methods. The proposed model
gives 97.4 percent accuracy, which is the recorded highest accuracy of the
dataset used in the experiment. We also propose a modification of the method
described in \cite{DBLP:journals/corr/abs-1003-1891}, where our method scores
identical accuracy as that of \cite{DBLP:journals/corr/abs-1003-1891}, with the
value of 93.8 percent.
","[{'version': 'v1', 'created': 'Wed, 15 Feb 2017 16:06:15 GMT'}]",2017-02-16,"[['Ashiquzzaman', 'Akm', ''], ['Tushar', 'Abdul Kawsar', '']]","['Deep learning', 'ConvNet', 'Handwritten digitrecognition', 'Arabic numeral']"
14618,1712.06311,Kengo Kido,"Kengo Kido, Sean Sedwards and Ichiro Hasuo","Bounding Errors Due to Switching Delays in Incrementally Stable Switched
  Systems (Extended Version)",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Time delays pose an important challenge in networked control systems, which
are now ubiquitous. Focusing on switched systems, we introduce a framework that
provides an upper bound for errors caused by switching delays. Our framework is
based on approximate bisimulation, a notion that has been previously utilized
mainly for symbolic (discrete) abstraction of state spaces. Notable in our
framework is that, in deriving an approximate bisimulation and thus an error
bound, we use a simple incremental stability assumption (namely {\delta}-GUAS)
that does not itself refer to time delays. That this is the same assumption
used for state-space discretization enables a two-step workflow for control
synthesis for switched systems, in which a single Lyapunov-type stability
witness serves for two different purposes of state discretization and coping
with time delays. We demonstrate the proposed framework with a boost DC-DC
converter, a common example of switched systems.
","[{'version': 'v1', 'created': 'Mon, 18 Dec 2017 09:38:11 GMT'}, {'version': 'v2', 'created': 'Sat, 23 Dec 2017 07:43:38 GMT'}]",2017-12-27,"[['Kido', 'Kengo', ''], ['Sedwards', 'Sean', ''], ['Hasuo', 'Ichiro', '']]","['Switched system', 'delay', 'incremental stability', 'synthesis', 'approximate bisimulation']"
14619,1111.2750,Abarna Sundaramurthy,"Thirumaran.M, Dhavachelvan.P, S.Abarna and Lakshmi.P","Finite State Machine Based Evaluation Model for Web Service Reliability
  Analysis","13 pages,3 figures, WesT-2011",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Now-a-days they are very much considering about the changes to be done at
shorter time since the reaction time needs are decreasing every moment.
Business Logic Evaluation Model (BLEM) are the proposed solution targeting
business logic automation and facilitating business experts to write
sophisticated business rules and complex calculations without costly custom
programming. BLEM is powerful enough to handle service manageability issues by
analyzing and evaluating the computability and traceability and other criteria
of modified business logic at run time. The web service and QOS grows
expensively based on the reliability of the service. Hence the service provider
of today things that reliability is the major factor and any problem in the
reliability of the service should overcome then and there in order to achieve
the expected level of reliability. In our paper we propose business logic
evaluation model for web service reliability analysis using Finite State
Machine (FSM) where FSM will be extended to analyze the reliability of composed
set of service i.e., services under composition, by analyzing reliability of
each participating service of composition with its functional work flow
process. FSM is exploited to measure the quality parameters. If any change
occurs in the business logic the FSM will automatically measure the
reliability.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2011 14:01:25 GMT'}]",2015-03-12,"[['M', 'Thirumaran.', ''], ['P', 'Dhavachelvan.', ''], ['Abarna', 'S.', ''], ['P', 'Lakshmi.', '']]","['Business Process Management', 'Business Automation', 'Business Logic Model', 'Service Oriented Architecture']"
14620,1109.0689,Sandeep Pratap Singh,"Sandeep Pratap Singh, Shiv Shankar P.Shukla, Nitin Rakesh and Vipin
  Tyagi",Problem Reduction in Online Payment System Using Hybrid Model,,"International Journal of Managing Information Technology(IJMIT)
  August 2011, Volume 3, Number 3 ISSN : 0975-5586 (Online) ;0975-5926 (Print)",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online auction, shopping, electronic billing etc. all such types of
application involves problems of fraudulent transactions. Online fraud
occurrence and its detection is one of the challenging fields for web
development and online phantom transaction. As no-secure specification of
online frauds is in research database, so the techniques to evaluate and stop
them are also in study. We are providing an approach with Hidden Markov Model
(HMM) and mobile implicit authentication to find whether the user interacting
online is a fraud or not. We propose a model based on these approaches to
counter the occurred fraud and prevent the loss of the customer. Our technique
is more parameterized than traditional approaches and so,chances of detecting
legitimate user as a fraud will reduce.
","[{'version': 'v1', 'created': 'Sun, 4 Sep 2011 09:48:03 GMT'}]",2011-09-06,"[['Singh', 'Sandeep Pratap', ''], ['Shukla', 'Shiv Shankar P.', ''], ['Rakesh', 'Nitin', ''], ['Tyagi', 'Vipin', '']]","['HMM', 'online shopping', 'fraud detection', 'mobile authentication']"
14621,1501.05617,Mohamed Ali Mahjoub,"Mohamed Ali Mahjoub, Mohamed Mhiri","Unsupervised image segmentation by Global and local Criteria
  Optimization Based on Bayesian Networks","appears in International journal of robotics and imaging; volume 15,
  issue 1, januray 2015",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today Bayesian networks are more used in many areas of decision support and
image processing. In this way, our proposed approach uses Bayesian Network to
modelize the segmented image quality. This quality is calculated on a set of
attributes that represent local evaluation measures. The idea is to have these
local levels chosen in a way to be intersected into them to keep the overall
appearance of segmentation. The approach operates in two phases: the first
phase is to make an over-segmentation which gives superpixels card. In the
second phase, we model the superpixels by a Bayesian Network. To find the
segmented image with the best overall quality we used two approximate inference
methods, the first using ICM algorithm which is widely used in Markov Models
and a second is a recursive method called algorithm of model decomposition
based on max-product algorithm which is very popular in the recent works of
image segmentation. For our model, we have shown that the composition of these
two algorithms leads to good segmentation performance.
","[{'version': 'v1', 'created': 'Thu, 22 Jan 2015 20:04:20 GMT'}]",2015-01-23,"[['Mahjoub', 'Mohamed Ali', ''], ['Mhiri', 'Mohamed', '']]","['Image segmentation', 'Probabilistic segmentation', 'Bayesian Network', 'Superpixel', 'ICM', 'Max-product algorithms']"
14622,1510.00229,Yongzhi Cao,"Jiannan Yang, Hanpin Wang, and Yongzhi Cao","Making problems tractable on big data via preprocessing with
  polylog-size output","16 pages, 2 figures",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To provide a dichotomy between those queries that can be made feasible on big
data after appropriate preprocessing and those for which preprocessing does not
help, Fan et al. developed the $\sqcap$-tractability theory. This theory
provides a formal foundation for understanding the tractability of query
classes in the context of big data. Along this line, we introduce a novel
notion of $\sqcap'$-tractability in this paper. Inspired by some technologies
used to deal big data, we place a restriction on preprocessing function, which
limits the function to produce a relatively small database as output, at most
polylog-size of the input database. At the same time, we bound the redundancy
information when re-factorizing data and queries for preprocessing. These
changes aim to make our theory more closely linked to practice. We set two
complexity classes to denote the classes of Boolean queries that are
$\sqcap'$-tractable themselves and that can be made $\sqcap'$-tractable,
respectively. Based on a new factorization in our complexity classes, we
investigate two reductions, which differ from whether allowing re-factorizing
data and query parts. We verify the transitive and compatible properties of the
reductions and analysis the complete problems and sizes of the complexity
classes. We conclude that all PTIME classes of Boolean queries can be made
$\sqcap'$-tractable, similar to that of the $\sqcap$-tractability theory. With
a little surprise, we prove that the set of all $\sqcap'$-tractable queries is
strictly smaller than that of all $\sqcap$-tractable queries, and thus the set
of $\sqcap'$-tractable queries is properly contained in that of PTIME queries.
In this way, we attain a new complexity class inside the complexity class of
PTIME queries.
","[{'version': 'v1', 'created': 'Thu, 1 Oct 2015 13:43:24 GMT'}]",2015-10-02,"[['Yang', 'Jiannan', ''], ['Wang', 'Hanpin', ''], ['Cao', 'Yongzhi', '']]","['Big data', 'complexity class', 'preprocessing', 'query', 'tractability']"
14623,0709.3587,Fabrice Rossi,"A\""icha El Golli (INRIA Rocquencourt / INRIA Sophia Antipolis), Brieuc
  Conan-Guez (INRIA Rocquencourt / INRIA Sophia Antipolis), Fabrice Rossi
  (INRIA Rocquencourt / INRIA Sophia Antipolis)",Self-organizing maps and symbolic data,,"Journal of Symbolic Data Analysis 2, 1 (2004)",,,cs.NE cs.LG,,"  In data analysis new forms of complex data have to be considered like for
example (symbolic data, functional data, web data, trees, SQL query and
multimedia data, ...). In this context classical data analysis for knowledge
discovery based on calculating the center of gravity can not be used because
input are not $\mathbb{R}^p$ vectors. In this paper, we present an application
on real world symbolic data using the self-organizing map. To this end, we
propose an extension of the self-organizing map that can handle symbolic data.
","[{'version': 'v1', 'created': 'Sat, 22 Sep 2007 15:54:37 GMT'}]",2007-09-25,"[['Golli', 'Aïcha El', '', 'INRIA Rocquencourt / INRIA Sophia Antipolis'], ['Conan-Guez', 'Brieuc', '', 'INRIA Rocquencourt / INRIA Sophia Antipolis'], ['Rossi', 'Fabrice', '', 'INRIA Rocquencourt / INRIA Sophia Antipolis']]","['Classification', 'Self organizing map', 'symbolic data', 'dissimilarity']"
14624,1002.2418,Rdv Ijcsis,"S. M. Ramesh, A. Shanmugam","Medical Image Compression using Wavelet Decomposition for Prediction
  Method","IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS January 2010, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 7, No. 1, pp. 262-265, January 2010, USA",,"Journal of Computer Science, ISSN 1947 5500",cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper offers a simple and lossless compression method for compression
of medical images. Method is based on wavelet decomposition of the medical
images followed by the correlation analysis of coefficients. The correlation
analyses are the basis of prediction equation for each sub band. Predictor
variable selection is performed through coefficient graphic method to avoid
multicollinearity problem and to achieve high prediction accuracy and
compression rate. The method is applied on MRI and CT images. Results show that
the proposed approach gives a high compression rate for MRI and CT images
comparing with state of the art methods.
","[{'version': 'v1', 'created': 'Thu, 11 Feb 2010 20:16:33 GMT'}]",2010-02-12,"[['Ramesh', 'S. M.', ''], ['Shanmugam', 'A.', '']]","['Correlation coefficient', 'Selection of predictor', 'Variable', 'DPCM', 'Arithmetic coding']"
14625,1704.03520,Niek Tax,Felix Mannhardt and Niek Tax,"Unsupervised Event Abstraction using Pattern Abstraction and Local
  Process Models","Accepted at Enabling Business Transformation by Business Process
  Modeling, Development, and Support Working Conference 2017 (BPMDS)",,,,cs.DB cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Process mining analyzes business processes based on events stored in event
logs. However, some recorded events may correspond to activities on a very low
level of abstraction. When events are recorded on a too low level of
granularity, process discovery methods tend to generate overgeneralizing
process models. Grouping low-level events to higher level activities, i.e.,
event abstraction, can be used to discover better process models. Existing
event abstraction methods are mainly based on common sub-sequences and
clustering techniques. In this paper, we propose to first discover local
process models and then use those models to lift the event log to a higher
level of abstraction. Our conjecture is that process models discovered on the
obtained high-level event log return process models of higher quality: their
fitness and precision scores are more balanced. We show this with preliminary
results on several real-life event logs.
","[{'version': 'v1', 'created': 'Tue, 11 Apr 2017 20:08:14 GMT'}, {'version': 'v2', 'created': 'Tue, 16 May 2017 16:48:18 GMT'}]",2017-05-17,"[['Mannhardt', 'Felix', ''], ['Tax', 'Niek', '']]","['Process Discovery', 'Unsupervised Learning', 'Event Abstraction']"
14626,1504.01995,Noah Stephens-Davidowitz,"Divesh Aggarwal, Daniel Dadush, Noah Stephens-Davidowitz","Solving the Closest Vector Problem in $2^n$ Time--- The Discrete
  Gaussian Strikes Again!",,FOCS 2015,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give a $2^{n+o(n)}$-time and space randomized algorithm for solving the
exact Closest Vector Problem (CVP) on $n$-dimensional Euclidean lattices. This
improves on the previous fastest algorithm, the deterministic
$\widetilde{O}(4^{n})$-time and $\widetilde{O}(2^{n})$-space algorithm of
Micciancio and Voulgaris.
  We achieve our main result in three steps. First, we show how to modify the
sampling algorithm from [ADRS15] to solve the problem of discrete Gaussian
sampling over lattice shifts, $L- t$, with very low parameters. While the
actual algorithm is a natural generalization of [ADRS15], the analysis uses
substantial new ideas. This yields a $2^{n+o(n)}$-time algorithm for
approximate CVP for any approximation factor $\gamma = 1+2^{-o(n/\log n)}$.
Second, we show that the approximate closest vectors to a target vector $t$ can
be grouped into ""lower-dimensional clusters,"" and we use this to obtain a
recursive reduction from exact CVP to a variant of approximate CVP that
""behaves well with these clusters."" Third, we show that our discrete Gaussian
sampling algorithm can be used to solve this variant of approximate CVP.
  The analysis depends crucially on some new properties of the discrete
Gaussian distribution and approximate closest vectors, which might be of
independent interest.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2015 14:54:39 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Sep 2015 03:29:12 GMT'}]",2019-01-28,"[['Aggarwal', 'Divesh', ''], ['Dadush', 'Daniel', ''], ['Stephens-Davidowitz', 'Noah', '']]","['Discrete Gaussian', 'Closest Vector Problem', 'Lattice Problems']"
14627,1702.05821,Will Radford,"Bo Han, Will Radford, Ana\""is Cadilhac, Art Harol, Andrew Chisholm,
  Ben Hachey",Post-edit Analysis of Collective Biography Generation,,,,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Text generation is increasingly common but often requires manual post-editing
where high precision is critical to end users. However, manual editing is
expensive so we want to ensure this effort is focused on high-value tasks. And
we want to maintain stylistic consistency, a particular challenge in crowd
settings. We present a case study, analysing human post-editing in the context
of a template-based biography generation system. An edit flow visualisation
combined with manual characterisation of edits helps identify and prioritise
work for improving end-to-end efficiency and accuracy.
","[{'version': 'v1', 'created': 'Mon, 20 Feb 2017 00:23:06 GMT'}]",2017-02-21,"[['Han', 'Bo', ''], ['Radford', 'Will', ''], ['Cadilhac', 'Anaïs', ''], ['Harol', 'Art', ''], ['Chisholm', 'Andrew', ''], ['Hachey', 'Ben', '']]","['Text Generation', 'Collective Intelligence', 'Evaluation']"
14628,1504.03306,Angeliki Rapti,"Angeliki Rapti, Kostas Tsichlas, Spiros Sioutas, Giannis Tzimas",Virus Propagation in Multiple Profile Networks,,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Suppose we have a virus or one competing idea/product that propagates over a
multiple profile (e.g., social) network. Can we predict what proportion of the
network will actually get ""infected"" (e.g., spread the idea or buy the
competing product), when the nodes of the network appear to have different
sensitivity based on their profile? For example, if there are two profiles
$\mathcal{A}$ and $\mathcal{B}$ in a network and the nodes of profile
$\mathcal{A}$ and profile $\mathcal{B}$ are susceptible to a highly spreading
virus with probabilities $\beta_{\mathcal{A}}$ and $\beta_{\mathcal{B}}$
respectively, what percentage of both profiles will actually get infected from
the virus at the end? To reverse the question, what are the necessary
conditions so that a predefined percentage of the network is infected? We
assume that nodes of different profiles can infect one another and we prove
that under realistic conditions, apart from the weak profile (great
sensitivity), the stronger profile (low sensitivity) will get infected as well.
First, we focus on cliques with the goal to provide exact theoretical results
as well as to get some intuition as to how a virus affects such a multiple
profile network. Then, we move to the theoretical analysis of arbitrary
networks. We provide bounds on certain properties of the network based on the
probabilities of infection of each node in it when it reaches the steady state.
Finally, we provide extensive experimental results that verify our theoretical
results and at the same time provide more insight on the problem.
","[{'version': 'v1', 'created': 'Mon, 13 Apr 2015 19:29:03 GMT'}]",2015-04-14,"[['Rapti', 'Angeliki', ''], ['Tsichlas', 'Kostas', ''], ['Sioutas', 'Spiros', ''], ['Tzimas', 'Giannis', '']]","['Epidemics', 'Virus Propagation', 'Profiles']"
14629,1701.05616,Mingchen Gao Mingchen Gao,"Mingchen Gao, Ziyue Xu, Le Lu, Adam P. Harrison, Ronald M. Summers,
  Daniel J. Mollura","Holistic Interstitial Lung Disease Detection using Deep Convolutional
  Neural Networks: Multi-label Learning and Unordered Pooling",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurately predicting and detecting interstitial lung disease (ILD) patterns
given any computed tomography (CT) slice without any pre-processing
prerequisites, such as manually delineated regions of interest (ROIs), is a
clinically desirable, yet challenging goal. The majority of existing work
relies on manually-provided ILD ROIs to extract sampled 2D image patches from
CT slices and, from there, performs patch-based ILD categorization. Acquiring
manual ROIs is labor intensive and serves as a bottleneck towards
fully-automated CT imaging ILD screening over large-scale populations.
Furthermore, despite the considerable high frequency of more than one ILD
pattern on a single CT slice, previous works are only designed to detect one
ILD pattern per slice or patch.
  To tackle these two critical challenges, we present multi-label deep
convolutional neural networks (CNNs) for detecting ILDs from holistic CT slices
(instead of ROIs or sub-images). Conventional single-labeled CNN models can be
augmented to cope with the possible presence of multiple ILD pattern labels,
via 1) continuous-valued deep regression based robust norm loss functions or 2)
a categorical objective as the sum of element-wise binary logistic losses. Our
methods are evaluated and validated using a publicly available database of 658
patient CT scans under five-fold cross-validation, achieving promising
performance on detecting four major ILD patterns: Ground Glass, Reticular,
Honeycomb, and Emphysema. We also investigate the effectiveness of a CNN
activation-based deep-feature encoding scheme using Fisher vector encoding,
which treats ILD detection as spatially-unordered deep texture classification.
","[{'version': 'v1', 'created': 'Thu, 19 Jan 2017 21:52:21 GMT'}]",2017-01-23,"[['Gao', 'Mingchen', ''], ['Xu', 'Ziyue', ''], ['Lu', 'Le', ''], ['Harrison', 'Adam P.', ''], ['Summers', 'Ronald M.', ''], ['Mollura', 'Daniel J.', '']]","['Interstitial Lung Disease Detection', 'Convolutional NeuralNetwork', 'Multi-label Deep Regression', 'Unordered Pooling', 'Fisher VectorEncoding']"
14630,1407.1584,Hadi Hosseini,"Hadi Hosseini, Jesse Hoey, Robin Cohen","A Coordinated MDP Approach to Multi-Agent Planning for Resource
  Allocation, with Applications to Healthcare",6 pages,,,,cs.AI cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers a novel approach to scalable multiagent resource
allocation in dynamic settings. We propose an approximate solution in which
each resource consumer is represented by an independent MDP-based agent that
models expected utility using an average model of its expected access to
resources given only limited information about all other agents. A global
auction-based mechanism is proposed for allocations based on expected regret.
We assume truthful bidding and a cooperative coordination mechanism, as we are
considering healthcare scenarios. We illustrate the performance of our
coordinated MDP approach against a Monte-Carlo based planning algorithm
intended for large-scale applications, as well as other approaches suitable for
allocating medical resources. The evaluations show that the global utility
value across all consumer agents is closer to optimal when using our algorithms
under certain time constraints, with low computational cost. As such, we offer
a promising approach for addressing complex resource allocation problems that
arise in healthcare settings.
","[{'version': 'v1', 'created': 'Mon, 7 Jul 2014 05:07:59 GMT'}]",2014-07-08,"[['Hosseini', 'Hadi', ''], ['Hoey', 'Jesse', ''], ['Cohen', 'Robin', '']]","['Multiagent Planning', 'Multiagent MDP', 'Healthcare Applications']"
14631,1307.1024,Abdelhakim Herrouz,"Abdelhakim Herrouz, Chabane Khentout and Mahieddine Djoudi",Overview of Web Content Mining Tools,06 pages,"The International Journal of Engineering And Science (IJES),
  Vol.2, Issue 6, June 2013, pp. 106-110, 2013",,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, the Web has become one of the most widespread platforms for
information change and retrieval. As it becomes easier to publish documents, as
the number of users, and thus publishers, increases and as the number of
documents grows, searching for information is turning into a cumbersome and
time-consuming operation. Due to heterogeneity and unstructured nature of the
data available on the WWW, Web mining uses various data mining techniques to
discover useful knowledge from Web hyperlinks, page content and usage log. The
main uses of web content mining are to gather, categorize, organize and provide
the best possible information available on the Web to the user requesting the
information. The mining tools are imperative to scanning the many HTML
documents, images, and text. Then, the result is used by the search engines. In
this paper, we first introduce the concepts related to web mining; we then
present an overview of different Web Content Mining tools. We conclude by
presenting a comparative table of these tools based on some pertinent criteria.
","[{'version': 'v1', 'created': 'Tue, 2 Jul 2013 19:57:29 GMT'}]",2013-07-04,"[['Herrouz', 'Abdelhakim', ''], ['Khentout', 'Chabane', ''], ['Djoudi', 'Mahieddine', '']]","['Structured Data Tools', 'Web', 'Web Content Mining', 'Web Mining']"
14632,0906.3410,Christian Spagnol,"Christian Spagnol, Marta Rossi, Massimiliano Sala",Quasi-cyclic LDPC codes with high girth,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study a class of quasi-cyclic LDPC codes. We provide precise conditions
guaranteeing high girth in their Tanner graph. Experimentally, the codes we
propose perform no worse than random LDPC codes with their same parameters,
which is a significant achievement for algebraic codes.
","[{'version': 'v1', 'created': 'Thu, 18 Jun 2009 11:28:40 GMT'}]",2009-06-19,"[['Spagnol', 'Christian', ''], ['Rossi', 'Marta', ''], ['Sala', 'Massimiliano', '']]","['LDPC codes', 'quasi-cyclic codes', 'Tanner graph']"
14633,1704.06622,Gregory Gutin,"Gregory Gutin, M. S. Ramanujan, Felix Reidl, and Magnus Wahlstr\""om","Path-contractions, edge deletions and connectivity preservation",,,,,cs.DS cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study several problems related to graph modification problems under
connectivity constraints from the perspective of parameterized complexity: {\sc
(Weighted) Biconnectivity Deletion}, where we are tasked with deleting~$k$
edges while preserving biconnectivity in an undirected graph, {\sc
Vertex-deletion Preserving Strong Connectivity}, where we want to maintain
strong connectivity of a digraph while deleting exactly~$k$ vertices, and {\sc
Path-contraction Preserving Strong Connectivity}, in which the operation of
path contraction on arcs is used instead. The parameterized tractability of
this last problem was posed by Bang-Jensen and Yeo [DAM 2008] as an open
question and we answer it here in the negative: both variants of preserving
strong connectivity are $\sf W[1]$-hard. Preserving biconnectivity, on the
other hand, turns out to be fixed parameter tractable and we provide a
$2^{O(k\log k)} n^{O(1)}$-algorithm that solves {\sc Weighted Biconnectivity
Deletion}. Further, we show that the unweighted case even admits a randomized
polynomial kernel. All our results provide further interesting data points for
the systematic study of connectivity-preservation constraints in the
parameterized setting.
","[{'version': 'v1', 'created': 'Fri, 21 Apr 2017 16:34:42 GMT'}]",2017-04-24,"[['Gutin', 'Gregory', ''], ['Ramanujan', 'M. S.', ''], ['Reidl', 'Felix', ''], ['Wahlström', 'Magnus', '']]","['connectivity', 'strong connectivity', 'vertex deletion', 'arc contraction']"
14634,1407.8132,Madhumangal Pal Dr.,"Sambhu Charan Barman, Sukumar Mondal and Madhumangal Pal",Computation of a Tree 3-Spanner on Trapezoid Graphs,16 pages,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a graph, a spanning tree is said to be a tree t-spanner of the graph if
the distance between any two vertices in is at most times their distance in .
The tree t-spanner has many applications in networks and distributed
environments. In this paper, an algorithm is presented to find a tree -spanner
on trapezoid graphs in time, where is the number of vertices of the graph.
","[{'version': 'v1', 'created': 'Wed, 30 Jul 2014 17:27:29 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Aug 2014 16:35:58 GMT'}]",2014-08-12,"[['Barman', 'Sambhu Charan', ''], ['Mondal', 'Sukumar', ''], ['Pal', 'Madhumangal', '']]","['Design of algorithms', 'analysis of algorithms', 'shortest paths', 't-spanner', 'tree t-spanner', 'trapezoid graphs']"
14635,1306.0018,Peter Breuer,Peter T. Breuer and Jonathan P. Bowen,An Open Question on the Uniqueness of (Encrypted) Arithmetic,"Withdrawn by authors after acceptance for ICCS 2013 (one of the
  conjectures that appears in the text was disproved by the authors after
  submission); 9 pages",,,,cs.CR cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We ask whether two or more images of arithmetic may inhabit the same space
via different encodings. The answers have significance for a class of processor
design that does all its computation in an encrypted form, without ever
performing any decryption or encryption itself. Against the possibility of
algebraic attacks against the arithmetic in a `crypto-processor' (KPU) we
propose a defence called `ABC encryption' and show how this kind of encryption
makes it impossible for observations of the arithmetic to be used by an
attacker to discover the actual values. We also show how to construct such
encrypted arithmetics.
","[{'version': 'v1', 'created': 'Fri, 31 May 2013 20:07:11 GMT'}]",2013-06-04,"[['Breuer', 'Peter T.', ''], ['Bowen', 'Jonathan P.', '']]","['arithmetic', 'cipherspace', 'crypto-processor', 'encryption', 'processor design']"
14636,1704.07285,Khanh Nguyen Gia,"K. Nguyen, J.M. Goicolea","Analytical and simplified models for dynamic analysis of short skew
  bridges under moving loads",,,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Skew bridges are common in highways and railway lines when non perpendicular
crossings are encountered. The structural effect of skewness is an additional
torsion on the bridge deck which may have a considerable effect, making its
analysis and design more complex. In this paper, an analytical model following
3D beam theory is firstly derived in order to evaluate the dynamic response of
skew bridges under moving loads. Following, a simplified 2D model is also
considered which includes only vertical beam bending. The natural frequencies,
eigenmodes and orthogonality relationships are determined from the boundary
conditions. The dynamic response is determined in time domain by using the
""exact'"" integration. Both models are validated through some numerical examples
by comparing with the results obtained by 3D FE models. A parametric study is
performed with the simplified model in order to identify parameters that
significantly influence the vertical dynamic response of the skew bridge under
traffic loads. The results show that the grade of skewness has an important
influence on the vertical displacement, but hardly on the vertical acceleration
of the bridge. The torsional stiffness really has effect on the vertical
displacement when the skew angle is large. The span length reduces the skewness
effect on the dynamic behavior of the skew bridge.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 15:29:58 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Feb 2018 17:05:02 GMT'}]",2018-02-13,"[['Nguyen', 'K.', ''], ['Goicolea', 'J. M.', '']]","['skew bridge', 'bridge modelling', 'modal analysis', 'moving load']"
14637,0711.3183,Narad Rampersad,"Terry Anderson, John Loftus, Narad Rampersad, Nicolae Santean, Jeffrey
  Shallit","Detecting palindromes, patterns, and borders in regular languages","Full version of a paper submitted to LATA 2008. This is a new version
  with John Loftus added as a co-author and containing new results on
  unbordered words",,,,cs.CC cs.DM cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a language L and a nondeterministic finite automaton M, we consider
whether we can determine efficiently (in the size of M) if M accepts at least
one word in L, or infinitely many words. Given that M accepts at least one word
in L, we consider how long a shortest word can be. The languages L that we
examine include the palindromes, the non-palindromes, the k-powers, the
non-k-powers, the powers, the non-powers (also called primitive words), the
words matching a general pattern, the bordered words, and the unbordered words.
","[{'version': 'v1', 'created': 'Tue, 20 Nov 2007 17:38:47 GMT'}, {'version': 'v2', 'created': 'Mon, 9 Jun 2008 14:25:57 GMT'}]",2009-04-14,"[['Anderson', 'Terry', ''], ['Loftus', 'John', ''], ['Rampersad', 'Narad', ''], ['Santean', 'Nicolae', ''], ['Shallit', 'Jeffrey', '']]","['palindrome', 'k-power', 'primitive word', 'pattern', 'bordered word']"
14638,1606.04553,Reza Arablouei,Reza Arablouei,"Fast Reconstruction Algorithm for Perturbed Compressive Sensing Based on
  Total Least-Squares and Proximal Splitting",,,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of finding a sparse solution for an underdetermined
linear system of equations when the known parameters on both sides of the
system are subject to perturbation. This problem is particularly relevant to
reconstruction in fully-perturbed compressive-sensing setups where both the
projected measurements of an unknown sparse vector and the knowledge of the
associated projection matrix are perturbed due to noise, error, mismatch, etc.
We propose a new iterative algorithm for tackling this problem. The proposed
algorithm utilizes the proximal-gradient method to find a sparse total
least-squares solution by minimizing an l1-regularized Rayleigh-quotient cost
function. We determine the step-size of the algorithm at each iteration using
an adaptive rule accompanied by backtracking line search to improve the
algorithm's convergence speed and preserve its stability. The proposed
algorithm is considerably faster than a popular previously-proposed algorithm,
which employs the alternating-direction method and coordinate-descent
iterations, as it requires significantly fewer computations to deliver the same
accuracy. We demonstrate the effectiveness of the proposed algorithm via
simulation results.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2016 20:30:19 GMT'}]",2016-06-16,"[['Arablouei', 'Reza', '']]","['Non-convex optimization', 'perturbed compressive sensing', 'proximal-gradient method', 'Rayleigh']"
14639,1403.0804,Mehdi Samadieh,Mehdi Samadieh and Mohammad Gholamiy,Double Cylinder Cycle codes of Arbitrary Girth,"e.g.: 10 pages, 5 figures",,,,cs.IT cs.DM math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A particular class of low-density parity-check codes referred to as
cylinder-type BC-LDPC codes is proposed by Gholami and Eesmaeili. In this paper
We represent a double cylinder-type parity-check matrix H by a graph called the
block-structure graph of H and denoted by BSG(H). Using the properties of
BSG(H) we propose some mother matrices with column-weight two such that the
rate of corresponding cycle codes are greater tan cycle codes constructed by
Gholami with same girth.
","[{'version': 'v1', 'created': 'Mon, 10 Feb 2014 11:57:56 GMT'}]",2014-03-05,"[['Samadieh', 'Mehdi', ''], ['Gholamiy', 'Mohammad', '']]","['LDPC codes', 'tanner graph', 'girth', 'closed walk']"
14640,1501.00680,Ricardo Monge,Osvaldo Skliar and Ricardo E. Monge and Sherry Gapper,A New Method for Signal and Image Analysis: The Square Wave Method,,,,,cs.NA cs.CV math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A brief review is provided of the use of the Square Wave Method (SWM) in the
field of signal and image analysis and it is specified how results thus
obtained are expressed using the Square Wave Transform (SWT), in the frequency
domain. To illustrate the new approach introduced in this field, the results of
two cases are analyzed: a) a sequence of samples (that is, measured values) of
an electromyographic recording; and b) the classic image of Lenna.
","[{'version': 'v1', 'created': 'Sun, 4 Jan 2015 14:35:58 GMT'}]",2015-01-06,"[['Skliar', 'Osvaldo', ''], ['Monge', 'Ricardo E.', ''], ['Gapper', 'Sherry', '']]","['signal and image analysis', 'Square Wave Method (SWM)', 'SquareWave Transform (SWT)']"
14641,1701.06270,Xiaodong Wu,"Xiaodong Wu, Lyn Bartram, Chris Shaw","Plexus: An Interactive Visualization Tool for Analyzing Public Emotions
  from Twitter Data","5 Pages, Conference ready",,,,cs.HC cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media is often used by researchers as an approach to obtaining
real-time data on people's activities and thoughts. Twitter, as one of the most
popular social networking services nowadays, provides copious information
streams on various topics and events. Mining and analyzing Tweets enable us to
find public reactions and emotions to activities or objects. This paper
presents an interactive visualization tool that identifies and visualizes
people's emotions on any two related topics by streaming and processing data
from Twitter. The effectiveness of this visualization was evaluated and
demonstrated by a feasibility study with 14 participants.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2017 05:45:55 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Jan 2017 19:24:11 GMT'}]",2017-01-26,"[['Wu', 'Xiaodong', ''], ['Bartram', 'Lyn', ''], ['Shaw', 'Chris', '']]","['Social media', 'Visualization', 'Affective Computing', 'Visual analytics', 'User interfaces']"
14642,1606.07256,Jenny Benois-Pineau,"Philippe P\'erez de San Roman, Jenny Benois-Pineau, Jean-Philippe
  Domenger, Florent Paclet, Daniel Cataert, Aymar de Rugy",Saliency Driven Object recognition in egocentric videos with deep CNN,"20 pages, 8 figures, 3 tables, Submitted to the Journal of Computer
  Vision and Image Understanding",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of object recognition in natural scenes has been recently
successfully addressed with Deep Convolutional Neuronal Networks giving a
significant break-through in recognition scores. The computational efficiency
of Deep CNNs as a function of their depth, allows for their use in real-time
applications. One of the key issues here is to reduce the number of windows
selected from images to be submitted to a Deep CNN. This is usually solved by
preliminary segmentation and selection of specific windows, having outstanding
""objectiveness"" or other value of indicators of possible location of objects.
In this paper we propose a Deep CNN approach and the general framework for
recognition of objects in a real-time scenario and in an egocentric
perspective. Here the window of interest is built on the basis of visual
attention map computed over gaze fixations measured by a glass-worn
eye-tracker. The application of this set-up is an interactive user-friendly
environment for upper-limb amputees. Vision has to help the subject to control
his worn neuro-prosthesis in case of a small amount of remaining muscles when
the EMG control becomes unefficient. The recognition results on a specifically
recorded corpus of 151 videos with simple geometrical objects show the mAP of
64,6\% and the computational time at the generalization lower than a time of a
visual fixation on the object-of-interest.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2016 10:10:31 GMT'}]",2016-06-24,"[['Roman', 'Philippe Pérez de San', ''], ['Benois-Pineau', 'Jenny', ''], ['Domenger', 'Jean-Philippe', ''], ['Paclet', 'Florent', ''], ['Cataert', 'Daniel', ''], ['de Rugy', 'Aymar', '']]","['Psycho-visual attention', 'Saliency', 'Egocentric video', 'Objectrecognition', 'Deep Convolutional Neural Networks']"
14643,1205.5443,Youngchul Sung,"Donggun Kim, Junyeong Seo and Youngchul Sung",Filter-and-Forward Transparent Relay Design for OFDM Systems,"Changes from the 1st version: Rate maximization and practical issues
  such as channel state information acquisition are considered in the new
  version. To appear in IEEE Trans. Vehicular Technology",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the filter-and-forward (FF) relay design for orthogonal
frequency-division multiplexing (OFDM) transmission systems is considered to
improve the system performance over simple amplify-and-forward (AF) relaying.
Unlike conventional OFDM relays performing OFDM demodulation and remodulation,
to reduce processing complexity, the proposed FF relay directly filters the
incoming signal in time domain with a finite impulse response (FIR) and
forwards the filtered signal to the destination. Three design criteria are
considered to optimize the relay filter. The first criterion is the
minimization of the relay transmit power subject to per-subcarrier
signal-to-noise ratio (SNR) constraints, the second is the maximization of the
worst subcarrier channel SNR subject to source and relay transmit power
constraints, and the third is the maximization of data rate subject to source
and relay transmit power constraints. It is shown that the first problem
reduces to a semi-definite programming (SDP) problem by semi-definite
relaxation and the solution to the relaxed SDP problem has rank one under a
mild condition. For the latter two problems, the problem of joint source power
allocation and relay filter design is considered and an efficient algorithm is
proposed for each problem based on alternating optimization and the projected
gradient method (PGM). Numerical results show that the proposed FF relay
significantly outperforms simple AF relays with insignificant increase in
complexity. Thus, the proposed FF relay provides a practical alternative to the
AF relaying scheme for OFDM transmission.
","[{'version': 'v1', 'created': 'Thu, 24 May 2012 13:45:36 GMT'}, {'version': 'v2', 'created': 'Thu, 16 May 2013 15:29:05 GMT'}]",2015-03-20,"[['Kim', 'Donggun', ''], ['Seo', 'Junyeong', ''], ['Sung', 'Youngchul', '']]","['Linear relay', 'filter-and-forward', 'amplify-and-forward', 'OFDM systems', 'semi-definite programming']"
14644,1607.03222,Yipei Wang,"Yan Xu, Yang Li, Mingyuan Liu, Yipei Wang, Maode Lai, Eric I-Chao
  Chang",Gland Instance Segmentation by Deep Multichannel Side Supervision,conditionally accepted at MICCAI 2016,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a new image instance segmentation method that
segments individual glands (instances) in colon histology images. This is a
task called instance segmentation that has recently become increasingly
important. The problem is challenging since not only do the glands need to be
segmented from the complex background, they are also required to be
individually identified. Here we leverage the idea of image-to-image prediction
in recent deep learning by building a framework that automatically exploits and
fuses complex multichannel information, regional and boundary patterns, with
side supervision (deep supervision on side responses) in gland histology
images. Our proposed system, deep multichannel side supervision (DMCS),
alleviates heavy feature design due to the use of convolutional neural networks
guided by side supervision. Compared to methods reported in the 2015 MICCAI
Gland Segmentation Challenge, we observe state-of-the-art results based on a
number of evaluation metrics.
","[{'version': 'v1', 'created': 'Tue, 12 Jul 2016 03:08:43 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Jul 2016 03:01:31 GMT'}]",2016-07-15,"[['Xu', 'Yan', ''], ['Li', 'Yang', ''], ['Liu', 'Mingyuan', ''], ['Wang', 'Yipei', ''], ['Lai', 'Maode', ''], ['Chang', 'Eric I-Chao', '']]","['Instance segmentation', 'fully convolutional neural networks', 'deep multichannel side supervision', 'histology image']"
14645,0802.0865,Andrew Gacek,"Andrew Gacek, Dale Miller, and Gopalan Nadathur",Combining generic judgments with recursive definitions,To appear in LICS 2008,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many semantical aspects of programming languages, such as their operational
semantics and their type assignment calculi, are specified by describing
appropriate proof systems. Recent research has identified two proof-theoretic
features that allow direct, logic-based reasoning about such descriptions: the
treatment of atomic judgments as fixed points (recursive definitions) and an
encoding of binding constructs via generic judgments. However, the logics
encompassing these two features have thus far treated them orthogonally: that
is, they do not provide the ability to define object-logic properties that
themselves depend on an intrinsic treatment of binding. We propose a new and
simple integration of these features within an intuitionistic logic enhanced
with induction over natural numbers and we show that the resulting logic is
consistent. The pivotal benefit of the integration is that it allows recursive
definitions to not just encode simple, traditional forms of atomic judgments
but also to capture generic properties pertaining to such judgments. The
usefulness of this logic is illustrated by showing how it can provide elegant
treatments of object-logic contexts that appear in proofs involving typing
calculi and of arbitrarily cascading substitutions that play a role in
reducibility arguments.
","[{'version': 'v1', 'created': 'Wed, 6 Feb 2008 19:18:57 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Apr 2008 13:25:42 GMT'}]",2008-04-14,"[['Gacek', 'Andrew', ''], ['Miller', 'Dale', ''], ['Nadathur', 'Gopalan', '']]","['generic judgments', 'higher-order abstract syntax', 'proof search', 'reasoning about operational semantics']"
14646,1011.0507,Manoj Kumar Taleja,"Manoj Kumar, Sandeep K. Arya, Sujata Pandey",Level Shifter Design for Low Power Applications,,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With scaling of Vt sub-threshold leakage power is increasing and expected to
become significant part of total power consumption In present work three new
configurations of level shifters for low power application in 0.35{\mu}m
technology have been presented. The proposed circuits utilize the merits of
stacking technique with smaller leakage current and reduction in leakage power.
Conventional level shifter has been improved by addition of three NMOS
transistors, which shows total power consumption of 402.2264pW as compared to
0.49833nW with existing circuit. Single supply level shifter has been modified
with addition of two NMOS transistors that gives total power consumption of
108.641pW as compared to 31.06nW. Another circuit, contention mitigated level
shifter (CMLS) with three additional transistors shows total power consumption
of 396.75pW as compared to 0.4937354nW. Three proposed circuit's shows better
performance in terms of power consumption with a little conciliation in delay.
Output level of 3.3V has been obtained with input pulse of 1.6V for all
proposed circuits.
","[{'version': 'v1', 'created': 'Tue, 2 Nov 2010 04:20:46 GMT'}]",2010-11-03,"[['Kumar', 'Manoj', ''], ['Arya', 'Sandeep K.', ''], ['Pandey', 'Sujata', '']]","['CMOS', 'delay', 'level shifter', 'power consumption', 'stacking technique']"
14647,1307.1271,Jorge Ma\~nana-Rodr\'iguez,"Elea Gimenez-Toledo, Jorge Manana-Rodriguez and Emilio
  Delgado-Lopez-Cozar",Quality indicators for scientific journals based on experts opinion,19 pages,,,,cs.DL stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the results and further development of a survey sent to
11,799 Spanish faculty members and researchers from various fields of the
social sciences and the humanities, obtaining a total of 45.6% (5,368
responses) usable answers. Respondents were asked (a) to indicate the three
most important journals in their field and (b) to rate them on a 0-10 scale
according to their quality. The information obtained has been synthesized in
two indicators which reflect the perceived quality of journals. Once the values
were obtained, the journals were categorized according to each indicator and
the ordinal positions were compared. Different profiles of journals are
analyzed in connection with experts opinion, such as regional orientation, and
the consensus among researchers is studied. Finally, the possibilities of
extending the research and indicators to sets of international journals are
explored.
","[{'version': 'v1', 'created': 'Thu, 4 Jul 2013 11:06:28 GMT'}]",2013-07-05,"[['Gimenez-Toledo', 'Elea', ''], ['Manana-Rodriguez', 'Jorge', ''], ['Delgado-Lopez-Cozar', 'Emilio', '']]","['journal quality', 'experts’ opinion', 'survey', 'humanities', 'social sciences']"
14648,1702.06298,Md Saiful Islam,"Md. Saiful Islam, Wenny Rahayu, Chengfei Liu, Tarique Anwar and Bela
  Stantic",Computing Influence of a Product through Uncertain Reverse Skyline,"12 pages, 3 tables, 12 figures, submitted to SSDBM 2017",,,,cs.DB cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding the influence of a product is crucially important for making
informed business decisions. This paper introduces a new type of skyline
queries, called uncertain reverse skyline, for measuring the influence of a
probabilistic product in uncertain data settings. More specifically, given a
dataset of probabilistic products P and a set of customers C, an uncertain
reverse skyline of a probabilistic product q retrieves all customers c in C
which include q as one of their preferred products. We present efficient
pruning ideas and techniques for processing the uncertain reverse skyline query
of a probabilistic product using R-Tree data index. We also present an
efficient parallel approach to compute the uncertain reverse skyline and
influence score of a probabilistic product. Our approach significantly
outperforms the baseline approach derived from the existing literature. The
efficiency of our approach is demonstrated by conducting extensive experiments
with both real and synthetic datasets.
","[{'version': 'v1', 'created': 'Tue, 21 Feb 2017 09:06:04 GMT'}]",2017-02-22,"[['Islam', 'Md. Saiful', ''], ['Rahayu', 'Wenny', ''], ['Liu', 'Chengfei', ''], ['Anwar', 'Tarique', ''], ['Stantic', 'Bela', '']]","['UD-Dominance', 'Uncertain Reverse Skyline', 'Query Processing Algorithms', 'Parallel Computing']"
14649,1406.3414,Huiwen Yu,"Martin Furer, Huiwen Yu",Space Saving by Dynamic Algebraization,"14 pages, 1 figure",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dynamic programming is widely used for exact computations based on tree
decompositions of graphs. However, the space complexity is usually exponential
in the treewidth. We study the problem of designing efficient dynamic
programming algorithm based on tree decompositions in polynomial space. We show
how to construct a tree decomposition and extend the algebraic techniques of
Lokshtanov and Nederlof such that the dynamic programming algorithm runs in
time $O^*(2^h)$, where $h$ is the maximum number of vertices in the union of
bags on the root to leaf paths on a given tree decomposition, which is a
parameter closely related to the tree-depth of a graph. We apply our algorithm
to the problem of counting perfect matchings on grids and show that it
outperforms other polynomial-space solutions. We also apply the algorithm to
other set covering and partitioning problems.
","[{'version': 'v1', 'created': 'Fri, 13 Jun 2014 04:14:52 GMT'}]",2014-06-16,"[['Furer', 'Martin', ''], ['Yu', 'Huiwen', '']]","['Dynamic programming', 'tree decomposition', 'space-efficient algorithm', 'exponential time algorithms', 'zeta transform']"
14650,1603.09396,Malihe Mardanpour,"Malihe Mardanpour, Mohammad Ali Zare Chahooki","Robust Hybrid Image Watermarking based on Discrete Wavelet and Shearlet
  Transforms",,,,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the growth of digital networks such as the Internet, digital media have
been explosively developed in e-commerce and online services. This causes
problems such as illegal copy and fake ownership. Watermarking is proposed as
one of the solutions to such cases. Among different watermarking techniques,
the wavelet transform has been used more because of its good ability in
modeling the human visual system. Recently, Shearlet transform as an extension
of Wavelet transform which is based on multi-resolution and multi-directional
analysis is introduced. The most important feature of this transform is the
appropriate representation of image edges. In this paper a hybrid scheme using
Discrete Wavelet Transform (DWT) and Discrete Shearlet Transform (DST) is
presented. In this way, the host image is decomposed using DWT, and then its
low frequency sub-band is decomposed by DST. After that, the bidiagonal
singular value decomposition (BSVD) is applied on the selected sub-band from
Shearlet transform and the gray-scale watermark image is embedded into its
bidiagonal singular values. The proposed method is examined on the images with
different textures and resistance is evaluated against various attacks like
image processing and geometric attacks. The results show good transparency and
high robustness in proposed method.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2016 22:03:19 GMT'}]",2016-04-02,"[['Mardanpour', 'Malihe', ''], ['Chahooki', 'Mohammad Ali Zare', '']]","['Image watermarking', 'Wavelet transform', 'Shearlet transform', 'Bidiagonal singular value decomposition (BSVD)']"
14651,1403.0770,Kieran Greer Dr,Kieran Greer,A Metric for Modelling and Measuring Complex Behavioural Systems,Published,"IOSR Journal of Engineering (IOSRJEN), Vol. 3, Issue 11, November
  2013, pp. 11 - 28",,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a metric for measuring the success of a complex system
composed of agents performing autonomous behaviours. Because of the difficulty
in evaluating such systems, this metric will help to give an initial indication
as to how suitable the agents would be for solving the problem. The system is
modelled as a script, or behavioural ontology, with a number of variables to
represent each of the behaviour attributes. The set of equations can be used
both for modeling and as part of the simulation evaluation. Behaviours can be
nested, allowing for compound behaviours of arbitrary complexity to be built.
There is also the capability for including rules or decision making into the
script. The paper also gives some test examples to show how the metric might be
used.
","[{'version': 'v1', 'created': 'Tue, 4 Mar 2014 12:56:56 GMT'}]",2014-03-05,"[['Greer', 'Kieran', '']]","['Autonomous Behaviour', 'Complex System', 'Modelling Script', 'Metric']"
14652,0708.3446,L.T. Handoko,Z. Akbar and L.T. Handoko,Multi and Independent Block Approach in Public Cluster,"3 pages, Proceeding of the 3rd Information and Communication
  Technology Seminar 2007",,,FISIKALIPI-07012,cs.DC,,"  We present extended multi block approach in the LIPI Public Cluster. The
multi block approach enables a cluster to be divided into several independent
blocks which run jobs owned by different users simultaneously. Previously, we
have maintained the blocks using single master node for all blocks due to
efficiency and resource limitations. Following recent advancements and
expansion of node\'s number, we have modified the multi block approach with
multiple master nodes, each of them is responsible for a single block. We argue
that this approach improves the overall performance significantly, for
especially data intensive computational works.
","[{'version': 'v1', 'created': 'Sat, 25 Aug 2007 19:46:52 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Sep 2007 21:22:23 GMT'}]",2011-11-10,"[['Akbar', 'Z.', ''], ['Handoko', 'L. T.', '']]","['cluster computer', 'resource allocation', 'multi block approach']"
14653,1511.05234,Huijuan Xu,Huijuan Xu and Kate Saenko,"Ask, Attend and Answer: Exploring Question-Guided Spatial Attention for
  Visual Question Answering",include test-standard result on VQA full release (V1.0) dataset,,,,cs.CV cs.AI cs.CL cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the problem of Visual Question Answering (VQA), which requires
joint image and language understanding to answer a question about a given
photograph. Recent approaches have applied deep image captioning methods based
on convolutional-recurrent networks to this problem, but have failed to model
spatial inference. To remedy this, we propose a model we call the Spatial
Memory Network and apply it to the VQA task. Memory networks are recurrent
neural networks with an explicit attention mechanism that selects certain parts
of the information stored in memory. Our Spatial Memory Network stores neuron
activations from different spatial regions of the image in its memory, and uses
the question to choose relevant regions for computing the answer, a process of
which constitutes a single ""hop"" in the network. We propose a novel spatial
attention architecture that aligns words with image patches in the first hop,
and obtain improved results by adding a second attention hop which considers
the whole question to choose visual evidence based on the results of the first
hop. To better understand the inference process learned by the network, we
design synthetic questions that specifically require spatial inference and
visualize the attention weights. We evaluate our model on two published visual
question answering datasets, DAQUAR [1] and VQA [2], and obtain improved
results compared to a strong deep baseline model (iBOWIMG) which concatenates
image and question features to predict the answer [3].
","[{'version': 'v1', 'created': 'Tue, 17 Nov 2015 01:00:04 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Mar 2016 03:06:58 GMT'}]",2016-03-22,"[['Xu', 'Huijuan', ''], ['Saenko', 'Kate', '']]","['Visual Question Answering', 'Spatial Attention', 'Memory Network', 'Deep Learning']"
14654,1206.1331,Seth Myers,"Seth A. Myers, Chenguang Zhu, Jure Leskovec",Information Diffusion and External Influence in Networks,,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social networks play a fundamental role in the diffusion of information.
However, there are two different ways of how information reaches a person in a
network. Information reaches us through connections in our social networks, as
well as through the influence of external out-of-network sources, like the
mainstream media. While most present models of information adoption in networks
assume information only passes from a node to node via the edges of the
underlying network, the recent availability of massive online social media data
allows us to study this process in more detail. We present a model in which
information can reach a node via the links of the social network or through the
influence of external sources. We then develop an efficient model parameter
fitting technique and apply the model to the emergence of URL mentions in the
Twitter network. Using a complete one month trace of Twitter we study how
information reaches the nodes of the network. We quantify the external
influences over time and describe how these influences affect the information
adoption. We discover that the information tends to ""jump"" across the network,
which can only be explained as an effect of an unobservable external influence
on the network. We find that only about 71% of the information volume in
Twitter can be attributed to network diffusion, and the remaining 29% is due to
external events and factors outside the network.
","[{'version': 'v1', 'created': 'Wed, 6 Jun 2012 20:02:04 GMT'}]",2012-06-08,"[['Myers', 'Seth A.', ''], ['Zhu', 'Chenguang', ''], ['Leskovec', 'Jure', '']]","['Diffusion of innovations', 'Information cascades', 'Information diffusion', 'External influence', 'Twitter', 'Social networks']"
14655,1505.02798,Richard Zanibbi,Richard Zanibbi and Awelemdy Orakwue,"Math Search for the Masses: Multimodal Search Interfaces and
  Appearance-Based Retrieval","Paper for Invited Talk at 2015 Conference on Intelligent Computer
  Mathematics (July, Washington DC)",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We summarize math search engines and search interfaces produced by the
Document and Pattern Recognition Lab in recent years, and in particular the min
math search interface and the Tangent search engine. Source code for both
systems are publicly available. ""The Masses"" refers to our emphasis on creating
systems for mathematical non-experts, who may be looking to define unfamiliar
notation, or browse documents based on the visual appearance of formulae rather
than their mathematical semantics.
","[{'version': 'v1', 'created': 'Mon, 11 May 2015 20:39:48 GMT'}]",2015-05-13,"[['Zanibbi', 'Richard', ''], ['Orakwue', 'Awelemdy', '']]","['Mathematical Information Retrieval (MIR)', 'User InterfaceDesign', 'Handwriting Recognition', 'Character Recognition']"
14656,1606.06730,Kaushik Sarkar,Kaushik Sarkar and Charles J. Colbourn,Two-stage algorithms for covering array construction,,,,,cs.DS cs.DM cs.SE math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern software systems often consist of many different components, each with
a number of options. Although unit tests may reveal faulty options for
individual components, functionally correct components may interact in
unforeseen ways to cause a fault. Covering arrays are used to test for
interactions among components systematically. A two-stage framework, providing
a number of concrete algorithms, is developed for the efficient construction of
covering arrays. %Our framework divides the construction in two stages. In the
first stage, a time and memory efficient randomized algorithm covers most of
the interactions. In the second stage, a more sophisticated search covers the
remainder in relatively few tests. In this way, the storage limitations of the
sophisticated search algorithms are avoided; hence the range of the number of
components for which the algorithm can be applied is extended, without
increasing the number of tests. Many of the framework instantiations can be
tuned to optimize a memory-quality trade-off, so that fewer tests can be
achieved using more memory. The algorithms developed outperform the currently
best known methods when the number of components ranges from 20 to 60, the
number of options for each ranges from 3 to 6, and $t$-way interactions are
covered for $t\in \{5,6\}$. In some cases a reduction in the number of tests by
more than $50\%$ is achieved.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2016 04:01:39 GMT'}]",2016-06-23,"[['Sarkar', 'Kaushik', ''], ['Colbourn', 'Charles J.', '']]","['Covering array', 'Software interaction testing', 'Combinatorial construction algorithm']"
14657,1109.5325,Dimitris Fotakis,Dimitris Fotakis and Paraschos Koutris,Online Sum-Radii Clustering,"Supported by the project AlgoNow, co-financed by the European Union
  (European Social Fund - ESF) and Greek national funds, through the
  Operational Program ""Education and Lifelong Learning"", under the research
  funding program THALES. An extended abstract of this work appeared in the
  Proc. of MFCS 2012, B. Rovan, V. Sassone, and P. Widmayer (Editors), LNCS
  7464, pp. 395-406, 2012",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Online Sum-Radii Clustering, n demand points arrive online and must be
irrevocably assigned to a cluster upon arrival. The cost of each cluster is the
sum of a fixed opening cost and its radius, and the objective is to minimize
the total cost of the clusters opened by the algorithm. We show that the
deterministic competitive ratio of Online Sum-Radii Clustering for general
metric spaces is \Theta(\log n), where the upper bound follows from a
primal-dual algorithm and holds for general metric spaces, and the lower bound
is valid for ternary Hierarchically Well-Separated Trees (HSTs) and for the
Euclidean plane. Combined with the results of (Csirik et al., MFCS 2010), this
result demonstrates that the deterministic competitive ratio of Online
Sum-Radii Clustering changes abruptly, from constant to logarithmic, when we
move from the line to the plane. We also show that Online Sum-Radii Clustering
in metric spaces induced by HSTs is closely related to the Parking Permit
problem introduced by (Meyerson, FOCS 2005). Exploiting the relation to Parking
Permit, we obtain a lower bound of \Omega(\log\log n) on the randomized
competitive ratio of Online Sum-Radii Clustering in tree metrics. Moreover, we
present a simple randomized O(\log n)-competitive algorithm, and a
deterministic O(\log\log n)-competitive algorithm for the fractional version of
the problem.
","[{'version': 'v1', 'created': 'Sun, 25 Sep 2011 06:08:37 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Feb 2013 12:24:41 GMT'}]",2015-03-19,"[['Fotakis', 'Dimitris', ''], ['Koutris', 'Paraschos', '']]","['Online Algorithms', 'Competitive Analysis', 'Sum-k-Radii Clustering']"
14658,1304.6393,Mostafa Haghir Chehreghani,Mostafa Haghir Chehreghani,Efficient Algorithms for Approximate Triangle Counting,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Counting the number of triangles in a graph has many important applications
in network analysis. Several frequently computed metrics like the clustering
coefficient and the transitivity ratio need to count the number of triangles in
the network. Furthermore, triangles are one of the most important graph classes
considered in network mining. In this paper, we present a new randomized
algorithm for approximate triangle counting. The algorithm can be adopted with
different sampling methods and give effective triangle counting methods. In
particular, we present two sampling methods, called the \textit{$q$-optimal
sampling} and the \textit{edge sampling}, which respectively give $O(sm)$ and
$O(sn)$ time algorithms with nice error bounds ($m$ and $n$ are respectively
the number of edges and vertices in the graph and $s$ is the number of
samples). Among others, we show, for example, that if an upper bound
$\widetilde{\Delta^e}$ is known for the number of triangles incident to every
edge, the proposed method provides an $1\pm \epsilon$ approximation which runs
in $O( \frac{\widetilde{\Delta^e} n \log n}{\widehat{\Delta^e} \epsilon^2} )$
time, where $\widehat{\Delta^e}$ is the average number of triangles incident to
an edge. Finally we show that the algorithm can be adopted with streams. Then
it, for example, will perform 2 passes over the data (if the size of the graph
is known, otherwise it needs 3 passes) and will use $O(sn)$ space.
","[{'version': 'v1', 'created': 'Tue, 23 Apr 2013 19:55:18 GMT'}]",2013-04-24,"[['Chehreghani', 'Mostafa Haghir', '']]","['Graphs', 'triangles', 'approximate algorithms', 'stream data', 'network analysis', 'complexity']"
14659,1410.3711,Youngchul Sung,"Junyeong Seo, Youngchul Sung, Gilwon Lee, and Donggun Kim","Training Beam Sequence Design for Millimeter-Wave MIMO Systems: A POMDP
  Framework","This paper is the journal version of the previous conference version
  submitted to ICC 2015",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, adaptive training beam sequence design for efficient channel
estimation in large millimeter-wave(mmWave) multiple-input multiple-output
(MIMO) channels is considered. By exploiting the sparsity in large mmWave MIMO
channels and imposing a Markovian random walk assumption on the movement of the
receiver and reflection clusters, the adaptive training beam sequence design
and channel estimation problem is formulated as a partially observableMarkov
decision process (POMDP) problem that finds non-zero bins in a two-dimensional
grid. Under the proposed POMDP framework, optimal and suboptimal adaptive
training beam sequence design policies are derived. Furthermore, a very fast
suboptimal greedy algorithm is developed based on a newly proposed reduced
sufficient statistic to make the computational complexity of the proposed
algorithm low to a level for practical implementation. Numerical results are
provided to evaluate the performance of the proposed training beam design
method. Numerical results show that the proposed training beam sequence design
algorithms yield good performance.
","[{'version': 'v1', 'created': 'Tue, 14 Oct 2014 14:39:22 GMT'}]",2014-10-15,"[['Seo', 'Junyeong', ''], ['Sung', 'Youngchul', ''], ['Lee', 'Gilwon', ''], ['Kim', 'Donggun', '']]","['Millimeter Wave', 'MIMO', 'Channel Estimation', 'Training Signal Design', 'POMDP']"
14660,1609.02423,Ido Polak,Ido Polak,The Incentive Ratio in Exchange Economies,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The incentive ratio measures the utility gains from strategic behaviour.
Without any restrictions on the setup, ratios for linear, Leontief and
Cobb-Douglas exchange markets are unbounded, showing that manipulating the
equilibrium is a worthwhile endeavour, even if it is computationally
challenging. Such unbounded improvements can be achieved even if agents only
misreport their utility functions. This provides a sharp contrast with previous
results from Fisher markets. When the Cobb-Douglas setup is more restrictive,
the maximum utility gain is bounded by the number of commodities. By means of
an example, we show that it is possible to exceed a known upper bound for
Fisher markets in exchange economies.
","[{'version': 'v1', 'created': 'Thu, 8 Sep 2016 13:36:18 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Sep 2016 09:24:07 GMT'}, {'version': 'v3', 'created': 'Tue, 20 Dec 2016 06:41:29 GMT'}, {'version': 'v4', 'created': 'Fri, 28 Apr 2017 12:54:10 GMT'}]",2017-05-01,"[['Polak', 'Ido', '']]","['incentive ratio', 'competitive equilibrium', 'equilibrium manipulation', 'utility function', 'exchange economy']"
14661,1607.03306,Enmei Tu,"Shangbo Mao, Enmei Tu, Guanghao Zhang, Lily Rachmawati, Eshan
  Rajabally, Guang-Bin Huang","An Automatic Identification System (AIS) Database for Maritime
  Trajectory Prediction and Data Mining",Accepted in ELM2016,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, maritime safety and efficiency become more and more
important across the world. Automatic Identification System (AIS) tracks vessel
movement by onboard transceiver and terrestrial and/or satellite base station.
The data collected by AIS contains broadcast kinematic information and static
information. Both of them are useful for anomaly detection and route prediction
which are key techniques in intelligent maritime research area. This paper is
devoted to construct a standard AIS database for maritime trajectory learning,
prediction and data mining. A path prediction algorithm is tested on this AIS
database and the testing results show this database can be used as a
standardized training resource for different trajectory prediction algorithms
and other AIS data mining algorithms.
","[{'version': 'v1', 'created': 'Tue, 12 Jul 2016 10:49:59 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Jul 2016 05:25:31 GMT'}, {'version': 'v3', 'created': 'Sun, 24 Jul 2016 07:27:31 GMT'}, {'version': 'v4', 'created': 'Thu, 13 Oct 2016 06:56:55 GMT'}]",2016-10-14,"[['Mao', 'Shangbo', ''], ['Tu', 'Enmei', ''], ['Zhang', 'Guanghao', ''], ['Rachmawati', 'Lily', ''], ['Rajabally', 'Eshan', ''], ['Huang', 'Guang-Bin', '']]","['Automatic Identification System (AIS) Database', 'Maritime Trajectory Learning', 'Data Mining']"
14662,1310.1166,Sander Verdonschot,"Prosenjit Bose, Anna Lubiw, Vinayak Pathak, Sander Verdonschot",Flipping Edge-Labelled Triangulations,Significantly expanded journal version,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Flips in triangulations have received a lot of attention over the past
decades. However, the problem of tracking where particular edges go during the
flipping process has not been addressed. We examine this question by attaching
unique labels to the triangulation edges. We introduce the concept of the orbit
of an edge $e$, which is the set of all edges reachable from $e$ via flips.
  We establish the first upper and lower bounds on the diameter of the flip
graph in this setting. Specifically, we prove tight $\Theta(n \log n)$ bounds
for edge-labelled triangulations of $n$-vertex convex polygons and
combinatorial triangulations, contrasting with the $\Theta(n)$ bounds in their
respective unlabelled settings. The $\Omega(n \log n)$ lower bound for the
convex polygon setting might be of independent interest, as it generalizes
lower bounds on certain sorting models. When simultaneous flips are allowed,
the upper bound for convex polygons decreases to $O(\log^2 n)$, although we no
longer have a matching lower bound.
  Moving beyond convex polygons, we show that edge-labelled triangulated
polygons with a single reflex vertex can have a disconnected flip graph. This
is in sharp contrast with the unlabelled case, where the flip graph is
connected for any triangulated polygon. For spiral polygons, we provide a
complete characterization of the orbits. This allows us to decide connectivity
of the flip graph of a spiral polygon in linear time. We also prove an upper
bound of $O(n^2)$ on the diameter of each connected component, which is optimal
in the worst case. We conclude with an example of a non-spiral polygon whose
flip graph has diameter $\Omega(n^3)$.
","[{'version': 'v1', 'created': 'Fri, 4 Oct 2013 04:56:03 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Mar 2016 19:42:57 GMT'}]",2016-03-07,"[['Bose', 'Prosenjit', ''], ['Lubiw', 'Anna', ''], ['Pathak', 'Vinayak', ''], ['Verdonschot', 'Sander', '']]","['Flip', 'Convex Polygon', 'Spiral Polygon', 'Quadrilateral Graph', 'SimultaneousFlip']"
14663,1109.0681,Gan Zheng,"Gan Zheng, Symeon Chatzinotas, and Bjorn Ottersten",Generic Optimization of Linear Precoding in Multibeam Satellite Systems,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multibeam satellite systems have been employed to provide interactive
broadband services to geographical areas under-served by terrestrial
infrastructure. In this context, this paper studies joint multiuser linear
precoding design in the forward link of fixed multibeam satellite systems. We
provide a generic optimization framework for linear precoding design to handle
any objective functions of data rate with general linear and nonlinear power
constraints. To achieve this, an iterative algorithm which optimizes the
precoding vectors and power allocation alternatingly is proposed and most
importantly, the proposed algorithm is proved to always converge. The proposed
optimization algorithm is also applicable to nonlinear dirty paper coding. In
addition, the aforementioned problems and algorithms are extended to the case
that each terminal has multiple co-polarization or dual-polarization antennas.
Simulation results demonstrate substantial performance improvement of the
proposed schemes over conventional multibeam satellite systems, zero-forcing
and regularized zero-forcing precoding schemes in terms of meeting the traffic
demand. The performance of the proposed linear precoding scheme is also shown
to be very close to the dirty paper coding.
","[{'version': 'v1', 'created': 'Sun, 4 Sep 2011 07:21:58 GMT'}]",2015-03-19,"[['Zheng', 'Gan', ''], ['Chatzinotas', 'Symeon', ''], ['Ottersten', 'Bjorn', '']]","['(Multibeam Satellite', 'precoding', 'optimization', 'dual-polarization)']"
14664,1507.01981,Wei Quan Lim,"Wei Quan Lim, Seth Gilbert, Wei Zhong Lim",Dynamic Reallocation Problems in Scheduling,29 pages; updated references and other minor changes,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we look at the problem of scheduling tasks on a
single-processor system, where each task requires unit time and must be
scheduled within a certain time window, and each task can be added to or
removed from the system at any time. On each operation, the system is allowed
to reschedule any tasks, but the goal is to minimize the number of rescheduled
tasks. Our main result is an allocator that maintains a valid schedule for all
tasks in the system if their time windows have constant size and reschedules
O(1/{\epsilon}*log(1/{\epsilon})) tasks on each insertion as {\epsilon}->0,
where {\epsilon} is a certain measure of the schedule flexibility of the
system. We also show that it is optimal for any allocator that works on
arbitrary instances. We also briefly mention a few variants of the problem,
such as if the tasks have time windows of difference sizes, for which we have
an allocator that we conjecture reschedules only 1 task on each insertion if
the schedule flexibility remains above a certain threshold.
","[{'version': 'v1', 'created': 'Tue, 7 Jul 2015 22:28:39 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Feb 2016 18:07:17 GMT'}]",2016-02-16,"[['Lim', 'Wei Quan', ''], ['Gilbert', 'Seth', ''], ['Lim', 'Wei Zhong', '']]","['Online problems', 'scheduling', 'reallocation', 'distributed systems']"
14665,1502.05615,C\`esar Ferri,"Fernando Mart\'inez-Plumed, C\`esar Ferri, Jos\'e Hern\'andez-Orallo,
  Mar\'ia Jos\'e Ram\'irez-Quintana","Forgetting and consolidation for incremental and cumulative knowledge
  acquisition systems",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The application of cognitive mechanisms to support knowledge acquisition is,
from our point of view, crucial for making the resulting models coherent,
efficient, credible, easy to use and understandable. In particular, there are
two characteristic features of intelligence that are essential for knowledge
development: forgetting and consolidation. Both plays an important role in
knowledge bases and learning systems to avoid possible information overflow and
redundancy, and in order to preserve and strengthen important or frequently
used rules and remove (or forget) useless ones. We present an incremental,
long-life view of knowledge acquisition which tries to improve task after task
by determining what to keep, what to consolidate and what to forget, overcoming
The Stability-Plasticity dilemma. In order to do that, we rate rules by
introducing several metrics through the first adaptation, to our knowledge, of
the Minimum Message Length (MML) principle to a coverage graph, a hierarchical
assessment structure which treats evidence and rules in a unified way. The
metrics are not only used to forget some of the worst rules, but also to set a
consolidation process to promote those selected rules to the knowledge base,
which is also mirrored by a demotion system. We evaluate the framework with a
series of tasks in a chess rule learning domain.
","[{'version': 'v1', 'created': 'Thu, 19 Feb 2015 16:25:49 GMT'}]",2015-02-20,"[['Martínez-Plumed', 'Fernando', ''], ['Ferri', 'Cèsar', ''], ['Hernández-Orallo', 'José', ''], ['Ramírez-Quintana', 'María José', '']]","['Cognitive abilities', 'forgetting', 'consolidation', 'lifelong machine learning', 'knowledge acquisition', 'declarative learning', 'MML']"
14666,1501.05272,Arnaud Martin,"Imen Ouled Dlala (IRISA), Dorra Attiaoui (IRISA), Arnaud Martin
  (IRISA), Boutheina Ben Yaghlane",Trolls Identification within an Uncertain Framework,"International Conference on Tools with Artificial Intelligence -
  ICTAI , Nov 2014, Limassol, Cyprus",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The web plays an important role in people's social lives since the emergence
of Web 2.0. It facilitates the interaction between users, gives them the
possibility to freely interact, share and collaborate through social networks,
online communities forums, blogs, wikis and other online collaborative media.
However, an other side of the web is negatively taken such as posting
inflammatory messages. Thus, when dealing with the online communities forums,
the managers seek to always enhance the performance of such platforms. In fact,
to keep the serenity and prohibit the disturbance of the normal atmosphere,
managers always try to novice users against these malicious persons by posting
such message (DO NOT FEED TROLLS). But, this kind of warning is not enough to
reduce this phenomenon. In this context we propose a new approach for detecting
malicious people also called 'Trolls' in order to allow community managers to
take their ability to post online. To be more realistic, our proposal is
defined within an uncertain framework. Based on the assumption consisting on
the trolls' integration in the successful discussion threads, we try to detect
the presence of such malicious users. Indeed, this method is based on a
conflict measure of the belief function theory applied between the different
messages of the thread. In order to show the feasibility and the result of our
approach, we test it in different simulated data.
","[{'version': 'v1', 'created': 'Wed, 21 Jan 2015 19:34:23 GMT'}]",2015-01-22,"[['Dlala', 'Imen Ouled', '', 'IRISA'], ['Attiaoui', 'Dorra', '', 'IRISA'], ['Martin', 'Arnaud', '', 'IRISA'], ['Yaghlane', 'Boutheina Ben', '']]","['Q&AC', 'trolls', 'belief function theory', 'conflict measure']"
14667,1502.06219,Smitha M.L.,"B.H. Shekar, Smitha M.L.",Video Text Localization with an emphasis on Edge Features,"8 pages, Eighth International Conference on Image and Signal
  Processing, Elsevier Publications, ISBN: 9789351072522, pp: 324-330, held at
  UVCE, Bangalore in July 2014. arXiv admin note: text overlap with
  arXiv:1502.03913",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The text detection and localization plays a major role in video analysis and
understanding. The scene text embedded in video consist of high-level semantics
and hence contributes significantly to visual content analysis and retrieval.
This paper proposes a novel method to robustly localize the texts in natural
scene images and videos based on sobel edge emphasizing approach. The input
image is preprocessed and edge emphasis is done to detect the text clusters.
Further, a set of rules have been devised using morphological operators for
false positive elimination and connected component analysis is performed to
detect the text regions and hence text localization is performed. The
experimental results obtained on publicly available standard datasets
illustrate that the proposed method can detect and localize the texts of
various sizes, fonts and colors.
","[{'version': 'v1', 'created': 'Sun, 22 Feb 2015 12:32:18 GMT'}]",2015-02-24,"[['Shekar', 'B. H.', ''], ['L.', 'Smitha M.', '']]","['Preprocessing', 'Edge-emphasizing', 'Binarization', 'Text Localization']"
14668,1206.2016,Nikzad Babaii-Rizvandi,"Nikzad Babaii Rizvandi, Javid Taheri, Reza Moraveji, Albert Y. Zomaya",Network Load Analysis and Provisioning of MapReduce Applications,"6 pages-submitted to The Thirteenth International Conference on
  Parallel and Distributed Computing, Applications and Technologies(PDCAT-12),
  Beijing, China",,,,cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the dependency between configuration parameters and
network load of fixed-size MapReduce applications in shuffle phase and then
propose an analytical method to model this dependency. Our approach consists of
three key phases: profiling, modeling, and prediction. In the first stage, an
application is run several times with different sets of MapReduce configuration
parameters (here number of mappers and number of reducers) to profile the
network load of the application in the shuffle phase on a given cluster. Then,
the relation between these parameters and the network load is modeled by
multivariate linear regression. For evaluation, three applications (WordCount,
Exim Mainlog parsing, and TeraSort) are utilized to evaluate our technique on a
4-node MapReduce private cluster.
","[{'version': 'v1', 'created': 'Sun, 10 Jun 2012 10:39:04 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Jul 2012 02:07:41 GMT'}]",2013-01-30,"[['Rizvandi', 'Nikzad Babaii', ''], ['Taheri', 'Javid', ''], ['Moraveji', 'Reza', ''], ['Zomaya', 'Albert Y.', '']]","['MapReduce', 'Configuration parameters', 'network load analysis', 'provisioning', 'multivariate linear regression', 'number of map tasks', 'number of reduce tasks']"
14669,1702.05463,Sergei Vostokin,"Sergey Vostokin, Ekaterina Skoryupina","A Performance Analysis of Simple Runtime System for Actor Programming in
  C++",10 pages,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose the Templet -- a runtime system for actor
programming of high performance computing in C++. We provide a compact source
code of the runtime system, which uses standard library of C++11 only. We
demonstrate how it differs from the classic implementations of the actor model.
The practical significance of the Templet was examined by comparative study on
the performance of three applications: the reference code in C++, managed by
the OpenMP; the actor code in C++, managed by the Templet; the actor code in
Java, managed by the Akka. As a test problem we used a numerical algorithm for
solving the heat equation.
","[{'version': 'v1', 'created': 'Fri, 17 Feb 2017 18:08:43 GMT'}]",2017-02-20,"[['Vostokin', 'Sergey', ''], ['Skoryupina', 'Ekaterina', '']]","['performance analysis', 'message-oriented middleware', 'actor framework', 'high performance computing', 'C++ language']"
14670,1609.06653,Yi Zhu,Yi Zhu and Shawn Newsam,"Land Use Classification using Convolutional Neural Networks Applied to
  Ground-Level Images","ACM SIGSPATIAL 2015, Best Poster Award",,,,cs.CV cs.CY cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Land use mapping is a fundamental yet challenging task in geographic science.
In contrast to land cover mapping, it is generally not possible using overhead
imagery. The recent, explosive growth of online geo-referenced photo
collections suggests an alternate approach to geographic knowledge discovery.
In this work, we present a general framework that uses ground-level images from
Flickr for land use mapping. Our approach benefits from several novel aspects.
First, we address the nosiness of the online photo collections, such as
imprecise geolocation and uneven spatial distribution, by performing location
and indoor/outdoor filtering, and semi- supervised dataset augmentation. Our
indoor/outdoor classifier achieves state-of-the-art performance on several
bench- mark datasets and approaches human-level accuracy. Second, we utilize
high-level semantic image features extracted using deep learning, specifically
convolutional neural net- works, which allow us to achieve upwards of 76%
accuracy on a challenging eight class land use mapping problem.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2016 18:01:24 GMT'}]",2016-09-22,"[['Zhu', 'Yi', ''], ['Newsam', 'Shawn', '']]","['Geo-referenced images', 'land use classification', 'convolutionalneural networks', 'indoor/outdoor image classification']"
14671,1205.4487,Rajesh V,"V. Rajesh, P. Vijaya Kumar",CDMA Based Interconnect Mechanism for SOPC,"IJCSI Vol.9 Issue 2, 2012",,,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Network-on-chip (NoC) designs consisting of large pack of Intellectual
Property (IP) blocks (cores) on the same silicon die is becoming technically
possible nowadays. But, the communication between the IP Cores is the main
issue in recent years. This paper presents the design of a Code Division
Multiple Access (CDMA) based wrapper interconnect as a component of System on
programmable chip (SOPC) builder to communicate between IP cores. In the
proposal, only bus lines that carry address and data signals are CDMA coded.
CDMA technology has better data integrity, channel continuity, channel
isolation, and also mainly it reduces the no.of lines in the bus architecture
for transmitting the data from master to slave.
","[{'version': 'v1', 'created': 'Mon, 21 May 2012 05:01:24 GMT'}]",2012-05-22,"[['Rajesh', 'V.', ''], ['Kumar', 'P. Vijaya', '']]","['CDMA', 'On-Chip interconnects', 'SOPC', 'Shared Bus Architecture', 'Encoding and Decoding', 'Custom component']"
14672,1402.4322,Alvaro Martinez,A. Mart\'inez-P\'erez,"On the properties of $\alpha$-unchaining single linkage hierarchical
  clustering","14 pages, 4 figures. arXiv admin note: substantial text overlap with
  arXiv:1210.6292",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the election of a hierarchical clustering method, theoretic properties may
give some insight to determine which method is the most suitable to treat a
clustering problem. Herein, we study some basic properties of two hierarchical
clustering methods: $\alpha$-unchaining single linkage or $SL(\alpha)$ and a
modified version of this one, $SL^*(\alpha)$. We compare the results with the
properties satisfied by the classical linkage-based hierarchical clustering
methods.
","[{'version': 'v1', 'created': 'Tue, 18 Feb 2014 13:08:47 GMT'}]",2014-02-19,"[['Martínez-Pérez', 'A.', '']]","['Hierarchical clustering', 'single linkage', 'chaining effect', 'weakly unchaining', 'α-bridge']"
14673,1111.3739,Tibabishev Valeriy Nikolaevich,V. N. Tibabishev,The function space to describe the dynamics of linear systems,13 pages,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Usually, the dynamics of linear time-invariant systems described by an
integral operator of convolution type, which is defined in the Hilbert space of
Lebesgue square integrable functions on the whole line. Such a description
leads to contradictions. It is shown that the transition to the Hilbert space
of almost periodic functions leads to the elimination of the detected
inconsistencies. Multiple signals and interference with discrete spectrum are
systems of sets. The properties of these systems lead to a new more effective
method to combat noise in this space. The method used to identify the
differential equations for the airbus. Baseline data were obtained during
automatic landing.
","[{'version': 'v1', 'created': 'Wed, 16 Nov 2011 09:46:25 GMT'}]",2012-01-18,"[['Tibabishev', 'V. N.', '']]","['random and deterministic processes', 'Hilbert spaces', 'linear operators', 'the Fourier transform']"
14674,1607.04411,Yinxiao Li,"Yinxiao Li, Yan Wang, Yonghao Yue, Danfei Xu, Michael Case, Shih-Fu
  Chang, Eitan Grinspun, Peter Allen","Model-Driven Feed-Forward Prediction for Manipulation of Deformable
  Objects","21 pages, 27 figures",,,,cs.CV cs.GR cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robotic manipulation of deformable objects is a difficult problem especially
because of the complexity of the many different ways an object can deform.
Searching such a high dimensional state space makes it difficult to recognize,
track, and manipulate deformable objects. In this paper, we introduce a
predictive, model-driven approach to address this challenge, using a
pre-computed, simulated database of deformable object models. Mesh models of
common deformable garments are simulated with the garments picked up in
multiple different poses under gravity, and stored in a database for fast and
efficient retrieval. To validate this approach, we developed a comprehensive
pipeline for manipulating clothing as in a typical laundry task. First, the
database is used for category and pose estimation for a garment in an arbitrary
position. A fully featured 3D model of the garment is constructed in real-time
and volumetric features are then used to obtain the most similar model in the
database to predict the object category and pose. Second, the database can
significantly benefit the manipulation of deformable objects via non-rigid
registration, providing accurate correspondences between the reconstructed
object model and the database models. Third, the accurate model simulation can
also be used to optimize the trajectories for manipulation of deformable
objects, such as the folding of garments. Extensive experimental results are
shown for the tasks above using a variety of different clothing.
","[{'version': 'v1', 'created': 'Fri, 15 Jul 2016 08:01:13 GMT'}]",2016-07-18,"[['Li', 'Yinxiao', ''], ['Wang', 'Yan', ''], ['Yue', 'Yonghao', ''], ['Xu', 'Danfei', ''], ['Case', 'Michael', ''], ['Chang', 'Shih-Fu', ''], ['Grinspun', 'Eitan', ''], ['Allen', 'Peter', '']]","['Deformable Objects', 'Recognition', 'Robotic Manipulation', 'Simulation']"
14675,1704.05579,Mikhail Khodak,"Mikhail Khodak, Nikunj Saunshi and Kiran Vodrahalli",A Large Self-Annotated Corpus for Sarcasm,"6 pages, 4 Figures. To Appear in LREC 2018",,,,cs.CL cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the Self-Annotated Reddit Corpus (SARC), a large corpus for
sarcasm research and for training and evaluating systems for sarcasm detection.
The corpus has 1.3 million sarcastic statements -- 10 times more than any
previous dataset -- and many times more instances of non-sarcastic statements,
allowing for learning in both balanced and unbalanced label regimes. Each
statement is furthermore self-annotated -- sarcasm is labeled by the author,
not an independent annotator -- and provided with user, topic, and conversation
context. We evaluate the corpus for accuracy, construct benchmarks for sarcasm
detection, and evaluate baseline methods.
","[{'version': 'v1', 'created': 'Wed, 19 Apr 2017 02:01:39 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Apr 2017 01:25:08 GMT'}, {'version': 'v3', 'created': 'Fri, 6 Oct 2017 03:09:01 GMT'}, {'version': 'v4', 'created': 'Thu, 22 Mar 2018 22:23:10 GMT'}]",2018-03-26,"[['Khodak', 'Mikhail', ''], ['Saunshi', 'Nikunj', ''], ['Vodrahalli', 'Kiran', '']]","['sarcasm', 'classification', 'conversation']"
14676,1511.04479,"Martin F\""urer","Martin F\""urer",Multi-Clique-Width,16 pages,,,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-clique-width is obtained by a simple modification in the definition of
clique-width. It has the advantage of providing a natural extension of
tree-width. Unlike clique-width, it does not explode exponentially compared to
tree-width. Efficient algorithms based on multi-clique-width are still possible
for interesting tasks like computing the independent set polynomial or testing
$c$-colorability. In particular, $c$-colorability can be tested in time linear
in $n$ and singly exponential in $c$ and the width $k$ of a given
multi-$k$-expression. For these tasks, the running time as a function of the
multi-clique-width is the same as the running time of the fastest known
algorithm as a function of the clique-width. This results in an exponential
speed-up for some graphs, if the corresponding graph generating expressions are
given. The reason is that the multi-clique-width is never bigger, but is
exponentially smaller than the clique-width for many graphs. This gap shows up
when the tree-width is basically equal to the multi-clique width as well as
when the tree-width is not bounded by any function of the clique-width.
","[{'version': 'v1', 'created': 'Fri, 13 Nov 2015 23:25:44 GMT'}]",2015-11-17,"[['Fürer', 'Martin', '']]","['Clique-width', 'Parameterized complexity', 'Tree-width', 'Independent set polynomial']"
14677,1604.06685,John Mingers,John Mingers and Liying Yang,"Evaluating Journal Quality: A Review of Journal Citation Indicators and
  Ranking in Business and Management",,,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evaluating the quality of academic journal is becoming increasing important
within the context of research performance evaluation. Traditionally, journals
have been ranked by peer review lists such as that of the Association of
Business Schools (UK) or though their journal impact factor (JIF). However,
several new indicators have been developed, such as the h-index, SJR, SNIP and
the Eigenfactor which take into account different factors and therefore have
their own particular biases. In this paper we evaluate these metrics both
theoretically and also through an empirical study of a large set of business
and management journals. We show that even though the indicators appear highly
correlated in fact they lead to large differences in journal rankings. We
contextualize our results in terms of the UK's large scale research assessment
exercise (the RAE/REF) and particularly the ABS journal ranking list. We
conclude that no one indicator is superior but that the h-index (which includes
the productivity of a journal) and SNIP (which aims to normalize for field
effects) may be the most effective at the moment.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2016 14:40:52 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Apr 2016 09:15:56 GMT'}]",2016-04-26,"[['Mingers', 'John', ''], ['Yang', 'Liying', '']]","['OR in scientometrics', 'ABS journal list', 'Eigenfactor', 'h-index', 'impact factor', 'journal']"
14678,1401.8042,Kun Tu,"Kun Tu, Bruno Ribeiro, Hua Jiang, Xiaodong Wang, David Jensen, Benyuan
  Liu and Don Towsley",Online Dating Recommendations: Matching Markets and Learning Preferences,"6 pages, 4 figures, submission on 5th International Workshop on
  Social Recommender Systems",,,,cs.SI cs.IR physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommendation systems for online dating have recently attracted much
attention from the research community. In this paper we proposed a two-side
matching framework for online dating recommendations and design an LDA model to
learn the user preferences from the observed user messaging behavior and user
profile features. Experimental results using data from a large online dating
website shows that two-sided matching improves significantly the rate of
successful matches by as much as 45%. Finally, using simulated matchings we
show that the the LDA model can correctly capture user preferences.
","[{'version': 'v1', 'created': 'Fri, 31 Jan 2014 02:30:31 GMT'}]",2014-02-03,"[['Tu', 'Kun', ''], ['Ribeiro', 'Bruno', ''], ['Jiang', 'Hua', ''], ['Wang', 'Xiaodong', ''], ['Jensen', 'David', ''], ['Liu', 'Benyuan', ''], ['Towsley', 'Don', '']]","['Online Dating', 'Two-sided Matching Market', 'Learning Preferences', 'LDA', 'Recommendation']"
14679,1406.7062,Ke Liu,"Ke Liu, Ming Xu, Zeyun Yu",Adaptive Mesh Representation and Restoration of Biomedical Images,,,,,cs.CV,http://creativecommons.org/licenses/by/3.0/,"  The triangulation of images has become an active research area in recent
years for its compressive representation and ease of image processing and
visualization. However, little work has been done on how to faithfully recover
image intensities from a triangulated mesh of an image, a process also known as
image restoration or decoding from meshes. The existing methods such as linear
interpolation, least-square interpolation, or interpolation based on radial
basis functions (RBFs) work to some extent, but often yield blurred features
(edges, corners, etc.). The main reason for this problem is due to the
isotropically-defined Euclidean distance that is taken into consideration in
these methods, without considering the anisotropicity of feature intensities in
an image. Moreover, most existing methods use intensities defined at mesh nodes
whose intensities are often ambiguously defined on or near image edges (or
feature boundaries). In the current paper, a new method of restoring an image
from its triangulation representation is proposed, by utilizing anisotropic
radial basis functions (ARBFs). This method considers not only the geometrical
(Euclidean) distances but also the local feature orientations (anisotropic
intensities). Additionally, this method is based on the intensities of mesh
faces instead of mesh nodes and thus provides a more robust restoration. The
two strategies together guarantee excellent feature-preserving restoration of
an image with arbitrary super-resolutions from its triangulation
representation, as demonstrated by various experiments provided in the paper.
","[{'version': 'v1', 'created': 'Fri, 27 Jun 2014 05:06:22 GMT'}]",2014-06-30,"[['Liu', 'Ke', ''], ['Xu', 'Ming', ''], ['Yu', 'Zeyun', '']]","['image restoration', 'image triangulation', 'radial basis function', 'anisotropic radial basis function', 'local structure tensor']"
14680,1409.6588,Bernhard Rumpe,"Florian Fieber, Nikolaus Regnat, Bernhard Rumpe",Assessing usability of model driven development in industrial projects,"9 pages, 4 figures","T Bailey, R. Vogel, J. Mansell (Eds.): 4th European Workshop on
  ""From code centric to model centric software engineering: Practices,
  Implications and ROI"" (C2M). 24. Juni 2009, University of Twente,
  NL-Enschede. CTIT Workshop Proceedings",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An integral use of the model driven development paradigm influences and
changes an organization's software development division rather heavily. Such a
paradigm reduces some tasks in complexity and costs, but also introduces new
tasks and, if introduced seriously, has severe affects on activities and roles
in the software development process. As the model becomes the most important
development artifact, there are new challenges to the development team, e. g.
assessing the model's quality, model partitioning and configuration management
for distributed teams, setup of build management, tool chaining and tracing of
information through the various artifacts. Organizations coping with model
driven development need to successfully introduce new tools and new ways of
thinking, they are challenged in adopting their processes and training their
staff. This paper presents an ongoing research project on the assessment of the
usability of modeling and model driven development at a global industrial
organization with its headquarters in Germany. The matter of interest is the
analysis of the usability of modeling (especially with the UML) and model
driven development by accomplishing an empirical, quantitative survey.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 12:04:47 GMT'}]",2014-09-24,"[['Fieber', 'Florian', ''], ['Regnat', 'Nikolaus', ''], ['Rumpe', 'Bernhard', '']]","['Modeling', 'Model  Driven  Development', 'UML', 'Software Engineering', 'Empirical Study']"
14681,1611.00578,Miikka Kuutila M.Sc.,"Miikka Kuutila, Mika M\""antyl\""a, P\""aivi Raulamo-Jurvanen","Benchmarking Web-testing - Selenium versus Watir and the Choice of
  Programming Language and Browser","40 pages, 3 figures, 26 tables",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Selenium is claimed to be the most popular software test automation
tool. Past academic works have mainly neglected testing tools in favor of more
methodological topics. Objective: We investigated the performance of
web-testing tools, to provide empirical evidence supporting choices in software
test tool selection and configuration. Method: We used 4*5 factorial design to
study 20 different configurations for testing a web-store. We studied 5
programming language bindings (C#, Java, Python, and Ruby for Selenium, while
Watir supports Ruby only) and 4 browsers (Google Chrome, Internet Explorer,
Mozilla Firefox and Opera). Performance was measured with execution time,
memory usage, length of the test scripts and stability of the tests. Results:
Considering all measures the best configuration was Selenium with Python
language binding for Chrome. Selenium with Python bindings was the best option
for all browsers. The effect size of the difference between the slowest and
fastest configuration was very high (Cohens d=41.5, 91% increase in execution
time). Overall Internet Explorer was the fastest browser while having the worst
results in the stability. Conclusions: We recommend benchmarking tools before
adopting them. Weighting of factors, e.g. how much test stability is one
willing to sacrifice for faster performance, affects the decision.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2016 13:00:08 GMT'}]",2016-11-03,"[['Kuutila', 'Miikka', ''], ['Mäntylä', 'Mika', ''], ['Raulamo-Jurvanen', 'Päivi', '']]","['Software testing', 'Selenium', 'Watir', 'Webdriver', 'test automation', 'web-testing']"
14682,1002.1751,Bruno Ribeiro,Bruno Ribeiro and Don Towsley,Estimating and Sampling Graphs with Multidimensional Random Walks,,,,UMass Amherst Technical Report UM-CS-2010-011 (extended),cs.DS cs.NI,http://creativecommons.org/licenses/publicdomain/,"  Estimating characteristics of large graphs via sampling is a vital part of
the study of complex networks. Current sampling methods such as (independent)
random vertex and random walks are useful but have drawbacks. Random vertex
sampling may require too many resources (time, bandwidth, or money). Random
walks, which normally require fewer resources per sample, can suffer from large
estimation errors in the presence of disconnected or loosely connected graphs.
In this work we propose a new $m$-dimensional random walk that uses $m$
dependent random walkers. We show that the proposed sampling method, which we
call Frontier sampling, exhibits all of the nice sampling properties of a
regular random walk. At the same time, our simulations over large real world
graphs show that, in the presence of disconnected or loosely connected
components, Frontier sampling exhibits lower estimation errors than regular
random walks. We also show that Frontier sampling is more suitable than random
vertex sampling to sample the tail of the degree distribution of the graph.
","[{'version': 'v1', 'created': 'Tue, 9 Feb 2010 15:00:13 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Sep 2010 17:04:26 GMT'}]",2010-09-08,"[['Ribeiro', 'Bruno', ''], ['Towsley', 'Don', '']]","['Frontier Sampling', 'Random Walks', 'MCMC', 'Estimates', 'PowerLaws', 'Assortativity', 'Global Clustering Coefficient']"
14683,1603.05459,Miguel Mosteiro,Maitri Chakraborty and Alessia Milani and Miguel A. Mosteiro,Counting in Practical Anonymous Dynamic Networks is Polynomial,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Anonymous Dynamic Networks is a harsh computational environment due to
changing topology and lack of identifiers. Computing the size of the network, a
problem known as Counting, is particularly challenging because messages
received cannot be tagged to a specific sender. Previous works on Counting in
Anonymous Dynamic Networks do not provide enough guarantees to be used in
practice. Indeed, they either compute only an upper bound on the network size
that may be as bad as exponential, or guarantee only double-exponential running
time, or do not terminate, or guarantee only eventual termination without
running-time guarantees. Faster experimental protocols do not guarantee the
correct count. Recently, we presented the first Counting protocol that computes
the exact count with exponential running-time guarantees. The protocol requires
the presence of one leader node and knowledge of any upper bound Delta on the
maximum number of neighbors that any node will ever have. In the present work,
we complement the latter theoretical study evaluating the performance of such
protocol in practice. We tested a variety of network topologies that may appear
in practice, including extremal cases such as trees, paths, and continuously
changing topologies. We also tested networks that temporarily are not
connected. Our simulations showed that the protocol is polynomial for all the
inputs tested, paving the way to use it in practical applications where
topology changes are predictable. The simulations also provided insight on the
impact of topology changes on information dissemination. To the best of our
knowledge, this is the first experimental study that shows the possibility of
computing the exact count in polynomial time in a variety of Anonymous Dynamic
Networks that are worse than expected in practice.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2016 12:51:50 GMT'}]",2016-03-18,"[['Chakraborty', 'Maitri', ''], ['Milani', 'Alessia', ''], ['Mosteiro', 'Miguel A.', '']]","['anonymous dynamic networks', 'counting', 'time-varying graphs']"
14684,1708.01347,Maodong Pan,Maodong Pan and Falai Chen,A Low-rank Spline Approximation of Planar Domains,,,,,cs.CG math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Construction of spline surfaces from given boundary curves is one of the
classical problems in computer aided geometric design, which regains much
attention in isogeometric analysis in recent years and is called domain
parameterization. However, for most of the state-of-the-art parameterization
methods, the rank of the spline parameterization is usually large, which
results in higher computational cost in solving numerical PDEs. In this paper,
we propose a low-rank representation for the spline parameterization of planar
domains using low-rank tensor approximation technique, and apply
quasi-conformal map as the framework of the spline parameterization. Under
given correspondence of boundary curves, a quasi-conformal map with low rank
and low distortion between a unit square and the computational domain can be
modeled as a non-linear optimization problem. We propose an efficient algorithm
to compute the quasi-conformal map by solving two convex optimization problems
alternatively. Experimental results show that our approach can produce a
bijective and low-rank parametric spline representation of planar domains,
which results in better performance than previous approaches in solving
numerical PDEs.
","[{'version': 'v1', 'created': 'Fri, 4 Aug 2017 01:29:59 GMT'}]",2017-08-07,"[['Pan', 'Maodong', ''], ['Chen', 'Falai', '']]","['Parameterization', 'low-rank approximation', 'quasi-conformal mapping', 'Beltrami coefficient', 'isogeometric analysis']"
14685,1011.2269,Xingguo Shao,"Xingguo Shao, Qingguo Wang, Peter C Y Chen, Zhencai Zhu, Bin Zi","Forward Kinematics Analysis and Tension Distribution of a Cable-Driven
  Sinking Winches Mechanism",,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper concerns the forward kinematics and tension distribution of
sinking winches mechanism, which is a type of four-cable-driven partly
constrained parallel robot. Conventional studies on forward kinematics of
cable-driven parallel robot assumed that all cables are taut. Actually, given
the lengths of four cables, some cables may be slack when the platform is in
static equilibrium. Therefore, in this paper, the tension state (tautness or
slackness) of cables is considered in the forward kinematics model. We propose
Traversal-Solving-Algorithm, which can indicate the tension state of cables,
and further determine the pose of the platform, if the lengths of four cables
are given. The effectiveness of the algorithm is verified by four examples. The
results of this paper can be used to control sinking winches mechanism to
achieve the level and stable motion of the platform, and to make the tension
distribution of cables as uniform as possible.
","[{'version': 'v1', 'created': 'Wed, 10 Nov 2010 03:35:00 GMT'}]",2010-11-11,"[['Shao', 'Xingguo', ''], ['Wang', 'Qingguo', ''], ['Chen', 'Peter C Y', ''], ['Zhu', 'Zhencai', ''], ['Zi', 'Bin', '']]","['forward kinematics', 'tension distribution', 'sinkingwinches mechanism', 'cable-driven parallel robot']"
14686,1610.06998,Andre Pacheco,Andre G. C. Pacheco and Renato A. Krohling,"Ranking of classification algorithms in terms of mean-standard deviation
  using A-TOPSIS","16 pages, 8 figures and 11 tables",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In classification problems when multiples algorithms are applied to different
benchmarks a difficult issue arises, i.e., how can we rank the algorithms? In
machine learning it is common run the algorithms several times and then a
statistic is calculated in terms of means and standard deviations. In order to
compare the performance of the algorithms, it is very common to employ
statistical tests. However, these tests may also present limitations, since
they consider only the means and not the standard deviations of the obtained
results. In this paper, we present the so called A-TOPSIS, based on TOPSIS
(Technique for Order Preference by Similarity to Ideal Solution), to solve the
problem of ranking and comparing classification algorithms in terms of means
and standard deviations. We use two case studies to illustrate the A-TOPSIS for
ranking classification algorithms and the results show the suitability of
A-TOPSIS to rank the algorithms. The presented approach is general and can be
applied to compare the performance of stochastic algorithms in machine
learning. Finally, to encourage researchers to use the A-TOPSIS for ranking
algorithms we also presented in this work an easy-to-use A-TOPSIS web
framework.
","[{'version': 'v1', 'created': 'Sat, 22 Oct 2016 05:19:44 GMT'}]",2016-10-25,"[['Pacheco', 'Andre G. C.', ''], ['Krohling', 'Renato A.', '']]","['machine learning', 'classification algorithms', 'comparison of algorithms', 'ranking', 'TOPSIS']"
14687,1206.5384,Tarek El-Shishtawy Ahmed,Tarek El-Shishtawy and Fatma El-Ghannam,Keyphrase Based Arabic Summarizer (KPAS),"INFOS 2012, The 8th INFOS2012 International Conference on Informatics
  and Systems, 14-16 May, 2012",,,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a computationally inexpensive and efficient generic
summarization algorithm for Arabic texts. The algorithm belongs to extractive
summarization family, which reduces the problem into representative sentences
identification and extraction sub-problems. Important keyphrases of the
document to be summarized are identified employing combinations of statistical
and linguistic features. The sentence extraction algorithm exploits keyphrases
as the primary attributes to rank a sentence. The present experimental work,
demonstrates different techniques for achieving various summarization goals
including: informative richness, coverage of both main and auxiliary topics,
and keeping redundancy to a minimum. A scoring scheme is then adopted that
balances between these summarization goals. To evaluate the resulted Arabic
summaries with well-established systems, aligned English/Arabic texts are used
through the experiments.
","[{'version': 'v1', 'created': 'Sat, 23 Jun 2012 12:19:38 GMT'}]",2012-06-26,"[['El-Shishtawy', 'Tarek', ''], ['El-Ghannam', 'Fatma', '']]","['Arabic NLP', 'Information Retrieval', 'Summarization', 'Arabic Keyphrase Extraction', 'Extractive Summaries']"
14688,1107.5543,Lada A. Adamic,"Chun-Yuen Teng, Liuling Gong, Avishay Livne, Celso Brunetti and Lada
  A. Adamic",Coevolution of Network Structure and Content,"10 pages, 10 figures V2 includes a simulation model; Proc. 4th
  International Conference on Web Science (WebSci'11), 2012",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As individuals communicate, their exchanges form a dynamic network. We
demonstrate, using time series analysis of communication in three online
settings, that network structure alone can be highly revealing of the diversity
and novelty of the information being communicated. Our approach uses both
standard and novel network metrics to characterize how unexpected a network
configuration is, and to capture a network's ability to conduct information. We
find that networks with a higher conductance in link structure exhibit higher
information entropy, while unexpected network configurations can be tied to
information novelty. We use a simulation model to explain the observed
correspondence between the evolution of a network's structure and the
information it carries.
","[{'version': 'v1', 'created': 'Wed, 27 Jul 2011 17:11:28 GMT'}, {'version': 'v2', 'created': 'Mon, 21 May 2012 23:21:21 GMT'}]",2012-05-23,"[['Teng', 'Chun-Yuen', ''], ['Gong', 'Liuling', ''], ['Livne', 'Avishay', ''], ['Brunetti', 'Celso', ''], ['Adamic', 'Lada A.', '']]","['social media', 'information networks', 'network evolution']"
14689,1107.0420,Christoph Studer,"Christoph Studer, Richard G. Baraniuk",Stable Restoration and Separation of Approximately Sparse Signals,to appear in Applied and Computational Harmonic Analysis (ACHA),,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper develops new theory and algorithms to recover signals that are
approximately sparse in some general dictionary (i.e., a basis, frame, or
over-/incomplete matrix) but corrupted by a combination of interference having
a sparse representation in a second general dictionary and measurement noise.
The algorithms and analytical recovery conditions consider varying degrees of
signal and interference support-set knowledge. Particular applications covered
by the proposed framework include the restoration of signals impaired by
impulse noise, narrowband interference, or saturation/clipping, as well as
image in-painting, super-resolution, and signal separation. Two application
examples for audio and image restoration demonstrate the efficacy of the
approach.
","[{'version': 'v1', 'created': 'Sun, 3 Jul 2011 00:22:36 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Sep 2013 15:36:28 GMT'}]",2013-09-06,"[['Studer', 'Christoph', ''], ['Baraniuk', 'Richard G.', '']]","['Sparse signal recovery', 'signal restoration', 'signal separation', 'deterministic recovery guarantees', 'coherence', 'basis-pursuit denoising']"
14690,1406.6595,Charalambos Poullis,"Qing Gu, Kyriakos Herakleous, Charalambos Poullis","3DUNDERWORLD-SLS: An Open-Source Structured-Light Scanning System for
  Rapid Geometry Acquisition","30 pages describing the 3DUNDERWORLD-SLS open source software by the
  ICT lab (www.theICTlab.org)",,,ICT-TR-2016-01,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, there has been an increase in the demand of virtual 3D objects
representing real-life objects. A plethora of methods and systems have already
been proposed for the acquisition of the geometry of real-life objects ranging
from those which employ active sensor technology, passive sensor technology or
a combination of various techniques.
  In this paper we present the development of a 3D scanning system which is
based on the principle of structured-light, without having particular
requirements for specialized equipment. We discuss the intrinsic details and
inherent difficulties of structured-light scanning techniques and present our
solutions. Finally, we introduce our open-source scanning software system
""3DUNDERWORLD-SLS"" which implements the proposed techniques both in CPU and
GPU. We have performed extensive testing with a wide range of models and report
the results. Furthermore, we present a comprehensive evaluation of the system
and a comparison with a high-end commercial 3D scanner.
","[{'version': 'v1', 'created': 'Wed, 25 Jun 2014 14:51:21 GMT'}, {'version': 'v2', 'created': 'Sat, 20 Aug 2016 04:59:55 GMT'}]",2016-08-23,"[['Gu', 'Qing', ''], ['Herakleous', 'Kyriakos', ''], ['Poullis', 'Charalambos', '']]","['3D', 'Scanning', 'Reconstruction', 'Structured-light scanning', 'SLS system']"
14691,1304.5545,Adrian Groza,Adrian Groza,Designing Electronic Markets for Defeasible-based Contractual Agents,LAF Workshop 2008,,,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The design of punishment policies applied to specific domains linking agents
actions to material penalties is an open research issue. The proposed framework
applies principles of contract law to set penalties: expectation damages,
opportunity cost, reliance damages, and party design remedies. In order to
decide which remedy provides maximum welfare within an electronic market, a
simulation environment called DEMCA (Designing Electronic Markets for
Contractual Agents) was developed. Knowledge representation and the reasoning
capabilities of the agents are based on an extended version of temporal
defeasible logic.
","[{'version': 'v1', 'created': 'Fri, 19 Apr 2013 21:00:37 GMT'}]",2013-04-23,"[['Groza', 'Adrian', '']]","['contractual agents', 'legal remedies', 'defeasible logic']"
14692,0909.3533,Yavuz Oruc A.,A. Yavuz Oruc and Abdullah Atmaca,On Ordinal Covering of Proposals Using Balanced Incomplete Block Designs,,,,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A frequently encountered problem in peer review systems is to facilitate
pairwise comparisons of a given set of proposals by as few as referees as
possible. In [8], it was shown that, if each referee is assigned to review k
proposals then ceil{n(n-1)/k(k-1)} referees are necessary and ceil{n(2n-k)/k^2}
referees are sufficient to cover all n(n-1)/2 pairs of n proposals. While the
upper bound remains within a factor of 2 of the lower bound, it becomes
relatively large for small values of k and the ratio of the upper bound to the
lower bound is not less than 3/2 when 2 <= k <= n/2. In this paper, we show
that, if sqrt(n) <= k <= n/2 then the upper and lower bounds can be made closer
in that their ratio never exceeds 3/2. This is accomplished by a new method
that assigns proposals to referees using a particular family of balanced
incomplete block designs. Specifically, the new method uses ceil{n(n+k)/k^2}
referees when n/k is a prime power, n divides k^2, and sqrt(n) <= k <= n/2.
Comparing this new upper bound to the one given in [8] shows that the new upper
bound approaches the lower bound as k tends to sqrt(n) whereas the upper bound
in [8] approaches the lower bound as k tends to n. Therefore, the new method
given here when combined together with the one in [8] provides an assignment
whose upper bound referee complexity always remains within a factor of 3/2 of
the lower bound when sqrt(n) <= k <= n, thereby improving upon the assignment
described in [8]. Furthermore, the new method provides a minimal covering,
i.e., it uses the minimum number of referees possible when k = sqrt(n) and k is
a prime power.
","[{'version': 'v1', 'created': 'Fri, 18 Sep 2009 21:01:14 GMT'}]",2009-09-22,"[['Oruc', 'A. Yavuz', ''], ['Atmaca', 'Abdullah', '']]","['balanced incomplete block design', 'ordinal assignment problem', 'peer review', 'proposal evaluation.  1']"
14693,1002.1163,Vishal Goyal,Sattar J Aboud,Efficient Password-Typed Key Agreement Scheme,"International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 2, January 2010,
  http://ijcsi.org/articles/Efficient-Password-Typed-Key-Agreement-Scheme.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 2, January 2010,
  http://ijcsi.org/articles/Efficient-Password-Typed-Key-Agreement-Scheme.php",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we will study Lee, Kim and Yoo, a verifier password typed key
agreement scheme and demonstrate that the scheme is not secure. Then, the
authors will propose an enhanced verifier typed key agreement scheme relied on
Lee, Kim and Yoo scheme and demonstrate that the propose scheme resists against
password guessing attack and stolen verifier attack. The authors are claimed
that the proposed scheme is more secure and efficient compare with Lee, Kim and
Yoo.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 09:17:25 GMT'}]",2010-02-08,"[['Aboud', 'Sattar J', '']]","['password', 'key agreement scheme', 'verifier-typed', 'password guessing attack', 'stolen verifier attack']"
14694,1407.1993,Fabien Teytaud,Fabien Teytaud and Cyril Fonlupt,"A Critical Reassessment of Evolutionary Algorithms on the cryptanalysis
  of the simplified data encryption standard algorithm","12 pages; International Journal on Cryptography and Information
  Security 4 (2014)",,,,cs.CR cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we analyze the cryptanalysis of the simplified data encryption
standard algorithm using meta-heuristics and in particular genetic algorithms.
The classic fitness function when using such an algorithm is to compare n-gram
statistics of a the decrypted message with those of the target message. We show
that using such a function is irrelevant in case of Genetic Algorithm, simply
because there is no correlation between the distance to the real key (the
optimum) and the value of the fitness, in other words, there is no hidden
gradient. In order to emphasize this assumption we experimentally show that a
genetic algorithm perform worse than a random search on the cryptanalysis of
the simplified data encryption standard algorithm.
","[{'version': 'v1', 'created': 'Tue, 8 Jul 2014 08:39:15 GMT'}]",2014-07-09,"[['Teytaud', 'Fabien', ''], ['Fonlupt', 'Cyril', '']]","['SIMPLIFIED DATA ENCRYPTION STANDARD', 'META-HEURISTICS', 'GENETIC ALGORITHM']"
14695,1401.7499,Mehdi Gheisari,"Manaf Sharifzadeh, saeid aragy, Kaveh Bashash, Shahram Bashokian,
  mehdi gheisari","A Comparison with two semantic sensor data storages in total data
  transmission",,,,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  The creation of small and cheap sensors promoted the emergence of large scale
sensor networks. Sensor networks allow monitoring a variety of physical
phenomena, like weather conditions (temperature, humidity, atmospheric pressure
...), traffic levels on highways or rooms occupancy in public buildings. Some
of the sensors produce large volume of data such as weather temperature. These
data should be stored somewhere for user queries. In this paper two known
sensor data storage methods that store data semantically has been compared and
it has been shown that storing data in ontology form consumes more energy so
the lifetime of sensor network would decreases. The reason we choose them is
that they are useful and popular.
","[{'version': 'v1', 'created': 'Wed, 29 Jan 2014 12:53:12 GMT'}]",2014-01-30,"[['Sharifzadeh', 'Manaf', ''], ['aragy', 'saeid', ''], ['Bashash', 'Kaveh', ''], ['Bashokian', 'Shahram', ''], ['gheisari', 'mehdi', '']]","['wireless', 'semsos', 'SWE']"
14696,1108.2777,Mohammad Jalil Piran,"Ehsan Ahvar, Alireza Pourmoslemi, Mohammad Jalil Piran","Fear: A Fuzzy-based Energy-aware Routing Protocol for Wireless Sensor
  Networks",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many energy-aware routing protocols have been proposed for wireless sensor
networks. Most of them are only energy savers and do not take care about energy
balancing. The energy saver protocols try to decrease the energy consumption of
the network as a whole; however the energy manager protocols balance the energy
consumption in the network to avoid network partitioning. This means that
energy saver protocols are not necessarily energy balancing and vice versa.
However, the lifetime of wireless sensor network is strictly depending on
energy consumption; therefore, energy management is an essential task to be
considered. This paper proposes an energy aware routing protocol, named FEAR,
which considers energy balancing and energy saving. It finds a fair trade-off
between energy balancing and energy saving by fuzzy set concept. FEAR routing
protocol is simulated and evaluated by Glomosim simulator.
","[{'version': 'v1', 'created': 'Sat, 13 Aug 2011 08:38:34 GMT'}]",2011-08-16,"[['Ahvar', 'Ehsan', ''], ['Pourmoslemi', 'Alireza', ''], ['Piran', 'Mohammad Jalil', '']]","['Sensor network', 'energy aware', 'routing protocol', 'fuzzy sets']"
14697,1505.05343,H. Paul Keeler Dr,"Johannes G\""obel, Paul Keeler, Anthony E. Krzesinski, Peter G. Taylor","Bitcoin Blockchain Dynamics: the Selfish-Mine Strategy in the Presence
  of Propagation Delay","14 pages, 13 Figures. Submitted to a peer-reviewed journal",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the context of the `selfish-mine' strategy proposed by Eyal and Sirer, we
study the effect of propagation delay on the evolution of the Bitcoin
blockchain. First, we use a simplified Markov model that tracks the contrasting
states of belief about the blockchain of a small pool of miners and the `rest
of the community' to establish that the use of block-hiding strategies, such as
selfish-mine, causes the rate of production of orphan blocks to increase. Then
we use a spatial Poisson process model to study values of Eyal and Sirer's
parameter $\gamma$, which denotes the proportion of the honest community that
mine on a previously-secret block released by the pool in response to the
mining of a block by the honest community. Finally, we use discrete-event
simulation to study the behaviour of a network of Bitcoin miners, a proportion
of which is colluding in using the selfish-mine strategy, under the assumption
that there is a propagation delay in the communication of information between
miners.
","[{'version': 'v1', 'created': 'Wed, 20 May 2015 12:27:20 GMT'}, {'version': 'v2', 'created': 'Thu, 21 May 2015 16:32:04 GMT'}]",2015-05-22,"[['Göbel', 'Johannes', ''], ['Keeler', 'Paul', ''], ['Krzesinski', 'Anthony E.', ''], ['Taylor', 'Peter G.', '']]","['Bitcoin', 'blockchain', 'block hiding strategies', 'honestmining', 'selfish-mine']"
14698,1207.5827,Satrajit Ghosh,Satrajit S. Ghosh,"Algorithm to suppress scanner noise in recorded speech during functional
  magnetic resonance imaging",,,,,cs.SD,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The high-intensity, repetitive noise associated with functional magnetic
resonance imaging hinders on-line monitoring of subjects' speech and/or
recording speech signals suitable for off-line analysis. The proposed algorithm
enhances the speech signal by suppressing the scanner noise in the signal
recorded by a single-channel microphone. Significant increases in
signal-to-noise ratio are achieved using an adaptive filter that combines time
and frequency domain elements. In addition to providing a recording suitable
for speech analysis, such a real-time system provides an alternative means (to,
e.g., the ""panic ball"") for communication between the patient and the operator
during image acquisition.
","[{'version': 'v1', 'created': 'Tue, 24 Jul 2012 21:08:35 GMT'}]",2012-07-26,"[['Ghosh', 'Satrajit S.', '']]","['Noise suppression', 'fMRI', 'speech']"
14699,1005.0957,Rdv Ijcsis,"S. Karpagachelvi, M.Arthanari, M. Sivakumar",ECG Feature Extraction Techniques - A Survey Approach,"IEEE Publication format, International Journal of Computer Science
  and Information Security, IJCSIS, Vol. 8 No. 1, April 2010, USA. ISSN 1947
  5500, http://sites.google.com/site/ijcsis/",,,,cs.NE cs.AI physics.med-ph,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  ECG Feature Extraction plays a significant role in diagnosing most of the
cardiac diseases. One cardiac cycle in an ECG signal consists of the P-QRS-T
waves. This feature extraction scheme determines the amplitudes and intervals
in the ECG signal for subsequent analysis. The amplitudes and intervals value
of P-QRS-T segment determines the functioning of heart of every human.
Recently, numerous research and techniques have been developed for analyzing
the ECG signal. The proposed schemes were mostly based on Fuzzy Logic Methods,
Artificial Neural Networks (ANN), Genetic Algorithm (GA), Support Vector
Machines (SVM), and other Signal Analysis techniques. All these techniques and
algorithms have their advantages and limitations. This proposed paper discusses
various techniques and transformations proposed earlier in literature for
extracting feature from an ECG signal. In addition this paper also provides a
comparative study of various methods proposed by researchers in extracting the
feature from ECG signal.
","[{'version': 'v1', 'created': 'Thu, 6 May 2010 09:54:44 GMT'}]",2010-05-07,"[['Karpagachelvi', 'S.', ''], ['Arthanari', 'M.', ''], ['Sivakumar', 'M.', '']]","['Artificial Neural Networks (ANN)', 'Cardiac Cycle', 'ECG signal', 'Feature Extraction', 'Fuzzy Logic', 'Genetic Algorithm (GA)', 'Support Vector Machines (SVM)']"
14700,1606.03502,Sedigheh Khademi,"Sedigheh Khademi, Christopher Palmer, Pari Delir Haghighi, Philip
  Lewis and Frada Burstein","Intelligent audit code generation from free text in the context of
  neurosurgery","ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
  Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/189,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Clinical auditing requires codified data for aggregation and analysis of
patterns. However in the medical domain obtaining structured data can be
difficult as the most natural, expressive and comprehensive way to record a
clinical encounter is through natural language. The task of creating structured
data from naturally expressed information is known as information extraction.
Specialised areas of medicine use their own language and data structures; the
translation process has unique challenges, and often requires a fresh approach.
This research is devoted to creating a novel semi-automated method for
generating codified auditing data from clinical notes recorded in a
neurosurgical department in an Australian teaching hospital. The method
encapsulates specialist knowledge in rules that instantaneously make precise
decisions for the majority of the matches, followed up by dictionary-based
matching of the remaining text.
","[{'version': 'v1', 'created': 'Fri, 10 Jun 2016 23:52:25 GMT'}]",2016-06-14,"[['Khademi', 'Sedigheh', ''], ['Palmer', 'Christopher', ''], ['Haghighi', 'Pari Delir', ''], ['Lewis', 'Philip', ''], ['Burstein', 'Frada', '']]","['Information Extraction', 'Neurosurgery', 'Health Informatics', 'Electronic health records', 'Audit coding']"
14701,1110.1301,Stamatia Bibi,Michael Deynet,Predicting User Actions in Software Processes,"4th Workshop on Intelligent Techniques in Software Engineering, 5
  September 2011, at the European Conference on Machine Learning and Principles
  and Practices of Knowledge Discovery in Databases (ECML-PKDD)",,,,cs.SE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes an approach for user (e.g. SW architect) assisting in
software processes. The approach observes the user's action and tries to
predict his next step. For this we use approaches in the area of machine
learning (sequence learning) and adopt these for the use in software processes.
  Keywords: Software engineering, Software process description languages,
Software processes, Machine learning, Sequence prediction
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2011 15:42:02 GMT'}]",2011-10-07,"[['Deynet', 'Michael', '']]","['Software engineering', 'Software process description languages', 'Software processes', 'Machine learning', 'Sequence prediction']"
14702,1412.6168,Daniel Dadush,Nicolas Bonifas and Daniel Dadush,"Short Paths on the Voronoi Graph and the Closest Vector Problem with
  Preprocessing",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Improving on the Voronoi cell based techniques of Micciancio and Voulgaris
(SIAM J. Comp. 13), and Sommer, Feder and Shalvi (SIAM J. Disc. Math. 09), we
give a Las Vegas $\tilde{O}(2^n)$ expected time and space algorithm for CVPP
(the preprocessing version of the Closest Vector Problem, CVP). This improves
on the $\tilde{O}(4^n)$ deterministic runtime of the Micciancio Voulgaris
algorithm, henceforth MV, for CVPP (which also solves CVP) at the cost of a
polynomial amount of randomness (which only affects runtime, not correctness).
As in MV, our algorithm proceeds by computing a short path on the Voronoi graph
of the lattice, where lattice points are adjacent if their Voronoi cells share
a common facet, from the origin to a closest lattice vector.
  Our main technical contribution is a randomized procedure that given the
Voronoi relevant vectors of a lattice - the lattice vectors inducing facets of
the Voronoi cell - as preprocessing and any ""close enough"" lattice point to the
target, computes a path to a closest lattice vector of expected polynomial
size. This improves on the $\tilde{O}(4^n)$ path length given by the MV
algorithm. Furthermore, as in MV, each edge of the path can be computed using a
single iteration over the Voronoi relevant vectors. As a byproduct of our work,
we also give an optimal relationship between geometric and path distance on the
Voronoi graph, which we believe to be of independent interest.
","[{'version': 'v1', 'created': 'Thu, 18 Dec 2014 22:35:04 GMT'}]",2014-12-22,"[['Bonifas', 'Nicolas', ''], ['Dadush', 'Daniel', '']]","['Closest Vector Problem', 'Lattice Problems', 'Convex Geometry']"
14703,1603.03501,Reza Tourani,"S. Misra, R. Tourani, F. Natividad, T. Mick, N. Majd, H. Huang","AccConF: An Access Control Framework for Leveraging In-Network Cached
  Data in ICNs","13 pages, 6 figures",,,,cs.NI cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The fast-growing Internet traffic is increasingly becoming content-based and
driven by mobile users, with users more interested in data rather than its
source. This has precipitated the need for an information-centric Internet
architecture. Research in information-centric networks (ICNs) have resulted in
novel architectures, e.g., CCN/NDN, DONA, and PSIRP/PURSUIT; all agree on named
data based addressing and pervasive caching as integral design components. With
network-wide content caching, enforcement of content access control policies
become non-trivial. Each caching node in the network needs to enforce access
control policies with the help of the content provider. This becomes
inefficient and prone to unbounded latencies especially during provider
outages.
  In this paper, we propose an efficient access control framework for ICN,
which allows legitimate users to access and use the cached content directly,
and does not require verification/authentication by an online provider
authentication server or the content serving router. This framework would help
reduce the impact of system down-time from server outages and reduce delivery
latency by leveraging caching while guaranteeing access only to legitimate
users. Experimental/simulation results demonstrate the suitability of this
scheme for all users, but particularly for mobile users, especially in terms of
the security and latency overheads.
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2016 01:33:15 GMT'}]",2016-03-14,"[['Misra', 'S.', ''], ['Tourani', 'R.', ''], ['Natividad', 'F.', ''], ['Mick', 'T.', ''], ['Majd', 'N.', ''], ['Huang', 'H.', '']]","['Information-centric networks', 'threshold secretsharing', 'authentication', 'caching', 'access control']"
14704,0909.0174,Stylianos Basagiannis,"Stylianos Basagiannis, Panagiotis Katsaros, Andrew Pombortsis","State Space Reduction with Message Inspection in Security Protocol Model
  Checking","15 pages, 8 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Model checking is a widespread automatic formal analysis that has been
successful in discovering flaws in security protocols. However existing
possibilities for state space explosion still hinder analyses of complex
protocols and protocol configurations. Message Inspection, is a technique that
delimits the branching of the state space due to the intruder model without
excluding possible attacks. In a preliminary simulation, the intruder model
tags the eavesdropped messages with specific metadata that enable validation of
feasibility of possible attack actions. The Message Inspection algorithm then
decides based on these metadata, which attacks will certainly fail according to
known security principles. Thus, it is a priori known that i.e. an encryption
scheme attack cannot succeed if the intruder does not posses the right key in
his knowledge. The simulation terminates with a report of the attack actions
that can be safely removed, resulting in a model with a reduced state space.
","[{'version': 'v1', 'created': 'Tue, 1 Sep 2009 13:03:09 GMT'}]",2009-09-02,"[['Basagiannis', 'Stylianos', ''], ['Katsaros', 'Panagiotis', ''], ['Pombortsis', 'Andrew', '']]","['security protocols', 'verification', 'model checking', 'intrusion attacks']"
14705,1402.2389,"J\""urgen M\""unch","Adam Trendowicz, Jens Heidrich, J\""urgen M\""unch",Supporting Process Maturation with the Enhanced CoBRA Method,"14 pages. Proceedings of the DASMA Software Metric Congress (MetriKon
  2006), Magdeburger Schriften zum Empirischen Software Engineering, pages
  3-16, Potsdam, Germany, November 2-3 2006. Shaker Verlag",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cost estimation is a very crucial field for software developing companies. In
the context of learning organizations, estimation applicability and accuracy
are not the only acceptance criteria. The contribution of an estimation
technique to the understanding and maturing of related organizational processes
(such as identification of cost and productivity factors, measurement, data
validation, model validation, model maintenance) has recently been gaining
increasing importance. Yet, most of the proposed cost modeling approaches
provide software engineers with hardly any assistance in supporting related
processes. Insufficient support is provided for validating created cost models
(including underlying data collection processes) or, if valid models are
obtained, for applying them to achieve an organization's objectives such as
improved productivity or reduced schedule. This paper presents an enhancement
of the CoBRA(R) cost modeling method by systematically including additional
quantitative methods into iterative analysis-feedback cycles. Applied at Oki
Electric Industry Co., Ltd., Japan, the CoBRA(R) method contributed to the
achievement of the following objectives, including: (1) maturation of existing
measurement processes, (2) increased expertise of Oki software project decision
makers regarding cost-related software processes, and, finally, (3) reduction
of initial estimation error from an initial 120% down to 14%.
","[{'version': 'v1', 'created': 'Tue, 11 Feb 2014 07:52:16 GMT'}]",2014-02-12,"[['Trendowicz', 'Adam', ''], ['Heidrich', 'Jens', ''], ['Münch', 'Jürgen', '']]","['Cost Estimation', 'Quantitative Analysis', 'Process Improvement', 'Iterative CoBRA®']"
14706,1312.5714,Patrick Connor,Patrick C. Connor and Thomas P. Trappenberg,"Avoiding Confusion between Predictors and Inhibitors in Value Function
  Approximation","14 pages, 3 figures, 23 references, Workshop paper in ICLR 2014
  (updated based on reviewer comments)",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In reinforcement learning, the goal is to seek rewards and avoid punishments.
A simple scalar captures the value of a state or of taking an action, where
expected future rewards increase and punishments decrease this quantity.
Naturally an agent should learn to predict this quantity to take beneficial
actions, and many value function approximators exist for this purpose. In the
present work, however, we show how value function approximators can cause
confusion between predictors of an outcome of one valence (e.g., a signal of
reward) and the inhibitor of the opposite valence (e.g., a signal canceling
expectation of punishment). We show this to be a problem for both linear and
non-linear value function approximators, especially when the amount of data (or
experience) is limited. We propose and evaluate a simple resolution: to instead
predict reward and punishment values separately, and rectify and add them to
get the value needed for decision making. We evaluate several function
approximators in this slightly different value function approximation
architecture and show that this approach is able to circumvent the confusion
and thereby achieve lower value-prediction errors.
","[{'version': 'v1', 'created': 'Thu, 19 Dec 2013 19:52:52 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Feb 2015 15:35:56 GMT'}]",2015-02-19,"[['Connor', 'Patrick C.', ''], ['Trappenberg', 'Thomas P.', '']]","['Value Function Approximation', 'Conditioned Inhibition', 'Reinforcement Learning', 'Classical Conditioning']"
14707,1004.1262,Nicolas Stouls,"Jacques Julliand (LIFC), Nicolas Stouls (CITI Insa Lyon / INRIA
  Grenoble Rh\^one-Alpes), Pierre-Christophe Bu\'e (LIFC), Pierre-Alain Masson
  (LIFC)",Syntactic Abstraction of B Models to Generate Tests,"Tests and Proofs 2010, Malaga : Spain (2010)",,,,cs.LO cs.SC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a model-based testing approach as well as for the verification of
properties, B models provide an interesting solution. However, for industrial
applications, the size of their state space often makes them hard to handle. To
reduce the amount of states, an abstraction function can be used, often
combining state variable elimination and domain abstractions of the remaining
variables. This paper complements previous results, based on domain abstraction
for test generation, by adding a preliminary syntactic abstraction phase, based
on variable elimination. We define a syntactic transformation that suppresses
some variables from a B event model, in addition to a method that chooses
relevant variables according to a test purpose. We propose two methods to
compute an abstraction A of an initial model M. The first one computes A as a
simulation of M, and the second one computes A as a bisimulation of M. The
abstraction process produces a finite state system. We apply this abstraction
computation to a Model Based Testing process.
","[{'version': 'v1', 'created': 'Thu, 8 Apr 2010 07:15:48 GMT'}, {'version': 'v2', 'created': 'Mon, 31 May 2010 06:56:29 GMT'}]",2010-06-01,"[['Julliand', 'Jacques', '', 'LIFC'], ['Stouls', 'Nicolas', '', 'CITI Insa Lyon / INRIA\n  Grenoble Rhône-Alpes'], ['Bué', 'Pierre-Christophe', '', 'LIFC'], ['Masson', 'Pierre-Alain', '', 'LIFC']]","['Abstraction', 'Test Generation', '(Bi-)Simulation', 'Slicing']"
14708,1410.2702,Jin Li,"Minghui Yang, Jin Li, Keqin Feng, Dongdai Lin",Generalized Hamming Weights of Irreducible Cyclic Codes,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The generalized Hamming weight (GHW) $d_r(C)$ of linear codes $C$ is a
natural generalization of the minimum Hamming distance $d(C)(=d_1(C))$ and has
become one of important research objects in coding theory since Wei's originary
work [23] in 1991. In this paper two general formulas on $d_r(C)$ for
irreducible cyclic codes are presented by using Gauss sums and the weight
hierarchy $\{d_1(C), d_2(C), \ldots, d_k(C)\}$ $(k=\dim C)$ are completely
determined for several cases.
","[{'version': 'v1', 'created': 'Fri, 10 Oct 2014 08:04:23 GMT'}]",2014-10-13,"[['Yang', 'Minghui', ''], ['Li', 'Jin', ''], ['Feng', 'Keqin', ''], ['Lin', 'Dongdai', '']]","['generalized Hamming weight', 'irreducible cyclic code', 'Gauss sum']"
14709,2006.04371,Xiaobin Wei,"Xiaobin Wei, Jianjiang Feng, Jie Zhou","Semantics-Driven Unsupervised Learning for Monocular Depth and
  Ego-Motion Estimation",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a semantics-driven unsupervised learning approach for monocular
depth and ego-motion estimation from videos in this paper. Recent unsupervised
learning methods employ photometric errors between synthetic view and actual
image as a supervision signal for training. In our method, we exploit semantic
segmentation information to mitigate the effects of dynamic objects and
occlusions in the scene, and to improve depth prediction performance by
considering the correlation between depth and semantics. To avoid costly
labeling process, we use noisy semantic segmentation results obtained by a
pre-trained semantic segmentation network. In addition, we minimize the
position error between the corresponding points of adjacent frames to utilize
3D spatial information. Experimental results on the KITTI dataset show that our
method achieves good performance in both depth and ego-motion estimation tasks.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2020 05:55:07 GMT'}]",2020-06-09,"[['Wei', 'Xiaobin', ''], ['Feng', 'Jianjiang', ''], ['Zhou', 'Jie', '']]","['Depth prediction', 'ego-motion estimation', 'semantics-drivenunsupervised learning']"
14710,0905.2882,Maroun Bercachi,"Maroun Bercachi (I3S), Philippe Collard (I3S), Manuel Clergue (I3S),
  Sebastien Verel (I3S)","Do not Choose Representation just Change: An Experimental Study in
  States based EA",,"Genetic and Evolutionary Computation Conference 2009, Montr\'eal :
  Canada (2009)",,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our aim in this paper is to analyse the phenotypic effects (evolvability) of
diverse coding conversion operators in an instance of the states based
evolutionary algorithm (SEA). Since the representation of solutions or the
selection of the best encoding during the optimization process has been proved
to be very important for the efficiency of evolutionary algorithms (EAs), we
will discuss a strategy of coupling more than one representation and different
procedures of conversion from one coding to another during the search.
Elsewhere, some EAs try to use multiple representations (SM-GA, SEA, etc.) in
intention to benefit from the characteristics of each of them. In spite of
those results, this paper shows that the change of the representation is also a
crucial approach to take into consideration while attempting to increase the
performances of such EAs. As a demonstrative example, we use a two states SEA
(2-SEA) which has two identical search spaces but different coding conversion
operators. The results show that the way of changing from one coding to another
and not only the choice of the best representation nor the representation
itself is very advantageous and must be taken into account in order to
well-desing and improve EAs execution.
","[{'version': 'v1', 'created': 'Mon, 18 May 2009 13:35:14 GMT'}]",2009-05-19,"[['Bercachi', 'Maroun', '', 'I3S'], ['Collard', 'Philippe', '', 'I3S'], ['Clergue', 'Manuel', '', 'I3S'], ['Verel', 'Sebastien', '', 'I3S']]","['States based Evolutionary Algorithm', 'Representation', 'Coding Coupling', 'Coding Conversion']"
14711,1109.1202,Abhijit Raorane Aravind,Abhijit Raorane and R.V.Kulkarni,Data Mining Techniques: A Source for Consumer Behavior Analysis,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Various studies on consumer purchasing behaviors have been presented and used
in real problems. Data mining techniques are expected to be a more effective
tool for analyzing consumer behaviors. However, the data mining method has
disadvantages as well as advantages. Therefore, it is important to select
appropriate techniques to mine databases. The objective of this paper is to
know consumer behavior, his psychological condition at the time of purchase and
how suitable data mining method apply to improve conventional method. Moreover,
in an experiment, association rule is employed to mine rules for trusted
customers using sales data in a super market industry
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2011 14:32:05 GMT'}]",2011-09-07,"[['Raorane', 'Abhijit', ''], ['Kulkarni', 'R. V.', '']]","['Consumer behavior', 'Data mining', 'Association Rule', 'Super market']"
14712,1403.0728,Tolga Birdal,"Tolga Birdal, Emrah Bala",A Novel Method for Vectorization,"Prepared in Siggraph format, not published in a conference, 7 pages,
  9 figures",,,,cs.CV cs.CG cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vectorization of images is a key concern uniting computer graphics and
computer vision communities. In this paper we are presenting a novel idea for
efficient, customizable vectorization of raster images, based on Catmull Rom
spline fitting. The algorithm maintains a good balance between photo-realism
and photo abstraction, and hence is applicable to applications with artistic
concerns or applications where less information loss is crucial. The resulting
algorithm is fast, parallelizable and can satisfy general soft realtime
requirements. Moreover, the smoothness of the vectorized images aesthetically
outperforms outputs of many polygon-based methods
","[{'version': 'v1', 'created': 'Tue, 4 Mar 2014 09:52:13 GMT'}]",2014-03-05,"[['Birdal', 'Tolga', ''], ['Bala', 'Emrah', '']]","['vectorization', 'vector conversion', 'image processing', 'segmentation']"
14713,1511.09290,Pedro Saleiro,"Pedro Saleiro, Lu\'is Sarmento","""Piaf"" vs ""Adele"": classifying encyclopedic queries using automatically
  labeled training data","in Proceedings of the 10th Conference on Open Research Areas in
  Information Retrieval, 2013",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Encyclopedic queries express the intent of obtaining information typically
available in encyclopedias, such as biographical, geographical or historical
facts. In this paper, we train a classifier for detecting the encyclopedic
intent of web queries. For training such a classifier, we automatically label
training data from raw query logs. We use click-through data to select positive
examples of encyclopedic queries as those queries that mostly lead to Wikipedia
articles. We investigated a large set of features that can be generated to
describe the input query. These features include both term-specific patterns as
well as query projections on knowledge bases items (e.g. Freebase). Results
show that using these feature sets it is possible to achieve an F1 score above
87%, competing with a Google-based baseline, which uses a much wider set of
signals to boost the ranking of Wikipedia for potential encyclopedic queries.
The results also show that both query projections on Wikipedia article titles
and Freebase entity match represent the most relevant groups of features. When
the training set contains frequent positive examples (i.e rare queries are
excluded) results tend to improve.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2015 13:08:31 GMT'}]",2015-12-01,"[['Saleiro', 'Pedro', ''], ['Sarmento', 'Luís', '']]","['encyclopedic queries', 'query intent', 'query log analysis']"
14714,1106.4918,Yao Sun,"Yao Sun, Dingkang Wang","A Generalized Criterion for Signature-based Algorithms to Compute
  Gr\""obner Bases","This paper is a substantially expanded version of the paper entitled
  ""A Generalized Criterion for Signature Related Gr\""obner Basis Algorithms"",
  which was presented at ISSAC 2011",,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A generalized criterion for signature-based algorithms to compute Gr\""obner
bases is proposed in this paper. This criterion is named by ""generalized
criterion"", because it can be specialized to almost all existing criteria for
signature-based algorithms which include the famous F5 algorithm, F5C, extended
F5, G$^2$V and the GVW algorithm. The main purpose of current paper is to study
in theory which kind of criteria is correct in signature-based algorithms and
provide a generalized method to develop new criteria. For this purpose, by
studying some key facts and observations of signature-based algorithms, a
generalized criterion is proposed. The generalized criterion only relies on a
partial order defined on a set of polynomials. When specializing the partial
order to appropriate specific orders, the generalized criterion can specialize
to almost all existing criteria of signature-based algorithms. For {\em
admissible} partial orders, a proof is presented for the correctness of the
algorithm that is based on this generalized criterion. And the partial orders
implied by the criteria of F5 and GVW are also shown to be admissible. More
importantly, the generalized criterion provides an effective method to check
whether a new criterion is correct as well as to develop new criteria for
signature-based algorithms.
","[{'version': 'v1', 'created': 'Fri, 24 Jun 2011 09:21:56 GMT'}]",2011-06-27,"[['Sun', 'Yao', ''], ['Wang', 'Dingkang', '']]","['Gr¨obner basis', 'F5', 'signature-based algorithm', 'criterion']"
14715,1312.6190,Son Tran,"Son N. Tran, Artur d'Avila Garcez",Adaptive Feature Ranking for Unsupervised Transfer Learning,"9 pages 7 figures, new experimental results on ranking and transfer
  have been added, typo fixed",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transfer Learning is concerned with the application of knowledge gained from
solving a problem to a different but related problem domain. In this paper, we
propose a method and efficient algorithm for ranking and selecting
representations from a Restricted Boltzmann Machine trained on a source domain
to be transferred onto a target domain. Experiments carried out using the
MNIST, ICDAR and TiCC image datasets show that the proposed adaptive feature
ranking and transfer learning method offers statistically significant
improvements on the training of RBMs. Our method is general in that the
knowledge chosen by the ranking function does not depend on its relation to any
specific target domain, and it works with unsupervised learning and
knowledge-based transfer.
","[{'version': 'v1', 'created': 'Sat, 21 Dec 2013 01:50:08 GMT'}, {'version': 'v2', 'created': 'Wed, 28 May 2014 16:35:17 GMT'}]",2014-05-29,"[['Tran', 'Son N.', ''], ['Garcez', ""Artur d'Avila"", '']]","['Feature Selection', 'Transfer Learning', 'Restricted Boltzmann Machines']"
14716,1610.09083,Steven C.H. Hoi,"Yue Wu, Steven C.H. Hoi, Chenghao Liu, Jing Lu, Doyen Sahoo, Nenghai
  Yu",SOL: A Library for Scalable Online Learning Algorithms,5 pages,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  SOL is an open-source library for scalable online learning algorithms, and is
particularly suitable for learning with high-dimensional data. The library
provides a family of regular and sparse online learning algorithms for
large-scale binary and multi-class classification tasks with high efficiency,
scalability, portability, and extensibility. SOL was implemented in C++, and
provided with a collection of easy-to-use command-line tools, python wrappers
and library calls for users and developers, as well as comprehensive documents
for both beginners and advanced users. SOL is not only a practical machine
learning toolbox, but also a comprehensive experimental platform for online
learning research. Experiments demonstrate that SOL is highly efficient and
scalable for large-scale machine learning with high-dimensional data.
","[{'version': 'v1', 'created': 'Fri, 28 Oct 2016 05:47:51 GMT'}]",2016-10-31,"[['Wu', 'Yue', ''], ['Hoi', 'Steven C. H.', ''], ['Liu', 'Chenghao', ''], ['Lu', 'Jing', ''], ['Sahoo', 'Doyen', ''], ['Yu', 'Nenghai', '']]","['Online Learning', 'Scalable Machine Learning', 'High Dimensionality', 'Sparse Learning']"
14717,1606.09446,Han Xiao,"Han Xiao, Polina Rozenshtein, and Aristides Gionis","Discovering topically- and temporally-coherent events in interaction
  networks",,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the increasing use of online communication platforms, such as email,
twitter, and messaging applications, we are faced with a growing amount of data
that combine content (what is said), time (when), and user (by whom)
information. An important computational challenge is to analyze these data,
discover meaningful patterns, and understand what is happening. We consider the
problem of mining online communication data and finding top-k temporal events.
We define a temporal event to be a coherent topic that is discussed frequently,
in a relatively short time span, while the information ow of the event respects
the underlying network structure. We construct our model for detecting temporal
events in two steps. We first introduce the notion of interaction meta-graph,
which connects associated interactions. Using this notion, we define a temporal
event to be a subset of interactions that (i) are topically and temporally
close and (ii) correspond to a tree that captures the information ow. Finding
the best temporal event leads to budget version of the prize-collecting
Steiner-tree (PCST) problem, which we solve using three different methods: a
greedy approach, a dynamic-programming algorithm, and an adaptation to an
existing approximation algorithm. The problem of finding the top- k events
among a set of candidate events maps to maximum set-cover problem, and thus,
solved by greedy. We compare and analyze our algorithms in both synthetic and
real datasets, such as twitter and email communication. The results show that
our methods are able to detect meaningful temporal events.
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2016 12:08:06 GMT'}, {'version': 'v2', 'created': 'Sun, 3 Jul 2016 17:30:26 GMT'}]",2016-07-05,"[['Xiao', 'Han', ''], ['Rozenshtein', 'Polina', ''], ['Gionis', 'Aristides', '']]","['social-network analysis', 'temporal networks', 'event detection']"
14718,1607.04091,Robert Dahl Jacobsen,Robert Dahl Jacobsen and Morten Nielsen and Morten Grud Rasmussen,Generalized Sampling in Julia,,,,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generalized sampling is a numerically stable framework for obtaining
reconstructions of signals in different bases and frames from their samples. In
this paper, we will introduce a carefully documented toolbox for performing
generalized sampling in Julia. Julia is a new language for technical computing
with focus on performance, which is ideally suited to handle the large size
problems often encountered in generalized sampling. The toolbox provides
specialized solutions for the setup of Fourier bases and wavelets. The
performance of the toolbox is compared to existing implementations of
generalized sampling in MATLAB.
","[{'version': 'v1', 'created': 'Thu, 14 Jul 2016 11:26:28 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Nov 2016 09:58:28 GMT'}]",2016-11-24,"[['Jacobsen', 'Robert Dahl', ''], ['Nielsen', 'Morten', ''], ['Rasmussen', 'Morten Grud', '']]","['Software Package', 'Generalized Sampling', 'Julia', 'Fourier basis', 'Wavelets', 'Performance']"
14719,1704.06713,Lotfi Hajjem Mr,"Lotfi Hajjem, Salah Benabdallah, Fouad Ben Abdelaziz",A dynamic resource allocation decision model for IT security,"6 pages, 2010 Second International Conference on Engineering System
  Management and Applications",,,INSPEC Accession Number: 11466975,cs.CR cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today, with the continued growth in using information and communication
technologies (ICT) for business purposes, business organizations become
increasingly dependent on their information systems. Thus, they need to protect
them from the different attacks exploiting their vulnerabilities. To do so, the
organization has to use security technologies, which may be proactive or
reactive ones. Each security technology has a relative cost and addresses
specific vulnerabilities. Therefore, the organization has to put in place the
appropriate security technologies set that minimizes the information system s
vulnerabilities with a minimal cost. This bi objective problem will be
considered as a resources allocation problem (RAP) where security technologies
represent the resources to be allocated. However, the set of vulnerabilities
may change, periodically, with the continual appearance of new ones. Therefore,
the security technologies set should be flexible to face these changes, in real
time, and the problem becomes a dynamic one. In this paper, we propose a
harmony search based algorithm to solve the bi objective dynamic resource
allocation decision model. This approach was compared to a genetic algorithm
and provided good results.
","[{'version': 'v1', 'created': 'Fri, 21 Apr 2017 21:48:23 GMT'}]",2017-04-25,"[['Hajjem', 'Lotfi', ''], ['Benabdallah', 'Salah', ''], ['Abdelaziz', 'Fouad Ben', '']]","['Dynamic resource allocation', 'IT security', 'Harmony search', 'Multiobjective optimization']"
14720,0710.4780,Jesus M. Almendros-Jimenez Dr.,"J. M. Almendros-Jim\'enez and A. Becerra-Ter\'on and F. J.
  Enciso-Ba\~nos",Querying XML Documents in Logic Programming,,,,,cs.PL cs.DB,,"  Extensible Markup Language (XML) is a simple, very flexible text format
derived from SGML. Originally designed to meet the challenges of large-scale
electronic publishing, XML is also playing an increasingly important role in
the exchange of a wide variety of data on the Web and elsewhere. XPath language
is the result of an effort to provide address parts of an XML document. In
support of this primary purpose, it becomes in a query language against an XML
document. In this paper we present a proposal for the implementation of the
XPath language in logic programming. With this aim we will describe the
representation of XML documents by means of a logic program. Rules and facts
can be used for representing the document schema and the XML document itself.
In particular, we will present how to index XML documents in logic programs:
rules are supposed to be stored in main memory, however facts are stored in
secondary memory by using two kind of indexes: one for each XML tag, and other
for each group of terminal items. In addition, we will study how to query by
means of the XPath language against a logic program representing an XML
document. It evolves the specialization of the logic program with regard to the
XPath expression. Finally, we will also explain how to combine the indexing and
the top-down evaluation of the logic program. To appear in Theory and Practice
of Logic Programming (TPLP)""
","[{'version': 'v1', 'created': 'Thu, 25 Oct 2007 10:45:08 GMT'}]",2007-10-26,"[['Almendros-Jiménez', 'J. M.', ''], ['Becerra-Terón', 'A.', ''], ['Enciso-Baños', 'F. J.', '']]","['Logic Programming', 'XML', 'XPath']"
14721,1702.05383,Kumar Sankar Ray,Kumar S. Ray and Mandrita Mondal,Theorem Proving Based on Semantics of DNA Strand Graph,"25 pages,12 figures",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Because of several technological limitations of traditional silicon based
computing, for past few years a paradigm shift, from silicon to carbon, is
occurring in computational world. DNA computing has been considered to be quite
promising in solving computational and reasoning problems by using DNA strands.
Resolution, an important aspect of automated theorem proving and mathematical
logic, is a rule of inference which leads to proof by contradiction technique
for sentences in propositional logic and first-order logic. This can also be
called refutation theorem-proving. In this paper we have shown how the theorem
proving with resolution refutation by DNA computation can be represented by the
semantics of process calculus and strand graph.
","[{'version': 'v1', 'created': 'Wed, 15 Feb 2017 11:12:34 GMT'}]",2017-02-20,"[['Ray', 'Kumar S.', ''], ['Mondal', 'Mandrita', '']]","['theorem proving', 'resolution refutation', 'strand graph', 'process calculus', 'DNA computing', 'propositional logic', 'proof by contradiction', 'strand displacement']"
14722,1002.0908,Ping Zhu,Ping Zhu and Qiaoyan Wen,Homomorphisms between fuzzy information systems revisited,10 pages,"Applied Mathematics Letters, 24(9): 1548-1553, 2011",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, Wang et al. discussed the properties of fuzzy information systems
under homomorphisms in the paper [C. Wang, D. Chen, L. Zhu, Homomorphisms
between fuzzy information systems, Applied Mathematics Letters 22 (2009)
1045-1050], where homomorphisms are based upon the concepts of consistent
functions and fuzzy relation mappings. In this paper, we classify consistent
functions as predecessor-consistent and successor-consistent, and then proceed
to present more properties of consistent functions. In addition, we improve
some characterizations of fuzzy relation mappings provided by Wang et al.
","[{'version': 'v1', 'created': 'Thu, 4 Feb 2010 07:09:46 GMT'}]",2011-11-08,"[['Zhu', 'Ping', ''], ['Wen', 'Qiaoyan', '']]","['Consistent function', 'Fuzzy information system', 'Fuzzy relation', 'Fuzzy relation mapping', 'Homomorphism']"
14723,0710.1772,Flore Barcellini,"Flore Barcellini (INRIA Rocquencourt), Fran\c{c}oise D\'etienne (INRIA
  Rocquencourt), Jean-Marie Burkhardt (INRIA Rocquencourt, LEI)","Cross-Participants : fostering design-use mediation in an Open Source
  Software community",,Dans European Conference on Cognitive Ergonomics (2007) 57-64,,,cs.CY cs.HC cs.SE,,"  Motivation - This research aims at investigating emerging roles and forms of
participation fostering design-use mediation during the Open Source Software
design process Research approach - We compare online interactions for a
successful ""pushed-by-users"" design process with unsuccessful previous
proposals. The methodology developed, articulate structural analyses of the
discussions (organization of discussions, participation) to actions to the code
and documentation made by participants to the project. We focus on the
useroriented and the developer-oriented mailing-lists of the Python project.
Findings/Design - We find that key-participants, the cross-participants, foster
the design process and act as boundary spanners between the users and the
developers' communities. Research limitations/Implications - These findings can
be reinforced developing software to automate the structural analysis of
discussions and actions to the code and documentation. Further analyses,
supported by these tools, will be necessary to generalise our results.
Originality/Value - The analysis of participation among the three interaction
spaces of OSS design (discussion, documentation and implementation) is the main
originality of this work compared to other OSS research that mainly analyse one
or two spaces. Take away message - Beside the idealistic picture that users may
intervene freely in the process, OSS design is boost and framed by some
key-participants and specific rules and there can be barriers to users'
participation
","[{'version': 'v1', 'created': 'Tue, 9 Oct 2007 14:44:44 GMT'}]",2007-10-10,"[['Barcellini', 'Flore', '', 'INRIA Rocquencourt'], ['Détienne', 'Françoise', '', 'INRIA\n  Rocquencourt'], ['Burkhardt', 'Jean-Marie', '', 'INRIA Rocquencourt, LEI']]","['Design-use mediation', 'open source', 'online community', 'distributed participatory design']"
14724,1505.01577,Kazuhisa Nakasho,Kazuhisa Nakasho and Yasunari Shidama,"Documentation Generator Focusing on Symbols for the HTML-ized Mizar
  Library","5 pages, 1 figures, Conference on Intelligent Computer Mathematics
  2015 (CICM2015)",,,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this project is to collect symbol information in the Mizar
Mathematical Library and manipulate it into practical and organized
documentation. Inspired by the MathWiki project and API reference systems for
computer programs, we developed a documentation generator focusing on symbols
for the HTML-ized Mizar library. The system has several helpful features,
including a symbol list, incremental search, and a referrer list. It targets
those who use proof assistance systems, the volume of whose libraries has been
rapidly increasing year by year.
","[{'version': 'v1', 'created': 'Thu, 7 May 2015 04:09:24 GMT'}]",2015-05-08,"[['Nakasho', 'Kazuhisa', ''], ['Shidama', 'Yasunari', '']]","['Mizar', 'mathematical knowledge management', 'search system', 'documentation generator']"
14725,1704.07056,Zhiyuan Zha,"Zhiyuan Zha, Xinggan Zhang, Yu Wu, Qiong Wang and Lan Tang","Non-Convex Weighted Lp Nuclear Norm based ADMM Framework for Image
  Restoration",arXiv admin note: text overlap with arXiv:1611.08983,,,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Since the matrix formed by nonlocal similar patches in a natural image is of
low rank, the nuclear norm minimization (NNM) has been widely used in various
image processing studies. Nonetheless, nuclear norm based convex surrogate of
the rank function usually over-shrinks the rank components and makes different
components equally, and thus may produce a result far from the optimum. To
alleviate the above-mentioned limitations of the nuclear norm, in this paper we
propose a new method for image restoration via the non-convex weighted Lp
nuclear norm minimization (NCW-NNM), which is able to more accurately enforce
the image structural sparsity and self-similarity simultaneously. To make the
proposed model tractable and robust, the alternative direction multiplier
method (ADMM) is adopted to solve the associated non-convex minimization
problem. Experimental results on various types of image restoration problems,
including image deblurring, image inpainting and image compressive sensing (CS)
recovery, demonstrate that the proposed method outperforms many current
state-of-the-art methods in both the objective and the perceptual qualities.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 07:02:53 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Jun 2017 05:33:48 GMT'}]",2017-06-28,"[['Zha', 'Zhiyuan', ''], ['Zhang', 'Xinggan', ''], ['Wu', 'Yu', ''], ['Wang', 'Qiong', ''], ['Tang', 'Lan', '']]","['Image restoration', 'low rank', 'nuclear norm minimization', 'weighted']"
14726,0801.2838,Avraham Trahtman N,A.N. Trahtman,An Algorithm for Road Coloring,10 pages,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A coloring of edges of a finite directed graph turns the graph into
finite-state automaton. The synchronizing word of a deterministic automaton is
a word in the alphabet of colors (considered as letters) of its edges that maps
the automaton to a single state. A coloring of edges of a directed graph of
uniform outdegree (constant outdegree of any vertex) is synchronizing if the
coloring turns the graph into a deterministic finite automaton possessing a
synchronizing word. The road coloring problem is the problem of synchronizing
coloring of a directed finite strongly connected graph of uniform outdegree if
the greatest common divisor of the lengths of all its cycles is one. The
problem posed in 1970 had evoked a noticeable interest among the specialists in
the theory of graphs, automata, codes, symbolic dynamics as well as among the
wide mathematical community. A polynomial time algorithm of $O(n^3)$ complexity
in the most worst case and quadratic in majority of studied cases for the road
coloring of the considered graph is presented below. The work is based on
recent positive solution of the road coloring problem. The algorithm was
implemented in the package TESTAS
","[{'version': 'v1', 'created': 'Fri, 18 Jan 2008 09:22:46 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Nov 2009 06:11:35 GMT'}, {'version': 'v3', 'created': 'Tue, 23 Nov 2010 11:06:54 GMT'}]",2010-11-24,"[['Trahtman', 'A. N.', '']]","['algorithm', 'road coloring', 'graph', 'deterministic finite automaton', 'synchronization']"
14727,1512.00196,"Stefan Sch\""onig","Stefan Sch\""onig","SQL Queries for Declarative Process Mining on Event Logs of Relational
  Databases",,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Flexible business processes can often be modelled more easily using a
declarative rather than a procedural modelling approach. Process mining aims at
automating the discovery of business process models. Existing declarative
process mining approaches either suffer performance issues with real-life event
logs or limit their expressiveness to a specific set of constaint types.
Lately, with RelationalXES a relational database architecture for storing event
log data has been introduced. In this technical report, we introduce a mining
approach that directly works on relational event data by querying the log with
conventional SQL. We provide a list of SQL queries for discovering a set of
commonly used and mined process constraints.
","[{'version': 'v1', 'created': 'Tue, 1 Dec 2015 09:44:05 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Dec 2015 12:06:50 GMT'}]",2016-11-04,"[['Schönig', 'Stefan', '']]","['Declarative Process Mining', 'Relational Databases', 'SQL']"
14728,1304.5297,Muhammad Anshari Mr,"Muhammad Anshari, Mohammad Nabil Almunawar","Shifting Role of Customer from Recipient To Partner of Care In
  Healthcare Organization","The 13th ASEAN Graduate Business and Economics Program (AGBEP) Annual
  Meeting & Conference April, 2 2013",,,13 p. 11,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most recent e-health initiatives perceive customers (patients) as recipients
of medical care where they do not have a significant role in the process of
health decision making. However, the advancement of Web 2.0 offers patients to
have a greater role in the decision making process related to their health as
they can be empowered with the ability to access and control information that
fits with their personalized needs. However, providing patient empowerment in
e-health through Web 2.0 is challenging task because the complexity nature of
healthcare business processes. Empowerment closely relates to the concept of
Customer Relationship Management (CRM) in managing good relationships with the
customers. The adoption of Web 2.0 in CRM systems is known as Social CRM or CRM
2.0. Social CRM emerges to accommodate dynamic means of interaction between
patients with their healthcare providers. The aim of this paper is to present a
model that embeds empowerment of patient through Social CRM intervention that
may extend the role of the patient as an individual health actor, a social
health agent, and a medical care partner. A survey has been conducted to gain a
feedback from customers regarding the proposed model. A prototype derived from
the model namely Clinic 2.0 has also been developed. Using the prototype we
measure its impact towards customer satisfaction and health literacy. The
results show that the system intervention through Clinic 2.0 improves the level
of satisfaction and health literacy of participants.
","[{'version': 'v1', 'created': 'Fri, 19 Apr 2013 02:26:29 GMT'}]",2013-04-22,"[['Anshari', 'Muhammad', ''], ['Almunawar', 'Mohammad Nabil', '']]","['Empowerment', 'Social CRM', 'E-Health', 'Value Shop', 'Clinic 2']"
14729,1510.05120,Philipp Mayr,"Philipp Mayr, Ingo Frommholz, Guillaume Cabanac","Bibliometric-Enhanced Information Retrieval: 3rd International BIR
  Workshop","4 pages, 38th European Conference on IR Research, ECIR 2016, Padova,
  Italy. arXiv admin note: substantial text overlap with arXiv:1501.02646",,,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The BIR workshop brings together experts in Bibliometrics and Information
Retrieval. While sometimes perceived as rather loosely related, these research
areas share various interests and face similar challenges. Our motivation as
organizers of the BIR workshop stemmed from a twofold observation. First, both
communities only partly overlap, albeit sharing various interests. Second, it
will be profitable for both sides to tackle some of the emerging problems that
scholars face today when they have to identify relevant and high quality
literature in the fast growing number of electronic publications available
worldwide. Bibliometric techniques are not yet used widely to enhance retrieval
processes in digital libraries, although they offer value-added effects for
users. Information professionals working in libraries and archives, however,
are increasingly confronted with applying bibliometric techniques in their
services. The first BIR workshop in 2014 set the research agenda by introducing
each group to the other, illustrating state-of-the-art methods, reporting on
current research problems, and brainstorming about common interests. The second
workshop in 2015 further elaborated these themes. This third BIR workshop aims
to foster a common ground for the incorporation of bibliometric-enhanced
services into scholarly search engine interfaces. In particular we will address
specific communities, as well as studies on large, cross-domain collections
like Mendeley and ResearchGate. This third BIR workshop addresses explicitly
both scholarly and industrial researchers.
","[{'version': 'v1', 'created': 'Sat, 17 Oct 2015 11:51:26 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Dec 2015 04:51:19 GMT'}]",2015-12-21,"[['Mayr', 'Philipp', ''], ['Frommholz', 'Ingo', ''], ['Cabanac', 'Guillaume', '']]","['Bibliometrics', 'Scientometrics', 'Informetrics', 'Information Retrieval', 'Digital Libraries']"
14730,1705.05786,"Gwena\""el Richomme","Gwena\""el Richomme",A Characterization of Infinite LSP Words,,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  G. Fici proved that a finite word has a minimal suffix automaton if and only
if all its left special factors occur as prefixes. He called LSP all finite and
infinite words having this latter property. We characterize here infinite LSP
words in terms of $S$-adicity. More precisely we provide a finite set of
morphisms $S$ and an automaton ${\cal A}$ such that an infinite word is LSP if
and only if it is $S$-adic and all its directive words are recognizable by
${\cal A}$.
","[{'version': 'v1', 'created': 'Tue, 16 May 2017 16:08:06 GMT'}]",2017-05-17,"[['Richomme', 'Gwenaël', '']]","['generalizations of Sturmian words', 'morphisms', 'S-adicity']"
14731,1606.06644,Amadou Kane,Amadou Moctar Kane,How DNA Cryptography can help whistleblowers and refugees,22 pages,,,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The recent progress in DNA sequencing will probably revolutionize the world
of electronic. Hence, we went from DNA sequencing that only research centers
could realize, to portable, tiny and inexpensive tools. So, it is likely that
in a few years these DNA sequencers will be included in our smartphones.
  The purpose of this paper is to support this revolution, by using the DNA
cryptography, hash functions and social networks. The first application will
introduce a mutual entity authentication protocol in order to help waifs,
refugees, and victims of human trafficking to find their biological parents
online.
  The second application will also use the DNA cryptography and the social
networks to protect whistleblowers' actions. For example, this method will
allow whistleblowers to securely broadcast on social networks, their
information with one grape.
","[{'version': 'v1', 'created': 'Mon, 11 Apr 2016 16:12:09 GMT'}]",2016-06-22,"[['Kane', 'Amadou Moctar', '']]","['DNA Cryptography', 'Privacy', 'Paternity testing', 'Short tandem repeats', 'Anonymity']"
14732,0710.4800,EDA Publishing Association,"Hala A. Farouk, Magdy Saeb","An Improved FPGA Implementation of the Modified Hybrid Hiding Encryption
  Algorithm (MHHEA) for Data Communication Security",Submitted on behalf of EDAA (http://www.edaa.com/),"Dans Design, Automation and Test in Europe | Designers'Forum -
  DATE'05, Munich : Allemagne (2005)",,,cs.CR,,"  The hybrid hiding encryption algorithm, as its name implies, embraces
concepts from both steganography and cryptography. In this exertion, an
improved micro-architecture Field Programmable Gate Array (FPGA) implementation
of this algorithm is presented. This design overcomes the observed limitations
of a previously-designed micro-architecture. These observed limitations are: no
exploitation of the possibility of parallel bit replacement, and the fact that
the input plaintext was encrypted serially, which caused a dependency between
the throughput and the nature of the used secret key. This dependency can be
viewed by some as vulnerability in the security of the implemented
micro-architecture. The proposed modified micro-architecture is constructed
using five basic modules. These modules are; the message cache, the message
alignment module, the key cache, the comparator, and at last the encryption
module. In this work, we provide comprehensive simulation and implementation
results. These are: the timing diagrams, the post-implementation timing and
routing reports, and finally the floor plan. Moreover, a detailed comparison
with other FPGA implementations is made available and discussed.
","[{'version': 'v1', 'created': 'Thu, 25 Oct 2007 11:55:19 GMT'}]",2011-11-09,"[['Farouk', 'Hala A.', ''], ['Saeb', 'Magdy', '']]","['FPGA', 'micro-architecture', 'data communication security', 'encryption', 'steganography', 'cryptography', 'algorithm']"
14733,1602.08979,R K Bisht,Raj Kishor Bisht,A fuzzy based conceptual framework for career counselling,,"Advance Computational Intelligence: An international
  Journal,(2015), Vol 2, No. 4, 27-35",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Career guidance for students, particularly in rural areas is a challenging
issue in India. In the present era of digitalization, there is a need of an
automated system that can analyze a student for his/her capabilities, suggest a
career and provide related information. Keeping in mind the requirement, the
present paper is an effort in this direction. In this paper, a fuzzy based
conceptual framework has been suggested. It has two parts; in the first part a
students will be analyzed for his/her capabilities and in the second part the
available courses, job aspects related to their capabilities will be suggested.
To analyze a student, marks in various subject in 10+2 standards and vocational
interest in different fields have been considered and fuzzy sets have been
formed. On example basis, fuzzy inference rules have been framed for analyzing
the abilities in engineering, medical and hospitality fields only. In second
part, concept of composition of relations has been used to suggest the related
courses and jobs.
","[{'version': 'v1', 'created': 'Mon, 9 Nov 2015 09:14:50 GMT'}]",2016-03-01,"[['Bisht', 'Raj Kishor', '']]","['Career Counselling', 'Fuzzy sets', 'Fuzzy inference rules', 'compositions of relations']"
14734,1306.2556,Pradeep  Singla,"Pradeep Singla, Aakash Gupta, Ashutosh Bhardwaj, Pulkit Basia",An Optimized Design of Reversible Sequential Digital Circuits,"Proceedings of NCECST-2013, Bareily",,,,cs.OH,http://creativecommons.org/licenses/by/3.0/,"  In the today's era, reversible logics are the promising technology for the
designing of low power digital logic system having major application in the
field of nanotechnology, quantum computation, DNA and other low power digital
circuits. Reversible logics provide zero power dissipation (Ideally) in the
digital operations. There are numbers of circuit designed by the reversible
logics and sequential circuits have their own importance in the digital
systems. In this paper authors provides a optimized approach and optimized
design for the sequential circuit (counter as an example) by using the MUX gate
(a reversible gate) which provides the better results against the previous
designs discussed in the literature. The proposed design has lower quantum
cost, garbage output, constant input and total number of logical calculations
performing by the design.
","[{'version': 'v1', 'created': 'Mon, 10 Jun 2013 15:32:56 GMT'}]",2013-06-12,"[['Singla', 'Pradeep', ''], ['Gupta', 'Aakash', ''], ['Bhardwaj', 'Ashutosh', ''], ['Basia', 'Pulkit', '']]","['Reversible Logics', 'Quantum Cost', 'Garbage Output', 'Counter', 'Total Logical Calculations']"
14735,1505.06596,Masahiro Shibata,"Masahiro Shibata, Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa,
  Toshimitsu Masuzawa",Partial Gathering of Mobile Agents in Asynchronous Rings,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider the partial gathering problem of mobile agents in
asynchronous unidirectional rings equipped with whiteboards on nodes. The
partial gathering problem is a new generalization of the total gathering
problem. The partial gathering problem requires, for a given integer $g$, that
each agent should move to a node and terminate so that at least $g$ agents
should meet at the same node. The requirement for the partial gathering problem
is weaker than that for the (well-investigated) total gathering problem, and
thus, we have interests in clarifying the difference on the move complexity
between them. We propose three algorithms to solve the partial gathering
problem. The first algorithm is deterministic but requires unique ID of each
agent. This algorithm achieves the partial gathering in $O(gn)$ total moves,
where $n$ is the number of nodes. The second algorithm is randomized and
requires no unique ID of each agent (i.e., anonymous). This algorithm achieves
the partial gathering in expected $O(gn)$ total moves. The third algorithm is
deterministic and requires no unique ID of each agent. For this case, we show
that there exist initial configurations in which no algorithm can solve the
problem and agents can achieve the partial gathering in $O(kn)$ total moves for
solvable initial configurations, where $k$ is the number of agents. Note that
the total gathering problem requires $\Omega (kn)$ total moves, while the
partial gathering problem requires $\Omega (gn)$ total moves in each model.
Hence, we show that the move complexity of the first and second algorithms is
asymptotically optimal.
","[{'version': 'v1', 'created': 'Mon, 25 May 2015 11:29:29 GMT'}, {'version': 'v2', 'created': 'Fri, 29 May 2015 01:00:38 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Sep 2015 05:39:14 GMT'}]",2015-09-11,"[['Shibata', 'Masahiro', ''], ['Kawai', 'Shinji', ''], ['Ooshita', 'Fukuhito', ''], ['Kakugawa', 'Hirotsugu', ''], ['Masuzawa', 'Toshimitsu', '']]","['distributed system', 'mobile agent', 'gathering problem', 'partialgathering']"
14736,1702.02125,Eug\'enio Rodrigues,"Eug\'enio Rodrigues and Lu\'isa Dias Pereira and Ad\'elio Rodrigues
  Gaspar and \'Alvaro Gomes and Manuel Carlos Gameiro da Silva",Estimation of classrooms occupancy using a multi-layer perceptron,"6 pages, 2 figures, conference article",,,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a multi-layer perceptron model for the estimation of
classrooms number of occupants from sensed indoor environmental data-relative
humidity, air temperature, and carbon dioxide concentration. The modelling
datasets were collected from two classrooms in the Secondary School of Pombal,
Portugal. The number of occupants and occupation periods were obtained from
class attendance reports. However, post-class occupancy was unknown and the
developed model is used to reconstruct the classrooms occupancy by filling the
unreported periods. Different model structure and environment variables
combination were tested. The model with best accuracy had as input vector 10
variables of five averaged time intervals of relative humidity and carbon
dioxide concentration. The model presented a mean square error of 1.99,
coefficient of determination of 0.96 with a significance of p-value < 0.001,
and a mean absolute error of 1 occupant. These results show promising
estimation capabilities in uncertain indoor environment conditions.
","[{'version': 'v1', 'created': 'Tue, 7 Feb 2017 18:17:25 GMT'}]",2017-02-08,"[['Rodrigues', 'Eugénio', ''], ['Pereira', 'Luísa Dias', ''], ['Gaspar', 'Adélio Rodrigues', ''], ['Gomes', 'Álvaro', ''], ['da Silva', 'Manuel Carlos Gameiro', '']]","['occupancy', 'indoor environment', 'estimation', 'learning algorithm', 'neural network']"
14737,1304.3792,M.M.A. Hashem,"A. R. M. Jalal Uddin Jamali, M. M. A. Hashem, and Md. Bazlar Rahman","Solving Linear Equations Using a Jacobi Based Time-Variant Adaptive
  Hybrid Evolutionary Algorithm","arXiv admin note: substantial text overlap with arXiv:1304.3200,
  arXiv:1304.2097","Procs. of the 7th International Conference on Computer &
  Information Technology (ICCIT 2004), pp. 688-693, Dhaka, Bangladesh, December
  26-28, (2004)",,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Large set of linear equations, especially for sparse and structured
coefficient (matrix) equations, solutions using classical methods become
arduous. And evolutionary algorithms have mostly been used to solve various
optimization and learning problems. Recently, hybridization of classical
methods (Jacobi method and Gauss-Seidel method) with evolutionary computation
techniques have successfully been applied in linear equation solving. In the
both above hybrid evolutionary methods, uniform adaptation (UA) techniques are
used to adapt relaxation factor. In this paper, a new Jacobi Based Time-Variant
Adaptive (JBTVA) hybrid evolutionary algorithm is proposed. In this algorithm,
a Time-Variant Adaptive (TVA) technique of relaxation factor is introduced
aiming at both improving the fine local tuning and reducing the disadvantage of
uniform adaptation of relaxation factors. This algorithm integrates the Jacobi
based SR method with time variant adaptive evolutionary algorithm. The
convergence theorems of the proposed algorithm are proved theoretically. And
the performance of the proposed algorithm is compared with JBUA hybrid
evolutionary algorithm and classical methods in the experimental domain. The
proposed algorithm outperforms both the JBUA hybrid algorithm and classical
methods in terms of convergence speed and effectiveness.
","[{'version': 'v1', 'created': 'Sat, 13 Apr 2013 09:12:07 GMT'}]",2013-04-16,"[['Jamali', 'A. R. M. Jalal Uddin', ''], ['Hashem', 'M. M. A.', ''], ['Rahman', 'Md. Bazlar', '']]","['Adaptive algorithm', 'Evolutionary algorithm', 'Timevariant adaptation', 'Linear equations', 'Successive']"
14738,1304.3507,Salim Farah,"Salim Farah, Magdy Bayoumi","Hardware Acceleration of the Gipps Model for Real-Time Traffic
  Simulation",,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traffic simulation software is becoming increasingly popular as more cities
worldwide use it to better manage their crowded traffic networks. An important
requirement for such software is the ability to produce accurate results in
real time, requiring great computation resources. This work proposes an
ASIC-based hardware accelerated approach for the AIMSUN traffic simulator,
taking advantage of repetitive tasks in the algorithm. Different system
configurations using this accelerator are also discussed. Compared with the
traditional software simulator, it has been found to improve the performance by
as much as 9x when using a single processing element approach, or more
depending on the chosen hardware configuration.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2013 23:36:24 GMT'}]",2013-04-15,"[['Farah', 'Salim', ''], ['Bayoumi', 'Magdy', '']]","['Traffic Simulation', 'Gipps Model', 'AIMSUN', 'ASIC']"
14739,1212.5589,Harry Boyer,"Harry Boyer (PIMENT), Alain Bastide (PIMENT), Alfred Jean Philippe
  Lauret (PIMENT)","CODYRUN, outil de simulation et d'aide \`a la conception
  thermo-a\'eraulique de b\^atiments",in French,"Journ\'ee th\'ematique SFT-IBPSA 2005, La Rochelle : France (2005)",,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents the CODYRUN software developped by University of La
R\'eunion. It is a multizone thermal software, with detailled airflow and
humidity transfer calculations. One of its specific aspects is that it
constitutes a research tool, a design tool used by the lab and professionnals
and also a teaching tool. After a presentation of the multiple model aspect,
some details of the tree modules associated to physical phenomenons are given.
Elements of validation are exposed in next paraghaph, and then a few details of
the front end.
","[{'version': 'v1', 'created': 'Thu, 20 Dec 2012 21:21:41 GMT'}]",2012-12-27,"[['Boyer', 'Harry', '', 'PIMENT'], ['Bastide', 'Alain', '', 'PIMENT'], ['Lauret', 'Alfred Jean Philippe', '', 'PIMENT']]","['CODYRUN', 'simulation', 'modelling']"
14740,1305.1022,Ahmed Drissi,Ahmed Drissi and Ahmed Asimi,A New Approach to Decoding of Rational Irreducible Goppa code,,,,,cs.CR,http://creativecommons.org/licenses/by/3.0/,"  The interesting properties of classical Goppa code and its effective decoding
algorithm (algorithm of patterson) make the most appropriate candidate for use
in the MC Eliece cryptosystem. Information leakage which results from the
relationship between the error vector weight and the number of iterations in
the decoding algorithm, presented a weakness of the cryptosystem. In this
paper, we introduce a new approach to decoding, the use of binary Goppa code in
system design MC Eliece which solve the problem of the leak of information, on
the contrary in case of patterson algorithm. We treat this decoding method
using the Newton identities and results of linear algebra.
","[{'version': 'v1', 'created': 'Sun, 5 May 2013 15:48:49 GMT'}, {'version': 'v2', 'created': 'Sat, 8 Mar 2014 09:34:42 GMT'}]",2014-03-11,"[['Drissi', 'Ahmed', ''], ['Asimi', 'Ahmed', '']]","['Binary Goppa code', 'the Newton identities', 'circulant matrix']"
14741,1606.04240,Keehang Kwon,Keehang Kwon,For-loops in Logic Programming,"5 pages. slightly revised from my previous Korean paper (KIPS
  transactions, part A, vol 19, no.1, 2012.)",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Logic programming has traditiLogic programming has traditionally lacked
devices for expressing iterative tasks. To overcome this problem, this paper
proposes iterative goal formulas of the form $\seqandq{x}{L} G$ where $G$ is a
goal, $x$ is a variable, and $L$ is a list. $\seqandq{x}{L}$ is called a
parallel bounded quantifier. These goals allow us to specify the following
task: iterate $G$ with $x$ ranging over all the elements of $L$. onally lacked
devices for expressing iterative tasks. To overcome this problem, this paper
proposes iterative goal formulas of the form $\seqandq{x}{L} G$ where $G$ is a
goal, $x$ is a variable, and $L$ is a list. $\seqandq{x}{L}$ is called a
parallel bounded quantifier. These goals allow us to specify the following
task: iterate $G$ with $x$ ranging over all the elements of $L$.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2016 08:06:01 GMT'}]",2016-06-15,"[['Kwon', 'Keehang', '']]","['for-loop', 'iteration', 'bounded quantifier', 'computability logic']"
14742,1412.6765,Nassim Halli,"Nassim A. Halli, Henri-Pierre Charles and Jean-Fran\c{c}ois Mehaut","Performance comparison between Java and JNI for optimal implementation
  of computational micro-kernels","Part of ADAPT Workshop proceedings, 2015 (arXiv:1412.2347)",,,ADAPT/2015/06,cs.PF cs.DC cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  General purpose CPUs used in high performance computing (HPC) support a
vector instruction set and an out-of-order engine dedicated to increase the
instruction level parallelism. Hence, related optimizations are currently
critical to improve the performance of applications requiring numerical
computation. Moreover, the use of a Java run-time environment such as the
HotSpot Java Virtual Machine (JVM) in high performance computing is a promising
alternative. It benefits from its programming flexibility, productivity and the
performance is ensured by the Just-In-Time (JIT) compiler. Though, the JIT
compiler suffers from two main drawbacks. First, the JIT is a black box for
developers. We have no control over the generated code nor any feedback from
its optimization phases like vectorization. Secondly, the time constraint
narrows down the degree of optimization compared to static compilers like GCC
or LLVM. So, it is compelling to use statically compiled code since it benefits
from additional optimization reducing performance bottlenecks. Java enables to
call native code from dynamic libraries through the Java Native Interface
(JNI). Nevertheless, JNI methods are not inlined and require an additional cost
to be invoked compared to Java ones. Therefore, to benefit from better static
optimization, this call overhead must be leveraged by the amount of computation
performed at each JNI invocation. In this paper we tackle this problem and we
propose to do this analysis for a set of micro-kernels. Our goal is to select
the most efficient implementation considering the amount of computation defined
by the calling context. We also investigate the impact on performance of
several different optimization schemes which are vectorization, out-of-order
optimization, data alignment, method inlining and the use of native memory for
JNI methods.
","[{'version': 'v1', 'created': 'Sun, 21 Dec 2014 11:26:39 GMT'}]",2014-12-23,"[['Halli', 'Nassim A.', ''], ['Charles', 'Henri-Pierre', ''], ['Mehaut', 'Jean-François', '']]","['Java', 'JNI', 'HPC', 'Performance', 'Vectorization']"
14743,1403.6922,Adityanand Guntuboyina,Adityanand Guntuboyina,Covering numbers of $L_p$-balls of convex sets and functions,,,,,cs.IT math.IT math.PR math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove bounds for the covering numbers of classes of convex functions and
convex sets in Euclidean space. Previous results require the underlying convex
functions or sets to be uniformly bounded. We relax this assumption and replace
it with weaker integral constraints. Existing results can be recovered as
special cases of our results.
","[{'version': 'v1', 'created': 'Thu, 27 Mar 2014 06:21:35 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Oct 2014 18:55:15 GMT'}]",2014-10-24,"[['Guntuboyina', 'Adityanand', '']]","['covering numbers', 'packing numbers', 'convex functions', 'integral constraints', 'metric en']"
14744,1412.2210,Sagar Gubbi,Sagar Venkatesh Gubbi and Chandra Sekhar Seelamantula,"Risk Estimation Without Using Stein's Lemma -- Application to Image
  Denoising",6 pages,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the problem of image denoising in additive white noise without
placing restrictive assumptions on its statistical distribution. In the recent
literature, specific noise distributions have been considered and
correspondingly, optimal denoising techniques have been developed. One of the
successful approaches for denoising relies on the notion of unbiased risk
estimation, which enables one to obtain a useful substitute for the mean-square
error. For the case of additive white Gaussian noise contamination, the risk
estimation procedure relies on Stein's lemma. Sophisticated wavelet-based
denoising techniques, which are essentially nonlinear, have been developed with
the help of the lemma. We show that, for linear, shift-invariant denoisers, it
is possible to obtain unbiased risk estimates of the mean-square error without
using Stein's lemma. An interesting consequence of this development is that the
unbiased risk estimator becomes agnostic to the statistical distribution of the
noise. As a proof of principle, we show how the new methodology can be used to
optimize the parameters of a simple Gaussian smoother. By locally adapting the
parameters of the Gaussian smoother, we obtain a shift-variant smoother, which
has a denoising performance (quantified by the improvement in peak
signal-to-noise ratio (PSNR)) that is competitive to far more sophisticated
methods reported in the literature. The proposed solution exhibits considerable
parallelism, which we exploit in a Graphics Processing Unit (GPU)
implementation.
","[{'version': 'v1', 'created': 'Sat, 6 Dec 2014 08:00:19 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Jan 2015 09:22:18 GMT'}]",2015-01-28,"[['Gubbi', 'Sagar Venkatesh', ''], ['Seelamantula', 'Chandra Sekhar', '']]","['Image denoising', 'risk estimation', 'Stein’s lemma', 'GPU implementation']"
14745,1605.00787,Shadrack Kipchirchir Kimutai,Shadrack Kimutai,"Obstacle evasion using fuzzy logic in a sliding blades problem
  environment",,,,,cs.AI cs.RO,http://creativecommons.org/licenses/by/4.0/,"  This paper discusses obstacle avoidance using fuzzy logic and shortest path
algorithm. This paper also introduces the sliding blades problem and
illustrates how a drone can navigate itself through the swinging blade
obstacles while tracing a semi-optimal path and also maintaining constant
velocity
","[{'version': 'v1', 'created': 'Tue, 3 May 2016 08:34:45 GMT'}]",2016-05-04,"[['Kimutai', 'Shadrack', '']]","['Fuzzy Logic', 'Swinging Blades problem', 'Shortest Path Selection', 'Drones', 'Optimum Path to Goal', 'Obstacle Avoidance']"
14746,1108.6198,Gadda Koteswara Rao,"G.Koteswara Rao, Shubhamoy Dey",Decision Support for e-Governance: A Text Mining Approach,"19 Pages, 7 Figures","International Journal of Managing Information Technology (IJMIT)
  Vol.3, No.3, 2011, 73-91",,,cs.DB cs.IR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Information and communication technology has the capability to improve the
process by which governments involve citizens in formulating public policy and
public projects. Even though much of government regulations may now be in
digital form (and often available online), due to their complexity and
diversity, identifying the ones relevant to a particular context is a
non-trivial task. Similarly, with the advent of a number of electronic online
forums, social networking sites and blogs, the opportunity of gathering
citizens' petitions and stakeholders' views on government policy and proposals
has increased greatly, but the volume and the complexity of analyzing
unstructured data makes this difficult. On the other hand, text mining has come
a long way from simple keyword search, and matured into a discipline capable of
dealing with much more complex tasks. In this paper we discuss how text-mining
techniques can help in retrieval of information and relationships from textual
data sources, thereby assisting policy makers in discovering associations
between policies and citizens' opinions expressed in electronic public forums
and blogs etc. We also present here, an integrated text mining based
architecture for e-governance decision support along with a discussion on the
Indian scenario.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2011 11:48:57 GMT'}]",2011-09-01,"[['Rao', 'G. Koteswara', ''], ['Dey', 'Shubhamoy', '']]","['Text mining techniques', 'e-governance', 'public policy', 'public opinion', 'decision support systems']"
14747,0712.3037,Manik Lal Das,Manik Lal Das,"Comments on ""Improved Efficient Remote User Authentication Schemes""",,"International Journal of Network Security, Vol. 6, No. 3, pp.
  282-284, 2008",,,cs.CR,,"  Recently, Tian et al presented an article, in which they discussed some
security weaknesses of Yoon et al's scheme and subsequently proposed two
``improved'' schemes. In this paper, we show that the Tian et al's schemes are
insecure and vulnerable than the Yoon et al's scheme.
","[{'version': 'v1', 'created': 'Tue, 18 Dec 2007 20:26:39 GMT'}]",2007-12-19,"[['Das', 'Manik Lal', '']]","['Authentication', 'Smart card', 'Timestamp']"
14748,1412.3958,Mohammed Abdelsamea,Mohammed M. Abdelsamea,An Automatic Seeded Region Growing for 2D Biomedical Image Segmentation,"appears in Proceedings of International Conference on Environment and
  Bio-Science 2011. subset of arXiv:1407.3664",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, an automatic seeded region growing algorithm is proposed for
cellular image segmentation. First, the regions of interest (ROIs) extracted
from the preprocessed image. Second, the initial seeds are automatically
selected based on ROIs extracted from the image. Third, the most reprehensive
seeds are selected using a machine learning algorithm. Finally, the cellular
image is segmented into regions where each region corresponds to a seed. The
aim of the proposed is to automatically extract the Region of Interests (ROI)
from the cellular images in terms of overcoming the explosion, under
segmentation and over segmentation problems. Experimental results show that the
proposed algorithm can improve the segmented image and the segmented results
are less noisy as compared to some existing algorithms.
","[{'version': 'v1', 'created': 'Fri, 12 Dec 2014 11:47:02 GMT'}]",2014-12-15,"[['Abdelsamea', 'Mohammed M.', '']]","['Image Segmentation', 'Seeded Region Growing', 'Machine Learning', 'Leaking problem']"
14749,0910.0493,Patrizio Pelliccione,"Antonio Bucchiarone, Davide Di Ruscio, Henry Muccini, and Patrizio
  Pelliccione","From Requirements to code: an Architecture-centric Approach for
  producing Quality Systems","Chapter of the book ""Model-Driven Software Development: Integrating
  Quality Assurance"". Idea Group Inc., Information Science Publishing, IRM
  Press. 2008",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When engineering complex and distributed software and hardware systems
(increasingly used in many sectors, such as manufacturing, aerospace,
transportation, communication, energy, and health-care), quality has become a
big issue, since failures can have economics consequences and can also endanger
human life. Model-based specifications of a component-based system permit to
explicitly model the structure and behaviour of components and their
integration. In particular Software Architectures (SA) has been advocated as an
effective means to produce quality systems. In this chapter by combining
different technologies and tools for analysis and development, we propose an
architecture-centric model-driven approach to validate required properties and
to generate the system code. Functional requirements are elicited and used for
identifying expected properties the architecture shall express. The
architectural compliance to the properties is formally demonstrated, and the
produced architectural model is used to automatically generate the Java code.
Suitable transformations assure that the code is conforming to both structural
and behavioural SA constraints. This chapter describes the process and
discusses how some existing tools and languages can be exploited to support the
approach.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2009 21:57:54 GMT'}]",2009-10-06,"[['Bucchiarone', 'Antonio', ''], ['Di Ruscio', 'Davide', ''], ['Muccini', 'Henry', ''], ['Pelliccione', 'Patrizio', '']]","['Software Architectures', 'Component-based Systems', 'Model Checking', 'Code Generation']"
14750,1505.05590,Yong-Jin Liu,Yong-Jin Liu and Chun-Xu Xu and Dian Fan and Ying He,"Constructing Intrinsic Delaunay Triangulations from the Dual of Geodesic
  Voronoi Diagrams","32 pages, 16 figures",,,,cs.CG cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intrinsic Delaunay triangulation (IDT) is a fundamental data structure in
computational geometry and computer graphics. However, except for some
theoretical results, such as existence and uniqueness, little progress has been
made towards computing IDT on simplicial surfaces. To date the only way for
constructing IDTs is the edge-flipping algorithm, which iteratively flips the
non-Delaunay edge to be locally Delaunay. Although the algorithm is
conceptually simple and guarantees to stop in finite steps, it has no known
time complexity. Moreover, the edge-flipping algorithm may produce non-regular
triangulations, which contain self-loops and/or faces with only two edges. In
this paper, we propose a new method for constructing IDT on manifold triangle
meshes. Based on the duality of geodesic Voronoi diagrams, our method can
guarantee the resultant IDTs are regular. Our method has a theoretical
worst-case time complexity $O(n^2\log n)$ for a mesh with $n$ vertices. We
observe that most real-world models are far from their Delaunay triangulations,
thus, the edge-flipping algorithm takes many iterations to fix the non-Delaunay
edges. In contrast, our method is non-iterative and insensitive to the number
of non-Delaunay edges. Empirically, it runs in linear time $O(n)$ on real-world
models.
","[{'version': 'v1', 'created': 'Thu, 21 May 2015 02:45:41 GMT'}]",2015-05-22,"[['Liu', 'Yong-Jin', ''], ['Xu', 'Chun-Xu', ''], ['Fan', 'Dian', ''], ['He', 'Ying', '']]","['Intrinsic Delaunay triangulation', 'regular triangulation', 'geodesicVoronoi diagram', 'duality', 'discrete Laplace-Beltrami operator']"
14751,1407.2541,Andrew Connor,"Jacqui Finlay, Andy M. Connor, Russel Pears",Mining Software Metrics from Jazz,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we describe the extraction of source code metrics from the
Jazz repository and the application of data mining techniques to identify the
most useful of those metrics for predicting the success or failure of an
attempt to construct a working instance of the software product. We present
results from a systematic study using the J48 classification method. The
results indicate that only a relatively small number of the available software
metrics that we considered have any significance for predicting the outcome of
a build. These significant metrics are discussed and implication of the results
discussed, particularly the relative difficulty of being able to predict failed
build attempts.
","[{'version': 'v1', 'created': 'Wed, 9 Jul 2014 15:56:21 GMT'}]",2014-07-10,"[['Finlay', 'Jacqui', ''], ['Connor', 'Andy M.', ''], ['Pears', 'Russel', '']]","['Data Mining', 'Jazz', 'Software Metrics', 'Software Repositories']"
14752,1511.01960,Tran Cao Son,"Chitta Baral, Gregory Gelfond, Enrico Pontelli, Tran Cao Son",An Action Language for Multi-Agent Domains: Foundations,"49 pages, 12 figures",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In multi-agent domains (MADs), an agent's action may not just change the
world and the agent's knowledge and beliefs about the world, but also may
change other agents' knowledge and beliefs about the world and their knowledge
and beliefs about other agents' knowledge and beliefs about the world. The
goals of an agent in a multi-agent world may involve manipulating the knowledge
and beliefs of other agents' and again, not just their knowledge/belief about
the world, but also their knowledge about other agents' knowledge about the
world. Our goal is to present an action language (mA+) that has the necessary
features to address the above aspects in representing and RAC in MADs. mA+
allows the representation of and reasoning about different types of actions
that an agent can perform in a domain where many other agents might be present
-- such as world-altering actions, sensing actions, and
announcement/communication actions. It also allows the specification of agents'
dynamic awareness of action occurrences which has future implications on what
agents' know about the world and other agents' knowledge about the world. mA+
considers three different types of awareness: full-, partial- awareness, and
complete oblivion of an action occurrence and its effects. This keeps the
language simple, yet powerful enough to address a large variety of knowledge
manipulation scenarios in MADs. The semantics of mA+ relies on the notion of
state, which is described by a pointed Kripke model and is used to encode the
agent's knowledge and the real state of the world. It is defined by a
transition function that maps pairs of actions and states into sets of states.
We illustrate properties of the action theories, including properties that
guarantee finiteness of the set of initial states and their practical
implementability. Finally, we relate mA+ to other related formalisms that
contribute to RAC in MADs.
","[{'version': 'v1', 'created': 'Fri, 6 Nov 2015 00:16:19 GMT'}, {'version': 'v2', 'created': 'Mon, 9 Dec 2019 19:57:36 GMT'}, {'version': 'v3', 'created': 'Sun, 27 Dec 2020 02:43:08 GMT'}]",2020-12-29,"[['Baral', 'Chitta', ''], ['Gelfond', 'Gregory', ''], ['Pontelli', 'Enrico', ''], ['Son', 'Tran Cao', '']]","['Action Languages', 'Epistemic Planning', 'Reasoning about Knowledge']"
14753,1610.05402,Luis Meira,"Guilherme A. Zeni, Mauro Menzori, P. S. Martins, Luis A. A. Meira",VRPBench: A Vehicle Routing Benchmark Tool,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The number of optimization techniques in the combinatorial domain is large
and diversified. Nevertheless, there is still a lack of real benchmarks to
validate optimization algorithms. In this work we introduce VRPBench, a tool to
create instances and visualize solutions to the Vehicle Routing Problem (VRP)
in a planar graph embedded in the Euclidean 2D space. We use VRPBench to model
a real-world mail delivery case of the city of Artur Nogueira. Such scenarios
were characterized as a multi-objective optimization of the VRP. We extracted a
weighted graph from a digital map of the city to create a challenging benchmark
for the VRP. Each instance models one generic day of mail delivery with
hundreds to thousands of delivery points, thus allowing both the comparison and
validation of optimization algorithms for routing problems.
","[{'version': 'v1', 'created': 'Tue, 18 Oct 2016 02:01:16 GMT'}]",2016-10-19,"[['Zeni', 'Guilherme A.', ''], ['Menzori', 'Mauro', ''], ['Martins', 'P. S.', ''], ['Meira', 'Luis A. A.', '']]","['Benchmark', 'VRP', 'Graphs', 'Combinatorial Optimisa']"
14754,1110.6755,Yevgeny Seldin,"Yevgeny Seldin, Nicol\`o Cesa-Bianchi, Peter Auer, Fran\c{c}ois
  Laviolette, John Shawe-Taylor","PAC-Bayes-Bernstein Inequality for Martingales and its Application to
  Multiarmed Bandits",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop a new tool for data-dependent analysis of the
exploration-exploitation trade-off in learning under limited feedback. Our tool
is based on two main ingredients. The first ingredient is a new concentration
inequality that makes it possible to control the concentration of weighted
averages of multiple (possibly uncountably many) simultaneously evolving and
interdependent martingales. The second ingredient is an application of this
inequality to the exploration-exploitation trade-off via importance weighted
sampling. We apply the new tool to the stochastic multiarmed bandit problem,
however, the main importance of this paper is the development and understanding
of the new tool rather than improvement of existing algorithms for stochastic
multiarmed bandits. In the follow-up work we demonstrate that the new tool can
improve over state-of-the-art in structurally richer problems, such as
stochastic multiarmed bandits with side information (Seldin et al., 2011a).
","[{'version': 'v1', 'created': 'Mon, 31 Oct 2011 11:36:49 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Jan 2012 15:46:58 GMT'}]",2012-01-31,"[['Seldin', 'Yevgeny', ''], ['Cesa-Bianchi', 'Nicolò', ''], ['Auer', 'Peter', ''], ['Laviolette', 'François', ''], ['Shawe-Taylor', 'John', '']]","['PAC-Bayesian Analysis', 'Bernstein’s Inequality', 'Martingales', 'Multiarmed Bandits', 'Model Order Selection', 'Exploration-Exploitation Trade-off']"
14755,1107.3636,Xiao Li,"Xiao Li, Andrea Rueetschi, Yonina C. Eldar and Anna Scaglione",GPS Signal Acquisition via Compressive Multichannel Sampling,"25 pages, 7 figures, submitted to Physical Communication, Elsevier,
  Special Issue on Compressive Sensing in Communications",,,,cs.IT math.IT,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper, we propose an efficient acquisition scheme for GPS receivers.
It is shown that GPS signals can be effectively sampled and detected using a
bank of randomized correlators with much fewer chip-matched filters than those
used in existing GPS signal acquisition algorithms. The latter use correlations
with all possible shifted replicas of the satellite-specific C/A code and an
exhaustive search for peaking signals over the delay-Doppler space. Our scheme
is based on the recently proposed analog compressed sensing framework, and
consists of a multichannel sampling structure with far fewer correlators.
  The compressive multichannel sampler outputs are linear combinations of a
vector whose support tends to be sparse; by detecting its support one can
identify the strongest satellite signals in the field of view and pinpoint the
correct code-phase and Doppler shifts for finer resolution during tracking. The
analysis in this paper demonstrates that GPS signals can be detected and
acquired via the proposed structure at a lower cost in terms of number of
correlations that need to be computed in the coarse acquisition phase, which in
current GPS technology scales like the product of the number of all possible
delays and Doppler shifts. In contrast, the required number of correlators in
our compressive multichannel scheme scales as the number of satellites in the
field of view of the device times the logarithm of number of delay-Doppler bins
explored, as is typical for compressed sensing methods.
","[{'version': 'v1', 'created': 'Tue, 19 Jul 2011 07:17:11 GMT'}]",2011-07-20,"[['Li', 'Xiao', ''], ['Rueetschi', 'Andrea', ''], ['Eldar', 'Yonina C.', ''], ['Scaglione', 'Anna', '']]","['GPS', 'compressive sensing', 'spread spectrum', 'analog compressed sensing']"
14756,1603.06169,Alexander G\'omez Villa,"Alexander Gomez, Augusto Salazar and Francisco Vargas","Towards Automatic Wild Animal Monitoring: Identification of Animal
  Species in Camera-trap Images using Very Deep Convolutional Neural Networks",Submitted to ECCV16,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Non intrusive monitoring of animals in the wild is possible using camera
trapping framework, which uses cameras triggered by sensors to take a burst of
images of animals in their habitat. However camera trapping framework produces
a high volume of data (in the order on thousands or millions of images), which
must be analyzed by a human expert. In this work, a method for animal species
identification in the wild using very deep convolutional neural networks is
presented. Multiple versions of the Snapshot Serengeti dataset were used in
order to probe the ability of the method to cope with different challenges that
camera-trap images demand. The method reached 88.9% of accuracy in Top-1 and
98.1% in Top-5 in the evaluation set using a residual network topology. Also,
the results show that the proposed method outperforms previous approximations
and proves that recognition in camera-trap images can be automated.
","[{'version': 'v1', 'created': 'Sun, 20 Mar 2016 00:47:46 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Mar 2016 00:53:37 GMT'}]",2016-03-23,"[['Gomez', 'Alexander', ''], ['Salazar', 'Augusto', ''], ['Vargas', 'Francisco', '']]","['Animal species recognition', 'deep convolutional neural networks', 'camera-trap', 'Snapshot Serengeti']"
14757,0910.2638,Arijit  Laha Ph.D.,Arijit Laha,On building Information Warehouses,"11 pages 1st IIMA International Conference on Advanced Data Analysis,
  Business Analytics and Intelligence (ICADABAI 2009), 6-7 June, Indian
  Institute of Management, Ahmedabad, India",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the most important goals of information management (IM) is supporting
the knowledge workers in performing their works. In this paper we examine
issues of relevance, linkage and provenance of information, as accessed and
used by the knowledge workers. These are usually not adequately addressed in
most of the IT based solutions for IM. Here we propose a non-conventional
approach for building information systems for supporting the knowledge workers
which addresses these issues. The approach leads to the ideas of building
Information Warehouses (IW) and Knowledge work Support Systems (KwSS). Such
systems can open up potential for building innovative applications of
significant impact, including those capable of helping organizations in
implementing processes for double-loop learning.
","[{'version': 'v1', 'created': 'Wed, 14 Oct 2009 14:59:42 GMT'}]",2009-10-15,"[['Laha', 'Arijit', '']]","['information system', 'knowledge management', 'relevance', 'linkage', 'provenance', 'knowledge work support systems']"
14758,1701.01936,Moran Feldman,"Niv Buchbinder, Moran Feldman, Joseph Naor and Ohad Talmon","$O(\mbox{depth})$-Competitive Algorithm for Online Multi-level
  Aggregation",10 pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a multi-level aggregation problem in a weighted rooted tree,
studied recently by Bienkowski et al. (2015). In this problem requests arrive
over time at the nodes of the tree, and each request specifies a deadline. A
request is served by sending it to the root before its deadline at a cost equal
to the weight of the path from the node in which it resides to the root.
However, requests from different nodes can be aggregated, and served together,
so as to save on cost. The cost of serving an aggregated set of requests is
equal to the weight of the subtree spanning the nodes in which the requests
reside. Thus, the problem is to find a competitive online aggregation algorithm
that minimizes the total cost of the aggregated requests. This problem arises
naturally in many scenarios, including multicasting, supply-chain management
and sensor networks. It is also related to the well studied TCP-acknowledgement
problem and the online joint replenishment problem.
  We present an online $O(D)$-competitive algorithm for the problem, where $D$
is the depth, or number of levels, of the aggregation tree. This result
improves upon the $D^2 2^D$-competitive algorithm obtained recently by
Bienkowski et al. (2015).
","[{'version': 'v1', 'created': 'Sun, 8 Jan 2017 10:00:51 GMT'}]",2017-01-10,"[['Buchbinder', 'Niv', ''], ['Feldman', 'Moran', ''], ['Naor', 'Joseph', ''], ['Talmon', 'Ohad', '']]","['online algorithms', 'competitive analysis', 'aggregation of requests']"
14759,1610.01546,Yueming Sun,"Yueming Sun, Yi Zhang, Yunfei Chen, Roger Jin",Conversational Recommendation System with Unsupervised Learning,,,,,cs.CL cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  We will demonstrate a conversational products recommendation agent. This
system shows how we combine research in personalized recommendation systems
with research in dialogue systems to build a virtual sales agent. Based on new
deep learning technologies we developed, the virtual agent is capable of
learning how to interact with users, how to answer user questions, what is the
next question to ask, and what to recommend when chatting with a human user.
  Normally a descent conversational agent for a particular domain requires tens
of thousands of hand labeled conversational data or hand written rules. This is
a major barrier when launching a conversation agent for a new domain. We will
explore and demonstrate the effectiveness of the learning solution even when
there is no hand written rules or hand labeled training data.
","[{'version': 'v1', 'created': 'Thu, 22 Sep 2016 05:46:49 GMT'}]",2016-10-06,"[['Sun', 'Yueming', ''], ['Zhang', 'Yi', ''], ['Chen', 'Yunfei', ''], ['Jin', 'Roger', '']]","['Dialogue systems', 'recommendation systems', 'personal assistant', 'chat bot']"
14760,1206.4477,Ulisses Costa Mr.,"Daniela Fonte, Ismael Vilas Boas, Jos\'e Azevedo, Jos\'e Jo\~ao
  Peixoto, Pedro Faria, Pedro Silva, Tiago S\'a, Ulisses Costa, Daniela da
  Cruz, Pedro Rangel Henriques",Modeling Languages: metrics and assessing tools,,,,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Any traditional engineering field has metrics to rigorously assess the
quality of their products. Engineers know that the output must satisfy the
requirements, must comply with the production and market rules, and must be
competitive.
  Professionals in the new field of software engineering started a few years
ago to define metrics to appraise their product: individual programs and
software systems. This concern motivates the need to assess not only the
outcome but also the process and tools employed in its development. In this
context, assessing the quality of programming languages is a legitimate
objective; in a similar way, it makes sense to be concerned with models and
modeling approaches, as more and more people start the software development
process by a modeling phase.
  In this paper we introduce and motivate the assessment of models quality in
the Software Development cycle. After the general discussion of this topic, we
focus the attention on the most popular modeling language -- the UML --
presenting metrics. Through a Case-Study, we present and explore two tools. To
conclude we identify what is still lacking in the tools side.
","[{'version': 'v1', 'created': 'Wed, 20 Jun 2012 12:38:48 GMT'}]",2012-06-25,"[['Fonte', 'Daniela', ''], ['Boas', 'Ismael Vilas', ''], ['Azevedo', 'José', ''], ['Peixoto', 'José João', ''], ['Faria', 'Pedro', ''], ['Silva', 'Pedro', ''], ['Sá', 'Tiago', ''], ['Costa', 'Ulisses', ''], ['da Cruz', 'Daniela', ''], ['Henriques', 'Pedro Rangel', '']]","['Modeling Languages', 'Software/Language Quality', 'Software/Language Metrics', 'UML']"
14761,0708.3575,Noelle Carbonell,"Suzanne Kieffer (INRIA Rocquencourt / INRIA Lorraine - LORIA),
  No\""elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)","How really effective are Multimodal Hints in enhancing Visual Target
  Spotting? Some evidence from a usability study",9 pages,"Journal on Multimodal Interaction (JMUI), 1 (2007) 1-9",,,cs.HC,,"  The main aim of the work presented here is to contribute to computer science
advances in the multimodal usability area, in-as-much as it addresses one of
the major issues relating to the generation of effective oral system messages:
how to design messages which effectively help users to locate specific
graphical objects in information visualisations? An experimental study was
carried out to determine whether oral messages including coarse information on
the locations of graphical objects on the current display may facilitate target
detection tasks sufficiently for making it worth while to integrate such
messages in GUIs. The display spatial layout varied in order to test the
influence of visual presentation structure on the contribution of these
messages to facilitating visual search on crowded displays. Finally, three
levels of task difficulty were defined, based mainly on the target visual
complexity and the number of distractors in the scene. The findings suggest
that spatial information messages improve participants' visual search
performances significantly; they are more appropriate to radial structures than
to matrix, random and elleptic structures; and, they are particularly useful
for performing difficult visual search tasks.
","[{'version': 'v1', 'created': 'Mon, 27 Aug 2007 11:53:35 GMT'}]",2007-08-28,"[['Kieffer', 'Suzanne', '', 'INRIA Rocquencourt / INRIA Lorraine - LORIA'], ['Carbonell', 'Noëlle', '', 'INRIA Rocquencourt / INRIA Lorraine - LORIA']]","['Visual search', 'Multimodal system messages', 'Speech and graphics']"
14762,0801.2175,Johannes Gro{\ss}e,Johannes Gro{\ss}e,MathPSfrag 2: Convenient LaTeX Labels in Mathematica,"9 pages, package can be found at
  http://wwwth.mppmu.mpg.de/members/jgrosse/mathpsfrag/",,,,cs.GR,,"  This article introduces the next version of MathPSfrag. MathPSfrag is a
Mathematica package that during export automatically replaces all expressions
in a plot by corresponding LaTeX commands. The new version can also produce
LaTeX independent images; e.g., PDF files for inclusion in pdfLaTeX. Moreover
from these files a preview is generated and shown within Mathematica.
","[{'version': 'v1', 'created': 'Tue, 15 Jan 2008 18:34:44 GMT'}]",2008-01-16,"[['Große', 'Johannes', '']]","['Encapsulated PostScript', 'Graphics', 'Mathematica', 'LATEX']"
14763,1206.5762,Kathryn  Haymaker,Kathryn Haymaker and Christine A. Kelley,Geometric WOM codes and coding strategies for multilevel flash memories,"Preliminary version, 15 pages, 4 figures",,,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates the design and application of write-once memory (WOM)
codes for flash memory storage. Using ideas from Merkx ('84), we present a
construction of WOM codes based on finite Euclidean geometries over
$\mathbb{F}_2$. This construction yields WOM codes with new parameters and
provides insight into the criterion that incidence structures should satisfy to
give rise to good codes. We also analyze methods of adapting binary WOM codes
for use on multilevel flash cells. In particular, we give two strategies based
on different rewrite objectives. A brief discussion of the average-write
performance of these strategies, as well as concatenation methods for WOM codes
is also provided.
","[{'version': 'v1', 'created': 'Mon, 7 May 2012 16:11:52 GMT'}]",2012-06-26,"[['Haymaker', 'Kathryn', ''], ['Kelley', 'Christine A.', '']]","['write once memory', 'flash memory', 'finite geometries', 'concatenated codes']"
14764,1407.3636,Ana Mestrovic,"Sabina \v{S}i\v{s}ovi\'c, Sanda Martin\v{c}i\'c-Ip\v{s}i\'c and Ana
  Me\v{s}trovi\'c",Toward Network-based Keyword Extraction from Multitopic Web Documents,10 pages,,,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we analyse the selectivity measure calculated from the complex
network in the task of the automatic keyword extraction. Texts, collected from
different web sources (portals, forums), are represented as directed and
weighted co-occurrence complex networks of words. Words are nodes and links are
established between two nodes if they are directly co-occurring within the
sentence. We test different centrality measures for ranking nodes - keyword
candidates. The promising results are achieved using the selectivity measure.
Then we propose an approach which enables extracting word pairs according to
the values of the in/out selectivity and weight measures combined with
filtering.
","[{'version': 'v1', 'created': 'Mon, 14 Jul 2014 13:22:36 GMT'}]",2014-07-15,"[['Šišović', 'Sabina', ''], ['Martinčić-Ipšić', 'Sanda', ''], ['Meštrović', 'Ana', '']]","['keyword extraction', 'complex networks', 'co-occurrence language networks', 'Croatian texts', 'selectivity']"
14765,1003.2586,Francesca A. Lisi,Francesca A. Lisi,Inductive Logic Programming in Databases: from Datalog to DL+log,"30 pages, 3 figures, 2 tables.",,,,cs.LO cs.AI cs.DB cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we address an issue that has been brought to the attention of
the database community with the advent of the Semantic Web, i.e. the issue of
how ontologies (and semantics conveyed by them) can help solving typical
database problems, through a better understanding of KR aspects related to
databases. In particular, we investigate this issue from the ILP perspective by
considering two database problems, (i) the definition of views and (ii) the
definition of constraints, for a database whose schema is represented also by
means of an ontology. Both can be reformulated as ILP problems and can benefit
from the expressive and deductive power of the KR framework DL+log. We
illustrate the application scenarios by means of examples. Keywords: Inductive
Logic Programming, Relational Databases, Ontologies, Description Logics, Hybrid
Knowledge Representation and Reasoning Systems. Note: To appear in Theory and
Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Fri, 12 Mar 2010 17:40:43 GMT'}]",2010-03-15,"[['Lisi', 'Francesca A.', '']]","['Inductive Logic Programming', 'Relational Databases', 'Ontologies', 'Description Logics', 'Hybrid Knowledge Representation', 'Reasoning Systems']"
14766,1502.04870,Asaf Shabtai,"Asaf Shabtai, Dudu Mimran, Yuval Elovici",Evaluation of Security Solutions for Android Systems,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the increasing usage of smartphones a plethora of security solutions are
being designed and developed. Many of the security solutions fail to cope with
advanced attacks and are not aways properly designed for smartphone platforms.
Therefore, there is a need for a methodology to evaluate their effectiveness.
Since the Android operating system has the highest market share today, we
decided to focus on it in this study in which we review some of the
state-of-the-art security solutions for Android-based smartphones. In addition,
we present a set of evaluation criteria aiming at evaluating security
mechanisms that are specifically designed for Android-based smartphones. We
believe that the proposed framework will help security solution designers
develop more effective solutions and assist security experts evaluate the
effectiveness of security solutions for Android-based smartphones.
","[{'version': 'v1', 'created': 'Tue, 17 Feb 2015 12:12:26 GMT'}]",2015-02-18,"[['Shabtai', 'Asaf', ''], ['Mimran', 'Dudu', ''], ['Elovici', 'Yuval', '']]","['Smartphone', 'Mobile device Security', 'Security evaluation', 'Android']"
14767,1108.6007,Markus Triska,Markus Triska,"Domain-specific Languages in a Finite Domain Constraint Programming
  System","Proceedings of the 19th International Conference on Applications of
  Declarative Programming and Knowledge Management (INAP 2011)",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present domain-specific languages (DSLs) that we devised
for their use in the implementation of a finite domain constraint programming
system, available as library(clpfd) in SWI-Prolog and YAP-Prolog. These DSLs
are used in propagator selection and constraint reification. In these areas,
they lead to concise specifications that are easy to read and reason about. At
compilation time, these specifications are translated to Prolog code, reducing
interpretative run-time overheads. The devised languages can be used in the
implementation of other finite domain constraint solvers as well and may
contribute to their correctness, conciseness and efficiency.
","[{'version': 'v1', 'created': 'Tue, 30 Aug 2011 16:43:17 GMT'}]",2011-08-31,"[['Triska', 'Markus', '']]","['DSL', 'code generation', 'little languages']"
14768,1507.00784,Th\'arsis Tuani Pinto Souza,"Th\'arsis Tuani Pinto Souza, Olga Kolchyna, Philip C. Treleaven and
  Tomaso Aste","Twitter Sentiment Analysis Applied to Finance: A Case Study in the
  Retail Industry","23 pages, 5 figures, 9 tables","In: Handbook of Sentiment Analysis in Finance. Mitra, G. and Yu,
  X. (Eds.). (2016). ISBN 1910571571., 2016",,,cs.CY cs.SI q-fin.CP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a financial analysis over Twitter sentiment analytics
extracted from listed retail brands. We investigate whether there is
statistically-significant information between the Twitter sentiment and volume,
and stock returns and volatility. Traditional newswires are also considered as
a proxy for the market sentiment for comparative purpose. The results suggest
that social media is indeed a valuable source in the analysis of the financial
dynamics in the retail sector even when compared to mainstream news such as the
Wall Street Journal and Dow Jones Newswires.
","[{'version': 'v1', 'created': 'Thu, 2 Jul 2015 23:13:54 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Jul 2015 16:23:10 GMT'}, {'version': 'v3', 'created': 'Sat, 11 Jul 2015 12:17:36 GMT'}]",2017-04-03,"[['Souza', 'Thársis Tuani Pinto', ''], ['Kolchyna', 'Olga', ''], ['Treleaven', 'Philip C.', ''], ['Aste', 'Tomaso', '']]","['retail', 'financial markets', 'data science', 'computational socialscience', 'social media', 'news analytics']"
14769,1003.3866,Ali Khajeh-Hosseini,"Ali Khajeh-Hosseini, David Greenwood, James W. Smith, Ian Sommerville","The Cloud Adoption Toolkit: Addressing the Challenges of Cloud Adoption
  in Enterprise",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing promises a radical shift in the provisioning of computing
resource within the enterprise. This paper: i) describes the challenges that
decision makers face when attempting to determine the feasibility of the
adoption of cloud computing in their organisations; ii) illustrates a lack of
existing work to address the feasibility challenges of cloud adoption in the
enterprise; iii) introduces the Cloud Adoption Toolkit that provides a
framework to support decision makers in identifying their concerns, and
matching these concerns to appropriate tools/techniques that can be used to
address them. The paper adopts a position paper methodology such that case
study evidence is provided, where available, to support claims. We conclude
that the Cloud Adoption Toolkit, whilst still under development, shows signs
that it is a useful tool for decision makers as it helps address the
feasibility challenges of cloud adoption in the enterprise.
","[{'version': 'v1', 'created': 'Fri, 19 Mar 2010 19:40:41 GMT'}, {'version': 'v2', 'created': 'Thu, 13 May 2010 14:54:25 GMT'}]",2010-05-14,"[['Khajeh-Hosseini', 'Ali', ''], ['Greenwood', 'David', ''], ['Smith', 'James W.', ''], ['Sommerville', 'Ian', '']]","['Cloud computing', 'cloud adoption', 'decision support']"
14770,1609.01517,Carlo Comin,Carlo Comin and Romeo Rizzi,"Faster O(|V|^2|E|W)-Time Energy Algorithms for Optimal Strategy
  Synthesis in Mean Payoff Games",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study strengthens the links between Mean Payoff Games (\MPG{s}) and
Energy Games (EG{s}). Firstly, we offer a faster $O(|V|^2|E|W)$
pseudo-polynomial time and $\Theta(|V|+|E|)$ space deterministic algorithm for
solving the Value Problem and Optimal Strategy Synthesis in \MPG{s}. This
improves the best previously known estimates on the pseudo-polynomial time
complexity to: \[ O(|E|\log |V|) + \Theta\Big(\sum_{v\in
V}\texttt{deg}_{\Gamma}(v)\cdot\ell_{\Gamma}(v)\Big) = O(|V|^2|E|W), \] where
$\ell_{\Gamma}(v)$ counts the number of times that a certain energy-lifting
operator $\delta(\cdot, v)$ is applied to any $v\in V$, along a certain
sequence of Value-Iterations on reweighted \EG{s}; and
$\texttt{deg}_{\Gamma}(v)$ is the degree of $v$. This improves significantly
over a previously known pseudo-polynomial time estimate, i.e.
$\Theta\big(|V|^2|E|W + \sum_{v\in
V}\texttt{deg}_{\Gamma}(v)\cdot\ell_{\Gamma}(v)\big)$ \citep{CR15, CR16}, as
the pseudo-polynomiality is now confined to depend solely on $\ell_\Gamma$.
Secondly, we further explore on the relationship between Optimal Positional
Strategies (OPSs) in \MPG{s} and Small Energy-Progress Measures (SEPMs) in
reweighted \EG{s}. It is observed that the space of all OPSs,
$\texttt{opt}_{\Gamma}\Sigma^M_0$, admits a unique complete decomposition in
terms of extremal-SEPM{s} in reweighted EG{s}. This points out what we called
the ""Energy-Lattice $\mathcal{X}^*_{\Gamma}$ associated to
$\texttt{opt}_{\Gamma}\Sigma^M_0$"". Finally, it is offered a pseudo-polynomial
total-time recursive procedure for enumerating (w/o repetitions) all the
elements of $\mathcal{X}^*_{\Gamma}$, and for computing the corresponding
partitioning of $\texttt{opt}_{\Gamma}\Sigma^M_0$.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2016 12:39:43 GMT'}]",2016-09-07,"[['Comin', 'Carlo', ''], ['Rizzi', 'Romeo', '']]","['Mean Payoff Games', 'Value Problem', 'Optimal Strategy Synthesis', 'Pseudo-Polynomial Time', 'Energy Games', 'Small Energy-Progress Measures']"
14771,1301.1420,Arkadii Slinko,Arkadii Slinko and Shaun White,Is it ever safe to vote strategically?,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are many situations in which mis-coordinated strategic voting can leave
strategic voters worse off than they would have been had they not tried to
strategize. We analyse the simplest of such scenarios, in which the set of
strategic voters all have the same sincere preferences and all cast the same
strategic vote, while all other voters vote sincerely. Most mis-coordinations
in this framework can be classified as instances of either strategic
overshooting (too many voted strategically) or strategic undershooting (too
few). If mis-coordination can result in strategic voters ending up worse off
than they would have been had they all just voted sincerely, we call the
relevant strategic vote unsafe. We show that under every onto and
non-dictatorial social choice rule there exist circumstances where a voter has
an incentive to cast a safe strategic vote. We extend the Gibbard-Satterthwaite
Theorem by proving that every onto and non-dictatorial social choice rule can
be individually manipulated by a voter casting a safe strategic vote.
","[{'version': 'v1', 'created': 'Tue, 8 Jan 2013 06:05:29 GMT'}]",2013-01-09,"[['Slinko', 'Arkadii', ''], ['White', 'Shaun', '']]","['Social choice function', 'strategic voting', 'Gibbard-Satterthwaitetheorem', 'manipulation', 'safe strategic vote']"
14772,1605.02514,Florent Laroche,"Ravi Kumar Gupta, Pothala Sreenu, Alain Bernard, Florent Laroche",Process Information Model for Sheet Metal Operations,"The IFIP Working Group WG 5.1 11th International Conference on
  Product Lifecycle Management, Jul 2014, Yokohama, Japan",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper extracts the process parameters from a sheet metal part model
(B-Rep). These process parameters can be used in sheet metal manufacturing to
control the manufacturing operations. By extracting these process parameters
required for manufacturing, CAM program can be generated automatically using
the part model and resource information. A Product model is generated in
modeling software and converted into STEP file which is used for extracting
B-Rep which interned is used to classify and extract feature by using sheet
metal feature recognition module. The feature edges are classified as CEEs,
IEEs, CIEs and IIEs based on topological properties. Database is created for
material properties of the sheet metal and machine tools required to
manufacture features in a part model. The extracted feature, feature's edge
information and resource information are then used to compute process
parameters and values required to control manufacturing operations. The
extracted feature, feature's edge information, resource information and process
parameters are the integral components of the proposed process information
model for sheet metal operations.
","[{'version': 'v1', 'created': 'Mon, 9 May 2016 10:48:17 GMT'}]",2016-05-10,"[['Gupta', 'Ravi Kumar', ''], ['Sreenu', 'Pothala', ''], ['Bernard', 'Alain', ''], ['Laroche', 'Florent', '']]","['Process Information Model', 'Process Parameters', 'Sheet metal Operation']"
14773,1109.0762,Nan Ni,Nan Ni,Tunable Dual-band IFA Antenna using LC Resonators,"4 pages, 6 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A tunable dual-band inverted F antenna (IFA) is presented in this paper. By
placing a LC resonator on the radiating arm, dual-band characteristic is
achieved. Especially, the capacitor in the resonator is a tunable thin-film BST
capacitor, which has a 3.3:1 tuning ratio. The capacitance of the BST
capacitors can be tuned by an external DC bias voltage. By varying the
capacitance, both the lower band and the upper band of the IFA antenna can be
tuned. And the total bandwidth can cover six systems, i.e., GSM-850, GSM-900,
GPS, DCS, PCS, and UMTS.
","[{'version': 'v1', 'created': 'Sun, 4 Sep 2011 21:55:15 GMT'}]",2011-09-06,"[['Ni', 'Nan', '']]","['Inverted F antenna', 'BST', 'resonators', 'tunable circuits and devices']"
14774,1406.3882,Yui Noma,"Yui Noma, Makiko Konoshima","Eclipse Hashing: Alexandrov Compactification and Hashing with
  Hyperspheres for Fast Similarity Search","10 pages, 11 figures",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The similarity searches that use high-dimensional feature vectors consisting
of a vast amount of data have a wide range of application. One way of
conducting a fast similarity search is to transform the feature vectors into
binary vectors and perform the similarity search by using the Hamming distance.
Such a transformation is a hashing method, and the choice of hashing function
is important. Hashing methods using hyperplanes or hyperspheres are proposed.
One study reported here is inspired by Spherical LSH, and we use hypersperes to
hash the feature vectors. Our method, called Eclipse-hashing, performs a
compactification of R^n by using the inverse stereographic projection, which is
a kind of Alexandrov compactification. By using Eclipse-hashing, one can obtain
the hypersphere-hash function without explicitly using hyperspheres. Hence, the
number of nonlinear operations is reduced and the processing time of hashing
becomes shorter. Furthermore, we also show that as a result of improving the
approximation accuracy, Eclipse-hashing is more accurate than
hyperplane-hashing.
","[{'version': 'v1', 'created': 'Mon, 16 Jun 2014 01:38:50 GMT'}]",2014-06-17,"[['Noma', 'Yui', ''], ['Konoshima', 'Makiko', '']]","['Locality-sensitive hashing', 'Hypersphere', 'Alexandrov compactification', 'Inverse stereographicprojection']"
14775,0909.0093,R Doomun,Mohammad A. Mikki,Energy Efficient Location Aided Routing Protocol for Wireless MANETs,"9 Pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS 2009, ISSN 1947 5500, Impact factor 0.423,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 4, No. 1 & 2, August 2009, USA",,ISSN 1947 5500,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes
forming a temporary network without using any centralized access point,
infrastructure, or centralized administration. In this paper we introduce an
Energy Efficient Location Aided Routing (EELAR) Protocol for MANETs that is
based on the Location Aided Routing (LAR). EELAR makes significant reduction in
the energy consumption of the mobile nodes batteries by limiting the area of
discovering a new route to a smaller zone. Thus, control packets overhead is
significantly reduced. In EELAR a reference wireless base station is used and
the network's circular area centered at the base station is divided into six
equal sub-areas. At route discovery instead of flooding control packets to the
whole network area, they are flooded to only the sub-area of the destination
mobile node. The base station stores locations of the mobile nodes in a
position table. To show the efficiency of the proposed protocol we present
simulations using NS-2. Simulation results show that EELAR protocol makes an
improvement in control packet overhead and delivery ratio compared to AODV,
LAR, and DSR protocols.
","[{'version': 'v1', 'created': 'Tue, 1 Sep 2009 05:32:29 GMT'}]",2009-09-02,"[['Mikki', 'Mohammad A.', '']]","['Location Aided Routing', 'MANET', 'mobile nodes', 'route discovery', 'control packet overhead']"
14776,1110.2561,Vitaliy Kapitan Mr.,"Alexey A. Peretyatko, Ivan A. Bogatyrev, Vitaliy Yu. Kapitan, Yury V.
  Kirienko, Konstantin V. Nefedev, Valery I. Belokon","Rigorous Calculation of the Partition Function for the Finite Number of
  Ising Spins",4 pages 3 figures,"Materials of the 4th International Multi-Conference on Engineering
  and Technological Innovation: IMETI 2011 July 19th - July 22nd, 2011 -
  Orlando, FL, USA",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The high-performance scalable parallel algorithm for rigorous calculation of
partition function of lattice systems with finite number Ising spins was
developed. The parallel calculations run by C++ code with using of Message
Passing Interface and massive parallel instructions. The algorithm can be used
for the research of the interacting spin systems in the Ising models of 2D and
3D. The processing power and scalability is analyzed for different parallel and
distributed systems. Different methods of the speed up measuring allow obtain
the super-linear speeding up for the small number of processes. Program code
could be useful also for research by exact method of different Ising spin
systems, e.g. system with competition interactions.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2011 03:34:51 GMT'}]",2012-02-21,"[['Peretyatko', 'Alexey A.', ''], ['Bogatyrev', 'Ivan A.', ''], ['Kapitan', 'Vitaliy Yu.', ''], ['Kirienko', 'Yury V.', ''], ['Nefedev', 'Konstantin V.', ''], ['Belokon', 'Valery I.', '']]","['Massive-Parallel Algorithm', 'MPI', 'C++', 'Parallel']"
14777,1307.1166,Firas Ajil Jassim,Firas A. Jassim,"A Novel Robust Method to Add Watermarks to Bitmap Images by Fading
  Technique","5 pages, 6 figures, 1 table","International Journal of Multidisciplinary Sciences and
  Engineering, Vol. 4, No. 5, pp. 43-47, June 2013",,,cs.CV cs.MM,http://creativecommons.org/licenses/by/3.0/,"  Digital water marking is one of the essential fields in image security and
copyright protection. The proposed technique in this paper was based on the
principle of protecting images by hide an invisible watermark in the image. The
technique starts with merging the cover image and the watermark image with
suitable ratios, i.e., 99% from the cover image will be merged with 1% from the
watermark image. Technically, the fading process is irreversible but with the
proposed technique, the probability to reconstruct the original watermark image
is great. There is no perceptible difference between the original and
watermarked image by human eye. The experimental results show that the proposed
technique proven its ability to hide images that have the same size of the
cover image. Three performance measures were implemented to support the
proposed techniques which are MSE, PSNR, and SSIM. Fortunately, all the three
measures have excellent values.
","[{'version': 'v1', 'created': 'Wed, 3 Jul 2013 21:35:17 GMT'}]",2013-07-05,"[['Jassim', 'Firas A.', '']]","['Digital Watermarking', 'Image Fading', 'Robustness to Attacks and PSNR']"
14778,1604.06518,Vu Nguyen,Trung Le and Tu Dinh Nguyen and Vu Nguyen and Dinh Phung,Approximation Vector Machines for Large-scale Online Learning,54 pages,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the most challenging problems in kernel online learning is to bound
the model size and to promote the model sparsity. Sparse models not only
improve computation and memory usage, but also enhance the generalization
capacity, a principle that concurs with the law of parsimony. However,
inappropriate sparsity modeling may also significantly degrade the performance.
In this paper, we propose Approximation Vector Machine (AVM), a model that can
simultaneously encourage the sparsity and safeguard its risk in compromising
the performance. When an incoming instance arrives, we approximate this
instance by one of its neighbors whose distance to it is less than a predefined
threshold. Our key intuition is that since the newly seen instance is expressed
by its nearby neighbor the optimal performance can be analytically formulated
and maintained. We develop theoretical foundations to support this intuition
and further establish an analysis to characterize the gap between the
approximation and optimal solutions. This gap crucially depends on the
frequency of approximation and the predefined threshold. We perform the
convergence analysis for a wide spectrum of loss functions including Hinge,
smooth Hinge, and Logistic for classification task, and $l_1$, $l_2$, and
$\epsilon$-insensitive for regression task. We conducted extensive experiments
for classification task in batch and online modes, and regression task in
online mode over several benchmark datasets. The results show that our proposed
AVM achieved a comparable predictive performance with current state-of-the-art
methods while simultaneously achieving significant computational speed-up due
to the ability of the proposed AVM in maintaining the model size.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2016 01:57:01 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Apr 2016 01:16:21 GMT'}, {'version': 'v3', 'created': 'Wed, 5 Apr 2017 01:43:29 GMT'}, {'version': 'v4', 'created': 'Sun, 28 May 2017 01:26:48 GMT'}]",2017-05-30,"[['Le', 'Trung', ''], ['Nguyen', 'Tu Dinh', ''], ['Nguyen', 'Vu', ''], ['Phung', 'Dinh', '']]","['kernel', 'online learning', 'large-scale machine learning', 'sparsity', 'big data', 'coreset', 'stochastic gradient descent', 'convergence analysis']"
14779,1212.3786,Revati Shriram,"Revati Shriram, Dr. M. Sundhararajan and Nivedita Daimiwal",Brain Connectivity Analysis Methods for Better Understanding of Coupling,7 Pages,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Action, cognition, emotion and perception can be mapped in the brain by using
set of techniques. Translating unimodal concepts from one modality to another
is an important step towards understanding the neural mechanisms. This paper
provides a comprehensive survey of multimodal analysis of brain signals such as
fMRI, EEG, MEG, NIRS and motivations, assumptions and pitfalls associated with
it. All these non-invasive brain modalities complement and restrain each other
and hence improve our understating of functional and neuronal organization. By
combining the various modalities together, we can exploit the strengths and
flaws of individual brain imaging methods. Integrated anatomical analysis and
functional measurements of human brain offer a powerful paradigm for the brain
mapping. Here we provide the brief review on non invasive brain modalities,
describe the future of co-analysis of these brain signals.
","[{'version': 'v1', 'created': 'Sun, 16 Dec 2012 13:08:34 GMT'}]",2012-12-18,"[['Shriram', 'Revati', ''], ['Sundhararajan', 'Dr. M.', ''], ['Daimiwal', 'Nivedita', '']]","['EEG', 'fMRI', 'MEG', 'NIRS and  BMI']"
14780,1704.01770,Diego Garc\'ia-Gil,"Diego Garc\'ia-Gil, Juli\'an Luengo, Salvador Garc\'ia and Francisco
  Herrera",Enabling Smart Data: Noise filtering in Big Data classification,,,,,cs.DB cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In any knowledge discovery process the value of extracted knowledge is
directly related to the quality of the data used. Big Data problems, generated
by massive growth in the scale of data observed in recent years, also follow
the same dictate. A common problem affecting data quality is the presence of
noise, particularly in classification problems, where label noise refers to the
incorrect labeling of training instances, and is known to be a very disruptive
feature of data. However, in this Big Data era, the massive growth in the scale
of the data poses a challenge to traditional proposals created to tackle noise,
as they have difficulties coping with such a large amount of data. New
algorithms need to be proposed to treat the noise in Big Data problems,
providing high quality and clean data, also known as Smart Data. In this paper,
two Big Data preprocessing approaches to remove noisy examples are proposed: an
homogeneous ensemble and an heterogeneous ensemble filter, with special
emphasis in their scalability and performance traits. The obtained results show
that these proposals enable the practitioner to efficiently obtain a Smart
Dataset from any Big Data classification problem.
","[{'version': 'v1', 'created': 'Thu, 6 Apr 2017 10:06:52 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Jul 2017 11:39:16 GMT'}]",2017-07-31,"[['García-Gil', 'Diego', ''], ['Luengo', 'Julián', ''], ['García', 'Salvador', ''], ['Herrera', 'Francisco', '']]","['Big Data', 'Smart Data', 'Classification', 'Class Noise', 'Label Noise']"
14781,1604.06976,Mahyuddin K. M.  Nasution,Mahyuddin K. M. Nasution,Extracted Social Network Mining,"6 pages. Proceeding of International Conference on Information
  Technology and Engineering Application (5-th ICIBA), 86-91, February 19-20,
  2016",,,,cs.SI cs.AI,http://creativecommons.org/publicdomain/zero/1.0/,"  In this paper we study the relationship between the resources of social
networks by exploring the Web as big data based on a simple search engine. We
have used set theory by utilizing the occurrence and co-occurrence for defining
the singleton or doubleton spaces of event in a search engine model, and then
provided them as representation of social actors and their relationship in
clusters. Thus, there are behaviors of social actors and their relation based
on Web.
","[{'version': 'v1', 'created': 'Sun, 24 Apr 2016 02:39:16 GMT'}]",2016-04-26,"[['Nasution', 'Mahyuddin K. M.', '']]","['singleton', 'doubleton', 'cluster', 'behavior']"
14782,1206.2248,Tammo Krueger,"Tammo Krueger, Danny Panknin, Mikio Braun",Fast Cross-Validation via Sequential Testing,,"Journal of Machine Learning Research, 16:1103-1155, 2015",,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the increasing size of today's data sets, finding the right parameter
configuration in model selection via cross-validation can be an extremely
time-consuming task. In this paper we propose an improved cross-validation
procedure which uses nonparametric testing coupled with sequential analysis to
determine the best parameter set on linearly increasing subsets of the data. By
eliminating underperforming candidates quickly and keeping promising candidates
as long as possible, the method speeds up the computation while preserving the
capability of the full cross-validation. Theoretical considerations underline
the statistical power of our procedure. The experimental evaluation shows that
our method reduces the computation time by a factor of up to 120 compared to a
full cross-validation with a negligible impact on the accuracy.
","[{'version': 'v1', 'created': 'Mon, 11 Jun 2012 15:14:59 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Jan 2013 10:40:40 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Apr 2013 13:50:10 GMT'}, {'version': 'v4', 'created': 'Thu, 5 Sep 2013 18:27:04 GMT'}, {'version': 'v5', 'created': 'Wed, 16 Jul 2014 12:21:09 GMT'}, {'version': 'v6', 'created': 'Wed, 3 Feb 2016 21:13:20 GMT'}]",2016-02-05,"[['Krueger', 'Tammo', ''], ['Panknin', 'Danny', ''], ['Braun', 'Mikio', '']]","['cross-validation', 'statistical testing', 'nonparametric methods']"
14783,1702.06016,Fabiana Zollo,"Michela Del Vicario, Sabrina Gaito, Walter Quattrociocchi, Matteo
  Zignani, Fabiana Zollo","Public discourse and news consumption on online social media: A
  quantitative, cross-platform analysis of the Italian Referendum",,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rising attention to the spreading of fake news and unsubstantiated rumors
on online social media and the pivotal role played by confirmation bias led
researchers to investigate different aspects of the phenomenon. Experimental
evidence showed that confirmatory information gets accepted even if containing
deliberately false claims while dissenting information is mainly ignored or
might even increase group polarization. It seems reasonable that, to address
misinformation problem properly, we have to understand the main determinants
behind content consumption and the emergence of narratives on online social
media. In this paper we address such a challenge by focusing on the discussion
around the Italian Constitutional Referendum by conducting a quantitative,
cross-platform analysis on both Facebook public pages and Twitter accounts. We
observe the spontaneous emergence of well-separated communities on both
platforms. Such a segregation is completely spontaneous, since no
categorization of contents was performed a priori. By exploring the dynamics
behind the discussion, we find that users tend to restrict their attention to a
specific set of Facebook pages/Twitter accounts. Finally, taking advantage of
automatic topic extraction and sentiment analysis techniques, we are able to
identify the most controversial topics inside and across both platforms. We
measure the distance between how a certain topic is presented in the
posts/tweets and the related emotional response of users. Our results provide
interesting insights for the understanding of the evolution of the core
narratives behind different echo chambers and for the early detection of
massive viral phenomena around false claims.
","[{'version': 'v1', 'created': 'Mon, 20 Feb 2017 15:35:27 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Jun 2017 10:14:10 GMT'}]",2017-06-19,"[['Del Vicario', 'Michela', ''], ['Gaito', 'Sabrina', ''], ['Quattrociocchi', 'Walter', ''], ['Zignani', 'Matteo', ''], ['Zollo', 'Fabiana', '']]","['information spreading', 'news consumption', 'cross-platform comparison', 'online social media']"
14784,1702.02874,Sabri Pllana,"Florian Huber, Bernhard J\""ager, Sabri Pllana, Zdenek Hrdlicka,
  Christos Mettouris, George A. Papadopoulos, Tamara Matevc, Zs\'ofia
  Ocsovszky, Edina Hajdu, Chris Gary, Phil Smith","Pushing STEM-education through a social-media-based contest format -
  experiences and lessons-learned from the H2020-project SciChallenge",INTED 2017,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Science education is a crucial issue with long-term impacts for Europe as the
low enrolment rates in the STEM-fields, including (natural) science,
technology, engineering and mathematics, will lead to a workforce problem in
research and development. In order to address this challenge, the EU-funded
research project SciChallenge (project.scichallenge.eu) aims to find a new way
for getting young people more interested in STEM. For this purpose, the project
developed and implemented a social-media-based STEM-contest for young people,
which aims at increasing the attractiveness of science education and careers
among young people. In the first two parts, the paper reflects on the problem,
introduces the project and highlights the main steps of the preparation of the
contest. The third section of the paper presents the idea, design and
implementation of the digital contest platform (www.scichallenge.eu), which
serves as the core of the challenge. The fourth part of the paper will provide
a status update on the contest pilot. It will provide a summary of the
experiences that the consortium made with this novel approach as well as the
main obstacles that the consortium was facing. The paper will conclude with a
preliminary reflection on the question if such an approach can help to increase
the interest of young people in STEM-education and careers.
","[{'version': 'v1', 'created': 'Thu, 9 Feb 2017 16:18:11 GMT'}]",2017-02-10,"[['Huber', 'Florian', ''], ['Jäger', 'Bernhard', ''], ['Pllana', 'Sabri', ''], ['Hrdlicka', 'Zdenek', ''], ['Mettouris', 'Christos', ''], ['Papadopoulos', 'George A.', ''], ['Matevc', 'Tamara', ''], ['Ocsovszky', 'Zsófia', ''], ['Hajdu', 'Edina', ''], ['Gary', 'Chris', ''], ['Smith', 'Phil', '']]","['STEM-Education', 'Social Media', 'Contest', 'Networking', 'Young People']"
14785,1701.09131,Philippe Karamian - Surville,"Viwanou Hounkpati, Vladimir Salnikov, Alexandre Vivet, Philippe
  Karamian-Surville","On the choice of homogenization method to achieve effective mechanical
  properties of composites reinforced by ellipsoidal and spherical particles","27 pages, 12 figures",,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, several rigorous numerical simulations were conducted to
examine the relevance of mean-field micromechanical models compared to the Fast
Fourier Transform full-field computation by considering spherical or
ellipsoidal inclusions. To be more general, the numerical study was extended to
a mixture of different kind of microstructures consisting of spheroidal shapes
within the same RVE. Although the Fast Fourier Transform full field calculation
is sensitive to high contrasts, calculation time, for a combination of complex
microstructures, remains reasonable compared with those obtained with
mean-field micromechanical models. Moreover, for low volume fractions of
inclusions, the results of the mean-field approximations and those of the Fast
Fourier Transform-based (FFTb) full-field computation are very close, whatever
the inclusions morphology is. For RVEs consisting of ellipsoidal or a mixture
of ellipsoidal and spherical inclusions, when the inclusions volume fraction
becomes higher, one observes that Lielens' model and the FFTb full-field
computation give similar estimates. The accuracy of the computational methods
depends on the shape of the inclusions' and their volume fraction.
","[{'version': 'v1', 'created': 'Tue, 31 Jan 2017 17:06:29 GMT'}]",2017-02-01,"[['Hounkpati', 'Viwanou', ''], ['Salnikov', 'Vladimir', ''], ['Vivet', 'Alexandre', ''], ['Karamian-Surville', 'Philippe', '']]","['Composite materials', 'ellipsoidal and spherical reinforcements', 'Mechanicalproperties', 'Fast Fourier Transform', 'mean-field homogenization']"
14786,1408.0016,Rolf Schwitter,Stephen Guy and Rolf Schwitter,"Architecture of a Web-based Predictive Editor for Controlled Natural
  Language Processing",,,,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we describe the architecture of a web-based predictive text
editor being developed for the controlled natural language PENG$^{ASP)$. This
controlled language can be used to write non-monotonic specifications that have
the same expressive power as Answer Set Programs. In order to support the
writing process of these specifications, the predictive text editor
communicates asynchronously with the controlled natural language processor that
generates lookahead categories and additional auxiliary information for the
author of a specification text. The text editor can display multiple sets of
lookahead categories simultaneously for different possible sentence
completions, anaphoric expressions, and supports the addition of new content
words to the lexicon.
","[{'version': 'v1', 'created': 'Fri, 27 Jun 2014 01:00:59 GMT'}]",2014-08-04,"[['Guy', 'Stephen', ''], ['Schwitter', 'Rolf', '']]","['controlled natural language processing', 'predictive editor', 'web-based authoring tools', 'answer set programming']"
14787,1407.8515,Suryakant Patil Dr,"Suryakant B. Patil, Vijay S. Suryawanshi, Dipali V. Suryawanshi,
  Preeti Patil","Integrated ERP System for Improving the Functional efficiency of the
  organization by Customized Architecture",9 Pages; IJCEA 2014,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An ERP is a kind of package which consist front end and backend as DBMS like
a collection of DBMSs. You can create DBMS to manage one aspect of your
business. For example, a publishing house has a database of books that keeps
information about books such as Author Name, Title, Translator Name, etc. But
this database app only helps enter books data and search them. It doesn't help
them, for example, sell books. They get or develop another DBMS database that
has all the Books data plus prices, discount formulas, names of common clients,
etc. Now they connect the Books database to Sales database and maybe also the
inventory database. Now its DBMS slowly turning into an ERP. They may add
payroll database and connect it to this ERP. They may develop sales staff and
commissions database and connect it to this ERP and so on. In the traditional
Database management system the different databases are used for the various
Campuses of the JSPM Group of Education like Wagholi Campus, Tathwade Campus,
Narhe Campus, Hadpsar Campuses, Bhavdhan Campus as well as Corporate office at
Katraj of same organization so it is not possible to keep different databases
for the same so in this paper proposed the use of Integrated Database for the
Entire organization using ERP system. The Proposed ERP system applied on the
existing Architecture of the JSPM Group; the marginal difference observed in
the Databases need to be accessed to generate the same number of Reports when
use the Traditional DBMS which end up with improvement in the Functional
efficiency of Organizational Architecture.
","[{'version': 'v1', 'created': 'Tue, 29 Jul 2014 05:33:53 GMT'}]",2014-08-01,"[['Patil', 'Suryakant B.', ''], ['Suryawanshi', 'Vijay S.', ''], ['Suryawanshi', 'Dipali V.', ''], ['Patil', 'Preeti', '']]","['ERP', 'MIS', 'CRM', 'BIS', 'DBMS', 'Functional Efficiency', 'Customized Architecture']"
14788,1407.6879,Minati Mishra,Minati Mishra and M. C. Adhikary,Detection of Clones in Digital Images,"12 Pages, International Journal of Computer Science and Business
  Informatics, Jan 2014",,,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During the recent years, tampering of digital images has become a general
habit among people and professionals. As a result, establishment of image
authenticity has become a key issue in fields those make use of digital images.
Authentication of an image involves separation of original camera outputs from
their tampered or Stego counterparts. Digital image cloning being a popular
type of image tampering, in this paper we have experimentally analyzed seven
different algorithms of cloning detection such as the simple overlapped block
matching with lexicographic sorting (SOBMwLS) algorithm, block matching with
discrete cosine transformation, principal component analysis, discrete wavelet
transformation and singular value decomposition performed on the blocks (DCT,
DWT, PCA, SVD), two combination models where, DCT and DWT are combined with
singular value decomposition (DCTSVD and DWTSVD. A comparative study of all
these techniques with respect to their time complexities and robustness of
detection against various post processing operations such as cropping,
brightness and contrast adjustments are presented in the paper.
","[{'version': 'v1', 'created': 'Fri, 25 Jul 2014 13:00:50 GMT'}]",2014-07-28,"[['Mishra', 'Minati', ''], ['Adhikary', 'M. C.', '']]","['Digital Image', 'Tampering', 'Splicing', 'Cloning', 'DCT', 'SVD', 'DWT', 'PCA']"
14789,1606.06797,Mohamed El Yafrani,"Mohamed El Yafrani, Bela\""id Ahiod","\'Etude de Probl\`emes d'Optimisation Combinatoire \`a Multiples
  Composantes Interd\'ependantes","in French. Extended abstract presented at the URAC days meeting in
  Rabat, Morocco. The meeting website is available at
  https://sites.google.com/site/lriturac29/j-urac-2015",,,,cs.AI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This extended abstract presents an overview on NP-hard optimization problems
with multiple interdependent components. These problems occur in many
real-world applications: industrial applications, engineering, and logistics.
The fact that these problems are composed of many sub-problems that are NP-hard
makes them even more challenging to solve using exact algorithms. This is
mainly due to the high complexity of this class of algorithms and the hardness
of the problems themselves. The main source of difficulty of these problems is
the presence of internal dependencies between sub-problems. This aspect of
interdependence of components is presented, and some outlines on solving
approaches are briefly introduced from a (meta)heuristics and evolutionary
computation perspective.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2016 01:34:53 GMT'}]",2016-06-23,"[['Yafrani', 'Mohamed El', ''], ['Ahiod', 'Belaïd', '']]","['Interdependence', 'Combinatorial optimization', 'Metaheuristics', 'Evolutionary computation']"
14790,0905.4087,Fangwen Fu,"Fangwen Fu, Mihaela van der Schaar","Structural Solutions for Cross-Layer Optimization of Wireless Multimedia
  Transmission",,,,,cs.MM cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a systematic solution to the problem of cross-layer
optimization for delay-sensitive media transmission over time-varying wireless
channels as well as investigate the structures and properties of this solution,
such that it can be easily implemented in various multimedia systems and
applications. Specifically, we formulate this problem as a finite-horizon
Markov decision process (MDP) by explicitly considering the users'
heterogeneous multimedia traffic characteristics (e.g. delay deadlines,
distortion impacts and dependencies etc.), time-varying network conditions as
well as, importantly, their ability to adapt their cross-layer transmission
strategies in response to these dynamics. Based on the heterogeneous
characteristics of the media packets, we are able to express the transmission
priorities between packets as a new type of directed acyclic graph (DAG). This
DAG provides the necessary structure for determining the optimal cross-layer
actions in each time slot: the root packet in the DAG will always be selected
for transmission since it has the highest positive marginal utility; and the
complexity of the proposed cross-layer solution is demonstrated to linearly
increase w.r.t. the number of disconnected packet pairs in the DAG and
exponentially increase w.r.t. the number of packets on which the current
packets depend on. The simulation results demonstrate that the proposed
solution significantly outperforms existing state-of-the-art cross-layer
solutions. Moreover, we show that our solution provides the upper bound
performance for the cross-layer optimization solutions with delayed feedback
such as the well-known RaDiO framework.
","[{'version': 'v1', 'created': 'Mon, 25 May 2009 22:09:58 GMT'}]",2009-05-27,"[['Fu', 'Fangwen', ''], ['van der Schaar', 'Mihaela', '']]","['Multimedia Streaming', 'Wireless Multimedia Networking', 'Delay Sensitive Communication', 'Markov']"
14791,1106.4606,Prabhu Manyem,Prabhu Manyem,"Expressibility at the machine level versus structure level: ESO
  universal Horn Logic and the class P",,,,,cs.CC cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that ESO universal Horn logic (existential second logic where the
first order part is a universal Horn formula) is insufficient to capture P, the
class of problems decidable in polynomial time. This statement is true in the
presence of a successor relation in the input vocabulary. We provide two proofs
--- one based on reduced products of two structures, and another based on
approximability theory (the second proof is under the assumption that P is not
the same as NP). We show that the difference between the results here and those
in Gr\""{a}del (1991), is due to the fact that the expressions this paper deals
with are at the ""structure level"", whereas the expressions in Gr\""{a}del (1991)
are at the ""machine level"" --- a case of Easier done than said.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2011 01:55:56 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Oct 2011 12:53:31 GMT'}, {'version': 'v3', 'created': 'Fri, 18 Nov 2011 10:13:10 GMT'}, {'version': 'v4', 'created': 'Mon, 9 Jan 2012 04:55:50 GMT'}, {'version': 'v5', 'created': 'Mon, 23 Jul 2012 07:55:27 GMT'}]",2012-07-24,"[['Manyem', 'Prabhu', '']]","['Descriptive complexity', 'Optimization', 'Existential second order logic', 'Machine level', 'structure level']"
14792,1702.04270,Luis Alvarez,Luis Alvarez and Pablo G. Tahoces and Emilio Mac\'ias-Conde,Adding educational funcionalities to classic board games,Preprint,,,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we revisit some classic board games like Pachisi or the Game of
Gosse. The main contribution of the paper is to design and add some
functionalities to the games in order to transform them in serious games, that
is, in games with learning and educational purposes. To do that, at the
beginning of the game, players choose one or several topics and during the
game, players have to anwers questions on these topics in order to move their
markers. We choose classic board games because a lot of people are familiar
with them so it is very easy to start to play without wasting time learning
game rules and, we think that this is an important element to make the game
more attractive to people. To enlarge the number of potential users we have
implement the games just using html and javascript and the games can be used in
any web browser, in any computer (including tablets) , in any computer
arquitecture (Windows, Mac, Linux) and no internet/server conexion is required.
Associated software is distributed under Creative Commons
Attribution-NonCommercial-ShareAlike 3.0 licence and can be obtained at
http://www.ctim.es/SeriousGames
","[{'version': 'v1', 'created': 'Tue, 14 Feb 2017 15:54:02 GMT'}]",2017-02-15,"[['Alvarez', 'Luis', ''], ['Tahoces', 'Pablo G.', ''], ['Macías-Conde', 'Emilio', '']]","['Pachisi', 'Game of Goose', 'Html', 'Javascript', 'Jquery', 'Serious games']"
14793,1505.05220,Waldemar Koczkodaj Prof.,"W.W. Koczkodaj, J. Szybowski","The key properties of inconsistency indicators for a triad in pairwise
  comparison matrices","8 pages, 14 references; creative use of the distance to define
  inconsistency in pairwise comparisons (project originated in 2014 but
  submitted for a review in July 2015)",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Processing information, acquired by subjective assessments, involves
inconsistency analysis in most (if not all) applications of which some are of
considerable importance at a national level (see, Koczkodaj/Kulakowski/Ligenza,
Scientometrics, 99(3): 911-926, 2014)A triad inconsistency axiomatization in
pairwise comparisons was informally proposed in Koczkodaj/Szwarc, FUNDAMENTA
INFORMATICAE, 132(4): 485-500, 2014. This study, rectifies it by the use of the
distance and theoretical proofs. Three key properties of the indicator are
presented in this study and illustrated by several examples.
","[{'version': 'v1', 'created': 'Wed, 20 May 2015 01:50:28 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Aug 2015 17:31:32 GMT'}]",2015-08-06,"[['Koczkodaj', 'W. W.', ''], ['Szybowski', 'J.', '']]","['inconsistency', 'distance', 'knowledge management', 'pairwise comparison']"
14794,1205.2265,Mehrdad Mahdavi,"Mehrdad Mahdavi, Tianbao Yang, Rong Jin",Efficient Constrained Regret Minimization,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online learning constitutes a mathematical and compelling framework to
analyze sequential decision making problems in adversarial environments. The
learner repeatedly chooses an action, the environment responds with an outcome,
and then the learner receives a reward for the played action. The goal of the
learner is to maximize his total reward. However, there are situations in
which, in addition to maximizing the cumulative reward, there are some
additional constraints on the sequence of decisions that must be satisfied on
average by the learner. In this paper we study an extension to the online
learning where the learner aims to maximize the total reward given that some
additional constraints need to be satisfied. By leveraging on the theory of
Lagrangian method in constrained optimization, we propose Lagrangian
exponentially weighted average (LEWA) algorithm, which is a primal-dual variant
of the well known exponentially weighted average algorithm, to efficiently
solve constrained online decision making problems. Using novel theoretical
analysis, we establish the regret and the violation of the constraint bounds in
full information and bandit feedback models.
","[{'version': 'v1', 'created': 'Tue, 8 May 2012 23:06:06 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Oct 2012 06:49:29 GMT'}]",2012-10-05,"[['Mahdavi', 'Mehrdad', ''], ['Yang', 'Tianbao', ''], ['Jin', 'Rong', '']]","['online learning', 'bandit', 'regret-minimization', 'repeated game playing', 'constrained decision making']"
14795,1402.2375,Reena Philips Mrs,"Poornima U. S., Suma. V",Significance of Coupling and Cohesion on Design Quality,"6 Pages, 2 Figures",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, the complexity of the software is increasing due to
automation of every segment of application. Software is nowhere remained as
one-time development product since its architectural dimension is increasing
with addition of new requirements over a short duration. Object Oriented
Development (OOD) methodology is a popular development approach for such
systems which perceives and models the requirements as real world entities.
Classes and Objects logically represent the entities in the solution space and
quality of the software is directly depending on the design quality of these
logical entities. Cohesion and Coupling (C&C) are two major design decisive
factors in OOD which impacts the design of a class and dependency between them
in complex software. It is also most significant to measure C&C for software to
control the complexity level as requirements increases. Several metrics are in
practice to quantify C&C which plays a major role in measuring the design
quality. The software industries are focusing on increasing and measuring the
quality of the product through quality design to continue their market image in
the competitive world. As a part of our research, this paper highlights on the
impact of C&C on design quality of a complex system and its measures to
quantify the overall quality of software.
","[{'version': 'v1', 'created': 'Tue, 11 Feb 2014 05:19:56 GMT'}]",2014-02-12,"[['S.', 'Poornima U.', ''], ['V', 'Suma.', '']]","['Object Oriented Development', 'Design Quality', 'Coupling and Cohesion', 'Measures and Metrics']"
14796,1312.4552,Dr. Nadeem Javaid,"Muhammad Zohaib, Syed Mustafa Pasha, Nadeem Javaid, Jamshed Iqbal","Intelligent Bug Algorithm (IBA): A Novel Strategy to Navigate Mobile
  Robots Autonomously",Springer's International Multi Topic Conference 2013 (IMTIC '13),,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This research proposed an intelligent obstacle avoidance algorithm to
navigate an autonomous mobile robot. The presented Intelligent Bug Algorithm
(IBA) over performs and reaches the goal in relatively less time as compared to
existing Bug algorithms. The improved algorithm offers a goal oriented strategy
by following smooth and short trajectory. This has been achieved by
continuously considering the goal position during obstacle avoidance. The
proposed algorithm is computationally inexpensive and easy to tune. The paper
also presents the performance comparison of IBA and reported Bug algorithms.
Simulation results of robot navigation in an environment with obstacles
demonstrate the performance of the improved algorithm.
","[{'version': 'v1', 'created': 'Mon, 25 Nov 2013 10:54:22 GMT'}, {'version': 'v2', 'created': 'Sun, 22 Dec 2013 13:36:57 GMT'}]",2013-12-24,"[['Zohaib', 'Muhammad', ''], ['Pasha', 'Syed Mustafa', ''], ['Javaid', 'Nadeem', ''], ['Iqbal', 'Jamshed', '']]","['Obstacle avoidance', 'Path planning', 'Robot navigation', 'Mobile robots']"
14797,1403.7014,Takeshi Takahashi,Keita Emura and Akira Kanaoka and Satoshi Ohta and Takeshi Takahashi,"Building Secure and Anonymous Communication Channel: Formal Model and
  its Prototype Implementation","This is a preprint version of our paper presented in SAC'14, March
  24-28, 2014, Gyeongju, Korea. ACMSAC 2014",,,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Various techniques need to be combined to realize anonymously authenticated
communication. Cryptographic tools enable anonymous user authentication while
anonymous communication protocols hide users' IP addresses from service
providers. One simple approach for realizing anonymously authenticated
communication is their simple combination, but this gives rise to another
issue; how to build a secure channel. The current public key infrastructure
cannot be used since the user's public key identifies the user. To cope with
this issue, we propose a protocol that uses identity-based encryption for
packet encryption without sacrificing anonymity, and group signature for
anonymous user authentication. Communications in the protocol take place
through proxy entities that conceal users' IP addresses from service providers.
The underlying group signature is customized to meet our objective and improve
its efficiency. We also introduce a proof-of-concept implementation to
demonstrate the protocol's feasibility. We compare its performance to SSL
communication and demonstrate its practicality, and conclude that the protocol
realizes secure, anonymous, and authenticated communication between users and
service providers with practical performance.
","[{'version': 'v1', 'created': 'Thu, 27 Mar 2014 13:14:20 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Apr 2014 00:50:59 GMT'}, {'version': 'v3', 'created': 'Thu, 8 May 2014 00:49:54 GMT'}]",2014-05-09,"[['Emura', 'Keita', ''], ['Kanaoka', 'Akira', ''], ['Ohta', 'Satoshi', ''], ['Takahashi', 'Takeshi', '']]","['Anonymous Communication', 'Anonymous Authentication', 'Secure Channel', 'Identity-Based Encryption', 'Group Signature']"
14798,1712.03596,AmirAbbas Davari,"AmirAbbas Davari, Armin H\""aberle, Vincent Christlein, Andreas Maier,
  Christian Riess",Sketch Layer Separation in Multi-Spectral Historical Document Images,,,,,cs.CV cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  High-resolution imaging has delivered new prospects for detecting the
material composition and structure of cultural treasures. Despite the various
techniques for analysis, a significant diagnostic gap remained in the range of
available research capabilities for works on paper. Old master drawings were
mostly composed in a multi-step manner with various materials. This resulted in
the overlapping of different layers which made the subjacent strata difficult
to differentiate. The separation of stratified layers using imaging methods
could provide insights into the artistic work processes and help answer
questions about the object, its attribution, or in identifying forgeries. The
pattern recognition procedure was tested with mock replicas to achieve the
separation and the capability of displaying concealed red chalk under ink. In
contrast to RGB-sensor based imaging, the multi- or hyperspectral technology
allows accurate layer separation by recording the characteristic signatures of
the material's reflectance. The risk of damage to the artworks as a result of
the examination can be reduced by using combinations of defined spectra for
lightning and image capturing. By guaranteeing the maximum level of
readability, our results suggest that the technique can be applied to a broader
range of objects and assist in diagnostic research into cultural treasures in
the future.
","[{'version': 'v1', 'created': 'Sun, 10 Dec 2017 21:36:43 GMT'}]",2017-12-12,"[['Davari', 'AmirAbbas', ''], ['Häberle', 'Armin', ''], ['Christlein', 'Vincent', ''], ['Maier', 'Andreas', ''], ['Riess', 'Christian', '']]","['pattern recognition', 'multispectral analysis', 'art history', 'artistic work processes', 'old master drawings  Abstract']"
14799,1409.8633,Kashif Mahmood Mr,"Mattia Carpin, Andrea Zanella, Jawad Rasool, Kashif Mahmood, Ole
  Gr{\o}ndalen, Olav N. {\O}sterb{\o}","Scheduling Policies for the LTE Downlink Channel: A Performance
  Comparison",12 pages,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A key feature of the packet scheduler in LTE system is that it can allocate
resources both in the time and frequency domain. Furthermore, the scheduler is
acquainted with channel state information periodically reported by user
equipments either in an aggregate form for the whole downlink channel, or
distinguished for each available subchannel. This mechanism allows for wide
discretion in resource allocation, thus promoting the flourishing of several
scheduling algorithms, with different purposes. It is therefore of great
interest to compare the performance of such algorithms in different scenarios.
A very common simulation tool that can be used for this purpose is ns-3, which
already supports a set of well known scheduling algorithms for LTE downlink,
though it still lacks schedulers that provide throughput guarantees. In this
work we contribute to fill this gap by implementing a scheduling algorithm that
provides long-term throughput guarantees to the different users, while
opportunistically exploiting the instantaneous channel fluctuations to increase
the cell capacity. We then perform a thorough performance analysis of the
different scheduling algorithms by means of extensive ns-3 simulations, both
for saturated UDP and TCP traffic sources. The analysis makes it possible to
appreciate the difference among the scheduling algorithms, and to assess the
performance gain, both in terms of cell capacity and packet service time,
obtained by allowing the schedulers to work on the frequency domain.
","[{'version': 'v1', 'created': 'Tue, 30 Sep 2014 17:16:44 GMT'}]",2014-10-01,"[['Carpin', 'Mattia', ''], ['Zanella', 'Andrea', ''], ['Rasool', 'Jawad', ''], ['Mahmood', 'Kashif', ''], ['Grøndalen', 'Ole', ''], ['Østerbø', 'Olav N.', '']]","['Resource management', 'opportunistic scheduling', 'LTE networks', 'ns-3', 'fair throughput guarantee']"
14800,1207.7184,Alexandru I. Tomescu,"Martin Milani\v{c}, Romeo Rizzi, Alexandru I. Tomescu",Set graphs. II. Complexity of set graph recognition and similar problems,,,,,cs.DM cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A graph $G$ is said to be a `set graph' if it admits an acyclic orientation
that is also `extensional', in the sense that the out-neighborhoods of its
vertices are pairwise distinct. Equivalently, a set graph is the underlying
graph of the digraph representation of a hereditarily finite set. In this
paper, we continue the study of set graphs and related topics, focusing on
computational complexity aspects. We prove that set graph recognition is
NP-complete, even when the input is restricted to bipartite graphs with exactly
two leaves. The problem remains NP-complete if, in addition, we require that
the extensional acyclic orientation be also `slim', that is, that the digraph
obtained by removing any arc from it is not extensional. We also show that the
counting variants of the above problems are #P-complete, and prove similar
complexity results for problems related to a generalization of extensional
acyclic digraphs, the so-called `hyper-extensional digraphs', which were
proposed by Aczel to describe hypersets. Our proofs are based on reductions
from variants of the Hamiltonian Path problem. We also consider a variant of
the well-known notion of a separating code in a digraph, the so-called
`open-out-separating code', and show that it is NP-complete to determine
whether an input extensional acyclic digraph contains an open-out-separating
code of given size.
","[{'version': 'v1', 'created': 'Tue, 31 Jul 2012 08:41:33 GMT'}]",2015-03-20,"[['Milanič', 'Martin', ''], ['Rizzi', 'Romeo', ''], ['Tomescu', 'Alexandru I.', '']]","['acyclic orientation', 'extensionality', 'set graph', 'NP-complete problem', '#P-completeproblem', 'hyper-extensional digraph', 'separating code', 'open-out-separating code']"
14801,1412.4205,Xiaosha Zhao,"Xiaosha Zhao, Mandan Liu","The application of the Bayes Ying Yang harmony based GMMs in on-line
  signature verification",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this contribution, a Bayes Ying Yang(BYY) harmony based approach for
on-line signature verification is presented. In the proposed method, a simple
but effective Gaussian Mixture Models(GMMs) is used to represent for each
user's signature model based on the prior information collected. Different from
the early works, in this paper, we use the Bayes Ying Yang machine combined
with the harmony function to achieve Automatic Model Selection(AMS) during the
parameter learning for the GMMs, so that a better approximation of the user
model is assured. Experiments on a database from the First International
Signature Verification Competition(SVC 2004) confirm that this combined
algorithm yields quite satisfactory results.
","[{'version': 'v1', 'created': 'Sat, 13 Dec 2014 08:57:49 GMT'}]",2014-12-16,"[['Zhao', 'Xiaosha', ''], ['Liu', 'Mandan', '']]","['Signature verification', 'Bayes Ying-Yang machine', 'Gaussian Mixture Models', 'AMS']"
14802,1312.6430,Kota Hara,Kota Hara and Rama Chellappa,"Growing Regression Forests by Classification: Applications to Object
  Pose Estimation",Paper accepted by ECCV 2014,,,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we propose a novel node splitting method for regression trees
and incorporate it into the regression forest framework. Unlike traditional
binary splitting, where the splitting rule is selected from a predefined set of
binary splitting rules via trial-and-error, the proposed node splitting method
first finds clusters of the training data which at least locally minimize the
empirical loss without considering the input space. Then splitting rules which
preserve the found clusters as much as possible are determined by casting the
problem into a classification problem. Consequently, our new node splitting
method enjoys more freedom in choosing the splitting rules, resulting in more
efficient tree structures. In addition to the Euclidean target space, we
present a variant which can naturally deal with a circular target space by the
proper use of circular statistics. We apply the regression forest employing our
node splitting to head pose estimation (Euclidean target space) and car
direction estimation (circular target space) and demonstrate that the proposed
method significantly outperforms state-of-the-art methods (38.5% and 22.5%
error reduction respectively).
","[{'version': 'v1', 'created': 'Sun, 22 Dec 2013 22:10:42 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Jul 2014 02:51:13 GMT'}]",2014-07-16,"[['Hara', 'Kota', ''], ['Chellappa', 'Rama', '']]","['Pose Estimation', 'Direction Estimation', 'Regression Tree', 'Random Forest']"
14803,1105.0991,Qiang Zhu Professor,"Qiang Zhu, Xinke Wang, Juanjuan Ren",Extra connectivity measures of 3-ary n-cubes,"10 pages, 2 figures",,,,cs.DM cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The h-extra connectivity is an important parameter to measure the reliability
and fault tolerance ability of large interconnection networks. The k-ary n-cube
is an important interconnection network of parallel computing systems. The
1-restricted connectivity of k-ary n-cubes has been obtained by Chen et al. for
k > 3 in [Y.-C. Chen, J. J. M. Tan, Restricted connectivity for three families
of interconnection networks, Applied Mathematics and Computation 188 (2)
(2007)1848--1855]. Nevertheless, the h-extra connectivity of 3-ary n-cubes has
not been obtained yet. In this paper we prove that the 1-extra connectivity of
a 3-ary n-cube is 4n-3 for n> 1 and the 2-extra connectivity of 3-ary n-cube is
6n-7 for n> 2.
","[{'version': 'v1', 'created': 'Thu, 5 May 2011 06:49:07 GMT'}]",2011-05-06,"[['Zhu', 'Qiang', ''], ['Wang', 'Xinke', ''], ['Ren', 'Juanjuan', '']]","['3-ary n-cubes', 'extra connectivity', 'super connectivity', 'interconnection networks']"
14804,1702.01381,Iaroslav Melekhov,"Iaroslav Melekhov, Juha Ylioinas, Juho Kannala and Esa Rahtu",Relative Camera Pose Estimation Using Convolutional Neural Networks,"To be published in proceedings of Advanced Concepts for Intelligent
  Vision Systems (ACIVS) 2017",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a convolutional neural network based approach for
estimating the relative pose between two cameras. The proposed network takes
RGB images from both cameras as input and directly produces the relative
rotation and translation as output. The system is trained in an end-to-end
manner utilising transfer learning from a large scale classification dataset.
The introduced approach is compared with widely used local feature based
methods (SURF, ORB) and the results indicate a clear improvement over the
baseline. In addition, a variant of the proposed architecture containing a
spatial pyramid pooling (SPP) layer is evaluated and shown to further improve
the performance.
","[{'version': 'v1', 'created': 'Sun, 5 Feb 2017 08:53:24 GMT'}, {'version': 'v2', 'created': 'Tue, 2 May 2017 05:31:38 GMT'}, {'version': 'v3', 'created': 'Fri, 28 Jul 2017 07:34:50 GMT'}]",2017-07-31,"[['Melekhov', 'Iaroslav', ''], ['Ylioinas', 'Juha', ''], ['Kannala', 'Juho', ''], ['Rahtu', 'Esa', '']]","['relative camera pose estimation', 'deep neural networks', 'spatial pyramid pooling']"
14805,1407.3398,D Govind,"D. Govind, Anju Susan Biju and Aguthu Smily",Speech Polarity Detection Using Hilbert Phase Information,"4 pages, 2 figures,
  http://nlp.amrita.edu:8080/TTS/polarityprograms.zip",,,,cs.SD,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The objective of the present work is to propose a method to automatically
detect polarity of the speech signals by estimating instants of significant
excitation of the vocaltract and the cosine phase of the analytic signal
representation. The phase changes in the analytic signal around the Hilbert
envelope (HE) peaks are found to vary according to the polarity of the given
speech signal. The relevant HE peaks for the Hilbert phase analysis are
selected by estimating the instants of significant excitation in speech. The
speech polarity identification rate obtained for the proposed method is almost
equal to the state of the art residual skewness method for speech polarity
detection. The proposed method also provides the same results for the polarity
detection in electro-glottogram signals. Finally, the robustness of the
proposed method is confirmed from the reduced detection error rates obtained in
noisy environments with various signal to noise ratios (SNRs). The MATLAB codes
used for implementing the proposed method are available for download from the
following link: http://nlp.amrita.edu:8080/TTS/polarityprograms.zip
","[{'version': 'v1', 'created': 'Sat, 12 Jul 2014 16:30:30 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Jul 2014 05:23:38 GMT'}]",2014-07-18,"[['Govind', 'D.', ''], ['Biju', 'Anju Susan', ''], ['Smily', 'Aguthu', '']]","['Speech polarity detection', 'Hilbert phase', 'Hilbert envelope', 'analytic signal']"
14806,1409.7623,Rajesh Sharma,"Rajesh Sharma, Matteo Magnani and Danilo Montesi",Missing data in multiplex networks: a preliminary study,7 pages,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A basic problem in the analysis of social networks is missing data. When a
network model does not accurately capture all the actors or relationships in
the social system under study, measures computed on the network and ultimately
the final outcomes of the analysis can be severely distorted. For this reason,
researchers in social network analysis have characterised the impact of
different types of missing data on existing network measures. Recently a lot of
attention has been devoted to the study of multiple-network systems, e.g.,
multiplex networks. In these systems missing data has an even more significant
impact on the outcomes of the analyses. However, to the best of our knowledge,
no study has focused on this problem yet. This work is a first step in the
direction of understanding the impact of missing data in multiple networks. We
first discuss the main reasons for missingness in these systems, then we
explore the relation between various types of missing information and their
effect on network properties. We provide initial experimental evidence based on
both real and synthetic data.
","[{'version': 'v1', 'created': 'Fri, 26 Sep 2014 16:18:32 GMT'}]",2014-09-29,"[['Sharma', 'Rajesh', ''], ['Magnani', 'Matteo', ''], ['Montesi', 'Danilo', '']]","['missing data', 'multilayer networks', 'multiplex']"
14807,1106.4300,Lin Zhong,Siqi Zhao and Lin Zhong and Jehan Wickramasuriya and Venu Vasudevan,"Human as Real-Time Sensors of Social and Physical Events: A Case Study
  of Twitter and Sports Games",,,,"Technical Report TR0620-2011, Rice University and Motorola Labs,
  June 2011",cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we study how Twitter can be used as a sensor to detect frequent
and diverse social and physical events in real-time. We devise efficient data
collection and event recognition solutions that work despite various limits on
free access to Twitter data. We describe a web service implementation of our
solution and report our experience with the 2010-2011 US National Football
League (NFL) games. The service was able to recognize NFL game events within 40
seconds and with accuracy up to 90%. This capability will be very useful for
not only real-time electronic program guide for live broadcast programs but
also refined auction of advertisement slots. More importantly, it demonstrates
for the first time the feasibility of using Twitter for real-time social and
physical event detection for ubiquitous computing.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2011 19:35:48 GMT'}]",2011-06-22,"[['Zhao', 'Siqi', ''], ['Zhong', 'Lin', ''], ['Wickramasuriya', 'Jehan', ''], ['Vasudevan', 'Venu', '']]","['Twitter', 'social networks', 'NFL', 'event recognition']"
14808,0907.0138,Samuel Fiorini,"Celine Engelbeen, Samuel Fiorini, Antje Kiesel",A closest vector problem arising in radiation therapy planning,Major revision.,,,,cs.DM math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider the problem of finding a vector that can be written
as a nonnegative integer linear combination of given 0-1 vectors, the
generators, such that the l_1-distance between this vector and a given target
vector is minimized. We prove that this closest vector problem is NP-hard to
approximate within a O(d) additive error, where d is the dimension of the
ambient vector space. We show that the problem can be approximated within a
O(d^{3/2}) additive error in polynomial time, by rounding an optimal solution
of a natural LP relaxation for the problem. We also observe that in the
particular case where the target vector is integer and the generators form a
totally unimodular matrix, the problem can be solved in polynomial time.
  The closest vector problem arises in the elaboration of radiation therapy
plans. In this context, the target is a nonnegative integer matrix and the
generators are certain 0-1 matrices whose rows satisfy the consecutive ones
property. Here we mainly consider the version of the problem in which the set
of generators comprises all those matrices that have on each nonzero row a
number of ones that is at least a certain constant. This set of generators
encodes the so-called minimum separation constraint.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2009 12:58:39 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Nov 2009 12:15:00 GMT'}, {'version': 'v3', 'created': 'Thu, 11 Mar 2010 16:01:48 GMT'}]",2010-03-12,"[['Engelbeen', 'Celine', ''], ['Fiorini', 'Samuel', ''], ['Kiesel', 'Antje', '']]","['closest vector problem', 'decomposition of integer matrices', 'consecutiveones property', 'radiation therapy', 'minimum separation constraint']"
14809,1010.2989,Petros Petrosyan,"P.A. Petrosyan, A.Yu. Torosyan, N.A. Khachatryan",Interval total colorings of graphs,"23 pages, 1 figure",,,,cs.DM,http://creativecommons.org/licenses/by/3.0/,"  A total coloring of a graph $G$ is a coloring of its vertices and edges such
that no adjacent vertices, edges, and no incident vertices and edges obtain the
same color. An \emph{interval total $t$-coloring} of a graph $G$ is a total
coloring of $G$ with colors $1,2,\...,t$ such that at least one vertex or edge
of $G$ is colored by $i$, $i=1,2,\...,t$, and the edges incident to each vertex
$v$ together with $v$ are colored by $d_{G}(v)+1$ consecutive colors, where
$d_{G}(v)$ is the degree of the vertex $v$ in $G$. In this paper we investigate
some properties of interval total colorings. We also determine exact values of
the least and the greatest possible number of colors in such colorings for some
classes of graphs.
","[{'version': 'v1', 'created': 'Thu, 14 Oct 2010 17:37:33 GMT'}]",2010-10-15,"[['Petrosyan', 'P. A.', ''], ['Torosyan', 'A. Yu.', ''], ['Khachatryan', 'N. A.', '']]","['total coloring', 'interval coloring', 'connected graph', 'regular graph', 'bipartitegraph']"
14810,1505.07254,Oliver Mason,"Naoise Holohan, Doug Leith and Oliver Mason",Differentially Private Response Mechanisms on Categorical Data,,,,,cs.DM cs.CR math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study mechanisms for differential privacy on finite datasets. By deriving
\emph{sufficient sets} for differential privacy we obtain necessary and
sufficient conditions for differential privacy, a tight lower bound on the
maximal expected error of a discrete mechanism and a characterisation of the
optimal mechanism which minimises the maximal expected error within the class
of mechanisms considered.
","[{'version': 'v1', 'created': 'Wed, 27 May 2015 10:16:57 GMT'}]",2015-05-28,"[['Holohan', 'Naoise', ''], ['Leith', 'Doug', ''], ['Mason', 'Oliver', '']]","['Data Privacy', 'Differential Privacy', 'Optimal Mechanisms']"
14811,1402.7190,Venugopal K r,"S kumarasawamy, Srikanth P L, Manjula S H, K R Venugopal, L M Patnaik","Two Stage Prediction Process with Gradient Descent Methods Aligning with
  the Data Privacy Preservation",14 pages,"International Journal of Information Processing, 7(3), 68-82, 2013",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Privacy preservation emphasize on authorization of data, which signifies that
data should be accessed only by authorized users. Ensuring the privacy of data
is considered as one of the challenging task in data management. The
generalization of data with varying concept hierarchies seems to be interesting
solution. This paper proposes two stage prediction processes on privacy
preserved data. The privacy is preserved using generalization and betraying
other communicating parties by disguising generalized data which adds another
level of privacy. The generalization with betraying is performed in first stage
to define the knowledge or hypothesis and which is further optimized using
gradient descent method in second stage prediction for accurate prediction of
data. The experiment carried with both batch and stochastic gradient methods
and it is shown that bulk operation performed by batch takes long time and more
iterations than stochastic to give more accurate solution.
","[{'version': 'v1', 'created': 'Fri, 28 Feb 2014 10:36:16 GMT'}]",2014-03-03,"[['kumarasawamy', 'S', ''], ['L', 'Srikanth P', ''], ['H', 'Manjula S', ''], ['Venugopal', 'K R', ''], ['Patnaik', 'L M', '']]","['Batch Gradient', 'Gradient Descent', 'RDF and Ontology', 'Stochastic Gradient']"
14812,1011.0098,Reinhard Moratz,"Till Mossakowski, Reinhard Moratz","Qualitative Reasoning about Relative Direction on Adjustable Levels of
  Granularity",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An important issue in Qualitative Spatial Reasoning is the representation of
relative direction. In this paper we present simple geometric rules that enable
reasoning about relative direction between oriented points. This framework, the
Oriented Point Algebra OPRA_m, has a scalable granularity m. We develop a
simple algorithm for computing the OPRA_m composition tables and prove its
correctness. Using a composition table, algebraic closure for a set of OPRA
statements is sufficient to solve spatial navigation tasks. And it turns out
that scalable granularity is useful in these navigation tasks.
","[{'version': 'v1', 'created': 'Sat, 30 Oct 2010 19:06:44 GMT'}]",2010-11-02,"[['Mossakowski', 'Till', ''], ['Moratz', 'Reinhard', '']]","['Qualitative Spatial Reasoning', 'Constraint-based Reasoning', 'Qualitative Simulation']"
14813,1610.02348,Mohamad Ivan Fanany,"Arif Budiman, Mohamad Ivan Fanany, Chan Basaruddin","Adaptive Convolutional ELM For Concept Drift Handling in Online Stream
  Data","Submitted to IEEE Transactions on Systems, Man and Cybernetics:
  Systems. Special Issue on Efficient and Rapid Machine Learning Algorithms for
  Big Data and Dynamic Varying Systems",,,SMCA-16-09-1038,cs.AI cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In big data era, the data continuously generated and its distribution may
keep changes overtime. These challenges in online stream of data are known as
concept drift. In this paper, we proposed the Adaptive Convolutional ELM method
(ACNNELM) as enhancement of Convolutional Neural Network (CNN) with a hybrid
Extreme Learning Machine (ELM) model plus adaptive capability. This method is
aimed for concept drift handling. We enhanced the CNN as convolutional
hiererchical features representation learner combined with Elastic ELM
(E$^2$LM) as a parallel supervised classifier. We propose an Adaptive OS-ELM
(AOS-ELM) for concept drift adaptability in classifier level (named ACNNELM-1)
and matrices concatenation ensembles for concept drift adaptability in ensemble
level (named ACNNELM-2). Our proposed Adaptive CNNELM is flexible that works
well in classifier level and ensemble level while most current methods only
proposed to work on either one of the levels.
  We verified our method in extended MNIST data set and not MNIST data set. We
set the experiment to simulate virtual drift, real drift, and hybrid drift
event and we demonstrated how our CNNELM adaptability works. Our proposed
method works well and gives better accuracy, computation scalability, and
concept drifts adaptability compared to the regular ELM and CNN. Further
researches are still required to study the optimum parameters and to use more
varied image data set.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2016 16:53:09 GMT'}]",2016-10-10,"[['Budiman', 'Arif', ''], ['Fanany', 'Mohamad Ivan', ''], ['Basaruddin', 'Chan', '']]","['deep learning', 'extreme learning machine', 'convolutional', 'neural network', 'big data', 'online', 'concept drift']"
14814,1702.06941,Ai Azuma,"Ai Azuma, Masashi Shimbo, Yuji Matsumoto",An Algebraic Formalization of Forward and Forward-backward Algorithms,"55 pages, in submission to JMLR",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose an algebraic formalization of the two important
classes of dynamic programming algorithms called forward and forward-backward
algorithms. They are generalized extensively in this study so that a wide range
of other existing algorithms is subsumed. Forward algorithms generalized in
this study subsume the ordinary forward algorithm on trellises for sequence
labeling, the inside algorithm on derivation forests for CYK parsing, a
unidirectional message passing on acyclic factor graphs, the forward mode of
automatic differentiation on computation graphs with addition and
multiplication, and so on. In addition, we reveal algebraic structures
underlying complicated computation with forward algorithms. By the aid of the
revealed algebraic structures, we also propose a systematic framework to design
complicated variants of forward algorithms. Forward-backward algorithms
generalized in this study subsume the ordinary forward-backward algorithm on
trellises for sequence labeling, the inside-outside algorithm on derivation
forests for CYK parsing, the sum-product algorithm on acyclic factor graphs,
the reverse mode of automatic differentiation (a.k.a. back propagation) on
computation graphs with addition and multiplication, and so on. We also propose
an algebraic characterization of what can be computed by forward-backward
algorithms and elucidate the relationship between forward and forward-backward
algorithms.
","[{'version': 'v1', 'created': 'Wed, 22 Feb 2017 18:56:44 GMT'}]",2017-02-23,"[['Azuma', 'Ai', ''], ['Shimbo', 'Masashi', ''], ['Matsumoto', 'Yuji', '']]","['forward-backward algorithm', 'inside-outside algorithm', 'sum-product algorithm', 'back propagation', 'semiring']"
14815,1410.0461,Graeme Wilson N,"Graeme N. Wilson, Alejandro Ramirez-Serrano, Qiao Sun","Vehicle Parameter Independent Gain Matrix Selection for a Quadrotor
  using State-Space Controller Design Methods","8 pages, 10 figures",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With quadrotor use seeing extensive growth in recent years, the autonomous
control of these Unmanned Aerial Vehicles (UAVs) is an increasing relevant and
intersting field. In this paper a linear state-space approach at designing a
stable hover controller in the presence of disturbances is presented along with
simulation of control system performance. Additionally the design of a tracking
system, for linear inertial position and yaw, is presented with simulation
results. The gain matrix developed for this control system is independent of
the specific quadrotor parameters, meaning that this same gain matrix can be
used on a wide variety of quadrotors without modification. The hover and
tracking controllers designed in this paper proved to perform well in
simulation under perturbation disturbances and normally distributed
disturbances on the UAVs linear speeds and angular speeds.
","[{'version': 'v1', 'created': 'Thu, 2 Oct 2014 07:24:28 GMT'}]",2014-10-03,"[['Wilson', 'Graeme N.', ''], ['Ramirez-Serrano', 'Alejandro', ''], ['Sun', 'Qiao', '']]","['Quadrotor', 'UAV', 'State-Space', 'Linear Control']"
14816,1504.01954,Heider Ali Mr,Heider K. Ali and Anthony Whitehead,Image Subset Selection Using Gabor Filters and Neural Networks,14 pages,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An automatic method for the selection of subsets of images, both modern and
historic, out of a set of landmark large images collected from the Internet is
presented in this paper. This selection depends on the extraction of dominant
features using Gabor filtering. Features are selected carefully from a
preliminary image set and fed into a neural network as a training data. The
method collects a large set of raw landmark images containing modern and
historic landmark images and non-landmark images. The method then processes
these images to classify them as landmark and non-landmark images. The
classification performance highly depends on the number of candidate features
of the landmark.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2015 13:22:13 GMT'}]",2015-04-09,"[['Ali', 'Heider K.', ''], ['Whitehead', 'Anthony', '']]","['Feature Extraction', 'Neural Networks', 'Gabor Filters', 'Subset Selection', 'Image Categorization']"
14817,1402.7200,Venugopal K r,"Leena Giri G, Srikanth P L, S H Manjula, K R Venugopal, L M Patnaik","Mathematical Model of Semantic Look - An Efficient Context Driven Search
  Engine",12 pages,"International Journal of Information Processing, 7(2), 20-31, 2013",,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The WorldWideWeb (WWW) is a huge conservatory of web pages. Search Engines
are key applications that fetch web pages for the user query. In the current
generation web architecture, search engines treat keywords provided by the user
as isolated keywords without considering the context of the user query. This
results in a lot of unrelated pages or links being displayed to the user.
Semantic Web is based on the current web with a revised framework to display a
more precise result set as response to a user query. The current web pages need
to be annotated by finding relevant meta data to be added to each of them, so
that they become useful to Semantic Web search engines. Semantic Look explores
the context of user query by processing the Semantic information recorded in
the web pages. It is compared with an existing algorithm called OntoLook and it
is shown that Semantic Look is a better optimized search engine by being more
than twice as fast as OntoLook.
","[{'version': 'v1', 'created': 'Fri, 28 Feb 2014 10:55:24 GMT'}]",2014-03-03,"[['G', 'Leena Giri', ''], ['L', 'Srikanth P', ''], ['Manjula', 'S H', ''], ['Venugopal', 'K R', ''], ['Patnaik', 'L M', '']]","['Ontology', 'RDF', 'Semantic Web']"
14818,1401.2008,Jeya Bharathi,C.Jeyabharathi and A.Pethalakshmi,New Approaches with Chord in Efficient P2P Grid Resource Discovery,"14 pages,9 figure",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Grid computing is a type of distributed computing which allows sharing of
computer resources through Internet. It not only allows us to share files but
also most of the software and hardware resources. An efficient resource
discovery mechanism is the fundamental requirements for grid computing systems,
as it supports resource management and scheduling of applications. Among
various discovery mechanisms,Peer-to-Peer (P2P) technology witnessed rapid
development and the key component for this success is efficient lookup
applications of P2P. Chord is a P2P structural model widely used as a routing
protocol to find resources in grid environment. Plenty of ideas are implemented
by researchers to improve the lookup performance of chord protocol in Grid
environment. In this paper, we discuss the recent researches made on Chord
Structured P2P protocol and present our proposed methods in which we use the
address of Recently Visited Node (RVN) and fuzzy technique to easily locate the
grid resources by reducing message complexity and time complexity.
","[{'version': 'v1', 'created': 'Thu, 9 Jan 2014 14:09:16 GMT'}]",2015-06-01,"[['Jeyabharathi', 'C.', ''], ['Pethalakshmi', 'A.', '']]","['Grid Resource Discovery', 'Recently-Visited-Node', 'Peer-to-Peer', 'Fuzzy Classification', 'Intrusion Detection']"
14819,1604.07660,Haluk O. Bingol,Dogukan Erenel and Haluk O. Bingol,"An Accelerometer Based Calculator for Visually Impaired People Using
  Mobile Devices",,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent trend of touch-screen devices produces an accessibility barrier for
visually impaired people. On the other hand, these devices come with sensors
such as accelerometer. This calls for new approaches to human computer
interface (HCI). In this study, our aim is to find an alternative approach to
classify 20 different hand gestures captured by iPhone 3GS's built-in
accelerometer and make high accuracy on user-independent classifications using
Dynamic Time Warping (DTW) with dynamic warping window sizes. 20 gestures with
1,100 gesture data are collected from 15 normal-visioned people. This data set
is used for training. Experiment-1 based on this data set produced an accuracy
rate of 96.7~\%. In order for visually impaired people to use the system, a
gesture recognition based ""talking"" calculator is implemented. In Experiment-2,
4 visually impaired end-users used the calculator and obtained 95.5~\% accuracy
rate among 17 gestures with 720 gesture data totally. Contributions of the
techniques to the end result is also investigated. Dynamic warping window size
is found to be the most effective one. The data and the code is available.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2016 12:55:28 GMT'}]",2016-04-27,"[['Erenel', 'Dogukan', ''], ['Bingol', 'Haluk O.', '']]","['Accessibility', 'Visually impaired', 'Gesture recognition', 'Accelerometer', 'Dynamic Time Warping(DTW)', 'Mobile phones', 'Ubiquitous computing']"
14820,1609.04810,Raphael Falque,"Raphael Falque, Teresa Vidal-Calleja, Gamini Dissanayake, Jaime Valls
  Miro",From the Skin-Depth Equation to the Inverse RFEC Sensor Model,"Submitted and accepted to the 14th International Conference on
  Control, Automation, Robotics and Vision (ICARCV 2016)",,,,cs.CE cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we tackle the direct and inverse problems for the Remote-Field
Eddy-Current (RFEC) technology. The direct problem is the sensor model, where
given the geometry the measurements are obtained. Conversely, the inverse
problem is where the geometry needs to be estimated given the field
measurements. These problems are particularly important in the field of
Non-Destructive Testing (NDT) because they allow assessing the quality of the
structure monitored. We solve the direct problem in a parametric fashion using
Least Absolute Shrinkage and Selection Operation (LASSO). The proposed inverse
model uses the parameters from the direct model to recover the thickness using
least squares producing the optimal solution given the direct model. This study
is restricted to the 2D axisymmetric scenario. Both, direct and inverse models,
are validated using a Finite Element Analysis (FEA) environment with realistic
pipe profiles.
","[{'version': 'v1', 'created': 'Thu, 15 Sep 2016 07:43:44 GMT'}]",2016-09-19,"[['Falque', 'Raphael', ''], ['Vidal-Calleja', 'Teresa', ''], ['Dissanayake', 'Gamini', ''], ['Miro', 'Jaime Valls', '']]","['Remote Field Eddy Current (RFEC)', 'directproblem', 'inverse problem', 'Non Destructive Evaluation (NDE)']"
14821,1502.04266,Masoud Abbaszadeh,"Masoud Abbaszadeh, Reza Solgi","Constrained Nonlinear Model Predictive Control of an MMA Polymerization
  Process via Evolutionary Optimization","12 pages, 9 figures, 28 references",,,,cs.SY cs.AI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, a nonlinear model predictive controller is developed for a
batch polymerization process. The physical model of the process is
parameterized along a desired trajectory resulting in a trajectory linearized
piecewise model (a multiple linear model bank) and the parameters are
identified for an experimental polymerization reactor. Then, a multiple model
adaptive predictive controller is designed for thermal trajectory tracking of
the MMA polymerization. The input control signal to the process is constrained
by the maximum thermal power provided by the heaters. The constrained
optimization in the model predictive controller is solved via genetic
algorithms to minimize a DMC cost function in each sampling interval.
","[{'version': 'v1', 'created': 'Sun, 15 Feb 2015 01:11:51 GMT'}]",2015-02-17,"[['Abbaszadeh', 'Masoud', ''], ['Solgi', 'Reza', '']]","['Model Predictive Control', 'Genetic Algorithms', 'Polymerization', 'Methyl Methacrylate', 'Parameter Identification']"
14822,1708.01135,"Eike Hermann M\""uller","William R. Saunders, James Grant, Eike H. M\""uller",Long range forces in a performance portable Molecular Dynamics framework,"9 pages, 3 figures, submitted to ParCo 2017 Parallel Computing
  Conference",,,,cs.DC cs.SE physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Molecular Dynamics (MD) codes predict the fundamental properties of matter by
following the trajectories of a collection of interacting model particles. To
exploit diverse modern manycore hardware, efficient codes must use all
available parallelism. At the same time they need to be portable and easily
extendible by the domain specialist (physicist/chemist) without detailed
knowledge of this hardware. To address this challenge, we recently described a
new Domain Specific Language (DSL) for the development of performance portable
MD codes based on a ""Separation of Concerns"": a Python framework automatically
generates efficient parallel code for a range of target architectures.
  Electrostatic interactions between charged particles are important in many
physical systems and often dominate the runtime. Here we discuss the inclusion
of long-range interaction algorithms in our code generation framework. These
algorithms require global communications and careful consideration has to be
given to any impact on parallel scalability. We implemented an Ewald summation
algorithm for electrostatic forces, present scaling comparisons for different
system sizes and compare to the performance of existing codes. We also report
on further performance optimisations delivered with OpenMP shared memory
parallelism.
","[{'version': 'v1', 'created': 'Thu, 3 Aug 2017 13:46:07 GMT'}]",2017-08-04,"[['Saunders', 'William R.', ''], ['Grant', 'James', ''], ['Müller', 'Eike H.', '']]","['Molecular Dynamics', 'Electrostatic', 'Ewald Summation', 'Domain Specific Language', 'Parallel Computing']"
14823,1003.4076,William Jackson,"M. S. Danessh, C. Balasubramanian, K. Duraiswamy","Similarity Data Item Set Approach: An Encoded Temporal Data Base
  Technique",,"Journal of Computing, Volume 2, Issue 3, March 2010,
  https://sites.google.com/site/journalofcomputing/",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data mining has been widely recognized as a powerful tool to explore added
value from large-scale databases. Finding frequent item sets in databases is a
crucial in data mining process of extracting association rules. Many algorithms
were developed to find the frequent item sets. This paper presents a summary
and a comparative study of the available FP-growth algorithm variations
produced for mining frequent item sets showing their capabilities and
efficiency in terms of time and memory consumption on association rule mining
by taking application of specific information into account. It proposes pattern
growth mining paradigm based FP-tree growth algorithm, which employs a tree
structure to compress the database. The performance study shows that the anti-
FP-growth method is efficient and scalable for mining both long and short
frequent patterns and is about an order of magnitude faster than the Apriority
algorithm and also faster than some recently reported new frequent-pattern
mining.
","[{'version': 'v1', 'created': 'Mon, 22 Mar 2010 06:23:56 GMT'}]",2010-03-23,"[['Danessh', 'M. S.', ''], ['Balasubramanian', 'C.', ''], ['Duraiswamy', 'K.', '']]","['Encoding\xa0method', 'frequent pattern mining', 'FP growth', 'FP tax', 'anti FP growth algorithm']"
14824,1510.02342,Stella Lee Miss,"Stella Lee, Martin Walda, Delimpasi Vasiliki",Born In Bradford Mobile Application,4 pages,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Born In Bradford mobile application is an Android mobile application and
a working prototype that enables interaction with a sample cohort of the Born
in Bradford study. It provides an interface and visualization for several
surveys participated in by mothers and their children. This data is stored in
the Born In Bradford database. A subset of this data is provided for mothers
and children. The mobile application provides a way to engage the mothers and
promote their consistency in participating in subsequent surveys. It has been
designed to allow selected mothers to participate in the visualization of their
babies data. Samsung mobile phones have been provided with the application
loaded on the phone to limit and control its use and access to data. Mothers
login to interact with the data. This includes the ability to compare children
data through infographics and graphs and comparing their children data with the
average child. This comparison is done at different stages of the children ages
as provided in the dataset.
","[{'version': 'v1', 'created': 'Thu, 8 Oct 2015 14:42:42 GMT'}]",2015-10-09,"[['Lee', 'Stella', ''], ['Walda', 'Martin', ''], ['Vasiliki', 'Delimpasi', '']]","['Mobile Applications', 'Android', 'Java', 'Born In Bradford']"
14825,1511.01633,Anthony Widjaja Lin,"Anthony W. Lin, Pablo Barcelo","String Solving with Word Equations and Transducers: Towards a Logic for
  Analysing Mutation XSS (Full Version)",Full version of POPL'16 paper,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the fundamental issue of decidability of satisfiability over string
logics with concatenations and finite-state transducers as atomic operations.
Although restricting to one type of operations yields decidability, little is
known about the decidability of their combined theory, which is especially
relevant when analysing security vulnerabilities of dynamic web pages in a more
realistic browser model. On the one hand, word equations (string logic with
concatenations) cannot precisely capture sanitisation functions (e.g.
htmlescape) and implicit browser transductions (e.g. innerHTML mutations). On
the other hand, transducers suffer from the reverse problem of being able to
model sanitisation functions and browser transductions, but not string
concatenations. Naively combining word equations and transducers easily leads
to an undecidable logic. Our main contribution is to show that the
""straight-line fragment"" of the logic is decidable (complexity ranges from
PSPACE to EXPSPACE). The fragment can express the program logics of
straight-line string-manipulating programs with concatenations and
transductions as atomic operations, which arise when performing bounded model
checking or dynamic symbolic executions. We demonstrate that the logic can
naturally express constraints required for analysing mutation XSS in web
applications. Finally, the logic remains decidable in the presence of length,
letter-counting, regular, indexOf, and disequality constraints.
","[{'version': 'v1', 'created': 'Thu, 5 Nov 2015 07:21:46 GMT'}]",2015-11-06,"[['Lin', 'Anthony W.', ''], ['Barcelo', 'Pablo', '']]","['String analysis', 'XSS', 'word equations', 'transducers']"
14826,1506.03844,Jose Rodrigues Jr,"Marcos Bedo, Gustavo Blanco, Willian Oliveira, Mirela Cazzolato, Alceu
  Costa, Jose Rodrigues, Agma Traina and Caetano Traina Jr","Techniques for effective and efficient fire detection from social media
  images","12 pages, Proceedings of the International Conference on Enterprise
  Information Systems. Specifically: Marcos Bedo, Gustavo Blanco, Willian
  Oliveira, Mirela Cazzolato, Alceu Costa, Jose Rodrigues, Agma Traina, Caetano
  Traina, 2015, Techniques for effective and efficient fire detection from
  social media images, ICEIS, 34-45",Int Conf on Enterp Inf Systems 34-45 SCITEPRESS (2015),,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media could provide valuable information to support decision making in
crisis management, such as in accidents, explosions and fires. However, much of
the data from social media are images, which are uploaded in a rate that makes
it impossible for human beings to analyze them. Despite the many works on image
analysis, there are no fire detection studies on social media. To fill this
gap, we propose the use and evaluation of a broad set of content-based image
retrieval and classification techniques for fire detection. Our main
contributions are: (i) the development of the Fast-Fire Detection method
(FFDnR), which combines feature extractor and evaluation functions to support
instance-based learning, (ii) the construction of an annotated set of images
with ground-truth depicting fire occurrences -- the FlickrFire dataset, and
(iii) the evaluation of 36 efficient image descriptors for fire detection.
Using real data from Flickr, our results showed that FFDnR was able to achieve
a precision for fire detection comparable to that of human annotators.
Therefore, our work shall provide a solid basis for further developments on
monitoring images from social media.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2015 21:23:38 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Jul 2015 20:02:17 GMT'}]",2015-07-07,"[['Bedo', 'Marcos', ''], ['Blanco', 'Gustavo', ''], ['Oliveira', 'Willian', ''], ['Cazzolato', 'Mirela', ''], ['Costa', 'Alceu', ''], ['Rodrigues', 'Jose', ''], ['Traina', 'Agma', ''], ['Traina', 'Caetano', 'Jr']]","['Fire Detection', 'Feature Extraction', 'Evaluation Functions', 'Image Descriptors', 'Social Media']"
14827,1510.05491,Mehmet Basbug,Mehmet Emin Basbug and Barbara Engelhardt,AdaCluster : Adaptive Clustering for Heterogeneous Data,Submitted to JMLR on January 2017,,,,cs.LG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Clustering algorithms start with a fixed divergence, which captures the
possibly asymmetric distance between a sample and a centroid. In the mixture
model setting, the sample distribution plays the same role. When all attributes
have the same topology and dispersion, the data are said to be homogeneous. If
the prior knowledge of the distribution is inaccurate or the set of plausible
distributions is large, an adaptive approach is essential. The motivation is
more compelling for heterogeneous data, where the dispersion or the topology
differs among attributes. We propose an adaptive approach to clustering using
classes of parametrized Bregman divergences. We first show that the density of
a steep exponential dispersion model (EDM) can be represented with a Bregman
divergence. We then propose AdaCluster, an expectation-maximization (EM)
algorithm to cluster heterogeneous data using classes of steep EDMs. We compare
AdaCluster with EM for a Gaussian mixture model on synthetic data and nine UCI
data sets. We also propose an adaptive hard clustering algorithm based on
Generalized Method of Moments. We compare the hard clustering algorithm with
k-means on the UCI data sets. We empirically verified that adaptively learning
the underlying topology yields better clustering of heterogeneous data.
","[{'version': 'v1', 'created': 'Mon, 19 Oct 2015 14:25:27 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Jan 2017 23:11:39 GMT'}]",2017-01-10,"[['Basbug', 'Mehmet Emin', ''], ['Engelhardt', 'Barbara', '']]","['Clustering', 'Mixture Models', 'Bregman Divergences', 'Exponential Dispersion Model', 'Heterogeneous Data']"
14828,1701.02797,Kele Xu,"Kele Xu, Xi Liu, Hengxing Cai and Zhifeng Gao","Full-reference image quality assessment-based B-mode ultrasound image
  similarity measure","7 pages, 4 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During the last decades, the number of new full-reference image quality
assessment algorithms has been increasing drastically. Yet, despite of the
remarkable progress that has been made, the medical ultrasound image similarity
measurement remains largely unsolved due to a high level of speckle noise
contamination. Potential applications of the ultrasound image similarity
measurement seem evident in several aspects. To name a few, ultrasound imaging
quality assessment, abnormal function region detection, etc. In this paper, a
comparative study was made on full-reference image quality assessment methods
for ultrasound image visual structural similarity measure. Moreover, based on
the image similarity index, a generic ultrasound motion tracking
re-initialization framework is given in this work. The experiments are
conducted on synthetic data and real-ultrasound liver data and the results
demonstrate that, with proposed similarity-based tracking re-initialization,
the mean error of landmarks tracking can be decreased from 2 mm to about 1.5 mm
in the ultrasound liver sequence.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2017 21:54:02 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Jan 2017 20:45:49 GMT'}]",2017-01-19,"[['Xu', 'Kele', ''], ['Liu', 'Xi', ''], ['Cai', 'Hengxing', ''], ['Gao', 'Zhifeng', '']]","['Full-reference image quality assessment', 'ultrasound image', 'motion tracking']"
14829,1510.04440,Silvia Crafa,Silvia Crafa,Modelling the Evolution of Programming Languages,,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Programming languages are engineered languages that allow to instruct a
machine and share algorithmic information; they have a great influence on the
society since they underlie almost every information technology artefact, and
they are at the core of the current explosion of software technology. The
history of programming languages is marked by innovations, diversifications,
lateral transfers and social influences; moreover, it represents an
intermediate case study between the evolution of human languages and the
evolution of technology. In this paper we study the application of the
Darwinian explanation to the programming languages evolution by discussing to
what extent the evolutionary mechanisms distinctive of biology can be applied
to this area. We show that a number of evolutionary building blocks can be
recognised in the realm of computer languages, but we also identify critical
issues. Far from being crystal clear, this fine-grained study shows to be a
useful tool to assess recent results about programming languages phylogenies.
Finally, we show that rich evolutionary patterns, such as co-evolution,
macro-evolutionary trends, niche construction and exaptation, can be
effectively applied to programming languages and provide for interesting
explanatory tools.
","[{'version': 'v1', 'created': 'Thu, 15 Oct 2015 08:18:54 GMT'}]",2015-10-16,"[['Crafa', 'Silvia', '']]","['evolutionary theory', 'programming languages', 'evolution of technology', 'cultural evolution']"
14830,1209.4532,Sachin Lakra,"T.V. Prasad, Sachin Lakra, G. Ramakrishna","Applicability of Crisp and Fuzzy Logic in Intelligent Response
  Generation","4 pages, 1 table","Published in proceedings of National Conference on Information,
  Computational Technologies and e-Governance 2010, Alwar, Rajasthan, India,
  19-20 November, 2010, pp. 137-139",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses the merits and demerits of crisp logic and fuzzy logic
with respect to their applicability in intelligent response generation by a
human being and by a robot. Intelligent systems must have the capability of
taking decisions that are wise and handle situations intelligently. A direct
relationship exists between the level of perfection in handling a situation and
the level of completeness of the available knowledge or information or data
required to handle the situation. The paper concludes that the use of crisp
logic with complete knowledge leads to perfection in handling situations
whereas fuzzy logic can handle situations imperfectly only. However, in the
light of availability of incomplete knowledge fuzzy theory is more effective
but may be disadvantageous as compared to crisp logic.
","[{'version': 'v1', 'created': 'Thu, 20 Sep 2012 14:00:06 GMT'}]",2012-09-21,"[['Prasad', 'T. V.', ''], ['Lakra', 'Sachin', ''], ['Ramakrishna', 'G.', '']]","['Crisp Logic', 'Fuzzy Logic', 'Intelligent Response Generation', 'Soft Computing']"
14831,1510.01949,Martti Vainio,Antti Suni and Daniel Aalto and Martti Vainio,Hierarchical Representation of Prosody for Statistical Speech Synthesis,"22 pages, 5 figures",,,,cs.CL cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Prominences and boundaries are the essential constituents of prosodic
structure in speech. They provide for means to chunk the speech stream into
linguistically relevant units by providing them with relative saliences and
demarcating them within coherent utterance structures. Prominences and
boundaries have both been widely used in both basic research on prosody as well
as in text-to-speech synthesis. However, there are no representation schemes
that would provide for both estimating and modelling them in a unified fashion.
Here we present an unsupervised unified account for estimating and representing
prosodic prominences and boundaries using a scale-space analysis based on
continuous wavelet transform. The methods are evaluated and compared to earlier
work using the Boston University Radio News corpus. The results show that the
proposed method is comparable with the best published supervised annotation
methods.
","[{'version': 'v1', 'created': 'Wed, 7 Oct 2015 14:08:13 GMT'}]",2015-10-08,"[['Suni', 'Antti', ''], ['Aalto', 'Daniel', ''], ['Vainio', 'Martti', '']]","['phonetics', 'prosody', 'speech synthesis', 'wavelets']"
14832,1406.4547,Patrick Sol\'e,"Claude Carlet, Finley Freibert, Sylvain Guilley, Michael Kiermaier,
  Jon-Lark Kim, Patrick Sol\'e",Higher-order CIS codes,13 pages; 1 figure,,,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce {\bf complementary information set codes} of higher-order. A
binary linear code of length $tk$ and dimension $k$ is called a complementary
information set code of order $t$ ($t$-CIS code for short) if it has $t$
pairwise disjoint information sets. The duals of such codes permit to reduce
the cost of masking cryptographic algorithms against side-channel attacks. As
in the case of codes for error correction, given the length and the dimension
of a $t$-CIS code, we look for the highest possible minimum distance. In this
paper, this new class of codes is investigated. The existence of good long CIS
codes of order $3$ is derived by a counting argument. General constructions
based on cyclic and quasi-cyclic codes and on the building up construction are
given. A formula similar to a mass formula is given. A classification of 3-CIS
codes of length $\le 12$ is given. Nonlinear codes better than linear codes are
derived by taking binary images of $\Z_4$-codes. A general algorithm based on
Edmonds' basis packing algorithm from matroid theory is developed with the
following property: given a binary linear code of rate $1/t$ it either provides
$t$ disjoint information sets or proves that the code is not $t$-CIS. Using
this algorithm, all optimal or best known $[tk, k]$ codes where $t=3, 4, \dots,
256$ and $1 \le k \le \lfloor 256/t \rfloor$ are shown to be $t$-CIS for all
such $k$ and $t$, except for $t=3$ with $k=44$ and $t=4$ with $k=37$.
","[{'version': 'v1', 'created': 'Tue, 17 Jun 2014 21:53:21 GMT'}]",2014-06-19,"[['Carlet', 'Claude', ''], ['Freibert', 'Finley', ''], ['Guilley', 'Sylvain', ''], ['Kiermaier', 'Michael', ''], ['Kim', 'Jon-Lark', ''], ['Solé', 'Patrick', '']]","['dual distance', 'Boolean functions', 'Z4-linearcodes', 'quasi-cyclic codes']"
14833,1312.4139,Andrew Adamatzky,Andrew Adamatzky,"Towards slime mould colour sensor: Recognition of colours by Physarum
  polycephalum",,"Adamatzky A. Towards slime mould colour sensor: Recognition of
  colours by Physarum polycephalum. Organic Electronics 14 (2013) 12, 3355-3361",,,cs.ET physics.bio-ph q-bio.CB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Acellular slime mould Physarum polycephalum is a popular now user-friendly
living substrate for designing of future and emergent sensing and computing
devices. P. polycephalum exhibits regular patterns of oscillations of its
surface electrical potential. The oscillation patterns are changed when the
slime mould is subjected to mechanical, chemical, electrical or optical
stimuli. We evaluate feasibility of slime-mould based colour sensors by
illuminating Physarum with red, green, blue and white colours and analysing
patterns of the slime mould's electrical potential oscillations. We define that
the slime mould recognises a colour if it reacts to illumination with the
colour by a unique changes in amplitude and periods of oscillatory activity. In
laboratory experiments we found that the slime mould recognises red and blue
colour. The slime mould does not differentiate between green and white colours.
The slime mould also recognises when red colour is switched off. We also map
colours to diversity of the oscillations: illumination with a white colour
increases diversity of amplitudes and periods of oscillations, other colours
studied increase diversity either of amplitude or period.
","[{'version': 'v1', 'created': 'Sun, 15 Dec 2013 12:02:44 GMT'}]",2013-12-17,"[['Adamatzky', 'Andrew', '']]","['biosensors', 'slime mould', 'illumination', 'sensitivity', 'electrical activity']"
14834,1610.01712,Sourangshu Bhattacharya,"Asis Roy, Sourangshu Bhattacharya, Kalyan Guin","A Methodology for Customizing Clinical Tests for Esophageal Cancer based
  on Patient Preferences",,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tests for Esophageal cancer can be expensive, uncomfortable and can have side
effects. For many patients, we can predict non-existence of disease with 100%
certainty, just using demographics, lifestyle, and medical history information.
Our objective is to devise a general methodology for customizing tests using
user preferences so that expensive or uncomfortable tests can be avoided. We
propose to use classifiers trained from electronic health records (EHR) for
selection of tests. The key idea is to design classifiers with 100% false
normal rates, possibly at the cost higher false abnormals. We compare Naive
Bayes classification (NB), Random Forests (RF), Support Vector Machines (SVM)
and Logistic Regression (LR), and find kernel Logistic regression to be most
suitable for the task. We propose an algorithm for finding the best probability
threshold for kernel LR, based on test set accuracy. Using the proposed
algorithm, we describe schemes for selecting tests, which appear as features in
the automatic classification algorithm, using preferences on costs and
discomfort of the users. We test our methodology with EHRs collected for more
than 3000 patients, as a part of project carried out by a reputed hospital in
Mumbai, India. Kernel SVM and kernel LR with a polynomial kernel of degree 3,
yields an accuracy of 99.8% and sensitivity 100%, without the MP features, i.e.
using only clinical tests. We demonstrate our test selection algorithm using
two case studies, one using cost of clinical tests, and other using
""discomfort"" values for clinical tests. We compute the test sets corresponding
to the lowest false abnormals for each criterion described above, using
exhaustive enumeration of 15 clinical tests. The sets turn out to different,
substantiating our claim that one can customize test sets based on user
preferences.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2016 01:56:00 GMT'}]",2016-10-07,"[['Roy', 'Asis', ''], ['Bhattacharya', 'Sourangshu', ''], ['Guin', 'Kalyan', '']]","['Personalized Diagnosis', 'Personalized test selection', 'EsophagealCancer', 'Classification with costs', 'Unbalanced classification', 'ElectronicHealth Record (EHR)']"
14835,1603.07475,Youngjin Yoon,"Youngjin Yoon, Gyeongmin Choe, Namil Kim, Joon-Young Lee, In So Kweon",Fine-scale Surface Normal Estimation using a Single NIR Image,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present surface normal estimation using a single near infrared (NIR)
image. We are focusing on fine-scale surface geometry captured with an
uncalibrated light source. To tackle this ill-posed problem, we adopt a
generative adversarial network which is effective in recovering a sharp output,
which is also essential for fine-scale surface normal estimation. We
incorporate angular error and integrability constraint into the objective
function of the network to make estimated normals physically meaningful. We
train and validate our network on a recent NIR dataset, and also evaluate the
generality of our trained model by using new external datasets which are
captured with a different camera under different environment.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2016 08:43:14 GMT'}]",2016-03-25,"[['Yoon', 'Youngjin', ''], ['Choe', 'Gyeongmin', ''], ['Kim', 'Namil', ''], ['Lee', 'Joon-Young', ''], ['Kweon', 'In So', '']]","['Shape from shading', 'near infrared image', 'generative adversarial network']"
14836,1511.00352,Abhinav Maurya,Abhinav Maurya,"Spatial Semantic Scan: Jointly Detecting Subtle Events and their Spatial
  Footprint",26 pages,,,,cs.LG cs.CL stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many methods have been proposed for detecting emerging events in text streams
using topic modeling. However, these methods have shortcomings that make them
unsuitable for rapid detection of locally emerging events on massive text
streams. We describe Spatially Compact Semantic Scan (SCSS) that has been
developed specifically to overcome the shortcomings of current methods in
detecting new spatially compact events in text streams. SCSS employs
alternating optimization between using semantic scan to estimate contrastive
foreground topics in documents, and discovering spatial neighborhoods with high
occurrence of documents containing the foreground topics. We evaluate our
method on Emergency Department chief complaints dataset (ED dataset) to verify
the effectiveness of our method in detecting real-world disease outbreaks from
free-text ED chief complaint data.
","[{'version': 'v1', 'created': 'Mon, 2 Nov 2015 01:45:41 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Feb 2016 03:01:41 GMT'}, {'version': 'v3', 'created': 'Sat, 28 May 2016 18:59:48 GMT'}]",2016-05-31,"[['Maurya', 'Abhinav', '']]","['Event Detection', 'Latent Dirichlet Allocation', 'Topic Modeling']"
14837,1510.06855,Fabrizio Sossan,"Fabrizio Sossan, Venkatachalam Lakshmanan, Giuseppe Tommaso Costanzo,
  Mattia Marinelli, Philip J. Douglass, Henrik Bindner","Grey-box Modelling of a Household Refrigeration Unit Using Time Series
  Data in Application to Demand Side Management","Submitted to Sustainable Energy Grids and Networks (SEGAN). Accepted
  for publication",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the application of stochastic grey-box modeling to
identify electrical power consumption-to-temperature models of a domestic
freezer using experimental measurements. The models are formulated using
stochastic differential equations (SDEs), estimated by maximum likelihood
estimation (MLE), validated through the model residuals analysis and
cross-validated to detect model over-fitting. A nonlinear model based on the
reversed Carnot cycle is also presented and included in the modeling
performance analysis. As an application of the models, we apply model
predictive control (MPC) to shift the electricity consumption of a freezer in
demand response experiments, thereby addressing the model selection problem
also from the application point of view and showing in an experimental context
the ability of MPC to exploit the freezer as a demand side resource (DSR).
","[{'version': 'v1', 'created': 'Fri, 23 Oct 2015 08:40:01 GMT'}]",2015-10-26,"[['Sossan', 'Fabrizio', ''], ['Lakshmanan', 'Venkatachalam', ''], ['Costanzo', 'Giuseppe Tommaso', ''], ['Marinelli', 'Mattia', ''], ['Douglass', 'Philip J.', ''], ['Bindner', 'Henrik', '']]","['Power demand', 'Modelling', 'Refrigerators', 'Smart grids', 'Demand Response']"
14838,0905.1780,Tiziana Calamoneri,Tiziana Calamoneri,"The L(2, 1)-Labeling Problem on Oriented Regular Grids","The content of this paper has been presented to ICTCS 2009, 28-30
  September, Cremona, Italy. This updated version is a longer and more complete
  version of the first submission (from 10 to 13 pages, from 5 to 7 figures)
  and a wrong figure has been corrected",,,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The L(2, 1)-labeling of a digraph G is a function f from the node set of $G$
to the set of all nonnegative integers such that $|f(x)-f(y)| \geq 2$ if $x$
and $y$ are at distance 1, and $f(x)=f(y)$ if $x$ and $y$ are at distance 2,
where the distance from vertex $x$ to vertex $y$ is the length of a shortest
dipath from $x$ to $y$. The minimum of the maximum used label over all $L(2,
1)$-labelings of $G$ is called $\lambda(G)$. In this paper we study the L(2,
1)-labeling problem on squared, triangular and hexagonal grids and for them we
compute the exact values of $\lambda$.
","[{'version': 'v1', 'created': 'Tue, 12 May 2009 07:48:14 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Oct 2009 12:32:01 GMT'}]",2009-10-01,"[['Calamoneri', 'Tiziana', '']]","['L(h', 'k)-labeling', 'graph coloring', 'digraphs', 'regular grids']"
14839,1502.04797,Amir Rastegarnia,Azam Khalili and Amir Rastegarnia,"Impact of network size on the performance of incremental LMS adaptive
  networks",4 pages; 4 figures; Conference,,,,cs.IT cs.SY math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we study the impact of network size on the performance of
incremental least mean square (ILMS) adaptive networks. Specifically, we
consider two ILMS networks with different number of nodes and compare their
performance in two different cases including (i) ideal links and (ii) noisy
links. We show that when the links between nodes are ideal, increasing the
network size improves the steady-state error. On the other hand, in the
presence of noisy links, we see different behavior and the ILMS adaptive
network with more nodes necessarily has not better steady-state performance.
Simulation results are also provided to illustrate the discussions.
","[{'version': 'v1', 'created': 'Mon, 16 Feb 2015 13:20:46 GMT'}]",2015-02-18,"[['Khalili', 'Azam', ''], ['Rastegarnia', 'Amir', '']]","['adaptive networks', 'distributed estimation', 'least mean-square', 'noisy links']"
14840,1511.00428,Sneha Gajbhiye,Sneha Gajbhiye and Ravi N. Banavar,"Geometric approach to tracking and stabilization for a spherical robot
  actuated by internal rotors",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents tracking control laws for two different objectives of a
nonholonomic system - a spherical robot - using a geometric approach. The first
control law addresses orientation tracking using a modified trace potential
function. The second law addresses contact position tracking using a $right$
transport map for the angular velocity error. A special case of this is
position and reduced orientation stabilization. Both control laws are
coordinate free. The performance of the feedback control laws are demonstrated
through simulations.
","[{'version': 'v1', 'created': 'Mon, 2 Nov 2015 10:12:41 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Dec 2016 04:20:00 GMT'}]",2016-12-15,"[['Gajbhiye', 'Sneha', ''], ['Banavar', 'Ravi N.', '']]","['Differential geometry', 'feedback stabilization', 'spherical robot']"
14841,1401.5874,Jiang Yupeng,Yupeng Jiang and Dongdai Lin,"Distribution properties of compressing sequences derived from primitive
  sequences modulo odd prime powers",18 pages,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $\underline{a}$ and $\underline{b}$ be primitive sequences over
$\mathbb{Z}/(p^e)$ with odd prime $p$ and $e\ge 2$. For certain compressing
maps, we consider the distribution properties of compressing sequences of
$\underline{a}$ and $\underline{b}$, and prove that
$\underline{a}=\underline{b}$ if the compressing sequences are equal at the
times $t$ such that $\alpha(t)=k$, where $\underline{\alpha}$ is a sequence
related to $\underline{a}$. We also discuss the $s$-uniform distribution
property of compressing sequences. For some compressing maps, we have that
there exist different primitive sequences such that the compressing sequences
are $s$-uniform. We also discuss that compressing sequences can be $s$-uniform
for how many elements $s$.
","[{'version': 'v1', 'created': 'Thu, 23 Jan 2014 05:12:19 GMT'}]",2014-01-24,"[['Jiang', 'Yupeng', ''], ['Lin', 'Dongdai', '']]","['Compressing map', 'integer residue ring', 'linear recurringsequence', 'primitive sequence', 's-uniform']"
14842,1401.1333,Bogdan Oancea,Bogdan Oancea and \c{S}Tefan Cristian Ciucu,Time series forecasting using neural networks,Proceedings of the CKS 2013 International Conference,Proceedings of the CKS 2013 International Conference,,,cs.NE,http://creativecommons.org/licenses/by/3.0/,"  Recent studies have shown the classification and prediction power of the
Neural Networks. It has been demonstrated that a NN can approximate any
continuous function. Neural networks have been successfully used for
forecasting of financial data series. The classical methods used for time
series prediction like Box-Jenkins or ARIMA assumes that there is a linear
relationship between inputs and outputs. Neural Networks have the advantage
that can approximate nonlinear functions. In this paper we compared the
performances of different feed forward and recurrent neural networks and
training algorithms for predicting the exchange rate EUR/RON and USD/RON. We
used data series with daily exchange rates starting from 2005 until 2013.
","[{'version': 'v1', 'created': 'Tue, 7 Jan 2014 10:29:24 GMT'}]",2018-02-09,"[['Oancea', 'Bogdan', ''], ['Ciucu', 'ŞTefan Cristian', '']]","['neural networks', 'time series', 'forecasting', 'exchange rate', 'predicting']"
14843,1206.1957,Sugata Sanyal,"Harshavardhan Kayarkar, Sugata Sanyal","A Survey on Various Data Hiding Techniques and their Comparative
  Analysis","9 pages, 1 table","ACTA Technica Corviniensis, Vol. 5, Issue 3, July-September 2012,
  pp. 35-40",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the explosive growth of internet and the fast communication techniques
in recent years the security and the confidentiality of the sensitive data has
become of prime and supreme importance and concern. To protect this data from
unauthorized access and tampering various methods for data hiding like
cryptography, hashing, authentication have been developed and are in practice
today. In this paper we will be discussing one such data hiding technique
called Steganography. Steganography is the process of concealing sensitive
information in any media to transfer it securely over the underlying unreliable
and unsecured communication network. Our paper presents a survey on various
data hiding techniques in Steganography that are in practice today along with
the comparative analysis of these techniques.
","[{'version': 'v1', 'created': 'Sat, 9 Jun 2012 17:01:58 GMT'}]",2012-07-04,"[['Kayarkar', 'Harshavardhan', ''], ['Sanyal', 'Sugata', '']]","['Data Hiding', 'Cover Media', 'Steganography', 'Steganalysis']"
14844,0903.0279,Jean Dezert,"Jean Dezert (ONERA), Florentin Smarandache",An introduction to DSmT,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The management and combination of uncertain, imprecise, fuzzy and even
paradoxical or high conflicting sources of information has always been, and
still remains today, of primal importance for the development of reliable
modern information systems involving artificial reasoning. In this
introduction, we present a survey of our recent theory of plausible and
paradoxical reasoning, known as Dezert-Smarandache Theory (DSmT), developed for
dealing with imprecise, uncertain and conflicting sources of information. We
focus our presentation on the foundations of DSmT and on its most important
rules of combination, rather than on browsing specific applications of DSmT
available in literature. Several simple examples are given throughout this
presentation to show the efficiency and the generality of this new approach.
","[{'version': 'v1', 'created': 'Mon, 2 Mar 2009 12:31:00 GMT'}]",2009-03-03,"[['Dezert', 'Jean', '', 'ONERA'], ['Smarandache', 'Florentin', '']]","['Dezert-Smarandache Theory', 'DSmT', 'quantitative and qualitative reasoning', 'information fusion']"
14845,1108.5514,Yu Zhang,"Yu Zhang, Mihaela van der Schaar","Strategic Learning and Robust Protocol Design for Online Communities
  with Selfish Users",,,,,cs.LG cs.GT cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper focuses on analyzing the free-riding behavior of self-interested
users in online communities. Hence, traditional optimization methods for
communities composed of compliant users such as network utility maximization
cannot be applied here. In our prior work, we show how social reciprocation
protocols can be designed in online communities which have populations
consisting of a continuum of users and are stationary under stochastic
permutations. Under these assumptions, we are able to prove that users
voluntarily comply with the pre-determined social norms and cooperate with
other users in the community by providing their services. In this paper, we
generalize the study by analyzing the interactions of self-interested users in
online communities with finite populations and are not stationary. To optimize
their long-term performance based on their knowledge, users adapt their
strategies to play their best response by solving individual stochastic control
problems. The best-response dynamic introduces a stochastic dynamic process in
the community, in which the strategies of users evolve over time. We then
investigate the long-term evolution of a community, and prove that the
community will converge to stochastically stable equilibria which are stable
against stochastic permutations. Understanding the evolution of a community
provides protocol designers with guidelines for designing social norms in which
no user has incentives to adapt its strategy and deviate from the prescribed
protocol, thereby ensuring that the adopted protocol will enable the community
to achieve the optimal social welfare.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2011 04:18:19 GMT'}]",2011-08-30,"[['Zhang', 'Yu', ''], ['van der Schaar', 'Mihaela', '']]","['Multi-agent Learning', 'Online Communities', 'Social Norm', 'Markov Decision Process', 'Stochastically Stable']"
14846,1410.0969,Abdul Kadir,Abdul Kadir,"A Model of Plant Identification System Using GLCM, Lacunarity And Shen
  Features",10 pages,"Research Journal of Pharmaceutical, Biological and Chemical
  Sciences, Vol 5(2), 2014",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, many approaches have been introduced by several researchers to
identify plants. Now, applications of texture, shape, color and vein features
are common practices. However, there are many possibilities of methods can be
developed to improve the performance of such identification systems. Therefore,
several experiments had been conducted in this research. As a result, a new
novel approach by using combination of Gray-Level Co-occurrence Matrix,
lacunarity and Shen features and a Bayesian classifier gives a better result
compared to other plant identification systems. For comparison, this research
used two kinds of several datasets that were usually used for testing the
performance of each plant identification system. The results show that the
system gives an accuracy rate of 97.19% when using the Flavia dataset and
95.00% when using the Foliage dataset and outperforms other approaches.
","[{'version': 'v1', 'created': 'Wed, 27 Aug 2014 00:49:05 GMT'}]",2014-10-07,"[['Kadir', 'Abdul', '']]","['GLCM', 'Lacunarity', 'Plant identification system', 'PFT', 'Shen features']"
14847,1702.03907,Adel Agamy,"Adel F. Agamy, Ahmed M. Mohamed",Performance Modeling of WSN with Bursty Delivery Mode,"12 pages, 26 figures",,,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Wireless Sensor Network (WSN) usually consist of hundreds or thousands of
sensor nodes scattered in a geographical area and one or multiple sink(s)
collecting information. The special design and character of sensors and their
applications make WSNs different from traditional networks. These
characteristics pose great challenges for architecture and protocol design,
performance modeling, and implementation. Accurately modeling the data
generated by each sensor node is essential for correctly simulating network
traffic, network congestion, interference between nodes and the energy expended
by each node. Successful design leads to enhancing the overall performance of
the whole of network. In this paper we analyze the performance of WSN with
N-BURST traffic model. The impact of bursty traffic on the mean packet delay
and buffer overflow probability is investigated analytically. We study the
effects of bursty WSN traffic through simulations with three different cases.
Both short-range dependency (SRD) traffic and long range dependency (LRD)
traffic are simulated over different burst parameters. Finally we study the
effect of pareto OFF time through simulation. The results are collected for 10
different 24 hour simulated periods in order to study and measure day-today
statistical fluctuation.
","[{'version': 'v1', 'created': 'Mon, 13 Feb 2017 18:15:28 GMT'}]",2017-02-14,"[['Agamy', 'Adel F.', ''], ['Mohamed', 'Ahmed M.', '']]","['Performance', 'Traffic Modeling', 'queuing theory', 'Wireless sensor network']"
14848,0905.2214,Michael Goodrich,"Michael T. Goodrich, Michael J. Nelson, Jonathan Z. Sun","The Rainbow Skip Graph: A Fault-Tolerant Constant-Degree P2P Relay
  Structure","Expanded version of a paper appearing in ACM-SIAM Symp. on Discrete
  Algorithms (SODA)",,,,cs.DS cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a distributed data structure, which we call the rainbow skip
graph. To our knowledge, this is the first peer-to-peer data structure that
simultaneously achieves high fault tolerance, constant-sized nodes, and fast
update and query times for ordered data. It is a non-trivial adaptation of the
SkipNet/skip-graph structures of Harvey et al. and Aspnes and Shah, so as to
provide fault-tolerance as these structures do, but to do so using
constant-sized nodes, as in the family tree structure of Zatloukal and Harvey.
It supports successor queries on a set of n items using O(log n) messages with
high probability, an improvement over the expected O(log n) messages of the
family tree.
","[{'version': 'v1', 'created': 'Wed, 13 May 2009 22:40:52 GMT'}]",2009-05-15,"[['Goodrich', 'Michael T.', ''], ['Nelson', 'Michael J.', ''], ['Sun', 'Jonathan Z.', '']]","['Distributed data structures', 'peer-to-peer networks', 'skip lists', 'skip graphs', 'familytrees', 'erasure codes']"
14849,1504.02093,Balaji Dhanasekaran,"Z. I. Dafalla, R.D. Balaji","Enhancing the Understanding of Computer Networking Courses through
  Software Tools","4 pages, ICOET 2015, Oman. arXiv admin note: substantial text overlap
  with arXiv:1504.01855",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer networking is an important specialization in Information and
Communication Technologies. However imparting the right knowledge to students
can be a challenging task due to the fact that there is not enough time to
deliver lengthy labs during normal lecture hours. Augmenting the use of
physical machines with software tools help the students to learn beyond the
limited lab sessions within the environment of higher Institutions of learning
throughout the world. The Institutions focus mostly on effective use of
available resources i.e. a lab may have few lab sessions scheduled within a day
for different courses. Hence a particular lab session must begin and end on
time. A slow student who did not complete his/her lab exercise must vacate the
lab because another class is about to commence. Hence using free software tools
such as OPNET IT guru, Packet trace and NS2 will help the student to learn
beyond the College time. A Student will gain an insight into Computer
networking field by repeatedly doing the same labs at the comfort of his laptop
or PC at home, hence increasing deeper understanding into the subject. The main
objective of this paper is to explore the software tools which will enhance the
networks practical skills among higher education students at College of Applied
Sciences Salalah. The paper also discusses the methodologies of implementing
and executing lab sessions after the normal college hours. The limitations and
suggestions for the improvements are also specified at the end of this paper.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2015 08:08:55 GMT'}]",2015-04-10,"[['Dafalla', 'Z. I.', ''], ['Balaji', 'R. D.', '']]","['ICT', 'Flip Classes', 'E-Learning', 'Network Labs', 'Higher Education']"
14850,1701.04600,Amit Awekar,"Siddhesh Khandelwal, Amit Awekar",Faster K-Means Cluster Estimation,"6 pages, Accepted at ECIR 2017",,,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There has been considerable work on improving popular clustering algorithm
`K-means' in terms of mean squared error (MSE) and speed, both. However, most
of the k-means variants tend to compute distance of each data point to each
cluster centroid for every iteration. We propose a fast heuristic to overcome
this bottleneck with only marginal increase in MSE. We observe that across all
iterations of K-means, a data point changes its membership only among a small
subset of clusters. Our heuristic predicts such clusters for each data point by
looking at nearby clusters after the first iteration of k-means. We augment
well known variants of k-means with our heuristic to demonstrate effectiveness
of our heuristic. For various synthetic and real-world datasets, our heuristic
achieves speed-up of up-to 3 times when compared to efficient variants of
k-means.
","[{'version': 'v1', 'created': 'Tue, 17 Jan 2017 10:00:51 GMT'}]",2017-01-18,"[['Khandelwal', 'Siddhesh', ''], ['Awekar', 'Amit', '']]","['K-means', 'Clustering', 'Heuristic']"
14851,1501.04038,Benjamin McCamish,"Ben McCamish, Rich Meier, Jordan Landford, Robert Bass, Eduardo
  Cotilla-Sanchez, David Chiu","A Backend Framework for the Efficient Management of Power System
  Measurements","Published in Electric Power Systems Research (2016), not available
  yet",,,,cs.DB physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Increased adoption and deployment of phasor measurement units (PMU) has
provided valuable fine-grained data over the grid. Analysis over these data can
provide insight into the health of the grid, thereby improving control over
operations. Realizing this data-driven control, however, requires validating,
processing and storing massive amounts of PMU data. This paper describes a PMU
data management system that supports input from multiple PMU data streams,
features an event-detection algorithm, and provides an efficient method for
retrieving archival data. The event-detection algorithm rapidly correlates
multiple PMU data streams, providing details on events occurring within the
power system. The event-detection algorithm feeds into a visualization
component, allowing operators to recognize events as they occur. The indexing
and data retrieval mechanism facilitates fast access to archived PMU data.
Using this method, we achieved over 30x speedup for queries with high
selectivity. With the development of these two components, we have developed a
system that allows efficient analysis of multiple time-aligned PMU data
streams.
","[{'version': 'v1', 'created': 'Tue, 16 Dec 2014 20:16:52 GMT'}, {'version': 'v2', 'created': 'Wed, 25 May 2016 17:07:40 GMT'}]",2016-05-26,"[['McCamish', 'Ben', ''], ['Meier', 'Rich', ''], ['Landford', 'Jordan', ''], ['Bass', 'Robert', ''], ['Cotilla-Sanchez', 'Eduardo', ''], ['Chiu', 'David', '']]","['PMU', 'data management', 'bitmap index', 'electrical distance', 'correlation', 'power systemcontingency']"
14852,1501.00539,Amos Lapidoth,Christoph Bunte and Amos Lapidoth,Maximum R\'enyi Entropy Rate,Submitted to the IEEE Transactions on Information Theory,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two maximization problems of R\'enyi entropy rate are investigated: the
maximization over all stochastic processes whose marginals satisfy a linear
constraint, and the Burg-like maximization over all stochastic processes whose
autocovariance function begins with some given values. The solutions are
related to the solutions to the analogous maximization problems of Shannon
entropy rate.
","[{'version': 'v1', 'created': 'Sat, 3 Jan 2015 07:38:17 GMT'}]",2015-01-06,"[['Bunte', 'Christoph', ''], ['Lapidoth', 'Amos', '']]","['R´enyi entropy', 'R´enyi entropy rate', 'entropy rate', 'maximization', 'Burg’s Theorem']"
14853,1412.2123,Dawsen Hwang,"Dawsen Hwang, Patrick Jaillet, Zhengyuan Zhou",Distributed Multi-Depot Routing without Communications,"10 pages, 1 figure",,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider and formulate a class of distributed multi-depot routing
problems, where servers are to visit a set of requests, with the aim of
minimizing the total distance travelled by all servers. These problems fall
into two categories: distributed offline routing problems where all the
requests that need to be visited are known from the start; distributed online
routing problems where the requests come to be known incrementally. A critical
and novel feature of our formulations is that communications are not allowed
among the servers, hence posing an interesting and challenging question: what
performance can be achieved in comparison to the best possible solution
obtained from an omniscience planner with perfect communication capabilities?
The worst-case (over all possible request-set instances) performance metrics
are given by the approximation ratio (offline case) and the competitive ratio
(online case).
  Our first result indicates that the online and offline problems are
effectively equivalent: for the same request-set instance, the approximation
ratio and the competitive ratio differ by at most an additive factor of 2,
irrespective of the release dates in the online case. Therefore, we can
restrict our attention to the offline problem. For the offline problem, we show
that the approximation ratio given by the Voronoi partition is m (the number of
servers). For two classes of depot configurations, when the depots form a line
and when the ratios between the distances of pairs of depots are upper bounded
by a sublinear function f(m) (i.e., f(m) = o(m)), we give partition schemes
with sublinear approximation ratios O(log m) and {\Theta}(f(m)) respectively.
We also discuss several interesting open problems in our formulations: in
particular, how our initial results (on the two deliberately chosen classes of
depots) shape our conjecture on the open problems.
","[{'version': 'v1', 'created': 'Fri, 5 Dec 2014 20:14:58 GMT'}]",2014-12-08,"[['Hwang', 'Dawsen', ''], ['Jaillet', 'Patrick', ''], ['Zhou', 'Zhengyuan', '']]","['Traveling Salesman', 'Distributed Algorithms', 'Multi-Depot Routing', 'Robotics', 'Computational Geometry', 'Worst-case Analysis', 'Online Optimization']"
14854,1312.6293,Jerome Darmont,"Jaume Ferrarons (ERIC), Mulu Adhana (ERIC), Carlos Colmenares (ERIC),
  Sandra Pietrowska (ERIC), Fadila Bentayeb (ERIC), J\'er\^ome Darmont (ERIC)","PRIMEBALL: a Parallel Processing Framework Benchmark for Big Data
  Applications in the Cloud","5th TPC Technology Conference on Performance Evaluation and
  Benchmarking (VLDB/TPCTC 13), Riva del Garda : Italy (2013)",,,,cs.DC cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we draw the specifications of a novel benchmark for comparing
parallel processing frameworks in the context of big data applications hosted
in the cloud. We aim at filling several gaps in already existing cloud data
processing benchmarks, which lack a real-life context for their processes, thus
losing relevance when trying to assess performance for real applications.
Hence, we propose a fictitious news site hosted in the cloud that is to be
managed by the framework under analysis, together with several objective use
case scenarios and measures for evaluating system performance. The main
strengths of our benchmark are parallelization capabilities supporting cloud
features and big data properties.
","[{'version': 'v1', 'created': 'Sat, 21 Dec 2013 19:15:22 GMT'}]",2013-12-24,"[['Ferrarons', 'Jaume', '', 'ERIC'], ['Adhana', 'Mulu', '', 'ERIC'], ['Colmenares', 'Carlos', '', 'ERIC'], ['Pietrowska', 'Sandra', '', 'ERIC'], ['Bentayeb', 'Fadila', '', 'ERIC'], ['Darmont', 'Jérôme', '', 'ERIC']]","['Benchmark', 'Cloud Computing', 'Parallel Processing Framework', 'Big Data', 'Real Data']"
14855,1008.1851,Kamaljit  I Lakhtaria,"Kamaljit I. Lakhtaria, Dr. N. N. Jani",Design and Modeling Billing solution to Next Generation Networks,,,,"International Journal of Advanced Networking and Applications
  Volume: 01, Issue: 05, Pages: 290-294 (2010)",cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Next generation networks (NGN) services are assumed to be a new revenue
stream for both network operators and service providers. New services
especially focused on a mobile telecommunications that would be used not only
as a communication de vice but also as a personal gateway to order or consume a
variety of services and products [1]. This type of advanced services can be
accomplished when the adaptability of the packet-networks (Internet) and the
quality of service of the circuit switched networks are combined into one
network [2]. New challenges appear in the billing of this heterogeneous multi
services network. Some examples of such a services and possible solutions about
charging and billing are examined in this paper. The first steps of
mathematical model for billing are also considered.
","[{'version': 'v1', 'created': 'Wed, 11 Aug 2010 07:59:22 GMT'}]",2010-08-12,"[['Lakhtaria', 'Kamaljit I.', ''], ['Jani', 'Dr. N. N.', '']]","['AAA', 'Charging', 'NGN', 'Service Creation', 'UMTS']"
14856,1603.08717,Moran Feldman,Moran Feldman and Rica Gonen,Double-Sided Markets with Strategic Multi-dimensional Players,27 pages,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider mechanisms for markets that are double-sided and have players
with multi-dimensional strategic spaces on at least one side. The players of
the market are strategic, and act to optimize their own utilities. The
mechanism designer, on the other hand, aims to optimize a social goal, i.e.,
the gain from trade. We focus on one example of this setting which is motivated
by the foreseeable future form of online advertising.
  Online advertising currently supports some of the most important Internet
services, including: search, social media and user generated content sites. To
overcome privacy concerns, it has been suggested to introduce user information
markets through information brokers into the online advertising ecosystem. Such
markets give users control over which data get shared in the online advertising
exchange. We describe a model for the above foreseeable future form of online
advertising, and design two mechanisms for the exchange of this model: a
deterministic mechanism which is related to the vast literature on mechanism
design through trade reduction and allows players with a multi-dimensional
strategic space, and a randomized mechanism which can handle a more general
version of the model.
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2016 10:47:39 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Sep 2016 09:15:30 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Nov 2016 08:43:25 GMT'}, {'version': 'v4', 'created': 'Mon, 14 Nov 2016 08:17:42 GMT'}]",2016-11-15,"[['Feldman', 'Moran', ''], ['Gonen', 'Rica', '']]","['Mechanism design', 'double-sided market', 'multi-dimensional players', 'online advertising market']"
14857,1708.00672,Nicola Strisciuglio,"Alessia Saggese, Nicola Strisciuglio, Mario Vento and Nicolai Petkov",Action recognition by learning pose representations,Accepted at REACTS workshop (CAIP conference 2017),,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pose detection is one of the fundamental steps for the recognition of human
actions. In this paper we propose a novel trainable detector for recognizing
human poses based on the analysis of the skeleton. The main idea is that a
skeleton pose can be described by the spatial arrangements of its joints.
Starting from this consideration, we propose a trainable pose detector, that
can be configured on a prototype skeleton in an automatic configuration
process. The result of the configuration is a model of the position of the
joints in the concerned skeleton. In the application phase, the joint positions
contained in the model are compared with the ones of their homologous joints in
the skeleton under test. The similarity of two skeletons is computed as a
combination of the position scores achieved by homologous joints. In this paper
we describe an action classification method based on the use of the proposed
trainable detectors to extract features from the skeletons. We performed
experiments on the publicly available MSDRA data set and the achieved results
confirm the effectiveness of the proposed approach.
","[{'version': 'v1', 'created': 'Wed, 2 Aug 2017 09:46:02 GMT'}]",2017-08-03,"[['Saggese', 'Alessia', ''], ['Strisciuglio', 'Nicola', ''], ['Vento', 'Mario', ''], ['Petkov', 'Nicolai', '']]","['human action recognition', 'representation learning', 'skeleton analysis', 'trainable pose detector']"
14858,1305.1293,Xiang Ying Xiang Ying,"Xiang Ying, Shi-Qing Xin, Ying He",Parallel Chen-Han (PCH) Algorithm for Discrete Geodesics,"10 pages, accepted to ACM Transactions on Graphics with major
  revision",,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many graphics applications, the computation of exact geodesic distance is
very important. However, the high computational cost of the existing geodesic
algorithms means that they are not practical for large-scale models or
time-critical applications. To tackle this challenge, we propose the parallel
Chen-Han (or PCH) algorithm, which extends the classic Chen-Han (CH) discrete
geodesic algorithm to the parallel setting. The original CH algorithm and its
variant both lack a parallel solution because the windows (a key data structure
that carries the shortest distance in the wavefront propagation) are maintained
in a strict order or a tightly coupled manner, which means that only one window
is processed at a time. We propose dividing the CH's sequential algorithm into
four phases, window selection, window propagation, data organization, and
events processing so that there is no data dependence or conflicts in each
phase and the operations within each phase can be carried out in parallel. The
proposed PCH algorithm is able to propagate a large number of windows
simultaneously and independently. We also adopt a simple yet effective strategy
to control the total number of windows. We implement the PCH algorithm on
modern GPUs (such as Nvidia GTX 580) and analyze the performance in detail. The
performance improvement (compared to the sequential algorithms) is highly
consistent with GPU double-precision performance (GFLOPS). Extensive
experiments on real-world models demonstrate an order of magnitude improvement
in execution time compared to the state-of-the-art.
","[{'version': 'v1', 'created': 'Tue, 7 May 2013 14:09:16 GMT'}]",2013-05-08,"[['Ying', 'Xiang', ''], ['Xin', 'Shi-Qing', ''], ['He', 'Ying', '']]","['Discrete geodesic', 'parallel computation', 'windowpropagation', 'GPU']"
14859,1401.4644,Cyril Voyant,"Cyril Voyant (SPE), Pierrick Haurant (CETHIL), Marc Muselli (SPE),
  Christophe Paoli (SPE), Marie Laure Nivet (SPE)","Time series modeling and large scale global solar radiation forecasting
  from geostationary satellites data",Solar Energy (2014),,,,cs.CE physics.comp-ph stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When a territory is poorly instrumented, geostationary satellites data can be
useful to predict global solar radiation. In this paper, we use geostationary
satellites data to generate 2-D time series of solar radiation for the next
hour. The results presented in this paper relate to a particular territory, the
Corsica Island, but as data used are available for the entire surface of the
globe, our method can be easily exploited to another place. Indeed 2-D hourly
time series are extracted from the HelioClim-3 surface solar irradiation
database treated by the Heliosat-2 model. Each point of the map have been used
as training data and inputs of artificial neural networks (ANN) and as inputs
for two persistence models (scaled or not). Comparisons between these models
and clear sky estimations were proceeded to evaluate the performances. We found
a normalized root mean square error (nRMSE) close to 16.5% for the two best
predictors (scaled persistence and ANN) equivalent to 35-45% related to ground
measurements. Finally in order to validate our 2-D predictions maps, we
introduce a new error metric called the gamma index which is a criterion for
comparing data from two matrixes in medical physics. As first results, we found
that in winter and spring, scaled persistence gives the best results (gamma
index test passing rate is respectively 67.7% and 86%), in autumn simple
persistence is the best predictor (95.3%) and ANN is the best in summer
(99.8%).
","[{'version': 'v1', 'created': 'Sun, 19 Jan 2014 08:02:29 GMT'}]",2014-01-21,"[['Voyant', 'Cyril', '', 'SPE'], ['Haurant', 'Pierrick', '', 'CETHIL'], ['Muselli', 'Marc', '', 'SPE'], ['Paoli', 'Christophe', '', 'SPE'], ['Nivet', 'Marie Laure', '', 'SPE']]","['Time series', 'Artificial neural networks', 'Irradiance', 'Prediction', 'Gamma index']"
14860,1306.3032,Kazutaka Kurihara,"Kazutaka Kurihara, Masakazu Takasu, Kazuhiro Sasao, Hal Seki, Takayuki
  Narabu, Mitsuo Yamamoto, Satoshi Iida, Hiroyuki Yamamoto","A Face-like Structure Detection on Planet and Satellite Surfaces using
  Image Processing",4 pages,"ACE 2013, LNCS 8253, Springer, pp. 564-567, 2013",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper demonstrates that face-like structures are everywhere, and can be
de-tected automatically even with computers. Huge amount of satellite images of
the Earth, the Moon, the Mars are explored and many interesting face-like
structure are detected. Throughout this fact, we believe that science and
technologies can alert people not to easily become an occultist.
","[{'version': 'v1', 'created': 'Thu, 13 Jun 2013 06:28:07 GMT'}]",2013-11-20,"[['Kurihara', 'Kazutaka', ''], ['Takasu', 'Masakazu', ''], ['Sasao', 'Kazuhiro', ''], ['Seki', 'Hal', ''], ['Narabu', 'Takayuki', ''], ['Yamamoto', 'Mitsuo', ''], ['Iida', 'Satoshi', ''], ['Yamamoto', 'Hiroyuki', '']]","['Face detection', 'google map', 'NASA']"
14861,1009.5538,John Iacono,"Amr Elmasry, Arash Farzan, John Iacono",Priority Queues with Multiple Time Fingers,"14 pages, 4 figures",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A priority queue is presented that supports the operations insert and
find-min in worst-case constant time, and delete and delete-min on element x in
worst-case O(lg(min{w_x, q_x}+2)) time, where w_x (respectively q_x) is the
number of elements inserted after x (respectively before x) and are still
present at the time of the deletion of x. Our priority queue then has both the
working-set and the queueish properties, and more strongly it satisfies these
properties in the worst-case sense. We also define a new distribution-sensitive
property---the time-finger property, which encapsulates and generalizes both
the working-set and queueish properties, and present a priority queue that
satisfies this property.
  In addition, we prove a strong implication that the working-set property is
equivalent to the unified bound (which is the minimum per operation among the
static finger, static optimality, and the working-set bounds). This latter
result is of tremendous interest by itself as it had gone unnoticed since the
introduction of such bounds by Sleater and Tarjan [JACM 1985]. Accordingly, our
priority queue satisfies other distribution-sensitive properties as the static
finger, static optimality, and the unified bound.
","[{'version': 'v1', 'created': 'Tue, 28 Sep 2010 11:48:57 GMT'}]",2010-09-29,"[['Elmasry', 'Amr', ''], ['Farzan', 'Arash', ''], ['Iacono', 'John', '']]","['Data structures', 'splay trees', 'priority queues']"
14862,0908.0126,R Doomun,"Alexei Barbosa de Aguiar, Alvaro de M. S. Neto, Placido Rogerio
  Pinheiro, Andre L. V. Coelho","Applicability of a Novel Integer Programming Model for Wireless Sensor
  Networks","7 pages, International Journal of Computer Science and Information
  Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423","International Journal of Computer Science and Information
  Security, IJCSIS July 2009, Vol. 3 No. 1, USA",,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an applicability analysis over a novel integer
programming model devoted to optimize power consumption efficiency in
heterogeneous wireless sensor networks. This model is based upon a schedule of
sensor allocation plans in multiple time intervals subject to coverage and
connectivity constraints. By turning off a specific set of redundant sensors in
each time interval, it is possible to reduce the total energy consumption in
the network and, at the same time, avoid partitioning the whole network by
losing some strategic sensors too prematurely. Since the network is
heterogeneous, sensors can sense different phenomena from different demand
points, with different sample rates. As the problem instances grows the time
spent to the execution turns impracticable.
","[{'version': 'v1', 'created': 'Sun, 2 Aug 2009 11:57:15 GMT'}]",2009-08-04,"[['de Aguiar', 'Alexei Barbosa', ''], ['Neto', 'Alvaro de M. S.', ''], ['Pinheiro', 'Placido Rogerio', ''], ['Coelho', 'Andre L. V.', '']]","['Integer Linear Programming', 'Wireless Sensor Network', 'Consumption Optimization']"
14863,1510.07566,Simone Formentin,"Simone Formentin, Jacopo Guanetti, Sergio M. Savaresi",Least costly energy management for series hybrid electric vehicles,,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Energy management of plug-in Hybrid Electric Vehicles (HEVs) has different
challenges from non-plug-in HEVs, due to bigger batteries and grid recharging.
Instead of tackling it to pursue energetic efficiency, an approach minimizing
the driving cost incurred by the user - the combined costs of fuel, grid energy
and battery degradation - is here proposed. A real-time approximation of the
resulting optimal policy is then provided, as well as some analytic insight
into its dependence on the system parameters. The advantages of the proposed
formulation and the effectiveness of the real-time strategy are shown by means
of a thorough simulation campaign.
","[{'version': 'v1', 'created': 'Mon, 26 Oct 2015 17:52:59 GMT'}]",2015-10-27,"[['Formentin', 'Simone', ''], ['Guanetti', 'Jacopo', ''], ['Savaresi', 'Sergio M.', '']]","['Series HEV', 'EREV', 'Energy management', 'Dynamic Programming', 'Pontryagin Minimum Principle', 'Optimal control']"
14864,1408.0521,Vijay Gadepally,Vijay Gadepally and Ashok Krishnamurthy and Umit Ozguner,"A Hands-on Education Program on Cyber Physical Systems for High School
  Students",,,,,cs.CY cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cyber Physical Systems (CPS) are the conjoining of an entities' physical and
computational elements. The development of a typical CPS system follows a
sequence from conceptual modeling, testing in simulated (virtual) worlds,
testing in controlled (possibly laboratory) environments and finally
deployment. Throughout each (repeatable) stage, the behavior of the physical
entities, the sensing and situation assessment, and the computation and control
options have to be understood and carefully represented through abstraction.
  The CPS Group at the Ohio State University, as part of an NSF funded CPS
project on ""Autonomous Driving in Mixed Environments"", has been developing CPS
related educational activities at the K-12, undergraduate and graduate levels.
The aim of these educational activities is to train students in the principles
and design issues in CPS and to broaden the participation in science and
engineering. The project team has a strong commitment to impact STEM education
across the entire K-20 community.
  In this paper, we focus on the K-12 community and present a two-week Summer
Program for high school juniors and seniors that introduces them to the
principles of CPS design and walks them through several of the design steps. We
also provide an online repository that aids CPS researchers in providing a
similar educational experience.
","[{'version': 'v1', 'created': 'Sun, 3 Aug 2014 18:05:41 GMT'}]",2014-08-05,"[['Gadepally', 'Vijay', ''], ['Krishnamurthy', 'Ashok', ''], ['Ozguner', 'Umit', '']]","['Education', 'Supercomputing', 'Human Factors', 'Cyber Physical Systems']"
14865,0710.5895,Wim Vanhoof,"Francois Gobert, Baudouin Le Charlier","Source-to-source optimizing transformations of Prolog programs based on
  abstract interpretation","Paper presented at the 17th Workshop on Logic-based Methods in
  Programming Environments (WLPE2007)",,,,cs.PL cs.LO cs.SE,,"  Making a Prolog program more efficient by transforming its source code,
without changing its operational semantics, is not an obvious task. It requires
the user to have a clear understanding of how the Prolog compiler works, and in
particular, of the effects of impure features like the cut. The way a Prolog
code is written - e.g., the order of clauses, the order of literals in a
clause, the use of cuts or negations - influences its efficiency. Furthermore,
different optimization techniques may be redundant or conflicting when they are
applied together, depending on the way a procedure is called - e.g., inserting
cuts and enabling indexing. We present an optimiser, based on abstract
interpretation, that automatically performs safe code transformations of Prolog
procedures in the context of some class of input calls. The method is more
effective if procedures are annotated with additional information about modes,
types, sharing, number of solutions and the like. Thus the approach is similar
to Mercury. It applies to any Prolog program, however.
","[{'version': 'v1', 'created': 'Wed, 31 Oct 2007 15:59:50 GMT'}]",2007-11-01,"[['Gobert', 'Francois', ''], ['Charlier', 'Baudouin Le', '']]","['Abstract interpretation', 'automated optimisation', 'cut insertion', 'logic programs', 'Prolog', 'source-to-source program transformation', 'static analysis']"
14866,2007.05286,Kieran Woodward Mr,"Kieran Woodward, Eiman Kanjo, David J Brown and Becky Inkster","TangToys: Smart Toys that can Communicate and Improve Children's
  Wellbeing",,,,,cs.HC,http://creativecommons.org/licenses/by/4.0/,"  Children can find it challenging to communicate their emotions especially
when experiencing mental health challenges. Technological solutions may help
children communicate digitally and receive support from one another as advances
in networking and sensors enable the real-time transmission of physical
interactions. In this work, we pursue the design of multiple tangible user
interfaces designed for children containing multiple sensors and feedback
actuators. Bluetooth is used to provide communication between Tangible Toys
(TangToys) enabling peer to peer support groups to be developed and allowing
feedback to be issued whenever other children are nearby. TangToys can provide
a non-intrusive means for children to communicate their wellbeing through play.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 10:13:34 GMT'}]",2020-07-13,"[['Woodward', 'Kieran', ''], ['Kanjo', 'Eiman', ''], ['Brown', 'David J', ''], ['Inkster', 'Becky', '']]","['Tangible User Interfaces', 'Children', 'Communication', 'Mental Wellbeing', 'Emotion', 'Sensors']"
14867,1312.6954,Michal Brzezinski,Michal Brzezinski,Empirical modeling of the impact factor distribution,"14 pages, 1 figure",,,,cs.DL physics.soc-ph stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The distribution of impact factors has been modeled in the recent informetric
literature using two-exponent law proposed by Mansilla et al. (2007). This
paper shows that two distributions widely-used in economics, namely the Dagum
and Singh-Maddala models, possess several advantages over the two-exponent
model. Compared to the latter, the former give as good as or slightly better
fit to data on impact factors in eight important scientific fields. In contrast
to the two-exponent model, both proposed distributions have closed-from
probability density functions and cumulative distribution functions, which
facilitates fitting these distributions to data and deriving their statistical
properties.
","[{'version': 'v1', 'created': 'Wed, 25 Dec 2013 11:06:47 GMT'}]",2013-12-30,"[['Brzezinski', 'Michal', '']]","['impact factor', 'two-exponent law', 'Dagum model', 'Singh-Maddala model', 'maximum likelihood estimation', 'model selection']"
14868,1209.1563,Nilanjan  Dey,"Sayantan Mukhopadhyay, Shouvik Biswas, Anamitra Bardhan Roy, Nilanjan
  Dey",Wavelet Based QRS Complex Detection of ECG Signal,"5 pages, 8 figures, ISSN: 2248-9622","Journal of Engineering Research and Applications (IJERA) Vol. 2,
  Issue 3, 2012, pp.2361-2365",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Electrocardiogram (ECG) is a sensitive diagnostic tool that is used to
detect various cardiovascular diseases by measuring and recording the
electrical activity of the heart in exquisite detail. A wide range of heart
condition is determined by thorough examination of the features of the ECG
report. Automatic extraction of time plane features is important for
identification of vital cardiac diseases. This paper presents a
multi-resolution wavelet transform based system for detection 'P', 'Q', 'R',
'S', 'T' peaks complex from original ECG signal. 'R-R' time lapse is an
important minutia of the ECG signal that corresponds to the heartbeat of the
concerned person. Abrupt increase in height of the 'R' wave or changes in the
measurement of the 'R-R' denote various anomalies of human heart. Similarly
'P-P', 'Q-Q', 'S-S', 'T-T' also corresponds to different anomalies of heart and
their peak amplitude also envisages other cardiac diseases. In this proposed
method the 'PQRST' peaks are marked and stored over the entire signal and the
time interval between two consecutive 'R' peaks and other peaks interval are
measured to detect anomalies in behavior of heart, if any. The peaks are
achieved by the composition of Daubeheissub bands wavelet of original ECG
signal. The accuracy of the 'PQRST' complex detection and interval measurement
is achieved up to 100% with high exactitude by processing and thresholding the
original ECG signal.
","[{'version': 'v1', 'created': 'Fri, 7 Sep 2012 15:05:57 GMT'}]",2012-09-10,"[['Mukhopadhyay', 'Sayantan', ''], ['Biswas', 'Shouvik', ''], ['Roy', 'Anamitra Bardhan', ''], ['Dey', 'Nilanjan', '']]","['ECG', 'QRS Complex', 'Daubechies']"
14869,1111.2918,John Augustine,"John Augustine and Sandip Das and Anil Maheshwari and Subhas C. Nandy
  and Sasanka Roy and Swami Sarvattomananda",Localized Geometric Query Problems,,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new class of geometric query problems are studied in this paper. We are
required to preprocess a set of geometric objects $P$ in the plane, so that for
any arbitrary query point $q$, the largest circle that contains $q$ but does
not contain any member of $P$, can be reported efficiently. The geometric sets
that we consider are point sets and boundaries of simple polygons.
","[{'version': 'v1', 'created': 'Sat, 12 Nov 2011 11:28:47 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Sep 2012 03:26:32 GMT'}]",2015-03-19,"[['Augustine', 'John', ''], ['Das', 'Sandip', ''], ['Maheshwari', 'Anil', ''], ['Nandy', 'Subhas C.', ''], ['Roy', 'Sasanka', ''], ['Sarvattomananda', 'Swami', '']]","['Largest empty disk', 'query answering', 'medial axis', 'computational geometry']"
14870,1710.01965,Paolo Giulio Franciosa,"Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari and Andrea
  Ribichini",Max flow vitality in general and $st$-planar graphs,"12 pages, 3 figures",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The \emph{vitality} of an arc/node of a graph with respect to the maximum
flow between two fixed nodes $s$ and $t$ is defined as the reduction of the
maximum flow caused by the removal of that arc/node. In this paper we address
the issue of determining the vitality of arcs and/or nodes for the maximum flow
problem. We show how to compute the vitality of all arcs in a general
undirected graph by solving only $2(n-1)$ max flow instances and, In
$st$-planar graphs (directed or undirected) we show how to compute the vitality
of all arcs and all nodes in $O(n)$ worst-case time. Moreover, after
determining the vitality of arcs and/or nodes, and given a planar embedding of
the graph, we can determine the vitality of a `contiguous' set of arcs/nodes in
time proportional to the size of the set.
","[{'version': 'v1', 'created': 'Thu, 5 Oct 2017 11:12:33 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Nov 2017 21:08:13 GMT'}, {'version': 'v3', 'created': 'Tue, 17 Jul 2018 16:30:53 GMT'}, {'version': 'v4', 'created': 'Thu, 20 Dec 2018 15:20:17 GMT'}]",2018-12-21,"[['Ausiello', 'Giorgio', ''], ['Franciosa', 'Paolo Giulio', ''], ['Lari', 'Isabella', ''], ['Ribichini', 'Andrea', '']]","['maximum flow', 'minimum cut', 'vitality', 'general graphs', 'planar graphs', 'fault resiliency']"
14871,1702.01714,Daniele Falavigna,"Daniele Falavigna, Marco Matassoni, Shahab Jalalvand, Matteo Negri,
  Marco Turchi",DNN adaptation by automatic quality estimation of ASR hypotheses,Computer Speech & Language December 2016,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose to exploit the automatic Quality Estimation (QE) of
ASR hypotheses to perform the unsupervised adaptation of a deep neural network
modeling acoustic probabilities. Our hypothesis is that significant
improvements can be achieved by: i)automatically transcribing the evaluation
data we are currently trying to recognise, and ii) selecting from it a subset
of ""good quality"" instances based on the word error rate (WER) scores predicted
by a QE component. To validate this hypothesis, we run several experiments on
the evaluation data sets released for the CHiME-3 challenge. First, we operate
in oracle conditions in which manual transcriptions of the evaluation data are
available, thus allowing us to compute the ""true"" sentence WER. In this
scenario, we perform the adaptation with variable amounts of data, which are
characterised by different levels of quality. Then, we move to realistic
conditions in which the manual transcriptions of the evaluation data are not
available. In this case, the adaptation is performed on data selected according
to the WER scores ""predicted"" by a QE component. Our results indicate that: i)
QE predictions allow us to closely approximate the adaptation results obtained
in oracle conditions, and ii) the overall ASR performance based on the proposed
QE-driven adaptation method is significantly better than the strong, most
recent, CHiME-3 baseline.
","[{'version': 'v1', 'created': 'Mon, 6 Feb 2017 17:21:39 GMT'}]",2017-02-07,"[['Falavigna', 'Daniele', ''], ['Matassoni', 'Marco', ''], ['Jalalvand', 'Shahab', ''], ['Negri', 'Matteo', ''], ['Turchi', 'Marco', '']]","['Deep neural networks', 'DNN adaptation', 'ASR quality estimation']"
14872,1301.4155,Zhiyuan  Weng,Zhiyuan Weng and Petar Djuric,A Search-free DOA Estimation Algorithm for Coprime Arrays,final version,,,,cs.IT math.IT stat.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, coprime arrays have been in the focus of research because of their
potential in exploiting redundancy in spanning large apertures with fewer
elements than suggested by theory. A coprime array consists of two uniform
linear subarrays with inter-element spacings $M\lambda/2$ and $N\lambda/2$,
where $M$ and $N$ are coprime integers and $\lambda$ is the wavelength of the
signal. In this paper, we propose a fast search-free method for
direction-of-arrival (DOA) estimation with coprime arrays. It is based on the
use of methods that operate on the uniform linear subarrays of the coprime
array and that enjoy many processing advantages. We first estimate the DOAs for
each uniform linear subarray separately and then combine the estimates from the
subarrays. For combining the estimates, we propose a method that projects the
estimated point in the two-dimensional plane onto one-dimensional line segments
that correspond to the entire angular domain. By doing so, we avoid the search
step and consequently, we greatly reduce the computational complexity of the
method. We demonstrate the performance of the method with computer simulations
and compare it with that of the FD-root MUSIC method.
","[{'version': 'v1', 'created': 'Thu, 17 Jan 2013 16:41:13 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Mar 2014 01:38:10 GMT'}, {'version': 'v3', 'created': 'Sat, 13 Dec 2014 13:22:20 GMT'}]",2014-12-16,"[['Weng', 'Zhiyuan', ''], ['Djuric', 'Petar', '']]","['DOA estimation', 'coprime arrays', 'coprime sampling', 'uniformlinear array', 'search-free']"
14873,1708.01658,Christian Bailey,"Christian Bailey, Bharat Kale, Jamieson Walker, Harish Varma Siravuri,
  Hamed Alhoori, Micheal E. Papka",Exploring Features for Predicting Policy Citations,"2 pages, accepted to JCDL '17",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study we performed an initial investigation and evaluation of
altmetrics and their relationship with public policy citation of research
papers. We examined methods for using altmetrics and other data to predict
whether a research paper is cited in public policy and applied receiver
operating characteristic curve on various feature groups in order to evaluate
their potential usefulness. From the methods we tested, classifying based on
tweet count provided the best results, achieving an area under the ROC curve of
0.91.
","[{'version': 'v1', 'created': 'Thu, 15 Jun 2017 18:31:15 GMT'}]",2017-08-08,"[['Bailey', 'Christian', ''], ['Kale', 'Bharat', ''], ['Walker', 'Jamieson', ''], ['Siravuri', 'Harish Varma', ''], ['Alhoori', 'Hamed', ''], ['Papka', 'Micheal E.', '']]","['Altmetrics', 'Social Media', 'Public Policy']"
14874,1710.06064,Nalin Asanka Gamagedara Arachchilage,"Gaurav Misra, Nalin Asanka Gamagedara Arachchilage, Shlomo Berkovsky","Phish Phinder: A Game Design Approach to Enhance User Confidence in
  Mitigating Phishing Attacks",11,"International Symposium on Human Aspects of Information Security &
  Assurance (HAISA 2017)",,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Phishing is an especially challenging cyber security threat as it does not
attack computer systems, but targets the user who works on that system by
relying on the vulnerability of their decision-making ability. Phishing attacks
can be used to gather sensitive information from victims and can have
devastating impact if they are successful in deceiving the user. Several
anti-phishing tools have been designed and implemented but they have been
unable to solve the problem adequately. This failure is often due to security
experts overlooking the human element and ignoring their fallibility in making
trust decisions online. In this paper, we present Phish Phinder, a serious game
designed to enhance the user's confidence in mitigating phishing attacks by
providing them with both conceptual and procedural knowledge about phishing.
The user is trained through a series of gamified challenges, designed to
educate them about important phishing related concepts, through an interactive
user interface. Key elements of the game interface were identified through an
empirical study with the aim of enhancing user interaction with the game. We
also adopted several persuasive design principles while designing Phish Phinder
to enhance phishing avoidance behaviour among users.
","[{'version': 'v1', 'created': 'Tue, 17 Oct 2017 02:53:43 GMT'}]",2017-10-18,"[['Misra', 'Gaurav', ''], ['Arachchilage', 'Nalin Asanka Gamagedara', ''], ['Berkovsky', 'Shlomo', '']]","['Phishing', 'Human Aspects of Security', 'Serious Games for Security']"
14875,1412.6514,Majid Janzamin,Majid Janzamin and Hanie Sedghi and Anima Anandkumar,Score Function Features for Discriminative Learning,"Accepted as a workshop contribution at ICLR 2015. A longer version of
  this work is also available on arXiv: http://arxiv.org/abs/1412.2863",,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feature learning forms the cornerstone for tackling challenging learning
problems in domains such as speech, computer vision and natural language
processing. In this paper, we consider a novel class of matrix and
tensor-valued features, which can be pre-trained using unlabeled samples. We
present efficient algorithms for extracting discriminative information, given
these pre-trained features and labeled samples for any related task. Our class
of features are based on higher-order score functions, which capture local
variations in the probability density function of the input. We establish a
theoretical framework to characterize the nature of discriminative information
that can be extracted from score-function features, when used in conjunction
with labeled samples. We employ efficient spectral decomposition algorithms (on
matrices and tensors) for extracting discriminative components. The advantage
of employing tensor-valued features is that we can extract richer
discriminative information in the form of an overcomplete representations.
Thus, we present a novel framework for employing generative models of the input
for discriminative learning.
","[{'version': 'v1', 'created': 'Fri, 19 Dec 2014 20:18:36 GMT'}, {'version': 'v2', 'created': 'Sun, 19 Apr 2015 18:46:19 GMT'}]",2015-04-21,"[['Janzamin', 'Majid', ''], ['Sedghi', 'Hanie', ''], ['Anandkumar', 'Anima', '']]","['Feature learning', 'semi-supervised learning', 'self-taught learning', 'pre-training', 'scorefunction', 'spectral decomposition methods', 'tensor methods']"
14876,1007.0391,Tomoyuki Yamakami,Tomoyuki Yamakami,"Approximate Counting for Complex-Weighted Boolean Constraint
  Satisfaction Problems","A4, 10 point, 25 pages. This version significantly improves its
  conference version that appeared in the Proceedings of the 8th Workshop on
  Approximation and Online Algorithms (WAOA 2010), Lecture Notes in Computer
  Science, Springer-Verlag, Vol.6534, pp.261-272, 2011","(journal version) Information and Computation Vol.219, pp.17-38,
  2012",,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Constraint satisfaction problems (or CSPs) have been extensively studied in,
for instance, artificial intelligence, database theory, graph theory, and
statistical physics. From a practical viewpoint, it is beneficial to
approximately solve those CSPs. When one tries to approximate the total number
of truth assignments that satisfy all Boolean-valued constraints for
(unweighted) Boolean CSPs, there is a known trichotomy theorem by which all
such counting problems are neatly classified into exactly three categories
under polynomial-time (randomized) approximation-preserving reductions. In
contrast, we obtain a dichotomy theorem of approximate counting for
complex-weighted Boolean CSPs, provided that all complex-valued unary
constraints are freely available to use. It is the expressive power of free
unary constraints that enables us to prove such a stronger, complete
classification theorem. This discovery makes a step forward in the quest for
the approximation-complexity classification of all counting CSPs. To deal with
complex weights, we employ proof techniques of factorization and arity
reduction along the line of solving Holant problems. Moreover, we introduce a
novel notion of T-constructibility that naturally induces
approximation-preserving reducibility. Our result also gives an approximation
analogue of the dichotomy theorem on the complexity of exact counting for
complex-weighted Boolean CSPs.
","[{'version': 'v1', 'created': 'Fri, 2 Jul 2010 16:01:39 GMT'}, {'version': 'v2', 'created': 'Mon, 23 May 2011 10:10:37 GMT'}, {'version': 'v3', 'created': 'Fri, 16 Mar 2012 08:37:15 GMT'}, {'version': 'v4', 'created': 'Thu, 23 Aug 2012 16:33:03 GMT'}]",2012-10-17,"[['Yamakami', 'Tomoyuki', '']]","['constraint satisfaction problem', 'constraint', 'T-constructibility', 'Holant problem', 'signature', 'approximation-preserving reduction', 'dichotomy theorem']"
14877,1408.0553,Majid Janzamin,Animashree Anandkumar and Rong Ge and Majid Janzamin,"Sample Complexity Analysis for Learning Overcomplete Latent Variable
  Models through Tensor Methods",Title changed,,,,cs.LG math.PR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide guarantees for learning latent variable models emphasizing on the
overcomplete regime, where the dimensionality of the latent space can exceed
the observed dimensionality. In particular, we consider multiview mixtures,
spherical Gaussian mixtures, ICA, and sparse coding models. We provide tight
concentration bounds for empirical moments through novel covering arguments. We
analyze parameter recovery through a simple tensor power update algorithm. In
the semi-supervised setting, we exploit the label or prior information to get a
rough estimate of the model parameters, and then refine it using the tensor
method on unlabeled samples. We establish that learning is possible when the
number of components scales as $k=o(d^{p/2})$, where $d$ is the observed
dimension, and $p$ is the order of the observed moment employed in the tensor
method. Our concentration bound analysis also leads to minimax sample
complexity for semi-supervised learning of spherical Gaussian mixtures. In the
unsupervised setting, we use a simple initialization algorithm based on SVD of
the tensor slices, and provide guarantees under the stricter condition that
$k\le \beta d$ (where constant $\beta$ can be larger than $1$), where the
tensor method recovers the components under a polynomial running time (and
exponential in $\beta$). Our analysis establishes that a wide range of
overcomplete latent variable models can be learned efficiently with low
computational and sample complexity through tensor decomposition methods.
","[{'version': 'v1', 'created': 'Sun, 3 Aug 2014 23:21:33 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Dec 2014 22:21:23 GMT'}]",2014-12-18,"[['Anandkumar', 'Animashree', ''], ['Ge', 'Rong', ''], ['Janzamin', 'Majid', '']]","['Unsupervised and semi-supervised learning', 'latent variable models', 'overcompleterepresentation', 'tensor decomposition', 'sample complexity analysis']"
14878,1010.4088,Norihito Toyota,Norihito Toyota,"Generalized Clustering Coefficients and Milgram Condition for q-th
  Degrees of Separation","5 pages, 4 figures,Presented at 2010 SICE Annual Conference,
  Taipei,TAIWAN, August 18-21, 2010 August 18-21,2010",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a series of generalized clustering coefficients based on String
formalism given by Aoyama, using adjacent matrix in networks. We numerically
evaluate Milgram condition proposed in order to explore q-th degrees of
separation in scale free networks and small world networks. We find that scale
free network with exponent 3 just shows 6-degrees of separation. Moreover we
find some relations between separation numbers and generalized clustering
coefficient in both networks.
","[{'version': 'v1', 'created': 'Wed, 20 Oct 2010 02:40:16 GMT'}]",2010-10-21,"[['Toyota', 'Norihito', '']]","['scale free networks', 'small-world networks', 'generalized clustering coefficient', 'sixdegrees of separation']"
14879,1406.5495,Prof. Dr. Vladimir Rybakov Mr,Maybin Muyeba and Vladimir Rybakov,"Knowledge Representation in Agent's Logic with Uncertainty and Agent's
  Interaction",,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies knowledge representation in multi-agent environment. We
investigate technique for computation truth-values of statements based at a new
temporal, agent's-knowledge logic TL. A logical language, mathematical symbolic
models and a temporal logic TL based at these models are suggested. We find an
algorithm which computes theorems of TL and satisfiability of statements, this
implies that TL is decidable (i.e. -- the satisfiability problem for TL is
solvable). Application areas are pointed and discussed.
","[{'version': 'v1', 'created': 'Fri, 20 Jun 2014 19:42:17 GMT'}]",2014-06-23,"[['Muyeba', 'Maybin', ''], ['Rybakov', 'Vladimir', '']]","['computation of truth values', 'multi-agent logic', 'uncertainty', 'temporal logics', 'decision algorithms']"
14880,1407.5736,Saurabh Gupta,"Saurabh Gupta, Ross Girshick, Pablo Arbel\'aez, Jitendra Malik","Learning Rich Features from RGB-D Images for Object Detection and
  Segmentation","To appear in the European Conference on Computer Vision (ECCV), 2014",,,,cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we study the problem of object detection for RGB-D images using
semantically rich image and depth features. We propose a new geocentric
embedding for depth images that encodes height above ground and angle with
gravity for each pixel in addition to the horizontal disparity. We demonstrate
that this geocentric embedding works better than using raw depth images for
learning feature representations with convolutional neural networks. Our final
object detection system achieves an average precision of 37.3%, which is a 56%
relative improvement over existing methods. We then focus on the task of
instance segmentation where we label pixels belonging to object instances found
by our detector. For this task, we propose a decision forest approach that
classifies pixels in the detection window as foreground or background using a
family of unary and binary tests that query shape and geocentric pose features.
Finally, we use the output from our object detectors in an existing superpixel
classification framework for semantic scene segmentation and achieve a 24%
relative improvement over current state-of-the-art for the object categories
that we study. We believe advances such as those represented in this paper will
facilitate the use of perception in fields like robotics.
","[{'version': 'v1', 'created': 'Tue, 22 Jul 2014 05:31:32 GMT'}]",2014-07-23,"[['Gupta', 'Saurabh', ''], ['Girshick', 'Ross', ''], ['Arbeláez', 'Pablo', ''], ['Malik', 'Jitendra', '']]","['RGB-D perception', 'object detection', 'object segmentation']"
14881,1505.04103,Petr Vabishchevich N.,Petr N. Vabishchevich,"A splitting scheme to solve an equation for fractional powers of
  elliptic operators",18 pages,,,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An equation containing a fractional power of an elliptic operator of second
order is studied for Dirichlet boundary conditions. Finite difference
approximations in space are employed. The proposed numerical algorithm is based
on solving an auxiliary Cauchy problem for a pseudo-parabolic equation.
Unconditionally stable vector additive schemes (splitting schemes) are
constructed. Numerical results for a model problem in a rectangle calculated
using the splitting with respect to spatial variables are presented.
","[{'version': 'v1', 'created': 'Fri, 15 May 2015 15:59:16 GMT'}]",2015-05-18,"[['Vabishchevich', 'Petr N.', '']]","['elliptic operator equation', 'fractional power of an operator', 'two-levelschemes', 'splitting schemes', 'stability of difference schemes']"
14882,1504.08145,David Sousa-Rodrigues,"David Sousa-Rodrigues, Mafalda Teixeira de Sampayo, Eug\'enio
  Rodrigues, Ad\'elio Rodrigues Gaspar, \'Alvaro Gomes, Carlos Henggeler
  Antunes","Online survey for collective clustering of computer generated
  architectural floor plans","Extended abstract accepted for ICTPI'15 conference, June 17-19,
  Milton Keynes, United Kingdom - http://www.ictpi15.info/",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of this study is to understand what are the collective actions of
architecture practitioners when grouping floor plan designs. The understanding
of how professionals and students solve this complex problem may help to
develop specific programmes for the teaching of architecture. In addition, the
findings of this study can help in the development of query mechanisms for
database retrieval of floor plans and the implementation of clustering
mechanisms to aggregate floor plans resulting from generative design methods.
The study aims to capture how practitioners define similarity between floor
plans from a pool of available designs. A hybrid evolutionary strategy is used,
which takes into account the building's functional program to generate
alternative floor plan designs. The first step of this methodology consisted in
an online survey to gather information on how the respondents would perform a
clustering task. Online surveys have been used in several applications and are
a method of data collection that conveys several advantages. When properly
developed and implemented, a survey portrays the characteristics of large
groups of respondents on a specific topic and allows assessing its
representation. Several types of surveys are available; e.g. questionnaire and
interview formats, phone survey, and online surveys, which can be coupled with
inference engines that act and direct the survey according to respondents'
answers. In the present study, the survey was posed as an online exercise in
which respondents had to perform a pre-defined task, which makes it similar to
running an experiment in an online environment. The experiment aimed to
understand the perception and criteria of the target population to perform the
clustering task by comparing the results with the respondents' answers to a
questionnaire presented at the end of the exercise.
","[{'version': 'v1', 'created': 'Thu, 30 Apr 2015 09:44:38 GMT'}]",2015-05-01,"[['Sousa-Rodrigues', 'David', ''], ['de Sampayo', 'Mafalda Teixeira', ''], ['Rodrigues', 'Eugénio', ''], ['Gaspar', 'Adélio Rodrigues', ''], ['Gomes', 'Álvaro', ''], ['Antunes', 'Carlos Henggeler', '']]","['Online Survey', 'Generative Design', 'Clustering', 'Collective Intelligence', 'FloorPlan Design', 'Architecture', 'Education']"
14883,1410.4312,Yi Wen tan,Wentan Yi and Shaozhen Chen,Zero-Correlation Linear Cryptanalysis of Reduced-round MISTY1,arXiv admin note: substantial text overlap with arXiv:1404.6100,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The MISTY1 algorithm, proposed by Matsui in FSE 1997, is a block cipher with
a 64-bit block size and a 128-bit key size. It was recommended by the European
NESSIE project and the CRYPTREC project, and became one RFC in 2002 and an ISO
standard in 2005, respectively. In this paper, we first investigate the
properties of the FL linear function and identify 232 subkey- dependent
zero-correlation linear approximations over 5-round MISTY1 with 3 FL layers.
Fur- thermore, some observations on the FL, FO and FI functions are founded and
based upon those observations, we select 27 subkey-dependent zero-correlation
linear approximations and then, pro- pose the zero-correlation linear attacks
on 7-round MISTY1 with 4 FL layers. Besides, for the case without FL layers, 27
zero-correlation linear approximations over 5-round MISTY1 are employed to the
analysis of 7-round MISTY1. The zero-correlation linear attack on the 7-round
with 4 FL layers needs about 2^{119:5} encryptions with 2^{62.9} known
plaintexts and 2^61 memory bytes. For the attack on 7-round without FL layers,
the data complexity is about 2^{63.9} known plaintexts, the time complexity is
about 2^{81} encryptions and the memory requirements are about 2^{93} bytes.
Both have lower time complexity than previous attacks.
","[{'version': 'v1', 'created': 'Thu, 16 Oct 2014 06:50:14 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Oct 2014 04:55:44 GMT'}, {'version': 'v3', 'created': 'Fri, 10 Apr 2015 14:56:55 GMT'}]",2016-11-04,"[['Yi', 'Wentan', ''], ['Chen', 'Shaozhen', '']]","['MISTY1', 'Block cipher', 'Zero-correlation linear cryptanalysis', 'Cryptography']"
14884,1504.01456,Yuantao Gu,"Xiaohan Wang, Jiaxuan Chen, Yuantao Gu",Local Measurement and Reconstruction for Noisy Graph Signals,"24 pages, 6 figures, 2 tables, journal manuscript",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The emerging field of signal processing on graph plays a more and more
important role in processing signals and information related to networks.
Existing works have shown that under certain conditions a smooth graph signal
can be uniquely reconstructed from its decimation, i.e., data associated with a
subset of vertices. However, in some potential applications (e.g., sensor
networks with clustering structure), the obtained data may be a combination of
signals associated with several vertices, rather than the decimation. In this
paper, we propose a new concept of local measurement, which is a generalization
of decimation. Using the local measurements, a local-set-based method named
iterative local measurement reconstruction (ILMR) is proposed to reconstruct
bandlimited graph signals. It is proved that ILMR can reconstruct the original
signal perfectly under certain conditions. The performance of ILMR against
noise is theoretically analyzed. The optimal choice of local weights and a
greedy algorithm of local set partition are given in the sense of minimizing
the expected reconstruction error. Compared with decimation, the proposed local
measurement sampling and reconstruction scheme is more robust in noise existing
scenarios.
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2015 01:56:07 GMT'}]",2015-04-08,"[['Wang', 'Xiaohan', ''], ['Chen', 'Jiaxuan', ''], ['Gu', 'Yuantao', '']]","['Signal processing on graph', 'graph signal', 'sampling', 'local measurement', 'iterative reconstruction']"
14885,1512.02266,Manuele Leonelli,"Manuele Leonelli, Christiane G\""orgen and Jim Q. Smith","Sensitivity analysis, multilinearity and beyond",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sensitivity methods for the analysis of the outputs of discrete Bayesian
networks have been extensively studied and implemented in different software
packages. These methods usually focus on the study of sensitivity functions and
on the impact of a parameter change to the Chan-Darwiche distance. Although not
fully recognized, the majority of these results heavily rely on the multilinear
structure of atomic probabilities in terms of the conditional probability
parameters associated with this type of network. By defining a statistical
model through the polynomial expression of its associated defining conditional
probabilities, we develop a unifying approach to sensitivity methods applicable
to a large suite of models including extensions of Bayesian networks, for
instance context-specific and dynamic ones, and chain event graphs. By then
focusing on models whose defining polynomial is multilinear, our algebraic
approach enables us to prove that the Chan-Darwiche distance is minimized for a
certain class of multi-parameter contemporaneous variations when parameters are
proportionally covaried.
","[{'version': 'v1', 'created': 'Mon, 7 Dec 2015 22:24:31 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Jul 2016 15:39:27 GMT'}]",2016-07-05,"[['Leonelli', 'Manuele', ''], ['Görgen', 'Christiane', ''], ['Smith', 'Jim Q.', '']]","['Bayesian networks', 'CD distance', 'Interpolating Polynomial', 'Sensitivity']"
14886,1209.6189,Nicolaie Popescu-Bodorin,"Nicolaie Popescu-Bodorin, Valentina E. Balas, Iulia M. Motoc",The Biometric Menagerie - A Fuzzy and Inconsistent Concept,"5th Int. Conf. on Soft Computing and Applications (Szeged, HU), 22-24
  Aug 2012",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proves that in iris recognition, the concepts of sheep, goats,
lambs and wolves - as proposed by Doddington and Yager in the so-called
Biometric Menagerie, are at most fuzzy and at least not quite well defined.
They depend not only on the users or on their biometric templates, but also on
the parameters that calibrate the iris recognition system. This paper shows
that, in the case of iris recognition, the extensions of these concepts have
very unsharp and unstable (non-stationary) boundaries. The membership of a user
to these categories is more often expressed as a degree (as a fuzzy value)
rather than as a crisp value. Moreover, they are defined by fuzzy Sugeno rules
instead of classical (crisp) definitions. For these reasons, we said that the
Biometric Menagerie proposed by Doddington and Yager could be at most a fuzzy
concept of biometry, but even this status is conditioned by improving its
definition. All of these facts are confirmed experimentally in a series of 12
exhaustive iris recognition tests undertaken for University of Bath Iris Image
Database while using three different iris code dimensions (256x16, 128x8 and
64x4), two different iris texture encoders (Log-Gabor and Haar-Hilbert) and two
different types of safety models.
","[{'version': 'v1', 'created': 'Thu, 27 Sep 2012 11:24:28 GMT'}]",2012-09-28,"[['Popescu-Bodorin', 'Nicolaie', ''], ['Balas', 'Valentina E.', ''], ['Motoc', 'Iulia M.', '']]","['iris recognition', 'fuzzy', 'inconsistent', 'biometric']"
14887,1511.09394,Ekaterina Komendantskaya Dr,"Peng Fu and Ekaterina Komendantskaya and Tom Schrijvers and Andrew
  Pond",Proof Relevant Corecursive Resolution,"23 pages, with appendices in FLOPS 2016",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Resolution lies at the foundation of both logic programming and type class
context reduction in functional languages. Terminating derivations by
resolution have well-defined inductive meaning, whereas some non-terminating
derivations can be understood coinductively. Cycle detection is a popular
method to capture a small subset of such derivations. We show that in fact
cycle detection is a restricted form of coinductive proof, in which the atomic
formula forming the cycle plays the role of coinductive hypothesis.
  This paper introduces a heuristic method for obtaining richer coinductive
hypotheses in the form of Horn formulas. Our approach subsumes cycle detection
and gives coinductive meaning to a larger class of derivations. For this
purpose we extend resolution with Horn formula resolvents and corecursive
evidence generation. We illustrate our method on non-terminating type class
resolution problems.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2015 17:17:27 GMT'}]",2015-12-01,"[['Fu', 'Peng', ''], ['Komendantskaya', 'Ekaterina', ''], ['Schrijvers', 'Tom', ''], ['Pond', 'Andrew', '']]","['Horn Clause Logic', 'Resolution', 'Corecursion', 'Haskell TypeClass Inference', 'Coinductive Proofs']"
14888,1401.2184,Alexandre Gondran,"Laurent Moalic (IRTES - SET), Alexandre Gondran (MAIAA)",Variations on Memetic Algorithms for Graph Coloring Problems,"11 pages, 8 figures, 3 tables, 2 algorithms",,,,cs.AI cs.NE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph vertex coloring with a given number of colors is a well-known and
much-studied NP-complete problem.The most effective methods to solve this
problem are proved to be hybrid algorithms such as memetic algorithms or
quantum annealing. Those hybrid algorithms use a powerful local search inside a
population-based algorithm.This paper presents a new memetic algorithm based on
one of the most effective algorithms: the Hybrid Evolutionary Algorithm HEA
from Galinier and Hao (1999).The proposed algorithm, denoted HEAD - for HEA in
Duet - works with a population of only two individuals.Moreover, a new way of
managing diversity is brought by HEAD.These two main differences greatly
improve the results, both in terms of solution quality and computational
time.HEAD has produced several good results for the popular DIMACS benchmark
graphs, such as 222-colorings for \textless{}dsjc1000.9\textgreater{},
81-colorings for \textless{}flat1000\_76\_0\textgreater{} and even 47-colorings
for \textless{}dsjc500.5\textgreater{} and 82-colorings for
\textless{}dsjc1000.5\textgreater{}.
","[{'version': 'v1', 'created': 'Wed, 8 Jan 2014 19:50:07 GMT'}, {'version': 'v2', 'created': 'Sat, 17 Dec 2016 14:10:44 GMT'}]",2016-12-20,"[['Moalic', 'Laurent', '', 'IRTES - SET'], ['Gondran', 'Alexandre', '', 'MAIAA']]","['Combinatorial optimization', 'Metaheuristics', 'Coloring', 'Graph', 'Evolutionary']"
14889,1606.02900,Neha Karanjkar,Neha Karanjkar and Madhav P. Desai and Shalabh Bhatnagar,On Continuous-space Embedding of Discrete-parameter Queueing Systems,Submitted to a journal and is under review,,,,cs.PF math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by the problem of discrete-parameter simulation optimization (DPSO)
of queueing systems, we consider the problem of embedding the discrete
parameter space into a continuous one so that descent-based continuous-space
methods could be directly applied for efficient optimization. We show that a
randomization of the simulation model itself can be used to achieve such an
embedding when the objective function is a long-run average measure. Unlike
spatial interpolation, the computational cost of this embedding is independent
of the number of parameters in the system, making the approach ideally suited
to high-dimensional problems. We describe in detail the application of this
technique to discrete-time queues for embedding queue capacities, number of
servers and server-delay parameters into continuous space and empirically show
that the technique can produce smooth interpolations of the objective function.
Through an optimization case-study of a queueing network with $10^7$ design
points, we demonstrate that existing continuous optimizers can be effectively
applied over such an embedding to find good solutions.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2016 10:45:45 GMT'}, {'version': 'v2', 'created': 'Sun, 8 Jan 2017 06:43:23 GMT'}, {'version': 'v3', 'created': 'Mon, 12 Feb 2018 06:55:22 GMT'}]",2018-02-14,"[['Karanjkar', 'Neha', ''], ['Desai', 'Madhav P.', ''], ['Bhatnagar', 'Shalabh', '']]","['Queueing Systems', 'Discrete Parameter Simulation Optimization', 'Interpolation']"
14890,1412.6605,Reza Rawassizadeh,"Stefan Foell, Gerd Kortuem, Reza Rawassizadeh, Marcus Handte, Umer
  Iqbal, Pedro Marron","Micro-Navigation for Urban Bus Passengers: Using the Internet of Things
  to Improve the Public Transport Experience",Urb-IoT 2014,,,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Public bus services are widely deployed in cities around the world because
they provide cost-effective and economic public transportation. However, from a
passenger point of view urban bus systems can be complex and difficult to
navigate, especially for disadvantaged users, i.e. tourists, novice users,
older people, and people with impaired cognitive or physical abilities. We
present Urban Bus Navigator (UBN), a reality-aware urban navigation system for
bus passengers with the ability to recognize and track the physical public
transport infrastructure such as buses. Unlike traditional location-aware
mobile transport applications, UBN acts as a true navigation assistant for
public transport users. Insights from a six-month long trial in Madrid indicate
that UBN removes barriers for public transport usage and has a positive impact
on how people feel about public transport journeys.
","[{'version': 'v1', 'created': 'Sat, 20 Dec 2014 05:10:20 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Feb 2015 04:19:28 GMT'}]",2015-02-17,"[['Foell', 'Stefan', ''], ['Kortuem', 'Gerd', ''], ['Rawassizadeh', 'Reza', ''], ['Handte', 'Marcus', ''], ['Iqbal', 'Umer', ''], ['Marron', 'Pedro', '']]","['Bus navigation', 'public transport', 'smartphone application']"
14891,1409.7771,Chinmoy Dutta,"Chinmoy Dutta and Gopal Pandurangan and Rajmohan Rajaraman and Zhifeng
  Sun and Emanuele Viola",Global Information Sharing under Network Dynamics,arXiv admin note: substantial text overlap with arXiv:1112.0384,,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study how to spread $k$ tokens of information to every node on an $n$-node
dynamic network, the edges of which are changing at each round. This basic {\em
gossip problem} can be completed in $O(n + k)$ rounds in any static network,
and determining its complexity in dynamic networks is central to understanding
the algorithmic limits and capabilities of various dynamic network models. Our
focus is on token-forwarding algorithms, which do not manipulate tokens in any
way other than storing, copying and forwarding them.
  We first consider the {\em strongly adaptive} adversary model where in each
round, each node first chooses a token to broadcast to all its neighbors
(without knowing who they are), and then an adversary chooses an arbitrary
connected communication network for that round with the knowledge of the tokens
chosen by each node. We show that $\Omega(nk/\log n + n)$ rounds are needed for
any randomized (centralized or distributed) token-forwarding algorithm to
disseminate the $k$ tokens, thus resolving an open problem raised
in~\cite{kuhn+lo:dynamic}. The bound applies to a wide class of initial token
distributions, including those in which each token is held by exactly one node
and {\em well-mixed} ones in which each node has each token independently with
a constant probability.
  We also show several upper bounds in varying models.
","[{'version': 'v1', 'created': 'Sat, 27 Sep 2014 06:36:19 GMT'}]",2014-09-30,"[['Dutta', 'Chinmoy', ''], ['Pandurangan', 'Gopal', ''], ['Rajaraman', 'Rajmohan', ''], ['Sun', 'Zhifeng', ''], ['Viola', 'Emanuele', '']]","['Dynamic networks', 'Information Spreading', 'Gossip', 'Distributed Computation', 'Communication Complexity']"
14892,1203.1995,Xuequn Wang,Xuequn Wang and Yanjun Yu,Classify Participants in Online Communities,"13 pages, 2 tables, 2 figures","International Journal of Managing Information Technology (IJMIT)
  Vol.4, No.1, February 2012",,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As online communities become increasingly popular, researchers have tried to
examine participating activities in online communities as well as how to
sustain online communities. However, relatively few studies have tried to
understand what kinds of participants constitute online communities. In this
study, we try to contribute online community research by developing ""common
language"" to classify different participants in online communities.
Specifically, we argue that the previous way to classify participants is not
sufficient and accurate, and we propose a continuum to classify participants
based on participants' overall trend of posting activities. In order to further
online community research, we also propose potential directions for future
studies.
","[{'version': 'v1', 'created': 'Fri, 9 Mar 2012 05:14:20 GMT'}]",2012-03-12,"[['Wang', 'Xuequn', ''], ['Yu', 'Yanjun', '']]","['Online communities', 'Contributors', 'Lurkers', 'Content contribution']"
14893,1110.3158,Jerome Darmont,"Rashed Salem (ERIC), J\'er\^ome Darmont (ERIC), Omar Boussa\""id (ERIC)",Efficient Incremental Breadth-Depth XML Event Mining,,"15th International Database Engineering and Applications Symposium
  (IDEAS 2011), Lisbon : Portugal (2011)",,ERIC:11-013,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many applications log a large amount of events continuously. Extracting
interesting knowledge from logged events is an emerging active research area in
data mining. In this context, we propose an approach for mining frequent events
and association rules from logged events in XML format. This approach is
composed of two-main phases: I) constructing a novel tree structure called
Frequency XML-based Tree (FXT), which contains the frequency of events to be
mined; II) querying the constructed FXT using XQuery to discover frequent
itemsets and association rules. The FXT is constructed with a single-pass over
logged data. We implement the proposed algorithm and study various performance
issues. The performance study shows that the algorithm is efficient, for both
constructing the FXT and discovering association rules.
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2011 09:25:52 GMT'}]",2011-10-17,"[['Salem', 'Rashed', '', 'ERIC'], ['Darmont', 'Jérôme', '', 'ERIC'], ['Boussaïd', 'Omar', '', 'ERIC']]","['Mining logged events', 'XML mining', 'frequentitemsets', 'association rules']"
14894,1207.4966,Ahmad Khan Mr,"Ahmad Raza Khan, Rquaiya Khan, Trimbak R Sontakke, Shraddha R Khonde,
  Revati Wahul, Mahtab alam","Service Oriented Architecture A Revolution For Comprehensive Web Based
  Project Management Software","7 Pages, 4 figures",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Service Oriented Architecture A Revolution for Project Management Software
has changed the way projects today are moving on the fly with the help of web
services booming the industry. Service oriented architecture improves
performance and the communication between the distributed and remote teams. Web
Services to Provide Project Management software the visibility and control of
the application development lifecycle-giving a better control over the entire
development process, from the management stage through development. The goal of
Service Oriented Architecture for Project Management Software is to produce a
product that is delivered on time, within the allocated budget, and with the
capabilities expected by the customer. Web Services in Project management
Project management software is basically a properly managed project and has a
clear, communicated, and managed set of goals and objectives, whose progress is
quantifiable and controlled. Resources are used effectively and efficiently to
produce the desired product. With the help of service oriented architecture we
can move into the future without abandoning the past. A project usually has a
communicated set of processes that cover the daily activities of the project,
forming the project framework. As a result, every team member understands their
roles, responsibilities and how they fit into the big picture thus promoting
the efficient use of resources.
","[{'version': 'v1', 'created': 'Fri, 20 Jul 2012 14:43:29 GMT'}]",2012-07-23,"[['Khan', 'Ahmad Raza', ''], ['Khan', 'Rquaiya', ''], ['Sontakke', 'Trimbak R', ''], ['Khonde', 'Shraddha R', ''], ['Wahul', 'Revati', ''], ['alam', 'Mahtab', '']]","['Service Oriented Architecture', 'Project Management', 'Software engineering', 'software development life cycle', 'web services']"
14895,1406.6998,Rodrigo de Lamare,"Q. Boya, Y. Cai, B. Champagne, R. C. de Lamare and M. Zhao","Low-Complexity Variable Forgetting Factor Constrained Constant Modulus
  RLS Algorithm for Adaptive Beamforming","10 pages, 4 figures, Elsevier Signal Processing, 2014",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a recursive least squares (RLS) based blind adaptive
beamforming algorithm that features a new variable forgetting factor (VFF)
mechanism is presented. The beamformer is designed according to the constrained
constant modulus (CCM) criterion, and the proposed adaptive algorithm operates
in the generalized sidelobe canceler (GSC) structure. A detailed study of its
operating properties is carried out, including a convexity analysis and a mean
squared error (MSE) analysis of its steady-state behavior. The results of
numerical experiments demonstrate that the proposed VFF mechanism achieves a
superior learning and tracking performance compared to other VFF mechanisms.
","[{'version': 'v1', 'created': 'Sun, 22 Jun 2014 15:37:21 GMT'}]",2014-06-27,"[['Boya', 'Q.', ''], ['Cai', 'Y.', ''], ['Champagne', 'B.', ''], ['de Lamare', 'R. C.', ''], ['Zhao', 'M.', '']]","['Adaptive beamforming', 'constrained constant modulus', 'recursive']"
14896,1710.01127,Alex Olieman,"Alex Olieman, Kaspar Beelen, and Jaap Kamps",Finding Talk About the Past in the Discourse of Non-Historians,Presented at Drift-a-LOD 2017,,,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A heightened interest in the presence of the past has given rise to the new
field of memory studies, but there is a lack of search and research tools to
support studying how and why the past is evoked in diachronic discourses.
Searching for temporal references is not straightforward. It entails bridging
the gap between conceptually-based information needs on one side, and
term-based inverted indexes on the other.
  Our approach enables the search for references to (intersubjective)
historical periods in diachronic corpora. It consists of a
semantically-enhanced search engine that is able to find references to many
entities at a time, which is combined with a novel interface that invites its
user to actively sculpt the search result set. Until now we have been concerned
mostly with user-friendly retrieval and selection of sources, but our tool can
also contribute to existing efforts to create reusable linked data from and for
research in the humanities.
","[{'version': 'v1', 'created': 'Tue, 3 Oct 2017 13:11:44 GMT'}]",2017-10-04,"[['Olieman', 'Alex', ''], ['Beelen', 'Kaspar', ''], ['Kamps', 'Jaap', '']]","['Colligatory Concepts', 'Semantically-Enhanced Search', 'Interactive Information Retrieval', 'Corpus Selection', 'Digital Humanities']"
14897,1611.00252,Wenjun Zhang,"Rory P. Bunker, Wenjun Zhang, M. Asif Naeem","Improving a Credit Scoring Model by Incorporating Bank Statement Derived
  Features",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate the extent to which features derived from bank
statements provided by loan applicants, and which are not declared on an
application form, can enhance a credit scoring model for a New Zealand lending
company. Exploring the potential of such information to improve credit scoring
models in this manner has not been studied previously. We construct a baseline
model based solely on the existing scoring features obtained from the loan
application form, and a second baseline model based solely on the new bank
statement-derived features. A combined feature model is then created by
augmenting the application form features with the new bank statement derived
features. Our experimental results using ROC analysis show that a combined
feature model performs better than both of the two baseline models, and show
that a number of the bank statement-derived features have value in improving
the credit scoring model. The target data set used for modelling was highly
imbalanced, and Naive Bayes was found to be the best performing model, and
outperformed a number of other classifiers commonly used in credit scoring,
suggesting its potential for future use on highly imbalanced data sets.
","[{'version': 'v1', 'created': 'Sun, 30 Oct 2016 21:09:27 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Mar 2017 23:40:46 GMT'}]",2017-03-03,"[['Bunker', 'Rory P.', ''], ['Zhang', 'Wenjun', ''], ['Naeem', 'M. Asif', '']]","['Credit Risk', 'ROC Curve', 'Imbalanced Data', 'Machine Learning']"
14898,1708.01302,"Y\""uksel Arslan",Yuksel Arslan,"A solution for ARP spoofing: Layer-2 MAC and protocol filtering and
  arpserver",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most attacks are launched inside the companies by the employees of the same
company. These kinds of attacks are generally against layer-2, not against
layer-3 or IP. These attacks abuse the switch operation at layer-2. One of the
attacks of this kind is Address Resolution Protocol (ARP) Spoofing (sometimes
it is called ARP poisoning). This attack is classified as the 'man in the
middle' (MITM) attack. The usual security systems such as (personal) firewalls
or virus protection software can not recognize this type of attack. Taping into
the communication between two hosts one can access the confidential data.
Malicious software to run internal attacks on a network is freely available on
the Internet, such as Ettercap. In this paper a solution is proposed and
implemented to prevent ARP Spoofing. In this proposal access control lists
(ACL) for layer-2 Media Access Control (MAC) address and protocol filtering and
an application called ARPserver which will reply all ARP requests are used.
","[{'version': 'v1', 'created': 'Thu, 3 Aug 2017 20:38:24 GMT'}]",2017-08-07,"[['Arslan', 'Yuksel', '']]","['Computer Networks', 'ARP', 'ARP Spoofing', 'MITM', 'Layer-2 filtering']"
14899,1501.04358,Paul Smaldino,Paul E. Smaldino,Does Learning Imply a Decrease in the Entropy of Behavior?,"14 pages, 7 figures, 1 table",,,,cs.RO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Shannon's information entropy measures of the uncertainty of an event's
outcome. If learning about a system reflects a decrease in uncertainty, then a
plausible intuition is that learning should be accompanied by a decrease in the
entropy of the organism's actions and/or perceptual states. To address whether
this intuition is valid, I examined an artificial organism -- a simple robot --
that learned to navigate in an arena and analyzed the entropy of the outcome
variables action, state, and reward. Entropy did indeed decrease in the initial
stages of learning, but two factors complicated the scenario: (1) the
introduction of new options discovered during the learning process and (2) the
shifting patterns of perceptual and environmental states resulting from changes
to the robot's learned movement strategies. These factors lead to a subsequent
increase in entropy as the agent learned. I end with a discussion of the
utility of information-based characterizations of learning.
","[{'version': 'v1', 'created': 'Sun, 18 Jan 2015 21:49:22 GMT'}, {'version': 'v2', 'created': 'Sun, 25 Jan 2015 01:13:52 GMT'}, {'version': 'v3', 'created': 'Thu, 19 Feb 2015 01:16:18 GMT'}]",2015-02-20,"[['Smaldino', 'Paul E.', '']]","['Information theory', 'robots', 'simulation', 'uncertainty', 'spatiallearning', 'option generation']"
14900,1403.7137,Ahmed Attia,"Ahmed Attia, Adrian Sandu",A Sampling Filter for Non-Gaussian Data Assimilation,"52 pages, 24 figures, 4 tables",,,CSTR-4/2014,cs.CE stat.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data assimilation combines information from models, measurements, and priors
to estimate the state of a dynamical system such as the atmosphere. The
Ensemble Kalman filter (EnKF) is a family of ensemble-based data assimilation
approaches that has gained wide popularity due its simple formulation, ease of
implementation, and good practical results. Most EnKF algorithms assume that
the underlying probability distributions are Gaussian. Although this assumption
is well accepted, it is too restrictive when applied to large nonlinear models,
nonlinear observation operators, and large levels of uncertainty. Several
approaches have been proposed in order to avoid the Gaussianity assumption. One
of the most successful strategies is the maximum likelihood ensemble filter
(MLEF) which computes a maximum a posteriori estimate of the state assuming the
posterior distribution is Gaussian. MLEF is designed to work with nonlinear and
even non-differentiable observation operators, and shows good practical
performance. However, there are limits to the degree of nonlinearity that MLEF
can handle. This paper proposes a new ensemble-based data assimilation method,
named the ""sampling filter"", which obtains the analysis by sampling directly
from the posterior distribution. The sampling strategy is based on a Hybrid
Monte Carlo (HMC) approach that can handle non-Gaussian probability
distributions. Numerical experiments are carried out using the Lorenz-96 model
and observation operators with different levels of non-linearity and
differentiability. The proposed filter is also tested with shallow water model
on a sphere with linear observation operator. The results show that the
sampling filter can perform well even in highly nonlinear situations were EnKF
and MLEF filters diverge.
","[{'version': 'v1', 'created': 'Thu, 27 Mar 2014 17:21:08 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Dec 2014 22:06:20 GMT'}]",2014-12-09,"[['Attia', 'Ahmed', ''], ['Sandu', 'Adrian', '']]","['Data assimilation', 'variational methods', 'ensemble filters', 'Markov chain', 'hybridMonte-Carlo']"
14901,1710.05268,Frederik Ebert,"Frederik Ebert, Chelsea Finn, Alex X. Lee, Sergey Levine",Self-Supervised Visual Planning with Temporal Skip Connections,accepted at the Conference on Robot Learning (CoRL) 2017,,,,cs.RO cs.AI cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to autonomously learn wide repertoires of complex skills, robots
must be able to learn from their own autonomously collected data, without human
supervision. One learning signal that is always available for autonomously
collected data is prediction: if a robot can learn to predict the future, it
can use this predictive model to take actions to produce desired outcomes, such
as moving an object to a particular location. However, in complex open-world
scenarios, designing a representation for prediction is difficult. In this
work, we instead aim to enable self-supervised robotic learning through direct
video prediction: instead of attempting to design a good representation, we
directly predict what the robot will see next, and then use this model to
achieve desired goals. A key challenge in video prediction for robotic
manipulation is handling complex spatial arrangements such as occlusions. To
that end, we introduce a video prediction model that can keep track of objects
through occlusion by incorporating temporal skip-connections. Together with a
novel planning criterion and action space formulation, we demonstrate that this
model substantially outperforms prior work on video prediction-based control.
Our results show manipulation of objects not seen during training, handling
multiple objects, and pushing objects around obstructions. These results
represent a significant advance in the range and complexity of skills that can
be performed entirely with self-supervised robotic learning.
","[{'version': 'v1', 'created': 'Sun, 15 Oct 2017 02:58:20 GMT'}]",2017-10-18,"[['Ebert', 'Frederik', ''], ['Finn', 'Chelsea', ''], ['Lee', 'Alex X.', ''], ['Levine', 'Sergey', '']]","['deep learning', 'video prediction', 'manipulation', 'model-based reinforcement learning']"
14902,1510.07211,Lili Mou,"Lili Mou, Rui Men, Ge Li, Lu Zhang, Zhi Jin","On End-to-End Program Generation from User Intention by Deep Neural
  Networks","Submitted to 2016 International Conference of Software Engineering
  ""Vision of 2025 and Beyond"" track",,,,cs.SE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper envisions an end-to-end program generation scenario using
recurrent neural networks (RNNs): Users can express their intention in natural
language; an RNN then automatically generates corresponding code in a
characterby-by-character fashion. We demonstrate its feasibility through a case
study and empirical analysis. To fully make such technique useful in practice,
we also point out several cross-disciplinary challenges, including modeling
user intention, providing datasets, improving model architectures, etc.
Although much long-term research shall be addressed in this new field, we
believe end-to-end program generation would become a reality in future decades,
and we are looking forward to its practice.
","[{'version': 'v1', 'created': 'Sun, 25 Oct 2015 06:52:45 GMT'}]",2015-10-27,"[['Mou', 'Lili', ''], ['Men', 'Rui', ''], ['Li', 'Ge', ''], ['Zhang', 'Lu', ''], ['Jin', 'Zhi', '']]","['Deep learning', 'Recurrent network', 'Program generation']"
14903,1802.08112,Jos\'e Vuelvas,Jos\'e Vuelvas and Fredy Ruiz,Rational consumer decisions in a peak time rebate program,,"Vuelvas, J., & Ruiz, F. (2017). Rational consumer decisions in a
  peak time rebate program. Electric Power Systems Research, 143.
  https://doi.org/10.1016/j.epsr.2016.11.001",,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A rational behavior of a consumer is analyzed when the user participates in a
Peak Time Rebate (PTR) mechanism, which is a demand response (DR) incentive
program based on a baseline. A multi-stage stochastic programming is proposed
from the demand side in order to understand the rational decisions. The
consumer preferences are modeled as a risk-averse function under additive
uncertainty. The user chooses the optimal consumption profile to maximize his
economic benefits for each period. The stochastic optimization problem is
solved backward in time. A particular situation is developed when the System
Operator (SO) uses consumption of the previous interval as the
household-specific baseline for the DR program. It is found that a rational
consumer alters the baseline in order to increase the well-being when there is
an economic incentive. As results, whether the incentive is lower than the
retail price, the user shifts his load requirement to the baseline setting
period. On the other hand, if the incentive is greater than the regular energy
price, the optimal decision is that the user spends the maximum possible energy
in the baseline setting period and reduces the consumption at the PTR time.
This consumer behavior produces more energy consumption in total considering
all periods. In addition, the user with high uncertainty level in his energy
pattern should spend less energy than a predictable consumer when the incentive
is lower than the retail price.
","[{'version': 'v1', 'created': 'Thu, 22 Feb 2018 15:52:07 GMT'}]",2018-02-23,"[['Vuelvas', 'José', ''], ['Ruiz', 'Fredy', '']]","['Demand Response', 'Peak Time Rebate', 'Stochastic Programming', 'Baseline']"
14904,1003.0645,Ayatullah Faruk Mollah,"Ayatullah Faruk Mollah, Subhadip Basu, Nibaran Das, Ram Sarkar, Mita
  Nasipuri, Mahantapas Kundu",Binarizing Business Card Images for Mobile Devices,"Proc. of International Conference on Computer Vision and Information
  Technology (ACVIT-2009), pp. 968-975, Dec 16-19, 2009, Aurangabad, India",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Business card images are of multiple natures as these often contain graphics,
pictures and texts of various fonts and sizes both in background and
foreground. So, the conventional binarization techniques designed for document
images can not be directly applied on mobile devices. In this paper, we have
presented a fast binarization technique for camera captured business card
images. A card image is split into small blocks. Some of these blocks are
classified as part of the background based on intensity variance. Then the
non-text regions are eliminated and the text ones are skew corrected and
binarized using a simple yet adaptive technique. Experiment shows that the
technique is fast, efficient and applicable for the mobile devices.
","[{'version': 'v1', 'created': 'Tue, 2 Mar 2010 18:02:40 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Mar 2010 08:36:40 GMT'}]",2010-03-09,"[['Mollah', 'Ayatullah Faruk', ''], ['Basu', 'Subhadip', ''], ['Das', 'Nibaran', ''], ['Sarkar', 'Ram', ''], ['Nasipuri', 'Mita', ''], ['Kundu', 'Mahantapas', '']]","['Binarization', 'Business Card Reader', 'Text Extraction', 'Skew Correction']"
14905,1802.09225,Michael Viderman,"Noa Avigdor-Elgrabli, Alex Libov, Michael Viderman, Ran Wolff",Interpreting Complex Regression Models,,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interpretation of a machine learning induced models is critical for feature
engineering, debugging, and, arguably, compliance. Yet, best of breed machine
learning models tend to be very complex. This paper presents a method for model
interpretation which has the main benefit that the simple interpretations it
provides are always grounded in actual sets of learning examples. The method is
validated on the task of interpreting a complex regression model in the context
of both an academic problem -- predicting the year in which a song was recorded
and an industrial one -- predicting mail user churn.
","[{'version': 'v1', 'created': 'Mon, 26 Feb 2018 09:56:04 GMT'}]",2018-02-27,"[['Avigdor-Elgrabli', 'Noa', ''], ['Libov', 'Alex', ''], ['Viderman', 'Michael', ''], ['Wolff', 'Ran', '']]","['learning model', 'gradient boosted decision tree', 't-test']"
14906,0903.2544,Iraklis Varlamis,"N. Zotos, P. Tzekou, G. Tsatsaronis, L. Kozanidis, S. Stamou, I.
  Varlamis","To Click or not to Click? The Role of Contextualized and User-Centric
  Web Snippets",In proceedings of SIGIR 2007 Workshop on Focused Retrieval. 8 pages,SIGIR 2007 Workshop on Focused Retrieval,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When searching the web, it is often possible that there are too many results
available for ambiguous queries. Text snippets, extracted from the retrieved
pages, are an indicator of the pages' usefulness to the query intention and can
be used to focus the scope of search results. In this paper, we propose a novel
method for automatically extracting web page snippets that are highly relevant
to the query intention and expressive of the pages' entire content. We show
that the usage of semantics, as a basis for focused retrieval, produces high
quality text snippet suggestions. The snippets delivered by our method are
significantly better in terms of retrieval performance compared to those
derived using the pages' statistical content. Furthermore, our study suggests
that semantically-driven snippet generation can also be used to augment
traditional passage retrieval algorithms based on word overlap or statistical
weights, since they typically differ in coverage and produce different results.
User clicks on the query relevant snippets can be used to refine the query
results and promote the most comprehensive among the relevant documents.
","[{'version': 'v1', 'created': 'Sat, 14 Mar 2009 12:22:27 GMT'}]",2009-03-24,"[['Zotos', 'N.', ''], ['Tzekou', 'P.', ''], ['Tsatsaronis', 'G.', ''], ['Kozanidis', 'L.', ''], ['Stamou', 'S.', ''], ['Varlamis', 'I.', '']]","['Web passage retrieval', 'semantic similarity', 'coherence']"
14907,1505.06378,Maya Gupta,"Maya Gupta, Andrew Cotter, Jan Pfeifer, Konstantin Voevodski, Kevin
  Canini, Alexander Mangylov, Wojtek Moczydlowski and Alex van Esbroeck",Monotonic Calibrated Interpolated Look-Up Tables,"To appear (with minor revisions), Journal Machine Learning Research
  2016",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real-world machine learning applications may require functions that are
fast-to-evaluate and interpretable. In particular, guaranteed monotonicity of
the learned function can be critical to user trust. We propose meeting these
goals for low-dimensional machine learning problems by learning flexible,
monotonic functions using calibrated interpolated look-up tables. We extend the
structural risk minimization framework of lattice regression to train monotonic
look-up tables by solving a convex problem with appropriate linear inequality
constraints. In addition, we propose jointly learning interpretable
calibrations of each feature to normalize continuous features and handle
categorical or missing data, at the cost of making the objective non-convex. We
address large-scale learning through parallelization, mini-batching, and
propose random sampling of additive regularizer terms. Case studies with
real-world problems with five to sixteen features and thousands to millions of
training samples demonstrate the proposed monotonic functions can achieve
state-of-the-art accuracy on practical problems while providing greater
transparency to users.
","[{'version': 'v1', 'created': 'Sat, 23 May 2015 20:57:58 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Nov 2015 21:49:53 GMT'}, {'version': 'v3', 'created': 'Wed, 20 Jan 2016 22:54:21 GMT'}]",2016-01-22,"[['Gupta', 'Maya', ''], ['Cotter', 'Andrew', ''], ['Pfeifer', 'Jan', ''], ['Voevodski', 'Konstantin', ''], ['Canini', 'Kevin', ''], ['Mangylov', 'Alexander', ''], ['Moczydlowski', 'Wojtek', ''], ['van Esbroeck', 'Alex', '']]","['interpretability', 'interpolation', 'look-up tables', 'monotonicity']"
14908,1701.07106,Joydeep Banerjee,"Joydeep Banerjee, Kaustav Basu, and Arunabha Sen",On Hardening Problems in Critical Infrastructure Systems,"The previous version was made into a journal paper that contains the
  previous problem along with an existing problem. As the previous version is
  not intended to be published hence it is requested that this new version is
  accepted",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The power and communication networks are highly interdependent and form a
part of the critical infrastructure of a country. Similarly, dependencies exist
within the networks itself. It is essential to have a model which captures
these dependencies precisely. Previous research has proposed certain models but
these models have certain limitations. The limitations of the aforementioned
models have been overcome by the Implicative Interdependency Model, which uses
Boolean Logic to denote the dependencies. This paper formulates the Entity
Hardening problem and the Targeted Entity Hardening problem using the
Implicative Interdependency Model. The Entity Hardening problem describes a
situation where an operator, with a limited budget, must decide which entities
to harden, which in turn would minimize the damage, provided a set of entities
fail initially. The Targeted Entity Hardening problem is a restricted version
of the Entity Hardening problem. This problem presents a scenario where, the
protection of certain entities is of higher priority. If these entities were to
be nonfunctional, the economic and societal damage would be higher when
compared to other entities being nonfunctional. It has been shown that both
problems are NP-Complete. An Integer Linear Program (ILP) has been devised to
find the optimal solution. A heuristic has been described whose accuracy is
found by comparing its performance with the optimal solution using real-world
and simulated data.
","[{'version': 'v1', 'created': 'Tue, 24 Jan 2017 23:18:05 GMT'}, {'version': 'v2', 'created': 'Wed, 31 May 2017 10:06:23 GMT'}]",2017-06-01,"[['Banerjee', 'Joydeep', ''], ['Basu', 'Kaustav', ''], ['Sen', 'Arunabha', '']]","['Critical Infrastructure', 'Entity Hardening', 'Targeted Entity Hardening', 'Power Network', 'CommunicationNetwork', 'Dependency', 'Interdependency']"
14909,1005.0896,Jean Dezert,"Jean-Marc Tacnet (UR ETGR), Mireille Batton-Hubert (ENSM-SE), Jean
  Dezert (ONERA)","A two-step fusion process for multi-criteria decision applied to natural
  hazards in mountains",,"Workshop on the Theory of Belief Functions, April 1- 2, 2010
  Brest, France, Brest : France (2010)",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mountain river torrents and snow avalanches generate human and material
damages with dramatic consequences. Knowledge about natural phenomenona is
often lacking and expertise is required for decision and risk management
purposes using multi-disciplinary quantitative or qualitative approaches.
Expertise is considered as a decision process based on imperfect information
coming from more or less reliable and conflicting sources. A methodology mixing
the Analytic Hierarchy Process (AHP), a multi-criteria aid-decision method, and
information fusion using Belief Function Theory is described. Fuzzy Sets and
Possibilities theories allow to transform quantitative and qualitative criteria
into a common frame of discernment for decision in Dempster-Shafer Theory (DST
) and Dezert-Smarandache Theory (DSmT) contexts. Main issues consist in basic
belief assignments elicitation, conflict identification and management, fusion
rule choices, results validation but also in specific needs to make a
difference between importance and reliability and uncertainty in the fusion
process.
","[{'version': 'v1', 'created': 'Thu, 6 May 2010 06:32:59 GMT'}]",2011-01-20,"[['Tacnet', 'Jean-Marc', '', 'UR ETGR'], ['Batton-Hubert', 'Mireille', '', 'ENSM-SE'], ['Dezert', 'Jean', '', 'ONERA']]","['natural hazards', 'expertise', 'decision-making', 'multi-criteria decision making', 'Analytic Hierarchy Process(AHP)', 'DST', 'DSmT']"
14910,1610.09580,Jing Zhang,"Jing Zhang, Sepideh Pourazarm, Christos G. Cassandras, Ioannis Ch.
  Paschalidis","Data-driven Estimation of Origin-Destination Demand and User Cost
  Functions for the Optimization of Transportation Networks","Preprint submitted to The 20th World Congress of the International
  Federation of Automatic Control, July 9-14, 2017, Toulouse, France",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In earlier work (Zhang et al., 2016) we used actual traffic data from the
Eastern Massachusetts transportation network in the form of spatial average
speeds and road segment flow capacities in order to estimate Origin-Destination
(OD) flow demand matrices for the network. Based on a Traffic Assignment
Problem (TAP) formulation (termed ""forward problem""), in this paper we use a
scheme similar to our earlier work to estimate initial OD demand matrices and
then propose a new inverse problem formulation in order to estimate user cost
functions. This new formulation allows us to efficiently overcome numerical
difficulties that limited our prior work to relatively small subnetworks and,
assuming the travel latency cost functions are available, to adjust the values
of the OD demands accordingly so that the flow observations are as close as
possible to the solutions of the forward problem. We also derive sensitivity
analysis results for the total user latency cost with respect to important
parameters such as road capacities and minimum travel times. Finally, using the
same actual traffic data from the Eastern Massachusetts transportation network,
we quantify the Price of Anarchy (POA) for a much larger network than that in
Zhang et al. (2016).
","[{'version': 'v1', 'created': 'Sat, 29 Oct 2016 23:32:09 GMT'}]",2016-11-01,"[['Zhang', 'Jing', ''], ['Pourazarm', 'Sepideh', ''], ['Cassandras', 'Christos G.', ''], ['Paschalidis', 'Ioannis Ch.', '']]","['optimization', 'transportation networks', 'origin-destination demand estimation', 'travellatency cost function', 'price of anarchy', 'sensitivity analysis']"
14911,1611.00862,Paul Weng,Hugo Gilbert and Paul Weng,Quantile Reinforcement Learning,AWRL 2016,,,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In reinforcement learning, the standard criterion to evaluate policies in a
state is the expectation of (discounted) sum of rewards. However, this
criterion may not always be suitable, we consider an alternative criterion
based on the notion of quantiles. In the case of episodic reinforcement
learning problems, we propose an algorithm based on stochastic approximation
with two timescales. We evaluate our proposition on a simple model of the TV
show, Who wants to be a millionaire.
","[{'version': 'v1', 'created': 'Thu, 3 Nov 2016 02:28:53 GMT'}]",2016-11-04,"[['Gilbert', 'Hugo', ''], ['Weng', 'Paul', '']]","['Reinforcement learning', 'Quantile', 'Ordinal Decision Model', 'Two-TimescaleStochastic Approximation']"
14912,1708.01797,Trevor Brown,Maya Arbel-Raviv and Trevor Brown,"Reuse, don't Recycle: Transforming Lock-free Algorithms that Throw Away
  Descriptors",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many lock-free algorithms, threads help one another, and each operation
creates a descriptor that describes how other threads should help it.
Allocating and reclaiming descriptors introduces significant space and time
overhead. We introduce the first descriptor abstract data type (ADT), which
captures the usage of descriptors by lock-free algorithms. We then develop a
weak descriptor ADT which has weaker semantics, but can be implemented
significantly more efficiently. We show how a large class of lock-free
algorithms can be transformed to use weak descriptors, and demonstrate our
technique by transforming several algorithms, including the leading
k-compare-and-swap (k-CAS) algorithm. The original k-CAS algorithm allocates at
least k+1 new descriptors per k-CAS. In contrast, our implementation allocates
two descriptors per process, and each process simply reuses its two
descriptors. Experiments on a variety of workloads show significant performance
improvements over implementations that reclaim descriptors, and reductions of
up to three orders of magnitude in peak memory usage.
","[{'version': 'v1', 'created': 'Sat, 5 Aug 2017 18:04:26 GMT'}]",2017-08-08,"[['Arbel-Raviv', 'Maya', ''], ['Brown', 'Trevor', '']]","['Concurrency', 'data structures', 'lock-free', 'synchronization', 'descriptors']"
14913,1309.7518,Benjamin Belzer,"Michael Carosino, Yiming Chen, Benjamin J. Belzer, Krishnamoorthy
  Sivakumar, Jacob Murray and Paul Wettin","Iterative Detection and Decoding for the Four-Rectangular-Grain TDMR
  Model","7 pages, 7 figures, 2 tables. Accepted paper to appear in proceedings
  of the 2013 Allerton Conference on Communication, Control and Computing",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers detection and error control coding for the
two-dimensional magnetic recording (TDMR) channel modeled by the
two-dimensional (2D) four-rectangular-grain model proposed by Kavcic, Huang et.
al. in 2010. This simple model captures the effects of different 2D grain sizes
and shapes, as well as the TDMR grain overwrite effect: grains large enough to
be written by successive bits retain the polarity of only the last bit written.
We construct a row-by-row BCJR detection algorithm that considers outputs from
two rows at a time over two adjacent columns, thereby enabling consideration of
more grain and data states than previously proposed algorithms that scan only
one row at a time. The proposed algorithm employs soft-decision feedback of
grain states from previous rows to aid the estimation of current data bits and
grain states. Simulation results using the same average coded bit density and
serially concatenated convolutional code (SCCC) as a previous paper by Pan,
Ryan, et. al. show gains in user bits/grain of up to 6.7% over the previous
work when no iteration is performed between the TDMR BCJR and the SCCC, and
gains of up to 13.4% when the detector and the decoder iteratively exchange
soft information.
","[{'version': 'v1', 'created': 'Sun, 29 Sep 2013 02:05:49 GMT'}]",2013-10-01,"[['Carosino', 'Michael', ''], ['Chen', 'Yiming', ''], ['Belzer', 'Benjamin J.', ''], ['Sivakumar', 'Krishnamoorthy', ''], ['Murray', 'Jacob', ''], ['Wettin', 'Paul', '']]","['Two-dimensional magnetic recording', 'iterative detection and decoding', 'rectangular grain model']"
14914,1106.1957,Frederick Maier,Frederick Maier,"Interdefinability of defeasible logic and logic programming under the
  well-founded semantics","36 pages; To appear in Theory and Practice of Logic Programming
  (TPLP)",,,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide a method of translating theories of Nute's defeasible logic into
logic programs, and a corresponding translation in the opposite direction.
Under certain natural restrictions, the conclusions of defeasible theories
under the ambiguity propagating defeasible logic ADL correspond to those of the
well-founded semantics for normal logic programs, and so it turns out that the
two formalisms are closely related. Using the same translation of logic
programs into defeasible theories, the semantics for the ambiguity blocking
defeasible logic NDL can be seen as indirectly providing an ambiguity blocking
semantics for logic programs. We also provide antimonotone operators for both
ADL and NDL, each based on the Gelfond-Lifschitz (GL) operator for logic
programs. For defeasible theories without defeaters or priorities on rules, the
operator for ADL corresponds to the GL operator and so can be seen as partially
capturing the consequences according to ADL. Similarly, the operator for NDL
captures the consequences according to NDL, though in this case no restrictions
on theories apply. Both operators can be used to define stable model semantics
for defeasible theories.
","[{'version': 'v1', 'created': 'Fri, 10 Jun 2011 05:20:17 GMT'}]",2011-06-13,"[['Maier', 'Frederick', '']]","['defeasible logic', 'logic programming', 'well-founded semantics', 'stable modelsemantics', 'ambiguity blocking', 'propagation']"
14915,1607.00307,K\'evin Atighehchi,Kevin Atighehchi,"Optimal Tree Hash Modes: the Case of Trees Having their Leaves at All
  the Levels",,,,,cs.DC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A recent work shows how we can optimize a tree based mode of operation for a
hash function where the sizes of input message blocks and digest are the same,
subject to the constraint that the involved tree structure has all its leaves
at the same depth. In this work, we show that we can further optimize the
running time of such a mode by using a tree having leaves at all its levels. We
make the assumption that the input message block has a size a multiple of that
of the digest and denote by $d$ the ratio block size over digest size. The
running time is evaluated in terms of number of operations performed by the
hash function, i.e. the number of calls to its underlying function. It turns
out that a digest can be computed in $\lceil \log_{d+1} (l/2) \rceil+2$
evaluations of the underlying function using $\lceil l/2 \rceil$ processors,
where $l$ is the number of blocks of the message. Other results of interest are
discussed, such as the optimization of the parallel running time for a tree of
restricted height.
","[{'version': 'v1', 'created': 'Fri, 1 Jul 2016 16:34:02 GMT'}, {'version': 'v10', 'created': 'Tue, 27 Jun 2017 12:35:41 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Jul 2016 18:07:26 GMT'}, {'version': 'v3', 'created': 'Wed, 20 Jul 2016 15:57:27 GMT'}, {'version': 'v4', 'created': 'Sat, 23 Jul 2016 17:55:27 GMT'}, {'version': 'v5', 'created': 'Thu, 4 Aug 2016 13:59:02 GMT'}, {'version': 'v6', 'created': 'Wed, 21 Sep 2016 17:10:50 GMT'}, {'version': 'v7', 'created': 'Fri, 30 Sep 2016 13:27:23 GMT'}, {'version': 'v8', 'created': 'Sun, 16 Oct 2016 16:21:33 GMT'}, {'version': 'v9', 'created': 'Sat, 22 Apr 2017 12:46:23 GMT'}]",2017-06-28,"[['Atighehchi', 'Kevin', '']]","['SHA-3', 'Hash functions', 'Merkle trees', 'Parallel algorithms', 'Spongefunctions', 'Prefix-free Merkle-Damg˚ard']"
14916,1701.03477,Marc Olm,Santiago Badia and Marc Olm,Space-time balancing domain decomposition,,,,,cs.NA cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we propose two-level space-time domain decomposition
preconditioners for parabolic problems discretized using finite elements. They
are motivated as an extension to space-time of balancing domain decomposition
by constraints preconditioners. The key ingredients to be defined are the
sub-assembled space and operator, the coarse degrees of freedom (DOFs) in which
we want to enforce continuity among subdomains at the preconditioner level, and
the transfer operator from the sub-assembled to the original finite element
space. With regard to the sub-assembled operator, a perturbation of the time
derivative is needed to end up with a well-posed preconditioner. The set of
coarse DOFs includes the time average (at the space-time subdomain) of
classical space constraints plus new constraints between consecutive subdomains
in time. Numerical experiments show that the proposed schemes are weakly
scalable in time, i.e., we can efficiently exploit increasing computational
resources to solve more time steps in the same {total elapsed} time. Further,
the scheme is also weakly space-time scalable, since it leads to asymptotically
constant iterations when solving larger problems both in space and time.
Excellent {wall clock} time weak scalability is achieved for space-time
parallel solvers on some thousands of cores.
","[{'version': 'v1', 'created': 'Thu, 12 Jan 2017 19:32:09 GMT'}]",2017-01-16,"[['Badia', 'Santiago', ''], ['Olm', 'Marc', '']]","['Space-time parallelism', 'domain decomposition', 'BDDC', 'preconditioning', 'scalability']"
14917,1511.08745,Nan Li,"Nan Li, Lars K. Rasmussen and Ming Xiao",Cooperative Communication Using Network Coding,"32 pages, 8 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a cognitive radio network scenario where a primary transmitter
and a secondary transmitter, respectively, communicate a message to their
respective primary receiver and secondary receiver over a packet-based wireless
link, using a joint automatic-repeat-request (ARQ) error control scheme. The
secondary transmitter assists in the retransmission of the primary message,
which improves the primary performance, and is granted limited access to the
transmission resources. Conventional ARQ, as well as two network-coding schemes
are investigated for application in the retransmission phase; namely the static
network-coding (SNC) scheme and the adaptive network-coding (ANC) scheme. For
each scheme we analyze the transmission process by investigating the
distribution of the number of transmission attempts and approximate it by
normal distributions. Considering both the cases of an adaptive frame size and
a truncated frame size, we derive analytical results on packet throughput and
infer that the ANC scheme outperforms the SNC scheme.
","[{'version': 'v1', 'created': 'Fri, 27 Nov 2015 17:08:53 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Dec 2015 20:10:35 GMT'}]",2015-12-11,"[['Li', 'Nan', ''], ['Rasmussen', 'Lars K.', ''], ['Xiao', 'Ming', '']]","['Cognitive radio networks', 'cooperation', 'network coding', 'throughput']"
14918,1506.01509,Fabio Lopez-Pires,Fabio Lopez-Pires and Benjamin Baran,Virtual Machine Placement Literature Review,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud Computing Datacenters host millions of virtual machines (VMs) on real
world scenarios. In this context, Virtual Machine Placement (VMP) is one of the
most challenging problems in cloud infrastructure management, considering also
the large number of possible optimization criteria and different formulations
that could be studied. VMP literature include relevant topics such as
energy-efficiency, Service Level Agreements (SLA), cloud service markets,
Quality of Service (QoS) and carbon dioxide emissions, all of them with high
economical and ecological impact. This work presents an extensive up-to-date
review of the most relevant VMP literature in order to identify research
opportunities.
","[{'version': 'v1', 'created': 'Thu, 4 Jun 2015 08:32:34 GMT'}]",2015-06-05,"[['Lopez-Pires', 'Fabio', ''], ['Baran', 'Benjamin', '']]","['in the article title (1) virtual machine placement', '(2) vm placement', '(3) virtual machine consolidation', '(4) vmconsolidation or (5) server consolidation']"
14919,1409.5054,Ayad Ghany Ismaeel,"Bnar Faisal Daham, Ayad Ghany Ismaeel, Suha A. Abdual-Rahman",TCP Performance for Kurd Messenger Application Using Bio-computing,"15 pages, 11 figures, 6 Tabels. arXiv admin note: substantial text
  overlap with arXiv:1206.0893","Zanco, Journal of Pure and Applied Sciences, Salahaddin
  University, Hawler, IRAQ, Vol. 21 No. 2, 2009, Pages 123-139",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work was conducted to design, implement, and evaluate a new model of
measuring Transmission Control Protocol (TCP) performance of real time network.
The proposed model Biological Kurd Messenger (BIOKM) has two main goals: First
is to run the model efficiently, second is to obtain high TCP performance via
real time network using bio-computing technique, especially molecular
calculation because it provides wisdom results and it can exploit all
facilities of phylogentic analysis. To measure TCP performance two protocols
were selected Internet Relay Chat Daemon (IRCD) and File Transfer Protocol
(FTP), the BIOKM model consists of two applications Kurd Messenger Server Side
(KMSS) and Kurd Messenger Client Side (KMCS) written in Java programming
language by implementing algorithms of BIOKM Server and Client application. The
paper also includes the implementation of hybridized model algorithm based on
Neighbor-Joining (NJ) method to measure TCP performance, then implementing
algorithm of Little law (steady state) for single server queue as a comparison
with bio-computing algorithm. The results obtained by using bio-computing and
little law techniques show very good performance and the two techniques result
are very close to each other this is because of local implementation. The main
tools which have been used in this work can be divided into software and
hardware tools.
  Keywords: Biological Kurd Messenger (BIOKM), Kurd Messenger Phylogenetic
tree, Hybridized Model, Little Law, TCP Performance.
","[{'version': 'v1', 'created': 'Tue, 16 Sep 2014 09:26:27 GMT'}]",2014-09-18,"[['Daham', 'Bnar Faisal', ''], ['Ismaeel', 'Ayad Ghany', ''], ['Abdual-Rahman', 'Suha A.', '']]","['Biological Kurd Messenger (BIOKM)', 'Kurd Messenger Phylogenetic tree', 'Hybridized Model', 'Little’s Law', 'TCP Performance']"
14920,2007.05578,Oemer Uludag,"Oemer Uludag, Pascal Philipp, Abheeshta Putta, Maria Paasivaara,
  Casper Lassenius, and Florian Matthes","Revealing the State of the Art of Large-Scale Agile Development
  Research: A Systematic Mapping Study",,,,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Context: Success with agile methods in the small scale has led to an
increasing adoption also in large development undertakings and organizations.
Recent years have also seen an increasing amount of primary research on the
topic, as well as a number of systematic literature reviews. However, there is
no systematic overview of the whole research field. Objective: This work
identifies, classifies, and evaluates the state of the art of research in
large-scale agile development. Method: We conducted a systematic mapping study
and rigorously selected 136 studies. We designed a classification framework and
extracted key information from the studies. We synthesized the obtained data
and created an overview of the state of the art. Results: This work contributes
with (i) a description of large-scale agile endeavors reported in the industry,
(ii) a systematic map of existing research in the field, (iii) an overview of
influential studies, (iv) an overview of the central research themes, and (v) a
research agenda for future research. Conclusion: This study portrays the state
of the art in large-scale agile development and offers researchers and
practitioners a reflection of the past thirteen years of research and practice
on the large-scale application of agile methods.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 19:20:11 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Oct 2021 21:07:27 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Nov 2021 18:17:10 GMT'}, {'version': 'v4', 'created': 'Wed, 3 Aug 2022 22:31:04 GMT'}]",2022-08-05,"[['Uludag', 'Oemer', ''], ['Philipp', 'Pascal', ''], ['Putta', 'Abheeshta', ''], ['Paasivaara', 'Maria', ''], ['Lassenius', 'Casper', ''], ['Matthes', 'Florian', '']]","['Agile software development', 'large-scale agile development', 'systematic mapping study']"
14921,0802.0550,Vincent Gramoli,"Erwan Le Merrer (IRISA, FT R&D), Vincent Gramoli (IRISA), Anne-Marie
  Kermarrec (IRISA), Aline Viana (IRISA), Marin Bertier (IRISA)","Energy Aware Self-Organizing Density Management in Wireless Sensor
  Networks",,"Dans International Workshop on Decentralized Resource Sharing in
  Mobile Computing and Networking (2006) 23--29",,,cs.DC,,"  Energy consumption is the most important factor that determines sensor node
lifetime. The optimization of wireless sensor network lifetime targets not only
the reduction of energy consumption of a single sensor node but also the
extension of the entire network lifetime. We propose a simple and adaptive
energy-conserving topology management scheme, called SAND (Self-Organizing
Active Node Density). SAND is fully decentralized and relies on a distributed
probing approach and on the redundancy resolution of sensors for energy
optimizations, while preserving the data forwarding and sensing capabilities of
the network. We present the SAND's algorithm, its analysis of convergence, and
simulation results. Simulation results show that, though slightly increasing
path lengths from sensor to sink nodes, the proposed scheme improves
significantly the network lifetime for different neighborhood densities
degrees, while preserving both sensing and routing fidelity.
","[{'version': 'v1', 'created': 'Tue, 5 Feb 2008 07:03:28 GMT'}]",2008-02-06,"[['Merrer', 'Erwan Le', '', 'IRISA, FT R&D'], ['Gramoli', 'Vincent', '', 'IRISA'], ['Kermarrec', 'Anne-Marie', '', 'IRISA'], ['Viana', 'Aline', '', 'IRISA'], ['Bertier', 'Marin', '', 'IRISA']]","['Wireless sensor networks', 'topology management', 'peer-topeer distributed systems']"
14922,1312.4824,Bhagwati Pande,"B. P. Pande, Pawan Tamta, H. S. Dhami","Generation, Implementation and Appraisal of an N-gram based Stemming
  Algorithm",10 pages,,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A language independent stemmer has always been looked for. Single N-gram
tokenization technique works well, however, it often generates stems that start
with intermediate characters, rather than initial ones. We present a novel
technique that takes the concept of N gram stemming one step ahead and compare
our method with an established algorithm in the field, Porter's Stemmer.
Results indicate that our N gram stemmer is not inferior to Porter's linguistic
stemmer.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2013 15:32:56 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Jan 2014 04:05:36 GMT'}]",2014-01-17,"[['Pande', 'B. P.', ''], ['Tamta', 'Pawan', ''], ['Dhami', 'H. S.', '']]","['Information Retrieval (IR)', 'Stemming', 'Conflation', 'Stemmer', 'N-gram']"
14923,1402.4442,Donia El Kateb,"Donia El Kateb (SnT), Fran\c{c}ois Fouquet (SnT), Johann Bourcier
  (INRIA - IRISA), Yves Le Traon (SnT, CSC)","Artificial Mutation inspired Hyper-heuristic for Runtime Usage of
  Multi-objective Algorithms",,,,,cs.SE cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last years, multi-objective evolutionary algorithms (MOEA) have been
applied to different software engineering problems where many conflicting
objectives have to be optimized simultaneously. In theory, evolutionary
algorithms feature a nice property for runtime optimization as they can provide
a solution in any execution time. In practice, based on a Darwinian inspired
natural selection, these evolutionary algorithms produce many deadborn
solutions whose computation results in a computational resources wastage:
natural selection is naturally slow. In this paper, we reconsider this founding
analogy to accelerate convergence of MOEA, by looking at modern biology
studies: artificial selection has been used to achieve an anticipated specific
purpose instead of only relying on crossover and natural selection (i.e.,
Muller et al [18] research on artificial mutation of fruits with X-Ray).
Putting aside the analogy with natural selection , the present paper proposes
an hyper-heuristic for MOEA algorithms named Sputnik 1 that uses artificial
selective mutation to improve the convergence speed of MOEA. Sputnik leverages
the past history of mutation efficiency to select the most relevant mutations
to perform. We evaluate Sputnik on a cloud-reasoning engine, which drives
on-demand provisioning while considering conflicting performance and cost
objectives. We have conducted experiments to highlight the significant
performance improvement of Sputnik in terms of resolution time.
","[{'version': 'v1', 'created': 'Tue, 18 Feb 2014 19:09:23 GMT'}]",2014-02-19,"[['Kateb', 'Donia El', '', 'SnT'], ['Fouquet', 'François', '', 'SnT'], ['Bourcier', 'Johann', '', 'INRIA - IRISA'], ['Traon', 'Yves Le', '', 'SnT, CSC']]","['MOEA', 'Hyper-heuristic', 'Artificial mutation', 'Optimization', 'Cloud']"
14924,1611.00297,Kostas N. Oikonomou,Kostas N. Oikonomou,Generalized Entropy Concentration for Counts,Fixed the proof of Proposition 2.3,,,,cs.IT math.IT math.ST physics.data-an stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The phenomenon of entropy concentration provides strong support for the
maximum entropy method, MaxEnt, for inferring a probability vector from
information in the form of constraints. Here we extend this phenomenon, in a
discrete setting, to non-negative integral vectors not necessarily summing to
1. We show that linear constraints that simply bound the allowable sums suffice
for concentration to occur even in this setting. This requires a new,
`generalized' entropy measure in which the sum of the vector plays a role. We
measure the concentration in terms of deviation from the maximum generalized
entropy value, or in terms of the distance from the maximum generalized entropy
vector. We provide non-asymptotic bounds on the concentration in terms of
various parameters, including a tolerance on the constraints which ensures that
they are always satisfied by an integral vector. Generalized entropy
maximization is not only compatible with ordinary MaxEnt, but can also be
considered an extension of it, as it allows us to address problems that cannot
be formulated as MaxEnt problems.
","[{'version': 'v1', 'created': 'Tue, 1 Nov 2016 17:06:59 GMT'}, {'version': 'v2', 'created': 'Sun, 20 Nov 2016 13:56:44 GMT'}, {'version': 'v3', 'created': 'Sat, 8 Jul 2017 12:48:00 GMT'}, {'version': 'v4', 'created': 'Sun, 3 Dec 2017 01:28:36 GMT'}, {'version': 'v5', 'created': 'Sun, 5 May 2019 23:12:52 GMT'}, {'version': 'v6', 'created': 'Thu, 5 Sep 2019 15:14:58 GMT'}, {'version': 'v7', 'created': 'Fri, 8 Jan 2021 03:36:21 GMT'}]",2021-01-11,"[['Oikonomou', 'Kostas N.', '']]","['maximum generalized entropy', 'counts', 'concentration', 'linear constraints', 'inequalities', 'norms', 'tolerances']"
14925,1701.04383,"Hasan Ali Aky\""urek","Hasan Ali Aky\""urek, Erkan \""Ulker, Bar{\i}\c{s} Ko\c{c}er","Automatic Knot Adjustment Using Dolphin Echolocation Algorithm for
  B-Spline Curve Approximation","The Journal of MacroTrends in Technology and Innovation, Vol 4. Issue
  1. 2016",,,,cs.GR cs.NE,http://creativecommons.org/licenses/by/4.0/,"  In this paper, a new approach to solve the cubic B-spline curve fitting
problem is presented based on a meta-heuristic algorithm called "" dolphin
echolocation "". The method minimizes the proximity error value of the selected
nodes that measured using the least squares method and the Euclidean distance
method of the new curve generated by the reverse engineering. The results of
the proposed method are compared with the genetic algorithm. As a result, this
new method seems to be successful.
","[{'version': 'v1', 'created': 'Mon, 16 Jan 2017 18:20:32 GMT'}]",2017-01-17,"[['Akyürek', 'Hasan Ali', ''], ['Ülker', 'Erkan', ''], ['Koçer', 'Barış', '']]","['B-spline Curve Approximation', 'Cubic B-spline', 'Data Parameterization on B-Spline', 'Dolphin Echolocation Algorithm', 'Knot adjustment']"
14926,0708.1343,Heide Gluesing-Luerssen,"Heide Gluesing-Luerssen, Fai-Lung Tsang",A Matrix Ring Description for Cyclic Convolutional Codes,,,,,cs.IT math.IT math.RA,,"  In this paper, we study convolutional codes with a specific cyclic structure.
By definition, these codes are left ideals in a certain skew polynomial ring.
Using that the skew polynomial ring is isomorphic to a matrix ring we can
describe the algebraic parameters of the codes in a more accessible way. We
show that the existence of such codes with given algebraic parameters can be
reduced to the solvability of a modified rook problem. It is our strong belief
that the rook problem is always solvable, and we present solutions in
particular cases.
","[{'version': 'v1', 'created': 'Thu, 9 Aug 2007 21:35:15 GMT'}]",2007-08-13,"[['Gluesing-Luerssen', 'Heide', ''], ['Tsang', 'Fai-Lung', '']]","['Convolutional codes', 'cyclic codes', 'skew polynomial rings', 'Forney indices']"
14927,0709.1074,Shu-Tao Xia,Shu-Tao Xia and Fang-Wei Fu,Johnson Type Bounds on Constant Dimension Codes,"12 pages, submitted to Designs, Codes and Cryptography",,,,cs.IT math.IT,,"  Very recently, an operator channel was defined by Koetter and Kschischang
when they studied random network coding. They also introduced constant
dimension codes and demonstrated that these codes can be employed to correct
errors and/or erasures over the operator channel. Constant dimension codes are
equivalent to the so-called linear authentication codes introduced by Wang,
Xing and Safavi-Naini when constructing distributed authentication systems in
2003. In this paper, we study constant dimension codes. It is shown that
Steiner structures are optimal constant dimension codes achieving the
Wang-Xing-Safavi-Naini bound. Furthermore, we show that constant dimension
codes achieve the Wang-Xing-Safavi-Naini bound if and only if they are certain
Steiner structures. Then, we derive two Johnson type upper bounds, say I and
II, on constant dimension codes. The Johnson type bound II slightly improves on
the Wang-Xing-Safavi-Naini bound. Finally, we point out that a family of known
Steiner structures is actually a family of optimal constant dimension codes
achieving both the Johnson type bounds I and II.
","[{'version': 'v1', 'created': 'Fri, 7 Sep 2007 13:07:31 GMT'}]",2007-09-10,"[['Xia', 'Shu-Tao', ''], ['Fu', 'Fang-Wei', '']]","['Constant dimension codes', 'linear authentication codes', 'binaryconstant weight codes', 'Johnson bounds', 'Steiner structures', 'random network coding']"
14928,1410.3041,Mohammad Momani,"Mohammad Momani, Maen Takruri, Rami Al-Hmouz","Risk Assessment Algorithm in Wireless Sensor Networks using Beta
  Distribution",,"IJCNC, September 2014, Volume 6, number 5",,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces the Beta distribution as a novel technique to weight
direct and indirect trust and assessing the risk in wireless sensor networks.
This paper also reviews the trust factors, which play a major role in building
trust in wireless sensor networks and explains the dynamic aspects of trust.
This is an extension of a previous work done by the authors using a new
approach to assess risk. Simulation results related to the previous work and to
the new approach introduced in this paper are also presented for easy
comparison.
","[{'version': 'v1', 'created': 'Sun, 12 Oct 2014 01:32:59 GMT'}]",2014-10-14,"[['Momani', 'Mohammad', ''], ['Takruri', 'Maen', ''], ['Al-Hmouz', 'Rami', '']]","['Wireless Sensor Networks', 'Trust', 'Algorithm', 'Risk', 'Beta Distribution']"
14929,1702.06237,David Steurer,"Aaron Potechin, David Steurer",Exact tensor completion with sum-of-squares,,,,,cs.LG cs.CC cs.DS cs.IT math.IT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We obtain the first polynomial-time algorithm for exact tensor completion
that improves over the bound implied by reduction to matrix completion. The
algorithm recovers an unknown 3-tensor with $r$ incoherent, orthogonal
components in $\mathbb R^n$ from $r\cdot \tilde O(n^{1.5})$ randomly observed
entries of the tensor. This bound improves over the previous best one of
$r\cdot \tilde O(n^{2})$ by reduction to exact matrix completion. Our bound
also matches the best known results for the easier problem of approximate
tensor completion (Barak & Moitra, 2015).
  Our algorithm and analysis extends seminal results for exact matrix
completion (Candes & Recht, 2009) to the tensor setting via the sum-of-squares
method. The main technical challenge is to show that a small number of randomly
chosen monomials are enough to construct a degree-3 polynomial with precisely
planted orthogonal global optima over the sphere and that this fact can be
certified within the sum-of-squares proof system.
","[{'version': 'v1', 'created': 'Tue, 21 Feb 2017 02:14:31 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Feb 2017 02:48:22 GMT'}, {'version': 'v3', 'created': 'Fri, 23 Jun 2017 18:24:50 GMT'}]",2017-06-27,"[['Potechin', 'Aaron', ''], ['Steurer', 'David', '']]","['tensor completion', 'sum-of-squares method', 'semidefinite programming', 'exactrecovery', 'matrix polynomials', 'matrix norm bounds']"
14930,1511.00321,Cunsheng Ding,Cunsheng Ding,A Construction of Binary Linear Codes from Boolean Functions,"arXiv admin note: text overlap with arXiv:1503.06511; text overlap
  with arXiv:1505.07726 by other authors",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Boolean functions have important applications in cryptography and coding
theory. Two famous classes of binary codes derived from Boolean functions are
the Reed-Muller codes and Kerdock codes. In the past two decades, a lot of
progress on the study of applications of Boolean functions in coding theory has
been made. Two generic constructions of binary linear codes with Boolean
functions have been well investigated in the literature. The objective of this
paper is twofold. The first is to provide a survey on recent results, and the
other is to propose open problems on one of the two generic constructions of
binary linear codes with Boolean functions. These open problems are expected to
stimulate further research on binary linear codes from Boolean functions.
","[{'version': 'v1', 'created': 'Sun, 1 Nov 2015 22:18:58 GMT'}]",2015-11-23,"[['Ding', 'Cunsheng', '']]","['Almost bent functions', 'bent functions', 'difference sets', 'linear codes', 'semibentfunctions', 'o-polynomials']"
14931,0803.1443,Robert Shour,Robert Shour,"Lexical growth, entropy and the benefits of networking","About 27 pages, double spaced; v3 changes remarks on zeroth
  generation in proposition 8, and makes some minor changes to wording and
  spelling; v4 is intended to correct remarks relating to glottochronology",,,,cs.IT math.IT q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  If each node of an idealized network has an equal capacity to efficiently
exchange benefits, then the network's capacity to use energy is scaled by the
average amount of energy required to connect any two of its nodes. The scaling
factor equals \textit{e}, and the network's entropy is $\ln(n)$. Networking
emerges in consequence of nodes minimizing the ratio of their energy use to the
benefits obtained for such use, and their connectability. Networking leads to
nested hierarchical clustering, which multiplies a network's capacity to use
its energy to benefit its nodes. Network entropy multiplies a node's capacity.
For a real network in which the nodes have the capacity to exchange benefits,
network entropy may be estimated as $C \log_L(n)$, where the base of the log is
the path length $L$, and $C$ is the clustering coefficient. Since $n$, $L$ and
$C$ can be calculated for real networks, network entropy for real networks can
be calculated and can reveal aspects of emergence and also of economic,
biological, conceptual and other networks, such as the relationship between
rates of lexical growth and divergence, and the economic benefit of adding
customers to a commercial communications network. \textit{Entropy dating} can
help estimate the age of network processes, such as the growth of hierarchical
society and of language.
","[{'version': 'v1', 'created': 'Mon, 10 Mar 2008 15:46:20 GMT'}, {'version': 'v2', 'created': 'Sun, 30 Mar 2008 18:50:27 GMT'}, {'version': 'v3', 'created': 'Mon, 12 May 2008 14:33:46 GMT'}, {'version': 'v4', 'created': 'Thu, 31 Dec 2009 19:49:52 GMT'}]",2009-12-31,"[['Shour', 'Robert', '']]","['emergence', 'energy scaling', 'entropy', 'glottochronology', 'lexical growth', 'Metcalfe’s Law', 'networks']"
14932,1701.02660,Ruxandra Valentina Bobiti,"R.V. Bobiti, M. Lazar",Towards parallelizable sampling-based Nonlinear Model Predictive Control,"9 pages, 9 pictures, submitted to IFAC World Congress 2017",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a new sampling-based nonlinear model predictive control
(MPC) algorithm, with a bound on complexity quadratic in the prediction horizon
N and linear in the number of samples. The idea of the proposed algorithm is to
use the sequence of predicted inputs from the previous time step as a warm
start, and to iteratively update this sequence by changing its elements one by
one, starting from the last predicted input and ending with the first predicted
input. This strategy, which resembles the dynamic programming principle, allows
for parallelization up to a certain level and yields a suboptimal nonlinear MPC
algorithm with guaranteed recursive feasibility, stability and improved cost
function at every iteration, which is suitable for real-time implementation.
The complexity of the algorithm per each time step in the prediction horizon
depends only on the horizon, the number of samples and parallel threads, and it
is independent of the measured system state. Comparisons with the fmincon
nonlinear optimization solver on benchmark examples indicate that as the
simulation time progresses, the proposed algorithm converges rapidly to the
""optimal"" solution, even when using a small number of samples.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2017 16:11:52 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Jan 2017 15:16:56 GMT'}]",2017-01-13,"[['Bobiti', 'R. V.', ''], ['Lazar', 'M.', '']]","['suboptimal nonlinear predictive control', 'sampling–based optimization', 'embedded modelpredictive control', 'dynamic programming', 'constrained control']"
14933,1412.2624,Petru Valicov,"Julien Bensmail (LIP), Aur\'elie Lagoutte (LIP), Petru Valicov (LIF)","Strong edge-coloring of $(3, \Delta)$-bipartite graphs",,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A strong edge-coloring of a graph $G$ is an assignment of colors to edges
such that every color class induces a matching. We here focus on bipartite
graphs whose one part is of maximum degree at most $3$ and the other part is of
maximum degree $\Delta$. For every such graph, we prove that a strong
$4\Delta$-edge-coloring can always be obtained. Together with a result of
Steger and Yu, this result confirms a conjecture of Faudree, Gy\'arf\'as,
Schelp and Tuza for this class of graphs.
","[{'version': 'v1', 'created': 'Mon, 8 Dec 2014 15:51:01 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Aug 2015 07:37:17 GMT'}]",2015-08-19,"[['Bensmail', 'Julien', '', 'LIP'], ['Lagoutte', 'Aurélie', '', 'LIP'], ['Valicov', 'Petru', '', 'LIF']]","['Strong edge-coloring', 'bipartite graphs', 'complexity']"
14934,1401.6686,Siamak Ravanbakhsh,"Siamak Ravanbakhsh, Russell Greiner",Perturbed Message Passing for Constraint Satisfaction Problems,,"JMLR 16(Jul):1249-1274, 2015",,,cs.AI cs.CC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce an efficient message passing scheme for solving Constraint
Satisfaction Problems (CSPs), which uses stochastic perturbation of Belief
Propagation (BP) and Survey Propagation (SP) messages to bypass decimation and
directly produce a single satisfying assignment. Our first CSP solver, called
Perturbed Blief Propagation, smoothly interpolates two well-known inference
procedures; it starts as BP and ends as a Gibbs sampler, which produces a
single sample from the set of solutions. Moreover we apply a similar
perturbation scheme to SP to produce another CSP solver, Perturbed Survey
Propagation. Experimental results on random and real-world CSPs show that
Perturbed BP is often more successful and at the same time tens to hundreds of
times more efficient than standard BP guided decimation. Perturbed BP also
compares favorably with state-of-the-art SP-guided decimation, which has a
computational complexity that generally scales exponentially worse than our
method (wrt the cardinality of variable domains and constraints). Furthermore,
our experiments with random satisfiability and coloring problems demonstrate
that Perturbed SP can outperform SP-guided decimation, making it the best
incomplete random CSP-solver in difficult regimes.
","[{'version': 'v1', 'created': 'Sun, 26 Jan 2014 20:32:35 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Jan 2015 00:05:44 GMT'}, {'version': 'v3', 'created': 'Tue, 3 Feb 2015 00:13:28 GMT'}]",2016-01-05,"[['Ravanbakhsh', 'Siamak', ''], ['Greiner', 'Russell', '']]","['Constraint Satisfaction Problem', 'Message Passing', 'Belief Propagation', 'SurveyPropagation', 'Gibbs Sampling', 'Decimation']"
14935,1610.03798,Alessandro Chiesa,"Eli Ben-Sasson and Alessandro Chiesa and Michael A. Forbes and Ariel
  Gabizon and Michael Riabzev and Nicholas Spooner",On Probabilistic Checking in Perfect Zero Knowledge,,,,,cs.CC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the first constructions of single-prover proof systems that
achieve perfect zero knowledge (PZK) for languages beyond NP, under no
intractability assumptions:
  1. The complexity class #P has PZK proofs in the model of Interactive PCPs
(IPCPs) [KR08], where the verifier first receives from the prover a PCP and
then engages with the prover in an Interactive Proof (IP).
  2. The complexity class NEXP has PZK proofs in the model of Interactive
Oracle Proofs (IOPs) [BCS16,RRR16], where the verifier, in every round of
interaction, receives a PCP from the prover.
  Our constructions rely on succinct simulators that enable us to ""simulate
beyond NP"", achieving exponential savings in efficiency over [BCGV16]. These
simulators crucially rely on solving a problem that lies at the intersection of
coding theory, linear algebra, and computational complexity, which we call the
succinct constraint detection problem, and consists of detecting dual
constraints with polynomial support size for codes of exponential block length.
Our two results rely on solutions to this problem for fundamental classes of
linear codes:
  * An algorithm to detect constraints for Reed--Muller codes of exponential
length.
  * An algorithm to detect constraints for PCPs of Proximity of Reed--Solomon
codes [BS08] of exponential degree.
  The first algorithm exploits the Raz--Shpilka [RS05] deterministic polynomial
identity testing algorithm, and shows, to our knowledge, a first connection of
algebraic complexity theory with zero knowledge. Along the way, we give a
perfect zero knowledge analogue of the celebrated sumcheck protocol [LFKN92],
by leveraging both succinct constraint detection and low-degree testing. The
second algorithm exploits the recursive structure of the PCPs of Proximity to
show that small-support constraints are ""locally"" spanned by a small number of
small-support constraints.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2016 17:39:55 GMT'}]",2016-10-13,"[['Ben-Sasson', 'Eli', ''], ['Chiesa', 'Alessandro', ''], ['Forbes', 'Michael A.', ''], ['Gabizon', 'Ariel', ''], ['Riabzev', 'Michael', ''], ['Spooner', 'Nicholas', '']]","['probabilistically checkable proofs', 'interactive proofs', 'sumcheck', 'zero knowledge', 'polynomial identity testing']"
14936,1210.0408,Arpit Sharma,Arpit Sharma,A Two Step Perspective for Kripke Structure Reduction,"Accepted for Student Research Forum, 39th International Conference on
  Current Trends in Theory and Practice of Computer Science (SOFSEM 2013)",,,,cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel theoretical framework for the state space
reduction of Kripke structures. We define two equivalence relations, Kripke
minimization equivalence (KME) and weak Kripke minimization equivalence (WKME).
We define the quotient system under these relations and show that these
relations are strictly coarser than strong (bi)simulation and
divergence-sensitive stutter (bi)simulation, respectively. We prove that the
quotient system obtained under KME and WKME preserves linear-time and
stutter-insensitive linear-time properties. Finally, we show that KME is
compositional w.r.t. synchronous parallel composition.
","[{'version': 'v1', 'created': 'Mon, 1 Oct 2012 14:06:21 GMT'}]",2012-10-02,"[['Sharma', 'Arpit', '']]","['Kripke structure', 'bisimulation', 'linear-time property', 'divergence-sensitiverelation', 'synchronous parallel composition']"
14937,1504.04420,Manjunath M,"Manjunath M, Manjaiah D.H",PAR: Petal ant routing algorithm for mobile ad hoc network,"14 Pages, 17 figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During route discovery of mobile ad hoc network, broadcasting of route
request and route reply packets are the essential operations for finding the
path between two ends. In such situations, intermediate node which may or may
not belongs will participate in route discovery process, update routing table
and rebroadcast the route discovery packets again to its neighboring nodes.
Finally optimal path is found with minimum hops. This simply upsurges overhead
and deteriorates the performance of routing. The proposed Petal Ant Routing
(PAR) algorithm offers a low overhead by optimizing FANT and BANT transmissions
in route discover process. The algorithm is an improved version of SARA and has
features extracted from petal routing. The algorithm is simulated on NS2,
compared with ACO frame work called SARA and classical routing protocols such
as AODV and AOMDV. The simulation results shows that PAR further reduces
overhead by eliminating redundant FANT transmission compared to other routing
algorithm.
","[{'version': 'v1', 'created': 'Thu, 16 Apr 2015 05:08:32 GMT'}]",2015-04-20,"[['M', 'Manjunath', ''], ['H', 'Manjaiah D.', '']]","['PAR', 'Petal routing', 'SARA', 'Ant based routing', 'MANET  1']"
14938,1106.0346,Rumi Ghosh,"Rumi Ghosh, Tawan Surachawala and Kristina Lerman",Entropy-based Classification of 'Retweeting' Activity on Twitter,snakdd-11(submitted),,,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Twitter is used for a variety of reasons, including information
dissemination, marketing, political organizing and to spread propaganda,
spamming, promotion, conversations, and so on. Characterizing these activities
and categorizing associated user generated content is a challenging task. We
present a information-theoretic approach to classification of user activity on
Twitter. We focus on tweets that contain embedded URLs and study their
collective `retweeting' dynamics. We identify two features, time-interval and
user entropy, which we use to classify retweeting activity. We achieve good
separation of different activities using just these two features and are able
to categorize content based on the collective user response it generates.
  We have identified five distinct categories of retweeting activity on
Twitter: automatic/robotic activity, newsworthy information dissemination,
advertising and promotion, campaigns, and parasitic advertisement. In the
course of our investigations, we have shown how Twitter can be exploited for
promotional and spam-like activities. The content-independent, entropy-based
activity classification method is computationally efficient, scalable and
robust to sampling and missing data. It has many applications, including
automatic spam-detection, trend identification, trust management,
user-modeling, social search and content classification on online social media.
","[{'version': 'v1', 'created': 'Thu, 2 Jun 2011 00:13:32 GMT'}]",2011-06-03,"[['Ghosh', 'Rumi', ''], ['Surachawala', 'Tawan', ''], ['Lerman', 'Kristina', '']]","['Twitter', 'dynamics', 'classification', 'entropy']"
14939,1110.3189,Anatoly Plotnikov D.,Anatoly D. Plotnikov,About set-theoretic properties of one-way functions,5 pages,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the problem of cryptanalysis as a problem belonging to the
class NP. A class of problems UF is defined for which the time constructing any
feasible solution is polynomial. The properties of the problems of NP, which
may be one-way functions, are established.
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2011 12:35:24 GMT'}]",2015-03-19,"[['Plotnikov', 'Anatoly D.', '']]","['Class P', 'class NP', 'class UF', 'one-way function']"
14940,1310.1442,Cunsheng Ding,Cunsheng Ding and Zhengchun Zhou,Binary Cyclic Codes from Explicit Polynomials over $\gf(2^m)$,"arXiv admin note: substantial text overlap with arXiv:1206.4687,
  arXiv:1206.4370",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cyclic codes are a subclass of linear codes and have applications in consumer
electronics, data storage systems, and communication systems as they have
efficient encoding and decoding algorithms. In this paper, monomials and
trinomials over finite fields with even characteristic are employed to
construct a number of families of binary cyclic codes. Lower bounds on the
minimum weight of some families of the cyclic codes are developed. The minimum
weights of other families of the codes constructed in this paper are
determined. The dimensions of the codes are flexible. Some of the codes
presented in this paper are optimal or almost optimal in the sense that they
meet some bounds on linear codes. Open problems regarding binary cyclic codes
from monomials and trinomials are also presented.
","[{'version': 'v1', 'created': 'Sat, 5 Oct 2013 05:14:07 GMT'}]",2013-10-08,"[['Ding', 'Cunsheng', ''], ['Zhou', 'Zhengchun', '']]","['Polynomials', 'permutation polynomials', 'cyclic codes', 'linear span', 'sequences']"
14941,1312.2325,Meiappane  Aroumougame,"A. Meiappane, V. Prasanna Venkatesan, V. Jegatheeswari, B. Kalpana and
  U. Sarumathy",Pattern Based Adaptive Architecture for Internet Banking,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pattern plays a vital role in software architecture and it is a general
reusable solution to commonly occurring problem. Software architecture of a
system is the set of structures needed to reason about the system, which
comprise software elements, relations among them, and properties of both.
Patterns can be implemented at run-time; they identify key resource constraints
and best practices. Architecture Pattern expresses a fundamental structural
organization or schema for software systems. Patterns in software architecture,
offer the promise of helping the architect to identify combinations of
Architecture or Solution Building Blocks that have been proven to deliver
effective solutions. In Internet banking, we analyzed some attributes such as
reliability, security, availability, load balancing and so on. The use of
patterns, which is of a reusable component, is a good tool to help designers
build load balancing systems. In this paper we are going to propose pattern
based adaptive architecture for internet banking system and so the above
attributes can be improved by the usage of patterns.
","[{'version': 'v1', 'created': 'Mon, 9 Dec 2013 07:23:19 GMT'}]",2013-12-10,"[['Meiappane', 'A.', ''], ['Venkatesan', 'V. Prasanna', ''], ['Jegatheeswari', 'V.', ''], ['Kalpana', 'B.', ''], ['Sarumathy', 'U.', '']]","['Software Architecture', 'patterns', 'Internet Banking', 'Framework']"
14942,1412.8324,Haoxiang Lin,Haoxiang Lin,A Constructive Proof on the Compositionality of Linearizability,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linearizability is the strongest correctness property for both shared memory
and message passing systems. One of its useful features is the
compositionality: a history (execution) is linearizable if and only if each
object (component) subhistory is linearizable. In this paper, we propose a new
hierarchical system model to address challenges in modular development of cloud
systems. Object are defined by induction from the most fundamental atomic
Boolean registers, and histories are represented as countable well-ordered
structures of events to deal with both finite and infinite executions. Then, we
present a new constructive proof on the compositionality theorem of
linearizability inspired by Multiway Merge. This proof deduces a theoretically
efficient algorithm which generates linearization in O(N*logP) running time
with O(N) space, where P and N are process/event numbers respectively.
","[{'version': 'v1', 'created': 'Mon, 29 Dec 2014 12:50:42 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Mar 2015 06:56:09 GMT'}, {'version': 'v3', 'created': 'Thu, 8 Feb 2018 05:50:06 GMT'}]",2018-02-09,"[['Lin', 'Haoxiang', '']]","['linearizability', 'compositionality', 'execution history', 'well-ordered structure']"
14943,1702.00948,Javlon Isomurodov,"Javlon E. Isomurodov and Alexander A. Loboda and Alexey A.
  Sergushichev",Ranking vertices for active module recovery problem,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Selecting a connected subnetwork enriched in individually important vertices
is an approach commonly used in many areas of bioinformatics, including
analysis of gene expression data, mutations, metabolomic profiles and others.
It can be formulated as a recovery of an active module from which an
experimental signal is generated. Commonly, methods for solving this problem
result in a single subnetwork that is considered to be a good candidate.
However, it is usually useful to consider not one but multiple candidate
modules at different significance threshold levels. Therefore, in this paper we
suggest to consider a problem of finding a vertex ranking instead of finding a
single module. We also propose two algorithms for solving this problem: one
that we consider to be optimal but computationally expensive for real-world
networks and one that works close to the optimal in practice and is also able
to work with big networks.
","[{'version': 'v1', 'created': 'Fri, 3 Feb 2017 09:55:07 GMT'}]",2017-02-06,"[['Isomurodov', 'Javlon E.', ''], ['Loboda', 'Alexander A.', ''], ['Sergushichev', 'Alexey A.', '']]","['active module', 'vertex ranking', 'dynamic programming', 'integer linear programming', 'connected subgraphs']"
14944,1401.7612,Radek Erban,"Jake P. Taylor-King, Benjamin Franz, Christian A. Yates and Radek
  Erban",Mathematical Modelling of Turning Delays in Swarm Robotics,Submitted to the IMA Journal of Applied Mathematics,,,,cs.RO cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the effect of turning delays on the behaviour of groups of
differential wheeled robots and show that the group-level behaviour can be
described by a transport equation with a suitably incorporated delay. The
results of our mathematical analysis are supported by numerical simulations and
experiments with e-puck robots. The experimental quantity we compare to our
revised model is the mean time for robots to find the target area in an unknown
environment. The transport equation with delay better predicts the mean time to
find the target than the standard transport equation without delay.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2014 03:54:46 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Oct 2014 03:16:40 GMT'}]",2014-10-02,"[['Taylor-King', 'Jake P.', ''], ['Franz', 'Benjamin', ''], ['Yates', 'Christian A.', ''], ['Erban', 'Radek', '']]","['Velocity jump process', 'Swarm robotics', 'Transport equation with delay']"
14945,1312.3532,Leon Abdillah,Dedi Rianto Rahadi and Leon Andretti Abdillah,"The utilization of social networking as promotion media (Case study:
  Handicraft business in Palembang)","SESINDO2013 conference. Seminar Nasional Sistem Informasi Indonesia
  (SESINDO), Bali, December 2013",,,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays social media (Twitter, Facebook, etc.), not only simply as
communication media, but also for promotion. Social networking media offers
many business benefits for companies and organizations. Research purposes is to
determine the model of social network media utilization as a promotional media
for handicraft business in Palembang city. Qualitative and quantitative
research design are used to know how handicraft business in Palembang city
utilizing social media networking as a promotional media. The research results
show 35% craft businesses already utilizing social media as a promotional
media. The social media used are blog development 15%, facebook 46%, and
twitter etc. are 39%. The reasons they use social media such as, 1) minimal
cost, 2) easily recognizable, 3) global distribution areas. Social media
emphasis on direct engagement with customers better. So that the marketing
method could be more personal through direct communication with customers.
","[{'version': 'v1', 'created': 'Thu, 12 Dec 2013 16:22:12 GMT'}]",2013-12-13,"[['Rahadi', 'Dedi Rianto', ''], ['Abdillah', 'Leon Andretti', '']]","['social media networking', 'marketing/promotions', 'business gifts']"
14946,1107.2087,Carlos Viegas Dam\'asio,"Przemyslaw Woznowski, Alun Preece",Rule-Based Semantic Sensing,"Proceedings of the Doctoral Consortium and Poster Session of the 5th
  International Symposium on Rules (RuleML 2011@IJCAI), pages 9-16
  (arXiv:1107.1686)",,,RuleML-DC/2011/02,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rule-Based Systems have been in use for decades to solve a variety of
problems but not in the sensor informatics domain. Rules aid the aggregation of
low-level sensor readings to form a more complete picture of the real world and
help to address 10 identified challenges for sensor network middleware. This
paper presents the reader with an overview of a system architecture and a pilot
application to demonstrate the usefulness of a system integrating rules with
sensor middleware.
","[{'version': 'v1', 'created': 'Mon, 11 Jul 2011 18:50:19 GMT'}]",2015-03-19,"[['Woznowski', 'Przemyslaw', ''], ['Preece', 'Alun', '']]","['RBS', 'SNM', 'RFID', 'rules', 'tracking', 'sensors', 'JESS', 'GSN']"
14947,1409.3512,Udaya Raj Dhungana,"Udaya Raj Dhungana, Subarna Shakya, Kabita Baral and Bharat Sharma",Word Sense Disambiguation using WSD specific Wordnet of Polysemy Words,,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new model of WordNet that is used to disambiguate the
correct sense of polysemy word based on the clue words. The related words for
each sense of a polysemy word as well as single sense word are referred to as
the clue words. The conventional WordNet organizes nouns, verbs, adjectives and
adverbs together into sets of synonyms called synsets each expressing a
different concept. In contrast to the structure of WordNet, we developed a new
model of WordNet that organizes the different senses of polysemy words as well
as the single sense words based on the clue words. These clue words for each
sense of a polysemy word as well as for single sense word are used to
disambiguate the correct meaning of the polysemy word in the given context
using knowledge based Word Sense Disambiguation (WSD) algorithms. The clue word
can be a noun, verb, adjective or adverb.
","[{'version': 'v1', 'created': 'Wed, 10 Sep 2014 19:01:18 GMT'}]",2014-09-12,"[['Dhungana', 'Udaya Raj', ''], ['Shakya', 'Subarna', ''], ['Baral', 'Kabita', ''], ['Sharma', 'Bharat', '']]","['Word Sense Disambiguation', 'WordNet', 'Polysemy Words', 'Synset', 'Hypernymy', 'Context word', 'Clue Words']"
14948,1409.4081,Carlo Nicola,"Markus Knecht, Willi Meier, and Carlo U. Nicola","A space- and time-efficient Implementation of the Merkle Tree Traversal
  Algorithm","19 pages, 6 figures, 2 tables",,,,cs.CR cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an algorithm for the Merkle tree traversal problem which combines
the efficient space-time trade-off from the fractal Merkle tree [3] and the
space efficiency from the improved log space-time Merkle trees traversal [8].
We give an exhaustive analysis of the space and time efficiency of our
algorithm in function of the parameters H (the height of the Merkle tree) and h
(h = H L where L is the number of levels in the Merkle tree). We also analyze
the space impact when a continuous deterministic pseudo-random number generator
(PRNG) is used to generate the leaves. We further program a low storage-space
and a low time-overhead version of the algorithm in Java and measure its
performance with respect to the two different implementations cited above. Our
implementation uses the least space when a continuous PRNG is used for the leaf
calculation.
","[{'version': 'v1', 'created': 'Sun, 14 Sep 2014 17:41:33 GMT'}]",2014-09-16,"[['Knecht', 'Markus', ''], ['Meier', 'Willi', ''], ['Nicola', 'Carlo U.', '']]","['Merkle tree traversal', 'Authentication path computation', 'Merkle signatures']"
14949,0910.1471,Rdv Ijcsis,"M Dakshayini, T R GopalaKrishnan Nair","Prefix based Chaining Scheme for Streaming Popular Videos using Proxy
  servers in VoD","9 pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 5, No. 1, pp. 135-143, September 2009, USA",,ISSN 1947 5500,cs.MM cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Streaming high quality videos consumes significantly large amount of network
resources. In this context request to service delay, network traffic,
congestion and server overloading are the main parameters to be considered in
video streaming over the internet that effect the quality of service (QoS). In
this paper, we propose an efficient architecture as a cluster of proxy servers
and clients that uses a peer to peer (P2P) approach to cooperatively stream the
video using chaining technique. We consider the following two key issues in the
proposed architecture (1) Prefix caching technique to accommodate more number
of videos close to client (2) Cooperative client and proxy chaining to achieve
the network efficiency. Our simulation results shows that the proposed approach
yields a prefix caching close to the optimal solution minimizing WAN bandwidth
usage on server-proxy path by utilizing the proxy-client and client-client path
bandwidth, which is much cheaper than the expensive server proxy path
bandwidth, server load, and client rejection ratio significantly using
chaining.
","[{'version': 'v1', 'created': 'Thu, 8 Oct 2009 11:26:01 GMT'}]",2009-10-09,"[['Dakshayini', 'M', ''], ['Nair', 'T R GopalaKrishnan', '']]","['component prefix caching', 'cooperative clients', 'video streaming', 'bandwidth usage', 'Chaining']"
14950,1207.5138,Raja Jitendra Nayaka Mr.,"Raja Jitendra Nayaka, R. C. Biradar",Ethernet Packet Processor for SoC Application,"The International Workshop Of Information Technology, Control And
  Automation (Itca-2012), Sl.No.27. Proceedings In Computer Science &
  Information Technology (Cs & It) Series",,,ReportNo27,cs.AR cs.NI,http://creativecommons.org/licenses/by/3.0/,"  As the demand for Internet expands significantly in numbers of users,
servers, IP addresses, switches and routers, the IP based network architecture
must evolve and change. The design of domain specific processors that require
high performance, low power and high degree of programmability is the
bottleneck in many processor based applications. This paper describes the
design of ethernet packet processor for system-on-chip (SoC) which performs all
core packet processing functions, including segmentation and reassembly,
packetization classification, route and queue management which will speedup
switching/routing performance. Our design has been configured for use with
multiple projects ttargeted to a commercial configurable logic device the
system is designed to support 10/100/1000 links with a speed advantage. VHDL
has been used to implement and simulated the required functions in FPGA.
","[{'version': 'v1', 'created': 'Sat, 21 Jul 2012 13:47:55 GMT'}]",2012-07-24,"[['Nayaka', 'Raja Jitendra', ''], ['Biradar', 'R. C.', '']]","['Ethernet', 'SoC', 'FPGA', 'LAN Router and Switches', 'IP networks.   1. INTRODUCTION']"
14951,1602.07558,Maitham Alhubail,"Maitham Makki Alhubail, Qiqi Wang, John Williams","The swept rule for breaking the latency barrier in time advancing
  two-dimensional PDEs",,,,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article describes a method to accelerate parallel, explicit time
integration of two-dimensional unsteady PDEs. The method is motivated by our
observation that latency, not bandwidth, often limits how fast PDEs can be
solved in parallel. The method is called the swept rule of space-time domain
decomposition. Compared to conventional, space-only domain decomposition, it
communicates similar amount of data, but in fewer messages. The swept rule
achieves this by decomposing space and time among computing nodes in ways that
exploit the domains of influence and the domain of dependency, making it
possible to communicate once per many time steps with no redundant computation.
By communicating less often, the swept rule effectively breaks the latency
barrier, advancing on average more than one time step per ping-pong latency of
the network. The article presents simple theoretical analysis to the
performance of the swept rule in two spatial dimensions, and supports the
analysis with numerical experiments.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2016 17:42:36 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Nov 2016 17:00:21 GMT'}]",2016-11-08,"[['Alhubail', 'Maitham Makki', ''], ['Wang', 'Qiqi', ''], ['Williams', 'John', '']]","['Swept rule 2D', 'Numerical solution of PDE', 'latency', 'Domain']"
14952,1710.04044,"Bj\""orn Ross","Stefan Stieglitz, Florian Brachten, Bj\""orn Ross and Anna-Katharina
  Jung","Do Social Bots Dream of Electric Sheep? A Categorisation of Social Media
  Bot Accounts","Accepted for publication in the Proceedings of the Australasian
  Conference on Information Systems, 2017",,,,cs.HC cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  So-called 'social bots' have garnered a lot of attention lately. Previous
research showed that they attempted to influence political events such as the
Brexit referendum and the US presidential elections. It remains, however,
somewhat unclear what exactly can be understood by the term 'social bot'. This
paper addresses the need to better understand the intentions of bots on social
media and to develop a shared understanding of how 'social' bots differ from
other types of bots. We thus describe a systematic review of publications that
researched bot accounts on social media. Based on the results of this
literature review, we propose a scheme for categorising bot accounts on social
media sites. Our scheme groups bot accounts by two dimensions - Imitation of
human behaviour and Intent.
","[{'version': 'v1', 'created': 'Wed, 11 Oct 2017 13:02:05 GMT'}]",2017-10-12,"[['Stieglitz', 'Stefan', ''], ['Brachten', 'Florian', ''], ['Ross', 'Björn', ''], ['Jung', 'Anna-Katharina', '']]","['social bots', 'social media', 'categorisation', 'bots']"
14953,0806.1931,Anne Broadbent,Anne Broadbent and Alain Tapp,Information-Theoretically Secure Voting Without an Honest Majority,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present three voting protocols with unconditional privacy and
information-theoretic correctness, without assuming any bound on the number of
corrupt voters or voting authorities. All protocols have polynomial complexity
and require private channels and a simultaneous broadcast channel. Our first
protocol is a basic voting scheme which allows voters to interact in order to
compute the tally. Privacy of the ballot is unconditional, but any voter can
cause the protocol to fail, in which case information about the tally may
nevertheless transpire. Our second protocol introduces voting authorities which
allow the implementation of the first protocol, while reducing the interaction
and limiting it to be only between voters and authorities and among the
authorities themselves. The simultaneous broadcast is also limited to the
authorities. As long as a single authority is honest, the privacy is
unconditional, however, a single corrupt authority or a single corrupt voter
can cause the protocol to fail. Our final protocol provides a safeguard against
corrupt voters by enabling a verification technique to allow the authorities to
revoke incorrect votes. We also discuss the implementation of a simultaneous
broadcast channel with the use of temporary computational assumptions, yielding
versions of our protocols achieving everlasting security.
","[{'version': 'v1', 'created': 'Wed, 11 Jun 2008 18:51:04 GMT'}]",2008-06-12,"[['Broadbent', 'Anne', ''], ['Tapp', 'Alain', '']]","['multiparty computation', 'election protocol', 'dining cryptographers', 'information-theoretic security', 'election authorities', 'ballot verification']"
14954,1011.1478,Velimir Ilic,"Velimir M. Ilic, Dejan I. Mancev, Branimir T. Todorovic, Miomir S.
  Stankovic","Gradient Computation In Linear-Chain Conditional Random Fields Using The
  Entropy Message Passing Algorithm","11 pages, 2 tables, 3 figures, 2 algorithms",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper proposes a numerically stable recursive algorithm for the exact
computation of the linear-chain conditional random field gradient. It operates
as a forward algorithm over the log-domain expectation semiring and has the
purpose of enhancing memory efficiency when applied to long observation
sequences. Unlike the traditional algorithm based on the forward-backward
recursions, the memory complexity of our algorithm does not depend on the
sequence length. The experiments on real data show that it can be useful for
the problems which deal with long sequences.
","[{'version': 'v1', 'created': 'Fri, 5 Nov 2010 18:41:03 GMT'}, {'version': 'v2', 'created': 'Wed, 30 May 2012 13:46:56 GMT'}]",2012-05-31,"[['Ilic', 'Velimir M.', ''], ['Mancev', 'Dejan I.', ''], ['Todorovic', 'Branimir T.', ''], ['Stankovic', 'Miomir S.', '']]","['conditional random fields', 'expectation semiring', 'forward-backward algorithm', 'gradient computation', 'graphicalmodels', 'message passing', 'sum-product algorithm']"
14955,1606.08893,Christopher Whidden,Chris Whidden and Frederick A. Matsen IV,"Efficiently Inferring Pairwise Subtree Prune-and-Regraft Adjacencies
  between Phylogenetic Trees","21 pages, 3 figures. Revised in response to peer review",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop a time-optimal $O(mn^2)$-time algorithm to construct the subtree
prune-regraft (SPR) graph on a collection of m phylogenetic trees with n
leaves. This improves on the previous bound of $O(mn^3)$. Such graphs are used
to better understand the behaviour of phylogenetic methods and recommend
parameter choices and diagnostic criteria. The limiting factor in these
analyses has been the difficulty in constructing such graphs for large numbers
of trees. We also develop the first efficient algorithms for constructing the
nearest-neighbor interchange (NNI) and tree bisection-and-reconnection (TBR)
graphs
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2016 21:23:04 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Nov 2016 00:57:50 GMT'}, {'version': 'v3', 'created': 'Wed, 26 Apr 2017 19:19:25 GMT'}]",2017-04-28,"[['Whidden', 'Chris', ''], ['Matsen', 'Frederick A.', 'IV']]","['phylogenetics', 'subtree prune-and-regraft', 'agreement forest', 'discrete optimization']"
14956,1301.0550,Ayesha R. Ali,"Ayesha R. Ali, Thomas S. Richardson",Markov Equivalence Classes for Maximal Ancestral Graphs,"Appears in Proceedings of the Eighteenth Conference on Uncertainty in
  Artificial Intelligence (UAI2002)",,,UAI-P-2002-PG-1-9,cs.AI stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ancestral graphs are a class of graphs that encode conditional independence
relations arising in DAG models with latent and selection variables,
corresponding to marginalization and conditioning. However, for any ancestral
graph, there may be several other graphs to which it is Markov equivalent. We
introduce a simple representation of a Markov equivalence class of ancestral
graphs, thereby facilitating model search. \ More specifically, we define a
join operation on ancestral graphs which will associate a unique graph with a
Markov equivalence class. We also extend the separation criterion for ancestral
graphs (which is an extension of d-separation) and provide a proof of the
pairwise Markov property for joined ancestral graphs.
","[{'version': 'v1', 'created': 'Wed, 12 Dec 2012 15:55:00 GMT'}]",2013-01-07,"[['Ali', 'Ayesha R.', ''], ['Richardson', 'Thomas S.', '']]","['maximal ancestral graphs', 'joined graphs', 'Markov equivalence', 'DAG models', 'latent and selection variables']"
14957,1501.01387,Blel Ilhem,Ilhem Blel and Ridha Bouallegue,Alamouti OFDM/OQAM systems with time reversal technique,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Orthogonal Frequency Division Multiplexing with Offset Quadrature Amplitude
Modulation (OFDM/OQAM) is a multicarrier modulation scheme that can be
considered as an alternative to the conventional Orthogonal Frequency Division
Multiplexing (OFDM) with Cyclic Prefix (CP) for transmission over multipath
fading channels. In this paper, we investigate the combination of the OFDM/OQAM
with Alamouti system with Time Reversal (TR) technique. TR can be viewed as a
precoding scheme which can be combined with OFDM/OQAM and easily carried out in
a Multiple Input Single Output (MISO) context such as Alamouti system. We
present the simulation results of the performance of OFDM/OQAM system in SISO
case compared with the conventional CP-OFDM system and the performance of the
combination Alamouti OFDM/OQAM with TR compared to Alamouti CP-OFDM. The
performance is derived by computing the Bit Error Rate (BER) as a function of
the transmit signal-to-noise ratio (SNR).
","[{'version': 'v1', 'created': 'Wed, 7 Jan 2015 08:09:44 GMT'}]",2015-01-08,"[['Blel', 'Ilhem', ''], ['Bouallegue', 'Ridha', '']]","['OFDM/OQAM', 'Alamouti', 'OSTBC', 'Time Reversal']"
14958,1307.3174,David Coyle Dr,"David Coyle, Mark Matthews, Gavin Doherty and John Sharry",Engaging with mental health: a global challenge,"4 pages, published at the Workshop on Interactive Systems in
  Healthcare 2010 at ACM CHI 2010",,,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using the metrics of the World Health Organisation, the Global Burden of
Disease Study has found that mental health difficulties are currently the
leading cause of disability in developed countries [1]. Projections also
indicate that the global burden of mental health difficulties will continue to
rise in the coming decades. The human and economic costs of this trend will be
substantial. In this paper we discuss how effectively designed interactive
systems, developed through collaborative, interdisciplinary efforts, can play a
significant role in helping to address this challenge. Our discussion is
grounded in a description of four exploratory systems, each of which has
undergone initial clinical evaluations. Directions for future research on
mental health technologies are also identified.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2013 16:35:58 GMT'}]",2013-07-12,"[['Coyle', 'David', ''], ['Matthews', 'Mark', ''], ['Doherty', 'Gavin', ''], ['Sharry', 'John', '']]","['Mental health', 'collaborative design', 'interactive systems']"
14959,1704.04587,Markus Haltmeier,"Stephan Antholzer, Markus Haltmeier, and Johannes Schwab",Deep Learning for Photoacoustic Tomography from Sparse Data,,,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The development of fast and accurate image reconstruction algorithms is a
central aspect of computed tomography. In this paper, we investigate this issue
for the sparse data problem in photoacoustic tomography (PAT). We develop a
direct and highly efficient reconstruction algorithm based on deep learning. In
our approach image reconstruction is performed with a deep convolutional neural
network (CNN), whose weights are adjusted prior to the actual image
reconstruction based on a set of training data. The proposed reconstruction
approach can be interpreted as a network that uses the PAT filtered
backprojection algorithm for the first layer, followed by the U-net
architecture for the remaining layers. Actual image reconstruction with deep
learning consists in one evaluation of the trained CNN, which does not require
time consuming solution of the forward and adjoint problems. At the same time,
our numerical results demonstrate that the proposed deep learning approach
reconstructs images with a quality comparable to state of the art iterative
approaches for PAT from sparse data.
","[{'version': 'v1', 'created': 'Sat, 15 Apr 2017 05:33:32 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Aug 2017 06:22:48 GMT'}, {'version': 'v3', 'created': 'Thu, 30 Aug 2018 13:45:40 GMT'}]",2018-08-31,"[['Antholzer', 'Stephan', ''], ['Haltmeier', 'Markus', ''], ['Schwab', 'Johannes', '']]","['Photoacoustic tomography', 'sparse data', 'image reconstruction', 'deep learning', 'convolutional neural networks', 'inverse problems']"
14960,1307.2457,Roxana Bujack,Roxana Bujack and Gerik Scheuermann and Eckhard Hitzer,"Detection of Outer Rotations on 3D-Vector Fields with Iterative
  Geometric Correlation and its Efficiency","accepted for publication in Advances in Applied Clifford Algebras,
  (2013). arXiv admin note: substantial text overlap with arXiv:1306.2195",,,,cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Correlation is a common technique for the detection of shifts. Its
generalization to the multidimensional geometric correlation in Clifford
algebras has been proven a useful tool for color image processing, because it
additionally contains information about a rotational misalignment. But so far
the exact correction of a three-dimensional outer rotation could only be
achieved in certain special cases. In this paper we prove that applying the
geometric correlation iteratively has the potential to detect the outer
rotational misalignment for arbitrary three-dimensional vector fields. We
further present the explicit iterative algorithm, analyze its efficiency
detecting the rotational misalignment in the color space of a color image. The
experiments suggest a method for the acceleration of the algorithm, which is
practically tested with great success.
","[{'version': 'v1', 'created': 'Mon, 10 Jun 2013 14:18:38 GMT'}]",2013-07-10,"[['Bujack', 'Roxana', ''], ['Scheuermann', 'Gerik', ''], ['Hitzer', 'Eckhard', '']]","['geometric algebra', 'Clifford algebra', 'registration', 'outer rotation', 'correlation', 'iteration', 'color image processing']"
14961,1110.1590,Chaiyut Jandaeng Chaiyut Jandaeng,"C. Jandaeng, W. Suntiamontut, N. Elz",PSA: The Packet Scheduling Algorithm for Wireless Sensor Networks,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The main cause of wasted energy consumption in wireless sensor networks is
packet collision. The packet scheduling algorithm is therefore introduced to
solve this problem. Some packet scheduling algorithms can also influence and
delay the data transmitting in the real-time wireless sensor networks. This
paper presents the packet scheduling algorithm (PSA) in order to reduce the
packet congestion in MAC layer leading to reduce the overall of packet
collision in the system The PSA is compared with the simple CSMA/CA and other
approaches using network topology benchmarks in mathematical method. The
performances of our PSA are better than the standard (CSMA/CA). The PSA
produces better throughput than other algorithms. On other hand, the average
delay of PSA is higher than previous works. However, the PSA utilizes the
channel better than all algorithms.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2011 17:19:47 GMT'}]",2011-10-10,"[['Jandaeng', 'C.', ''], ['Suntiamontut', 'W.', ''], ['Elz', 'N.', '']]","['packet collision', 'packet scheduling algorithm', 'wireless sensor networks']"
14962,1205.4234,Dmitry Lande,D. V. Lande,"Visualization of features of a series of measurements with
  one-dimensional cellular structure","4 pages, russian language",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the method of visualization of periodic constituents and
instability areas in series of measurements, being based on the algorithm of
smoothing out and concept of one-dimensional cellular automata. A method can be
used at the analysis of temporal series, related to the volumes of thematic
publications in web-space.
","[{'version': 'v1', 'created': 'Sat, 19 May 2012 08:16:21 GMT'}, {'version': 'v2', 'created': 'Fri, 25 May 2012 10:24:35 GMT'}]",2012-05-28,"[['Lande', 'D. V.', '']]","['series of measurements', 'visualization', 'smoothing', 'cellular automata', 'instability area']"
14963,1306.1519,Laurent Signac,Laurent Signac (LAII),Lattice Gas Symmetric Cryptography,,,,,cs.CR nlin.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lattice gas cellular automata (Lgca) are particular cellular automata that
imitate the behavior of par- ticles moving on a lattice. We used a particular
set of Lgca rules, called hpp, to mix bits in data blocks and obtain a
symmetric cryptographic algorithm. The encryption and decryption keys are the
positions of perturbation sites on the lattice (walls). Basically, this paper
presents an original way to perform cryp- tographic operations, based on
cellular automata. In this paper, we show several characteristics about our
algorithm: typical block size (2^(2n-1) ), key-length (2^n ), number of rounds
(2^(n+1) ). We also evaluate avalanche and strict avalanche properties with
respect to key and plain text. Finally, we highlight the underbellies of our
method and give clues to solve them.
","[{'version': 'v1', 'created': 'Thu, 6 Jun 2013 19:26:04 GMT'}]",2013-06-07,"[['Signac', 'Laurent', '', 'LAII']]","['cryptography', 'cellular automata', 'lattice gas', 'block cipher']"
14964,1710.03303,Mohammad Reza Amini,"Mohammad Reza Amini, Mahdi Shahbakhti","Design of an SI Engine Cold Start Controller based on Dynamic Coupling
  Analysis","22 pages, 10 figures, 2017 International Conference on Advanced
  Vehicle Powertrains",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the dynamic couplings among different inputs and outputs of a
highly nonlinear spark ignition (SI) engine control problem during the cold
start phase are evaluated by using relative gain array (RGA) technique. First,
based on the experimental data, a multi-input multi-output model is developed
to represent the engine dynamics. Second, the coupling among different inputs
and outputs of the model is evaluated by using RGA technique in both open-loop
and closed-loop structures. The results show that although there is an internal
coupling within the engine dynamics in the open-loop framework, the closed-loop
engine controller can be designed using a decentralized structure without
significantly affecting the system performance. In the next step, based on a
nonlinear physics-based model of the engine, a set of single-input
single-output (SISO) adaptive second order discrete sliding mode controllers
(DSMC) are designed to drive the states of the engine model to their
pre-defined desired trajectories and minimize the tailpipe HC emission, under
modelling and implementation (data sampling and quantization) uncertainties.
The real-time test results on an actual engine control unit (ECU) show that the
proposed SISO adaptive second order DSMC provides accurate and fast tracking
performance for the highly nonlinear and internally coupled engine dynamics,
and can meet the HC emission limit by controlling the engine-out emissions and
exhaust catalytic converter efficiency.
","[{'version': 'v1', 'created': 'Mon, 9 Oct 2017 20:34:28 GMT'}]",2017-10-11,"[['Amini', 'Mohammad Reza', ''], ['Shahbakhti', 'Mahdi', '']]","['Sliding Mode Control', 'Dynamic Coupling', 'Relative Gain Array', 'Engine Cold Start Control']"
14965,1009.5718,Sameer Tilak,"Roland Kays, Sameer Tilak, Bart Kranstauber, Patrick A. Jansen, Chris
  Carbone, Marcus J. Rowcliffe, Tony Fountain, Jay Eggert, Zhihai He","Monitoring wild animal communities with arrays of motion sensitive
  camera traps",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Studying animal movement and distribution is of critical importance to
addressing environmental challenges including invasive species, infectious
diseases, climate and land-use change. Motion sensitive camera traps offer a
visual sensor to record the presence of a broad range of species providing
location -specific information on movement and behavior. Modern digital camera
traps that record video present new analytical opportunities, but also new data
management challenges. This paper describes our experience with a terrestrial
animal monitoring system at Barro Colorado Island, Panama. Our camera network
captured the spatio-temporal dynamics of terrestrial bird and mammal activity
at the site - data relevant to immediate science questions, and long-term
conservation issues. We believe that the experience gained and lessons learned
during our year long deployment and testing of the camera traps as well as the
developed solutions are applicable to broader sensor network applications and
are valuable for the advancement of the sensor network research. We suggest
that the continued development of these hardware, software, and analytical
tools, in concert, offer an exciting sensor-network solution to monitoring of
animal populations which could realistically scale over larger areas and time
spans.
","[{'version': 'v1', 'created': 'Tue, 28 Sep 2010 22:52:06 GMT'}]",2010-09-30,"[['Kays', 'Roland', ''], ['Tilak', 'Sameer', ''], ['Kranstauber', 'Bart', ''], ['Jansen', 'Patrick A.', ''], ['Carbone', 'Chris', ''], ['Rowcliffe', 'Marcus J.', ''], ['Fountain', 'Tony', ''], ['Eggert', 'Jay', ''], ['He', 'Zhihai', '']]","['Sensor networks', 'camera traps', 'animal monitoring']"
14966,1602.08730,David Harris,David G. Harris and Aravind Srinivasan,Improved bounds and algorithms for graph cuts and network reliability,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Karger (SIAM Journal on Computing, 1999) developed the first fully-polynomial
approximation scheme to estimate the probability that a graph $G$ becomes
disconnected, given that its edges are removed independently with probability
$p$. This algorithm runs in $n^{5+o(1)} \epsilon^{-3}$ time to obtain an
estimate within relative error $\epsilon$.
  We improve this run-time through algorithmic and graph-theoretic advances.
First, there is a certain key sub-problem encountered by Karger, for which a
generic estimation procedure is employed, we show that this has a special
structure for which a much more efficient algorithm can be used. Second, we
show better bounds on the number of edge cuts which are likely to fail. Here,
Karger's analysis uses a variety of bounds for various graph parameters, we
show that these bounds cannot be simultaneously tight. We describe a new graph
parameter, which simultaneously influences all the bounds used by Karger, and
obtain much tighter estimates of the cut structure of $G$. These techniques
allow us to improve the runtime to $n^{3+o(1)} \epsilon^{-2}$, our results also
rigorously prove certain experimental observations of Karger & Tai (Proc.
ACM-SIAM Symposium on Discrete Algorithms, 1997). Our rigorous proofs are
motivated by certain non-rigorous differential-equation approximations which,
however, provably track the worst-case trajectories of the relevant parameters.
  A key driver of Karger's approach (and other cut-related results) is a bound
on the number of small cuts: we improve these estimates when the min-cut size
is ""small"" and odd, augmenting, in part, a result of Bixby (Bulletin of the
AMS, 1974).
","[{'version': 'v1', 'created': 'Sun, 28 Feb 2016 15:32:20 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Dec 2016 22:46:48 GMT'}, {'version': 'v3', 'created': 'Thu, 22 Dec 2016 14:47:01 GMT'}, {'version': 'v4', 'created': 'Sat, 8 Jul 2017 20:04:51 GMT'}, {'version': 'v5', 'created': 'Fri, 4 Aug 2017 23:07:24 GMT'}]",2017-08-08,"[['Harris', 'David G.', ''], ['Srinivasan', 'Aravind', '']]","['Graph reliability', 'graph cuts', 'contraction algorithm']"
14967,1009.2314,Ajay Prasad,"Ajay Prasad, Sandeep Chaurasia, Arjun Singh, Deepak Gour",Mapping Cloud Computing onto Useful e-Governance,,"""Mapping Cloud Computing onto Useful e-Governance""; International
  Journal of Computer Science and Information Security (IJCSIS), Vol. 8, No. 5,
  2010",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most of the services viewed in context to grid and cloud computing are mostly
confined to services that are available for intellectual purposes. The grid or
cloud computing are large scale distributed systems. The essence of large scale
distribution can only be realized if the services are rendered to common man.
The only organization which has exposure to almost every single resident is the
respective governments in every country. As the size of population increases so
the need for a larger purview arises. The problem of having a large purview can
be solved by means of large scale grid for online services. The government
services can be rendered through fully customized Service-oriented Clouds. In
this paper we are presenting tight similarities between generic government
functioning and the service oriented grid/cloud approach. Also, we will discuss
the major issues in establishing services oriented grids for governmental
organization.
","[{'version': 'v1', 'created': 'Mon, 13 Sep 2010 07:36:47 GMT'}]",2010-09-14,"[['Prasad', 'Ajay', ''], ['Chaurasia', 'Sandeep', ''], ['Singh', 'Arjun', ''], ['Gour', 'Deepak', '']]","['Grid  computing', 'cloud  computing', 'service oriented grids', 'e-governance', 'SOA', 'CMMS']"
14968,1003.2749,Jinwoo Shin,"Devavrat Shah, Jinwoo Shin",Efficient Queue-based CSMA with Collisions,,,,,cs.IT cs.NI math.IT math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently there has been considerable interest in the design of efficient
carrier sense multiple access(CSMA) protocol for wireless network. The basic
assumption underlying recent results is availability of perfect carrier sense
information. This allows for design of continuous time algorithm under which
collisions are avoided. The primary purpose of this note is to show how these
results can be extended in the case when carrier sense information may not be
perfect, or equivalently delayed. Specifically, an adaptation of algorithm in
Rajagopalan, Shah, Shin (2009) is presented here for time slotted setup with
carrier sense information available only at the end of the time slot. To
establish its throughput optimality, in additon to method developed in
Rajagopalan, Shah, Shin (2009), understanding properties of stationary
distribution of a certain non-reversible Markov chain as well as bound on its
mixing time is essential. This note presents these key results. A longer
version of this note will provide detailed account of how this gets
incorporated with methods of Rajagopalan, Shah, Shin (2009) to provide the
positive recurrence of underlying network Markov process. In addition, these
results will help design optimal rate control in conjunction with CSMA in
presence of collision building upon the method of Jiang, Shah, Shin, Walrand
(2009).
","[{'version': 'v1', 'created': 'Sun, 14 Mar 2010 00:19:27 GMT'}]",2010-03-16,"[['Shah', 'Devavrat', ''], ['Shin', 'Jinwoo', '']]","['Wireless Medium Access', 'Buffered Circuit Switched Network', 'Aloha', 'Stability', 'Scheduling', 'Mixing time', 'Slowly Varying Markov Chain']"
14969,1511.08403,Vera Weil,Oliver Schaudt and Vera Weil,"On bounding the difference between the maximum degree and the chromatic
  number by a constant","10 pages, 4 figures",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide a finite forbidden induced subgraph characterization for the graph
class $\varUpsilon_k$, for all $k \in \mathbb{N}_0$, which is defined as
follows. A graph is in $\varUpsilon_k$ if for any induced subgraph, $\Delta
\leq \chi -1 + k$ holds, where $\Delta$ is the maximum degree and $\chi$ is the
chromatic number of the subgraph.
  We compare these results with those given in [O. Schaudt, V. Weil, On
bounding the difference between the maximum degree and the clique number,
Graphs and Combinatorics 31(5), 1689-1702 (2015). DOI:
10.1007/s00373-014-1468-3], where we studied the graph class $\varOmega_k$, for
$k \in \mathbb{N}_0$, whose graphs are such that for any induced subgraph,
$\Delta \leq \omega -1 + k$ holds, where $\omega$ denotes the clique number of
a graph. In particular, we give a characterization in terms of $\varOmega_k$
and $\varUpsilon_k$ of those graphs where the neighborhood of every vertex is
perfect.
","[{'version': 'v1', 'created': 'Thu, 26 Nov 2015 14:39:29 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Dec 2015 13:36:24 GMT'}, {'version': 'v3', 'created': 'Tue, 13 Sep 2016 14:00:24 GMT'}]",2016-09-14,"[['Schaudt', 'Oliver', ''], ['Weil', 'Vera', '']]","['maximum degree', 'graph coloring', 'chromatic number', 'structuralcharacterization of families of graphs', 'hereditary graph class', 'neighborhoodperfect graphs']"
14970,1401.4568,Petru Valicov,"Julien Bensmail (LaBRI), Ararat Harutyunyan (MI), Herv\'e Hocquard
  (LaBRI), Petru Valicov (LIP)",Strong edge-colouring of sparse planar graphs,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A strong edge-colouring of a graph is a proper edge-colouring where each
colour class induces a matching. It is known that every planar graph with
maximum degree $\Delta$ has a strong edge-colouring with at most $4\Delta+4$
colours. We show that $3\Delta+1$ colours suffice if the graph has girth 6, and
$4\Delta$ colours suffice if $\Delta\geq 7$ or the girth is at least 5. In the
last part of the paper, we raise some questions related to a long-standing
conjecture of Vizing on proper edge-colouring of planar graphs.
","[{'version': 'v1', 'created': 'Sat, 18 Jan 2014 17:11:56 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Jan 2014 13:21:02 GMT'}, {'version': 'v3', 'created': 'Mon, 21 Jul 2014 16:32:19 GMT'}]",2014-07-22,"[['Bensmail', 'Julien', '', 'LaBRI'], ['Harutyunyan', 'Ararat', '', 'MI'], ['Hocquard', 'Hervé', '', 'LaBRI'], ['Valicov', 'Petru', '', 'LIP']]","['planar graphs', 'girth', 'proper edge-colouring', 'strong edge-colouring']"
14971,1312.6410,H.R.  Chennamma,H.R. Chennamma and Xiaohui Yuan,A Survey on Eye-Gaze Tracking Techniques,"6 pages, Journal","Indian Journal of Computer Science and Engineering, ISSN :
  0976-5166, Vol. 4, No. 5, Oct-Nov 2013, pp. 388-393",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Study of eye-movement is being employed in Human Computer Interaction (HCI)
research. Eye - gaze tracking is one of the most challenging problems in the
area of computer vision. The goal of this paper is to present a review of
latest research in this continued growth of remote eye-gaze tracking. This
overview includes the basic definitions and terminologies, recent advances in
the field and finally the need of future development in the field.
","[{'version': 'v1', 'created': 'Sun, 22 Dec 2013 18:04:54 GMT'}]",2013-12-24,"[['Chennamma', 'H. R.', ''], ['Yuan', 'Xiaohui', '']]","['Remote eye-gaze tracking', 'Single and Multi-camera eye tracker', 'Video oculography']"
14972,1707.09611,"Dilek K\""u\c{c}\""uk","Dilek K\""u\c{c}\""uk",Joint Named Entity Recognition and Stance Detection in Tweets,5 pages,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Named entity recognition (NER) is a well-established task of information
extraction which has been studied for decades. More recently, studies reporting
NER experiments on social media texts have emerged. On the other hand, stance
detection is a considerably new research topic usually considered within the
scope of sentiment analysis. Stance detection studies are mostly applied to
texts of online debates where the stance of the text owner for a particular
target, either explicitly or implicitly mentioned in text, is explored. In this
study, we investigate the possible contribution of named entities to the stance
detection task in tweets. We report the evaluation results of NER experiments
as well as that of the subsequent stance detection experiments using named
entities, on a publicly-available stance-annotated data set of tweets. Our
results indicate that named entities obtained with a high-performance NER
system can contribute to stance detection performance on tweets.
","[{'version': 'v1', 'created': 'Sun, 30 Jul 2017 11:34:40 GMT'}]",2017-08-01,"[['Küçük', 'Dilek', '']]","['stance detection', 'named entity recognition', 'social media analysis', 'tweets', 'SVM']"
14973,1003.1827,Rdv Ijcsis,"Vidhi Rawat, Alok Jain, Vibhakar Shrimali",Investigation and Assessment of Disorder of Ultrasound B-mode Images,"Pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS, Vol. 7 No. 2, February 2010, USA. ISSN 1947
  5500, http://sites.google.com/site/ijcsis/",,,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Digital image plays a vital role in the early detection of cancers, such as
prostate cancer, breast cancer, lungs cancer, cervical cancer. Ultrasound
imaging method is also suitable for early detection of the abnormality of
fetus. The accurate detection of region of interest in ultrasound image is
crucial. Since the result of reflection, refraction and deflection of
ultrasound waves from different types of tissues with different acoustic
impedance. Usually, the contrast in ultrasound image is very low and weak edges
make the image difficult to identify the fetus region in the ultrasound image.
So the analysis of ultrasound image is more challenging one. We try to develop
a new algorithmic approach to solve the problem of non clarity and find
disorder of it. Generally there is no common enhancement approach for noise
reduction. This paper proposes different filtering techniques based on
statistical methods for the removal of various noise. The quality of the
enhanced images is measured by the statistical quantity measures:
Signal-to-Noise Ratio (SNR), Peak Signal-to-Noise Ratio (PSNR), and Root Mean
Square Error (RMSE).
","[{'version': 'v1', 'created': 'Tue, 9 Mar 2010 08:13:37 GMT'}]",2022-04-21,"[['Rawat', 'Vidhi', ''], ['Jain', 'Alok', ''], ['Shrimali', 'Vibhakar', '']]","['fetus image', 'Signal-to-Noise Ratio (SNR)', 'Peak Signal-to-Noise Ratio (PSNR)', 'Root Mean Square Error (RMSE)']"
14974,1511.07100,Boris Brimkov,Boris Brimkov,A reduction of the logspace shortest path problem to biconnected graphs,9 pages,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we reduce the logspace shortest path problem to biconnected
graphs; in particular, we present a logspace shortest path algorithm for
general graphs which uses a logspace shortest path oracle for biconnected
graphs. We also present a linear time logspace shortest path algorithm for
graphs with bounded vertex degree and biconnected component size, which does
not rely on an oracle. The asymptotic time-space product of this algorithm is
the best possible among all shortest path algorithms.
","[{'version': 'v1', 'created': 'Mon, 23 Nov 2015 02:55:46 GMT'}]",2015-11-24,"[['Brimkov', 'Boris', '']]","['logspace algorithm', 'shortest path', 'biconnected graph', 'boundeddegree']"
14975,1707.09123,Yong Wang,"Yong Wang, Huai-yu Wu","Research on Shape Mapping of 3D Mesh Models based on Hidden Markov
  Random Field and EM Algorithm",,,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  How to establish the matching (or corresponding) between two different 3D
shapes is a classical problem. This paper focused on the research on shape
mapping of 3D mesh models, and proposed a shape mapping algorithm based on
Hidden Markov Random Field and EM algorithm, as introducing a hidden state
random variable associated with the adjacent blocks of shape matching when
establishing HMRF. This algorithm provides a new theory and method to ensure
the consistency of the edge data of adjacent blocks, and the experimental
results show that the algorithm in this paper has a great improvement on the
shape mapping of 3D mesh models.
","[{'version': 'v1', 'created': 'Fri, 28 Jul 2017 07:03:29 GMT'}]",2017-07-31,"[['Wang', 'Yong', ''], ['Wu', 'Huai-yu', '']]","['Shape Mapping', '3D Mesh Model', 'Hidden Markov Random Field', 'EM Algorithm']"
14976,0906.4680,Olivier Passalacqua,"Eric Benoit (LISTIC), Marc-Philippe Huget (LISTIC), Patrice Moreaux
  (LISTIC), Olivier Passalacqua (LISTIC)",Reconfiguration of Distributed Information Fusion System ? A case study,6 pages - Preprint version,"Workshop on Dependable Control of Discrete Systems, Bari : Italie
  (2009)",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information Fusion Systems are now widely used in different fusion contexts,
like scientific processing, sensor networks, video and image processing. One of
the current trends in this area is to cope with distributed systems. In this
context, we have defined and implemented a Dynamic Distributed Information
Fusion System runtime model. It allows us to cope with dynamic execution
supports while trying to maintain the functionalities of a given Dynamic
Distributed Information Fusion System. The paper presents our system, the
reconfiguration problems we are faced with and our solutions.
","[{'version': 'v1', 'created': 'Thu, 25 Jun 2009 12:35:57 GMT'}]",2009-06-26,"[['Benoit', 'Eric', '', 'LISTIC'], ['Huget', 'Marc-Philippe', '', 'LISTIC'], ['Moreaux', 'Patrice', '', 'LISTIC'], ['Passalacqua', 'Olivier', '', 'LISTIC']]","['Availability', 'Data fusion', 'Decision making', 'Discrete-event dynamic systems', 'Performanceevaluation', 'Run-time systems']"
14977,1609.05524,Roy Fox,"Roy Fox, Michal Moshkovitz and Naftali Tishby",Principled Option Learning in Markov Decision Processes,,13th European Workshop on Reinforcement Learning (EWRL 2016),,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is well known that options can make planning more efficient, among their
many benefits. Thus far, algorithms for autonomously discovering a set of
useful options were heuristic. Naturally, a principled way of finding a set of
useful options may be more promising and insightful. In this paper we suggest a
mathematical characterization of good sets of options using tools from
information theory. This characterization enables us to find conditions for a
set of options to be optimal and an algorithm that outputs a useful set of
options and illustrate the proposed algorithm in simulation.
","[{'version': 'v1', 'created': 'Sun, 18 Sep 2016 18:19:02 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Nov 2016 22:51:15 GMT'}, {'version': 'v3', 'created': 'Thu, 30 Mar 2017 05:04:42 GMT'}]",2018-02-01,"[['Fox', 'Roy', ''], ['Moshkovitz', 'Michal', ''], ['Tishby', 'Naftali', '']]","['Reinforcement Learning', 'Option Learning', 'Markov Decision Process', 'Information Theory']"
14978,1111.6539,Mehdi Sookhak Mehdi Sookhak,"Mehdi sookhak, Ramin Karimi, Mahboobeh Haghparast, Ismail Fauzi ISnin",Secure Geographic Routing Protocols: Issues and Approaches,8 pages,"International Journal of Computer Science Issues 8(4): 382-389
  (2011)",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the years, routing protocols in wireless sensor networks (WSN) have been
substantially investigated by researches. Most state-of-the-art surveys have
focused on reviewing of wireless sensor network .In this paper we review the
existing secure geographic routing protocols for wireless sensor network (WSN)
and also provide a qualitative comparison of them.
","[{'version': 'v1', 'created': 'Mon, 28 Nov 2011 18:37:19 GMT'}]",2011-11-29,"[['sookhak', 'Mehdi', ''], ['Karimi', 'Ramin', ''], ['Haghparast', 'Mahboobeh', ''], ['ISnin', 'Ismail Fauzi', '']]","['Wireless Sensor Network', 'Sensor', 'Geographic Routing']"
14979,1106.3634,Vladimir Berezovsky,Vladimir Berezovsky and Alexander Popov,"Strategies for Development of a Distributed Framework for Computational
  Sciences","11 pages, 2 figures",,,,cs.DC physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses some generic approach for developing grid-based
framework for enabling establishment of workflows comprising existing software
in computational sciences areas. We highlight the main requirements addressed
the developing of such framework. Some strategies for enabling interoperability
between convenient computation software in the grid environment has been shown.
The UML based instruments of graphical description of workflows for the
developing system has been suggested.
","[{'version': 'v1', 'created': 'Sat, 18 Jun 2011 10:26:39 GMT'}]",2011-06-21,"[['Berezovsky', 'Vladimir', ''], ['Popov', 'Alexander', '']]","['Grid', 'distributed\xa0computing', 'computational\xa0science', 'simulation', 'workflow', 'interoperability']"
14980,1610.01209,Anastasia Moumtzidou,"Anastasia Moumtzidou, Symeon Papadopoulos, Stefanos Vrochidis, Ioannis
  Kompatsiaris, Konstantinos Kourtidis, George Hloupis, Ilias Stavrakas,
  Konstantina Papachristopoulou, and Christodoulos Keratidis","Towards Air Quality Estimation Using Collected Multimodal Environmental
  Data",,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an open platform, which collects multimodal environmental
data related to air quality from several sources including official open
sources, social media and citizens. Collecting and fusing different sources of
air quality data into a unified air quality indicator is a highly challenging
problem, leveraging recent advances in image analysis, open hardware, machine
learning and data fusion and is expected to result in increased geographical
coverage and temporal granularity of air quality data.
","[{'version': 'v1', 'created': 'Mon, 3 Oct 2016 09:07:51 GMT'}]",2016-10-06,"[['Moumtzidou', 'Anastasia', ''], ['Papadopoulos', 'Symeon', ''], ['Vrochidis', 'Stefanos', ''], ['Kompatsiaris', 'Ioannis', ''], ['Kourtidis', 'Konstantinos', ''], ['Hloupis', 'George', ''], ['Stavrakas', 'Ilias', ''], ['Papachristopoulou', 'Konstantina', ''], ['Keratidis', 'Christodoulos', '']]","['environmental data', 'air quality', 'multimodal', 'collection']"
14981,1404.0119,Jinesh Machchhar,"Bharat Adsul, Jinesh Machchhar, Milind Sohoni",A Computational Framework for Boundary Representation of Solid Sweeps,,,,,cs.CG cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a robust algorithmic and computational framework to
address the problem of modeling the volume obtained by sweeping a solid along a
trajectory of rigid motions. The boundary representation (simply brep) of the
input solid naturally induces a brep of the swept volume. We show that it is
locally similar to the input brep and this serves as the basis of the
framework. All the same, it admits several intricacies: (i) geometric, in terms
of parametrizations and, (ii) topological, in terms of orientations. We provide
a novel analysis for their resolution. More specifically, we prove a
non-trivial lifting theorem which allows to locally orient the output using the
orientation of the input. We illustrate the framework by providing many
examples from a pilot implementation.
","[{'version': 'v1', 'created': 'Tue, 1 Apr 2014 03:44:22 GMT'}]",2014-04-02,"[['Adsul', 'Bharat', ''], ['Machchhar', 'Jinesh', ''], ['Sohoni', 'Milind', '']]","['Solid sweep', 'swept volume', 'solid modeling', 'boundary representation', 'parametric curves andsurfaces']"
14982,1111.2077,Mathilde Noual,Mathilde Noual and Sylvain Sen\'e,"Towards a theory of modelling with Boolean automata networks - I.
  Theorisation and observations",,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although models are built on the basis of some observations of reality, the
concepts that derive theoretically from their definitions as well as from their
characteristics and properties are not necessarily direct consequences of these
initial observations. Indeed, many of them rather follow from chains of
theoretical inferences that are only based on the precise model definitions and
rely strongly, in addition, on some consequential working hypotheses. Thus, it
is important to address the question of which features of a model effectively
carry some modelling meaning and which only result from the task of formalising
observations of reality into a mathematical language. In this article, we
address this question with a theoretical point view that sets our discussion
strictly between the two stages of the modelling process that require knowledge
of real systems, that is, between the initial stage that chooses a global
theoretical framework to build the model and the final stage that exploits its
formal predictions by comparing them to the reality that the model was designed
to simulate. Taking Boolean automata networks as instances of models of systems
observed in reality, we analyse in this setting the remaining stages of the
modelling process and we show how the meaning of theoretical concepts can
subtly rely on formal choices such as definitions and hypotheses.
","[{'version': 'v1', 'created': 'Tue, 8 Nov 2011 23:08:56 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Nov 2011 06:32:10 GMT'}]",2011-11-11,"[['Noual', 'Mathilde', ''], ['Sené', 'Sylvain', '']]","['Boolean automata network', 'update schedule', 'dynamical behaviour', 'transition graph', 'modelling', 'synchronous', 'asynchronous transitions']"
14983,1002.1143,Vishal Goyal,"Nadeem Mahmood, Aqil Burney, Kamran Ahsan",A Logical Temporal Relational Data Model,"International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 1, January 2010,
  http://ijcsi.org/articles/A-Logical-Temporal-Relational-Data-Model.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 1, January 2010,
  http://ijcsi.org/articles/A-Logical-Temporal-Relational-Data-Model.php",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Time is one of the most difficult aspects to handle in real world
applications such as database systems. Relational database management systems
proposed by Codd offer very little built-in query language support for temporal
data management. The model itself incorporates neither the concept of time nor
any theory of temporal semantics. Many temporal extensions of the relational
model have been proposed and some of them are also implemented. This paper
offers a brief introduction to temporal database research. We propose a
conceptual model for handling time varying attributes in the relational
database model with minimal temporal attributes.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 08:22:24 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Feb 2010 11:39:13 GMT'}]",2010-02-08,"[['Mahmood', 'Nadeem', ''], ['Burney', 'Aqil', ''], ['Ahsan', 'Kamran', '']]","['Temporal Data Management', 'Temporal Semantics', 'Time Varying Attributes', 'Relational Database']"
14984,1505.07493,Steve Szabo,Steve Szabo and Felix Ulmer,Duality Preserving Gray Maps for Codes over Rings,,,,,cs.IT math.IT math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a finite ring $A$ which is a free left module over a subring $R$ of
$A$, two types of $R$-bases, pseudo-self-dual bases (similar to trace
orthogonal bases) and symmetric bases, are defined which in turn are used to
define duality preserving maps from codes over $A$ to codes over $R$. Both
types of bases are generalizations of similar concepts for fields. Many
illustrative examples are given to shed light on the advantages to such
mappings as well as their abundance.
","[{'version': 'v1', 'created': 'Wed, 27 May 2015 21:14:50 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Aug 2016 20:12:00 GMT'}]",2016-08-08,"[['Szabo', 'Steve', ''], ['Ulmer', 'Felix', '']]","['Codes over Rings', 'Self-Dual Codes', 'Trace Orthogonal Basis', 'Symmetric Basis', 'Codes over Noncommutative Rings']"
14985,1208.3952,Philipp Schaer,"Philipp Schaer, Daniel Hienert, Frank Sawitzki, Andias Wira-Alam,
  Thomas L\""uke","Dealing with Sparse Document and Topic Representations: Lab Report for
  CHiC 2012","12 pages, to appear in CLEF 2012 Labs and Workshop, Notebook Papers.
  Report for the CHiC Lab: Ad-hoc Retrieval Task and Semantic Enrichment Task",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We will report on the participation of GESIS at the first CHiC workshop
(Cultural Heritage in CLEF). Being held for the first time, no prior experience
with the new data set, a document dump of Europeana with ca. 23 million
documents, exists. The most prominent issues that arose from pretests with this
test collection were the very unspecific topics and sparse document
representations. Only half of the topics (26/50) contained a description and
the titles were usually short with just around two words. Therefore we focused
on three different term suggestion and query expansion mechanisms to surpass
the sparse topical description. We used two methods that build on concept
extraction from Wikipedia and on a method that applied co-occurrence statistics
on the available Europeana corpus. In the following paper we will present the
approaches and preliminary results from their assessments.
","[{'version': 'v1', 'created': 'Mon, 20 Aug 2012 09:18:37 GMT'}]",2012-08-21,"[['Schaer', 'Philipp', ''], ['Hienert', 'Daniel', ''], ['Sawitzki', 'Frank', ''], ['Wira-Alam', 'Andias', ''], ['Lüke', 'Thomas', '']]","['Evaluation', 'Information Retrieval', 'Cultural Heritage', 'Query Expansion', 'Entity Extraction', 'Co-occurrence Analysis', 'Wikipedia']"
14986,1710.03222,Kasun Bandara,"Kasun Bandara, Christoph Bergmeir, Slawek Smyl","Forecasting Across Time Series Databases using Recurrent Neural Networks
  on Groups of Similar Series: A Clustering Approach",,,,,cs.LG cs.DB econ.EM stat.AP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the advent of Big Data, nowadays in many applications databases
containing large quantities of similar time series are available. Forecasting
time series in these domains with traditional univariate forecasting procedures
leaves great potentials for producing accurate forecasts untapped. Recurrent
neural networks (RNNs), and in particular Long Short-Term Memory (LSTM)
networks, have proven recently that they are able to outperform
state-of-the-art univariate time series forecasting methods in this context
when trained across all available time series. However, if the time series
database is heterogeneous, accuracy may degenerate, so that on the way towards
fully automatic forecasting methods in this space, a notion of similarity
between the time series needs to be built into the methods. To this end, we
present a prediction model that can be used with different types of RNN models
on subgroups of similar time series, which are identified by time series
clustering techniques. We assess our proposed methodology using LSTM networks,
a widely popular RNN variant. Our method achieves competitive results on
benchmarking datasets under competition evaluation procedures. In particular,
in terms of mean sMAPE accuracy, it consistently outperforms the baseline LSTM
model and outperforms all other methods on the CIF2016 forecasting competition
dataset.
","[{'version': 'v1', 'created': 'Mon, 9 Oct 2017 04:08:15 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Sep 2018 08:03:34 GMT'}]",2018-09-13,"[['Bandara', 'Kasun', ''], ['Bergmeir', 'Christoph', ''], ['Smyl', 'Slawek', '']]","['Big data forecasting', 'RNN', 'LSTM', 'time series clustering', 'neural networks']"
14987,1404.0649,Rafael Villanueva,"Juan-Carlos Cort\'es, Francisco-J. Santonja, Ana-C. Tarazona,
  Rafael-J. Villanueva, Javier Villanueva-Oller","A probabilistic estimation and prediction technique for dynamic
  continuous social science models: The evolution of the attitude of the Basque
  Country population towards ETA as a case study",13 pages,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a computational technique to deal with uncertainty
in dynamic continuous models in Social Sciences. Considering data from surveys,
the method consists of determining the probability distribution of the survey
output and this allows to sample data and fit the model to the sampled data
using a goodness-of-fit criterion based on the chi-square-test. Taking the
fitted parameters non-rejected by the chi-square-test, substituting them into
the model and computing their outputs, we build 95% confidence intervals in
each time instant capturing uncertainty of the survey data (probabilistic
estimation). Using the same set of obtained model parameters, we also provide a
prediction over the next few years with 95% confidence intervals (probabilistic
prediction). This technique is applied to a dynamic social model describing the
evolution of the attitude of the Basque Country population towards the
revolutionary organization ETA.
","[{'version': 'v1', 'created': 'Sun, 30 Mar 2014 20:49:33 GMT'}]",2014-04-03,"[['Cortés', 'Juan-Carlos', ''], ['Santonja', 'Francisco-J.', ''], ['Tarazona', 'Ana-C.', ''], ['Villanueva', 'Rafael-J.', ''], ['Villanueva-Oller', 'Javier', '']]","['Social dynamic models', 'Probabilistic estimation', 'Probabilisticprediction', 'Attitude dynamics']"
14988,1505.06320,St\'ephane Le Roux,Stephane Le Roux,"Infinite subgame perfect equilibrium in the Hausdorff difference
  hierarchy","The alternative definition of the difference hierarchy has changed
  slightly",,,,cs.GT math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Subgame perfect equilibria are specific Nash equilibria in perfect
information games in extensive form. They are important because they relate to
the rationality of the players. They always exist in infinite games with
continuous real-valued payoffs, but may fail to exist even in simple games with
slightly discontinuous payoffs. This article considers only games whose outcome
functions are measurable in the Hausdorff difference hierarchy of the open sets
(\textit{i.e.} $\Delta^0_2$ when in the Baire space), and it characterizes the
families of linear preferences such that every game using these preferences has
a subgame perfect equilibrium: the preferences without infinite ascending
chains (of course), and such that for all players $a$ and $b$ and outcomes
$x,y,z$ we have $\neg(z <_a y <_a x \,\wedge\, x <_b z <_b y)$. Moreover at
each node of the game, the equilibrium constructed for the proof is
Pareto-optimal among all the outcomes occurring in the subgame. Additional
results for non-linear preferences are presented.
","[{'version': 'v1', 'created': 'Sat, 23 May 2015 12:53:24 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Sep 2015 14:55:47 GMT'}]",2015-10-01,"[['Roux', 'Stephane Le', '']]","['infinite multi-player games in extensive form', 'subgame perfection', 'Borel hierarchy', 'preference characterization', 'Pareto-optimality']"
14989,1610.02468,Ajay Tanwani,"Ajay Kumar Tanwani, Sylvain Calinon",Small Variance Asymptotics for Non-Parametric Online Robot Learning,accepted in International Journal of Robotics and Research (IJRR),,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Small variance asymptotics is emerging as a useful technique for inference in
large scale Bayesian non-parametric mixture models. This paper analyses the
online learning of robot manipulation tasks with Bayesian non-parametric
mixture models under small variance asymptotics. The analysis yields a scalable
online sequence clustering (SOSC) algorithm that is non-parametric in the
number of clusters and the subspace dimension of each cluster. SOSC groups the
new datapoint in its low dimensional subspace by online inference in a
non-parametric mixture of probabilistic principal component analyzers (MPPCA)
based on Dirichlet process, and captures the state transition and state
duration information online in a hidden semi-Markov model (HSMM) based on
hierarchical Dirichlet process. A task-parameterized formulation of our
approach autonomously adapts the model to changing environmental situations
during manipulation. We apply the algorithm in a teleoperation setting to
recognize the intention of the operator and remotely adjust the movement of the
robot using the learned model. The generative model is used to synthesize both
time-independent and time-dependent behaviours by relying on the principles of
shared and autonomous control. Experiments with the Baxter robot yield
parsimonious clusters that adapt online with new demonstrations and assist the
operator in performing remote manipulation tasks.
","[{'version': 'v1', 'created': 'Sat, 8 Oct 2016 03:00:53 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Oct 2018 10:51:33 GMT'}]",2018-10-16,"[['Tanwani', 'Ajay Kumar', ''], ['Calinon', 'Sylvain', '']]","['Learning and Adaptive Systems', 'Bayesian Non-Parametrics', 'Online Learning', 'Hidden Semi-Markov Model', 'SubspaceClustering', 'Teleoperation']"
14990,1610.02633,Preslav Nakov,"Ahmad Musleh and Nadir Durrani and Irina Temnikova and Preslav Nakov
  and Stephan Vogel and Osama Alsaad",Enabling Medical Translation for Low-Resource Languages,"CICLING-2016: 17th International Conference on Intelligent Text
  Processing and Computational Linguistics, Keywords: Machine Translation,
  medical translation, doctor-patient communication, resource-poor languages,
  Hindi",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present research towards bridging the language gap between migrant workers
in Qatar and medical staff. In particular, we present the first steps towards
the development of a real-world Hindi-English machine translation system for
doctor-patient communication. As this is a low-resource language pair,
especially for speech and for the medical domain, our initial focus has been on
gathering suitable training data from various sources. We applied a variety of
methods ranging from fully automatic extraction from the Web to manual
annotation of test data. Moreover, we developed a method for automatically
augmenting the training data with synthetically generated variants, which
yielded a very sizable improvement of more than 3 BLEU points absolute.
","[{'version': 'v1', 'created': 'Sun, 9 Oct 2016 06:42:02 GMT'}]",2016-10-11,"[['Musleh', 'Ahmad', ''], ['Durrani', 'Nadir', ''], ['Temnikova', 'Irina', ''], ['Nakov', 'Preslav', ''], ['Vogel', 'Stephan', ''], ['Alsaad', 'Osama', '']]","['Machine Translation', 'medical translation', 'doctor-patientcommunication', 'resource-poor languages', 'Hindi']"
14991,1105.1226,Gintaras Barisevicius,"G. Barisevi\v{c}ius, B. Tamulynas",Multilingual lexicon design tool and database management system for MT,,"Proceedings of the 2nd Baltic Conference on Human Language
  Technologies, April 4-5, 2005, Tallin, Estonia. Tallin : Tallin University of
  Technology, 2005. ISBN 9985894839. p. 219-224",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents the design and development of English-Lithuanian-English
dictionarylexicon tool and lexicon database management system for MT. The
system is oriented to support two main requirements: to be open to the user and
to describe much more attributes of speech parts as a regular dictionary that
are required for the MT. Programming language Java and database management
system MySql is used to implement the designing tool and lexicon database
respectively. This solution allows easily deploying this system in the
Internet. The system is able to run on various OS such as: Windows, Linux, Mac
and other OS where Java Virtual Machine is supported. Since the modern lexicon
database managing system is used, it is not a problem accessing the same
database for several users.
","[{'version': 'v1', 'created': 'Fri, 6 May 2011 05:26:43 GMT'}]",2011-05-09,"[['Barisevičius', 'G.', ''], ['Tamulynas', 'B.', '']]","['lexicon', 'computer-based translation', 'Mysql', 'database managing']"
14992,1412.6065,Elmar Langetepe,"Rolf Klein (1), Elmar Langetepe (1), Christos Levcopoulos (2) ((1)
  University of Bonn, Germany, Institute of Computer Science I, (2) University
  of Lund, Sweden, Department of Computer Science)",A Fire Fighter's Problem,A preliminary version of the paper was presented at SoCG 2015,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Suppose that a circular fire spreads in the plane at unit speed. A single
fire fighter can build a barrier at speed $v>1$. How large must $v$ be to
ensure that the fire can be contained, and how should the fire fighter proceed?
We contribute two results.
  First, we analyze the natural curve $\mbox{FF}_v$ that develops when the
fighter keeps building, at speed $v$, a barrier along the boundary of the
expanding fire. We prove that the behavior of this spiralling curve is governed
by a complex function $(e^{w Z} - s \, Z)^{-1}$, where $w$ and $s$ are real
functions of $v$. For $v>v_c=2.6144 \ldots$ all zeroes are complex conjugate
pairs. If $\phi$ denotes the complex argument of the conjugate pair nearest to
the origin then, by residue calculus, the fire fighter needs $\Theta( 1/\phi)$
rounds before the fire is contained. As $v$ decreases towards $v_c$ these two
zeroes merge into a real one, so that argument $\phi$ goes to~0. Thus, curve
$\mbox{FF}_v$ does not contain the fire if the fighter moves at speed $v=v_c$.
(That speed $v>v_c$ is sufficient for containing the fire has been proposed
before by Bressan et al. [7], who constructed a sequence of logarithmic spiral
segments that stay strictly away from the fire.)
  Second, we show that any curve that visits the four coordinate half-axes in
cyclic order, and in inreasing distances from the origin, needs speed
$v>1.618\ldots$, the golden ratio, in order to contain the fire.
  Keywords: Motion Planning, Dynamic Environments, Spiralling strategies, Lower
and upper bounds
","[{'version': 'v1', 'created': 'Tue, 2 Dec 2014 10:46:13 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Apr 2016 13:14:03 GMT'}]",2016-04-18,"[['Klein', 'Rolf', ''], ['Langetepe', 'Elmar', ''], ['Levcopoulos', 'Christos', '']]","['Motion Planning', 'Dynamic Environments', 'Spiralling strategies', 'Lower and upper bounds']"
14993,1208.3802,Nisheeth Joshi,"Archana Vashisth, Iti Mathur, Nisheeth Joshi",OntoAna: Domain Ontology for Human Anatomy,"Proceedings of 5th CSI National Conference on Education and Research.
  Organized by Lingayay University, Faridabad. Sponsored by Computer Society of
  India and IEEE Delhi Chapter. Proceedings published by Lingayay University
  Press",,,,cs.AI,http://creativecommons.org/licenses/by/3.0/,"  Today, we can find many search engines which provide us with information
which is more operational in nature. None of the search engines provide domain
specific information. This becomes very troublesome to a novice user who wishes
to have information in a particular domain. In this paper, we have developed an
ontology which can be used by a domain specific search engine. We have
developed an ontology on human anatomy, which captures information regarding
cardiovascular system, digestive system, skeleton and nervous system. This
information can be used by people working in medical and health care domain.
","[{'version': 'v1', 'created': 'Sun, 19 Aug 2012 02:44:42 GMT'}]",2012-08-21,"[['Vashisth', 'Archana', ''], ['Mathur', 'Iti', ''], ['Joshi', 'Nisheeth', '']]","['Ontology Creation', 'Protégé', 'Taxonomies', 'Concept Hierarchies', 'Human Anatomy']"
14994,1307.5641,Steven Dinger Mr,"Steven Dinger, John Dickens and Adam Pantanowitz",Robotic Arm for Remote Surgery,"18 pages, 7 figures",,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advances in telecommunications have enabled surgeons to operate
remotely on patients with the use of robotics. The investigation and testing of
remote surgery using a robotic arm is presented. The robotic arm is designed to
have four degrees of freedom that track the surgeon's x, y, z positions and the
rotation angle of the forearm {\theta}. The system comprises two main
subsystems viz. the detecting and actuating systems. The detection system uses
infrared light-emitting diodes, a retroreflective bracelet and two infrared
cameras which as a whole determine the coordinates of the surgeon's forearm.
The actuation system, or robotic arm, is based on a lead screw mechanism which
can obtain a maximum speed of 0.28 m/s with a 1.5 degree/step for the
end-effector. The infrared detection and encoder resolutions are below 0.6
mm/pixel and 0.4 mm respectively, which ensures the robotic arm can operate
precisely. The surgeon is able to monitor the patient with the use of a
graphical user interface on the display computer. The lead screw system is
modelled and compared to experimentation results. The system is controlled
using a simple proportional-integrator (PI) control scheme which is implemented
on a dSpace control unit. The control design results in a rise time of less
than 0.5 s, a steady-state error of less than 1 mm and settling time of less
than 1.4 s. The system accumulates, over an extended period of time, an error
of approximately 4 mm due to inertial effects of the robotic arm. The results
show promising system performance characteristics for a relatively inexpensive
solution to a relatively advanced application.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2013 10:08:26 GMT'}]",2013-07-23,"[['Dinger', 'Steven', ''], ['Dickens', 'John', ''], ['Pantanowitz', 'Adam', '']]","['Remote surgery', 'PI controller', 'lead screw', 'optical encoder', 'infrared light emitting diode']"
14995,1412.3910,Qi Zhang,"Qi Zhang, Meizhu Li, Yuxian Du, Yong Deng",Local structure entropy of complex networks,"10 pages, 12 figures",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identifying influential nodes in the complex networks is of theoretical and
practical significance. There are many methods are proposed to identify the
influential nodes in the complex networks. In this paper, a local structure
entropy which is based on the degree centrality and the statistical mechanics
is proposed to identifying the influential nodes in the complex network.
  In the definition of the local structure entropy, each node has a local
network, the local structure entropy of each node is equal to the structure
entropy of the local network. The main idea in the local structure entropy is
try to use the influence of the local network to replace the node's influence
on the whole network.
  The influential nodes which are identified by the local structure entropy are
the intermediate nodes in the network. The intermediate nodes which connect
those nodes with a big value of degree.
  We use the $Susceptible-Infective$ (SI) model to evaluate the performance of
the influential nodes which are identified by the local structure entropy. In
the SI model the nodes use as the source of infection. According to the SI
model, the bigger the percentage of the infective nodes in the network the
important the node to the whole networks. The simulation on four real networks
show that the proposed method is efficacious and rationality to identify the
influential nodes in the complex networks.
","[{'version': 'v1', 'created': 'Fri, 12 Dec 2014 07:58:19 GMT'}]",2014-12-15,"[['Zhang', 'Qi', ''], ['Li', 'Meizhu', ''], ['Du', 'Yuxian', ''], ['Deng', 'Yong', '']]","['Complex networks', 'Structure entropy', 'Local structure entropy', 'Influential nodes', 'SI model']"
14996,1105.2171,Blerina Sinaimeri,"Tiziana Calamoneri, Rossella Petreschi and Blerina Sinaimeri",On relaxing the constraints in pairwise compatibility graphs,"12 pages, 7 figures",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A graph $G$ is called a pairwise compatibility graph (PCG) if there exists an
edge weighted tree $T$ and two non-negative real numbers $d_{min}$ and
$d_{max}$ such that each leaf $l_u$ of $T$ corresponds to a vertex $u \in V$
and there is an edge $(u,v) \in E$ if and only if $d_{min} \leq d_T (l_u, l_v)
\leq d_{max}$ where $d_T (l_u, l_v)$ is the sum of the weights of the edges on
the unique path from $l_u$ to $l_v$ in $T$. In this paper we analyze the class
of PCG in relation with two particular subclasses resulting from the the cases
where $\dmin=0$ (LPG) and $\dmax=+\infty$ (mLPG). In particular, we show that
the union of LPG and mLPG does not coincide with the whole class PCG, their
intersection is not empty, and that neither of the classes LPG and mLPG is
contained in the other. Finally, as the graphs we deal with belong to the more
general class of split matrogenic graphs, we focus on this class of graphs for
which we try to establish the membership to the PCG class.
","[{'version': 'v1', 'created': 'Wed, 11 May 2011 12:21:23 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Jun 2011 12:47:51 GMT'}]",2011-06-22,"[['Calamoneri', 'Tiziana', ''], ['Petreschi', 'Rossella', ''], ['Sinaimeri', 'Blerina', '']]","['PCG', 'leaf power graph', 'threshold graphs', 'matrogenic graphs']"
14997,1111.6822,Yihong Wu,Yihong Wu and Sergio Verd\'u,Optimal Phase Transitions in Compressed Sensing,to appear in IEEE Transactions of Information Theory,,,,cs.IT math.IT math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Compressed sensing deals with efficient recovery of analog signals from
linear encodings. This paper presents a statistical study of compressed sensing
by modeling the input signal as an i.i.d. process with known distribution.
Three classes of encoders are considered, namely optimal nonlinear, optimal
linear and random linear encoders. Focusing on optimal decoders, we investigate
the fundamental tradeoff between measurement rate and reconstruction fidelity
gauged by error probability and noise sensitivity in the absence and presence
of measurement noise, respectively. The optimal phase transition threshold is
determined as a functional of the input distribution and compared to suboptimal
thresholds achieved by popular reconstruction algorithms. In particular, we
show that Gaussian sensing matrices incur no penalty on the phase transition
threshold with respect to optimal nonlinear encoding. Our results also provide
a rigorous justification of previous results based on replica heuristics in the
weak-noise regime.
","[{'version': 'v1', 'created': 'Tue, 29 Nov 2011 14:30:08 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Jul 2012 02:36:55 GMT'}]",2012-07-12,"[['Wu', 'Yihong', ''], ['Verdú', 'Sergio', '']]","['Compressed sensing', 'Shannon theory', 'phase transition', 'R´enyi information dimension', 'MMSE dimension', 'random matrix', 'joint source-channel coding']"
14998,1705.08623,Junying Li,"Junying Li, Zichen Yang, Haifeng Liu, Deng Cai",Deep Rotation Equivariant Network,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, learning equivariant representations has attracted considerable
research attention. Dieleman et al. introduce four operations which can be
inserted into convolutional neural network to learn deep representations
equivariant to rotation. However, feature maps should be copied and rotated
four times in each layer in their approach, which causes much running time and
memory overhead. In order to address this problem, we propose Deep Rotation
Equivariant Network consisting of cycle layers, isotonic layers and decycle
layers. Our proposed layers apply rotation transformation on filters rather
than feature maps, achieving a speed up of more than 2 times with even less
memory overhead. We evaluate DRENs on Rotated MNIST and CIFAR-10 datasets and
demonstrate that it can improve the performance of state-of-the-art
architectures.
","[{'version': 'v1', 'created': 'Wed, 24 May 2017 06:22:09 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Feb 2018 07:13:48 GMT'}]",2018-03-01,"[['Li', 'Junying', ''], ['Yang', 'Zichen', ''], ['Liu', 'Haifeng', ''], ['Cai', 'Deng', '']]","['Neural network', 'Rotation equivariance', 'Deep learning']"
14999,1205.6677,Mostafa Kandil,"Mostafa Kandil, Ehab Hassanein, Sherif Mazen","Cross-View of Testing Techniques Toward Improving Web-Based Application
  Testing","7 pages, 1 figure","journal: http://www.ijcsi.org Publication year: 2012 Publication
  Volume: 9 Publication Issue: 2",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web Applications (WA's) failures may lead to collapse of the institutions,
therefore the importance of good quality WA's is increasing over the time.
Testing is one of the best quality metrics that decide whether WA's are
reliable or not. WA's testing approaches suffer from the lack of proper
coverage of WA's functional requirements testing. On the other hand some
approaches produce test cases that already cover WA's testing but they also
produce a great number of irrelevant test cases. This research analyzed the
main testing approaches for WA's and GUI applications. Also we have an overview
of Test-Driven Development and its effects on the current development. The
specification of good testing approach that satisfies the proper testing is
then presented.
","[{'version': 'v1', 'created': 'Wed, 30 May 2012 13:45:32 GMT'}]",2012-05-31,"[['Kandil', 'Mostafa', ''], ['Hassanein', 'Ehab', ''], ['Mazen', 'Sherif', '']]","['GUI Testing', 'Test Coverage', 'Test-Driven Development', 'Web Applications Testing']"
15000,1602.06484,Mark Riedl,Mark O. Riedl,"Computational Narrative Intelligence: A Human-Centered Goal for
  Artificial Intelligence","5 pages, published in the CHI 2016 Workshop on Human-Centered Machine
  Learning",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Narrative intelligence is the ability to craft, tell, understand, and respond
affectively to stories. We argue that instilling artificial intelligences with
computational narrative intelligence affords a number of applications
beneficial to humans. We lay out some of the machine learning challenges
necessary to solve to achieve computational narrative intelligence. Finally, we
argue that computational narrative is a practical step towards machine
enculturation, the teaching of sociocultural values to machines.
","[{'version': 'v1', 'created': 'Sun, 21 Feb 2016 01:59:09 GMT'}]",2016-02-23,"[['Riedl', 'Mark O.', '']]","['Artificial Intelligence', 'Machine Learning', 'NarrativeIntelligence', 'Machine Enculturation']"
15001,1606.04163,Jafar Kazemi,"Jafar Kazemi, Sadjad Ozgoli",Intracellular regulatory control of gene expression process,,,,,cs.SY q-bio.MN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an intracellular feedback control strategy, to regulate
the gene expression process dynamics. For this purpose, two types of genetic
circuits are designed in order to compare concentrations of the input
transcription factor (the desired input) and the protein produced by the
expression of target gene (process output). Genetic Relay Switch and Shifted
Subtractor are proposed and employed to design Discrete Comparator. Also,
another type of genetic comparator is presented named Bistable Comparator.
These synthetic comparators are used to produce the required amount of the
protein that activates the expression of the target gene. Numerical simulation
results, demonstrate the effectiveness of the designed controllers.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2016 22:38:33 GMT'}]",2016-06-15,"[['Kazemi', 'Jafar', ''], ['Ozgoli', 'Sadjad', '']]","['Synthetic Biology', 'Feedback Control', 'Relay Switch', 'Synthetic Comparator']"
15002,1005.3190,Isabel Rodet,Annie Luciani (ACROE),"From granular avalanches to fluid turbulences through oozing pastes. A
  mesoscopic physically-based particle model",,"Graphicon 2000, Moscou : Russian Federation (2000)",,,cs.GR physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we describe how we can precisely produce complex and various
dynamic morphological features such as structured and chaotic features which
occur in sand pilings (piles, avalanches, internal collapses, arches) , in
flowing fluids (laminar flowing, Kelvin-Helmholtz and Von Karmann eddies), and
in cohesive pastes (twist-and-turn oozing and packing) using only a single
unified model, called ""mesoscopic model"". This model is a physically-based
particle model whose behavior depends on only four simple, but easy to
understand, physically-based parameters : elasticity, viscosity and their local
areas of influence. It is fast to compute and easy to understand by
non-physicist users.
","[{'version': 'v1', 'created': 'Tue, 18 May 2010 13:10:28 GMT'}]",2010-05-31,"[['Luciani', 'Annie', '', 'ACROE']]","['Physically-based model', 'Particle modeling', 'granular material', 'fluids', 'pastes', 'matter state changes']"
15003,1107.1104,Samur Araujo,"Samur Araujo, Jan Hidders, Daniel Schwabe and Arjen P. de Vries","SERIMI - Resource Description Similarity, RDF Instance Matching and
  Interlinking",,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The interlinking of datasets published in the Linked Data Cloud is a
challenging problem and a key factor for the success of the Semantic Web.
Manual rule-based methods are the most effective solution for the problem, but
they require skilled human data publishers going through a laborious, error
prone and time-consuming process for manually describing rules mapping
instances between two datasets. Thus, an automatic approach for solving this
problem is more than welcome. In this paper, we propose a novel interlinking
method, SERIMI, for solving this problem automatically. SERIMI matches
instances between a source and a target datasets, without prior knowledge of
the data, domain or schema of these datasets. Experiments conducted with
benchmark collections demonstrate that our approach considerably outperforms
state-of-the-art automatic approaches for solving the interlinking problem on
the Linked Data Cloud.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2011 11:56:34 GMT'}]",2011-07-07,"[['Araujo', 'Samur', ''], ['Hidders', 'Jan', ''], ['Schwabe', 'Daniel', ''], ['de Vries', 'Arjen P.', '']]","['data integration', 'RDF interlinking', 'instance matching', 'linked data', 'entity recognition', 'entity search']"
15004,1212.1346,Giovanni Pighizzini,"Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki","Converting Nondeterministic Automata and Context-Free Grammars into
  Parikh Equivalent One-Way and Two-Way Deterministic Automata","30 pages, 2 figure. A preliminary version has been presented at DLT
  2012, LNCS 7410, pp. 284-295. Version 2: an example has been added in Section
  3",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the conversion of one-way nondeterministic finite automata and
context-free grammars into Parikh equivalent one-way and two-way deterministic
finite automata, from a descriptional complexity point of view.
  We prove that for each one-way nondeterministic automaton with $n$ states
there exist Parikh equivalent one-way and two-way deterministic automata with
$e^{O(\sqrt{n \ln n})}$ and $p(n)$ states, respectively, where $p(n)$ is a
polynomial. Furthermore, these costs are tight. In contrast, if all the words
accepted by the given automaton contain at least two different letters, then a
Parikh equivalent one-way deterministic automaton with a polynomial number of
states can be found.
  Concerning context-free grammars, we prove that for each grammar in Chomsky
normal form with h variables there exist Parikh equivalent one-way and two-way
deterministic automata with $2^{O(h^2)}$ and $2^{O(h)}$ states, respectively.
Even these bounds are tight.
","[{'version': 'v1', 'created': 'Thu, 6 Dec 2012 15:15:17 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Dec 2012 15:58:30 GMT'}]",2012-12-12,"[['Lavado', 'Giovanna J.', ''], ['Pighizzini', 'Giovanni', ''], ['Seki', 'Shinnosuke', '']]","['finite automaton', 'context-free grammar', 'Parikh’s theorem', 'descriptional complexity', 'semilinear set', 'Parikh equivalence']"
15005,1701.06432,Alessandro Pluchino,"A. Greco, A. Pluchino, S. Caddemi, I. Cali\`o, F. Cannizzaro","On profile reconstruction of Euler-Bernoulli beams by means of an energy
  based genetic algorithm","27 pages, 7 figures, 6 tables",Engineering with Computers 2019,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies the inverse problem related to the identification of the
flexural stiffness of an Euler Bernoulli beam in order to reconstruct its
profile starting from available response data. The proposed identification
procedure makes use of energy measurements and is based on the application of a
closed form solution for the static displacements of multi-stepped beams. This
solution allows to easily calculate the energy related to beams modeled with
arbitrary multi-step shapes subjected to a transversal roving force, and to
compare it with the correspondent data obtained through direct measurements on
real beams. The optimal solution which minimizes the difference between
measured and calculated data is then sought by means of genetic algorithms. In
the paper several different stepped beams are investigated showing that the
proposed procedure allows in many cases to identify the exact beam profile.
However it is shown that in some other cases different multi-step profiles may
correspond to very similar static responses, and therefore to comparable minima
in the optimization problem, thus complicating the profile identification
problem.
","[{'version': 'v1', 'created': 'Sat, 14 Jan 2017 08:39:00 GMT'}, {'version': 'v2', 'created': 'Sat, 6 Jul 2019 11:00:56 GMT'}]",2019-07-09,"[['Greco', 'A.', ''], ['Pluchino', 'A.', ''], ['Caddemi', 'S.', ''], ['Caliò', 'I.', ''], ['Cannizzaro', 'F.', '']]","['Beam profile', 'stiffness distribution', 'inverse problems', 'genetic algorithms', 'multi-stepped beams']"
15006,1407.1403,Prabhu Manyem,Prabhu Manyem,"Decision versions of optimization problems: cardinality constraint
  (lower bound) as a CNF Horn formula for Maximum Matching",,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide a formula for the lower bound in the form of $|F| \ge K$, in such
a way that the decision version of unweighted non-bipartite matching can be
solved in polynomial time. ~The parameter $K$ can vary from instance to
instance. We assume that the domains, the set of vertices and the set of edges,
are ordered. To our knowledge, no polynomially solvable satisfiability
expression has been developed for this problem so far, or for that matter, for
any decision problem derived from optimization. Hence for such problems, this
opens up a new approach to solving them.
","[{'version': 'v1', 'created': 'Sat, 5 Jul 2014 13:01:43 GMT'}, {'version': 'v2', 'created': 'Thu, 31 Jul 2014 12:49:40 GMT'}, {'version': 'v3', 'created': 'Fri, 17 Oct 2014 22:40:41 GMT'}, {'version': 'v4', 'created': 'Thu, 23 Oct 2014 09:51:39 GMT'}]",2014-10-24,"[['Manyem', 'Prabhu', '']]","['Computational complexity', 'Satisfiability', 'Constraint satisfaction']"
15007,1105.1702,Edward Grefenstette,Mehrnoosh Sadrzadeh and Edward Grefenstette,"A Compositional Distributional Semantics, Two Concrete Constructions,
  and some Experimental Evaluations","13 pages, to be presented at QI'11, to be published in LNCS
  (Springer)",,,,cs.CL math.CT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide an overview of the hybrid compositional distributional model of
meaning, developed in Coecke et al. (arXiv:1003.4394v1 [cs.CL]), which is based
on the categorical methods also applied to the analysis of information flow in
quantum protocols. The mathematical setting stipulates that the meaning of a
sentence is a linear function of the tensor products of the meanings of its
words. We provide concrete constructions for this definition and present
techniques to build vector spaces for meaning vectors of words, as well as that
of sentences. The applicability of these methods is demonstrated via a toy
vector space as well as real data from the British National Corpus and two
disambiguation experiments.
","[{'version': 'v1', 'created': 'Mon, 9 May 2011 15:45:03 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Jun 2011 13:18:41 GMT'}]",2011-06-08,"[['Sadrzadeh', 'Mehrnoosh', ''], ['Grefenstette', 'Edward', '']]","['Logic', 'Natural Language', 'Vector Spaces', 'Tensor Product', 'Composition', 'Distribution', 'Compact Categories', 'Pregroups']"
15008,1704.02065,Boris Brimkov,"Boris Brimkov, Caleb C. Fast, Illya V. Hicks",Computational Approaches for Zero Forcing and Related Problems,"37 pages, 4 tables; computer code available in GitHub",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose computational approaches for the zero forcing
problem, the connected zero forcing problem, and the problem of forcing a graph
within a specified number of timesteps. Our approaches are based on a
combination of integer programming models and combinatorial algorithms, and
include formulations for zero forcing as a dynamic process, and as a
set-covering problem. We explore several solution strategies for these models,
test them on various types of graphs, and show that they are competitive with
the state-of-the-art algorithm for zero forcing. Our proposed algorithms for
connected zero forcing and for controlling the number of zero forcing timesteps
are the first general-purpose computational methods for these problems, and are
superior to brute force computation.
","[{'version': 'v1', 'created': 'Fri, 7 Apr 2017 01:36:31 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Apr 2018 20:34:27 GMT'}, {'version': 'v3', 'created': 'Wed, 19 Sep 2018 06:31:14 GMT'}]",2018-09-20,"[['Brimkov', 'Boris', ''], ['Fast', 'Caleb C.', ''], ['Hicks', 'Illya V.', '']]","['Combinatorial optimization', 'zero forcing', 'integer programming', 'set-covering']"
15009,1511.08598,Vladim\'ir \v{C}un\'at,Vladim\'ir \v{C}un\'at,Predecessor problem on smooth distributions,"6 pages, to be submitted to DMTCS",,,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  We follow a research thread studying the predecessor problem on ""smooth""
distribution families. We propose a conceptually simpler solution utilizing
well-known results from much better studied variant of the problem that assumes
nothing about the input. As a side effect, we are able to extend the range of
handled input distributions for the most studied case needing expected
$\mathcal O(\log \log n)$ time, and we provide better insight into why the
related methods are faster on smooth inputs.
","[{'version': 'v1', 'created': 'Fri, 27 Nov 2015 09:54:00 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Jan 2017 21:05:55 GMT'}]",2017-01-27,"[['Čunát', 'Vladimír', '']]","['data structures', 'computational complexity', 'search tree']"
15010,0903.4036,Hassane Alla,"Abbas Dideban, Hassane Alla (GIPSA-lab)",Feedback control logic synthesis for non safe Petri nets,,"13th IFAC Symposium on INFORMATION CONTROL PROBLEMS IN
  MANUFACTURING, Moscou : Russie (2009)",,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the problem of forbidden states of non safe Petri Net
(PN) modelling discrete events systems. To prevent the forbidden states, it is
possible to use conditions or predicates associated with transitions.
Generally, there are many forbidden states, thus many complex conditions are
associated with the transitions. A new idea for computing predicates in non
safe Petri nets will be presented. Using this method, we can construct a
maximally permissive controller if it exists.
","[{'version': 'v1', 'created': 'Tue, 24 Mar 2009 08:40:33 GMT'}]",2009-03-25,"[['Dideban', 'Abbas', '', 'GIPSA-lab'], ['Alla', 'Hassane', '', 'GIPSA-lab']]","['Controller Synthesis', 'Discrete event system', 'Forbidden states', 'Petri Nets']"
15011,1504.04801,Loet Leydesdorff,Loet Leydesdorff,"Can Intellectual Processes in the Sciences Also Be Simulated? The
  Anticipation and Visualization of Possible Future States",accepted for publication in Scientometrics (June 2015),,,,cs.DL cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Socio-cognitive action reproduces and changes both social and cognitive
structures. The analytical distinction between these dimensions of structure
provides us with richer models of scientific development. In this study, I
assume that (i) social structures organize expectations into belief structures
that can be attributed to individuals and communities; (ii) expectations are
specified in scholarly literature; and (iii) intellectually the sciences
(disciplines, specialties) tend to self-organize as systems of rationalized
expectations. Whereas social organizations remain localized, academic writings
can circulate, and expectations can be stabilized and globalized using
symbolically generalized codes of communication. The intellectual
restructuring, however, remains latent as a second-order dynamics that can be
accessed by participants only reflexively. Yet, the emerging ""horizons of
meaning"" provide feedback to the historically developing organizations by
constraining the possible future states as boundary conditions. I propose to
model these possible future states using incursive and hyper-incursive
equations from the computation of anticipatory systems. Simulations of these
equations enable us to visualize the couplings among the historical--i.e.,
recursive--progression of social structures along trajectories, the
evolutionary--i.e., hyper-incursive--development of systems of expectations at
the regime level, and the incursive instantiations of expectations in actions,
organizations, and texts.
","[{'version': 'v1', 'created': 'Sun, 19 Apr 2015 06:40:11 GMT'}, {'version': 'v2', 'created': 'Fri, 29 May 2015 18:12:20 GMT'}, {'version': 'v3', 'created': 'Sat, 13 Jun 2015 07:37:39 GMT'}]",2015-06-16,"[['Leydesdorff', 'Loet', '']]","['anticipation', 'simulation', 'incursion', 'hyper-incursion', 'expectation']"
15012,1510.07250,Chathura Sarathchandra Magurawalage,"Chathura Sarathchandra Magurawalage, Kun Yang, Kezhi Wang",Aqua Computing: Coupling Computing and Communications,A shorter version of this paper will be submitted to an IEEE magazine,,,,cs.DC cs.CY cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The authors introduce a new vision for providing computing services for
connected devices. It is based on the key concept that future computing
resources will be coupled with communication resources, for enhancing user
experience of the connected users, and also for optimising resources in the
providers' infrastructures. Such coupling is achieved by Joint/Cooperative
resource allocation algorithms, by integrating computing and communication
services and by integrating hardware in networks. Such type of computing, by
which computing services are not delivered independently but dependent of
networking services, is named Aqua Computing. The authors see Aqua Computing as
a novel approach for delivering computing resources to end devices, where
computing power of the devices are enhanced automatically once they are
connected to an Aqua Computing enabled network. The process of resource
coupling is named computation dissolving. Then, an Aqua Computing architecture
is proposed for mobile edge networks, in which computing and wireless
networking resources are allocated jointly or cooperatively by a Mobile Cloud
Controller, for the benefit of the end-users and/or for the benefit of the
service providers. Finally, a working prototype of the system is shown and the
gathered results show the performance of the Aqua Computing prototype.
","[{'version': 'v1', 'created': 'Sun, 25 Oct 2015 14:27:22 GMT'}]",2015-10-27,"[['Magurawalage', 'Chathura Sarathchandra', ''], ['Yang', 'Kun', ''], ['Wang', 'Kezhi', '']]","['Computing', 'ubiquitous computing', 'Mobile Computing', 'Cloud Computing', 'Mobile Cloud Computing', 'Clone', 'Fog Computing', 'Mobile Edge Computing']"
15013,1510.04661,Ekaterina Komendantskaya Dr,Peng Fu and Ekaterina Komendantskaya,A Type-Theoretic Approach to Resolution,"21 page (incl appendices) in LOPSTR'15 LNCS post-proceedings, 2015.
  arXiv admin note: substantial text overlap with arXiv:1506.06166",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new type-theoretic approach to SLD-resolution and Horn-clause
logic programming. It views Horn formulas as types, and derivations for a given
query as a construction of the inhabitant (a proof-term) for the type given by
the query. We propose a method of program transformation that allows to
transform logic programs in such a way that proof evidence is computed
alongside SLD-derivations. We discuss two applications of this approach: in
recently proposed productivity theory of structural resolution, and in type
class inference.
","[{'version': 'v1', 'created': 'Thu, 15 Oct 2015 18:52:01 GMT'}]",2015-10-16,"[['Fu', 'Peng', ''], ['Komendantskaya', 'Ekaterina', '']]","['Logic Programming', 'Typed lambda calculus', 'RealizabilityTransformation', 'Reduction Systems', 'Structural Resolution']"
15014,1603.08452,Loet Leydesdorff,"Loet Leydesdorff, Lutz Bornmann, Jordan Comins, and Sta\v{s}a
  Milojevi\'c",Citations: Indicators of Quality? The Impact Fallacy,"accepted for publication in Frontiers in Research Metrics and
  Analysis; doi: 10.3389/frma.2016.00001",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We argue that citation is a composed indicator: short-term citations can be
considered as currency at the research front, whereas long-term citations can
contribute to the codification of knowledge claims into concept symbols.
Knowledge claims at the research front are more likely to be transitory and are
therefore problematic as indicators of quality. Citation impact studies focus
on short-term citation, and therefore tend to measure not epistemic quality,
but involvement in current discourses in which contributions are positioned by
referencing. We explore this argument using three case studies: (1) citations
of the journal Soziale Welt as an example of a venue that tends not to publish
papers at a research front, unlike, for example, JACS; (2) Robert Merton as a
concept symbol across theories of citation; and (3) the Multi-RPYS
(""Multi-Referenced Publication Year Spectroscopy"") of the journals
Scientometrics, Gene, and Soziale Welt. We show empirically that the
measurement of ""quality"" in terms of citations can further be qualified:
short-term citation currency at the research front can be distinguished from
longer-term processes of incorporation and codification of knowledge claims
into bodies of knowledge. The recently introduced Multi-RPYS can be used to
distinguish between short-term and long-term impacts.
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2016 17:37:20 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Jun 2016 08:01:34 GMT'}, {'version': 'v3', 'created': 'Thu, 21 Jul 2016 14:30:52 GMT'}]",2016-07-22,"[['Leydesdorff', 'Loet', ''], ['Bornmann', 'Lutz', ''], ['Comins', 'Jordan', ''], ['Milojević', 'Staša', '']]","['citation', 'symbol', 'historiography', 'RPYS', 'obliteration by incorporation']"
15015,1403.1120,Carlos Luis Gonz\'alez-Valiente,"C. L. Gonz\'alez-Valiente, Y. S\'anchez-Rodr\'iguez, Y.
  Lezcano-P\'erez","Estudio exploratorio sobre las competencias informacionales de los
  estudiantes de la Universidad de La Habana",http://www.redalyc.org/pdf/1814/181423798009.pdf,"Ciencias de la Informaci\'on; 2012, 43 (2): 61-68",,,cs.CY,http://creativecommons.org/licenses/by/3.0/,"  The present article shows the results of a survey aimed at identifying the
informational abilities of Havana University students. Several methods such as
the survey, expert's interviews and content and document analysis are used. The
questionnaire has been structured base on three basic variables: information
search, information analysis and release and self evaluation elements. The
identification of these abilities was a key element for guiding libraries in
the development of actions focused on their communities.
","[{'version': 'v1', 'created': 'Wed, 5 Mar 2014 13:34:55 GMT'}]",2014-03-06,"[['González-Valiente', 'C. L.', ''], ['Sánchez-Rodríguez', 'Y.', ''], ['Lezcano-Pérez', 'Y.', '']]","['Informational abilities', 'information literacy', 'survey']"
15016,1401.5148,Bahman Kalantari,Bahman Kalantari,Solving Cubic Equations By the Quadratic Formula,"6 pages, 2 figures",,,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $p(z)$ be a monic cubic complex polynomial with distinct roots and
distinct critical points. We say a critical point has the {\it Voronoi
property} if it lies in the Voronoi cell of a root $\theta$, $V(\theta)$, i.e.
the set of points that are closer to $\theta$ than to the other roots. We prove
at least one critical point has the Voronoi property and characterize the cases
when both satisfy this property. It is known that for any $\xi \in V(\theta)$,
the sequence $B_m(\xi) =\xi - p(\xi) d_{m-2}/d_{m-1}$ converges to $\theta$,
where $d_m$ satisfies the recurrence $d_m =p'(\xi)d_{m-1}-0.5
p(\xi)p''(\xi)d_{m-2} +p^2(\xi)d_{m-3}$, $d_0 =1, d_{-1}=d_{-2}=0$. Thus by the
Voronoi property, there is a solution $c$ of $p'(z)=0$ where $B_m(c)$ converges
to a root of $p(z)$. The speed of convergence is dependent on the ratio of the
distances between $c$ and the closest and the second closest roots of $p(z)$.
This results in a different algorithm for solving a cubic equation than the
classical methods. We give polynomiography for an example.
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2014 02:19:26 GMT'}]",2014-01-22,"[['Kalantari', 'Bahman', '']]","['Complex Polynomial', 'Iterative Methods', 'Gauss-Lucas', 'Recurrence', 'Voronoi Cell', 'Polynomiography']"
15017,1802.06619,Timur Khanipov,Timur M. Khanipov,Ensemble computation approach to the Hough transform,"22 pages, 8 TikZ figures",,,,cs.CC cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is demonstrated that the classical Hough transform with shift-elevation
parametrization of digital straight lines has additive complexity of at most
$\mathcal{O}(n^3 / \log n)$ on a $n\times n$ image. The proof is constructive
and uses ensemble computation approach to build summation circuits. The
proposed method has similarities with the fast Hough transform (FHT) and may be
considered a form of the ""divide and conquer"" technique. It is based on the
fact that lines with close slopes can be decomposed into common components,
allowing generalization for other pattern families. When applied to FHT
patterns, the algorithm yields exactly the $\Theta(n^2\log n)$ FHT asymptotics
which might suggest that the actual classical Hough transform circuits could
smaller size than $\Theta(n^3/ \log n)$.
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 13:28:18 GMT'}]",2018-02-20,"[['Khanipov', 'Timur M.', '']]","['Hough transform (HT)', 'fast Hough transform (FHT)', 'additive complexity', 'ensemble computation', 'partition tree', 'summation circuit', 'digital straight line']"
15018,1510.05981,Roberto Souza,"Roberto C.S.N.P. Souza, Denise E.F de Brito, Renato M. Assun\c{c}\~ao,
  Wagner Meira Jr","A latent shared-component generative model for real-time disease
  surveillance using Twitter data","Appears in 2nd ACM SIGKDD Workshop on Connected Health at Big Data
  Era (BigCHat)",,,,cs.SI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Exploiting the large amount of available data for addressing relevant social
problems has been one of the key challenges in data mining. Such efforts have
been recently named ""data science for social good"" and attracted the attention
of several researchers and institutions. We give a contribution in this
objective in this paper considering a difficult public health problem, the
timely monitoring of dengue epidemics in small geographical areas. We develop a
generative simple yet effective model to connect the fluctuations of disease
cases and disease-related Twitter posts. We considered a hidden Markov process
driving both, the fluctuations in dengue reported cases and the tweets issued
in each region. We add a stable but random source of tweets to represent the
posts when no disease cases are recorded. The model is learned through a Markov
chain Monte Carlo algorithm that produces the posterior distribution of the
relevant parameters. Using data from a significant number of large Brazilian
towns, we demonstrate empirically that our model is able to predict well the
next weeks of the disease counts using the tweets and disease cases jointly.
","[{'version': 'v1', 'created': 'Tue, 20 Oct 2015 17:44:44 GMT'}]",2015-10-21,"[['Souza', 'Roberto C. S. N. P.', ''], ['de Brito', 'Denise E. F', ''], ['Assunção', 'Renato M.', ''], ['Meira', 'Wagner', 'Jr']]","['Data mining', 'Disease surveillance', 'Dengue', 'Social mediadata']"
15019,1009.3613,Zhi-Hua Zhou,"Wei Gao, Zhi-Hua Zhou",On the Doubt about Margin Explanation of Boosting,35 pages,Artificial Intelligence 203:1-18 2013,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Margin theory provides one of the most popular explanations to the success of
\texttt{AdaBoost}, where the central point lies in the recognition that
\textit{margin} is the key for characterizing the performance of
\texttt{AdaBoost}. This theory has been very influential, e.g., it has been
used to argue that \texttt{AdaBoost} usually does not overfit since it tends to
enlarge the margin even after the training error reaches zero. Previously the
\textit{minimum margin bound} was established for \texttt{AdaBoost}, however,
\cite{Breiman1999} pointed out that maximizing the minimum margin does not
necessarily lead to a better generalization. Later, \cite{Reyzin:Schapire2006}
emphasized that the margin distribution rather than minimum margin is crucial
to the performance of \texttt{AdaBoost}. In this paper, we first present the
\textit{$k$th margin bound} and further study on its relationship to previous
work such as the minimum margin bound and Emargin bound. Then, we improve the
previous empirical Bernstein bounds
\citep{Maurer:Pontil2009,Audibert:Munos:Szepesvari2009}, and based on such
findings, we defend the margin-based explanation against Breiman's doubts by
proving a new generalization error bound that considers exactly the same
factors as \cite{Schapire:Freund:Bartlett:Lee1998} but is sharper than
\cite{Breiman1999}'s minimum margin bound. By incorporating factors such as
average margin and variance, we present a generalization error bound that is
heavily related to the whole margin distribution. We also provide margin
distribution bounds for generalization error of voting classifiers in finite
VC-dimension space.
","[{'version': 'v1', 'created': 'Sun, 19 Sep 2010 07:26:37 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Sep 2010 12:38:53 GMT'}, {'version': 'v3', 'created': 'Sat, 17 Mar 2012 08:42:07 GMT'}, {'version': 'v4', 'created': 'Tue, 10 Apr 2012 11:48:11 GMT'}, {'version': 'v5', 'created': 'Wed, 28 Aug 2013 03:03:18 GMT'}]",2013-08-29,"[['Gao', 'Wei', ''], ['Zhou', 'Zhi-Hua', '']]","['classification', 'boosting', 'ensemble methods', 'margin theory']"
15020,1209.6470,Reena Philips Mrs,"K. S. Rashmi, V. Suma, M. Vaidehi",Enhanced Load Balancing Approach to Avoid Deadlocks in Cloud,"5 Pages, 4 Figures, 5 Tables",,,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The state-of-art of the technology focuses on data processing to deal with
massive amount of data. Cloud computing is an emerging technology, which
enables one to accomplish the aforementioned objective, leading towards
improved business performance. It comprises of users requesting for the
services of diverse applications from various distributed virtual servers. The
cloud should provide resources on demand to its clients with high availability,
scalability and with reduced cost. Load balancing is one of the essential
factors to enhance the working performance of the cloud service provider.
Since, cloud has inherited characteristic of distributed computing and
virtualization there is a possibility of occurrence of deadlock. Hence, in this
paper, a load balancing algorithm has been proposed to avoid deadlocks among
the Virtual Machines (VMs) while processing the requests received from the
users by VM migration. Further, this paper also provides the anticipated
results with the implementation of the proposed algorithm. The deadlock
avoidance enhances the number of jobs to be serviced by cloud service provider
and thereby improving working performance and the business of the cloud service
provider.
","[{'version': 'v1', 'created': 'Fri, 28 Sep 2012 10:13:18 GMT'}]",2012-10-01,"[['Rashmi', 'K. S.', ''], ['Suma', 'V.', ''], ['Vaidehi', 'M.', '']]","['Deadlock Avoidance', 'VM Migration', 'Respone Time', 'Hop Time', 'Wait Time']"
15021,1512.01994,Vadim E. Levit,Vadim E. Levit and Eugen Mandrescu,On Konig-Egervary Collections of Maximum Critical Independent Sets,"9 pages, 3 figures",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let G be a simple graph with vertex set V(G). A set S is independent if no
two vertices from S are adjacent. The graph G is known to be a Konig-Egervary
if alpha(G)+mu(G)= |V(G)|, where alpha(G) denotes the size of a maximum
independent set and mu(G) is the cardinality of a maximum matching. The number
d(X)= |X|-|N(X)| is the difference of X, and an independent set A is critical
if d(A) = max{d(I):I is an independent set in G} (Zhang; 1990). Let Omega(G)
denote the family of all maximum independent sets. Let us say that a family
Gamma of independent sets is a Konig-Egervary collection if |Union of Gamma| +
|Intersection of Gamma| = 2alpha(G) (Jarden, Levit, Mandrescu; 2015). In this
paper, we show that if the family of all maximum critical independent sets of a
graph G is a Konig-Egervary collection, then G is a Konig-Egervary graph. It
generalizes one of our conjectures recently validated in (Short; 2015).
","[{'version': 'v1', 'created': 'Mon, 7 Dec 2015 11:45:02 GMT'}]",2015-12-08,"[['Levit', 'Vadim E.', ''], ['Mandrescu', 'Eugen', '']]","['maximum independent set', 'critical set', 'ker', 'nucleus', 'core', 'corona', 'diadem', 'K¨onig-Egerv´ary graph']"
15022,1406.2777,Addanki Sai  CHARAN,"A.Sai Charan, N.K.Manasa, Prof.N.V.S.N.Sarma","Out Performance Of Cuckoo Search Algorithm Among Nature Inspired
  Algorithms in Planar Antenna Arrays","10 PAGES, 9 FIGURES, WIMON-2014",,,,cs.ET cs.IT math.IT,http://creativecommons.org/licenses/by/3.0/,"  In this modern era a great deal of metamorphism is observed around us which
eventuate due to some minute modifications and innovations in the area of
Science and Technology. This paper deals with the application of a meta
heuristic optimization algorithm namely the Cuckoo Search Algorithm in the
design of an optimized planar antenna array which ensures high
gain,directivity, suppression of side lobes, increased efficiency and improves
other antenna parameters as well.
","[{'version': 'v1', 'created': 'Wed, 11 Jun 2014 04:50:33 GMT'}]",2014-06-12,"[['Charan', 'A. Sai', ''], ['Manasa', 'N. K.', ''], ['Sarma', 'Prof. N. V. S. N.', '']]","['Meta-Heuristic', 'Side Lobe Suppression', 'Gain', 'Directivity', 'Side Lobe Level (SLL)']"
15023,1409.7352,Zhengjun Cao,Zhengjun Cao and Zhenfu Cao,"On Shor's Factoring Algorithm with More Registers and the Problem to
  Certify Quantum Computers","12 pages. The extended abstract of this paper appeared in Proceeding
  of 2nd International Symposium on Information Science and Engineering, 2009",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Shor's factoring algorithm uses two quantum registers. By introducing more
registers we show that the measured numbers in these registers which are of the
same pre-measurement state, should be equal if the original Shor's complexity
argument is sound. This contradicts the argument that the second register has
$r$ possible measured values. There is an anonymous comment which argues that
the states in these registers are entangled. If so, the entanglement involving
many quantum registers can not be interpreted by the mechanism of EPR pairs and
the like. In view of this peculiar entanglement has not yet been mentioned and
investigated, we think the claim that the Shor's algorithm runs in polynomial
time needs more physical verifications. We also discuss the problem to certify
quantum computers.
","[{'version': 'v1', 'created': 'Wed, 10 Sep 2014 00:22:20 GMT'}]",2014-09-26,"[['Cao', 'Zhengjun', ''], ['Cao', 'Zhenfu', '']]","['Shor’s factoring algorithm', 'quantum register', 'entanglement', 'joint probability', 'conditional probability']"
15024,1401.3421,Rourab Paul,"Sruti Agarwal, Sangeet Saha, Rourab Paul, Amlan Chakrabarti","Performance Evaluation of ECC in Single and Multi Processor
  Architectures on FPGA Based Embedded System","Published Book Title: Elsevier Science and Technology, ICCN 2013,
  Bangalore, Page(s): 140 - 147, Volume 3, 03.elsevierst.2013.3.ICCN16, ISBN
  :9789351071044, Paper
  link:-http://searchdl.org/index.php/book_series/view/917",,,,cs.AR cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cryptographic algorithms are computationally costly and the challenge is more
if we need to execute them in resource constrained embedded systems. Field
Programmable Gate Arrays (FPGAs) having programmable logic de- vices and
processing cores, have proven to be highly feasible implementation platforms
for embedded systems providing lesser design time and reconfig- urability.
Design parameters like throughput, resource utilization and power requirements
are the key issues. The popular Elliptic Curve Cryptography (ECC), which is
superior over other public-key crypto-systems like RSA in many ways, such as
providing greater security for a smaller key size, is cho- sen in this work and
the possibilities of its implementation in FPGA based embedded systems for both
single and dual processor core architectures in- volving task parallelization
have been explored. This exploration, which is first of its kind considering
the other existing works, is a needed activity for evaluating the best possible
architectural environment for ECC implementa- tion on FPGA (Virtex4 XC4VFX12,
FF668, -10) based embedded platform.
","[{'version': 'v1', 'created': 'Wed, 15 Jan 2014 03:25:41 GMT'}]",2014-02-20,"[['Agarwal', 'Sruti', ''], ['Saha', 'Sangeet', ''], ['Paul', 'Rourab', ''], ['Chakrabarti', 'Amlan', '']]","['FPGA', 'ECC', 'single-core', 'dual-core', 'MicroBlaze', 'sharedmemory']"
15025,1506.02247,Gonzalo Galiano,"Gonzalo Galiano, Emanuele Schiavi, Juli\'an Velasco","Well-posedness of a nonlinear integro-differential problem and its
  rearranged formulation","Final version. To appear in Nolinear Analysis Real World Applications
  (2016)",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the existence and uniqueness of solutions of a nonlinear
integro-differential problem which we reformulate introducing the notion of the
decreasing rearrangement of the solution. A dimensional reduction of the
problem is obtained and a detailed analysis of the properties of the solutions
of the model is provided. Finally, a fast numerical method is devised and
implemented to show the performance of the model when typical image processing
tasks such as filtering and segmentation are performed.
","[{'version': 'v1', 'created': 'Sun, 7 Jun 2015 10:23:58 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Apr 2016 10:11:18 GMT'}]",2016-04-11,"[['Galiano', 'Gonzalo', ''], ['Schiavi', 'Emanuele', ''], ['Velasco', 'Julián', '']]","['Integro-differential equation', 'existence', 'uniqueness', 'neighborhood filters', 'decreasing rearrangement', 'denoising', 'segmentation']"
15026,1305.0218,Alon Schclar,Dina Dushnik and Alon Schclar and Amir Averbuch,Video Segmentation via Diffusion Bases,"29 pages, 11 figures",,,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identifying moving objects in a video sequence, which is produced by a static
camera, is a fundamental and critical task in many computer-vision
applications. A common approach performs background subtraction, which
identifies moving objects as the portion of a video frame that differs
significantly from a background model. A good background subtraction algorithm
has to be robust to changes in the illumination and it should avoid detecting
non-stationary background objects such as moving leaves, rain, snow, and
shadows. In addition, the internal background model should quickly respond to
changes in background such as objects that start to move or stop. We present a
new algorithm for video segmentation that processes the input video sequence as
a 3D matrix where the third axis is the time domain. Our approach identifies
the background by reducing the input dimension using the \emph{diffusion bases}
methodology. Furthermore, we describe an iterative method for extracting and
deleting the background. The algorithm has two versions and thus covers the
complete range of backgrounds: one for scenes with static backgrounds and the
other for scenes with dynamic (moving) backgrounds.
","[{'version': 'v1', 'created': 'Wed, 1 May 2013 16:22:55 GMT'}]",2013-05-02,"[['Dushnik', 'Dina', ''], ['Schclar', 'Alon', ''], ['Averbuch', 'Amir', '']]","['Video Segmentation', 'Background subtraction', 'Markov processes', 'Graph algo']"
15027,1510.01165,Leandro Montero,Marina Groshaus and Leandro Montero,Tight lower bounds on the number of bicliques in false-twin-free graphs,"16 pages, 4 figues",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A \emph{biclique} is a maximal bipartite complete induced subgraph of $G$.
Bicliques have been studied in the last years motivated by the large number of
applications. In particular, enumeration of the maximal bicliques has been of
interest in data analysis. Associated with this issue, bounds on the maximum
number of bicliques were given. In this paper we study bounds on the minimun
number of bicliques of a graph. Since adding false-twin vertices to $G$ does
not change the number of bicliques, we restrict to false-twin-free graphs. We
give a tight lower bound on the minimum number bicliques for a subclass of
$\{C_4$,false-twin$\}$-free graphs and for the class of
$\{K_3$,false-twin$\}$-free graphs. Finally we discuss the problem for general
graphs.
","[{'version': 'v1', 'created': 'Mon, 5 Oct 2015 14:22:16 GMT'}, {'version': 'v2', 'created': 'Wed, 11 May 2016 19:39:22 GMT'}]",2016-05-12,"[['Groshaus', 'Marina', ''], ['Montero', 'Leandro', '']]","['Bicliques', 'False-twin-free graphs', 'Lower bounds']"
15028,1506.04364,Yunwen Lei,"Yunwen Lei and Alexander Binder and \""Ur\""un Dogan and Marius Kloft",Localized Multiple Kernel Learning---A Convex Approach,to appear in ACML 2016,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a localized approach to multiple kernel learning that can be
formulated as a convex optimization problem over a given cluster structure. For
which we obtain generalization error guarantees and derive an optimization
algorithm based on the Fenchel dual representation. Experiments on real-world
datasets from the application domains of computational biology and computer
vision show that convex localized multiple kernel learning can achieve higher
prediction accuracies than its global and non-convex local counterparts.
","[{'version': 'v1', 'created': 'Sun, 14 Jun 2015 09:11:13 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Oct 2016 00:54:24 GMT'}]",2016-10-14,"[['Lei', 'Yunwen', ''], ['Binder', 'Alexander', ''], ['Dogan', 'Ürün', ''], ['Kloft', 'Marius', '']]","['Multiple kernel learning', 'Localized algorithms', 'Generalization analysis']"
15029,1403.0829,Weifeng Liu,"W. Liu, H. Liu, D. Tao, Y. Wang, Ke Lu",Multiview Hessian regularized logistic regression for action recognition,"13 pages,2 figures, submitted to signal processing",,,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rapid development of social media sharing, people often need to
manage the growing volume of multimedia data such as large scale video
classification and annotation, especially to organize those videos containing
human activities. Recently, manifold regularized semi-supervised learning
(SSL), which explores the intrinsic data probability distribution and then
improves the generalization ability with only a small number of labeled data,
has emerged as a promising paradigm for semiautomatic video classification. In
addition, human action videos often have multi-modal content and different
representations. To tackle the above problems, in this paper we propose
multiview Hessian regularized logistic regression (mHLR) for human action
recognition. Compared with existing work, the advantages of mHLR lie in three
folds: (1) mHLR combines multiple Hessian regularization, each of which
obtained from a particular representation of instance, to leverage the
exploring of local geometry; (2) mHLR naturally handle multi-view instances
with multiple representations; (3) mHLR employs a smooth loss function and then
can be effectively optimized. We carefully conduct extensive experiments on the
unstructured social activity attribute (USAA) dataset and the experimental
results demonstrate the effectiveness of the proposed multiview Hessian
regularized logistic regression for human action recognition.
","[{'version': 'v1', 'created': 'Mon, 3 Mar 2014 01:11:40 GMT'}]",2014-03-05,"[['Liu', 'W.', ''], ['Liu', 'H.', ''], ['Tao', 'D.', ''], ['Wang', 'Y.', ''], ['Lu', 'Ke', '']]","['Hessian', 'logistic regression', 'action recognition', 'multiview learning', 'manifold learning', 'semi-supervised learning']"
15030,1702.01596,Quoc-Cuong To,"Quoc-Cuong To, Juan Soto, Volker Markl",A Survey of State Management in Big Data Processing Systems,2 pages,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  State management and its use in diverse applications varies widely across big
data processing systems. This is evident in both the research literature and
existing systems, such as Apache Flink, Apache Samza, Apache Spark, and Apache
Storm. Given the pivotal role that state management plays in various use cases,
in this survey, we present some of the most important uses of state as an
enabler, discuss the alternative approaches used to handle and implement state,
propose a taxonomy to capture the many facets of state management, and
highlight new research directions. Our aim is to provide insight into disparate
state management techniques, motivate others to pursue research in this area,
and draw attention to some open problems.
","[{'version': 'v1', 'created': 'Mon, 6 Feb 2017 12:41:28 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Apr 2017 07:09:13 GMT'}, {'version': 'v3', 'created': 'Fri, 24 Nov 2017 11:29:21 GMT'}, {'version': 'v4', 'created': 'Wed, 1 Aug 2018 12:43:11 GMT'}]",2018-08-02,"[['To', 'Quoc-Cuong', ''], ['Soto', 'Juan', ''], ['Markl', 'Volker', '']]","['big data processing systems', 'state management', 'survey']"
15031,1701.03000,Athanasios Karapantelakis,"Aneta Vulgarakis Feljan, Athanasios Karapantelakis, Leonid Mokrushin,
  Hongxin Liang, Rafia Inam, Elena Fersman, Carlos R.B. Azevedo, Klaus Raizer,
  Ricardo S. Souza","A Framework for Knowledge Management and Automated Reasoning Applied on
  Intelligent Transport Systems",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cyber-Physical Systems in general, and Intelligent Transport Systems (ITS) in
particular use heterogeneous data sources combined with problem solving
expertise in order to make critical decisions that may lead to some form of
actions e.g., driver notifications, change of traffic light signals and braking
to prevent an accident. Currently, a major part of the decision process is done
by human domain experts, which is time-consuming, tedious and error-prone.
Additionally, due to the intrinsic nature of knowledge possession this decision
process cannot be easily replicated or reused. Therefore, there is a need for
automating the reasoning processes by providing computational systems a formal
representation of the domain knowledge and a set of methods to process that
knowledge. In this paper, we propose a knowledge model that can be used to
express both declarative knowledge about the systems' components, their
relations and their current state, as well as procedural knowledge representing
possible system behavior. In addition, we introduce a framework for knowledge
management and automated reasoning (KMARF). The idea behind KMARF is to
automatically select an appropriate problem solver based on formalized
reasoning expertise in the knowledge base, and convert a problem definition to
the corresponding format. This approach automates reasoning, thus reducing
operational costs, and enables reusability of knowledge and methods across
different domains. We illustrate the approach on a transportation planning use
case.
","[{'version': 'v1', 'created': 'Wed, 11 Jan 2017 15:03:18 GMT'}]",2017-01-12,"[['Feljan', 'Aneta Vulgarakis', ''], ['Karapantelakis', 'Athanasios', ''], ['Mokrushin', 'Leonid', ''], ['Liang', 'Hongxin', ''], ['Inam', 'Rafia', ''], ['Fersman', 'Elena', ''], ['Azevedo', 'Carlos R. B.', ''], ['Raizer', 'Klaus', ''], ['Souza', 'Ricardo S.', '']]","['Knowledge model', 'Reasoning', 'Ontology', 'Model transformation', 'Intelligent Transport Systems']"
15032,1207.4570,Farzad Parseh,"Farzad Parseh, Davood Karimzadgan Moghaddam, Mir Mohsen Pedram,
  Rohollah Esmaeli Manesh, Mohammad (behdad) Jamshidi","Presentation an Approach for Optimization of Semantic Web Language Based
  on the Document Structure","7 pages, 8 figures, 2 Tables","IJCSI International Journal of Computer Science Issues, Vol. 9,
  Issue 3, No 1, May 2012 ISSN (Online): 1694-0814",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pattern tree are based on integrated rules which are equal to a combination
of some points connected to each other in a hierarchical structure, called
Enquiry Hierarchical (EH). The main operation in pattern enquiry seeking is to
locate the steps that match the given EH in the dataset. A point of algorithms
has offered for EH matching; but the majority of this algorithms seeks all of
the enquiry steps to access all EHs in the dataset. A few algorithms such as
seek only steps that satisfy end points of EH. All of above algorithms are
trying to locate a way just for investigating direct testing of steps and to
locate the answer of enquiry, directly via these points. In this paper, we
describe a novel algorithm to locate the answer of enquiry without access to
real point of the dataset blindly. In this algorithm, first, the enquiry will
be executed on enquiry schema and this leads to a schema. Using this plan, it
will be clear how to seek end steps and how to achieve enquiry dataset, before
seeking of the dataset steps. Therefore, none of dataset steps will be seek
blindly.
","[{'version': 'v1', 'created': 'Thu, 19 Jul 2012 07:14:15 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Jul 2012 05:05:20 GMT'}]",2015-03-13,"[['Parseh', 'Farzad', '', 'behdad'], ['Moghaddam', 'Davood Karimzadgan', '', 'behdad'], ['Pedram', 'Mir Mohsen', '', 'behdad'], ['Manesh', 'Rohollah Esmaeli', '', 'behdad'], ['Mohammad', '', '', 'behdad'], ['Jamshidi', '', '']]","['Pattern', 'Branch Links', 'Query Indicators', 'Evaluation']"
15033,1007.2816,Miroslaw Truszczynski,Miroslaw Truszczynski,"Trichotomy and Dichotomy Results on the Complexity of Reasoning with
  Disjunctive Logic Programs",24 pages To appear in Theory and Practice of Logic Programming (TPLP),"Theory and Practice of Logic Programming, 11(6): 881-904 (2011)",,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present trichotomy results characterizing the complexity of reasoning with
disjunctive logic programs. To this end, we introduce a certain definition
schema for classes of programs based on a set of allowed arities of rules. We
show that each such class of programs has a finite representation, and for each
of the classes definable in the schema we characterize the complexity of the
existence of an answer set problem. Next, we derive similar characterizations
of the complexity of skeptical and credulous reasoning with disjunctive logic
programs. Such results are of potential interest. On the one hand, they reveal
some reasons responsible for the hardness of computing answer sets. On the
other hand, they identify classes of problem instances, for which the problem
is ""easy"" (in P) or ""easier than in general"" (in NP). We obtain similar results
for the complexity of reasoning with disjunctive programs under the
supported-model semantics. To appear in Theory and Practice of Logic
Programming (TPLP)
","[{'version': 'v1', 'created': 'Fri, 16 Jul 2010 17:07:25 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Sep 2010 01:30:39 GMT'}]",2014-10-08,"[['Truszczynski', 'Miroslaw', '']]","['answer sets', 'supported models', 'complexity of reasoning']"
15034,1008.3788,Quan-Lin Li,Quan-Lin Li,"Doubly Exponential Solution for Randomized Load Balancing Models with
  General Service Times","40 pages, 4 figures",,,,cs.DM cs.IT cs.NI cs.PF math.IT,http://creativecommons.org/licenses/by/3.0/,"  In this paper, we provide a novel and simple approach to study the
supermarket model with general service times. This approach is based on the
supplementary variable method used in analyzing stochastic models extensively.
We organize an infinite-size system of integral-differential equations by means
of the density dependent jump Markov process, and obtain a close-form solution:
doubly exponential structure, for the fixed point satisfying the system of
nonlinear equations, which is always a key in the study of supermarket models.
The fixed point is decomposited into two groups of information under a product
form: the arrival information and the service information. based on this, we
indicate two important observations: the fixed point for the supermarket model
is different from the tail of stationary queue length distribution for the
ordinary M/G/1 queue, and the doubly exponential solution to the fixed point
can extensively exist even if the service time distribution is heavy-tailed.
Furthermore, we analyze the exponential convergence of the current location of
the supermarket model to its fixed point, and study the Lipschitz condition in
the Kurtz Theorem under general service times. Based on these analysis, one can
gain a new understanding how workload probing can help in load balancing jobs
with general service times such as heavy-tailed service.
","[{'version': 'v1', 'created': 'Mon, 23 Aug 2010 10:10:38 GMT'}, {'version': 'v2', 'created': 'Sat, 25 Sep 2010 03:35:22 GMT'}]",2010-09-28,"[['Li', 'Quan-Lin', '']]","['Randomized load balancing', 'supermarket model', 'density dependent']"
15035,1403.2407,Lorenzo Reyes,"Andrey Bernstein (1), Lorenzo Reyes-Chamorro (2), Jean-Yves Le Boudec
  (1) and Mario Paolone (2) ((1) Laboratory for Communications and Applications
  2. \'Ecole Polytechnique F\'ed\'erale de Lausanne, (2) Distributed Electrical
  Systems Laboratory. \'Ecole Polytechnique F\'ed\'erale de Lausanne)","A Composable Method for Real-Time Control of Active Distribution
  Networks with Explicit Power Setpoints","71 pages, 21 figures, 5 tables",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The conventional approach for the control of distribution networks, in the
presence of active generation and/or controllable loads and storage, involves a
combination of both frequency and voltage regulation at different time scales.
With the increased penetration of stochastic resources, distributed generation
and demand response, this approach shows severe limitations in both the optimal
and feasible operation of these networks, as well as in the aggregation of the
network resources for upper-layer power systems. An alternative approach is to
directly control the targeted grid by defining explicit and real-time setpoints
for active/reactive power absorptions/injections defined by a solution of a
specific optimization problem; but this quickly becomes intractable when
systems get large or diverse. In this paper, we address this problem and
propose a method for the explicit control of the grid status, based on a common
abstract model characterized by the main property of being composable. That is
to say, subsystems can be aggregated into virtual devices that hide their
internal complexity. Thus the proposed method can easily cope with systems of
any size or complexity. The framework is presented in this Part I, whilst in
Part II we illustrate its application to a CIGR\'E low voltage benchmark
microgrid. In particular, we provide implementation examples with respect to
typical devices connected to distribution networks and evaluate of the
performance and benefits of the proposed control framework.
","[{'version': 'v1', 'created': 'Fri, 7 Mar 2014 13:08:54 GMT'}, {'version': 'v2', 'created': 'Tue, 6 May 2014 15:16:04 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Aug 2014 17:26:26 GMT'}, {'version': 'v4', 'created': 'Wed, 4 Feb 2015 00:09:54 GMT'}]",2015-02-05,"[['Bernstein', 'Andrey', ''], ['Reyes-Chamorro', 'Lorenzo', ''], ['Boudec', 'Jean-Yves Le', ''], ['Paolone', 'Mario', '']]","['Decentralized control', 'explicit distributed optimization', 'power and voltage']"
15036,1304.6589,Heide Gluesing-Luerssen,Heide Gluesing-Luerssen,Partitions of Frobenius Rings Induced by the Homogeneous Weight,,,,,cs.IT math.IT math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The values of the homogeneous weight are determined for finite Frobenius
rings that are a direct product of local Frobenius rings. This is used to
investigate the partition induced by this weight and its dual partition under
character-theoretic dualization. A characterization is given of those rings for
which the induced partition is reflexive or even self-dual.
","[{'version': 'v1', 'created': 'Wed, 24 Apr 2013 13:58:44 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Aug 2013 19:39:09 GMT'}]",2013-08-08,"[['Gluesing-Luerssen', 'Heide', '']]","['Homogeneous weight', 'finite Frobenius rings', 'reflexive partitions']"
15037,1602.07366,Weidong Wang,"Weidong Wang, Liqiang Wang, Wei Lu","An Intelligent QoS Identification for Untrustworthy Web Services Via
  Two-phase Neural Networks","8 pages, 5 figures",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  QoS identification for untrustworthy Web services is critical in QoS
management in the service computing since the performance of untrustworthy Web
services may result in QoS downgrade. The key issue is to intelligently learn
the characteristics of trustworthy Web services from different QoS levels, then
to identify the untrustworthy ones according to the characteristics of QoS
metrics. As one of the intelligent identification approaches, deep neural
network has emerged as a powerful technique in recent years. In this paper, we
propose a novel two-phase neural network model to identify the untrustworthy
Web services. In the first phase, Web services are collected from the published
QoS dataset. Then, we design a feedforward neural network model to build the
classifier for Web services with different QoS levels. In the second phase, we
employ a probabilistic neural network (PNN) model to identify the untrustworthy
Web services from each classification. The experimental results show the
proposed approach has 90.5% identification ratio far higher than other
competing approaches.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2016 01:38:14 GMT'}]",2016-02-25,"[['Wang', 'Weidong', ''], ['Wang', 'Liqiang', ''], ['Lu', 'Wei', '']]","['Untrustworthy Web service', 'quality of service(QoS)', 'neural network', 'QoS management']"
15038,1401.7651,O\u{g}uz Sunay,"Volkan Yazici, M. Oguz Sunay, Ali O. Ercan",Controlling a Software-Defined Network via Distributed Controllers,"6 pages, 4 figures","Proceedings of the 2012 NEM Summit, pp. 16-20, Istanbul, Turkey,
  October 16-18, 2012",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a distributed OpenFlow controller and an associated
coordination framework that achieves scalability and reliability even under
heavy data center loads. The proposed framework, which is designed to work with
all existing OpenFlow controllers with minimal or no required changes, provides
support for dynamic addition and removal of controllers to the cluster without
any interruption to the network operation. We demonstrate performance results
of the proposed framework implemented over an experimental testbed that uses
controllers running Beacon.
","[{'version': 'v1', 'created': 'Wed, 29 Jan 2014 20:35:00 GMT'}]",2014-01-30,"[['Yazici', 'Volkan', ''], ['Sunay', 'M. Oguz', ''], ['Ercan', 'Ali O.', '']]","['software-defined networking', 'reliability', 'scalability', 'high-availability']"
15039,0909.3688,Emiliano De Cristofaro,"Mishari Al Mishari, Emiliano De Cristofaro, Karim El Defrawy and Gene
  Tsudik",Harvesting SSL Certificate Data to Identify Web-Fraud,To appear in the International Journal of Network Security,,,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web-fraud is one of the most unpleasant features of today's Internet. Two
well-known examples of fraudulent activities on the web are phishing and
typosquatting. Their effects range from relatively benign (such as unwanted
ads) to downright sinister (especially, when typosquatting is combined with
phishing). This paper presents a novel technique to detect web-fraud domains
that utilize HTTPS. To this end, we conduct the first comprehensive study of
SSL certificates. We analyze certificates of legitimate and popular domains and
those used by fraudulent ones. Drawing from extensive measurements, we build a
classifier that detects such malicious domains with high accuracy.
","[{'version': 'v1', 'created': 'Mon, 21 Sep 2009 05:39:17 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Dec 2009 02:19:53 GMT'}, {'version': 'v3', 'created': 'Thu, 12 Jan 2012 03:15:29 GMT'}, {'version': 'v4', 'created': 'Fri, 13 Jan 2012 03:55:04 GMT'}]",2015-03-13,"[['Mishari', 'Mishari Al', ''], ['De Cristofaro', 'Emiliano', ''], ['Defrawy', 'Karim El', ''], ['Tsudik', 'Gene', '']]","['SSL Certificates', 'Phishing', 'Typosquatting']"
15040,1610.04405,Pascal Mainini,Pascal Mainini and Annett Laube-Rosenpflanzer,Access Control in Linked Data Using WebID,,"SEMPDS-2016. Posters&Demos@SEMANTiCS 2016 and SuCCESS'16 Workshop.
  CEUR-WS.org/Vol-1695, urn:nbn:de:0074-1695-3",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linked Data technologies become increasingly important in many domains. Key
factors for their breakthrough are security and trust. Classical means for
access control lack granularity when parts of the Linked Data graph must be
protected. The WebID, combining semantic web concepts with methods from
certificate based authentication and authorization, seems promising to fulfill
all requirements concerning security and trust in the semantic web.
  In the PerSemID project, we challenged the WebID technology with a fully
implemented proof-of-concept (PoC) addressing a workflow coming from the domain
of lifelong learning and student mobility. In our use case of study enrollment,
we used WebIDs for authentication and to grant access to parts of triple
stores, during cross domain triple store interactions to exchange data between
stakeholders.
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2016 10:53:37 GMT'}]",2016-10-17,"[['Mainini', 'Pascal', ''], ['Laube-Rosenpflanzer', 'Annett', '']]","['Semantic Web', 'WebID', 'Linked Data', 'Access Control', 'Authentication', 'Authorization']"
15041,1704.08880,Andrzej Pelc,Andrzej Pelc,Deterministic Gathering with Crash Faults,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A team consisting of an unknown number of mobile agents, starting from
different nodes of an unknown network, have to meet at the same node and
terminate. This problem is known as {\em gathering}. We study deterministic
gathering algorithms under the assumption that agents are subject to {\em crash
faults} which can occur at any time. Two fault scenarios are considered. A {\em
motion fault} immobilizes the agent at a node or inside an edge but leaves
intact its memory at the time when the fault occurred. A more severe {\em total
fault} immobilizes the agent as well, but also erases its entire memory. Of
course, we cannot require faulty agents to gather. Thus the gathering problem
for fault prone agents calls for all fault-free agents to gather at a single
node, and terminate.
  When agents move completely asynchronously, gathering with crash faults of
any type is impossible. Hence we consider a restricted version of asynchrony,
where each agent is assigned by the adversary a fixed speed, possibly different
for each agent. Agents have clocks ticking at the same rate. Each agent can
wait for a time of its choice at any node, or decide to traverse an edge but
then it moves at constant speed assigned to it. Moreover, agents have different
labels. Each agent knows its label and speed but not those of other agents.
  We construct a gathering algorithm working for any team of at least two
agents in the scenario of motion faults, and a gathering algorithm working in
the presence of total faults, provided that at least two agents are fault free
all the time. If only one agent is fault free, the task of gathering with total
faults is sometimes impossible. Both our algorithms work in time polynomial in
the size of the graph, in the logarithm of the largest label, in the inverse of
the smallest speed, and in the ratio between the largest and the smallest
speed.
","[{'version': 'v1', 'created': 'Fri, 28 Apr 2017 11:29:23 GMT'}]",2017-05-01,"[['Pelc', 'Andrzej', '']]","['gathering', 'deterministic algorithm', 'mobile agent', 'crash fault']"
15042,1104.5368,Swan Dubois,"Swan Dubois (LIP6, INRIA Rocquencourt), Toshimitsu Masuzawa
  (Department of Information and Computer sciences Osaka University),
  S\'ebastien Tixeuil (LIP6, IUF)",Maximum Metric Spanning Tree made Byzantine Tolerant,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-stabilization is a versatile approach to fault-tolerance since it
permits a distributed system to recover from any transient fault that
arbitrarily corrupts the contents of all memories in the system. Byzantine
tolerance is an attractive feature of distributed systems that permits to cope
with arbitrary malicious behaviors. This paper focus on systems that are both
self-stabilizing and Byzantine tolerant. We consider the well known problem of
constructing a maximum metric tree in this context. Combining these two
properties is known to induce many impossibility results. In this paper, we
provide first two impossibility results about the construction of maximum
metric tree in presence of transients and (permanent) Byzantine faults. Then,
we provide a new self-stabilizing protocol that provides optimal containment of
an arbitrary number of Byzantine faults.
","[{'version': 'v1', 'created': 'Thu, 28 Apr 2011 12:14:53 GMT'}]",2011-04-29,"[['Dubois', 'Swan', '', 'LIP6, INRIA Rocquencourt'], ['Masuzawa', 'Toshimitsu', '', 'Department of Information and Computer sciences Osaka University'], ['Tixeuil', 'Sébastien', '', 'LIP6, IUF']]","['Byzantine fault', 'Distributed protocol', 'Fault tolerance', 'Stabilization', 'Spanning treeconstruction']"
15043,0907.3710,Andrei Sukhov M,"A.V. Sukhov, T.G. Sultanov, M.V. Strizhov, A.P. Platonov",Throughput metrics and packet delay in TCP/IP networks,"6 pages, 3 figures","RIPE 59, Lissabon, 2009",,,cs.NI cs.PF,http://creativecommons.org/licenses/by/3.0/,"  In the paper the method for estimation of throughput metrics like available
bandwidth and end-t-end capacity is supposed. This method is based on
measurement of network delay $D_i$ for packets of different sizes $W_i$. The
simple expression for available bandwidth $B_{av} =(W_2-W_1)/(D_2-D_1)$ is
substantiated. The number of experiments on matching of the results received
new and traditional methods is spent. The received results testify to
possibility of application of new model.
","[{'version': 'v1', 'created': 'Tue, 21 Jul 2009 17:35:44 GMT'}]",2009-07-22,"[['Sukhov', 'A. V.', ''], ['Sultanov', 'T. G.', ''], ['Strizhov', 'M. V.', ''], ['Platonov', 'A. P.', '']]","['new model for available bandwidth', 'end-to-end capacity', 'delay for packets of different sizes', 'RIPE Test Box']"
15044,1209.4620,Lewis Tseng,Lewis Tseng and Nitin Vaidya and Vartika Bhandari,"Broadcast Using Certified Propagation Algorithm in Presence of Byzantine
  Faults",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore the correctness of the Certified Propagation Algorithm (CPA) [6,
1, 8, 5] in solving broadcast with locally bounded Byzantine faults. CPA allows
the nodes to use only local information regarding the network topology. We
provide a tight necessary and sufficient condition on the network topology for
the correctness of CPA. To the best of our knowledge, this work is the first to
solve the open problem in [8]. We also present some simple extensions of this
result
","[{'version': 'v1', 'created': 'Thu, 20 Sep 2012 19:15:50 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Oct 2013 22:07:06 GMT'}]",2013-10-25,"[['Tseng', 'Lewis', ''], ['Vaidya', 'Nitin', ''], ['Bhandari', 'Vartika', '']]","['Algorithms', 'Distributed computing', 'Fault tolerance', 'Broadcast', 'Byzantine']"
15045,1609.01935,Hoc Nguyen Thai,Hoc Thai Nguyen and Hai Xuan Le,Path planning and Obstacle avoidance approaches for Mobile robot,,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new path planning method for Mobile Robots (MR) has been developed and
implemented. On the one hand, based on the shortest path from the start point
to the goal point, this path planner can choose the best moving directions of
the MR, which helps to reach the target point as soon as possible. On the other
hand, with an intelligent obstacle avoidance, our method can find the target
point with the near-shortest path length while avoiding some infinite loop
traps of several obstacles in unknown environments. The combination of two
approaches helps the MR to reach the target point with a very reliable
algorithm. Moreover, by continuous updates of the on-board sensors information,
this approach can generate the MRs trajectory both in static and dynamic
environments. A large number of simulations in some similar studies
environments demonstrate the power of the proposed path planning algorithm.
","[{'version': 'v1', 'created': 'Wed, 7 Sep 2016 11:03:35 GMT'}]",2016-09-08,"[['Nguyen', 'Hoc Thai', ''], ['Le', 'Hai Xuan', '']]","['Mobile robot', 'Path planning', 'Obstacle avoidance', 'Infinite loop']"
15046,0907.3226,Walid Belkhir,Walid Belkhir,From Causal Semantics To Duration Timed Models,14 pages,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The interleaving semantics is not compatible with both action refinement and
durational actions. Since many true concurrency semantics are congruent w.r.t.
action refinement, notably the causality and the maximality ones, this has
challenged us to study the dense time behavior - where the actions are of
arbitrary fixed duration - within the causality semantics of Da Costa.
  We extend the causal transition systems with the clocks and the timed
constraints, and thus we obtain an over class of timed automata where the
actions need not to be atomic. We define a real time extension of the formal
description technique CSP, called duration-CSP, by attributing the duration to
actions. We give the operational timed causal semantics of duration-CSP as well
as its denotational semantics over the class of timed causal transition
systems. Afterwards, we prove that the two semantics are equivalent. Finally we
extend the duration-CSP language with a refinement operator $\rho$ - that
allows to replace an action with a process - and prove that it preserves the
timed causal bisimulation.
","[{'version': 'v1', 'created': 'Sat, 18 Jul 2009 15:27:45 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Apr 2010 08:56:45 GMT'}]",2010-04-14,"[['Belkhir', 'Walid', '']]","['Causality semantics', 'true concurrency', 'durational processalgebra', 'timed automata', 'action refinement']"
15047,1501.03424,Fatima El Jamiy,"Fatima El Jamiy, Abderrahmane Daif, Mohamed Azouazi and Abdelaziz
  Marzak","The potential and challenges of Big data - Recommendation systems next
  level application","appears in IJCSI International Journal of Computer Science Issues,
  Vol. 11, Issue 5, No 2, September 2014",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The continuous increase of data generated provides enormous possibilities of
both public and private companies. The management of this mass of data or big
data will play a crucial role in the society of the future, as it finds
applications in different fields. There are so much potential and extremely
useful insights hidden in the huge volume of data. The advanced analysis
techniques available including predictive analytics, text mining, semantic
analysis are needed to enable organizations to create a competitive advantage
through data analyzed with different levels of sophistication, speed and
accuracy previously unavailable. Therefore, is it still possible to have that
level of sophistication with the ubiquitous numeric ocean that accompanies use
every day via connected devices that invade our lives? However, development of
big data requires a good understanding of the issues associated with it. And
this is the purpose of this paper, which focuses on giving a close-up view of
big data analysis, opportunities and challenges.
","[{'version': 'v1', 'created': 'Wed, 14 Jan 2015 17:53:08 GMT'}]",2015-01-15,"[['Jamiy', 'Fatima El', ''], ['Daif', 'Abderrahmane', ''], ['Azouazi', 'Mohamed', ''], ['Marzak', 'Abdelaziz', '']]","['Big data', 'Data-intensive computing', 'storage', 'Largescale', 'Performance', 'CRM', 'Recommendation systems']"
15048,1010.4138,Gabor Szirtes,"Andr\'as L\H{o}rincz, Zsolt Palotai and G\'abor Szirtes",Sparse and silent coding in neural circuits,"19 pages, 2 figures and 4 tables with pseudocodes",,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sparse coding algorithms are about finding a linear basis in which signals
can be represented by a small number of active (non-zero) coefficients. Such
coding has many applications in science and engineering and is believed to play
an important role in neural information processing. However, due to the
computational complexity of the task, only approximate solutions provide the
required efficiency (in terms of time). As new results show, under particular
conditions there exist efficient solutions by minimizing the magnitude of the
coefficients (`$l_1$-norm') instead of minimizing the size of the active subset
of features (`$l_0$-norm'). Straightforward neural implementation of these
solutions is not likely, as they require \emph{a priori} knowledge of the
number of active features. Furthermore, these methods utilize iterative
re-evaluation of the reconstruction error, which in turn implies that final
sparse forms (featuring `population sparseness') can only be reached through
the formation of a series of non-sparse representations, which is in contrast
with the overall sparse functioning of the neural systems (`lifetime
sparseness'). In this article we present a novel algorithm which integrates our
previous `$l_0$-norm' model on spike based probabilistic optimization for
sparse coding with ideas coming from novel `$l_1$-norm' solutions.
  The resulting algorithm allows neurally plausible implementation and does not
require an exactly defined sparseness level thus it is suitable for
representing natural stimuli with a varying number of features. We also
demonstrate that the combined method significantly extends the domain where
optimal solutions can be found by `$l_1$-norm' based algorithms.
","[{'version': 'v1', 'created': 'Wed, 20 Oct 2010 09:29:03 GMT'}]",2016-08-14,"[['Lőrincz', 'András', ''], ['Palotai', 'Zsolt', ''], ['Szirtes', 'Gábor', '']]","['l1-norm', 'cross entropy method', 'sparse coding']"
15049,1501.02659,Damianos Gavalas,"Thomas Chatzidimitris, Damianos Gavalas, Vlasios Kasapakis",PacMap: Transferring PacMan to the Physical Realm,"6 pages, 3 figures, Proceedings of the International Conference on
  Pervasive Games (PERGAMES'2014), Rome, Italy, 27 October 2014",,,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses the implementation of the pervasive game PacMap.
Openness and portability have been the main design objectives for PacMap. We
elaborate on programming techniques which may be applicable to a broad range of
location-based games that involve the movement of virtual characters over map
interfaces. In particular, we present techniques to execute shortest path
algorithms on spatial environments bypassing the restrictions imposed by
commercial mapping services. Last, we present ways to improve the movement and
enhance the intelligence of virtual characters taking into consideration the
actions and position of players in location-based games.
","[{'version': 'v1', 'created': 'Mon, 12 Jan 2015 14:27:37 GMT'}]",2015-01-13,"[['Chatzidimitris', 'Thomas', ''], ['Gavalas', 'Damianos', ''], ['Kasapakis', 'Vlasios', '']]","['PacMap', 'Pacman', 'pervasive games', 'location-based games', 'shortest path', 'Dijkstra']"
15050,1407.8151,Fabio Cuzzolin,Fabio Cuzzolin,Consistent transformations of belief functions,,,,,cs.AI stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consistent belief functions represent collections of coherent or
non-contradictory pieces of evidence, but most of all they are the counterparts
of consistent knowledge bases in belief calculus. The use of consistent
transformations cs[.] in a reasoning process to guarantee coherence can
therefore be desirable, and generalizes similar techniques in classical logic.
Transformations can be obtained by minimizing an appropriate distance measure
between the original belief function and the collection of consistent ones. We
focus here on the case in which distances are measured using classical Lp
norms, in both the ""mass space"" and the ""belief space"" representation of belief
functions. While mass consistent approximations reassign the mass not focussed
on a chosen element of the frame either to the whole frame or to all supersets
of the element on an equal basis, approximations in the belief space do
distinguish these focal elements according to the ""focussed consistent
transformation"" principle. The different approximations are interpreted and
compared, with the help of examples.
","[{'version': 'v1', 'created': 'Wed, 30 Jul 2014 18:25:31 GMT'}]",2014-07-31,"[['Cuzzolin', 'Fabio', '']]","['Theory of evidence', 'belief logic', 'consistent belief functions', 'simplicial complex', 'Lp norms', 'consistent transformation']"
15051,1108.4224,Graham Norton,Graham H. Norton,On Sequences with a Perfect Linear Complexity Profile,"19 pages, 3 tables",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We derive B\'ezout identities for the minimal polynomials of a finite
sequence and use them to prove a theorem of Wang and Massey on binary sequences
with a perfect linear complexity profile. We give a new proof of Rueppel's
conjecture and simplify Dai's original proof. We obtain short proofs of results
of Niederreiter relating the linear complexity of a sequence s and K(s), which
was defined using continued fractions. We give an upper bound for the sum of
the linear complexities of any sequence. This bound is tight for sequences with
a perfect linear complexity profile and we apply it to characterise these
sequences in two new ways.
","[{'version': 'v1', 'created': 'Mon, 22 Aug 2011 00:57:13 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Aug 2011 00:19:46 GMT'}]",2011-08-24,"[['Norton', 'Graham H.', '']]","['B´ezout identity', 'continued fractions', 'linear complexity', 'minimal polynomial']"
15052,1712.03565,Faheem Zafari,"Faheem Zafari, Jian Li, Kin K. Leung, Don Towsley, Ananthram Swami","Optimal Energy Consumption with Communication, Computation, Caching and
  QoI-Guarantee",,,,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Energy efficiency is a fundamental requirement of modern data communication
systems, and its importance is reflected in much recent work on performance
analysis of system energy consumption. However, most works have only focused on
communication and computation costs, but do not account for caching costs.
Given the increasing interest in cache networks, this is a serious deficiency.
{In this paper, we consider the problem of energy consumption in data
communication, compression and caching (C$3$) with a Quality of Information
(QoI) guarantee in a communication network. {Our goal is to identify the
optimal data compression rate and data placement over the network to minimize
the overall energy consumption in the network.} he formulated problem is a
\emph{Mixed Integer Non-Linear Programming} (MINLP) problem with non-convex
functions, which is NP-hard in general. } {We} propose a variant of spatial
branch and bound algorithm (V-SBB), that can {provide} the $\epsilon$-global
optimal solution to {our problem}. {We numerically show that our C3
optimization framework can improve the energy efficiency up to 88\% compared to
any C2 optimization between communication and computation or caching.
Furthermore, for our energy consumption problem, V-SBB {provides comparatively
better solution than some other MINLP solvers.}}
","[{'version': 'v1', 'created': 'Sun, 10 Dec 2017 17:44:10 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Dec 2017 17:07:20 GMT'}, {'version': 'v3', 'created': 'Tue, 27 Nov 2018 17:28:51 GMT'}, {'version': 'v4', 'created': 'Thu, 24 Jan 2019 14:21:27 GMT'}, {'version': 'v5', 'created': 'Sat, 26 Jan 2019 23:45:30 GMT'}]",2019-01-29,"[['Zafari', 'Faheem', ''], ['Li', 'Jian', ''], ['Leung', 'Kin K.', ''], ['Towsley', 'Don', ''], ['Swami', 'Ananthram', '']]","['Energy Tradeoff', 'Data analytics', 'Data Caching', 'Quality of Information', 'Mixed Integer Non-Linear']"
15053,1704.07162,Ismail Aydogdu,"Ismail Aydogdu, Fatmanur Gursoy",Z2Z4Z8-Cyclic Codes,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we study Z2Z4Z8-additive codes, which are the extension of
recently introduced Z2Z4-additive codes. We determine the standard forms of the
generator and parity-check matrices of Z2Z4Z8-additive codes. Moreover, we
investigate Z2Z4Z8-cyclic codes giving their generator polynomials and spanning
sets. We also give some illustrative examples of both Z2Z4Z8-additive codes and
Z2Z4Z8-cyclic codes.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 11:58:53 GMT'}]",2017-04-25,"[['Aydogdu', 'Ismail', ''], ['Gursoy', 'Fatmanur', '']]","['Generator Matrix', 'Parity-check Matrix', 'Cyclic Codes', 'Z2Z4Z8-additive Codes']"
15054,1710.01363,Carl Yang,Carl Yang and Kevin Chen-Chuan Chang,"Relationship Profiling over Social Networks: Reverse Smoothness from
  Similarity to Closeness",,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  On social networks, while nodes bear rich attributes, we often lack the
`semantics' of why each link is formed-- and thus we are missing the `road
signs' to navigate and organize the complex social universe. How to identify
relationship semantics without labels? Founded on the prevalent homophily
principle, we propose the novel problem of Attribute-based Relationship
Profiling (ARP), to profile the closeness w.r.t. the underlying relationships
(e.g., schoolmate) between users based on their similarity in the corresponding
attributes (e.g., education) and, as output, learn a set of social affinity
graphs, where each link is weighted by its probabilities of carrying the
relationships. As requirements, ARP should be systematic and complete to
profile every link for every relationship-- our challenges lie in effectively
modeling homophily. We propose a novel reverse smoothness principle by
observing that the similarity-closeness duality of homophily is consistent with
the well-known smoothness assumption in graph-based semi-supervised learning--
only the direction of inference is reversed. To realize smoothness over noisy
social graphs, we further propose a novel holistic closeness modeling approach
to capture `high-order' smoothness by extending closeness from edges to paths.
Extensive experiments on three real-world datasets demonstrate the efficacy of
ARP.
","[{'version': 'v1', 'created': 'Tue, 3 Oct 2017 19:46:48 GMT'}]",2017-10-05,"[['Yang', 'Carl', ''], ['Chang', 'Kevin Chen-Chuan', '']]","['social networks', 'graph analysis', 'homophily', 'smoothness']"
15055,1504.02790,Maria Angeles Hinosolango Ph.D.,Maria Angeles Dano-Hinosolango,Sharpening Skills in Using Presentation Tools: Students' Experiences,"It has 10 pages and 4 tables to illustrate the results of the data
  gathered","This has been published in International Journal on Integrating
  Technology in Education (IJITE) Vol 4, No 1, 2015 with the ISSN 2320-1886
  (Online); 2320-3935 (Print)",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Making use of Information and Communication Technology resources is deemed
necessary for students. With this, they need to demonstrate their competence in
using various technologies such as Prezi and PowerPoint to communicate
effectively and efficiently. Hence, their experiences in using these
presentation tools is important to assist them in their needs. In this study,
all the fourth year Bachelor of Science in Technology Communication Management
students who have used the PowerPoint and Prezi were the respondents. Survey
instruments were given to determine the experiences of students of these
technologies based on their familiarity, skills, and effectiveness in
delivering the reports and presentations. It was found out that students were
generally good in using these tools. On the other hand, following the basic
rules to use these presentation tools effectively has to be reinforced in the
classroom to enhance and enrich their learning in sharpening their skills on
presentation tools.
","[{'version': 'v1', 'created': 'Thu, 9 Apr 2015 16:34:48 GMT'}]",2015-04-14,"[['Dano-Hinosolango', 'Maria Angeles', '']]","['ICT', 'Prezi', 'PowerPoint', 'presentation skills']"
15056,1606.04766,Jianyu Lin,"Jianyu Lin, Neil T. Clancy, Xueqing Sun, Ji Qi, Mirek Janatka, Danail
  Stoyanov, Daniel S. Elson","Probe-based Rapid Hybrid Hyperspectral and Tissue Surface Imaging Aided
  by Fully Convolutional Networks","This paper has been submitted to MICCAI2016 on 17 March, 2016, and
  conditionally accepted on 2 June, 2016",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tissue surface shape and reflectance spectra provide rich intra-operative
information useful in surgical guidance. We propose a hybrid system which
displays an endoscopic image with a fast joint inspection of tissue surface
shape using structured light (SL) and hyperspectral imaging (HSI). For SL a
miniature fibre probe is used to project a coloured spot pattern onto the
tissue surface. In HSI mode standard endoscopic illumination is used, with the
fibre probe collecting reflected light and encoding the spatial information
into a linear format that can be imaged onto the slit of a spectrograph.
Correspondence between the arrangement of fibres at the distal and proximal
ends of the bundle was found using spectral encoding. Then during pattern
decoding, a fully convolutional network (FCN) was used for spot detection,
followed by a matching propagation algorithm for spot identification. This
method enabled fast reconstruction (12 frames per second) using a GPU. The
hyperspectral image was combined with the white light image and the
reconstructed surface, showing the spectral information of different areas.
Validation of this system using phantom and ex vivo experiments has been
demonstrated.
","[{'version': 'v1', 'created': 'Wed, 15 Jun 2016 14:00:07 GMT'}]",2016-06-16,"[['Lin', 'Jianyu', ''], ['Clancy', 'Neil T.', ''], ['Sun', 'Xueqing', ''], ['Qi', 'Ji', ''], ['Janatka', 'Mirek', ''], ['Stoyanov', 'Danail', ''], ['Elson', 'Daniel S.', '']]","['structured light', 'hyperspectral imaging', 'endoscopy', 'deep learning']"
15057,2007.05729,Koushik Nagasubramanian,"Koushik Nagasubramanian, Asheesh K. Singh, Arti Singh, Soumik Sarkar,
  Baskar Ganapathysubramanian","Usefulness of interpretability methods to explain deep learning based
  plant stress phenotyping","15 pages, 6 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning techniques have been successfully deployed for automating plant
stress identification and quantification. In recent years, there is a growing
push towards training models that are interpretable -i.e. that justify their
classification decisions by visually highlighting image features that were
crucial for classification decisions. The expectation is that trained network
models utilize image features that mimic visual cues used by plant
pathologists. In this work, we compare some of the most popular
interpretability methods: Saliency Maps, SmoothGrad, Guided Backpropogation,
Deep Taylor Decomposition, Integrated Gradients, Layer-wise Relevance
Propagation and Gradient times Input, for interpreting the deep learning model.
We train a DenseNet-121 network for the classification of eight different
soybean stresses (biotic and abiotic). Using a dataset consisting of 16,573 RGB
images of healthy and stressed soybean leaflets captured under controlled
conditions, we obtained an overall classification accuracy of 95.05 \%. For a
diverse subset of the test data, we compared the important features with those
identified by a human expert. We observed that most interpretability methods
identify the infected regions of the leaf as important features for some -- but
not all -- of the correctly classified images. For some images, the output of
the interpretability methods indicated that spurious feature correlations may
have been used to correctly classify them. Although the output explanation maps
of these interpretability methods may be different from each other for a given
image, we advocate the use of these interpretability methods as `hypothesis
generation' mechanisms that can drive scientific insight.
","[{'version': 'v1', 'created': 'Sat, 11 Jul 2020 09:28:50 GMT'}]",2020-07-14,"[['Nagasubramanian', 'Koushik', ''], ['Singh', 'Asheesh K.', ''], ['Singh', 'Arti', ''], ['Sarkar', 'Soumik', ''], ['Ganapathysubramanian', 'Baskar', '']]","['Interpretability', 'Plant stress', 'Deep Learning']"
15058,1409.4194,Pariya Kashfi,"Pariya Kashfi, Robert Feldt, Agneta Nilsson, Richard Berntsson
  Svensson",A Conceptual UX-aware Model of Requirements,"6th International Working Conference on Human-Centred Software
  Engineering",,,,cs.SE cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  User eXperience (UX) is becoming increasingly important for success of
software products. Yet, many companies still face various challenges in their
work with UX. Part of these challenges relate to inadequate knowledge and
awareness of UX and that current UX models are commonly not practical nor well
integrated into existing Software Engineering (SE) models and concepts.
Therefore, we present a conceptual UX-aware model of requirements for software
development practitioners. This layered model shows the interrelation between
UX and functional and quality requirements. The model is developed based on
current models of UX and software quality characteristics. Through the model we
highlight the main differences between various requirement types in particular
essentially subjective and accidentally subjective quality requirements. We
also present the result of an initial validation of the model through
interviews with 12 practitioners and researchers. Our results show that the
model can raise practitioners' knowledge and awareness of UX in particular in
relation to requirement and testing activities. It can also facilitate
UX-related communication among stakeholders with different backgrounds.
","[{'version': 'v1', 'created': 'Mon, 15 Sep 2014 09:45:48 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Jun 2016 20:02:58 GMT'}]",2016-06-30,"[['Kashfi', 'Pariya', ''], ['Feldt', 'Robert', ''], ['Nilsson', 'Agneta', ''], ['Svensson', 'Richard Berntsson', '']]","['software quality', 'quality requirements', 'user experience', 'usability', 'non-task-related', 'hedonic', 'non-instrumental']"
15059,1606.09042,Francois-Xavier Aguessy,"Aguessy Fran\c{c}ois-Xavier, Bettan Olivier, Blanc Gr\'egory, Conan
  Vania, Debar Herv\'e",Bayesian Attack Model for Dynamic Risk Assessment,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Because of the threat of advanced multi-step attacks, it is often difficult
for security operators to completely cover all vulnerabilities when deploying
remediations. Deploying sensors to monitor attacks exploiting residual
vulnerabilities is not sufficient and new tools are needed to assess the risk
associated to the security events produced by these sensors. Although attack
graphs were proposed to represent known multi-step attacks occurring in an
information system, they are not directly suited for dynamic risk assessment.
In this paper, we present the Bayesian Attack Model (BAM), a Bayesian
network-based extension to topological attack graphs, capable of handling
topological cycles, making it fit for any information system. Evaluation is
performed on realistic topologies to study the sensitivity of its probabilistic
parameters.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2016 11:01:21 GMT'}]",2016-06-30,"[['François-Xavier', 'Aguessy', ''], ['Olivier', 'Bettan', ''], ['Grégory', 'Blanc', ''], ['Vania', 'Conan', ''], ['Hervé', 'Debar', '']]","['Bayesian Attack Model', 'dynamic risk assessment', 'topological attack graph', 'cycle management', 'Bayesian network']"
15060,1609.01775,Ergys Ristani,"Ergys Ristani, Francesco Solera, Roger S. Zou, Rita Cucchiara, Carlo
  Tomasi","Performance Measures and a Data Set for Multi-Target, Multi-Camera
  Tracking",ECCV 2016 Workshop on Benchmarking Multi-Target Tracking,,,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  To help accelerate progress in multi-target, multi-camera tracking systems,
we present (i) a new pair of precision-recall measures of performance that
treats errors of all types uniformly and emphasizes correct identification over
sources of error; (ii) the largest fully-annotated and calibrated data set to
date with more than 2 million frames of 1080p, 60fps video taken by 8 cameras
observing more than 2,700 identities over 85 minutes; and (iii) a reference
software system as a comparison baseline. We show that (i) our measures
properly account for bottom-line identity match performance in the multi-camera
setting; (ii) our data set poses realistic challenges to current trackers; and
(iii) the performance of our system is comparable to the state of the art.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2016 21:58:25 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Sep 2016 17:27:19 GMT'}]",2016-09-20,"[['Ristani', 'Ergys', ''], ['Solera', 'Francesco', ''], ['Zou', 'Roger S.', ''], ['Cucchiara', 'Rita', ''], ['Tomasi', 'Carlo', '']]","['Performance Evaluation', 'Multi Camera Tracking', 'IdentityManagement', 'Multi Camera Data Set', 'Large Scale Data Set']"
15061,1604.08080,Germ\'an Andr\'es Delbianco,"Germ\'an Andr\'es Delbianco, Ilya Sergey, Aleksandar Nanevski and
  Anindya Banerjee",Concurrent Data Structures Linked in Time,,,,,cs.LO cs.DC cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Arguments about correctness of a concurrent data structure are typically
carried out by using the notion of linearizability and specifying the
linearization points of the data structure's procedures. Such arguments are
often cumbersome as the linearization points' position in time can be dynamic
(depend on the interference, run-time values and events from the past, or even
future), non-local (appear in procedures other than the one considered), and
whose position in the execution trace may only be determined after the
considered procedure has already terminated.
  In this paper we propose a new method, based on a separation-style logic, for
reasoning about concurrent objects with such linearization points. We embrace
the dynamic nature of linearization points, and encode it as part of the data
structure's auxiliary state, so that it can be dynamically modified in place by
auxiliary code, as needed when some appropriate run-time event occurs. We name
the idea linking-in-time, because it reduces temporal reasoning to spatial
reasoning. For example, modifying a temporal position of a linearization point
can be modeled similarly to a pointer update in separation logic. Furthermore,
the auxiliary state provides a convenient way to concisely express the
properties essential for reasoning about clients of such concurrent objects. We
illustrate the method by verifying (mechanically in Coq) an intricate optimal
snapshot algorithm due to Jayanti, as well as some clients.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2016 14:13:46 GMT'}, {'version': 'v2', 'created': 'Tue, 3 May 2016 00:08:37 GMT'}, {'version': 'v3', 'created': 'Mon, 24 Oct 2016 17:22:22 GMT'}, {'version': 'v4', 'created': 'Wed, 18 Jan 2017 13:23:29 GMT'}]",2017-01-19,"[['Delbianco', 'Germán Andrés', ''], ['Sergey', 'Ilya', ''], ['Nanevski', 'Aleksandar', ''], ['Banerjee', 'Anindya', '']]","['Concurrent separation logics', 'Linearization points', 'Snapshot Algorithms', 'FCSL']"
15062,1401.4696,Ronald Hochreiter,Ronald Hochreiter,Evolutionary Optimization for Decision Making under Uncertainty,Keynote talk at the MENDEL 2011,Proceedings of MENDEL 2011: 107-113. 2011,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optimizing decision problems under uncertainty can be done using a variety of
solution methods. Soft computing and heuristic approaches tend to be powerful
for solving such problems. In this overview article, we survey Evolutionary
Optimization techniques to solve Stochastic Programming problems - both for the
single-stage and multi-stage case.
","[{'version': 'v1', 'created': 'Sun, 19 Jan 2014 16:42:57 GMT'}]",2014-01-21,"[['Hochreiter', 'Ronald', '']]","['Optimization under Uncertainty', 'Optimal Decision Making', 'Evolutionary Optimization', 'Stochastic Programming', 'Multi-stage Stochastic Programming']"
15063,1212.4315,Marco Guerini,Lorenzo Gatti and Marco Guerini,Assessing Sentiment Strength in Words Prior Polarities,To appear at Coling 2012,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many approaches to sentiment analysis rely on lexica where words are tagged
with their prior polarity - i.e. if a word out of context evokes something
positive or something negative. In particular, broad-coverage resources like
SentiWordNet provide polarities for (almost) every word. Since words can have
multiple senses, we address the problem of how to compute the prior polarity of
a word starting from the polarity of each sense and returning its polarity
strength as an index between -1 and 1. We compare 14 such formulae that appear
in the literature, and assess which one best approximates the human judgement
of prior polarities, with both regression and classification models.
","[{'version': 'v1', 'created': 'Tue, 18 Dec 2012 11:33:50 GMT'}]",2012-12-19,"[['Gatti', 'Lorenzo', ''], ['Guerini', 'Marco', '']]","['Prior Polarities', 'Sentiment Analysis', 'SentiWordNet']"
15064,1506.02721,Arthur Ramos BSCS,"Arthur F. Ramos, Ruy J. G. B. de Queiroz, and Anjolina G. de Oliveira",On the Groupoid Model of Computational Paths,12 pages + 2 appendix,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The main objective of this work is to study mathematical properties of
computational paths. Originally proposed by de Queiroz \& Gabbay (1994) as
`sequences or rewrites', computational paths are taken to be terms of the
identity type of Martin L\""of's Intensional Type Theory, since these paths can
be seen as the grounds on which the propositional equality between two
computational objects stand. From this perspective, this work aims to show that
one of the properties of the identity type is present on computational paths.
We are referring to the fact that that the identity type induces a groupoid
structure, as proposed by Hofmann \& Streicher (1994). Using categorical
semantics, we show that computational paths induce a groupoid structure. We
also show that computational paths are capable of inducing higher categorical
structures.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2015 23:11:51 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Sep 2016 18:24:15 GMT'}]",2016-09-09,"[['Ramos', 'Arthur F.', ''], ['de Queiroz', 'Ruy J. G. B.', ''], ['de Oliveira', 'Anjolina G.', '']]","['Computational paths', 'groupoid model', 'equality theory', 'term rewriting systems', 'type theory', 'category theory', 'higher categorical structures']"
15065,0903.3690,Wei Pan,Xin Li and Marc Moreno Maza and Wei Pan,Computations modulo regular chains,"27 pages, 8 figures",,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The computation of triangular decompositions are based on two fundamental
operations: polynomial GCDs modulo regular chains and regularity test modulo
saturated ideals. We propose new algorithms for these core operations relying
on modular methods and fast polynomial arithmetic. Our strategies take also
advantage of the context in which these operations are performed. We report on
extensive experimentation, comparing our code to pre-existing Maple
implementations, as well as more optimized Magma functions. In most cases, our
new code outperforms the other packages by several orders of magnitude.
","[{'version': 'v1', 'created': 'Sat, 21 Mar 2009 20:43:02 GMT'}, {'version': 'v2', 'created': 'Sat, 25 Jul 2009 03:01:00 GMT'}]",2009-07-25,"[['Li', 'Xin', ''], ['Maza', 'Marc Moreno', ''], ['Pan', 'Wei', '']]","['Fast polynomial arithmetic', 'regular chain', 'regular GCD', 'subresultants', 'triangular decomposition', 'polynomial systems']"
15066,1003.1343,Gregory Benford,David H. Wolpert and Gregory Benford,What does Newcomb's paradox teach us?,,,,,cs.GT cs.AI math.OC math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Newcomb's paradox you choose to receive either the contents of a
particular closed box, or the contents of both that closed box and another one.
Before you choose, a prediction algorithm deduces your choice, and fills the
two boxes based on that deduction. Newcomb's paradox is that game theory
appears to provide two conflicting recommendations for what choice you should
make in this scenario. We analyze Newcomb's paradox using a recent extension of
game theory in which the players set conditional probability distributions in a
Bayes net. We show that the two game theory recommendations in Newcomb's
scenario have different presumptions for what Bayes net relates your choice and
the algorithm's prediction. We resolve the paradox by proving that these two
Bayes nets are incompatible. We also show that the accuracy of the algorithm's
prediction, the focus of much previous work, is irrelevant. In addition we show
that Newcomb's scenario only provides a contradiction between game theory's
expected utility and dominance principles if one is sloppy in specifying the
underlying Bayes net. We also show that Newcomb's paradox is time-reversal
invariant; both the paradox and its resolution are unchanged if the algorithm
makes its `prediction' after you make your choice rather than before.
","[{'version': 'v1', 'created': 'Sat, 6 Mar 2010 00:52:29 GMT'}]",2010-03-09,"[['Wolpert', 'David H.', ''], ['Benford', 'Gregory', '']]","['Newcomb’s paradox', 'game theory', 'Bayes net', 'causality', 'determinism']"
15067,1412.3773,Joris Mooij,"Joris M. Mooij, Jonas Peters, Dominik Janzing, Jakob Zscheischler,
  Bernhard Sch\""olkopf","Distinguishing cause from effect using observational data: methods and
  benchmarks","101 pages, second revision submitted to Journal of Machine Learning
  Research","Journal of Machine Learning Research 17(32):1-102, 2016",,,cs.LG cs.AI stat.ML stat.OT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The discovery of causal relationships from purely observational data is a
fundamental problem in science. The most elementary form of such a causal
discovery problem is to decide whether X causes Y or, alternatively, Y causes
X, given joint observations of two variables X, Y. An example is to decide
whether altitude causes temperature, or vice versa, given only joint
measurements of both variables. Even under the simplifying assumptions of no
confounding, no feedback loops, and no selection bias, such bivariate causal
discovery problems are challenging. Nevertheless, several approaches for
addressing those problems have been proposed in recent years. We review two
families of such methods: Additive Noise Methods (ANM) and Information
Geometric Causal Inference (IGCI). We present the benchmark CauseEffectPairs
that consists of data for 100 different cause-effect pairs selected from 37
datasets from various domains (e.g., meteorology, biology, medicine,
engineering, economy, etc.) and motivate our decisions regarding the ""ground
truth"" causal directions of all pairs. We evaluate the performance of several
bivariate causal discovery methods on these real-world benchmark data and in
addition on artificially simulated data. Our empirical results on real-world
data indicate that certain methods are indeed able to distinguish cause from
effect using only purely observational data, although more benchmark data would
be needed to obtain statistically significant conclusions. One of the best
performing methods overall is the additive-noise method originally proposed by
Hoyer et al. (2009), which obtains an accuracy of 63+-10 % and an AUC of
0.74+-0.05 on the real-world benchmark. As the main theoretical contribution of
this work we prove the consistency of that method.
","[{'version': 'v1', 'created': 'Thu, 11 Dec 2014 19:34:39 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Jul 2015 14:51:36 GMT'}, {'version': 'v3', 'created': 'Thu, 24 Dec 2015 11:37:57 GMT'}]",2016-05-03,"[['Mooij', 'Joris M.', ''], ['Peters', 'Jonas', ''], ['Janzing', 'Dominik', ''], ['Zscheischler', 'Jakob', ''], ['Schölkopf', 'Bernhard', '']]","['Causal discovery', 'additive noise', 'information-geometric causal inference', 'cause-effect pairs', 'benchmarks']"
15068,1501.05921,Emanuel Deutschmann,Emanuel Deutschmann,The Spatial Structure of Transnational Human Activity,,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent studies have shown that the spatial structures of animal displacements
and local-scale human motion follow L\'{e}vy flights. Whether transnational
human activity (THA) also exhibits such a pattern has however not been
thoroughly examined as yet. To fill this gap, this article examines the
planet-scale spatial structure of THA (a) across eight types of mobility and
communication and (b) in its development over time. Combining data from various
sources, it is shown that the spatial structure of THA can indeed be
approximated by L\'{e}vy flights with heavy tails that obey power laws. Scaling
exponent and power-law fit differ by type of THA, being highest in
refuge-seeking and tourism and lowest in student exchange. Variance in the
availability of resources and opportunities for satisfying associated needs
appears to explain these differences. Over time, the L\'{e}vy-flight pattern
remains intact and remarkably stable, contradicting the popular idea that
socio-technological trends lead to a ""death of distance."" Longitudinal change
occurs only in some types of THA and predominantly at short distances,
indicating regional shifts rather than globalization.
","[{'version': 'v1', 'created': 'Fri, 23 Jan 2015 19:19:19 GMT'}]",2015-01-26,"[['Deutschmann', 'Emanuel', '']]","['transnationalism', 'mobility', 'communication', 'Lévy flight', 'power law', 'globalization']"
15069,1002.3086,Pedro Alejandro Ortega,"Pedro A. Ortega, Daniel A. Braun",Convergence of Bayesian Control Rule,"8 pages, 7 figures",,,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, new approaches to adaptive control have sought to reformulate the
problem as a minimization of a relative entropy criterion to obtain tractable
solutions. In particular, it has been shown that minimizing the expected
deviation from the causal input-output dependencies of the true plant leads to
a new promising stochastic control rule called the Bayesian control rule. This
work proves the convergence of the Bayesian control rule under two sufficient
assumptions: boundedness, which is an ergodicity condition; and consistency,
which is an instantiation of the sure-thing principle.
","[{'version': 'v1', 'created': 'Tue, 16 Feb 2010 14:14:59 GMT'}]",2010-02-17,"[['Ortega', 'Pedro A.', ''], ['Braun', 'Daniel A.', '']]","['Adaptive behavior', 'Intervention calculus', 'Bayesian control', 'Kullback-Leibler-divergence']"
15070,1505.04546,Yukiko Yamauchi,"Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, and Masafumi Yamashita","Plane Formation by Synchronous Mobile Robots in the Three Dimensional
  Euclidean Space",,,,,cs.DC cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Creating a swarm of mobile computing entities frequently called robots,
agents or sensor nodes, with self-organization ability is a contemporary
challenge in distributed computing. Motivated by this, we investigate the plane
formation problem that requires a swarm of robots moving in the three
dimensional Euclidean space to land on a common plane. The robots are fully
synchronous and endowed with visual perception. But they do not have
identifiers, nor access to the global coordinate system, nor any means of
explicit communication with each other. Though there are plenty of results on
the agreement problem for robots in the two dimensional plane, for example, the
point formation problem, the pattern formation problem, and so on, this is the
first result for robots in the three dimensional space. This paper presents a
necessary and sufficient condition for fully-synchronous robots to solve the
plane formation problem that does not depend on obliviousness i.e., the
availability of local memory at robots. An implication of the result is
somewhat counter-intuitive: The robots cannot form a plane from most of the
semi-regular polyhedra, while they can form a plane from every regular
polyhedron (except a regular icosahedron), whose symmetry is usually considered
to be higher than any semi-regular polyhedrdon.
","[{'version': 'v1', 'created': 'Mon, 18 May 2015 08:15:12 GMT'}, {'version': 'v2', 'created': 'Sun, 24 May 2015 07:49:26 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Feb 2016 10:20:45 GMT'}]",2016-02-17,"[['Yamauchi', 'Yukiko', ''], ['Uehara', 'Taichi', ''], ['Kijima', 'Shuji', ''], ['Yamashita', 'Masafumi', '']]","['symmetry breaking', 'mobile robots', 'plane formation', 'rotation group']"
15071,1403.1080,Kieran Greer Dr,Kieran Greer,New Ideas for Brain Modelling,,"BRAIN. Broad Research in Artificial Intelligence and Neuroscience,
  Volume 6, Issues 3-4, December 2015, ISSN 2067-3957 (online), ISSN 2068 -
  0473 (print)",,,cs.AI q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes some biologically-inspired processes that could be used
to build the sort of networks that we associate with the human brain. New to
this paper, a 'refined' neuron will be proposed. This is a group of neurons
that by joining together can produce a more analogue system, but with the same
level of control and reliability that a binary neuron would have. With this new
structure, it will be possible to think of an essentially binary system in
terms of a more variable set of values. The paper also shows how recent
research associated with the new model, can be combined with established
theories, to produce a more complete picture. The propositions are largely in
line with conventional thinking, but possibly with one or two more radical
suggestions. An earlier cognitive model can be filled in with more specific
details, based on the new research results, where the components appear to fit
together almost seamlessly. The intention of the research has been to describe
plausible 'mechanical' processes that can produce the appropriate brain
structures and mechanisms, but that could be used without the magical
'intelligence' part that is still not fully understood. There are also some
important updates from an earlier version of this paper.
","[{'version': 'v1', 'created': 'Wed, 5 Mar 2014 11:17:11 GMT'}, {'version': 'v2', 'created': 'Sat, 5 Jul 2014 21:16:13 GMT'}, {'version': 'v3', 'created': 'Mon, 9 May 2016 08:28:20 GMT'}, {'version': 'v4', 'created': 'Mon, 17 Oct 2016 09:02:21 GMT'}]",2018-02-06,"[['Greer', 'Kieran', '']]","['Neuron', 'neural network', 'cognitive model', 'self-organise', 'analogue', 'resonance']"
15072,1604.06412,Paolo Missier,Paolo Missier and Jacek Cala and Eldarina Wijaya,"The data, they are a-changin'",,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The cost of deriving actionable knowledge from large datasets has been
decreasing thanks to a convergence of positive factors: low cost data
generation, inexpensively scalable storage and processing infrastructure
(cloud), software frameworks and tools for massively distributed data
processing, and parallelisable data analytics algorithms. One observation that
is often overlooked, however, is that each of these elements is not immutable,
rather they all evolve over time. This suggests that the value of such
derivative knowledge may decay over time, unless it is preserved by reacting to
those changes. Our broad research goal is to develop models, methods, and tools
for selectively reacting to changes by balancing costs and benefits, i.e.
through complete or partial re-computation of some of the underlying processes.
In this paper we present an initial model for reasoning about change and
re-computations, and show how analysis of detailed provenance of derived
knowledge informs re-computation decisions. We illustrate the main ideas
through a real-world case study in genomics, namely on the interpretation of
human variants in support of genetic diagnosis.
","[{'version': 'v1', 'created': 'Thu, 21 Apr 2016 18:40:20 GMT'}]",2016-04-22,"[['Missier', 'Paolo', ''], ['Cala', 'Jacek', ''], ['Wijaya', 'Eldarina', '']]","['re-computation', 'big data processing', 'provenance', 'data change']"
15073,1312.7292,Prashanth L.A.,"Prashanth L.A., Abhranil Chatterjee and Shalabh Bhatnagar","Two Timescale Convergent Q-learning for Sleep--Scheduling in Wireless
  Sensor Networks",,,,,cs.SY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider an intrusion detection application for Wireless
Sensor Networks (WSNs). We study the problem of scheduling the sleep times of
the individual sensors to maximize the network lifetime while keeping the
tracking error to a minimum. We formulate this problem as a
partially-observable Markov decision process (POMDP) with continuous
state-action spaces, in a manner similar to (Fuemmeler and Veeravalli [2008]).
However, unlike their formulation, we consider infinite horizon discounted and
average cost objectives as performance criteria. For each criterion, we propose
a convergent on-policy Q-learning algorithm that operates on two timescales,
while employing function approximation to handle the curse of dimensionality
associated with the underlying POMDP. Our proposed algorithm incorporates a
policy gradient update using a one-simulation simultaneous perturbation
stochastic approximation (SPSA) estimate on the faster timescale, while the
Q-value parameter (arising from a linear function approximation for the
Q-values) is updated in an on-policy temporal difference (TD) algorithm-like
fashion on the slower timescale. The feature selection scheme employed in each
of our algorithms manages the energy and tracking components in a manner that
assists the search for the optimal sleep-scheduling policy. For the sake of
comparison, in both discounted and average settings, we also develop a function
approximation analogue of the Q-learning algorithm. This algorithm, unlike the
two-timescale variant, does not possess theoretical convergence guarantees.
Finally, we also adapt our algorithms to include a stochastic iterative
estimation scheme for the intruder's mobility model. Our simulation results on
a 2-dimensional network setting suggest that our algorithms result in better
tracking accuracy at the cost of only a few additional sensors, in comparison
to a recent prior work.
","[{'version': 'v1', 'created': 'Fri, 27 Dec 2013 16:13:07 GMT'}, {'version': 'v2', 'created': 'Sun, 23 Mar 2014 13:44:48 GMT'}]",2014-03-25,"[['A.', 'Prashanth L.', ''], ['Chatterjee', 'Abhranil', ''], ['Bhatnagar', 'Shalabh', '']]","['Sensor Networks', 'Sleep-Wake Scheduling', 'Reinforcement Learning', 'Q-learning', 'SimultaneousPerturbation', 'Function Approximation', 'SPSA']"
15074,1607.02902,Yewen Pu,"Yewen Pu, Karthik Narasimhan, Armando Solar-Lezama, Regina Barzilay",sk_p: a neural program corrector for MOOCs,,,,,cs.PL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a novel technique for automatic program correction in MOOCs,
capable of fixing both syntactic and semantic errors without manual, problem
specific correction strategies. Given an incorrect student program, it
generates candidate programs from a distribution of likely corrections, and
checks each candidate for correctness against a test suite.
  The key observation is that in MOOCs many programs share similar code
fragments, and the seq2seq neural network model, used in the natural-language
processing task of machine translation, can be modified and trained to recover
these fragments.
  Experiment shows our scheme can correct 29% of all incorrect submissions and
out-performs state of the art approach which requires manual, problem specific
correction strategies.
","[{'version': 'v1', 'created': 'Mon, 11 Jul 2016 11:08:00 GMT'}]",2016-07-12,"[['Pu', 'Yewen', ''], ['Narasimhan', 'Karthik', ''], ['Solar-Lezama', 'Armando', ''], ['Barzilay', 'Regina', '']]","['language model', 'MOOCs', 'code repair and completion']"
15075,1702.04739,Saleh Ashkboos,"Ramin Javadi, Saleh Ashkboos","An Efficient Parallel Data Clustering Algorithm Using Isoperimetric
  Number of Trees","16 pages, 6 figures",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a parallel graph-based data clustering algorithm using CUDA GPU,
based on exact clustering of the minimum spanning tree in terms of a minimum
isoperimetric criteria. We also provide a comparative performance analysis of
our algorithm with other related ones which demonstrates the general
superiority of this parallel algorithm over other competing algorithms in terms
of accuracy and speed.
","[{'version': 'v1', 'created': 'Wed, 15 Feb 2017 19:14:54 GMT'}]",2017-02-17,"[['Javadi', 'Ramin', ''], ['Ashkboos', 'Saleh', '']]","['Isoperimetric number', 'Cheeger constant', 'Normalized cut', 'Graph partitioning']"
15076,1510.04565,Zhenzhong Lan,"Zhenzhong Lan, Alexander G. Hauptmann","Beyond Spatial Pyramid Matching: Space-time Extended Descriptor for
  Action Recognition",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the problem of generating video features for action recognition.
The spatial pyramid and its variants have been very popular feature models due
to their success in balancing spatial location encoding and spatial invariance.
Although it seems straightforward to extend spatial pyramid to the temporal
domain (spatio-temporal pyramid), the large spatio-temporal diversity of
unconstrained videos and the resulting significantly higher dimensional
representations make it less appealing. This paper introduces the space-time
extended descriptor, a simple but efficient alternative way to include the
spatio-temporal location into the video features. Instead of only coding motion
information and leaving the spatio-temporal location to be represented at the
pooling stage, location information is used as part of the encoding step. This
method is a much more effective and efficient location encoding method as
compared to the fixed grid model because it avoids the danger of over
committing to artificial boundaries and its dimension is relatively low.
Experimental results on several benchmark datasets show that, despite its
simplicity, this method achieves comparable or better results than
spatio-temporal pyramid.
","[{'version': 'v1', 'created': 'Thu, 15 Oct 2015 14:57:37 GMT'}]",2015-10-16,"[['Lan', 'Zhenzhong', ''], ['Hauptmann', 'Alexander G.', '']]","['Content-based video retrieval', 'visual feature', 'spatial-temporalpyramids', 'space-time extended descriptor']"
15077,1304.4471,Yongjie Yang,Yongjie Yang and Jiong Guo,"The Control Complexity of $r$-Approval: from the Single-Peaked Case to
  the General Case",23 pages,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the complexity of $r$-Approval control problems in $k$-peaked
elections, where at most $k$ peaks are allowed in each vote with respect to an
order of the candidates. We show that most NP-hardness results in general
elections also hold in k-peaked elections even for $k=2,3$. On the other hand,
we derive polynomial-time algorithms for some problems for $k=2$. All our
NP-hardness results apply to Approval and sincere-strategy preference-based
Approval as well. Our study leads to many dichotomy results for the problems
considered in this paper, with respect to the values of $k$ and $r$. In
addition, we study $r$-Approval control problems from the viewpoint of
parameterized complexity and achieve both fixed-parameter tractability results
and W-hardness results, with respect to the solution size. Along the way
exploring the complexity of control problems, we obtain two byproducts which
are of independent interest. First, we prove that every graph of maximum degree
3 admits a specific 2-interval representation where every 2-interval
corresponding to a vertex contains a trivial interval and, moreover,
2-intervals may only intersect at the endpoints of the intervals. Second, we
develop a fixed-parameter tractable algorithm for a generalized $r$-Set Packing
problem with respect to the solution size, where each element in the given
universal set is allowed to occur in more than one r-subset in the solution.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2013 14:41:44 GMT'}, {'version': 'v2', 'created': 'Sun, 21 Apr 2013 07:36:23 GMT'}, {'version': 'v3', 'created': 'Sat, 29 Jun 2013 07:28:50 GMT'}, {'version': 'v4', 'created': 'Sun, 11 Jun 2017 16:46:47 GMT'}]",2017-06-13,"[['Yang', 'Yongjie', ''], ['Guo', 'Jiong', '']]","['single-peaked elections', 'multipeaked elections', 'approval voting', 'control', 'parameterizedcomplexity']"
15078,1702.02816,Alexander Schneider,"Christian Meter and Alexander Schneider and Philipp Hagemeister and
  Martin Mauve",Tor is not enough: Coercion in Remote Electronic Voting Systems,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current electronic voting systems require an anonymous channel during the
voting phase to prevent coercion. Typically, low-latency anonymization-networks
like Tor are used for this purpose. In this paper we devise a monitoring attack
that allows an attacker to monitor whether participants of an election voted,
despite the use of a low-latency network during the voting phase, thereby
breaking an important part of coercion-freeness. We implement a simulation
carrying out our attack and measure its success rates.
","[{'version': 'v1', 'created': 'Thu, 9 Feb 2017 12:58:16 GMT'}]",2017-02-10,"[['Meter', 'Christian', ''], ['Schneider', 'Alexander', ''], ['Hagemeister', 'Philipp', ''], ['Mauve', 'Martin', '']]","['electronic voting', 'Tor', 'simulation', 'e-voting', 'coercion']"
15079,1702.01052,"Mesut G\""unes","Mesut G\""unes","On the Scientific Value of Large-scale Testbeds for Wireless Multi-hop
  Networks",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Large-scale wireless testbeds have been setup in the last years with the goal
to study wireless multi-hop networks in more realistic environments. Since the
setup and operation of such a testbed is expensive in terms of money, time, and
labor, the crucial question rises whether this effort is justified with the
scientific results the testbed generates.
  In this paper, we give an answer to this question based on our experience
with the DES-Testbed, a large-scale wireless sensor network and wireless mesh
network testbed. The DES-Testbed has been operated for almost 5 years. Our
analysis comprises more than 1000 experiments that have been run on the testbed
in the years 2010 and 2011. We discuss the scientific value in respect to the
effort of experimentation.
","[{'version': 'v1', 'created': 'Fri, 3 Feb 2017 15:34:12 GMT'}]",2017-02-06,"[['Günes', 'Mesut', '']]","['Testbed', 'Wireless sensor network(WSN)', 'Wireless mesh network (WMN)', 'Experimentation', 'Experiment life cycle', 'Scientific workflow', 'Testbed management system']"
15080,1111.2768,Margherita Napoli,Margherita Napoli and Mimmo Parente,Graded CTL Model Checking for Test Generation,Symposium On Theory of Modeling and Simulation (DEVS/TMS'11),,,,cs.LO cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently there has been a great attention from the scientific community
towards the use of the model-checking technique as a tool for test generation
in the simulation field. This paper aims to provide a useful mean to get more
insights along these lines. By applying recent results in the field of graded
temporal logics, we present a new efficient model-checking algorithm for
Hierarchical Finite State Machines (HSM), a well established symbolism long and
widely used for representing hierarchical models of discrete systems.
Performing model-checking against specifications expressed using graded
temporal logics has the peculiarity of returning more counterexamples within a
unique run. We think that this can greatly improve the efficacy of
automatically getting test cases. In particular we verify two different models
of HSM against branching time temporal properties.
","[{'version': 'v1', 'created': 'Wed, 9 Nov 2011 09:14:16 GMT'}]",2011-11-14,"[['Napoli', 'Margherita', ''], ['Parente', 'Mimmo', '']]","['Model Checking', 'Test Generation', 'GradedTemporal Logics', 'Hierarchical Finite State Machines']"
15081,1604.06577,Fereshteh Asgari Fereshteh ASGARI,"Fereshteh Asgari and Alexis Sultan and Haoyi Xiong and Vincent
  Gauthier and Mounim El-Yacoubi","CT-Mapper: Mapping Sparse Multimodal Cellular Trajectories using a
  Multilayer Transportation Network",Under revision in Computer Communication Journal,,,,cs.SI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile phone data have recently become an attractive source of information
about mobility behavior. Since cell phone data can be captured in a passive way
for a large user population, they can be harnessed to collect well-sampled
mobility information. In this paper, we propose CT-Mapper, an unsupervised
algorithm that enables the mapping of mobile phone traces over a multimodal
transport network. One of the main strengths of CT-Mapper is its capability to
map noisy sparse cellular multimodal trajectories over a multilayer
transportation network where the layers have different physical properties and
not only to map trajectories associated with a single layer. Such a network is
modeled by a large multilayer graph in which the nodes correspond to
metro/train stations or road intersections and edges correspond to connections
between them. The mapping problem is modeled by an unsupervised HMM where the
observations correspond to sparse user mobile trajectories and the hidden
states to the multilayer graph nodes. The HMM is unsupervised as the transition
and emission probabilities are inferred using respectively the physical
transportation properties and the information on the spatial coverage of
antenna base stations. To evaluate CT-Mapper we collected cellular traces with
their corresponding GPS trajectories for a group of volunteer users in Paris
and vicinity (France). We show that CT-Mapper is able to accurately retrieve
the real cell phone user paths despite the sparsity of the observed trace
trajectories. Furthermore our transition probability model is up to 20% more
accurate than other naive models.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2016 08:59:43 GMT'}]",2016-04-25,"[['Asgari', 'Fereshteh', ''], ['Sultan', 'Alexis', ''], ['Xiong', 'Haoyi', ''], ['Gauthier', 'Vincent', ''], ['El-Yacoubi', 'Mounim', '']]","['Mobile phone', 'Mobile networks signaling', 'Multimodal']"
15082,0711.2486,Jean-Francois Boujut,"Onur Hisarciklilar (LGS), Jean-Fran\c{c}ois Boujut (LGS)",An annotation based approach to support design communication,,"Dans Proceedings of ICED'07 - International Conference on
  Engineering Design, Paris : France (2007)",,,cs.HC,,"  The aim of this paper is to propose an approach based on the concept of
annotation for supporting design communication. In this paper, we describe a
co-operative design case study where we analyse some annotation practices,
mainly focused on design minutes recorded during project reviews. We point out
specific requirements concerning annotation needs. Based on these requirements,
we propose an annotation model, inspired from the Speech Act Theory (SAT) to
support communication in a 3D digital environment. We define two types of
annotations in the engineering design context, locutionary and illocutionary
annotations. The annotations we describe in this paper are materialised by a
set of digital artefacts, which have a semantic dimension allowing
express/record elements of technical justifications, traces of contradictory
debates, etc. In this paper, we first clarify the semantic annotation concept,
and we define general properties of annotations in the engineering design
context, and the role of annotations in different design project situations.
After the description of the case study, where we observe and analyse
annotations usage during the design reviews and minute making, the last section
is dedicated to present our approach. We then describe the SAT concept, and
define the concept of annotation acts. We conclude with a description of basic
annotation functionalities that are actually implemented in a software, based
on our approach.
","[{'version': 'v1', 'created': 'Thu, 15 Nov 2007 19:22:16 GMT'}]",2007-11-16,"[['Hisarciklilar', 'Onur', '', 'LGS'], ['Boujut', 'Jean-François', '', 'LGS']]","['Collaborative engineering', 'Semantic annotation', 'Design communication', 'Speech Act Theory']"
15083,1312.3970,Michael Smith,Michael R. Smith and Tony Martinez,"An Extensive Evaluation of Filtering Misclassified Instances in
  Supervised Classification Tasks","29 pages, 3 Figures, 20 Tables",,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Removing or filtering outliers and mislabeled instances prior to training a
learning algorithm has been shown to increase classification accuracy. A
popular approach for handling outliers and mislabeled instances is to remove
any instance that is misclassified by a learning algorithm. However, an
examination of which learning algorithms to use for filtering as well as their
effects on multiple learning algorithms over a large set of data sets has not
been done. Previous work has generally been limited due to the large
computational requirements to run such an experiment, and, thus, the
examination has generally been limited to learning algorithms that are
computationally inexpensive and using a small number of data sets. In this
paper, we examine 9 learning algorithms as filtering algorithms as well as
examining the effects of filtering in the 9 chosen learning algorithms on a set
of 54 data sets. In addition to using each learning algorithm individually as a
filter, we also use the set of learning algorithms as an ensemble filter and
use an adaptive algorithm that selects a subset of the learning algorithms for
filtering for a specific task and learning algorithm. We find that for most
cases, using an ensemble of learning algorithms for filtering produces the
greatest increase in classification accuracy. We also compare filtering with a
majority voting ensemble. The voting ensemble significantly outperforms
filtering unless there are high amounts of noise present in the data set.
Additionally, we find that a majority voting ensemble is robust to noise as
filtering with a voting ensemble does not increase the classification accuracy
of the voting ensemble.
","[{'version': 'v1', 'created': 'Fri, 13 Dec 2013 21:59:00 GMT'}]",2013-12-17,"[['Smith', 'Michael R.', ''], ['Martinez', 'Tony', '']]","['label noise', 'filtering', 'voting ensemble']"
15084,1008.1387,Fr\'ed\'erique Oggier,"Frederique Oggier, Patrick Sole, Jean-Claude Belfiore",Codes over Matrix Rings for Space-Time Coded Modulations,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is known that, for transmission over quasi-static MIMO fading channels
with n transmit antennas, diversity can be obtained by using an inner fully
diverse space-time block code while coding gain, derived from the determinant
criterion, comes from an appropriate outer code. When the inner code has a
cyclic algebra structure over a number field, as for perfect space-time codes,
an outer code can be designed via coset coding. More precisely, we take the
quotient of the algebra by a two-sided ideal which leads to a finite alphabet
for the outer code, with a cyclic algebra structure over a finite field or a
finite ring. We show that the determinant criterion induces various metrics on
the outer code, such as the Hamming and Bachoc distances. When n=2,
partitioning the 2x2 Golden code by using an ideal above the prime 2 leads to
consider codes over either M2(F_2) or M2(F_2[i]), both being non-commutative
alphabets. Matrix rings of higher dimension, suitable for 3x3 and 4x4 perfect
codes, give rise to more complex examples.
","[{'version': 'v1', 'created': 'Sun, 8 Aug 2010 06:04:10 GMT'}]",2010-08-10,"[['Oggier', 'Frederique', ''], ['Sole', 'Patrick', ''], ['Belfiore', 'Jean-Claude', '']]","['Space-time codes', 'codes over rings', 'cyclic algebras', 'number fields', 'finite rings', 'Golden']"
15085,0805.3062,Feng Xia,"Feng Xia, Yu-Chu Tian, Youxian Sun, Jinxiang Dong",Neural Feedback Scheduling of Real-Time Control Tasks,"To appear in International Journal of Innovative Computing,
  Information and Control",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many embedded real-time control systems suffer from resource constraints and
dynamic workload variations. Although optimal feedback scheduling schemes are
in principle capable of maximizing the overall control performance of
multitasking control systems, most of them induce excessively large
computational overheads associated with the mathematical optimization routines
involved and hence are not directly applicable to practical systems. To
optimize the overall control performance while minimizing the overhead of
feedback scheduling, this paper proposes an efficient feedback scheduling
scheme based on feedforward neural networks. Using the optimal solutions
obtained offline by mathematical optimization methods, a back-propagation (BP)
neural network is designed to adapt online the sampling periods of concurrent
control tasks with respect to changes in computing resource availability.
Numerical simulation results show that the proposed scheme can reduce the
computational overhead significantly while delivering almost the same overall
control performance as compared to optimal feedback scheduling.
","[{'version': 'v1', 'created': 'Tue, 20 May 2008 12:31:52 GMT'}]",2008-12-18,"[['Xia', 'Feng', ''], ['Tian', 'Yu-Chu', ''], ['Sun', 'Youxian', ''], ['Dong', 'Jinxiang', '']]","['Feedback scheduling', 'Neural networks', 'Real-time scheduling', 'Computational overhead', 'Embedded control systems']"
15086,1605.02134,Wei-Nan Zhang,"Wei-Nan Zhang, Ting Liu, Qingyu Yin, Yu Zhang",Neural Recovery Machine for Chinese Dropped Pronoun,,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dropped pronouns (DPs) are ubiquitous in pro-drop languages like Chinese,
Japanese etc. Previous work mainly focused on painstakingly exploring the
empirical features for DPs recovery. In this paper, we propose a neural
recovery machine (NRM) to model and recover DPs in Chinese, so that to avoid
the non-trivial feature engineering process. The experimental results show that
the proposed NRM significantly outperforms the state-of-the-art approaches on
both two heterogeneous datasets. Further experiment results of Chinese zero
pronoun (ZP) resolution show that the performance of ZP resolution can also be
improved by recovering the ZPs to DPs.
","[{'version': 'v1', 'created': 'Sat, 7 May 2016 02:41:54 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Dec 2019 01:26:04 GMT'}]",2019-12-03,"[['Zhang', 'Wei-Nan', ''], ['Liu', 'Ting', ''], ['Yin', 'Qingyu', ''], ['Zhang', 'Yu', '']]","['neural network', 'dropped pronoun recovery', 'Chinese zero']"
15087,1610.08369,Israel Fianyi Mr,Israel Fianyi,"Curbing cyber-crime and Enhancing e-commerce security with Digital
  Forensics",,"IJCSI International Journal of Computer Science Issues, Volume 12,
  Issue 6, November 2015 pg 78-85",,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The explosion in the e-commerce industry which has been necessitated by the
growth and advance expansion of Information technology and its related
facilities in recent years have been met with adverse security issues
consequently affecting the industry and the entire online activities. This
paper exams the prevailing security threats e-commerce is facing which is
predominantly known as cyber-crime and how computer related technology and
facilities such as digital forensics tools can be adopted extensively to ensure
security in online related business activities. This paper investigated the
risk, damage and the cost cyber-crime poses to individuals and organizations
when they become victims. As it is obvious transacting business online as well
as all related online activities has become inherent in our everyday life. The
paper also comprehensively elucidate on some of the cyber-crime activities that
are posing serious threat to the security of E-commerce. Amazon and eBay were
used as the case of study in relation to respondents who patronizes these
renowned e-commerce sites for various transactions.
  Keywords: E-commerce Security,Cyber-Crime,digital forensics, Network
forensics, Network security, Online transactions, Identity theft, hacking.
","[{'version': 'v1', 'created': 'Mon, 18 Jan 2016 08:27:57 GMT'}]",2016-10-27,"[['Fianyi', 'Israel', '']]","['E-commerce Security', 'Cyber-Crime', 'Digital Forensics', 'Network forensics', 'Network Security', 'Online Transactions', 'Identity theft', 'hacking']"
15088,0803.2966,Uwe Aickelin,Uwe Aickelin and Larry Bull,"On the Application of Hierarchical Coevolutionary Genetic Algorithms:
  Recombination and Evaluation Partners",,"Journal of Applied System Studies, 4(2), pp 2-17, 2003",,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper examines the use of a hierarchical coevolutionary genetic
algorithm under different partnering strategies. Cascading clusters of
sub-populations are built from the bottom up, with higher-level sub-populations
optimising larger parts of the problem. Hence higher-level sub-populations
potentially search a larger search space with a lower resolution whilst
lower-level sub-populations search a smaller search space with a higher
resolution. The effects of different partner selection schemes amongst the
sub-populations on solution quality are examined for two constrained
optimisation problems. We examine a number of recombination partnering
strategies in the construction of higher-level individuals and a number of
related schemes for evaluating sub-solutions. It is shown that partnering
strategies that exploit problem-specific knowledge are superior and can counter
inappropriate (sub)fitness measurements.
","[{'version': 'v1', 'created': 'Thu, 20 Mar 2008 11:09:39 GMT'}]",2010-07-05,"[['Aickelin', 'Uwe', ''], ['Bull', 'Larry', '']]","['Genetic Algorithms', 'Coevolution', 'Scheduling']"
15089,1609.09758,pmeerkamp,"Eve Ahearn (Enigma Technologies Inc.), Olga Ianiuk (Enigma
  Technologies Inc.)","Harnessing the Potential of the American Community Survey: Delving into
  Methods of Data Delivery",Presented at the Data For Good Exchange 2016,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The American Community Survey (ACS) is the bedrock underpinning any analysis
of the US population, urban areas included. The Census Bureau delivers the ACS
data in multiple formats, yet in each the raw data is difficult to export in
bulk and difficult to sift through. We argue that Enigma's approach to the data
delivery, such as our raw data and metadata presentation, reflects the survey's
logical structure. It can be explored, interlinked, and searched; making it
easier to retrieve the appropriate data applicable to a question at hand. We
make the use of data more liquid via curated tables and API access; even
metadata and notes from technical documentation are programmatically
accessible. Additionally, we are working towards opening our scalable and
reproducible ingestion process of ACS estimations. This paper details all of
the ways the Census Bureau currently makes the data available, the barriers
each of these raise to applying this data in analysis and how our approach
overcomes them. Finally, this paper will address other recent innovations in
making Census datasets more usable, the use cases suited to each and how they
fit into the wider application of data science.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2016 14:43:47 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Oct 2016 16:15:19 GMT'}, {'version': 'v3', 'created': 'Fri, 7 Oct 2016 17:51:17 GMT'}]",2016-10-10,"[['Ahearn', 'Eve', '', 'Enigma Technologies Inc.'], ['Ianiuk', 'Olga', '', 'Enigma\n  Technologies Inc.']]","['ACS', 'data delivery', 'accessibility', 'metadata']"
15090,1002.1154,Vishal Goyal,"Dorsaf Sebai, Abderrazak Jemai, Imed Bennour",Performance Analysis of Software to Hardware Task Migration in Codesign,"International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 1, January 2010,
  http://ijcsi.org/articles/Performance-Analysis-of-Software-to-Hardware-Task-Migration-in-Codesign.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 1, January 2010,
  http://ijcsi.org/articles/Performance-Analysis-of-Software-to-Hardware-Task-Migration-in-Codesign.php",,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The complexity of multimedia applications in terms of intensity of
computation and heterogeneity of treated data led the designers to embark them
on multiprocessor systems on chip. The complexity of these systems on one hand
and the expectations of the consumers on the other hand complicate the
designers job to conceive and supply strong and successful systems in the
shortest deadlines. They have to explore the different solutions of the design
space and estimate their performances in order to deduce the solution that
respects their design constraints. In this context, we propose the modeling of
one of the design space possible solutions: the software to hardware task
migration. This modeling exploits the synchronous dataflow graphs to take into
account the different migration impacts and estimate their performances in
terms of throughput.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 08:51:44 GMT'}]",2010-02-08,"[['Sebai', 'Dorsaf', ''], ['Jemai', 'Abderrazak', ''], ['Bennour', 'Imed', '']]","['Multiprocessor systems on chip', 'Synchronousdataflow', 'Performance estimation', 'Software to hardware taskmigration']"
15091,1605.01636,Bo Xin,"Bo Xin, Yizhou Wang, Wen Gao and David Wipf",Maximal Sparsity with Deep Networks?,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The iterations of many sparse estimation algorithms are comprised of a fixed
linear filter cascaded with a thresholding nonlinearity, which collectively
resemble a typical neural network layer. Consequently, a lengthy sequence of
algorithm iterations can be viewed as a deep network with shared, hand-crafted
layer weights. It is therefore quite natural to examine the degree to which a
learned network model might act as a viable surrogate for traditional sparse
estimation in domains where ample training data is available. While the
possibility of a reduced computational budget is readily apparent when a
ceiling is imposed on the number of layers, our work primarily focuses on
estimation accuracy. In particular, it is well-known that when a signal
dictionary has coherent columns, as quantified by a large RIP constant, then
most tractable iterative algorithms are unable to find maximally sparse
representations. In contrast, we demonstrate both theoretically and empirically
the potential for a trained deep network to recover minimal $\ell_0$-norm
representations in regimes where existing methods fail. The resulting system is
deployed on a practical photometric stereo estimation problem, where the goal
is to remove sparse outliers that can disrupt the estimation of surface normals
from a 3D scene.
","[{'version': 'v1', 'created': 'Thu, 5 May 2016 15:58:55 GMT'}, {'version': 'v2', 'created': 'Tue, 10 May 2016 05:38:46 GMT'}]",2016-05-11,"[['Xin', 'Bo', ''], ['Wang', 'Yizhou', ''], ['Gao', 'Wen', ''], ['Wipf', 'David', '']]","['Sparse estimation', 'compressive sensing', 'deep unfolding', 'deep networks', 'restricted isometry property (RIP)']"
15092,0909.5064,Norbert B\'atfai,Norbert B\'atfai,A Conceivable Origin of Machine Consciousness in the IDLE process,4 pages,,,,cs.OS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this short paper, we would like to call professional community's attention
to a daring idea that is surely unhelpful, but is exciting for programmers and
anyway conflicts with the trend of energy consumption in computer systems.
","[{'version': 'v1', 'created': 'Mon, 28 Sep 2009 10:54:48 GMT'}]",2009-09-29,"[['Bátfai', 'Norbert', '']]","['Machine consciousness', 'IDLE process', 'Minix']"
15093,2007.05157,Audra McMillan,"Daniel Alabi, Audra McMillan, Jayshree Sarathy, Adam Smith and Salil
  Vadhan",Differentially Private Simple Linear Regression,"20 pages, 18 figures",,,,cs.LG cs.CR stat.ME stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Economics and social science research often require analyzing datasets of
sensitive personal information at fine granularity, with models fit to small
subsets of the data. Unfortunately, such fine-grained analysis can easily
reveal sensitive individual information. We study algorithms for simple linear
regression that satisfy differential privacy, a constraint which guarantees
that an algorithm's output reveals little about any individual input data
record, even to an attacker with arbitrary side information about the dataset.
We consider the design of differentially private algorithms for simple linear
regression for small datasets, with tens to hundreds of datapoints, which is a
particularly challenging regime for differential privacy. Focusing on a
particular application to small-area analysis in economics research, we study
the performance of a spectrum of algorithms we adapt to the setting. We
identify key factors that affect their performance, showing through a range of
experiments that algorithms based on robust estimators (in particular, the
Theil-Sen estimator) perform well on the smallest datasets, but that other more
standard algorithms do better as the dataset size increases.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 04:28:43 GMT'}]",2020-07-13,"[['Alabi', 'Daniel', ''], ['McMillan', 'Audra', ''], ['Sarathy', 'Jayshree', ''], ['Smith', 'Adam', ''], ['Vadhan', 'Salil', '']]","['differential privacy', 'linear regression', 'robust statistics', 'small-areaanalysis']"
15094,1403.6386,Marthe Bonamy,"Marthe Bonamy, Nicolas Bousquet",Recoloring graphs via tree decompositions,"20 pages, 8 figures, partial results already presented in
  http://arxiv.org/abs/1302.3486",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $k$ be an integer. Two vertex $k$-colorings of a graph are
\emph{adjacent} if they differ on exactly one vertex. A graph is
\emph{$k$-mixing} if any proper $k$-coloring can be transformed into any other
through a sequence of adjacent proper $k$-colorings. Jerrum proved that any
graph is $k$-mixing if $k$ is at least the maximum degree plus two. We first
improve Jerrum's bound using the grundy number, which is the worst number of
colors in a greedy coloring.
  Any graph is $(tw+2)$-mixing, where $tw$ is the treewidth of the graph
(Cereceda 2006). We prove that the shortest sequence between any two
$(tw+2)$-colorings is at most quadratic (which is optimal up to a constant
factor), a problem left open in Bonamy et al. (2012).
  We also prove that given any two $(\chi(G)+1)$-colorings of a cograph (resp.
distance-hereditary graph) $G$, we can find a linear (resp. quadratic) sequence
between them. In both cases, the bounds cannot be improved by more than a
constant factor for a fixed $\chi(G)$. The graph classes are also optimal in
some sense: one of the smallest interesting superclass of distance-hereditary
graphs corresponds to comparability graphs, for which no such property holds
(even when relaxing the constraint on the length of the sequence). As for
cographs, they are equivalently the graphs with no induced $P_4$, and there
exist $P_5$-free graphs that admit no sequence between two of their
$(\chi(G)+1)$-colorings.
  All the proofs are constructivist and lead to polynomial-time recoloring
algorithm
","[{'version': 'v1', 'created': 'Tue, 25 Mar 2014 15:14:33 GMT'}]",2014-03-26,"[['Bonamy', 'Marthe', ''], ['Bousquet', 'Nicolas', '']]","['Reconfiguration problems', 'vertex coloring', 'treewidth', 'distance-hereditary', 'cograph', 'grundy number']"
15095,1111.3715,Tao  Ye,"Wenqi Huang, Tao Ye, Duanbing Chen","Corner Occupying Theorem for the Two-dimensional Integral Rectangle
  Packing Problem","11 pages, 10 figures. arXiv admin note: substantial text overlap with
  arXiv:1107.4463",,,,cs.DM math.CO math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proves a corner occupying theorem for the two-dimensional integral
rectangle packing problem, stating that if it is possible to orthogonally place
n arbitrarily given integral rectangles into an integral rectangular container
without overlapping, then we can achieve a feasible packing by successively
placing an integral rectangle onto a bottom-left corner in the container. Based
on this theorem, we might develop efficient heuristic algorithms for solving
the integral rectangle packing problem. In fact, as a vague conjecture, this
theorem has been implicitly mentioned with different appearances by many people
for a long time.
","[{'version': 'v1', 'created': 'Wed, 16 Nov 2011 04:13:52 GMT'}]",2011-11-17,"[['Huang', 'Wenqi', ''], ['Ye', 'Tao', ''], ['Chen', 'Duanbing', '']]","['rectangle packing', 'bottom-left', 'corner occupying theorem', 'NPhard']"
15096,1603.07457,Arnab Ganguly,"Arnab Ganguly, Rahul Shah, Sharma V. Thankachan",Parameterized Pattern Matching -- Succinctly,,,,,cs.DS,http://creativecommons.org/publicdomain/zero/1.0/,"  We consider the $Parameterized$ $Pattern$ $Matching$ problem, where a pattern
$P$ matches some location in a text $\mathsf{T}$ iff there is a one-to-one
correspondence between the alphabet symbols of the pattern to those of the
text. More specifically, assume that the text $\mathsf{T}$ contains $n$
characters from a static alphabet $\Sigma_s$ and a parameterized alphabet
$\Sigma_p$, where $\Sigma_s \cap \Sigma_p = \varnothing$ and $|\Sigma_s \cup
\Sigma_p|=\sigma$. A pattern $P$ matches a substring $S$ of $\mathsf{T}$ iff
the static characters match exactly, and there exists a one-to-one function
that renames the parameterized characters in $S$ to that in $P$. Previous
indexing solution [Baker, STOC 1993], known as $Parameterized$ $Suffix$ $Tree$,
requires $\Theta(n\log n)$ bits of space, and can find all $occ$ occurrences of
$P$ in $\mathcal{O}(|P|\log \sigma+ occ)$ time. In this paper, we present the
first succinct index that occupies $n \log \sigma + \mathcal{O}(n)$ bits and
answers queries in $\mathcal{O}((|P|+ occ\cdot \log n) \log\sigma\log \log
\sigma)$ time. We also present a compact index that occupies
$\mathcal{O}(n\log\sigma)$ bits and answers queries in $\mathcal{O}(|P|\log
\sigma+ occ\cdot \log n)$ time. Furthermore, the techniques are extended to
obtain the first succinct representation of the index of Shibuya for
$Structural$ $Matching$ [SWAT, 2000], and of Idury and Sch\""{a}ffer for
$Parameterized$ $Dictionary$ $Matching$ [CPM, 1994].
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2016 07:38:18 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Apr 2016 20:15:57 GMT'}]",2016-04-07,"[['Ganguly', 'Arnab', ''], ['Shah', 'Rahul', ''], ['Thankachan', 'Sharma V.', '']]","['Succinct data structures', 'Suffix trees', 'Burrows-Wheeler Transform']"
15097,0712.1182,Audun Josang,Audun Josang,Cumulative and Averaging Fission of Beliefs,"7 pages, 4 figures, working paper",,,,cs.AI cs.LO,,"  Belief fusion is the principle of combining separate beliefs or bodies of
evidence originating from different sources. Depending on the situation to be
modelled, different belief fusion methods can be applied. Cumulative and
averaging belief fusion is defined for fusing opinions in subjective logic, and
for fusing belief functions in general. The principle of fission is the
opposite of fusion, namely to eliminate the contribution of a specific belief
from an already fused belief, with the purpose of deriving the remaining
belief. This paper describes fission of cumulative belief as well as fission of
averaging belief in subjective logic. These operators can for example be
applied to belief revision in Bayesian belief networks, where the belief
contribution of a given evidence source can be determined as a function of a
given fused belief and its other contributing beliefs.
","[{'version': 'v1', 'created': 'Fri, 7 Dec 2007 16:42:07 GMT'}]",2007-12-10,"[['Josang', 'Audun', '']]","['Fusion', 'fission', 'subjectivelogic', 'belief', 'uncertainty']"
15098,1205.0900,Maulahikmah Galinium,"Maurizio Talamo, Maulahikmah Galinium, Christian H. Schunck, Franco
  Arcieri","Interleaving Commands: a Threat to the Interoperability of Smartcard
  Based Security Applications",8 pages,"International Journal of Computers and Communications, Issue 1,
  Volume 6, 2012, pp.76-83",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although smartcards are widely used, secure smartcard interoperability has
remained a significant challenge. Usually each manufacturer provides a closed
environment for their smartcard based applications including the microchip,
associated firmware and application software. While the security of this
""package"" can be tested and certified for example based on the Common Criteria,
the secure and convenient interoperability with other smartcards and smartcard
applications is not guaranteed. Ideally one would have a middleware that can
support various smartcards and smartcard applications. In our ongoing research
we study this scenario with the goal to develop a way to certify secure
smartcard interoperability in such an environment. Here we discuss and
experimentally demonstrate one critical security problem: if several smartcards
are connected via a middleware it is possible that a smartcard of type S
receives commands that were supposed to be executed on a different smartcard of
type S'. Such ""external commands"" can interleave with the commands that were
supposed to be executed on S. Here we demonstrate this problem experimentally
with a Common Criteria certified digital signature process on two commercially
available smartcards. Importantly, in some of these cases the digital signature
processes terminate without generating an error message or warning to the user.
","[{'version': 'v1', 'created': 'Fri, 4 May 2012 09:58:53 GMT'}]",2012-05-07,"[['Talamo', 'Maurizio', ''], ['Galinium', 'Maulahikmah', ''], ['Schunck', 'Christian H.', ''], ['Arcieri', 'Franco', '']]","['Common criteria', 'digital signature', 'interoperability', 'smartcard']"
15099,1408.0328,Gleb Beliakov,Tim Wilkin and Gleb Beliakov,Weakly monotone averaging functions,,,,,cs.AI math.CA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Monotonicity with respect to all arguments is fundamental to the definition
of aggregation functions. It is also a limiting property that results in many
important non-monotonic averaging functions being excluded from the theoretical
framework. This work proposes a definition for weakly monotonic averaging
functions, studies some properties of this class of functions and proves that
several families of important non-monotonic means are actually weakly monotonic
averaging functions. Specifically we provide sufficient conditions for weak
monotonicity of the Lehmer mean and generalised mixture operators. We establish
weak monotonicity of several robust estimators of location and conditions for
weak monotonicity of a large class of penalty-based aggregation functions.
These results permit a proof of the weak monotonicity of the class of
spatial-tonal filters that include important members such as the bilateral
filter and anisotropic diffusion. Our concept of weak monotonicity provides a
sound theoretical and practical basis by which (monotone) aggregation functions
and non-monotone averaging functions can be related within the same framework,
allowing us to bridge the gap between these previously disparate areas of
research.
","[{'version': 'v1', 'created': 'Sat, 2 Aug 2014 03:03:33 GMT'}]",2014-08-05,"[['Wilkin', 'Tim', ''], ['Beliakov', 'Gleb', '']]","['aggregation functions', 'monotonicity', 'means', 'penalty-based functions', 'non-monotonic functions']"
15100,1802.07858,Sudipta Kar,"Sudipta Kar and Suraj Maharjan and A. Pastor L\'opez-Monroy and Thamar
  Solorio",MPST: A Corpus of Movie Plot Synopses with Tags,Accepted at LREC 2018,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social tagging of movies reveals a wide range of heterogeneous information
about movies, like the genre, plot structure, soundtracks, metadata, visual and
emotional experiences. Such information can be valuable in building automatic
systems to create tags for movies. Automatic tagging systems can help
recommendation engines to improve the retrieval of similar movies as well as
help viewers to know what to expect from a movie in advance. In this paper, we
set out to the task of collecting a corpus of movie plot synopses and tags. We
describe a methodology that enabled us to build a fine-grained set of around 70
tags exposing heterogeneous characteristics of movie plots and the multi-label
associations of these tags with some 14K movie plot synopses. We investigate
how these tags correlate with movies and the flow of emotions throughout
different types of movies. Finally, we use this corpus to explore the
feasibility of inferring tags from plot synopses. We expect the corpus will be
useful in other tasks where analysis of narratives is relevant.
","[{'version': 'v1', 'created': 'Thu, 22 Feb 2018 00:27:54 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Feb 2018 04:04:44 GMT'}]",2018-02-26,"[['Kar', 'Sudipta', ''], ['Maharjan', 'Suraj', ''], ['López-Monroy', 'A. Pastor', ''], ['Solorio', 'Thamar', '']]","['Tag generation for movies', 'Movie plot analysis', 'Multi-label dataset', 'Narrative texts']"
15101,1212.3023,Mahyuddin K. M.  Nasution,"Mahyuddin K. M. Nasution, Shahrul Azman Mohd Noah",Keyword Extraction for Identifying Social Actors,"7 pages, nothing, draft to ICOCSIM 2012",,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identifying the social actor has become one of tasks in Artificial
Intelligence, whereby extracting keyword from Web snippets depend on the use of
web is steadily gaining ground in this research. We develop therefore an
approach based on overlap principle for utilizing a collection of features in
web snippets, where use of keyword will eliminate the un-relevant web pages.
","[{'version': 'v1', 'created': 'Thu, 13 Dec 2012 00:34:23 GMT'}]",2012-12-14,"[['Nasution', 'Mahyuddin K. M.', ''], ['Noah', 'Shahrul Azman Mohd', '']]","['disambiguation', 'similarity', 'tfidf', 'overlap principle', 'semantic']"
15102,1409.3742,Henning Fernau,"Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin and Henning Fernau","Data Reductions and Combinatorial Bounds for Improved Approximation
  Algorithms",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Kernelization algorithms in the context of Parameterized Complexity are often
based on a combination of reduction rules and combinatorial insights. We will
expose in this paper a similar strategy for obtaining polynomial-time
approximation algorithms. Our method features the use of
approximation-preserving reductions, akin to the notion of parameterized
reductions. We exemplify this method to obtain the currently best approximation
algorithms for \textsc{Harmless Set}, \textsc{Differential} and
\textsc{Multiple Nonblocker}, all of them can be considered in the context of
securing networks or information propagation.
","[{'version': 'v1', 'created': 'Fri, 12 Sep 2014 14:14:04 GMT'}]",2014-09-15,"[['Abu-Khzam', 'Faisal N.', ''], ['Bazgan', 'Cristina', ''], ['Chopin', 'Morgan', ''], ['Fernau', 'Henning', '']]","['Reduction rules', 'maximization problems', 'polynomial-time approximation', 'domination problems']"
15103,1401.7034,Marcos Portnoi,Marcos Portnoi and Joberto S. B. Martins,"TARVOS - an Event-Based Simulator for Performance Analysis, Supporting
  MPLS, RSVP-TE, and Fast Recovery","XIII Brazilian Symposium on Multimedia and the Web - Webmedia 2007,
  Oct. 20-24, 2007, Gramado, RS, Brazil, vol. 1, p. 222-229","XIII Brazilian Symposium on Multimedia and the Web - Webmedia
  2007, Oct. 20-24, 2007, Gramado, RS, Brazil, vol. 1, p. 222-229",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new discrete event-based network simulator named TARVOS
- Computer Networks Simulator, being designed as part of the first Author's
Masters research and will provide support to simulating MPLS architecture,
several RSVP-TE protocol functionalities and fast recovery in case of link
failure. The tool is used in a case study, where the impact of a link failure
on a VoIP application, within an MPLS domain network, is analyzed. The paper
displays a preliminary research of six already available simulators and reasons
why they were not adopted as tools for the Masters research. Then, it follows
to describe the basics of TARVOS implementation and exhibits the case study
simulated by this new tool.
","[{'version': 'v1', 'created': 'Mon, 27 Jan 2014 21:51:21 GMT'}]",2014-01-29,"[['Portnoi', 'Marcos', ''], ['Martins', 'Joberto S. B.', '']]","['Simulator', 'MPLS', 'RSVP-TE', 'fast recovery', 'fault recovery', 'performance analysis']"
15104,1610.07184,Soumitra Pal,"Soumitra Pal, Tingyang Xu, Tianbao Yang, Sanguthevar Rajasekaran,
  Jinbo Bi","Hybrid-DCA: A Double Asynchronous Approach for Stochastic Dual
  Coordinate Ascent",,,,,cs.DC math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In prior works, stochastic dual coordinate ascent (SDCA) has been
parallelized in a multi-core environment where the cores communicate through
shared memory, or in a multi-processor distributed memory environment where the
processors communicate through message passing. In this paper, we propose a
hybrid SDCA framework for multi-core clusters, the most common high performance
computing environment that consists of multiple nodes each having multiple
cores and its own shared memory. We distribute data across nodes where each
node solves a local problem in an asynchronous parallel fashion on its cores,
and then the local updates are aggregated via an asynchronous across-node
update scheme. The proposed double asynchronous method converges to a global
solution for $L$-Lipschitz continuous loss functions, and at a linear
convergence rate if a smooth convex loss function is used. Extensive empirical
comparison has shown that our algorithm scales better than the best known
shared-memory methods and runs faster than previous distributed-memory methods.
Big datasets, such as one of 280 GB from the LIBSVM repository, cannot be
accommodated on a single node and hence cannot be solved by a parallel
algorithm. For such a dataset, our hybrid algorithm takes 30 seconds to achieve
a duality gap of $10^{-6}$ on 16 nodes each using 8 cores, which is
significantly faster than the best known distributed algorithms, such as
CoCoA+, that take more than 300 seconds on 16 nodes.
","[{'version': 'v1', 'created': 'Sun, 23 Oct 2016 15:17:43 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Nov 2016 17:50:50 GMT'}]",2016-11-03,"[['Pal', 'Soumitra', ''], ['Xu', 'Tingyang', ''], ['Yang', 'Tianbao', ''], ['Rajasekaran', 'Sanguthevar', ''], ['Bi', 'Jinbo', '']]","['dual coordinate descent', 'distributed computing', 'optimization']"
15105,1802.09680,Nishant Mehta,"Rafael Frongillo, Nishant A. Mehta, Tom Morgan, Bo Waggoner",Multi-Observation Regression,28 pages,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent work introduced loss functions which measure the error of a prediction
based on multiple simultaneous observations or outcomes. In this paper, we
explore the theoretical and practical questions that arise when using such
multi-observation losses for regression on data sets of $(x,y)$ pairs. When a
loss depends on only one observation, the average empirical loss decomposes by
applying the loss to each pair, but for the multi-observation case, empirical
loss is not even well-defined, and the possibility of statistical guarantees is
unclear without several $(x,y)$ pairs with exactly the same $x$ value. We
propose four algorithms formalizing the concept of empirical risk minimization
for this problem, two of which have statistical guarantees in settings allowing
both slow and fast convergence rates, but which are out-performed empirically
by the other two. Empirical results demonstrate practicality of these
algorithms in low-dimensional settings, while lower bounds demonstrate
intrinsic difficulty in higher dimensions. Finally, we demonstrate the
potential benefit of the algorithms over natural baselines that use traditional
single-observation losses via both lower bounds and simulations.
","[{'version': 'v1', 'created': 'Tue, 27 Feb 2018 01:49:09 GMT'}]",2018-02-28,"[['Frongillo', 'Rafael', ''], ['Mehta', 'Nishant A.', ''], ['Morgan', 'Tom', ''], ['Waggoner', 'Bo', '']]","['Information elicitation', 'empirical risk minimization', 'regression', 'high-order statistics']"
15106,1512.02047,Anton Eremeev,"Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre","Level-Based Analysis of Genetic Algorithms for Combinatorial
  Optimization",8 pages,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper is devoted to upper bounds on run-time of Non-Elitist Genetic
Algorithms until some target subset of solutions is visited for the first time.
In particular, we consider the sets of optimal solutions and the sets of local
optima as the target subsets. Previously known upper bounds are improved by
means of drift analysis. Finally, we propose conditions ensuring that a
Non-Elitist Genetic Algorithm efficiently finds approximate solutions with
constant approximation ratio on the class of combinatorial optimization
problems with guaranteed local optima (GLO).
","[{'version': 'v1', 'created': 'Mon, 7 Dec 2015 14:03:43 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Dec 2015 03:22:10 GMT'}]",2015-12-10,"[['Dang', 'Duc-Cuong', ''], ['Eremeev', 'Anton V.', ''], ['Lehre', 'Per Kristian', '']]","['Runtime Analysis', 'Fitness Level', 'Genetic Algorithm', 'Local Search', 'Guaranteed Local Optima']"
15107,1108.4770,Ivan Zuzak,"Ivan Zuzak (1), Marko Ivankovic (2), Ivan Budiselic (1) ((1) School of
  Electrical Engineering and Computing, University of Zagreb, Croatia, (2)
  Google Inc., Zurich, Switzerland)",A Classification Framework for Web Browser Cross-Context Communication,"23 pages, 5 figures. This paper contains a more systematic research
  of cross-context communication systems listed on the pmrpc project website,
  see http://code.google.com/p/pmrpc/wiki/IWCProjects",,,,cs.SE,http://creativecommons.org/licenses/by/3.0/,"  Demand for more advanced Web applications is the driving force behind Web
browser evolution. Recent requirements for Rich Internet Applications, such as
mashing-up data and background processing, are emphasizing the need for
building and executing Web applications as a coordination of browser execution
contexts. Since development of such Web applications depends on cross-context
communication, many browser primitives and client-side frameworks have been
developed to support this communication. In this paper we present a
systematization of cross-context communication systems for Web browsers. Based
on an analysis of previous research, requirements for modern Web applications
and existing systems, we extract a framework for classifying cross-context
communica-tion systems. Using the framework, we evaluate the current ecosystem
of cross-context communication and outline directions for future Web research
and engineering.
","[{'version': 'v1', 'created': 'Wed, 24 Aug 2011 07:35:21 GMT'}]",2011-08-25,"[['Zuzak', 'Ivan', ''], ['Ivankovic', 'Marko', ''], ['Budiselic', 'Ivan', '']]","['Web browsers', 'Web applications', 'browser execution contexts', 'cross-contextcommunication', 'mashups', 'systematization', 'classification', 'evaluation']"
15108,1712.04429,Bernardo Furtado,Bernardo Alves Furtado,Machine Learning simulates Agent-Based Model,6 pages,,,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Running agent-based models (ABMs) is a burdensome computational task,
specially so when considering the flexibility ABMs intrinsically provide. This
paper uses a bundle of model configuration parameters along with obtained
results from a validated ABM to train some Machine Learning methods for
socioeconomic optimal cases. A larger space of possible parameters and
combinations of parameters are then used as input to predict optimal cases and
confirm parameters calibration. Analysis of the parameters of the optimal cases
are then compared to the baseline model. This exploratory initial exercise
confirms the adequacy of most of the parameters and rules and suggests changing
of directions to two parameters. Additionally, it helps highlight metropolitan
regions of higher quality of life. Better understanding of ABM mechanisms and
parameters' influence may nudge policy-making slightly closer to optimal level.
","[{'version': 'v1', 'created': 'Tue, 12 Dec 2017 18:39:57 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Jan 2020 13:08:49 GMT'}]",2020-01-14,"[['Furtado', 'Bernardo Alves', '']]","['machine learning', 'agent-based modeling', 'public policies', 'calibration']"
15109,1402.5619,V Karthikeyan VKK,V. Karthikeyan,A Novel Histogram Based Robust Image Registration Technique,5 pages and 6 figures. submit/0850305,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a method for Automatic Image Registration (AIR) through
histogram is proposed. Automatic image registration is one of the crucial steps
in the analysis of remotely sensed data. A new acquired image must be
transformed, using image registration techniques, to match the orientation and
scale of previous related images. This new approach combines several
segmentations of the pair of images to be registered. A relaxation parameter on
the histogram modes delineation is introduced. It is followed by
characterization of the extracted objects through the objects area, axis ratio,
and perimeter and fractal dimension. The matched objects are used for rotation
and translation estimation. It allows for the registration of pairs of images
with differences in rotation and translation. This method contributes to
subpixel accuracy.
","[{'version': 'v1', 'created': 'Sun, 23 Feb 2014 15:24:27 GMT'}]",2014-02-25,"[['Karthikeyan', 'V.', '']]","['Automatic Image Registration (AIR)', 'Registration Techniques', 'Rotation', 'Translation                       Estimation']"
15110,1505.02372,Dmitry Zakablukov,Dmitry V. Zakablukov,"On Asymptotic Gate Complexity and Depth of Reversible Circuits With
  Additional Memory","In English, 27 pages, 12 figures. Submission to the Computational
  Complexity journal. arXiv admin note: text overlap with arXiv:1504.06876",,,,cs.CC cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The reversible logic can be used in various research areas, e.g. quantum
computation, cryptography and signal processing. In the paper we study
reversible logic circuits with additional inputs, which consist of NOT, CNOT
and C\textsuperscript{2}NOT gates. We consider a set $F(n,q)$ of all
transformations $\mathbb B^n \to \mathbb B^n$ that can be realized by
reversible circuits with $(n+q)$ inputs. An analogue of Lupanov's method for
the synthesis of reversible logic circuits with additional inputs is described.
We prove upper asymptotic bounds for the Shannon gate complexity function
$L(n,q)$ and the depth function $D(n,q)$ in case of $q > 0$: $L(n,q_0) \lesssim
2^n$ if $q_0 \sim n 2^{n-o(n)}$ and $D(n,q_1) \lesssim 3n$ if $q_1 \sim 2^n$.
","[{'version': 'v1', 'created': 'Sun, 10 May 2015 11:58:36 GMT'}, {'version': 'v2', 'created': 'Sat, 30 May 2015 18:30:18 GMT'}, {'version': 'v3', 'created': 'Sat, 19 Mar 2016 17:13:25 GMT'}]",2016-03-22,"[['Zakablukov', 'Dmitry V.', '']]","['Reversible logic', 'gate complexity', 'circuit depth', 'asymptotic bounds']"
15111,1610.01019,Victor Dalmau,"Victor Dalmau, Andrei Krokhin, Rajsekar Manokaran","Towards a Characterization of Constant-Factor Approximable Finite-Valued
  CSPs",24 pages,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we study the approximability of (Finite-)Valued Constraint
Satisfaction Problems (VCSPs) with a fixed finite constraint language {\Gamma}
consisting of finitary functions on a fixed finite domain. An instance of VCSP
is given by a finite set of variables and a sum of functions belonging to
{\Gamma} and depending on a subset of the variables. Each function takes values
in [0, 1] specifying costs of assignments of labels to its variables, and the
goal is to find an assignment of labels to the variables that minimizes the
sum. A recent result of Ene et al. says that, under the mild technical
condition that {\Gamma} contains the equality relation, the basic LP relaxation
is optimal for constant-factor approximation for VCSP({\Gamma}) unless the
Unique Games Conjecture fails. Using the algebraic approach to the CSP, we give
new natural algebraic conditions for the finiteness of the integrality gap for
the basic LP relaxation of VCSP({\Gamma}). We also show how these algebraic
conditions can in principle be used to round solutions of the basic LP
relaxation, and how, for several examples that cover all previously known
cases, this leads to efficient constant-factor approximation algorithms.
Finally, we show that the absence of another algebraic condition leads to
NP-hardness of constant-factor approximation.
","[{'version': 'v1', 'created': 'Tue, 4 Oct 2016 14:31:40 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Mar 2018 13:35:16 GMT'}]",2018-03-22,"[['Dalmau', 'Victor', ''], ['Krokhin', 'Andrei', ''], ['Manokaran', 'Rajsekar', '']]","['constraint satisfaction problem', 'approximation algorithms', 'universalalgebra']"
15112,1501.00354,Sang-Pil Kim,"Sang-Pil Kim, Myeong-Sun Gil, Yang-Sae Moon, and Hee-Sun Won","Efficient 2-Step Protocol and Its Discriminative Feature Selections in
  Secure Similar Document Detection","25 pages, 12 figures, 1 table",,,,cs.CR cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Secure similar document detection (SSDD) identifies similar documents of two
parties while each party does not disclose its own sensitive documents to
another party. In this paper, we propose an efficient 2-step protocol that
exploits a feature selection as the lower-dimensional transformation and
presents discriminative feature selections to maximize the performance of the
protocol. For this, we first analyze that the existing 1-step protocol causes
serious computation and communication overhead for high dimensional document
vectors. To alleviate the overhead, we next present the feature selection-based
2-step protocol and formally prove its correctness. The proposed 2-step
protocol works as follows: (1) in the filtering step, it uses low dimensional
vectors obtained by the feature selection to filter out non-similar documents;
(2) in the post-processing step, it identifies similar documents only from the
non-filtered documents by using the 1-step protocol. As the feature selection,
we first consider the simplest one, random projection (RP), and propose its
2-step solution SSDD-RP. We then present two discriminative feature selections
and their solutions: SSDD-LF (local frequency) which selects a few dimensions
locally frequent in the current querying vector and SSDD-GF (global frequency)
which selects ones globally frequent in the set of all document vectors. We
finally propose a hybrid one, SSDD-HF (hybrid frequency), that takes advantage
of both SSDD-LF and SSDD-GF. We empirically show that the proposed 2-step
protocol outperforms the 1-step protocol by three or four orders of magnitude.
","[{'version': 'v1', 'created': 'Fri, 2 Jan 2015 07:32:06 GMT'}]",2015-01-05,"[['Kim', 'Sang-Pil', ''], ['Gil', 'Myeong-Sun', ''], ['Moon', 'Yang-Sae', ''], ['Won', 'Hee-Sun', '']]","['secure similar document detection', 'cosine similarity', 'feature selection', 'lower-dimensional']"
15113,1008.0273,Jean Dezert,"Jean Dezert (ONERA), Florentin Smarandache (E3I2)","Threat assessment of a possible Vehicle-Born Improvised Explosive Device
  using DSmT",26 pages,"Fusion 2010, Edinburgh : United Kingdom (2010)",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the solution about the threat of a VBIED (Vehicle-Born
Improvised Explosive Device) obtained with the DSmT (Dezert-Smarandache
Theory). This problem has been proposed recently to the authors by Simon
Maskell and John Lavery as a typical illustrative example to try to compare the
different approaches for dealing with uncertainty for decision-making support.
The purpose of this paper is to show in details how a solid justified solution
can be obtained from DSmT approach and its fusion rules thanks to a proper
modeling of the belief functions involved in this problem.
","[{'version': 'v1', 'created': 'Mon, 2 Aug 2010 10:18:24 GMT'}]",2010-08-03,"[['Dezert', 'Jean', '', 'ONERA'], ['Smarandache', 'Florentin', '', 'E3I2']]","['Security', 'Decison-making support', 'Information fusion', 'DSmT', 'Threat assessment']"
15114,1111.0387,Jaydip Sen,"Jaydip Sen, Sripad Koilakonda, Arijit Ukil","A Mechanism for Detection of Cooperative Black Hole Attack in Mobile Ad
  Hoc Networks","6 pages, 10 figures, 2 tables. In Proceedings of the 2nd
  International Conference on Intelligent Systems, Modeling and Simulation
  (ISMS'11), pp. 338-343, Phnom Penh, Cambodia, January 25-27, 2011",,,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A mobile ad hoc network (MANET) is a collection of autonomous nodes that
communicate with each other by forming a multi-hop radio network and
maintaining connections in a decentralized manner. Security remains a major
challenge for these networks due to their features of open medium, dynamically
changing topologies, reliance on cooperative algorithms,absence of centralized
monitoring points, and lack of clear lines of defense. Most of the routing
protocols for MANETs are thus vulnerable to various types of attacks. Ad hoc
on-demand distance vector routing (AODV) is a very popular routing algorithm.
However, it is vulnerable to the well-known black hole attack, where a
malicious node falsely advertises good paths to a destination node during the
route discovery process. This attack becomes more sever when a group of
malicious nodes cooperate each other. In this paper, a defense mechanism is
presented against a coordinated attack by multiple black hole nodes in a MANET.
The simulation carried out on the proposed scheme has produced results that
demonstrate the effectiveness of the mechanism in detection of the attack while
maintaining a reasonable level of throughput in the network.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2011 05:02:55 GMT'}]",2011-11-03,"[['Sen', 'Jaydip', ''], ['Koilakonda', 'Sripad', ''], ['Ukil', 'Arijit', '']]","['Mobile ad hoc network (MANET)', 'Blackhole', 'Packet dropping', 'Malicious node', 'Routing']"
15115,1603.05069,Yuchen Zhou,"Yuchen Zhou, John Baras and Shige Wang","Hardware Software Co-design for Automotive CPS using Architecture
  Analysis and Design Language",AVICPS 2014,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern cyber-physical systems (CPS) have a close inter-dependence between
software and physical components. Automotive embedded systems are typical CPS,
as physical chips, sensors and actuators are physical components and software
embedded within are the cyber components. The current stage of embedded systems
is highly complex in architecture design for both software and hardware. It is
common in industrial practice that high level control algorithm development and
low level code implementation on hardware platforms are developed separately
with limited shared information. However, software code and hardware
architecture become closely related with the increasing complexity. Correlated
requirements and dependencies between hardware and software are emerging
problems of industrial practice. We demonstrate in this paper a method to link
model based system design with real-time simulations and analysis of the
architecture model. This allows hardware software co-design and thus early
selection of hardware architecture.
","[{'version': 'v1', 'created': 'Wed, 16 Mar 2016 12:50:51 GMT'}]",2016-03-17,"[['Zhou', 'Yuchen', ''], ['Baras', 'John', ''], ['Wang', 'Shige', '']]","['hardware software co-design', 'architecture', 'modelbased', 'real-time simulation']"
15116,0712.3084,Manik Lal Das,"Manik Lal Das, Ashutosh Saxena, Deepak B Phatak",Proxy Signature Scheme with Effective Revocation Using Bilinear Pairings,,"International Journal of Network Security, Vol. 4, No.3,
  pp.312-317, 2007",,,cs.CR,,"  We present a proxy signature scheme using bilinear pairings that provides
effective proxy revocation. The scheme uses a binding-blinding technique to
avoid secure channel requirements in the key issuance stage. With this
technique, the signer receives a partial private key from a trusted authority
and unblinds it to get his private key, in turn, overcomes the key escrow
problem which is a constraint in most of the pairing-based proxy signature
schemes. The scheme fulfills the necessary security requirements of proxy
signature and resists other possible threats.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2007 01:06:12 GMT'}]",2007-12-20,"[['Das', 'Manik Lal', ''], ['Saxena', 'Ashutosh', ''], ['Phatak', 'Deepak B', '']]","['proxy signature', 'proxy revocation', 'bilinear pairings', 'key escrow']"
15117,1701.07857,Rocio Gonzalez-Diaz,"Nieves Atienza, Rocio Gonzalez-Diaz, Matteo Rucco","Persistent Entropy for Separating Topological Features from Noise in
  Vietoris-Rips Complexes",arXiv admin note: text overlap with arXiv:1605.02885,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Persistent homology studies the evolution of k-dimensional holes along a
nested sequence of simplicial complexes (called a filtration). The set of bars
(i.e. intervals) representing birth and death times of k-dimensional holes
along such sequence is called the persistence barcode. k-Dimensional holes with
short lifetimes are informally considered to be ""topological noise"", and those
with long lifetimes are considered to be ""topological features"" associated to
the filtration. Persistent entropy is defined as the Shannon entropy of the
persistence barcode of a given filtration. In this paper we present new
important properties of persistent entropy of Cech and Vietoris-Rips
filtrations. Among the properties, we put a focus on the stability theorem that
allows to use persistent entropy for comparing persistence barcodes. Later, we
derive a simple method for separating topological noise from features in
Vietoris-Rips filtrations.
","[{'version': 'v1', 'created': 'Wed, 18 Jan 2017 12:27:20 GMT'}]",2017-01-30,"[['Atienza', 'Nieves', ''], ['Gonzalez-Diaz', 'Rocio', ''], ['Rucco', 'Matteo', '']]","['Persistent homology', 'persistence barcodes', 'Shannon entropy', 'ˇCech and Vietoris-Rips complexes', 'topological noise', 'topologicalfeature']"
15118,1402.5358,J\'anos P\'anovics,Tam\'as K\'adek and J\'anos P\'anovics,Extended Breadth-First Search Algorithm,"5 pages, 1 figure, 1 table","International Journal of Computer Science Issues, Volume 10, Issue
  6, No 2, ISSN (Print): 1694-0814, ISSN (Online): 1694-0784, November 2013,
  pp. 78-82",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The task of artificial intelligence is to provide representation techniques
for describing problems, as well as search algorithms that can be used to
answer our questions. A widespread and elaborated model is state-space
representation, which, however, has some shortcomings. Classical search
algorithms are not applicable in practice when the state space contains even
only a few tens of thousands of states. We can give remedy to this problem by
defining some kind of heuristic knowledge. In case of classical state-space
representation, heuristic must be defined so that it qualifies an arbitrary
state based on its ""goodness,"" which is obviously not trivial. In our paper, we
introduce an algorithm that gives us the ability to handle huge state spaces
and to use a heuristic concept which is easier to embed into search algorithms.
","[{'version': 'v1', 'created': 'Fri, 21 Feb 2014 17:21:52 GMT'}]",2014-02-24,"[['Kádek', 'Tamás', ''], ['Pánovics', 'János', '']]","['Artificial Intelligence', 'State-Space Representation', 'Extended Model', 'Breadth-First Search']"
15119,1004.1821,Jared Tanner,"Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner, and Andrew
  Thompson",Phase Transitions for Greedy Sparse Approximation Algorithms,"31 pages, 3 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A major enterprise in compressed sensing and sparse approximation is the
design and analysis of computationally tractable algorithms for recovering
sparse, exact or approximate, solutions of underdetermined linear systems of
equations. Many such algorithms have now been proven to have optimal-order
uniform recovery guarantees using the ubiquitous Restricted Isometry Property
(RIP). However, it is unclear when the RIP-based sufficient conditions on the
algorithm are satisfied. We present a framework in which this task can be
achieved; translating these conditions for Gaussian measurement matrices into
requirements on the signal's sparsity level, length, and number of
measurements. We illustrate this approach on three of the state-of-the-art
greedy algorithms: CoSaMP, Subspace Pursuit (SP), and Iterative Hard
Thresholding (IHT). Designed to allow a direct comparison of existing theory,
our framework implies that, according to the best known bounds, IHT requires
the fewest number of compressed sensing measurements and has the lowest per
iteration computational cost of the three algorithms compared here.
","[{'version': 'v1', 'created': 'Sun, 11 Apr 2010 16:44:35 GMT'}]",2010-04-13,"[['Blanchard', 'Jeffrey D.', ''], ['Cartis', 'Coralia', ''], ['Tanner', 'Jared', ''], ['Thompson', 'Andrew', '']]","['Compressed sensing', 'greedy algorithms', 'sparse solutions to underdetermined systems', 'restricted isometry property', 'phase transitions', 'Gaussian matrices']"
15120,1705.09054,Zhipeng Xie,Zhipeng Xie and Junfeng Hu,"Max-Cosine Matching Based Neural Models for Recognizing Textual
  Entailment",,DASFAA (1) 2017: 295-308,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recognizing textual entailment is a fundamental task in a variety of text
mining or natural language processing applications. This paper proposes a
simple neural model for RTE problem. It first matches each word in the
hypothesis with its most-similar word in the premise, producing an augmented
representation of the hypothesis conditioned on the premise as a sequence of
word pairs. The LSTM model is then used to model this augmented sequence, and
the final output from the LSTM is fed into a softmax layer to make the
prediction. Besides the base model, in order to enhance its performance, we
also proposed three techniques: the integration of multiple word-embedding
library, bi-way integration, and ensemble based on model averaging.
Experimental results on the SNLI dataset have shown that the three techniques
are effective in boosting the predicative accuracy and that our method
outperforms several state-of-the-state ones.
","[{'version': 'v1', 'created': 'Thu, 25 May 2017 05:45:42 GMT'}]",2017-05-26,"[['Xie', 'Zhipeng', ''], ['Hu', 'Junfeng', '']]","['Textual Entailment', 'Recurrent Neural Networks', 'LSTM']"
15121,1609.06577,Fabio Del Vigna,"Fabio Del Vigna, Marinella Petrocchi, Alessandro Tommasi, Cesare
  Zavattari, Maurizio Tesconi","Semi-supervised knowledge extraction for detection of drugs and their
  effects",14 pages excluding references,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  New Psychoactive Substances (NPS) are drugs that lay in a grey area of
legislation, since they are not internationally and officially banned, possibly
leading to their not prosecutable trade. The exacerbation of the phenomenon is
that NPS can be easily sold and bought online. Here, we consider large corpora
of textual posts, published on online forums specialized on drug discussions,
plus a small set of known substances and associated effects, which we call
seeds. We propose a semi-supervised approach to knowledge extraction, applied
to the detection of drugs (comprising NPS) and effects from the corpora under
investigation. Based on the very small set of initial seeds, the work
highlights how a contrastive approach and context deduction are effective in
detecting substances and effects from the corpora. Our promising results, which
feature a F1 score close to 0.9, pave the way for shortening the detection time
of new psychoactive substances, once these are discussed and advertised on the
Internet.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2016 14:24:44 GMT'}]",2016-09-22,"[['Del Vigna', 'Fabio', ''], ['Petrocchi', 'Marinella', ''], ['Tommasi', 'Alessandro', ''], ['Zavattari', 'Cesare', ''], ['Tesconi', 'Maurizio', '']]","['Text mining', 'NPS detection', 'NPS data mining', 'drugs forums', 'social media analysis', 'machine learning', 'automatic classification']"
15122,1305.7128,Uwe Aickelin,"Gianni Tedesco, Uwe Aickelin",Adaptive Alert Throttling for Intrusion Detection Systems,"University of Nottingham Computer Science Technical Report 2003.
  arXiv admin note: substantial text overlap with arXiv:0801.4119,
  arXiv:0804.1281",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Each time that an intrusion detection system raises an alert it must make
some attempt to communicate the information to an operator. This communication
channel can easily become the target of a denial of service attack because,
like all communication channels, it has a fixed capacity. If this channel can
become overwhelmed with bogus data, an attacker can quickly achieve complete
neutralisation of intrusion detection capability. Although these types of
attack are very hard to stop completely, our aim is to present techniques that
improve alert throughput and capacity to such an extent that the resources
required to successfully mount the attack become prohibitive.
","[{'version': 'v1', 'created': 'Thu, 30 May 2013 14:53:24 GMT'}]",2013-05-31,"[['Tedesco', 'Gianni', ''], ['Aickelin', 'Uwe', '']]","['Intrusion Detection System', 'Denial of Service Attacks', 'Token Bucket Filter']"
15123,0905.2449,Serguei Mokhov,Serguei A. Mokhov,"The Role of Self-Forensics in Vehicle Crash Investigations and Event
  Reconstruction",10 pages; preliminary version for CMRSC,,,,cs.CY cs.AI cs.CR cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper further introduces and formalizes a novel concept of
self-forensics for automotive vehicles, specified in the Forensic Lucid
language. We argue that self-forensics, with the forensics taken out of the
cybercrime domain, is applicable to ""self-dissection"" of intelligent vehicles
and hardware systems for automated incident and anomaly analysis and event
reconstruction by the software with or without the aid of the engineering teams
in a variety of forensic scenarios. We propose a formal design, requirements,
and specification of the self-forensic enabled units (similar to blackboxes) in
vehicles that will help investigation of incidents and also automated reasoning
and verification of theories along with the events reconstruction in a formal
model. We argue such an analysis is beneficial to improve the safety of the
passengers and their vehicles, like the airline industry does for planes.
","[{'version': 'v1', 'created': 'Fri, 15 May 2009 00:08:02 GMT'}]",2009-05-18,"[['Mokhov', 'Serguei A.', '']]","['self-forensics', 'specification', 'Forensic Lucid', 'event reconstruction', 'forensic computing', 'autonomic computing']"
15124,1505.07751,John Sudano Ph D,John J. Sudano,"Pignistic Probability Transforms for Mixes of Low- and High-Probability
  Events","7 pages, International Society of Information Fusion Conference
  Proceedings Fusion 2001 at Montreal, Quebec, Canada","Fourth International Conference on Information Fusion, August
  2001, Montreal. Pages TPUB3 23-27",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In some real world information fusion situations, time critical decisions
must be made with an incomplete information set. Belief function theories
(e.g., Dempster-Shafer theory of evidence, Transferable Belief Model) have been
shown to provide a reasonable methodology for processing or fusing the
quantitative clues or information measurements that form the incomplete
information set. For decision making, the pignistic (from the Latin pignus, a
bet) probability transform has been shown to be a good method of using Beliefs
or basic belief assignments (BBAs) to make decisions. For many systems, one
need only address the most-probable elements in the set. For some critical
systems, one must evaluate the risk of wrong decisions and establish safe
probability thresholds for decision making. This adds a greater complexity to
decision making, since one must address all elements in the set that are above
the risk decision threshold. The problem is greatly simplified if most of the
probabilities fall below this threshold. Finding a probability transform that
properly represents mixes of low- and high-probability events is essential.
This article introduces four new pignistic probability transforms with an
implementation that uses the latest values of Beliefs, Plausibilities, or BBAs
to improve the pignistic probability estimates. Some of them assign smaller
values of probabilities for smaller values of Beliefs or BBAs than the Smets
pignistic transform. They also assign higher probability values for larger
values of Beliefs or BBAs than the Smets pignistic transform. These probability
transforms will assign a value of probability that converges faster to the
values below the risk threshold. A probability information content (PIC)
variable is also introduced that assigns an information content value to any
set of probability. Four operators are defined to help simplify the
derivations.
","[{'version': 'v1', 'created': 'Wed, 27 May 2015 12:05:27 GMT'}]",2015-06-01,"[['Sudano', 'John J.', '']]","['Pignistic Probability', 'Probability Information Content', 'Beliefs', 'Plausibility', 'Credal Level']"
15125,1304.7256,Shaunak Bopardikar,"Shaunak D. Bopardikar, Brendan J. Englot and Alberto Speranzon",Robust Belief Roadmap: Planning Under Intermittent Sensing,"10 pages, 6 figures",,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we extend the recent body of work on planning under
uncertainty to include the fact that sensors may not provide any measurement
owing to misdetection. This is caused either by adverse environmental
conditions that prevent the sensors from making measurements or by the
fundamental limitations of the sensors. Examples include RF-based ranging
devices that intermittently do not receive the signal from beacons because of
obstacles; the misdetection of features by a camera system in detrimental
lighting conditions; a LIDAR sensor that is pointed at a glass-based material
such as a window, etc.
  The main contribution of this paper is twofold. We first show that it is
possible to obtain an analytical bound on the performance of a state estimator
under sensor misdetection occurring stochastically over time in the
environment. We then show how this bound can be used in a sample-based path
planning algorithm to produce a path that trades off accuracy and robustness.
Computational results demonstrate the benefit of the approach and comparisons
are made with the state of the art in path planning under state uncertainty.
","[{'version': 'v1', 'created': 'Fri, 26 Apr 2013 19:10:20 GMT'}, {'version': 'v2', 'created': 'Sun, 15 Sep 2013 04:45:47 GMT'}]",2013-09-17,"[['Bopardikar', 'Shaunak D.', ''], ['Englot', 'Brendan J.', ''], ['Speranzon', 'Alberto', '']]","['Path planning', 'Belief space planning', 'Autonomoussystems', 'Localization']"
15126,1209.5319,Nourah Al-Angari,"Nourah Al-Angari, Abdullatif ALAbdullatif",Multiprocessor Scheduling Using Parallel Genetic Algorithm,"5 pages, 5 figures, published in (IJCSI, Volume 9, Issue 4, July
  2012)",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tasks scheduling is the most challenging problem in the parallel computing.
Hence, the inappropriate scheduling will reduce or even abort the utilization
of the true potential of the parallelization. Genetic algorithm (GA) has been
successfully applied to solve the scheduling problem. The fitness evaluation is
the most time consuming GA operation for the CPU time, which affect the GA
performance. The proposed synchronous master-slave algorithm outperforms the
sequential algorithm in case of complex and high number of generations problem.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2012 16:12:20 GMT'}]",2012-09-25,"[['Al-Angari', 'Nourah', ''], ['ALAbdullatif', 'Abdullatif', '']]","['genetic algorithm', 'parallel processing', 'scheduling']"
15127,1307.4221,Baisakh,"Baisakh, Nileshkumar R. Patel",Energy Saving and Survival Routing Protocol for Mobile Ad Hoc Networks,arXiv admin note: substantial text overlap with arXiv:1307.3548,"International Journal of Computer Applications, Vol. 48, No. 2,
  June 2012",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a method to enhance the life time as well as improve
the performance of the mobile ad hoc networks (MANET). Since MANET consists of
devices that run on batteries, having limited amount of energy and due to the
self-configuring and dynamic change of topology, all operations are performed
by the node itself.
","[{'version': 'v1', 'created': 'Tue, 16 Jul 2013 09:40:42 GMT'}]",2013-07-17,"[['Baisakh', '', ''], ['Patel', 'Nileshkumar R.', '']]","['MANET', 'Energy Consumption in MANET', 'DSR', 'ESSDSR']"
15128,1301.2335,Omar Khadir,"Ounasser Abid, Jaouad Ettanfouhi and Omar Khadir",New digital signature protocol based on elliptic curves,,"International Journal on Cryptography and Information Security
  (2012)",,,cs.CR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, a new digital signature based on elliptic curves is presented.
We established its efficiency and security. The method, derived from a variant
of ElGamal signature scheme, can be seen as a secure alternative protocol if
known systems are completely broken.
","[{'version': 'v1', 'created': 'Thu, 10 Jan 2013 21:31:51 GMT'}]",2013-01-14,"[['Abid', 'Ounasser', ''], ['Ettanfouhi', 'Jaouad', ''], ['Khadir', 'Omar', '']]","['Public key cryptography', 'Digital signature', 'ElGamal signature scheme', 'Elliptic curves', 'Discrete logarithmproblem']"
15129,1504.06077,Nicolas Turenne,"Nicolas Turenne, Mathieu Andro, Roselyne Corbi\`ere, Tien T. Phan","Open Data Platform for Knowledge Access in Plant Health Domain : VESPA
  Mining",,,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Important data are locked in ancient literature. It would be uneconomic to
produce these data again and today or to extract them without the help of text
mining technologies. Vespa is a text mining project whose aim is to extract
data on pest and crops interactions, to model and predict attacks on crops, and
to reduce the use of pesticides. A few attempts proposed an agricultural
information access. Another originality of our work is to parse documents with
a dependency of the document architecture.
","[{'version': 'v1', 'created': 'Thu, 23 Apr 2015 08:27:29 GMT'}]",2015-04-24,"[['Turenne', 'Nicolas', ''], ['Andro', 'Mathieu', ''], ['Corbière', 'Roselyne', ''], ['Phan', 'Tien T.', '']]","['Data Sciences', 'Open Data', 'Plant Health', 'Text-Mining', 'Document Structure', 'EndUser Web Platform', 'OCR correction']"
15130,1607.03226,Xiaoyue Jiang,"Xiaoyue Jiang, Dong Zhang and Xiaoyi Feng","Local feature hierarchy for face recognition across pose and
  illumination",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Even though face recognition in frontal view and normal lighting condition
works very well, the performance degenerates sharply in extreme conditions.
Recently there are many work dealing with pose and illumination problems,
respectively. However both the lighting and pose variation will always be
encountered at the same time. Accordingly we propose an end-to-end face
recognition method to deal with pose and illumination simultaneously based on
convolutional networks where the discriminative nonlinear features that are
invariant to pose and illumination are extracted. Normally the global structure
for images taken in different views is quite diverse. Therefore we propose to
use the 1*1 convolutional kernel to extract the local features. Furthermore the
parallel multi-stream multi-layer 1*1 convolution network is developed to
extract multi-hierarchy features. In the experiments we obtained the average
face recognition rate of 96.9% on multiPIE dataset,which improves the
state-of-the-art of face recognition across poses and illumination by 7.5%.
Especially for profile-wise positions, the average recognition rate of our
proposed network is 97.8%, which increases the state-of-the-art recognition
rate by 19%.
","[{'version': 'v1', 'created': 'Tue, 12 Jul 2016 03:52:30 GMT'}]",2016-07-13,"[['Jiang', 'Xiaoyue', ''], ['Zhang', 'Dong', ''], ['Feng', 'Xiaoyi', '']]","['face recognition', 'pose variation', 'illumination variation', 'local feature', 'convolutional neural networks']"
15131,0910.1468,Rdv Ijcsis,"P. Jayarekha, T. R. GopalaKrishnan Nair",Prefetching of VoD Programs Based On ART1 Requesting Clustering,"7 pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 5, No. 1, pp. 128-134, September 2009, USA",,ISSN 1947 5500,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel approach to group users according to the
VoD user request pattern. We cluster the user requests based on ART1 neural
network algorithm. The knowledge extracted from the cluster is used to prefetch
the multimedia object from each cluster before the users request. We have
developed an algorithm to cluster users according to the users request patterns
based on ART1 neural network algorithm that offers an unsupervised clustering.
This approach adapts to changes in user request patterns over period without
losing previous information. Each cluster is represented as prototype vector by
generalizing the most frequently used URLs that are accessed by all the cluster
members. The simulation results of our proposed clustering and prefetching
algorithm, shows enormous increase in the performance of streaming server. Our
algorithm helps the servers agent to learn user preferences and discover the
information about the corresponding sources and other similar interested
individuals.
","[{'version': 'v1', 'created': 'Thu, 8 Oct 2009 11:21:21 GMT'}]",2009-10-09,"[['Jayarekha', 'P.', ''], ['Nair', 'T. R. GopalaKrishnan', '']]","['Adaptive Resonance theory 1 (ART1)', 'clustering', 'Predictive prefetch', 'neural networks']"
15132,1303.6200,Xujin Chen,"Zhigang Cao, Xujin Chen, Changjun Wang",How to Schedule the Marketing of Products with Negative Externalities,"16 pages, 1 figure",,,,cs.GT cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In marketing products with negative externalities, a schedule which specifies
an order of consumer purchase decisions is crucial, since in the social network
of consumers, the decision of each consumer is negatively affected by the
choices of her neighbors. In this paper, we study the problems of finding a
marketing schedule for two asymmetric products with negative externalites. The
goals are two-fold: maximizing the sale of one product and ensuring regret-free
purchase decisions. We show that the maximization is NP-hard, and provide
efficient algorithms with satisfactory performance guarantees. Two of these
algorithms give regret-proof schedules, i.e. they reach Nash equilibria where
no consumers regret their previous decisions. Our work is the first attempt to
address these marketing problems from an algorithmic point of view.
","[{'version': 'v1', 'created': 'Mon, 25 Mar 2013 16:32:20 GMT'}]",2013-03-26,"[['Cao', 'Zhigang', ''], ['Chen', 'Xujin', ''], ['Wang', 'Changjun', '']]","['Negative externality', 'Social network', 'Nash equilibrium', 'Efficient algorithm', 'Marketing schedule']"
15133,1606.08698,Guillem Collell,"Guillem Collell, Drazen Prelec, Kaustubh Patil","Reviving Threshold-Moving: a Simple Plug-in Bagging Ensemble for Binary
  and Multiclass Imbalanced Data",Typo in the proof fixed. TP/(P+N)=P(y=1) replaced by P/(P+N)=P(y=1),,,,cs.LG stat.AP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Class imbalance presents a major hurdle in the application of data mining
methods. A common practice to deal with it is to create ensembles of
classifiers that learn from resampled balanced data. For example, bagged
decision trees combined with random undersampling (RUS) or the synthetic
minority oversampling technique (SMOTE). However, most of the resampling
methods entail asymmetric changes to the examples of different classes, which
in turn can introduce its own biases in the model. Furthermore, those methods
require a performance measure to be specified a priori before learning. An
alternative is to use a so-called threshold-moving method that a posteriori
changes the decision threshold of a model to counteract the imbalance, thus has
a potential to adapt to the performance measure of interest. Surprisingly,
little attention has been paid to the potential of combining bagging ensemble
with threshold-moving. In this paper, we present probability thresholding
bagging (PT-bagging), a versatile plug-in method that fills this gap. Contrary
to usual rebalancing practice, our method preserves the natural class
distribution of the data resulting in well calibrated posterior probabilities.
We also extend the proposed method to handle multiclass data. The method is
validated on binary and multiclass benchmark data sets. We perform analyses
that provide insights into the proposed method.
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2016 13:49:30 GMT'}, {'version': 'v2', 'created': 'Sun, 3 Jul 2016 18:53:14 GMT'}, {'version': 'v3', 'created': 'Tue, 20 Jun 2017 08:09:37 GMT'}]",2017-06-21,"[['Collell', 'Guillem', ''], ['Prelec', 'Drazen', ''], ['Patil', 'Kaustubh', '']]","['imbalanced data', 'binary classification', 'multiclass classification', 'bagging ensembles', 'resampling', 'posterior calibration']"
15134,1306.2801,KyungHyun Cho,Kyunghyun Cho,"Understanding Dropout: Training Multi-Layer Perceptrons with Auxiliary
  Independent Stochastic Neurons",ICONIP 2013: Special Session in Deep Learning (v4),,,,cs.NE cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a simple, general method of adding auxiliary stochastic
neurons to a multi-layer perceptron is proposed. It is shown that the proposed
method is a generalization of recently successful methods of dropout (Hinton et
al., 2012), explicit noise injection (Vincent et al., 2010; Bishop, 1995) and
semantic hashing (Salakhutdinov & Hinton, 2009). Under the proposed framework,
an extension of dropout which allows using separate dropping probabilities for
different hidden neurons, or layers, is found to be available. The use of
different dropping probabilities for hidden layers separately is empirically
investigated.
","[{'version': 'v1', 'created': 'Wed, 12 Jun 2013 12:38:40 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Jun 2013 15:09:29 GMT'}, {'version': 'v3', 'created': 'Mon, 22 Jul 2013 11:42:18 GMT'}, {'version': 'v4', 'created': 'Sun, 18 Aug 2013 21:39:12 GMT'}]",2013-08-20,"[['Cho', 'Kyunghyun', '']]","['Multi-layer Perceptron', 'Stochastic Neuron', 'Dropout', 'Deep Learning']"
15135,1708.01304,Ivy Bo Peng,"Ivy Bo Peng, Roberto Gioiosa, Gokcen Kestor, Erwin Laure and Stefano
  Markidis",Preparing HPC Applications for the Exascale Era: A Decoupling Strategy,The 46th International Conference on Parallel Processing (ICPP-2017),,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Production-quality parallel applications are often a mixture of diverse
operations, such as computation- and communication-intensive, regular and
irregular, tightly coupled and loosely linked operations. In conventional
construction of parallel applications, each process performs all the
operations, which might result inefficient and seriously limit scalability,
especially at large scale. We propose a decoupling strategy to improve the
scalability of applications running on large-scale systems.
  Our strategy separates application operations onto groups of processes and
enables a dataflow processing paradigm among the groups. This mechanism is
effective in reducing the impact of load imbalance and increases the parallel
efficiency by pipelining multiple operations. We provide a proof-of-concept
implementation using MPI, the de-facto programming system on current
supercomputers. We demonstrate the effectiveness of this strategy by decoupling
the reduce, particle communication, halo exchange and I/O operations in a set
of scientific and data-analytics applications. A performance evaluation on
8,192 processes of a Cray XC40 supercomputer shows that the proposed approach
can achieve up to 4x performance improvement.
","[{'version': 'v1', 'created': 'Thu, 3 Aug 2017 20:44:39 GMT'}]",2017-08-07,"[['Peng', 'Ivy Bo', ''], ['Gioiosa', 'Roberto', ''], ['Kestor', 'Gokcen', ''], ['Laure', 'Erwin', ''], ['Markidis', 'Stefano', '']]","['HPC Streaming Computing', 'Decoupling', 'ExascaleComputing', 'MPI Data Streams']"
15136,1301.7119,Yoann Dieudonn\'e,"Yoann Dieudonn\'e, Andrzej Pelc, Vincent Villain",How to Meet Asynchronously at Polynomial Cost,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two mobile agents starting at different nodes of an unknown network have to
meet. This task is known in the literature as rendezvous. Each agent has a
different label which is a positive integer known to it, but unknown to the
other agent. Agents move in an asynchronous way: the speed of agents may vary
and is controlled by an adversary. The cost of a rendezvous algorithm is the
total number of edge traversals by both agents until their meeting. The only
previous deterministic algorithm solving this problem has cost exponential in
the size of the graph and in the larger label. In this paper we present a
deterministic rendezvous algorithm with cost polynomial in the size of the
graph and in the length of the smaller label. Hence we decrease the cost
exponentially in the size of the graph and doubly exponentially in the labels
of agents. As an application of our rendezvous algorithm we solve several
fundamental problems involving teams of unknown size larger than 1 of labeled
agents moving asynchronously in unknown networks. Among them are the following
problems: team size, in which every agent has to find the total number of
agents, leader election, in which all agents have to output the label of a
single agent, perfect renaming in which all agents have to adopt new different
labels from the set {1, . . . , k}, where k is the number of agents, and
gossiping, in which each agent has initially a piece of information (value) and
all agents have to output all the values. Using our rendezvous algorithm we
solve all these problems at cost polynomial in the size of the graph and in the
smallest length of all labels of participating agents.
","[{'version': 'v1', 'created': 'Wed, 30 Jan 2013 01:25:48 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Apr 2015 15:36:59 GMT'}]",2015-04-24,"[['Dieudonné', 'Yoann', ''], ['Pelc', 'Andrzej', ''], ['Villain', 'Vincent', '']]","['asynchronous mobile agents', 'network', 'rendezvous', 'deterministic algorithm', 'leader election', 'renaming', 'gossiping']"
15137,1208.0591,Partha Pratim Ray,"Poulami Majumder, Partha Pratim Ray","Hatch-Sens: a Theoretical Bio-Inspired Model to Monitor the Hatching of
  Plankton Culture in the Vicinity of Wireless Sensor Network",ISSN 0975-9646,"International Journal of Computer Science and Information
  Technologies (IJCSIT) 3(4) 4764-4769 (2012)",,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  Plankton research has always been an important area of biology. Due to
various environmental issues and other research interests, plankton hatching
and harnessing has been extremely red-marked zone for bio-aqua scientists
recently. To counter this problem, no wireless sensor assisted technique or
mechanism has yet not been devised. In this literature, we propose a novel
approach to pursue this task by the virtue of a theoretical Bio-inspired model
named Hatch-Sens, to automatically monitor different parameters of plankton
hatching in laboratory environment. This literature illustrates the concepts
and detailed mechanisms to accumulate this given problem. Hatch-Sens is a novel
idea which combines the biology with computer in its sensing network to monitor
hatching parameters of Artemia salina. This model reduces the manual tiresome
monitoring of hatching of plankton culture by wireless sensor network.
","[{'version': 'v1', 'created': 'Thu, 2 Aug 2012 17:01:53 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Aug 2012 07:08:41 GMT'}]",2012-08-07,"[['Majumder', 'Poulami', ''], ['Ray', 'Partha Pratim', '']]","['Plankton', 'Artemia salina', 'zooplankton', 'autotrophic', 'bio-inspiration', 'wireless sensor network']"
15138,1603.07313,Jes\'us Tramullas,"Piedad Garrido, Jesus Tramullas, Manuel Coll","CONDITOR1: Topic Maps and DITA labelling tool for textual documents with
  historical information",,"Journal of Digital Information, 10, 4, 2009",,,cs.DL cs.CL cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Conditor is a software tool which works with textual documents containing
historical information. The purpose of this work two-fold: firstly to show the
validity of the developed engine to correctly identify and label the entities
of the universe of discourse with a labelled-combined XTM-DITA model. Secondly
to explain the improvements achieved in the information retrieval process
thanks to the use of a object-oriented database (JPOX) as well as its
integration into the Lucene-type database search process to not only accomplish
more accurate searches, but to also help the future development of a
recommender system. We finish with a brief demo in a 3D-graph of the results of
the aforementioned search.
","[{'version': 'v1', 'created': 'Wed, 23 Mar 2016 19:26:20 GMT'}]",2016-03-24,"[['Garrido', 'Piedad', ''], ['Tramullas', 'Jesus', ''], ['Coll', 'Manuel', '']]","['Topic Maps', 'XTM', 'DITA', 'JPOX', 'Lucene', 'object-oriented databases', 'historical information', 'cultural heritage']"
15139,1702.03364,Bal Khadka,Bal K. Khadka and Spyros M. Magliveras,Techniques in Lattice Basis Reduction,"Keywords: Lattice basis, unimodular matrices, right permutations, LLL
  algorithm, random walk distribution",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The credit on {\it reduction theory} goes back to the work of Lagrange,
Gauss, Hermite, Korkin, Zolotarev, and Minkowski. Modern reduction theory is
voluminous and includes the work of A. Lenstra, H. Lenstra and L. Lovasz who
created the well known LLL algorithm, and many other researchers such as L.
Babai and C. P. Schnorr who created significant new variants of basis reduction
algorithms. In this paper, we propose and investigate the efficacy of new
optimization techniques to be used along with LLL algorithm. The techniques we
have proposed are: i) {\it hill climbing (HC)}, ii) {\it lattice diffusion-sub
lattice fusion (LDSF)}, and iii) {\it multistage hybrid LDSF-HC}. The first
technique relies on the sensitivity of LLL to permutations of the input basis
$B$, and optimization ideas over the symmetric group $S_m$ viewed as a metric
space. The second technique relies on partitioning the lattice into
sublattices, performing basis reduction in the partition sublattice blocks,
fusing the sublattices, and repeating. We also point out places where parallel
computation can reduce run-times achieving almost linear speedup. The
multistage hybrid technique relies on the lattice diffusion and sublattice
fusion and hill climbing algorithms.
","[{'version': 'v1', 'created': 'Sat, 11 Feb 2017 01:20:50 GMT'}]",2017-02-14,"[['Khadka', 'Bal K.', ''], ['Magliveras', 'Spyros M.', '']]","['Lattice bases', 'unimodular matrices', 'right permutations', 'LLLalgorithm', 'random walk distribution']"
15140,1701.02494,Nils Vortmeier,"Thomas Schwentick, Nils Vortmeier, Thomas Zeume",Dynamic Complexity under Definable Changes,Full version of an article to be published in ICDT 2017,,,,cs.LO cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies dynamic complexity under definable change operations in
the DynFO framework by Patnaik and Immerman. It is shown that for changes
definable by parameter-free first-order formulas, all (uniform) $AC^1$ queries
can be maintained by first-order dynamic programs. Furthermore, many
maintenance results for single-tuple changes are extended to more powerful
change operations: (1) The reachability query for undirected graphs is
first-order maintainable under single tuple changes and first-order defined
insertions, likewise the reachability query for directed acyclic graphs under
quantifier-free insertions. (2) Context-free languages are first-order
maintainable under $\Sigma_1$-defined changes. These results are complemented
by several inexpressibility results, for example, that the reachability query
cannot be maintained by quantifier-free programs under definable,
quantifier-free deletions.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2017 09:43:10 GMT'}]",2017-01-11,"[['Schwentick', 'Thomas', ''], ['Vortmeier', 'Nils', ''], ['Zeume', 'Thomas', '']]","['Dynamic descriptive complexity', 'SQL updates', 'dynamic programs']"
15141,0705.0781,Tshilidzi Marwala,Jonathan M.Spiller and T. Marwala,Medical Image Segmentation and Localization using Deformable Templates,4 pages,,,,cs.CV,,"  This paper presents deformable templates as a tool for segmentation and
localization of biological structures in medical images. Structures are
represented by a prototype template, combined with a parametric warp mapping
used to deform the original shape. The localization procedure is achieved using
a multi-stage, multi-resolution algorithm de-signed to reduce computational
complexity and time. The algorithm initially identifies regions in the image
most likely to contain the desired objects and then examines these regions at
progressively increasing resolutions. The final stage of the algorithm involves
warping the prototype template to match the localized objects. The algorithm is
presented along with the results of four example applications using MRI, x-ray
and ultrasound images.
","[{'version': 'v1', 'created': 'Sun, 6 May 2007 06:02:46 GMT'}]",2007-05-23,"[['Spiller', 'Jonathan M.', ''], ['Marwala', 'T.', '']]","['Deformable template', 'Localization', 'Segmentation', 'Multi-resolution algorithm', 'Medical imaging']"
15142,1304.2538,M.M.A. Hashem,"K.M. Motahar Hossain, Zahir Raihan and M.M.A. Hashem","On Appropriate Selection of Fuzzy Aggregation Operators in Medical
  Decision Support System",,"Procs. of the 8th International Conference on Computer &
  Information Technology (ICCIT 2005), pp. 563-568, Dhaka, Bangladesh, December
  28-30, (2005)",,,cs.AI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Decision Support System (DSS) contains more than one antecedent and the
degrees of strength of the antecedents need to be combined to determine the
overall strength of the rule consequent. The membership values of the
linguistic variables in Fuzzy have to be combined using an aggregation
operator. But it is not feasible to predefine the form of aggregation operators
in decision making. Instead, each rule should be found based on the feeling of
the experts and on their actual decision pattern over the set of typical
examples. Thus this work illustrates how the choice of aggregation operators is
intended to mimic human decision making and can be selected and adjusted to fit
empirical data, a series of test cases. Both parametrized and nonparametrized
aggregation operators are adapted to fit empirical data. Moreover, they
provided compensatory properties and, therefore, seemed to produce a better
decision support system. To solve the problem, a threshold point from the
output of the aggregation operators is chosen as the separation point between
two classes. The best achieved accuracy is chosen as the appropriate
aggregation operator. Thus a medical decision can be generated which is very
close to a practitioner's guideline.
","[{'version': 'v1', 'created': 'Tue, 9 Apr 2013 11:25:13 GMT'}]",2013-04-10,"[['Hossain', 'K. M. Motahar', ''], ['Raihan', 'Zahir', ''], ['Hashem', 'M. M. A.', '']]","['Aggregation Operators', 'Decision Support System', 'Empirical Data', 'Fuzzy System', 'Membership Function']"
15143,1110.2595,Ravindra Jain,"R. K. Jain, Sumit Katiyar and N. K. Agrawal","Survey of Latest Wireless Cellular Technologies for Enhancement of
  Spectral Density at Reduced Cost","7 pages, 4 figures, international journal","IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 3, No. 2, 2011, 491-497",,,cs.CY,http://creativecommons.org/licenses/by/3.0/,"  The future of mobile wireless communication networks will include existing
3rd generation, 4th generation (implemented in Japan, USA, South Korea etc.),
5th generation (based on cognitive radio which implies the whole wireless world
interconnection & WISDOM - Wireless innovative System for Dynamic Operating
Megacommunications concept), 6th generation (with very high data rates Quality
of Service (QoS) and service applications) and 7th generation (with space
roaming). This paper is focused on the specifications of future generations and
latest technologies to be used in future wireless mobile communication
networks. However keeping in view the general poor masses of India, some of the
future generation technologies will be embedded with 2G and 2.5G so that
general masses may get the advantage of internet, multimedia services and the
operators may get proper revenues with little extra expenditure in the existing
mobile communication networks.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2011 08:30:38 GMT'}]",2011-10-13,"[['Jain', 'R. K.', ''], ['Katiyar', 'Sumit', ''], ['Agrawal', 'N. K.', '']]","['Quality of Service (QoS)', 'capacity', 'adaptive / smart antenna', 'Hierarchical Cellular Structure']"
15144,1708.01462,J\'anos V\'egh,J\'anos V\'egh,"How Amdahl's low restricts supercomputer applications and building ever
  bigger supercomputers","30 pages, 10 figures",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper reinterprets Amdahl's law in terms of execution time and applies
this simple model to supercomputing. The systematic discussion results in
practical formulas enabling to calculate expected running time using large
number of processors from experimental runs using low number of processors,
delivers a quantitative measure of computational efficiency of supercomputing
applications. Through separating non-parallelizable contribution to fractions
according to their origin, Amdahl's law enables to derive a timeline for
supercomputers (quite similar to Moore's law) and describes why Amdahl's law
limits the size of supercomputers. The paper validates that Amdahl's 50-years
old model (with slight extension) correctly describes the performance
limitations of the present supercomputers. Using some simple and reasonable
assumptions, the absolute performance bound of supercomputers is concluded,
furthermore that serious enhancements are still necessary to achieve the
exaFLOPS dream value.
","[{'version': 'v1', 'created': 'Fri, 4 Aug 2017 11:56:45 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Dec 2017 06:26:45 GMT'}]",2018-01-01,"[['Végh', 'János', '']]","['supercomputer', 'parallelization', 'performance', 'scaling', 'figure ofmerit', 'efficiency']"
15145,2007.05552,Ebenezer Agbozo,Maija K\=ale and Ebenezer Agbozo,Tracing Complexity in Food Blogging Entries,"12 pages, 5 figures, conference, published
  http://ceur-ws.org/Vol-2612/paper4.pdf","Proceedings of the Digital Humanities in the Nordic Countries 5th
  Conference, Riga, Latvia, October 21-23, 2020[online only]. CEUR Workshop
  Proceedings 2612 (2020) 51-62",,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Within this paper, we focus on the concept of complexity and how it is
represented in food blogging entries on Twitter. We turn specific attention to
complexity capture when looking at healthy foods, focusing on food blogging
entries that entail the notions of health/healthiness/healthy. We do so because
we consider that complexity manifests hedonism - that is the irrational
determinant of food choice above rational considerations of nutrition and
healthiness. Using text as a platform for our analysis, we derive bigrams and
topic models that illustrate the frequencies of words and bi-grams, thus,
pointing our attention to current discourse in food blogging entries on
Twitter. The results show that, contrary to complexity, that the dominating
characteristics in healthy food domain are easiness and speed of preparation,
however, rational and health related considerations may not always take
precedence when the choice is determined. Food blogging entries show
surprisingly little account of healthy food as being tasty and enjoyable. With
this we aim to contribute to the knowledge of how to shape more healthy
consumer behaviors. Having discovered the scarcity of hedonic connotations,
this work invites for further research in text-based information about food.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 18:13:48 GMT'}]",2020-07-14,"[['Kāle', 'Maija', ''], ['Agbozo', 'Ebenezer', '']]","['Bigram', 'Word Association', 'Food Blog', 'Social Media', 'Food Computing', 'Complexity', 'Hedonism']"
15146,1606.04081,Pedro Mota,"Pedro Mota, Maxine Eskenazi, Luisa Coheur","Graph-Community Detection for Cross-Document Topic Segment Relationship
  Identification",,,,,cs.CL cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a graph-community detection approach to identify
cross-document relationships at the topic segment level. Given a set of related
documents, we automatically find these relationships by clustering segments
with similar content (topics). In this context, we study how different
weighting mechanisms influence the discovery of word communities that relate to
the different topics found in the documents. Finally, we test different mapping
functions to assign topic segments to word communities, determining which topic
segments are considered equivalent.
  By performing this task it is possible to enable efficient multi-document
browsing, since when a user finds relevant content in one document we can
provide access to similar topics in other documents. We deploy our approach in
two different scenarios. One is an educational scenario where equivalence
relationships between learning materials need to be found. The other consists
of a series of dialogs in a social context where students discuss commonplace
topics. Results show that our proposed approach better discovered equivalence
relationships in learning material documents and obtained close results in the
social speech domain, where the best performing approach was a clustering
technique.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2016 19:41:56 GMT'}]",2016-06-14,"[['Mota', 'Pedro', ''], ['Eskenazi', 'Maxine', ''], ['Coheur', 'Luisa', '']]","['Clustering', 'Document Relationship Identification', 'GraphCommunity Detection']"
15147,1603.03947,Cemal Hanilci,"Cemal Hanilci, Tomi Kinnunen, Md Sahidullah, Aleksandr Sizov","Spoofing Detection Goes Noisy: An Analysis of Synthetic Speech Detection
  in the Presence of Additive Noise","23 Pages, 7 figures",,,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic speaker verification (ASV) technology is recently finding its way
to end-user applications for secure access to personal data, smart services or
physical facilities. Similar to other biometric technologies, speaker
verification is vulnerable to spoofing attacks where an attacker masquerades as
a particular target speaker via impersonation, replay, text-to-speech (TTS) or
voice conversion (VC) techniques to gain illegitimate access to the system. We
focus on TTS and VC that represent the most flexible, high-end spoofing
attacks. Most of the prior studies on synthesized or converted speech detection
report their findings using high-quality clean recordings. Meanwhile, the
performance of spoofing detectors in the presence of additive noise, an
important consideration in practical ASV implementations, remains largely
unknown. To this end, we analyze the suitability of state-of-the-art synthetic
speech detectors under additive noise with a special focus on front-end
features. Our comparison includes eight acoustic feature sets, five related to
spectral magnitude and three to spectral phase information. Our extensive
experiments on ASVSpoof 2015 corpus reveal several important findings. Firstly,
all the countermeasures break down even at relatively high signal-to-noise
ratios (SNRs) and fail to generalize to noisy conditions. Secondly, speech
enhancement is not found helpful. Thirdly, GMM back-end generally outperforms
the more involved i-vector back-end. Fourthly, concerning the compared
features, the Mel-frequency cepstral coefficients (MFCCs) and subband spectral
centroid magnitude coefficients (SCMCs) perform the best on average though the
winner method depends on SNR and noise type. Finally, a study with two score
fusion strategies shows that combining different feature based systems improves
recognition accuracy for known and unknown attacks in both clean and noisy
conditions.
","[{'version': 'v1', 'created': 'Sat, 12 Mar 2016 17:44:48 GMT'}, {'version': 'v2', 'created': 'Mon, 2 May 2016 17:32:23 GMT'}, {'version': 'v3', 'created': 'Wed, 14 Sep 2016 21:07:59 GMT'}]",2016-09-16,"[['Hanilci', 'Cemal', ''], ['Kinnunen', 'Tomi', ''], ['Sahidullah', 'Md', ''], ['Sizov', 'Aleksandr', '']]","['speaker recognition', 'anti spoofing', 'countermeasures', 'additive noise']"
15148,1005.5142,Pedro S\'anchez Terraf,Pedro S\'anchez Terraf,Unprovability of the Logical Characterization of Bisimulation,"Extended introduction and comments; extra section on semi-pullbacks;
  11 pages Some background details added; extra example on the non-locality of
  state bisimilarity; 14 pages",,,,cs.LO,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We quickly review labelled Markov processes (LMP) and provide a
counterexample showing that in general measurable spaces, event bisimilarity
and state bisimilarity differ in LMP. This shows that the logic in Desharnais
[*] does not characterize state bisimulation in non-analytic measurable spaces.
Furthermore we show that, under current foundations of Mathematics, such
logical characterization is unprovable for spaces that are projections of a
coanalytic set. Underlying this construction there is a proof that stationary
Markov processes over general measurable spaces do not have semi-pullbacks.
([*] J. Desharnais, Labelled Markov Processes. School of Computer Science.
McGill University, Montr\'eal (1999))
","[{'version': 'v1', 'created': 'Thu, 27 May 2010 18:13:27 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Aug 2010 19:19:18 GMT'}, {'version': 'v3', 'created': 'Fri, 10 Dec 2010 16:53:06 GMT'}]",2010-12-13,"[['Terraf', 'Pedro Sánchez', '']]","['labelled Markov process', 'probabilistic bisimulation', 'modal logic', 'non measurable set']"
15149,1207.4931,Gyanendra Nath  Tripathi,G. N. Tripathi and V. Rihani,"Motion Planning Of an Autonomous Mobile Robot Using Artificial Neural
  Network","7 pages, 4 figures, 1 table, 1 graph chart, ITCA-2012, Chennai, India",,,,cs.RO cs.AI cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents the electronic design and motion planning of a robot based
on decision making regarding its straight motion and precise turn using
Artificial Neural Network (ANN). The ANN helps in learning of robot so that it
performs motion autonomously. The weights calculated are implemented in
microcontroller. The performance has been tested to be excellent.
","[{'version': 'v1', 'created': 'Fri, 20 Jul 2012 12:15:12 GMT'}]",2012-07-23,"[['Tripathi', 'G. N.', ''], ['Rihani', 'V.', '']]","['Autonomous Robot', 'Artificial Neural Network (ANN)', 'Motion Planning', 'Mobile Robot', 'Robot Intelligence', 'Machine Learning']"
15150,1505.02186,Heide Gluesing-Luerssen,Heide Gluesing-Luerssen and Carolyn Troha,Construction of Subspace Codes through Linkage,,,,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A construction is presented that allows to produce subspace codes of long
length using subspace codes of shorter length in combination with a rank metric
code. The subspace distance of the resulting code, called linkage code, is as
good as the minimum subspace distance of the constituent codes. As a special
application, the construction of the best known partial spreads is reproduced.
Finally, for a special case of linkage, a decoding algorithm is presented which
amounts to decoding with respect to the smaller constituent codes and which can
be parallelized.
","[{'version': 'v1', 'created': 'Fri, 8 May 2015 21:01:40 GMT'}]",2015-05-12,"[['Gluesing-Luerssen', 'Heide', ''], ['Troha', 'Carolyn', '']]","['Random network coding', 'constant dimension subspace codes', 'partial spreads']"
15151,1401.2732,Rourab Paul,"Rourab Paul, Amlan Chakrabarti, Ranjan Ghosh","Fault Detection for RC4 Algorithm and its Implementation on FPGA
  Platform","Published Book Title: Elsevier Science and Technology, ICCN 2013,
  Bangalore, Page(s): 224 - 232, Volume 3, DOI-03.elsevierst.2013.3.ICCN25,
  ISBN :9789351071044",,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In hardware implementation of a cryptographic algorithm, one may achieve
leakage of secret information by creating scopes to introduce controlled faulty
bit(s) even though the algorithm is mathematically a secured one. The technique
is very effective in respect of crypto processors embedded in smart cards. In
this paper few fault detecting architectures for RC4 algorithm are designed and
implemented on Virtex5(ML505, LX110t) FPGA board. The results indicate that the
proposed architectures can handle most of the faults without loss of throughput
consuming marginally additional hardware and power.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2014 07:19:52 GMT'}]",2016-10-31,"[['Paul', 'Rourab', ''], ['Chakrabarti', 'Amlan', ''], ['Ghosh', 'Ranjan', '']]","['RC4', 'FPGA', 'Fault Tolerance']"
15152,1602.08903,Juan Carlos Nieves,"Mauricio Osorio, Juan Carlos Nieves",Range-based argumentation semantics as 2-valued models,"16 pages, to appear in Theory and Practice of Logic Programming
  (TPLP)",,,,cs.LO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Characterizations of semi-stable and stage extensions in terms of 2-valued
logical models are presented. To this end, the so-called GL-supported and
GL-stage models are defined. These two classes of logical models are logic
programming counterparts of the notion of range which is an established concept
in argumentation semantics.
","[{'version': 'v1', 'created': 'Mon, 29 Feb 2016 10:55:12 GMT'}]",2016-03-01,"[['Osorio', 'Mauricio', ''], ['Nieves', 'Juan Carlos', '']]","['Logic programming semantics', 'Argumentation Semantics', 'Non-monotonic Reasoning']"
15153,0907.4426,Christopher Frenz,"Christopher M. Frenz, Steve Peters, Wilson Julien",Evolution of Digital Logic Functionality via a Genetic Algorithm,"Frenz, C.M., Peters, S., Julien, W. (2009) Evolution of Digital Logic
  Functionality via a Genetic Algorithm, Proceedings of the 2009 International
  Conference on Genetic and Evolutionary Methods (GEM 2009), 99-101",,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Digital logic forms the functional basics of most modern electronic equipment
and as such the creation of novel digital logic circuits is an active area of
computer engineering research. This study demonstrates that genetic algorithms
can be used to evolve functionally useful sets of logic gate interconnections
to create useful digital logic circuits. The efficacy of this approach is
illustrated via the evolution of AND, OR, XOR, NOR, and XNOR functionality from
sets of NAND gates, thereby illustrating that evolutionary methods have the
potential be applied to the design of digital electronics.
","[{'version': 'v1', 'created': 'Sat, 25 Jul 2009 15:21:16 GMT'}]",2009-07-28,"[['Frenz', 'Christopher M.', ''], ['Peters', 'Steve', ''], ['Julien', 'Wilson', '']]","['Genetic Algorithms', 'Evolutionary Computing', 'Digital Logic', 'Computer Engineering']"
15154,1510.08231,Hachem Kadri,"Hachem Kadri (LIF), Emmanuel Duflos (CRIStAL), Philippe Preux
  (CRIStAL, SEQUEL), St\'ephane Canu (LITIS), Alain Rakotomamonjy (LITIS),
  Julien Audiffren (CMLA)",Operator-valued Kernels for Learning from Functional Response Data,"in Journal of Machine Learning Research (JMLR), 2016",Journal of Machine Learning Research 17 (2016) 1-54,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider the problems of supervised classification and
regression in the case where attributes and labels are functions: a data is
represented by a set of functions, and the label is also a function. We focus
on the use of reproducing kernel Hilbert space theory to learn from such
functional data. Basic concepts and properties of kernel-based learning are
extended to include the estimation of function-valued functions. In this
setting, the representer theorem is restated, a set of rigorously defined
infinite-dimensional operator-valued kernels that can be valuably applied when
the data are functions is described, and a learning algorithm for nonlinear
functional data analysis is introduced. The methodology is illustrated through
speech and audio signal processing experiments.
","[{'version': 'v1', 'created': 'Wed, 28 Oct 2015 09:18:50 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Nov 2015 14:10:25 GMT'}, {'version': 'v3', 'created': 'Wed, 2 Nov 2016 14:29:29 GMT'}]",2016-11-03,"[['Kadri', 'Hachem', '', 'LIF'], ['Duflos', 'Emmanuel', '', 'CRIStAL'], ['Preux', 'Philippe', '', 'CRIStAL, SEQUEL'], ['Canu', 'Stéphane', '', 'LITIS'], ['Rakotomamonjy', 'Alain', '', 'LITIS'], ['Audiffren', 'Julien', '', 'CMLA']]","['nonlinear functional data analysis', 'operator-valued kernels', 'function-valuedreproducing kernel Hilbert spaces', 'audio signal processing']"
15155,1407.5759,Denis Fortun,"Denis Fortun (INRIA), Patrick Bouthemy (INRIA), Charles Kervrann
  (INRIA)","Aggregation of local parametric candidates with exemplar-based occlusion
  handling for optical flow","Submission,IEEE Transactions on Image Processing (2014)",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Handling all together large displacements, motion details and occlusions
remains an open issue for reliable computation of optical flow in a video
sequence. We propose a two-step aggregation paradigm to address this problem.
The idea is to supply local motion candidates at every pixel in a first step,
and then to combine them to determine the global optical flow field in a second
step. We exploit local parametric estimations combined with patch
correspondences and we experimentally demonstrate that they are sufficient to
produce highly accurate motion candidates. The aggregation step is designed as
the discrete optimization of a global regularized energy. The occlusion map is
estimated jointly with the flow field throughout the two steps. We propose a
generic exemplar-based approach for occlusion filling with motion vectors. We
achieve state-of-the-art results in computer vision benchmarks, with
particularly significant improvements in the case of large displacements and
occlusions.
","[{'version': 'v1', 'created': 'Tue, 22 Jul 2014 06:50:40 GMT'}]",2014-07-23,"[['Fortun', 'Denis', '', 'INRIA'], ['Bouthemy', 'Patrick', '', 'INRIA'], ['Kervrann', 'Charles', '', 'INRIA']]","['optical flow', 'occlusion', 'large displacement', 'local parametric motion', 'aggregationframework']"
15156,1705.09015,Marta Poblet,Marta Poblet and Enric Plaza,"Democracy Models and Civic Technologies: Tensions, Trilemmas, and
  Trade-offs","Workshop on 'Linked Democracy: AI for Democratic Innovation'
  (IJCAI2017), Melbourne, August 19, 2017",,,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper aims at connecting democratic theory with civic technologies in
order to highlight the links between some theoretical tensions and trilemmas
and design trade-offs. First, it reviews some tensions and trilemmas raised by
political philosophers and democratic theorists. Second, it considers both the
role and the limitations of civic technologies in mitigating these tensions and
trilemmas. Third, it proposes to adopt a meso-level approach, in between the
macro-level of democratic theories and the micro-level of tools, to situate the
interplay between people, digital technologies, and data.
","[{'version': 'v1', 'created': 'Thu, 25 May 2017 01:30:22 GMT'}]",2017-05-26,"[['Poblet', 'Marta', ''], ['Plaza', 'Enric', '']]","['Democracy', 'civic technologies', 'representation', 'participation', 'deliberation', 'linked democracy']"
15157,1605.01510,Pieter Kleer,"Pieter Kleer, Guido Sch\""afer",The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a unifying model to study the impact of worst-case latency
deviations in non-atomic selfish routing games. In our model, latencies are
subject to (bounded) deviations which are taken into account by the players.
The quality deterioration caused by such deviations is assessed by the
$\textit{Deviation Ratio}$, i.e., the worst-case ratio of the cost of a Nash
flow with respect to deviated latencies and the cost of a Nash flow with
respect to the unaltered latencies. This notion is inspired by the
$\textit{Price of Risk Aversion}$ recently studied by Nikolova and Stier-Moses.
Here we generalize their model and results. In particular, we derive tight
bounds on the Deviation Ratio for multi-commodity instances with a common
source and arbitrary non-negative and non-decreasing latency functions. These
bounds exhibit a linear dependency on the size of the network (besides other
parameters). In contrast, we show that for general multi-commodity networks an
exponential dependency is inevitable. We also improve recent smoothness results
to bound the Price of Risk Aversion.
","[{'version': 'v1', 'created': 'Thu, 5 May 2016 07:19:16 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Jun 2016 08:22:24 GMT'}]",2016-06-23,"[['Kleer', 'Pieter', ''], ['Schäfer', 'Guido', '']]","['selfish routing games', 'uncertainty', 'deviations', 'price of risk aversion', 'biased price of anarchy', 'network tolls']"
15158,1607.04360,Zelalem Yalew Jembre,Yalew Zelalem Jembre and Young-June Choi,Grid-Based Multichannel Access in Vehicular Networks,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In vehicular networks, vehicles exchange messages with each other as well as
infrastructure to prevent accidents or enhance driver's and passenger's
experience. In this paper, we propose a grid-based multichannel access scheme
to enhance the performance of a vehicular network. To determine the feasibility
of our scheme, we obtained preliminary results using the OPNET simulation tool.
","[{'version': 'v1', 'created': 'Fri, 15 Jul 2016 01:50:48 GMT'}]",2016-07-18,"[['Jembre', 'Yalew Zelalem', ''], ['Choi', 'Young-June', '']]","['Vehicular network', 'V2V', 'V2X', 'channel assignment', 'multichannel access']"
15159,1712.05319,Jose Dolz,"Jose Dolz and Christian Desrosiers and Li Wang and Jing Yuan and
  Dinggang Shen and Ismail Ben Ayed","Deep CNN ensembles and suggestive annotations for infant brain MRI
  segmentation",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Precise 3D segmentation of infant brain tissues is an essential step towards
comprehensive volumetric studies and quantitative analysis of early brain
developement. However, computing such segmentations is very challenging,
especially for 6-month infant brain, due to the poor image quality, among other
difficulties inherent to infant brain MRI, e.g., the isointense contrast
between white and gray matter and the severe partial volume effect due to small
brain sizes. This study investigates the problem with an ensemble of semi-dense
fully convolutional neural networks (CNNs), which employs T1-weighted and
T2-weighted MR images as input. We demonstrate that the ensemble agreement is
highly correlated with the segmentation errors. Therefore, our method provides
measures that can guide local user corrections. To the best of our knowledge,
this work is the first ensemble of 3D CNNs for suggesting annotations within
images. Furthermore, inspired by the very recent success of dense networks, we
propose a novel architecture, SemiDenseNet, which connects all convolutional
layers directly to the end of the network. Our architecture allows the
efficient propagation of gradients during training, while limiting the number
of parameters, requiring one order of magnitude less parameters than popular
medical image segmentation networks such as 3D U-Net. Another contribution of
our work is the study of the impact that early or late fusions of multiple
image modalities might have on the performances of deep architectures. We
report evaluations of our method on the public data of the MICCAI iSEG-2017
Challenge on 6-month infant brain MRI segmentation, and show very competitive
results among 21 teams, ranking first or second in most metrics.
","[{'version': 'v1', 'created': 'Thu, 14 Dec 2017 16:27:42 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Dec 2017 16:54:19 GMT'}]",2017-12-20,"[['Dolz', 'Jose', ''], ['Desrosiers', 'Christian', ''], ['Wang', 'Li', ''], ['Yuan', 'Jing', ''], ['Shen', 'Dinggang', ''], ['Ayed', 'Ismail Ben', '']]","['Deep learning', 'MRI', 'infant brain segmentation', '3D CNN', 'ensemble learning']"
15160,1505.05655,Poorna Dasgupta,Poorna Banerjee and Amit Dave,"GPGPU Based Parallelized Client-Server Framework for Providing High
  Performance Computation Support","6 pages, Published with International Journal of Computer Science &
  Technology (IJCST)- Vol 4 Issue 1 Jan - March 2013","International Journal of Computer Science and Technology (IJCST)
  V4(1):508-513, Jan - March 2013",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parallel data processing has become indispensable for processing applications
involving huge data sets. This brings into focus the Graphics Processing Units
(GPUs) which emphasize on many-core computing. With the advent of General
Purpose GPUs (GPGPU), applications not directly associated with graphics
operations can also harness the computation capabilities of GPUs. Hence, it
would be beneficial if the computing capabilities of a given GPGPU could be
task optimized and made available. This paper describes a client-server
framework in which users can choose a processing task and submit large
data-sets for processing to a remote GPGPU and receive the results back, using
well defined interfaces. The framework provides extensibility in terms of the
number and type of tasks that the client can choose or submit for processing at
the remote GPGPU server machine, with complete transparency to the underlying
hardware and operating systems. Parallelization of user-submitted tasks on the
GPGPU has been achieved using NVIDIA Compute Unified Device Architecture
(CUDA).
","[{'version': 'v1', 'created': 'Thu, 21 May 2015 09:31:39 GMT'}]",2015-05-22,"[['Banerjee', 'Poorna', ''], ['Dave', 'Amit', '']]","['Client-Server Framework', 'High Performance Computation Support', 'GPGPU']"
15161,1610.05551,Giso Dal,Giso H. Dal and Peter J.F. Lucas,"Weighted Positive Binary Decision Diagrams for Exact Probabilistic
  Inference",30 pages,,,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent work on weighted model counting has been very successfully applied to
the problem of probabilistic inference in Bayesian networks. The probability
distribution is encoded into a Boolean normal form and compiled to a target
language, in order to represent local structure expressed among conditional
probabilities more efficiently. We show that further improvements are possible,
by exploiting the knowledge that is lost during the encoding phase and
incorporating it into a compiler inspired by Satisfiability Modulo Theories.
Constraints among variables are used as a background theory, which allows us to
optimize the Shannon decomposition. We propose a new language, called Weighted
Positive Binary Decision Diagrams, that reduces the cost of probabilistic
inference by using this decomposition variant to induce an arithmetic circuit
of reduced size.
","[{'version': 'v1', 'created': 'Tue, 18 Oct 2016 11:58:28 GMT'}]",2016-10-19,"[['Dal', 'Giso H.', ''], ['Lucas', 'Peter J. F.', '']]","['knowledge compilation', 'probabilistic inference', 'weighted model counting', 'Bayesian networks', 'binary decision diagrams']"
15162,1008.2181,Dmitry Zinoviev,Dmitry Zinoviev and Vy Duong,"A Game Theoretical Approach to Modeling Full-Duplex Information
  Dissemination","6 pages, 3 figures. Presented at Summer Computer Simulation
  Conference (SCSC2010)","Proc. SCSC2010, pp.358-363",,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One major function of social networks (e.g., massive online social networks)
is the dissemination of information such as scientific knowledge, news, and
rumors. Information can be propagated by the users of the network via natural
connections in written, oral or electronic form. The information passing from a
sender to a receiver intrinsically involves both of them considering their
self-perceived knowledge, reputation, and popularity, which further determine
their decisions of whether or not to forward the information and whether or not
to provide feedback. To understand such human aspects of the information
dissemination, we propose a game theoretical model of the two-way full duplex
information forwarding and feedback mechanisms in a social network that take
into account the personalities of the communicating actors (including their
perceived knowledgeability, reputation, and desire for popularity) and the
global characteristics of the network. The model demonstrates how the emergence
of social networks can be explained in terms of maximizing game theoretical
utility.
","[{'version': 'v1', 'created': 'Thu, 12 Aug 2010 18:28:21 GMT'}]",2010-08-13,"[['Zinoviev', 'Dmitry', ''], ['Duong', 'Vy', '']]","['Social Network', 'Game Theory', 'Learning', 'Knowledge', 'Popularity', 'Reputation', 'Rumor']"
15163,1004.3617,Qingshuo Song,"Qingshuo Song, Guanrong Chen, Daniel W. C. Ho",Consensus over a Random Network Generated by i.i.d. Stochastic Matrices,,,,,cs.NI math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our goal is to find a necessary and sufficient condition on the consensus
over a random network, generated by i.i.d. stochastic matrices. We show that
the consensus problem in three different convergence modes (almost surely, in
probability, and in L1) are equivalent, thus have the same necessary and
sufficient condition. We obtain the necessary and sufficient condition through
the stability in a projected subspace.
","[{'version': 'v1', 'created': 'Wed, 21 Apr 2010 04:39:56 GMT'}]",2010-04-22,"[['Song', 'Qingshuo', ''], ['Chen', 'Guanrong', ''], ['Ho', 'Daniel W. C.', '']]","['Consensus', 'stability', 'random network', 'stochastic matrix']"
15164,1603.05544,Linnan Wang,"Linnan Wang, Yi Yang, Martin Renqiang Min, Srimat Chakradhar","Accelerating Deep Neural Network Training with Inconsistent Stochastic
  Gradient Descent",The patent of ISGD belongs to NEC Labs,,,,cs.LG cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  SGD is the widely adopted method to train CNN. Conceptually it approximates
the population with a randomly sampled batch; then it evenly trains batches by
conducting a gradient update on every batch in an epoch. In this paper, we
demonstrate Sampling Bias, Intrinsic Image Difference and Fixed Cycle Pseudo
Random Sampling differentiate batches in training, which then affect learning
speeds on them. Because of this, the unbiased treatment of batches involved in
SGD creates improper load balancing. To address this issue, we present
Inconsistent Stochastic Gradient Descent (ISGD) to dynamically vary training
effort according to learning statuses on batches. Specifically ISGD leverages
techniques in Statistical Process Control to identify a undertrained batch.
Once a batch is undertrained, ISGD solves a new subproblem, a chasing logic
plus a conservative constraint, to accelerate the training on the batch while
avoid drastic parameter changes. Extensive experiments on a variety of datasets
demonstrate ISGD converges faster than SGD. In training AlexNet, ISGD is
21.05\% faster than SGD to reach 56\% top1 accuracy under the exactly same
experiment setup. We also extend ISGD to work on multiGPU or heterogeneous
distributed system based on data parallelism, enabling the batch size to be the
key to scalability. Then we present the study of ISGD batch size to the
learning rate, parallelism, synchronization cost, system saturation and
scalability. We conclude the optimal ISGD batch size is machine dependent.
Various experiments on a multiGPU system validate our claim. In particular,
ISGD trains AlexNet to 56.3% top1 and 80.1% top5 accuracy in 11.5 hours with 4
NVIDIA TITAN X at the batch size of 1536.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2016 15:49:48 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Mar 2016 05:35:22 GMT'}, {'version': 'v3', 'created': 'Tue, 28 Mar 2017 13:56:03 GMT'}]",2017-03-29,"[['Wang', 'Linnan', ''], ['Yang', 'Yi', ''], ['Min', 'Martin Renqiang', ''], ['Chakradhar', 'Srimat', '']]","['Neural Networks', 'Stochastic Gradient Descent', 'Statistical Process Control']"
15165,0708.2686,Darko Roglic,D. Roglic,"The universal evolutionary computer based on super-recursive algorithms
  of evolvability","7 pages, 1 table, 1 figure",,,,cs.NE,,"  This work exposes which mechanisms and procesess in the Nature of evolution
compute a function not computable by Turing machine. The computer with
intelligence that is not higher than one bacteria population could have, but
with efficency to solve the problems that are non-computable by Turing machine
is represented. This theoretical construction is called Universal Evolutinary
Computer and it is based on the superecursive algorithms of evolvability.
","[{'version': 'v1', 'created': 'Tue, 24 Jul 2007 18:50:22 GMT'}]",2007-08-21,"[['Roglic', 'D.', '']]","['Superrecursive Algorithms', 'Evolvability Computation', 'Universal Evolutionary Computer', 'Evolutionary Processable Unit (epu)', 'Epuon']"
15166,1307.6649,Dr. Rajesh Kumar  Tiwari,"Kumar Gunjan, R. K. Tiwari, G. Sahoo",Towards Securing APIs in Cloud Computing,"International Journal of Computer Engineering and Applications, June
  2013. arXiv admin note: text overlap with arXiv:0901.0131 by other authors",,,,cs.DC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Every organisation today wants to adopt cloud computing paradigm and leverage
its various advantages. Today everyone is aware of its characteristics which
have made it so popular and how it can help the organisations focus on their
core activities leaving all IT services development and maintenance to the
cloud service providers. Application Programming Interfaces (APIs) act as the
interface between the CSPs and the consumers. This paper proposes an improved
access control mechanism for securing the Cloud APIs.
","[{'version': 'v1', 'created': 'Thu, 25 Jul 2013 07:41:44 GMT'}]",2013-07-26,"[['Gunjan', 'Kumar', ''], ['Tiwari', 'R. K.', ''], ['Sahoo', 'G.', '']]","['Cloud security', 'access control', 'Cloud API', 'RBAC', 'TRBAC']"
15167,1212.3517,Mikael Gast,"Mikael Gast, Mathias Hauptmann, Marek Karpinski",Inapproximability of Dominating Set in Power Law Graphs,"23 pages, 4 figures",,,,cs.CC cs.DM cs.DS math.CO math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give logarithmic lower bounds for the approximability of the Minimum
Dominating Set problem in connected (alpha,beta)-Power Law Graphs. We give also
a best up to now upper approximation bound on the problem for the case of the
parameters beta>2. We develop also a new functional method for proving lower
approximation bounds and display a sharp phase transition between
approximability and inapproximability of the underlying problem. This method
could also be of independent interest.
","[{'version': 'v1', 'created': 'Fri, 14 Dec 2012 16:31:32 GMT'}]",2012-12-17,"[['Gast', 'Mikael', ''], ['Hauptmann', 'Mathias', ''], ['Karpinski', 'Marek', '']]","['Approximation Algorithms', 'Inapproximability', 'Power Law Graphs', 'Combinatorial Optimization', 'Dominating Set']"
15168,1202.5856,Javier Herranz,"Alex Escala, Javier Herranz, Benoit Libert, Carla Rafols",Hierarchical Identity-Based Lossy Trapdoor Functions,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lossy trapdoor functions, introduced by Peikert and Waters (STOC'08), have
received a lot of attention in the last years, because of their wide range of
applications in theoretical cryptography. The notion has been recently extended
to the identity-based setting by Bellare et al. (Eurocrypt'12). We provide one
more step in this direction, by considering the notion of hierarchical
identity-based (lossy) trapdoor functions (HIB-TDFs). Hierarchical
identity-based cryptography has proved very useful both for practical
applications and to establish theoretical relations with other cryptographic
primitives.
  The notion of security for IB-TDFs put forward by Bellare et al. easily
extends to the hierarchical scenario, but an (H)IB-TDF secure in this sense is
not known to generically imply other related primitives with security against
adaptive-id adversaries, not even IND-ID-CPA secure encryption. Our first
contribution is to define a new security property for (H)IB-TDFs. We show that
functions satisfying this property imply secure cryptographic primitives in the
adaptive identity-based setting: these include encryption schemes with semantic
security under chosen-plaintext attacks, deterministic encryption schemes, and
(non-adaptive) hedged encryption schemes that maintain some security when
messages are encrypted using randomness of poor quality.
  Then, we describe the first pairing-based HIB-TDF realization. Our HIB-TDF
construction is based on techniques that differ from those of Bellare et al. in
that it uses a hierarchical predicate encryption scheme as a key ingredient.
The resulting HIB-TDF is proved to satisfy the new security definition, against
either selective or, for hierarchies of constant depth, adaptive adversaries.
","[{'version': 'v1', 'created': 'Mon, 27 Feb 2012 08:43:31 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Mar 2012 08:10:49 GMT'}, {'version': 'v3', 'created': 'Tue, 6 Mar 2012 11:59:23 GMT'}, {'version': 'v4', 'created': 'Mon, 3 Sep 2012 07:13:52 GMT'}]",2012-09-04,"[['Escala', 'Alex', ''], ['Herranz', 'Javier', ''], ['Libert', 'Benoit', ''], ['Rafols', 'Carla', '']]","['Lossy trapdoor functions', 'hierarchical identity-based encryption', 'partial lossiness']"
15169,1206.1611,Ahmed Dooguy Kora,"Ahmed Dooguy Kora, Moussa Moindze Soidridine",Nagios Based Enhanced IT Management System,"ISSN : 0975-5462; (IJEST), Vol. 4 No.03 March 2012","International Journal of Engineering Science and Technology
  (IJEST), Vol. 4 No.03 March 2012, PP: 1199-1207",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The integrated management of multi-providers equipments is a key asset for
telecommunication operators or service providers when selecting the appropriate
network and service management platform for their network. In this paper, we
present an open and adaptable platform that support fault and configuration
management for next-generation networks. This platform Named Nagios based -
information technology management system (NB-ITMS) leverage of the well-known
Nagios platform to implement new capabilities. Offering additional features
applications and management functions enable easy and low cost management of
advanced services and networks technologies. The performance of our platform
has been compared to existing off-the-shell platforms.
","[{'version': 'v1', 'created': 'Thu, 7 Jun 2012 20:48:58 GMT'}]",2012-06-11,"[['Kora', 'Ahmed Dooguy', ''], ['Soidridine', 'Moussa Moindze', '']]","['Network Management System (NMS)', 'Open NMS', 'low cost NMS solution', 'NB-ITMS']"
15170,0906.5089,David Fern\'andez-Baca,"Mukul S. Bansal, Jianrong Dong, David Fern\'andez-Baca",Comparing and Aggregating Partially Resolved Trees,34 pages,,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We define, analyze, and give efficient algorithms for two kinds of distance
measures for rooted and unrooted phylogenies. For rooted trees, our measures
are based on the topologies the input trees induce on triplets; that is, on
three-element subsets of the set of species. For unrooted trees, the measures
are based on quartets (four-element subsets). Triplet and quartet-based
distances provide a robust and fine-grained measure of the similarities between
trees. The distinguishing feature of our distance measures relative to
traditional quartet and triplet distances is their ability to deal cleanly with
the presence of unresolved nodes, also called polytomies. For rooted trees,
these are nodes with more than two children; for unrooted trees, they are nodes
of degree greater than three.
  Our first class of measures are parametric distances, where there is a
parameter that weighs the difference between an unresolved triplet/quartet
topology and a resolved one. Our second class of measures are based on
Hausdorff distance. Each tree is viewed as a set of all possible ways in which
the tree could be refined to eliminate unresolved nodes. The distance between
the original (unresolved) trees is then taken to be the Hausdorff distance
between the associated sets of fully resolved trees, where the distance between
trees in the sets is the triplet or quartet distance, as appropriate.
","[{'version': 'v1', 'created': 'Sat, 27 Jun 2009 15:56:42 GMT'}]",2009-06-30,"[['Bansal', 'Mukul S.', ''], ['Dong', 'Jianrong', ''], ['Fernández-Baca', 'David', '']]","['Aggregation', 'Hausdorff distance', 'phylogenetic trees', 'quartet distance', 'tripletdistance']"
15171,1205.1125,Khalid Raza,Khalid Raza,Application Of Data Mining In Bioinformatics,,"Indian Journal of Computer Science and Engineering 1(2):114-118
  2010",,,cs.CE cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article highlights some of the basic concepts of bioinformatics and data
mining. The major research areas of bioinformatics are highlighted. The
application of data mining in the domain of bioinformatics is explained. It
also highlights some of the current challenges and opportunities of data mining
in bioinformatics.
","[{'version': 'v1', 'created': 'Sat, 5 May 2012 12:19:33 GMT'}]",2012-05-08,"[['Raza', 'Khalid', '']]","['Data Mining', 'Bioinformatics', 'Protein Sequences Analysis', 'Bioinformatics Tools']"
15172,1105.1948,Reza Keyvan,"Mohammadreza keyvanpour (1) and Najva Izadpanah (2) ((1) Department of
  Computer Engineering, Alzahra University, Tehran, Iran, (2) Department of
  Computer Engineering, Islamic Azad University, Qazvin Branch, Qazvin, Iran)","Analytical Classification of Multimedia Index Structures by Using a
  Partitioning Method-Based Framework",,"The International Journal of Multimedia & Its Applications (IJMA)
  Vol.3, No.1, February 2011",,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the advances in hardware technology and increase in production of
multimedia data in many applications, during the last decades, multimedia
databases have become increasingly important. Contentbased multimedia retrieval
is one of an important research area in the field of multimedia databases. Lots
of research on this field has led to proposition of different kinds of index
structures to support fast and efficient similarity search to retrieve
multimedia data from these databases. Due to variety and plenty of proposed
index structures, we suggest a systematic framework based on partitioning
method used in these structures to classify multimedia index structures, and
then we evaluated these structures based on important functional measures. We
hope this proposed framework will lead to empirical and technical comparison of
multimedia index structures and development of more efficient structures at
future.
","[{'version': 'v1', 'created': 'Tue, 10 May 2011 13:55:31 GMT'}]",2011-05-11,"[['keyvanpour', 'Mohammadreza', ''], ['Izadpanah', 'Najva', '']]","['Multimedia', 'Content-based retrieval', 'index structures']"
15173,1212.1143,Jake Bouvrie,Jake Bouvrie and Mauro Maggioni,"Multiscale Markov Decision Problems: Compression, Solution, and Transfer
  Learning","86 pages, 15 figures",,,,cs.AI cs.SY math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many problems in sequential decision making and stochastic control often have
natural multiscale structure: sub-tasks are assembled together to accomplish
complex goals. Systematically inferring and leveraging hierarchical structure,
particularly beyond a single level of abstraction, has remained a longstanding
challenge. We describe a fast multiscale procedure for repeatedly compressing,
or homogenizing, Markov decision processes (MDPs), wherein a hierarchy of
sub-problems at different scales is automatically determined. Coarsened MDPs
are themselves independent, deterministic MDPs, and may be solved using
existing algorithms. The multiscale representation delivered by this procedure
decouples sub-tasks from each other and can lead to substantial improvements in
convergence rates both locally within sub-problems and globally across
sub-problems, yielding significant computational savings. A second fundamental
aspect of this work is that these multiscale decompositions yield new transfer
opportunities across different problems, where solutions of sub-tasks at
different levels of the hierarchy may be amenable to transfer to new problems.
Localized transfer of policies and potential operators at arbitrary scales is
emphasized. Finally, we demonstrate compression and transfer in a collection of
illustrative domains, including examples involving discrete and continuous
statespaces.
","[{'version': 'v1', 'created': 'Wed, 5 Dec 2012 20:09:11 GMT'}]",2012-12-06,"[['Bouvrie', 'Jake', ''], ['Maggioni', 'Mauro', '']]","['Markov decision processes', 'hierarchical reinforcement learning', 'transfer', 'multiscale analysis']"
15174,1511.05618,Jingchu Liu,"Bingjie Leng, Jingchu Liu, Huimin Pan, Sheng Zhou, Zhisheng Niu","Topic Model Based Behaviour Modeling and Clustering Analysis for
  Wireless Network Users","6 pages, 6 figures. APCC'15",,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  User behaviour analysis based on traffic log in wireless networks can be
beneficial to many fields in real life: not only for commercial purposes, but
also for improving network service quality and social management. We cluster
users into groups marked by the most frequently visited websites to find their
preferences. In this paper, we propose a user behaviour model based on Topic
Model from document classification problems. We use the logarithmic TF-IDF
(term frequency - inverse document frequency) weighing to form a
high-dimensional sparse feature matrix. Then we apply LSA (Latent semantic
analysis) to deduce the latent topic distribution and generate a
low-dimensional dense feature matrix. K-means++, which is a classic clustering
algorithm, is then applied to the dense feature matrix and several
interpretable user clusters are found. Moreover, by combining the clustering
results with additional demographical information, including age, gender, and
financial information, we are able to uncover more realistic implications from
the clustering results.
","[{'version': 'v1', 'created': 'Tue, 17 Nov 2015 23:36:46 GMT'}]",2015-11-19,"[['Leng', 'Bingjie', ''], ['Liu', 'Jingchu', ''], ['Pan', 'Huimin', ''], ['Zhou', 'Sheng', ''], ['Niu', 'Zhisheng', '']]","['traffic log', 'user behaviour modeling', 'clusteringanalysis', 'topic model']"
15175,1407.7882,Moti Medina,"Guy Even, Moti Medina, and Dana Ron",Distributed Maximum Matching in Bounded Degree Graphs,arXiv admin note: substantial text overlap with arXiv:1402.3796,,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present deterministic distributed algorithms for computing approximate
maximum cardinality matchings and approximate maximum weight matchings. Our
algorithm for the unweighted case computes a matching whose size is at least
$(1-\eps)$ times the optimal in $\Delta^{O(1/\eps)} +
O\left(\frac{1}{\eps^2}\right) \cdot\log^*(n)$ rounds where $n$ is the number
of vertices in the graph and $\Delta$ is the maximum degree. Our algorithm for
the edge-weighted case computes a matching whose weight is at least $(1-\eps)$
times the optimal in
$\log(\min\{1/\wmin,n/\eps\})^{O(1/\eps)}\cdot(\Delta^{O(1/\eps)}+\log^*(n))$
rounds for edge-weights in $[\wmin,1]$.
  The best previous algorithms for both the unweighted case and the weighted
case are by Lotker, Patt-Shamir, and Pettie~(SPAA 2008). For the unweighted
case they give a randomized $(1-\eps)$-approximation algorithm that runs in
$O((\log(n)) /\eps^3)$ rounds. For the weighted case they give a randomized
$(1/2-\eps)$-approximation algorithm that runs in $O(\log(\eps^{-1}) \cdot
\log(n))$ rounds. Hence, our results improve on the previous ones when the
parameters $\Delta$, $\eps$ and $\wmin$ are constants (where we reduce the
number of runs from $O(\log(n))$ to $O(\log^*(n))$), and more generally when
$\Delta$, $1/\eps$ and $1/\wmin$ are sufficiently slowly increasing functions
of $n$. Moreover, our algorithms are deterministic rather than randomized.
","[{'version': 'v1', 'created': 'Tue, 29 Jul 2014 20:42:30 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Aug 2014 06:35:50 GMT'}, {'version': 'v3', 'created': 'Tue, 11 Nov 2014 20:57:53 GMT'}]",2014-11-12,"[['Even', 'Guy', ''], ['Medina', 'Moti', ''], ['Ron', 'Dana', '']]","['Centralized Local Algorithms', 'Distributed Local Algorithms', 'Maximum Matching', 'Maximum Weighted Matching', 'Graph Algorithms']"
15176,1603.05495,Matthew Noonan,"Matthew Noonan, Alexey Loginov, David Cok",Polymorphic Type Inference for Machine Code,"Full version with appendices, for PLDI 2016",,,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For many compiled languages, source-level types are erased very early in the
compilation process. As a result, further compiler passes may convert type-safe
source into type-unsafe machine code. Type-unsafe idioms in the original source
and type-unsafe optimizations mean that type information in a stripped binary
is essentially nonexistent. The problem of recovering high-level types by
performing type inference over stripped machine code is called type
reconstruction, and offers a useful capability in support of reverse
engineering and decompilation.
  In this paper, we motivate and develop a novel type system and algorithm for
machine-code type inference. The features of this type system were developed by
surveying a wide collection of common source- and machine-code idioms, building
a catalog of challenging cases for type reconstruction. We found that these
idioms place a sophisticated set of requirements on the type system, inducing
features such as recursively-constrained polymorphic types. Many of the
features we identify are often seen only in expressive and powerful type
systems used by high-level functional languages.
  Using these type-system features as a guideline, we have developed Retypd: a
novel static type-inference algorithm for machine code that supports recursive
types, polymorphism, and subtyping. Retypd yields more accurate inferred types
than existing algorithms, while also enabling new capabilities such as
reconstruction of pointer const annotations with 98% recall. Retypd can operate
on weaker program representations than the current state of the art, removing
the need for high-quality points-to information that may be impractical to
compute.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2016 14:09:14 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Mar 2016 20:09:56 GMT'}]",2016-03-22,"[['Noonan', 'Matthew', ''], ['Loginov', 'Alexey', ''], ['Cok', 'David', '']]","['Reverse Engineering', 'Type Systems', 'Polymorphism', 'Static Analysis', 'Binary Analysis', 'Pushdown Automata']"
15177,1802.08611,Sanjay Sahay,Ashu Sharma and Sanjay K. Sahay,An investigation of the classifiers to detect android malicious apps,"8 Pages, 8 Figures","Springer, Information and Communication Technology, 625, p. 207 -
  217, 2017",,,cs.CR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Android devices are growing exponentially and are connected through the
internet accessing billion of online websites. The popularity of these devices
encourages malware developer to penetrate the market with malicious apps to
annoy and disrupt the victim. Although, for the detection of malicious apps
different approaches are discussed. However, proposed approaches are not
suffice to detect the advanced malware to limit/prevent the damages. In this,
very few approaches are based on opcode occurrence to classify the malicious
apps. Therefore, this paper investigates the five classifiers using opcodes
occurrence as the prominent features for the detection of malicious apps. For
the analysis, we use WEKA tool and found that FT detection accuracy (79.27%) is
best among the investigated classifiers. However, true positives rate i.e.
malware detection rate is highest (99.91%) by RF and fluctuate least with the
different number of prominent features compared to other studied classifiers.
The analysis shows that overall accuracy is majorly affected by the false
positives of the classifier.
","[{'version': 'v1', 'created': 'Fri, 23 Feb 2018 15:45:35 GMT'}]",2018-09-18,"[['Sharma', 'Ashu', ''], ['Sahay', 'Sanjay K.', '']]","['Android security', 'Malware detection', 'Machine learning', 'Static analysis']"
15178,1512.02443,Mehrdad Ghadiri,"Saieed Akbari, Khashayar Etemadi, Peyman Ezzati, Mehrdad Ghadiri",Even and Odd Cycles Passing a Given Edge or a Vertex,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we provide some sufficient conditions for the existence of an
odd or even cycle that passing a given vertex or an edge in $2$-connected or
$2$-edge connected graphs. We provide some similar conditions for the existence
of an odd or even circuit that passing a given vertex or an edge in 2-edge
connected graphs. We show that if $G$ is a $2$-connected $k$-regular graph, $k
\geq 3$, then every edge of $G$ is contained in an even cycle. We also prove
that in a $2$-edge connected graph, if a vertex has odd degree, then there is
an even cycle containing this vertex.
","[{'version': 'v1', 'created': 'Tue, 8 Dec 2015 12:59:12 GMT'}]",2015-12-09,"[['Akbari', 'Saieed', ''], ['Etemadi', 'Khashayar', ''], ['Ezzati', 'Peyman', ''], ['Ghadiri', 'Mehrdad', '']]","['Even cycle', 'odd cycle', '2-connected graph', 'regular graph']"
15179,1205.2678,Manish Sharma Prof.,"Manish Sharma, Gurpadam Singh","Evaluation of Proactive, Reactive and Hybrid Ad hoc Routing Protocol for
  various Battery models in VANET using Qualnet","5 Pages, 5 Figures. arXiv admin note: substantial text overlap with
  arXiv:1202.1720","International Journal of Smart Sensors and Ad Hoc Networks
  (IJSSAN) ISSN No. 2248-9738 Vol.1(2) 2011",,,cs.PF cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In VANET high speed is the real characteristics which leads frequent
breakdown, interference etc. In this paper we studied various Ad hoc routing
protocols, Reactive, Proactive & Hybrid, taking into consideration various
VANET parameters like speed, altitude etc in real traffic scenario and
evaluated them for various battery models for energy conservation.. The AODV
and DYMO (Reactive), OLSR (Proactive) and ZRP (hybrid) protocols are compared
for battery models Duracell AA(MX- 1500),Duracell AAA(MN-2400),Duracell
AAA(MX-2400), Duracell C-MN(MN-1400),Panasonic AA standard using Qualnet as a
Simulation tool. Since Energy conservation is main focus area nowadays. Hence
performance of the protocols with various battery models counts and helps to
make a right selection. Varying parameters of VANET shows that in the real
traffic scenarios proactive protocol performs more efficiently for energy
conservation.
","[{'version': 'v1', 'created': 'Wed, 8 Feb 2012 15:00:32 GMT'}]",2012-05-14,"[['Sharma', 'Manish', ''], ['Singh', 'Gurpadam', '']]","['VANET', 'Ad hoc Routing', 'battery models', 'Qualnet']"
15180,0801.4790,Joel Ratsaby,Joel Ratsaby,Information Width,Typo error in eq. (13),,,,cs.DM cs.IT cs.LG math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Kolmogorov argued that the concept of information exists also in problems
with no underlying stochastic model (as Shannon's information representation)
for instance, the information contained in an algorithm or in the genome. He
introduced a combinatorial notion of entropy and information $I(x:\sy)$
conveyed by a binary string $x$ about the unknown value of a variable $\sy$.
The current paper poses the following questions: what is the relationship
between the information conveyed by $x$ about $\sy$ to the description
complexity of $x$ ? is there a notion of cost of information ? are there limits
on how efficient $x$ conveys information ?
  To answer these questions Kolmogorov's definition is extended and a new
concept termed {\em information width} which is similar to $n$-widths in
approximation theory is introduced. Information of any input source, e.g.,
sample-based, general side-information or a hybrid of both can be evaluated by
a single common formula. An application to the space of binary functions is
considered.
","[{'version': 'v1', 'created': 'Wed, 30 Jan 2008 22:49:57 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Jul 2008 09:46:33 GMT'}]",2008-07-01,"[['Ratsaby', 'Joel', '']]","['Binary functions', 'Combinatorics', 'n-widths', 'VC-dimension']"
15181,1605.00241,Basem Elbarashy,Basem G. El-Barashy,"Common-Description Learning: A Framework for Learning Algorithms and
  Generating Subproblems from Few Examples","32 pages, 13 figures",,,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current learning algorithms face many difficulties in learning simple
patterns and using them to learn more complex ones. They also require more
examples than humans do to learn the same pattern, assuming no prior knowledge.
In this paper, a new learning framework is introduced that is called
common-description learning (CDL). This framework has been tested on 32 small
multi-task datasets, and the results show that it was able to learn complex
algorithms from a few number of examples. The final model is perfectly
interpretable and its depth depends on the question. What is meant by depth
here is that whenever needed, the model learns to break down the problem into
simpler subproblems and solves them using previously learned models. Finally,
we explain the capabilities of our framework in discovering complex relations
in data and how it can help in improving language understanding in machines.
","[{'version': 'v1', 'created': 'Sun, 1 May 2016 11:56:01 GMT'}]",2016-05-03,"[['El-Barashy', 'Basem G.', '']]","['question answering', 'small datasets', 'interpretable learning model', 'deep learning model', 'memory-based model']"
15182,1501.04675,Zhi Liu,"Zhi Liu, Yan Huang",Community Detection from Location-Tagged Networks,,,,,cs.SI physics.soc-ph,http://creativecommons.org/licenses/publicdomain/,"  Many real world systems or web services can be represented as a network such
as social networks and transportation networks. In the past decade, many
algorithms have been developed to detect the communities in a network using
connections between nodes. However in many real world networks, the locations
of nodes have great influence on the community structure. For example, in a
social network, more connections are established between geographically
proximate users. The impact of locations on community has not been fully
investigated by the research literature. In this paper, we propose a community
detection method which takes locations of nodes into consideration. The goal is
to detect communities with both geographic proximity and network closeness. We
analyze the distribution of the distances between connected and unconnected
nodes to measure the influence of location on the network structure on two real
location-tagged social networks. We propose a method to determine if a
location-based community detection method is suitable for a given network. We
propose a new community detection algorithm that pushes the location
information into the community detection. We test our proposed method on both
synthetic data and real world network datasets. The results show that the
communities detected by our method distribute in a smaller area compared with
the traditional methods and have the similar or higher tightness on network
connections.
","[{'version': 'v1', 'created': 'Mon, 19 Jan 2015 23:37:40 GMT'}]",2015-01-21,"[['Liu', 'Zhi', ''], ['Huang', 'Yan', '']]","['Community Detection', 'Geo-tagged Network', 'Connection Locality']"
15183,1212.6933,Habib Moukalled,H. J. Moukalled,"On Automation and Medical Image Interpretation, With Applications for
  Laryngeal Imaging","18 pages, 9 figures, 41 references",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Indeed, these are exciting times. We are in the heart of a digital
renaissance. Automation and computer technology allow engineers and scientists
to fabricate processes that amalgamate quality of life. We anticipate much
growth in medical image interpretation and understanding, due to the influx of
computer technologies. This work should serve as a guide to introduce the
reader to core themes in theoretical computer science, as well as imaging
applications for understanding vocal-fold vibrations. In this work, we motivate
the use of automation, review some mathematical models of computation. We
present a proof of a classical problem in image analysis that cannot be
automated by means of algorithms. Furthermore, discuss some applications for
processing medical images of the vocal folds, and discuss some of the
exhilarating directions the art of automation will take vocal-fold image
interpretation and quite possibly other areas of biomedical image analysis.
","[{'version': 'v1', 'created': 'Mon, 31 Dec 2012 17:38:02 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Jan 2013 19:27:01 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Jan 2013 23:25:20 GMT'}]",2013-01-16,"[['Moukalled', 'H. J.', '']]","['Computability', 'laryngeal imaging', 'medical image interpretation', 'pattern simulation', 'snakes']"
15184,1312.2327,Meiappane  Aroumougame,"A. Meiappane, J. Prabavadhi and V. Prasanna Venkatesan",Strategy pattern: payment pattern for Internet banking,6 pages,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper brings out the design patterns according to the various services
involved in internet banking. The Pattern oriented Software Architecture uses
the pattern which eliminates the difficulty of reusability in a particular
context. The patterns are to be designed using BPM (Business Process Model) for
effective cross cutting on process level. For implementing the above said BPM,
the Internet banking has been taken to implement the pattern into it. The
Analysis and identification of various processes in Internet Banking have been
done, to identify the effective cross cutting features. With this process the
pattern has been designed, as a reusability component to be used by the
Software Architect. The pattern help us to resolve recurring problems
constructively and based on proven solutions and also support us in
understanding the architecture of a given software system. Once the model is
finalized by analyzing, we found payment in the process of internet banking has
a strategy pattern.
","[{'version': 'v1', 'created': 'Mon, 9 Dec 2013 07:26:15 GMT'}]",2013-12-10,"[['Meiappane', 'A.', ''], ['Prabavadhi', 'J.', ''], ['Venkatesan', 'V. Prasanna', '']]","['Pattern', 'Pattern Oriented Software Architecture', 'Business Process Modeling']"
15185,1407.1270,Albert Heinle,Reinhold Burger and Albert Heinle,"A New Primitive for a Diffie-Hellman-like Key Exchange Protocol Based on
  Multivariate Ore Polynomials",,,,,cs.CR cs.SC math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a new primitive for a key exchange protocol based on
multivariate non-commutative polynomial rings, analogous to the classic
Diffie-Hellman method. Our technique extends the proposed scheme of Boucher et
al. from 2010. Their method was broken by Dubois and Kammerer in 2011, who
exploited the Euclidean domain structure of the chosen ring. However, our
proposal is immune against such attacks, without losing the advantages of
non-commutative polynomial rings as outlined by Boucher et al. Moreover, our
extension is not restricted to any particular ring, but is designed to allow
users to readily choose from a large class of rings when applying the protocol.
Our primitive can also be applied to other cryptographic paradigms. In
particular, we develop a three-pass protocol, a public key cryptosystem, a
digital signature scheme and a zero-knowledge proof protocol.
","[{'version': 'v1', 'created': 'Fri, 4 Jul 2014 16:15:50 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Oct 2014 15:00:17 GMT'}, {'version': 'v3', 'created': 'Wed, 5 Nov 2014 14:14:21 GMT'}, {'version': 'v4', 'created': 'Tue, 19 May 2015 18:32:37 GMT'}]",2015-05-20,"[['Burger', 'Reinhold', ''], ['Heinle', 'Albert', '']]","['Cryptography', 'non-commutative', 'multivariate polynomial rings', 'skew-polynomials', 'Orealgebra']"
15186,1409.4080,Henrik Singmann,"Nicolas Gauvrit, Henrik Singmann, Fernando Soler-Toscano, Hector Zenil","Algorithmic complexity for psychology: A user-friendly implementation of
  the coding theorem method","to appear in ""Behavioral Research Methods"", 14 pages in journal
  format, R package at http://cran.r-project.org/web/packages/acss/index.html",,,,cs.CC stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Kolmogorov-Chaitin complexity has long been believed to be impossible to
approximate when it comes to short sequences (e.g. of length 5-50). However,
with the newly developed \emph{coding theorem method} the complexity of strings
of length 2-11 can now be numerically estimated. We present the theoretical
basis of algorithmic complexity for short strings (ACSS) and describe an
R-package providing functions based on ACSS that will cover psychologists'
needs and improve upon previous methods in three ways: (1) ACSS is now
available not only for binary strings, but for strings based on up to 9
different symbols, (2) ACSS no longer requires time-consuming computing, and
(3) a new approach based on ACSS gives access to an estimation of the
complexity of strings of any length. Finally, three illustrative examples show
how these tools can be applied to psychology.
","[{'version': 'v1', 'created': 'Sun, 14 Sep 2014 17:31:40 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Feb 2015 22:22:13 GMT'}]",2015-02-23,"[['Gauvrit', 'Nicolas', ''], ['Singmann', 'Henrik', ''], ['Soler-Toscano', 'Fernando', ''], ['Zenil', 'Hector', '']]","['algorithmic complexity', 'randomness', 'subjective probability', 'coding theoremmethod']"
15187,1606.06865,Rafal Kapelko,Rafa{\l} Kapelko,On the Moment Distance Between Sensors and Anchor Points,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The present paper contains additional asymptotic result over an earlier
investigation of Kapelko and Kranakis.
  Consider $n$ mobile sensors placed independently at random with the uniform
distribution on the unit interval $[0,1]$. Fix $a$ an odd natural number. Let
$X_i$ be the the $i-$th closest sensor to $0$ on the interval $[0,1].$ Then the
following identity holds
$$\sum_{i=1}^n\mathbf{E}\left[\left|X_i-\left(\frac{i}{n}-\frac{1}{2n}\right)\right|^a\right]=\frac{\Gamma\left(\frac{a}{2}+1\right)}{2^{\frac{a}{2}}(1+a)}\frac{1}{n^{\frac{a}{2}-1}}+O\left(\frac{1}{n^{\frac{a-1}{2}}}\right),$$
when $a$ is an odd natural number, where $\Gamma(z)$ is the Gamma function.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2016 09:33:52 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Oct 2016 10:08:26 GMT'}, {'version': 'v3', 'created': 'Sun, 22 Apr 2018 15:19:55 GMT'}]",2018-04-24,"[['Kapelko', 'Rafał', '']]","['analysis of algorithms', 'displacement', 'distance', 'random']"
15188,1212.3922,Harry Boyer,"H. Boyer (PIMENT), M. Bojic, H. Ennamiri, D. Calogine (PIMENT), S.
  Guichard (PIMENT)","Interroom radiative couplings through windows and large openings in
  buildings: Proposal of a simplified model",,"JP Journal of Heat and Mass Transfer 6, 2 (2012) 191-211",,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A simplified model of indoor short wave radiation couplings adapted to
multi-zone simulations is proposed, thanks to a simplifying hypothesis and to
the introduction of an indoor short wave exchange matrix. The specific
properties of this matrix appear useful to quantify the thermal radiation
exchanges between the zones separated by windows or large openings. Integrated
in CODYRUN software, this module is detailed and compared to experimental
measurements carried out on a real scale tropical building.
","[{'version': 'v1', 'created': 'Mon, 17 Dec 2012 08:17:14 GMT'}]",2012-12-26,"[['Boyer', 'H.', '', 'PIMENT'], ['Bojic', 'M.', '', 'PIMENT'], ['Ennamiri', 'H.', '', 'PIMENT'], ['Calogine', 'D.', '', 'PIMENT'], ['Guichard', 'S.', '', 'PIMENT']]","['Short wave radiation exchanges', 'building simulation', 'Multizone']"
15189,1605.01600,Fabien Ringeval,"Michel Valstar, Jonathan Gratch, Bjorn Schuller, Fabien Ringeval,
  Denis Lalanne, Mercedes Torres Torres, Stefan Scherer, Guiota Stratou, Roddy
  Cowie and Maja Pantic","AVEC 2016 - Depression, Mood, and Emotion Recognition Workshop and
  Challenge","Proceedings of the 6th International Workshop on Audio/Visual Emotion
  Challenge, AVEC'16, co-located with the 24th ACM International Conference on
  Multimedia, MM 2016, pages 3-10, Amsterdam, The Netherlands, October 2016.
  ACM",,,,cs.CV cs.HC cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Audio/Visual Emotion Challenge and Workshop (AVEC 2016) ""Depression, Mood
and Emotion"" will be the sixth competition event aimed at comparison of
multimedia processing and machine learning methods for automatic audio, visual
and physiological depression and emotion analysis, with all participants
competing under strictly the same conditions. The goal of the Challenge is to
provide a common benchmark test set for multi-modal information processing and
to bring together the depression and emotion recognition communities, as well
as the audio, video and physiological processing communities, to compare the
relative merits of the various approaches to depression and emotion recognition
under well-defined and strictly comparable conditions and establish to what
extent fusion of the approaches is possible and beneficial. This paper presents
the challenge guidelines, the common data used, and the performance of the
baseline system on the two tasks.
","[{'version': 'v1', 'created': 'Thu, 5 May 2016 14:04:50 GMT'}, {'version': 'v2', 'created': 'Fri, 6 May 2016 12:34:51 GMT'}, {'version': 'v3', 'created': 'Fri, 27 May 2016 08:02:32 GMT'}, {'version': 'v4', 'created': 'Tue, 22 Nov 2016 15:19:24 GMT'}]",2016-11-23,"[['Valstar', 'Michel', ''], ['Gratch', 'Jonathan', ''], ['Schuller', 'Bjorn', ''], ['Ringeval', 'Fabien', ''], ['Lalanne', 'Denis', ''], ['Torres', 'Mercedes Torres', ''], ['Scherer', 'Stefan', ''], ['Stratou', 'Guiota', ''], ['Cowie', 'Roddy', ''], ['Pantic', 'Maja', '']]","['Affective Computing', 'Emotion Recognition', 'Speech', 'FacialExpression', 'Physiological signals', 'Challenge']"
15190,0712.3335,Abraham Punnen,"Qiaoming Han, Abraham P. Punnen, and Yinyu Ye","A polynomial time $\frac 3 2$ -approximation algorithm for the vertex
  cover problem on a class of graphs",,,,,cs.DS cs.DM,,"  We develop a polynomial time 3/2-approximation algorithm to solve the vertex
cover problem on a class of graphs satisfying a property called ``active edge
hypothesis''. The algorithm also guarantees an optimal solution on specially
structured graphs. Further, we give an extended algorithm which guarantees a
vertex cover $S_1$ on an arbitrary graph such that $|S_1|\leq {3/2} |S^*|+\xi$
where $S^*$ is an optimal vertex cover and $\xi$ is an error bound identified
by the algorithm. We obtained $\xi = 0$ for all the test problems we have
considered which include specially constructed instances that were expected to
be hard. So far we could not construct a graph that gives $\xi \not= 0$.
","[{'version': 'v1', 'created': 'Thu, 20 Dec 2007 06:53:30 GMT'}]",2007-12-21,"[['Han', 'Qiaoming', ''], ['Punnen', 'Abraham P.', ''], ['Ye', 'Yinyu', '']]","['vertex cover problem', 'approximation algorithm', 'LP-relaxation', 'odd-cycle', 'NP-complete problems']"
15191,1305.0190,Chantal Cherifi,"Chantal Cherifi, Jean-Fran\c{c}ois Santucci",Analyzing Web Services Networks: a WS-NEXT Application,,"Cherifi, C., Santucci, J.F.: Analyzing Web services Networks : A
  WS-NEXT Application. In Advances in Information Technology from AI to Virtual
  Reality, Ubiquitous Computing and Communication Journal (UBICC), pp. 60-77,
  (2011)",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web services represent a system with a huge number of units and many various
and complex interactions. Complex networks as a tool for modelling and
analyzing natural environments seem to be well adapted to such a complex
system. To describe a set of Web services we propose three Web services network
models based on the notions of dependency, interaction and similarity. Using
the WS-NEXT extractor we instantiate the models with a collection of Web
services descriptions. We take advantage of complex network properties to
provide an analyzis of the Web services networks. Those networks and the
knowledge of their toplogical properties can be exploited for the discovery and
composition processes.
","[{'version': 'v1', 'created': 'Wed, 1 May 2013 14:51:46 GMT'}]",2013-05-02,"[['Cherifi', 'Chantal', ''], ['Santucci', 'Jean-François', '']]","['Web services', 'composition', 'classification', 'complex network analysis']"
15192,1710.03289,Rosana Veroneze,Rosana Veroneze and Fernando J. Von Zuben,Efficient mining of maximal biclusters in mixed-attribute datasets,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel enumerative biclustering algorithm to directly
mine all maximal biclusters in mixed-attribute datasets (containing both
numerical and categorical attributes), with or without missing values. The
proposal is an extension of RIn-Close_CVC, which was originally conceived to
mine perfect or perturbed biclusters with constant values on columns solely
from numerical datasets, and without missing values. Even endowed with
additional and more general features, the extended RIn-Close_CVC retains four
key properties: (1) efficiency, (2) completeness, (3) correctness, and (4)
non-redundancy. Our proposal is the first one to deal with mixed-attribute
datasets without requiring any pre-processing step, such as discretization and
itemization of real-valued attributes. This is a decisive aspect, because
discretization and itemization implies a priori decisions, with information
loss and no clear control over the consequences. On the other hand, even having
to specify a priori an individual threshold for each numerical attribute, that
will be used to indicate internal consistency per attribute, each threshold
will be applied during the construction of the biclusters, shaping the
peculiarities of the data distribution. We also explore the strong connection
between biclustering and frequent pattern mining to (1) provide filters to
select a compact bicluster set that exhibits high relevance and low redundancy,
and (2) in the case of labeled datasets, automatically present the biclusters
in a user-friendly and intuitive form, by means of quantitative class
association rules. Our experimental results showed that the biclusters yield a
parsimonious set of relevant rules, providing useful and interpretable models
for five mixed-attribute labeled datasets.
","[{'version': 'v1', 'created': 'Mon, 9 Oct 2017 19:59:19 GMT'}]",2017-10-11,"[['Veroneze', 'Rosana', ''], ['Von Zuben', 'Fernando J.', '']]","['bicluster mining', 'efficient enumeration', 'mixed-attribute datasets', 'quantitative class']"
15193,0909.1626,Massimiliano Sala Dr.,"Eleonora Guerrini, Emmanuela Orsini, Massimiliano Sala",Computing the distance distribution of systematic non-linear codes,,"Journal of Algebra and its Applications, 2010, vol. 9, p. 241-256",,,cs.DM cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The most important families of non-linear codes are systematic. A brute-force
check is the only known method to compute their weight distribution and
distance distribution. On the other hand, it outputs also all closest word
pairs in the code. In the black-box complexity model, the check is optimal
among closest-pair algorithms. In this paper we provide a Groebner basis
technique to compute the weight/distance distribution of any systematic
non-linear code. Also our technique outputs all closest pairs. Unlike the
check, our method can be extended to work on code families.
","[{'version': 'v1', 'created': 'Wed, 9 Sep 2009 05:47:23 GMT'}]",2016-04-01,"[['Guerrini', 'Eleonora', ''], ['Orsini', 'Emmanuela', ''], ['Sala', 'Massimiliano', '']]","['Gr¨obner basis', 'distance distribution', 'Hamming distance', 'non-linearcode']"
15194,1510.05041,Linnan Wang,"Linnan Wang, Wei Wu, Jianxiong Xiao, Yi Yang","BLASX: A High Performance Level-3 BLAS Library for Heterogeneous
  Multi-GPU Computing",under review for IPDPS 2016,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Basic Linear Algebra Subprograms (BLAS) are a set of low level linear algebra
kernels widely adopted by applications involved with the deep learning and
scientific computing. The massive and economic computing power brought forth by
the emerging GPU architectures drives interest in implementation of
compute-intensive level 3 BLAS on multi-GPU systems. In this paper, we
investigate existing multi-GPU level 3 BLAS and present that 1) issues, such as
the improper load balancing, inefficient communication, insufficient GPU stream
level concurrency and data caching, impede current implementations from fully
harnessing heterogeneous computing resources; 2) and the inter-GPU
Peer-to-Peer(P2P) communication remains unexplored. We then present BLASX: a
highly optimized multi-GPU level-3 BLAS. We adopt the concepts of
algorithms-by-tiles treating a matrix tile as the basic data unit and
operations on tiles as the basic task. Tasks are guided with a dynamic
asynchronous runtime, which is cache and locality aware. The communication cost
under BLASX becomes trivial as it perfectly overlaps communication and
computation across multiple streams during asynchronous task progression. It
also takes the current tile cache scheme one step further by proposing an
innovative 2-level hierarchical tile cache, taking advantage of inter-GPU P2P
communication. As a result, linear speedup is observable with BLASX under
multi-GPU configurations; and the extensive benchmarks demonstrate that BLASX
consistently outperforms the related leading industrial and academic projects
such as cuBLAS-XT, SuperMatrix, MAGMA and PaRSEC.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2015 22:34:24 GMT'}]",2015-10-20,"[['Wang', 'Linnan', ''], ['Wu', 'Wei', ''], ['Xiao', 'Jianxiong', ''], ['Yang', 'Yi', '']]","['BLAS', 'scheduling runtime', 'tile algorithms', 'multiGPUs', 'hierarchical tile caches']"
15195,1409.8572,Djallel Bouneffouf,Djallel Bouneffouf,Freshness-Aware Thompson Sampling,"21st International Conference on Neural Information Processing. arXiv
  admin note: text overlap with arXiv:1409.7729",,,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To follow the dynamicity of the user's content, researchers have recently
started to model interactions between users and the Context-Aware Recommender
Systems (CARS) as a bandit problem where the system needs to deal with
exploration and exploitation dilemma. In this sense, we propose to study the
freshness of the user's content in CARS through the bandit problem. We
introduce in this paper an algorithm named Freshness-Aware Thompson Sampling
(FA-TS) that manages the recommendation of fresh document according to the
user's risk of the situation. The intensive evaluation and the detailed
analysis of the experimental results reveals several important discoveries in
the exploration/exploitation (exr/exp) behaviour.
","[{'version': 'v1', 'created': 'Mon, 29 Sep 2014 17:17:52 GMT'}]",2014-10-01,"[['Bouneffouf', 'Djallel', '']]","['CARS', 'Thompson Sampling', 'Contextual bandits']"
15196,0806.0860,Amit K Awasthi,Amit K Awasthi,On the Security of Liaw et al.'s Scheme,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, Liaw et al. proposed a remote user authentication scheme using
smartcards. They claimed a number of features of their scheme, e.g. a
dictionary of verification tables is not required to authenticate users; users
can choose their password freely; mutual authentication is provided between the
user and the remote system; the communication cost and the computational cost
are very low; users can update their password after the registration phase; a
session key agreed by the user and the remote system is generated in every
session; and the nonce-based scheme which does not require a timestamp (to
solve the serious time synchronization problem) etc.
  In this paper We show that Liaw et al.'s scheme does not stand with various
security requirements and is completely insecure.
  Keywords: Authentication, Smartcards, Remote system, Attack.
","[{'version': 'v1', 'created': 'Wed, 4 Jun 2008 20:44:33 GMT'}]",2008-06-06,"[['Awasthi', 'Amit K', '']]","['Authentication', 'Smartcards', 'Remote system', 'Attack']"
15197,1410.4488,Matthieu Picantin,Thibault Godin and Ines Klimann and Matthieu Picantin,"On Torsion-Free Semigroups Generated by Invertible Reversible Mealy
  Automata","12 pages, 4 figures, LATA'15 : 9th International Conference on
  Language and Automata Theory and Applications",,,,cs.FL math.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the torsion problem for a class of automaton semigroups,
defined as semigroups of transformations induced by Mealy automata, aka
letter-by-letter transducers with the same input and output alphabet. The
torsion problem is undecidable for automaton semigroups in general, but is
known to be solvable within the well-studied class of (semi)groups generated by
invertible bounded Mealy automata. We focus on the somehow antipodal class of
invertible reversible Mealy automata and prove that for a wide subclass the
generated semigroup is torsion-free.
","[{'version': 'v1', 'created': 'Thu, 16 Oct 2014 16:30:33 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Dec 2014 21:15:07 GMT'}]",2014-12-04,"[['Godin', 'Thibault', ''], ['Klimann', 'Ines', ''], ['Picantin', 'Matthieu', '']]","['automaton semigroup', 'reversible Mealy automaton', 'labeledorbit tree', 'torsion-free semigroup']"
15198,1410.3899,Liang Zhang,"Shaolun Xu, Liang Zhang, Zheng Yan, Donghan Feng, Gang Wang and Xiaobo
  Zhao","Optimal Scheduling of Electric Vehicles Charging in low-Voltage
  Distribution Systems","Preparation of Final Manuscripts Accepted for Journal of Electrical
  Engineering & Technology",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Uncoordinated charging of large-scale electric vehicles (EVs) will have a
negative impact on the secure and economic operation of the power system,
especially at the distribution level. Given that the charging load of EVs can
be controlled to some extent, research on the optimal charging control of EVs
has been extensively carried out. In this paper, two possible smart charging
scenarios in China are studied: centralized optimal charging operated by an
aggregator and decentralized optimal charging managed by individual users.
Under the assumption that the aggregators and individual users only concern the
economic benefits, new load peaks will arise under time of use (TOU) pricing
which is extensively employed in China. To solve this problem, a simple
incentive mechanism is proposed for centralized optimal charging while a
rolling-update pricing scheme is devised for decentralized optimal charging.
The original optimal charging models are modified to account for the developed
schemes. Simulated tests corroborate the efficacy of optimal scheduling for
charging EVs in various scenarios.
","[{'version': 'v1', 'created': 'Wed, 15 Oct 2014 00:20:10 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Jul 2015 15:04:49 GMT'}, {'version': 'v3', 'created': 'Tue, 19 Jan 2016 16:38:49 GMT'}]",2016-01-20,"[['Xu', 'Shaolun', ''], ['Zhang', 'Liang', ''], ['Yan', 'Zheng', ''], ['Feng', 'Donghan', ''], ['Wang', 'Gang', ''], ['Zhao', 'Xiaobo', '']]","['Centralized optimal charging', 'decentralized optimal charging', 'electric vehicles', 'incentive', 'rolling-update price']"
15199,1304.1760,Dohy Hong,Dohy Hong,"Note: interpreting iterative methods convergence with diffusion point of
  view",4 pages,,,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we explain the convergence speed of different iteration
schemes with the fluid diffusion view when solving a linear fixed point
problem. This interpretation allows one to better understand why power
iteration or Jacobi iteration may converge faster or slower than Gauss-Seidel
iteration.
","[{'version': 'v1', 'created': 'Fri, 5 Apr 2013 16:52:21 GMT'}]",2013-04-08,"[['Hong', 'Dohy', '']]","['Iteration', 'Fixed point', 'Convergence', 'Diffusion approach']"
15200,1010.5954,Szymon Chojnacki Mr,Szymon Chojnacki and Mieczys{\l}aw K{\l}opotek,Random Graphs for Performance Evaluation of Recommender Systems,,,,,cs.AI cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this article is to introduce a new analytical framework
dedicated to measuring performance of recommender systems. The standard
approach is to assess the quality of a system by means of accuracy related
statistics. However, the specificity of the environments in which recommender
systems are deployed requires to pay much attention to speed and memory
requirements of the algorithms. Unfortunately, it is implausible to assess
accurately the complexity of various algorithms with formal tools. This can be
attributed to the fact that such analyses are usually based on an assumption of
dense representation of underlying data structures. Whereas, in real life the
algorithms operate on sparse data and are implemented with collections
dedicated for them. Therefore, we propose to measure the complexity of
recommender systems with artificial datasets that posses real-life properties.
We utilize recently developed bipartite graph generator to evaluate how
state-of-the-art recommender systems' behavior is determined and diversified by
topological properties of the generated datasets.
","[{'version': 'v1', 'created': 'Thu, 28 Oct 2010 13:10:03 GMT'}]",2010-10-29,"[['Chojnacki', 'Szymon', ''], ['Kłopotek', 'Mieczysław', '']]","['recommender systems', 'performance evaluation', 'random graphs', 'bipartite complex networks']"
15201,1412.6061,Gundram Leifert,"Gundram Leifert, Roger Labahn, Tobias Strau{\ss} (University of
  Rostock - CITlab)",CITlab ARGUS for Arabic Handwriting,http://www.nist.gov/itl/iad/mig/upload/OpenHaRT2013_SysDesc_CITLAB.pdf,,,,cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the recent years it turned out that multidimensional recurrent neural
networks (MDRNN) perform very well for offline handwriting recognition tasks
like the OpenHaRT 2013 evaluation DIR. With suitable writing preprocessing and
dictionary lookup, our ARGUS software completed this task with an error rate of
26.27% in its primary setup.
","[{'version': 'v1', 'created': 'Mon, 15 Dec 2014 06:55:28 GMT'}]",2014-12-19,"[['Leifert', 'Gundram', '', 'University of\n  Rostock - CITlab'], ['Labahn', 'Roger', '', 'University of\n  Rostock - CITlab'], ['Strauß', 'Tobias', '', 'University of\n  Rostock - CITlab']]","['handwriting recognition', 'neural network', 'LSTM']"
15202,1511.04534,Zhenhua Wang,"Zhenhua Wang, Xingxing Wang, Gang Wang","Learning Fine-grained Features via a CNN Tree for Large-scale
  Classification",Neurocomputing 2017,,,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We propose a novel approach to enhance the discriminability of Convolutional
Neural Networks (CNN). The key idea is to build a tree structure that could
progressively learn fine-grained features to distinguish a subset of classes,
by learning features only among these classes. Such features are expected to be
more discriminative, compared to features learned for all the classes. We
develop a new algorithm to effectively learn the tree structure from a large
number of classes. Experiments on large-scale image classification tasks
demonstrate that our method could boost the performance of a given basic CNN
model. Our method is quite general, hence it can potentially be used in
combination with many other deep learning models.
","[{'version': 'v1', 'created': 'Sat, 14 Nov 2015 09:19:44 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Sep 2017 07:59:12 GMT'}]",2017-09-25,"[['Wang', 'Zhenhua', ''], ['Wang', 'Xingxing', ''], ['Wang', 'Gang', '']]","['image classification', 'deep learning', 'feature learning', 'tree model']"
15203,1701.07974,Haiping Huang,Haiping Huang and Taro Toyoizumi,Reinforced stochastic gradient descent for deep neural network learning,"12 pages and 9 figures, nearly final version as a technical report",,,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stochastic gradient descent (SGD) is a standard optimization method to
minimize a training error with respect to network parameters in modern neural
network learning. However, it typically suffers from proliferation of saddle
points in the high-dimensional parameter space. Therefore, it is highly
desirable to design an efficient algorithm to escape from these saddle points
and reach a parameter region of better generalization capabilities. Here, we
propose a simple extension of SGD, namely reinforced SGD, which simply adds
previous first-order gradients in a stochastic manner with a probability that
increases with learning time. As verified in a simple synthetic dataset, this
method significantly accelerates learning compared with the original SGD.
Surprisingly, it dramatically reduces over-fitting effects, even compared with
state-of-the-art adaptive learning algorithm---Adam. For a benchmark
handwritten digits dataset, the learning performance is comparable to Adam, yet
with an extra advantage of requiring one-fold less computer memory. The
reinforced SGD is also compared with SGD with fixed or adaptive momentum
parameter and Nesterov's momentum, which shows that the proposed framework is
able to reach a similar generalization accuracy with less computational costs.
Overall, our method introduces stochastic memory into gradients, which plays an
important role in understanding how gradient-based training algorithms can work
and its relationship with generalization abilities of deep networks.
","[{'version': 'v1', 'created': 'Fri, 27 Jan 2017 08:49:19 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Mar 2017 05:34:08 GMT'}, {'version': 'v3', 'created': 'Wed, 24 May 2017 09:30:54 GMT'}, {'version': 'v4', 'created': 'Tue, 19 Sep 2017 02:57:24 GMT'}, {'version': 'v5', 'created': 'Wed, 22 Nov 2017 08:27:39 GMT'}]",2017-11-23,"[['Huang', 'Haiping', ''], ['Toyoizumi', 'Taro', '']]","['Neuronal networks', 'Machine learning', 'Backpropagation']"
15204,1510.08551,Zhenbo Wang,"Kameng Nip, Zhenbo Wang and Zizhuo Wang",Scheduling under Linear Constraints,21 pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a parallel machine scheduling problem in which the processing
times of jobs are not given in advance but are determined by a system of linear
constraints. The objective is to minimize the makespan, i.e., the maximum job
completion time among all feasible choices. This novel problem is motivated by
various real-world application scenarios. We discuss the computational
complexity and algorithms for various settings of this problem. In particular,
we show that if there is only one machine with an arbitrary number of linear
constraints, or there is an arbitrary number of machines with no more than two
linear constraints, or both the number of machines and the number of linear
constraints are fixed constants, then the problem is polynomial-time solvable
via solving a series of linear programming problems. If both the number of
machines and the number of constraints are inputs of the problem instance, then
the problem is NP-Hard. We further propose several approximation algorithms for
the latter case.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2015 02:48:28 GMT'}]",2015-10-30,"[['Nip', 'Kameng', ''], ['Wang', 'Zhenbo', ''], ['Wang', 'Zizhuo', '']]","['parallel machine scheduling', 'linear programming', 'computationalcomplexity', 'approximation algorithm']"
15205,1406.4756,Sanjay Chakraborty,"Sanjay Chakraborty, N.K.Nagwani and Lopamudra Dey",Weather Forecasting using Incremental K-means Clustering,,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering is a powerful tool which has been used in several forecasting
works, such as time series forecasting, real time storm detection, flood
forecasting and so on. In this paper, a generic methodology for weather
forecasting is proposed by the help of incremental K-means clustering
algorithm. Weather forecasting plays an important role in day to day
applications.Weather forecasting of this paper is done based on the incremental
air pollution database of west Bengal in the years of 2009 and 2010. This paper
generally uses typical K-means clustering on the main air pollution database
and a list of weather category will be developed based on the maximum mean
values of the clusters.Now when the new data are coming, the incremental
K-means is used to group those data into those clusters whose weather category
has been already defined. Thus it builds up a strategy to predict the weather
of the upcoming data of the upcoming days. This forecasting database is totally
based on the weather of west Bengal and this forecasting methodology is
developed to mitigating the impacts of air pollutions and launch focused
modeling computations for prediction and forecasts of weather events. Here
accuracy of this approach is also measured.
","[{'version': 'v1', 'created': 'Wed, 18 Jun 2014 15:08:54 GMT'}]",2014-06-19,"[['Chakraborty', 'Sanjay', ''], ['Nagwani', 'N. K.', ''], ['Dey', 'Lopamudra', '']]","['Clustering', 'Forecasting', 'Incremental', 'K-means']"
15206,1208.4773,Tobias Jung,"Tobias Jung, Louis Wehenkel, Damien Ernst, Francis Maes","Optimized Look-Ahead Tree Policies: A Bridge Between Look-Ahead Tree
  Policies and Direct Policy Search",In Submission,,,,cs.SY cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Direct policy search (DPS) and look-ahead tree (LT) policies are two widely
used classes of techniques to produce high performance policies for sequential
decision-making problems. To make DPS approaches work well, one crucial issue
is to select an appropriate space of parameterized policies with respect to the
targeted problem. A fundamental issue in LT approaches is that, to take good
decisions, such policies must develop very large look-ahead trees which may
require excessive online computational resources. In this paper, we propose a
new hybrid policy learning scheme that lies at the intersection of DPS and LT,
in which the policy is an algorithm that develops a small look-ahead tree in a
directed way, guided by a node scoring function that is learned through DPS.
The LT-based representation is shown to be a versatile way of representing
policies in a DPS scheme, while at the same time, DPS enables to significantly
reduce the size of the look-ahead trees that are required to take high-quality
decisions.
  We experimentally compare our method with two other state-of-the-art DPS
techniques and four common LT policies on four benchmark domains and show that
it combines the advantages of the two techniques from which it originates. In
particular, we show that our method: (1) produces overall better performing
policies than both pure DPS and pure LT policies, (2) requires a substantially
smaller number of policy evaluations than other DPS techniques, (3) is easy to
tune and (4) results in policies that are quite robust with respect to
perturbations of the initial conditions.
","[{'version': 'v1', 'created': 'Thu, 23 Aug 2012 14:48:52 GMT'}]",2015-03-20,"[['Jung', 'Tobias', ''], ['Wehenkel', 'Louis', ''], ['Ernst', 'Damien', ''], ['Maes', 'Francis', '']]","['Reinforcement learning', 'direct policy search', 'look-ahead tree search']"
15207,1111.0594,Andrey Nikolaev,Andrey Nikolaev,Exploring Oracle RDBMS latches using Solaris DTrace,"14 pages, 6 figures, 6 tables. MEDIAS 2011 Conference. Limassol,
  Cyprus",,,,cs.DB cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rise of hundreds cores technologies bring again to the first plan the problem
of interprocess synchronization in database engines. Spinlocks are widely used
in contemporary DBMS to synchronize processes at microsecond timescale. Latches
are Oracle RDBMS specific spinlocks. The latch contention is common to observe
in contemporary high concurrency OLTP environments.
  In contrast to system spinlocks used in operating systems kernels, latches
work in user context. Such user level spinlocks are influenced by context
preemption and multitasking. Until recently there were no direct methods to
measure effectiveness of user spinlocks. This became possible with the
emergence of Solaris 10 Dynamic Tracing framework. DTrace allows tracing and
profiling both OS and user applications.
  This work investigates the possibilities to diagnose and tune Oracle latches.
It explores the contemporary latch realization and spinning-blocking
strategies, analyses corresponding statistic counters.
  A mathematical model developed to estimate analytically the effect of tuning
_SPIN_COUNT value.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2011 18:20:36 GMT'}]",2011-11-03,"[['Nikolaev', 'Andrey', '']]","['Oracle', 'Spinlock', 'Latch', 'DTrace', 'SpinTime', 'Spin-Blocking']"
15208,1502.05883,Timo Mennle,"Timo Mennle, Sven Seuken",The Pareto Frontier for Random Mechanisms,Working Paper,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the trade-offs between strategyproofness and other desiderata, such
as efficiency or fairness, that often arise in the design of random ordinal
mechanisms. We use approximate strategyproofness to define manipulability, a
measure to quantify the incentive properties of non-strategyproof mechanisms,
and we introduce the deficit, a measure to quantify the performance of
mechanisms with respect to another desideratum. When this desideratum is
incompatible with strategyproofness, mechanisms that trade off manipulability
and deficit optimally form the Pareto frontier. Our main contribution is a
structural characterization of this Pareto frontier, and we present algorithms
that exploit this structure to compute it. To illustrate its shape, we apply
our results for two different desiderata, namely Plurality and Veto scoring, in
settings with 3 alternatives and up to 18 agents.
","[{'version': 'v1', 'created': 'Fri, 20 Feb 2015 14:30:37 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Mar 2015 16:17:43 GMT'}, {'version': 'v3', 'created': 'Tue, 10 Jan 2017 16:43:26 GMT'}]",2017-01-11,"[['Mennle', 'Timo', ''], ['Seuken', 'Sven', '']]","['Random Mechanisms', 'Pareto Frontier', 'Ordinal Mechanisms', 'Strategyproofness', 'Approximate Strategyproofness', 'Positional Scoring', 'Linear Programming']"
15209,1202.6575,"Jesper Larsson Tr\""aff","Jesper Larsson Tr\""aff","Simplified, stable parallel merging",,,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This note makes an observation that significantly simplifies a number of
previous parallel, two-way merge algorithms based on binary search and
sequential merge in parallel. First, it is shown that the additional merge step
of distinguished elements as found in previous algorithms is not necessary,
thus simplifying the implementation and reducing constant factors. Second, by
fixating the requirements to the binary search, the merge algorithm becomes
stable, provided that the sequential merge subroutine is stable. The stable,
parallel merge algorithm can easily be used to implement a stable, parallel
merge sort.
  For ordered sequences with $n$ and $m$ elements, $m\leq n$, the simplified
merge algorithm runs in $O(n/p+\log n)$ operations using $p$ processing
elements. It can be implemented on an EREW PRAM, but since it requires only a
single synchronization step, it is also a candidate for implementation on other
parallel, shared-memory computers.
","[{'version': 'v1', 'created': 'Wed, 29 Feb 2012 15:32:34 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Mar 2012 09:42:07 GMT'}, {'version': 'v3', 'created': 'Fri, 29 Jun 2012 12:17:38 GMT'}]",2012-07-02,"[['Träff', 'Jesper Larsson', '']]","['Parallel merging', 'Parallel algorithms', 'Implementation', 'Shared-memory computers', 'PRAM']"
15210,1605.02346,Georgia Gkioxari,"Georgia Gkioxari, Alexander Toshev, Navdeep Jaitly",Chained Predictions Using Convolutional Neural Networks,in submission to EECV 2016,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present an adaptation of the sequence-to-sequence model for
structured output prediction in vision tasks. In this model the output
variables for a given input are predicted sequentially using neural networks.
The prediction for each output variable depends not only on the input but also
on the previously predicted output variables. The model is applied to spatial
localization tasks and uses convolutional neural networks (CNNs) for processing
input images and a multi-scale deconvolutional architecture for making spatial
predictions at each time step. We explore the impact of weight sharing with a
recurrent connection matrix between consecutive predictions, and compare it to
a formulation where these weights are not tied. Untied weights are particularly
suited for problems with a fixed sized structure, where different classes of
output are predicted in different steps. We show that chained predictions
achieve top performing results on human pose estimation from single images and
videos.
","[{'version': 'v1', 'created': 'Sun, 8 May 2016 18:52:24 GMT'}, {'version': 'v2', 'created': 'Sun, 23 Oct 2016 17:08:29 GMT'}]",2016-10-25,"[['Gkioxari', 'Georgia', ''], ['Toshev', 'Alexander', ''], ['Jaitly', 'Navdeep', '']]","['Structured tasks', 'chain model', 'human pose estimation']"
15211,1606.06047,Harmeet Singh,Harmeet Singh,"Contravening Esotery: Cryptanalysis of Knapsack Cipher using Genetic
  Algorithms","http://www.ijcaonline.org/archives/volume140/number6/24599-2016909333, 2016",,,,cs.CR cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cryptanalysis of knapsack cipher is a fascinating problem which has eluded
the computing fraternity for decades. However, in most of the cases either the
time complexity of the proposed algorithm is colossal or an insufficient number
of samples have been taken for verification. The present work proposes a
Genetic Algorithm based technique for cryptanalysis of knapsack cipher. The
experiments conducted prove the validity of the technique. The results prove
that the technique is better than the existing techniques. An extensive review
has been carried out in order to find the gaps in the existing techniques. The
work paves the way of the application of computational intelligence techniques
to the discipline of cryptanalysis.
","[{'version': 'v1', 'created': 'Mon, 20 Jun 2016 10:04:05 GMT'}]",2016-06-21,"[['Singh', 'Harmeet', '']]","['Knapsack Cipher', 'Cryptanalysis', 'Genetic Algorithms', 'Fitness function']"
15212,1007.3640,Satish N. Srirama,"Satish Narayana Srirama and Matthias Jarke and Wolfgang Prinz and
  Kiran Pendyala",Security Aware Mobile Web Service Provisioning,"Proceedings of International Conference for Internet Technology and
  Secured Transactions (ICITST-2006), September 11-13, 2006, pp. 48-56.
  Published by e.Centre for Infonomics, ISBN 0-9546628-2-2",,,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile data services in combination with profluent web services are seemingly
the path breaking domain in current information research. Effectively, these
mobile web services will pave the way for exciting performance and security
challenges, the core need-to-be-addressed issues. On security front, though a
lot of standardized security specifications and implementations exist for web
services in the wired networks, not much has been analysed and standardized in
the wireless environments. This paper addresses some of the critical challenges
in providing security to the mobile web service domain. We first explore mobile
web services and their key security issues, with special focus on provisioning
based on a mobile web service provider realized by us. Later we discuss
state-of-the-art security awareness in the wired and wireless web services, and
finally address the realization of security for the mobile web service
provisioning with performance analysis results.
","[{'version': 'v1', 'created': 'Wed, 21 Jul 2010 12:56:58 GMT'}]",2010-07-22,"[['Srirama', 'Satish Narayana', ''], ['Jarke', 'Matthias', ''], ['Prinz', 'Wolfgang', ''], ['Pendyala', 'Kiran', '']]","['Web Services', 'Mobile Web Services', 'Security', 'WS-Security', 'Performance']"
15213,1203.1023,David Stoutemyer,David R. Stoutemyer,"Can the Eureqa symbolic regression program, computer algebra and
  numerical analysis help each other?","21 pages, 3 figures, a Mathematica notebook attachment",,,,cs.MS cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Eureqa symbolic regression program has recently received extensive press
praise. A representative quote is
  ""There are very clever 'thinking machines' in existence today, such as
Watson, the IBM computer that conquered Jeopardy! last year. But next to
Eureqa, Watson is merely a glorified search engine.""
  The program was designed to work with noisy experimental data. However, if
the data is generated from an expression for which there exists more concise
equivalent expressions, sometimes some of the Eureqa results are one or more of
those more concise equivalents. If not, perhaps one or more of the returned
Eureqa results might be a sufficiently accurate approximation that is more
concise than the given expression. Moreover, when there is no known closed form
expression, the data points can be generated by numerical methods, enabling
Eureqa to find expressions that concisely fit those data points with sufficient
accuracy. In contrast to typical regression software, the user does not have to
explicitly or implicitly provide a specific expression or class of expressions
containiing unknown constants for the software to determine.
  Is Eureqa useful enough in these regards to provide an additional tool for
experimental mathematics, computer algebra users and numerical analysis? Yes if
used carefully. Can computer algebra and numerical methods help Eureqa?
Definitely.
","[{'version': 'v1', 'created': 'Mon, 5 Mar 2012 19:49:02 GMT'}]",2012-03-06,"[['Stoutemyer', 'David R.', '']]","['experimental mathematics', 'computer algebra', 'numerical analysis', 'simplification', 'symbolic regression', 'approximation', 'searching algorithms']"
15214,1109.0680,Petros Stefaneas,"Prodromos Tsiavos (London School of Economics, UK) and Petros
  Stefaneas (National Technical University of Athens, Greece)","Beyond the Boundaries of Open, Closed and Pirate Archives: Lessons from
  a Hybrid Approach",,,,,cs.DL,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The creation of open archives i.e. archives where access is regulated by open
licensing models (content, source, data), should be seen as part of a broader
socio-economic phenomenon that finds legal expression in specific
organizational and technical formats.This paper examines the origins and main
characteristics of the open archives phenomenon. We investigate the extent to
which different models of production of economic or social value can be
expressed in different forms of licensing in the context of open archives.
Through this process, we assess the extent to which the digital archive is
moving towards providing access that is deeper (meaning, that offers more
access rights) and wider (in the sense that most of the information given is in
open content licensing) or face a gradual stratification and polarization of
the content. Such stratification entails the emergence of two types of content:
content to which access is extremely limited and content to which access
remains completely open. This differentiation between classes of content is the
result of multiple factors: from purely legislative, administrative and
contractual restrictions (e.g. data protection and confidentiality
restrictions) to information economics (e.g. peer production) or social
(minimum universal access).
  We claim that with respect to the access management model, most of the
current archiving processes include elements of openness. Usually, this is the
result of economic necessity expressed in licensing instruments or
organisational arrangements. The viability and the socio-economic importance of
the digital archives also contributes to the use of open archiving practices.
In such a context, although pure forms of open digital archives may remain an
ideal, the reality of hybrid open digital archives is a necessity.
","[{'version': 'v1', 'created': 'Sun, 4 Sep 2011 07:07:04 GMT'}]",2011-09-06,"[['Tsiavos', 'Prodromos', '', 'London School of Economics, UK'], ['Stefaneas', 'Petros', '', 'National Technical University of Athens, Greece']]","['Creative Commons', 'Open Access', 'Intellectual Property']"
15215,0805.1278,An-Ping Li,An-Ping Li,A New Stream Cipher: Dicing,there are found a few of typos in the former one,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we will propose a new synchronous stream cipher named DICING,
which can be viewed as a clock-controlled one but with a new mechanism of
altering steps. It has satisfactory performance and there have not been found
weakness for the known attacks, the key sizes can be 128bits and 256bits
respectively.
","[{'version': 'v1', 'created': 'Fri, 9 May 2008 04:33:52 GMT'}, {'version': 'v2', 'created': 'Tue, 13 May 2008 02:38:10 GMT'}]",2009-03-21,"[['Li', 'An-Ping', '']]","['stream cipher', 'LFSR', 'projector', 'finite field', 'correlation attack', 'algebraic attack', 'distinguishing attack']"
15216,1603.01801,Gaurav Pandey,Gaurav Pandey and Ambedkar Dukkipati,Variational methods for Conditional Multimodal Deep Learning,14 pages,,,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we address the problem of conditional modality learning,
whereby one is interested in generating one modality given the other. While it
is straightforward to learn a joint distribution over multiple modalities using
a deep multimodal architecture, we observe that such models aren't very
effective at conditional generation. Hence, we address the problem by learning
conditional distributions between the modalities. We use variational methods
for maximizing the corresponding conditional log-likelihood. The resultant deep
model, which we refer to as conditional multimodal autoencoder (CMMA), forces
the latent representation obtained from a single modality alone to be `close'
to the joint representation obtained from multiple modalities. We use the
proposed model to generate faces from attributes. We show that the faces
generated from attributes using the proposed model, are qualitatively and
quantitatively more representative of the attributes from which they were
generated, than those obtained by other deep generative models. We also propose
a secondary task, whereby the existing faces are modified by modifying the
corresponding attributes. We observe that the modifications in face introduced
by the proposed model are representative of the corresponding modifications in
attributes.
","[{'version': 'v1', 'created': 'Sun, 6 Mar 2016 07:33:03 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Aug 2016 10:57:41 GMT'}]",2016-08-29,"[['Pandey', 'Gaurav', ''], ['Dukkipati', 'Ambedkar', '']]","['multimodal', 'variational', 'autoencoder']"
15217,1312.4044,Mohammed El-Dosuky,M. A. El-Dosuky,"CACO : Competitive Ant Colony Optimization, A Nature-Inspired
  Metaheuristic For Large-Scale Global Optimization",,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Large-scale problems are nonlinear problems that need metaheuristics, or
global optimization algorithms. This paper reviews nature-inspired
metaheuristics, then it introduces a framework named Competitive Ant Colony
Optimization inspired by the chemical communications among insects. Then a case
study is presented to investigate the proposed framework for large-scale global
optimization.
","[{'version': 'v1', 'created': 'Sat, 14 Dec 2013 13:33:48 GMT'}]",2013-12-17,"[['El-Dosuky', 'M. A.', '']]","['Ant Colony Optimization', 'Metaheuristics', 'large-scale global optimization']"
15218,1307.0951,Ivan  Arakistain,"Ivan Arakistain, Mikel Barrado","WoodTouch, a new interaction interface for wooden furniture",,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  If wood has been with us since time immemorial, being part of our
environment, housing and tools, now wood has gain momentum, as it is clear that
wood improves our life style. Because of the healthiness, resistance, ecology
and comfort, wood is important for all of us, no matter what our life style is.
WOODTOUCH Project aims to open a completely new market for furniture and
interior design companies, enabling touch interaction between the user and
wooden furniture surfaces. Why not switch on or dim the lights touching a
wooden table? Why not turn on the heating system? Why not use wood as a touch
sensitive surface for domotic control? The furniture designed with this novel
technology, offers a wooden outer image and has different touch sensitive areas
over the ones the user is able to control all sorts of electric appliances
touching over a wooden surface.
","[{'version': 'v1', 'created': 'Wed, 3 Jul 2013 09:45:18 GMT'}]",2013-07-04,"[['Arakistain', 'Ivan', ''], ['Barrado', 'Mikel', '']]","['wood', 'touch', 'control', 'sensitive', 'interaction']"
15219,1704.03167,Yijia Chen,"Yijia Chen, Joerg Flum, Xuangui Huang",Slicewise definability in first-order logic with bounded quantifier rank,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For every $q\in \mathbb N$ let $\textrm{FO}_q$ denote the class of sentences
of first-order logic FO of quantifier rank at most $q$. If a graph property can
be defined in $\textrm{FO}_q$, then it can be decided in time $O(n^q)$. Thus,
minimizing $q$ has favorable algorithmic consequences. Many graph properties
amount to the existence of a certain set of vertices of size $k$. Usually this
can only be expressed by a sentence of quantifier rank at least $k$. We use the
color-coding method to demonstrate that some (hyper)graph problems can be
defined in $\textrm{FO}_q$ where $q$ is independent of $k$. This property of a
graph problem is equivalent to the question of whether the corresponding
parameterized problem is in the class $\textrm{para-AC}^0$.
  It is crucial for our results that the FO-sentences have access to built-in
addition and multiplication. It is known that then FO corresponds to the
circuit complexity class uniform $\textrm{AC}^0$. We explore the connection
between the quantifier rank of FO-sentences and the depth of
$\textrm{AC}^0$-circuits, and prove that $\textrm{FO}_q \subsetneq
\textrm{FO}_{q+1}$ for structures with built-in addition and multiplication.
","[{'version': 'v1', 'created': 'Tue, 11 Apr 2017 06:35:37 GMT'}]",2017-04-12,"[['Chen', 'Yijia', ''], ['Flum', 'Joerg', ''], ['Huang', 'Xuangui', '']]","['first-order logic', 'quantifier rank', 'parameterized AC0', 'circuit depth']"
15220,1510.05192,Frank Bentley,"Frank Bentley, Karen Church, Beverly Harrison, Kent Lyons, Matthew
  Rafalow","Three Hours a Day: Understanding Current Teen Practices of Smartphone
  Application Use",,,,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Teens are using mobile devices for an increasing number of activities.
Smartphones and a variety of mobile apps for communication, entertainment, and
productivity have become an integral part of their lives. This mobile phone use
has evolved rapidly as technology has changed and thus studies from even 2 or 3
years ago may not reflect new patterns and practices as smartphones have become
more sophisticated. In order to understand current teen's practices around
smartphone use, we conducted a two week, mixed-methods study with 14 diverse
teens. Through voicemail diaries, interviews, and real world usage data from a
logging application installed on their smartphones, we developed an
understanding of the types of apps used by teens, when they use these apps, and
their reasons for using specific apps in particular situations. We found that
the teens in our study used their smartphones for an average of almost 3 hours
per day and that two-thirds of all app use involved interacting with an average
of almost 10 distinct communications applications. From our study data, we
highlight key implications for the design of future mobile apps or services,
specifically new social and communications-related applications that allow
teens to maintain desired levels of privacy and permanence on the content that
they share.
","[{'version': 'v1', 'created': 'Sun, 18 Oct 2015 02:31:50 GMT'}]",2015-10-22,"[['Bentley', 'Frank', ''], ['Church', 'Karen', ''], ['Harrison', 'Beverly', ''], ['Lyons', 'Kent', ''], ['Rafalow', 'Matthew', '']]","['Teens; Mobile Phones; Smartphones', 'Communication; Application Use; Mobile', 'User Study']"
15221,1605.00705,Spyridon Vassilaras,Spyridon Vassilaras and Ioannis Ch. Paschalidis,"Robust measurement-based buffer overflow probability estimators for QoS
  provisioning and traffic anomaly prediction applicationm",,,,,cs.IT math.IT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Suitable estimators for a class of Large Deviation approximations of rare
event probabilities based on sample realizations of random processes have been
proposed in our earlier work. These estimators are expressed as non-linear
multi-dimensional optimization problems of a special structure. In this paper,
we develop an algorithm to solve these optimization problems very efficiently
based on their characteristic structure. After discussing the nature of the
objective function and constraint set and their peculiarities, we provide a
formal proof that the developed algorithm is guaranteed to always converge. The
existence of efficient and provably convergent algorithms for solving these
problems is a prerequisite for using the proposed estimators in real time
problems such as call admission control, adaptive modulation and coding with
QoS constraints, and traffic anomaly detection in high data rate communication
networks.
","[{'version': 'v1', 'created': 'Mon, 2 May 2016 23:13:28 GMT'}]",2016-05-04,"[['Vassilaras', 'Spyridon', ''], ['Paschalidis', 'Ioannis Ch.', '']]","['Large Deviations', 'Markov-modulated processes', 'Estimation', 'Non-linear optimization', 'QoS', 'Traffic anomaly detection']"
15222,0905.3678,Vadim Madgazin,Vadim R. Madgazin,Major and minor. The formula of musical emotions,"22 pages, 3 figures, in Russian, added figures, changed content",,,,cs.SD q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The new formulas, which determine sign and amplitude of utilitarian emotions,
are proposed on the basis of the information theory of emotions. In area of
perception of musical chords the force of emotions depends on the relative
pitch of sounds of major and minor chords.
  Is advanced hypothesis that in the perception of a musical chord in the
psyche caused by the subject value of some objective function L. This function
is expressed directly through the proportion of the pitch of chord. Major
chords are expressed as the straight proportions, which generate idea about an
increase in the objective function (L>1) and are caused positive utilitarian
emotions. Minor chords are expressed as the inverse proportion, which generate
idea about the decrease of objective function (L<1) and are caused negative
utilitarian emotions.
  The formula of musical emotions is advanced: Pwe = log(L) =
(1/M)*log(n1*n2*n3* ... *nM), where M is a quantity of voices of chord, ni -
integer number (or reciprocal fraction) from the pitch proportion, which
corresponds to the i-th voice of chord.
  Confined experimental check is produced. The limits of the applicability of
the formula of musical emotions are investigated.
  Keywords: sound, music, chord, major, minor, emotions, the formula of musical
emotions, the information theory of emotions.
","[{'version': 'v1', 'created': 'Fri, 22 May 2009 13:40:36 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Jul 2009 10:57:50 GMT'}, {'version': 'v3', 'created': 'Tue, 1 Sep 2009 11:19:59 GMT'}]",2009-09-01,"[['Madgazin', 'Vadim R.', '']]","['sound', 'music', 'chord', 'major', 'minor', 'emotions', 'the formula of musical emotions', 'the information theory of emotions']"
15223,1510.01140,Hokky Situngkir,Hokky Situngkir,Deconstructing Bataknese Gorga Computationally,"10 pages, 4 figures","BFI Working Paper Series, WP072012, 2012",,,cs.CG cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The carved and painted decorations in traditional Batak houses and buildings,
gorga, are the source of their exoticism. There are no identical patterns of
the ornaments within Batak houses and the drawings are closely related to the
way ancient Batak capture the dynamicity of the growing 'tree of life', one of
central things within their cosmology and mythology. The survey of ornaments of
Batak houses and buildings in Northern Sumatera Indonesia has made us possible
to observe the complex pattern. The fractal dimensions of the geometrical
shapes in gorga are calculated and they are conjectured into 1.5-1.6, between
the dimensional of a line and a plane. The way gorga is drawn is captured by
using some modification to the turtle geometry of L-System model, a popular
model to model the dynamics of growing plants. The result is a proposal to see
Bataknese gorga as one of traditional heritage that may enrich the studies to
the generative art.
","[{'version': 'v1', 'created': 'Mon, 24 Aug 2015 07:37:22 GMT'}]",2015-10-06,"[['Situngkir', 'Hokky', '']]","['Batak', 'gorga', 'carving', 'painting', 'Indonesia', 'fractal', 'geometry', 'generative art']"
15224,1401.8252,Abdessamad Mouzoune,"Abdessamad Mouzoune, Saoudi Taibi",Introducing E-maintenance 2.0,"11 pages, 1 figure","International Journal of Computer Science and Business
  Informatics, Vol. 9, No. 1, pp. 80-90",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While research literature is still debating e-maintenance definition, a new
reality is emerging in business world confirming the enterprise 2.0 model.
Executives are more and more forced to stop running against current trend
towards social media and instead envisage harnessing its power within the
enterprise. Maintenance can't be an exception for long and has to take
advantage of new opportunities created by social technological innovations. In
this paper, a combination of pure E perspective and 2.0 perspective is proposed
to avoid a lock-in and allow continous evolution of e-maintenance within the
new context of business: A combination of data centric models and people
oriented applications to form a collaborative environment in order to conceive
and achieve global goals of maintenance.New challenges are also to be expected
as to the effecient integration of enterprise 2.0 tools within current
e-maintenance platforms and futher research work is still to be done in this
area.
","[{'version': 'v1', 'created': 'Fri, 31 Jan 2014 18:38:56 GMT'}]",2014-02-03,"[['Mouzoune', 'Abdessamad', ''], ['Taibi', 'Saoudi', '']]","['E-enterprise', 'E-maintenance', 'Enterprise 2.0', 'E-maintenance 2.0', 'Maintenance']"
15225,1802.08599,Rik van Noord,"Rik van Noord, Lasha Abzianidze, Hessel Haagsma, Johan Bos",Evaluating Scoped Meaning Representations,Camera-ready for LREC 2018,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semantic parsing offers many opportunities to improve natural language
understanding. We present a semantically annotated parallel corpus for English,
German, Italian, and Dutch where sentences are aligned with scoped meaning
representations in order to capture the semantics of negation, modals,
quantification, and presupposition triggers. The semantic formalism is based on
Discourse Representation Theory, but concepts are represented by WordNet
synsets and thematic roles by VerbNet relations. Translating scoped meaning
representations to sets of clauses enables us to compare them for the purpose
of semantic parser evaluation and checking translations. This is done by
computing precision and recall on matching clauses, in a similar way as is done
for Abstract Meaning Representations. We show that our matching tool for
evaluating scoped meaning representations is both accurate and efficient.
Applying this matching tool to three baseline semantic parsers yields F-scores
between 43% and 54%. A pilot study is performed to automatically find changes
in meaning by comparing meaning representations of translations. This
comparison turns out to be an additional way of (i) finding annotation mistakes
and (ii) finding instances where our semantic analysis needs to be improved.
","[{'version': 'v1', 'created': 'Fri, 23 Feb 2018 15:31:19 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Apr 2018 09:55:10 GMT'}]",2018-04-11,"[['van Noord', 'Rik', ''], ['Abzianidze', 'Lasha', ''], ['Haagsma', 'Hessel', ''], ['Bos', 'Johan', '']]","['parallel corpus', 'semantic annotation', 'discourse representation structure', 'evaluation', 'semantic scope']"
15226,1704.04359,Xiao-Shan Gao,Qiao-Long Huang and Xiao-Shan Gao,"Sparse Polynomial Interpolation with Finitely Many Values for the
  Coefficients",,,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we give new sparse interpolation algorithms for black box
polynomial f whose coefficients are from a finite set. In the univariate case,
we recover f from one evaluation of f(a) for a sufficiently large number a. In
the multivariate case, we introduce the modified Kronecker substitution to
reduce the interpolation of a multivariate polynomial to the univariate case.
Both algorithms have polynomial bit-size complexity.
","[{'version': 'v1', 'created': 'Fri, 14 Apr 2017 06:04:44 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Jun 2017 07:24:50 GMT'}]",2017-06-23,"[['Huang', 'Qiao-Long', ''], ['Gao', 'Xiao-Shan', '']]","['Sparse polynomial interpolation', 'modified Kronecker substitution', 'polynomial time algorithms']"
15227,1105.4136,Riccardo Murri,Riccardo Murri,"A novel parallel algorithm for Gaussian Elimination of sparse
  unsymmetric matrices","14 pages; 2 PDF figures; LaTeX2e; final version submitted for the
  PPAM2011 conference proceedings",,,,cs.MS cs.DC cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a new algorithm for Gaussian Elimination suitable for general
(unsymmetric and possibly singular) sparse matrices, of any entry type, which
has a natural parallel and distributed-memory formulation but degrades
gracefully to sequential execution.
  We present a sample MPI implementation of a program computing the rank of a
sparse integer matrix using the proposed algorithm. Some preliminary
performance measurements are presented and discussed, and the performance of
the algorithm is compared to corresponding state-of-the-art algorithms for
floating-point and integer matrices.
","[{'version': 'v1', 'created': 'Fri, 20 May 2011 17:29:57 GMT'}, {'version': 'v2', 'created': 'Mon, 31 Oct 2011 18:36:54 GMT'}, {'version': 'v3', 'created': 'Sun, 15 Jan 2012 21:34:56 GMT'}]",2012-01-17,"[['Murri', 'Riccardo', '']]","['Gaussian Elimination', 'unsymmetric sparse matrices', 'exactarithmetic']"
15228,1607.00604,Timotheos Aslanidis,Timotheos Aslanidis and Leonidas Tsepenekas,Message Routing in Wireless and Mobile Networks using TDMA Technology,"13 pages, 8 figures, 1 table, International Journal of Wireless &
  Mobile Networks (IJWMN), vol. 8, No. 3, June 2016",,,,cs.NI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In an era where communication has a most important role in modern societies,
designing efficient algorithms for data transmission is of the outmost
importance. TDMA is a technology used in many communication systems such as
satellite, cell phone as well as other wireless or mobile networks. Most 2G
cellular systems as well as some 3G are TDMA based. In order to transmit data
in such systems we need to cluster them in packages. To achieve a faster
transmission we are allowed to preempt the transmission of any packet in order
to resume at a later time. Preemption can be used to reduce idleness of some
stations. Such preemptions though come with a reconfiguration cost in order to
setup for the next transmission. In this paper we propose two algorithms which
yield improved transmission scheduling. These two algorithms we call MGA and
IMGA (Improved MGA). We have proven an approximation ratio for MGA and ran
experiments to establish that it works even better in practice. In order to
conclude that MGA will be a very helpful tool in constructing an improved
schedule for packet routing using preemtion with a setup cost, we compare its
results to two other efficient algorithms designed by researchers in the past:
A-PBS(d+1) and GWA. To establish the efficiency of IMGA we ran experiments in
comparison to MGA as well as A-PBS(d+1) and GWA. IMGA has proven to produce the
most efficient schedule on all counts.
","[{'version': 'v1', 'created': 'Sun, 3 Jul 2016 07:14:29 GMT'}]",2016-07-05,"[['Aslanidis', 'Timotheos', ''], ['Tsepenekas', 'Leonidas', '']]","['Wireless', 'mobile networks', 'reconfiguration cost', 'preemption', 'scheduling']"
15229,1208.2655,Mikhail Kharinov,M. Kharinov,Stable Segmentation of Digital Image,"6 pages, 10 formulas, 2 figures, in russian","Proc. of the 22th Int. Conf. on Comp. Graphics and Vision
  (Graphicon 2012), Moscow: MSU, 01-05 Oct. 2012, pp. 208-213. (in Russian)",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the paper the optimal image segmentation by means of piecewise constant
approximations is considered. The optimality is defined by a minimum value of
the total squared error or by equivalent value of standard deviation of the
approximation from the image. The optimal approximations are defined
independently on the method of their obtaining and might be generated in
different algorithms. We investigate the computation of the optimal
approximation on the grounds of stability with respect to a given set of
modifications. To obtain the optimal approximation the Mumford-Shuh model is
generalized and developed, which in the computational part is combined with the
Otsu method in multi-thresholding version. The proposed solution is proved
analytically and experimentally on the example of the standard image.
","[{'version': 'v1', 'created': 'Mon, 13 Aug 2012 18:21:05 GMT'}]",2012-10-09,"[['Kharinov', 'M.', '']]","['Mumford-Shuh model', 'Otsu method', 'K-means method', 'overlapping partitions', 'standard deviation', 'stability condition']"
15230,1307.3489,Bilel Ben Ali,Bilel Ben Ali and Fethi Jarray,Genetic approach for arabic part of speech tagging,"12 pages, 8 figures","International Journal on Natural Language Computing (IJNLC) Vol.
  2, No.3, June 2013",,,cs.CL cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the growing number of textual resources available, the ability to
understand them becomes critical. An essential first step in understanding
these sources is the ability to identify the part of speech in each sentence.
Arabic is a morphologically rich language, wich presents a challenge for part
of speech tagging. In this paper, our goal is to propose, improve and implement
a part of speech tagger based on a genetic alorithm. The accuracy obtained with
this method is comparable to that of other probabilistic approaches.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2013 10:21:01 GMT'}]",2013-07-15,"[['Ali', 'Bilel Ben', ''], ['Jarray', 'Fethi', '']]","['Part-of-Speech Tagging', 'Genetic algorithm', 'Natural Language Processing', 'Part-of-Speech tagger', 'Tagset', 'Training tables & corpus']"
15231,1704.02698,Umamaheswari Ganesh,"G.Umamaheswari, Dr.C.P.Sumathi","A New Steganographic Technique Matching the Secret Message and Cover
  image Binary Value",6 pages,"International Journal of Computer Science and Information
  Security, January 2017",,,cs.MM cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Steganography involves hiding a secret message or image inside another cover
image. Changes are made in the cover image without affecting visual quality of
the image. In contrast to cryptography, Steganography provides complete secrecy
of the communication. Security of very sensitive data can be enhanced by
combining cryptography and steganography. A new technique that uses the concept
of Steganography to obtain the position values from an image is suggested. This
paper proposes a new method where no change is made to the cover image, only
the pixel position LSB (Least Significant Bit) values that match with the
secret message bit values are noted in a separate position file. At the sending
end the position file along with the cover image is sent. At the receiving end
the position file is opened only with a secret key. The bit positions are taken
from the position file and the LSB values from the positions are combined to
get ASCII values and then form characters of the secret message
","[{'version': 'v1', 'created': 'Mon, 10 Apr 2017 03:47:42 GMT'}]",2017-04-11,"[['Umamaheswari', 'G.', ''], ['Sumathi', 'Dr. C. P.', '']]","['Cover image', 'Least Significant Bit(LSB)', 'Mean Square Error(MSE)', 'Peak Signal to Noise Ratio(PSNR)', 'Pixel Value Differencing(P VD)']"
15232,1305.6215,Jean-Francois Bercher,Jean-Fran\c{c}ois Bercher (LIGM),"On some interrelations of generalized $q$-entropies and a generalized
  Fisher information, including a Cram\'er-Rao inequality",,"Applied Stochastic Models and Data Analysis, Mataro (Barcelona) :
  Spain (2013)",,,cs.IT cond-mat.other math.IT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this communication, we describe some interrelations between generalized
$q$-entropies and a generalized version of Fisher information. In information
theory, the de Bruijn identity links the Fisher information and the derivative
of the entropy. We show that this identity can be extended to generalized
versions of entropy and Fisher information. More precisely, a generalized
Fisher information naturally pops up in the expression of the derivative of the
Tsallis entropy. This generalized Fisher information also appears as a special
case of a generalized Fisher information for estimation problems. Indeed, we
derive here a new Cram\'er-Rao inequality for the estimation of a parameter,
which involves a generalized form of Fisher information. This generalized
Fisher information reduces to the standard Fisher information as a particular
case. In the case of a translation parameter, the general Cram\'er-Rao
inequality leads to an inequality for distributions which is saturated by
generalized $q$-Gaussian distributions. These generalized $q$-Gaussians are
important in several areas of physics and mathematics. They are known to
maximize the $q$-entropies subject to a moment constraint. The Cram\'er-Rao
inequality shows that the generalized $q$-Gaussians also minimize the
generalized Fisher information among distributions with a fixed moment.
Similarly, the generalized $q$-Gaussians also minimize the generalized Fisher
information among distributions with a given $q$-entropy.
","[{'version': 'v1', 'created': 'Mon, 27 May 2013 13:36:21 GMT'}]",2013-05-28,"[['Bercher', 'Jean-François', '', 'LIGM']]","['Cramér-Rao inequality', 'generalized q-entropy', 'generalized Gaussians', 'deBruijn identity']"
15233,1409.4757,Katsuhiko Ishiguro,"Katsuhiko Ishiguro, Issei Sato, Naonori Ueda",Collapsed Variational Bayes Inference of Infinite Relational Model,,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Infinite Relational Model (IRM) is a probabilistic model for relational
data clustering that partitions objects into clusters based on observed
relationships. This paper presents Averaged CVB (ACVB) solutions for IRM,
convergence-guaranteed and practically useful fast Collapsed Variational Bayes
(CVB) inferences. We first derive ordinary CVB and CVB0 for IRM based on the
lower bound maximization. CVB solutions yield deterministic iterative
procedures for inferring IRM given the truncated number of clusters. Our
proposal includes CVB0 updates of hyperparameters including the concentration
parameter of the Dirichlet Process, which has not been studied in the
literature. To make the CVB more practically useful, we further study the CVB
inference in two aspects. First, we study the convergence issues and develop a
convergence-guaranteed algorithm for any CVB-based inferences called ACVB,
which enables automatic convergence detection and frees non-expert
practitioners from difficult and costly manual monitoring of inference
processes. Second, we present a few techniques for speeding up IRM inferences.
In particular, we describe the linear time inference of CVB0, allowing the IRM
for larger relational data uses. The ACVB solutions of IRM showed comparable or
better performance compared to existing inference methods in experiments, and
provide deterministic, faster, and easier convergence detection.
","[{'version': 'v1', 'created': 'Tue, 16 Sep 2014 08:06:36 GMT'}]",2014-09-18,"[['Ishiguro', 'Katsuhiko', ''], ['Sato', 'Issei', ''], ['Ueda', 'Naonori', '']]","['nonparametric Bayes', 'infinite relational models', 'collapsed variational Bayes inference', 'averaged CVB', 'relational data analysis']"
15234,1607.00501,Le Dong,"Le Dong, Na Lv, Qianni Zhang, Shanshan Xie, Ling He, Mengdie Mao","A Distributed Deep Representation Learning Model for Big Image Data
  Classification",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes an effective and efficient image classification
framework nominated distributed deep representation learning model (DDRL). The
aim is to strike the balance between the computational intensive deep learning
approaches (tuned parameters) which are intended for distributed computing, and
the approaches that focused on the designed parameters but often limited by
sequential computing and cannot scale up. In the evaluation of our approach, it
is shown that DDRL is able to achieve state-of-art classification accuracy
efficiently on both medium and large datasets. The result implies that our
approach is more efficient than the conventional deep learning approaches, and
can be applied to big data that is too complex for parameter designing focused
approaches. More specifically, DDRL contains two main components, i.e., feature
extraction and selection. A hierarchical distributed deep representation
learning algorithm is designed to extract image statistics and a nonlinear
mapping algorithm is used to map the inherent statistics into abstract
features. Both algorithms are carefully designed to avoid millions of
parameters tuning. This leads to a more compact solution for image
classification of big data. We note that the proposed approach is designed to
be friendly with parallel computing. It is generic and easy to be deployed to
different distributed computing resources. In the experiments, the largescale
image datasets are classified with a DDRM implementation on Hadoop MapReduce,
which shows high scalability and resilience.
","[{'version': 'v1', 'created': 'Sat, 2 Jul 2016 12:33:12 GMT'}]",2016-07-05,"[['Dong', 'Le', ''], ['Lv', 'Na', ''], ['Zhang', 'Qianni', ''], ['Xie', 'Shanshan', ''], ['He', 'Ling', ''], ['Mao', 'Mengdie', '']]","['Image classification', 'Big data', 'Deep learning', 'Distributedresources']"
15235,1303.5919,Akhil Jabbar Meerja,"M.Akhil Jabbar, B L Deekshatulu, Priti Chandra","Heart Disease Prediction System using Associative Classification and
  Genetic Algorithm","International Conference on Emerging Trends in Electrical,
  Electronics and Communication Technologies-ICECIT, 2012","Vol no1 pp 183-192, Elsevier Dec 2012",,,cs.AI stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Associative classification is a recent and rewarding technique which
integrates association rule mining and classification to a model for prediction
and achieves maximum accuracy. Associative classifiers are especially fit to
applications where maximum accuracy is desired to a model for prediction. There
are many domains such as medical where the maximum accuracy of the model is
desired. Heart disease is a single largest cause of death in developed
countries and one of the main contributors to disease burden in developing
countries. Mortality data from the registrar general of India shows that heart
disease are a major cause of death in India, and in Andhra Pradesh coronary
heart disease cause about 30%of deaths in rural areas. Hence there is a need to
develop a decision support system for predicting heart disease of a patient. In
this paper we propose efficient associative classification algorithm using
genetic approach for heart disease prediction. The main motivation for using
genetic algorithm in the discovery of high level prediction rules is that the
discovered rules are highly comprehensible, having high predictive accuracy and
of high interestingness values. Experimental Results show that most of the
classifier rules help in the best prediction of heart disease which even helps
doctors in their diagnosis decisions.
","[{'version': 'v1', 'created': 'Sun, 24 Mar 2013 07:18:50 GMT'}]",2013-03-26,"[['Jabbar', 'M. Akhil', ''], ['Deekshatulu', 'B L', ''], ['Chandra', 'Priti', '']]","['Andhra Pradesh', 'Associative classification', 'Genetic algorithm', 'Gini Index', 'Z-Statistics']"
15236,1710.03025,Himanshu Jain,"Himanshu Jain, Archana Praveen Kumar",A Sequential Thinning Algorithm For Multi-Dimensional Binary Patterns,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Thinning is the removal of contour pixels/points of connected components in
an image to produce their skeleton with retained connectivity and structural
properties. The output requirements of a thinning procedure often vary with
application. This paper proposes a sequential algorithm that is very easy to
understand and modify based on application to perform the thinning of
multi-dimensional binary patterns. The algorithm was tested on 2D and 3D
patterns and showed very good results. Moreover, comparisons were also made
with two of the state-of-the-art methods used for 2D patterns. The results
obtained prove the validity of the procedure.
","[{'version': 'v1', 'created': 'Mon, 9 Oct 2017 10:52:55 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Nov 2017 21:19:29 GMT'}]",2017-11-20,"[['Jain', 'Himanshu', ''], ['Kumar', 'Archana Praveen', '']]","['array slicing', 'skeletonization', 'erosion', 'local']"
15237,1306.6709,Aur\'elien Bellet,"Aur\'elien Bellet, Amaury Habrard and Marc Sebban",A Survey on Metric Learning for Feature Vectors and Structured Data,"Technical report, 59 pages. Changes in v2: fixed typos and improved
  presentation. Changes in v3: fixed typos. Changes in v4: fixed typos and new
  methods",,,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The need for appropriate ways to measure the distance or similarity between
data is ubiquitous in machine learning, pattern recognition and data mining,
but handcrafting such good metrics for specific problems is generally
difficult. This has led to the emergence of metric learning, which aims at
automatically learning a metric from data and has attracted a lot of interest
in machine learning and related fields for the past ten years. This survey
paper proposes a systematic review of the metric learning literature,
highlighting the pros and cons of each approach. We pay particular attention to
Mahalanobis distance metric learning, a well-studied and successful framework,
but additionally present a wide range of methods that have recently emerged as
powerful alternatives, including nonlinear metric learning, similarity learning
and local metric learning. Recent trends and extensions, such as
semi-supervised metric learning, metric learning for histogram data and the
derivation of generalization guarantees, are also covered. Finally, this survey
addresses metric learning for structured data, in particular edit distance
learning, and attempts to give an overview of the remaining challenges in
metric learning for the years to come.
","[{'version': 'v1', 'created': 'Fri, 28 Jun 2013 03:56:15 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Jul 2013 04:48:05 GMT'}, {'version': 'v3', 'created': 'Mon, 19 Aug 2013 21:28:07 GMT'}, {'version': 'v4', 'created': 'Wed, 12 Feb 2014 07:45:11 GMT'}]",2019-01-25,"[['Bellet', 'Aurélien', ''], ['Habrard', 'Amaury', ''], ['Sebban', 'Marc', '']]","['Metric Learning', 'Similarity Learning', 'Mahalanobis Distance', 'Edit Distance']"
15238,1407.6560,Olav Geil,"Olav Geil, Louise Foshammer and Malte Neve-Gr{\ae}sb{\o}ll",Combining subspace codes with classical linear error-correcting codes,"6 pages. The below paper was written in May 2014. The authors have
  come to know that there is a significant overlap with previous results by
  Vitaly Skachek, Olgica Milenkovic, and Angelia Nedic published in July 2011
  as arXiv:1107.4581. Their paper entitled ""Hybrid Noncoherent Network Coding""
  appeared in IEEE Transactions on Information Theory, June 2013",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We discuss how subspace codes can be used to simultaneously correct errors
and erasures when the network performs random linear network coding and the
edges are noisy channels. This is done by combining the subspace code with a
classical linear error-correcting code. The classical code then takes care of
the errors and the subspace codes takes care of the erasures.
","[{'version': 'v1', 'created': 'Thu, 24 Jul 2014 13:01:26 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Jul 2014 21:13:46 GMT'}]",2014-07-31,"[['Geil', 'Olav', ''], ['Foshammer', 'Louise', ''], ['Neve-Græsbøll', 'Malte', '']]","['Linear code', 'noisy channel', 'operator channel', 'random network coding', 'subspace code']"
15239,1205.0337,Pejman Goudarzi,Pejman Goudarzi,Stochastic TCO minimization for Video Transmission over IP Networks,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  From the viewpoint of service operators the Total Cost of Ownership (TCO) for
developing a communication service comprises from two parts; CAPital
EXpenditure (CAPEX) and OPerational EXpenditure (OPEX). These two types of
costs are interrelated and affect any service provider's deployment strategy.
In many traditional methods, selection of critical elements of a new service is
performed in a heuristic manner aimed at reducing only the OPEX part of the TCO
which is not necessarily optimal. Furthermore, exact cost modeling for such
services is not always possible and contains some uncertainties. In the current
work, after cost modeling of each video streaming element by capturing the
effect of the model uncertainties, the TCO optimization problem for video
streaming over IP networks is formulated as a stochastic optimization problem.
The solution of the proposed optimization problem can cope with the cost
modeling uncertainties and track the dynamism in the TCO and lead to a
time-varying optimal solution. Numerical analysis results verify the developed
method.
","[{'version': 'v1', 'created': 'Wed, 2 May 2012 06:40:34 GMT'}]",2012-05-03,"[['Goudarzi', 'Pejman', '']]","['TCO', 'CAPEX', 'OPEX', 'IPTV', 'VOD', 'SA']"
15240,1209.5333,Himanshu Chaurasiya,Himanshu Chaurasiya,Recent Trends of Measurement and Development of Vibration Sensors,"6 pages, 8 figures, International Journal of Computer Science
  Issues,Volume 9, Issue 4, No 1, July 2012; http://www.IJCSI.org, ISSN
  (Online): 1694-0814, July 2012",,,,cs.SY physics.ins-det,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent trends, sensors are devices which monitor a parameter of a system,
hopefully without disturbing that parameter. Vibration measurement has become
an important method in mechanical structural products research, design,
produce, apply and maintenance. Vibration sensor is more and more important as
key devices. Nowadays, with the development of computer technology, electronic
technology and manufacturing process, a variety of vibration sensors have come
forth in succession.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2012 16:57:20 GMT'}]",2012-09-25,"[['Chaurasiya', 'Himanshu', '']]","['Development trend', 'Present situation order', 'Sensor', 'Vibration measurement']"
15241,1305.5703,Pedro Quaresma,Pedro Quaresma and Vanda Santos and Seifeddine Bouallegue,The Web Geometry Laboratory Project,"5 pages; 2 figures; Conferences on Intelligent Computer Mathematics
  (CICM2013), July 8-12, 2013, University of Bath, Bath, England","CICM 2013, LNAI (7961), 364-368, Springer, 2013",,,cs.CY cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ""Web Geometry Laboratory"" (WGL) project's goal is to build an adaptive
and collaborative blended-learning Web-environment for geometry. In its current
version (1.0) the WGL is already a collaborative blended-learning
Web-environment integrating a dynamic geometry system (DGS) and having some
adaptive features. All the base features needed to implement the adaptive
module and to allow the integration of a geometry automated theorem prover
(GATP) are also already implemented. The actual testing of the WGL platform by
high-school teachers is underway and a field-test with high-school students is
being prepared. The adaptive module and the GATP integration will be the next
steps of this project.
","[{'version': 'v1', 'created': 'Fri, 24 May 2013 12:01:21 GMT'}]",2013-05-27,"[['Quaresma', 'Pedro', ''], ['Santos', 'Vanda', ''], ['Bouallegue', 'Seifeddine', '']]","['adaptive', 'collaborative', 'blended-learning', 'geometry']"
15242,1205.6745,Gnanasivam Pachaiyappan,P Gnanasivam and Dr. S Muttan,"Fingerprint Gender Classification using Wavelet Transform and Singular
  Value Decomposition",12 figures and 6 tables,"IJCSI International Journal of Computer Science Issues, Vol. 9,
  Issue 2, No 3, March 2012",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel method of gender Classification from fingerprint is proposed based on
discrete wavelet transform (DWT) and singular value decomposition (SVD). The
classification is achieved by extracting the energy computed from all the
sub-bands of DWT combined with the spatial features of non-zero singular values
obtained from the SVD of fingerprint images. K nearest neighbor (KNN) used as a
classifier. This method is experimented with the internal database of 3570
fingerprints finger prints in which 1980 were male fingerprints and 1590 were
female fingerprints. Finger-wise gender classification is achieved which is
94.32% for the left hand little fingers of female persons and 95.46% for the
left hand index finger of male persons. Gender classification for any finger of
male persons tested is attained as 91.67% and 84.69% for female persons
respectively. Overall classification rate is 88.28% has been achieved.
","[{'version': 'v1', 'created': 'Wed, 30 May 2012 16:26:23 GMT'}]",2012-05-31,"[['Gnanasivam', 'P', ''], ['Muttan', 'Dr. S', '']]","['Gender Classification', 'Fingerprint', 'Discrete Wavelet Transform', 'Singular Value Decomposition', 'k nearest neighbor']"
15243,0712.2100,Jocelyne Troccaz,"Jocelyne Troccaz (TIMC), Michael Baumann (TIMC), Peter Berkelman
  (TIMC), Philippe Cinquin (TIMC), Vincent Daanen (TIMC), Antoine Leroy (TIMC),
  Maud Marchal (TIMC), Yohan Payan (TIMC), Emmanuel Promayon (TIMC), Sandrine
  Voros (TIMC), St\'ephane Bart (TIMC), Michel Bolla, Emmanuel
  Chartier-Kastler, Jean-Luc Descotes, Andr\'ee Dusserre, Jean-Yves Giraud,
  Jean-Alexandre Long (TIMC), Ronan Moalic, Pierre Mozer (TIMC)","Medical image computing and computer-aided medical interventions applied
  to soft tissues. Work in progress in urology",,"Proceedings of the IEEE 94, 9 (2006) 1665-1677",,,cs.OH cs.RO,,"  Until recently, Computer-Aided Medical Interventions (CAMI) and Medical
Robotics have focused on rigid and non deformable anatomical structures.
Nowadays, special attention is paid to soft tissues, raising complex issues due
to their mobility and deformation. Mini-invasive digestive surgery was probably
one of the first fields where soft tissues were handled through the development
of simulators, tracking of anatomical structures and specific assistance
robots. However, other clinical domains, for instance urology, are concerned.
Indeed, laparoscopic surgery, new tumour destruction techniques (e.g. HIFU,
radiofrequency, or cryoablation), increasingly early detection of cancer, and
use of interventional and diagnostic imaging modalities, recently opened new
challenges to the urologist and scientists involved in CAMI. This resulted in
the last five years in a very significant increase of research and developments
of computer-aided urology systems. In this paper, we propose a description of
the main problems related to computer-aided diagnostic and therapy of soft
tissues and give a survey of the different types of assistance offered to the
urologist: robotization, image fusion, surgical navigation. Both research
projects and operational industrial systems are discussed.
","[{'version': 'v1', 'created': 'Thu, 13 Dec 2007 06:45:28 GMT'}]",2007-12-14,"[['Troccaz', 'Jocelyne', '', 'TIMC'], ['Baumann', 'Michael', '', 'TIMC'], ['Berkelman', 'Peter', '', 'TIMC'], ['Cinquin', 'Philippe', '', 'TIMC'], ['Daanen', 'Vincent', '', 'TIMC'], ['Leroy', 'Antoine', '', 'TIMC'], ['Marchal', 'Maud', '', 'TIMC'], ['Payan', 'Yohan', '', 'TIMC'], ['Promayon', 'Emmanuel', '', 'TIMC'], ['Voros', 'Sandrine', '', 'TIMC'], ['Bart', 'Stéphane', '', 'TIMC'], ['Bolla', 'Michel', '', 'TIMC'], ['Chartier-Kastler', 'Emmanuel', '', 'TIMC'], ['Descotes', 'Jean-Luc', '', 'TIMC'], ['Dusserre', 'Andrée', '', 'TIMC'], ['Giraud', 'Jean-Yves', '', 'TIMC'], ['Long', 'Jean-Alexandre', '', 'TIMC'], ['Moalic', 'Ronan', '', 'TIMC'], ['Mozer', 'Pierre', '', 'TIMC']]","['Computer-aided surgery', 'medical robotics', 'medical image registration', 'urology']"
15244,1312.4521,Zoran Cvetkovic,Zoran Cvetkovic and Vincent Sinn,"Weyl-Heisenberg Spaces for Robust Orthogonal Frequency Division
  Multiplexing",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Design of Weyl-Heisenberg sets of waveforms for robust orthogonal frequency
division multiplex- ing (OFDM) has been the subject of a considerable volume of
work. In this paper, a complete parameterization of orthogonal Weyl-Heisenberg
sets and their corresponding biorthogonal sets is given. Several examples of
Weyl-Heisenberg sets designed using this parameterization are pre- sented,
which in simulations show a high potential for enabling OFDM robust to
frequency offset, timing mismatch, and narrow-band interference.
","[{'version': 'v1', 'created': 'Sun, 24 Nov 2013 05:36:53 GMT'}]",2013-12-17,"[['Cvetkovic', 'Zoran', ''], ['Sinn', 'Vincent', '']]","['OFDM', 'robustness', 'pulse-shape design']"
15245,1406.3188,Elisabeth Lex,Elisabeth Lex and Inayat Khan and Horst Bischof and Michael Granitzer,Assessing the Quality of Web Content,"4 pages, ECML/PKDD 2010 Discovery Challenge Workshop",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes our approach towards the ECML/PKDD Discovery Challenge
2010. The challenge consists of three tasks: (1) a Web genre and facet
classification task for English hosts, (2) an English quality task, and (3) a
multilingual quality task (German and French). In our approach, we create an
ensemble of three classifiers to predict unseen Web hosts whereas each
classifier is trained on a different feature set. Our final NDCG on the whole
test set is 0:575 for Task 1, 0:852 for Task 2, and 0:81 (French) and 0:77
(German) for Task 3, which ranks second place in the ECML/PKDD Discovery
Challenge 2010.
","[{'version': 'v1', 'created': 'Thu, 12 Jun 2014 10:40:15 GMT'}]",2014-06-13,"[['Lex', 'Elisabeth', ''], ['Khan', 'Inayat', ''], ['Bischof', 'Horst', ''], ['Granitzer', 'Michael', '']]","['Web Content', 'Information Quality', 'Classification']"
15246,1212.3295,Aaditya Prakash,Aaditya Prakash,Measures of Fault Tolerance in Distributed Simulated Annealing,"4 pages, 2 figures","International Conference on Perspective of Computer Confluence
  with Sciences, pp 111-114, 2012, Excel Publisher",,,cs.DC,http://creativecommons.org/licenses/by/3.0/,"  In this paper, we examine the different measures of Fault Tolerance in a
Distributed Simulated Annealing process. Optimization by Simulated Annealing on
a distributed system is prone to various sources of failure. We analyse
simulated annealing algorithm, its architecture in distributed platform and
potential sources of failures. We examine the behaviour of tolerant distributed
system for optimization task. We present possible methods to overcome the
failures and achieve fault tolerance for the distributed simulated annealing
process. We also examine the implementation of Simulated Annealing in MapReduce
system and possible ways to prevent failures in reaching the global optima.
This paper will be beneficial to those who are interested in implementing a
large scale distributed simulated annealing optimization problem of industrial
or academic interest. We recommend hybrid tolerance technique to optimize the
trade-off between efficiency and availability.
","[{'version': 'v1', 'created': 'Thu, 13 Dec 2012 20:00:40 GMT'}, {'version': 'v2', 'created': 'Sun, 30 Dec 2012 06:07:50 GMT'}]",2013-01-01,"[['Prakash', 'Aaditya', '']]","['Simulated Annealing', 'Distributed Systems', 'Fault Tolerance', 'Optimization', 'MapReduce']"
15247,1505.01594,Saraswati Sahu B,Saraswati B. Sahu,Secure User Authentication & Graphical Password using Cued Click-Points,"5pages,11 figures. arXiv admin note: substantial text overlap with
  http://www.ijareeie.com/upload/2013/july/20_GRAPHICAL.pdf and other sources,
  without attribution",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The major problem of user registration, mostly text base password, is well
known. In the login user be inclined to select simple passwords which is
frequently in mind that are straightforward for attackers to guess, difficult
machine created password mostly complicated to user take in mind. User
authenticate password using cued click points and Persuasive Cued Click Points
graphical password scheme which includes usability and security evaluations.
This paper includes the persuasion to secure user authentication & graphical
password using cued click-points so that users select more random or more
difficult to guess the passwords. In click-based graphical passwords, image or
video frame that provide database to load the image, and then store all
information into database. Mainly passwords are composed of strings which have
letters as well as digits. Example is alpha-numeric type letters and digits.
","[{'version': 'v1', 'created': 'Thu, 7 May 2015 05:52:21 GMT'}]",2015-05-15,"[['Sahu', 'Saraswati B.', '']]","['User Authentication', 'Graphical Password', 'Persuasive Cued Click-Points', 'Cued Click Point']"
15248,1802.08009,Gergely Neu,Gergely Neu and Lorenzo Rosasco,Iterate averaging as regularization for stochastic gradient descent,,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose and analyze a variant of the classic Polyak-Ruppert averaging
scheme, broadly used in stochastic gradient methods. Rather than a uniform
average of the iterates, we consider a weighted average, with weights decaying
in a geometric fashion. In the context of linear least squares regression, we
show that this averaging scheme has a the same regularizing effect, and indeed
is asymptotically equivalent, to ridge regression. In particular, we derive
finite-sample bounds for the proposed approach that match the best known
results for regularized stochastic gradient methods.
","[{'version': 'v1', 'created': 'Thu, 22 Feb 2018 12:27:40 GMT'}]",2018-02-23,"[['Neu', 'Gergely', ''], ['Rosasco', 'Lorenzo', '']]","['stochastic gradient descent', 'least squares', 'regularization', 'Tikhonov regularization']"
15249,1312.3441,Prachi Jain,"Prachi Jain, Ponnurangam Kumaraguru","Call Me MayBe: Understanding Nature and Risks of Sharing Mobile Numbers
  on Online Social Networks",,,,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a great concern about the potential for people to leak private
information on OSNs, but few quantitative studies on this. This research
explores the activity of sharing mobile numbers on OSNs, via public profiles
and posts. We attempt to understand the characteristics and risks of mobile
numbers sharing behaviour on OSNs and focus on Indian mobile numbers. We
collected 76,347 unique mobile numbers posted by 85905 users on Twitter and
Facebook and analysed 2997 numbers, prefixed with +91. We observed, most users
shared their own mobile numbers to spread urgent information; and to market
products and escort business. Fewer female users shared mobile numbers on OSNs.
Users utilized other OSN platforms and third party applications like
Twitterfeed, to post mobile numbers on multiple OSNs. In contrast to the user's
perception of numbers spreading quickly on OSN, we observed that except for
emergency, most numbers did not diffuse deep. To assess risks associated with
mobile numbers exposed on OSNs, we used numbers to gain sensitive information
about their owners (e.g. name, Voter ID) by collating publicly available data
from OSNs, Truecaller, OCEAN. On using the numbers on WhatApp, we obtained a
myriad of sensitive details (relationship status, BBM pins) of the number
owner. We communicated the observed risks to the owners by calling. Few users
were surprised to know about the online presence of their number, while a few
others intentionally posted it online for business purposes. We observed, 38.3%
of users who were unaware of the online presence of their number have posted
their number themselves on the social network. With these observations, we
highlight that there is a need to monitor leakage of mobile numbers via profile
and public posts. To the best of our knowledge, this is the first exploratory
study to critically investigate the exposure of Indian mobile numbers on OSNs.
","[{'version': 'v1', 'created': 'Thu, 12 Dec 2013 10:46:12 GMT'}]",2013-12-13,"[['Jain', 'Prachi', ''], ['Kumaraguru', 'Ponnurangam', '']]","['Online Social Networks', 'Privacy', 'Mobile Number', 'Phone number', 'Risks']"
15250,1305.1477,Luciano Pandolfi,Luciano Pandolfi,Sharp control time for viscoelastic bodys,,,,,cs.SY math.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is now well understood that equations of viscoelasticity can be seen as
perturbation of wave type equations. This observation can be exploited in
several different ways and it turns out that it is a usefull tool when studying
controllability. Here we compare a viscoelastic system which fills a surface of
a solid region (the string case has already been studied) with its memoryless
counterpart (which is a generalized telegraph equation) in order to prove exact
controllability of the viscoelastic body at precisely the same times at which
the telegraph equation is controllable.
  The comparison is done using a moment method approach to controllability and
we prove, using the perturbations theorems of Paley-Wiener and Bari, that a new
sequence derived from the viscoelastic system is a Riesz sequence, a fact that
implies controllability of the viscoelastic system.
  The results so obtained generalize existing controllability results and
furthermore show that the ``sharp'' control time for the telegraph equation and
the viscoelastic system coincide.
","[{'version': 'v1', 'created': 'Tue, 7 May 2013 11:46:35 GMT'}]",2013-05-08,"[['Pandolfi', 'Luciano', '']]","['Controllability and observability', 'integral equations', 'linearsystems', 'partial differential equations', 'heat equations with memory', 'viscoelasticity']"
15251,1504.01561,Zuxuan Wu,"Zuxuan Wu, Xi Wang, Yu-Gang Jiang, Hao Ye, Xiangyang Xue","Modeling Spatial-Temporal Clues in a Hybrid Deep Learning Framework for
  Video Classification",,,,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classifying videos according to content semantics is an important problem
with a wide range of applications. In this paper, we propose a hybrid deep
learning framework for video classification, which is able to model static
spatial information, short-term motion, as well as long-term temporal clues in
the videos. Specifically, the spatial and the short-term motion features are
extracted separately by two Convolutional Neural Networks (CNN). These two
types of CNN-based features are then combined in a regularized feature fusion
network for classification, which is able to learn and utilize feature
relationships for improved performance. In addition, Long Short Term Memory
(LSTM) networks are applied on top of the two features to further model
longer-term temporal clues. The main contribution of this work is the hybrid
learning framework that can model several important aspects of the video data.
We also show that (1) combining the spatial and the short-term motion features
in the regularized fusion network is better than direct classification and
fusion using the CNN with a softmax layer, and (2) the sequence-based LSTM is
highly complementary to the traditional classification strategy without
considering the temporal frame orders. Extensive experiments are conducted on
two popular and challenging benchmarks, the UCF-101 Human Actions and the
Columbia Consumer Videos (CCV). On both benchmarks, our framework achieves
to-date the best reported performance: $91.3\%$ on the UCF-101 and $83.5\%$ on
the CCV.
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2015 11:53:46 GMT'}]",2015-04-08,"[['Wu', 'Zuxuan', ''], ['Wang', 'Xi', ''], ['Jiang', 'Yu-Gang', ''], ['Ye', 'Hao', ''], ['Xue', 'Xiangyang', '']]","['Video Classification', 'Deep Learning', 'CNN', 'LSTM', 'Fusion']"
15252,1701.06357,Yasutada Oohama,Yasutada Oohama,"The Reliability Function for the Additive White Gaussian Noise Channel
  at Rates above the Capacity",11pages,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the additive white Gaussian noise channels. We prove that the
error probability of decoding tends to one exponentially for rates above the
capacity and derive the optimal exponent function. We shall demonstrate that
the information spectrum approach is quite useful for investigating this
problem.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2017 12:30:27 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Jan 2017 04:04:08 GMT'}, {'version': 'v3', 'created': 'Mon, 6 Feb 2017 03:17:59 GMT'}]",2017-02-07,"[['Oohama', 'Yasutada', '']]","['Additive white Gaussian noise channels', 'Strong converse theorem', 'Information spectrum approach']"
15253,0805.4606,Kristina Lerman,Rumi Ghosh and Kristina Lerman,Community Detection using a Measure of Global Influence,"10 pages, submitted to 2008 KDD workshop on Social Network Analysis",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The growing popularity of online social networks has provided researchers
with access to large amount of social network data. This, coupled with the ever
increasing computation speed, storage capacity and data mining capabilities,
led to the renewal of interest in automatic community detection methods.
Surprisingly, there is no universally accepted definition of the community. One
frequently used definition states that ``communities, that have more and/or
better-connected `internal edges' connecting members of the set than `cut
edges' connecting the set to the rest of the world''[Leskovec et al. 20008].
This definition inspired the modularity-maximization class of community
detection algorithms, which look for regions of the network that have higher
than expected density of edges within them. We introduce an alternative
definition which states that a community is composed of individuals who have
more influence on others within the community than on those outside of it. We
present a mathematical formulation of influence, define an influence-based
modularity metric, and show how to use it to partition the network into
communities. We evaluated our approach on the standard data sets used in
literature, and found that it often outperforms the edge-based modularity
algorithm.
","[{'version': 'v1', 'created': 'Thu, 29 May 2008 19:11:17 GMT'}]",2008-12-18,"[['Ghosh', 'Rumi', ''], ['Lerman', 'Kristina', '']]","['community structure', 'automatic detection', 'social networks', 'global influence', 'modularity', 'eigenvectors']"
15254,1704.02158,Jonni Virtema,"Miika Hannula, Juha Kontinen, and Jonni Virtema",Polyteam Semantics,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Team semantics is the mathematical framework of modern logics of dependence
and independence in which formulae are interpreted by sets of assignments
(teams) instead of single assignments as in first-order logic. In order to
deepen the fruitful interplay between team semantics and database dependency
theory, we define ""Polyteam Semantics"" in which formulae are evaluated over a
family of teams. We begin by defining a novel polyteam variant of dependence
atoms and give a finite axiomatisation for the associated implication problem.
We relate polyteam semantics to team semantics and investigate in which cases
logics over the former can be simulated by logics over the latter. We also
characterise the expressive power of poly-dependence logic by properties of
polyteams that are downwards closed and definable in existential second-order
logic (ESO). The analogous result is shown to hold for poly-independence logic
and all ESO-definable properties. We also relate poly-inclusion logic to
greatest fixed point logic.
","[{'version': 'v1', 'created': 'Fri, 7 Apr 2017 09:41:37 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Sep 2017 09:34:05 GMT'}, {'version': 'v3', 'created': 'Thu, 26 Mar 2020 08:21:42 GMT'}]",2020-03-27,"[['Hannula', 'Miika', ''], ['Kontinen', 'Juha', ''], ['Virtema', 'Jonni', '']]","['team semantics', 'dependence', 'independence', 'expressive power', 'existential second-orderlogic']"
15255,1304.6694,Anna Mavroudi,"Anna Mavroudi, Thanasis Hadzilacos",Technical report- Evaluation methodology in the REVIT project,"report on eLearning that describes the evaluation methodology
  followed in the case of the REVIT project (Revitalizing Remote Schools for
  LifeLong Distance elearning, http://revit.cti.gr, Lifelong Learning Programme
  / Transversal Programme / Key Activity 3: ICT -European Commission, EACEA,
  from January 2009 till December 2011)",,,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The purpose of this technical report is to present a methodological approach
for evaluating the REVIT (http://revit.cti.gr) educational venture as a whole
and assessing the learning effectiveness of the resulting collaborative
e-courses.
","[{'version': 'v1', 'created': 'Wed, 24 Apr 2013 18:43:47 GMT'}]",2013-04-25,"[['Mavroudi', 'Anna', ''], ['Hadzilacos', 'Thanasis', '']]","['instructional design', 'evaluation in e-learning', 'distance education', 'e-learning', 'learning effectiveness']"
15256,1602.06209,Qianrui Li,"Qianrui Li, David Gesbert, Nicolas Gresset","Cooperative Channel Estimation for Coordinated Transmission with Limited
  Backhaul","12 pages double columns, 9 figures, accepted by IEEE transaction on
  Wireless Communication",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Obtaining accurate global channel state information (CSI) at multiple
transmitter devices is critical to the performance of many coordinated
transmission schemes. Practical CSI local feedback often leads to noisy and
partial CSI estimates at each transmitter. With rate-limited bi-directional
backhaul, transmitters have the opportunity to exchange few CSI-related bits to
establish global channel state information at transmitter (CSIT). This work
investigates possible strategies towards this goal. We propose a novel
decentralized algorithm that produces minimum mean square error (MMSE)-optimal
global channel estimates at each device from combining local feedback and
information exchanged through backhauls. The method adapts to arbitrary initial
information topologies and feedback noise statistics and can do that with a
combination of closed-form and convex approaches. Simulations for coordinated
multi-point (CoMP) transmission systems with two or three transmitters exhibit
the advantage of the proposed algorithm over conventional CSI exchange
mechanisms when the coordination backhauls are limited.
","[{'version': 'v1', 'created': 'Fri, 19 Feb 2016 16:24:29 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Mar 2017 10:04:23 GMT'}]",2017-03-22,"[['Li', 'Qianrui', ''], ['Gesbert', 'David', ''], ['Gresset', 'Nicolas', '']]","['Decentralized estimation', 'Finite-capacity backhaul', 'Limited feedback', 'Coordination', 'Cooperative communication']"
15257,1111.4552,Sylvain Sen\'e,"Mathilde Noual, Damien Regnault and Sylvain Sen\'e",Non-monotony and Boolean automata networks,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper aims at setting the keystone of a prospective theoretical study on
the role of non-monotone interactions in biological regulation networks.
Focusing on discrete models of these networks, namely, Boolean automata
networks, we propose to analyse the contribution of non-monotony to the
diversity and complexity in their dynamical behaviours. More precisely, in this
paper, we start by detailing some motivations, both mathematical and
biological, for our interest in non-monotony, and we discuss how it may account
for phenomena that cannot be produced by monotony only. Then, to build some
understanding in this direction, we propose some preliminary results on the
dynamical behaviour of some specific non-monotone Boolean automata networks
called XOR circulant networks.
","[{'version': 'v1', 'created': 'Sat, 19 Nov 2011 12:33:09 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Nov 2011 16:01:17 GMT'}]",2011-12-01,"[['Noual', 'Mathilde', ''], ['Regnault', 'Damien', ''], ['Sené', 'Sylvain', '']]","['Discrete dynamical systems', 'Boolean automata networks', 'non-monotony', 'dynamical behaviours']"
15258,0906.1019,Aranyak Mehta,"Gagan Aggarwal, Gagan Goel, Aranyak Mehta",Efficiency of (Revenue-)Optimal Mechanisms,"ACM conference on Electronic Commerce, 2009",,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We compare the expected efficiency of revenue maximizing (or {\em optimal})
mechanisms with that of efficiency maximizing ones. We show that the efficiency
of the revenue maximizing mechanism for selling a single item with k +
log_{e/(e-1)} k + 1 bidders is at least as much as the efficiency of the
efficiency maximizing mechanism with k bidders, when bidder valuations are
drawn i.i.d. from a Monotone Hazard Rate distribution. Surprisingly, we also
show that this bound is tight within a small additive constant of 5.7. In other
words, Theta(log k) extra bidders suffice for the revenue maximizing mechanism
to match the efficiency of the efficiency maximizing mechanism, while o(log k)
do not. This is in contrast to the result of Bulow and Klemperer comparing the
revenue of the two mechanisms, where only one extra bidder suffices. More
precisely, they show that the revenue of the efficiency maximizing mechanism
with k+1 bidders is no less than the revenue of the revenue maximizing
mechanism with k bidders.
  We extend our result for the case of selling t identical items and show that
2.2 log k + t Theta(log log k) extra bidders suffice for the revenue maximizing
mechanism to match the efficiency of the efficiency maximizing mechanism.
  In order to prove our results, we do a classification of Monotone Hazard Rate
(MHR) distributions and identify a family of MHR distributions, such that for
each class in our classification, there is a member of this family that is
pointwise lower than every distribution in that class. This lets us prove
interesting structural theorems about distributions with Monotone Hazard Rate.
","[{'version': 'v1', 'created': 'Thu, 4 Jun 2009 23:21:40 GMT'}]",2009-06-08,"[['Aggarwal', 'Gagan', ''], ['Goel', 'Gagan', ''], ['Mehta', 'Aranyak', '']]","['Auction Design', 'Efficiency', 'VCG', 'Optimal Auctions']"
15259,1306.2252,Nitish Salwan,"Nitish Salwan, Sandeep Singh, Suket Arora, Amarpreet Singh",An Insight to Covert Channels,4 pages,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an overview of different concepts regarding covert
channels. It discusses the various classifications and the detailing of various
fields used to manipulate for the covert channel execution.Different evaluation
criterias are presented for measuring the strength of covert channels. The
defenses and prevention schemes for this covert channel will also be discussed.
This paper also discuss about an advanced timing channel i.e.Temperature Based
Covert Channel.
","[{'version': 'v1', 'created': 'Mon, 10 Jun 2013 17:30:07 GMT'}]",2013-06-11,"[['Salwan', 'Nitish', ''], ['Singh', 'Sandeep', ''], ['Arora', 'Suket', ''], ['Singh', 'Amarpreet', '']]","['Covert Channel', 'Storage Channel', 'Timing Channels', 'Temperature based Covert Channel']"
15260,1704.03396,Shahab Ebrahimi,Shahab Ebrahimi,Source-Sensitive Belief Change,13 pages,"International Journal of Artificial Intelligence and Applications
  (IJAIA), Vol.8, No.2, March 2017",,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The AGM model is the most remarkable framework for modeling belief revision.
However, it is not perfect in all aspects. Paraconsistent belief revision,
multi-agent belief revision and non-prioritized belief revision are three
different extensions to AGM to address three important criticisms applied to
it. In this article, we propose a framework based on AGM that takes a position
in each of these categories. Also, we discuss some features of our framework
and study the satisfiability of AGM postulates in this new context.
","[{'version': 'v1', 'created': 'Tue, 11 Apr 2017 16:20:39 GMT'}, {'version': 'v2', 'created': 'Fri, 5 May 2017 08:44:14 GMT'}]",2017-05-08,"[['Ebrahimi', 'Shahab', '']]","['belief revision', 'the AGM model', 'multi-source belief revision', 'non-prioritized belief revision', 'paraconsistent belief revision', 'the logic PAC']"
15261,1402.0921,Shafi'i Muhammad Abdulhamid Mr,"Olawale Adebayo, Shafii Muhammad Abdulhamid","E- Exams System for Nigerian Universities with Emphasis on Security and
  Result Integrity","12 pages, 3 figures, 1 table. arXiv admin note: text overlap with
  arXiv:1202.3466, arXiv:1202.2516 by other authors","International Journal of the Computer, the Internet and Management
  (IJCIM), Volume 18, Number 2, 2010",,ISSN 0858-7027,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The recent employment and eventual widespread acceptance of electronic test
in examining students and various classes in Nigeria has created a significant
impact in the trends of educational history in the country. In this paper, we
examined the impacts, associated challenges and security lapses of the existing
electronic-examination system with the aim of ameliorating and developing a new
acceptable e-Exam system that takes care of the existing systems challenges and
security lapses. Six Universities that are already conducting e- Examination
were selected across the country for this research work. Twenty students that
participated in the e-exams and five members of staff were selected for
interview and questionnaire. Based on the analysis of the interviews and study
of the existing electronic examination system, some anomalies were discovered
and a new e-exams system was developed to eradicate these anomalies. The new
system uses data encryption in order to protect the questions sent to the
e-Examination center through the internet or intranet and a biometric
fingerprint authentication to screen the stakeholders.
","[{'version': 'v1', 'created': 'Wed, 5 Feb 2014 01:43:43 GMT'}]",2014-02-06,"[['Adebayo', 'Olawale', ''], ['Abdulhamid', 'Shafii Muhammad', '']]","['Biometric Fingerprint', 'Cryptography', 'eLearning', 'Electronic Examination (eexams)', 'Result Integrity']"
15262,0803.0241,Ariel Daliot,"Ariel Daliot, Danny Dolev, and Hanna Parnas","Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker
  Networks","This is the full and revised version. A previous (obsolete) version
  appeared as TR2003-1, The Hebrew University of Jerusalem, 2003","In Proceedings of the Sixth Symposium on Self-Stabilizing Systems
  (SSS'03), San Francisco, June 2003. See also LNCS 2704",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We define the ``Pulse Synchronization'' problem that requires nodes to
achieve tight synchronization of regular pulse events, in the settings of
distributed computing systems. Pulse-coupled synchronization is a phenomenon
displayed by a large variety of biological systems, typically overcoming a high
level of noise. Inspired by such biological models, a robust and
self-stabilizing Byzantine pulse synchronization algorithm for distributed
computer systems is presented. The algorithm attains near optimal
synchronization tightness while tolerating up to a third of the nodes
exhibiting Byzantine behavior concurrently. Pulse synchronization has been
previously shown to be a powerful building block for designing algorithms in
this severe fault model. We have previously shown how to stabilize general
Byzantine algorithms, using pulse synchronization. To the best of our knowledge
there is no other scheme to do this without the use of synchronized pulses.
","[{'version': 'v1', 'created': 'Mon, 3 Mar 2008 13:46:45 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Mar 2008 18:07:32 GMT'}]",2008-03-04,"[['Daliot', 'Ariel', ''], ['Dolev', 'Danny', ''], ['Parnas', 'Hanna', '']]","['Self-stabilization', 'Byzantine faults', 'Distributed algorithms', 'Robustness', 'Pulse synchronization', 'Biological synchronization', 'Biological oscillators']"
15263,1401.1541,Lorna Stewart,Lorna Stewart and Richard Anthony Valenzano,On polygon numbers of circle graphs and distance hereditary graphs,"27 pages, 8 figures",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Circle graphs are intersection graphs of chords in a circle and $k$-polygon
graphs are intersection graphs of chords in a convex $k$-sided polygon where
each chord has its endpoints on distinct sides. The $k$-polygon graphs, for $k
\ge 2$, form an infinite chain of graph classes, each of which contains the
class of permutation graphs. The union of all of those graph classes is the
class of circle graphs. The polygon number $\gp(G)$ of a circle graph $G$ is
the minimum $k$ such that $G$ is a $k$-polygon graph. Given a circle graph $G$
and an integer $k$, determining whether $\gp(G) \le k$ is NP-complete, while
the problem is solvable in polynomial time for fixed $k$.
  In this paper, we show that $\gp(G)$ is always at least as large as the
asteroidal number of $G$, and equal to the asteroidal number of $G$ when $G$ is
a connected distance hereditary graph that is not a clique. This implies that
the classes of distance hereditary permutation graphs and distance hereditary
AT-free graphs are the same, and we give a forbidden subgraph characterization
of that class. We also establish the following upper bounds: $\gp(G)$ is at
most the clique cover number of $G$ if $G$ is not a clique, at most 1 plus the
independence number of $G$, and at most $\lceil n/2 \rceil$ where $n \ge 3$ is
the number of vertices of $G$. Our results lead to linear time algorithms for
finding the minimum number of corners that must be added to a given circle
representation to produce a polygon representation, and for finding the
asteroidal number of a distance hereditary graph, both of which are
improvements over previous algorithms for those problems.
","[{'version': 'v1', 'created': 'Tue, 7 Jan 2014 23:17:25 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Oct 2017 21:38:49 GMT'}]",2017-10-06,"[['Stewart', 'Lorna', ''], ['Valenzano', 'Richard Anthony', '']]","['circle graph', 'k-polygon graph', 'permutation graph', 'distance hereditary graph', 'polygon number', 'asteroidal number']"
15264,1401.6000,Raed Jaberi,Raed Jaberi,On computing the $2$-vertex-connected components of directed graphs,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider the problem of computing the $2$-vertex-connected
components ($2$-vccs) of directed graphs. We present two new algorithms for
solving this problem. The first algorithm runs in $O(mn^{2})$ time, the second
in $O(nm)$ time. Furthermore, we show that the old algorithm of Erusalimskii
and Svetlov runs in $O(nm^{2})$ time. In this paper, we investigate the
relationship between $2$-vccs and dominator trees. We also present an algorithm
for computing the $3$-vertex-connected components ($3$-vccs) of a directed
graph in $O(n^{3}m)$ time, and we show that the $k$-vertex-connected components
($k$-vccs) of a directed graph can be computed in $O(mn^{2k-3})$ time. Finally,
we consider three applications of our new algorithms, which are approximation
algorithms for problems that are generalization of the problem of approximating
the smallest $2$-vertex-connected spanning subgraph of $2$-vertex-connected
directed graph.
","[{'version': 'v1', 'created': 'Thu, 23 Jan 2014 15:22:23 GMT'}]",2014-01-24,"[['Jaberi', 'Raed', '']]","['Graph algorithms', '2-vertex-connected components', 'Strong articulationpoints', 'Approximation algorithms']"
15265,1610.03129,Aditya Tatu Dr.,Aditya Tatu,Tangled Splines,"12 pages, To be sent to a Journal/Conference",,,,cs.CV cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Extracting shape information from object bound- aries is a well studied
problem in vision, and has found tremen- dous use in applications like object
recognition. Conversely, studying the space of shapes represented by curves
satisfying certain constraints is also intriguing. In this paper, we model and
analyze the space of shapes represented by a 3D curve (space curve) formed by
connecting n pieces of quarter of a unit circle. Such a space curve is what we
call a Tangle, the name coming from a toy built on the same principle. We
provide two models for the shape space of n-link open and closed tangles, and
we show that tangles are a subset of trigonometric splines of a certain order.
We give algorithms for curve approximation using open/closed tangles, computing
geodesics on these shape spaces, and to find the deformation that takes one
given tangle to another given tangle, i.e., the Log map. The algorithms
provided yield tangles upto a small and acceptable tolerance, as shown by the
results given in the paper.
","[{'version': 'v1', 'created': 'Mon, 10 Oct 2016 23:31:18 GMT'}]",2016-10-12,"[['Tatu', 'Aditya', '']]","['Tangles', 'Trigonometric splines', 'Implicitlydefined manifolds', 'Shape', 'Space curves', 'Geodesics', 'Exponential map', 'Log map']"
15266,0906.5119,Arnaud Martin,"Arnaud Martin (E3I2), Christophe Osswald (E3I2), Jean Dezert (ONERA),
  Florentin Smarandache (UNM)",General combination rules for qualitative and quantitative beliefs,,"Journal of Advances in Information Fusion 3, 2 (2008) 67-89",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Martin and Osswald \cite{Martin07} have recently proposed many
generalizations of combination rules on quantitative beliefs in order to manage
the conflict and to consider the specificity of the responses of the experts.
Since the experts express themselves usually in natural language with
linguistic labels, Smarandache and Dezert \cite{Li07} have introduced a
mathematical framework for dealing directly also with qualitative beliefs. In
this paper we recall some element of our previous works and propose the new
combination rules, developed for the fusion of both qualitative or quantitative
beliefs.
","[{'version': 'v1', 'created': 'Sun, 28 Jun 2009 08:09:04 GMT'}]",2009-06-30,"[['Martin', 'Arnaud', '', 'E3I2'], ['Osswald', 'Christophe', '', 'E3I2'], ['Dezert', 'Jean', '', 'ONERA'], ['Smarandache', 'Florentin', '', 'UNM']]","['Information fusion', 'belief function theory', 'qualitative beliefs', 'conflict management', 'proportional conflict']"
15267,1003.2700,Agnieszka Lawrynowicz,"Joanna Jozefowska, Agnieszka Lawrynowicz, Tomasz Lukaszewski","The role of semantics in mining frequent patterns from knowledge bases
  in description logics with rules","40 pages, 6 figures, 6 tables",,,RA-01/09,cs.LO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new method for mining frequent patterns in a language that
combines both Semantic Web ontologies and rules. In particular we consider the
setting of using a language that combines description logics with DL-safe
rules. This setting is important for the practical application of data mining
to the Semantic Web. We focus on the relation of the semantics of the
representation formalism to the task of frequent pattern discovery, and for the
core of our method, we propose an algorithm that exploits the semantics of the
combined knowledge base. We have developed a proof-of-concept data mining
implementation of this. Using this we have empirically shown that using the
combined knowledge base to perform semantic tests can make data mining faster
by pruning useless candidate patterns before their evaluation. We have also
shown that the quality of the set of patterns produced may be improved: the
patterns are more compact, and there are fewer patterns. We conclude that
exploiting the semantics of a chosen representation formalism is key to the
design and application of (onto-)relational frequent pattern discovery methods.
Note: To appear in Theory and Practice of Logic Programming (TPLP)
","[{'version': 'v1', 'created': 'Sat, 13 Mar 2010 12:47:46 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Apr 2010 18:20:40 GMT'}]",2015-03-13,"[['Jozefowska', 'Joanna', ''], ['Lawrynowicz', 'Agnieszka', ''], ['Lukaszewski', 'Tomasz', '']]","['frequent pattern discovery', 'ontologies', 'Semantic Web', 'DL-safe rules']"
15268,1606.09349,Yuzhong Xie,"Zhong Ji, Yuzhong Xie, Yanwei Pang, Lei Chen, Zhongfei Zhang",Zero-Shot Learning with Multi-Battery Factor Analysis,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Zero-shot learning (ZSL) extends the conventional image classification
technique to a more challenging situation where the test image categories are
not seen in the training samples. Most studies on ZSL utilize side information
such as attributes or word vectors to bridge the relations between the seen
classes and the unseen classes. However, existing approaches on ZSL typically
exploit a shared space for each type of side information independently, which
cannot make full use of the complementary knowledge of different types of side
information. To this end, this paper presents an MBFA-ZSL approach to embed
different types of side information as well as the visual feature into one
shared space. Specifically, we first develop an algorithm named Multi-Battery
Factor Analysis (MBFA) to build a unified semantic space, and then employ
multiple types of side information in it to achieve the ZSL. The close-form
solution makes MBFA-ZSL simple to implement and efficient to run on large
datasets. Extensive experiments on the popular AwA, CUB, and SUN datasets show
its significant superiority over the state-of-the-art approaches.
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2016 05:32:37 GMT'}]",2016-07-01,"[['Ji', 'Zhong', ''], ['Xie', 'Yuzhong', ''], ['Pang', 'Yanwei', ''], ['Chen', 'Lei', ''], ['Zhang', 'Zhongfei', '']]","['Zero-shot learning', 'Multi-battery factor analysis', 'Imageclassification', 'Attribute', 'Word vector']"
15269,1504.04945,Yadong Zhu,"Yadong Zhu, Yanyan Lan, Jiafeng Guo, Xueqi Cheng",Topic-focused Dynamic Information Filtering in Social Media,,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the quick development of online social media such as twitter or sina
weibo in china, many users usually track hot topics to satisfy their desired
information need. For a hot topic, new opinions or ideas will be continuously
produced in the form of online data stream. In this scenario, how to
effectively filter and display information for a certain topic dynamically,
will be a critical problem. We call the problem as Topic-focused Dynamic
Information Filtering (denoted as TDIF for short) in social media. In this
paper, we start open discussions on such application problems. We first analyze
the properties of the TDIF problem, which usually contains several typical
requirements: relevance, diversity, recency and confidence. Recency means that
users want to follow the recent opinions or news. Additionally, the confidence
of information must be taken into consideration. How to balance these factors
properly in online data stream is very important and challenging. We propose a
dynamic preservation strategy on the basis of an existing feature-based utility
function, to solve the TDIF problem. Additionally, we propose new dynamic
diversity measures, to get a more reasonable evaluation for such application
problems. Extensive exploratory experiments have been conducted on TREC public
twitter dataset, and the experimental results validate the effectiveness of our
approach.
","[{'version': 'v1', 'created': 'Mon, 20 Apr 2015 06:12:06 GMT'}]",2015-04-21,"[['Zhu', 'Yadong', ''], ['Lan', 'Yanyan', ''], ['Guo', 'Jiafeng', ''], ['Cheng', 'Xueqi', '']]","['Data Stream', 'Utility Function', 'Dynamic Preservation Scheme', 'Evaluation']"
15270,1110.6865,Maxim Vashkevich,"Maxim Vashkevich, Marek Parfieniuk and Alexander Petrovsky","FPGA implementation of short critical path CORDIC-based approximation of
  the eight-point DCT","4 pages, 5 figures",,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an efficient approach for multiplierless implementation
for eight-point DCT approximation, which based on coordinate rotation digital
computer (CORDIC) algorithm. The main design objective is to make critical path
of corresponding circuits shorter and reduce the combinational delay of
proposed scheme.
","[{'version': 'v1', 'created': 'Mon, 31 Oct 2011 17:13:25 GMT'}]",2011-11-01,"[['Vashkevich', 'Maxim', ''], ['Parfieniuk', 'Marek', ''], ['Petrovsky', 'Alexander', '']]","['Discrete Cosine Transform', 'CORDIC', 'critical path']"
15271,1712.04755,Loucas Pillaud-Vivien,"Loucas Pillaud-Vivien (SIERRA), Alessandro Rudi (SIERRA), Francis Bach
  (SIERRA)",Exponential convergence of testing error for stochastic gradient methods,,"Conference on Learning Theory (COLT), Jul 2018, Stockholm, Sweden",,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider binary classification problems with positive definite kernels and
square loss, and study the convergence rates of stochastic gradient methods. We
show that while the excess testing loss (squared loss) converges slowly to zero
as the number of observations (and thus iterations) goes to infinity, the
testing error (classification error) converges exponentially fast if low-noise
conditions are assumed.
","[{'version': 'v1', 'created': 'Wed, 13 Dec 2017 13:35:27 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Jun 2018 14:16:39 GMT'}, {'version': 'v3', 'created': 'Fri, 29 Jun 2018 08:09:44 GMT'}, {'version': 'v4', 'created': 'Tue, 20 Nov 2018 11:49:03 GMT'}]",2018-11-21,"[['Pillaud-Vivien', 'Loucas', '', 'SIERRA'], ['Rudi', 'Alessandro', '', 'SIERRA'], ['Bach', 'Francis', '', 'SIERRA']]","['SGD', 'positive-definite kernels', 'margin condition', 'binary classification']"
15272,1605.02038,Daniel Karapetyan Dr,Daniel Karapetyan and Abraham P. Punnen and Andrew J. Parkes,"Markov Chain methods for the bipartite Boolean quadratic programming
  problem",,,,,cs.DS cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the Bipartite Boolean Quadratic Programming Problem (BBQP) which is
an extension of the well known Boolean Quadratic Programming Problem (BQP).
Applications of the BBQP include mining discrete patterns from binary data,
approximating matrices by rank-one binary matrices, computing the cut-norm of a
matrix, and solving optimisation problems such as maximum weight biclique,
bipartite maximum weight cut, maximum weight induced sub-graph of a bipartite
graph, etc. For the BBQP, we first present several algorithmic components,
specifically, hill climbers and mutations, and then show how to combine them in
a high-performance metaheuristic. Instead of hand-tuning a standard
metaheuristic to test the efficiency of the hybrid of the components, we chose
to use an automated generation of a multi-component metaheuristic to save human
time, and also improve objectivity in the analysis and comparisons of
components. For this we designed a new metaheuristic schema which we call
Conditional Markov Chain Search (CMCS). We show that CMCS is flexible enough to
model several standard metaheuristics; this flexibility is controlled by
multiple numeric parameters, and so is convenient for automated generation. We
study the configurations revealed by our approach and show that the best of
them outperforms the previous state-of-the-art BBQP algorithm by several orders
of magnitude. In our experiments we use benchmark instances introduced in the
preliminary version of this paper and described here, which have already become
the de facto standard in the BBQP literature.
","[{'version': 'v1', 'created': 'Fri, 6 May 2016 19:06:56 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Oct 2016 18:44:11 GMT'}]",2016-10-25,"[['Karapetyan', 'Daniel', ''], ['Punnen', 'Abraham P.', ''], ['Parkes', 'Andrew J.', '']]","['artificial intelligence', 'bipartite Boolean quadratic programming', 'automated heuristic configuration', 'benchmark']"
15273,1304.3557,Asmaa Hamo Dr.,Radhwan Y Ameen and Asmaa Y. Hamo,Survey of Server Virtualization,"10 pages 14 figures. arXiv admin note: text overlap with
  arXiv:1010.3233 by other authors",,,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Virtualization is a term that refers to the abstraction of computer
resources. The purpose of virtual computing environment is to improve resource
utilization by providing a unified integrated operating platform for users and
applications based on aggregation of heterogeneous and autonomous resources.
More recently, virtualization at all levels (system, storage, and network)
became important again as a way to improve system security, reliability and
availability, reduce costs, and provide greater flexibility. Virtualization has
rapidly become a go-to technology for increasing efficiency in the data center.
With virtualization technologies providing tremendous flexibility, even
disparate architectures may be deployed on a single machine without
interference This paper explains the basics of server virtualization and
addresses pros and cons of virtualization
","[{'version': 'v1', 'created': 'Fri, 12 Apr 2013 07:33:42 GMT'}]",2013-04-15,"[['Ameen', 'Radhwan Y', ''], ['Hamo', 'Asmaa Y.', '']]","['virtualization', 'server', 'hypervisor', 'Virtual']"
15274,1005.0766,Vincent Tan,"Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky","Learning High-Dimensional Markov Forest Distributions: Analysis of Error
  Rates",Accepted to the Journal of Machine Learning Research (Feb 2011),,,,cs.IT math.IT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of learning forest-structured discrete graphical models from
i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu
tree through adaptive thresholding is proposed. It is shown that this algorithm
is both structurally consistent and risk consistent and the error probability
of structure learning decays faster than any polynomial in the number of
samples under fixed model size. For the high-dimensional scenario where the
size of the model d and the number of edges k scale with the number of samples
n, sufficient conditions on (n,d,k) are given for the algorithm to satisfy
structural and risk consistencies. In addition, the extremal structures for
learning are identified; we prove that the independent (resp. tree) model is
the hardest (resp. easiest) to learn using the proposed algorithm in terms of
error rates for structure learning.
","[{'version': 'v1', 'created': 'Wed, 5 May 2010 14:41:06 GMT'}, {'version': 'v2', 'created': 'Sun, 13 Feb 2011 02:19:59 GMT'}]",2011-02-15,"[['Tan', 'Vincent Y. F.', ''], ['Anandkumar', 'Animashree', ''], ['Willsky', 'Alan S.', '']]","['Graphical models', 'Forest distributions', 'Structural consistency', 'Risk consistency', 'Method of types']"
15275,1402.1880,Ayad Ghany Ismaeel,"Ayad Ghany Ismaeel, Dina Y. Mikhail","Design of Locally E-management System for Technical Education
  Foundation- Erbil","11 pages, 11 figures, 1 tables","PolyTechnic, Vol. 1, No. 1, Oct. 2011, National Journal,
  Erbil-IRAQ",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Until now, there is no e-management and automation necessary for the
operations or procedures of the departments in the Technical Education
Foundation Erbil, and the foundation like any other organization in Kurdistan
region is not connected to the network, because there is not infrastructure for
that purpose. To solve this problem, comes the proposal DLMS4TEF, which
requirements are divided into hardware and software, as hardware will need
Fast-Ethernet (LAN) technology to connect the departments of the Foundation via
Client-Server network later, when an infrastructure is established for
e-governments or e-management, it may be extended to the campus network. The
software is represented by installing windows server to implement the proposal
design of DLMS4TEF, PHP script is used as web programming that supports the
server, where as the HTML and JavaScript are used to support the client side.
The dynamic DLMS4TEF will be based on relational database, which is created by
using MySQL, to support processing hundreds of queries per second, and the
Kurdish Unicode to support Kurdish fonts of GUI's, Moreover, for security
DLMS4TEF allows each department in the Foundation to enter its own section and
prevent accessing other sections by using HTAccessible program which allows the
user to access by using his IP address and his computer only. The important
conclusions and advantages of applying DLMS4TEF are making backup to DLMS4TEF's
databases using the option (zipped) which allows them to reach the size of (3%)
of the original database size, sufficient security techniques, through
achieving levels of security, hidden access to the administrator section, and
finally DLMS4TEF, when compared with the traditional methods and project of
Oman, shows the same efficiency of some, if not better, features of Oman.
Keywords- E-management, Client-Server network, Fast-Ethernet, PHP, MySQL
","[{'version': 'v1', 'created': 'Sat, 8 Feb 2014 19:29:33 GMT'}]",2014-02-12,"[['Ismaeel', 'Ayad Ghany', ''], ['Mikhail', 'Dina Y.', '']]","['E-management', 'Client/Server network', 'Fast-Ethernet', 'PHP', 'MySQL']"
15276,1605.02066,Vage Taamazyan,"Vage Taamazyan, Achuta Kadambi, Ramesh Raskar",Shape from Mixed Polarization,"13 pages, 5 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Shape from Polarization (SfP) estimates surface normals using photos captured
at different polarizer rotations. Fundamentally, the SfP model assumes that
light is reflected either diffusely or specularly. However, this model is not
valid for many real-world surfaces exhibiting a mixture of diffuse and specular
properties. To address this challenge, previous methods have used a sequential
solution: first, use an existing algorithm to separate the scene into diffuse
and specular components, then apply the appropriate SfP model. In this paper,
we propose a new method that jointly uses viewpoint and polarization data to
holistically separate diffuse and specular components, recover refractive
index, and ultimately recover 3D shape. By involving the physics of
polarization in the separation process, we demonstrate competitive results with
a benchmark method, while recovering additional information (e.g. refractive
index).
","[{'version': 'v1', 'created': 'Fri, 6 May 2016 01:03:11 GMT'}, {'version': 'v2', 'created': 'Sat, 11 Jun 2016 11:56:26 GMT'}]",2016-06-14,"[['Taamazyan', 'Vage', ''], ['Kadambi', 'Achuta', ''], ['Raskar', 'Ramesh', '']]","['Shape from Polarization', 'Separating Reflection Components', 'Refractive Index Estimation', 'Polarized 3D']"
15277,1605.02097,Wojciech Ja\'skowski,"Micha{\l} Kempka, Marek Wydmuch, Grzegorz Runc, Jakub Toczek and
  Wojciech Ja\'skowski","ViZDoom: A Doom-based AI Research Platform for Visual Reinforcement
  Learning",,"Proceedings of IEEE Conference of Computational Intelligence in
  Games 2016",,,cs.LG cs.AI cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The recent advances in deep neural networks have led to effective
vision-based reinforcement learning methods that have been employed to obtain
human-level controllers in Atari 2600 games from pixel data. Atari 2600 games,
however, do not resemble real-world tasks since they involve non-realistic 2D
environments and the third-person perspective. Here, we propose a novel
test-bed platform for reinforcement learning research from raw visual
information which employs the first-person perspective in a semi-realistic 3D
world. The software, called ViZDoom, is based on the classical first-person
shooter video game, Doom. It allows developing bots that play the game using
the screen buffer. ViZDoom is lightweight, fast, and highly customizable via a
convenient mechanism of user scenarios. In the experimental part, we test the
environment by trying to learn bots for two scenarios: a basic move-and-shoot
task and a more complex maze-navigation problem. Using convolutional deep
neural networks with Q-learning and experience replay, for both scenarios, we
were able to train competent bots, which exhibit human-like behaviors. The
results confirm the utility of ViZDoom as an AI research platform and imply
that visual reinforcement learning in 3D realistic first-person perspective
environments is feasible.
","[{'version': 'v1', 'created': 'Fri, 6 May 2016 20:46:34 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Sep 2016 19:12:49 GMT'}]",2016-09-21,"[['Kempka', 'Michał', ''], ['Wydmuch', 'Marek', ''], ['Runc', 'Grzegorz', ''], ['Toczek', 'Jakub', ''], ['Jaśkowski', 'Wojciech', '']]","['video games', 'visual-based reinforcement learning', 'deep reinforcement learning', 'first-person perspective games', 'FPS', 'visual learning', 'neural networks']"
15278,1402.1718,Nicolas Courtois,"Nicolas T. Courtois, Lear Bahack","On Subversive Miner Strategies and Block Withholding Attack in Bitcoin
  Digital Currency",not published elsewhere,,,,cs.CR cs.CE cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bitcoin is a ""crypto currency"", a decentralized electronic payment scheme
based on cryptography. Bitcoin economy grows at an incredibly fast rate and is
now worth some 10 billions of dollars. Bitcoin mining is an activity which
consists of creating (minting) the new coins which are later put into
circulation. Miners spend electricity on solving cryptographic puzzles and they
are also gatekeepers which validate bitcoin transactions of other people.
Miners are expected to be honest and have some incentives to behave well.
However. In this paper we look at the miner strategies with particular
attention paid to subversive and dishonest strategies or those which could put
bitcoin and its reputation in danger. We study in details several recent
attacks in which dishonest miners obtain a higher reward than their relative
contribution to the network. In particular we revisit the concept of block
withholding attacks and propose a new concrete and practical block withholding
attack which we show to maximize the advantage gained by rogue miners.
  RECENT EVENTS: it seems that the attack was recently executed, see Section
XI-A.
","[{'version': 'v1', 'created': 'Tue, 28 Jan 2014 13:54:02 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Feb 2014 14:20:19 GMT'}, {'version': 'v3', 'created': 'Sun, 16 Mar 2014 12:11:10 GMT'}, {'version': 'v4', 'created': 'Sun, 6 Jul 2014 23:14:56 GMT'}, {'version': 'v5', 'created': 'Tue, 2 Dec 2014 16:45:26 GMT'}]",2014-12-03,"[['Courtois', 'Nicolas T.', ''], ['Bahack', 'Lear', '']]","['electronic payment', 'crypto currencies', 'bitcoin', 'bitcoin mining', 'mining pools', 'game theory']"
15279,1602.07967,Abuzer Yakaryilmaz,Aleksandrs Belovs and Juan Andres Montoya and Abuzer Yakary{\i}lmaz,Can one quantum bit separate any pair of words with zero-error?,17 pages!,,,,cs.FL cs.CC quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Determining the minimum number of states required by a finite automaton to
separate a given pair of different words is an important problem. In this
paper, we consider this problem for quantum automata (QFAs). We show that
2-state QFAs can separate any pair of words in nondeterministic acceptance mode
and conjecture that they can separate any pair also with zero-error. Then, we
focus on (a more general problem) separating a pair of two disjoint finite set
of words. We show that QFAs can separate them efficiently in nondeterministic
acceptance mode, i.e. the number of states is two to the power of the size of
the small set. Additionally, we examine affine finite automata (AfAs) and show
that two states are enough to separate any pair with zero-error. Moreover, AfAs
can separate any pair of disjoint finite sets of words with one-sided bounded
error efficiently like QFAs in nondeterministic mode.
","[{'version': 'v1', 'created': 'Thu, 25 Feb 2016 15:38:12 GMT'}]",2016-02-26,"[['Belovs', 'Aleksandrs', ''], ['Montoya', 'Juan Andres', ''], ['Yakaryılmaz', 'Abuzer', '']]","['quantum finite automaton', 'affine finite automaton', 'zero–error', 'bounded–error', 'nondeterminism', 'promise problems', 'succinctness']"
15280,1710.05661,Marc Aiguier,Marc Aiguier and Isabelle Bloch,"Dual Logic Concepts based on Mathematical Morphology in Stratified
  Institutions: Applications to Spatial Reasoning",36 pages,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several logical operators are defined as dual pairs, in different types of
logics. Such dual pairs of operators also occur in other algebraic theories,
such as mathematical morphology. Based on this observation, this paper proposes
to define, at the abstract level of institutions, a pair of abstract dual and
logical operators as morphological erosion and dilation. Standard quantifiers
and modalities are then derived from these two abstract logical operators.
These operators are studied both on sets of states and sets of models. To cope
with the lack of explicit set of states in institutions, the proposed abstract
logical dual operators are defined in an extension of institutions, the
stratified institutions, which take into account the notion of open sentences,
the satisfaction of which is parametrized by sets of states. A hint on the
potential interest of the proposed framework for spatial reasoning is also
provided.
","[{'version': 'v1', 'created': 'Mon, 16 Oct 2017 12:50:03 GMT'}]",2017-10-17,"[['Aiguier', 'Marc', ''], ['Bloch', 'Isabelle', '']]","['Stratified institutions', 'mathematical morphology', 'dual operators', 'dilation', 'erosion', 'states', 'spatial reasoning']"
15281,1409.6365,Edward Lee,"Konstantinos Georgiou, Andy Jiang, Edward Lee, Astrid A. Olave, Ian
  Seong, Twesh Upadhyaya",Lift & Project Systems Performing on the Partial-Vertex-Cover Polytope,26 pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study integrality gap (IG) lower bounds on strong LP and SDP relaxations
derived by the Sherali-Adams (SA), Lovasz-Schrijver-SDP (LS+), and
Sherali-Adams-SDP (SA+) lift-and-project (L&P) systems for the
t-Partial-Vertex-Cover (t-PVC) problem, a variation of the classic Vertex-Cover
problem in which only t edges need to be covered. t-PVC admits a
2-approximation using various algorithmic techniques, all relying on a natural
LP relaxation. Starting from this LP relaxation, our main results assert that
for every epsilon > 0, level-Theta(n) LPs or SDPs derived by all known L&P
systems that have been used for positive algorithmic results (but the Lasserre
hierarchy) have IGs at least (1-epsilon)n/t, where n is the number of vertices
of the input graph. Our lower bounds are nearly tight.
  Our results show that restricted yet powerful models of computation derived
by many L&P systems fail to witness c-approximate solutions to t-PVC for any
constant c, and for t = O(n). This is one of the very few known examples of an
intractable combinatorial optimization problem for which LP-based algorithms
induce a constant approximation ratio, still lift-and-project LP and SDP
tightenings of the same LP have unbounded IGs.
  We also show that the SDP that has given the best algorithm known for t-PVC
has integrality gap n/t on instances that can be solved by the level-1 LP
relaxation derived by the LS system. This constitutes another rare phenomenon
where (even in specific instances) a static LP outperforms an SDP that has been
used for the best approximation guarantee for the problem at hand. Finally, one
of our main contributions is that we make explicit of a new and simple
methodology of constructing solutions to LP relaxations that almost trivially
satisfy constraints derived by all SDP L&P systems known to be useful for
algorithmic positive results (except the La system).
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 22:39:31 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Apr 2019 16:05:46 GMT'}, {'version': 'v3', 'created': 'Mon, 16 Mar 2020 18:53:53 GMT'}]",2020-03-18,"[['Georgiou', 'Konstantinos', ''], ['Jiang', 'Andy', ''], ['Lee', 'Edward', ''], ['Olave', 'Astrid A.', ''], ['Seong', 'Ian', ''], ['Upadhyaya', 'Twesh', '']]","['Partial vertex cover', 'combinatorial optimization', 'linear programming', 'semidefinite programming', 'lift and project systems', 'integrality gaps']"
15282,1802.06893,Edouard Grave,"Edouard Grave, Piotr Bojanowski, Prakhar Gupta, Armand Joulin, Tomas
  Mikolov",Learning Word Vectors for 157 Languages,Accepted to LREC,,,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed word representations, or word vectors, have recently been applied
to many tasks in natural language processing, leading to state-of-the-art
performance. A key ingredient to the successful application of these
representations is to train them on very large corpora, and use these
pre-trained models in downstream tasks. In this paper, we describe how we
trained such high quality word representations for 157 languages. We used two
sources of data to train these models: the free online encyclopedia Wikipedia
and data from the common crawl project. We also introduce three new word
analogy datasets to evaluate these word vectors, for French, Hindi and Polish.
Finally, we evaluate our pre-trained word vectors on 10 languages for which
evaluation datasets exists, showing very strong performance compared to
previous models.
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 22:32:47 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Mar 2018 18:00:30 GMT'}]",2018-03-30,"[['Grave', 'Edouard', ''], ['Bojanowski', 'Piotr', ''], ['Gupta', 'Prakhar', ''], ['Joulin', 'Armand', ''], ['Mikolov', 'Tomas', '']]","['word vectors', 'word analogies', 'fasttext']"
15283,1209.5160,Michael Monagan,Michael Monagan,"A new edge selection heuristic for computing the Tutte polynomial of an
  undirected graph","11 pages, 7 figures, 9 tables, to appear in the proceedings of FPSAC
  2012",,,,cs.DM cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new edge selection heuristic and vertex ordering heuristic that
together enable one to compute the Tutte polynomial of much larger sparse
graphs than was previously doable. As a specific example, we are able to
compute the Tutte polynomial of the truncated icosahedron graph using our Maple
implementation in under 4 minutes on a single CPU. This compares with a recent
result of Haggard, Pearce and Royle whose special purpose C++ software took one
week on 150 computers.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2012 06:38:22 GMT'}]",2012-09-25,"[['Monagan', 'Michael', '']]","['Tutte polynomials', 'edge deletion and contraction algorithms', 'NP-hard problems']"
15284,1005.2603,Andri Mirzal,Andri Mirzal and Masashi Furukawa,"Eigenvectors for clustering: Unipartite, bipartite, and directed graph
  cases","9 pages, no figure, to appear in ICEIE 2010",,,,cs.LG math.SP,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper presents a concise tutorial on spectral clustering for broad
spectrum graphs which include unipartite (undirected) graph, bipartite graph,
and directed graph. We show how to transform bipartite graph and directed graph
into corresponding unipartite graph, therefore allowing a unified treatment to
all cases. In bipartite graph, we show that the relaxed solution to the $K$-way
co-clustering can be found by computing the left and right eigenvectors of the
data matrix. This gives a theoretical basis for $K$-way spectral co-clustering
algorithms proposed in the literatures. We also show that solving row and
column co-clustering is equivalent to solving row and column clustering
separately, thus giving a theoretical support for the claim: ``column
clustering implies row clustering and vice versa''. And in the last part, we
generalize the Ky Fan theorem---which is the central theorem for explaining
spectral clustering---to rectangular complex matrix motivated by the results
from bipartite graph analysis.
","[{'version': 'v1', 'created': 'Fri, 14 May 2010 18:52:24 GMT'}, {'version': 'v2', 'created': 'Mon, 17 May 2010 06:19:08 GMT'}, {'version': 'v3', 'created': 'Mon, 24 May 2010 08:17:11 GMT'}, {'version': 'v4', 'created': 'Sat, 12 Jun 2010 03:02:35 GMT'}, {'version': 'v5', 'created': 'Mon, 12 Jul 2010 13:38:57 GMT'}]",2010-07-13,"[['Mirzal', 'Andri', ''], ['Furukawa', 'Masashi', '']]","['eigenvectors', 'graph clustering', 'Ky Fan theorem', 'spectral methods']"
15285,1008.1324,Zeeshan Ahmed Mr.,Zeeshan Ahmed,Statistical Trading Using Target Oriented Trading Agent,"In Proceedings of 4th International Statistical Conference May 9-11,
  Vol. 16, 355-358, ISBN 978-969-8858-04-9, 2008",,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article we briefly present our contributions toward Trading Agent
Competition (TAC); an international forum for promotion of research into the
trading agent problems. Moreover, we present some strategies proposed and used
in the development of our TAC Agent and resultant brief information after its
participation in a real time trading environment. In the end we conclude with
needed improvements and future recommendations.
","[{'version': 'v1', 'created': 'Sat, 7 Aug 2010 11:29:41 GMT'}]",2010-08-10,"[['Ahmed', 'Zeeshan', '']]","['Trading Agent Competition', 'TAC Classic', 'utility', 'preferences', 'autonomous competing software agents']"
15286,1505.04424,Mrinal Haloi,Mrinal Haloi,Improved Microaneurysm Detection using Deep Neural Networks,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we propose a novel microaneurysm (MA) detection for early
diabetic retinopathy screening using color fundus images. Since MA usually the
first lesions to appear as an indicator of diabetic retinopathy, accurate
detection of MA is necessary for treatment. Each pixel of the image is
classified as either MA or non-MA using a deep neural network with dropout
training procedure using maxout activation function. No preprocessing step or
manual feature extraction is required. Substantial improvements over standard
MA detection method based on the pipeline of preprocessing, feature extraction,
classification followed by post processing is achieved. The presented method is
evaluated in publicly available Retinopathy Online Challenge (ROC) and
Diaretdb1v2 database and achieved state-of-the-art accuracy.
","[{'version': 'v1', 'created': 'Sun, 17 May 2015 17:37:14 GMT'}, {'version': 'v2', 'created': 'Sun, 17 Jul 2016 10:07:40 GMT'}]",2016-07-19,"[['Haloi', 'Mrinal', '']]","['Diabetic Ratinopathy', 'deep neural network', 'microaneurysms']"
15287,1701.07395,Christian Reul,"Christian Reul, Marco Dittrich, and Martin Gruner","Case Study of a highly automated Layout Analysis and OCR of an
  incunabulum: 'Der Heiligen Leben' (1488)",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper provides the first thorough documentation of a high quality
digitization process applied to an early printed book from the incunabulum
period (1450-1500). The entire OCR related workflow including preprocessing,
layout analysis and text recognition is illustrated in detail using the example
of 'Der Heiligen Leben', printed in Nuremberg in 1488. For each step the
required time expenditure was recorded. The character recognition yielded
excellent results both on character (97.57%) and word (92.19%) level.
Furthermore, a comparison of a highly automated (LAREX) and a manual (Aletheia)
method for layout analysis was performed. By considerably automating the
segmentation the required human effort was reduced significantly from over 100
hours to less than six hours, resulting in only a slight drop in OCR accuracy.
Realistic estimates for the human effort necessary for full text extraction
from incunabula can be derived from this study. The printed pages of the
complete work together with the OCR result is available online ready to be
inspected and downloaded.
","[{'version': 'v1', 'created': 'Fri, 20 Jan 2017 15:37:01 GMT'}]",2017-01-26,"[['Reul', 'Christian', ''], ['Dittrich', 'Marco', ''], ['Gruner', 'Martin', '']]","['Optical Character Recognition', 'Segmentation', 'Early Printed Books']"
15288,1109.3318,Dan-Cristian Tomozei,"Dan-Cristian Tomozei, Laurent Massouli\'e",Distributed User Profiling via Spectral Methods,31 pages,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  User profiling is a useful primitive for constructing personalised services,
such as content recommendation. In the present paper we investigate the
feasibility of user profiling in a distributed setting, with no central
authority and only local information exchanges between users. We compute a
profile vector for each user (i.e., a low-dimensional vector that characterises
her taste) via spectral transformation of observed user-produced ratings for
items. Our two main contributions follow: i) We consider a low-rank
probabilistic model of user taste. More specifically, we consider that users
and items are partitioned in a constant number of classes, such that users and
items within the same class are statistically identical. We prove that without
prior knowledge of the compositions of the classes, based solely on few random
observed ratings (namely $O(N\log N)$ such ratings for $N$ users), we can
predict user preference with high probability for unrated items by running a
local vote among users with similar profile vectors. In addition, we provide
empirical evaluations characterising the way in which spectral profiling
performance depends on the dimension of the profile space. Such evaluations are
performed on a data set of real user ratings provided by Netflix. ii) We
develop distributed algorithms which provably achieve an embedding of users
into a low-dimensional space, based on spectral transformation. These involve
simple message passing among users, and provably converge to the desired
embedding. Our method essentially relies on a novel combination of gossiping
and the algorithm proposed by Oja and Karhunen.
","[{'version': 'v1', 'created': 'Thu, 15 Sep 2011 11:31:31 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Apr 2013 09:11:23 GMT'}]",2015-03-19,"[['Tomozei', 'Dan-Cristian', ''], ['Massoulié', 'Laurent', '']]","['Spectral Decomposition Random Matrix', 'Message Passing', 'Distributed Spectral Embedding', 'Distributed Recommendation System']"
15289,1307.6406,Bijay Paikaray,Bijay Paikaray,"Relative Performance of a Multi-level Cache with Last-Level Cache
  Replacement: An Analytic Review",,,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current day processors employ multi-level cache hierarchy with one or two
levels of private caches and a shared last-level cache (LLC). An efficient
cache replacement policy at LLC is essential for reducing the off-chip memory
transfer as well as conflict for memory bandwidth. Cache replacement techniques
for inclusive LLCs may not be efficient for multilevel cache as it can be
shared by enormous applications with varying access behavior, running
simultaneously. One application may dominate another by flooding of cache
requests and evicting the useful data of the other application. From the
performance point of view, an exclusive LLC make the replacement policies more
demanding, as compared to an inclusive LLC. This paper analyzes some of the
existing replacement techniques on the LLC with their performance assessment.
","[{'version': 'v1', 'created': 'Wed, 24 Jul 2013 13:09:43 GMT'}]",2013-07-25,"[['Paikaray', 'Bijay', '']]","['Cache Performance', 'Multi-Level Cache', 'Last Level Cache (LLC)']"
15290,1602.07884,Surafel Tilahun,Surafel Luleseged Tilahun and Jean Medard T Ngnotchouye,"Firefly Algorithm for optimization problems with non-continuous
  variables: A Review and Analysis",,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Firefly algorithm is a swarm based metaheuristic algorithm inspired by the
flashing behavior of fireflies. It is an effective and an easy to implement
algorithm. It has been tested on different problems from different disciplines
and found to be effective. Even though the algorithm is proposed for
optimization problems with continuous variables, it has been modified and used
for problems with non-continuous variables, including binary and integer valued
problems. In this paper a detailed review of this modifications of firefly
algorithm for problems with non-continuous variables will be discussed. The
strength and weakness of the modifications along with possible future works
will be presented.
","[{'version': 'v1', 'created': 'Thu, 25 Feb 2016 11:04:09 GMT'}]",2016-02-26,"[['Tilahun', 'Surafel Luleseged', ''], ['Ngnotchouye', 'Jean Medard T', '']]","['Firefly algorithm', 'optimization', 'bio-inspired algorithm', 'discrete']"
15291,1208.5875,Priyanka Rahi,"Priyanka Rahi (Department of Computer Science H.P. University, Shimla,
  H.P., India)",Business Intelligence: A Rapidly Growing Option through Web Mining,"8 pages, 2 figure, 2 tables. arXiv admin note: text overlap with
  arXiv:cs/0405030 by other authors",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The World Wide Web is a popular and interactive medium to distribute
information in this scenario. The web is huge, diverse, ever changing, widely
disseminated global information service center. We are familiar with terms like
e-commerce, e-governance, e-market, e-finance, e-learning, e-banking etc. for
an organization it is new challenge to maintain direct contact with customers
because of the rapid growth in e-commerce, e-publishing and electronic service
delivery. To deal with this there is need of intelligent marketing strategies
and CRM (customer relationship management) i.e. the effective way of
integrating enterprise applications in real time. Web mining is the vast field
that helps to understand various concepts of different fields. Web usage mining
techniques are attempted to reason about different materialized issues of
Business Intelligence which include marketing expertise as domain knowledge and
are specifically designed for electronic commerce purposes. To this end, the
chapter provides an introduction to the field of Web mining and examines
existing as well as potential Web mining applications applicable for different
business function, like marketing, human resources, and fiscal administration.
Suggestions for improving information technology infrastructure are made, which
can help businesses interested in Web mining hit the ground running.
","[{'version': 'v1', 'created': 'Wed, 29 Aug 2012 10:14:46 GMT'}]",2012-08-30,"[['Rahi', 'Priyanka', '', 'Department of Computer Science H.P. University, Shimla,\n  H.P., India']]","['Business Intelligence', 'CRM', 'e-Commerce', 'e-publishing', 'Web mining', 'Web usage mining']"
15292,1110.5712,Loet Leydesdorff,Loet Leydesdorff and Lutz Bornmann,Mapping (USPTO) Patent Data using Overlays to Google Maps,"Journal of the American Society for Information Science and
  Technology (in press)",,,,cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A technique is developed using patent information available online (at the US
Patent and Trademark Office) for the generation of Google Maps. The overlays
indicate both the quantity and quality of patents at the city level. This
information is relevant for research questions in technology analysis,
innovation studies and evolutionary economics, as well as economic geography.
The resulting maps can also be relevant for technological innovation policies
and R&D management, because the US market can be considered the leading market
for patenting and patent competition. In addition to the maps, the routines
provide quantitative data about the patents for statistical analysis. The
cities on the map are colored according to the results of significance tests.
The overlays are explored for the Netherlands as a ""national system of
innovations,"" and further elaborated in two cases of emerging technologies:
""RNA interference"" and ""nanotechnology.""
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2011 06:55:24 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Jan 2012 09:01:23 GMT'}, {'version': 'v3', 'created': 'Thu, 9 Feb 2012 08:59:01 GMT'}]",2012-02-10,"[['Leydesdorff', 'Loet', ''], ['Bornmann', 'Lutz', '']]","['patent', 'map', 'overlay', 'invention', 'innovation', 'Google', 'USPTO']"
15293,1312.3910,Petr Jancar,Petr Jancar,Bisimulation equivalence of first-order grammars is Ackermann-hard,,,,,cs.LO cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bisimulation equivalence (or bisimilarity) of first-order grammars is
decidable, as follows from the decidability result by Senizergues (1998, 2005)
that has been given in an equivalent framework of equational graphs with finite
out-degree, or of pushdown automata (PDA) with only deterministic and popping
epsilon-transitions. Benedikt, Goeller, Kiefer, and Murawski (2013) have shown
that the bisimilarity problem for PDA (even) without epsilon-transitions is
nonelementary. Here we show Ackermann-hardness for bisimilarity of first-order
grammars. The grammars do not use explicit epsilon-transitions, but they
correspond to the above mentioned PDA with (deterministic and popping)
epsilon-transitions, and this feature is substantial in the presented
lower-bound proof. The proof is based on a (polynomial) reduction from the
reachability problem of reset (or lossy) counter machines, for which the
Ackermann-hardness has been shown by Schnoebelen (2010); in fact, this
reachability problem is known to be Ackermann-complete in the hierarchy of
fast-growing complexity classes defined by Schmitz (2013).
","[{'version': 'v1', 'created': 'Fri, 13 Dec 2013 19:19:42 GMT'}]",2013-12-16,"[['Jancar', 'Petr', '']]","['first-order grammar', 'term rewriting', 'pushdown automaton', 'bisimulation', 'complexity']"
15294,1802.09182,Rob van Glabbeek,Rob van Glabbeek,"On the Validity of Encodings of the Synchronous in the Asynchronous
  $\pi$-calculus","Various minor improvements following IPL refereeing. Section 5 does
  not appear in IPL",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Process calculi may be compared in their expressive power by means of
encodings between them. A widely accepted definition of what constitutes a
valid encoding for (dis)proving relative expressiveness results between process
calculi was proposed by Gorla. Prior to this work, diverse encodability and
separation results were generally obtained using distinct, and often
incompatible, quality criteria on encodings.
  Textbook examples of valid encoding are the encodings proposed by Boudol and
by Honda & Tokoro of the synchronous choice-free $\pi$-calculus into its
asynchronous fragment, illustrating that the latter is no less expressive than
the former. Here I formally establish that these encodings indeed satisfy
Gorla's criteria.
","[{'version': 'v1', 'created': 'Mon, 26 Feb 2018 06:58:39 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Apr 2018 07:28:40 GMT'}]",2018-04-27,"[['van Glabbeek', 'Rob', '']]","['process calculi', 'expressiveness', 'quality criteria for encodings', 'valid encoding', 'π-calculus']"
15295,1005.4563,Isabel Rodet,"Claire Guilbaud (ICA), Annie Luciani (ACROE), Nicolas Castagn\'e
  (ACROE)","Physically-based particle simulation and visualization of pastes and
  gels","Graphicon 2003, Moscou : Russie, F\'ed\'eration De (2003)",,,,cs.GR physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is focused on the question of simulation and visualiza- tion of 3D
gel and paste dynamic effects. In a first part, we introduce a 3D physically
based particle (or mass-interaction) model, with a small number of masses and
few powerful interaction parameters, which is able to generate the dynamic
features of both gels and pastes. This model proves that the 3D
mass-interaction method is relevant for the simulation of such phenomena,
without an explicit knowledge of their underly- ing physics. In a second part,
we expose an original rendering process, the Flow Structuring Method that
enhances the dynamic properties of the simulation and offers a realistic
visualization. This process ignores all the properties of the underlying
physical model. It leads to a reconstruction of the spatial structure of the
gel (or paste) flow only through an analysis of the output of the simula- tion
which is a set of unorganized points moving in a 3D space. Finally, the paper
presents realistic renderings obtained by using implicit surfaces and
ray-tracing techniques on the Structured Flow previously obtained.
","[{'version': 'v1', 'created': 'Tue, 25 May 2010 13:14:11 GMT'}]",2010-05-31,"[['Guilbaud', 'Claire', '', 'ICA'], ['Luciani', 'Annie', '', 'ACROE'], ['Castagné', 'Nicolas', '', 'ACROE']]","['Computer animation', 'physically-based particle models', 'natural phenomena', 'pastes and gels', 'visualization of an unorganized set of points']"
15296,1402.2379,Reena Philips Mrs,"Sangita Gupta, Suma V",Enhancing Human Aspect of Software Engineering using Bayesian Classifier,"5 Pages, 2 Figures. arXiv admin note: substantial text overlap with
  arXiv:1104.4163, arXiv:1201.3418 by other authors","International Journal of Cognitive Science, Engineering, and
  Technology Volume 1, Issue 1, November 2013 ISSN 2347 8047",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  IT industries in current scenario have to struggle effectively in terms of
cost, quality, service or innovation for their subsistence in the global
market. Due to the swift transformation of technology, software industries owe
to manage a large set of data having precious information hidden. Data mining
technique enables one to effectively cope with this hidden information where it
can be applied to code optimization, fault prediction and other domains which
modulates the success nature of software projects. Additionally, the efficiency
of the product developed further depends upon the quality of the project
personnel. The position of the paper therefore is to explore potentials of
project personnel in terms of their competency and skill set and its influence
on quality of project. The above mentioned objective is accomplished using a
Bayesian classifier in order to capture the pattern of human performance. By
this means, the hidden and valuable knowledge discovered in the related
databases will be summarized in the statistical structure. This mode of
predictive study enables the project managers to reduce the failure ratio to a
significant level and improve the performance of the project using the right
choice of project personnel.
","[{'version': 'v1', 'created': 'Tue, 11 Feb 2014 05:44:48 GMT'}]",2014-02-12,"[['Gupta', 'Sangita', ''], ['V', 'Suma', '']]","['Software Engineering', 'Data Mining', 'Project  Management', 'Software Quality', 'Bayesian classification']"
15297,1206.4883,Zakaria Elberrichi,"Zakaria Elberrichi, Malika Taibi, Amel Belaggoun","Multilingual Medical Documents Classification Based on MesH Domain
  Ontology","IJCSI International Journal of Computer Science Issues, Vol. 9, Issue
  2, No 2, March 2012",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article deals with the semantic Web and ontologies. It addresses the
issue of the classification of multilingual Web documents, based on domain
ontology. The objective is being able, using a model, to classify documents in
different languages. We will try to solve this problematic using two different
approaches. The two approaches will have two elementary stages: the creation of
the model using machine learning algorithms on a labeled corpus, then the
classification of documents after detecting their languages and mapping their
terms into the concepts of the language of reference (English). But each one
will deal with the multilingualism with a different approach. One supposes the
ontology is monolingual, whereas the other considers it multilingual. To show
the feasibility and the importance of our work, we implemented it on a domain
that attracts nowadays a lot of attention from the data mining community: the
biomedical domain. The selected documents are from the biomedical benchmark
corpus Ohsumed, and the associated ontology is the thesaurus MeSH (Medical
Subject Headings). The main idea in our work is a new document representation,
the masterpiece of all good classification, based on concept. The experimental
results show that the recommended ideas are promising.
","[{'version': 'v1', 'created': 'Thu, 21 Jun 2012 13:56:50 GMT'}]",2012-06-22,"[['Elberrichi', 'Zakaria', ''], ['Taibi', 'Malika', ''], ['Belaggoun', 'Amel', '']]","['multilingual classification', 'medical document', 'concept', 'domain’s ontology', 'Ohsumed', 'MeSH']"
15298,1609.06266,Ashish Sureka,"Lov Kumar, Ashish Sureka","Thirteen Years of Mining Software Repositories (MSR) Conference - What
  is the Bibliography Data Telling Us?","Bibliometric and Scientometric Analysis of Mining Software
  Repositories (MSR) Conferenence",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Mining Software Repositories (MSR) conference is a reputed, long-running
and flagship conference in the area of Software Analytics which has
successfully completed more than one decade as of year 2016. We conduct a
bibliometric and scientific publication mining based study to study how the
conference has evolved over the recent past 13 years (from 2004 to 2007 as a
workshop and then from 2008 to 2016 as a conference). Our objective is to
perform an examination of the state of MSR so that the MSR community can
identify strengths, areas of improvements and future directions for the
conference.
","[{'version': 'v1', 'created': 'Tue, 20 Sep 2016 17:44:54 GMT'}]",2016-09-21,"[['Kumar', 'Lov', ''], ['Sureka', 'Ashish', '']]","['Bibliometric Analysis', 'Mining Software Analysis (MSR)', 'ScientificPublication Mining', 'Software Analytics']"
15299,1708.01997,Fan Duo,"Juliang Zhang, Shengtai Zhang, Fan Duo, Feifei Wang",Research on Human Dynamics of Information Release of WeChat Users,,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The information release behavior of WeChat users is influenced by many
factors, and studying the rules of the behavior of users in WeChat can provide
theoretical help for the dynamic research of mobile social network users. By
crawling WeChat moments information of nine users within 5 years, we used the
human behavioral dynamics system to analyze users' behavior. The results show
that the information distribution behavior of WeChat users is consistent with
the power-law distribution for a certain period of time. Meanwhile, there is an
anti-memory characteristic in information release behavior of WeChat users,
which is significantly different from other user behavior patterns in online
social networks. The results of the study provide theoretical support for the
further study of information release behavior of Wechat users.
","[{'version': 'v1', 'created': 'Mon, 7 Aug 2017 05:55:39 GMT'}]",2017-08-08,"[['Zhang', 'Juliang', ''], ['Zhang', 'Shengtai', ''], ['Duo', 'Fan', ''], ['Wang', 'Feifei', '']]","['WeChat User', 'power-law distribution', 'Human Dynamics  1']"
15300,1002.2297,Jean-Marc Seigneur,Jean-Marc Seigneur,Local ePolitics Reputation Case Study,"Published in the Proceedings of the IADIS 2009 e-Society
  International Conference",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  More and more people rely on Web information and with the advance of Web 2.0
technologies they can increasingly easily participate to the creation of this
information. Country-level politicians could not ignore this trend and have
started to use the Web to promote them or to demote their opponents. This paper
presents how candidates to a French mayor local election and with less budget
have engineered their Web campaign and online reputation. After presenting the
settings of the local election, the Web tools used by the different candidates
and the local journalists are detailed. These tools are evaluated from a
security point of view and the legal issues that they have created are
underlined.
","[{'version': 'v1', 'created': 'Thu, 11 Feb 2010 08:33:15 GMT'}]",2010-02-12,"[['Seigneur', 'Jean-Marc', '']]","['ePolitics', 'local politics', 'Web campaign', 'online reputation']"
15301,1402.2991,Jean-Michel Muller,"Stef Graillat (LIP6), Vincent Lef\`evre (Inria Grenoble Rh\^one-Alpes
  / LIP Laboratoire de l'Informatique du Parall\'elisme), Jean-Michel Muller
  (Inria Grenoble Rh\^one-Alpes / LIP Laboratoire de l'Informatique du
  Parall\'elisme)","On the maximum relative error when computing x^n in floating-point
  arithmetic",,,,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we improve the usual relative error bound for the computation
of x^n through iterated multiplications by x in binary floating-point
arithmetic. The obtained error bound is only slightly better than the usual
one, but it is simpler. We also discuss the more general problem of computing
the product of n terms.
","[{'version': 'v1', 'created': 'Tue, 11 Feb 2014 20:13:14 GMT'}]",2014-02-14,"[['Graillat', 'Stef', '', 'LIP6'], ['Lefèvre', 'Vincent', '', ""Inria Grenoble Rhône-Alpes\n  / LIP Laboratoire de l'Informatique du Parallélisme""], ['Muller', 'Jean-Michel', '', ""Inria Grenoble Rhône-Alpes / LIP Laboratoire de l'Informatique du\n  Parallélisme""]]","['floating-point arithmetic', 'rounding error', 'accurate error bound', 'exponentiation']"
15302,1609.09669,Chinnappillai Durairajan,N. Annamalai and C. Durairajan,Relative two-weight $\mathbb{Z}_2 \mathbb{Z}_4$-additive Codes,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study a relative two-weight $\mathbb{Z}_2
\mathbb{Z}_4$-additive codes. It is shown that the Gray image of a two-distance
$\mathbb{Z}_2 \mathbb{Z}_4$-additive code is a binary two-distance code and
that the Gray image of a relative two-weight $\mathbb{Z}_2
\mathbb{Z}_4$-additive code, with nontrivial binary part, is a linear binary
relative two-weight code. The structure of relative two-weight $\mathbb{Z}_2
\mathbb{Z}_4$-additive codes are described. Finally, we discussed permutation
automorphism group of a $\mathbb{Z}_2 \mathbb{Z}_4$-additive codes.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2016 11:01:40 GMT'}]",2016-10-03,"[['Annamalai', 'N.', ''], ['Durairajan', 'C.', '']]","['Relative two-weight additive codes', 'Dual codes', 'Gray map', 'PermutationAutomorphism group']"
15303,1106.5979,Mohammed Eunus Ali Dr,"Mohammed Eunus Ali, Egemen Tanin, Rui Zhang, and Ramamohanarao
  Kotagiri","Probabilistic Voronoi Diagrams for Probabilistic Moving Nearest Neighbor
  Queries",,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A large spectrum of applications such as location based services and
environmental monitoring demand efficient query processing on uncertain
databases. In this paper, we propose the probabilistic Voronoi diagram (PVD)
for processing moving nearest neighbor queries on uncertain data, namely the
probabilistic moving nearest neighbor (PMNN) queries. A PMNN query finds the
most probable nearest neighbor of a moving query point continuously. To process
PMNN queries efficiently, we provide two techniques: a pre-computation approach
and an incremental approach. In the pre-computation approach, we develop an
algorithm to efficiently evaluate PMNN queries based on the pre-computed PVD
for the entire data set. In the incremental approach, we propose an incremental
probabilistic safe region based technique that does not require to pre-compute
the whole PVD to answer the PMNN query. In this incremental approach, we
exploit the knowledge for a known region to compute the lower bound of the
probability of an object being the nearest neighbor. Experimental results show
that our approaches significantly outperform a sampling based approach by
orders of magnitude in terms of I/O, query processing time, and communication
overheads.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2011 15:49:36 GMT'}]",2011-06-30,"[['Ali', 'Mohammed Eunus', ''], ['Tanin', 'Egemen', ''], ['Zhang', 'Rui', ''], ['Kotagiri', 'Ramamohanarao', '']]","['Voronoi diagrams', 'continuous queries', 'moving objects', 'uncertain data']"
15304,1109.2697,Amy Poh Ai Ling,"Amy Poh Ai Ling, Mukaidono Masao","Selection of Model in Developing Information Security Criteria for Smart
  Grid Security System",,"Smart Grid Security and Communications, The Ninth International
  Symposium on Parallel and Distributed Processing with Applications (ISPA),
  No. 108, May 2011, Korea, pp.91-98; Journal of Convergence, Vol.2, No.1,
  2011-6, pp.39-46",,,cs.CR cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  At present, the ""Smart Grid"" has emerged as one of the best advanced energy
supply chains. This paper looks into the security system of smart grid via the
smart planet system. The scope focused on information security criteria that
impact on consumer trust and satisfaction. The importance of information
security criteria is perceived as the main aspect to impact on customer trust
throughout the entire smart grid system. On one hand, this paper also focuses
on the selection of the model for developing information security criteria on a
smart grid.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2011 07:59:21 GMT'}]",2011-09-14,"[['Ling', 'Amy Poh Ai', ''], ['Masao', 'Mukaidono', '']]","['smart planet', 'smart grid', 'house of quality', 'quality']"
15305,1712.06471,Ioannis Psarros,Ioannis Z. Emiris and Ioannis Psarros,"Products of Euclidean metrics and applications to proximity questions
  among curves",18 pages,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of Approximate Nearest Neighbor (ANN) search is fundamental in
computer science and has benefited from significant progress in the past couple
of decades. However, most work has been devoted to pointsets whereas complex
shapes have not been sufficiently treated. Here, we focus on distance functions
between discretized curves in Euclidean space: they appear in a wide range of
applications, from road segments to time-series in general dimension. For
$\ell_p$-products of Euclidean metrics, for any $p$, we design simple and
efficient data structures for ANN, based on randomized projections, which are
of independent interest. They serve to solve proximity problems under a notion
of distance between discretized curves, which generalizes both discrete
Fr\'echet and Dynamic Time Warping distances. These are the most popular and
practical approaches to comparing such curves. We offer the first data
structures and query algorithms for ANN with arbitrarily good approximation
factor, at the expense of increasing space usage and preprocessing time over
existing methods. Query time complexity is comparable or significantly improved
by our algorithms, our algorithm is especially efficient when the length of the
curves is bounded.
","[{'version': 'v1', 'created': 'Mon, 18 Dec 2017 15:35:35 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Dec 2018 11:53:01 GMT'}, {'version': 'v3', 'created': 'Sun, 16 Dec 2018 14:48:09 GMT'}, {'version': 'v4', 'created': 'Thu, 7 Mar 2019 17:34:46 GMT'}, {'version': 'v5', 'created': 'Mon, 13 Apr 2020 10:26:43 GMT'}]",2020-04-14,"[['Emiris', 'Ioannis Z.', ''], ['Psarros', 'Ioannis', '']]","['Approximate nearest neighbor', 'polygonal curves', 'Fr´echet distance', 'dynamic time warping']"
15306,1401.1669,J. G. Wolff,J. Gerard Wolff,Smart machines and the SP theory of intelligence,arXiv admin note: substantial text overlap with arXiv:1306.3890,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  These notes describe how the ""SP theory of intelligence"", and its embodiment
in the ""SP machine"", may help to realise cognitive computing, as described in
the book ""Smart Machines"". In the SP system, information compression and a
concept of ""multiple alignment"" are centre stage. The system is designed to
integrate such things as unsupervised learning, pattern recognition,
probabilistic reasoning, and more. It may help to overcome the problem of
variety in big data, it may serve in pattern recognition and in the
unsupervised learning of structure in data, and it may facilitate the
management and transmission of big data. There is potential, via information
compression, for substantial gains in computational efficiency, especially in
the use of energy. The SP system may help to realise data-centric computing,
perhaps via a development of Hebb's concept of a ""cell assembly"", or via the
use of light or DNA for the processing of information. It has potential in the
management of errors and uncertainty in data, in medical diagnosis, in
processing streams of data, and in promoting adaptability in robots.
","[{'version': 'v1', 'created': 'Wed, 8 Jan 2014 11:32:56 GMT'}]",2014-02-20,"[['Wolff', 'J. Gerard', '']]","['unsupervised learning', 'big data', 'computational efficiency', 'datacentric computing', 'veracity', 'uncertainty']"
15307,1710.03978,Shamaila Iram,"Shamaila Iram, Terrence Fernando, May Bassanino","Exploring Cross-Domain Data Dependencies for Smart Homes to Improve
  Energy Efficiency","6 pages, 3 figures",,,,cs.CY cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the past decade, the idea of smart homes has been conceived as a
potential solution to counter energy crises or to at least mitigate its
intensive destructive consequences in the residential building sector.
","[{'version': 'v1', 'created': 'Wed, 11 Oct 2017 09:40:39 GMT'}]",2017-10-12,"[['Iram', 'Shamaila', ''], ['Fernando', 'Terrence', ''], ['Bassanino', 'May', '']]","['Smart homes', 'Energy efficiency', 'Data ontology', 'Internet of Things', 'Use case studies']"
15308,1109.1102,Xiongping Dai,"Xiongping Dai, Yu Huang and Mingqing Xiao","Stability of time-varying nonlinear switching systems under
  perturbations","8 pages, submitted",,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using a Liao-type exponent, we study the stability of a time-varying
nonlinear switching system.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2011 07:45:14 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Dec 2011 08:23:02 GMT'}]",2015-03-19,"[['Dai', 'Xiongping', ''], ['Huang', 'Yu', ''], ['Xiao', 'Mingqing', '']]","['Continuous-time switched system', 'exponential stability', 'Lyapunov-type exponent', 'Liao-type exponent']"
15309,1203.2147,Sudheer Gopinathan Dr,G.Sudheer and B.V.S.Renuka Devi,A Hybrid Image Cryptosystem Based On OMFLIP Permutation Cipher,8 pages,"Signal & Image Processing : An International Journal (SIPIJ)
  Vol.3, No.1, February 2012",,,cs.MM cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The protection of confidential image data from unauthorized access is an
important area of research in network communication. This paper presents a
high-level security encryption scheme for gray scale images. The gray level
image is first decomposed into binary images using bit scale decomposition.
Each binary image is then compressed by selecting a good scanning path that
minimizes the total number of bits needed to encode the bit sequence along the
scanning path using two dimensional run encoding. The compressed bit string is
then scrambled iteratively using a pseudo-random number generator and finally
encrypted using a bit level permutation OMFLIP. The performance is tested,
illustrated and discussed.
","[{'version': 'v1', 'created': 'Fri, 9 Mar 2012 17:43:28 GMT'}]",2012-03-12,"[['Sudheer', 'G.', ''], ['Devi', 'B. V. S. Renuka', '']]","['Image', 'Encryption', 'SCAN order', '2DRE', 'permutation cipher', 'OMFLIP']"
15310,1307.6410,Bartosz Boguslawski,"Bartosz Boguslawski, Vincent Gripon, Fabrice Seguin, Fr\'ed\'eric
  Heitzmann",Storing non-uniformly distributed messages in networks of neural cliques,"21 pages, 8 figures, submitted to Neurocomputing",,,,cs.NE cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Associative memories are data structures that allow retrieval of stored
messages from part of their content. They thus behave similarly to human brain
that is capable for instance of retrieving the end of a song given its
beginning. Among different families of associative memories, sparse ones are
known to provide the best efficiency (ratio of the number of bits stored to
that of bits used). Nevertheless, it is well known that non-uniformity of the
stored messages can lead to dramatic decrease in performance. We introduce
several strategies to allow efficient storage of non-uniform messages in
recently introduced sparse associative memories. We analyse and discuss the
methods introduced. We also present a practical application example.
","[{'version': 'v1', 'created': 'Wed, 24 Jul 2013 13:24:04 GMT'}]",2013-07-25,"[['Boguslawski', 'Bartosz', ''], ['Gripon', 'Vincent', ''], ['Seguin', 'Fabrice', ''], ['Heitzmann', 'Frédéric', '']]","['neural clique', 'sparsity', 'associative memory', 'non-uniform']"
15311,1702.06467,Juan-Manuel Torres-Moreno,"Carlos-Emiliano Gonz\'alez-Gallardo, Juan-Manuel Torres-Moreno,
  Azucena Montes Rend\'on and Gerardo Sierra","Efficient Social Network Multilingual Classification using Character,
  POS n-grams and Dynamic Normalization","8 pages, 6 figures, Conference paper","Proceedings of the 8th International Joint Conference on Knowledge
  Discovery, Knowledge Engineering and Knowledge Management, Vol 1: KDIR,
  307-314, 2016, Porto, Portugal",,,cs.IR cs.CL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we describe a dynamic normalization process applied to social
network multilingual documents (Facebook and Twitter) to improve the
performance of the Author profiling task for short texts. After the
normalization process, $n$-grams of characters and n-grams of POS tags are
obtained to extract all the possible stylistic information encoded in the
documents (emoticons, character flooding, capital letters, references to other
users, hyperlinks, hashtags, etc.). Experiments with SVM showed up to 90% of
performance.
","[{'version': 'v1', 'created': 'Tue, 21 Feb 2017 16:26:54 GMT'}]",2017-02-22,"[['González-Gallardo', 'Carlos-Emiliano', ''], ['Torres-Moreno', 'Juan-Manuel', ''], ['Rendón', 'Azucena Montes', ''], ['Sierra', 'Gerardo', '']]","['Text Mining', 'Machine Learning', 'Classification', 'n-grams', 'POS', 'Blogs', 'Tweets', 'Social Network']"
15312,1010.3615,Pascal Urso,"St\'ephane Martin (LIF), Pascal Urso (INRIA Lorraine - LORIA),
  St\'ephane Weiss (INRIA Lorraine - LORIA)",Scalable XML Collaborative Editing with Undo short paper,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Commutative Replicated Data-Type (CRDT) is a new class of algorithms that
ensures scalable consistency of replicated data. It has been successfully
applied to collaborative editing of texts without complex concurrency control.
In this paper, we present a CRDT to edit XML data. Compared to existing
approaches for XML collaborative editing, our approach is more scalable and
handles all the XML editing aspects : elements, contents, attributes and undo.
Indeed, undo is recognized as an important feature for collaborative editing
that allows to overcome system complexity through error recovery or
collaborative conflict resolution.
","[{'version': 'v1', 'created': 'Mon, 18 Oct 2010 14:38:31 GMT'}]",2010-10-19,"[['Martin', 'Stéphane', '', 'LIF'], ['Urso', 'Pascal', '', 'INRIA Lorraine - LORIA'], ['Weiss', 'Stéphane', '', 'INRIA Lorraine - LORIA']]","['XML', 'Collaborative Editing', 'P2P', 'Group Undo', 'Scalability', 'Optimistic Replication', 'CRDT']"
15313,1306.4059,Bican Xia,Lu Yang and Bican Xia,Deciding Nonnegativity of Polynomials by MAPLE,"A user guide on using RealRootClassfication to prove the
  nonnegativity of polynomials with 10 examples",,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There have been some effective tools for solving (constant/parametric)
semi-algebraic systems in Maple's library RegularChains since Maple 13. By
using the functions of the library, e.g., RealRootClassfication, one can prove
and discover polynomial inequalities. This paper is more or less a user guide
on using RealRootClassfication to prove the nonnegativity of polynomials. We
show by examples how to use this powerful tool to prove a polynomial is
nonnegative under some polynomial inequality and/or equation constraints. Some
tricks for using the tool are also provided.
","[{'version': 'v1', 'created': 'Tue, 18 Jun 2013 02:23:15 GMT'}]",2013-06-19,"[['Yang', 'Lu', ''], ['Xia', 'Bican', '']]","['Automated reasoning', 'nonnegativity', 'Maple', 'RegularChains', 'RealRootClassification']"
15314,1610.05174,Aznul Qalid Md Sabri,"Aznul Qalid Md Sabri, Jacques Boonaert, Erma Rahayu Mohd Faizal
  Abdullah and Ali Mohammed Mansoor","Spatio-temporal Co-Occurrence Characterizations for Human Action
  Classification",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The human action classification task is a widely researched topic and is
still an open problem. Many state-of-the-arts approaches involve the usage of
bag-of-video-words with spatio-temporal local features to construct
characterizations for human actions. In order to improve beyond this standard
approach, we investigate the usage of co-occurrences between local features. We
propose the usage of co-occurrences information to characterize human actions.
A trade-off factor is used to define an optimal trade-off between vocabulary
size and classification rate. Next, a spatio-temporal co-occurrence technique
is applied to extract co-occurrence information between labeled local features.
Novel characterizations for human actions are then constructed. These include a
vector quantized correlogram-elements vector, a highly discriminative PCA
(Principal Components Analysis) co-occurrence vector and a Haralick texture
vector. Multi-channel kernel SVM (support vector machine) is utilized for
classification. For evaluation, the well known KTH as well as the challenging
UCF-Sports action datasets are used. We obtained state-of-the-arts
classification performance. We also demonstrated that we are able to fully
utilize co-occurrence information, and improve the standard bag-of-video-words
approach.
","[{'version': 'v1', 'created': 'Tue, 2 Aug 2016 02:22:42 GMT'}]",2016-10-18,"[['Sabri', 'Aznul Qalid Md', ''], ['Boonaert', 'Jacques', ''], ['Abdullah', 'Erma Rahayu Mohd Faizal', ''], ['Mansoor', 'Ali Mohammed', '']]","['local features', 'human action', 'classification', 'spatio-temporal co-occurrence']"
15315,1504.05694,Serge Egelman,"Linda Lee, Serge Egelman, Joong Hwa Lee, David Wagner",Risk Perceptions for Wearable Devices,,,,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wearable devices, or ""wearables,"" bring great benefits but also potential
risks that could expose users' activities with- out their awareness or consent.
In this paper, we report findings from the first large-scale survey conducted
to investigate user security and privacy concerns regarding wearables. We
surveyed 1,782 Internet users in order to identify risks that are particularly
concerning to them; these risks are inspired by the sensor inputs and
applications of popular wearable technologies. During this experiment, our
questions controlled for the effects of what data was being accessed and with
whom it was being shared. We also investigated how these emergent threats
compared to existent mobile threats, how upcoming capabilities and artifacts
compared to existing technologies, and how users ranked technical and
nontechnical concerns to sketch a concrete and broad view of the wearable
device landscape. We hope that this work will inform the design of future user
notification, permission management, and access control schemes for wearables.
","[{'version': 'v1', 'created': 'Wed, 22 Apr 2015 08:44:23 GMT'}]",2015-04-23,"[['Lee', 'Linda', ''], ['Egelman', 'Serge', ''], ['Lee', 'Joong Hwa', ''], ['Wagner', 'David', '']]","['Privacy', 'Security', 'User Studies', 'Risk Perception', 'UbiquitousComputing', 'Wearable Devices']"
15316,0909.2368,Nevin Vunka Jungum,Kelly D. Lewis andjames E. Lewis,Web Single Sign-On Authentication using SAML,"International Journal of Computer Science Issues (IJCSI), Volume 1,
  pp41-48, August 2009","K. D. LEWIS andJ. E. LEWIS, "" Web Single Sign-On Authentication
  using SAML"", International Journal of Computer Science Issues (IJCSI), Volume
  1, pp41-48, August 2009",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Companies have increasingly turned to application service providers (ASPs) or
Software as a Service (SaaS) vendors to offer specialized web-based services
that will cut costs and provide specific and focused applications to users. The
complexity of designing, installing, configuring, deploying, and supporting the
system with internal resources can be eliminated with this type of methodology,
providing great benefit to organizations. However, these models can present an
authentication problem for corporations with a large number of external service
providers. This paper describes the implementation of Security Assertion Markup
Language (SAML) and its capabilities to provide secure single sign-on (SSO)
solutions for externally hosted applications.
","[{'version': 'v1', 'created': 'Sat, 12 Sep 2009 21:01:57 GMT'}]",2012-08-27,"[['Lewis', 'Kelly D. Lewis andjames E.', '']]","['Security', 'SAML', 'Single Sign-On', 'Web', 'Authentication']"
15317,1510.04828,Li Heng Liou,"Cheng-Shang Chang, Duan-Shin Lee, Li-Heng Liou, Sheng-Min Lu, and
  Mu-Huan Wu",A Probabilistic Framework for Structural Analysis in Directed Networks,,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In our recent works, we developed a probabilistic framework for structural
analysis in undirected networks. The key idea of that framework is to sample a
network by a symmetric bivariate distribution and then use that bivariate
distribution to formerly define various notions, including centrality, relative
centrality, community, and modularity. The main objective of this paper is to
extend the probabilistic framework to directed networks, where the sampling
bivariate distributions could be asymmetric. Our main finding is that we can
relax the assumption from symmetric bivariate distributions to bivariate
distributions that have the same marginal distributions. By using such a weaker
assumption, we show that various notions for structural analysis in directed
networks can also be defined in the same manner as before. However, since the
bivariate distribution could be asymmetric, the community detection algorithms
proposed in our previous work cannot be directly applied. For this, we show
that one can construct another sampled graph with a symmetric bivariate
distribution so that for any partition of the network, the modularity index
remains the same as that of the original sampled graph. Based on this, we
propose a hierarchical agglomerative algorithm that returns a partition of
communities when the algorithm converges.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2015 10:23:39 GMT'}]",2015-10-19,"[['Chang', 'Cheng-Shang', ''], ['Lee', 'Duan-Shin', ''], ['Liou', 'Li-Heng', ''], ['Lu', 'Sheng-Min', ''], ['Wu', 'Mu-Huan', '']]","['centrality', 'community', 'modularity', 'PageRank']"
15318,1604.08736,Alexander Maletzky,Alexander Maletzky,Verifying Buchberger's Algorithm in Reduction Rings,"8 pages; appeared in the proceedings of PAS'2015 (Program
  Verification, Automated Debugging, and Symbolic Computation, Beijing, China,
  October 21--23, 2015)",,,,cs.SC cs.LO math.AC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present the formal, computer-supported verification of a
functional implementation of Buchberger's critical-pair/completion algorithm
for computing Gr\""obner bases in reduction rings. We describe how the algorithm
can be implemented and verified within one single software system, which in our
case is the Theorema system.
  In contrast to existing formal correctness proofs of Buchberger's algorithm
in other systems, e. g. Coq and ACL2, our work is not confined to the classical
setting of polynomial rings over fields, but considers the much more general
setting of reduction rings; this, naturally, makes the algorithm more
complicated and the verification more difficult.
  The correctness proof is essentially based on some non-trivial results from
the theory of reduction rings, which we formalized and formally proved as well.
This formalization already consists of more than 800 interactively proved
lemmas and theorems, making the elaboration an extensive example of
higher-order theory exploration in Theorema.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2016 08:51:32 GMT'}]",2016-05-02,"[['Maletzky', 'Alexander', '']]","['Buchberger’s algorithm', 'Gröbner bases', 'reduction rings', 'Theorema']"
15319,1502.06354,Gergely Neu,Gergely Neu,First-order regret bounds for combinatorial semi-bandits,To appear at COLT 2015,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of online combinatorial optimization under
semi-bandit feedback, where a learner has to repeatedly pick actions from a
combinatorial decision set in order to minimize the total losses associated
with its decisions. After making each decision, the learner observes the losses
associated with its action, but not other losses. For this problem, there are
several learning algorithms that guarantee that the learner's expected regret
grows as $\widetilde{O}(\sqrt{T})$ with the number of rounds $T$. In this
paper, we propose an algorithm that improves this scaling to
$\widetilde{O}(\sqrt{{L_T^*}})$, where $L_T^*$ is the total loss of the best
action. Our algorithm is among the first to achieve such guarantees in a
partial-feedback scheme, and the first one to do so in a combinatorial setting.
","[{'version': 'v1', 'created': 'Mon, 23 Feb 2015 09:12:26 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Jun 2015 11:51:51 GMT'}]",2015-06-11,"[['Neu', 'Gergely', '']]","['online learning', 'online combinatorial optimization', 'semi-bandit feedback', 'follow theperturbed leader', 'improvements for small losses', 'first-order bounds']"
15320,1407.2423,Ashish Luhach Dr.,"Ashish Kr. Luhach, Sanjay K. Dwivedi, C. K. Jha",Desiging a logical security framework for e-commerce system based on soa,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rapid increases in information technology also changed the existing markets
and transformed them into e- markets (e-commerce) from physical markets.
Equally with the e-commerce evolution, enterprises have to recover a safer
approach for implementing E-commerce and maintaining its logical security. SOA
is one of the best techniques to fulfill these requirements. SOA holds the
vantage of being easy to use, flexible, and recyclable. With the advantages,
SOA is also endowed with ease for message tampering and unauthorized access.
This causes the security technology implementation of E-commerce very difficult
at other engineering sciences. This paper discusses the importance of using SOA
in E-commerce and identifies the flaws in the existing security analysis of
E-commerce platforms. On the foundation of identifying defects, this editorial
also suggested an implementation design of the logical security framework for
SOA supported E-commerce system.
","[{'version': 'v1', 'created': 'Wed, 9 Jul 2014 10:25:59 GMT'}]",2014-07-10,"[['Luhach', 'Ashish Kr.', ''], ['Dwivedi', 'Sanjay K.', ''], ['Jha', 'C. K.', '']]","['Service oriented Architecture', 'web services', 'system consolidation', 'logical security']"
15321,0908.0993,Tobias Renk,"Tobias Renk, Holger Jaekel, Friedrich K. Jondral",Outage Regions and Optimal Power Allocation for Wireless Relay Networks,"5 pages, 4 figures, 1 table, accepted for ITW 2009, Taormina, Sicily",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study outage regions for energy-constrained multi-hop and adaptive
multi-route networks with an arbitrary number of relay nodes. Optimal power
allocation strategies in the sense that outage probability is minimized are
derived depending on the distances between the transmit nodes. We further
investigate the rate gain of adaptive multi-route and multi-hop over direct
transmission. It is shown that a combined strategy of direct transmission and
adaptive multi-route outperforms multi-hop for all values of rate R. It can be
stated that cooperation strategies are beneficial for low-rate systems where
the main goal is a very low outage probability of the network. As the rate is
increased, direct transmission becomes more and more attractive.
","[{'version': 'v1', 'created': 'Fri, 7 Aug 2009 07:10:43 GMT'}]",2009-08-10,"[['Renk', 'Tobias', ''], ['Jaekel', 'Holger', ''], ['Jondral', 'Friedrich K.', '']]","['cooperation', 'outage region', 'optimal power allocation', 'rate gain']"
15322,1506.02367,Pierre Lescanne,"Maciej Bendkowski (TCS), Katarzyna Grygiel (TCS), Pierre Lescanne
  (TCS, LIP), Marek Zaionc (TCS)",A natural counting of lambda terms,,,,,cs.LO cs.DM cs.PL math.CO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the sequences of numbers corresponding to lambda terms of given
sizes, where the size is this of lambda terms with de Bruijn indices in a very
natural model where all the operators have size 1. For plain lambda terms, the
sequence corresponds to two families of binary trees for which we exhibit
bijections. We study also the distribution of normal forms, head normal forms
and strongly normalizing terms. In particular we show that strongly normalizing
terms are of density 0 among plain terms.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2015 06:57:41 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Jul 2015 08:19:29 GMT'}, {'version': 'v3', 'created': 'Tue, 17 May 2016 08:30:30 GMT'}]",2016-05-18,"[['Bendkowski', 'Maciej', '', 'TCS'], ['Grygiel', 'Katarzyna', '', 'TCS'], ['Lescanne', 'Pierre', '', 'TCS, LIP'], ['Zaionc', 'Marek', '', 'TCS']]","['lambda calculus', 'combinatorics', 'functional programming', 'test', 'random generator', 'bijection', 'binary tree', 'asymptotic']"
15323,1207.6295,Kai Wang,"Kai Wang, Minghong Lin, Florin Ciucu, Adam Wierman, Chuang Lin","Characterizing the Impact of the Workload on the Value of Dynamic
  Resizing in Data Centers","24 pages, 27 fugures",,,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Energy consumption imposes a significant cost for data centers; yet much of
that energy is used to maintain excess service capacity during periods of
predictably low load. Resultantly, there has recently been interest in
developing designs that allow the service capacity to be dynamically resized to
match the current workload. However, there is still much debate about the value
of such approaches in real settings. In this paper, we show that the value of
dynamic resizing is highly dependent on statistics of the workload process. In
particular, both slow time-scale non-stationarities of the workload (e.g., the
peak-to-mean ratio) and the fast time-scale stochasticity (e.g., the burstiness
of arrivals) play key roles. To illustrate the impact of these factors, we
combine optimization-based modeling of the slow time-scale with stochastic
modeling of the fast time scale. Within this framework, we provide both
analytic and numerical results characterizing when dynamic resizing does (and
does not) provide benefits.
","[{'version': 'v1', 'created': 'Thu, 26 Jul 2012 15:17:06 GMT'}, {'version': 'v2', 'created': 'Sun, 11 May 2014 06:32:57 GMT'}]",2014-05-13,"[['Wang', 'Kai', ''], ['Lin', 'Minghong', ''], ['Ciucu', 'Florin', ''], ['Wierman', 'Adam', ''], ['Lin', 'Chuang', '']]","['Data Centers', 'Dynamic Resizing', 'Energy Efficient IT', 'Stochastic Network Calculus']"
15324,1802.07354,Upulee Kanewala,"Madhusudan Srinivasan and Morteza Pourreza Shahri and Upulee Kanewala
  and Indika Kahanda","Quality Assurance of Bioinformatics Software: A Case Study of Testing a
  Biomedical Text Processing Tool Using Metamorphic Testing",,,,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Bioinformatics software plays a very important role in making critical
decisions within many areas including medicine and health care. However, most
of the research is directed towards developing tools, and little time and
effort is spent on testing the software to assure its quality. In testing, a
test oracle is used to determine whether a test is passed or failed during
testing, and unfortunately, for much of bioinformatics software, the exact
expected outcomes are not well defined. Thus, the main challenge associated
with conducting systematic testing on bioinformatics software is the oracle
problem.
  Metamorphic testing (MT) is a technique used to test programs that face the
oracle problem. MT uses metamorphic relations (MRs) to determine whether a test
has passed or failed and specifies how the output should change according to a
specific change made to the input. In this work, we use MT to test LingPipe, a
tool for processing text using computational linguistics, often used in
bioinformatics for bio-entity recognition from biomedical literature.
  First, we identify a set of MRs for testing any bio-entity recognition
program. Then we develop a set of test cases that can be used to test
LingPipe's bio-entity recognition functionality using these MRs. To evaluate
the effectiveness of this testing process, we automatically generate a set of
faulty versions of LingPipe. According to our analysis of the experimental
results, we observe that our MRs can detect the majority of these faulty
versions, which shows the utility of this testing technique for quality
assurance of bioinformatics software.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 22:01:54 GMT'}]",2018-02-22,"[['Srinivasan', 'Madhusudan', ''], ['Shahri', 'Morteza Pourreza', ''], ['Kanewala', 'Upulee', ''], ['Kahanda', 'Indika', '']]","['Sofware testing', 'Metamorphic testing', 'Bioinformatics', 'BiomedicalNatural Language Processing']"
15325,1111.3124,Akira SaiToh,Akira SaiToh,"A multiprecision matrix calculation library and its extension library
  for a matrix-product-state simulation of quantum computing","5 pages, 1 figure, technical report (a software overview)",,,QIT2011-80,cs.MS quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A C++ library, named ZKCM, has been developed for the purpose of
multiprecision matrix calculations, which is based on the GNU MP and MPFR
libraries. It is especially convenient for writing programs involving
tensor-product operations, tracing-out operations, and singular-value
decompositions. Its extension library, ZKCM_QC, for simulating quantum
computing has been developed using the time-dependent matrix-product-state
simulation method. This report gives a brief introduction to the libraries with
sample programs.
","[{'version': 'v1', 'created': 'Mon, 14 Nov 2011 07:50:31 GMT'}]",2012-08-28,"[['SaiToh', 'Akira', '']]","['Multiprecision simulation library', 'Time-dependent matrix product state', 'Quantum computing']"
15326,1404.0091,Iaakov Exman,Iaakov Exman,Interestingness a Unifying Paradigm Bipolar Function Composition,"9 pages, 2 figures, 1 table; in Proceedings of KDIR 2009, 1st
  International Conference on Knowledge Discovery and Information Retrieval,
  Madeira, Portugal, pp. 196-201",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interestingness is an important criterion by which we judge knowledge
discovery. But, interestingness has escaped all attempts to capture its
intuitive meaning into a concise and comprehensive form. A unifying paradigm is
formulated by function composition. We claim that composition is bipolar, i.e.
composition of exactly two functions, whose two semantic poles are relevance
and unexpectedness. The paradigm generality is demonstrated by case studies of
new interestingness functions, examples of known functions that fit the
framework, and counter-examples for which the paradigm points out to the
lacking pole.
","[{'version': 'v1', 'created': 'Tue, 1 Apr 2014 00:53:37 GMT'}]",2014-04-03,"[['Exman', 'Iaakov', '']]","['Interestingness', 'Function Composition', 'Paradigm', 'Bipolar', 'Relevance', 'Unexpectedness']"
15327,1003.4924,Amine Chellali,"Amine Chellali (IRCCyN), C\'edric Dumas (IRCCyN), Isabelle
  Milleville-Pennel (IRCCyN), Eric Nouri (IRCCyN)","Common Frame of reference in collaborative virtual environments and
  their impact on presence",,"The 10th Annual International Workshop on Presence, Barcelone :
  Spain (2007)",,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Virtual collaborative environment are 3D shared spaces in which people can
work together. To collaborate through these systems, users must have a shared
comprehension of the environment. The objective of this experimental study was
to determine if visual stable landmarks improve the construction of a common
representation of the virtual environment and thus facilitate collaboration.
This seems to increase the awareness of the partner's presence.
","[{'version': 'v1', 'created': 'Thu, 25 Mar 2010 14:45:28 GMT'}]",2010-04-08,"[['Chellali', 'Amine', '', 'IRCCyN'], ['Dumas', 'Cédric', '', 'IRCCyN'], ['Milleville-Pennel', 'Isabelle', '', 'IRCCyN'], ['Nouri', 'Eric', '', 'IRCCyN']]","['Collaborative virtual environments', 'common frame of reference', '3D interface']"
15328,1009.0389,Hussein Al-Bahadili Dr.,Hussein Al-Bahadili and Rami Jaradat,"Performance Evaluation of an OMPR Algorithm for Route Discovery in Noisy
  MANETs","12 Pages, 8 Figures, 1 Table, Journal","International Journal of Computer Networks & Communications
  (IJCNC), Vol. 2, No. 1, January 2010",,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It has been revealed in the literature that pure multipoint relaying (MPR)
algorithms demonstrate both simplicity and outstanding performance, as compared
to other flooding algorithms in wireless networks. One drawback of pure MPR
algorithms is that the selected forwarding set may not represent the optimum
selection. In addition, little efforts have been carried-out to investigate the
performance of such algorithms in noisy mobile ad hoc networks (MANETs)
suffering from high packet-loss and node mobility. In this paper, we develop
and evaluate the performance of an optimal MPR (OMPR) algorithm for route
discovery in noisy MANETs. The main feature of this new algorithm is that it
calculates all possible sets of multipoint relays (MPRs) and then selects the
set with minimum number of nodes. The algorithm demonstrates an excellent
performance when it is compared with other route discovery algorithms as it
achieves the highest cost-effective reachability.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2010 10:58:42 GMT'}]",2010-09-03,"[['Al-Bahadili', 'Hussein', ''], ['Jaradat', 'Rami', '']]","['Multipoint Relaying Algorithms', 'MANETs', 'Routing Protocols', 'Route Discovery', 'Flooding Techniques']"
15329,1501.05057,Hoang Dinh Thai DTH,"Dinh Thai Hoang, Dusit Niyato, Nguyen Tai Hung",Optimal Energy Allocation Policy for Wireless Networks in the Sky,"6 pages, 6 figures, 11 references",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Google's Project Loon was launched in 2013 with the aim of providing Internet
access to rural and remote areas. In the Loon network, balloons travel around
the Earth and bring access points to the users who cannot connect directly to
the global wired Internet. The signals from the users will be transmitted
through the balloon network to the base stations connected to the Internet
service provider (ISP) on Earth. The process of transmitting and receiving data
consume a certain amount of energy from the balloon, while the energy on
balloons cannot be supplied by stable power source or by replacing batteries
frequently. Instead, the balloons can harvest energy from natural energy
sources, e.g., solar energy, or from radio frequency energy by equipping with
appropriate circuits. However, such kinds of energy sources are often dynamic
and thus how to use this energy efficiently is the main goal of this paper. In
this paper, we study the optimal energy allocation problem for the balloons
such that network performance is optimized and the revenue for service
providers is maximized. We first formulate the stochastic optimization problem
as a Markov decision process and then apply a learning algorithm based on
simulation-based method to obtain optimal policies for the balloons. Numerical
results obtained by extensive simulations clearly show the efficiency and
convergence of the proposed learning algorithm.
","[{'version': 'v1', 'created': 'Wed, 21 Jan 2015 05:06:22 GMT'}]",2015-01-22,"[['Hoang', 'Dinh Thai', ''], ['Niyato', 'Dusit', ''], ['Hung', 'Nguyen Tai', '']]","['Internet in the sky', 'Google Loon Project', 'Markovdecision process']"
15330,1209.4976,Yanfang Liu,Yanfang Liu and William Zhu,"Matroidal structure of rough sets based on serial and transitive
  relations",16 pages,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The theory of rough sets is concerned with the lower and upper approximations
of objects through a binary relation on a universe. It has been applied to
machine learning, knowledge discovery and data mining. The theory of matroids
is a generalization of linear independence in vector spaces. It has been used
in combinatorial optimization and algorithm design. In order to take advantages
of both rough sets and matroids, in this paper we propose a matroidal structure
of rough sets based on a serial and transitive relation on a universe. We
define the family of all minimal neighborhoods of a relation on a universe, and
prove it satisfy the circuit axioms of matroids when the relation is serial and
transitive. In order to further study this matroidal structure, we investigate
the inverse of this construction: inducing a relation by a matroid. The
relationships between the upper approximation operators of rough sets based on
relations and the closure operators of matroids in the above two constructions
are studied. Moreover, we investigate the connections between the above two
constructions.
","[{'version': 'v1', 'created': 'Sat, 22 Sep 2012 09:25:50 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Nov 2012 10:39:19 GMT'}]",2012-11-30,"[['Liu', 'Yanfang', ''], ['Zhu', 'William', '']]","['rough set', 'matroid', 'neighborhood', 'lower and upper approximations', 'closure', '2-circuit matroid']"
15331,1710.02035,Noman Islam Dr.,"Noman Islam, Zubair A. Shaikh, Aqeel-ur-Rehman, Muhammad Shahab
  Siddiqui","HANDY: A Hybrid Association Rules Mining Approach for Network Layer
  Discovery of Services for Mobile Ad hoc Network",,,,,cs.NI cs.AI cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile Ad hoc Network (MANET) is an infrastructure-less network formed
between a set of mobile nodes. The discovery of services in MANET is a
challenging job due to the unique properties of network. In this paper, a novel
service discovery framework called Hybrid Association Rules Based Network Layer
Discovery of Services for Ad hoc Networks (HANDY) has been proposed. HANDY
provides three major research contributions. At first, it adopts a cross-layer
optimized design for discovery of services that is based on simultaneous
discovery of services and corresponding routes. Secondly, it provides a
multi-level ontology-based approach to describe the services. This resolves the
issue of semantic interoperability among the service consumers in a scalable
fashion. Finally, to further optimize the performance of the discovery process,
HANDY recommends exploiting the inherent associations present among the
services. These associations are used in two ways. First, periodic service
advertisements are performed based on these associations. In addition, when a
response of a service discovery request is generated, correlated services are
also attached with the response. The proposed service discovery scheme has been
implemented in JIST/SWANS simulator. The results demonstrate that the proposed
modifications give rise to improvement in hit ratio of the service consumers
and latency of discovery process.
","[{'version': 'v1', 'created': 'Tue, 3 Oct 2017 14:49:11 GMT'}]",2017-10-06,"[['Islam', 'Noman', ''], ['Shaikh', 'Zubair A.', ''], ['Aqeel-ur-Rehman', '', ''], ['Siddiqui', 'Muhammad Shahab', '']]","['MANET', 'HANDY', 'service discovery', 'correlation patterns', 'semantic discovery', 'crosslayer design']"
15332,1712.05481,Xiao-Shan Gao,Qiao-Long Huang and Xiao-Shan Gao,"Revisit Sparse Polynomial Interpolation based on Randomized Kronecker
  Substitution",,,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a new reduction based interpolation algorithm for black-box
multivariate polynomials over finite fields is given. The method is based on
two main ingredients. A new Monte Carlo method is given to reduce black-box
multivariate polynomial interpolation to black-box univariate polynomial
interpolation over any ring. The reduction algorithm leads to multivariate
interpolation algorithms with better or the same complexities most cases when
combining with various univariate interpolation algorithms. We also propose a
modified univariate Ben-or and Tiwarri algorithm over the finite field, which
has better total complexity than the Lagrange interpolation algorithm.
Combining our reduction method and the modified univariate Ben-or and Tiwarri
algorithm, we give a Monte Carlo multivariate interpolation algorithm, which
has better total complexity in most cases for sparse interpolation of black-box
polynomial over finite fields.
","[{'version': 'v1', 'created': 'Fri, 15 Dec 2017 00:08:50 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Jul 2018 13:10:35 GMT'}]",2018-07-18,"[['Huang', 'Qiao-Long', ''], ['Gao', 'Xiao-Shan', '']]","['Randomized Kronecker substitution', 'sparse polynomial interpolation', 'black-box', 'Ben-or and Tiwari algorithm', 'finite field', 'Monte Carlo algorithm']"
15333,1209.0622,Nishadh K A,K. A. Nishadh and P. A Azeez,Sensor Webs for Environmental research,"6 pages, 1 figures",,,,cs.SY cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ongoing massive global environmental changes and the past learnings have
highlighted the urgency and importance of further detailed understanding of the
earth system and implementation of social ecological sustainability measures in
a much more effective and transparent manner. This short communication discuss
the potential of sensor webs in addressing those research challenges,
highlighting it in the context of air pollution issues.
","[{'version': 'v1', 'created': 'Tue, 4 Sep 2012 12:04:14 GMT'}]",2012-09-05,"[['Nishadh', 'K. A.', ''], ['Azeez', 'P. A', '']]","['Sensor web', 'Earth system science', 'social-ecological system', 'Environmental  monitoring']"
15334,1108.2427,Steffen Kopecki,"Volker Diekert, Steffen Kopecki and Victor Mitrana","Deciding Regularity of Hairpin Completions of Regular Languages in
  Polynomial Time",,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The hairpin completion is an operation on formal languages that has been
inspired by the hairpin formation in DNA biochemistry and by DNA computing. In
this paper we investigate the hairpin completion of regular languages.
  It is well known that hairpin completions of regular languages are linear
context-free and not necessarily regular. As regularity of a (linear)
context-free language is not decidable, the question arose whether regularity
of a hairpin completion of regular languages is decidable. We prove that this
problem is decidable and we provide a polynomial time algorithm.
  Furthermore, we prove that the hairpin completion of regular languages is an
unambiguous linear context-free language and, as such, it has an effectively
computable growth function. Moreover, we show that the growth of the hairpin
completion is exponential if and only if the growth of the underlying languages
is exponential and, in case the hairpin completion is regular, then the hairpin
completion and the underlying languages have the same growth indicator.
","[{'version': 'v1', 'created': 'Thu, 11 Aug 2011 15:10:28 GMT'}]",2011-08-12,"[['Diekert', 'Volker', ''], ['Kopecki', 'Steffen', ''], ['Mitrana', 'Victor', '']]","['Hairpin completion', 'regular languages and finite automata', 'unambiguous linear languages', 'rational growth']"
15335,1206.0908,Bo Xing,"Bo Xing, Wen-Jing Gao, Fulufhelo V. Nelwamondo, Kimberly Battle, and
  Tshilidzi Marwala","Soft Computing in Product Recovery: A Survey Focusing on Remanufacturing
  System",,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper focuses on the application of soft computing in remanufacturing
system, in which end-of-life products are disassembled into basic components
and then remanufactured for both economic and environmental reasons. The
disassembly activities include disassembly sequencing and planning, while the
remanufacturing process is composed of product design, production planning &
scheduling, and inventory management. This paper presents a review of the
related articles and suggests the corresponding further research directions.
","[{'version': 'v1', 'created': 'Tue, 5 Jun 2012 12:43:36 GMT'}]",2012-06-06,"[['Xing', 'Bo', ''], ['Gao', 'Wen-Jing', ''], ['Nelwamondo', 'Fulufhelo V.', ''], ['Battle', 'Kimberly', ''], ['Marwala', 'Tshilidzi', '']]","['Product recovery', 'Remanufacturing', 'Disassembly', 'Soft computing']"
15336,1610.01757,Mohamad Ivan Fanany,"Endang Purnama Giri, Mohamad Ivan Fanany, Aniati Murni Arymurthy","Ischemic Stroke Identification Based on EEG and EOG using 1D
  Convolutional Neural Network and Batch Normalization",13 pages. To be published in ICACSIS 2016,,,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 2015, stroke was the number one cause of death in Indonesia. The majority
type of stroke is ischemic. The standard tool for diagnosing stroke is CT-Scan.
For developing countries like Indonesia, the availability of CT-Scan is very
limited and still relatively expensive. Because of the availability, another
device that potential to diagnose stroke in Indonesia is EEG. Ischemic stroke
occurs because of obstruction that can make the cerebral blood flow (CBF) on a
person with stroke has become lower than CBF on a normal person (control) so
that the EEG signal have a deceleration. On this study, we perform the ability
of 1D Convolutional Neural Network (1DCNN) to construct classification model
that can distinguish the EEG and EOG stroke data from EEG and EOG control data.
To accelerate training process our model we use Batch Normalization. Involving
62 person data object and from leave one out the scenario with five times
repetition of measurement we obtain the average of accuracy 0.86 (F-Score
0.861) only at 200 epoch. This result is better than all over shallow and
popular classifiers as the comparator (the best result of accuracy 0.69 and
F-Score 0.72 ). The feature used in our study were only 24 handcrafted feature
with simple feature extraction process.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2016 07:19:27 GMT'}]",2016-10-07,"[['Giri', 'Endang Purnama', ''], ['Fanany', 'Mohamad Ivan', ''], ['Arymurthy', 'Aniati Murni', '']]","['Sleep stage', 'Conditional Neural Fields', 'Deep Belief Networks', 'FuzzyC-Means Clustering', 'Classification']"
15337,1606.04589,Ram\'on Pino P\'erez,Am\'ilcar Mata D\'iaz and Ram\'on Pino P\'erez,Impossibility in Belief Merging,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the aim of studying social properties of belief merging and having a
better understanding of impossibility, we extend in three ways the framework of
logic-based merging introduced by Konieczny and Pino P\'erez. First, at the
level of representation of the information, we pass from belief bases to
complex epistemic states. Second, the profiles are represented as functions of
finite societies to the set of epistemic states (a sort of vectors) and not as
multisets of epistemic states. Third, we extend the set of rational postulates
in order to consider the epistemic versions of the classical postulates of
Social Choice Theory: Standard Domain, Pareto Property, Independence of
Irrelevant Alternatives and Absence of Dictator. These epistemic versions of
social postulates are given, essentially, in terms of the finite propositional
logic. We state some representation theorems for these operators. These
extensions and representation theorems allow us to establish an epistemic and
very general version of Arrow's Impossibility Theorem. One of the interesting
features of our result, is that it holds for different representations of
epistemic states; for instance conditionals, Ordinal Conditional functions and,
of course, total preorders.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2016 23:05:39 GMT'}]",2016-06-16,"[['Díaz', 'Amílcar Mata', ''], ['Pérez', 'Ramón Pino', '']]","['Belief merging', 'epistemic states', 'Arrow’s Impossibility Theorem']"
15338,1206.0232,Dai Liyun,Liyun Dai and Bican Xia,Non-Termination Sets of Simple Linear Loops,"15 pages, 3 figures",,,,cs.LO,http://creativecommons.org/licenses/by/3.0/,"  A simple linear loop is a simple while loop with linear assignments and
linear loop guards. If a simple linear loop has only two program variables, we
give a complete algorithm for computing the set of all the inputs on which the
loop does not terminate. For the case of more program variables, we show that
the non-termination set cannot be described by Tarski formulae in general
","[{'version': 'v1', 'created': 'Thu, 31 May 2012 11:28:23 GMT'}]",2015-03-20,"[['Dai', 'Liyun', ''], ['Xia', 'Bican', '']]","['Simple linear loop', 'termination', 'non-termination set', 'eigenvalue', 'Tarski formula']"
15339,1406.4973,Gaetan Marceau,"Ga\'etan Marceau (LRI, INRIA Saclay - Ile de France), Marc Schoenauer
  (LRI, INRIA Saclay - Ile de France)",Racing Multi-Objective Selection Probabilities,,"13th International Conference on Parallel Problem Solving from
  Nature, Ljubljana : France (2014)",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the context of Noisy Multi-Objective Optimization, dealing with
uncertainties requires the decision maker to define some preferences about how
to handle them, through some statistics (e.g., mean, median) to be used to
evaluate the qualities of the solutions, and define the corresponding Pareto
set. Approximating these statistics requires repeated samplings of the
population, drastically increasing the overall computational cost. To tackle
this issue, this paper proposes to directly estimate the probability of each
individual to be selected, using some Hoeffding races to dynamically assign the
estimation budget during the selection step. The proposed racing approach is
validated against static budget approaches with NSGA-II on noisy versions of
the ZDT benchmark functions.
","[{'version': 'v1', 'created': 'Thu, 19 Jun 2014 08:07:47 GMT'}]",2014-06-20,"[['Marceau', 'Gaétan', '', 'LRI, INRIA Saclay - Ile de France'], ['Schoenauer', 'Marc', '', 'LRI, INRIA Saclay - Ile de France']]","['Multi-Objective Evolutionary Optimization', 'Hoeffding Races', 'Uncertaintly Handling', 'Noisy Multiobjective Optimization']"
15340,1610.06832,Peter Thiemann,Peter Thiemann,"Partial Derivatives for Context-Free Languages: From $\mu$-Regular
  Expressions to Pushdown Automata",22 pages = 15 pages + bibliography + proofs; accepted by FoSSaCS 2017,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We extend Antimirov's partial derivatives from regular expressions to
$\mu$-regular expressions that describe context-free languages. We prove the
correctness of partial derivatives as well as the finiteness of the set of
iterated partial derivatives. The latter are used as pushdown symbols in our
construction of a nondeterministic pushdown automaton, which generalizes
Antimirov's NFA construction.
","[{'version': 'v1', 'created': 'Fri, 21 Oct 2016 15:53:18 GMT'}, {'version': 'v2', 'created': 'Mon, 31 Oct 2016 19:32:50 GMT'}, {'version': 'v3', 'created': 'Mon, 2 Jan 2017 18:27:57 GMT'}]",2017-01-03,"[['Thiemann', 'Peter', '']]","['automata and logic', 'regular languages', 'context-free languages', 'pushdown automata', 'derivatives']"
15341,1312.7446,Sheng Huang,"Sheng Huang and Dan Yang and Haopeng Zhang and Luwen Huangfu and
  Xiaohong Zhang","Shape Primitive Histogram: A Novel Low-Level Face Representation for
  Face Recognition","second version, two columns and 11 pages",,,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We further exploit the representational power of Haar wavelet and present a
novel low-level face representation named Shape Primitives Histogram (SPH) for
face recognition. Since human faces exist abundant shape features, we address
the face representation issue from the perspective of the shape feature
extraction. In our approach, we divide faces into a number of tiny shape
fragments and reduce these shape fragments to several uniform atomic shape
patterns called Shape Primitives. A convolution with Haar Wavelet templates is
applied to each shape fragment to identify its belonging shape primitive. After
that, we do a histogram statistic of shape primitives in each spatial local
image patch for incorporating the spatial information. Finally, each face is
represented as a feature vector via concatenating all the local histograms of
shape primitives. Four popular face databases, namely ORL, AR, Yale-B and LFW-a
databases, are employed to evaluate SPH and experimentally study the choices of
the parameters. Extensive experimental results demonstrate that the proposed
approach outperform the state-of-the-arts.
","[{'version': 'v1', 'created': 'Sat, 28 Dec 2013 16:09:59 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Feb 2014 00:36:10 GMT'}, {'version': 'v3', 'created': 'Tue, 22 Jul 2014 02:37:56 GMT'}]",2014-07-23,"[['Huang', 'Sheng', ''], ['Yang', 'Dan', ''], ['Zhang', 'Haopeng', ''], ['Huangfu', 'Luwen', ''], ['Zhang', 'Xiaohong', '']]","['Face Recognition', 'Haar Wavelet', 'Image Representation', 'Image Descriptor', 'Image classification']"
15342,1511.01223,Philipp Haller,Lucas Wiener and Tomas Ekholm and Philipp Haller,Modular Responsive Web Design using Element Queries,,,,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Responsive Web Design (RWD) enables web applications to adapt to the
characteristics of different devices such as screen size which is important for
mobile browsing. Today, the only W3C standard to support this adaptability is
CSS media queries. However, using media queries it is impossible to create
applications in a modular way, because responsive elements then always depend
on the global context. Hence, responsive elements can only be reused if the
global context is exactly the same, severely limiting their reusability. This
makes it extremely challenging to develop large responsive applications,
because the lack of true modularity makes certain requirement changes either
impossible or expensive to realize.
  In this paper we extend RWD to also include responsive modules, i.e., modules
that adapt their design based on their local context independently of the
global context. We present the ELQ project which implements our approach. ELQ
is a novel implementation of so-called element queries which generalize media
queries. Importantly, our design conforms to existing web specifications,
enabling adoption on a large scale. ELQ is designed to be heavily extensible
using plugins. Experimental results show speed-ups of the core algorithms of up
to 37x compared to previous approaches.
","[{'version': 'v1', 'created': 'Wed, 4 Nov 2015 06:52:59 GMT'}]",2015-11-05,"[['Wiener', 'Lucas', ''], ['Ekholm', 'Tomas', ''], ['Haller', 'Philipp', '']]","['Responsive web design', 'Element queries', 'CSS', 'Modularity', 'Web']"
15343,1607.00259,Nathanael Fijalkow,"Nathana\""el Fijalkow",Lower Bounds for Alternating Online State Complexity,,,,,cs.CC cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The notion of Online State Complexity, introduced by Karp in 1967, quantifies
the amount of states required to solve a given problem using an online
algorithm, which is represented by a deterministic machine scanning the input
from left to right in one pass. In this paper, we extend the setting to
alternating machines as introduced by Chandra, Kozen and Stockmeyer in 1976:
such machines run independent passes scanning the input from left to right and
gather their answers through boolean combinations. We devise a lower bound
technique relying on boundedly generated lattices of languages, and give two
applications of this technique. The first is a hierarchy theorem , stating that
the polynomial hierarchy of alternating online state complexity is infinite,
and the second is a linear lower bound on the alternating online state
complexity of the prime numbers written in binary. This second result
strengthens a result of Hartmanis and Shank from 1968, which implies an
exponentially worse lower bound for the same model.
","[{'version': 'v1', 'created': 'Fri, 1 Jul 2016 14:30:00 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Nov 2016 09:33:31 GMT'}]",2016-11-10,"[['Fijalkow', 'Nathanaël', '']]","['Online State Complexity', 'Lower Bounds', 'Alternating Machines', 'Hierarchy Theorem', 'Prime Numbers']"
15344,1510.06175,Filippo Palumbo,"Mario G. C. A. Cimino, Nedo Celandroni, Erina Ferro, Davide La Rosa,
  Filippo Palumbo and Gigliola Vaglini","Wireless communication, identification and sensing technologies enabling
  integrated logistics: a study in the harbor environment",,http://esjournals.org//journaloftechnology/Download_Sep_2015_pdf_5.php,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last decade, integrated logistics has become an important challenge in
the development of wireless communication, identification and sensing
technology, due to the growing complexity of logistics processes and the
increasing demand for adapting systems to new requirements. The advancement of
wireless technology provides a wide range of options for the maritime container
terminals. Electronic devices employed in container terminals reduce the manual
effort, facilitating timely information flow and enhancing control and quality
of service and decision made. In this paper, we examine the technology that can
be used to support integration in harbor's logistics. In the literature, most
systems have been developed to address specific needs of particular harbors,
but a systematic study is missing. The purpose is to provide an overview to the
reader about which technology of integrated logistics can be implemented and
what remains to be addressed in the future.
","[{'version': 'v1', 'created': 'Wed, 21 Oct 2015 09:36:09 GMT'}]",2019-01-29,"[['Cimino', 'Mario G. C. A.', ''], ['Celandroni', 'Nedo', ''], ['Ferro', 'Erina', ''], ['La Rosa', 'Davide', ''], ['Palumbo', 'Filippo', ''], ['Vaglini', 'Gigliola', '']]","['Wireless Communication', 'Harbor’s Logistics', 'Marine Container Terminal', 'Identification Technology', 'Sensing Technology   1']"
15345,1512.01370,Yantao Jia,"Yantao Jia, Yuanzhuo Wang, Hailun Lin, Xiaolong Jin, Xueqi Cheng",Locally Adaptive Translation for Knowledge Graph Embedding,,,,,cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge graph embedding aims to represent entities and relations in a
large-scale knowledge graph as elements in a continuous vector space. Existing
methods, e.g., TransE and TransH, learn embedding representation by defining a
global margin-based loss function over the data. However, the optimal loss
function is determined during experiments whose parameters are examined among a
closed set of candidates. Moreover, embeddings over two knowledge graphs with
different entities and relations share the same set of candidate loss
functions, ignoring the locality of both graphs. This leads to the limited
performance of embedding related applications. In this paper, we propose a
locally adaptive translation method for knowledge graph embedding, called
TransA, to find the optimal loss function by adaptively determining its margin
over different knowledge graphs. Experiments on two benchmark data sets
demonstrate the superiority of the proposed method, as compared to
the-state-of-the-art ones.
","[{'version': 'v1', 'created': 'Fri, 4 Dec 2015 11:09:55 GMT'}]",2015-12-07,"[['Jia', 'Yantao', ''], ['Wang', 'Yuanzhuo', ''], ['Lin', 'Hailun', ''], ['Jin', 'Xiaolong', ''], ['Cheng', 'Xueqi', '']]","['locally adaptive translation', 'knowledge graphembedding', 'optimal margin']"
15346,1301.2722,Christopher Hollander,"Christopher D. Hollander, Annie S. Wu",Distributed Consensus Formation Through Unconstrained Gossiping,,,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Gossip algorithms are widely used to solve the distributed consensus problem,
but issues can arise when nodes receive multiple signals either at the same
time or before they are able to finish processing their current work load.
Specifically, a node may assume a new state that represents a linear
combination of all received signals; even if such a state makes no sense in the
problem domain. As a solution to this problem, we introduce the notion of
conflict resolution for gossip algorithms and prove that their application
leads to a valid consensus state when the underlying communication network
possesses certain properties. We also introduce a methodology based on
absorbing Markov chains for analyzing gossip algorithms that make use of these
conflict resolution algorithms. This technique allows us to calculate both the
probabilities of converging to a specific consensus state and the time that
such convergence is expected to take. Finally, we make use of simulation to
validate our methodology and explore the temporal behavior of gossip algorithms
as the size of the network, the number of states per node, and the network
density increase.
","[{'version': 'v1', 'created': 'Sat, 12 Jan 2013 20:58:17 GMT'}]",2013-01-15,"[['Hollander', 'Christopher D.', ''], ['Wu', 'Annie S.', '']]","['consensus', 'distributed consensus algorithms', 'gossip algorithms', 'networks', 'markov chains']"
15347,1610.02442,Steve Chang,Steve Chang,"InfraNotes: Inconspicuous Handwritten Trajectory Tracking for Lecture
  Note Recording with Infrared Sensors",,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lecture notes are important for students to review and understand the key
points in the class. Unfortunately, the students often miss or lose part of the
lecture notes. In this paper, we design and implement an infrared sensor based
system, InfraNotes, to automatically record the notes on the board by sensing
and analyzing hand gestures of the lecturer. Compared with existing techniques,
our system does not require special accessories with lecturers such as
sensor-facilitated pens, writing surfaces or the video-taping infrastructure.
Instead, it only has an infrared-sensor module on the eraser holder of
black/white board to capture handwritten trajectories. With a lightweight
framework for handwritten trajectory processing, clear lecture notes can be
generated automatically. We evaluate the quality of lecture notes by three
standard character recognition techniques. The results indicate that InfraNotes
is a promising solution to create clear and complete lectures to promote the
education.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2016 22:57:55 GMT'}]",2016-10-11,"[['Chang', 'Steve', '']]","['Lecture note', 'Handwritten', 'LeapMotion', 'OCR', 'Infrared', 'Inconspicuous']"
15348,1407.4992,Nicolas Le Nov\`ere,"Frank T. Bergmann, Richard Adams, Stuart Moodie, Jonathan Cooper,
  Mihai Glont, Martin Golebiewski, Michael Hucka, Camille Laibe, Andrew K.
  Miller, David P. Nickerson, Brett G. Olivier, Nicolas Rodriguez, Herbert M.
  Sauro, Martin Scharm, Stian Soiland-Reyes, Dagmar Waltemath, Florent Yvon,
  Nicolas Le Nov\`ere","One file to share them all: Using the COMBINE Archive and the OMEX
  format to share all information about a modeling project","3 figures, 1 table",,,,cs.DL q-bio.MN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: With the ever increasing use of computational models in the
biosciences, the need to share models and reproduce the results of published
studies efficiently and easily is becoming more important. To this end, various
standards have been proposed that can be used to describe models, simulations,
data or other essential information in a consistent fashion. These constitute
various separate components required to reproduce a given published scientific
result.
  Results: We describe the Open Modeling EXchange format (OMEX). Together with
the use of other standard formats from the Computational Modeling in Biology
Network (COMBINE), OMEX is the basis of the COMBINE Archive, a single file that
supports the exchange of all the information necessary for a modeling and
simulation experiment in biology. An OMEX file is a ZIP container that includes
a manifest file, listing the content of the archive, an optional metadata file
adding information about the archive and its content, and the files describing
the model. The content of a COMBINE Archive consists of files encoded in
COMBINE standards whenever possible, but may include additional files defined
by an Internet Media Type. Several tools that support the COMBINE Archive are
available, either as independent libraries or embedded in modeling software.
  Conclusions: The COMBINE Archive facilitates the reproduction of modeling and
simulation experiments in biology by embedding all the relevant information in
one file. Having all the information stored and exchanged at once also helps in
building activity logs and audit trails. We anticipate that the COMBINE Archive
will become a significant help for modellers, as the domain moves to larger,
more complex experiments such as multi-scale models of organs, digital
organisms, and bioengineering.
","[{'version': 'v1', 'created': 'Fri, 18 Jul 2014 13:41:10 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Sep 2014 15:38:48 GMT'}]",2014-10-01,"[['Bergmann', 'Frank T.', ''], ['Adams', 'Richard', ''], ['Moodie', 'Stuart', ''], ['Cooper', 'Jonathan', ''], ['Glont', 'Mihai', ''], ['Golebiewski', 'Martin', ''], ['Hucka', 'Michael', ''], ['Laibe', 'Camille', ''], ['Miller', 'Andrew K.', ''], ['Nickerson', 'David P.', ''], ['Olivier', 'Brett G.', ''], ['Rodriguez', 'Nicolas', ''], ['Sauro', 'Herbert M.', ''], ['Scharm', 'Martin', ''], ['Soiland-Reyes', 'Stian', ''], ['Waltemath', 'Dagmar', ''], ['Yvon', 'Florent', ''], ['Novère', 'Nicolas Le', '']]","['data format', 'archive', 'computational modeling', 'reproducible research', 'reproducible science']"
15349,1609.09654,Matev\v{z} Jekovec,"Matev\v{z} Jekovec, Andrej Brodnik",ERA Revisited: Theoretical and Experimental Evaluation,,,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efficient construction of the suffix tree given an input text is an active
area of research from the time it was first introduced. Both theoretical
computer scientists and engineers tackled the problem. In this paper we focus
on the fastest practical suffix tree construction algorithm to date, ERA. We
first provide a theoretical analysis of the algorithm assuming the uniformly
random text as an input and using the PEM model of computation with respect to
the lower bounds. Secondly, we empirically confirm the theoretical results in
different test scenarios exposing the critical terms. Thirdly, we discuss the
fundamental characteristics of the input text where the fastest suffix tree
construction algorithms in practice fail. This paper serves as a foundation for
further research in the parallel text indexing area.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2016 09:51:36 GMT'}]",2016-10-03,"[['Jekovec', 'Matevž', ''], ['Brodnik', 'Andrej', '']]","['suffix tree', 'parallelism', 'external memory', 'sequence indexing']"
15350,1004.4057,Amit Deshpande,Amit Deshpande and Luis Rademacher,Efficient volume sampling for row/column subset selection,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give efficient algorithms for volume sampling, i.e., for picking
$k$-subsets of the rows of any given matrix with probabilities proportional to
the squared volumes of the simplices defined by them and the origin (or the
squared volumes of the parallelepipeds defined by these subsets of rows). This
solves an open problem from the monograph on spectral algorithms by Kannan and
Vempala. Our first algorithm for volume sampling $k$-subsets of rows from an
$m$-by-$n$ matrix runs in $O(kmn^{\omega} \log n)$ arithmetic operations and a
second variant of it for $(1+\epsilon)$-approximate volume sampling runs in
$O(mn \log m \cdot k^{2}/\epsilon^{2} + m \log^{\omega} m \cdot
k^{2\omega+1}/\epsilon^{2\omega} \cdot \log(k \epsilon^{-1} \log m))$
arithmetic operations, which is almost linear in the size of the input (i.e.,
the number of entries) for small $k$. Our efficient volume sampling algorithms
imply several interesting results for low-rank matrix approximation.
","[{'version': 'v1', 'created': 'Fri, 23 Apr 2010 06:53:25 GMT'}]",2010-04-26,"[['Deshpande', 'Amit', ''], ['Rademacher', 'Luis', '']]","['volume sampling', 'low-rank matrix approximation', 'row/column subset selection']"
15351,1109.3070,Hernan Haimovich,Hernan Haimovich and Julio H. Braslavsky,"Sufficient conditions for the genericity of feedback stabilisability of
  switching systems via Lie-algebraic solvability","Extended version of that accepted at the XIV Workshop on Information
  Processing and Control (RPIC), Oro Verde, Entre Rios, Argentina, 2011",,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the stabilisation of discrete-time switching linear
systems (DTSSs) with control inputs under arbitrary switching, based on the
existence of a common quadratic Lyapunov function (CQLF). The authors have
begun a line of work dealing with control design based on the Lie-algebraic
solvability property. The present paper expands on earlier work by deriving
sufficient conditions under which the closed-loop system can be caused to
satisfy the Lie-algebraic solvability property generically, i.e. for almost
every set of system parameters, furthermore admitting straightforward and
efficient numerical implementation.
","[{'version': 'v1', 'created': 'Wed, 14 Sep 2011 13:14:50 GMT'}]",2011-09-15,"[['Haimovich', 'Hernan', ''], ['Braslavsky', 'Julio H.', '']]","['Switchingsystems', 'Liealgebras', 'Common eigenvector assignment', 'Transverse subspaces', 'Genericity']"
15352,1506.02449,Neli Blagus,"Neli Blagus, Lovro \v{S}ubelj, Marko Bajec",Empirical comparison of network sampling techniques,,,,,cs.SI physics.soc-ph,http://creativecommons.org/licenses/by/3.0/,"  In the past few years, the storage and analysis of large-scale and fast
evolving networks present a great challenge. Therefore, a number of different
techniques have been proposed for sampling large networks. In general, network
exploration techniques approximate the original networks more accurately than
random node and link selection. Yet, link selection with additional subgraph
induction step outperforms most other techniques. In this paper, we apply
subgraph induction also to random walk and forest-fire sampling. We analyze
different real-world networks and the changes of their properties introduced by
sampling. We compare several sampling techniques based on the match between the
original networks and their sampled variants. The results reveal that the
techniques with subgraph induction underestimate the degree and clustering
distribution, while overestimate average degree and density of the original
networks. Techniques without subgraph induction step exhibit exactly the
opposite behavior. Hence, the performance of the sampling techniques from
random selection category compared to network exploration sampling does not
differ significantly, while clear differences exist between the techniques with
subgraph induction step and the ones without it.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2015 11:39:13 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Jun 2015 13:45:27 GMT'}]",2015-06-10,"[['Blagus', 'Neli', ''], ['Šubelj', 'Lovro', ''], ['Bajec', 'Marko', '']]","['complex networks', 'network sampling', 'comparison of sampling techniques', 'subgraph induction', 'sampling accuracy']"
15353,1704.02602,Ferda Ofli,"Dat Tien Nguyen, Firoj Alam, Ferda Ofli, Muhammad Imran","Automatic Image Filtering on Social Networks Using Deep Learning and
  Perceptual Hashing During Crises","Accepted for publication in the 14th International Conference on
  Information Systems For Crisis Response and Management (ISCRAM), 2017",,,,cs.CY cs.CV cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The extensive use of social media platforms, especially during disasters,
creates unique opportunities for humanitarian organizations to gain situational
awareness and launch relief operations accordingly. In addition to the textual
content, people post overwhelming amounts of imagery data on social networks
within minutes of a disaster hit. Studies point to the importance of this
online imagery content for emergency response. Despite recent advances in the
computer vision field, automatic processing of the crisis-related social media
imagery data remains a challenging task. It is because a majority of which
consists of redundant and irrelevant content. In this paper, we present an
image processing pipeline that comprises de-duplication and relevancy filtering
mechanisms to collect and filter social media image content in real-time during
a crisis event. Results obtained from extensive experiments on real-world
crisis datasets demonstrate the significance of the proposed pipeline for
optimal utilization of both human and machine computing resources.
","[{'version': 'v1', 'created': 'Sun, 9 Apr 2017 13:34:27 GMT'}]",2017-04-11,"[['Nguyen', 'Dat Tien', ''], ['Alam', 'Firoj', ''], ['Ofli', 'Ferda', ''], ['Imran', 'Muhammad', '']]","['social media', 'image processing', 'supervised classification', 'disaster management']"
15354,1407.1808,Bharath Hariharan,"Bharath Hariharan and Pablo Arbel\'aez and Ross Girshick and Jitendra
  Malik",Simultaneous Detection and Segmentation,"To appear in the European Conference on Computer Vision (ECCV), 2014",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We aim to detect all instances of a category in an image and, for each
instance, mark the pixels that belong to it. We call this task Simultaneous
Detection and Segmentation (SDS). Unlike classical bounding box detection, SDS
requires a segmentation and not just a box. Unlike classical semantic
segmentation, we require individual object instances. We build on recent work
that uses convolutional neural networks to classify category-independent region
proposals (R-CNN [16]), introducing a novel architecture tailored for SDS. We
then use category-specific, top- down figure-ground predictions to refine our
bottom-up proposals. We show a 7 point boost (16% relative) over our baselines
on SDS, a 5 point boost (10% relative) over state-of-the-art on semantic
segmentation, and state-of-the-art performance in object detection. Finally, we
provide diagnostic tools that unpack performance and provide directions for
future work.
","[{'version': 'v1', 'created': 'Mon, 7 Jul 2014 18:59:11 GMT'}]",2014-07-08,"[['Hariharan', 'Bharath', ''], ['Arbeláez', 'Pablo', ''], ['Girshick', 'Ross', ''], ['Malik', 'Jitendra', '']]","['detection', 'segmentation', 'convolutional networks']"
15355,1212.3268,Gilles Puy,Gilles Puy and Pierre Vandergheynst,Robust image reconstruction from multi-view measurements,Accepted in SIAM Journal on Imaging Sciences,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel method to accurately reconstruct a set of images
representing a single scene from few linear multi-view measurements. Each
observed image is modeled as the sum of a background image and a foreground
one. The background image is common to all observed images but undergoes
geometric transformations, as the scene is observed from different viewpoints.
In this paper, we assume that these geometric transformations are represented
by a few parameters, e.g., translations, rotations, affine transformations,
etc.. The foreground images differ from one observed image to another, and are
used to model possible occlusions of the scene. The proposed reconstruction
algorithm estimates jointly the images and the transformation parameters from
the available multi-view measurements. The ideal solution of this multi-view
imaging problem minimizes a non-convex functional, and the reconstruction
technique is an alternating descent method built to minimize this functional.
The convergence of the proposed algorithm is studied, and conditions under
which the sequence of estimated images and parameters converges to a critical
point of the non-convex functional are provided. Finally, the efficiency of the
algorithm is demonstrated using numerical simulations for applications such as
compressed sensing or super-resolution.
","[{'version': 'v1', 'created': 'Thu, 13 Dec 2012 19:00:17 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Jun 2013 10:52:45 GMT'}, {'version': 'v3', 'created': 'Tue, 17 Sep 2013 22:38:58 GMT'}]",2013-09-19,"[['Puy', 'Gilles', ''], ['Vandergheynst', 'Pierre', '']]","['compressed sensing', 'inverse problem', 'non-convex optimization', 'super-resolution', 'robust image alignment']"
15356,1403.6274,Kieran Greer Dr,Kieran Greer,Arguments for Nested Patterns in Neural Ensembles,Preprint,"Proceedings of the Science and Information Conference (SAI'14),
  August 27-29, 2014, pp. 488 - 492",,,cs.NE q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a relatively simple way of allowing a brain model to
self-organise its concept patterns through nested structures. Time is a key
element and a simulator would be able to show how patterns may form and then
fire in sequence, as part of a search or thought process. It uses a very simple
equation to show how the inhibitors in particular, can switch off certain
areas, to allow other areas to become the prominent ones and thereby define the
current brain state. This allows for a small amount of control over what
appears to be a chaotic structure inside of the brain. It is attractive because
it is still mostly mechanical and therefore can be added as an automatic
process, or the modelling of that. The paper also describes how the nested
pattern structure can be used as a basic counting mechanism.
","[{'version': 'v1', 'created': 'Tue, 25 Mar 2014 10:16:09 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Apr 2014 10:36:30 GMT'}]",2014-09-05,"[['Greer', 'Kieran', '']]","['neural modelling', 'self-organise', 'connection strengths', 'mathematical process']"
15357,1203.0435,Pierre de Leusse,"Pierre de Leusse, Bartosz Kwolek and Krzysztof Zielinski",A common interface for multi-rule-engine distributed systems,,"RuleML-2010 Challenge: 4th international rule challenge : Web rule
  symposium : Washington, DC, USA, October, 21-23, 2010, eds. Monica Palmirani,
  [et al.]",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rule technological landscape is becoming ever more complex, with an
extended number of specifications and products. It is therefore becoming
increasingly difficult to integrate rule-driven components and manage
interoperability in multi-rule engine environments. The described work presents
the possibility to provide a common interface for rule-driven components in a
distributed system. The authors' approach leverages on a set of discovery
protocol, rule interchange and user interface to alleviate the environment's
complexity.
","[{'version': 'v1', 'created': 'Fri, 2 Mar 2012 12:07:57 GMT'}]",2012-03-05,"[['de Leusse', 'Pierre', ''], ['Kwolek', 'Bartosz', ''], ['Zielinski', 'Krzysztof', '']]","['Rule-Based Distributed Systems', 'rule interchange', 'RIF', 'Jess', 'Drools']"
15358,1309.7824,Patrick Loiseau,"Nicolas Gast, Stratis Ioannidis, Patrick Loiseau, and Benjamin
  Roussillon",Linear Regression from Strategic Data Sources,"This version (v3) extends the results on the sub-optimality of GLS
  (Section 6) and improves writing in multiple places compared to v2. Compared
  to the initial version v1, it also fixes an error in Theorem 6 (now Theorem
  5), and extended many of the results",,,,cs.GT cs.LG math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linear regression is a fundamental building block of statistical data
analysis. It amounts to estimating the parameters of a linear model that maps
input features to corresponding outputs. In the classical setting where the
precision of each data point is fixed, the famous Aitken/Gauss-Markov theorem
in statistics states that generalized least squares (GLS) is a so-called ""Best
Linear Unbiased Estimator"" (BLUE). In modern data science, however, one often
faces strategic data sources, namely, individuals who incur a cost for
providing high-precision data.
  In this paper, we study a setting in which features are public but
individuals choose the precision of the outputs they reveal to an analyst. We
assume that the analyst performs linear regression on this dataset, and
individuals benefit from the outcome of this estimation. We model this scenario
as a game where individuals minimize a cost comprising two components: (a) an
(agent-specific) disclosure cost for providing high-precision data; and (b) a
(global) estimation cost representing the inaccuracy in the linear model
estimate. In this game, the linear model estimate is a public good that
benefits all individuals. We establish that this game has a unique non-trivial
Nash equilibrium. We study the efficiency of this equilibrium and we prove
tight bounds on the price of stability for a large class of disclosure and
estimation costs. Finally, we study the estimator accuracy achieved at
equilibrium. We show that, in general, Aitken's theorem does not hold under
strategic data sources, though it does hold if individuals have identical
disclosure costs (up to a multiplicative factor). When individuals have
non-identical costs, we derive a bound on the improvement of the equilibrium
estimation cost that can be achieved by deviating from GLS, under mild
assumptions on the disclosure cost functions.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2013 12:48:35 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Jul 2019 14:29:00 GMT'}, {'version': 'v3', 'created': 'Thu, 12 Dec 2019 23:47:00 GMT'}]",2019-12-16,"[['Gast', 'Nicolas', ''], ['Ioannidis', 'Stratis', ''], ['Loiseau', 'Patrick', ''], ['Roussillon', 'Benjamin', '']]","['Linear regression', 'Aitken theorem', 'Gauss-Markov theorem', 'strategic datasources', 'potential game', 'price of stability']"
15359,0802.4198,Andrij Rovenchak,"Solomija Buk, J\'an Ma\v{c}utek, Andrij Rovenchak",Some properties of the Ukrainian writing system,17 pages,"Glottometrics 16, 63-79 (2008)",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the grapheme-phoneme relation in Ukrainian and some properties
of the Ukrainian version of the Cyrillic alphabet.
","[{'version': 'v1', 'created': 'Thu, 28 Feb 2008 12:58:49 GMT'}]",2008-03-18,"[['Buk', 'Solomija', ''], ['Mačutek', 'Ján', ''], ['Rovenchak', 'Andrij', '']]","['Ukrainian', 'phoneme-grapheme relation', 'script analysis.   1']"
15360,0903.2543,Khaled Khalil,"Khaled M. Khalil, M. Abdel-Aziz, Taymour T. Nazmy, Abdel-Badeeh M.
  Salem","Multi-Agent Crisis Response systems - Design Requirements and Analysis
  of Current Systems","6 pages, 1 figure, accepted at Fourth International Conference on
  Intelligent Computing and Information Systems 2009",,,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crisis response is a critical area of research, with encouraging progress in
the past view yeas. The aim of the research is to contribute to building future
crisis environment where software agents, robots, responders, crisis managers,
and crisis organizations interact to provide advice, protection and aid. This
paper discusses the crisis response domain requirements, and provides analysis
of five crisis response systems namely: DrillSim [2], DEFACTO [15], ALADDIN
[1], RoboCup Rescue [18], and FireGrid [3]. Analysis of systems includes
systems architecture and methodology. In addition, we identified features and
limitations of systems based on crisis response domain requirements.
","[{'version': 'v1', 'created': 'Sat, 14 Mar 2009 12:13:32 GMT'}]",2009-03-17,"[['Khalil', 'Khaled M.', ''], ['Abdel-Aziz', 'M.', ''], ['Nazmy', 'Taymour T.', ''], ['Salem', 'Abdel-Badeeh M.', '']]","['Crisis Management', 'Crisis Response', 'Multi-agent Systems', 'Agent Based Modeling', 'Disaster Management', 'System Analysis']"
15361,1802.09118,Yonatan Naamad,"Moses Charikar, Yonatan Naamad, Jennifer Rexford, X. Kelvin Zou",Multi-Commodity Flow with In-Network Processing,,,,,cs.DS cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern networks run ""middleboxes"" that offer services ranging from network
address translation and server load balancing to firewalls, encryption, and
compression. In an industry trend known as Network Functions Virtualization
(NFV), these middleboxes run as virtual machines on any commodity server, and
the switches steer traffic through the relevant chain of services. Network
administrators must decide how many middleboxes to run, where to place them,
and how to direct traffic through them, based on the traffic load and the
server and network capacity. Rather than placing specific kinds of middleboxes
on each processing node, we argue that server virtualization allows each server
node to host all middlebox functions, and simply vary the fraction of resources
devoted to each one. This extra flexibility fundamentally changes the
optimization problem the network administrators must solve to a new kind of
multi-commodity flow problem, where the traffic flows consume bandwidth on the
links as well as processing resources on the nodes. We show that allocating
resources to maximize the processed flow can be optimized exactly via a linear
programming formulation, and to arbitrary accuracy via an efficient
combinatorial algorithm. Our experiments with real traffic and topologies show
that a joint optimization of node and link resources leads to an efficient use
of bandwidth and processing capacity. We also study a class of design problems
that decide where to provide node capacity to best process and route a given
set of demands, and demonstrate both approximation algorithms and hardness
results for these problems.
","[{'version': 'v1', 'created': 'Mon, 26 Feb 2018 01:07:32 GMT'}]",2018-02-27,"[['Charikar', 'Moses', ''], ['Naamad', 'Yonatan', ''], ['Rexford', 'Jennifer', ''], ['Zou', 'X. Kelvin', '']]","['multicommodity flow', 'middleboxes', 'network function virtualization', 'approximation algorithms', 'hardness of approximation']"
15362,1606.08905,Disa Mhembere,"Disa Mhembere, Da Zheng, Carey E. Priebe, Joshua T. Vogelstein and
  Randal Burns","knor: A NUMA-Optimized In-Memory, Distributed and Semi-External-Memory
  k-means Library",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  k-means is one of the most influential and utilized machine learning
algorithms. Its computation limits the performance and scalability of many
statistical analysis and machine learning tasks. We rethink and optimize
k-means in terms of modern NUMA architectures to develop a novel
parallelization scheme that delays and minimizes synchronization barriers. The
\textit{k-means NUMA Optimized Routine} (\textsf{knor}) library has (i)
in-memory (\textsf{knori}), (ii) distributed memory (\textsf{knord}), and (iii)
semi-external memory (\textsf{knors}) modules that radically improve the
performance of k-means for varying memory and hardware budgets. \textsf{knori}
boosts performance for single machine datasets by an order of magnitude or
more. \textsf{knors} improves the scalability of k-means on a memory budget
using SSDs. \textsf{knors} scales to billions of points on a single machine,
using a fraction of the resources that distributed in-memory systems require.
\textsf{knord} retains \textsf{knori}'s performance characteristics, while
scaling in-memory through distributed computation in the cloud. \textsf{knor}
modifies Elkan's triangle inequality pruning algorithm such that we utilize it
on billion-point datasets without the significant memory overhead of the
original algorithm. We demonstrate \textsf{knor} outperforms distributed
commercial products like H$_2$O, Turi (formerly Dato, GraphLab) and Spark's
MLlib by more than an order of magnitude for datasets of $10^7$ to $10^9$
points.
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2016 22:25:58 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Jan 2017 18:34:30 GMT'}, {'version': 'v3', 'created': 'Thu, 9 Mar 2017 08:29:49 GMT'}, {'version': 'v4', 'created': 'Thu, 16 Mar 2017 20:47:39 GMT'}, {'version': 'v5', 'created': 'Mon, 1 May 2017 07:13:39 GMT'}, {'version': 'v6', 'created': 'Sat, 24 Jun 2017 05:53:16 GMT'}]",2017-06-27,"[['Mhembere', 'Disa', ''], ['Zheng', 'Da', ''], ['Priebe', 'Carey E.', ''], ['Vogelstein', 'Joshua T.', ''], ['Burns', 'Randal', '']]","['NUMA', 'k-means', 'semi-external memory', 'cloud', 'clustering', 'parallel']"
15363,1002.2012,Nuno Alves,Nuno Alves,Implementing Genetic Algorithms on Arduino Micro-Controllers,,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since their conception in 1975, Genetic Algorithms have been an extremely
popular approach to find exact or approximate solutions to optimization and
search problems. Over the last years there has been an enhanced interest in the
field with related techniques, such as grammatical evolution, being developed.
Unfortunately, work on developing genetic optimizations for low-end embedded
architectures hasn't embraced the same enthusiasm. This short paper tackles
that situation by demonstrating how genetic algorithms can be implemented in
Arduino Duemilanove, a 16 MHz open-source micro-controller, with limited
computation power and storage resources. As part of this short paper, the
libraries used in this implementation are released into the public domain under
a GPL license.
","[{'version': 'v1', 'created': 'Wed, 10 Feb 2010 01:16:21 GMT'}]",2010-02-11,"[['Alves', 'Nuno', '']]","['Arduino Duemilanove', 'Genetic Algorithms', 'Embedded Systems']"
15364,1511.00472,Pascal Mettes,"Pascal Mettes, Robby T. Tan, Remco C. Veltkamp",Water Detection through Spatio-Temporal Invariant Descriptors,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we aim to segment and detect water in videos. Water detection
is beneficial for appllications such as video search, outdoor surveillance, and
systems such as unmanned ground vehicles and unmanned aerial vehicles. The
specific problem, however, is less discussed compared to general texture
recognition. Here, we analyze several motion properties of water. First, we
describe a video pre-processing step, to increase invariance against water
reflections and water colours. Second, we investigate the temporal and spatial
properties of water and derive corresponding local descriptors. The descriptors
are used to locally classify the presence of water and a binary water detection
mask is generated through spatio-temporal Markov Random Field regularization of
the local classifications. Third, we introduce the Video Water Database,
containing several hours of water and non-water videos, to validate our
algorithm. Experimental evaluation on the Video Water Database and the DynTex
database indicates the effectiveness of the proposed algorithm, outperforming
multiple algorithms for dynamic texture recognition and material recognition by
ca. 5% and 15% respectively.
","[{'version': 'v1', 'created': 'Mon, 2 Nov 2015 12:28:05 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Nov 2015 08:39:44 GMT'}]",2015-11-04,"[['Mettes', 'Pascal', ''], ['Tan', 'Robby T.', ''], ['Veltkamp', 'Remco C.', '']]","['Water detection', 'Spatio-temporal descriptors', 'Fourier analysis', 'Invariants', 'Markov Random Fields']"
15365,2006.04473,Hichem Sahbi,Ahmed Mazari and Hichem Sahbi,"Deep hierarchical pooling design for cross-granularity action
  recognition",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce a novel hierarchical aggregation design that
captures different levels of temporal granularity in action recognition. Our
design principle is coarse-to-fine and achieved using a tree-structured
network; as we traverse this network top-down, pooling operations are getting
less invariant but timely more resolute and well localized. Learning the
combination of operations in this network -- which best fits a given
ground-truth -- is obtained by solving a constrained minimization problem whose
solution corresponds to the distribution of weights that capture the
contribution of each level (and thereby temporal granularity) in the global
hierarchical pooling process. Besides being principled and well grounded, the
proposed hierarchical pooling is also video-length agnostic and resilient to
misalignments in actions. Extensive experiments conducted on the challenging
UCF-101 database corroborate these statements.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2020 11:03:54 GMT'}]",2020-06-09,"[['Mazari', 'Ahmed', ''], ['Sahbi', 'Hichem', '']]","['Hierarchical pooling', 'deep multiple representation learning', 'action recognition']"
15366,1301.2533,Paulo Shakarian,"Paulo Shakarian, Patrick Roos, Geoffrey Moores",A Novel Analytical Method for Evolutionary Graph Theory Problems,,,,,cs.GT cs.SI q-bio.PE,http://creativecommons.org/licenses/publicdomain/,"  Evolutionary graph theory studies the evolutionary dynamics of populations
structured on graphs. A central problem is determining the probability that a
small number of mutants overtake a population. Currently, Monte Carlo
simulations are used for estimating such fixation probabilities on general
directed graphs, since no good analytical methods exist. In this paper, we
introduce a novel deterministic framework for computing fixation probabilities
for strongly connected, directed, weighted evolutionary graphs under neutral
drift. We show how this framework can also be used to calculate the expected
number of mutants at a given time step (even if we relax the assumption that
the graph is strongly connected), how it can extend to other related models
(e.g. voter model), how our framework can provide non-trivial bounds for
fixation probability in the case of an advantageous mutant, and how it can be
used to find a non-trivial lower bound on the mean time to fixation. We provide
various experimental results determining fixation probabilities and expected
number of mutants on different graphs. Among these, we show that our method
consistently outperforms Monte Carlo simulations in speed by several orders of
magnitude. Finally we show how our approach can provide insight into synaptic
competition in neurology.
","[{'version': 'v1', 'created': 'Fri, 11 Jan 2013 16:23:19 GMT'}]",2013-01-14,"[['Shakarian', 'Paulo', ''], ['Roos', 'Patrick', ''], ['Moores', 'Geoffrey', '']]","['evolutionary dynamics', 'Moran process', 'complex networks']"
15367,1708.00275,Oliver Karras,"Oliver Karras, Jil Kl\""under, and Kurt Schneider",Is Task Board Customization Beneficial? - An Eye Tracking Study,"16 pages, 18th International Conference on Product-Focused Software
  Process Improvement (Profes 2017)",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The task board is an essential artifact in many agile development approaches.
It provides a good overview of the project status. Teams often customize their
task boards according to the team members' needs. They modify the structure of
boards, define colored codings for different purposes, and introduce different
card sizes. Although the customizations are intended to improve the task
board's usability and effectiveness, they may also complicate its comprehension
and use. The increased effort impedes the work of both the team and team
externals. Hence, task board customization is in conflict with the agile
practice of fast and easy overview for everyone. In an eye tracking study with
30 participants, we compared an original task board design with three
customized ones to investigate which design shortened the required time to
identify a particular story card. Our findings yield that only the customized
task board design with modified structures reduces the required time. The
original task board design is more beneficial than individual colored codings
and changed card sizes. According to our findings, agile teams should rethink
their current task board design. They may be better served by focusing on the
original task board design and by applying only carefully selected adjustments.
In case of customization, a task board's structure should be adjusted since
this is the only beneficial kind of customization, that additionally complies
more precisely with the concept of fast and easy project overview.
","[{'version': 'v1', 'created': 'Tue, 1 Aug 2017 12:18:38 GMT'}]",2017-08-02,"[['Karras', 'Oliver', ''], ['Klünder', 'Jil', ''], ['Schneider', 'Kurt', '']]","['Agile development', 'task board', 'customization', 'eye tracking']"
15368,0801.2226,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",Programming an interpreter using molecular dynamics,27 pages,"Scientific Annals of Computer Science, 17:47--81, 2007.
  http://www.infoiasi.ro/bin/download/Annals/XVII/XVII_2.pdf",,PRG0801,cs.PL,,"  PGA (ProGram Algebra) is an algebra of programs which concerns programs in
their simplest form: sequences of instructions. Molecular dynamics is a simple
model of computation developed in the setting of PGA, which bears on the use of
dynamic data structures in programming. We consider the programming of an
interpreter for a program notation that is close to existing assembly languages
using PGA with the primitives of molecular dynamics as basic instructions. It
happens that, although primarily meant for explaining programming language
features relating to the use of dynamic data structures, the collection of
primitives of molecular dynamics in itself is suited to our programming wants.
","[{'version': 'v1', 'created': 'Tue, 15 Jan 2008 07:56:12 GMT'}]",2008-04-08,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['interpreter', 'program algebra', 'molecular dynamics', 'thread algebra', 'action transforming service']"
15369,1511.06759,Safeeullah Soomro,"Tanesh Kumar, Faizan Khan, Safeeullah Soomro, Areez Khalil Memon",WLAN Specific IoT Enable Power Efficient RAM Design on 40nm FPGA,,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Increasing the speed of computer is one of the important aspects of the
Random Access Memory (RAM) and for better and fast processing it should be
efficient. In this work, the main focus is to design energy efficient RAM and
it also can be accessed through internet. A 128-bit IPv6 address is added to
the RAM in order to control it via internet. Four different types of Low
Voltage CMOS (LCVMOS) IO standards are used to make it low power under five
different WLAN frequencies is taken. At WLAN frequency 2.4GHz, there is maximum
power reduction of 85% is achieved when LVCMOS12 is taken in place of LVCMOS25.
This design is implemented using Virtex-6 FPGA, Device xc6vlx75t and Package
FF484
","[{'version': 'v1', 'created': 'Fri, 20 Nov 2015 18:44:37 GMT'}]",2015-11-24,"[['Kumar', 'Tanesh', ''], ['Khan', 'Faizan', ''], ['Soomro', 'Safeeullah', ''], ['Memon', 'Areez Khalil', '']]","['WLAN', 'Internet of Things (IoT)', 'RAM', 'FPGA', 'LVCMOS', 'IO Power']"
15370,0908.3233,Yavuz Oruc A.,A. Yavuz Oruc and Abdullah Atmaca,Asymptotically Optimal Assignments In Ordinal Evaluations of Proposals,,,,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In ordinal evaluations of proposals in peer review systems, a set of
proposals is assigned to a fixed set of referees so as to maximize the number
of pairwise comparisons of proposals under certain referee capacity and
proposal subject constraints. In this paper, the following two related problems
are considered: (1) Assuming that each referee has a capacity to review k out
of n proposals, 2 < k < n, determine the minimum number of referees needed to
ensure that each pair of proposals is reviewed by at least one referee, (2)
Find an assignment that meets the lower bound determined in (1). It is easy to
see that one referee is both necessary and sufficient when k = n, and n(n-1)/2
referees are both necessary and sufficient when k = 2. We show that 6 referees
are both necessary and sufficient when k = n/2. We further show that 11
referees are necessary and 12 are sufficient when k = n/3, and 18 referees are
necessary and 20 referees are sufficient when k = n/4. A more general lower
bound of n(n-1)/k(k-1) referees is also given for any k, 2 < k < n, and an
assignment asymptotically matching this lower bound within a factor of 2 is
presented. These results are not only theoretically interesting but they also
provide practical methods for efficient assignments of proposals to referees.
","[{'version': 'v1', 'created': 'Sat, 22 Aug 2009 07:08:30 GMT'}]",2009-08-25,"[['Oruc', 'A. Yavuz', ''], ['Atmaca', 'Abdullah', '']]","['asymptotically optimal assignment', 'panel assignment problem', 'peer review', 'proposal evaluation.  1']"
15371,1704.04815,Omid Taghizadeh M.Sc.,"Omid Taghizadeh, Vimal Radhakrishnan, Ali Cagatay Cirik, Rudolf
  Mathar, Lutz Lampe","Hardware Impairments Aware Transceiver Design for Bidirectional
  Full-Duplex MIMO OFDM Systems",Submitted to IEEE for publication,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we address the linear precoding and decoding design problem for
a bidirectional orthogonal frequencydivision multiplexing (OFDM) communication
system, between two multiple-input multiple-output (MIMO) full-duplex (FD)
nodes. The effects of hardware distortion as well as the channel state
information error are taken into account. In the first step, we transform the
available time-domain characterization of the hardware distortions for FD MIMO
transceivers to the frequency domain, via a linear Fourier transformation. As a
result, the explicit impact of hardware inaccuracies on the residual
selfinterference (RSI) and inter-carrier leakage (ICL) is formulated in
relation to the intended transmit/received signals. Afterwards, linear
precoding and decoding designs are proposed to enhance the system performance
following the minimum-mean-squarederror (MMSE) and sum rate maximization
strategies, assuming the availability of perfect or erroneous CSI. The proposed
designs are based on the application of alternating optimization over the
system parameters, leading to a necessary convergence. Numerical results
indicate that the application of a distortionaware design is essential for a
system with a high hardware distortion, or for a system with a low thermal
noise variance.
","[{'version': 'v1', 'created': 'Sun, 16 Apr 2017 20:25:32 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Jun 2017 16:58:14 GMT'}, {'version': 'v3', 'created': 'Thu, 8 Feb 2018 15:39:13 GMT'}]",2018-02-09,"[['Taghizadeh', 'Omid', ''], ['Radhakrishnan', 'Vimal', ''], ['Cirik', 'Ali Cagatay', ''], ['Mathar', 'Rudolf', ''], ['Lampe', 'Lutz', '']]","['Full-duplex', 'MIMO', 'OFDM', 'hardware impairments', 'MMSE']"
15372,1602.08565,"Isma\""el Jecker","Emmanuel Filiot, Isma\""el Jecker, Christof L\""oding, Sarah Winter",On Equivalence and Uniformisation Problems for Finite Transducers,,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transductions are binary relations of finite words. For rational
transductions, i.e., transductions defined by finite transducers, the
inclusion, equivalence and sequential uniformisation problems are known to be
undecidable. In this paper, we investigate stronger variants of inclusion,
equivalence and sequential uniformisation, based on a general notion of
transducer resynchronisation, and show their decidability. We also investigate
the classes of finite-valued rational transductions and deterministic rational
transductions, which are known to have a decidable equivalence problem. We show
that sequential uniformisation is also decidable for them.
","[{'version': 'v1', 'created': 'Sat, 27 Feb 2016 07:57:22 GMT'}]",2016-03-01,"[['Filiot', 'Emmanuel', ''], ['Jecker', 'Ismaël', ''], ['Löding', 'Christof', ''], ['Winter', 'Sarah', '']]","['Transducers', 'Equivalence', 'Uniformisation']"
15373,1401.6325,Jonathan Kochems,"Jonathan Kochems, C-H Luke Ong",Safety verification of asynchronous pushdown systems with shaped stacks,,,,,cs.LO cs.FL cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the program-point reachability problem of concurrent
pushdown systems that communicate via unbounded and unordered message buffers.
Our goal is to relax the common restriction that messages can only be retrieved
by a pushdown process when its stack is empty. We use the notion of partially
commutative context-free grammars to describe a new class of asynchronously
communicating pushdown systems with a mild shape constraint on the stacks for
which the program-point coverability problem remains decidable. Stacks that fit
the shape constraint may reach arbitrary heights; further a process may execute
any communication action (be it process creation, message send or retrieval)
whether or not its stack is empty. This class extends previous computational
models studied in the context of asynchronous programs, and enables the safety
verification of a large class of message passing programs.
","[{'version': 'v1', 'created': 'Fri, 24 Jan 2014 12:26:27 GMT'}]",2014-01-27,"[['Kochems', 'Jonathan', ''], ['Ong', 'C-H Luke', '']]","['Pushdown systems', 'asynchronous message passing', 'verification']"
15374,1701.06248,Xiao-Shan Gao,Yu-Ao Chen and Xiao-Shan Gao,"Criteria for Finite Difference Groebner Bases of Normal Binomial
  Difference Ideals",,,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we give decision criteria for normal binomial difference
polynomial ideals in the univariate difference polynomial ring F{y} to have
finite difference Groebner bases and an algorithm to compute the finite
difference Groebner bases if these criteria are satisfied. The novelty of these
criteria lies in the fact that complicated properties about difference
polynomial ideals are reduced to elementary properties of univariate
polynomials in Z[x].
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2017 01:39:32 GMT'}]",2017-01-24,"[['Chen', 'Yu-Ao', ''], ['Gao', 'Xiao-Shan', '']]","['Difference algebra', 'binomial difference ideal', 'Gröbner basis', 'difference Gröbner basis']"
15375,1306.1356,Maryia Kabanava,"Holger Rauhut, Maryia Kabanava",Analysis $\ell_1$-recovery with frames and Gaussian measurements,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper provides novel results for the recovery of signals from
undersampled measurements based on analysis $\ell_1$-minimization, when the
analysis operator is given by a frame. We both provide so-called uniform and
nonuniform recovery guarantees for cosparse (analysis-sparse) signals using
Gaussian random measurement matrices. The nonuniform result relies on a
recovery condition via tangent cones and the uniform recovery guarantee is
based on an analysis version of the null space property. Examining these
conditions for Gaussian random matrices leads to precise bounds on the number
of measurements required for successful recovery. In the special case of
standard sparsity, our result improves a bound due to Rudelson and Vershynin
concerning the exact reconstruction of sparse signals from Gaussian
measurements with respect to the constant and extends it to stability under
passing to approximately sparse signals and to robustness under noise on the
measurements.
","[{'version': 'v1', 'created': 'Thu, 6 Jun 2013 09:43:55 GMT'}, {'version': 'v2', 'created': 'Thu, 22 May 2014 10:15:53 GMT'}, {'version': 'v3', 'created': 'Mon, 3 Nov 2014 11:09:58 GMT'}]",2014-11-04,"[['Rauhut', 'Holger', ''], ['Kabanava', 'Maryia', '']]","['compressive sensing', 'ℓ1-minimization', 'analysis regularization', 'frames', 'Gaussianrandom matrices']"
15376,1610.04602,Andrew Adamatzky,"Andrew Adamatzky, Georgios Sirakoulis, Genaro J. Martinez, Frantisek
  Baluska, Stefano Mancuso",On plant roots logical gates,,,,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Theoretical constructs of logical gates implemented with plant roots are
morphological computing asynchronous devices. Values of Boolean variables are
represented by plant roots. A presence of a plant root at a given site
symbolises the logical {\sc True}, an absence the logical {\sc False}. Logical
functions are calculated via interaction between roots. Two types of
two-inputs-two-outputs gates are proposed: a gate $\langle x, y \rangle
\rightarrow \langle xy, x+y \rangle$ where root apexes are guided by gravity
and a gate $\langle x, y \rangle \rightarrow \langle \overline{x}y, x \rangle$
where root apexes are guided by humidity. We propose a design of binary
half-adder based on the gates.
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2016 19:49:52 GMT'}]",2016-10-17,"[['Adamatzky', 'Andrew', ''], ['Sirakoulis', 'Georgios', ''], ['Martinez', 'Genaro J.', ''], ['Baluska', 'Frantisek', ''], ['Mancuso', 'Stefano', '']]","['plant roots', 'logical gates', 'unconventional computing']"
15377,1301.3258,Omar Khadir,Omar Khadir,New variant of ElGamal signature scheme,,"Int. Contemp. Math. Sciences, Vol. 5, 2010, no 34, pp.1653-1662",,,cs.CR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a new variant of ElGamal signature scheme is presented and its
security analyzed. We also give, for its theoretical interest, a general form
of the signature equation.
","[{'version': 'v1', 'created': 'Tue, 15 Jan 2013 08:32:55 GMT'}]",2013-01-16,"[['Khadir', 'Omar', '']]","['Public key cryptography', 'ElGamal signature scheme', 'discretelogarithm problem']"
15378,1504.04031,Minyar Sassi,Olfa Arfaoui and Minyar Sassi Hidri,Mining Semi-structured Data,,"The 5th International Conference on Web and Information
  Technologies (ICWIT), pp. 51-60, 2013",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The need for discovering knowledge from XML documents according to both
structure and content features has become challenging, due to the increase in
application contexts for which handling both structure and content information
in XML data is essential. So, the challenge is to find an hierarchical
structure which ensure a combination of data levels and their representative
structures. In this work, we will be based on the Formal Concept Analysis-based
views to index and query both content and structure. We evaluate given
structure in a querying process which allows the searching of user query
answers.
","[{'version': 'v1', 'created': 'Wed, 15 Apr 2015 20:06:33 GMT'}]",2015-04-17,"[['Arfaoui', 'Olfa', ''], ['Hidri', 'Minyar Sassi', '']]","['XML Mining', 'Formal Concept Analysis', 'Conceptual Scaling', 'XQuery', 'eXist']"
15379,1511.05252,Igor Pontes Duff Pereira,Igor Pontes Duff and Charles Poussot-Vassal and C\'edric Seren,"Optimal $\mathcal{H}_{2}$ model approximation based on multiple
  input/output delays systems","14 pages, 3 figures, submitted to Automatica Journal",,,,cs.SY math.DS math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the $\mathcal{H}_{2}$ optimal approximation of a
$n_{y}\times{n_{u}}$ transfer function $\mathbf{G}(s)$ by a finite dimensional
system $\hat{\mathbf{H}}_{d}(s)$ including input/output delays, is addressed.
The underlying $\mathcal{H}_{2}$ optimality conditions of the approximation
problem are firstly derived and established in the case of a poles/residues
decomposition. These latter form an extension of the tangential interpolatory
conditions, presented in~\cite{gugercin2008h_2,dooren2007} for the delay-free
case, which is the main contribution of this paper. Secondly, a two stage
algorithm is proposed in order to practically obtain such an approximation.
","[{'version': 'v1', 'created': 'Tue, 17 Nov 2015 02:24:53 GMT'}]",2015-11-18,"[['Duff', 'Igor Pontes', ''], ['Poussot-Vassal', 'Charles', ''], ['Seren', 'Cédric', '']]","['Model reduction', 'time-delay systems', 'large-scale systems', 'linear systems']"
15380,1409.8486,Mark Scanlon,Mark Scanlon and Jason Farina and Nhien An Le Khac and Tahar Kechadi,"Leveraging Decentralization to Extend the Digital Evidence Acquisition
  Window: Case Study on BitTorrent Sync","Special Issue on Proc. of Sixth International Conference on Digital
  Forensics & Cyber Crime, ICDF2C'14, Journal of Digital Forensics, Security
  and Law, Vol 9, No 2, September 2014",,,,cs.CR cs.CY,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  File synchronization services such as Dropbox, Google Drive, Microsoft
OneDrive, Apple iCloud, etc., are becoming increasingly popular in today's
always-connected world. A popular alternative to the aforementioned services is
BitTorrent Sync. This is a decentralized/cloudless file synchronization service
and is gaining significant popularity among Internet users with privacy
concerns over where their data is stored and who has the ability to access it.
The focus of this paper is the remote recovery of digital evidence pertaining
to files identified as being accessed or stored on a suspect's computer or
mobile device. A methodology for the identification, investigation, recovery
and verification of such remote digital evidence is outlined. Finally, a
proof-of-concept remote evidence recovery from BitTorrent Sync shared folder
highlighting a number of potential scenarios for the recovery and verification
of such evidence.
","[{'version': 'v1', 'created': 'Tue, 30 Sep 2014 11:15:52 GMT'}]",2014-10-01,"[['Scanlon', 'Mark', ''], ['Farina', 'Jason', ''], ['Khac', 'Nhien An Le', ''], ['Kechadi', 'Tahar', '']]","['Digital Evidence', 'Remote Evidence Recovery', 'BitTorrent Sync', 'Mobile Device Forensics']"
15381,1110.0214,Ridwan Al Iqbal,Ridwan Al Iqbal,Eclectic Extraction of Propositional Rules from Neural Networks,"ICCIT 2011, Dhaka, Bangladesh",,,,cs.LG cs.AI cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Artificial Neural Network is among the most popular algorithm for supervised
learning. However, Neural Networks have a well-known drawback of being a ""Black
Box"" learner that is not comprehensible to the Users. This lack of transparency
makes it unsuitable for many high risk tasks such as medical diagnosis that
requires a rational justification for making a decision. Rule Extraction
methods attempt to curb this limitation by extracting comprehensible rules from
a trained Network. Many such extraction algorithms have been developed over the
years with their respective strengths and weaknesses. They have been broadly
categorized into three types based on their approach to use internal model of
the Network. Eclectic Methods are hybrid algorithms that combine the other
approaches to attain more performance. In this paper, we present an Eclectic
method called HERETIC. Our algorithm uses Inductive Decision Tree learning
combined with information of the neural network structure for extracting
logical rules. Experiments and theoretical analysis show HERETIC to be better
in terms of speed and performance.
","[{'version': 'v1', 'created': 'Sun, 2 Oct 2011 18:59:42 GMT'}]",2011-10-04,"[['Iqbal', 'Ridwan Al', '']]","['Neural Networks', 'Rule Extraction', 'Decision Trees', 'Eclectic Method', 'Machine Learning', 'Data Mining']"
15382,1505.03898,Ming Yan,Xiaolin Huang and Lei Shi and Ming Yan and Johan A.K. Suykens,"Pinball Loss Minimization for One-bit Compressive Sensing: Convex Models
  and Algorithms",11 pages,,,,cs.IT math.IT math.NA math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The one-bit quantization is implemented by one single comparator that
operates at low power and a high rate. Hence one-bit compressive sensing
(1bit-CS) becomes attractive in signal processing. When measurements are
corrupted by noise during signal acquisition and transmission, 1bit-CS is
usually modeled as minimizing a loss function with a sparsity constraint. The
one-sided $\ell_1$ loss and the linear loss are two popular loss functions for
1bit-CS. To improve the decoding performance on noisy data, we consider the
pinball loss, which provides a bridge between the one-sided $\ell_1$ loss and
the linear loss. Using the pinball loss, two convex models, an elastic-net
pinball model and its modification with the $\ell_1$-norm constraint, are
proposed. To efficiently solve them, the corresponding dual coordinate ascent
algorithms are designed and their convergence is proved. The numerical
experiments confirm the effectiveness of the proposed algorithms and the
performance of the pinball loss minimization for 1bit-CS.
","[{'version': 'v1', 'created': 'Thu, 14 May 2015 21:51:40 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Mar 2018 15:10:14 GMT'}]",2018-03-20,"[['Huang', 'Xiaolin', ''], ['Shi', 'Lei', ''], ['Yan', 'Ming', ''], ['Suykens', 'Johan A. K.', '']]","['compressive sensing', 'one-bit', 'pinball loss', 'dual coordinate ascent']"
15383,1304.3265,Maher Jebali,"Maher Jebali, Patrice Dalle, Mohamed Jemni","Extension of hidden markov model for recognizing large vocabulary of
  sign language",,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computers still have a long way to go before they can interact with users in
a truly natural fashion. From a users perspective, the most natural way to
interact with a computer would be through a speech and gesture interface.
Although speech recognition has made significant advances in the past ten
years, gesture recognition has been lagging behind. Sign Languages (SL) are the
most accomplished forms of gestural communication. Therefore, their automatic
analysis is a real challenge, which is interestingly implied to their lexical
and syntactic organization levels. Statements dealing with sign language occupy
a significant interest in the Automatic Natural Language Processing (ANLP)
domain. In this work, we are dealing with sign language recognition, in
particular of French Sign Language (FSL). FSL has its own specificities, such
as the simultaneity of several parameters, the important role of the facial
expression or movement and the use of space for the proper utterance
organization. Unlike speech recognition, Frensh sign language (FSL) events
occur both sequentially and simultaneously. Thus, the computational processing
of FSL is too complex than the spoken languages. We present a novel approach
based on HMM to reduce the recognition complexity.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2013 11:56:39 GMT'}]",2013-04-12,"[['Jebali', 'Maher', ''], ['Dalle', 'Patrice', ''], ['Jemni', 'Mohamed', '']]","['Sign language recognition', 'Frensh sign language', 'Pattern recognition', 'HMM']"
15384,1602.08388,Viktoras Veitas Mr.,Viktoras Veitas and David Weinbaum (Weaver),Living Cognitive Society: a `digital' World of Views,"Preprint: 29 pages, 5 figures",,,,cs.CY nlin.AO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The current social reality is characterized by all-encompassing change, which
disrupts existing social structures at all levels. Yet the prevailing view of
society is based on the ontological primacy of stable hierarchical structures,
which is no longer adequate.
  We propose a conceptual framework for thinking about a dynamically changing
social system: the Living Cognitive Society. Importantly, we show how it
follows from a much broader philosophical framework, guided by the theory of
individuation, which emphasizes the importance of relationships and interactive
processes in the evolution of a system.
  The framework addresses society as a living cognitive system -- an ecology of
interacting social subsystems -- each of which is also a living cognitive
system. We argue that this approach can help us to conceive sustainable social
systems that will thrive in the circumstances of accelerating change. The
Living Cognitive Society is explained in terms of its fluid structure, dynamics
and the mechanisms at work. We then discuss the disruptive effects of
Information and Communication Technologies on the mechanisms at work.
  We conclude by delineating a major topic for future research -- distributed
social governance -- which focuses on processes of coordination rather than on
stable structures within global society.
","[{'version': 'v1', 'created': 'Mon, 26 Oct 2015 23:47:12 GMT'}]",2016-02-29,"[['Veitas', 'Viktoras', '', 'Weaver'], ['Weinbaum', 'David', '', 'Weaver']]","['cognitive system', 'living society', 'information and communication technologies', 'future social governance', 'individuation', 'cognitive development']"
15385,1702.01877,Guohui Lin,"Yao Xu, Yong Chen, Taibo Luo and Guohui Lin","A local search 2.917-approximation algorithm for duo-preservation string
  mapping","37 pages, 33 figures",,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the {\em maximum duo-preservation string mapping} ({\sc Max-Duo})
problem, which is the complement of the well studied {\em minimum common string
partition} ({\sc MCSP}) problem. Both problems have applications in many fields
including text compression and bioinformatics. Motivated by an earlier local
search algorithm, we present an improved approximation and show that its
performance ratio is no greater than ${35}/{12} < 2.917$. This beats the
current best $3.25$-approximation for {\sc Max-Duo}. The performance analysis
of our algorithm is done through a complex yet interesting amortization. Two
lower bounds on the locality gap of our algorithm are also provided.
","[{'version': 'v1', 'created': 'Tue, 7 Feb 2017 04:40:50 GMT'}]",2017-02-08,"[['Xu', 'Yao', ''], ['Chen', 'Yong', ''], ['Luo', 'Taibo', ''], ['Lin', 'Guohui', '']]","['Approximation algorithm', 'duo-preservation string mapping', 'string partition', 'local search', 'amortized analysis']"
15386,1004.0798,Somayeh Salimi,"Somayeh Salimi, Mahmoud Salmasizadeh, Mohammad Reza Aref",Generalized Secure Distributed Source Coding with Side Information,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, new inner and outer bounds on the achievable
compression-equivocation rate region for generalized secure data compression
with side information are given that do not match in general. In this setup,
two senders, Alice and Charlie intend to transmit information to Bob via
channels with limited capacity so that he can reliably reconstruct their
observations. The eavesdropper, Eve, has access to one of the channels at each
instant and is interested in the source of the same channel at the time. Bob
and Eve also have their own observations which are correlated with Alice's and
Charlie's observations. In this model, two equivocation and compression rates
are defined with respect to the sources of Alice and Charlie. Furthermore,
different special cases are discussed where the inner and outer bounds match.
Our model covers the previously obtained results as well.
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2010 08:39:11 GMT'}]",2010-04-07,"[['Salimi', 'Somayeh', ''], ['Salmasizadeh', 'Mahmoud', ''], ['Aref', 'Mohammad Reza', '']]","['Information Theoretic Security', 'Secure Data Compression', 'Compression']"
15387,1005.3367,Swan Dubois,"Swan Dubois (LIP6, INRIA Rocquencourt), Toshimitsu Masuzawa
  (Department of Information and Computer sciences Osaka University),
  S\'ebastien Tixeuil (LIP6)",Bounding the Impact of Unbounded Attacks in Stabilization,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-stabilization is a versatile approach to fault-tolerance since it
permits a distributed system to recover from any transient fault that
arbitrarily corrupts the contents of all memories in the system. Byzantine
tolerance is an attractive feature of distributed systems that permits to cope
with arbitrary malicious behaviors. Combining these two properties proved
difficult: it is impossible to contain the spatial impact of Byzantine nodes in
a self-stabilizing context for global tasks such as tree orientation and tree
construction. We present and illustrate a new concept of Byzantine containment
in stabilization. Our property, called Strong Stabilization enables to contain
the impact of Byzantine nodes if they actually perform too many Byzantine
actions. We derive impossibility results for strong stabilization and present
strongly stabilizing protocols for tree orientation and tree construction that
are optimal with respect to the number of Byzantine nodes that can be tolerated
in a self-stabilizing context.
","[{'version': 'v1', 'created': 'Wed, 19 May 2010 06:34:03 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Feb 2011 16:20:18 GMT'}]",2011-02-11,"[['Dubois', 'Swan', '', 'LIP6, INRIA Rocquencourt'], ['Masuzawa', 'Toshimitsu', '', 'Department of Information and Computer sciences Osaka University'], ['Tixeuil', 'Sébastien', '', 'LIP6']]","['Byzantine fault', 'Distributed algorithm', 'Fault tolerance', 'Stabilization', 'Spanning tree construction']"
15388,1307.2111,Uwe Aickelin,"Ian Dent, Tony Craig, Uwe Aickelin, Tom Rodden","Finding the creatures of habit; Clustering households based on their
  flexibility in using electricity","Digital Futures 2012, Aberdeen, UK, 2012",,,,cs.LG cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Changes in the UK electricity market, particularly with the roll out of smart
meters, will provide greatly increased opportunities for initiatives intended
to change households' electricity usage patterns for the benefit of the overall
system. Users show differences in their regular behaviours and clustering
households into similar groupings based on this variability provides for
efficient targeting of initiatives. Those people who are stuck into a regular
pattern of activity may be the least receptive to an initiative to change
behaviour. A sample of 180 households from the UK are clustered into four
groups as an initial test of the concept and useful, actionable groupings are
found.
","[{'version': 'v1', 'created': 'Mon, 8 Jul 2013 14:47:42 GMT'}]",2013-07-09,"[['Dent', 'Ian', ''], ['Craig', 'Tony', ''], ['Aickelin', 'Uwe', ''], ['Rodden', 'Tom', '']]","['Electricity load profiles', 'Clustering', 'Flexibility', 'Demand SideManagement']"
15389,1312.6635,Hamed Haddadi,"Shana Dacres, Hamed Haddadi, Matthew Purver","Topic and Sentiment Analysis on OSNs: a Case Study of Advertising
  Strategies on Twitter",,,,,cs.SI physics.soc-ph,http://creativecommons.org/licenses/by/3.0/,"  Social media have substantially altered the way brands and businesses
advertise: Online Social Networks provide brands with more versatile and
dynamic channels for advertisement than traditional media (e.g., TV and radio).
Levels of engagement in such media are usually measured in terms of content
adoption (e.g., likes and retweets) and sentiment, around a given topic.
However, sentiment analysis and topic identification are both non-trivial
tasks.
  In this paper, using data collected from Twitter as a case study, we analyze
how engagement and sentiment in promoted content spread over a 10-day period.
We find that promoted tweets lead to higher positive sentiment than promoted
trends; although promoted trends pay off in response volume. We observe that
levels of engagement for the brand and promoted content are highest on the
first day of the campaign, and fall considerably thereafter. However, we show
that these insights depend on the use of robust machine learning and natural
language processing techniques to gather focused, relevant datasets, and to
accurately gauge sentiment, rather than relying on the simple keyword- or
frequency-based metrics sometimes used in social media research.
","[{'version': 'v1', 'created': 'Mon, 23 Dec 2013 18:32:06 GMT'}]",2013-12-24,"[['Dacres', 'Shana', ''], ['Haddadi', 'Hamed', ''], ['Purver', 'Matthew', '']]","['Sentiment analysis', 'Topic analysis', 'Social Media', 'Online Advertising', 'User Engagement']"
15390,1603.05939,Elli Zavou,"Elli Zavou, Antonio Fern\'andez Anta",Online Distributed Scheduling on a Fault-prone Parallel System,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a parallel system of $m$ identical machines prone to
unpredictable crashes and restarts, trying to cope with the continuous arrival
of tasks to be executed. Tasks have different computational requirements (i.e.,
processing time or size). The flow of tasks, their size, and the crash and
restart of the machines are assumed to be controlled by an adversary. Then, we
focus on the study of online distributed algorithms for the efficient
scheduling of the tasks. We use competitive analysis, considering as efficiency
metric the completed-load, i.e., the aggregated size of the completed tasks. We
first present optimal completed-load competitiveness algorithms when the number
of different task sizes that can be injected by the adversary is bounded. (It
is known that, if it is not bounded, competitiveness is not achievable.) We
first consider only two different task sizes, and then proceed to $k$ different
ones, showing in both cases that the optimal completed-load competitiveness can
be achieved. Then, we consider the possibility of having some form of resource
augmentation, allowing the scheduling algorithm to run with a speedup $s \geq
1$. In this case, we show that the competitiveness of all work-conserving
scheduling algorithms can be increased by using a large enough speedup.
","[{'version': 'v1', 'created': 'Fri, 18 Mar 2016 17:51:53 GMT'}]",2016-03-21,"[['Zavou', 'Elli', ''], ['Anta', 'Antonio Fernández', '']]","['Scheduling', 'Parallel Computation', 'Non-uniform Tasks', 'Failures', 'Competitiveness', 'OnlineAlgorithms']"
15391,0709.0522,Florentin Smarandache,"Florentin Smarandache, Jean Dezert",Qualitative Belief Conditioning Rules (QBCR),"13 pages. Presented at Fusion 2007 International Conference, Quebec
  City, Canada, July 2007","Proceedings of Fusion 2007 International Conference, Quebec City,
  Canada, July 2007",,,cs.AI,,"  In this paper we extend the new family of (quantitative) Belief Conditioning
Rules (BCR) recently developed in the Dezert-Smarandache Theory (DSmT) to their
qualitative counterpart for belief revision. Since the revision of quantitative
as well as qualitative belief assignment given the occurrence of a new event
(the conditioning constraint) can be done in many possible ways, we present
here only what we consider as the most appealing Qualitative Belief
Conditioning Rules (QBCR) which allow to revise the belief directly with words
and linguistic labels and thus avoids the introduction of ad-hoc translations
of quantitative beliefs into quantitative ones for solving the problem.
","[{'version': 'v1', 'created': 'Tue, 4 Sep 2007 20:03:04 GMT'}]",2007-09-06,"[['Smarandache', 'Florentin', ''], ['Dezert', 'Jean', '']]","['qualitative belief', 'belief conditioning rules (BCRs)', 'computing with words', 'Dezert-SmarandacheTheory (DSmT)', 'reasoning under uncertainty']"
15392,1705.08929,Rui Policarpo Duarte,Rui Policarpo Duarte,"Transport Protocols for Large Bandwidth-Delay Product Networks - TCP
  Extensions and Alternative Transport Protocols","6 pages, 1 figure, 1 table, conference","JETC'08 IV Workshop on Electronics, Telecommunications and
  Computers Engineering; Lisbon, Portugal, 2008",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  TCP's poor performance is identified as the bottleneck of high-speed
networks. Extensions to TCP have been proposed and implemented. Some authors
abandon TCP at all and suggest new transport protocols to overcome TCP
limitations, at the expense of compatibility. This paper reports a research on
the most significant TCP extensions and transport alternatives, and comparison
between them. The majority of the solutions pointed out are difficult to
compare because they are tailored to specific configurations. Still there is no
specific criteria to evaluate performance metrics and comparison is done on the
most evident issues.
","[{'version': 'v1', 'created': 'Wed, 24 May 2017 18:59:55 GMT'}]",2017-05-26,"[['Duarte', 'Rui Policarpo', '']]","['TCP extensions', 'high bandwidth-delay product networks', 'alternative transport protocols']"
15393,1511.00849,Sebastian van de Hoef,"Sebastian van de Hoef, Karl H. Johansson, Dimos V. Dimarogonas","Computing Feasible Vehicle Platooning Opportunities for Transport
  Assignments","6 pages, 2 figures, to appear in CTS 2016, 14-th IFAC Symposium on
  Control in Transportation Systems",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vehicle platooning facilitates the partial automation of vehicles and can
significantly reduce fuel consumption. Mobile communication infrastructure
makes it possible to dynamically coordinate the formation of platoons en route.
We consider a centralized system that provides trucks with routes and speed
profiles allowing them to dynamically form platoons during their journeys. For
this to work, all possible pairs of vehicles that can platoon based on their
location, destination, and other constraints have to be identified. The
presented approach scales well to large vehicle fleets and realistic road
networks by extracting features from the transport assignments of the vehicles
and rules out a majority of possible pairs based on these features only. Merely
a small number of remaining pairs are considered in depth by a complete and
computationally expensive algorithm. This algorithm conclusively decides if
platooning is possible for a pair based on the complete data associated with
the two vehicles. We derive appropriate features for the problem and
demonstrate the effectiveness of the approach in a simulation example.
","[{'version': 'v1', 'created': 'Tue, 3 Nov 2015 10:37:49 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Feb 2016 09:13:32 GMT'}]",2016-02-25,"[['van de Hoef', 'Sebastian', ''], ['Johansson', 'Karl H.', ''], ['Dimarogonas', 'Dimos V.', '']]","['Transportation', 'Agents', 'Platooning', 'Spatial Networks']"
15394,1409.4354,Meenakshi Lakshmanan,"S. V. Kasmir Raja, V. Rajitha, Meenakshi Lakshmanan","A Binary Schema and Computational Algorithms to Process Vowel-based
  Euphonic Conjunctions for Word Searches",,"International Journal of Applied Engineering Research, ISSN
  0973-4562, Vol. 9, No. 20, 2014, pp 7127-7142",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Comprehensively searching for words in Sanskrit E-text is a non-trivial
problem because words could change their forms in different contexts. One such
context is sandhi or euphonic conjunctions, which cause a word to change owing
to the presence of adjacent letters or words. The change wrought by these
possible conjunctions can be so significant in Sanskrit that a simple search
for the word in its given form alone can significantly reduce the success level
of the search. This work presents a representational schema that represents
letters in a binary format and reduces Paninian rules of euphonic conjunctions
to simple bit set-unset operations. The work presents an efficient algorithm to
process vowel-based sandhis using this schema. It further presents another
algorithm that uses the sandhi processor to generate the possible transformed
word forms of a given word to use in a comprehensive word search.
","[{'version': 'v1', 'created': 'Mon, 15 Sep 2014 18:08:33 GMT'}]",2019-08-17,"[['Raja', 'S. V. Kasmir', ''], ['Rajitha', 'V.', ''], ['Lakshmanan', 'Meenakshi', '']]","['Sanskrit', 'euphonic conjunction', 'sandhi', 'linguistics', 'Panini', 'Sanskrit word search', 'e-text search']"
15395,1510.09021,Tehuan Chen,Tehuan Chen and Chao Xu,"Computational Optimal Control of the Saint-Venant PDE Model Using the
  Time-scaling Technique",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a new time-scaling approach for computational optimal
control of a distributed parameter system governed by the Saint-Venant PDEs. We
propose the time-scaling approach, which can change a uniform time partition to
a nonuniform one. We also derive the gradient formulas by using the variational
method. Then the method of lines (MOL) is applied to compute the Saint-Venant
PDEs after implementing the time-scaling transformation and the associate
costate PDEs. Finally, we compare the optimization results using the proposed
time-scaling approach with the one not using it. The simulation result
demonstrates the effectiveness of the proposed time-scaling method.
","[{'version': 'v1', 'created': 'Fri, 30 Oct 2015 09:27:49 GMT'}]",2015-11-02,"[['Chen', 'Tehuan', ''], ['Xu', 'Chao', '']]","['Time-scaling approach', 'Optimal boundary control', 'Method of lines']"
15396,1609.05058,Jan Leike,"Jan Leike, Jessica Taylor, Benya Fallenstein",A Formal Solution to the Grain of Truth Problem,UAI 2016,,,,cs.AI cs.GT cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Bayesian agent acting in a multi-agent environment learns to predict the
other agents' policies if its prior assigns positive probability to them (in
other words, its prior contains a \emph{grain of truth}). Finding a reasonably
large class of policies that contains the Bayes-optimal policies with respect
to this class is known as the \emph{grain of truth problem}. Only small classes
are known to have a grain of truth and the literature contains several related
impossibility results. In this paper we present a formal and general solution
to the full grain of truth problem: we construct a class of policies that
contains all computable policies as well as Bayes-optimal policies for every
lower semicomputable prior over the class. When the environment is unknown,
Bayes-optimal agents may fail to act optimally even asymptotically. However,
agents based on Thompson sampling converge to play {\epsilon}-Nash equilibria
in arbitrary unknown computable multi-agent environments. While these results
are purely theoretical, we show that they can be computationally approximated
arbitrarily closely.
","[{'version': 'v1', 'created': 'Fri, 16 Sep 2016 14:00:51 GMT'}]",2016-09-21,"[['Leike', 'Jan', ''], ['Taylor', 'Jessica', ''], ['Fallenstein', 'Benya', '']]","['General reinforcement learning', 'multi-agentsystems', 'game theory', 'self-reflection', 'asymptotic optimality', 'Nash equilibrium', 'Thompson sampling', 'AIXI']"
15397,1412.5344,Meena V,"V. Meena, G. Abhilash",Noise Resilient Recovery Algorithm for Compressed Sensing,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, we discuss a novel greedy algorithm for the recovery of
compressive sampled signals under noisy conditions. Most of the greedy recovery
algorithms proposed in the literature require sparsity of the signal to be
known or they estimate sparsity, for a known representation basis, from the
number of measurements. These algorithms recover signals when noise level is
significantly low. We propose Entropy minimization based Matching Pursuit (EMP)
which has the capability to reject noise even when noise level is comparable to
that of signal level. The proposed algorithm can cater to compressible signals
and signals for which sparsity is not known in advance. Simulation study of the
proposed scheme shows improved robustness to white Gaussian noise in comparison
with the conventional greedy recovery algorithms.
","[{'version': 'v1', 'created': 'Wed, 17 Dec 2014 11:25:28 GMT'}]",2014-12-18,"[['Meena', 'V.', ''], ['Abhilash', 'G.', '']]","['Sparse representation', 'measurement matrix', 'entropy based']"
15398,1506.01330,Xiaojun Chang,"Sen Wang, Feiping Nie, Xiaojun Chang, Lina Yao, Xue Li, Quan Z. Sheng",Unsupervised Feature Analysis with Class Margin Optimization,"Accepted by European Conference on Machine Learning and Principles
  and Practice of Knowledge Discovery in Databases, ECML/PKDD 2015",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Unsupervised feature selection has been always attracting research attention
in the communities of machine learning and data mining for decades. In this
paper, we propose an unsupervised feature selection method seeking a feature
coefficient matrix to select the most distinctive features. Specifically, our
proposed algorithm integrates the Maximum Margin Criterion with a
sparsity-based model into a joint framework, where the class margin and feature
correlation are taken into account at the same time. To maximize the total data
separability while preserving minimized within-class scatter simultaneously, we
propose to embed Kmeans into the framework generating pseudo class label
information in a scenario of unsupervised feature selection. Meanwhile, a
sparsity-based model, ` 2 ,p-norm, is imposed to the regularization term to
effectively discover the sparse structures of the feature coefficient matrix.
In this way, noisy and irrelevant features are removed by ruling out those
features whose corresponding coefficients are zeros. To alleviate the local
optimum problem that is caused by random initializations of K-means, a
convergence guaranteed algorithm with an updating strategy for the clustering
indicator matrix, is proposed to iteractively chase the optimal solution.
Performance evaluation is extensively conducted over six benchmark data sets.
From plenty of experimental results, it is demonstrated that our method has
superior performance against all other compared approaches.
","[{'version': 'v1', 'created': 'Wed, 3 Jun 2015 17:49:52 GMT'}]",2015-06-04,"[['Wang', 'Sen', ''], ['Nie', 'Feiping', ''], ['Chang', 'Xiaojun', ''], ['Yao', 'Lina', ''], ['Li', 'Xue', ''], ['Sheng', 'Quan Z.', '']]","['unsupervised feature selection', 'maximum margin criterion', 'sparse structure learning', 'embedded K-means clustering']"
15399,1307.7122,George Saad,"Dieter Mitsche, George Saad and Jared Saia",The Power of Mediation in an Extended El Farol Game,"24 pages, 7 figures. Accepted in SAGT'13
  (http://algo.rwth-aachen.de/sagt2013/accepted.php)",,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A mediator implements a correlated equilibrium when it proposes a strategy to
each player confidentially such that the mediator's proposal is the best
interest for every player to follow. In this paper, we present a mediator that
implements the best correlated equilibrium for an extended El Farol game with
symmetric players. The extended El Farol game we consider incorporates both
negative and positive network effects.
  We study the degree to which this type of mediator can decrease the overall
social cost. In particular, we give an exact characterization of Mediation
Value (MV) and Enforcement Value (EV) for this game. MV is the ratio of the
minimum social cost over all Nash equilibria to the minimum social cost over
all mediators, and EV is the ratio of the minimum social cost over all
mediators to the optimal social cost. This sort of exact characterization is
uncommon for games with both kinds of network effects. An interesting outcome
of our results is that both the MV and EV values can be unbounded for our game.
","[{'version': 'v1', 'created': 'Fri, 26 Jul 2013 18:40:47 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Aug 2013 15:50:02 GMT'}]",2013-08-13,"[['Mitsche', 'Dieter', ''], ['Saad', 'George', ''], ['Saia', 'Jared', '']]","['Nash Equilibria', 'Correlated Equilibria', 'Mediators and Network Effects']"
15400,1009.1604,JeongGil Ko,"JeongGil Ko, Amitabh Mishra","DynaChanAl: Dynamic Channel Allocation with Minimal End-to-end Delay for
  Wireless Sensor Networks",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With recent advances in wireless communication, networking, and low power
sensor technology, wireless sensor network (WSN) systems have begun to take
significant roles in various applications ranging from environmental sensing to
mobile healthcare sensing. While some WSN applications only require a lim- ited
amount of bandwidth, new emerging applications operate with a notice- ably
large amount of data transfers. One way to deal with such applications is to
maximize the available capacity by utilizing the use of multiple wireless
channels. This work proposes DynaChannAl, a distributed dynamic wireless
channel algorithm with the goal of effectively distributing nodes on multiple
wireless channels in WSN systems. Specifically, DynaChannAl targets applica-
tions where mobile nodes connect to a pre-existing wireless backbone and takes
the expected end-to-end queuing delay as its core metric. We use the link qual-
ity indicator (LQI) values provided by IEEE 802.15.4 radios white-list
potential links with good link quality and evaluate such links with the
aggregated packet transmission latency at each hop. Our approach is useful for
applications that require minimal end-to-end delay (i.e., healthcare
applications). DynaChannAl is a light weight and highly adoptable scheme that
can be easily incorporated with various pre-developed components and
pre-deployed applications. We eval- uate DynaChannAl in on a 45 node WSN
testbed. As the first study to consider end-to-end latency as the core metric
for channel allocation in WSN systems, the experimental results indicate that
DynaChannAl successfully distributes multi- ple (mobile) source nodes on
different wireless channels and enables the nodes to select wireless channel
and links that can minimize the end-to-end latency.
","[{'version': 'v1', 'created': 'Wed, 8 Sep 2010 18:15:07 GMT'}]",2010-09-09,"[['Ko', 'JeongGil', ''], ['Mishra', 'Amitabh', '']]","['Wireless Sensor Networks', 'Dynamic Channel Allocation', 'LatencyAware Protocols']"
15401,1504.04421,Nikhil Padhye,Nikhil Padhye and Pulkit Mittal and Kalyanmoy Deb,"Feasibility Preserving Constraint-Handling Strategies for Real Parameter
  Evolutionary Optimization",,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evolutionary Algorithms (EAs) are being routinely applied for a variety of
optimization tasks, and real-parameter optimization in the presence of
constraints is one such important area. During constrained optimization EAs
often create solutions that fall outside the feasible region; hence a viable
constraint- handling strategy is needed. This paper focuses on the class of
constraint-handling strategies that repair infeasible solutions by bringing
them back into the search space and explicitly preserve feasibility of the
solutions. Several existing constraint-handling strategies are studied, and two
new single parameter constraint-handling methodologies based on parent-centric
and inverse parabolic probability (IP) distribution are proposed. The existing
and newly proposed constraint-handling methods are first studied with PSO, DE,
GAs, and simulation results on four scalable test-problems under different
location settings of the optimum are presented. The newly proposed
constraint-handling methods exhibit robustness in terms of performance and also
succeed on search spaces comprising up-to 500 variables while locating the
optimum within an error of 10$^{-10}$. The working principle of the IP based
methods is also demonstrated on (i) some generic constrained optimization
problems, and (ii) a classic `Weld' problem from structural design and
mechanics. The successful performance of the proposed methods clearly exhibits
their efficacy as a generic constrained-handling strategy for a wide range of
applications.
","[{'version': 'v1', 'created': 'Fri, 17 Apr 2015 01:55:23 GMT'}]",2015-04-20,"[['Padhye', 'Nikhil', ''], ['Mittal', 'Pulkit', ''], ['Deb', 'Kalyanmoy', '']]","['constraint-handling', 'nonlinear and constrained optimization', 'particle swarm optimization', 'real-parameter genetic algorithms', 'differential evolution']"
15402,1209.5041,Jaswinder  Dilawari Singh,"Jaswinder Singh Dilawari, Ravinder Khanna","An Implementation of Computer Graphics as Prepress Image Enhancement
  Process","4 Pages,8 Figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The production of a printed product involves three stages: prepress, the
printing process (press) itself, and finishing (post press). There are various
types of equipments (printers, scanners) and various qualities image are
present in the market. These give different color rendering each time during
reproduction. So, a color key tool has been developed keeping Color Management
Scheme (CMS) in mind so that during reproduction no color rendering takes place
irrespective of use of any device and resolution level has also been improved.
","[{'version': 'v1', 'created': 'Sun, 23 Sep 2012 09:15:20 GMT'}]",2015-03-13,"[['Dilawari', 'Jaswinder Singh', ''], ['Khanna', 'Ravinder', '']]","['Color management', 'Printing standards', 'ICC']"
15403,1309.7140,Mauro Femminella,"Luca Felicetti, Mauro Femminella, Gianluca Reali",Establishing digital molecular communications in blood vessels,"First International Black Sea Conference on Communications and
  Networking (BlackSeaCom 2013), Batumi, Georgia, July 3-5, 2013",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a solution for transmitting digital information
within the cardiocirculatory system. In particular, we make use of a channel
delivering burst of molecules, emitted by mobile transmitters, which diffuse in
the blood towards fixed receivers, that are attached to the vessel walls. This
communication scheme has been inspired by the real signaling between platelets
and endothelial cells, the behavior of which has been investigated
experimentally. We thus believe that our proposal can be successfully deployed
in living bodies. On the basis of the results achieved through simulations on
the communication system capabilities, we propose a simple but effective
receiver scheme, and we outline the future research directions.
","[{'version': 'v1', 'created': 'Fri, 27 Sep 2013 08:14:08 GMT'}]",2013-09-30,"[['Felicetti', 'Luca', ''], ['Femminella', 'Mauro', ''], ['Reali', 'Gianluca', '']]","['molecular communications', 'blood vessels', 'biocompatible signal', 'channel model']"
15404,1412.4192,Ahmadreza Baghaie,"Ahmadreza Baghaie, Hamid Abrishami Moghaddam","Finite Element Method Based Modeling of Cardiac Deformation Estimation
  under Abnormal Ventricular Muscle Conditions",Some grammatical errors are corrected in the text,,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deformation modeling of cardiac muscle is an important issue in the field of
cardiac analysis. Many approaches have been developed to better estimate the
cardiac muscle deformation, and to obtain a practical model to be used in
diagnostic procedures. But there are some conditions, like in case of
myocardial infarction, in which the regular modeling approaches are not useful.
In this article, using a point-wise approach, we try to estimate the
deformation under some abnormal conditions of cardiac muscle. First, the
endocardial and epicardial contour points are ordered with respect to the
center of gravity of the endocardial contour and displacement vectors of
boundary points are extracted. Then to solve the governing equations of the
deformation, which is an elliptic equation, we apply boundary conditions in
accordance with the computed displacement vectors and then the Finite Element
method (FEM) will be used to solve the governing equations. Using the obtained
displacement field of the cardiac muscle, strain map is extracted to show the
mechanical behavior of the cardiac muscle. Several tests are conducted using
phantom and real cardiac data in order to show the validity of the proposed
method.
","[{'version': 'v1', 'created': 'Sat, 13 Dec 2014 04:49:31 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Jul 2015 22:24:30 GMT'}, {'version': 'v3', 'created': 'Mon, 30 Nov 2015 04:29:03 GMT'}]",2015-12-01,"[['Baghaie', 'Ahmadreza', ''], ['Moghaddam', 'Hamid Abrishami', '']]","['Cardiac Modeling', 'Myocardial Infarction', 'Finite Element Method (FEM)']"
15405,1510.05833,QingChun ShenTu,"QingChun ShenTu, JianPing Yu","A Blind-Mixing Scheme for Bitcoin based on an Elliptic Curve
  Cryptography Blind Digital Signature Algorithm","17 pages, 6 figures, 1 table",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To strengthen the anonymity of Bitcoin, several centralized coin-mixing
providers (mixers) such as BitcoinFog.com, BitLaundry.com, and Blockchain.info
assist users to mix Bitcoins through CoinJoin transactions with multiple inputs
and multiple outputs to uncover the relationship between them. However, these
mixers know the output address of each user, such that they cannot provide true
anonymity. This paper proposes a centralized coin-mixing algorithm based on an
elliptic curve blind signature scheme (denoted as Blind-Mixing) that obstructs
mixers from linking an input address with an output address. Comparisons among
three blind signature based algorithms, Blind-Mixing, BlindCoin, and RSA
Coin-Mixing, are conducted. It is determined that BlindCoin may be deanonymized
because of its use of a public log. In RSA Coin-Mixing, a user's Bitcoins may
be falsely claimed by another. In addition, the blind signature scheme of
Blind-Mixing executes 10.5 times faster than that of RSA Coin-Mixing.
","[{'version': 'v1', 'created': 'Tue, 20 Oct 2015 11:02:21 GMT'}]",2015-10-21,"[['ShenTu', 'QingChun', ''], ['Yu', 'JianPing', '']]","['Bitcoin', 'anonymity', 'Blind Signature', 'Coin-Mixing', 'Blind-Mixing']"
15406,1505.04134,Georgios Rokos,Georgios Rokos and Gerard J. Gorman and Paul H. J. Kelly,An Interrupt-Driven Work-Sharing For-Loop Scheduler,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a parallel for-loop scheduler which is based on
work-stealing principles but runs under a completely cooperative scheme. POSIX
signals are used by idle threads to interrupt left-behind workers, which in
turn decide what portion of their workload can be given to the requester. We
call this scheme Interrupt-Driven Work-Sharing (IDWS). This article describes
how IDWS works, how it can be integrated into any POSIX-compliant OpenMP
implementation and how a user can manually replace OpenMP parallel for-loops
with IDWS in existing POSIX-compliant C++ applications. Additionally, we
measure its performance using both a synthetic benchmark with varying
distributions of workload across the iteration space and a real-life
application on Sandy Bridge and Xeon Phi systems. Regardless the workload
distribution and the underlying hardware, IDWS is always the best or among the
best-performing strategies, providing a good all-around solution to the
scheduling-choice dilemma.
","[{'version': 'v1', 'created': 'Fri, 15 May 2015 17:30:17 GMT'}, {'version': 'v2', 'created': 'Mon, 18 May 2015 16:04:00 GMT'}]",2015-05-19,"[['Rokos', 'Georgios', ''], ['Gorman', 'Gerard J.', ''], ['Kelly', 'Paul H. J.', '']]","['Parallel For-Loop', 'OpenMP Guided Scheduling', 'Intel CilkPlus', 'POSIX Threads', 'POSIX Signals', 'Work Stealing', 'WorkSharing', 'Scheduling Strategy']"
15407,1207.6832,Nader Ale Ebrahim,"Nader Ale Ebrahim, Salwa Hanim Abdul Rashid, Shamsuddin Ahmed, Zahari
  Taha","The Effectiveness of Virtual R&D Teams in SMEs: Experiences of Malaysian
  SMEs",,"Industrial Engineering and Management Systems, 2011, 10(2), Pages
  109-114",,,cs.OH,http://creativecommons.org/licenses/by/3.0/,"  The number of small and medium enterprises (SMEs), especially those involved
with research and development (R&D) programs and employed virtual teams to
create the greatest competitive advantage from limited labor are increasing.
Global and localized virtual R&D teams are believed to have high potential for
the growth of SMEs. Due to the fast-growing complexity of new products coupled
with new emerging opportunities of virtual teams, a collaborative approach is
believed to be the future trend. This research explores the effectiveness of
virtuality in SMEs' virtual R&D teams. Online questionnaires were emailed to
Malaysian manufacturing SMEs and 74 usable questionnaires were received,
representing a 20.8 percent return rate. In order to avoid biases which may
result from pre-suggested answers, a series of open-ended questions were
retrieved from the experts. This study was focused on analyzing an open-ended
question, whereby four main themes were extracted from the experts'
recommendations regarding the effectiveness of virtual teams for the growth and
performance of SMEs. The findings of this study would be useful to product
design managers of SMEs in order to realize the key advantages and significance
of virtual R&D teams during the new product development (NPD) process. This in
turn, leads to increased effectiveness in new product development's procedure.
","[{'version': 'v1', 'created': 'Mon, 30 Jul 2012 03:52:01 GMT'}]",2012-07-31,"[['Ebrahim', 'Nader Ale', ''], ['Rashid', 'Salwa Hanim Abdul', ''], ['Ahmed', 'Shamsuddin', ''], ['Taha', 'Zahari', '']]","['Virtual Teams', 'New Product Development', 'Survey Finding', 'Small', 'Medium Enterprises.   1']"
15408,1108.0747,Munaga HM Krishna Prasad Dr,"Hazarath Munaga (Dr MHM Krishna Prasad), J. V. R. Murthy and N. B.
  Venkateswarlu","A Fault Tolerant Trajectory Clustering (FTTC) for selecting cluster
  heads inWireless Sensor Networks",arXiv admin note: substantial text overlap with arXiv:1108.0740,"International Journal of Computational Intelligence Research
  (IJCIR) Volume 6, Number 3 (2010)",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless sensor networks (WSNs) suffers from the hot spot problem where the
sensor nodes closest to the base station are need to relay more packet than the
nodes farther away from the base station. Thus, lifetime of sensory network
depends on these closest nodes. Clustering methods are used to extend the
lifetime of a wireless sensor network. However, current clustering algorithms
usually utilize two techniques; selecting cluster heads with more residual
energy, and rotating cluster heads periodically to distribute the energy
consumption among nodes in each cluster and lengthen the network lifetime. Most
of the algorithms use random selection for selecting the cluster heads. Here,
we propose a Fault Tolerant Trajectory Clustering (FTTC) technique for
selecting the cluster heads in WSNs. Our algorithm selects the cluster heads
based on traffic and rotates periodically. It provides the first Fault Tolerant
Trajectory based clustering technique for selecting the cluster heads and to
extenuate the hot spot problem by prolonging the network lifetime.
","[{'version': 'v1', 'created': 'Wed, 3 Aug 2011 05:47:24 GMT'}]",2012-04-01,"[['Munaga', 'Hazarath', '', 'Dr MHM Krishna Prasad'], ['Murthy', 'J. V. R.', ''], ['Venkateswarlu', 'N. B.', '']]","['FaultTolerantTrajectoryClustering', 'Trajectoryclustering', 'Wireless sensor networks', 'Network life time', 'Clusterhead']"
15409,1704.03738,Lucas Carvalho Cordeiro,"Rodrigo F. Araujo, Higo F. Albuquerque, Iury V. de Bessa, Lucas C.
  Cordeiro, Joao Edgar C. Filho",Counterexample Guided Inductive Optimization,,,,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes three variants of a counterexample guided inductive
optimization (CEGIO) approach based on Satisfiability Modulo Theories (SMT)
solvers. In particular, CEGIO relies on iterative executions to constrain a
verification procedure, in order to perform inductive generalization, based on
counterexamples extracted from SMT solvers. CEGIO is able to successfully
optimize a wide range of functions, including non-linear and non-convex
optimization problems based on SMT solvers, in which data provided by
counterexamples are employed to guide the verification engine, thus reducing
the optimization domain. The present algorithms are evaluated using a large set
of benchmarks typically employed for evaluating optimization techniques.
Experimental results show the efficiency and effectiveness of the proposed
algorithms, which find the optimal solution in all evaluated benchmarks, while
traditional techniques are usually trapped by local minima.
","[{'version': 'v1', 'created': 'Tue, 11 Apr 2017 15:33:50 GMT'}]",2017-04-13,"[['Araujo', 'Rodrigo F.', ''], ['Albuquerque', 'Higo F.', ''], ['de Bessa', 'Iury V.', ''], ['Cordeiro', 'Lucas C.', ''], ['Filho', 'Joao Edgar C.', '']]","['Satisfiability Modulo Theories (SMT)', 'Model checking', 'Global optimization', 'Non-convex optimization']"
15410,0909.4719,Chinh Hoang,"Elaine M. Eschen, Chinh T. Hoang, Jeremy P. Spinrad, R. Sritharan",On graphs without a C4 or a diamond,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the class of (C4, diamond)-free graphs; graphs in this class do
not contain a C4 or a diamond as an induced subgraph. We provide an efficient
recognition algorithm for this class. We count the number of maximal cliques in
a (C4, diamond)-free graph and the number of n-vertex, labeled (C4,
diamond)-free graphs. We also give an efficient algorithm for finding a largest
clique in the more general class of (house, diamond)-free graphs.
","[{'version': 'v1', 'created': 'Fri, 25 Sep 2009 15:14:46 GMT'}]",2009-09-28,"[['Eschen', 'Elaine M.', ''], ['Hoang', 'Chinh T.', ''], ['Spinrad', 'Jeremy P.', ''], ['Sritharan', 'R.', '']]","['C4-free graphs', 'diamond-free graphs', 'recognition algorithm']"
15411,1209.5428,Tanvir Ahmed,"Nasrin Sultana, Tanvir Ahmed, A. B. M. Siddique Hossain",Study of a new link layer security scheme in a wireless sensor network,"8 pages. arXiv admin note: text overlap with arXiv:0909.0576 by other
  authors","The AIUB Journal of Science and Engineering (AJSE), Vol. 10, No.
  1, pp. 79-86, 2011",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security of wireless sensor network (WSN) is always considered a critical
issue and has a number of considerations that separate them from traditional
wireless sensor network. First, sensor devices are typically vulnerable to
physical compromise. Second, they have significant power and processing
constraints. Third, the most critical security issue is protecting the
aggregate output of the system, even if individual nodes may be compromised.
While a variety of security techniques are being developed and lots of
researches are going on security fields. In this paper we have proposed a new
technique to provide data authentication and privacy in faster, scalable and
cost effective way.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2012 21:20:44 GMT'}]",2012-09-26,"[['Sultana', 'Nasrin', ''], ['Ahmed', 'Tanvir', ''], ['Hossain', 'A. B. M. Siddique', '']]","['Wireless sensor Network', 'Block Cipher', 'Mode of Operation', 'Link Layer', 'MISTY1', 'OFB']"
15412,1510.06229,Crescencio Rodrigues Lima Neto,"Crescencio Rodrigues Lima Neto, Christina von Flach Chavez, Eduardo
  Santana de Almeida, Dominik Rost, Matthias Naab","Unveiling Architecture Documentation: Brazilian Stakeholders in
  Perspective","10 pages, 15 figures, 7 tables",,,"TR-PGCOMP-002/2015. Technical Report. Computer Science Graduate
  Program. Federal University of Bahia",cs.SE cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the years, software architecture has become a established discipline,
both in academia and industry, and the interest on software architecture
documentation has increased. In this context, the improvement of methods,
tools, and techniques around architecture documentation is of paramount
importance. We conducted a survey with 147 industrial participants (31 from
Brazil), analyzing their current problems and future wishes. We identified that
Brazilian stakeholders need updated architecture documents with the right
information. Finally, the automation of some parts of the documentation will
reduce the effort during the creation of the documents. But first, is necessary
to change the culture of the stakeholders. They have to participate actively in
the architecture documents creation.
","[{'version': 'v1', 'created': 'Wed, 21 Oct 2015 12:21:46 GMT'}]",2015-10-22,"[['Neto', 'Crescencio Rodrigues Lima', ''], ['Chavez', 'Christina von Flach', ''], ['de Almeida', 'Eduardo Santana', ''], ['Rost', 'Dominik', ''], ['Naab', 'Matthias', '']]","['Software architecture', 'documentation', 'survey']"
15413,1505.02288,Alessio Benavoli,Alessio Benavoli and Giorgio Corani and Francesca Mangili,Should we really use post-hoc tests based on mean-ranks?,,,,,cs.LG math.ST physics.data-an q-bio.QM stat.ML stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The statistical comparison of multiple algorithms over multiple data sets is
fundamental in machine learning. This is typically carried out by the Friedman
test. When the Friedman test rejects the null hypothesis, multiple comparisons
are carried out to establish which are the significant differences among
algorithms. The multiple comparisons are usually performed using the mean-ranks
test. The aim of this technical note is to discuss the inconsistencies of the
mean-ranks post-hoc test with the goal of discouraging its use in machine
learning as well as in medicine, psychology, etc.. We show that the outcome of
the mean-ranks test depends on the pool of algorithms originally included in
the experiment. In other words, the outcome of the comparison between
algorithms A and B depends also on the performance of the other algorithms
included in the original experiment. This can lead to paradoxical situations.
For instance the difference between A and B could be declared significant if
the pool comprises algorithms C, D, E and not significant if the pool comprises
algorithms F, G, H. To overcome these issues, we suggest instead to perform the
multiple comparison using a test whose outcome only depends on the two
algorithms being compared, such as the sign-test or the Wilcoxon signed-rank
test.
","[{'version': 'v1', 'created': 'Sat, 9 May 2015 15:54:56 GMT'}]",2015-05-12,"[['Benavoli', 'Alessio', ''], ['Corani', 'Giorgio', ''], ['Mangili', 'Francesca', '']]","['statistical comparison', 'Friedman test', 'post-hoc test']"
15414,1512.01515,Or Litany,"Or Litany, Tal Remez, Daniel Freedman, Lior Shapira, Alex Bronstein,
  Ran Gal",ASIST: Automatic Semantically Invariant Scene Transformation,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present ASIST, a technique for transforming point clouds by replacing
objects with their semantically equivalent counterparts. Transformations of
this kind have applications in virtual reality, repair of fused scans, and
robotics. ASIST is based on a unified formulation of semantic labeling and
object replacement; both result from minimizing a single objective. We present
numerical tools for the efficient solution of this optimization problem. The
method is experimentally assessed on new datasets of both synthetic and real
point clouds, and is additionally compared to two recent works on object
replacement on data from the corresponding papers.
","[{'version': 'v1', 'created': 'Fri, 4 Dec 2015 19:14:57 GMT'}]",2016-10-04,"[['Litany', 'Or', ''], ['Remez', 'Tal', ''], ['Freedman', 'Daniel', ''], ['Shapira', 'Lior', ''], ['Bronstein', 'Alex', ''], ['Gal', 'Ran', '']]","['Semantic segmentation', 'object recognition', 'random forest', 'Iterative Closest Point', 'Alternating minimization', 'Poseestimation', 'registration']"
15415,1502.06362,Masrour Zoghi,"Miroslav Dud\'ik and Katja Hofmann and Robert E. Schapire and
  Aleksandrs Slivkins and Masrour Zoghi",Contextual Dueling Bandits,"25 pages, 4 figures, Published at COLT 2015",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of learning to choose actions using contextual
information when provided with limited feedback in the form of relative
pairwise comparisons. We study this problem in the dueling-bandits framework of
Yue et al. (2009), which we extend to incorporate context. Roughly, the
learner's goal is to find the best policy, or way of behaving, in some space of
policies, although ""best"" is not always so clearly defined. Here, we propose a
new and natural solution concept, rooted in game theory, called a von Neumann
winner, a randomized policy that beats or ties every other policy. We show that
this notion overcomes important limitations of existing solutions, particularly
the Condorcet winner which has typically been used in the past, but which
requires strong and often unrealistic assumptions. We then present three
efficient algorithms for online learning in our setting, and for approximating
a von Neumann winner from batch-like data. The first of these algorithms
achieves particularly low regret, even when data is adversarial, although its
time and space requirements are linear in the size of the policy space. The
other two algorithms require time and space only logarithmic in the size of the
policy space when provided access to an oracle for solving classification
problems on the space.
","[{'version': 'v1', 'created': 'Mon, 23 Feb 2015 09:47:54 GMT'}, {'version': 'v2', 'created': 'Sat, 13 Jun 2015 21:56:25 GMT'}]",2015-06-16,"[['Dudík', 'Miroslav', ''], ['Hofmann', 'Katja', ''], ['Schapire', 'Robert E.', ''], ['Slivkins', 'Aleksandrs', ''], ['Zoghi', 'Masrour', '']]","['contextual dueling bandits', 'online learning', 'bandit algorithms', 'game theory']"
15416,1005.1194,Julien Bringer,Julien Bringer and Herv\'e Chabanne,Negative Databases for Biometric Data,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Negative databases - negative representations of a set of data - have been
introduced in 2004 to protect the data they contain. Today, no solution is
known to constitute biometric negative databases. This is surprising as
biometric applications are very demanding of such protection for privacy
reasons. The main difficulty comes from the fact that biometric captures of the
same trait give different results and comparisons of the stored reference with
the fresh captured biometric data has to take into account this variability. In
this paper, we give a first answer to this problem by exhibiting a way to
create and exploit biometric negative databases.
","[{'version': 'v1', 'created': 'Fri, 7 May 2010 12:29:01 GMT'}, {'version': 'v2', 'created': 'Mon, 10 May 2010 07:18:19 GMT'}]",2015-03-17,"[['Bringer', 'Julien', ''], ['Chabanne', 'Hervé', '']]","['Biometric data', 'Negative database', 'Privacy']"
15417,1301.6348,Fotis Foukalas,"Fotis Foukalas, George T. Karetsos, Lazaros Merakos","Capacity Optimization through Sensing Threshold Adaptation for Cognitive
  Radio Networks",,,,,cs.IT math.IT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose the capacity optimization over sensing threshold for
sensing-based cognitive radio networks. The objective function of the proposed
optimization is to maximize the capacity at the secondary user subject to the
constraints on the transmit power and the sensing threshold in order to protect
the primary user. The defined optimization problem is a convex optimization
over the transmit power and the sensing threshold where the concavity on
sensing threshold is proved. The problem is solved by using Lagrange duality
decomposition method in conjunction with a subgradient iterative algorithm and
the numerical results show that the proposed optimization can lead to
significant capacity maximization for the secondary user as long as the primary
user can afford.
","[{'version': 'v1', 'created': 'Sun, 27 Jan 2013 12:42:40 GMT'}]",2013-01-29,"[['Foukalas', 'Fotis', ''], ['Karetsos', 'George T.', ''], ['Merakos', 'Lazaros', '']]","['capacity optimization', 'sensing threshold', 'cognitive radio network', 'convex']"
15418,1505.03489,Ajay Boyat Kumar,"Ajay Kumar Boyat (1) and Brijendra Kumar Joshi (2) ((1)Research
  Scholar, Department of Electronics Telecomm and Computer Engineering,
  Military College of Tele Communication Engineering, Military Head Quartar of
  War (MHOW), Ministry of Defence, Govt. of India, India (2) Professor,
  Department of Electronics Telecomm and Computer Engineering, Military College
  of Tele Communication Engineering, Military Head Quartar of War (MHOW),
  Ministry of Defence, Govt. of India, India)",A Review Paper: Noise Models in Digital Image Processing,,"Signal & Image Processing : An International Journal (SIPIJ)
  Vol.6, No.2, April 2015",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Noise is always presents in digital images during image acquisition, coding,
transmission, and processing steps. Noise is very difficult to remove it from
the digital images without the prior knowledge of noise model. That is why,
review of noise models are essential in the study of image denoising
techniques. In this paper, we express a brief overview of various noise models.
These noise models can be selected by analysis of their origin. In this way, we
present a complete and quantitative analysis of noise models available in
digital images.
","[{'version': 'v1', 'created': 'Wed, 13 May 2015 18:37:01 GMT'}]",2015-05-14,"[['Boyat', 'Ajay Kumar', ''], ['Joshi', 'Brijendra Kumar', '']]","['Noise model', 'Probability density function', 'Power spectral density (PDF)', 'Digital images']"
15419,0708.2213,Luai Jaff,"Lua\""i Jaff (LIPN), G\'erard H.E. Duchamp (LIPN), Hatem Hadj Kacem,
  Cyrille Bertelle (LITIS)",Moderate Growth Time Series for Dynamic Combinatorics Modelisation,,"ECELM-2, Tirgu-Mures : Roumanie (2006)",,,cs.SC cs.MA math.CO,,"  Here, we present a family of time series with a simple growth constraint.
This family can be the basis of a model to apply to emerging computation in
business and micro-economy where global functions can be expressed from local
rules. We explicit a double statistics on these series which allows to
establish a one-to-one correspondence between three other ballot-like
strunctures.
","[{'version': 'v1', 'created': 'Thu, 16 Aug 2007 14:58:35 GMT'}]",2007-08-17,"[['Jaff', 'Luaï', '', 'LIPN'], ['Duchamp', 'Gérard H. E.', '', 'LIPN'], ['Kacem', 'Hatem Hadj', '', 'LITIS'], ['Bertelle', 'Cyrille', '', 'LITIS']]","['Time series', 'Complex system', 'Growth constraint', 'local rules', 'Dyck']"
15420,1802.06185,Amrith Krishna,"Vikas Reddy, Amrith Krishna, Vishnu Dutt Sharma, Prateek Gupta,
  Vineeth M R, Pawan Goyal",Building a Word Segmenter for Sanskrit Overnight,"The work is accepted at LREC 2018, Miyazaki, Japan",,,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is an abundance of digitised texts available in Sanskrit. However, the
word segmentation task in such texts are challenging due to the issue of
'Sandhi'. In Sandhi, words in a sentence often fuse together to form a single
chunk of text, where the word delimiter vanishes and sounds at the word
boundaries undergo transformations, which is also reflected in the written
text. Here, we propose an approach that uses a deep sequence to sequence
(seq2seq) model that takes only the sandhied string as the input and predicts
the unsandhied string. The state of the art models are linguistically involved
and have external dependencies for the lexical and morphological analysis of
the input. Our model can be trained ""overnight"" and be used for production. In
spite of the knowledge lean approach, our system preforms better than the
current state of the art by gaining a percentage increase of 16.79 % than the
current state of the art.
","[{'version': 'v1', 'created': 'Sat, 17 Feb 2018 04:05:36 GMT'}]",2018-02-20,"[['Reddy', 'Vikas', ''], ['Krishna', 'Amrith', ''], ['Sharma', 'Vishnu Dutt', ''], ['Gupta', 'Prateek', ''], ['R', 'Vineeth M', ''], ['Goyal', 'Pawan', '']]","['Word Segmentation', 'Sanskrit', 'Low-Resource Languages', 'Sequence to sequence', 'seq2seq', 'Deep Learning']"
15421,1205.2888,Youssef Bassil,Youssef Bassil,A Comparative Study on the Performance of Permutation Algorithms,"LACSC - Lebanese Association for Computational Sciences,
  http://www.lacsc.org","Journal of Computer Science & Research (JCSCR), Vol.1, No.1,
  pp.7-19, 2012",,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Permutation is the different arrangements that can be made with a given
number of things taking some or all of them at a time. The notation P(n,r) is
used to denote the number of permutations of n things taken r at a time.
Permutation is used in various fields such as mathematics, group theory,
statistics, and computing, to solve several combinatorial problems such as the
job assignment problem and the traveling salesman problem. In effect,
permutation algorithms have been studied and experimented for many years now.
Bottom-Up, Lexicography, and Johnson-Trotter are three of the most popular
permutation algorithms that emerged during the past decades. In this paper, we
are implementing three of the most eminent permutation algorithms, they are
respectively: Bottom-Up, Lexicography, and Johnson-Trotter algorithms. The
implementation of each algorithm will be carried out using two different
approaches: brute-force and divide and conquer. The algorithms codes will be
tested using a computer simulation tool to measure and evaluate the execution
time between the different implementations.
","[{'version': 'v1', 'created': 'Sun, 13 May 2012 17:47:51 GMT'}]",2012-05-15,"[['Bassil', 'Youssef', '']]","['Permutation', 'Algorithms', 'Brute-Force', 'Divide and Conquer']"
15422,1306.5099,Emna Rabhi,"Emna Rabhi, Zied Lachiri",SVM based on personal identification system using Electrocardiograms,Conference,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new algorithm for personal identification from their
Electrocardiograms (ECG) which is based on morphological descriptors and
Hermite Polynomials Expansion coefficients (HPEc). After preprocessing, we
extracted ten morphological descriptors which were divided into homogeneous
groups (amplitude, surface interval and slope) and we extracted sixty Hermite
Polynomials Expansion coefficients(HPEc) from each heartbeat. For the
classification, we employed a binary Support Vector Machines with Gaussian
kernel and we adopted a particular strategy: we first classified groups of
morphological descriptors separately then we combined them in one system. On
the other hand, we classified the Hermite Polynomials Expansion coefficients
apart and we associated them with all groups of morphological descriptors in a
single system in order to improve overall performance. We tested our algorithm
on 18 different healthy signals of the MIT_BIH database. The analysis of
different groups separately showed that the best recognition performance is
96.45% for all morphological descriptors and the results of experiments showed
that the proposed hybrid approach has led to an overall maximum of 98.97%.
","[{'version': 'v1', 'created': 'Fri, 21 Jun 2013 11:23:25 GMT'}]",2013-06-24,"[['Rabhi', 'Emna', ''], ['Lachiri', 'Zied', '']]","['Electrocardiogram (ECG)', 'Hermite polynomials Expansion coefficients (HPEc)', 'morphological descriptors', 'SVM', 'MIT_BIH database']"
15423,1610.00030,Marcos Zampieri,"Marcos Zampieri, Shervin Malmasi, Mark Dras",Modeling Language Change in Historical Corpora: The Case of Portuguese,Proceedings of Language Resources and Evaluation (LREC),"Proceedings of Language Resources and Evaluation (LREC). Portoroz,
  Slovenia. pp. 4098-4104 (2016)",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a number of experiments to model changes in a historical
Portuguese corpus composed of literary texts for the purpose of temporal text
classification. Algorithms were trained to classify texts with respect to their
publication date taking into account lexical variation represented as word
n-grams, and morphosyntactic variation represented by part-of-speech (POS)
distribution. We report results of 99.8% accuracy using word unigram features
with a Support Vector Machines classifier to predict the publication date of
documents in time intervals of both one century and half a century. A feature
analysis is performed to investigate the most informative features for this
task and how they are linked to language change.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2016 20:57:01 GMT'}]",2016-10-04,"[['Zampieri', 'Marcos', ''], ['Malmasi', 'Shervin', ''], ['Dras', 'Mark', '']]","['Language Change', 'Temporal Text Classification', 'Support Vector Machines', 'Text Categorization']"
15424,1207.7304,Hanen Idoudi Dr.,"Hanen Idoudi, Chiraz Houaidia, Leila Azouz Saidane, Pascale Minet",Robots-Assisted Redeployment in Wireless Sensor Networks,"Journal of Networking Technology, Dline, Vol. 3, No. 1, March 2012","Journal of Networking Technology, Dline, Vol. 3, No. 1, March 2012",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Connectivity and coverage are two crucial problems for wireless sensor
networks. Several studies have focused on proposing solutions for improving and
adjusting the initial deployment of a wireless sensor network to meet these two
criteria. In our work, we propose a new hierarchical architecture for sensor
networks that facilitates the gathering of redundancy information of the
topology. Several mobile robots must then relocate, in an optimized way,
redundant sensors to achieve optimal connectivity and coverage of the network.
Mobile robots have to cooperate and coordinate their movement. A performance
evaluation is conducted to study the trade-off between the number of required
robots and its impact on the rate of network connectivity and coverage.
","[{'version': 'v1', 'created': 'Tue, 31 Jul 2012 16:14:40 GMT'}]",2012-08-02,"[['Idoudi', 'Hanen', ''], ['Houaidia', 'Chiraz', ''], ['Saidane', 'Leila Azouz', ''], ['Minet', 'Pascale', '']]","['Wireless Sensor Networks', 'Mobile Robots', 'Redeployment', 'Connectivity', 'Coverage']"
15425,1507.01265,Alexey Lastovetsky,"Alexey Lastovetsky, Lukasz Szustak, Roman Wyrzykowski","Model-based optimization of MPDATA on Intel Xeon Phi through load
  imbalancing","10 pages, 9 figures, 3 tables",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Load balancing is a widely accepted technique for performance optimization of
scientific applications on parallel architectures. Indeed, balanced
applications do not waste processor cycles on waiting at points of
synchronization and data exchange, maximizing this way the utilization of
processors. In this paper, we challenge the universality of the load-balancing
approach to optimization of the performance of parallel applications. First, we
formulate conditions that should be satisfied by the performance profile of an
application in order for the application to achieve its best performance via
load balancing. Then we use a real-life scientific application, MPDATA, to
demonstrate that its performance profile on a modern parallel architecture,
Intel Xeon Phi, significantly deviates from these conditions. Based on this
observation, we propose a method of performance optimization of scientific
applications through load imbalancing. We also propose an algorithm that finds
the optimal, possibly imbalanced, configuration of a data parallel application
on a set of homogeneous processors. This algorithm uses functional performance
models of the application to find the partitioning that minimizes its
computation time but not necessarily balances the load of the processors. We
show how to apply this algorithm to optimization of MPDATA on Intel Xeon Phi.
Experimental results demonstrate that the performance of this carefully
optimized load-balanced application can be further improved by 15\% using the
proposed load-imbalancing optimization.
","[{'version': 'v1', 'created': 'Sun, 5 Jul 2015 20:06:43 GMT'}]",2015-07-07,"[['Lastovetsky', 'Alexey', ''], ['Szustak', 'Lukasz', ''], ['Wyrzykowski', 'Roman', '']]","['functional performance model', 'data partitioning', 'Intel XeonPhi', 'MPDATA', 'load imbalancing']"
15426,1402.2733,Jaideep Mulherkar,Jaideep Mulherkar,"An efficient algorithm for the entropy rate of a hidden Markov model
  with unambiguous symbols",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We demonstrate an efficient formula to compute the entropy rate $H(\mu)$ of a
hidden Markov process with $q$ output symbols where at least one symbol is
unambiguously received. Using an approximation to $H(\mu)$ to the first $N$
terms we give a $O(Nq^3$) algorithm to compute the entropy rate of the hidden
Markov model. We use the algorithm to estimate the entropy rate when the
parameters of the hidden Markov model are unknown.In the case of $q =2$ the
process is the output of the Z-channel and we use this fact to give bounds on
the capacity of the Gilbert channel.
","[{'version': 'v1', 'created': 'Wed, 12 Feb 2014 04:48:10 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Feb 2014 08:38:29 GMT'}]",2014-02-19,"[['Mulherkar', 'Jaideep', '']]","['Entropy rate', 'Hidden Markov model', 'Algebraic measures', 'Gilbertchannel capacity']"
15427,1205.5922,Noreddine Gherabi,"Noreddine Gherabi, Khaoula Addakiri, Mohamed Bahaj","Discovering new technique for mapping relational database based on
  semantic web technology",,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most of data on the Web are still stored in relational databases. Therefore,
it is more important to make the correspondence between relational databases
(RDB) and ontologies for storing the Web data. In this paper, we present an new
approach to map the data stored in relational databases into the Semantic Web,
we exploit simple mappings based on some specifications of the database schema,
and we explain how relational databases can be used to define a mapping
mechanism between relational database and OWL ontology. A framework has been
developed, which migrates successfully RDB into OWL document. The experimental
results were very important, demonstrating that the proposed method is feasible
and efficient.
","[{'version': 'v1', 'created': 'Sat, 26 May 2012 22:41:44 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Sep 2021 10:38:28 GMT'}]",2021-10-01,"[['Gherabi', 'Noreddine', ''], ['Addakiri', 'Khaoula', ''], ['Bahaj', 'Mohamed', '']]","['component; Web semantic', 'OWL', 'relational databases', 'Semantic Enrichment']"
15428,1710.01084,Helen L Bear,"Helen L. Bear, Gari Owen, Richard Harvey, and Barry-John Theobald","Some observations on computer lip-reading: moving from the dream to the
  reality",,"Helen L. Bear, Gari Owen, Richard Harvey, and Barry-John Theobald.
  Some observations on computer lip-reading: moving from the dream to the
  reality. International Society for Optics and Photonics- Security and
  defence. 2014. p92530G--92530G",,,cs.CV eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the quest for greater computer lip-reading performance there are a number
of tacit assumptions which are either present in the datasets (high resolution
for example) or in the methods (recognition of spoken visual units called
visemes for example). Here we review these and other assumptions and show the
surprising result that computer lip-reading is not heavily constrained by video
resolution, pose, lighting and other practical factors. However, the working
assumption that visemes, which are the visual equivalent of phonemes, are the
best unit for recognition does need further examination. We conclude that
visemes, which were defined over a century ago, are unlikely to be optimal for
a modern computer lip-reading system.
","[{'version': 'v1', 'created': 'Tue, 3 Oct 2017 11:33:50 GMT'}]",2018-04-26,"[['Bear', 'Helen L.', ''], ['Owen', 'Gari', ''], ['Harvey', 'Richard', ''], ['Theobald', 'Barry-John', '']]","['Lip-reading', 'speech recognition', 'pattern recognition']"
15429,1410.0589,Mateus de Oliveira Oliveira,Mateus de Oliveira Oliveira,An Algorithmic Metatheorem for Directed Treewidth,"41 pages, 6 figures, Accepted to Discrete Applied Mathematics",,,,cs.DS cs.CC cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The notion of directed treewidth was introduced by Johnson, Robertson,
Seymour and Thomas [Journal of Combinatorial Theory, Series B, Vol 82, 2001] as
a first step towards an algorithmic metatheory for digraphs. They showed that
some NP-complete properties such as Hamiltonicity can be decided in polynomial
time on digraphs of constant directed treewidth. Nevertheless, despite more
than one decade of intensive research, the list of hard combinatorial problems
that are known to be solvable in polynomial time when restricted to digraphs of
constant directed treewidth has remained scarce. In this work we enrich this
list by providing for the first time an algorithmic metatheorem connecting the
monadic second order logic of graphs to directed treewidth. We show that most
of the known positive algorithmic results for digraphs of constant directed
treewidth can be reformulated in terms of our metatheorem. Additionally, we
show how to use our metatheorem to provide polynomial time algorithms for two
classes of combinatorial problems that have not yet been studied in the context
of directed width measures. More precisely, for each fixed $k,w \in
\mathbb{N}$, we show how to count in polynomial time on digraphs of directed
treewidth $w$, the number of minimum spanning strong subgraphs that are the
union of $k$ directed paths, and the number of maximal subgraphs that are the
union of $k$ directed paths and satisfy a given minor closed property. To prove
our metatheorem we devise two technical tools which we believe to be of
independent interest. First, we introduce the notion of tree-zig-zag number of
a digraph, a new directed width measure that is at most a constant times
directed treewidth. Second, we introduce the notion of $z$-saturated tree slice
language, a new formalism for the specification and manipulation of infinite
sets of digraphs.
","[{'version': 'v1', 'created': 'Thu, 2 Oct 2014 15:27:00 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Oct 2015 07:16:23 GMT'}]",2015-10-09,"[['Oliveira', 'Mateus de Oliveira', '']]","['Combinatorial Slice Theory', 'Directed Treewidth', 'Tree-Zig-Zag Number', 'MonadicSecond Order Logic of Graphs', 'Algorithmic Metatheorems']"
15430,1603.07181,Paolo Perrone,Paolo Perrone and Nihat Ay,Iterative Scaling Algorithm for Channels,,,,,cs.IT math.IT stat.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Here we define a procedure for evaluating KL-projections (I- and
rI-projections) of channels. These can be useful in the decomposition of mutual
information between input and outputs, e.g. to quantify synergies and
interactions of different orders, as well as information integration and other
related measures of complexity.
  The algorithm is a generalization of the standard iterative scaling
algorithm, which we here extend from probability distributions to channels
(also known as transition kernels).
","[{'version': 'v1', 'created': 'Wed, 23 Mar 2016 13:48:04 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Sep 2016 15:07:17 GMT'}]",2016-09-20,"[['Perrone', 'Paolo', ''], ['Ay', 'Nihat', '']]","['Markov Kernels', 'Hierarchy', 'I-Projections', 'Divergences', 'Interactions', 'Iterative Scaling', 'Information Geometry']"
15431,1403.2187,Dou El Kefel Mansouri,"Dou El Kefel Mansouri, Mohamed Benyettou",A study of risk management in cloud computing bank,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing apparently helps in reducing costs and providing the
scheduling optimal level. In practice however it may confront the problem of
unavailability of resources. Taking into consideration the cloud computing bank
with its somehow commercial nature, the resources unavailability, such as
liquidity risk, remains. In this paper, an attempt to show through a solution
so far applied in economy, how would it be possible to predict such a liquidity
risk in cloud computing bank. The proposed solution can especially be adapted
to stock management. To reduce the risk we will also make use of a method
inspired from physics based on the fluids mechanics; it is an application of
Bernoulli's theorem called Torricelli. The resource bank will be considered as
a reservoir of liquid, and the availability of resources then will depend on
the liquid flow velocity and the replacement.
","[{'version': 'v1', 'created': 'Mon, 10 Mar 2014 09:30:11 GMT'}]",2014-03-11,"[['Mansouri', 'Dou El Kefel', ''], ['Benyettou', 'Mohamed', '']]","['Cloud computing', 'scheduling', 'risk', 'resources unavailability']"
15432,1312.6150,Sudipta Roy,"Sudipta Roy, Sanjay Nag, Indra Kanta Maitra, Samir Kumar Bandyopadhyay","A Review on Automated Brain Tumor Detection and Segmentation from MRI of
  Brain","30 figures. arXiv admin note: text overlap with arXiv:1205.6572 by
  other authors","International Journal of Advanced Research in Computer Science and
  Software Engineering, 2013",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tumor segmentation from magnetic resonance imaging (MRI) data is an important
but time consuming manual task performed by medical experts. Automating this
process is a challenging task because of the high diversity in the appearance
of tumor tissues among different patients and in many cases similarity with the
normal tissues. MRI is an advanced medical imaging technique providing rich
information about the human soft-tissue anatomy. There are different brain
tumor detection and segmentation methods to detect and segment a brain tumor
from MRI images. These detection and segmentation approaches are reviewed with
an importance placed on enlightening the advantages and drawbacks of these
methods for brain tumor detection and segmentation. The use of MRI image
detection and segmentation in different procedures are also described. Here a
brief review of different segmentation for detection of brain tumor from MRI of
brain has been discussed.
","[{'version': 'v1', 'created': 'Mon, 16 Dec 2013 17:56:11 GMT'}]",2013-12-24,"[['Roy', 'Sudipta', ''], ['Nag', 'Sanjay', ''], ['Maitra', 'Indra Kanta', ''], ['Bandyopadhyay', 'Samir Kumar', '']]","['MRI of Brain', 'Tumor Segmentation', 'Tumor Detection', 'Automated System', 'Pre-processing', 'Filtering']"
15433,1307.4717,Laurence Aroquiaraj,"T. Dharani, I. Laurence Aroquiaraj","Content Based Image Retrieval System using Feature Classification with
  Modified KNN Algorithm","6 pages, 5 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feature means countenance, remote sensing scene objects with similar
characteristics, associated to interesting scene elements in the image
formation process. They are classified into three types in image processing,
that is low, middle and high. Low level features are color, texture and middle
level feature is shape and high level feature is semantic gap of objects. An
image retrieval system is a computer system for browsing, searching and
retrieving images from a large image database. Content Based Image Retrieval is
a technique which uses visual features of image such as color, shape, texture
to search user required image from large image database according to user
requests in the form of a query. MKNN is an enhancing method of KNN. The
proposed KNN classification is called MKNN. MKNN contains two parts for
processing, they are validity of the train samples and applying weighted KNN.
The validity of each point is computed according to its neighbors. In our
proposal, Modified K-Nearest Neighbor can be considered a kind of weighted KNN
so that the query label is approximated by weighting the neighbors of the
query.
","[{'version': 'v1', 'created': 'Wed, 17 Jul 2013 18:22:24 GMT'}]",2013-07-18,"[['Dharani', 'T.', ''], ['Aroquiaraj', 'I. Laurence', '']]","['CBIR', 'Image Classification', 'KNN', 'MKNN', 'Unlabeled image']"
15434,1206.1291,Reza Tavoli,"Mohammadreza Keyvanpour, Reza Tavoli","Feature Weighting for Improving Document Image Retrieval System
  Performance",,"International Journal of Computer Science Issues, Vol 9, Issue 3,
  No 3 (2012) 125-130",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feature weighting is a technique used to approximate the optimal degree of
influence of individual features. This paper presents a feature weighting
method for Document Image Retrieval System (DIRS) based on keyword spotting. In
this method, we weight the feature using coefficient of multiple correlations.
Coefficient of multiple correlations can be used to describe the synthesized
effects and correlation of each feature. The aim of this paper is to show that
feature weighting increases the performance of DIRS. After applying the feature
weighting method to DIRS the average precision is 93.23% and average recall
become 98.66% respectively
","[{'version': 'v1', 'created': 'Wed, 6 Jun 2012 18:20:27 GMT'}]",2012-06-11,"[['Keyvanpour', 'Mohammadreza', ''], ['Tavoli', 'Reza', '']]","['Information Retrieval', 'Indexing', 'Document Image', 'Feature weighting']"
15435,1511.01436,Damien Fay,"Damien Fay, Hamed Haddadi, Michael C. Seto, Han Wang, and Christoph
  Carl Kling",An exploration of fetish social networks and communities,16 pages,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online Social Networks (OSNs) provide a venue for virtual interactions and
relationships between individuals. In some communities, OSNs also facilitate
arranging online meetings and relationships. FetLife, the worlds largest
anonymous social network for the BDSM, fetish and kink communities, provides a
unique example of an OSN that serves as an interaction space, community
organizing tool, and sexual market. In this paper, we present a first look at
the characteristics of European members of Fetlife, comprising 504,416
individual nodes with 1,912,196 connections. We looked at user characteristics
in terms of gender, sexual orientation, and preferred role. We further examined
the topological and structural properties of groups, as well as the type of
interactions and relations between their members. Our results suggest there are
important differences between the FetLife community and conventional OSNs. The
network can be characterised by complex gender based interactions both from a
sexual market and platonic viewpoint which point to a truly fascinating social
network.
","[{'version': 'v1', 'created': 'Wed, 4 Nov 2015 19:06:22 GMT'}]",2016-10-23,"[['Fay', 'Damien', ''], ['Haddadi', 'Hamed', ''], ['Seto', 'Michael C.', ''], ['Wang', 'Han', ''], ['Kling', 'Christoph Carl', '']]","['Social network properties', 'sexuality', 'topic modelling']"
15436,1209.5851,Antoine Madet,Antoine Madet (PPS),"A polynomial time {\lambda}-calculus with multithreading and side
  effects","PPDP, Leuven : Belgique (2012)",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The framework of Light Logics has been extensively studied to control the
complexity of higher-order functional programs. We propose an extension of this
framework to multithreaded programs with side effects, focusing on the case of
polynomial time. After introducing a modal \lambda-calculus with parallel
composition and regions, we prove that a realistic call-by-value evaluation
strategy can be computed in polynomial time for a class of well-formed
programs. The result relies on the simulation of call-by-value by a polynomial
shallow-first strategy which preserves the evaluation order of side effects.
Then, we provide a polynomial type system that guarantees that well-typed
programs do not go wrong. Finally, we illustrate the expressivity of the type
system by giving a programming example of concurrent iteration producing side
effects over an inductive data structure.
","[{'version': 'v1', 'created': 'Wed, 26 Sep 2012 07:33:43 GMT'}]",2012-09-27,"[['Madet', 'Antoine', '', 'PPS']]","['λ-calculus', 'side effect', 'region', 'thread', 'resource analysis']"
15437,1602.07905,Jan Leike,Jan Leike and Tor Lattimore and Laurent Orseau and Marcus Hutter,Thompson Sampling is Asymptotically Optimal in General Environments,UAI 2016,,,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We discuss a variant of Thompson sampling for nonparametric reinforcement
learning in a countable classes of general stochastic environments. These
environments can be non-Markov, non-ergodic, and partially observable. We show
that Thompson sampling learns the environment class in the sense that (1)
asymptotically its value converges to the optimal value in mean and (2) given a
recoverability assumption regret is sublinear.
","[{'version': 'v1', 'created': 'Thu, 25 Feb 2016 12:37:21 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Jun 2016 10:59:36 GMT'}]",2016-06-06,"[['Leike', 'Jan', ''], ['Lattimore', 'Tor', ''], ['Orseau', 'Laurent', ''], ['Hutter', 'Marcus', '']]","['General reinforcement learning', 'Thompsonsampling', 'asymptotic optimality', 'regret', 'discounting', 'recoverability', 'AIXI']"
15438,1702.00608,Antonio Campello,Antonio Campello,Random Ensembles of Lattices from Generalized Reductions,"9 pages, double columns, minor improvements. accepted for publication
  at IEEE Trans. Inf. Theory",,,,cs.IT math.IT math.MG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a general framework to study constructions of Euclidean lattices
from linear codes over finite fields. In particular, we prove general
conditions for an ensemble constructed using linear codes to contain dense
lattices (i.e., with packing density comparable to the Minkowski-Hlawka lower
bound). Specializing to number field lattices, we obtain a number of
interesting corollaries - for instance, the best known packing density of ideal
lattices, and an elementary coding-theoretic construction of asymptotically
dense Hurwitz lattices. All results are algorithmically effective, in the sense
that, for any dimension, a finite family containing dense lattices is
exhibited. For suitable constructions based on Craig's lattices, this family is
significantly smaller, in terms of alphabet-size, than previous ones in the
literature.
","[{'version': 'v1', 'created': 'Thu, 2 Feb 2017 10:37:05 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Dec 2017 17:05:36 GMT'}, {'version': 'v3', 'created': 'Mon, 5 Feb 2018 11:41:49 GMT'}]",2018-02-06,"[['Campello', 'Antonio', '']]","['Lattices', 'sphere packings', 'random codes', 'ideallattices', 'codes over matrix rings']"
15439,0806.3633,Chau Yuen,"Wee Seng Chua, Chau Yuen, Francois Chin","A Continuous Vector-Perturbation for Multi-Antenna Multi-User
  Communication",,VTC Spring 2007,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The sum-rate of the broadcast channel in a multi-antenna multi-user
communication system can be achieved by using precoding and adding a regular
perturbation to the data vector. The perturbation can be removed by the modulus
function, thus transparent to the receiver, but the information of the
precoding matrix is needed to decode the symbols. This paper proposes a new
technique to improve the multi-antenna multi-user system, by adding a
continuous perturbation to the data vector without the need of information on
the precoding matrix to be known at the receiver. The perturbation vector will
be treated as interference at the receiver, thus it will be transparent to the
receiver. The derivation of the continuous vector perturbation is provided by
maximizing the signal-to-interference plus noise ratio or minimizing the
minimum mean square error of the received signal.
","[{'version': 'v1', 'created': 'Mon, 23 Jun 2008 08:01:25 GMT'}]",2008-06-24,"[['Chua', 'Wee Seng', ''], ['Yuen', 'Chau', ''], ['Chin', 'Francois', '']]","['Multi-antenna multi-user', 'vector perturbation', 'continuous perturbation']"
15440,1307.5800,Subra Mukherjee,Subra Mukherjee and Karen Das,"An Adaptive GMM Approach to Background Subtraction for Application in
  Real Time Surveillance",5 Pages,"International Journal of Research in Engineering and
  Technology,Volume 2, Issue 1, Jan-2013",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efficient security management has become an important parameter in todays
world. As the problem is growing, there is an urgent need for the introduction
of advanced technology and equipment to improve the state-of art of
surveillance. In this paper we propose a model for real time background
subtraction using AGMM. The proposed model is robust and adaptable to dynamic
background, fast illumination changes, repetitive motion. Also we have
incorporated a method for detecting shadows using the Horpresert color model.
The proposed model can be employed for monitoring areas where movement or entry
is highly restricted. So on detection of any unexpected events in the scene an
alarm can be triggered and hence we can achieve real time surveillance even in
the absence of constant human monitoring.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2013 17:59:28 GMT'}]",2013-07-23,"[['Mukherjee', 'Subra', ''], ['Das', 'Karen', '']]","['Background subtraction', 'Adaptive Gaussian Mixture model (AGMM)', 'surveillance', 'Horpresert color model']"
15441,1004.3275,Vishal Goyal,"Kruti Dangarwala, Jigar Shah","C Implementation & comparison of companding & silence audio compression
  techniques","International Journal of Computer Science Issues online at
  http://ijcsi.org/articles/C-Implementation-comparison-of-companding-silence-audio-compression-techniques.php","IJCSI, Volume 7, Issue 2, March 2010",,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Just about all the newest living room audio-video electronics and PC
multimedia products being designed today will incorporate some form of
compressed digitized-audio processing capability. Audio compression reduces the
bit rate required to represent an analog audio signal while maintaining the
perceived audio quality. Discarding inaudible data reduces the storage,
transmission and compute requirements of handling high-quality audio files.
This paper covers wave audio file format & algorithm of silence compression
method and companding method to compress and decompress wave audio file. Then
it compares the result of these two methods.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2010 18:26:09 GMT'}]",2010-04-20,"[['Dangarwala', 'Kruti', ''], ['Shah', 'Jigar', '']]","['thresold', 'chunk', 'bitstream', 'companding', 'silence;']"
15442,1305.6721,Matthias Keil,Matthias Keil and Peter Thiemann,Type-based Dependency Analysis for JavaScript,Technical Report,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dependency analysis is a program analysis that determines potential data flow
between program points. While it is not a security analysis per se, it is a
viable basis for investigating data integrity, for ensuring confidentiality,
and for guaranteeing sanitization. A noninterference property can be stated and
proved for the dependency analysis. We have designed and implemented a
dependency analysis for JavaScript. We formalize this analysis as an
abstraction of a tainting semantics. We prove the correctness of the tainting
semantics, the soundness of the abstraction, a noninterference property, and
the termination of the analysis.
","[{'version': 'v1', 'created': 'Wed, 29 May 2013 08:38:32 GMT'}]",2013-05-30,"[['Keil', 'Matthias', ''], ['Thiemann', 'Peter', '']]","['Type-based Analysis', 'Dependency', 'JavaScript']"
15443,1603.01112,Reem Elkhouly,"Reem Elkhouly, Keiji Kimura, Ahmed El-Mahdy","If-Conversion Optimization using Neuro Evolution of Augmenting
  Topologies","Part of the Program Transformation for Programmability in
  Heterogeneous Architectures (PROHA) workshop, Barcelona, Spain, 12th March
  2016, 6 pages, LaTeX, 2 PDF figures",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Control-flow dependence is an intrinsic limiting factor for pro- gram
acceleration. With the availability of instruction-level par- allel
architectures, if-conversion optimization has, therefore, be- come pivotal for
extracting parallelism from serial programs. While many if-conversion
optimization heuristics have been proposed in the literature, most of them
consider rigid criteria regardless of the underlying hardware and input
programs. In this paper, we propose a novel if-conversion scheme that preforms
an efficient if-conversion transformation using a machine learning technique
(NEAT). This method enables if-conversion customization overall branches within
a program unlike the literature that considered in- dividual branches. Our
technique also provides flexibility required when compiling for heterogeneous
systems. The efficacy of our approach is shown by experiments and reported
results which il- lustrate that the programs can be accelerated on the same
archi- tecture and without modifying the original code. Our technique applies
for general purpose programming languages (e.g. C/C++) and is transparent for
the programmer. We implemented our tech- nique in LLVM 3.6.1 compilation
infrastructure and experimented on the kernels of SPEC-CPU2006 v1.1 benchmarks
suite running on a multicore system of Intel(R) Xeon(R) 3.50GHz processors. Our
findings show a performance gain up to 8.6% over the stan- dard optimized code
(LLVM -O2 with if-conversion included), in- dicating the need for If-conversion
compilation optimization that can adapt to the unique characteristics of every
individual branch.
","[{'version': 'v1', 'created': 'Thu, 3 Mar 2016 14:41:12 GMT'}]",2016-03-04,"[['Elkhouly', 'Reem', ''], ['Kimura', 'Keiji', ''], ['El-Mahdy', 'Ahmed', '']]","['If-Conversion', 'ILP', 'Performance Enchancement', 'Compiler Optimization', 'Machine Learning', 'NEAT', 'Neural Networks']"
15444,1305.5653,George Garbis,"George Garbis, Kostis Kyzirakos, and Manolis Koubarakis",Geographica: A Benchmark for Geospatial RDF Stores,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Geospatial extensions of SPARQL like GeoSPARQL and stSPARQL have recently
been defined and corresponding geospatial RDF stores have been implemented.
However, there is no widely used benchmark for evaluating geospatial RDF stores
which takes into account recent advances to the state of the art in this area.
In this paper, we develop a benchmark, called Geographica, which uses both
real-world and synthetic data to test the offered functionality and the
performance of some prominent geospatial RDF stores.
","[{'version': 'v1', 'created': 'Fri, 24 May 2013 08:54:46 GMT'}]",2013-05-27,"[['Garbis', 'George', ''], ['Kyzirakos', 'Kostis', ''], ['Koubarakis', 'Manolis', '']]","['benchmarking', 'geospatial', 'RDF store', 'Linked Open Data', 'GeoSPARQL', 'stSPARQL']"
15445,1603.08015,Raj Jain,"Sonia Fahmy, Raj Jain, Shivkumar Kalyanaraman, Rohit Goyal and Bobby
  Vandalore","On Determining the Fair Bandwidth Share for ABR Connections in ATM
  Networks","Journal of High Speed Networking, 2002",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a multi-service network such as ATM, adaptive data services(such as ABR)
share the bandwidth unused by higher priority services. The network indicates
to the ABR sources the fair and efficient rates at which they should transmit
to minimize their cell loss. In this paper, we propose a new method for
determining the ""effective"" number of active connections, and the fair
bandwidth share for each connection.
","[{'version': 'v1', 'created': 'Fri, 25 Mar 2016 20:07:09 GMT'}]",2016-03-29,"[['Fahmy', 'Sonia', ''], ['Jain', 'Raj', ''], ['Kalyanaraman', 'Shivkumar', ''], ['Goyal', 'Rohit', ''], ['Vandalore', 'Bobby', '']]","['congestion control', 'fair bandwidth allocation', 'traffic management', 'ATM networks', 'ABR service', 'ERICA']"
15446,1209.0249,Mohammed El-Dosuky,"M. A. El-Dosuky, M. Z. Rashad, T. T. Hamza, A. H. EL-Bassiouny","Robopinion: Opinion Mining Framework Inspired by Autonomous Robot
  Navigation",,,,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data association methods are used by autonomous robots to find matches
between the current landmarks and the new set of observed features. We seek a
framework for opinion mining to benefit from advancements in autonomous robot
navigation in both research and development
","[{'version': 'v1', 'created': 'Mon, 3 Sep 2012 06:00:04 GMT'}]",2012-09-04,"[['El-Dosuky', 'M. A.', ''], ['Rashad', 'M. Z.', ''], ['Hamza', 'T. T.', ''], ['EL-Bassiouny', 'A. H.', '']]","['Opinion mining', 'Data association', 'Robopinion']"
15447,1602.07383,Weiguang Ding,"Weiguang Ding, Graham Taylor",Automatic Moth Detection from Trap Images for Pest Management,Preprints accepted by Computers and electronics in agriculture,,,,cs.CV cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Monitoring the number of insect pests is a crucial component in
pheromone-based pest management systems. In this paper, we propose an automatic
detection pipeline based on deep learning for identifying and counting pests in
images taken inside field traps. Applied to a commercial codling moth dataset,
our method shows promising performance both qualitatively and quantitatively.
Compared to previous attempts at pest detection, our approach uses no
pest-specific engineering which enables it to adapt to other species and
environments with minimal human effort. It is amenable to implementation on
parallel hardware and therefore capable of deployment in settings where
real-time performance is required.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2016 03:35:42 GMT'}]",2016-02-25,"[['Ding', 'Weiguang', ''], ['Taylor', 'Graham', '']]","['Precision agriculture', 'Integrated pest management', 'Pest control', 'Trap images', 'Object detection', 'Convolutional neural network']"
15448,1510.04437,Satyabrata Maity,"Satyabrata Maity, Debotosh Bhattacharjee and Amlan Chakrabarti",A Novel Approach for Human Action Recognition from Silhouette Images,Manuscript,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a novel human action recognition technique from video is
presented. Any action of human is a combination of several micro action
sequences performed by one or more body parts of the human. The proposed
approach uses spatio-temporal body parts movement (STBPM) features extracted
from foreground silhouette of the human objects. The newly proposed STBPM
feature estimates the movements of different body parts for any given time
segment to classify actions. We also proposed a rule based logic named rule
action classifier (RAC), which uses a series of condition action rules based on
prior knowledge and hence does not required training to classify any action.
Since we don't require training to classify actions, the proposed approach is
view independent. The experimental results on publicly available Wizeman and
MuHVAi datasets are compared with that of the related research work in terms of
accuracy in the human action detection, and proposed technique outperforms the
others.
","[{'version': 'v1', 'created': 'Thu, 15 Oct 2015 08:10:42 GMT'}]",2015-10-16,"[['Maity', 'Satyabrata', ''], ['Bhattacharjee', 'Debotosh', ''], ['Chakrabarti', 'Amlan', '']]","['Video analysis', 'Action units', 'Action recognition', 'Spatio-temporal body parts movement (STBPM)', 'Rule-Actionclassifier (RAC)']"
15449,1205.7009,Yaojia Zhu,Yaojia Zhu and Xiaoran Yan and Cristopher Moore,"Oriented and Degree-generated Block Models: Generating and Inferring
  Communities with Inhomogeneous Degree Distributions","22 pages, 3 figures",,,,cs.SI cond-mat.stat-mech physics.soc-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The stochastic block model is a powerful tool for inferring community
structure from network topology. However, it predicts a Poisson degree
distribution within each community, while most real-world networks have a
heavy-tailed degree distribution. The degree-corrected block model can
accommodate arbitrary degree distributions within communities. But since it
takes the vertex degrees as parameters rather than generating them, it cannot
use them to help it classify the vertices, and its natural generalization to
directed graphs cannot even use the orientations of the edges. In this paper,
we present variants of the block model with the best of both worlds: they can
use vertex degrees and edge orientations in the classification process, while
tolerating heavy-tailed degree distributions within communities. We show that
for some networks, including synthetic networks and networks of word
adjacencies in English text, these new block models achieve a higher accuracy
than either standard or degree-corrected block models.
","[{'version': 'v1', 'created': 'Thu, 31 May 2012 14:36:44 GMT'}]",2012-06-01,"[['Zhu', 'Yaojia', ''], ['Yan', 'Xiaoran', ''], ['Moore', 'Cristopher', '']]","['complex networks', 'community detection', 'generative model', 'stochastic block model', 'degree distribution']"
15450,1504.05182,Varun  Jog,Varun Jog and Venkat Anantharam,"A Geometric Analysis of the AWGN channel with a $(\sigma, \rho)$-Power
  Constraint","55 pages, 5 figures. Contains results submitted to ISIT 2014 and ISIT
  2015. Submitted to IEEE Transactions on Information Theory",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider the AWGN channel with a power constraint called
the $(\sigma, \rho)$-power constraint, which is motivated by energy harvesting
communication systems. Given a codeword, the constraint imposes a limit of
$\sigma + k \rho$ on the total power of any $k\geq 1$ consecutive transmitted
symbols. Such a channel has infinite memory and evaluating its exact capacity
is a difficult task. Consequently, we establish an $n$-letter capacity
expression and seek bounds for the same. We obtain a lower bound on capacity by
considering the volume of ${\cal S}_n(\sigma, \rho) \subseteq \mathbb{R}^n$,
which is the set of all length $n$ sequences satisfying the $(\sigma,
\rho)$-power constraints. For a noise power of $\nu$, we obtain an upper bound
on capacity by considering the volume of ${\cal S}_n(\sigma, \rho) \oplus
B_n(\sqrt{n\nu})$, which is the Minkowski sum of ${\cal S}_n(\sigma, \rho)$ and
the $n$-dimensional Euclidean ball of radius $\sqrt{n\nu}$. We analyze this
bound using a result from convex geometry known as Steiner's formula, which
gives the volume of this Minkowski sum in terms of the intrinsic volumes of
${\cal S}_n(\sigma, \rho)$. We show that as the dimension $n$ increases, the
logarithm of the sequence of intrinsic volumes of $\{{\cal S}_n(\sigma,
\rho)\}$ converges to a limit function under an appropriate scaling. The upper
bound on capacity is then expressed in terms of this limit function. We derive
the asymptotic capacity in the low and high noise regime for the $(\sigma,
\rho)$-power constrained AWGN channel, with strengthened results for the
special case of $\sigma = 0$, which is the amplitude constrained AWGN channel.
","[{'version': 'v1', 'created': 'Mon, 20 Apr 2015 20:00:21 GMT'}]",2015-04-22,"[['Jog', 'Varun', ''], ['Anantharam', 'Venkat', '']]","['Additive white Gaussian noise', 'energy harvesting', '(σ', 'ρ)-power constraint', 'Minkowskisum', 'Steiner’s formula', 'Shannon capacity', 'intrinsic volumes']"
15451,1504.02059,Hayat Alrefaie,Hayat Alrefaie and Allan Ramsay,Supporting Language Learners with the Meanings Of Closed Class Items,"12 pages include references, 5 figures and AIAPP 2015 conference in
  Geneva",,,,cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The process of language learning involves the mastery of countless tasks:
making the constituent sounds of the language being learned, learning the
grammatical patterns, and acquiring the requisite vocabulary for reception and
production. While a plethora of computational tools exist to facilitate the
first and second of these tasks, a number of challenges arise with respect to
enabling the third. This paper describes a tool that has been designed to
support language learners with the challenge of understanding the use of
closed-class lexical items. The process of learning the Arabic for office is
(mktb) is relatively simple and should be possible by means of simple
repetition of the word. However, it is much more difficult to learn and
correctly use the Arabic equivalent of the word on. The current paper describes
a mechanism for the delivery of diagnostic information regarding specific
lexical examples, with the aim of clearly demonstrating why a particular
translation of a given closed-class item may be appropriate in certain
situations but not others, thereby helping learners to understand and use the
term correctly.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2015 18:12:07 GMT'}]",2015-04-09,"[['Alrefaie', 'Hayat', ''], ['Ramsay', 'Allan', '']]","['CALL tool', 'Diagnostic', 'Meaning postulates', 'logical form & Arabic Preposition.   1']"
15452,1402.1535,Ricardo Fernandes,"R. Q. A Fernandes, and E. H. Haeusler, and L. C. P. D Pereira",PUC-Logic,"33 pages, 1 figure",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a logic for Proximity-based Understanding of Conditionals
(PUC-Logic) that unifies the Counterfactual and Deontic logics proposed by
David Lewis. We also propose a natural deduction system (PUC-ND) associated to
this new logic. This inference system is proven to be sound, complete,
normalizing and decidable. The relative completeness for the $\boldsymbol{V}$
and $\boldsymbol{CO}$ logics is shown to emphasize the unified approach over
the work of Lewis.
","[{'version': 'v1', 'created': 'Fri, 7 Feb 2014 01:32:30 GMT'}]",2014-02-10,"[['Fernandes', 'R. Q. A', ''], ['Haeusler', 'E. H.', ''], ['Pereira', 'L. C. P. D', '']]","['Conditionals', 'Logic', 'Natural Deduction', 'Counterfactual Logic', 'Deontic Logic']"
15453,1412.2281,Marek Szyku{\l}a,Janusz Brzozowski and Marek Szyku{\l}a,Syntactic Complexity of Suffix-Free Languages,"22 pages, 12 figures",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We solve an open problem concerning syntactic complexity: We prove that the
cardinality of the syntactic semigroup of a suffix-free language with $n$ left
quotients (that is, with state complexity $n$) is at most $(n-1)^{n-2}+n-2$ for
$n\ge 6$. Since this bound is known to be reachable, this settles the problem.
We also reduce the alphabet of the witness languages reaching this bound to
five letters instead of $n+2$, and show that it cannot be any smaller. Finally,
we prove that the transition semigroup of a minimal deterministic automaton
accepting a witness language is unique for each $n$.
","[{'version': 'v1', 'created': 'Sat, 6 Dec 2014 20:58:05 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Oct 2015 11:58:00 GMT'}]",2015-10-16,"[['Brzozowski', 'Janusz', ''], ['Szykuła', 'Marek', '']]","['regular language', 'suffix-free', 'syntactic complexity', 'transition semigroup', 'upperbound']"
15454,1607.00537,Jiawei Zhang,Jiawei Zhang and Xiangnan Kong and Philip S. Yu,Badge System Analysis and Design,"11 pages, 10 figures, 3 tables, accepted by ASONAM 2016",,,,cs.SI cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To incentivize users' participations and steer their online activities,
online social networks start to provide users with various kinds of rewards for
their contributions to the sites. The most frequently distributed rewards
include account levels, reputation scores, different kinds of badges, and even
material awards like small gifts and cash back, etc. Attracted by these
rewards, users will spend more time using the network services. In this paper,
we will mainly focus on ""badges reward systems"" but the proposed models can be
applied to other reward systems as well. Badges are small icons attached to
users' homepages and profiles denoting their achievements. People like to
accumulate badge for various reasons and different badges can have specific
values for them. Meanwhile, to get badges, they also need to exert efforts to
finish the required tasks, which can lead to certain costs. To understand and
model users' motivations in badge achievement activities, we will study an
existing badge system launched inside a real-world online social network,
Foursquare, in this paper. At the same time, to maximize users' contributions
to online social networks, social network system designers need to determine
the optimal badge system mechanism carefully. Badge system mechanism describes
various detailed aspects of the system and can involve many parameters, e.g.,
categories of existing badges, number of badges available as well as the
minimum contributions required to obtain the badges, which all need to be
designed with meticulous investigations. Based on the model of users' badges
accumulating activities, in this paper, we will also study how to design the
badge system that can incentivize the maximum users' contributions to the
social networks.
","[{'version': 'v1', 'created': 'Sat, 2 Jul 2016 17:37:00 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Jul 2016 02:02:52 GMT'}]",2016-07-06,"[['Zhang', 'Jiawei', ''], ['Kong', 'Xiangnan', ''], ['Yu', 'Philip S.', '']]","['Badge System', 'Social Network', 'Game Theory', 'Data Mining']"
15455,1401.1086,Paulo Shakarian,"Paulo Shakarian, Hansheng Lei, Roy Lindelauf",Power Grid Defense Against Malicious Cascading Failure,,,,,cs.CR cs.MA physics.soc-ph,http://creativecommons.org/licenses/publicdomain/,"  An adversary looking to disrupt a power grid may look to target certain
substations and sources of power generation to initiate a cascading failure
that maximizes the number of customers without electricity. This is
particularly an important concern when the enemy has the capability to launch
cyber-attacks as practical concerns (i.e. avoiding disruption of service,
presence of legacy systems, etc.) may hinder security. Hence, a defender can
harden the security posture at certain power stations but may lack the time and
resources to do this for the entire power grid. We model a power grid as a
graph and introduce the cascading failure game in which both the defender and
attacker choose a subset of power stations such as to minimize (maximize) the
number of consumers having access to producers of power. We formalize problems
for identifying both mixed and deterministic strategies for both players, prove
complexity results under a variety of different scenarios, identify tractable
cases, and develop algorithms for these problems. We also perform an
experimental evaluation of the model and game on a real-world power grid
network. Empirically, we noted that the game favors the attacker as he benefits
more from increased resources than the defender. Further, the minimax defense
produces roughly the same expected payoff as an easy-to-compute deterministic
load based (DLB) defense when played against a minimax attack strategy.
However, DLB performs more poorly than minimax defense when faced with the
attacker's best response to DLB. This is likely due to the presence of low-load
yet high-payoff nodes, which we also found in our empirical analysis.
","[{'version': 'v1', 'created': 'Mon, 6 Jan 2014 14:08:09 GMT'}]",2014-01-07,"[['Shakarian', 'Paulo', ''], ['Lei', 'Hansheng', ''], ['Lindelauf', 'Roy', '']]","['power grid defense', 'game theory', 'complex networks']"
15456,1109.0617,Komalavalli Chakravarthi,"C.Komalavalli (Jagan Institute of Management Studies, Rohini, New
  Delhi) Chetna Laroiya (Jagan Insitute of Management Studies, Rohini, New
  Delhi)","Metadata Challenge for Query Processing Over Heterogeneous Wireless
  Sensor Network",15 Pages,"International Journal of Wireless & Mobile Networks (IJWMN) Vol.
  3, No. 4, August 2011",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless sensor networks become integral part of our life. These networks can
be used for monitoring the data in various domain due to their flexibility and
functionality. Query processing and optimization in the WSN is a very
challenging task because of their energy and memory constraint. In this paper,
first our focus is to review the different approaches that have significant
impacts on the development of query processing techniques for WSN. Finally, we
aim to illustrate the existing approach in popular query processing engines
with future research challenges in query optimization.
","[{'version': 'v1', 'created': 'Sat, 3 Sep 2011 12:04:00 GMT'}]",2011-09-06,"[['Komalavalli', 'C.', '', 'Jagan Institute of Management Studies, Rohini, New\n  Delhi'], ['Laroiya', 'Chetna', '', 'Jagan Insitute of Management Studies, Rohini, New\n  Delhi']]","['WSN', 'Query processing', 'Query optimization', 'Base Station', 'Cluster Node']"
15457,1704.06870,Haitao Wang,Shimin Li and Haitao Wang,Algorithms for Covering Multiple Barriers,"This version will be published in TCS. This version corrects an
  algorithm time analysis error in the previous version for the
  line-constrained problem",,,,cs.CG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider the problems for covering multiple intervals on a
line. Given a set $B$ of $m$ line segments (called ""barriers"") on a horizontal
line $L$ and another set $S$ of $n$ horizontal line segments of the same length
in the plane, we want to move all segments of $S$ to $L$ so that their union
covers all barriers and the maximum movement of all segments of $S$ is
minimized. Previously, an $O(n^3\log n)$-time algorithm was given for the case
$m=1$. In this paper, we propose an $O(n^2\log n\log \log n+nm\log m)$-time
algorithm for a more general setting with any $m\geq 1$, which also improves
the previous work when $m=1$. We then consider a line-constrained version of
the problem in which the segments of $S$ are all initially on the line $L$.
Previously, an $O(n\log n)$-time algorithm was known for the case $m=1$. We
present an algorithm of $O(m\log m+n\log m \log n)$ time for any $m\geq 1$.
These problems may have applications in mobile sensor barrier coverage in
wireless sensor networks.
","[{'version': 'v1', 'created': 'Sun, 23 Apr 2017 01:36:58 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Aug 2017 22:07:46 GMT'}, {'version': 'v3', 'created': 'Wed, 8 Aug 2018 17:39:33 GMT'}]",2018-08-09,"[['Li', 'Shimin', ''], ['Wang', 'Haitao', '']]","['barrier coverage', 'geometric coverage', 'mobile sensors', 'algorithms', 'data structures', 'computational geometry']"
15458,0909.2891,Michael Goodrich,"David Eppstein, Michael T. Goodrich, Lowell Trott",Going Off-road: Transversal Complexity in Road Networks,Fuller version of paper appearing in ACM GIS '09,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A geometric graph is a graph embedded in the plane with vertices at points
and edges drawn as curves (which are usually straight line segments) between
those points. The average transversal complexity of a geometric graph is the
number of edges of that graph that are crossed by random line or line segment.
In this paper, we study the average transversal complexity of road networks. By
viewing road networks as multiscale-dispersed graphs, we show that a random
line will cross the edges of such a graph O(sqrt(n)) times on average. In
addition, we provide by empirical evidence from experiments on the road
networks of the fifty states of United States and the District of Columbia that
this bound holds in practice and has a small constant factor. Combining this
result with data structuring techniques from computational geometry, allows us
to show that we can then do point location and ray-shooting navigational
queries with respect to road networks in O(sqrt(n) log n) expected time.
Finally, we provide empirical justification for this claim as well.
","[{'version': 'v1', 'created': 'Tue, 15 Sep 2009 22:09:19 GMT'}]",2009-09-17,"[['Eppstein', 'David', ''], ['Goodrich', 'Michael T.', ''], ['Trott', 'Lowell', '']]","['road networks', 'geometric graphs', 'multiscale-dispersed graphs', 'line transversals', 'edge crossings', 'ray-shooting data structures']"
15459,1412.2620,Gundram Leifert,"G. Leifert, T. Strau{\ss}, T. Gr\""uning, R. Labahn (University of
  Rostock)",Cells in Multidimensional Recurrent Neural Networks,,Journal of Machine Learning Research 17 (2016) 1-37,,,cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The transcription of handwritten text on images is one task in machine
learning and one solution to solve it is using multi-dimensional recurrent
neural networks (MDRNN) with connectionist temporal classification (CTC). The
RNNs can contain special units, the long short-term memory (LSTM) cells. They
are able to learn long term dependencies but they get unstable when the
dimension is chosen greater than one. We defined some useful and necessary
properties for the one-dimensional LSTM cell and extend them in the
multi-dimensional case. Thereby we introduce several new cells with better
stability. We present a method to design cells using the theory of linear shift
invariant systems. The new cells are compared to the LSTM cell on the IFN/ENIT
and Rimes database, where we can improve the recognition rate compared to the
LSTM cell. So each application where the LSTM cells in MDRNNs are used could be
improved by substituting them by the new developed cells.
","[{'version': 'v1', 'created': 'Mon, 8 Dec 2014 15:47:45 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Feb 2016 12:26:37 GMT'}]",2019-08-28,"[['Leifert', 'G.', '', 'University of\n  Rostock'], ['Strauß', 'T.', '', 'University of\n  Rostock'], ['Grüning', 'T.', '', 'University of\n  Rostock'], ['Labahn', 'R.', '', 'University of\n  Rostock']]","['LSTM', 'MDRNN', 'CTC', 'handwriting recognition', 'neural networkAbstract']"
15460,1502.04168,Shaobo Lin,Shaobo Lin,Nonparametric regression using needlet kernels for spherical data,21 pages,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Needlets have been recognized as state-of-the-art tools to tackle spherical
data, due to their excellent localization properties in both spacial and
frequency domains.
  This paper considers developing kernel methods associated with the needlet
kernel for nonparametric regression problems whose predictor variables are
defined on a sphere. Due to the localization property in the frequency domain,
we prove that the regularization parameter of the kernel ridge regression
associated with the needlet kernel can decrease arbitrarily fast. A natural
consequence is that the regularization term for the kernel ridge regression is
not necessary in the sense of rate optimality. Based on the excellent
localization property in the spacial domain further, we also prove that all the
$l^{q}$ $(01\leq q < \infty)$ kernel regularization estimates associated with
the needlet kernel, including the kernel lasso estimate and the kernel bridge
estimate, possess almost the same generalization capability for a large range
of regularization parameters in the sense of rate optimality.
  This finding tentatively reveals that, if the needlet kernel is utilized,
then the choice of $q$ might not have a strong impact in terms of the
generalization capability in some modeling contexts. From this perspective, $q$
can be arbitrarily specified, or specified merely by other no generalization
criteria like smoothness, computational complexity, sparsity, etc..
","[{'version': 'v1', 'created': 'Sat, 14 Feb 2015 05:37:32 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Sep 2015 12:34:58 GMT'}]",2015-09-11,"[['Lin', 'Shaobo', '']]","['Nonparametric regression', 'Needlet kernel', 'spherical data', 'kernel ridge']"
15461,1401.6887,Waqas Nawaz,"Kifayat Ullah Khan, Kamran Najeebullah, Waqas Nawaz, Young-Koo Lee",OLAP on Structurally Significant Data in Graphs,"4 Pages, Accepted in 5th International Conference on Data Mining and
  Intelligent Information Technology Applications (ICMIA) 2013, Korea",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Summarized data analysis of graphs using OLAP (Online Analytical Processing)
is very popular these days. However due to high dimensionality and large size,
it is not easy to decide which data should be aggregated for OLAP analysis.
Though iceberg cubing is useful, but it is unaware of the significance of
dimensional values with respect to the structure of the graph. In this paper,
we propose a Structural Significance, SS, measure to identify the structurally
significant dimensional values in each dimension. This leads to structure aware
pruning. We then propose an algorithm, iGraphCubing, to compute the graph cube
to analyze the structurally significant data using the proposed measure. We
evaluated the proposed ideas on real and synthetic data sets and observed very
encouraging results.
","[{'version': 'v1', 'created': 'Mon, 27 Jan 2014 15:16:17 GMT'}]",2014-01-28,"[['Khan', 'Kifayat Ullah', ''], ['Najeebullah', 'Kamran', ''], ['Nawaz', 'Waqas', ''], ['Lee', 'Young-Koo', '']]","['Graph Cubing', 'OLAP', 'Structure Aware Pruning']"
15462,1306.2477,George Grispos,"George Grispos, William Bradley Glisson and Tim Storer","Cloud Security Challenges: Investigating Policies, Standards, and
  Guidelines in a Fortune 500 Organization",,,,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing is quickly becoming pervasive in today's globally integrated
networks. The cloud offers organizations opportunities to potentially deploy
software and data solutions that are accessible through numerous mechanisms, in
a multitude of settings, at a reduced cost with increased reliability and
scalability. The increasingly pervasive and ubiquitous nature of the cloud
creates an environment that is potentially conducive to security risks. While
previous discussions have focused on security and privacy issues in the cloud
from the end-users perspective, minimal empirical research has been conducted
from the perspective of a corporate environment case study. This paper presents
the results of an initial case study identifying real-world information
security documentation issues for a Global Fortune 500 organization, should the
organization decide to implement cloud computing services in the future. The
paper demonstrates the importance of auditing policies, standards and
guidelines applicable to cloud computing environments along with highlighting
potential corporate concerns. The results from this case study has revealed
that from the 1123 'relevant' statements found in the organization's security
documentation, 175 statements were considered to be 'inadequate' for cloud
computing. Furthermore, the paper provides a foundation for future analysis and
research regarding implementation concerns for corporate cloud computing
applications and services
","[{'version': 'v1', 'created': 'Tue, 11 Jun 2013 10:18:02 GMT'}]",2013-06-12,"[['Grispos', 'George', ''], ['Glisson', 'William Bradley', ''], ['Storer', 'Tim', '']]","['Cloud Computing', 'Information Security', 'Corporate Policy', 'Requirements', 'Standard', 'Guidelines']"
15463,1010.1763,Cedric Fevotte,"C\'edric F\'evotte (LTCI), J\'er\^ome Idier (IRCCyN)",Algorithms for nonnegative matrix factorization with the beta-divergence,\`a para\^itre dans Neural Computation,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes algorithms for nonnegative matrix factorization (NMF)
with the beta-divergence (beta-NMF). The beta-divergence is a family of cost
functions parametrized by a single shape parameter beta that takes the
Euclidean distance, the Kullback-Leibler divergence and the Itakura-Saito
divergence as special cases (beta = 2,1,0, respectively). The proposed
algorithms are based on a surrogate auxiliary function (a local majorization of
the criterion function). We first describe a majorization-minimization (MM)
algorithm that leads to multiplicative updates, which differ from standard
heuristic multiplicative updates by a beta-dependent power exponent. The
monotonicity of the heuristic algorithm can however be proven for beta in (0,1)
using the proposed auxiliary function. Then we introduce the concept of
majorization-equalization (ME) algorithm which produces updates that move along
constant level sets of the auxiliary function and lead to larger steps than MM.
Simulations on synthetic and real data illustrate the faster convergence of the
ME approach. The paper also describes how the proposed algorithms can be
adapted to two common variants of NMF : penalized NMF (i.e., when a penalty
function of the factors is added to the criterion function) and convex-NMF
(when the dictionary is assumed to belong to a known subspace).
","[{'version': 'v1', 'created': 'Fri, 8 Oct 2010 18:53:27 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Oct 2010 17:10:38 GMT'}, {'version': 'v3', 'created': 'Tue, 8 Mar 2011 12:56:39 GMT'}]",2011-03-09,"[['Févotte', 'Cédric', '', 'LTCI'], ['Idier', 'Jérôme', '', 'IRCCyN']]","['Nonnegative matrix factorization (NMF)', 'β-divergence', 'multiplicative algorithms', 'majorization-minimization (MM)', 'majorization-equalization (ME)']"
15464,1107.3195,Thai Le,"Thai Le, Phat Tat and Hai Tran","Facial Expression Classification Based on Multi Artificial Neural
  Network and Two Dimensional Principal Component Analysis","8 pages, 16 figures, IJCSI International Journal of Computer Science
  Issues, Vol. 8, Issue 3, No. 1, May 2011","IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 3, No. 1, May 2011, ISSN (Online): 1694-0814, www.IJCSI.org",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Facial expression classification is a kind of image classification and it has
received much attention, in recent years. There are many approaches to solve
these problems with aiming to increase efficient classification. One of famous
suggestions is described as first step, project image to different spaces;
second step, in each of these spaces, images are classified into responsive
class and the last step, combine the above classified results into the final
result. The advantages of this approach are to reflect fulfill and multiform of
image classified. In this paper, we use 2D-PCA and its variants to project the
pattern or image into different spaces with different grouping strategies. Then
we develop a model which combines many Neural Networks applied for the last
step. This model evaluates the reliability of each space and gives the final
classification conclusion. Our model links many Neural Networks together, so we
call it Multi Artificial Neural Network (MANN). We apply our proposal model for
6 basic facial expressions on JAFFE database consisting 213 images posed by 10
Japanese female models.
","[{'version': 'v1', 'created': 'Sat, 16 Jul 2011 03:15:40 GMT'}]",2011-07-19,"[['Le', 'Thai', ''], ['Tat', 'Phat', ''], ['Tran', 'Hai', '']]","['Facial Expression', 'Multi Artificial Neural Network (MANN)', '2D-Principal Component Analysis (2D-PCA)']"
15465,1603.03165,Ivan Radi\v{c}ek,"Sumit Gulwani, Ivan Radi\v{c}ek, Florian Zuleger","Automated Clustering and Program Repair for Introductory Programming
  Assignments",Extended version of the PLDI paper of the same name,,,,cs.PL,http://creativecommons.org/licenses/by-sa/4.0/,"  Providing feedback on programming assignments is a tedious task for the
instructor, and even impossible in large Massive Open Online Courses with
thousands of students. Previous research has suggested that program repair
techniques can be used to generate feedback in programming education. In this
paper, we present a novel fully automated program repair algorithm for
introductory programming assignments. The key idea of the technique, which
enables automation and scalability, is to use the existing correct student
solutions to repair the incorrect attempts. We evaluate the approach in two
experiments: (I) We evaluate the number, size and quality of the generated
repairs on 4,293 incorrect student attempts from an existing MOOC. We find that
our approach can repair 97% of student attempts, while 81% of those are small
repairs of good quality. (II) We conduct a preliminary user study on
performance and repair usefulness in an interactive teaching setting. We obtain
promising initial results (the average usefulness grade 3.4 on a scale from 1
to 5), and conclude that our approach can be used in an interactive setting.
","[{'version': 'v1', 'created': 'Thu, 10 Mar 2016 07:00:06 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Mar 2016 14:40:23 GMT'}, {'version': 'v3', 'created': 'Sat, 27 Aug 2016 11:07:42 GMT'}, {'version': 'v4', 'created': 'Wed, 20 Jun 2018 02:16:55 GMT'}]",2018-06-21,"[['Gulwani', 'Sumit', ''], ['Radiček', 'Ivan', ''], ['Zuleger', 'Florian', '']]","['programming education', 'MOOC', 'dynamic analysis', 'program repair', 'clustering']"
15466,0907.4960,Muthiah Annamalai,Muthiah Annamalai,Ezhil: A Tamil Programming Language,"6 pages, Tamil UTF-8 characters",,,,cs.PL cs.CL,http://creativecommons.org/licenses/by/3.0/,"  Ezhil is a Tamil language based interpreted procedural programming language.
Tamil keywords and grammar are chosen to make the native Tamil speaker write
programs in the Ezhil system. Ezhil allows easy representation of computer
program closer to the Tamil language logical constructs equivalent to the
conditional, branch and loop statements in modern English based programming
languages. Ezhil is a compact programming language aimed towards Tamil speaking
novice computer users. Grammar for Ezhil and a few example programs are
reported here, from the initial proof-of-concept implementation using the
Python programming language1. To the best of our knowledge, Ezhil language is
the first freely available Tamil programming language.
","[{'version': 'v1', 'created': 'Tue, 28 Jul 2009 19:24:51 GMT'}]",2009-07-29,"[['Annamalai', 'Muthiah', '']]","[', but both Tamil', 'English identifiers,', 'function']"
15467,1005.4973,Mutsuo Saito,Mutsuo Saito and Makoto Matsumoto,Variants of Mersenne Twister Suitable for Graphic Processors,"23 pages, 6 figures","Transactions on Mathematical Software, 39 (2013), 12:1--12:20",,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a type of pseudorandom number generator, Mersenne Twister
for Graphic Processor (MTGP), for efficient generation on graphic processessing
units (GPUs). MTGP supports large state sizes such as 11213 bits, and uses the
high parallelism of GPUs in computing many steps of the recursion in parallel.
The second proposal is a parameter-set generator for MTGP, named MTGP Dynamic
Creator (MTGPDC). MT- GPDC creates up to 2^32 distinct parameter sets which
generate sequences with high-dimensional uniformity. This facility is suitable
for a large grid of GPUs where each GPU requires separate random number
streams. MTGP is based on linear recursion over the two-element field, and has
better high-dimensional equidistribution than the Mersenne Twister pseudorandom
number generator.
","[{'version': 'v1', 'created': 'Thu, 27 May 2010 01:06:54 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Jun 2010 06:17:48 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Mar 2012 08:12:08 GMT'}]",2013-03-14,"[['Saito', 'Mutsuo', ''], ['Matsumoto', 'Makoto', '']]","['Pseudo Random Number Generator', 'Mersenne Twister', 'GeneralPurpose Computing on Graphics Processing Units', 'Dynamic Creator']"
15468,1712.05193,Nandan Sudarsanam,"Nandan Sudarsanam, Nishanth Kumar, Abhishek Sharma, and Balaraman
  Ravindran",Rate of Change Analysis for Interestingness Measures,,,,,cs.LG cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of Association Rule Mining techniques in diverse contexts and domains
has resulted in the creation of numerous interestingness measures. This, in
turn, has motivated researchers to come up with various classification schemes
for these measures. One popular approach to classify the objective measures is
to assess the set of mathematical properties they satisfy in order to help
practitioners select the right measure for a given problem. In this research,
we discuss the insufficiency of the existing properties in literature to
capture certain behaviors of interestingness measures. This motivates us to
present a novel approach to analyze and classify measures. We refer to this as
a rate of change analysis (RCA). In this analysis a measure is described by how
it varies if there is a unit change in the frequency count
$(f_{11},f_{10},f_{01},f_{00})$, for different pre-existing states of the
frequency counts. More formally, we look at the first partial derivative of the
measure with respect to the various frequency count variables. We then use this
analysis to define two new properties, Unit-Null Asymptotic Invariance (UNAI)
and Unit-Null Zero Rate (UNZR). UNAI looks at the asymptotic effect of adding
frequency patterns, while UNZR looks at the initial effect of adding frequency
patterns when they do not pre-exist in the dataset. We present a comprehensive
analysis of 50 interestingness measures and classify them in accordance with
the two properties. We also present empirical studies, involving both synthetic
and real-world datasets, which are used to cluster various measures according
to the rule ranking patterns of the measures. The study concludes with the
observation that classification of measures using the empirical clusters share
significant similarities to the classification of measures done through the
properties presented in this research.
","[{'version': 'v1', 'created': 'Thu, 14 Dec 2017 12:13:46 GMT'}]",2017-12-15,"[['Sudarsanam', 'Nandan', ''], ['Kumar', 'Nishanth', ''], ['Sharma', 'Abhishek', ''], ['Ravindran', 'Balaraman', '']]","['Association rule mining', 'objective measures', 'properties ofmeasures', 'Rate of change analysis']"
15469,1610.07289,Alireza Majzoobi,"Hossein Lotfi, Alireza Majzoobi, Amin Khodaei, Shay Bahramirad, Aleksi
  Paaso",Levelized Cost of Energy Calculation for Energy Storage Systems,"CIGRE Grid of the Future Symposium, Oct.30-Nov.1 2016, Philadelphia,
  PA",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The levelized cost of energy (LCOE) presents the energy-normalized cost of a
generation asset by considering all associated costs (investment and operation)
and total generated energy over its life cycle. As LCOE is a levelized value,
it provides a quick and easy measure to compare different energy resource
technologies with different characteristics. The LCOE calculation for
large-scale power plants and distributed generations (DGs) is extensively
studied and can be found in the literature. The discussions on the LCOE
calculation for energy storage systems, however, is limited. Although still
relatively expensive compared to generation technologies, energy storage is
gaining significant attention and has been deployed extensively during the past
few years, conceivably due to its many benefits such as load shifting, energy
arbitrage, and renewable coordination. Therefore, LCOE calculation of energy
storage systems plays an important role in economic evaluation of power
systems. This paper proposes a method for calculating the LCOE of energy
storage, and further provides the sensitivity analysis with respect to changes
in capacity, electricity market prices, and efficiency.
","[{'version': 'v1', 'created': 'Mon, 24 Oct 2016 06:08:06 GMT'}]",2016-10-25,"[['Lotfi', 'Hossein', ''], ['Majzoobi', 'Alireza', ''], ['Khodaei', 'Amin', ''], ['Bahramirad', 'Shay', ''], ['Paaso', 'Aleksi', '']]","['Distributed energy resources', 'distributed generation', 'energy storage system', 'levelized cost of energy']"
15470,1406.5895,Gabriele Fici,"Arturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal and Marinella
  Sciortino",Universal Lyndon Words,To appear in the proceedings of MFCS 2014,"Lecture Notes in Computer Science, 8634: 135-146 (2014)",,,cs.DM cs.FL math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A word $w$ over an alphabet $\Sigma$ is a Lyndon word if there exists an
order defined on $\Sigma$ for which $w$ is lexicographically smaller than all
of its conjugates (other than itself). We introduce and study \emph{universal
Lyndon words}, which are words over an $n$-letter alphabet that have length
$n!$ and such that all the conjugates are Lyndon words. We show that universal
Lyndon words exist for every $n$ and exhibit combinatorial and structural
properties of these words. We then define particular prefix codes, which we
call Hamiltonian lex-codes, and show that every Hamiltonian lex-code is in
bijection with the set of the shortest unrepeated prefixes of the conjugates of
a universal Lyndon word. This allows us to give an algorithm for constructing
all the universal Lyndon words.
","[{'version': 'v1', 'created': 'Mon, 23 Jun 2014 13:24:16 GMT'}]",2014-07-15,"[['Carpi', 'Arturo', ''], ['Fici', 'Gabriele', ''], ['Holub', 'Stepan', ''], ['Oprsal', 'Jakub', ''], ['Sciortino', 'Marinella', '']]","['Lyndon word', 'Universal cycle', 'Universal Lyndon word', 'Lex-code']"
15471,1802.06591,German I. Parisi,"Jonathan Tong, German I. Parisi, Stefan Wermter, Brigitte R\""oder","Closing the loop on multisensory interactions: A neural architecture for
  multisensory causal inference and recalibration","The code to implement the network model and simulations can be found
  online at: https://github.com/jonathan-tong/multisensory-network-model",,,,cs.NE q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When the brain receives input from multiple sensory systems, it is faced with
the question of whether it is appropriate to process the inputs in combination,
as if they originated from the same event, or separately, as if they originated
from distinct events. Furthermore, it must also have a mechanism through which
it can keep sensory inputs calibrated to maintain the accuracy of its internal
representations. We have developed a neural network architecture capable of i)
approximating optimal multisensory spatial integration, based on Bayesian
causal inference, and ii) recalibrating the spatial encoding of sensory
systems. The architecture is based on features of the dorsal processing
hierarchy, including the spatial tuning properties of unisensory neurons and
the convergence of different sensory inputs onto multisensory neurons.
Furthermore, we propose that these unisensory and multisensory neurons play
dual roles in i) encoding spatial location as separate or integrated estimates
and ii) accumulating evidence for the independence or relatedness of
multisensory stimuli. We further propose that top-down feedback connections
spanning the dorsal pathway play key a role in recalibrating spatial encoding
at the level of early unisensory cortices. Our proposed architecture provides
possible explanations for a number of human electrophysiological and
neuroimaging results and generates testable predictions linking neurophysiology
with behaviour.
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 11:31:02 GMT'}, {'version': 'v2', 'created': 'Sat, 24 Feb 2018 14:03:42 GMT'}, {'version': 'v3', 'created': 'Sun, 4 Mar 2018 14:59:39 GMT'}]",2018-03-06,"[['Tong', 'Jonathan', ''], ['Parisi', 'German I.', ''], ['Wermter', 'Stefan', ''], ['Röder', 'Brigitte', '']]","['Causal inference', 'Multisensory integration', 'Neural network', 'Recalibration', 'Ventriloquism effect   1']"
15472,1605.01802,Tapan Sharma,"Tapan Sharma, Dr. Vinod Shokeen, Dr. Sunil Mathur","Multiple K Means++ Clustering of Satellite Image Using Hadoop MapReduce
  and Spark","9 Pages, Distributed Computing, Satellite Images, Clustering,
  Published in International Journal of Advanced Studies in Computer Science
  and Engineering, IJASCSE volume 5 issue 4, 2016",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering of image is one of the important steps of mining satellite images.
In our experiment we have simultaneously run multiple K-means algorithms with
different initial centroids and values of k in the same iteration of MapReduce
jobs. For initialization of initial centroids we have implemented Scalable
K-Means++ MapReduce (MR) job [1]. We have also run a validation algorithm of
Simplified Silhouette Index [2] for multiple clustering outputs, again in the
same iteration of MR jobs. This paper explored the behavior of above mentioned
clustering algorithms when run on big data platforms like MapReduce and Spark
jobs. Spark has been chosen as it is popular for fast processing particularly
where iterations are involved.
","[{'version': 'v1', 'created': 'Fri, 6 May 2016 02:05:04 GMT'}]",2016-05-09,"[['Sharma', 'Tapan', ''], ['Shokeen', 'Dr. Vinod', ''], ['Mathur', 'Dr. Sunil', '']]","['Satellite images', 'Clustering', 'Scalable K']"
15473,1707.08901,Alessandro Valitutti,Alessandro Valitutti and Giuseppe Trautteur,Providing Self-Aware Systems with Reflexivity,"12 pages plus bibliography, appendices with code description, code of
  the proof-of-concept implementation, and examples of execution",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new type of self-aware systems inspired by ideas from
higher-order theories of consciousness. First, we discussed the crucial
distinction between introspection and reflexion. Then, we focus on
computational reflexion as a mechanism by which a computer program can inspect
its own code at every stage of the computation. Finally, we provide a formal
definition and a proof-of-concept implementation of computational reflexion,
viewed as an enriched form of program interpretation and a way to dynamically
""augment"" a computational process.
","[{'version': 'v1', 'created': 'Thu, 27 Jul 2017 15:05:27 GMT'}]",2017-07-28,"[['Valitutti', 'Alessandro', ''], ['Trautteur', 'Giuseppe', '']]","['computational reflexivity', 'computational augmentation', 'selfaware systems', 'self-representation', 'self-modification', 'self-monitoring']"
15474,1206.3722,Saurabh  Pal,"Umesh Kumar Pandey, Surjeet Kumar Yadav, Saurabh Pal",Data Mining Application to Attract Students in HEI,6 pages,"International Journal on Computer Science and Engineering
  (IJCSE)Vol. 4 No. 06 June 2012",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last two decades, number of Higher Education Institutions (HEI) grows
in leaps and bounds. This causes a cut throat competition among these
institutions while attracting the student get admission in these institutions.
To make reach up to the students institution makes effort of advertisement.
Similarly developing and developed both type of institution launch several
services also to attract students. Most of the institutions are opened in self
finance mode. So all time they feel short hand in expenditure. Now a day a
number of advertisement methods are available. So it is difficult for an
institution to make advertisement through all modes and launch all services at
the same time due to different constraints. In this paper we use support and
confidence method to find out the best way of advertisement.
","[{'version': 'v1', 'created': 'Sun, 17 Jun 2012 05:04:16 GMT'}]",2012-06-19,"[['Pandey', 'Umesh Kumar', ''], ['Yadav', 'Surjeet Kumar', ''], ['Pal', 'Saurabh', '']]","['Higher Education Institute', 'Enrollment Management', 'Predictive Models']"
15475,1107.3680,Raj Kishen Moloo Mr,"Raj Kishen Moloo, Muhammad Ajmal Sheik Dawood, Abu Salmaan Auleear","3-Phase Recognition Approach to Pseudo 3D Building Generation from 2D
  Floor Plan","15 pages,12 figures, 2 tables, International Journal of Computer
  Graphics & Animation (IJCGA) Vol.1, No.2, June 2011","International Journal of Computer Graphics & Animation (IJCGA)
  Vol.1, No.2, June 2011",,,cs.GR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays three dimension (3D) architectural visualisation has become a
powerful tool in the conceptualisation, design and presentation of
architectural products in the construction industry, providing realistic
interaction and walkthrough on engineering products. Traditional ways of
implementing 3D models involves the use of specialised 3D authoring tools along
with skilled 3D designers with blueprints of the model and this is a slow and
laborious process. The aim of this paper is to automate this process by simply
analyzing the blueprint document and generating the 3D scene automatically. For
this purpose we have devised a 3-Phase recognition approach to pseudo 3D
building generation from 2D floor plan and developed a software accordingly.
Our 3-phased 3D building system has been implemented using C, C++ and OpenCV
library [24] for the Image Processing module; The Save Module generated an XML
file for storing the processed floor plan objects attributes; while the
Irrlitch [14] game engine was used to implement the Interactive 3D module.
Though still at its infancy, our proposed system gave commendable results. We
tested our system on 6 floor plans with complexities ranging from low to high
and the results seems to be very promising with an average processing time of
around 3s and a 3D generation in 4s. In addition the system provides an
interactive walk-though and allows users to modify components.
","[{'version': 'v1', 'created': 'Tue, 19 Jul 2011 10:50:31 GMT'}]",2011-07-20,"[['Moloo', 'Raj Kishen', ''], ['Dawood', 'Muhammad Ajmal Sheik', ''], ['Auleear', 'Abu Salmaan', '']]","['Image processing', 'analysis', 'recognition', '3D', 'Architectural plan', 'Virtual Reality', 'Object Extraction']"
15476,1202.6548,Davide Albanese,"Davide Albanese and Roberto Visintainer and Stefano Merler and
  Samantha Riccadonna and Giuseppe Jurman and Cesare Furlanello",mlpy: Machine Learning Python,"Corrected a few typos; rephrased two sentences in the Overview
  section",,,,cs.MS cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  mlpy is a Python Open Source Machine Learning library built on top of
NumPy/SciPy and the GNU Scientific Libraries. mlpy provides a wide range of
state-of-the-art machine learning methods for supervised and unsupervised
problems and it is aimed at finding a reasonable compromise among modularity,
maintainability, reproducibility, usability and efficiency. mlpy is
multiplatform, it works with Python 2 and 3 and it is distributed under GPL3 at
the website http://mlpy.fbk.eu.
","[{'version': 'v1', 'created': 'Wed, 29 Feb 2012 13:49:10 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Mar 2012 13:31:54 GMT'}]",2012-03-02,"[['Albanese', 'Davide', ''], ['Visintainer', 'Roberto', ''], ['Merler', 'Stefano', ''], ['Riccadonna', 'Samantha', ''], ['Jurman', 'Giuseppe', ''], ['Furlanello', 'Cesare', '']]","['Python', 'machine learning', 'classification', 'regression', 'dimensionality reduction', 'clustering']"
15477,1410.1258,Maria Spichkova,"Jan Olaf Blech, Maria Spichkova, Ian Peake, Heinz Schmidt","Cyber-Virtual Systems: Simulation, Validation & Visualization","Preprint, 9th International Conference on Evaluation of Novel
  Approaches to Software Engineering (ENASE 2014)",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe our ongoing work and view on simulation, validation and
visualization of cyber-physical systems in industrial automation during
development, operation and maintenance. System models may represent an existing
physical part - for example an existing robot installation - and a software
simulated part - for example a possible future extension. We call such systems
cyber-virtual systems.
  In this paper, we present the existing VITELab infrastructure for
visualization tasks in industrial automation. The new methodology for
simulation and validation motivated in this paper integrates this
infrastructure. We are targeting scenarios, where industrial sites which may be
in remote locations are modeled and visualized from different sites anywhere in
the world.
  Complementing the visualization work, here, we are also concentrating on
software modeling challenges related to cyber-virtual systems and simulation,
testing, validation and verification techniques for them. Software models of
industrial sites require behavioural models of the components of the industrial
sites such as models for tools, robots, workpieces and other machinery as well
as communication and sensor facilities. Furthermore, collaboration between
sites is an important goal of our work.
","[{'version': 'v1', 'created': 'Mon, 6 Oct 2014 05:40:50 GMT'}]",2014-10-07,"[['Blech', 'Jan Olaf', ''], ['Spichkova', 'Maria', ''], ['Peake', 'Ian', ''], ['Schmidt', 'Heinz', '']]","['Cyber-Physical Systems', 'Virtual Interoperability Testing', 'Simulation', 'System Modeling', 'Formal Specification', 'Visualization']"
15478,1108.5822,Geoffrey Irving,Geoffrey Irving,Banded Householder representation of linear subspaces,"5 pages, 1 figure, submitted to Linear Algebra and its Applications",,,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show how to compactly represent any $n$-dimensional subspace of $R^m$ as a
banded product of Householder reflections using $n(m - n)$ floating point
numbers. This is optimal since these subspaces form a Grassmannian space
$Gr_n(m)$ of dimension $n(m - n)$. The representation is stable and easy to
compute: any matrix can be factored into the product of a banded Householder
matrix and a square matrix using two to three QR decompositions.
","[{'version': 'v1', 'created': 'Tue, 30 Aug 2011 03:53:31 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Sep 2011 05:29:51 GMT'}, {'version': 'v3', 'created': 'Mon, 12 Sep 2011 16:02:56 GMT'}]",2011-09-13,"[['Irving', 'Geoffrey', '']]","['banded', 'linear subspace', 'orthogonal matrix', 'Householder reflection']"
15479,1007.1708,Kadirvelu SivaKumar,"Lim Huey Charn, Liyana Nuraini Rasid, Shahrel A. Suandi","A Study on the Effectiveness of Different Patch Size and Shape for Eyes
  and Mouth Detection",9 Pages,"(IJCSE) International Journal on Computer Science and Engineering,
  Vol. 2, No. 3, May 2010",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Template matching is one of the simplest methods used for eyes and mouth
detection. However, it can be modified and extended to become a powerful tool.
Since the patch itself plays a significant role in optimizing detection
performance, a study on the influence of patch size and shape is carried out.
The optimum patch size and shape is determined using the proposed method.
Usually, template matching is also combined with other methods in order to
improve detection accuracy. Thus, in this paper, the effectiveness of two image
processing methods i.e. grayscale and Haar wavelet transform, when used with
template matching are analyzed.
","[{'version': 'v1', 'created': 'Sat, 10 Jul 2010 09:01:48 GMT'}]",2010-07-13,"[['Charn', 'Lim Huey', ''], ['Rasid', 'Liyana Nuraini', ''], ['Suandi', 'Shahrel A.', '']]","['template matching', 'eyes and mouth detection', 'patch size and shape']"
15480,1704.05741,Rodrigo de Lamare,M. Kaloorazi and R. C. de Lamare,"Study of Anomaly Detection Based on Randomized Subspace Methods in IP
  Networks","6 pages, 2 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose novel randomized subspace methods to detect
anomalies in Internet Protocol networks. Given a data matrix containing
information about network traffic, the proposed approaches perform a
normal-plus-anomalous matrix decomposition aided by random subspace techniques
and subsequently detect traffic anomalies in the anomalous subspace using a
statistical test. Experimental results demonstrate improvement over the
traditional principal component analysis-based subspace methods in terms of
robustness to noise and detection rate.
","[{'version': 'v1', 'created': 'Wed, 19 Apr 2017 14:16:45 GMT'}]",2017-04-20,"[['Kaloorazi', 'M.', ''], ['de Lamare', 'R. C.', '']]","['anomaly detection', 'PCA subspace methods', 'orthonormal basis', 'Q-statistic']"
15481,1701.05608,Hamzeh Ghasemzadeh,"Hamzeh Ghasemzadeh, Ali Payandeh, Mohammad Reza Aref",A Hybrid DOS-Tolerant PKC-Based Key Management System for WSNs,Submitted journal paper,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security is a critical and vital task in wireless sensor networks, therefore
different key management systems have been proposed, many of which are based on
symmetric cryptography. Such systems are very energy efficient, but they lack
some other desirable characteristics. On the other hand, systems based on
public key cryptography have those desirable characteristics, but they consume
more energy. Recently based on authenticated messages from base station a new
PKC based key agreement protocol was proposed. We show this method is
susceptible to a form of denial of service attack where resources of the
network can be exhausted with bogus messages. Then, we propose two different
improvements to solve this vulnerability. Simulation results show that these
new protocols retain desirable characteristics of the basic method and solve
its deficiencies.
","[{'version': 'v1', 'created': 'Thu, 19 Jan 2017 21:31:16 GMT'}]",2017-01-23,"[['Ghasemzadeh', 'Hamzeh', ''], ['Payandeh', 'Ali', ''], ['Aref', 'Mohammad Reza', '']]","['wireless sensor network', 'Key Management', 'Broadcast Authentication', 'Public Key Cryptography']"
15482,1401.6576,Luc Dartois,"Luc Dartois (ULB), Charles Paperman",Adding modular predicates to first-order fragments,,,,,cs.LO cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the decidability of the definability problem for fragments of
first order logic over finite words enriched with modular predicates. Our
approach aims toward the most generic statements that we could achieve, which
successfully covers the quantifier alternation hierarchy of first order logic
and some of its fragments. We obtain that deciding this problem for each level
of the alternation hierarchy of both first order logic and its two-variable
fragment when equipped with all regular numerical predicates is not harder than
deciding it for the corresponding level equipped with only the linear order and
the successor. For two-variable fragments we also treat the case of the
signature containing only the order and modular predicates.Relying on some
recent results, this proves the decidability for each level of the alternation
hierarchy of the two-variable first order fragmentwhile in the case of the
first order logic the question remains open for levels greater than two.The
main ingredients of the proofs are syntactic transformations of first order
formulas as well as the algebraic framework of finite categories.
","[{'version': 'v1', 'created': 'Sat, 25 Jan 2014 19:57:46 GMT'}, {'version': 'v2', 'created': 'Mon, 19 May 2014 18:58:57 GMT'}, {'version': 'v3', 'created': 'Fri, 13 Nov 2015 14:43:48 GMT'}]",2015-11-16,"[['Dartois', 'Luc', '', 'ULB'], ['Paperman', 'Charles', '']]","['First order logic', 'automata theory', 'semigroup', 'modular predicates']"
15483,1208.2620,Muhammad Anshari Mr,Muhammad Anshari and Mohammad Nabil Almunawar,Empowered Customers in E-Health Business Process,"ASEAN University Network (AUN), FBEPS-AGBEP PhD Colloquium (5-6 June,
  2012)",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  E-health innovations support empowered customers. It offers the ability for
customers to have greater control and ready access applications of health
information, clinical information, and social interaction between interested
groups. However, providing empowerment in any state of interaction levels to
customers (patients) in a healthcare organization is challenging tasks.
Customers are empowered in the sense of controlling the process of interaction
between a firm with its customers, and among customers themselves. This paper
discusses dimension of customers' empowerment in e-health business process. We
propose reference model of Personal Health Cycle (PHC) as a holistic view of
healthcare business process. The PHC is used to define and distinct electronic
health record (EHR) from electronic medical record (EMR) and customers
empowerment.
","[{'version': 'v1', 'created': 'Tue, 7 Aug 2012 15:00:27 GMT'}]",2012-08-14,"[['Anshari', 'Muhammad', ''], ['Almunawar', 'Mohammad Nabil', '']]","['Empowerment', 'Personal Health Cycle', 'E-Health', 'Web 2']"
15484,0707.3390,Francis Bach,Francis Bach (WILLOW Project - Inria/Ens),Consistency of the group Lasso and multiple kernel learning,,,,,cs.LG,,"  We consider the least-square regression problem with regularization by a
block 1-norm, i.e., a sum of Euclidean norms over spaces of dimensions larger
than one. This problem, referred to as the group Lasso, extends the usual
regularization by the 1-norm where all spaces have dimension one, where it is
commonly referred to as the Lasso. In this paper, we study the asymptotic model
consistency of the group Lasso. We derive necessary and sufficient conditions
for the consistency of group Lasso under practical assumptions, such as model
misspecification. When the linear predictors and Euclidean norms are replaced
by functions and reproducing kernel Hilbert norms, the problem is usually
referred to as multiple kernel learning and is commonly used for learning from
heterogeneous data sources and for non linear variable selection. Using tools
from functional analysis, and in particular covariance operators, we extend the
consistency results to this infinite dimensional case and also propose an
adaptive scheme to obtain a consistent model estimate, even when the necessary
condition required for the non adaptive scheme is not satisfied.
","[{'version': 'v1', 'created': 'Mon, 23 Jul 2007 14:35:20 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Jan 2008 10:10:31 GMT'}]",2008-01-28,"[['Bach', 'Francis', '', 'WILLOW Project - Inria/Ens']]","['Sparsity', 'regularization', 'consistency', 'convex optimization', 'covariance operators']"
15485,0706.3848,Vlady Ravelomanana,"Jean Cardinal (ULB), Vlady Ravelomanana (LIPN), Mario Valencia-Pabon
  (LIPN)",Minimum Sum Edge Colorings of Multicycles,,,,,cs.DM,,"  In the minimum sum edge coloring problem, we aim to assign natural numbers to
edges of a graph, so that adjacent edges receive different numbers, and the sum
of the numbers assigned to the edges is minimum. The {\em chromatic edge
strength} of a graph is the minimum number of colors required in a minimum sum
edge coloring of this graph. We study the case of multicycles, defined as
cycles with parallel edges, and give a closed-form expression for the chromatic
edge strength of a multicycle, thereby extending a theorem due to Berge. It is
shown that the minimum sum can be achieved with a number of colors equal to the
chromatic index. We also propose simple algorithms for finding a minimum sum
edge coloring of a multicycle. Finally, these results are generalized to a
large family of minimum cost coloring problems.
","[{'version': 'v1', 'created': 'Tue, 26 Jun 2007 14:43:15 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Jan 2008 13:36:41 GMT'}]",2008-01-22,"[['Cardinal', 'Jean', '', 'ULB'], ['Ravelomanana', 'Vlady', '', 'LIPN'], ['Valencia-Pabon', 'Mario', '', 'LIPN']]","['graph coloring', 'minimum sum coloring', 'chromatic strength']"
15486,1609.06948,Tamas Peni,"T. Luspay, T. Peni, I. Gozse, Z. Szabo, B. Vanek",Model reduction for LPV systems based on approximate modal decomposition,"26 pages, 11 figures, 1 table",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents a novel model order reduction technique for large-scale
linear parameter varying (LPV) systems. The approach is based on decoupling the
original dynamics into smaller dimensional LPV subsystems that can be
independently reduced by parameter varying reduction methods. The decomposition
starts with the construction of a modal transformation that separates the modal
subsystems. Hierarchical clustering is applied then to collect the dynamically
similar modal subsystems into larger groups. The subsystems formed from the
groups are then independently reduced. This approach substantially differs from
most of the previously proposed LPV model reduction techniques, since it
performs manipulations on the LPV model and not on a set of linear
time-invariant (LTI) models defined at fixed scheduling parameter values.
Therefore the model interpolation, which is the most challenging part of most
reduction techniques, is avoided. The applicability of the developed algorithm
is thoroughly investigated and demonstrated by numerical case studies.
","[{'version': 'v1', 'created': 'Thu, 22 Sep 2016 12:52:22 GMT'}]",2016-09-23,"[['Luspay', 'T.', ''], ['Peni', 'T.', ''], ['Gozse', 'I.', ''], ['Szabo', 'Z.', ''], ['Vanek', 'B.', '']]","['linear parameter-varying systems', 'model order reduction', 'balanced realization', 'modal transformation', 'clustering']"
15487,1702.07371,Sunil Kumar,"Tanu Srivastava, Raj Shree Singh, Sunil Kumar, Pavan Chakraborty","Feasibility of Principal Component Analysis in hand gesture recognition
  system",conference,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays actions are increasingly being handled in electronic ways, instead
of physical interaction. From earlier times biometrics is used in the
authentication of a person. It recognizes a person by using a human trait
associated with it like eyes (by calculating the distance between the eyes) and
using hand gestures, fingerprint detection, face detection etc. Advantages of
using these traits for identification are that they uniquely identify a person
and cannot be forgotten or lost. These are unique features of a human being
which are being used widely to make the human life simpler. Hand gesture
recognition system is a powerful tool that supports efficient interaction
between the user and the computer. The main moto of hand gesture recognition
research is to create a system which can recognise specific hand gestures and
use them to convey useful information for device control. This paper presents
an experimental study over the feasibility of principal component analysis in
hand gesture recognition system. PCA is a powerful tool for analyzing data. The
primary goal of PCA is dimensionality reduction. Frames are extracted from the
Sheffield KInect Gesture (SKIG) dataset. The implementation is done by creating
a training set and then training the recognizer. It uses Eigen space by
processing the eigenvalues and eigenvectors of the images in training set.
Euclidean distance with the threshold value is used as similarity metric to
recognize the gestures. The experimental results show that PCA is feasible to
be used for hand gesture recognition system.
","[{'version': 'v1', 'created': 'Thu, 23 Feb 2017 19:34:25 GMT'}]",2017-02-27,"[['Srivastava', 'Tanu', ''], ['Singh', 'Raj Shree', ''], ['Kumar', 'Sunil', ''], ['Chakraborty', 'Pavan', '']]","['Hand gesture recognition', 'Eigen values and Eigen vectors', 'Principal Component Analysis (PCA)', 'Human Computer Interaction (HCI)']"
15488,1705.07728,Svyatoslav Covanov,Svyatoslav Covanov (CARAMBA),"Improved method for finding optimal formulae for bilinear maps in a
  finite field",,,,,cs.DS cs.CC cs.DM cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 2012, Barbulescu, Detrey, Estibals and Zimmermann proposed a new framework
to exhaustively search for optimal formulae for evaluating bilinear maps, such
as Strassen or Karatsuba formulae. The main contribution of this work is a new
criterion to aggressively prune useless branches in the exhaustive search, thus
leading to the computation of new optimal formulae, in particular for the short
product modulo X 5 and the circulant product modulo (X 5 -- 1). Moreover , we
are able to prove that there is essentially only one optimal decomposition of
the product of 3 x 2 by 2 x 3 matrices up to the action of some group of
automorphisms.
","[{'version': 'v1', 'created': 'Tue, 9 May 2017 06:20:33 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Nov 2017 13:39:12 GMT'}, {'version': 'v3', 'created': 'Fri, 7 Dec 2018 16:10:46 GMT'}]",2018-12-10,"[['Covanov', 'Svyatoslav', '', 'CARAMBA']]","['bilinear rank', 'optimal formulae', 'polynomial multiplication', 'matrix multiplication', 'finite field arithmetic', 'bilinear map']"
15489,1107.4463,Tao  Ye,"Wenqi Huang, Tao Ye, Duanbing Chen",Bottom-Left Placement Theorem for Rectangle Packing,,,,,cs.DM cs.CG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proves a bottom-left placement theorem for the rectangle packing
problem, stating that if it is possible to orthogonally place n arbitrarily
given rectangles into a rectangular container without overlapping, then we can
achieve a feasible packing by successively placing a rectangle onto a
bottom-left corner in the container. This theorem shows that even for the
real-parameter rectangle packing problem, we can solve it after finite times of
bottom-left placement actions. Based on this theorem, we might develop
efficient heuristic algorithms for solving the rectangle packing problem.
","[{'version': 'v1', 'created': 'Fri, 22 Jul 2011 09:27:23 GMT'}]",2011-07-25,"[['Huang', 'Wenqi', ''], ['Ye', 'Tao', ''], ['Chen', 'Duanbing', '']]","['rectangle packing', 'bottom-left', 'bottom-left placementtheorem', 'NP hard']"
15490,0908.4188,R Doomun,Suman Saha,Consideration Points Detecting Cross-Site Scripting,"8 Pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 4, No. 1 & 2, August 2009, USA",,ISSN 1947 5500,cs.CR cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web application (WA) expands its usages to provide more and more services and
it has become one of the most essential communication channels between service
providers and the users. To augment the users experience many web applications
are using client side scripting languages such as JavaScript but this growing
of JavaScript is increasing serious security vulnerabilities in web application
too, such as cross site scripting (XSS). In this paper, I survey all the
techniques those have been used to detect XSS and arrange a number of analyses
to evaluate performances of those methodologies. This paper points major
difficulties to detect XSS. I do not implement any solution of this
vulnerability problem because my focus is for reviewing this issue. But, I
believe that this assessment will be cooperative for further research on this
concern as this treatise figure out everything on this transcendent security
problem.
","[{'version': 'v1', 'created': 'Fri, 28 Aug 2009 11:01:27 GMT'}]",2009-08-31,"[['Saha', 'Suman', '']]","['cross-site scripting', 'injection attack', 'javascript', 'scripting languages security', 'survey', 'web application security']"
15491,1409.3920,Anup Kumar Das,Anup Kumar Das,The 7 Habits of Highly Effective Research Communicators,"Book Chapter. In Gautam Maity et. al. (Eds.), Charaibeti: Golden
  Jubilee Commemorative Volume (pp. 356-365). Kolkata, India: Department of
  Library and Information Science, Jadavpur University, 2014. ISBN:
  978-81-929886-0-3",,,,cs.DL,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The emergence of Web 2.0 and simultaneously Library 2.0 platforms has helped
the library and information professionals to outreach to new audiences beyond
their physical boundaries. In a globalized society, information becomes very
useful resource for socio-economic empowerment of marginalized communities,
economic prosperity of common citizens, and knowledge enrichment of liberated
minds. Scholarly information becomes both developmental and functional for
researchers working towards advancement of knowledge. We must recognize a relay
of information flow and information ecology while pursuing scholarly research.
Published scholarly literatures we consult that help us in creation of new
knowledge. Similarly, our published scholarly works should be outreached to
future researchers for regeneration of next dimension of knowledge.
Fortunately, present day research communicators have many freely available
personalized digital tools to outreach to globalized research audiences having
similar research interests. These tools and techniques, already adopted by many
researchers in different subject areas across the world, should be
enthusiastically utilized by LIS researchers in South Asia for global
dissemination of their scholarly research works. This newly found enthusiasm
will soon become integral part of the positive habits and cultural practices of
research communicators in LIS domain.
","[{'version': 'v1', 'created': 'Sat, 13 Sep 2014 07:08:21 GMT'}]",2014-09-16,"[['Das', 'Anup Kumar', '']]","['ResearcherID', 'Academic Social Network', 'Social Media', 'Discussion Forum', 'Web 2.0', 'Librarian 2']"
15492,1412.4388,Lidia Dobrescu,"Silviu Stanciu, Lidia Dobrescu","A New System For Recording The Radiological Effective Doses For Patients
  Investigated by Imaging Methods","International Congress Of Radiology ICR 2014, Dubai, United Arab
  Emirates",,,,cs.CE physics.med-ph,http://creativecommons.org/licenses/by/3.0/,"  In this paper the project of an integrated system for radiation safety and
security of the patients investigated by radiological imaging methods is
presented. The new system is based on smart cards and Public Key
Infrastructure. The new system allows radiation effective dose data storage and
a more accurate reporting system.
","[{'version': 'v1', 'created': 'Sun, 14 Dec 2014 18:11:18 GMT'}]",2014-12-16,"[['Stanciu', 'Silviu', ''], ['Dobrescu', 'Lidia', '']]","['radiation safety', 'radiological smart card', 'radiological reports']"
15493,1603.01520,Daniel Rubio Bonilla,"Daniel Rubio Bonilla, Colin W. Glass, Jan Kuper",Optimized Polynomial Evaluation with Semantic Annotations,"Part of the Program Transformation for Programmability in
  Heterogeneous Architectures (PROHA) workshop, Barcelona, Spain, 12th March
  2016, 7 pages, LaTeX, 4 PNG figures",,,,cs.PL cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we discuss how semantic annotations can be used to introduce
mathematical algorithmic information of the underlying imperative code to
enable compilers to produce code transformations that will enable better
performance. By using this approaches not only good performance is achieved,
but also better programmability, maintainability and portability across
different hardware architectures. To exemplify this we will use polynomial
equations of different degrees.
","[{'version': 'v1', 'created': 'Fri, 4 Mar 2016 16:13:24 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Mar 2016 14:17:38 GMT'}, {'version': 'v3', 'created': 'Fri, 11 Mar 2016 11:31:59 GMT'}]",2016-03-14,"[['Bonilla', 'Daniel Rubio', ''], ['Glass', 'Colin W.', ''], ['Kuper', 'Jan', '']]","['programming models', 'polynomial functions', 'code optimization']"
15494,0705.1161,Lillian Lee,Lillian Lee,"IDF revisited: A simple new derivation within the Robertson-Sp\""arck
  Jones probabilistic model","To appear, Proceedings of SIGIR 2007, poster paper (2 pages)",,,,cs.IR cs.CL,,"  There have been a number of prior attempts to theoretically justify the
effectiveness of the inverse document frequency (IDF). Those that take as their
starting point Robertson and Sparck Jones's probabilistic model are based on
strong or complex assumptions. We show that a more intuitively plausible
assumption suffices. Moreover, the new assumption, while conceptually very
simple, provides a solution to an estimation problem that had been deemed
intractable by Robertson and Walker (1997).
","[{'version': 'v1', 'created': 'Tue, 8 May 2007 20:08:13 GMT'}]",2007-05-23,"[['Lee', 'Lillian', '']]","['inverse document frequency', 'IDF', 'probabilisticmodel', 'term weighting']"
15495,1406.5731,Deepa Vijay,Deepa Vijay and Gopinath Ganapathy,Guidelines to minimize cost of software quality in agile scrum process,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a case study of Agile Scrum process followed in Retail
Domain project. This paper also reveals the impacts of Cost of Software
Quality, when agile scrum process is not followed efficiently. While analyzing
the case study, the gaps were found and guidelines for process improvements
were also suggested in this paper.
","[{'version': 'v1', 'created': 'Sun, 22 Jun 2014 14:30:15 GMT'}]",2014-06-24,"[['Vijay', 'Deepa', ''], ['Ganapathy', 'Gopinath', '']]","['Agile', 'Cost of Software Quality', 'Agile Scrum Process Framework & Agile Methodology']"
15496,1402.5131,Hanie Sedghi,Hanie Sedghi and Anima Anandkumar and Edmond Jonckheere,"Multi-Step Stochastic ADMM in High Dimensions: Applications to Sparse
  Optimization and Noisy Matrix Decomposition","appeared in Neural Information Processing Systems(NIPS) 2014. arXiv
  admin note: text overlap with arXiv:1207.4421 by other authors",,,,cs.LG math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an efficient ADMM method with guarantees for high-dimensional
problems. We provide explicit bounds for the sparse optimization problem and
the noisy matrix decomposition problem. For sparse optimization, we establish
that the modified ADMM method has an optimal convergence rate of
$\mathcal{O}(s\log d/T)$, where $s$ is the sparsity level, $d$ is the data
dimension and $T$ is the number of steps. This matches with the minimax lower
bounds for sparse estimation. For matrix decomposition into sparse and low rank
components, we provide the first guarantees for any online method, and prove a
convergence rate of $\tilde{\mathcal{O}}((s+r)\beta^2(p) /T) +
\mathcal{O}(1/p)$ for a $p\times p$ matrix, where $s$ is the sparsity level,
$r$ is the rank and $\Theta(\sqrt{p})\leq \beta(p)\leq \Theta(p)$. Our
guarantees match the minimax lower bound with respect to $s,r$ and $T$. In
addition, we match the minimax lower bound with respect to the matrix dimension
$p$, i.e. $\beta(p)=\Theta(\sqrt{p})$, for many important statistical models
including the independent noise model, the linear Bayesian network and the
latent Gaussian graphical model under some conditions. Our ADMM method is based
on epoch-based annealing and consists of inexpensive steps which involve
projections on to simple norm balls. Experiments show that for both sparse
optimization and matrix decomposition problems, our algorithm outperforms the
state-of-the-art methods. In particular, we reach higher accuracy with same
time complexity.
","[{'version': 'v1', 'created': 'Thu, 20 Feb 2014 20:48:10 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Mar 2014 00:15:42 GMT'}, {'version': 'v3', 'created': 'Wed, 19 Mar 2014 09:42:26 GMT'}, {'version': 'v4', 'created': 'Mon, 16 Jun 2014 03:53:05 GMT'}, {'version': 'v5', 'created': 'Sun, 7 Dec 2014 03:36:03 GMT'}, {'version': 'v6', 'created': 'Tue, 7 Jul 2015 00:13:55 GMT'}]",2015-07-08,"[['Sedghi', 'Hanie', ''], ['Anandkumar', 'Anima', ''], ['Jonckheere', 'Edmond', '']]","['Stochastic ADMM', 'ℓ1 regularization', 'multi block ADMM', 'sparse+low rank decomposition', 'convergence rate', 'high dimensional regime']"
15497,1704.07669,Wenjian Yu Prof.,"Wenjian Yu, Yu Gu, Jian Li, Shenghua Liu, and Yaohang Li",Single-Pass PCA of Large High-Dimensional Data,"IJCAI 2017, 16 pages, 6 figures",,,,cs.DS cs.LG math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Principal component analysis (PCA) is a fundamental dimension reduction tool
in statistics and machine learning. For large and high-dimensional data,
computing the PCA (i.e., the singular vectors corresponding to a number of
dominant singular values of the data matrix) becomes a challenging task. In
this work, a single-pass randomized algorithm is proposed to compute PCA with
only one pass over the data. It is suitable for processing extremely large and
high-dimensional data stored in slow memory (hard disk) or the data generated
in a streaming fashion. Experiments with synthetic and real data validate the
algorithm's accuracy, which has orders of magnitude smaller error than an
existing single-pass algorithm. For a set of high-dimensional data stored as a
150 GB file, the proposed algorithm is able to compute the first 50 principal
components in just 24 minutes on a typical 24-core computer, with less than 1
GB memory cost.
","[{'version': 'v1', 'created': 'Tue, 25 Apr 2017 12:55:20 GMT'}]",2017-04-26,"[['Yu', 'Wenjian', ''], ['Gu', 'Yu', ''], ['Li', 'Jian', ''], ['Liu', 'Shenghua', ''], ['Li', 'Yaohang', '']]","['high-dimensional data', 'principal component analysis (PCA)', 'randomized algorithm', 'single-pass algorithm', 'truncated singular value decomposition (SVD)']"
15498,1206.5313,Mohammed El-Dosuky,"M. A. El-Dosuky, M. Z. Rashad, T. T. Hamza, and A.H. EL-Bassiouny",Go Heuristics for Coverage of Dense Wireless Sensor Networks,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper collects heuristics of Go Game and employs them to achieve
coverage of dense wireless sensor networks. In this paper, we propose an
algorithm based on Go heuristics and validate it. Investigations show that it
is very promising and could be seen as a good optimization. Keywords: Go
Heuristics, Wireless Sensor Networks, Coverage, Density
","[{'version': 'v1', 'created': 'Fri, 22 Jun 2012 20:21:27 GMT'}]",2012-06-26,"[['El-Dosuky', 'M. A.', ''], ['Rashad', 'M. Z.', ''], ['Hamza', 'T. T.', ''], ['EL-Bassiouny', 'A. H.', '']]","['Go Heuristics', 'Wireless Sensor Networks', 'Coverage', 'Density']"
15499,1208.0070,Sashank Dara,Sashank Dara,Confidentiality without Encryption For Cloud Computational Privacy,"3 pages, 2 figures",,,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Advances in technology has given rise to new computing models where any
individual/organization (Cloud Service Consumers here by denoted as CSC's) can
outsource their computational intensive tasks on their data to a remote Cloud
Service Provider (CSP) for many advantages like lower costs, scalability etc.
But such advantages come for a bigger cost ""Security and Privacy of data"" for
this very reason many CSC's are skeptical to move towards cloud computing
models. While the advances in cryptography research are promising, there are no
practical solutions yet for performing any operations on encrypted data [1].
For this very reason there is strong need for finding alternative viable
solutions for us to benefit from Cloud Computing. A technique to provide
confidentiality without encryption was proposed in the past namely ""Chaffing
and Winnowing: Confidentiality without Encryption"" by Ronald L. Rivest [2].
While this technique has been proposed for packet based communication system,
its not adaptable in all cloud service models like Software-as-Service,
Platform-as-Service or Infrastructure-as-Service [3]. In this paper we propose
an adaptation of this technique in a cloud computational setup where CSC's
outsource computational intensive tasks like web log parsing, DNA Sequencing
etc to a MapReduce like CSP service.
","[{'version': 'v1', 'created': 'Wed, 1 Aug 2012 03:05:17 GMT'}]",2012-08-02,"[['Dara', 'Sashank', '']]","['Cloud Computing', 'Data Privacy', 'Chaffing and']"
15500,1704.02708,Richard Nock,"Richard Nock, Frank Nielsen",Evolving a Vector Space with any Generating Set,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Valiant's model of evolution, a class of representations is evolvable iff
a polynomial-time process of random mutations guided by selection converges
with high probability to a representation as $\epsilon$-close as desired from
the optimal one, for any required $\epsilon>0$. Several previous positive
results exist that can be related to evolving a vector space, but each former
result imposes disproportionate representations or restrictions on
(re)initialisations, distributions, performance functions and/or the mutator.
In this paper, we show that all it takes to evolve a normed vector space is
merely a set that generates the space. Furthermore, it takes only
$\tilde{O}(1/\epsilon^2)$ steps and it is essentially stable, agnostic and
handles target drifts that rival some proven in fairly restricted settings. Our
algorithm can be viewed as a close relative to a popular fifty-years old
gradient-free optimization method for which little is still known from the
convergence standpoint: Nelder-Mead simplex method.
","[{'version': 'v1', 'created': 'Mon, 10 Apr 2017 04:41:38 GMT'}, {'version': 'v2', 'created': 'Sun, 31 Dec 2017 21:47:47 GMT'}]",2018-01-03,"[['Nock', 'Richard', ''], ['Nielsen', 'Frank', '']]","['Evolvability', 'vector space', 'Bregman divergence']"
15501,2006.04311,Benedek Rozemberczki,"Benedek Rozemberczki, Oliver Kiss, Rik Sarkar",Little Ball of Fur: A Python Library for Graph Sampling,"Code is available here:
  https://github.com/benedekrozemberczki/littleballoffur",CIKM 2020,,,cs.SI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sampling graphs is an important task in data mining. In this paper, we
describe Little Ball of Fur a Python library that includes more than twenty
graph sampling algorithms. Our goal is to make node, edge, and
exploration-based network sampling techniques accessible to a large number of
professionals, researchers, and students in a single streamlined framework. We
created this framework with a focus on a coherent application public interface
which has a convenient design, generic input data requirements, and reasonable
baseline settings of algorithms. Here we overview these design foundations of
the framework in detail with illustrative code snippets. We show the practical
usability of the library by estimating various global statistics of social
networks and web graphs. Experiments demonstrate that Little Ball of Fur can
speed up node and whole graph embedding techniques considerably with mildly
deteriorating the predictive value of distilled features.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2020 01:35:24 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Aug 2020 08:47:22 GMT'}]",2020-08-12,"[['Rozemberczki', 'Benedek', ''], ['Kiss', 'Oliver', ''], ['Sarkar', 'Rik', '']]","['network sampling', 'graph sampling', 'subsampling', 'network analytics', 'graph mining']"
15502,1606.04160,Richard Nock,"Richard Nock, Giorgio Patrini, Finnian Lattimore, Tiberio Caetano","The Crossover Process: Learnability and Data Protection from Inference
  Attacks",,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is usual to consider data protection and learnability as conflicting
objectives. This is not always the case: we show how to jointly control
inference --- seen as the attack --- and learnability by a noise-free process
that mixes training examples, the Crossover Process (cp). One key point is that
the cp~is typically able to alter joint distributions without touching on
marginals, nor altering the sufficient statistic for the class. In other words,
it saves (and sometimes improves) generalization for supervised learning, but
can alter the relationship between covariates --- and therefore fool measures
of nonlinear independence and causal inference into misleading ad-hoc
conclusions. For example, a cp~can increase / decrease odds ratios, bring
fairness or break fairness, tamper with disparate impact, strengthen, weaken or
reverse causal directions, change observed statistical measures of dependence.
For each of these, we quantify changes brought by a cp, as well as its
statistical impact on generalization abilities via a new complexity measure
that we call the Rademacher cp~complexity. Experiments on a dozen readily
available domains validate the theory.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2016 22:27:36 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Mar 2017 21:41:50 GMT'}]",2017-03-09,"[['Nock', 'Richard', ''], ['Patrini', 'Giorgio', ''], ['Lattimore', 'Finnian', ''], ['Caetano', 'Tiberio', '']]","['Supervised learning', 'Privacy', 'Fairness', 'Statistical inference', 'Causality']"
15503,1002.4182,Gokarna Sharma,"Gokarna Sharma, Brett Estrade and Costas Busch",Window-Based Greedy Contention Management for Transactional Memory,13 pages,,,,cs.DC cs.DS cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider greedy contention managers for transactional memory for M x N
execution windows of transactions with M threads and N transactions per thread.
Assuming that each transaction conflicts with at most C other transactions
inside the window, a trivial greedy contention manager can schedule them within
CN time. In this paper, we show that there are much better schedules. We
present and analyze two new randomized greedy contention management algorithms.
The first algorithm Offline-Greedy produces a schedule of length O(C + N
log(MN)) with high probability, and gives competitive ratio O(log(MN)) for C <=
N log(MN). The offline algorithm depends on knowing the conflict graph. The
second algorithm Online-Greedy produces a schedule of length O(C log(MN) + N
log^2(MN)) with high probability which is only a O(log(NM)) factor worse, but
does not require knowledge of the conflict graph. We also give an adaptive
version which achieves similar worst-case performance and C is determined on
the fly under execution. Our algorithms provide new tradeoffs for greedy
transaction scheduling that parameterize window sizes and transaction conflicts
within the window.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2010 20:02:24 GMT'}]",2010-02-23,"[['Sharma', 'Gokarna', ''], ['Estrade', 'Brett', ''], ['Busch', 'Costas', '']]","['transactional memory', 'contention managers', 'greedy scheduling', 'execution window']"
15504,1602.07556,Vladimir Gusev,"Bal\'azs Gerencs\'er, Vladimir V. Gusev, Rapha\""el M. Jungers",Primitive sets of nonnegative matrices and synchronizing automata,14 pages,,,,cs.FL cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A set of nonnegative matrices $\mathcal{M}=\{M_1, M_2, \ldots, M_k\}$ is
called primitive if there exist indices $i_1, i_2, \ldots, i_m$ such that
$M_{i_1} M_{i_2} \ldots M_{i_m}$ is positive (i.e. has all its entries $>0$).
The length of the shortest such product is called the exponent of
$\mathcal{M}$. The concept of primitive sets of matrices comes up in a number
of problems within control theory, non-homogeneous Markov chains, automata
theory etc. Recently, connections between synchronizing automata and primitive
sets of matrices were established. In the present paper, we significantly
strengthen these links by providing equivalence results, both in terms of
combinatorial characterization, and computational aspects. We study the maximal
exponent among all primitive sets of $n \times n$ matrices, which we denote by
$\exp(n)$. We prove that $\lim_{n\rightarrow\infty} \tfrac{\log \exp(n)}{n} =
\tfrac{\log 3}{3}$, and moreover, we establish that this bound leads to a
resolution of the \v{C}ern\'{y} problem for carefully synchronizing automata.
We also study the set of matrices with no zero rows and columns, denoted by
$\mathcal{NZ}$, due to its intriguing connections to the \v{C}ern\'{y}
conjecture and the recent generalization of Perron-Frobenius theory for this
class. We characterize computational complexity of different problems related
to the exponent of $\mathcal{NZ}$ matrix sets, and present a quadratic bound on
the exponents of sets belonging to a special subclass. Namely, we show that the
exponent of a set of matrices having total support is bounded by $2n^2 -5n +5$.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2016 15:26:19 GMT'}]",2016-02-25,"[['Gerencsér', 'Balázs', ''], ['Gusev', 'Vladimir V.', ''], ['Jungers', 'Raphaël M.', '']]","['Nonnegative matrices', 'primitive sets of matrices', 'the exponent of amatrix set', 'carefully synchronizing automata', 'the Černý conjecture']"
15505,1610.09834,Igor Potapov,Sang-Ki Ko and Igor Potapov,"Matrix Semigroup Freeness Problems in $\mathrm{SL}(2,\mathbb{Z})$",,,,,cs.CC cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we study decidability and complexity of decision problems on
matrices from the special linear group $\mathrm{SL}(2,\mathbb{Z})$. In
particular, we study the freeness problem: given a finite set of matrices $G$
generating a multiplicative semigroup $S$, decide whether each element of $S$
has at most one factorization over $G$. In other words, is $G$ a code? We show
that the problem of deciding whether a matrix semigroup in
$\mathrm{SL}(2,\mathbb{Z})$ is non-free is NP-hard. Then, we study questions
about the number of factorizations of matrices in the matrix semigroup such as
the finite freeness problem, the recurrent matrix problem, the unique
factorizability problem, etc. Finally, we show that some factorization problems
could be even harder in $\mathrm{SL}(2,\mathbb{Z})$, for example we show that
to decide whether every prime matrix has at most $k$ factorizations is
PSPACE-hard.
","[{'version': 'v1', 'created': 'Mon, 31 Oct 2016 09:06:53 GMT'}]",2016-11-01,"[['Ko', 'Sang-Ki', ''], ['Potapov', 'Igor', '']]","['matrix semigroups', 'freeness', 'decision problems', 'decidability', 'computational complexity']"
15506,1107.4553,Thierry Boy de la Tour,"Thierry Boy de la Tour, Mnacho Echenim",Solving Linear Constraints in Elementary Abelian p-Groups of Symmetries,18 pages,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Symmetries occur naturally in CSP or SAT problems and are not very difficult
to discover, but using them to prune the search space tends to be very
challenging. Indeed, this usually requires finding specific elements in a group
of symmetries that can be huge, and the problem of their very existence is
NP-hard. We formulate such an existence problem as a constraint problem on one
variable (the symmetry to be used) ranging over a group, and try to find
restrictions that may be solved in polynomial time. By considering a simple
form of constraints (restricted by a cardinality k) and the class of groups
that have the structure of Fp-vector spaces, we propose a partial algorithm
based on linear algebra. This polynomial algorithm always applies when k=p=2,
but may fail otherwise as we prove the problem to be NP-hard for all other
values of k and p. Experiments show that this approach though restricted should
allow for an efficient use of at least some groups of symmetries. We conclude
with a few directions to be explored to efficiently solve this problem on the
general case.
","[{'version': 'v1', 'created': 'Fri, 22 Jul 2011 15:52:26 GMT'}]",2011-07-25,"[['de la Tour', 'Thierry Boy', ''], ['Echenim', 'Mnacho', '']]","['symmetries', 'linear algebra', 'complexity']"
15507,1002.1166,Vishal Goyal,"T.R. GopalaKrishnan nair, P. Jayarekha","A Strategy to enable Prefix of Multicast VoD through dynamic buffer
  allocation","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 2, January 2010,
  http://ijcsi.org/articles/A-Strategy-to-enable-Prefix-of-Multicast-VoD-through-dynamic-buffer-allocation.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 2, January 2010,
  http://ijcsi.org/articles/A-Strategy-to-enable-Prefix-of-Multicast-VoD-through-dynamic-buffer-allocation.php",,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we have proposed a dynamic buffer allocation algorithm for the
prefix, based on the popularity of the videos. More cache blocks are allocated
for most popular videos and a few cache blocks are allocated for less popular
videos. Buffer utilization is also maximized irrespective of the load on the
Video-on-Demand system. Overload can lead the server getting slowed down. By
storing the first few seconds of popular video clips, a multimedia local server
can shield the users from the delay, throughput, and loss properties of the
path between the local server and the central server. The key idea of
controlled multicast is used to allow clients to share a segment of a video
stream even when the requests arrive at different times. This dynamic buffer
allocation algorithm is simulated and its performance is evaluated based on the
buffer utilization by multimedia servers and average buffer allocation for the
most popular videos. Our simulation results shows efficient utilization of
network bandwidth and reduced hard disk utilization hence resulting in increase
in the number of requests being served.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 09:27:01 GMT'}]",2010-02-08,"[['nair', 'T. R. GopalaKrishnan', ''], ['Jayarekha', 'P.', '']]","['Multicast transmission', 'Interval caching', 'prefix caching', 'Dynamic buffer Allocation']"
15508,0910.2115,Pedro Peris-Lopez,"Pedro Peris-Lopez, Julio C. Hernandez-Castro, J. M. E. Tapiador and
  Jan C. A. van der Lubbe",Security Flaws in a Recent Ultralightweight RFID Protocol,"14 pages, 2 figures and 1 table",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 2006, Peris-Lopez et al. [1, 2, 3] initiated the design of
ultralightweight RFID protocols -with the UMAP family of protocols- involving
only simple bitwise logical or arithmetic operations such as bitwise XOR, OR,
AND, and addition. This combination of operations was revealed later to be
insufficient for security. Then, Chien et al. proposed the SASI protocol [4]
with the aim of offering better security, by adding the bitwise rotation to the
set of supported operations. The SASI protocol represented a milestone in the
design of ultralightweight protocols, although certain attacks have been
published against this scheme [5, 6, 7]. In 2008, a new protocol, named
Gossamer [8], was proposed that can be considered a further development of both
the UMAP family and SASI. Although no attacks have been published against
Gossamer, Lee et al. [9] have recently published an alternative scheme that is
highly reminiscent of SASI. In this paper, we show that Lee et al.'s scheme
fails short of many of its security objectives, being vulnerable to several
important attacks like traceability, full disclosure, cloning and
desynchronization.
","[{'version': 'v1', 'created': 'Mon, 12 Oct 2009 09:34:17 GMT'}]",2009-10-13,"[['Peris-Lopez', 'Pedro', ''], ['Hernandez-Castro', 'Julio C.', ''], ['Tapiador', 'J. M. E.', ''], ['van der Lubbe', 'Jan C. A.', '']]","['RFID', 'Authentication', 'Ultralightweight protocols', 'Cryptanalysis']"
15509,1307.1719,Jason Dagit,Jason Dagit and Matthew Sottile,Identifying change patterns in software history,"7 pages, submitted to document changes 2013",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional algorithms for detecting differences in source code focus on
differences between lines. As such, little can be learned about abstract
changes that occur over time within a project. Structural differencing on the
program's abstract syntax tree reveals changes at the syntactic level within
code, which allows us to further process the differences to understand their
meaning. We propose that grouping of changes by some metric of similarity,
followed by pattern extraction via antiunification will allow us to identify
patterns of change within a software project from the sequence of changes
contained within a Version Control System (VCS). Tree similarity metrics such
as a tree edit distance can be used to group changes in order to identify
groupings that may represent a single class of change (e.g., adding a parameter
to a function call). By applying antiunification within each group we are able
to generalize from families of concrete changes to patterns of structural
change. Studying patterns of change at the structural level, instead of
line-by-line, allows us to gain insight into the evolution of software.
","[{'version': 'v1', 'created': 'Fri, 5 Jul 2013 21:07:04 GMT'}]",2013-07-09,"[['Dagit', 'Jason', ''], ['Sottile', 'Matthew', '']]","['version control', 'structural differencing', 'antiunification', 'software evolution']"
15510,1407.7937,Ruta Mehta,"Maria-Florina Balcan, Amit Daniely, Ruta Mehta, Ruth Urner, and Vijay
  V. Vazirani",Learning Economic Parameters from Revealed Preferences,,,,,cs.GT cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A recent line of work, starting with Beigman and Vohra (2006) and
Zadimoghaddam and Roth (2012), has addressed the problem of {\em learning} a
utility function from revealed preference data. The goal here is to make use of
past data describing the purchases of a utility maximizing agent when faced
with certain prices and budget constraints in order to produce a hypothesis
function that can accurately forecast the {\em future} behavior of the agent.
  In this work we advance this line of work by providing sample complexity
guarantees and efficient algorithms for a number of important classes. By
drawing a connection to recent advances in multi-class learning, we provide a
computationally efficient algorithm with tight sample complexity guarantees
($\Theta(d/\epsilon)$ for the case of $d$ goods) for learning linear utility
functions under a linear price model. This solves an open question in
Zadimoghaddam and Roth (2012). Our technique yields numerous generalizations
including the ability to learn other well-studied classes of utility functions,
to deal with a misspecified model, and with non-linear prices.
","[{'version': 'v1', 'created': 'Wed, 30 Jul 2014 04:00:29 GMT'}]",2014-07-31,"[['Balcan', 'Maria-Florina', ''], ['Daniely', 'Amit', ''], ['Mehta', 'Ruta', ''], ['Urner', 'Ruth', ''], ['Vazirani', 'Vijay V.', '']]","['revealed preference', 'statistical learning', 'query learning', 'efficient algorithms', 'Linear', 'SPLC', 'CES', 'Leontief utility functions']"
15511,1505.05175,\v{Z}eljka Stojanac,Holger Rauhut and \v{Z}eljka Stojanac,Tensor theta norms and low rank recovery,"35 pages, 6 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study extensions of compressive sensing and low rank matrix recovery to
the recovery of low rank tensors from incomplete linear information. While the
reconstruction of low rank matrices via nuclear norm minimization is rather
well-understand by now, almost no theory is available for the extension to
higher order tensors due to various theoretical and computational difficulties
arising for tensor decompositions. In fact, nuclear norm minimization for
matrix recovery is a tractable convex relaxation approach, but the extension of
the nuclear norm to tensors is in general NP-hard to compute. In this article,
we introduce convex relaxations of the tensor nuclear norm which are computable
in polynomial time via semidefinite programming. Our approach is based on theta
bodies, a concept from computational algebraic geometry similar to the Lasserre
relaxations. We introduce polynomial ideals which are generated by the second
order minors corresponding to different matricizations of the tensor (where the
tensor entries are treated as variables) such that the nuclear norm ball is the
convex hull of the algebraic variety of the ideal. The $k$-th theta body for
such an ideal generates a new norm which we call the $\theta_k$-norm. We show
that in the matrix case, these norms reduce to the nuclear norm. For tensors of
order $d \geq 3$ however, we obtain new norms. The sequence of the
corresponding unit-$\theta_k$-norm balls converges asymptotically to the unit
tensor nuclear norm ball. By providing the Gr\""obner basis for the ideals, we
explicitly give semidefinite programs for the computation of the
$\theta_k$-norm and for the minimization of the $\theta_k$-norm under an affine
constraint. Numerical experiments for order-3 tensor recovery via
$\theta_1$-norm minimization suggest that our approach successfully
reconstructs tensors of low rank from incomplete linear (random) measurements.
","[{'version': 'v1', 'created': 'Tue, 19 May 2015 20:26:31 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Feb 2017 22:56:40 GMT'}]",2017-02-16,"[['Rauhut', 'Holger', ''], ['Stojanac', 'Željka', '']]","['low rank tensor recovery', 'tensor nuclear norm', 'theta bodies', 'compressivesensing', 'semidefinite programming', 'convex relaxation', 'polynomial ideals', 'Gr¨obnerbases']"
15512,1106.5149,Francesco Sica,"Peter Birkner, Patrick Longa and Francesco Sica",Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication,"23 pages, 3 figures. Changes from v3: corrected typo in proof of
  Lemma 5",,,,cs.CR math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The GLV method of Gallant, Lambert and Vanstone (CRYPTO 2001) computes any
multiple $kP$ of a point $P$ of prime order $n$ lying on an elliptic curve with
a low-degree endomorphism $\Phi$ (called GLV curve) over $\mathbb{F}_p$ as [kP
= k_1P + k_2\Phi(P), \quad\text{with} \max{|k_1|,|k_2|}\leq C_1\sqrt n] for
some explicit constant $C_1>0$. Recently, Galbraith, Lin and Scott (EUROCRYPT
2009) extended this method to all curves over $\mathbb{F}_{p^2}$ which are
twists of curves defined over $\mathbb{F}_p$. We show in this work how to merge
the two approaches in order to get, for twists of any GLV curve over
$\mathbb{F}_{p^2}$, a four-dimensional decomposition together with fast
endomorphisms $\Phi, \Psi$ over $\mathbb{F}_{p^2}$ acting on the group
generated by a point $P$ of prime order $n$, resulting in a proved
decomposition for any scalar $k\in[1,n]$ $$ kP=k_1P+ k_2\Phi(P)+ k_3\Psi(P) +
k_4\Psi\Phi(P)\quad \text{with} \max_i (|k_i|)< C_2\, n^{1/4} $$ for some
explicit $C_2>0$. Furthermore, taking the best $C_1, C_2$, we get
$C_2/C_1<408$, independently of the curve, ensuring a constant relative
speedup. We also derive new families of GLV curves, corresponding to those
curves with degree 3 endomorphisms.
","[{'version': 'v1', 'created': 'Sat, 25 Jun 2011 17:01:52 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Nov 2011 17:55:42 GMT'}, {'version': 'v3', 'created': 'Wed, 9 Nov 2011 14:07:42 GMT'}, {'version': 'v4', 'created': 'Wed, 16 Nov 2011 18:21:54 GMT'}]",2011-11-17,"[['Birkner', 'Peter', ''], ['Longa', 'Patrick', ''], ['Sica', 'Francesco', '']]","['Elliptic curves', 'GLV method', 'Scalar Multiplication']"
15513,1108.1434,A S N Chakravarthy ASN CHAKRAVARTHY,"ASN Chakravarthy, P S Avadhani, P. E. S. N Krishna Prasad,
  N.Rajeevand, D.Rajasekhar Reddy","A Novel Approach for Authenticating Textual or Graphical Passwords Using
  Hopfield Neural Network","14 pages, 18 figures, published in Advanced Computing: An
  International Journal (ACIJ)","Advanced Computing: An International Journal ( ACIJ ), Vol.2,
  No.4, July 2011",,,cs.CR cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Password authentication using Hopfield Networks is presented in this paper.
In this paper we discussed the Hopfield Network Scheme for Textual and
graphical passwords, for which input Password will be converted in to
probabilistic values. We observed how to get password authentication using
Probabilistic values for Textual passwords and Graphical passwords. This study
proposes the use of a Hopfield neural network technique for password
authentication. In comparison to existing layered neural network techniques,
the proposed method provides better accuracy and quicker response time to
registration and password changes.
","[{'version': 'v1', 'created': 'Sat, 6 Aug 2011 00:54:32 GMT'}]",2012-07-07,"[['Chakravarthy', 'ASN', ''], ['Avadhani', 'P S', ''], ['Prasad', 'P. E. S. N Krishna', ''], ['Rajeevand', 'N.', ''], ['Reddy', 'D. Rajasekhar', '']]","['Password', 'Authentication', 'Hopfield model', 'Textual password', 'Graphical password']"
15514,1702.01226,Mengchen Liu,"Shixia Liu, Xiting Wang, Mengchen Liu, Jun Zhu","Towards Better Analysis of Machine Learning Models: A Visual Analytics
  Perspective",This article will be published in Visual Infomatics,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interactive model analysis, the process of understanding, diagnosing, and
refining a machine learning model with the help of interactive visualization,
is very important for users to efficiently solve real-world artificial
intelligence and data mining problems. Dramatic advances in big data analytics
has led to a wide variety of interactive model analysis tasks. In this paper,
we present a comprehensive analysis and interpretation of this rapidly
developing area. Specifically, we classify the relevant work into three
categories: understanding, diagnosis, and refinement. Each category is
exemplified by recent influential work. Possible future research opportunities
are also explored and discussed.
","[{'version': 'v1', 'created': 'Sat, 4 Feb 2017 02:23:55 GMT'}]",2017-02-07,"[['Liu', 'Shixia', ''], ['Wang', 'Xiting', ''], ['Liu', 'Mengchen', ''], ['Zhu', 'Jun', '']]","['interactive model analysis', 'interactive visualization', 'machine']"
15515,1704.05409,Giorgio Roffo,Giorgio Roffo and Simone Melzi,"Ranking to Learn: Feature Ranking and Selection via Eigenvector
  Centrality",Preprint version - Lecture Notes in Computer Science - Springer 2017,"New Frontiers in Mining Complex Patterns, Fifth International
  workshop, nfMCP2016. Lecture Notes in Computer Science - Springer",,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In an era where accumulating data is easy and storing it inexpensive, feature
selection plays a central role in helping to reduce the high-dimensionality of
huge amounts of otherwise meaningless data. In this paper, we propose a
graph-based method for feature selection that ranks features by identifying the
most important ones into arbitrary set of cues. Mapping the problem on an
affinity graph-where features are the nodes-the solution is given by assessing
the importance of nodes through some indicators of centrality, in particular,
the Eigen-vector Centrality (EC). The gist of EC is to estimate the importance
of a feature as a function of the importance of its neighbors. Ranking central
nodes individuates candidate features, which turn out to be effective from a
classification point of view, as proved by a thoroughly experimental section.
Our approach has been tested on 7 diverse datasets from recent literature
(e.g., biological data and object recognition, among others), and compared
against filter, embedded and wrappers methods. The results are remarkable in
terms of accuracy, stability and low execution time.
","[{'version': 'v1', 'created': 'Tue, 18 Apr 2017 16:21:05 GMT'}]",2017-04-19,"[['Roffo', 'Giorgio', ''], ['Melzi', 'Simone', '']]","['Feature Selection', 'Ranking', 'High Dimensionality', 'Data Mining']"
15516,1506.04129,Igor Korkin,Igor Korkin and Ivan Nesterov,Applying Memory Forensics to Rootkit Detection,"25 pages, 3 figures, 8 tables. Paper presented at the Proceedings of
  the 9th annual Conference on Digital Forensics, Security and Law (CDFSL),
  115-141, Richmond, VA, USA. (2014, May 28-29)",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Volatile memory dump and its analysis is an essential part of digital
forensics. Among a number of various software and hardware approaches for
memory dumping there are authors who point out that some of these approaches
are not resilient to various anti-forensic techniques, and others that require
a reboot or are highly platform dependent. New resilient tools have certain
disadvantages such as low speed or vulnerability to rootkits which directly
manipulate kernel structures e.g. page tables. A new memory forensic system -
Malware Analysis System for Hidden Knotty Anomalies (MASHKA) is described in
this paper. It is resilient to popular anti-forensic techniques. The system can
be used for doing a wide range of memory forensics tasks. This paper describes
how to apply the system for research and detection of kernel mode rootkits and
also presents analysis of the most popular anti-rootkit tools.
","[{'version': 'v1', 'created': 'Fri, 12 Jun 2015 19:45:55 GMT'}]",2015-06-15,"[['Korkin', 'Igor', ''], ['Nesterov', 'Ivan', '']]","['Digital forensics', 'Virtual memory acquisition', 'Malware research', 'Rootkits detection', 'Anti']"
15517,1701.06429,Swakkhar Shatabda,"Al Amin Neaz Ahmed, H.M Fazlul Haque, Abdur Rahman, Md Susam Ashraf,
  Sanjay Saha and Swakkhar Shatabda","A Participatory Sensing Framework for Environment Pollution Monitoring
  and Management",,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Effective monitoring and management of environment pollution is key to the
development of modern metropolitan cities. To sustain and to cope with the
exponential growth of the cities with high industrialization, expert decision
making is very essential in this process. A good governance system must be
supported by an actively participating population. In participatory sensing,
individuals and groups engages in the data collection actively and the helps
the city governance to make proper decisions. In this paper, we propose a
participatory sensing based three-tier framework to fight environment pollution
in urban areas of Bangladesh. The framework includes an android application
named `My City, My Environment', a server for storage and computation and also
a web server for the authority to monitor and maintain environmental issues
through expert decision making. We have already developed a prototype system
and deployed it to a small scale and demonstrated the effectiveness of this
framework.
","[{'version': 'v1', 'created': 'Sun, 1 Jan 2017 09:22:55 GMT'}]",2017-01-24,"[['Ahmed', 'Al Amin Neaz', ''], ['Haque', 'H. M Fazlul', ''], ['Rahman', 'Abdur', ''], ['Ashraf', 'Md Susam', ''], ['Saha', 'Sanjay', ''], ['Shatabda', 'Swakkhar', '']]","['Environment Pollution', 'Participatory Sensing', 'Smart Phones']"
15518,1209.1246,Luis Sanabria-Russo,"Luis Sanabria-Russo, Jaume Barcelo, Albert Domingo, Boris Bellalta",Spectrum Sensing with USRP-E110,"5th International Workshop on Multiple Access Communications,
  11/2012, Dublin, Ireland, (2012)",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spectrum sensing is one of the key topics towards the implementation of
future wireless services like SuperWiFi. This new wireless proposal aims at
using the freed spectrum resulting from the analog-to-digital transition of TV
channels for wireless data transmission (UHF TV White Spaces). The benefits
range from better building penetration to longer distances when compared to the
set of IEEE 802.11 standards. Nevertheless, the effective use of the available
spectrum is subject to strict regulation that prohibits unlicensed users to
interfere with incumbents (like wireless microphones). Cognitive Radios (CR)
and dynamic spectrum allocation are suggested to cope with this problem. These
techniques consist on frequency sweeps of the TV-UHF band to detect White
Spaces that could be used for SuperWiFi transmissions. In this paper we develop
and implement algorithms from GNURadio in the Ettus USRP-E110 to build a
standalone White Spaces detector that can be consulted from a centralized
location via IP networks.
","[{'version': 'v1', 'created': 'Thu, 6 Sep 2012 10:03:59 GMT'}]",2012-09-07,"[['Sanabria-Russo', 'Luis', ''], ['Barcelo', 'Jaume', ''], ['Domingo', 'Albert', ''], ['Bellalta', 'Boris', '']]","['USRP', 'GNURadio', 'Spectrum Sensing', 'TV White Spaces', 'Energy detection']"
15519,1110.1930,Ryuhei Mori,Ryuhei Mori and Toshiyuki Tanaka,"Statistical Mechanical Analysis of Low-Density Parity-Check Codes on
  General Markov Channel","6 pages, 1 figure. Submitted to SITA2011, which is a domestic
  conference in Japan",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Low-density parity-check (LDPC) codes on symmetric memoryless channels have
been analyzed using statistical physics by several authors. In this paper,
statistical mechanical analysis of LDPC codes is performed for asymmetric
memoryless channels and general Markov channels. It is shown that the saddle
point equations of the replica symmetric solution for a Markov channel is
equivalent to the density evolution of the belief propagation on the factor
graph representing LDPC codes on the Markov channel. The derivation uses the
method of types for Markov chain.
","[{'version': 'v1', 'created': 'Mon, 10 Oct 2011 05:29:18 GMT'}]",2011-10-11,"[['Mori', 'Ryuhei', ''], ['Tanaka', 'Toshiyuki', '']]","['Low-density parity-check codes', 'Markov channel', 'replica method', 'method of types', 'large deviations']"
15520,1108.1301,Yao Sun,"Yao Sun, Dingkang Wang","Solving Detachability Problem for the Polynomial Ring by Signature-based
  Groebner Basis Algorithms",,,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Signature-based algorithms are a popular kind of algorithms for computing
Groebner basis, including the famous F5 algorithm, F5C, extended F5, G2V and
the GVW algorithm. In this paper, an efficient method is proposed to solve the
detachability problem. The new method only uses the outputs of signature-based
algorithms, and no extra Groebner basis computations are needed. When a
Groebner basis is obtained by signature-based algorithms, the detachability
problem can be settled in polynomial time.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2011 11:09:40 GMT'}]",2011-08-08,"[['Sun', 'Yao', ''], ['Wang', 'Dingkang', '']]","['Detachability problem', 'Gr¨obner basis', 'signature-based algorithm', 'F5', 'GVW', 'syzygy']"
15521,0906.4125,Mauro Cherubini,Mauro Cherubini and Nuria Oliver,A Refined Experience Sampling Method to Capture Mobile User Experience,"Cherubini, M., and Oliver, N. A refined experience sampling method to
  capture mobile user experience. In Presented at the International Workshop of
  Mobile User Experience Research part of CHI'2009 (Boston, MA, USA, April 4-9
  2009), Y. Nakhimovsky, D. Eckles, and J. Riegelsberger, Eds. 12 pages, 5
  figures",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper reviews research methods used to understand the user experience of
mobile technology. The paper presents an improvement of the Experience Sampling
Method and case studies supporting its design. The paper concludes with an
agenda of future work for improving research in this field.
  Keywords: Research methods, topology, case study, contrasting graph,
Experience Sampling Method
","[{'version': 'v1', 'created': 'Mon, 22 Jun 2009 20:31:45 GMT'}]",2009-06-24,"[['Cherubini', 'Mauro', ''], ['Oliver', 'Nuria', '']]","['Research methods', 'topology', 'case']"
15522,1008.0968,Fr\'ed\'erique Oggier,Frederique Oggier and Miodrag J. Mihaljevic,"An Information-Theoretic Analysis of the Security of Communication
  Systems Employing the Encoding-Encryption Paradigm",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a generic approach for providing enhanced security to
communication systems which encode their data for reliability before encrypting
it through a stream cipher for security. We call this counter-intuitive
technique the {\em encoding-encryption} paradigm, and use as motivating example
the standard for mobile telephony GSM. The enhanced security is based on a
dedicated homophonic or wire-tap channel coding that introduces pure
randomness, combined with the randomness of the noise occurring over the
communication channel. Security evaluation regarding recovery of the secret key
employed in the keystream generator is done through an information theoretical
approach. We show that with the aid of a dedicated wire-tap encoder, the amount
of uncertainty that the adversary must face about the secret key given all the
information he could gather during different passive or active attacks he can
mount, is a decreasing function of the sample available for cryptanalysis. This
means that the wire-tap encoder can indeed provide an information theoretical
security level over a period of time, but after a large enough sample is
collected the function tends to zero, entering a regime in which a
computational security analysis is needed for estimation of the resistance
against the secret key recovery.
","[{'version': 'v1', 'created': 'Thu, 5 Aug 2010 13:29:28 GMT'}]",2010-08-06,"[['Oggier', 'Frederique', ''], ['Mihaljevic', 'Miodrag J.', '']]","['error-correction coding', 'security evaluation', 'stream ciphers', 'randomness', 'wireless communications', 'homophonic coding', 'wire-tap channel coding']"
15523,1606.03369,Thiago Vallin Spina PhD,Thiago Vallin Spina and Alexandre Xavier Falc\~ao,"FOMTrace: Interactive Video Segmentation By Image Graphs and Fuzzy
  Object Models",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Common users have changed from mere consumers to active producers of
multimedia data content. Video editing plays an important role in this
scenario, calling for simple segmentation tools that can handle fast-moving and
deformable video objects with possible occlusions, color similarities with the
background, among other challenges. We present an interactive video
segmentation method, named FOMTrace, which addresses the problem in an
effective and efficient way. From a user-provided object mask in a first frame,
the method performs semi-automatic video segmentation on a spatiotemporal
superpixel-graph, and then estimates a Fuzzy Object Model (FOM), which refines
segmentation of the second frame by constraining delineation on a pixel-graph
within a region where the object's boundary is expected to be. The user can
correct/accept the refined object mask in the second frame, which is then
similarly used to improve the spatiotemporal video segmentation of the
remaining frames. Both steps are repeated alternately, within interactive
response times, until the segmentation refinement of the final frame is
accepted by the user. Extensive experiments demonstrate FOMTrace's ability for
tracing objects in comparison with state-of-the-art approaches for interactive
video segmentation, supervised, and unsupervised object tracking.
","[{'version': 'v1', 'created': 'Fri, 10 Jun 2016 15:30:30 GMT'}]",2016-06-13,"[['Spina', 'Thiago Vallin', ''], ['Falcão', 'Alexandre Xavier', '']]","['InteractiveGraph-BasedVideoSegmentation', 'Superpixel-Graphs', 'FuzzyObjectModels', 'ImageForestingTransform', 'Video Editing']"
15524,1610.08911,Hung Pham,"Hung Pham, Tam Nguyen, Phong Vu, Tung Nguyen",Toward Mining Visual Log of Software,"4 pages, 2 figures, short paper new idea",,,,cs.SE cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we define visual log of a software system as data capturing
the interactions between its users and its graphic user interface (GUI), such
as screen-shots and screen recordings. We vision that mining such visual log
could be useful for bug reproducing and debugging, automated GUI testing, user
interface designing, question answering of common usages in software support,
etc. Toward that vision, we propose a core framework for mining visual log of
software. This framework focuses on detecting GUI elements and changes in
visual log, removing users' private data, recognizing user interactions with
GUI elements, and learning GUI usage patterns. We also performed a small study
on the characteristics of GUI elements in mobile apps. The findings from this
study suggested several heuristics to design techniques for recognizing GUI
elements and interactions.
","[{'version': 'v1', 'created': 'Thu, 27 Oct 2016 18:13:54 GMT'}]",2016-10-28,"[['Pham', 'Hung', ''], ['Nguyen', 'Tam', ''], ['Vu', 'Phong', ''], ['Nguyen', 'Tung', '']]","['GUI', 'Visual Log', 'Reverse Engineering', 'User Interaction Recognition']"
15525,1802.06360,Raghav Chalapathy,"Raghavendra Chalapathy (University of Sydney and Capital Markets
  Cooperative Research Centre (CMCRC)), Aditya Krishna Menon (Data61/CSIRO and
  the Australian National University), Sanjay Chawla (Qatar Computing Research
  Institute (QCRI), HBKU)",Anomaly Detection using One-Class Neural Networks,,,,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a one-class neural network (OC-NN) model to detect anomalies in
complex data sets. OC-NN combines the ability of deep networks to extract a
progressively rich representation of data with the one-class objective of
creating a tight envelope around normal data. The OC-NN approach breaks new
ground for the following crucial reason: data representation in the hidden
layer is driven by the OC-NN objective and is thus customized for anomaly
detection. This is a departure from other approaches which use a hybrid
approach of learning deep features using an autoencoder and then feeding the
features into a separate anomaly detection method like one-class SVM (OC-SVM).
The hybrid OC-SVM approach is sub-optimal because it is unable to influence
representational learning in the hidden layers. A comprehensive set of
experiments demonstrate that on complex data sets (like CIFAR and GTSRB), OC-NN
performs on par with state-of-the-art methods and outperformed conventional
shallow methods in some scenarios.
","[{'version': 'v1', 'created': 'Sun, 18 Feb 2018 10:44:53 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Jan 2019 00:05:05 GMT'}]",2019-01-14,"[['Chalapathy', 'Raghavendra', '', 'University of Sydney and Capital Markets\n  Cooperative Research Centre'], ['Menon', 'Aditya Krishna', '', 'Data61/CSIRO and\n  the Australian National University'], ['Chawla', 'Sanjay', '', 'Qatar Computing Research\n  Institute']]","['one class svm', 'anomalies detection', 'outlier detection', 'deep learning']"
15526,1305.1666,Boudjemaa Boudaa,Boudjemaa Boudaa,Vers une Substitution des Services Web sans Inconsistance S\'emantique,"12 pages, in French",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to ensure high availability of Web services, recently, a new
approach was proposed based on the use of communities. In composition, this
approach consists in replacing the failed Web service by another web service
joining a community offering the same functionality of the service failed.
However, this substitution may cause inconsistency in the semantic composition
and alter its mediation initially taken to resolve the semantic heterogeneities
between Web services. This paper presents a context oriented solution to this
problem by forcing the community to adopt the semantic of the failed web
service before the substitution in which all inputs and outputs to/from the
latter must be converted according to this adopted semantic, avoiding any
alteration of a semantic mediation in web service composition.
","[{'version': 'v1', 'created': 'Tue, 7 May 2013 22:11:38 GMT'}]",2013-05-09,"[['Boudaa', 'Boudjemaa', '']]","['Failed Web Service', 'Substitution', 'Community', 'High-Availability', 'Context', 'Semantic Mediation']"
15527,1712.05517,Takeyuki Tamura,"Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, Takeyuki
  Tamura",New and Improved Algorithms for Unordered Tree Inclusion,"22 pages, 9 figures. To appear in Theoretical Computer Science",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The tree inclusion problem is, given two node-labeled trees $P$ and $T$ (the
``pattern tree'' and the ``target tree''), to locate every minimal subtree in
$T$ (if any) that can be obtained by applying a sequence of node insertion
operations to $P$. Although the ordered tree inclusion problem is solvable in
polynomial time, the unordered tree inclusion problem is NP-hard. The currently
fastest algorithm for the latter is a classic algorithm by Kilpel\""{a}inen and
Mannila from 1995 that runs in $O(2^{2d} mn)$ time, where $m$ and $n$ are the
sizes of the pattern and target trees, respectively, and $d$ is the degree of
the pattern tree. Here, we develop a new algorithm that runs in $O(2^{d} mn^2)$
time, improving the exponential factor from $2^{2d}$ to $2^d$ by considering a
particular type of ancestor-descendant relationships that is suitable for
dynamic programming. We also study restricted variants of the unordered tree
inclusion problem.
","[{'version': 'v1', 'created': 'Fri, 15 Dec 2017 03:15:35 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Jun 2021 03:58:09 GMT'}]",2021-06-16,"[['Akutsu', 'Tatsuya', ''], ['Jansson', 'Jesper', ''], ['Li', 'Ruiming', ''], ['Takasu', 'Atsuhiro', ''], ['Tamura', 'Takeyuki', '']]","['tree inclusion', 'unordered trees', 'parameterized algorithms', 'dynamic programming']"
15528,1704.06018,Erkan Bostanci,"Erkan Bostanci and Nadia Kanwal and Betul Bostanci and Mehmet Serdar
  Guzel",A Fuzzy Brute Force Matching Method for Binary Image Features,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Matching of binary image features is an important step in many different
computer vision applications. Conventionally, an arbitrary threshold is used to
identify a correct match from incorrect matches using Hamming distance which
may improve or degrade the matching results for different input images. This is
mainly due to the image content which is affected by the scene, lighting and
imaging conditions. This paper presents a fuzzy logic based approach for brute
force matching of image features to overcome this situation. The method was
tested using a well-known image database with known ground truth. The approach
is shown to produce a higher number of correct matches when compared against
constant distance thresholds. The nature of fuzzy logic which allows the
vagueness of information and tolerance to errors has been successfully
exploited in an image processing context. The uncertainty arising from the
imaging conditions has been overcome with the use of compact fuzzy matching
membership functions.
","[{'version': 'v1', 'created': 'Thu, 20 Apr 2017 05:29:06 GMT'}]",2017-04-21,"[['Bostanci', 'Erkan', ''], ['Kanwal', 'Nadia', ''], ['Bostanci', 'Betul', ''], ['Guzel', 'Mehmet Serdar', '']]","['fuzzy matching', 'Hamming distance', 'image features']"
15529,1410.6505,Levon Haykazyan,Levon Haykazyan,"Decidability of the Clark's Completion Semantics for Monadic Programs
  and Queries",,"Theory and Practice of Logic Programming, 15 (3): 402-412, 2015",,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are many different semantics for general logic programs (i.e. programs
that use negation in the bodies of clauses). Most of these semantics are Turing
complete (in a sense that can be made precise), implying that they are
undecidable. To obtain decidability one needs to put additional restrictions on
programs and queries. In logic programming it is natural to put restrictions on
the underlying first-order language. In this note we show the decidability of
the Clark's completion semantics for monadic general programs and queries.
  To appear in Theory and Practice of Logic Programming (TPLP)
","[{'version': 'v1', 'created': 'Thu, 23 Oct 2014 21:06:06 GMT'}]",2015-07-15,"[['Haykazyan', 'Levon', '']]","['monadic programs', 'general programs', 'Clark’s completion', 'decidability']"
15530,1603.06241,Guillaume Maquart,T. Maquart and G. Maquart,"Homemade assembly and parameterization of a High Performance Cluster
  using PelicanHPC with Flops testing and controlled temperature thanks to MCUs
  Arduino project",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article shows a lower cost realization of a compute cluster using Debian
distribution such as PelicanHPC. We will explain parameterization and network
configuration for master and compute slave nodes. Performance testing will take
place using flops.f file given by MPI. The results will be compared between
differents clusters. We will explain quickly how the temperature is controlled
by a microcontroller unit.
","[{'version': 'v1', 'created': 'Sun, 20 Mar 2016 17:16:56 GMT'}]",2016-03-22,"[['Maquart', 'T.', ''], ['Maquart', 'G.', '']]","['PelicanHPC', 'High Performance Cluster', 'Parallel programming', 'Message Passing Interface', 'Homemade', 'Arduino project']"
15531,1111.5930,Aarti Singh,"Aarti Singh, Dimple Juneja, A.K.Sharma",Agent Development Toolkits,"Contains Seven pages, 2 Figures and One table","International Journal of Advancements in Technology,vol. 2, No.1,
  January 2011, http://ijict.org",,,cs.MA,http://creativecommons.org/licenses/by/3.0/,"  Development of agents as well as their wide usage requires good underlying
infrastructure. Literature indicates scarcity of agent development tools in
initial years of research which limited the exploitation of this beneficial
technology. However, today a wide variety of tools are available, for
developing robust infrastructure. This technical note provides a deep overview
of such tools and contrasts features provided by them.
","[{'version': 'v1', 'created': 'Fri, 25 Nov 2011 09:48:28 GMT'}]",2011-11-28,"[['Singh', 'Aarti', ''], ['Juneja', 'Dimple', ''], ['Sharma', 'A. K.', '']]","['Multi-agent systems', 'agent development', 'agent communication', 'agent mobility', 'agent communication security']"
15532,1606.03531,Justin Filippou,"Justin Filippou, Christopher Cheong and France Cheong","Combining The Fogg Behavioural Model And Hook Model To Design Features
  In A Persuasive App To Improve Study Habits","ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
  Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/212,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Using technology to persuade people to behave in a certain way is an
ever-increasing field of study. The ability to persuade individuals is quite
clear in e-commerce, where individuals are persuaded to make purchasing
decisions. However, it can also be applied to other disciplines, such as
education where improving the study behaviour of students would be particularly
useful. Forming good study habits can be a challenge for university students
who have not done so in the earlier years of their education, or where the
pressures of external commitments have eroded previously good habits. We use a
combination of the Fogg Behavioural Model and the Hook model to design features
for an app as a component of a larger persuasive system to help improve three
key areas of study habits: study scheduling, class preparation and group study.
The app will be built and tested in a university setting targeting
undergraduate students.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 02:59:14 GMT'}]",2016-06-14,"[['Filippou', 'Justin', ''], ['Cheong', 'Christopher', ''], ['Cheong', 'France', '']]","['persuasive systems', 'education', 'study habits', 'mobile apps']"
15533,1702.06829,Raimi Rufai,Raimi A. Rufai and Dana S. Richards,A Simple Convex Layers Algorithm,"12 pages, 6 figures",,,,cs.CG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a set of $n$ points $P$ in the plane, the first layer $L_1$ of $P$ is
formed by the points that appear on $P$'s convex hull. In general, a point
belongs to layer $L_i$, if it lies on the convex hull of the set $P \setminus
\bigcup_{j<i}\{L_j\}$. The \emph{convex layers problem} is to compute the
convex layers $L_i$. Existing algorithms for this problem either do not achieve
the optimal $\mathcal{O}\left(n\log n\right)$ runtime and linear space, or are
overly complex and difficult to apply in practice. We propose a new algorithm
that is both optimal and simple. The simplicity is achieved by independently
computing four sets of monotone convex chains in $\mathcal{O}\left(n\log
n\right)$ time and linear space. These are then merged in
$\mathcal{O}\left(n\log n\right)$ time.
","[{'version': 'v1', 'created': 'Wed, 22 Feb 2017 15:03:08 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Mar 2017 14:38:10 GMT'}]",2017-03-17,"[['Rufai', 'Raimi A.', ''], ['Richards', 'Dana S.', '']]","['convex hull', 'convex layers', 'computational geometry']"
15534,1707.08729,Zixing Zhang,"Zixing Zhang, Ding Liu, Jing Han, Kun Qian, Bj\""orn Schuller","Learning audio sequence representations for acoustic event
  classification",,,,,cs.SD cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Acoustic Event Classification (AEC) has become a significant task for
machines to perceive the surrounding auditory scene. However, extracting
effective representations that capture the underlying characteristics of the
acoustic events is still challenging. Previous methods mainly focused on
designing the audio features in a `hand-crafted' manner. Interestingly,
data-learnt features have been recently reported to show better performance. Up
to now, these were only considered on the frame level. In this article, we
propose an unsupervised learning framework to learn a vector representation of
an audio sequence for AEC. This framework consists of a Recurrent Neural
Network (RNN) encoder and an RNN decoder, which respectively transforms the
variable-length audio sequence into a fixed-length vector and reconstructs the
input sequence on the generated vector. After training the encoder-decoder, we
feed the audio sequences to the encoder and then take the learnt vectors as the
audio sequence representations. Compared with previous methods, the proposed
method can not only deal with the problem of arbitrary-lengths of audio
streams, but also learn the salient information of the sequence. Extensive
evaluation on a large-size acoustic event database is performed, and the
empirical results demonstrate that the learnt audio sequence representation
yields a significant performance improvement by a large margin compared with
other state-of-the-art hand-crafted sequence features for AEC.
","[{'version': 'v1', 'created': 'Thu, 27 Jul 2017 07:26:38 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Jun 2021 10:13:12 GMT'}]",2021-06-22,"[['Zhang', 'Zixing', ''], ['Liu', 'Ding', ''], ['Han', 'Jing', ''], ['Qian', 'Kun', ''], ['Schuller', 'Björn', '']]","['Audio sequence-to-vector', 'recurrent autoencoder', 'acoustic event classification', 'machine learning', 'deeplearning', 'computer audition']"
15535,1507.00385,Ranjit Jhala,"Niki Vazou, Alexander Bakst, Ranjit Jhala",Bounded Refinement Types,"14 pages, International Conference on Functional Programming, ICFP
  2015",,,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a notion of bounded quantification for refinement types and show
how it expands the expressiveness of refinement typing by using it to develop
typed combinators for: (1) relational algebra and safe database access, (2)
Floyd-Hoare logic within a state transformer monad equipped with combinators
for branching and looping, and (3) using the above to implement a refined IO
monad that tracks capabilities and resource usage. This leap in expressiveness
comes via a translation to ""ghost"" functions, which lets us retain the
automated and decidable SMT based checking and inference that makes refinement
typing effective in practice.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2015 22:14:45 GMT'}]",2015-07-03,"[['Vazou', 'Niki', ''], ['Bakst', 'Alexander', ''], ['Jhala', 'Ranjit', '']]","['haskell', 'refinement types', 'abstract interpretation']"
15536,1510.03945,Jean-Florent Raymond,"Dimitris Chatzidimitriou and Jean-Florent Raymond and Ignasi Sau and
  Dimitrios M. Thilikos","An $O(\log OPT)$-approximation for covering and packing minor models of
  ${\theta}_r$",Some of the results of this paper have been presented in WAOA 2015,,,,cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given two graphs $G$ and $H$, we define $\textsf{v-cover}_{H}(G)$ (resp.
$\textsf{e-cover}_{H}(G)$) as the minimum number of vertices (resp. edges)
whose removal from $G$ produces a graph without any minor isomorphic to ${H}$.
Also $\textsf{v-pack}_{H}(G)$ (resp. $\textsf{v-pack}_{H}(G)$) is the maximum
number of vertex- (resp. edge-) disjoint subgraphs of $G$ that contain a minor
isomaorphic to $H$. We denote by $\theta_r$ the graph with two vertices and $r$
parallel edges between them. When $H=\theta_r$, the parameters
$\textsf{v-cover}_{H}$, $\textsf{e-cover}_{H}$, $\textsf{v-pack}_{H}$, and
$\textsf{v-pack}_{H}$ are NP-hard to compute (for sufficiently big values of
$r$). Drawing upon combinatorial results in [Minors in graphs of large
$\theta_r$-girth, Chatzidimitriou et al., arXiv:1510.03041], we give an
algorithmic proof that if $\textsf{v-pack}_{\theta_r}(G)\leq k$, then
$\textsf{v-cover}_{\theta_r}(G) = O(k\log k)$, and similarly for
$\textsf{v-pack}_{\theta_r}$ and $\textsf{e-cover}_{\theta_r}$. In other words,
the class of graphs containing ${\theta_r}$ as a minor has the vertex/edge
Erd\H{o}s-P\'osa property, for every positive integer $r$. Using the
algorithmic machinery of our proofs, we introduce a unified approach for the
design of an $O(\log {\rm OPT})$-approximation algorithm for
$\textsf{v-pack}_{\theta_r}$, $\textsf{v-cover}_{\theta_r}$,
$\textsf{v-pack}_{\theta_r}$, and $\textsf{e-cover}_{\theta_r}$ that runs in
$O(n\cdot \log(n)\cdot m)$ steps. Also, we derive several new
Erd\H{o}s-P\'osa-type results from the techniques that we introduce.
","[{'version': 'v1', 'created': 'Wed, 14 Oct 2015 01:41:15 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Jan 2017 21:44:13 GMT'}]",2017-01-23,"[['Chatzidimitriou', 'Dimitris', ''], ['Raymond', 'Jean-Florent', ''], ['Sau', 'Ignasi', ''], ['Thilikos', 'Dimitrios M.', '']]","['Erd˝os-P´osa property', 'packings in graphs', 'coverings in graphs', 'minormodels of θr', 'approximation algorithms', 'protrusion decomposition']"
15537,1504.04478,Thomas Hartmann,"Thomas Hartmann, Benjamin Zapilko, Joachim Wackerow, Kai Eckert","Evaluating the Quality of RDF Data Sets on Common Vocabularies in the
  Social, Behavioral, and Economic Sciences",,,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  From 2012 to 2015 together with other Linked Data community members and
experts from the social, behavioral, and economic sciences (SBE), we developed
diverse vocabularies to represent SBE metadata and tabular data in RDF. The
DDI-RDF Discovery Vocabulary (DDI-RDF) is designed to support the
dissemination, management, and reuse of unit-record data, i.e., data about
individuals, households, and businesses, collected in form of responses to
studies and archived for research purposes. The RDF Data Cube Vocabulary (QB)
is a W3C recommendation for expressing data cubes, i.e. multi-dimensional
aggregate data and its metadata. Physical Data Description (PHDD) is a
vocabulary to model data in rectangular format, i.e., tabular data. The data
could either be represented in records with character-separated values (CSV) or
fixed length. The Simple Knowledge Organization System (SKOS) is a vocabulary
to build knowledge organization systems such as thesauri, classification
schemes, and taxonomies. XKOS is a SKOS extension to describe formal
statistical classifications.
  To ensure high quality of and trust in both metadata and data, their
representation in RDF must satisfy certain criteria - specified in terms of RDF
constraints. In this paper, we evaluate the data quality of 15,694 data sets
(4.26 billion triples) of research data for the social, behavioral, and
economic sciences obtained from 33 SPARQL endpoints. We checked 115 constraints
on three different and representative SBE vocabularies (DDI-RDF, QB, and SKOS)
by means of the RDF Validator, a validation environment which is available at
http://purl.org/net/rdfval-demo.
","[{'version': 'v1', 'created': 'Fri, 17 Apr 2015 10:42:09 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Sep 2015 07:54:09 GMT'}]",2015-09-16,"[['Hartmann', 'Thomas', ''], ['Zapilko', 'Benjamin', ''], ['Wackerow', 'Joachim', ''], ['Eckert', 'Kai', '']]","['RDF Validation', 'RDF Constraints', 'DDI-RDF DiscoveryVocabulary', 'RDF Data Cube Vocabulary', 'Thesauri', 'SKOS', 'Linked Data', 'Semantic Web']"
15538,1309.7270,Ahmed Abbasi,"Tianjun Fu, Ahmed Abbasi, Daniel Zeng and Hsinchun Chen",Evaluating the Usefulness of Sentiment Information for Focused Crawlers,"Fu, T., Abbasi, A., Zeng, D., and Chen, H. ""Evaluating the Usefulness
  of Sentiment Information for Focused Crawlers,"" In Proceedings of the 20th
  Annual Workshop on Information Technologies and Systems, St. Louis, MO,
  December 11-12, 2010",,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the prevalence of sentiment-related content on the Web, there has
been limited work on focused crawlers capable of effectively collecting such
content. In this study, we evaluated the efficacy of using sentiment-related
information for enhanced focused crawling of opinion-rich web content regarding
a particular topic. We also assessed the impact of using sentiment-labeled web
graphs to further improve collection accuracy. Experimental results on a large
test bed encompassing over half a million web pages revealed that focused
crawlers utilizing sentiment information as well as sentiment-labeled web
graphs are capable of gathering more holistic collections of opinion-related
content regarding a particular topic. The results have important implications
for business and marketing intelligence gathering efforts in the Web 2.0 era.
","[{'version': 'v1', 'created': 'Fri, 27 Sep 2013 15:14:34 GMT'}]",2013-09-30,"[['Fu', 'Tianjun', ''], ['Abbasi', 'Ahmed', ''], ['Zeng', 'Daniel', ''], ['Chen', 'Hsinchun', '']]","['focused crawler', 'spidering', 'opinion mining', 'sentiment analysis', 'web mining']"
15539,1406.4123,Jubair Basha N Md,"N.Md Jubair Basha, Chandra Mohan","A strategy to identify components using clustering approach for
  component reusability","arXiv admin note: substantial text overlap with arXiv:1207.4938,
  arXiv:1202.5609, arXiv:1406.3727",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Component Based Software Engineering (CBSE) has played a very important role
for building larger software systems The current practices of software industry
demands development of a software within time and budget which is highly
productive. It is necessary to achieve how much effectively the software
component is reusable. To achieve this, the component identification is
mandatory. The traditional approaches are presented in the literature. However
effective reuse is still a challenging issue. In this paper, a strategy has
been proposed for the identification of a business component using clustering
methodology. This approach will be useful in identifying the reusable
components for different domains. The proposed approach has identified the
reconfigured component using the CBO measure to reduce the coupling between the
objects. By considering this proposed strategy, the productivity can be
increased in the organization.
","[{'version': 'v1', 'created': 'Sat, 14 Jun 2014 13:33:16 GMT'}]",2014-06-18,"[['Basha', 'N. Md Jubair', ''], ['Mohan', 'Chandra', '']]","['Software Reuse', 'Domain Engineering', 'clustering', 'component']"
15540,1212.3217,Joost Joosten,J. J. Joosten,Complexity fits the fittest,arXiv admin note: substantial text overlap with arXiv:1211.1878,,,,cs.LO cs.CC nlin.AO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we shall relate computational complexity to the principle of
natural selection. We shall do this by giving a philosophical account of
complexity versus universality. It seems sustainable to equate universal
systems to complex systems or at least to potentially complex systems. Post's
problem on the existence of (natural) intermediate degrees (between decidable
and universal RE) then finds its analog in the Principle of Computional
Equivalence (PCE). In this paper we address possible driving forces --if any--
behind PCE. Both the natural aspects as well as the cognitive ones are
investigated. We postulate a principle GNS that we call the Generalized Natural
Selection principle that together with the Church-Turing thesis is seen to be
in close correspondence to a weak version of PCE. Next, we view our cognitive
toolkit in an evolutionary light and postulate a principle in analogy with
Fodor's language principle. In the final part of the paper we reflect on ways
to provide circumstantial evidence for GNS by means of theorems, experiments
or, simulations.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2012 11:49:44 GMT'}]",2012-12-14,"[['Joosten', 'J. J.', '']]","['computational complexity', 'intermediate degrees', 'Principleof Computational Equivalence', 'natural selection', 'dynamical systems']"
15541,1610.03151,Matthias Nie{\ss}ner,"Justus Thies, Michael Zollh\""ofer, Marc Stamminger, Christian
  Theobalt, Matthias Nie{\ss}ner","FaceVR: Real-Time Facial Reenactment and Eye Gaze Control in Virtual
  Reality",Video: https://youtu.be/jIlujM5avU8 Presented at Siggraph'18,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose FaceVR, a novel image-based method that enables video
teleconferencing in VR based on self-reenactment. State-of-the-art face
tracking methods in the VR context are focused on the animation of rigged 3d
avatars. While they achieve good tracking performance the results look
cartoonish and not real. In contrast to these model-based approaches, FaceVR
enables VR teleconferencing using an image-based technique that results in
nearly photo-realistic outputs. The key component of FaceVR is a robust
algorithm to perform real-time facial motion capture of an actor who is wearing
a head-mounted display (HMD), as well as a new data-driven approach for eye
tracking from monocular videos. Based on reenactment of a prerecorded stereo
video of the person without the HMD, FaceVR incorporates photo-realistic
re-rendering in real time, thus allowing artificial modifications of face and
eye appearances. For instance, we can alter facial expressions or change gaze
directions in the prerecorded target video. In a live setup, we apply these
newly-introduced algorithmic components.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2016 01:35:56 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Mar 2018 21:35:57 GMT'}]",2018-03-23,"[['Thies', 'Justus', ''], ['Zollhöfer', 'Michael', ''], ['Stamminger', 'Marc', ''], ['Theobalt', 'Christian', ''], ['Nießner', 'Matthias', '']]","['face tracking', 'virtual reality', 'eye tracking']"
15542,1610.09225,Venkata Sasank Pagolu,"Venkata Sasank Pagolu, Kamal Nayan Reddy Challa, Ganapati Panda,
  Babita Majhi",Sentiment Analysis of Twitter Data for Predicting Stock Market Movements,6 pages 4 figures Conference Paper,,,,cs.IR cs.CL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predicting stock market movements is a well-known problem of interest.
Now-a-days social media is perfectly representing the public sentiment and
opinion about current events. Especially, twitter has attracted a lot of
attention from researchers for studying the public sentiments. Stock market
prediction on the basis of public sentiments expressed on twitter has been an
intriguing field of research. Previous studies have concluded that the
aggregate public mood collected from twitter may well be correlated with Dow
Jones Industrial Average Index (DJIA). The thesis of this work is to observe
how well the changes in stock prices of a company, the rises and falls, are
correlated with the public opinions being expressed in tweets about that
company. Understanding author's opinion from a piece of text is the objective
of sentiment analysis. The present paper have employed two different textual
representations, Word2vec and N-gram, for analyzing the public sentiments in
tweets. In this paper, we have applied sentiment analysis and supervised
machine learning principles to the tweets extracted from twitter and analyze
the correlation between stock market movements of a company and sentiments in
tweets. In an elaborate way, positive news and tweets in social media about a
company would definitely encourage people to invest in the stocks of that
company and as a result the stock price of that company would increase. At the
end of the paper, it is shown that a strong correlation exists between the rise
and falls in stock prices with the public sentiments in tweets.
","[{'version': 'v1', 'created': 'Fri, 28 Oct 2016 14:07:43 GMT'}]",2016-10-31,"[['Pagolu', 'Venkata Sasank', ''], ['Challa', 'Kamal Nayan Reddy', ''], ['Panda', 'Ganapati', ''], ['Majhi', 'Babita', '']]","['Sentiment Analysis', 'Natural Language Processing', 'Stock market prediction', 'Machine Learning', 'Word2vec', 'N-gram']"
15543,1111.5348,Seifedine Kadry Seifedine Kadry,"Abbas Noon, Ali Kalakech, Seifedine Kadry","A New Round Robin Based Scheduling Algorithm for Operating Systems:
  Dynamic Quantum Using the Mean Average","6 pages, 4 figures","IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 3, No. 1, 2011, 224-229",,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Round Robin, considered as the most widely adopted CPU scheduling algorithm,
undergoes severe problems directly related to quantum size. If time quantum
chosen is too large, the response time of the processes is considered too high.
On the other hand, if this quantum is too small, it increases the overhead of
the CPU. In this paper, we propose a new algorithm, called AN, based on a new
approach called dynamic-time-quantum; the idea of this approach is to make the
operating systems adjusts the time quantum according to the burst time of the
set of waiting processes in the ready queue. Based on the simulations and
experiments, we show that the new proposed algorithm solves the fixed time
quantum problem and increases the performance of Round Robin.
","[{'version': 'v1', 'created': 'Tue, 22 Nov 2011 21:44:25 GMT'}]",2011-11-24,"[['Noon', 'Abbas', ''], ['Kalakech', 'Ali', ''], ['Kadry', 'Seifedine', '']]","['Operating Systems', 'Multi Tasking', 'Scheduling Algorithm', 'Time Quantum', 'Round Robin']"
15544,0704.3708,Bernat Corominas-Murtra BCM,Bernat Corominas-Murtra,Network statistics on early English Syntax: Structural criteria,"New abstract. Due to a mistake, abstract from V1 was from an old,
  draft version of the work. The content of the paper is exactly the same,
  except on section ""measures"" where a new cite has been added. 28 pag",,,,cs.CL,,"  This paper includes a reflection on the role of networks in the study of
English language acquisition, as well as a collection of practical criteria to
annotate free-speech corpora from children utterances. At the theoretical
level, the main claim of this paper is that syntactic networks should be
interpreted as the outcome of the use of the syntactic machinery. Thus, the
intrinsic features of such machinery are not accessible directly from (known)
network properties. Rather, what one can see are the global patterns of its use
and, thus, a global view of the power and organization of the underlying
grammar. Taking a look into more practical issues, the paper examines how to
build a net from the projection of syntactic relations. Recall that, as opposed
to adult grammars, early-child language has not a well-defined concept of
structure. To overcome such difficulty, we develop a set of systematic criteria
assuming constituency hierarchy and a grammar based on lexico-thematic
relations. At the end, what we obtain is a well defined corpora annotation that
enables us i) to perform statistics on the size of structures and ii) to build
a network from syntactic relations over which we can perform the standard
measures of complexity. We also provide a detailed example.
","[{'version': 'v1', 'created': 'Fri, 27 Apr 2007 17:13:37 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Apr 2007 10:06:50 GMT'}]",2007-05-23,"[['Corominas-Murtra', 'Bernat', '']]","['Syntax', 'complex networks', 'learning', 'Computation']"
15545,1510.00958,Akshar Varma,Akshar Varma,"Existence of k-ary Trees: Subtree Sizes, Heights and Depths","Revised version, 12 pages (excluding references)",,,,cs.DS,http://creativecommons.org/licenses/by/4.0/,"  The rooted tree is an important data structure, and the subtree size, height,
and depth are naturally defined attributes of every node. We consider the
problem of the existence of a k-ary tree given a list of attribute sequences.
We give polynomial time (O(nlog(n))) algorithms for the existence of a k-ary
tree given depth and/or height sequences. Our most significant results are the
Strong NP-Completeness of the decision problems of existence of k-ary trees
given subtree sizes sequences. We prove this by multi-stage reductions from
NUMERICAL MATCHING WITH TARGET SUMS. In the process, we also prove a
generalized version of the 3-PARTITION problem to be Strongly NP-Complete. By
looking at problems where a combination of attribute sequences are given, we
are able to draw the boundary between easy and hard problems related to
existence of trees given attribute sequences and enhance our understanding of
where the difficulty lies in such problems.
","[{'version': 'v1', 'created': 'Sun, 4 Oct 2015 17:50:30 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Jul 2016 03:36:19 GMT'}]",2016-07-19,"[['Varma', 'Akshar', '']]","['Existence of k-ary Trees', 'Strong NP-Completeness', 'Subtree Sizes', 'Height', 'Depth']"
15546,1304.6498,Huixing Fang,"Huixing Fang, Huibiao Zhu and Jianqi Shi",Apricot - An Object-Oriented Modeling Language for Hybrid Systems,,,,,cs.SE cs.LO cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose Apricot as an object-oriented language for modeling hybrid
systems. The language combines the features in domain specific language and
object-oriented language, that fills the gap between design and implementation,
as a result, we put forward the modeling language with simple and distinct
syntax, structure and semantics. In addition, we introduce the concept of
design by convention into Apricot.As the characteristic of object-oriented and
the component architecture in Apricot, we conclude that it is competent for
modeling hybrid systems without losing scalability.
","[{'version': 'v1', 'created': 'Wed, 24 Apr 2013 07:48:08 GMT'}]",2013-04-25,"[['Fang', 'Huixing', ''], ['Zhu', 'Huibiao', ''], ['Shi', 'Jianqi', '']]","['Apricot', 'Object-Oriented Modeling', 'Hybrid Systems', 'Design by Convention']"
15547,1610.09447,Bin Gu,"Bin Gu, Zhouyuan Huo, Heng Huang",Asynchronous Stochastic Block Coordinate Descent with Variance Reduction,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Asynchronous parallel implementations for stochastic optimization have
received huge successes in theory and practice recently. Asynchronous
implementations with lock-free are more efficient than the one with writing or
reading lock. In this paper, we focus on a composite objective function
consisting of a smooth convex function $f$ and a block separable convex
function, which widely exists in machine learning and computer vision. We
propose an asynchronous stochastic block coordinate descent algorithm with the
accelerated technology of variance reduction (AsySBCDVR), which are with
lock-free in the implementation and analysis. AsySBCDVR is particularly
important because it can scale well with the sample size and dimension
simultaneously. We prove that AsySBCDVR achieves a linear convergence rate when
the function $f$ is with the optimal strong convexity property, and a sublinear
rate when $f$ is with the general convexity. More importantly, a near-linear
speedup on a parallel system with shared memory can be obtained.
","[{'version': 'v1', 'created': 'Sat, 29 Oct 2016 03:39:16 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Nov 2016 20:05:31 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Nov 2016 02:14:36 GMT'}]",2016-11-15,"[['Gu', 'Bin', ''], ['Huo', 'Zhouyuan', ''], ['Huang', 'Heng', '']]","['stochastic optimization', 'block coordinate descent', 'parallel computing', 'lockfree']"
15548,1511.06106,Ting Peng,"Ting Peng, Aiping Qu, Xiaoling Wang",Quantitative Analysis of Particles Segregation,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Segregation is a popular phenomenon. It has considerable effects on material
performance. To the author's knowledge, there is still no automated objective
quantitative indicator for segregation. In order to full fill this task,
segregation of particles is analyzed. Edges of the particles are extracted from
the digital picture. Then, the whole picture of particles is splintered to
small rectangles with the same shape. Statistical index of the edges in each
rectangle is calculated. Accordingly, segregation between the indexes
corresponding to the rectangles is evaluated. The results show coincident with
subjective evaluated results. Further more, it can be implemented as an
automated system, which would facilitate the materials quality control
mechanism during production process.
","[{'version': 'v1', 'created': 'Thu, 19 Nov 2015 09:57:14 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Nov 2015 03:09:58 GMT'}]",2015-11-30,"[['Peng', 'Ting', ''], ['Qu', 'Aiping', ''], ['Wang', 'Xiaoling', '']]","['Quantitative analysis', 'particles', 'segregation']"
15549,1511.08119,Anurag Arnab,"Anurag Arnab, Sadeep Jayasumana, Shuai Zheng, Philip Torr",Higher Order Conditional Random Fields in Deep Neural Networks,ECCV 2016,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the problem of semantic segmentation using deep learning. Most
segmentation systems include a Conditional Random Field (CRF) to produce a
structured output that is consistent with the image's visual features. Recent
deep learning approaches have incorporated CRFs into Convolutional Neural
Networks (CNNs), with some even training the CRF end-to-end with the rest of
the network. However, these approaches have not employed higher order
potentials, which have previously been shown to significantly improve
segmentation performance. In this paper, we demonstrate that two types of
higher order potential, based on object detections and superpixels, can be
included in a CRF embedded within a deep network. We design these higher order
potentials to allow inference with the differentiable mean field algorithm. As
a result, all the parameters of our richer CRF model can be learned end-to-end
with our pixelwise CNN classifier. We achieve state-of-the-art segmentation
performance on the PASCAL VOC benchmark with these trainable higher order
potentials.
","[{'version': 'v1', 'created': 'Wed, 25 Nov 2015 17:02:31 GMT'}, {'version': 'v2', 'created': 'Sat, 28 Nov 2015 13:43:24 GMT'}, {'version': 'v3', 'created': 'Wed, 30 Mar 2016 21:43:45 GMT'}, {'version': 'v4', 'created': 'Fri, 29 Jul 2016 18:16:18 GMT'}]",2016-08-01,"[['Arnab', 'Anurag', ''], ['Jayasumana', 'Sadeep', ''], ['Zheng', 'Shuai', ''], ['Torr', 'Philip', '']]","['Semantic Segmentation', 'Conditional Random Fields', 'Deep Learning', 'Convolutional Neural Networks']"
15550,1403.2273,Dmitry Lande,"Yakiv O. Kalinovsky, Dmitry V. Lande, Yuliya E. Boyarinova, Iana V.
  Khitsko","Some isomorphic classes for noncanonical hypercomplex number systems of
  dimension 2",6 pages,,,,cs.NA,http://creativecommons.org/licenses/by/3.0/,"  Building of some isomorphic classes for noncanonical hypercomplex number
systems o dimension 2 is described. In general case, such systems with specific
constraints to structural constants can be isomorphic to complex, dual or
double number system. Isomorphic transition between noncanonical hypercomplex
number systems of the general form and diagonal form is built.
","[{'version': 'v1', 'created': 'Fri, 7 Mar 2014 19:13:06 GMT'}]",2014-03-11,"[['Kalinovsky', 'Yakiv O.', ''], ['Lande', 'Dmitry V.', ''], ['Boyarinova', 'Yuliya E.', ''], ['Khitsko', 'Iana V.', '']]","['noncanonical hypercomplex number system', 'isomorphism', 'isomorphic classes']"
15551,1402.2377,Reena Philips Mrs,"Sangita Gupta, Suma. V","Empirical Study on Selection of Team Members for Software Projects -
  Data Mining Approach","6 Pages, 1 Figure. arXiv admin note: text overlap with
  arXiv:1201.3417 by other authors","International Journal of Computer Science and Informatics, ISSN
  PRINT: 2231 5292, Volume 3, Issue 2, 2013",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the essential requisites of any software industry is the development
of customer satisfied products. However, accomplishing the aforesaid business
objective depends upon the depth of quality of product that is engineered in
the organization. Thus, generation of high quality depends upon process, which
is in turn depends upon the people. Existing scenario in IT industries demands
a requirement for deploying the right personnel for achieving desirable quality
in the product through the existing process. The goal of this paper is to
identify the criteria which will be used in industrial practice to select
members of a software project team, and to look for relationships between these
criteria and project success. Using semi-structured interviews and qualitative
methods for data analysis and synthesis, a set of team building criteria was
identified from project managers in industry. The findings show that the
consistent use of the set of criteria correlated significantly with project
success, and the criteria related to human factors present strong correlations
with software quality and thereby project success. This knowledge enables
decision making for project managers in allocation of right personnel to
realize desired level.
","[{'version': 'v1', 'created': 'Tue, 11 Feb 2014 05:39:50 GMT'}]",2014-02-12,"[['Gupta', 'Sangita', ''], ['V', 'Suma.', '']]","['Software Engineering', 'Software Quality', 'Decision Tree', 'Project Management', 'Data Mining']"
15552,1704.03764,Rodrigo Bruno Mr.,"Rodrigo Bruno, Lu\'is Oliveira, Paulo Ferreira",NG2C: Pretenuring N-Generational GC for HotSpot Big Data Applications,Accepted at ISMM'17,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Big Data applications suffer from unpredictable and unacceptably high pause
times due to Garbage Collection (GC). This is the case in latency-sensitive
applications such as on-line credit-card fraud detection, graph-based computing
for analysis on social networks, etc. Such pauses compromise latency
requirements of the whole application stack and result from applications'
aggressive buffering/caching of data, exposing an ill-suited GC design, which
assumes that most objects will die young and does not consider that
applications hold large amounts of middle-lived data in memory.
  To avoid such pauses, we propose NG2C, a new GC algorithm that combines
pretenuring with an N-Generational heap. By being able to allocate objects into
different generations, NG2C is able to group objects with similar lifetime
profiles in the same generation. By allocating objects with similar lifetime
profiles close to each other, i.e. in the same generation, we avoid object
promotion (copying between generations) and heap fragmentation (which leads to
heap compactions) both responsible for most of the duration of HotSpot GC pause
times.
  NG2C is implemented for the OpenJDK 8 HotSpot Java Virtual Machine, as an
extension of the Garbage First GC. We evaluate NG2C using Cassandra, Lucene,
and GraphChi with three different GCs: Garbage First (G1), Concurrent Mark
Sweep (CMS), and NG2C. Results show that NG2C decreases the worst observable GC
pause time by up to 94.8% for Cassandra, 85.0% for Lucene and 96.45% for
GraphChi, when compared to current collectors (G1 and CMS). In addition, NG2C
has no negative impact on application throughput or memory usage.
","[{'version': 'v1', 'created': 'Wed, 12 Apr 2017 14:03:32 GMT'}]",2017-04-13,"[['Bruno', 'Rodrigo', ''], ['Oliveira', 'Luís', ''], ['Ferreira', 'Paulo', '']]","['Garbage Collection', 'Big Data', 'Latency']"
15553,1701.06104,Xiaoxiao Yang,"Xiaoxiao Yang, Joost-Pieter Katoen, Huimin Lin, Hao Wu",Verifying Concurrent Stacks by Divergence-Sensitive Bisimulation,,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The verification of linearizability -- a key correctness criterion for
concurrent objects -- is based on trace refinement whose checking is
PSPACE-complete. This paper suggests to use \emph{branching} bisimulation
instead. Our approach is based on comparing an abstract specification in which
object methods are executed atomically to a real object program. Exploiting
divergence sensitivity, this also applies to progress properties such as
lock-freedom. These results enable the use of \emph{polynomial-time}
divergence-sensitive branching bisimulation checking techniques for verifying
linearizability and progress. We conducted the experiment on concurrent
lock-free stacks to validate the efficiency and effectiveness of our methods.
","[{'version': 'v1', 'created': 'Sat, 21 Jan 2017 23:41:35 GMT'}, {'version': 'v2', 'created': 'Sun, 22 Apr 2018 02:38:45 GMT'}]",2018-04-24,"[['Yang', 'Xiaoxiao', ''], ['Katoen', 'Joost-Pieter', ''], ['Lin', 'Huimin', ''], ['Wu', 'Hao', '']]","['Linearizability', 'Progress Properties', 'Bisimulation', 'Divergence', 'Concurrency']"
15554,1410.2087,Saman Feghhi,"Saman Feghhi, Douglas J. Leith",A Web Traffic Analysis Attack Using Only Timing Information,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce an attack against encrypted web traffic that makes use only of
packet timing information on the uplink. This attack is therefore impervious to
existing packet padding defences. In addition, unlike existing approaches this
timing-only attack does not require knowledge of the start/end of web fetches
and so is effective against traffic streams. We demonstrate the effectiveness
of the attack against both wired and wireless traffic, achieving mean success
rates in excess of 90%. In addition to being of interest in its own right, this
timing-only attack serves to highlight deficiencies in existing defences and so
to areas where it would be beneficial for VPN designers to focus further
attention.
","[{'version': 'v1', 'created': 'Wed, 8 Oct 2014 12:51:36 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Sep 2015 12:28:54 GMT'}, {'version': 'v3', 'created': 'Sat, 9 Jul 2016 07:12:24 GMT'}]",2016-07-12,"[['Feghhi', 'Saman', ''], ['Leith', 'Douglas J.', '']]","['traffic analysis', 'website fingerprinting', 'timing-onlyattacks', 'network privacy']"
15555,1504.02202,Pisutpong Endoo,Pisutpong Endoo,Fackbook Implementation in Developing English Writing for Thai Students,,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The objectives of this research were to study FB implementation and attitudes
in developing English writing skills of Thai students studying in the first
year students program in EIC academic year 1/2014 at RMUTI, Surin Campus. The
Purposive sampling was designed for data collecting. The instruments for this
research were questionnaires and in-depth questions. The data analysis was
analyzed by the Descriptive statistics to find out the value of the frequency
and percentage.
","[{'version': 'v1', 'created': 'Thu, 9 Apr 2015 06:49:30 GMT'}]",2015-04-10,"[['Endoo', 'Pisutpong', '']]","['Facbook', 'implementation', 'attitudes', 'writing Skills']"
15556,1305.1363,Zhi-Hua Zhou,Wei Gao and Rong Jin and Shenghuo Zhu and Zhi-Hua Zhou,One-Pass AUC Optimization,Proceeding of 30th International Conference on Machine Learning,"Artificial Intelligence, 2016, 236: 1-29",,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  AUC is an important performance measure and many algorithms have been devoted
to AUC optimization, mostly by minimizing a surrogate convex loss on a training
data set. In this work, we focus on one-pass AUC optimization that requires
only going through the training data once without storing the entire training
dataset, where conventional online learning algorithms cannot be applied
directly because AUC is measured by a sum of losses defined over pairs of
instances from different classes. We develop a regression-based algorithm which
only needs to maintain the first and second order statistics of training data
in memory, resulting a storage requirement independent from the size of
training data. To efficiently handle high dimensional data, we develop a
randomized algorithm that approximates the covariance matrices by low rank
matrices. We verify, both theoretically and empirically, the effectiveness of
the proposed algorithm.
","[{'version': 'v1', 'created': 'Tue, 7 May 2013 00:30:32 GMT'}, {'version': 'v2', 'created': 'Thu, 16 May 2013 13:24:37 GMT'}]",2020-07-07,"[['Gao', 'Wei', ''], ['Jin', 'Rong', ''], ['Zhu', 'Shenghuo', ''], ['Zhou', 'Zhi-Hua', '']]","['AUC optimization', 'learning to rank', 'large-scale learning', 'random projection', 'square loss']"
15557,1309.7313,Jiwei Li,Jiwei Li and Claire Cardie,Timeline Generation: Tracking individuals on Twitter,,,,,cs.SI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a unsupervised framework to reconstruct a person's
life history by creating a chronological list for {\it personal important
events} (PIE) of individuals based on the tweets they published. By analyzing
individual tweet collections, we find that what are suitable for inclusion in
the personal timeline should be tweets talking about personal (as opposed to
public) and time-specific (as opposed to time-general) topics. To further
extract these types of topics, we introduce a non-parametric multi-level
Dirichlet Process model to recognize four types of tweets: personal
time-specific (PersonTS), personal time-general (PersonTG), public
time-specific (PublicTS) and public time-general (PublicTG) topics, which, in
turn, are used for further personal event extraction and timeline generation.
To the best of our knowledge, this is the first work focused on the generation
of timeline for individuals from twitter data. For evaluation, we have built a
new golden standard Timelines based on Twitter and Wikipedia that contain PIE
related events from 20 {\it ordinary twitter users} and 20 {\it celebrities}.
Experiments on real Twitter data quantitatively demonstrate the effectiveness
of our approach.
","[{'version': 'v1', 'created': 'Fri, 27 Sep 2013 17:56:35 GMT'}, {'version': 'v2', 'created': 'Sun, 20 Oct 2013 00:16:14 GMT'}, {'version': 'v3', 'created': 'Fri, 7 Feb 2014 19:10:58 GMT'}]",2014-02-10,"[['Li', 'Jiwei', ''], ['Cardie', 'Claire', '']]","['Individual Timeline Generation', 'Dirichlet Process', 'Twitter']"
15558,1305.1925,Urmila Shrawankar Ms,"Urmila Shrawankar, Anjali Mahajan","Speech: A Challenge to Digital Signal Processing Technology for
  Human-to-Computer Interaction","Pages: 06 Figures : 06. arXiv admin note: text overlap with
  arXiv:1305.1429, arXiv:1305.1428","Conference Proceedings National Conference on Recent Trends in
  Electronics & Information Technology (RTEIT),2006,pp 206-212",,,cs.HC cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This software project based paper is for a vision of the near future in which
computer interaction is characterized by natural face-to-face conversations
with lifelike characters that speak, emote, and gesture. The first step is
speech. The dream of a true virtual reality, a complete human-computer
interaction system will not come true unless we try to give some perception to
machine and make it perceive the outside world as humans communicate with each
other. This software project is under development for listening and replying
machine (Computer) through speech. The Speech interface is developed to convert
speech input into some parametric form (Speech-to-Text) for further processing
and the results, text output to speech synthesis (Text-to-Speech)
","[{'version': 'v1', 'created': 'Wed, 8 May 2013 05:55:50 GMT'}]",2013-05-10,"[['Shrawankar', 'Urmila', ''], ['Mahajan', 'Anjali', '']]","['Signal Processing Front-end', 'Speaker Independent', 'Text-Dependent', 'Speech-to-Text', 'Text-to-Speech.  I']"
15559,1607.01092,Masoud S. Nosrati,Masoud S. Nosrati and Ghassan Hamarneh,Incorporating prior knowledge in medical image segmentation: a survey,"Survey paper, 30 pages",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Medical image segmentation, the task of partitioning an image into meaningful
parts, is an important step toward automating medical image analysis and is at
the crux of a variety of medical imaging applications, such as computer aided
diagnosis, therapy planning and delivery, and computer aided interventions.
However, the existence of noise, low contrast and objects' complexity in
medical images are critical obstacles that stand in the way of achieving an
ideal segmentation system. Incorporating prior knowledge into image
segmentation algorithms has proven useful for obtaining more accurate and
plausible results. This paper surveys the different types of prior knowledge
that have been utilized in different segmentation frameworks. We focus our
survey on optimization-based methods that incorporate prior information into
their frameworks. We review and compare these methods in terms of the types of
prior employed, the domain of formulation (continuous vs. discrete), and the
optimization techniques (global vs. local). We also created an interactive
online database of existing works and categorized them based on the type of
prior knowledge they use. Our website is interactive so that researchers can
contribute to keep the database up to date. We conclude the survey by
discussing different aspects of designing an energy functional for image
segmentation, open problems, and future perspectives.
","[{'version': 'v1', 'created': 'Tue, 5 Jul 2016 02:19:57 GMT'}]",2016-07-06,"[['Nosrati', 'Masoud S.', ''], ['Hamarneh', 'Ghassan', '']]","['Prior knowledge', 'targeted object segmentation', 'review', 'survey', 'medical image segmentation']"
15560,1603.02763,Marina Meila,James McQueen and Marina Meila and Jacob VanderPlas and Zhongyue Zhang,megaman: Manifold Learning with Millions of points,"12 pages, 6 figures",,,,cs.LG cs.CG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Manifold Learning is a class of algorithms seeking a low-dimensional
non-linear representation of high-dimensional data. Thus manifold learning
algorithms are, at least in theory, most applicable to high-dimensional data
and sample sizes to enable accurate estimation of the manifold. Despite this,
most existing manifold learning implementations are not particularly scalable.
Here we present a Python package that implements a variety of manifold learning
algorithms in a modular and scalable fashion, using fast approximate neighbors
searches and fast sparse eigendecompositions. The package incorporates
theoretical advances in manifold learning, such as the unbiased Laplacian
estimator and the estimation of the embedding distortion by the Riemannian
metric method. In benchmarks, even on a single-core desktop computer, our code
embeds millions of data points in minutes, and takes just 200 minutes to embed
the main sample of galaxy spectra from the Sloan Digital Sky Survey ---
consisting of 0.6 million samples in 3750-dimensions --- a task which has not
previously been possible.
","[{'version': 'v1', 'created': 'Wed, 9 Mar 2016 02:05:11 GMT'}]",2016-03-10,"[['McQueen', 'James', ''], ['Meila', 'Marina', ''], ['VanderPlas', 'Jacob', ''], ['Zhang', 'Zhongyue', '']]","['Manifold Learning', 'Dimension Reduction', 'Riemannian metric', 'Graph Embedding', 'Scalable Methods', 'Python']"
15561,1212.1548,Frank D. Valencia,"Andr\'es Aristiz\'abal (INRIA Saclay - Ile de France, LIX), Filippo
  Bonchi (LIP), Luis Pino (INRIA Saclay - Ile de France), Frank D. Valencia
  (INRIA Saclay - Ile de France, LIX)",Partition Refinement for Bisimilarity in CCP,"27th ACM Symposium On Applied Computing, Trento : Italy (2012)",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Saraswat's concurrent constraint programming (ccp) is a mature formalism for
modeling processes (or programs) that interact by telling and asking
constraints in a global medium, called the store. Bisimilarity is a standard
behavioural equivalence in concurrency theory, but a well-behaved notion of
bisimilarity for ccp has been proposed only recently. When the state space of a
system is finite, the ordinary notion of bisimilarity can be computed via the
well-known partition refinement algorithm, but unfortunately, this algorithm
does not work for ccp bisimilarity. In this paper, we propose a variation of
the partition refinement algorithm for verifying ccp bisimilarity. To the best
of our knowledge this is the first work providing for the automatic
verification of program equivalence for ccp
","[{'version': 'v1', 'created': 'Fri, 7 Dec 2012 07:28:30 GMT'}]",2012-12-10,"[['Aristizábal', 'Andrés', '', 'INRIA Saclay - Ile de France, LIX'], ['Bonchi', 'Filippo', '', 'LIP'], ['Pino', 'Luis', '', 'INRIA Saclay - Ile de France'], ['Valencia', 'Frank D.', '', 'INRIA Saclay - Ile de France, LIX']]","['Concurrent Constraint Programming', 'Bisimilarity', 'Partition Refinement']"
15562,1609.01186,Joaquin Torr\'e Zaffaroni,"Camilo Melani, Juan V. Echag\""ue, Joaqu\'in Torre Zaffaroni, Daniel
  Yankelevich","Un caso de big data punta a punta: an\'alisis de datos de transporte y
  su uso en el negocio","3 pages, in Spanish, 1 figure in Proceedings de AGRANDA 2015,
  Rosario, 2015",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article we present the results of a data analysis project for a
public-transport company. This project encompassed data preparation, analysis
and visualization of three years of historical data. The data consisted in
ticket purchases and GPS location of the vehicles. This work describes the
project from start to end, including the incorporation of the results in the
business process.
","[{'version': 'v1', 'created': 'Mon, 5 Sep 2016 14:55:03 GMT'}]",2016-09-06,"[['Melani', 'Camilo', ''], ['Echagüe', 'Juan V.', ''], ['Zaffaroni', 'Joaquín Torre', ''], ['Yankelevich', 'Daniel', '']]","['Big Data', 'SUBE', 'Pol´ıticas P´ublicas', 'Analytics', 'hadoop']"
15563,0802.2612,Sergey Gubin,Sergey Gubin,On Subgraph Isomorphism,"Simplified, 6 pages","Polynomial size asymmetric linear model for Subgraph Isomorphism,
  Proceedings WCECS 2008, ISBN: 978-988-98671-0-2, pp.241-246",,,cs.DM cs.CC cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Article explicitly expresses Subgraph Isomorphism by a polynomial size
asymmetric linear system.
","[{'version': 'v1', 'created': 'Tue, 19 Feb 2008 09:06:40 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Aug 2008 22:22:49 GMT'}]",2008-11-10,"[['Gubin', 'Sergey', '']]","['Subgraph Isomorphism', 'Linear modeling', 'Algorithm', 'Computational Complexity', 'NP-complete']"
15564,1701.07604,Libin Sun,Libin Sun and James Hays,Super-resolution Using Constrained Deep Texture Synthesis,"13 pages, 11 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hallucinating high frequency image details in single image super-resolution
is a challenging task. Traditional super-resolution methods tend to produce
oversmoothed output images due to the ambiguity in mapping between low and high
resolution patches. We build on recent success in deep learning based texture
synthesis and show that this rich feature space can facilitate successful
transfer and synthesis of high frequency image details to improve the visual
quality of super-resolution results on a wide variety of natural textures and
images.
","[{'version': 'v1', 'created': 'Thu, 26 Jan 2017 07:52:57 GMT'}]",2017-01-27,"[['Sun', 'Libin', ''], ['Hays', 'James', '']]","['detail synthesis', 'texture transfer', 'image synthesis', 'super-resolution']"
15565,1409.6470,Rishi Ranjan Singh,"Rishi Ranjan Singh, Shubham Chaudhary, Manas Agarwal",An Efficient Heuristic for Betweenness-Ordering,"This is an expanded and extended version of the results appeared in
  CompleNet 2015",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Centrality measures, erstwhile popular amongst the sociologists and
psychologists, have seen broad and increasing applications across several
disciplines of late. Amongst a plethora of application specific definitions
available in the literature to rank the vertices, closeness centrality,
betweenness centrality and eigenvector centrality (page-rank) have been the
most important and widely applied ones. Networks where information, signal or
commodities are flowing on the edges, surrounds us. Betweenness centrality
comes as a handy tool to analyze such systems, but betweenness computation is a
daunting task in large size networks. In this paper, we propose an efficient
heuristic to determine the betweenness-ordering of $k$ vertices (where $k$ is
very less than the total number of vertices) without computing their exact
betweenness indices. The algorithm is based on a non-uniform node sampling
model which is developed based on the analysis of Erdos-Renyi graphs. We apply
our approach to find the betweenness-ordering of vertices in several synthetic
and real-world graphs. The proposed heuristic results very efficient ordering
even when runs for a linear time in the terms of the number of edges. We
compare our method with the available techniques in the literature and show
that our method produces more efficient ordering than the currently known
methods.
","[{'version': 'v1', 'created': 'Tue, 23 Sep 2014 10:11:14 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Apr 2015 13:23:38 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Mar 2017 08:36:18 GMT'}]",2017-03-23,"[['Singh', 'Rishi Ranjan', ''], ['Chaudhary', 'Shubham', ''], ['Agarwal', 'Manas', '']]","['Centrality-Ordering', 'Betweenness Centrality', 'Betweenness-Ordering', 'Heuristic', 'Non-uniform']"
15566,1003.2456,Sugata Sanyal,"Rolly Seth, Rishi Kapoor, Hameed Al-Qaheri, Sugata Sanyal","Piecemeal Journey To 'HALCYON' World Of Pervasive Computing : From past
  progress to future challenges",,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although 'Halcyon' means serene environment which pervasive computing aims
at, we have tried to present a different interpretation of this word. Through
our approach, we look at it in context of achieving future 'calm technology'.
The paper gives a general overview of the state of pervasive computing today,
proposes the 'HALCYON Model' and outlines the 'social' challenges faced by
system designers.
","[{'version': 'v1', 'created': 'Fri, 12 Mar 2010 01:19:20 GMT'}]",2010-03-15,"[['Seth', 'Rolly', ''], ['Kapoor', 'Rishi', ''], ['Al-Qaheri', 'Hameed', ''], ['Sanyal', 'Sugata', '']]","['halcyon model', 'pervasive computing', 'nonchalant', 'connected', 'hidden', 'calm technology', 'privacy']"
15567,1008.4974,Taras Lakoba,Taras I. Lakoba,"Stability analysis of the split-step Fourier method on the background of
  a soliton of the nonlinear Schr\""odinger equation","28 pages, 5 figures This is the original manuscript submitted to the
  journal Numerical methods for PDEs. A revised version, in whose title the
  word ""Stability"" is changed to ""Instability"", is scheduled to appear in that
  journal at the end of 2010",,,,cs.NA math.NA nlin.PS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze a numerical instability that occurs in the well-known split-step
Fourier method on the background of a soliton. This instability is found to be
very sensitive to small changes of the parameters of both the numerical grid
and the soliton, unlike the instability of most finite-difference schemes. % on
the background of a monochromatic wave, considered earlier in the literature.
Moreover, the principle of ``frozen coefficients"", in which variable
coefficients are treated as ``locally constant"" for the purpose of stability
analysis, is strongly violated for the instability of the split-step method on
the soliton background. Our analysis explains all these features. It is enabled
by the fact that the period of oscillations of the unstable Fourier modes is
much smaller than the width of the soliton.
","[{'version': 'v1', 'created': 'Sun, 29 Aug 2010 23:45:53 GMT'}]",2010-08-31,"[['Lakoba', 'Taras I.', '']]","['Split-step Fourier method', 'Numerical instability', 'Nonlinear evolutionequations', 'Solitary waves']"
15568,1701.06134,Hiroyuki Hanada,"Hiroyuki Hanada, Mineichi Kudo, Atsuyoshi Nakamura",On Practical Accuracy of Edit Distance Approximation Algorithms,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The edit distance is a basic string similarity measure used in many
applications such as text mining, signal processing, bioinformatics, and so on.
However, the computational cost can be a problem when we repeat many distance
calculations as seen in real-life searching situations. A promising solution to
cope with the problem is to approximate the edit distance by another distance
with a lower computational cost. There are, indeed, many distances have been
proposed for approximating the edit distance. However, their approximation
accuracies are evaluated only theoretically: many of them are evaluated only
with big-oh (asymptotic) notations, and without experimental analysis.
Therefore, it is beneficial to know their actual performance in real
applications. In this study we compared existing six approximation distances in
two approaches: (i) we refined their theoretical approximation accuracy by
calculating up to the constant coefficients, and (ii) we conducted some
experiments, in one artificial and two real-life data sets, to reveal under
which situations they perform best. As a result we obtained the following
results: [Batu 2006] is the best theoretically and [Andoni 2010]
experimentally. Theoretical considerations show that [Batu 2006] is the best if
the string length n is large enough (n >= 300). [Andoni 2010] is experimentally
the best for most data sets and theoretically the second best. [Bar-Yossef
2004], [Charikar 2006] and [Sokolov 2007], despite their middle-level
theoretical performance, are experimentally as good as [Andoni 2010] for pairs
of strings with large alphabet size.
","[{'version': 'v1', 'created': 'Sun, 22 Jan 2017 07:40:52 GMT'}]",2017-01-24,"[['Hanada', 'Hiroyuki', ''], ['Kudo', 'Mineichi', ''], ['Nakamura', 'Atsuyoshi', '']]","['Edit Distance', 'Function Approximation', 'Distortion', 'q-gram']"
15569,1604.07904,Ruck Thawonmas,"Tung Nguyen, Kazuki Mori, and Ruck Thawonmas",Image Colorization Using a Deep Convolutional Neural Network,,"Proc. of ASIAGRAPH 2016, Toyama, Japan, pp. 49-50, Mar. 5-6, 2016",,,cs.CV cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a novel approach that uses deep learning techniques
for colorizing grayscale images. By utilizing a pre-trained convolutional
neural network, which is originally designed for image classification, we are
able to separate content and style of different images and recombine them into
a single image. We then propose a method that can add colors to a grayscale
image by combining its content with style of a color image having semantic
similarity with the grayscale one. As an application, to our knowledge the
first of its kind, we use the proposed method to colorize images of ukiyo-e a
genre of Japanese painting?and obtain interesting results, showing the
potential of this method in the growing field of computer assisted art.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2016 02:16:43 GMT'}]",2016-04-28,"[['Nguyen', 'Tung', ''], ['Mori', 'Kazuki', ''], ['Thawonmas', 'Ruck', '']]","['Machine Learning', 'Deep Learning', 'Neural Networks', 'Convolutional Neural Networks', 'Image Colorization']"
15570,2007.05676,Brent Griffin Dr,Brent A. Griffin and Jason J. Corso,Learning Object Depth from Camera Motion and Video Object Segmentation,ECCV 2020,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video object segmentation, i.e., the separation of a target object from
background in video, has made significant progress on real and challenging
videos in recent years. To leverage this progress in 3D applications, this
paper addresses the problem of learning to estimate the depth of segmented
objects given some measurement of camera motion (e.g., from robot kinematics or
vehicle odometry). We achieve this by, first, introducing a diverse, extensible
dataset and, second, designing a novel deep network that estimates the depth of
objects using only segmentation masks and uncalibrated camera movement. Our
data-generation framework creates artificial object segmentations that are
scaled for changes in distance between the camera and object, and our network
learns to estimate object depth even with segmentation errors. We demonstrate
our approach across domains using a robot camera to locate objects from the YCB
dataset and a vehicle camera to locate obstacles while driving.
","[{'version': 'v1', 'created': 'Sat, 11 Jul 2020 03:50:57 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Jul 2020 23:54:19 GMT'}, {'version': 'v3', 'created': 'Fri, 18 Dec 2020 17:43:07 GMT'}]",2020-12-21,"[['Griffin', 'Brent A.', ''], ['Corso', 'Jason J.', '']]","['Depth Estimation', 'Video Object Segmentation', 'Robotics']"
15571,1602.07057,Bowen Zhou,"Bowen Zhou, Shahriar Shariat","Finding Needle in a Million Metrics: Anomaly Detection in a Large-scale
  Computational Advertising Platform",,,,,cs.AI cs.CY cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online media offers opportunities to marketers to deliver brand messages to a
large audience. Advertising technology platforms enables the advertisers to
find the proper group of audiences and deliver ad impressions to them in real
time. The recent growth of the real time bidding has posed a significant
challenge on monitoring such a complicated system. With so many components we
need a reliable system that detects the possible changes in the system and
alerts the engineering team. In this paper we describe the mechanism that we
invented for recovering the representative metrics and detecting the change in
their behavior. We show that this mechanism is able to detect the possible
problems in time by describing some incident cases.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2016 07:07:26 GMT'}]",2016-02-24,"[['Zhou', 'Bowen', ''], ['Shariat', 'Shahriar', '']]","['Anomaly detection', 'Change point detection', 'Computationaladvertising']"
15572,1205.1701,Himanshu Singh Mr,Himanshu singh and Bhaskar Biswas,Comparison of CSMA based MAC protocols of wireless sensor networks,"International Journal of AdHoc Network Systems, Volume 2, Number 2,
  April 2012",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Energy conservation has been an important area of interest in Wireless Sensor
networks (WSNs). Medium Access Control (MAC) protocols play an important role
in energy conservation. In this paper, we describe CSMA based MAC protocols for
WSN and analyze the simulation results of these protocols. We implemented
S-MAC, T-MAC, B-MAC, B-MAC+, X-MAC, DMAC and Wise-MAC in TOSSIM, a simulator
which unlike other simulators simulates the same code running on real hardware.
Previous surveys mainly focused on the classification of MAC protocols
according to the techniques being used or problem dealt with and presented a
theoretical evaluation of protocols. This paper presents the comparative study
of CSMA based protocols for WSNs, showing which MAC protocol is suitable in a
particular environment and supports the arguments with the simulation results.
The comparative study can be used to find the best suited MAC protocol for
wireless sensor networks in different environments.
","[{'version': 'v1', 'created': 'Tue, 8 May 2012 14:03:52 GMT'}]",2012-05-09,"[['singh', 'Himanshu', ''], ['Biswas', 'Bhaskar', '']]","['Wireless Sensor Networks', 'Medium Access Control Protocols', 'Energy efficiency']"
15573,1407.1549,Somwrita Sarkar,"S. Sarkar, S. Chawla and H. Weng","Resilience of human brain functional coactivation networks under
  thresholding",8 pages,,,,cs.SI physics.soc-ph q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent studies have demonstrated the existence of community structure and
rich club nodes, (i.e., highly interconnected, high degree hub nodes), in human
brain functional networks. The cognitive relevance of the detected modules and
hubs has also been demonstrated, for both task based and default mode networks,
suggesting that the brain self-organizes into patterns of co-activated sets of
regions for performing specific tasks or in resting state. In this paper, we
report studies on the resilience or robustness of this modular structure: under
systematic erosion of connectivity in the network under thresholding, how
resilient is the modularity and hub structure? The results show that the
network shows show strong resilience properties, with the modularity and hub
structure maintaining itself over a large range of connection strengths. Then,
at a certain critical threshold that falls very close to 0, the connectivity,
the modularity, and hub structure suddenly break down, showing a phase
transition like property. Additionally, the spatial and topological
organization of erosion of connectivity at all levels was found to be
homogenous rather than heterogenous; i.e., no ""structural holes"" of any
significant sizes were found, and no gradual increases in numbers of components
were detected. Any loss of connectivity is homogenously spread out across the
network. The results suggest that human task-based functional brain networks
are very resilient, where the whole network structure fails only when
connectivity is almost fully removed from the network. The findings may help
further the understanding of dynamics of and relationships between structural
and functional brain networks.
","[{'version': 'v1', 'created': 'Sun, 6 Jul 2014 22:15:45 GMT'}]",2014-07-08,"[['Sarkar', 'S.', ''], ['Chawla', 'S.', ''], ['Weng', 'H.', '']]","['ACM proceedings', 'Networks', 'modularity', 'community structure', 'hubs', 'resilience', 'human brain', 'functional coactivation']"
15574,0705.4673,B\'ela Csaba,"B\'ela Csaba (Anal. and Stoch. Res. Group, HAS), Andr\'as S. Pluh\'ar
  (Dept. of Comp. Sci., Univ. of Szeged)","A randomized algorithm for the on-line weighted bipartite matching
  problem",to be published,,,,cs.DS cs.DM,,"  We study the on-line minimum weighted bipartite matching problem in arbitrary
metric spaces. Here, $n$ not necessary disjoint points of a metric space $M$
are given, and are to be matched on-line with $n$ points of $M$ revealed one by
one. The cost of a matching is the sum of the distances of the matched points,
and the goal is to find or approximate its minimum. The competitive ratio of
the deterministic problem is known to be $\Theta(n)$. It was conjectured that a
randomized algorithm may perform better against an oblivious adversary, namely
with an expected competitive ratio $\Theta(\log n)$. We prove a slightly weaker
result by showing a $o(\log^3 n)$ upper bound on the expected competitive
ratio. As an application the same upper bound holds for the notoriously hard
fire station problem, where $M$ is the real line.
","[{'version': 'v1', 'created': 'Thu, 31 May 2007 18:35:21 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Jun 2007 20:24:22 GMT'}]",2007-06-06,"[['Csaba', 'Béla', '', 'Anal. and Stoch. Res. Group, HAS'], ['Pluhár', 'András S.', '', 'Dept. of Comp. Sci., Univ. of Szeged']]","['On-line', 'bipartite matching', 'randomized', 'metric spaces']"
15575,1208.3138,Saranya Ramamoorthy,"Ashokkumar Ramalingam, Prabhu Dorairaj and Saranya Ramamoorthy",Personal Safety Triggering System on Android Mobile Platform,"19 pages, International Journal of Network Security & Its
  Applications (IJNSA), July 2012",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Introduction of Smart phones redefined the usage of mobile phones in the
communication world. Smart phones are equipped with various sophisticated
features such as Wi-Fi, GPS navigation, high resolution camera, touch screen
with broadband access which helps the mobile phone users to keep in touch with
the modern world. Many of these features are primarily integrated with the
mobile operating system which is out of reach to public, by which the users
can't manipulate those features. Google came up with an innovative operation
system termed as ANDROID, which is open system architecture with customizable
third party development and debugging environment which helps the user's to
manipulate the features and to create their own customizable applications. In
this paper, 'Emergency Based Remote Collateral Tracking System' application
using Google's Android Mobile Platform is addressed. Emergency is divided into
three categories: heart beat based emergency, security threats like personal
safety and road accidents. This application is targeted to a person who is
driving a vehicle. Heart rate monitoring device is integrated with our
application to sense the heart beat of a person driving the vehicle and if
there is any abnormalities in the heart beat, then our application performs a
dual role. One in which, application uses a GPS to track the location
information of the user and send those location information as a message via
SMS, email and post it on Facebook wall Simultaneously, an emergency signal is
sent to Arduino Microcontroller.This application is written in JAVA programming
language which runs on Eclipse Integrated Development Kit.
","[{'version': 'v1', 'created': 'Fri, 10 Aug 2012 12:33:07 GMT'}]",2012-08-16,"[['Ramalingam', 'Ashokkumar', ''], ['Dorairaj', 'Prabhu', ''], ['Ramamoorthy', 'Saranya', '']]","['Accidents', 'Accelerometer', 'Android', 'Arduino microcontroller', 'Emergency', 'GPS', 'Heart rate device']"
15576,1607.00827,Stavros Nikolopoulos D.,Stavros D. Nikolopoulos and Iosif Polenakis,"Preventing Malware Pandemics in Mobile Devices by Establishing
  Response-time Bounds","13 pages, 33 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the propagation of a malicious software in a network of mobile
devices, which are moving in a specific city area, and establish time bounds
for the activation of a counter-measure, i.e., an antivirus or a cleaner in
order to prevent pandemic. More precisely, given an initial infected population
(mobile devices), we establish upper bounds on the time needed for a
counter-measure to take effect after infection (response-time), in order to
prevent the rest susceptible devices to get infected. Thus, within a period of
time, we guarantee that not all the susceptible devices in the city get
infected and the infected ones get sanitized. In our work, we first propose a
malware propagation model along with a device mobility model and then,
utilizing these models, we develop a simulator that we use to study the spread
of malware in such networks. Finally, we provide experimental results for the
pandemic prevention taken by our simulator for various response-time intervals.
","[{'version': 'v1', 'created': 'Mon, 4 Jul 2016 11:33:41 GMT'}]",2016-07-05,"[['Nikolopoulos', 'Stavros D.', ''], ['Polenakis', 'Iosif', '']]","['Epidemics', 'Malicious software', 'Mobility models', 'Mobile devices', 'Graphs', 'Algorithms', 'Simulation', 'Experimentation']"
15577,1008.4873,Saleh Omari,Saleh Ali K. Al-Omari and Putra Sumari,Spiking Neurons with ASNN Based-Methods for the Neural Block Cipher,"11 pages, 4 Figures, International journal of computer science &
  information Technology","International journal of computer science & information Technology
  (IJCSIT) Vol.2, No.4, August 2010",,,cs.CR cs.NE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Problem statement: This paper examines Artificial Spiking Neural Network
(ASNN) which inter-connects group of artificial neurons that uses a
mathematical model with the aid of block cipher. The aim of undertaken this
research is to come up with a block cipher where by the keys are randomly
generated by ASNN which can then have any variable block length. This will show
the private key is kept and do not have to be exchange to the other side of the
communication channel so it present a more secure procedure of key scheduling.
The process enables for a faster change in encryption keys and a network level
encryption to be implemented at a high speed without the headache of
factorization. Approach: The block cipher is converted in public cryptosystem
and had a low level of vulnerability to attack from brute, and moreover can
able to defend against linear attacks since the Artificial Neural Networks
(ANN) architecture convey non-linearity to the encryption/decryption
procedures. Result: In this paper is present to use the Spiking Neural Networks
(SNNs) with spiking neurons as its basic unit. The timing for the SNNs is
considered and the output is encoded in 1's and 0's depending on the occurrence
or not occurrence of spikes as well as the spiking neural networks use a sign
function as activation function, and present the weights and the filter
coefficients to be adjust, having more degrees of freedom than the classical
neural networks. Conclusion: In conclusion therefore, encryption algorithm can
be deployed in communication and security applications where data transfers are
most crucial. So this paper, the neural block cipher proposed where the keys
are generated by the SNN and the seed is considered the public key which
generates the both keys on both sides In future therefore a new research will
be conducted on the Spiking Neural Network (SNN) impacts on communication.
","[{'version': 'v1', 'created': 'Sat, 28 Aug 2010 14:55:38 GMT'}]",2010-08-31,"[['Al-Omari', 'Saleh Ali K.', ''], ['Sumari', 'Putra', '']]","['Spiking Neural Network', 'Virtual private network', 'IP security', 'Artificial Neural Networks', 'Simple-Data Encryption Standard', 'Encryption and Decryption']"
15578,1306.1916,Kirat Pal Er,"Kirat Pal Singh, Dilip Kumar","Performance Evaluation of Low Power MIPS Crypto Processor based on
  Cryptography Algorithms",,,,,cs.CR cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the design and implementation of low power 32-bit
encrypted and decrypted MIPS processor for Data Encryption Standard (DES),
Triple DES, Advanced Encryption Standard (AES) based on MIPS pipeline
architecture. The organization of pipeline stages has been done in such a way
that pipeline can be clocked at high frequency. Encryption and Decryption
blocks of three standard cryptography algorithms on MIPS processor and
dependency among themselves are explained in detail with the help of a block
diagram. Clock gating technique is used to reduce the power consumption in MIPS
crypto processor. This approach results in processor that meets power
consumption and performance specification for security applications. Proposed
Implementation approach concludes higher system performance while reducing
operating power consumption. Testing results shows that the MIPS crypto
processor operates successfully at a working frequency of 218MHz and a
bandwidth of 664Mbits/s.
","[{'version': 'v1', 'created': 'Sat, 8 Jun 2013 13:18:48 GMT'}]",2013-06-11,"[['Singh', 'Kirat Pal', ''], ['Kumar', 'Dilip', '']]","['Cryptography', 'Datapath', 'Throughput', 'MIPS']"
15579,1505.01958,Yiming Wan,"Yiming Wan, Tamas Keviczky, Michel Verhaegen",Direct identification of fault estimation filter for sensor faults,Extended version of the paper accepted by IFAC Safeprocess2015,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a systematic method to directly identify a sensor fault estimation
filter from plant input/output data collected under fault-free condition. This
problem is challenging, especially when omitting the step of building an
explicit state-space plant model in data-driven design, because the inverse of
the underlying plant dynamics is required and needs to be stable. We show that
it is possible to address this problem by relying on a system-inversion-based
fault estimation filter that is parameterized using identified Markov
parameters. Our novel data-driven approach improves estimation performance by
avoiding the propagation of model reduction errors originating from
identification of the state-space plant model into the designed filter.
Furthermore, it allows additional design freedom to stabilize the obtained
filter under the same stabilizability condition as the existing model-based
system inversion. This crucial property enables its application to sensor
faults in unstable plants, where existing data-driven filter designs could not
be applied so far due to the lack of such stability guarantees (even after
stabilizing the closed-loop system). A numerical simulation example of sensor
faults in an unstable aircraft system illustrates the effectiveness of the
proposed new method.
","[{'version': 'v1', 'created': 'Fri, 8 May 2015 08:52:33 GMT'}]",2015-05-11,"[['Wan', 'Yiming', ''], ['Keviczky', 'Tamas', ''], ['Verhaegen', 'Michel', '']]","['Filter design from data', 'fault estimation', 'system inversion']"
15580,1609.04331,Vadim Kantorov,"Vadim Kantorov, Maxime Oquab, Minsu Cho and Ivan Laptev","ContextLocNet: Context-Aware Deep Network Models for Weakly Supervised
  Localization","Accepted paper at ECCV2016. The website and code is at
  http://www.di.ens.fr/willow/research/contextlocnet",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We aim to localize objects in images using image-level supervision only.
Previous approaches to this problem mainly focus on discriminative object
regions and often fail to locate precise object boundaries. We address this
problem by introducing two types of context-aware guidance models, additive and
contrastive models, that leverage their surrounding context regions to improve
localization. The additive model encourages the predicted object region to be
supported by its surrounding context region. The contrastive model encourages
the predicted object region to be outstanding from its surrounding context
region. Our approach benefits from the recent success of convolutional neural
networks for object recognition and extends Fast R-CNN to weakly supervised
object localization. Extensive experimental evaluation on the PASCAL VOC 2007
and 2012 benchmarks shows hat our context-aware approach significantly improves
weakly supervised localization and detection.
","[{'version': 'v1', 'created': 'Wed, 14 Sep 2016 16:17:03 GMT'}]",2016-09-15,"[['Kantorov', 'Vadim', ''], ['Oquab', 'Maxime', ''], ['Cho', 'Minsu', ''], ['Laptev', 'Ivan', '']]","['Object recognition', 'Object detection', 'Weakly supervisedobject localization', 'Context', 'Convolutional neural networks']"
15581,1011.0148,LeRoy Johnson Professor,L. F. Johnson,"Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci","11 pages, 1 table This paper illustrates the importance of
  considering storage size when running experiments and that the results of
  expermential comparsion of algorithms in a well known paper are at best
  unreliable because of register overflow. The two presented algorithms are
  concise but readable",,,,cs.DM cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two very fast and simple O(lg n) algorithms for individual Fibonacci numbers
are given and compared to competing algorithms. A simple O(lg n) recursion is
derived that can also be applied to Lucas. A formula is given to estimate the
largest n, where F_n does not overflow the implementation's data type. The
danger of timing runs on input that is too large for the computer
representation leads to false research results.
","[{'version': 'v1', 'created': 'Sun, 31 Oct 2010 12:15:27 GMT'}]",2010-11-02,"[['Johnson', 'L. F.', '']]","['algorithms', 'Fibonacci', 'Lucas numbers', 'recurrence relations', 'iteration', 'software engineering']"
15582,1208.3486,Venkata Ramana v,"V. Venkata Ramana, A. Rama Mohan Reddy, K. Chandra Sekaran",Bio Inspired Approach to Secure Routing in MANETs,,,,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper, the author explore the challenges with respect to the security
aspect in MANETs and propose a new approach which makes use of a bio-inspired
methodology. This paper elaborates various attacks which can be perpetrated on
MANETs and current solutions to the aforementioned problems, and then it
describes a Bio-Inspired Method which could be a possible solution to security
issues in MANETs.
","[{'version': 'v1', 'created': 'Tue, 14 Aug 2012 05:09:14 GMT'}]",2012-08-20,"[['Ramana', 'V. Venkata', ''], ['Reddy', 'A. Rama Mohan', ''], ['Sekaran', 'K. Chandra', '']]","['MANET', 'Bio-inspired approach', 'Agents and Secure Routing']"
15583,1707.09871,Yichen Pan,"Shitao Tang, Yichen Pan","Feature Extraction via Recurrent Random Deep Ensembles and its
  Application in Gruop-level Happiness Estimation",,,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel ensemble framework to extract highly
discriminative feature representation of image and its application for
group-level happpiness intensity prediction in wild. In order to generate
enough diversity of decisions, n convolutional neural networks are trained by
bootstrapping the training set and extract n features for each image from them.
A recurrent neural network (RNN) is then used to remember which network
extracts better feature and generate the final feature representation for one
individual image. Several group emotion models (GEM) are used to aggregate face
fea- tures in a group and use parameter-optimized support vector regressor
(SVR) to get the final results. Through extensive experiments, the great
effectiveness of the proposed recurrent random deep ensembles (RRDE) is
demonstrated in both structural and decisional ways. The best result yields a
0.55 root-mean-square error (RMSE) on validation set of HAPPEI dataset,
significantly better than the baseline of 0.78.
","[{'version': 'v1', 'created': 'Mon, 24 Jul 2017 08:16:43 GMT'}]",2017-08-01,"[['Tang', 'Shitao', ''], ['Pan', 'Yichen', '']]","['Ensemble learning', 'Emotion Analysis', 'ConvolutionalNeural Network', 'Recurrent Neural Network']"
15584,1008.2345,Fausto Montoya,"A.B. Orue, G. Alvarez, A. Guerra, G. Pastor, M. Romera, and F. Montoya","Trident, a new pseudo random number generator based on coupled chaotic
  maps","4 figures, 10 pages. Submitted to the 3rd Int. Workshop on
  Computational Intelligence in Security for Information Systems (CISIS'10),
  Leon (Spain), November 2010",,,,cs.CR physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article describes a new family of cryptographically secure pseudorandom
number generators, based on coupled chaotic maps, that will serve as keystream
in a stream cipher. The maps are a modification of a piecewise linear map, by
dynamic changing of the coefficient values and perturbing its lesser
significant bits.
","[{'version': 'v1', 'created': 'Fri, 13 Aug 2010 15:47:30 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Aug 2010 19:48:17 GMT'}]",2010-08-18,"[['Orue', 'A. B.', ''], ['Alvarez', 'G.', ''], ['Guerra', 'A.', ''], ['Pastor', 'G.', ''], ['Romera', 'M.', ''], ['Montoya', 'F.', '']]","['Chaos', 'stream cipher', 'PRNG']"
15585,1505.06807,Ameet Talwalkar,"Xiangrui Meng, Joseph Bradley, Burak Yavuz, Evan Sparks, Shivaram
  Venkataraman, Davies Liu, Jeremy Freeman, DB Tsai, Manish Amde, Sean Owen,
  Doris Xin, Reynold Xin, Michael J. Franklin, Reza Zadeh, Matei Zaharia, Ameet
  Talwalkar",MLlib: Machine Learning in Apache Spark,,,,,cs.LG cs.DC cs.MS stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Apache Spark is a popular open-source platform for large-scale data
processing that is well-suited for iterative machine learning tasks. In this
paper we present MLlib, Spark's open-source distributed machine learning
library. MLlib provides efficient functionality for a wide range of learning
settings and includes several underlying statistical, optimization, and linear
algebra primitives. Shipped with Spark, MLlib supports several languages and
provides a high-level API that leverages Spark's rich ecosystem to simplify the
development of end-to-end machine learning pipelines. MLlib has experienced a
rapid growth due to its vibrant open-source community of over 140 contributors,
and includes extensive documentation to support further growth and to let users
quickly get up to speed.
","[{'version': 'v1', 'created': 'Tue, 26 May 2015 05:12:23 GMT'}]",2015-05-27,"[['Meng', 'Xiangrui', ''], ['Bradley', 'Joseph', ''], ['Yavuz', 'Burak', ''], ['Sparks', 'Evan', ''], ['Venkataraman', 'Shivaram', ''], ['Liu', 'Davies', ''], ['Freeman', 'Jeremy', ''], ['Tsai', 'DB', ''], ['Amde', 'Manish', ''], ['Owen', 'Sean', ''], ['Xin', 'Doris', ''], ['Xin', 'Reynold', ''], ['Franklin', 'Michael J.', ''], ['Zadeh', 'Reza', ''], ['Zaharia', 'Matei', ''], ['Talwalkar', 'Ameet', '']]","['Scalable Machine Learning', 'Distributed Algorithms', 'Apache Spark']"
15586,1710.01873,Mehdi Shafiei,"Shiva Geraee, Hamed Mohammadbagherpoor, Mehdi Shafiei, Majid
  Valizadehdeh, Farshad Montazeri, Mohammad Reza Feyzi","A Modified DTC with Capability of Regenerative Braking Energy in BLDC
  driven Electric Vehicles Using Adaptive Control Theory",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper represents a novel regenerative braking approach for the Electric
Vehicles. The proposed method solves the short-range problem which is
corresponding to the charge of the battery pack. The DTC switching algorithm
has been modified to recover the electrical energy from Electrical Vehicle
(EV), driven by Brushless DC motor, without using the additional power
converter or the other electrical energy storage devices. During regenerative
braking process, different switching pattern is applied to the inverter to
convert the mechanical energy to the electrical energy through the reverse
diodes. This switching pattern is different from the normal operation due to
the special arrangement of voltage vectors which is considered to convert the
mechanical energy to electrical energy. The state of charge of the battery is
used as a performance indicator of the method. Simultaneously, a model
reference adaptive system has been designed to tune the system parameters.
Several simulations are carried out to validate the performance and
effectiveness of the proposed methods. The results show the high capability and
performance of the designed method.
","[{'version': 'v1', 'created': 'Thu, 5 Oct 2017 03:36:55 GMT'}]",2017-10-06,"[['Geraee', 'Shiva', ''], ['Mohammadbagherpoor', 'Hamed', ''], ['Shafiei', 'Mehdi', ''], ['Valizadehdeh', 'Majid', ''], ['Montazeri', 'Farshad', ''], ['Feyzi', 'Mohammad Reza', '']]","['Electric Vehicle', 'Regenerative Braking', 'Brushless DC Motor', 'Direct Torque']"
15587,1407.3969,Anna Maria Massone,"Giorgio Ricca, Mauro C. Beltrametti, Anna Maria Massone",An iterative approach to Hough transform without re-voting,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many bone shapes in the human skeleton are characterized by profiles that can
be associated to equations of algebraic curves. Fixing the parameters in the
curve equation, by means of a classical pattern recognition procedure like the
Hough transform technique, it is then possible to associate an equation to a
specific bone profile. However, most skeleton districts are more accurately
described by piecewise defined curves. This paper utilizes an iterative
approach of the Hough transform without re-voting, to provide an efficient
procedure for describing the profile of a bone in the human skeleton as a
collection of different but continuously attached curves.
","[{'version': 'v1', 'created': 'Tue, 15 Jul 2014 12:56:35 GMT'}]",2014-07-16,"[['Ricca', 'Giorgio', ''], ['Beltrametti', 'Mauro C.', ''], ['Massone', 'Anna Maria', '']]","['Hough transform', 'algebraic plane curves', 'image processing']"
15588,1403.7102,Kirill Dyagilev,Kirill Dyagilev and Elad Yom-Tov,"Echo chamber amplification and disagreement effects in the political
  activity of Twitter users",,,,,cs.SI cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online social networks have emerged as a significant platform for political
discourse. In this paper we investigate what affects the level of participation
of users in the political discussion. Specifically, are users more likely to be
active when they are surrounded by like-minded individuals, or, alternatively,
when their environment is heterogeneous, and so their messages might be carried
to people with differing views. To answer this question, we analyzed the
activity of about 200K Twitter users who expressed explicit support for one of
the candidates of the 2012 US presidential election. We quantified the level of
political activity (PA) of users by the fraction of political tweets in their
posts, and analyzed the relationship between PA and measures of the users'
political environment. These measures were designed to assess the
likemindedness, e.g., the fraction of users with similar political views, of
their virtual and geographic environments. Our results showed that high PA is
usually obtained by users in politically balanced virtual environment. This is
in line with the disagreement theory of political science that states that a
user's PA is invigorated by the disagreement with their peers. Our results also
show that users surrounded by politically like-minded virtual peers tend to
have low PA. This observation contradicts the echo chamber amplification theory
that states that a person tends to be more politically active when surrounded
by like-minded people. Finally, we observe that the likemindedness of the
geographical environment does not affect PA. We thus conclude that PA of users
is independent of the likemindedness of their geographical environment and is
correlated with likemindedness of their virtual environment. The exact form of
correlation manifests the phenomenon of disagreement and, in a majority of
settings, contradicts the echo chamber amplification theory.
","[{'version': 'v1', 'created': 'Wed, 19 Mar 2014 16:08:58 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Jun 2014 14:03:30 GMT'}]",2014-06-18,"[['Dyagilev', 'Kirill', ''], ['Yom-Tov', 'Elad', '']]","['Twitter', 'echo chamber', 'disagreement effect', 'politics']"
15589,1505.06146,Andreas Galanis,Andreas Galanis and Leslie Ann Goldberg,"The complexity of approximately counting in 2-spin systems on
  $k$-uniform bounded-degree hypergraphs",,,,,cs.CC cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the most important recent developments in the complexity of
approximate counting is the classification of the complexity of approximating
the partition functions of antiferromagnetic 2-spin systems on bounded-degree
graphs. This classification is based on a beautiful connection to the so-called
uniqueness phase transition from statistical physics on the infinite
$\Delta$-regular tree. Our objective is to study the impact of this
classification on unweighted 2-spin models on $k$-uniform hypergraphs. As has
already been indicated by Yin and Zhao, the connection between the uniqueness
phase transition and the complexity of approximate counting breaks down in the
hypergraph setting. Nevertheless, we show that for every non-trivial symmetric
$k$-ary Boolean function $f$ there exists a degree bound $\Delta_0$ so that for
all $\Delta \geq \Delta_0$ the following problem is NP-hard: given a
$k$-uniform hypergraph with maximum degree at most $\Delta$, approximate the
partition function of the hypergraph 2-spin model associated with $f$. It is
NP-hard to approximate this partition function even within an exponential
factor. By contrast, if $f$ is a trivial symmetric Boolean function (e.g., any
function $f$ that is excluded from our result), then the partition function of
the corresponding hypergraph 2-spin model can be computed exactly in polynomial
time.
","[{'version': 'v1', 'created': 'Fri, 22 May 2015 17:00:46 GMT'}, {'version': 'v2', 'created': 'Sat, 6 Jun 2015 15:48:19 GMT'}, {'version': 'v3', 'created': 'Tue, 22 Sep 2015 16:54:17 GMT'}, {'version': 'v4', 'created': 'Mon, 20 Jun 2016 13:53:18 GMT'}]",2016-06-21,"[['Galanis', 'Andreas', ''], ['Goldberg', 'Leslie Ann', '']]","['Approximate counting', 'bounded-degree hypergraphs', '2-spin systems', 'counting constraintsatisfaction']"
15590,1206.6382,Animashree Anandkumar,"Majid Janzamin (UC Irvine), Animashree Anandkumar (UC Irvine)","High-Dimensional Covariance Decomposition into Sparse Markov and
  Independence Domains","Appears in Proceedings of the 29th International Conference on
  Machine Learning (ICML 2012)",,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a novel framework incorporating a combination of
sparse models in different domains. We posit the observed data as generated
from a linear combination of a sparse Gaussian Markov model (with a sparse
precision matrix) and a sparse Gaussian independence model (with a sparse
covariance matrix). We provide efficient methods for decomposition of the data
into two domains, \viz Markov and independence domains. We characterize a set
of sufficient conditions for identifiability and model consistency. Our
decomposition method is based on a simple modification of the popular
$\ell_1$-penalized maximum-likelihood estimator ($\ell_1$-MLE). We establish
that our estimator is consistent in both the domains, i.e., it successfully
recovers the supports of both Markov and independence models, when the number
of samples $n$ scales as $n = \Omega(d^2 \log p)$, where $p$ is the number of
variables and $d$ is the maximum node degree in the Markov model. Our
conditions for recovery are comparable to those of $\ell_1$-MLE for consistent
estimation of a sparse Markov model, and thus, we guarantee successful
high-dimensional estimation of a richer class of models under comparable
conditions. Our experiments validate these results and also demonstrate that
our models have better inference accuracy under simple algorithms such as loopy
belief propagation.
","[{'version': 'v1', 'created': 'Wed, 27 Jun 2012 19:59:59 GMT'}]",2012-07-03,"[['Janzamin', 'Majid', '', 'UC Irvine'], ['Anandkumar', 'Animashree', '', 'UC Irvine']]","['High-dimensional covariance estimation', 'sparse graphical model selection', 'sparse covariance']"
15591,1304.5554,Adrian Groza,Adrian Groza and Sergiu Indrie,Enacting Social Argumentative Machines in Semantic Wikipedia,UBICC 2011,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This research advocates the idea of combining argumentation theory with the
social web technology, aiming to enact large scale or mass argumentation. The
proposed framework allows mass-collaborative editing of structured arguments in
the style of semantic wikipedia. The long term goal is to apply the abstract
machinery of argumentation theory to more practical applications based on human
generated arguments, such as deliberative democracy, business negotiation, or
self-care. The ARGNET system was developed based on ther Semantic MediaWiki
framework and on the Argument Interchange Format (AIF) ontology.
","[{'version': 'v1', 'created': 'Fri, 19 Apr 2013 21:36:59 GMT'}]",2013-04-23,"[['Groza', 'Adrian', ''], ['Indrie', 'Sergiu', '']]","['mass argumentation', 'AIF ontology', 'semantic wikis']"
15592,1605.00686,Mayank Kejriwal,Mayank Kejriwal,"Adaptive Candidate Generation for Scalable Edge-discovery Tasks on Data
  Graphs","8 pages,published at MLG workshop at KDD'17",,,,cs.AI cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several `edge-discovery' applications over graph-based data models are known
to have worst-case quadratic time complexity in the nodes, even if the
discovered edges are sparse. One example is the generic link discovery problem
between two graphs, which has invited research interest in several communities.
Specific versions of this problem include link prediction in social networks,
ontology alignment between metadata-rich RDF data, approximate joins, and
entity resolution between instance-rich data. As large datasets continue to
proliferate, reducing quadratic complexity to make the task practical is an
important research problem. Within the entity resolution community, the problem
is commonly referred to as blocking. A particular class of learnable blocking
schemes is known as Disjunctive Normal Form (DNF) blocking schemes, and has
emerged as state-of-the art for homogeneous (i.e. same-schema) tabular data.
Despite the promise of these schemes, a formalism or learning framework has not
been developed for them when input data instances are generic, attributed
graphs possessing both node and edge heterogeneity. With such a development,
the complexity-reducing scope of DNF schemes becomes applicable to a variety of
problems, including entity resolution and type alignment between heterogeneous
graphs, and link prediction in networks represented as attributed graphs. This
paper presents a graph-theoretic formalism for DNF schemes, and investigates
their learnability in an optimization framework. We also briefly describe an
empirical case study encapsulating some of the principles in this paper.
","[{'version': 'v1', 'created': 'Mon, 2 May 2016 20:51:43 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Jul 2017 00:47:21 GMT'}]",2017-07-04,"[['Kejriwal', 'Mayank', '']]","['Heterogeneity', 'Link Discovery', 'DNF Schemes', 'Graph Models', 'Attributed Graphs', 'Learnability', 'Machine Learning', 'Blocking']"
15593,1111.5640,Seifedine Kadry Seifedine Kadry,Seifedine Kadry,A New Proposed Technique to Improve Software Regression Testing Cost,,"International Journal of Security and Its Applications Vol. 5 No.
  3, July, 2011",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, we describe the regression test process to test and verify
the changes made on software. A developed technique use the automation test
based on decision tree and test selection process in order to reduce the
testing cost is given. The developed technique is applied to a practical case
and the result show its improvement.
","[{'version': 'v1', 'created': 'Wed, 23 Nov 2011 22:31:13 GMT'}]",2011-11-28,"[['Kadry', 'Seifedine', '']]","['software maintenance', 'software test', 'test automation', 'regression']"
15594,0803.3230,Avik Chaudhuri,"Avik Chaudhuri, Prasad Naldurg, and Sriram Rajamani",A Type System for Data-Flow Integrity on Windows Vista,,,,,cs.CR cs.OS cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Windows Vista operating system implements an interesting model of
multi-level integrity. We observe that in this model, trusted code can be
blamed for any information-flow attack; thus, it is possible to eliminate such
attacks by static analysis of trusted code. We formalize this model by
designing a type system that can efficiently enforce data-flow integrity on
Windows Vista. Typechecking guarantees that objects whose contents are
statically trusted never contain untrusted values, regardless of what untrusted
code runs in the environment. Some of Windows Vista's runtime access checks are
necessary for soundness; others are redundant and can be optimized away.
","[{'version': 'v1', 'created': 'Fri, 21 Mar 2008 21:28:16 GMT'}, {'version': 'v2', 'created': 'Thu, 8 May 2008 02:55:57 GMT'}]",2008-12-18,"[['Chaudhuri', 'Avik', ''], ['Naldurg', 'Prasad', ''], ['Rajamani', 'Sriram', '']]","['dynamic access control', 'data-flow integrity', 'hybridtype system', 'explicit substitution']"
15595,1609.05180,Shuhan Wang,"Shuhan Wang, Erik Andersen","Grammatical Templates: Improving Text Difficulty Evaluation for Language
  Learners",,"The 26th International Conference on Computational Linguistics
  (COLING), 2016",,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Language students are most engaged while reading texts at an appropriate
difficulty level. However, existing methods of evaluating text difficulty focus
mainly on vocabulary and do not prioritize grammatical features, hence they do
not work well for language learners with limited knowledge of grammar. In this
paper, we introduce grammatical templates, the expert-identified units of
grammar that students learn from class, as an important feature of text
difficulty evaluation. Experimental classification results show that
grammatical template features significantly improve text difficulty prediction
accuracy over baseline readability features by 7.4%. Moreover, we build a
simple and human-understandable text difficulty evaluation approach with 87.7%
accuracy, using only 5 grammatical template features.
","[{'version': 'v1', 'created': 'Fri, 16 Sep 2016 19:12:30 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Feb 2017 22:04:47 GMT'}]",2017-02-17,"[['Wang', 'Shuhan', ''], ['Andersen', 'Erik', '']]","['text difficulty evaluation', 'education', 'grammatical templates', 'language learners']"
15596,1705.07747,Sandy Engelhardt,"Darko Kati\'c, Maria Maleshkova, Sandy Engelhardt, Ivo Wolf, Keno
  M\""arz, Lena Maier-Hein, Marco Nolden, Martin Wagner, Hannes Kenngott, Beat
  Peter M\""uller-Stich, R\""udiger Dillmann, Stefanie Speidel","What does it all mean? Capturing Semantics of Surgical Data and
  Algorithms with Ontologies","4 pages, 1 figure, Surgical Data Science Workshop, Heidelberg, June
  20th, 2016",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Every year approximately 234 million major surgeries are performed, leading
to plentiful, highly diverse data. This is accompanied by a matching number of
novel algorithms for the surgical domain. To garner all benefits of surgical
data science it is necessary to have an unambiguous, shared understanding of
algorithms and data. This includes inputs and outputs of algorithms and thus
their function, but also the semantic content, i.e. meaning of data such as
patient parameters. We therefore propose the establishment of a new ontology
for data and algorithms in surgical data science. Such an ontology can be used
to provide common data sets for the community, encouraging sharing of knowledge
and comparison of algorithms on common data. We hold that this is a necessary
foundation towards new methods for applications such as semantic-based content
retrieval and similarity measures and that it is overall vital for the future
of surgical data science.
","[{'version': 'v1', 'created': 'Mon, 22 May 2017 13:53:13 GMT'}]",2017-05-23,"[['Katić', 'Darko', ''], ['Maleshkova', 'Maria', ''], ['Engelhardt', 'Sandy', ''], ['Wolf', 'Ivo', ''], ['März', 'Keno', ''], ['Maier-Hein', 'Lena', ''], ['Nolden', 'Marco', ''], ['Wagner', 'Martin', ''], ['Kenngott', 'Hannes', ''], ['Müller-Stich', 'Beat Peter', ''], ['Dillmann', 'Rüdiger', ''], ['Speidel', 'Stefanie', '']]","['Ontology', 'Semantic', 'Knowledge Engineering', 'Surgery']"
15597,1212.2531,Kabeer Mohammed,"Kabeer Mohammed, Dr.Bhaskara Reddy",Enhanced Image Analysis Using Cached Mobile Robots,6 Pages one flowchart,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the field of Artificial intelligence Image processing plays a vital role
in Decision making. Nowadays Mobile robots work as a Network sharing
Centralized Database. All Image inputs are compared against this database and
decision is made. In some cases the Centralized database is in other side of
the globe and Mobile robots compare Input image through satellite link this
sometime results in delays in decision making which may result in castrophe.
This Research paper is about how to make image processing in mobile robots less
time consuming and fast decision making. This research paper compares search
techniques employed currently and optimum search method which we are going to
state. Nowadays Mobile robots are extensively used in environments which are
dangerous to human beings. In this dangerous situations quick Decision making
makes the difference between Hit and Miss this can also results in Day to day
tasks performed by Mobile robots Successful or Failure.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2012 16:45:11 GMT'}]",2015-03-13,"[['Mohammed', 'Kabeer', ''], ['Reddy', 'Dr. Bhaskara', '']]","['Centralized database', 'Satellite link', 'Cache', 'Seek Time', 'sensors']"
15598,1511.09360,Faisal Abu-Khzam,Faisal N. Abu-Khzam,On the Complexity of Multi-Parameterized Cluster Editing,,,,,cs.DS cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Cluster Editing problem seeks a transformation of a given undirected
graph into a disjoint union of cliques via a minimum number of edge additions
or deletions. A multi-parameterized version of the problem is studied,
featuring a number of input parameters that bound the amount of both
edge-additions and deletions per single vertex, as well as the size of a
clique-cluster. We show that the problem remains NP-hard even when only one
edge can be deleted and at most two edges can be added per vertex. However, the
new formulation allows us to solve Cluster Editing (exactly) in polynomial time
when the number of edge-edit operations per vertex is smaller than half the
minimum cluster size. In other words, Correlation Clustering can be solved
efficiently when the number of false positives/negatives per single data
element is expected to be small compared to the minimum cluster size. As a
byproduct, we obtain a kernelization algorithm that delivers linear-size
kernels when the two edge-edit bounds are small constants.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2015 15:56:47 GMT'}]",2015-12-01,"[['Abu-Khzam', 'Faisal N.', '']]","['Cluster Editing', 'Correlation Clustering', 'Multi-parameterization', 'Kernelization']"
15599,1511.04003,Dmitry Kislyuk,"Dmitry Kislyuk, Yuchen Liu, David Liu, Eric Tzeng, Yushi Jing","Human Curation and Convnets: Powering Item-to-Item Recommendations on
  Pinterest",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents Pinterest Related Pins, an item-to-item recommendation
system that combines collaborative filtering with content-based ranking. We
demonstrate that signals derived from user curation, the activity of users
organizing content, are highly effective when used in conjunction with
content-based ranking. This paper also demonstrates the effectiveness of visual
features, such as image or object representations learned from convnets, in
improving the user engagement rate of our item-to-item recommendation system.
","[{'version': 'v1', 'created': 'Thu, 12 Nov 2015 18:55:20 GMT'}]",2015-11-13,"[['Kislyuk', 'Dmitry', ''], ['Liu', 'Yuchen', ''], ['Liu', 'David', ''], ['Tzeng', 'Eric', ''], ['Jing', 'Yushi', '']]","['“kayak”', '“lake”', '“sunset”']"
15600,1401.6533,Kezhi Li,Kezhi Li and Shuang Cong,A Robust Compressive Quantum State Tomography Algorithm Using ADMM,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The possible state space dimension increases exponentially with respect to
the number of qubits. This feature makes the quantum state tomography expensive
and impractical for identifying the state of merely several qubits. The recent
developed approach, compressed sensing, gives us an alternative to estimate the
quantum state with fewer measurements. It is proved that the estimation then
can be converted to a convex optimization problem with quantum mechanics
constraints. In this paper we present an alternating augmented Lagrangian
method for quantum convex optimization problem aiming for recovering pure or
near pure quantum states corrupted by sparse noise given observables and the
expectation values of the measurements. The proposed algorithm is much faster,
robust to outlier noises (even very large for some entries) and can solve the
reconstruction problem distributively. The simulations verify the superiority
of the proposed algorithm and compare it to the conventional least square and
compressive quantum tomography using Dantzig method.
","[{'version': 'v1', 'created': 'Sat, 25 Jan 2014 14:03:30 GMT'}]",2014-01-28,"[['Li', 'Kezhi', ''], ['Cong', 'Shuang', '']]","['Quantum state tomography', 'ADMM', 'rank minimization', 'convex optimization andregularization']"
15601,1409.2697,Sanjaya Sahu Mr,"Sanjaya Kumar Sahu, T. V. Dixit and D.D. Neema","Particle Swarm Optimized Fuzzy Controller for Indirect Vector Control of
  Multilevel Inverter Fed Induction Motor","9 pages, published in Volume 11, issue 4, july 2014, IJCSI","Volume 11, issue 4, july 2014, IJCSI",,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Particle Swarm Optimized (PSO) fuzzy controller has been proposed for
indirect vector control of induction motor. In this proposed scheme a Neutral
Point Clamped (NPC) multilevel inverter is used and hysteresis current control
technique has been adopted for switching the IGBTs. A Mamdani type fuzzy
controller is used in place of conventional PI controller. To ensure better
performance of fuzzy controller all parameters such as membership functions,
normalizing and de-normalizing parameters are optimized using PSO. The
performance of proposed controller is investigated under various load and speed
conditions. The simulation results show its stability and robustness for high
performance derives applications.
","[{'version': 'v1', 'created': 'Fri, 5 Sep 2014 19:49:04 GMT'}]",2014-09-10,"[['Sahu', 'Sanjaya Kumar', ''], ['Dixit', 'T. V.', ''], ['Neema', 'D. D.', '']]","['Multilevel Inverter', 'Hysteresis Current Control', 'Particle Swarm Optimization (PSO)', 'Fuzzy Logic Controller (FLC)']"
15602,1205.1141,Vikas Dongre,"Vikas J Dongre, Ramkrishna V Yenkar, Vijay H Mankar","Interactive Learning through Hands-on Practice using Electronic Mini -
  Lab (EML): a Case Study","6 pages,1 Table, 7 Figures Journal paper","Journal of Engineering, Science & Management Education (JESME)
  Bhopal, India, Vol-5 Issue-I (Jan-Mar 2012) (357-362) www.nitttrbhopal.ac.in",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  -- In this paper, a new approach to impart practical skill based technical
education is presented in comprehensive manner. An Electronic Mini-Lab (EML) is
devised containing basic design and test instruments with electronic
components, ICs, connecting wires and battery. Using the EML, students perform
various formal and informal digital and analog circuit practicals as well as
design prototype of projects. This gives them a hands-on experience, sense of
belonging and sense of cooperation. The EML is useful for performing many
practicals of various subjects. The EML also reduces the workload of college
laboratories. Students have their own individual EML at their disposal anytime,
which can be used to design hobby projects as a fun too. This will make them
skilled engineers. This provides tremendous benefits in teaching learning
process. It also boosted the interest, confidence of students and teachers.
Incorporating active/ cooperative learning into traditional instruction can be
a useful pedagogical tool to help students to perform practicals and project
work any time anywhere. This concept is remarkably simple and cost effective
but the dividends can be profound.
","[{'version': 'v1', 'created': 'Sat, 5 May 2012 14:36:25 GMT'}]",2012-05-08,"[['Dongre', 'Vikas J', ''], ['Yenkar', 'Ramkrishna V', ''], ['Mankar', 'Vijay H', '']]","['Electronics Mini-Lab (EML)', 'skill based education', 'hands on experience', 'interactive learning', 'participative learning']"
15603,1307.2977,Qiwei Lu,"Qiwei Lu, Wenchao Huang, Xudong Gong, Xingfu Wang, Yan Xiong, and
  Fuyou Miao","A Secure Distributed Authentication scheme based on CRT-VSS and Trusted
  Computing in MANET",under submission,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rapid development of MANET, secure and practical authentication is
becoming increasingly important. The existing works perform the research from
two aspects, i.e., (a)secure key division and distributed storage, (b)secure
distributed authentication. But there still exist several unsolved problems.
Specifically, it may suffer from cheating problems and fault authentication
attack, which can result in authentication failure and DoS attack towards
authentication service. Besides, most existing schemes are not with
satisfactory efficiency due to exponential arithmetic based on Shamir's scheme.
In this paper, we explore the property of verifiable secret sharing(VSS)
schemes with Chinese Remainder Theorem (CRT), then propose a secret key
distributed storage scheme based on CRT-VSS and trusted computing for MANET.
Specifically, we utilize trusted computing technology to solve two existing
cheating problems in secret sharing area before. After that, we do the analysis
of homomorphism property with CRT-VSS and design the corresponding
shares-product sharing scheme with better concision. On such basis, a secure
distributed Elliptic Curve-Digital Signature Standard signature (ECC-DSS)
authentication scheme based on CRT-VSS scheme and trusted computing is
proposed. Furthermore, as an important property of authentication scheme, we
discuss the refreshing property of CRT-VSS and do thorough comparisons with
Shamir's scheme. Finally, we provide formal guarantees towards our schemes
proposed in this paper.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2013 05:35:28 GMT'}]",2013-07-12,"[['Lu', 'Qiwei', ''], ['Huang', 'Wenchao', ''], ['Gong', 'Xudong', ''], ['Wang', 'Xingfu', ''], ['Xiong', 'Yan', ''], ['Miao', 'Fuyou', '']]","['secret sharing', 'trusted computing', 'Chinese Remainder Theorem', 'distributed authentication', 'CSP security model']"
15604,1603.06785,Krzysztof Wo{\l}k,"Krzysztof Wo{\l}k, Emilia Rejmund, Krzysztof Marasek","Multi-domain machine translation enhancements by parallel data
  extraction from comparable corpora","parallel corpus, Polish, English, machine learning, comparable
  corpora, NLP. in Gruszczy\'nska, Ewa; Le\'nko-Szyma\'nska, Agnieszka, red.
  (2016). Polskoj\k{e}zyczne korpusy r\'ownoleg{\l}e. Polish-language Parallel
  Corpora. Warszawa: Instytut Lingwistyki Stosowanej. ISBN: 978-83-935320-4",,,,cs.CL stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parallel texts are a relatively rare language resource, however, they
constitute a very useful research material with a wide range of applications.
This study presents and analyses new methodologies we developed for obtaining
such data from previously built comparable corpora. The methodologies are
automatic and unsupervised which makes them good for large scale research. The
task is highly practical as non-parallel multilingual data occur much more
frequently than parallel corpora and accessing them is easy, although parallel
sentences are a considerably more useful resource. In this study, we propose a
method of automatic web crawling in order to build topic-aligned comparable
corpora, e.g. based on the Wikipedia or Euronews.com. We also developed new
methods of obtaining parallel sentences from comparable data and proposed
methods of filtration of corpora capable of selecting inconsistent or only
partially equivalent translations. Our methods are easily scalable to other
languages. Evaluation of the quality of the created corpora was performed by
analysing the impact of their use on statistical machine translation systems.
Experiments were presented on the basis of the Polish-English language pair for
texts from different domains, i.e. lectures, phrasebooks, film dialogues,
European Parliament proceedings and texts contained medicines leaflets. We also
tested a second method of creating parallel corpora based on data from
comparable corpora which allows for automatically expanding the existing corpus
of sentences about a given domain on the basis of analogies found between them.
It does not require, therefore, having past parallel resources in order to
train a classifier.
","[{'version': 'v1', 'created': 'Tue, 22 Mar 2016 13:34:28 GMT'}]",2016-03-23,"[['Wołk', 'Krzysztof', ''], ['Rejmund', 'Emilia', ''], ['Marasek', 'Krzysztof', '']]","['parallel corpus', 'Polish', 'English', 'machine learning', 'comparable corpora', 'NLP']"
15605,1407.6498,Reza Azad,"Reza Azad, Babak Azad, Hamid Reza Shayegh","Real-Time and Efficient Method for Accuracy Enhancement of Edge Based
  License Plate Recognition System","2013 First International Conference on computer, Information
  Technology and Digital Media. arXiv admin note: substantial text overlap with
  arXiv:1407.6321",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  License Plate Recognition plays an important role on the traffic monitoring
and parking management. Administration and restriction of those transportation
tools for their better service becomes very essential. In this paper, a fast
and real time method has an appropriate application to find plates that the
plat has tilt and the picture quality is poor. In the proposed method, at the
beginning, the image is converted into binary mode with use of adaptive
threshold. And with use of edge detection and morphology operation, plate
number location has been specified and if the plat has tilt; its tilt is
removed away. Then its characters are distinguished using image processing
techniques. Finally, K Nearest Neighbour (KNN) classifier was used for
character recognition. This method has been tested on available data set that
has different images of the background, considering distance, and angel of view
so that the correct extraction rate of plate reached at 98% and character
recognition rate achieved at 99.12%. Further we tested our character
recognition stage on Persian vehicle data set and we achieved 99% correct
recognition rate.
","[{'version': 'v1', 'created': 'Thu, 24 Jul 2014 09:02:16 GMT'}]",2014-07-25,"[['Azad', 'Reza', ''], ['Azad', 'Babak', ''], ['Shayegh', 'Hamid Reza', '']]","['license plate recognition; Adaptive threshold', 'Edge detection', 'Mathematical morphology', 'KNN classifier']"
15606,1707.09183,Pablo Hernandez-Leal,"Pablo Hernandez-Leal, Michael Kaisers, Tim Baarslag and Enrique Munoz
  de Cote","A Survey of Learning in Multiagent Environments: Dealing with
  Non-Stationarity","64 pages, 7 figures. Under review since November 2016",,,,cs.MA cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The key challenge in multiagent learning is learning a best response to the
behaviour of other agents, which may be non-stationary: if the other agents
adapt their strategy as well, the learning target moves. Disparate streams of
research have approached non-stationarity from several angles, which make a
variety of implicit assumptions that make it hard to keep an overview of the
state of the art and to validate the innovation and significance of new works.
This survey presents a coherent overview of work that addresses
opponent-induced non-stationarity with tools from game theory, reinforcement
learning and multi-armed bandits. Further, we reflect on the principle
approaches how algorithms model and cope with this non-stationarity, arriving
at a new framework and five categories (in increasing order of sophistication):
ignore, forget, respond to target models, learn models, and theory of mind. A
wide range of state-of-the-art algorithms is classified into a taxonomy, using
these categories and key characteristics of the environment (e.g.,
observability) and adaptation behaviour of the opponents (e.g., smooth,
abrupt). To clarify even further we present illustrative variations of one
domain, contrasting the strengths and limitations of each category. Finally, we
discuss in which environments the different approaches yield most merit, and
point to promising avenues of future research.
","[{'version': 'v1', 'created': 'Fri, 28 Jul 2017 10:49:41 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Mar 2019 20:17:29 GMT'}]",2019-03-13,"[['Hernandez-Leal', 'Pablo', ''], ['Kaisers', 'Michael', ''], ['Baarslag', 'Tim', ''], ['de Cote', 'Enrique Munoz', '']]","['Multiagent learning', 'reinforcement learning', 'multi-armed bandits', 'gametheory']"
15607,1301.0801,Loet Leydesdorff,"Loet Leydesdorff, Caroline Wagner, Han Woo Park, and Jonathan Adams",International Collaboration in Science: The Global Map and the Network,"El Profesional de la Informaci\'on (2013, in press)",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The network of international co-authorship relations has been dominated by
certain European nations and the USA, but this network is rapidly expanding at
the global level. Between 40 and 50 countries appear in the center of the
international network in 2011, and almost all (201) nations are nowadays
involved in international collaboration. In this brief communication, we
present both a global map with the functionality of a Google Map (zooming,
etc.) and network maps based on normalized relations. These maps reveal
complementary aspects of the network. International collaboration in the
generation of knowledge claims (that is, the context of discovery) changes the
structural layering of the sciences. Previously, validation was at the global
level and discovery more dependent on local contexts. This changing
relationship between the geographical and intellectual dimensions of the
sciences also has implications for national science policies.
","[{'version': 'v1', 'created': 'Fri, 4 Jan 2013 18:55:25 GMT'}, {'version': 'v2', 'created': 'Thu, 31 Jan 2013 19:47:46 GMT'}]",2013-02-01,"[['Leydesdorff', 'Loet', ''], ['Wagner', 'Caroline', ''], ['Park', 'Han Woo', ''], ['Adams', 'Jonathan', '']]","['co-authorship', 'map', 'global', 'network', 'internationalization', 'country', 'European Union']"
15608,1108.5016,Maxime Amblard,"Maxime Amblard (LORIA), Musiol Michel (LABPSYLOR), Rebuschi Manuel
  (LHSP)","Une analyse bas\'ee sur la S-DRT pour la mod\'elisation de dialogues
  pathologiques","Traitement Automatique des Langues, Montpellier : France (2011)",,,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, we present a corpus of dialogues between a schizophrenic
speaker and an interlocutor who drives the dialogue. We had identified specific
discontinuities for paranoid schizophrenics. We propose a modeling of these
discontinuities with S-DRT (its pragmatic part)
","[{'version': 'v1', 'created': 'Thu, 25 Aug 2011 06:07:06 GMT'}]",2011-08-26,"[['Amblard', 'Maxime', '', 'LORIA'], ['Michel', 'Musiol', '', 'LABPSYLOR'], ['Manuel', 'Rebuschi', '', 'LHSP']]","['S-DRT', 'verbal interaction', 'schizophrenia', 'pathological dialogue', 'pragmatical incoherence']"
15609,1704.07515,Shin Ando Ph. D.,Shin Ando and Chun-Yuan Huang,Deep Over-sampling Framework for Classifying Imbalanced Data,,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Class imbalance is a challenging issue in practical classification problems
for deep learning models as well as traditional models. Traditionally
successful countermeasures such as synthetic over-sampling have had limited
success with complex, structured data handled by deep learning models. In this
paper, we propose Deep Over-sampling (DOS), a framework for extending the
synthetic over-sampling method to exploit the deep feature space acquired by a
convolutional neural network (CNN). Its key feature is an explicit, supervised
representation learning, for which the training data presents each raw input
sample with a synthetic embedding target in the deep feature space, which is
sampled from the linear subspace of in-class neighbors. We implement an
iterative process of training the CNN and updating the targets, which induces
smaller in-class variance among the embeddings, to increase the discriminative
power of the deep representation. We present an empirical study using public
benchmarks, which shows that the DOS framework not only counteracts class
imbalance better than the existing method, but also improves the performance of
the CNN in the standard, balanced settings.
","[{'version': 'v1', 'created': 'Tue, 25 Apr 2017 02:12:00 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Jul 2017 06:40:40 GMT'}, {'version': 'v3', 'created': 'Wed, 12 Jul 2017 21:02:37 GMT'}]",2017-07-14,"[['Ando', 'Shin', ''], ['Huang', 'Chun-Yuan', '']]","['Class Imbalance', 'Convolutional Neural Network', 'Deep Learning', 'Representation Learning', 'Synthetic Over-sampling']"
15610,1610.04042,Georgios Chasparis,"Thomas Grubinger, Georgios Chasparis, Thomas Natschlaeger","Generalized Online Transfer Learning for Climate Control in Residential
  Buildings",,,,,cs.SY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an online transfer learning framework for improving
temperature predictions in residential buildings. In transfer learning,
prediction models trained under a set of available data from a target domain
(e.g., house with limited data) can be improved through the use of data
generated from similar source domains (e.g., houses with rich data). Given also
the need for prediction models that can be trained online (e.g., as part of a
model-predictive-control implementation), this paper introduces the generalized
online transfer learning algorithm (GOTL). It employs a weighted combination of
the available predictors (i.e., the target and source predictors) and
guarantees convergence to the best weighted predictor. Furthermore, the use of
Transfer Component Analysis (TCA) allows for using more than a single source
domains, since it may facilitate the fit of a single model on more than one
source domains (houses). This allows GOTL to transfer knowledge from more than
one source domains. We further validate our results through experiments in
climate control for residential buildings and show that GOTL may lead to
non-negligible energy savings for given comfort levels.
","[{'version': 'v1', 'created': 'Thu, 13 Oct 2016 11:54:43 GMT'}]",2016-10-14,"[['Grubinger', 'Thomas', ''], ['Chasparis', 'Georgios', ''], ['Natschlaeger', 'Thomas', '']]","['Climate control in buildings', 'Online transfer learning', 'Modelpredictive control']"
15611,0711.2050,Hacene Belbachir,Kenza Guenda,Two Families of Quantum Codes Derived from Cyclic Codes,,,,,cs.IT math.IT,,"  We characterize the affine-invariant maximal extended cyclic codes. Then by
the CSS construction, we derive from these codes a family of pure quantum
codes. Also for ordnq even, a new family of degenerate quantum stabilizer codes
is derived from the classical duadic codes. This answer an open problem asked
by Aly et al.
","[{'version': 'v1', 'created': 'Tue, 13 Nov 2007 19:06:43 GMT'}]",2007-11-14,"[['Guenda', 'Kenza', '']]","['Cyclic codes', 'affine-invariant codes', 'duadic codes', 'CSS construc']"
15612,0705.1454,Jerome Darmont,"Zhen He, J\'er\^ome Darmont (ERIC)",DOEF: A Dynamic Object Evaluation Framework,,"LNCS, Vol. 2736 (09/2003) 662-671",,,cs.DB,,"  In object-oriented or object-relational databases such as multimedia
databases or most XML databases, access patterns are not static, i.e.,
applications do not always access the same objects in the same order
repeatedly. However, this has been the way these databases and associated
optimisation techniques like clustering have been evaluated up to now. This
paper opens up research regarding this issue by proposing a dynamic object
evaluation framework (DOEF) that accomplishes access pattern change by defining
configurable styles of change. This preliminary prototype has been designed to
be open and fully extensible. To illustrate the capabilities of DOEF, we used
it to compare the performances of four state of the art dynamic clustering
algorithms. The results show that DOEF is indeed effective at determining the
adaptability of each dynamic clustering algorithm to changes in access pattern.
","[{'version': 'v1', 'created': 'Thu, 10 May 2007 12:24:27 GMT'}]",2007-05-23,"[['He', 'Zhen', '', 'ERIC'], ['Darmont', 'Jérôme', '', 'ERIC']]","['Performance evaluation', 'Dynamic access patterns', 'Benchmarking', 'Object-oriented and object-relational databases', 'Clustering']"
15613,1609.09643,Mateus de Oliveira Oliveira,Mateus de Oliveira Oliveira,"A Near-Quadratic Lower Bound for the Size of Quantum Circuits of
  Constant Treewidth",,,,,cs.CC quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that any quantum circuit of treewidth $t$, built from $r$-qubit
gates, requires at least $\Omega(\frac{n^{2}}{2^{O(r\cdot t)}\cdot \log^4 n})$
gates to compute the element distinctness function. Our result generalizes a
near-quadratic lower bound for quantum formula size obtained by Roychowdhury
and Vatan [SIAM J. on Computing, 2001]. The proof of our lower bound follows by
an extension of Ne\v{c}iporuk's method to the context of quantum circuits of
constant treewidth. This extension is made via a combination of techniques from
structural graph theory, tensor-network theory, and the connected-component
counting method, which is a classic tool in algebraic geometry.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2016 09:13:12 GMT'}]",2016-10-03,"[['Oliveira', 'Mateus de Oliveira', '']]","['Super-Linear Lower Bounds', 'Quantum Circuits', 'Algebraic Tensor Networks', 'Treewidth']"
15614,1409.6586,Bernhard Rumpe,"Christoph Herrmann, Holger Krahn, Bernhard Rumpe, Martin Schindler,
  Steven V\""olkel","Scaling-Up Model-Based-Development for Large Heterogeneous Systems with
  Compositional Modeling","5 pages, 3 figures, Proceedings of the 2009 International Conference
  on Software Engineeering in Research and Practice, Vol. 1. Ed.: H. Arabnia,
  H. Reza. July 13-16. Las Vegas, Nevada, USA. 2009",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Model-based development and in particular MDA [1], [2] have promised to be
especially suited for the development of complex, heterogeneous, and large
software systems. However, so far MDA has failed to fulfill this promise to a
larger extent because of tool support being inadequate and clumsy and
methodologies not being appropriate for an effective development. This article
discusses what went wrong in current MDA approaches and what needs to be done
to make MDA suited for ultra-large, distributed systems.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 11:59:56 GMT'}]",2014-09-24,"[['Herrmann', 'Christoph', ''], ['Krahn', 'Holger', ''], ['Rumpe', 'Bernhard', ''], ['Schindler', 'Martin', ''], ['Völkel', 'Steven', '']]","['MDA', 'Modularity', 'Compositional Modeling', 'Compositional Code Generation']"
15615,1407.3164,Marc Hellmuth,"Marc Hellmuth, Tilen Marc, Lydia Ostermeier and Peter F. Stadler",The Relaxed Square Property,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph products are characterized by the existence of non-trivial equivalence
relations on the edge set of a graph that satisfy a so-called square property.
We investigate here a generalization, termed RSP-relations. The class of graphs
with non-trivial RSP-relations in particular includes graph bundles.
Furthermore, RSP-relations are intimately related with covering graph
constructions. For K_23-free graphs finest RSP-relations can be computed in
polynomial-time. In general, however, they are not unique and their number may
even grow exponentially. They behave well for graph products, however, in sense
that a finest RSP-relations can be obtained easily from finest RSP-relations on
the prime factors.
","[{'version': 'v1', 'created': 'Fri, 11 Jul 2014 14:07:49 GMT'}]",2014-07-14,"[['Hellmuth', 'Marc', ''], ['Marc', 'Tilen', ''], ['Ostermeier', 'Lydia', ''], ['Stadler', 'Peter F.', '']]","['square property', 'unique square property', 'relaxed square property', 'RSP-relation', 'covering graphs']"
15616,1510.05544,Neil Shah,"Neil Shah, Alex Beutel, Bryan Hooi, Leman Akoglu, Stephan Gunnemann,
  Disha Makhija, Mohit Kumar, Christos Faloutsos",EdgeCentric: Anomaly Detection in Edge-Attributed Networks,,,,,cs.SI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a network with attributed edges, how can we identify anomalous
behavior? Networks with edge attributes are commonplace in the real world. For
example, edges in e-commerce networks often indicate how users rated products
and services in terms of number of stars, and edges in online social and
phonecall networks contain temporal information about when friendships were
formed and when users communicated with each other -- in such cases, edge
attributes capture information about how the adjacent nodes interact with other
entities in the network. In this paper, we aim to utilize exactly this
information to discern suspicious from typical node behavior. Our work has a
number of notable contributions, including (a) formulation: while most other
graph-based anomaly detection works use structural graph connectivity or node
information, we focus on the new problem of leveraging edge information, (b)
methodology: we introduce EdgeCentric, an intuitive and scalable
compression-based approach for detecting edge-attributed graph anomalies, and
(c) practicality: we show that EdgeCentric successfully spots numerous such
anomalies in several large, edge-attributed real-world graphs, including the
Flipkart e-commerce graph with over 3 million product reviews between 1.1
million users and 545 thousand products, where it achieved 0.87 precision over
the top 100 results.
","[{'version': 'v1', 'created': 'Mon, 19 Oct 2015 15:47:48 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Nov 2015 21:36:48 GMT'}]",2015-11-20,"[['Shah', 'Neil', ''], ['Beutel', 'Alex', ''], ['Hooi', 'Bryan', ''], ['Akoglu', 'Leman', ''], ['Gunnemann', 'Stephan', ''], ['Makhija', 'Disha', ''], ['Kumar', 'Mohit', ''], ['Faloutsos', 'Christos', '']]","['Anomaly detection', 'Social and information networks', 'Edge attributes']"
15617,1705.08997,Farhan Tejani,"Himanshu Sahni, Saurabh Kumar, Farhan Tejani, Yannick Schroecker,
  Charles Isbell","State Space Decomposition and Subgoal Creation for Transfer in Deep
  Reinforcement Learning","5 pages, 6 figures; 3rd Multidisciplinary Conference on Reinforcement
  Learning and Decision Making (RLDM 2017), Ann Arbor, Michigan",,,,cs.AI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Typical reinforcement learning (RL) agents learn to complete tasks specified
by reward functions tailored to their domain. As such, the policies they learn
do not generalize even to similar domains. To address this issue, we develop a
framework through which a deep RL agent learns to generalize policies from
smaller, simpler domains to more complex ones using a recurrent attention
mechanism. The task is presented to the agent as an image and an instruction
specifying the goal. This meta-controller guides the agent towards its goal by
designing a sequence of smaller subtasks on the part of the state space within
the attention, effectively decomposing it. As a baseline, we consider a setup
without attention as well. Our experiments show that the meta-controller learns
to create subgoals within the attention.
","[{'version': 'v1', 'created': 'Wed, 24 May 2017 23:19:44 GMT'}]",2017-05-26,"[['Sahni', 'Himanshu', ''], ['Kumar', 'Saurabh', ''], ['Tejani', 'Farhan', ''], ['Schroecker', 'Yannick', ''], ['Isbell', 'Charles', '']]","['Hierarchical Reinforcement Learning', 'Transfer Learning', 'PolicyGradient', 'Attention Mechanism']"
15618,1306.3874,KyungHyun Cho,Kyunghyun Cho and Xi Chen,"Classifying and Visualizing Motion Capture Sequences using Deep Neural
  Networks",VISAPP 2014,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The gesture recognition using motion capture data and depth sensors has
recently drawn more attention in vision recognition. Currently most systems
only classify dataset with a couple of dozens different actions. Moreover,
feature extraction from the data is often computational complex. In this paper,
we propose a novel system to recognize the actions from skeleton data with
simple, but effective, features using deep neural networks. Features are
extracted for each frame based on the relative positions of joints (PO),
temporal differences (TD), and normalized trajectories of motion (NT). Given
these features a hybrid multi-layer perceptron is trained, which simultaneously
classifies and reconstructs input data. We use deep autoencoder to visualize
learnt features, and the experiments show that deep neural networks can capture
more discriminative information than, for instance, principal component
analysis can. We test our system on a public database with 65 classes and more
than 2,000 motion sequences. We obtain an accuracy above 95% which is, to our
knowledge, the state of the art result for such a large dataset.
","[{'version': 'v1', 'created': 'Mon, 17 Jun 2013 14:26:52 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Sep 2014 16:03:02 GMT'}]",2014-09-02,"[['Cho', 'Kyunghyun', ''], ['Chen', 'Xi', '']]","['Gesture Recognition', 'Motion Capture', 'Deep Neural Network']"
15619,1301.5964,Taghi Javdani Gandomani,"Taghi Javdani, Hazura Zulzalil, Abdul Azim Abd Ghani, Abu Bakar Md
  Sultan, Reza Meimandi Parizi",On the Current Measurement Practices in Agile Software Development,7 pages,"Taghi Javdani , Hazura Zulzalil, Abd. Azim Abd. Ghani, Abubakar
  Md. Sultan, On the current measurement practices in agile software
  development, International Journal of Computer Science Issues, 2012, Vol. 9,
  Issue 4, No. 3, pp. 127-133",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Agile software development (ASD) methods were introduced as a reaction to
traditional software development methods. Principles of these methods are
different from traditional methods and so there are some different processes
and activities in agile methods comparing to traditional methods. Thus ASD
methods require different measurement practices comparing to traditional
methods. Agile teams often do their projects in the simplest and most effective
way so, measurement practices in agile methods are more important than
traditional methods, because lack of appropriate and effective measurement
practices, will increase risk of project. The aims of this paper are
investigation on current measurement practices in ASD methods, collecting them
together in one study and also reviewing agile version of Common Software
Measurement International Consortium (COSMIC) publication.
","[{'version': 'v1', 'created': 'Fri, 25 Jan 2013 04:47:53 GMT'}]",2013-01-28,"[['Javdani', 'Taghi', ''], ['Zulzalil', 'Hazura', ''], ['Ghani', 'Abdul Azim Abd', ''], ['Sultan', 'Abu Bakar Md', ''], ['Parizi', 'Reza Meimandi', '']]","['Agile Software Development', 'ASD Software measurement', 'Software estimation', 'software metrics', 'agile COSMIC']"
15620,1009.4517,Krishnam Raju Jampani,Bernhard Haeupler and Krishnam Raju Jampani and Anna Lubiw,Testing Simultaneous Planarity when the Common Graph is 2-Connected,"Appeared in ISAAC 2010, 15 pages, 3 figures",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two planar graphs G1 and G2 sharing some vertices and edges are
`simultaneously planar' if they have planar drawings such that a shared vertex
[edge] is represented by the same point [curve] in both drawings. It is an open
problem whether simultaneous planarity can be tested efficiently. We give a
linear-time algorithm to test simultaneous planarity when the two graphs share
a 2-connected subgraph. Our algorithm extends to the case of k planar graphs
where each vertex [edge] is either common to all graphs or belongs to exactly
one of them.
","[{'version': 'v1', 'created': 'Thu, 23 Sep 2010 04:24:51 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Dec 2011 05:21:49 GMT'}]",2011-12-12,"[['Haeupler', 'Bernhard', ''], ['Jampani', 'Krishnam Raju', ''], ['Lubiw', 'Anna', '']]","['Simultaneous Embedding', 'Planar Graph', 'PQ Tree', 'Graph Drawing']"
15621,1702.03037,Marc Lanctot,"Joel Z. Leibo, Vinicius Zambaldi, Marc Lanctot, Janusz Marecki, Thore
  Graepel",Multi-agent Reinforcement Learning in Sequential Social Dilemmas,"10 pages, 7 figures",,,,cs.MA cs.AI cs.GT cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Matrix games like Prisoner's Dilemma have guided research on social dilemmas
for decades. However, they necessarily treat the choice to cooperate or defect
as an atomic action. In real-world social dilemmas these choices are temporally
extended. Cooperativeness is a property that applies to policies, not
elementary actions. We introduce sequential social dilemmas that share the
mixed incentive structure of matrix game social dilemmas but also require
agents to learn policies that implement their strategic intentions. We analyze
the dynamics of policies learned by multiple self-interested independent
learning agents, each using its own deep Q-network, on two Markov games we
introduce here: 1. a fruit Gathering game and 2. a Wolfpack hunting game. We
characterize how learned behavior in each domain changes as a function of
environmental factors including resource abundance. Our experiments show how
conflict can emerge from competition over shared resources and shed light on
how the sequential nature of real world social dilemmas affects cooperation.
","[{'version': 'v1', 'created': 'Fri, 10 Feb 2017 01:48:40 GMT'}]",2017-02-13,"[['Leibo', 'Joel Z.', ''], ['Zambaldi', 'Vinicius', ''], ['Lanctot', 'Marc', ''], ['Marecki', 'Janusz', ''], ['Graepel', 'Thore', '']]","['Social dilemmas', 'cooperation', 'Markov games', 'agent-basedsocial simulation', 'non-cooperative games']"
15622,1802.06474,Yijun Li,"Yijun Li and Ming-Yu Liu and Xueting Li and Ming-Hsuan Yang and Jan
  Kautz",A Closed-form Solution to Photorealistic Image Stylization,Accepted by ECCV 2018,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Photorealistic image stylization concerns transferring style of a reference
photo to a content photo with the constraint that the stylized photo should
remain photorealistic. While several photorealistic image stylization methods
exist, they tend to generate spatially inconsistent stylizations with
noticeable artifacts. In this paper, we propose a method to address these
issues. The proposed method consists of a stylization step and a smoothing
step. While the stylization step transfers the style of the reference photo to
the content photo, the smoothing step ensures spatially consistent
stylizations. Each of the steps has a closed-form solution and can be computed
efficiently. We conduct extensive experimental validations. The results show
that the proposed method generates photorealistic stylization outputs that are
more preferred by human subjects as compared to those by the competing methods
while running much faster. Source code and additional results are available at
https://github.com/NVIDIA/FastPhotoStyle .
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 00:34:18 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Feb 2018 21:58:01 GMT'}, {'version': 'v3', 'created': 'Thu, 22 Feb 2018 17:38:42 GMT'}, {'version': 'v4', 'created': 'Thu, 26 Jul 2018 05:49:02 GMT'}, {'version': 'v5', 'created': 'Fri, 27 Jul 2018 01:14:23 GMT'}]",2018-07-30,"[['Li', 'Yijun', ''], ['Liu', 'Ming-Yu', ''], ['Li', 'Xueting', ''], ['Yang', 'Ming-Hsuan', ''], ['Kautz', 'Jan', '']]","['Image stylization', 'photorealism', 'closed-form solution']"
15623,1312.7126,Ali Cherif Moussa,Ali Cherif Moussa and Faraoun Mohamed Kamel,"Link Quality and MAC-Overhead aware Predictive Preemptive Routing
  Protocol for Mobile Ad hoc Network","10 pages, 19 figures. arXiv admin note: text overlap with
  arXiv:0907.5441 by other authors","IJCSI International Journal of Computer Science Issues, Vol. 10,
  Issue 5, No 2, September 2013 ISSN (Print): 1694-0814 | ISSN (Online):
  1694-0784",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Ad Hoc networks, route failure may occur due to less received power,
mobility, congestion and node failures. Many approaches have been proposed in
literature to solve this problem, where a node predicts pre-emptively the route
failure that occurs with the less received power. However, this approach
encounters some difficulties, especially in scenario without mobility where
route failures may arise. In this paper, we propose an improvement of AODV
protocol called LO-PPAODV (Link Quality and MAC-Overhead aware Predictive
Preemptive AODV). This protocol is based on new metric combine more routing
metrics (Link Quality, MAC Overhead) between each node and one hop neighbor.
Also we propose a cross-layer networking mechanism to distinguish between both
situations, failures due to congestion or mobility, and consequently avoiding
unnecessary route repair process. The LO-PPAODV was implemented using NS-2. The
simulation results show that our approach improves the overall performance of
the network. It reduces the average end to end delay, the routing overhead, MAC
errors and route errors, and increases the packet delivery fraction of the
network.
","[{'version': 'v1', 'created': 'Thu, 26 Dec 2013 16:10:24 GMT'}]",2013-12-30,"[['Moussa', 'Ali Cherif', ''], ['Kamel', 'Faraoun Mohamed', '']]","['Ad-Hoc networks', 'AODV', 'PPAODV', 'QoS', 'Cross layer']"
15624,1107.5372,Weirong Jiang,Weirong Jiang and Hoang Le and Viktor K. Prasanna,"Bidirectional Pipelining for Scalable IP Lookup and Packet
  Classification",tech report,,,"Technical Report CENG-2008-3, University of Southern California,
  2008",cs.NI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Both IP lookup and packet classification in IP routers can be implemented by
some form of tree traversal. SRAM-based Pipelining can improve the throughput
dramatically. However, previous pipelining schemes result in unbalanced memory
allocation over the pipeline stages. This has been identified as a major
challenge for scalable pipelined solutions. This paper proposes a flexible
bidirectional linear pipeline architecture based on widely-used dual-port
SRAMs. A search tree is partitioned, and then mapped onto pipeline stages by a
bidirectional fine-grained mapping scheme. We introduce the notion of inversion
factor and several heuristics to invert subtrees for memory balancing. Due to
its linear structure, the architecture maintains packet input order, and
supports non-blocking route updates. Our experiments show that, the
architecture can achieve a perfectly balanced memory distribution over the
pipeline stages, for both trie-based IP lookup and tree-based multi-dimensional
packet classification. For IP lookup, it can store a full backbone routing
table with 154419 entries using 2MB of memory, and sustain a high throughput of
1.87 billion packets per second (GPPS), i.e. 0.6 Tbps for the minimum size (40
bytes) packets. The throughput can be improved further to be 2.4 Tbps, by
employing caching to exploit the Internet traffic locality.
","[{'version': 'v1', 'created': 'Wed, 27 Jul 2011 03:01:36 GMT'}]",2011-07-28,"[['Jiang', 'Weirong', ''], ['Le', 'Hoang', ''], ['Prasanna', 'Viktor K.', '']]","['Packet classification', 'IP lookup', 'Pipeline', 'Terabit', 'Bidirectional', 'SRAM']"
15625,1610.01382,Jamil Ahmad,"Abdul Malik Badshah, Jamil Ahmad, Mi Young Lee, Sung Wook Baik","Divide-and-Conquer based Ensemble to Spot Emotions in Speech using MFCC
  and Random Forest","8 pages, conference paper, The 2nd International Integrated
  Conference & Concert on Convergence (2016)",,,,cs.SD cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Besides spoken words, speech signals also carry information about speaker
gender, age, and emotional state which can be used in a variety of speech
analysis applications. In this paper, a divide and conquer strategy for
ensemble classification has been proposed to recognize emotions in speech.
Intrinsic hierarchy in emotions has been utilized to construct an emotions
tree, which assisted in breaking down the emotion recognition task into smaller
sub tasks. The proposed framework generates predictions in three phases.
Firstly, emotions are detected in the input speech signal by classifying it as
neutral or emotional. If the speech is classified as emotional, then in the
second phase, it is further classified into positive and negative classes.
Finally, individual positive or negative emotions are identified based on the
outcomes of the previous stages. Several experiments have been performed on a
widely used benchmark dataset. The proposed method was able to achieve improved
recognition rates as compared to several other approaches.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2016 12:16:35 GMT'}]",2016-10-06,"[['Badshah', 'Abdul Malik', ''], ['Ahmad', 'Jamil', ''], ['Lee', 'Mi Young', ''], ['Baik', 'Sung Wook', '']]","['speech emotions', 'divide-and-conquer', 'emotion classification', 'random forest']"
15626,1705.05779,Alexander Zhdanov,Alexandre Zhdanov,New self-dual codes of length 72,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we obtain at least 61 new singly even (Type I) binary
[72,36,12] self-dual codes as a quasi-cyclic codes with m=2 (tailbitting
convolutional codes) and at least 13 new doubly even (Type II) binary
[72,36,12] self-dual codes by replacing the first row in each circulant in a
double circulant code by ""all ones"" and ""all zeros"" vectors respectively.
","[{'version': 'v1', 'created': 'Tue, 16 May 2017 15:57:44 GMT'}]",2017-05-17,"[['Zhdanov', 'Alexandre', '']]","['convolutional encoding', 'quasi-cyclic codes', 'weight']"
15627,1712.03941,Gautam Singh,"Gautam Singh, Gargi Dasgupta, Yu Deng","Fast Nearest-Neighbor Classification using RNN in Domains with Large
  Number of Classes","12 Pages, 2 Theorems, 6 Figures, 1 Algorithm",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In scenarios involving text classification where the number of classes is
large (in multiples of 10000s) and training samples for each class are few and
often verbose, nearest neighbor methods are effective but very slow in
computing a similarity score with training samples of every class. On the other
hand, machine learning models are fast at runtime but training them adequately
is not feasible using few available training samples per class. In this paper,
we propose a hybrid approach that cascades 1) a fast but less-accurate
recurrent neural network (RNN) model and 2) a slow but more-accurate
nearest-neighbor model using bag of syntactic features.
  Using the cascaded approach, our experiments, performed on data set from IT
support services where customer complaint text needs to be classified to return
top-$N$ possible error codes, show that the query-time of the slow system is
reduced to $1/6^{th}$ while its accuracy is being improved. Our approach
outperforms an LSH-based baseline for query-time reduction. We also derive a
lower bound on the accuracy of the cascaded model in terms of the accuracies of
the individual models. In any two-stage approach, choosing the right number of
candidates to pass on to the second stage is crucial. We prove a result that
aids in choosing this cutoff number for the cascaded system.
","[{'version': 'v1', 'created': 'Mon, 11 Dec 2017 18:48:55 GMT'}]",2017-12-12,"[['Singh', 'Gautam', ''], ['Dasgupta', 'Gargi', ''], ['Deng', 'Yu', '']]","['RNN', 'multi-stage retrieval', 'nearest neighbor']"
15628,1610.08808,Madhura Katageri,"Madhura Katageri, Manisha Mandal, Mansi Gandhi, Navin Koregaonkar and
  Prof. Sharmila Sengupta","Automated Management of Pothole related Disasters Using Image Processing
  and Geotagging",,"International Journal of Computer Science and Information
  Technology (IJCSIT) December 2015, volume 7, number 6",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Potholes though seem inconsequential, may cause accidents resulting in loss
of human life. In this paper, we present an automated system to efficiently
manage the potholes in a ward by deploying geotagging and image processing
techniques that overcomes the drawbacks associated with the existing
survey-oriented systems. Image processing is used for identification of target
pothole regions in the 2D images using edge detection and morphological image
processing operations. A method is developed to accurately estimate the
dimensions of the potholes from their images, analyze their area and depth,
estimate the quantity of filling material required and therefore enabling
pothole attendance on a priority basis. This will further enable the government
official to have a fully automated system for effectively managing pothole
related disasters.
","[{'version': 'v1', 'created': 'Fri, 8 Jan 2016 13:04:30 GMT'}]",2016-10-28,"[['Katageri', 'Madhura', ''], ['Mandal', 'Manisha', ''], ['Gandhi', 'Mansi', ''], ['Koregaonkar', 'Navin', ''], ['Sengupta', 'Prof. Sharmila', '']]","['Potholes', 'Geotagging', 'Image processing', 'Edge detection', 'Morphological image processing', '2D images']"
15629,1602.09067,Michael Madaio,"Michael Madaio, Shang-Tse Chen, Oliver L. Haimson, Wenwen Zhang, Xiang
  Cheng, Matthew Hinds-Aldrich, Duen Horng Chau, Bistra Dilkina","Firebird: Predicting Fire Risk and Prioritizing Fire Inspections in
  Atlanta","10 pages, 4 figures, submitted to KDD 2016",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Atlanta Fire Rescue Department (AFRD), like many municipal fire
departments, actively works to reduce fire risk by inspecting commercial
properties for potential hazards and fire code violations. However, AFRD's fire
inspection practices relied on tradition and intuition, with no existing
data-driven process for prioritizing fire inspections or identifying new
properties requiring inspection. In collaboration with AFRD, we developed the
Firebird framework to help municipal fire departments identify and prioritize
commercial property fire inspections, using machine learning, geocoding, and
information visualization. Firebird computes fire risk scores for over 5,000
buildings in the city, with true positive rates of up to 71% in predicting
fires. It has identified 6,096 new potential commercial properties to inspect,
based on AFRD's criteria for inspection. Furthermore, through an interactive
map, Firebird integrates and visualizes fire incidents, property information
and risk scores to help AFRD make informed decisions about fire inspections.
Firebird has already begun to make positive impact at both local and national
levels. It is improving AFRD's inspection processes and Atlanta residents'
safety, and was highlighted by National Fire Protection Association (NFPA) as a
best practice for using data to inform fire inspections.
","[{'version': 'v1', 'created': 'Mon, 29 Feb 2016 17:48:41 GMT'}]",2016-03-01,"[['Madaio', 'Michael', ''], ['Chen', 'Shang-Tse', ''], ['Haimson', 'Oliver L.', ''], ['Zhang', 'Wenwen', ''], ['Cheng', 'Xiang', ''], ['Hinds-Aldrich', 'Matthew', ''], ['Chau', 'Duen Horng', ''], ['Dilkina', 'Bistra', '']]","['Fire risk', 'predictive modeling', 'interactive visualization', 'government innovation', 'data science']"
15630,1309.7609,Kevin  Rojas,"Kevin Rojas Laura, Christhian Cardenas Alvarez","Identificaci\'on y Registro Catastral de Cuerpos de Agua mediante
  T\'ecnicas de Procesamiento Digital de Imagenes",in Spanish,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The effects of global climate change on Peruvian glaciers have brought about
several processes of deglaciation during the last few years. The immediate
effect is the change of size of lakes and rivers. Public institutions that
monitor water resources currently have only recent studies which make up less
than 10% of the total. The effects of climate change and the lack of updated
information intensify social-economic problems related to water resources in
Peru. The objective of this research is to develop a software application to
automate the Cadastral Registry of Water Bodies in Peru, using techniques of
digital image processing, which would provide tools for detection, record,
temporal analysis and visualization of water bodies. The images used are from
the satellite Landsat5, which undergo a pre-processing of calibration and
correction of the satellite. Detection results are archived into a file that
contains location vectors and images of the segmentated bodies of water.
","[{'version': 'v1', 'created': 'Sun, 29 Sep 2013 15:36:43 GMT'}]",2013-10-01,"[['Laura', 'Kevin Rojas', ''], ['Alvarez', 'Christhian Cardenas', '']]","['LandSat', 'Land Registry', 'Watersheds', 'Satellite Image Processing']"
15631,0711.3315,EDA Publishing Association,"Fei Duan, J. Jiao, Y. Wang",Impact of Thermal Behavior on Offset in a High-Q Gyroscope,"Submitted on behalf of TIMA Editions
  (http://irevues.inist.fr/tima-editions)","Dans Symposium on Design, Test, Integration and Packaging of
  MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)",,,cs.OH,,"  In this paper, CFD approach is used to simulate the thermal behavior in a
sensitive high-Q gyroscope. The electromagnetically driving wires, in which AC
current flows, are treated as Joule heat sources in the model. We found that
the differences of temperature, pressure and velocity along the driving
direction and transversely across the proof masses increased as the gap height
between the proof mass and top glass became smaller. Local pressure gradient is
expected to possibly enhance the impact of any imperfect led by MEMS processes
or designs on the offset of our tuning fork type gyroscope, which has been
experimentally verified. A device with 200um gap gives a two-third offset down
compared with that of its counterpart with 50um gap.
","[{'version': 'v1', 'created': 'Wed, 21 Nov 2007 10:02:53 GMT'}]",2007-11-29,"[['Duan', 'Fei', ''], ['Jiao', 'J.', ''], ['Wang', 'Y.', '']]","['Offset', 'gyroscope', 'CFD', 'pressure gradient']"
15632,1702.06064,Aayush Ankit,"Aayush Ankit, Abhronil Sengupta, Priyadarshini Panda, Kaushik Roy","RESPARC: A Reconfigurable and Energy-Efficient Architecture with
  Memristive Crossbars for Deep Spiking Neural Networks","6 pages, 14 figures, Accepted in Design Automation Conference, 2017",,,,cs.ET cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neuromorphic computing using post-CMOS technologies is gaining immense
popularity due to its promising abilities to address the memory and power
bottlenecks in von-Neumann computing systems. In this paper, we propose RESPARC
- a reconfigurable and energy efficient architecture built-on Memristive
Crossbar Arrays (MCA) for deep Spiking Neural Networks (SNNs). Prior works were
primarily focused on device and circuit implementations of SNNs on crossbars.
RESPARC advances this by proposing a complete system for SNN acceleration and
its subsequent analysis. RESPARC utilizes the energy-efficiency of MCAs for
inner-product computation and realizes a hierarchical reconfigurable design to
incorporate the data-flow patterns in an SNN in a scalable fashion. We evaluate
the proposed architecture on different SNNs ranging in complexity from 2k-230k
neurons and 1.2M-5.5M synapses. Simulation results on these networks show that
compared to the baseline digital CMOS architecture, RESPARC achieves 500X (15X)
efficiency in energy benefits at 300X (60X) higher throughput for multi-layer
perceptrons (deep convolutional networks). Furthermore, RESPARC is a
technology-aware architecture that maps a given SNN topology to the most
optimized MCA size for the given crossbar technology.
","[{'version': 'v1', 'created': 'Mon, 20 Feb 2017 17:04:08 GMT'}]",2017-02-21,"[['Ankit', 'Aayush', ''], ['Sengupta', 'Abhronil', ''], ['Panda', 'Priyadarshini', ''], ['Roy', 'Kaushik', '']]","['Reconfigurablity', 'Energy-Efficiency', 'Spiking Neural Network', 'Memristive Crossbars']"
15633,1702.07612,Michael Hecht,Michael Hecht,Exact Localisations of Feedback Sets,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The feedback arc (vertex) set problem, shortened FASP (FVSP), is to transform
a given multi digraph $G=(V,E)$ into an acyclic graph by deleting as few arcs
(vertices) as possible. Due to the results of Richard M. Karp in 1972 it is one
of the classic NP-complete problems. An important contribution of this paper is
that the subgraphs $G_{\mathrm{el}}(e)$, $G_{\mathrm{si}}(e)$ of all elementary
cycles or simple cycles running through some arc $e \in E$, can be computed in
$\mathcal{O}\big(|E|^2\big)$ and $\mathcal{O}(|E|^4)$, respectively. We use
this fact and introduce the notion of the essential minor and isolated cycles,
which yield a priori problem size reductions and in the special case of so
called resolvable graphs an exact solution in $\mathcal{O}(|V||E|^3)$. We show
that weighted versions of the FASP and FVSP possess a Bellman decomposition,
which yields exact solutions using a dynamic programming technique in times
$\mathcal{O}\big(2^{m}|E|^4\log(|V|)\big)$ and
$\mathcal{O}\big(2^{n}\Delta(G)^4|V|^4\log(|E|)\big)$, where $m \leq |E|-|V|
+1$, $n \leq (\Delta(G)-1)|V|-|E| +1$, respectively. The parameters $m,n$ can
be computed in $\mathcal{O}(|E|^3)$, $\mathcal{O}(\Delta(G)^3|V|^3)$,
respectively and denote the maximal dimension of the cycle space of all
appearing meta graphs, decoding the intersection behavior of the cycles.
Consequently, $m,n$ equal zero if all meta graphs are trees. Moreover, we
deliver several heuristics and discuss how to control their variation from the
optimum. Summarizing, the presented results allow us to suggest a strategy for
an implementation of a fast and accurate FASP/FVSP-SOLVER.
","[{'version': 'v1', 'created': 'Fri, 24 Feb 2017 14:48:23 GMT'}]",2017-02-27,"[['Hecht', 'Michael', '']]","['Feedback set problem', 'acyclic subgraph problem', 'linear orderingproblem', 'elementary cycle', 'simple cycle']"
15634,1301.5038,Shaoshi Chen,"Alin Bostan, Shaoshi Chen, Fr\'ed\'eric Chyzak, Ziming Li, Guoce Xin","Hermite Reduction and Creative Telescoping for Hyperexponential
  Functions",8 pages,,,,cs.SC math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a reduction algorithm that simultaneously extends Hermite's
reduction for rational functions and the Hermite-like reduction for
hyperexponential functions. It yields a unique additive decomposition and
allows to decide hyperexponential integrability. Based on this reduction
algorithm, we design a new method to compute minimal telescopers for bivariate
hyperexponential functions. One of its main features is that it can avoid the
costly computation of certificates. Its implementation outperforms Maple's
function DEtools[Zeilberger]. Moreover, we derive an order bound on minimal
telescopers, which is more general and tighter than the known one.
","[{'version': 'v1', 'created': 'Mon, 21 Jan 2013 23:21:44 GMT'}]",2013-01-23,"[['Bostan', 'Alin', ''], ['Chen', 'Shaoshi', ''], ['Chyzak', 'Frédéric', ''], ['Li', 'Ziming', ''], ['Xin', 'Guoce', '']]","['Hermite Reduction', 'Hyperexponential function', 'Telescoper']"
15635,1702.07696,Sandor P. Fekete,S\'andor P. Fekete and Jan-Marc Reinhardt and Christian Scheffer,An Efficient Data Structure for Dynamic Two-Dimensional Reconfiguration,"11 pages, 12 figures; full version of extended abstract that appeared
  in ARCS 2016",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the presence of dynamic insertions and deletions into a partially
reconfigurable FPGA, fragmentation is unavoidable. This poses the challenge of
developing efficient approaches to dynamic defragmentation and reallocation.
One key aspect is to develop efficient algorithms and data structures that
exploit the two-dimensional geometry of a chip, instead of just one. We propose
a new method for this task, based on the fractal structure of a quadtree, which
allows dynamic segmentation of the chip area, along with dynamically adjusting
the necessary communication infrastructure. We describe a number of algorithmic
aspects, and present different solutions. We also provide a number of basic
simulations that indicate that the theoretical worst-case bound may be
pessimistic.
","[{'version': 'v1', 'created': 'Fri, 24 Feb 2017 18:30:03 GMT'}]",2017-02-27,"[['Fekete', 'Sándor P.', ''], ['Reinhardt', 'Jan-Marc', ''], ['Scheffer', 'Christian', '']]","['FPGAs', 'partial reconfiguration', 'two-dimensional reallocation', 'defragmentation', 'dynamic data structures', 'insertionsand deletions']"
15636,1210.0257,Dimitrios Thilikos,"Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Dimitrios M.
  Thilikos","Kernels for (connected) Dominating Set on graphs with Excluded
  Topological subgraphs","Final version, accepted to ACM Transactions on Algorithms (TALG)",,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give the first linear kernels for the (Connected) Dominating Set problems
on H-topological minor free graphs. We prove the existence of polynomial time
algorithms that, for a given H-topological-minor-free graph G and a positive
integer k, output an H-topological-minor-free graph G' on O(k) vertices such
that G has a (connected) dominating set of size k iff G' has one. Our results
extend the known classes of graphs on which the Dominating Set and Connected
Dominating Set problems admit linear kernels. Prior to our work, it was known
that these problems admit linear kernels on graphs excluding a fixed apex graph
H as a minor. Moreover, for Dominating Set, a kernel of size kc(H), where c(H)
is a constant depending on the size of H, follows from a more general result on
the kernelization of Dominating Set on graphs of bounded degeneracy. Alon and
Gutner explicitly asked whether one can obtain a linear kernel for Dominating
Set on H-minor-free graphs. We answer this question in the affirmative and in
fact prove a more general result. For Connected Dominating Set no polynomial
kernel even on H-minor-free graphs was known prior to our work. On the negative
side, it is known that Connected Dominating Set on 2-degenerated graphs does
not admit a polynomial kernel unless coNP $\subseteq$ NP/poly. Our
kernelization algorithm is based on a non-trivial combination of the following
ingredients The structural theorem of Grohe and Marx [STOC 2012] for graphs
excluding a fixed graph H as a topological minor; A novel notion of
protrusions, different than the one defined in [FOCS 2009]; Our results are
based on a generic reduction rule that produces an equivalent instance (in case
the input graph is H-minor-free) of the problem, with treewidth $O(\sqrt{k})$.
The application of this rule in a divide-and-conquer fashion, together with the
new notion of protrusions, gives us the linear kernels.
","[{'version': 'v1', 'created': 'Sun, 30 Sep 2012 23:49:19 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Nov 2014 10:45:45 GMT'}, {'version': 'v3', 'created': 'Wed, 25 Oct 2017 09:17:03 GMT'}]",2017-10-26,"[['Fomin', 'Fedor V.', ''], ['Lokshtanov', 'Daniel', ''], ['Saurabh', 'Saket', ''], ['Thilikos', 'Dimitrios M.', '']]","['Kernelization', 'Connected Dominating Set', 'topological minor free graphs']"
15637,1403.6611,Shigaung Feng,"Shiguang Feng, Xishun Zhao",More on Descriptive Complexity of Second-Order HORN Logics,,,,,cs.LO,http://creativecommons.org/licenses/by/3.0/,"  This paper concerns Gradel's question asked in 1992: whether all problems
which are in PTIME and closed under substructures are definable in second-order
HORN logic SO-HORN. We introduce revisions of SO-HORN and DATALOG by adding
first-order universal quantifiers over the second-order atoms in the bodies of
HORN clauses and DATALOG rules. We show that both logics are as expressive as
FO(LFP), the least fixed point logic. We also prove that FO(LFP) can not define
all of the problems that are in PTIME and closed under substructures. As a
corollary, we answer Gradel's question negatively.
","[{'version': 'v1', 'created': 'Wed, 26 Mar 2014 10:12:13 GMT'}]",2014-03-27,"[['Feng', 'Shiguang', ''], ['Zhao', 'Xishun', '']]","['Second-order HORN', 'DATALOG', 'Descriptive Complexity', 'Closed under substructures', 'Expressiveness', 'PTIME']"
15638,1301.6574,Thomas Couronne,"Thomas Couronne, Jean-Samuel Beuscart, Cedric Chamayou","Self-Organizing Map and social networks: Unfolding online social
  popularity",,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The present study uses the Kohonen self organizing map (SOM) to represent the
popularity patterns of Myspace music artists from their attributes on the
platform and their position in the social network. The method is applied to
cluster the profiles (the nodes of the social network) and the best friendship
links (the edges). It shows that the SOM is an efficient tool to interpret the
complex links between the audience and the influence of the musicians. It
finally provides a robust classifier of the online social network behaviors.
","[{'version': 'v1', 'created': 'Mon, 28 Jan 2013 15:28:36 GMT'}]",2013-01-29,"[['Couronne', 'Thomas', ''], ['Beuscart', 'Jean-Samuel', ''], ['Chamayou', 'Cedric', '']]","['component; social networks', 'self organizing map', 'myspace']"
15639,1510.07208,Yuan Ma,"Joe Lemieux, Yuan Ma",Vehicle Speed Prediction using Deep Learning,,,,,cs.LG cs.NE,http://creativecommons.org/publicdomain/zero/1.0/,"  Global optimization of the energy consumption of dual power source vehicles
such as hybrid electric vehicles, plug-in hybrid electric vehicles, and plug in
fuel cell electric vehicles requires knowledge of the complete route
characteristics at the beginning of the trip. One of the main characteristics
is the vehicle speed profile across the route. The profile will translate
directly into energy requirements for a given vehicle. However, the vehicle
speed that a given driver chooses will vary from driver to driver and from time
to time, and may be slower, equal to, or faster than the average traffic flow.
If the specific driver speed profile can be predicted, the energy usage can be
optimized across the route chosen. The purpose of this paper is to research the
application of Deep Learning techniques to this problem to identify at the
beginning of a drive cycle the driver specific vehicle speed profile for an
individual driver repeated drive cycle, which can be used in an optimization
algorithm to minimize the amount of fossil fuel energy used during the trip.
","[{'version': 'v1', 'created': 'Sun, 25 Oct 2015 05:52:59 GMT'}]",2015-10-27,"[['Lemieux', 'Joe', ''], ['Ma', 'Yuan', '']]","['Deep Learning', 'Stacked Auto Encoders', 'Neural']"
15640,0802.3522,Pierre-Francois Marteau,Pierre-Fran\c{c}ois Marteau (VALORIA),Time Warp Edit Distance,Pattern Recognition - Clustering - Algorithms - Similarity Measures,,,VALORIA.2008.1V5,cs.IR,,"  This technical report details a family of time warp distances on the set of
discrete time series. This family is constructed as an editing distance whose
elementary operations apply on linear segments. A specific parameter allows
controlling the stiffness of the elastic matching. It is well suited for the
processing of event data for which each data sample is associated with a
timestamp, not necessarily obtained according to a constant sampling rate. Some
properties verified by these distances are proposed and proved in this report.
","[{'version': 'v1', 'created': 'Sun, 24 Feb 2008 17:18:50 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Mar 2008 08:32:36 GMT'}, {'version': 'v3', 'created': 'Tue, 18 Mar 2008 15:13:42 GMT'}, {'version': 'v4', 'created': 'Fri, 4 Apr 2008 13:07:21 GMT'}, {'version': 'v5', 'created': 'Mon, 23 Jun 2008 04:45:59 GMT'}]",2008-06-23,"[['Marteau', 'Pierre-François', '', 'VALORIA']]","['Dynamic Time Warping', 'Elastic Distances', 'Stiffness Control', 'Time Series']"
15641,1207.7036,Sultan Meko Mr,Sultan F. Meko,"Impact of channel partitioning and relay placement on resource
  allocation in OFDMA Cellular networks",,"International Journal of Wireless & Mobile Networks (IJWMN) Vol.
  4, No. 3, June 2012",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tremendous growth in the demand for wireless applications such as streaming
audio/videos, Skype and video games require high data rate irrespective of
user's location in the cellular network. However, the Quality of Service (QoS)
of users degrades at the cell boundary. Relay enhanced multi-hop cellular
network is one of the cost effective solution to improve the performance of
cell edge users. Optimal deployment of Fixed Relay Nodes (FRNs) is essential to
satisfy the QoS requirement of edge users. We propose new schemes for channel
partitioning and FRN placement in cellular networks. Path-loss, Signal to
Interference and Noise Ratio (SINR) experienced by users, and effects of
shadowing have been considered. The analysis gives more emphasis on the
cell-edge users (worst case scenario). The results show that these schemes
achieve higher system performance in terms of spectral efficiency and also
increase the user data rate at the cell edge.
","[{'version': 'v1', 'created': 'Wed, 11 Jul 2012 15:16:31 GMT'}]",2012-07-31,"[['Meko', 'Sultan F.', '']]","['FRN deployment', 'frequency reuse', 'OFDMA', 'multi-hop', 'outage probability']"
15642,1107.1974,Ali Dinler,"Ali Dinler, Cengis Hasan, Kamil Orucoglu and Robert W. Barber",On an Efficient Marie Curie Initial Training Network,"Proceedings of the International Conference on Mathematical Finance
  and Economics (ICMFE-2011), Istanbul, Turkey, 6-8 July 2011",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Collaboration in science is one of the key components of world-class
research. The European Commission supports collaboration between institutions
and funds young researchers appointed by these partner institutions. In these
networks, the mobility of the researchers is enforced in order to enhance the
collaboration. In this study, based on a real Marie Curie Initial Training
Network, an algorithm to construct a collaboration network is investigated. The
algorithm suggests that a strongly efficient expansion leads to a star-like
network. The results might help the design of efficient collaboration networks
for future Initial Training Network proposals.
","[{'version': 'v1', 'created': 'Mon, 11 Jul 2011 09:32:21 GMT'}]",2011-07-12,"[['Dinler', 'Ali', ''], ['Hasan', 'Cengis', ''], ['Orucoglu', 'Kamil', ''], ['Barber', 'Robert W.', '']]","['Collaboration networks', 'strongly efficient networks', 'cooperative game theory']"
15643,1109.2361,Marko Petkovic,"Marko D. Petkovic, Dragoljub Pokrajac, Longin Jan Latecki",Spherical coverage verification,,,,,cs.CG cs.CC math.NA math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of covering hypersphere by a set of spherical
hypercaps. This sort of problem has numerous practical applications such as
error correcting codes and reverse k-nearest neighbor problem. Using the
reduction of non degenerated concave quadratic programming (QP) problem, we
demonstrate that spherical coverage verification is NP hard. We propose a
recursive algorithm based on reducing the problem to several lower dimension
subproblems. We test the performance of the proposed algorithm on a number of
generated constellations. We demonstrate that the proposed algorithm, in spite
of its exponential worst-case complexity, is applicable in practice. In
contrast, our results indicate that spherical coverage verification using QP
solvers that utilize heuristics, due to numerical instability, may produce
false positives.
","[{'version': 'v1', 'created': 'Sun, 11 Sep 2011 23:09:41 GMT'}]",2015-03-19,"[['Petkovic', 'Marko D.', ''], ['Pokrajac', 'Dragoljub', ''], ['Latecki', 'Longin Jan', '']]","['geometrical algorithms', 'quadratic programming', 'hypersphere', 'coverage', 'hypercaps']"
15644,1705.08392,Daniel Gall,"Daniel Gall, Thom Fr\""uhwirth",A Decidable Confluence Test for Cognitive Models in ACT-R,"To appear in Stefania Costantini, Enrico Franconi, William Van
  Woensel, Roman Kontchakov, Fariba Sadri, and Dumitru Roman: ""Proceedings of
  RuleML+RR 2017"". Springer LNCS",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computational cognitive modeling investigates human cognition by building
detailed computational models for cognitive processes. Adaptive Control of
Thought - Rational (ACT-R) is a rule-based cognitive architecture that offers a
widely employed framework to build such models. There is a sound and complete
embedding of ACT-R in Constraint Handling Rules (CHR). Therefore analysis
techniques from CHR can be used to reason about computational properties of
ACT-R models. For example, confluence is the property that a program yields the
same result for the same input regardless of the rules that are applied.
  In ACT-R models, there are often cognitive processes that should always yield
the same result while others e.g. implement strategies to solve a problem that
could yield different results. In this paper, a decidable confluence criterion
for ACT-R is presented. It allows to identify ACT-R rules that are not
confluent. Thereby, the modeler can check if his model has the desired
behavior.
  The sound and complete translation of ACT-R to CHR from prior work is used to
come up with a suitable invariant-based confluence criterion from the CHR
literature. Proper invariants for translated ACT-R models are identified and
proven to be decidable. The presented method coincides with confluence of the
original ACT-R models.
","[{'version': 'v1', 'created': 'Tue, 23 May 2017 16:15:18 GMT'}]",2017-05-24,"[['Gall', 'Daniel', ''], ['Frühwirth', 'Thom', '']]","['computational cognitive modeling', 'confluence', 'invariants', 'ACT-R', 'Constraint Handling Rules']"
15645,1705.06922,Zhenfang Hu,"Zhenfang Hu, Gang Pan, and Zhaohui Wu","Spectral-graph Based Classifications: Linear Regression for
  Classification and Normalized Radial Basis Function Network",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spectral graph theory has been widely applied in unsupervised and
semi-supervised learning. In this paper, we find for the first time, to our
knowledge, that it also plays a concrete role in supervised classification. It
turns out that two classifiers are inherently related to the theory: linear
regression for classification (LRC) and normalized radial basis function
network (nRBFN), corresponding to linear and nonlinear kernel respectively. The
spectral graph theory provides us with a new insight into a fundamental aspect
of classification: the tradeoff between fitting error and overfitting risk.
With the theory, ideal working conditions for LRC and nRBFN are presented,
which ensure not only zero fitting error but also low overfitting risk. For
quantitative analysis, two concepts, the fitting error and the spectral risk
(indicating overfitting), have been defined. Their bounds for nRBFN and LRC are
derived. A special result shows that the spectral risk of nRBFN is lower
bounded by the number of classes and upper bounded by the size of radial basis.
When the conditions are not met exactly, the classifiers will pursue the
minimum fitting error, running into the risk of overfitting. It turns out that
$\ell_2$-norm regularization can be applied to control overfitting. Its effect
is explored under the spectral context. It is found that the two terms in the
$\ell_2$-regularized objective are one-one correspondent to the fitting error
and the spectral risk, revealing a tradeoff between the two quantities.
Concerning practical performance, we devise a basis selection strategy to
address the main problem hindering the applications of (n)RBFN. With the
strategy, nRBFN is easy to implement yet flexible. Experiments on 14 benchmark
data sets show the performance of nRBFN is comparable to that of SVM, whereas
the parameter tuning of nRBFN is much easier, leading to reduction of model
selection time.
","[{'version': 'v1', 'created': 'Fri, 19 May 2017 10:35:37 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Jun 2017 15:18:08 GMT'}]",2017-06-14,"[['Hu', 'Zhenfang', ''], ['Pan', 'Gang', ''], ['Wu', 'Zhaohui', '']]","['classification', 'spectral graph', 'radial basis function network', 'linear regression', 'regularization', 'overfitting']"
15646,1206.0238,M. Zahid Hossain,"M. Zahid Hossain, M. Ashraful Amin, Hong Yan",Rapid Feature Extraction for Optical Character Recognition,"5 pages, 1 figure",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feature extraction is one of the fundamental problems of character
recognition. The performance of character recognition system is depends on
proper feature extraction and correct classifier selection. In this article, a
rapid feature extraction method is proposed and named as Celled Projection (CP)
that compute the projection of each section formed through partitioning an
image. The recognition performance of the proposed method is compared with
other widely used feature extraction methods that are intensively studied for
many different scripts in literature. The experiments have been conducted using
Bangla handwritten numerals along with three different well known classifiers
which demonstrate comparable results including 94.12% recognition accuracy
using celled projection.
","[{'version': 'v1', 'created': 'Fri, 1 Jun 2012 16:20:41 GMT'}]",2012-06-04,"[['Hossain', 'M. Zahid', ''], ['Amin', 'M. Ashraful', ''], ['Yan', 'Hong', '']]","['Character recognition', 'Feature extraction', 'Celledprojection', 'Neural network']"
15647,1407.6714,Besmira Nushi E,"Besmira Nushi, Omar Alonso, Martin Hentschel, and Vasileios Kandylas",CrowdSTAR: A Social Task Routing Framework for Online Communities,,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The online communities available on the Web have shown to be significantly
interactive and capable of collectively solving difficult tasks. Nevertheless,
it is still a challenge to decide how a task should be dispatched through the
network due to the high diversity of the communities and the dynamically
changing expertise and social availability of their members. We introduce
CrowdSTAR, a framework designed to route tasks across and within online crowds.
CrowdSTAR indexes the topic-specific expertise and social features of the crowd
contributors and then uses a routing algorithm, which suggests the best sources
to ask based on the knowledge vs. availability trade-offs. We experimented with
the proposed framework for question and answering scenarios by using two
popular social networks as crowd candidates: Twitter and Quora.
","[{'version': 'v1', 'created': 'Thu, 24 Jul 2014 20:00:21 GMT'}]",2014-07-28,"[['Nushi', 'Besmira', ''], ['Alonso', 'Omar', ''], ['Hentschel', 'Martin', ''], ['Kandylas', 'Vasileios', '']]","['Task Routing', 'Social Search', 'Question Answering', 'Crowdsourcing', 'User Expertise']"
15648,1402.2374,Reena Philips Mrs,"Poornima U. S., Suma. V",Factors Modulating Software Design Quality,"7 Pages, 2 Figures",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Object oriented approach is one of the popular software development approach
for managing complex systems with massive set of requirements. Unlike
procedural approach, this approach captures the requirements as set of data
rather than services. Further, class is considered as a key unit of the
solution-domain with data and services wrapped together, representing
architectural design of a basic module. Thus, system complexity is directly
related to the number of modules and the degree of interaction between them.
This could be mapped as a functional diagram with cardinalities between the
modules. However, complexity is always a threat to quality at each stage of
software development. Design phase is therefore one of the core influencing
phases during development that selects the right architecture based on the
problem statement which is bound to be measured for quality. Hence, software
industries adapts several organization- specific principles, domain-specific
patterns, metric standards and best practices to improve and measure the
quality of both process and product. The paper highlights the factors which
influence the overall design quality and metrics implication in improving the
quality of final product. It also presents the solution domain as an
interdependent layered architecture which has a greater impact on concluding
the quality of the end product. This approach of design is a unique
contribution to the domain of Object Oriented approach of software development.
It also focuses on design metrics which ensures the implementation of right
choice of design towards the retention of quality of the product.
","[{'version': 'v1', 'created': 'Tue, 11 Feb 2014 05:12:18 GMT'}]",2014-02-12,"[['S.', 'Poornima U.', ''], ['V', 'Suma.', '']]","['Solution Domain', 'Models', 'Principles', 'Patterns', 'Frameworks', 'Quality Metrics']"
15649,1606.03551,James Birt,"James Birt, Dirk Hovorka and Jonathan Nelson",Interdisciplinary Translation of Comparative Visualization,"ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
  Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/252,cs.CY cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Spatial visualisation skills and interpretations are critical in the design
professions, but traditionally difficult to effectively teach. Visualization
and multimedia presentation studies show positive improvements in learner
outcomes for specific learning domains. But the development and translation of
a comparative visualization pedagogy between disciplines is poorly understood.
This research seeks to identify an approach to developing comparable multimodal
and interactive visualizations and attendant student reflections for curriculum
designers in courses that can utilize visualizations and manipulations. Results
from previous use of comparative multimodal visualization pedagogy in a
multimedia 3D modelling class are used as a guide to translation of pedagogy to
architecture design. The focus is how to guide the use of comparative
multimodal visualizations through media properties, lesson sequencing, and
reflection to inform effective instruction and learning.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 04:15:53 GMT'}]",2016-06-14,"[['Birt', 'James', ''], ['Hovorka', 'Dirk', ''], ['Nelson', 'Jonathan', '']]","['visualization', 'curriculum design', 'multimodal', '3d printing', 'virtual reality']"
15650,1412.4316,Oleg Mazonka,Oleg Mazonka and Vlad Popov,Hasq Hash Chains,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a particular hash-based records linking chain scheme.
This scheme is simple conceptually and easy to implement in software. It allows
for a simple and secure way to transfer ownership of digital objects between
peers.
","[{'version': 'v1', 'created': 'Sun, 14 Dec 2014 05:37:07 GMT'}]",2014-12-16,"[['Mazonka', 'Oleg', ''], ['Popov', 'Vlad', '']]","['Blockchain', 'Bitcoin', 'Cryptocurrency', 'Hasq']"
15651,1701.06239,Tianran Hu,"Tianran Hu, Ruihua Song, Yingzi Wang, Xing Xie, Jiebo Luo","Mining Shopping Patterns for Divergent Urban Regions by Incorporating
  Mobility Data","Published at Conference on Information and Knowledge Management (CIKM
  2016)",,,,cs.SI cs.CY,http://creativecommons.org/licenses/by/4.0/,"  What people buy is an important aspect or view of lifestyles. Studying
people's shopping patterns in different urban regions can not only provide
valuable information for various commercial opportunities, but also enable a
better understanding about urban infrastructure and urban lifestyle. In this
paper, we aim to predict city-wide shopping patterns. This is a challenging
task due to the sparsity of the available data -- over 60% of the city regions
are unknown for their shopping records. To address this problem, we incorporate
another important view of human lifestyles, namely mobility patterns. With
information on ""where people go"", we infer ""what people buy"". Moreover, to
model the relations between regions, we exploit spatial interactions in our
method. To that end, Collective Matrix Factorization (CMF) with an interaction
regularization model is applied to fuse the data from multiple views or
sources. Our experimental results have shown that our model outperforms the
baseline methods on two standard metrics. Our prediction results on multiple
shopping patterns reveal the divergent demands in different urban regions, and
thus reflect key functional characteristics of a city. Furthermore, we are able
to extract the connection between the two views of lifestyles, and achieve a
better or novel understanding of urban lifestyles.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2017 00:15:34 GMT'}]",2017-01-24,"[['Hu', 'Tianran', ''], ['Song', 'Ruihua', ''], ['Wang', 'Yingzi', ''], ['Xie', 'Xing', ''], ['Luo', 'Jiebo', '']]","['Shopping Patterns', 'Mobility Patterns', 'Urban Computing', 'Multiview Lifestyles']"
15652,0806.2925,Dzenan Zukic,"D\v{z}enan Zuki\'c, Andreas Elsner, Zikrija Avdagi\'c, Gitta Domik",Neural networks in 3D medical scan visualization,"8 pages, 6 figures published on conference 3IA'2008 in Athens, Greece
  (http://3ia.teiath.gr)","International Conference on Computer Graphics and Artificial
  Intelligence, Proceedings (2008) 183-190",,,cs.AI cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For medical volume visualization, one of the most important tasks is to
reveal clinically relevant details from the 3D scan (CT, MRI ...), e.g. the
coronary arteries, without obscuring them with less significant parts. These
volume datasets contain different materials which are difficult to extract and
visualize with 1D transfer functions based solely on the attenuation
coefficient. Multi-dimensional transfer functions allow a much more precise
classification of data which makes it easier to separate different surfaces
from each other. Unfortunately, setting up multi-dimensional transfer functions
can become a fairly complex task, generally accomplished by trial and error.
This paper explains neural networks, and then presents an efficient way to
speed up visualization process by semi-automatic transfer function generation.
We describe how to use neural networks to detect distinctive features shown in
the 2D histogram of the volume data and how to use this information for data
classification.
","[{'version': 'v1', 'created': 'Wed, 18 Jun 2008 08:36:15 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Jun 2009 08:25:23 GMT'}]",2009-06-12,"[['Zukić', 'Dženan', ''], ['Elsner', 'Andreas', ''], ['Avdagić', 'Zikrija', ''], ['Domik', 'Gitta', '']]","['Neural networks', 'CT scans', 'medical visualization software', '2D transfer functions']"
15653,1310.1378,Irene Guessarian,"Patrick C\'egielski, Serge Grigorieff, Ir\`ene Guessarian","On Lattices of Regular Sets of Natural Integers Closed under
  Decrementation",,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider lattices of regular sets of non negative integers, i.e. of sets
definable in Presbuger arithmetic. We prove that if such a lattice is closed
under decrement then it is also closed under many other functions: quotients by
an integer, roots, etc.
","[{'version': 'v1', 'created': 'Fri, 4 Oct 2013 19:17:45 GMT'}]",2013-10-07,"[['Cégielski', 'Patrick', ''], ['Grigorieff', 'Serge', ''], ['Guessarian', 'Irène', '']]","['Lattices', 'lattices of subsets of N', 'regular subsets of N', 'closureproperties']"
15654,1512.02573,Nour El-Mawass,"Nour El-Mawass, Saad Alaboodi",Hunting for Spammers: Detecting Evolved Spammers on Twitter,,,,,cs.IR cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Once an email problem, spam has nowadays branched into new territories with
disruptive effects. In particular, spam has established itself over the recent
years as a ubiquitous, annoying, and sometimes threatening aspect of online
social networks. Due to its prevalent existence, many works have tackled spam
on Twitter from different angles. Spam is, however, a moving target. The new
generation of spammers on Twitter has evolved into online creatures that are
not easily recognizable by old detection systems. With the strong tangled
spamming community, automatic tweeting scripts, and the ability to massively
create Twitter accounts with a negligible cost, spam on Twitter is becoming
smarter, fuzzier and harder to detect. Our own analysis of spam content on
Arabic trending hashtags in Saudi Arabia results in an estimate of about three
quarters of the total generated content. This alarming rate makes the
development of adaptive spam detection techniques a very real and pressing
need. In this paper, we analyze the spam content of trending hashtags on Saudi
Twitter, and assess the performance of previous spam detection systems on our
recently gathered dataset. Due to the escalating manipulation that
characterizes newer spamming accounts, simple manual labeling currently leads
to inaccurate results. In order to get reliable ground-truth data, we propose
an updated manual classification algorithm that avoids the deficiencies of
older manual approaches. We also adapt the previously proposed features to
respond to spammers evading techniques, and use these features to build a new
data-driven detection system.
","[{'version': 'v1', 'created': 'Tue, 8 Dec 2015 18:21:31 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Dec 2015 21:53:18 GMT'}]",2015-12-17,"[['El-Mawass', 'Nour', ''], ['Alaboodi', 'Saad', '']]","['Online Social Network', 'Spam Detection', 'Machine Learning', 'Supervised Classification', 'Twitter']"
15655,1705.08942,"Necva B\""ol\""uc\""u","Necva B\""ol\""uc\""u and Burcu Can",Joint PoS Tagging and Stemming for Agglutinative Languages,"12 pages with 3 figures, accepted and presented at the CICLING 2017 -
  18th International Conference on Intelligent Text Processing and
  Computational Linguistics",CICLING 2017,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The number of word forms in agglutinative languages is theoretically infinite
and this variety in word forms introduces sparsity in many natural language
processing tasks. Part-of-speech tagging (PoS tagging) is one of these tasks
that often suffers from sparsity. In this paper, we present an unsupervised
Bayesian model using Hidden Markov Models (HMMs) for joint PoS tagging and
stemming for agglutinative languages. We use stemming to reduce sparsity in PoS
tagging. Two tasks are jointly performed to provide a mutual benefit in both
tasks. Our results show that joint POS tagging and stemming improves PoS
tagging scores. We present results for Turkish and Finnish as agglutinative
languages and English as a morphologically poor language.
","[{'version': 'v1', 'created': 'Wed, 24 May 2017 19:44:35 GMT'}]",2017-05-26,"[['Bölücü', 'Necva', ''], ['Can', 'Burcu', '']]","['unsupervised learning', 'part-of-speech tagging (PoS tagging)', 'stemming', 'Bayesian learning', 'hidden Markov models (HMMs)']"
15656,1309.7262,Ahmed Abbasi,"F. Mariam Zahedi, Ahmed Abbasi and Yan Chen",Design Elements that Promote the use of Fake Website Detection Tools,"Zahedi, F. M., Abbasi, A., and Chen, Y. ""Design Elements that Promote
  the use of Fake Website Detection Tools,"" In Proceedings of the 10th Annual
  AIS SIG-HCI Workshop, Shanghai, China, December 4, 2011",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fake websites have emerged as a major source of online fraud, accounting for
billions of dollars of loss by Internet users. We explore the process by which
salient design elements could increase the use of protective tools, thus
reducing the success rate of fake websites. Using the protection motivation
theory, we conceptualize a model to investigate how salient design elements of
detection tools could influence user perceptions of the tools, efficacy in
dealing with threats, and use of such tools. The research method was a
controlled lab experiment with a novel and extensive experimental design and
protocol. We found that trust in the detector is the pivotal coping mechanism
in dealing with security threats and is a major conduit for transforming
salient design elements into increased use. We also found that design elements
have profound and unexpected impacts on self-efficacy. The significant
theoretical and empirical implications of findings are discussed.
","[{'version': 'v1', 'created': 'Fri, 27 Sep 2013 15:04:47 GMT'}]",2013-09-30,"[['Zahedi', 'F. Mariam', ''], ['Abbasi', 'Ahmed', ''], ['Chen', 'Yan', '']]","['protection motivation theory', 'experimental design', 'spoofed websites', 'concocted websites', 'detection tool', 'protective IT artifact']"
15657,1704.07351,Mostafa Haghir Chehreghani,Mostafa Haghir Chehreghani and Talel Abdessalem and and Albert Bifet,"Metropolis-Hastings Algorithms for Estimating Betweenness Centrality in
  Large Networks",14 pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Betweenness centrality is an important index widely used in different domains
such as social networks, traffic networks and the world wide web. However, even
for mid-size networks that have only a few hundreds thousands vertices, it is
computationally expensive to compute exact betweenness scores. Therefore in
recent years, several approximate algorithms have been developed. In this
paper, first given a network $G$ and a vertex $r \in V(G)$, we propose a
Metropolis-Hastings MCMC algorithm that samples from the space $V(G)$ and
estimates betweenness score of $r$. The stationary distribution of our MCMC
sampler is the optimal sampling proposed for betweenness centrality estimation.
We show that our MCMC sampler provides an $(\epsilon,\delta)$-approximation,
where the number of required samples depends on the position of $r$ in $G$ and
in many cases, it is a constant. Then, given a network $G$ and a set $R \subset
V(G)$, we present a Metropolis-Hastings MCMC sampler that samples from the
joint space $R$ and $V(G)$ and estimates relative betweenness scores of the
vertices in $R$. We show that for any pair $r_i, r_j \in R$, the ratio of the
expected values of the estimated relative betweenness scores of $r_i$ and $r_j$
respect to each other is equal to the ratio of their betweenness scores. We
also show that our joint-space MCMC sampler provides an
$(\epsilon,\delta)$-approximation of the relative betweenness score of $r_i$
respect to $r_j$, where the number of required samples depends on the position
of $r_j$ in $G$ and in many cases, it is a constant.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 17:45:31 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Apr 2017 09:22:58 GMT'}, {'version': 'v3', 'created': 'Wed, 3 May 2017 22:54:01 GMT'}]",2017-05-05,"[['Chehreghani', 'Mostafa Haghir', ''], ['Abdessalem', 'Talel', ''], ['Bifet', 'and Albert', '']]","['Network analysis', 'betweenness centrality', 'relative betweenness score', 'approximate algorithm', 'Metropolis-Hastings algorithm', 'MCMC algorithm']"
15658,1501.04557,Antoni Portero,"Radim Vav\v{r}\'ik, Antoni Portero, \v{S}t\v{e}p\'an Kucha\v{r},
  Martin Golasowski, Simone Libutti, Giuseppe Massari, William Fornaciari,
  V\'it Vondr\'ak","Precision-Aware application execution for Energy-optimization in HPC
  node system","Presented at HIP3ES, 2015 (arXiv: 1501.03064)",,,HIP3ES/2015/05,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Power consumption is a critical consideration in high performance computing
systems and it is becoming the limiting factor to build and operate Petascale
and Exascale systems. When studying the power consumption of existing systems
running HPC workloads, we find that power, energy and performance are closely
related which leads to the possibility to optimize energy consumption without
sacrificing (much or at all) the performance. In this paper, we propose a HPC
system running with a GNU/Linux OS and a Real Time Resource Manager (RTRM) that
is aware and monitors the healthy of the platform. On the system, an
application for disaster management runs. The application can run with
different QoS depending on the situation. We defined two main situations.
Normal execution, when there is no risk of a disaster, even though we still
have to run the system to look ahead in the near future if the situation
changes suddenly. In the second scenario, the possibilities for a disaster are
very high. Then the allocation of more resources for improving the precision
and the human decision has to be taken into account. The paper shows that at
design time, it is possible to describe different optimal points that are going
to be used at runtime by the RTOS with the application. This environment helps
to the system that must run 24/7 in saving energy with the trade-off of losing
precision. The paper shows a model execution which can improve the precision of
results by 65% in average by increasing the number of iterations from 1e3 to
1e4. This also produces one order of magnitude longer execution time which
leads to the need to use a multi-node solution. The optimal trade-off between
precision vs. execution time is computed by the RTOS with the time overhead
less than 10% against a native execution.
","[{'version': 'v1', 'created': 'Mon, 19 Jan 2015 16:56:10 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Jan 2015 13:34:07 GMT'}]",2015-01-27,"[['Vavřík', 'Radim', ''], ['Portero', 'Antoni', ''], ['Kuchař', 'Štěpán', ''], ['Golasowski', 'Martin', ''], ['Libutti', 'Simone', ''], ['Massari', 'Giuseppe', ''], ['Fornaciari', 'William', ''], ['Vondrák', 'Vít', '']]","['HPC systems', 'disaster management', 'runtime resource management']"
15659,1212.4702,Mahyuddin K. M.  Nasution,Mahyuddin K. M. Nasution,Simple Search Engine Model: Adaptive Properties for Doubleton,"5 pages, nothing, a draf",,,,cs.IR cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we study the relationship between query and search engine by
exploring the adaptive properties for doubleton as a space of event based on a
simple search engine. We employ set theory for defining doubleton and generate
some properties.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2012 15:18:09 GMT'}]",2012-12-20,"[['Nasution', 'Mahyuddin K. M.', '']]","['singleton space', 'search term', 'query', 'jaccard coefficient']"
15660,1207.6600,Rama  Badrinath,"Rama Badrinath, C. E. Veni Madhavan",Diversity in Ranking using Negative Reinforcement,,,,,cs.IR cs.AI cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider the problem of diversity in ranking of the nodes
in a graph. The task is to pick the top-k nodes in the graph which are both
'central' and 'diverse'. Many graph-based models of NLP like text
summarization, opinion summarization involve the concept of diversity in
generating the summaries. We develop a novel method which works in an iterative
fashion based on random walks to achieve diversity. Specifically, we use
negative reinforcement as a main tool to introduce diversity in the
Personalized PageRank framework. Experiments on two benchmark datasets show
that our algorithm is competitive to the existing methods.
","[{'version': 'v1', 'created': 'Fri, 27 Jul 2012 17:16:59 GMT'}]",2015-03-20,"[['Badrinath', 'Rama', ''], ['Madhavan', 'C. E. Veni', '']]","['Diversity', 'Ranking', 'Negative reinforcement', 'Personalized pagerank']"
15661,1707.08998,Imane Guellil,"Im\`ene Guellil (ESI), Fai\c{c}al Azouaou (ESI)","ASDA : Analyseur Syntaxique du Dialecte Alg{\'e}rien dans un but
  d'analyse s{\'e}mantique",,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Opinion mining and sentiment analysis in social media is a research issue
having a great interest in the scientific community. However, before begin this
analysis, we are faced with a set of problems. In particular, the problem of
the richness of languages and dialects within these media. To address this
problem, we propose in this paper an approach of construction and
implementation of Syntactic analyzer named ASDA. This tool represents a parser
for the Algerian dialect that label the terms of a given corpus. Thus, we
construct a labeling table containing for each term its stem, different
prefixes and suffixes, allowing us to determine the different grammatical parts
a sort of POS tagging. This labeling will serve us later in the semantic
processing of the Algerian dialect, like the automatic translation of this
dialect or sentiment analysis
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 07:48:46 GMT'}]",2017-07-31,"[['Guellil', 'Imène', '', 'ESI'], ['Azouaou', 'Faiçal', '', 'ESI']]","['Dialecte algérien', 'analyseur syntaxique', 'analyse de']"
15662,1109.5282,Elena Villarreal Zapata,"Elena Villarreal Zapata, Francisco Cruz Ordaz Salazar",Aut\'omatas celulares elementales aplicados a la encriptaci\'on de datos,,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For data ciphering a key is usually needed as a base, so it is indispensable
to have one that is strong and trustworthy, so as to keep others from accessing
the ciphered data. This requires a pseudo-random number generator that would
provide such a key, so it is proposed to work with cellular automata helped
along with \emph{Mathematica} to check that the rules and to what level are
actually pseudo-random. This project centers on the examination of possible
mathematical rules, analyzing their characteristics in a detailed manner, and
submitting them to a set of randomness tests with the end of knowing which of
them will enable us to obtain those pseudo-random numbers that will conform the
key for data ciphering.
","[{'version': 'v1', 'created': 'Sat, 24 Sep 2011 16:14:07 GMT'}]",2011-09-27,"[['Zapata', 'Elena Villarreal', ''], ['Salazar', 'Francisco Cruz Ordaz', '']]","['aut´omatas celulares', 'pseudo-aleatoriedad', 'cifrado dedatos']"
15663,1304.3438,Alan Bundy,Alan Bundy,Incidence Calculus: A Mechanism for Probabilistic Reasoning,"Appears in Proceedings of the First Conference on Uncertainty in
  Artificial Intelligence (UAI1985)",,,UAI-P-1985-PG-177-184,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mechanisms for the automation of uncertainty are required for expert systems.
Sometimes these mechanisms need to obey the properties of probabilistic
reasoning. A purely numeric mechanism, like those proposed so far, cannot
provide a probabilistic logic with truth functional connectives. We propose an
alternative mechanism, Incidence Calculus, which is based on a representation
of uncertainty using sets of points, which might represent situations, models
or possible worlds. Incidence Calculus does provide a probabilistic logic with
truth functional connectives.
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2013 19:57:29 GMT'}]",2013-04-15,"[['Bundy', 'Alan', '']]","['Incidence Calculus', 'probability', 'uncertainty', 'logic', 'expert systems', 'inference']"
15664,1406.4007,Dibya Jyoti Bora,"Dibya Jyoti Bora, Anil Kumar Gupta","Impact of Exponent Parameter Value for the Partition Matrix on the
  Performance of Fuzzy C Means Algorithm","5 pages,8 figures, 2 tables, Soft clustering, Fuzzy C Means.
  IJSRCSAMS, Volume 3, Issue 3, May 2014",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Soft Clustering plays a very important rule on clustering real world data
where a data item contributes to more than one cluster. Fuzzy logic based
algorithms are always suitable for performing soft clustering tasks. Fuzzy C
Means (FCM) algorithm is a very popular fuzzy logic based algorithm. In case of
fuzzy logic based algorithm, the parameter like exponent for the partition
matrix that we have to fix for the clustering task plays a very important rule
on the performance of the algorithm. In this paper, an experimental analysis is
done on FCM algorithm to observe the impact of this parameter on the
performance of the algorithm.
","[{'version': 'v1', 'created': 'Mon, 16 Jun 2014 13:22:18 GMT'}]",2014-06-17,"[['Bora', 'Dibya Jyoti', ''], ['Gupta', 'Anil Kumar', '']]","['Clustering', 'FCM', 'Matlab', 'Soft clustering']"
15665,0805.3802,Vitaly Schetinin,L. Jakaite and V. Schetinin,Feature Selection for Bayesian Evaluation of Trauma Death Risk,"4 pages, 14th Nordic Baltic Conference on Biomedical Engineering and
  Medical Physics",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last year more than 70,000 people have been brought to the UK
hospitals with serious injuries. Each time a clinician has to urgently take a
patient through a screening procedure to make a reliable decision on the trauma
treatment. Typically, such procedure comprises around 20 tests; however the
condition of a trauma patient remains very difficult to be tested properly.
What happens if these tests are ambiguously interpreted, and information about
the severity of the injury will come misleading? The mistake in a decision can
be fatal: using a mild treatment can put a patient at risk of dying from
posttraumatic shock, while using an overtreatment can also cause death. How can
we reduce the risk of the death caused by unreliable decisions? It has been
shown that probabilistic reasoning, based on the Bayesian methodology of
averaging over decision models, allows clinicians to evaluate the uncertainty
in decision making. Based on this methodology, in this paper we aim at
selecting the most important screening tests, keeping a high performance. We
assume that the probabilistic reasoning within the Bayesian methodology allows
us to discover new relationships between the screening tests and uncertainty in
decisions. In practice, selection of the most informative tests can also reduce
the cost of a screening procedure in trauma care centers. In our experiments we
use the UK Trauma data to compare the efficiency of the proposed technique in
terms of the performance. We also compare the uncertainty in decisions in terms
of entropy.
","[{'version': 'v1', 'created': 'Sun, 25 May 2008 00:06:29 GMT'}]",2008-05-27,"[['Jakaite', 'L.', ''], ['Schetinin', 'V.', '']]","['Bayesian model averaging', 'MCMC', 'decision tree', 'trauma care', 'feature selection']"
15666,1603.03530,Pengfei Lu,"Pengfei Lu, Yang You, Bo Liu, Zhenqiang Wu","A Vertical Channel Model of Molecular Communication based on Alcohol
  Molecules","5 pages,7 figures, Accepted for presentation at BICT 2015 Special
  Track on Molecular Communication and Networking (MCN). arXiv admin note: text
  overlap with arXiv:1311.6208 by other authors",,,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The study of Molecular Communication(MC) is more and more prevalence, and
channel model of MC plays an important role in the MC System. Since different
propagation environment and modulation techniques produce different channel
model, most of the research about MC are in horizontal direction,but in nature
the communications between nano machines are in short range and some of the
information transportation are in the vertical direction, such as transpiration
of plants, biological pump in ocean, and blood transportation from heart to
brain. Therefore, this paper we propose a vertical channel model which
nano-machines communicate with each other in the vertical direction based on
pure diffusion. We first propose a vertical molecular communication model, we
mainly considered the gravity as the factor, though the channel model is also
affected by other main factors, such as the flow of the medium, the distance
between the transmitter and the receiver, the delay or sensitivity of the
transmitter and the receiver. Secondly, we set up a test-bed for this vertical
channel model, in order to verify the difference between the theory result and
the experiment data. At last, we use the data we get from the experiment and
the non-linear least squares method to get the parameters to make our channel
model more accurate.
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2016 06:06:22 GMT'}]",2016-03-14,"[['Lu', 'Pengfei', ''], ['You', 'Yang', ''], ['Liu', 'Bo', ''], ['Wu', 'Zhenqiang', '']]","['Molecular Communication', 'Vertical Channel Model', 'testbed', 'gravity', 'non-linear least squares method']"
15667,0910.2626,Arijit  Laha Ph.D.,Arijit Laha,"On challenges and opportunities of designing integrated IT platforms for
  supporting knowledge works in organizations","39 pages, Sibmitted to journal Vikalpa","Vikalpa: The Journal for Decision Makers, Volume 36, No 3, pp 35 -
  60, Jul - Sep 2011",,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Designing and implementing comprehensive IT-based support environments for KM
in organizations is fraught with many problems. Solving them requires intimate
knowledge about the information usage in knowledge works and the scopes of
technology intervention. In this paper, the Task-oriented Organizational
Knowledge Management or TOKM, a design theory for building integrated IT
platforms for supporting organizational KM, is proposed. TOKM brings together
two apparently mutually exclusive practices of building KM systems, the
task-based approach and the generic or universalistic approach. In developing
the design, the information requirements of knowledge workers in light of an
information usage model of knowledge works is studied. Then the model is
extended to study possibilities of more advanced IT support and formulate them
in form of a set of meta-requirements. Following the IS design theory paradigm,
a set of artifacts are hypothesized to meet the requirements. Finally, a design
method, as a possible approach of building an IT-based integrated platform, the
Knowledge Work Support Platform (KWSP) to realize the artifacts in order to
meet the requirements, is outlined. The KWSP is a powerful platform for
building and maintaining a number of task-type specific Knowledge Work Support
Systems (KWSS) on a common sharable platform. Each KWSS, for the task-type
supported by it, can be easily designed to provide extensive and sophisticated
support to individual as well as group of knowledge workers in performing their
respective knowledge work instances
","[{'version': 'v1', 'created': 'Wed, 14 Oct 2009 13:55:57 GMT'}]",2011-12-23,"[['Laha', 'Arijit', '']]","['knowledge management', 'information system', 'design theory', 'knowledge-work']"
15668,1205.5003,Anissa Lamani,"Ajoy K. Datta, Anissa Lamani (MIS), Lawrence L. Larmore, Franck Petit
  (LIP6)",Ring Exploration with Oblivious Myopic Robots,(2012),,,,cs.MA cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The exploration problem in the discrete universe, using identical oblivious
asynchronous robots without direct communication, has been well investigated.
These robots have sensors that allow them to see their environment and move
accordingly. However, the previous work on this problem assume that robots have
an unlimited visibility, that is, they can see the position of all the other
robots. In this paper, we consider deterministic exploration in an anonymous,
unoriented ring using asynchronous, oblivious, and myopic robots. By myopic, we
mean that the robots have only a limited visibility. We study the computational
limits imposed by such robots and we show that under some conditions the
exploration problem can still be solved. We study the cases where the robots
visibility is limited to 1, 2, and 3 neighboring nodes, respectively.
","[{'version': 'v1', 'created': 'Tue, 22 May 2012 18:50:48 GMT'}]",2012-05-23,"[['Datta', 'Ajoy K.', '', 'MIS'], ['Lamani', 'Anissa', '', 'MIS'], ['Larmore', 'Lawrence L.', '', 'LIP6'], ['Petit', 'Franck', '', 'LIP6']]","['Asynchronous Anonymous Oblivious Robots', 'Deterministic Exploration', 'Discrete Environment', 'Limited Visibility']"
15669,1401.4848,Ronald Hochreiter,Ronald Hochreiter and Christoph Waldhauser,An Evolutionary Approach towards Clustering Airborne Laser Scanning Data,,Proceedings of MENDEL 2012: 7-12. 2012,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In land surveying, the generation of maps was greatly simplified with the
introduction of orthophotos and at a later stage with airborne LiDAR laser
scanning systems. While the original purpose of LiDAR systems was to determine
the altitude of ground elevations, newer full wave systems provide additional
information that can be used on classifying the type of ground cover and the
generation of maps. The LiDAR resulting point clouds are huge, multidimensional
data sets that need to be grouped in classes of ground cover. We propose a
genetic algorithm that aids in classifying these data sets and thus make them
usable for map generation. A key feature are tailor-made genetic operators and
fitness functions for the subject. The algorithm is compared to a traditional
k-means clustering.
","[{'version': 'v1', 'created': 'Mon, 20 Jan 2014 10:22:41 GMT'}]",2014-01-21,"[['Hochreiter', 'Ronald', ''], ['Waldhauser', 'Christoph', '']]","['genetic algorithm', 'airborne laser scanning', 'clustering', 'Dunn index']"
15670,1802.09100,Ahmed Fadhil,Ahmed Fadhil,"Can a Chatbot Determine My Diet?: Addressing Challenges of Chatbot
  Application for Meal Recommendation",6 pages,,,,cs.AI cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Poor nutrition can lead to reduced immunity, increased susceptibility to
disease, impaired physical and mental development, and reduced productivity. A
conversational agent can support people as a virtual coach, however building
such systems still have its associated challenges and limitations. This paper
describes the background and motivation for chatbot systems in the context of
healthy nutrition recommendation. We discuss current challenges associated with
chatbot application, we tackled technical, theoretical, behavioural, and social
aspects of the challenges. We then propose a pipeline to be used as guidelines
by developers to implement theoretically and technically robust chatbot
systems.
","[{'version': 'v1', 'created': 'Sun, 25 Feb 2018 22:30:10 GMT'}]",2018-02-27,"[['Fadhil', 'Ahmed', '']]","['Health', 'Conversational agent', 'Recommender sys']"
15671,1501.01254,Manoj Jayaweera,A.J.P.M.P. Jayaweera and N.G.J. Dias,Unknown Words Analysis in POS tagging of Sinhala Language,7 pages,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Part of Speech (POS) is a very vital topic in Natural Language Processing
(NLP) task in any language, which involves analysing the construction of the
language, behaviours and the dynamics of the language, the knowledge that could
be utilized in computational linguistics analysis and automation applications.
In this context, dealing with unknown words (words do not appear in the lexicon
referred as unknown words) is also an important task, since growing NLP systems
are used in more and more new applications. One aid of predicting lexical
categories of unknown words is the use of syntactical knowledge of the
language. The distinction between open class words and closed class words
together with syntactical features of the language used in this research to
predict lexical categories of unknown words in the tagging process. An
experiment is performed to investigate the ability of the approach to parse
unknown words using syntactical knowledge without human intervention. This
experiment shows that the performance of the tagging process is enhanced when
word class distinction is used together with syntactic rules to parse sentences
containing unknown words in Sinhala language.
","[{'version': 'v1', 'created': 'Tue, 6 Jan 2015 18:03:13 GMT'}]",2015-01-07,"[['Jayaweera', 'A. J. P. M. P.', ''], ['Dias', 'N. G. J.', '']]","['Natural Language Processing', 'Part of Speech tagging', 'Morphology', 'Unknown words', 'Sinhala Language']"
15672,1205.5742,Ashraf Qadir,"Ashraf Qadir, William Semke, and Jeremiah Neubert","Implementation of an Onboard Visual Tracking System with Small Unmanned
  Aerial Vehicle (UAV)","9 pages; 6 figures; International Journal of Innovative Technology
  and Creative Engineering (ISSN:2045-8711) VOl.1 No. 10 OCTOBER 2011",,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a visual tracking system that is capable or running real
time on-board a small UAV (Unmanned Aerial Vehicle). The tracking system is
computationally efficient and invariant to lighting changes and rotation of the
object or the camera. Detection and tracking is autonomously carried out on the
payload computer and there are two different methods for creation of the image
patches. The first method starts detecting and tracking using a stored image
patch created prior to flight with previous flight data. The second method
allows the operator on the ground to select the interest object for the UAV to
track. The tracking system is capable of re-detecting the object of interest in
the events of tracking failure. Performance of the tracking system was verified
both in the lab and during actual flights of the UAV. Results show that the
system can run on-board and track a diverse set of objects in real time.
","[{'version': 'v1', 'created': 'Fri, 25 May 2012 16:08:11 GMT'}]",2012-05-28,"[['Qadir', 'Ashraf', ''], ['Semke', 'William', ''], ['Neubert', 'Jeremiah', '']]","['Unmanned Aerial Vehicle (UAV)', 'Visual Tracking', 'Kalman filter', 'Zero Mean Normalized Cross Correlation (ZMNCC)', 'Image Warping', 'Three axes Gimbal']"
15673,1401.2086,L.A. Prashanth,"H.L Prasad, L.A.Prashanth and Shalabh Bhatnagar","Actor-Critic Algorithms for Learning Nash Equilibria in N-player
  General-Sum Games",,,,,cs.GT cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of finding stationary Nash equilibria (NE) in a
finite discounted general-sum stochastic game. We first generalize a non-linear
optimization problem from Filar and Vrieze [2004] to a $N$-player setting and
break down this problem into simpler sub-problems that ensure there is no
Bellman error for a given state and an agent. We then provide a
characterization of solution points of these sub-problems that correspond to
Nash equilibria of the underlying game and for this purpose, we derive a set of
necessary and sufficient SG-SP (Stochastic Game - Sub-Problem) conditions.
Using these conditions, we develop two actor-critic algorithms: OFF-SGSP
(model-based) and ON-SGSP (model-free). Both algorithms use a critic that
estimates the value function for a fixed policy and an actor that performs
descent in the policy space using a descent direction that avoids local minima.
We establish that both algorithms converge, in self-play, to the equilibria of
a certain ordinary differential equation (ODE), whose stable limit points
coincide with stationary NE of the underlying general-sum stochastic game. On a
single state non-generic game (see Hart and Mas-Colell [2005]) as well as on a
synthetic two-player game setup with $810,000$ states, we establish that
ON-SGSP consistently outperforms NashQ ([Hu and Wellman, 2003] and FFQ
[Littman, 2001] algorithms.
","[{'version': 'v1', 'created': 'Wed, 8 Jan 2014 12:47:15 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Jul 2015 20:09:17 GMT'}]",2015-07-06,"[['Prasad', 'H. L', ''], ['Prashanth', 'L. A.', ''], ['Bhatnagar', 'Shalabh', '']]","['General-sum discounted stochastic games', 'Nash equilibrium', 'multi-agent reinforcement learning', 'multi-timescale stochastic approximation']"
15674,1704.04083,Lin Sok,"Lin Sok, Minjia Shi and Patrick Sol\'e",Constructions of optimal LCD codes over large finite fields,"This paper was presented in part at the International Conference on
  Coding, Cryptography and Related Topics April 7-10, 2017, Shandong, China",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we prove existence of optimal complementary dual codes (LCD
codes) over large finite fields. We also give methods to generate orthogonal
matrices over finite fields and then apply them to construct LCD codes.
Construction methods include random sampling in the orthogonal group, code
extension, matrix product codes and projection over a self-dual basis.
","[{'version': 'v1', 'created': 'Thu, 13 Apr 2017 12:00:13 GMT'}]",2017-04-14,"[['Sok', 'Lin', ''], ['Shi', 'Minjia', ''], ['Solé', 'Patrick', '']]","['Orthogonal matrices', 'complementary dual codes', 'matrix product codes', 'optimal codes']"
15675,1206.2959,Venkatesan Ekambaram,"Venkatesan. N. Ekambaram, Kannan Ramchandran, Raja Sengupta","Collaborative High Accuracy Localization in Mobile Multipath
  Environments",,,,,cs.NI cs.IT cs.RO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of high accuracy localization of mobile nodes in a
multipath-rich environment where sub-meter accuracies are required. We employ a
peer-to-peer framework where the vehicles/nodes can get pairwise
multipath-degraded ranging estimates in local neighborhoods together with a
fixed number of anchor nodes. The challenge is to overcome the
multipath-barrier with redundancy in order to provide the desired accuracies
especially under severe multipath conditions when the fraction of received
signals corrupted by multipath is dominating. We invoke a analytical graphical
model framework based on particle filtering and reveal its high accuracy
localization promise through simulations. We also address design questions such
as ""How many anchors and what fraction of line-of-sight (LOS) measurements are
needed to achieve a specified target accuracy?"", by analytically characterizing
the performance improvement in localization accuracy as a function of the
number of nodes in the network and the fraction of LOS measurements. In
particular, for a static node placement, we show that the Cramer-Rao Lower
Bound (CRLB), a fundamental lower bound on the localization accuracy, can be
expressed as a product of two factors - a scalar function that depends only on
the parameters of the noise distribution and a matrix that depends only on the
geometry of node locations and the underlying connectivity graph. Further, a
simplified expression is obtained for the CRLB that helps deduce the scaling
behavior of the estimation error as a function of the number of agents and
anchors in the network. The bound suggests that even a small fraction of LOS
measurements can provide significant improvements. Conversely, a small fraction
of NLOS measurements can significantly degrade the performance. The analysis is
extended to the mobile setting and the performance is compared with the derived
CRLB.
","[{'version': 'v1', 'created': 'Wed, 13 Jun 2012 22:42:16 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Nov 2012 03:36:29 GMT'}]",2012-11-09,"[['Ekambaram', 'Venkatesan. N.', ''], ['Ramchandran', 'Kannan', ''], ['Sengupta', 'Raja', '']]","['Localization', 'Multipath', 'Graphical Models', 'Particle Filtering', 'Cramer Rao Bound']"
15676,1605.00085,Ramkumar Lakshminarayanan,"Ramkumar Lakshminarayanan, Rajasekar Ramalingam","Usage of Cloud Computing Simulators and Future Systems For Computational
  Research","ETRT-ICT 2016 - College of Applied Sciences, Salalah, Sultanate of
  Oman",,,,cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Cloud Computing is an Internet based computing, whereby shared resources,
software and information, are provided to computers and devices on demand, like
the electricity grid. Currently, IaaS (Infrastructure as a Service), PaaS
(Platform as a Service) and SaaS (Software as a Service) are used as a business
model for Cloud Computing. Nowadays, the adoption and deployment of Cloud
Computing is increasing in various domains, forcing researchers to conduct
research in the area of Cloud Computing globally. Setting up the research
environment is critical for the researchers in the developing countries to
evaluate the research outputs. Currently, modeling, simulation technology and
access of resources from various university data centers has become a useful
and powerful tool in cloud computing research. Several cloud simulators have
been specifically developed by various universities to carry out Cloud
Computing research, including CloudSim, SPECI, Green Cloud and Future Systems
(the Indiana University machines India, Bravo, Delta, Echo and Foxtrot)
supports leading edge data science research and a broad range of
computing-enabled education as well as integration of ideas from cloud and HPC
systems. In this paper, the features, suitability, adaptability and the
learning curve of the existing Cloud Computing simulators and Future Systems
are reviewed and analyzed.
","[{'version': 'v1', 'created': 'Sat, 30 Apr 2016 09:30:14 GMT'}]",2016-05-03,"[['Lakshminarayanan', 'Ramkumar', ''], ['Ramalingam', 'Rajasekar', '']]","['Cloud Computing', 'Simulators', 'Future System']"
15677,1209.5756,Souli Sameh,"Sameh Souli, Zied Lachiri","Environmental Sounds Spectrogram Classification using Log-Gabor Filters
  and Multiclass Support Vector Machines",,,,,cs.CV,http://creativecommons.org/licenses/publicdomain/,"  This paper presents novel approaches for efficient feature extraction using
environmental sound magnitude spectrogram. We propose approach based on the
visual domain. This approach included three methods. The first method is based
on extraction for each spectrogram a single log-Gabor filter followed by mutual
information procedure. In the second method, the spectrogram is passed by the
same steps of the first method but with an averaged bank of 12 log-Gabor
filter. The third method consists of spectrogram segmentation into three
patches, and after that for each spectrogram patch we applied the second
method. The classification results prove that the second method is the most
efficient in our environmental sound classification system.
","[{'version': 'v1', 'created': 'Tue, 25 Sep 2012 20:11:23 GMT'}]",2012-09-27,"[['Souli', 'Sameh', ''], ['Lachiri', 'Zied', '']]","['Environmental sounds', 'Visual features', 'Log-Gabor filters', 'Spectrogram', 'SVM Multiclass']"
15678,1312.5067,Anita Das,"Anita Das, P. Suresh, S. V. Subrahmanya",Rainbow path and color degree in edge colored graphs,4 pages,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $G$ be an edge colored graph. A {\it}{rainbow path} in $G$ is a path in
which all the edges are colored with distinct colors. Let $d^c(v)$ be the color
degree of a vertex $v$ in $G$, i.e. the number of distinct colors present on
the edges incident on the vertex $v$. Let $t$ be the maximum length of a
rainbow path in $G$. Chen and Li showed that if $d^c \geq k$, for every vertex
$v$ of $G$, then $t \geq \left \lceil \frac{3 k}{5}\right \rceil + 1$ (Long
heterochromatic paths in edge-colored graphs, The Electronic Journal of
Combinatorics 12 (2005), # R33, Pages:1-33.) Unfortunately, proof by Chen and
Li is very long and comes to about 23 pages in the journal version. Chen and Li
states in their paper that it was conjectured by Akira Saito, that $t \ge \left
\lceil \frac {2k} {3} \right \rceil$. They also states in their paper that they
believe $t \ge k - c$ for some constant $c$.
  In this note, we give a short proof to show that $t \ge \left \lceil \frac{3
k}{5}\right \rceil$, using an entirely different method. Our proof is only
about 2 pages long. The draw-back is that our bound is less by 1, than the
bound given by Chen and Li. We hope that the new approach adopted in this paper
would eventually lead to the settlement of the conjectures by Saito and/or Chen
and Li.
","[{'version': 'v1', 'created': 'Wed, 18 Dec 2013 09:17:36 GMT'}]",2013-12-19,"[['Das', 'Anita', ''], ['Suresh', 'P.', ''], ['Subrahmanya', 'S. V.', '']]","['Edge colored graphs', 'rainbow path', 'color degree']"
15679,1705.06821,Zhengyang Wang,"Zhengyang Wang, Hao Yuan, Shuiwang Ji","Spatial Variational Auto-Encoding via Matrix-Variate Normal
  Distributions","Accepted by SDM2019. Code is publicly available at
  https://github.com/divelab/svae",,,,cs.LG cs.CV cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The key idea of variational auto-encoders (VAEs) resembles that of
traditional auto-encoder models in which spatial information is supposed to be
explicitly encoded in the latent space. However, the latent variables in VAEs
are vectors, which can be interpreted as multiple feature maps of size 1x1.
Such representations can only convey spatial information implicitly when
coupled with powerful decoders. In this work, we propose spatial VAEs that use
feature maps of larger size as latent variables to explicitly capture spatial
information. This is achieved by allowing the latent variables to be sampled
from matrix-variate normal (MVN) distributions whose parameters are computed
from the encoder network. To increase dependencies among locations on latent
feature maps and reduce the number of parameters, we further propose spatial
VAEs via low-rank MVN distributions. Experimental results show that the
proposed spatial VAEs outperform original VAEs in capturing rich structural and
spatial information.
","[{'version': 'v1', 'created': 'Thu, 18 May 2017 22:32:57 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Jan 2019 17:48:22 GMT'}]",2019-01-23,"[['Wang', 'Zhengyang', ''], ['Yuan', 'Hao', ''], ['Ji', 'Shuiwang', '']]","['Deeplearning', 'variationalauto-encoders', 'matrixvariate normal distributions', 'generative models', 'unsupervised learning']"
15680,1209.6151,Thai Le,"Thai Hoang Le, Truong Nhat Vo",Face Alignment Using Active Shape Model And Support Vector Machine,11 pages and 11 figures,"International Journal of Biometrics and Bioinformatics, 2011,
  Volume (4): Issue (6), pp. 224-234",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Active Shape Model (ASM) is one of the most popular local texture models
for face alignment. It applies in many fields such as locating facial features
in the image, face synthesis, etc. However, the experimental results show that
the accuracy of the classical ASM for some applications is not high. This paper
suggests some improvements on the classical ASM to increase the performance of
the model in the application: face alignment. Four of our major improvements
include: i) building a model combining Sobel filter and the 2-D profile in
searching face in image; ii) applying Canny algorithm for the enhancement edge
on image; iii) Support Vector Machine (SVM) is used to classify landmarks on
face, in order to determine exactly location of these landmarks support for
ASM; iv)automatically adjust 2-D profile in the multi-level model based on the
size of the input image. The experimental results on Caltech face database and
Technical University of Denmark database (imm_face) show that our proposed
improvement leads to far better performance.
","[{'version': 'v1', 'created': 'Thu, 27 Sep 2012 07:58:10 GMT'}]",2012-09-28,"[['Le', 'Thai Hoang', ''], ['Vo', 'Truong Nhat', '']]","['Face Alignment', 'Active Shape Model', 'Principal Component Analysis']"
15681,1406.5614,Shiliang Sun,"Shiliang Sun, John Shawe-Taylor, Liang Mao",PAC-Bayes Analysis of Multi-view Learning,35 pages,,,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents eight PAC-Bayes bounds to analyze the generalization
performance of multi-view classifiers. These bounds adopt data dependent
Gaussian priors which emphasize classifiers with high view agreements. The
center of the prior for the first two bounds is the origin, while the center of
the prior for the third and fourth bounds is given by a data dependent vector.
An important technique to obtain these bounds is two derived logarithmic
determinant inequalities whose difference lies in whether the dimensionality of
data is involved. The centers of the fifth and sixth bounds are calculated on a
separate subset of the training set. The last two bounds use unlabeled data to
represent view agreements and are thus applicable to semi-supervised multi-view
learning. We evaluate all the presented multi-view PAC-Bayes bounds on
benchmark data and compare them with previous single-view PAC-Bayes bounds. The
usefulness and performance of the multi-view bounds are discussed.
","[{'version': 'v1', 'created': 'Sat, 21 Jun 2014 14:25:35 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Jun 2016 06:55:57 GMT'}]",2016-06-07,"[['Sun', 'Shiliang', ''], ['Shawe-Taylor', 'John', ''], ['Mao', 'Liang', '']]","['PAC-Bayes bound', 'statistical learning theory', 'support vector machine', 'multiview learning']"
15682,1403.7350,Andrew Adamatzky,Andrew Adamatzky,Slime mould electronic oscillators,,,,,cs.ET physics.bio-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We construct electronic oscillator from acellular slime mould Physarum
polycephalum. The slime mould oscillator is made of two electrodes connected by
a protoplasmic tube of the living slime mould. A protoplasmic tube has an
average resistance of 3~MOhm. The tube's resistance is changing over time due
to peristaltic contractile activity of the tube. The resistance of the
protoplasmic tube oscillates with average period of 73~sec and average
amplitude of 0.6~MOhm. We present experimental laboratory results on dynamics
of Physarum oscillator under direct current voltage up to 15~V and speculate
that slime mould P. polycephalum can be employed as a living electrical
oscillator in biological and hybrid circuits.
","[{'version': 'v1', 'created': 'Fri, 28 Mar 2014 12:01:12 GMT'}]",2014-03-31,"[['Adamatzky', 'Andrew', '']]","['oscillator', 'slime mould', 'bioelectronics']"
15683,1409.6599,Bernhard Rumpe,"Bernhard Rumpe, Astrid Schr\""oder",Quantitative Survey on Extreme Programming Projects,"6 pages, 0 figures","Third International Conference on Extreme Programming and Flexible
  Processes in Software Engineering, XP2002, May 26-30, Alghero, Italy, pg.
  95-100, 2002.(short version of TUM-I0110)",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years the Extreme Programming (XP) community has grown
substantially. Many XP projects have started and a substantial amount are
already finished. As the interest in the XP approach is constantly increasing
worldwide throughout all software intensive application domains, it was time to
start a first survey on XP. This paper presents the results of 45 evaluated
questionnaires that have been received during the Summer 2001 survey.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 17:55:29 GMT'}]",2014-09-24,"[['Rumpe', 'Bernhard', ''], ['Schröder', 'Astrid', '']]","['Extreme programming', 'XP', 'survey']"
15684,1701.05588,Mohammad Mahmoodi,Mohammad Reza Mahmoodi,"High Performance Novel Skin Segmentation Algorithm for Images With
  Complex Background",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Skin Segmentation is widely used in biometric applications such as face
detection, face recognition, face tracking, and hand gesture recognition.
However, several challenges such as nonlinear illumination, equipment effects,
personal interferences, ethnicity variations, etc., are involved in detection
process that result in the inefficiency of color based methods. Even though
many ideas have already been proposed, the problem has not been satisfactorily
solved yet. This paper introduces a technique that addresses some limitations
of the previous works. The proposed algorithm consists of three main steps
including initial seed generation of skin map, Otsu segmentation in color
images, and finally a two-stage diffusion. The initial seed of skin pixels is
provided based on the idea of ternary image as there are certain pixels in
images which are associated to human complexion with very high probability. The
Otsu segmentation is performed on several color channels in order to identify
homogeneous regions. The result accompanying with the edge map of the image is
utilized in two consecutive diffusion steps in order to annex initially
unidentified skin pixels to the seed. Both quantitative and qualitative results
demonstrate the effectiveness of the proposed system in compare with the
state-of-the-art works.
","[{'version': 'v1', 'created': 'Thu, 19 Jan 2017 20:22:58 GMT'}]",2017-01-23,"[['Mahmoodi', 'Mohammad Reza', '']]","['Skin modeling', 'Skin detection', 'Face detection', 'Skin segmentation', 'Skin classification']"
15685,0907.4876,Rajkumar Buyya,Mukaddim Pathan and Rajkumar Buyya,"Architecture and Performance Models for QoS-Driven Effective Peering of
  Content Delivery Networks","31 pages, 19 figures","Multiagent and Grid Systems, Volume 5, Number 2, Pages: 165-195,
  ISSN: 1574-1702, IOS Press, Amsterdam, The Netherlands, July 2009",,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The proprietary nature of existing Content Delivery Networks (CDNs) means
they are closed and do not naturally cooperate. A CDN is expected to provide
high performance Internet content delivery through global coverage, which might
be an obstacle for new CDN providers, as well as affecting commercial viability
of existing ones. Finding ways for distinct CDNs to coordinate and cooperate
with other CDNs is necessary to achieve better overall service, as perceived by
end-users, at lower cost. In this paper, we present an architecture to support
peering arrangements between CDNs, based on a Virtual Organization (VO) model.
Our approach promotes peering among providers, while upholding user perceived
performance. This is achieved through proper policy management of negotiated
Service Level Agreements (SLAs) between peers. We also present a Quality of
Service (QoS)-driven performance modeling approach for peering CDNs in order to
predict the user perceived performance. We show that peering between CDNs
upholds user perceived performance by satisfying the target QoS. The
methodology presented in this paper provides CDNs a way to dynamically
distribute user requests to other peers according to different
request-redirection policies. The model-based approach helps an overloaded CDN
to return to a normal state by offloading excess requests to the peers. It also
assists in making concrete QoS guarantee for a CDN provider. Our approach
endeavors to achieve scalability and resource sharing among CDNs through
effective peering in a user transparent manner, thus evolving past the current
landscape where non-cooperative and distinct CDNs exist.
","[{'version': 'v1', 'created': 'Tue, 28 Jul 2009 10:02:15 GMT'}]",2009-07-29,"[['Pathan', 'Mukaddim', ''], ['Buyya', 'Rajkumar', '']]","['Architecture', 'Content Delivery Networks', 'Modeling', 'Peering', 'QoS', 'Virtual Organization']"
15686,1605.02964,Abhilash Srikantha,"Abhilash Srikantha, Juergen Gall",Weakly Supervised Learning of Affordances,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Localizing functional regions of objects or affordances is an important
aspect of scene understanding. In this work, we cast the problem of affordance
segmentation as that of semantic image segmentation. In order to explore
various levels of supervision, we introduce a pixel-annotated affordance
dataset of 3090 images containing 9916 object instances with rich contextual
information in terms of human-object interactions. We use a deep convolutional
neural network within an expectation maximization framework to take advantage
of weakly labeled data like image level annotations or keypoint annotations. We
show that a further reduction in supervision is possible with a minimal loss in
performance when human pose is used as context.
","[{'version': 'v1', 'created': 'Tue, 10 May 2016 12:04:07 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Jul 2016 13:46:59 GMT'}]",2016-08-01,"[['Srikantha', 'Abhilash', ''], ['Gall', 'Juergen', '']]","['semantic affordance segmentation', 'weakly supervised learning', 'human context']"
15687,1505.06317,Srikrishna Bhashyam,"Praneeth Kumar V, Srikrishna Bhashyam","On the Sum Capacity of the Gaussian X Channel in the Mixed Interference
  Regime","To be presented at ISIT 2015, Hong Kong, China",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we analyze the Gaussian X channel in the mixed interference
regime. In this regime, multiple access transmission to one of the receivers is
shown to be close to optimal in terms of sum rate. Three upper bounds are
derived for the sum capacity in the mixed interference regime, and the
subregions where each of these bounds dominate the others are identified. The
genie-aided sum capacity upper bounds derived also show that the gap between
sum capacity and the sum rate of the multiple access transmission scheme is
small for a significant part of the mixed interference region. For any \delta >
0, the region where multiple access transmission to one of the receivers is
within \delta from sum capacity is determined.
","[{'version': 'v1', 'created': 'Sat, 23 May 2015 12:24:31 GMT'}]",2015-05-26,"[['Kumar', 'Praneeth', 'V'], ['Bhashyam', 'Srikrishna', '']]","['Gaussian X channel', 'sum capacity', 'mixed interference', 'genie-aided bound', 'multiple access']"
15688,1008.1596,Greg P. Kochanski,Greg Kochanski and Burton S. Rosner,"Bootstrap Markov chain Monte Carlo and optimal solutions for the Law of
  Categorical Judgment (Corrected)",,,,,cs.NA,http://creativecommons.org/licenses/by/3.0/,"  A novel procedure is described for accelerating the convergence of Markov
chain Monte Carlo computations. The algorithm uses an adaptive bootstrap
technique to generate candidate steps in the Markov Chain. It is efficient for
symmetric, convex probability distributions, similar to multivariate Gaussians,
and it can be used for Bayesian estimation or for obtaining maximum likelihood
solutions with confidence limits. As a test case, the Law of Categorical
Judgment (Corrected) was fitted with the algorithm to data sets from simulated
rating scale experiments. The correct parameters were recovered from
practical-sized data sets simulated for Full Signal Detection Theory and its
special cases of standard Signal Detection Theory and Complementary Signal
Detection Theory.
","[{'version': 'v1', 'created': 'Mon, 9 Aug 2010 21:19:36 GMT'}]",2010-12-13,"[['Kochanski', 'Greg', ''], ['Rosner', 'Burton S.', '']]","['Markov chain Monte Carlo', 'rating scale', 'Law of Categorical Judgment']"
15689,1207.4958,Arnab Bhattacharya,"Ashish Gupta, Akshay Mittal, Arnab Bhattacharya","Minimally Infrequent Itemset Mining using Pattern-Growth Paradigm and
  Residual Trees","Best paper award in International Conference on Management of Data
  (COMAD), 2011",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Itemset mining has been an active area of research due to its successful
application in various data mining scenarios including finding association
rules. Though most of the past work has been on finding frequent itemsets,
infrequent itemset mining has demonstrated its utility in web mining,
bioinformatics and other fields. In this paper, we propose a new algorithm
based on the pattern-growth paradigm to find minimally infrequent itemsets. A
minimally infrequent itemset has no subset which is also infrequent. We also
introduce the novel concept of residual trees. We further utilize the residual
trees to mine multiple level minimum support itemsets where different
thresholds are used for finding frequent itemsets for different lengths of the
itemset. Finally, we analyze the behavior of our algorithm with respect to
different parameters and show through experiments that it outperforms the
competing ones.
","[{'version': 'v1', 'created': 'Wed, 11 Jul 2012 11:11:54 GMT'}]",2012-07-23,"[['Gupta', 'Ashish', ''], ['Mittal', 'Akshay', ''], ['Bhattacharya', 'Arnab', '']]","['Itemset Mining', 'Minimal Infrequent Itemsets', 'Residual Tree', 'Projected Tree']"
15690,1511.08342,Tianqing Zhou,"Tianqing Zhou, Yongming Huang, Luxi Yang","Energy-Efficient User Association with Open Loop Power Control for
  Uplink Heterogeneous Cellular Networks",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Energy reduction for wireless systems becomes more and more important due to
its impact on the operation cost and global carbon footprint. In this paper, we
investigate three kinds of energy-efficient association schemes under open loop
power control for uplink heterogeneous cellular networks, which are formulated
as a whole energy efficiency maximization problem, a sum energy efficiency
maximization problem and a utility maximization problem respectively. The third
case takes account of load balancing level and user's fairness in the
energy-efficient association. Considering that the first problem is in a
fractional mixed-integer form, we introduce an energy efficiency parameter to
convert it into a parametric subtractive form, and then design an effective
iterative algorithm to achieve the optimal solutions. As for the third problem,
we first introduce a dual variable to decouple the constraint and then develop
a distributed algorithm using dual decomposition. In addition, we also give the
convergence proof for the proposed algorithms. In order to confirm the
effectiveness of energy-efficient user association algorithms, we introduce
other association rules for comparison, and investigate the influences of
different parameters on the association performance of these association rules.
","[{'version': 'v1', 'created': 'Thu, 26 Nov 2015 10:07:58 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Dec 2015 03:15:29 GMT'}]",2015-12-02,"[['Zhou', 'Tianqing', ''], ['Huang', 'Yongming', ''], ['Yang', 'Luxi', '']]","['Heterogeneous cellular networks', 'user association', 'power control', 'energy efficiency']"
15691,1412.6161,"\""Ozkan Karabacak Mr.","Ferruh \.Ilhan and \""Ozkan Karabacak","Graph-Based Minimum Dwell Time and Average Dwell Time Computations for
  Discrete-Time Switched Linear Systems",,"Asian Journal of Control, 18, 2018-2026, 2016",,,cs.SY cs.PF nlin.AO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Discrete-time switched linear systems where switchings are governed by a
digraph are considered. The minimum (or average) dwell time that guarantees the
asymptotic stability can be computed by calculating the maximum cycle ratio (or
maximum cycle mean) of a doubly weighted digraph where weights depend on the
eigenvalues and eigenvectors of subsystem matrices. The graph-based method is
applied to systems with defective subsystem matrices using Jordan
decomposition. In the case of bimodal switched systems scaling algorithms that
minimizes the condition number can be used to give a better minimum (or
average) dwell time estimates.
","[{'version': 'v1', 'created': 'Fri, 14 Nov 2014 20:30:49 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Oct 2017 15:38:15 GMT'}]",2017-10-20,"[['İlhan', 'Ferruh', ''], ['Karabacak', 'Özkan', '']]","['Switched systems', 'minimum dwell time', 'average dwelltime', 'optimum cycle ratio', 'asymptotic stability', 'switching graph']"
15692,1407.2721,Erik Rodner,"Bj\""orn Barz and Erik Rodner and Joachim Denzler",ARTOS -- Adaptive Real-Time Object Detection System,http://cvjena.github.io/artos/,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  ARTOS is all about creating, tuning, and applying object detection models
with just a few clicks. In particular, ARTOS facilitates learning of models for
visual object detection by eliminating the burden of having to collect and
annotate a large set of positive and negative samples manually and in addition
it implements a fast learning technique to reduce the time needed for the
learning step.
  A clean and friendly GUI guides the user through the process of model
creation, adaptation of learned models to different domains using in-situ
images, and object detection on both offline images and images from a video
stream. A library written in C++ provides the main functionality of ARTOS with
a C-style procedural interface, so that it can be easily integrated with any
other project.
","[{'version': 'v1', 'created': 'Thu, 10 Jul 2014 08:02:23 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Aug 2014 12:55:37 GMT'}]",2014-08-26,"[['Barz', 'Björn', ''], ['Rodner', 'Erik', ''], ['Denzler', 'Joachim', '']]","['object detection', 'efficient learning', 'large-scale image databases']"
15693,1106.0843,Sayed. A Hadei,"Sayed A. Hadei (Student Member IEEE), Paeiz Azmi (Senior Member, IEEE)","A Novel Adaptive Channel Equalization Method Using Variable Step-Size
  Partial Rank Algorithm","6th Advance International Conference on Telecommunications (AICT2010)
  Barcelona, Spanish",,,,cs.IT cs.SD math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently a framework has been introduced within which a large number of
classical and modern adaptive filter algorithms can be viewed as special cases.
Variable Step-Size (VSS) normalized least mean square (VSSNLMS) and VSS Affine
Projection Algorithms (VSSAPA) are two particular examples of the adaptive
algorithms that can be covered by this generic adaptive filter. In this paper,
we introduce a new VSS Partial Rank (VSSPR) adaptive algorithm based on the
generic VSS adaptive filter and use it for channel equalization. The proposed
algorithm performs very well in attenuating noise and inter-symbol interference
(ISI) in comparison with the standard NLMS and the recently introduced AP
algorithms.
","[{'version': 'v1', 'created': 'Sat, 4 Jun 2011 17:58:59 GMT'}]",2011-06-07,"[['Hadei', 'Sayed A.', '', 'Student Member IEEE'], ['Azmi', 'Paeiz', '', 'Senior Member, IEEE']]","['Adaptive Filter', 'Variable Step-Size Algorithm', 'Partial Rank Algorithm (PRA)', 'Intersymbol Interference', 'Channel Equalizer']"
15694,1310.0578,Nisheeth Joshi,"Vaishali Gupta, Nisheeth Joshi, Iti Mathur","Subjective and Objective Evaluation of English to Urdu Machine
  Translation","In Proceedings of 2013 International Conference on Advances in
  Computing, Communications and Informatics",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine translation is research based area where evaluation is very important
phenomenon for checking the quality of MT output. The work is based on the
evaluation of English to Urdu Machine translation. In this research work we
have evaluated the translation quality of Urdu language which has been
translated by using different Machine Translation systems like Google, Babylon
and Ijunoon. The evaluation process is done by using two approaches - Human
evaluation and Automatic evaluation. We have worked for both the approaches
where in human evaluation emphasis is given to scales and parameters while in
automatic evaluation emphasis is given to some automatic metric such as BLEU,
GTM, METEOR and ATEC.
","[{'version': 'v1', 'created': 'Wed, 2 Oct 2013 06:10:49 GMT'}]",2013-10-03,"[['Gupta', 'Vaishali', ''], ['Joshi', 'Nisheeth', ''], ['Mathur', 'Iti', '']]","['BLEU', 'GTM', 'METEOR and ATEC']"
15695,1712.04301,Mehdi Mohammadi,"Mehdi Mohammadi, Ala Al-Fuqaha, Sameh Sorour, and Mohsen Guizani",Deep Learning for IoT Big Data and Streaming Analytics: A Survey,"40 pages, Accepted at IEEE Communications Surveys and Tutorials
  Journal",,,,cs.NI cs.DB cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the era of the Internet of Things (IoT), an enormous amount of sensing
devices collect and/or generate various sensory data over time for a wide range
of fields and applications. Based on the nature of the application, these
devices will result in big or fast/real-time data streams. Applying analytics
over such data streams to discover new information, predict future insights,
and make control decisions is a crucial process that makes IoT a worthy
paradigm for businesses and a quality-of-life improving technology. In this
paper, we provide a thorough overview on using a class of advanced machine
learning techniques, namely Deep Learning (DL), to facilitate the analytics and
learning in the IoT domain. We start by articulating IoT data characteristics
and identifying two major treatments for IoT data from a machine learning
perspective, namely IoT big data analytics and IoT streaming data analytics. We
also discuss why DL is a promising approach to achieve the desired analytics in
these types of data and applications. The potential of using emerging DL
techniques for IoT data analytics are then discussed, and its promises and
challenges are introduced. We present a comprehensive background on different
DL architectures and algorithms. We also analyze and summarize major reported
research attempts that leveraged DL in the IoT domain. The smart IoT devices
that have incorporated DL in their intelligence background are also discussed.
DL implementation approaches on the fog and cloud centers in support of IoT
applications are also surveyed. Finally, we shed light on some challenges and
potential directions for future research. At the end of each section, we
highlight the lessons learned based on our experiments and review of the recent
literature.
","[{'version': 'v1', 'created': 'Sat, 9 Dec 2017 06:13:43 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Jun 2018 03:30:38 GMT'}]",2018-06-06,"[['Mohammadi', 'Mehdi', ''], ['Al-Fuqaha', 'Ala', ''], ['Sorour', 'Sameh', ''], ['Guizani', 'Mohsen', '']]","['Deep Learning', 'Deep Neural Network', 'Internet ofThings', 'On-device Intelligence', 'IoT Big Data', 'Fast data analytics', 'Cloud-based analytics']"
15696,1409.6002,Nicolas Gastineau,"Benoit Darties (Le2i), Nicolas Gastineau (Le2i), Olivier Togni (Le2i)",Completely Independent Spanning Trees in Some Regular Graphs,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $k\ge 2$ be an integer and $T_1,\ldots, T_k$ be spanning trees of a graph
$G$. If for any pair of vertices $(u,v)$ of $V(G)$, the paths from $u$ to $v$
in each $T_i$, $1\le i\le k$, do not contain common edges and common vertices,
except the vertices $u$ and $v$, then $T_1,\ldots, T_k$ are completely
independent spanning trees in $G$. For $2k$-regular graphs which are
$2k$-connected, such as the Cartesian product of a complete graph of order
$2k-1$ and a cycle and some Cartesian products of three cycles (for $k=3$), the
maximum number of completely independent spanning trees contained in these
graphs is determined and it turns out that this maximum is not always $k$.
","[{'version': 'v1', 'created': 'Sun, 21 Sep 2014 16:02:22 GMT'}]",2014-09-23,"[['Darties', 'Benoit', '', 'Le2i'], ['Gastineau', 'Nicolas', '', 'Le2i'], ['Togni', 'Olivier', '', 'Le2i']]","['Spanning tree', 'Cartesian product', 'Completely independent spanning tree']"
15697,0707.0742,Richard McClatchey,"A. Ali, A. Anjum, T. Azim, J. Bunn, A. Ikram, R. McClatchey, H.
  Newman, C. Steenberg, M. Thomas, I. Willers",Mobile Computing in Physics Analysis - An Indicator for eScience,"8 pages, 7 figures. Presented at the 3rd Int Conf on Mobile Computing
  & Ubiquitous Networking (ICMU06. London October 2006",,,,cs.DC,,"  This paper presents the design and implementation of a Grid-enabled physics
analysis environment for handheld and other resource-limited computing devices
as one example of the use of mobile devices in eScience. Handheld devices offer
great potential because they provide ubiquitous access to data and
round-the-clock connectivity over wireless links. Our solution aims to provide
users of handheld devices the capability to launch heavy computational tasks on
computational and data Grids, monitor the jobs status during execution, and
retrieve results after job completion. Users carry their jobs on their handheld
devices in the form of executables (and associated libraries). Users can
transparently view the status of their jobs and get back their outputs without
having to know where they are being executed. In this way, our system is able
to act as a high-throughput computing environment where devices ranging from
powerful desktop machines to small handhelds can employ the power of the Grid.
The results shown in this paper are readily applicable to the wider eScience
community.
","[{'version': 'v1', 'created': 'Thu, 5 Jul 2007 09:32:29 GMT'}]",2007-07-06,"[['Ali', 'A.', ''], ['Anjum', 'A.', ''], ['Azim', 'T.', ''], ['Bunn', 'J.', ''], ['Ikram', 'A.', ''], ['McClatchey', 'R.', ''], ['Newman', 'H.', ''], ['Steenberg', 'C.', ''], ['Thomas', 'M.', ''], ['Willers', 'I.', '']]","['Grid computing', 'Handheld Computing', 'Physics Analysis', 'Context-aware job submission']"
15698,1504.04759,Arthur Ramos BSCS,"Arthur F. Ramos, Ruy J.G.B. de Queiroz and Anjolina G. de Oliveira",On the Identity Type as the Type of Computational Paths,16 pages,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a new way of formalizing the intensional identity type based on
the fact that a entity known as computational paths can be interpreted as terms
of the identity type. Our approach enjoys the fact that our elimination rule is
easy to understand and use. We make this point clear constructing terms of some
relevant types using our proposed elimination rule. We also show that the
identity type, as defined by our approach, induces a groupoid structure. This
result is on par with the fact that the traditional identity type induces a
groupoid, as exposed by Hofmann \& Streicher (1994).
","[{'version': 'v1', 'created': 'Sat, 18 Apr 2015 20:59:12 GMT'}]",2015-04-21,"[['Ramos', 'Arthur F.', ''], ['de Queiroz', 'Ruy J. G. B.', ''], ['de Oliveira', 'Anjolina G.', '']]","['Identity type', 'computational paths', 'equality theory', 'path-based constructions', 'type theory', 'groupoid model']"
15699,1504.01709,Filip Mazowiecki sheriff,"Filip Mazowiecki, Cristian Riveros","Copyless Cost-Register Automata: Structure, Expressiveness, and Closure
  Properties",,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cost register automata (CRA) and its subclass, copyless CRA, were recently
proposed by Alur et al. as a new model for computing functions over strings. We
study some structural properties, expressiveness, and closure properties of
copyless CRA. We show that copyless CRA are strictly less expressive than
weighted automata and are not closed under reverse operation. To find a better
class we impose restrictions on copyless CRA, which ends successfully with a
new robust computational model that is closed under reverse and other
extensions.
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2015 19:15:30 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Apr 2018 13:08:49 GMT'}]",2018-04-30,"[['Mazowiecki', 'Filip', ''], ['Riveros', 'Cristian', '']]","['Cost Register Automata', 'Weighted Automata', 'Semirings']"
15700,1705.05322,Helio M. de Oliveira,H.M. de Oliveira and R.C. de Oliveira,Understanding MIDI: A Painless Tutorial on Midi Format,"7 pages, 7 figures",,,,cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A short overview demystifying the midi audio format is presented. The goal is
to explain the file structure and how the instructions are used to produce a
music signal, both in the case of monophonic signals as for polyphonic signals.
","[{'version': 'v1', 'created': 'Mon, 15 May 2017 16:34:20 GMT'}]",2018-01-24,"[['de Oliveira', 'H. M.', ''], ['de Oliveira', 'R. C.', '']]","['Midi files', 'Computer Music', 'Monophonic and Polyphonic']"
15701,1712.02433,Ming-Hsiang Tsou,"Ming-Hsiang Tsou, Hao Zhang, Chin-Te Jung","Identifying Data Noises, User Biases, and System Errors in Geo-tagged
  Twitter Messages (Tweets)",,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many social media researchers and data scientists collected geo-tagged tweets
to conduct spatial analysis or identify spatiotemporal patterns of filtered
messages for specific topics or events. This paper provides a systematic view
to illustrate the characteristics (data noises, user biases, and system errors)
of geo-tagged tweets from the Twitter Streaming API. First, we found that a
small percentage (1%) of active Twitter users can create a large portion (16%)
of geo-tagged tweets. Second, there is a significant amount (57.3%) of
geo-tagged tweets located outside the Twitter Streaming API's bounding box in
San Diego. Third, we can detect spam, bot, cyborg tweets (data noises) by
examining the ""source"" metadata field. The portion of data noises in geo-tagged
tweets is significant (29.42% in San Diego, CA and 53.47% in Columbus, OH) in
our case study. Finally, the majority of geo-tagged tweets are not created by
the generic Twitter apps in Android or iPhone devices, but by other platforms,
such as Instagram and Foursquare. We recommend a multi-step procedure to remove
these noises for the future research projects utilizing geo-tagged tweets.
","[{'version': 'v1', 'created': 'Wed, 6 Dec 2017 22:59:51 GMT'}]",2017-12-08,"[['Tsou', 'Ming-Hsiang', ''], ['Zhang', 'Hao', ''], ['Jung', 'Chin-Te', '']]","['Social media', 'Geo-tagged', 'Data noises', 'Twitter', 'Tweets']"
15702,1106.5156,Mallikarjun Hangarge Dr.,"B.V.Dhandra, Mallikarjun Hangarge",Morphological Reconstruction for Word Level Script Identification,"11 Pages, 8 Figures,5 Tables; Revised: 15-06-2007,Published:
  30-06-2007","International Journal of Computer Science and Security
  (IJCSS),Volume (1) : Issue (1), 41 - 51, 2007",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A line of a bilingual document page may contain text words in regional
language and numerals in English. For Optical Character Recognition (OCR) of
such a document page, it is necessary to identify different script forms before
running an individual OCR system. In this paper, we have identified a tool of
morphological opening by reconstruction of an image in different directions and
regional descriptors for script identification at word level, based on the
observation that every text has a distinct visual appearance. The proposed
system is developed for three Indian major bilingual documents, Kannada, Telugu
and Devnagari containing English numerals. The nearest neighbour and k-nearest
neighbour algorithms are applied to classify new word images. The proposed
algorithm is tested on 2625 words with various font styles and sizes. The
results obtained are quite encouraging
","[{'version': 'v1', 'created': 'Sat, 25 Jun 2011 18:16:59 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Jul 2011 13:35:35 GMT'}]",2011-07-05,"[['Dhandra', 'B. V.', ''], ['Hangarge', 'Mallikarjun', '']]","['Script identification', 'Bilingual documents', 'OCR', 'Morphological reconstruction', 'regional descriptors']"
15703,1002.4084,Benoit Masson,"Lila Kari (UWO), Beno\^it Masson (UWO), Shinnosuke Seki (UWO)",Properties of Pseudo-Primitive Words and their Applications,Submitted to International Journal of Foundations of Computer Science,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A pseudo-primitive word with respect to an antimorphic involution \theta is a
word which cannot be written as a catenation of occurrences of a strictly
shorter word t and \theta(t). Properties of pseudo-primitive words are
investigated in this paper. These properties link pseudo-primitive words with
essential notions in combinatorics on words such as primitive words,
(pseudo)-palindromes, and (pseudo)-commutativity. Their applications include an
improved solution to the extended Lyndon-Sch\""utzenberger equation u_1 u_2 ...
u_l = v_1 ... v_n w_1 ... w_m, where u_1, ..., u_l \in {u, \theta(u)}, v_1,
..., v_n \in {v, \theta(v)}, and w_1, ..., w_m \in {w, \theata(w)} for some
words u, v, w, integers l, n, m \ge 2, and an antimorphic involution \theta. We
prove that for l \ge 4, n,m \ge 3, this equation implies that u, v, w can be
expressed in terms of a common word t and its image \theta(t). Moreover,
several cases of this equation where l = 3 are examined.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2010 09:40:13 GMT'}]",2010-02-23,"[['Kari', 'Lila', '', 'UWO'], ['Masson', 'Benoît', '', 'UWO'], ['Seki', 'Shinnosuke', '', 'UWO']]","['antimorphic involution', '(pseudo-)primitive word', '(extended) LyndonSch¨utzenberger equation', '(pseudo-)periodic word', '(pseudo-)palindrome', '(weak) defecteffect']"
15704,1109.1587,Laura Titolo,Marco Comini and Laura Titolo and Alicia Villanueva,Abstract Diagnosis for Timed Concurrent Constraint programs,16 pages,"Theory and Practice of Logic Programming 2011, 11(4-5): 487-502
  (2011)",,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Timed Concurrent Constraint Language (tccp in short) is a concurrent
logic language based on the simple but powerful concurrent constraint paradigm
of Saraswat. In this paradigm, the notion of store-as-value is replaced by the
notion of store-as-constraint, which introduces some differences w.r.t. other
approaches to concurrency. In this paper, we provide a general framework for
the debugging of tccp programs. To this end, we first present a new compact,
bottom-up semantics for the language that is well suited for debugging and
verification purposes in the context of reactive systems. We also provide an
abstract semantics that allows us to effectively implement debugging algorithms
based on abstract interpretation. Given a tccp program and a behavior
specification, our debugging approach automatically detects whether the program
satisfies the specification. This differs from other semiautomatic approaches
to debugging and avoids the need to provide symptoms in advance. We show the
efficacy of our approach by introducing two illustrative examples. We choose a
specific abstract domain and show how we can detect that a program is
erroneous.
","[{'version': 'v1', 'created': 'Wed, 7 Sep 2011 22:02:45 GMT'}]",2011-09-09,"[['Comini', 'Marco', ''], ['Titolo', 'Laura', ''], ['Villanueva', 'Alicia', '']]","['concurrent constraint paradigm', 'denotational semantics', 'abstract diagnosis', 'abstract interpretation']"
15705,1111.4819,Soumen  Kanrar,Soumen Kanrar and Mohammad Siraj,"Enhanced Antenna Position Implementation Over Vehicular Ad Hoc Network
  (VNET) In 3D Space","12 pages, 8 figures; ISSN: 0975-3834 [Online]; 0975-4679 [Print]","International Journal of Wireless & Mobile Networks (IJWMN) Vol-2,
  No -1, 2010, 164-175",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The technology related to networking moves wired connection to wireless
connection.The basic problem concern in the wireless domain, random packet loss
for the end to end connection. In this paper we show the performance and the
impact of the packet loss and delay, by the bit error rate throughput etc with
respect to the real world scenario vehicular ad hoc network in 3-dimension
space (VANET in 3D). Over the years software development has responded to the
increasing growth of wireless connectivity in developing network enabled
software. In this paper we consider the real world physical problem in three
dimensional wireless domain and map the problem to analytical problem . In this
paper we simulate that analytic problem with respect to real world scenario by
using enhanced antenna position system (EAPS) mounted over the mobile node in
3D space. In this paper we convert the real world problem into lab oriented
problem by using the EAPS -system and shown the performance in wireless domain
in 3 dimensional space.
","[{'version': 'v1', 'created': 'Mon, 21 Nov 2011 10:36:24 GMT'}]",2011-11-22,"[['Kanrar', 'Soumen', ''], ['Siraj', 'Mohammad', '']]","['EAPS', 'VANET', 'Bit error rate', 'throughput', 'antenna', 'wireless']"
15706,1710.05994,Yawei Hui,Yawei Hui and Yaohua Liu,"Volumetric Data Exploration with Machine Learning-Aided Visualization in
  Neutron Science","14 pages, 7 figures; the Computer Vision Conference (CVC), Las Vegas,
  Nevada, 2019; accepted",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advancements in neutron and X-ray sources, instrumentation and data
collection modes have significantly increased the experimental data size (which
could easily contain 10$^{8}$ -- 10$^{10}$ data points), so that conventional
volumetric visualization approaches become inefficient for both still imaging
and interactive OpenGL rendition in a 3D setting. We introduce a new approach
based on the unsupervised machine learning algorithm, Density-Based Spatial
Clustering of Applications with Noise (DBSCAN), to efficiently analyze and
visualize large volumetric datasets. Here we present two examples of analyzing
and visualizing datasets from the diffuse scattering experiment of a single
crystal sample and the tomographic reconstruction of a neutron scanning of a
turbine blade. We found that by using the intensity as the weighting factor in
the clustering process, DBSCAN becomes very effective in de-noising and
feature/boundary detection, and thus enables better visualization of the
hierarchical internal structures of the neutron scattering data.
","[{'version': 'v1', 'created': 'Mon, 16 Oct 2017 20:32:10 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Aug 2018 20:23:05 GMT'}, {'version': 'v3', 'created': 'Mon, 24 Sep 2018 13:37:30 GMT'}]",2018-09-25,"[['Hui', 'Yawei', ''], ['Liu', 'Yaohua', '']]","['Scientific visualization', 'feature extraction', 'unsupervised learning and clustering', 'volumetric dataset']"
15707,1610.00134,"G\""okhan \""Ozbulak","G\""okhan \""Ozbulak, Yusuf Aytar, Haz{\i}m Kemal Ekenel","How Transferable are CNN-based Features for Age and Gender
  Classification?","12 pages, 3 figures, 2 tables, International Conference of the
  Biometrics Special Interest Group (BIOSIG) 2016",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Age and gender are complementary soft biometric traits for face recognition.
Successful estimation of age and gender from facial images taken under
real-world conditions can contribute improving the identification results in
the wild. In this study, in order to achieve robust age and gender
classification in the wild, we have benefited from Deep Convolutional Neural
Networks based representation. We have explored transferability of existing
deep convolutional neural network (CNN) models for age and gender
classification. The generic AlexNet-like architecture and domain specific
VGG-Face CNN model are employed and fine-tuned with the Adience dataset
prepared for age and gender classification in uncontrolled environments. In
addition, task specific GilNet CNN model has also been utilized and used as a
baseline method in order to compare with transferred models. Experimental
results show that both transferred deep CNN models outperform the GilNet CNN
model, which is the state-of-the-art age and gender classification approach on
the Adience dataset, by an absolute increase of 7% and 4.5% in accuracy,
respectively. This outcome indicates that transferring a deep CNN model can
provide better classification performance than a task specific CNN model, which
has a limited number of layers and trained from scratch using a limited amount
of data as in the case of GilNet. Domain specific VGG-Face CNN model has been
found to be more useful and provided better performance for both age and gender
classification tasks, when compared with generic AlexNet-like model, which
shows that transfering from a closer domain is more useful.
","[{'version': 'v1', 'created': 'Sat, 1 Oct 2016 13:28:39 GMT'}]",2016-10-04,"[['Özbulak', 'Gökhan', ''], ['Aytar', 'Yusuf', ''], ['Ekenel', 'Hazım Kemal', '']]","['Soft biometrics', 'age classification', 'gender classification', 'convolutional neural networks', 'deep learning', 'transfer learning']"
15708,1712.02423,Ritwick Chaudhry,"Preeti Gopal, Ritwick Chaudhry, Sharat Chandran, Imants Svalbe, Ajit
  Rajwade",Tomographic Reconstruction using Global Statistical Prior,"Published in The International Conference on Digital Image Computing:
  Techniques and Applications (DICTA), Sydney, Australia, 2017. The conference
  proceedings are not out yet. But the result can be seen here:
  http://dicta2017.dictaconference.org/fullprogram.html",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent research in tomographic reconstruction is motivated by the need to
efficiently recover detailed anatomy from limited measurements. One of the ways
to compensate for the increasingly sparse sets of measurements is to exploit
the information from templates, i.e., prior data available in the form of
already reconstructed, structurally similar images. Towards this, previous work
has exploited using a set of global and patch based dictionary priors. In this
paper, we propose a global prior to improve both the speed and quality of
tomographic reconstruction within a Compressive Sensing framework.
  We choose a set of potential representative 2D images referred to as
templates, to build an eigenspace; this is subsequently used to guide the
iterative reconstruction of a similar slice from sparse acquisition data. Our
experiments across a diverse range of datasets show that reconstruction using
an appropriate global prior, apart from being faster, gives a much lower
reconstruction error when compared to the state of the art.
","[{'version': 'v1', 'created': 'Wed, 6 Dec 2017 22:15:48 GMT'}]",2017-12-08,"[['Gopal', 'Preeti', ''], ['Chaudhry', 'Ritwick', ''], ['Chandran', 'Sharat', ''], ['Svalbe', 'Imants', ''], ['Rajwade', 'Ajit', '']]","['Filtered backprojection', 'Principal Component Analysis', 'K-SVD', 'overcomplete dictionaries', 'Compressive Sensing']"
15709,1511.08494,Pierluigi Vellucci,Paola Loreti and Pierluigi Vellucci,A Mathematical Model for Signal's Energy at the Output of an Ideal DAC,,"Proceedings of 13-th International Conference on Informatics in
  Control, Automation and Robotics, (2016), p. 347-352",,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The presented research work considers a mathematical model for energy of the
signal at the output of an ideal DAC, in presence of sampling clock jitter.
When sampling clock jitter occurs, the energy of the signal at the output of
ideal DAC does not satisfies a Parseval identity. Nevertheless, an estimation
of the signal energy is here shown by a direct method involving sinc functions.
","[{'version': 'v1', 'created': 'Thu, 26 Nov 2015 20:34:32 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Mar 2016 14:14:11 GMT'}]",2016-10-04,"[['Loreti', 'Paola', ''], ['Vellucci', 'Pierluigi', '']]","['Timing jitter', 'digital-to-analog converters', 'bandlimited interpolation', 'energy estimate']"
15710,1510.07165,Maumita Bhattacharya,"J. West, Maumita Bhattacharya and R. Islam",Intelligent Financial Fraud Detection Practices: An Investigation,"Proceedings of the 10th International Conference on Security and
  Privacy in Communication Networks (SecureComm 2014)",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Financial fraud is an issue with far reaching consequences in the finance
industry, government, corporate sectors, and for ordinary consumers. Increasing
dependence on new technologies such as cloud and mobile computing in recent
years has compounded the problem. Traditional methods of detection involve
extensive use of auditing, where a trained individual manually observes reports
or transactions in an attempt to discover fraudulent behaviour. This method is
not only time consuming, expensive and inaccurate, but in the age of big data
it is also impractical. Not surprisingly, financial institutions have turned to
automated processes using statistical and computational methods. This paper
presents a comprehensive investigation on financial fraud detection practices
using such data mining methods, with a particular focus on computational
intelligence-based techniques. Classification of the practices based on key
aspects such as detection algorithm used, fraud type investigated, and success
rate have been covered. Issues and challenges associated with the current
practices and potential future direction of research have also been identified.
","[{'version': 'v1', 'created': 'Sat, 24 Oct 2015 17:07:34 GMT'}]",2015-10-27,"[['West', 'J.', ''], ['Bhattacharya', 'Maumita', ''], ['Islam', 'R.', '']]","['Financial fraud', 'Computational Intelligence', 'Fraud detection techniques', 'Data mining']"
15711,1502.04095,J.T. Geneson,"Jesse Geneson, Peter Tian",Sequences of formation width $4$ and alternation length $5$,20 pages,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sequence pattern avoidance is a central topic in combinatorics. A sequence
$s$ contains a sequence $u$ if some subsequence of $s$ can be changed into $u$
by a one-to-one renaming of its letters. If $s$ does not contain $u$, then $s$
avoids $u$. A widely studied extremal function related to pattern avoidance is
$Ex(u, n)$, the maximum length of an $n$-letter sequence that avoids $u$ and
has every $r$ consecutive letters pairwise distinct, where $r$ is the number of
distinct letters in $u$.
  We bound $Ex(u, n)$ using the formation width function, $fw(u)$, which is the
minimum $s$ for which there exists $r$ such that any concatenation of $s$
permutations, each on the same $r$ letters, contains $u$. In particular, we
identify every sequence $u$ such that $fw(u)=4$ and $u$ contains $ababa$. The
significance of this result lies in its implication that, for every such
sequence $u$, we have $Ex(u, n) = \Theta(n \alpha(n))$, where $\alpha(n)$
denotes the incredibly slow-growing inverse Ackermann function. We have thus
identified the extremal function of many infinite classes of previously
unidentified sequences.
","[{'version': 'v1', 'created': 'Fri, 13 Feb 2015 19:13:02 GMT'}]",2015-02-16,"[['Geneson', 'Jesse', ''], ['Tian', 'Peter', '']]","['alternations', 'formations', 'generalized Davenport-Schinzelsequences', 'inverse Ackermann functions', 'permutations']"
15712,1108.6254,Mahedi Hassan,"Md. Mahedi Hassan, Poo Kuan Hoong","Integrated Solution Scheme for Handover Latency Diminution in Proxy
  Mobile IPv6","20 pages, 15 figures, 3 tables; Lee, H., Han, Y. & Min, S. (2010)
  ""Network Mobility Support Scheme on PMIPv6 Networks"", International Journal
  of Computer Networks & Communications (IJCNC), Vol.2, No.5",,,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Recent trends show that there are swift developments and fast convergence of
wireless and mobile communication networks with internet services to provide
the quality of ubiquitous access to network users. Most of the wireless
networks and mobile cellular networks are moving to be all IP based. These
networks are connected through the private IP core networks using the TCP/IP
protocol or through the Internet. As such, there is room to improve the
mobility support through the Internet and support ubiquitous network access by
providing seamless handover. This is especially true with the invention of
portable mobile and laptop devices that can be connected almost everywhere at
any time. However, the recent explosion on the usage of mobile and laptop
devices has also generated several issues in terms of performance and quality
of service. Nowadays, mobile users demand high quality performance, best
quality of services and seamless connections that support real-time application
such as audio and video streaming. The goal of this paper is to study the
impact and evaluate the mobility management protocols under micro mobility
domain on link layer and network layer handover performance. Therefore, this
paper proposes an integration solution of network-based mobility management
framework, based on Proxy Mobile IPv6, to alleviate handover latency, packet
loss and increase throughput and the performance of video transmission when
mobile host moves to new network during handover on high speed mobility.
Simulations are conducted to analyze the relationship between the network
performances with the moving speed of mobile host over mobility protocols.
Based on simulation results, we presented and analyzed the results of mobility
protocols under intra-domain traffics in micro mobility domain.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2011 15:06:15 GMT'}]",2011-09-01,"[['Hassan', 'Md. Mahedi', ''], ['Hoong', 'Poo Kuan', '']]","['Seamless Handover', 'Mobility Protocols', 'Proxy Mobile IPv6', 'PMIPv6', 'Video Transmission', 'NS-2']"
15713,0710.4671,EDA Publishing Association,"Srinivasan Murali, Giovanni De Micheli",An Application-Specific Design Methodology for STbus Crossbar Generation,Submitted on behalf of EDAA (http://www.edaa.com/),"Dans Design, Automation and Test in Europe - DATE'05, Munich :
  Allemagne (2005)",,,cs.AR,,"  As the communication requirements of current and future Multiprocessor
Systems on Chips (MPSoCs) continue to increase, scalable communication
architectures are needed to support the heavy communication demands of the
system. This is reflected in the recent trend that many of the standard bus
products such as STbus, have now introduced the capability of designing a
crossbar with multiple buses operating in parallel. The crossbar configuration
should be designed to closely match the application traffic characteristics and
performance requirements. In this work we address this issue of
application-specific design of optimal crossbar (using STbus crossbar
architecture), satisfying the performance requirements of the application and
optimal binding of cores onto the crossbar resources. We present a simulation
based design approach that is based on analysis of actual traffic trace of the
application, considering local variations in traffic rates, temporal overlap
among traffic streams and criticality of traffic streams. Our methodology is
applied to several MPSoC designs and the resulting crossbar platforms are
validated for performance by cycle-accurate SystemC simulation of the designs.
The experimental case studies show large reduction in packet latencies (up to
7x) and large crossbar component savings (up to 3.5x) compared to traditional
design approaches.
","[{'version': 'v1', 'created': 'Thu, 25 Oct 2007 08:46:59 GMT'}]",2011-11-09,"[['Murali', 'Srinivasan', ''], ['De Micheli', 'Giovanni', '']]","['Systems on Chips', 'Networks on Chips', 'crossbar', 'bus', 'application-specific', 'SystemC']"
15714,1704.01759,Annamalai Narayanan,"Annamalai Narayanan, Mahinthan Chandramohan, Lihui Chen, Yang Liu","A Multi-view Context-aware Approach to Android Malware Detection and
  Malicious Code Localization",,,,,cs.CR cs.AI cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing Android malware detection approaches use a variety of features such
as security sensitive APIs, system calls, control-flow structures and
information flows in conjunction with Machine Learning classifiers to achieve
accurate detection. Each of these feature sets provides a unique semantic
perspective (or view) of apps' behaviours with inherent strengths and
limitations. Meaning, some views are more amenable to detect certain attacks
but may not be suitable to characterise several other attacks. Most of the
existing malware detection approaches use only one (or a selected few) of the
aforementioned feature sets which prevent them from detecting a vast majority
of attacks. Addressing this limitation, we propose MKLDroid, a unified
framework that systematically integrates multiple views of apps for performing
comprehensive malware detection and malicious code localisation. The rationale
is that, while a malware app can disguise itself in some views, disguising in
every view while maintaining malicious intent will be much harder.
  MKLDroid uses a graph kernel to capture structural and contextual information
from apps' dependency graphs and identify malice code patterns in each view.
Subsequently, it employs Multiple Kernel Learning (MKL) to find a weighted
combination of the views which yields the best detection accuracy. Besides
multi-view learning, MKLDroid's unique and salient trait is its ability to
locate fine-grained malice code portions in dependency graphs (e.g.,
methods/classes). Through our large-scale experiments on several datasets
(incl. wild apps), we demonstrate that MKLDroid outperforms three
state-of-the-art techniques consistently, in terms of accuracy while
maintaining comparable efficiency. In our malicious code localisation
experiments on a dataset of repackaged malware, MKLDroid was able to identify
all the malice classes with 94% average recall.
","[{'version': 'v1', 'created': 'Thu, 6 Apr 2017 09:44:08 GMT'}, {'version': 'v2', 'created': 'Sat, 8 Apr 2017 13:10:50 GMT'}]",2017-04-11,"[['Narayanan', 'Annamalai', ''], ['Chandramohan', 'Mahinthan', ''], ['Chen', 'Lihui', ''], ['Liu', 'Yang', '']]","['Android Malware Detection', 'Graph Kernels', 'Multiple Kernel Learning', 'Malicious CodeLocalization']"
15715,1010.2354,Marlon Dumas,Siim Karus and Marlon Dumas,Predicting Coding Effort in Projects Containing XML Code,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies the problem of predicting the coding effort for a
subsequent year of development by analysing metrics extracted from project
repositories, with an emphasis on projects containing XML code. The study
considers thirteen open source projects and applies machine learning algorithms
to generate models to predict one-year coding effort, measured in terms of
lines of code added, modified and deleted. Both organisational and code metrics
associated to revisions are taken into account. The results show that coding
effort is highly determined by the expertise of developers while source code
metrics have little effect on improving the accuracy of estimations of coding
effort. The study also shows that models trained on one project are unreliable
at estimating effort in other projects.
","[{'version': 'v1', 'created': 'Tue, 12 Oct 2010 11:30:47 GMT'}]",2015-03-17,"[['Karus', 'Siim', ''], ['Dumas', 'Marlon', '']]","['XML', 'XSLT', 'metrics', 'coding effort', 'estimation']"
15716,1402.6964,Austin Benson,"Austin R. Benson, Jason D. Lee, Bartek Rajwa, David F. Gleich","Scalable methods for nonnegative matrix factorizations of near-separable
  tall-and-skinny matrices",,"Proceedings of Neural Information Processing Systems, 2014",,,cs.LG cs.DC cs.NA stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Numerous algorithms are used for nonnegative matrix factorization under the
assumption that the matrix is nearly separable. In this paper, we show how to
make these algorithms efficient for data matrices that have many more rows than
columns, so-called ""tall-and-skinny matrices"". One key component to these
improved methods is an orthogonal matrix transformation that preserves the
separability of the NMF problem. Our final methods need a single pass over the
data matrix and are suitable for streaming, multi-core, and MapReduce
architectures. We demonstrate the efficacy of these algorithms on
terabyte-sized synthetic matrices and real-world matrices from scientific
computing and bioinformatics.
","[{'version': 'v1', 'created': 'Thu, 27 Feb 2014 16:41:26 GMT'}]",2018-01-08,"[['Benson', 'Austin R.', ''], ['Lee', 'Jason D.', ''], ['Rajwa', 'Bartek', ''], ['Gleich', 'David F.', '']]","['nonnegative matrix factorization', 'separable', 'QR', 'SVD', 'MapReduce', 'heat transfer', 'flow cytometry']"
15717,1403.1194,Minoru Sasaki,Minoru Sasaki,"Latent Semantic Word Sense Disambiguation Using Global Co-occurrence
  Information","6 pages, 2figures",,,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, I propose a novel word sense disambiguation method based on
the global co-occurrence information using NMF. When I calculate the dependency
relation matrix, the existing method tends to produce very sparse co-occurrence
matrix from a small training set. Therefore, the NMF algorithm sometimes does
not converge to desired solutions. To obtain a large number of co-occurrence
relations, I propose to use co-occurrence frequencies of dependency relations
between word features in the whole training set. This enables us to solve data
sparseness problem and induce more effective latent features. To evaluate the
efficiency of the method of word sense disambiguation, I make some experiments
to compare with the result of the two baseline methods. The results of the
experiments show this method is effective for word sense disambiguation in
comparison with the all baseline methods. Moreover, the proposed method is
effective for obtaining a stable effect by analyzing the global co-occurrence
information.
","[{'version': 'v1', 'created': 'Wed, 5 Mar 2014 17:20:01 GMT'}]",2014-03-06,"[['Sasaki', 'Minoru', '']]","['Word Sense Disambiguation', 'Global Co-occurrence Information', 'Dependency Relations', 'Non-Negative Matrix Factorization']"
15718,1511.08841,Hans Raj Tiwary,Jakub Gajarsk\'y and Petr Hlin\v{e}n\'y and Hans Raj Tiwary,"Parameterized Extension Complexity of Independent Set and Related
  Problems",20 pages,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $G$ be a graph on $n$ vertices and $\mathrm{STAB}_k(G)$ be the convex
hull of characteristic vectors of its independent sets of size at most $k$. We
study extension complexity of $\mathrm{STAB}_k(G)$ with respect to a fixed
parameter $k$ (analogously to, e.g., parameterized computational complexity of
problems). We show that for graphs $G$ from a class of bounded expansion it
holds that $\mathrm{xc}(\mathrm{STAB}_k(G))\leqslant \mathcal{O}(f(k)\cdot n)$
where the function $f$ depends only on the class. This result can be extended
in a simple way to a wide range of similarly defined graph polytopes. In case
of general graphs we show that there is {\em no function $f$} such that, for
all values of the parameter $k$ and for all graphs on $n$ vertices, the
extension complexity of $\mathrm{STAB}_k(G)$ is at most $f(k)\cdot
n^{\mathcal{O}(1)}.$ While such results are not surprising since it is known
that optimizing over $\mathrm{STAB}_k(G)$ is $FPT$ for graphs of bounded
expansion and $W[1]$-hard in general, they are also not trivial and in both
cases stronger than the corresponding computational complexity results.
","[{'version': 'v1', 'created': 'Fri, 27 Nov 2015 22:31:26 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Feb 2016 10:35:03 GMT'}, {'version': 'v3', 'created': 'Tue, 7 Mar 2017 12:41:47 GMT'}]",2017-03-08,"[['Gajarský', 'Jakub', ''], ['Hliněný', 'Petr', ''], ['Tiwary', 'Hans Raj', '']]","['extension complexity', 'fixed-parameter polynomial extension', 'independent set polytope', 'bounded expansion']"
15719,1609.09471,Lovedeep Gondara,Lovedeep Gondara,Classifier comparison using precision,Extended version,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  New proposed models are often compared to state-of-the-art using statistical
significance testing. Literature is scarce for classifier comparison using
metrics other than accuracy. We present a survey of statistical methods that
can be used for classifier comparison using precision, accounting for
inter-precision correlation arising from use of same dataset. Comparisons are
made using per-class precision and methods presented to test global null
hypothesis of an overall model comparison. Comparisons are extended to multiple
multi-class classifiers and to models using cross validation or its variants.
Partial Bayesian update to precision is introduced when population prevalence
of a class is known. Applications to compare deep architectures are studied.
","[{'version': 'v1', 'created': 'Thu, 29 Sep 2016 19:19:29 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Nov 2016 01:43:21 GMT'}]",2016-11-17,"[['Gondara', 'Lovedeep', '']]","['Classifier comparison', 'statistical hypothesis testing', 'statistical comparison', 'precision', 'precision comparison', 'updated precision']"
15720,1304.7819,Michael Adrir Scott,Michael 'Adrir' Scott,"Vocalnayno: Designing a Game-Based Intervention to Support Reading
  Development in Primary Schools","Presented at the 6th European Conference on Games-Based Learning, Oct
  4-5, 2012, Cork, Ireland","Proceedings of the 6th European Conference on Games-Based
  Learning. ACPI: Reading, UK. 654--657",,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Encouraging children to read frequently and helping them to develop their
reading skills as effectively as possible can be a challenge for some primary
schools. This research questions whether the use of a game-based intervention
can integrate into the existing teaching culture to aid volunteer teaching
assistants in achieving a more significant impact on pupil reading development.
A prototype based on the initial process of requirements gathering is presented
using Multimedia Fusion Developer 2. The design incorporates a game-like
exercise where a foam volcano character releases bubbles containing letters and
words. Pupils must read these aloud in order to burst them open, which is
recorded as a metric of reading ability.
","[{'version': 'v1', 'created': 'Mon, 29 Apr 2013 23:58:35 GMT'}]",2013-05-01,"[['Scott', ""Michael 'Adrir'"", '']]","['Games', 'Education', 'e-Learning', 'Reading', 'Primary School', 'Method']"
15721,1605.02628,Fenix Huang,Fenix W.D. Huang and Christian M. Reidys,Topological language for RNA,"29 pages, 13 figures, 1 table",,,,cs.FL q-bio.BM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we introduce a novel, context-free grammar, {\it
RNAFeatures$^*$}, capable of generating any RNA structure including pseudoknot
structures (pk-structure). We represent pk-structures as orientable fatgraphs,
which naturally leads to a filtration by their topological genus. Within this
framework, RNA secondary structures correspond to pk-structures of genus zero.
{\it RNAFeatures$^*$} acts on formal, arc-labeled RNA secondary structures,
called $\lambda$-structures. $\lambda$-structures correspond one-to-one to
pk-structures together with some additional information. This information
consists of the specific rearrangement of the backbone, by which a pk-structure
can be made cross-free. {\it RNAFeatures$^*$} is an extension of the grammar
for secondary structures and employs an enhancement by labelings of the symbols
as well as the production rules. We discuss how to use {\it RNAFeatures$^*$} to
obtain a stochastic context-free grammar for pk-structures, using data of RNA
sequences and structures. The induced grammar facilitates fast Boltzmann
sampling and statistical analysis. As a first application, we present an $O(n
log(n))$ runtime algorithm which samples pk-structures based on ninety tRNA
sequences and structures from the Nucleic Acid Database (NDB).
","[{'version': 'v1', 'created': 'Mon, 9 May 2016 15:44:59 GMT'}]",2016-05-10,"[['Huang', 'Fenix W. D.', ''], ['Reidys', 'Christian M.', '']]","['RNA pseudoknot structure', 'context-free grammar', 'topological RNAstructure', 'fatgraph', 'stochastic context-free grammar']"
15722,1008.4406,Fangwen Fu,"Fangwen Fu, and Mihaela van der Schaar","Structural Solutions to Dynamic Scheduling for Multimedia Transmission
  in Unknown Wireless Environments",,,,,cs.MM cs.LG cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a systematic solution to the problem of scheduling
delay-sensitive media data for transmission over time-varying wireless
channels. We first formulate the dynamic scheduling problem as a Markov
decision process (MDP) that explicitly considers the users' heterogeneous
multimedia data characteristics (e.g. delay deadlines, distortion impacts and
dependencies etc.) and time-varying channel conditions, which are not
simultaneously considered in state-of-the-art packet scheduling algorithms.
This formulation allows us to perform foresighted decisions to schedule
multiple data units for transmission at each time in order to optimize the
long-term utilities of the multimedia applications. The heterogeneity of the
media data enables us to express the transmission priorities between the
different data units as a priority graph, which is a directed acyclic graph
(DAG). This priority graph provides us with an elegant structure to decompose
the multi-data unit foresighted decision at each time into multiple single-data
unit foresighted decisions which can be performed sequentially, from the high
priority data units to the low priority data units, thereby significantly
reducing the computation complexity. When the statistical knowledge of the
multimedia data characteristics and channel conditions is unknown a priori, we
develop a low-complexity online learning algorithm to update the value
functions which capture the impact of the current decision on the future
utility. The simulation results show that the proposed solution significantly
outperforms existing state-of-the-art scheduling solutions.
","[{'version': 'v1', 'created': 'Wed, 25 Aug 2010 23:06:39 GMT'}]",2010-08-27,"[['Fu', 'Fangwen', ''], ['van der Schaar', 'Mihaela', '']]","['Multimedia Streaming', 'Delay Sensitive Communications', 'Markov Decision Process', 'Directed Acyclic Graph', 'Scheduling']"
15723,1109.2075,Miguel Goul\~ao,"Arlindo Lima, Miguel Goul\~ao and Miguel Pessoa Monteiro","Evidence-Based Comparison of Modularity Support Between Java and Object
  Teams","Proceedings of Empirical Evaluation of Software Composition
  Techniques (ESCOT 2010), at 9th International Conference on Aspect-Oriented
  Software Development (AOSD'2010), Rennes and Saint Malo, France, 2010","Proceedings of Empirical Evaluation of Software Composition
  Techniques (ESCOT 2010), at 9th International Conference on Aspect-Oriented
  Software Development (AOSD'2010), Rennes and Saint Malo, France, 2010",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Aspect-oriented programming (AOP) is an emerging programming
paradigm whose focus is about improving modularity, with an emphasis on the
modularization of crosscutting concerns.
  Objective: The goal of this paper is to assess the extent to which an AOP
language -ObjectTeams/Java (OT/J) -improves the modularity of a software
system. This improvement has been claimed but, to the best of our knowledge,
this paper is the first attempting to present quantitative evidence of it.
  Method: We compare functionally-equivalent implementations of the
Gang-of-Four design patterns, developed in Java and OT/J, using software
metrics.
  Results: The results of our comparison support the modularity improvement
claims made in the literature. For six of the seven metrics used, the OT/J
versions of the patterns obtained significantly better results.
  Limitations: This work uses a set of metrics originally defined for
object-oriented (OO) systems. It may be the case that the metrics are biased,
in that they were created in the context of OO programming (OOP), before the
advent of AOP. We consider this comparison a stepping stone as, ultimately, we
plan to assess the modularity improvements with paradigm independent metrics,
which will conceivably eliminate the bias. Each individual example from the
sample used in this paper is small. In future, we plan to replicate this
experiment using larger systems, where the benefits of AOP may be more
noticeable.
  Conclusion: This work contributes with evidence to fill gaps in the body of
quantitative results supporting alleged benefits to software modularity brought
by AOP languages, namely OT/J.
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2011 17:42:29 GMT'}]",2011-10-03,"[['Lima', 'Arlindo', ''], ['Goulão', 'Miguel', ''], ['Monteiro', 'Miguel Pessoa', '']]","['Aspect-Oriented Programming', 'Object Teams', 'Modularity', 'Metrics', 'Evidence-Based Software Engineering']"
15724,1504.06744,Benjamin Monmege,"Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege,
  Guillermo A. P\'erez, and Gabriel Renault",Quantitative Games under Failures,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study a generalisation of sabotage games, a model of dynamic network games
introduced by van Benthem. The original definition of the game is inherently
finite and therefore does not allow one to model infinite processes. We propose
an extension of the sabotage games in which the first player (Runner) traverses
an arena with dynamic weights determined by the second player (Saboteur). In
our model of quantitative sabotage games, Saboteur is now given a budget that
he can distribute amongst the edges of the graph, whilst Runner attempts to
minimise the quantity of budget witnessed while completing his task. We show
that, on the one hand, for most of the classical cost functions considered in
the literature, the problem of determining if Runner has a strategy to ensure a
cost below some threshold is EXPTIME-complete. On the other hand, if the budget
of Saboteur is fixed a priori, then the problem is in PTIME for most cost
functions. Finally, we show that restricting the dynamics of the game also
leads to better complexity.
","[{'version': 'v1', 'created': 'Sat, 25 Apr 2015 17:20:54 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Jul 2015 07:29:19 GMT'}]",2015-07-16,"[['Brihaye', 'Thomas', ''], ['Geeraerts', 'Gilles', ''], ['Haddad', 'Axel', ''], ['Monmege', 'Benjamin', ''], ['Pérez', 'Guillermo A.', ''], ['Renault', 'Gabriel', '']]","['Quantitative games', 'Verification', 'Synthesis', 'Game theory']"
15725,1603.06465,Giovanni Russo,"Giovanni Russo, Rovert Shorten","On noise-induced synchronization and consensus of nonlinear network
  systems under input disturbances","Preprint submitted to SIAM SICON. arXiv admin note: text overlap with
  arXiv:1602.06467",,,,cs.SY math.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is concerned with the study of synchronization and consensus
phenomena in complex networks of diffusively-coupled nodes subject to external
disturbances. Specifically, we make use of stochastic Lyapunov functions to
provide conditions for synchronization and consensus for networks of nonlinear,
diffusively coupled nodes, where noise diffusion is not just additive but it
depends on the nodes' state. The sufficient condition we provide, wich links
together network topology, coupling strength and noise diffusion, offers two
interesting interpretations. First, as suggested by {\em intuition}, in order
for a network to achieve synchronization/consensus, its nodes need to be
sufficiently well connected together. The second implication might seem,
instead, counter-intuitive: if noise diffusion is {\em properly} designed, then
it can drive an unsynchronized network towards synchronization/consensus.
Motivated by our current research in Smart Cities and Internet of Things, we
illustrate the effectiveness of our approach by showing how our results can be
used to control certain collective decision processes.
","[{'version': 'v1', 'created': 'Mon, 21 Mar 2016 15:45:01 GMT'}]",2016-03-22,"[['Russo', 'Giovanni', ''], ['Shorten', 'Rovert', '']]","['Ito differential equations', 'Synchronization', 'Complex NetworksNotes Preprint submitted to SIAM SICON']"
15726,1705.09616,Fadhil Firyaguna,"Fadhil Firyaguna, Jacek Kibilda, Carlo Galiotto and Nicola Marchetti","Coverage and Spectral Efficiency of Indoor mmWave Networks with
  Ceiling-Mounted Access Points","7 pages, 6 figures, submitted and accepted to IEEE GLOBECOM 2017",,,,cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Provisioning of high throughput millimetre-wave signal to indoor areas that
potentially serve a large number of users, such as transportation hubs or
convention centres, will require dedicated indoor millimetre-wave access point
deployments. In this article, we study dense deployments of millimetre-wave
access points mounted on the ceiling and illuminating selected spots on the
ground with the use of fixed directional antennas. In this setup, the main
factor limiting signal propagation are blockages by human bodies. We evaluate
our system under a number of scenarios that take into account beamwidth of the
main-lobe, access point density, and positioning of the mobile device with
respect to the user's body. We find that both coverage and area spectral
efficiency curves exhibit non-trivial behaviour which can be classified into
four regions related to the selection of access point density, beamwidth, and
height values. Furthermore, we observe a trade-off in beamwidth design, as the
optimal beamwidth maximizes either coverage or area spectral efficiency, but
not both. Finally, when we consider different body shadowing scenarios, our
network design optimizes coverage or area spectral efficiency performance
towards either devices held in hand or worn directly against the body, as each
of the scenarios requires mutually exclusive settings of access point density
and beamwidth.
","[{'version': 'v1', 'created': 'Fri, 26 May 2017 15:21:23 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Sep 2017 17:59:19 GMT'}, {'version': 'v3', 'created': 'Fri, 16 Feb 2018 14:56:35 GMT'}]",2018-02-19,"[['Firyaguna', 'Fadhil', ''], ['Kibilda', 'Jacek', ''], ['Galiotto', 'Carlo', ''], ['Marchetti', 'Nicola', '']]","['millimetre-wave networks', 'ultra-dense networks', 'selfbody blockage']"
15727,1412.3717,Sergey Tarasenko,Natalia Efremova and Sergey Tarasenko,"Unsupervised Neural Architecture for Saliency Detection: Extended
  Version","10 pages, 26 figures",,,,cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel neural network architecture for visual saliency
detections, which utilizes neurophysiologically plausible mechanisms for
extraction of salient regions. The model has been significantly inspired by
recent findings from neurophysiology and aimed to simulate the bottom-up
processes of human selective attention. Two types of features were analyzed:
color and direction of maximum variance. The mechanism we employ for processing
those features is PCA, implemented by means of normalized Hebbian learning and
the waves of spikes. To evaluate performance of our model we have conducted
psychological experiment. Comparison of simulation results with those of
experiment indicates good performance of our model.
","[{'version': 'v1', 'created': 'Tue, 18 Nov 2014 11:09:01 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Apr 2015 12:30:14 GMT'}]",2015-04-13,"[['Efremova', 'Natalia', ''], ['Tarasenko', 'Sergey', '']]","['neural network models', 'visual saliency detection', 'normalized Hebbian learning', 'Oja’s rule', 'psychological experiment']"
15728,0909.2496,Pu Yang,"Pu Yang, Jun Guo, Guang Chen",Pavideoge: A Metadata Markup Video Structure in Video Search Engine,Submitted,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the problems of video processing in video search
engine. Video has now become a very important kind of data in Internet; while
searching for video is still a challenging task due to the inner properties of
video: requiring enormous storage space, being independent, expressing
information hiddenly. To handle the properties of video more effectively, in
this paper, we propose a new video processing method in video search engine. In
detail, the core of the new video processing method is creating pavideoge--a
new data type, which contains the video advantages and webpage advantages. The
pavideoge has four attributes: real link, videorank, text information and
playnum. Each of them combines video's properties with webpage's. Video search
engine based on the pavideoge can retrieve video more effectively. The
experiment results show the encouraging performance of our approach. Based on
the pavideoge, our video search engine can retrieve more precise videos in
comparsion with previous related work.
","[{'version': 'v1', 'created': 'Mon, 14 Sep 2009 09:39:17 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Oct 2009 17:39:28 GMT'}]",2009-10-02,"[['Yang', 'Pu', ''], ['Guo', 'Jun', ''], ['Chen', 'Guang', '']]","['Metadata markup video structure', 'pavideoge', 'video search engine']"
15729,1307.6542,Shofwatul Uyun Mrs,"Shofwatul 'Uyun, Sri Hartati, Agus Harjoko, Subanar","Selection Mammogram Texture Descriptors Based on Statistics Properties
  Backpropagation Structure","5 pages, International Journal of Computer Science and Information
  Security (IJCSIS) Vol. 11, No. 5, May 2013 Article ID 26041306, arXiv admin
  note: substantial text overlap with arXiv:1306.5960; arXiv:1306.6489",,,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Computer Aided Diagnosis (CAD) system has been developed for the early
detection of breast cancer, one of the most deadly cancer for women. The benign
of mammogram has different texture from malignant. There are fifty mammogram
images used in this work which are divided for training and testing. Therefore,
the selection of the right texture to determine the level of accuracy of CAD
system is important. The first and second order statistics are the texture
feature extraction methods which can be used on a mammogram. This work
classifies texture descriptor into nine groups where the extraction of features
is classified using backpropagation learning with two types of multi-layer
perceptron (MLP). The best texture descriptor as selected when the value of
regression 1 appears in both the MLP-1 and the MLP-2 with the number of epoches
less than 1000. The results of testing show that the best selected texture
descriptor is the second order (combination) using all direction (0, 45, 90 and
135) that have twenty four descriptors.
","[{'version': 'v1', 'created': 'Wed, 10 Jul 2013 02:42:29 GMT'}]",2013-07-25,"[[""'Uyun"", 'Shofwatul', ''], ['Hartati', 'Sri', ''], ['Harjoko', 'Agus', ''], ['Subanar', '', '']]","['feature', 'extraction', 'mammogram', 'classification']"
15730,1505.06366,Viktoras Veitas Mr.,David Weinbaum (Weaver) and Viktoras Veitas,Open Ended Intelligence: The individuation of Intelligent Agents,"Preprint; 35 pages, 2 figures; Keywords: intelligence, cognition,
  individuation, assemblage, self-organization, sense-making, coordination,
  enaction; en-US proofreading",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Artificial General Intelligence is a field of research aiming to distill the
principles of intelligence that operate independently of a specific problem
domain or a predefined context and utilize these principles in order to
synthesize systems capable of performing any intellectual task a human being is
capable of and eventually go beyond that. While ""narrow"" artificial
intelligence which focuses on solving specific problems such as speech
recognition, text comprehension, visual pattern recognition, robotic motion,
etc. has shown quite a few impressive breakthroughs lately, understanding
general intelligence remains elusive. In the paper we offer a novel theoretical
approach to understanding general intelligence. We start with a brief
introduction of the current conceptual approach. Our critique exposes a number
of serious limitations that are traced back to the ontological roots of the
concept of intelligence. We then propose a paradigm shift from intelligence
perceived as a competence of individual agents defined in relation to an a
priori given problem domain or a goal, to intelligence perceived as a formative
process of self-organization by which intelligent agents are individuated. We
call this process open-ended intelligence. Open-ended intelligence is developed
as an abstraction of the process of cognitive development so its application
can be extended to general agents and systems. We introduce and discuss three
facets of the idea: the philosophical concept of individuation, sense-making
and the individuation of general cognitive agents. We further show how
open-ended intelligence can be framed in terms of a distributed,
self-organizing network of interacting elements and how such process is
scalable. The framework highlights an important relation between coordination
and intelligence and a new understanding of values. We conclude with a number
of questions for future research.
","[{'version': 'v1', 'created': 'Sat, 23 May 2015 19:32:54 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Jun 2015 14:57:23 GMT'}]",2015-06-15,"[['Weinbaum', 'David', '', 'Weaver'], ['Veitas', 'Viktoras', '']]","['intelligence', 'cognition', 'individuation', 'assemblage', 'self-organization', 'sensemaking', 'coordination', 'enaction']"
15731,1701.07110,Giuseppe Santucci,Enrico Bertini and Giuseppe Santucci,"By chance is not enough: Preserving relative density through non uniform
  sampling","Keywords: visual clutter, visual quality metrics, non-uniform
  sampling","Proceedings - Eighth International Conference on Information
  Visualisation, IV 2004; London; United Kingdom; 14 July 2004 through 16 July
  2004; Category numberPR02177; Code 63599",,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dealing with visualizations containing large data set is a challenging issue
and, in the field of Information Visualization, almost every visual technique
reveals its drawback when visualizing large number of items. To deal with this
problem we introduce a formal environment, modeling in a virtual space the
image features we are interested in (e.g, absolute and relative density,
clusters, etc.) and we define some metrics able to characterize the image
decay. Such metrics drive our automatic techniques (i.e., not uniform sampling)
rescuing the image features and making them visible to the user. In this paper
we focus on 2D scatter-plots, devising a novel non uniform data sampling
strategy able to preserve in an effective way relative densities.
","[{'version': 'v1', 'created': 'Tue, 24 Jan 2017 23:35:09 GMT'}]",2017-01-26,"[['Bertini', 'Enrico', ''], ['Santucci', 'Giuseppe', '']]","['visual clutter', 'metrics', 'non-uniform sampling']"
15732,1607.02714,Maria Han Veiga,Maria Han Veiga and Carsten Eickhoff,"Privacy Leakage through Innocent Content Sharing in Online Social
  Networks","8 pages, 10 figures, submitted to Privacy Preserving Workshop, Sigir",,,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increased popularity and ubiquitous availability of online social
networks and globalised Internet access have affected the way in which people
share content. The information that users willingly disclose on these platforms
can be used for various purposes, from building consumer models for
advertising, to inferring personal, potentially invasive, information. In this
work, we use Twitter, Instagram and Foursquare data to convey the idea that the
content shared by users, especially when aggregated across platforms, can
potentially disclose more information than was originally intended. We perform
two case studies: First, we perform user de-anonymization by mimicking the
scenario of finding the identity of a user making anonymous posts within a
group of users. Empirical evaluation on a sample of real-world social network
profiles suggests that cross-platform aggregation introduces significant
performance gains in user identification. In the second task, we show that it
is possible to infer physical location visits of a user on the basis of shared
Twitter and Instagram content. We present an informativeness scoring function
which estimates the relevance and novelty of a shared piece of information with
respect to an inference task. This measure is validated using an active
learning framework which chooses the most informative content at each given
point in time. Based on a large-scale data sample, we show that by doing this,
we can attain an improved inference performance. In some cases this performance
exceeds even the use of the user's full timeline.
","[{'version': 'v1', 'created': 'Sun, 10 Jul 2016 08:41:53 GMT'}]",2016-07-12,"[['Veiga', 'Maria Han', ''], ['Eickhoff', 'Carsten', '']]","['Privacy', 'Social networks', 'Information value']"
15733,0906.5450,Sk Sarif Hassan s,"Pabitra Pal Choudhury, Sk. Sarif Hassan, Sudhakar Sahoo, Birendra
  Kumar Nayak",Theory of Rule 6 and its Application to Round Robin Tournament,Related to Scheduling Problems,,,,cs.DM cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we have used one 2 variable Boolean function called Rule 6 to
define another beautiful transformation named as Extended Rule-6. Using this
function we have explored the algebraic beauties and its application to an
efficient Round Robin Tournament (RRT) routine for 2k (k is any natural number)
number of teams. At the end, we have thrown some light towards any number of
teams of the form nk where n, k are natural numbers.
","[{'version': 'v1', 'created': 'Tue, 30 Jun 2009 09:34:07 GMT'}]",2009-07-01,"[['Choudhury', 'Pabitra Pal', ''], ['Hassan', 'Sk. Sarif', ''], ['Sahoo', 'Sudhakar', ''], ['Nayak', 'Birendra Kumar', '']]","['Boolean functions', 'fractals', 'Round-Robin Tournament', 'Carry value Transformation', 'Extended Rule 6', 'Analogous rule 6']"
15734,1506.08641,Yakup Ko\c{c},"Yakup Koc, Abhishek Raman, Martijn Warnier, Tarun Kumar",Structural Vulnerability Analysis of Electric Power Distribution Grids,,,,,cs.SY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Power grid outages cause huge economical and societal costs. Disruptions in
the power distribution grid are responsible for a significant fraction of
electric power unavailability to customers. The impact of extreme weather
conditions, continuously increasing demand, and the over-ageing of assets in
the grid, deteriorates the safety of electric power delivery in the near
future. It is this dependence on electric power that necessitates further
research in the power distribution grid security assessment. Thus measures to
analyze the robustness characteristics and to identify vulnerabilities as they
exist in the grid are of utmost importance. This research investigates exactly
those concepts- the vulnerability and robustness of power distribution grids
from a topological point of view, and proposes a metric to quantify them with
respect to assets in a distribution grid. Real-world data is used to
demonstrate the applicability of the proposed metric as a tool to assess the
criticality of assets in a distribution grid.
","[{'version': 'v1', 'created': 'Thu, 25 Jun 2015 15:45:30 GMT'}]",2015-06-30,"[['Koc', 'Yakup', ''], ['Raman', 'Abhishek', ''], ['Warnier', 'Martijn', ''], ['Kumar', 'Tarun', '']]","['Power Distribution Grid', 'Topological Robustness', 'Structural Vulnerability', 'Metric', 'Complex Networks']"
15735,0710.4705,EDA Publishing Association,"Roman Lysecky, Frank Vahid","A Study of the Speedups and Competitiveness of FPGA Soft Processor Cores
  using Dynamic Hardware/Software Partitioning",Submitted on behalf of EDAA (http://www.edaa.com/),"Dans Design, Automation and Test in Europe - DATE'05, Munich :
  Allemagne (2005)",,,cs.AR,,"  Field programmable gate arrays (FPGAs) provide designers with the ability to
quickly create hardware circuits. Increases in FPGA configurable logic capacity
and decreasing FPGA costs have enabled designers to more readily incorporate
FPGAs in their designs. FPGA vendors have begun providing configurable soft
processor cores that can be synthesized onto their FPGA products. While FPGAs
with soft processor cores provide designers with increased flexibility, such
processors typically have degraded performance and energy consumption compared
to hard-core processors. Previously, we proposed warp processing, a technique
capable of optimizing a software application by dynamically and transparently
re-implementing critical software kernels as custom circuits in on-chip
configurable logic. In this paper, we study the potential of a MicroBlaze
soft-core based warp processing system to eliminate the performance and energy
overhead of a soft-core processor compared to a hard-core processor. We
demonstrate that the soft-core based warp processor achieves average speedups
of 5.8 and energy reductions of 57% compared to the soft core alone. Our data
shows that a soft-core based warp processor yields performance and energy
consumption competitive with existing hard-core processors, thus expanding the
usefulness of soft processor cores on FPGAs to a broader range of applications.
","[{'version': 'v1', 'created': 'Thu, 25 Oct 2007 09:29:03 GMT'}]",2011-11-09,"[['Lysecky', 'Roman', ''], ['Vahid', 'Frank', '']]","['Hardware/software partitioning', 'warp processing', 'FPGA', 'dynamic optimization', 'soft cores', 'MicroBlaze']"
15736,0706.1119,Stefan Stefanov Z,Stefan Z. Stefanov,Cointegration of the Daily Electric Power System Load and the Weather,"8 pages, extended version",,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper makes a thermal predictive analysis of the electric power system
security for a day ahead. This predictive analysis is set as a thermal
computation of the expected security. This computation is obtained by
cointegrating the daily electric power systen load and the weather, by finding
the daily electric power system thermodynamics and by introducing tests for
this thermodynamics. The predictive analysis made shows the electricity
consumers' wisdom.
","[{'version': 'v1', 'created': 'Fri, 8 Jun 2007 07:04:24 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Jan 2011 11:53:45 GMT'}]",2011-01-25,"[['Stefanov', 'Stefan Z.', '']]","['predictive analysis', 'security', 'thermodynamics', 'cointegration', 'wisdom']"
15737,1506.02190,Lei Tang,Lei Tang,Thresholding for Top-k Recommendation with Temporal Dynamics,10 pages,,,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work focuses on top-k recommendation in domains where underlying data
distribution shifts overtime. We propose to learn a time-dependent bias for
each item over whatever existing recommendation engine. Such a bias learning
process alleviates data sparsity in constructing the engine, and at the same
time captures recent trend shift observed in data. We present an alternating
optimization framework to resolve the bias learning problem, and develop
methods to handle a variety of commonly used recommendation evaluation
criteria, as well as large number of items and users in practice. The proposed
algorithm is examined, both offline and online, using real world data sets
collected from the largest retailer worldwide. Empirical results demonstrate
that the bias learning can almost always boost recommendation performance. We
encourage other practitioners to adopt it as a standard component in
recommender systems where temporal dynamics is a norm.
","[{'version': 'v1', 'created': 'Sat, 6 Jun 2015 20:13:28 GMT'}, {'version': 'v2', 'created': 'Mon, 9 Nov 2015 05:37:07 GMT'}]",2015-11-10,"[['Tang', 'Lei', '']]","['bias learning', 'temporal dynamics', 'top-k recommendation']"
15738,1108.6328,Olaf Hartig,Olaf Hartig and Johann-Christoph Freytag,"Foundations of Traversal Based Query Execution over Linked Data
  (Extended Version)","v5: aligned with the final version published in HT'2012; v4: new
  Sec.3.2, added the concept of 'LD machine decidability', added the concept of
  'seed identifiers', 20 pages; v3: new Sec.6.5, rewritten Abstract and intro,
  proofs in single column format, 19 pages; v2: completed missing proof, 16
  pages; v1: 15 pages",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Query execution over the Web of Linked Data has attracted much attention
recently. A particularly interesting approach is link traversal based query
execution which proposes to integrate the traversal of data links into the
construction of query results. Hence -in contrast to traditional query
execution paradigms- this approach does not assume a fixed set of relevant data
sources beforehand; instead, it discovers data on the fly and, thus, enables
applications to tap the full potential of the Web.
  While several authors study possibilities to implement the idea of link
traversal based query execution and to optimize query execution in this
context, no work exists that discusses the theoretical foundations of the
approach in general. Our paper fills this gap.
  We introduce a well-defined semantics for queries that may be executed using
the link traversal based approach. Based on this semantics we formally analyze
properties of such queries. In particular, we study the computability of
queries as well as the implications of querying a potentially infinite Web of
Linked Data. Our results show that query computation in general is not
guaranteed to terminate and that for any given query it is undecidable whether
the execution terminates. Furthermore, we define an abstract execution model
that captures the integration of link traversal into the query execution
process. Based on this model we prove the soundness and completeness of link
traversal based query execution and analyze an existing implementation
approach..
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2011 19:22:48 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Sep 2011 19:00:46 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Nov 2011 15:30:02 GMT'}, {'version': 'v4', 'created': 'Wed, 22 Feb 2012 12:07:44 GMT'}, {'version': 'v5', 'created': 'Fri, 20 Apr 2012 18:36:24 GMT'}]",2012-04-23,"[['Hartig', 'Olaf', ''], ['Freytag', 'Johann-Christoph', '']]","['link traversal based query execution', 'query semantics', 'computability', 'Web of Data', 'Linked Data']"
15739,0909.5656,Dragos Falie,D. Falie,Improvements of the 3D images captured with Time-of-Flight cameras,,,,,cs.CV cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  3D Time-of-Flight camera's images are affected by errors due to the diffuse
(indirect) light and to the flare light. The presented method improves the 3D
image reducing the distance's errors to dark surface objects. This is achieved
by placing one or two contrast tags in the scene at different distances from
the ToF camera. The white and black parts of the tags are situated at the same
distance to the camera but the distances measured by the camera are different.
This difference is used to compute a correction vector. The distance to black
surfaces is corrected by subtracting this vector from the captured vector
image.
","[{'version': 'v1', 'created': 'Wed, 30 Sep 2009 18:50:24 GMT'}]",2009-10-01,"[['Falie', 'D.', '']]","['Time-of-Flight camera', 'image improvements', 'distance errors']"
15740,1402.2741,Dimitris Papamichail,"Matthew Mabrey, Thomas Caputi, Georgios Papamichail, Dimitris
  Papamichail",Static Level Ancestors in Practice,,,,,cs.DS,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Given a rooted tree T, the level ancestor problem aims to answer queries of
the form LA(v, d), which identify the level d ancestor of a node v in the tree.
Several algorithms of varied complexity have been proposed for this problem in
the literature, including optimal solutions that preprocess the tree $T$ in
linear bounded time and proceed to answer queries in constant time. Despite its
significance and numerous applications, to date there have been no comparative
studies of the performance of these algorithms and few implementations are
widely available. In our experimental study we implemented and compared several
solutions to the level ancestor problem, including three theoretically optimal
algorithms, and examined their space requirements and time performance in
practice.
","[{'version': 'v1', 'created': 'Wed, 12 Feb 2014 05:37:11 GMT'}, {'version': 'v2', 'created': 'Sat, 23 Oct 2021 14:50:40 GMT'}]",2021-10-26,"[['Mabrey', 'Matthew', ''], ['Caputi', 'Thomas', ''], ['Papamichail', 'Georgios', ''], ['Papamichail', 'Dimitris', '']]","['level ancestors', 'algorithm implementations', 'tree queries']"
15741,1412.2857,V Amruth,"Jeril Kuriakose, Amruth V., Sandesh A. G., Jampu Venkata Naveenbabu,
  Mohammed Shahid, and Ashish Shetty","Analysis of Maximum Likelihood and Mahalanobis Distance for Identifying
  Cheating Anchor Nodes","10 pages, 13 pages, conference",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Malicious anchor nodes will constantly hinder genuine and appropriate
localization. Discovering the malicious or vulnerable anchor node is an
essential problem in wireless sensor networks (WSNs). In wireless sensor
networks, anchor nodes are the nodes that know its current location.
Neighboring nodes or non-anchor nodes calculate its location (or its location
reference) with the help of anchor nodes. Ingenuous localization is not
possible in the presence of a cheating anchor node or a cheating node.
Nowadays, its a challenging task to identify the cheating anchor node or
cheating node in a network. Even after finding out the location of the cheating
anchor node, there is no assurance, that the identified node is legitimate or
not. This paper aims to localize the cheating anchor nodes using trilateration
algorithm and later associate it with maximum likelihood expectation technique
(MLE), and Mahalanobis distance to obtain maximum accuracy in identifying
malicious or cheating anchor nodes during localization. We were able to attain
a considerable reduction in the error achieved during localization. For
implementation purpose we simulated our scheme using ns-3 network simulator.
","[{'version': 'v1', 'created': 'Tue, 9 Dec 2014 05:05:22 GMT'}]",2014-12-10,"[['Kuriakose', 'Jeril', ''], ['V.', 'Amruth', ''], ['G.', 'Sandesh A.', ''], ['Naveenbabu', 'Jampu Venkata', ''], ['Shahid', 'Mohammed', ''], ['Shetty', 'Ashish', '']]","['Maximum likelihood expectation', 'trilateration', 'mahalanobis distance', 'anchor node', 'security', 'distance-based localization', 'wireless sensor networks']"
15742,1712.05765,Xingyi Zhou,"Xingyi Zhou, Arjun Karpur, Chuang Gan, Linjie Luo, Qixing Huang","Unsupervised Domain Adaptation for 3D Keypoint Estimation via View
  Consistency",ECCV 2018,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce a novel unsupervised domain adaptation technique
for the task of 3D keypoint prediction from a single depth scan or image. Our
key idea is to utilize the fact that predictions from different views of the
same or similar objects should be consistent with each other. Such view
consistency can provide effective regularization for keypoint prediction on
unlabeled instances. In addition, we introduce a geometric alignment term to
regularize predictions in the target domain. The resulting loss function can be
effectively optimized via alternating minimization. We demonstrate the
effectiveness of our approach on real datasets and present experimental results
showing that our approach is superior to state-of-the-art general-purpose
domain adaptation techniques.
","[{'version': 'v1', 'created': 'Fri, 15 Dec 2017 17:46:13 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Jul 2018 04:38:58 GMT'}]",2018-07-27,"[['Zhou', 'Xingyi', ''], ['Karpur', 'Arjun', ''], ['Gan', 'Chuang', ''], ['Luo', 'Linjie', ''], ['Huang', 'Qixing', '']]","['3D Keypoint Estimation', 'Multi-View Consistency', 'DomainAdaptation', 'Unsupervised Learning']"
15743,1002.3757,Andrea Clementi,"Andrea Clementi, Angelo Monti, Riccardo Silvestri",Fast Flooding over Manhattan,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a Mobile Ad-hoc NETwork (MANET) formed by n agents that move at
speed V according to the Manhattan Random-Way Point model over a square region
of side length L. The resulting stationary (agent) spatial probability
distribution is far to be uniform: the average density over the ""central zone""
is asymptotically higher than that over the ""suburb"". Agents exchange data iff
they are at distance at most R within each other.
  We study the flooding time of this MANET: the number of time steps required
to broadcast a message from one source agent to all agents of the network in
the stationary phase. We prove the first asymptotical upper bound on the
flooding time. This bound holds with high probability, it is a decreasing
function of R and V, and it is tight for a wide and relevant range of the
network parameters (i.e. L, R and V).
  A consequence of our result is that flooding over the sparse and
highly-disconnected suburb can be as fast as flooding over the dense and
connected central zone. Rather surprisingly, this property holds even when R is
exponentially below the connectivity threshold of the MANET and the speed V is
very low.
","[{'version': 'v1', 'created': 'Fri, 19 Feb 2010 15:02:50 GMT'}]",2010-02-22,"[['Clementi', 'Andrea', ''], ['Monti', 'Angelo', ''], ['Silvestri', 'Riccardo', '']]","['Mobile Ad-Hoc Networks', 'Flooding Protocols', 'Probabilistic Analysis']"
15744,1610.03245,"Frank D\""urr","Frank D\""urr","A Flat and Scalable Data Center Network Topology Based on De Bruijn
  Graphs",,,,TR-2016-05,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the requirement of hosting tens of thousands of hosts in today's data
centers, data center networks strive for scalability and high throughput on the
one hand. On the other hand, the cost for networking hardware should be
minimized. Consequently, the number and complexity (e.g. TCAM size) of switches
has to be minimized. These requirements led to network topologies like Clos and
Leaf-Spine networks only requiring a shallow hierarchy of switches---two levels
for Leaf-Spine networks. The drawback of these topologies is that switches at
higher levels like Spine switches need a high port density and, thus, are
expensive and limit the scalability of the network.
  In this paper, we propose a data center network topology based on De Bruijn
graphs completely avoiding a switch hierarchy and implementing a flat network
topology of top-of-rack switches instead. This topology guarantees logarithmic
(short) path length. We show that the required routing logic can be implemented
by standard prefix matching operations in hardware (TCAM) allowing for using
commodity switches without any modification. Moreover, forwarding requires only
a very small number of forwarding table entries, saving costly and
energy-intensive TCAM.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2016 09:18:33 GMT'}]",2016-10-12,"[['Dürr', 'Frank', '']]","['data center network', 'topology', 'De Bruijn graph', 'constant degree network', 'scalability', 'software-defined networking']"
15745,1802.06219,Mohieddin Jafari Dr.,Mohieddin Jafari and Sayed Mohammad Fakhar,Network Centrality Analysis of Tehran Urban and Suburban Railway System,"8 pages, 3 figures and 1 table",,,,cs.SI physics.soc-ph,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Nowadays, Tehran Urban and Suburban Railway System (TUSRS) is going to be
completed by eight lines and 149 stations. This complex transportation system
contains 168 links between each station pairs and 20 cross-section and Y-branch
stations among all eight lines. In this study, we considered TUSRS as a complex
network and undertook several analyzes based on graph theory. Examining e.g.
centrality measures, we identified central stations within TUSRS. This analysis
could be useful for redistributing strategy of the overcrowded stations and
improving the organization of maintaining system. These findings are also
promising for better designing the systems of tomorrow in other metropolitan
areas in Iran.
","[{'version': 'v1', 'created': 'Sat, 17 Feb 2018 10:34:27 GMT'}]",2018-02-20,"[['Jafari', 'Mohieddin', ''], ['Fakhar', 'Sayed Mohammad', '']]","['Graph theory', 'Network science', 'Centrality analysis', 'Tehran Metro', 'Railway System']"
15746,0906.1557,Uri Yovel,"Asaf Levin, Uri Yovel",Uniform unweighted set cover: The power of non-oblivious local search,"31 pages, includes figures",,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We are given n base elements and a finite collection of subsets of them. The
size of any subset varies between p to k (p < k). In addition, we assume that
the input contains all possible subsets of size p. Our objective is to find a
subcollection of minimum-cardinality which covers all the elements. This
problem is known to be NP-hard. We provide two approximation algorithms for it,
one for the generic case, and an improved one for the special case of (p,k) =
(2,4). The algorithm for the generic case is a greedy one, based on packing
phases: at each phase we pick a collection of disjoint subsets covering i new
elements, starting from i = k down to i = p+1. At a final step we cover the
remaining base elements by the subsets of size p. We derive the exact
performance guarantee of this algorithm for all values of k and p, which is
less than Hk, where Hk is the k'th harmonic number. However, the algorithm
exhibits the known improvement methods over the greedy one for the unweighted
k-set cover problem (in which subset sizes are only restricted not to exceed
k), and hence it serves as a benchmark for our improved algorithm. The improved
algorithm for the special case of (p,k) = (2,4) is based on non-oblivious local
search: it starts with a feasible cover, and then repeatedly tries to replace
sets of size 3 and 4 so as to maximize an objective function which prefers big
sets over small ones. For this case, our generic algorithm achieves an
asymptotic approximation ratio of 1.5 + epsilon, and the local search algorithm
achieves a better ratio, which is bounded by 1.458333... + epsilon.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2009 18:26:42 GMT'}]",2009-06-09,"[['Levin', 'Asaf', ''], ['Yovel', 'Uri', '']]","['Approximation algorithms', 'set cover', 'local search']"
15747,1010.0157,Gerald Paul,Gerald Paul,"Comparative Performance of Tabu Search and Simulated Annealing
  Heuristics for the Quadratic Assignment Problem",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For almost two decades the question of whether tabu search (TS) or simulated
annealing (SA) performs better for the quadratic assignment problem has been
unresolved. To answer this question satisfactorily, we compare performance at
various values of targeted solution quality, running each heuristic at its
optimal number of iterations for each target. We find that for a number of
varied problem instances, SA performs better for higher quality targets while
TS performs better for lower quality targets.
","[{'version': 'v1', 'created': 'Fri, 1 Oct 2010 13:29:22 GMT'}]",2010-10-04,"[['Paul', 'Gerald', '']]","['Combinatorial optimization', 'Computing science', 'Heuristics', 'Tabu search', 'Simulated annealing']"
15748,1412.5873,Mohab Safey El Din,"Didier Henrion, Simone Naldi, Mohab Safey El Din",Real root finding for determinants of linear matrices,,,,,cs.SC math.AG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $\A_0, \A_1, \ldots, \A_n$ be given square matrices of size $m$ with
rational coefficients. The paper focuses on the exact computation of one point
in each connected component of the real determinantal variety $\{\X \in\RR^n \:
:\: \det(\A_0+x_1\A_1+\cdots+x_n\A_n)=0\}$. Such a problem finds applications
in many areas such as control theory, computational geometry, optimization,
etc. Using standard complexity results this problem can be solved using
$m^{O(n)}$ arithmetic operations. Under some genericity assumptions on the
coefficients of the matrices, we provide an algorithm solving this problem
whose runtime is essentially quadratic in ${{n+m}\choose{n}}^{3}$. We also
report on experiments with a computer implementation of this algorithm. Its
practical performance illustrates the complexity estimates. In particular, we
emphasize that for subfamilies of this problem where $m$ is fixed, the
complexity is polynomial in $n$.
","[{'version': 'v1', 'created': 'Thu, 18 Dec 2014 14:28:36 GMT'}]",2014-12-19,"[['Henrion', 'Didier', ''], ['Naldi', 'Simone', ''], ['Din', 'Mohab Safey El', '']]","['Computer algebra', 'real algebraic geometry', 'determinantal varieties']"
15749,1505.04207,Wojciech Mazurczyk,"Wojciech Mazurczyk, Szymon Drobniak and Sean Moore",Towards a Systematic View on Cybersecurity Ecology,"11 pages, 3 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current network security systems are progressively showing their limitations.
One credible estimate is that only about 45% of new threats are detected.
Therefore it is vital to find a new direction that cybersecurity development
should follow. We argue that the next generation of cybersecurity systems
should seek inspiration in nature. This approach has been used before in the
first generation of cybersecurity systems; however, since then cyber threats
and environment have evolved significantly, and accordingly the
first-generation systems have lost their effectiveness. A next generation of
bio-inspired cybersecurity research is emerging, but progress is hindered by
the lack of a framework for mapping biological security systems to their cyber
analogies. In this paper, using terminology and concepts from biology, we
describe a cybersecurity ecology and a framework that may be used to
systematically research and develop bio-inspired cybersecurity.
","[{'version': 'v1', 'created': 'Fri, 15 May 2015 21:32:38 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Apr 2016 09:50:24 GMT'}]",2016-04-14,"[['Mazurczyk', 'Wojciech', ''], ['Drobniak', 'Szymon', ''], ['Moore', 'Sean', '']]","['bio-inspired cybersecurity', 'cybersecurity ecology', 'biomimetic systems', 'cyber-ecosystem']"
15750,1402.1258,Vishal Verma,"Mohit Kumar Gupta, Vishal Verma, Megha Singh Verma",In-Memory Database Systems - A Paradigm Shift,"Pages-4, Figures-1, Published with International Journal of
  Engineering Trends and Technology (IJETT)","International Journal of Engineering Trends and Technology (IJETT)
  6(6):333-336, Dec. 2013. Published by Seventh Sense Research Group",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In today world, organizations like Google, Yahoo, Amazon, Facebook etc. are
facing drastic increase in data. This leads to the problem of capturing,
storing, managing and analyzing terabytes or petabytes of data, stored in
multiple formats, from different internal and external sources. Moreover, new
applications scenarios like weather forecasting, trading, artificial
intelligence etc. need huge data processing in real time. These requirements
exceed the processing capacity of traditional on-disk database management
systems to manage this data and to give speedy real time results. Therefore,
data management needs new solutions for coping with the challenges of data
volumes and processing data in real-time. An in-memory database system (IMDS)
is a latest breed of database management system which is becoming answer to
above challenges with other supporting technologies. IMDS is capable to process
massive data distinctly faster. This paper explores IMDS approach and its
associated design issues and challenges. It also investigates some famous
commercial and open-source IMDS solutions available in the market.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2014 06:17:51 GMT'}]",2014-02-07,"[['Gupta', 'Mohit Kumar', ''], ['Verma', 'Vishal', ''], ['Verma', 'Megha Singh', '']]","['In-Memory Database System (IMDS)', 'Design issues and challenges for IMDS', 'Commercial', 'open-source IMDS']"
15751,1701.08761,Rupam Bhattacharyya,"Rupam Bhattacharyya, Adity Saikia and Shyamanta M. Hazarika","C3A: A Cognitive Collaborative Control Architecture For an Intelligent
  Wheelchair",,,,,cs.RO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Retention of residual skills for persons who partially lose their cognitive
or physical ability is of utmost importance. Research is focused on developing
systems that provide need-based assistance for retention of such residual
skills. This paper describes a novel cognitive collaborative control
architecture C3A, designed to address the challenges of developing need- based
assistance for wheelchair navigation. Organization of C3A is detailed and
results from simulation of the proposed architecture is presented. For
simulation of our proposed architecture, we have used ROS (Robot Operating
System) as a control framework and a 3D robotic simulator called USARSim
(Unified System for Automation and Robot Simulation).
","[{'version': 'v1', 'created': 'Mon, 30 Jan 2017 11:53:59 GMT'}]",2017-02-01,"[['Bhattacharyya', 'Rupam', ''], ['Saikia', 'Adity', ''], ['Hazarika', 'Shyamanta M.', '']]","['Collaborative control', 'ROS', 'USARSim', '3D robotic simulator']"
15752,1409.3530,Alexandr Savinov,Alexandr Savinov,Concept-oriented model: inference in hierarchical multidimensional space,"19 pages, 14 figures, Full version of the paper published in DATA
  2012 conference",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In spite of its fundamental importance, inference has not been an inherent
function of multidimensional models and analytical applications. These models
are mainly aimed at numeric (quantitative) analysis where the notions of
inference and semantics are not well defined. In this paper we argue that
inference can be and should be integral part of multidimensional data models
and analytical applications. It is demonstrated how inference can be defined
using only multidimensional terms like axes and coordinates as opposed to using
logic-based approaches. We propose a novel approach to inference in
multidimensional space based on the concept-oriented model of data and
introduce elementary operations which are then used to define constraint
propagation and inference procedures. We describe a query language with
inference operator and demonstrate its usefulness in solving complex analytical
tasks.
","[{'version': 'v1', 'created': 'Thu, 11 Sep 2014 18:29:32 GMT'}]",2014-09-12,"[['Savinov', 'Alexandr', '']]","['Data models', 'query languages', 'multidimensional analysis', 'inference', 'partial order']"
15753,1212.4522,Yunchao Gong,Yunchao Gong and Qifa Ke and Michael Isard and Svetlana Lazebnik,"A Multi-View Embedding Space for Modeling Internet Images, Tags, and
  their Semantics",To Appear: International Journal of Computer Vision,,,,cs.CV cs.IR cs.LG cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates the problem of modeling Internet images and
associated text or tags for tasks such as image-to-image search, tag-to-image
search, and image-to-tag search (image annotation). We start with canonical
correlation analysis (CCA), a popular and successful approach for mapping
visual and textual features to the same latent space, and incorporate a third
view capturing high-level image semantics, represented either by a single
category or multiple non-mutually-exclusive concepts. We present two ways to
train the three-view embedding: supervised, with the third view coming from
ground-truth labels or search keywords; and unsupervised, with semantic themes
automatically obtained by clustering the tags. To ensure high accuracy for
retrieval tasks while keeping the learning process scalable, we combine
multiple strong visual features and use explicit nonlinear kernel mappings to
efficiently approximate kernel CCA. To perform retrieval, we use a specially
designed similarity function in the embedded space, which substantially
outperforms the Euclidean distance. The resulting system produces compelling
qualitative results and outperforms a number of two-view baselines on retrieval
tasks on three large-scale Internet image datasets.
","[{'version': 'v1', 'created': 'Tue, 18 Dec 2012 22:02:43 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Sep 2013 19:14:58 GMT'}]",2013-09-13,"[['Gong', 'Yunchao', ''], ['Ke', 'Qifa', ''], ['Isard', 'Michael', ''], ['Lazebnik', 'Svetlana', '']]","['lake', 'plants', 'sunset']"
15754,1704.08545,Hengshuang Zhao,"Hengshuang Zhao, Xiaojuan Qi, Xiaoyong Shen, Jianping Shi, Jiaya Jia",ICNet for Real-Time Semantic Segmentation on High-Resolution Images,ECCV 2018,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We focus on the challenging task of real-time semantic segmentation in this
paper. It finds many practical applications and yet is with fundamental
difficulty of reducing a large portion of computation for pixel-wise label
inference. We propose an image cascade network (ICNet) that incorporates
multi-resolution branches under proper label guidance to address this
challenge. We provide in-depth analysis of our framework and introduce the
cascade feature fusion unit to quickly achieve high-quality segmentation. Our
system yields real-time inference on a single GPU card with decent quality
results evaluated on challenging datasets like Cityscapes, CamVid and
COCO-Stuff.
","[{'version': 'v1', 'created': 'Thu, 27 Apr 2017 13:02:49 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Aug 2018 03:34:25 GMT'}]",2018-08-21,"[['Zhao', 'Hengshuang', ''], ['Qi', 'Xiaojuan', ''], ['Shen', 'Xiaoyong', ''], ['Shi', 'Jianping', ''], ['Jia', 'Jiaya', '']]","['Real-Time', 'High-Resolution', 'Semantic Segmentation']"
15755,1306.0221,Mohammed Alreshoodi,Mohammed Alreshoodi and John Woods,Survey on QoE\QoS Correlation Models For Multimedia Services,"20 pages, International Journal of Distributed and Parallel Systems
  (IJDPS)","International Journal of Distributed and Parallel Systems (IJDPS)
  Vol.4, No.3, May 2013",,,cs.MM cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a brief review of some existing correlation models which
attempt to map Quality of Service (QoS) to Quality of Experience (QoE) for
multimedia services. The term QoS refers to deterministic network behaviour, so
that data can be transported with a minimum of packet loss, delay and maximum
bandwidth. QoE is a subjective measure that involves human dimensions; it ties
together user perception, expectations, and experience of the application and
network performance. The Holy Grail of subjective measurement is to predict it
from the objective measurements; in other words predict QoE from a given set of
QoS parameters or vice versa. Whilst there are many quality models for
multimedia, most of them are only partial solutions to predicting QoE from a
given QoS. This contribution analyses a number of previous attempts and
optimisation techniquesthat can reliably compute the weighting coefficients for
the QoS/QoE mapping.
","[{'version': 'v1', 'created': 'Sun, 2 Jun 2013 15:53:26 GMT'}]",2013-06-04,"[['Alreshoodi', 'Mohammed', ''], ['Woods', 'John', '']]","['QoE', 'QoS', 'Perceived Quality', 'Quality Metrics']"
15756,1710.05693,David Chapela-Campa,"David Chapela-Campa, Manuel Mucientes, Manuel Lama",Mining Frequent Patterns in Process Models,,,,,cs.AI cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Process mining has emerged as a way to analyze the behavior of an
organization by extracting knowledge from event logs and by offering techniques
to discover, monitor and enhance real processes. In the discovery of process
models, retrieving a complex one, i.e., a hardly readable process model, can
hinder the extraction of information. Even in well-structured process models,
there is information that cannot be obtained with the current techniques. In
this paper, we present WoMine, an algorithm to retrieve frequent behavioural
patterns from the model. Our approach searches in process models extracting
structures with sequences, selections, parallels and loops, which are
frequently executed in the logs. This proposal has been validated with a set of
process models, including some from BPI Challenges, and compared with the state
of the art techniques. Experiments have validated that WoMine can find all
types of patterns, extracting information that cannot be mined with the state
of the art techniques.
","[{'version': 'v1', 'created': 'Wed, 11 Oct 2017 18:33:19 GMT'}]",2017-10-17,"[['Chapela-Campa', 'David', ''], ['Mucientes', 'Manuel', ''], ['Lama', 'Manuel', '']]","['Frequent pattern mining', 'Process mining', 'Process discovery']"
15757,1704.06700,Ahmad Nauman Ghazi,Shoaib Bakhtyar and Ahmad Nauman Ghazi,"On Improving Research Methodology Course at Blekinge Institute of
  Technology","Conference on Higher Education, L\""ararl\""ardom2016 Kristianstad
  University Press Sweden. 2016",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Research Methodology in Software Engineering and Computer Science (RM) is
a compulsory course that must be studied by graduate students at Blekinge
Institute of Technology (BTH) prior to undertaking their theses work. The
course is focused on teaching research methods and techniques for data
collection and analysis in the fields of Computer Science and Software
Engineering. It is intended that the course should help students in practically
applying appropriate research methods in different courses (in addition to the
RM course) including their Master's theses. However, it is believed that there
exist deficiencies in the course due to which the course implementation
(learning and assessment activities) as well as the performance of different
participants (students, teachers, and evaluators) are affected negatively. In
this article our aim is to investigate potential deficiencies in the RM course
at BTH in order to provide a concrete evidence on the deficiencies faced by
students, evaluators, and teachers in the course. Additionally, we suggest
recommendations for resolving the identified deficiencies. Our findings
gathered through semi-structured interviews with students, teachers, and
evaluators in the course are presented in this article. By identifying a total
of twenty one deficiencies from different perspectives, we found that there
exist critical deficiencies at different levels within the course. Furthermore,
in order to overcome the identified deficiencies, we suggest seven
recommendations that may be implemented at different levels within the course
and the study program. Our suggested recommendations, if implemented, will help
in resolving deficiencies in the course, which may lead to achieving an
improved teaching and learning in the RM course at BTH.
","[{'version': 'v1', 'created': 'Fri, 21 Apr 2017 20:11:57 GMT'}]",2017-04-25,"[['Bakhtyar', 'Shoaib', ''], ['Ghazi', 'Ahmad Nauman', '']]","['Research methods', 'Software Engineering', 'Computer Science', 'Course Improvement']"
15758,1106.6037,Arnaud Labourel,"J\'er\'emie Chalopin (LIF), Shantanu Das (LIF), Arnaud Labourel (LIF),
  Euripides Markou",Black Hole Search with Finite Automata Scattered in a Synchronous Torus,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of locating a black hole in synchronous anonymous
networks using finite state agents. A black hole is a harmful node in the
network that destroys any agent visiting that node without leaving any trace.
The objective is to locate the black hole without destroying too many agents.
This is difficult to achieve when the agents are initially scattered in the
network and are unaware of the location of each other. Previous studies for
black hole search used more powerful models where the agents had non-constant
memory, were labelled with distinct identifiers and could either write messages
on the nodes of the network or mark the edges of the network. In contrast, we
solve the problem using a small team of finite-state agents each carrying a
constant number of identical tokens that could be placed on the nodes of the
network. Thus, all resources used in our algorithms are independent of the
network size. We restrict our attention to oriented torus networks and first
show that no finite team of finite state agents can solve the problem in such
networks, when the tokens are not movable. In case the agents are equipped with
movable tokens, we determine lower bounds on the number of agents and tokens
required for solving the problem in torus networks of arbitrary size. Further,
we present a deterministic solution to the black hole search problem for
oriented torus networks, using the minimum number of agents and tokens.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2011 19:43:23 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Jul 2011 14:04:27 GMT'}]",2011-07-29,"[['Chalopin', 'Jérémie', '', 'LIF'], ['Das', 'Shantanu', '', 'LIF'], ['Labourel', 'Arnaud', '', 'LIF'], ['Markou', 'Euripides', '']]","['Distributed Algorithms', 'Fault Tolerance', 'Black Hole Search', 'Anonymous Networks', 'Mobile Agents', 'Identical Tokens', 'Finite State Automata']"
15759,1407.4738,Lalit Kumar Saini,"Lalit Kumar Saini, Vishal Shrivastava","Analysis of Attacks on Hybrid DWT-DCT Algorithm for Digital Image
  Watermarking With MATLAB",4 Pages,"IJCST V2(3): Page(123-125) May-June 2014. ISSN: 2347-8578.
  www.ijcstjournal.org",,,cs.CR cs.MM,http://creativecommons.org/licenses/by/3.0/,"  Watermarking algorithms needs properties of robustness and perceptibility.
But these properties are affected by different -2 types of attacks performed on
watermarked images. The goal of performing attacks is destroy the information
of watermark hidden in the watermarked image. So every Algorithms should be
previously tested by developers so that it would not affected by attacks.
","[{'version': 'v1', 'created': 'Thu, 17 Jul 2014 17:07:13 GMT'}]",2015-12-08,"[['Saini', 'Lalit Kumar', ''], ['Shrivastava', 'Vishal', '']]","['DWT-DCT', 'MATLAB', 'Gaussian Filter', 'Salt &Peeper noise']"
15760,1704.04905,Manuel Mazzara,"Alexandr Naumchev, Manuel Mazzara, Bertrand Meyer, Jean-Michel Bruel,
  Florian Galinier, Sophie Ebersold",A contract-based method to specify stimulus-response requirements,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A number of formal methods exist for capturing stimulus-response requirements
in a declarative form. Someone yet needs to translate the resulting declarative
statements into imperative programs. The present article describes a method for
specification and verification of stimulus-response requirements in the form of
imperative program routines with conditionals and assertions. A program prover
then checks a candidate program directly against the stated requirements. The
article illustrates the approach by applying it to an ASM model of the Landing
Gear System, a widely used realistic example proposed for evaluating
specification and verification techniques.
","[{'version': 'v1', 'created': 'Mon, 17 Apr 2017 08:57:35 GMT'}]",2017-04-18,"[['Naumchev', 'Alexandr', ''], ['Mazzara', 'Manuel', ''], ['Meyer', 'Bertrand', ''], ['Bruel', 'Jean-Michel', ''], ['Galinier', 'Florian', ''], ['Ebersold', 'Sophie', '']]","['Seamless Requirements', 'Design by Contract', 'AutoProof', 'Eiffel', 'Landing Gear System']"
15761,1105.0393,Guido F.  Montufar,"Tyll Krueger and Guido Montufar and Ruedi Seiler and Rainer
  Siegmund-Schultze",Universally Typical Sets for Ergodic Sources of Multidimensional Data,"15 pages, 1 figure. To appear in Kybernetika. This replacement
  corrects typos and slightly strengthens the main theorem",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We lift important results about universally typical sets, typically sampled
sets, and empirical entropy estimation in the theory of samplings of discrete
ergodic information sources from the usual one-dimensional discrete-time
setting to a multidimensional lattice setting. We use techniques of packings
and coverings with multidimensional windows to construct sequences of
multidimensional array sets which in the limit build the generated samples of
any ergodic source of entropy rate below an $h_0$ with probability one and
whose cardinality grows at most at exponential rate $h_0$.
","[{'version': 'v1', 'created': 'Mon, 2 May 2011 18:14:33 GMT'}, {'version': 'v2', 'created': 'Tue, 3 May 2011 14:40:54 GMT'}, {'version': 'v3', 'created': 'Tue, 12 Nov 2013 11:47:16 GMT'}]",2013-11-13,"[['Krueger', 'Tyll', ''], ['Montufar', 'Guido', ''], ['Seiler', 'Ruedi', ''], ['Siegmund-Schultze', 'Rainer', '']]","['universal codes', 'typical sampling sets', 'entropy estimation', 'asymptotic equipartition property', 'ergodic theory']"
15762,1611.00255,Nathanael Perraudin N. P.,"Andreas Loukas and Nathana\""el Perraudin",Stationary time-vertex signal processing,,,,,cs.LG cs.DS stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers regression tasks involving high-dimensional multivariate
processes whose structure is dependent on some {known} graph topology. We put
forth a new definition of time-vertex wide-sense stationarity, or joint
stationarity for short, that goes beyond product graphs. Joint stationarity
helps by reducing the estimation variance and recovery complexity. In
particular, for any jointly stationary process (a) one reliably learns the
covariance structure from as little as a single realization of the process, and
(b) solves MMSE recovery problems, such as interpolation and denoising, in
computational time nearly linear on the number of edges and timesteps.
Experiments with three datasets suggest that joint stationarity can yield
accuracy improvements in the recovery of high-dimensional processes evolving
over a graph, even when the latter is only approximately known, or the process
is not strictly stationary.
","[{'version': 'v1', 'created': 'Tue, 1 Nov 2016 14:56:33 GMT'}, {'version': 'v2', 'created': 'Tue, 23 May 2017 18:35:44 GMT'}, {'version': 'v3', 'created': 'Mon, 8 Jul 2019 12:34:27 GMT'}]",2019-07-09,"[['Loukas', 'Andreas', ''], ['Perraudin', 'Nathanaël', '']]","['stationarity', 'multivariate time-vertex processes', 'harmonic analysis', 'graph signal processing', 'PSD estimation∗']"
15763,1712.06289,Yi Zhang,"Yi Zhang, Xu Sun","A Chinese Dataset with Negative Full Forms for General Abbreviation
  Prediction",,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Abbreviation is a common phenomenon across languages, especially in Chinese.
In most cases, if an expression can be abbreviated, its abbreviation is used
more often than its fully expanded forms, since people tend to convey
information in a most concise way. For various language processing tasks,
abbreviation is an obstacle to improving the performance, as the textual form
of an abbreviation does not express useful information, unless it's expanded to
the full form. Abbreviation prediction means associating the fully expanded
forms with their abbreviations. However, due to the deficiency in the
abbreviation corpora, such a task is limited in current studies, especially
considering general abbreviation prediction should also include those full form
expressions that do not have valid abbreviations, namely the negative full
forms (NFFs). Corpora incorporating negative full forms for general
abbreviation prediction are few in number. In order to promote the research in
this area, we build a dataset for general Chinese abbreviation prediction,
which needs a few preprocessing steps, and evaluate several different models on
the built dataset. The dataset is available at
https://github.com/lancopku/Chinese-abbreviation-dataset
","[{'version': 'v1', 'created': 'Mon, 18 Dec 2017 08:24:12 GMT'}]",2017-12-19,"[['Zhang', 'Yi', ''], ['Sun', 'Xu', '']]","['Chinese abbreviation', 'negative full forms', 'conditional random field', 'long-short term memory']"
15764,1009.4566,S. M. Kamruzzaman,S. M. Kamruzzaman and Md. Monirul Islam,"An Algorithm to Extract Rules from Artificial Neural Networks for
  Medical Diagnosis Problems","19 Pages, Internatiomal Journal","International Journal of Information Technology (IJIT), Vol. 12,
  No. 8, pp. 41-59, 2006",,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Artificial neural networks (ANNs) have been successfully applied to solve a
variety of classification and function approximation problems. Although ANNs
can generally predict better than decision trees for pattern classification
problems, ANNs are often regarded as black boxes since their predictions cannot
be explained clearly like those of decision trees. This paper presents a new
algorithm, called rule extraction from ANNs (REANN), to extract rules from
trained ANNs for medical diagnosis problems. A standard three-layer feedforward
ANN with four-phase training is the basis of the proposed algorithm. In the
first phase, the number of hidden nodes in ANNs is determined automatically by
a constructive algorithm. In the second phase, irrelevant connections and input
nodes are removed from trained ANNs without sacrificing the predictive accuracy
of ANNs. The continuous activation values of the hidden nodes are discretized
by using an efficient heuristic clustering algorithm in the third phase.
Finally, rules are extracted from compact ANNs by examining the discretized
activation values of the hidden nodes. Extensive experimental studies on three
benchmark classification problems, i.e. breast cancer, diabetes and lenses,
demonstrate that REANN can generate high quality rules from ANNs, which are
comparable with other methods in terms of number of rules, average number of
conditions for a rule, and predictive accuracy.
","[{'version': 'v1', 'created': 'Thu, 23 Sep 2010 10:30:55 GMT'}]",2010-09-28,"[['Kamruzzaman', 'S. M.', ''], ['Islam', 'Md. Monirul', '']]","['Constructive algorithm', 'pruning algorithm', 'continuous activation function', 'clustering algorithm', 'symbolic rules']"
15765,1710.02310,Farnoosh Heidarivincheh,"Farnoosh Heidarivincheh, Majid Mirmehdi, Dima Damen","Detecting the Moment of Completion: Temporal Models for Localising
  Action Completion",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Action completion detection is the problem of modelling the action's
progression towards localising the moment of completion - when the action's
goal is confidently considered achieved. In this work, we assess the ability of
two temporal models, namely Hidden Markov Models (HMM) and Long-Short Term
Memory (LSTM), to localise completion for six object interactions: switch,
plug, open, pull, pick and drink. We use a supervised approach, where
annotations of pre-completion and post-completion frames are available per
action, and fine-tuned CNN features are used to train temporal models. Tested
on the Action-Completion-2016 dataset, we detect completion within 10 frames of
annotations for ~75% of completed action sequences using both temporal models.
Results show that fine-tuned CNN features outperform hand-crafted features for
localisation, and that observing incomplete instances is necessary when
incomplete sequences are also present in the test set.
","[{'version': 'v1', 'created': 'Fri, 6 Oct 2017 08:30:05 GMT'}]",2017-10-09,"[['Heidarivincheh', 'Farnoosh', ''], ['Mirmehdi', 'Majid', ''], ['Damen', 'Dima', '']]","['action completion', 'action recognition/detection', 'Convolutional NeuralNetwork', 'Long-Short Term Memory', 'Hidden Markov Model']"
15766,1307.2554,El Amin Aoulad Abdelouarit,El Amin Aoulad Abdelouarit (LSIT),"Les index pour les entrep\^ots de donn\'ees : comparaison entre index
  arbre-B et Bitmap","14 pages, Proposition et d\'emonstration exp\'eriment\'ee","REVIST - Revue Ivoirienne des Sciences et Technologie - ISSN
  1813-3290 - No 20 - December 2012 - Pages:35-67",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the development of decision systems and specially data warehouses, the
visibility of the data warehouse design before its creation has become
essential, and that because of data warehouse importance as considered as the
unique data source giving meaning to the decision. In a decision system the
proper functioning of a data warehouse resides in the smooth running of the
middleware tools ETC step one hand, and the restitution step through the data
mining, reporting solutions, dashboards... etc other. The large volume of data
that passes through these stages require an optimal design for a highly
efficient decision system, without disregarding the choice of technologies that
are introduced for the data warehouse implementation such as: database
management system, the type of server operating systems, physical server
architecture (64-bit, for example) that can be a benefit performance of this
system. The designer of the data warehouse should consider the effectiveness of
data query, this depends on the selection of relevant indexes and their
combination with the materialized views, note that the index selection is a
NPcomplete problem, because the number of indexes is exponential in the total
number of attributes in the database, So, it is necessary to provide, while the
data warehouse design, the suitable type of index for this data warehouse. This
paper presents a comparative study between the index B-tree type and type
Bitmap, their advantages and disadvantages, with a real experiment showing that
its index of type Bitmap more advantageous than the index B-tree type.
","[{'version': 'v1', 'created': 'Tue, 9 Jul 2013 19:31:50 GMT'}]",2013-10-03,"[['Abdelouarit', 'El Amin Aoulad', '', 'LSIT']]","['Data Warehouse DBMS', 'indexes', 'business intelligence']"
15767,1111.3001,Asif Khan mr,"Asif Irshad Khan, Rizwan Jameel Qurashi, Usman Ali Khan","A Comprehensive Study of Commonly Practiced Heavy and Light Weight
  Software Methodologies","10 pages, ISSN (Online): 1694-0814","IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 4, No 2, 2011, 441-450",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software has been playing a key role in the development of modern society.
Software industry has an option to choose suitable methodology/process model
for its current needs to provide solutions to give problems. Though some
companies have their own customized methodology for developing their software
but majority agrees that software methodologies fall under two categories that
are heavyweight and lightweight. Heavyweight methodologies (Waterfall Model,
Spiral Model) are also known as the traditional methodologies, and their
focuses are detailed documentation, inclusive planning, and extroverted design.
Lightweight methodologies (XP, SCRUM) are, referred as agile methodologies.
Light weight methodologies focused mainly on short iterative cycles, and rely
on the knowledge within a team. The aim of this paper is to describe the
characteristics of popular heavyweight and lightweight methodologies that are
widely practiced in software industries. We have discussed the strengths and
weakness of the selected models. Further we have discussed the strengths and
weakness between the two opponent methodologies and some criteria is also
illustrated that help project managers for the selection of suitable model for
their projects.
","[{'version': 'v1', 'created': 'Sun, 13 Nov 2011 11:01:52 GMT'}]",2011-11-15,"[['Khan', 'Asif Irshad', ''], ['Qurashi', 'Rizwan Jameel', ''], ['Khan', 'Usman Ali', '']]","['Software Process', 'Software Development Methodology', 'Software development life cycle', 'Agile', 'Heavyweight']"
15768,1410.4147,Belal Amro,Belal Amro,"Mobile Agent Systems, Recent Security Threats and Counter Measures","international journal of computer science issues, march 2014",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile agent technology offers a dramatically evolving computing paradigm in
which a program, in the form of a software agent, can suspend its execution on
a host computer, transfers itself to another agent-enabled host on the network,
and resumes execution on the new host. It is 1960's since mobile code has been
used in the form of remote job entry systems. Today's mobile agents can be
characterized in a number of ways ranging from simple distributed objects to
highly organized intelligent softwares. As a result of this rapid evolvement of
mobile agents, plenty of critical security issues has risen and plenty of work
is being done to address these problems. The aim is to provide trusted mobile
agent systems that can be easily deployed and widely adopted. In this paper, we
provide an overview of the most recent threats facing the designers of agent
platforms and the developers of agent-based applications. The paper also
identifies security objectives, and measures for countering the identified
threats and fulfilling those security objectives.
","[{'version': 'v1', 'created': 'Mon, 6 Oct 2014 19:35:22 GMT'}]",2014-10-16,"[['Amro', 'Belal', '']]","['Mobile agent', 'Agent platforms', 'Security threats', 'Attacks']"
15769,1206.1665,Sarvesh Sharma,Sarvesh Kumar Sharma,An Approach In Optimization Of AD-Hoc Routing Algorithms,"10 pages, 2 figures, International Journal of Distributed and
  Parallel Systems (IJDPS) Vol.3, No.3, May 2012, ISSN: 0976 - 9757 [Online],
  2229 - 3957 [Print]",,,,cs.NI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper different optimization of Ad-hoc routing algorithm is surveyed
and a new method using training based optimization algorithm for reducing the
complexity of routing algorithms is suggested. A binary matrix is assigned to
each node in the network and gets updated after each data transfer using the
protocols. The use of optimization algorithm in routing algorithm can reduce
the complexity of routing to the least amount possible.
","[{'version': 'v1', 'created': 'Fri, 8 Jun 2012 05:05:25 GMT'}]",2012-06-11,"[['Sharma', 'Sarvesh Kumar', '']]","['Ad-hoc Networks', 'Algorithm', 'Protocol']"
15770,1604.08709,Yanjing Wang,Tao Gu and Yanjing Wang,"""Knowing value"" logic as a normal modal logic","21 pages, in Advances in Modal Logic Vol 11: 362-381 College
  Publications. This is a draft with a more detailed proof of Prop. 3.5",,,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent years witness a growing interest in nonstandard epistemic logics of
""knowing whether"", ""knowing what"", ""knowing how"", and so on. These logics are
usually not normal, i.e., the standard axioms and reasoning rules for modal
logic may be invalid. In this paper, we show that the conditional ""knowing
value"" logic proposed by Wang and Fan \cite{WF13} can be viewed as a disguised
normal modal logic by treating the negation of the Kv operator as a special
diamond. Under this perspective, it turns out that the original first-order
Kripke semantics can be greatly simplified by introducing a ternary relation
$R_i^c$ in standard Kripke models, which associates one world with two
$i$-accessible worlds that do not agree on the value of constant $c$. Under
intuitive constraints, the modal logic based on such Kripke models is exactly
the one studied by Wang and Fan (2013,2014}. Moreover, there is a very natural
binary generalization of the ""knowing value"" diamond, which, surprisingly, does
not increase the expressive power of the logic. The resulting logic with the
binary diamond has a transparent normal modal system, which sharpens our
understanding of the ""knowing value"" logic and simplifies some previously hard
problems.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2016 07:22:27 GMT'}, {'version': 'v2', 'created': 'Sun, 12 Jun 2016 16:48:41 GMT'}, {'version': 'v3', 'created': 'Mon, 21 Nov 2016 05:34:15 GMT'}]",2016-11-22,"[['Gu', 'Tao', ''], ['Wang', 'Yanjing', '']]","['knowing value', 'normal modal logic', 'ternary relation', 'binary modality', 'first-order modal logic']"
15771,1004.1770,Rdv Ijcsis,"Neeta Deshpande, Archana Rajurkar, R Manthalkar",Review of Robust Video Watermarking Algorithms,"IEEE Publication format, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","IJCSIS, Vol. 7 No. 3, March 2010, 237-246",,,cs.MM,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  There has been a remarkable increase in the data exchange over web and the
widespread use of digital media. As a result, multimedia data transfers also
had a boost up. The mounting interest with reference to digital watermarking
throughout the last decade is certainly due to the increase in the need of
copyright protection of digital content. This is also enhanced due to
commercial prospective. Applications of video watermarking in copy control,
broadcast monitoring, fingerprinting, video authentication, copyright
protection etc is immensely rising. The main aspects of information hiding are
capacity, security and robustness. Capacity deals with the amount of
information that can be hidden. The skill of anyone detecting the information
is security and robustness refers to the resistance to modification of the
cover content before concealed information is destroyed. Video watermarking
algorithms normally prefers robustness. In a robust algorithm it is not
possible to eliminate the watermark without rigorous degradation of the cover
content. In this paper, we introduce the notion of Video Watermarking and the
features required to design a robust watermarked video for a valuable
application. We review several algorithms, and introduce frequently used key
techniques. The aim of this paper is to focus on the various domains of video
watermarking techniques. The majority of the reviewed methods based on video
watermarking emphasize on the notion of robustness of the algorithm.
","[{'version': 'v1', 'created': 'Sun, 11 Apr 2010 08:07:40 GMT'}]",2010-04-13,"[['Deshpande', 'Neeta', ''], ['Rajurkar', 'Archana', ''], ['Manthalkar', 'R', '']]","['Video Watermarking', 'Authentication', 'Robust', 'Techniques', 'DCT', 'DWT']"
15772,1802.06319,Paul Ralph,"Pontus Johnson, Paul Ralph, Mathias Ekstedt, Iaakov Exman, Michael
  Goedicke",Consensus in Software Engineering: A Cognitive Mapping Study,"10 pages, 6 Figures, 6 Tables",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Philosophers of science including Collins, Feyerabend, Kuhn and
Latour have all emphasized the importance of consensus within scientific
communities of practice. Consensus is important for maintaining legitimacy with
outsiders, orchestrating future research, developing educational curricula and
agreeing industry standards. Low consensus contrastingly undermines a field's
reputation and hinders peer review. Aim: This paper aims to investigate the
degree of consensus within the software engineering academic community
concerning members' implicit theories of software engineering. Method: A
convenience sample of 60 software engineering researchers produced diagrams
describing their personal understanding of causal relationships between core
software engineering constructs. The diagrams were then analyzed for patterns
and clusters. Results: At least three schools of thought may be forming;
however, their interpretation is unclear since they do not correspond to known
divisions within the community (e.g. Agile vs. Plan-Driven methods).
Furthermore, over one third of participants do not belong to any cluster.
Conclusion: Although low consensus is common in social sciences, the rapid pace
of innovation observed in software engineering suggests that high consensus is
achievable given renewed commitment to empiricism and evidence-based practice.
","[{'version': 'v1', 'created': 'Sun, 18 Feb 2018 02:12:49 GMT'}]",2018-02-20,"[['Johnson', 'Pontus', ''], ['Ralph', 'Paul', ''], ['Ekstedt', 'Mathias', ''], ['Exman', 'Iaakov', ''], ['Goedicke', 'Michael', '']]","['Empirical Software Engineering', 'Scientific Consensus', 'Clustering']"
15773,0704.2014,Leandro R\^ego,"Joseph Y. Halpern, Leandro C. R\^ego",Extensive Games with Possibly Unaware Players,"45 pages, 3 figures, a preliminary version was presented at AAMAS06",,,,cs.GT cs.MA,,"  Standard game theory assumes that the structure of the game is common
knowledge among players. We relax this assumption by considering extensive
games where agents may be unaware of the complete structure of the game. In
particular, they may not be aware of moves that they and other agents can make.
We show how such games can be represented; the key idea is to describe the game
from the point of view of every agent at every node of the game tree. We
provide a generalization of Nash equilibrium and show that every game with
awareness has a generalized Nash equilibrium. Finally, we extend these results
to games with awareness of unawareness, where a player i may be aware that a
player j can make moves that i is not aware of, and to subjective games, where
payers may have no common knowledge regarding the actual game and their beliefs
are incompatible with a common prior.
","[{'version': 'v1', 'created': 'Mon, 16 Apr 2007 13:58:47 GMT'}]",2007-05-23,"[['Halpern', 'Joseph Y.', ''], ['Rêgo', 'Leandro C.', '']]","['Economic Theory', 'Foundations of Game Theory', 'Awareness', 'Solution Concepts']"
15774,1504.01855,Balaji Dhanasekaran,"R.D. Balaji, V. Veeramani, Malathi Balaji",Math Marvel with M-Learning,"7 pages, ROMIST 2015, Oman",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Math is the backbone of any field. Still its a night mare for many. Recent
survey proves that many students become dropouts from their higher education
due to math courses. ICT is an enchanted word in the contemporary educational
environment. It made the learning process more entertaining and almost made the
knowledge loss negligible. Adopting the ICT in math courses are still in the
infant level. Hence its a challenge placed in front of the IT and academic
professionals teaching math to make a suitable ICT tools for math courses to
make the learning an amusing experience. In this paper we have highlighted
three main concepts which make the math classes in a fascinating way. The first
method is introducing revolutionary hybrid ebooks which make the reading with
both audio and video facilities. The second method is facilitating the flip
class room so that student may have anywhere-anytime learning experience.
Finally the recent trends in m-learning are using apps for math courses. We
have highlighted the improvement showed by the students based on the survey
conducted with two groups of students with m-learning tools and without
m-learning tools. Even though there are good improvements showed by the
students, we the researchers feel that few more improvements are required in
these methodologies. The suggestions for the same are made in the
recommendations and conclusion section.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2015 07:53:31 GMT'}]",2015-04-09,"[['Balaji', 'R. D.', ''], ['Veeramani', 'V.', ''], ['Balaji', 'Malathi', '']]","['ICT', 'M-Learning', 'Flipped Classroom', 'Hybrid E-books', 'Math Apps', 'E-Learning']"
15775,1008.2574,Jinyoung Han,"Jinyoung Han, Taejoong Chung, Seungbae Kim, Hyun-chul Kim, Ted
  ""Taekyoung"" Kwon, Yanghee Choi",An Empirical Study on Content Bundling in BitTorrent Swarming System,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the tremendous success of BitTorrent, its swarming system suffers
from a fundamental limitation: lower or no availability of unpopular contents.
Recently, Menasche et al. has shown that bundling is a promising solution to
mitigate this availability problem; it improves the availability and reduces
download times for unpopular contents by combining multiple files into a single
swarm. There also have been studies on bundling strategies and performance
issues in bundled swarms. In spite of the recent surge of interest in the
benefits of and strategies for bundling, there are still little empirical
grounding for understanding, describing, and modeling it. This is the first
empirical study that measures and analyzes how prevalent contents bundling is
in BitTorrent and how peers access the bundled contents, in comparison to the
other non-bundled (i.e., single-filed) ones. To our surprise, we found that
around 70% of BitTorrent swarms contain multiple files, which indicate that
bundling has become widespread for contents sharing. We also show that the
amount of bytes shared in bundled swarms is estimated to be around 85% out of
all the BitTorrent contents logged in our datasets. Inspired from our findings,
we raise and discuss three important research questions in the field of file
sharing systems as well as future contents-oriented networking: i) bundling
strategies, ii) bundling-aware sharing systems in BitTorrent, and iii)
implications on content-oriented networking.
","[{'version': 'v1', 'created': 'Mon, 16 Aug 2010 05:25:19 GMT'}]",2010-08-17,"[['Han', 'Jinyoung', ''], ['Chung', 'Taejoong', ''], ['Kim', 'Seungbae', ''], ['Kim', 'Hyun-chul', ''], ['Kwon', 'Ted ""Taekyoung""', ''], ['Choi', 'Yanghee', '']]","['Content Bundling', 'Swarming System', 'Peer-to-Peer System', 'BitTorrent', 'Content-Oriented Networking']"
15776,1511.08689,Ekram Hossain,"K. N. R. Surya Vara Prasad, Ekram Hossain, and Vijay K. Bhargava","Energy Efficiency in Massive MIMO-Based 5G Networks: Opportunities and
  Challenges","IEEE Wireless Communications, under review",,,,cs.NI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As we make progress towards the era of fifth generation (5G) communication
networks, energy efficiency (EE) becomes an important design criterion because
it guarantees sustainable evolution. In this regard, the massive multiple-input
multiple-output (MIMO) technology, where the base stations (BSs) are equipped
with a large number of antennas so as to achieve multiple orders of spectral
and energy efficiency gains, will be a key technology enabler for 5G. In this
article, we present a comprehensive discussion on state-of-the-art techniques
which further enhance the EE gains offered by massive MIMO (MM). We begin with
an overview of MM systems and discuss how realistic power consumption models
can be developed for these systems. Thereby, we discuss and identify few
shortcomings of some of the most prominent EE-maximization techniques present
in the current literature. Then, we discuss ""hybrid MM systems"" operating in a
5G architecture, where MM operates in conjunction with other potential
technology enablers, such as millimetre wave, heterogenous networks, and energy
harvesting networks. Multiple opportunities and challenges arise in such a 5G
architecture because these technologies benefit mutually from each other and
their coexistence introduces several new constraints on the design of
energy-efficient systems. Despite clear evidence that hybrid MM systems can
achieve significantly higher EE gains than conventional MM systems, several
open research problems continue to roadblock system designers from fully
harnessing the EE gains offered by hybrid MM systems. Our discussions lead to
the conclusion that hybrid MM systems offer a sustainable evolution towards 5G
networks and are therefore an important research topic for future work.
","[{'version': 'v1', 'created': 'Fri, 27 Nov 2015 14:45:14 GMT'}]",2015-11-30,"[['Prasad', 'K. N. R. Surya Vara', ''], ['Hossain', 'Ekram', ''], ['Bhargava', 'Vijay K.', '']]","['5G networks', 'massive MIMO', 'energy efficiency', 'millimeter wave', 'heterogeneous networks', 'energy harvesting']"
15777,1502.04354,Palash Dey,Arnab Bhattacharyya and Palash Dey,Sample Complexity for Winner Prediction in Elections,Accepted in AAMAS 2015,,,,cs.DS cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predicting the winner of an election is a favorite problem both for news
media pundits and computational social choice theorists. Since it is often
infeasible to elicit the preferences of all the voters in a typical prediction
scenario, a common algorithm used for winner prediction is to run the election
on a small sample of randomly chosen votes and output the winner as the
prediction. We analyze the performance of this algorithm for many common voting
rules.
  More formally, we introduce the $(\epsilon, \delta)$-winner determination
problem, where given an election on $n$ voters and $m$ candidates in which the
margin of victory is at least $\epsilon n$ votes, the goal is to determine the
winner with probability at least $1-\delta$. The margin of victory of an
election is the smallest number of votes that need to be modified in order to
change the election winner. We show interesting lower and upper bounds on the
number of samples needed to solve the $(\epsilon, \delta)$-winner determination
problem for many common voting rules, including scoring rules, approval,
maximin, Copeland, Bucklin, plurality with runoff, and single transferable
vote. Moreover, the lower and upper bounds match for many common voting rules
in a wide range of practically appealing scenarios.
","[{'version': 'v1', 'created': 'Sun, 15 Feb 2015 19:54:47 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Feb 2015 16:26:35 GMT'}, {'version': 'v3', 'created': 'Wed, 20 Apr 2016 06:06:19 GMT'}]",2016-04-21,"[['Bhattacharyya', 'Arnab', ''], ['Dey', 'Palash', '']]","['Computational social choice', 'winner determination', 'voting', 'sampling', 'prediction', 'polling']"
15778,1501.01868,Samia Dardouri,Samia Dardouri and Ridha Bouallegue,Performance Analysis Of Resource Scheduling In LTE Femtocells Networks,"11 pages, 9 figures, 3 tables, The Sixth International Conference on
  Networks & Communications (NETCOM - 2014)",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  3GPP has introduced LTE Femtocells to manipulate the traffic for indoor users
and to minimize the charge on the Macro cells. A key mechanism in the LTE
traffic handling is the packet scheduler which is in charge of allocating
resources to active flows in both the frequency and time dimension. So several
scheduling algorithms need to be analyzed for femtocells networks. In this
paper we introduce a performance analysis of three distinct scheduling
algorithms of mixed type of traffic flows in LTE femtocells networks. The
particularly study is evaluated in terms of throughput, packet loss ratio,
fairness index and spectral efficiency
","[{'version': 'v1', 'created': 'Thu, 8 Jan 2015 14:33:02 GMT'}]",2015-01-09,"[['Dardouri', 'Samia', ''], ['Bouallegue', 'Ridha', '']]","['Femtocells', 'Macrocells', 'LTE', 'Resource Scheduling', 'Performance Analysis']"
15779,1505.02505,Lihua Guo,Guo Lihua and Guo Chenggan,"A Two-Layer Local Constrained Sparse Coding Method for Fine-Grained
  Visual Categorization","19 pages, 12 figures, 8 tables",,,,cs.CV,http://creativecommons.org/licenses/by/3.0/,"  Fine-grained categories are more difficulty distinguished than generic
categories due to the similarity of inter-class and the diversity of
intra-class. Therefore, the fine-grained visual categorization (FGVC) is
considered as one of challenge problems in computer vision recently. A new
feature learning framework, which is based on a two-layer local constrained
sparse coding architecture, is proposed in this paper. The two-layer
architecture is introduced for learning intermediate-level features, and the
local constrained term is applied to guarantee the local smooth of coding
coefficients. For extracting more discriminative information, local orientation
histograms are the input of sparse coding instead of raw pixels. Moreover, a
quick dictionary updating process is derived to further improve the training
speed. Two experimental results show that our method achieves 85.29% accuracy
on the Oxford 102 flowers dataset and 67.8% accuracy on the CUB-200-2011 bird
dataset, and the performance of our framework is highly competitive with
existing literatures.
","[{'version': 'v1', 'created': 'Mon, 11 May 2015 07:34:35 GMT'}]",2015-05-12,"[['Lihua', 'Guo', ''], ['Chenggan', 'Guo', '']]","['Fine-grained visual categorization', 'sparse coding', 'pose alignment']"
15780,1607.04267,Mario Mastriani,Mario Mastriani,Enhanced Boolean Correlation Matrix Memory,"4 pages, 4 figures",,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces an Enhanced Boolean version of the Correlation Matrix
Memory (CMM), which is useful to work with binary memories. A novel Boolean
Orthonormalization Process (BOP) is presented to convert a non-orthonormal
Boolean basis, i.e., a set of non-orthonormal binary vectors (in a Boolean
sense) to an orthonormal Boolean basis, i.e., a set of orthonormal binary
vectors (in a Boolean sense). This work shows that it is possible to improve
the performance of Boolean CMM thanks BOP algorithm. Besides, the BOP algorithm
has a lot of additional fields of applications, e.g.: Steganography, Hopfield
Networks, Bi-level image processing, etc. Finally, it is important to mention
that the BOP is an extremely stable and fast algorithm.
","[{'version': 'v1', 'created': 'Mon, 11 Jul 2016 16:22:47 GMT'}]",2016-07-15,"[['Mastriani', 'Mario', '']]","['Boolean algebra', 'correlation matrix memory', 'orthogonalization']"
15781,1106.5304,Florin Pop Mr.,"George Milescu, Gabriel Noaje, Florin Pop",OpenPh - Numerical Physics Library,(ISSN 1223-7027),"UPB Scientific Bulletin, Series A: Applied Mathematics and
  Physics, volume 68, number 1, pp: 73-78, 2006",,,cs.DL physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Numerical physics has gained a lot of importance in the last decade, its
efficiency being motivated and sustained by the growth of computational power.
This paper presents a concept that is to be developed in the next few years:
OpenPh. OpenPh is a numerical physics library that makes use of the advantages
of both open source software and MATLAB programming. Its aim is to deliver the
instruments for providing numerical and graphical solutions for various physics
problems. It has a modular structure, allowing the user to add new modules to
the existing ones and to create its own modules according to its needs, being
virtually unlimited extendable. The modules of OpenPh are implemented using
MATLAB engine because it is the best solution used in engineering and science,
providing a wide range of optimized methods to accomplish even the toughest
jobs. Current version of OpenPh includes two modules, the first one providing
tools for quantum physics and the second one for mechanics. The quantum physics
module deals with the photoelectric effect, the radioactive decay of carbon-11,
and the Schr\""odinger equation - particle in a box. The classical mechanics
module includes the study of the uniform circular motion, the forced damped
harmonic oscillations and the vibration of a fixed-fixed string.
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2011 06:03:50 GMT'}]",2011-06-28,"[['Milescu', 'George', ''], ['Noaje', 'Gabriel', ''], ['Pop', 'Florin', '']]","['numerical physics', 'MATLAB', 'quantum physics', 'classical mechanics', 'module', 'photoelectric effect', 'Schrödinger equation', 'vibration of a string']"
15782,0906.2274,D\v{z}enan Zuki\'c,"D\v{z}enan Zuki\'c, Christof Rezk-Salama, Andreas Kolb",A Neural Network Classifier of Volume Datasets,"10 pages, 10 figures, 1 table, 3IA conference http://3ia.teiath.gr/","International Conference on Computer Graphics and Artificial
  Intelligence, Proceedings (2009) 53-62",,,cs.GR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many state-of-the art visualization techniques must be tailored to the
specific type of dataset, its modality (CT, MRI, etc.), the recorded object or
anatomical region (head, spine, abdomen, etc.) and other parameters related to
the data acquisition process. While parts of the information (imaging modality
and acquisition sequence) may be obtained from the meta-data stored with the
volume scan, there is important information which is not stored explicitly
(anatomical region, tracing compound). Also, meta-data might be incomplete,
inappropriate or simply missing.
  This paper presents a novel and simple method of determining the type of
dataset from previously defined categories. 2D histograms based on intensity
and gradient magnitude of datasets are used as input to a neural network, which
classifies it into one of several categories it was trained with. The proposed
method is an important building block for visualization systems to be used
autonomously by non-experts. The method has been tested on 80 datasets, divided
into 3 classes and a ""rest"" class.
  A significant result is the ability of the system to classify datasets into a
specific class after being trained with only one dataset of that class. Other
advantages of the method are its easy implementation and its high computational
performance.
","[{'version': 'v1', 'created': 'Fri, 12 Jun 2009 11:17:05 GMT'}]",2009-06-15,"[['Zukić', 'Dženan', ''], ['Rezk-Salama', 'Christof', ''], ['Kolb', 'Andreas', '']]","['volume visualization', '3D datasets', '2D histograms', 'neural networks', 'classification']"
15783,1309.7955,Rafael C. S. Schouery,Cristina G. Fernandes and Rafael C. S. Schouery,Approximation Algorithms for the Max-Buying Problem with Limited Supply,,,,,cs.GT cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the Max-Buying Problem with Limited Supply, in which there are
$n$ items, with $C_i$ copies of each item $i$, and $m$ bidders such that every
bidder $b$ has valuation $v_{ib}$ for item $i$. The goal is to find a pricing
$p$ and an allocation of items to bidders that maximizes the profit, where
every item is allocated to at most $C_i$ bidders, every bidder receives at most
one item and if a bidder $b$ receives item $i$ then $p_i \leq v_{ib}$. Briest
and Krysta presented a 2-approximation for this problem and Aggarwal et al.
presented a 4-approximation for the Price Ladder variant where the pricing must
be non-increasing (that is, $p_1 \geq p_2 \geq \cdots \geq p_n$). We present an
$e/(e-1)$-approximation for the Max-Buying Problem with Limited Supply and, for
every $\varepsilon > 0$, a $(2+\varepsilon)$-approximation for the Price Ladder
variant.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2013 18:45:23 GMT'}]",2013-10-01,"[['Fernandes', 'Cristina G.', ''], ['Schouery', 'Rafael C. S.', '']]","['pricing problem', 'unit-demand auctions', 'approximation algorithms']"
15784,1003.1509,Rdv Ijcsis,"P. Babu, A. Krishnan","A New Variable Threshold and Dynamic Step Size Based Active Noise
  Control System for Improving Performance","Pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS, Vol. 7 No. 2, February 2010, USA. ISSN 1947
  5500, http://sites.google.com/site/ijcsis/",,,,cs.OH cs.SD,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Several approaches have been introduced in literature for active noise
control (ANC) systems. Since FxLMS algorithm appears to be the best choice as a
controller filter, researchers tend to improve performance of ANC systems by
enhancing and modifying this algorithm. In this paper, modification is done in
the existing FxLMS algorithm that provides a new structure for improving the
tracking performance and convergence rate. The secondary signal y(n) is dynamic
thresholded by Wavelet transform to improve tracking. The convergence rate is
improved by dynamically varying the step size of the error signal.
","[{'version': 'v1', 'created': 'Sun, 7 Mar 2010 18:18:46 GMT'}]",2010-04-28,"[['Babu', 'P.', ''], ['Krishnan', 'A.', '']]","['active noise control', 'FxLMS algorithm', 'wavelet transform', 'dynamic threshold', 'dynamic step size']"
15785,1606.05490,Marvin Triebel,"Marvin Triebel and Jan S\""urmeli",Homogeneous Equations of Algebraic Petri Nets,Preprint of Paper accepted for CONCUR 2016 including full proofs,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Algebraic Petri nets are a formalism for modeling distributed systems and
algorithms, describing control and data flow by combining Petri nets and
algebraic specification. One way to specify correctness of an algebraic Petri
net model $N$ is to specify a linear equation $E$ over the places of $N$ based
on term substitution, and coefficients from an abelian group $G$. Then, $E$ is
valid in $N$ iff $E$ is valid in each reachable marking of $N$ . Due to the
expressive power of Algebraic Petri nets, validity is generally undecidable.
Stable linear equations form a class of linear equations for which validity is
decidable. Place invariants yield a well-understood but incomplete
characterization of all stable linear equations. In this paper, we provide a
complete characterization of stability for the subclass of homogeneous linear
equations, by restricting ourselves to the interpretation of terms over the
Herbrand structure without considering further equality axioms. Based thereon,
we show that stability is decidable for homogeneous linear equations if $G$ is
a cyclic group.
","[{'version': 'v1', 'created': 'Fri, 17 Jun 2016 11:51:08 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Jun 2016 14:45:34 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Jun 2016 07:53:23 GMT'}]",2016-06-23,"[['Triebel', 'Marvin', ''], ['Sürmeli', 'Jan', '']]","['Algebraic Petri Nets', 'Invariants', 'Linear Equations', 'Validity', 'Stability']"
15786,1306.6737,Minati Mishra,"Minati Mishra, Flt. Lt. Dr. M. C. Adhikary",Digital Image Tamper Detection Techniques - A Comprehensive Study,"12 pages available online via
  http://ijcsbi.org/index.php/ijcsbi/article/view/50","IJCSBI Vol. 2, No. 1. June 2013",,,cs.CR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Photographs are considered to be the most powerful and trustworthy media of
expression. For a long time, those were accepted as proves of evidences in
varied fields such as journalism, forensic investigations, military
intelligence, scientific research and publications, crime detection and legal
proceedings, investigation of insurance claims, medical imaging etc. Today,
digital images have completely replaced the conventional photographs from every
sphere of life but unfortunately, they seldom enjoy the credibility of their
conventional counterparts, thanks to the rapid advancements in the field of
digital image processing. The increasing availability of low cost and sometimes
free of cost image editing software such as Photoshop, Corel Paint Shop,
Photoscape, PhotoPlus, GIMP and Pixelmator have made the tampering of digital
images even more easier and a common practice. Now it has become quite
impossible to say whether a photograph is a genuine camera output or a
manipulated version of it just by looking at it. As a result, photographs have
almost lost their reliability and place as proves of evidences in all fields.
This is why digital image tamper detection has emerged as an important research
area to establish the authenticity of digital photographs by separating the
tampered lots from the original ones. This paper gives a brief history of image
tampering and a state-of-the-art review of the tamper detection techniques.
","[{'version': 'v1', 'created': 'Fri, 28 Jun 2013 07:22:20 GMT'}]",2013-07-01,"[['Mishra', 'Minati', ''], ['Adhikary', 'Flt. Lt. Dr. M. C.', '']]","['Digital Image', 'Tampering', 'Splicing', 'Cloning', 'Steganography', 'Watermarking']"
15787,1610.01476,Dominik Meyer,"Dominik Meyer, Hao Shen, Klaus Diepold",$\ell_1$ Regularized Gradient Temporal-Difference Learning,,,,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the Temporal Difference (TD) learning with linear
value function approximation. It is well known that most TD learning algorithms
are unstable with linear function approximation and off-policy learning. Recent
development of Gradient TD (GTD) algorithms has addressed this problem
successfully. However, the success of GTD algorithms requires a set of well
chosen features, which are not always available. When the number of features is
huge, the GTD algorithms might face the problem of overfitting and being
computationally expensive. To cope with this difficulty, regularization
techniques, in particular $\ell_1$ regularization, have attracted significant
attentions in developing TD learning algorithms. The present work combines the
GTD algorithms with $\ell_1$ regularization. We propose a family of $\ell_1$
regularized GTD algorithms, which employ the well known soft thresholding
operator. We investigate convergence properties of the proposed algorithms, and
depict their performance with several numerical experiments.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2016 15:15:27 GMT'}]",2016-10-06,"[['Meyer', 'Dominik', ''], ['Shen', 'Hao', ''], ['Diepold', 'Klaus', '']]","['Reinforcement Learning (RL)', 'linear function approximation', 'Gradient TemporalDifference (GTD) learning', 'Iterative Soft Thresholding (IST)']"
15788,1507.01231,Dmitry Kosolobov,Dmitry Kosolobov,Computing Runs on a General Alphabet,"4 pages, 2 figures",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a RAM algorithm computing all runs (maximal repetitions) of a
given string of length $n$ over a general ordered alphabet in
$O(n\log^{\frac{2}3} n)$ time and linear space. Our algorithm outperforms all
known solutions working in $\Theta(n\log\sigma)$ time provided $\sigma =
n^{\Omega(1)}$, where $\sigma$ is the alphabet size. We conjecture that there
exists a linear time RAM algorithm finding all runs.
","[{'version': 'v1', 'created': 'Sun, 5 Jul 2015 15:42:02 GMT'}, {'version': 'v2', 'created': 'Sun, 22 Nov 2015 19:57:52 GMT'}]",2015-11-24,"[['Kosolobov', 'Dmitry', '']]","['runs', 'general alphabet', 'maximal repetitions', 'linear time', 'repetitions']"
15789,0801.0390,Richard Nock,"Richard Nock, Nicolas Sanz, Fred Celimene, Frank Nielsen",Staring at Economic Aggregators through Information Lenses,"18 pages, 2 tables, 3 figures",,,,cs.IT cs.LG math.IT math.OC,,"  It is hard to exaggerate the role of economic aggregators -- functions that
summarize numerous and / or heterogeneous data -- in economic models since the
early XX$^{th}$ century. In many cases, as witnessed by the pioneering works of
Cobb and Douglas, these functions were information quantities tailored to
economic theories, i.e. they were built to fit economic phenomena. In this
paper, we look at these functions from the complementary side: information. We
use a recent toolbox built on top of a vast class of distortions coined by
Bregman, whose application field rivals metrics' in various subfields of
mathematics. This toolbox makes it possible to find the quality of an
aggregator (for consumptions, prices, labor, capital, wages, etc.), from the
standpoint of the information it carries. We prove a rather striking result.
  From the informational standpoint, well-known economic aggregators do belong
to the \textit{optimal} set. As common economic assumptions enter the analysis,
this large set shrinks, and it essentially ends up \textit{exactly fitting}
either CES, or Cobb-Douglas, or both. To summarize, in the relevant economic
contexts, one could not have crafted better some aggregator from the
information standpoint. We also discuss global economic behaviors of optimal
information aggregators in general, and present a brief panorama of the links
between economic and information aggregators.
  Keywords: Economic Aggregators, CES, Cobb-Douglas, Bregman divergences
","[{'version': 'v1', 'created': 'Wed, 2 Jan 2008 13:23:04 GMT'}]",2008-01-03,"[['Nock', 'Richard', ''], ['Sanz', 'Nicolas', ''], ['Celimene', 'Fred', ''], ['Nielsen', 'Frank', '']]","['Economic Aggregators', 'CES', 'Cobb-Douglas', 'Bregman divergences']"
15790,1301.4083,"\c{C}a\u{g}lar G\""ul\c{c}ehre","\c{C}a\u{g}lar G\""ul\c{c}ehre and Yoshua Bengio",Knowledge Matters: Importance of Prior Information for Optimization,"37 Pages, 5 figures, 5 tables JMLR Special Topics on Representation
  Learning Submission",,,,cs.LG cs.CV cs.NE stat.ML,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We explore the effect of introducing prior information into the intermediate
level of neural networks for a learning task on which all the state-of-the-art
machine learning algorithms tested failed to learn. We motivate our work from
the hypothesis that humans learn such intermediate concepts from other
individuals via a form of supervision or guidance using a curriculum. The
experiments we have conducted provide positive evidence in favor of this
hypothesis. In our experiments, a two-tiered MLP architecture is trained on a
dataset with 64x64 binary inputs images, each image with three sprites. The
final task is to decide whether all the sprites are the same or one of them is
different. Sprites are pentomino tetris shapes and they are placed in an image
with different locations using scaling and rotation transformations. The first
part of the two-tiered MLP is pre-trained with intermediate-level targets being
the presence of sprites at each location, while the second part takes the
output of the first part as input and predicts the final task's target binary
event. The two-tiered MLP architecture, with a few tens of thousand examples,
was able to learn the task perfectly, whereas all other algorithms (include
unsupervised pre-training, but also traditional algorithms like SVMs, decision
trees and boosting) all perform no better than chance. We hypothesize that the
optimization difficulty involved when the intermediate pre-training is not
performed is due to the {\em composition} of two highly non-linear tasks. Our
findings are also consistent with hypotheses on cultural learning inspired by
the observations of optimization problems with deep learning, presumably
because of effective local minima.
","[{'version': 'v1', 'created': 'Thu, 17 Jan 2013 13:06:52 GMT'}, {'version': 'v2', 'created': 'Sun, 20 Jan 2013 05:43:57 GMT'}, {'version': 'v3', 'created': 'Wed, 30 Jan 2013 17:11:19 GMT'}, {'version': 'v4', 'created': 'Wed, 13 Mar 2013 20:13:08 GMT'}, {'version': 'v5', 'created': 'Fri, 15 Mar 2013 05:41:47 GMT'}, {'version': 'v6', 'created': 'Sat, 13 Jul 2013 16:38:36 GMT'}]",2013-07-16,"[['Gülçehre', 'Çağlar', ''], ['Bengio', 'Yoshua', '']]","['Deep Learning', 'Neural Networks', 'Optimization', 'Evolution of Culture', 'Curriculum Learning', 'Training with Hints']"
15791,1802.08979,Xi Victoria Lin,"Xi Victoria Lin and Chenglong Wang and Luke Zettlemoyer and Michael D.
  Ernst","NL2Bash: A Corpus and Semantic Parser for Natural Language Interface to
  the Linux Operating System","Accepted at the Language Resource and Evaluation Conference (LREC)
  2018",,,,cs.CL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present new data and semantic parsing methods for the problem of mapping
English sentences to Bash commands (NL2Bash). Our long-term goal is to enable
any user to perform operations such as file manipulation, search, and
application-specific scripting by simply stating their goals in English. We
take a first step in this domain, by providing a new dataset of challenging but
commonly used Bash commands and expert-written English descriptions, along with
baseline methods to establish performance levels on this task.
","[{'version': 'v1', 'created': 'Sun, 25 Feb 2018 09:52:24 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Mar 2018 17:46:59 GMT'}]",2018-03-05,"[['Lin', 'Xi Victoria', ''], ['Wang', 'Chenglong', ''], ['Zettlemoyer', 'Luke', ''], ['Ernst', 'Michael D.', '']]","['Natural Language Programming', 'Natural Language Interface', 'Semantic Parsing']"
15792,1409.2388,Bernhard Rumpe,"Markus Look, Antonio Navarro Perez, Jan Oliver Ringert, Bernhard
  Rumpe, Andreas Wortmann","Black-box Integration of Heterogeneous Modeling Languages for
  Cyber-Physical Systems","6 pages, 4 figures. GEMOC Workshop 2013 - International Workshop on
  The Globalization of Modeling Languages, Miami, Florida (USA), Volume 1102 of
  CEUR Workshop Proceedings, CEUR-WS.org, 2013",,,,cs.SE cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robots belong to a class of Cyber-Physical Systems where complex software as
a mobile device has to full tasks in a complex environment. Modeling robotics
applications for analysis and code generation requires modeling languages for
the logical software architecture and the system behavior. The
MontiArcAutomaton modeling framework integrates six independently developed
modeling languages to model robotics applications: a component & connector
architecture description language, automata, I/O tables, class diagrams, OCL,
and a Java DSL. We describe how we integrated these languages into
MontiArcAutomaton a-posteriori in a black-box integration fashion.
","[{'version': 'v1', 'created': 'Mon, 8 Sep 2014 15:02:32 GMT'}]",2014-09-10,"[['Look', 'Markus', ''], ['Perez', 'Antonio Navarro', ''], ['Ringert', 'Jan Oliver', ''], ['Rumpe', 'Bernhard', ''], ['Wortmann', 'Andreas', '']]","['CPS', 'Language Integration', 'Modeling Languages', 'SoftwareArchitecture Modeling']"
15793,1501.01450,Bin Fang,"Bin Fang, Wuyang Zhou","An Effective Handover Analysis for the Randomly Distributed
  Heterogeneous Cellular Networks",20 pages,,,,cs.IT cs.NI math.IT,http://creativecommons.org/licenses/by/3.0/,"  Handover rate is one of the most import metrics to instruct mobility
management and resource management in wireless cellular networks. In the
literature, the mathematical expression of handover rate has been derived for
homogeneous cellular network by both regular hexagon coverage model and
stochastic geometry model, but there has not been any reliable result for
heterogeneous cellular networks (HCNs). Recently, stochastic geometry modeling
has been shown to model well the real deployment of HCNs and has been
extensively used to analyze HCNs. In this paper, we give an effective handover
analysis for HCNs by stochastic geometry modeling, derive the mathematical
expression of handover rate by employing an infinitesimal method for a
generalized multi-tier scenario, discuss the result by deriving some meaningful
corollaries, and validate the analysis by computer simulation with multiple
walking models. By our analysis, we find that in HCNs the handover rate is
related to many factors like the base stations' densities and transmitting
powers, user's velocity distribution, bias factor, pass loss factor and etc.
Although our analysis focuses on the scenario of multi-tier HCNs, the
analytical framework can be easily extended for more complex scenarios, and may
shed some light for future study.
","[{'version': 'v1', 'created': 'Wed, 7 Jan 2015 11:38:27 GMT'}]",2015-01-08,"[['Fang', 'Bin', ''], ['Zhou', 'Wuyang', '']]","['Stochastic geometry modeling', 'handover rates', 'heterogeneous cellular network']"
15794,1011.1547,Ke Xu,"Jichang Zhao, Junjie Wu, Guannan Liu, Ke Xu, Guoqing Chen","Being Rational or Aggressive? A Revisit to Dunbar's Number in Online
  Social Networks",,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent years have witnessed the explosion of online social networks (OSNs).
They provide powerful IT-innovations for online social activities such as
organizing contacts, publishing contents, and sharing interests between friends
who may never meet before. As more and more people become the active users of
online social networks, one may ponder questions such as: (1) Do OSNs indeed
improve our sociability? (2) To what extent can we expand our offline social
spectrum in OSNs? (3) Can we identify some interesting user behaviors in OSNs?
Our work in this paper just aims to answer these interesting questions. To this
end, we pay a revisit to the well-known Dunbar's number in online social
networks. Our main research contributions are as follows. First, to our best
knowledge, our work is the first one that systematically validates the
existence of the online Dunbar's number in the range of [200,300]. To reach
this, we combine using local-structure analysis and user-interaction analysis
for extensive real-world OSNs. Second, we divide OSNs users into two
categories: rational and aggressive, and find that rational users intend to
develop close and reciprocated relationships, whereas aggressive users have no
consistent behaviors. Third, we build a simple model to capture the constraints
of time and cognition that affect the evolution of online social networks.
Finally, we show the potential use of our findings in viral marketing and
privacy management in online social networks.
","[{'version': 'v1', 'created': 'Sat, 6 Nov 2010 09:19:41 GMT'}]",2010-11-09,"[['Zhao', 'Jichang', ''], ['Wu', 'Junjie', ''], ['Liu', 'Guannan', ''], ['Xu', 'Ke', ''], ['Chen', 'Guoqing', '']]","['Online social networks', 'Dunbar’s Number', 'User Behavior', 'Network Evolution Modeling', 'Viral Marketing', 'Privacy']"
15795,1705.05690,Abdelhadi Azzouni,"Abdelhadi Azzouni, Guy Pujolle","A Long Short-Term Memory Recurrent Neural Network Framework for Network
  Traffic Matrix Prediction","Submitted for peer review. arXiv admin note: text overlap with
  arXiv:1402.1128 by other authors",,,,cs.NI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network Traffic Matrix (TM) prediction is defined as the problem of
estimating future network traffic from the previous and achieved network
traffic data. It is widely used in network planning, resource management and
network security. Long Short-Term Memory (LSTM) is a specific recurrent neural
network (RNN) architecture that is well-suited to learn from experience to
classify, process and predict time series with time lags of unknown size. LSTMs
have been shown to model temporal sequences and their long-range dependencies
more accurately than conventional RNNs. In this paper, we propose a LSTM RNN
framework for predicting short and long term Traffic Matrix (TM) in large
networks. By validating our framework on real-world data from GEANT network, we
show that our LSTM models converge quickly and give state of the art TM
prediction performance for relatively small sized models.
","[{'version': 'v1', 'created': 'Tue, 16 May 2017 12:57:24 GMT'}, {'version': 'v2', 'created': 'Sat, 20 May 2017 12:33:10 GMT'}, {'version': 'v3', 'created': 'Thu, 8 Jun 2017 12:31:20 GMT'}]",2017-06-12,"[['Azzouni', 'Abdelhadi', ''], ['Pujolle', 'Guy', '']]","['Traffic Matrix', 'Prediction', 'Neural Networks', 'Long Short-Term Mermory']"
15796,1208.0564,Lena Chekina,"L. Chekina, D. Mimran, L. Rokach, Y. Elovici, B. Shapira",Detection of Deviations in Mobile Applications Network Behavior,"Length of 10 pages, submitted to Annual Computer Security
  Applications Conference, ACSAC'2012",,,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper a novel system for detecting meaningful deviations in a mobile
application's network behavior is proposed. The main goal of the proposed
system is to protect mobile device users and cellular infrastructure companies
from malicious applications. The new system is capable of: (1) identifying
malicious attacks or masquerading applications installed on a mobile device,
and (2) identifying republishing of popular applications injected with a
malicious code. The detection is performed based on the application's network
traffic patterns only. For each application two types of models are learned.
The first model, local, represents the personal traffic pattern for each user
using an application and is learned on the device. The second model,
collaborative, represents traffic patterns of numerous users using an
application and is learned on the system server. Machine-learning methods are
used for learning and detection purposes. This paper focuses on methods
utilized for local (i.e., on mobile device) learning and detection of
deviations from the normal application's behavior. These methods were
implemented and evaluated on Android devices. The evaluation experiments
demonstrate that: (1) various applications have specific network traffic
patterns and certain application categories can be distinguishable by their
network patterns, (2) different levels of deviations from normal behavior can
be detected accurately, and (3) local learning is feasible and has a low
performance overhead on mobile devices.
","[{'version': 'v1', 'created': 'Fri, 27 Jul 2012 21:39:21 GMT'}, {'version': 'v2', 'created': 'Sun, 5 Aug 2012 09:31:22 GMT'}]",2012-08-07,"[['Chekina', 'L.', ''], ['Mimran', 'D.', ''], ['Rokach', 'L.', ''], ['Elovici', 'Y.', ''], ['Shapira', 'B.', '']]","['Mobile applications', 'Network traffic', 'Machine learning', 'Malware', 'Anomaly detection']"
15797,1212.6806,Kristin Glass,"Richard Colbaugh, Kristin Glass, and Travis Bauer",Leveraging Sociological Models for Predictive Analytics,,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is considerable interest in developing techniques for predicting human
behavior, for instance to enable emerging contentious situations to be forecast
or the nature of ongoing but hidden activities to be inferred. A promising
approach to this problem is to identify and collect appropriate empirical data
and then apply machine learning methods to these data to generate the
predictions. This paper shows the performance of such learning algorithms often
can be improved substantially by leveraging sociological models in their
development and implementation. In particular, we demonstrate that
sociologically-grounded learning algorithms outperform gold-standard methods in
three important and challenging tasks: 1.) inferring the (unobserved) nature of
relationships in adversarial social networks, 2.) predicting whether nascent
social diffusion events will go viral, and 3.) anticipating and defending
future actions of opponents in adversarial settings. Significantly, the new
algorithms perform well even when there is limited data available for their
training and execution.
","[{'version': 'v1', 'created': 'Mon, 31 Dec 2012 02:13:16 GMT'}]",2013-01-01,"[['Colbaugh', 'Richard', ''], ['Glass', 'Kristin', ''], ['Bauer', 'Travis', '']]","['predictive analysis', 'sociological models', 'social networks', 'empirical analysis', 'machine learning']"
15798,1705.07956,Mar\'ia Henar Salas-Olmedo,"Juan Carlos Garcia-Palomares, Maria Henar Salas-Olmedo, Borja
  Moya-Gomez, Ana Condeco-Melhorado and Javier Gutierrrez","The pulse of the city through Twitter: relationships between land use
  and spatiotemporal demographics","15 pages, 6 figures",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social network data offer interesting opportunities in urban studies. In this
study, we used Twitter data to analyse city dynamics over the course of the
day. Users of this social network were grouped according to city zone and time
slot in order to analyse the daily dynamics of the city and the relationship
between this and land use. First, daytime activity in each zone was compared
with activity at night in order to determine which zones showed increased
activity in each of the time slots. Then, typical Twitter activity profiles
were obtained based on the predominant land use in each zone, indicating how
land uses linked to activities were activated during the day, but at different
rates depending on the type of land use. Lastly, a multiple regression analysis
was performed to determine the influence of the different land uses on each of
the major time slots (morning, afternoon, evening and night) through their
changing coefficients. Activity tended to decrease throughout the day for most
land uses (e.g. offices, education, health and transport), but remained
constant in parks and increased in retail and residential zones. Our results
show that social network data can be used to improve our understanding of the
link between land use and urban dynamics.
","[{'version': 'v1', 'created': 'Mon, 22 May 2017 19:21:03 GMT'}]",2017-05-24,"[['Garcia-Palomares', 'Juan Carlos', ''], ['Salas-Olmedo', 'Maria Henar', ''], ['Moya-Gomez', 'Borja', ''], ['Condeco-Melhorado', 'Ana', ''], ['Gutierrrez', 'Javier', '']]","['Social media', 'Twitter', 'spatiotemporal demographics', 'land use', 'urban geography']"
15799,1305.6803,Krasimir Yordzhev,Krasimir Yordzhev,"A representation of context-free grammars with the help of finite
  digraphs",4 figures,"American Journal of Applied Mathematics. Vol. 1, No. 1, 2013, pp.
  8-11",,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For any context-free grammar, we build a transition diagram, that is, a
finite directed graph with labeled arcs, which describes the work of the
grammar. This approach is new, and it is different from previously known graph
models. We define the concept of proper walk in this transition diagram and we
prove that a word belongs to a given context-free language if and only if this
word can be obtained with the help of a proper walk.
","[{'version': 'v1', 'created': 'Wed, 29 May 2013 13:56:38 GMT'}]",2013-05-30,"[['Yordzhev', 'Krasimir', '']]","['Context-free grammar', 'Finite digraph', 'Transition diagram', 'Proper walk', 'Chomsky normal form']"
15800,1504.07713,Oualid El-Halimi,"Oualid El Halimi and Trith Patel and Zohaib S. Kiyani and Naresh.
  Kumar and Ankit Singh",Comparative Stability of Cloned and Non-cloned Code: A Replication Study,"10 pages, 11 Tables, 3 figures",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Code cloning is an important software engineering aspect. It is a common
software reuse principle that consists of duplicating source code within a
program or across different systems owned or maintained by the same entity.
There are several contradictory claims concerning the impact of cloning on
software stability and maintenance effort. Some papers state that cloning is
desired since it speeds up the development process and helps stakeholders meet
the tight schedule and deliver on time. Other papers argue that code clone
leads to code bloat and causes increase software maintenance costs due to
copied defects and dead code. In this paper, we are replicating a previous
study done on cloning by the original author. We are repeating his work using
the same methods and metrics but with different subjects and experimenters. The
paper we are addressing evaluates the impact of code cloning on code stability
using three different stability-measuring methods. Our team will apply the same
stability measurement techniques on a different software system developed in C
programming language to determine generalizability, assure that the results are
reliable, validate their outcomes, and to inspire new search by combining
previous findings from related studies.
","[{'version': 'v1', 'created': 'Wed, 29 Apr 2015 03:35:19 GMT'}]",2015-04-30,"[['Halimi', 'Oualid El', ''], ['Patel', 'Trith', ''], ['Kiyani', 'Zohaib S.', ''], ['Kumar', 'Naresh.', ''], ['Singh', 'Ankit', '']]","['Code Cloning', 'Code Stability', 'Modification']"
15801,1205.4883,Gang Liao,"Gang Liao, Lian Luo, Lei Liu",Hybrid Parallel Bidirectional Sieve based on SMP Cluster,"11 pages,7 figures",,,,cs.DC,http://creativecommons.org/licenses/by/3.0/,"  In this article, hybrid parallel bidirectional sieve method is implemented by
SMP Cluster, the individual computational units joined together by the
communication network, are usually shared-memory systems with one or more
multicore processor. To high-efficiency optimization, we propose average divide
data into nodes, generating double-ended queues (deque) for sieve method that
are able to exploit dual-cores simultaneously start sifting out primes from the
head and tail.And each node create a FIFO queue as dynamic data buffer to ache
temporary data from another nodes send to. The approach obtains huge speedup
and efficiency on SMP Cluster.
","[{'version': 'v1', 'created': 'Tue, 22 May 2012 11:27:10 GMT'}]",2012-05-23,"[['Liao', 'Gang', ''], ['Luo', 'Lian', ''], ['Liu', 'Lei', '']]","['hybrid parallel', 'HPC', 'SMP Cluster', 'sieve']"
15802,1208.1860,Benjamin Rubinstein,"Sahand Negahban, Benjamin I. P. Rubinstein and Jim Gemmell","Scaling Multiple-Source Entity Resolution using Statistically Efficient
  Transfer Learning","Short version to appear in CIKM'2012; 10 pages, 7 figures",,,,cs.DB cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a serious, previously-unexplored challenge facing almost all
approaches to scaling up entity resolution (ER) to multiple data sources: the
prohibitive cost of labeling training data for supervised learning of
similarity scores for each pair of sources. While there exists a rich
literature describing almost all aspects of pairwise ER, this new challenge is
arising now due to the unprecedented ability to acquire and store data from
online sources, features driven by ER such as enriched search verticals, and
the uniqueness of noisy and missing data characteristics for each source. We
show on real-world and synthetic data that for state-of-the-art techniques, the
reality of heterogeneous sources means that the number of labeled training data
must scale quadratically in the number of sources, just to maintain constant
precision/recall. We address this challenge with a brand new transfer learning
algorithm which requires far less training data (or equivalently, achieves
superior accuracy with the same data) and is trained using fast convex
optimization. The intuition behind our approach is to adaptively share
structure learned about one scoring problem with all other scoring problems
sharing a data source in common. We demonstrate that our theoretically
motivated approach incurs no runtime cost while it can maintain constant
precision/recall with the cost of labeling increasing only linearly with the
number of sources.
","[{'version': 'v1', 'created': 'Thu, 9 Aug 2012 10:02:35 GMT'}]",2012-08-10,"[['Negahban', 'Sahand', ''], ['Rubinstein', 'Benjamin I. P.', ''], ['Gemmell', 'Jim', '']]","['Entity resolution', 'deduplication', 'record linkage', 'data integration', 'transfer learning', 'multi-task learning', 'convex optimization']"
15803,1412.6018,Rachada Kongkachandra Asst.Prof.Dr.,"Sirisak Visessenee, Sanparith Marukatat, and Rachada Kongkachandra","Automatic Training Data Synthesis for Handwriting Recognition Using the
  Structural Crossing-Over Technique","8 pages, 6 figures","International Journal of Artificial Intelligence & Applications
  (IJAIA), Vol. 5, No. 5, September 2014",,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents a novel technique called ""Structural Crossing-Over"" to
synthesize qualified data for training machine learning-based handwriting
recognition. The proposed technique can provide a greater variety of patterns
of training data than the existing approaches such as elastic distortion and
tangent-based affine transformation. A couple of training characters are
chosen, then they are analyzed by their similar and different structures, and
finally are crossed over to generate the new characters. The experiments are
set to compare the performances of tangent-based affine transformation and the
proposed approach in terms of the variety of generated characters and percent
of recognition errors. The standard MNIST corpus including 60,000 training
characters and 10,000 test characters is employed in the experiments. The
proposed technique uses 1,000 characters to synthesize 60,000 characters, and
then uses these data to train and test the benchmark handwriting recognition
system that exploits Histogram of Gradient (HOG) as features and Support Vector
Machine (SVM) as recognizer. The experimental result yields 8.06% of errors. It
significantly outperforms the tangent-based affine transformation and the
original MNIST training data, which are 11.74% and 16.55%, respectively.
","[{'version': 'v1', 'created': 'Thu, 9 Oct 2014 04:32:20 GMT'}]",2014-12-19,"[['Visessenee', 'Sirisak', ''], ['Marukatat', 'Sanparith', ''], ['Kongkachandra', 'Rachada', '']]","['Distortion', 'Handwriting Recognition', 'Structural Crossing-Over Technique', 'Support Vector Machine', 'Training Data Synthesis']"
15804,1504.07680,Jana Dunfield,Jana Dunfield,Elaborating Evaluation-Order Polymorphism,"13 pages + appendix; in International Conference on Functional
  Programming (ICFP) 2015. arXiv version 3 makes corrections to Figure 5 and
  Section 2.4, preserving page breaks",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We classify programming languages according to evaluation order: each
language fixes one evaluation order as the default, making it transparent to
program in that evaluation order, and troublesome to program in the other.
  This paper develops a type system that is impartial with respect to
evaluation order. Evaluation order is implicit in terms, and explicit in types,
with by-value and by-name versions of type connectives. A form of intersection
type quantifies over evaluation orders, describing code that is agnostic over
(that is, polymorphic in) evaluation order. By allowing such generic code,
programs can express the by-value and by-name versions of a computation without
code duplication.
  We also formulate a type system that only has by-value connectives, plus a
type that generalizes the difference between by-value and by-name connectives:
it is either a suspension (by name) or a ""no-op"" (by value). We show a
straightforward encoding of the impartial type system into the more economical
one. Then we define an elaboration from the economical language to a
call-by-value semantics, and prove that elaborating a well-typed source
program, where evaluation order is implicit, produces a well-typed target
program where evaluation order is explicit. We also prove a simulation between
evaluation of the target program and reductions (either by-value or by-name) in
the source program.
  Finally, we prove that typing, elaboration, and evaluation are faithful to
the type annotations given in the source program: if the programmer only writes
by-value types, no by-name reductions can occur at run time.
","[{'version': 'v1', 'created': 'Tue, 28 Apr 2015 22:50:15 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Jun 2015 00:35:16 GMT'}, {'version': 'v3', 'created': 'Fri, 11 Sep 2015 23:17:21 GMT'}, {'version': 'v4', 'created': 'Sat, 22 Aug 2020 18:49:37 GMT'}]",2020-08-25,"[['Dunfield', 'Jana', '']]","['evaluation order', 'intersection types', 'polymorphism']"
15805,1609.05296,Avinash Singh,"Avinash Kumar Singh, Piyush Joshi, G C Nandi","Development of a Fuzzy Expert System based Liveliness Detection Scheme
  for Biometric Authentication",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Liveliness detection acts as a safe guard against spoofing attacks. Most of
the researchers used vision based techniques to detect liveliness of the user,
but they are highly sensitive to illumination effects. Therefore it is very
hard to design a system, which will work robustly under all circumstances.
Literature shows that most of the research utilize eye blink or mouth movement
to detect the liveliness, while the other group used face texture to
distinguish between real and imposter. The classification results of all these
approaches decreases drastically in variable light conditions. Hence in this
paper we are introducing fuzzy expert system which is sufficient enough to
handle most of the cases comes in real time. We have used two testing
parameters, (a) under bad illumination and (b) less movement in eyes and mouth
in case of real user to evaluate the performance of the system. The system is
behaving well in all, while in first case its False Rejection Rate (FRR) is
0.28, and in second case its FRR is 0.4.
","[{'version': 'v1', 'created': 'Sat, 17 Sep 2016 08:35:54 GMT'}]",2016-09-20,"[['Singh', 'Avinash Kumar', ''], ['Joshi', 'Piyush', ''], ['Nandi', 'G C', '']]","['Face Spoofing', 'Face Recognition', 'Fuzzy Expert System', 'Liveliness Detection', 'Local Binary Pattern', 'Scale Invariant Feature Transformation']"
15806,1705.05271,R. A. J. van Elburg,Ronald A.J. van Elburg and Tjeerd C. Andringa,"Texture features for the reproduction of the perceptual organization of
  sound","20 pages, 6 figures. The underlying code is made available under the
  Apache License, Version 2.0 as an open source repository through GitHub:
  https://github.com/soundappraisal/libsoundannotator. Documented code examples
  are available through GitHub licensed under the same Apache License, Version
  2.0: https://github.com/soundappraisal/soundannotatordemo",,,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human categorization of sound seems predominantly based on sound source
properties. To estimate these source properties we propose a novel sound
analysis method, which separates sound into different sonic textures: tones,
pulses, and broadband noises. The audible presence of tones or pulses
corresponds to more extended cochleagram patterns than can be expected on the
basis of correlations introduced by the gammachirp filterbank alone. We design
tract features to respond to these extended patterns, and use these to identify
areas of the time-frequency plane as tonal, pulsal, and noisy. Where an area is
marked as noisy if it is neither tonal nor pulsal. To investigate whether a
similar separation indeed underlies human perceptual organization we introduce
tract based descriptors: tonality, pulsality, and noisiness. These descriptors
keep track of either the total energy or the cochleagram area marked as
respectively tonal, pulsal, and noisy. Energy based tonality and pulsality is
strongly correlated with the first perceptual dimension of human subjects,
while energy based noisiness correlates moderately with the second perceptual
dimension. We conclude that harmonic, impact and continuous process sounds can
be largely separated with energy based tonality, pulsality and noisiness.
","[{'version': 'v1', 'created': 'Mon, 15 May 2017 14:41:49 GMT'}]",2017-05-16,"[['van Elburg', 'Ronald A. J.', ''], ['Andringa', 'Tjeerd C.', '']]","['Sound Perception', 'Computational Auditory Scene Analysis', 'Sound Texture', 'source properties', 'time-frequency analysis']"
15807,1107.4496,Damien Chablat,"Anatoly Pashkevich (IRCCyN), Alexandr Klimchik (IRCCyN), St\'ephane
  Caro (IRCCyN), Damien Chablat (IRCCyN)","Cartesian stiffness matrix of manipulators with passive joints:
  analytical approach","IEEE/RSJ International Conference on Intelligent Robots and Systems,
  San Franisco : United States (2011)",,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper focuses on stiffness matrix computation for manipulators with
passive joints. It proposes both explicit analytical expressions and an
efficient recursive procedure that are applicable in general case and allow
obtaining the desired matrix either in analytical or numerical form. Advantages
of the developed technique and its ability to produce both singular and
non-singular stiffness matrices are illustrated by application examples that
deal with stiffness modeling of two Stewart-Gough platforms.
","[{'version': 'v1', 'created': 'Fri, 22 Jul 2011 12:38:32 GMT'}]",2011-07-25,"[['Pashkevich', 'Anatoly', '', 'IRCCyN'], ['Klimchik', 'Alexandr', '', 'IRCCyN'], ['Caro', 'Stéphane', '', 'IRCCyN'], ['Chablat', 'Damien', '', 'IRCCyN']]","['stiffness modeling', 'parallel manipulators', 'passive']"
15808,1111.1373,Jason Spencer,Jason Spencer,"Speculative Parallel Evaluation Of Classification Trees On GPGPU Compute
  Engines","14 pages, 4 figures, 5 algorithms",,,,cs.DC cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We examine the problem of optimizing classification tree evaluation for
on-line and real-time applications by using GPUs. Looking at trees with
continuous attributes often used in image segmentation, we first put the
existing algorithms for serial and data-parallel evaluation on solid footings.
We then introduce a speculative parallel algorithm designed for single
instruction, multiple data (SIMD) architectures commonly found in GPUs. A
theoretical analysis shows how the run times of data and speculative
decompositions compare assuming independent processors. To compare the
algorithms in the SIMD environment, we implement both on a CUDA 2.0
architecture machine and compare timings to a serial CPU implementation.
Various optimizations and their effects are discussed, and results are given
for all algorithms. Our specific tests show a speculative algorithm improves
run time by 25% compared to a data decomposition.
","[{'version': 'v1', 'created': 'Sun, 6 Nov 2011 04:49:31 GMT'}]",2011-11-08,"[['Spencer', 'Jason', '']]","['Classification Trees', 'Decision Tree Evaluation', 'Parallel Algorithms', 'GPU Computing', 'Speculative Decomposition', 'Optimization', 'Image Segmentation']"
15809,1603.01367,Evangelos Karapanos,"Davide Neves, Donovan Costa, Marcio Oliveira, Ruben Jardim, Ruben
  Gouveia, Evangelos Karapanos","Motivating Healthy Water Intake through Prompting, Historical
  Information, and Implicit Feedback","In Adjunct Proceedings of Persuasive Technology 2016, Salzburg,
  Austria",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe Hydroprompt, a prototype for sensing and motivating healthy water
intake in work environments. In a 3-week field deployment of Hydroprompt, we
evaluate the effectiveness of three approaches to behavior change: historical
information enabling users to compare their water intake lev- els across
different times of day and days of week, implicit feedback providing subtle
cues to users on the current hydration levels, and explicit prompting at-
tempting to remind participants when hydration falls below acceptable levels or
when substantial amount of time has elapsed since the last sip.
","[{'version': 'v1', 'created': 'Fri, 4 Mar 2016 07:40:58 GMT'}]",2016-03-07,"[['Neves', 'Davide', ''], ['Costa', 'Donovan', ''], ['Oliveira', 'Marcio', ''], ['Jardim', 'Ruben', ''], ['Gouveia', 'Ruben', ''], ['Karapanos', 'Evangelos', '']]","['Behavior change technologies', 'water intake', 'longitudinal study']"
15810,1410.4972,Dimitrios Kallergis,"Dimitrios N. Kallergis, Ioannis E. Foukarakis, George N. Prezerakos",Design issues for distributed mobile social networks,"6 pages, eRA 5th International Scientific Conference, September 15-18
  2010, Piraeus, Greece",,,,cs.SI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Social networks and their applications have become extremely popular during
the last years, mostly targeting users via the web. However, it has been
recently observed an interest to offer social network services to mobile users.
Telecom operators attempt to integrate existing social networks to their
systems or develop new ones, in order to offer new services to their
subscribers. Subsequently, emphasis is given to the user-context modeling, as
well as to the integration of sources that leads to the summarized collection
of information anchored to the user; such as its location or its mobile device
type, etc.
  In this paper we discuss the most important factors and challenges
encountered during the design of such a system on architectural, technological
and tool level.
","[{'version': 'v1', 'created': 'Sat, 18 Oct 2014 15:27:53 GMT'}]",2014-10-21,"[['Kallergis', 'Dimitrios N.', ''], ['Foukarakis', 'Ioannis E.', ''], ['Prezerakos', 'George N.', '']]","['user context', 'distributed social-networking', 'context-aware platform', 'social graphs', 'mobile networks']"
15811,1307.3080,Erez Kantor,Erez Kantor and Shay Kutten,"Optimal competitiveness for Symmetric Rectilinear Steiner Arborescence
  and related problems",,,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present optimal competitive algorithms for two interrelated known problems
involving Steiner Arborescence. One is the continuous problem of the Symmetric
Rectilinear Steiner Arborescence (SRSA), studied by Berman and Coulston.
  A very related, but discrete problem (studied separately in the past) is the
online Multimedia Content Delivery (MCD) problem on line networks, presented
originally by Papadimitriu, Ramanathan, and Rangan. An efficient content
delivery was modeled as a low cost Steiner arborescence in a grid of
network*time they defined. We study here the version studied by Charikar,
Halperin, and Motwani (who used the same problem definitions, but removed some
constraints on the inputs).
  The bounds on the competitive ratios introduced separately in the above
papers are similar for the two problems: O(log N) for the continuous problem
and O(log n) for the network problem, where N was the number of terminals to
serve, and n was the size of the network. The lower bounds were Omega(sqrt{log
N}) and Omega(sqrt{log n}) correspondingly. Berman and Coulston conjectured
that both the upper bound and the lower bound could be improved.
  We disprove this conjecture and close these quadratic gaps for both problems.
We first present an O(sqrt{log n}) deterministic competitive algorithm for MCD
on the line, matching the lower bound. We then translate this algorithm to
become a competitive optimal algorithm O(sqrt{log N}) for SRSA. Finally, we
translate the latter back to solve MCD problem, this time competitive optimally
even in the case that the number of requests is small (that is, O(min{sqrt{log
n},sqrt{log N}})). We also present a Omega(sqrt[3]{log n}) lower bound on the
competitiveness of any randomized algorithm. Some of the techniques may be
useful in other contexts.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2013 12:02:18 GMT'}]",2013-07-12,"[['Kantor', 'Erez', ''], ['Kutten', 'Shay', '']]","['Online Algorithm', 'Approximation Algorithm', 'Video-on-Demand']"
15812,1604.08377,Fariz Darari,"Fariz Darari, Simon Razniewski, Radityo Eko Prasojo, Werner Nutt",Enabling Fine-grained RDF Data Completeness Assessment,"This is a preprint version of a paper published in the Proceedings of
  the 16th International Conference on Web Engineering (ICWE 2016)",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, more and more RDF data is becoming available on the Semantic Web.
While the Semantic Web is generally incomplete by nature, on certain topics, it
already contains complete information and thus, queries may return all answers
that exist in reality. In this paper we develop a technique to check query
completeness based on RDF data annotated with completeness information, taking
into account data-specific inferences that lead to an inference problem which
is $\Pi^P_2$-complete. We then identify a practically relevant fragment of
completeness information, suitable for crowdsourced, entity-centric RDF data
sources such as Wikidata, for which we develop an indexing technique that
allows to scale completeness reasoning to Wikidata-scale data sources. We
verify the applicability of our framework using Wikidata and develop COOL-WD, a
completeness tool for Wikidata, used to annotate Wikidata with completeness
statements and reason about the completeness of query answers over Wikidata.
The tool is available at http://cool-wd.inf.unibz.it/.
","[{'version': 'v1', 'created': 'Thu, 28 Apr 2016 11:24:49 GMT'}]",2016-04-29,"[['Darari', 'Fariz', ''], ['Razniewski', 'Simon', ''], ['Prasojo', 'Radityo Eko', ''], ['Nutt', 'Werner', '']]","['RDF', 'data completeness', 'SPARQL', 'query completeness', 'Wikidata']"
15813,1301.6262,Sim-Hui Tee,Sim-Hui Tee,Developing Parallel Dependency Graph In Improving Game Balancing,5 pages,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The dependency graph is a data architecture that models all the dependencies
between the different types of assets in the game. It depicts the
dependency-based relationships between the assets of a game. For example, a
player must construct an arsenal before he can build weapons. It is vital that
the dependency graph of a game is designed logically to ensure a logical
sequence of game play. However, a mere logical dependency graph is not
sufficient in sustaining the players' enduring interests in a game, which
brings the problem of game balancing into picture. The issue of game balancing
arises when the players do not feel the chances of winning the game over their
AI opponents who are more skillful in the game play. At the current state of
research, the architecture of dependency graph is monolithic for the players.
The sequence of asset possession is always foreseeable because there is only a
single dependency graph. Game balancing is impossible when the assets of AI
players are overwhelmingly outnumbering that of human players. This paper
proposes a parallel architecture of dependency graph for the AI players and
human players. Instead of having a single dependency graph, a parallel
architecture is proposed where the dependency graph of AI player is adjustable
with that of human player using a support dependency as a game balancing
mechanism. This paper exhibits that the parallel dependency graph helps to
improve game balancing.
","[{'version': 'v1', 'created': 'Sat, 26 Jan 2013 14:41:03 GMT'}]",2013-01-29,"[['Tee', 'Sim-Hui', '']]","['Game balancing', 'dependency graphs', 'parallel dependency graphs', 'support dependency', 'dependency value']"
15814,1704.05008,Mansur Khazeev,"Mansur Khazeev, Victor Rivera, Manuel Mazzara, Leonard Johard",Initial steps towards assessing the usability of a verification tool,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we report the experience of using AutoProof to statically
verify a small object oriented program. We identified the problems that emerged
by this activity and we classified them according to their nature. In
particular, we distinguish between tool-related and methodology-related issues,
and propose necessary changes to simplify both tool and method.
","[{'version': 'v1', 'created': 'Mon, 17 Apr 2017 16:04:49 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Jun 2017 08:51:00 GMT'}]",2017-06-20,"[['Khazeev', 'Mansur', ''], ['Rivera', 'Victor', ''], ['Mazzara', 'Manuel', ''], ['Johard', 'Leonard', '']]","['Static Verification', 'AutoProof', 'Verification issues']"
15815,1505.05537,Mohsen Khalili,"Mohsen Khalili, Xiaodong Zhang, Marios M. Polycarpou, Thomas Parisini,
  and Yongcan Cao","Distributed Adaptive Fault-Tolerant Control of Uncertain Multi-Agent
  Systems",,,,,cs.SY cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an adaptive fault-tolerant control (FTC) scheme for a
class of nonlinear uncertain multi-agent systems. A local FTC scheme is
designed for each agent using local measurements and suitable information
exchanged between neighboring agents. Each local FTC scheme consists of a fault
diagnosis module and a reconfigurable controller module comprised of a baseline
controller and two adaptive fault-tolerant controllers activated after fault
detection and after fault isolation, respectively. Under certain assumptions,
the closed-loop system's stability and leader-follower consensus properties are
rigorously established under different modes of the FTC system, including the
time-period before possible fault detection, between fault detection and
possible isolation, and after fault isolation.
","[{'version': 'v1', 'created': 'Wed, 20 May 2015 21:32:41 GMT'}]",2015-05-22,"[['Khalili', 'Mohsen', ''], ['Zhang', 'Xiaodong', ''], ['Polycarpou', 'Marios M.', ''], ['Parisini', 'Thomas', ''], ['Cao', 'Yongcan', '']]","['Fault-tolerant control', 'Multi-agent systems', 'Consensus']"
15816,1105.2584,James Smith,"James W. Smith, Ian Sommerville","Workload Classification & Software Energy Measurement for Efficient
  Scheduling on Private Cloud Platforms","10 pages, Submitted to ACM SOCC 2011",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  At present there are a number of barriers to creating an energy efficient
workload scheduler for a Private Cloud based data center. Firstly, the
relationship between different workloads and power consumption must be
investigated. Secondly, current hardware-based solutions to providing energy
usage statistics are unsuitable in warehouse scale data centers where low cost
and scalability are desirable properties. In this paper we discuss the effect
of different workloads on server power consumption in a Private Cloud platform.
We display a noticeable difference in energy consumption when servers are given
tasks that dominate various resources (CPU, Memory, Hard Disk and Network). We
then use this insight to develop CloudMonitor, a software utility that is
capable of >95% accurate power predictions from monitoring resource consumption
of workloads, after a ""training phase"" in which a dynamic power model is
developed.
","[{'version': 'v1', 'created': 'Thu, 12 May 2011 22:00:36 GMT'}]",2011-05-16,"[['Smith', 'James W.', ''], ['Sommerville', 'Ian', '']]","['cloud computing', 'private cloud', 'energy efficient computing', 'green cloud', 'virtualisation', 'power metering', 'resource monitoring', 'datacenter power management']"
15817,1603.03536,Mohammad Abdollahi Azgomi,Elaheh Ghassabani and Mohammad Abdollahi Azgomi,DSCMC: Distributed Stateless Code Model Checker,,"Trustworthy Computing Laboratory, School of Computer Engineering,
  Iran University of Science and Technology, Tehran, Iran, 2014",,Technical Report No. TWcL-TR-1403,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stateless code model checking is an effective verification technique, which
is more applicable than stateful model checking to the software world. Existing
stateless model checkers support the verification of neither LTL formulae nor
the information flow security properties. This paper proposes a distributed
stateless code model checker (DSCMC) designed based on the Actor model, and has
the capability of verifying code written in different programming languages.
This tool is implemented using Erlang, which is an actor-based programming
language. DSCMC is able to detect deadlocks, livelocks, and data races
automatically. In addition, the tool can verify information flow security and
the properties specified in LTL. Thanks to its actor-based architecture, DSCMC
provides a wide range of capabilities. The parallel architecture of the tool
exploiting the rich concurrency model of Erlang is suited to the time-intensive
process of stateless code model checking.
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2016 06:49:43 GMT'}]",2016-03-14,"[['Ghassabani', 'Elaheh', ''], ['Azgomi', 'Mohammad Abdollahi', '']]","['Stateless code model checking', 'Actor model', 'Erlang', 'distributed stateless code model checker']"
15818,1412.7774,Jongwon Ha,"Chol Man Ho, Son Il Gwak, Song Ho Pak, Jong Won Ha",Improved Parameter Identification Method Based on Moving Rate,,,,,cs.NE,http://creativecommons.org/licenses/publicdomain/,"  To improve the problem that the parameter identification for fuzzy neural
network has many time complexities in calculating, an improved T-S fuzzy
inference method and an parameter identification method for fuzzy neural
network are proposed. It mainly includes three parts. First, improved fuzzy
inference method based on production term for T-S Fuzzy model is explained.
Then, compared with existing Sugeno fuzzy inference based on Compositional
rules and type-distance fuzzy inference method, the proposed fuzzy inference
algorithm has a less amount of complexity in calculating and the calculating
process is simple. Next, a parameter identification method for FNN based on
production inference is proposed. Finally, the proposed method is applied for
the precipitation forecast and security situation prediction. Test results
showed that the proposed method significantly improved the effectiveness of
identification, reduced the learning order, time complexity and learning error.
","[{'version': 'v1', 'created': 'Thu, 25 Dec 2014 01:11:11 GMT'}]",2014-12-30,"[['Ho', 'Chol Man', ''], ['Gwak', 'Son Il', ''], ['Pak', 'Song Ho', ''], ['Ha', 'Jong Won', '']]","['Fuzzy neural network (FNN)', 'Fuzzy inference', 'TS fuzzy model', 'Parameter identification']"
15819,1206.2005,Najmeh Kamyabpour,"Doan B. Hoang, Najmeh Kamyabpour",An Energy Driven Architecture for Wireless Sensor Networks,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most wireless sensor networks operate with very limited energy sources-their
batteries, and hence their usefulness in real life applications is severely
constrained. The challenging issues are how to optimize the use of their energy
or to harvest their own energy in order to lengthen their lives for wider
classes of application. Tackling these important issues requires a robust
architecture that takes into account the energy consumption level of functional
constituents and their interdependency. Without such architecture, it would be
difficult to formulate and optimize the overall energy consumption of a
wireless sensor network. Unlike most current researches that focus on a single
energy constituent of WSNs independent from and regardless of other
constituents, this paper presents an Energy Driven Architecture (EDA) as a new
architecture and indicates a novel approach for minimising the total energy
consumption of a WSN
","[{'version': 'v1', 'created': 'Sun, 10 Jun 2012 09:04:51 GMT'}]",2012-06-12,"[['Hoang', 'Doan B.', ''], ['Kamyabpour', 'Najmeh', '']]","['Sensor', 'Wireless Sensor Networks (WSNs)', 'Hierarchy Energy Driven Architecture (EDA)', 'Energy Performance Model']"
15820,1106.1703,Xiaomeng Liu,"Xiaomeng Liu, Hai Lin and Ben M. Chen",Structural Controllability of Switched Linear Systems,"20 pages, 2 figures",,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies the structural controllability of a class of uncertain
switched linear systems, where the parameters of subsystems state matrices are
either unknown or zero. The structural controllability is a generalization of
the traditional controllability concept for dynamical systems, and purely based
on the interconnection relation between the state variables and inputs through
non-zero elements in the state matrices. In order to illustrate such a
relationship, two kinds of graphic representations of switched linear systems
are proposed, based on which graph theory based necessary and sufficient
characterizations of the structural controllability for switched linear systems
are presented. Finally, the paper concludes with discussions on the results and
future work.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2011 05:02:17 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Jan 2012 12:42:43 GMT'}, {'version': 'v3', 'created': 'Sat, 24 Aug 2013 14:55:54 GMT'}]",2013-08-27,"[['Liu', 'Xiaomeng', ''], ['Lin', 'Hai', ''], ['Chen', 'Ben M.', '']]","['Structural controllability', 'switched linear system', 'graphicinterpretation']"
15821,1301.6277,Jeon-Hyung Kang,"Jeon-Hyung Kang, Kristina Lerman, Lise Getoor",LA-LDA: A Limited Attention Topic Model for Social Recommendation,"The 2013 International Conference on Social Computing,
  Behavioral-Cultural Modeling, & Prediction (SBP 2013)",,,,cs.SI cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media users have finite attention which limits the number of incoming
messages from friends they can process. Moreover, they pay more attention to
opinions and recommendations of some friends more than others. In this paper,
we propose LA-LDA, a latent topic model which incorporates limited,
non-uniformly divided attention in the diffusion process by which opinions and
information spread on the social network. We show that our proposed model is
able to learn more accurate user models from users' social network and item
adoption behavior than models which do not take limited attention into account.
We analyze voting on news items on the social news aggregator Digg and show
that our proposed model is better able to predict held out votes than
alternative models. Our study demonstrates that psycho-socially motivated
models have better ability to describe and predict observed behavior than
models which only consider topics.
","[{'version': 'v1', 'created': 'Sat, 26 Jan 2013 18:26:36 GMT'}]",2013-01-29,"[['Kang', 'Jeon-Hyung', ''], ['Lerman', 'Kristina', ''], ['Getoor', 'Lise', '']]","['social media', 'diffusion', 'link analysis', 'influence']"
15822,1511.01543,Alessandro Chiuso,A. Chiuso,"Regularization and Bayesian Learning in Dynamical Systems: Past, Present
  and Future","Plenary Presentation at the IFAC SYSID 2015. Submitted to Annual
  Reviews in Control",,,,cs.SY stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Regularization and Bayesian methods for system identification have been
repopularized in the recent years, and proved to be competitive w.r.t.
classical parametric approaches. In this paper we shall make an attempt to
illustrate how the use of regularization in system identification has evolved
over the years, starting from the early contributions both in the Automatic
Control as well as Econometrics and Statistics literature. In particular we
shall discuss some fundamental issues such as compound estimation problems and
exchangeability which play and important role in regularization and Bayesian
approaches, as also illustrated in early publications in Statistics. The
historical and foundational issues will be given more emphasis (and space), at
the expense of the more recent developments which are only briefly discussed.
The main reason for such a choice is that, while the recent literature is
readily available, and surveys have already been published on the subject, in
the author's opinion a clear link with past work had not been completely
clarified.
","[{'version': 'v1', 'created': 'Wed, 4 Nov 2015 22:50:41 GMT'}]",2015-11-06,"[['Chiuso', 'A.', '']]","['Identification', 'Learning', 'Numerical Methods', 'Linear Systems']"
15823,1505.01941,George W. Kibirige Mr.,George W. Kibirige and Camilius Sanga,A Survey on Detection of Sinkhole Attack in Wireless Sensor Network,"9 pages, 2 figures and 1 table",,,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless Sensor Network (WSN) consists of large number of low-cost,
resource-constrained sensor nodes. The constraints of the wireless sensor node
is their characteristics which include low memory, low computation power, they
are deployed in hostile area and left unattended, small range of communication
capability and low energy capabilities. Base on those characteristics makes
this network vulnerable to several attacks, such as sinkhole attack. Sinkhole
attack is a type of attack were compromised node tries to attract network
traffic by advertise its fake routing update. One of the impacts of sinkhole
attack is that, it can be used to launch other attacks like selective
forwarding attack, acknowledge spoofing attack and drops or altered routing
information. It can also used to send bogus information to base station. This
paper is focus on exploring and analyzing the existing solutions which used to
detect and identify sinkhole attack in wireless sensor network. The analysis is
based on advantages and limitation of the proposed solutions.
","[{'version': 'v1', 'created': 'Fri, 8 May 2015 06:31:21 GMT'}, {'version': 'v2', 'created': 'Tue, 12 May 2015 13:16:51 GMT'}]",2015-05-13,"[['Kibirige', 'George W.', ''], ['Sanga', 'Camilius', '']]","['Wireless sensor network (WSN)', 'sinkhole attack', 'detection of sinkhole attack']"
15824,0807.0627,Arnaud Martin,Arnaud Martin (E3I2),Belief decision support and reject for textured images characterization,,"International Conference on Information Fusion, Lens : France
  (2008)",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The textured images' classification assumes to consider the images in terms
of area with the same texture. In uncertain environment, it could be better to
take an imprecise decision or to reject the area corresponding to an unlearning
class. Moreover, on the areas that are the classification units, we can have
more than one texture. These considerations allows us to develop a belief
decision model permitting to reject an area as unlearning and to decide on
unions and intersections of learning classes. The proposed approach finds all
its justification in an application of seabed characterization from sonar
images, which contributes to an illustration.
","[{'version': 'v1', 'created': 'Thu, 3 Jul 2008 19:46:21 GMT'}]",2008-07-04,"[['Martin', 'Arnaud', '', 'E3I2']]","['Belief decision', 'reject', 'belief function theory', 'patternrecognition', 'textured images']"
15825,1712.03400,Lucas Rod\'es-Guirao,"Federico Baldassarre, Diego Gonz\'alez Mor\'in, Lucas Rod\'es-Guirao","Deep Koalarization: Image Colorization using CNNs and
  Inception-ResNet-v2",12 pages,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We review some of the most recent approaches to colorize gray-scale images
using deep learning methods. Inspired by these, we propose a model which
combines a deep Convolutional Neural Network trained from scratch with
high-level features extracted from the Inception-ResNet-v2 pre-trained model.
Thanks to its fully convolutional architecture, our encoder-decoder model can
process images of any size and aspect ratio. Other than presenting the training
results, we assess the ""public acceptance"" of the generated images by means of
a user study. Finally, we present a carousel of applications on different types
of images, such as historical photographs.
","[{'version': 'v1', 'created': 'Sat, 9 Dec 2017 15:29:35 GMT'}]",2017-12-12,"[['Baldassarre', 'Federico', ''], ['Morín', 'Diego González', ''], ['Rodés-Guirao', 'Lucas', '']]","['Deep Learning', 'Colorization', 'CNN', 'Inception-ResNet-v2', 'Transfer Learning', 'Keras', 'TensorFlow']"
15826,1407.2837,Emilio Ferrara,"Emilio Ferrara, Pasquale De Meo, Salvatore Catanese, Giacomo Fiumara",Visualizing criminal networks reconstructed from mobile phone records,"6 pages, 4 figures, DataWiz 2014 (held in conjunction with ACM
  Hypertext 2014)",,,,cs.SI cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the fight against the racketeering and terrorism, knowledge about the
structure and the organization of criminal networks is of fundamental
importance for both the investigations and the development of efficient
strategies to prevent and restrain crimes. Intelligence agencies exploit
information obtained from the analysis of large amounts of heterogeneous data
deriving from various informative sources including the records of phone
traffic, the social networks, surveillance data, interview data, experiential
police data, and police intelligence files, to acquire knowledge about criminal
networks and initiate accurate and destabilizing actions. In this context,
visual representation techniques coordinate the exploration of the structure of
the network together with the metrics of social network analysis. Nevertheless,
the utility of visualization tools may become limited when the dimension and
the complexity of the system under analysis grow beyond certain terms. In this
paper we show how we employ some interactive visualization techniques to
represent criminal and terrorist networks reconstructed from phone traffic
data, namely foci, fisheye and geo-mapping network layouts. These methods allow
the exploration of the network through animated transitions among visualization
models and local enlargement techniques in order to improve the comprehension
of interesting areas. By combining the features of the various visualization
models it is possible to gain substantial enhancements with respect to classic
visualization models, often unreadable in those cases of great complexity of
the network.
","[{'version': 'v1', 'created': 'Thu, 10 Jul 2014 16:00:00 GMT'}]",2014-07-11,"[['Ferrara', 'Emilio', ''], ['De Meo', 'Pasquale', ''], ['Catanese', 'Salvatore', ''], ['Fiumara', 'Giacomo', '']]","['Mobile phone networks', 'criminal networks', 'visualization']"
15827,1312.7447,Zhongkui Li,"Zhongkui Li, Zhisheng Duan, Wei Ren, Gang Feng","Containment Control of Linear Multi-Agent Systems with Multiple Leaders
  of Bounded Inputs Using Distributed Continuous Controllers","16 pages, 4 figures. arXiv admin note: text overlap with
  arXiv:1312.7379",,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the containment control problem for multi-agent systems
with general linear dynamics and multiple leaders whose control inputs are
possibly nonzero and time varying. Based on the relative states of neighboring
agents, a distributed static continuous controller is designed, under which the
containment error is uniformly ultimately bounded and the upper bound of the
containment error can be made arbitrarily small, if the subgraph associated
with the followers is undirected and for each follower there exists at least
one leader that has a directed path to that follower. It is noted that the
design of the static controller requires the knowledge of the eigenvalues of
the Laplacian matrix and the upper bounds of the leaders' control inputs. In
order to remove these requirements, a distributed adaptive continuous
controller is further proposed, which can be designed and implemented by each
follower in a fully distributed fashion. Extensions to the case where only
local output information is available are discussed.
","[{'version': 'v1', 'created': 'Sat, 28 Dec 2013 16:17:29 GMT'}]",2013-12-31,"[['Li', 'Zhongkui', ''], ['Duan', 'Zhisheng', ''], ['Ren', 'Wei', ''], ['Feng', 'Gang', '']]","['Multi-agent systems', 'containment control', 'cooperative control', 'consensus', 'adaptive control']"
15828,1003.1470,Rdv Ijcsis,"Khan Farhan Rafat, Muhammad Sher",State Of The Art In Digital Steganography Focusing ASCII Text Documents,"Pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS February 2010, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 7, No. 2, pp. 063-072, February 2010, USA",,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Digitization of analogue signals has opened up new avenues for information
hiding and the recent advancements in the telecommunication field has taken up
this desire even further. From copper wire to fiber optics, technology has
evolved and so are ways of covert channel communication. By ""Covert"" we mean
""anything not meant for the purpose for which it is being used"". Investigation
and detection of existence of such cover channel communication has always
remained a serious concern of information security professionals which has now
been evolved into a motivating source of an adversary to communicate secretly
in ""open"" without being allegedly caught or noticed. This paper presents a
survey report on steganographic techniques which have been evolved over the
years to hide the existence of secret information inside some cover (Text)
object. The introduction of the subject is followed by the discussion which is
narrowed down to the area where digital ASCII Text documents are being used as
cover. Finally, the conclusion sums up the proceedings.
","[{'version': 'v1', 'created': 'Sun, 7 Mar 2010 13:57:24 GMT'}]",2010-04-28,"[['Rafat', 'Khan Farhan', ''], ['Sher', 'Muhammad', '']]","['Steganography', 'Cryptography', 'Conceal', 'Steganology', 'Covert Channel']"
15829,1212.5264,Yufei Han,"Yufei Han (INRIA Rocquencourt), Fabien Moutarde (CAOR)","Statistical Traffic State Analysis in Large-scale Transportation
  Networks Using Locality-Preserving Non-negative Matrix Factorization",IET Intelligent Transport Systems (2013),,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Statistical traffic data analysis is a hot topic in traffic management and
control. In this field, current research progresses focus on analyzing traffic
flows of individual links or local regions in a transportation network. Less
attention are paid to the global view of traffic states over the entire
network, which is important for modeling large-scale traffic scenes. Our aim is
precisely to propose a new methodology for extracting spatio-temporal traffic
patterns, ultimately for modeling large-scale traffic dynamics, and long-term
traffic forecasting. We attack this issue by utilizing Locality-Preserving
Non-negative Matrix Factorization (LPNMF) to derive low-dimensional
representation of network-level traffic states. Clustering is performed on the
compact LPNMF projections to unveil typical spatial patterns and temporal
dynamics of network-level traffic states. We have tested the proposed method on
simulated traffic data generated for a large-scale road network, and reported
experimental results validate the ability of our approach for extracting
meaningful large-scale space-time traffic patterns. Furthermore, the derived
clustering results provide an intuitive understanding of spatial-temporal
characteristics of traffic flows in the large-scale network, and a basis for
potential long-term forecasting.
","[{'version': 'v1', 'created': 'Thu, 20 Dec 2012 14:53:44 GMT'}]",2012-12-24,"[['Han', 'Yufei', '', 'INRIA Rocquencourt'], ['Moutarde', 'Fabien', '', 'CAOR']]","['LPNMF', 'Statistical Analysis', 'Network-level Traffic State']"
15830,1110.2704,Jerome Darmont,"Huu Hoa Nguyen (ERIC), Nouria Harbi (ERIC), J\'er\^ome Darmont (ERIC)",An Efficient Fuzzy Clustering-Based Approach for Intrusion Detection,"15th East-European Conference on Advances and Databases and
  Information Systems (ADBIS 11), Vienna : Austria (2011)",,,ERIC:11-029,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The need to increase accuracy in detecting sophisticated cyber attacks poses
a great challenge not only to the research community but also to corporations.
So far, many approaches have been proposed to cope with this threat. Among
them, data mining has brought on remarkable contributions to the intrusion
detection problem. However, the generalization ability of data mining-based
methods remains limited, and hence detecting sophisticated attacks remains a
tough task. In this thread, we present a novel method based on both clustering
and classification for developing an efficient intrusion detection system
(IDS). The key idea is to take useful information exploited from fuzzy
clustering into account for the process of building an IDS. To this aim, we
first present cornerstones to construct additional cluster features for a
training set. Then, we come up with an algorithm to generate an IDS based on
such cluster features and the original input features. Finally, we
experimentally prove that our method outperforms several well-known methods.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2011 17:06:12 GMT'}]",2011-10-13,"[['Nguyen', 'Huu Hoa', '', 'ERIC'], ['Harbi', 'Nouria', '', 'ERIC'], ['Darmont', 'Jérôme', '', 'ERIC']]","['classification', 'fuzzy clustering', 'intrusion detection', 'cyber attack']"
15831,1511.01259,Gregory Grefenstette,"Gregory Grefenstette (TAO), Karima Rafes (TAO, LRI)","Transforming Wikipedia into an Ontology-based Information Retrieval
  Search Engine for Local Experts using a Third-Party Taxonomy","Joint Second Workshop on Language and Ontology \& Terminology and
  Knowledge Structures (LangOnto2 + TermiKS) LO2TKS, May 2016, Portoroz,
  Slovenia. 2016",,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wikipedia is widely used for finding general information about a wide variety
of topics. Its vocation is not to provide local information. For example, it
provides plot, cast, and production information about a given movie, but not
showing times in your local movie theatre. Here we describe how we can connect
local information to Wikipedia, without altering its content. The case study we
present involves finding local scientific experts. Using a third-party
taxonomy, independent from Wikipedia's category hierarchy, we index information
connected to our local experts, present in their activity reports, and we
re-index Wikipedia content using the same taxonomy. The connections between
Wikipedia pages and local expert reports are stored in a relational database,
accessible through as public SPARQL endpoint. A Wikipedia gadget (or plugin)
activated by the interested user, accesses the endpoint as each Wikipedia page
is accessed. An additional tab on the Wikipedia page allows the user to open up
a list of teams of local experts associated with the subject matter in the
Wikipedia page. The technique, though presented here as a way to identify local
experts, is generic, in that any third party taxonomy, can be used in this to
connect Wikipedia to any non-Wikipedia data source.
","[{'version': 'v1', 'created': 'Wed, 4 Nov 2015 09:41:31 GMT'}, {'version': 'v2', 'created': 'Mon, 30 May 2016 14:45:27 GMT'}]",2016-05-31,"[['Grefenstette', 'Gregory', '', 'TAO'], ['Rafes', 'Karima', '', 'TAO, LRI']]","['ontology', 'pivot ontology', 'Wikipedia', 'local search']"
15832,1402.1759,Smita Jolania,"Smita Jolania, Sandeep Toshniwal","Performance Improvement of OFDM System Using Iterative Signal Clipping
  With Various Window Techniques for PAPR Reduction","5 pages,7 figures,Published with ""International Journal of
  Engineering Trends and Technology (IJETT)""",,,,cs.IT math.IT,http://creativecommons.org/licenses/by/3.0/,"  OFDM signals demonstrates high fluctuations termed as Peak to Average Power
Ratio (PAPR).The problem of OFDM is the frequent occurrence of high Peaks in
the time domain signal which in turn reduces the efficiency of transmit high
power amplifier.In this paper we discussed clipping and filtering technique
which is easy to implement and reduces the amount of PAPR by clipping the peak
of the maximum power signal.This technique clips the OFDM signal to a
predefined threshold and uses a filter to eliminate the out-of-band
radiation.Moreover, analysis of PAPR is given by varying different filters.The
study is focused to reduce PAPR by iterative clipping and filtering method. The
symbol error rate performances for different modulation techniques have been
countered.Each clipping noise sample is multiplied by a window
function(e.g.Hanning,Kaiser, or Hamming) to suppress the out-of-band noise.It
is shown that clipping and different filtering techniques for improvement in
the SER performance and provides further reduction in PAPR.
","[{'version': 'v1', 'created': 'Fri, 7 Feb 2014 09:53:42 GMT'}]",2014-02-11,"[['Jolania', 'Smita', ''], ['Toshniwal', 'Sandeep', '']]","['PAPR', 'Clipping', 'window function']"
15833,1712.04798,Ingmar Steiner,"Arif Khan, Ingmar Steiner, Yusuke Sugano, Andreas Bulling, Ross
  Macdonald","A Multimodal Corpus of Expert Gaze and Behavior during Phonetic
  Segmentation Tasks",,Proc. LREC 11 (2018) 4277-4281,,,cs.HC cs.CL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Phonetic segmentation is the process of splitting speech into distinct
phonetic units. Human experts routinely perform this task manually by analyzing
auditory and visual cues using analysis software, which is an extremely
time-consuming process. Methods exist for automatic segmentation, but these are
not always accurate enough. In order to improve automatic segmentation, we need
to model it as close to the manual segmentation as possible. This corpus is an
effort to capture the human segmentation behavior by recording experts
performing a segmentation task. We believe that this data will enable us to
highlight the important aspects of manual segmentation, which can be used in
automatic segmentation to improve its accuracy.
","[{'version': 'v1', 'created': 'Wed, 13 Dec 2017 14:45:29 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Mar 2018 14:57:09 GMT'}, {'version': 'v3', 'created': 'Fri, 11 May 2018 07:22:56 GMT'}]",2018-05-14,"[['Khan', 'Arif', ''], ['Steiner', 'Ingmar', ''], ['Sugano', 'Yusuke', ''], ['Bulling', 'Andreas', ''], ['Macdonald', 'Ross', '']]","['eyetracking', 'gaze analysis', 'manual segmentation behavior']"
15834,1506.00619,"Bart van Merri\""enboer","Bart van Merri\""enboer, Dzmitry Bahdanau, Vincent Dumoulin, Dmitriy
  Serdyuk, David Warde-Farley, Jan Chorowski, Yoshua Bengio",Blocks and Fuel: Frameworks for deep learning,,,,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce two Python frameworks to train neural networks on large
datasets: Blocks and Fuel. Blocks is based on Theano, a linear algebra compiler
with CUDA-support. It facilitates the training of complex neural network models
by providing parametrized Theano operations, attaching metadata to Theano's
symbolic computational graph, and providing an extensive set of utilities to
assist training the networks, e.g. training algorithms, logging, monitoring,
visualization, and serialization. Fuel provides a standard format for machine
learning datasets. It allows the user to easily iterate over large datasets,
performing many types of pre-processing on the fly.
","[{'version': 'v1', 'created': 'Mon, 1 Jun 2015 19:28:27 GMT'}]",2015-06-02,"[['van Merriënboer', 'Bart', ''], ['Bahdanau', 'Dzmitry', ''], ['Dumoulin', 'Vincent', ''], ['Serdyuk', 'Dmitriy', ''], ['Warde-Farley', 'David', ''], ['Chorowski', 'Jan', ''], ['Bengio', 'Yoshua', '']]","['Neural networks', 'GPGPU', 'large-scale machine learning']"
15835,1606.06125,Jirka Marsik,"Jirka Mar\v{s}\'ik (SEMAGRAMME), Maxime Amblard (MSH Lorraine,
  SEMAGRAMME)","Introducing a Calculus of Effects and Handlers for Natural Language
  Semantics",,"Formal Grammar 2016, Aug 2016, Bozen-Bolzano, Italy",,,cs.CL cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In compositional model-theoretic semantics, researchers assemble
truth-conditions or other kinds of denotations using the lambda calculus. It
was previously observed that the lambda terms and/or the denotations studied
tend to follow the same pattern: they are instances of a monad. In this paper,
we present an extension of the simply-typed lambda calculus that exploits this
uniformity using the recently discovered technique of effect handlers. We prove
that our calculus exhibits some of the key formal properties of the lambda
calculus and we use it to construct a modular semantics for a small fragment
that involves multiple distinct semantic phenomena.
","[{'version': 'v1', 'created': 'Mon, 20 Jun 2016 14:05:59 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Jul 2016 07:14:44 GMT'}]",2016-07-11,"[['Maršík', 'Jirka', '', 'SEMAGRAMME'], ['Amblard', 'Maxime', '', 'MSH Lorraine,\n  SEMAGRAMME']]","['compositionality', 'side effects', 'monads', 'handlers', 'deixis', 'conventional implicature']"
15836,1701.03918,Yongqing Wang,"Yongqing Wang, Shenghua Liu, Huawei Shen, Xueqi Cheng",Marked Temporal Dynamics Modeling based on Recurrent Neural Network,,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We are now witnessing the increasing availability of event stream data, i.e.,
a sequence of events with each event typically being denoted by the time it
occurs and its mark information (e.g., event type). A fundamental problem is to
model and predict such kind of marked temporal dynamics, i.e., when the next
event will take place and what its mark will be. Existing methods either
predict only the mark or the time of the next event, or predict both of them,
yet separately. Indeed, in marked temporal dynamics, the time and the mark of
the next event are highly dependent on each other, requiring a method that
could simultaneously predict both of them. To tackle this problem, in this
paper, we propose to model marked temporal dynamics by using a mark-specific
intensity function to explicitly capture the dependency between the mark and
the time of the next event. Extensive experiments on two datasets demonstrate
that the proposed method outperforms state-of-the-art methods at predicting
marked temporal dynamics.
","[{'version': 'v1', 'created': 'Sat, 14 Jan 2017 13:26:39 GMT'}]",2017-02-12,"[['Wang', 'Yongqing', ''], ['Liu', 'Shenghua', ''], ['Shen', 'Huawei', ''], ['Cheng', 'Xueqi', '']]","['marked temporal dynamics', 'recurrent neural network', 'event streamdata']"
15837,1702.05031,Wafa Badreddine,"Wafa Badreddine (NPA, LIP6), Maria Potop-Butucaru (NPA, LIP6)","Peak Transmission Rate Resilient Crosslayer Broadcast for Body Area
  Networks",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless Body Area Networks (WBAN) open an interdisciplinary area within
Wireless Sensor Networks (WSN) research, with a tremendous impact in healthcare
area where sensors are used to monitor, collect and transmit biological
parameters of the human body. We propose the rst network-MAC cross-layer
broadcast protocol in WBAN. Our protocol, evaluated in the OMNET++ simulator
enriched with realistic human body mobility models and channel models issued
from the recent research on biomedical and health informatics, outperforms
existing at broadcast strategies in terms of percentage of covered nodes,
energy consumption and correct reception of causally-ordered packets (i.e.
packets are received in the same order as they were sent by the sink).
Furthermore, we investigate the resilience of both existing at broadcast
strategies and our new protocol face to various transmission rates and human
body mobility. Existing at broadcast strategies without exception start to have
a drastic drop of performances for transmission rates above 11Kb/s while our
cross-layer protocol performances maintains its good performances for
transmission rates up to 190Kb/s.
","[{'version': 'v1', 'created': 'Thu, 16 Feb 2017 16:06:35 GMT'}]",2017-02-17,"[['Badreddine', 'Wafa', '', 'NPA, LIP6'], ['Potop-Butucaru', 'Maria', '', 'NPA, LIP6']]","['Omnet++', 'WBAN', 'Broadcast', 'mobility model', 'cross layer', 'Mixim']"
15838,1107.4785,Ranjan Pal,"Ranjan Pal, Leana Golubchik, Konstantinos Psounis",A Novel Cyber-Insurance for Internet Security,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet users such as individuals and organizations are subject to different
types of epidemic risks such as worms, viruses, and botnets. To reduce the
probability of risk, an Internet user generally invests in self-defense
mechanisms like antivirus and antispam software. However, such software does
not completely eliminate risk. Recent works have considered the problem of
residual risk elimination by proposing the idea of cyber-insurance. In reality,
an Internet user faces risks due to security attacks as well as risks due to
non-security related failures (e.g., reliability faults in the form of hardware
crash, buffer overflow, etc.) . These risk types are often indistinguishable by
a naive user. However, a cyber-insurance agency would most likely insure risks
only due to security attacks. In this case, it becomes a challenge for an
Internet user to choose the right type of cyber-insurance contract as standard
optimal contracts, i.e., contracts under security attacks only, might prove to
be sub-optimal for himself. In this paper, we address the problem of analyzing
cyber-insurance solutions when a user faces risks due to both, security as well
as non-security related failures. We propose \emph{Aegis}, a novel
cyber-insurance model in which the user accepts a fraction \emph{(strictly
positive)} of loss recovery on himself and transfers rest of the loss recovery
on the cyber-insurance agency. We mathematically show that given an option,
Internet users would prefer Aegis contracts to traditional cyber-insurance
contracts, under all premium types. This result firmly establishes the
non-existence of traditional cyber-insurance markets when Aegis contracts are
offered to users.
","[{'version': 'v1', 'created': 'Sun, 24 Jul 2011 18:46:54 GMT'}]",2011-07-26,"[['Pal', 'Ranjan', ''], ['Golubchik', 'Leana', ''], ['Psounis', 'Konstantinos', '']]","['Aegis', 'risks', 'insurable', 'non-insurable']"
15839,1301.1195,Vladimir Shpilrain,Dima Grigoriev and Vladimir Shpilrain,Tropical cryptography,9 pages,,,,cs.CR math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We employ tropical algebras as platforms for several cryptographic schemes
that would be vulnerable to linear algebra attacks were they based on ""usual""
algebras as platforms.
","[{'version': 'v1', 'created': 'Mon, 7 Jan 2013 13:51:55 GMT'}]",2013-01-08,"[['Grigoriev', 'Dima', ''], ['Shpilrain', 'Vladimir', '']]","['tropical algebra', 'public key exchange', 'encryption']"
15840,1511.05709,Jan Plato\v{s},"Milo\v{s} Kud\v{e}lka and Jan Plato\v{s} and Pavel Kr\""omer",Author Evaluation Based on H-index and Citation Response,,,,,cs.DL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An accurate and fair assessment of the efficiency and impact of scientific
work is, despite a lot of recent research effort, still an open problem. The
measurement of quality and success of individual scientists and research groups
can be approached from many different directions, none of which is universal. A
reason for this is inherently different behavior of different scientists within
the global research community. A complex evaluation of ones publication
activities requires a careful consideration of a wide variety of factors. The
well-known H-index is one of the most used bibliometric indices. Despite its
many imperfections, its simplicity and ease of interpretation make it a popular
scientometric method. This short paper uses the ideas behind the H-index ~to
analyze communities of authors who cite publishing scientists. A new author
evaluation measure named aH-index is proposed, and intuitive interpretations of
its properties and semantics are presented. Preliminary experiments with
authors with high H-index active in the area of computer science are presented
to demonstrate the properties of the proposed measure.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2015 09:48:34 GMT'}]",2015-11-19,"[['Kudělka', 'Miloš', ''], ['Platoš', 'Jan', ''], ['Krömer', 'Pavel', '']]","['H-index', 'citation', 'bibliometric', 'scientometric']"
15841,1003.1491,Rdv Ijcsis,"Manish Kumar, M.C. Srivastava, Umesh Kumar",Current Conveyor Based Multifunction Filter,"Pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS, Vol. 7 No. 2, February 2010, USA. ISSN 1947
  5500, http://sites.google.com/site/ijcsis/",,,,cs.OH,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The paper presents a current conveyor based multifunction filter. The
proposed circuit can be realized as low pass, high pass, band pass and
elliptical notch filter. The circuit employs two balanced output current
conveyors, four resistors and two grounded capacitors, ideal for integration.
It has only one output terminal and the number of input terminals may be used.
Further, there is no requirement for component matching in the circuit. The
parameter resonance frequency (\omega_0) and bandwidth (\omega_0 /Q) enjoy
orthogonal tuning. The complementary metal oxide semiconductor (CMOS)
realization of the current conveyor is given for the simulation of the proposed
circuit. A HSPICE simulation of circuit is also studied for the verification of
theoretical results. The non-ideal analysis of CCII is also studied.
","[{'version': 'v1', 'created': 'Sun, 7 Mar 2010 16:57:41 GMT'}]",2010-03-09,"[['Kumar', 'Manish', ''], ['Srivastava', 'M. C.', ''], ['Kumar', 'Umesh', '']]","['Active filters', 'Current Conveyor', 'Voltage-mode']"
15842,1403.8150,K\'evin Atighehchi,Kevin Atighehchi,On the Incremental Asymmetric Signatures,Preliminary version,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of incremental cryptography is to allow the updating of
cryptographic forms of documents undergoing modifications, more efficiently
than if we had to recompute them from scratch. This paper defines a framework
for using securely a variant of the incremental hash function designed by
Bok-Min Goi et al. The condition of use of their hash function is somehow
impractical since they assume that the blocks of the message are all distinct.
In this paper we show how we can discard this strong assumption so as to
construct the first practical incremental asymmetric signature scheme that
keeps efficient update operations. Finally, as the proposed scheme has the
defect to severely expand the signature size, we propose a solution which
drastically reduces this drawback.
","[{'version': 'v1', 'created': 'Mon, 31 Mar 2014 19:57:24 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Apr 2014 08:38:05 GMT'}]",2014-04-03,"[['Atighehchi', 'Kevin', '']]","['Incremental cryptography', 'Obliviousness', 'Parallel cryptography']"
15843,1202.6136,Dohy Hong,Dohy Hong,D-iteration: evaluation of the update algorithm,5 pages,,,,cs.DM math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of this paper is to analyse the gain of the update algorithm
associated to the recently proposed D-iteration: the D-iteration is a fluid
diffusion based new iterative method. It exploits a simple intuitive
decomposition of the product matrix-vector as elementary operations of fluid
diffusion (forward scheme) associated to a new algebraic representation. We
show through experimentations on real datasets how much this approach can
improve the computation efficiency in presence of the graph evolution.
","[{'version': 'v1', 'created': 'Tue, 28 Feb 2012 07:04:11 GMT'}]",2012-02-29,"[['Hong', 'Dohy', '']]","['Computation', 'Iteration', 'Fixed point', 'Gauss-Seidel', 'Eigenvector']"
15844,1710.05499,Ekram Hossain,"Shermila Ranadheera, Setareh Maghsudi, and Ekram Hossain","Computation Offloading and Activation of Mobile Edge Computing Servers:
  A Minority Game",,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the ever-increasing popularity of resource-intensive mobile
applications, Mobile Edge Computing (MEC), e.g., offloading computationally
expensive tasks to the cellular edge, has become a prominent technology for the
next generation wireless networks. Despite its great performance in terms of
delay and energy, MEC suffers from restricted power allowance and computational
capability of the edge nodes. Therefore, it is imperative to develop
distributed mechanisms for computation offloading, so that not only the
computational servers are utilized at their best capacity, but also the users'
latency constraints are fulfilled. In this paper, by using the theory of
Minority Games, we develop a novel distributed server activation mechanism for
computational offloading. Our scheme guarantees energy-efficient activation of
servers as well as satisfaction of users' quality-of-experience (QoE)
requirements in terms of latency.
","[{'version': 'v1', 'created': 'Mon, 16 Oct 2017 04:13:06 GMT'}]",2017-10-17,"[['Ranadheera', 'Shermila', ''], ['Maghsudi', 'Setareh', ''], ['Hossain', 'Ekram', '']]","['Computation offloading', 'mobile edge computing', 'server mode selection', 'minority game']"
15845,1206.3634,Ankur Sahai,Ankur Sahai,Balls into Bins: strict Capacities and Edge Weights,,,,,cs.DS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore a novel theoretical model for studying the performance of
distributed storage management systems where the data-centers have limited
capacities (as compared to storage space requested by the users). Prior schemes
such as Balls-into-bins (used for load balancing) neither consider bin
(consumer) capacities (multiple balls into a bin) nor the future performance of
the system after, balls (producer requests) are allocated to bins and restrict
number of balls as a function of the number of bins. Our problem consists of
finding an optimal assignment of the online producer requests to consumers (via
weighted edges) in a complete bipartite graph while ensuring that the total
size of request assigned on a consumer is limited by its capacity. The metric
used to measure the performance in this model is the (minimization of) weighted
sum of the requests assigned on the edges (loads) and their corresponding
weights. We first explore the optimal offline algorithms followed by
competitive analysis of different online techniques. Using oblivious adversary.
LP and Primal-Dual algorithms are used for calculating the optimal offline
solution in O(r*n) time (where r and n are the number of requests and consumers
respectively) while randomized algorithms are used for the online case.
  For the simplified model with equal consumer capacities an average-case
competitive ratio of AVG(d) / MIN(d) (where d is the edge weight / distance) is
achieved using an algorithm that has equal probability for selecting any of the
available edges with a running time of $O(r)$. In the extending the model to
arbitrary consumer capacities we show an average case competitive ratio of
AVG(d*c) / (AVG(c) *MIN(d)).
","[{'version': 'v1', 'created': 'Sat, 16 Jun 2012 07:33:30 GMT'}]",2012-06-19,"[['Sahai', 'Ankur', '']]","['Online algorithms', 'Primal-dual', 'Load balancing', 'Competitive ratio']"
15846,1401.6606,Giuseppe Lisanti,"Giuseppe Lisanti and Iacopo Masi and Federico Pernici and Alberto Del
  Bimbo","Continuous Localization and Mapping of a Pan Tilt Zoom Camera for Wide
  Area Tracking",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pan-tilt-zoom (PTZ) cameras are powerful to support object identification and
recognition in far-field scenes. However, the effective use of PTZ cameras in
real contexts is complicated by the fact that a continuous on-line camera
calibration is needed and the absolute pan, tilt and zoom positional values
provided by the camera actuators cannot be used because are not synchronized
with the video stream. So, accurate calibration must be directly extracted from
the visual content of the frames. Moreover, the large and abrupt scale changes,
the scene background changes due to the camera operation and the need of camera
motion compensation make target tracking with these cameras extremely
challenging. In this paper, we present a solution that provides continuous
on-line calibration of PTZ cameras which is robust to rapid camera motion,
changes of the environment due to illumination or moving objects and scales
beyond thousands of landmarks. The method directly derives the relationship
between the position of a target in the 3D world plane and the corresponding
scale and position in the 2D image, and allows real-time tracking of multiple
targets with high and stable degree of accuracy even at far distances and any
zooming level.
","[{'version': 'v1', 'created': 'Sun, 26 Jan 2014 02:23:56 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Mar 2015 18:28:02 GMT'}]",2015-03-24,"[['Lisanti', 'Giuseppe', ''], ['Masi', 'Iacopo', ''], ['Pernici', 'Federico', ''], ['Del Bimbo', 'Alberto', '']]","['Rotating', 'Zooming Camera · PTZ Sensor ·Localization', 'Mapping · Multiple Target Tracking']"
15847,1610.01795,Mohamad Ivan Fanany,"Ines Heidieni Ikasari, Vina Ayumi, Mohamad Ivan Fanany, Sidik Mulyono","Multiple Regularizations Deep Learning for Paddy Growth Stages
  Classification from LANDSAT-8",11 pages,,,,cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study uses remote sensing technology that can provide information about
the condition of the earth's surface area, fast, and spatially. The study area
was in Karawang District, lying in the Northern part of West Java-Indonesia. We
address a paddy growth stages classification using LANDSAT 8 image data
obtained from multi-sensor remote sensing image taken in October 2015 to August
2016. This study pursues a fast and accurate classification of paddy growth
stages by employing multiple regularizations learning on some deep learning
methods such as DNN (Deep Neural Networks) and 1-D CNN (1-D Convolutional
Neural Networks). The used regularizations are Fast Dropout, Dropout, and Batch
Normalization. To evaluate the effectiveness, we also compared our method with
other machine learning methods such as (Logistic Regression, SVM, Random
Forest, and XGBoost). The data used are seven bands of LANDSAT-8 spectral data
samples that correspond to paddy growth stages data obtained from i-Sky (eye in
the sky) Innovation system. The growth stages are determined based on paddy
crop phenology profile from time series of LANDSAT-8 images. The classification
results show that MLP using multiple regularization Dropout and Batch
Normalization achieves the highest accuracy for this dataset.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2016 09:46:08 GMT'}]",2016-10-07,"[['Ikasari', 'Ines Heidieni', ''], ['Ayumi', 'Vina', ''], ['Fanany', 'Mohamad Ivan', ''], ['Mulyono', 'Sidik', '']]","['Classification', 'Paddy Growth Stage', 'Remote Sensing', 'LANDSAT 8', 'Machine Learning', 'Deep Learning', 'Fast Dropout Training']"
15848,1307.4107,John Pliam,John O. Pliam,"Alternating Product Ciphers: A Case for Provable Security Comparisons
  (extended abstract)","12 pages, 3 figures, (v1) initial version (v2) Indocrypt 2013
  preprint",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We formally study iterated block ciphers that alternate between two sequences
of independent and identically distributed (i.i.d.) rounds. It is demonstrated
that, in some cases the effect of alternating increases security, while in
other cases the effect may strictly decrease security relative to the
corresponding product of one of its component sequences. As this would appear
to contradict conventional wisdom based on the ideal cipher approximation, we
introduce new machinery for provable security comparisons. The comparisons made
here simultaneously establish a coherent ordering of security metrics ranging
from key-recovery cost to computational indistinguishability.
","[{'version': 'v1', 'created': 'Mon, 15 Jul 2013 21:19:53 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Sep 2013 14:40:03 GMT'}]",2013-09-12,"[['Pliam', 'John O.', '']]","['block ciphers', 'product ciphers', 'multiple encryption', 'majorization']"
15849,1712.02974,Sayed Kamaledin Ghiasi-Shirazi,Kamaledin Ghiasi-Shirazi,Learning 2D Gabor Filters by Infinite Kernel Learning Regression,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Gabor functions have wide-spread applications in image processing and
computer vision. In this paper, we prove that 2D Gabor functions are
translation-invariant positive-definite kernels and propose a novel formulation
for the problem of image representation with Gabor functions based on infinite
kernel learning regression. Using this formulation, we obtain a support vector
expansion of an image based on a mixture of Gabor functions. The problem with
this representation is that all Gabor functions are present at all support
vector pixels. Applying LASSO to this support vector expansion, we obtain a
sparse representation in which each Gabor function is positioned at a very
small set of pixels. As an application, we introduce a method for learning a
dataset-specific set of Gabor filters that can be used subsequently for feature
extraction. Our experiments show that use of the learned Gabor filters improves
the recognition accuracy of a recently introduced face recognition algorithm.
","[{'version': 'v1', 'created': 'Fri, 8 Dec 2017 07:50:58 GMT'}]",2017-12-11,"[['Ghiasi-Shirazi', 'Kamaledin', '']]","['Gabor kernels', 'stabilized infinite kernel learning', 'support vector regression']"
15850,1412.6147,Theodore Kolokolnikov,Theodore Kolokolnikov,Maximizing algebraic connectivity for certain families of graphs,"to appear, Journal of Linear Algebra and Applications",,,,cs.DM math.CO math.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the bounds on algebraic connectivity of graphs subject to
constraints on the number of edges, vertices, and topology. We show that the
algebraic connectivity for any tree on $n$ vertices and with maximum degree $d$
is bounded above by $2(d-2) \frac{1}{n}+O(\frac{\ln n}{n^{2}}) .$ We then
investigate upper bounds on algebraic connectivity for cubic graphs. We show
that algebraic connectivity of a cubic graph of girth $g$ is bounded above by
$3-2^{3/2}\cos(\pi/\lfloor g/2\rfloor) ,$ which is an improvement over the
bound found by Nilli [A. Nilli, Electron. J. Combin., 11(9), 2004]. Finally, we
propose several conjectures and open questions.
","[{'version': 'v1', 'created': 'Wed, 17 Dec 2014 18:49:49 GMT'}]",2014-12-22,"[['Kolokolnikov', 'Theodore', '']]","['algebraic connectivity', 'optimal networks', 'trees', 'cubic graphs']"
15851,1309.6964,Ryan Kennedy,"Ryan Kennedy, Laura Balzano, Stephen J. Wright, Camillo J. Taylor",Online Algorithms for Factorization-Based Structure from Motion,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a family of online algorithms for real-time factorization-based
structure from motion, leveraging a relationship between incremental singular
value decomposition and recently proposed methods for online matrix completion.
Our methods are orders of magnitude faster than previous state of the art, can
handle missing data and a variable number of feature points, and are robust to
noise and sparse outliers. We demonstrate our methods on both real and
synthetic sequences and show that they perform well in both online and batch
settings. We also provide an implementation which is able to produce 3D models
in real time using a laptop with a webcam.
","[{'version': 'v1', 'created': 'Thu, 26 Sep 2013 16:46:28 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Jan 2014 19:33:45 GMT'}, {'version': 'v3', 'created': 'Mon, 30 Mar 2015 17:43:36 GMT'}, {'version': 'v4', 'created': 'Sat, 16 Jul 2016 16:45:54 GMT'}]",2016-07-19,"[['Kennedy', 'Ryan', ''], ['Balzano', 'Laura', ''], ['Wright', 'Stephen J.', ''], ['Taylor', 'Camillo J.', '']]","['structure from motion', 'matrix completion', 'incremental singular value decomposition']"
15852,1106.0776,Juan Carlos Nieves,"Juan Carlos Nieves, Mauricio Osorio and Ulises Cort\'es",Semantics for Possibilistic Disjunctive Programs,"37 pages, 5 figures. To appear in Theory and Practice of Logic
  Programming (TPLP)",,,,cs.AI cs.LO cs.PL,http://creativecommons.org/licenses/by/3.0/,"  In this paper, a possibilistic disjunctive logic programming approach for
modeling uncertain, incomplete and inconsistent information is defined. This
approach introduces the use of possibilistic disjunctive clauses which are able
to capture incomplete information and incomplete states of a knowledge base at
the same time.
  By considering a possibilistic logic program as a possibilistic logic theory,
a construction of a possibilistic logic programming semantic based on answer
sets and the proof theory of possibilistic logic is defined. It shows that this
possibilistic semantics for disjunctive logic programs can be characterized by
a fixed-point operator. It is also shown that the suggested possibilistic
semantics can be computed by a resolution algorithm and the consideration of
optimal refutations from a possibilistic logic theory.
  In order to manage inconsistent possibilistic logic programs, a preference
criterion between inconsistent possibilistic models is defined; in addition,
the approach of cuts for restoring consistency of an inconsistent possibilistic
knowledge base is adopted. The approach is illustrated in a medical scenario.
","[{'version': 'v1', 'created': 'Fri, 3 Jun 2011 22:57:06 GMT'}]",2015-03-19,"[['Nieves', 'Juan Carlos', ''], ['Osorio', 'Mauricio', ''], ['Cortés', 'Ulises', '']]","['Answer Set Programming', 'Uncertain Information', 'Possibilistic Reasoning']"
15853,1004.3534,Reza Rabieyan Mr,Reza Rabieyan,Propose a Fuzzy Queuing Maximal Benefit Location Problem,"27 pages,5 figure,& table",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a fuzzy queuing location model for congested system. In a
queuing system there are different criteria that are not constant such as
service rate, service rate demand, queue length, the occupancy probability of a
service center and Probability of joining the queue line. In this paper with
fuzzifying all of these variables, will try to reach an accurate real problem.
Finally we change the problem to a single objective function and as far as this
model is in NP-Hard classification we will use genetic algorithm for solving it
and ant colony for comparison is used for their results and run time.
","[{'version': 'v1', 'created': 'Tue, 20 Apr 2010 19:37:05 GMT'}]",2010-04-21,"[['Rabieyan', 'Reza', '']]","['p-median', 'Queuing Theory', 'Set Covering', 'Genetic Algorithm', 'Ant Colony Optimization']"
15854,1602.06411,Kyriakos Axiotis,"Kyriakos Axiotis, Dimitris Fotakis","On the Size and the Approximability of Minimum Temporally Connected
  Subgraphs",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider temporal graphs with discrete time labels and investigate the
size and the approximability of minimum temporally connected spanning
subgraphs. We present a family of minimally connected temporal graphs with $n$
vertices and $\Omega(n^2)$ edges, thus resolving an open question of (Kempe,
Kleinberg, Kumar, JCSS 64, 2002) about the existence of sparse temporal
connectivity certificates. Next, we consider the problem of computing a minimum
weight subset of temporal edges that preserve connectivity of a given temporal
graph either from a given vertex r (r-MTC problem) or among all vertex pairs
(MTC problem). We show that the approximability of r-MTC is closely related to
the approximability of Directed Steiner Tree and that r-MTC can be solved in
polynomial time if the underlying graph has bounded treewidth. We also show
that the best approximation ratio for MTC is at least $O(2^{\log^{1-\epsilon}
n})$ and at most $O(\min\{n^{1+\epsilon}, (\Delta M)^{2/3+\epsilon}\})$, for
any constant $\epsilon > 0$, where $M$ is the number of temporal edges and
$\Delta$ is the maximum degree of the underlying graph. Furthermore, we prove
that the unweighted version of MTC is APX-hard and that MTC is efficiently
solvable in trees and $2$-approximable in cycles.
","[{'version': 'v1', 'created': 'Sat, 20 Feb 2016 14:24:13 GMT'}]",2016-02-23,"[['Axiotis', 'Kyriakos', ''], ['Fotakis', 'Dimitris', '']]","['Temporal Graphs', 'Temporal Connectivity', 'Approximation Algorithms', 'Graph Theory']"
15855,1111.6149,Sumit Kumar,G. Rama Murthy,Optimal Organizational Hierarchies: Source Coding: Disaster Relief,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  ulticasting is an important communication paradigm for enabling the
dissemination of information selectively. This paper considers the problem of
optimal secure multicasting in a communication network captured through a graph
(optimal is in an interesting sense) and provides a doubly optimal solution
using results from source coding. It is realized that the solution leads to
optimal design (in a well defined optimality sense) of organizational
hierarchies captured through a graph. In this effort two novel concepts :
prefix free path, graph entropy are introduced. Some results of graph entropy
are provided. Also some results on Kraft inequality are discussed. As an
application Hierarchical Hybrid Communication Network is utilized as a model of
structured Mobile Adhoc network for utility in Disaster Management. Several new
research problems that naturally emanate from this research are summarized.
","[{'version': 'v1', 'created': 'Sat, 26 Nov 2011 10:29:08 GMT'}]",2011-11-29,"[['Murthy', 'G. Rama', '']]","['Multicasting', 'organizational  hierarchy', 'prefix  free path', 'graph  entropy', 'source  coding']"
15856,1605.02885,Rocio Gonzalez-Diaz,"Nieves Atienza, Rocio Gonzalez-Diaz, and Matteo Rucco",Separating Topological Noise from Features using Persistent Entropy,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we derive a simple method for separating topological noise
from topological features using a novel measure for comparing persistence
barcodes called persistent entropy.
","[{'version': 'v1', 'created': 'Tue, 10 May 2016 08:10:46 GMT'}]",2016-05-11,"[['Atienza', 'Nieves', ''], ['Gonzalez-Diaz', 'Rocio', ''], ['Rucco', 'Matteo', '']]","['Persistent homology', 'persistence barcodes', 'Shannon entropy', 'topological noise', 'topological features']"
15857,1109.4474,Amy Poh Ai Ling,"Amy Poh Ai Ling, Mukaidono Masao",Smart Grid Information Security (IS) Functional Requirement,arXiv admin note: substantial text overlap with arXiv:1108.0267,"Int. J. Emerg. Sci., 1(3), 371-386, 2011",,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is important to implement safe smart grid environment to enhance people's
lives and livelihoods. This paper provides information on smart grid IS
functional requirement by illustrating some discussion points to the sixteen
identified requirements. This paper introduces the smart grid potential hazards
that can be referred as a triggering factor to improve the system and security
of the entire grid. The background of smart information infrastructure and the
needs for smart grid IS is described with the adoption of hermeneutic circle as
methodology. Grid information technology and security-s session discusses that
grid provides the chance of a simple and transparent access to different
information sources. In addition, the transformation between traditional versus
smart grid networking trend and the IS importance on the communication field
reflects the criticality of grid IS functional requirement identification is
introduces. The smart grid IS functional requirements described in this paper
are general and can be adopted or modified to suit any smart grid system. This
paper has tutorial contents where some related backgrounds were provided,
especially for networking community, covering the cyber security requirement of
smart grid information infrastructure.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2011 04:33:49 GMT'}]",2011-09-22,"[['Ling', 'Amy Poh Ai', ''], ['Masao', 'Mukaidono', '']]","['smart grid', 'information security', 'functional requirement', 'networking trend', 'consumer']"
15858,1712.06646,George Kesidis,David J. Miller and Yulia Wang and George Kesidis,"When Not to Classify: Anomaly Detection of Attacks (ADA) on DNN
  Classifiers at Test Time",,,,,cs.LG cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A significant threat to the recent, wide deployment of machine learning-based
systems, including deep neural networks (DNNs), is adversarial learning
attacks. We analyze possible test-time evasion-attack mechanisms and show that,
in some important cases, when the image has been attacked, correctly
classifying it has no utility: i) when the image to be attacked is (even
arbitrarily) selected from the attacker's cache; ii) when the sole recipient of
the classifier's decision is the attacker. Moreover, in some application
domains and scenarios it is highly actionable to detect the attack irrespective
of correctly classifying in the face of it (with classification still performed
if no attack is detected). We hypothesize that, even if human-imperceptible,
adversarial perturbations are machine-detectable. We propose a purely
unsupervised anomaly detector (AD) that, unlike previous works: i) models the
joint density of a deep layer using highly suitable null hypothesis density
models (matched in particular to the non- negative support for RELU layers);
ii) exploits multiple DNN layers; iii) leverages a ""source"" and ""destination""
class concept, source class uncertainty, the class confusion matrix, and DNN
weight information in constructing a novel decision statistic grounded in the
Kullback-Leibler divergence. Tested on MNIST and CIFAR-10 image databases under
three prominent attack strategies, our approach outperforms previous detection
methods, achieving strong ROC AUC detection accuracy on two attacks and better
accuracy than recently reported for a variety of methods on the strongest (CW)
attack. We also evaluate a fully white box attack on our system. Finally, we
evaluate other important performance measures, such as classification accuracy,
versus detection rate and attack strength.
","[{'version': 'v1', 'created': 'Mon, 18 Dec 2017 19:48:04 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Jun 2018 02:40:33 GMT'}]",2018-06-29,"[['Miller', 'David J.', ''], ['Wang', 'Yulia', ''], ['Kesidis', 'George', '']]","['adversarial learning', 'test-time evasion attack', 'anomaly detection', 'deep neural net']"
15859,1108.6010,Nabendu Chaki Dr.,"Novarun Deb, Manali Chakraborty, Nabendu Chaki","A State-of-the-art Survey on IDS for Mobile Ad-Hoc Networks and Wireless
  Mesh Networks","Accepted for publication in PDCTA 2011 to be held in Chennair during
  September 25-27, 2011",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An Intrusion Detection System (IDS) detects malicious and selfish nodes in a
network. Ad hoc networks are often secured by using either intrusion detection
or by secure routing. Designing efficient IDS for wireless ad-hoc networks that
would not affect the performance of the network significantly is indeed a
challenging task. Arguably, the most common thing in a review paper in the
domain of wireless networks is to compare the performances of different
solutions using simulation results. However, variance in multiple configuration
aspects including that due to different underlying routing protocols, makes the
task of simulation based comparative evaluation of IDS solutions somewhat
unrealistic. In stead, the authors have followed an analytic approach to
identify the gaps in the existing IDS solutions for MANETs and wireless mesh
networks. The paper aims to ease the job of a new researcher by exposing him to
the state of the art research issues on IDS. Nearly 80% of the works cited in
this paper are published with in last 3 to 4 years.
","[{'version': 'v1', 'created': 'Tue, 30 Aug 2011 16:50:55 GMT'}]",2011-08-31,"[['Deb', 'Novarun', ''], ['Chakraborty', 'Manali', ''], ['Chaki', 'Nabendu', '']]","['Intrusion', 'Intrusion detection systems', 'trust', 'MANET', 'wireless mesh network']"
15860,1203.1633,Nathaniel Johnston,Nathaniel Johnston,The Complexity of the Puzzles of Final Fantasy XIII-2,"16 pages, 9 figures",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze the computational complexity of solving the three ""temporal rift""
puzzles in the recent popular video game Final Fantasy XIII-2. We show that the
Tile Trial puzzle is NP-hard and we provide an efficient algorithm for solving
the Crystal Bonds puzzle. We also show that slight generalizations of the
Crystal Bonds and Hands of Time puzzles are NP-hard.
","[{'version': 'v1', 'created': 'Wed, 7 Mar 2012 21:05:24 GMT'}]",2012-03-09,"[['Johnston', 'Nathaniel', '']]","['Hamiltonian paths', 'video games', 'puzzles', 'grid graphs', 'computational complexity']"
15861,1701.03379,Pik Lik Lau Billy,"Billy Pik Lik Lau, Marakkalage Sumudu Hasala, Viswanath Sanjana
  Kadaba, Balasubramaniam Thirunavukarasu, Chau Yuen, Belinda Yuen, Richi Nayak","Extracting Point of Interest and Classifying Environment for Low
  Sampling Crowd Sensing Smartphone Sensor Data","in 2017 IEEE International Conference on Pervasive Computing and
  Communication Workshops (PerCom Workshops), At Kona, Big Island, Hawaii, USA",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The advancement of smartphones with various type of sensors enabled us to
harness diverse information with crowd sensing mobile application. However,
traditional approaches have suffered drawbacks such as high battery consumption
as a trade off to obtain high accuracy data using high sampling rate. To
mitigate the battery consumption, we proposed low sampling point of interest
(POI) extraction framework, which is built upon validation based stay points
detection (VSPD) and sensor fusion based environment classification (SFEC). We
studied various of clustering algorithm and showed that density based spatial
clustering of application with noise(DBSCAN) algorithms produce most accurate
result among existing methods. The SFEC model is utilized for classifying the
indoor or outdoor environment of the POI clustered earlier by VSPD. Real world
data are collected, bench-marked using existing clustering method to denote
effectiveness of low sampling rate model in high noise spatial temporal data.
","[{'version': 'v1', 'created': 'Fri, 6 Jan 2017 02:09:54 GMT'}]",2017-01-13,"[['Lau', 'Billy Pik Lik', ''], ['Hasala', 'Marakkalage Sumudu', ''], ['Kadaba', 'Viswanath Sanjana', ''], ['Thirunavukarasu', 'Balasubramaniam', ''], ['Yuen', 'Chau', ''], ['Yuen', 'Belinda', ''], ['Nayak', 'Richi', '']]","['Big Data', 'POI', 'Clustering', 'Environment Classification', 'Trajectory', 'Sensor Fusion']"
15862,1306.0896,Sugata Sanyal,"Siby Abraham, Sugata Sanyal, Mukund Sanglikar","Finding Numerical Solutions of Diophantine Equations using Ant Colony
  Optimization","14 pages, 8 figures",,,,cs.NE cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper attempts to find numerical solutions of Diophantine equations, a
challenging problem as there are no general methods to find solutions of such
equations. It uses the metaphor of foraging habits of real ants. The ant colony
optimization based procedure starts with randomly assigned locations to a fixed
number of artificial ants. Depending upon the quality of these positions, ants
deposit pheromone at the nodes. A successor node is selected from the
topological neighborhood of each of the nodes based on this stochastic
pheromone deposit. If an ant bumps into an already encountered node, the
pheromone is updated correspondingly. A suitably defined pheromone evaporation
strategy guarantees that premature convergence does not take place. The
experimental results, which compares with those of other machine intelligence
techniques, validate the effectiveness of the proposed method.
","[{'version': 'v1', 'created': 'Tue, 4 Jun 2013 18:36:22 GMT'}]",2013-06-06,"[['Abraham', 'Siby', ''], ['Sanyal', 'Sugata', ''], ['Sanglikar', 'Mukund', '']]","['Ant Colony Optimization', 'Diophantine equation', 'Pheromone']"
15863,1609.05365,Nicolas Laurent,Nicolas Laurent and Kim Mens,Taming Context-Sensitive Languages with Principled Stateful Parsing,To appear in SLE 2016,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Historically, true context-sensitive parsing has seldom been applied to
programming languages, due to its inherent complexity. However, many mainstream
programming and markup languages (C, Haskell, Python, XML, and more) possess
context-sensitive features. These features are traditionally handled with
ad-hoc code (e.g., custom lexers), outside of the scope of parsing theory.
  Current grammar formalisms struggle to express context-sensitive features.
Most solutions lack context transparency: they make grammars hard to write,
maintain and compose by hardwiring context through the entire grammar. Instead,
we approach context-sensitive parsing through the idea that parsers may recall
previously matched input (or data derived therefrom) in order to make parsing
decisions. We make use of mutable parse state to enable this form of recall.
  We introduce principled stateful parsing as a new transactional discipline
that makes state changes transparent to parsing mechanisms such as backtracking
and memoization. To enforce this discipline, users specify parsers using
formally specified primitive state manipulation operations.
  Our solution is available as a parsing library named Autumn. We illustrate
our solution by implementing some practical context-sensitive grammar features
such as significant whitespace handling and namespace classification.
","[{'version': 'v1', 'created': 'Sat, 17 Sep 2016 17:09:42 GMT'}]",2016-09-20,"[['Laurent', 'Nicolas', ''], ['Mens', 'Kim', '']]","['stateful parsing', 'grammars', 'context sensitivity', 'data dependence', 'parsing expressions']"
15864,0711.3324,EDA Publishing Association,"Gy. Bognar, V. Szekely, M. Rencz","Contactless Thermal Characterization Method of PCB-s Using an IR Sensor
  Array","Submitted on behalf of TIMA Editions
  (http://irevues.inist.fr/tima-editions)","Dans Symposium on Design, Test, Integration and Packaging of
  MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)",,,cs.OH,,"  In this paper the feasibility study of an IR sensor card is presented. The
methodology and the results of a quasi real-time thermal characterization tool
and method for the temperature mapping of circuits and boards based on sensing
the infrared radiation is introduced. With the proposed method the IR
radiation-distribution of boards from the close proximity of the sensor card is
monitored in quasi real-time. The proposed method is enabling in situ IR
measurement among operating cards of a system e.g. in a rack.
","[{'version': 'v1', 'created': 'Wed, 21 Nov 2007 10:09:20 GMT'}]",2007-11-29,"[['Bognar', 'Gy.', ''], ['Szekely', 'V.', ''], ['Rencz', 'M.', '']]","['IR sensors', 'infrared radiation', 'temperature mapping']"
15865,1203.0442,Liyong Shen,"Liyong shen, Jin-san Cheng, Xiaohong Jia","Homeomorphic approximation of the intersection curve of two rational
  surfaces","18 pages,15 figures",,,,cs.CG math.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an approach of computing the intersection curve $\mathcal{C}$ of
two rational parametric surface $\S_1(u,s)$ and $\S_2(v,t)$, one being
projectable and hence can easily be implicitized. Plugging the parametric
surface to the implicit surface yields a plane algebraic curve $G(v,t)=0$. By
analyzing the topology graph $\G$ of $G(v,t)=0$ and the singular points on the
intersection curve $\mathcal{C}$ we associate a space topology graph to
$\mathcal{C}$, which is homeomorphic to $\mathcal{C}$ and therefore leads us to
an approximation for $\mathcal{C}$ in a given precision.
","[{'version': 'v1', 'created': 'Fri, 2 Mar 2012 12:23:34 GMT'}]",2012-03-05,"[['shen', 'Liyong', ''], ['Cheng', 'Jin-san', ''], ['Jia', 'Xiaohong', '']]","['Surface/surface intersection', 'projectable surface', 'topology graph', 'homeomorphic approximation', 'geometric features']"
15866,2007.05312,Yunior Ram\'irez-Cruz,"Sjouke Mauw, Yunior Ram\'irez-Cruz, Rolando Trujillo-Rasua","Preventing active re-identification attacks on social graphs via sybil
  subgraph obfuscation",,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses active re-identification attacks in the context of
privacy-preserving social graph publication. Active attacks are those where the
adversary can leverage fake accounts, a.k.a. sybil nodes, to enforce structural
patterns that can be used to re-identify their victims on anonymised graphs. In
this paper we present a new probabilistic interpretation of this type of
attacks. Unlike previous privacy properties, which model the protection from
active adversaries as the task of making victim nodes indistinguishable in
terms of their fingerprints with respect to all potential attackers, our new
formulation introduces a more complete view, where the attack is countered by
jointly preventing the attacker from retrieving the set of sybil nodes, and
from using these sybil nodes for re-identifying the victims. Under the new
formulation, we show that the privacy property $k$-symmetry, introduced in the
context of passive attacks, provides a sufficient condition for the protection
against active re-identification attacks leveraging an arbitrary number of
sybil nodes. Moreover, we show that the algorithm K-Match, originally devised
for efficiently enforcing the related notion of $k$-automorphism, also
guarantees $k$-symmetry. Empirical results on several collections of synthetic
graphs corroborate that our approach allows, for the first time, to publish
anonymised social graphs (with formal privacy guarantees) that effectively
resist the strongest active re-identification attack reported in the
literature, even when it leverages a large number of sybil nodes.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 11:21:02 GMT'}]",2020-07-13,"[['Mauw', 'Sjouke', ''], ['Ramírez-Cruz', 'Yunior', ''], ['Trujillo-Rasua', 'Rolando', '']]","['private social graph publication', 'anonymisation', 'active adversaries']"
15867,1512.01808,Tomasz Gogacz,"Tomasz Gogacz, Szymon Toru\'nczyk",Entropy bounds for conjunctive queries with functional dependencies,,,,,cs.DB,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We study the problem of finding the worst-case bound for the size of the
result $Q(\mathbb{ D})$ of a fixed conjunctive query $Q$ applied to a database
$\mathbb{ D}$ satisfying given functional dependencies. We provide a precise
characterization of this bound in terms of entropy vectors, and in terms of
finite groups. In particular, we show that an upper bound provided by Gottlob,
Lee, Valiant and Valiant is tight, answering a question from their paper. Our
result generalizes the bound due to Atserias, Grohe and Marx, who consider the
case without functional dependencies. Our result shows that the problem of
computing the worst-case size bound, in the general case, is closely related to
difficult problems from information theory.
","[{'version': 'v1', 'created': 'Sun, 6 Dec 2015 17:15:38 GMT'}]",2015-12-08,"[['Gogacz', 'Tomasz', ''], ['Toruńczyk', 'Szymon', '']]","['Entropy', 'Query size', 'Conjunctive queries', 'Size bounds', 'Entropy cone', 'finite groups']"
15868,1009.2305,Xiangqiong Shi,"Xiangqiong Shi, Dan Schonfeld, Daniela Tuninetti","Message Error Analysis of Loopy Belief Propagation for the Sum-Product
  Algorithm","36 pages, 10 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Belief propagation is known to perform extremely well in many practical
statistical inference and learning problems using graphical models, even in the
presence of multiple loops. The iterative use of belief propagation algorithm
on loopy graphs is referred to as Loopy Belief Propagation (LBP). Various
sufficient conditions for convergence of LBP have been presented; however,
general necessary conditions for its convergence to a unique fixed point remain
unknown. Because the approximation of beliefs to true marginal probabilities
has been shown to relate to the convergence of LBP, several methods have been
explored whose aim is to obtain distance bounds on beliefs when LBP fails to
converge. In this paper, we derive uniform and non-uniform error bounds on
messages, which are tighter than existing ones in literature, and use these
bounds to derive sufficient conditions for the convergence of LBP in terms of
the sum-product algorithm. We subsequently use these bounds to study the
dynamic behavior of the sum-product algorithm, and analyze the relation between
convergence of LBP and sparsity and walk-summability of graphical models. We
finally use the bounds derived to investigate the accuracy of LBP, as well as
the scheduling priority in asynchronous LBP.
","[{'version': 'v1', 'created': 'Mon, 13 Sep 2010 06:32:29 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Oct 2011 20:31:09 GMT'}, {'version': 'v3', 'created': 'Tue, 12 Feb 2013 01:59:00 GMT'}]",2013-02-13,"[['Shi', 'Xiangqiong', ''], ['Schonfeld', 'Dan', ''], ['Tuninetti', 'Daniela', '']]","['Graphical Model', 'Bayesian Networks', 'Markov Random Fields', 'Loopy BeliefPropagation', 'Error Analysis']"
15869,1802.08148,Diego Moussallem,"Diego Moussallem, Mohamed Ahmed Sherif, Diego Esteves, Marcos Zampieri
  and Axel-Cyrille Ngonga Ngomo",LIDIOMS: A Multilingual Linked Idioms Data Set,"Accepted for publication in Language Resources and Evaluation
  Conference (LREC) 2018",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we describe the LIDIOMS data set, a multilingual RDF
representation of idioms currently containing five languages: English, German,
Italian, Portuguese, and Russian. The data set is intended to support natural
language processing applications by providing links between idioms across
languages. The underlying data was crawled and integrated from various sources.
To ensure the quality of the crawled data, all idioms were evaluated by at
least two native speakers. Herein, we present the model devised for structuring
the data. We also provide the details of linking LIDIOMS to well-known
multilingual data sets such as BabelNet. The resulting data set complies with
best practices according to Linguistic Linked Open Data Community.
","[{'version': 'v1', 'created': 'Thu, 22 Feb 2018 16:38:40 GMT'}]",2018-02-23,"[['Moussallem', 'Diego', ''], ['Sherif', 'Mohamed Ahmed', ''], ['Esteves', 'Diego', ''], ['Zampieri', 'Marcos', ''], ['Ngomo', 'Axel-Cyrille Ngonga', '']]","['multilingual', 'idioms', 'translation']"
15870,1704.06980,Marcin Bienkowski,"Marcin Bienkowski, Artur Kraska, Pawe{\l} Schmidt",A Match in Time Saves Nine: Deterministic Online Matching With Delays,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of online Min-cost Perfect Matching with Delays
(MPMD) introduced by Emek et al. (STOC 2016). In this problem, an even number
of requests appear in a metric space at different times and the goal of an
online algorithm is to match them in pairs. In contrast to traditional online
matching problems, in MPMD all requests appear online and an algorithm can
match any pair of requests, but such decision may be delayed (e.g., to find a
better match). The cost is the sum of matching distances and the introduced
delays.
  We present the first deterministic online algorithm for this problem. Its
competitive ratio is $O(m^{\log_2 5.5})$ $ = O(m^{2.46})$, where $2 m$ is the
number of requests. This is polynomial in the number of metric space points if
all requests are given at different points. In particular, the bound does not
depend on other parameters of the metric, such as its aspect ratio. Unlike
previous (randomized) solutions for the MPMD problem, our algorithm does not
need to know the metric space in advance.
","[{'version': 'v1', 'created': 'Sun, 23 Apr 2017 20:53:36 GMT'}]",2017-04-25,"[['Bienkowski', 'Marcin', ''], ['Kraska', 'Artur', ''], ['Schmidt', 'Paweł', '']]","['online matching', 'delays', 'rent-or-buy', 'competitive analysis']"
15871,1502.05292,Gabriele Farina,Gabriele Farina and Luigi Laura,Dynamic subtrees queries revisited: the Depth First Tour Tree,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the dynamic tree problem the goal is the maintenance of an arbitrary
n-vertex forest, where the trees are subject to joining and splitting by,
respectively, adding and removing edges. Depending on the application,
information can be associated to nodes or edges (or both), and queries might
require to combine values in path or (sub)trees.
  In this paper we present a novel data structure, called the Depth First Tour
Tree, based on a linearization of a DFS visit of the tree. Despite the
simplicity of the approach, similar to the ET-Trees (based on a Euler Tour),
our data structure is able to answer queries related to both paths and
(sub)trees. In particular, focusing on subtree computations, we show how to
customize the data structure in order to answer queries for three distinct
applications: impact of the removal of an articulation point from a graph,
betweenness centrality and closeness centrality of a dynamic tree.
","[{'version': 'v1', 'created': 'Wed, 18 Feb 2015 16:32:59 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Sep 2015 14:15:43 GMT'}, {'version': 'v3', 'created': 'Tue, 22 Sep 2015 13:11:16 GMT'}]",2015-09-23,"[['Farina', 'Gabriele', ''], ['Laura', 'Luigi', '']]","['Graph Algorithms', 'Dynamic Tree', 'Betweenness Centrality']"
15872,1206.5327,Carroline Dewi Puspa  Kencana Ramli,"Carroline Dewi Puspa Kencana Ramli, Hanne Riis Nielson, Flemming
  Nielson",XACML 3.0 in Answer Set Programming,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a systematic technique for transforming XACML 3.0 policies in
Answer Set Programming (ASP). We show that the resulting logic program has a
unique answer set that directly corresponds to our formalisation of the
standard semantics of XACML 3.0 from Ramli et. al. We demonstrate how our
results make it possible to use off-the-shelf ASP solvers to formally verify
properties of access control policies represented in XACML, such as checking
the completeness of a set of access control policies and verifying policy
properties.
","[{'version': 'v1', 'created': 'Fri, 22 Jun 2012 21:59:14 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Feb 2013 17:35:04 GMT'}]",2015-03-11,"[['Ramli', 'Carroline Dewi Puspa Kencana', ''], ['Nielson', 'Hanne Riis', ''], ['Nielson', 'Flemming', '']]","['XACML', 'access control', 'policy language', 'Answer Set Programming']"
15873,1610.02606,Mike Fagan,"Sven Leyffer (1), Stefan M. Wild (1), Mike Fagan (2), Marc Snir (3),
  Krishna Palem (2), Kazutomo Yoshii (1) and Hal Finkel (4) ((1) Mathematics
  and Computer Science Division/Argonne National Laboratory, (2) Department of
  Computer Science/Rice University, (3) Department of Computer
  Science/University of Illinois at Urbana-Champaign, (4) Argonne Leadership
  Computing Facility (ALCF)/Argonne National Laboratory)","Doing Moore with Less -- Leapfrogging Moore's Law with Inexactness for
  Supercomputing","9 pages, 12 figures, PDFLaTeX. 12 Oct 2016: Corrected author Hal
  Finkel's affiliation to show ALCF/Argonne",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Energy and power consumption are major limitations to continued scaling of
computing systems. Inexactness, where the quality of the solution can be traded
for energy savings, has been proposed as an approach to overcoming those
limitations. In the past, however, inexactness necessitated the need for highly
customized or specialized hardware. The current evolution of commercial
off-the-shelf(COTS) processors facilitates the use of lower-precision
arithmetic in ways that reduce energy consumption. We study these new
opportunities in this paper, using the example of an inexact Newton algorithm
for solving nonlinear equations. Moreover, we have begun developing a set of
techniques we call reinvestment that, paradoxically, use reduced precision to
improve the quality of the computed result: They do so by reinvesting the
energy saved by reduced precision.
","[{'version': 'v1', 'created': 'Sun, 9 Oct 2016 01:00:48 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Oct 2016 15:50:35 GMT'}]",2016-10-13,"[['Leyffer', 'Sven', ''], ['Wild', 'Stefan M.', ''], ['Fagan', 'Mike', ''], ['Snir', 'Marc', ''], ['Palem', 'Krishna', ''], ['Yoshii', 'Kazutomo', ''], ['Finkel', 'Hal', '']]","['High-Performance Computing', 'Inexact Newton', 'Iterative Methods', 'Energy-Efficient Computing', 'Reduced-PrecisionComputing']"
15874,1605.02123,Philippe Jacquet,Philippe Jacquet and Wojciech Szpankowski,Average Size of a Suffix Tree for Markov Sources,AofA 2016 Conference,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study a suffix tree built from a sequence generated by a Markovian source.
Such sources are more realistic probabilistic models for text generation, data
compression, molecular applications, and so forth. We prove that the average
size of such a suffix tree is asymptotically equivalent to the average size of
a trie built over $n$ independent sequences from the same Markovian source.
This equivalence is only known for memoryless sources. We then derive a formula
for the size of a trie under Markovian model to complete the analysis for
suffix trees. We accomplish our goal by applying some novel techniques of
analytic combinatorics on words also known as analytic pattern matching.
","[{'version': 'v1', 'created': 'Sat, 7 May 2016 00:53:54 GMT'}]",2016-05-10,"[['Jacquet', 'Philippe', ''], ['Szpankowski', 'Wojciech', '']]","['Suffix tree', 'Markov sources', 'digital trees', 'size', 'pattern matching', 'number of occurrences']"
15875,1206.1714,Markus Pfeiffer,"Max Neunh\""offer, Markus Pfeiffer, Nik Ruskuc",Deciding Word Problems of Semigroups using Finite State Automata,,,,,cs.FL math.CO math.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore a natural class of semigroups that have word problem decidable by
finite state automata. Among the main results are invariance of this property
under change of generators, invariance under basic algebraic constructions and
algebraic properties of these semigroups.
","[{'version': 'v1', 'created': 'Fri, 8 Jun 2012 09:54:55 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Jun 2012 11:06:20 GMT'}, {'version': 'v3', 'created': 'Thu, 30 May 2013 13:09:54 GMT'}, {'version': 'v4', 'created': 'Wed, 16 Oct 2019 15:20:11 GMT'}]",2019-10-17,"[['Neunhöffer', 'Max', ''], ['Pfeiffer', 'Markus', ''], ['Ruskuc', 'Nik', '']]","['finite state automata', 'rational relations', 'semigroups', 'wordproblems']"
15876,1701.07570,Lijun Zhang,"Lijun Zhang, Tianbao Yang, Rong Jin, Zhi-Hua Zhou",Dynamic Regret of Strongly Adaptive Methods,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To cope with changing environments, recent developments in online learning
have introduced the concepts of adaptive regret and dynamic regret
independently. In this paper, we illustrate an intrinsic connection between
these two concepts by showing that the dynamic regret can be expressed in terms
of the adaptive regret and the functional variation. This observation implies
that strongly adaptive algorithms can be directly leveraged to minimize the
dynamic regret. As a result, we present a series of strongly adaptive
algorithms that have small dynamic regrets for convex functions, exponentially
concave functions, and strongly convex functions, respectively. To the best of
our knowledge, this is the first time that exponential concavity is utilized to
upper bound the dynamic regret. Moreover, all of those adaptive algorithms do
not need any prior knowledge of the functional variation, which is a
significant advantage over previous specialized methods for minimizing dynamic
regret.
","[{'version': 'v1', 'created': 'Thu, 26 Jan 2017 03:54:21 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Feb 2017 15:12:55 GMT'}, {'version': 'v3', 'created': 'Mon, 4 Jun 2018 13:03:22 GMT'}]",2018-06-05,"[['Zhang', 'Lijun', ''], ['Yang', 'Tianbao', ''], ['Jin', 'Rong', ''], ['Zhou', 'Zhi-Hua', '']]","['Online convex optimization', 'Adaptive regret', 'Dynamic regret']"
15877,1407.1123,Mehrtash Harandi,"Mehrtash T. Harandi and Mathieu Salzmann and Sadeep Jayasumana and
  Richard Hartley and Hongdong Li",Expanding the Family of Grassmannian Kernels: An Embedding Perspective,,,,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modeling videos and image-sets as linear subspaces has proven beneficial for
many visual recognition tasks. However, it also incurs challenges arising from
the fact that linear subspaces do not obey Euclidean geometry, but lie on a
special type of Riemannian manifolds known as Grassmannian. To leverage the
techniques developed for Euclidean spaces (e.g, support vector machines) with
subspaces, several recent studies have proposed to embed the Grassmannian into
a Hilbert space by making use of a positive definite kernel. Unfortunately,
only two Grassmannian kernels are known, none of which -as we will show- is
universal, which limits their ability to approximate a target function
arbitrarily well. Here, we introduce several positive definite Grassmannian
kernels, including universal ones, and demonstrate their superiority over
previously-known kernels in various tasks, such as classification, clustering,
sparse coding and hashing.
","[{'version': 'v1', 'created': 'Fri, 4 Jul 2014 05:34:38 GMT'}]",2014-07-07,"[['Harandi', 'Mehrtash T.', ''], ['Salzmann', 'Mathieu', ''], ['Jayasumana', 'Sadeep', ''], ['Hartley', 'Richard', ''], ['Li', 'Hongdong', '']]","['Grassmann manifolds', 'kernel methods', 'Pl¨ucker embedding']"
15878,1511.03759,Chuan Shi,"Chuan Shi, Jian Liu, Fuzhen Zhuang, Philip S. Yu, Bin Wu","Integrating Heterogeneous Information via Flexible Regularization
  Framework for Recommendation","12 pages, 5 figures",,,,cs.SI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, there is a surge of social recommendation, which leverages social
relations among users to improve recommendation performance. However, in many
applications, social relations are absent or very sparse. Meanwhile, the
attribute information of users or items may be rich. It is a big challenge to
exploit these attribute information for the improvement of recommendation
performance. In this paper, we organize objects and relations in recommendation
system as a heterogeneous information network, and introduce meta path based
similarity measure to evaluate the similarity of users or items. Furthermore, a
matrix factorization based dual regularization framework SimMF is proposed to
flexibly integrate different types of information through adopting the
similarity of users and items as regularization on latent factors of users and
items. Extensive experiments not only validate the effectiveness of SimMF but
also reveal some interesting findings. We find that attribute information of
users and items can significantly improve recommendation accuracy, and their
contribution seems more important than that of social relations. The
experiments also reveal that different regularization models have obviously
different impact on users and items.
","[{'version': 'v1', 'created': 'Thu, 12 Nov 2015 02:20:53 GMT'}]",2015-11-13,"[['Shi', 'Chuan', ''], ['Liu', 'Jian', ''], ['Zhuang', 'Fuzhen', ''], ['Yu', 'Philip S.', ''], ['Wu', 'Bin', '']]","['Recommendation system', 'heterogeneous information network', 'matrix factorization', 'similarity measure']"
15879,1011.2538,Scott Carter,"Scott Carter, Laurent Denoue, John Adcock","mVideoCast: Mobile, real time ROI detection and streaming",,,,FXPAL-TR-10-003,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A variety of applications are emerging to support streaming video from mobile
devices. However, many tasks can benefit from streaming specific content rather
than the full video feed which may include irrelevant, private, or distracting
content. We describe a system that allows users to capture and stream targeted
video content captured with a mobile device. The application incorporates a
variety of automatic and interactive techniques to identify and segment desired
content in the camera view, allowing the user to publish a more focused video.
","[{'version': 'v1', 'created': 'Thu, 11 Nov 2010 00:28:34 GMT'}]",2010-11-12,"[['Carter', 'Scott', ''], ['Denoue', 'Laurent', ''], ['Adcock', 'John', '']]","['Mobile', 'multimedia', 'capture']"
15880,1504.01459,Marek Suchenek,Marek A. Suchenek,"A Complete Worst-Case Analysis of Heapsort with Experimental
  Verification of Its Results, A manuscript (MS)",115 pages 41 figures,,,,cs.DS cs.CC cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A rigorous proof is presented that the number of comparisons of keys
performed in the worst case by ${\tt Heapsort}$ on any array of size $N \geq 2$
is equal to: $ 2 (N-1)\, ( \, \lg \frac{N-1}{2} +\varepsilon \, ) - 2s_2(N) -
e_2(N) + \min (\lfloor \lg (N-1) \rfloor, 2) + 6 + c, $ where $ \varepsilon $,
given by: $\varepsilon = 1 + \lceil \lg \, (N-1) \rceil - \lg \, (N-1) -
2^{\lceil \lg \, (N-1) \rceil - \lg \, (N-1)} ,$ is a function of $ N $ with
the minimum value 0 and and the supremum value $\delta = 1 - \lg e + \lg \lg e
\approx 0.0860713320559342$, $s_2(N)$ is the sum of all digits of the binary
representation of $N$, $e_2(N)$ is the exponent of $2$ in the prime
factorization of $N$, and $ c $ is a binary function on the set of integers
defined by: $c = 1$, if $N \leq 2 ^{\lceil \lg N \rceil} - 4$, and $c = 0$,
otherwise. An algorithm that generates worst-case input arrays of any size $ N
\geq 2 $ for ${\tt Heapsort}$ is offered. The algorithm has been implemented in
Java, runs in $O( N \log N )$ time, and allows for precise experimental
verification of the above formula.
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2015 02:07:00 GMT'}]",2017-03-07,"[['Suchenek', 'Marek A.', '']]","['Heap', 'heapsort', 'sorting', 'sum of digits', 'worst case']"
15881,1406.3240,Yi Wen tan,"Wentan Yi, Shaozhen Chen and Kuanyang Wei","Zero-Correlation Linear Cryptanalysis of Reduced Round ARIA with
  Partial-sum and FFT",arXiv admin note: text overlap with arXiv:1404.6100,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Block cipher ARIA was first proposed by some South Korean experts in 2003,
and later, it was established as a Korean Standard block cipher algorithm by
Korean Agency for Technology and Standards. In this paper, we focus on the
security evaluation of ARIA block cipher against the recent zero-correlation
linear cryptanalysis. In addition, Partial-sum technique and FFT (Fast Fourier
Transform) technique are used to speed up the cryptanalysis, respectively.
  We first introduce some 4-round linear approximations of ARIA with
zero-correlation, and then present some key-recovery attacks on 6/7-round
ARIA-128/256 with Partial-sum technique and FFT technique.The key-recovery
attack with Partial-sum technique on 6-round ARIA-128 needs 2^{123.6}known
plaintexts (KPs), 2^{121} encryptions and 2^{90.3} bytes memory, and the attack
with FFT technique requires 2^{124.1} KPs, 2^{121.5} encryptions and
2^{90.3}bytes memory. Moreover, applying Partial-sum technique, we can attack
7-round ARIA-256 with 2^{124.6} KPs, 2^{203.5} encryptions and 2^{152} bytes
and 7-round ARIA-256 employing FFT technique, requires 2^{124.7} KPs, 2^{209.5}
encryptions and 2^{152} bytes. Our results are the first zero-correlation
linear cryptanalysis results on ARIA.
","[{'version': 'v1', 'created': 'Thu, 12 Jun 2014 13:42:18 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Jun 2014 00:08:31 GMT'}]",2014-06-18,"[['Yi', 'Wentan', ''], ['Chen', 'Shaozhen', ''], ['Wei', 'Kuanyang', '']]","['ARIA', 'Zero-correlation linear cryptanalysis', 'Partial-sum', 'FFT', 'Cryptography']"
15882,2007.05719,Yuexin Ma,"Yuexin Ma, Xinge ZHU, Xinjing Cheng, Ruigang Yang, Jiming Liu, Dinesh
  Manocha","AutoTrajectory: Label-free Trajectory Extraction and Prediction from
  Videos using Dynamic Points",,ECCV 2020,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current methods for trajectory prediction operate in supervised manners, and
therefore require vast quantities of corresponding ground truth data for
training. In this paper, we present a novel, label-free algorithm,
AutoTrajectory, for trajectory extraction and prediction to use raw videos
directly. To better capture the moving objects in videos, we introduce dynamic
points. We use them to model dynamic motions by using a forward-backward
extractor to keep temporal consistency and using image reconstruction to keep
spatial consistency in an unsupervised manner. Then we aggregate dynamic points
to instance points, which stand for moving objects such as pedestrians in
videos. Finally, we extract trajectories by matching instance points for
prediction training. To the best of our knowledge, our method is the first to
achieve unsupervised learning of trajectory extraction and prediction. We
evaluate the performance on well-known trajectory datasets and show that our
method is effective for real-world videos and can use raw videos to further
improve the performance of existing models.
","[{'version': 'v1', 'created': 'Sat, 11 Jul 2020 08:43:34 GMT'}]",2020-07-14,"[['Ma', 'Yuexin', ''], ['ZHU', 'Xinge', ''], ['Cheng', 'Xinjing', ''], ['Yang', 'Ruigang', ''], ['Liu', 'Jiming', ''], ['Manocha', 'Dinesh', '']]","['unsupervised learning', 'trajectory extraction', 'trajectory prediction']"
15883,1412.8529,Jose Hernandez-Orallo,Jose Hernandez-Orallo,A note about the generalisation of the C-tests,16 pages,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this exploratory note we ask the question of what a measure of performance
for all tasks is like if we use a weighting of tasks based on a difficulty
function. This difficulty function depends on the complexity of the
(acceptable) solution for the task (instead of a universal distribution over
tasks or an adaptive test). The resulting aggregations and decompositions are
(now retrospectively) seen as the natural (and trivial) interactive
generalisation of the C-tests.
","[{'version': 'v1', 'created': 'Tue, 30 Dec 2014 01:48:10 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Mar 2015 00:27:30 GMT'}]",2015-03-27,"[['Hernandez-Orallo', 'Jose', '']]","['Intelligence evaluation', 'artificial intelligence', 'C-tests', 'algorithmic information theory', 'universal psychometrics', 'agent response curve']"
15884,1511.02240,Lasse Natvig,"Lasse Natvig, Torbj{\o}rn Follan, Simen St{\o}a, Sindre Magnussen and
  Antonio Garcia Guirado","Climbing Mont Blanc - A Training Site for Energy Efficient Programming
  on Heterogeneous Multicore Processors","4 pages, 5 figures",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Climbing Mont Blanc (CMB) is an open online judge used for training in energy
efficient programming of state-of-the-art heterogeneous multicores. It uses an
Odroid-XU3 board from Hardkernel with an Exynos Octa processor and integrated
power sensors. This processor is three-way heterogeneous containing 14
different cores of three different types. The board currently accepts C and C++
programs, with support for OpenCL v1.1, OpenMP 4.0 and Pthreads. Programs
submitted using the graphical user interface are evaluated with respect to
time, energy used, and energy-efficiency (EDP). A small and varied set of
problems are available, and the system is currently in use in a medium sized
course on parallel computing at NTNU. Other online programming judges exist,
but we are not aware of any similar system that also reports energy-efficiency.
","[{'version': 'v1', 'created': 'Fri, 6 Nov 2015 21:15:53 GMT'}]",2015-11-10,"[['Natvig', 'Lasse', ''], ['Follan', 'Torbjørn', ''], ['Støa', 'Simen', ''], ['Magnussen', 'Sindre', ''], ['Guirado', 'Antonio Garcia', '']]","['Heterogeneous multicore', 'Exynos processor', 'energy efficient programming', 'programming competition']"
15885,1610.03184,James Harland,James Harland,Generating Candidate Busy Beaver Machines (Or How to Build the Zany Zoo),,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The busy beaver problem is a well-known example of a non-computable function.
In order to determine a particular value of this function, it is necessary to
generate and classify a large number of Turing machines. Previous work on this
problem has described the processes used for the generation and classification
of these machines, but unfortunately has generally not provided details of the
machines considered. While there is no reason to doubt the veracity of the
results known so far, it is difficult to accept such results as scientifically
proven without being able to inspect the appropriate evidence. In addition, a
list of machines and their classifications can be used for other results, such
as variations on the busy beaver problem and related problems such as the
placid platypus problem. In this paper we investigate how to generate classes
of machines to be considered for the busy beaver problem. We discuss the
relationship between quadruple and quintuple variants of Turing machines, and
show that the latter are more general than the former. We give some formal
results to justify our strategy for minimising the number of machines
generated, and define a process reflecting this strategy for generating
machines. We describe our implementation, and the results of generating various
classes of machines with up to 5 states or up to 5 symbols, all of which
(together with our code) are available on the author's website.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2016 04:41:02 GMT'}]",2016-10-12,"[['Harland', 'James', '']]","['Busy beaver', 'Turing machines', 'normal forms']"
15886,1109.2304,Chris Russell,"Srikumar Ramalingam and Chris Russell and Lubor Ladicky and Philip
  H.S. Torr","Efficient Minimization of Higher Order Submodular Functions using
  Monotonic Boolean Functions",,,,,cs.DS cs.CV cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Submodular function minimization is a key problem in a wide variety of
applications in machine learning, economics, game theory, computer vision, and
many others. The general solver has a complexity of $O(n^3 \log^2 n . E +n^4
{\log}^{O(1)} n)$ where $E$ is the time required to evaluate the function and
$n$ is the number of variables \cite{Lee2015}. On the other hand, many computer
vision and machine learning problems are defined over special subclasses of
submodular functions that can be written as the sum of many submodular cost
functions defined over cliques containing few variables. In such functions, the
pseudo-Boolean (or polynomial) representation \cite{BorosH02} of these
subclasses are of degree (or order, or clique size) $k$ where $k \ll n$. In
this work, we develop efficient algorithms for the minimization of this useful
subclass of submodular functions. To do this, we define novel mapping that
transform submodular functions of order $k$ into quadratic ones. The underlying
idea is to use auxiliary variables to model the higher order terms and the
transformation is found using a carefully constructed linear program. In
particular, we model the auxiliary variables as monotonic Boolean functions,
allowing us to obtain a compact transformation using as few auxiliary variables
as possible.
","[{'version': 'v1', 'created': 'Sun, 11 Sep 2011 10:58:44 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Jan 2017 19:10:05 GMT'}]",2017-01-25,"[['Ramalingam', 'Srikumar', ''], ['Russell', 'Chris', ''], ['Ladicky', 'Lubor', ''], ['Torr', 'Philip H. S.', '']]","['submodular functions', 'quadratic pseudo-Boolean functions', 'monotonic Boolean functions', 'Dedekind number', 'max-flow/mincut algorithm']"
15887,1307.4129,Atta ur Rehman Khan,"Atta ur Rehman Khana, Sardar M. Bilalb, Mazliza Othmana",A Performance Comparison of Network Simulators for Wireless Networks,,,,,cs.NI cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network simulation is the most useful and common methodology used to evaluate
different network to-pologies without real world implementation. Network
simulators are widely used by the research community to evaluate new theories
and hypotheses. There are a number of network simulators, for instance, ns-2,
ns-3, OMNET++, SWAN, OPNET, Jist, and GloMoSiM etc. Therefore, the selection of
a network simulator for evaluating research work is a crucial task for
researchers. The main focus of this paper is to compare the state-of-the-art,
open source network simulators based on the following parameters: CPU
utilization, memory usage, computational time, and scalability by simulating a
MANET routing protocol, to identify an optimal network simulator for the
research community.
","[{'version': 'v1', 'created': 'Mon, 15 Jul 2013 23:09:06 GMT'}]",2013-07-17,"[['Khana', 'Atta ur Rehman', ''], ['Bilalb', 'Sardar M.', ''], ['Othmana', 'Mazliza', '']]","['Simulation', 'Network simulators', 'simulators comparison', 'MANET Routing Protocol']"
15888,1506.04131,Igor Korkin,Igor Korkin,"Two Challenges of Stealthy Hypervisors Detection: Time Cheating and Data
  Fluctuations","25 pages, 7 figures, 8 tables. Paper presented at the Proceedings of
  the 10th Annual Conference on Digital Forensics, Security and Law (CDFSL),
  33-57, Daytona Beach, Florida, USA (2015, May 18-21)",,,,cs.CR stat.AP stat.CO stat.OT,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Hardware virtualization technologies play a significant role in cyber
security. On the one hand these technologies enhance security levels, by
designing a trusted operating system. On the other hand these technologies can
be taken up into modern malware which is rather hard to detect. None of the
existing methods is able to efficiently detect a hypervisor in the face of
countermeasures such as time cheating, temporary self uninstalling, memory
hiding etc. New hypervisor detection methods which will be described in this
paper can detect a hypervisor under these countermeasures and even count
several nested ones. These novel approaches rely on the new statistical
analysis of time discrepancies by examination of a set of instructions, which
are unconditionally intercepted by a hypervisor. Reliability was achieved
through the comprehensive analysis of the collected data despite its
fluctuation. These offered methods were comprehensively assessed in both Intel
and AMD CPUs.
","[{'version': 'v1', 'created': 'Fri, 12 Jun 2015 19:50:33 GMT'}]",2015-06-15,"[['Korkin', 'Igor', '']]","['hypervisor threat', 'rootkit hypervisor', 'nested hypervisors', 'instruction execution time', 'statistics and data analysis', 'Blue Pill']"
15889,1207.5636,Archontia C. Giannopoulou,"Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros","Effective Computation of Immersion Obstructions for Unions of Graph
  Classes","An extended abstract of this paper has appeared in the proceedings of
  the 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2012)
  that took place in Helsinki, Finland",,,,cs.DS cs.CC cs.DM math.CO,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In the final paper of the Graph Minors series N. Robertson and P. Seymour
proved that graphs are well-quasi-ordered under the immersion ordering. A
direct implication of this theorem is that each class of graphs that is closed
under taking immersions can be fully characterized by forbidding a finite set
of graphs (immersion obstruction set). However, as the proof of the
well-quasi-ordering theorem is non-constructive, there is no generic procedure
for computing such a set. Moreover, it remains an open issue to identify for
which immersion-closed graph classes the computation of those sets can become
effective. By adapting the tools that were introduced by I. Adler, M. Grohe and
S. Kreutzer, for the effective computation of minor obstruction sets, we expand
the horizon of computability to immersion obstruction sets. In particular, our
results propagate the computability of immersion obstruction sets of
immersion-closed graph classes to immersion obstruction sets of finite unions
of immersion closed graph classes.
","[{'version': 'v1', 'created': 'Tue, 24 Jul 2012 09:43:09 GMT'}]",2015-03-20,"[['Giannopoulou', 'Archontia C.', ''], ['Salem', 'Iosif', ''], ['Zoros', 'Dimitris', '']]","['Immersions', 'Obstructions', 'Unique Linkage Theorem', 'Treewidth']"
15890,1710.06368,Zhiyu Sun,"Zhiyu Sun and Yusen He and Andrey Gritsenko and Amaury Lendasse and
  Stephen Baek","Embedded Spectral Descriptors: Learning the point-wise correspondence
  metric via Siamese neural networks",,,,,cs.GR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A robust and informative local shape descriptor plays an important role in
mesh registration. In this regard, spectral descriptors that are based on the
spectrum of the Laplace-Beltrami operator have been a popular subject of
research for the last decade due to their advantageous properties, such as
isometry invariance. Despite such, however, spectral descriptors often fail to
give a correct similarity measure for non-isometric cases where the metric
distortion between the models is large. Hence, they are not reliable for
correspondence matching problems when the models are not isometric. In this
paper, it is proposed a method to improve the similarity metric of spectral
descriptors for correspondence matching problems. We embed a spectral shape
descriptor into a different metric space where the Euclidean distance between
the elements directly indicates the geometric dissimilarity. We design and
train a Siamese neural network to find such an embedding, where the embedded
descriptors are promoted to rearrange based on the geometric similarity. We
demonstrate our approach can significantly enhance the performance of the
conventional spectral descriptors by the simple augmentation achieved via the
Siamese neural network in comparison to other state-of-the-art methods.
","[{'version': 'v1', 'created': 'Tue, 17 Oct 2017 16:26:04 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Jun 2018 21:30:24 GMT'}, {'version': 'v3', 'created': 'Fri, 18 Oct 2019 07:37:30 GMT'}]",2019-10-21,"[['Sun', 'Zhiyu', ''], ['He', 'Yusen', ''], ['Gritsenko', 'Andrey', ''], ['Lendasse', 'Amaury', ''], ['Baek', 'Stephen', '']]","['Siamese neural networks', 'Spectral shape descriptor', 'Point-wise correspondence']"
15891,1401.5183,Hamdi Al-Jamimi Mr.,Hamdi A. Al-Jamimi and Moataz Ahmed,"Transition from Analysis to Software Design: A Review and New
  Perspective",,,,,cs.SE,http://creativecommons.org/licenses/by/3.0/,"  Analysis and design phases are the most crucial part of the software
development life-cycle. Reusing the artifacts of these early phases is very
beneficial to improve the productivity and software quality. In this paper we
analyze the literature on the automatic transformation of artifacts from the
problem space (i.e., requirement analysis models) into artifacts in the
solution space (i.e., architecture, design and implementation code). The goal
is to assess the current state of the art with regard to the ability of
automatically reusing previously developed software designs in synthesizing a
new design for a given requirement. We surveyed various related areas such as
model-driven development and model transformation techniques. Our analysis
revealed that this topic has not been satisfactorily covered yet. Accordingly,
we propose a framework consists of three stages to address uncovered
limitations in current approaches.
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2014 05:29:35 GMT'}]",2014-01-22,"[['Al-Jamimi', 'Hamdi A.', ''], ['Ahmed', 'Moataz', '']]","['software analysis', 'software design', 'design reuse;']"
15892,0906.5062,Simant Dube,Simant Dube,"Geometrical Interpretation of the Master Theorem for Divide-and-conquer
  Recurrences","11 pages, 6 figures",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide geometrical interpretation of the Master Theorem to solve
divide-and-conquer recurrences. We show how different cases of the recurrences
correspond to different kinds of fractal images. Fractal dimension and
Hausdorff measure are shown to be closely related to the solution of such
recurrences.
","[{'version': 'v1', 'created': 'Mon, 29 Jun 2009 04:43:17 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Jul 2009 10:34:53 GMT'}]",2016-09-08,"[['Dube', 'Simant', '']]","['Divide-and-conquer recurrences', 'the Master Theorem', 'Fractal Geometry', 'Hausdorff Dimension', 'Hausdorff Measure', 'Fractal Dimension']"
15893,1009.2322,Yong Zhang,"Joseph Wun-Tat Chan, Francis Y.L. Chin, Xin Han, Ka-Cheong Lam,
  Hing-Fung Ting, and Yong Zhang","Deterministic Online Call Control in Cellular Networks and Triangle-Free
  Cellular Networks","12 pages, 4 figures",,,,cs.DS,http://creativecommons.org/licenses/by/3.0/,"  Wireless Communication Networks based on Frequency Division Multiplexing (FDM
in short) plays an important role in the field of communications, in which each
request can be satisfied by assigning a frequency. To avoid interference, each
assigned frequency must be different to the neighboring assigned frequencies.
Since frequency is a scarce resource, the main problem in wireless networks is
how to fully utilize the given bandwidth of frequencies. In this paper, we
consider the online call control problem. Given a fixed bandwidth of
frequencies and a sequence of communication requests arrive over time, each
request must be either satisfied immediately after its arrival by assigning an
available frequency, or rejected. The objective of call control problem is to
maximize the number of accepted requests. We study the asymptotic performance
of this problem, i.e., the number of requests in the sequence and the bandwidth
of frequencies are very large. In this paper, we give a 7/3-competitive
algorithm for call control problem in cellular network, improving the previous
2.5-competitive result. Moreover, we investigate the triangle-free cellular
network, propose a 9/4-competitive algorithm and prove that the lower bound of
competitive ratio is at least 5/3.
","[{'version': 'v1', 'created': 'Mon, 13 Sep 2010 08:36:19 GMT'}]",2010-09-14,"[['Chan', 'Joseph Wun-Tat', ''], ['Chin', 'Francis Y. L.', ''], ['Han', 'Xin', ''], ['Lam', 'Ka-Cheong', ''], ['Ting', 'Hing-Fung', ''], ['Zhang', 'Yong', '']]","['Online algorithms', 'Call control problem', 'Cellular networks', 'Triangle-free cellular network']"
15894,1603.08233,Randal Olson,"Randal S. Olson, Jason H. Moore, Christoph Adami","Evolution of active categorical image classification via saccadic eye
  movement","10 pages, 5 figures, to appear in PPSN 2016 conference proceedings",Lecture Notes in Computer Science 9921 (2016) 581-590,,,cs.CV cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pattern recognition and classification is a central concern for modern
information processing systems. In particular, one key challenge to image and
video classification has been that the computational cost of image processing
scales linearly with the number of pixels in the image or video. Here we
present an intelligent machine (the ""active categorical classifier,"" or ACC)
that is inspired by the saccadic movements of the eye, and is capable of
classifying images by selectively scanning only a portion of the image. We
harness evolutionary computation to optimize the ACC on the MNIST hand-written
digit classification task, and provide a proof-of-concept that the ACC works on
noisy multi-class data. We further analyze the ACC and demonstrate its ability
to classify images after viewing only a fraction of the pixels, and provide
insight on future research paths to further improve upon the ACC presented
here.
","[{'version': 'v1', 'created': 'Sun, 27 Mar 2016 16:36:43 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Jun 2016 21:00:53 GMT'}]",2016-12-07,"[['Olson', 'Randal S.', ''], ['Moore', 'Jason H.', ''], ['Adami', 'Christoph', '']]","['active categorical perception', 'attention-based processing', 'evolutionary computation', 'machine learning', 'supervised classification']"
15895,1610.07741,Farooq Aftab,Farooq Aftab,"Potentials and Challenges of Light Fidelity Based Indoor Communication
  System","11 pages , 3 figures","International Journal of New Computer Architectures and their
  Applications (IJNCAA),The Society of Digital Information and Wireless
  Communications, 2016 ISSN 2220-9085 (Online); ISSN 2412-3587 (Print)",,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  In this era of modern devices and high speed communication the issue of
spectral overloading is increasing with time and becoming more serious. With
the advancement in LED industry, light fidelity (Li-Fi) based indoor network is
an attractive substitute for the existing radio frequency (RF) based
communication networks. Because of its capability to perform dual function of
lighting as well as high speed communication, Li-Fi is attracting both
industrial as well as academic researchers. The Li-Fi networking paradigm
offers performance enhancements which can make it an attractive backup option
to be used for networking setup in Internet of things (IOT) and its indoor
capabilities make it an attractive choice for large scale indoor communication
in next generation wireless networking environment. This paper discusses key
potentials of Li-Fi based indoor communication system and point out the
challenges which indoor based Li-Fi network is facing under the knowledge of
existing research work in the field of Li-Fi.
","[{'version': 'v1', 'created': 'Tue, 25 Oct 2016 06:21:41 GMT'}]",2016-10-26,"[['Aftab', 'Farooq', '']]","['Li-Fi', 'Optical wireless communication', 'Indoor communications', 'Hybrid Wi-Fi and Li-Fi network']"
15896,1305.1707,Rushi Longadge,Rushi Longadge and Snehalata Dongre,Class Imbalance Problem in Data Mining Review,,,,,cs.LG,http://creativecommons.org/licenses/by/3.0/,"  In last few years there are major changes and evolution has been done on
classification of data. As the application area of technology is increases the
size of data also increases. Classification of data becomes difficult because
of unbounded size and imbalance nature of data. Class imbalance problem become
greatest issue in data mining. Imbalance problem occur where one of the two
classes having more sample than other classes. The most of algorithm are more
focusing on classification of major sample while ignoring or misclassifying
minority sample. The minority samples are those that rarely occur but very
important. There are different methods available for classification of
imbalance data set which is divided into three main categories, the algorithmic
approach, data-preprocessing approach and feature selection approach. Each of
this technique has their own advantages and disadvantages. In this paper
systematic study of each approach is define which gives the right direction for
research in class imbalance problem.
","[{'version': 'v1', 'created': 'Wed, 8 May 2013 03:39:17 GMT'}]",2013-05-09,"[['Longadge', 'Rushi', ''], ['Dongre', 'Snehalata', '']]","['Class imbalance problem', 'Skewed data', 'Imbalance data', 'rare class mining']"
15897,1407.3930,T.R. Gopalakrishnan Nair,"T.R. Gopalakrishnan Nair, Kavitha Sooda, Kavya B.S, Sushma M","Comparative performance analysis of AntHocNet and DSR in optimal path
  route determination","7 pages, 4 figures, 4 tables. arXiv admin note: text overlap with
  arXiv:1101.0209 by other authors","Anusandhana Journal, NMIT, Volume 1, Issue 2, December, 2012, pp
  1-7",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the key challenges in current Internet routing is the application of
improved bio-inspired algorithms in deriving the path towards the destination.
Current routing trends determine the optimal path based on throughput, delay or
combination of these two metric. Here in this paper, we compare the performance
of the two algorithms, AntHocNet (AHN) and Dynamic Source Routing (DSR) for
determining the routing path. We introduce the goodput factor as one of the
metric for determining the path. Goodput is the number of useful information
bits, delivered by the network to a certain destination per unit time .The
results show that AHN outperformed DSR in terms of end-to-end delay and
overhead. Also the simulation results showed that overhead of AHN was 20.67%
lesser than DSR.
","[{'version': 'v1', 'created': 'Tue, 15 Jul 2014 10:32:39 GMT'}]",2014-07-16,"[['Nair', 'T. R. Gopalakrishnan', ''], ['Sooda', 'Kavitha', ''], ['S', 'Kavya B.', ''], ['M', 'Sushma', '']]","['MANET', 'Ad-Hoc network', 'AntHocNet', 'Dynamic Source Routing', 'Goodput']"
15898,0905.2990,Juan-Manuel Torres-Moreno,"Juan-Manuel Torres-Moreno and Pier-Luc St-Onge and Michel Gagnon and
  Marc El-B\`eze and Patrice Bellot","Automatic Summarization System coupled with a Question-Answering System
  (QAAS)","28 pages, 11 figures",,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To select the most relevant sentences of a document, it uses an optimal
decision algorithm that combines several metrics. The metrics processes,
weighting and extract pertinence sentences by statistical and informational
algorithms. This technique might improve a Question-Answering system, whose
function is to provide an exact answer to a question in natural language. In
this paper, we present the results obtained by coupling the Cortex summarizer
with a Question-Answering system (QAAS). Two configurations have been
evaluated. In the first one, a low compression level is selected and the
summarization system is only used as a noise filter. In the second
configuration, the system actually functions as a summarizer, with a very high
level of compression. Our results on French corpus demonstrate that the
coupling of Automatic Summarization system with a Question-Answering system is
promising. Then the system has been adapted to generate a customized summary
depending on the specific question. Tests on a french multi-document corpus
have been realized, and the personalized QAAS system obtains the best
performances.
","[{'version': 'v1', 'created': 'Mon, 18 May 2009 21:35:52 GMT'}]",2009-05-20,"[['Torres-Moreno', 'Juan-Manuel', ''], ['St-Onge', 'Pier-Luc', ''], ['Gagnon', 'Michel', ''], ['El-Bèze', 'Marc', ''], ['Bellot', 'Patrice', '']]","['Automatic Summarization', 'Question-Answering systems', 'Text retrieval', 'Vector Space Model']"
15899,1412.5240,Shuai Zhang,"Shuai Zhang, and Jack Xin","Minimization of Transformed $L_1$ Penalty: Closed Form Representation
  and Iterative Thresholding Algorithms",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The transformed $l_1$ penalty (TL1) functions are a one parameter family of
bilinear transformations composed with the absolute value function. When acting
on vectors, the TL1 penalty interpolates $l_0$ and $l_1$ similar to $l_p$ norm
($p \in (0,1)$). In our companion paper, we showed that TL1 is a robust
sparsity promoting penalty in compressed sensing (CS) problems for a broad
range of incoherent and coherent sensing matrices. Here we develop an explicit
fixed point representation for the TL1 regularized minimization problem. The
TL1 thresholding functions are in closed form for all parameter values. In
contrast, the $l_p$ thresholding functions ($p \in [0,1]$) are in closed form
only for $p=0,1,1/2,2/3$, known as hard, soft, half, and 2/3 thresholding
respectively. The TL1 threshold values differ in subcritical (supercritical)
parameter regime where the TL1 threshold functions are continuous
(discontinuous) similar to soft-thresholding (half-thresholding) functions. We
propose TL1 iterative thresholding algorithms and compare them with hard and
half thresholding algorithms in CS test problems. For both incoherent and
coherent sensing matrices, a proposed TL1 iterative thresholding algorithm with
adaptive subcritical and supercritical thresholds consistently performs the
best in sparse signal recovery with and without measurement noise.
","[{'version': 'v1', 'created': 'Wed, 17 Dec 2014 01:59:01 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Oct 2016 17:59:32 GMT'}]",2016-10-19,"[['Zhang', 'Shuai', ''], ['Xin', 'Jack', '']]","['Transformed l1 penalty', 'closed form thresholding functions', 'iterative thresholdingalgorithms', 'compressed sensing', 'robust recovery']"
15900,1605.01115,Mading Li,"Mading Li, Jiaying Liu, Zhiwei Xiong, Xiaoyan Sun, Zongming Guo","MARLow: A Joint Multiplanar Autoregressive and Low-Rank Approach for
  Image Completion","16 pages, 9 figures",,,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel multiplanar autoregressive (AR) model to
exploit the correlation in cross-dimensional planes of a similar patch group
collected in an image, which has long been neglected by previous AR models. On
that basis, we then present a joint multiplanar AR and low-rank based approach
(MARLow) for image completion from random sampling, which exploits the nonlocal
self-similarity within natural images more effectively. Specifically, the
multiplanar AR model constraints the local stationarity in different
cross-sections of the patch group, while the low-rank minimization captures the
intrinsic coherence of nonlocal patches. The proposed approach can be readily
extended to multichannel images (e.g. color images), by simultaneously
considering the correlation in different channels. Experimental results
demonstrate that the proposed approach significantly outperforms
state-of-the-art methods, even if the pixel missing rate is as high as 90%.
","[{'version': 'v1', 'created': 'Tue, 3 May 2016 23:41:57 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Jun 2016 03:55:13 GMT'}]",2016-06-17,"[['Li', 'Mading', ''], ['Liu', 'Jiaying', ''], ['Xiong', 'Zhiwei', ''], ['Sun', 'Xiaoyan', ''], ['Guo', 'Zongming', '']]","['Image completion', 'multiplanar autoregressive model', 'lowrank minimization']"
15901,1705.06855,Michael Haythorpe,"Vladimir Ejov, Michael Haythorpe, and Serguei Rossomakhine","Using a Hamiltonian cycle problem algorithm to assist in solving
  difficult instances of Traveling Salesman Problem",4 pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a hybrid procedure for solving the traveling salesman problem
(TSP) to provable optimality. We first sparsify the instance, and then use a
hybrid algorithm that combines a branch-and-cut TSP solver with a Hamiltonian
cycle problem solver. We demonstrate that this procedure enables us to solve
difficult instances to optimality, including one which had remained unsolved
since its construction in 2002.
","[{'version': 'v1', 'created': 'Fri, 19 May 2017 04:06:13 GMT'}]",2017-05-22,"[['Ejov', 'Vladimir', ''], ['Haythorpe', 'Michael', ''], ['Rossomakhine', 'Serguei', '']]","['Traveling salesman problem', 'Sparsification algorithm', 'Concorde', 'Hamiltoniancycles', 'Optimality']"
15902,1511.05810,Dirk Lewandowski,Dirk Lewandowski,"The Influence of Commercial Intent of Search Results on Their Perceived
  Relevance","Measurement, Performance, Experimentation, Worldwide Web, search
  engines, commerciality, evaluation",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We carried out a retrieval effectiveness test on the three major web search
engines (i.e., Google, Microsoft and Yahoo). In addition to relevance
judgments, we classified the results according to their commercial intent and
whether or not they carried any advertising. We found that all search engines
provide a large number of results with a commercial intent. Google provides
significantly more commercial results than the other search engines do.
However, the commercial intent of a result did not influence jurors in their
relevance judgments.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2015 14:43:22 GMT'}]",2015-11-19,"[['Lewandowski', 'Dirk', '']]","['Worldwide Web', 'search engines', 'commerciality', 'evaluation']"
15903,1603.07604,Yan Yan,"Yan Yan, Hanzi Wang, David Suter","Multi-Subregion Based Correlation Filter Bank for Robust Face
  Recognition",,"Pattern Recognition, volume 47, 11, pages3487--3501, (2014)",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose an effective feature extraction algorithm, called
Multi-Subregion based Correlation Filter Bank (MS-CFB), for robust face
recognition. MS-CFB combines the benefits of global-based and local-based
feature extraction algorithms, where multiple correlation filters correspond-
ing to different face subregions are jointly designed to optimize the overall
correlation outputs. Furthermore, we reduce the computational complexi- ty of
MS-CFB by designing the correlation filter bank in the spatial domain and
improve its generalization capability by capitalizing on the unconstrained form
during the filter bank design process. MS-CFB not only takes the d- ifferences
among face subregions into account, but also effectively exploits the
discriminative information in face subregions. Experimental results on various
public face databases demonstrate that the proposed algorithm pro- vides a
better feature representation for classification and achieves higher
recognition rates compared with several state-of-the-art algorithms.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2016 14:45:51 GMT'}]",2016-03-25,"[['Yan', 'Yan', ''], ['Wang', 'Hanzi', ''], ['Suter', 'David', '']]","['Correlation filter bank', 'Feature extraction', 'Face recognition']"
15904,1504.08110,Matthias Keil,Matthias Keil and Peter Thiemann,TreatJS: Higher-Order Contracts for JavaScript,Technical Report,,,,cs.PL,http://creativecommons.org/licenses/by/3.0/,"  TreatJS is a language embedded, higher-order contract system for JavaScript
which enforces contracts by run-time monitoring. Beyond providing the standard
abstractions for building higher-order contracts (base, function, and object
contracts), TreatJS's novel contributions are its guarantee of non-interfering
contract execution, its systematic approach to blame assignment, its support
for contracts in the style of union and intersection types, and its notion of a
parameterized contract scope, which is the building block for composable
run-time generated contracts that generalize dependent function contracts.
  TreatJS is implemented as a library so that all aspects of a contract can be
specified using the full JavaScript language. The library relies on JavaScript
proxies to guarantee full interposition for contracts. It further exploits
JavaScript's reflective features to run contracts in a sandbox environment,
which guarantees that the execution of contract code does not modify the
application state. No source code transformation or change in the JavaScript
run-time system is required.
  The impact of contracts on execution speed is evaluated using the Google
Octane benchmark.
","[{'version': 'v1', 'created': 'Thu, 30 Apr 2015 08:18:29 GMT'}]",2015-05-01,"[['Keil', 'Matthias', ''], ['Thiemann', 'Peter', '']]","['Higher-Order Contracts', 'JavaScript', 'Proxies']"
15905,1704.08219,R Inkulu,"R. Inkulu, K. Sowmya, N. P. Thakur",Dynamic algorithms for visibility polygons in simple polygons,,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We devise the following dynamic algorithms for both maintaining as well as
querying for the visibility and weak visibility polygons amid vertex insertions
and/or deletions to the simple polygon. * A fully-dynamic algorithm for
maintaining the visibility polygon of a fixed point located interior to the
simple polygon amid vertex insertions and deletions to the simple polygon. The
time complexity to update the visibility polygon of a point $q$ due to the
insertion (resp. deletion) of vertex $v$ to (resp. from) the current simple
polygon is expressed in terms of the number of combinatorial changes needed to
the visibility polygon of $q$ due to the insertion (resp. deletion) of $v$. *
An output-sensitive query algorithm to answer the visibility polygon query
corresponding to any point $p$ in $\mathbb{R}^2$ amid vertex insertions and
deletions to the simple polygon. If $p$ is not exterior to the current simple
polygon, then the visibility polygon of $p$ is computed. Otherwise, our
algorithm outputs the visibility polygon corresponding to the exterior
visibility of $p$. * An incremental algorithm to maintain the weak visibility
polygon of a fixed-line segment located interior to the simple polygon amid
vertex insertions to the simple polygon. The time complexity to update the weak
visibility polygon of a line segment $pq$ due to the insertion of vertex $v$ to
the current simple polygon is expressed in terms of the sum of the number of
combinatorial updates needed to the geodesic shortest path trees rooted at $p$
and $q$ due to the insertion of $v$. * An output-sensitive algorithm to compute
the weak visibility polygon corresponding to any query line segment located
interior to the simple polygon amid both the vertex insertions and deletions to
the simple polygon. Each of these algorithms requires preprocessing the initial
simple polygon.
","[{'version': 'v1', 'created': 'Wed, 26 Apr 2017 17:11:29 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Jul 2017 12:47:27 GMT'}, {'version': 'v3', 'created': 'Mon, 20 Apr 2020 16:08:50 GMT'}]",2020-04-21,"[['Inkulu', 'R.', ''], ['Sowmya', 'K.', ''], ['Thakur', 'N. P.', '']]","['Computational Geometry', 'Visibility', 'Dynamic Algorithms']"
15906,1606.03503,Badrunnesa Zaman,Badrunnesa Zaman and Darshana Sedera,"Green Information Technology as Administrative innovation -
  Organizational factors for successful implementation: Literature Review","ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
  Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/193,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  There is a considerable amount of awareness of environmental issues and
corporate responsibility for sustainability. As such, from a technological
viewpoint, Green IT has become an important topic in contemporary
organizations. Consequently, organisations are expected to be innovative in
their business practices to become more sustainable. Yet, the popularity and
adoption of such initiatives amongst employees remain low. Furthermore, the
management practices for adhering to Green IT are largely dormant, lacking
active incentives for employees to engage in Green IT initiatives. This study
observes the phenomenon of Green IT through administrative innovation. In doing
so this paper performs a comprehensive analysis of 137 papers published between
2007 and 2015. The paper reveals organizational factors for successful
implementation of Green IT as administrative innovation that can be useful to
both academia and practice.
","[{'version': 'v1', 'created': 'Fri, 10 Jun 2016 23:56:13 GMT'}]",2016-06-14,"[['Zaman', 'Badrunnesa', ''], ['Sedera', 'Darshana', '']]","['Green IT', 'Innovation', 'Administrative', 'Factors', 'Policy']"
15907,1206.5726,Francisco Pedroche,"Francisco Pedroche, Miguel Rebollo, Carlos Carrascosa and Alberto
  Palomares","L-RCM: a method to detect connected components in undirected graphs by
  using the Laplacian matrix and the RCM algorithm",,,,,cs.DM cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider undirected graphs with no loops and multiple edges,
consisting of k connected components. In these cases, it is well known that one
can find a numbering of the vertices such that the adjacency matrix A is block
diagonal with k blocks. This also holds for the (unnormalized) Laplacian matrix
L= D-A, with D a diagonal matrix with the degrees of the nodes. In this paper
we propose to use the Reverse Cuthill-McKee (RCM) algorithm to obtain a block
diagonal form of L that reveals the number of connected components of the
graph. We present some theoretical results about the irreducibility of the
Laplacian matrix ordered by the RCM algorithm. As a practical application we
present a very efficient method to detect connected components with a
computational cost of O(m+n), being m the number of edges and n the number of
nodes. The RCM method is implemented in some comercial packages like MATLAB and
Mathematica. We make the computations by using the function symrcm of MATLAB.
Some numerical results are shown
","[{'version': 'v1', 'created': 'Mon, 25 Jun 2012 16:13:59 GMT'}]",2015-03-20,"[['Pedroche', 'Francisco', ''], ['Rebollo', 'Miguel', ''], ['Carrascosa', 'Carlos', ''], ['Palomares', 'Alberto', '']]","['ordering algorithms', 'RCM', 'graph partitioning', 'graph spectra', 'Laplacian matrix']"
15908,1802.06296,Martin Christiansen,"Martin Peter Christiansen, Morten Stiggaard Laursen, Rasmus Nyholm
  J{\o}rgensen, Ibrahim A. Hameed","Collaborative model based design of automated and robotic agricultural
  vehicles in the Crescendo Tool",,"Agromek and NJF joint seminar (2014), 36-41",,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a collaborative modelling approach to automated and
robotic agricultural vehicle design. The Cresendo technology allows engineers
from different disciplines to collaborate and produce system models. The
combined models are called co-models and their execution co-simulation. To
support future development efforts a template library of different vehicle and
controllers types are provided. This paper describes a methodology to
developing co-models from initial problem definition to deployment of the
actual system. We illustrate the development methodology with an example
development case from the agricultural domain. The case relates to an
encountered speed controller problem on a differential driven vehicle, where we
iterate through different candidate solutions and end up with an adaptive
controller solution based on a combination of classical control and learning
feedforward. The second case is an example of combining human control interface
and co-simulation of agricultural robotic operation to illustrate collaborative
development
","[{'version': 'v1', 'created': 'Sat, 17 Feb 2018 21:20:17 GMT'}]",2018-02-20,"[['Christiansen', 'Martin Peter', ''], ['Laursen', 'Morten Stiggaard', ''], ['Jørgensen', 'Rasmus Nyholm', ''], ['Hameed', 'Ibrahim A.', '']]","['Co-simulation', 'discrete event', 'continuous time', 'precision agriculture']"
15909,1005.0967,Rdv Ijcsis,"J. Visumathi, K. L. Shunmuganathan","Detecting Security threats in the Router using Computational
  Intelligence","IEEE Publication format, International Journal of Computer Science
  and Information Security, IJCSIS, Vol. 8 No. 1, April 2010, USA. ISSN 1947
  5500, http://sites.google.com/site/ijcsis/",,,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  nformation security is an issue of global concern. As the Internet is
delivering great convenience and benefits to the modern society, the rapidly
increasing connectivity and accessibility to the Internet is also posing a
serious threat to security and privacy, to individuals, organizations, and
nations alike. Finding effective ways to detect, prevent, and respond to
intrusions and hacker attacks of networked computers and information systems.
This paper presents a knowledge discovery frame work to detect DoS attacks at
the boundary controllers (routers). The idea is to use machine learning
approach to discover network features that can depict the state of the network
connection. Using important network data (DoS relevant features), we have
developed kernel machine based and soft computing detection mechanisms that
achieve high detection accuracies. We also present our work of identifying DoS
pertinent features and evaluating the applicability of these features in
detecting novel DoS attacks. Architecture for detecting DoS attacks at the
router is presented. We demonstrate that highly efficient and accurate
signature based classifiers can be constructed by using important network
features and machine learning techniques to detect DoS attacks at the boundary
controllers.
","[{'version': 'v1', 'created': 'Thu, 6 May 2010 10:26:33 GMT'}]",2010-05-07,"[['Visumathi', 'J.', ''], ['Shunmuganathan', 'K. L.', '']]","['Denial of service attacks', 'information assurance', 'intrusion detection', 'machine learning', 'feature ranking', 'data reduction']"
15910,0711.2971,Annie Bouyer,"Sylvain Kubicki (MAP / CRAI), Annie Guerri\'ero (MAP / CRAI), Damien
  Hanser (MAP / CRAI), Gilles Halin (MAP / CRAI)","IT services design to support coordination practices in the
  Luxembourguish AEC sector",,,,,cs.HC,,"  In the Architecture Engineering and Construction sector (AEC) cooperation
between actors is essential for project success. The configuration of actors'
organization takes different forms like the associated coordination mechanisms.
Our approach consists in analyzing these coordination mechanisms through the
identification of the ""base practices"" realized by the actors of a construction
project to cooperate. We also try with practitioners to highlight the ""best
practices"" of cooperation. Then we suggest here two prototypes of IT services
aiming to demonstrate the value added of IT to support cooperation. These
prototype tools allow us to sensitize the actors through terrain experiments
and then to bring inch by inch the Luxembourgish AEC sector towards electronic
cooperation.
","[{'version': 'v1', 'created': 'Mon, 19 Nov 2007 16:36:02 GMT'}]",2007-11-20,"[['Kubicki', 'Sylvain', '', 'MAP / CRAI'], ['Guerriéro', 'Annie', '', 'MAP / CRAI'], ['Hanser', 'Damien', '', 'MAP / CRAI'], ['Halin', 'Gilles', '', 'MAP / CRAI']]","['AEC', 'Cooperation Process', 'Coordination practices', 'IT services']"
15911,1701.02455,Loet Leydesdorff,"Loet Leydesdorff, Mark W. Johnson, and Inga Ivanova","Toward a Calculus of Redundancy: The feedback arrow of expectations in
  knowledge-based systems","accepted for publication by the Journal of the Association for
  Information Science and Technology, 24 March 2018",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the relationships among meaning generation, selection,
and the dynamics of discourse from a variety of perspectives ranging from
information theory and biology to sociology. Following Husserl's idea of a
horizon of meaning in intersubjective communication, we propose a way in which,
using Shannon's equations, the generation and selection of meanings from a
horizon of possibilities can be considered probabilistically. The
information-theoretical dynamics we articulate considers a process of meaning
generation within cultural evolution: information is imbued with meaning, and
through this process, the number of options for the selection of meaning in
discourse proliferates. The redundancy of possible meanings contributes to a
codification of expectations within the discourse. Unlike hard-wired DNA, the
codes of non-biological systems can co-evolve with the variations. Spanning
horizons of meaning, the codes structure the communications as selection
environments that shape discourses. Discursive knowledge can be considered as
meta-coded communication which enables us to translate among differently coded
communications. The dynamics of discursive knowledge production can thus infuse
the historical dynamics with a cultural evolution by adding options, that is,
by increasing redundancy. A calculus of redundancy is presented as an indicator
whereby these dynamics of discourse and meaning may be explored empirically.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2017 07:27:57 GMT'}, {'version': 'v2', 'created': 'Sat, 24 Mar 2018 20:48:10 GMT'}]",2018-03-28,"[['Leydesdorff', 'Loet', ''], ['Johnson', 'Mark W.', ''], ['Ivanova', 'Inga', '']]","['redundancy', 'discursive knowledge', 'incursion', 'options', 'meaning', 'codification']"
15912,1511.08307,Kimio Kuramitsu,Kimio Kuramitsu,Nez: practical open grammar language,unpublished draft work (11 pages),,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nez is a PEG(Parsing Expressing Grammar)-based open grammar language that
allows us to describe complex syntax constructs without action code. Since open
grammars are declarative and free from a host programming language of parsers,
software engineering tools and other parser applications can reuse once-defined
grammars across programming languages.
  A key challenge to achieve practical open grammars is the expressiveness of
syntax constructs and the resulting parser performance, as the traditional
action code approach has provided very pragmatic solutions to these two issues.
In Nez, we extend the symbol-based state management to recognize
context-sensitive language syntax, which often appears in major programming
languages. In addition, the Abstract Syntax Tree constructor allows us to make
flexible tree structures, including the left-associative pair of trees. Due to
these extensions, we have demonstrated that Nez can parse not all but many
grammars.
  Nez can generate various types of parsers since all Nez operations are
independent of a specific parser language. To highlight this feature, we have
implemented Nez with dynamic parsing, which allows users to integrate a Nez
parser as a parser library that loads a grammar at runtime. To achieve its
practical performance, Nez operators are assembled into low-level virtual
machine instructions, including automated state modifications when
backtracking, transactional controls of AST construction, and efficient
memoization in packrat parsing. We demonstrate that Nez dynamic parsers achieve
very competitive performance compared to existing efficient parser generators.
","[{'version': 'v1', 'created': 'Thu, 26 Nov 2015 07:37:10 GMT'}]",2015-11-30,"[['Kuramitsu', 'Kimio', '']]","['Parsing expression grammars', 'Context-sensitive grammars', 'Packrat parsing']"
15913,0907.4576,Elena Pribavkina,E. V. Pribavkina,Slowly synchronizing automata with zero and incomplete sets,"9 pages, 6 figures",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using combinatorial properties of incomplete sets in a free monoid we
construct a series of n-state deterministic automata with zero whose shortest
synchronizing word has length n^2/4+n/2-1.
","[{'version': 'v1', 'created': 'Mon, 27 Jul 2009 09:19:56 GMT'}]",2009-07-28,"[['Pribavkina', 'E. V.', '']]","['synchronizing automata', 'shortest synchronizing words', 'automata with zero', 'incomplete sets', 'incompletable words']"
15914,1412.2929,Yao-Hsiang Yang,"Yao-Hsiang Yang, Lu-Hung Chen, Chieh-Chih Wang, and Chu-Song Chen",Bayesian Fisher's Discriminant for Functional Data,,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a Bayesian framework of Gaussian process in order to extend
Fisher's discriminant to classify functional data such as spectra and images.
The probability structure for our extended Fisher's discriminant is explicitly
formulated, and we utilize the smoothness assumptions of functional data as
prior probabilities. Existing methods which directly employ the smoothness
assumption of functional data can be shown as special cases within this
framework given corresponding priors while their estimates of the unknowns are
one-step approximations to the proposed MAP estimates. Empirical results on
various simulation studies and different real applications show that the
proposed method significantly outperforms the other Fisher's discriminant
methods for functional data.
","[{'version': 'v1', 'created': 'Tue, 9 Dec 2014 12:01:03 GMT'}]",2014-12-10,"[['Yang', 'Yao-Hsiang', ''], ['Chen', 'Lu-Hung', ''], ['Wang', 'Chieh-Chih', ''], ['Chen', 'Chu-Song', '']]","['Fisher’s linear discriminant analysis', 'functional data', 'Gaussianprocess', 'Bayesian smoothing', 'dimension reduction']"
15915,1108.2389,Anis Ismail,"Anis Ismail, Abd El Salam Al Hajjar and Ziad Ismail",A New System Architecture for Pervasive Computing,"15 pages, 4 figures",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present new system architecture, a distributed framework designed to
support pervasive computing applications. We propose a new architecture
consisting of a search engine and peripheral clients that addresses issues in
scalability, data sharing, data transformation and inherent platform
heterogeneity. Key features of our application are a type-aware data transport
that is capable of extract data, and present data through handheld devices (PDA
(personal digital assistant), mobiles, etc). Pervasive computing uses web
technology, portable devices, wireless communications and nomadic or ubiquitous
computing systems. The web and the simple standard HTTP protocol that it is
based on, facilitate this kind of ubiquitous access. This can be implemented on
a variety of devices - PDAs, laptops, information appliances such as digital
cameras and printers. Mobile users get transparent access to resources outside
their current environment. We discuss our system's architecture and its
implementation. Through experimental study, we show reasonable performance and
adaptation for our system's implementation for the mobile devices.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2011 18:19:51 GMT'}]",2011-08-12,"[['Ismail', 'Anis', ''], ['Hajjar', 'Abd El Salam Al', ''], ['Ismail', 'Ziad', '']]","['Scalability', 'handheld devices', 'Pervasive', 'ubiquitous', 'HTTP']"
15916,0804.3885,Icius Committee,"K. Muljowidodo, and N. Sapto Adi",Heading Lock Maneuver Testing of Autonomous Underwater Vehicle,"Uploaded by ICIUS2007 Conference Organizer on behalf of the
  author(s). 7 pages, 11 figures","Proceedings of the International Conference on Intelligent
  Unmanned System (ICIUS 2007), Bali, Indonesia, October 24-25, 2007, Paper No.
  ICIUS2007-A014",,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, Autonomous Underwater Vehicle (UAV) research and development
at Bandung Institute of Technology in Indonesia has achieved the testing stage
in the field. This testing was still being classified as the early testing,
since some of the preliminary tests were carried out in the scale of the
laboratory. The paper would discuss the laboratory test and several tests that
were done in the field. Discussions were stressed in the procedure and the aim
that will be achieved, along with several early results. The testing was
carried out in the lake with the area around 8300 Ha and the maximum depth of
50 meters. The location of the testing was chosen with consideration of
minimizing the effect of the current and the wave, as well as the location that
was not too far from the Laboratory. The type of testing that will be discussed
in paper was Heading Lock Maneuver Testing. The vehicle was tested to move with
a certain cruising speed, afterwards it was commanded by an arbitrarily
selected heading direction. The response and the behavior of the vehicle were
recorded as the data produced by the testing.
","[{'version': 'v1', 'created': 'Thu, 24 Apr 2008 10:25:41 GMT'}]",2008-04-25,"[['Muljowidodo', 'K.', ''], ['Adi', 'N. Sapto', '']]","['autonomous underwater vehicle (AUV)', 'AUV testing', 'Heading Lock Maneuver']"
15917,1511.00715,Junichiro Fukuyama,Piotr Berman and Junichiro Fukuyama,"Distributed Selection in $O ( \log n )$ Time with $O ( n \log \log n )$
  Messages",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the selection problem on a completely connected network of $n$
processors with no shared memory. Each processor initially holds a given
numeric item of $b$ bits allowed to send a message of $\max ( b, \lg n )$ bits
to another processor at a time. On such a communication network ${\cal G}$, we
show that the $k$th smallest of the $n$ inputs can be detected in $O ( \log n
)$ time with $O ( n \log \log n )$ messages. The possibility of such a parallel
algorithm for this distributed $k$-selection problem has been unknown despite
the intensive investigation on many variations of the selection problem carried
out since 1970s. The main trick of our algorithm is to simulate the comparisons
and swaps performed by the AKS sorting network, the $n$-input sorting network
of logarithmic depth discovered by Ajtai, Koml{\'o}s and Szemer{\'e}di in 1983.
We also show the universal time lower bound $\lg n$ for many basic data
aggregation problems on ${\cal G}$, confirming the asymptotic time optimality
of our parallel algorithm.
","[{'version': 'v1', 'created': 'Mon, 2 Nov 2015 21:30:12 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Aug 2016 16:30:03 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Nov 2016 20:16:26 GMT'}, {'version': 'v4', 'created': 'Mon, 11 Dec 2017 22:11:17 GMT'}]",2017-12-13,"[['Berman', 'Piotr', ''], ['Fukuyama', 'Junichiro', '']]","['the selection problem', 'distributed selection', 'AKS sortingnetwork', 'communication network', 'comparator network']"
15918,0807.1775,Damien Vergnaud,Beno\^it Libert and Damien Vergnaud,"Towards Black-Box Accountable Authority IBE with Short Ciphertexts and
  Private Keys",32 pages,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  At Crypto'07, Goyal introduced the concept of Accountable Authority
Identity-Based Encryption as a convenient tool to reduce the amount of trust in
authorities in Identity-Based Encryption. In this model, if the Private Key
Generator (PKG) maliciously re-distributes users' decryption keys, it runs the
risk of being caught and prosecuted. Goyal proposed two constructions: the
first one is efficient but can only trace well-formed decryption keys to their
source; the second one allows tracing obfuscated decryption boxes in a model
(called weak black-box model) where cheating authorities have no decryption
oracle. The latter scheme is unfortunately far less efficient in terms of
decryption cost and ciphertext size. In this work, we propose a new
construction that combines the efficiency of Goyal's first proposal with a very
simple weak black-box tracing mechanism. Our scheme is described in the
selective-ID model but readily extends to meet all security properties in the
adaptive-ID sense, which is not known to be true for prior black-box schemes.
","[{'version': 'v1', 'created': 'Fri, 11 Jul 2008 09:40:01 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Jul 2008 08:50:10 GMT'}, {'version': 'v3', 'created': 'Fri, 3 Oct 2008 07:37:56 GMT'}, {'version': 'v4', 'created': 'Tue, 16 Dec 2008 09:47:29 GMT'}, {'version': 'v5', 'created': 'Tue, 8 Sep 2009 16:06:59 GMT'}]",2009-09-08,"[['Libert', 'Benoît', ''], ['Vergnaud', 'Damien', '']]","['Identity-based encryption', 'traceability', 'efficiency']"
15919,1205.1642,Jose Texier,Jose Texier and Bermudez Manuel,Traductor Writing System Web,"LACCEI 2008, ISBN-10 0-9822896-1-8, ISBN-13 978-0-9822896-1-7",,,,cs.OH,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  A compilator is a program which is development in a programming language that
read a file known as source. After this file have to translate and have to
convert in other program known as object or to generate a exit. The best way
for to know any programming language is analizing a compilation process which
is same in all programming paradigm existents. To like to generate a tool that
permit a learning in university course. This course could explain in any
plataform such as Linux o Windows. This goal is posible through development a
Web aplication which is unite with a compilator, it is Traductor Writing System
(Sistema de Escritura de Traductores). This system is complete and permit
extend and modify the compilator. The system is a module in Moodle which is a
Course Management System (CMS) that help teachers for to create comunities of
learning in line. This software is in free software license (GPL).
","[{'version': 'v1', 'created': 'Tue, 8 May 2012 09:30:46 GMT'}]",2012-05-09,"[['Texier', 'Jose', ''], ['Manuel', 'Bermudez', '']]","['compilator', 'Moodle', 'continuing education', 'free software']"
15920,1402.4724,Onintra Poobrasert,Onintra Poobrasert and Waragorn Gestubtim,"Breaking Barriers: Assistive Technology Tool as Educational Software to
  support Writing",9 pages. IJCA 2013,,,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The preliminary report by Siriraj Hospital suggested that 6% of population
who are students in Thailand could be estimated to have learning disabilities.
It is therefore necessary for our institute to develop suitable ICT
technologies to assist the education of these learning disabilities children.
We therefore developed a program called Thai Word Prediction Program. Thai Word
Prediction program aims to assist students with learning disabilities in their
writing. After the usability engineering, we conducted the experiment with
students with learning disabilities at the School in Bangkok. Hence, the
results indicated that all three students with learning disabilities in this
study improved their ability of writing by 50%, 81.89% and 100% respectively.
","[{'version': 'v1', 'created': 'Wed, 19 Feb 2014 16:36:58 GMT'}]",2014-02-20,"[['Poobrasert', 'Onintra', ''], ['Gestubtim', 'Waragorn', '']]","['Assistive technology', 'Learning disabilities', 'Usability engineering', 'Word prediction']"
15921,1506.00740,Ryan Gabrys,"Ryan Gabrys, Han Mao Kiah, and Olgica Milenkovic",Asymmetric Lee Distance Codes for DNA-Based Storage,,,,,cs.IT math.IT,http://creativecommons.org/publicdomain/zero/1.0/,"  We consider a new family of codes, termed asymmetric Lee distance codes, that
arise in the design and implementation of DNA-based storage systems and systems
with parallel string transmission protocols. The codewords are defined over a
quaternary alphabet, although the results carry over to other alphabet sizes;
furthermore, symbol confusability is dictated by their underlying binary
representation. Our contributions are two-fold. First, we demonstrate that the
new distance represents a linear combination of the Lee and Hamming distance
and derive upper bounds on the size of the codes under this metric based on
linear programming techniques. Second, we propose a number of code
constructions which imply lower bounds.
","[{'version': 'v1', 'created': 'Tue, 2 Jun 2015 03:22:39 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Dec 2015 14:23:58 GMT'}, {'version': 'v3', 'created': 'Tue, 26 Jan 2016 04:09:14 GMT'}, {'version': 'v4', 'created': 'Thu, 8 Dec 2016 18:25:04 GMT'}, {'version': 'v5', 'created': 'Wed, 14 Dec 2016 23:14:00 GMT'}]",2016-12-16,"[['Gabrys', 'Ryan', ''], ['Kiah', 'Han Mao', ''], ['Milenkovic', 'Olgica', '']]","['Coding for DNA-based storage', 'Delsarte linear programming bounds', 'Lee distance']"
15922,0906.1845,Serguei Mokhov,Serguei A. Mokhov,"Towards Improving Validation, Verification, Crash Investigations, and
  Event Reconstruction of Flight-Critical Systems with Self-Forensics","10 pages; a white discussion paper submitted in response to NASA's
  RFI NNH09ZEA001L at
  http://prod.nais.nasa.gov/cgi-bin/eps/synopsis.cgi?acqid=134490",,,,cs.SE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a novel concept of self-forensics to complement the
standard autonomic self-CHOP properties of the self-managed systems, to be
specified in the Forensic Lucid language. We argue that self-forensics, with
the forensics taken out of the cybercrime domain, is applicable to
""self-dissection"" for the purpose of verification of autonomous software and
hardware systems of flight-critical systems for automated incident and anomaly
analysis and event reconstruction by the engineering teams in a variety of
incident scenarios during design and testing as well as actual flight data.
","[{'version': 'v1', 'created': 'Wed, 10 Jun 2009 06:30:48 GMT'}]",2009-06-11,"[['Mokhov', 'Serguei A.', '']]","['self-forensics', 'verification', 'specification', 'Forensic Lucid', 'testing', 'automaticreasoning', 'autonomous systems', 'autonomic computing']"
15923,1701.06655,Chiwoo Park,Chiwoo Park and Daniel Apley,Patchwork Kriging for Large-scale Gaussian Process Regression,,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new approach for Gaussian process (GP) regression for
large datasets. The approach involves partitioning the regression input domain
into multiple local regions with a different local GP model fitted in each
region. Unlike existing local partitioned GP approaches, we introduce a
technique for patching together the local GP models nearly seamlessly to ensure
that the local GP models for two neighboring regions produce nearly the same
response prediction and prediction error variance on the boundary between the
two regions. This largely mitigates the well-known discontinuity problem that
degrades the boundary accuracy of existing local partitioned GP methods. Our
main innovation is to represent the continuity conditions as additional
pseudo-observations that the differences between neighboring GP responses are
identically zero at an appropriately chosen set of boundary input locations. To
predict the response at any input location, we simply augment the actual
response observations with the pseudo-observations and apply standard GP
prediction methods to the augmented data. In contrast to heuristic continuity
adjustments, this has an advantage of working within a formal GP framework, so
that the GP-based predictive uncertainty quantification remains valid. Our
approach also inherits a sparse block-like structure for the sample covariance
matrix, which results in computationally efficient closed-form expressions for
the predictive mean and variance. In addition, we provide a new spatial
partitioning scheme based on a recursive space partitioning along local
principal component directions, which makes the proposed approach applicable
for regression domains having more than two dimensions. Using three spatial
datasets and three higher dimensional datasets, we investigate the numerical
performance of the approach and compare it to several state-of-the-art
approaches.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2017 22:20:47 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Nov 2017 19:40:22 GMT'}, {'version': 'v3', 'created': 'Fri, 9 Mar 2018 19:17:16 GMT'}, {'version': 'v4', 'created': 'Sat, 7 Jul 2018 16:55:04 GMT'}]",2018-07-10,"[['Park', 'Chiwoo', ''], ['Apley', 'Daniel', '']]","['Local Kriging', 'Model Split and Merge', 'Pseudo Observations', 'Spatial Partition']"
15924,1409.2432,Alain Tapp,Sebastien Gambs and Samuel Ranellucci and and Alain Tapp,The Crypto-democracy and the Trustworthy,DPM 2014,,,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the current architecture of the Internet, there is a strong asymmetry in
terms of power between the entities that gather and process personal data
(e.g., major Internet companies, telecom operators, cloud providers, ...) and
the individuals from which this personal data is issued. In particular,
individuals have no choice but to blindly trust that these entities will
respect their privacy and protect their personal data. In this position paper,
we address this issue by proposing an utopian crypto-democracy model based on
existing scientific achievements from the field of cryptography. More
precisely, our main objective is to show that cryptographic primitives,
including in particular secure multiparty computation, offer a practical
solution to protect privacy while minimizing the trust assumptions. In the
crypto-democracy envisioned, individuals do not have to trust a single physical
entity with their personal data but rather their data is distributed among
several institutions. Together these institutions form a virtual entity called
the Trustworthy that is responsible for the storage of this data but which can
also compute on it (provided first that all the institutions agree on this).
Finally, we also propose a realistic proof-of-concept of the Trustworthy, in
which the roles of institutions are played by universities. This
proof-of-concept would have an important impact in demonstrating the
possibilities offered by the crypto-democracy paradigm.
","[{'version': 'v1', 'created': 'Mon, 8 Sep 2014 17:07:46 GMT'}]",2014-09-12,"[['Gambs', 'Sebastien', ''], ['Ranellucci', 'Samuel', ''], ['Tapp', 'and Alain', '']]","['Privacy', 'Trust', 'Secure Computation', 'Democracy']"
15925,1303.7195,Marc Bux,Marc Bux and Ulf Leser,Parallelization in Scientific Workflow Management Systems,"24 pages, 17 figures (13 PDF, 4 PNG)",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the last two decades, scientific workflow management systems (SWfMS)
have emerged as a means to facilitate the design, execution, and monitoring of
reusable scientific data processing pipelines. At the same time, the amounts of
data generated in various areas of science outpaced enhancements in
computational power and storage capabilities. This is especially true for the
life sciences, where new technologies increased the sequencing throughput from
kilobytes to terabytes per day. This trend requires current SWfMS to adapt:
Native support for parallel workflow execution must be provided to increase
performance; dynamically scalable ""pay-per-use"" compute infrastructures have to
be integrated to diminish hardware costs; adaptive scheduling of workflows in
distributed compute environments is required to optimize resource utilization.
In this survey we give an overview of parallelization techniques for SWfMS,
both in theory and in their realization in concrete systems. We find that
current systems leave considerable room for improvement and we propose key
advancements to the landscape of SWfMS.
","[{'version': 'v1', 'created': 'Thu, 28 Mar 2013 18:20:17 GMT'}]",2013-03-29,"[['Bux', 'Marc', ''], ['Leser', 'Ulf', '']]","['parallelization', 'scheduling', 'scientific workflows', 'grid computing', 'cloud computing', 'e-Science', 'data analysis']"
15926,1204.6729,Krit Salah-Ddine,"Krit Salahddine, Laassiri Jalal and El Hajji Said","Specification and Verification of Uplink Framework for Application of
  Software Engineering using RM-ODP",6 pages,"IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 5, No 1, September 2011, 149-154",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper present a survey and discussion of the Reference Model for Open
Distributed Processing (RM-ODP) viewpoints; oriented approaches to requirements
engineering viewpoint and a presentation of new work in the application
wireless mobile phone, this area which has been designed with practical
application using the Unified Modelling Language (UML)/VHDL_AMS (VHSIC Hardware
Description Language Analog and Mixed-Signal). We mainly focus on rising and
fulling time, action, uplink behaviour constraints (sequentiality, non
determinism and concurrency constraints).We discuss the practical problems of
introducing viewpoint; oriented requirements engineering into industrial
software engineering practice and why these have prevented the widespread use
of existing approaches. The goal of this article is to check the uplink path
using the MIC (Microphone amplifier) with all analog inputs, and check the
amplifier gain. This paper provides an example of using the Uplink Framework to
build a comprehensive, good solution for Application Wireless Mobile Phone.
Finally, we discuss how well this approach addresses some outstanding problems
in requirements engineering (RE) and the practical industrial problems of
introducing new requirements engineering methods.
","[{'version': 'v1', 'created': 'Mon, 30 Apr 2012 19:16:28 GMT'}]",2012-05-07,"[['Salahddine', 'Krit', ''], ['Jalal', 'Laassiri', ''], ['Said', 'El Hajji', '']]","['RM-ODP', 'UML', 'VHDL-AMS', 'Uplink Behaviour', 'Software engineering', 'RE']"
15927,1402.0292,"J\""urgen M\""unch","Victor Basili, Jens Heidrich, Mikael Lindvall, J\""urgen M\""unch, Myrna
  Regardie, Dieter Rombach, Carolyn Seaman, Adam Trendowicz","GQM+Strategies: A Comprehensive Methodology for Aligning Business
  Strategies with Software Measurement",14 pages,"Proceedings of the DASMA Software Metric Congress (MetriKon 2007):
  Magdeburger Schriften zum Empirischen Software Engineering, pages 253-266,
  Kaiserslautern, Germany, November 15-16 2007",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In software-intensive organizations, an organizational management system will
not guarantee organizational success unless the business strategy can be
translated into a set of operational software goals. The Goal Question Metric
(GQM) approach has proven itself useful in a variety of industrial settings to
support quantitative software project management. However, it does not address
linking software measurement goals to higher-level goals of the organization in
which the software is being developed. This linkage is important, as it helps
to justify software measurement efforts and allows measurement data to
contribute to higher-level decisions. In this paper, we propose a
GQM+Strategies(R) measurement approach that builds on the GQM approach to plan
and implement software measurement. GQM+Strategies(R) provides mechanisms for
explicitly linking software measurement goals to higher-level goals for the
software organization, and further to goals and strategies at the level of the
entire business. The proposed method is illustrated in the context of an
example application of the method.
","[{'version': 'v1', 'created': 'Mon, 3 Feb 2014 06:32:53 GMT'}]",2014-02-04,"[['Basili', 'Victor', ''], ['Heidrich', 'Jens', ''], ['Lindvall', 'Mikael', ''], ['Münch', 'Jürgen', ''], ['Regardie', 'Myrna', ''], ['Rombach', 'Dieter', ''], ['Seaman', 'Carolyn', ''], ['Trendowicz', 'Adam', '']]","['Software measurement', 'goal question metric approach', 'project management', 'strategic management', 'business strategy', 'software strategy', 'IT strategy']"
15928,1707.08554,Andre Mastmeyer,"Andre Mastmeyer, Matthias Wilms, Heinz Handels","Interpatient Respiratory Motion Model Transfer for Virtual Reality
  Simulations of Liver Punctures","World Society for Computer Graphics - WSCG 2017 publication, 9 pages,
  5 figures, 1 movie online","Journal of WSCG, Vol.25, No.1, ISSN 1213-6972, 2017",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current virtual reality (VR) training simulators of liver punctures often
rely on static 3D patient data and use an unrealistic (sinusoidal) periodic
animation of the respiratory movement. Existing methods for the animation of
breathing motion support simple mathematical or patient-specific, estimated
breathing models. However with personalized breathing models for each new
patient, a heavily dose relevant or expensive 4D data acquisition is mandatory
for keyframe-based motion modeling. Given the reference 4D data, first a model
building stage using linear regression motion field modeling takes place. Then
the methodology shown here allows the transfer of existing reference
respiratory motion models of a 4D reference patient to a new static 3D patient.
This goal is achieved by using non-linear inter-patient registration to warp
one personalized 4D motion field model to new 3D patient data. This cost- and
dose-saving new method is shown here visually in a qualitative proof-of-concept
study.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 17:34:09 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Aug 2017 10:46:40 GMT'}]",2017-08-08,"[['Mastmeyer', 'Andre', ''], ['Wilms', 'Matthias', ''], ['Handels', 'Heinz', '']]","['Virtual Reality', 'Liver Puncture Training', '4D Motion Models', 'Inter-patient Registration of Motion Models']"
15929,1409.8035,Guido Schwenk,Guido Schwenk and Sebastian Bach,Detecting Behavioral and Structural Anomalies in MediaCloud Applications,20 pages,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the past years technological advances such as the increasing bandwidth in
network infrastructures and new software developments such as message and
agent-based systems gave rise to the field of cloud technologies, which have
evolved from abstract concepts to concrete solutions, ranging from flexible,
platform-independent systems to highly specialized software solutions. In this
paper we introduce and evaluate two anomaly detection methods to achieve a
higher level of security in a specific cloud solution for interactive media,
the Media Cloud from Alcatel-Lucent. The Media Cloud focuses on real-time
processing of interactive media applications, allowing for optimal resource
planning using highly specific functional components. The proposed anomaly
detection methods are designed to work complimentary to each other and are
capable of detecting known and unknown vulnerabilities and security issues,
offering very low false positive rates and very high detection rates, as is
shown by the evaluation on real Media Cloud data and synthetic data. The
proposed methods use behavioral and structural features, and are capable of
locating the detected anomalies as well, giving the executing analyst easy
insight into the running processes.
","[{'version': 'v1', 'created': 'Mon, 29 Sep 2014 09:16:00 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Oct 2014 14:31:30 GMT'}]",2014-10-13,"[['Schwenk', 'Guido', ''], ['Bach', 'Sebastian', '']]","['Anomaly Detection', 'Cloud Security', 'Machine Learning', 'Graphs']"
15930,1307.0475,Faraz Ahmed,"Faraz Ahmed, Rong Jin and Alex X. Liu","A Random Matrix Approach to Differential Privacy and Structure Preserved
  Social Network Graph Publishing",,,,,cs.CR cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online social networks are being increasingly used for analyzing various
societal phenomena such as epidemiology, information dissemination, marketing
and sentiment flow. Popular analysis techniques such as clustering and
influential node analysis, require the computation of eigenvectors of the real
graph's adjacency matrix. Recent de-anonymization attacks on Netflix and AOL
datasets show that an open access to such graphs pose privacy threats. Among
the various privacy preserving models, Differential privacy provides the
strongest privacy guarantees.
  In this paper we propose a privacy preserving mechanism for publishing social
network graph data, which satisfies differential privacy guarantees by
utilizing a combination of theory of random matrix and that of differential
privacy. The key idea is to project each row of an adjacency matrix to a low
dimensional space using the random projection approach and then perturb the
projected matrix with random noise. We show that as compared to existing
approaches for differential private approximation of eigenvectors, our approach
is computationally efficient, preserves the utility and satisfies differential
privacy. We evaluate our approach on social network graphs of Facebook, Live
Journal and Pokec. The results show that even for high values of noise variance
sigma=1 the clustering quality given by normalized mutual information gain is
as low as 0.74. For influential node discovery, the propose approach is able to
correctly recover 80 of the most influential nodes. We also compare our results
with an approach presented in [43], which directly perturbs the eigenvector of
the original data by a Laplacian noise. The results show that this approach
requires a large random perturbation in order to preserve the differential
privacy, which leads to a poor estimation of eigenvectors for large social
networks.
","[{'version': 'v1', 'created': 'Mon, 1 Jul 2013 18:46:28 GMT'}]",2013-07-02,"[['Ahmed', 'Faraz', ''], ['Jin', 'Rong', ''], ['Liu', 'Alex X.', '']]","['Differential Privacy', 'Social Networks', 'Privacy PreservingData Publishing']"
15931,1301.2711,Ahmed Rhif,"Ahmed Rhif, Zohra Kardous, Naceur BenHadj Braiek",A Sliding Mode Multimodel Control for a Sensorless Photovoltaic System,,,,,cs.SY hep-ex,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we will talk about a new control test using the sliding mode
control with a nonlinear sliding mode observer, which are very solicited in
tracking problems, for a sensorless photovoltaic panel. In this case, the panel
system will has as a set point the sun position at every second during the day
for a period of five years; then the tracker, using sliding mode multimodel
controller and a sliding mode observer, will track these positions to make the
sunrays orthogonal to the photovoltaic cell that produces more energy. After
sunset, the tracker goes back to the initial position (which of sunrise).
Experimental measurements show that this autonomic dual axis Sun Tracker
increases the power production by over 40%.
","[{'version': 'v1', 'created': 'Sat, 12 Jan 2013 19:49:11 GMT'}]",2013-01-15,"[['Rhif', 'Ahmed', ''], ['Kardous', 'Zohra', ''], ['Braiek', 'Naceur BenHadj', '']]","['Altitude', 'Azimuth', 'Photovoltaic panel', 'Solar energy', 'Sun tracker']"
15932,1004.0769,Secretary Aircc Journal,"Yasir Arfat Malkani and Lachhman Das Dhomeja (University of Sussex,
  Brighton, UK)",PSIM: A tool for analysis of device pairing methods,12Pages,"International Journal of Network Security & Its Applications 1.3
  (2009) 39-50",,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Wireless networks are a common place nowadays and almost all of the modern
devices support wireless communication in some form. These networks differ from
more traditional computing systems due to the ad-hoc and spontaneous nature of
interactions among devices. These systems are prone to security risks, such as
eavesdropping and require different techniques as compared to traditional
security mechanisms. Recently, secure device pairing in wireless environments
has got substantial attention from many researchers. As a result, a significant
set of techniques and protocols have been proposed to deal with this issue.
Some of these techniques consider devices equipped with infrared, laser,
ultrasound transceivers or 802.11 network interface cards; while others require
embedded accelerometers, cameras and/or LEDs, displays, microphones and/or
speakers. However, many of the proposed techniques or protocols have not been
implemented at all; while others are implemented and evaluated in a stand-alone
manner without being compared with other related work [1]. We believe that it
is because of the lack of specialized tools that provide a common platform to
test the pairing methods. As a consequence, we designed such a tool. In this
paper, we are presenting design and development of the Pairing Simulator (PSim)
that can be used to perform the analysis of device pairing methods.
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2010 04:05:44 GMT'}]",2010-07-15,"[['Malkani', 'Yasir Arfat', '', 'University of Sussex,\n  Brighton, UK'], ['Dhomeja', 'Lachhman Das', '', 'University of Sussex,\n  Brighton, UK']]","['Security', 'Usability', 'Device Association', 'Simulation', 'Standard']"
15933,1510.01942,Manny Rayner,"Manny Rayner and Alejandro Armando and Pierrette Bouillon and Sarah
  Ebling and Johanna Gerlach and Sonia Halimi and Irene Strasly and Nikos
  Tsourakis",Helping Domain Experts Build Speech Translation Systems,"12 pages, 1 figure, to appear in Proc. Future and Emerging Trends in
  Language Technology 2015, Seville, Spain",,,,cs.HC cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new platform, ""Regulus Lite"", which supports rapid development
and web deployment of several types of phrasal speech translation systems using
a minimal formalism. A distinguishing feature is that most development work can
be performed directly by domain experts. We motivate the need for platforms of
this type and discuss three specific cases: medical speech translation,
speech-to-sign-language translation and voice questionnaires. We briefly
describe initial experiences in developing practical systems.
","[{'version': 'v1', 'created': 'Wed, 7 Oct 2015 13:47:12 GMT'}]",2015-10-08,"[['Rayner', 'Manny', ''], ['Armando', 'Alejandro', ''], ['Bouillon', 'Pierrette', ''], ['Ebling', 'Sarah', ''], ['Gerlach', 'Johanna', ''], ['Halimi', 'Sonia', ''], ['Strasly', 'Irene', ''], ['Tsourakis', 'Nikos', '']]","['Speech translation', 'medical translation', 'sign language translation', 'questionnaires', 'web']"
15934,1005.1195,Swan Dubois,"Swan Dubois (LIP6, INRIA Rocquencourt), Toshimitsu Masuzawa
  (Department of Information and Computer sciences Osaka University),
  S\'ebastien Tixeuil (LIP6)",The Impact of Topology on Byzantine Containment in Stabilization,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-stabilization is an versatile approach to fault-tolerance since it
permits a distributed system to recover from any transient fault that
arbitrarily corrupts the contents of all memories in the system. Byzantine
tolerance is an attractive feature of distributed system that permits to cope
with arbitrary malicious behaviors. We consider the well known problem of
constructing a maximum metric tree in this context. Combining these two
properties prove difficult: we demonstrate that it is impossible to contain the
impact of Byzantine nodes in a self-stabilizing context for maximum metric tree
construction (strict stabilization). We propose a weaker containment scheme
called topology-aware strict stabilization, and present a protocol for
computing maximum metric trees that is optimal for this scheme with respect to
impossibility result.
","[{'version': 'v1', 'created': 'Fri, 7 May 2010 12:33:41 GMT'}]",2010-05-20,"[['Dubois', 'Swan', '', 'LIP6, INRIA Rocquencourt'], ['Masuzawa', 'Toshimitsu', '', 'Department of Information and Computer sciences Osaka University'], ['Tixeuil', 'Sébastien', '', 'LIP6']]","['Byzantine fault', 'Distributed protocol', 'Fault tolerance', 'Stabilization', 'Spanning treeconstruction']"
15935,0907.0288,Simant Dube,Simant Dube,"An Iterative Fingerprint Enhancement Algorithm Based on Accurate
  Determination of Orientation Flow","10 pages, 4 figures. Ongoing work. To be submitted to appropriate
  conference/journal",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe an algorithm to enhance and binarize a fingerprint image. The
algorithm is based on accurate determination of orientation flow of the ridges
of the fingerprint image by computing variance of the neighborhood pixels
around a pixel in different directions. We show that an iterative algorithm
which captures the mutual interdependence of orientation flow computation,
enhancement and binarization gives very good results on poor quality images.
","[{'version': 'v1', 'created': 'Thu, 2 Jul 2009 04:57:32 GMT'}]",2009-07-03,"[['Dube', 'Simant', '']]","['Fingerprint enhancement', 'fingerprint binarization', 'orientation flow']"
15936,1003.4053,William Jackson,"Raman Maini, Himanshu Aggarwal",A Comprehensive Review of Image Enhancement Techniques,,"Journal of Computing, Volume 2, Issue 3, March 2010,
  https://sites.google.com/site/journalofcomputing/",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Principle objective of Image enhancement is to process an image so that
result is more suitable than original image for specific application. Digital
image enhancement techniques provide a multitude of choices for improving the
visual quality of images. Appropriate choice of such techniques is greatly
influenced by the imaging modality, task at hand and viewing conditions. This
paper will provide an overview of underlying concepts, along with algorithms
commonly used for image enhancement. The paper focuses on spatial domain
techniques for image enhancement, with particular reference to point processing
methods and histogram processing.
","[{'version': 'v1', 'created': 'Mon, 22 Mar 2010 03:39:46 GMT'}]",2010-03-23,"[['Maini', 'Raman', ''], ['Aggarwal', 'Himanshu', '']]","['Digital Image Processing', 'Geometric Corrections', 'Gray Scale Manipulation', 'Image Enhancement']"
15937,1402.4410,Paniz Alipour Aghdam,Paniz Alipour Aghdam and Reza Ravanmehr,A Novel Approach for Canvas Accessibility Problem in HTML5,"9 pages,8 Figures","IJCSI International Journal of Computer Science Issues, Vol 10,
  2013, Page 116",,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Canvas is a pixel-based inherently inaccessible element in HTML5.Therefore
web users with vision disabilities cannot benefit from Canvas and its desired
semantics and functionality. Regarding to the Canvas application in designing
interactive graphical user interface, vision-impaired users may miss important
information on web sites. This paper utilizes the content-based image retrieval
(CBIR) technique as well as code mapping embedded in a Firefox extension to
present a novel approach in order to make Canvas interactive user interface
accessible. This extension replaces Canvas with an accessible equivalent HTML
environment. Unlike previously done works on Canvas accessibility, the proposed
approach does not impose any rules on developers and designers during Canvas
design.
","[{'version': 'v1', 'created': 'Tue, 18 Feb 2014 17:36:58 GMT'}]",2014-02-19,"[['Aghdam', 'Paniz Alipour', ''], ['Ravanmehr', 'Reza', '']]","['Web accessibility', 'Canvas', 'HTML5', 'CBIR']"
15938,1705.06260,Min Tang,"Min Tang, Sepehr Valipour, Zichen Vincent Zhang, Dana Cobzas, and
  MartinJagersand",A deep level set method for image segmentation,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a novel image segmentation approachthat integrates fully
convolutional networks (FCNs) with a level setmodel. Compared with a FCN, the
integrated method can incorporatesmoothing and prior information to achieve an
accurate segmentation.Furthermore, different than using the level set model as
a post-processingtool, we integrate it into the training phase to fine-tune the
FCN. Thisallows the use of unlabeled data during training in a
semi-supervisedsetting. Using two types of medical imaging data (liver CT and
left ven-tricle MRI data), we show that the integrated method achieves
goodperformance even when little training data is available, outperformingthe
FCN or the level set model alone.
","[{'version': 'v1', 'created': 'Wed, 17 May 2017 17:01:16 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Oct 2017 16:14:14 GMT'}]",2017-10-25,"[['Tang', 'Min', ''], ['Valipour', 'Sepehr', ''], ['Zhang', 'Zichen Vincent', ''], ['Cobzas', 'Dana', ''], ['MartinJagersand', '', '']]","['Image segmentation', 'Level set', 'Deep learning', 'FCN', 'Semisupervised learning', 'Shape prior']"
15939,1702.06830,Xiang Zhang,"Xiang Zhang, Lina Yao, Chaoran Huang, Quan Z.Sheng, Xianzhi Wang","Intent Recognition in Smart Living Through Deep Recurrent Neural
  Networks","10 pages, 5 figures,5 tables, 21 conferences",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Electroencephalography (EEG) signal based intent recognition has recently
attracted much attention in both academia and industries, due to helping the
elderly or motor-disabled people controlling smart devices to communicate with
outer world. However, the utilization of EEG signals is challenged by low
accuracy, arduous and time- consuming feature extraction. This paper proposes a
7-layer deep learning model to classify raw EEG signals with the aim of
recognizing subjects' intents, to avoid the time consumed in pre-processing and
feature extraction. The hyper-parameters are selected by an Orthogonal Array
experiment method for efficiency. Our model is applied to an open EEG dataset
provided by PhysioNet and achieves the accuracy of 0.9553 on the intent
recognition. The applicability of our proposed model is further demonstrated by
two use cases of smart living (assisted living with robotics and home
automation).
","[{'version': 'v1', 'created': 'Mon, 20 Feb 2017 03:17:48 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Feb 2017 14:08:35 GMT'}, {'version': 'v3', 'created': 'Wed, 16 Aug 2017 08:39:35 GMT'}]",2017-08-17,"[['Zhang', 'Xiang', ''], ['Yao', 'Lina', ''], ['Huang', 'Chaoran', ''], ['Sheng', 'Quan Z.', ''], ['Wang', 'Xianzhi', '']]","['Intent recognition', 'Deep learning', 'EEG', 'Smart home']"
15940,1501.00529,Selvarajah Thuseethan Mr.,"S.Thuseethan, S.Kuhanesan","Effective Use of Human Computer Interaction in Digital Academic
  Supportive Devices",,"International Journal of Science and Research, 3(6), 388-392
  (2014)",,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this research, a literature in human-computer interaction is reviewed and
the technology aspect of human computer interaction related with digital
academic supportive devices is also analyzed. According to all these concerns,
recommendations to design good human-computer digital academic supportive
devices are analyzed and proposed. Due to improvements in both hardware and
software, digital devices have unveiled continuous advances in efficiency and
processing capacity. However, many of these systems are also becoming larger
and increasingly more complex. Although such complexity usually poses no
difficulties for many users, it often creates barriers for academic users while
using digital devices. Usually, in designing those digital devices, the
human-computer interaction is left behind without consideration. To achieve
dependable, usable, and well-engineered interactive digital academic supportive
devices requires applied human computer interaction research and awareness of
its issues.
","[{'version': 'v1', 'created': 'Sat, 3 Jan 2015 04:10:37 GMT'}]",2015-01-06,"[['Thuseethan', 'S.', ''], ['Kuhanesan', 'S.', '']]","['Academic Supportive Devices', 'Digital Devices', 'Natural Language Processing', 'Non-cognitive properties', 'Human Computer Interaction  1']"
15941,1705.07311,Mohammad Aliannejadi,"Mohammad Aliannejadi, Ida Mele, and Fabio Crestani",Personalized Ranking for Context-Aware Venue Suggestion,"The 32nd ACM SIGAPP Symposium On Applied Computing (SAC), Marrakech,
  Morocco, April 4-6, 2017",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Making personalized and context-aware suggestions of venues to the users is
very crucial in venue recommendation. These suggestions are often based on
matching the venues' features with the users' preferences, which can be
collected from previously visited locations. In this paper we present a novel
user-modeling approach which relies on a set of scoring functions for making
personalized suggestions of venues based on venues content and reviews as well
as users context. Our experiments, conducted on the dataset of the TREC
Contextual Suggestion Track, prove that our methodology outperforms
state-of-the-art approaches by a significant margin.
","[{'version': 'v1', 'created': 'Sat, 20 May 2017 14:21:02 GMT'}]",2017-05-23,"[['Aliannejadi', 'Mohammad', ''], ['Mele', 'Ida', ''], ['Crestani', 'Fabio', '']]","['User models', 'contextual suggestion', 'LBSNs', 'review mining']"
15942,1206.5520,Dmitry Zinoviev,"Dmitry Zinoviev, Dan Stefanescu, Lance Swenson, Gary Fireman",Semantic Networks of Interests in Online NSSI Communities,"5 pages, 3 figures. Presented at Words and Networks: Language Use in
  Socio-Technical Networks (workshop at 2012 ACM Web Science Conference)",,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Persons who engage in non-suicidal self-injury (NSSI), often conceal their
practices which limits the examination and understanding of those who engage in
NSSI. The goal of this research is to utilize public online social networks
(namely, in LiveJournal, a major blogging network) to observe the NSSI
population's communication in a naturally occurring setting. Specifically,
LiveJournal users can publicly declare their interests. We collected the
self-declared interests of 22,000 users who are members of or participate in 43
NSSI-related communities. We extracted a bimodal socio-semantic network of
users and interests based on their similarity. The semantic subnetwork of
interests contains NSSI terms (such as ""self-injury"" and ""razors""), references
to music performers (such as ""Nine Inch Nails""), and general daily life and
creativity related terms (such as ""poetry"" and ""boys""). Assuming users are
genuine in their declarations, the words reveal distinct patterns of interest
and may signal keys to NSSI.
","[{'version': 'v1', 'created': 'Sun, 24 Jun 2012 16:39:06 GMT'}]",2012-06-26,"[['Zinoviev', 'Dmitry', ''], ['Stefanescu', 'Dan', ''], ['Swenson', 'Lance', ''], ['Fireman', 'Gary', '']]","['Interest', 'NSSI', 'Self-Injury', 'Similarity', 'LiveJournal']"
15943,1108.0427,Shvetha Soundararajan,Shvetha Soundararajan,A Methodology for assessing Agile Software Development Approaches,Research Proposal Document. 68 Pages,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Agile methods provide an organization or a team the flexibility to adopt a
selected subset of principles and practices based on their culture, their
values, and the types of systems that they develop. More specifically, every
organization or team implements a customized agile method, tailored to better
accommodate its needs. However, the extent to which a customized method
supports the organizational objectives, or rather the 'goodness' of that method
is questionable. Existing agile assessment approaches focus on a comparative
analysis, or are limited in scope and application. In this research, we propose
a structured, systematic and comprehensive approach to assess the 'goodness' of
agile methods. We examine an agile method based on (1) its adequacy, (2) the
capability of the organization to support the adopted principles and practices
specified by the method, and (3) the method's effectiveness. We propose the
Objectives, Principles and Practices (OPP) Framework to guide our assessment.
The Framework identifies (1) objectives of the agile philosophy, (2) principles
that support the objectives, (3) practices that are reflective of the
principles, (4) the linkages between the objectives, principles and practices,
and (5) indicators for each practice to assess the effectiveness of the
practice and the extent to which the organization supports its implementation.
In this document, we discuss our solution approach, preliminary results, and
future work.
","[{'version': 'v1', 'created': 'Mon, 1 Aug 2011 20:22:21 GMT'}]",2011-08-03,"[['Soundararajan', 'Shvetha', '']]","['Agile Assessment; Assessing Adequacy', 'Capability', 'Effectiveness; Linkages']"
15944,1701.08269,Rui Liu,"Rui Liu, Xiaoli Zhang","Systems of natural-language-facilitated human-robot cooperation: A
  review","21 pages, 10 figures",,,,cs.RO cs.AI cs.CL cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Natural-language-facilitated human-robot cooperation (NLC), in which natural
language (NL) is used to share knowledge between a human and a robot for
conducting intuitive human-robot cooperation (HRC), is continuously developing
in the recent decade. Currently, NLC is used in several robotic domains such as
manufacturing, daily assistance and health caregiving. It is necessary to
summarize current NLC-based robotic systems and discuss the future developing
trends, providing helpful information for future NLC research. In this review,
we first analyzed the driving forces behind the NLC research. Regarding to a
robot s cognition level during the cooperation, the NLC implementations then
were categorized into four types {NL-based control, NL-based robot training,
NL-based task execution, NL-based social companion} for comparison and
discussion. Last based on our perspective and comprehensive paper review, the
future research trends were discussed.
","[{'version': 'v1', 'created': 'Sat, 28 Jan 2017 08:32:35 GMT'}, {'version': 'v2', 'created': 'Fri, 26 May 2017 20:27:17 GMT'}]",2017-05-30,"[['Liu', 'Rui', ''], ['Zhang', 'Xiaoli', '']]","['robotic systems', 'natural language', 'human-robot cooperation', 'control', 'task execution', 'social companion']"
15945,1409.4388,Michele Amoretti,"Hany Kamal, Marco Picone, Michele Amoretti","A Survey and Taxonomy of Urban Traffic Management: Towards Vehicular
  Networks",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Urban Traffic Management (UTM) topics have been tackled since long time,
mainly by civil engineers and by city planners. The introduction of new
communication technologies - such as cellular systems, satellite positioning
systems and inter-vehicle communications - has significantly changed the way
researchers deal with UTM issues. In this survey, we provide a review and a
classification of how UTM has been addressed in the literature. We start from
the recent achievements of ""classical"" approaches to urban traffic estimation
and optimization, including methods based on the analysis of data collected by
fixed sensors (e.g., cameras and radars), as well as methods based on
information provided by mobile phones, such as Floating Car Data (FCD).
Afterwards, we discuss urban traffic optimization, presenting the most recent
works on traffic signal control and vehicle routing control. Then, after
recalling the main concepts of Vehicular Ad-Hoc Networks (VANETs), we classify
the different VANET-based approaches to UTM, according to three categories
(""pure"" VANETs, hybrid vehicular-sensor networks and hybrid vehicular-cellular
networks), while illustrating the major research issues for each of them. The
main objective of this survey is to provide a comprehensive view on UTM to
researchers with focus on VANETs, in order to pave the way for the design and
development of novel techniques for mitigating urban traffic problems, based on
inter-vehicle communications.
","[{'version': 'v1', 'created': 'Mon, 15 Sep 2014 19:30:07 GMT'}]",2014-09-16,"[['Kamal', 'Hany', ''], ['Picone', 'Marco', ''], ['Amoretti', 'Michele', '']]","['Urban traffic management', 'intelligent transportation systems', 'vehicular networks']"
15946,1009.2406,Przemek Kukielka pk,"Przemyslaw Kukielka, Zbigniew Kotulski",Adaptation of the neural network-based IDS to new attacks detection,"9 pages, 3 figures, 4 tables",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we report our experiment concerning new attacks detection by a
neural network-based Intrusion Detection System. What is crucial for this topic
is the adaptation of the neural network that is already in use to correct
classification of a new ""normal traffic"" and of an attack representation not
presented during the network training process. When it comes to the new attack
it should also be easy to obtain vectors to test and to retrain the neural
classifier. We describe the proposal of an algorithm and a distributed IDS
architecture that could achieve the goals mentioned above.
","[{'version': 'v1', 'created': 'Mon, 13 Sep 2010 14:35:41 GMT'}]",2010-09-14,"[['Kukielka', 'Przemyslaw', ''], ['Kotulski', 'Zbigniew', '']]","['Internet security', 'intrusion detection', 'neural network adaptation']"
15947,1306.3317,Mohsen Joneidi,Mohsen Joneidi,Sparse Auto-Regressive: Robust Estimation of AR Parameters,"4 pages, 4 figures",,,,cs.AI,http://creativecommons.org/licenses/by/4.0/,"  In this paper I present a new approach for regression of time series using
their own samples. This is a celebrated problem known as Auto-Regression.
Dealing with outlier or missed samples in a time series makes the problem of
estimation difficult, so it should be robust against them. Moreover for coding
purposes I will show that it is desired the residual of auto-regression be
sparse. To these aims, I first assume a multivariate Gaussian prior on the
residual and then obtain the estimation. Two simple simulations have been done
on spectrum estimation and speech coding.
","[{'version': 'v1', 'created': 'Fri, 14 Jun 2013 07:49:44 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Aug 2015 16:59:06 GMT'}]",2015-08-19,"[['Joneidi', 'Mohsen', '']]","['AR parameter estimation', 'Robust estimation', 'Spectral estimation', 'Speech coding']"
15948,1510.05326,Steffen Lewitzka,Steffen Lewitzka,Combining intermediate propositional logics with classical logic,18 pages,,,"TR-PGCOMP-001/2015. Technical Report. Computer Science Graduate
  Program. Federal University of Bahia",cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In [17], we introduced a modal logic, called $L$, which combines
intuitionistic propositional logic $IPC$ and classical propositional logic
$CPC$ and is complete w.r.t. an algebraic semantics. However, $L$ seems to be
too weak for Kripke-style semantics. In this paper, we add positive and
negative introspection and show that the resulting logic $L5$ has a Kripke
semantics. For intermediate logics $I$, we consider the parametrized versions
$L5(I)$ of $L5$ where $IPC$ is replaced by $I$. $L5(I)$ can be seen as a
classical modal logic for the reasoning about truth in $I$. From our results,
we derive a simple method for determining algebraic and Kripke semantics for
some specific intermediate logics. We discuss some examples which are of
interest for Computer Science, namely the Logic of Here-and-There,
G\""odel-Dummett Logic and Jankov Logic. Our method provides new proofs of
completeness theorems due to Hosoi, Dummett/Horn and Jankov, respectively.
","[{'version': 'v1', 'created': 'Mon, 19 Oct 2015 00:23:01 GMT'}]",2015-10-20,"[['Lewitzka', 'Steffen', '']]","['intuitionistic logic', 'intermediate logic', 'non-Fregean logic', 'Heyting algebra', 'Logic of Here-and-There', 'G¨odel-Dummett Logic', 'Jankov Logic']"
15949,1605.02226,Marc-Alexandre C\^ot\'e,"Benigno Uria, Marc-Alexandre C\^ot\'e, Karol Gregor, Iain Murray, Hugo
  Larochelle",Neural Autoregressive Distribution Estimation,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present Neural Autoregressive Distribution Estimation (NADE) models, which
are neural network architectures applied to the problem of unsupervised
distribution and density estimation. They leverage the probability product rule
and a weight sharing scheme inspired from restricted Boltzmann machines, to
yield an estimator that is both tractable and has good generalization
performance. We discuss how they achieve competitive performance in modeling
both binary and real-valued observations. We also present how deep NADE models
can be trained to be agnostic to the ordering of input dimensions used by the
autoregressive product rule decomposition. Finally, we also show how to exploit
the topological structure of pixels in images using a deep convolutional
architecture for NADE.
","[{'version': 'v1', 'created': 'Sat, 7 May 2016 18:13:25 GMT'}, {'version': 'v2', 'created': 'Wed, 11 May 2016 12:00:17 GMT'}, {'version': 'v3', 'created': 'Fri, 27 May 2016 14:25:41 GMT'}]",2016-05-30,"[['Uria', 'Benigno', ''], ['Côté', 'Marc-Alexandre', ''], ['Gregor', 'Karol', ''], ['Murray', 'Iain', ''], ['Larochelle', 'Hugo', '']]","['Deep Learning', 'Neural Networks', 'Density Modeling', 'Unsupervised Learning']"
15950,1701.08190,Mohamed Anis Bach Tobji Dr.,Mohamed Anis Bach Tobji,Comparative Study Of Data Mining Query Languages,,,,,cs.AI cs.DB,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Since formulation of Inductive Database (IDB) problem, several Data Mining
(DM) languages have been proposed, confirming that KDD process could be
supported via inductive queries (IQ) answering. This paper reviews the existing
DM languages. We are presenting important primitives of the DM language and
classifying our languages according to primitives' satisfaction. In addition,
we presented languages' syntaxes and tried to apply each one to a database
sample to test a set of KDD operations. This study allows us to highlight
languages capabilities and limits, which is very useful for future work and
perspectives.
","[{'version': 'v1', 'created': 'Fri, 27 Jan 2017 21:00:19 GMT'}]",2017-01-31,"[['Tobji', 'Mohamed Anis Bach', '']]","['Knowledge Discovery from Databases', 'Inductive Database', 'Data Mining Languages']"
15951,1710.04991,Narjes Tahghigh Jahromi,"Narjes Tahghigh Jahromi, Roch H. Glitho, Adel Larabi, Richard Brunner","An NFV and Microservice Based Architecture for On-the-fly Component
  Provisioning in Content Delivery Networks","7 pages, 6 figures, 2 tables",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Content Delivery Networks (CDNs) deliver content (e.g. Web pages, videos) to
geographically distributed end-users over the Internet. Some contents do
sometimes attract the attention of a large group of end-users. This often leads
to flash crowds which can cause major issues such as outage in the CDN.
Microservice architectural style aims at decomposing monolithic systems into
smaller components which can be independently deployed, upgraded and disposed.
Network Function Virtualization (NFV) is an emerging technology that aims to
reduce costs and bring agility by decoupling network functions from the
underlying hardware. This paper leverages the NFV and microservice
architectural style to propose an architecture for on-the-fly CDN component
provisioning to tackle issues such as flash crowds. In the proposed
architecture, CDN components are designed as sets of microservices which
interact via RESTFul Web services and are provisioned as Virtual Network
Functions (VNFs), which are deployed and orchestrated on-the-fly. We have built
a prototype in which a CDN surrogate server, designed as a set of
microservices, is deployed on-the-fly. The prototype is deployed on SAVI, a
Canadian distributed test bed for future Internet applications. The performance
is also evaluated.
","[{'version': 'v1', 'created': 'Fri, 13 Oct 2017 16:32:45 GMT'}]",2017-10-16,"[['Jahromi', 'Narjes Tahghigh', ''], ['Glitho', 'Roch H.', ''], ['Larabi', 'Adel', ''], ['Brunner', 'Richard', '']]","['Content Delivery Network', 'CDN', 'Network Function Virtualization', 'NFV', 'Microservice', 'Architecture', 'onthe-fly component provisioning']"
15952,1511.02992,Mrinal Haloi,Mrinal Haloi,"Traffic Sign Classification Using Deep Inception Based Convolutional
  Networks","modifications: Accepted version of 2016 IEEE Intelligent Vehicles
  Symposium (IV 2016)",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we propose a novel deep network for traffic sign classification
that achieves outstanding performance on GTSRB surpassing all previous methods.
Our deep network consists of spatial transformer layers and a modified version
of inception module specifically designed for capturing local and global
features together. This features adoption allows our network to classify
precisely intraclass samples even under deformations. Use of spatial
transformer layer makes this network more robust to deformations such as
translation, rotation, scaling of input images. Unlike existing approaches that
are developed with hand-crafted features, multiple deep networks with huge
parameters and data augmentations, our method addresses the concern of
exploding parameters and augmentations. We have achieved the state-of-the-art
performance of 99.81\% on GTSRB dataset.
","[{'version': 'v1', 'created': 'Tue, 10 Nov 2015 05:07:03 GMT'}, {'version': 'v2', 'created': 'Sun, 17 Jul 2016 11:05:22 GMT'}]",2016-07-19,"[['Haloi', 'Mrinal', '']]","['Advanced Driver Assistant System', 'Image Classification', 'Traffic Sign', 'Deep Networks']"
15953,1511.00461,Magnus Andersson,"Hanqing Zhang, Krister Wiklund, Magnus Andersson",Circle detection using isosceles triangles sampling,"Manuscript, 31 pages, 11 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detection of circular objects in digital images is an important problem in
several vision applications. Circle detection using randomized sampling has
been developed in recent years to reduce the computational intensity.
Randomized sampling, however, is sensitive to noise that can lead to reduced
accuracy and false-positive candidates. This paper presents a new circle
detection method based upon randomized isosceles triangles sampling to improve
the robustness of randomized circle detection in noisy conditions. It is shown
that the geometrical property of isosceles triangles provide a robust criterion
to find relevant edge pixels and thereby efficiently provide an estimation of
the circle center and radii. The estimated results given by the isosceles
triangles sampling from each connected component of edge map were analyzed
using a simple clustering approach for efficiency. To further improve on the
accuracy we applied a two-step refinement process using chords and linear error
compensation with gradient information of the edge pixels. Extensive
experiments using both synthetic and real images were presented and results
were compared to leading state-of-the-art algorithms and showed that the
proposed algorithm: are efficient in finding circles with a low number of
iterations; has high rejection rate of false-positive circle candidates; and
has high robustness against noise, making it adaptive and useful in many vision
applications.
","[{'version': 'v1', 'created': 'Mon, 2 Nov 2015 11:55:30 GMT'}]",2015-11-03,"[['Zhang', 'Hanqing', ''], ['Wiklund', 'Krister', ''], ['Andersson', 'Magnus', '']]","['Circle detection', 'Randomized algorithm', 'Sampling strategy', 'Isosceles triangles']"
15954,1611.00317,Philip Pong,"X. Liu, K. H. Lam, K. Zhu, C. Zheng, X. Li, Y. Du, Chunhua Liu, P. W.
  T. Pong","Overview of Spintronic Sensors, Internet of Things, and Smart Living",,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smart living is a trending lifestyle that envisions lower energy consumption,
sound public services, and better quality of life for human being. The Internet
of Things (IoT) is a compelling platform connecting various sensors around us
to the Internet, providing great opportunities for the realization of smart
living. Spintronic sensors with superb measuring ability and multiple unique
advantages can be an important piece of cornerstone for IoT. In this review, we
discuss successful applications of spintronic sensors in electrical current
sensing, transmission and distribution lines monitoring, vehicle detection, and
biodetection. Traditional monitoring systems with limited sensors and wired
communication can merely collect fragmented data in the application domains. In
this paper, the wireless spintronic sensor networks (WSSNs) will be proposed
and illustrated to provide pervasive monitoring systems, which facilitate the
intelligent surveillance and management over building, power grid, transport,
and healthcare. The database of collected information will be of great use to
the policy making in public services and city planning. This work provides
insights for realizing smart living through the integration of IoT with
spintronic sensor technology.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2016 09:16:54 GMT'}]",2016-11-02,"[['Liu', 'X.', ''], ['Lam', 'K. H.', ''], ['Zhu', 'K.', ''], ['Zheng', 'C.', ''], ['Li', 'X.', ''], ['Du', 'Y.', ''], ['Liu', 'Chunhua', ''], ['Pong', 'P. W. T.', '']]","['smart living', 'Internet of Things', 'spintronic sensors', 'wireless spintronic sensor network']"
15955,1207.5466,Yongge Wang,Yongge Wang and Xintao Wu,"Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and
  Approximation",,"Proc. 5th IEEE ICDM, pages 482-289, 2005",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to generate synthetic basket data sets for better benchmark testing,
it is important to integrate characteristics from real-life databases into the
synthetic basket data sets. The characteristics that could be used for this
purpose include the frequent itemsets and association rules. The problem of
generating synthetic basket data sets from frequent itemsets is generally
referred to as inverse frequent itemset mining. In this paper, we show that the
problem of approximate inverse frequent itemset mining is {\bf NP}-complete.
Then we propose and analyze an approximate algorithm for approximate inverse
frequent itemset mining, and discuss privacy issues related to the synthetic
basket data set. In particular, we propose an approximate algorithm to
determine the privacy leakage in a synthetic basket data set.
","[{'version': 'v1', 'created': 'Mon, 23 Jul 2012 17:57:47 GMT'}]",2012-07-24,"[['Wang', 'Yongge', ''], ['Wu', 'Xintao', '']]","['data mining', 'privacy', 'complexity', 'inverse frequent itemsetmining']"
15956,2006.04167,Agi Kurucz,"Olga Gerasimova, Stanislav Kikot, Agi Kurucz, Vladimir Podolskii,
  Michael Zakharyaschev",A tetrachotomy of ontology-mediated queries with a covering axiom,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our concern is the problem of efficiently determining the data complexity of
answering queries mediated by description logic ontologies and constructing
their optimal rewritings to standard database queries. Originated in
ontology-based data access and datalog optimisation, this problem is known to
be computationally very complex in general, with no explicit syntactic
characterisations available. In this article, aiming to understand the
fundamental roots of this difficulty, we strip the problem to the bare bones
and focus on Boolean conjunctive queries mediated by a simple covering axiom
stating that one class is covered by the union of two other classes. We show
that, on the one hand, these rudimentary ontology-mediated queries, called
disjunctive sirups (or d-sirups), capture many features and difficulties of the
general case. For example, answering d-sirups is Pi^p_2-complete for combined
complexity and can be in AC0 or LogSpace-, NL-, P-, or coNP-complete for data
complexity (with the problem of recognising FO-rewritability of d-sirups being
2ExpTime-hard); some d-sirups only have exponential-size resolution proofs,
some only double-exponential-size positive existential FO-rewritings and
single-exponential-size nonrecursive datalog rewritings. On the other hand, we
prove a few partial sufficient and necessary conditions of FO- and
(symmetric/linear-) datalog rewritability of d-sirups. Our main technical
result is a complete and transparent syntactic AC0/NL/P/coNP tetrachotomy of
d-sirups with disjoint covering classes and a path-shaped Boolean conjunctive
query. To obtain this tetrachotomy, we develop new techniques for establishing
P- and coNP-hardness of answering non-Horn ontology-mediated queries as well as
showing that they can be answered in NL.
","[{'version': 'v1', 'created': 'Sun, 7 Jun 2020 14:47:07 GMT'}, {'version': 'v2', 'created': 'Sun, 19 Jul 2020 16:52:59 GMT'}, {'version': 'v3', 'created': 'Sat, 31 Jul 2021 15:00:18 GMT'}, {'version': 'v4', 'created': 'Thu, 5 May 2022 10:22:56 GMT'}]",2022-05-06,"[['Gerasimova', 'Olga', ''], ['Kikot', 'Stanislav', ''], ['Kurucz', 'Agi', ''], ['Podolskii', 'Vladimir', ''], ['Zakharyaschev', 'Michael', '']]","['Ontology-mediated query', 'description logic', 'datalog', 'disjunctive datalog', 'first-order rewritability', 'datacomplexity']"
15957,1404.0578,Hiroki Sayama,Xinpei Ma and Hiroki Sayama,"Mental Disorder Recovery Correlated with Centralities and Interactions
  on an Online Social Network","20 pages, 5 figures, 5 tables; accepted for publication in PeerJ","PeerJ, 3:e1163 (2015)",,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent research has established both a theoretical basis and strong empirical
evidence that effective social behavior plays a beneficial role in the
maintenance of physical and psychological well-being of people. To test whether
social behavior and well-being are also associated in online communities, we
studied the correlations between the recovery of patients with mental disorders
and their behaviors in online social media. As the source of the data related
to the social behavior and progress of mental recovery, we used PatientsLikeMe
(PLM), the world's first open-participation research platform for the
development of patient-centered health outcome measures. We first constructed
an online social network structure based on patient-to-patient ties among 200
patients obtained from PLM. We then characterized patients' online social
activities by measuring the numbers of ""posts and views"" and ""helpful marks""
each patient obtained. The patients' recovery data were obtained from their
self-reported status information that was also available on PLM. We found that
some node properties (in-degree, eigenvector centrality and PageRank) and the
two online social activity measures were significantly correlated with
patients' recovery. Furthermore, we re-collected the patients' recovery data
two months after the first data collection. We found significant correlations
between the patients' social behaviors and the second recovery data, which were
collected two months apart. Our results indicated that social interactions in
online communities such as PLM were significantly associated with the current
and future recoveries of patients with mental disorders.
","[{'version': 'v1', 'created': 'Wed, 2 Apr 2014 14:50:32 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Oct 2014 17:41:46 GMT'}, {'version': 'v3', 'created': 'Thu, 30 Jul 2015 02:44:42 GMT'}]",2017-05-29,"[['Ma', 'Xinpei', ''], ['Sayama', 'Hiroki', '']]","['social media', 'mental disorder', 'social network', 'patient-to-patientnetwork', 'non-drug treatments', 'PatientsLikeMe']"
15958,1802.06265,Amin Javari,"Amin Javari, HongXiang Qiu, Elham Barzegaran, Mahdi Jalili, Kevin
  Chen-Chuan Chang","Statistical Link Label Modeling for Sign Prediction: Smoothing Sparsity
  by Joining Local and Global Information",,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the major issues in signed networks is to use network structure to
predict the missing sign of an edge. In this paper, we introduce a novel
probabilistic approach for the sign prediction problem. The main characteristic
of the proposed models is their ability to adapt to the sparsity level of an
input network. The sparsity of networks is one of the major reasons for the
poor performance of many link prediction algorithms, in general, and sign
prediction algorithms, in particular. Building a model that has an ability to
adapt to the sparsity of the data has not yet been considered in the previous
related works. We suggest that there exists a dilemma between local and global
structures and attempt to build sparsity adaptive models by resolving this
dilemma. To this end, we propose probabilistic prediction models based on local
and global structures and integrate them based on the concept of smoothing. The
model relies more on the global structures when the sparsity increases, whereas
it gives more weights to the information obtained from local structures for low
levels of the sparsity. The proposed model is assessed on three real-world
signed networks, and the experiments reveal its consistent superiority over the
state of the art methods. As compared to the previous methods, the proposed
model not only better handles the sparsity problem, but also has lower
computational complexity and can be updated using real-time data streams.
","[{'version': 'v1', 'created': 'Sat, 17 Feb 2018 17:45:10 GMT'}]",2018-02-20,"[['Javari', 'Amin', ''], ['Qiu', 'HongXiang', ''], ['Barzegaran', 'Elham', ''], ['Jalili', 'Mahdi', ''], ['Chang', 'Kevin Chen-Chuan', '']]","['Link label prediction', 'Signed networks', 'Smoothing', 'Local structure', 'Global structure']"
15959,1003.1799,Rdv Ijcsis,"D. SuganyaDevi, G.Padmavathi",Secure Multicast Key Distribution for Mobile Ad Hoc Networks,"Pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS, Vol. 7 No. 2, February 2010, USA. ISSN 1947
  5500, http://sites.google.com/site/ijcsis/",,,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Many emerging applications in mobile adhoc networks involve group-oriented
communication. Multicast is an efficient way of supporting group oriented
applications, mainly in mobile environment with limited bandwidth and limited
power. For using such applications in an adversarial environment as military,
it is necessary to provide secure multicast communication. Key management is
the fundamental challenge in designing secure multicast communications. In many
multicast interactions, new member can join and current members can leave at
any time and existing members must communicate securely using multicast key
distribution within constrained energy for mobile adhoc networks. This has to
overcome the challenging element of ""1 affects n"" problem which is due to high
dynamicity of groups. Thus this paper shows the specific challenges towards
multicast key management protocols for securing multicast key distribution in
mobile ad hoc networks, and present relevant multicast key management protocols
in mobile ad hoc networks. A comparison is done against some pertinent
performance criteria.
","[{'version': 'v1', 'created': 'Tue, 9 Mar 2010 06:53:32 GMT'}]",2010-03-10,"[['SuganyaDevi', 'D.', ''], ['Padmavathi', 'G.', '']]","['Key Management', 'MANET', 'Multicast Communication', 'Security']"
15960,1205.2850,Indu Shakya,"Indu L. Shakya, Falah H. Ali","Spectral Efficiency of Multiple Access Fading Channels with Adaptive
  Interference Cancellation",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reliable estimation of users' channels and data in rapidly time varying
fading environments is a very challenging task of multiuser detection (MUD)
techniques that promise impressive capacity gains for interference limited
systems such as non-orthogonal CDMA and spatial multiplexing MIMO based LTE.
This paper analyzes relative channel estimation error performances of
conventional single user and multiuser receivers for an uplink of DS-CDMA and
shows their impact on output signal to interference and noise ratio (SINR)
performances. Mean squared error (MSE) of channel estimation and achievable
spectral efficiencies of these receivers obtained from the output SINR
calculations are then compared with that achieved with new adaptive
interference canceling receivers. It is shown that the adaptive receivers using
successive (SIC) and parallel interference cancellation (PIC) methods offer
much improved channel estimation and SINR performances, and hence significant
increase in achievable sum date rates.
","[{'version': 'v1', 'created': 'Sun, 13 May 2012 10:04:28 GMT'}]",2012-05-15,"[['Shakya', 'Indu L.', ''], ['Ali', 'Falah H.', '']]","['Multiuser Detection', 'Interference Cancellation', 'Channel Estimation']"
15961,1610.02293,Sandra Castellanos-Paez,"Sandra Castellanos-Paez (LIG Laboratoire d'Informatique de Grenoble),
  Damien Pellier (LIG Laboratoire d'Informatique de Grenoble), Humbert Fiorino
  (LIG Laboratoire d'Informatique de Grenoble), Sylvie Pesty (LIG Laboratoire
  d'Informatique de Grenoble)",Learning Macro-actions for State-Space Planning,"Journ{\'e}es Francophones sur la Planification, la D{\'e}cision et
  l'Apprentissage pour la conduite de syst{\`e}mes (JFPDA 2016) , Jul 2016,
  Grenoble, France. 2016",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Planning has achieved significant progress in recent years. Among the various
approaches to scale up plan synthesis, the use of macro-actions has been widely
explored. As a first stage towards the development of a solution to learn
on-line macro-actions, we propose an algorithm to identify useful macro-actions
based on data mining techniques. The integration in the planning search of
these learned macro-actions shows significant improvements over four classical
planning benchmarks.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2016 14:06:40 GMT'}]",2016-10-10,"[['Castellanos-Paez', 'Sandra', '', ""LIG Laboratoire d'Informatique de Grenoble""], ['Pellier', 'Damien', '', ""LIG Laboratoire d'Informatique de Grenoble""], ['Fiorino', 'Humbert', '', ""LIG Laboratoire d'Informatique de Grenoble""], ['Pesty', 'Sylvie', '', ""LIG Laboratoire\n  d'Informatique de Grenoble""]]","['Automated Planning', 'Data Mining', 'Macro-actions', 'Learning']"
15962,1304.5849,Marcin Kami\'nski,Jaroslaw Blasiok and Marcin Kaminski,Chain minors are FPT,,,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given two finite posets P and Q, P is a chain minor of Q if there exists a
partial function f from the elements of Q to the elements of P such that for
every chain in P there is a chain C_Q in Q with the property that f restricted
to C_Q is an isomorphism of chains. We give an algorithm to decide whether a
poset P is a chain minor of o poset Q that runs in time O(|Q| log |Q|) for
every fixed poset P. This solves an open problem from the monograph by Downey
and Fellows [Parameterized Complexity, 1999] who asked whether the problem was
fixed parameter tractable.
","[{'version': 'v1', 'created': 'Mon, 22 Apr 2013 06:22:34 GMT'}]",2013-04-23,"[['Blasiok', 'Jaroslaw', ''], ['Kaminski', 'Marcin', '']]","['partially ordered sets', 'parameterized complexity', 'data structures and algorithms']"
15963,1702.07205,Waldemar Koczkodaj Prof.,"W.W. Koczkodaj and J.-P. Magnot and J. Mazurek and J.F. Peters and H.
  Rakhshani and M. Soltys and D. Strza{\l}ka and J. Szybowski and A. Tozzi",On normalization of inconsistency indicators in pairwise comparisons,"15 pages, 3 figures",,,,cs.DM,http://creativecommons.org/publicdomain/zero/1.0/,"  In this study, we provide mathematical and practice-driven justification for
using $[0,1]$ normalization of inconsistency indicators in pairwise
comparisons. The need for normalization, as well as problems with the lack of
normalization, are presented. A new type of paradox of infinity is described.
","[{'version': 'v1', 'created': 'Thu, 23 Feb 2017 13:33:51 GMT'}, {'version': 'v2', 'created': 'Sat, 25 Feb 2017 17:48:19 GMT'}]",2017-02-28,"[['Koczkodaj', 'W. W.', ''], ['Magnot', 'J. -P.', ''], ['Mazurek', 'J.', ''], ['Peters', 'J. F.', ''], ['Rakhshani', 'H.', ''], ['Soltys', 'M.', ''], ['Strzałka', 'D.', ''], ['Szybowski', 'J.', ''], ['Tozzi', 'A.', '']]","['pairwise comparisons', 'inconsistency indicator', 'normalization', 'decision making']"
15964,1704.05817,Wenbin Li,"Wenbin Li, Da Chen, Zhihan Lv, Yan Yan, Darren Cosker",Learn to Model Motion from Blurry Footages,Preprint of our paper accepted by Pattern Recognition,,,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  It is difficult to recover the motion field from a real-world footage given a
mixture of camera shake and other photometric effects. In this paper we propose
a hybrid framework by interleaving a Convolutional Neural Network (CNN) and a
traditional optical flow energy. We first conduct a CNN architecture using a
novel learnable directional filtering layer. Such layer encodes the angle and
distance similarity matrix between blur and camera motion, which is able to
enhance the blur features of the camera-shake footages. The proposed CNNs are
then integrated into an iterative optical flow framework, which enable the
capability of modelling and solving both the blind deconvolution and the
optical flow estimation problems simultaneously. Our framework is trained
end-to-end on a synthetic dataset and yields competitive precision and
performance against the state-of-the-art approaches.
","[{'version': 'v1', 'created': 'Wed, 19 Apr 2017 16:54:54 GMT'}]",2017-04-20,"[['Li', 'Wenbin', ''], ['Chen', 'Da', ''], ['Lv', 'Zhihan', ''], ['Yan', 'Yan', ''], ['Cosker', 'Darren', '']]","['Optical Flow', 'Convolutional Neural Network (CNN)', 'Video/Image Deblurring', 'Directional Filtering']"
15965,1407.1706,Ignasi Sau,Henri Perret du Cray and Ignasi Sau,Improved FPT algorithms for weighted independent set in bull-free graphs,15 pages,,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Very recently, Thomass\'e, Trotignon and Vuskovic [WG 2014] have given an FPT
algorithm for Weighted Independent Set in bull-free graphs parameterized by the
weight of the solution, running in time $2^{O(k^5)} \cdot n^9$. In this article
we improve this running time to $2^{O(k^2)} \cdot n^7$. As a byproduct, we also
improve the previous Turing-kernel for this problem from $O(k^5)$ to $O(k^2)$.
Furthermore, for the subclass of bull-free graphs without holes of length at
most $2p-1$ for $p \geq 3$, we speed up the running time to $2^{O(k \cdot
k^{\frac{1}{p-1}})} \cdot n^7$. As $p$ grows, this running time is
asymptotically tight in terms of $k$, since we prove that for each integer $p
\geq 3$, Weighted Independent Set cannot be solved in time $2^{o(k)} \cdot
n^{O(1)}$ in the class of $\{bull,C_4,\ldots,C_{2p-1}\}$-free graphs unless the
ETH fails.
","[{'version': 'v1', 'created': 'Mon, 7 Jul 2014 13:28:22 GMT'}]",2014-07-08,"[['Cray', 'Henri Perret du', ''], ['Sau', 'Ignasi', '']]","['parameterized complexity', 'FPT algorithm', 'bull-free graphs', 'independent set', 'Turing-kernel']"
15966,1209.5192,"H. G\""okalp Demirci","H. G\""okalp Demirci, A. C. Cem Say and Abuzer Yakary{\i}lmaz",Probabilistic verifiers for asymmetric debates,,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We examine the power of silent constant-space probabilistic verifiers that
watch asymmetric debates (where one side is unable to see some of the messages
of the other) between two deterministic provers, and try to determine who is
right. We prove that probabilistic verifiers outperform their deterministic
counterparts as asymmetric debate checkers. It is shown that the membership
problem for every language in NSPACE(s(n)) has a 2^{s(n)}-time debate where one
prover is completely blind to the other one, for polynomially bounded space
constructible s(n). When partial information is allowed to be seen by the
handicapped prover, the class of languages debatable in 2^{s(n)} time contains
TIME(2^{s(n)}), so a probabilistic finite automaton can solve any decision
problem in P with small error in polynomial time with the aid of such a debate.
We also compare our systems with those with a single prover, and with
competing-prover interactive proof systems.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2012 08:44:46 GMT'}]",2012-09-25,"[['Demirci', 'H. Gökalp', ''], ['Say', 'A. C. Cem', ''], ['Yakaryılmaz', 'Abuzer', '']]","['partial information debates', 'games', 'alternation', 'probabilistic computation']"
15967,1009.1976,Carlos A. Romero-Diaz,"Rafael Caballero, Mario Rodr\'iguez-Artalejo and Carlos A.
  Romero-D\'iaz","A Transformation-based Implementation for CLP with Qualification and
  Proximity","49 pages, 5 figures, 1 table, preliminary version of an article of
  the same title, published as Technical Report SIC-4-10, Universidad
  Complutense, Departamento de Sistemas Inform\'aticos y Computaci\'on, Madrid,
  Spain",,,SIC-4-10,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Uncertainty in logic programming has been widely investigated in the last
decades, leading to multiple extensions of the classical LP paradigm. However,
few of these are designed as extensions of the well-established and powerful
CLP scheme for Constraint Logic Programming. In a previous work we have
proposed the SQCLP (proximity-based qualified constraint logic programming)
scheme as a quite expressive extension of CLP with support for qualification
values and proximity relations as generalizations of uncertainty values and
similarity relations, respectively. In this paper we provide a transformation
technique for transforming SQCLP programs and goals into semantically
equivalent CLP programs and goals, and a practical Prolog-based implementation
of some particularly useful instances of the SQCLP scheme. We also illustrate,
by showing some simple-and working-examples, how the prototype can be
effectively used as a tool for solving problems where qualification values and
proximity relations play a key role. Intended use of SQCLP includes flexible
information retrieval applications.
","[{'version': 'v1', 'created': 'Fri, 10 Sep 2010 10:26:38 GMT'}]",2010-09-13,"[['Caballero', 'Rafael', ''], ['Rodríguez-Artalejo', 'Mario', ''], ['Romero-Díaz', 'Carlos A.', '']]","['Constraint Logic Programming', 'Program Transformation', 'QualificationDomains and Values', 'Similarity and Proximity Relations', 'Flexible Information Retrieval']"
15968,1208.5528,Serhat Avci,Serhat Nazim Avci and Ender Ayanoglu,"Coded Path Protection Part 2: Design, Implementation, and Performance","This is the Part 2 of a two part paper. A simple version of these two
  papers is published in the proceedings of IEEE ICC 2012",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Part 1 of this paper, we introduced a coding-based proactive network
protection scheme, named Coded Path Protection (CPP). In CPP, a backup stream
of the primary data is encoded with other data streams, resulting in capacity
savings. In addition to being a systematic approach of building valid coding
structures, CPP is an optimal and simple capacity placement and coding group
formation algorithm. It converts the sharing structure of any solution of a
Shared Path Protection (SPP) technique into a coding structure with minimum
extra capacity. In this Part 2 of the paper, we describe the implementation of
our algorithm using Integer Linear Programming (ILP), its timing and
synchronization requirements, and implementation issues in networks. We present
simulation results which confirm that CPP provides faster link failure recovery
than SPP while it incurs marginal extra capacity beyond that of SPP.
","[{'version': 'v1', 'created': 'Mon, 27 Aug 2012 22:52:24 GMT'}]",2012-08-29,"[['Avci', 'Serhat Nazim', ''], ['Ayanoglu', 'Ender', '']]","['Networks', 'network fault tolerance', 'codes', 'sharedpath protection', 'network coding']"
15969,1110.1842,Antonio Fern\'andez Anta,"Sergio Ar\'evalo and Antonio Fern\'andez Anta and Damien Imbs and
  Ernesto Jim\'enez and Michel Raynal","Failure Detectors in Homonymous Distributed Systems (with an Application
  to Consensus)",,,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the consensus problem in homonymous distributed systems
where processes are prone to crash failures and have no initial knowledge of
the system membership (""homonymous"" means that several processes may have the
same identifier). New classes of failure detectors suited to these systems are
first defined. Among them, the classes H\Omega\ and H\Sigma\ are introduced
that are the homonymous counterparts of the classes \Omega\ and \Sigma,
respectively. (Recall that the pair <\Omega,\Sigma> defines the weakest failure
detector to solve consensus.) Then, the paper shows how H\Omega\ and H\Sigma\
can be implemented in homonymous systems without membership knowledge (under
different synchrony requirements). Finally, two algorithms are presented that
use these failure detectors to solve consensus in homonymous asynchronous
systems where there is no initial knowledge of the membership. One algorithm
solves consensus with <H\Omega,H\Sigma>, while the other uses only H\Omega, but
needs a majority of correct processes.
  Observe that the systems with unique identifiers and anonymous systems are
extreme cases of homonymous systems from which follows that all these results
also apply to these systems. Interestingly, the new failure detector class
H\Omega\ can be implemented with partial synchrony, while the analogous class
A\Omega\ defined for anonymous systems can not be implemented (even in
synchronous systems). Hence, the paper provides us with the first proof showing
that consensus can be solved in anonymous systems with only partial synchrony
(and a majority of correct processes).
","[{'version': 'v1', 'created': 'Sun, 9 Oct 2011 14:09:44 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Nov 2011 10:45:07 GMT'}, {'version': 'v3', 'created': 'Sun, 27 Nov 2011 13:32:28 GMT'}]",2011-11-29,"[['Arévalo', 'Sergio', ''], ['Anta', 'Antonio Fernández', ''], ['Imbs', 'Damien', ''], ['Jiménez', 'Ernesto', ''], ['Raynal', 'Michel', '']]","['Agreement problem', 'Asynchrony', 'Consensus', 'Distributed computability', 'failure detector', 'Homonymous system', 'Message-passing', 'Process crash']"
15970,1306.2453,Dibakar Saha,"Dibakar Saha, Nabanita Das","A Fast Fault Tolerant Partitioning Algorithm for Wireless Sensor
  Networks",,,,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, given a random uniform distribution of sensor nodes on a 2-D
plane, a fast self-organized distributed algorithm is proposed to find the
maximum number of partitions of the nodes such that each partition is connected
and covers the area to be monitored. Each connected partition remains active in
a round robin fashion to cover the query region individually. In case of a node
failure, the proposed distributed fault recovery algorithm reconstructs the
affected partition locally utilizing the available free nodes. Simulation
studies show significant improvement in performance compared to the earlier
works in terms of computation time, the diameter of each partition, message
overhead and network lifetime.
","[{'version': 'v1', 'created': 'Tue, 11 Jun 2013 08:41:27 GMT'}]",2013-06-12,"[['Saha', 'Dibakar', ''], ['Das', 'Nabanita', '']]","['Wireless Sensor Network (WSN)', 'Self Organization', 'Coverage', 'Partition', 'Network Lifetime', 'Fault Tolerant']"
15971,1212.5543,Muhammad Imran Imran,"Muhammad Imran, Halabi B. Hasbullah, Abas Md Said",Personality wireless sensor networks (PWSNs),"7th Annual Seminar on Science and Technology, Universiti Malaysia
  Sabah, 2008",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, WSNs are garnering lot of interest from research community
because of their unique characteristics and potential for enormous range of
applications. Envision for new class of applications are being emerged such as
human augmentation, enhancing social interaction etc. Misunderstanding or
misinterpretation of behaviors from individuals leads to social conflicts.
There are various theories that classify people into different personality
types. Most of the existing theories rely on questionnaires, which is highly
unreliable. Anyone can lead such theories in practice to incorrect
classification intentionally or unintentionally. The objective of this research
is to investigate existing solutions and propose a basic infrastructure for an
automated context-aware psychological classification based on different
parameters. The idea is to use wearable sensors to sense and measure various
human body parameters (i.e. body temperature, blood pressure, perspiration,
brain impulses etc) that coerce human psychological condition. The data
collected from these parameters is transformed in to information, to determine
personality type, mood and psychological condition of interacting parties. This
information is shared among counterparts to better understand each other in
order to avoid potential conflicting situations. We believe that it will help
peoples understand each other, improve their quality of life and minimize
possible conflicting situations.
","[{'version': 'v1', 'created': 'Fri, 21 Dec 2012 18:15:23 GMT'}]",2012-12-24,"[['Imran', 'Muhammad', ''], ['Hasbullah', 'Halabi B.', ''], ['Said', 'Abas Md', '']]","['Misunderstanding', 'misinterpretation', 'automated context-aware psychologicalclassification', 'personality wireless wensor networks (PWSNs)']"
15972,1505.06130,Mukul Agarwal,"Mukul Agarwal, Sanjoy MItter","A randomized covering-packing duality between source-coding and
  channel-coding",arXiv admin note: text overlap with arXiv:1302.5860,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A randomized covering-packing duality between source and channel coding will
be discussed by considering the source coding problem of coding a source with a
certain distortion level and by considering a channel which communicates the
source within a certain distortion level. An operational view of source-channel
separation for communication with a fidelity criterion will be discussed in
brief.
","[{'version': 'v1', 'created': 'Fri, 22 May 2015 16:00:22 GMT'}]",2015-05-25,"[['Agarwal', 'Mukul', ''], ['MItter', 'Sanjoy', '']]","['duality', 'covering', 'packing', 'source coding', 'channel coding', 'randomized', 'operational']"
15973,1609.01373,Yuya Higashikawa,"Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko
  Kameda and Naoki Katoh",Improved Algorithms for Computing $k$-Sink on Dynamic Path Networks,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a novel approach to finding the $k$-sink on dynamic path networks
with general edge capacities. Our first algorithm runs in $O(n \log n + k^2
\log^4 n)$ time, where $n$ is the number of vertices on the given path, and our
second algorithm runs in $O(n \log^3 n)$ time. Together, they improve upon the
previously most efficient $O(kn \log^2 n)$ time algorithm due to Arumugam et
al. for all values of $k$. In the case where all the edges have the same
capacity, we again present two algorithms that run in $O(n + k^2 \log^2n)$ time
and $O(n \log n)$ time, respectively, and they together improve upon the
previously best $O(kn)$ time algorithm due to Higashikawa et al. for all values
of $k$.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2016 02:19:29 GMT'}]",2016-09-07,"[['Bhattacharya', 'Binay', ''], ['Golin', 'Mordecai J.', ''], ['Higashikawa', 'Yuya', ''], ['Kameda', 'Tsunehiko', ''], ['Katoh', 'Naoki', '']]","['Facility location', 'k-sink', 'parametric search', 'dynamic path network']"
15974,1108.1341,Bingxuan Zhao,Bingxuan Zhao and Shigeru Shimamoto,"Two-stage coordination multi-radio multi-channel mac protocol for
  wireless mesh networks",18 pages 9 figures,"International Journal of Computer Networks & Communications
  (IJCNC), Vol.3, No.4, July 2011, pp.99-116",,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Within the wireless mesh network, a bottleneck problem arises as the number
of concurrent traffic flows (NCTF) increases over a single common control
channel, as it is for most conventional networks. To alleviate this problem,
this paper proposes a two-stage coordination multi-radio multi-channel MAC
(TSC-M2MAC) protocol that designates all available channels as both control
channels and data channels in a time division manner through a two-stage
coordination. At the first stage, a load balancing breadth-first-search-based
vertex coloring algorithm for multi-radio conflict graph is proposed to
intelligently allocate multiple control channels. At the second stage, a
REQ/ACK/RES mechanism is proposed to realize dynamical channel allocation for
data transmission. At this stage, the Channel-and-Radio Utilization Structure
(CRUS) maintained by each node is able to alleviate the hidden nodes problem;
also, the proposed adaptive adjustment algorithm for the Channel Negotiation
and Allocation (CNA) sub-interval is able to cope with the variation of NCTF.
In addition, we design a power saving mechanism for the TSC-M2MAC to decrease
its energy consumption. Simulation results show that the proposed protocol is
able to achieve higher throughput and lower end-to-end packet delay than
conventional schemes. They also show that the TSC-M2MAC can achieve load
balancing, save energy, and remain stable when the network becomes saturated.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2011 14:49:26 GMT'}]",2011-08-08,"[['Zhao', 'Bingxuan', ''], ['Shimamoto', 'Shigeru', '']]","['Control channel allocation', 'data channel allocation', 'multi-radio multi-channel', 'power saving mechanism', 'WMN']"
15975,1802.06290,Majid Ghasemi-Gol,Majid Ghasemi-Gol and Pedro Szekely,TabVec: Table Vectors for Classification of Web Tables,,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are hundreds of millions of tables in Web pages that contain useful
information for many applications. Leveraging data within these tables is
difficult because of the wide variety of structures, formats and data encoded
in these tables. TabVec is an unsupervised method to embed tables into a vector
space to support classification of tables into categories (entity, relational,
matrix, list, and non-data) with minimal user intervention. TabVec deploys
syntax and semantics of table cells, and embeds the structure of tables in a
table vector space. This enables superior classification of tables even in the
absence of domain annotations. Our evaluations in four real world domains show
that TabVec improves classification accuracy by more than 20% compared to three
state of the art systems, and that those systems require significant in domain
training to achieve good results.
","[{'version': 'v1', 'created': 'Sat, 17 Feb 2018 20:45:03 GMT'}]",2018-02-20,"[['Ghasemi-Gol', 'Majid', ''], ['Szekely', 'Pedro', '']]","['Web tables', 'table type classifcation', 'table vectors', 'table embedding']"
15976,1209.5426,Tanvir Ahmed,"Tanvir Ahmed, Mohammad Saiedur Rahaman, Mohammad Saidur Rahman, Manzur
  H. Khan","A Coherent Distributed Grid Service for Assimilation and Unification of
  Heterogeneous Data Source",9 pages; ISSN 1608-3679,"AIUB Journal of Science And Engineering (AJSE) Vol. 9, No. 1, PP
  47-55, 2010",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Grid services are heavily used for handling large distributed computations.
They are also very useful to handle heavy data intensive applications where
data are distributed in different sites. Most of the data grid services used in
such situations are meant for homogeneous data source. In case of Heterogeneous
data sources, most of the grid services that are available are designed such a
way that they must be identical in schema definition for their smooth
operation. But there can be situations where the grid site databases are
heterogeneous and their schema definition is different from the central schema
definition. In this paper we propose a light weight coherent grid service for
heterogeneous data sources that is very easily install. It can map and convert
the central SQL schema into that of the grid members and send queries to get
according results from heterogeneous data sources.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2012 21:17:09 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Oct 2012 22:30:21 GMT'}]",2012-10-16,"[['Ahmed', 'Tanvir', ''], ['Rahaman', 'Mohammad Saiedur', ''], ['Rahman', 'Mohammad Saidur', ''], ['Khan', 'Manzur H.', '']]","['Grid Service', 'heterogeneous data source', 'database schema', 'XML mapping']"
15977,1307.1353,"Moritz M\""uller","Hubie Chen and Moritz M\""uller","One Hierarchy Spawns Another: Graph Deconstructions and the Complexity
  Classification of Conjunctive Queries",,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of conjunctive query evaluation relative to a class of
queries; this problem is formulated here as the relational homomorphism problem
relative to a class of structures A, wherein each instance must be a pair of
structures such that the first structure is an element of A. We present a
comprehensive complexity classification of these problems, which strongly links
graph-theoretic properties of A to the complexity of the corresponding
homomorphism problem. In particular, we define a binary relation on graph
classes, which is a preorder, and completely describe the resulting hierarchy
given by this relation. This relation is defined in terms of a notion which we
call graph deconstruction and which is a variant of the well-known notion of
tree decomposition. We then use this hierarchy of graph classes to infer a
complexity hierarchy of homomorphism problems which is comprehensive up to a
computationally very weak notion of reduction, namely, a parameterized version
of quantifier-free first-order reduction. In doing so, we obtain a
significantly refined complexity classification of homomorphism problems, as
well as a unifying, modular, and conceptually clean treatment of existing
complexity classifications. We then present and develop the theory of
Ehrenfeucht-Fraisse-style pebble games which solve the homomorphism problems
where the cores of the structures in A have bounded tree depth. Finally, we use
our framework to classify the complexity of model checking existential
sentences having bounded quantifier rank.
","[{'version': 'v1', 'created': 'Thu, 4 Jul 2013 14:35:18 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Mar 2016 16:22:58 GMT'}]",2016-03-02,"[['Chen', 'Hubie', ''], ['Müller', 'Moritz', '']]","['Conjunctive queries', 'Homomorphisms', 'Graph decompositions', 'Parameterized complexity']"
15978,1205.1604,Mohammad Arif,Mohammad Arif and Tara Rani,ACO based routing for MANETs,"12 pages, 7 figures, ISSN:0975-3834 (Online); 0975-4679 (Print), 2012",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile ad hoc network (MANET) is a collection of wireless mobile nodes. It
dynamically forms a temporary network without using any pre existing network
infrastructure or centralized administration i.e. with minimal prior planning.
All nodes have routing capabilities and forward data packets to other nodes in
multi-hop fashion. As the network is dynamic, the network topology continuously
experiences alterations during deployment. The biggest challenge in MANETs is
to find a path between communicating nodes. The considerations of the MANET
environment and the nature of the mobile nodes create further complications
which results in the need to develop special routing algorithms to meet these
challenges. Swarm intelligence, a bio-inspired technique, which has proven to
be very adaptable in other problem domains, has been applied to the MANET
routing problem as it forms a good fit to the problem. In ant societies the
activities of the individuals are not regulated by any explicit form of
centralized control but are the result of self-organizing dynamics driven by
local interactions and communications among a number of relatively simple
individuals. This unique characteristic has made ant societies an attractive
and inspiring model for building new algorithms and new multi-agent systems. In
this paper, we have studied and reviewed Ant Colony based routing algorithms
and its variants. Finally, a performance evaluation of the original ARA and the
EARA is carried out with respect to each other.
","[{'version': 'v1', 'created': 'Tue, 8 May 2012 07:12:47 GMT'}]",2012-05-09,"[['Arif', 'Mohammad', ''], ['Rani', 'Tara', '']]","['MANET', 'Routing', 'Ant Colony Routing', 'Ant Colony Optimisation', 'ARA', 'EARA', 'AntNet', 'AntNet-FA']"
15979,1306.4890,Luis Marujo,"Luis Marujo, Ricardo Ribeiro, David Martins de Matos, Jo\~ao P. Neto,
  Anatole Gershman, and Jaime Carbonell",Key Phrase Extraction of Lightly Filtered Broadcast News,"In 15th International Conference on Text, Speech and Dialogue (TSD
  2012)",,,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper explores the impact of light filtering on automatic key phrase
extraction (AKE) applied to Broadcast News (BN). Key phrases are words and
expressions that best characterize the content of a document. Key phrases are
often used to index the document or as features in further processing. This
makes improvements in AKE accuracy particularly important. We hypothesized that
filtering out marginally relevant sentences from a document would improve AKE
accuracy. Our experiments confirmed this hypothesis. Elimination of as little
as 10% of the document sentences lead to a 2% improvement in AKE precision and
recall. AKE is built over MAUI toolkit that follows a supervised learning
approach. We trained and tested our AKE method on a gold standard made of 8 BN
programs containing 110 manually annotated news stories. The experiments were
conducted within a Multimedia Monitoring Solution (MMS) system for TV and radio
news/programs, running daily, and monitoring 12 TV and 4 radio channels.
","[{'version': 'v1', 'created': 'Thu, 20 Jun 2013 14:35:22 GMT'}]",2013-06-21,"[['Marujo', 'Luis', ''], ['Ribeiro', 'Ricardo', ''], ['de Matos', 'David Martins', ''], ['Neto', 'João P.', ''], ['Gershman', 'Anatole', ''], ['Carbonell', 'Jaime', '']]","['Keyphrase extraction', 'Speech summarization', 'Speech browsing', 'Broadcast News speech recognition']"
15980,1512.00984,Quanming Yao,"Quanming Yao, James T. Kwok, Wenliang Zhong",Fast Low-Rank Matrix Learning with Nonconvex Regularization,Long version of conference paper appeared ICDM 2015,,,,cs.NA cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Low-rank modeling has a lot of important applications in machine learning,
computer vision and social network analysis. While the matrix rank is often
approximated by the convex nuclear norm, the use of nonconvex low-rank
regularizers has demonstrated better recovery performance. However, the
resultant optimization problem is much more challenging. A very recent
state-of-the-art is based on the proximal gradient algorithm. However, it
requires an expensive full SVD in each proximal step. In this paper, we show
that for many commonly-used nonconvex low-rank regularizers, a cutoff can be
derived to automatically threshold the singular values obtained from the
proximal operator. This allows the use of power method to approximate the SVD
efficiently. Besides, the proximal operator can be reduced to that of a much
smaller matrix projected onto this leading subspace. Convergence, with a rate
of O(1/T) where T is the number of iterations, can be guaranteed. Extensive
experiments are performed on matrix completion and robust principal component
analysis. The proposed method achieves significant speedup over the
state-of-the-art. Moreover, the matrix solution obtained is more accurate and
has a lower rank than that of the traditional nuclear norm regularizer.
","[{'version': 'v1', 'created': 'Thu, 3 Dec 2015 08:32:17 GMT'}]",2016-05-02,"[['Yao', 'Quanming', ''], ['Kwok', 'James T.', ''], ['Zhong', 'Wenliang', '']]","['Low-rank matrix', 'Nonconvex optimization', 'Proximal gradient', 'Matrix completion', 'Robust PCA']"
15981,1401.1313,Sayan Mitra Sayan Mitra,Sayan Mitra,Proving Abstractions of Dynamical Systems through Numerical Simulations,,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A key question that arises in rigorous analysis of cyberphysical systems
under attack involves establishing whether or not the attacked system deviates
significantly from the ideal allowed behavior. This is the problem of deciding
whether or not the ideal system is an abstraction of the attacked system. A
quantitative variation of this question can capture how much the attacked
system deviates from the ideal. Thus, algorithms for deciding abstraction
relations can help measure the effect of attacks on cyberphysical systems and
to develop attack detection strategies. In this paper, we present a decision
procedure for proving that one nonlinear dynamical system is a quantitative
abstraction of another. Directly computing the reach sets of these nonlinear
systems are undecidable in general and reach set over-approximations do not
give a direct way for proving abstraction. Our procedure uses (possibly
inaccurate) numerical simulations and a model annotation to compute tight
approximations of the observable behaviors of the system and then uses these
approximations to decide on abstraction. We show that the procedure is sound
and that it is guaranteed to terminate under reasonable robustness assumptions.
","[{'version': 'v1', 'created': 'Tue, 7 Jan 2014 08:59:05 GMT'}]",2014-01-08,"[['Mitra', 'Sayan', '']]","['cyberphysical systems', 'adversary', 'simulation', 'verification', 'abstraction']"
15982,1004.0512,Mahmoud Khademi,"Mahmoud Khademi, Mohammad Hadi Kiapour, Mohammad T. Manzuri-Shalmani,
  and Ali A. Kiaei","Analysis, Interpretation, and Recognition of Facial Action Units and
  Expressions Using Neuro-Fuzzy Modeling",,"LNAI vol. 5998, pp. 161--172, Springer, Heidelberg (Proc. of 4th
  IAPR Workshop on Artificial Neural Networks in Pattern Recognition), 2010.",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper an accurate real-time sequence-based system for representation,
recognition, interpretation, and analysis of the facial action units (AUs) and
expressions is presented. Our system has the following characteristics: 1)
employing adaptive-network-based fuzzy inference systems (ANFIS) and temporal
information, we developed a classification scheme based on neuro-fuzzy modeling
of the AU intensity, which is robust to intensity variations, 2) using both
geometric and appearance-based features, and applying efficient dimension
reduction techniques, our system is robust to illumination changes and it can
represent the subtle changes as well as temporal information involved in
formation of the facial expressions, and 3) by continuous values of intensity
and employing top-down hierarchical rule-based classifiers, we can develop
accurate human-interpretable AU-to-expression converters. Extensive experiments
on Cohn-Kanade database show the superiority of the proposed method, in
comparison with support vector machines, hidden Markov models, and neural
network classifiers. Keywords: biased discriminant analysis (BDA), classifier
design and evaluation, facial action units (AUs), hybrid learning, neuro-fuzzy
modeling.
","[{'version': 'v1', 'created': 'Sun, 4 Apr 2010 15:20:27 GMT'}]",2010-04-06,"[['Khademi', 'Mahmoud', ''], ['Kiapour', 'Mohammad Hadi', ''], ['Manzuri-Shalmani', 'Mohammad T.', ''], ['Kiaei', 'Ali A.', '']]","['biased discriminant analysis (BDA)', 'classifier design and evaluation', 'facial action units (AUs)', 'hybrid learning', 'neuro-fuzzy modeling']"
15983,1602.07464,Pawe{\l} Teisseyre,Pawe{\l} Teisseyre,Feature ranking for multi-label classification using Markov Networks,,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a simple and efficient method for ranking features in multi-label
classification. The method produces a ranking of features showing their
relevance in predicting labels, which in turn allows to choose a final subset
of features. The procedure is based on Markov Networks and allows to model the
dependencies between labels and features in a direct way. In the first step we
build a simple network using only labels and then we test how much adding a
single feature affects the initial network. More specifically, in the first
step we use the Ising model whereas the second step is based on the score
statistic, which allows to test a significance of added features very quickly.
The proposed approach does not require transformation of label space, gives
interpretable results and allows for attractive visualization of dependency
structure. We give a theoretical justification of the procedure by discussing
some theoretical properties of the Ising model and the score statistic. We also
discuss feature ranking procedure based on fitting Ising model using $l_1$
regularized logistic regressions. Numerical experiments show that the proposed
methods outperform the conventional approaches on the considered artificial and
real datasets.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2016 11:11:10 GMT'}]",2016-02-25,"[['Teisseyre', 'Paweł', '']]","['feature selection', 'multi-label learning', 'Markov networks', 'Ising model']"
15984,1602.07338,Shasha Wang,"Dongwei Guo, Shasha Wang, Zhibo Wei, Siwen Wang and Yan Hong",The effect of social welfare system based on the complex network,,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the passage of time, the development of communication technology and
transportation broke the isolation among people. Relationship tends to be
complicated, pluralism, dynamism. In the network where interpersonal
relationship and evolved complex net based on game theory work serve
respectively as foundation architecture and theoretical model, with the
combination of game theory and regard public welfare as influencing factor, we
artificially initialize that closed network system. Through continual loop
operation of the program, we summarize the changing rule of the cooperative
behavior in the interpersonal relationship, so that we can analyze the policies
about welfare system about whole network and the relationship of frequency of
betrayal in cooperative behavior. Most analytical data come from some simple
investigations and some estimates based on internet and environment and the
study put emphasis on simulating social network and analyze influence of social
welfare system on Cooperative Behavio.
","[{'version': 'v1', 'created': 'Fri, 16 Jan 2015 11:31:12 GMT'}]",2016-02-25,"[['Guo', 'Dongwei', ''], ['Wang', 'Shasha', ''], ['Wei', 'Zhibo', ''], ['Wang', 'Siwen', ''], ['Hong', 'Yan', '']]","['Complex network', 'Welfare System', 'Game Theory', 'Cooperation']"
15985,1111.1598,Ashwin Tumma Mr,Jagannath Aghav and Ashwin Tumma,Design and Validation of Safety Cruise Control System for Automobiles,,,,,cs.SE,http://creativecommons.org/licenses/by/3.0/,"  In light of the recent humongous growth of the human population worldwide,
there has also been a voluminous and uncontrolled growth of vehicles, which has
consequently increased the number of road accidents to a large extent. In lieu
of a solution to the above mentioned issue, our system is an attempt to
mitigate the same using synchronous programming language. The aim is to develop
a safety crash warning system that will address the rear end crashes and also
take over the controlling of the vehicle when the threat is at a very high
level. Adapting according to the environmental conditions is also a prominent
feature of the system. Safety System provides warnings to drivers to assist in
avoiding rear-end crashes with other vehicles. Initially the system provides a
low level alarm and as the severity of the threat increases the level of
warnings or alerts also rises. At the highest level of threat, the system
enters in a Cruise Control Mode, wherein the system controls the speed of the
vehicle by controlling the engine throttle and if permitted, the brake system
of the vehicle. We focus on this crash area as it has a very high percentage of
the crash-related fatalities. To prove the feasibility, robustness and
reliability of the system, we have also proved some of the properties of the
system using temporal logic along with a reference implementation in ESTEREL.
To bolster the same, we have formally verified various properties of the system
along with their proofs.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2011 14:45:06 GMT'}]",2011-11-08,"[['Aghav', 'Jagannath', ''], ['Tumma', 'Ashwin', '']]","['Safety Algorithm', 'Cruise Control', 'ESTEREL', 'Reactive Control System', 'Synchronous Programming Language', 'Temporal Logic']"
15986,1712.03140,Mohamed Aturban,"Mohamed Aturban, Michael L. Nelson, and Michele C. Weigle",Difficulties of Timestamping Archived Web Pages,27 pages,,,,cs.DL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We show that state-of-the-art services for creating trusted timestamps in
blockchain-based networks do not adequately allow for timestamping of web
pages. They accept data by value (e.g., images and text), but not by reference
(e.g., URIs of web pages). Also, we discuss difficulties in repeatedly
generating the same cryptographic hash value of an archived web page. We then
introduce several requirements to be fulfilled in order to produce repeatable
hash values for archived web pages.
","[{'version': 'v1', 'created': 'Fri, 8 Dec 2017 15:59:32 GMT'}]",2017-12-11,"[['Aturban', 'Mohamed', ''], ['Nelson', 'Michael L.', ''], ['Weigle', 'Michele C.', '']]","['Timestamping', 'Web Archiving', 'Cryptocurrency']"
15987,1510.04706,John Stuart Haberl Baxter,"John S.H. Baxter, Jing Yuan and Terry M. Peters","Shape Complexes in Continuous Max-Flow Hierarchical Multi-Labeling
  Problems","9 pages, 1 figure",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although topological considerations amongst multiple labels have been
previously investigated in the context of continuous max-flow image
segmentation, similar investigations have yet to be made about shape
considerations in a general and extendable manner. This paper presents shape
complexes for segmentation, which capture more complex shapes by combining
multiple labels and super-labels constrained by geodesic star convexity. Shape
complexes combine geodesic star convexity constraints with hierarchical label
organization, which together allow for more complex shapes to be represented.
This framework avoids the use of co-ordinate system warping techniques to
convert shape constraints into topological constraints, which may be ambiguous
or ill-defined for certain segmentation problems.
","[{'version': 'v1', 'created': 'Thu, 15 Oct 2015 20:10:49 GMT'}]",2015-10-19,"[['Baxter', 'John S. H.', ''], ['Yuan', 'Jing', ''], ['Peters', 'Terry M.', '']]","['Multi-region segmentation', 'geodesic star convexity', 'optimal segmentation']"
15988,1305.0467,Chantal Cherifi,"Chantal Cherifi, Jean-Fran\c{c}ois Santucci",On Topological Structure of Web Services Networks for Composition,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to deal efficiently with the exponential growth of the Web services
landscape in composition life cycle activities, it is necessary to have a clear
view of its main features. As for many situations where there is a lot of
interacting entities, the complex networks paradigm is an appropriate approach
to analyze the interactions between the multitudes of Web services. In this
paper, we present and investigate the main interactions between semantic Web
services models from the complex network perspective. Results show that both
parameter and operation networks exhibit the main characteristics of typical
real-world complex networks such as the small-world property and an
inhomogeneous degree distribution. These results yield valuable insight in
order to develop composition search algorithms, to deal with security threat in
the composition process and on the phenomena which characterize its evolution.
","[{'version': 'v1', 'created': 'Thu, 2 May 2013 15:04:24 GMT'}]",2013-05-03,"[['Cherifi', 'Chantal', ''], ['Santucci', 'Jean-François', '']]","['Web services', 'Composition', 'Interaction networks', 'Complex networks', 'Semantics']"
15989,1511.05719,Joerg Schoenfisch,"Joerg Schoenfisch, Janno von Stulpnagel, Jens Ortmann, Christian
  Meilicke, Heiner Stuckenschmidt",Using Abduction in Markov Logic Networks for Root Cause Analysis,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  IT infrastructure is a crucial part in most of today's business operations.
High availability and reliability, and short response times to outages are
essential. Thus a high amount of tool support and automation in risk management
is desirable to decrease outages. We propose a new approach for calculating the
root cause for an observed failure in an IT infrastructure. Our approach is
based on Abduction in Markov Logic Networks. Abduction aims to find an
explanation for a given observation in the light of some background knowledge.
In failure diagnosis, the explanation corresponds to the root cause, the
observation to the failure of a component, and the background knowledge to the
dependency graph extended by potential risks. We apply a method to extend a
Markov Logic Network in order to conduct abductive reasoning, which is not
naturally supported in this formalism. Our approach exhibits a high amount of
reusability and enables users without specific knowledge of a concrete
infrastructure to gain viable insights in the case of an incident. We
implemented the method in a tool and illustrate its suitability for root cause
analysis by applying it to a sample scenario.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2015 10:13:43 GMT'}]",2015-11-19,"[['Schoenfisch', 'Joerg', ''], ['von St\x7fulpnagel', 'Janno', ''], ['Ortmann', 'Jens', ''], ['Meilicke', 'Christian', ''], ['Stuckenschmidt', 'Heiner', '']]","['Root Cause Analysis', 'IT Infrastructure', 'Markov Logic Networks', 'Abductive Reasoning']"
15990,1305.1121,Peter Robinson,"John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan,
  Peter Robinson, Eli Upfal",Storage and Search in Dynamic Peer-to-Peer Networks,to appear at SPAA 2013,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study robust and efficient distributed algorithms for searching, storing,
and maintaining data in dynamic Peer-to-Peer (P2P) networks. P2P networks are
highly dynamic networks that experience heavy node churn (i.e., nodes join and
leave the network continuously over time). Our goal is to guarantee, despite
high node churn rate, that a large number of nodes in the network can store,
retrieve, and maintain a large number of data items. Our main contributions are
fast randomized distributed algorithms that guarantee the above with high
probability (whp) even under high adversarial churn:
  1. A randomized distributed search algorithm that (whp) guarantees that
searches from as many as $n - o(n)$ nodes ($n$ is the stable network size)
succeed in ${O}(\log n)$-rounds despite ${O}(n/\log^{1+\delta} n)$ churn, for
any small constant $\delta > 0$, per round. We assume that the churn is
controlled by an oblivious adversary (that has complete knowledge and control
of what nodes join and leave and at what time, but is oblivious to the random
choices made by the algorithm).
  2. A storage and maintenance algorithm that guarantees (whp) data items can
be efficiently stored (with only $\Theta(\log{n})$ copies of each data item)
and maintained in a dynamic P2P network with churn rate up to
${O}(n/\log^{1+\delta} n)$ per round. Our search algorithm together with our
storage and maintenance algorithm guarantees that as many as $n - o(n)$ nodes
can efficiently store, maintain, and search even under ${O}(n/\log^{1+\delta}
n)$ churn per round. Our algorithms require only polylogarithmic in $n$ bits to
be processed and sent (per round) by each node.
  To the best of our knowledge, our algorithms are the first-known,
fully-distributed storage and search algorithms that provably work under highly
dynamic settings (i.e., high churn rates per step).
","[{'version': 'v1', 'created': 'Mon, 6 May 2013 09:04:39 GMT'}]",2013-05-07,"[['Augustine', 'John', ''], ['Molla', 'Anisur Rahaman', ''], ['Morsy', 'Ehab', ''], ['Pandurangan', 'Gopal', ''], ['Robinson', 'Peter', ''], ['Upfal', 'Eli', '']]","['Peer-to-Peer network', 'Dynamic network', 'Search', 'Storage', 'Distributed algorithm', 'Randomized algorithm', 'Random Walks', 'Expander graph']"
15991,1407.5425,Nikos Leonardos,"Troy Lee, Nikos Leonardos, Michael Saks, Fengming Wang",Hellinger volume and number-on-the-forehead communication complexity,,,,,cs.CC cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information-theoretic methods have proven to be a very powerful tool in
communication complexity, in particular giving an elegant proof of the linear
lower bound for the two-party disjointness function, and tight lower bounds on
disjointness in the multi-party number-in-the-hand (NIH) model. In this paper,
we study the applicability of information theoretic methods to the multi-party
number-on-the-forehead model (NOF), where determining the complexity of
disjointness remains an important open problem.
  There are two basic parts to the NIH disjointness lower bound: a direct sum
theorem and a lower bound on the one-bit AND function using a beautiful
connection between Hellinger distance and protocols revealed by Bar-Yossef,
Jayram, Kumar and Sivakumar [BYJKS04]. Inspired by this connection, we
introduce the notion of Hellinger volume. We show that it lower bounds the
information cost of multi-party NOF protocols and provide a small toolbox that
allows one to manipulate several Hellinger volume terms and lower bound a
Hellinger volume when the distributions involved satisfy certain conditions. In
doing so, we prove a new upper bound on the difference between the arithmetic
mean and the geometric mean in terms of relative entropy. We then apply these
new tools to obtain a lower bound on the informational complexity of the AND_k
function in the NOF setting. Finally, we discuss the difficulties of proving a
direct sum theorem for information cost in the NOF model.
","[{'version': 'v1', 'created': 'Mon, 21 Jul 2014 09:11:58 GMT'}]",2014-07-22,"[['Lee', 'Troy', ''], ['Leonardos', 'Nikos', ''], ['Saks', 'Michael', ''], ['Wang', 'Fengming', '']]","['communication complexity', 'informational complexity', 'Hellingervolume', 'number-on-the-forehead']"
15992,1701.06426,Biplav Srivastava,Biplav Srivastava,Tackling Corruption With Agents & ICT: A Vision,11 pages,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Corruption is universally considered as an undesirable characteristic of
public services. But despite attempts to simplify and automate such services,
there is very little prior work to detect, handle or prevent corruption in
computation literature. This is particularly surprising given the significant
advances made in detecting fraud, a relevant but different form of public
impropriety afflicting businesses. In this paper, we paint a vision of how
information and communications technology (ICT), and specifically agent-based
methods, can help tackle corruption in public services and identify challenges
to achieve the vision.
","[{'version': 'v1', 'created': 'Sun, 20 Nov 2016 16:28:05 GMT'}]",2017-01-24,"[['Srivastava', 'Biplav', '']]","['Corruption', 'Challenge', 'ICT', 'Agents']"
15993,1206.2893,Dara Shayda,Dara O Shayda,Decomposition of Kolmogorov Complexity And Link To Geometry,,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A link between Kolmogorov Complexity and geometry is uncovered. A similar
concept of projection and vector decomposition is described for Kolmogorov
Complexity. By using a simple approximation to the Kolmogorov Complexity, coded
in Mathematica, the derived formulas are tested and used to study the geometry
of Light Cone.
","[{'version': 'v1', 'created': 'Wed, 13 Jun 2012 18:49:20 GMT'}]",2012-06-14,"[['Shayda', 'Dara O', '']]","['Kolmogorov Complexity', 'Light Cone', 'Lightcone', 'Geometry', 'High-Pass Filter', 'Low-Pass Filter']"
15994,1209.6262,Tapalina Bhattasali,Tapalina Bhattasali,SEGNET: Secure Geo-Sensor Network Model,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless Geo-Sensor Networks (GEONET) are suitable for critical applications
in hostile environments due to its flexibility in deployment. But low power
geo-sensor nodes are easily compromised by security threats like battery
exhaustion attack which may give rise to unavoidable circumstances. In this
type of attack, intruder forcefully resists legitimate sensor nodes from going
into low-power sleep state. So that compromised sensor node's battery power is
drained out and it stops working. Due to the limited capability of sensor
nodes, it is very difficult to prevent a sensor node from this type of attack
which apparently appears as innocent interaction. In this paper, a framework of
secure GEONET model (SEGNET) is proposed, based on dynamic load distribution
mechanism for heterogeneous environment. It considers hybrid detection approach
using three modules for anomaly detection, intrusion confirmation and decision
making to reduce the probability of false detection, compared to other existing
approaches.
","[{'version': 'v1', 'created': 'Thu, 27 Sep 2012 15:53:16 GMT'}]",2012-09-28,"[['Bhattasali', 'Tapalina', '']]","['Wireless Geo-Sensor Network', 'GEONET', 'SEGNET', 'Load Distribution Mechanism', 'Hybrid Detection Approach']"
15995,1108.0894,Alexander Gutfraind,Matthew P. Johnson and Alexander Gutfraind,Evader Interdiction and Collateral Damage,"Proceedings of the 7th International Symposium on Algorithms for
  Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
  (ALGOSENSORS) 2011",,,LA-UR-11-10123,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In network interdiction problems, evaders (e.g., hostile agents or data
packets) may be moving through a network towards targets and we wish to choose
locations for sensors in order to intercept the evaders before they reach their
destinations. The evaders might follow deterministic routes or Markov chains,
or they may be reactive}, i.e., able to change their routes in order to avoid
sensors placed to detect them. The challenge in such problems is to choose
sensor locations economically, balancing security gains with costs, including
the inconvenience sensors inflict upon innocent travelers. We study the
objectives of 1) maximizing the number of evaders captured when limited by a
budget on sensing cost and 2) capturing all evaders as cheaply as possible. We
give optimal sensor placement algorithms for several classes of special graphs
and hardness and approximation results for general graphs, including for
deterministic or Markov chain-based and reactive or oblivious evaders. In a
similar-sounding but fundamentally different problem setting posed by
Rubinstein and Glazer where both evaders and innocent travelers are reactive,
we again give optimal algorithms for special cases and hardness and
approximation results on general graphs.
","[{'version': 'v1', 'created': 'Wed, 3 Aug 2011 17:05:29 GMT'}]",2011-08-04,"[['Johnson', 'Matthew P.', ''], ['Gutfraind', 'Alexander', '']]","['network interdiction', 'bridge policy', 'submodular set cover', 'Markov chain', 'minimal cut']"
15996,1506.03701,Piotr Majdak,"Katharina Egger, Piotr Majdak, Bernhard Laback","Channel Interaction and Current Level Affect Across-Electrode
  Integration of Interaural Time Differences in Bilateral Cochlear-Implant
  Listeners","submitted to JARO on 3 November 2014, Resubmitted revised version on
  1 June 2015, Resubmitted revised version on 3 August 2015",,,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sensitivity to ITDs is important for sound localization. Normal-hearing
listeners benefit from across-frequency processing, as seen with improved ITD
thresholds when consistent ITD cues are presented over a range of frequency
channels compared to when ITD information is only presented in a single
frequency channel. This study aimed to clarify whether cochlear-implant (CI)
listeners can make use of similar processing when being stimulated with
multiple interaural electrode pairs transmitting consistent ITD information.
ITD thresholds for unmodulated, 100-pulse-per-second pulse trains were measured
in seven bilateral CI listeners using research interfaces. Consistent ITDs were
presented at either one or two electrode pairs at different current levels,
allowing for comparisons at either constant level per component electrode or
equal overall loudness. Different tonotopic distances between the pairs were
tested in order to clarify the potential influence of channel interaction.
Comparison of ITD thresholds between double pairs and the respective single
pairs revealed systematic effects of tonotopic separation and current level. At
constant levels, performance with double-pair stimulation improved compared to
single-pair stimulation, but only for large tonotopic separation. Comparisons
at equal overall loudness revealed no benefit from presenting ITD information
at two electrode pairs for any tonotopic spacing. Irrespective of
electrode-pair configuration, ITD sensitivity improved with increasing current
level. Hence, the improved ITD sensitivity for double pairs found for a large
tonotopic separation and constant current levels seems to be due to increased
loudness. The overall data suggest that CI listeners can benefit from combining
consistent ITD information across multiple electrodes, provided sufficient
stimulus levels and that stimulating electrode pairs are widely spaced.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2015 15:06:03 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Jun 2015 09:19:29 GMT'}, {'version': 'v3', 'created': 'Tue, 11 Aug 2015 11:43:38 GMT'}]",2015-08-12,"[['Egger', 'Katharina', ''], ['Majdak', 'Piotr', ''], ['Laback', 'Bernhard', '']]","['binaural timing cues', 'ITD sensitivity', 'multiple-electrode stimulation', 'across-frequency processing']"
15997,1802.08150,Diego Moussallem,"Diego Moussallem, Thiago Castro Ferreira, Marcos Zampieri, Maria
  Claudia Cavalcanti, Geraldo Xex\'eo, Mariana Neves, Axel-Cyrille Ngonga Ngomo",RDF2PT: Generating Brazilian Portuguese Texts from RDF Data,"Accepted for publication in Language Resources and Evaluation
  Conference (LREC) 2018",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The generation of natural language from Resource Description Framework (RDF)
data has recently gained significant attention due to the continuous growth of
Linked Data. A number of these approaches generate natural language in
languages other than English, however, no work has been proposed to generate
Brazilian Portuguese texts out of RDF. We address this research gap by
presenting RDF2PT, an approach that verbalizes RDF data to Brazilian Portuguese
language. We evaluated RDF2PT in an open questionnaire with 44 native speakers
divided into experts and non-experts. Our results suggest that RDF2PT is able
to generate text which is similar to that generated by humans and can hence be
easily understood.
","[{'version': 'v1', 'created': 'Thu, 22 Feb 2018 16:41:56 GMT'}]",2018-02-23,"[['Moussallem', 'Diego', ''], ['Ferreira', 'Thiago Castro', ''], ['Zampieri', 'Marcos', ''], ['Cavalcanti', 'Maria Claudia', ''], ['Xexéo', 'Geraldo', ''], ['Neves', 'Mariana', ''], ['Ngomo', 'Axel-Cyrille Ngonga', '']]","['natural language generation', 'verbalization', 'semantic web']"
15998,1603.06109,Scott Roche,"Michael Mitzenmacher, Rajmohan Rajaraman, Scott Roche",Better bounds for coalescing-branching random walks,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Coalescing-branching random walks, or {\em cobra walks} for short, are a
natural variant of random walks on graphs that can model the spread of disease
through contacts or the spread of information in networks. In a $k$-cobra walk,
at each time step a subset of the vertices are active; each active vertex
chooses $k$ random neighbors (sampled independently and uniformly with
replacement) that become active at the next step, and these are the only active
vertices at the next step. A natural quantity to study for cobra walks is the
cover time, which corresponds to the expected time when all nodes have become
infected or received the disseminated information.
  In this work, we extend previous results for cobra walks in multiple ways. We
show that the cover time for the 2-cobra walk on $[0,n]^d$ is $O(n)$ (where the
order notation hides constant factors that depend on $d$); previous work had
shown the cover time was $O(n \cdot polylog(n))$. We show that the cover time
for a 2-cobra walk on an $n$-vertex $d$-regular graph with conductance $\phi_G$
is $O(\phi_G^{-2} \log^2 n)$, significantly generalizing a previous result that
held only for expander graphs with sufficiently high expansion. And finally we
show that the cover time for a 2-cobra walk on a graph with $n$ vertices is
always $O(n^{11/4} \log n)$; this is the first result showing that the bound of
$\Theta(n^3)$ for the worst-case cover time for random walks can be beaten
using 2-cobra walks.
","[{'version': 'v1', 'created': 'Sat, 19 Mar 2016 16:04:21 GMT'}]",2016-03-22,"[['Mitzenmacher', 'Michael', ''], ['Rajaraman', 'Rajmohan', ''], ['Roche', 'Scott', '']]","['Random Walks', 'Networks', 'Information Spreading', 'CoverTime', 'Epidemic Processes']"
15999,1107.5980,Juergen Giesl,"Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs,
  J\""urgen Giesl","SAT-Based Termination Analysis Using Monotonicity Constraints over the
  Integers",,"Theory and Practice of Logic Programming, 27th International
  Conference on Logic Programming (ICLP'11) Special Issue, volume 11, issue
  4-5, pages 503-520, 2011",,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe an algorithm for proving termination of programs abstracted to
systems of monotonicity constraints in the integer domain. Monotonicity
constraints are a non-trivial extension of the well-known size-change
termination method. While deciding termination for systems of monotonicity
constraints is PSPACE complete, we focus on a well-defined and significant
subset, which we call MCNP, designed to be amenable to a SAT-based solution.
Our technique is based on the search for a special type of ranking function
defined in terms of bounded differences between multisets of integer values. We
describe the application of our approach as the back-end for the termination
analysis of Java Bytecode (JBC). At the front-end, systems of monotonicity
constraints are obtained by abstracting information, using two different
termination analyzers: AProVE and COSTA. Preliminary results reveal that our
approach provides a good trade-off between precision and cost of analysis.
","[{'version': 'v1', 'created': 'Fri, 29 Jul 2011 14:19:14 GMT'}]",2011-08-01,"[['Codish', 'Michael', ''], ['Gonopolskiy', 'Igor', ''], ['Ben-Amram', 'Amir M.', ''], ['Fuhs', 'Carsten', ''], ['Giesl', 'Jürgen', '']]","['termination analysis', 'monotonicity constraints', 'SAT encoding']"
16000,1402.3549,Xiajun Wang,"Xiajun Wang, Song Huang, Song Fu and Krishna Kavi",Characterizing Workload of Web Applications on Virtualized Servers,"8 pages, 8 figures, The Fourth Workshop on Big Data Benchmarks,
  Performance Optimization, and Emerging Hardware in conjunction with the 19th
  ACM International Conference on Architectural Support for Programming
  Languages and Operating Systems (ASPLOS-2014), Salt Lake City, Utah, USA,
  March 1-5, 2014",,,,cs.PF cs.DC,http://creativecommons.org/licenses/by/3.0/,"  With the ever increasing demands of cloud computing services, planning and
management of cloud resources has become a more and more important issue which
directed affects the resource utilization and SLA and customer satisfaction.
But before any management strategy is made, a good understanding of
applications' workload in virtualized environment is the basic fact and
principle to the resource management methods. Unfortunately, little work has
been focused on this area. Lack of raw data could be one reason; another reason
is that people still use the traditional models or methods shared under
non-virtualized environment. The study of applications' workload in virtualized
environment should take on some of its peculiar features comparing to the
non-virtualized environment. In this paper, we are open to analyze the workload
demands that reflect applications' behavior and the impact of virtualization.
The results are obtained from an experimental cloud testbed running web
applications, specifically the RUBiS benchmark application. We profile the
workload dynamics on both virtualized and non-virtualized environments and
compare the findings. The experimental results are valuable for us to estimate
the performance of applications on computer architectures, to predict SLA
compliance or violation based on the projected application workload and to
guide the decision making to support applications with the right hardware.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2014 18:51:38 GMT'}]",2014-02-17,"[['Wang', 'Xiajun', ''], ['Huang', 'Song', ''], ['Fu', 'Song', ''], ['Kavi', 'Krishna', '']]","['Workload characterization', 'Virtualization', 'Performance modeling', 'Cloud computing.   1']"
16001,1609.01678,Emad Grais,"Emad M. Grais, Gerard Roma, Andrew J.R. Simpson, and Mark D. Plumbley","Discriminative Enhancement for Single Channel Audio Source Separation
  using Deep Neural Networks","13th International Conference on Latent Variable Analysis and Signal
  Separation (LVA/ICA 2017)",,,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The sources separated by most single channel audio source separation
techniques are usually distorted and each separated source contains residual
signals from the other sources. To tackle this problem, we propose to enhance
the separated sources to decrease the distortion and interference between the
separated sources using deep neural networks (DNNs). Two different DNNs are
used in this work. The first DNN is used to separate the sources from the mixed
signal. The second DNN is used to enhance the separated signals. To consider
the interactions between the separated sources, we propose to use a single DNN
to enhance all the separated sources together. To reduce the residual signals
of one source from the other separated sources (interference), we train the DNN
for enhancement discriminatively to maximize the dissimilarity between the
predicted sources. The experimental results show that using discriminative
enhancement decreases the distortion and interference between the separated
sources.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2016 18:03:33 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Dec 2016 12:13:56 GMT'}]",2016-12-21,"[['Grais', 'Emad M.', ''], ['Roma', 'Gerard', ''], ['Simpson', 'Andrew J. R.', ''], ['Plumbley', 'Mark D.', '']]","['Single channel audio source separation', 'deep neural networks', 'audio enhancement', 'discriminative training']"
16002,1412.6082,Petra Budikova,Jan Botorek and Petra Budikova and Pavel Zezula,Visual Concept Ontology for Image Annotations,,,,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In spite of the development of content-based data management, text-based
searching remains the primary means of multimedia retrieval in many areas.
Automatic creation of text metadata is thus a crucial tool for increasing the
findability of multimedia objects. Search-based annotation tools try to provide
content-descriptive keywords by exploiting web data, which are easily available
but unstructured and noisy. Such data need to be analyzed with the help of
semantic resources that provide knowledge about objects and relationships in a
given domain. In this paper, we focus on the task of general-purpose image
annotation and present the VCO, a new ontology of visual concepts developed as
a part of image annotation framework. The ontology is linked with the WordNet
lexical database, so the annotation tools can easily integrate information from
both these resources.
","[{'version': 'v1', 'created': 'Fri, 28 Nov 2014 16:49:29 GMT'}]",2014-12-19,"[['Botorek', 'Jan', ''], ['Budikova', 'Petra', ''], ['Zezula', 'Pavel', '']]","['visual concept ontology', 'WordNet', 'image annotation']"
16003,1610.07710,Amit Sheth,"Sanjaya Wijeratne, Lakshika Balasuriya, Amit Sheth, Derek Doran",EmojiNet: Building a Machine Readable Sense Inventory for Emoji,"15 pages, 4 figures, 3 tables, Accepted to publish at the 8th
  International Conference on Social Informatics (SocInfo 2016) as a full
  research track paper",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Emoji are a contemporary and extremely popular way to enhance electronic
communication. Without rigid semantics attached to them, emoji symbols take on
different meanings based on the context of a message. Thus, like the word sense
disambiguation task in natural language processing, machines also need to
disambiguate the meaning or sense of an emoji. In a first step toward achieving
this goal, this paper presents EmojiNet, the first machine readable sense
inventory for emoji. EmojiNet is a resource enabling systems to link emoji with
their context-specific meaning. It is automatically constructed by integrating
multiple emoji resources with BabelNet, which is the most comprehensive
multilingual sense inventory available to date. The paper discusses its
construction, evaluates the automatic resource creation process, and presents a
use case where EmojiNet disambiguates emoji usage in tweets. EmojiNet is
available online for use at http://emojinet.knoesis.org.
","[{'version': 'v1', 'created': 'Tue, 25 Oct 2016 02:36:52 GMT'}]",2016-10-26,"[['Wijeratne', 'Sanjaya', ''], ['Balasuriya', 'Lakshika', ''], ['Sheth', 'Amit', ''], ['Doran', 'Derek', '']]","['EmojiNet', 'Emoji Analysis', 'Emoji Sense Disambiguation']"
16004,1111.2412,Dinesh C,C. Dinesh (Mailam Engineering College),"Secured Data Consistency and Storage Way in Untrusted Cloud using Server
  Management Algorithm","6 pages,3 figures. I am the only author of this title and related
  information; International Journal of Computer Applications (0975 - 8887)
  Volume 31- No.6, October 2011",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is very challenging part to keep safely all required data that are needed
in many applications for user in cloud. Storing our data in cloud may not be
fully trustworthy. Since client doesn't have copy of all stored data, he has to
depend on Cloud Service Provider. But dynamic data operations, Read-Solomon and
verification token construction methods don't tell us about total storage
capacity of server allocated space before and after the data addition in cloud.
So we have to introduce a new proposed system of efficient storage measurement
and space comparison algorithm with time management for measuring the total
allocated storage area before and after the data insertion in cloud. So by
using our proposed scheme, the value or weight of stored data before and after
is measured by client with specified time in cloud storage area with accuracy.
And here we also have proposed the multi-server restore point in server failure
condition. If there occurs any server failure, by using this scheme the data
can be recovered automatically in cloud server. Our proposed scheme efficiently
checks space for the in-outsourced data to maintain integrity. Here the TPA
necessarily doesn't have the delegation to audit user's data.
","[{'version': 'v1', 'created': 'Thu, 10 Nov 2011 08:05:38 GMT'}]",2011-11-11,"[['Dinesh', 'C.', '', 'Mailam Engineering College']]","['Storage measurement', 'Space comparison algorithm', 'Restore access point', 'Time management', 'Cloud server']"
16005,1109.2297,Sheikh Shanawaz Mostafa,"Sheikh Shanawaz Mostafa, Khondker Jahid Reza, Gazi Maniur Rashid,
  Muhammad Moinuddin, Md. Ziaul Amin and Abdullah Al Nahid",An Efficient Paging Algorithm for Multi-Carrier CDMA System,,"International Journal of Computer Science Issues,pp 421-426, Vol.
  8, Issue 3, No. 2, May 2011",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To cope with the increasing demand of wireless communication services
multi-carrier systems are being used. Radio resources are very limited and
efficient usages of these resources are inevitable to get optimum performance
of the system. Paging channel is a low-bandwidth channel and one of the most
important channels on which system performance depends significantly. Therefore
it is vulnerable to even moderate overloads. In this paper, an efficient paging
algorithm, Concurrent Search, is proposed for efficient use of paging channel
in Multi- carrier CDMA system instead of existing sequential searching
algorithm. It is shown by the simulation that the paging performance in
proposed algorithm is far better than the existing system.
","[{'version': 'v1', 'created': 'Sun, 11 Sep 2011 09:01:34 GMT'}]",2011-09-13,"[['Mostafa', 'Sheikh Shanawaz', ''], ['Reza', 'Khondker Jahid', ''], ['Rashid', 'Gazi Maniur', ''], ['Moinuddin', 'Muhammad', ''], ['Amin', 'Md. Ziaul', ''], ['Nahid', 'Abdullah Al', '']]","['Absorbing Markov Chain', 'Concurrent Search', 'Erlang C Formula', 'Multi-Carrier', 'Paging']"
16006,1610.09992,Heidi Elisabeth Iuell Dahl,"Vibeke Skytt, Quillon Harpham, Tor Dokken and Heidi E.I. Dahl","Deconfliction and Surface Generation from Bathymetry Data Using LR
  B-splines",,,,,cs.GR math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A set of bathymetry point clouds acquired by different measurement techniques
at different times, having different accuracy and varying patterns of points,
are approximated by an LR B-spline surface. The aim is to represent the sea
bottom with good accuracy and at the same time reduce the data size
considerably. In this process the point clouds must be cleaned by selecting the
""best"" points for surface generation. This cleaning process is called
deconfliction, and we use a rough approximation of the combined point clouds as
a reference surface to select a consistent set of points. The reference surface
is updated with the selected points to create an accurate approximation. LR
B-splines is the selected surface format due to its suitability for adaptive
refinement and approximation, and its ability to represent local detail without
a global increase in the data size of the surface
","[{'version': 'v1', 'created': 'Mon, 31 Oct 2016 16:08:42 GMT'}]",2016-11-01,"[['Skytt', 'Vibeke', ''], ['Harpham', 'Quillon', ''], ['Dokken', 'Tor', ''], ['Dahl', 'Heidi E. I.', '']]","['Bathymetry', 'surface generation', 'deconfliction', 'LR B-splines']"
16007,1702.01537,Anas Al-Oraiqat Dr.,"Aladdein M. Amro, S. A. Zori, Anas M. Al-Oraiqat","Conceptual and algorithmic development of Pseudo 3D Graphics and Video
  Content Visualization","12 pages, 10 Figures",International Publisher for Advanced Scientific Journals 2013,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The article presents a general concept of the organization of pseudo three
dimension visualization of graphics and video content for three dimension
visualization systems. The steps of algorithms for solving the problem of
synthesis of three dimension stereo images based on two dimension images are
introduced. The features of synthesis organization of standard format of three
dimension stereo frame are presented. Moreover, the performed experimental
simulation for generating complete stereoframes and the results of its time
complexity are shown. Keywords:Three dimension visualization, pseudo three
dimension stereo, a stereo pair, three dimension stereo format, algorithm,
modeling, time complexity.
","[{'version': 'v1', 'created': 'Mon, 6 Feb 2017 09:24:02 GMT'}]",2017-02-07,"[['Amro', 'Aladdein M.', ''], ['Zori', 'S. A.', ''], ['Al-Oraiqat', 'Anas M.', '']]","['3D visualization', 'pseudo 3D stereo', 'a stereo pair', '3D stereo format', 'algorithm', 'modeling', 'time complexity']"
16008,1606.05887,Badr Benmammar,"Fatima Zohra Benidris (LTT), Badr Benmammar (LTT), Leila
  Merghem-Boulahia (ICD), Moez Esseghir (ICD)",An Efficient Cluster-based Routing Protocol in Cognitive Radio Net-work,"International Conference on Advanced Communication Systems and Signal
  Processing (ICOSIP 2015), Nov 2015, TLEMCEN, Algeria. 2015",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cognitive Radio Networks (CRNs) are being studied intensively and gaining
importance as spectrum is the heavily underutilized. CRN has the capability to
exploit smartly the unutilized frequency spectrum. Recently, the research
community started to work in the area of cognitive radio routing. In a flat
topology, all nodes are of the same level and functionality, thus making it
simple and efficient for smaller networks. However, when the network is large
with sparse nodes, the routing information becomes more complex making
cluster-based techniques really relevant to tackle such situations. In a
cluster-based routing, all nodes in the network are dynamically organized into
partitions called groups or clusters. In each cluster, a cluster head is chosen
to help in the data transmission management and to maintain cluster membership
information. This paper proposes a novel routing protocol for cognitive radio
ad hoc networks (CRAHNs) based on clustering model which amends swiftly to the
topological changes and establishes the routing efficiently. Our proposed
approach is thoroughly evaluated through simulation study. The results state
the suitability of the proposed protocol for cognitive radio ad hoc networks
and demonstrate that it has better performance in terms of finding the
source-destination route, reducing the amount of messages that are transmitted
all over the network and minimizing the routing delay.
","[{'version': 'v1', 'created': 'Sun, 19 Jun 2016 16:40:33 GMT'}]",2016-06-21,"[['Benidris', 'Fatima Zohra', '', 'LTT'], ['Benmammar', 'Badr', '', 'LTT'], ['Merghem-Boulahia', 'Leila', '', 'ICD'], ['Esseghir', 'Moez', '', 'ICD']]","['Routing Protocols', 'Clustering', 'Cognitive Radio Network', 'Cluster-head']"
16009,1704.06743,Raghav Chalapathy,"Raghavendra Chalapathy (University of Sydney and Capital Markets
  Cooperative Research Centre (CMCRC)), Aditya Krishna Menon (Data61/CSIRO and
  the Australian National University), and Sanjay Chawla (Qatar Computing
  Research Institute (QCRI), HBKU)","Robust, Deep and Inductive Anomaly Detection","Accepted ECML PKDD 2017 Skopje, Macedonia 18-22 September the
  European Conference On Machine Learning & Principles and Practice of
  Knowledge Discovery",,,,cs.LG cs.CV stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  PCA is a classical statistical technique whose simplicity and maturity has
seen it find widespread use as an anomaly detection technique. However, it is
limited in this regard by being sensitive to gross perturbations of the input,
and by seeking a linear subspace that captures normal behaviour. The first
issue has been dealt with by robust PCA, a variant of PCA that explicitly
allows for some data points to be arbitrarily corrupted, however, this does not
resolve the second issue, and indeed introduces the new issue that one can no
longer inductively find anomalies on a test set. This paper addresses both
issues in a single model, the robust autoencoder. This method learns a
nonlinear subspace that captures the majority of data points, while allowing
for some data to have arbitrary corruption. The model is simple to train and
leverages recent advances in the optimisation of deep neural networks.
Experiments on a range of real-world datasets highlight the model's
effectiveness.
","[{'version': 'v1', 'created': 'Sat, 22 Apr 2017 04:12:24 GMT'}, {'version': 'v2', 'created': 'Mon, 1 May 2017 18:46:25 GMT'}, {'version': 'v3', 'created': 'Sun, 30 Jul 2017 08:47:45 GMT'}]",2017-08-01,"[['Chalapathy', 'Raghavendra', '', 'University of Sydney and Capital Markets\n  Cooperative Research Centre'], ['Menon', 'Aditya Krishna', '', 'Data61/CSIRO and\n  the Australian National University'], ['Chawla', 'Sanjay', '', 'Qatar Computing\n  Research Institute']]","['anomaly detection', 'outlier detection', 'robust PCA', 'autoencoders', 'deep learning']"
16010,1606.05781,Xiufeng Liu,"Xiufeng Liu, Per Sieverts Nielsen",Regression-based Online Anomaly Detection for Smart Grid Data,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the widely used smart meters in the energy sector, anomaly detection
becomes a crucial mean to study the unusual consumption behaviors of customers,
and to discover unexpected events of using energy promptly. Detecting
consumption anomalies is, essentially, a real-time big data analytics problem,
which does data mining on a large amount of parallel data streams from smart
meters. In this paper, we propose a supervised learning and statistical-based
anomaly detection method, and implement a Lambda system using the in-memory
distributed computing framework, Spark and its extension Spark Streaming. The
system supports not only iterative detection model refreshment from scalable
data sets, but also real-time detection on scalable live data streams. This
paper empirically evaluates the system and the detection algorithm, and the
results show the effectiveness and the scalability of the proposed lambda
detection system.
","[{'version': 'v1', 'created': 'Sat, 18 Jun 2016 17:03:18 GMT'}]",2016-06-21,"[['Liu', 'Xiufeng', ''], ['Nielsen', 'Per Sieverts', '']]","['Anomaly detection', 'Real-time', 'Lambda architecture', 'Data mining']"
16011,1607.03105,Mario Mastriani,Mario Mastriani,"Systholic Boolean Orthonormalizer Network in Wavelet Domain for SAR
  Image Despeckling","11 pages, 9 figures, 1 table. arXiv admin note: text overlap with
  arXiv:1405.0632",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a novel method for removing speckle (in wavelet domain) of
unknown variance from SAR images. The me-thod is based on the following
procedure: We apply 1) Bidimentional Discrete Wavelet Transform (DWT-2D) to the
speckled image, 2) scaling and rounding to the coefficients of the highest
subbands (to obtain integer and positive coefficients), 3) bit-slicing to the
new highest subbands (to obtain bit-planes), 4) then we apply the Systholic
Boolean Orthonormalizer Network (SBON) to the input bit-plane set and we obtain
two orthonormal output bit-plane sets (in a Boolean sense), we project a set on
the other one, by means of an AND operation, and then, 5) we apply
re-assembling, and, 6) re-sca-ling. Finally, 7) we apply Inverse DWT-2D and
reconstruct a SAR image from the modified wavelet coefficients. Despeckling
results compare favorably to the most of methods in use at the moment.
","[{'version': 'v1', 'created': 'Mon, 11 Jul 2016 16:08:25 GMT'}]",2016-07-13,"[['Mastriani', 'Mario', '']]","['Bit-Plane', 'Boolean Orthonormalization Process', 'Despeckling', 'SAR images', 'Wavelets']"
16012,0907.3095,Kamal Ahmat,Kamal Ahmat,Ethernet Topology Discovery: A Survey,,,,TR-20091966,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ethernet networks have undergone impressive growth since the past few
decades. This growth can be appreciated in terms of the equipment, such as
switches and links, that have been added, as well as in the number of users
that it supports. In parallel to this expansion, over the past decade the
networking research community has shown a growing interest in discovering and
analyzing the Ethernet topology. Research in this area has concentrated on the
theoretical analysis of Ethernet topology as well as developing tools and
methods for mapping the network layout. These efforts have brought us to a
crucial juncture for Ethernet topology measurement infrastructures: while,
previously, these were both small (in terms of number of measurement points),
we are starting to see the deployment of large-scale distributed systems
composed of hundreds or thousands of monitors. As we look forward to this next
generation of systems, we take stock of what has been achieved so far. In this
survey, we discuss past and current mechanisms for discovering the Ethernet
topology from theoretical and practical prospective. In addition to discovery
techniques, we provide insights into some of the well known open issues related
to Ethernet topology discovery.
","[{'version': 'v1', 'created': 'Fri, 17 Jul 2009 15:31:38 GMT'}]",2009-07-20,"[['Ahmat', 'Kamal', '']]","['Ethernet Topology', 'Topology Survey', 'Link Layer Topology', 'NP-Hard']"
16013,1301.6847,Zhilin Zhang,"Taiyong Li, Zhilin Zhang",Robust Face Recognition via Block Sparse Bayesian Learning,Accepted by Mathematical Problems in Engineering in 2013,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Face recognition (FR) is an important task in pattern recognition and
computer vision. Sparse representation (SR) has been demonstrated to be a
powerful framework for FR. In general, an SR algorithm treats each face in a
training dataset as a basis function, and tries to find a sparse representation
of a test face under these basis functions. The sparse representation
coefficients then provide a recognition hint. Early SR algorithms are based on
a basic sparse model. Recently, it has been found that algorithms based on a
block sparse model can achieve better recognition rates. Based on this model,
in this study we use block sparse Bayesian learning (BSBL) to find a sparse
representation of a test face for recognition. BSBL is a recently proposed
framework, which has many advantages over existing block-sparse-model based
algorithms. Experimental results on the Extended Yale B, the AR and the CMU PIE
face databases show that using BSBL can achieve better recognition rates and
higher robustness than state-of-the-art algorithms in most cases.
","[{'version': 'v1', 'created': 'Tue, 29 Jan 2013 07:23:00 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Sep 2013 00:19:12 GMT'}]",2013-09-19,"[['Li', 'Taiyong', ''], ['Zhang', 'Zhilin', '']]","['Face Recognition', 'Classification', 'Sparse Representation', 'Sparse Learning', 'Block SparseBayesian Learning (BSBL)', 'Block Sparsity']"
16014,1410.3447,Tryphon Georgiou,"Yongxin Chen, Tryphon Georgiou and Michele Pavon","Optimal steering of a linear stochastic system to a final probability
  distribution, part II","15 pages, 4 figures",,,,cs.SY math-ph math.MP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of minimum energy steering of a linear stochastic
system to a final prescribed distribution over a finite horizon and to maintain
a stationary distribution over an infinite horizon. We present sufficient
conditions for optimality in terms of a system of dynamically coupled Riccati
equations in the finite horizon case and algebraic in the stationary case. We
then address the question of feasibility for both problems. For the
finite-horizon case, provided the system is controllable, we prove that without
any restriction on the directionality of the stochastic disturbance it is
always possible to steer the state to any arbitrary Gaussian distribution over
any specified finite time-interval. For the stationary infinite horizon case,
it is not always possible to maintain the state at an arbitrary Gaussian
distribution through constant state-feedback. It is shown that covariances of
admissible stationary Gaussian distributions are characterized by a certain
Lyapunov-like equation. We finally present an alternative to solving the system
of coupled Riccati equations, by expressing the optimal controls in the form of
solutions to (convex) semi-definite programs for both cases. We conclude with
an example to steer the state covariance of the distribution of inertial
particles to an admissible stationary Gaussian distribution over a finite
interval, to be maintained at that stationary distribution thereafter by
constant-gain state-feedback control.
","[{'version': 'v1', 'created': 'Mon, 13 Oct 2014 19:24:06 GMT'}]",2014-10-14,"[['Chen', 'Yongxin', ''], ['Georgiou', 'Tryphon', ''], ['Pavon', 'Michele', '']]","['Linear stochastic systems', 'stochastic optimal control', 'stationary distributions', 'Schr¨odinger bridges', 'covariancecontrol']"
16015,1206.0373,Ranjita Swain,"Ranjita Kumari Swain, Prafulla Kumar Behera and Durga Prasad Mohapatra","Generation and Optimization of Test cases for Object-Oriented Software
  Using State Chart Diagram",,,,,cs.SE,http://creativecommons.org/licenses/by/3.0/,"  The process of testing any software system is an enormous task which is time
consuming and costly. The time and required effort to do sufficient testing
grow, as the size and complexity of the software grows, which may cause overrun
of the project budget, delay in the development of software system or some test
cases may not be covered. During SDLC (software development life cycle),
generally the software testing phase takes around 40-70% of the time and cost.
State-based testing is frequently used in software testing. Test data
generation is one of the key issues in software testing. A properly generated
test suite may not only locate the errors in a software system, but also help
in reducing the high cost associated with software testing. It is often desired
that test data in the form of test sequences within a test suite can be
automatically generated to achieve required test coverage. This paper proposes
an optimization approach to test data generation for the state-based software
testing. In this paper, first state transition graph is derived from state
chart diagram. Then, all the required information are extracted from the state
chart diagram. Then, test cases are generated. Lastly, a set of test cases are
minimized by calculating the node coverage for each test case. It is also
determined that which test cases are covered by other test cases. The advantage
of our test generation technique is that it optimizes test coverage by
minimizing time and cost. The proposed test data generation scheme generates
test cases which satisfy transition path coverage criteria, path coverage
criteria and action coverage criteria. A case study on Automatic Ticket Machine
(ATM) has been presented to illustrate our approach.
","[{'version': 'v1', 'created': 'Sat, 2 Jun 2012 12:47:40 GMT'}]",2012-06-05,"[['Swain', 'Ranjita Kumari', ''], ['Behera', 'Prafulla Kumar', ''], ['Mohapatra', 'Durga Prasad', '']]","['Test generation technique', 'Test sequence generation', 'State chart diagram / State charts', 'Test Case Generation', 'Test Coverage', 'Test Optimization']"
16016,1701.04928,Bhautik Joshi,"Bhautik Joshi, Kristen Stewart, David Shapiro",Bringing Impressionism to Life with Neural Style Transfer in Come Swim,"3 pages, 6 figures, paper is a case study of how Neural Style
  Transfer can be used in a movie production context",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neural Style Transfer is a striking, recently-developed technique that uses
neural networks to artistically redraw an image in the style of a source style
image. This paper explores the use of this technique in a production setting,
applying Neural Style Transfer to redraw key scenes in 'Come Swim' in the style
of the impressionistic painting that inspired the film. We document how the
technique can be driven within the framework of an iterative creative process
to achieve a desired look, and propose a mapping of the broad parameter space
to a key set of creative controls. We hope that this mapping can provide
insights into priorities for future research.
","[{'version': 'v1', 'created': 'Wed, 18 Jan 2017 02:37:48 GMT'}]",2017-01-19,"[['Joshi', 'Bhautik', ''], ['Stewart', 'Kristen', ''], ['Shapiro', 'David', '']]","['style transfer', 'rendering', 'applied computer graphics']"
16017,1111.0706,Gwendal Simon,"Herve Kerivin, Jimmy Leblet, Gwendal Simon and Fen Zhou",Maximum Bounded Rooted-Tree Packing Problem,,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a graph and a root, the Maximum Bounded Rooted-Tree Packing (MBRTP)
problem aims at finding K rooted-trees that span the largest subset of
vertices, when each vertex has a limited outdegree. This problem is motivated
by peer-to-peer streaming overlays in under-provisioned systems. We prove that
the MBRTP problem is NP-complete. We present two polynomial-time algorithms
that computes an optimal solution on complete graphs and trees respectively.
","[{'version': 'v1', 'created': 'Thu, 3 Nov 2011 01:16:09 GMT'}]",2011-11-04,"[['Kerivin', 'Herve', ''], ['Leblet', 'Jimmy', ''], ['Simon', 'Gwendal', ''], ['Zhou', 'Fen', '']]","['Combinatorial problem', 'analysis of algorithms', 'computational']"
16018,1009.0433,Dipa Santosh Dixit,"Dipa Dixit, Jayant Gadge",Automatic Recommendation for Online Users Using Web Usage Mining,"10 PAGES Paper of web usage mining;
  http://airccse.org/journal/ijmit/jmit_current10.html)","IJMIT Journal August 2010, Volume 2, Number 3",,,cs.IR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A real world challenging task of the web master of an organization is to
match the needs of user and keep their attention in their web site. So, only
option is to capture the intuition of the user and provide them with the
recommendation list. Most specifically, an online navigation behavior grows
with each passing day, thus extracting information intelligently from it is a
difficult issue. Web master should use web usage mining method to capture
intuition. A WUM is designed to operate on web server logs which contain user's
navigation. Hence, recommendation system using WUM can be used to forecast the
navigation pattern of user and recommend those to user in a form of
recommendation list. In this paper, we propose a two tier architecture for
capturing users intuition in the form of recommendation list containing pages
visited by user and pages visited by other user's having similar usage profile.
The practical implementation of proposed architecture and algorithm shows that
accuracy of user intuition capturing is improved.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2010 14:15:55 GMT'}]",2010-09-03,"[['Dixit', 'Dipa', ''], ['Gadge', 'Jayant', '']]","['Data Mining', 'Web Usage mining', 'Web Intelligence', 'Personalization', 'Clustering', 'Classification']"
16019,1002.1193,Vishal Goyal,"Dhirendra Sharma, Vikram Singh","ICT in Universities of the Western Himalayan Region of India II: A
  Comparative SWOT Analysis","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 3, January 2010,
  http://ijcsi.org/articles/ICT-in-Universities-of-the-Western-Himalayan-Region-of-India-II-A-Comparative-SWOT-Analysis.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 3, January 2010,
  http://ijcsi.org/articles/ICT-in-Universities-of-the-Western-Himalayan-Region-of-India-II-A-Comparative-SWOT-Analysis.php",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study presents a comparative SWOT analysis to comprehend the pattern of
development of ICT within six universities of western Himalayan region of
India. With the objective of achieving quality and excellence in higher
education system in the region, this study provides a basis to decision makers
to exploit opportunities and minimize the external threats. The SWOT analysis
of different universities, placed under three categories, has been undertaken
within the four-tier framework used earlier by the authors. Guided by the
initiatives of National Mission on Education through ICT (NMEICT) for SWOT
analysis, findings of this paper reveal, relative consistency of these three
categories of universities, with the earlier study. A few suggestions, as
opportunities, with an emphasis on problem solving orientation in higher
education, have been made to strengthen the leadership of universities in the
field of ICT.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 10:51:00 GMT'}]",2010-02-08,"[['Sharma', 'Dhirendra', ''], ['Singh', 'Vikram', '']]","['SWOT Analysis', 'Strategic Planning', 'ICT', 'Information System', 'Four-tier Framework', 'NMEICT Initiatives', 'Enterprise Resource Planning (ERP)']"
16020,1010.1147,Mikael Fernandus Simalango,Mikael Fernandus Simalango,XML Query Processing and Query Languges: A Survey,"6 pages, 3 figures, 2 tables, written in 2008",,,,cs.DB cs.DS,http://creativecommons.org/licenses/by/3.0/,"  Today's database is associated with interoperability between different
domains and applications. This consequently results in the importance of data
portability in database. XML format fits the requirements and it has been
increasingly used for serving applications across different domains and
purposes. However, querying XML document effectively and efficiently is still a
challenging issue. This paper discusses query processing issues on XML and
reviews proposed solutions for querying XML databases by various authors.
","[{'version': 'v1', 'created': 'Wed, 6 Oct 2010 13:03:18 GMT'}]",2010-10-07,"[['Simalango', 'Mikael Fernandus', '']]","['xml data', 'query optimization', 'query language']"
16021,1510.04763,Md Noor-A-Rahim,"Md. Noor-A-Rahim, Gottfried Lechner and Khoa D. Nguyen","Density Evolution Analysis of Spatially Coupled LDPC Codes Over BIAWGN
  Channel","5 pages, 3 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the density evolution analysis of spatially coupled
low-density parity-check (SC-LDPC) codes over binary input additive white
Gaussian noise (BIAWGN) channels under the belief propagation (BP) decoding
algorithm. Using reciprocal channel approximation and Gaussian approximation,
we propose averaging techniques for the density evolution of SC-LDPC codes over
BIAWGN channels. We show that the proposed techniques can closely predict the
decoding threshold while offering reduced complexity compared to the existing
multi-edge-type density evolution.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2015 02:28:41 GMT'}]",2015-10-19,"[['Noor-A-Rahim', 'Md.', ''], ['Lechner', 'Gottfried', ''], ['Nguyen', 'Khoa D.', '']]","['Spatially coupled low-density parity-check codes', 'density evolution', 'decoding threshold']"
16022,0904.0437,Vincent Rialle,"Vincent Rialle (TIMC, DMIS), Catherine Ollivet (FA 93), Carole Guigui
  (TIMC), Christian Herv\'e (LEM)","What Do Family Caregivers of Alzheimer's Disease Patients Desire in
  Smart Home Technologies?",,"Methods of information in medicine 47, 1 (2008) 63-69",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Objectives - The authors' aim was to investigate the representations, wishes,
and fears of family caregivers (FCs) regarding 14 innovative technologies (IT)
for care aiding and burden alleviation, given the severe physical and
psychological stress induced by dementia care, and the very slow uptake of
these technologies in our society. Methods - A cluster sample survey based on a
self-administered questionnaire was carried out on data collected from 270
families of patients with Alzheimer's disease or related disorders, located in
the greater Paris area. Multiple Correspondence Analysis was used in addition
to usual statistical tests to identify homogenous FCs clusters concerning the
appreciation or rejection of the considered technologies. Results - Two
opposite clusters were clearly defined: FCs in favor of a substantial use of
technology, and those rather or totally hostile. Furthermore the distributions
of almost all the answers of appreciations were U shaped. Significant relations
were demonstrated between IT appreciation and FC's family or gender statuses
(e.g., female FCs appreciated more than male FCs a tracking device for quick
recovering of wandering patients: p=0.0025, N=195). Conclusions - The study
provides further evidence of the contrasted perception of technology in
dementia care at home, and suggests the development of public debates based on
rigorous assessment of practices and a strict ethical aim to protect against
misuse.
","[{'version': 'v1', 'created': 'Thu, 2 Apr 2009 18:16:47 GMT'}]",2009-04-03,"[['Rialle', 'Vincent', '', 'TIMC, DMIS'], ['Ollivet', 'Catherine', '', 'FA 93'], ['Guigui', 'Carole', '', 'TIMC'], ['Hervé', 'Christian', '', 'LEM']]","['Smart homes', 'Dementia care', 'Alzheimer’s disease', 'Family caregivers', 'Acceptability']"
16023,1511.07087,Branko Malesevic,"Branko Malesevic, Ivana Jovovic, Bojan Banjac","Visualization in teaching and learning mathematics in elementary,
  secondary and higher education",,"Bulletin of the ""Politehnica"" University of Timisoara, Romania,
  Tom 58 (72), Fascicola 1, 2013",,"Proceedings of International Conference on Engineering Graphics and
  Design, pp. 37-40, Timisoara, Romania, 13-15 june 2013",cs.CY cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present our experience in using visualization in mathematics
education. The experience with our university courses: ""Computer tools in
matematics"" and ""Symbolic algebra"" provides the basis for mathematics teacher
education program http://vizuelizacija.etf.rs/. The program is intended for
elementary and high school teachers. The education program deals with modern
techniques of visualization by using technologies such as GeoGegebra, JAVA and
HTML.
","[{'version': 'v1', 'created': 'Sun, 22 Nov 2015 23:38:14 GMT'}]",2019-10-15,"[['Malesevic', 'Branko', ''], ['Jovovic', 'Ivana', ''], ['Banjac', 'Bojan', '']]","['GeoGebra', 'Gröbner’s bases', 'visualization in mathematics education', 'application of mathematics in engineering']"
16024,1312.4232,Aiping  Huang,Aiping Huang and William Zhu,"Geometric lattice structure of covering and its application to attribute
  reduction through matroids",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The reduction of covering decision systems is an important problem in data
mining, and covering-based rough sets serve as an efficient technique to
process the problem. Geometric lattices have been widely used in many fields,
especially greedy algorithm design which plays an important role in the
reduction problems. Therefore, it is meaningful to combine coverings with
geometric lattices to solve the optimization problems. In this paper, we obtain
geometric lattices from coverings through matroids and then apply them to the
issue of attribute reduction. First, a geometric lattice structure of a
covering is constructed through transversal matroids. Then its atoms are
studied and used to describe the lattice. Second, considering that all the
closed sets of a finite matroid form a geometric lattice, we propose a
dependence space through matroids and study the attribute reduction issues of
the space, which realizes the application of geometric lattices to attribute
reduction. Furthermore, a special type of information system is taken as an
example to illustrate the application. In a word, this work points out an
interesting view, namely, geometric lattice to study the attribute reduction
issues of information systems.
","[{'version': 'v1', 'created': 'Mon, 16 Dec 2013 02:30:07 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Jan 2014 11:55:51 GMT'}]",2014-01-07,"[['Huang', 'Aiping', ''], ['Zhu', 'William', '']]","['Geometric lattice', 'Covering', 'Matroid', 'Dependence space', 'Attributereduction']"
16025,1407.2576,Daniela Saban,"Yash Kanoria, Daniela Saban and Jay Sethuraman",The size of the core in assignment markets,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Assignment markets involve matching with transfers, as in labor markets and
housing markets. We consider a two-sided assignment market with agent types and
stochastic structure similar to models used in empirical studies, and
characterize the size of the core in such markets. Each agent has a randomly
drawn productivity with respect to each type of agent on the other side. The
value generated from a match between a pair of agents is the sum of the two
productivity terms, each of which depends only on the type but not the identity
of one of the agents, and a third deterministic term driven by the pair of
types. We allow the number of agents to grow, keeping the number of agent types
fixed. Let $n$ be the number of agents and $K$ be the number of types on the
side of the market with more types. We find, under reasonable assumptions, that
the relative variation in utility per agent over core outcomes is bounded as
$O^*(1/n^{1/K})$, where polylogarithmic factors have been suppressed. Further,
we show that this bound is tight in worst case. We also provide a tighter bound
under more restrictive assumptions. Our results provide partial justification
for the typical assumption of a unique core outcome in empirical studies.
","[{'version': 'v1', 'created': 'Wed, 9 Jul 2014 18:09:02 GMT'}]",2014-07-10,"[['Kanoria', 'Yash', ''], ['Saban', 'Daniela', ''], ['Sethuraman', 'Jay', '']]","['Assignment markets', 'matching', 'transferable utility', 'core', 'uniqueness of equilibrium', 'random market']"
16026,0801.1362,An-Ping Li,An-Ping Li,A new key exchange cryptosystem,A revision,,,,cs.CR,,"  In this paper, we will present a new key exchange cryptosystem based on
linear algebra, which take less operations but weaker in security than
Diffie-Hellman's one.
","[{'version': 'v1', 'created': 'Wed, 9 Jan 2008 11:16:25 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Jan 2008 01:34:15 GMT'}, {'version': 'v3', 'created': 'Sun, 20 Jan 2008 07:15:00 GMT'}]",2008-01-20,"[['Li', 'An-Ping', '']]","['key exchange system', 'discrete logarithm', 'finite field', 'ring', 'matrices', 'commutative']"
16027,1501.04388,Boris Brimkov,Boris Brimkov and Illya V. Hicks,"Chromatic and flow polynomials of generalized vertex join graphs and
  outerplanar graphs",14 pages,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A generalized vertex join of a graph is obtained by joining an arbitrary
multiset of its vertices to a new vertex. We present a low-order polynomial
time algorithm for finding the chromatic polynomials of generalized vertex
joins of trees, and by duality we find the flow polynomials of arbitrary
outerplanar graphs. We also present closed formulas for the chromatic and flow
polynomials of vertex joins of cliques and cycles, otherwise known as
""generalized wheel"" graphs.
","[{'version': 'v1', 'created': 'Mon, 19 Jan 2015 05:09:25 GMT'}]",2015-01-20,"[['Brimkov', 'Boris', ''], ['Hicks', 'Illya V.', '']]","['chromatic polynomial', 'flow polynomial', 'vertex join', 'outerplanar graph', 'wheel graph']"
16028,1002.1681,Rdv Ijcsis,"Abderrahmane Baadache, Ali Belmehdi","Avoiding Black Hole and Cooperative Black Hole Attacks in Wireless Ad
  hoc Networks","7 Pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS January 2010, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 7, No. 1, pp. 10-16, January 2010, USA",,Computer Science ISSN 19475500,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In wireless ad hoc networks, the absence of any control on packets
forwarding, make these networks vulnerable by various deny of service attacks
(DoS). A node, in wireless ad hoc network, counts always on intermediate nodes
to send these packets to a given destination node. An intermediate node, which
takes part in packets forwarding, may behave maliciously and drop packets which
goes through it, instead of forwarding them to the following node. Such
behavior is called black hole attack. In this paper, after having specified the
black hole attack, a secure mechanism, which consists in checking the good
forwarding of packets by an intermediate node, was proposed. The proposed
solution avoids the black hole and the cooperative black hole attacks.
Evaluation metrics were considered in simulation to show the effectiveness of
the suggested solution.
","[{'version': 'v1', 'created': 'Mon, 8 Feb 2010 18:52:05 GMT'}]",2010-02-09,"[['Baadache', 'Abderrahmane', ''], ['Belmehdi', 'Ali', '']]","['wireless ad hoc network', 'routing protocol', 'security', 'black hole', 'cooperative black hole']"
16029,1704.06821,Saad Bin Ahmed,"Saad Bin Ahmed, Saeeda Naz, Muhammad Imran Razzak, and Rubiyah Yousaf",Deep Learning based Isolated Arabic Scene Character Recognition,"6 pages, 8 Figures, 3 Tables, Accepted in IEEE Workshop on Arabic
  Script Analysis and Recognition (ASAR) 2017",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The technological advancement and sophistication in cameras and gadgets
prompt researchers to have focus on image analysis and text understanding. The
deep learning techniques demonstrated well to assess the potential for
classifying text from natural scene images as reported in recent years. There
are variety of deep learning approaches that prospects the detection and
recognition of text, effectively from images. In this work, we presented Arabic
scene text recognition using Convolutional Neural Networks (ConvNets) as a deep
learning classifier. As the scene text data is slanted and skewed, thus to deal
with maximum variations, we employ five orientations with respect to single
occurrence of a character. The training is formulated by keeping filter size 3
x 3 and 5 x 5 with stride value as 1 and 2. During text classification phase,
we trained network with distinct learning rates. Our approach reported
encouraging results on recognition of Arabic characters from segmented Arabic
scene images.
","[{'version': 'v1', 'created': 'Sat, 22 Apr 2017 17:09:02 GMT'}]",2017-04-25,"[['Ahmed', 'Saad Bin', ''], ['Naz', 'Saeeda', ''], ['Razzak', 'Muhammad Imran', ''], ['Yousaf', 'Rubiyah', '']]","['Deep Learning', 'Convolutional', 'Scene Text']"
16030,1704.07212,Ismail Aydogdu,Ismail Aydogdu,"The Structure of One Weight Linear and Cyclic Codes Over Z2^r x
  (Z2+uZ2)^s",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Inspired by the Z2Z4-additive codes, linear codes over Z2^r x(Z2+uZ2)^s have
been introduced by Aydogdu et al. more recently. Although these family of codes
are similar to each other, linear codes over Z2^r x(Z2+uZ2)^s have some
advantages compared to Z2Z4-additive codes. A code is called constant
weight(one weight) if all the codewords have the same weight. It is well known
that constant weight or one weight codes have many important applications. In
this paper, we study the structure of one weight Z2Z2[u]-linear and cyclic
codes. We classify these type of one weight codes and also give some
illustrative examples.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 13:32:02 GMT'}]",2017-04-25,"[['Aydogdu', 'Ismail', '']]","['One Weight Codes', 'Z2Z2[u]-linear Codes', 'Duality']"
16031,1212.4638,Florian Caullery,Florian Caullery,Polynomial functions of degree 20 which are APN infinitely often,arXiv admin note: text overlap with arXiv:1101.6033 by other authors,,,,cs.IT cs.CR math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give all the polynomials functions of degree 20 which are APN over an
infinity of field extensions and show they are all CCZ-equivalent to the
function $x^5$, which is a new step in proving the conjecture of Aubry, McGuire
and Rodier.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2012 12:27:24 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Jan 2013 13:05:46 GMT'}]",2013-01-28,"[['Caullery', 'Florian', '']]","['vector Boolean functions', 'almost perfect nonlinear functions', 'algebraic surface', 'CCZ-equivalence']"
16032,1510.04206,Dmytro Terletskyi,Dmytro Terletskyi,"Exploiters-Based Knowledge Extraction in Object-Oriented Knowledge
  Representation",,"Proceedings of 24th International Workshop, Concurrency,
  Specification & Programming 2015, Rzeszow, Poland, September 28-30, 2015,
  Vol. 2, pp. 211-221",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper contains the consideration of knowledge extraction mechanisms of
such object-oriented knowledge representation models as frames, object-oriented
programming and object-oriented dynamic networks. In addition, conception of
universal exploiters within object-oriented dynamic networks is also discussed.
The main result of the paper is introduction of new exploiters-based knowledge
extraction approach, which provides generation of a finite set of new classes
of objects, based on the basic set of classes. The methods for calculation of
quantity of new classes, which can be obtained using proposed approach, and of
quantity of types, which each of them describes, are proposed. Proof that basic
set of classes, extended according to proposed approach, together with union
exploiter create upper semilattice is given. The approach always allows
generating of finitely defined set of new classes of objects for any
object-oriented dynamic network. A quantity of these classes can be precisely
calculated before the generation. It allows saving of only basic set of classes
in the knowledge base.
","[{'version': 'v1', 'created': 'Wed, 14 Oct 2015 17:21:37 GMT'}]",2015-12-22,"[['Terletskyi', 'Dmytro', '']]","['knowledge extracting', 'object-oriented dynamic networks', 'inhomogeneous class', 'universal exploiters', 'upper semilattice']"
16033,1506.01165,Thanh The Van,"Thanh Manh Le, Thanh The Van",Image Retrieval System Base on EMD Similarity Measure and S-Tree,"14 pages, 3 figures, Appendix",,,,cs.CV cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper approaches the binary signature for each image based on the
percentage of the pixels in each color images, at the same time the paper
builds a similar measure between images based on EMD (Earth Mover's Distance).
Besides, the paper proceeded to create the S-tree based on the similar measure
EMD to store the image's binary signatures to quickly query image signature
data. From there, the paper build an image retrieval algorithm and CBIR
(Content-Based Image Retrieval) based on a similar measure EMD and S-tree.
Based on this theory, the paper proceeded to build application and experimental
assessment of the process of querying image on the database system which have
over 10,000 images.
","[{'version': 'v1', 'created': 'Wed, 3 Jun 2015 08:50:13 GMT'}]",2015-06-04,"[['Le', 'Thanh Manh', ''], ['Van', 'Thanh The', '']]","['CBIR', 'Image Retrieval', 'EMD', 'S-tree', 'Signature', 'Signature Tree']"
16034,1609.01755,"Ulf R\""uegg","Adalat Jabrayilov, Sven Mallach, Petra Mutzel, Ulf R\""uegg, and
  Reinhard von Hanxleden",Compact Layered Drawings of General Directed Graphs,"Appears in the Proceedings of the 24th International Symposium on
  Graph Drawing and Network Visualization (GD 2016)",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of layering general directed graphs under height and
possibly also width constraints. Given a directed graph G = (V,A) and a maximal
height, we propose a layering approach that minimizes a weighted sum of the
number of reversed arcs, the arc lengths, and the width of the drawing. We call
this the Compact Generalized Layering Problem (CGLP). Here, the width of a
drawing is defined as the maximum sum of the number of vertices placed on a
layer and the number of dummy vertices caused by arcs traversing the layer. The
CGLP is NP-hard. We present two MIP models for this problem. The first one
(EXT) is our extension of a natural formulation for directed acyclic graphs as
suggested by Healy and Nikolov. The second one (CGL) is a new formulation based
on partial orderings. Our computational experiments on two benchmark sets show
that the CGL formulation can be solved much faster than EXT using standard
commercial MIP solvers. Moreover, we suggest a variant of CGL, called MML, that
can be seen as a heuristic approach. In our experiments, MML clearly improves
on CGL in terms of running time while it does not considerably increase the
average arc lengths and widths of the layouts although it solves a slightly
different problem where the dummy vertices are not taken into account.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2016 22:09:37 GMT'}]",2016-09-08,"[['Jabrayilov', 'Adalat', ''], ['Mallach', 'Sven', ''], ['Mutzel', 'Petra', ''], ['Rüegg', 'Ulf', ''], ['von Hanxleden', 'Reinhard', '']]","['layer-based layout', 'layer assignment', 'mixed integer programming']"
16035,1603.03409,Reza Tourani,"Reza Tourani, Travis Mick, Satyajayant Misra and Gaurav Panwar","Security, Privacy, and Access Control in Information-Centric Networking:
  A Survey","36 pages, 17 figures",,,,cs.NI cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Information-Centric Networking (ICN) is a new networking paradigm, which
replaces the widely used host-centric networking paradigm in communication
networks (e.g., Internet, mobile ad hoc networks) with an information-centric
paradigm, which prioritizes the delivery of named content, oblivious of the
contents origin. Content and client security are more intrinsic in the ICN
paradigm versus the current host centric paradigm where they have been
instrumented as an after thought. By design, the ICN paradigm inherently
supports several security and privacy features, such as provenance and identity
privacy, which are still not effectively available in the host-centric
paradigm. However, given its nascency, the ICN paradigm has several open
security and privacy concerns, some that existed in the old paradigm, and some
new and unique. In this article, we survey the existing literature in security
and privacy research sub-space in ICN. More specifically, we explore three
broad areas: security threats, privacy risks, and access control enforcement
mechanisms.
  We present the underlying principle of the existing works, discuss the
drawbacks of the proposed approaches, and explore potential future research
directions. In the broad area of security, we review attack scenarios, such as
denial of service, cache pollution, and content poisoning. In the broad area of
privacy, we discuss user privacy and anonymity, name and signature privacy, and
content privacy. ICN's feature of ubiquitous caching introduces a major
challenge for access control enforcement that requires special attention. In
this broad area, we review existing access control mechanisms including
encryption-based, attribute-based, session-based, and proxy re-encryption-based
access control schemes. We conclude the survey with lessons learned and scope
for future work.
","[{'version': 'v1', 'created': 'Thu, 10 Mar 2016 20:28:10 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Sep 2016 22:27:39 GMT'}, {'version': 'v3', 'created': 'Thu, 1 Jun 2017 22:46:02 GMT'}]",2017-06-05,"[['Tourani', 'Reza', ''], ['Mick', 'Travis', ''], ['Misra', 'Satyajayant', ''], ['Panwar', 'Gaurav', '']]","['Information-centric networking', 'security', 'privacy', 'access control', 'architecture', 'DoS', 'content poisoning']"
16036,0806.1569,Feng Xia,"Feng Xia, Yu-Chu Tian, Yanjun Li, Youxian Sun",Wireless Sensor/Actuator Network Design for Mobile Control Applications,"17 pages, 8 figures; Open Access at
  http://www.mdpi.org/sensors/papers/s7102157.pdf","Sensors, vol.7, no.10, pp.2157-2173, 2007",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless sensor/actuator networks (WSANs) are emerging as a new generation of
sensor networks. Serving as the backbone of control applications, WSANs will
enable an unprecedented degree of distributed and mobile control. However, the
unreliability of wireless communications and the real-time requirements of
control applications raise great challenges for WSAN design. With emphasis on
the reliability issue, this paper presents an application-level design
methodology for WSANs in mobile control applications. The solution is generic
in that it is independent of the underlying platforms, environment, control
system models, and controller design. To capture the link quality
characteristics in terms of packet loss rate, experiments are conducted on a
real WSAN system. From the experimental observations, a simple yet efficient
method is proposed to deal with unpredictable packet loss on actuator nodes.
Trace-based simulations give promising results, which demonstrate the
effectiveness of the proposed approach.
","[{'version': 'v1', 'created': 'Tue, 10 Jun 2008 04:20:01 GMT'}]",2008-12-18,"[['Xia', 'Feng', ''], ['Tian', 'Yu-Chu', ''], ['Li', 'Yanjun', ''], ['Sun', 'Youxian', '']]","['wireless sensor/actuator network', 'sensor network', 'control application', 'link quality', 'packet loss']"
16037,1312.5150,Adrian Paschke,"Velten Heyn, Adrian Paschke",Semantic Jira - Semantic Expert Finder in the Bug Tracking Tool Jira,"published in proceedings of the 9th International Workshop on
  Semantic Web Enabled Software Engineering (SWESE2013), Berlin, Germany,
  December 2-5, 2013","in Proceedings of the 9th International Workshop on Semantic Web
  Enabled Software Engineering (SWESE2013), Berlin, Germany, December 2-5, 2013",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The semantic expert recommender extension for the Jira bug tracking system
semantically searches for similar tickets in Jira and recommends experts and
links to existing organizational (Wiki) knowledge for each ticket. This helps
to avoid redundant work and supports the search and collaboration with experts
in the project management and maintenance phase based on semantically enriched
tickets in Jira.
","[{'version': 'v1', 'created': 'Wed, 18 Dec 2013 14:20:04 GMT'}]",2013-12-19,"[['Heyn', 'Velten', ''], ['Paschke', 'Adrian', '']]","['Bug Tracking', 'Semantic Expert Finder', 'Semantic Web']"
16038,1605.02224,Lorenzo De Stefani,Gianfranco Bilardi and Lorenzo De Stefani,"The I/O complexity of Strassen's matrix multiplication with
  recomputation",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A tight $\Omega((n/\sqrt{M})^{\log_2 7}M)$ lower bound is derived on the \io
complexity of Strassen's algorithm to multiply two $n \times n$ matrices, in a
two-level storage hierarchy with $M$ words of fast memory. A proof technique is
introduced, which exploits the Grigoriev's flow of the matrix multiplication
function as well as some combinatorial properties of the Strassen computational
directed acyclic graph (CDAG). Applications to parallel computation are also
developed. The result generalizes a similar bound previously obtained under the
constraint of no-recomputation, that is, that intermediate results cannot be
computed more than once. For this restricted case, another lower bound
technique is presented, which leads to a simpler analysis of the \io complexity
of Strassen's algorithm and can be readily extended to other ""Strassen-like""
algorithms.
","[{'version': 'v1', 'created': 'Sat, 7 May 2016 17:53:46 GMT'}]",2016-05-10,"[['Bilardi', 'Gianfranco', ''], ['De Stefani', 'Lorenzo', '']]","['I/O complexity', 'Strassen’s Matrix Multiplication', 'Recomputation', 'MemoryHierarchy', 'Parallel Computation']"
16039,1212.6054,Seifedine Kadry Seifedine Kadry,"Mohammad Alkafagee, Seifedine Kadry",New design of Robotics Remote lab,"(IJACSA) International Journal of Advanced Computer Science and
  Applications, 2012",,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Robotic Remote Laboratory controls the Robot labs via the Internet and
applies the Robot experiment in easy and advanced way. If we want to enhance
the RRL system, we must study requirements of the Robot experiment in a deeply
way. One of key requirements of the Robot experiment is the Control algorithm
that includes all important activities to affect the Robot; one of them relates
the path or obstacle. Our goal is to produce a new design of the RRL includes a
new treatment to the Control algorithm depends on isolation one of the Control
algorithm's activities that relates the paths in a separated algorithm, i.e.,
design the (Path planning algorithm) is independent of the original Control
algorithm. This aim can be achieved by depending on the light to produce the
Light obstacle. To apply the Light obstacle, we need to hardware (Light control
server and Light arms) and soft ware (path planning algorithm).The NXT 2.0
Robot will sense the Light obstacle depending on the Light sensor of it. The
new design has two servers, one for the path (Light control server) and other
for the other activities of the Control algorithm (Robot control server).The
website of the new design includes three main parts (Lab Reservation, Open Lab,
Download Simulation).We proposed a set of scenarios for organizing the
reservation of the Remote Lab. Additionally, we developed an appropriate
software to simulate the Robot and to practice it before usage the Remote lab.
","[{'version': 'v1', 'created': 'Tue, 25 Dec 2012 14:14:10 GMT'}]",2012-12-27,"[['Alkafagee', 'Mohammad', ''], ['Kadry', 'Seifedine', '']]","['Robotic Remote Laboratory', 'Robot experiment', 'Light obstacle', 'Control algorithm', 'NXT 2.0Robot', 'Robot lab', 'Path planning algorithm']"
16040,1607.03821,Martin Bichler,Salman Fadaei and Martin Bichler,Truthfulness with Value-Maximizing Bidders,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In markets such as digital advertising auctions, bidders want to maximize
value rather than payoff. This is different to the utility functions typically
assumed in auction theory and leads to different strategies and outcomes. We
refer to bidders who maximize value as value bidders. While simple
single-object auction formats are truthful, standard multi-object auction
formats allow for manipulation. It is straightforward to show that there cannot
be a truthful and revenue-maximizing deterministic auction mechanism with value
bidders and general valuations. Approximation has been used as a means to
achieve truthfulness, and we study which approximation ratios we can get from
truthful approximation mechanisms. We show that the approximation ratio that
can be achieved with a deterministic and truthful approximation mechanism with
$n$ bidders and $m$ items cannot be higher than 1/n for general valuations. For
randomized approximation mechanisms there is a framework with a ratio of
O(sqrt(m)). We provide better ratios for environments with restricted
valuations.
","[{'version': 'v1', 'created': 'Wed, 13 Jul 2016 16:45:24 GMT'}]",2016-07-14,"[['Fadaei', 'Salman', ''], ['Bichler', 'Martin', '']]","['value bidders', 'truthfulness', 'approximation mechanisms']"
16041,1412.2115,Pedro Russo,"Abi J. Ashton, Pedro Russo and Thilina Heenatigala","Crowdfunding Astronomy Outreach Projects: Lessons Learned from the UNAWE
  Crowdfunding Campaign","Published - Communicating Astronomy with the Public journal #16 (4
  pages) (2014)",,,,cs.CY astro-ph.IM physics.ed-ph physics.soc-ph,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In recent years, crowdfunding has become a popular method of funding new
technology or entertainment products, or artistic projects. The idea is that
people or projects ask for many small donations from individuals who support
the proposed work, rather than a large amount from a single source.
Crowdfunding is usually done via an online portal or platform which handles the
financial transactions involved. The Universe Awareness (UNAWE) programme
decided to undertake a Kickstarter crowdfunding campaign centring on the
resource Universe in a Box2. In this article we present the lessons learned and
best practices from that campaign.
","[{'version': 'v1', 'created': 'Thu, 4 Dec 2014 10:37:26 GMT'}]",2014-12-08,"[['Ashton', 'Abi J.', ''], ['Russo', 'Pedro', ''], ['Heenatigala', 'Thilina', '']]","['Crowdfunding', 'astronomy outreach', 'education kits', 'fundraising']"
16042,1603.02457,Jhoirene Clemente,"Jeffrey Aborot, Henry Adorna, Jhoirene Clemente",On Self-Reducibility and Reoptimization of Closest Substring Problem,8 pages,Philippine Computing Journal Vol 10 (2): 1- 7 (2015),,,cs.DS,http://creativecommons.org/publicdomain/zero/1.0/,"  In this paper, we define the reoptimization variant of the closest substring
problem (CSP) under sequence addition. We show that, even with the additional
information we have about the problem instance, the problem of finding a
closest substring is still NP-hard. We investigate the combinatorial property
of optimization problems called self-reducibility. We show that problems that
are polynomial-time reducible to self-reducible problems also exhibits the same
property. We illustrate this in the context of CSP. We used the property to
show that although we cannot improve the approximability of the problem, we can
improve the running time of the existing PTAS for CSP.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2016 10:19:06 GMT'}]",2016-03-09,"[['Aborot', 'Jeffrey', ''], ['Adorna', 'Henry', ''], ['Clemente', 'Jhoirene', '']]","['reoptimization', 'closest substring problem', 'approximation']"
16043,1707.09489,Poonam Yadav Dr,Poonam Yadav and Jeremy Cohen and John Darlington,CitizenGrid: An Online Middleware for Crowdsourcing Scientific Research,11 pages,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last few years, contributions of the general public in scientific
projects has increased due to the advancement of communication and computing
technologies. Internet played an important role in connecting scientists and
volunteers who are interested in participating in their scientific projects.
However, despite potential benefits, only a limited number of crowdsourcing
based large-scale science (citizen science) projects have been deployed due to
the complexity involved in setting them up and running them. In this paper, we
present CitizenGrid - an online middleware platform which addresses security
and deployment complexity issues by making use of cloud computing and
virtualisation technologies. CitizenGrid incentivises scientists to make their
small-to-medium scale applications available as citizen science projects by: 1)
providing a directory of projects through a web-based portal that makes
applications easy to discover; 2) providing flexibility to participate in,
monitor, and control multiple citizen science projects from a common interface;
3) supporting diverse categories of citizen science projects. The paper
describes the design, development and evaluation of CitizenGrid and its use
cases.
","[{'version': 'v1', 'created': 'Sat, 29 Jul 2017 09:48:14 GMT'}]",2017-08-01,"[['Yadav', 'Poonam', ''], ['Cohen', 'Jeremy', ''], ['Darlington', 'John', '']]","['Citizen Cyber Science', 'Games', 'Volunteers', 'CloudComputing', 'Scientists', 'Middleware', 'Distributed Computing', 'Crowd Sourcing']"
16044,1407.1257,Pandiyavathi Thenral,T.Pandiyavathi,Usage of Optimal Restructuring Plan in Detection of Code Smells,"5 pages Published with International Journal of Computer Trends and
  Technology","International Journal of Computer Trends and Technology volume 12
  number 4 Jun 2014",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To remain useful for their users, software systems need to continuously
enhance and extend their functionality. Nevertheless, in many object-oriented
applications, features are not represented explicitly. The lack of
modularization is known to make application features difficult to locate, to
comprehend and to modify in isolation from one another. In our work, we
implement restructuring using Featureous plug-in where we can change the
classes between packages. In the previous literature works, lot of complexities
arises while using the tool due to dependencies. Changes to the code without
knowing the root cause of the problem leads to further production of new
errors. So, we aim in finding the restructuring candidates which have to be
rearranged, thereby applying changes to the code on those parts using the tool
helps in ordered arrangement of the source code. Applying modularization to the
restructuring candidates will lead to decrease in the human effort as well as
tool effort in restructuring. Unwanted evolution of new errors will be
eliminated
","[{'version': 'v1', 'created': 'Fri, 4 Jul 2014 15:01:28 GMT'}]",2014-07-07,"[['Pandiyavathi', 'T.', '']]","['Refactoring', 'Restructuring', 'Bad smells']"
16045,1610.07892,Andrea Gorrini,"Andrea Gorrini, Giuseppe Vizzari and Stefania Bandini","Towards Modelling Pedestrian-Vehicle Interactions: Empirical Study on
  Urban Unsignalized Intersection","Pre-print of a paper presented at the 8th International Conference on
  Pedestrian and Evacuation Dynamics (PED2016), Hefei, China - Oct 17-21, 2016",,,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The modelling and simulation of the interaction among vehicles and
pedestrians during cross-walking is an open challenge for both research and
practical computational solutions supporting urban/traffic decision makers and
managers. The social cost of pedestrians' risky behaviour pushes the
development of a new generation of computational models integrating analytical
knowledge, data and experience about the complex dynamics occurring in
pedestrian/vehicle interactions, which are not completely understood despite
recent efforts. This paper presents the results of a significant data gathering
campaign realised at an unsignalized zebra crossing. The selected area of the
city of Milan (Italy) is characterised by a significant presence of elderly
inhabitants and pedestrian-vehicle risky interactions, testified by a high
number of accidents involving pedestrians in the past years. The results
concern the analysis of: (i) vehicular and pedestrian traffic volumes; (ii)
level of service; (iii) pedestrian-vehicle interactions, considering the impact
of ageing on crossing behaviour. Results showed that the phenomenon is
characterised by three main phases: approaching, appraising (evaluation of the
distance and speed of oncoming vehicles) and crossing. The final objective of
the research is to support the development of a microscopic agent-based tool
for simulating pedestrian behaviour at unsignalized crosswalks, focusing on the
specific needs of the elderly pedestrians.
","[{'version': 'v1', 'created': 'Tue, 25 Oct 2016 14:30:18 GMT'}]",2016-10-26,"[['Gorrini', 'Andrea', ''], ['Vizzari', 'Giuseppe', ''], ['Bandini', 'Stefania', '']]","['Pedestrian', 'Crossing behaviour', 'Ageing', 'Observation']"
16046,1309.6919,Or Zuk,"Or Zuk, Amnon Amir, Amit Zeisel, Ohad Shamir and Noam Shental","Accurate Profiling of Microbial Communities from Massively Parallel
  Sequencing using Convex Optimization",To appear in SPIRE 13,,,,cs.CE q-bio.GN q-bio.QM stat.AP stat.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe the Microbial Community Reconstruction ({\bf MCR}) Problem, which
is fundamental for microbiome analysis. In this problem, the goal is to
reconstruct the identity and frequency of species comprising a microbial
community, using short sequence reads from Massively Parallel Sequencing (MPS)
data obtained for specified genomic regions. We formulate the problem
mathematically as a convex optimization problem and provide sufficient
conditions for identifiability, namely the ability to reconstruct species
identity and frequency correctly when the data size (number of reads) grows to
infinity. We discuss different metrics for assessing the quality of the
reconstructed solution, including a novel phylogenetically-aware metric based
on the Mahalanobis distance, and give upper-bounds on the reconstruction error
for a finite number of reads under different metrics. We propose a scalable
divide-and-conquer algorithm for the problem using convex optimization, which
enables us to handle large problems (with $\sim10^6$ species). We show using
numerical simulations that for realistic scenarios, where the microbial
communities are sparse, our algorithm gives solutions with high accuracy, both
in terms of obtaining accurate frequency, and in terms of species phylogenetic
resolution.
","[{'version': 'v1', 'created': 'Thu, 26 Sep 2013 14:30:13 GMT'}]",2013-09-27,"[['Zuk', 'Or', ''], ['Amir', 'Amnon', ''], ['Zeisel', 'Amit', ''], ['Shamir', 'Ohad', ''], ['Shental', 'Noam', '']]","['Microbial Community Reconstruction', 'Massively Parallel Sequencing', 'Short Reads', 'ConvexOptimization']"
16047,1306.5390,Tejaswi Agarwal,"Tejaswi Agarwal, Saurabh Jha and B. Rajesh Kanna","P-HGRMS: A Parallel Hypergraph Based Root Mean Square Algorithm for
  Image Denoising","2 pages, 2 figures. Published as poster at the 22nd ACM International
  Symposium on High Performance Parallel and Distributed Systems, HPDC 2013,
  New York, USA. Won the Best Poster Award at HPDC 2013",,,,cs.DC cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a parallel Salt and Pepper (SP) noise removal algorithm
in a grey level digital image based on the Hypergraph Based Root Mean Square
(HGRMS) approach. HGRMS is generic algorithm for identifying noisy pixels in
any digital image using a two level hierarchical serial approach. However, for
SP noise removal, we reduce this algorithm to a parallel model by introducing a
cardinality matrix and an iteration factor, k, which helps us reduce the
dependencies in the existing approach. We also observe that the performance of
the serial implementation is better on smaller images, but once the threshold
is achieved in terms of image resolution, its computational complexity
increases drastically. We test P-HGRMS using standard images from the Berkeley
Segmentation dataset on NVIDIAs Compute Unified Device Architecture (CUDA) for
noise identification and attenuation. We also compare the noise removal
efficiency of the proposed algorithm using Peak Signal to Noise Ratio (PSNR) to
the existing approach. P-HGRMS maintains the noise removal efficiency and
outperforms its sequential counterpart by 6 to 18 times (6x - 18x) in
computational efficiency.
","[{'version': 'v1', 'created': 'Sun, 23 Jun 2013 09:36:08 GMT'}, {'version': 'v2', 'created': 'Sat, 29 Jun 2013 01:32:41 GMT'}]",2013-07-02,"[['Agarwal', 'Tejaswi', ''], ['Jha', 'Saurabh', ''], ['Kanna', 'B. Rajesh', '']]","['Parallel Processing', 'GPGPU', 'Salt and Pepper Noise']"
16048,1701.07299,Igor Malinovi\'c,Yuri Faenza and Igor Malinovic,A PTAS for the Time-Invariant Incremental Knapsack problem,"17 pages, 2 figures",,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Time-Invariant Incremental Knapsack problem (IIK) is a generalization of
Maximum Knapsack to a discrete multi-period setting. At each time, capacity
increases and items can be added, but not removed from the knapsack. The goal
is to maximize the sum of profits over all times. IIK models various
applications including specific financial markets and governmental decision
processes. IIK is strongly NP-hard and there has been work on giving
approximation algorithms for some special cases. In this paper, we settle the
complexity of IIK by designing a PTAS based on rounding a disjuncive
formulation, and provide several extensions of the technique.
","[{'version': 'v1', 'created': 'Wed, 25 Jan 2017 13:23:36 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Oct 2017 16:56:01 GMT'}, {'version': 'v3', 'created': 'Wed, 25 Oct 2017 11:48:08 GMT'}, {'version': 'v4', 'created': 'Tue, 30 Jan 2018 16:31:44 GMT'}]",2018-01-31,"[['Faenza', 'Yuri', ''], ['Malinovic', 'Igor', '']]","['approximation algorithms', 'disjunctive programming', 'linear programming relaxations', 'time-invariant incremental knapsack']"
16049,1007.0410,Dimple Juneja Dr.,Pooja Saini,"Impact Of Mobility and Transmission Range On The Performance of Backoff
  Algorithms For IEEE 802.11-Based Multi-hop Mobile Ad hoc Networks",http://ijict.org/index.php/ijoat/article/view/impact-of-mobility-on-ieee-802-11-manets,"International Journal of Advancements in Technology, Vol 1, No 1
  (2010)",,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  In IEEE 802.11 Wireless Local Area Networks (WLANs), network nodes
experiencing collisions on the shared channel need to backoff for a random
period of time, which is uniformly selected from the Contention Window (CW).
This contention window is dynamically controlled by the Backoff algorithm.
First step to design a an efficient backoff algorithm for multi-hop ad hoc
network is to analysis of the existing backoff algorithms in multi-hop ad hoc
networks. Thus, in this paper, we considered two important multi-hop adhoc
network scenarios: (a) Node Mobility Scenario and (b) Transmission Range
Scenario and analyze and evaluate both the impact of mobility (i.e. node speed)
and the impact of transmission range of nodes on the performance of various
backoff algorithms
","[{'version': 'v1', 'created': 'Thu, 1 Jul 2010 09:29:44 GMT'}]",2010-07-05,"[['Saini', 'Pooja', '']]","['MAC Protocol', 'Backoff Algorithm', 'Node Mobility', 'Transmission Range.  1']"
16050,1212.6104,Jason Teutsch,Jason Teutsch,Short lists for shortest descriptions in short time,,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Is it possible to find a shortest description for a binary string? The
well-known answer is ""no, Kolmogorov complexity is not computable."" Faced with
this barrier, one might instead seek a short list of candidates which includes
a laconic description. Remarkably such approximations exist. This paper
presents an efficient algorithm which generates a polynomial-size list
containing an optimal description for a given input string. Along the way, we
employ expander graphs and randomness dispersers to obtain an Explicit Online
Matching Theorem for bipartite graphs and a refinement of Muchnik's Conditional
Complexity Theorem. Our main result extends recent work by Bauwens, Mahklin,
Vereschchagin, and Zimand.
","[{'version': 'v1', 'created': 'Wed, 26 Dec 2012 00:15:53 GMT'}, {'version': 'v2', 'created': 'Mon, 31 Dec 2012 08:30:22 GMT'}, {'version': 'v3', 'created': 'Tue, 15 Jan 2013 01:27:30 GMT'}, {'version': 'v4', 'created': 'Fri, 19 Apr 2013 07:44:58 GMT'}, {'version': 'v5', 'created': 'Wed, 12 Feb 2014 21:38:28 GMT'}]",2014-02-14,"[['Teutsch', 'Jason', '']]","['Kolmogorov complexity', 'online matching', 'bipartite expander graph', 'disperser graph', 'Muchnik’s Conditional Complexity Theorem']"
16051,1604.06644,Martin Sulzmann,Martin Sulzmann and Kenny Zhuo Ming Lu,Derivative-Based Diagnosis of Regular Expression Ambiguity,"12 pages plus appendix, to appear in CIAA 2016",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Regular expressions are often ambiguous. We present a novel method based on
Brzozowski's derivatives to aid the user in diagnosing ambiguous regular
expressions. We introduce a derivative-based finite state transducer to
generate parse trees and minimal counter-examples. The transducer can be easily
customized to either follow the POSIX or Greedy disambiguation policy and based
on a finite set of examples it is possible to examine if there are any
differences among POSIX and Greedy.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2016 13:21:10 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Jul 2016 15:01:59 GMT'}]",2016-07-14,"[['Sulzmann', 'Martin', ''], ['Lu', 'Kenny Zhuo Ming', '']]","['regular expressions', 'derivatives', 'ambiguity', 'POSIX', 'Greedy']"
16052,0909.4860,R Doomun,"Y. Robiah, S. Siti Rahayu, M. Mohd Zaki, S. Shahrin, M. A. Faizal, R.
  Marliza",A New Generic Taxonomy on Hybrid Malware Detection Technique,"6 pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423,
  http://sites.google.com/site/ijcsis/","Robiah Y, Siti Rahayu S., Mohd Zaki M, Shahrin S., Faizal M. A.,
  Marliza R., International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 5, No. 1, pp. 56-61, September 2009, USA",,ISSN 1947 5500,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Malware is a type of malicious program that replicate from host machine and
propagate through network. It has been considered as one type of computer
attack and intrusion that can do a variety of malicious activity on a computer.
This paper addresses the current trend of malware detection techniques and
identifies the significant criteria in each technique to improve malware
detection in Intrusion Detection System (IDS). Several existing techniques are
analyzing from 48 various researches and the capability criteria of malware
detection technique have been reviewed. From the analysis, a new generic
taxonomy of malware detection technique have been proposed named Hybrid Malware
Detection Technique (Hybrid MDT) which consists of Hybrid Signature and Anomaly
detection technique and Hybrid Specification based and Anomaly detection
technique to complement the weaknesses of the existing malware detection
technique in detecting known and unknown attack as well as reducing false alert
before and during the intrusion occur.
","[{'version': 'v1', 'created': 'Sat, 26 Sep 2009 11:44:56 GMT'}]",2009-09-29,"[['Robiah', 'Y.', ''], ['Rahayu', 'S. Siti', ''], ['Zaki', 'M. Mohd', ''], ['Shahrin', 'S.', ''], ['Faizal', 'M. A.', ''], ['Marliza', 'R.', '']]","['Malware', 'taxonomy', 'Intrusion Detection System']"
16053,1410.0717,George Ovchinnikov,I.V. Oseledets and G.V. Ovchinnikov,"Fast, memory efficient low-rank approximation of SimRank",,,,,cs.DS cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  SimRank is a well-known similarity measure between graph vertices.
  In this paper novel low-rank approximation of SimRank is proposed.
","[{'version': 'v1', 'created': 'Thu, 2 Oct 2014 21:31:12 GMT'}]",2014-10-06,"[['Oseledets', 'I. V.', ''], ['Ovchinnikov', 'G. V.', '']]","['SimRank', 'low-rank approximations', 'SVD']"
16054,1702.07451,Patrick Wang,Patrick Wang and Kenneth Morton and Peter Torrione and Leslie Collins,Viewpoint Adaptation for Rigid Object Detection,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An object detector performs suboptimally when applied to image data taken
from a viewpoint different from the one with which it was trained. In this
paper, we present a viewpoint adaptation algorithm that allows a trained
single-view object detector to be adapted to a new, distinct viewpoint. We
first illustrate how a feature space transformation can be inferred from a
known homography between the source and target viewpoints. Second, we show that
a variety of trained classifiers can be modified to behave as if that
transformation were applied to each testing instance. The proposed algorithm is
evaluated on a person detection task using images from the PETS 2007 and CAVIAR
datasets, as well as from a new synthetic multi-view person detection dataset.
It yields substantial performance improvements when adapting single-view person
detectors to new viewpoints, and simultaneously reduces computational
complexity. This work has the potential to improve detection performance for
cameras viewing objects from arbitrary viewpoints, while simplifying data
collection and feature extraction.
","[{'version': 'v1', 'created': 'Fri, 24 Feb 2017 02:37:15 GMT'}]",2017-02-27,"[['Wang', 'Patrick', ''], ['Morton', 'Kenneth', ''], ['Torrione', 'Peter', ''], ['Collins', 'Leslie', '']]","['viewpoint', 'domain', 'adaptation', 'perspective', 'projection', 'object', 'detection']"
16055,1205.2857,Ping Zhu,Ping Zhu and Qiaoyan Wen,Operations on soft sets revisited,8 pages,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Soft sets, as a mathematical tool for dealing with uncertainty, have recently
gained considerable attention, including some successful applications in
information processing, decision, demand analysis, and forecasting. To
construct new soft sets from given soft sets, some operations on soft sets have
been proposed. Unfortunately, such operations cannot keep all classical
set-theoretic laws true for soft sets. In this paper, we redefine the
intersection, complement, and difference of soft sets and investigate the
algebraic properties of these operations along with a known union operation. We
find that the new operation system on soft sets inherits all basic properties
of operations on classical sets, which justifies our definitions.
","[{'version': 'v1', 'created': 'Sun, 13 May 2012 13:21:59 GMT'}]",2015-03-20,"[['Zhu', 'Ping', ''], ['Wen', 'Qiaoyan', '']]","['Complement of a soft set', 'Difference of soft sets', 'Intersection of soft sets', 'Soft sets', 'Union of soft sets']"
16056,1401.4396,Andrew Adamatzky,Andrew Adamatzky,Towards plant wires,,,,,cs.ET physics.bio-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In experimental laboratory studies we evaluate a possibility of making
electrical wires from living plants. In scoping experiments we use lettuce
seedlings as a prototype model of a plant wire. We approximate an electrical
potential transfer function by applying direct current voltage to the lettuce
seedlings and recording output voltage. We analyse oscillation frequencies of
the output potential and assess noise immunity of the plant wires. Our findings
will be used in future designs of self-growing wetware circuits and devices,
and integration of plant-based electronic components into future and emergent
bio-hybrid systems.
","[{'version': 'v1', 'created': 'Fri, 17 Jan 2014 16:06:57 GMT'}]",2014-01-20,"[['Adamatzky', 'Andrew', '']]","['bio-wires', 'plants', 'bio-electronics', 'potential transfer function']"
16057,0705.0085,{\O}yvind Ytrehus,Angela I. Barbero Diez and Oyvind Ytrehus,"An efficient centralized binary multicast network coding algorithm for
  any cyclic network",,,,,cs.IT math.IT,,"  We give an algorithm for finding network encoding and decoding equations for
error-free multicasting networks with multiple sources and sinks. The algorithm
given is efficient (polynomial complexity) and works on any kind of network
(acyclic, link cyclic, flow cyclic, or even in the presence of knots). The key
idea will be the appropriate use of the delay (both natural and additional)
during the encoding. The resulting code will always work with finite delay with
binary encoding coefficients.
","[{'version': 'v1', 'created': 'Tue, 1 May 2007 08:03:18 GMT'}]",2007-07-13,"[['Diez', 'Angela I. Barbero', ''], ['Ytrehus', 'Oyvind', '']]","['Network codes', 'multicasting', 'cyclic networks', 'pipelining', 'delay']"
16058,1610.05788,Kunal Suri,"Kunal Suri, Adrian Mos","Human Task Monitoring and Contextual Analysis for Domain Specific
  Business Processes","26th International Conference on Software & Systems Engineering and
  their Applications (ICSSEA 2015), May 27-29, 2015, Paris, France. Accepted
  paper",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Monitoring the execution of business processes and activities composing them
is an essential capability of Business Process Management (BPM) Suites. Human
tasks are a particular type of business activities, and the understanding of
their execution is essential in effectively managing both the processes and
human resources. This paper proposes a monitoring framework with a capability
to monitor and analyze the human tasks in a domain specific setting and
contextually correlate the task execution patterns to the workload distribution
on human users. The framework uses the notion of concept probes that match the
business concepts used in definition of business processes. The proposed human
task monitoring and contextual analysis (HTMCA) component considers multiple
artifacts involved in the execution of a human task, rather than focusing only
on classic activity/task metrics retrieved from BPM engines.This approach
aspires to provide two main advantages to organizations using it. Firstly, it
enhances the understanding of the workload of human users that participate in
people-intensive business processes under various roles. Secondly, it gives
organizations tools and insight for fine-tuning their user performance taking
into account the specific context of their business various artifacts domains.
The proposed framework builds on previous work that lays the basis of
vendor-independent, concept-centric BPM monitoring, and provides the critical
missing element of human task understanding. This has the potential to
significantly benefit any BPM deployment and the validation work is in advanced
stages of building a full prototype that demonstrates this value in a realistic
industrial setting.
","[{'version': 'v1', 'created': 'Tue, 18 Oct 2016 20:18:19 GMT'}]",2016-10-20,"[['Suri', 'Kunal', ''], ['Mos', 'Adrian', '']]","['BPM', 'human tasks', 'monitoring', 'domain specific', 'business concepts', 'business domains', 'concept probes']"
16059,1606.05172,Adrien Richard,"Tarek Melliti, Damien Regnault, Adrien Richard, Sylvain Sen\'e",Asynchronous simulation of Boolean networks by monotone Boolean networks,"To appear in the proceedings of ACA 2016 (fourth International
  Workshop on Asynchronous Cellular Automata and Asynchronous Discrete Models)",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove that the fully asynchronous dynamics of a Boolean network
$f:\{0,1\}^n\to\{0,1\}^n$ without negative loop can be simulated, in a very
specific way, by a monotone Boolean network with $2n$ components. We then use
this result to prove that, for every even $n$, there exists a monotone Boolean
network $f:\{0,1\}^n\to\{0,1\}^n$, an initial configuration $x$ and a fixed
point $y$ of $f$ such that: (i) $y$ can be reached from $x$ with a fully
asynchronous updating strategy, and (ii) all such strategies contains at least
$2^{\frac{n}{2}}$ updates. This contrasts with the following known property: if
$f:\{0,1\}^n\to\{0,1\}^n$ is monotone, then, for every initial configuration
$x$, there exists a fixed point $y$ such that $y$ can be reached from $x$ with
a fully asynchronous strategy that contains at most $n$ updates.
","[{'version': 'v1', 'created': 'Thu, 16 Jun 2016 13:01:43 GMT'}]",2016-06-17,"[['Melliti', 'Tarek', ''], ['Regnault', 'Damien', ''], ['Richard', 'Adrien', ''], ['Sené', 'Sylvain', '']]","['Boolean networks', 'monotone networks', 'asynchronous updates']"
16060,1304.3999,Bruno Scherrer,"Matthieu Geist, Bruno Scherrer (INRIA Lorraine - LORIA)",Off-policy Learning with Eligibility Traces: A Survey,,,,,cs.AI cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the framework of Markov Decision Processes, off-policy learning, that is
the problem of learning a linear approximation of the value function of some
fixed policy from one trajectory possibly generated by some other policy. We
briefly review on-policy learning algorithms of the literature (gradient-based
and least-squares-based), adopting a unified algorithmic view. Then, we
highlight a systematic approach for adapting them to off-policy learning with
eligibility traces. This leads to some known algorithms - off-policy
LSTD(\lambda), LSPE(\lambda), TD(\lambda), TDC/GQ(\lambda) - and suggests new
extensions - off-policy FPKF(\lambda), BRM(\lambda), gBRM(\lambda),
GTD2(\lambda). We describe a comprehensive algorithmic derivation of all
algorithms in a recursive and memory-efficent form, discuss their known
convergence properties and illustrate their relative empirical behavior on
Garnet problems. Our experiments suggest that the most standard algorithms on
and off-policy LSTD(\lambda)/LSPE(\lambda) - and TD(\lambda) if the feature
space dimension is too large for a least-squares approach - perform the best.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2013 06:51:33 GMT'}]",2013-04-16,"[['Geist', 'Matthieu', '', 'INRIA Lorraine - LORIA'], ['Scherrer', 'Bruno', '', 'INRIA Lorraine - LORIA']]","['Reinforcement Learning', 'Value Function Estimation', 'Off-policy Learning', 'Eligibility Traces']"
16061,1105.3715,Anderson Vieira,"Carlos Augusto Almeida Alcantara, Anderson Luiz Nogueira Vieira","Tecnologia M\'ovel: Uma Tend\^encia, Uma Realidade","Artigo defendido no II Workshop de Redes na Universidade Est\'acio de
  S\'a, Juiz de Fora, MG, Brasil","PEREZ, Marin, Grande Crescimento para o Com\'ercio M\'ovel,
  InformationWeek EUA -- 2009. Praestro Convergence - ebook Mobile Marketing:
  Mobile Marketing: Conceitos, Tecnologias e Cases, 2009",,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Currently, mobility presents itself as a major innovation in historic
technological revolution. From the first decade of this century, nothing
compares to what happened in the field of Information Technology (IT), which is
adding to market a range of news relating to infrastructure such as mobile
computing hardware, software, computer networks, etc.. From a handheld as a
wireless device, iPad, Smartphone, you can connect to the digital world,
people, customers, business partners, etc.. Given the infinite range of
information, services and resources available in the electronic world, it is
considered that few are those, markets and people who want to be left behind.
The interest in this channel of communication becomes not only a new strategy
of marketing and communications. Mobile devices are becoming more sophisticated
and allows access to the web. Thinking in this context is that manufacturers of
electronic components face each other in a war over the disputed technology to
a competitive environment that is open to those who put on the market the
product more attractive, interactive and versatile.
","[{'version': 'v1', 'created': 'Wed, 18 May 2011 18:49:17 GMT'}]",2011-05-20,"[['Alcantara', 'Carlos Augusto Almeida', ''], ['Vieira', 'Anderson Luiz Nogueira', '']]","['Mobile', 'technology', 'smartphone', 'mobility', 'communication', 'networking']"
16062,2006.04489,Hichem Sahbi,Ahmed Mazari and Hichem Sahbi,Action Recognition with Deep Multiple Aggregation Networks,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most of the current action recognition algorithms are based on deep networks
which stack multiple convolutional, pooling and fully connected layers. While
convolutional and fully connected operations have been widely studied in the
literature, the design of pooling operations that handle action recognition,
with different sources of temporal granularity in action categories, has
comparatively received less attention, and existing solutions rely mainly on
max or averaging operations. The latter are clearly powerless to fully exhibit
the actual temporal granularity of action categories and thereby constitute a
bottleneck in classification performances. In this paper, we introduce a novel
hierarchical pooling design that captures different levels of temporal
granularity in action recognition. Our design principle is coarse-to-fine and
achieved using a tree-structured network; as we traverse this network top-down,
pooling operations are getting less invariant but timely more resolute and well
localized. Learning the combination of operations in this network -- which best
fits a given ground-truth -- is obtained by solving a constrained minimization
problem whose solution corresponds to the distribution of weights that capture
the contribution of each level (and thereby temporal granularity) in the global
hierarchical pooling process. Besides being principled and well grounded, the
proposed hierarchical pooling is also video-length and resolution agnostic.
Extensive experiments conducted on the challenging UCF-101, HMDB-51 and
JHMDB-21 databases corroborate all these statements.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2020 11:37:38 GMT'}]",2020-06-09,"[['Mazari', 'Ahmed', ''], ['Sahbi', 'Hichem', '']]","['Multiple aggregation design', '2-stream networks', 'action recognition']"
16063,0805.3858,An-Ping Li,An-Ping Li,A New Type of Cipher: DICING_csb,There is a new variant added in the section 5,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we will propose a new type of cipher named DICING_csb, which
is derived from our previous stream cipher DICING. It has applied a stream of
subkey and an encryption form of block ciphers, so it may be viewed as a
combinative of stream cipher and block cipher. Hence, the new type of cipher
has fast rate like a stream cipher and need no MAC.
","[{'version': 'v1', 'created': 'Mon, 26 May 2008 02:09:32 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Jun 2008 01:13:20 GMT'}]",2009-03-21,"[['Li', 'An-Ping', '']]","['stream cipher', 'LFSR', 'projector', 'finite field', 'correlation attack', 'algebraic attack', 'distinguishing attack']"
16064,1108.5592,Sivakumar Madesan,"Abhishek Taneja, R.K.Chauhan","A Performance Study of Data Mining Techniques: Multiple Linear
  Regression vs. Factor Analysis","Data mining, Multiple Linear Regression, Factor Analysis, Principal
  Component Regression, Maximum Liklihood Regression, Generalized Least Square
  Regression",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The growing volume of data usually creates an interesting challenge for the
need of data analysis tools that discover regularities in these data. Data
mining has emerged as disciplines that contribute tools for data analysis,
discovery of hidden knowledge, and autonomous decision making in many
application domains. The purpose of this study is to compare the performance of
two data mining techniques viz., factor analysis and multiple linear regression
for different sample sizes on three unique sets of data. The performance of the
two data mining techniques is compared on following parameters like mean square
error (MSE), R-square, R-Square adjusted, condition number, root mean square
error(RMSE), number of variables included in the prediction model, modified
coefficient of efficiency, F-value, and test of normality. These parameters
have been computed using various data mining tools like SPSS, XLstat, Stata,
and MS-Excel. It is seen that for all the given dataset, factor analysis
outperform multiple linear regression. But the absolute value of prediction
accuracy varied between the three datasets indicating that the data
distribution and data characteristics play a major role in choosing the correct
prediction technique.
","[{'version': 'v1', 'created': 'Fri, 26 Aug 2011 07:08:13 GMT'}]",2011-08-30,"[['Taneja', 'Abhishek', ''], ['Chauhan', 'R. K.', '']]","['Data mining', 'Multiple Linear Regression', 'Factor Analysis', 'Principal Component Regression', 'Maximum Liklihood Regression', 'Generalized Least Square Regression']"
16065,0910.3736,Bingbing Xia,"Bingbing Xia, Fei Qiao, Huazhong Yang, and Hui Wang","A Fault-tolerant Structure for Reliable Multi-core Systems Based on
  Hardware-Software Co-design","7 pages, 5 figures",,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To cope with the soft errors and make full use of the multi-core system, this
paper gives an efficient fault-tolerant hardware and software co-designed
architecture for multi-core systems. And with a not large number of test
patterns, it will use less than 33% hardware resources compared with the
traditional hardware redundancy (TMR) and it will take less than 50% time
compared with the traditional software redundancy (time redundant).Therefore,
it will be a good choice for the fault-tolerant architecture for the future
high-reliable multi-core systems.
","[{'version': 'v1', 'created': 'Tue, 20 Oct 2009 04:01:51 GMT'}]",2016-09-08,"[['Xia', 'Bingbing', ''], ['Qiao', 'Fei', ''], ['Yang', 'Huazhong', ''], ['Wang', 'Hui', '']]","['Fault-tolerant', 'Hardware-software Co-design', 'Multi-core']"
16066,1710.04861,Beatriz Lorenzo,"Beatriz Lorenzo, Juan Garcia-Rois, Xuanheng Li, Javier
  Gonzalez-Castano, Yuguang Fang",A Robust Dynamic Edge Network Architecture for the Internet-of-Things,"A version of this paper has been accepted to IEEE Network Magazine,
  Special Issue on Edge Computing for the Internet-of-Things, 15 pages, 6
  figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A massive number of devices are expected to fulfill the missions of sensing,
processing and control in cyber-physical Internet-of-Things (IoT) systems with
new applications and connectivity requirements. In this context, scarce
spectrum resources must accommodate a high traffic volume with stringent
requirements of low latency, high reliability and energy efficiency.
Conventional centralized network architectures may not be able to fulfill these
requirements due to congestion in backhaul links. This article presents a novel
design of a robust dynamic edge network architecture (RDNA) for IoT which
leverages the latest advances of mobile devices (e.g., their capability to act
as access points, storing and computing capabilities) to dynamically harvest
unused resources and mitigate network congestion. However, traffic dynamics may
compromise the availability of terminal access points and channels and, thus,
network connectivity. The proposed design embraces solutions at physical,
access, networking, application, and business layers to improve network
robustness. The high density of mobile devices provides alternatives for close
connectivity which reduces interference and latency, and thus, increases
reliability and energy efficiency. Moreover, the computing capabilities of
mobile devices project smartness onto the edge which is desirable for
autonomous and intelligent decision making. A case study is included to
illustrate the performance of RDNA. Potential applications of this architecture
in the context of IoT are outlined. Finally, some challenges for future
research are presented.
","[{'version': 'v1', 'created': 'Fri, 13 Oct 2017 10:12:02 GMT'}]",2017-10-16,"[['Lorenzo', 'Beatriz', ''], ['Garcia-Rois', 'Juan', ''], ['Li', 'Xuanheng', ''], ['Gonzalez-Castano', 'Javier', ''], ['Fang', 'Yuguang', '']]","['cognitive radio networks', 'edge computing', 'energy efficiency', 'Internet-of']"
16067,1510.05454,Daniel Jung,"Sebastian Abshoff, Andreas Cord-Landwehr, Matthias Fischer, Daniel
  Jung, Friedhelm Meyer auf der Heide",Gathering a Closed Chain of Robots on a Grid,,,,,cs.DC cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the following variant of the two dimensional gathering problem
for swarms of robots: Given a swarm of $n$ indistinguishable, point shaped
robots on a two dimensional grid. Initially, the robots form a closed chain on
the grid and must keep this connectivity during the whole process of their
gathering. Connectivity means, that neighboring robots of the chain need to be
positioned at the same or neighboring points of the grid. In our model,
gathering means to keep shortening the chain until the robots are located
inside a $2\times 2$ subgrid. Our model is completely local (no global control,
no global coordinates, no compass, no global communication or vision, \ldots).
Each robot can only see its next constant number of left and right neighbors on
the chain. This fixed constant is called the \emph{viewing path length}. All
its operations and detections are restricted to this constant number of robots.
Other robots, even if located at neighboring or the same grid point cannot be
detected. Only based on the relative positions of its detectable chain
neighbors, a robot can decide to obtain a certain state. Based on this state
and their local knowledge, the robots do local modifications to the chain by
moving to neighboring grid points without breaking the chain. These
modifications are performed without the knowledge whether they lead to a global
progress or not. We assume the fully synchronous $\mathcal{FSYNC}$ model. For
this problem, we present a gathering algorithm which needs linear time. This
result generalizes the result from \cite{hopper}, where an open chain with
specified distinguishable (and fixed) endpoints is considered.
","[{'version': 'v1', 'created': 'Mon, 19 Oct 2015 13:07:39 GMT'}]",2015-10-20,"[['Abshoff', 'Sebastian', ''], ['Cord-Landwehr', 'Andreas', ''], ['Fischer', 'Matthias', ''], ['Jung', 'Daniel', ''], ['der Heide', 'Friedhelm Meyer auf', '']]","['Gathering problem', 'Autonomous robots', 'Distributed algorithms', 'Localalgorithms', 'Mobile agents', 'Runtime bound', 'Swarm formation problems']"
16068,0908.0704,Gene Golovchinsky,"Gene Golovchinsky, Jeremy Pickens and Maribeth Back",A Taxonomy of Collaboration in Online Information Seeking,"Presented at 1st Intl Workshop on Collaborative Information Seeking,
  2008 (arXiv:0908.0583)",,,JCDL2008CIRWS/2008/golpicbac,cs.IR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  People can help other people find information in networked information
seeking environments. Recently, many such systems and algorithms have
proliferated in industry and in academia. Unfortunately, it is difficult to
compare the systems in meaningful ways because they often define collaboration
in different ways. In this paper, we propose a model of possible kinds of
collaboration, and illustrate it with examples from literature. The model
contains four dimensions: intent, depth, concurrency and location. This model
can be used to classify existing systems and to suggest possible opportunities
for design in this space.
","[{'version': 'v1', 'created': 'Wed, 5 Aug 2009 16:48:18 GMT'}]",2009-08-06,"[['Golovchinsky', 'Gene', ''], ['Pickens', 'Jeremy', ''], ['Back', 'Maribeth', '']]","['Information seeking', 'collaboration', 'CSCW', 'taxonomy']"
16069,1407.5385,G  Sahoo,"Md. Amir Khusru Akhtar, Arshad Usmani, G. Sahoo",Nontransitive Ranking to Enhance Routing Decision in MANETS,"7 Pages, IJCEA 2014",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An ad hoc network is an infrastructureless network in which nodes perform
terminal as well as routing functions. A routing protocol is the only
substitute to complete the communications in the absence of an access point. In
spite of that mobile nodes or so called routers uses some mechanism for
calculating the best route when it has multiple routes for the same
destination. On the basis of one or more metrics routes are ranked from best to
worst. But, in an ad hoc network many factors can affect this decision, such as
the delay, load, route lifetime etc. Thus measuring and finding routes on the
basis of crisp mathematical model for all these attributes is complicated. That
why, the fuzzy approach for best route determination is required for MANET
because some of the metrics are fuzzy or vague and the classical ranking of
routes and transitivity in the ranking does not hold. The proposed
Nontransitive Route Ranking subjective comparison of one route with others and
performs nontransitive ranking to rank routes from best to worst. The pairwise
comparisons of each route with others give more accurate and fair comparison.
The proposed ranking is easier than classical ranking in which metrics have
assigned some value and these values are combined to obtain the ranking.
Experimental result shows the efficiency of the proposed model. Keywords:
Fuzzy, Rank, Nontransitive, Route, Ranking, Relativity
","[{'version': 'v1', 'created': 'Mon, 21 Jul 2014 07:01:17 GMT'}]",2014-07-22,"[['Akhtar', 'Md. Amir Khusru', ''], ['Usmani', 'Arshad', ''], ['Sahoo', 'G.', '']]","['Fuzzy', 'Rank', 'Nontransitive', 'Route', 'Ranking', 'Relativity']"
16070,1610.04594,Sumalini Vartak,"Anne Veenendaal, Elliot Daly, Eddie Jones, Zhao Gang, Sumalini Vartak,
  Rahul S Patwardhan",Code Definition Analysis for Call Graph Generation,"Short paper, 3 pages, 2 figures. call graph, code analysis, software
  comprehension, code understanding",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Enterprise level software is implemented using multi-layer architecture.
These layers are often implemented using de-coupled solutions with millions of
lines of code. Programmers often have to track and debug a function call from
user interface layer to the data access layer while troubleshooting an issue.
They have to inspect the code based on search results or use design documents
to construct the call graph. This process is time consuming and laborious. The
development environment tools are insufficient or confined to analyzing only
the code in the loaded solution. This paper proposes a method to construct a
call graph of the call across several layers of the code residing in different
code bases to help programmers better understand the design and architecture of
the software. The signatures of class, methods, and properties were evaluated
and then matched against the code files. A graph of matching functions was
created. The recursive search stopped when there were no matches or the data
layer code was detected. The method resulted in 78.26% accuracy when compared
with manual search.
","[{'version': 'v1', 'created': 'Wed, 27 Jul 2016 03:05:37 GMT'}]",2016-10-17,"[['Veenendaal', 'Anne', ''], ['Daly', 'Elliot', ''], ['Jones', 'Eddie', ''], ['Gang', 'Zhao', ''], ['Vartak', 'Sumalini', ''], ['Patwardhan', 'Rahul S', '']]","['Software comprehension', 'call graph', 'architecture', 'code metrics', 'code analysis']"
16071,1505.02977,Konstantinos Tserpes,"Magdalini Kardara, Vasilis Kalogirou, Athanasios Papaoikonomou,
  Theodora Varvarigou, Konstantinos Tserpes","SocIoS API: A data aggregator for accessing user generated content from
  online social networks","15th International Conference on Web Information System Engineering
  (WISE 2014), Thessaloniki, Greece, 12-14 October 2014",,,,cs.SE cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Following the boost in popularity of online social networks, both enterprises
and researchers looked for ways to access the social dynamics information and
user generated content residing in these spaces. This endeavor, however,
presented several challenges caused by the heterogeneity of data and the lack
of a common way to access them. The SocIoS framework tries to address these
challenges by providing tools that operate on top of multiple popular social
networks allowing uniform access to their data. It provides a single access
point for aggregating data and functionality from the networks, as well as a
set of analytical tools for exploiting them. In this paper we present the
SocIoS API, an abstraction layer on top of the social networks exposing
operations that encapsulate the functionality of their APIs. Currently, the
component provides support for seven social networks and is flexible enough to
allow for the seamless addition of more.
","[{'version': 'v1', 'created': 'Tue, 12 May 2015 12:12:20 GMT'}]",2015-05-13,"[['Kardara', 'Magdalini', ''], ['Kalogirou', 'Vasilis', ''], ['Papaoikonomou', 'Athanasios', ''], ['Varvarigou', 'Theodora', ''], ['Tserpes', 'Konstantinos', '']]","['Social Networks', 'Data Aggregator', 'API', 'REST', 'SOAP']"
16072,1207.5672,Gyorgy Dosa,Gyorgy Dosa and Zsolt Tuza,"Bin Packing/Covering with Delivery: Some variations, theoretical results
  and efficient offline algorithms",16 pages,,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the recent paper \cite{BDT10} we introduced a new problem that we call Bin
Packing/Covering with Delivery, or BP/CD for short. Mainly we mean under this
expression that we look for not only a good, but a ""good and fast"" packing or
covering. In that paper we mainly dealt with only one possible online BP/CD
model, and proposed a new method that we call the Evolution of Algorithms. In
case of such methods a neighborhood structure is defined among algorithms, and
using a metaheuristic (for example simulated annealing) in some sense the best
algorithm is chosen to solve the problem. Now we turn to investigate the
offline case. We define several ways to treat such a BP/CD problem, although we
investigate only one of them here. For the analysis, a novel view on ""offline
optimum"" is introduced, which appears to be relevant concerning all problems
where a final solution is ordering-dependent. We prove that if the item sizes
are not allowed to be arbitrarily close to zero, then an optimal offline
solution can be found in polynomial time. On the other hand, for unrestricted
problem instances, no polynomial-time algorithm can achieve an approximation
ratio better than 6/7 if $P\ne NP$.
","[{'version': 'v1', 'created': 'Tue, 24 Jul 2012 12:11:36 GMT'}]",2015-03-20,"[['Dosa', 'Gyorgy', ''], ['Tuza', 'Zsolt', '']]","['bin packing', 'bin covering', 'polynomial-time exact algorithm', 'approximation algorithm', 'non-approximability']"
16073,1701.05339,Zhao Zhang,"Yishuo Shi, Zhao Zhang, Ding-Zhu Du","Randomized Bicriteria Approximation Algorithm for Minimum Submodular
  Cost Partial Multi-Cover Problem",,,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies randomized approximation algorithm for a variant of the
set cover problem called minimum submodular cost partial multi-cover (SCPMC),
in which each element $e$ has a covering requirement $r_e$ and a profit $p_e$,
and the cost function on sub-collection of sets is submodular, the goal is to
find a minimum cost sub-collection of sets which fully covers at least
$q$-percentage of total profit, where an element $e$ is fully covered by
sub-collection $S'$ if and only if it belongs to at least $r_e$ sets of
$\mathcal S'$. Previous work shows that such a combination enormously increases
the difficulty of studies, even when the cost function is linear.
  In this paper, assuming that the maximum covering requirement
$r_{\max}=\max_e r_e$ is a constant and the cost function is nonnegative,
monotone nondecreasing, and submodular, we give the first randomized bicriteria
algorithm for SCPMC the output of which fully covers at least
$(q-\varepsilon)$-percentage of all elements and the performance ratio is
$O(b/\varepsilon)$ with a high probability, where $b=\max_e\binom{f}{r_{e}}$
and $f$ is the maximum number of sets containing a common element. The
algorithm is based on a novel non-linear program. Furthermore, in the case when
the covering requirement $r\equiv 1$, a bicriteria
$O(f/\varepsilon)$-approximation can be achieved even when monotonicity
requirement is dropped off from the cost function.
","[{'version': 'v1', 'created': 'Thu, 19 Jan 2017 09:15:01 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Feb 2017 01:31:16 GMT'}]",2017-02-02,"[['Shi', 'Yishuo', ''], ['Zhang', 'Zhao', ''], ['Du', 'Ding-Zhu', '']]","['partial cover', 'multi-cover', 'submodular cover', 'Lov´asz extension', 'randomized algorithm', 'approximation algorithm', 'bicriteria']"
16074,1011.2238,Rogerio de Carvalho A,"Rogerio Atem de Carvalho, Rodrigo Soares Manhaes, Fernando Luiz de
  Carvalho e Silva",Introducing Business Language Driven Development,"17 pages, 10 figures, original work",,,,cs.SE,http://creativecommons.org/licenses/by/3.0/,"  A classical problem in Software Engineering is how to certify that every
system requirement is correctly implemented by source code. This problem,
albeit well studied, can still be considered an open one, given the problems
faced by software development organizations. Trying to solve this problem,
Behavior-Driven Development (BDD) is a specification technique that
automatically certifies that all functional requirements are treated properly
by source code, through the connection of the textual description of these
requirements to automated tests. However, in some areas, such as Enterprise
Information Systems, requirements are identified by Business Process Modeling -
which uses graphical notations of the underlying business processes. Therefore,
the aim of this paper is to present Business Language Driven Development
(BLDD), a method that aims to extend BDD, by connecting business process models
directly to source code, while keeping the expressiveness of text descriptions
when they are better fitted than graphical artifacts.
","[{'version': 'v1', 'created': 'Tue, 9 Nov 2010 23:55:05 GMT'}]",2010-11-11,"[['de Carvalho', 'Rogerio Atem', ''], ['Manhaes', 'Rodrigo Soares', ''], ['Silva', 'Fernando Luiz de Carvalho e', '']]","['Behavior Driven Development', 'Business Process Modeling', 'Requirements Engineering', 'Enterprise Information Systems']"
16075,1401.4506,Benjamin Belzer,"Jiyang Yu, Michael Carosino, Krishnamoorthy Sivakumar, Benjamin J.
  Belzer, Yiming Chen","Detection and Decoding for 2D Magnetic Recording Channels with 2D
  Intersymbol Interference","8 pages, 11 figures, 1 table",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers iterative detection and decoding on the concatenated
communication channel consisting of a two-dimensional magnetic recording (TDMR)
channel modeled by the four-grain rectangular discrete grain model (DGM)
proposed by Kavcic et. al., followed by a two-dimensional intersymbol
interference (2D-ISI) channel modeled by linear convolution of the DGM model's
output with a finite-extent 2D blurring mask followed by addition of white
Gaussian noise. An iterative detection and decoding scheme combines TDMR
detection, 2D-ISI detection, and soft-in/soft-out (SISO) channel decoding in a
structure with two iteration loops. In the first loop, the 2D-ISI channel
detector exchanges log-likelihood ratios (LLRs) with the TDMR detector. In the
second loop, the TDMR detector exchanges LLRs with a serially concatenated
convolutional code (SCCC) decoder. Simulation results for the concatenated TDMR
and 2 x 2 averaging mask ISI channel with 10 dB SNR show that densities of 0.48
user bits per grain and above can be achieved, corresponding to an areal
density of about 9.6 Terabits per square inch, over the entire range of grain
probabilities in the TDMR model.
","[{'version': 'v1', 'created': 'Sat, 18 Jan 2014 01:44:03 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Jan 2014 05:05:32 GMT'}]",2014-01-24,"[['Yu', 'Jiyang', ''], ['Carosino', 'Michael', ''], ['Sivakumar', 'Krishnamoorthy', ''], ['Belzer', 'Benjamin J.', ''], ['Chen', 'Yiming', '']]","['Two-dimensional magnetic recording', 'iterative detection and decoding', 'rectangular grain model', 'two-dimensionalintersymbol interference']"
16076,1007.1016,Oleg Pianykh,Oleg S. Pianykh,Bilateral filters: what they can and cannot do,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nonlinear bilateral filters (BF) deliver a fine blend of computational
simplicity and blur-free denoising. However, little is known about their
nature, noise-suppressing properties, and optimal choices of filter parameters.
Our study is meant to fill this gap-explaining the underlying mechanism of
bilateral filtering and providing the methodology for optimal filter selection.
Practical application to CT image denoising is discussed to illustrate our
results.
","[{'version': 'v1', 'created': 'Tue, 6 Jul 2010 23:25:39 GMT'}]",2010-07-08,"[['Pianykh', 'Oleg S.', '']]","['bilateral filtering', 'denoising', 'CT radiation']"
16077,1502.05147,Charles Grellois,Charles Grellois and Paul-Andr\'e Melli\`es,Finitary semantics of linear logic and higher-order model-checking,"12 pages, submitted",,,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we explain how the connection between higher-order
model-checking and linear logic recently exhibited by the authors leads to a
new and conceptually enlightening proof of the selection problem originally
established by Carayol and Serre using collapsible pushdown automata. The main
idea is to start from an infinitary and colored relational semantics of the
lambdaY-calculus already formulated, and to replace it by its finitary
counterpart based on finite prime-algebraic lattices. Given a higher-order
recursion scheme G, the finiteness of its interpretation in the model enables
us to associate to any MSO formula phi a new higher-order recursion scheme
G_phi resolving the selection problem.
","[{'version': 'v1', 'created': 'Wed, 18 Feb 2015 07:56:25 GMT'}, {'version': 'v2', 'created': 'Fri, 1 May 2015 10:06:17 GMT'}]",2016-09-29,"[['Grellois', 'Charles', ''], ['Melliès', 'Paul-André', '']]","['Higher-order model-checking', 'linear logic', 'selection problem', 'finitary semantics', 'parity games']"
16078,1701.01887,John Cristian Borges Gamboa,John Cristian Borges Gamboa,Deep Learning for Time-Series Analysis,"Written as part of the Seminar on Collaborative Intelligence in the
  TU Kaiserslautern. January 2016",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many real-world application, e.g., speech recognition or sleep stage
classification, data are captured over the course of time, constituting a
Time-Series. Time-Series often contain temporal dependencies that cause two
otherwise identical points of time to belong to different classes or predict
different behavior. This characteristic generally increases the difficulty of
analysing them. Existing techniques often depended on hand-crafted features
that were expensive to create and required expert knowledge of the field. With
the advent of Deep Learning new models of unsupervised learning of features for
Time-series analysis and forecast have been developed. Such new developments
are the topic of this paper: a review of the main Deep Learning techniques is
presented, and some applications on Time-Series analysis are summaried. The
results make it clear that Deep Learning has a lot to contribute to the field.
","[{'version': 'v1', 'created': 'Sat, 7 Jan 2017 21:44:04 GMT'}]",2017-01-10,"[['Gamboa', 'John Cristian Borges', '']]","['Artificial Neural Networks', 'Deep Learning', 'Time-Series']"
16079,1707.08776,Georgios Chasparis,"Georgios C. Chasparis, Michael Rossbory and Verena Haunschmid","An Evolutionary Stochastic-Local-Search Framework for One-Dimensional
  Cutting-Stock Problems",,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce an evolutionary stochastic-local-search (SLS) algorithm for
addressing a generalized version of the so-called 1/V/D/R cutting-stock
problem. Cutting-stock problems are encountered often in industrial
environments and the ability to address them efficiently usually results in
large economic benefits. Traditionally linear-programming-based techniques have
been utilized to address such problems, however their flexibility might be
limited when nonlinear constraints and objective functions are introduced. To
this end, this paper proposes an evolutionary SLS algorithm for addressing
one-dimensional cutting-stock problems. The contribution lies in the
introduction of a flexible structural framework of the optimization that may
accommodate a large family of diversification strategies including a novel
parallel pattern appropriate for SLS algorithms (not necessarily restricted to
cutting-stock problems). We finally demonstrate through experiments in a
real-world manufacturing problem the benefit in cost reduction of the
considered diversification strategies.
","[{'version': 'v1', 'created': 'Thu, 27 Jul 2017 08:31:17 GMT'}]",2017-07-28,"[['Chasparis', 'Georgios C.', ''], ['Rossbory', 'Michael', ''], ['Haunschmid', 'Verena', '']]","['Cutting-stock problem', 'evolutionary algorithms', 'stochastic-localsearch (SLS)', 'heuristics']"
16080,1610.07530,Du\v{s}an Knop,Pavel Dvo\v{r}\'ak and Du\v{s}an Knop and Tom\'a\v{s} Toufar,Target Set Selection in Dense Graph Classes,"37 pages, 11 figures, short version appeared in Proc. of ISAAC 2019",,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the Target Set Selection problem from a parameterized
complexity perspective. Here for a given graph and a threshold for each vertex,
the task is to find a set of vertices (called a target set) which activates the
whole graph during the following iterative process. A vertex outside the active
set becomes active if the number of so far activated vertices in its
neighborhood is at least its threshold.
  We give two parameterized algorithms for a special case where each vertex has
the threshold set to the half of its neighbors (the so-called Majority Target
Set Selection problem) for parameterizations by the neighborhood diversity and
the twin cover number of the input graph.
  We complement these results from the negative side. We give a hardness proof
for the Majority Target Set Selection problem when parameterized by (a
restriction of) the modular-width - a natural generalization of both previous
structural parameters. We also show the Target Set Selection problem
parameterized by the neighborhood diversity or by the twin cover number is
W[1]-hard when there is no restriction on the thresholds.
","[{'version': 'v1', 'created': 'Mon, 24 Oct 2016 18:31:55 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Aug 2020 13:45:13 GMT'}]",2020-08-17,"[['Dvořák', 'Pavel', ''], ['Knop', 'Dušan', ''], ['Toufar', 'Tomáš', '']]","['parameterized complexity', 'target set selection', 'dense graphs']"
16081,1003.2643,Rob Sanderson,"Robert Sanderson, Herbert Van de Sompel",Making Web Annotations Persistent over Time,"10 pages, 8 figures, accepted to JCDL 2010",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As Digital Libraries (DL) become more aligned with the web architecture,
their functional components need to be fundamentally rethought in terms of URIs
and HTTP. Annotation, a core scholarly activity enabled by many DL solutions,
exhibits a clearly unacceptable characteristic when existing models are applied
to the web: due to the representations of web resources changing over time, an
annotation made about a web resource today may no longer be relevant to the
representation that is served from that same resource tomorrow. We assume the
existence of archived versions of resources, and combine the temporal features
of the emerging Open Annotation data model with the capability offered by the
Memento framework that allows seamless navigation from the URI of a resource to
archived versions of that resource, and arrive at a solution that provides
guarantees regarding the persistence of web annotations over time. More
specifically, we provide theoretical solutions and proof-of-concept
experimental evaluations for two problems: reconstructing an existing
annotation so that the correct archived version is displayed for all resources
involved in the annotation, and retrieving all annotations that involve a given
archived version of a web resource.
","[{'version': 'v1', 'created': 'Fri, 12 Mar 2010 21:36:18 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Mar 2010 16:15:12 GMT'}]",2010-03-22,"[['Sanderson', 'Robert', ''], ['Van de Sompel', 'Herbert', '']]","['Annotation', 'Persistence', 'Digital Preservation', 'Web Architecture']"
16082,1401.1913,"J\""urgen M\""unch","Adam Trendowicz, Michael Kl\""as, Constanza Lampasona, J\""urgen
  M\""unch, Christian K\""orner, Matthias Saft","Model-based Product Quality Evaluation with Multi-Criteria Decision
  Analysis","18 pages. The final publication is available at
  http://www.shaker.de/de/content/catalogue/index.asp?
  lang=de&ID=8&ISBN=978-3-8322-9618-6","Proceedings of the International Conference on Software Process
  and Product Measurement (IWSM/MetriKon/Mensura 2010), pages 3-20, Stuttgart,
  Germany, November 10-12 2010",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ability to develop or evolve software or software-based systems/services
with defined and guaranteed quality in a predictable way is becoming
increasingly important. Essential - though not exclusive - prerequisites for
this are the ability to model the relevant quality properties appropriately and
the capability to perform reliable quality evaluations. Existing approaches for
integrated quality modeling and evaluation are typically either narrowly
focused or too generic and have proprietary ways for modeling and evaluating
quality. This article sketches an ap- proach for modeling and evaluating
quality properties in a uniform way, without losing the ability to build
sufficiently detailed customized models for specific quality properties. The
focus of this article is on the description of a multi-criteria aggregation
mechanism that can be used for the evaluation. In addition, the underlying
quality meta-model, an example application scenario, related work, initial
application results, and an outlook on future research are presented.
","[{'version': 'v1', 'created': 'Thu, 9 Jan 2014 07:47:58 GMT'}]",2014-01-10,"[['Trendowicz', 'Adam', ''], ['Kläs', 'Michael', ''], ['Lampasona', 'Constanza', ''], ['Münch', 'Jürgen', ''], ['Körner', 'Christian', ''], ['Saft', 'Matthias', '']]","['Software quality model', 'quality evaluation', 'product assessment', 'MCDA', 'Quamoco']"
16083,1802.06286,Yuanxin Li,Yuanxin Li and Cong Ma and Yuxin Chen and Yuejie Chi,Nonconvex Matrix Factorization from Rank-One Measurements,34 pages,,,,cs.IT cs.LG math.IT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of recovering low-rank matrices from random rank-one
measurements, which spans numerous applications including covariance sketching,
phase retrieval, quantum state tomography, and learning shallow polynomial
neural networks, among others. Our approach is to directly estimate the
low-rank factor by minimizing a nonconvex quadratic loss function via vanilla
gradient descent, following a tailored spectral initialization. When the true
rank is small, this algorithm is guaranteed to converge to the ground truth (up
to global ambiguity) with near-optimal sample complexity and computational
complexity. To the best of our knowledge, this is the first guarantee that
achieves near-optimality in both metrics. In particular, the key enabler of
near-optimal computational guarantees is an implicit regularization phenomenon:
without explicit regularization, both spectral initialization and the gradient
descent iterates automatically stay within a region incoherent with the
measurement vectors. This feature allows one to employ much more aggressive
step sizes compared with the ones suggested in prior literature, without the
need of sample splitting.
","[{'version': 'v1', 'created': 'Sat, 17 Feb 2018 20:30:47 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Dec 2018 05:37:06 GMT'}]",2018-12-04,"[['Li', 'Yuanxin', ''], ['Ma', 'Cong', ''], ['Chen', 'Yuxin', ''], ['Chi', 'Yuejie', '']]","['matrix factorization', 'rank-one measurements', 'gradient descent', 'nonconvex optimization']"
16084,1207.4701,Mingyi Hong,"Chenyang Li, Mingyi Hong, Randy Cogill and Alfredo Garcia",An Adaptive Online Ad Auction Scoring Algorithm for Revenue Maximization,,,,,cs.GT cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sponsored search becomes an easy platform to match potential consumers'
intent with merchants' advertising. Advertisers express their willingness to
pay for each keyword in terms of bids to the search engine. When a user's query
matches the keyword, the search engine evaluates the bids and allocates slots
to the advertisers that are displayed along side the unpaid algorithmic search
results. The advertiser only pays the search engine when its ad is clicked by
the user and the price-per-click is determined by the bids of other competing
advertisers.
","[{'version': 'v1', 'created': 'Thu, 19 Jul 2012 15:07:13 GMT'}]",2012-07-20,"[['Li', 'Chenyang', ''], ['Hong', 'Mingyi', ''], ['Cogill', 'Randy', ''], ['Garcia', 'Alfredo', '']]","['ad auction', 'sponsored search', 'adaptive algorithms', 'search engines', 'revenue maximization']"
16085,0707.2842,Damien Chablat,"Maher Baili (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat
  (IRCCyN)","A Classification of 3R Orthogonal Manipulators by the Topology of their
  Workspace",,Proc. IEEE Int. Conf. Rob. and Automation (04/2004) 1-6,,,cs.RO,,"  A classification of a family of 3-revolute (3R) positining manipulators is
established. This classification is based on the topology of their workspace.
The workspace is characterized in a half-cross section by the singular curves.
The workspace topology is defined by the number of cusps and nodes that appear
on these singular curves. The design parameters space is shown to be divided
into nine domains of distinct workspace topologies, in which all manipulators
have similar global kinematic properties. Each separating surface is given as
an explicit expression in the DH-parameters.
","[{'version': 'v1', 'created': 'Thu, 19 Jul 2007 07:20:26 GMT'}]",2007-07-20,"[['Baili', 'Maher', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN'], ['Chablat', 'Damien', '', 'IRCCyN']]","['Classification', 'Workspace', 'Singularity', 'Cusp', 'node', 'orthogonal manipulator']"
16086,1412.7273,Sumita Mishra,"Sumita Mishra, Nidhi Mathur",Load Balancing Optimization in LTE/LTE-A Cellular Networks: A Review,Preprint,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During the past few decades wireless technology has seen a tremendous growth.
The recent introduction of high-end mobile devices has further increased
subscriber's demand for high bandwidth. Current cellular systems require manual
configuration and management of networks, which is now costly, time consuming
and error prone due to exponentially increasing rate of mobile users and nodes.
This leads to introduction of self organizing capabilities for network
management with minimum human involvement. It is expected to permit higher end
user Quality of Service (QoS) along with less operational and maintenance cost
for telecom service providers. Self organized cellular networks incorporate a
collection of functions for automatic configuration, optimization and
maintenance of cellular networks. As mobile end users continue to use network
resources while moving from a cell boundary to other, traffic load within a
cell does not remain constant. Thus Load balancing as a part of self organized
network solution, has become one of the most active and emerging fields of
research in Cellular Network. It involves transfer of load from overloaded
cells to the neighbouring cells with free resources for more balanced load
distribution in order to maintain appropriate end-user experience and network
performance. In this paper, review of various load balancing techniques
currently used in mobile networks is presented, with special emphasis on
techniques that are suitable for self optimization feature in future cellular
networks.
","[{'version': 'v1', 'created': 'Tue, 23 Dec 2014 07:12:46 GMT'}]",2014-12-24,"[['Mishra', 'Sumita', ''], ['Mathur', 'Nidhi', '']]","['4G', 'Self-Optimization', 'Load Balancing', 'eNB', 'LTE Advanced']"
16087,1704.05112,Daniel Porto,"Daniel Porto, Jo\~ao Loff, Rui Duarte, Luis Ceze and Rodrigo Rodrigues","Making data center computations fast, but not so furious",The 7th Workshop on Multi-core and Rack Scale Systems - MARS'17,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an aggressive computational sprinting variant for data center
environments. While most of previous work on computational sprinting focuses on
maximizing the sprinting process while ensuring non-faulty conditions, we take
advantage of the existing replication in data centers to push the system beyond
its safety limits. In this paper we outline this vision, we survey existing
techniques for achieving it, and we present some design ideas for future work
in this area.
","[{'version': 'v1', 'created': 'Mon, 17 Apr 2017 20:09:23 GMT'}]",2017-04-19,"[['Porto', 'Daniel', ''], ['Loff', 'João', ''], ['Duarte', 'Rui', ''], ['Ceze', 'Luis', ''], ['Rodrigues', 'Rodrigo', '']]","['Computational Sprinting', 'Overclock', 'Fault tolerance', 'Data center']"
16088,1701.06004,Ane Izagirre,Ane Izagirre and Armand M. Makowski,"Light traffic behavior under the power-of-two load balancing strategy:
  The case of heterogeneous servers","30 pages, 13 figures",,,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a multi-server queueing system under the power-of-two policy with
Poisson job arrivals, heterogeneous servers and a general job requirement
distribution; each server operates under the first-come first-serve policy and
there are no buffer constraints. We analyze the performance of this system in
light traffic by evaluating the first two light traffic derivatives of the
average job response time. These expressions point to several interesting
structural features associated with server heterogeneity in light traffic: For
unequal capacities, the average job response time is seen to decrease for small
values of the arrival rate, and the more diverse the server speeds, the greater
the gain in performance. These theoretical findings are assessed through
limited simulations.
","[{'version': 'v1', 'created': 'Sat, 21 Jan 2017 10:00:27 GMT'}]",2017-01-24,"[['Izagirre', 'Ane', ''], ['Makowski', 'Armand M.', '']]","['Parallel servers', 'power-of-two scheduling', 'light traffic', 'heterogeneous servers']"
16089,1701.02408,Yuqing Zhu,"Yuqing Zhu, Philip S. Yu, Guolei Yi, Wenlong Ma, Mengying Guo, Jianxun
  Liu","To Vote Before Decide: A Logless One-Phase Commit Protocol for
  Highly-Available Datastores",11 pages,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Highly-available datastores are widely deployed for online applications.
However, many online applications are not contented with the simple data access
interface currently provided by highly-available datastores. Distributed
transaction support is demanded by applications such as large-scale online
payment used by Alipay or Paypal. Current solutions to distributed transaction
can spend more than half of the whole transaction processing time in
distributed commit. An efficient atomic commit protocol is highly desirable.
This paper presents the HACommit protocol, a logless one-phase commit protocol
for highly-available systems. HACommit has transaction participants vote for a
commit before the client decides to commit or abort the transaction; in
comparison, the state-of-the-art practice for distributed commit is to have the
client decide before participants vote. The change enables the removal of both
the participant logging and the coordinator logging steps in the distributed
commit process; it also makes possible that, after the client initiates the
transaction commit, the transaction data is visible to other transactions
within one communication roundtrip time (i.e., one phase). In the evaluation
with extensive experiments, HACommit outperforms recent atomic commit solutions
for highly-available datastores under different workloads. In the best case,
HACommit can commit in one fifth of the time 2PC does.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2017 02:05:49 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Jan 2017 03:16:37 GMT'}]",2017-01-12,"[['Zhu', 'Yuqing', ''], ['Yu', 'Philip S.', ''], ['Yi', 'Guolei', ''], ['Ma', 'Wenlong', ''], ['Guo', 'Mengying', ''], ['Liu', 'Jianxun', '']]","['atomic commit', 'high availability', 'transaction', '2PC', 'consensus']"
16090,0707.1193,Damien Chablat,"Mazen Zein (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)","Singular curves and cusp points in the joint space of 3-RPR parallel
  manipulators",,International Conference On Robotics And Automation (2006) 1-6,,,cs.RO,,"  This paper investigates the singular curves in two-dimensional slices of the
joint space of a family of planar parallel manipulators. It focuses on special
points, referred to as cusp points, which may appear on these curves. Cusp
points play an important role in the kinematic behavior of parallel
manipulators since they make possible a nonsingular change of assembly mode.
The purpose of this study is twofold. First, it reviews an important previous
work, which, to the authors' knowledge, has never been exploited yet. Second,
it determines the cusp points in any two-dimensional slice of the joint space.
First results show that the number of cusp points may vary from zero to eight.
This work finds applications in both design and trajectory planning.
","[{'version': 'v1', 'created': 'Mon, 9 Jul 2007 07:38:47 GMT'}]",2007-07-10,"[['Zein', 'Mazen', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN'], ['Chablat', 'Damien', '', 'IRCCyN']]","['Singular curves', 'cusp point', 'joint space', 'assembly mode', '3-RPR parallel manipulator']"
16091,1306.5412,Rahul Chhabra Mr,"Sajai Vir Singh, Gungan Gupta, Rahul Chhabra, Kanika Nagpal, Devansh","Electronically Tunable Voltage-Mode Biquad Filter/Oscillator Based On
  CCCCTAs","5 pages, 7 figures, 1 table, Authors profile",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a circuit employing current controlled current conveyor
trans-conductance amplifiers (CCCCTAs) as active element is proposed which can
function both as biquad filter and oscillator. It uses two CCCCTAs and two
capacitors. As a biquad filter it can realizes all the standard filtering
functions (low pass, band pass, high pass, band reject and all pass) in
voltage-mode and provides the feature of electronically and orthogonal control
of pole frequency and quality factor through biasing current(s) of CCCCTAs. The
proposed circuit can also be worked as oscillator without changing the circuit
topology. Without any resistors and using capacitors, the proposed circuit is
suitable for IC fabrication. The validity of proposed filter is verified
through PSPICE simulations.
","[{'version': 'v1', 'created': 'Sun, 23 Jun 2013 14:11:45 GMT'}]",2013-06-25,"[['Singh', 'Sajai Vir', ''], ['Gupta', 'Gungan', ''], ['Chhabra', 'Rahul', ''], ['Nagpal', 'Kanika', ''], ['Devansh', '', '']]","['component; CCCCTA', 'Tunable', 'Universal', 'Voltage']"
16092,1207.5774,Lou Marvin Caraig,Lou Marvin Caraig,A New Training Algorithm for Kanerva's Sparse Distributed Memory,"5 pages, 5 figures",,,,cs.CV cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Sparse Distributed Memory proposed by Pentii Kanerva (SDM in short) was
thought to be a model of human long term memory. The architecture of the SDM
permits to store binary patterns and to retrieve them using partially matching
patterns. However Kanerva's model is especially efficient only in handling
random data. The purpose of this article is to introduce a new approach of
training Kanerva's SDM that can handle efficiently non-random data, and to
provide it the capability to recognize inverted patterns. This approach uses a
signal model which is different from the one proposed for different purposes by
Hely, Willshaw and Hayes in [4]. This article additionally suggests a different
way of creating hard locations in the memory despite the Kanerva's static
model.
","[{'version': 'v1', 'created': 'Sun, 22 Jul 2012 16:30:07 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Jul 2012 05:04:18 GMT'}, {'version': 'v3', 'created': 'Fri, 27 Jul 2012 08:24:51 GMT'}]",2012-07-30,"[['Caraig', 'Lou Marvin', '']]","['SDM', 'Kanerva', 'memory', 'pattern recognition', 'signal']"
16093,0803.1500,Dean Krafft,"Dean B. Krafft, Aaron Birkland, Ellen J. Cramer","NCore: Architecture and Implementation of a Flexible, Collaborative
  Digital Library","11 pages, to appear in JCDL 2008",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  NCore is an open source architecture and software platform for creating
flexible, collaborative digital libraries. NCore was developed by the National
Science Digital Library (NSDL) project, and it serves as the central technical
infrastructure for NSDL. NCore consists of a central Fedora-based digital
repository, a specific data model, an API, and a set of backend services and
frontend tools that create a new model for collaborative, contributory digital
libraries. This paper describes NCore, presents and analyzes its architecture,
tools and services; and reports on the experience of NSDL in building and
operating a major digital library on it over the past year and the experience
of the Digital Library for Earth Systems Education in porting their existing
digital library and tools to the NCore platform.
","[{'version': 'v1', 'created': 'Mon, 10 Mar 2008 21:06:31 GMT'}]",2008-03-12,"[['Krafft', 'Dean B.', ''], ['Birkland', 'Aaron', ''], ['Cramer', 'Ellen J.', '']]","['Digital library', 'education', 'NSDL', 'Fedora', 'aggregations', 'architecture', 'interoperability']"
16094,1402.4748,Leon Abdillah,Leon Andretti Abdillah,"Managing information and knowledge sharing cultures in higher educations
  institutions","The 11th International Research Conference on Quality, Innovation,
  and Knowledge Management (QIK2014); L. A. Abdillah, ""Managing information and
  knowledge sharing cultures in higher educations institutions,"" in The 11th
  International Research Conference on QIK, The Trans Luxury Hotel, Bandung,
  Indonesia, 2014",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information and knowledge (IK) are very important for any institution
including education higher institution. Those IK are stored in every single
individual in organization in the form of experiences, skills, etc. The growth
of the higher education institution nowadays relies on how an institution
manage the dissemination of those IK over the organization by using information
technology (IT). This article discusses several ways and tools for engaging
persons in the organization to build sharing cultures. This article gives some
view of freely availabe application over internet to be used for IK sharing
cultures.
","[{'version': 'v1', 'created': 'Wed, 19 Feb 2014 18:06:33 GMT'}]",2014-02-20,"[['Abdillah', 'Leon Andretti', '']]","['Information and Knowledge Sharing Cultures', 'Email', 'eLearning', 'Blog']"
16095,1604.00054,Dmitry Kosolobov,"Dmitry Kosolobov, Florin Manea, Dirk Nowotka",Detecting One-variable Patterns,"16 pages (+13 pages of Appendix), 4 figures, accepted to SPIRE 2017",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a pattern $p = s_1x_1s_2x_2\cdots s_{r-1}x_{r-1}s_r$ such that
$x_1,x_2,\ldots,x_{r-1}\in\{x,\overset{{}_{\leftarrow}}{x}\}$, where $x$ is a
variable and $\overset{{}_{\leftarrow}}{x}$ its reversal, and
$s_1,s_2,\ldots,s_r$ are strings that contain no variables, we describe an
algorithm that constructs in $O(rn)$ time a compact representation of all $P$
instances of $p$ in an input string of length $n$ over a polynomially bounded
integer alphabet, so that one can report those instances in $O(P)$ time.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2016 21:25:42 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Apr 2016 10:24:18 GMT'}, {'version': 'v3', 'created': 'Mon, 9 May 2016 21:35:29 GMT'}, {'version': 'v4', 'created': 'Tue, 28 Feb 2017 17:43:06 GMT'}, {'version': 'v5', 'created': 'Tue, 18 Jul 2017 16:01:01 GMT'}]",2017-07-19,"[['Kosolobov', 'Dmitry', ''], ['Manea', 'Florin', ''], ['Nowotka', 'Dirk', '']]","['patterns with variables', 'matching', 'repetitions', 'pseudorepetitions']"
16096,1505.07193,Linyun Yu,"Linyun Yu, Peng Cui, Fei Wang, Chaoming Song, Shiqiang Yang","From Micro to Macro: Uncovering and Predicting Information Cascading
  Process with Behavioral Dynamics","10 pages, 11 figures",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cascades are ubiquitous in various network environments. How to predict these
cascades is highly nontrivial in several vital applications, such as viral
marketing, epidemic prevention and traffic management. Most previous works
mainly focus on predicting the final cascade sizes. As cascades are typical
dynamic processes, it is always interesting and important to predict the
cascade size at any time, or predict the time when a cascade will reach a
certain size (e.g. an threshold for outbreak). In this paper, we unify all
these tasks into a fundamental problem: cascading process prediction. That is,
given the early stage of a cascade, how to predict its cumulative cascade size
of any later time? For such a challenging problem, how to understand the micro
mechanism that drives and generates the macro phenomenons (i.e. cascading
proceese) is essential. Here we introduce behavioral dynamics as the micro
mechanism to describe the dynamic process of a node's neighbors get infected by
a cascade after this node get infected (i.e. one-hop subcascades). Through
data-driven analysis, we find out the common principles and patterns lying in
behavioral dynamics and propose a novel Networked Weibull Regression model for
behavioral dynamics modeling. After that we propose a novel method for
predicting cascading processes by effectively aggregating behavioral dynamics,
and propose a scalable solution to approximate the cascading process with a
theoretical guarantee. We extensively evaluate the proposed method on a large
scale social network dataset. The results demonstrate that the proposed method
can significantly outperform other state-of-the-art baselines in multiple tasks
including cascade size prediction, outbreak time prediction and cascading
process prediction.
","[{'version': 'v1', 'created': 'Wed, 27 May 2015 05:30:33 GMT'}]",2015-05-28,"[['Yu', 'Linyun', ''], ['Cui', 'Peng', ''], ['Wang', 'Fei', ''], ['Song', 'Chaoming', ''], ['Yang', 'Shiqiang', '']]","['Information Cascades', 'Social Network', 'Dynamic ProcessesPrediction']"
16097,1501.04036,Soonhak Kwon,Namhun Koo and Gook Hwa Cho and Byeonghwan and Soonhak Kwon,An Improvement of the Cipolla-Lehmer Type Algorithms,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let F_q be a finite field with q elements with prime power q and let r>1 be
an integer with $q\equiv 1 \pmod{r}$. In this paper, we present a refinement of
the Cipolla-Lehmer type algorithm given by H. C. Williams, and subsequently
improved by K. S. Williams and K. Hardy. For a given r-th power residue c in
F_q where r is an odd prime, the algorithm of H. C. Williams determines a
solution of X^r=c in $O(r^3\log q)$ multiplications in F_q, and the algorithm
of K. S. Williams and K. Hardy finds a solution in $O(r^4+r^2\log q)$
multiplications in F_q. Our refinement finds a solution in $O(r^3+r^2\log q)$
multiplications in F_q. Therefore our new method is better than the previously
proposed algorithms independent of the size of r, and the implementation result
via SAGE shows a substantial speed-up compared with the existing algorithms.
","[{'version': 'v1', 'created': 'Fri, 16 Jan 2015 16:40:12 GMT'}]",2015-01-19,"[['Koo', 'Namhun', ''], ['Cho', 'Gook Hwa', ''], ['Byeonghwan', '', ''], ['Kwon', 'Soonhak', '']]","['finite field', 'r-th root', 'Cipolla-Lehmer algorithm', 'Adleman-Manders-Milleralgorithm', 'primitive root']"
16098,1205.2476,Benoit Otjacques,"Beno\^it Otjacques, Micka\""el Stefas, Ma\""el Cornil, Fernand Feltz",Open Data Visualization: Keeping Traces of the Exploration Process,"Presented at the First International Workshop On Open Data, WOD-2012
  (http://arxiv.org/abs/1204.3726)",,,WOD/2012/NANTES/1,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a system to support the visual exploration of Open Data.
During his/her interactive experience with the graphics, the user can easily
store the current complete state of the visualization application (called a
viewpoint). Next, he/she can compose sequences of these viewpoints (called
scenarios) that can easily be reloaded. This feature allows to keep traces of a
former exploration process, which can be useful in single user (to support
investigation carried out in multiple sessions) as well as in collaborative
setting (to share points of interest identified in the data set).
","[{'version': 'v1', 'created': 'Fri, 11 May 2012 10:46:50 GMT'}]",2012-05-14,"[['Otjacques', 'Benoît', ''], ['Stefas', 'Mickaël', ''], ['Cornil', 'Maël', ''], ['Feltz', 'Fernand', '']]","['Open Data', 'Information Visualization', 'Data Exploration Process', 'Data Exploration History']"
16099,1506.03214,Vincent Lemaire,"Patrick Luciano, Ismail Rebai, Vincent Lemaire","Increasing loyalty using predictive modeling in Business-to-Business
  Telecommunication",,,,,cs.OH cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Customer Relationship Management (CRM) is a key element of modern marketing
strategies. One of the most practical way to build useful knowledge on
customers in a CRM system to produce scores to forecast churn behavior,
propensity to subscribe to a new service... In AMEA zone (Asia, Middle East and
Africa zone), the context of fierce competition may represent a higher
percentage, and particularly in B2B market. But by contrast, to our knowledge,
no scientific papers were dedicated and published to detail the way to improve
loyalty in B2B Telco market. If we can assume at low segments similarities
between B2B and B2C, some research is required in order to model B2B user
behavior versus B2C behavior. This problematic stands actual as ""Bring Your own
Device"" (BYOD) becomes more and more trendy. Answering business requirements,
our team applied some B2C predictive tools with adapting them to B2B in an AMEA
country Orange affiliate.
","[{'version': 'v1', 'created': 'Wed, 10 Jun 2015 08:41:41 GMT'}]",2015-06-11,"[['Luciano', 'Patrick', ''], ['Rebai', 'Ismail', ''], ['Lemaire', 'Vincent', '']]","['value management', 'predictive modeling', 'loyalty', 'CRM', 'marketing', 'B2B', 'Telco']"
16100,1107.4967,Domenico Corapi Domenico Corapi,"Domenico Corapi, Alessandra Russo, Marina De Vos, Julian Padget, Ken
  Satoh",Normative design using inductive learning,"Theory and Practice of Logic Programming, 27th Int'l. Conference on
  Logic Programming (ICLP'11) Special Issue, volume 11, issue 4-5, 2011",,,,cs.LO cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a use-case-driven iterative design methodology for
normative frameworks, also called virtual institutions, which are used to
govern open systems. Our computational model represents the normative framework
as a logic program under answer set semantics (ASP). By means of an inductive
logic programming approach, implemented using ASP, it is possible to synthesise
new rules and revise the existing ones. The learning mechanism is guided by the
designer who describes the desired properties of the framework through use
cases, comprising (i) event traces that capture possible scenarios, and (ii) a
state that describes the desired outcome. The learning process then proposes
additional rules, or changes to current rules, to satisfy the constraints
expressed in the use cases. Thus, the contribution of this paper is a process
for the elaboration and revision of a normative framework by means of a
semi-automatic and iterative process driven from specifications of
(un)desirable behaviour. The process integrates a novel and general methodology
for theory revision based on ASP.
","[{'version': 'v1', 'created': 'Mon, 25 Jul 2011 15:01:50 GMT'}]",2011-07-26,"[['Corapi', 'Domenico', ''], ['Russo', 'Alessandra', ''], ['De Vos', 'Marina', ''], ['Padget', 'Julian', ''], ['Satoh', 'Ken', '']]","['normative frameworks', 'inductive logic programming', 'theory revision']"
16101,1203.1778,Md. Hasnat Kabir Dr,"Md. Emdadul Haque, Md. Golam Rashed and M. Hasnat Kabir","A Comprehensive Study and Performance Comparison of M-ary Modulation
  Schemes for an Efficient Wireless Mobile Communication System","International Journal of Computer Science, Engineering and
  Applications (IJCSEA) Vol.1, No.3, June 2011",,,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless communications has become one of the fastest growing areas in our
modern life and creates enormous impact on nearly every feature of our daily
life. In this paper, the performance of M-ary modulations schemes (MPSK, MQAM,
MFSK) based wireless communication system on audio signal transmission over
Additive Gaussian Noise (AWGN) channel are analyzed in terms of bit error
probability as a function of SNR. Based on the results obtained in the present
study, MPSK and MQAM are showing better performance for lower modulation order
whereas these are inferior with higher M. The BER value is smaller in MFSK for
higher M, but it is worse due to the distortion in the reproduce signal at the
receiver end. The lossless reproduction of recorded voice signal can be
achieved at the receiver end with a lower modulation order.
","[{'version': 'v1', 'created': 'Thu, 8 Mar 2012 12:51:47 GMT'}]",2012-03-09,"[['Haque', 'Md. Emdadul', ''], ['Rashed', 'Md. Golam', ''], ['Kabir', 'M. Hasnat', '']]","['Communication system', 'Digital modulation', 'M-ary', 'Bit error rate', 'Error probability']"
16102,1410.2889,Omar Rafique,Omar Rafique,"Area Versus Speed Trade-off Analysis of a WiMAX Deinterleaver Circuit
  Design","four pages, two figures and six tables",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Trade-off is one of the main design parameters in the field of electronic
circuit design. Whereas smaller electronics devices which use less hardware due
to techniques like hardware multiplexing or due to smaller devices created due
to techniques developed by nanotechnology and MEMS, are more appealing, a
trade-off between area, power and speed is inevitable. This paper analyses the
trade-off in the design of WiMAX deinterleaver. The main aim is to reduce the
hardware utilization in a deinterleaver but speed and power consumption are
important parameters which cannot be overlooked.
","[{'version': 'v1', 'created': 'Fri, 10 Oct 2014 06:14:09 GMT'}]",2014-10-14,"[['Rafique', 'Omar', '']]","['WiMAX', 'optimisation', 'trade-off']"
16103,1205.6910,Abderrahim Bourouis,"Abderrahim Bourouis, Mohamed Feham, Abdelhamid Bouchachia","A New Architecture of a Ubiquitous Health Monitoring System: A Prototype
  Of Cloud Mobile Health Monitoring System",,,,,cs.NI cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless Body Area Sensor Networks (WBASN) is an emerging technology which
uses wireless sensors to implement real-time wearable health monitoring of
patients to enhance independent living. In this paper we propose a prototype of
cloud mobile health monitoring system. The system uses WBASN and Smartphone
application that uses cloud computing, location data and a neural network to
determine the state of patients.
","[{'version': 'v1', 'created': 'Thu, 31 May 2012 08:22:19 GMT'}]",2012-06-01,"[['Bourouis', 'Abderrahim', ''], ['Feham', 'Mohamed', ''], ['Bouchachia', 'Abdelhamid', '']]","['Mobile Cloud Computing', 'Mobile Health Monitoring', 'WBASN', 'Smartphone', 'Android', 'Python']"
16104,1607.03284,Lyes Abada Dr.,"Lyes Abada, Saliha Aouat",A Machine learning approach for Shape From Shading,"2nd International Conference on Signal, Image, Vision and their
  Applications (SIVA'13), November 18-20, 2013 - Guelma, Algeria",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of Shape From Shading (SFS) problem is to reconstruct the relief of
an object from a single gray level image. In this paper we present a new method
to solve the problem of SFS using Machine learning method. Our approach belongs
to Local resolution category. The orientation of each part of the object is
represented by the perpendicular vector to the surface (Normal Vector), this
vector is defined by two angles SLANT and TILT, such as the TILT is the angle
between the normal vector and Z-axis, and the SLANT is the angle between the
the X-axis and the projection of the normal to the plane. The TILT can be
determined from the gray level, the unknown is the SLANT. To calculate the
normal of each part of the surface (pixel) a supervised Machine learning method
has been proposed. This method divided into three steps: the first step is the
preparation of the training data from 3D mathematical functions and synthetic
objects. The second step is the creation of database of examples from 3D
objects (off-line process). The third step is the application of test images
(on-line process). The idea is to find for each pixel of the test image the
most similar element in the examples database using a similarity value.
","[{'version': 'v1', 'created': 'Tue, 12 Jul 2016 09:37:00 GMT'}]",2016-07-13,"[['Abada', 'Lyes', ''], ['Aouat', 'Saliha', '']]","['Integration method', 'Machine learning', 'Needle map', 'Shape From Shading']"
16105,1705.09144,Thommen George Karimpanal,"Anand Vaz, Thommen G K","Modeling and Simulation of the Dynamics of the Quick Return Mechanism: A
  Bond Graph Approach","Document prepared for National Conference on Industrial Problems on
  Machines and Mechanisms (2010), 8 pages, 19 Figures","Proceedings of 10th National Conference on Industrial Problems on
  Machines and Mechanisms (IPRoMM 2010), MNIT, Jaipur, Rajasthan, December
  17-18,2010, paper No. IPRoMM 2010-34, p. 23-30",,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper applies the multibond graph approach for rigid multibody systems
to model the dynamics of general spatial mechanisms. The commonly used quick
return mechanism which comprises of revolute as well as prismatic joints has
been chosen as a representative example to demonstrate the application of this
technique and its resulting advantages. In this work, the links of the quick
return mechanism are modeled as rigid bodies. The rigid links are then coupled
at the joints based on the nature of constraint. This alternative method of
formulation of system dynamics, using Bond Graphs, offers a rich set of
features that include pictorial representation of the dynamics of translation
and rotation for each link of the mechanism in the inertial frame,
representation and handling of constraints at the joints, depiction of
causality, obtaining dynamic reaction forces and moments at various locations
in the mechanism and so on. Yet another advantage of this approach is that the
coding for simulation can be carried out directly from the Bond Graph in an
algorithmic manner, without deriving system equations. In this work, the
program code for simulation is written in MATLAB. The vector and tensor
operations are conveniently represented in MATLAB, resulting in a compact and
optimized code. The simulation results are plotted and discussed in detail.
","[{'version': 'v1', 'created': 'Mon, 22 May 2017 21:37:25 GMT'}]",2017-05-26,"[['Vaz', 'Anand', ''], ['K', 'Thommen G', '']]","['Bond Graph', 'Modeling', 'Simulation', 'Quick return mechanism']"
16106,1005.2001,Elias Tsigaridas,"Ioannis Z. Emiris (DI), Andr\'e Galligo (JAD), Elias Tsigaridas (DI)","Random polynomials and expected complexity of bisection methods for real
  solving",,"International Symposium on Symbolic and Algebraic Computation
  (ISSAC), Munich : Germany (2010)",,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our probabilistic analysis sheds light to the following questions: Why do
random polynomials seem to have few, and well separated real roots, on the
average? Why do exact algorithms for real root isolation may perform
comparatively well or even better than numerical ones? We exploit results by
Kac, and by Edelman and Kostlan in order to estimate the real root separation
of degree $d$ polynomials with i.i.d.\ coefficients that follow two zero-mean
normal distributions: for SO(2) polynomials, the $i$-th coefficient has
variance ${d \choose i}$, whereas for Weyl polynomials its variance is
${1/i!}$. By applying results from statistical physics, we obtain the expected
(bit) complexity of \func{sturm} solver, $\sOB(r d^2 \tau)$, where $r$ is the
number of real roots and $\tau$ the maximum coefficient bitsize. Our bounds are
two orders of magnitude tighter than the record worst case ones. We also derive
an output-sensitive bound in the worst case. The second part of the paper shows
that the expected number of real roots of a degree $d$ polynomial in the
Bernstein basis is $\sqrt{2d}\pm\OO(1)$, when the coefficients are i.i.d.\
variables with moderate standard deviation. Our paper concludes with
experimental results which corroborate our analysis.
","[{'version': 'v1', 'created': 'Wed, 12 May 2010 06:52:48 GMT'}, {'version': 'v2', 'created': 'Mon, 31 May 2010 07:58:01 GMT'}]",2010-06-01,"[['Emiris', 'Ioannis Z.', '', 'DI'], ['Galligo', 'André', '', 'JAD'], ['Tsigaridas', 'Elias', '', 'DI']]","['Random polynomial', 'real-root isolation', 'Bernstein polynomial', 'expected complexity', 'separation bound']"
16107,0712.3980,Vincent Gramoli,"Antonio Fernandez (LADyR), Vincent Gramoli (INRIA Futurs, IRISA),
  Ernesto Jimenez (EUI), Anne-Marie Kermarrec (IRISA), Michel Raynal (IRISA)",Distributed Slicing in Dynamic Systems,,"Dans The 27th International Conference on Distributed Computing
  Systems (ICDCS'07) (2007) 66",,ICDCS07,cs.DC,,"  Peer to peer (P2P) systems are moving from application specific architectures
to a generic service oriented design philosophy. This raises interesting
problems in connection with providing useful P2P middleware services capable of
dealing with resource assignment and management in a large-scale, heterogeneous
and unreliable environment. The slicing service, has been proposed to allow for
an automatic partitioning of P2P networks into groups (slices) that represent a
controllable amount of some resource and that are also relatively homogeneous
with respect to that resource. In this paper we propose two gossip-based
algorithms to solve the distributed slicing problem. The first algorithm speeds
up an existing algorithm sorting a set of uniform random numbers. The second
algorithm statistically approximates the rank of nodes in the ordering. The
scalability, efficiency and resilience to dynamics of both algorithms rely on
their gossip-based models. These algorithms are proved viable theoretically and
experimentally.
","[{'version': 'v1', 'created': 'Wed, 26 Dec 2007 13:55:47 GMT'}]",2007-12-27,"[['Fernandez', 'Antonio', '', 'LADyR'], ['Gramoli', 'Vincent', '', 'INRIA Futurs, IRISA'], ['Jimenez', 'Ernesto', '', 'EUI'], ['Kermarrec', 'Anne-Marie', '', 'IRISA'], ['Raynal', 'Michel', '', 'IRISA']]","['Slice', 'Gossip', 'Churn', 'Peer-to-Peer', 'Aggregation', 'Large Scale']"
16108,1705.09482,Guy Louchard,Guy Louchard,"A refined and asymptotic analysis of optimal stopping problems of Bruss
  and Weber","22 pages, 19 figures",,,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The classical secretary problem has been generalized over the years into
several directions. In this paper we confine our interest to those
generalizations which have to do with the more general problem of stopping on a
last observation of a specific kind. We follow Dendievel, (where a bibliography
can be found) who studies several types of such problems, mainly initiated by
Bruss and Weber. Whether in discrete time or continuous time, whether all
parameters are known or must be sequentially estimated, we shall call such
problems simply ""Bruss-Weber problems"". Our contribution in the present paper
is a refined analysis of several problems in this class and a study of the
asymptotic behaviour of solutions.
  The problems we consider center around the following model. Let
$X_1,X_2,\ldots,X_n$ be a sequence of independent random variables which can
take three values: $\{+1,-1,0\}.$ Let $p:=\P(X_i=1), p':=\P(X_i=-1),
\qt:=\P(X_i=0), p\geq p'$, where $p+p'+\qt=1$. The goal is to maximize the
probability of stopping on a value $+1$ or $-1$ appearing for the last time in
the sequence. Following a suggestion by Bruss, we have also analyzed an
x-strategy with incomplete information: the cases $p$ known, $n$ unknown, then
$n$ known, $p$ unknown and finally $n,p$ unknown are considered. We also
present simulations of the corresponding complete selection algorithm.
","[{'version': 'v1', 'created': 'Fri, 26 May 2017 08:58:29 GMT'}]",2017-05-29,"[['Louchard', 'Guy', '']]","['Stopping times', 'Unified Approach to best choice', 'Odds-algorithm', 'Optimal solutions', 'x-Strategy', 'Asymptotic expansions', 'Incomplete information']"
16109,1412.4967,Anthony Knittel,"Anthony Knittel, Alan Blair","Sparse, guided feature connections in an Abstract Deep Network",,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a technique for developing a network of re-used features, where
the topology is formed using a coarse learning method, that allows
gradient-descent fine tuning, known as an Abstract Deep Network (ADN). New
features are built based on observed co-occurrences, and the network is
maintained using a selection process related to evolutionary algorithms. This
allows coarse ex- ploration of the problem space, effective for irregular
domains, while gradient descent allows pre- cise solutions. Accuracy on
standard UCI and Protein-Structure Prediction problems is comparable with
benchmark SVM and optimized GBML approaches, and shows scalability for
addressing large problems. The discrete implementation is symbolic, allowing
interpretability, while the continuous method using fine-tuning shows improved
accuracy. The binary multiplexer problem is explored, as an irregular domain
that does not support gradient descent learning, showing solution to the bench-
mark 135-bit problem. A convolutional implementation is demonstrated on image
classification, showing an error-rate of 0.79% on the MNIST problem, without a
pre-defined topology. The ADN system provides a method for developing a very
sparse, deep feature topology, based on observed relationships between
features, that is able to find solutions in irregular domains, and initialize a
network prior to gradient descent learning.
","[{'version': 'v1', 'created': 'Tue, 16 Dec 2014 12:04:35 GMT'}]",2014-12-17,"[['Knittel', 'Anthony', ''], ['Blair', 'Alan', '']]","['learning classifier systems', 'deep learning', 'evolutionary algorithms', 'neural networks']"
16110,1610.01955,Krzysztof Szczypiorski,Krzysztof Szczypiorski and Tomasz Tyl,MoveSteg: A Method of Network Steganography Detection,"7 pages, 7 figures, 3 tables",,,,cs.MM cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents a new method for detecting a source point of time based
network steganography - MoveSteg. A steganography carrier could be an example
of multimedia stream made with packets. These packets are then delayed
intentionally to send hidden information using time based steganography
methods. The presented analysis describes a method that allows finding the
source of steganography stream in network that is under our management.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2016 17:12:37 GMT'}]",2016-10-07,"[['Szczypiorski', 'Krzysztof', ''], ['Tyl', 'Tomasz', '']]","['network steganography', 'information', 'hiding']"
16111,1003.3613,Loet Leydesdorff,Loet Leydesdorff and Ismael Rafols,"Indicators of the Interdisciplinarity of Journals: Diversity,
  Centrality, and Citations",,,,,cs.DL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A citation-based indicator for interdisciplinarity has been missing hitherto
among the set of available journal indicators. In this study, we investigate
network indicators (betweenness centrality), journal indicators (Shannon
entropy, the Gini coefficient), and more recently proposed Rao-Stirling
measures for ""interdisciplinarity."" The latter index combines the statistics of
both citation distributions of journals (vector-based) and distances in
citation networks among journals (matrix-based). The effects of various
normalizations are specified and measured using the matrix of 8,207 journals
contained in the Journal Citation Reports of the (Social) Science Citation
Index 2008. Betweenness centrality in symmetrical (1-mode) cosine-normalized
networks provides an indicator outperforming betweenness in the asymmetrical
(2-mode) citation network. Among the vector-based indicators, Shannon entropy
performs better than the Gini coefficient, but is sensitive to size. Science
and Nature, for example, are indicated at the top of the list. The new
diversity measure provides reasonable results when (1 - cosine) is assumed as a
measure for the distance, but results using Euclidean distances were difficult
to interpret.
","[{'version': 'v1', 'created': 'Thu, 18 Mar 2010 15:52:27 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Sep 2010 14:34:43 GMT'}]",2010-09-22,"[['Leydesdorff', 'Loet', ''], ['Rafols', 'Ismael', '']]","['journal', 'citation', 'diversity', 'interdisciplinarity', 'entropy', 'centrality', 'Gini']"
16112,1410.5089,Matt Lewis,Cristina David and Daniel Kroening and Matt Lewis,"Unrestricted Termination and Non-Termination Arguments for Bit-Vector
  Programs",,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Proving program termination is typically done by finding a well-founded
ranking function for the program states. Existing termination provers typically
find ranking functions using either linear algebra or templates. As such they
are often restricted to finding linear ranking functions over mathematical
integers. This class of functions is insufficient for proving termination of
many terminating programs, and furthermore a termination argument for a program
operating on mathematical integers does not always lead to a termination
argument for the same program operating on fixed-width machine integers. We
propose a termination analysis able to generate nonlinear, lexicographic
ranking functions and nonlinear recurrence sets that are correct for
fixed-width machine arithmetic and floating-point arithmetic Our technique is
based on a reduction from program \emph{termination} to second-order
\emph{satisfaction}. We provide formulations for termination and
non-termination in a fragment of second-order logic with restricted
quantification which is decidable over finite domains. The resulted technique
is a sound and complete analysis for the termination of finite-state programs
with fixed-width integers and IEEE floating-point arithmetic.
","[{'version': 'v1', 'created': 'Sun, 19 Oct 2014 16:39:26 GMT'}]",2014-10-21,"[['David', 'Cristina', ''], ['Kroening', 'Daniel', ''], ['Lewis', 'Matt', '']]","['Termination', 'Non-Termination', 'Lexicographic Ranking Functions', 'Bit-vector Ranking Functions', 'Floating-Point Ranking Functions']"
16113,1107.1081,Gururaj Mukarambi,"B.V. Dhandra, Mallikarjun Hangarge and Gururaj Mukarambi","Spatial Features for Multi-Font/Multi-Size Kannada Numerals and Vowels
  Recognition","4 pages, 4 Figures, 4 Tables, ""International Conference on
  Communication, Computation, Control and Nanotechnology (2010)""",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents multi-font/multi-size Kannada numerals and vowels
recognition based on spatial features. Directional spatial features viz stroke
density, stroke length and the number of stokes in an image are employed as
potential features to characterize the printed Kannada numerals and vowels.
Based on these features 1100 numerals and 1400 vowels are classified with
Multi-class Support Vector Machines (SVM). The proposed system achieves the
recognition accuracy as 98.45% and 90.64% for numerals and vowels respectively.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2011 10:02:42 GMT'}]",2011-07-07,"[['Dhandra', 'B. V.', ''], ['Hangarge', 'Mallikarjun', ''], ['Mukarambi', 'Gururaj', '']]","['Spatial Features', 'OCR', 'SVM']"
16114,1609.05610,Michal Ferov,Michal Ferov and Marek Modr\'y,Enhancing LambdaMART Using Oblivious Trees,Accepted for publication in proceedings of RUSSIR 2016,,,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning to rank is a machine learning technique broadly used in many areas
such as document retrieval, collaborative filtering or question answering. We
present experimental results which suggest that the performance of the current
state-of-the-art learning to rank algorithm LambdaMART, when used for document
retrieval for search engines, can be improved if standard regression trees are
replaced by oblivious trees. This paper provides a comparison of both variants
and our results demonstrate that the use of oblivious trees can improve the
performance by more than $2.2\%$. Additional experimental analysis of the
influence of a number of features and of a size of the training set is also
provided and confirms the desirability of properties of oblivious decision
trees.
","[{'version': 'v1', 'created': 'Mon, 19 Sep 2016 07:03:29 GMT'}]",2016-09-20,"[['Ferov', 'Michal', ''], ['Modrý', 'Marek', '']]","['Document Retrieval for Search Engines', 'LambdaMART', 'Learning to Rank', 'Oblivious Decision Trees']"
16115,1510.01628,Panagiotis Traganitis,"Panagiotis A. Traganitis, Konstantinos Slavakis, Georgios B. Giannakis",Large-scale subspace clustering using sketching and validation,,,,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The nowadays massive amounts of generated and communicated data present major
challenges in their processing. While capable of successfully classifying
nonlinearly separable objects in various settings, subspace clustering (SC)
methods incur prohibitively high computational complexity when processing
large-scale data. Inspired by the random sampling and consensus (RANSAC)
approach to robust regression, the present paper introduces a randomized scheme
for SC, termed sketching and validation (SkeVa-)SC, tailored for large-scale
data. At the heart of SkeVa-SC lies a randomized scheme for approximating the
underlying probability density function of the observed data by kernel
smoothing arguments. Sparsity in data representations is also exploited to
reduce the computational burden of SC, while achieving high clustering
accuracy. Performance analysis as well as extensive numerical tests on
synthetic and real data corroborate the potential of SkeVa-SC and its
competitive performance relative to state-of-the-art scalable SC approaches.
Keywords: Subspace clustering, big data, kernel smoothing, randomization,
sketching, validation, sparsity.
","[{'version': 'v1', 'created': 'Tue, 6 Oct 2015 15:34:32 GMT'}]",2015-10-07,"[['Traganitis', 'Panagiotis A.', ''], ['Slavakis', 'Konstantinos', ''], ['Giannakis', 'Georgios B.', '']]","['Subspace clustering', 'big data', 'kernel smoothing', 'randomization', 'sketching', 'validation', 'sparsity']"
16116,1702.04274,Cl\'audio Gomes,"Cl\'audio Gomes, Yentl Van Tendeloo, Joachim Denil, Paul De
  Meulenaere, Hans Vangheluwe",Hybrid System Modelling and Simulation with Dirac Deltas,,,,,cs.NA cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For a wide variety of problems, creating detailed continuous models of
(continuous) physical systems is, at the very least, impractical. Hybrid models
can abstract away short transient behaviour (thus introducing discontinuities)
in order to simplify the study of such systems. For example, when modelling a
bouncing ball, the bounce can be abstracted as a discontinuous change of the
velocity, instead of resorting to the physics of the ball (de-)compression to
keep the velocity signal continuous. Impulsive differential equations can be
used to model and simulate hybrid systems such as the bouncing ball. In this
approach, the force acted on the ball by the floor is abstracted as an
infinitely large function in an infinitely small interval of time, that is, an
impulse. Current simulators cannot handle such approximations well due to the
limitations of machine precision.
  In this paper, we explore the simulation of impulsive differential equations,
where impulses are first class citizens. We present two approaches for the
simulation of impulses: symbolic and numerical. Our contribution is a
theoretically founded description of the implementation of both approaches in a
Causal Block Diagram modelling and simulation tool. Furthermore, we investigate
the conditions for which one approach is better than the other.
","[{'version': 'v1', 'created': 'Tue, 14 Feb 2017 16:04:20 GMT'}]",2017-02-15,"[['Gomes', 'Cláudio', ''], ['Van Tendeloo', 'Yentl', ''], ['Denil', 'Joachim', ''], ['De Meulenaere', 'Paul', ''], ['Vangheluwe', 'Hans', '']]","['Dirac delta', 'hybrid system', 'distribution theory', 'causal blockdiagrams']"
16117,1802.09734,Zongtao Liu,"Yang Yang, Zongtao Liu, Chenhao Tan, Fei Wu, Yueting Zhuang and Yafeng
  Li","To Stay or to Leave: Churn Prediction for Urban Migrants in the Initial
  Period",,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In China, 260 million people migrate to cities to realize their urban dreams.
Despite that these migrants play an important role in the rapid urbanization
process, many of them fail to settle down and eventually leave the city. The
integration process of migrants thus raises an important issue for scholars and
policymakers.
  In this paper, we use Shanghai as an example to investigate migrants'
behavior in their first weeks and in particular, how their behavior relates to
early departure. Our dataset consists of a one-month complete dataset of 698
telecommunication logs between 54 million users, plus a novel and publicly
available housing price data for 18K real estates in Shanghai. We find that
migrants who end up leaving early tend to neither develop diverse connections
in their first weeks nor move around the city. Their active areas also have
higher housing prices than that of staying migrants. We formulate a churn
prediction problem to determine whether a migrant is going to leave based on
her behavior in the first few days. The prediction performance improves as we
include data from more days. Interestingly, when using the same features, the
classifier trained from only the first few days is already as good as the
classifier trained using full data, suggesting that the performance difference
mainly lies in the difference between features.
","[{'version': 'v1', 'created': 'Tue, 27 Feb 2018 06:18:14 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Mar 2018 03:52:16 GMT'}]",2018-03-20,"[['Yang', 'Yang', ''], ['Liu', 'Zongtao', ''], ['Tan', 'Chenhao', ''], ['Wu', 'Fei', ''], ['Zhuang', 'Yueting', ''], ['Li', 'Yafeng', '']]","['urban migrants', 'migrant integration', 'churn prediction']"
16118,1705.06871,Shirui Li,"You Hao, Shirui Li, Hanlin Mo, and Hua Li","Affine-Gradient Based Local Binary Pattern Descriptor for Texture
  Classiffication","11 pages,4 pages",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a novel Affine-Gradient based Local Binary Pattern (AGLBP)
descriptor for texture classification. It is very hard to describe complicated
texture using single type information, such as Local Binary Pattern (LBP),
which just utilizes the sign information of the difference between the pixel
and its local neighbors. Our descriptor has three characteristics: 1) In order
to make full use of the information contained in the texture, the
Affine-Gradient, which is different from Euclidean-Gradient and invariant to
affine transformation is incorporated into AGLBP. 2) An improved method is
proposed for rotation invariance, which depends on the reference direction
calculating respect to local neighbors. 3) Feature selection method,
considering both the statistical frequency and the intraclass variance of the
training dataset, is also applied to reduce the dimensionality of descriptors.
Experiments on three standard texture datasets, Outex12, Outex10 and KTH-TIPS2,
are conducted to evaluate the performance of AGLBP. The results show that our
proposed descriptor gets better performance comparing to some state-of-the-art
rotation texture descriptors in texture classification.
","[{'version': 'v1', 'created': 'Fri, 19 May 2017 06:41:31 GMT'}]",2017-05-22,"[['Hao', 'You', ''], ['Li', 'Shirui', ''], ['Mo', 'Hanlin', ''], ['Li', 'Hua', '']]","['AGLBP', 'Affine-Gradient', 'texture descriptor', 'feature selection', 'invariant']"
16119,0907.4957,Maurice Margenstern,Maurice Margenstern,Iterative pushdown automata and hyperbolic contour words,"15 pages, 6 figures",,,,cs.CG cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we give an application of iterated pushdown automata to
contour words of balls and two other domains in infinitely many tilings of the
hyperbolic plane. We also give a similar application for the tiling {5,3,4} of
the hyperbolic 3D space and for the tiling {5,3,3,4} of the hyperbolic 4D space
as well.
","[{'version': 'v1', 'created': 'Tue, 28 Jul 2009 17:16:45 GMT'}]",2009-07-29,"[['Margenstern', 'Maurice', '']]","['pushdown automata', 'iterated pushdown automata', 'tilings', 'hyperbolic plane', 'tessellationsACM-class F.2.2', 'F.4.1', 'I.3']"
16120,1606.07852,Jing Pu,"Jing Pu, Sameh Galal, Xuan Yang, Ofer Shacham, Mark Horowitz","FPMax: a 106GFLOPS/W at 217GFLOPS/mm2 Single-Precision FPU, and a
  43.7GFLOPS/W at 74.6GFLOPS/mm2 Double-Precision FPU, in 28nm UTBB FDSOI",,,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  FPMax implements four FPUs optimized for latency or throughput workloads in
two precisions, fabricated in 28nm UTBB FDSOI. Each unit's parameters, e.g
pipeline stages, booth encoding etc., were optimized to yield 1.42ns latency at
110GLOPS/W (SP) and 1.39ns latency at 36GFLOPS/W (DP). At 100% activity,
body-bias control improves the energy efficiency by about 20%; at 10% activity
this saving is almost 2x.
  Keywords: FPU, energy efficiency, hardware generator, SOI
","[{'version': 'v1', 'created': 'Fri, 24 Jun 2016 23:20:50 GMT'}]",2016-06-28,"[['Pu', 'Jing', ''], ['Galal', 'Sameh', ''], ['Yang', 'Xuan', ''], ['Shacham', 'Ofer', ''], ['Horowitz', 'Mark', '']]","['FPU', 'energy efficiency', 'hardware generator', 'SOI']"
16121,1306.1154,Anru Zhang,T. Tony Cai and Anru Zhang,"Sparse Representation of a Polytope and Recovery of Sparse Signals and
  Low-rank Matrices",to appear in IEEE Transactions on Information Theory,,,,cs.IT math.IT math.ST stat.ML stat.TH,http://creativecommons.org/licenses/by/3.0/,"  This paper considers compressed sensing and affine rank minimization in both
noiseless and noisy cases and establishes sharp restricted isometry conditions
for sparse signal and low-rank matrix recovery. The analysis relies on a key
technical tool which represents points in a polytope by convex combinations of
sparse vectors. The technique is elementary while leads to sharp results.
  It is shown that for any given constant $t\ge {4/3}$, in compressed sensing
$\delta_{tk}^A < \sqrt{(t-1)/t}$ guarantees the exact recovery of all $k$
sparse signals in the noiseless case through the constrained $\ell_1$
minimization, and similarly in affine rank minimization
$\delta_{tr}^\mathcal{M}< \sqrt{(t-1)/t}$ ensures the exact reconstruction of
all matrices with rank at most $r$ in the noiseless case via the constrained
nuclear norm minimization. Moreover, for any $\epsilon>0$,
$\delta_{tk}^A<\sqrt{\frac{t-1}{t}}+\epsilon$ is not sufficient to guarantee
the exact recovery of all $k$-sparse signals for large $k$. Similar result also
holds for matrix recovery. In addition, the conditions $\delta_{tk}^A <
\sqrt{(t-1)/t}$ and $\delta_{tr}^\mathcal{M}< \sqrt{(t-1)/t}$ are also shown to
be sufficient respectively for stable recovery of approximately sparse signals
and low-rank matrices in the noisy case.
","[{'version': 'v1', 'created': 'Wed, 5 Jun 2013 15:50:28 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Oct 2013 03:45:04 GMT'}]",2013-10-23,"[['Cai', 'T. Tony', ''], ['Zhang', 'Anru', '']]","['Affine rank minimization', 'compressed sensing', 'constrained ℓ1 minimization', 'low']"
16122,1407.2511,Adrian Kosowski,"Dariusz Dereniowski, Adrian Kosowski (INRIA Paris-Rocquencourt,
  LIAFA), Dominik Pajak",Distinguishing Views in Symmetric Networks: A Tight Lower Bound,,,,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The view of a node in a port-labeled network is an infinite tree encoding all
walks in the network originating from this node. We prove that for any integers
$n\geq D\geq 1$, there exists a port-labeled network with at most $n$ nodes and
diameter at most $D$ which contains a pair of nodes whose (infinite) views are
different, but whose views truncated to depth $\Omega(D\log (n/D))$ are
identical.
","[{'version': 'v1', 'created': 'Fri, 16 May 2014 06:06:33 GMT'}, {'version': 'v2', 'created': 'Mon, 9 Mar 2015 09:54:27 GMT'}]",2015-03-10,"[['Dereniowski', 'Dariusz', '', 'INRIA Paris-Rocquencourt,\n  LIAFA'], ['Kosowski', 'Adrian', '', 'INRIA Paris-Rocquencourt,\n  LIAFA'], ['Pajak', 'Dominik', '']]","['anonymous network', 'port-labeled network', 'view', 'quotient graph']"
16123,1208.5571,Mohammad Doomun,"M. Razvi Doomun, KM Sunjiv Soyjaudah","Modified Temporal Key Integrity Protocol For Efficient Wireless Network
  Security","6 pages, International Conference on Security and Cryptography
  (SECRYPT) 2007",,,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Temporal Key Integrity Protocol (TKIP) is the IEEE TaskGroupi solution for
the security loop holes present in the already widely deployed 802.11 hardware.
It is a set of algorithms that wrap WEP to give the best possible solution
given design constraints such as paucity of the CPU cycles, hardwiring of the
WEP encryption algorithm and software upgrade dependent. Thus, TKIP is
significantly more difficult and challenging to implement and optimise than
WEP. The objective of this research is to examine the cost and benefit of TKIP
security mechanisms and optimise its implementation to reduce security overhead
for better performance. We propose a modified TKIP (MoTKIP) with improved
packet encapsulation and decapsulation procedure that reduces computation and
packet overhead in classic TKIP substantially and optimises total wireless
network throughput rates.
","[{'version': 'v1', 'created': 'Tue, 28 Aug 2012 07:13:04 GMT'}]",2012-08-29,"[['Doomun', 'M. Razvi', ''], ['Soyjaudah', 'KM Sunjiv', '']]","['TKIP', 'Wireless security', 'Key mixing', 'Security overhead']"
16124,1407.4088,Frederic Le Mouel,"Marie-Ange L\`ebre (CITI), Fr\'ed\'eric Le Mou\""el (CITI), Eric
  M\'enard, Julien Dillschneider, Richard Denis",VANET Applications: Hot Use Cases,,,,,cs.CY cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current challenges of car manufacturers are to make roads safe, to achieve
free flowing traffic with few congestions, and to reduce pollution by an
effective fuel use. To reach these goals, many improvements are performed
in-car, but more and more approaches rely on connected cars with communication
capabilities between cars, with an infrastructure, or with IoT devices.
Monitoring and coordinating vehicles allow then to compute intelligent ways of
transportation. Connected cars have introduced a new way of thinking cars - not
only as a mean for a driver to go from A to B, but as smart cars - a user
extension like the smartphone today. In this report, we introduce concepts and
specific vocabulary in order to classify current innovations or ideas on the
emerging topic of smart car. We present a graphical categorization showing this
evolution in function of the societal evolution. Different perspectives are
adopted: a vehicle-centric view, a vehicle-network view, and a user-centric
view; described by simple and complex use-cases and illustrated by a list of
emerging and current projects from the academic and industrial worlds. We
identified an empty space in innovation between the user and his car:
paradoxically even if they are both in interaction, they are separated through
different application uses. Future challenge is to interlace social concerns of
the user within an intelligent and efficient driving.
","[{'version': 'v1', 'created': 'Tue, 15 Jul 2014 18:37:39 GMT'}]",2014-07-16,"[['Lèbre', 'Marie-Ange', '', 'CITI'], ['Mouël', 'Frédéric Le', '', 'CITI'], ['Ménard', 'Eric', ''], ['Dillschneider', 'Julien', ''], ['Denis', 'Richard', '']]","['Smart Car', 'Vehicular Ad hoc Network (VANET)', 'Applications', 'Use Case', 'Innovation', 'Vehicle to Vehicle', 'Vehicle to Infrastructure']"
16125,0909.5293,Haris Aziz,"Haris Aziz, Oded Lachish, Mike Paterson and Rahul Savani",Wiretapping a hidden network,,,,,cs.GT cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of maximizing the probability of hitting a
strategically chosen hidden virtual network by placing a wiretap on a single
link of a communication network. This can be seen as a two-player win-lose
(zero-sum) game that we call the wiretap game. The value of this game is the
greatest probability that the wiretapper can secure for hitting the virtual
network. The value is shown to equal the reciprocal of the strength of the
underlying graph.
  We efficiently compute a unique partition of the edges of the graph, called
the prime-partition, and find the set of pure strategies of the hider that are
best responses against every maxmin strategy of the wiretapper. Using these
special pure strategies of the hider, which we call
omni-connected-spanning-subgraphs, we define a partial order on the elements of
the prime-partition. From the partial order, we obtain a linear number of
simple two-variable inequalities that define the maxmin-polytope, and a
characterization of its extreme points.
  Our definition of the partial order allows us to find all equilibrium
strategies of the wiretapper that minimize the number of pure best responses of
the hider. Among these strategies, we efficiently compute the unique strategy
that maximizes the least punishment that the hider incurs for playing a pure
strategy that is not a best response. Finally, we show that this unique
strategy is the nucleolus of the recently studied simple cooperative spanning
connectivity game.
","[{'version': 'v1', 'created': 'Tue, 29 Sep 2009 08:51:42 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Oct 2009 16:48:08 GMT'}]",2009-10-04,"[['Aziz', 'Haris', ''], ['Lachish', 'Oded', ''], ['Paterson', 'Mike', ''], ['Savani', 'Rahul', '']]","['cooperative game', 'network connectivity', 'network security', 'nucleolus', 'wiretapping', 'zero-sum game']"
16126,1108.2683,Hamid A. Toussi,Hamid A. Toussi and Ahmed Khademzadeh,"Improving bit-vector representation of points-to sets using class
  hierarchy",,"Proceeding of ICSCT 2010, Kunming, China, November 2010",,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Points-to analysis is the problem of approximating run-time values of
pointers statically or at compile-time. Points-to sets are used to store the
approximated values of pointers during points-to analysis. Memory usage and
running time limit the ability of points-to analysis to analyze large programs.
  To our knowledge, works which have implemented a bit-vector representation of
points-to sets so far, allocates bits for each pointer without considering
pointer's type. By considering the type, we are able to allocate bits only for
a subset of all abstract objects which are of compatible type with the
pointer's type and as a consequence improve the memory usage and running time.
To achieve this goal, we number abstract objects in a way that all the abstract
objects of a type and all of its sub-types be consecutive in order.
  Our most efficient implementation uses about 2.5 times less memory than
hybrid points-to set (default points-to set in Spark) and also improves the
analysis time for sufficiently large programs.
","[{'version': 'v1', 'created': 'Fri, 12 Aug 2011 18:24:16 GMT'}]",2015-03-19,"[['Toussi', 'Hamid A.', ''], ['Khademzadeh', 'Ahmed', '']]","['Programming Languages', 'Points-to analysis', 'Points-tosets', 'Data structures', 'Bit-vectors', 'Class hierarchy', 'Java']"
16127,1502.04801,Sonal Shrivastava,"Sonal Shrivastava, Chetan Agrawal and Anurag Jain",An IDS scheme against Black hole Attack to Secure AOMDV Routing in MANET,"14 pages,6 figures, International Journal on AdHoc Networking Systems
  (IJANS) Vol. 5, No. 1, January 2015. arXiv admin note: text overlap with
  arXiv:1203.3729 by other authors",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Mobile Ad hoc Network (MANET) all the nodes are freely moves in the
absence of without ant centralized coordination system. Due to that the
attackers or malicious nodes are easily affected that kind of network and
responsible for the routing misbehavior. The routing is network is mandatory to
deliver data in between source and destination. In this research we work on
security field in MANET and proposed a novel security scheme against routing
misbehavior through Black hole attack. The Ad hoc On demand Multipath Routing
(AOMDV) protocol is consider for routing and also to improves the routing
quality as compare to single path routing protocol. The attacker is affected
all the possible paths that is selected by sender for sending data in network.
The malicious nodes are forward optimistic reply at the time of routing by that
their identification is also a complex procedure. The proposed Intrusion
Detection System (IDS) scheme is identified the attacker information through
hop count mechanism. The routing information of actual data is reached to which
intermediate node and the next hop information is exist at that node is confirm
by IDS scheme. The black hole attacker node Identification (ID) is forward in
network by that in future attacker is not participating in routing procedure.
The proposed security scheme detects and provides the deterrence against
routing misbehavior through malicious attack. Here we compare the routing
performance of AOMDV, Attack and IDS scheme. The performance of normal
multipath routing and proposed IDS scheme is almost equal. The attacker has
degrades the whole routing performance but observed that in presence of
attacker, routing misbehavior is completely block by the proposed IDS scheme
and recovers 95 % of data as compare to normal routing. Keywords- -AOMDV,
MANET, IDS, Black hole attack, Routing misbehavior.
","[{'version': 'v1', 'created': 'Sat, 14 Feb 2015 14:35:36 GMT'}]",2015-02-18,"[['Shrivastava', 'Sonal', ''], ['Agrawal', 'Chetan', ''], ['Jain', 'Anurag', '']]","['AOMDV', 'MANET', 'IDS', 'Black hole attack', 'Routing misbehavior']"
16128,1407.1167,Stefano Leucci,"Davide Bil\`o and Luciano Gual\`a and Stefano Leucci and Guido
  Proietti","Specializations and Generalizations of the Stackelberg Minimum Spanning
  Tree Game","22 pages, 7 figures",,,,cs.GT cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let be given a graph $G=(V,E)$ whose edge set is partitioned into a set $R$
of \emph{red} edges and a set $B$ of \emph{blue} edges, and assume that red
edges are weighted and form a spanning tree of $G$. Then, the \emph{Stackelberg
Minimum Spanning Tree} (\stack) problem is that of pricing (i.e., weighting)
the blue edges in such a way that the total weight of the blue edges selected
in a minimum spanning tree of the resulting graph is maximized. \stack \ is
known to be \apx-hard already when the number of distinct red weights is 2. In
this paper we analyze some meaningful specializations and generalizations of
\stack, which shed some more light on the computational complexity of the
problem. More precisely, we first show that if $G$ is restricted to be
\emph{complete}, then the following holds: (i) if there are only 2 distinct red
weights, then the problem can be solved optimally (this contrasts with the
corresponding \apx-hardness of the general problem); (ii) otherwise, the
problem can be approximated within $7/4 + \epsilon$, for any $\epsilon > 0$.
Afterwards, we define a natural extension of \stack, namely that in which blue
edges have a non-negative \emph{activation cost} associated, and it is given a
global \emph{activation budget} that must not be exceeded when pricing blue
edges. Here, after showing that the very same approximation ratio as that of
the original problem can be achieved, we prove that if the spanning tree of red
edges can be rooted so as that any root-leaf path contains at most $h$ edges,
then the problem admits a $(2h+\epsilon)$-approximation algorithm, for any
$\epsilon > 0$.
","[{'version': 'v1', 'created': 'Fri, 4 Jul 2014 09:36:32 GMT'}]",2014-07-07,"[['Bilò', 'Davide', ''], ['Gualà', 'Luciano', ''], ['Leucci', 'Stefano', ''], ['Proietti', 'Guido', '']]","['Communication Networks', 'Minimum Spanning Tree', 'Stackelberg Games', 'Network Pricing Games']"
16129,1312.4234,Aiping  Huang,Aiping Huang and William Zhu,"Connectedness of graphs and its application to connected matroids
  through covering-based rough sets",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph theoretical ideas are highly utilized by computer science fields
especially data mining. In this field, a data structure can be designed in the
form of tree. Covering is a widely used form of data representation in data
mining and covering-based rough sets provide a systematic approach to this type
of representation. In this paper, we study the connectedness of graphs through
covering-based rough sets and apply it to connected matroids. First, we present
an approach to inducing a covering by a graph, and then study the connectedness
of the graph from the viewpoint of the covering approximation operators.
Second, we construct a graph from a matroid, and find the matroid and the graph
have the same connectedness, which makes us to use covering-based rough sets to
study connected matroids. In summary, this paper provides a new approach to
studying graph theory and matroid theory.
","[{'version': 'v1', 'created': 'Mon, 16 Dec 2013 02:32:43 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Jan 2014 12:00:52 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Mar 2015 08:23:03 GMT'}]",2015-03-05,"[['Huang', 'Aiping', ''], ['Zhu', 'William', '']]","['Covering-based rough set', 'Connected graph', 'Approximation operator', 'Connected matroid', 'Matrix']"
16130,1505.08070,Yirmeyahu Kaminski Ph.D.,"Yirmeyahu Kaminski, Michael Werman","General Deformations of Point Configurations Viewed By a Pinhole Model
  Camera",,,,,cs.CV math.AG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is a theoretical study of the following Non-Rigid Structure from
Motion problem. What can be computed from a monocular view of a parametrically
deforming set of points? We treat various variations of this problem for affine
and polynomial deformations with calibrated and uncalibrated cameras. We show
that in general at least three images with quasi-identical two deformations are
needed in order to have a finite set of solutions of the points' structure and
calculate some simple examples.
","[{'version': 'v1', 'created': 'Fri, 29 May 2015 14:51:18 GMT'}, {'version': 'v2', 'created': 'Sun, 9 Jan 2022 19:51:44 GMT'}]",2022-01-11,"[['Kaminski', 'Yirmeyahu', ''], ['Werman', 'Michael', '']]","['Multiple-View Geometry', 'Deformation', 'Dynamic Scenes', 'Structure From MotionABSTRACT']"
16131,1710.04486,Dominique Vaufreydaz,"Thomas Guntz (LIG), Raffaella Balzarini (LIG), Dominique Vaufreydaz
  (LIG, UGA), James L. Crowley (Grenoble INP, LIG)","Multimodal Observation and Interpretation of Subjects Engaged in Problem
  Solving",,"1st Workshop on ""Behavior, Emotion and Representation: Building
  Blocks of Interaction'', Oct 2017, Bielefeld, Germany. 2017",,,cs.HC cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present the first results of a pilot experiment in the
capture and interpretation of multimodal signals of human experts engaged in
solving challenging chess problems. Our goal is to investigate the extent to
which observations of eye-gaze, posture, emotion and other physiological
signals can be used to model the cognitive state of subjects, and to explore
the integration of multiple sensor modalities to improve the reliability of
detection of human displays of awareness and emotion. We observed chess players
engaged in problems of increasing difficulty while recording their behavior.
Such recordings can be used to estimate a participant's awareness of the
current situation and to predict ability to respond effectively to challenging
situations. Results show that a multimodal approach is more accurate than a
unimodal one. By combining body posture, visual attention and emotion, the
multimodal approach can reach up to 93% of accuracy when determining player's
chess expertise while unimodal approach reaches 86%. Finally this experiment
validates the use of our equipment as a general and reproducible tool for the
study of participants engaged in screen-based interaction and/or problem
solving.
","[{'version': 'v1', 'created': 'Thu, 12 Oct 2017 12:59:42 GMT'}]",2017-10-13,"[['Guntz', 'Thomas', '', 'LIG'], ['Balzarini', 'Raffaella', '', 'LIG'], ['Vaufreydaz', 'Dominique', '', 'LIG, UGA'], ['Crowley', 'James L.', '', 'Grenoble INP, LIG']]","['Chess Problem Solving', 'Eye Tracking', 'Multimodal Perception', 'Affective Computing']"
16132,1111.2988,Anant  Baijal,"Anant Baijal, Vikram Singh Chauhan and T. Jayabarathi","Application of PSO, Artificial Bee Colony and Bacterial Foraging
  Optimization algorithms to economic load dispatch: An analysis",,"IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 4, No 1, 2011, 467-470",,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper illustrates successful implementation of three evolutionary
algorithms, namely- Particle Swarm Optimization(PSO), Artificial Bee Colony
(ABC) and Bacterial Foraging Optimization (BFO) algorithms to economic load
dispatch problem (ELD). Power output of each generating unit and optimum fuel
cost obtained using all three algorithms have been compared. The results
obtained show that ABC and BFO algorithms converge to optimal fuel cost with
reduced computational time when compared to PSO for the two example problems
considered.
","[{'version': 'v1', 'created': 'Sun, 13 Nov 2011 04:46:28 GMT'}]",2015-09-23,"[['Baijal', 'Anant', ''], ['Chauhan', 'Vikram Singh', ''], ['Jayabarathi', 'T.', '']]","['ABC', 'PSO', 'BFO', 'Economic Load dispatch', 'Evolutionary Algorithms']"
16133,1502.04108,Yoonmi Chu,Yoonmi Chu and Robert B. Allen,"Structured Descriptions of Roles, Activities,and Procedures in the Roman
  Constitution","6 pages, 2 figures, Presented at the Italian Research Conference on
  Digital Libraries (IRCDL 2015), Bozen-Bolzano, Italy, 29-30 January, 2015",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A highly structured description of entities and events in histories can
support flexible exploration of those histories by users and, ultimately,
support richly-linked full-text digital libraries. Here, we apply the Basic
Formal Ontology (BFO) to structure a passage about the Roman Constitution from
Gibbon's Decline and Fall of the Roman Empire. Specifically, we consider the
specification of Roles such as Consuls, Activities associated with those Roles,
and Procedures for accomplishing those Activities.
","[{'version': 'v1', 'created': 'Fri, 13 Feb 2015 20:29:21 GMT'}]",2015-02-16,"[['Chu', 'Yoonmi', ''], ['Allen', 'Robert B.', '']]","['BFO', 'Community Models', 'Digital Humanities', 'Granularity', 'Ontologies', 'Procedures', 'Roles']"
16134,1607.01294,Alina Shaikhet,"Prosenjit Bose and Jean-Lou De Carufel and Alina Shaikhet and Michiel
  Smid",Essential Constraints of Edge-Constrained Proximity Graphs,"24 pages, 22 figures. A preliminary version of this paper appeared in
  the Proceedings of 27th International Workshop, IWOCA 2016, Helsinki,
  Finland. It was published by Springer in the Lecture Notes in Computer
  Science (LNCS) series",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a plane forest $F = (V, E)$ of $|V| = n$ points, we find the minimum
set $S \subseteq E$ of edges such that the edge-constrained minimum spanning
tree over the set $V$ of vertices and the set $S$ of constraints contains $F$.
We present an $O(n \log n )$-time algorithm that solves this problem. We
generalize this to other proximity graphs in the constraint setting, such as
the relative neighbourhood graph, Gabriel graph, $\beta$-skeleton and Delaunay
triangulation. We present an algorithm that identifies the minimum set
$S\subseteq E$ of edges of a given plane graph $I=(V,E)$ such that $I \subseteq
CG_\beta(V, S)$ for $1 \leq \beta \leq 2$, where $CG_\beta(V, S)$ is the
constraint $\beta$-skeleton over the set $V$ of vertices and the set $S$ of
constraints. The running time of our algorithm is $O(n)$, provided that the
constrained Delaunay triangulation of $I$ is given.
","[{'version': 'v1', 'created': 'Tue, 5 Jul 2016 15:22:34 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Oct 2016 04:08:55 GMT'}]",2016-10-04,"[['Bose', 'Prosenjit', ''], ['De Carufel', 'Jean-Lou', ''], ['Shaikhet', 'Alina', ''], ['Smid', 'Michiel', '']]","['proximity graphs', 'constraints', 'visibility', 'MST', 'Delaunay', 'β-skeletons']"
16135,1510.09203,Niloy Mitra Dr,"Chi-Han Peng, Niloy J. Mitra, Fan Bao, Dong-Ming Yan, Peter Wonka",Computational Network Design from Functional Specifications,,,,,cs.CG cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Connectivity and layout of underlying networks largely determine the behavior
of many environments. For example, transportation networks determine the flow
of traffic in cities, or maps determine the difficulty and flow in games.
Designing such networks from scratch is challenging as even local network
changes can have large global effects. We investigate how to computationally
create networks starting from {\em only} high-level functional specifications.
Such specifications can be in the form of network density, travel time versus
network length, traffic type, destination locations, etc. We propose an integer
programming-based approach that guarantees that the resultant networks are
valid by fulfilling all specified hard constraints, and score favorably in
terms of the objective function. We evaluate our algorithm in three different
design settings (i.e., street layout, floorplanning, and game level design) and
demonstrate, for the first time, that diverse networks can emerge purely from
high-level functional specifications.
","[{'version': 'v1', 'created': 'Fri, 30 Oct 2015 19:09:36 GMT'}]",2015-11-02,"[['Peng', 'Chi-Han', ''], ['Mitra', 'Niloy J.', ''], ['Bao', 'Fan', ''], ['Yan', 'Dong-Ming', ''], ['Wonka', 'Peter', '']]","['network layout design', 'functional specifications', 'integer programming', 'games', 'urban planning']"
16136,1402.1810,"Martin F\""urer","Martin F\""urer",A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width,To appear in the proceedings of Latin 2014. Springer LNCS 8392,,,,cs.DS cs.CC cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate a new width parameter, the fusion-width of a graph. It is a
natural generalization of the tree-width, yet strong enough that not only
graphs of bounded tree-width, but also graphs of bounded clique-width,
trivially have bounded fusion-width. In particular, there is no exponential
growth between tree-width and fusion-width, as is the case between tree-width
and clique-width. The new parameter gives a good intuition about the
relationship between tree-width and clique-width.
","[{'version': 'v1', 'created': 'Sat, 8 Feb 2014 01:55:12 GMT'}]",2014-02-11,"[['Fürer', 'Martin', '']]","['tree-width', 'clique-width', 'fusion-width', 'FPT', 'XP']"
16137,1504.05707,Daniel Ritter,Daniel Ritter,Towards More Data-Aware Application Integration (extended version),"18 Pages, extended version of the contribution to British
  International Conference on Databases (BICOD), 2015, Edinburgh, Scotland",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although most business application data is stored in relational databases,
programming languages and wire formats in integration middleware systems are
not table-centric. Due to costly format conversions, data-shipments and faster
computation, the trend is to ""push-down"" the integration operations closer to
the storage representation.
  We address the alternative case of defining declarative, table-centric
integration semantics within standard integration systems. For that, we replace
the current operator implementations for the well-known Enterprise Integration
Patterns by equivalent ""in-memory"" table processing, and show a practical
realization in a conventional integration system for a non-reliable,
""data-intensive"" messaging example. The results of the runtime analysis show
that table-centric processing is promising already in standard, ""single-record""
message routing and transformations, and can potentially excel the message
throughput for ""multi-record"" table messages.
","[{'version': 'v1', 'created': 'Wed, 22 Apr 2015 09:40:01 GMT'}]",2016-10-05,"[['Ritter', 'Daniel', '']]","['Datalog', 'Message-based / Data integration', 'Integration System']"
16138,1209.1327,Philippe Kruchten,Philippe Kruchten,The frog and the octopus: a conceptual model of software development,,,,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We propose a conceptual model of software development that encompasses all
approaches: traditional or agile, light and heavy, for large and small
development efforts. The model identifies both the common aspects in all
software development, i.e., elements found in some form or another in each and
every software development project (Intent, Product, People, Work, Time,
Quality, Risk, Cost, Value), as well as the variable part, i.e., the main
factors that cause the very wide variations we can find in the software
development world (Size, Age, Criticality, Architecture stability, Business
model, Governance, Rate of change, Geographic distribution). We show how the
model can be used as an explanatory theory of software development, as a tool
for analysis of practices, techniques, processes, as the basis for curriculum
design or for software process adoption and improvement, and to support
empirical research on software development methods. This model is also proposed
as a way to depolarize the debate on agile methods versus the
rest-of-the-world: a unified model.
","[{'version': 'v1', 'created': 'Thu, 6 Sep 2012 16:08:34 GMT'}]",2012-09-07,"[['Kruchten', 'Philippe', '']]","['software development', 'conceptual model', 'ontology', 'method', 'software development process', 'software engineering', 'theory']"
16139,1003.3386,Hakan Ozadam,"Edgar Martinez-Moro, Hakan Ozadam, Ferruh Ozbudak, Steve Szabo",Monomial-like codes,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As a generalization of cyclic codes of length p^s over F_{p^a}, we study
n-dimensional cyclic codes of length p^{s_1} X ... X p^{s_n} over F_{p^a}
generated by a single ""monomial"". Namely, we study multi-variable cyclic codes
of the form <(x_1 - 1)^{i_1} ... (x_n - 1)^{i_n}> in F_{p^a}[x_1...x_n] / <
x_1^{p^{s_1}}-1, ..., x_n^{p^{s_n}}-1 >. We call such codes monomial-like
codes. We show that these codes arise from the product of certain single
variable codes and we determine their minimum Hamming distance. We determine
the dual of monomial-like codes yielding a parity check matrix. We also present
an alternative way of constructing a parity check matrix using the Hasse
derivative. We study the weight hierarchy of certain monomial like codes. We
simplify an expression that gives us the weight hierarchy of these codes.
","[{'version': 'v1', 'created': 'Wed, 17 Mar 2010 15:03:14 GMT'}]",2010-03-18,"[['Martinez-Moro', 'Edgar', ''], ['Ozadam', 'Hakan', ''], ['Ozbudak', 'Ferruh', ''], ['Szabo', 'Steve', '']]","['Monomial ideal', 'cyclic code', 'repeated-root cyclic code', 'Hamming distance', 'generalized Hamming weight']"
16140,1710.04422,Vasileios Kotronis,"Vasileios Kotronis, George Nomikos, Lefteris Manassakis, Dimitris
  Mavrommatis and Xenofontas Dimitropoulos",Shortcuts through Colocation Facilities,"In Proceedings of the ACM Internet Measurement Conference (IMC '17),
  London, GB, 2017",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network overlays, running on top of the existing Internet substrate, are of
perennial value to Internet end-users in the context of, e.g., real-time
applications. Such overlays can employ traffic relays to yield path latencies
lower than the direct paths, a phenomenon known as Triangle Inequality
Violation (TIV). Past studies identify the opportunities of reducing latency
using TIVs. However, they do not investigate the gains of strategically
selecting relays in Colocation Facilities (Colos). In this work, we answer the
following questions: (i) how Colo-hosted relays compare with other relays as
well as with the direct Internet, in terms of latency (RTT) reductions; (ii)
what are the best locations for placing the relays to yield these reductions.
To this end, we conduct a large-scale one-month measurement of inter-domain
paths between RIPE Atlas (RA) nodes as endpoints, located at eyeball networks.
We employ as relays Planetlab nodes, other RA nodes, and machines in Colos. We
examine the RTTs of the overlay paths obtained via the selected relays, as well
as the direct paths. We find that Colo-based relays perform the best and can
achieve latency reductions against direct paths, ranging from a few to 100s of
milliseconds, in 76% of the total cases; 75% (58% of total cases) of these
reductions require only 10 relays in 6 large Colos.
","[{'version': 'v1', 'created': 'Thu, 12 Oct 2017 09:41:04 GMT'}]",2017-10-13,"[['Kotronis', 'Vasileios', ''], ['Nomikos', 'George', ''], ['Manassakis', 'Lefteris', ''], ['Mavrommatis', 'Dimitris', ''], ['Dimitropoulos', 'Xenofontas', '']]","['Overlay Network', 'Relay', 'Latency', 'Triangle Inequality Violation']"
16141,1004.4296,Charles Cartledge,Charles L. Cartledge and Michael L. Nelson,Analysis of Graphs for Digital Preservation Suitability,"Accepted for publication at HyperText 2010 ACM Conference on
  Hypertext and Hypermedia, 10 pages, 3 figures",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the use of autonomically created small-world graphs as a
framework for the long term storage of digital objects on the Web in a
potentially hostile environment. We attack the classic Erdos - Renyi random,
Barab'asi and Albert power law, Watts - Strogatz small world and our
Unsupervised Small-World (USW) graphs using different attacker strategies and
report their respective robustness. Using different attacker profiles, we
construct a game where the attacker is allowed to use a strategy of his choice
to remove a percentage of each graph's elements. The graph is then allowed to
repair some portion of its self. We report on the number of alternating attack
and repair turns until either the graph is disconnected, or the game exceeds
the number of permitted turns. Based on our analysis, an attack strategy that
focuses on removing the vertices with the highest betweenness value is most
advantageous to the attacker. Power law graphs can become disconnected with the
removal of a single edge; random graphs with the removal of as few as 1% of
their vertices, small-world graphs with the removal of 14% vertices, and USW
with the removal of 17% vertices. Watts - Strogatz small-world graphs are more
robust and resilient than random or power law graphs. USW graphs are more
robust and resilient than small world graphs. A graph of USW connected web
objects (WOs) filled with data could outlive the individuals and institutions
that created the data in an environment where WOs are lost due to random
failures or directed attacks.
","[{'version': 'v1', 'created': 'Sat, 24 Apr 2010 17:47:30 GMT'}]",2010-04-27,"[['Cartledge', 'Charles L.', ''], ['Nelson', 'Michael L.', '']]","['small world', 'robustness', 'resilience']"
16142,1710.06119,Philipp Diebold,"Sven Theobald, Philipp Diebold",Beneficial and Harmful Agile Practices for Product Quality,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is the widespread belief that Agile neglects the product quality. This
lack of understanding how Agile processes assure the quality of the product
prevents especially companies from regulated domains from an adoption of Agile.
This work aims to identify which Agile Practices contribute towards product
quality. Hence, data from a survey study is analyzed to identify Ag-ile
Practices which are beneficial or harmful for the quality of the product. From
49 practices that were used in the survey so far, 36 were perceived to have a
positive impact on product quality, while four practices were rated as being
harmful. The results enrich understanding of how product quality can be
achieved in Agile, and support selection of practices to improve quality.
","[{'version': 'v1', 'created': 'Tue, 17 Oct 2017 06:43:07 GMT'}]",2017-10-18,"[['Theobald', 'Sven', ''], ['Diebold', 'Philipp', '']]","['Agile', 'Agile practices', 'Product quality', 'Impacts']"
16143,1701.05986,Xie Pei,"Pei Xie, Keyou You, Shiji Song and Cheng Wu","Distributed Random-Fixed Projected Algorithm for Constrained
  Optimization Over Digraphs",arXiv admin note: substantial text overlap with arXiv:1612.09029,,,,cs.DC math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is concerned with a constrained optimization problem over a
directed graph (digraph) of nodes, in which the cost function is a sum of local
objectives, and each node only knows its local objective and constraints. To
collaboratively solve the optimization, most of the existing works require the
interaction graph to be balanced or ""doubly-stochastic"", which is quite
restrictive and not necessary as shown in this paper. We focus on an epigraph
form of the original optimization to resolve the ""unbalanced"" problem, and
design a novel two-step recursive algorithm with a simple structure. Under
strongly connected digraphs, we prove that each node asymptotically converges
to some common optimal solution. Finally, simulations are performed to
illustrate the effectiveness of the proposed algorithms.
","[{'version': 'v1', 'created': 'Sat, 21 Jan 2017 05:54:51 GMT'}]",2017-01-24,"[['Xie', 'Pei', ''], ['You', 'Keyou', ''], ['Song', 'Shiji', ''], ['Wu', 'Cheng', '']]","['Distributed algorithms', 'constrained optimization', 'unbalanced digraphs', 'epigraphform', 'random-fixed projected algorithm']"
16144,1010.2830,Zilong Wang,"Zilong Wang, Guang Gong, and Rongquan Feng","A Generalized Construction of OFDM M-QAM Sequences With Low
  Peak-to-Average Power Ratio",published by Advances in Mathematics of Communications,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A construction of $2^{2n}$-QAM sequences is given and an upper bound of the
peak-to-mean envelope power ratio (PMEPR) is determined. Some former works can
be viewed as special cases of this construction.
","[{'version': 'v1', 'created': 'Thu, 14 Oct 2010 05:35:42 GMT'}]",2010-10-15,"[['Wang', 'Zilong', ''], ['Gong', 'Guang', ''], ['Feng', 'Rongquan', '']]","['Golay sequences', 'QAM', 'multicarrier communications', 'orthogonal frequency-divisionmultiplexing (OFDM)', 'peak-to-mean envelope power ratio (PMEPR)']"
16145,1305.1091,Stefano Martin Mr.,Olav Geil and Stefano Martin,Further improvements on the Feng-Rao bound for dual codes,"16 pages, 3 figures",,,,cs.IT math.AC math.AG math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Salazar, Dunn and Graham in [Salazar et. al., 2006] presented an improved
Feng-Rao bound for the minimum distance of dual codes. In this work we take the
improvement a step further. Both the original bound by Salazar et. al., as well
as our improvement are lifted so that they deal with generalized Hamming
weights. We also demonstrate the advantage of working with one-way
well-behaving pairs rather than weakly well-behaving or well-behaving pairs.
","[{'version': 'v1', 'created': 'Mon, 6 May 2013 06:12:15 GMT'}]",2013-05-07,"[['Geil', 'Olav', ''], ['Martin', 'Stefano', '']]","['Advisory bound', 'affine variety code', 'Feng-Rao bound', 'generalized Hamming weight', 'minimum distance', 'well-behaving pair']"
16146,1208.1176,Viet Tung Hoang,Viet Tung Hoang and Ben Morris and Phillip Rogaway,An Enciphering Scheme Based on a Card Shuffle,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the swap-or-not shuffle and show that the technique gives rise
to a new method to convert a pseudorandom function (PRF) into a pseudorandom
permutation (PRP) (or, alternatively, to directly build a confusion/diffusion
blockcipher). We then prove that swap-or-not has excellent quantitative
security bounds, giving a Luby-Rackoff type result that ensures security
(assuming an ideal round function) to a number of adversarial queries that is
nearly the size of the construction's domain. Swap-or-not provides a direct
solution for building a small-domain cipher and achieving format-preserving
encryption, yielding the best bounds known for a practical scheme for
enciphering credit-card numbers. The analysis of swap-or-not is based on the
theory of mixing times of Markov chains.
","[{'version': 'v1', 'created': 'Mon, 6 Aug 2012 14:50:31 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Nov 2014 05:41:16 GMT'}]",2014-11-24,"[['Hoang', 'Viet Tung', ''], ['Morris', 'Ben', ''], ['Rogaway', 'Phillip', '']]","['Blockciphers', 'Feistel network', 'Luby-Rackoff', 'Markov chain', 'PRF-to-PRP conversion', 'pseudorandom permutations', 'swap-or-not']"
16147,1603.08981,Shuang Li,"Shuang Li, Yao Xie, Mehrdad Farajtabar, Apurv Verma, and Le Song",Detecting weak changes in dynamic events over networks,,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Large volume of networked streaming event data are becoming increasingly
available in a wide variety of applications, such as social network analysis,
Internet traffic monitoring and healthcare analytics. Streaming event data are
discrete observation occurred in continuous time, and the precise time interval
between two events carries a great deal of information about the dynamics of
the underlying systems. How to promptly detect changes in these dynamic systems
using these streaming event data? In this paper, we propose a novel
change-point detection framework for multi-dimensional event data over
networks. We cast the problem into sequential hypothesis test, and derive the
likelihood ratios for point processes, which are computed efficiently via an
EM-like algorithm that is parameter-free and can be computed in a distributed
fashion. We derive a highly accurate theoretical characterization of the
false-alarm-rate, and show that it can achieve weak signal detection by
aggregating local statistics over time and networks. Finally, we demonstrate
the good performance of our algorithm on numerical examples and real-world
datasets from twitter and Memetracker.
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2016 21:54:56 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Sep 2016 20:09:56 GMT'}]",2016-09-20,"[['Li', 'Shuang', ''], ['Xie', 'Yao', ''], ['Farajtabar', 'Mehrdad', ''], ['Verma', 'Apurv', ''], ['Song', 'Le', '']]","['Change-point Detection for Event Data', 'HawkesProcess', 'Online Detection Algorithm', 'False Alarm Control']"
16148,1501.03988,"Ilkka T\""orm\""a","Ville Salo, Ilkka T\""orm\""a",A One-Dimensional Physically Universal Cellular Automaton,"17 pages, 6 figures. Corrected an error in a figure",,,,cs.FL math.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Physical universality of a cellular automaton was defined by Janzing in 2010
as the ability to implement an arbitrary transformation of spatial patterns. In
2014, Schaeffer gave a construction of a two-dimensional physically universal
cellular automaton. We construct a one-dimensional version of the automaton.
","[{'version': 'v1', 'created': 'Fri, 16 Jan 2015 14:31:18 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Jan 2015 15:47:46 GMT'}]",2016-02-22,"[['Salo', 'Ville', ''], ['Törmä', 'Ilkka', '']]","['cellular automaton', 'physical universality', 'reversibility']"
16149,1710.06515,Quang Loc Le,Quang Loc Le,"Enhancing Inductive Entailment Proofs in Separation Logic with Lemma
  Synthesis",,,,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an approach to lemma synthesis to support advanced
inductive entailment procedures based on separation logic. We first propose a
mechanism where lemmas are automatically proven and systematically applied. The
lemmas may include universal guard and/or unknown predicate. While the former
is critical for expressivity, the latter is essential for supporting
relationships between multiple predicates. We further introduce lemma synthesis
to support (i) automated inductive reasoning together with frame inference and
(ii) theorem exploration. For (i) we automatically discover and prove auxiliary
lemmas during an inductive proof; and for (ii) we automatically generate a
useful set of lemmas to relate user-defined or system-generated predicates. We
have implemented our proposed approach into an existing verification system and
tested its capability in inductive reasoning and theorem exploration. The
experimental results show that the enhanced system can automatically synthesize
useful lemmas to facilitate reasoning on a broad range of non-trivial inductive
proofs.
","[{'version': 'v1', 'created': 'Tue, 17 Oct 2017 22:13:25 GMT'}, {'version': 'v2', 'created': 'Sat, 12 May 2018 10:10:29 GMT'}]",2018-05-15,"[['Le', 'Quang Loc', '']]","['Lemma Synthesis', 'Induction Proving', 'Theorem Exploration', 'Separation Logic', 'User-Defined Predicate']"
16150,1712.03943,Carlton Shepherd,"Carlton Shepherd, Raja Naeem Akram, Konstantinos Markantonakis",EmLog: Tamper-Resistant System Logging for Constrained Devices with TEEs,"Accepted at the 11th IFIP International Conference on Information
  Security Theory and Practice (WISTP '17)",,,,cs.CR cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Remote mobile and embedded devices are used to deliver increasingly impactful
services, such as medical rehabilitation and assistive technologies. Secure
system logging is beneficial in these scenarios to aid audit and forensic
investigations particularly if devices bring harm to end-users. Logs should be
tamper-resistant in storage, during execution, and when retrieved by a trusted
remote verifier. In recent years, Trusted Execution Environments (TEEs) have
emerged as the go-to root of trust on constrained devices for isolated
execution of sensitive applications. Existing TEE-based logging systems,
however, focus largely on protecting server-side logs and offer little
protection to constrained source devices. In this paper, we introduce EmLog --
a tamper-resistant logging system for constrained devices using the
GlobalPlatform TEE. EmLog provides protection against complex software
adversaries and offers several additional security properties over past
schemes. The system is evaluated across three log datasets using an
off-the-shelf ARM development board running an open-source,
GlobalPlatform-compliant TEE. On average, EmLog runs with low run-time memory
overhead (1MB heap and stack), 430--625 logs/second throughput, and five-times
persistent storage overhead versus unprotected logs.
","[{'version': 'v1', 'created': 'Mon, 11 Dec 2017 18:49:08 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Dec 2017 16:41:54 GMT'}, {'version': 'v3', 'created': 'Tue, 19 Dec 2017 03:20:19 GMT'}]",2017-12-20,"[['Shepherd', 'Carlton', ''], ['Akram', 'Raja Naeem', ''], ['Markantonakis', 'Konstantinos', '']]","['System Logging', 'Embedded Security', 'Trusted Computing']"
16151,1605.01379,Xiao Lin,"Xiao Lin, Devi Parikh",Leveraging Visual Question Answering for Image-Caption Ranking,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visual Question Answering (VQA) is the task of taking as input an image and a
free-form natural language question about the image, and producing an accurate
answer. In this work we view VQA as a ""feature extraction"" module to extract
image and caption representations. We employ these representations for the task
of image-caption ranking. Each feature dimension captures (imagines) whether a
fact (question-answer pair) could plausibly be true for the image and caption.
This allows the model to interpret images and captions from a wide variety of
perspectives. We propose score-level and representation-level fusion models to
incorporate VQA knowledge in an existing state-of-the-art VQA-agnostic
image-caption ranking model. We find that incorporating and reasoning about
consistency between images and captions significantly improves performance.
Concretely, our model improves state-of-the-art on caption retrieval by 7.1%
and on image retrieval by 4.4% on the MSCOCO dataset.
","[{'version': 'v1', 'created': 'Wed, 4 May 2016 18:54:09 GMT'}, {'version': 'v2', 'created': 'Wed, 31 Aug 2016 20:14:12 GMT'}]",2016-09-02,"[['Lin', 'Xiao', ''], ['Parikh', 'Devi', '']]","['Visual question answering', 'image-caption ranking', 'mid-levelconcepts']"
16152,1507.02011,Qinxun Bai,"Qinxun Bai, Henry Lam, Stan Sclaroff",A Bayesian Approach for Online Classifier Ensemble,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a Bayesian approach for recursively estimating the classifier
weights in online learning of a classifier ensemble. In contrast with past
methods, such as stochastic gradient descent or online boosting, our approach
estimates the weights by recursively updating its posterior distribution. For a
specified class of loss functions, we show that it is possible to formulate a
suitably defined likelihood function and hence use the posterior distribution
as an approximation to the global empirical loss minimizer. If the stream of
training data is sampled from a stationary process, we can also show that our
approach admits a superior rate of convergence to the expected loss minimizer
than is possible with standard stochastic gradient descent. In experiments with
real-world datasets, our formulation often performs better than
state-of-the-art stochastic gradient descent and online boosting algorithms.
","[{'version': 'v1', 'created': 'Wed, 8 Jul 2015 03:35:58 GMT'}]",2015-07-09,"[['Bai', 'Qinxun', ''], ['Lam', 'Henry', ''], ['Sclaroff', 'Stan', '']]","['Online learning', 'classifier ensembles', 'Bayesian methods']"
16153,1511.00924,Sarah Alice Gaggl,Sarah Alice Gaggl and Sebastian Rudolph and Lukas Schweizer,Bound Your Models! How to Make OWL an ASP Modeling Language,"International Workshop on User-Oriented Logic Programming (IULP
  2015), co-located with the 31st International Conference on Logic Programming
  (ICLP 2015), Proceedings of the International Workshop on User-Oriented Logic
  Programming (IULP 2015), Editors: Stefan Ellmauthaler and Claudia Schulz,
  pages 33-49, August 2015",,,,cs.PL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To exploit the Web Ontology Language OWL as an answer set programming (ASP)
language, we introduce the notion of bounded model semantics, as an intuitive
and computationally advantageous alternative to its classical semantics. We
show that a translation into ASP allows for solving a wide range of
bounded-model reasoning tasks, including satisfiability and axiom entailment
but also novel ones such as model extraction and enumeration. Ultimately, our
work facilitates harnessing advanced semantic web modeling environments for the
logic programming community through an ""off-label use"" of OWL.
","[{'version': 'v1', 'created': 'Tue, 3 Nov 2015 14:38:53 GMT'}]",2015-11-04,"[['Gaggl', 'Sarah Alice', ''], ['Rudolph', 'Sebastian', ''], ['Schweizer', 'Lukas', '']]","['Answer Set Programming', 'Bounded-Model Semantics', 'SemanticWeb']"
16154,1304.3435,Moshe Ben-Bassat,"Moshe Ben-Bassat, Oded Maler",A Framework for Control Strategies in Uncertain Inference Networks,"Appears in Proceedings of the First Conference on Uncertainty in
  Artificial Intelligence (UAI1985)",,,UAI-P-1985-PG-143-151,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Control Strategies for hierarchical tree-like probabilistic inference
networks are formulated and investigated. Strategies that utilize staged
look-ahead and temporary focus on subgoals are formalized and refined using the
Depth Vector concept that serves as a tool for defining the 'virtual tree'
regarded by the control strategy. The concept is illustrated by four types of
control strategies for three-level trees that are characterized according to
their Depth Vector, and according to the way they consider intermediate nodes
and the role that they let these nodes play. INFERENTI is a computerized
inference system written in Prolog, which provides tools for exercising a
variety of control strategies. The system also provides tools for simulating
test data and for comparing the relative average performance under different
strategies.
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2013 19:57:11 GMT'}]",2013-04-15,"[['Ben-Bassat', 'Moshe', ''], ['Maler', 'Oded', '']]","['control strategies', 'probabilistic evidential reasoning', 'inference']"
16155,1802.06283,Justin Hsu,"Alejandro Aguirre, Gilles Barthe, Justin Hsu, Alexandra Silva",Almost Sure Productivity,,,,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We define Almost Sure Productivity (ASP), a probabilistic generalization of
the productivity condition for coinductively defined structures. Intuitively, a
probabilistic coinductive stream or tree is ASP if it produces infinitely many
outputs with probability 1. Formally, we define almost sure productivity using
a final coalgebra semantics of programs inspired from Kerstan and K\""onig.
Then, we introduce a core language for probabilistic streams and trees, and
provide two approaches to verify ASP: a sufficient syntactic criterion, and a
reduction to model-checking pCTL* formulas on probabilistic pushdown automata.
The reduction shows that ASP is decidable for our core language.
","[{'version': 'v1', 'created': 'Sat, 17 Feb 2018 20:14:10 GMT'}, {'version': 'v2', 'created': 'Sun, 13 May 2018 21:58:17 GMT'}]",2018-05-15,"[['Aguirre', 'Alejandro', ''], ['Barthe', 'Gilles', ''], ['Hsu', 'Justin', ''], ['Silva', 'Alexandra', '']]","['Coinduction', 'Probabilistic Programming', 'Productivity']"
16156,1403.0950,Kostas Margellos,"Kostas Margellos, Maria Prandini, John Lygeros","On the connection between compression learning and scenario based
  optimization","29 pages, shorter version submitted to the IEEE Transactions on
  Automatic Control",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the connections between compression learning and scenario
based optimization. We first show how to strengthen, or relax the consistency
assumption at the basis of compression learning and study the learning and
generalization properties of the algorithm involved. We then consider different
constrained optimization problems affected by uncertainty represented by means
of scenarios. We show that the issue of providing guarantees on the probability
of constraint violation reduces to a learning problem for an appropriately
chosen algorithm that enjoys compression learning properties. The compression
learning perspective provides a unifying framework for scenario based
optimization and allows us to revisit the scenario approach and the
probabilistically robust design, a recently developed technique based on a
mixture of randomized and robust optimization, and to extend the guarantees on
the probability of constraint violation to cascading optimization problems.
","[{'version': 'v1', 'created': 'Tue, 4 Mar 2014 21:09:59 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Mar 2014 07:26:56 GMT'}]",2014-03-07,"[['Margellos', 'Kostas', ''], ['Prandini', 'Maria', ''], ['Lygeros', 'John', '']]","['Compression learning', 'consistent algorithms', 'randomized optimization', 'scenarioapproach', 'statistical learning theory']"
16157,1505.07056,Jarek Duda dr,Jarek Duda,Joint error correction enhancement of the fountain codes concept,"14 pages, 9 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fountain codes like LT or Raptor codes, also known as rateless erasure codes,
allow to encode a message as some number of packets, such that any large enough
subset of these packets is sufficient to fully reconstruct the message. It
requires undamaged packets, while the packets which were not lost are usually
damaged in real scenarios. Hence, an additional error correction layer is often
required: adding some level of redundancy to each packet to be able to repair
eventual damages. This approach requires a priori knowledge of the final damage
level of every packet - insufficient redundancy leads to packet loss,
overprotection means suboptimal channel rate. However, the sender may have
inaccurate or even no a priori information about the final damage levels, for
example in applications like broadcasting, degradation of a storage medium or
damage of picture watermarking.
  Joint Reconstruction Codes (JRC) setting is introduced and discussed in this
paper for the purpose of removing the need of a priori knowledge of damage
level and sub-optimality caused by overprotection and discarding underprotected
packets. It is obtained by combining both processes: reconstruction from
multiple packets and forward error correction. The decoder combines the
resultant informational content of all received packets accordingly to their
actual noise level, which can be estimated a posteriori individually for each
packet. Assuming binary symmetric channel (BSC) of $\epsilon$ bit-flip
probability, every potentially damaged bit carries
$R_0(\epsilon)=1-h_1(\epsilon)$ bits of information, where $h_1$ is the Shannon
entropy. The minimal requirement to fully reconstruct the message is that the
sum of rate $R_0(\epsilon)$ over all bits is at least the size of the message.
We will discuss sequential decoding for the reconstruction purpose, which
statistical behavior can be estimated using Renyi entropy.
","[{'version': 'v1', 'created': 'Wed, 20 May 2015 17:28:20 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Aug 2015 16:27:38 GMT'}]",2015-08-19,"[['Duda', 'Jarek', '']]","['fountain codes', 'error correction', 'sequential decoding', 'Renyi entropy', 'broadcasting']"
16158,1402.2435,Bei Yu,Bei Yu and Kun Yuan and Jhih-Rong Gao and David Z. Pan,"E-BLOW: E-Beam Lithography Overlapping aware Stencil Planning for MCC
  System",,,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Electron beam lithography (EBL) is a promising maskless solution for the
technology beyond 14nm logic node. To overcome its throughput limitation,
recently the traditional EBL system is extended into MCC system. %to further
improve the throughput. In this paper, we present E-BLOW, a tool to solve the
overlapping aware stencil planning (OSP) problems in MCC system. E-BLOW is
integrated with several novel speedup techniques, i.e., successive relaxation,
dynamic programming and KD-Tree based clustering, to achieve a good performance
in terms of runtime and solution quality. Experimental results show that,
compared with previous works, E-BLOW demonstrates better performance for both
conventional EBL system and MCC system.
","[{'version': 'v1', 'created': 'Tue, 11 Feb 2014 10:37:37 GMT'}]",2014-02-12,"[['Yu', 'Bei', ''], ['Yuan', 'Kun', ''], ['Gao', 'Jhih-Rong', ''], ['Pan', 'David Z.', '']]","['Electron Beam Lithography (EBL)', 'Overlapping aware Stencil Planning (OSP)', 'Multi-Column Cell (MCC) System']"
16159,1205.4996,Md. Hasnat Kabir Dr,"M. Hasnat Kabir, Shaikh Enayet Ullah, Mustari Zaman and Md. Golam
  Rashed","Ber analysis of iterative turbo encoded miso wireless communication
  system under implementation of q-ostbc scheme","International Journal of Information Technology Convergence and
  Services (IJITCS), Vol.2, No.1, 2012",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a comprehensive study has been made to evaluate the
performance of a MISO wireless communication system. The 4-by-1 spatially
multiplexed Turbo encoded system under investigation incorporates
Quasi-orthogonal space-time block coding (Q-STBC) and ML signal detection
schemes under QPSK, QAM, 16PSK and 16QAM digital modulations. The simulation
results elucidate that a significant improvement of system performance is
achieved in QAM modulation. The results are also indicative of noticeable
system performance enhancement with increasing number of iterations in Turbo
encoding/decoding scheme.
","[{'version': 'v1', 'created': 'Thu, 8 Mar 2012 12:43:36 GMT'}]",2012-05-23,"[['Kabir', 'M. Hasnat', ''], ['Ullah', 'Shaikh Enayet', ''], ['Zaman', 'Mustari', ''], ['Rashed', 'Md. Golam', '']]","['Q-OSTBC', 'Turbo Equalization', 'ML signal detection technique', 'Bit Error rate (BER)']"
16160,1111.0499,Rafael Grimson Dr.,"Rafael Grimson, Joos Heintz, Bart Kuijpers",Evaluating geometric queries using few arithmetic operations,,,,,cs.DS cs.DB math.AG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $\cp:=(P_1,...,P_s)$ be a given family of $n$-variate polynomials with
integer coefficients and suppose that the degrees and logarithmic heights of
these polynomials are bounded by $d$ and $h$, respectively. Suppose furthermore
that for each $1\leq i\leq s$ the polynomial $P_i$ can be evaluated using $L$
arithmetic operations (additions, subtractions, multiplications and the
constants 0 and 1). Assume that the family $\cp$ is in a suitable sense
\emph{generic}. We construct a database $\cal D$, supported by an algebraic
computation tree, such that for each $x\in [0,1]^n$ the query for the signs of
$P_1(x),...,P_s(x)$ can be answered using $h d^{\cO(n^2)}$ comparisons and $nL$
arithmetic operations between real numbers. The arithmetic-geometric tools
developed for the construction of $\cal D$ are then employed to exhibit example
classes of systems of $n$ polynomial equations in $n$ unknowns whose
consistency may be checked using only few arithmetic operations, admitting
however an exponential number of comparisons.
","[{'version': 'v1', 'created': 'Tue, 1 Nov 2011 17:57:20 GMT'}]",2011-11-03,"[['Grimson', 'Rafael', ''], ['Heintz', 'Joos', ''], ['Kuijpers', 'Bart', '']]","['Constraint database', 'query evaluation', 'computational complexity', 'consistency of polynomial equation systems']"
16161,1009.0397,Wided Oueslati wided,wided oueslati and jalel akaichi,Mobile Information Collectors' Trajectory Data Warehouse Design,"20 pages, 9 figures","international journal of managing information technology august
  2010",,,cs.DB,http://creativecommons.org/licenses/by/3.0/,"  To analyze complex phenomena which involve moving objects, Trajectory Data
Warehouse (TDW) seems to be an answer for many recent decision problems related
to various professions (physicians, commercial representatives, transporters,
ecologists ...) concerned with mobility. This work aims to make trajectories as
a first class concept in the trajectory data conceptual model and to design a
TDW, in which data resulting from mobile information collectors' trajectory are
gathered. These data will be analyzed, according to trajectory characteristics,
for decision making purposes, such as new products commercialization, new
commerce implementation, etc.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2010 11:41:29 GMT'}]",2010-09-03,"[['oueslati', 'wided', ''], ['akaichi', 'jalel', '']]","['Moving object', 'Trajectory data', 'Trajectory data Conceptual modeling', 'Trajectory data warehouse Conceptual modeling']"
16162,1002.0449,Ping Zhu,Ping Zhu and Qiaoyan Wen,Some improved results on communication between information systems,12 pages,"Information Sciences, 180(18): 3521-3531, 2010",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To study the communication between information systems, Wang et al. [C. Wang,
C. Wu, D. Chen, Q. Hu, and C. Wu, Communicating between information systems,
Information Sciences 178 (2008) 3228-3239] proposed two concepts of type-1 and
type-2 consistent functions. Some properties of such functions and induced
relation mappings have been investigated there. In this paper, we provide an
improvement of the aforementioned work by disclosing the symmetric relationship
between type-1 and type-2 consistent functions. We present more properties of
consistent functions and induced relation mappings and improve upon several
deficient assertions in the original work. In particular, we unify and extend
type-1 and type-2 consistent functions into the so-called
neighborhood-consistent functions. This provides a convenient means for
studying the communication between information systems based on various
neighborhoods.
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2010 10:54:30 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Jul 2010 09:34:19 GMT'}]",2015-03-13,"[['Zhu', 'Ping', ''], ['Wen', 'Qiaoyan', '']]","['Consistent function', 'generalized approximation space', 'neighborhood', 'relation mapping', 'rough set']"
16163,1610.06343,Vincenzo Iovino,"Gina Gallegos-Garcia and Vincenzo Iovino and Alfredo Rial and Peter B.
  Roenne and Peter Y. A. Ryan","(Universal) Unconditional Verifiability in E-Voting without Trusted
  Parties",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In traditional e-voting protocols, privacy is often provided by a trusted
authority that learns the votes and computes the tally. Some protocols replace
the trusted authority by a set of authorities, and privacy is guaranteed if
less than a threshold number of authorities are corrupt. For verifiability,
stronger security guarantees are demanded. Typically, corrupt authorities that
try to fake the result of the tally must always be detected.
  To provide verifiability, many e-voting protocols use Non-Interactive
Zero-Knowledge proofs (NIZKs). Thanks to their non-interactive nature, NIZKs
allow anybody, including third parties that do not participate in the protocol,
to verify the correctness of the tally. Therefore, NIZKs can be used to obtain
universal verifiability. Additionally, NIZKs also improve usability because
they allow voters to cast a vote using a non-interactive protocol.
  The disadvantage of NIZKs is that their security is based on setup
assumptions such as the common reference string (CRS) or the random oracle (RO)
model. The former requires a trusted party for the generation of a common
reference string. The latter, though a popular methodology for designing secure
protocols, has been shown to be unsound.
  In this paper, we address the design of an e-voting protocol that provides
verifiability without any trust assumptions, where verifiability here is meant
without eligibility verification. We show that Non-Interactive
Witness-Indistinguishable proofs (NIWI) can be used for this purpose. The
e-voting scheme is private under the Decision Linear assumption, while
verifiability holds unconditionally. To our knowledge, this is the first
private e-voting scheme with perfect universal verifiability, i.e. one in which
the probability of a fake tally not being detected is 0, and with {\em
non-interactive} protocols that does not rely on trust assumptions.
","[{'version': 'v1', 'created': 'Thu, 20 Oct 2016 09:57:12 GMT'}]",2016-10-21,"[['Gallegos-Garcia', 'Gina', ''], ['Iovino', 'Vincenzo', ''], ['Rial', 'Alfredo', ''], ['Roenne', 'Peter B.', ''], ['Ryan', 'Peter Y. A.', '']]","['e-voting', 'verifiability', 'witness indistinguishability', 'bilinearmaps']"
16164,1310.0038,Rafael C. S. Schouery,"Cristina G. Fernandes, Carlos E. Ferreira, \'Alvaro J. P. Franco and
  Rafael C. S. Schouery",The Unit-Demand Envy-Free Pricing Problem,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the unit-demand envy-free pricing problem, which is a unit-demand
auction where each bidder receives an item that maximizes his utility, and the
goal is to maximize the auctioneer's profit. This problem is NP-hard and
unlikely to be in APX. We present four new MIP formulations for it and
experimentally compare them to a previous one due to Shioda, Tun\c{c}el, and
Myklebust. We describe three models to generate different random instances for
general unit-demand auctions, that we designed for the computational
experiments. Each model has a nice economic interpretation. Aiming
approximation results, we consider the variant of the problem where the item
prices are restricted to be chosen from a geometric series, and prove that an
optimal solution for this variant has value that is a fraction (depending on
the series used) of the optimal value of the original problem. So this variant
is also unlikely to be in APX.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2013 20:13:42 GMT'}]",2013-10-02,"[['Fernandes', 'Cristina G.', ''], ['Ferreira', 'Carlos E.', ''], ['Franco', 'Álvaro J. P.', ''], ['Schouery', 'Rafael C. S.', '']]","['pricing problem', 'envy-free allocations', 'unit-demand auctions']"
16165,1410.1237,Mahantesh Halappanavar,Hao Lu and Mahantesh Halappanavar and Ananth Kalyanaraman,Parallel Heuristics for Scalable Community Detection,Submitted to a journal,,,,cs.SI cs.DC physics.soc-ph,http://creativecommons.org/licenses/publicdomain/,"  Community detection has become a fundamental operation in numerous
graph-theoretic applications. It is used to reveal natural divisions that exist
within real world networks without imposing prior size or cardinality
constraints on the set of communities. Despite its potential for application,
there is only limited support for community detection on large-scale parallel
computers, largely owing to the irregular and inherently sequential nature of
the underlying heuristics. In this paper, we present parallelization heuristics
for fast community detection using the Louvain method as the serial template.
The Louvain method is an iterative heuristic for modularity optimization.
Originally developed by Blondel et al. in 2008, the method has become
increasingly popular owing to its ability to detect high modularity community
partitions in a fast and memory-efficient manner. However, the method is also
inherently sequential, thereby limiting its scalability. Here, we observe
certain key properties of this method that present challenges for its
parallelization, and consequently propose heuristics that are designed to break
the sequential barrier. For evaluation purposes, we implemented our heuristics
using OpenMP multithreading, and tested them over real world graphs derived
from multiple application domains (e.g., internet, citation, biological).
Compared to the serial Louvain implementation, our parallel implementation is
able to produce community outputs with a higher modularity for most of the
inputs tested, in comparable number or fewer iterations, while providing
absolute speedups of up to 16x using 32 threads.
","[{'version': 'v1', 'created': 'Mon, 6 Oct 2014 01:54:15 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Oct 2014 01:01:12 GMT'}]",2014-10-08,"[['Lu', 'Hao', ''], ['Halappanavar', 'Mahantesh', ''], ['Kalyanaraman', 'Ananth', '']]","['community detection', 'parallel graph heuristics', 'graph coloring', 'graph clustering']"
16166,1603.01536,Kamran Idrees,"Kamran Idrees, Tobias Fuchs, Colin W. Glass","Effective use of the PGAS Paradigm: Driving Transformations and
  Self-Adaptive Behavior in DASH-Applications","10 pages, 8 figures, Program Transformation for Programmability in
  Heterogeneous Architectures (PROHA) Workshop, held in conjunction with the
  International Symposium on Code Generation and Optimization (CGO) 2016",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  DASH is a library of distributed data structures and algorithms designed for
running the applications on modern HPC architectures, composed of hierarchical
network interconnections and stratified memory. DASH implements a PGAS
(partitioned global address space) model in the form of C++ templates, built on
top of DART -- a run-time system with an abstracted tier above existing
one-sided communication libraries.
  In order to facilitate the application development process for exploiting the
hierarchical organization of HPC machines, DART allows to reorder the placement
of the computational units. In this paper we present an automatic, hierarchical
units mapping technique (using a similar approach to the Hilbert curve
transformation) to reorder the placement of DART units on the Cray XC40 machine
Hazel Hen at HLRS. To evaluate the performance of new units mapping which takes
into the account the topology of allocated compute nodes, we perform latency
benchmark for a 3D stencil code. The technique of units mapping is generic and
can be be adopted in other DART communication substrates and on other hardware
platforms.
  Furthermore, high--level features of DASH are presented, enabling more
complex automatic transformations and optimizations in the future.
","[{'version': 'v1', 'created': 'Fri, 4 Mar 2016 17:03:33 GMT'}]",2016-03-07,"[['Idrees', 'Kamran', ''], ['Fuchs', 'Tobias', ''], ['Glass', 'Colin W.', '']]","['DASH', 'DART', 'PGAS', 'UPC', 'MPI', 'Self-Adaptation', 'Code Transformations']"
16167,1306.4748,Armin Eftekhari,Armin Eftekhari and Michael B. Wakin,"New Analysis of Manifold Embeddings and Signal Recovery from Compressive
  Measurements",arXiv admin note: substantial text overlap with arXiv:1002.1247,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Compressive Sensing (CS) exploits the surprising fact that the information
contained in a sparse signal can be preserved in a small number of compressive,
often random linear measurements of that signal. Strong theoretical guarantees
have been established concerning the embedding of a sparse signal family under
a random measurement operator and on the accuracy to which sparse signals can
be recovered from noisy compressive measurements. In this paper, we address
similar questions in the context of a different modeling framework. Instead of
sparse models, we focus on the broad class of manifold models, which can arise
in both parametric and non-parametric signal families. Using tools from the
theory of empirical processes, we improve upon previous results concerning the
embedding of low-dimensional manifolds under random measurement operators. We
also establish both deterministic and probabilistic instance-optimal bounds in
$\ell_2$ for manifold-based signal recovery and parameter estimation from noisy
compressive measurements. In line with analogous results for sparsity-based CS,
we conclude that much stronger bounds are possible in the probabilistic
setting. Our work supports the growing evidence that manifold-based models can
be used with high accuracy in compressive signal processing.
","[{'version': 'v1', 'created': 'Thu, 20 Jun 2013 03:37:39 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Apr 2014 12:24:09 GMT'}, {'version': 'v3', 'created': 'Wed, 30 Apr 2014 00:30:08 GMT'}, {'version': 'v4', 'created': 'Thu, 1 May 2014 12:26:33 GMT'}]",2014-05-02,"[['Eftekhari', 'Armin', ''], ['Wakin', 'Michael B.', '']]","['Manifolds', 'Compressive Sensing', 'dimensionality reduction', 'random projections', 'manifold embeddings', 'signal recovery', 'parameter estimation']"
16168,1603.00087,Santiago Escobar,"Sonia Santiago and Santiago Escobar and Catherine Meadows and Jos\'e
  Meseguer",Effective Sequential Protocol Composition in Maude-NPA,,,,,cs.CR cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Protocols do not work alone, but together, one protocol relying on another to
provide needed services. Many of the problems in cryptographic protocols arise
when such composition is done incorrectly or is not well understood. In this
paper we discuss an extension to the Maude-NPA syntax and its operational
semantics to support dynamic sequential composition of protocols, so that
protocols can be specified separately and composed when desired. This allows
one to reason about many different compositions with minimal changes to the
specification, as well as improving, in terms of both performance and ease of
specification, on an earlier composition extension we presented in [18]. We
show how compositions can be defined and executed symbolically in Maude-NPA
using the compositional syntax and semantics. We also provide an experimental
analysis of the performance of Maude-NPA using the compositional syntax and
semantics, and compare it to the performance of a syntax and semantics for
composition developed in earlier research. Finally, in the conclusion we give
some lessons learned about the best ways of extending narrowing-based state
reachability tools, as well as comparison with related work and future plans.
","[{'version': 'v1', 'created': 'Mon, 29 Feb 2016 23:12:24 GMT'}]",2016-03-02,"[['Santiago', 'Sonia', ''], ['Escobar', 'Santiago', ''], ['Meadows', 'Catherine', ''], ['Meseguer', 'José', '']]","['Cryptographic Protocols', 'Formal Verification of Secure Systems', 'Sequential Protocol Composition', 'ProtocolVerification', 'Maude-NPA']"
16169,1603.09200,Alejandro Betancourt,"Alejandro Betancourt, Natalia D\'iaz-Rodr\'iguez, Emilia Barakova,
  Lucio Marcenaro, Matthias Rauterberg, Carlo Regazzoni","Unsupervised Understanding of Location and Illumination Changes in
  Egocentric Videos",Submitted for publication,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wearable cameras stand out as one of the most promising devices for the
upcoming years, and as a consequence, the demand of computer algorithms to
automatically understand the videos recorded with them is increasing quickly.
An automatic understanding of these videos is not an easy task, and its mobile
nature implies important challenges to be faced, such as the changing light
conditions and the unrestricted locations recorded. This paper proposes an
unsupervised strategy based on global features and manifold learning to endow
wearable cameras with contextual information regarding the light conditions and
the location captured. Results show that non-linear manifold methods can
capture contextual patterns from global features without compromising large
computational resources. The proposed strategy is used, as an application case,
as a switching mechanism to improve the hand-detection problem in egocentric
videos.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2016 14:03:18 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Mar 2017 22:27:43 GMT'}]",2017-03-29,"[['Betancourt', 'Alejandro', ''], ['Díaz-Rodríguez', 'Natalia', ''], ['Barakova', 'Emilia', ''], ['Marcenaro', 'Lucio', ''], ['Rauterberg', 'Matthias', ''], ['Regazzoni', 'Carlo', '']]","['Machine Learning', 'Unsupervised Learning', 'Egocentric Videos', 'First Person Vision', 'Wearable Camera']"
16170,1802.07038,Uli Fahrenberg,Uli Fahrenberg,Higher-Dimensional Timed Automata,,,,,cs.LO cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a new formalism of higher-dimensional timed automata, based on
van Glabbeek's higher-dimensional automata and Alur's timed automata. We prove
that their reachability is PSPACE-complete and can be decided using zone-based
algorithms. We also show how to use tensor products to combat state-space
explosion and how to extend the setting to higher-dimensional hybrid automata.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 10:06:31 GMT'}]",2018-02-21,"[['Fahrenberg', 'Uli', '']]","['timed automata', 'higher-dimensional automata', 'real time', 'non-interleavingconcurrency', 'hybrid automata', 'state-space explosion']"
16171,1704.08292,Chenliang Xu,"Lele Chen, Sudhanshu Srivastava, Zhiyao Duan and Chenliang Xu",Deep Cross-Modal Audio-Visual Generation,,,,,cs.CV cs.MM cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cross-modal audio-visual perception has been a long-lasting topic in
psychology and neurology, and various studies have discovered strong
correlations in human perception of auditory and visual stimuli. Despite works
in computational multimodal modeling, the problem of cross-modal audio-visual
generation has not been systematically studied in the literature. In this
paper, we make the first attempt to solve this cross-modal generation problem
leveraging the power of deep generative adversarial training. Specifically, we
use conditional generative adversarial networks to achieve cross-modal
audio-visual generation of musical performances. We explore different encoding
methods for audio and visual signals, and work on two scenarios:
instrument-oriented generation and pose-oriented generation. Being the first to
explore this new problem, we compose two new datasets with pairs of images and
sounds of musical performances of different instruments. Our experiments using
both classification and human evaluations demonstrate that our model has the
ability to generate one modality, i.e., audio/visual, from the other modality,
i.e., visual/audio, to a good extent. Our experiments on various design choices
along with the datasets will facilitate future research in this new problem
space.
","[{'version': 'v1', 'created': 'Wed, 26 Apr 2017 18:46:10 GMT'}]",2017-04-28,"[['Chen', 'Lele', ''], ['Srivastava', 'Sudhanshu', ''], ['Duan', 'Zhiyao', ''], ['Xu', 'Chenliang', '']]","['cross-modal generation', 'audio-visual', 'generative adversarial networks']"
16172,1306.0393,Yuyi Wang,"Yuyi Wang, Jan Ramon and Zheng-Chu Guo",Learning from networked examples in a k-partite graph,a special case,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many machine learning algorithms are based on the assumption that training
examples are drawn independently. However, this assumption does not hold
anymore when learning from a networked sample where two or more training
examples may share common features. We propose an efficient weighting method
for learning from networked examples and show the sample error bound which is
better than previous work.
","[{'version': 'v1', 'created': 'Mon, 3 Jun 2013 13:10:35 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Jul 2013 15:18:16 GMT'}, {'version': 'v3', 'created': 'Sat, 18 Feb 2017 00:34:19 GMT'}]",2017-02-21,"[['Wang', 'Yuyi', ''], ['Ramon', 'Jan', ''], ['Guo', 'Zheng-Chu', '']]","['Learning theory', 'Networked examples', 'Non-independent sample', 'Sample error', 'Generalizationbound']"
16173,1501.00687,Ahmad Hassanat,"Mouhammd Alkasassbeh, Ghada A. Altarawneh, Ahmad B. A. Hassanat","On Enhancing The Performance Of Nearest Neighbour Classifiers Using
  Hassanat Distance Metric","Canadian Journal of Pure and Applied Sciences (CJPAS). volume 9,
  issue 1, Feb 2015",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We showed in this work how the Hassanat distance metric enhances the
performance of the nearest neighbour classifiers. The results demonstrate the
superiority of this distance metric over the traditional and most-used
distances, such as Manhattan distance and Euclidian distance. Moreover, we
proved that the Hassanat distance metric is invariant to data scale, noise and
outliers. Throughout this work, it is clearly notable that both ENN and IINC
performed very well with the distance investigated, as their accuracy increased
significantly by 3.3% and 3.1% respectively, with no significant advantage of
the ENN over the IINC in terms of accuracy. Correspondingly, it can be noted
from our results that there is no optimal algorithm that can solve all
real-life problems perfectly; this is supported by the no-free-lunch theorem
","[{'version': 'v1', 'created': 'Sun, 4 Jan 2015 15:37:20 GMT'}]",2015-01-06,"[['Alkasassbeh', 'Mouhammd', ''], ['Altarawneh', 'Ghada A.', ''], ['Hassanat', 'Ahmad B. A.', '']]","['Nearest Neighbour classifier', 'Supervised Learning', 'similarity measures', 'metric']"
16174,1208.0577,Daniel Kharitonov,Daniel Kharitonov,Green Telecom Metrics in Perspective,Preprint submitted to APCC 2012 conference,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A fast and parallel evolution of ways to measure and assess energy efficiency
in telecom has resulted in an entangled web of drafts and recommendations
originating from government, research, and standards organizations. This paper
focuses primarily on so-called ""large network equipment"" metrics and intends to
capture state-of-the-art in this area of green communications. Competing
approaches towards efficiency assessment are studied for their applicability
and completeness, with special emphasis on topics relevant to future subject
studies
","[{'version': 'v1', 'created': 'Thu, 2 Aug 2012 19:19:40 GMT'}]",2012-08-03,"[['Kharitonov', 'Daniel', '']]","['component green', 'routing', 'telecom', 'metrics']"
16175,1409.3092,Weitao Xu,"Weitao Xu, Dongfeng Yuan, Liangfei Xue","Design and Implementation of Intelligent Community System Based on Thin
  Client and Cloud Computing",,,,,cs.CY cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the continuous development of science and technology, the intelligent
development of community system becomes a trend. Meanwhile, smart mobile
devices and cloud computing technology are increasingly used in intelligent
information systems; however, smart mobile devices such as smartphone and smart
pad, also known as thin clients, limited by either their capacities (CPU,
memory or battery) or their network resources, do not always meet users'
satisfaction in using mobile services. Mobile cloud computing, in which
resource-rich virtual machines of smart mobile device are provided to a
customer as a service, can be terrific solution for expanding the limitation of
real smart mobile device, but the resources utilization rate is low and the
information cannot be shared easily. To address the problems above, this paper
proposes an information system for intelligent community, which is composed of
thin clients, wide band network and cloud computing servers. On one hand, the
thin clients with the characteristics of energy efficiency, high robustness and
high computing capacity can efficiently avoid the problems encountered in the
PC architecture and mobile devices. On the other hand, the cloud computing
servers in the proposed information system solve the problems of resource
sharing barriers. Finally, the system is built in real environments to evaluate
the performance. We deploy the proposed system in a community with more than
2000 residents, and it is demonstrated that the proposed system is robust and
efficient.
","[{'version': 'v1', 'created': 'Wed, 10 Sep 2014 14:46:14 GMT'}]",2014-09-11,"[['Xu', 'Weitao', ''], ['Yuan', 'Dongfeng', ''], ['Xue', 'Liangfei', '']]","['Intelligent Community System', 'Thin client', 'Cloud Computing', 'Virtualization', 'Distributed File System']"
16176,1208.5526,Serhat Avci,Serhat Nazim Avci and and Ender Ayanoglu,Coded Path Protection Part 1: Efficient Conversion of Sharing to Coding,"This is the Part 1 of a two part paper. Simpler version of these two
  papers are published in the proceedings of IEEE ICC 2012",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Link failures in wide area networks are common and cause significant data
losses. Mesh-based protection schemes offer high capacity efficiency but they
are slow and require complex signaling. Additionally, real-time
reconfigurations of cross-connects threaten their transmission integrity. On
the other hand, there are other schemes that are proactive. Proactivity results
in higher restoration speed, lower signaling complexity, and higher
transmission integrity. This paper introduces a coding-based proactive
protection scheme, named Coded Path Protection (CPP). In CPP, a backup stream
of the primary data is encoded with other data streams, resulting in capacity
savings. In addition to a systematic approach of building valid coding
structures, this paper presents an optimal and simple capacity placement and
coding group formation algorithm. The algorithm converts the sharing structure
of any solution of a Shared Path Protection (SPP) technique into a coding
structure with minimum extra capacity. We conducted quantitative and
qualitative comparisons of our technique with the SPP. Simulation results
confirm that CPP provides faster link failure recovery than SPP while it incurs
marginal extra capacity beyond that of SPP. In this Part 1 of the paper, we
describe the theory and an algorithm for converting a given SPP solution into a
CPP solution.
","[{'version': 'v1', 'created': 'Mon, 27 Aug 2012 22:46:59 GMT'}]",2012-08-29,"[['Avci', 'Serhat Nazim', ''], ['Ayanoglu', 'and Ender', '']]","['Networks', 'network fault tolerance', 'codes', 'sharedpath protection', 'network coding']"
16177,1203.1715,Dohy Hong,Dohy Hong,D-iteration: Evaluation of a Dynamic Partition Strategy,9 pages,,,,cs.DC math.DS math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of this paper is to present a first evaluation of a dynamic partition
strategy associated to the recently proposed asynchronous distributed
computation scheme based on the D-iteration approach. The D-iteration is a
fluid diffusion point of view based iteration method to solve numerically
linear equations. Using a simple static partition strategy, it has been shown
that, when the computation is distributed over K virtual machines (PIDs), the
memory size to be handled by each virtual machine decreases linearly with K and
the computation speed increases almost linearly with K with a slope becoming
closer to one when the number N of linear equations to be solved increases.
Here, we want to evaluate how further those results can be improved when a
simple dynamic partition strategy is deployed and to show that the dynamic
partition strategy allows one to control and equalize the computation load
between PIDs without any deep analysis of the matrix or of the underlying graph
structure.
","[{'version': 'v1', 'created': 'Thu, 8 Mar 2012 09:18:46 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Mar 2012 10:17:25 GMT'}]",2012-03-13,"[['Hong', 'Dohy', '']]","['Distributed computation', 'Iteration', 'Fixed point', 'Eigenvector']"
16178,1606.02514,Luis Espinosa-Anke,"Luis Espinosa-Anke, Roberto Carlini, Horacio Saggion, Francesco
  Ronzano",DefExt: A Semi Supervised Definition Extraction Tool,"GLOBALEX 2016 Lexicographic Resources for Human Language Technology
  Workshop Programme (p. 24) (2016, May)",,,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  We present DefExt, an easy to use semi supervised Definition Extraction Tool.
DefExt is designed to extract from a target corpus those textual fragments
where a term is explicitly mentioned together with its core features, i.e. its
definition. It works on the back of a Conditional Random Fields based
sequential labeling algorithm and a bootstrapping approach. Bootstrapping
enables the model to gradually become more aware of the idiosyncrasies of the
target corpus. In this paper we describe the main components of the toolkit as
well as experimental results stemming from both automatic and manual
evaluation. We release DefExt as open source along with the necessary files to
run it in any Unix machine. We also provide access to training and test data
for immediate use.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2016 11:22:12 GMT'}]",2016-06-09,"[['Espinosa-Anke', 'Luis', ''], ['Carlini', 'Roberto', ''], ['Saggion', 'Horacio', ''], ['Ronzano', 'Francesco', '']]","['lexicography', 'definition extraction', 'bootstrapping']"
16179,1702.03772,Lu Lu,"Lu Lu, Haiquan Zhao","Adaptive beamforming method based on recursive maximum correntropy in
  impulsive noise with alpha-stable process",arXiv admin note: substantial text overlap with arXiv:1701.08407,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As a well-established adaptation criterion, the maximum correntropy criterion
(MCC) has been receiving increasing attention due to its robust against
outliers. In this paper, a new complex recursive maximum correntropy (CRMC)
algorithm without any priori information on the noise characteristics, is
proposed under the MCC. The proposed algorithm is useful for adaptive
beamforming, when the desired signal is contaminated by the impulsive noises.
Moreover, the analysis of convergence property of the CRMC algorithm is
performed. The results obtained from simulation study establish the
effectiveness of this new beamformer.
","[{'version': 'v1', 'created': 'Mon, 12 Dec 2016 05:55:00 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Feb 2017 19:55:29 GMT'}]",2017-02-27,"[['Lu', 'Lu', ''], ['Zhao', 'Haiquan', '']]","['maximum correntropy', 'recursive algorithm', 'adaptive beamforming', 'impulsive noise']"
16180,1106.5571,David Prochazka,"David Prochazka, Michael Stencl, Ondrej Popelka and Jiri Stastny",Mobile Augmented Reality Applications,,"Proceedings of Mendel 2011: 17th International Conference on Soft
  Computing, pp. 469-476, ISBN 978-80-214-4302-0",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Augmented reality have undergone considerable improvement in past years. Many
special techniques and hardware devices were developed, but the crucial
breakthrough came with the spread of intelligent mobile phones. This enabled
mass spread of augmented reality applications. However mobile devices have
limited hardware capabilities, which narrows down the methods usable for scene
analysis. In this article we propose an augmented reality application which is
using cloud computing to enable using of more complex computational methods
such as neural networks. Our goal is to create an affordable augmented reality
application suitable which will help car designers in by 'virtualizing' car
modifications.
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2011 06:08:38 GMT'}]",2011-06-29,"[['Prochazka', 'David', ''], ['Stencl', 'Michael', ''], ['Popelka', 'Ondrej', ''], ['Stastny', 'Jiri', '']]","['Augmented Reality', 'Image Processing', 'Marker', 'Neural Network', 'Mobile Devices']"
16181,0909.1780,Luc Bouganim,"Luc Bouganim (INRIA), Bj\""orn J\'onsson (Reykjav\'ik University),
  Philippe Bonnet (Department of Computer Science, University of Copenhagen)",uFLIP: Understanding Flash IO Patterns,CIDR 2009,,,,cs.PF,http://creativecommons.org/licenses/by/3.0/,"  Does the advent of flash devices constitute a radical change for secondary
storage? How should database systems adapt to this new form of secondary
storage? Before we can answer these questions, we need to fully understand the
performance characteristics of flash devices. More specifically, we want to
establish what kind of IOs should be favored (or avoided) when designing
algorithms and architectures for flash-based systems. In this paper, we focus
on flash IO patterns, that capture relevant distribution of IOs in time and
space, and our goal is to quantify their performance. We define uFLIP, a
benchmark for measuring the response time of flash IO patterns. We also present
a benchmarking methodology which takes into account the particular
characteristics of flash devices. Finally, we present the results obtained by
measuring eleven flash devices, and derive a set of design hints that should
drive the development of flash-based systems on current devices.
","[{'version': 'v1', 'created': 'Wed, 9 Sep 2009 18:10:26 GMT'}]",2009-09-15,"[['Bouganim', 'Luc', '', 'INRIA'], ['Jónsson', 'Björn', '', 'Reykjavík University'], ['Bonnet', 'Philippe', '', 'Department of Computer Science, University of Copenhagen']]","['Flash devices', 'benchmarking', 'methodology', 'uFLIP']"
16182,1507.00980,C\'esar Rodr\'iguez,"C\'esar Rodr\'iguez, Marcelo Sousa, Subodh Sharma, Daniel Kroening",Unfolding-based Partial Order Reduction,"Long version of a paper with the same title appeared on the
  proceedings of CONCUR 2015",,,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Partial order reduction (POR) and net unfoldings are two alternative methods
to tackle state-space explosion caused by concurrency. In this paper, we
propose the combination of both approaches in an effort to combine their
strengths. We first define, for an abstract execution model, unfolding
semantics parameterized over an arbitrary independence relation. Based on it,
our main contribution is a novel stateless POR algorithm that explores at most
one execution per Mazurkiewicz trace, and in general, can explore exponentially
fewer, thus achieving a form of super-optimality. Furthermore, our
unfolding-based POR copes with non-terminating executions and incorporates
state-caching. Over benchmarks with busy-waits, among others, our experiments
show a dramatic reduction in the number of executions when compared to a
state-of-the-art DPOR.
","[{'version': 'v1', 'created': 'Fri, 3 Jul 2015 18:23:13 GMT'}]",2015-07-06,"[['Rodríguez', 'César', ''], ['Sousa', 'Marcelo', ''], ['Sharma', 'Subodh', ''], ['Kroening', 'Daniel', '']]","['Partial-order reduction', 'unfoldings', 'concurrency', 'model checking']"
16183,1403.6863,Marcus Hutter,Joel Veness and Marcus Hutter,Online Learning of k-CNF Boolean Functions,20 LaTeX pages. 2 Algorithms. Some Theorems,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper revisits the problem of learning a k-CNF Boolean function from
examples in the context of online learning under the logarithmic loss. In doing
so, we give a Bayesian interpretation to one of Valiant's celebrated PAC
learning algorithms, which we then build upon to derive two efficient, online,
probabilistic, supervised learning algorithms for predicting the output of an
unknown k-CNF Boolean function. We analyze the loss of our methods, and show
that the cumulative log-loss can be upper bounded, ignoring logarithmic
factors, by a polynomial function of the size of each example.
","[{'version': 'v1', 'created': 'Wed, 26 Mar 2014 21:17:05 GMT'}]",2014-03-28,"[['Veness', 'Joel', ''], ['Hutter', 'Marcus', '']]","['k-CNF', 'Online Learning', 'Logarithmic Loss']"
16184,0908.1186,Grenville Croll,Patrick O'Beirne,Checks and Controls in Spreadsheets,7 Pages,"Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2009 1-7 ISBN
  978-1-905617-89-0",,,cs.HC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spreadsheets that are informally created are harder to test than they should
be. Simple cross-foot checks or being easily readable are modest but attainable
goals for every spreadsheet developer. This paper lists some tips on building
self-checking into a spreadsheet in order to provide more confidence to the
reader that a spreadsheet is robust.
","[{'version': 'v1', 'created': 'Sat, 8 Aug 2009 20:38:12 GMT'}]",2009-08-11,"[[""O'Beirne"", 'Patrick', '']]","['spreadsheets', 'spreadsheet errors', 'quality', 'end-user computing', 'visualisation', 'data integrity', 'auditing software']"
16185,1704.05347,Zeljko Agic,\v{Z}eljko Agi\'c and Natalie Schluter,Baselines and test data for cross-lingual inference,To appear at LREC 2018,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The recent years have seen a revival of interest in textual entailment,
sparked by i) the emergence of powerful deep neural network learners for
natural language processing and ii) the timely development of large-scale
evaluation datasets such as SNLI. Recast as natural language inference, the
problem now amounts to detecting the relation between pairs of statements: they
either contradict or entail one another, or they are mutually neutral. Current
research in natural language inference is effectively exclusive to English. In
this paper, we propose to advance the research in SNLI-style natural language
inference toward multilingual evaluation. To that end, we provide test data for
four major languages: Arabic, French, Spanish, and Russian. We experiment with
a set of baselines. Our systems are based on cross-lingual word embeddings and
machine translation. While our best system scores an average accuracy of just
over 75%, we focus largely on enabling further research in multilingual
inference.
","[{'version': 'v1', 'created': 'Tue, 18 Apr 2017 14:12:37 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Mar 2018 18:24:49 GMT'}]",2018-03-05,"[['Agić', 'Željko', ''], ['Schluter', 'Natalie', '']]","['natural language inference', 'cross-lingual methods', 'test data']"
16186,1307.7172,Brian Keegan,"Brian Keegan, Dan Horn, Thomas A. Finholt, Joseph ""Jofish"" Kaye","Structure and Dynamics of Coauthorship, Citation, and Impact within CSCW",14 pages; 14 figures,,,,cs.DL cs.SI physics.soc-ph,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  CSCW has stabilized as an interdisciplinary venue for computer, information,
cognitive, and social scientists but has also undergone significant changes in
its format in recent years. This paper uses methods from social network
analysis and bibliometrics to re-examine the structures of CSCW a decade after
its last systematic analysis. Using data from the ACM Digital Library, we
analyze changes in structures of coauthorship and citation between 1986 and
2013. Statistical models reveal significant but distinct patterns between
papers and authors in how brokerage and closure in these networks affects
impact as measured by citations and downloads. Specifically, impact is unduly
influenced by structural position, such that ideas introduced by those in the
core of the CSCW community (e.g., elite researchers) are advantaged over those
introduced by peripheral participants (e.g., newcomers). This finding is
examined in the context of recent changes to the CSCW conference that may have
the effect of upsetting the preference for contributions from the core.
","[{'version': 'v1', 'created': 'Fri, 26 Jul 2013 21:28:15 GMT'}, {'version': 'v2', 'created': 'Wed, 31 Jul 2013 19:35:24 GMT'}]",2013-08-01,"[['Keegan', 'Brian', ''], ['Horn', 'Dan', ''], ['Finholt', 'Thomas A.', ''], ['Kaye', 'Joseph ""Jofish""', '']]","['Social network analysis', 'citation network', 'coauthorshipnetwork', 'brokerage', 'closure', 'bibliometrics', 'social capital']"
16187,1205.5504,Hayato Takahashi,Hayato Takahashi,Algorithmic randomness and stochastic selection function,"submitted to CCR2012 special issue. arXiv admin note: text overlap
  with arXiv:1106.3153",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show algorithmic randomness versions of the two classical theorems on
subsequences of normal numbers. One is Kamae-Weiss theorem (Kamae 1973) on
normal numbers, which characterize the selection function that preserves normal
numbers. Another one is the Steinhaus (1922) theorem on normal numbers, which
characterize the normality from their subsequences. In van Lambalgen (1987), an
algorithmic analogy to Kamae-Weiss theorem is conjectured in terms of
algorithmic randomness and complexity. In this paper we consider two types of
algorithmic random sequence; one is ML-random sequences and the other one is
the set of sequences that have maximal complexity rate. Then we show
algorithmic randomness versions of corresponding theorems to the above
classical results.
","[{'version': 'v1', 'created': 'Thu, 24 May 2012 17:07:34 GMT'}, {'version': 'v2', 'created': 'Fri, 25 May 2012 07:55:16 GMT'}, {'version': 'v3', 'created': 'Thu, 28 Mar 2013 11:54:25 GMT'}, {'version': 'v4', 'created': 'Thu, 31 Dec 2015 10:33:40 GMT'}]",2016-01-01,"[['Takahashi', 'Hayato', '']]","['algorithmic randomness', 'normal number', 'subsequence']"
16188,1004.1747,Rdv Ijcsis,Samidha Dwivedi Sharma and Dr. R. S. Kasana,Mobile Database System: Role of Mobility on the Query Processing,"IEEE Publication format, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","IJCSIS, Vol. 7 No. 3, March 2010, 211-216",,,cs.DB,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The rapidly expanding technology of mobile communication will give mobile
users capability of accessing information from anywhere and any time. The
wireless technology has made it possible to achieve continuous connectivity in
mobile environment. When the query is specified as continuous, the requesting
mobile user can obtain continuously changing result. In order to provide
accurate and timely outcome to requesting mobile user, the locations of moving
object has to be closely monitored. The objective of paper is to discuss the
problem related to the role of personal and terminal mobility and query
processing in the mobile environment.
","[{'version': 'v1', 'created': 'Sat, 10 Apr 2010 22:23:27 GMT'}]",2010-04-13,"[['Sharma', 'Samidha Dwivedi', ''], ['Kasana', 'Dr. R. S.', '']]","['Mobile  Computing', 'Mobile  Database', 'Location']"
16189,1605.00303,Tommaso Mansi,"Dominik Neumann, Tommaso Mansi, Lucian Itu, Bogdan Georgescu, Elham
  Kayvanpour, Farbod Sedaghat-Hamedani, Ali Amr, Jan Haas, Hugo Katus, Benjamin
  Meder, Stefan Steidl, Joachim Hornegger, Dorin Comaniciu","A Self-Taught Artificial Agent for Multi-Physics Computational Model
  Personalization","Submitted to Medical Image Analysis, Elsevier",,,,cs.CE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Personalization is the process of fitting a model to patient data, a critical
step towards application of multi-physics computational models in clinical
practice. Designing robust personalization algorithms is often a tedious,
time-consuming, model- and data-specific process. We propose to use artificial
intelligence concepts to learn this task, inspired by how human experts
manually perform it. The problem is reformulated in terms of reinforcement
learning. In an off-line phase, Vito, our self-taught artificial agent, learns
a representative decision process model through exploration of the
computational model: it learns how the model behaves under change of
parameters. The agent then automatically learns an optimal strategy for on-line
personalization. The algorithm is model-independent; applying it to a new model
requires only adjusting few hyper-parameters of the agent and defining the
observations to match. The full knowledge of the model itself is not required.
Vito was tested in a synthetic scenario, showing that it could learn how to
optimize cost functions generically. Then Vito was applied to the inverse
problem of cardiac electrophysiology and the personalization of a whole-body
circulation model. The obtained results suggested that Vito could achieve
equivalent, if not better goodness of fit than standard methods, while being
more robust (up to 11% higher success rates) and with faster (up to seven
times) convergence rate. Our artificial intelligence approach could thus make
personalization algorithms generalizable and self-adaptable to any patient and
any model.
","[{'version': 'v1', 'created': 'Sun, 1 May 2016 20:19:25 GMT'}]",2016-05-03,"[['Neumann', 'Dominik', ''], ['Mansi', 'Tommaso', ''], ['Itu', 'Lucian', ''], ['Georgescu', 'Bogdan', ''], ['Kayvanpour', 'Elham', ''], ['Sedaghat-Hamedani', 'Farbod', ''], ['Amr', 'Ali', ''], ['Haas', 'Jan', ''], ['Katus', 'Hugo', ''], ['Meder', 'Benjamin', ''], ['Steidl', 'Stefan', ''], ['Hornegger', 'Joachim', ''], ['Comaniciu', 'Dorin', '']]","['Computational Modeling', 'Model Personalization', 'Reinforcement Learning', 'Artificial Intelligence']"
16190,1504.08096,Kenza Guenda,"K. Chatouh, K. Guenda, T.A.Gulliver and L. Noui","On Some Classes of $\mathbb{Z}_{2}\mathbb{Z}_{4}-$Linear Codes and their
  Covering Radius",arXiv admin note: text overlap with arXiv:1411.1822 by other authors,,,,cs.IT math.IT,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper we define $\mathbb{Z}_{2}\mathbb{Z}_{4}-$Simplex and MacDonald
Codes of type $\alpha $ and $\beta $ and we give the covering radius of these
codes.
","[{'version': 'v1', 'created': 'Thu, 30 Apr 2015 07:04:06 GMT'}]",2015-05-01,"[['Chatouh', 'K.', ''], ['Guenda', 'K.', ''], ['Gulliver', 'T. A.', ''], ['Noui', 'L.', '']]","['Simplex codes', 'MacDonald codes', 'Covering radius', 'Gray map']"
16191,1610.02443,Sachin Mehta,"Sachin Mehta, Balakrishnan Prabhakaran, Rajarathnam Nallusamy, Derrick
  Newton","mPDF: Framework for Watermarking PDF Files using Image Watermarking
  Algorithms",20 pages,,,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The advancement in digital technologies have made it possible to produce
perfect copies of digital content. In this environment, malicious users
reproduce the digital content and share it without compensation to the content
owner. Content owners are concerned about the potential loss of revenue and
reputation from piracy, especially when the content is available over the
Internet. Digital watermarking has emerged as a deterrent measure towards such
malicious activities. Several methods have been proposed for copyright
protection and fingerprinting of digital images. However, these methods are not
applicable to text documents as these documents lack rich texture information
which is abundantly available in digital images. In this paper, a framework
(mPDF) is proposed which facilitates the usage of digital image watermarking
algorithms on text documents. The proposed method divides a text document into
texture and non-texture blocks using an energy-based approach. After
classification, a watermark is embedded inside the texture blocks in a content
adaptive manner. The proposed method is integrated with five known image
watermarking methods and its performance is studied in terms of quality and
robustness. Experiments are conducted on documents in 11 different languages.
Experimental results clearly show that the proposed method facilitates the
usage of image watermarking algorithms on text documents and is robust against
attacks such as print & scan, print screen, and skew. Also, the proposed method
overcomes the drawbacks of existing text watermarking methods such as manual
inspection and language dependency.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2016 23:06:09 GMT'}]",2016-10-11,"[['Mehta', 'Sachin', ''], ['Prabhakaran', 'Balakrishnan', ''], ['Nallusamy', 'Rajarathnam', ''], ['Newton', 'Derrick', '']]","['Watermarking', 'Text Documents', 'PDF', 'Data Hiding', 'Print Screen']"
16192,1111.1090,Aman Chadha Mr.,"Divya Jyoti, Aman Chadha, Pallavi Vaidya, and M. Mani Roja","A robust, low-cost approach to Face Detection and Face Recognition","discrete wavelet transform, face detection, face recognition, person
  identification","CiiT International Journal of Digital Image Processing, Vol. 15,
  No. 10, October 2011, ISSN 0974 - 9691 (Print) & ISSN 0974 - 9586 (Online)",,,cs.CV cs.CR eess.IV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the domain of Biometrics, recognition systems based on iris, fingerprint
or palm print scans etc. are often considered more dependable due to extremely
low variance in the properties of these entities with respect to time. However,
over the last decade data processing capability of computers has increased
manifold, which has made real-time video content analysis possible. This shows
that the need of the hour is a robust and highly automated Face Detection and
Recognition algorithm with credible accuracy rate. The proposed Face Detection
and Recognition system using Discrete Wavelet Transform (DWT) accepts face
frames as input from a database containing images from low cost devices such as
VGA cameras, webcams or even CCTV's, where image quality is inferior. Face
region is then detected using properties of L*a*b* color space and only Frontal
Face is extracted such that all additional background is eliminated. Further,
this extracted image is converted to grayscale and its dimensions are resized
to 128 x 128 pixels. DWT is then applied to entire image to obtain the
coefficients. Recognition is carried out by comparison of the DWT coefficients
belonging to the test image with those of the registered reference image. On
comparison, Euclidean distance classifier is deployed to validate the test
image from the database. Accuracy for various levels of DWT Decomposition is
obtained and hence, compared.
","[{'version': 'v1', 'created': 'Fri, 4 Nov 2011 10:36:43 GMT'}]",2020-09-03,"[['Jyoti', 'Divya', ''], ['Chadha', 'Aman', ''], ['Vaidya', 'Pallavi', ''], ['Roja', 'M. Mani', '']]","['discrete wavelet transform', 'face detection', 'face recognition', 'person identification']"
16193,1205.4067,Cristiano Torezzan,"Cristiano Torezzan, Jo\~ao E. Strapasson, Sueli I. R. Costa and
  Rogerio M. Siqueira",Optimum Commutative Group Codes,,,,,cs.IT math.GR math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A method for finding an optimum $n$-dimensional commutative group code of a
given order $M$ is presented. The approach explores the structure of lattices
related to these codes and provides a significant reduction in the number of
non-isometric cases to be analyzed. The classical factorization of matrices
into Hermite and Smith normal forms and also basis reduction of lattices are
used to characterize isometric commutative group codes. Several examples of
optimum commutative group codes are also presented.
","[{'version': 'v1', 'created': 'Fri, 18 May 2012 01:14:44 GMT'}, {'version': 'v2', 'created': 'Sat, 23 Mar 2013 18:04:02 GMT'}]",2013-03-26,"[['Torezzan', 'Cristiano', ''], ['Strapasson', 'João E.', ''], ['Costa', 'Sueli I. R.', ''], ['Siqueira', 'Rogerio M.', '']]","['Group Codes', 'Hermite Normal Form', 'Lattices', 'Spherical Codes']"
16194,1710.04628,Sebastian Enqvist,Sebastian Enqvist,Flat modal fixpoint logics with the converse modality,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove a generic completeness result for a class of modal fixpoint logics
corresponding to flat fragments of the two-way mu-calculus, extending earlier
work by Santocanale and Venema. We observe that Santocanale and Venema's proof
that least fixpoints in the Lindenbaum-Tarski algebra of certain flat fixpoint
logics are constructive, using finitary adjoints, no longer works when the
converse modality is introduced. Instead, our completeness proof directly
constructs a model for a consistent formula, using the induction rule in a way
that is similar to the standard completeness proof for propositional dynamic
logic. This approach is combined with the concept of a focus, which has
previously been used in tableau based reasoning for modal fixpoint logics.
","[{'version': 'v1', 'created': 'Thu, 12 Oct 2017 17:28:47 GMT'}]",2017-10-13,"[['Enqvist', 'Sebastian', '']]","['Modal fixpoint logic', 'mu-calculus', 'converse modality', 'completeness', 'network']"
16195,1002.2202,Rdv Ijcsis,"Ramesh Kumar Gopala Pillai, Dr. Ramakanth Kumar .P",Modeling of Human Criminal Behavior using Probabilistic Networks,"IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS January 2010, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 7, No. 1, pp. 216-219, January 2010, USA",,"Journal of Computer Science, ISSN 19475500",cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Currently, criminals profile (CP) is obtained from investigators or forensic
psychologists interpretation, linking crime scene characteristics and an
offenders behavior to his or her characteristics and psychological profile.
This paper seeks an efficient and systematic discovery of nonobvious and
valuable patterns between variables from a large database of solved cases via a
probabilistic network (PN) modeling approach. The PN structure can be used to
extract behavioral patterns and to gain insight into what factors influence
these behaviors. Thus, when a new case is being investigated and the profile
variables are unknown because the offender has yet to be identified, the
observed crime scene variables are used to infer the unknown variables based on
their connections in the structure and the corresponding numerical
(probabilistic) weights. The objective is to produce a more systematic and
empirical approach to profiling, and to use the resulting PN model as a
decision tool.
","[{'version': 'v1', 'created': 'Wed, 10 Feb 2010 20:21:52 GMT'}]",2010-02-11,"[['Pillai', 'Ramesh Kumar Gopala', ''], ['P', 'Dr. Ramakanth Kumar .', '']]","['component; Modeling', 'criminal profiling', 'criminal behavior', 'probabilistic network', 'Bayes Rule']"
16196,1307.1179,Andrew Trotman,"Andrew Trotman, Jinglan Zhang",Future Web Growth and its Consequences for Web Search Architectures,,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Introduction: Before embarking on the design of any computer system it is
first necessary to assess the magnitude of the problem. In the case of a web
search engine this assessment amounts to determining the current size of the
web, the growth rate of the web, and the quantity of computing resource
necessary to search it, and projecting the historical growth of this into the
future. Method: The over 20 year history of the web makes it possible to make
short-term projections on future growth. The longer history of hard disk drives
(and smart phone memory card) makes it possible to make short-term hardware
projections. Analysis: Historical data on Internet uptake and hardware growth
is extrapolated. Results: It is predicted that within a decade the storage
capacity of a single hard drive will exceed the size of the index of the web at
that time. Within another decade it will be possible to store the entire
searchable text on the same hard drive. Within another decade the entire
searchable web (including images) will also fit. Conclusion: This result raises
questions about the future architecture of search engines. Several new models
are proposed. In one model the user's computer is an active part of the
distributed search architecture. They search a pre-loaded snapshot (back-file)
of the web on their local device which frees up the online data centre for
searching just the difference between the snapshot and the current time.
Advantageously this also makes it possible to search when the user is
disconnected from the Internet. In another model all changes to all files are
broadcast to all users (forming a star-like network) and no data centre is
needed.
","[{'version': 'v1', 'created': 'Thu, 4 Jul 2013 00:38:41 GMT'}]",2013-07-05,"[['Trotman', 'Andrew', ''], ['Zhang', 'Jinglan', '']]","['Internet information systems', 'electronic information', 'search engines', 'indexing', 'information retrieval', 'history']"
16197,1702.00837,Juan Biondi,"Juan Biondi, Gerardo Fernandez, Silvia Castro, Osvaldo Agamennoni",Eye-Movement behavior identification for AD diagnosis,,,,,cs.NE q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the present work, we develop a deep-learning approach for differentiating
the eye-movement behavior of people with neurodegenerative diseases over
healthy control subjects during reading well-defined sentences. We define an
information compaction of the eye-tracking data of subjects without and with
probable Alzheimer's disease when reading a set of well-defined, previously
validated, sentences including high-, low-predictable sentences, and proverbs.
Using this information we train a set of denoising sparse-autoencoders and
build a deep neural network with these and a softmax classifier. Our results
are very promising and show that these models may help to understand the
dynamics of eye movement behavior and its relationship with underlying
neuropsychological correlates.
","[{'version': 'v1', 'created': 'Thu, 2 Feb 2017 21:47:02 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Feb 2017 15:08:34 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Jan 2018 13:14:23 GMT'}]",2018-01-16,"[['Biondi', 'Juan', ''], ['Fernandez', 'Gerardo', ''], ['Castro', 'Silvia', ''], ['Agamennoni', 'Osvaldo', '']]","['Eye-tracking', 'Deep-learning', 'Alzheimer’s Disease']"
16198,1705.07024,Irina Georgescu,"Irina Georgescu, Ana Maria Lucia Casademunt",Optimal prevention with possibilistic and mixed background risk,,,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper the effect of posibilistic or mixed background risk on the
level of optimal prevention is studied. In the framework of five purely
possibilistic or mixed models, necessary and sufficient conditions are found
such that the level of optimal saving decreases or increases as a result of the
actions of various types of background risk. This way our results complete
those obtained by Courbage and Rey for some prevention models with
probabilistic background risk.
","[{'version': 'v1', 'created': 'Fri, 19 May 2017 14:41:56 GMT'}]",2017-05-22,"[['Georgescu', 'Irina', ''], ['Casademunt', 'Ana Maria Lucia', '']]","['possibilistic background risk', 'optimal prevention', 'optimal saving modal operator']"
16199,0905.2347,Juan-Manuel Torres-Moreno,"Juan-Manuel Torres-Moreno and Laurent Bougrain and Fr\'d\'eric
  Alexandre",Combining Supervised and Unsupervised Learning for GIS Classification,"8 pages, 3 figures",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new hybrid learning algorithm for unsupervised
classification tasks. We combined Fuzzy c-means learning algorithm and a
supervised version of Minimerror to develop a hybrid incremental strategy
allowing unsupervised classifications. We applied this new approach to a
real-world database in order to know if the information contained in unlabeled
features of a Geographic Information System (GIS), allows to well classify it.
Finally, we compared our results to a classical supervised classification
obtained by a multilayer perceptron.
","[{'version': 'v1', 'created': 'Thu, 14 May 2009 14:59:15 GMT'}]",2009-05-15,"[['Torres-Moreno', 'Juan-Manuel', ''], ['Bougrain', 'Laurent', ''], ['Alexandre', 'Frdéric', '']]","['Minimerror', 'Hybrid methods', 'Classi\x1ccation', 'Unsupervised learning', 'Geographic Information System']"
16200,1306.1889,Pradeep  Singla,"Aakash Gupta, Pradeep Singla, Jitendra Gupta, Nitin Maheshwari",An Improved Structure Of Reversible Adder And Subtractor,,"International Journal of Electronics and Computer Science
  Engineering, Vol 2, No. 2, pp712-718, June 2013",,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In today's world everyday a new technology which is faster, smaller and more
complex than its predecessor is being developed. The increased number of
transistors packed onto a chip of a conventional system results in increased
power consumption that is why Reversible logic has drawn attention of
Researchers due to its less heat dissipating characteristics. Reversible logic
can be imposed over applications such as quantum computing, optical computing,
quantum dot cellular automata, low power VLSI circuits, DNA computing. This
paper presents the reversible combinational circuit of adder, subtractor and
parity preserving subtractor. The suggested circuit in this paper are designed
using Feynman, Double Feynman and MUX gates which are better than the existing
one in literature in terms of Quantum cost, Garbage output and Total logical
calculations.
","[{'version': 'v1', 'created': 'Sat, 8 Jun 2013 07:21:22 GMT'}]",2013-06-11,"[['Gupta', 'Aakash', ''], ['Singla', 'Pradeep', ''], ['Gupta', 'Jitendra', ''], ['Maheshwari', 'Nitin', '']]","['Reversible Logic', 'Constant Input', 'Garbage output', 'Total Logical Calculation', 'Adder and  Subtractor']"
16201,1004.0587,Secretary Aircc Journal,"Debdutta Barman Roy(1), Rituparna Chaki(2), Nabendu Chaki(3),
  ((1)Calcutta Institute of Engineering and Management, India, (2) West Bengal
  University of Technology, India, (3)University of Calcutta, A.P.C. Road,
  India)","A New Cluster-based Wormhole Intrusion detection algorithm for Mobile
  Ad-Hoc Networks",9Pages,"International Journal of Network Security & Its Applications 1.1
  (2009) 44-52",,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In multi-hop wireless systems, the need for cooperation among nodes to relay
each other's packets exposes them to a wide range of security attacks. A
particularly devastating attack is the wormhole attack, where a malicious node
records control traffic at one location and tunnels it to another compromised
node, possibly far away, which replays it locally. Routing security in ad hoc
networks is often equated with strong and feasible node authentication and
lightweight cryptography. Unfortunately, the wormhole attack can hardly be
defeated by crypto graphical measures, as wormhole attackers do not create
separate packets. They simply replay packets already existing on the network,
which pass the cryptographic checks. Existing works on wormhole detection have
often focused on detection using specialized hardware, such as directional
antennas, etc. In this paper, we present a cluster based counter-measure for
the wormhole attack, that alleviates these drawbacks and efficiently mitigates
the wormhole attack in MANET. Simulation results on MATLab exhibit the
effectiveness of the proposed algorithm in detecting wormhole attacks.
","[{'version': 'v1', 'created': 'Mon, 5 Apr 2010 08:18:31 GMT'}]",2010-07-15,"[['Roy', 'Debdutta Barman', ''], ['Chaki', 'Rituparna', ''], ['Chaki', 'Nabendu', '']]","['MANET', 'Wormhole', 'Cluster', 'Guard Node', 'routing']"
16202,1402.1399,Carlos Kornuta,"Juan Toloza, Nelson Acosta, Carlos Kornuta",WiFiPos: An In/Out-Door Positioning Tool,"7 pages, 6 figures, ""Published with International Journal of Computer
  Trends and Technology (IJCTT)""","International Journal of Computer Trends and Technology
  (IJCTT.6(2).1-7.December 2013.Published by Seventh Sense Research Group",,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  Geographical location solutions have a wide diversity of applications,
ranging from emergency services to access to tourist and entertainment
services. GPS (Global Positioning System) is the most widely used system for
outdoor areas. Since it requires a direct line of sight with the satellites, it
cannot be used indoors. For indoor positioning, the most commonly used
technology to calculate the position of mobile devices is Wi-Fi. In this
article, we present a positioning tool called WiFiPos based on Wi-Fi signal
processing. This tool uses different variations of the Fingerprint technique to
analyze the performance and accuracy of the system both indoors and outdoors.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2014 16:36:22 GMT'}]",2014-02-07,"[['Toloza', 'Juan', ''], ['Acosta', 'Nelson', ''], ['Kornuta', 'Carlos', '']]","['Indoor positioning', 'Outdoor positioning', 'RSSI', 'Fingerprint', 'GPS']"
16203,1301.4529,Andrew Mastin,"Andrew Mastin, Patrick Jaillet",Average-Case Performance of Rollout Algorithms for Knapsack Problems,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rollout algorithms have demonstrated excellent performance on a variety of
dynamic and discrete optimization problems. Interpreted as an approximate
dynamic programming algorithm, a rollout algorithm estimates the value-to-go at
each decision stage by simulating future events while following a greedy
policy, referred to as the base policy. While in many cases rollout algorithms
are guaranteed to perform as well as their base policies, there have been few
theoretical results showing additional improvement in performance. In this
paper we perform a probabilistic analysis of the subset sum problem and
knapsack problem, giving theoretical evidence that rollout algorithms perform
strictly better than their base policies. Using a stochastic model from the
existing literature, we analyze two rollout methods that we refer to as the
consecutive rollout and exhaustive rollout, both of which employ a simple
greedy base policy. For the subset sum problem, we prove that after only a
single iteration of the rollout algorithm, both methods yield at least a 30%
reduction in the expected gap between the solution value and capacity, relative
to the base policy. Analogous results are shown for the knapsack problem.
","[{'version': 'v1', 'created': 'Sat, 19 Jan 2013 03:58:34 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Nov 2013 23:51:31 GMT'}, {'version': 'v3', 'created': 'Tue, 26 Nov 2013 19:09:09 GMT'}]",2013-11-27,"[['Mastin', 'Andrew', ''], ['Jaillet', 'Patrick', '']]","['Rollout algorithms', 'lookahead', 'knapsack problems', 'approximate dynamic programming']"
16204,1510.08803,B.Sundar Rajan,Anjana Ambika Mahesh and B. Sundar Rajan,Noisy Index Coding with Quadrature Amplitude Modulation (QAM),"6 pages; 5 figures. arXiv admin note: text overlap with
  arXiv:1509.05874",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses noisy index coding problem over Gaussian broadcast
channel. We propose a technique for mapping the index coded bits to M-QAM
symbols such that the receivers whose side information satisfies certain
conditions get coding gain, which we call the QAM side information coding gain.
We compare this with the PSK side information coding gain, which was discussed
in ""Index Coded PSK Modulation,"" arXiv:1356200, [cs.IT] 19 September 2015.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2015 18:05:02 GMT'}]",2015-10-30,"[['Mahesh', 'Anjana Ambika', ''], ['Rajan', 'B. Sundar', '']]","['Index coding', 'AWGN broadcast channel', 'M−QAM', 'QAM side information coding gain']"
16205,1008.2991,Laurent Fousse,"Laurent Fousse, Pascal Lafourcade and Mohamed Alnuaimi",Benaloh's Dense Probabilistic Encryption Revisited,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 1994, Josh Benaloh proposed a probabilistic homomorphic encryption scheme,
enhancing the poor expansion factor provided by Goldwasser and Micali's scheme.
Since then, numerous papers have taken advantage of Benaloh's homomorphic
encryption function, including voting schemes, computing multi-party trust
privately, non-interactive verifiable secret sharing, online poker... In this
paper we show that the original description of the scheme is incorrect,
possibly resulting in ambiguous decryption of ciphertexts. We give a corrected
description of the scheme and provide a complete proof of correctness. We also
compute the probability of failure of the original scheme. Finally we analyze
several applications using Benaloh's encryption scheme. We show in each case
the impact of a bad choice in the key generation phase of Benaloh's scheme. For
instance in the application of e-voting protocol, it can inverse the result of
an election, which is a non negligible consequence.
","[{'version': 'v1', 'created': 'Wed, 18 Aug 2010 00:45:27 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Sep 2010 17:00:25 GMT'}, {'version': 'v3', 'created': 'Tue, 14 Sep 2010 18:58:15 GMT'}]",2010-09-15,"[['Fousse', 'Laurent', ''], ['Lafourcade', 'Pascal', ''], ['Alnuaimi', 'Mohamed', '']]","['homomorphic encryption', 'public-key encryption', 'Benaloh’sscheme']"
16206,1312.4231,Aiping  Huang,Aiping Huang and William Zhu,Dependence space of matroids and its application to attribute reduction,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Attribute reduction is a basic issue in knowledge representation and data
mining. Rough sets provide a theoretical foundation for the issue. Matroids
generalized from matrices have been widely used in many fields, particularly
greedy algorithm design, which plays an important role in attribute reduction.
Therefore, it is meaningful to combine matroids with rough sets to solve the
optimization problems. In this paper, we introduce an existing algebraic
structure called dependence space to study the reduction problem in terms of
matroids. First, a dependence space of matroids is constructed. Second, the
characterizations for the space such as consistent sets and reducts are studied
through matroids. Finally, we investigate matroids by the means of the space
and present two expressions for their bases. In a word, this paper provides new
approaches to study attribute reduction.
","[{'version': 'v1', 'created': 'Mon, 16 Dec 2013 02:27:15 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Mar 2015 02:45:33 GMT'}]",2015-03-06,"[['Huang', 'Aiping', ''], ['Zhu', 'William', '']]","['Rough set', 'Matroid', 'Dependence space']"
16207,1004.3267,Vishal Goyal,"Ramazan Havangi, Mohammad Ali Nekoui, Mohammad Teshnehlab",Adaptive Neuro-Fuzzy Extended Kalman Filtering for Robot Localization,"International Journal of Computer Science Issues online at
  http://ijcsi.org/articles/Adaptive-Neuro-Fuzzy-Extended-Kalman-Filtering-for-Robot-Localization.php","IJCSI, Volume 7, Issue 2, March 2010",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Extended Kalman Filter (EKF) has been a popular approach to localization a
mobile robot. However, the performance of the EKF and the quality of the
estimation depends on the correct a priori knowledge of process and measurement
noise covariance matrices (Qk and Rk, respectively). Imprecise knowledge of
these statistics can cause significant degradation in performance. This paper
proposed the development of an Adaptive Neuro- Fuzzy Extended Kalman Filtering
(ANFEKF) for localization of robot. The Adaptive Neuro-Fuzzy attempts to
estimate the elements of Qk and Rk matrices of the EKF algorithm, at each
sampling instant when measurement update step is carried out. The ANFIS
supervises the performance of the EKF with the aim of reducing the mismatch
between the theoretical and actual covariance of the innovation sequences. The
free parameters of ANFIS are trained using the steepest gradient descent (SD)
to minimize the differences of the actual value of the covariance of the
residual with its theoretical value as much possible. The simulation results
show the effectiveness of the proposed algorithm.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2010 18:07:26 GMT'}]",2010-04-20,"[['Havangi', 'Ramazan', ''], ['Nekoui', 'Mohammad Ali', ''], ['Teshnehlab', 'Mohammad', '']]","['Extended Kalman Filter', 'Localization', 'Fuzzy Inference System', 'Neuro-Fuzzy']"
16208,1111.1301,Shrinivasan Patnaikuni,P. Shrinivasan. R. Patnaikuni and Raj. B. Kulkarni,"An architecture for ""Web Of Things"" using SOCKS protocol based IPv6/IPv4
  gatewaying for heterogeneous communication",10 pages 5 Figures,,,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  ""Web Of Things"" evolved from ""Internet Of Things"". Lot of research has been
done in designing architecture for ""Web Of Things"". Two main architectures are
Smart gateway based architecture and embedded Web Server based architecture.
These architectures address some of the basic and essential issues relating to
Service Oriented Architecture for ""Web Of Things"". Taking into consideration
the period of coexistence of IPv4 and IPv6 we propose an architecture using
SOCKS protocol based IPv6/IPv4 gatewaying and refinements which facilitates
smooth heterogeneous communications between the IPv6 and IPv4 enabled embedded
nodes and can potentially be used to prevent security threats like
Denial-of-Service (DoS) attacks on embedded devices attached to the web and
increase its performance. Our architecture provides a way for caching responses
from device and thereby increasing its efficiency and performance and yielding
quick response times.
","[{'version': 'v1', 'created': 'Sat, 5 Nov 2011 12:06:14 GMT'}]",2011-11-08,"[['Patnaikuni', 'P. Shrinivasan. R.', ''], ['Kulkarni', 'Raj. B.', '']]","['Web Of Things', 'IPv4', 'IPv6', 'SOCKS', 'IP enabled devices']"
16209,1312.6948,Sourish Dasgupta,"Sourish Dasgupta, Rupali KaPatel, Ankur Padia, Kushal Shah",Description Logics based Formalization of Wh-Queries,"Natural Language Query Processing, Representation",,,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of Natural Language Query Formalization (NLQF) is to translate a
given user query in natural language (NL) into a formal language so that the
semantic interpretation has equivalence with the NL interpretation.
Formalization of NL queries enables logic based reasoning during information
retrieval, database query, question-answering, etc. Formalization also helps in
Web query normalization and indexing, query intent analysis, etc. In this paper
we are proposing a Description Logics based formal methodology for wh-query
intent (also called desire) identification and corresponding formal
translation. We evaluated the scalability of our proposed formalism using
Microsoft Encarta 98 query dataset and OWL-S TC v.4.0 dataset.
","[{'version': 'v1', 'created': 'Wed, 25 Dec 2013 09:23:49 GMT'}]",2013-12-30,"[['Dasgupta', 'Sourish', ''], ['KaPatel', 'Rupali', ''], ['Padia', 'Ankur', ''], ['Shah', 'Kushal', '']]","['Query Formalization', 'Description Logics', 'Semantic Web']"
16210,0905.2200,Debprakash Patnaik,"Yong Cao, Debprakash Patnaik, Sean Ponce, Jeremy Archuleta, Patrick
  Butler, Wu-chun Feng, and Naren Ramakrishnan","Towards Chip-on-Chip Neuroscience: Fast Mining of Frequent Episodes
  Using Graphics Processors",,,,,cs.DC cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computational neuroscience is being revolutionized with the advent of
multi-electrode arrays that provide real-time, dynamic, perspectives into brain
function. Mining event streams from these chips is critical to understanding
the firing patterns of neurons and to gaining insight into the underlying
cellular activity. We present a GPGPU solution to mining spike trains. We focus
on mining frequent episodes which captures coordinated events across time even
in the presence of intervening background/""junk"" events. Our algorithmic
contributions are two-fold: MapConcatenate, a new computation-to-core mapping
scheme, and a two-pass elimination approach to quickly find supported episodes
from a large number of candidates. Together, they help realize a real-time
""chip-on-chip"" solution to neuroscience data mining, where one chip (the
multi-electrode array) supplies the spike train data and another (the GPGPU)
mines it at a scale unachievable previously. Evaluation on both synthetic and
real datasets demonstrate the potential of our approach.
","[{'version': 'v1', 'created': 'Wed, 13 May 2009 21:04:03 GMT'}]",2009-05-15,"[['Cao', 'Yong', ''], ['Patnaik', 'Debprakash', ''], ['Ponce', 'Sean', ''], ['Archuleta', 'Jeremy', ''], ['Butler', 'Patrick', ''], ['Feng', 'Wu-chun', ''], ['Ramakrishnan', 'Naren', '']]","['Frequent episode mining', 'GPGPU', 'spike train datasets', 'computational neuroscience']"
16211,1606.09197,Riad Akrour,"Riad Akrour, Abbas Abdolmaleki, Hany Abdulsamad, Jan Peters and
  Gerhard Neumann","Model-Free Trajectory-based Policy Optimization with Monotonic
  Improvement",,,,,cs.LG cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many of the recent trajectory optimization algorithms alternate between
linear approximation of the system dynamics around the mean trajectory and
conservative policy update. One way of constraining the policy change is by
bounding the Kullback-Leibler (KL) divergence between successive policies.
These approaches already demonstrated great experimental success in challenging
problems such as end-to-end control of physical systems. However, the linear
approximation of the system dynamics can introduce a bias in the policy update
and prevent convergence to the optimal policy. In this article, we propose a
new model-free trajectory-based policy optimization algorithm with guaranteed
monotonic improvement. The algorithm backpropagates a local, quadratic and
time-dependent \qfunc~learned from trajectory data instead of a model of the
system dynamics. Our policy update ensures exact KL-constraint satisfaction
without simplifying assumptions on the system dynamics. We experimentally
demonstrate on highly non-linear control tasks the improvement in performance
of our algorithm in comparison to approaches linearizing the system dynamics.
In order to show the monotonic improvement of our algorithm, we additionally
conduct a theoretical analysis of our policy update scheme to derive a lower
bound of the change in policy return between successive iterations.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2016 17:39:09 GMT'}, {'version': 'v2', 'created': 'Fri, 12 May 2017 08:35:57 GMT'}, {'version': 'v3', 'created': 'Thu, 29 Jun 2017 09:07:37 GMT'}, {'version': 'v4', 'created': 'Mon, 2 Jul 2018 12:40:05 GMT'}]",2018-07-03,"[['Akrour', 'Riad', ''], ['Abdolmaleki', 'Abbas', ''], ['Abdulsamad', 'Hany', ''], ['Peters', 'Jan', ''], ['Neumann', 'Gerhard', '']]","['Reinforcement Learning', 'Policy Optimization', 'Trajectory Optimization', 'Robotics']"
16212,1501.03235,Bo Yuan,"Bo Yuan, Keshab K. Parhi","Successive Cancellation Decoding of Polar Codes using Stochastic
  Computing","accepted by International Symposium on Circuits and Systems (ISCAS)
  2015",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Polar codes have emerged as the most favorable channel codes for their unique
capacity-achieving property. To date, numerous works have been reported for
efficient design of polar codes decoder. However, these prior efforts focused
on design of polar decoders via deterministic computation, while the behavior
of stochastic polar decoder, which can have potential advantages such as low
complexity and strong error-resilience, has not been studied in existing
literatures. This paper, for the first time, investigates polar decoding using
stochastic logic. Specifically, the commonly-used successive cancellation (SC)
algorithm is reformulated into the stochastic form. Several methods that can
potentially improve decoding performance are discussed and analyzed. Simulation
results show that a stochastic SC decoder can achieve similar error-correcting
performance as its deterministic counterpart. This work can pave the way for
future hardware design of stochastic polar codes decoders.
","[{'version': 'v1', 'created': 'Wed, 14 Jan 2015 02:30:49 GMT'}]",2015-01-15,"[['Yuan', 'Bo', ''], ['Parhi', 'Keshab K.', '']]","['polar codes', 'stochastic computing', 'successive cancellation (SC)', 'decoder', 'stochastic logic']"
16213,1504.03731,Vincenzo De Florio,Vincenzo De Florio and Chris Blondia,Safety enhancement through situation-aware user interfaces,"Published in the Proc. of the 7th Int.l IET System Safety Conference,
  Edinburgh, UK, 15-18 October 2012. IET",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to their privileged position halfway between the physical and the cyber
universes, user interfaces may play an important role in preventing,
tolerating, and learning from scenarios potentially affecting mission safety
and the user's quality of experience. This vision is embodied here in the main
ideas and a proof-of-concepts implementation of user interfaces that combine
dynamic profiling with context- and situation-awareness and autonomic software
adaptation.
","[{'version': 'v1', 'created': 'Tue, 14 Apr 2015 21:36:53 GMT'}]",2015-04-16,"[['De Florio', 'Vincenzo', ''], ['Blondia', 'Chris', '']]","['Adaptive user interfaces', 'safety', 'human errors', 'situation awareness', 'human-computer interaction']"
16214,1701.04777,Carlos Barron-Romero Prof.,Carlos Barr\'on-Romero,The fast parallel algorithm for CNF SAT without algebra,"Published in COMTEL 2017
  (http://www.comtel.pe/memoriacomtel/COMTEL2017.pdf). See in
  http://academicos.azc.uam.mx/cbr/",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel parallel algorithm for solving the classical Decision Boolean
Satisfiability problem with clauses in conjunctive normal form is depicted. My
approach for solving SAT is without using algebra or other computational search
strategies such as branch and bound, back-forward, tree representation, etc.
The method is based on the special class of SAT problems, Simple SAT (SSAT).
The algorithm's design includes parallel execution, object oriented, and short
termination as my previous versions but it keep track of the tested
unsatisfactory binary values to improve the efficiency and to favor short
termination. The resulting algorithm is linear with respect to the number of
clauses plus a process data on the partial solutions of the subproblems SSAT of
an arbitrary SAT and it is bounded by $2^{n}$ iterations where $n$ is the
number of logical variables. The novelty for the solution of arbitrary SAT
problems is a linear algorithm, such its complexity is less or equal than the
algorithms of the state of the art for solving SAT.
","[{'version': 'v1', 'created': 'Tue, 17 Jan 2017 17:26:00 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Jan 2017 13:17:38 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Feb 2017 23:14:24 GMT'}, {'version': 'v4', 'created': 'Sun, 26 Nov 2017 21:33:24 GMT'}, {'version': 'v5', 'created': 'Sat, 14 Apr 2018 09:21:39 GMT'}]",2018-04-17,"[['Barrón-Romero', 'Carlos', '']]","['Theory of Computation', 'Logic', 'SAT', 'CNF', 'K-SAT', 'Complexity algorithm', 'NP Class']"
16215,1301.6260,Sim-Hui Tee,Sim-Hui Tee,Problems of Inheritance at Java Inner Class,4 pages,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Single inheritance has been widely accepted in the current programming
practice to avoid the complication that incurred by multiple inheritance.
Single inheritance enhances the reusability of codes and eliminates the
confusion of identical methods that possibly defined in two superclasses.
However, the mechanism of inner class in Java potentially reintroduces the
problems encountered by multiple inheritance. When the depth of Java inner
class is increased, the problem becomes severe. This paper aims at exposing the
problems of inheritance at the Java inner class. In addition, a measure is
proposed to evaluate the potential problem of inheritance for Java inner class
","[{'version': 'v1', 'created': 'Sat, 26 Jan 2013 14:25:54 GMT'}]",2013-01-29,"[['Tee', 'Sim-Hui', '']]","['inner class', 'inheritance', 'cyclic inheritance']"
16216,1603.03784,Dane Bell,"Dane Bell and Daniel Fried and Luwen Huangfu and Mihai Surdeanu and
  Stephen Kobourov","Towards using social media to identify individuals at risk for
  preventable chronic illness",This paper will appear in LREC 2016,,,,cs.CL cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a strategy for the acquisition of training data necessary to
build a social-media-driven early detection system for individuals at risk for
(preventable) type 2 diabetes mellitus (T2DM). The strategy uses a game-like
quiz with data and questions acquired semi-automatically from Twitter. The
questions are designed to inspire participant engagement and collect relevant
data to train a public-health model applied to individuals. Prior systems
designed to use social media such as Twitter to predict obesity (a risk factor
for T2DM) operate on entire communities such as states, counties, or cities,
based on statistics gathered by government agencies. Because there is
considerable variation among individuals within these groups, training data on
the individual level would be more effective, but this data is difficult to
acquire. The approach proposed here aims to address this issue. Our strategy
has two steps. First, we trained a random forest classifier on data gathered
from (public) Twitter statuses and state-level statistics with state-of-the-art
accuracy. We then converted this classifier into a 20-questions-style quiz and
made it available online. In doing so, we achieved high engagement with
individuals that took the quiz, while also building a training set of
voluntarily supplied individual-level data for future classification.
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2016 21:09:19 GMT'}]",2016-03-15,"[['Bell', 'Dane', ''], ['Fried', 'Daniel', ''], ['Huangfu', 'Luwen', ''], ['Surdeanu', 'Mihai', ''], ['Kobourov', 'Stephen', '']]","['machine learning', 'obesity detection', 'social media']"
16217,0903.2282,Ian Kash,"Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern",Multiagent Learning in Large Anonymous Games,"8 pages, 2 figures. To Appear in Proceedings of the Eighth
  International Conference on Autonomous Agents and Multiagent Systems",,,,cs.MA cs.GT cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In large systems, it is important for agents to learn to act effectively, but
sophisticated multi-agent learning algorithms generally do not scale. An
alternative approach is to find restricted classes of games where simple,
efficient algorithms converge. It is shown that stage learning efficiently
converges to Nash equilibria in large anonymous games if best-reply dynamics
converge. Two features are identified that improve convergence. First, rather
than making learning more difficult, more agents are actually beneficial in
many settings. Second, providing agents with statistical information about the
behavior of others can significantly reduce the number of observations needed.
","[{'version': 'v1', 'created': 'Thu, 12 Mar 2009 21:49:36 GMT'}]",2009-03-16,"[['Kash', 'Ian A.', ''], ['Friedman', 'Eric J.', ''], ['Halpern', 'Joseph Y.', '']]","['Multiagent Learning', 'Game Theory', 'Large Games', 'Anonymous Games', 'Best-Reply Dynamics']"
16218,1412.4062,Irena Rusu Ph.D.,Irena Rusu,Permutation Reconstruction from MinMax-Betweenness Constraints,"16 pages, 3 figures",,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate the reconstruction of permutations on {1, 2,
..., n} from betweenness constraints involving the minimum and the maximum
element located between t and t+1, for all t=1, 2, ..., n-1. We propose two
variants of the problem (directed and undirected), and focus first on the
directed version, for which we draw up general features and design a polynomial
algorithm in a particular case. Then, we investigate necessary and sufficient
conditions for the uniqueness of the reconstruction in both directed and
undirected versions, using a parameter k whose variation controls the
stringency of the betweenness constraints. We finally point out open problems.
","[{'version': 'v1', 'created': 'Fri, 12 Dec 2014 17:27:15 GMT'}]",2014-12-15,"[['Rusu', 'Irena', '']]","['betweenness', 'permutation', 'algorithm', 'genome', 'common intervals']"
16219,1106.2794,Reshma P,Reshma.p,Power Management during Scan Based Sequential Circuit Testing,ACIJ 2011,,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper shows that not every scan cell contributes equally to the power
consumption during scan based test. The transitions at some scan cells cause
more toggles at the internal signal lines of a circuit than the transitions at
other scan cells. Hence the transitions at these scan cells have a larger
impact on the power consumption during test application. These scan cells are
called power sensitive scan cells.A verilog based approach is proposed to
identify a set of power sensitive scan cells. Additional hardware is added to
freeze the outputs of power sensitive scan cells during scan shifting in order
to reduce the shift power consumption.when multiple scan chain is incorporated
along with freezing the power sensitive scan cell,over all power during testing
can be reduced to a larger extend.
","[{'version': 'v1', 'created': 'Thu, 2 Jun 2011 06:52:02 GMT'}]",2015-03-13,"[['p', 'Reshma.', '']]","['Scan', 'Scan DFlip-Flop', 'DFTAdvisor']"
16220,1511.03406,Kimio Kuramitsu,"Shun Honda, Kimio Kuramitsu",Implementing a Small Parsing Virtual Machine on Embedded Systems,An earlier draft for future submission,,,,cs.PL,http://creativecommons.org/licenses/by/4.0/,"  PEGs are a formal grammar foundation for describing syntax, and are not hard
to generate parsers with a plain recursive decent parsing. However, the large
amount of C-stack consumption in the recursive parsing is not acceptable
especially in resource-restricted embedded systems. Alternatively, we have
attempted the machine virtualization approach to PEG-based parsing. MiniNez,
our implemented virtual machine, is presented in this paper with several
downsizing techniques, including instruction specialization, inline expansion
and static flow analysis. As a result, the MiniNez machine achieves both a very
small footprint and competitive performance to generated C parsers. We have
demonstrated the experimental results by comparing on two major embedded
platforms: Cortex-A7 and Intel Atom processor.
","[{'version': 'v1', 'created': 'Wed, 11 Nov 2015 07:44:04 GMT'}]",2015-11-12,"[['Honda', 'Shun', ''], ['Kuramitsu', 'Kimio', '']]","['Schema validation', 'XML/DTD', 'parsing expression grammars', 'performance']"
16221,1507.00270,Joaquin Garcia-Alfaro,"Michel Barbeau, Steve R. Cloutier, Joaquin Garcia-Alfaro","Quantum Computing Assisted Medium Access Control for Multiple Client
  Station Networks","18 pages, 12 figures, 3 tables; manuscript under review",,,,cs.ET quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A medium access control protocol based on quantum entanglement has been
introduced by Berces and Imre (2006) and Van Meter (2012). This protocol
entirely avoids collisions. It is assumed that the network consists of one
access point and two client stations. We extend this scheme to a network with
an arbitrary number of client stations. We propose three approaches, namely,
the qubit distribution, transmit first election and temporal ordering
protocols. The qubit distribution protocol leverages the concepts of Bell-EPR
pair or W state triad. It works for networks of up to four CSs. With up to
three CSs, there is no probability of collision. In a four-CS network, there is
a low probability of collision. The transmit first election protocol and
temporal ordering protocols work for a network with any number of CSs. The
transmit first election builds upon the concept of W state of size
corresponding to the number of client stations. It is fair and collision free.
The temporal ordering protocol employs the concepts of Lehmer code and quantum
oracle. It is collision free, has a normalized throughput of 100% and achieves
quasi-fairness.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2015 15:58:25 GMT'}]",2015-07-02,"[['Barbeau', 'Michel', ''], ['Cloutier', 'Steve R.', ''], ['Garcia-Alfaro', 'Joaquin', '']]","['Quantum computing', 'quantum communications', 'mediumaccess control', 'network protocol']"
16222,1401.5791,Debadatta Dash,Debadatta Dash,Advanced Signal Processing Techniqes to Study Normal and Epileptic EEG,,"41 st annual conference of OMS and International Conference on
  Industrial Mathematics and Scientific Computing, 2014",,ICIMSC14/OMS41,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  EEG monitoring has an important milestone provide valuable information of
those candidates who suffer from epilepsy.In this paper human normal and
epileptic Electroencephalogram signals are analyzed with popular and efficient
signal processing techniques like Fourier and Wavelet transform. The delta,
theta, alpha, beta and gamma sub bands of EEG are obtained and studied for
detection of seizure and epilepsy. The extracted feature is then applied to ANN
for classification of the EEG signals.
","[{'version': 'v1', 'created': 'Wed, 22 Jan 2014 11:22:19 GMT'}]",2018-02-26,"[['Dash', 'Debadatta', '']]","['EEG', 'Epilepsy', 'FourierTransform', 'DWT', 'db-4']"
16223,1701.07383,Shiva Prasad H C Prof,"Shiva H C Prasad, Potti Srinivasa Rao, B Gopalkrishna, and Aakash
  Ahluwalia",Productivity Enhancement through Production Monitoring System,339-351,"International Journal of Applied Business and Economic Research
  (2016); Vol.14; No.3; 339-351",,,cs.CY,http://creativecommons.org/publicdomain/zero/1.0/,"  A production monitoring system uses the real-time data while production is
online. The real-time production monitoring systems are designed as means of
auto data to the collection and monitoring the data via display boards. This
study focuses on analysing the real-time production monitoring systems through
trend analysis in production and over consumption of raw material controlling
the over consumptions in a pen manufacturing industry. The methodology followed
is through process flow diagram, a collection of data, analysis of data. Pre
and post analysis was conducted to identify the factors responsible for over
consumption and causal factors responsible for the over consumption were
identified to reduce the cost of consumption by 58% with the introduction of
production monitoring system.
","[{'version': 'v1', 'created': 'Tue, 24 Jan 2017 14:54:30 GMT'}]",2017-01-26,"[['Prasad', 'Shiva H C', ''], ['Rao', 'Potti Srinivasa', ''], ['Gopalkrishna', 'B', ''], ['Ahluwalia', 'Aakash', '']]","['productivity', 'production monitoring system', 'consumption', 'pre and post factors']"
16224,1607.04176,Vincent Neiger,"George Labahn, Vincent Neiger, Wei Zhou","Fast, deterministic computation of the Hermite normal form and
  determinant of a polynomial matrix","34 pages, 3 algorithms",,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a nonsingular $n \times n$ matrix of univariate polynomials over a
field $\mathbb{K}$, we give fast and deterministic algorithms to compute its
determinant and its Hermite normal form. Our algorithms use
$\widetilde{\mathcal{O}}(n^\omega \lceil s \rceil)$ operations in $\mathbb{K}$,
where $s$ is bounded from above by both the average of the degrees of the rows
and that of the columns of the matrix and $\omega$ is the exponent of matrix
multiplication. The soft-$O$ notation indicates that logarithmic factors in the
big-$O$ are omitted while the ceiling function indicates that the cost is
$\widetilde{\mathcal{O}}(n^\omega)$ when $s = o(1)$. Our algorithms are based
on a fast and deterministic triangularization method for computing the diagonal
entries of the Hermite form of a nonsingular matrix.
","[{'version': 'v1', 'created': 'Thu, 14 Jul 2016 16:01:59 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Mar 2017 21:24:35 GMT'}]",2017-03-31,"[['Labahn', 'George', ''], ['Neiger', 'Vincent', ''], ['Zhou', 'Wei', '']]","['Hermite normal form', 'determinant', 'polynomial matrix']"
16225,1402.0543,Bill Rea,Jan Koeman and William Rea,How Does Latent Semantic Analysis Work? A Visualisation Approach,"13 pages, 6 figures, 2 tables",,,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  By using a small example, an analogy to photographic compression, and a
simple visualization using heatmaps, we show that latent semantic analysis
(LSA) is able to extract what appears to be semantic meaning of words from a
set of documents by blurring the distinctions between the words.
","[{'version': 'v1', 'created': 'Mon, 3 Feb 2014 23:09:28 GMT'}]",2014-02-05,"[['Koeman', 'Jan', ''], ['Rea', 'William', '']]","['Latent Semantic Analysis', 'Singular Value Decomposition', 'Artificial Intelligence', 'Visualization']"
16226,1307.4824,Wei   Jiang,"Yousef Elmehdwi, Bharath K. Samanthula, Wei Jiang","Secure k-Nearest Neighbor Query over Encrypted Data in Outsourced
  Environments","23 pages, 8 figures, and 4 tables",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For the past decade, query processing on relational data has been studied
extensively, and many theoretical and practical solutions to query processing
have been proposed under various scenarios. With the recent popularity of cloud
computing, users now have the opportunity to outsource their data as well as
the data management tasks to the cloud. However, due to the rise of various
privacy issues, sensitive data (e.g., medical records) need to be encrypted
before outsourcing to the cloud. In addition, query processing tasks should be
handled by the cloud; otherwise, there would be no point to outsource the data
at the first place. To process queries over encrypted data without the cloud
ever decrypting the data is a very challenging task. In this paper, we focus on
solving the k-nearest neighbor (kNN) query problem over encrypted database
outsourced to a cloud: a user issues an encrypted query record to the cloud,
and the cloud returns the k closest records to the user. We first present a
basic scheme and demonstrate that such a naive solution is not secure. To
provide better security, we propose a secure kNN protocol that protects the
confidentiality of the data, user's input query, and data access patterns.
Also, we empirically analyze the efficiency of our protocols through various
experiments. These results indicate that our secure protocol is very efficient
on the user end, and this lightweight scheme allows a user to use any mobile
device to perform the kNN query.
","[{'version': 'v1', 'created': 'Thu, 18 Jul 2013 03:36:20 GMT'}]",2013-07-19,"[['Elmehdwi', 'Yousef', ''], ['Samanthula', 'Bharath K.', ''], ['Jiang', 'Wei', '']]","['Security', 'k-NN Query', 'Encryption', 'Cloud Computing']"
16227,1504.08027,Prashanti Manda,"Prashanti Manda, Fiona McCarthy, Bindu Nanduri, Hui Wang, Susan M.
  Bridges","Information-theoretic Interestingness Measures for Cross-Ontology Data
  Mining",,,,,cs.AI cs.CE q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Community annotation of biological entities with concepts from multiple
bio-ontologies has created large and growing repositories of ontology-based
annotation data with embedded implicit relationships among orthogonal
ontologies. Development of efficient data mining methods and metrics to mine
and assess the quality of the mined relationships has not kept pace with the
growth of annotation data. In this study, we present a data mining method that
uses ontology-guided generalization to discover relationships across ontologies
along with a new interestingness metric based on information theory. We apply
our data mining algorithm and interestingness measures to datasets from the
Gene Expression Database at the Mouse Genome Informatics as a preliminary proof
of concept to mine relationships between developmental stages in the mouse
anatomy ontology and Gene Ontology concepts (biological process, molecular
function and cellular component). In addition, we present a comparison of our
interestingness metric to four existing metrics. Ontology-based annotation
datasets provide a valuable resource for discovery of relationships across
ontologies. The use of efficient data mining methods and appropriate
interestingness metrics enables the identification of high quality
relationships.
","[{'version': 'v1', 'created': 'Wed, 29 Apr 2015 21:15:46 GMT'}, {'version': 'v2', 'created': 'Mon, 16 May 2016 08:58:17 GMT'}]",2016-05-17,"[['Manda', 'Prashanti', ''], ['McCarthy', 'Fiona', ''], ['Nanduri', 'Bindu', ''], ['Wang', 'Hui', ''], ['Bridges', 'Susan M.', '']]","['gene ontology', 'annotations', 'association rule mining', 'interestingness measures', 'cross-ontology']"
16228,1301.5414,Alin Bostan,"Alin Bostan (INRIA Saclay - Ile de France), Fr\'ed\'eric Chyzak (INRIA
  Saclay - Ile de France), \'Elie De Panafieu (LIAFA)",Complexity Estimates for Two Uncoupling Algorithms,To appear in Proceedings of ISSAC'13 (21/01/2013),,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Uncoupling algorithms transform a linear differential system of first order
into one or several scalar differential equations. We examine two approaches to
uncoupling: the cyclic-vector method (CVM) and the
Danilevski-Barkatou-Z\""urcher algorithm (DBZ). We give tight size bounds on the
scalar equations produced by CVM, and design a fast variant of CVM whose
complexity is quasi-optimal with respect to the output size. We exhibit a
strong structural link between CVM and DBZ enabling to show that, in the
generic case, DBZ has polynomial complexity and that it produces a single
equation, strongly related to the output of CVM. We prove that algorithm CVM is
faster than DBZ by almost two orders of magnitude, and provide experimental
results that validate the theoretical complexity analyses.
","[{'version': 'v1', 'created': 'Wed, 23 Jan 2013 07:18:35 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Apr 2013 13:19:03 GMT'}]",2013-04-24,"[['Bostan', 'Alin', '', 'INRIA Saclay - Ile de France'], ['Chyzak', 'Frédéric', '', 'INRIA\n  Saclay - Ile de France'], ['De Panafieu', 'Élie', '', 'LIAFA']]","['Danilevski-Barkatou-Zürcher algorithm', 'gaugeequivalence', 'uncoupling', 'cyclic-vector method', 'complexity']"
16229,1606.04679,Frank Kammer,"Frank Kammer, Dieter Kratsch and Moritz Laudahn","Space-Efficient Biconnected Components and Recognition of Outerplanar
  Graphs",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present space-efficient algorithms for computing cut vertices in a given
graph with $n$ vertices and $m$ edges in linear time using $O(n+\min\{m,n\log
\log n\})$ bits. With the same time and using $O(n+m)$ bits, we can compute the
biconnected components of a graph. We use this result to show an algorithm for
the recognition of (maximal) outerplanar graphs in $O(n\log \log n)$ time using
$O(n)$ bits.
","[{'version': 'v1', 'created': 'Wed, 15 Jun 2016 08:44:16 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Dec 2016 18:33:00 GMT'}]",2016-12-09,"[['Kammer', 'Frank', ''], ['Kratsch', 'Dieter', ''], ['Laudahn', 'Moritz', '']]","['graph algorithms', 'space efficiency', 'cut vertices', 'biconnected components', '(maximal) outerplanar graphs']"
16230,1702.07281,Yujie Qian,"Yujie Qian, Jie Tang, Zhilin Yang, Binxuan Huang, Wei Wei, Kathleen M.
  Carley",A Probabilistic Framework for Location Inference from Social Media,,,,,cs.AI cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the extent to which we can infer users' geographical locations from
social media. Location inference from social media can benefit many
applications, such as disaster management, targeted advertising, and news
content tailoring. The challenges, however, lie in the limited amount of
labeled data and the large scale of social networks. In this paper, we
formalize the problem of inferring location from social media into a
semi-supervised factor graph model (SSFGM). The model provides a probabilistic
framework in which various sources of information (e.g., content and social
network) can be combined together. We design a two-layer neural network to
learn feature representations, and incorporate the learned latent features into
SSFGM. To deal with the large-scale problem, we propose a Two-Chain Sampling
(TCS) algorithm to learn SSFGM. The algorithm achieves a good trade-off between
accuracy and efficiency. Experiments on Twitter and Weibo show that the
proposed TCS algorithm for SSFGM can substantially improve the inference
accuracy over several state-of-the-art methods. More importantly, TCS achieves
over 100x speedup comparing with traditional propagation-based methods (e.g.,
loopy belief propagation).
","[{'version': 'v1', 'created': 'Thu, 23 Feb 2017 16:34:07 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Mar 2017 16:23:25 GMT'}, {'version': 'v3', 'created': 'Fri, 10 May 2019 18:17:15 GMT'}]",2019-05-14,"[['Qian', 'Yujie', ''], ['Tang', 'Jie', ''], ['Yang', 'Zhilin', ''], ['Huang', 'Binxuan', ''], ['Wei', 'Wei', ''], ['Carley', 'Kathleen M.', '']]","['Location Inference', 'Social Media', 'Factor Graph Model']"
16231,0704.3313,David Eppstein,David Eppstein and Michael T. Goodrich,"Straggler Identification in Round-Trip Data Streams via Newton's
  Identities and Invertible Bloom Filters","Fuller version of paper appearing in 10th Worksh. Algorithms and Data
  Structures, Halifax, Nova Scotia, 2007",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the straggler identification problem, in which an algorithm must
determine the identities of the remaining members of a set after it has had a
large number of insertion and deletion operations performed on it, and now has
relatively few remaining members. The goal is to do this in o(n) space, where n
is the total number of identities. The straggler identification problem has
applications, for example, in determining the set of unacknowledged packets in
a high-bandwidth multicast data stream. We provide a deterministic solution to
the straggler identification problem that uses only O(d log n) bits and is
based on a novel application of Newton's identities for symmetric polynomials.
This solution can identify any subset of d stragglers from a set of n O(log
n)-bit identifiers, assuming that there are no false deletions of identities
not already in the set. Indeed, we give a lower bound argument that shows that
any small-space deterministic solution to the straggler identification problem
cannot be guaranteed to handle false deletions. Nevertheless, we show that
there is a simple randomized solution using O(d log n log(1/epsilon)) bits that
can maintain a multiset and solve the straggler identification problem,
tolerating false deletions, where epsilon>0 is a user-defined parameter
bounding the probability of an incorrect response. This randomized solution is
based on a new type of Bloom filter, which we call the invertible Bloom filter.
","[{'version': 'v1', 'created': 'Wed, 25 Apr 2007 06:59:43 GMT'}, {'version': 'v2', 'created': 'Fri, 18 May 2007 21:56:45 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Sep 2009 04:13:31 GMT'}]",2009-09-10,"[['Eppstein', 'David', ''], ['Goodrich', 'Michael T.', '']]","['straggler identification', 'Newton’s identities', 'Bloom filters', 'data streams']"
16232,1009.4581,Mohammed El Hassouni,Mohammed EL Hassouni and Driss Aboutajdine,3D-Mesh denoising using an improved vertex based anisotropic diffusion,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with an improvement of vertex based nonlinear diffusion for
mesh denoising. This method directly filters the position of the vertices using
Laplace, reduced centered Gaussian and Rayleigh probability density functions
as diffusivities. The use of these PDFs improves the performance of a
vertex-based diffusion method which are adapted to the underlying mesh
structure. We also compare the proposed method to other mesh denoising methods
such as Laplacian flow, mean, median, min and the adaptive MMSE filtering. To
evaluate these methods of filtering, we use two error metrics. The first is
based on the vertices and the second is based on the normals. Experimental
results demonstrate the effectiveness of our proposed method in comparison with
the existing methods.
","[{'version': 'v1', 'created': 'Thu, 23 Sep 2010 11:26:37 GMT'}]",2010-09-24,"[['Hassouni', 'Mohammed EL', ''], ['Aboutajdine', 'Driss', '']]","['Mesh denoising', 'diffusion', 'vertex']"
16233,1111.4279,Nikos Hardavellas,"Sourya Roy, Tyler Clemons, S M Faisal, Ke Liu, Nikos Hardavellas,
  Srinivasan Parthasarathy","Elastic Fidelity: Trading-off Computational Accuracy for Energy
  Reduction",,,,"Northwestern University NWU-EECS-11-02, February 2011",cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Power dissipation and energy consumption have become one of the most
important problems in the design of processors today. This is especially true
in power-constrained environments, such as embedded and mobile computing. While
lowering the operational voltage can reduce power consumption, there are limits
imposed at design time, beyond which hardware components experience faulty
operation. Moreover, the decrease in feature size has led to higher
susceptibility to process variations, leading to reliability issues and
lowering yield. However, not all computations and all data in a workload need
to maintain 100% fidelity. In this paper, we explore the idea of employing
functional or storage units that let go the conservative guardbands imposed on
the design to guarantee reliable execution. Rather, these units exhibit Elastic
Fidelity, by judiciously lowering the voltage to trade-off reliable execution
for power consumption based on the error guarantees required by the executing
code. By estimating the accuracy required by each computational segment of a
workload, and steering each computation to different functional and storage
units, Elastic Fidelity Computing obtains power and energy savings while
reaching the reliability targets required by each computational segment. Our
preliminary results indicate that even with conservative estimates, Elastic
Fidelity can reduce the power and energy consumption of a processor by 11-13%
when executing applications involving human perception that are typically
included in modern mobile platforms, such as audio, image, and video decoding.
","[{'version': 'v1', 'created': 'Fri, 18 Nov 2011 04:12:12 GMT'}]",2011-11-22,"[['Roy', 'Sourya', ''], ['Clemons', 'Tyler', ''], ['Faisal', 'S M', ''], ['Liu', 'Ke', ''], ['Hardavellas', 'Nikos', ''], ['Parthasarathy', 'Srinivasan', '']]","['Energy efficiency', 'hardware reliability', 'error tolerance', 'elastic fidelity']"
16234,1505.08105,Henning Kerstan,"Paolo Baldan, Filippo Bonchi, Henning Kerstan, Barbara K\""onig",Towards Trace Metrics via Functor Lifting,,,,,cs.LO,http://creativecommons.org/licenses/by/3.0/,"  We investigate the possibility of deriving metric trace semantics in a
coalgebraic framework. First, we generalize a technique for systematically
lifting functors from the category Set of sets to the category PMet of
pseudometric spaces, showing under which conditions also natural
transformations, monads and distributive laws can be lifted. By exploiting some
recent work on an abstract determinization, these results enable the derivation
of trace metrics starting from coalgebras in Set. More precisely, for a
coalgebra on Set we determinize it, thus obtaining a coalgebra in the
Eilenberg-Moore category of a monad. When the monad can be lifted to PMet, we
can equip the final coalgebra with a behavioral distance. The trace distance
between two states of the original coalgebra is the distance between their
images in the determinized coalgebra through the unit of the monad. We show how
our framework applies to nondeterministic automata and probabilistic automata.
","[{'version': 'v1', 'created': 'Fri, 29 May 2015 16:23:09 GMT'}]",2015-06-01,"[['Baldan', 'Paolo', ''], ['Bonchi', 'Filippo', ''], ['Kerstan', 'Henning', ''], ['König', 'Barbara', '']]","['trace metric', 'monad lifting', 'pseudometric', 'coalgebra']"
16235,1702.03872,Hong-Han Shuai,"Hong-Han Shuai, Chih-Ya Shen, De-Nian Yang, Yi-Feng Lan, Wang-Chien
  Lee, Philip S. Yu, Ming-Syan Chen",Mining Online Social Data for Detecting Social Network Mental Disorders,11 pages,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An increasing number of social network mental disorders (SNMDs), such as
Cyber-Relationship Addiction, Information Overload, and Net Compulsion, have
been recently noted. Symptoms of these mental disorders are usually observed
passively today, resulting in delayed clinical intervention. In this paper, we
argue that mining online social behavior provides an opportunity to actively
identify SNMDs at an early stage. It is challenging to detect SNMDs because the
mental factors considered in standard diagnostic criteria (questionnaire)
cannot be observed from online social activity logs. Our approach, new and
innovative to the practice of SNMD detection, does not rely on self-revealing
of those mental factors via questionnaires. Instead, we propose a machine
learning framework, namely, Social Network Mental Disorder Detection (SNMDD),
that exploits features extracted from social network data to accurately
identify potential cases of SNMDs. We also exploit multi-source learning in
SNMDD and propose a new SNMD-based Tensor Model (STM) to improve the
performance. Our framework is evaluated via a user study with 3126 online
social network users. We conduct a feature analysis, and also apply SNMDD on
large-scale datasets and analyze the characteristics of the three SNMD types.
The results show that SNMDD is promising for identifying online social network
users with potential SNMDs.
","[{'version': 'v1', 'created': 'Mon, 13 Feb 2017 16:58:35 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Feb 2017 05:33:44 GMT'}, {'version': 'v3', 'created': 'Wed, 1 Mar 2017 10:57:55 GMT'}, {'version': 'v4', 'created': 'Tue, 6 Jun 2017 10:28:29 GMT'}]",2017-06-07,"[['Shuai', 'Hong-Han', ''], ['Shen', 'Chih-Ya', ''], ['Yang', 'De-Nian', ''], ['Lan', 'Yi-Feng', ''], ['Lee', 'Wang-Chien', ''], ['Yu', 'Philip S.', ''], ['Chen', 'Ming-Syan', '']]","['Online social network', 'mental disorder detection', 'feature extraction', 'tensor factorization']"
16236,1410.5129,Abdul Razaque,"Khaled Elleithy, Abdul Razaque","Fostering of innovative usability testing to develop mobile application
  for mobile collaborative learning (MCL)","8 pages, 5 figures, ICGST-AIML Journal, Volume 12, Issue 1, July 2012",,,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Emergence of latest technologies has diverted the focus of people form
Computer-Supported Collaborative Learning (CSCL) to mobile supported
collaborative learning. MCL is highly demanded in educational organizations to
substantiate the pedagogical activities. Some of the MCL supportive
architectures including applications are introduced in several fields to
improve the activities of those organizations, but they need more concise
paradigm to support both types of collaboration: synchronous and asynchronous.
This paper introduces the new preusability testing method that provides
educational support and gives complete picture for developing new pedagogical
group application for MCL. The feature of application includes asynchronous and
synchronous collaboration support. To validate the features of application, we
conduct the post usability testing and heuristic evaluation, which helps in
collecting the empirical data to prove the effectiveness and suitability of
Group application. Further, application aims to improve learning impact and
educate people at anytime and anywhere.
","[{'version': 'v1', 'created': 'Tue, 14 Oct 2014 03:31:14 GMT'}]",2014-10-21,"[['Elleithy', 'Khaled', ''], ['Razaque', 'Abdul', '']]","['Empirical results', 'Group application', 'MCL', 'Mobiles', 'Post usability testing', 'Pre-usability testing', 'User requirements']"
16237,1609.04593,Etienne Birmele,"Etienne Birmel\'e (MAP5), Fabien De Montgolfier (IRIF), L\'eo Planche
  (MAP5, IRIF)","Minimum Eccentricity Shortest Path Problem: an Approximation Algorithm
  and Relation with the k-Laminarity Problem",,,,MAP5 2016-26,cs.CC cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Minimum Eccentricity Shortest Path (MESP) Problem consists in determining
a shortest path (a path whose length is the distance between its extremities)
of minimum eccentricity in a graph. It was introduced by Dragan and Leitert [9]
who described a linear-time algorithm which is an 8-approximation of the
problem. In this paper, we study deeper the double-BFS procedure used in that
algorithm and extend it to obtain a linear-time 3-approximation algorithm. We
moreover study the link between the MESP problem and the notion of laminarity,
introduced by V{\""o}lkel et al [12], corresponding to its restriction to a
diameter (i.e. a shortest path of maximum length), and show tight bounds
between MESP and laminarity parameters.
","[{'version': 'v1', 'created': 'Thu, 15 Sep 2016 12:18:57 GMT'}]",2016-09-16,"[['Birmelé', 'Etienne', '', 'MAP5'], ['De Montgolfier', 'Fabien', '', 'IRIF'], ['Planche', 'Léo', '', 'MAP5, IRIF']]","['Graph search', 'Graph theory', 'Eccentricity', 'Diameter', 'BFS', 'Approximation Algorithms', 'k-Laminar Graph']"
16238,1304.4619,Hossein Movafegh Ghadirli,"Hossein Movafegh Ghadirli, Maryam Rastgarpour",An Adaptive and Intelligent Tutor by Expert Systems for Mobile Devices,"8 pages, 3 figures, International Journal of Managing Public Sector
  Information and Communication Technologies(IJMPICT). arXiv admin note:
  substantial text overlap with arXiv:1304.4222",,,,cs.CY,http://creativecommons.org/licenses/by/3.0/,"  Mobile Learning (M-Learning) is an emerging discipline in the area of
education and educational technology. So researchers are trying to optimize and
expanding its application in the field of education. The aim of this paper is
to investigate the role of mobile devices and expert systems in disseminating
and supporting the knowledge gained by intelligent tutors and to propose a
system based on integration of intelligent M-Learning with expert systems. It
acts as an intelligent tutor which can perform three processes - pre-test,
learning concept and post-test - according to characteristic of the learner.
The proposed system can improves the education efficiency highly as well as
decreases costs. As a result, every time and everywhere (ETEW) simple and cheap
learning would be provided via SMS, MMS and so on in this system. The global
intention of M-Learning is to make learning ""a way of being"".
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2013 10:33:53 GMT'}]",2013-04-18,"[['Ghadirli', 'Hossein Movafegh', ''], ['Rastgarpour', 'Maryam', '']]","['Expert Tutor', 'Intelligent Tutoring System', 'Mobile Learning', 'Adaptive Learning']"
16239,1610.01935,Mohamad Ivan Fanany,"Intan Nurma Yulita, Mohamad Ivan Fanany, Aniati Murni Arymurthy","Sequence-based Sleep Stage Classification using Conditional Neural
  Fields","14 pages. Submitted to Computational and Mathematical Methods in
  Medicine (Hindawi Publishin). Article ID 7163687",,,7163687,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sleep signals from a polysomnographic database are sequences in nature.
Commonly employed analysis and classification methods, however, ignored this
fact and treated the sleep signals as non-sequence data. Treating the sleep
signals as sequences, this paper compared two powerful unsupervised feature
extractors and three sequence-based classifiers regarding accuracy and
computational (training and testing) time after 10-folds cross-validation. The
compared feature extractors are Deep Belief Networks (DBN) and Fuzzy C-Means
(FCM) clustering. Whereas the compared sequence-based classifiers are Hidden
Markov Models (HMM), Conditional Random Fields (CRF) and its variants, i.e.,
Hidden-state CRF (HCRF) and Latent-Dynamic CRF (LDCRF); and Conditional Neural
Fields (CNF) and its variant (LDCNF). In this study, we use two datasets. The
first dataset is an open (public) polysomnographic dataset downloadable from
the Internet, while the second dataset is our polysomnographic dataset (also
available for download). For the first dataset, the combination of FCM and CNF
gives the highest accuracy (96.75\%) with relatively short training time (0.33
hours). For the second dataset, the combination of DBN and CRF gives the
accuracy of 99.96\% but with 1.02 hours training time, whereas the combination
of DBN and CNF gives slightly less accuracy (99.69\%) but also less computation
time (0.89 hours).
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2016 16:26:58 GMT'}]",2016-10-07,"[['Yulita', 'Intan Nurma', ''], ['Fanany', 'Mohamad Ivan', ''], ['Arymurthy', 'Aniati Murni', '']]","['Sleep stage', 'Conditional Neural Fields', 'Deep Belief Networks', 'FuzzyC-Means Clustering', 'Classification']"
16240,1702.04434,Ruxandra F. Olimid,Stig F. Mj{\o}lsnes and Ruxandra F. Olimid,Easy 4G/LTE IMSI Catchers for Non-Programmers,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  IMSI Catchers are tracking devices that break the privacy of the subscribers
of mobile access networks, with disruptive effects to both the communication
services and the trust and credibility of mobile network operators. Recently,
we verified that IMSI Catcher attacks are really practical for the
state-of-the-art 4G/LTE mobile systems too. Our IMSI Catcher device acquires
subscription identities (IMSIs) within an area or location within a few seconds
of operation and then denies access of subscribers to the commercial network.
Moreover, we demonstrate that these attack devices can be easily built and
operated using readily available tools and equipment, and without any
programming. We describe our experiments and procedures that are based on
commercially available hardware and unmodified open source software.
","[{'version': 'v1', 'created': 'Wed, 15 Feb 2017 01:13:45 GMT'}]",2017-02-16,"[['Mjølsnes', 'Stig F.', ''], ['Olimid', 'Ruxandra F.', '']]","['4G', 'LTE security', 'IMSI Catcher', 'Denial-of-Service']"
16241,1106.5988,Lazaros Gkatzikis,"Lazaros Gkatzikis, Georgios S. Paschos and Iordanis Koutsopoulos",The impact of energy constraints on the medium access,"8 pages, 3 figures",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Contemporary mobile devices are battery powered and due to their shrinking
size and increasing complexity operate on a tight energy budget. Thus, energy
consumption is becoming one of the major concerns regarding the current and
upcoming wireless communication systems. On the other hand, the available
bandwidth resources are limited and modern applications are throughput
demanding, leading thus to strong competition for the medium. In this
direction, we consider a stochastic contention based medium access scheme,
where the devices may choose to turn off for some time in order to save energy.
We perform an analysis for a slotted ALOHA scenario and we show that the energy
constraints, if properly exploited, may reduce contention for the medium. Our
results give valuable insights on the energy--throughput tradeoff for any
contention based system.
","[{'version': 'v1', 'created': 'Sun, 5 Jun 2011 21:52:15 GMT'}]",2015-03-19,"[['Gkatzikis', 'Lazaros', ''], ['Paschos', 'Georgios S.', ''], ['Koutsopoulos', 'Iordanis', '']]","['energy saving', 'contention', 'ALOHA', 'game theory']"
16242,1505.03014,Linas Baltrunas,"Linas Baltrunas, Karen Church, Alexandros Karatzoglou, Nuria Oliver","Frappe: Understanding the Usage and Perception of Mobile App
  Recommendations In-The-Wild",,,,11,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a real world deployment of a context-aware mobile app
recommender system (RS) called Frappe. Utilizing a hybrid-approach, we
conducted a large-scale app market deployment with 1000 Android users combined
with a small-scale local user study involving 33 users. The resulting usage
logs and subjective feedback enabled us to gather key insights into (1)
context-dependent app usage and (2) the perceptions and experiences of
end-users while interacting with context-aware mobile app recommendations.
While Frappe performs very well based on usage-centric evaluation metrics
insights from the small-scale study reveal some negative user experiences. Our
results point to a number of actionable lessons learned specifically related to
designing, deploying and evaluating mobile context-aware RS in-the-wild with
real users.
","[{'version': 'v1', 'created': 'Tue, 12 May 2015 14:11:58 GMT'}]",2015-05-13,"[['Baltrunas', 'Linas', ''], ['Church', 'Karen', ''], ['Karatzoglou', 'Alexandros', ''], ['Oliver', 'Nuria', '']]","['Context Aware', 'Mobile', 'Recommender Systems']"
16243,1401.0255,Dinesh Govindaraj,"Dinesh Govindaraj, Tao Wang, S.V.N. Vishwanathan",Modeling Attractiveness and Multiple Clicks in Sponsored Search Results,,,,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Click models are an important tool for leveraging user feedback, and are used
by commercial search engines for surfacing relevant search results. However,
existing click models are lacking in two aspects. First, they do not share
information across search results when computing attractiveness. Second, they
assume that users interact with the search results sequentially. Based on our
analysis of the click logs of a commercial search engine, we observe that the
sequential scan assumption does not always hold, especially for sponsored
search results. To overcome the above two limitations, we propose a new click
model. Our key insight is that sharing information across search results helps
in identifying important words or key-phrases which can then be used to
accurately compute attractiveness of a search result. Furthermore, we argue
that the click probability of a position as well as its attractiveness changes
during a user session and depends on the user's past click experience. Our
model seamlessly incorporates the effect of externalities (quality of other
search results displayed in response to a user query), user fatigue, as well as
pre and post-click relevance of a sponsored search result. We propose an
efficient one-pass inference scheme and empirically evaluate the performance of
our model via extensive experiments using the click logs of a large commercial
search engine.
","[{'version': 'v1', 'created': 'Wed, 1 Jan 2014 06:45:58 GMT'}]",2014-01-03,"[['Govindaraj', 'Dinesh', ''], ['Wang', 'Tao', ''], ['Vishwanathan', 'S. V. N.', '']]","['Click Models', 'User behavior', 'Query log', 'Click and Browsingdata analysis', 'Sponsored Search', 'Optimization', 'Ranking']"
16244,1004.3549,Vishal Goyal,"Bassam Al-Mahadeen, Mokhled S. AlTarawneh, Islam H. AlTarawneh",Signature Region of Interest using Auto cropping,"International Journal of Computer Science Issues online at
  http://ijcsi.org/articles/Signature-Region-of-Interest-using-Auto-cropping.php","IJCSI, Volume 7, Issue 2, March 2010",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new approach for signature region of interest pre-processing was presented.
It used new auto cropping preparation on the basis of the image content, where
the intensity value of pixel is the source of cropping. This approach provides
both the possibility of improving the performance of security systems based on
signature images, and also the ability to use only the region of interest of
the used image to suit layout design of biometric systems. Underlying the
approach is a novel segmentation method which identifies the exact region of
foreground of signature for feature extraction usage. Evaluation results of
this approach shows encouraging prospects by eliminating the need for false
region isolating, reduces the time cost associated with signature false points
detection, and addresses enhancement issues. A further contribution of this
paper is an automated cropping stage in bio-secure based systems.
","[{'version': 'v1', 'created': 'Tue, 20 Apr 2010 20:04:17 GMT'}]",2010-04-22,"[['Al-Mahadeen', 'Bassam', ''], ['AlTarawneh', 'Mokhled S.', ''], ['AlTarawneh', 'Islam H.', '']]","['Pre-processing', 'Normalization', 'skeletonization', 'Region of interest', 'Cropping']"
16245,1401.8206,Sanjay Vishwakarma,Sanjay Vishwakarma and A. Chockalingam,Decode-and-Forward Relay Beamforming with Secret and Non-Secret Messages,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study beamforming in decode-and-forward (DF) relaying using
multiple relays, where the source node sends a secret message as well as a
non-secret message to the destination node in the presence of multiple
non-colluding eavesdroppers. The non-secret message is transmitted at a fixed
rate $R_{0}$ and requires no protection from the eavesdroppers, whereas the
secret message needs to be protected from the eavesdroppers. The source and
relays operate under a total power constraint. We find the optimum source
powers and weights of the relays for both secret and non-secret messages which
maximize the worst case secrecy rate for the secret message as well as meet the
information rate constraint $R_{0}$ for the non-secret message. We solve this
problem for the cases when ($i$) perfect channel state information (CSI) of all
links is known, and ($ii$) only the statistical CSI of the eavesdroppers links
and perfect CSI of other links are known.
","[{'version': 'v1', 'created': 'Fri, 31 Jan 2014 16:09:45 GMT'}]",2014-02-03,"[['Vishwakarma', 'Sanjay', ''], ['Chockalingam', 'A.', '']]","['Cooperative relaying', 'physical layer security', 'secret and nonsecret messages', 'secrecy rate', 'multiple eavesdroppers']"
16246,1610.01486,Tiago Tresoldi,Tiago Tresoldi,"A tentative model for dimensionless phoneme distance from binary
  distinctive features","draft, 6 tables, 1 figure",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work proposes a tentative model for the calculation of dimensionless
distances between phonemes; sounds are described with binary distinctive
features and distances show linear consistency in terms of such features. The
model can be used as a scoring function for local and global pairwise alignment
of phoneme sequences, and the distances can be used as prior probabilities for
Bayesian analyses on the phylogenetic relationship between languages,
particularly for cognate identification in cases where no empirical prior
probability is available.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2016 15:48:08 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Nov 2016 15:41:08 GMT'}]",2016-11-03,"[['Tresoldi', 'Tiago', '']]","['phonetic similarity', 'cognancy detection', 'string comparison']"
16247,1710.04728,Francisco J. Valverde-Albacete Dr.,Francisco J. Valverde-Albacete and Carmen Pel\'aez-Moreno,Entropy operates in non-linear semifields,"Version 2.0. Excised the case for shifting the R\'enyi entropy (see
  sibling paper). 20 pages, 3 figures, 2 tables",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We set out to demonstrate that the R\'enyi entropies with parameter $\alpha$
are better thought of as operating in a type of non-linear semiring called a
positive semifield. We show how the R\'enyi's postulates lead to Pap's
g-calculus where the functions carrying out the domain transformation are
Renyi's information function and its inverse. In its turn, Pap's g-calculus
under R\'enyi's information function transforms the set of positive reals into
a family of semirings where ""standard"" product has been transformed into sum
and ""standard"" sum into a power-deformed sum. Consequently, the transformed
product has an inverse whence the structure is actually that of a positive
semifield. Instances of this construction lead into idempotent analysis and
tropical algebra as well as to less exotic structures. Furthermore, shifting
the definition of the $\alpha$ parameter shows in full the intimate relation of
the R\'enyi entropies to the weighted generalized power means. We conjecture
that this is one of the reasons why tropical algebra procedures, like the
Viterbi algorithm of dynamic programming, morphological processing, or neural
networks are so successful in computational intelligence applications. But
also, why there seem to exist so many procedures to deal with ""information"" at
large.
","[{'version': 'v1', 'created': 'Thu, 12 Oct 2017 21:41:09 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Jun 2019 09:49:46 GMT'}]",2019-06-04,"[['Valverde-Albacete', 'Francisco J.', ''], ['Peláez-Moreno', 'Carmen', '']]","['Shifted Rényi entropy', 'Pap’s g-calculus', 'Generalized means', 'Positive semifields', 'Idempotent semifields']"
16248,1704.08134,Mohammadreza Soltaninejad,"Mohammadreza Soltaninejad, Lei Zhang, Tryphon Lambrou, Nigel Allinson,
  Xujiong Ye","Multimodal MRI brain tumor segmentation using random forests with
  features learned from fully convolutional neural network",,,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel learning based method for automated
segmenta-tion of brain tumor in multimodal MRI images. The machine learned
features from fully convolutional neural network (FCN) and hand-designed texton
fea-tures are used to classify the MRI image voxels. The score map with
pixel-wise predictions is used as a feature map which is learned from
multimodal MRI train-ing dataset using the FCN. The learned features are then
applied to random for-ests to classify each MRI image voxel into normal brain
tissues and different parts of tumor. The method was evaluated on BRATS 2013
challenge dataset. The results show that the application of the random forest
classifier to multimodal MRI images using machine-learned features based on FCN
and hand-designed features based on textons provides promising segmentations.
The Dice overlap measure for automatic brain tumor segmentation against ground
truth is 0.88, 080 and 0.73 for complete tumor, core and enhancing tumor,
respectively.
","[{'version': 'v1', 'created': 'Wed, 26 Apr 2017 14:22:02 GMT'}]",2017-04-27,"[['Soltaninejad', 'Mohammadreza', ''], ['Zhang', 'Lei', ''], ['Lambrou', 'Tryphon', ''], ['Allinson', 'Nigel', ''], ['Ye', 'Xujiong', '']]","['Deep learning', 'fully convolutional neural network', 'textons', 'random forests', 'brain tumor segmentation', 'multimodal MRI']"
16249,1208.6028,Sadik Ulker,Sadik Ulker,Design of Low Noise Amplifiers Using Particle Swarm Optimization,"8 pages, 4 figures","International Journal of Artificial Intelligence & Applications
  vol 3, no 4, July 2012, 99-106",,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This short paper presents a work on the design of low noise microwave
amplifiers using particle swarm optimization (PSO) technique. Particle Swarm
Optimization is used as a method that is applied to a single stage amplifier
circuit to meet two criteria: desired gain and desired low noise. The aim is to
get the best optimized design using the predefined constraints for gain and low
noise values. The code is written to apply the algorithm to meet the desired
goals and the obtained results are verified using different simulators. The
results obtained show that PSO can be applied very efficiently for this kind of
design problems with multiple constraints.
","[{'version': 'v1', 'created': 'Mon, 13 Aug 2012 11:32:03 GMT'}]",2012-08-31,"[['Ulker', 'Sadik', '']]","['Optimization Algorithms', 'Particle Swarm Optimization', 'Low Noise Microwave Amplifier Design']"
16250,1610.04610,Zahur Ullah,"Zahur Ullah, Lukasz Kaczmarczyk, Chris J. Pearce","Three-dimensional nonlinear micro/meso-mechanical response of the
  fibre-reinforced polymer composites",Submitted to Composite Structures,,,,cs.CE,http://creativecommons.org/licenses/by/4.0/,"  A three-dimensional multi-scale computational homogenisation framework is
developed for the prediction of nonlinear micro/meso-mechanical response of the
fibre-reinforced polymer (FRP) composites. Two dominant damage mechanisms, i.e.
matrix elasto-plastic response and fibre-matrix decohesion are considered and
modelled using a non-associative pressure dependent paraboloidal yield
criterion and cohesive interface elements respectively. A linear-elastic
transversely isotropic material model is used to model yarns/fibres within the
representative volume element (RVE). A unified approach is used to impose the
RVE boundary conditions, which allows convenient switching between linear
displacement, uniform traction and periodic boundary conditions. The
computational model is implemented within the framework of the hierarchic
finite element, which permits the use of arbitrary orders of approximation.
Furthermore, the computational framework is designed to take advantage of
distributed memory high-performance computing. The accuracy and performance of
the computational framework are demonstrated with a variety of numerical
examples, including unidirectional FRP composite, a composite comprising a
multi-fibre and multi-layer RVE, with randomly generated fibres, and a single
layered plain weave textile composite. Results are validated against the
reference experimental/numerical results from the literature. The computational
framework is also used to study the effect of matrix and fibre-matrix
interfaces properties on the homogenised stress-strain responses.
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2016 19:43:01 GMT'}]",2016-10-18,"[['Ullah', 'Zahur', ''], ['Kaczmarczyk', 'Lukasz', ''], ['Pearce', 'Chris J.', '']]","['Finite element analysis', 'Fibre reinforced polymer', 'Multi-scale']"
16251,1505.01621,Anupriya Gogna,"Anupriya Gogna, Angshul Majumdar",Blind Compressive Sensing Framework for Collaborative Filtering,5 pages,,,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Existing works based on latent factor models have focused on representing the
rating matrix as a product of user and item latent factor matrices, both being
dense. Latent (factor) vectors define the degree to which a trait is possessed
by an item or the affinity of user towards that trait. A dense user matrix is a
reasonable assumption as each user will like/dislike a trait to certain extent.
However, any item will possess only a few of the attributes and never all.
Hence, the item matrix should ideally have a sparse structure rather than a
dense one as formulated in earlier works. Therefore we propose to factor the
ratings matrix into a dense user matrix and a sparse item matrix which leads us
to the Blind Compressed Sensing (BCS) framework. We derive an efficient
algorithm for solving the BCS problem based on Majorization Minimization (MM)
technique. Our proposed approach is able to achieve significantly higher
accuracy and shorter run times as compared to existing approaches.
","[{'version': 'v1', 'created': 'Thu, 7 May 2015 08:19:05 GMT'}]",2015-05-08,"[['Gogna', 'Anupriya', ''], ['Majumdar', 'Angshul', '']]","['Blind compressive sensing', 'collaborative filtering', 'latent factor model', 'matrix factorization', 'recommender system']"
16252,1301.0373,Xu Zhiqiang,"Guangwu Xu, Zhiqiang Xu",Compressed Sensing Matrices from Fourier Matrices,17 pages,,,,cs.IT math.IT math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The class of Fourier matrices is of special importance in compressed sensing
(CS). This paper concerns deterministic construction of compressed sensing
matrices from Fourier matrices. By using Katz' character sum estimation, we are
able to design a deterministic procedure to select rows from a Fourier matrix
to form a good compressed sensing matrix for sparse recovery. The sparsity
bound in our construction is similar to that of binary CS matrices constructed
by DeVore which greatly improves previous results for CS matrices from Fourier
matrices. Our approach also provides more flexibilities in terms of the
dimension of CS matrices. As a consequence, our construction yields an
approximately mutually unbiased bases from Fourier matrices which is of
particular interest to quantum information theory. This paper also contains a
useful improvement to Katz' character sum estimation for quadratic extensions,
with an elementary and transparent proof. Some numerical examples are included.
","[{'version': 'v1', 'created': 'Thu, 3 Jan 2013 03:51:12 GMT'}]",2013-01-04,"[['Xu', 'Guangwu', ''], ['Xu', 'Zhiqiang', '']]","['ℓ1 minimization', 'sparse recovery', 'mutual incoherence', 'compressed sensingmatrices', 'deterministic construction', 'approximately mutually unbiased bases']"
16253,1606.07496,Roberto Camacho Barranco,"Roberto Camacho Barranco (1), Laura M. Rodriguez (1), Rebecca Urbina
  (1), and M. Shahriar Hossain (1) ((1) The University of Texas at El Paso)",Is a Picture Worth Ten Thousand Words in a Review Dataset?,"10 pages, 11 figures, ""for associated results, see
  http://http://auto-captioning.herokuapp.com/"" ""submitted to DLRS 2016
  workshop""",,,,cs.CV cs.CL cs.IR cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While textual reviews have become prominent in many recommendation-based
systems, automated frameworks to provide relevant visual cues against text
reviews where pictures are not available is a new form of task confronted by
data mining and machine learning researchers. Suggestions of pictures that are
relevant to the content of a review could significantly benefit the users by
increasing the effectiveness of a review. We propose a deep learning-based
framework to automatically: (1) tag the images available in a review dataset,
(2) generate a caption for each image that does not have one, and (3) enhance
each review by recommending relevant images that might not be uploaded by the
corresponding reviewer. We evaluate the proposed framework using the Yelp
Challenge Dataset. While a subset of the images in this particular dataset are
correctly captioned, the majority of the pictures do not have any associated
text. Moreover, there is no mapping between reviews and images. Each image has
a corresponding business-tag where the picture was taken, though. The overall
data setting and unavailability of crucial pieces required for a mapping make
the problem of recommending images for reviews a major challenge. Qualitative
and quantitative evaluations indicate that our proposed framework provides high
quality enhancements through automatic captioning, tagging, and recommendation
for mapping reviews and images.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2016 22:04:08 GMT'}]",2016-06-27,"[['Barranco', 'Roberto Camacho', '', 'The University of Texas at El Paso'], ['Rodriguez', 'Laura M.', '', 'The University of Texas at El Paso'], ['Urbina', 'Rebecca', '', 'The University of Texas at El Paso'], ['Hossain', 'M. Shahriar', '', 'The University of Texas at El Paso']]","['Yelp dataset', 'review enhancement', 'recommender systems', 'image captioning', 'image classification']"
16254,1309.7747,Lutz Bornmann Dr.,Lutz Bornmann,"Research misconduct: definitions, manifestations and extent",Accepted for publication in publications,,,,cs.CY cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, the international scientific community has been rocked by a
number of serious cases of research misconduct. In one of these, Woo Suk Hwang,
a Korean stem cell researcher published two articles on research with
ground-breaking results in Science in 2004 and 2005. Both articles were later
revealed to be fakes. This paper provides an overview of what research
misconduct is generally understood to be, its manifestations and the extent to
which they are thought to exist.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2013 08:13:42 GMT'}]",2013-10-01,"[['Bornmann', 'Lutz', '']]","['misconduct', 'plagiarism', 'fabrication', 'falsification of data']"
16255,1107.1950,Gopalakrishnan Tr Nair,"Dr T.R. Gopalakrishnan Nair, Meenakshi Malhotra",Knowledge Embedding and Retrieval Strategies in an Informledge System,"5 pages, 7 pages, International Conferenceon Information and
  Knowledge Management (ICIKM-IEEE), Haikou, China, 2011",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Informledge System (ILS) is a knowledge network with autonomous nodes and
intelligent links that integrate and structure the pieces of knowledge. In this
paper, we put forward the strategies for knowledge embedding and retrieval in
an ILS. ILS is a powerful knowledge network system dealing with logical storage
and connectivity of information units to form knowledge using autonomous nodes
and multi-lateral links. In ILS, the autonomous nodes known as Knowledge
Network Nodes (KNN)s play vital roles which are not only used in storage,
parsing and in forming the multi-lateral linkages between knowledge points but
also in helping the realization of intelligent retrieval of linked information
units in the form of knowledge. Knowledge built in to the ILS forms the shape
of sphere. The intelligence incorporated into the links of a KNN helps in
retrieving various knowledge threads from a specific set of KNNs. A developed
entity of information realized through KNN forms in to the shape of a knowledge
cone
","[{'version': 'v1', 'created': 'Mon, 11 Jul 2011 07:13:43 GMT'}]",2011-07-12,"[['Nair', 'Dr T. R. Gopalakrishnan', ''], ['Malhotra', 'Meenakshi', '']]","['Informledge System (ILS)', 'Knowledge Network Node (KNN)', 'Multi-lateral links', 'Link Manager', 'Knowledge Cone']"
16256,0906.3585,Arnab Bhattacharya,"Vishwakarma Singh, Arnab Bhattacharya, Ambuj K. Singh",Finding Significant Subregions in Large Image Databases,"16 pages, 48 figures",Extending Database Technology (EDBT) 2010,,,cs.DB cs.CV cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Images have become an important data source in many scientific and commercial
domains. Analysis and exploration of image collections often requires the
retrieval of the best subregions matching a given query. The support of such
content-based retrieval requires not only the formulation of an appropriate
scoring function for defining relevant subregions but also the design of new
access methods that can scale to large databases. In this paper, we propose a
solution to this problem of querying significant image subregions. We design a
scoring scheme to measure the similarity of subregions. Our similarity measure
extends to any image descriptor. All the images are tiled and each alignment of
the query and a database image produces a tile score matrix. We show that the
problem of finding the best connected subregion from this matrix is NP-hard and
develop a dynamic programming heuristic. With this heuristic, we develop two
index based scalable search strategies, TARS and SPARS, to query patterns in a
large image repository. These strategies are general enough to work with other
scoring schemes and heuristics. Experimental results on real image datasets
show that TARS saves more than 87% query time on small queries, and SPARS saves
up to 52% query time on large queries as compared to linear search. Qualitative
tests on synthetic and real datasets achieve precision of more than 80%.
","[{'version': 'v1', 'created': 'Fri, 19 Jun 2009 06:57:51 GMT'}]",2010-03-09,"[['Singh', 'Vishwakarma', ''], ['Bhattacharya', 'Arnab', ''], ['Singh', 'Ambuj K.', '']]","['Image Databases', 'Score', 'NP-Complete', 'Dynamic Programming', 'Index Structure']"
16257,1702.06820,Zhengxing Chen,"Zhengxing Chen, Su Xue, John Kolen, Navid Aghdaie, Kazi A. Zaman,
  Yizhou Sun, Magy Seif El-Nasr",EOMM: An Engagement Optimized Matchmaking Framework,WWW2017,,,,cs.SI cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Matchmaking connects multiple players to participate in online
player-versus-player games. Current matchmaking systems depend on a single core
strategy: create fair games at all times. These systems pair similarly skilled
players on the assumption that a fair game is best player experience. We will
demonstrate, however, that this intuitive assumption sometimes fails and that
matchmaking based on fairness is not optimal for engagement.
  In this paper, we propose an Engagement Optimized Matchmaking (EOMM)
framework that maximizes overall player engagement. We prove that equal-skill
based matchmaking is a special case of EOMM on a highly simplified assumption
that rarely holds in reality. Our simulation on real data from a popular game
made by Electronic Arts, Inc. (EA) supports our theoretical results, showing
significant improvement in enhancing player engagement compared to existing
matchmaking methods.
","[{'version': 'v1', 'created': 'Wed, 22 Feb 2017 14:51:52 GMT'}]",2018-06-27,"[['Chen', 'Zhengxing', ''], ['Xue', 'Su', ''], ['Kolen', 'John', ''], ['Aghdaie', 'Navid', ''], ['Zaman', 'Kazi A.', ''], ['Sun', 'Yizhou', ''], ['El-Nasr', 'Magy Seif', '']]","['matchmaking', 'player engagement', 'video games']"
16258,1110.3030,Bart Kuijpers,"Joos Heintz, Bart Kuijpers and Andres Rojas Paredes",Software Engineering and Complexity in Effective Algebraic Geometry,"70 pages. arXiv admin note: substantial text overlap with
  arXiv:1201.4344",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the notion of a robust parameterized arithmetic circuit for the
evaluation of algebraic families of multivariate polynomials. Based on this
notion, we present a computation model, adapted to Scientific Computing, which
captures all known branching parsimonious symbolic algorithms in effective
Algebraic Geometry. We justify this model by arguments from Software
Engineering. Finally we exhibit a class of simple elimination problems of
effective Algebraic Geometry which require exponential time to be solved by
branching parsimonious algorithms of our computation model.
","[{'version': 'v1', 'created': 'Thu, 13 Oct 2011 18:58:45 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Oct 2011 19:06:43 GMT'}, {'version': 'v3', 'created': 'Wed, 25 Apr 2012 19:56:08 GMT'}]",2012-04-26,"[['Heintz', 'Joos', ''], ['Kuijpers', 'Bart', ''], ['Paredes', 'Andres Rojas', '']]","['Robust parameterized arithmetic circuit', 'isoparametric routine', 'branching parsimonious algorithm', 'flat family of zero dimensional eliminationproblems']"
16259,1704.02218,Hamed R. Tavakoli,"Hamed R. Tavakoli, Jorma Laaksonen, and Esa Rahtu","Investigating Natural Image Pleasantness Recognition using Deep Features
  and Eye Tracking for Loosely Controlled Human-computer Interaction",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper revisits recognition of natural image pleasantness by employing
deep convolutional neural networks and affordable eye trackers. There exist
several approaches to recognize image pleasantness: (1) computer vision, and
(2) psychophysical signals. For natural images, computer vision approaches have
not been as successful as for abstract paintings and is lagging behind the
psychophysical signals like eye movements. Despite better results, the
scalability of eye movements is adversely affected by the sensor cost. While
the introduction of affordable sensors have helped the scalability issue by
making the sensors more accessible, the application of such sensors in a
loosely controlled human-computer interaction setup is not yet studied for
affective image tagging. On the other hand, deep convolutional neural networks
have boosted the performance of vision-based techniques significantly in recent
years. To investigate the current status in regard to affective image tagging,
we (1) introduce a new eye movement dataset using an affordable eye tracker,
(2) study the use of deep neural networks for pleasantness recognition, (3)
investigate the gap between deep features and eye movements. To meet these
ends, we record eye movements in a less controlled setup, akin to daily
human-computer interaction. We assess features from eye movements, visual
features, and their combination. Our results show that (1) recognizing natural
image pleasantness from eye movement under less restricted setup is difficult
and previously used techniques are prone to fail, and (2) visual class
categories are strong cues for predicting pleasantness, due to their
correlation with emotions, necessitating careful study of this phenomenon. This
latter finding is alerting as some deep learning approaches may fit to the
class category bias.
","[{'version': 'v1', 'created': 'Fri, 7 Apr 2017 13:16:17 GMT'}]",2017-04-10,"[['Tavakoli', 'Hamed R.', ''], ['Laaksonen', 'Jorma', ''], ['Rahtu', 'Esa', '']]","['Affective image tagging', 'natural image pleasantness', 'eye tracking', 'deep features']"
16260,1401.4891,Ahmed Ben Achballah,Ahmed Ben Achballah and Slim Ben Saoud,"The Design of a Network-On-Chip Architecture Based On An Avionic
  Protocol","5 pages World Symposium on Computer Applications & Research WSCAR'
  2014, 18-20 January, Sousse, Tunisia",,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When the Network-On-Chip (NoC) paradigm was introduced, many researchers have
proposed many novelistic NoC architectures, tools and design strategies. In
this paper we introduce a new approach in the field of designing
Network-On-Chip (NoC). Our inspiration came from an avionic protocol which is
the AFDX protocol. The proposed NoC architecture is a switch centric
architecture, with exclusive shortcuts between hosts and utilizes the
flexibility, the reliability and the performances offered by AFDX.
","[{'version': 'v1', 'created': 'Mon, 20 Jan 2014 13:20:58 GMT'}]",2014-01-21,"[['Achballah', 'Ahmed Ben', ''], ['Saoud', 'Slim Ben', '']]","['NoC', 'AFDX', 'Hardware Design', 'Embedded Systems', 'FPGA based prototyping']"
16261,1205.4832,Somdip Dey Mr.,Somdip Dey,SD-REE: A Cryptographic Method to Exclude Repetition from a Message,"7 Pages,1 table for Results, 1 table for Cryptanalysis and 6 figures","Proceedings of The International Conference on Informatics and
  Applications (ICIA2012), Malaysia",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the author presents a new cryptographic technique, SD-REE, to
exclude the repetitive terms in a message, when it is to be encrypted, so that
it becomes almost impossible for a person to retrieve or predict the original
message from the encrypted message. In modern world, cryptography hackers try
to break a code or cryptographic algorithm [1,2] or retrieve the key, used for
encryption, by inserting repetitive bytes / characters in the message and
encrypt the message or by analyzing repetitions in the encrypted message, to
find out the encryption algorithm or retrieve the key used for the encryption.
But in SD-REE method the repetitive bytes / characters are removed and there is
no trace of any repetition in the message, which was encrypted.
","[{'version': 'v1', 'created': 'Tue, 22 May 2012 08:02:59 GMT'}]",2012-05-23,"[['Dey', 'Somdip', '']]","['Cryptography', 'repetition exclusion', 'encryption', 'decryption;']"
16262,1010.4887,Muhammad Ibrahim Channa,Muhammad Ibrahim Channa and Kazi M. Ahmed,Emergency Response Communications and Associated Security Challenges,14 pages and 11 figures,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The natural or man-made disaster demands an efficient communication and
coordination among first responders to save life and other community resources.
Normally, the traditional communication infrastructures such as land line or
cellular networks are damaged and don't provide adequate communication services
to first responders for exchanging emergency related information. Wireless ad
hoc networks such as mobile ad hoc networks, wireless sensor networks and
wireless mesh networks are the promising alternatives in such type of
situations. The security requirements for emergency response communications
include privacy, data integrity, authentication, key management, access control
and availability. Various ad hoc communication frameworks have been proposed
for emergency response situations. The majority of the proposed frameworks
don't provide adequate security services for reliable and secure information
exchange. This paper presents a survey of the proposed emergency response
communication frameworks and the potential security services required by them
to provide reliable and secure information exchange during emergency
situations.
","[{'version': 'v1', 'created': 'Sat, 23 Oct 2010 15:24:22 GMT'}]",2010-10-26,"[['Channa', 'Muhammad Ibrahim', ''], ['Ahmed', 'Kazi M.', '']]","['Emergency response communication', 'Mobile ad hoc networks', 'Wireless sensor networks', 'Wireless mesh networks', 'Security', 'Reliability']"
16263,1402.1242,Shafi'i Muhammad Abdulhamid Mr,"Ismaila Idris, Shafii Muhammad Abdulhamid",An Improved AIS Based E-mail Classification Technique for Spam Detection,"6 pages, 2 figures, 1 table","The Eighth International Conference on eLearning for
  Knowledge-Based Society, 23-24 February 2012, Thailand",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An improved email classification method based on Artificial Immune System is
proposed in this paper to develop an immune based system by using the immune
learning, immune memory in solving complex problems in spam detection. An
optimized technique for e-mail classification is accomplished by distinguishing
the characteristics of spam and non-spam that is been acquired from trained
data set. These extracted features of spam and non-spam are then combined to
make a single detector, therefore reducing the false rate. (Non-spam that were
wrongly classified as spam). Effectiveness of our technique in decreasing the
false rate shall be demonstrated by the result that will be acquired.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2014 04:27:50 GMT'}]",2014-02-07,"[['Idris', 'Ismaila', ''], ['Abdulhamid', 'Shafii Muhammad', '']]","['Algorithm', 'Artificial immunesystem', 'E-mail Classification', 'Non-Spam', 'Spam']"
16264,1304.2112,M.M.A. Hashem,"Md. Nazrul Islam, M.M.A. Hashem and A. M. Moshiur Rahman","A Probabilistic Algorithm for Reducing Broadcast Redundancy in Ad Hoc
  Wireless Networks",,"Procs. of the 8th International Conference on Computer &
  Information Technology (ICCIT 2005), pp. 752-757, Dhaka, Bangladesh, December
  28-30, (2005)",,,cs.NI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a wired network, a packet can be transmitted to a specified destination
only, no broadcasting required. But in ad hoc wireless network a packet
transmitted by a node can reach all neighbors due to broadcasting. This
broadcasting introduces unnecessary retransmissions of same message. Therefore,
the total number of transmissions (forward nodes) is generally used as the cost
criterion for broadcasting. The problem of finding the minimum number of
forward nodes is NP-complete. In this paper, the goal is to reduce the number
of forward nodes which will reduce redundant transmission as a result. Thus
some of approximation approaches are analyzed, especially dominant pruning and
total dominant pruning which use 2-hop neighborhood information and a new
approach: Probability based algorithm is proposed with a view to minimizing
number of forward nodes. Simulation results of applying this algorithm shows
performance improvements with compared to dominant pruning and total dominant
pruning algorithms.
","[{'version': 'v1', 'created': 'Mon, 8 Apr 2013 06:35:33 GMT'}]",2013-04-09,"[['Islam', 'Md. Nazrul', ''], ['Hashem', 'M. M. A.', ''], ['Rahman', 'A. M. Moshiur', '']]","['Ad Hoc Wireless Networks', 'Broadcast Redundancy', 'Dominant Pruning', 'Flooding']"
16265,1401.7416,Pandiselvam Pps,"Pandiselvam.P, Marimuthu.T and Lawrance.R",A Comparative Study on String Matching Algorithm of Biological Sequences,Selected For International Conference on Intelligent Computing,,,,cs.DS cs.CE,http://creativecommons.org/licenses/by/3.0/,"  String matching algorithm plays the vital role in the Computational Biology.
The functional and structural relationship of the biological sequence is
determined by similarities on that sequence. For that, the researcher is
supposed to aware of similarities on the biological sequences. Pursuing of
similarity among biological sequences is an important research area of that can
bring insight into the evolutionary and genetic relationships among the genes.
In this paper, we have studied different kinds of string matching algorithms
and observed their time and space complexities. For this study, we have
assessed the performance of algorithms tested with biological sequences.
","[{'version': 'v1', 'created': 'Wed, 29 Jan 2014 05:39:11 GMT'}]",2014-01-30,"[['P', 'Pandiselvam.', ''], ['T', 'Marimuthu.', ''], ['R', 'Lawrance.', '']]","['String matching algorithms', 'DNA sequence', 'Distance']"
16266,1212.5764,Ayman Ghoneim,Ayman Ghoneim and Robert C. Williamson,Strategy-Proof Prediction Markets,9 pages,,,,cs.GT cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Prediction markets aggregate agents' beliefs regarding a future event, where
each agent is paid based on the accuracy of its reported belief when compared
to the realized outcome. Agents may strategically manipulate the market (e.g.,
delay reporting, make false reports) aiming for higher expected payments, and
hence the accuracy of the market's aggregated information will be in question.
In this study, we present a general belief model that captures how agents
influence each other beliefs, and show that there are three necessary and
sufficient conditions for agents to behave truthfully in scoring rule based
markets (SRMs). Given that these conditions are restrictive and difficult to
satisfy in real-life, we present novel strategy-proof SRMs where agents are
truthful while dismissing all these conditions. Although achieving such a
strong form of truthfulness increases the worst-case loss in the new markets,
we show that this is the minimum loss required to dismiss these conditions.
","[{'version': 'v1', 'created': 'Sun, 23 Dec 2012 05:57:01 GMT'}]",2012-12-27,"[['Ghoneim', 'Ayman', ''], ['Williamson', 'Robert C.', '']]","['Prediction Markets', 'Scoring Rules', 'Mechanism Design']"
16267,1002.0416,Dakshina Ranjan Kisku,"Dakshina Ranjan Kisku, Phalguni Gupta, Jamuna Kanta Sing","Fusion of Multiple Matchers using SVM for Offline Signature
  Identification","8 pages, 2 figures",,,,cs.CV cs.LG,http://creativecommons.org/licenses/by/3.0/,"  This paper uses Support Vector Machines (SVM) to fuse multiple classifiers
for an offline signature system. From the signature images, global and local
features are extracted and the signatures are verified with the help of
Gaussian empirical rule, Euclidean and Mahalanobis distance based classifiers.
SVM is used to fuse matching scores of these matchers. Finally, recognition of
query signatures is done by comparing it with all signatures of the database.
The proposed system is tested on a signature database contains 5400 offline
signatures of 600 individuals and the results are found to be promising.
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2010 08:15:20 GMT'}]",2010-02-04,"[['Kisku', 'Dakshina Ranjan', ''], ['Gupta', 'Phalguni', ''], ['Sing', 'Jamuna Kanta', '']]","['Offline Signature Verification', 'Biometric Classifiers', 'Global and Local features', 'Distance Metrics', 'Support Vector Machines']"
16268,0905.4592,Omar Sakka,"Omar Sakka (LIESP), Valerie Botta-Genoulaz (LIESP), Lorraine Trilling
  (LIESP)","Mod\'elisation des facteurs influen\c{c}ant la performance de la
  cha\^ine logistique",7 pages,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Improvement of industrial performance such as cost, lead-time, adaptability,
variety and traceability is the major finality of companies. At this need
corresponds the necessity to collaborate and to strengthen their coordination
mechanisms. Information exchange becomes then a strategic question: what is the
nature of the information that can be shared with customers and suppliers?
Which impact on the performance of a company is expectable? What about the
performance of the whole supply chain? It is essential for a company to
identify the information whose exchange contributes to its performance and to
control its information flows. This study aims to release from the literature
the main tendencies of collaboration practices and information exchanges
leading to the performance and to propose a model of hypothesis gathering these
practices.
","[{'version': 'v1', 'created': 'Thu, 28 May 2009 09:49:02 GMT'}]",2009-05-29,"[['Sakka', 'Omar', '', 'LIESP'], ['Botta-Genoulaz', 'Valerie', '', 'LIESP'], ['Trilling', 'Lorraine', '', 'LIESP']]","['supply chain', 'performance', 'practices', 'collaboration', 'information exchange']"
16269,1602.08556,Syed Shakib Sarwar,"Gopalakrishnan Srinivasan, Parami Wijesinghe, Syed Shakib Sarwar,
  Akhilesh Jaiswal, and Kaushik Roy","Significance Driven Hybrid 8T-6T SRAM for Energy-Efficient Synaptic
  Storage in Artificial Neural Networks","Accepted in Design, Automation and Test in Europe 2016 conference
  (DATE-2016)","In Design, Automation & Test in Europe Conference & Exhibition
  (DATE), 2016, pp. 151-156",,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multilayered artificial neural networks (ANN) have found widespread utility
in classification and recognition applications. The scale and complexity of
such networks together with the inadequacies of general purpose computing
platforms have led to a significant interest in the development of efficient
hardware implementations. In this work, we focus on designing energy efficient
on-chip storage for the synaptic weights. In order to minimize the power
consumption of typical digital CMOS implementations of such large-scale
networks, the digital neurons could be operated reliably at scaled voltages by
reducing the clock frequency. On the contrary, the on-chip synaptic storage
designed using a conventional 6T SRAM is susceptible to bitcell failures at
reduced voltages. However, the intrinsic error resiliency of NNs to small
synaptic weight perturbations enables us to scale the operating voltage of the
6TSRAM. Our analysis on a widely used digit recognition dataset indicates that
the voltage can be scaled by 200mV from the nominal operating voltage (950mV)
for practically no loss (less than 0.5%) in accuracy (22nm predictive
technology). Scaling beyond that causes substantial performance degradation
owing to increased probability of failures in the MSBs of the synaptic weights.
We, therefore propose a significance driven hybrid 8T-6T SRAM, wherein the
sensitive MSBs are stored in 8T bitcells that are robust at scaled voltages due
to decoupled read and write paths. In an effort to further minimize the area
penalty, we present a synaptic-sensitivity driven hybrid memory architecture
consisting of multiple 8T-6T SRAM banks. Our circuit to system-level simulation
framework shows that the proposed synaptic-sensitivity driven architecture
provides a 30.91% reduction in the memory access power with a 10.41% area
overhead, for less than 1% loss in the classification accuracy.
","[{'version': 'v1', 'created': 'Sat, 27 Feb 2016 05:36:42 GMT'}]",2017-11-13,"[['Srinivasan', 'Gopalakrishnan', ''], ['Wijesinghe', 'Parami', ''], ['Sarwar', 'Syed Shakib', ''], ['Jaiswal', 'Akhilesh', ''], ['Roy', 'Kaushik', '']]","['Artificial Neural Networks', 'Hybrid 8T-6T SRAM', 'Significance Driven Computation', 'Error Resilient Design']"
16270,0711.1401,Keki Burjorjee,Keki Burjorjee,Towards a Sound Theory of Adaptation for the Simple Genetic Algorithm,Typos corrected. No material changes to content,,,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The pace of progress in the fields of Evolutionary Computation and Machine
Learning is currently limited -- in the former field, by the improbability of
making advantageous extensions to evolutionary algorithms when their capacity
for adaptation is poorly understood, and in the latter by the difficulty of
finding effective semi-principled reductions of hard real-world problems to
relatively simple optimization problems. In this paper we explain why a theory
which can accurately explain the simple genetic algorithm's remarkable capacity
for adaptation has the potential to address both these limitations. We describe
what we believe to be the impediments -- historic and analytic -- to the
discovery of such a theory and highlight the negative role that the building
block hypothesis (BBH) has played. We argue based on experimental results that
a fundamental limitation which is widely believed to constrain the SGA's
adaptive ability (and is strongly implied by the BBH) is in fact illusionary
and does not exist. The SGA therefore turns out to be more powerful than it is
currently thought to be. We give conditions under which it becomes feasible to
numerically approximate and study the multivariate marginals of the search
distribution of an infinite population SGA over multiple generations even when
its genomes are long, and explain why this analysis is relevant to the riddle
of the SGA's remarkable adaptive abilities.
","[{'version': 'v1', 'created': 'Fri, 9 Nov 2007 02:28:12 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Apr 2009 15:28:06 GMT'}]",2009-04-03,"[['Burjorjee', 'Keki', '']]","['genetic algorithm', 'optimization', 'adaptation', 'non-convex', 'machine learning']"
16271,1009.2411,Nikolai Stoianov,Nikolai Stoianov,"A Protection Approach for Video Information transmitted in TCP/IP based
  networks","5 pages, 7 figures, 3rd INDECT/IEEE International Conference on MCSS
  on May 6th and 7th, Krakow, Poland","PROCEEDINGS IEEE International Conference MCSS 2010 Multimedia
  Communications, Services and Security Krakow, 6-7 May 2010, ISBN
  978-83-88309-92-2 ,",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper an analysis of the existing video information protection
methods is made. Analysis of current H.323 protocol stack has been made. A new
encryption/decryption layer has been suggested. An approach for partial data
encryption in the H.323 protocol stack is proposed and sample architecture of a
Virtual Private Video Network is given.
","[{'version': 'v1', 'created': 'Mon, 13 Sep 2010 15:03:16 GMT'}]",2010-09-14,"[['Stoianov', 'Nikolai', '']]","['encryption', 'video', 'network']"
16272,1304.0600,Roman Bezhencev Vadimovich,Bezhentcev Roman Vadimovich,Software for creating pictures in the LaTeX environment,"8 pages, 1 figure, 2 formulas, sourcecode",,,,cs.GR,http://creativecommons.org/licenses/by/3.0/,"  To create a text with graphic instructions for output pictures into LATEX
document, we offer software that allows us to build a picture in WIZIWIG mode
and for setting the text with these graphical instructions.
","[{'version': 'v1', 'created': 'Tue, 2 Apr 2013 11:55:33 GMT'}]",2013-04-03,"[['Vadimovich', 'Bezhentcev Roman', '']]","['LATEX', 'TEX', 'GUI', 'drawing']"
16273,1705.06353,Christophe Bruchansky,Christophe Bruchansky,"Political Footprints: Political Discourse Analysis using Pre-Trained
  Word Vectors",,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we discuss how machine learning could be used to produce a
systematic and more objective political discourse analysis. Political
footprints are vector space models (VSMs) applied to political discourse. Each
of their vectors represents a word, and is produced by training the English
lexicon on large text corpora. This paper presents a simple implementation of
political footprints, some heuristics on how to use them, and their application
to four cases: the U.N. Kyoto Protocol and Paris Agreement, and two U.S.
presidential elections. The reader will be offered a number of reasons to
believe that political footprints produce meaningful results, along with some
suggestions on how to improve their implementation.
","[{'version': 'v1', 'created': 'Wed, 17 May 2017 21:29:08 GMT'}]",2017-05-19,"[['Bruchansky', 'Christophe', '']]","['machine learning', 'natural language processing', 'vector space model', 'political discourse', 'semantics', 'wordembeddings']"
16274,1307.3435,Hadi Mohasel Afshar,Hadi Mohasel Afshar and Peter Sunehag,"On Nicod's Condition, Rules of Induction and the Raven Paradox","On raven paradox, Nicod's condition, projectability, induction",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Philosophers writing about the ravens paradox often note that Nicod's
Condition (NC) holds given some set of background information, and fails to
hold against others, but rarely go any further. That is, it is usually not
explored which background information makes NC true or false. The present paper
aims to fill this gap. For us, ""(objective) background knowledge"" is restricted
to information that can be expressed as probability events. Any other
configuration is regarded as being subjective and a property of the a priori
probability distribution. We study NC in two specific settings. In the first
case, a complete description of some individuals is known, e.g. one knows of
each of a group of individuals whether they are black and whether they are
ravens. In the second case, the number of individuals having a particular
property is given, e.g. one knows how many ravens or how many black things
there are (in the relevant population). While some of the most famous answers
to the paradox are measure-dependent, our discussion is not restricted to any
particular probability measure. Our most interesting result is that in the
second setting, NC violates a simple kind of inductive inference (namely
projectability). Since relative to NC, this latter rule is more closely related
to, and more directly justified by our intuitive notion of inductive reasoning,
this tension makes a case against the plausibility of NC. In the end, we
suggest that the informal representation of NC may seem to be intuitively
plausible because it can easily be mistaken for reasoning by analogy.
","[{'version': 'v1', 'created': 'Fri, 12 Jul 2013 12:28:38 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Jul 2013 02:22:09 GMT'}]",2013-07-17,"[['Afshar', 'Hadi Mohasel', ''], ['Sunehag', 'Peter', '']]","['Nicod’s condition (NC)', 'Raven paradox', 'weak projectability (PJ)', 'reasoningby analogy (RA)', 'inductive inference']"
16275,1409.2733,Jean-Florent Raymond,"Aistis Atminas, Marcin Kami\'nski and Jean-Florent Raymond",Scattered packings of cycles,17 pages,,,,cs.DM cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem Scattered Cycles which, given a graph $G$ and two
positive integers $r$ and $\ell$, asks whether $G$ contains a collection of $r$
cycles that are pairwise at distance at least $\ell$. This problem generalizes
the problem Disjoint Cycles which corresponds to the case $\ell = 1$. We prove
that when parameterized by $r$, $\ell$, and the maximum degree $\Delta$, the
problem Scattered Cycles admits a kernel on $24 \ell^2 \Delta^\ell r \log(8
\ell^2 \Delta^\ell r)$ vertices. We also provide a $(16 \ell^2
\Delta^\ell)$-kernel for the case $r=2$ and a $(148 \Delta r \log r)$-kernel
for the case $\ell = 1$. Our proofs rely on two simple reduction rules and a
careful analysis.
","[{'version': 'v1', 'created': 'Tue, 9 Sep 2014 13:34:53 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Sep 2014 11:31:16 GMT'}, {'version': 'v3', 'created': 'Thu, 25 Jun 2015 14:46:42 GMT'}, {'version': 'v4', 'created': 'Tue, 26 Jul 2016 18:05:31 GMT'}]",2016-07-27,"[['Atminas', 'Aistis', ''], ['Kamiński', 'Marcin', ''], ['Raymond', 'Jean-Florent', '']]","['cycle packing', 'kernelization', 'multivariate algorithms', 'induced structures']"
16276,0804.1270,Michel Grabisch,"Michel Grabisch (LIP6), Bernard De Baets, Janos Fodor",The quest for rings on bipolar scales,,"International Journal of Uncertainty Fuzziness and Knowledge-Based
  Systems (2004) 499-512",,,cs.DM math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the interval $]{-1},1[$ and intend to endow it with an algebraic
structure like a ring. The motivation lies in decision making, where scales
that are symmetric w.r.t. 0 are needed in order to represent a kind of symmetry
in the behaviour of the decision maker. A former proposal due to Grabisch was
based on maximum and minimum. In this paper, we propose to build our structure
on t-conorms and t-norms, and we relate this construction to uninorms. We show
that the only way to build a group is to use strict t-norms, and that there is
no way to build a ring. Lastly, we show that the main result of this paper is
connected to the theory of ordered Abelian groups.
","[{'version': 'v1', 'created': 'Tue, 8 Apr 2008 13:23:54 GMT'}]",2008-12-18,"[['Grabisch', 'Michel', '', 'LIP6'], ['De Baets', 'Bernard', ''], ['Fodor', 'Janos', '']]","['ordered group', 'pseudo-addition', 'pseudo-multiplication', 't-conorm', 't-norm', 'uninorm']"
16277,1312.6370,Deepak Nayak Ranjan,Jahangir Mohammed and Deepak Ranjan Nayak,"An Efficient Edge Detection Technique by Two Dimensional Rectangular
  Cellular Automata","4 pages, 6 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a new pattern of two dimensional cellular automata linear
rules that are used for efficient edge detection of an image. Since cellular
automata is inherently parallel in nature, it has produced desired output
within a unit time interval. We have observed four linear rules among 512 total
linear rules of a rectangular cellular automata in adiabatic or reflexive
boundary condition that produces an optimal result. These four rules are
directly applied once to the images and produced edge detected output. We
compare our results with the existing edge detection algorithms and found that
our results shows better edge detection with an enhancement of edges.
","[{'version': 'v1', 'created': 'Sun, 22 Dec 2013 12:08:20 GMT'}]",2013-12-24,"[['Mohammed', 'Jahangir', ''], ['Nayak', 'Deepak Ranjan', '']]","['Cellular Automata(CA)', 'Linear rule', 'Rule matrix', 'Adiabatic boundary condition', 'Problem matrix', 'Edge detection']"
16278,1507.01706,Hans-Joachim Hof,"Rainer Falk, Steffen Fries, Hans-Joachim Hof","ASIA: An Access Control, Session Invocation and Authorization
  Architecture for Home Energy Appliances in Smart Energy Grid Environments",,"ENERGY 2011: The First International Conference on Smart Grids,
  Green Communications and IT Energy-aware Technologies, pp. 19-26, ISBN:
  978-1-61208-136-6, 2011",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the advent of the smart energy grid - an energy transportation and
distribution network being combined with an IT network for its monitoring and
control - information security has gained tremendous importance for energy
distribution and energy automa- tion systems. Integrated security functionality
is crucial to ensure a reliable and continuous operation of the smart energy
grid. Further security related challenges arise from the integration of
millions of smart homes into the smart grid. This paper gives an overview of
the smart energy grid environment and its challenges. Many future use cases are
centered around the smart home, using an ICT gateway. Approaches to protect the
access and data exchange are described, preventing manipulation of ICT gateway
operation. The paper presents ASIA - an Authentication, Session Invocation, and
Authorization component to be used in the smart energy grid, to protect ICT
gateways and to cope with problems like ICT gateway discovery and ICT gateway
addressing.
","[{'version': 'v1', 'created': 'Tue, 7 Jul 2015 08:41:42 GMT'}]",2015-07-14,"[['Falk', 'Rainer', ''], ['Fries', 'Steffen', ''], ['Hof', 'Hans-Joachim', '']]","['Smart Grid', 'Information Security', 'Cyber Security', 'Authentication', 'Authorization', 'Energy Automation', 'Smart Home', 'Discovery']"
16279,1702.05354,Paul Lagr\'ee,"Paul Lagr\'ee, Olivier Capp\'e, Bogdan Cautis and Silviu Maniu",Algorithms for Online Influencer Marketing,29 pages,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Influence maximization is the problem of finding influential users, or nodes,
in a graph so as to maximize the spread of information. It has many
applications in advertising and marketing on social networks. In this paper, we
study a highly generic version of influence maximization, one of optimizing
influence campaigns by sequentially selecting ""spread seeds"" from a set of
influencers, a small subset of the node population, under the hypothesis that,
in a given campaign, previously activated nodes remain ""persistently"" active
throughout and thus do not yield further rewards. This problem is in particular
relevant for an important form of online marketing, known as influencer
marketing, in which the marketers target a sub-population of influential
people, instead of the entire base of potential buyers. Importantly, we make no
assumptions on the underlying diffusion model and we work in a setting where
neither a diffusion network nor historical activation data are available. We
call this problem online influencer marketing with persistence (in short,
OIMP). We first discuss motivating scenarios and present our general approach.
We introduce an estimator on the influencers' remaining potential -- the
expected number of nodes that can still be reached from a given influencer --
and justify its strength to rapidly estimate the desired value, relying on real
data gathered from Twitter. We then describe a novel algorithm, GT-UCB, relying
on upper confidence bounds on the remaining potential. We show that our
approach leads to high-quality spreads on both simulated and real datasets,
even though it makes almost no assumptions on the diffusion medium.
Importantly, it is orders of magnitude faster than state-of-the-art influence
maximization methods, making it possible to deal with large-scale online
scenarios.
","[{'version': 'v1', 'created': 'Fri, 17 Feb 2017 14:23:14 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Oct 2017 18:46:51 GMT'}]",2017-10-25,"[['Lagrée', 'Paul', ''], ['Cappé', 'Olivier', ''], ['Cautis', 'Bogdan', ''], ['Maniu', 'Silviu', '']]","['Influencer marketing', 'information diffusion', 'online social networks', 'influence maximization', 'online learning', 'multi-armed bandits']"
16280,1306.0785,Jean Gregoire,"Jean Gregoire, Silv\`ere Bonnabel, Arnaud de La Fortelle","Robust multirobot coordination using priority encoded homotopic
  constraints","21 pages, in revision for publication in System & Control Letters",,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of coordinating multiple robots along fixed geometric
paths. Our contribution is threefold. First we formalize the intuitive concept
of priorities as a binary relation induced by a feasible coordination solution,
without excluding the case of robots following each other on the same geometric
path. Then we prove that two paths in the coordination space are continuously
deformable into each other if and only if they induce the \emph{same priority
graph}, that is, the priority graph uniquely encodes homotopy classes of
coordination solutions. Finally, we give a simple control law allowing to
safely navigate into homotopy classes \emph{under kinodynamic constraints} even
in the presence of unexpected events, such as a sudden robot deceleration
without notice. It appears the freedom within homotopy classes allows to much
deviate from any pre-planned trajectory without ever colliding nor having to
re-plan the assigned priorities.
","[{'version': 'v1', 'created': 'Tue, 4 Jun 2013 13:40:47 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Apr 2014 10:06:28 GMT'}, {'version': 'v3', 'created': 'Tue, 4 Aug 2015 16:33:59 GMT'}]",2015-08-05,"[['Gregoire', 'Jean', ''], ['Bonnabel', 'Silvère', ''], ['de La Fortelle', 'Arnaud', '']]","['multirobot control', 'coordination', 'motion planning', 'homotopicconstraints', 'robustness', 'priority graph']"
16281,1606.06961,Pasquale Salza,Pasquale Salza and Filomena Ferrucci,"An Approach for Parallel Genetic Algorithms in the Cloud using Software
  Containers",,,,,cs.NE cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Genetic Algorithms (GAs) are a powerful technique to address hard
optimisation problems. However, scalability issues might prevent them from
being applied to real-world problems. Exploiting parallel GAs in the cloud
might be an affordable approach to get time efficient solutions that benefit of
the appealing features of the cloud, such as scalability, reliability,
fault-tolerance and cost-effectiveness. Nevertheless, distributed computation
is very prone to cause considerable overhead for communication and making GAs
distributed in an on-demand fashion is not trivial. Aiming to keep under
control the communication overhead and support GAs developers in the
construction and deployment of parallel GAs in the cloud, in this paper we
propose an approach to distribute GAs using the global parallelisation model,
exploiting software containers and their cloud orchestration. We also devised a
conceptual workflow covering each cloud GAs distribution phase, from resources
allocation to actual deployment and execution, in a DevOps fashion.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2016 14:32:34 GMT'}]",2016-06-23,"[['Salza', 'Pasquale', ''], ['Ferrucci', 'Filomena', '']]","['Parallel Genetic Algorithms', 'Cloud Computing', 'DevOps', 'Container Virtualisation']"
16282,1610.01455,Zhenwu Shi,"Zhenwu Shi, Ningshi Yao, and Fumin Zhang","Scheduling Feasibility of Energy Management in Micro-grids Based on
  Significant Moment Analysis",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies the operation and scheduling of electric loads in
micro-grid, a highly automated and distributed cyber-physical energy system
(CPES). We establish rigorous mathematical expressions for electric loads and
battery banks in the micro-grid by considering their characteristics and
constraints. Based on these mathematical models, we propose a novel real-time
scheduling analysis method for priority-based energy management in micro-grid,
named Significant Moments Analysis (SMA). SMA pinpoints all the crucial moments
when electrical operations are requested among the micro-grid and establishes a
dynamic model to describe the scheduling behavior of electric loads. Using SMA,
we can check the scheduling feasibility and predict whether the micro-grid can
generate enough power to support the execution of electric loads. In the case
where the power is insufficient to supply load demands, SMA can provide
accurate information about the amount of insufficient power and the time when
the insufficiency happens. Simulated results are presented to show the
effectiveness of the proposed analysis method.
","[{'version': 'v1', 'created': 'Sun, 2 Oct 2016 05:48:30 GMT'}]",2016-10-06,"[['Shi', 'Zhenwu', ''], ['Yao', 'Ningshi', ''], ['Zhang', 'Fumin', '']]","['Significant Moment Analysis', 'cyber-physical energy system', 'micro-grid', 'real-time scheduling', 'real-time energy management']"
16283,1109.2325,Baisa Gunjal,Baisa L. Gunjal and Suresh N.Mali,Secured color image watermarking technique in DWT-DCT domain,"9 pages; International Journal of Computer Science, Engineering and
  Information Technology (IJCSEIT), Vol.1, No. 3, August 2011",,,,cs.MM,http://creativecommons.org/licenses/by/3.0/,"  The multilayer secured DWT-DCT and YIQ color space based image watermarking
technique with robustness and better correlation is presented here. The
security levels are increased by using multiple pn sequences, Arnold
scrambling, DWT domain, DCT domain and color space conversions. Peak signal to
noise ratio and Normalized correlations are used as measurement metrics. The
512x512 sized color images with different histograms are used for testing and
watermark of size 64x64 is embedded in HL region of DWT and 4x4 DCT is used.
'Haar' wavelet is used for decomposition and direct flexing factor is used. We
got PSNR value is 63.9988 for flexing factor k=1 for Lena image and the maximum
NC 0.9781 for flexing factor k=4 in Q color space. The comparative performance
in Y, I and Q color space is presented. The technique is robust for different
attacks like scaling, compression, rotation etc.
","[{'version': 'v1', 'created': 'Sun, 11 Sep 2011 16:24:00 GMT'}]",2011-09-13,"[['Gunjal', 'Baisa L.', ''], ['Mali', 'Suresh N.', '']]","['DCT-DWT', 'Scrambling', 'Histogram', 'YIQ color space']"
16284,1408.0090,Anup Kumar Das,"Anup Kumar Das, Sanjaya Mishra","Genesis of Altmetrics or Article-level Metrics for Measuring Efficacy of
  Scholarly Communications: Current Perspectives",,"Journal of Scientometric Research, 2014, 3(2), 82-92",,,cs.DL cs.IR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The article-level metrics (ALMs) or altmetrics becomes a new trendsetter in
recent times for measuring the impact of scientific publications and their
social outreach to intended audiences. The popular social networks such as
Facebook, Twitter, and Linkedin and social bookmarks such as Mendeley and
CiteULike are nowadays widely used for communicating research to larger
transnational audiences. In 2012, the San Francisco Declaration on Research
Assessment got signed by the scientific and researchers communities across the
world. This declaration has given preference to the ALM or altmetrics over
traditional but faulty journal impact factor (JIF)-based assessment of career
scientists. JIF does not consider impact or influence beyond citations count as
this count reflected only through Thomson Reuters' Web of Science database.
Furthermore, JIF provides indicator related to the journal, but not related to
a published paper. Thus, altmetrics now becomes an alternative metrics for
performance assessment of individual scientists and their contributed scholarly
publications. This paper provides a glimpse of genesis of altmetrics in
measuring efficacy of scholarly communications and highlights available
altmetric tools and social platforms linking altmetric tools, which are widely
used in deriving altmetric scores of scholarly publications. The paper thus
argues for institutions and policy makers to pay more attention to altmetrics
based indicators for evaluation purpose but cautions that proper safeguards and
validations are needed before their adoption.
","[{'version': 'v1', 'created': 'Fri, 1 Aug 2014 06:36:40 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Dec 2014 12:07:12 GMT'}]",2014-12-11,"[['Das', 'Anup Kumar', ''], ['Mishra', 'Sanjaya', '']]","['Altmetrics', 'article‑level metrics', 'citation database', 'research assessment', 'research communication', 'science communication']"
16285,1007.0292,Ajay Prasad,"Ajay Prasad, G.K.Panda, A. Mitra, Arjun Singh, Deepak Gour",Applying l-Diversity in anonymizing collaborative social network,,"International Journal of Computer Science and Information Security
  Year 2010 Vol: 8, Issue: 2 pages 324 - 329",,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To date publish of a giant social network jointly from different parties is
an easier collaborative approach. Agencies and researchers who collect such
social network data often have a compelling interest in allowing others to
analyze the data. In many cases the data describes relationships that are
private and sharing the data in full can result in unacceptable disclosures.
Thus, preserving privacy without revealing sensitive information in the social
network is a serious concern. Recent developments for preserving privacy using
anonymization techniques are focused on relational data only. Preserving
privacy in social networks against neighborhood attacks is an initiation which
uses the definition of privacy called k-anonymity. k-anonymous social network
still may leak privacy under the cases of homogeneity and background knowledge
attacks. To overcome, we find a place to use a new practical and efficient
definition of privacy called ldiversity. In this paper, we take a step further
on preserving privacy in collaborative social network data with algorithms and
analyze the effect on the utility of the data for social network analysis.
","[{'version': 'v1', 'created': 'Fri, 2 Jul 2010 04:57:59 GMT'}]",2010-07-05,"[['Prasad', 'Ajay', ''], ['Panda', 'G. K.', ''], ['Mitra', 'A.', ''], ['Singh', 'Arjun', ''], ['Gour', 'Deepak', '']]","['bottom R-equal', 'top R-equal', 'R-equal', 'bottom Requivalent', 'top R-equivalent and R-equivalent', 'l-diversity']"
16286,1304.1636,Bernhard Haslhofer,"Bernhard Haslhofer, Werner Robitza, Carl Lagoze, Francois Guimbretiere",Semantic Tagging on Historical Maps,10 pages,,,,cs.DL cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tags assigned by users to shared content can be ambiguous. As a possible
solution, we propose semantic tagging as a collaborative process in which a
user selects and associates Web resources drawn from a knowledge context. We
applied this general technique in the specific context of online historical
maps and allowed users to annotate and tag them. To study the effects of
semantic tagging on tag production, the types and categories of obtained tags,
and user task load, we conducted an in-lab within-subject experiment with 24
participants who annotated and tagged two distinct maps. We found that the
semantic tagging implementation does not affect these parameters, while
providing tagging relationships to well-defined concept definitions. Compared
to label-based tagging, our technique also gathers positive and negative
tagging relationships. We believe that our findings carry implications for
designers who want to adopt semantic tagging in other contexts and systems on
the Web.
","[{'version': 'v1', 'created': 'Fri, 5 Apr 2013 08:23:44 GMT'}]",2013-04-08,"[['Haslhofer', 'Bernhard', ''], ['Robitza', 'Werner', ''], ['Lagoze', 'Carl', ''], ['Guimbretiere', 'Francois', '']]","['Tagging', 'Linked Data', 'Digital Humanities']"
16287,1506.02096,Therese Biedl,Therese Biedl,Optimum-width upward drawings of trees,Revised version includes some of the results of ArXiV 1502.02753,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An upward drawing of a tree is a drawing such that no parents are below their
children. It is order-preserving if the edges to children appear in prescribed
order around each node. Chan showed that any tree has an upward
order-preserving drawing with width O(log n). In this paper, we present
linear-time algorithms that finds upward with instance-optimal width, i.e., the
width is the minimum-possible for the input tree.
  We study two different models. In the first model, the drawings need not be
order-preserving; a very simple algorithm then finds straight-line drawings of
optimal width. In the second model, the drawings must be order-preserving; and
we give an algorithm that finds optimum-width poly-line drawings, i.e., edges
are allowed to have bends. We also briefly study order-preserving upward
straight-line drawings, and show that some trees require larger width if
drawings must be straight-line.
","[{'version': 'v1', 'created': 'Sat, 6 Jun 2015 01:10:35 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Nov 2015 00:16:57 GMT'}]",2015-11-05,"[['Biedl', 'Therese', '']]","['tree drawing', 'upward', 'order-preserving', 'optimum width']"
16288,0905.3802,Fabio Fassetti,"Fabio Fassetti, Luigi Palopoli",On the complexity of identifying Head Elementary Set Free programs,"11 pages. To appear in Theory and Practice of Logic Programming
  (TPLP)",,,,cs.LO cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Head-elementary-set-free programs were proposed in (Gebser et al. 2007) and
shown to generalize over head-cycle-free programs while retaining their nice
properties. It was left as an open problem in (Gebser et al. 2007) to establish
the complexity of identifying head-elementary-set-free programs. This note
solves the open problem, by showing that the problem is complete for co-NP.
","[{'version': 'v1', 'created': 'Mon, 25 May 2009 11:00:13 GMT'}]",2009-05-26,"[['Fassetti', 'Fabio', ''], ['Palopoli', 'Luigi', '']]","['computational complexity', 'elementary set', 'disjunctive logic program', 'headelementary-set-free program']"
16289,1603.04541,Yongming Li,"Xiujuan Wei, Yongming Li","Fuzzy alternating $\mathrm{B\ddot{u}chi}$ automata over distributive
  lattices","35 pages, 8 figures",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give a new version of fuzzy alternating $\mathrm{B\ddot{u}chi}$ automata
over distributive lattices: weights are putting in every leaf node of run trees
rather than along with edges from every node to its children. Such settings are
great benefit to obtain complement just by taking dual operation and replacing
each final weight with its complement. We prove that $L$-fuzzy nondeterministic
$\mathrm{B\ddot{u}chi}$ automata have the same expressive power as $L$-fuzzy
alternating $\mathrm{B\ddot{u}chi}$ ones. A direct construction (without
related knowledge about $L$-fuzzy nondeterministic $\mathrm{B\ddot{u}chi}$ ones
such as: above equivalence relation and their closure properties) is given to
show that the languages recognized by $L$-fuzzy alternating
co-$\mathrm{B\ddot{u}chi}$ automata are also $L$-fuzzy $\omega$-regular.
Furthermore, the closure properties and the discussion about decision problems
for fuzzy alternating $\mathrm{B\ddot{u}chi}$ automata are illustrated in our
paper.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2016 03:27:06 GMT'}]",2016-03-16,"[['Wei', 'Xiujuan', ''], ['Li', 'Yongming', '']]","['Fuzzy alternating automata', 'B¨uchi automata', 'Dual operation', 'L-fuzzyBoolean formulas', 'Runs']"
16290,1407.2279,Gosta Grahne,Gosta Grahne and Adrian Onet,The data-exchange chase under the microscope,arXiv admin note: substantial text overlap with arXiv:1303.6682,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we take closer look at recent developments for the chase
procedure, and provide additional results. Our analysis allows us create a
taxonomy of the chase variations and the properties they satisfy. Two of the
most central problems regarding the chase is termination, and discovery of
restricted classes of sets of dependencies that guarantee termination of the
chase. The search for the restricted classes has been motivated by a fairly
recent result that shows that it is undecidable to determine whether the chase
with a given dependency set will terminate on a given instance. There is a
small dissonance here, since the quest has been for classes of sets of
dependencies guaranteeing termination of the chase on all instances, even
though the latter problem was not known to be undecidable. We resolve the
dissonance in this paper by showing that determining whether the chase with a
given set of dependencies terminates on all instances is coRE-complete. For the
hardness proof we use a reduction from word rewriting systems, thereby also
showing the close connection between the chase and word rewriting. The same
reduction also gives us the aforementioned instance-dependent RE-completeness
result as a byproduct. For one of the restricted classes guaranteeing
termination on all instances, the stratified sets dependencies, we provide new
complexity results for the problem of testing whether a given set of
dependencies belongs to it. These results rectify some previous claims that
have occurred in the literature.
","[{'version': 'v1', 'created': 'Tue, 8 Jul 2014 21:31:32 GMT'}]",2014-07-10,"[['Grahne', 'Gosta', ''], ['Onet', 'Adrian', '']]","['Chase', 'Date Exchange', 'Data Repair', 'Incomplete databases', 'Undecidability Complexity']"
16291,1406.3988,Tewodros Beyene,"Tewodros A. Beyene, Marc Brockschmidt and Andrey Rybalchenko",CTL+FO Verification as Constraint Solving,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Expressing program correctness often requires relating program data
throughout (different branches of) an execution. Such properties can be
represented using CTL+FO, a logic that allows mixing temporal and first-order
quantification. Verifying that a program satisfies a CTL+FO property is a
challenging problem that requires both temporal and data reasoning. Temporal
quantifiers require discovery of invariants and ranking functions, while
first-order quantifiers demand instantiation techniques. In this paper, we
present a constraint-based method for proving CTL+FO properties automatically.
Our method makes the interplay between the temporal and first-order
quantification explicit in a constraint encoding that combines recursion and
existential quantification. By integrating this constraint encoding with an
off-the-shelf solver we obtain an automatic verifier for CTL+FO.
","[{'version': 'v1', 'created': 'Mon, 16 Jun 2014 12:06:49 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Jun 2014 09:10:13 GMT'}, {'version': 'v3', 'created': 'Sat, 21 Jun 2014 06:57:15 GMT'}]",2014-06-24,"[['Beyene', 'Tewodros A.', ''], ['Brockschmidt', 'Marc', ''], ['Rybalchenko', 'Andrey', '']]","['Model Checking', 'Software Verification', 'Temporal Logic']"
16292,1110.2610,Parul Agarwal,"Parul Agarwal, M.Afshar Alam, Ranjit Biswas","Issues,Challenges and Tools of Clustering Algorithms",6 PAGES,"IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 3, No. 2, May 2011 ISSN (Online): 1694-0814 page numbers 523-528",,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering is an unsupervised technique of Data Mining. It means grouping
similar objects together and separating the dissimilar ones. Each object in the
data set is assigned a class label in the clustering process using a distance
measure. This paper has captured the problems that are faced in real when
clustering algorithms are implemented .It also considers the most extensively
used tools which are readily available and support functions which ease the
programming. Once algorithms have been implemented, they also need to be tested
for its validity. There exist several validation indexes for testing the
performance and accuracy which have also been discussed here.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2011 09:27:58 GMT'}]",2011-10-13,"[['Agarwal', 'Parul', ''], ['Alam', 'M. Afshar', ''], ['Biswas', 'Ranjit', '']]","['Clustering', 'Validation Indexes Challenges', 'Properties', 'Software']"
16293,1305.0904,Ursula Martin,Ursula Martin and Alison Pease,What does mathoverflow tell us about the production of mathematics?,"Appeared in SOHUMAN, 2nd International Workshop on Social Media for
  Crowdsourcing and Human Computation, at ACM Web Science 2013, May 1, 2013,
  Paris http://eipcm.org/sohuman2013/",,,,cs.SI cs.DL math.HO physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The highest level of mathematics research is traditionally seen as a solitary
activity. Yet new innovations by mathematicians themselves are starting to
harness the power of social computation to create new modes of mathematical
production. We study the effectiveness of one such system, and make proposals
for enhancement, drawing on AI and computer based mathematics. We analyse the
content of a sample of questions and responses in the community question
answering system for research mathematicians, math-overflow. We find that
mathoverflow is very effective, with 90% of our sample of questions answered
completely or in part. A typical response is an informal dialogue, allowing
error and speculation, rather than rigorous mathematical argument: 37% of our
sample discussions acknowledged error. Responses typically present information
known to the respondent, and readily checked by other users: thus the
effectiveness of mathoverflow comes from information sharing. We conclude that
extending and the power and reach of mathoverflow through a combination of
people and machines raises new challenges for artificial intelligence and
computational mathematics, in particular how to handle error, analogy and
informal reasoning.
","[{'version': 'v1', 'created': 'Sat, 4 May 2013 09:50:11 GMT'}]",2013-05-07,"[['Martin', 'Ursula', ''], ['Pease', 'Alison', '']]","['Social computation', 'question answering', 'mathematics']"
16294,1707.08207,Xiang Lan,"Xiang Lan, Wei Liu","A Fully Quaternion-Valued Capon Beamformer Based on Crossed-Dipole
  Arrays","5 pages, 5 figures",,,,cs.IT math.IT,http://creativecommons.org/licenses/by/4.0/,"  Quaternion models have been developed for both direction of arrival
estimation and beamforming based on crossed-dipole arrays in the past. However,
for almost all the models, especially for adaptive beamforming, the desired
signal is still complex-valued and one example is the quaternion-Capon
beamformer. However, since the complex-valued desired signal only has two
components, while there are four components in a quaternion, only two
components of the quaternion-valued beamformer output are used and the
remaining two are simply removed. This leads to significant redundancy in its
implementation. In this work, we consider a quaternion-valued desired signal
and develop a full quaternion-valued Capon beamformer, which has a better
performance and a much lower complexity and is shown to be more robust against
array pointing errors.
","[{'version': 'v1', 'created': 'Mon, 26 Jun 2017 12:59:59 GMT'}, {'version': 'v2', 'created': 'Mon, 31 Jul 2017 16:30:05 GMT'}]",2017-08-01,"[['Lan', 'Xiang', ''], ['Liu', 'Wei', '']]","['quaternion model', 'crossed-dipole', 'Capon beamformer', 'vector sensor array']"
16295,1110.2289,Mohammad Amin Kheirandish Fard,"Mohammad Amin Kheirandish Fard, Sasan Karamizadeh, Mohammad Aflaki","Enhancing congestion control to address link failure loss over mobile
  ad-hoc network",,,,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  Standard congestion control cannot detect link failure losses which occur due
to mobility and power scarcity in multi-hop Ad-Hoc network (MANET). Moreover,
successive executions of Back-off algorithm deficiently grow Retransmission
Timeout (RTO) exponentially for new route. The importance of detecting and
responding link failure losses is to prevent sender from remaining idle
unnecessarily and manage number of packet retransmission overhead. In contrast
to Cross-layer approaches which require feedback information from lower layers,
this paper operates purely in Transport layer. This paper explores an
end-to-end threshold-based algorithm which enhances congestion control to
address link failure loss in MANET. It consists of two phases. First,
threshold-based loss classification algorithm distinguishes losses due to link
failure by estimating queue usage based on Relative One-way Trip Time (ROTT).
Second phase adjusts RTO for new route by comparing capabilities of new route
to the broken route using available information in Transport layer such as ROTT
and number of hops.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2011 07:10:27 GMT'}]",2011-10-12,"[['Fard', 'Mohammad Amin Kheirandish', ''], ['Karamizadeh', 'Sasan', ''], ['Aflaki', 'Mohammad', '']]","['Link failure', 'congestion control', 'non-congestion loss']"
16296,1304.0726,Jo\~ao Em\'ilio Almeida,"Jos\'e Fernando M. Silva, Jo\~ao Em\'ilio Almeida, Ant\'onio Pereira,
  Rosaldo J. F. Rossetti, Ant\'onio Le\c{c}a Coelho","Preliminary Experiments with EVA - Serious Games Virtual Fire Drill
  Simulator","ECMS 2013 - 27th European Conference on Modelling and Simulation,
  {\AA}lesund, Norway May 27-30, 2013 (accepted)",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fire keeps claiming a large number of victims in building fires. Although
there are ways to minimize such events, fire drills are used to train the
building occupants for emergency situations. However, organizing and implement
these exercises is a complex task, and sometimes not sucessfull. Furthermore,
fire drills require the mobilization of some finantial resources and time, and
affect the normal functioning of the site where they occur. To overcome the
aforementioned issues, computer games have a set of features that might
overcome this problem. They offer engagement to their players, keeping them
focused, and providing training to real life situations. The game evaluate
users, providing them some feedback, making possible for the players to improve
their performance. The proposed methodology aims to study the viability of
using a game that recreates a fire drill in a 3D environment using Serious
Games. The information acquired through the player's performance is very
valuable and will be later used to implement an artificial population. A sample
of 20 subjects was selected to test the application. Preliminary results are
promising, showing that the exercise had a positive impact on users. Moreover,
the data acquired is of great important and will be later used to demonstrate
the possibility of creating an artificial population based on human behaviour.
","[{'version': 'v1', 'created': 'Fri, 15 Mar 2013 17:16:34 GMT'}]",2013-04-03,"[['Silva', 'José Fernando M.', ''], ['Almeida', 'João Emílio', ''], ['Pereira', 'António', ''], ['Rossetti', 'Rosaldo J. F.', ''], ['Coelho', 'António Leça', '']]","['Evacuation simulation', 'fire drill', 'serious games']"
16297,0710.2716,Li Rong,"Rong Li, Zhisheng Duan and Guanrong Chen",Cost and Effects of Pinning Control for Network Synchronization,"12 pages, 18 figures",,,,cs.NI,,"  In this paper, the problem of pinning control for synchronization of complex
dynamical networks is discussed. A cost function of the controlled network is
defined by the feedback gain and the coupling strength of the network. An
interesting result is that lower cost is achieved by the control scheme of
pinning nodes with smaller degrees. Some rigorous mathematical analysis is
presented for achieving lower cost in the synchronization of different
star-shaped networks. Numerical simulations on some non-regular complex
networks generated by the Barabasi-Albert model and various star-shaped
networks are shown for verification and illustration.
","[{'version': 'v1', 'created': 'Mon, 15 Oct 2007 05:45:49 GMT'}]",2007-10-16,"[['Li', 'Rong', ''], ['Duan', 'Zhisheng', ''], ['Chen', 'Guanrong', '']]","['complex dynamical network', 'pinning control', 'exponential sta']"
16298,1106.0735,Dongyue Xue,Dongyue Xue and Eylem Ekici,"Cross-Layer Scheduling for Cooperative Multi-Hop Cognitive Radio
  Networks",10 pages,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper aims to design cross-layer optimal scheduling algorithms for
cooperative multi-hop Cognitive Radio Networks (CRNs), where secondary users
(SUs) assist primary user (PU)'s multi-hop transmissions and in return gain
authorization to access a share of the spectrum. We build two models for two
different types of PUs, corresponding to elastic and inelastic service classes.
For CRNs with elastic service, the PU maximizes its throughput while assigning
a time-share of the channel to SUs proportional to SUs' assistance. For the
inelastic case, the PU is guaranteed a minimum utility. The proposed algorithm
for elastic PU model can achieve arbitrarily close to the optimal PU
throughput, while the proposed algorithm for inelastic PU model can achieve
arbitrarily close to the optimal SU utility. Both algorithms provide
deterministic upper-bounds for PU queue backlogs. In addition, we show a
tradeoff between throughput/utility and PU's average end-to-end delay
upper-bounds for both algorithms. Furthermore, the algorithms work in both
backlogged as well as arbitrary arrival rate systems.
","[{'version': 'v1', 'created': 'Fri, 3 Jun 2011 19:48:30 GMT'}]",2011-06-06,"[['Xue', 'Dongyue', ''], ['Ekici', 'Eylem', '']]","['Congestion control', 'network scheduling', 'multi-hop wirelessnetworks', 'cognitive radio networks', 'end-to-end delay guarantees']"
16299,1603.09524,V.P. Binu,"V P Binu, A Sreekumar",Threshold Multi Secret Sharing Using Elliptic Curve and Pairing,"in IJIP volume 9 issue 4, 2016",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Secret Sharing techniques are now the building blocks of several security
protocols. A (t;n) threshold secret sharing scheme is one in which t or more
participant can join together to retrieve the secret.Traditional single secret
sharing schemes are modified and generalized to share multiple secrets.Use of
elliptic curve and pairing in secret sharing is gaining more importance.In this
paper we propose a threshold multi secret sharing scheme where more than one
secret is shared.When the threshold number of participants collate, the multi
secret can be retrieved. The scheme make use of elliptic curve and bilinear
pairing.Verification of shares by the participants, shares consistency
checking, detection and identification of cheaters are the extended
capabilities achieved.The shared secrets are retrieved in single stage here,
unlike the multi stage secret sharing scheme.The participants can be added very
easily.The scheme is efficient and the number of public parameters are also
less compared with the existing threshold multi secret sharing scheme based on
the elliptic curve.The dealer can easily modify the secret or add additional
secret by changing the public parameters of the scheme.This is the first
proposal of a threshold multi secret sharing scheme with extended capabilities
using self pairing.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2016 11:03:09 GMT'}]",2016-04-01,"[['Binu', 'V P', ''], ['Sreekumar', 'A', '']]","['Cheater Identification', 'Elliptic Curve', 'Multi-secret Sharing', 'Pairing', 'Secret Sharing']"
16300,1712.05248,HaiLiang Li,"Hailiang Li, Kin-Man Lam, Miaohui Wang",Image Super-resolution via Feature-augmented Random Forest,,,,,cs.CV,http://creativecommons.org/publicdomain/zero/1.0/,"  Recent random-forest (RF)-based image super-resolution approaches inherit
some properties from dictionary-learning-based algorithms, but the
effectiveness of the properties in RF is overlooked in the literature. In this
paper, we present a novel feature-augmented random forest (FARF) for image
super-resolution, where the conventional gradient-based features are augmented
with gradient magnitudes and different feature recipes are formulated on
different stages in an RF. The advantages of our method are that, firstly, the
dictionary-learning-based features are enhanced by adding gradient magnitudes,
based on the observation that the non-linear gradient magnitude are with highly
discriminative property. Secondly, generalized locality-sensitive hashing (LSH)
is used to replace principal component analysis (PCA) for feature
dimensionality reduction and original high-dimensional features are employed,
instead of the compressed ones, for the leaf-nodes' regressors, since
regressors can benefit from higher dimensional features. This
original-compressed coupled feature sets scheme unifies the unsupervised LSH
evaluation on both image super-resolution and content-based image retrieval
(CBIR). Finally, we present a generalized weighted ridge regression (GWRR)
model for the leaf-nodes' regressors. Experiment results on several public
benchmark datasets show that our FARF method can achieve an average gain of
about 0.3 dB, compared to traditional RF-based methods. Furthermore, a
fine-tuned FARF model can compare to or (in many cases) outperform some recent
stateof-the-art deep-learning-based algorithms.
","[{'version': 'v1', 'created': 'Thu, 14 Dec 2017 14:27:39 GMT'}]",2017-12-15,"[['Li', 'Hailiang', ''], ['Lam', 'Kin-Man', ''], ['Wang', 'Miaohui', '']]","['Random forest', 'gradient magnitude filter', 'clustering', 'regression; image super']"
16301,1702.07157,Luc Dartois,"Luc Dartois and Paulin Fournier and Isma\""el Jecker and Nathan Lhote",On Reversible Transducers,,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deterministic two-way transducers define the robust class of regular
functions which is, among other good properties, closed under composition.
However, the best known algorithms for composing two-way transducers cause a
double exponential blow-up in the size of the inputs. In this paper, we
introduce a class of transducers for which the composition has polynomial
complexity. It is the class of reversible transducers, for which the
computation steps can be reversed deterministically. While in the one-way
setting this class is not very expressive, we prove that any two-way transducer
can be made reversible through a single exponential blow-up. As a consequence,
we prove that the composition of two-way transducers can be done with a single
exponential blow-up in the number of states. A uniformization of a relation is
a function with the same domain and which is included in the original relation.
Our main result actually states that we can uniformize any non-deterministic
two-way transducer by a reversible transducer with a single exponential
blow-up, improving the known result by de Souza which has a quadruple
exponential complexity. As a side result, our construction also gives a
quadratic transformation from copyless streaming string transducers to two-way
transducers, improving the exponential previous bound.
","[{'version': 'v1', 'created': 'Thu, 23 Feb 2017 10:12:11 GMT'}]",2017-02-24,"[['Dartois', 'Luc', ''], ['Fournier', 'Paulin', ''], ['Jecker', 'Ismaël', ''], ['Lhote', 'Nathan', '']]","['Transducers', 'reversible', 'two-way', 'uniformization']"
16302,1107.2490,Wei Xu,Wei Xu,"Towards Optimal One Pass Large Scale Learning with Averaged Stochastic
  Gradient Descent",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For large scale learning problems, it is desirable if we can obtain the
optimal model parameters by going through the data in only one pass. Polyak and
Juditsky (1992) showed that asymptotically the test performance of the simple
average of the parameters obtained by stochastic gradient descent (SGD) is as
good as that of the parameters which minimize the empirical cost. However, to
our knowledge, despite its optimal asymptotic convergence rate, averaged SGD
(ASGD) received little attention in recent research on large scale learning.
One possible reason is that it may take a prohibitively large number of
training samples for ASGD to reach its asymptotic region for most real
problems. In this paper, we present a finite sample analysis for the method of
Polyak and Juditsky (1992). Our analysis shows that it indeed usually takes a
huge number of samples for ASGD to reach its asymptotic region for improperly
chosen learning rate. More importantly, based on our analysis, we propose a
simple way to properly set learning rate so that it takes a reasonable amount
of data for ASGD to reach its asymptotic region. We compare ASGD using our
proposed learning rate with other well known algorithms for training large
scale linear classifiers. The experiments clearly show the superiority of ASGD.
","[{'version': 'v1', 'created': 'Wed, 13 Jul 2011 08:57:29 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Dec 2011 06:43:31 GMT'}]",2011-12-23,"[['Xu', 'Wei', '']]","['stochastic gradient descent', 'large scale learning', 'support vector machines', 'stochasticoptimization']"
16303,1410.2871,Meenakshi Lakshmanan,"S. V. Kasmir Raja, V. Rajitha, Meenakshi Lakshmanan","An Ontology for Comprehensive Tutoring of Euphonic Conjunctions of
  Sanskrit Grammar",,"European Journal of Scientific Research, ISSN 1450-216X /
  1450-202X, Vol. 124, No. 4, September 2014, pp 460-467",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Euphonic conjunctions (sandhis) form a very important aspect of Sanskrit
morphology and phonology. The traditional and modern methods of studying about
euphonic conjunctions in Sanskrit follow different methodologies. The former
involves a rigorous study of the Paninian system embodied in Panini's
Ashtadhyayi, while the latter usually involves the study of a few important
sandhi rules with the use of examples. The former is not suitable for
beginners, and the latter, not sufficient to gain a comprehensive understanding
of the operation of sandhi rules. This is so since there are not only numerous
sandhi rules and exceptions, but also complex precedence rules involved. The
need for a new ontology for sandhi-tutoring was hence felt. This work presents
a comprehensive ontology designed to enable a student-user to learn in stages
all about euphonic conjunctions and the relevant aphorisms of Sanskrit grammar
and to test and evaluate the progress of the student-user. The ontology forms
the basis of a multimedia sandhi tutor that was given to different categories
of users including Sanskrit scholars for extensive and rigorous testing.
","[{'version': 'v1', 'created': 'Fri, 10 Oct 2014 19:19:31 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Feb 2015 08:10:20 GMT'}]",2015-02-04,"[['Raja', 'S. V. Kasmir', ''], ['Rajitha', 'V.', ''], ['Lakshmanan', 'Meenakshi', '']]","['Sanskrit', 'euphonic conjunction', 'sandhi', 'Panini', 'sandhi tutor', 'ontology']"
16304,0803.3501,Fahem Kebair,"Fahem Kebair (LITIS), Fr\'ed\'eric Serin (LITIS)","Multiagent Approach for the Representation of Information in a Decision
  Support System",,"Multiagent Approach for the Representation of Information in a
  Decision Support System, Springer Berlin / Heidelberg (Ed.) (2006) 98-107",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In an emergency situation, the actors need an assistance allowing them to
react swiftly and efficiently. In this prospect, we present in this paper a
decision support system that aims to prepare actors in a crisis situation
thanks to a decision-making support. The global architecture of this system is
presented in the first part. Then we focus on a part of this system which is
designed to represent the information of the current situation. This part is
composed of a multiagent system that is made of factual agents. Each agent
carries a semantic feature and aims to represent a partial part of a situation.
The agents develop thanks to their interactions by comparing their semantic
features using proximity measures and according to specific ontologies.
","[{'version': 'v1', 'created': 'Tue, 25 Mar 2008 07:43:36 GMT'}]",2008-12-18,"[['Kebair', 'Fahem', '', 'LITIS'], ['Serin', 'Frédéric', '', 'LITIS']]","['Decision support system', 'Factual agent', 'Indicators', 'Multiagent system', 'Proximity measure', 'Semantic feature']"
16305,1208.1900,Mina Mishra,Mina Mishra and V. H. Mankar,Message Embedded cipher using 2-D chaotic map,11 pages,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper constructs two encryption methods using 2-D chaotic maps, Duffings
and Arnold's cat maps respectively. Both of the methods are designed using
message embedded scheme and are analyzed for their validity, for plaintext
sensitivity, key sensitivity, known plaintext and brute-force attacks. Due to
the less key space generally many chaotic cryptosystem developed are found to
be weak against Brute force attack which is an essential issue to be solved.
For this issue, concept of identifiability proved to be a necessary condition
to be fulfilled by the designed chaotic cipher to resist brute force attack,
which is a basic attack. As 2-D chaotic maps provide more key space than 1-D
maps thus they are considered to be more suitable. This work is accompanied
with analysis results obtained from these developed cipher. Moreover,
identifiable keys are searched for different input texts at various key values.
The methods are found to have good key sensitivity and possess identifiable
keys thus concluding that they can resist linear attacks and brute-force
attacks.
","[{'version': 'v1', 'created': 'Thu, 9 Aug 2012 13:15:02 GMT'}]",2012-08-10,"[['Mishra', 'Mina', ''], ['Mankar', 'V. H.', '']]","['Message embedded scheme', 'Arnolds Cat map', 'Duffings map', 'Identifiability']"
16306,1412.6988,Hayato Takahashi,Hayato Takahashi,Universal test for Hippocratic randomness,Submitted to Information Processing Letters,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hippocratic randomness is defined in a similar way to Martin-Lof randomness,
however it does not assume computability of the probability and the existence
of universal test is not assured. We introduce the notion of approximation of
probability and show the existence of the universal test (Levin-Schnorr
theorem) for Hippocratic randomness when the logarithm of the probability is
approximated within additive constant.
","[{'version': 'v1', 'created': 'Mon, 22 Dec 2014 14:17:42 GMT'}]",2014-12-23,"[['Takahashi', 'Hayato', '']]","['Hippocratic randomness', 'blind randomness', 'Kolmogorovcomplexity', 'universal test']"
16307,1609.02339,Jari Torniainen,"Jari Torniainen, Andreas Henelius","A short review and primer on online processing of multiple signal
  sources in human computer interaction applications",,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The application of psychophysiological in human-computer interaction is a
growing field with significant potential for future smart personalised systems.
Working in this emerging field requires comprehension of an array of
physiological signals and analysis techniques.
  Stream processing sytems (SPS) are emerging computational platforms that can
be utilized in human-computer interaction for real-time analysis of high-volume
multimodal signals. Usage of complementary information contained in multiple
signals is desireable as it can make HCI systems more robust. In this preprint
we review existing software and hardware solutions for HCI-centric stream
processing systems. The preprint also includes a brief introduction into SPS
design considerations and structure from the perspective of analysing
physiological signals.
  This paper aims to serve as a primer for the novice, enabling rapid
familiarisation with the latest core concepts. We put special emphasis on
everyday human-computer interface applications to distinguish from the more
common clinical or sports uses of psychophysiology.
  This paper is an extract from a comprehensive review of the entire field of
ambulatory psychophysiology, including 12 similar chapters, plus application
guidelines and systematic review. Thus any citation should be made using the
following reference: B. Cowley, M. Filetti, K. Lukander, J. Torniainen, A.
Henelius, L. Ahonen, O. Barral, I. Kosunen, T. Valtonen, M. Huotilainen, N.
Ravaja, G. Jacucci. The Psychophysiology Primer: a guide to methods and a broad
review with a focus on human-computer interaction. Foundations and Trends in
Human-Computer Interaction, vol. 9, no. 3-4, pp. 150--307, 2016.
","[{'version': 'v1', 'created': 'Thu, 8 Sep 2016 09:15:23 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Sep 2016 11:10:46 GMT'}]",2016-09-27,"[['Torniainen', 'Jari', ''], ['Henelius', 'Andreas', '']]","['stream processing systems', 'psychophysiology', 'human-computerinteraction', 'primer', 'review']"
16308,1401.5953,Abhisekh Sankaran,"Abhisekh Sankaran, Bharat Adsul, Supratik Chakraborty","A Generalization of the {\L}o\'s-Tarski Preservation Theorem over
  Classes of Finite Structures","28 pages, 1 figure",,,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate a generalization of the {\L}o\'s-Tarski preservation theorem
via the semantic notion of \emph{preservation under substructures modulo
$k$-sized cores}. It was shown earlier that over arbitrary structures, this
semantic notion for first-order logic corresponds to definability by
$\exists^k\forall^*$ sentences. In this paper, we identify two properties of
classes of finite structures that ensure the above correspondence. The first is
based on well-quasi-ordering under the embedding relation. The second is a
logic-based combinatorial property that strictly generalizes the first. We show
that starting with classes satisfying any of these properties, the classes
obtained by applying operations like disjoint union, cartesian and tensor
products, or by forming words and trees over the classes, inherit the same
property. As a fallout, we obtain interesting classes of structures over which
an effective version of the {\L}o\'s-Tarski theorem holds.
","[{'version': 'v1', 'created': 'Thu, 23 Jan 2014 12:15:37 GMT'}]",2014-01-24,"[['Sankaran', 'Abhisekh', ''], ['Adsul', 'Bharat', ''], ['Chakraborty', 'Supratik', '']]","['finite model theory', 'preservation theorem', 'well-quasi-ordering', 'composition method']"
16309,1304.1697,Dmitry Solomakhin,"Dmitry Solomakhin and Marco Montali and Sergio Tessaris and Riccardo
  De Masellis","Verification of Artifact-Centric Systems: Decidability and Modeling
  Issues","artifact-centric systems, guard-stage-milestone, formal verification",,,,cs.SE cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Artifact-centric business processes have recently emerged as an approach in
which processes are centred around the evolution of business entities, called
artifacts, giving equal importance to control-flow and data. The recent
Guard-State-Milestone (GSM) approach provides means for specifying business
artifacts lifecycles in a declarative manner, using constructs that match how
executive-level stakeholders think about their business. However, it turns out
that formal verification of GSM is undecidable even for very simple
propositional temporal properties. We attack this challenging problem by
translating GSM into a well-studied formal framework. We exploit this
translation to isolate an interesting class of state-bounded GSM models for
which verification of sophisticated temporal properties is decidable. We then
introduce some guidelines to turn an arbitrary GSM model into a state-bounded,
verifiable model.
","[{'version': 'v1', 'created': 'Fri, 5 Apr 2013 12:54:00 GMT'}]",2013-04-08,"[['Solomakhin', 'Dmitry', ''], ['Montali', 'Marco', ''], ['Tessaris', 'Sergio', ''], ['De Masellis', 'Riccardo', '']]","['artifact-centric systems', 'guard-stage-milestone', 'formal verification']"
16310,1701.08809,Martin Gro{\ss},"Fidaa Abed and Lin Chen and Yann Disser and Martin Gro{\ss} and Nicole
  Megow and Julie Mei{\ss}ner and Alexander T. Richter and Roman Rischke",Scheduling Maintenance Jobs in Networks,CIAC 2017,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the problem of scheduling the maintenance of edges in a
network, motivated by the goal of minimizing outages in transportation or
telecommunication networks. We focus on maintaining connectivity between two
nodes over time; for the special case of path networks, this is related to the
problem of minimizing the busy time of machines.
  We show that the problem can be solved in polynomial time in arbitrary
networks if preemption is allowed. If preemption is restricted to integral time
points, the problem is NP-hard and in the non-preemptive case we give strong
non-approximability results. Furthermore, we give tight bounds on the power of
preemption, that is, the maximum ratio of the values of non-preemptive and
preemptive optimal solutions.
  Interestingly, the preemptive and the non-preemptive problem can be solved
efficiently on paths, whereas we show that mixing both leads to a weakly
NP-hard problem that allows for a simple 2-approximation.
","[{'version': 'v1', 'created': 'Mon, 30 Jan 2017 20:12:57 GMT'}]",2017-02-01,"[['Abed', 'Fidaa', ''], ['Chen', 'Lin', ''], ['Disser', 'Yann', ''], ['Groß', 'Martin', ''], ['Megow', 'Nicole', ''], ['Meißner', 'Julie', ''], ['Richter', 'Alexander T.', ''], ['Rischke', 'Roman', '']]","['Scheduling', 'Maintenance', 'Connectivity', 'Complexity Theory', 'Approximation Algorithm']"
16311,1402.4525,Saminda Abeyruwan,Saminda Abeyruwan and Andreas Seekircher and Ubbo Visser,"Off-Policy General Value Functions to Represent Dynamic Role Assignments
  in RoboCup 3D Soccer Simulation","18 pages, 8 figures",,,,cs.AI,http://creativecommons.org/licenses/by/3.0/,"  Collecting and maintaining accurate world knowledge in a dynamic, complex,
adversarial, and stochastic environment such as the RoboCup 3D Soccer
Simulation is a challenging task. Knowledge should be learned in real-time with
time constraints. We use recently introduced Off-Policy Gradient Descent
algorithms within Reinforcement Learning that illustrate learnable knowledge
representations for dynamic role assignments. The results show that the agents
have learned competitive policies against the top teams from the RoboCup 2012
competitions for three vs three, five vs five, and seven vs seven agents. We
have explicitly used subsets of agents to identify the dynamics and the
semantics for which the agents learn to maximize their performance measures,
and to gather knowledge about different objectives, so that all agents
participate effectively and efficiently within the group.
","[{'version': 'v1', 'created': 'Tue, 18 Feb 2014 23:01:13 GMT'}]",2014-02-20,"[['Abeyruwan', 'Saminda', ''], ['Seekircher', 'Andreas', ''], ['Visser', 'Ubbo', '']]","['Dynamic Role Assignment Function', 'Reinforcement Learning', 'GQ(λ)', 'Greedy-GQ(λ)', 'Off-PAC', 'Off-Policy Prediction and Control', 'RoboCup 3D Soccer Simulation']"
16312,1712.04236,Daniel Lehmann Prof.,Daniel Lehmann,Ultra valuations,"31 pages, preprint. This is a fourth version. The first version has
  been enlarged and much improved. The relation to extant work and the overall
  presentation are much improved. Some new results are included. The fourth
  version has a better comparison with the choice-language properties and an
  added appendix on the topic",,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes an original exchange property of valuations.This property
is shown to be equivalent to a property described by Dress and Terhalle in the
context of discrete optimization and matroids and shown there to characterize
the valuations for which the demand oracle can be implemented by a greedy
algorithm. The same exchange property is also equivalent to a property
described independently by Reijnierse, van Gellekom and Potters and by Lehmann,
Lehmann and Nisan and shown there to be satisfied by substitutes valuations. It
studies the family of valuations that satisfy this exchange property, the ultra
valuations. Any substitutes valuation is an ultra valuation, but ultra
valuations may exhibit complementarities. Any symmetric valuation is an ultra
valuation. Substitutes valuations are exactly the submodular ultra valuations.
Ultra valuations define ultrametrics on the set of items. The maximum of an
ultra valuation on $n$ items can be found in $O(n^2)$ steps. Finding an
efficient allocation among ultra valuations is NP-hard.
","[{'version': 'v1', 'created': 'Tue, 12 Dec 2017 11:14:52 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Feb 2018 13:28:45 GMT'}, {'version': 'v3', 'created': 'Thu, 12 Apr 2018 08:18:19 GMT'}, {'version': 'v4', 'created': 'Sat, 22 Sep 2018 20:11:37 GMT'}]",2018-09-25,"[['Lehmann', 'Daniel', '']]","['discrete optimization', 'combinatorial auctions', 'set valuations', 'ultra valuations', 'gross substitutability', 'M♮ valuations', 'greedy optimization', 'well-layered maps']"
16313,1009.5341,Mateus de Oliveira Oliveira,Mateus de Oliveira Oliveira,Canonizable Partial Order Generators and Regular Slice Languages,"38 pages. 9 Figures. This work extends the paper ""Canonizable Partial
  Order Generators"" by the same author that appeared in the Proc. of the 6-th
  International Conference on Language and Automata Theory and Applications
  (LATA 2012)",,,,cs.FL cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a previous work we introduced slice graphs as a way to specify both
infinite languages of directed acyclic graphs (DAGs) and infinite languages of
partial orders. Therein we focused on the study of Hasse diagram generators,
i.e., slice graphs that generate only transitive reduced DAGs, and showed that
they could be used to solve several problems related to the partial order
behavior of p/t-nets. In the present work we show that both slice graphs and
Hasse diagram generators are worth studying on their own. First, we prove that
any slice graph SG can be effectively transformed into a Hasse diagram
generator HG representing the same set of partial orders. Thus from an
algorithmic standpoint we introduce a method of transitive reducing infinite
families of DAGs specified by slice graphs. Second, we identify the class of
saturated slice graphs. By using our transitive reduction algorithm, we prove
that the class of partial order languages representable by saturated slice
graphs is closed under union, intersection and even under a suitable notion of
complementation (cut-width complementation). Furthermore partial order
languages belonging to this class can be tested for inclusion and admit
canonical representatives in terms of Hasse diagram generators. As an
application of our results, we give stronger forms of some results in our
previous work, and establish some unknown connections between the partial order
behavior of $p/t$-nets and other well known formalisms for the specification of
infinite families of partial orders, such as Mazurkiewicz trace languages and
message sequence chart (MSC) languages.
","[{'version': 'v1', 'created': 'Mon, 27 Sep 2010 17:49:21 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Feb 2011 11:55:03 GMT'}, {'version': 'v3', 'created': 'Mon, 1 Aug 2011 10:10:59 GMT'}, {'version': 'v4', 'created': 'Tue, 26 Jun 2012 11:17:41 GMT'}]",2012-06-27,"[['Oliveira', 'Mateus de Oliveira', '']]","['Partial Order Languages', 'Regular Slice Languages', 'Transitive Reduction', 'Petri Nets']"
16314,1501.01429,Gabriele Fici,"Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, \'Elise Prieur-Gaston",Online Computation of Abelian Runs,To appear in the Proceedings of LATA 2015,,,,cs.FL cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a word $w$ and a Parikh vector $\mathcal{P}$, an abelian run of period
$\mathcal{P}$ in $w$ is a maximal occurrence of a substring of $w$ having
abelian period $\mathcal{P}$. We give an algorithm that finds all the abelian
runs of period $\mathcal{P}$ in a word of length $n$ in time $O(n\times
|\mathcal{P}|)$ and space $O(\sigma+|\mathcal{P}|)$.
","[{'version': 'v1', 'created': 'Wed, 7 Jan 2015 10:22:12 GMT'}]",2015-01-08,"[['Fici', 'Gabriele', ''], ['Lecroq', 'Thierry', ''], ['Lefebvre', 'Arnaud', ''], ['Prieur-Gaston', 'Élise', '']]","['Combinatorics on Words', 'Text Algorithms', 'Abelian Period', 'Abelian Run']"
16315,1206.5352,Jeffrey Shallit,"Daniel Goc, Luke Schaeffer, Jeffrey Shallit",Subword Complexity and k-Synchronization,Some new results and better exposition,,,,cs.FL cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that the subword complexity function p_x(n), which counts the number
of distinct factors of length n of a sequence x, is k-synchronized in the sense
of Carpi if x is k-automatic. As an application, we generalize recent results
of Goldstein. We give analogous results for the number of distinct factors of
length n that are primitive words or powers. In contrast, we show that the
function that counts the number of unbordered factors of length n is not
necessarily k-synchronized for k-automatic sequences.
","[{'version': 'v1', 'created': 'Sat, 23 Jun 2012 01:50:56 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Jun 2012 12:54:12 GMT'}, {'version': 'v3', 'created': 'Mon, 10 Sep 2012 17:34:37 GMT'}, {'version': 'v4', 'created': 'Mon, 17 Sep 2012 14:41:36 GMT'}]",2012-09-18,"[['Goc', 'Daniel', ''], ['Schaeffer', 'Luke', ''], ['Shallit', 'Jeffrey', '']]","['Automata', 'sequences', 'k-automatic', 'synchronized', 'subword complexity']"
16316,1401.2920,Vincenzo De Florio,"Vincenzo De Florio, Greet Deconinck, Rudy Lauwereins","The EFTOS Voting Farm: A Software Tool for Fault Masking in Message
  Passing Parallel Environments","Proc. of the 24th EUROMICRO Conf. on Engineering Systems and Software
  for the next decade, Vaesteras, Sweden, August 25-27, 1998; pp. 379-386",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a set of C functions implementing a distributed software voting
mechanism for EPX or similar message passing environments, and we place it
within the EFTOS framework (Embedded Fault-Tolerant Supercomputing, ESPRIT-IV
Project 21012) of software tools for enhancing the dependability of a user
application. The described mechanism can be used for instance to implement
restoring organs i.e., N-modular redundancy systems with N-replicated voters.
We show that, besides structural design goals like fault transparency, this
tool achieves replication transparency, a high degree of flexibility and
ease-of-use, and good performance.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2014 17:14:44 GMT'}]",2014-01-14,"[['De Florio', 'Vincenzo', ''], ['Deconinck', 'Greet', ''], ['Lauwereins', 'Rudy', '']]","['Software Fault Masking', 'Fault Tolerance', 'Voting Techniques', 'High-Performance Computing']"
16317,1712.02827,Panagiotis Strouthopoulos,"Panagiotis Strouthopoulos, Apostolos Papadopoulos",Core Discovery in Hidden Graphs,"12 pages, 4 figures",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Massive network exploration is an important research direction with many
applications. In such a setting, the network is, usually, modeled as a graph
$G$, whereas any structural information of interest is extracted by inspecting
the way nodes are connected together. In the case where the adjacency matrix or
the adjacency list of $G$ is available, one can directly apply graph mining
algorithms to extract useful knowledge. However, there are cases where this is
not possible because the graph is \textit{hidden} or \textit{implicit}, meaning
that the edges are not recorded explicitly in the form of an adjacency
representation. In such a case, the only alternative is to pose a sequence of
\textit{edge probing queries} asking for the existence or not of a particular
graph edge. However, checking all possible node pairs is costly (quadratic on
the number of nodes). Thus, our objective is to pose as few edge probing
queries as possible, since each such query is expected to be costly. In this
work, we center our focus on the \textit{core decomposition} of a hidden graph.
In particular, we provide an efficient algorithm to detect the maximal subgraph
of $S_k$ of $G$ where the induced degree of every node $u \in S_k$ is at least
$k$. Performance evaluation results demonstrate that significant performance
improvements are achieved in comparison to baseline approaches.
","[{'version': 'v1', 'created': 'Thu, 7 Dec 2017 19:32:06 GMT'}]",2017-12-11,"[['Strouthopoulos', 'Panagiotis', ''], ['Papadopoulos', 'Apostolos', '']]","['hidden graphs', 'core decomposition', 'graph mining']"
16318,1307.2482,Dusan Jakovetic,"Dusan Jakovetic, Jose M. F. Moura, and Joao Xavier","Linear Convergence Rate of a Class of Distributed Augmented Lagrangian
  Algorithms",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study distributed optimization where nodes cooperatively minimize the sum
of their individual, locally known, convex costs $f_i(x)$'s, $x \in {\mathbb
R}^d$ is global. Distributed augmented Lagrangian (AL) methods have good
empirical performance on several signal processing and learning applications,
but there is limited understanding of their convergence rates and how it
depends on the underlying network. This paper establishes globally linear
(geometric) convergence rates of a class of deterministic and randomized
distributed AL methods, when the $f_i$'s are twice continuously differentiable
and have a bounded Hessian. We give explicit dependence of the convergence
rates on the underlying network parameters. Simulations illustrate our
analytical findings.
","[{'version': 'v1', 'created': 'Tue, 9 Jul 2013 14:50:27 GMT'}, {'version': 'v2', 'created': 'Sun, 13 Apr 2014 22:13:27 GMT'}]",2014-04-15,"[['Jakovetic', 'Dusan', ''], ['Moura', 'Jose M. F.', ''], ['Xavier', 'Joao', '']]","['Distributed optimization', 'convergence rate', 'augmented Lagrangian', 'consensus']"
16319,1402.2351,Flavio Figueiredo,"Flavio Figueiredo, Jussara M. Almeida, Marcos Andr\'e Gon\c{c}alves,
  Fabr\'icio Benevenuto","TrendLearner: Early Prediction of Popularity Trends of User Generated
  Content",To appear at Elsevier Information Sciences Journal,,,,cs.SI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We here focus on the problem of predicting the popularity trend of user
generated content (UGC) as early as possible. Taking YouTube videos as case
study, we propose a novel two-step learning approach that: (1) extracts
popularity trends from previously uploaded objects, and (2) predicts trends for
new content. Unlike previous work, our solution explicitly addresses the
inherent tradeoff between prediction accuracy and remaining interest in the
content after prediction, solving it on a per-object basis. Our experimental
results show great improvements of our solution over alternatives, and its
applicability to improve the accuracy of state-of-the-art popularity prediction
methods.
","[{'version': 'v1', 'created': 'Tue, 11 Feb 2014 02:36:26 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Feb 2014 15:53:33 GMT'}, {'version': 'v3', 'created': 'Mon, 7 Apr 2014 02:44:32 GMT'}, {'version': 'v4', 'created': 'Sun, 14 Feb 2016 20:39:52 GMT'}]",2016-02-16,"[['Figueiredo', 'Flavio', ''], ['Almeida', 'Jussara M.', ''], ['Gonçalves', 'Marcos André', ''], ['Benevenuto', 'Fabrício', '']]","['popularity', 'trends', 'classification', 'social media', 'ugc', 'prediction']"
16320,1410.3773,Guozheng Li,"Guozheng Li, Zining Cao, Zheng Gao",Refinement Checking for Multirate Hybrid ZIA,"11pages, 3figures",,,,cs.LO cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A hybrid system is a dynamical system with both discrete and continuous
components. In order to study the modeling and verification aspects of hybrid
system, in this paper we first introduce a specification approach combining
interface automata, initialized multirate hybrid automata and Z language, which
is named MZIA. Meanwhile we propose a refinement relation on MZIAs. Then we
give an algorithm for checking refinement relation between MZIAs with finite
domain and demonstrate the correctness of the algorithm.
","[{'version': 'v1', 'created': 'Mon, 13 Oct 2014 08:10:14 GMT'}]",2014-10-15,"[['Li', 'Guozheng', ''], ['Cao', 'Zining', ''], ['Gao', 'Zheng', '']]","['Interface Automata', 'Z Notation', 'Hybrid Automata', 'Refinement checking']"
16321,1607.00658,Boris Brimkov,Boris Brimkov,Complexity and Computation of Connected Zero Forcing,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Zero forcing is an iterative graph coloring process whereby a colored vertex
with a single uncolored neighbor forces that neighbor to be colored. It is
NP-hard to find a minimum zero forcing set - a smallest set of initially
colored vertices which forces the entire graph to be colored. We show that the
problem remains NP-hard when the initially colored set induces a connected
subgraph. We also give structural results about the connected zero forcing sets
of a graph related to the graph's density, separating sets, and certain induced
subgraphs, and we characterize the cardinality of the minimum connected zero
forcing sets of unicyclic graphs and variants of cactus and block graphs.
Finally, we identify several families of graphs whose connected zero forcing
sets define greedoids and matroids.
","[{'version': 'v1', 'created': 'Sun, 3 Jul 2016 17:16:28 GMT'}]",2016-07-05,"[['Brimkov', 'Boris', '']]","['Connected zero forcing', 'zero forcing', 'NP-complete', 'unicyclicgraph', 'cactus graph', 'block graph', 'greedoid', 'matroid']"
16322,1511.04115,S. Eman Mahmoodi,"S. Eman Mahmoodi, K.P. Subbalakshmi, R. Chandramouli, Bahman
  Abolhassani","Joint Spectrum Sensing and Resource Allocation for OFDM-based
  Transmission with a Cognitive Relay","EAI Endorsed Transactions on Wireless Spectrum 14(1): e4 Published
  13th Apr 2014",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate the joint spectrum sensing and resource
allocation problem to maximize throughput capacity of an OFDM-based cognitive
radio link with a cognitive relay. By applying a cognitive relay that uses
decode and forward (D&F), we achieve more reliable communications, generating
less interference (by needing less transmit power) and more diversity gain. In
order to account for imperfections in spectrum sensing, the proposed schemes
jointly modify energy detector thresholds and allocates transmit powers to all
cognitive radio (CR) subcarriers, while simultaneously assigning subcarrier
pairs for secondary users (SU) and the cognitive relay. This problem is cast as
a constrained optimization problem with constraints on (1) interference
introduced by the SU and the cognitive relay to the PUs; (2) miss-detection and
false alarm probabilities and (3) subcarrier pairing for transmission on the SU
transmitter and the cognitive relay and (4) minimum Quality of Service (QoS)
for each CR subcarrier. We propose one optimal and two sub-optimal schemes all
of which are compared to other schemes in the literature. Simulation results
show that the proposed schemes achieve significantly higher throughput than
other schemes in the literature for different relay situations.
","[{'version': 'v1', 'created': 'Thu, 12 Nov 2015 22:37:15 GMT'}]",2015-11-16,"[['Mahmoodi', 'S. Eman', ''], ['Subbalakshmi', 'K. P.', ''], ['Chandramouli', 'R.', ''], ['Abolhassani', 'Bahman', '']]","['cognitive radio', 'power allocation', 'spectrum sensing', 'subcarrier pairing', 'cognitive relay', 'OFDM']"
16323,1203.2002,Soni madhulatha Tagaram,T Soni Madhulatha,Graph partitioning advance clustering technique,14 pages,"International Journal of Computer Science and Engineering
  Survey(IJCSES), February 2012, Volume 3, Number 1",,,cs.LG cs.DB,http://creativecommons.org/licenses/by/3.0/,"  Clustering is a common technique for statistical data analysis, Clustering is
the process of grouping the data into classes or clusters so that objects
within a cluster have high similarity in comparison to one another, but are
very dissimilar to objects in other clusters. Dissimilarities are assessed
based on the attribute values describing the objects. Often, distance measures
are used. Clustering is an unsupervised learning technique, where interesting
patterns and structures can be found directly from very large data sets with
little or none of the background knowledge. This paper also considers the
partitioning of m-dimensional lattice graphs using Fiedler's approach, which
requires the determination of the eigenvector belonging to the second smallest
Eigenvalue of the Laplacian with K-means partitioning algorithm.
","[{'version': 'v1', 'created': 'Fri, 9 Mar 2012 07:08:10 GMT'}]",2012-03-12,"[['Madhulatha', 'T Soni', '']]","['Clustering', 'K-means', 'Iterative relocation', 'Fiedler Approach', 'Symmetric Matrix', 'Laplacian matrix', 'Eigen values']"
16324,1705.06338,Bibek Behera,"Bibek Behera, Manoj Joshi, Abhilash KK, Mohammad Ansari Ismail","Distributed Vector Representation Of Shopping Items, The Customer And
  Shopping Cart To Build A Three Fold Recommendation System",Cicling 2017,,,,cs.IR cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The main idea of this paper is to represent shopping items through vectors
because these vectors act as the base for building em- beddings for customers
and shopping carts. Also, these vectors are input to the mathematical models
that act as either a recommendation engine or help in targeting potential
customers. We have used exponential family embeddings as the tool to construct
two basic vectors - product embeddings and context vectors. Using the basic
vectors, we build combined embeddings, trip embeddings and customer embeddings.
Combined embeddings mix linguistic properties of product names with their
shopping patterns. The customer embeddings establish an understand- ing of the
buying pattern of customers in a group and help in building customer profile.
For example a customer profile can represent customers frequently buying
pet-food. Identifying such profiles can help us bring out offers and discounts.
Similarly, trip embeddings are used to build trip profiles. People happen to
buy similar set of products in a trip and hence their trip embeddings can be
used to predict the next product they would like to buy. This is a novel
technique and the first of its kind to make recommendation using product, trip
and customer embeddings.
","[{'version': 'v1', 'created': 'Wed, 17 May 2017 20:28:14 GMT'}]",2017-05-19,"[['Behera', 'Bibek', ''], ['Joshi', 'Manoj', ''], ['KK', 'Abhilash', ''], ['Ismail', 'Mohammad Ansari', '']]","['Product Embedding', 'shopping cart', 'vector representation']"
16325,1207.6329,Sean Chester,Sean Chester and Alex Thomo and S. Venkatesh and Sue Whitesides,Computing optimal k-regret minimizing sets with top-k depth contours,"10 pages, 9 figures",,,,cs.DB cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Regret minimizing sets are a very recent approach to representing a dataset D
with a small subset S of representative tuples. The set S is chosen such that
executing any top-1 query on S rather than D is minimally perceptible to any
user. To discover an optimal regret minimizing set of a predetermined
cardinality is conjectured to be a hard problem. In this paper, we generalize
the problem to that of finding an optimal k$regret minimizing set, wherein the
difference is computed over top-k queries, rather than top-1 queries.
  We adapt known geometric ideas of top-k depth contours and the reverse top-k
problem. We show that the depth contours themselves offer a means of comparing
the optimality of regret minimizing sets using L2 distance. We design an
O(cn^2) plane sweep algorithm for two dimensions to compute an optimal regret
minimizing set of cardinality c. For higher dimensions, we introduce a greedy
algorithm that progresses towards increasingly optimal solutions by exploiting
the transitivity of L2 distance.
","[{'version': 'v1', 'created': 'Thu, 26 Jul 2012 16:59:17 GMT'}]",2012-07-27,"[['Chester', 'Sean', ''], ['Thomo', 'Alex', ''], ['Venkatesh', 'S.', ''], ['Whitesides', 'Sue', '']]","['regret', 'representative databases', 'top-k', 'arrangement of lines', 'planesweep']"
16326,1403.6794,David Olivieri,Iv\'an G\'omez-Conde and David N. Olivieri,"KPCA Spatio-temporal trajectory point cloud classifier for recognizing
  human actions in a CBVR system",,,,,cs.IR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a content based video retrieval (CBVR) software system for
identifying specific locations of a human action within a full length film, and
retrieving similar video shots from a query. For this, we introduce the concept
of a trajectory point cloud for classifying unique actions, encoded in a
spatio-temporal covariant eigenspace, where each point is characterized by its
spatial location, local Frenet-Serret vector basis, time averaged curvature and
torsion and the mean osculating hyperplane. Since each action can be
distinguished by their unique trajectories within this space, the trajectory
point cloud is used to define an adaptive distance metric for classifying
queries against stored actions. Depending upon the distance to other
trajectories, the distance metric uses either large scale structure of the
trajectory point cloud, such as the mean distance between cloud centroids or
the difference in hyperplane orientation, or small structure such as the time
averaged curvature and torsion, to classify individual points in a fuzzy-KNN.
Our system can function in real-time and has an accuracy greater than 93% for
multiple action recognition within video repositories. We demonstrate the use
of our CBVR system in two situations: by locating specific frame positions of
trained actions in two full featured films, and video shot retrieval from a
database with a web search application.
","[{'version': 'v1', 'created': 'Wed, 26 Mar 2014 19:10:53 GMT'}]",2014-03-27,"[['Gómez-Conde', 'Iván', ''], ['Olivieri', 'David N.', '']]","['Human Motion Recognition', 'Content Based Video Retrieval', 'Spatio-TemporalTemplates', 'Kernel-PCA', 'Frenet-Serret Formulas', 'differential curvature', 'fuzzy-KNN']"
16327,1412.6163,Narges Ahmidi,"Piyush Poddar, Narges Ahmidi, S. Swaroop Vedula, Lisa Ishii, Gregory
  D. Hager, Masaru Ishii","Automated Objective Surgical Skill Assessment in the Operating Room
  Using Unstructured Tool Motion",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Previous work on surgical skill assessment using intraoperative tool motion
in the operating room (OR) has focused on highly-structured surgical tasks such
as cholecystectomy. Further, these methods only considered generic motion
metrics such as time and number of movements, which are of limited instructive
value. In this paper, we developed and evaluated an automated approach to the
surgical skill assessment of nasal septoplasty in the OR. The obstructed field
of view and highly unstructured nature of septoplasty precludes trainees from
efficiently learning the procedure. We propose a descriptive structure of
septoplasty consisting of two types of activity: (1) brushing activity directed
away from the septum plane characterizing the consistency of the surgeon's
wrist motion and (2) activity along the septal plane characterizing the
surgeon's coverage pattern. We derived features related to these two activity
types that classify a surgeon's level of training with an average accuracy of
about 72%. The features we developed provide surgeons with personalized,
actionable feedback regarding their tool motion.
","[{'version': 'v1', 'created': 'Thu, 18 Dec 2014 22:09:22 GMT'}]",2014-12-22,"[['Poddar', 'Piyush', ''], ['Ahmidi', 'Narges', ''], ['Vedula', 'S. Swaroop', ''], ['Ishii', 'Lisa', ''], ['Hager', 'Gregory D.', ''], ['Ishii', 'Masaru', '']]","['Surgical Motion', 'Skill Evaluation', 'Support Vector Machine', 'Nasal Septoplasty', 'Surgical Training', 'Tool Motion', 'Kinematics', 'Operating Room']"
16328,1301.3991,Zhenghong Chen,"Zhenghong Chen, Xiaoxian Tang, Bican Xia",Generic Regular Decompositions for Parametric Polynomial Systems,"It is the latest version. arXiv admin note: text overlap with
  arXiv:1208.6112",,,,cs.SC cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a generalization of our earlier work in [19]. In this
paper, the two concepts, generic regular decomposition (GRD) and
regular-decomposition-unstable (RDU) variety introduced in [19] for generic
zero-dimensional systems, are extended to the case where the parametric systems
are not necessarily zero-dimensional. An algorithm is provided to compute GRDs
and the associated RDU varieties of parametric systems simultaneously on the
basis of the algorithm for generic zero-dimensional systems proposed in [19].
Then the solutions of any parametric system can be represented by the solutions
of finitely many regular systems and the decomposition is stable at any
parameter value in the complement of the associated RDU variety of the
parameter space. The related definitions and the results presented in [19] are
also generalized and a further discussion on RDU varieties is given from an
experimental point of view. The new algorithm has been implemented on the basis
of DISCOVERER with Maple 16 and experimented with a number of benchmarks from
the literature.
","[{'version': 'v1', 'created': 'Thu, 17 Jan 2013 06:16:02 GMT'}]",2013-01-18,"[['Chen', 'Zhenghong', ''], ['Tang', 'Xiaoxian', ''], ['Xia', 'Bican', '']]","['parametric polynomial system', 'regular-decomposition-unstable variety', 'genericregular decomposition']"
16329,1802.08401,Huifeng Guo,"Feng Liu, Ruiming Tang, Xutao Li, Yunming Ye, Huifeng Guo, Xiuqiang He","Novel Approaches to Accelerating the Convergence Rate of Markov Decision
  Process for Search Result Diversification",This research work has been accepted by DASFAA'18,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, some studies have utilized the Markov Decision Process for
diversifying (MDP-DIV) the search results in information retrieval. Though
promising performances can be delivered, MDP-DIV suffers from a very slow
convergence, which hinders its usability in real applications. In this paper,
we aim to promote the performance of MDP-DIV by speeding up the convergence
rate without much accuracy sacrifice. The slow convergence is incurred by two
main reasons: the large action space and data scarcity. On the one hand, the
sequential decision making at each position needs to evaluate the
query-document relevance for all the candidate set, which results in a huge
searching space for MDP; on the other hand, due to the data scarcity, the agent
has to proceed more ""trial and error"" interactions with the environment. To
tackle this problem, we propose MDP-DIV-kNN and MDP-DIV-NTN methods. The
MDP-DIV-kNN method adopts a $k$ nearest neighbor strategy, i.e., discarding the
$k$ nearest neighbors of the recently-selected action (document), to reduce the
diversification searching space. The MDP-DIV-NTN employs a pre-trained
diversification neural tensor network (NTN-DIV) as the evaluation model, and
combines the results with MDP to produce the final ranking solution. The
experiment results demonstrate that the two proposed methods indeed accelerate
the convergence rate of the MDP-DIV, which is 3x faster, while the accuracies
produced barely degrade, or even are better.
","[{'version': 'v1', 'created': 'Fri, 23 Feb 2018 06:08:28 GMT'}]",2018-02-26,"[['Liu', 'Feng', ''], ['Tang', 'Ruiming', ''], ['Li', 'Xutao', ''], ['Ye', 'Yunming', ''], ['Guo', 'Huifeng', ''], ['He', 'Xiuqiang', '']]","['search result diversification', 'Markov decision process', 'convergence rate']"
16330,0711.2442,Li Rong,"Zhisheng Duan, Wenxu Wang, Chao Liu and Guanrong Chen",Are networks with more edges easier to synchronize?,"14 pages, 18 figures",,,,cs.NI,,"  In this paper, the relationship between the network synchronizability and the
edge distribution of its associated graph is investigated. First, it is shown
that adding one edge to a cycle definitely decreases the network
sychronizability. Then, since sometimes the synchronizability can be enhanced
by changing the network structure, the question of whether the networks with
more edges are easier to synchronize is addressed. It is shown by examples that
the answer is negative. This reveals that generally there are redundant edges
in a network, which not only make no contributions to synchronization but
actually may reduce the synchronizability. Moreover, an example shows that the
node betweenness centrality is not always a good indicator for the network
synchronizability. Finally, some more examples are presented to illustrate how
the network synchronizability varies following the addition of edges, where all
the examples show that the network synchronizability globally increases but
locally fluctuates as the number of added edges increases.
","[{'version': 'v1', 'created': 'Thu, 15 Nov 2007 15:34:55 GMT'}]",2007-11-16,"[['Duan', 'Zhisheng', ''], ['Wang', 'Wenxu', ''], ['Liu', 'Chao', ''], ['Chen', 'Guanrong', '']]","['Complex network', 'Complementary graph', 'Synchronizability', 'Edge addition']"
16331,1609.06492,Alessia Amelio Dr.,"Darko Brodic, Alessia Amelio, Zoran N. Milivojevic, Milena Jevtic",Document Image Coding and Clustering for Script Discrimination,"8 pages, 4 figures, 2 tables",ICIC Express Letters Vol. 10 n. 7 July 2016 pp. 1561-1566,,,cs.CV cs.AI cs.CL cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper introduces a new method for discrimination of documents given in
different scripts. The document is mapped into a uniformly coded text of
numerical values. It is derived from the position of the letters in the text
line, based on their typographical characteristics. Each code is considered as
a gray level. Accordingly, the coded text determines a 1-D image, on which
texture analysis by run-length statistics and local binary pattern is
performed. It defines feature vectors representing the script content of the
document. A modified clustering approach employed on document feature vector
groups documents written in the same script. Experimentation performed on two
custom oriented databases of historical documents in old Cyrillic, angular and
round Glagolitic as well as Antiqua and Fraktur scripts demonstrates the
superiority of the proposed method with respect to well-known methods in the
state-of-the-art.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2016 10:52:03 GMT'}]",2016-09-22,"[['Brodic', 'Darko', ''], ['Amelio', 'Alessia', ''], ['Milivojevic', 'Zoran N.', ''], ['Jevtic', 'Milena', '']]","['Historical documents', 'Feature extraction', 'Script recognition', 'Clustering']"
16332,1304.4058,Conrad Lee,"Conrad Lee, Bobo Nick, Ulrik Brandes, P\'adraig Cunningham",Link Prediction with Social Vector Clocks,"9 pages, 6 figures",,,,cs.SI physics.soc-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  State-of-the-art link prediction utilizes combinations of complex features
derived from network panel data. We here show that computationally less
expensive features can achieve the same performance in the common scenario in
which the data is available as a sequence of interactions. Our features are
based on social vector clocks, an adaptation of the vector-clock concept
introduced in distributed computing to social interaction networks. In fact,
our experiments suggest that by taking into account the order and spacing of
interactions, social vector clocks exploit different aspects of link formation
so that their combination with previous approaches yields the most accurate
predictor to date.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2013 11:37:56 GMT'}]",2013-04-16,"[['Lee', 'Conrad', ''], ['Nick', 'Bobo', ''], ['Brandes', 'Ulrik', ''], ['Cunningham', 'Pádraig', '']]","['social networks', 'vector clocks', 'link prediction', 'online algorithms']"
16333,1406.6854,Jinwei Xu,"Jinwei Xu, Jiankun Hu, Xiuping Jia","A Fully Automated Latent Fingerprint Matcher with Embedded Self-learning
  Segmentation Module",,,,,cs.CR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Latent fingerprint has the practical value to identify the suspects who have
unintentionally left a trace of fingerprint in the crime scenes. However,
designing a fully automated latent fingerprint matcher is a very challenging
task as it needs to address many challenging issues including the separation of
overlapping structured patterns over the partial and poor quality latent
fingerprint image, and finding a match against a large background database that
would have different resolutions. Currently there is no fully automated latent
fingerprint matcher available to the public and most literature reports have
utilized a specialized latent fingerprint matcher COTS3 which is not accessible
to the public. This will make it infeasible to assess and compare the relevant
research work which is vital for this research community. In this study, we
target to develop a fully automated latent matcher for adaptive detection of
the region of interest and robust matching of latent prints. Unlike the
manually conducted matching procedure, the proposed latent matcher can run like
a sealed black box without any manual intervention. This matcher consists of
the following two modules: (i) the dictionary learning-based region of interest
(ROI) segmentation scheme; and (ii) the genetic algorithm-based minutiae set
matching unit. Experimental results on NIST SD27 latent fingerprint database
demonstrates that the proposed matcher outperforms the currently public
state-of-art latent fingerprint matcher.
","[{'version': 'v1', 'created': 'Thu, 26 Jun 2014 11:51:56 GMT'}]",2014-06-27,"[['Xu', 'Jinwei', ''], ['Hu', 'Jiankun', ''], ['Jia', 'Xiuping', '']]","['Latent fingerprint', 'fingerprint matching', 'fingerprint segmentation', 'dictionary']"
16334,1610.05961,Mahdi Jafari Siavoshani,"Ali Pourmiri, Mahdi Jafari Siavoshani, Seyed Pooya Shariatpanahi",Proximity-Aware Balanced Allocations in Cache Networks,"14 pages, 6 figures",,,,cs.DS cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider load balancing in a network of caching servers delivering
contents to end users. Randomized load balancing via the so-called power of two
choices is a well-known approach in parallel and distributed systems that
reduces network imbalance. In this paper, we propose a randomized load
balancing scheme which simultaneously considers cache size limitation and
proximity in the server redirection process.
  Since the memory limitation and the proximity constraint cause correlation in
the server selection process, we may not benefit from the power of two choices
in general. However, we prove that in certain regimes, in terms of memory
limitation and proximity constraint, our scheme results in the maximum load of
order $\Theta(\log\log n)$ (here $n$ is the number of servers and requests),
and at the same time, leads to a low communication cost. This is an exponential
improvement in the maximum load compared to the scheme which assigns each
request to the nearest available replica. Finally, we investigate our scheme
performance by extensive simulations.
","[{'version': 'v1', 'created': 'Wed, 19 Oct 2016 11:16:08 GMT'}, {'version': 'v2', 'created': 'Sun, 23 Oct 2016 15:29:47 GMT'}]",2016-10-25,"[['Pourmiri', 'Ali', ''], ['Siavoshani', 'Mahdi Jafari', ''], ['Shariatpanahi', 'Seyed Pooya', '']]","['Randomized Algorithms', 'Distributed Caching Servers', 'Request Routing', 'Load Balancing', 'Communication Cost', 'Ballsinto-Bins', 'Content Delivery Networks']"
16335,1603.06041,Gucan Long,"Gucan Long, Laurent Kneip, Jose M. Alvarez, Hongdong Li",Learning Image Matching by Simply Watching Video,"The second version contains additional quantitative evaluation of
  frame interpolation",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work presents an unsupervised learning based approach to the ubiquitous
computer vision problem of image matching. We start from the insight that the
problem of frame-interpolation implicitly solves for inter-frame
correspondences. This permits the application of analysis-by-synthesis: we
firstly train and apply a Convolutional Neural Network for frame-interpolation,
then obtain correspondences by inverting the learned CNN. The key benefit
behind this strategy is that the CNN for frame-interpolation can be trained in
an unsupervised manner by exploiting the temporal coherency that is naturally
contained in real-world video sequences. The present model therefore learns
image matching by simply watching videos. Besides a promise to be more
generally applicable, the presented approach achieves surprising performance
comparable to traditional empirically designed methods.
","[{'version': 'v1', 'created': 'Sat, 19 Mar 2016 03:45:44 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Mar 2016 04:35:49 GMT'}]",2016-03-30,"[['Long', 'Gucan', ''], ['Kneip', 'Laurent', ''], ['Alvarez', 'Jose M.', ''], ['Li', 'Hongdong', '']]","['Image Correspondence', 'Unsupervised Learning', 'Analysisby Synthesis', 'Temporal Coherency', 'Convolutional Neural Network']"
16336,1412.3131,Afdel Karim,"Ali Aajli, Karim Afdel",A tool for implementation of a domain model based on fuzzy relationships,61-65,,,,cs.CY cs.AI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The domain model is one of the important components used by adaptive learning
systems to automatically generate customized courses for the learners. In this
paper our contribution is to propose a new tool for implementation of a domain
model based on fuzzy relationships among concepts. This tool allows the experts
and teachers to find the best parameters in order to adapt the learners's
differences.
","[{'version': 'v1', 'created': 'Mon, 8 Dec 2014 18:28:01 GMT'}]",2014-12-11,"[['Aajli', 'Ali', ''], ['Afdel', 'Karim', '']]","['Learning path', 'Fuzzy Sets Theory', 'Fuzzy relationships', 'Data mining']"
16337,1802.06927,Nishant Desai,"Vinay Uday Prabhu, Nishant Desai, John Whaley",On Lyapunov exponents and adversarial perturbation,,,,,cs.CV cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we would like to disseminate a serendipitous discovery
involving Lyapunov exponents of a 1-D time series and their use in serving as a
filtering defense tool against a specific kind of deep adversarial
perturbation. To this end, we use the state-of-the-art CleverHans library to
generate adversarial perturbations against a standard Convolutional Neural
Network (CNN) architecture trained on the MNIST as well as the Fashion-MNIST
datasets. We empirically demonstrate how the Lyapunov exponents computed on the
flattened 1-D vector representations of the images served as highly
discriminative features that could be to pre-classify images as adversarial or
legitimate before feeding the image into the CNN for classification. We also
explore the issue of possible false-alarms when the input images are noisy in a
non-adversarial sense.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 01:09:22 GMT'}]",2018-02-21,"[['Prabhu', 'Vinay Uday', ''], ['Desai', 'Nishant', ''], ['Whaley', 'John', '']]","['Deep learning', 'adversarial attacks', 'transfer learning']"
16338,1307.0349,Wang Gang,"Gang Wang, Chunhong Zhang, Xiaofeng Qiu, Zhimin Zeng","Replacing Network Coordinate System with Internet Delay Matrix Service
  (IDMS): A Case Study in Chinese Internet","15 pages, 14 figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network distance (Round Trip Time, RTT) is an important parameter for many
Internet distributed systems to optimize their performances. Network Coordinate
System (NCS) is assumed as a lightweight and scalable mechanism to predict
network distance between any two Internet hosts without explicit measurements.
Though many NCSes have been proposed in the literatures, they are not
satisfactory in terms of accuracy. In this paper, we propose to use delay
matrix to replace the NCS. This paper makes three contributions. First, we show
that not all the hosts need an independent network coordinate (NC). On the
contrary, most hosts can be represented as one or several nodes in NCS. Second,
we present an Internet Delay Matrix Service (IDMS) for representing network
distances without explicit measurements in Internet. Third, we describe two
delay matrices up to date delay matrix (UDM) and previous delay matrices (PDM)
for representing the network distances. Extensive simulations on our collected
Chinese Internet data sets show that IDMS is an accurate, efficient, scalable
and practical method for Chinese Internet. The performance of IDMS is better
than other existing approaches.
","[{'version': 'v1', 'created': 'Mon, 1 Jul 2013 12:50:17 GMT'}]",2013-07-02,"[['Wang', 'Gang', ''], ['Zhang', 'Chunhong', ''], ['Qiu', 'Xiaofeng', ''], ['Zeng', 'Zhimin', '']]","['Network Coordinate System', 'Triangle Inequality Violation', 'P2P', 'Delay Matrix']"
16339,1609.04918,Jimmy Wu,"Alex Khodaverdian, Benjamin Weitz, Jimmy Wu, Nir Yosef",Steiner Network Problems on Temporal Graphs,,,,,cs.CC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a temporal Steiner network problem in which a graph, as well as
changes to its edges and/or vertices over a set of discrete times, are given as
input; the goal is to find a minimal subgraph satisfying a set of $k$
time-sensitive connectivity demands. We show that this problem, $k$-Temporal
Steiner Network ($k$-TSN), is NP-hard to approximate to a factor of $k -
\epsilon$, for every fixed $k \geq 2$ and $\epsilon > 0$. This bound is tight,
as certified by a trivial approximation algorithm. Conceptually this
demonstrates, in contrast to known results for traditional Steiner problems,
that a time dimension adds considerable complexity even when the problem is
offline.
  We also discuss special cases of $k$-TSN in which the graph changes satisfy a
monotonicity property. We show approximation-preserving reductions from
monotonic $k$-TSN to well-studied problems such as Priority Steiner Tree and
Directed Steiner Tree, implying improved approximation algorithms.
  Lastly, $k$-TSN and its variants arise naturally in computational biology; to
facilitate such applications, we devise an integer linear program for $k$-TSN
based on network flows.
","[{'version': 'v1', 'created': 'Fri, 16 Sep 2016 06:49:22 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Sep 2017 03:30:55 GMT'}]",2017-09-04,"[['Khodaverdian', 'Alex', ''], ['Weitz', 'Benjamin', ''], ['Wu', 'Jimmy', ''], ['Yosef', 'Nir', '']]","['Steiner tree', 'temporal graphs', 'hardness of approximation', 'approximationalgorithms', 'network biology']"
16340,0705.2876,Phillip Bradford,Phillip G. Bradford and Daniel A. Ray,"An online algorithm for generating fractal hash chains applied to
  digital chains of custody",,,,,cs.CR cs.DS,,"  This paper gives an online algorithm for generating Jakobsson's fractal hash
chains. Our new algorithm compliments Jakobsson's fractal hash chain algorithm
for preimage traversal since his algorithm assumes the entire hash chain is
precomputed and a particular list of Ceiling(log n) hash elements or pebbles
are saved. Our online algorithm for hash chain traversal incrementally
generates a hash chain of n hash elements without knowledge of n before it
starts. For any n, our algorithm stores only the Ceiling(log n) pebbles which
are precisely the inputs for Jakobsson's amortized hash chain preimage
traversal algorithm. This compact representation is useful to generate,
traverse, and store a number of large digital hash chains on a small and
constrained device. We also give an application using both Jakobsson's and our
new algorithm applied to digital chains of custody for validating dynamically
changing forensics data.
","[{'version': 'v1', 'created': 'Sun, 20 May 2007 17:14:38 GMT'}]",2007-05-23,"[['Bradford', 'Phillip G.', ''], ['Ray', 'Daniel A.', '']]","['Fractal hash chains', 'hash chain preimage traversal', 'hash chain traversal', 'digitalchains of custody', 'digital forensics', 'time-stamping']"
16341,1111.0321,Yoann Dieudonn\'e,Yoann Dieudonn\'e and Andrzej Pelc,Anonymous Meeting in Networks,,,,,cs.DS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A team consisting of an unknown number of mobile agents, starting from
different nodes of an unknown network, possibly at different times, have to
meet at the same node. Agents are anonymous (identical), execute the same
deterministic algorithm and move in synchronous rounds along links of the
network. Which configurations are gatherable and how to gather all of them
deterministically by the same algorithm?
  We give a complete solution of this gathering problem in arbitrary networks.
We characterize all gatherable configurations and give two universal
deterministic gathering algorithms, i.e., algorithms that gather all gatherable
configurations. The first algorithm works under the assumption that an upper
bound n on the size of the network is known. In this case our algorithm
guarantees gathering with detection, i.e., the existence of a round for any
gatherable configuration, such that all agents are at the same node and all
declare that gathering is accomplished. If no upper bound on the size of the
network is known, we show that a universal algorithm for gathering with
detection does not exist. Hence, for this harder scenario, we construct a
second universal gathering algorithm, which guarantees that, for any gatherable
configuration, all agents eventually get to one node and stop, although they
cannot tell if gathering is over. The time of the first algorithm is polynomial
in the upper bound n on the size of the network, and the time of the second
algorithm is polynomial in the (unknown) size itself.
  Our results have an important consequence for the leader election problem for
anonymous agents in arbitrary graphs. For anonymous agents in graphs, leader
election turns out to be equivalent to gathering with detection. Hence, as a
by-product, we obtain a complete solution of the leader election problem for
anonymous agents in arbitrary graphs.
","[{'version': 'v1', 'created': 'Tue, 1 Nov 2011 21:18:10 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Feb 2012 19:44:25 GMT'}, {'version': 'v3', 'created': 'Sun, 13 Mar 2016 09:49:08 GMT'}]",2016-03-15,"[['Dieudonné', 'Yoann', ''], ['Pelc', 'Andrzej', '']]","['gathering', 'deterministic algorithm', 'anonymous mobile agent']"
16342,1402.1438,Perry Nicolas,"Alexandre Candlot (IRCCyN), Nicolas Perry (LGM2B), Alain Bernard
  (IRCCyN), Samar Ammar-Khodja (IRCCyN)",Deployment of an Innovative Resource Choice Method for Process Planning,,"CIRP Journal of Manufacturing Systems 35, 5 (2006) 487-506",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Designers, process planners and manufacturers naturally consider different
concepts for a same object. The stiffness of production means and the design
specification requirements mark out process planners as responsible of the
coherent integration of all constraints. First, this paper details an
innovative solution of resource choice, applied for aircraft manufacturing
parts. In a second part, key concepts are instanced for the considered
industrial domain. Finally, a digital mock up validates the solution viability
and demonstrates the possibility of an in-process knowledge capitalisation and
use. Formalising the link between Design and Manufacturing allows to hope
enhancements of simultaneous Product / Process developments.
","[{'version': 'v1', 'created': 'Wed, 5 Feb 2014 14:34:31 GMT'}]",2014-02-07,"[['Candlot', 'Alexandre', '', 'IRCCyN'], ['Perry', 'Nicolas', '', 'LGM2B'], ['Bernard', 'Alain', '', 'IRCCyN'], ['Ammar-Khodja', 'Samar', '', 'IRCCyN']]","['Resource', 'Knowledge', 'Management']"
16343,1007.0409,Dimple Juneja Dr.,"Natarajan Meghanathan, Leslie Milton","A Performance Comparison of Stability, Load-Balancing and Power-Aware
  Routing Protocols for Mobile Ad Hoc Networks",http://ijict.org/index.php/ijoat/article/view/performance-comparison-manet-routing-protocols,"International Journal of Advancements in Technology, Vol 1, No 1
  (2010)",,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  The high-level contribution of this paper is a simulation-based detailed
performance comparison of three different classes of routing protocols for
mobile ad hoc networks: stability-based routing, power-aware routing and
load-balanced routing. We choose the Flow-Oriented Routing protocol (FORP), the
traffic interference based Load Balancing Routing (LBR) protocol and Min-Max
Battery Cost Routing (MMBCR) as representatives of the stability-based routing,
load-balancing and power-aware routing protocols respectively. Among the three
routing protocols, FORP incurs the least number of route transitions; while LBR
incurs the smallest hop count and lowest end-to-end delay per data packet.
Energy consumed per node is the least for MMBCR, closely followed by LBR. MMBCR
is the most fair in terms of node usage and hence it incurs the largest time
for first node failure. FORP tends to repeatedly use nodes lying on the stable
path and hence is the most unfair of the three routing protocols and it incurs
the smallest value for the time of first node failure. As we measure the
failure times of up to the first five nodes in the network, we observe that LBR
incurs the maximum improvement in the lifetime of the nodes and MMBCR incurs
the least improvement beyond the time of first node failure.
","[{'version': 'v1', 'created': 'Thu, 1 Jul 2010 09:35:44 GMT'}]",2010-07-05,"[['Meghanathan', 'Natarajan', ''], ['Milton', 'Leslie', '']]","['Stability', 'Load-Balancing', 'Power-Aware', 'Routing Protocol', 'Ad Hoc Networks', 'Simulation', 'Power Control']"
16344,1708.00964,Adnan Mohammed,"Adnan Saher Mohammed, \c{S}ahin Emrah Amrahov, Fatih V. \c{C}elebi",Efficient hybrid search algorithm on ordered datasets,13 pages full-length article,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increase in the rate of data is much higher than the increase in the
speed of computers, which results in a heavy emphasis on search algorithms in
research literature. Searching an item in ordered list is an efficient
operation in data processing. Binary and interpolation search algorithms
commonly are used for searching ordered dataset in many applications. In this
paper, we present a hybrid algorithm to search ordered datasets based on the
idea of interpolation and binary search. The proposed algorithm called Hybrid
Search (HS), which is designed to work efficiently on unknown distributed
ordered datasets, experimental results showed that our proposed algorithm has
better performance when compared with other algorithms that use a similar
approach.
","[{'version': 'v1', 'created': 'Thu, 3 Aug 2017 01:13:40 GMT'}]",2017-08-04,"[['Mohammed', 'Adnan Saher', ''], ['Amrahov', 'Şahin Emrah', ''], ['Çelebi', 'Fatih V.', '']]","['Binary search', 'Interpolation Search', 'Hybrid Search', 'Adaptive Search', 'Interpolation Binary Search']"
16345,1609.02036,Zhirong Wu,"Zhirong Wu, Dahua Lin, Xiaoou Tang",Deep Markov Random Field for Image Modeling,Accepted at ECCV 2016,,,,cs.CV cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Markov Random Fields (MRFs), a formulation widely used in generative image
modeling, have long been plagued by the lack of expressive power. This issue is
primarily due to the fact that conventional MRFs formulations tend to use
simplistic factors to capture local patterns. In this paper, we move beyond
such limitations, and propose a novel MRF model that uses fully-connected
neurons to express the complex interactions among pixels. Through theoretical
analysis, we reveal an inherent connection between this model and recurrent
neural networks, and thereon derive an approximated feed-forward network that
couples multiple RNNs along opposite directions. This formulation combines the
expressive power of deep neural networks and the cyclic dependency structure of
MRF in a unified model, bringing the modeling capability to a new level. The
feed-forward approximation also allows it to be efficiently learned from data.
Experimental results on a variety of low-level vision tasks show notable
improvement over state-of-the-arts.
","[{'version': 'v1', 'created': 'Wed, 7 Sep 2016 15:56:36 GMT'}]",2016-09-08,"[['Wu', 'Zhirong', ''], ['Lin', 'Dahua', ''], ['Tang', 'Xiaoou', '']]","['Generative image model', 'MRF', 'RNN']"
16346,1307.5838,Masoumeh Vali,Masoumeh Vali,Rotational Mutation Genetic Algorithm on optimization Problems,"arXiv admin note: text overlap with arXiv:1307.5534, arXiv:1307.5679,
  arXiv:1307.5840",,,,cs.NE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optimization problem, nowadays, have more application in all major but they
have problem in computation. Calculation of the optimum point in the spaces
with the above dimensions is very time consuming. In this paper, there is
presented a new approach for the optimization of continuous functions with
rotational mutation that is called RM. The proposed algorithm starts from the
point which has best fitness value by elitism mechanism. Then, method of
rotational mutation is used to reach optimal point. In this paper, RM algorithm
is implemented by GA(Briefly RMGA) and is compared with other well- known
algorithms: DE, PGA, Grefensstette and Eshelman [15, 16] and numerical and
simulation results show that RMGA achieve global optimal point with more
decision by smaller generations.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2013 12:09:59 GMT'}]",2013-07-24,"[['Vali', 'Masoumeh', '']]","['genetic algorithm (GA)', 'rotational mutation', 'optimal point']"
16347,0712.2773,Emmanuel Cecchet,"Emmanuel Cecchet, George Candea, Anastasia Ailamaki","Middleware-based Database Replication: The Gaps between Theory and
  Practice","14 pages. Appears in Proc. ACM SIGMOD International Conference on
  Management of Data, Vancouver, Canada, June 2008",,,EPFL technical report DSLAB-REPORT-2007-001,cs.DB cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The need for high availability and performance in data management systems has
been fueling a long running interest in database replication from both academia
and industry. However, academic groups often attack replication problems in
isolation, overlooking the need for completeness in their solutions, while
commercial teams take a holistic approach that often misses opportunities for
fundamental innovation. This has created over time a gap between academic
research and industrial practice.
  This paper aims to characterize the gap along three axes: performance,
availability, and administration. We build on our own experience developing and
deploying replication systems in commercial and academic settings, as well as
on a large body of prior related work. We sift through representative examples
from the last decade of open-source, academic, and commercial database
replication systems and combine this material with case studies from real
systems deployed at Fortune 500 customers. We propose two agendas, one for
academic research and one for industrial R&D, which we believe can bridge the
gap within 5-10 years. This way, we hope to both motivate and help researchers
in making the theory and practice of middleware-based database replication more
relevant to each other.
","[{'version': 'v1', 'created': 'Mon, 17 Dec 2007 18:42:15 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Nov 2008 20:53:51 GMT'}]",2008-11-05,"[['Cecchet', 'Emmanuel', ''], ['Candea', 'George', ''], ['Ailamaki', 'Anastasia', '']]","['Middleware', 'database replication', 'practice and experience']"
16348,1111.6265,Pascale Sebillot,"Julien Lawto, Jean-Luc Gauvain (LIMSI), Lori Lamel (LIMSI), Gregory
  Grefenstete, Guillaume Gravier (INRIA - IRISA), Julien Despres, Camille
  Guinaudeau (INRIA - IRISA), Pascale S\'ebillot (INRIA - IRISA)","A Scalable Video Search Engine Based on Audio Content Indexing and Topic
  Segmentation","NEM Summit, Torino : Italy (2011)",,,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One important class of online videos is that of news broadcasts. Most news
organisations provide near-immediate access to topical news broadcasts over the
Internet, through RSS streams or podcasts. Until lately, technology has not
made it possible for a user to automatically go to the smaller parts, within a
longer broadcast, that might interest them. Recent advances in both speech
recognition systems and natural language processing have led to a number of
robust tools that allow us to provide users with quicker, more focussed access
to relevant segments of one or more news broadcast videos. Here we present our
new interface for browsing or searching news broadcasts (video/audio) that
exploits these new language processing tools to (i) provide immediate access to
topical passages within news broadcasts, (ii) browse news broadcasts by events
as well as by people, places and organisations, (iii) perform cross lingual
search of news broadcasts, (iv) search for news through a map interface, (v)
browse news by trending topics, and (vi) see automatically-generated textual
clues for news segments, before listening. Our publicly searchable demonstrator
currently indexes daily broadcast news content from 50 sources in English,
French, Chinese, Arabic, Spanish, Dutch and Russian.
","[{'version': 'v1', 'created': 'Sun, 27 Nov 2011 15:08:36 GMT'}]",2011-11-29,"[['Lawto', 'Julien', '', 'LIMSI'], ['Gauvain', 'Jean-Luc', '', 'LIMSI'], ['Lamel', 'Lori', '', 'LIMSI'], ['Grefenstete', 'Gregory', '', 'INRIA - IRISA'], ['Gravier', 'Guillaume', '', 'INRIA - IRISA'], ['Despres', 'Julien', '', 'INRIA - IRISA'], ['Guinaudeau', 'Camille', '', 'INRIA - IRISA'], ['Sébillot', 'Pascale', '', 'INRIA - IRISA']]","['Video indexing', 'Video search', 'Video Browsing']"
16349,2007.05156,Rongye Shi,Xuan Di and Rongye Shi,"A Survey on Autonomous Vehicle Control in the Era of Mixed-Autonomy:
  From Physics-Based to AI-Guided Driving Policy Learning",,,,,cs.AI cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper serves as an introduction and overview of the potentially useful
models and methodologies from artificial intelligence (AI) into the field of
transportation engineering for autonomous vehicle (AV) control in the era of
mixed autonomy. We will discuss state-of-the-art applications of AI-guided
methods, identify opportunities and obstacles, raise open questions, and help
suggest the building blocks and areas where AI could play a role in mixed
autonomy. We divide the stage of autonomous vehicle (AV) deployment into four
phases: the pure HVs, the HV-dominated, the AVdominated, and the pure AVs. This
paper is primarily focused on the latter three phases. It is the
first-of-its-kind survey paper to comprehensively review literature in both
transportation engineering and AI for mixed traffic modeling. Models used for
each phase are summarized, encompassing game theory, deep (reinforcement)
learning, and imitation learning. While reviewing the methodologies, we
primarily focus on the following research questions: (1) What scalable driving
policies are to control a large number of AVs in mixed traffic comprised of
human drivers and uncontrollable AVs? (2) How do we estimate human driver
behaviors? (3) How should the driving behavior of uncontrollable AVs be modeled
in the environment? (4) How are the interactions between human drivers and
autonomous vehicles characterized? Hopefully this paper will not only inspire
our transportation community to rethink the conventional models that are
developed in the data-shortage era, but also reach out to other disciplines, in
particular robotics and machine learning, to join forces towards creating a
safe and efficient mixed traffic ecosystem.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 04:27:39 GMT'}]",2020-07-13,"[['Di', 'Xuan', ''], ['Shi', 'Rongye', '']]","['Artificial intelligence (AI)', 'Autonomous vehicle (AV) control', 'Mixed autonomy']"
16350,1501.00149,Antonio Abreu,Edson Lopes and Jos\'e Caetano and Ant\'onio Abreu and Frederico Grilo,iReclass - An automatic system for recording classes,12 pages,,,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the details of a system capable of recording on video a
traditional class. By traditional class it is meant a teacher, a blackboard and
a white canvas where course notes are projected. The system is able to track
the movements of the lecturer, while recording it on video at the required
frame rate (e.g., 25 fps). The system is also capable of understanding five arm
gestures made by the lecturer with the intent of controlling which scenario is
recorded: himself, the blackboard or the white canvas. The remaining two
gestures are for start/stop the recorder. The system is composed by a Kinect
sensor, a video camera, a microphone, one pan-tilt system and one pan system,
using a total of three step motors.
","[{'version': 'v1', 'created': 'Wed, 31 Dec 2014 15:06:27 GMT'}]",2015-01-05,"[['Lopes', 'Edson', ''], ['Caetano', 'José', ''], ['Abreu', 'António', ''], ['Grilo', 'Frederico', '']]","['Person tracking', 'video recording', 'arm gestures', '3D sensors', 'Kinect', 'pan and tilt']"
16351,1702.01692,Christian Schulz,"Peter Sanders, Christian Schulz, Darren Strash and Robert Williger",Distributed Evolutionary k-way Node Separators,"arXiv admin note: text overlap with arXiv:1509.01190, arXiv:1110.0477",,,,cs.NE cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computing high quality node separators in large graphs is necessary for a
variety of applications, ranging from divide-and-conquer algorithms to VLSI
design. In this work, we present a novel distributed evolutionary algorithm
tackling the k-way node separator problem. A key component of our contribution
includes new k-way local search algorithms based on maximum flows. We combine
our local search with a multilevel approach to compute an initial population
for our evolutionary algorithm, and further show how to modify the coarsening
stage of our multilevel algorithm to create effective combine and mutation
operations. Lastly, we combine these techniques with a scalable communication
protocol, producing a system that is able to compute high quality solutions in
a short amount of time. Our experiments against competing algorithms show that
our advanced evolutionary algorithm computes the best result on 94% of the
chosen benchmark instances.
","[{'version': 'v1', 'created': 'Mon, 6 Feb 2017 16:34:27 GMT'}]",2017-02-07,"[['Sanders', 'Peter', ''], ['Schulz', 'Christian', ''], ['Strash', 'Darren', ''], ['Williger', 'Robert', '']]","['graph partitioning', 'node separators', 'max-flow min-cut']"
16352,1406.2823,Roberto Lopez-Herrejon,"Roberto E. Lopez-Herrejon and Javier Ferrer and Francisco Chicano and
  Lukas Linsbauer and Alexander Egyed and Enrique Alba","A Hitchhiker's Guide to Search-Based Software Engineering for Software
  Product Lines",,,,,cs.SE cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Search Based Software Engineering (SBSE) is an emerging discipline that
focuses on the application of search-based optimization techniques to software
engineering problems. The capacity of SBSE techniques to tackle problems
involving large search spaces make their application attractive for Software
Product Lines (SPLs). In recent years, several publications have appeared that
apply SBSE techniques to SPL problems. In this paper, we present the results of
a systematic mapping study of such publications. We identified the stages of
the SPL life cycle where SBSE techniques have been used, what case studies have
been employed and how they have been analysed. This mapping study revealed
potential venues for further research as well as common misunderstanding and
pitfalls when applying SBSE techniques that we address by providing a guideline
for researchers and practitioners interested in exploiting these techniques.
","[{'version': 'v1', 'created': 'Wed, 11 Jun 2014 08:43:51 GMT'}]",2014-06-12,"[['Lopez-Herrejon', 'Roberto E.', ''], ['Ferrer', 'Javier', ''], ['Chicano', 'Francisco', ''], ['Linsbauer', 'Lukas', ''], ['Egyed', 'Alexander', ''], ['Alba', 'Enrique', '']]","['Software Product Lines', 'Search Based Software Engineering', 'Systematic Mapping Study']"
16353,1111.1555,Gilson Oliveira Santos,Gilson O. dos Santos and Francisco M. de Assis,A scheme to protect against multiple quantum erasures,31 pages,,,,cs.IT math.IT quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a scheme able to protect k >= 3 qubits of information against the
occurrence of multiple erasures, based on the code proposed by Yang et al.
(2004 JETP Letters 79 236). In this scheme redundant blocks are used and we
restrict to the case that each erasure must occur in distinct blocks. We
explicitly characterize the encoding operation and the restoring operation
required to implement this scheme. The operators used in these operations can
be adjusted to construct different quantum erasure-correcting codes. A special
feature of this scheme is that no measurement is required. To illustrate our
scheme, we present an example in which five-qubits of information are protected
against the occurrence of two erasures.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2011 12:07:52 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Nov 2011 21:58:18 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Jan 2012 22:22:59 GMT'}]",2012-01-06,"[['Santos', 'Gilson O. dos', ''], ['de Assis', 'Francisco M.', '']]","['Quantum information processing', 'quantum erasure-correcting codes', 'GHZstates', 'entanglement']"
16354,1106.0566,Tianshi Chen,"Tianshi Chen, Yunji Chen, Ke Tang, Guoliang Chen, and Xin Yao","The Impact of Mutation Rate on the Computation Time of Evolutionary
  Dynamic Optimization",,,,,cs.AI cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mutation has traditionally been regarded as an important operator in
evolutionary algorithms. In particular, there have been many experimental
studies which showed the effectiveness of adapting mutation rates for various
static optimization problems. Given the perceived effectiveness of adaptive and
self-adaptive mutation for static optimization problems, there have been
speculations that adaptive and self-adaptive mutation can benefit dynamic
optimization problems even more since adaptation and self-adaptation are
capable of following a dynamic environment. However, few theoretical results
are available in analyzing rigorously evolutionary algorithms for dynamic
optimization problems. It is unclear when adaptive and self-adaptive mutation
rates are likely to be useful for evolutionary algorithms in solving dynamic
optimization problems. This paper provides the first rigorous analysis of
adaptive mutation and its impact on the computation times of evolutionary
algorithms in solving certain dynamic optimization problems. More specifically,
for both individual-based and population-based EAs, we have shown that any
time-variable mutation rate scheme will not significantly outperform a fixed
mutation rate on some dynamic optimization problem instances. The proofs also
offer some insights into conditions under which any time-variable mutation
scheme is unlikely to be useful and into the relationships between the problem
characteristics and algorithmic features (e.g., different mutation schemes).
","[{'version': 'v1', 'created': 'Fri, 3 Jun 2011 05:31:34 GMT'}]",2011-06-06,"[['Chen', 'Tianshi', ''], ['Chen', 'Yunji', ''], ['Tang', 'Ke', ''], ['Chen', 'Guoliang', ''], ['Yao', 'Xin', '']]","['Evolutionary algorithm', 'Mutation rate', 'Adaptation', 'Dynamic optimization']"
16355,1107.2183,Anindya De,Anindya De,Lower bounds in differential privacy,"Corrected some minor errors and typos. To appear in Theory of
  Cryptography Conference (TCC) 2012",,,,cs.CR cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This is a paper about private data analysis, in which a trusted curator
holding a confidential database responds to real vector-valued queries. A
common approach to ensuring privacy for the database elements is to add
appropriately generated random noise to the answers, releasing only these {\em
noisy} responses. In this paper, we investigate various lower bounds on the
noise required to maintain different kind of privacy guarantees.
","[{'version': 'v1', 'created': 'Tue, 12 Jul 2011 02:51:42 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Dec 2011 23:59:15 GMT'}]",2011-12-23,"[['De', 'Anindya', '']]","['Differential privacy', 'LP decoding', 'Rademacher sums']"
16356,1712.02370,Noseong Park,"Tanmoy Chakraborty, Noseong Park","Ensemble-Based Discovery of Disjoint, Overlapping and Fuzzy Community
  Structures in Networks",,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Though much work has been done on ensemble clustering in data mining, the
application of ensemble methods to community detection in networks is in its
infancy. In this paper, we propose two ensemble methods: ENDISCO and MEDOC.
ENDISCO performs disjoint community detection. In contrast, MEDOC performs
disjoint, overlapping, and fuzzy community detection and represents the first
ever ensemble method for fuzzy and overlapping community detection. We run
extensive experiments with both algorithms against both synthetic and several
real-world datasets for which community structures are known. We show that
ENDISCO and MEDOC both beat the best-known existing standalone community
detection algorithms (though we emphasize that they leverage them). In the case
of disjoint community detection, we show that both ENDISCO and MEDOC beat an
existing ensemble community detection algorithm both in terms of multiple
accuracy measures and run-time. We further show that our ensemble algorithms
can help explore core-periphery structure of network communities, identify
stable communities in dynamic networks and help solve the ""degeneracy of
solutions"" problem, generating robust results.
","[{'version': 'v1', 'created': 'Wed, 6 Dec 2017 19:03:07 GMT'}]",2017-12-08,"[['Chakraborty', 'Tanmoy', ''], ['Park', 'Noseong', '']]","['Ensemble approach', 'Community detection', 'Core-peripheryorganization', 'Stable communities']"
16357,1704.07163,Chang-Ryeol Lee,Chang-Ryeol Lee and Kuk-Jin Yoon,Monocular Visual Odometry with a Rolling Shutter Camera,"14 pages, 8 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rolling Shutter (RS) cameras have become popularized because of low-cost
imaging capability. However, the RS cameras suffer from undesirable artifacts
when the camera or the subject is moving, or illumination condition changes.
For that reason, Monocular Visual Odometry (MVO) with RS cameras produces
inaccurate ego-motion estimates. Previous works solve this RS distortion
problem with motion prediction from images and/or inertial sensors. However,
the MVO still has trouble in handling the RS distortion when the camera motion
changes abruptly (e.g. vibration of mobile cameras causes extremely fast motion
instantaneously). To address the problem, we propose the novel MVO algorithm in
consideration of the geometric characteristics of RS cameras. The key idea of
the proposed algorithm is the new RS essential matrix which incorporates the
instantaneous angular and linear velocities at each frame. Our algorithm
produces accurate and robust ego-motion estimates in an online manner, and is
applicable to various mobile applications with RS cameras. The superiority of
the proposed algorithm is validated through quantitative and qualitative
comparison on both synthetic and real dataset.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 12:02:53 GMT'}]",2017-04-25,"[['Lee', 'Chang-Ryeol', ''], ['Yoon', 'Kuk-Jin', '']]","['Monocular Visual Odometry', 'Rolling Shutter Cameras', 'Egomotion Estimation']"
16358,1505.02591,Ningye Zhang,"Jian Li, Haitao Wang, Bowei Zhang, Ningye Zhang",Linear Time Approximation Schemes for Geometric Maximum Coverage,"17 pages, 4 figures, to be published in the Proceedings of 21st
  International Computing and Combinatorics Conference(COCOON2015)",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study approximation algorithms for the following geometric version of the
maximum coverage problem: Let P be a set of n weighted points in the plane. We
want to place m a * b rectangles such that the sum of the weights of the points
in P covered by these rectangles is maximized.For any fixed > 0, we present
efficient approximation schemes that can find (1-{\epsilon})-approximation to
the optimal solution.In particular, for m = 1, our algorithm runs in linear
time O(n log( 1/{\epsilon})), improving over the previous result. For m > 1, we
present an algorithm that runs in
O(n/{\epsilon}log(1/{\epsilon})+m(1/{\epsilon})^(O(min(sqrt(m),1/{\epsilon})))
time.
","[{'version': 'v1', 'created': 'Mon, 11 May 2015 12:50:13 GMT'}]",2015-05-12,"[['Li', 'Jian', ''], ['Wang', 'Haitao', ''], ['Zhang', 'Bowei', ''], ['Zhang', 'Ningye', '']]","['Maximum Coverage', 'Geometric Set Cover', 'Polynomial-TimeApproximation Scheme']"
16359,1110.2654,Ivan Nechta Vasilevich,"Ivan Nechta, Andrei Fionov",Applying statistical methods to text steganography,"7 pages, 1 figure and 4 tables",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a survey of text steganography methods used for hid- ing
secret information inside some covertext. Widely known hiding techniques (such
as translation based steganography, text generating and syntactic embed- ding)
and detection are considered. It is shown that statistical analysis has an
important role in text steganalysis.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2011 13:21:41 GMT'}]",2011-10-13,"[['Nechta', 'Ivan', ''], ['Fionov', 'Andrei', '']]","['Steganography', 'steganalysis', 'linguistic stegosystem', 'statisticalattacks']"
16360,1304.3249,Paolo Parisen Toldin,"Jean-Yves Moyen, Paolo Parisen Toldin","A polytime complexity analyser for Probabilistic Polynomial Time over
  imperative stack programs",,,,,cs.LO cs.CC,http://creativecommons.org/licenses/by/3.0/,"  We present iSAPP (Imperative Static Analyser for Probabilistic Polynomial
Time), a complexity verifier tool that is sound and extensionally complete for
the Probabilistic Polynomial Time (PP) complexity class. iSAPP works on an
imperative programming language for stack machines. The certificate of
polynomiality can be built in polytime, with respect to the number of stacks
used.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2013 10:20:24 GMT'}]",2013-04-12,"[['Moyen', 'Jean-Yves', ''], ['Toldin', 'Paolo Parisen', '']]","['ICC', 'Probabilistic Polytime', 'Static verifier']"
16361,1005.0965,Rdv Ijcsis,"Bikrampal Kaur, Himanshu Aggarwal","Artificial Neural Network based Diagnostic Model For Causes of Success
  and Failures","IEEE Publication format, International Journal of Computer Science
  and Information Security, IJCSIS, Vol. 8 No. 1, April 2010, USA. ISSN 1947
  5500, http://sites.google.com/site/ijcsis/",,,,cs.NE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper an attempt has been made to identify most important human
resource factors and propose a diagnostic model based on the back-propagation
and connectionist model approaches of artificial neural network (ANN). The
focus of the study is on the mobile -communication industry of India. The ANN
based approach is particularly important because conventional approaches (such
as algorithmic) to the problem solving have their inherent disadvantages. The
algorithmic approach is well-suited to the problems that are well-understood
and known solution(s). On the other hand the ANNs have learning by example and
processing capabilities similar to that of a human brain. ANN has been followed
due to its inherent advantage over conversion algorithmic like approaches and
having capabilities, training and human like intuitive decision making
capabilities. Therefore, this ANN based approach is likely to help researchers
and organizations to reach a better solution to the problem of managing the
human resource. The study is particularly important as many studies have been
carried in developed countries but there is a shortage of such studies in
developing nations like India. Here, a model has been derived using
connectionist-ANN approach and improved and verified via back-propagation
algorithm. This suggested ANN based model can be used for testing the success
and failure human factors in any of the communication Industry. Results have
been obtained on the basis of connectionist model, which has been further
refined by BPNN to an accuracy of 99.99%. Any company to predict failure due to
HR factors can directly deploy this model.
","[{'version': 'v1', 'created': 'Thu, 6 May 2010 10:22:40 GMT'}]",2010-05-07,"[['Kaur', 'Bikrampal', ''], ['Aggarwal', 'Himanshu', '']]","['Neural Networks', 'Human resource factors', 'Company success', 'failure factors']"
16362,1510.04454,Yao Ma,"Yao Ma, Hao Zhang, Masashi Sugiyama",Online Markov decision processes with policy iteration,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The online Markov decision process (MDP) is a generalization of the classical
Markov decision process that incorporates changing reward functions. In this
paper, we propose practical online MDP algorithms with policy iteration and
theoretically establish a sublinear regret bound. A notable advantage of the
proposed algorithm is that it can be easily combined with function
approximation, and thus large and possibly continuous state spaces can be
efficiently handled. Through experiments, we demonstrate the usefulness of the
proposed algorithm.
","[{'version': 'v1', 'created': 'Thu, 15 Oct 2015 09:19:49 GMT'}]",2015-10-16,"[['Ma', 'Yao', ''], ['Zhang', 'Hao', ''], ['Sugiyama', 'Masashi', '']]","['Markov decision process', 'online learning', 'reinforcement learning']"
16363,1512.00822,Mina Tahmasbi Arashloo,"Mina Tahmasbi Arashloo, Yaron Koral, Michael Greenberg, Jennifer
  Rexford, and David Walker",SNAP: Stateful Network-Wide Abstractions for Packet Processing,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Early programming languages for software-defined networking (SDN) were built
on top of the simple match-action paradigm offered by OpenFlow 1.0. However,
emerging hardware and software switches offer much more sophisticated support
for persistent state in the data plane, without involving a central controller.
Nevertheless, managing stateful, distributed systems efficiently and correctly
is known to be one of the most challenging programming problems. To simplify
this new SDN problem, we introduce SNAP.
  SNAP offers a simpler ""centralized"" stateful programming model, by allowing
programmers to develop programs on top of one big switch rather than many.
These programs may contain reads and writes to global, persistent arrays, and
as a result, programmers can implement a broad range of applications, from
stateful firewalls to fine-grained traffic monitoring. The SNAP compiler
relieves programmers of having to worry about how to distribute, place, and
optimize access to these stateful arrays by doing it all for them. More
specifically, the compiler discovers read/write dependencies between arrays and
translates one-big-switch programs into an efficient internal representation
based on a novel variant of binary decision diagrams. This internal
representation is used to construct a mixed-integer linear program, which
jointly optimizes the placement of state and the routing of traffic across the
underlying physical topology. We have implemented a prototype compiler and
applied it to about 20 SNAP programs over various topologies to demonstrate our
techniques' scalability.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2015 19:53:00 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Jul 2016 01:50:06 GMT'}]",2016-07-06,"[['Arashloo', 'Mina Tahmasbi', ''], ['Koral', 'Yaron', ''], ['Greenberg', 'Michael', ''], ['Rexford', 'Jennifer', ''], ['Walker', 'David', '']]","['SNAP', 'NetworkProgrammingLanguage', 'StatefulPacket Processing', 'One Big Switch', 'Software DefinedNetworks', 'Optimization']"
16364,1304.2881,"\""Omer Demirel","\""Omer Demirel and Ivo F. Sbalzarini",Balanced offline allocation of weighted balls into bins,"8 pages, 4 figures",,,,cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a sorting-based greedy algorithm called SortedGreedy[m] for
approximately solving the offline version of the d-choice weighted
balls-into-bins problem where the number of choices for each ball is equal to
the number of bins. We assume the ball weights to be non-negative. We compare
the performance of the sorting-based algorithm with a naive algorithm called
Greedy[m]. We show that by sorting the input data according to the weights we
are able to achieve an order of magnitude smaller gap (the weight difference
between the heaviest and the lightest bin) for small problems (<= 4000 balls),
and at least two orders of magnitude smaller gap for larger problems. In
practice, SortedGreedy[m] runs almost as fast as Greedy[m]. This makes
sorting-based algorithms favorable for solving offline weighted balls-into-bins
problems.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2013 09:08:34 GMT'}]",2013-04-11,"[['Demirel', 'Ömer', ''], ['Sbalzarini', 'Ivo F.', '']]","['Balls-into-bins', 'load balancing', 'offline algorithm', 'sorting']"
16365,1802.07846,Avi Ben-Cohen,"Avi Ben-Cohen, Eyal Klang, Stephen P. Raskin, Shelly Soffer, Simona
  Ben-Haim, Eli Konen, Michal Marianne Amitai and Hayit Greenspan","Cross-Modality Synthesis from CT to PET using FCN and GAN Networks for
  Improved Automated Lesion Detection","Preprint submitted to Engineering applications of artificial
  intelligence",,,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we present a novel system for generation of virtual PET images
using CT scans. We combine a fully convolutional network (FCN) with a
conditional generative adversarial network (GAN) to generate simulated PET data
from given input CT data. The synthesized PET can be used for false-positive
reduction in lesion detection solutions. Clinically, such solutions may enable
lesion detection and drug treatment evaluation in a CT-only environment, thus
reducing the need for the more expensive and radioactive PET/CT scan. Our
dataset includes 60 PET/CT scans from Sheba Medical center. We used 23 scans
for training and 37 for testing. Different schemes to achieve the synthesized
output were qualitatively compared. Quantitative evaluation was conducted using
an existing lesion detection software, combining the synthesized PET as a false
positive reduction layer for the detection of malignant lesions in the liver.
Current results look promising showing a 28% reduction in the average false
positive per case from 2.9 to 2.1. The suggested solution is comprehensive and
can be expanded to additional body organs, and different modalities.
","[{'version': 'v1', 'created': 'Wed, 21 Feb 2018 23:25:19 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Jul 2018 09:14:59 GMT'}]",2018-07-24,"[['Ben-Cohen', 'Avi', ''], ['Klang', 'Eyal', ''], ['Raskin', 'Stephen P.', ''], ['Soffer', 'Shelly', ''], ['Ben-Haim', 'Simona', ''], ['Konen', 'Eli', ''], ['Amitai', 'Michal Marianne', ''], ['Greenspan', 'Hayit', '']]","['Deep learning', 'CT', 'PET', 'GAN', 'image synthesis', 'liver lesion']"
16366,1512.01784,Azadeh Tabatabaei,"Azadeh Tabatabaei, Mohammad Ghodsi",Randomized Strategy for Walking in Streets for a Simple Robot,,,,,cs.CG cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of walking in an unknown street, for a robot that has
a minimal sensing capability. The robot is equipped with a sensor that only
detects the discontinuities in depth information (gaps) and can locate the
target point as enters in its visibility region. First, we propose an online
deterministic search strategy that generates an optimal search path for the
simple robot to reach the target t, starting from s. In contrast with
previously known research, the path is designed without memorizing any portion
of the scene has seen so far. Then, we present a randomized search strategy,
based on the deterministic strategy. We prove that the expected distance
traveled by the robot is at most a 5.33 times longer than the shortest path to
reach the target.
","[{'version': 'v1', 'created': 'Sun, 6 Dec 2015 12:39:27 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Dec 2015 06:57:56 GMT'}]",2015-12-09,"[['Tabatabaei', 'Azadeh', ''], ['Ghodsi', 'Mohammad', '']]","['Computational Geometry', 'Unknown Environment', 'StreetPolygon', 'Competitive Ratio', 'Simple Robot']"
16367,1409.4470,Mohammad Fanaei,"Mohammad Fanaei, Amin Tahmasbi-Sarvestani, Yaser P. Fallah, Gaurav
  Bansal, Matthew C. Valenti and John B. Kenney","Adaptive Content Control for Communication amongst Cooperative Automated
  Vehicles","7 Pages, 10 Figures, Sixth International Symposium on Wireless
  Vehicular Communications (WiVEC'2014)",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cooperative automated vehicles exchange information to assist each other in
creating a more precise and extended view of their surroundings, with the aim
of improving automated-driving decisions. This paper addresses the need for
scalable communication among these vehicles. To this end, a general
communication framework is proposed through which automated cars exchange
information derived from multi-resolution maps created using their local
sensing modalities. This method can extend the region visible to a car beyond
the area directly sensed by its own sensors. An adaptive, probabilistic,
distance-dependent strategy is proposed that controls the content of the
messages exchanged among vehicles based on performance measures associated with
the load on the communication channel.
","[{'version': 'v1', 'created': 'Mon, 15 Sep 2014 23:39:58 GMT'}]",2014-09-17,"[['Fanaei', 'Mohammad', ''], ['Tahmasbi-Sarvestani', 'Amin', ''], ['Fallah', 'Yaser P.', ''], ['Bansal', 'Gaurav', ''], ['Valenti', 'Matthew C.', ''], ['Kenney', 'John B.', '']]","['Automated vehicles', 'DSRC', 'multi-resolution map', 'message size', 'channel busy ratio', 'information age', 'content control']"
16368,0711.4523,Jocelyne Troccaz,"Thomas Martinelli (CHU-Grenoble radio), Jean-Luc Bosson (TIMC,
  CHU-Grenoble CIC), Luc Bressollette, Franck Pelissier, Eric Boidard (TIMC),
  Jocelyne Troccaz (TIMC), Philippe Cinquin (TIMC)","Robot-based tele-echography: clinical evaluation of the TER system in
  abdominal aortic exploration",,"Journal of ultrasound in medicine : official journal of the
  American Institute of Ultrasound in Medicine 26, 11 (2007) 1611-6",,,cs.OH,,"  OBJECTIVE: The TER system is a robot-based tele-echography system allowing
remote ultrasound examination. The specialist moves a mock-up of the ultrasound
probe at the master site, and the robot reproduces the movements of the real
probe, which sends back ultrasound images and force feedback. This tool could
be used to perform ultrasound examinations in small health care centers or from
isolated sites. The objective of this study was to prove, under real
conditions, the feasibility and reliability of the TER system in detecting
abdominal aortic and iliac aneurysms. METHODS: Fifty-eight patients were
included in 2 centers in Brest and Grenoble, France. The remote examination was
compared with the reference standard, the bedside examination, for aorta and
iliac artery diameter measurement, detection and description of aneurysms,
detection of atheromatosis, the duration of the examination, and acceptability.
RESULTS: All aneurysms (8) were detected by both techniques as intramural
thrombosis and extension to the iliac arteries. The interobserver correlation
coefficient was 0.982 (P < .0001) for aortic diameters. The rate of concordance
between 2 operators in evaluating atheromatosis was 84% +/- 11% (95% confidence
interval). CONCLUSIONS: Our study on 58 patients suggests that the TER system
could be a reliable, acceptable, and effective robot-based system for
performing remote abdominal aortic ultrasound examinations. Research is
continuing to improve the equipment for general abdominal use.
","[{'version': 'v1', 'created': 'Wed, 28 Nov 2007 15:51:02 GMT'}]",2007-11-29,"[['Martinelli', 'Thomas', '', 'CHU-Grenoble radio'], ['Bosson', 'Jean-Luc', '', 'TIMC,\n  CHU-Grenoble CIC'], ['Bressollette', 'Luc', '', 'TIMC'], ['Pelissier', 'Franck', '', 'TIMC'], ['Boidard', 'Eric', '', 'TIMC'], ['Troccaz', 'Jocelyne', '', 'TIMC'], ['Cinquin', 'Philippe', '', 'TIMC']]","['Ultrasound', 'Abdominal cavity', 'remote operations', 'aorta']"
16369,1704.02440,Glen Rodriguez Dr.Eng.,"Oscar Gavilanez, Franklin Gavilanez, Glen Rodriguez","Audit Analysis Models, Security Frameworks and Their Relevance for VoIP","12th International Conference on Cyber Warfare and Security - ICCWS
  2017, At Dayton, USA","Proceedings of the 12th International Conference on Cyber Warfare
  and Security - ICCWS 2017, pp.143-151",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Voice over IP (VoIP) is the transmission of voice and multimedia content over
Internet Protocol (IP) networks, this paper reviews models, frameworks and
auditing standards proposed to this date to manage VoIP security through a
literature review, with descriptions of both the historical and philosophical
evolution reflecting an adequate knowledge of related research. Three research
questions are raised here: RQ1. What are the requirements to be met by a model
of security audit in VoIP systems to achieve their goals? RQ2. Today, are there
additional attacks that previous works have not considered? RQ3. Which security
requirements in the VoIP systems are covered (and which are not covered) by
security frameworks? After some discussion about VoIP Protocols, Attacks on
VoIP, Information Technology (IT) audit, IT security audits, Frameworks and
auditing standards, we present a unified view of VoIP Security Requirements; as
well as considering the contributions and disadvantages of frameworks and
auditing standards toward achieving those requirements through a comparative
evaluation. It was determined that there is no security framework which
considers social engineering attacks in spite of being an important aspect to
consider in security management VoIP; also there is no specific framework that
covers all categories of security requirements for VoIP system, therefore, a
more extensive model is needed.
","[{'version': 'v1', 'created': 'Sat, 8 Apr 2017 05:05:48 GMT'}]",2017-04-11,"[['Gavilanez', 'Oscar', ''], ['Gavilanez', 'Franklin', ''], ['Rodriguez', 'Glen', '']]","['VoIP security', 'attacks on VoIP', 'IT security audit', 'IT security frameworks', 'social engineering attacks']"
16370,1301.0932,Mahyuddin K. M.  Nasution,"Sufianto Mahfudz, Mahyuddin K. M. Nasution, and Sawaluddin Nasution",Knowledge Sharing: A Model,"5 pages, a draf for ICOCSIM 2012",,,,cs.SI cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We know anything because we learn about it, there is anything we ever share
about it, but now a lot of media that can represent how it happened as
infrastructure of the knowledge sharing. This paper aims to introduce a model
for understanding a problem in knowledge sharing based on interaction.
","[{'version': 'v1', 'created': 'Sat, 5 Jan 2013 19:28:42 GMT'}]",2013-01-08,"[['Mahfudz', 'Sufianto', ''], ['Nasution', 'Mahyuddin K. M.', ''], ['Nasution', 'Sawaluddin', '']]","['Generator', 'graph theory', 'network', 'information', 'deases']"
16371,1401.1977,Bernardetta Addis,"Bernardetta Addis (INRIA Nancy - Grand Est / LORIA), Giuliana Carello
  (DEIB), Antonio Capone (DEIB), Luca G. Gianoli (DEIB), Brunilde Sans\`o",Robust Energy Management for Green and Survivable IP Networks,,,,,cs.NI cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the growing necessity to make Internet greener, it is worth pointing
out that energy-aware strategies to minimize network energy consumption must
not undermine the normal network operation. In particular, two very important
issues that may limit the application of green networking techniques concern,
respectively, network survivability, i.e. the network capability to react to
device failures, and robustness to traffic variations. We propose novel
modelling techniques to minimize the daily energy consumption of IP networks,
while explicitly guaranteeing, in addition to typical QoS requirements, both
network survivability and robustness to traffic variations. The impact of such
limitations on final network consumption is exhaustively investigated. Daily
traffic variations are modelled by dividing a single day into multiple time
intervals (multi-period problem), and network consumption is reduced by putting
to sleep idle line cards and chassis. To preserve network resiliency we
consider two different protection schemes, i.e. dedicated and shared
protection, according to which a backup path is assigned to each demand and a
certain amount of spare capacity has to be available on each link. Robustness
to traffic variations is provided by means of a specific modelling framework
that allows to tune the conservatism degree of the solutions and to take into
account load variations of different magnitude. Furthermore, we impose some
inter-period constraints necessary to guarantee network stability and preserve
the device lifetime. Both exact and heuristic methods are proposed.
Experimentations carried out with realistic networks operated with flow-based
routing protocols (i.e. MPLS) show that significant savings, up to 30%, can be
achieved also when both survivability and robustness are fully guaranteed.
","[{'version': 'v1', 'created': 'Thu, 9 Jan 2014 12:20:27 GMT'}]",2014-01-10,"[['Addis', 'Bernardetta', '', 'INRIA Nancy - Grand Est / LORIA'], ['Carello', 'Giuliana', '', 'DEIB'], ['Capone', 'Antonio', '', 'DEIB'], ['Gianoli', 'Luca G.', '', 'DEIB'], ['Sansò', 'Brunilde', '']]","['Energy-Aware', 'Traffic Engineering', 'Network resiliency', 'Robust Optimization', 'Shared protection', 'Dedicatedprotection']"
16372,1510.00759,Afshin Rahimi,"Afshin Rahimi, Moharram Eslami, Bahram Vazirnezhad",It is not all downhill from here: Syllable Contact Law in Persian,,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Syllable contact pairs crosslinguistically tend to have a falling sonority
slope a constraint which is called the Syllable Contact Law SCL In this study
the phonotactics of syllable contacts in 4202 CVCCVC words of Persian lexicon
is investigated The consonants of Persian were divided into five sonority
categories and the frequency of all possible sonority slopes is computed both
in lexicon type frequency and in corpus token frequency Since an unmarked
phonological structure has been shown to diachronically become more frequent we
expect to see the same pattern for syllable contact pairs with falling sonority
slope The correlation of sonority categories of the two consonants in a
syllable contact pair is measured using Pointwise Mutual Information
","[{'version': 'v1', 'created': 'Sat, 3 Oct 2015 00:08:18 GMT'}]",2015-10-06,"[['Rahimi', 'Afshin', ''], ['Eslami', 'Moharram', ''], ['Vazirnezhad', 'Bahram', '']]","['Sonority', 'Syllable Contact Law (SCL)', 'Gradient Lexical Frequency', 'Persian']"
16373,1005.0600,Manuel Kauers,Manuel Kauers and Veronika Pillwein,When can we decide that a P-finite sequence is positive?,,,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider two algorithms which can be used for proving positivity of
sequences that are defined by a linear recurrence equation with polynomial
coefficients (P-finite sequences). Both algorithms have in common that while
they do succeed on a great many examples, there is no guarantee for them to
terminate, and they do in fact not terminate for every input. For some
restricted classes of P-finite recurrence equations of order up to three we
provide a priori criteria that assert the termination of the algorithms.
","[{'version': 'v1', 'created': 'Tue, 4 May 2010 18:24:19 GMT'}]",2010-05-05,"[['Kauers', 'Manuel', ''], ['Pillwein', 'Veronika', '']]","['P-finite Sequences', 'Positivity', 'Cylindrical decomposition']"
16374,1407.1905,Yun Fan,"Bocong Chen, Hai Q. Dinh, Yun Fan, San Ling",Polyadic Constacyclic Codes,"We provide complete solutions on two basic questions on polyadic
  constacyclic cdes, and construct some optimal codes from the polyadic
  constacyclic cdes",,,,cs.IT math.IT math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For any given positive integer $m$, a necessary and sufficient condition for
the existence of Type I $m$-adic constacyclic codes is given. Further, for any
given integer $s$, a necessary and sufficient condition for $s$ to be a
multiplier of a Type I polyadic constacyclic code is given. As an application,
some optimal codes from Type I polyadic constacyclic codes, including
generalized Reed-Solomon codes and alternant MDS codes, are constructed.
","[{'version': 'v1', 'created': 'Mon, 7 Jul 2014 23:13:29 GMT'}]",2014-07-09,"[['Chen', 'Bocong', ''], ['Dinh', 'Hai Q.', ''], ['Fan', 'Yun', ''], ['Ling', 'San', '']]","['Polyadic constacyclic code', 'p-adic valuation', 'generalized Reed-Solomon code', 'alternant code', 'MDS code']"
16375,0903.1137,Toby Walsh,Toby Walsh,Complexity of Terminating Preference Elicitation,"7th International Joint Conference on Autonomous Agents and
  Multiagent Systems (AAMAS 2008)",AAMAS 2008: 967-974,,,cs.AI cs.CC cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Complexity theory is a useful tool to study computational issues surrounding
the elicitation of preferences, as well as the strategic manipulation of
elections aggregating together preferences of multiple agents. We study here
the complexity of determining when we can terminate eliciting preferences, and
prove that the complexity depends on the elicitation strategy. We show, for
instance, that it may be better from a computational perspective to elicit all
preferences from one agent at a time than to elicit individual preferences from
multiple agents. We also study the connection between the strategic
manipulation of an election and preference elicitation. We show that what we
can manipulate affects the computational complexity of manipulation. In
particular, we prove that there are voting rules which are easy to manipulate
if we can change all of an agent's vote, but computationally intractable if we
can change only some of their preferences. This suggests that, as with
preference elicitation, a fine-grained view of manipulation may be informative.
Finally, we study the connection between predicting the winner of an election
and preference elicitation. Based on this connection, we identify a voting rule
where it is computationally difficult to decide the probability of a candidate
winning given a probability distribution over the votes.
","[{'version': 'v1', 'created': 'Fri, 6 Mar 2009 01:14:44 GMT'}]",2012-04-18,"[['Walsh', 'Toby', '']]","['Preferences', 'elicitation', 'complexity']"
16376,1710.05419,Gabor Soter,"Gabor Soter, Andrew Conn, Helmut Hauser and Jonathan Rossiter","Bodily aware soft robots: integration of proprioceptive and
  exteroceptive sensors",,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Being aware of our body has great importance in our everyday life. This is
the reason why we know how to move in a dark room or to grasp a complex object.
These skills are important for robots as well, however, robotic bodily
awareness is still an unsolved problem. In this paper we present a novel method
to implement bodily awareness in soft robots by the integration of
exteroceptive and proprioceptive sensors. We use a combination of a stacked
convolutional autoencoder and a recurrent neural network to map internal
sensory signals to visual information. As a result, the simulated soft robot
can learn to \textit{imagine} its motion even when its visual sensor is not
available.
","[{'version': 'v1', 'created': 'Sun, 15 Oct 2017 23:28:45 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Nov 2017 21:47:14 GMT'}]",2017-11-10,"[['Soter', 'Gabor', ''], ['Conn', 'Andrew', ''], ['Hauser', 'Helmut', ''], ['Rossiter', 'Jonathan', '']]","['soft robots', 'bodily awareness', 'proprioception']"
16377,1506.09019,Jaderick Pabico,Jaderick P. Pabico,Artificial Catalytic Reactions in 2D for Combinatorial Optimization,"8 pages, 2 figures, In H.N. Adorna (ed.) Proceedings of the 3rd
  Symposium on Mathematical Aspects of Computer Science (SMACS 2006), Adventist
  University of the Philippines, Silang, Cavite, Philippines, 19-20 October
  2006 (Published by the Computing Society of the Philippines)",,,,cs.ET cs.NE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Presented in this paper is a derivation of a 2D catalytic reaction-based
model to solve combinatorial optimization problems (COPs). The simulated
catalytic reactions, a computational metaphor, occurs in an artificial chemical
reactor that finds near-optimal solutions to COPs. The artificial environment
is governed by catalytic reactions that can alter the structure of artificial
molecular elements. Altering the molecular structure means finding new
solutions to the COP. The molecular mass of the elements was considered as a
measure of goodness of fit of the solutions. Several data structures and
matrices were used to record the directions and locations of the molecules.
These provided the model the 2D topology. The Traveling Salesperson Problem
(TSP) was used as a working example. The performance of the model in finding a
solution for the TSP was compared to the performance of a topology-less model.
Experimental results show that the 2D model performs better than the
topology-less one.
","[{'version': 'v1', 'created': 'Tue, 30 Jun 2015 10:16:20 GMT'}]",2015-07-01,"[['Pabico', 'Jaderick P.', '']]","['Artificial chemical reactor', 'simulated catalytic reactions', 'combinatorial optimization']"
16378,1603.03535,Mohammad Abdollahi Azgomi,Elaheh Ghassabani and Mohammad Abdollahi Azgomi,A New Approach to Stateless Model Checking of LTL Properties,,"Trustworthy Computing Laboratory, School of Computer Engineering,
  Iran University of Science and Technology, Tehran, Iran, 2014",,Technical Report No. TWcL-TR-1402,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Verification of large and complicated concurrent programs is an important
issue in the software world. Stateless model checking is an appropriate method
for systematically and automatically testing of large programs, which has
proved its power in verifying code of large programs. Another well-known method
in this area is runtime verification. Both stateless model checking and runtime
verification are similar in some ways. One common approach in runtime
verification is to construct runtime monitors for properties expressed in
linear temporal logic. Currently, there are some semantics to check linear
temporal logic formulae on finite paths proposed in the field of runtime
verification, which can also be applied to stateless model checking. However,
existing stateless model checkers do not support LTL formulae. In some
settings, it is more advantageous to make use of stateless model checking
instead of runtime verification. This paper proposes a novel encoding of one of
the recent LTL semantics on finite paths into an actor-based system. We take a
truly parallel approach without saving any program states or traces, which not
only addresses important problems in runtime verification, but can also be
applied to stateless model checking.
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2016 06:37:28 GMT'}]",2016-03-14,"[['Ghassabani', 'Elaheh', ''], ['Azgomi', 'Mohammad Abdollahi', '']]","['Runtime verification', 'stateless model checking', 'linear temporal logic (LTL)', 'Actor model']"
16379,1106.1113,Alejandro Chinea Manrique De Lara,"Alejandro Chinea, Elka Korutcheva",Complexity Analysis of Vario-eta through Structure,"13 pages, 2 figures, 14th International Workshop, IWCIA 2011, Madrid,
  Spain, May 2011; Advances in Image Analysis and Applications, Research
  Publishing Services 2011 ISBN 978-981-08-7923-5",,,,cs.LG cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph-based representations of images have recently acquired an important
role for classification purposes within the context of machine learning
approaches. The underlying idea is to consider that relevant information of an
image is implicitly encoded into the relationships between more basic entities
that compose by themselves the whole image. The classification problem is then
reformulated in terms of an optimization problem usually solved by a
gradient-based search procedure. Vario-eta through structure is an approximate
second order stochastic optimization technique that achieves a good trade-off
between speed of convergence and the computational effort required. However,
the robustness of this technique for large scale problems has not been yet
assessed. In this paper we firstly provide a theoretical justification of the
assumptions made by this optimization procedure. Secondly, a complexity
analysis of the algorithm is performed to prove its suitability for large scale
learning problems.
","[{'version': 'v1', 'created': 'Mon, 6 Jun 2011 16:25:58 GMT'}]",2011-06-07,"[['Chinea', 'Alejandro', ''], ['Korutcheva', 'Elka', '']]","['image analysis', 'machine learning', 'analytic combinatorics']"
16380,1412.8281,Lanbo Zhang,Lanbo Zhang,Interactive Retrieval Based on Wikipedia Concepts,,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new user feedback mechanism based on Wikipedia concepts
for interactive retrieval. In this mechanism, the system presents to the user a
group of Wikipedia concepts, and the user can choose those relevant to refine
his/her query. To realize this mechanism, we propose methods to address two
problems: 1) how to select a small number of possibly relevant Wikipedia
concepts to show the user, and 2) how to re-rank retrieved documents given the
user-identified Wikipedia concepts. Our methods are evaluated on three TREC
data sets. The experiment results show that our methods can dramatically
improve retrieval performances.
","[{'version': 'v1', 'created': 'Mon, 29 Dec 2014 08:45:59 GMT'}]",2014-12-30,"[['Zhang', 'Lanbo', '']]","['Wikipedia Concepts', 'Interactive Retrieval', 'Relevance Feedback', 'Query Expansion']"
16381,1008.4365,Joris Kinable,"Joris Kinable, Orestis Kostakis",Malware Classification based on Call Graph Clustering,"This research has been supported by TEKES - the Finnish Funding
  Agency for Technology and Innovation as part of its ICT SHOK Future Internet
  research programme, grant 40212/09",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Each day, anti-virus companies receive tens of thousands samples of
potentially harmful executables. Many of the malicious samples are variations
of previously encountered malware, created by their authors to evade
pattern-based detection. Dealing with these large amounts of data requires
robust, automatic detection approaches. This paper studies malware
classification based on call graph clustering. By representing malware samples
as call graphs, it is possible to abstract certain variations away, and enable
the detection of structural similarities between samples. The ability to
cluster similar samples together will make more generic detection techniques
possible, thereby targeting the commonalities of the samples within a cluster.
To compare call graphs mutually, we compute pairwise graph similarity scores
via graph matchings which approximately minimize the graph edit distance. Next,
to facilitate the discovery of similar malware samples, we employ several
clustering algorithms, including k-medoids and DBSCAN. Clustering experiments
are conducted on a collection of real malware samples, and the results are
evaluated against manual classifications provided by human malware analysts.
Experiments show that it is indeed possible to accurately detect malware
families via call graph clustering. We anticipate that in the future, call
graphs can be used to analyse the emergence of new malware families, and
ultimately to automate implementation of generic detection schemes.
","[{'version': 'v1', 'created': 'Wed, 25 Aug 2010 20:04:58 GMT'}]",2010-08-27,"[['Kinable', 'Joris', ''], ['Kostakis', 'Orestis', '']]","['Call Graph', 'Clustering', 'DBSCAN', 'Graph Edit Distance', 'Graph Matching', 'k-medoidsClustering', 'Vertex Matching']"
16382,1610.00460,Li Guo,Li Guo,"Quantified-Self 2.0: Using Context-Aware Services for Promoting Gradual
  Behaviour Change",18 pages,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The recent development of smartphone and wearable sensor technologies enable
general public to carry self-tracking tasks more easily. Much work has been
devoted to life data collection and visualisation to help people with better
self-understanding. We believe that although (awareness/knowledge discovery is
an important aspect of personal informatics, knowledge maintenance is more, or
at least equally, important. In this paper, we propose a proactive approach
that uses the knowledge mined from people's activity data to nudge them towards
a good lifestyle (better knowledge maintenance). For demonstration purpose, a
trial study was designed and implemented for good sleep maintenance. In the
study, we first use smartphones as activity trackers to collect various
features in a non-intrusive manner. We then use those data to learn users'
activity patterns, including daily step amount, app usages, bedding time,
wake-up time and sleep duration. Subsequently, we analyse correlations that may
have the positive or negative impact on users' sleep qualities and finally we
designed and implemented three proactive services that are able to generate
customised advice in the ""right"" context to nudge users towards a better
lifestyle. The experiments results are positive showing that with the use of
the proposed services 1. daily step amount have been increased by 3.03% on
average in a 10 days study and 2. sleep durations are increased by 7% for two
subjects.
","[{'version': 'v1', 'created': 'Mon, 3 Oct 2016 09:38:20 GMT'}]",2016-10-04,"[['Guo', 'Li', '']]","['Personal Informatics', 'Quantified-self', 'Sleep Detection', 'Activity Learning', 'Data Mining']"
16383,1407.2565,Emanuele Natale,"L. Becchetti, A. Clementi, E. Natale, F. Pasquale, R. Silvestri",Plurality Consensus in the Gossip Model,Corrected typos,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study Plurality Consensus in the Gossip Model over a network of $n$
anonymous agents. Each agent supports an initial opinion or color. We assume
that at the onset, the number of agents supporting the plurality color exceeds
that of the agents supporting any other color by a sufficiently-large bias. The
goal is to provide a protocol that, with high probability, brings the system
into the configuration in which all agents support the (initial) plurality
color. We consider the Undecided-State Dynamics, a well-known protocol which
uses just one more state (the undecided one) than those necessary to store
colors. We show that the speed of convergence of this protocol depends on the
initial color configuration as a whole, not just on the gap between the
plurality and the second largest color community. This dependence is best
captured by a novel notion we introduce, namely, the monochromatic distance
${md}(\bar{\mathbf{c}})$ which measures the distance of the initial color
configuration $\bar{ \mathbf {c}}$ from the closest monochromatic one. In the
complete graph, we prove that, for a wide range of the input parameters, this
dynamics converges within $O({md}(\bar {\mathbf {c}}) \log {n})$ rounds. We
prove that this upper bound is almost tight in the strong sense: Starting from
any color configuration $\bar {\mathbf {c}}$, the convergence time is
$\Omega({md}(\bar {\mathbf {c}}))$. Finally, we adapt the Undecided-State
Dynamics to obtain a fast, random walk-based protocol for plurality consensus
on regular expanders. This protocol converges in $O({md}(\bar {\mathbf {c}})
\mathrm{polylog}(n))$ rounds using only $\mathrm{polylog}(n)$ local memory. A
key-ingredient to achieve the above bounds is a new analysis of the maximum
node congestion that results from performing $n$ parallel random walks on
regular expanders. All our bounds hold with high probability.
","[{'version': 'v1', 'created': 'Wed, 9 Jul 2014 17:13:35 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Jul 2014 10:25:04 GMT'}]",2014-07-11,"[['Becchetti', 'L.', ''], ['Clementi', 'A.', ''], ['Natale', 'E.', ''], ['Pasquale', 'F.', ''], ['Silvestri', 'R.', '']]","['Gossip Algorithms', 'Plurality Consensus', 'Markov Chains', 'Random Walks']"
16384,1203.1981,Sanjoy Das mr,"Sanjoy Das, D .K. Lobiyal","Analysis of neighbour and isolated node of intersection area based
  geocasting protocol (IBGP) in VANET",,"International Journal of Wireless & Mobile Networks (IJWMN) Vol.
  4, No. 1, February 2012",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Geocasting is a special variant of multicasting, where data packet or message
is transmitted to a predefined geographical location i.e., known as geocast
region. The applications of geocasting in VANET are to disseminate information
like, collision warning, advertising, alerts message, etc. In this paper, we
have proposed a model for highway scenario where the highway is divided into
number of cells. The intersection area between two successive cells is computed
to find the number of common nodes. Therefore, probabilistic analysis of the
nodes present and void occurrence in the intersection area is carried out.
Further, we have defined different forwarding zones to restrict the number of
participated nodes for data delivery. Number of nodes present and void
occurrence in the different forwarding zones have also been analysed based on
various node density in the network to determine the successful delivery of
data. Our analytical results show that in a densely populated network, data can
be transmitted with low radio transmission range. In a densely populated
network smaller forwarding zones will be selected for data delivery.
","[{'version': 'v1', 'created': 'Fri, 9 Mar 2012 03:24:02 GMT'}]",2012-03-12,"[['Das', 'Sanjoy', ''], ['Lobiyal', 'D . K.', '']]","['VANET', 'Geocast', 'Cell', 'Forwarding Zone', 'Intersection Area', 'Void']"
16385,1609.03892,Xin Liu,"Xin Liu, and Meina Kan, and Wanglong Wu, and Shiguang Shan, and Xilin
  Chen",VIPLFaceNet: An Open Source Deep Face Recognition SDK,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robust face representation is imperative to highly accurate face recognition.
In this work, we propose an open source face recognition method with deep
representation named as VIPLFaceNet, which is a 10-layer deep convolutional
neural network with 7 convolutional layers and 3 fully-connected layers.
Compared with the well-known AlexNet, our VIPLFaceNet takes only 20% training
time and 60% testing time, but achieves 40\% drop in error rate on the
real-world face recognition benchmark LFW. Our VIPLFaceNet achieves 98.60% mean
accuracy on LFW using one single network. An open-source C++ SDK based on
VIPLFaceNet is released under BSD license. The SDK takes about 150ms to process
one face image in a single thread on an i7 desktop CPU. VIPLFaceNet provides a
state-of-the-art start point for both academic and industrial face recognition
applications.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2016 15:13:55 GMT'}]",2016-09-14,"[['Liu', 'Xin', ''], ['Kan', 'Meina', ''], ['Wu', 'Wanglong', ''], ['Shan', 'Shiguang', ''], ['Chen', 'Xilin', '']]","['DeepLearning', 'FaceRecognition', 'OpenSource', 'VIPLFaceNet']"
16386,1304.4927,Yun Fan,Yun Fan and Hongwei Liu,"Homogeneous Weights and M\""obius Functions on Finite Rings","This paper has been published in a Chinese journal, see below; here
  is the English version","Y. Fan and H. Liu, Homogeneous weights of finite rings and
  M\""obius functions(Chinese), Math. Ann.(Chinese), 31A (2010), 355-364",,,cs.IT math.IT math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The homogeneous weights and the M\""obius functions and Euler phi-functions on
finite rings are discussed; some computational formulas for these functions on
finite principal ideal rings are characterized; for the residue rings of
integers, they are reduced to the classical number-theoretical M\""obius
functions and the classical number-theoretical Euler phi-functions.
","[{'version': 'v1', 'created': 'Wed, 17 Apr 2013 19:38:28 GMT'}]",2013-04-18,"[['Fan', 'Yun', ''], ['Liu', 'Hongwei', '']]","['Finite ring', 'finite principal ideal ring', 'homogeneous weight', 'M¨obius function', 'Euler phi-function']"
16387,1111.4121,Herv\'e Zwirn,Herve Zwirn and Jean-Paul Delahaye,Unpredictability and Computational Irreducibility,"20 pages, 5 figures",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore several concepts for analyzing the intuitive notion of
computational irreducibility and we propose a robust formal definition, first
in the field of cellular automata and then in the general field of any
computable function f from N to N. We prove that, through a robust definition
of what means ""to be unable to compute the nth step without having to follow
the same path than simulating the automaton or the function"", this implies
genuinely, as intuitively expected, that if the behavior of an object is
computationally irreducible, no computation of its nth state can be faster than
the simulation itself.
","[{'version': 'v1', 'created': 'Thu, 17 Nov 2011 15:01:44 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Feb 2012 21:14:06 GMT'}]",2012-02-06,"[['Zwirn', 'Herve', ''], ['Delahaye', 'Jean-Paul', '']]","['Complexity', 'logical depth', 'cellular automata', 'irreducibility', 'computation']"
16388,1511.04952,Dimitrios Thilikos,"Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos",Planar Disjoint-Paths Completion,,,,,cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  introduce {\sc Planar Disjoint Paths Completion}, a completion counterpart of
the Disjoint Paths problem, and study its parameterized complexity. The problem
can be stated as follows: given a, not necessarily connected, plane graph $G,$
$k$ pairs of terminals, and a face $F$ of $G,$ find a minimum-size set of
edges, if one exists, to be added inside $F$ so that the embedding remains
planar and the pairs become connected by $k$ disjoint paths in the augmented
network. Our results are twofold: first, we give an upper bound on the number
of necessary additional edges when a solution exists. This bound is a function
of $k$, independent of the size of $G.$ Second, we show that the problem is
fixed-parameter tractable, in particular, it can be solved in time $f(k)\cdot
n^{2}.$
","[{'version': 'v1', 'created': 'Mon, 16 Nov 2015 13:36:39 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Nov 2015 13:00:00 GMT'}]",2015-11-18,"[['Adler', 'Isolde', ''], ['Kolliopoulos', 'Stavros G.', ''], ['Thilikos', 'Dimitrios M.', '']]","['Completion Problems', 'Disjoint Paths', 'Planar Graphs']"
16389,1512.01812,Ljubisa Stankovic,"Ljubisa Stankovic, Isidora Stankovic","Reconstruction of Sparse and Nonsparse Signals from a Reduced Set of
  Samples","23 pages, 5 figures, ETF Journal of Electrical Engineering, vol.21,
  no.1, Dec. 2015",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Signals sparse in a transformation domain can be recovered from a reduced set
of randomly positioned samples by using compressive sensing algorithms. Simple
re- construction algorithms are presented in the first part of the paper. The
missing samples manifest themselves as a noise in this reconstruction. Once the
reconstruction conditions for a sparse signal are met and the reconstruction is
achieved, the noise due to missing samples does not influence the results in a
direct way. It influences the possibility to recover a signal only. Additive
input noise will remain in the resulting reconstructed signal. The accuracy of
the recovery results is related to the additive input noise. Simple derivation
of this relation is presented. If a reconstruction algorithm for a sparse
signal is used in the reconstruction of a nonsparse signal then the noise due
to missing samples will remain and behave as an additive input noise. An exact
relation for the mean square error of this error is derived for the partial DFT
matrix case in this paper and presented in form of a theorem. It takes into
account very important fact that if all samples are available then the error
will be zero, for both sparse and nonsparse recovered signals. Theory is
illustrated and checked on statistical examples.
","[{'version': 'v1', 'created': 'Sun, 6 Dec 2015 18:02:37 GMT'}]",2015-12-08,"[['Stankovic', 'Ljubisa', ''], ['Stankovic', 'Isidora', '']]","['Sparse signals', 'Compressive sensing', 'DFT', 'Noise']"
16390,1206.3667,Sudhir Ahuja,"Sudhir Ahuja, Mr. Rinkaj Goyal",Information Retrieval in Intelligent Systems: Current Scenario & Issues,,,,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web space is the huge repository of data. Everyday lots of new information
get added to this web space. The more the information, more is demand for tools
to access that information. Answering users' queries about the online
information intelligently is one of the great challenges in information
retrieval in intelligent systems. In this paper, we will start with the brief
introduction on information retrieval and intelligent systems and explain how
swoogle, the semantic search engine, uses its algorithms and techniques to
search for the desired contents in the web. We then continue with the
clustering technique that is used to group the similar things together and
discuss the machine learning technique called Self-organizing maps [6] or SOM,
which is a data visualization technique that reduces the dimensions of data
through the use of self-organizing neural networks. We then discuss how SOM is
used to visualize the contents of the data, by following some lines of
algorithm, in the form of maps. So, we could say that websites or machines can
be used to retrieve the information that what exactly users want from them.
","[{'version': 'v1', 'created': 'Sat, 16 Jun 2012 13:46:33 GMT'}]",2012-06-19,"[['Ahuja', 'Sudhir', ''], ['Goyal', 'Mr. Rinkaj', '']]","['SOM', 'SWOOGLE', 'self-organizing maps', 'Intelligent Information Retrieval', 'clustering']"
16391,1011.0192,Gerard Briscoe Dr,Mark McLaughlin and Gerard Briscoe and Paul Malone,"Digital Identity in The Absence of Authorities: A New Socio-Technical
  Approach","19 pages, 8 figures",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  On the Internet large service providers tend to control the digital
identities of users. These defacto identity authorities wield significant power
over users, compelling them to comply with non-negotiable terms, before access
to services is granted. In doing so, users expose themselves to privacy risks,
manipulation and exploitation via direct marketing. Against this backdrop, the
emerging areas of Digital Ecosystems and user-centric identity emphasise
decentralised environments with independent self-determining entities that
control their own data and identity. We show that recent advances in
user-centric identity, federated identity and trust have prepared the ground
for decentralised identity provisioning. We show how social trust, rather than
blind deference to authorities, can provide a basis for identity, where risks
can be weighed and compared rather than merely accepted. Fundamentally, we are
considering the move from authority-centric centralised identity provisioning
to user-centric distributed identity provisioning. Finally, we highlight the
potential impacts of distributed identity provisioning in the Information
Society and give a brief roadmap for its general implementation and adoption.
","[{'version': 'v1', 'created': 'Sun, 31 Oct 2010 18:56:58 GMT'}]",2010-11-02,"[['McLaughlin', 'Mark', ''], ['Briscoe', 'Gerard', ''], ['Malone', 'Paul', '']]","['digital identity', 'user-centric', 'federated identity', 'trust', 'decentralised']"
16392,0803.0450,Debprakash Patnaik,"Debprakash Patnaik (Electical Engg. Dept., Indian Institute of
  Science, Bangalore), and P. S. Sastry (Electrical Engg. Dept., Indian
  Institute of Science, Bangalore), and K. P. Unnikrishnan (General Motors R&D,
  Warren)","Inferring Neuronal Network Connectivity from Spike Data: A Temporal
  Datamining Approach",,,,,cs.DB q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding the functioning of a neural system in terms of its underlying
circuitry is an important problem in neuroscience. Recent developments in
electrophysiology and imaging allow one to simultaneously record activities of
hundreds of neurons. Inferring the underlying neuronal connectivity patterns
from such multi-neuronal spike train data streams is a challenging statistical
and computational problem. This task involves finding significant temporal
patterns from vast amounts of symbolic time series data. In this paper we show
that the frequent episode mining methods from the field of temporal data mining
can be very useful in this context. In the frequent episode discovery
framework, the data is viewed as a sequence of events, each of which is
characterized by an event type and its time of occurrence and episodes are
certain types of temporal patterns in such data. Here we show that, using the
set of discovered frequent episodes from multi-neuronal data, one can infer
different types of connectivity patterns in the neural system that generated
it. For this purpose, we introduce the notion of mining for frequent episodes
under certain temporal constraints; the structure of these temporal constraints
is motivated by the application. We present algorithms for discovering serial
and parallel episodes under these temporal constraints. Through extensive
simulation studies we demonstrate that these methods are useful for unearthing
patterns of neuronal network connectivity.
","[{'version': 'v1', 'created': 'Tue, 4 Mar 2008 14:11:38 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Mar 2008 02:24:13 GMT'}]",2008-03-11,"[['Patnaik', 'Debprakash', '', 'Electical Engg. Dept., Indian Institute of\n  Science, Bangalore'], ['Sastry', 'P. S.', '', 'Electrical Engg. Dept., Indian\n  Institute of Science, Bangalore'], ['Unnikrishnan', 'K. P.', '', 'General Motors R&D,\n  Warren']]","['Spike data Analysis', 'Temporal data mining', 'frequent episodes', 'temporal constraints', 'neuronalconnectivity patterns', 'synfire chains']"
16393,1705.07490,Rami Puzis,"Ori Ossmy, Ofir Tam, Rami Puzis, Lior Rokach, Ohad Inbar, Yuval
  Elovici",MindDesktop: a general purpose brain computer interface,,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advances in electroencephalography (EEG) and electromyography (EMG)
enable communication for people with severe disabilities. In this paper we
present a system that enables the use of regular computers using an
off-the-shelf EEG/EMG headset, providing a pointing device and virtual keyboard
that can be used to operate any Windows based system, minimizing the user
effort required for interacting with a personal computer. Effectiveness of the
proposed system is evaluated by a usability study, indicating decreasing
learning curve for completing various tasks. The proposed system is available
in the link provided.
","[{'version': 'v1', 'created': 'Sun, 21 May 2017 19:08:09 GMT'}]",2017-05-23,"[['Ossmy', 'Ori', ''], ['Tam', 'Ofir', ''], ['Puzis', 'Rami', ''], ['Rokach', 'Lior', ''], ['Inbar', 'Ohad', ''], ['Elovici', 'Yuval', '']]","['BCI', 'EEG', 'facial', 'pointing device', 'virtual keyboard']"
16394,1109.3317,Ayatullah Faruk Mollah,"Ayatullah Faruk Mollah, Nabamita Majumder, Subhadip Basu, Mita
  Nasipuri","Design of an Optical Character Recognition System for Camera-based
  Handheld Devices",,"Int'l J. of Computer Science Issues, Vol. 8, Issue 4, pp. 283-289,
  July 2011",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a complete Optical Character Recognition (OCR) system for
camera captured image/graphics embedded textual documents for handheld devices.
At first, text regions are extracted and skew corrected. Then, these regions
are binarized and segmented into lines and characters. Characters are passed
into the recognition module. Experimenting with a set of 100 business card
images, captured by cell phone camera, we have achieved a maximum recognition
accuracy of 92.74%. Compared to Tesseract, an open source desktop-based
powerful OCR engine, present recognition accuracy is worth contributing.
Moreover, the developed technique is computationally efficient and consumes low
memory so as to be applicable on handheld devices.
","[{'version': 'v1', 'created': 'Thu, 15 Sep 2011 11:24:41 GMT'}]",2011-09-16,"[['Mollah', 'Ayatullah Faruk', ''], ['Majumder', 'Nabamita', ''], ['Basu', 'Subhadip', ''], ['Nasipuri', 'Mita', '']]","['Character Recognition System', 'Camera Captured Document Images', 'Handheld Device', 'Image Segmentation']"
16395,1008.1628,Pui King Wong,"Pui King Wong, Dongjie Yin, and Tony T. Lee","Performance Analysis of Markov Modulated 1-Persistent CSMA/CA Protocols
  with Exponential Backoff Scheduling",24 pages including 11 figures,,,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a Markovian model of 1-persistent CSMA/CA protocols with
K-Exponential Backoff scheduling algorithms. The input buffer of each access
node is modeled as a Geo/G/1 queue, and the service time distribution of each
individual head-of-line packet is derived from the Markov chain of the
underlying scheduling algorithm. From the queuing model, we derive the
characteristic equation of network throughput and obtain the stable throughput
and bounded delay regions with respect to the retransmission factor. Our
results show that the stable throughput region of the exponential backoff
scheme exists even for an infinite population. Moreover, we find that the
bounded delay region of exponential backoff is only a sub-set of its stable
throughput region due to the large variance of the service time of input
packets caused by the capture effect. All analytical results presented in this
paper are verified by simulations.
","[{'version': 'v1', 'created': 'Tue, 10 Aug 2010 04:15:04 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Aug 2010 08:10:35 GMT'}, {'version': 'v3', 'created': 'Mon, 7 Mar 2011 08:01:56 GMT'}, {'version': 'v4', 'created': 'Tue, 8 Mar 2011 03:50:39 GMT'}]",2011-03-09,"[['Wong', 'Pui King', ''], ['Yin', 'Dongjie', ''], ['Lee', 'Tony T.', '']]","['queuing analysis', 'performance analysis', '1-persistent CSMA', 'Exponential Backoff']"
16396,1504.07041,Georgiana Caltais,Georgiana Caltais and Bertrand Meyer,On the Verification of SCOOP Programs,arXiv admin note: substantial text overlap with arXiv:1409.7509,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we focus on the development of a toolbox for the verification
of programs in the context of SCOOP -- an elegant concurrency model, recently
formalized based on Rewriting Logic (RL) and Maude. SCOOP is implemented in
Eiffel and its applicability is demonstrated also from a practical perspective,
in the area of robotics programming. Our contribution consists in devising and
integrating an alias analyzer and a Coffman deadlock detector under the roof of
the same RL-based semantic framework of SCOOP. This enables using the Maude
rewriting engine and its LTL model-checker ""for free"", in order to perform the
analyses of interest. We discuss the limitations of our approach for
model-checking deadlocks and provide solutions to the state explosion problem.
The latter is mainly caused by the size of the SCOOP formalization which
incorporates all the aspects of a real concurrency model. On the aliasing side,
we propose an extension of a previously introduced alias calculus based on
program expressions, to the setting of unbounded program executions such as
infinite loops and recursive calls. Moreover, we devise a corresponding
executable specification easily implementable on top of the SCOOP
formalization. An important property of our extension is that, in
non-concurrent settings, the corresponding alias expressions can be
over-approximated in terms of a notion of regular expressions. This further
enables us to derive an algorithm that always stops and provides a sound
over-approximation of the ""may aliasing"" information, where soundness stands
for the lack of false negatives.
","[{'version': 'v1', 'created': 'Mon, 27 Apr 2015 12:01:43 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Apr 2015 11:47:16 GMT'}, {'version': 'v3', 'created': 'Thu, 30 Apr 2015 09:38:41 GMT'}]",2015-05-01,"[['Caltais', 'Georgiana', ''], ['Meyer', 'Bertrand', '']]","['concurrency', 'SCOOP', 'operational semantics', 'alias analysis', 'deadlock detection', 'Maude', 'rewriting logic']"
16397,0906.0667,Harald Kosch,"Florian Niedermeier, Michael Niedermeier, and Harald Kosch",Quality assessment of the MPEG-4 scalable video CODEC,,published in a shorter version at ICIAP 2009 Conference,,,cs.MM cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the performance of the emerging MPEG-4 SVC CODEC is evaluated.
In the first part, a brief introduction on the subject of quality assessment
and the development of the MPEG-4 SVC CODEC is given. After that, the used test
methodologies are described in detail, followed by an explanation of the actual
test scenarios. The main part of this work concentrates on the performance
analysis of the MPEG-4 SVC CODEC - both objective and subjective.
","[{'version': 'v1', 'created': 'Wed, 3 Jun 2009 09:31:34 GMT'}]",2009-06-04,"[['Niedermeier', 'Florian', ''], ['Niedermeier', 'Michael', ''], ['Kosch', 'Harald', '']]","['MPEG-4 SVC', 'quality evaluation', 'scalability']"
16398,1501.00526,Selvarajah Thuseethan Mr.,S.Thuseethan,Department Management System for Departments of Sri Lankan Universities,,"International Journal Of Scientific & Technology Research, 3(6),
  173-175 (2014)",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a new method of data handling as well as implementation
of management system for an academic department. Management system is a proven
framework for managing and continually improving the organizations policies,
procedures and processes. Department of Sri Lankan Universities is a division
within a faculty comprising one subject area or a number of related subject
areas. The time consumption and error rate of producing information is
extremely high. This paper describes how to do the data handling in a
department of Sri Lankan Universities using the management system. The
efficiency of the management system measured with the amount of data handled by
the department. Experiment results shows that this method of data handling
increase the efficiency of the department in terms of processing information
and the reduction of risks involved with the department activities.
","[{'version': 'v1', 'created': 'Sat, 3 Jan 2015 04:00:42 GMT'}]",2015-01-06,"[['Thuseethan', 'S.', '']]","['Management system', 'Department', 'Data handling']"
16399,1205.6114,Anil Aswani,"Anil Aswani, Neal Master, Jay Taneja, Andrew Krioukov, David Culler,
  Claire Tomlin",Quantitative Methods for Comparing Different HVAC Control Schemes,,,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Experimentally comparing the energy usage and comfort characteristics of
different controllers in heating, ventilation, and air-conditioning (HVAC)
systems is difficult because variations in weather and occupancy conditions
preclude the possibility of establishing equivalent experimental conditions
across the order of hours, days, and weeks. This paper is concerned with
defining quantitative metrics of energy usage and occupant comfort, which can
be computed and compared in a rigorous manner that is capable of determining
whether differences between controllers are statistically significant in the
presence of such environmental fluctuations. Experimental case studies are
presented that compare two alternative controllers (a schedule controller and a
hybrid system learning-based model predictive controller) to the default
controller in a building-wide HVAC system. Lastly, we discuss how our proposed
methodology may also be able to quantify the efficiency of other building
automation systems.
","[{'version': 'v1', 'created': 'Wed, 25 Apr 2012 19:34:28 GMT'}]",2012-05-29,"[['Aswani', 'Anil', ''], ['Master', 'Neal', ''], ['Taneja', 'Jay', ''], ['Krioukov', 'Andrew', ''], ['Culler', 'David', ''], ['Tomlin', 'Claire', '']]","['HVAC', 'energy-efficiency', 'comfort', 'metrics', 'control']"
16400,1312.2585,Nurassyl Kerimbayev,"Kerimbayev Nurassyl, Akramova Aliya, Suleimenova Jarkynbike","E-learning for ungraded schools of Kazakhstan: experience,
  implementation, and innovation","6 pages, 2 figure",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The modernization of the educational process in the ungraded schools of the
Republic of Kazakhstan requires the provision of affordable quality education
for students in rural areas on information technology, the creation of
e-learning. It was important to consider two points: how does e-learning
influence the educational process in ungraded schools, and directly on the
quality of teaching, and what results can thus be achieved. The significance of
the work is also to explore innovative approaches to e-learning system of
ungraded schools.
","[{'version': 'v1', 'created': 'Mon, 9 Dec 2013 20:29:24 GMT'}]",2013-12-11,"[['Nurassyl', 'Kerimbayev', ''], ['Aliya', 'Akramova', ''], ['Jarkynbike', 'Suleimenova', '']]","['ungraded schools', 'information and communication technologies', 'virtual learning', 'multimedia educational products (digital resources)']"
16401,1002.1148,Vishal Goyal,"Salem Saleh Al-amri, N. V. Kalyankar, S.D. Khamitkar",A Comparative Study of Removal Noise from Remote Sensing Image,"International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 1, January 2010,
  http://ijcsi.org/articles/A-Comparative-Study-of-Removal-Noise-from-Remote-Sensing-Image.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 1, January 2010,
  http://ijcsi.org/articles/A-Comparative-Study-of-Removal-Noise-from-Remote-Sensing-Image.php",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper attempts to undertake the study of three types of noise such as
Salt and Pepper (SPN), Random variation Impulse Noise (RVIN), Speckle (SPKN).
Different noise densities have been removed between 10% to 60% by using five
types of filters as Mean Filter (MF), Adaptive Wiener Filter (AWF), Gaussian
Filter (GF), Standard Median Filter (SMF) and Adaptive Median Filter (AMF). The
same is applied to the Saturn remote sensing image and they are compared with
one another. The comparative study is conducted with the help of Mean Square
Errors (MSE) and Peak-Signal to Noise Ratio (PSNR). So as to choose the base
method for removal of noise from remote sensing image.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 08:34:39 GMT'}]",2010-02-08,"[['Al-amri', 'Salem Saleh', ''], ['Kalyankar', 'N. V.', ''], ['Khamitkar', 'S. D.', '']]","['Remote sensing image', 'Image noise', 'filters']"
16402,1407.1933,Adam Saulwick,Adam Saulwick,Lexpresso: a Controlled Natural Language,"12 pages, 2 figures, 4th Workshop on Controlled Natural Language 2014",,,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an overview of `Lexpresso', a Controlled Natural Language
developed at the Defence Science & Technology Organisation as a bidirectional
natural language interface to a high-level information fusion system. The paper
describes Lexpresso's main features including lexical coverage, expressiveness
and range of linguistic syntactic and semantic structures. It also touches on
its tight integration with a formal semantic formalism and tentatively
classifies it against the PENS system.
","[{'version': 'v1', 'created': 'Tue, 8 Jul 2014 02:53:29 GMT'}]",2014-07-09,"[['Saulwick', 'Adam', '']]","['Controlled Natural Language', 'Formal Semantics', 'Linguisticstructures', 'Human–Computer Interaction', 'High-level Information Fusion']"
16403,1511.07658,Teng Li,"Teng Li, Vikram K. Narayana, Tarek El-Ghazawi","Efficient Resource Sharing Through GPU Virtualization on Accelerated
  High Performance Computing Systems",21 pages,,,,cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The High Performance Computing (HPC) field is witnessing a widespread
adoption of Graphics Processing Units (GPUs) as co-processors for conventional
homogeneous clusters. The adoption of prevalent Single- Program Multiple-Data
(SPMD) programming paradigm for GPU-based parallel processing brings in the
challenge of resource underutilization, with the asymmetrical
processor/co-processor distribution. In other words, under SPMD, balanced
CPU/GPU distribution is required to ensure full resource utilization. In this
paper, we propose a GPU resource virtualization approach to allow underutilized
microprocessors to effi- ciently share the GPUs. We propose an efficient GPU
sharing scenario achieved through GPU virtualization and analyze the
performance potentials through execution models. We further present the
implementation details of the virtualization infrastructure, followed by the
experimental analyses. The results demonstrate considerable performance gains
with GPU virtualization. Furthermore, the proposed solution enables full
utilization of asymmetrical resources, through efficient GPU sharing among
microprocessors, while incurring low overhead due to the added virtualization
layer.
","[{'version': 'v1', 'created': 'Tue, 24 Nov 2015 11:33:53 GMT'}]",2015-11-25,"[['Li', 'Teng', ''], ['Narayana', 'Vikram K.', ''], ['El-Ghazawi', 'Tarek', '']]","['GPU', 'Virtualization', 'Resource Sharing', 'SPMD', 'Heterogeneous Computing', 'High PerformanceComputing']"
16404,1605.01079,Tiago Tresoldi,Tiago Tresoldi,"Newer method of string comparison: the Modified Moving Contracting
  Window Pattern Algorithm","9 pages, 1 table, 1 source-code listing",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new algorithm, the Modified Moving Contracting Window
Pattern Algorithm (CMCWPM), for the calculation of field similarity. It
strongly relies on previous work by Yang et al. (2001), correcting previous
work in which characters marked as inaccessible for further pattern matching
were not treated as boundaries between subfields, occasionally leading to
higher than expected scores of field similarity. A reference Python
implementation is provided.
","[{'version': 'v1', 'created': 'Tue, 3 May 2016 20:28:39 GMT'}]",2016-05-05,"[['Tresoldi', 'Tiago', '']]","['field similarity', 'string similarity', 'string comparison']"
16405,0906.3772,R Doomun,"Baolong Liu, Joan Lu, Jim Yip",XML Data Integrity Based on Concatenated Hash Function,"10 pages, International Journal of Computer Science and Information
  Security (IJCSIS)","IJCSIS, May 2009, Vol. 1",,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data integrity is the fundamental for data authentication. A major problem
for XML data authentication is that signed XML data can be copied to another
document but still keep signature valid. This is caused by XML data integrity
protecting. Through investigation, the paper discovered that besides data
content integrity, XML data integrity should also protect element location
information, and context referential integrity under fine-grained security
situation. The aim of this paper is to propose a model for XML data integrity
considering XML data features. The paper presents an XML data integrity model
named as CSR (content integrity, structure integrity, context referential
integrity) based on a concatenated hash function. XML data content integrity is
ensured using an iterative hash process, structure integrity is protected by
hashing an absolute path string from root node, and context referential
integrity is ensured by protecting context-related elements. Presented XML data
integrity model can satisfy integrity requirements under situation of
fine-grained security, and compatible with XML signature. Through evaluation,
the integrity model presented has a higher efficiency on digest
value-generation than the Merkle hash tree-based integrity model for XML data.
","[{'version': 'v1', 'created': 'Sat, 20 Jun 2009 03:10:16 GMT'}]",2009-06-23,"[['Liu', 'Baolong', ''], ['Lu', 'Joan', ''], ['Yip', 'Jim', '']]","['Fine-grained security', 'XML data integrity', 'Digest value', 'Merkle hash tree', 'XML signature']"
16406,0802.4244,Dimitris Papamichail,"Christos Tryfonas, Dimitris Papamichail, Andrew Mehler, Steven Skiena",Call Admission Control Algorithm for pre-stored VBR video streams,"12 pages, 9 figures, includes appendix",,,,cs.NI cs.DS,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We examine the problem of accepting a new request for a pre-stored VBR video
stream that has been smoothed using any of the smoothing algorithms found in
the literature. The output of these algorithms is a piecewise constant-rate
schedule for a Variable Bit-Rate (VBR) stream. The schedule guarantees that the
decoder buffer does not overflow or underflow. The problem addressed in this
paper is the determination of the minimal time displacement of each new
requested VBR stream so that it can be accomodated by the network and/or the
video server without overbooking the committed traffic. We prove that this
call-admission control problem for multiple requested VBR streams is
NP-complete and inapproximable within a constant factor, by reducing it from
the VERTEX COLOR problem. We also present a deterministic morphology-sensitive
algorithm that calculates the minimal time displacement of a VBR stream
request. The complexity of the proposed algorithm make it suitable for
real-time determination of the time displacement parameter during the call
admission phase.
","[{'version': 'v1', 'created': 'Thu, 28 Feb 2008 17:45:03 GMT'}]",2008-02-29,"[['Tryfonas', 'Christos', ''], ['Papamichail', 'Dimitris', ''], ['Mehler', 'Andrew', ''], ['Skiena', 'Steven', '']]","['Variable Bit-Rate Stream', 'Call-Admission Control', 'Time Displacement', '3SUM hard', 'constantfactor inapproximable']"
16407,1802.08876,Holger Dell,"Holger Dell, Martin Grohe, Gaurav Rattan",Lov\'asz Meets Weisfeiler and Leman,"Proceedings version to appear at the 45th International Colloquium on
  Automata, Languages, and Programming (ICALP 2018)",,,,cs.DS math.CO,http://creativecommons.org/licenses/by/4.0/,"  In this paper, we relate a beautiful theory by Lov\'asz with a popular
heuristic algorithm for the graph isomorphism problem, namely the color
refinement algorithm and its k-dimensional generalization known as the
Weisfeiler-Leman algorithm. We prove that two graphs G and H are
indistinguishable by the color refinement algorithm if and only if, for all
trees T, the number Hom(T,G) of homomorphisms from T to G equals the
corresponding number Hom(T,H) for H.
  There is a natural system of linear equations whose nonnegative integer
solutions correspond to the isomorphisms between two graphs. The nonnegative
real solutions to this system are called fractional isomorphisms, and two
graphs are fractionally isomorphic if and only if the color refinement
algorithm cannot distinguish them (Tinhofer 1986, 1991). We show that, if we
drop the nonnegativity constraints, that is, if we look for arbitrary real
solutions, then a solution to the linear system exists if and only if, for all
t, the two graphs have the same number of length-t walks.
  We lift the results for trees to an equivalence between numbers of
homomorphisms from graphs of tree width k, the k-dimensional Weisfeiler-Leman
algorithm, and the level-k Sherali-Adams relaxation of our linear program. We
also obtain a partial result for graphs of bounded path width and solutions to
our system where we drop the nonnegativity constraints. A consequence of our
results is a quasi-linear time algorithm to decide whether, for two given
graphs G and H, there is a tree T with Hom(T,G) = Hom(T,H).
","[{'version': 'v1', 'created': 'Sat, 24 Feb 2018 16:23:46 GMT'}, {'version': 'v2', 'created': 'Tue, 22 May 2018 13:18:02 GMT'}]",2018-05-23,"[['Dell', 'Holger', ''], ['Grohe', 'Martin', ''], ['Rattan', 'Gaurav', '']]","['graph isomorphism', 'graph homomorphism numbers', 'tree width']"
16408,1507.01442,Shicong Liu,"Shicong Liu, Hongtao Lu","Learning Better Encoding for Approximate Nearest Neighbor Search with
  Dictionary Annealing",10 pages,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a novel dictionary optimization method for high-dimensional
vector quantization employed in approximate nearest neighbor (ANN) search.
Vector quantization methods first seek a series of dictionaries, then
approximate each vector by a sum of elements selected from these dictionaries.
An optimal series of dictionaries should be mutually independent, and each
dictionary should generate a balanced encoding for the target dataset. Existing
methods did not explicitly consider this. To achieve these goals along with
minimizing the quantization error (residue), we propose a novel dictionary
optimization method called \emph{Dictionary Annealing} that alternatively
""heats up"" a single dictionary by generating an intermediate dataset with
residual vectors, ""cools down"" the dictionary by fitting the intermediate
dataset, then extracts the new residual vectors for the next iteration. Better
codes can be learned by DA for the ANN search tasks. DA is easily implemented
on GPU to utilize the latest computing technology, and can easily extended to
an online dictionary learning scheme. We show by experiments that our optimized
dictionaries substantially reduce the overall quantization error. Jointly used
with residual vector quantization, our optimized dictionaries lead to a better
approximate nearest neighbor search performance compared to the
state-of-the-art methods.
","[{'version': 'v1', 'created': 'Mon, 6 Jul 2015 13:25:35 GMT'}]",2015-07-07,"[['Liu', 'Shicong', ''], ['Lu', 'Hongtao', '']]","['Vector Quantization', 'Dictionary Annealing', 'Distance Approximation', 'Approximate Nearest Neighbor Search', 'LargeScale Search']"
16409,1605.01229,Paolo Missier,Paolo Missier,"The lifecycle of provenance metadata and its associated challenges and
  opportunities",,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This chapter outlines some of the challenges and opportunities associated
with adopting provenance principles and standards in a variety of disciplines,
including data publication and reuse, and information sciences.
","[{'version': 'v1', 'created': 'Wed, 4 May 2016 11:27:45 GMT'}]",2016-05-05,"[['Missier', 'Paolo', '']]","['Provenance data modelling', 'provenance lifecycle', 'provenanceanalytics']"
16410,1504.01446,Vasil S. Denchev,"Vasil S. Denchev, Nan Ding, Shin Matsushima, S.V.N. Vishwanathan,
  Hartmut Neven",Totally Corrective Boosting with Cardinality Penalization,,,,,cs.LG quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a totally corrective boosting algorithm with explicit cardinality
regularization. The resulting combinatorial optimization problems are not known
to be efficiently solvable with existing classical methods, but emerging
quantum optimization technology gives hope for achieving sparser models in
practice. In order to demonstrate the utility of our algorithm, we use a
distributed classical heuristic optimizer as a stand-in for quantum hardware.
Even though this evaluation methodology incurs large time and resource costs on
classical computing machinery, it allows us to gauge the potential gains in
generalization performance and sparsity of the resulting boosted ensembles. Our
experimental results on public data sets commonly used for benchmarking of
boosting algorithms decidedly demonstrate the existence of such advantages. If
actual quantum optimization were to be used with this algorithm in the future,
we would expect equivalent or superior results at much smaller time and energy
costs during training. Moreover, studying cardinality-penalized boosting also
sheds light on why unregularized boosting algorithms with early stopping often
yield better results than their counterparts with explicit convex
regularization: Early stopping performs suboptimal cardinality regularization.
The results that we present here indicate it is beneficial to explicitly solve
the combinatorial problem still left open at early termination.
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2015 00:50:30 GMT'}]",2015-04-09,"[['Denchev', 'Vasil S.', ''], ['Ding', 'Nan', ''], ['Matsushima', 'Shin', ''], ['Vishwanathan', 'S. V. N.', ''], ['Neven', 'Hartmut', '']]","['boosting', 'ensemble methods', 'sparsity', 'cardinality penalization', 'non-convex optimization', 'quantum optimization']"
16411,1504.02842,Liu Feng,Feng Liu,Definition and Research of Internet Neurology,,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  More and more scientific research shows that there is a close correlation
between the Internet and brain science. This paper presents the idea of
establishing the Internet neurology, which means to make a cross-contrast
between the two in terms of physiology and psychology, so that a complete
infrastructure system of the Internet is established, predicting the
development trend of the Internet in the future as well as the brain structure
and operation mechanism, and providing theoretical support for the generation
principle of intelligence, cognition and emotion. It also proposes the
viewpoint that the Internet can be divided into Internet neurophysiology,
Internet neuropsychology, Brain Internet physiology, Brain Internet psychology
and the Internet in cognitive science.
","[{'version': 'v1', 'created': 'Sat, 11 Apr 2015 06:17:58 GMT'}]",2015-04-14,"[['Liu', 'Feng', '']]","['Internet', 'Neurology', 'physiology', 'psychology']"
16412,1205.4928,"Martin Sch\""af","Stephan Arlt, Ishan Banerjee, Cristiano Bertolini, Atif M. Memon,
  Martin Sch\""af",Grey-box GUI Testing: Efficient Generation of Event Sequences,11 pages,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graphical user interfaces (GUIs), due to their event driven nature, present a
potentially unbounded space of all possible ways to interact with software.
During testing it becomes necessary to effectively sample this space. In this
paper we develop algorithms that sample the GUI's input space by only
generating sequences that (1) are allowed by the GUI's structure, and (2) chain
together only those events that have data dependencies between their event
handlers. We create a new abstraction, called an event-dependency graph (EDG)
of the GUI, that captures data dependencies between event handler code. We
develop a mapping between EDGs and an existing black-box user-level model of
the GUI's workflow, called an event-flow graph (EFG). We have implemented
automated EDG construction in a tool that analyzes the bytecode of each event
handler. We evaluate our ""grey-box"" approach using four open-source
applications and compare it with the current state-of-the-art EFG approach. Our
results show that using the EDG reduces the number of test cases while still
achieving at least the same coverage. Furthermore, we were able to detect 2 new
bugs in the subject applications.
","[{'version': 'v1', 'created': 'Tue, 22 May 2012 14:33:41 GMT'}]",2012-05-23,"[['Arlt', 'Stephan', ''], ['Banerjee', 'Ishan', ''], ['Bertolini', 'Cristiano', ''], ['Memon', 'Atif M.', ''], ['Schäf', 'Martin', '']]","['GUI Testing', 'Black-box', 'Grey-box', 'Test Automation;']"
16413,1704.08536,"Stefan R\""ummele","\'Edouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan
  R\""ummele, Abdallah Saffidine",The Parameterized Complexity of Positional Games,"To appear in the Proceedings of the 44th International Colloquium on
  Automata, Languages, and Programming (ICALP 2017)",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the parameterized complexity of several positional games. Our main
result is that Short Generalized Hex is W[1]-complete parameterized by the
number of moves. This solves an open problem from Downey and Fellows'
influential list of open problems from 1999. Previously, the problem was
thought of as a natural candidate for AW[*]-completeness. Our main tool is a
new fragment of first-order logic where universally quantified variables only
occur in inequalities. We show that model-checking on arbitrary relational
structures for a formula in this fragment is W[1]-complete when parameterized
by formula size. We also consider a general framework where a positional game
is represented as a hypergraph and two players alternately pick vertices. In a
Maker-Maker game, the first player to have picked all the vertices of some
hyperedge wins the game. In a Maker-Breaker game, the first player wins if she
picks all the vertices of some hyperedge, and the second player wins otherwise.
In an Enforcer-Avoider game, the first player wins if the second player picks
all the vertices of some hyperedge, and the second player wins otherwise. Short
Maker-Maker is AW[*]-complete, whereas Short Maker-Breaker is W[1]-complete and
Short Enforcer-Avoider co-W[1]-complete parameterized by the number of moves.
This suggests a rough parameterized complexity categorization into positional
games that are complete for the first level of the W-hierarchy when the winning
configurations only depend on which vertices one player has been able to pick,
but AW[*]-completeness when the winning condition depends on which vertices
both players have picked. However, some positional games where the board and
the winning configurations are highly structured are fixed-parameter tractable.
We give another example of such a game, Short k-Connect, which is
fixed-parameter tractable when parameterized by the number of moves.
","[{'version': 'v1', 'created': 'Thu, 27 Apr 2017 12:42:54 GMT'}]",2017-04-28,"[['Bonnet', 'Édouard', ''], ['Gaspers', 'Serge', ''], ['Lambilliotte', 'Antonin', ''], ['Rümmele', 'Stefan', ''], ['Saffidine', 'Abdallah', '']]","['Hex', 'Maker-Maker games', 'Maker-Breaker games', 'Enforcer-Avoider games', 'parameterized complexity theory']"
16414,1702.06879,Th\'eo Trouillon,"Th\'eo Trouillon, Christopher R. Dance, Johannes Welbl, Sebastian
  Riedel, \'Eric Gaussier, Guillaume Bouchard",Knowledge Graph Completion via Complex Tensor Factorization,"38 pages, accepted in JMLR. This is an extended version of the
  article ""Complex embeddings for simple link prediction"" (ICML 2016)",,,,cs.AI cs.LG math.SP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In statistical relational learning, knowledge graph completion deals with
automatically understanding the structure of large knowledge graphs---labeled
directed graphs---and predicting missing relationships---labeled edges.
State-of-the-art embedding models propose different trade-offs between modeling
expressiveness, and time and space complexity. We reconcile both expressiveness
and complexity through the use of complex-valued embeddings and explore the
link between such complex-valued embeddings and unitary diagonalization. We
corroborate our approach theoretically and show that all real square
matrices---thus all possible relation/adjacency matrices---are the real part of
some unitarily diagonalizable matrix. This results opens the door to a lot of
other applications of square matrices factorization. Our approach based on
complex embeddings is arguably simple, as it only involves a Hermitian dot
product, the complex counterpart of the standard dot product between real
vectors, whereas other methods resort to more and more complicated composition
functions to increase their expressiveness. The proposed complex embeddings are
scalable to large data sets as it remains linear in both space and time, while
consistently outperforming alternative approaches on standard link prediction
benchmarks.
","[{'version': 'v1', 'created': 'Wed, 22 Feb 2017 16:28:11 GMT'}, {'version': 'v2', 'created': 'Sun, 26 Nov 2017 20:39:34 GMT'}]",2017-11-28,"[['Trouillon', 'Théo', ''], ['Dance', 'Christopher R.', ''], ['Welbl', 'Johannes', ''], ['Riedel', 'Sebastian', ''], ['Gaussier', 'Éric', ''], ['Bouchard', 'Guillaume', '']]","['complex embeddings', 'tensor factorization', 'knowledge graph', 'matrix completion', 'statistical relational learning']"
16415,1610.00580,Jacob Abernethy,"Jacob Abernethy (University of Michigan), Cyrus Anderson (University
  of Michigan), Chengyu Dai (University of Michigan), Arya Farahi (University
  of Michigan), Linh Nguyen (University of Michigan), Adam Rauh (University of
  Michigan), Eric Schwartz (University of Michigan), Wenbo Shen (University of
  Michigan), Guangsha Shi (University of Michigan), Jonathan Stroud (University
  of Michigan), Xinyu Tan (University of Michigan), Jared Webb (University of
  Michigan), Sheng Yang (University of Michigan)","Flint Water Crisis: Data-Driven Risk Assessment Via Residential Water
  Testing",Presented at the Data For Good Exchange 2016,,,,cs.LG stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recovery from the Flint Water Crisis has been hindered by uncertainty in both
the water testing process and the causes of contamination. In this work, we
develop an ensemble of predictive models to assess the risk of lead
contamination in individual homes and neighborhoods. To train these models, we
utilize a wide range of data sources, including voluntary residential water
tests, historical records, and city infrastructure data. Additionally, we use
our models to identify the most prominent factors that contribute to a high
risk of lead contamination. In this analysis, we find that lead service lines
are not the only factor that is predictive of the risk of lead contamination of
water. These results could be used to guide the long-term recovery efforts in
Flint, minimize the immediate damages, and improve resource-allocation
decisions for similar water infrastructure crises.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2016 14:31:11 GMT'}]",2016-10-04,"[['Abernethy', 'Jacob', '', 'University of Michigan'], ['Anderson', 'Cyrus', '', 'University\n  of Michigan'], ['Dai', 'Chengyu', '', 'University of Michigan'], ['Farahi', 'Arya', '', 'University\n  of Michigan'], ['Nguyen', 'Linh', '', 'University of Michigan'], ['Rauh', 'Adam', '', 'University of\n  Michigan'], ['Schwartz', 'Eric', '', 'University of Michigan'], ['Shen', 'Wenbo', '', 'University of\n  Michigan'], ['Shi', 'Guangsha', '', 'University of Michigan'], ['Stroud', 'Jonathan', '', 'University\n  of Michigan'], ['Tan', 'Xinyu', '', 'University of Michigan'], ['Webb', 'Jared', '', 'University of\n  Michigan'], ['Yang', 'Sheng', '', 'University of Michigan']]","['Water Quality', 'Flint Water Crisis', 'Risk Assessment', 'Machine Learning']"
16416,1301.2447,Daniel Speicher,"Daniel Speicher, Andri Bremm",Clone Removal in Java Programs as a Process of Stepwise Unification,,26th Workshop on Logic Programming (WLP 2012),,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloned code is one of the most important obstacles against consistent
software maintenance and evolution. Although today's clone detection tools find
a variety of clones, they do not offer any advice how to remove such clones. We
explain the problems involved in finding a sequence of changes for clone
removal and suggest to view this problem as a process of stepwise unification
of the clone instances. Consequently the problem can be solved by backtracking
over the possible unification steps.
","[{'version': 'v1', 'created': 'Fri, 11 Jan 2013 10:44:35 GMT'}]",2013-01-14,"[['Speicher', 'Daniel', ''], ['Bremm', 'Andri', '']]","['unification', 'backtracking', 'clone analysis', 'refactoring', 'program dependence graph', 'lambda expression']"
16417,1412.7653,Bao-Thien Hoang,"Bao-Thien Hoang, Abdessamad Imine",Efficient Polling Protocol for Decentralized Social Networks,,,,,cs.DC cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the polling problem in social networks where individuals
collaborate to choose the most favorite choice amongst some options, without
divulging their vote and publicly exposing their potentially malicious actions.
Given this social interaction model, Guerraoui et al. recently proposed polling
protocols that do not rely on any central authority or cryptography system,
using a simple secret sharing scheme along with verification procedures to
accurately compute the poll's final result. However, these protocols can be
deployed safely and efficiently provided that, inter alia, the social graph
structure should be transformed into a ring structure-based overlay and the
number of participating users is perfect square. Consequently, designing
\emph{secure} and \emph{efficient} polling protocols regardless these
constraints remains a challenging issue.
  In this paper, we present EPol, a simple decentralized polling protocol that
relies on the current state of social graphs. More explicitly, we define one
family of social graphs that satisfy what we call the $m$-broadcasting property
(where $m$ is less than or equal to the minimum node degree) and show their
structures enable low communication cost and constitute necessary and
sufficient condition to ensure vote privacy and limit the impact of dishonest
users on the accuracy of the polling output. Our protocol is effective to
compute more precisely the final result. Furthermore, despite the use of richer
social graph structures, the communication and spatial complexities of EPol are
close to be linear.
","[{'version': 'v1', 'created': 'Wed, 24 Dec 2014 12:35:08 GMT'}]",2014-12-25,"[['Hoang', 'Bao-Thien', ''], ['Imine', 'Abdessamad', '']]","['Social networks', 'Polling protocol', 'Secret sharing', 'Privacy']"
16418,1511.06965,David Darais,"David Darais, David Van Horn","Constructive Galois Connections: Taming the Galois Connection Framework
  for Mechanized Metatheory",,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Galois connections are a foundational tool for structuring abstraction in
semantics and their use lies at the heart of the theory of abstract
interpretation. Yet, mechanization of Galois connections remains limited to
restricted modes of use, preventing their general application in mechanized
metatheory and certified programming.
  This paper presents constructive Galois connections, a variant of Galois
connections that is effective both on paper and in proof assistants; is
complete with respect to a large subset of classical Galois connections; and
enables more general reasoning principles, including the ""calculational"" style
advocated by Cousot.
  To design constructive Galois connection we identify a restricted mode of use
of classical ones which is both general and amenable to mechanization in
dependently-typed functional programming languages. Crucial to our metatheory
is the addition of monadic structure to Galois connections to control a
""specification effect"". Effectful calculations may reason classically, while
pure calculations have extractable computational content. Explicitly moving
between the worlds of specification and implementation is enabled by our
metatheory.
  To validate our approach, we provide two case studies in mechanizing existing
proofs from the literature: one uses calculational abstract interpretation to
design a static analyzer, the other forms a semantic basis for gradual typing.
Both mechanized proofs closely follow their original paper-and-pencil
counterparts, employ reasoning principles not captured by previous
mechanization approaches, support the extraction of verified algorithms, and
are novel.
","[{'version': 'v1', 'created': 'Sun, 22 Nov 2015 04:55:17 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Mar 2016 20:39:13 GMT'}, {'version': 'v3', 'created': 'Thu, 28 Jul 2016 20:54:23 GMT'}, {'version': 'v4', 'created': 'Wed, 26 Oct 2016 17:29:30 GMT'}]",2016-10-27,"[['Darais', 'David', ''], ['Van Horn', 'David', '']]","['Abstract Interpretation', 'Galois Connections', 'Monads']"
16419,1701.01654,Rao Farhat Masood,Rao Farhat Masood,Application of Fuzzy Logic in Design of Smart Washing Machine,"Fuzzy Washing Machine, Smart Washing Machine",,,,cs.SY cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Washing machine is of great domestic necessity as it frees us from the burden
of washing our clothes and saves ample of our time. This paper will cover the
aspect of designing and developing of Fuzzy Logic based, Smart Washing Machine.
The regular washing machine (timer based) makes use of multi-turned timer based
start-stop mechanism which is mechanical as is prone to breakage. In addition
to its starting and stopping issues, the mechanical timers are not efficient
with respect of maintenance and electricity usage. Recent developments have
shown that merger of digital electronics in optimal functionality of this
machine is possible and nowadays in practice. A number of international
renowned companies have developed the machine with the introduction of smart
artificial intelligence. Such a machine makes use of sensors and smartly
calculates the amount of run-time (washing time) for the main machine motor.
Realtime calculations and processes are also catered in optimizing the run-time
of the machine. The obvious result is smart time management, better economy of
electricity and efficiency of work. This paper deals with the indigenization of
FLC (Fuzzy Logic Controller) based Washing Machine, which is capable of
automating the inputs and getting the desired output (wash-time).
","[{'version': 'v1', 'created': 'Wed, 4 Jan 2017 08:41:07 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Mar 2017 06:46:55 GMT'}]",2017-03-16,"[['Masood', 'Rao Farhat', '']]","['Fuzzy Logic', 'Washing Machine', 'FLC', 'Smart Washing Machine', 'Application of Fuzzy Logic in Washing Machine']"
16420,1409.6629,Bernhard Rumpe,"Hans Gr\""onninger, Holger Krahn, Claas Pinkernell, Bernhar Rumpe",Modeling Variants of Automotive Systems using Views,"14 pages, 9 figures","Tagungsband Modellierungs-Workshop MBEFF: Modellbasierte
  Entwicklung von eingebetteten Fahrzeugfunktionen. Berlin, M\""arz 2008,
  Informatik-Bericht 2008-01, CFG-Fakult\""at, TU Braunschweig, 2008",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an approach of modeling variability of automotive system
architectures using function nets, views and feature diagrams. A function net
models an architecture hierarchically and views are used to omit parts of such
a model to focus on certain functionalities. In combination with feature
diagrams that describe valid variants, the concepts of feature and variant
views are introduced to model architectural variants. The relationship between
views, variants and the underlying complete architectural model is discussed.
Methodological aspects that come along with this approach are considered.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 12:33:28 GMT'}]",2014-09-24,"[['Grönninger', 'Hans', ''], ['Krahn', 'Holger', ''], ['Pinkernell', 'Claas', ''], ['Rumpe', 'Bernhar', '']]","['Automotive Systems', 'Logical Architecture', 'Feature Modeling', 'Variability']"
16421,1106.1370,Jingchao Chen,Jingchao Chen,Exploiting Dynamically Propositional Logic Structures in SAT,6 pages,,,,cs.LO cs.DM,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The 32-bit hwb (hwb-n32 for short) problem is from equivalence checking that
arises in combining two circuits computing the hidden weighted bit function.
Since 2002, it remains still unsolvable in every SAT competition. This paper
focuses on solving problems such as hwb-n32. Generally speaking, modern solvers
can detect only XOR, AND, OR and ITE gates. Other non-clausal formulas
(propositional logic structures) cannot be detected. To solve the hwb-n32
problem, we extract dynamically some special propositional logic structures,
and then use a variant of DPLL-based solvers to solve the subproblem simplified
by the extracted structure information. Using the dynamic extraction technique,
we solved efficiently the hwb-n32 problem, even some of which were solved
within 3000 seconds.
","[{'version': 'v1', 'created': 'Tue, 7 Jun 2011 15:06:41 GMT'}]",2011-06-08,"[['Chen', 'Jingchao', '']]","['Structure for SAT', 'Propositional logic', 'Solving strategy', 'Structural Knowledge', 'Hard SAT problem', 'Reasoning Rules']"
16422,1708.01155,Jelmer Wolterink,"Jelmer M. Wolterink and Anna M. Dinkla and Mark H.F. Savenije and
  Peter R. Seevinck and Cornelis A.T. van den Berg and Ivana Isgum",Deep MR to CT Synthesis using Unpaired Data,MICCAI 2017 Workshop on Simulation and Synthesis in Medical Imaging,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  MR-only radiotherapy treatment planning requires accurate MR-to-CT synthesis.
Current deep learning methods for MR-to-CT synthesis depend on pairwise aligned
MR and CT training images of the same patient. However, misalignment between
paired images could lead to errors in synthesized CT images. To overcome this,
we propose to train a generative adversarial network (GAN) with unpaired MR and
CT images. A GAN consisting of two synthesis convolutional neural networks
(CNNs) and two discriminator CNNs was trained with cycle consistency to
transform 2D brain MR image slices into 2D brain CT image slices and vice
versa. Brain MR and CT images of 24 patients were analyzed. A quantitative
evaluation showed that the model was able to synthesize CT images that closely
approximate reference CT images, and was able to outperform a GAN model trained
with paired MR and CT images.
","[{'version': 'v1', 'created': 'Thu, 3 Aug 2017 14:18:43 GMT'}]",2017-08-04,"[['Wolterink', 'Jelmer M.', ''], ['Dinkla', 'Anna M.', ''], ['Savenije', 'Mark H. F.', ''], ['Seevinck', 'Peter R.', ''], ['Berg', 'Cornelis A. T. van den', ''], ['Isgum', 'Ivana', '']]","['Deep learning', 'radiotherapy', 'treatment planning', 'CT synthesis', 'Generative Adversarial Networks']"
16423,1604.00202,Marco Bressan,"Marco Bressan, Enoch Peserico, and Luca Pretto",The Power of Local Information in PageRank,"25 pages, 6 figures",,,,cs.DM cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  How large a fraction of a graph must one explore to rank a small set of nodes
according to their PageRank scores? We show that the answer is quite nuanced,
and depends crucially on the interplay between the correctness guarantees one
requires and the way one can access the graph. On the one hand, assuming the
graph can be accessed only via ""natural"" exploration queries that reveal small
pieces of its topology, we prove that deterministic and Las Vegas algorithms
must in the worst case perform $n - o(n)$ queries and explore essentially the
entire graph, independently of the specific types of query employed. On the
other hand we show that, depending on the types of query available, Monte Carlo
algorithms can perform asymptotically better: if allowed to both explore the
local topology around single nodes and access nodes at random in the graph they
need $\Omega(n^{2/3})$ queries in the worst case, otherwise they still need
$\Omega(n)$ queries similarly to Las Vegas algorithms. All our bounds
generalize and tighten those already known, cover the different types of graph
exploration queries appearing in the literature, and immediately apply also to
the problem of approximating the PageRank score of single nodes.
","[{'version': 'v1', 'created': 'Fri, 1 Apr 2016 10:57:51 GMT'}]",2016-04-04,"[['Bressan', 'Marco', ''], ['Peserico', 'Enoch', ''], ['Pretto', 'Luca', '']]","['Local algorithms', 'graph ranking', 'PageRank', 'graph exploration models']"
16424,1712.04323,Claudio Gallicchio,Claudio Gallicchio and Alessio Micheli,Deep Echo State Network (DeepESN): A Brief Survey,,,,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The study of deep recurrent neural networks (RNNs) and, in particular, of
deep Reservoir Computing (RC) is gaining an increasing research attention in
the neural networks community. The recently introduced Deep Echo State Network
(DeepESN) model opened the way to an extremely efficient approach for designing
deep neural networks for temporal data. At the same time, the study of DeepESNs
allowed to shed light on the intrinsic properties of state dynamics developed
by hierarchical compositions of recurrent layers, i.e. on the bias of depth in
RNNs architectural design. In this paper, we summarize the advancements in the
development, analysis and applications of DeepESNs.
","[{'version': 'v1', 'created': 'Tue, 12 Dec 2017 14:50:51 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Oct 2018 14:01:34 GMT'}, {'version': 'v3', 'created': 'Mon, 25 Feb 2019 19:59:13 GMT'}, {'version': 'v4', 'created': 'Fri, 25 Sep 2020 17:53:57 GMT'}]",2020-09-28,"[['Gallicchio', 'Claudio', ''], ['Micheli', 'Alessio', '']]","['Deep Echo State Network', 'DeepESN', 'Reservoir Computing', 'Echo State Networks', 'Recurrent Neural Networks', 'Deep Learning', 'DeepNeural Networks']"
16425,1307.4230,Peter Sasvari,Peter Sasvari,"The State of Information and Communication Technology in Hungary, A
  Comparative Analysis",6 pages,Informatica 35 (2011) 239-244,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel comparative research and analysis method is proposed and applied on
the Hungarian economic sectors. The question of what factors have an effect on
their net income is essential for enterprises. First, the potential indicators
related to economic sectors were studied and then compared to the net income of
the surveyed enterprises. The data resulting from the comparison showed that
the growing penetration of electronic marketpalces contributed to the change of
the net income of enterprises in various economic sectors to the extent of 37%.
Among all the potential indicators, only the indicator of electronic
marketplaces has a direct influence on the net income of enterprises. Two
clusters based on the potential indicators were indicated.
","[{'version': 'v1', 'created': 'Tue, 16 Jul 2013 10:06:54 GMT'}]",2013-07-17,"[['Sasvari', 'Peter', '']]","['information society', 'ICT', 'economic sector', 'electronic presence', 'electronic marketplace']"
16426,1701.08840,Andre Goncalves,"Andr\'e R. Gon\c{c}alves, Arindam Banerjee, Fernando J. Von Zuben","Spatial Projection of Multiple Climate Variables using Hierarchical
  Multitask Learning","Accepted for the 31st AAAI Conference on Artificial Intelligence
  (AAAI-17)",,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Future projection of climate is typically obtained by combining outputs from
multiple Earth System Models (ESMs) for several climate variables such as
temperature and precipitation. While IPCC has traditionally used a simple model
output average, recent work has illustrated potential advantages of using a
multitask learning (MTL) framework for projections of individual climate
variables. In this paper we introduce a framework for hierarchical multitask
learning (HMTL) with two levels of tasks such that each super-task, i.e., task
at the top level, is itself a multitask learning problem over sub-tasks. For
climate projections, each super-task focuses on projections of specific climate
variables spatially using an MTL formulation. For the proposed HMTL approach, a
group lasso regularization is added to couple parameters across the
super-tasks, which in the climate context helps exploit relationships among the
behavior of different climate variables at a given spatial location. We show
that some recent works on MTL based on learning task dependency structures can
be viewed as special cases of HMTL. Experiments on synthetic and real climate
data show that HMTL produces better results than decoupled MTL methods applied
separately on the super-tasks and HMTL significantly outperforms baselines for
climate projection.
","[{'version': 'v1', 'created': 'Mon, 30 Jan 2017 21:56:18 GMT'}]",2017-02-01,"[['Gonçalves', 'André R.', ''], ['Banerjee', 'Arindam', ''], ['Von Zuben', 'Fernando J.', '']]","['Multitask Learning', 'Structure Learning', 'Spatial Regression', 'Structured Regression', 'Earth System Models Ensemble']"
16427,1301.6900,Andreas Kaltenbrunner,"Andreas Kaltenbrunner, Pablo Arag\'on, David Laniado, Yana Volkovich",Not all paths lead to Rome: Analysing the network of sister cities,"7 pages, 4 figures",,,,cs.SI cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work analyses the practice of sister city pairing. We investigate
structural properties of the resulting city and country networks and present
rankings of the most central nodes in these networks. We identify different
country clusters and find that the practice of sister city pairing is not
influenced by geographical proximity but results in highly assortative
networks.
","[{'version': 'v1', 'created': 'Tue, 29 Jan 2013 12:01:21 GMT'}]",2013-02-27,"[['Kaltenbrunner', 'Andreas', ''], ['Aragón', 'Pablo', ''], ['Laniado', 'David', ''], ['Volkovich', 'Yana', '']]","['Social network analysis', 'sister cities', 'social self-organisation']"
16428,1609.02451,Francisco  Couto,Diogo Goncalves and Miguel Costa and Francisco M. Couto,A Flexible Recommendation System for Cable TV,"in 3rd Workshop on Recommendation Systems for Television and online
  Video (RecSysTV), At Boston, MA, USA, 2016",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommendation systems are being explored by Cable TV operators to improve
user satisfaction with services, such as Live TV and Video on Demand (VOD)
services. More recently, Catch-up TV has been introduced, allowing users to
watch recent broadcast content whenever they want to. These services give users
a large set of options from which they can choose from, creating an information
overflow problem. Thus, recommendation systems arise as essential tools to
solve this problem by helping users in their selection, which increases not
only user satisfaction but also user engagement and content consumption. In
this paper we present a learning to rank approach that uses contextual
information and implicit feedback to improve recommendation systems for a Cable
TV operator that provides Live and Catch-up TV services. We compare our
approach with existing state-of-the-art algorithms and show that our approach
is superior in accuracy, while maintaining high scores of diversity and
serendipity.
","[{'version': 'v1', 'created': 'Thu, 8 Sep 2016 14:57:25 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Sep 2016 15:02:49 GMT'}]",2016-09-14,"[['Goncalves', 'Diogo', ''], ['Costa', 'Miguel', ''], ['Couto', 'Francisco M.', '']]","['Recommender Systems', 'Live TV', 'Catch-up TV', 'DatasetEvaluation', 'User Behavior']"
16429,0804.2642,Michel Grabisch,"Pedro Miranda, Michel Grabisch (LIP6), Pedro Gil",p-Symmetric fuzzy measures,,"International Journal of Uncertainty Fuzziness and Knowledge-Based
  Systems (2002) 105-123",,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a generalization of the concept of symmetric fuzzy
measure based in a decomposition of the universal set in what we have called
subsets of indifference. Some properties of these measures are studied, as well
as their Choquet integral. Finally, a degree of interaction between the subsets
of indifference is defined.
","[{'version': 'v1', 'created': 'Wed, 16 Apr 2008 16:47:45 GMT'}]",2008-12-18,"[['Miranda', 'Pedro', '', 'LIP6'], ['Grabisch', 'Michel', '', 'LIP6'], ['Gil', 'Pedro', '']]","['Fuzzy measures', 'symmetry', 'OWA operator', 'Choquet integral']"
16430,0910.4000,Damien Chablat,"Raza Ur-Rehman (IRCCyN), St\'ephane Caro (IRCCyN), Damien Chablat
  (IRCCyN), Philippe Wenger (IRCCyN)","Path placement optimization of manipulators based on energy consumption:
  application to the orthoglide 3-axis",,"Transactions of the canadian society for mechanical engineering
  (2009) 1-19",,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with the optimal path placement for a manipulator based on
energy consumption. It proposes a methodology to determine the optimal location
of a given test path within the workspace of a manipulator with minimal
electric energy used by the actuators while taking into account the geometric,
kinematic and dynamic constraints. The proposed methodology is applied to the
Orthoglide~3-axis, a three-degree-of-freedom translational parallel kinematic
machine (PKM), as an illustrative example.
","[{'version': 'v1', 'created': 'Wed, 21 Oct 2009 06:14:55 GMT'}]",2009-10-22,"[['Ur-Rehman', 'Raza', '', 'IRCCyN'], ['Caro', 'Stéphane', '', 'IRCCyN'], ['Chablat', 'Damien', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN']]","['Path placement', 'Energy consumption', 'Optimization', 'Parallel manipulators']"
16431,1606.03511,Mohammad Moniruzzaman,"Mohammad Moniruzzaman, Sherah Kurnia, Alison Parkes and Sean B.
  Maynard",Business Intelligence and Supply Chain Agility,"Research-in-progress ISBN# 978-0-646-95337-3 Presented at the
  Australasian Conference on Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/204,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Supply Chain Agility is important for organisations to stay competitive in
today's dynamic business environment. There is increasing interest in deploying
Business Intelligence (BI) in the Supply Chain Management (SCM) context to
improve Supply Chain (SC) Agility. However, there is limited research exploring
BI contributions to SC Agility. In this research-in-progress paper we propose a
model based on a conceptual analysis of the literature showing how BI can help
organisations achieve SC Agility by supporting the key areas of SCM (Plan,
Source, Make, Deliver and Return). In the next stage of this project, we will
conduct a series of case studies investigating how organisations use BI when
managing their SC activities and how BI contributes to SC Agility. The result
of the study will help organizations deploy BI effectively to support SCM and
improve SC Agility.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 00:29:34 GMT'}]",2016-06-14,"[['Moniruzzaman', 'Mohammad', ''], ['Kurnia', 'Sherah', ''], ['Parkes', 'Alison', ''], ['Maynard', 'Sean B.', '']]","['Business Intelligence', 'Agility', 'Resource-based View', 'Supply Chain', 'Supply Chain Management']"
16432,1710.05873,Anastasiya Gorodilova,"N. Tokareva, A. Gorodilova, S. Agievich, V. Idrisova, N. Kolomeec, A.
  Kutsenko, A. Oblaukhov, G. Shushuev","Mathematical methods in solutions of the problems from the Third
  International Students' Olympiad in Cryptography",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The mathematical problems and their solutions of the Third International
Students' Olympiad in Cryptography NSUCRYPTO'2016 are presented. We consider
mathematical problems related to the construction of algebraic immune vectorial
Boolean functions and big Fermat numbers, problems about secrete sharing
schemes and pseudorandom binary sequences, biometric cryptosystems and the
blockchain technology, etc. Two open problems in mathematical cryptography are
also discussed and a solution for one of them proposed by a participant during
the Olympiad is described. It was the first time in the Olympiad history.
","[{'version': 'v1', 'created': 'Mon, 16 Oct 2017 17:10:25 GMT'}]",2017-10-17,"[['Tokareva', 'N.', ''], ['Gorodilova', 'A.', ''], ['Agievich', 'S.', ''], ['Idrisova', 'V.', ''], ['Kolomeec', 'N.', ''], ['Kutsenko', 'A.', ''], ['Oblaukhov', 'A.', ''], ['Shushuev', 'G.', '']]","['Cryptography', 'ciphers', 'Boolean functions', 'biometry', 'blockchain', 'NSUCRYPTO']"
16433,1206.0570,Sahar Mokhtar,"Nora Yahia, Sahar A. Mokhtar and AbdelWahab Ahmed",Automatic Generation of OWL Ontology from XML Data Source,"International Journal of Computer Science Issues, Volume 9, Issue 2,
  March 2012",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The eXtensible Markup Language (XML) can be used as data exchange format in
different domains. It allows different parties to exchange data by providing
common understanding of the basic concepts in the domain. XML covers the
syntactic level, but lacks support for reasoning. Ontology can provide a
semantic representation of domain knowledge which supports efficient reasoning
and expressive power. One of the most popular ontology languages is the Web
Ontology Language (OWL). It can represent domain knowledge using classes,
properties, axioms and instances for the use in a distributed environment such
as the World Wide Web. This paper presents a new method for automatic
generation of OWL ontology from XML data sources.
","[{'version': 'v1', 'created': 'Mon, 4 Jun 2012 09:55:33 GMT'}]",2012-06-05,"[['Yahia', 'Nora', ''], ['Mokhtar', 'Sahar A.', ''], ['Ahmed', 'AbdelWahab', '']]","['Automatic ontology generation', 'Ontology', 'OWL', 'XML Schema']"
16434,1209.5920,Jaap  Boender,Jaap Boender and Claudio Sacerdoti Coen,On the correctness of a branch displacement algorithm,,,,,cs.LO cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The branch displacement problem is a well-known problem in assembler design.
It revolves around the feature, present in several processor families, of
having different instructions, of different sizes, for jumps of different
displacements. The problem, which is provably NP-hard, is then to select the
instructions such that one ends up with the smallest possible program.
  During our research with the CerCo project on formally verifying a C
compiler, we have implemented and proven correct an algorithm for this problem.
In this paper, we discuss the problem, possible solutions, our specific
solutions and the proofs.
","[{'version': 'v1', 'created': 'Wed, 26 Sep 2012 13:02:24 GMT'}]",2012-09-27,"[['Boender', 'Jaap', ''], ['Coen', 'Claudio Sacerdoti', '']]","['formal verification', 'assembler', 'branch displacement optimisation']"
16435,1407.2683,Jiaxing Shang,"Jiaxing Shang, Lianchen Liu, Feng Xie, Zhen Chen, Jiajia Miao, Xuelin
  Fang, Cheng Wu","A Real-Time Detecting Algorithm for Tracking Community Structure of
  Dynamic Networks","9 pages, 6 figures, 3 tables, 6th SNA-KDD Workshop (2012)",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper a simple but efficient real-time detecting algorithm is
proposed for tracking community structure of dynamic networks. Community
structure is intuitively characterized as divisions of network nodes into
subgroups, within which nodes are densely connected while between which they
are sparsely connected. To evaluate the quality of community structure of a
network, a metric called modularity is proposed and many algorithms are
developed on optimizing it. However, most of the modularity based algorithms
deal with static networks and cannot be performed frequently, due to their high
computing complexity. In order to track the community structure of dynamic
networks in a fine-grained way, we propose a modularity based algorithm that is
incremental and has very low computing complexity. In our algorithm we adopt a
two-step approach. Firstly we apply the algorithm of Blondel et al for
detecting static communities to obtain an initial community structure. Then,
apply our incremental updating strategies to track the dynamic communities. The
performance of our algorithm is measured in terms of the modularity. We test
the algorithm on tracking community structure of Enron Email and three other
real world datasets. The experimental results show that our algorithm can keep
track of community structure in time and outperform the well known CNM
algorithm in terms of modularity.
","[{'version': 'v1', 'created': 'Thu, 10 Jul 2014 04:08:29 GMT'}]",2014-07-11,"[['Shang', 'Jiaxing', ''], ['Liu', 'Lianchen', ''], ['Xie', 'Feng', ''], ['Chen', 'Zhen', ''], ['Miao', 'Jiajia', ''], ['Fang', 'Xuelin', ''], ['Wu', 'Cheng', '']]","['Real-Time Detecting Algorithm', 'Modularity', 'Community Structure', 'Data Mining']"
16436,1004.3277,Vishal Goyal,Ezekiel Okike,"A Pedagogical Evaluation and Discussion about the Lack of Cohesion in
  Method (LCOM) Metric Using Field Experiment","International Journal of Computer Science Issues online at
  http://ijcsi.org/articles/A-Pedagogical-Evaluation-and-Discussion-about-the-Lack-of-Cohesion-in-Method-LCOM-Metric-Using-Field-Experiment.php","IJCSI, Volume 7, Issue 2, March 2010",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Chidamber and Kemerer first defined a cohesion measure for object-oriented
software - the Lack of Cohesion in Methods (LCOM) metric. This paper presents a
pedagogic evaluation and discussion about the LCOM metric using field data from
three industrial systems. System 1 has 34 classes, System 2 has 383 classes and
System 3 has 1055 classes. The main objectives of the study were to determine
if the LCOM metric was appropriate in the measurement of class cohesion and the
determination of properly and improperly designed classes in the studied
systems. Chidamber and Kemerer's suite of metric was used as metric tool.
Descriptive statistics was used to analyze results. The result of the study
showed that in System 1, 78.8% (26 classes) were cohesive; System 2 54% (207
classes) were cohesive; System 3 30% (317 classes) were cohesive. We suggest
that the LCOM metric measures class cohesiveness and was appropriate in the
determination of properly and improperly designed classes in the studied
system.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2010 18:30:52 GMT'}]",2010-04-20,"[['Okike', 'Ezekiel', '']]","['Class Cohesion', 'LCOM Metric', 'Systems', 'Software Measurement.  1']"
16437,1409.4761,Hasan Tavakoli,Hassan Tavakoli,Reducing the Complexity of the Linear Programming Decoding,"This Paper is a draft of final paper which represented in 7th
  International Symposium on Telecommunications (IST'2014)",,,,cs.IT math.IT,http://creativecommons.org/licenses/by/3.0/,"  In this paper we show how the complexity of Linear Programming (LP) decoder
can decrease. We use the degree 3 check equation to model all variation check
degrees. The complexity of LP decoding is directed relative to the number of
constraint. Number of constraint for original LP decoder is O(n*(2^n)). Our
method decrease the number of the constraint to O(n).
","[{'version': 'v1', 'created': 'Tue, 16 Sep 2014 18:17:22 GMT'}]",2014-09-18,"[['Tavakoli', 'Hassan', '']]","['component; Linear Programming Decoder', 'Complexity', 'Check Degree Distribution']"
16438,1004.2931,John Horton,"John J. Horton, David G. Rand and Richard J. Zeckhauser",The Online Laboratory: Conducting Experiments in a Real Labor Market,,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online labor markets have great potential as platforms for conducting
experiments, as they provide immediate access to a large and diverse subject
pool and allow researchers to conduct randomized controlled trials. We argue
that online experiments can be just as valid---both internally and
externally---as laboratory and field experiments, while requiring far less
money and time to design and to conduct. In this paper, we first describe the
benefits of conducting experiments in online labor markets; we then use one
such market to replicate three classic experiments and confirm their results.
We confirm that subjects (1) reverse decisions in response to how a
decision-problem is framed, (2) have pro-social preferences (value payoffs to
others positively), and (3) respond to priming by altering their choices. We
also conduct a labor supply field experiment in which we confirm that workers
have upward sloping labor supply curves. In addition to reporting these
results, we discuss the unique threats to validity in an online setting and
propose methods for coping with these threats. We also discuss the external
validity of results from online domains and explain why online results can have
external validity equal to or even better than that of traditional methods,
depending on the research question. We conclude with our views on the potential
role that online experiments can play within the social sciences, and then
recommend software development priorities and best practices.
","[{'version': 'v1', 'created': 'Fri, 16 Apr 2010 22:44:25 GMT'}]",2010-04-20,"[['Horton', 'John J.', ''], ['Rand', 'David G.', ''], ['Zeckhauser', 'Richard J.', '']]","['Experimentation', 'Online Labor Markets', 'Internet']"
16439,1604.08568,Alejandro Vaisman Dr.,Alexander Campos and Jorge Mozzino and Alejandro Vaisman,Towards Temporal Graph Databases,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In spite of the extensive literature on graph databases (GDBs), temporal GDBs
have not received too much attention so far. Temporal GBDs can capture, for
example, the evolution of social networks across time, a relevant topic in data
analysis nowadays. In this paper we propose a data model and query language
(denoted TEG-QL) for temporal GDBs, based on the notion of attribute graphs.
This allows a straightforward translation to Neo4J, a well-known GBD. We
present extensive examples of the use of TEG-QL, and comment our
implementation.
","[{'version': 'v1', 'created': 'Thu, 28 Apr 2016 19:34:43 GMT'}, {'version': 'v2', 'created': 'Mon, 2 May 2016 13:13:22 GMT'}]",2016-05-03,"[['Campos', 'Alexander', ''], ['Mozzino', 'Jorge', ''], ['Vaisman', 'Alejandro', '']]","['Neo4J', 'Graph Database', 'Temporal Graphs']"
16440,1109.2321,Jegatha Deborah,"L.Jegatha Deborah, R.Baskaran, A.Kannan",Visualizing Domain Ontology using Enhanced Anaphora Resolution Algorithm,"13 pages in total, 11 figures, 2 tables, Older version of the Paper
  published in the International Workshop on Database Management Systems",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Enormous explosion in the number of the World Wide Web pages occur every day
and since the efficiency of most of the information processing systems is found
to be less, the potential of the Internet applications is often underutilized.
Efficient utilization of the web can be exploited when similar web pages are
rigorously, exhaustively organized and clustered based on some domain knowledge
(semantic-based) .Ontology which is a formal representation of domain knowledge
aids in such efficient utilization. The performance of almost all the
semantic-based clustering techniques depends on the constructed ontology,
describing the domain knowledge . The proposed methodology provides an enhanced
pronominal anaphora resolution, one of the key aspects of semantic analysis in
Natural Language Processing for obtaining cross references within a web page
providing better ontology construction. The experimental data sets exhibits
better efficiency of the proposed method compared to earlier traditional
algorithms.
","[{'version': 'v1', 'created': 'Sun, 11 Sep 2011 15:08:11 GMT'}]",2011-09-13,"[['Deborah', 'L. Jegatha', ''], ['Baskaran', 'R.', ''], ['Kannan', 'A.', '']]","['Ontology', 'Anaphora resolution', 'Semantic Analysis', 'Natural Language Processing']"
16441,1701.06109,Hunter Elliott,"David Richmond, Anna Payne-Tobin Jost, Talley Lambert, Jennifer
  Waters, Hunter Elliott","DeadNet: Identifying Phototoxicity from Label-free Microscopy Images of
  Cells using Deep ConvNets",,,,,cs.CV q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Exposure to intense illumination light is an unavoidable consequence of
fluorescence microscopy, and poses a risk to the health of the sample in every
live-cell fluorescence microscopy experiment. Furthermore, the possible
side-effects of phototoxicity on the scientific conclusions that are drawn from
an imaging experiment are often unaccounted for. Previously, controlling for
phototoxicity in imaging experiments required additional labels and
experiments, limiting its widespread application. Here we provide a
proof-of-principle demonstration that the phototoxic effects of an imaging
experiment can be identified directly from a single phase-contrast image using
deep convolutional neural networks (ConvNets). This lays the groundwork for an
automated tool for assessing cell health in a wide range of imaging
experiments. Interpretability of such a method is crucial for its adoption. We
take steps towards interpreting the classification mechanism of the trained
ConvNet by visualizing salient features of images that contribute to accurate
classification.
","[{'version': 'v1', 'created': 'Sun, 22 Jan 2017 01:43:05 GMT'}]",2017-01-24,"[['Richmond', 'David', ''], ['Jost', 'Anna Payne-Tobin', ''], ['Lambert', 'Talley', ''], ['Waters', 'Jennifer', ''], ['Elliott', 'Hunter', '']]","['phototoxicity', 'deep learning', 'convolutional neural network', 'label-free', 'transmitted light microscopy', 'phase contrast']"
16442,1002.1152,Vishal Goyal,"Mahalakshmi Chidambara Natarajan, Ramaswamy Muthiah, Alamelu
  Nachiappan","Performance Investigation of Virtual Private Networks with Different
  Bandwidth Allocations","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 1, January 2010,
  http://ijcsi.org/articles/Performance-Investigation-of-Virtual-Private-Networks-with-Different-Bandwidth-Allocations.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 1, January 2010,
  http://ijcsi.org/articles/Performance-Investigation-of-Virtual-Private-Networks-with-Different-Bandwidth-Allocations.php",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Virtual Private Network (VPN) provides private network connections over a
publicly accessible shared network. The effective allocation of bandwidth for
VPNs assumes significance in the present scenario due to varied traffic. Each
VPN endpoint specifies bounds on the total amount of traffic that it is likely
to send or receive at any time. The network provider tailors the VPN so that
there is sufficient bandwidth for any traffic matrix that is consistent with
these bounds. The approach incorporates the use of Ad-hoc On demand Distance
Vector (AODV) protocol, with a view to accomplish an enhancement in the
performance of the mobile networks. The NS2 based simulation results are
evaluated in terms of its metrics for different bandwidth allocations, besides
analyzing its performance in the event of exigencies such as link failures. The
results highlight the suitability of the proposed strategy in the context of
real time applications.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 08:49:09 GMT'}]",2010-02-08,"[['Natarajan', 'Mahalakshmi Chidambara', ''], ['Muthiah', 'Ramaswamy', ''], ['Nachiappan', 'Alamelu', '']]","['AODV', 'Bandwidth Allocation', 'Performance indices', 'VPN']"
16443,1604.06452,Tina Novak,"Tina Novak, Janez Zerovnik",Weighted domination number of cactus graphs,"17 pages, figures, submitted to Discussiones Mathematicae Graph
  Theory",,,,cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the paper, we write a linear algorithm for calculating the weighted
domination number of a vertex-weighted cactus. The algorithm is based on the
well known depth first search (DFS) structure. Our algorithm needs less than
$12n+5b$ additions and $9n+2b$ $\min$-operations where $n$ is the number of
vertices and $b$ is the number of blocks in the cactus.
","[{'version': 'v1', 'created': 'Thu, 21 Apr 2016 08:18:01 GMT'}]",2016-04-25,"[['Novak', 'Tina', ''], ['Zerovnik', 'Janez', '']]","['weighted domination problem', 'cactus graph', 'DFS structure']"
16444,1505.06292,Or Zuk,Avishai Wagner and Or Zuk,Low-Rank Matrix Recovery from Row-and-Column Affine Measurements,ICML 2015,,,,cs.LG cs.IT math.IT math.ST stat.CO stat.ML stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose and study a row-and-column affine measurement scheme for low-rank
matrix recovery. Each measurement is a linear combination of elements in one
row or one column of a matrix $X$. This setting arises naturally in
applications from different domains. However, current algorithms developed for
standard matrix recovery problems do not perform well in our case, hence the
need for developing new algorithms and theory for our problem. We propose a
simple algorithm for the problem based on Singular Value Decomposition ($SVD$)
and least-squares ($LS$), which we term \alg. We prove that (a simplified
version of) our algorithm can recover $X$ exactly with the minimum possible
number of measurements in the noiseless case. In the general noisy case, we
prove performance guarantees on the reconstruction accuracy under the Frobenius
norm. In simulations, our row-and-column design and \alg algorithm show
improved speed, and comparable and in some cases better accuracy compared to
standard measurements designs and algorithms. Our theoretical and experimental
results suggest that the proposed row-and-column affine measurements scheme,
together with our recovery algorithm, may provide a powerful framework for
affine matrix reconstruction.
","[{'version': 'v1', 'created': 'Sat, 23 May 2015 08:45:20 GMT'}]",2015-05-26,"[['Wagner', 'Avishai', ''], ['Zuk', 'Or', '']]","['low-rank matrix recovery', 'row and column measurements', 'matrix completion', 'singular value decomposition']"
16445,0711.0048,Lee Naish,Lee Naish,Declarative Diagnosis of Floundering,"12 pages, 0 figures, uses llncs.sty In Proceedings of the 17th
  Workshop on Logic-based methods in Programming Environments, Eds. Patricia
  Hill and Wim Vanhoof, pp 48-60, September 2007, Porto, Portugal",,,,cs.PL cs.SE,,"  Many logic programming languages have delay primitives which allow
coroutining. This introduces a class of bug symptoms -- computations can
flounder when they are intended to succeed or finitely fail. For concurrent
logic programs this is normally called deadlock. Similarly, constraint logic
programs can fail to invoke certain constraint solvers because variables are
insufficiently instantiated or constrained. Diagnosing such faults has received
relatively little attention to date. Since delay primitives affect the
procedural but not the declarative view of programs, it may be expected that
debugging would have to consider the often complex details of interleaved
execution. However, recent work on semantics has suggested an alternative
approach. In this paper we show how the declarative debugging paradigm can be
used to diagnose unexpected floundering, insulating the user from the
complexities of the execution.
  Keywords: logic programming, coroutining, delay, debugging, floundering,
deadlock, constraints
","[{'version': 'v1', 'created': 'Thu, 1 Nov 2007 01:40:50 GMT'}]",2007-11-06,"[['Naish', 'Lee', '']]","['logic programming', 'coroutining', 'delay', 'debugging', 'floundering', 'deadlock', 'constraints']"
16446,1606.07211,Gia-Hung Nguyen,"Gia-Hung Nguyen, Lynda Tamine, Laure Soulier, Nathalie Bricon-Souf",Toward a Deep Neural Approach for Knowledge-Based IR,,,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper tackles the problem of the semantic gap between a document and a
query within an ad-hoc information retrieval task. In this context, knowledge
bases (KBs) have already been acknowledged as valuable means since they allow
the representation of explicit relations between entities. However, they do not
necessarily represent implicit relations that could be hidden in a corpora.
This latter issue is tackled by recent works dealing with deep representation
learn ing of texts. With this in mind, we argue that embedding KBs within deep
neural architectures supporting documentquery matching would give rise to
fine-grained latent representations of both words and their semantic relations.
In this paper, we review the main approaches of neural-based document ranking
as well as those approaches for latent representation of entities and relations
via KBs. We then propose some avenues to incorporate KBs in deep neural
approaches for document ranking. More particularly, this paper advocates that
KBs can be used either to support enhanced latent representations of queries
and documents based on both distributional and relational semantics or to serve
as a semantic translator between their latent distributional representations.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2016 07:21:28 GMT'}]",2016-06-24,"[['Nguyen', 'Gia-Hung', ''], ['Tamine', 'Lynda', ''], ['Soulier', 'Laure', ''], ['Bricon-Souf', 'Nathalie', '']]","['Ad-hoc IR', 'knowledge-base', 'deep neural architecture']"
16447,0909.3445,Ingrid Falk,"Ingrid Falk (INRIA Lorraine - LORIA), Claire Gardent (INRIA Lorraine -
  LORIA), Evelyne Jacquey (ATILF), Fabienne Venant (INRIA Lorraine - LORIA)",Grouping Synonyms by Definitions,,"Recent Advances in Natural Language Processing (RANLP), Borovets :
  Bulgaria (2009)",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a method for grouping the synonyms of a lemma according to its
dictionary senses. The senses are defined by a large machine readable
dictionary for French, the TLFi (Tr\'esor de la langue fran\c{c}aise
informatis\'e) and the synonyms are given by 5 synonym dictionaries (also for
French). To evaluate the proposed method, we manually constructed a gold
standard where for each (word, definition) pair and given the set of synonyms
defined for that word by the 5 synonym dictionaries, 4 lexicographers specified
the set of synonyms they judge adequate. While inter-annotator agreement ranges
on that task from 67% to at best 88% depending on the annotator pair and on the
synonym dictionary being considered, the automatic procedure we propose scores
a precision of 67% and a recall of 71%. The proposed method is compared with
related work namely, word sense disambiguation, synonym lexicon acquisition and
WordNet construction.
","[{'version': 'v1', 'created': 'Fri, 18 Sep 2009 14:25:29 GMT'}]",2009-09-21,"[['Falk', 'Ingrid', '', 'INRIA Lorraine - LORIA'], ['Gardent', 'Claire', '', 'INRIA Lorraine -\n  LORIA'], ['Jacquey', 'Evelyne', '', 'ATILF'], ['Venant', 'Fabienne', '', 'INRIA Lorraine - LORIA']]","['Similarity measures', 'Synonyms', 'Lexical Acquisition']"
16448,1304.1005,Marius Zimand,N.V. Vinodchandran and Marius Zimand,On optimal language compression for sets in PSPACE/poly,submitted to Theory of Computing Systems,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that if DTIME[2^O(n)] is not included in DSPACE[2^o(n)], then, for
every set B in PSPACE/poly, all strings x in B of length n can be represented
by a string compressed(x) of length at most log(|B^{=n}|)+O(log n), such that a
polynomial-time algorithm, given compressed(x), can distinguish x from all the
other strings in B^{=n}. Modulo the O(log n) additive term, this achieves the
information-theoretic optimum for string compression. We also observe that
optimal compression is not possible for sets more complex than PSPACE/poly
because for any time-constructible superpolynomial function t, there is a set A
computable in space t(n) such that at least one string x of length n requires
compressed(x) to be of length 2 log(|A^=n|).
","[{'version': 'v1', 'created': 'Wed, 3 Apr 2013 16:37:02 GMT'}]",2013-04-04,"[['Vinodchandran', 'N. V.', ''], ['Zimand', 'Marius', '']]","['compression', 'time-bounded Kolmogorov complexity', 'pseudo-random generator']"
16449,1707.08913,Yong Zheng,Yong Zheng,Multi-Stakeholder Recommendation: Applications and Challenges,"Presented at the 2017 Workshop on Value-Aware and Multistakeholder
  Recommendation",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender systems have been successfully applied to assist decision making
by producing a list of item recommendations tailored to user preferences.
Traditional recommender systems only focus on optimizing the utility of the end
users who are the receiver of the recommendations. By contrast,
multi-stakeholder recommendation attempts to generate recommendations that
satisfy the needs of both the end users and other parties or stakeholders. This
paper provides an overview and discussion about the multi-stakeholder
recommendations from the perspective of practical applications, available data
sets, corresponding research challenges and potential solutions.
","[{'version': 'v1', 'created': 'Thu, 27 Jul 2017 15:52:18 GMT'}]",2017-07-28,"[['Zheng', 'Yong', '']]","['Recommender System', 'Multi-Stakeholder Recommendation', 'Utility', 'Optimization']"
16450,1108.6274,"Rainer L\""udecke","Rainer L\""udecke",Every Formula-Based Logic Program Has a Least Infinite-Valued Model,"This paper appears in the Proceedings of the 19th International
  Conference on Applications of Declarative Programming and Knowledge
  Management (INAP 2011)",,,,cs.LO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Every definite logic program has as its meaning a least Herbrand model with
respect to the program-independent ordering ""set-inclusion"". In the case of
normal logic programs there do not exist least models in general. However,
according to a recent approach by Rondogiannis and Wadge, who consider
infinite-valued models, every normal logic program does have a least model with
respect to a program-independent ordering. We show that this approach can be
extended to formula-based logic programs (i.e., finite sets of rules of the
form A\leftarrowF where A is an atom and F an arbitrary first-order formula).
We construct for a given program P an interpretation M_P and show that it is
the least of all models of P. Keywords: Logic programming, semantics of
programs, negation-as-failure, infinite-valued logics, set theory
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2011 15:47:04 GMT'}]",2011-09-01,"[['Lüdecke', 'Rainer', '']]","['Logic programming', 'semantics of programs', 'negation-as-failure', 'infinite-valuedlogics', 'set theory']"
16451,0910.2540,M. Tariq Banday,M. Tariq Banday and Tariq R. Jan,Effectiveness and Limitations of Statistical Spam Filters,"International Conference on New Trends in Statistics and
  Optimization, Organized by Department of Statistics, University of Kashmir,
  Srinagar, India, from 20th to 23rd October, 2008","International Conference on New Trends in Statistics and
  Optimization, Organized by Department of Statistics, University of Kashmir,
  Srinagar, India, from 20th to 23rd October, 2008",,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we discuss the techniques involved in the design of the famous
statistical spam filters that include Naive Bayes, Term Frequency-Inverse
Document Frequency, K-Nearest Neighbor, Support Vector Machine, and Bayes
Additive Regression Tree. We compare these techniques with each other in terms
of accuracy, recall, precision, etc. Further, we discuss the effectiveness and
limitations of statistical filters in filtering out various types of spam from
legitimate e-mails.
","[{'version': 'v1', 'created': 'Wed, 14 Oct 2009 07:43:03 GMT'}]",2009-10-15,"[['Banday', 'M. Tariq', ''], ['Jan', 'Tariq R.', '']]","['Spam', 'Anti-spam', 'Spam filter', 'Naïve Bayes', 'BART', 'TF-IDF', 'K-NN', 'SVM']"
16452,1306.4608,Luis Marujo,"Luis Marujo, Miguel Bugalho, Jo\~ao Paulo da Silva Neto, Anatole
  Gershman, Jaime Carbonell",Hourly Traffic Prediction of News Stories,"In 3rd International Workshop on Context-Aware Recommender Systems
  held as part of the 5th ACM RecSys Conference 2011",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The process of predicting news stories popularity from several news sources
has become a challenge of great importance for both news producers and readers.
In this paper, we investigate methods for automatically predicting the number
of clicks on a news story during one hour. Our approach is a combination of
additive regression and bagging applied over a M5P regression tree using a
logarithmic scale (log10). The features included are social-based (social
network metadata from Facebook), content-based (automatically extracted
keyphrases, and stylometric statistics from news titles), and time-based. In
1st Sapo Data Challenge we obtained 11.99% as mean relative error value which
put us in the 4th place out of 26 participants.
","[{'version': 'v1', 'created': 'Wed, 19 Jun 2013 16:44:16 GMT'}]",2013-06-20,"[['Marujo', 'Luis', ''], ['Bugalho', 'Miguel', ''], ['Neto', 'João Paulo da Silva', ''], ['Gershman', 'Anatole', ''], ['Carbonell', 'Jaime', '']]","['Prediction', 'News', 'Clicks', 'Sapo Challenge', 'Traffic']"
16453,1204.6696,Marius Zimand,Marius Zimand,Nonuniform Kolmogorov extractors,"This is a part of the conference paper from CCC 2011. It corrects an
  erroneus result from there, namely Theorem 4.8 (the new version has weaker
  parameters)",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We establish tight bounds on the amount on nonuniformity that is necessary
for extracting a string with randomness rate 1 from a single source of
randomness with lower randomness rate. More precisely, as instantiations of
more general results, we show that while O(1) amount of advice regarding the
source is not enough for extracting a string with randomness rate 1 from a
source string with constant subunitary random rate, \omega(1) amount of advice
is.
","[{'version': 'v1', 'created': 'Mon, 30 Apr 2012 16:42:34 GMT'}]",2012-05-01,"[['Zimand', 'Marius', '']]","['random strings', 'randomness extraction', 'Kolmogorov extractors']"
16454,1304.4758,Jan Bergstra,Jan A. Bergstra and Karl de Leeuw,Bitcoin and Beyond: Exclusively Informational Monies,"82 pages. Revision of v2: the Paragraph on monopresence and
  pseudomonopresence has been improved and extended; the paragraph on units for
  monies of account has been extended; several minor clarifications have been
  included; 8 additional references were added; improvements were made of small
  errors throughout the paper",,,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The famous new money Bitcoin is classified as a technical informational money
(TIM). Besides introducing the idea of a TIM, a more extreme notion of
informational money will be developed: exclusively informational money (EXIM).
  The informational coins (INCOs) of an EXIM can be in control of an agent but
are not owned by any agent. INCOs of an EXIM cannot be stolen, but they can be
lost, or thrown away. The difference between an EXIM and a TIM shows up when
considering a user perspective on security matters. Security for an EXIM user
is discussed in substantial detail, with the remarkable conclusion that
computer security (security models, access control, user names, passwords,
firewalls etc.) is not always essential for an EXIM, while the application of
cryptography based information security is unavoidable for the use of an EXIM.
  Bitcoin seems to meet the criteria of an EXIM, but the assertion that
""Bitcoin is an EXIM"", might also be considered problematic. As a thought
experiment we will contemplate Bitguilder, a hypothetical copy of Bitcoin that
qualifies as an EXIM.
  A business ethics assessment of Bitcoin is made which reveals a number of
worries. By combining Bitguilder with a so-called technical informational
near-money (TINM) a dual money system, having two units with a fluctuating
rate, may be obtained. It seems that a dual money can remedy some, but not all,
of the ethical worries that arise when contemplating Bitcoin after
hypothetically having become a dominant form of money.
  The contributions that Bitcoin's designers can potentially make to the
evolution of EXIMs and TIMs is analyzed in terms of the update of the portfolio
of money related natural kinds that comes with Bitcoin.
","[{'version': 'v1', 'created': 'Wed, 17 Apr 2013 10:21:55 GMT'}, {'version': 'v2', 'created': 'Sun, 12 May 2013 14:48:57 GMT'}, {'version': 'v3', 'created': 'Mon, 30 Dec 2013 16:39:27 GMT'}]",2013-12-31,"[['Bergstra', 'Jan A.', ''], ['de Leeuw', 'Karl', '']]","['informational money', 'informational coin', 'Bitcoin', 'Bitguilder', 'monopresence', 'pseudomonopresence', 'natural kind']"
16455,1410.6449,Jiahao Chen,Jiahao Chen and Alan Edelman,"Parallel Prefix Polymorphism Permits Parallelization, Presentation &
  Proof","10 pages, 3 figures. Proceedings of HPTCDL, the 1st Workshop on High
  Performance Technical Computing in Dynamic Languages, November 17, 2014, New
  Orleans, Louisiana, USA. Supporting Information available at
  http://jiahao.github.io/parallel-prefix",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Polymorphism in programming languages enables code reuse. Here, we show that
polymorphism has broad applicability far beyond computations for technical
computing: parallelism in distributed computing, presentation of visualizations
of runtime data flow, and proofs for formal verification of correctness. The
ability to reuse a single codebase for all these purposes provides new ways to
understand and verify parallel programs.
","[{'version': 'v1', 'created': 'Thu, 23 Oct 2014 18:42:57 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Nov 2014 19:27:27 GMT'}]",2014-11-07,"[['Chen', 'Jiahao', ''], ['Edelman', 'Alan', '']]","['Julia', 'prefix sum', 'scan', 'parallel prefix', 'polymorphism', 'instrumentation', 'visualization']"
16456,0707.2270,Damien Chablat,"Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)","Design of a Spherical Wrist with Parallel Architecture: Application to
  Vertebrae of an Eel Robot",,Proc. IEEE Int. Conf. Rob. and Automation (04/2005) 1-6,,,cs.RO,,"  The design of a spherical wrist with parallel architecture is the object of
this article. This study is part of a larger project, which aims to design and
to build an eel robot for inspection of immersed piping. The kinematic analysis
of the mechanism is presented first to characterize the singular configurations
as well as the isotropic configurations. We add the design constraints related
to the application, such as (i) the compactness of the mechanism, (ii) the
symmetry of the elements in order to ensure static and dynamic balance and
(iii) the possibility of the mechanism to fill the elliptic form of the ell
sections.
","[{'version': 'v1', 'created': 'Mon, 16 Jul 2007 07:41:16 GMT'}]",2007-07-17,"[['Chablat', 'Damien', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN']]","['Spherical wrist', 'parallel robots', 'isotropic design']"
16457,0903.3004,Virtudes Tom\'as,"Virtudes Tom\'as, Joachim Rosenthal and Roxana Smarandache",Decoding of MDP Convolutional Codes over the Erasure Channel,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies the decoding capabilities of maximum distance profile
(MDP) convolutional codes over the erasure channel and compares them with the
decoding capabilities of MDS block codes over the same channel. The erasure
channel involving large alphabets is an important practical channel model when
studying packet transmissions over a network, e.g, the Internet.
","[{'version': 'v1', 'created': 'Tue, 17 Mar 2009 16:54:35 GMT'}]",2009-03-18,"[['Tomás', 'Virtudes', ''], ['Rosenthal', 'Joachim', ''], ['Smarandache', 'Roxana', '']]","['Convolutional codes', 'maximum distance separable codes', 'parity check matrix', 'decoding', 'erasure channel', 'Reed-Solomon codes']"
16458,1110.1498,A S N Chakravarthy ASN CHAKRAVARTHY,"Penmetsa V. Krishna Raja, A. S. N. Chakravarthy, P. S. Avadhani",A Cryptosystem Based on Hilbert Matrix using Cipher Block Chaining Mode,"six pages; International Journal of Mathematics Trends and
  Technology- July to Aug Issue 2011",,,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cryptography is the science of using mathematics to encrypt and decrypt data.
Cryptography enables you to store sensitive information or transmit it across
insecure networks so that it cannot be read by anyone except the intended
recipient. While cryptography is the science of securing data, cryptanalysis is
the science of analyzing and breaking secure communication. Classical
cryptanalysis involves an interesting combination of analytical reasoning,
application of mathematical tools and pattern finding. The objectives of the
proposed work are to propose a new cryptographic method based on the special
matrix called the Hilbert matrix for authentication and confidentiality and to
propose a model for confidentiality and authentication using a combination of
symmetric and public cryptosystems. Further, it is extended to shared key
cryptosystems with the concept of digital enveloping using a session key. In
the present work an algorithm for shared key encryption is developed using
Hilbert matrix cryptosystem. In this the block chaining modes of operation have
been used to tackle the issues of confusion and diffusion.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2011 11:59:43 GMT'}]",2011-10-10,"[['Raja', 'Penmetsa V. Krishna', ''], ['Chakravarthy', 'A. S. N.', ''], ['Avadhani', 'P. S.', '']]","['Crypto System', 'Hilbert Matrix', 'Cipher Block Chain Encryption', 'Decryption']"
16459,0805.3935,Arnaud Martin,Arnaud Martin (E3I2),Fusion for Evaluation of Image Classification in Uncertain Environments,,"Dans Proceeding of the 9th International Conference on Information
  Fusion - Information Fusion, Florence : Italie (2006)",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present in this article a new evaluation method for classification and
segmentation of textured images in uncertain environments. In uncertain
environments, real classes and boundaries are known with only a partial
certainty given by the experts. Most of the time, in many presented papers,
only classification or only segmentation are considered and evaluated. Here, we
propose to take into account both the classification and segmentation results
according to the certainty given by the experts. We present the results of this
method on a fusion of classifiers of sonar images for a seabed
characterization.
","[{'version': 'v1', 'created': 'Mon, 26 May 2008 11:50:25 GMT'}]",2008-12-18,"[['Martin', 'Arnaud', '', 'E3I2']]","['Image classification', 'Image segmentation', 'Uncertainty environment', 'Sonar image', 'Fusion of experts', 'Fusion of classifiers']"
16460,1301.2907,Omar Khadir,Omar Khadir,Conditions on the generator for forging ElGamal signature,,"International Journal of Pure and Applied mathematics, (2011),
  Vol.70, No 7, pp.939-949",,,cs.CR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes new conditions on parameters selection that lead to an
efficient algorithm for forging ElGamal digital signature. Our work is inspired
by Bleichenbacher's ideas.
","[{'version': 'v1', 'created': 'Mon, 14 Jan 2013 10:26:13 GMT'}]",2013-01-15,"[['Khadir', 'Omar', '']]","['Public key cryptography', 'discrete logarithm problem', 'ElGamal digital signature']"
16461,1209.4408,Longfei Ma,"Longfei Ma, Xue Chen, Zhouxiang Meng",A performance Analysis of the Game of Life based on parallel algorithm,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, Conway's Game of Life using OpenMP parallel processing to
simulate several different parallel methods, experimental performance results
and compare to find the optimal solution of the parallelization of the Game of
Life. Finally pointed out the importance of the design of parallel algorithms
in solving the parallel problem.
","[{'version': 'v1', 'created': 'Thu, 20 Sep 2012 02:12:03 GMT'}]",2012-09-21,"[['Ma', 'Longfei', ''], ['Chen', 'Xue', ''], ['Meng', 'Zhouxiang', '']]","['OpenMP', 'Game of Life', 'decomposition strategy']"
16462,1407.6639,Torsten Timm,Torsten Timm,How the Voynich Manuscript was created,"96 pages, 17 figures, revised version",,,,cs.CR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Voynich manuscript is a medieval book written in an unknown script. This
paper studies the relation between similarly spelled words in the Voynich
manuscript. By means of a detailed analysis of similar spelled words it was
possible to reveal the text generation method used for the Voynich manuscript.
","[{'version': 'v1', 'created': 'Thu, 24 Jul 2014 16:26:45 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Sep 2014 17:20:37 GMT'}, {'version': 'v3', 'created': 'Wed, 9 Dec 2015 23:38:21 GMT'}]",2015-12-11,"[['Timm', 'Torsten', '']]","['Voynich manuscript', 'word grid', 'text generation method']"
16463,1005.0931,Rdv Ijcsis,"Maman Abdurohman, Kuspriyanto, Sarwono Sutikno, Arif Sasongko","The New Embedded System Design Methodology For Improving Design Process
  Performance","IEEE Publication format, International Journal of Computer Science
  and Information Security, IJCSIS, Vol. 8 No. 1, April 2010, USA. ISSN 1947
  5500, http://sites.google.com/site/ijcsis/",,,,cs.OH,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Time-to-market pressure and productivity gap force vendors and researchers to
improve embedded system design methodology. Current used design method,
Register Transfer Level (RTL), is no longer be adequate to comply with embedded
system design necessity. It needs a new methodology for facing the lack of RTL.
In this paper, a new methodology of hardware embedded system modeling process
is designed for improving design process performance using Transaction Level
Modeling (TLM). TLM is a higher abstraction design concept model above RTL
model. Parameters measured include design process time and accuracy of design.
For implementing RTL model used Avalon and Wishbone buses, both are System on
Chip bus. Performance improvement measured by comparing TLM and RTL model
process. The experiment results show performance improvements for Avalon RTL
using new design methodology are 1,03 for 3-tiers, 1,47 for 4-tiers and 1,69
for 5-tiers. Performance improvements for Wishbone RTL are 1,12 for 3-tiers,
1,17 for 4-tiers and 1,34 for 5-tiers. These results show the trend of design
process improvement.
","[{'version': 'v1', 'created': 'Thu, 6 May 2010 08:57:02 GMT'}]",2010-05-07,"[['Abdurohman', 'Maman', ''], ['Kuspriyanto', '', ''], ['Sutikno', 'Sarwono', ''], ['Sasongko', 'Arif', '']]","['Design Methodology', 'Transaction Level Modeling (TLM)', 'Register Transfer level (RTL)', 'System on Chip']"
16464,1107.0134,Vladimir Kurbalija,"Vladimir Kurbalija, Milo\v{s} Radovanovi\'c, Zoltan Geler, Mirjana
  Ivanovi\'c","The Influence of Global Constraints on Similarity Measures for
  Time-Series Databases",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A time series consists of a series of values or events obtained over repeated
measurements in time. Analysis of time series represents and important tool in
many application areas, such as stock market analysis, process and quality
control, observation of natural phenomena, medical treatments, etc. A vital
component in many types of time-series analysis is the choice of an appropriate
distance/similarity measure. Numerous measures have been proposed to date, with
the most successful ones based on dynamic programming. Being of quadratic time
complexity, however, global constraints are often employed to limit the search
space in the matrix during the dynamic programming procedure, in order to speed
up computation. Furthermore, it has been reported that such constrained
measures can also achieve better accuracy. In this paper, we investigate two
representative time-series distance/similarity measures based on dynamic
programming, Dynamic Time Warping (DTW) and Longest Common Subsequence (LCS),
and the effects of global constraints on them. Through extensive experiments on
a large number of time-series data sets, we demonstrate how global constrains
can significantly reduce the computation time of DTW and LCS. We also show
that, if the constraint parameter is tight enough (less than 10-15% of
time-series length), the constrained measure becomes significantly different
from its unconstrained counterpart, in the sense of producing qualitatively
different 1-nearest neighbor graphs. This observation explains the potential
for accuracy gains when using constrained measures, highlighting the need for
careful tuning of constraint parameters in order to achieve a good trade-off
between speed and accuracy.
","[{'version': 'v1', 'created': 'Fri, 1 Jul 2011 08:05:40 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Dec 2013 11:47:39 GMT'}]",2013-12-30,"[['Kurbalija', 'Vladimir', ''], ['Radovanović', 'Miloš', ''], ['Geler', 'Zoltan', ''], ['Ivanović', 'Mirjana', '']]","['Time Series', 'Dynamic Time Warping', 'Longest Common Subsequence', 'Edit Distance with Real Penalty', 'Edit Distance on Real sequence', 'Global Constraints']"
16465,1609.05002,Marco Danelutto,"Marco Danelutto, Massimo Torquati and Peter Kilpatrick",State access patterns in embarrassingly parallel computations,"8 pages, accepted and presented at HLPGPU 2016 (Prague, Czech
  Republic, Tuesday, Jan 19th 2016. Co-Located with HiPEAC 2016)",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a set of state access patterns suitable for managing state in
embarrassingly parallel computations on streams. The state access patterns are
useful to model typical stream parallel applications. We present a
classification of the patterns according to the extent and way in which the
state is modified. We define precisely the state access patterns and discuss
possible implementation schemas, performances and possibilities to manage
adaptivity (parallelism degree) in the patterns. We present experimental
results relative to an implementations on top of the structured parallel
programming framework FastFlow that demonstrate the feasibility and efficiency
of the proposed access patterns.
","[{'version': 'v1', 'created': 'Fri, 16 Sep 2016 11:25:37 GMT'}]",2016-09-19,"[['Danelutto', 'Marco', ''], ['Torquati', 'Massimo', ''], ['Kilpatrick', 'Peter', '']]","['structured parallel programming', 'algorithmic skeletons', 'parallel design patterns', 'stateful computations']"
16466,0906.0311,Christophe Paoli,"Christophe Paoli, Cyril Voyant, Marc Muselli, Marie-Laure Nivet","Solar radiation forecasting using ad-hoc time series preprocessing and
  neural networks","14 pages, 8 figures, 2009 International Conference on Intelligent
  Computing",,,,cs.AI cs.NA physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present an application of neural networks in the renewable
energy domain. We have developed a methodology for the daily prediction of
global solar radiation on a horizontal surface. We use an ad-hoc time series
preprocessing and a Multi-Layer Perceptron (MLP) in order to predict solar
radiation at daily horizon. First results are promising with nRMSE < 21% and
RMSE < 998 Wh/m2. Our optimized MLP presents prediction similar to or even
better than conventional methods such as ARIMA techniques, Bayesian inference,
Markov chains and k-Nearest-Neighbors approximators. Moreover we found that our
data preprocessing approach can reduce significantly forecasting errors.
","[{'version': 'v1', 'created': 'Mon, 1 Jun 2009 16:02:10 GMT'}]",2009-06-02,"[['Paoli', 'Christophe', ''], ['Voyant', 'Cyril', ''], ['Muselli', 'Marc', ''], ['Nivet', 'Marie-Laure', '']]","['Time Series', 'Preprocessing', 'Seasonality', 'Neural Networks', 'MultiLayer Perceptron']"
16467,1505.07212,Pierre Lescanne,Pierre Lescanne (LIP),Intelligent escalation and the principle of relativity,arXiv admin note: substantial text overlap with arXiv:1306.2284,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Escalation is the fact that in a game (for instance in an auction), the
agents play forever. The $0,1$-game is an extremely simple infinite game with
intelligent agents in which escalation arises. It shows at the light of
research on cognitive psychology the difference between intelligence
(algorithmic mind) and rationality (algorithmic and reflective mind) in
decision processes. It also shows that depending on the point of view (inside
or outside) the rationality of the agent may change which is proposed to be
called the principle of relativity.
","[{'version': 'v1', 'created': 'Wed, 27 May 2015 07:45:20 GMT'}]",2015-05-28,"[['Lescanne', 'Pierre', '', 'LIP']]","['economic game', 'infinite game', 'sequential game', 'extensive game', 'escalation', 'speculative bubble', 'coinduction', 'auction']"
16468,1610.09732,Kuitche Kamela Esaie,"Esaie Kuitche, Manuel Lafond and A\""ida Ouangraoua","Reconstructing protein and gene phylogenies by extending the framework
  of reconciliation","8 pages, 5 figures",,,,cs.DS q-bio.PE q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The architecture of eukaryotic coding genes allows the production of several
different protein isoforms by genes. Current gene phylogeny reconstruction
methods make use of a single protein product per gene, ignoring information on
alternative protein isoforms. These methods often lead to inaccurate gene tree
reconstructions that require to be corrected before being used in phylogenetic
tree reconciliation analyses or gene products phylogeny reconstructions. Here,
we propose a new approach for the reconstruction of accurate gene trees and
protein trees accounting for the production of alternative protein isoforms by
the genes of a gene family. We extend the concept of reconciliation to protein
trees, and we define a new reconciliation problem called MinDRGT that consists
in finding a gene tree that minimizes a double reconciliation cost with a given
protein tree and a given species tree. We define a second problem called
MinDRPGT that consists in finding a protein tree and a gene tree minimizing a
double reconciliation cost, given a species tree and a set of protein subtrees.
We provide algorithmic exact and heuristic solutions for some versions of the
problems, and we present the results of an application to the correction of
gene trees from the Ensembl database. An implementation of the heuristic method
is available at https://github.com/UdeS-CoBIUS/Protein2GeneTree.
","[{'version': 'v1', 'created': 'Sun, 30 Oct 2016 23:52:21 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Dec 2016 14:38:54 GMT'}, {'version': 'v3', 'created': 'Mon, 3 Jul 2017 18:28:28 GMT'}]",2017-07-05,"[['Kuitche', 'Esaie', ''], ['Lafond', 'Manuel', ''], ['Ouangraoua', 'Aïda', '']]","['Protein Tree', 'Gene Tree', 'Species Tree', 'Reconciliation']"
16469,1504.02356,Xavier Gir\'o-i-Nieto,"Eva Mohedano, Amaia Salvador, Sergi Porta, Xavier Gir\'o-i-Nieto,
  Graham Healy, Kevin McGuinness, Noel O'Connor and Alan F. Smeaton",Exploring EEG for Object Detection and Retrieval,"This preprint is the full version of a short paper accepted in the
  ACM International Conference on Multimedia Retrieval (ICMR) 2015 (Shanghai,
  China)",,,,cs.HC cs.CV cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper explores the potential for using Brain Computer Interfaces (BCI)
as a relevance feedback mechanism in content-based image retrieval. We
investigate if it is possible to capture useful EEG signals to detect if
relevant objects are present in a dataset of realistic and complex images. We
perform several experiments using a rapid serial visual presentation (RSVP) of
images at different rates (5Hz and 10Hz) on 8 users with different degrees of
familiarization with BCI and the dataset. We then use the feedback from the BCI
and mouse-based interfaces to retrieve localized objects in a subset of TRECVid
images. We show that it is indeed possible to detect such objects in complex
images and, also, that users with previous knowledge on the dataset or
experience with the RSVP outperform others. When the users have limited time to
annotate the images (100 seconds in our experiments) both interfaces are
comparable in performance. Comparing our best users in a retrieval task, we
found that EEG-based relevance feedback outperforms mouse-based feedback. The
realistic and complex image dataset differentiates our work from previous
studies on EEG for image retrieval.
","[{'version': 'v1', 'created': 'Thu, 9 Apr 2015 15:43:52 GMT'}]",2015-04-10,"[['Mohedano', 'Eva', ''], ['Salvador', 'Amaia', ''], ['Porta', 'Sergi', ''], ['Giró-i-Nieto', 'Xavier', ''], ['Healy', 'Graham', ''], ['McGuinness', 'Kevin', ''], [""O'Connor"", 'Noel', ''], ['Smeaton', 'Alan F.', '']]","['Brain-computer interfaces', 'Electroencephalography', 'RapidSerial Visual Presentation', 'Classification', 'Instance Retrieval']"
16470,1603.02650,Sayan Saha,Sayan Saha and A. Agung Julius,"An MILP Approach for Real-time Optimal Controller Synthesis with Metric
  Temporal Logic Specifications",American Control Conference 2016 (extended version),,,,cs.SY cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The fundamental idea of this work is to synthesize reactive controllers such
that closed-loop execution trajectories of the system satisfy desired
specifications that ensure correct system behaviors, while optimizing a desired
performance criteria. In our approach, the correctness of a system's behavior
can be defined according to the system's relation to the environment, for
example, the output trajectories of the system terminate in a goal set without
entering an unsafe set. Using Metric Temporal Logic (MTL) specifications we can
further capture complex system behaviors and timing requirements, such as the
output trajectories must pass through a number of way-points within a certain
time frame before terminating in the goal set. Given a Mixed Logical Dynamical
(MLD) system and system specifications in terms of MTL formula or simpler
reach-avoid specifications, our goal is to find a closed-loop trajectory that
satisfies the specifications, in non-deterministic environments. Using an MILP
framework we search over the space of input signals to obtain such valid
trajectories of the system, by adding constraints to satisfy the MTL formula
only when necessary, to avoid the exponential complexity of solving MILP
problems. We also present experimental results for planning a path for a mobile
robot through a dynamically changing environment with a desired task
specification.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2016 20:04:06 GMT'}]",2016-03-09,"[['Saha', 'Sayan', ''], ['Julius', 'A. Agung', '']]","['temporal logic', 'reactive controller', 'mixed integer linear programming']"
16471,1212.4804,Fawzi Nashashibi,"S\'ebastien Glaser (LIVIC), Maurice Cour, Lydie Nouveliere (IBISC),
  Alain Lambert (IEF), Fawzi Nashashibi (INRIA Rocquencourt), Jean-Christophe
  Popieul (LAMIH), Benjamin Mourllion (MIPS)","Low Speed Automation, a French Initiative",TRA (2012),,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, vehicle safety is constantly increasing thanks to the improvement
of vehicle passive and active safety. However, on a daily usage of the car,
traffic jams remains a problem. With limited space for road infrastructure,
automation of the driving task on specific situation seems to be a possible
solution. The French project ABV, which stands for low speed automation, tries
to demonstrate the feasibility of the concept and to prove the benefits. In
this article, we describe the scientific background of the project and expected
outputs.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2012 19:42:33 GMT'}]",2012-12-20,"[['Glaser', 'Sébastien', '', 'LIVIC'], ['Cour', 'Maurice', '', 'IBISC'], ['Nouveliere', 'Lydie', '', 'IBISC'], ['Lambert', 'Alain', '', 'IEF'], ['Nashashibi', 'Fawzi', '', 'INRIA Rocquencourt'], ['Popieul', 'Jean-Christophe', '', 'LAMIH'], ['Mourllion', 'Benjamin', '', 'MIPS']]","['vehicle automation', 'shared control', 'environment sensing', 'data fusion ;""']"
16472,1307.5260,Abdelhakim Herrouz,"Abdelhakim Herrouz, Chabane Khentout and Mahieddine Djoudi",Navigation Assistance and Web Accessibility Helper,"07 pages. arXiv admin note: substantial text overlap with
  arXiv:1304.2610","Herrouz, A., Khentout, C., Djoudi, M. Navigation Assistance and
  Web Accessibility Helper. IJAIEM International Journal of Application or
  Innovation in Engineering & Management, Vol.2, Issue 5, May 2013, pp.
  517-523, 2013",,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web accessibility is actually the most important aspect for providing access
to information and interaction for people with disabilities. However, it seems
that the ability of users with disabilities to navigate over the Web is not
dependent on the graphical complexity, but on the markup used to create the
structure of the website. Consequently, it is necessary to design some software
assistants to help all users to mark themselves in space during a navigation
session. In this paper, we propose an assistant for browsing on the Internet to
allow user to get one s bearings within Web navigation. We describe our
approach which puts at the disposal of the user a visited site map, thus giving
an explicit representation of virtual space. Different levels of visualization
are implemented in order to make the map more visible and less overloaded.
","[{'version': 'v1', 'created': 'Tue, 2 Jul 2013 20:04:58 GMT'}]",2013-07-22,"[['Herrouz', 'Abdelhakim', ''], ['Khentout', 'Chabane', ''], ['Djoudi', 'Mahieddine', '']]","['Web accessibility', 'navigation', 'browser', 'graphical map']"
16473,1403.1911,Toby Walsh,Toby Walsh,Candy Crush is NP-hard,,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove that playing Candy Crush to achieve a given score in a fixed number
of swaps is NP-hard.
","[{'version': 'v1', 'created': 'Sat, 8 Mar 2014 01:25:16 GMT'}]",2014-03-11,"[['Walsh', 'Toby', '']]","['computational complexity', 'NP-completeness', 'Candy Crush']"
16474,1707.07913,Piotr Szyma\'nski,"Piotr Szyma\'nski, Micha{\l} \.Zo{\l}nieruk, Piotr Oleszczyk, Igor
  Gisterek, Tomasz Kajdanowicz","Spatio-temporal profiling of public transport delays based on large
  scale vehicle positioning data from GPS in Wroc{\l}aw",accepted to KnowME2017,,,,cs.SI cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years many studies of urban mobility based on large data sets have
been published: most of them based on crowdsourced GPS data or smart-card data.
We present, what is to our knowledge the first, exploration of public transport
delay data harvested from a large-scale, official public transport positioning
system, provided by the Wroc{\l}aw Municipality. We evaluate the
characteristics of delays between stops in relation to direction, time and
delay variance of 1648 stop pairs from 15 mln delay reports. We construct a
normalized feature matrix of likelihood of a given delay change happening at a
given hour on the edge between two stops. We then calculate distances between
such matrices using earth mover's distance and cluster them using hierarchical
agglomerative clustering with Ward's linkage method. We obtain four profiles of
delay changes in Wroc{\l}aw: edges without impact on delay, edges likely to
cause delay, edges likely to decrease delay and edges likely to strongly
decrease delay (ex. when a public transport vehicle is speeding). We analyze
the spatial and mode of transport properties of each cluster and provide
insights into reasons of delay change patterns in each of the detected
profiles.
","[{'version': 'v1', 'created': 'Tue, 25 Jul 2017 10:55:33 GMT'}]",2017-07-26,"[['Szymański', 'Piotr', ''], ['Żołnieruk', 'Michał', ''], ['Oleszczyk', 'Piotr', ''], ['Gisterek', 'Igor', ''], ['Kajdanowicz', 'Tomasz', '']]","['urban mobility', 'clustering', 'urban network', 'public transport', 'delay', 'gps', 'avl', 'vehicle location']"
16475,1702.04377,Amir Ghaderi,"Ali Sharifara, Mohd Shafry Mohd Rahim, Farhad Navabifar, Dylan Ebert,
  Amir Ghaderi, Michalis Papakostas","Enhanced Facial Recognition Framework based on Skin Tone and False Alarm
  Rejection",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Face detection is one of the challenging tasks in computer vision. Human face
detection plays an essential role in the first stage of face processing
applications such as face recognition, face tracking, image database
management, etc. In these applications, face objects often come from an
inconsequential part of images that contain variations, namely different
illumination, poses, and occlusion. These variations can decrease face
detection rate noticeably. Most existing face detection approaches are not
accurate, as they have not been able to resolve unstructured images due to
large appearance variations and can only detect human faces under one
particular variation. Existing frameworks of face detection need enhancements
to detect human faces under the stated variations to improve detection rate and
reduce detection time. In this study, an enhanced face detection framework is
proposed to improve detection rate based on skin color and provide a validation
process. A preliminary segmentation of the input images based on skin color can
significantly reduce search space and accelerate the process of human face
detection. The primary detection is based on Haar-like features and the
Adaboost algorithm. A validation process is introduced to reject non-face
objects, which might occur during the face detection process. The validation
process is based on two-stage Extended Local Binary Patterns. The experimental
results on the CMU-MIT and Caltech 10000 datasets over a wide range of facial
variations in different colors, positions, scales, and lighting conditions
indicated a successful face detection rate.
","[{'version': 'v1', 'created': 'Tue, 14 Feb 2017 20:21:09 GMT'}]",2017-02-16,"[['Sharifara', 'Ali', ''], ['Rahim', 'Mohd Shafry Mohd', ''], ['Navabifar', 'Farhad', ''], ['Ebert', 'Dylan', ''], ['Ghaderi', 'Amir', ''], ['Papakostas', 'Michalis', '']]","['Computer vision', 'Face detection', 'Feature Extraction', 'Feature Matching', 'Image Processing', 'Machine learning']"
16476,1510.03090,Mauricio Toro,Mauricio Toro and Myriam Desainte-Catherine and Julien Castet,"An Extension of Interactive Scores for Multimedia Scenarios with
  Temporal Relations for Micro and Macro Controls","extended version of article presented in the Sound and Music
  Computing Conference 2012",,,,cs.MM cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software to design multimedia scenarios is usually based either on a fixed
timeline or on cue lists, but both models are unrelated temporally. On the
contrary, the formalism of interactive scores can describe multimedia scenarios
with flexible and fixed temporal relations among the objects of the scenario,
but cannot express neither temporal relations for micro controls nor signal
processing. We extend interactive scores with such relations and with sound
processing. We show some applications and we describe how they can be
implemented in Pure Data. Our implementation has low average relative jitter
even under high cpu load.
","[{'version': 'v1', 'created': 'Sun, 11 Oct 2015 19:15:56 GMT'}]",2015-10-13,"[['Toro', 'Mauricio', ''], ['Desainte-Catherine', 'Myriam', ''], ['Castet', 'Julien', '']]","['interactive scores', 'multimedia', 'interaction', 'concurrent constraint programming', 'sound processing']"
16477,1009.4880,Gerald Paul,Gerald Paul,"An Efficient Implementation of the Robust Tabu Search Heuristic for
  Sparse Quadratic Assignment Problems",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose and develop an efficient implementation of the robust tabu search
heuristic for sparse quadratic assignment problems. The traditional
implementation of the heuristic applicable to all quadratic assignment problems
is of O(N^2) complexity per iteration for problems of size N. Using multiple
priority queues to determine the next best move instead of scanning all
possible moves, and using adjacency lists to minimize the operations needed to
determine the cost of moves, we reduce the asymptotic complexity per iteration
to O(N log N ). For practical sized problems, the complexity is O(N).
","[{'version': 'v1', 'created': 'Fri, 24 Sep 2010 16:05:29 GMT'}]",2010-09-27,"[['Paul', 'Gerald', '']]","['Combinatorial optimization', 'Computing science', 'Heuristics', 'Tabu search']"
16478,1312.2606,Cong Li,"Cong Li, Michael Georgiopoulos, Georgios C. Anagnostopoulos","Multi-Task Classification Hypothesis Space with Improved Generalization
  Bounds","18 pages, 4 figures, submitted to IEEE Transactions on Neural
  Networks and Learning Systems",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a RKHS, in general, of vector-valued functions intended
to be used as hypothesis space for multi-task classification. It extends
similar hypothesis spaces that have previously considered in the literature.
Assuming this space, an improved Empirical Rademacher Complexity-based
generalization bound is derived. The analysis is itself extended to an MKL
setting. The connection between the proposed hypothesis space and a Group-Lasso
type regularizer is discussed. Finally, experimental results, with some
SVM-based Multi-Task Learning problems, underline the quality of the derived
bounds and validate the paper's analysis.
","[{'version': 'v1', 'created': 'Mon, 9 Dec 2013 21:27:23 GMT'}]",2013-12-11,"[['Li', 'Cong', ''], ['Georgiopoulos', 'Michael', ''], ['Anagnostopoulos', 'Georgios C.', '']]","['Multi-task Learning', 'Kernel Methods', 'Generalization Bound', 'Support Vector Machines']"
16479,1401.8255,Kevin Carter,"Kevin M. Carter, Hamed Okhravi, and James Riordan","Quantitative Analysis of Active Cyber Defenses Based on Temporal
  Platform Diversity",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Active cyber defenses based on temporal platform diversity have been proposed
as way to make systems more resistant to attacks. These defenses change the
properties of the platforms in order to make attacks more complicated.
Unfortunately, little work has been done on measuring the effectiveness of
these defenses. In this work, we use four different approaches to
quantitatively analyze these defenses; an abstract analysis studies the
algebraic models of a temporal platform diversity system; a set of experiments
on a test bed measures the metrics of interest for the system; a game theoretic
analysis studies the impact of preferential selection of platforms and derives
an optimal strategy; finally, a set of simulations evaluates the metrics of
interest on the models. Our results from these approaches all agree and yet are
counter-intuitive. We show that although platform diversity can mitigate some
attacks, it can be detrimental for others. We also illustrate that the benefit
from these systems heavily depends on their threat model and that the
preferential selection of platforms can achieve better protection.
","[{'version': 'v1', 'created': 'Fri, 31 Jan 2014 18:48:01 GMT'}]",2014-02-03,"[['Carter', 'Kevin M.', ''], ['Okhravi', 'Hamed', ''], ['Riordan', 'James', '']]","['Operating systems security', 'dependable and fault-tolerantsystems and networks', 'metrics', 'evaluation', 'experimentation']"
16480,1604.06985,Oswaldo Ludwig,Oswaldo Ludwig,Deep Learning with Eigenvalue Decay Regularizer,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper extends our previous work on regularization of neural networks
using Eigenvalue Decay by employing a soft approximation of the dominant
eigenvalue in order to enable the calculation of its derivatives in relation to
the synaptic weights, and therefore the application of back-propagation, which
is a primary demand for deep learning. Moreover, we extend our previous
theoretical analysis to deep neural networks and multiclass classification
problems. Our method is implemented as an additional regularizer in Keras, a
modular neural networks library written in Python, and evaluated in the
benchmark data sets Reuters Newswire Topics Classification, IMDB database for
binary sentiment classification, MNIST database of handwritten digits and
CIFAR-10 data set for image classification.
","[{'version': 'v1', 'created': 'Sun, 24 Apr 2016 05:17:04 GMT'}, {'version': 'v2', 'created': 'Sat, 30 Apr 2016 13:03:48 GMT'}, {'version': 'v3', 'created': 'Sun, 8 May 2016 10:07:34 GMT'}]",2016-05-10,"[['Ludwig', 'Oswaldo', '']]","['deep learning', 'regularization', 'classification margin', 'neural network']"
16481,1511.02258,Ze Jia Zhang,"Z. Zhang, K. Duraisamy, N. A. Gumerov","Efficient Multiscale Gaussian Process Regression using Hierarchical
  Clustering","22 pages, 9 figures. Preprint. Submitted to Machine Learning Mar.
  2016",,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Standard Gaussian Process (GP) regression, a powerful machine learning tool,
is computationally expensive when it is applied to large datasets, and
potentially inaccurate when data points are sparsely distributed in a
high-dimensional feature space. To address these challenges, a new multiscale,
sparsified GP algorithm is formulated, with the goal of application to large
scientific computing datasets. In this approach, the data is partitioned into
clusters and the cluster centers are used to define a reduced training set,
resulting in an improvement over standard GPs in terms of training and
evaluation costs. Further, a hierarchical technique is used to adaptively map
the local covariance representation to the underlying sparsity of the feature
space, leading to improved prediction accuracy when the data distribution is
highly non-uniform. A theoretical investigation of the computational complexity
of the algorithm is presented. The efficacy of this method is then demonstrated
on smooth and discontinuous analytical functions and on data from a direct
numerical simulation of turbulent combustion.
","[{'version': 'v1', 'created': 'Fri, 6 Nov 2015 23:18:13 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Mar 2016 04:20:37 GMT'}]",2016-03-08,"[['Zhang', 'Z.', ''], ['Duraisamy', 'K.', ''], ['Gumerov', 'N. A.', '']]","['Gaussian Processes', 'Sparse regression', 'Clustering']"
16482,1111.2619,Sushmita  Ruj,Sushmita Ruj and Amiya Nayak and Ivan Stojmenovic,"A Security Architecture for Data Aggregation and Access Control in Smart
  Grids","12 Pages, 3 figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an integrated architecture for smart grids, that supports data
aggregation and access control. Data can be aggregated by home area network,
building area network and neighboring area network in such a way that the
privacy of customers is protected. We use homomorphic encryption technique to
achieve this. The consumer data that is collected is sent to the substations
where it is monitored by remote terminal units (RTU). The proposed access
control mechanism gives selective access to consumer data stored in data
repositories and used by different smart grid users. Users can be maintenance
units, utility centers, pricing estimator units or analyzing and prediction
groups. We solve this problem of access control using cryptographic technique
of attribute-based encryption. RTUs and users have attributes and cryptographic
keys distributed by several key distribution centers (KDC). RTUs send data
encrypted under a set of attributes. Users can decrypt information provided
they have valid attributes. The access control scheme is distributed in nature
and does not rely on a single KDC to distribute keys. Bobba \emph{et al.}
\cite{BKAA09} proposed an access control scheme, which relies on a centralized
KDC and is thus prone to single-point failure. The other requirement is that
the KDC has to be online, during data transfer which is not required in our
scheme. Our access control scheme is collusion resistant, meaning that users
cannot collude and gain access to data, when they are not authorized to access.
We theoretically analyze our schemes and show that the computation overheads
are low enough to be carried out in smart grids. To the best of our knowledge,
ours is the first work on smart grids, which integrates these two important
security components (privacy preserving data aggregation and access control)
and presents an overall security architecture in smart grids.
","[{'version': 'v1', 'created': 'Thu, 10 Nov 2011 21:36:01 GMT'}]",2011-11-14,"[['Ruj', 'Sushmita', ''], ['Nayak', 'Amiya', ''], ['Stojmenovic', 'Ivan', '']]","['Access control', 'Decentralized attribute-basedencryption', 'Bilinear maps', 'Homomorphic Encryption', 'Smartmeters']"
16483,1108.1353,Susheel  Kumar k,"K.Susheel Kumar, Vijay Bhaskar Semwal, R C Tripathi",Real time face recognition using adaboost improved fast PCA algorithm,"14 pages; ISSN : 0975-900X (Online), 0976-2191 (Print)","International Journal of Artificial Intelligence & Applications
  (IJAIA), Vol.2, No.3, July 2011, 45-58",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an automated system for human face recognition in a real
time background world for a large homemade dataset of persons face. The task is
very difficult as the real time background subtraction in an image is still a
challenge. Addition to this there is a huge variation in human face image in
terms of size, pose and expression. The system proposed collapses most of this
variance. To detect real time human face AdaBoost with Haar cascade is used and
a simple fast PCA and LDA is used to recognize the faces detected. The matched
face is then used to mark attendance in the laboratory, in our case. This
biometric system is a real time attendance system based on the human face
recognition with a simple and fast algorithms and gaining a high accuracy
rate..
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2011 15:41:31 GMT'}]",2011-08-08,"[['Kumar', 'K. Susheel', ''], ['Semwal', 'Vijay Bhaskar', ''], ['Tripathi', 'R C', '']]","['Face recognition', 'Eigenface', 'AdaBoost', 'Haar Cascade Classifier', 'Principal Component Analysis (PCA)', 'Fast PCA', 'Linear Discriminant Analysis (LDA)']"
16484,1802.07461,Nick Haber,"Nick Haber, Damian Mrowca, Li Fei-Fei, Daniel L. K. Yamins","Emergence of Structured Behaviors from Curiosity-Based Intrinsic
  Motivation","6 pages, 5 figures",,,,cs.LG cs.AI cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Infants are experts at playing, with an amazing ability to generate novel
structured behaviors in unstructured environments that lack clear extrinsic
reward signals. We seek to replicate some of these abilities with a neural
network that implements curiosity-driven intrinsic motivation. Using a simple
but ecologically naturalistic simulated environment in which the agent can move
and interact with objects it sees, the agent learns a world model predicting
the dynamic consequences of its actions. Simultaneously, the agent learns to
take actions that adversarially challenge the developing world model, pushing
the agent to explore novel and informative interactions with its environment.
We demonstrate that this policy leads to the self-supervised emergence of a
spectrum of complex behaviors, including ego motion prediction, object
attention, and object gathering. Moreover, the world model that the agent
learns supports improved performance on object dynamics prediction and
localization tasks. Our results are a proof-of-principle that computational
models of intrinsic motivation might account for key features of developmental
visuomotor learning in infants.
","[{'version': 'v1', 'created': 'Wed, 21 Feb 2018 08:13:12 GMT'}]",2018-02-22,"[['Haber', 'Nick', ''], ['Mrowca', 'Damian', ''], ['Fei-Fei', 'Li', ''], ['Yamins', 'Daniel L. K.', '']]","['Development learning', 'Curiosity', 'Neural Network Models']"
16485,1401.5330,Mohamed A. El-Sayed,"Mohamed A. El-Sayed, S. Abdel-Khalek, and Hanan H. Amin","Study of Neural Network Algorithm for Straight-Line Drawings of Planar
  Graphs",,"International Journal of Computer Science and Information Security
  (IJCSIS) ISSN 1947-5500, Vol. 9, No. 9, pp. 13-19, 2011",,,cs.CG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph drawing addresses the problem of finding a layout of a graph that
satisfies given aesthetic and understandability objectives. The most important
objective in graph drawing is minimization of the number of crossings in the
drawing, as the aesthetics and readability of graph drawings depend on the
number of edge crossings. VLSI layouts with fewer crossings are more easily
realizable and consequently cheaper. A straight-line drawing of a planar graph
G of n vertices is a drawing of G such that each edge is drawn as a
straight-line segment without edge crossings. However, a problem with current
graph layout methods which are capable of producing satisfactory results for a
wide range of graphs is that they often put an extremely high demand on
computational resources. This paper introduces a new layout method, which
nicely draws internally convex of planar graph that consumes only little
computational resources and does not need any heavy duty preprocessing. Here,
we use two methods: The first is self organizing map known from unsupervised
neural networks which is known as (SOM) and the second method is Inverse Self
Organized Map (ISOM).
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2014 14:45:02 GMT'}]",2014-01-22,"[['El-Sayed', 'Mohamed A.', ''], ['Abdel-Khalek', 'S.', ''], ['Amin', 'Hanan H.', '']]","['SOM algorithm', 'convex graph drawing', 'straight-line drawing']"
16486,1110.3382,Tshilidzi Marwala,"I. Boulkaibet, T. Marwala, L. Mthembu, M. I. Friswell, S. Adhikari",Sampling Techniques in Bayesian Finite Element Model Updating,"Paper Accepted in the 25th International Modal Analysis Conference,
  2012",,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent papers in the field of Finite Element Model (FEM) updating have
highlighted the benefits of Bayesian techniques. The Bayesian approaches are
designed to deal with the uncertainties associated with complex systems, which
is the main problem in the development and updating of FEMs. This paper
highlights the complexities and challenges of implementing any Bayesian method
when the analysis involves a complicated structural dynamic model. In such
systems an analytical Bayesian formulation might not be available in an
analytic form; therefore this leads to the use of numerical methods, i.e.
sampling methods. The main challenge then is to determine an efficient sampling
of the model parameter space. In this paper, three sampling techniques, the
Metropolis-Hastings (MH) algorithm, Slice Sampling and the Hybrid Monte Carlo
(HMC) technique, are tested by updating a structural beam model. The efficiency
and limitations of each technique is investigated when the FEM updating problem
is implemented using the Bayesian Approach. Both MH and HMC techniques are
found to perform better than the Slice sampling when Young's modulus is chosen
as the updating parameter. The HMC method gives better results than MH and
Slice sampling techniques, when the area moment of inertias and section areas
are updated.
","[{'version': 'v1', 'created': 'Sat, 15 Oct 2011 05:17:18 GMT'}]",2011-10-18,"[['Boulkaibet', 'I.', ''], ['Marwala', 'T.', ''], ['Mthembu', 'L.', ''], ['Friswell', 'M. I.', ''], ['Adhikari', 'S.', '']]","['Bayesian', 'Sampling', 'Finite Element Model updating', 'Markov Chain Monte Carlo', 'Metropolis-Hastings']"
16487,1710.01559,Gwenole Quellec,"Hassan Al Hajj, Mathieu Lamard, Pierre-Henri Conze, B\'eatrice
  Cochener, Gwenol\'e Quellec","Monitoring tool usage in surgery videos using boosted convolutional and
  recurrent neural networks",Accepted for publication in Medical Image Analysis,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates the automatic monitoring of tool usage during a
surgery, with potential applications in report generation, surgical training
and real-time decision support. Two surgeries are considered: cataract surgery,
the most common surgical procedure, and cholecystectomy, one of the most common
digestive surgeries. Tool usage is monitored in videos recorded either through
a microscope (cataract surgery) or an endoscope (cholecystectomy). Following
state-of-the-art video analysis solutions, each frame of the video is analyzed
by convolutional neural networks (CNNs) whose outputs are fed to recurrent
neural networks (RNNs) in order to take temporal relationships between events
into account. Novelty lies in the way those CNNs and RNNs are trained.
Computational complexity prevents the end-to-end training of ""CNN+RNN"" systems.
Therefore, CNNs are usually trained first, independently from the RNNs. This
approach is clearly suboptimal for surgical tool analysis: many tools are very
similar to one another, but they can generally be differentiated based on past
events. CNNs should be trained to extract the most useful visual features in
combination with the temporal context. A novel boosting strategy is proposed to
achieve this goal: the CNN and RNN parts of the system are simultaneously
enriched by progressively adding weak classifiers (either CNNs or RNNs) trained
to improve the overall classification accuracy. Experiments were performed in a
dataset of 50 cataract surgery videos and a dataset of 80 cholecystectomy
videos. Very good classification performance are achieved in both datasets:
tool usage could be labeled with an average area under the ROC curve of $A_z =
0.9961$ and $A_z = 0.9939$, respectively, in offline mode (using past, present
and future information), and $A_z = 0.9957$ and $A_z = 0.9936$, respectively,
in online mode (using past and present information only).
","[{'version': 'v1', 'created': 'Wed, 4 Oct 2017 11:48:34 GMT'}, {'version': 'v2', 'created': 'Sun, 6 May 2018 08:21:51 GMT'}]",2018-05-08,"[['Hajj', 'Hassan Al', ''], ['Lamard', 'Mathieu', ''], ['Conze', 'Pierre-Henri', ''], ['Cochener', 'Béatrice', ''], ['Quellec', 'Gwenolé', '']]","['cataract and cholecystectomy surgeries', 'tool usage monitoring', 'video analysis', 'Convolutional and Recurrent NeuralNetworks', 'boosting']"
16488,0807.2028,Julien Hendrickx,"Vincent D. Blondel, Julien M. Hendrickx and John N. Tsitsiklis","On Krause's multi-agent consensus model with state-dependent
  connectivity (Extended version)","11 tex files, 13 eps files, 1 style file, 15 double columns pages",,,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study a model of opinion dynamics introduced by Krause: each agent has an
opinion represented by a real number, and updates its opinion by averaging all
agent opinions that differ from its own by less than 1. We give a new proof of
convergence into clusters of agents, with all agents in the same cluster
holding the same opinion. We then introduce a particular notion of equilibrium
stability and provide lower bounds on the inter-cluster distances at a stable
equilibrium. To better understand the behavior of the system when the number of
agents is large, we also introduce and study a variant involving a continuum of
agents, obtaining partial convergence results and lower bounds on inter-cluster
distances, under some mild assumptions.
","[{'version': 'v1', 'created': 'Sun, 13 Jul 2008 12:33:28 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Jan 2009 22:47:21 GMT'}, {'version': 'v3', 'created': 'Mon, 2 Feb 2009 16:45:37 GMT'}, {'version': 'v4', 'created': 'Thu, 12 Mar 2009 21:43:21 GMT'}]",2009-03-13,"[['Blondel', 'Vincent D.', ''], ['Hendrickx', 'Julien M.', ''], ['Tsitsiklis', 'John N.', '']]","['Multi-agent system', 'consensus', 'opinion dynamics', 'decentralized control']"
16489,1505.07900,Zhigang Lu,Zhigang Lu and Hong Shen,"A Faster Algorithm to Build New Users Similarity List in
  Neighbourhood-based Collaborative Filtering",,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Neighbourhood-based Collaborative Filtering (CF) has been applied in the
industry for several decades, because of the easy implementation and high
recommendation accuracy. As the core of neighbourhood-based CF, the task of
dynamically maintaining users' similarity list is challenged by cold-start
problem and scalability problem. Recently, several methods are presented on
solving the two problems. However, these methods applied an $O(n^2)$ algorithm
to compute the similarity list in a special case, where the new users, with
enough recommendation data, have the same rating list. To address the problem
of large computational cost caused by the special case, we design a faster
($O(\frac{1}{125}n^2)$) algorithm, TwinSearch Algorithm, to avoid computing and
sorting the similarity list for the new users repeatedly to save the
computational resources. Both theoretical and experimental results show that
the TwinSearch Algorithm achieves better running time than the traditional
method.
","[{'version': 'v1', 'created': 'Fri, 29 May 2015 01:21:00 GMT'}]",2015-06-01,"[['Lu', 'Zhigang', ''], ['Shen', 'Hong', '']]","['Recommender systems', 'Neighbourhood-based CollaborativeFiltering', 'Similarity computation', 'Database applications']"
16490,2006.04593,Th\'eo Ryffel,"Th\'eo Ryffel, Pierre Tholoniat, David Pointcheval and Francis Bach","ARIANN: Low-Interaction Privacy-Preserving Deep Learning via Function
  Secret Sharing",26 pages,,,,cs.LG cs.CR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose AriaNN, a low-interaction privacy-preserving framework for private
neural network training and inference on sensitive data. Our semi-honest
2-party computation protocol (with a trusted dealer) leverages function secret
sharing, a recent lightweight cryptographic protocol that allows us to achieve
an efficient online phase. We design optimized primitives for the building
blocks of neural networks such as ReLU, MaxPool and BatchNorm. For instance, we
perform private comparison for ReLU operations with a single message of the
size of the input during the online phase, and with preprocessing keys close to
4X smaller than previous work. Last, we propose an extension to support n-party
private federated learning. We implement our framework as an extensible system
on top of PyTorch that leverages CPU and GPU hardware acceleration for
cryptographic and machine learning operations. We evaluate our end-to-end
system for private inference between distant servers on standard neural
networks such as AlexNet, VGG16 or ResNet18, and for private training on
smaller networks like LeNet. We show that computation rather than communication
is the main bottleneck and that using GPUs together with reduced key size is a
promising solution to overcome this barrier.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2020 13:40:27 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Mar 2021 16:18:50 GMT'}, {'version': 'v3', 'created': 'Tue, 3 Aug 2021 13:27:44 GMT'}, {'version': 'v4', 'created': 'Thu, 28 Oct 2021 09:09:16 GMT'}]",2021-10-29,"[['Ryffel', 'Théo', ''], ['Tholoniat', 'Pierre', ''], ['Pointcheval', 'David', ''], ['Bach', 'Francis', '']]","['Multi Party Computation', 'Function SecretSharing', 'Secure Comparison', 'Deep Learning']"
16491,1011.1264,Holenstein Thomas,"Thomas Holenstein and Robin K\""unzler and Stefano Tessaro","Equivalence of the Random Oracle Model and the Ideal Cipher Model,
  Revisited","Reduced number of rounds from 18 to 14 as this is sufficient for the
  proof, improved presentation of several lemmas and introduction",,,,cs.CR cs.CC cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the cryptographic problem of constructing an invertible random
permutation from a public random function (i.e., which can be accessed by the
adversary). This goal is formalized by the notion of indifferentiability of
Maurer et al. (TCC 2004). This is the natural extension to the public setting
of the well-studied problem of building random permutations from random
functions, which was first solved by Luby and Rackoff (Siam J. Comput., '88)
using the so-called Feistel construction.
  The most important implication of such a construction is the equivalence of
the random oracle model (Bellare and Rogaway, CCS '93) and the ideal cipher
model, which is typically used in the analysis of several constructions in
symmetric cryptography.
  Coron et al. (CRYPTO 2008) gave a rather involved proof that the six-round
Feistel construction with independent random round functions is
indifferentiable from an invertible random permutation. Also, it is known that
fewer than six rounds do not suffice for indifferentiability. The first
contribution (and starting point) of our paper is a concrete distinguishing
attack which shows that the indifferentiability proof of Coron et al. is not
correct. In addition, we provide supporting evidence that an
indifferentiability proof for the six-round Feistel construction may be very
hard to find.
  To overcome this gap, our main contribution is a proof that the Feistel
construction with eigthteen rounds is indifferentiable from an invertible
random permutation. The approach of our proof relies on assigning to each of
the rounds in the construction a unique and specific role needed in the proof.
This avoids many of the problems that appear in the six-round case.
","[{'version': 'v1', 'created': 'Thu, 4 Nov 2010 20:55:27 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Jun 2011 07:59:47 GMT'}]",2011-06-02,"[['Holenstein', 'Thomas', ''], ['Künzler', 'Robin', ''], ['Tessaro', 'Stefano', '']]","['Cryptography', 'random oracle model', 'ideal cipher model', 'Feistel construction', 'indifferentiability']"
16492,1410.1059,Jiangbo Huang,Jiangbo Huang,"Programing implementation of the Quine-McCluskey method for minimization
  of Boolean expression","22 pages, 14 figures",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Boolean function is a function that produces a Boolean value output by
logical calculation of Boolean inputs. It plays key roles in programing
algorithms and design of circuits. Minimization of Boolean function is able to
optimize the algorithms and circuits. Quine-McCluskey (QM) method is one of the
most powerful techniques to simplify Boolean expressions. Compared to other
techniques, QM method is more executable and can handle more variables. In
addition, QM method is easier to be implemented in computer programs, which
makes it an efficient technique. There are several versions of QM simulation
codes online, whereas some of them appear to have limitations of variables
numbers or lack the consideration of Dont-Care conditions. Here a QM simulation
code based on C programing is introduced. Theoretically it is able to handle
any number of variables and has taken the Dont-Care conditions into account.
","[{'version': 'v1', 'created': 'Sat, 4 Oct 2014 16:44:51 GMT'}]",2014-10-07,"[['Huang', 'Jiangbo', '']]","['Boolean expression', 'Minimization', 'Boolean algebra', 'Karnaugh Map', 'Quine']"
16493,1712.04817,Dasari Kalyani,"D Siva Santosh Kumar, Dasari Kalyani",Secure Encryption scheme with key exchange for Two server Architecture,"4 pages, one figure, ICASETM-17 conference","IJERCSE, Volume 4, Issue 11, November 2017",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the distributed environment, authentication and key exchange mechanisms
play a major role. In general, for authentication, the client and the server
mutually exchange a common cryptographic key. In earlier, passwords were stored
on a single server. If an intruder gains access to the server by using some
malicious attacks, then all the passwords stored in the database be
compromised. So the e-commerce application security is endangered. In order to
improve the efficiency and performance of the authentication scheme, we
introduce multiple servers to store the passwords and participate in the key
exchange and authentication schemes. This ensures entire systems' security even
if a single server is compromised. The randomly generated nonce for each
session corresponding to two-level security mechanism where the scope of an
attacker pretends as legitimate user and login to the system is completely
restricted. In this method, passwords are stored in their equivalent hash
values and stored on multiple servers. This makes the attacker difficult to
reverse engineer and intercept to determine the password even from segments of
hash value. In this paper, we model a safe and secure password-based
authentication scheme using a key exchange.
","[{'version': 'v1', 'created': 'Wed, 29 Nov 2017 03:52:36 GMT'}]",2017-12-14,"[['Kumar', 'D Siva Santosh', ''], ['Kalyani', 'Dasari', '']]","['Authentication', 'Cryptography', 'Key exchange']"
16494,1502.06078,Radu Arsinte,"Ioan Sorin Comsa, Radu Arsinte","Evaluating QoS Parameters for IPTV Distribution in Heterogeneous
  Networks","7 pages, 19 figures",,,EM 2/2010,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The present work presents an architecture developed to evaluate the QoS
parameters for the IPTV heterogeneous network. At its very basic level lie two
software technologies: Video LAN and Windows Media Services with two operating
systems: Windows and Linux. Three types of streams are analyzed, which will be
transmitted to a Linux VLC client through means of the aggregation and access
servers. The first stream is generated in real time by a capture camera,
processed by the encapsulated VC-1 encoder and sent to the Media Server, while
the second one is of VoD(Video on Demand) type and the third one will be
handled by DVBViewer through the MPEG TS form. The first stream is transcoded
in H.264-AAC such that the Linux stations will recognize its format. Through
the simultaneous transmission of the three streams, we are analyzing their
performance from a QoS parameters point of view by means of an application
implemented in C programming language. The stream transporting the DVB-S
television content was proven to ensure the best performance regarding loss of
packets, delays and jitter.
","[{'version': 'v1', 'created': 'Sat, 21 Feb 2015 07:26:33 GMT'}]",2015-02-24,"[['Comsa', 'Ioan Sorin', ''], ['Arsinte', 'Radu', '']]","['IPTV Content', 'measurements', 'QoS', 'inter-packet delay', 'jitter', 'packet loss']"
16495,1004.0258,Lennart Nacke Ph.D.,"Sophie Stellmach, Lennart E. Nacke, Raimund Dachselt, Craig A. Lindley",Trends and Techniques in Visual Gaze Analysis,"pages 89-93, The 5th Conference on Communication by Gaze Interaction
  - COGAIN 2009: Gaze Interaction For Those Who Want It Most, ISBN:
  978-87-643-0475-6",,,,cs.HC cs.CV cs.GR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visualizing gaze data is an effective way for the quick interpretation of eye
tracking results. This paper presents a study investigation benefits and
limitations of visual gaze analysis among eye tracking professionals and
researchers. The results were used to create a tool for visual gaze analysis
within a Master's project.
","[{'version': 'v1', 'created': 'Thu, 1 Apr 2010 23:48:23 GMT'}]",2010-04-05,"[['Stellmach', 'Sophie', ''], ['Nacke', 'Lennart E.', ''], ['Dachselt', 'Raimund', ''], ['Lindley', 'Craig A.', '']]","['Gaze visualization', 'trends', 'virtual environments', 'qualitative', 'quantitative survey']"
16496,1011.1738,Harish Venkatarama Mr,Harish Sheeranalli Venkatarama and Kandasamy Chandra Sekaran,"Regulating Response Time in an Autonomic Computing System: A Comparision
  of Proportional Control and Fuzzy Control Approaches","9 pages, 7 figures, 1 table","International Journal of Artificial Intelligence & Applications
  (IJAIA) Vol. 1, No. 4, October 2010",,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ecommerce is an area where an Autonomic Computing system could be very
effectively deployed. Ecommerce has created demand for high quality information
technology services and businesses are seeking quality of service guarantees
from their service providers. These guarantees are expressed as part of service
level agreements. Properly adjusting tuning parameters for enforcement of the
service level agreement is time-consuming and skills-intensive. Moreover, in
case of changes to the workload, the setting of the parameters may no longer be
optimum. In an ecommerce system, where the workload changes frequently, there
is a need to update the parameters at regular intervals. This paper describes
two approaches, one, using a proportional controller and two, using a fuzzy
controller, to automate the tuning of MaxClients parameter of Apache web server
based on the required response time and the current workload. This is an
illustration of the self-optimizing characteristic of an autonomic computing
system.
","[{'version': 'v1', 'created': 'Mon, 8 Nov 2010 09:26:07 GMT'}]",2010-11-09,"[['Venkatarama', 'Harish Sheeranalli', ''], ['Sekaran', 'Kandasamy Chandra', '']]","['autonomic computing', 'ecommerce', 'proportional control', 'fuzzy control']"
16497,1506.08898,Junhui Hou,"Junhui Hou, Lap-Pui Chau, Nadia Magnenat-Thalmann, Ying He","Low-latency compression of mocap data using learned spatial
  decorrelation transform","15 pages, 9 figures",,,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the growing needs of human motion capture (mocap) in movie, video
games, sports, etc., it is highly desired to compress mocap data for efficient
storage and transmission. This paper presents two efficient frameworks for
compressing human mocap data with low latency. The first framework processes
the data in a frame-by-frame manner so that it is ideal for mocap data
streaming and time critical applications. The second one is clip-based and
provides a flexible tradeoff between latency and compression performance. Since
mocap data exhibits some unique spatial characteristics, we propose a very
effective transform, namely learned orthogonal transform (LOT), for reducing
the spatial redundancy. The LOT problem is formulated as minimizing square
error regularized by orthogonality and sparsity and solved via alternating
iteration. We also adopt a predictive coding and temporal DCT for temporal
decorrelation in the frame- and clip-based frameworks, respectively.
Experimental results show that the proposed frameworks can produce higher
compression performance at lower computational cost and latency than the
state-of-the-art methods.
","[{'version': 'v1', 'created': 'Mon, 29 Jun 2015 23:47:00 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Jul 2015 05:56:11 GMT'}, {'version': 'v3', 'created': 'Fri, 19 Feb 2016 02:53:43 GMT'}]",2016-02-22,"[['Hou', 'Junhui', ''], ['Chau', 'Lap-Pui', ''], ['Magnenat-Thalmann', 'Nadia', ''], ['He', 'Ying', '']]","['Motion capture', 'data compression', 'transform coding', 'low latency', 'optimization']"
16498,1412.4648,Vahid Garousi,"Vahid Garousi, Ahmet Co\c{s}kun\c{c}ay, Aysu Betin-Can, Onur
  Demir\""ors",A Survey of Software Engineering Practices in Turkey (extended version),,,,,cs.SE,http://creativecommons.org/licenses/by/3.0/,"  Context: Understanding the types of software engineering practices and
techniques used in the industry is important. There is a wide spectrum in terms
of the types and maturity of software engineering practices conducted in each
software team and company. To characterize the type of software engineering
practices conducted in software firms, a variety of surveys have been conducted
in different countries and regions. Turkey has a vibrant software industry and
it is important to characterize and understand the state of software
engineering practices in this industry. Objective: Our objective is to
characterize and grasp a high-level view on type of software engineering
practices in the Turkish software industry. Among the software engineering
practices that we have surveyed in this study are the followings: software
requirements, design, development, testing, maintenance, configuration
management, release planning and support practices. The current survey is the
most comprehensive of its type ever conducted in the context of Turkish
software industry. Method: To achieve the above objective, we systematically
designed an online survey with 46 questions based on our past experience in the
Canadian and Turkish contexts and using the Software Engineering Body of
Knowledge (SWEBOK). 202 practicing software engineers from the Turkish software
industry participated in the survey. We analyze and report in this paper the
results of the questions. Whenever possible, we also compare the trends and
results of our survey with the results of a similar 2010 survey conducted in
the Canadian software industry.
","[{'version': 'v1', 'created': 'Mon, 15 Dec 2014 15:58:15 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Dec 2014 08:11:47 GMT'}]",2014-12-17,"[['Garousi', 'Vahid', ''], ['Coşkunçay', 'Ahmet', ''], ['Betin-Can', 'Aysu', ''], ['Demirörs', 'Onur', '']]","['Survey', 'software engineering', 'industry practices', 'Turkey']"
16499,1306.0442,Imen Ayachi,"R. Kammarti (2), I. Ayachi (1), (2), M. Ksouri (2), P. Borne (1) ((1):
  LAGIS, Ecole Centrale de Lille, Villeneuve dAscq, France (2): LACS, Ecole
  Nationale des Ingenieurs de Tunis, Tunis - Belvedere. TUNISIE)",Evolutionary Approach for the Containers Bin-Packing Problem,9 pages,"Studies in Informatics and Control, Vol. 18, No. 4/2009, pages
  315-324",,,cs.NE,http://creativecommons.org/licenses/by/3.0/,"  This paper deals with the resolution of combinatorial optimization problems,
particularly those concerning the maritime transport scheduling. We are
interested in the management platforms in a river port and more specifically in
container organisation operations with a view to minimizing the number of
container rehandlings. Subsequently, we rmeet customers delivery deadlines and
we reduce ship stoppage time In this paper, we propose a genetic algorithm to
solve this problem and we present some experiments and results.
","[{'version': 'v1', 'created': 'Mon, 3 Jun 2013 14:47:11 GMT'}]",2013-06-04,"[['Kammarti', 'R.', ''], ['Ayachi', 'I.', ''], ['Ksouri', 'M.', ''], ['Borne', 'P.', '']]","['Bin-paking', 'Genetic algorithm', 'transport scheduling', 'heuristic', 'optimization', 'container']"
16500,1107.4054,Uttara Sridhar,"Sumalatha Ramachandran, Uttara Sridhar, Vidhya Srinivasan, J. Jaya
  Jothi",Data Aggregation and Privacy for Police Patrols,"12 pages, 5 figures","International Journal of Ad hoc, Sensor & Ubiquitous Computing
  (IJASUC) Vol.2, No.2, June 2011, 51-62",,,cs.CR,http://creativecommons.org/licenses/by/3.0/,"  With a widespread growth in the potential applications of Wireless Sensor
Networks, the need for reliable security mechanisms for them has increased
manifold. This paper proposes a scheme, Privacy for Police Patrols (PPP), to
provide secure data aggregation that relies on multilevel routing. Privacy
factors have been identified and implemented. Aggregates are prepared and the
summary of information is gathered and stored in a repository. The above
defined approaches are integrated in police patrol applications and preliminary
results are obtained.
","[{'version': 'v1', 'created': 'Wed, 20 Jul 2011 18:12:04 GMT'}]",2011-07-21,"[['Ramachandran', 'Sumalatha', ''], ['Sridhar', 'Uttara', ''], ['Srinivasan', 'Vidhya', ''], ['Jothi', 'J. Jaya', '']]","['WSN', 'location privacy', 'secure routing', 'context summarization', 'aggregation', 'police patrols']"
16501,1702.02406,Isabella Mastroeni,"Vincenzo Arceri, Mila Dalla Preda, Roberto Giacobazzi, Isabella
  Mastroeni",SEA: String Executability Analysis by Abstract Interpretation,"28 pages, 11 figures",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dynamic languages often employ reflection primitives to turn dynamically
generated text into executable code at run-time. These features make standard
static analysis extremely hard if not impossible because its essential data
structures, i.e., the control-flow graph and the system of recursive equations
associated with the program to analyse, are themselves dynamically mutating
objects. We introduce SEA, an abstract interpreter for automatic sound string
executability analysis of dynamic languages employing bounded (i.e, finitely
nested) reflection and dynamic code generation. Strings are statically
approximated in an abstract domain of finite state automata with basic
operations implemented as symbolic transducers. SEA combines standard program
analysis together with string executability analysis. The analysis of a call to
reflection determines a call to the same abstract interpreter over a code which
is synthesised directly from the result of the static string executability
analysis at that program point. The use of regular languages for approximating
dynamically generated code structures allows SEA to soundly approximate safety
properties of self modifying programs yet maintaining efficiency. Soundness
here means that the semantics of the code synthesised by the analyser to
resolve reflection over-approximates the semantics of the code dynamically
built at run-rime by the program at that point.
","[{'version': 'v1', 'created': 'Wed, 8 Feb 2017 12:48:54 GMT'}]",2017-02-09,"[['Arceri', 'Vincenzo', ''], ['Preda', 'Mila Dalla', ''], ['Giacobazzi', 'Roberto', ''], ['Mastroeni', 'Isabella', '']]","['Automata', 'Symbolic Transducers', 'Abstract Interpretation', 'Program Analysis', 'DynamicLanguages']"
16502,1005.4405,Isabel Rodet,"Laure He\""igeas (IMAG-INRIA Rh\^one-Alpes / GRAVIR), Annie Luciani
  (ACROE), Jo\""elle Thollot (IMAG-INRIA Rh\^one-Alpes / GRAVIR), Nicolas
  Castagn\'e (ACROE, ICA)",A physically-based particle model of emergent crowd behaviors,"Graphicon 2003, Moscou : Russian Federation (2003)",,,,cs.GR physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a modeling process in order to produce a realistic
simulation of crowds in the ancient Greek agora of Argos. This place was a
social theater in which two kinds of collective phenomena took place:
interpersonal interactions (small group discussion and negotiation, etc.) and
global collective phenomena, such as flowing and jamming. In this paper, we
focus on the second type of collective human phenomena, called non-deliberative
emergent crowd phenomena. This is a typical case of collective emergent
self-organization. When a great number of individuals move within a confined
environment and under a common fate, collective structures appear
spontaneously: jamming with inner collapses, organized flowing with queues,
curls, and vortices, propagation effects, etc. These are particularly relevant
features to enhance the realism - more precisely the ""truthfulness"" - of models
of this kind of collective phenomena. We assume that this truthfulness is
strongly associated with the concept of emergence: evolutions are not
predetermined by the individual characters, but emerge from the interaction of
numerous characters. The evolutions are not repetitive, and evolve on the basis
of small changes. This paper demonstrates that the physically-based interacting
particles system is an adequate candidate to model emergent crowd effects: it
associates a large number of elementary dynamic actors via elementary
non-linear dynamic interactions. Our model of the scene is regulated as a
large, dynamically coupled network of second order differential automata. We
take advantage of symbolic non-photorealistic and efficient visualization to
render the style of the person, rather than the person itself. As an artistic
representation, NPR reinforces the symbolic acceptance of the scene by the
observer, triggering an immediate and intuitive recognition of the scene as a
plausible scene from ancient Greece.
","[{'version': 'v1', 'created': 'Wed, 19 May 2010 06:37:24 GMT'}]",2010-05-31,"[['Heïgeas', 'Laure', '', 'IMAG-INRIA Rhône-Alpes / GRAVIR'], ['Luciani', 'Annie', '', 'ACROE'], ['Thollot', 'Joëlle', '', 'IMAG-INRIA Rhône-Alpes / GRAVIR'], ['Castagné', 'Nicolas', '', 'ACROE, ICA']]","['Crowd simulation and rendering', 'emergent behavior', 'physically-based particle model', 'image-based rendering']"
16503,1607.04564,Yi Zhou,"Yi Zhou, Li Liu, Ling Shao and Matt Mellor",DAVE: A Unified Framework for Fast Vehicle Detection and Annotation,This paper has been accepted by ECCV 2016,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vehicle detection and annotation for streaming video data with complex scenes
is an interesting but challenging task for urban traffic surveillance. In this
paper, we present a fast framework of Detection and Annotation for Vehicles
(DAVE), which effectively combines vehicle detection and attributes annotation.
DAVE consists of two convolutional neural networks (CNNs): a fast vehicle
proposal network (FVPN) for vehicle-like objects extraction and an attributes
learning network (ALN) aiming to verify each proposal and infer each vehicle's
pose, color and type simultaneously. These two nets are jointly optimized so
that abundant latent knowledge learned from the ALN can be exploited to guide
FVPN training. Once the system is trained, it can achieve efficient vehicle
detection and annotation for real-world traffic surveillance data. We evaluate
DAVE on a new self-collected UTS dataset and the public PASCAL VOC2007 car and
LISA 2010 datasets, with consistent improvements over existing algorithms.
","[{'version': 'v1', 'created': 'Fri, 15 Jul 2016 15:58:16 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Jul 2016 10:55:12 GMT'}, {'version': 'v3', 'created': 'Mon, 1 Aug 2016 08:52:55 GMT'}]",2016-08-02,"[['Zhou', 'Yi', ''], ['Liu', 'Li', ''], ['Shao', 'Ling', ''], ['Mellor', 'Matt', '']]","['Vehicle Detection', 'Attributes Annotation', 'Latent Knowledge Guidance', 'Joint Learning', 'Deep Networks']"
16504,1707.08369,Ratnik Gandhi,Ratnik Gandhi and Amoli Rajgor,Updating Singular Value Decomposition for Rank One Matrix Perturbation,,,,,cs.LG math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An efficient Singular Value Decomposition (SVD) algorithm is an important
tool for distributed and streaming computation in big data problems. It is
observed that update of singular vectors of a rank-1 perturbed matrix is
similar to a Cauchy matrix-vector product. With this observation, in this
paper, we present an efficient method for updating Singular Value Decomposition
of rank-1 perturbed matrix in $O(n^2 \ \text{log}(\frac{1}{\epsilon}))$ time.
The method uses Fast Multipole Method (FMM) for updating singular vectors in
$O(n \ \text{log} (\frac{1}{\epsilon}))$ time, where $\epsilon$ is the
precision of computation.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 10:51:22 GMT'}]",2017-07-27,"[['Gandhi', 'Ratnik', ''], ['Rajgor', 'Amoli', '']]","['Updating SVD', 'Rank-1 perturbation', 'Cauchy matrix', 'Fast']"
16505,1410.4950,Shota Nakagawa,Shota Nakagawa and Ichiro Hasuo,Near-Optimal Scheduling for LTL with Future Discounting,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the search problem for optimal schedulers for the linear temporal
logic (LTL) with future discounting. The logic, introduced by Almagor, Boker
and Kupferman, is a quantitative variant of LTL in which an event in the far
future has only discounted contribution to a truth value (that is a real number
in the unit interval [0, 1]). The precise problem we study---it naturally
arises e.g. in search for a scheduler that recovers from an internal error
state as soon as possible---is the following: given a Kripke frame, a formula
and a number in [0, 1] called a margin, find a path of the Kripke frame that is
optimal with respect to the formula up to the prescribed margin (a truly
optimal path may not exist). We present an algorithm for the problem; it works
even in the extended setting with propositional quality operators, a setting
where (threshold) model-checking is known to be undecidable.
","[{'version': 'v1', 'created': 'Sat, 18 Oct 2014 12:12:05 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Nov 2014 04:39:27 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Nov 2015 04:44:20 GMT'}, {'version': 'v4', 'created': 'Sun, 8 Nov 2015 04:28:53 GMT'}]",2015-11-10,"[['Nakagawa', 'Shota', ''], ['Hasuo', 'Ichiro', '']]","['quantitative verification', 'optimization', 'temporal logic']"
16506,1407.5902,Shanmuga Sundaram V,"N.Murugesan, O.V.Shanmuga Sundaram",Some Properties of Brzozowski Derivatives of Regular Expressions,5 pages,,,,cs.FL,http://creativecommons.org/licenses/by/3.0/,"  Brzozowski derivatives of a regular expression are developed for constructing
deterministic automata from the given regular expression in the algebraic way.
In this paper,some lemmas of the regular expressions are discussed and the
regular languages of the derivatives are illustrated. Also the generalizations
of the Brzozowski derivatives are proved as theorems with help of properties
and known results.
","[{'version': 'v1', 'created': 'Tue, 22 Jul 2014 15:26:38 GMT'}]",2014-07-23,"[['Murugesan', 'N.', ''], ['Sundaram', 'O. V. Shanmuga', '']]","['Regular expressions', 'derivatives', 'Kleene Closure']"
16507,1108.2580,Danny Bickson,"Yao Wu, Qiang Yan, Danny Bickson, Yucheng Low, Qing Yang",Efficient Multicore Collaborative Filtering,In ACM KDD CUP Workshop 2011,,,,cs.LG cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the solution method taken by LeBuSiShu team for track1
in ACM KDD CUP 2011 contest (resulting in the 5th place). We identified two
main challenges: the unique item taxonomy characteristics as well as the large
data set size.To handle the item taxonomy, we present a novel method called
Matrix Factorization Item Taxonomy Regularization (MFITR). MFITR obtained the
2nd best prediction result out of more then ten implemented algorithms. For
rapidly computing multiple solutions of various algorithms, we have implemented
an open source parallel collaborative filtering library on top of the GraphLab
machine learning framework. We report some preliminary performance results
obtained using the BlackLight supercomputer.
","[{'version': 'v1', 'created': 'Fri, 12 Aug 2011 07:22:08 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Aug 2011 11:14:42 GMT'}]",2011-08-18,"[['Wu', 'Yao', ''], ['Yan', 'Qiang', ''], ['Bickson', 'Danny', ''], ['Low', 'Yucheng', ''], ['Yang', 'Qing', '']]","['Collaborative filtering', 'matrix factorization', 'tensor factorization']"
16508,1712.04771,Wenqi Lou,"Chao Wang, Wenqi Lou, Lei Gong, Lihui Jin, Luchao Tan, Yahui Hu, Xi
  Li, Xuehai Zhou","Reconfigurable Hardware Accelerators: Opportunities, Trends, and
  Challenges",,,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the emerging big data applications of Machine Learning, Speech
Recognition, Artificial Intelligence, and DNA Sequencing in recent years,
computer architecture research communities are facing the explosive scale of
various data explosion. To achieve high efficiency of data-intensive computing,
studies of heterogeneous accelerators which focus on latest applications, have
become a hot issue in computer architecture domain. At present, the
implementation of heterogeneous accelerators mainly relies on heterogeneous
computing units such as Application-specific Integrated Circuit (ASIC),
Graphics Processing Unit (GPU), and Field Programmable Gate Array (FPGA). Among
the typical heterogeneous architectures above, FPGA-based reconfigurable
accelerators have two merits as follows: First, FPGA architecture contains a
large number of reconfigurable circuits, which satisfy requirements of high
performance and low power consumption when specific applications are running.
Second, the reconfigurable architectures of employing FPGA performs prototype
systems rapidly and features excellent customizability and reconfigurability.
Nowadays, in top-tier conferences of computer architecture, emerging a batch of
accelerating works based on FPGA or other reconfigurable architectures. To
better review the related work of reconfigurable computing accelerators
recently, this survey reserves latest high-level research products of
reconfigurable accelerator architectures and algorithm applications as the
basis. In this survey, we compare hot research issues and concern domains,
furthermore, analyze and illuminate advantages, disadvantages, and challenges
of reconfigurable accelerators. In the end, we prospect the development
tendency of accelerator architectures in the future, hoping to provide a
reference for computer architecture researchers.
","[{'version': 'v1', 'created': 'Wed, 13 Dec 2017 14:01:19 GMT'}]",2017-12-14,"[['Wang', 'Chao', ''], ['Lou', 'Wenqi', ''], ['Gong', 'Lei', ''], ['Jin', 'Lihui', ''], ['Tan', 'Luchao', ''], ['Hu', 'Yahui', ''], ['Li', 'Xi', ''], ['Zhou', 'Xuehai', '']]","['Reconfigurable Hardware Accelerator', 'Computer Architecture', 'FPGA-based Accelerator']"
16509,1003.1792,Rdv Ijcsis,"Kobkul Kularbphettong, Gareth Clayton, Phayung Meesad","A Hybrid System based on Multi-Agent System in the Data Preprocessing
  Stage","Pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS, Vol. 7 No. 2, February 2010, USA. ISSN 1947
  5500, http://sites.google.com/site/ijcsis/",,,,cs.MA,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We describe the usage of the Multi-agent system in the data preprocessing
stage of an on-going project, called e-Wedding. The aim of this project is to
utilize MAS and various approaches, like Web services, Ontology, and Data
mining techniques, in e-Business that want to improve responsiveness and
efficiency of systems so as to extract customer behavior model on Wedding
Businesses. However, in this paper, we propose and implement the
multi-agent-system, based on JADE, to only cope data preprocessing stage
specified on handle with missing value techniques. JADE is quite easy to learn
and use. Moreover, it supports many agent approaches such as agent
communication, protocol, behavior and ontology. This framework has been
experimented and evaluated in the realization of a simple, but realistic. The
results, though still preliminary, are quite.
","[{'version': 'v1', 'created': 'Tue, 9 Mar 2010 06:35:17 GMT'}]",2010-03-10,"[['Kularbphettong', 'Kobkul', ''], ['Clayton', 'Gareth', ''], ['Meesad', 'Phayung', '']]","['component; multi-agent system', 'data preprocessing stage', 'Web services', 'ontology', 'data mining techniques', 'e-Wedding', 'JADE']"
16510,1312.2378,Ramachandra Rao Kurada Mr.,Ramachandra Rao Kurada,"Unsupervised classification of uncertain data objects in spatial
  databases using computational geometry and indexing techniques",9 pages,"International Journal of Engineering Research and Applications
  (IJERA), Vol. 2, Issue 2, Mar-Apr 2012, pp.806-814, ISSN: 2248-9622",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Unsupervised classification called clustering is a process of organizing
objects into groups whose members are similar in some way. Clustering of
uncertain data objects is a challenge in spatial data bases. In this paper we
use Probability Density Functions (PDF) to represent these uncertain data
objects, and apply Uncertain K-Means algorithm to generate the clusters. This
clustering algorithm uses the Expected Distance (ED) to compute the distance
between objects and cluster representatives. To further improve the performance
of UK-Means we propose a novel technique called Voronoi Diagrams from
Computational Geometry to prune the number of computations of ED. This
technique works efficiently but results pruning overheads. In order to reduce
these in pruning overhead we introduce R*-tree indexing over these uncertain
data objects, so that it reduces the computational cost and pruning overheads.
Our novel approach of integrating UK-Means with voronoi diagrams and R* Tree
applied over uncertain data objects generates imposing outcome when compared
with the accessible methods.
","[{'version': 'v1', 'created': 'Mon, 9 Dec 2013 10:49:08 GMT'}]",2013-12-10,"[['Kurada', 'Ramachandra Rao', '']]","['Clustering', 'Indexing', 'Spatial Databases', 'Uncertain data objects', 'Voronoi diagrams']"
16511,1312.4634,Sharul Agrawal,"Sharul Agrawal, Mr. Ravi Prakash and Prof. Zunnun Narmawala","Implementation of WSN which can simultaneously monitor Temperature
  conditions and control robot for positional accuracy",,,,,cs.RO cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sensor networks and robots are both quickly evolving fields, the union of two
fields seems inherently symbiotic. Collecting data from stationary sensors can
be time consuming task and thus can be automated by adding wireless
communication capabilities to the sensors. This proposed project takes
advantage of wireless sensor networks in remote handling environment which can
send signals over far distances by using a mesh topology, transfers the data
wirelessly and also consumes low power. In this paper a testbed is created for
wireless sensor network using custom build sensor nodes for temperature
monitoring in labs and to control a robot moving in another lab. The two
temperature sensor nodes used here consists of a Arduino microcontroller and
XBee wireless communication module based on IEEE 802.15.4 standard while the
robot has inherent FPGA board as a processing unit with xbee module connected
via Rs-2332 cable for serial communication between zigbee device and FPGA. A
simple custom packet is designed so that uniformity is maintained while
collection of data from temperature nodes and a moving robot and passing to a
remote terminal. The coordinator Zigbee is connected to remote terminal (PC)
through its USB port where Graphical user interface (GUI) can be run to monitor
Temperature readings and position of Robot dynamically and save those readings
in database.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2013 04:15:13 GMT'}]",2013-12-18,"[['Agrawal', 'Sharul', ''], ['Prakash', 'Mr. Ravi', ''], ['Narmawala', 'Prof. Zunnun', '']]","['WSN', 'Zigbee', 'Temperature Nodes', 'Starter kit Robot', 'LabVIEW']"
16512,1701.08257,Nitin Malik Dr,"Smriti Tikoo, Nitin Malik","Detection of Face using Viola Jones and Recognition using Back
  Propagation Neural Network","ISSN 2320-088X, 8 pages, 5 figures, 1 table","Int J. Computer Science and Mobile Computing, vol. 5, issue 5, pp.
  288-295 (May 2016)",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detection and recognition of the facial images of people is an intricate
problem which has garnered much attention during recent years due to its ever
increasing applications in numerous fields. It continues to pose a challenge in
finding a robust solution to it. Its scope extends to catering the security,
commercial and law enforcement applications. Research for moreover a decade on
this subject has brought about remarkable development with the modus operandi
like human computer interaction, biometric analysis and content based coding of
images, videos and surveillance. A trivial task for brain but cumbersome to be
imitated artificially. The commonalities in faces does pose a problem on
various grounds but features such as skin color, gender differentiate a person
from the other. In this paper the facial detection has been carried out using
Viola-Jones algorithm and recognition of face has been done using Back
Propagation Neural Network (BPNN).
","[{'version': 'v1', 'created': 'Sat, 28 Jan 2017 05:51:44 GMT'}]",2017-01-31,"[['Tikoo', 'Smriti', ''], ['Malik', 'Nitin', '']]","['Face Recognition', 'Face detection', 'BPNN', 'Viola Jones algorithm']"
16513,1406.7811,Erik Cuevas,Erik Cuevas and Mauricio Gonzalez,"An optimization algorithm for multimodal functions inspired by
  collective animal behavior",18 Pages. arXiv admin note: text overlap with arXiv:1405.5164,"Soft Computing 17 (3) , (2013), pp. 489-502",,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interest in multimodal function optimization is expanding rapidly since real
world optimization problems often demand locating multiple optima within a
search space. This article presents a new multimodal optimization algorithm
named as the Collective Animal Behavior (CAB). Animal groups, such as schools
of fish, flocks of birds, swarms of locusts and herds of wildebeest, exhibit a
variety of behaviors including swarming about a food source, milling around a
central location or migrating over large distances in aligned groups. These
collective behaviors are often advantageous to groups, allowing them to
increase their harvesting efficiency to follow better migration routes, to
improve their aerodynamic and to avoid predation. In the proposed algorithm,
searcher agents are a group of animals which interact to each other based on
the biological laws of collective motion. Experimental results demonstrate that
the proposed algorithm is capable of finding global and local optima of
benchmark multimodal optimization problems with a higher efficiency in
comparison to other methods reported in the literature.
","[{'version': 'v1', 'created': 'Mon, 30 Jun 2014 16:48:05 GMT'}]",2014-07-01,"[['Cuevas', 'Erik', ''], ['Gonzalez', 'Mauricio', '']]","['Metaheuristic algorithms', 'Multimodal optimization', 'Evolutionary algorithms', 'Bio-inspired algorithms.   1']"
16514,1705.09283,Peng Jiao,"Lei Deng, Peng Jiao, Jing Pei, Zhenzhi Wu and Guoqi Li","GXNOR-Net: Training deep neural networks with ternary weights and
  activations without full-precision memory under a unified discretization
  framework","11 pages, 13 figures","Neural Networks(Volume 100,April 2018)",,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a pressing need to build an architecture that could subsume these
networks under a unified framework that achieves both higher performance and
less overhead. To this end, two fundamental issues are yet to be addressed. The
first one is how to implement the back propagation when neuronal activations
are discrete. The second one is how to remove the full-precision hidden weights
in the training phase to break the bottlenecks of memory/computation
consumption. To address the first issue, we present a multi-step neuronal
activation discretization method and a derivative approximation technique that
enable the implementing the back propagation algorithm on discrete DNNs. While
for the second issue, we propose a discrete state transition (DST) methodology
to constrain the weights in a discrete space without saving the hidden weights.
Through this way, we build a unified framework that subsumes the binary or
ternary networks as its special cases, and under which a heuristic algorithm is
provided at the website https://github.com/AcrossV/Gated-XNOR. More
particularly, we find that when both the weights and activations become ternary
values, the DNNs can be reduced to sparse binary networks, termed as gated XNOR
networks (GXNOR-Nets) since only the event of non-zero weight and non-zero
activation enables the control gate to start the XNOR logic operations in the
original binary networks. This promises the event-driven hardware design for
efficient mobile intelligence. We achieve advanced performance compared with
state-of-the-art algorithms. Furthermore, the computational sparsity and the
number of states in the discrete space can be flexibly modified to make it
suitable for various hardware platforms.
","[{'version': 'v1', 'created': 'Thu, 25 May 2017 17:59:41 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Jul 2017 03:01:18 GMT'}, {'version': 'v3', 'created': 'Fri, 18 Aug 2017 07:43:44 GMT'}, {'version': 'v4', 'created': 'Mon, 9 Apr 2018 05:25:13 GMT'}, {'version': 'v5', 'created': 'Wed, 2 May 2018 17:30:40 GMT'}]",2018-05-03,"[['Deng', 'Lei', ''], ['Jiao', 'Peng', ''], ['Pei', 'Jing', ''], ['Wu', 'Zhenzhi', ''], ['Li', 'Guoqi', '']]","['GXNOR-Net', 'Discrete State Transition', 'TernaryNeural Networks', 'Sparse Binary Networks']"
16515,1609.03806,Hyunseok Park,"Hyunseok Park, Christopher L. Magee","Quantitative identification of technological discontinuities using
  simulation modeling","25 pages, 13 figures",,,,cs.DL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of this paper is to develop and test metrics to quantitatively
identify technological discontinuities in a knowledge network. We developed
five metrics based on innovation theories and tested the metrics by a
simulation model-based knowledge network and hypothetically designed
discontinuity. The designed discontinuity is modeled as a node which combines
two different knowledge streams and whose knowledge is dominantly persistent in
the knowledge network. The performances of the proposed metrics were evaluated
by how well the metrics can distinguish the designed discontinuity from other
nodes on the knowledge network. The simulation results show that the
persistence times # of converging main paths provides the best performance in
identifying the designed discontinuity: the designed discontinuity was
identified as one of the top 3 patents with 96~99% probability by Metric 5 and
it is, according to the size of a domain, 12~34% better than the performance of
the second best metric. Beyond the simulation analysis, we tested the metrics
using a patent set representative of the Magnetic information storage domain.
The three representative patents associated with a well-known breakthrough
technology in the domain, the giant magneto-resistance (GMR) spin valve sensor,
were selected based on the qualitative studies, and the metrics were tested by
how well the metrics identify the selected patents as top-ranked patents. The
empirical results fully support the simulation results and therefore the
persistence times # of converging main paths is recommended for identifying
technological discontinuities for any technology.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2016 12:51:05 GMT'}]",2016-09-14,"[['Park', 'Hyunseok', ''], ['Magee', 'Christopher L.', '']]","['knowledge\tdiscontinuity', 'quantitative\tsimulation', 'knowledge\tnetworks', 'patent\tcitation\tnetworks']"
16516,1301.7320,Nathan Lemons,"Milan Bradonji\'c, Aric Hagberg, Nicolas W. Hengartner, Nathan Lemons
  and Allon G. Percus",The phase transition in inhomogeneous random intersection graphs,18 pages,,,,cs.DM math.CO math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze the component evolution in inhomogeneous random intersection
graphs when the average degree is close to 1. As the average degree increases,
the size of the largest component in the random intersection graph goes through
a phase transition. We give bounds on the size of the largest components before
and after this transition. We also prove that the largest component after the
transition is unique. These results are similar to the phase transition in
Erd\H{o}s-R\'enyi random graphs; one notable difference is that the jump in the
size of the largest component varies in size depending on the parameters of the
random intersection graph.
","[{'version': 'v1', 'created': 'Wed, 30 Jan 2013 18:31:21 GMT'}]",2013-01-31,"[['Bradonjić', 'Milan', ''], ['Hagberg', 'Aric', ''], ['Hengartner', 'Nicolas W.', ''], ['Lemons', 'Nathan', ''], ['Percus', 'Allon G.', '']]","['Random intersection graphs', 'random graphs', 'giantcomponent', 'phase transition', 'branching process']"
16517,1004.2515,Paul Williams,Paul L. Williams and Randall D. Beer,Nonnegative Decomposition of Multivariate Information,"14 pages, 9 figures",,,,cs.IT math-ph math.IT math.MP physics.bio-ph physics.data-an q-bio.NC q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Of the various attempts to generalize information theory to multiple
variables, the most widely utilized, interaction information, suffers from the
problem that it is sometimes negative. Here we reconsider from first principles
the general structure of the information that a set of sources provides about a
given variable. We begin with a new definition of redundancy as the minimum
information that any source provides about each possible outcome of the
variable, averaged over all possible outcomes. We then show how this measure of
redundancy induces a lattice over sets of sources that clarifies the general
structure of multivariate information. Finally, we use this redundancy lattice
to propose a definition of partial information atoms that exhaustively
decompose the Shannon information in a multivariate system in terms of the
redundancy between synergies of subsets of the sources. Unlike interaction
information, the atoms of our partial information decomposition are never
negative and always support a clear interpretation as informational quantities.
Our analysis also demonstrates how the negativity of interaction information
can be explained by its confounding of redundancy and synergy.
","[{'version': 'v1', 'created': 'Wed, 14 Apr 2010 22:12:52 GMT'}]",2010-04-16,"[['Williams', 'Paul L.', ''], ['Beer', 'Randall D.', '']]","['information theory', 'interaction information', 'redundancy', 'synergy', 'multivariate interaction']"
16518,1602.06260,Carlo Comin,Carlo Comin and Romeo Rizzi,"Checking Dynamic Consistency of Conditional Hyper Temporal Networks via
  Mean Payoff Games (Hardness and (pseudo) Singly-Exponential Time Algorithm)",arXiv admin note: text overlap with arXiv:1505.00828,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we introduce the \emph{Conditional Hyper Temporal Network
(CHyTN)} model, which is a natural extension and generalization of both the
\CSTN and the \HTN model. Our contribution goes as follows. We show that
deciding whether a given \CSTN or CHyTN is dynamically consistent is
\coNP-hard. Then, we offer a proof that deciding whether a given CHyTN is
dynamically consistent is \PSPACE-hard, provided that the input instances are
allowed to include both multi-head and multi-tail hyperarcs. In light of this,
we continue our study by focusing on CHyTNs that allow only multi-head or only
multi-tail hyperarcs, and we offer the first deterministic (pseudo)
singly-exponential time algorithm for the problem of checking the
dynamic-consistency of such CHyTNs, also producing a dynamic execution strategy
whenever the input CHyTN is dynamically consistent. Since \CSTN{s} are a
special case of CHyTNs, this provides as a byproduct the first
sound-and-complete (pseudo) singly-exponential time algorithm for checking
dynamic-consistency in CSTNs. The proposed algorithm is based on a novel
connection between CSTN{s}/CHyTN{s} and Mean Payoff Games. The presentation of
the connection between \CSTN{s}/CHyTNs and \MPG{s} is mediated by the \HTN
model. In order to analyze the algorithm, we introduce a refined notion of
dynamic-consistency, named $\epsilon$-dynamic-consistency, and present a sharp
lower bounding analysis on the critical value of the reaction time
$\hat{\varepsilon}$ where a \CSTN/CHyTN transits from being, to not being,
dynamically consistent. The proof technique introduced in this analysis of
$\hat{\varepsilon}$ is applicable more generally when dealing with linear
difference constraints which include strict inequalities.
","[{'version': 'v1', 'created': 'Fri, 19 Feb 2016 19:42:16 GMT'}, {'version': 'v2', 'created': 'Sat, 15 Apr 2017 19:54:54 GMT'}]",2017-04-18,"[['Comin', 'Carlo', ''], ['Rizzi', 'Romeo', '']]","['Dynamic Consistency', 'Mean Payoff Games', 'STNs', 'Hyper Temporal Networks', 'Singly-ExponentialTime', 'Reaction Time']"
16519,1005.4272,Chriss Romy,"G. Arutchelvan, S. K. Srivatsa, R. Jagannathan","Inaccuracy Minimization by Partioning Fuzzy Data Sets - Validation of
  Analystical Methodology","IEEE Publication format, International Journal of Computer Science
  and Information Security, IJCSIS, Vol. 8 No. 1, April 2010, USA. ISSN 1947
  5500, http://sites.google.com/site/ijcsis/",,,,cs.AI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In the last two decades, a number of methods have been proposed for
forecasting based on fuzzy time series. Most of the fuzzy time series methods
are presented for forecasting of car road accidents. However, the forecasting
accuracy rates of the existing methods are not good enough. In this paper, we
compared our proposed new method of fuzzy time series forecasting with existing
methods. Our method is based on means based partitioning of the historical data
of car road accidents. The proposed method belongs to the kth order and
time-variant methods. The proposed method can get the best forecasting accuracy
rate for forecasting the car road accidents than the existing methods.
","[{'version': 'v1', 'created': 'Mon, 24 May 2010 07:50:55 GMT'}]",2010-05-25,"[['Arutchelvan', 'G.', ''], ['Srivatsa', 'S. K.', ''], ['Jagannathan', 'R.', '']]","['Fuzzy sets', 'Fuzzy logical groups', 'fuzzified data', 'fuzzy                      time series.  I']"
16520,0906.3741,Lillian Lee,"Cristian Danescu-Niculescu-Mizil, Gueorgi Kossinets, Jon Kleinberg,
  Lillian Lee","How opinions are received by online communities: A case study on
  Amazon.com helpfulness votes",,"Proceedings of WWW, pp. 141--150, 2009",,,cs.CL cs.IR physics.data-an physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are many on-line settings in which users publicly express opinions. A
number of these offer mechanisms for other users to evaluate these opinions; a
canonical example is Amazon.com, where reviews come with annotations like ""26
of 32 people found the following review helpful."" Opinion evaluation appears in
many off-line settings as well, including market research and political
campaigns. Reasoning about the evaluation of an opinion is fundamentally
different from reasoning about the opinion itself: rather than asking, ""What
did Y think of X?"", we are asking, ""What did Z think of Y's opinion of X?"" Here
we develop a framework for analyzing and modeling opinion evaluation, using a
large-scale collection of Amazon book reviews as a dataset. We find that the
perceived helpfulness of a review depends not just on its content but also but
also in subtle ways on how the expressed evaluation relates to other
evaluations of the same product. As part of our approach, we develop novel
methods that take advantage of the phenomenon of review ""plagiarism"" to control
for the effects of text in opinion evaluation, and we provide a simple and
natural mathematical model consistent with our findings. Our analysis also
allows us to distinguish among the predictions of competing theories from
sociology and social psychology, and to discover unexpected differences in the
collective opinion-evaluation behavior of user populations from different
countries.
","[{'version': 'v1', 'created': 'Sun, 21 Jun 2009 01:59:21 GMT'}]",2009-06-24,"[['Danescu-Niculescu-Mizil', 'Cristian', ''], ['Kossinets', 'Gueorgi', ''], ['Kleinberg', 'Jon', ''], ['Lee', 'Lillian', '']]","['Review helpfulness', 'review utility', 'social influence', 'online communities', 'sentiment analysis', 'opinion mining', 'plagiarism']"
16521,1606.05763,Xu-Yao Zhang,Xu-Yao Zhang and Yoshua Bengio and Cheng-Lin Liu,"Online and Offline Handwritten Chinese Character Recognition: A
  Comprehensive Study and New Benchmark",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent deep learning based methods have achieved the state-of-the-art
performance for handwritten Chinese character recognition (HCCR) by learning
discriminative representations directly from raw data. Nevertheless, we believe
that the long-and-well investigated domain-specific knowledge should still help
to boost the performance of HCCR. By integrating the traditional
normalization-cooperated direction-decomposed feature map (directMap) with the
deep convolutional neural network (convNet), we are able to obtain new highest
accuracies for both online and offline HCCR on the ICDAR-2013 competition
database. With this new framework, we can eliminate the needs for data
augmentation and model ensemble, which are widely used in other systems to
achieve their best results. This makes our framework to be efficient and
effective for both training and testing. Furthermore, although
directMap+convNet can achieve the best results and surpass human-level
performance, we show that writer adaptation in this case is still effective. A
new adaptation layer is proposed to reduce the mismatch between training and
test data on a particular source layer. The adaptation process can be
efficiently and effectively implemented in an unsupervised manner. By adding
the adaptation layer into the pre-trained convNet, it can adapt to the new
handwriting styles of particular writers, and the recognition accuracy can be
further improved consistently and significantly. This paper gives an overview
and comparison of recent deep learning based approaches for HCCR, and also sets
new benchmarks for both online and offline HCCR.
","[{'version': 'v1', 'created': 'Sat, 18 Jun 2016 14:49:32 GMT'}]",2016-06-21,"[['Zhang', 'Xu-Yao', ''], ['Bengio', 'Yoshua', ''], ['Liu', 'Cheng-Lin', '']]","['Handwriting recognition', 'Chinese characters', 'online', 'offline', 'directional feature map', 'convolutional neural network', 'adaptation']"
16522,0704.3157,Giorgio Terracina,"Giorgio Terracina, Nicola Leone, Vincenzino Lio, Claudio Panetta","Experimenting with recursive queries in database and logic programming
  systems",To appear in Theory and Practice of Logic Programming (TPLP),,,,cs.AI cs.DB,,"  This paper considers the problem of reasoning on massive amounts of (possibly
distributed) data. Presently, existing proposals show some limitations: {\em
(i)} the quantity of data that can be handled contemporarily is limited, due to
the fact that reasoning is generally carried out in main-memory; {\em (ii)} the
interaction with external (and independent) DBMSs is not trivial and, in
several cases, not allowed at all; {\em (iii)} the efficiency of present
implementations is still not sufficient for their utilization in complex
reasoning tasks involving massive amounts of data. This paper provides a
contribution in this setting; it presents a new system, called DLV$^{DB}$,
which aims to solve these problems. Moreover, the paper reports the results of
a thorough experimental analysis we have carried out for comparing our system
with several state-of-the-art systems (both logic and databases) on some
classical deductive problems; the other tested systems are: LDL++, XSB, Smodels
and three top-level commercial DBMSs. DLV$^{DB}$ significantly outperforms even
the commercial Database Systems on recursive queries. To appear in Theory and
Practice of Logic Programming (TPLP)
","[{'version': 'v1', 'created': 'Tue, 24 Apr 2007 10:58:40 GMT'}]",2007-05-23,"[['Terracina', 'Giorgio', ''], ['Leone', 'Nicola', ''], ['Lio', 'Vincenzino', ''], ['Panetta', 'Claudio', '']]","['Deductive Database Systems', 'Answer Set Programming / Declarative LogicProgramming', 'Recursive Queries', 'Benchmarks']"
16523,0907.3315,Zi-Ke Zhang Mr.,"Zi-Ke Zhang, Tao Zhou",Effective Personalized Recommendation in Collaborative Tagging Systems,,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, collaborative tagging systems have attracted more and more
attention and have been widely applied in web systems. Tags provide highly
abstracted information about personal preferences and item content, and are
therefore potential to help in improving better personalized recommendations.
In this paper, we propose a tag-based recommendation algorithm considering the
personal vocabulary and evaluate it in a real-world dataset: Del.icio.us.
Experimental results demonstrate that the usage of tag information can
significantly improve the accuracy of personalized recommendations.
","[{'version': 'v1', 'created': 'Sun, 19 Jul 2009 18:56:37 GMT'}]",2009-07-21,"[['Zhang', 'Zi-Ke', ''], ['Zhou', 'Tao', '']]","['Personalized Recommendation', 'Diffusion', 'Collaborative Tagging Systems', 'Folksonomy']"
16524,1306.2284,Pierre Lescanne,Pierre Lescanne (LIP),A simple case of rationality of escalation,,"Dans CALCO 2013 - 5th Conference on Algebra and Coalgebra in
  Computer Science, CALCO 2013, Warsaw : Poland (2013)",,,cs.GT cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Escalation is the fact that in a game (for instance an auction), the agents
play forever. It is not necessary to consider complex examples to establish its
rationality. In particular, the $0,1$-game is an extremely simple infinite game
in which escalation arises naturally and rationally. In some sense, it can be
considered as the paradigm of escalation. Through an example of economic games,
we show the benefit economics can take of coinduction.
","[{'version': 'v1', 'created': 'Mon, 10 Jun 2013 19:05:47 GMT'}]",2013-06-11,"[['Lescanne', 'Pierre', '', 'LIP']]","['economic game', 'infinite game', 'sequential game', 'crash', 'escalation', 'speculative bubble', 'coinduction', 'auction']"
16525,1611.00742,Peter Henderson,"Peter Henderson, Muthucumaru Maheswaran",Chaotic Memory Randomization for Securing Embedded Systems,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Embedded systems permeate through nearly all aspects of modern society. From
cars to refrigerators to nuclear refineries, securing these systems has never
been more important. Intrusions, such as the Stuxnet malware which broke the
centrifuges in Iran's Natanz refinery, can be catastrophic to not only the
infected systems, but even to the wellbeing of the surrounding population.
Modern day protection mechanisms for these embedded systems generally look only
at protecting the network layer, and those that try to discover malware already
existing on a system typically aren't efficient enough to run on a standalone
embedded system. As such, we present a novel way to ensure that no malware has
been inserted into an embedded system. We chaotically randomize the entire
memory space of the application, interspersing watchdog-monitor programs
throughout, to monitor that the core application hasn't been infiltrated. By
validating the original program through conventional methods and creating a
clean reset, we can ensure that any inserted malware is purged from the system
with minimal effect on the given system. We also present a software prototype
to validate the possibility of this approach, but given the limitations and
vulnerabilities of the prototype, we also suggest a hardware alternative to the
system.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2016 19:40:28 GMT'}]",2016-11-03,"[['Henderson', 'Peter', ''], ['Maheswaran', 'Muthucumaru', '']]","['Chaotic Memory Randomization', 'Code Injection', 'IntrusionDetection', 'Embedded System Security']"
16526,1407.2421,Ashish Luhach Dr.,"Ashish Kr. Luhach, Sanjay K Dwivedi, C K Jha","Designing and implementing the logical security framework for e-commerce
  based on service oriented architecture",,,,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rapid evolution of information technology has contributed to the evolution of
more sophisticated E- commerce system with the better transaction time and
protection. The currently used E-commerce models lack in quality properties
such as logical security because of their poor designing and to face the highly
equipped and trained intruders. This editorial proposed a security framework
for small and medium sized E-commerce, based on service oriented architecture
and gives an analysis of the eminent security attacks which can be averted. The
proposed security framework will be implemented and validated on an open source
E-commerce, and the results achieved so far are also presented.
","[{'version': 'v1', 'created': 'Wed, 9 Jul 2014 10:20:05 GMT'}]",2014-07-10,"[['Luhach', 'Ashish Kr.', ''], ['Dwivedi', 'Sanjay K', ''], ['Jha', 'C K', '']]","['Web services', 'E-commerce', 'Simple Object Access Protocol']"
16527,1607.01752,Pavel Kucherbaev,"Pavel Kucherbaev, Azad Abad, Stefano Tranquillini, Florian Daniel,
  Maurizio Marchese, Fabio Casati",CrowdCafe - Mobile Crowdsourcing Platform,"Was published before as a part of the phd thesis by Pavel Kucherbaev
  http://eprints-phd.biblio.unitn.it/1716/",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a mobile crowdsourcing platform CrowdCafe, where
people can perform microtasks using their smartphones while they ride a bus,
travel by train, stand in a queue or wait for an appointment. These microtasks
are executed in exchange for rewards provided by local stores, such as coffee,
desserts and bus tickets. We present the concept, the implementation and the
evaluation by conducting a study with 52 participants, having 1108 tasks
completed.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2016 19:26:20 GMT'}]",2016-07-07,"[['Kucherbaev', 'Pavel', ''], ['Abad', 'Azad', ''], ['Tranquillini', 'Stefano', ''], ['Daniel', 'Florian', ''], ['Marchese', 'Maurizio', ''], ['Casati', 'Fabio', '']]","['Crowdsourcing', 'User Interfaces', 'Motivation']"
16528,1705.09710,Marcos Villagra,Marcos Villagra,A Block-Sensitivity Lower Bound for Quantum Testing Hamming Distance,"Short note, 3 pages",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Gap-Hamming distance problem is the promise problem of deciding if the
Hamming distance $h$ between two strings of length $n$ is greater than $a$ or
less than $b$, where the gap $g=|a-b|\geq 1$ and $a$ and $b$ could depend on
$n$. In this short note, we give a lower bound of $\Omega( \sqrt{n/g})$ on the
quantum query complexity of computing the Gap-Hamming distance between two
given strings of lenght $n$. The proof is a combinatorial argument based on
block sensitivity and a reduction from a threshold function.
","[{'version': 'v1', 'created': 'Fri, 26 May 2017 20:41:40 GMT'}]",2017-05-30,"[['Villagra', 'Marcos', '']]","['quantum query complexity', 'gap-Hamming distance', 'blocksensitivity']"
16529,1704.04773,He Jiang,"He Jiang, Jifeng Xuan, Zhilei Ren",Approximate Backbone Based Multilevel Algorithm for Next Release Problem,"8 pages, 3 figures, Proceedings of 12th Annual Conference on Genetic
  and Evolutionary Computation. (GECCO 2010), 2010",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The next release problem (NRP) aims to effectively select software
requirements in order to acquire maximum customer profits. As an NP-hard
problem in software requirement engineering, NRP lacks efficient approximate
algorithms for large scale instances. The backbone is a new tool for tackling
large scale NP-hard problems in recent years. In this paper, we employ the
backbone to design high performance approximate algorithms for large scale NRP
instances. Firstly we show that it is NP-hard to obtain the backbone of NRP.
Then, we illustrate by fitness landscape analysis that the backbone can be well
approximated by the shared common parts of local optimal solutions. Therefore,
we propose an approximate backbone based multilevel algorithm (ABMA) to solve
large scale NRP instances. This algorithm iteratively explores the search
spaces by multilevel reductions and refinements. Experimental results
demonstrate that ABMA outperforms existing algorithms on large instances in
terms of solution quality and running time.
","[{'version': 'v1', 'created': 'Sun, 16 Apr 2017 13:13:28 GMT'}]",2017-04-18,"[['Jiang', 'He', ''], ['Xuan', 'Jifeng', ''], ['Ren', 'Zhilei', '']]","['Next Release Problem (NRP)', 'Multilevel Algorithm', 'Requirement Engineering', 'Approximate Backbone']"
16530,1701.07396,Christian Reul,"Christian Reul, Uwe Springmann, and Frank Puppe","LAREX - A semi-automatic open-source Tool for Layout Analysis and Region
  Extraction on Early Printed Books",,,,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A semi-automatic open-source tool for layout analysis on early printed books
is presented. LAREX uses a rule based connected components approach which is
very fast, easily comprehensible for the user and allows an intuitive manual
correction if necessary. The PageXML format is used to support integration into
existing OCR workflows. Evaluations showed that LAREX provides an efficient and
flexible way to segment pages of early printed books.
","[{'version': 'v1', 'created': 'Fri, 20 Jan 2017 09:48:59 GMT'}]",2017-01-26,"[['Reul', 'Christian', ''], ['Springmann', 'Uwe', ''], ['Puppe', 'Frank', '']]","['Layout Analysis', 'Segmentation', 'Early Printed Books']"
16531,1407.2649,Alican Bozkurt,"Alican Bozkurt, Pinar Duygulu, A. Enis Cetin",Classifying Fonts and Calligraphy Styles Using Complex Wavelet Transform,,,,,cs.CV,http://creativecommons.org/licenses/by/3.0/,"  Recognizing fonts has become an important task in document analysis, due to
the increasing number of available digital documents in different fonts and
emphases. A generic font-recognition system independent of language, script and
content is desirable for processing various types of documents. At the same
time, categorizing calligraphy styles in handwritten manuscripts is important
for palaeographic analysis, but has not been studied sufficiently in the
literature. We address the font-recognition problem as analysis and
categorization of textures. We extract features using complex wavelet transform
and use support vector machines for classification. Extensive experimental
evaluations on different datasets in four languages and comparisons with
state-of-the-art studies show that our proposed method achieves higher
recognition accuracy while being computationally simpler. Furthermore, on a new
dataset generated from Ottoman manuscripts, we show that the proposed method
can also be used for categorizing Ottoman calligraphy with high accuracy.
","[{'version': 'v1', 'created': 'Wed, 9 Jul 2014 22:25:32 GMT'}]",2014-07-11,"[['Bozkurt', 'Alican', ''], ['Duygulu', 'Pinar', ''], ['Cetin', 'A. Enis', '']]","['Font-recognition', 'Calligraphy', 'Dual Tree Complex Wavelet Transform SVM', 'English', 'Arabic', 'Farsi', 'Chinese', 'Ottoman']"
16532,1009.3773,Germ\'an Vidal,Paulo Moura,Towards a Study of Meta-Predicate Semantics,"Online proceedings of the Joint Workshop on Implementation of
  Constraint Logic Programming Systems and Logic-based Methods in Programming
  Environments (CICLOPS-WLPE 2010), Edinburgh, Scotland, U.K., July 15, 2010",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe and compare design choices for meta-predicate semantics, as found
in representative Prolog module systems and in Logtalk. We look at the
consequences of these design choices from a pragmatic perspective, discussing
explicit qualification semantics, computational reflection support,
expressiveness of meta-predicate declarations, safety of meta-predicate
definitions, portability of meta-predicate definitions, and meta-predicate
performance. Our aim is to provide useful insight for debating meta-predicate
semantics and portability issues based on actual implementations and common
usage patterns.
","[{'version': 'v1', 'created': 'Mon, 20 Sep 2010 11:09:27 GMT'}]",2010-09-21,"[['Moura', 'Paulo', '']]","['meta-predicate semantics', 'modules', 'objects']"
16533,1109.3248,Miguel \'A. Carreira-Perpi\~n\'an,Miguel \'A. Carreira-Perpi\~n\'an,Reconstruction of sequential data with density models,"30 pages, 9 figures. Original manuscript dated January 27, 2004 and
  not updated since. Current author's email address:
  mcarreira-perpinan@ucmerced.edu",,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the problem of reconstructing a sequence of multidimensional
real vectors where some of the data are missing. This problem contains
regression and mapping inversion as particular cases where the pattern of
missing data is independent of the sequence index. The problem is hard because
it involves possibly multivalued mappings at each vector in the sequence, where
the missing variables can take more than one value given the present variables;
and the set of missing variables can vary from one vector to the next. To solve
this problem, we propose an algorithm based on two redundancy assumptions:
vector redundancy (the data live in a low-dimensional manifold), so that the
present variables constrain the missing ones; and sequence redundancy (e.g.
continuity), so that consecutive vectors constrain each other. We capture the
low-dimensional nature of the data in a probabilistic way with a joint density
model, here the generative topographic mapping, which results in a Gaussian
mixture. Candidate reconstructions at each vector are obtained as all the modes
of the conditional distribution of missing variables given present variables.
The reconstructed sequence is obtained by minimising a global constraint, here
the sequence length, by dynamic programming. We present experimental results
for a toy problem and for inverse kinematics of a robot arm.
","[{'version': 'v1', 'created': 'Thu, 15 Sep 2011 03:12:36 GMT'}]",2011-09-16,"[['Carreira-Perpiñán', 'Miguel Á.', '']]","['missing data reconstruction', 'multivalued (one-to-many) mappings', 'mapping inversion', 'Gaussianmixture modes', 'constraint minimisation', 'dynamic programming']"
16534,1707.07907,Markus Wulfmeier,"Markus Wulfmeier, Ingmar Posner, Pieter Abbeel",Mutual Alignment Transfer Learning,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Training robots for operation in the real world is a complex, time consuming
and potentially expensive task. Despite significant success of reinforcement
learning in games and simulations, research in real robot applications has not
been able to match similar progress. While sample complexity can be reduced by
training policies in simulation, such policies can perform sub-optimally on the
real platform given imperfect calibration of model dynamics. We present an
approach -- supplemental to fine tuning on the real robot -- to further benefit
from parallel access to a simulator during training and reduce sample
requirements on the real robot. The developed approach harnesses auxiliary
rewards to guide the exploration for the real world agent based on the
proficiency of the agent in simulation and vice versa. In this context, we
demonstrate empirically that the reciprocal alignment for both agents provides
further benefit as the agent in simulation can adjust to optimize its behaviour
for states commonly visited by the real-world agent.
","[{'version': 'v1', 'created': 'Tue, 25 Jul 2017 10:43:35 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Sep 2017 08:51:42 GMT'}, {'version': 'v3', 'created': 'Tue, 26 Sep 2017 18:26:06 GMT'}]",2017-09-28,"[['Wulfmeier', 'Markus', ''], ['Posner', 'Ingmar', ''], ['Abbeel', 'Pieter', '']]","['Transfer Learning', 'Simulation', 'Robotics', 'Adversarial Learning']"
16535,0801.0398,Shmuel Friedland,Shmuel Friedland,On the graph isomorphism problem,12 pages,,,,cs.CC cs.DM,,"  We relate the graph isomorphism problem to the solvability of certain systems
of linear equations with nonnegative variables. This version replaces the two
previous versions of this paper.
","[{'version': 'v1', 'created': 'Wed, 2 Jan 2008 14:40:02 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Jan 2008 16:36:12 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Jan 2008 09:41:35 GMT'}]",2008-01-10,"[['Friedland', 'Shmuel', '']]","['graph isomorphism', 'subgraph isomorphism', 'tensorproducts', 'doubly stochastic matrices', 'ellipsoidal algorithm']"
16536,1506.00100,Gerasimos Razis,"Gerasimos Razis, Ioannis Anagnostopoulos",Discovering similar Twitter accounts using semantics,"Draft version of paper. arXiv admin note: substantial text overlap
  with arXiv:1409.3771",,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  On daily basis, millions of Twitter accounts post a vast number of tweets
including numerous Twitter entities (mentions, replies, hashtags, photos,
URLs). Many of these entities are used in common by many accounts. The more
common entities are found in the messages of two different accounts, the more
similar, in terms of content or interest, they tend to be. Towards this
direction, we introduce a methodology for discovering and suggesting similar
Twitter accounts, based entirely on their disseminated content in terms of
Twitter entities used. The methodology is based exclusively on semantic
representation protocols and related technologies. An ontological schema is
also described towards the semantification of the Twitter accounts and their
entities.
","[{'version': 'v1', 'created': 'Sat, 30 May 2015 10:11:20 GMT'}]",2015-06-02,"[['Razis', 'Gerasimos', ''], ['Anagnostopoulos', 'Ioannis', '']]","['Similarity network', 'social semantics', 'Twitter entities']"
16537,1203.1429,Fabrizio Dabbene,"Fabrizio Dabbene, Mario Sznaier, and Roberto Tempo",Probabilistic Optimal Estimation and Filtering under Uncertainty,,,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The classical approach to system identification is based on stochastic
assumptions about the measurement error, and provides estimates that have
random nature. Worst-case identification, on the other hand, only assumes the
knowledge of deterministic error bounds, and establishes guaranteed estimates,
thus being in principle better suited for the use in control design. However, a
main limitation of such deterministic bounds lies on their potential
conservatism, thus leading to estimates of restricted use.
  In this paper, we propose a rapprochement between the stochastic and
worst-case paradigms. In particular, based on a probabilistic framework for
linear estimation problems, we derive new computational results. These results
combine elements from information-based complexity with recent developments in
the theory of randomized algorithms. The main idea in this line of research is
to ""discard"" sets of measure at most \epsilon, where \epsilon is a
probabilistic accuracy, from the set of deterministic estimates. Therefore, we
are decreasing the so-called worst-case radius of information at the expense of
a given probabilistic ``risk.""
  In this setting, we compute a trade-off curve, called violation function,
which shows how the radius of information decreases as a function of the
accuracy. To this end, we construct randomized and deterministic algorithms
which provide approximations of this function. We report extensive simulations
showing numerical comparisons between the stochastic, worst-case and
probabilistic approaches, thus demonstrating the efficacy of the methods
proposed in this paper.
","[{'version': 'v1', 'created': 'Wed, 7 Mar 2012 10:36:10 GMT'}, {'version': 'v2', 'created': 'Wed, 30 May 2012 15:02:08 GMT'}, {'version': 'v3', 'created': 'Wed, 5 Jun 2013 20:01:01 GMT'}]",2013-06-07,"[['Dabbene', 'Fabrizio', ''], ['Sznaier', 'Mario', ''], ['Tempo', 'Roberto', '']]","['Linear estimation', 'system identification', 'optimal algorithms', 'randomized algorithms', 'un']"
16538,1510.03302,Jaroslaw Szlichta,"Guilherme Damasio, Piotr Mierzejewski, Jaroslaw Szlichta, Calisto
  Zuzarte","OptImatch: Semantic Web System with Knowledge Base for Query Performance
  Problem Determination",12 pages,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Database query performance problem determination is often performed by
analyzing query execution plans (QEPs) in addition to other performance data.
As the query workloads that organizations run, have become larger and more
complex, analyzing QEPs manually even by experts has become a very time
consuming. Most performance diagnostic tools help with identifying problematic
queries and most query tuning tools address a limited number of known problems
and recommendations. We present the OptImatch system that offers a way to (a)
look for varied user defined problem patterns in QEPs and (b) automatically get
recommendations from an expert provided and user customizable knowledge base.
Existing approaches do not provide the ability to perform workload analysis
with flexible user defined patterns, as they lack the ability to impose a
proper structure on QEPs. We introduce a novel semantic web system that allows
a relatively naive user to search for arbitrary patterns and to get
recommendations stored in a knowledge base either by experts or added by the
user tailored to the environment in which they operate. Our methodology
includes transforming a QEP into an RDF graph and transforming a GUI based
user-defined pattern into a SPARQL query through handlers. The SPARQL query is
matched against the abstracted RDF graph, and any matched portion of the
abstracted RDF graph is relayed back to the user. With the knowledge base, the
OptImatch system automatically scans and matches interesting stored patterns in
a statistical way as appropriate and returns the corresponding recommendations.
Although the knowledge base patterns and solution recommendations are not in
the context of the user supplied QEPs, the context is adapted automatically
through the handler tagging interface.
","[{'version': 'v1', 'created': 'Mon, 12 Oct 2015 14:31:19 GMT'}]",2015-10-13,"[['Damasio', 'Guilherme', ''], ['Mierzejewski', 'Piotr', ''], ['Szlichta', 'Jaroslaw', ''], ['Zuzarte', 'Calisto', '']]","['Query Performance Problem Determination', 'Semantic Web', 'Knowledge Bases', 'Business Intelligence']"
16539,1111.5080,Shuai Li,"Shuai Li, Haojin Zhu, Zhaoyu Gao, Xinping Guan, Kai Xing","YouSense: Mitigating Entropy Selfishness in Distributed Collaborative
  Spectrum Sensing",at INFOCOM'13,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Collaborative spectrum sensing has been recognized as a promising approach to
improve the sensing performance via exploiting the spatial diversity of the
secondary users. In this study, a new selfishness issue is identified, that
selfish users sense no spectrum in collaborative sensing. For easier
presentation, it's denoted as entropy selfishness. This selfish behavior is
difficult to distinguish, making existing detection based incentive schemes
fail to work. To thwart entropy selfishness in distributed collaborative
sensing, we propose YouSense, a One-Time Pad (OTP) based incentive design that
could naturally isolate entropy selfish users from the honest users without
selfish node detection. The basic idea of YouSense is to construct a trapdoor
one-time pad for each sensing report by combining the original report and a
random key. Such a one-time pad based encryption could prevent entropy selfish
users from accessing the original sensing report while enabling the honest
users to recover the report. Different from traditional cryptography based OTP
which requires the key delivery, YouSense allows an honest user to recover the
pad (or key) by exploiting a unique characteristic of collaborative sensing
that different secondary users share some common observations on the same radio
spectrum. We further extend YouSense to improve the recovery successful rate by
reducing the cardinality of set of the possible pads. By extensive USRP based
experiments, we show that YouSense can successfully thwart entropy selfishness
with low system overhead.
","[{'version': 'v1', 'created': 'Tue, 22 Nov 2011 03:18:29 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Nov 2011 10:57:26 GMT'}, {'version': 'v3', 'created': 'Thu, 21 Mar 2013 20:42:58 GMT'}]",2013-03-25,"[['Li', 'Shuai', ''], ['Zhu', 'Haojin', ''], ['Gao', 'Zhaoyu', ''], ['Guan', 'Xinping', ''], ['Xing', 'Kai', '']]","['Cognitive Radio Security', 'Collaborative SpectrumSensing', 'Incentive Mechanism Design']"
16540,1708.01457,Hamid Hoorfar,Hamid Hoorfar and Alireza Bagheri,Geometric Embedding of Path and Cycle Graphs in Pseudo-convex Polygons,,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a graph $ G $ with $ n $ vertices and a set $ S $ of $ n $ points in
the plane, a point-set embedding of $ G $ on $ S $ is a planar drawing such
that each vertex of $ G $ is mapped to a distinct point of $ S $. A
straight-line point-set embedding is a point-set embedding with no edge bends
or curves. The point-set embeddability problem is NP-complete, even when $ G $
is $ 2 $-connected and $ 2 $-outerplanar. It has been solved polynomially only
for a few classes of planar graphs. Suppose that $ S $ is the set of vertices
of a simple polygon. A straight-line polygon embedding of a graph is a
straight-line point-set embedding of the graph onto the vertices of the polygon
with no crossing between edges of graph and the edges of polygon. In this
paper, we present $ O(n) $-time algorithms for polygon embedding of path and
cycle graphs in simple convex polygon and same time algorithms for polygon
embedding of path and cycle graphs in a large type of simple polygons where $n$
is the number of vertices of the polygon.
","[{'version': 'v1', 'created': 'Fri, 4 Aug 2017 11:27:22 GMT'}]",2017-08-07,"[['Hoorfar', 'Hamid', ''], ['Bagheri', 'Alireza', '']]","['graph drawing', 'point-set embedding', 'Halin graph', 'fan graph']"
16541,1402.3450,Ioannis Caragiannis,Ioannis Caragiannis and Angelo Fanelli and Nick Gravin,"Short sequences of improvement moves lead to approximate equilibria in
  constraint satisfaction games",12 pages,,,,cs.GT cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an algorithm that computes approximate pure Nash equilibria in a
broad class of constraint satisfaction games that generalize the well-known cut
and party affiliation games. Our results improve previous ones by Bhalgat et
al.~(EC 10) in terms of the obtained approximation guarantee. More importantly,
our algorithm identifies a polynomially-long sequence of improvement moves from
any initial state to an approximate equilibrium in these games. The existence
of such short sequences is an interesting structural property which, to the
best of our knowledge, was not known before. Our techniques adapt and extend
our previous work for congestion games (FOCS 11) but the current analysis is
considerably simpler.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2014 12:31:36 GMT'}]",2014-02-17,"[['Caragiannis', 'Ioannis', ''], ['Fanelli', 'Angelo', ''], ['Gravin', 'Nick', '']]","['algorithmic game theory', 'complexity of equilibria', 'pure Nash equilibrium', 'potentialgames', 'constraint satisfaction']"
16542,1609.09525,Yoann Isaac,"Yoann Isaac, Quentin Barth\'elemy, C\'edric Gouy-Pailler, Mich\`ele
  Sebag, Jamal Atif","Multi-dimensional signal approximation with sparse structured priors
  using split Bregman iterations",,,,,cs.DS cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the structurally-constrained sparse decomposition of
multi-dimensional signals onto overcomplete families of vectors, called
dictionaries. The contribution of the paper is threefold. Firstly, a generic
spatio-temporal regularization term is designed and used together with the
standard $\ell_1$ regularization term to enforce a sparse decomposition
preserving the spatio-temporal structure of the signal. Secondly, an
optimization algorithm based on the split Bregman approach is proposed to
handle the associated optimization problem, and its convergence is analyzed.
Our well-founded approach yields same accuracy as the other algorithms at the
state-of-the-art, with significant gains in terms of convergence speed.
Thirdly, the empirical validation of the approach on artificial and real-world
problems demonstrates the generality and effectiveness of the method. On
artificial problems, the proposed regularization subsumes the Total Variation
minimization and recovers the expected decomposition. On the real-world problem
of electro-encephalography brainwave decomposition, the approach outperforms
similar approaches in terms of P300 evoked potentials detection, using
structured spatial priors to guide the decomposition.
","[{'version': 'v1', 'created': 'Thu, 29 Sep 2016 20:50:16 GMT'}]",2016-10-03,"[['Isaac', 'Yoann', ''], ['Barthélemy', 'Quentin', ''], ['Gouy-Pailler', 'Cédric', ''], ['Sebag', 'Michèle', ''], ['Atif', 'Jamal', '']]","['Structured sparsity', 'overcomplete representations', 'analysis prior', 'split Bregman', 'fused-LASSO', 'EEG denoising']"
16543,1704.07860,Tom\'a\v{s} Masopust,"Tom\'a\v{s} Masopust and Markus Kr\""otzsch","Universality of Confluent, Self-Loop Deterministic Partially Ordered
  NFAs is Hard",arXiv admin note: text overlap with arXiv:1609.03460,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An automaton is partially ordered if the only cycles in its transition
diagram are self-loops. The expressivity of partially ordered NFAs (poNFAs) can
be characterized by the Straubing-Th\'erien hierarchy. Level 3/2 is recognized
by poNFAs, level 1 by confluent, self-loop deterministic poNFAs as well as by
confluent poDFAs, and level 1/2 by saturated poNFAs. We study the universality
problem for confluent, self-loop deterministic poNFAs. It asks whether an
automaton accepts all words over its alphabet. Universality for both NFAs and
poNFAs is a PSpace-complete problem. For confluent, self-loop deterministic
poNFAs, the complexity drops to coNP-complete if the alphabet is fixed but is
open if the alphabet may grow. We solve this problem by showing that it is
PSpace-complete if the alphabet may grow polynomially. Consequently, our result
provides a lower-bound complexity for some other problems, including inclusion,
equivalence, and $k$-piecewise testability. Since universality for saturated
poNFAs is easy, confluent, self-loop deterministic poNFAs are the simplest and
natural kind of NFAs characterizing a well-known class of languages, for which
deciding universality is as difficult as for general NFAs.
","[{'version': 'v1', 'created': 'Tue, 25 Apr 2017 18:44:13 GMT'}]",2017-04-27,"[['Masopust', 'Tomáš', ''], ['Krötzsch', 'Markus', '']]","['Automata', 'Universality', 'Complexity', 'Straubing-Thérien hierarchy']"
16544,1305.0896,Hemal  Shah Hemal Shah,"Hemal Shah, Yogeshwar Kosta, Vikrant Patel","Characterizing and Evaluation :Temporal properties of real and synthetic
  datasets for DTN",10 pages,,,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  Nodes movements play a significant role in disseminating messages in the
sparse mobile ad-hoc network. In the network scenarios, where traditional
end-to-end paths do not exist, mobility creates opportunities for nodes to
connect and communicate when they are encountered. A series of encountering
opportunities spread a message among many nodes and eventually deliver to the
destination. Further improvements to the performance of message delivery can
come from exploiting temporal mobility properties. It is modeled as time
varying graph, where, moving nodes are considered as vertices and contact
opportunity to other nodes as an edge. The paper discusses about
characterization and design of the temporal algorithm. Then, evaluating
temporal distance, diameter and centrality of real and synthetic mobility data
sets.
","[{'version': 'v1', 'created': 'Sat, 4 May 2013 08:42:47 GMT'}]",2013-05-07,"[['Shah', 'Hemal', ''], ['Kosta', 'Yogeshwar', ''], ['Patel', 'Vikrant', '']]","['Temporal Graph', 'Temporal Distance', 'Temporal Diameter', 'Social network', 'Real trace', 'Synthetic trace', 'Mobility models  Introduction']"
16545,1802.07830,Ana Sokolova,Ana Sokolova and Harald Woracek,Proper Semirings and Proper Convex Functors,FoSSaCS 2018 full version,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Esik and Maletti introduced the notion of a proper semiring and proved that
some important (classes of) semirings -- Noetherian semirings, natural numbers
-- are proper. Properness matters as the equivalence problem for weighted
automata over a semiring which is proper and finitely and effectively presented
is decidable. Milius generalised the notion of properness from a semiring to a
functor. As a consequence, a semiring is proper if and only if its associated
""cubic functor"" is proper. Moreover, properness of a functor renders soundness
and completeness proofs for axiomatizations of equivalent behaviour.
  In this paper we provide a method for proving properness of functors, and
instantiate it to cover both the known cases and several novel ones: (1)
properness of the semirings of positive rationals and positive reals, via
properness of the corresponding cubic functors; and (2) properness of two
functors on (positive) convex algebras. The latter functors are important for
axiomatizing trace equivalence of probabilistic transition systems. Our proofs
rely on results that stretch all the way back to Hilbert and Minkowski.
","[{'version': 'v1', 'created': 'Wed, 21 Feb 2018 22:10:37 GMT'}, {'version': 'v2', 'created': 'Sat, 24 Feb 2018 08:35:07 GMT'}]",2018-02-27,"[['Sokolova', 'Ana', ''], ['Woracek', 'Harald', '']]","['proper semirings', 'proper functors', 'coalgebra', 'weighted automata', 'probabilistic transition systems']"
16546,0801.0136,Alexandr Savinov,Alexandr Savinov,Indirect Object Representation and Access by Means of Concepts,8 pages. Related papers: http://conceptoriented.com/,"Institute of Mathematics and Computer Science, Academy of Sciences
  of Moldova, Technical Report, 2006",,,cs.PL,,"  The paper describes a mechanism for indirect object representation and access
(ORA) in programming languages. The mechanism is based on using a new
programming construct which is referred to as concept. Concept consists of one
object class and one reference class both having their fields and methods. The
object class is the conventional class as defined in OOP with instances passed
by reference. Instances of the reference class are passed by value and are
intended to represent objects. The reference classes are used to describe how
objects have to be represented and accessed by providing custom format for
their identifiers and custom access procedures. Such an approach to programming
where concepts are used instead of classes is referred to as concept-oriented
programming. It generalizes OOP and its main advantage is that it allows the
programmer to describe not only the functionality of target objects but also
intermediate functions which are executed behind the scenes as an object is
being accessed.
","[{'version': 'v1', 'created': 'Sun, 30 Dec 2007 14:56:05 GMT'}]",2008-01-03,"[['Savinov', 'Alexandr', '']]","['Indirect object representation and access', 'Concept', 'Concept-oriented programming', 'Separation of concerns']"
16547,1305.7458,Uwe Aickelin,"Chris Roadknight, Uwe Aickelin, Galina Sherman",Validation of a Microsimulation of the Port of Dover,"Journal of Computational Science 3 (1-2), 56-66, 2012",,,,cs.CE cs.AI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modelling and simulating the traffic of heavily used but secure environments
such as seaports and airports is of increasing importance. Errors made when
simulating these environments can have long standing economic, social and
environmental implications. This paper discusses issues and problems that may
arise when designing a simulation strategy. Data for the Port is presented,
methods for lightweight vehicle assessment that can be used to calibrate and
validate simulations are also discussed along with a diagnosis of
overcalibration issues. We show that decisions about where the intelligence
lies in a system has important repercussions for the reliability of system
statistics. Finally, conclusions are drawn about how microsimulations can be
moved forward as a robust planning tool for the 21st century.
","[{'version': 'v1', 'created': 'Fri, 31 May 2013 15:40:49 GMT'}]",2013-06-03,"[['Roadknight', 'Chris', ''], ['Aickelin', 'Uwe', ''], ['Sherman', 'Galina', '']]","['Simulation', 'Transport', 'Operations Research', 'Agents']"
16548,1502.04380,Ling Chen,"Maosheng Jiang, Yonxiang Chen, Ling Chen","Link Prediction in Networks with Nodes Attributes by Similarity
  Propagation","13 pages, 2 tables. arXiv admin note: text overlap with
  arXiv:1112.3265 by other authors",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of link prediction has attracted considerable recent attention
from various domains such as sociology, anthropology, information science, and
computer sciences. A link prediction algorithm is proposed based on link
similarity score propagation by a random walk in networks with nodes
attributes. In the algorithm, each link in the network is assigned a
transmission probability according to the similarity of the attributes on the
nodes connected by the link. The link similarity score between the nodes are
then propagated via the links according to their transmission probability. Our
experimental results show that it can obtain higher quality results on the
networks with node attributes than other algorithms.
","[{'version': 'v1', 'created': 'Sun, 15 Feb 2015 23:13:24 GMT'}]",2015-02-17,"[['Jiang', 'Maosheng', ''], ['Chen', 'Yonxiang', ''], ['Chen', 'Ling', '']]","['link prediction', 'community', 'modularity', 'complex networks   1']"
16549,1603.03886,Andrea Cerri,"Andrea Cerri, Marc Ethier and Patrizio Frosini",The coherent matching distance in 2D persistent homology,"11 pages, 1 figure",,,,cs.CG math.AT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Comparison between multidimensional persistent Betti numbers is often based
on the multidimensional matching distance. While this metric is rather simple
to define and compute by considering a suitable family of filtering functions
associated with lines having a positive slope, it has two main drawbacks.
First, it forgets the natural link between the homological properties of
filtrations associated with lines that are close to each other. As a
consequence, part of the interesting homological information is lost. Second,
its intrinsically discontinuous definition makes it difficult to study its
properties. In this paper we introduce a new matching distance for 2D
persistent Betti numbers, called coherent matching distance and based on
matchings that change coherently with the filtrations we take into account. Its
definition is not trivial, as it must face the presence of monodromy in
multidimensional persistence, i.e. the fact that different paths in the space
parameterizing the above filtrations can induce different matchings between the
associated persistent diagrams. In our paper we prove that the coherent 2D
matching distance is well-defined and stable.
","[{'version': 'v1', 'created': 'Sat, 12 Mar 2016 10:40:23 GMT'}]",2016-03-15,"[['Cerri', 'Andrea', ''], ['Ethier', 'Marc', ''], ['Frosini', 'Patrizio', '']]","['Multidimensional matching distance', 'multidimensional persistent Betti numbers', 'monodromy']"
16550,1111.1644,Philippe Gaborit,"Carlos Aguilar, Philippe Gaborit, Julien Schrek","A new zero-knowledge code based identification scheme with reduced
  communication",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a new 5-pass identification scheme with asymptotic
cheating probability 1/2 based on the syndrome decoding problem. Our protocol
is related to the Stern identification scheme but has a reduced communication
cost compared to previous code-based zero-knowledge schemes, moreover our
scheme permits to obtain a very low size of public key and secret key. The
contribution of this paper is twofold, first we propose a variation on the
Stern authentication scheme which permits to decrease asymptotically the
cheating probability to 1/2 rather than 2/3 (and very close to 1/2 in practice)
but with less communication. Our solution is based on deriving new challenges
from the secret key through cyclic shifts of the initial public key syndrome; a
new proof of soundness for this case is given Secondly we propose a new way to
deal with hashed commitments in zero-knowledge schemes based on Stern's scheme,
so that in terms of communication, on the average, only one hash value is sent
rather than two or three. Overall our new scheme has the good features of
having a zero-knowledge security proof based on well known hard problem of
coding theory, a small size of secret and public key (a few hundred bits), a
small calculation complexity, for an overall communication cost of 19kb for
authentication (for a $2^{16}$ security) and a signature of size of 93kb
(11.5kB) (for security $2^{80}$), an improvement of 40% compared to previous
schemes based on coding theory.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2011 17:02:04 GMT'}]",2011-11-08,"[['Aguilar', 'Carlos', ''], ['Gaborit', 'Philippe', ''], ['Schrek', 'Julien', '']]","['Zero-knowledge protocols', 'codingtheory', 'Stern SD scheme']"
16551,1511.06905,Anjeneya Swami Kare Mr.,Anjeneya Swami Kare,A Simple Algorithm For Replacement Paths Problem,11 pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let G=(V,E)(|V|=n and |E|=m) be an undirected graph with positive edge
weights. Let P_{G}(s, t) be a shortest s-t path in G. Let l be the number of
edges in P_{G}(s, t). The \emph{Edge Replacement Path} problem is to compute a
shortest s-t path in G\{e}, for every edge e in P_{G}(s, t). The \emph{Node
Replacement Path} problem is to compute a shortest s-t path in G\{v}, for every
vertex v in P_{G}(s, t). In this paper we present an O(T_{SPT}(G)+m+l^2) time
and O(m+l^2) space algorithm for both the problems. Where, T_{SPT}(G) is the
asymptotic time to compute a single source shortest path tree in G. The
proposed algorithm is simple and easy to implement.
","[{'version': 'v1', 'created': 'Sat, 21 Nov 2015 17:32:42 GMT'}]",2015-11-24,"[['Kare', 'Anjeneya Swami', '']]","['Replacement Path', 'Replacement Shortest Path', 'Edge Replacement Path', 'Node Replacement Path', 'Shortest Path']"
16552,1312.4818,Hugo Daniel Macedo,"Hugo Daniel Macedo (INRIA Paris-Rocquencourt), Jos\'e N. Oliveira
  (HASLab)",Typing linear algebra: A biproduct-oriented approach,Science of Computer Programming (2013),,,,cs.SE math.CT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interested in formalizing the generation of fast running code for linear
algebra applications, the authors show how an index-free, calculational
approach to matrix algebra can be developed by regarding matrices as morphisms
of a category with biproducts. This shifts the traditional view of matrices as
indexed structures to a type-level perspective analogous to that of the
pointfree algebra of programming. The derivation of fusion, cancellation and
abide laws from the biproduct equations makes it easy to calculate algorithms
implementing matrix multiplication, the central operation of matrix algebra,
ranging from its divide-and-conquer version to its vectorization
implementation. From errant attempts to learn how particular products and
coproducts emerge from biproducts, not only blocked matrix algebra is
rediscovered but also a way of extending other operations (e.g. Gaussian
elimination) blockwise, in a calculational style, is found. The prospect of
building biproduct-based type checkers for computer algebra systems such as
MatlabTM is also considered.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2013 15:13:48 GMT'}]",2013-12-18,"[['Macedo', 'Hugo Daniel', '', 'INRIA Paris-Rocquencourt'], ['Oliveira', 'José N.', '', 'HASLab']]","['Linear algebra', 'categories of matrices', 'algebra of programming']"
16553,1802.06947,Saikat Chakraborty,"Saikat Chakraborty, Yujian Li, Matt Irvine, Ripon Saha, and Baishakhi
  Ray","Entropy Guided Spectrum Based Bug Localization Using Statistical
  Language Model",13 pages,,,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Locating bugs is challenging but one of the most important activities in
software development and maintenance phase because there are no certain rules
to identify all types of bugs. Existing automatic bug localization tools use
various heuristics based on test coverage, pre-determined buggy patterns, or
textual similarity with bug report, to rank suspicious program elements.
However, since these techniques rely on information from single source, they
often suffer when the respective source information is inadequate. For
instance, the popular spectrum based bug localization may not work well under
poorly written test suite. In this paper, we propose a new approach, EnSpec,
that guides spectrum based bug localization using code entropy, a metric that
basically represents naturalness of code derived from a statistical language
model. Our intuition is that since buggy code are high entropic, spectrum based
bug localization with code entropy would be more robust in discriminating buggy
lines vs. non-buggy lines. We realize our idea in a prototype, and performed an
extensive evaluation on two popular publicly available benchmarks. Our results
demonstrate that EnSpec outperforms a state-of-the-art spectrum based bug
localization technique.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 03:34:58 GMT'}]",2018-02-21,"[['Chakraborty', 'Saikat', ''], ['Li', 'Yujian', ''], ['Irvine', 'Matt', ''], ['Saha', 'Ripon', ''], ['Ray', 'Baishakhi', '']]","['Bug Localization', 'Naturalness of bug', 'Spectrum based testing', 'Hybrid bug-localization']"
16554,0908.4073,Jinwoo Shin,"Kyomin Jung, Devavrat Shah, Jinwoo Shin",Distributed Averaging via Lifted Markov Chains,,,,,cs.IT cs.DC math.IT math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by applications of distributed linear estimation, distributed
control and distributed optimization, we consider the question of designing
linear iterative algorithms for computing the average of numbers in a network.
Specifically, our interest is in designing such an algorithm with the fastest
rate of convergence given the topological constraints of the network. As the
main result of this paper, we design an algorithm with the fastest possible
rate of convergence using a non-reversible Markov chain on the given network
graph. We construct such a Markov chain by transforming the standard Markov
chain, which is obtained using the Metropolis-Hastings method. We call this
novel transformation pseudo-lifting. We apply our method to graphs with
geometry, or graphs with doubling dimension. Specifically, the convergence time
of our algorithm (equivalently, the mixing time of our Markov chain) is
proportional to the diameter of the network graph and hence optimal. As a
byproduct, our result provides the fastest mixing Markov chain given the
network topological constraints, and should naturally find their applications
in the context of distributed optimization, estimation and control.
","[{'version': 'v1', 'created': 'Thu, 27 Aug 2009 19:17:19 GMT'}]",2009-08-28,"[['Jung', 'Kyomin', ''], ['Shah', 'Devavrat', ''], ['Shin', 'Jinwoo', '']]","['consensus', 'lifting', 'linear averaging', 'Markov chain', 'non-reversible', 'pseudo-lifting', 'random walk']"
16555,1606.03032,Gino Montecinos,Gino I. Montecinos,"A strategy to implement Dirichlet boundary conditions in the context of
  ADER finite volume schemes. One-dimensional conservation laws",,,,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  ADER schemes are numerical methods, which can reach an arbitrary order of
accuracy in both space and time. They are based on a reconstruction procedure
and the solution of generalized Riemann problems. However, for general boundary
conditions, in particular of Dirichlet type, a lack of accuracy might occur if
a suitable treatment of boundaries conditions is not properly carried out. In
this work the treatment of Dirichlet boundary conditions for conservation laws
in the context of ADER schemes, is concerned. The solution of generalized
Riemann problems at the extremes of the computational domain, provides the
correct influence of boundaries. The reconstruction procedure, for data near to
the boundaries, demands for information outside the computational domain, which
is carried out in terms of ghost cells, which are provided by using the
numerical solution of auxiliary problems. These auxiliary problems are
hyperbolic and they are constructed from the conservation laws and the
information at boundaries, which may be partially or totally known in terms of
prescribed functions. The evolution of these problems, unlike to the usual
manner, is done in space rather than in time due to that these problems are
named here, {\it reverse problems}. The methodology can be considered as a
numerical counterpart of the inverse Lax-Wendroff procedure for filling ghost
cells. However, the use of Taylor series expansions, as well as, Lax-Wendroff
procedure, are avoided. For the scalar case is shown that the present procedure
preserve the accuracy of the scheme which is reinforced with some numerical
results. Expected orders of accuracy for solving conservation laws by using the
proposed strategy at boundaries, are obtained up to fifth-order in both space
and time.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2016 17:39:43 GMT'}]",2016-06-10,"[['Montecinos', 'Gino I.', '']]","['Inverse Lax-Wendroff procedure', 'Dirichlet boundary conditions', 'ADER finite volume schemes']"
16556,1407.3360,Joris van der Hoeven,"David Harvey, Joris van der Hoeven, Gr\'egoire Lecerf",Even faster integer multiplication,,,,,cs.CC cs.SC math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give a new proof of F\""urer's bound for the cost of multiplying n-bit
integers in the bit complexity model. Unlike F\""urer, our method does not
require constructing special coefficient rings with ""fast"" roots of unity.
Moreover, we prove the more explicit bound O(n log n K^(log^* n))$ with K = 8.
We show that an optimised variant of F\""urer's algorithm achieves only K = 16,
suggesting that the new algorithm is faster than F\""urer's by a factor of
2^(log^* n). Assuming standard conjectures about the distribution of Mersenne
primes, we give yet another algorithm that achieves K = 4.
","[{'version': 'v1', 'created': 'Sat, 12 Jul 2014 07:54:52 GMT'}]",2014-07-15,"[['Harvey', 'David', ''], ['van der Hoeven', 'Joris', ''], ['Lecerf', 'Grégoire', '']]","['Integer multiplication', 'algorithm', 'complexity bound', 'FFT']"
16557,1403.2000,Simon Kramer,Simon Kramer,"A Galois-Connection between Myers-Briggs' Type Indicators and Szondi's
  Personality Profiles",,,,,cs.CE cs.CY,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We propose a computable Galois-connection between Myers-Briggs' Type
Indicators (MBTIs), the most widely-used personality measure for
non-psychiatric populations (based on C.G. Jung's personality types), and
Szondi's personality profiles (SPPs), a less well-known but, as we show, finer
personality measure for psychiatric as well as non-psychiatric populations
(conceived as a unification of the depth psychology of S. Freud, C.G. Jung, and
A. Adler). The practical significance of our result is that our
Galois-connection provides a pair of computable, interpreting translations
between the two personality spaces of MBTIs and SPPs: one concrete from
MBTI-space to SPP-space (because SPPs are finer) and one abstract from
SPP-space to MBTI-space (because MBTIs are coarser). Thus Myers-Briggs' and
Szondi's personality-test results are mutually interpretable and
inter-translatable, even automatically by computers.
","[{'version': 'v1', 'created': 'Sat, 8 Mar 2014 19:25:36 GMT'}]",2014-03-11,"[['Kramer', 'Simon', '']]","['applied order theory', 'computational and mathematical psychology', 'depth psychology', 'machine translation', 'MBTI', 'personality tests']"
16558,1109.6838,Sarvesh Nikumbh,"Sarvesh Nikumbh, Joeprakash Nathaman and Rahul Vartak",Distributed Air Traffic Control : A Human Safety Perspective,"Extended Abstract, 3 pages, Accepted at IBM Collaborative Academia
  Research Exchange (I-CARE)-2011, uses ACM-Proceeding style file",,,,cs.MA cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The issues in air traffic control have so far been addressed with the intent
to improve resource utilization and achieve an optimized solution with respect
to fuel comsumption of aircrafts, efficient usage of the available airspace
with minimal congestion related losses under various dynamic constraints. So
the focus has almost always been more on smarter management of traffic to
increase profits while human safety, though achieved in the process, we
believe, has remained less seriously attended. This has become all the more
important given that we have overburdened and overstressed air traffic
controllers managing hundreds of airports and thousands of aircrafts per day.
  We propose a multiagent system based distributed approach to handle air
traffic ensuring complete human (passenger) safety without removing any humans
(ground controllers) from the loop thereby also retaining the earlier
advantages in the new solution. The detailed design of the agent system, which
will be easily interfacable with the existing environment, is described. Based
on our initial findings from simulations, we strongly believe the system to be
capable of handling the nuances involved, to be extendable and customizable at
any later point in time.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2011 14:42:14 GMT'}]",2011-10-03,"[['Nikumbh', 'Sarvesh', ''], ['Nathaman', 'Joeprakash', ''], ['Vartak', 'Rahul', '']]","['Air traffic control', 'multiagent system', 'holding pattern generation', 'landing sequence', 'decentralization', 'automated trafficflow management']"
16559,0704.2386,Pilar Albert,"Pilar Albert, Elvira Mayordomo, and Philippe Moser",Bounded Pushdown dimension vs Lempel Ziv information density,,,,,cs.CC cs.IT math.IT,,"  In this paper we introduce a variant of pushdown dimension called bounded
pushdown (BPD) dimension, that measures the density of information contained in
a sequence, relative to a BPD automata, i.e. a finite state machine equipped
with an extra infinite memory stack, with the additional requirement that every
input symbol only allows a bounded number of stack movements. BPD automata are
a natural real-time restriction of pushdown automata. We show that BPD
dimension is a robust notion by giving an equivalent characterization of BPD
dimension in terms of BPD compressors. We then study the relationships between
BPD compression, and the standard Lempel-Ziv (LZ) compression algorithm, and
show that in contrast to the finite-state compressor case, LZ is not universal
for bounded pushdown compressors in a strong sense: we construct a sequence
that LZ fails to compress signicantly, but that is compressed by at least a
factor 2 by a BPD compressor. As a corollary we obtain a strong separation
between finite-state and BPD dimension.
","[{'version': 'v1', 'created': 'Wed, 18 Apr 2007 16:49:48 GMT'}]",2007-07-13,"[['Albert', 'Pilar', ''], ['Mayordomo', 'Elvira', ''], ['Moser', 'Philippe', '']]","['Information lossless compressors', 'finite state (bounded pushdown) dimension', 'Lempel-Zivcompression algorithm']"
16560,1206.6565,Krishna S,Shibashis Guha and Shankara Narayanan Krishna,Game Characterizations of Timed Relations for Timed Automata Processes,20 pages,,,,cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we design the game semantics for timed equivalences and
preorders of timed processes. The timed games corresponding to the various
timed relations form a hierarchy. These games are similar to Stirling's
bisimulation games. If it is the case that the existence of a winning strategy
for the defender in a game ${\cal G}_1$ implies that there exists a winning
strategy for the defender in another game ${\cal G}_2$, then the relation that
corresponds to ${\cal G}_1$ is stronger than the relation corresponding to
${\cal G}_2$. The game hierarchy also throws light into several timed relations
that are not considered in this paper.
","[{'version': 'v1', 'created': 'Thu, 28 Jun 2012 04:52:32 GMT'}]",2012-06-29,"[['Guha', 'Shibashis', ''], ['Krishna', 'Shankara Narayanan', '']]","['Timed automata', 'bisimulation', 'timed transition system', 'timed games', 'EF games']"
16561,1501.00343,Tapas Kumar Mishra,"Tapas Kumar Mishra, Sudebkumar Prasant Pal",Bicoloring covers for graphs and hypergraphs,"20 pages, 3 figures",,,,cs.DM math.CO,http://creativecommons.org/licenses/by/4.0/,"  Let the {\it bicoloring cover number $\chi^c(G)$} for a hypergraph $G(V,E)$
be the minimum number of bicolorings of vertices of $G$ such that every
hyperedge $e\in E$ of $G$ is properly bicolored in at least one of the
$\chi^c(G)$ bicolorings. We investigate the relationship between $\chi^c(G)$,
matchings, hitting sets, $\alpha(G)$(independence number) and $\chi(G)$
(chromatic number). We design a factor $O(\frac{\log n}{\log \log n-\log \log
\log n})$ approximation algorithm for computing a bicoloring cover. We define a
new parameter for hypergraphs - ""cover independence number $\gamma(G)$"" and
prove that $\log \frac{|V|}{\gamma(G)}$ and $\frac{|V|}{2\gamma(G)}$ are lower
bounds for $\chi^c(G)$ and $\chi(G)$, respectively. We show that $\chi^c(G)$
can be approximated by a polynomial time algorithm achieving approximation
ratio $\frac{1}{1-t}$, if $\gamma(G)=n^t$, where $t<1$. We also construct a
particular class of hypergraphs $G(V,E)$ called {\it cover friendly}
hypergraphs where the ratio of $\alpha(G)$ to $\gamma(G)$ can be arbitrarily
large.We prove that for any $t\geq 1$, there exists a $k$-uniform hypergraph
$G$ such that the {\it clique number} $\omega(G)=k$ and $\chi^c(G) > t$. Let
$m(k,x)$ denote the minimum number of hyperedges %in a $k$-uniform hypergraph
$G$ such that some $k$-uniform hypergraph $G$ with $m(k,x)$ hyperedges does not
have a bicoloring cover of size $x$. We show that $ 2^{(k-1)x-1} < m(k,x) \leq
x \cdot k^2 \cdot 2^{(k+1)x+2}$. Let the {\it dependency $d(G)$} of $G$ be the
maximum number of hyperedge neighbors of any hyperedge in $G$. We propose an
algorithm for computing a bicoloring cover of size $x$ for $G$ if $d(G)
\leq(\frac{2^{x(k-1)}}{e}-1)$ using $nx+kx\frac{m}{d}$ random bits.
","[{'version': 'v1', 'created': 'Fri, 2 Jan 2015 04:11:11 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Apr 2015 11:15:54 GMT'}, {'version': 'v3', 'created': 'Mon, 11 May 2015 04:48:25 GMT'}, {'version': 'v4', 'created': 'Sat, 5 Mar 2016 05:47:44 GMT'}]",2016-03-08,"[['Mishra', 'Tapas Kumar', ''], ['Pal', 'Sudebkumar Prasant', '']]","['Hypergraph bicoloring', 'local lemma', 'probabilistic method', 'Kolmogorov complexity', 'approximation']"
16562,1606.04422,Artur Garcez,Luciano Serafini and Artur d'Avila Garcez,"Logic Tensor Networks: Deep Learning and Logical Reasoning from Data and
  Knowledge","12 pages, 2 figs, 1 table, 27 references",,,,cs.AI cs.LG cs.LO cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose Logic Tensor Networks: a uniform framework for integrating
automatic learning and reasoning. A logic formalism called Real Logic is
defined on a first-order language whereby formulas have truth-value in the
interval [0,1] and semantics defined concretely on the domain of real numbers.
Logical constants are interpreted as feature vectors of real numbers. Real
Logic promotes a well-founded integration of deductive reasoning on a
knowledge-base and efficient data-driven relational machine learning. We show
how Real Logic can be implemented in deep Tensor Neural Networks with the use
of Google's tensorflow primitives. The paper concludes with experiments
applying Logic Tensor Networks on a simple but representative example of
knowledge completion.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2016 15:25:28 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jul 2016 12:28:57 GMT'}]",2016-07-08,"[['Serafini', 'Luciano', ''], ['Garcez', ""Artur d'Avila"", '']]","['Knowledge Representation', 'Relational Learning', 'Tensor Networks', 'NeuralSymbolic Computation', 'Data-driven Knowledge Completion']"
16563,1206.1722,Surekha T.P,"T.P. Surekha, T. Ananthapadmanabha, C. Puttamadappa",C-Band VSAT Data Communication System and RF Impairments,18 pages,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is concerned with modelling and simulation of VSAT (very small
aperture terminal) data messaging network operating in India at Karnataka with
extended C-band. VSATs in Karnataka of KPTCL use VSATS 6.875-6.9465G Hz uplinks
and 4.650- 4.7215 GHz downlinks. These frequencies are dedicated to fixed
services. The Satellite is Intelsat -3A, the hub has a 7.2 m diameter antenna
and uses 350W or 600W TWTA (Travelling wave Tube Amplifier). The VSAT's are 1.2
m with RF power of 1W or 2W depending on their position in the uplink beam with
data rate of 64 or 128 K bit/s. The performance of the system is analysed by
the error probability called BER (Bit Error Rate) and results are derived from
Earth station to hub and hub to Earth station using satellite Transponder as
the media of communication channel. The Link budgets are developed for a single
one-way satellite link.
","[{'version': 'v1', 'created': 'Fri, 8 Jun 2012 10:37:57 GMT'}]",2012-06-11,"[['Surekha', 'T. P.', ''], ['Ananthapadmanabha', 'T.', ''], ['Puttamadappa', 'C.', '']]","['BER', 'Convolutional codes', 'Link budget', 'Satellite Communication', 'VSAT']"
16564,1412.2304,Sergii Dymchenko,Sergii Dymchenko and Mariia Mykhailova,"Declaratively solving tricky Google Code Jam problems with Prolog-based
  ECLiPSe CLP system",6 pages. This is a full version of a paper accepted at SAC 2015,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we demonstrate several examples of solving challenging
algorithmic problems from the Google Code Jam programming contest with the
Prolog-based ECLiPSe system using declarative techniques like constraint logic
programming and linear (integer) programming. These problems were designed to
be solved by inventing clever algorithms and efficiently implementing them in a
conventional imperative programming language, but we present relatively simple
declarative programs in ECLiPSe that are fast enough to find answers within the
time limit imposed by the contest rules. We claim that declarative programming
with ECLiPSe is better suited for solving certain common kinds of programming
problems offered in Google Code Jam than imperative programming. We show this
by comparing the mental steps required to come up with both kinds of solutions.
","[{'version': 'v1', 'created': 'Sun, 7 Dec 2014 02:24:21 GMT'}, {'version': 'v2', 'created': 'Sun, 14 Dec 2014 23:22:07 GMT'}]",2014-12-16,"[['Dymchenko', 'Sergii', ''], ['Mykhailova', 'Mariia', '']]","['Declarative programming', 'logic programming', 'constraint programming', 'linear programming', 'programming competitions']"
16565,1007.0523,Farn Wang,Farn Wang,Simulation-Checking of Real-Time Systems with Fairness Assumptions,"18 pages, 5 figures, part of the materials appear in the proceedings
  of FOMRATS 2007 and HSCC 2009",,,,cs.LO,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We investigate the simulation problem in of dense-time system. A
specification simulates a model if the specification can match every transition
that the model can make at a time point. We also adapt the approach of Emerson
and Lei and allow for multiple strong and weak fairness assumptions in checking
the simulation relation. Furthermore, we allow for fairness assumptions
specified as either state-predicates or event-predicates. We focus on a
subclass of the problem with at most one fairness assumption for the
specification. We then present a simulation-checking algorithm for this
subclass. We propose simulation of a model by a specification against a common
environment. We present efficient techniques for such simulations to take the
common environment into consideration. Our experiment shows that such a
consideration can dramatically improve the efficiency of checking simulation.
We also report the performance of our algorithm in checking the liveness
properties with fairness assumptions.
","[{'version': 'v1', 'created': 'Sun, 4 Jul 2010 02:35:47 GMT'}]",2010-07-06,"[['Wang', 'Farn', '']]","['branching simulation', 'fairness', 'verification', 'B¨uchiautomatas', 'concurrent computing', 'timed automata', 'algorithms', 'experiment']"
16566,1605.00930,Jeremias Moreira Gomes,"Jeremias Gomes, George Teodoro","Efficient Execution of Irregular Wavefront Propagation Pattern on Many
  Integrated Core Architecture",in Portuguese,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The efficient execution of image processing algorithms is an active area of
Bioinformatics. In image processing, one of the classes of algorithms or
computing pattern that works with irregular data structures is the Irregular
Wavefront Propagation Pattern (IWPP). In this class, elements propagate
information to neighbors in the form of wave propagation. This propagation
results in irregular access to data and expansions. Due to this irregularity,
current implementations of this class of algorithms requires atomic operations,
which is very costly and also restrains implementations with Single
Instruction, Multiple Data (SIMD) instructions in Many Integrated Core (MIC)
architectures, which are critical to attain high performance on this processor.
The objective of this study is to redesign the Irregular Wavefront Propagation
Pattern algorithm in order to enable the efficient execution on processors with
Many Integrated Core architecture using SIMD instructions. In this work, using
the Intel (R) Xeon Phi (TM) coprocessor, we have implemented a vector version
of IWPP with up to 5.63x gains on non-vectored version, a parallel version
using First In, First Out (FIFO) queue that attained speedup up to 55x as
compared to the single core version on the coprocessor, a version using
priority queue whose performance was 1.62x better than the fastest version of
GPU based implementation available in the literature, and a cooperative version
between heterogeneous processors that allow to process images bigger than the
Intel (R) Xeon Phi (TM) memory and also provides a way to utilize all the
available devices in the computation.
","[{'version': 'v1', 'created': 'Tue, 3 May 2016 14:37:34 GMT'}]",2016-05-04,"[['Gomes', 'Jeremias', ''], ['Teodoro', 'George', '']]","['Irregular Wavefront Propagation Pattern', 'Intel® Xeon Phi™', 'Many Integrated Core']"
16567,1705.08695,Zenglin Xu,Hao Liu and Haoli Bai and Lirong He and Zenglin Xu,Stochastic Sequential Neural Networks with Structured Inference,,,,,cs.LG cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Unsupervised structure learning in high-dimensional time series data has
attracted a lot of research interests. For example, segmenting and labelling
high dimensional time series can be helpful in behavior understanding and
medical diagnosis. Recent advances in generative sequential modeling have
suggested to combine recurrent neural networks with state space models (e.g.,
Hidden Markov Models). This combination can model not only the long term
dependency in sequential data, but also the uncertainty included in the hidden
states. Inheriting these advantages of stochastic neural sequential models, we
propose a structured and stochastic sequential neural network, which models
both the long-term dependencies via recurrent neural networks and the
uncertainty in the segmentation and labels via discrete random variables. For
accurate and efficient inference, we present a bi-directional inference network
by reparamterizing the categorical segmentation and labels with the recent
proposed Gumbel-Softmax approximation and resort to the Stochastic Gradient
Variational Bayes. We evaluate the proposed model in a number of tasks,
including speech modeling, automatic segmentation and labeling in behavior
understanding, and sequential multi-objects recognition. Experimental results
have demonstrated that our proposed model can achieve significant improvement
over the state-of-the-art methods.
","[{'version': 'v1', 'created': 'Wed, 24 May 2017 10:52:19 GMT'}]",2017-05-25,"[['Liu', 'Hao', ''], ['Bai', 'Haoli', ''], ['He', 'Lirong', ''], ['Xu', 'Zenglin', '']]","['Recurrent neural networks', 'Hidden Semi-Markov models', 'Sequential data']"
16568,1306.2554,Richard Combes,"Richard Combes and Ilham El Bouloumi and Stephane Senecal and Zwi
  Altman","The association problem in wireless networks: a Policy Gradient
  Reinforcement Learning approach",Working version,,,,cs.NI cs.IT cs.LG math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this paper is to develop a self-optimized association
algorithm based on PGRL (Policy Gradient Reinforcement Learning), which is both
scalable, stable and robust. The term robust means that performance degradation
in the learning phase should be forbidden or limited to predefined thresholds.
The algorithm is model-free (as opposed to Value Iteration) and robust (as
opposed to Q-Learning). The association problem is modeled as a Markov Decision
Process (MDP). The policy space is parameterized. The parameterized family of
policies is then used as expert knowledge for the PGRL. The PGRL converges
towards a local optimum and the average cost decreases monotonically during the
learning process. The properties of the solution make it a good candidate for
practical implementation. Furthermore, the robustness property allows to use
the PGRL algorithm in an ""always-on"" learning mode.
","[{'version': 'v1', 'created': 'Tue, 11 Jun 2013 15:31:25 GMT'}]",2013-06-12,"[['Combes', 'Richard', ''], ['Bouloumi', 'Ilham El', ''], ['Senecal', 'Stephane', ''], ['Altman', 'Zwi', '']]","['Wireless Networks', 'Queuing Theory', 'Stability', 'Load Balancing', 'Self Organizing Networks (SON)', 'Reinforcement Learning', 'Policy Gradient', 'Self-Optimization']"
16569,1504.03539,Mansaf Alam Dr,"Mansaf Alam, Shuchi Sethi",Detection of Information leakage in cloud,,,,,cs.DC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent research shows that colluded malware in different VMs sharing a single
physical host may use a resource as a channel to leak critical information.
Covert channels employ time or storage characteristics to transmit confidential
information to attackers leaving no trail.These channels were not meant for
communication and hence control mechanisms do not exist. This means these
remain undetected by traditional security measures employed in firewalls etc in
a network. The comprehensive survey to address the issue highlights that
accurate methods for fast detection in cloud are very expensive in terms of
storage and processing. The proposed framework builds signature by extracting
features which accurately classify the regular from covert traffic in cloud and
estimates difference in distribution of data under analysis by means of scores.
It then adds context to the signature and finally using machine learning
(Support Vector Machines),a model is built and trained for deploying in cloud.
The results show that the framework proposed is high in accuracy while being
low cost and robust as it is tested after adding noise which is likely to exist
in public cloud environments.
","[{'version': 'v1', 'created': 'Tue, 14 Apr 2015 13:35:32 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Nov 2015 09:26:35 GMT'}]",2015-11-09,"[['Alam', 'Mansaf', ''], ['Sethi', 'Shuchi', '']]","['Cloud computing', 'Virtual machine security', 'Covert Channel attacks', 'information leakage']"
16570,0707.2921,Andrea Pacifici,"Alessandro Agnetis, Enrico Grande, Pitu B. Mirchandani, Andrea
  Pacifici",Covering a line segment with variable radius discs,"21 pages, 2 figures",,,,cs.DM cs.NA,,"  The paper addresses the problem of locating sensors with a circular field of
view so that a given line segment is under full surveillance, which is termed
as the Disc Covering Problem on a Line. The cost of each sensor includes a
fixed component, and a variable component that is proportional to the
field-of-view area. When only one type of sensor or, in general, one type of
disc, is available, then a simple polynomial algorithm solves the problem. When
there are different types of sensors in terms of fixed and variable costs, the
problem becomes NP-hard. A branch-and-bound algorithm as well as an efficient
heuristic are developed. The heuristic very often obtains the optimal solution
as shown in extensive computational testing.
","[{'version': 'v1', 'created': 'Thu, 19 Jul 2007 14:59:47 GMT'}]",2007-07-20,"[['Agnetis', 'Alessandro', ''], ['Grande', 'Enrico', ''], ['Mirchandani', 'Pitu B.', ''], ['Pacifici', 'Andrea', '']]","['Sensor location', 'network covering problems', 'mixed integer nonlinear']"
16571,1304.1548,Johan Ugander,"Johan Ugander, Lars Backstrom, Jon Kleinberg","Subgraph Frequencies: Mapping the Empirical and Extremal Geography of
  Large Graph Collections","11 pages, 6 figures, 1 table",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A growing set of on-line applications are generating data that can be viewed
as very large collections of small, dense social graphs -- these range from
sets of social groups, events, or collaboration projects to the vast collection
of graph neighborhoods in large social networks. A natural question is how to
usefully define a domain-independent coordinate system for such a collection of
graphs, so that the set of possible structures can be compactly represented and
understood within a common space. In this work, we draw on the theory of graph
homomorphisms to formulate and analyze such a representation, based on
computing the frequencies of small induced subgraphs within each graph. We find
that the space of subgraph frequencies is governed both by its combinatorial
properties, based on extremal results that constrain all graphs, as well as by
its empirical properties, manifested in the way that real social graphs appear
to lie near a simple one-dimensional curve through this space.
  We develop flexible frameworks for studying each of these aspects. For
capturing empirical properties, we characterize a simple stochastic generative
model, a single-parameter extension of Erdos-Renyi random graphs, whose
stationary distribution over subgraphs closely tracks the concentration of the
real social graph families. For the extremal properties, we develop a tractable
linear program for bounding the feasible space of subgraph frequencies by
harnessing a toolkit of known extremal graph theory. Together, these two
complementary frameworks shed light on a fundamental question pertaining to
social graphs: what properties of social graphs are 'social' properties and
what properties are 'graph' properties?
  We conclude with a brief demonstration of how the coordinate system we
examine can also be used to perform classification tasks, distinguishing
between social graphs of different origins.
","[{'version': 'v1', 'created': 'Thu, 4 Apr 2013 20:00:40 GMT'}, {'version': 'v2', 'created': 'Tue, 14 May 2013 18:54:03 GMT'}]",2013-05-15,"[['Ugander', 'Johan', ''], ['Backstrom', 'Lars', ''], ['Kleinberg', 'Jon', '']]","['Social Networks', 'Triadic Closure', 'Induced Subgraphs', 'Subgraph Census', 'Graph Homomorphisms']"
16572,1107.5897,Katerina Ksystra,"Katerina Ksystra, Nikolaos Triantafyllou, Petros Stefaneas and
  Panayiotis Frangos",An Algebraic Specification of the Semantic Web,6 pages,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a formal specification of the Semantic Web, as an extension of the
World Wide Web using the well known algebraic specification language CafeOBJ.
Our approach allows the description of the key elements of the Semantic Web
technologies, in order to give a better understanding of the system, without
getting involved with their implementation details that might not yet be
standardized. This specification is part of our work in progress concerning the
modeling the Social Semantic Web.
","[{'version': 'v1', 'created': 'Fri, 29 Jul 2011 08:48:14 GMT'}]",2011-08-01,"[['Ksystra', 'Katerina', ''], ['Triantafyllou', 'Nikolaos', ''], ['Stefaneas', 'Petros', ''], ['Frangos', 'Panayiotis', '']]","['semantic web', 'formal methods', 'algebraic specifications', 'CafeOBJ', 'social semantic web']"
16573,1707.08549,Martin P. Seybold,Daniel Bahrdt and Martin P. Seybold,"Rational Points on the Unit Sphere: Approximation Complexity and
  Practical Constructions",,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Each non-zero point in $\mathbb{R}^d$ identifies a closest point $x$ on the
unit sphere $\mathbb{S}^{d-1}$. We are interested in computing an
$\epsilon$-approximation $y \in \mathbb{Q}^d$ for $x$, that is exactly on
$\mathbb{S}^{d-1}$ and has low bit size. We revise lower bounds on rational
approximations and provide explicit, spherical instances.
  We prove that floating-point numbers can only provide trivial solutions to
the sphere equation in $\mathbb{R}^2$ and $\mathbb{R}^3$. Moreover, we show how
to construct a rational point with denominators of at most
$10(d-1)/\varepsilon^2$ for any given $\epsilon \in \left(0,\tfrac 1 8\right]$,
improving on a previous result. The method further benefits from algorithms for
simultaneous Diophantine approximation.
  Our open-source implementation and experiments demonstrate the practicality
of our approach in the context of massive data sets Geo-referenced by latitude
and longitude values.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 17:23:39 GMT'}]",2017-07-27,"[['Bahrdt', 'Daniel', ''], ['Seybold', 'Martin P.', '']]","['Diophantineapproximation', 'Rationalpoints', 'Unit sphere', 'Perturbation', 'Stable geometricconstructions']"
16574,1609.04781,Zhiyong Shan,"Zhiyong Shan, Yang Yu, Tzi-cker Chiueh","Confining Windows Inter-Process Communications for OS-Level Virtual
  Machine","VDTS '09 Proceedings of the 1st EuroSys Workshop on Virtualization
  Technology for Dependable Systems",,,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As OS-level virtualization technology usually imposes little overhead on
virtual machine start-up and running, it provides an excellent choice for
building intrusion/fault tolerant applications that require redundancy and
frequent invocation. When developing Windows OS-level virtual machine, however,
people will inevitably face the challenge of confining Windows Inter-Process
Communications (IPC). As IPC on Windows platform is more complex than UNIX
style OS and most of the programs on Windows are not open-source, it is
difficult to discover all of the performed IPCs and confine them. In this
paper, we propose three general principles to confine IPC on Windows OS and a
novel IPC confinement mechanism based on the principles. With the mechanism,
for the first time from the literature, we successfully virtualized RPC System
Service (RPCSS) and Internet Information Server (IIS) on Feather-weight Virtual
Machine (FVM). Experimental results demonstrate that multiple IIS web server
instances can simultaneously run on single Windows OS with much less
performance overhead than other popular VM technology, offering a good basis
for constructing dependable system.
","[{'version': 'v1', 'created': 'Thu, 15 Sep 2016 19:18:12 GMT'}]",2016-09-16,"[['Shan', 'Zhiyong', ''], ['Yu', 'Yang', ''], ['Chiueh', 'Tzi-cker', '']]","['virtual machine', 'IPC confinement', 'dependable system']"
16575,1402.5764,Richard McClatchey,"Richard McClatchey, Andrew Branson and Jetendr Shamdasani","Designing Reusable Systems that Can Handle Change - Description-Driven
  Systems : Revisiting Object-Oriented Principles","8 pages, 1 figure and 1 table. Accepted by the 9th Int Conf on the
  Evaluation of Novel Approaches to Software Engineering (ENASE'14). Lisbon,
  Portugal. April 2014",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the age of the Cloud and so-called Big Data systems must be increasingly
flexible, reconfigurable and adaptable to change in addition to being developed
rapidly. As a consequence, designing systems to cater for evolution is becoming
critical to their success. To be able to cope with change, systems must have
the capability of reuse and the ability to adapt as and when necessary to
changes in requirements. Allowing systems to be self-describing is one way to
facilitate this. To address the issues of reuse in designing evolvable systems,
this paper proposes a so-called description-driven approach to systems design.
This approach enables new versions of data structures and processes to be
created alongside the old, thereby providing a history of changes to the
underlying data models and enabling the capture of provenance data. The
efficacy of the description-driven approach is exemplified by the CRISTAL
project. CRISTAL is based on description-driven design principles; it uses
versions of stored descriptions to define various versions of data which can be
stored in diverse forms. This paper discusses the need for capturing holistic
system description when modelling large-scale distributed systems.
","[{'version': 'v1', 'created': 'Mon, 24 Feb 2014 09:48:15 GMT'}]",2014-02-25,"[['McClatchey', 'Richard', ''], ['Branson', 'Andrew', ''], ['Shamdasani', 'Jetendr', '']]","['Description-driven systems', 'object orientation', 'reuse', 'system evolution']"
16576,1304.7386,Benjamin Tams,Benjamin Tams,Attacks and Countermeasures in Fingerprint Based Biometric Cryptosystems,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate implementations of biometric cryptosystems protecting
fingerprint templates (which are mostly based on the fuzzy vault scheme by
Juels and Sudan in 2002) with respect to the security they provide. We show
that attacks taking advantage of the system's false acceptance rate, i.e.
false-accept attacks, pose a very serious risk --- even if brute-force attacks
are impractical to perform. Our observations lead to the clear conclusion that
currently a single fingerprint is not sufficient to provide a secure biometric
cryptosystem. But there remain other problems that can not be resolved by
merely switching to multi-finger: Kholmatov and Yanikoglu in 2007 demonstrated
that it is possible to break two matching vault records at quite a high rate
via the correlation attack.
  We propose an implementation of a minutiae fuzzy vault that is inherently
resistant against cross-matching and the correlation attack. Surprisingly,
achieving cross-matching resistance is not at the cost of authentication
performance. In particular, we propose to use a randomized decoding procedure
and find that it is possible to achieve a GAR=91% at which no false accepts are
observed on a database generally used. Our ideas can be adopted into an
implementation of a multibiometric cryptosystem. All experiments described in
this paper can fully be reproduced using software available for download.
","[{'version': 'v1', 'created': 'Sat, 27 Apr 2013 16:23:15 GMT'}]",2013-04-30,"[['Tams', 'Benjamin', '']]","['fingerprint', 'fuzzy vault', 'cryptanalysis', 'cross-matching', 'correlation attack']"
16577,1304.7578,Amr Mohamed,"Fatima Amir Hamza, Lamia Romdhani, Amr Mohamed","Novel Network Coding-based Techniques for Multi-layer Video Delivery
  over Multi-hop Wireless testbed","accepted in PEMWN 2012, Tunisia",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The actual performance of video delivery over wireless networks is best
captured through experimental studies over real testbed, which is crucial to
uncover the technical problems and practical challenges of realizing the
proposed video delivery techniques. Network coding (NC) provides a paradigm
shift to optimize the network resources for enhancing the video quality as a
result of delivery over multi-hop wireless networks. In this paper, we propose
a novel framework for evaluating the performance of NC-based video delivery
over multi-hop wireless networks. Based on an experimental testbed
implementation of inter-layer video coding and delivery, we propose a new
generalized technique for multi-hop interlayer NC in enhancing video delivery
quality. We evaluate the trade-off between complexity of multi-hop NC, and
video quality gain. We provide clear recommendations for best design choices of
NC-based inter-layer video coding and delivery over multi-hop wireless mesh
network considering link conditions and Packet Delivery Ratio (PDR). The
results show that using NC improves the layered video performance in single and
multi-hop network. The average number of decoded layers when using NC in single
hop outperforms that when using NC in multi-hop.
","[{'version': 'v1', 'created': 'Mon, 29 Apr 2013 07:24:19 GMT'}]",2013-04-30,"[['Hamza', 'Fatima Amir', ''], ['Romdhani', 'Lamia', ''], ['Mohamed', 'Amr', '']]","['Network Coding', 'layered video', 'multi-hop', 'Wireless Mesh Network', 'testbed1']"
16578,1606.07941,Amol Patwardhan,Amol Patwardhan and Rahul Patwardhan,XML Entity Architecture for Efficient Software Integration,"8 figures. Peer reviewed and accepted paper in IJRASET. Key words:
  XML, XSLT, Schema Mapping, Business Entities, Architecture, Software
  Integration, International Journal for Research in Applied Science and
  Engineering Technology (IJRASET), vol. 4, no. 6, June 2016",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposed xml entities based architectural implementation to
improve integration between multiple third party vendor software systems with
incompatible xml schema. The xml entity architecture implementation showed that
the lines of code change required for mapping the schema between in house
software and three other vendor schema, decreased by 5.2%, indicating an
improvement in quality. The schema mapping development time decreased by 3.8%
and overall release time decreased by 5.3%, indicating an improvement in
productivity. The proposed technique proved that using xml entities and XSLT
transforms is more efficient in terms of coding effort and deployment
complexity when compared to mapping the schema using object oriented scripting
language such as C#.
","[{'version': 'v1', 'created': 'Sat, 25 Jun 2016 17:46:59 GMT'}]",2016-06-28,"[['Patwardhan', 'Amol', ''], ['Patwardhan', 'Rahul', '']]","['XML', 'XSLT', 'Schema Mapping', 'Business Entities', 'Architecture', 'Software Integration']"
16579,1506.03623,Han Xiao Bookman,"Han Xiao, Xiaoyan Zhu",Max-Entropy Feed-Forward Clustering Neural Network,This paper has been published in ICANN 2015,"ICANN 2015: International Conference on Artificial Neural
  Networks, Amsterdam, The Netherlands, (May 14-15, 2015)",,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The outputs of non-linear feed-forward neural network are positive, which
could be treated as probability when they are normalized to one. If we take
Entropy-Based Principle into consideration, the outputs for each sample could
be represented as the distribution of this sample for different clusters.
Entropy-Based Principle is the principle with which we could estimate the
unknown distribution under some limited conditions. As this paper defines two
processes in Feed-Forward Neural Network, our limited condition is the
abstracted features of samples which are worked out in the abstraction process.
And the final outputs are the probability distribution for different clusters
in the clustering process. As Entropy-Based Principle is considered into the
feed-forward neural network, a clustering method is born. We have conducted
some experiments on six open UCI datasets, comparing with a few baselines and
applied purity as the measurement . The results illustrate that our method
outperforms all the other baselines that are most popular clustering methods.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2015 11:01:40 GMT'}]",2015-06-12,"[['Xiao', 'Han', ''], ['Zhu', 'Xiaoyan', '']]","['Feed-ForwardNeuralNetwork', 'Clustering', 'Max-Entropy Principle', 'Probabilistic Models']"
16580,1109.3240,Yaojia Zhu,"Cristopher Moore, Xiaoran Yan, Yaojia Zhu, Jean-Baptiste Rouquier,
  Terran Lane","Active Learning for Node Classification in Assortative and
  Disassortative Networks","9 pages, 7 figures, KDD 2011: The 17th ACM SIGKDD Conference on
  Knowledge Discovery and Data Mining",,,,cs.IT cs.LG cs.SI math.IT physics.soc-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many real-world networks, nodes have class labels, attributes, or
variables that affect the network's topology. If the topology of the network is
known but the labels of the nodes are hidden, we would like to select a small
subset of nodes such that, if we knew their labels, we could accurately predict
the labels of all the other nodes. We develop an active learning algorithm for
this problem which uses information-theoretic techniques to choose which nodes
to explore. We test our algorithm on networks from three different domains: a
social network, a network of English words that appear adjacently in a novel,
and a marine food web. Our algorithm makes no initial assumptions about how the
groups connect, and performs well even when faced with quite general types of
network structure. In particular, we do not assume that nodes of the same class
are more likely to be connected to each other---only that they connect to the
rest of the network in similar ways.
","[{'version': 'v1', 'created': 'Thu, 15 Sep 2011 02:10:26 GMT'}]",2011-09-16,"[['Moore', 'Cristopher', ''], ['Yan', 'Xiaoran', ''], ['Zhu', 'Yaojia', ''], ['Rouquier', 'Jean-Baptiste', ''], ['Lane', 'Terran', '']]","['complex networks', 'structure and function', 'community detection', 'information theory', 'active learning', 'collective classification', 'transductive graph labeling']"
16581,1212.6382,Jasine Babu,"Jasine Babu and Manu Basavaraju and L. Sunil Chandran and Deepak
  Rajendraprasad",2-connecting Outerplanar Graphs without Blowing Up the Pathwidth,,,,,cs.DM cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a connected outerplanar graph G of pathwidth p, we give an algorithm to
add edges to G to get a supergraph of G, which is 2-vertex-connected,
outerplanar and of pathwidth O(p). This settles an open problem raised by
Biedl, in the context of computing minimum height planar straight line drawings
of outerplanar graphs, with their vertices placed on a two dimensional grid. In
conjunction with the result of this paper, the constant factor approximation
algorithm for this problem obtained by Biedl for 2-vertex-connected outerplanar
graphs will work for all outer planar graphs.
","[{'version': 'v1', 'created': 'Thu, 27 Dec 2012 15:09:02 GMT'}, {'version': 'v2', 'created': 'Sat, 5 Jan 2013 13:32:57 GMT'}, {'version': 'v3', 'created': 'Wed, 1 Jan 2014 18:20:32 GMT'}]",2014-01-03,"[['Babu', 'Jasine', ''], ['Basavaraju', 'Manu', ''], ['Chandran', 'L. Sunil', ''], ['Rajendraprasad', 'Deepak', '']]","['Pathwidth', 'Outerplanar Graph', '2-vertex-connected']"
16582,1704.01788,Christos Kalyvas,"Christos Kalyvas, Theodoros Tzouramanis",A Survey of Skyline Query Processing,"127 pages, 91 figures, 38 tables, 208 references,extended Survey",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Living in the Information Age allows almost everyone have access to a large
amount of information and options to choose from in order to fulfill their
needs. In many cases, the amount of information available and the rate of
change may hide the optimal and truly desired solution. This reveals the need
of a mechanism that will highlight the best options to choose among every
possible scenario. Based on this the skyline query was proposed which is a
decision support mechanism, that retrieves the valuefor- money options of a
dataset by identifying the objects that present the optimal combination of the
characteristics of the dataset. This paper surveys the state-of-the-art
techniques for skyline query processing, the numerous variations of the initial
algorithm that were proposed to solve similar problems and the
application-specific approaches that were developed to provide a solution
efficiently in each case. Aditionally in each section a taxonomy is outlined
along with the key aspects of each algorithm and its relation to previous
studies.
","[{'version': 'v1', 'created': 'Thu, 6 Apr 2017 11:34:20 GMT'}]",2017-04-07,"[['Kalyvas', 'Christos', ''], ['Tzouramanis', 'Theodoros', '']]","['Databases', 'Skyline queries', 'Survey;']"
16583,1003.3754,Murat Guzeltepe Mr,"Murat G\""uzeltepe, Mehmet \""Ozen","Quantum codes from codes over Gaussian integers with respect to the
  Mannheim metric",8 pages,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, some nonbinary quantum codes using classical codes over
Gaussian integers are obtained. Also, some of our quantum codes are better than
or comparable with those known before, (for instance [[8; 2; 5]]4+i).
","[{'version': 'v1', 'created': 'Fri, 19 Mar 2010 09:35:07 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Jan 2012 15:52:00 GMT'}]",2012-01-16,"[['Güzeltepe', 'Murat', ''], ['Özen', 'Mehmet', '']]","['Nonbinary quantum codes', 'MDS codes', 'Mannheim metric', 'Hammingmetric']"
16584,1501.00744,Lanbo Zhang,Lanbo Zhang,Identifying Relevant Document Facets for Keyword-Based Search Queries,,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As structured documents with rich metadata (such as products, movies, etc.)
become increasingly prevalent, searching those documents has become an
important IR problem. Although advanced search interfaces are widely available,
most users still prefer to use keyword-based queries to search those documents.
Query keywords often imply some hidden restrictions on the desired documents,
which can be represented as document facet-value pairs. To achieve high
retrieval performance, it's important to be able to identify the relevant
facet-value pairs hidden in a query. In this paper, we study the problem of
identifying document facet-value pairs that are relevant to a keyword-based
search query. We propose a machine learning approach and a set of useful
features, and evaluate our approach using a movie data set from INEX.
","[{'version': 'v1', 'created': 'Mon, 5 Jan 2015 01:49:11 GMT'}]",2015-01-06,"[['Zhang', 'Lanbo', '']]","['Query Understanding', 'Structured Data', 'Document Facets', 'Facet Selection']"
16585,1704.08000,Jules Wulms,"Wouter Meulemans, Bettina Speckmann, Kevin Verbeek, Jules Wulms",A Framework for Algorithm Stability,,,,,cs.DS cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We say that an algorithm is stable if small changes in the input result in
small changes in the output. This kind of algorithm stability is particularly
relevant when analyzing and visualizing time-varying data. Stability in general
plays an important role in a wide variety of areas, such as numerical analysis,
machine learning, and topology, but is poorly understood in the context of
(combinatorial) algorithms. In this paper we present a framework for analyzing
the stability of algorithms. We focus in particular on the tradeoff between the
stability of an algorithm and the quality of the solution it computes. Our
framework allows for three types of stability analysis with increasing degrees
of complexity: event stability, topological stability, and Lipschitz stability.
We demonstrate the use of our stability framework by applying it to kinetic
Euclidean minimum spanning trees.
","[{'version': 'v1', 'created': 'Wed, 26 Apr 2017 07:56:38 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Feb 2018 12:23:04 GMT'}]",2018-02-07,"[['Meulemans', 'Wouter', ''], ['Speckmann', 'Bettina', ''], ['Verbeek', 'Kevin', ''], ['Wulms', 'Jules', '']]","['Stability framework', 'stability analysis', 'time-varying data', 'minimumspanning tree']"
16586,1212.3906,Mahyuddin K. M.  Nasution,Mahyuddin K. M. Nasution,Simple Search Engine Model: Adaptive Properties,"6 pages, noting, draf",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we study the relationship between query and search engine by
exploring the adaptive properties based on a simple search engine. We used set
theory and utilized the words and terms for defining singleton space of event
in a search engine model, and then provided the inclusion between one singleton
to another.
","[{'version': 'v1', 'created': 'Mon, 17 Dec 2012 07:13:50 GMT'}]",2012-12-18,"[['Nasution', 'Mahyuddin K. M.', '']]","['singleton space', 'information retrieval', 'search term', 'query']"
16587,1702.07186,Derek Greene,Mark Belford and Brian Mac Namee and Derek Greene,Stability of Topic Modeling via Matrix Factorization,,,,,cs.IR cs.CL cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Topic models can provide us with an insight into the underlying latent
structure of a large corpus of documents. A range of methods have been proposed
in the literature, including probabilistic topic models and techniques based on
matrix factorization. However, in both cases, standard implementations rely on
stochastic elements in their initialization phase, which can potentially lead
to different results being generated on the same corpus when using the same
parameter values. This corresponds to the concept of ""instability"" which has
previously been studied in the context of $k$-means clustering. In many
applications of topic modeling, this problem of instability is not considered
and topic models are treated as being definitive, even though the results may
change considerably if the initialization process is altered. In this paper we
demonstrate the inherent instability of popular topic modeling approaches,
using a number of new measures to assess stability. To address this issue in
the context of matrix factorization for topic modeling, we propose the use of
ensemble learning strategies. Based on experiments performed on annotated text
corpora, we show that a K-Fold ensemble strategy, combining both ensembles and
structured initialization, can significantly reduce instability, while
simultaneously yielding more accurate topic models.
","[{'version': 'v1', 'created': 'Thu, 23 Feb 2017 12:00:10 GMT'}, {'version': 'v2', 'created': 'Sat, 9 Sep 2017 17:06:18 GMT'}]",2017-09-12,"[['Belford', 'Mark', ''], ['Mac Namee', 'Brian', ''], ['Greene', 'Derek', '']]","['Topic modeling', 'Topic stability', 'LDA', 'NMF']"
16588,1208.5537,Emmanuel Boidot,Emmanuel Boidot and Eric Feron,"Planning Random path distributions for ambush games in unstructured
  environments",,,,,cs.RO cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Operating vehicles in adversarial environments require non-conventional
planning techniques. A two-player, zero-sum non-cooperative game is introduced,
which is solved via a linear program. An extension is proposed to construct
networks displaying good representations of the environment characteristics,
while offering acceptable results for the technique used. Sensitivity of the
solution to the LP solver algorithm is identified. The performances of the
planner are finally assessed by comparison with those of conventional planners.
Results are used to formulate secondary objectives to the problem.
","[{'version': 'v1', 'created': 'Tue, 28 Aug 2012 02:07:08 GMT'}]",2012-08-29,"[['Boidot', 'Emmanuel', ''], ['Feron', 'Eric', '']]","['Path planning', 'linear optimization', 'ambushgames', 'probability distributions']"
16589,1702.04389,Norbert B\'atfai Ph.D.,"Norbert B\'atfai and Ren\'at\'o Besenczi and Gerg\H{o} Bogacsovics and
  Fanny Monori",Entropy Non-increasing Games for the Improvement of Dataflow Programming,"15 pages, 7 figures",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, we introduce a new conception of a family of esport games
called Samu Entropy to try to improve dataflow program graphs like the ones
that are based on Google's TensorFlow. Currently, the Samu Entropy project
specifies only requirements for new esport games to be developed with
particular attention to the investigation of the relationship between esport
and artificial intelligence. It is quite obvious that there is a very close and
natural relationship between esport games and artificial intelligence.
Furthermore, the project Samu Entropy focuses not only on using artificial
intelligence, but on creating AI in a new way. We present a reference game
called Face Battle that implements the Samu Entropy requirements.
","[{'version': 'v1', 'created': 'Tue, 14 Feb 2017 21:18:17 GMT'}]",2017-02-16,"[['Bátfai', 'Norbert', ''], ['Besenczi', 'Renátó', ''], ['Bogacsovics', 'Gergő', ''], ['Monori', 'Fanny', '']]","['esport', 'TensorFlow', 'computation graphs', 'gamification', 'robopsychology']"
16590,1604.06952,Fionn Murtagh,Fionn Murtagh and Giuseppe Iurato,"Visualization of Jacques Lacan's Registers of the Psychoanalytic Field,
  and Discovery of Metaphor and of Metonymy. Analytical Case Study of Edgar
  Allan Poe's ""The Purloined Letter""","34 pages, 9 figures",,,,cs.CL stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We start with a description of Lacan's work that we then take into our
analytics methodology. In a first investigation, a Lacan-motivated template of
the Poe story is fitted to the data. A segmentation of the storyline is used in
order to map out the diachrony. Based on this, it will be shown how synchronous
aspects, potentially related to Lacanian registers, can be sought. This
demonstrates the effectiveness of an approach based on a model template of the
storyline narrative. In a second and more comprehensive investigation, we
develop an approach for revealing, that is, uncovering, Lacanian register
relationships. Objectives of this work include the wide and general application
of our methodology. This methodology is strongly based on the ""letting the data
speak"" Correspondence Analysis analytics platform of Jean-Paul Benz\'ecri, that
is also the geometric data analysis, both qualitative and quantitative
analytics, developed by Pierre Bourdieu.
","[{'version': 'v1', 'created': 'Sat, 23 Apr 2016 20:48:50 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Aug 2016 20:54:20 GMT'}, {'version': 'v3', 'created': 'Mon, 30 Jan 2017 21:33:18 GMT'}]",2017-02-01,"[['Murtagh', 'Fionn', ''], ['Iurato', 'Giuseppe', '']]","['Text mining', 'narrative', 'Lacan registers', 'real', 'imaginary', 'symbolic', 'Correspondence Analysis']"
16591,1110.1491,Ruso  T,"T. Ruso, C. Chellappan","Netrawalm: Network Based Resource Aware Application Layer Multicast for
  Multiparty Video Conference",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  IP Multicast is one of the most absolute method for large bandwidth Internet
applications such as video conference, IPTV, E-Learning and Telemedicine etc.,
But due to security and management reason IP Multicast is not enabled in
Internet backbone routers. To achieve these challenges, lot of Application
Layer Multicast (ALM) has been proposed. All the existing protocols such as
NICE, ZIGZAG and OMNI are trying to reduce average delay by forming a Multicast
tree. But still that problem has not been addressed fully. We are proposing a
new protocol called NetRawALM, which will address the average delay,
Reliability between nodes, Scalability of conference, Heterogeneity and
resilient data distribution for real time multimedia applications by
constructing the Network based Resource aware Multicast tree algorithm. This is
very dynamic and decentralised. The proposed architecture is a LAN aware; it is
used to reduce Internet Traffic.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2011 11:48:12 GMT'}]",2011-10-10,"[['Ruso', 'T.', ''], ['Chellappan', 'C.', '']]","['IP Multicast', 'Application Layer Multicast', 'IPTV', 'Video Conference', 'Resource aware Multicast Tree', 'Scalability', 'Heterogeneity', 'Resilient']"
16592,1111.5467,Flavio D'Alessandro,"Arturo Carpi, Flavio D'Alessandro",Independent sets of words and the synchronization problem,,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The synchronization problem is investigated for the class of locally strongly
transitive automata introduced in a previous work of the authors. Some
extensions of this problem related to the notions of stable set and word of
minimal rank of an automaton are studied. An application to synchronizing
colorings of aperiodic graphs with a Hamiltonian path is also considered.
","[{'version': 'v1', 'created': 'Wed, 23 Nov 2011 11:53:46 GMT'}]",2011-11-24,"[['Carpi', 'Arturo', ''], [""D'Alessandro"", 'Flavio', '']]","['ˇCern´y conjecture', 'road coloring problem', 'synchronizing automaton']"
16593,1606.09281,Lucas Mentch,Duy Hoang Thai and Lucas Mentch,"Multiphase Segmentation For Simultaneously Homogeneous and Textural
  Images",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Segmentation remains an important problem in image processing. For
homogeneous (piecewise smooth) images, a number of important models have been
developed and refined over the past several decades. However, these models
often fail when applied to the substantially larger class of natural images
that simultaneously contain regions of both texture and homogeneity. This work
introduces a bi-level constrained minimization model for simultaneous
multiphase segmentation of images containing both homogeneous and textural
regions. We develop novel norms defined in different functional Banach spaces
for the segmentation which results in a non-convex minimization. Finally, we
develop a generalized notion of segmentation delving into approximation theory
and demonstrating that a more refined decomposition of these images results in
multiple meaningful components. Both theoretical results and demonstrations on
natural images are provided.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2016 20:52:10 GMT'}]",2016-07-01,"[['Thai', 'Duy Hoang', ''], ['Mentch', 'Lucas', '']]","['Image Decomposition', 'Variational Calculus', 'Image Denoising', 'Feature Extraction', 'Image Segmentation']"
16594,1603.07063,Xiaodan Liang,"Xiaodan Liang and Xiaohui Shen and Jiashi Feng and Liang Lin and
  Shuicheng Yan",Semantic Object Parsing with Graph LSTM,18 pages,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  By taking the semantic object parsing task as an exemplar application
scenario, we propose the Graph Long Short-Term Memory (Graph LSTM) network,
which is the generalization of LSTM from sequential data or multi-dimensional
data to general graph-structured data. Particularly, instead of evenly and
fixedly dividing an image to pixels or patches in existing multi-dimensional
LSTM structures (e.g., Row, Grid and Diagonal LSTMs), we take each
arbitrary-shaped superpixel as a semantically consistent node, and adaptively
construct an undirected graph for each image, where the spatial relations of
the superpixels are naturally used as edges. Constructed on such an adaptive
graph topology, the Graph LSTM is more naturally aligned with the visual
patterns in the image (e.g., object boundaries or appearance similarities) and
provides a more economical information propagation route. Furthermore, for each
optimization step over Graph LSTM, we propose to use a confidence-driven scheme
to update the hidden and memory states of nodes progressively till all nodes
are updated. In addition, for each node, the forgets gates are adaptively
learned to capture different degrees of semantic correlation with neighboring
nodes. Comprehensive evaluations on four diverse semantic object parsing
datasets well demonstrate the significant superiority of our Graph LSTM over
other state-of-the-art solutions.
","[{'version': 'v1', 'created': 'Wed, 23 Mar 2016 03:31:02 GMT'}]",2016-03-24,"[['Liang', 'Xiaodan', ''], ['Shen', 'Xiaohui', ''], ['Feng', 'Jiashi', ''], ['Lin', 'Liang', ''], ['Yan', 'Shuicheng', '']]","['Object Parsing', 'Graph LSTM', 'Recurrent Neural Networks']"
16595,1506.04502,Ndoundam Rene,"Fabrice P. Tachago, Stephane G. R. Ekodeck, Rene Ndoundam",Steganography and Broadcasting,10 pages,,,,cs.CR,http://creativecommons.org/licenses/by/3.0/,"  Informally, steganography is the process of exchanging a secret message
between two communicating entities so that an eavesdropper may not know that a
message has been sent. After a review of some steganographic systems, we found
that these systems have some defects. First, there are situations in which some
concealment algorithms do not properly hide a secret message. Second, to
conceal one bit of a secret message, some ask at least five documents and make
at least two sampling operations, thus increasing their run-times. Considering
the different ways to communicate with the receiver, we propose two
steganographic systems adapted to the email communication whose algorithms are
deterministic. To hide one bit of a secret message, our steganographic systems
need only one document and performs one sampling operation and therefore
significantly reduces the run-time.
","[{'version': 'v1', 'created': 'Mon, 15 Jun 2015 07:58:51 GMT'}]",2015-06-16,"[['Tachago', 'Fabrice P.', ''], ['Ekodeck', 'Stephane G. R.', ''], ['Ndoundam', 'Rene', '']]","['steganography', 'run-time', 'email']"
16596,1506.02020,Eric Bax,"Ragavendran Gopalakrishnan, Eric Bax, Krishna Prasad Chitrapura,
  Sachin Garg",Portfolio Allocation for Sellers in Online Advertising,,,,,cs.GT q-fin.PM q-fin.RM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In markets for online advertising, some advertisers pay only when users
respond to ads. So publishers estimate ad response rates and multiply by
advertiser bids to estimate expected revenue for showing ads. Since these
estimates may be inaccurate, the publisher risks not selecting the ad for each
ad call that would maximize revenue. The variance of revenue can be decomposed
into two components -- variance due to `uncertainty' because the true response
rate is unknown, and variance due to `randomness' because realized response
statistics fluctuate around the true response rate. Over a sequence of many ad
calls, the variance due to randomness nearly vanishes due to the law of large
numbers. However, the variance due to uncertainty doesn't diminish.
  We introduce a technique for ad selection that augments existing estimation
and explore-exploit methods. The technique uses methods from portfolio
optimization to produce a distribution over ads rather than selecting the
single ad that maximizes estimated expected revenue. Over a sequence of similar
ad calls, ads are selected according to the distribution. This approach
decreases the effects of uncertainty and increases revenue.
","[{'version': 'v1', 'created': 'Fri, 5 Jun 2015 19:26:53 GMT'}]",2015-06-08,"[['Gopalakrishnan', 'Ragavendran', ''], ['Bax', 'Eric', ''], ['Chitrapura', 'Krishna Prasad', ''], ['Garg', 'Sachin', '']]","['online advertising', 'portfolio allocation', 'uncertainty', 'randomness']"
16597,1506.03528,Kevin A. Lai,"Mahdi Amani, Kevin A. Lai, and Robert E. Tarjan",Amortized Rotation Cost in AVL Trees,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An AVL tree is the original type of balanced binary search tree. An insertion
in an $n$-node AVL tree takes at most two rotations, but a deletion in an
$n$-node AVL tree can take $\Theta(\log n)$. A natural question is whether
deletions can take many rotations not only in the worst case but in the
amortized case as well. A sequence of $n$ successive deletions in an $n$-node
tree takes $O(n)$ rotations, but what happens when insertions are intermixed
with deletions? Heaupler, Sen, and Tarjan conjectured that alternating
insertions and deletions in an $n$-node AVL tree can cause each deletion to do
$\Omega(\log n)$ rotations, but they provided no construction to justify their
claim. We provide such a construction: we show that, for infinitely many $n$,
there is a set $E$ of {\it expensive} $n$-node AVL trees with the property
that, given any tree in $E$, deleting a certain leaf and then reinserting it
produces a tree in $E$, with the deletion having done $\Theta(\log n)$
rotations. One can do an arbitrary number of such expensive deletion-insertion
pairs. The difficulty in obtaining such a construction is that in general the
tree produced by an expensive deletion-insertion pair is not the original tree.
Indeed, if the trees in $E$ have even height $k$, $2^{k/2}$ deletion-insertion
pairs are required to reproduce the original tree.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2015 01:50:18 GMT'}]",2015-06-12,"[['Amani', 'Mahdi', ''], ['Lai', 'Kevin A.', ''], ['Tarjan', 'Robert E.', '']]","['data structures', 'AVL tree', 'lower bound', 'rotation']"
16598,1202.5512,Richard McClatchey,"Asif Osman, Ashiq Anjum, Naheed Batool, Richard McClatchey","A Fault Tolerant, Dynamic and Low Latency BDII Architecture for Grids",18 pages; 10 figures; 4 tables,"International Journal of Grid and Distributed Computing Vol. 3,
  No. 4, December, 2010",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The current BDII model relies on information gathering from agents that run
on each core node of a Grid. This information is then published into a Grid
wide information resource known as Top BDII. The Top level BDIIs are updated
typically in cycles of a few minutes each. A new BDDI architecture is proposed
and described in this paper based on the hypothesis that only a few attribute
values change in each BDDI information cycle and consequently it may not be
necessary to update each parameter in a cycle. It has been demonstrated that
significant performance gains can be achieved by exchanging only the
information about records that changed during a cycle. Our investigations have
led us to implement a low latency and fault tolerant BDII system that involves
only minimal data transfer and facilitates secure transactions in a Grid
environment.
","[{'version': 'v1', 'created': 'Fri, 24 Feb 2012 17:51:35 GMT'}]",2012-02-27,"[['Osman', 'Asif', ''], ['Anjum', 'Ashiq', ''], ['Batool', 'Naheed', ''], ['McClatchey', 'Richard', '']]","['decentralized BDII', 'performance aware cache control', 'data redundancy and compression', 'data authentication', 'secure data transfer.   1']"
16599,1410.2360,Kaniezhil Radhakrishnan,"R. Kaniezhil, C. Chandrasekar",Improvement of Spectrum Sharing using Traffic pattern prediction,"arXiv admin note: text overlap with arXiv:1301.1134; and text overlap
  with arXiv:1201.1964, arXiv:cs/0609149 by other authors",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper focuses on improving the spectrum sharing using NSU, FLS and
Traffic Pattern Prediction and also made comparison that traffic pattern
prediction provides a better way of improving the spectrum utilization and
avoids the spectrum scarcity. This helps to increase the number of active
users, ease of identification of optimal users to use the spectrum with
maximized coverage of the spectrum.. We experimentally evaluated the
effectiveness of our approach using NS2 simulator and showed that after
predicting the traffic, we can accommodate more number of users and avoiding
Interference.
","[{'version': 'v1', 'created': 'Thu, 9 Oct 2014 05:28:56 GMT'}]",2014-10-10,"[['Kaniezhil', 'R.', ''], ['Chandrasekar', 'C.', '']]","['Active Users', 'FLS', 'NSU', 'Spectrum Sharing', 'Traffic Prediction']"
16600,1710.02855,Anoop Kunchukuttan,"Anoop Kunchukuttan, Pratik Mehta, Pushpak Bhattacharyya",The IIT Bombay English-Hindi Parallel Corpus,"accepted for LREC 2018, 4 pages, parallel corpus for English-Hindi
  machine translation",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the IIT Bombay English-Hindi Parallel Corpus. The corpus is a
compilation of parallel corpora previously available in the public domain as
well as new parallel corpora we collected. The corpus contains 1.49 million
parallel segments, of which 694k segments were not previously available in the
public domain. The corpus has been pre-processed for machine translation, and
we report baseline phrase-based SMT and NMT translation results on this corpus.
This corpus has been used in two editions of shared tasks at the Workshop on
Asian Language Translation (2016 and 2017). The corpus is freely available for
non-commercial research. To the best of our knowledge, this is the largest
publicly available English-Hindi parallel corpus.
","[{'version': 'v1', 'created': 'Sun, 8 Oct 2017 16:56:05 GMT'}, {'version': 'v2', 'created': 'Sat, 19 May 2018 20:00:21 GMT'}]",2018-05-22,"[['Kunchukuttan', 'Anoop', ''], ['Mehta', 'Pratik', ''], ['Bhattacharyya', 'Pushpak', '']]","['machine translation', 'parallel corpus', 'Indian languages']"
16601,1511.01874,Radu Grigore,Radu Grigore and Hongseok Yang,Abstraction Refinement Guided by a Learnt Probabilistic Model,POPL2016,,,,cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The core challenge in designing an effective static program analysis is to
find a good program abstraction -- one that retains only details relevant to a
given query. In this paper, we present a new approach for automatically finding
such an abstraction. Our approach uses a pessimistic strategy, which can
optionally use guidance from a probabilistic model. Our approach applies to
parametric static analyses implemented in Datalog, and is based on
counterexample-guided abstraction refinement. For each untried abstraction, our
probabilistic model provides a probability of success, while the size of the
abstraction provides an estimate of its cost in terms of analysis time.
Combining these two metrics, probability and cost, our refinement algorithm
picks an optimal abstraction. Our probabilistic model is a variant of the
Erdos-Renyi random graph model, and it is tunable by what we call
hyperparameters. We present a method to learn good values for these
hyperparameters, by observing past runs of the analysis on an existing
codebase. We evaluate our approach on an object sensitive pointer analysis for
Java programs, with two client analyses (PolySite and Downcast).
","[{'version': 'v1', 'created': 'Thu, 5 Nov 2015 19:57:03 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Nov 2015 08:15:54 GMT'}]",2015-11-11,"[['Grigore', 'Radu', ''], ['Yang', 'Hongseok', '']]","['Datalog', 'Horn', 'hypergraph', 'probability']"
16602,1208.6025,Rahat Hossain Faisal,"Md. Tarek Habib, Rahat Hossain Faisal, M. Rokonuzzaman","Feasibility of Genetic Algorithm for Textile Defect Classification Using
  Neural Network","20 pages, 11 figures, 6 tables; International Journal of Artificial
  Intelligence & Applications (IJAIA),AIRCC, July 2012",,,,cs.NE,http://creativecommons.org/licenses/by/3.0/,"  The global market for textile industry is highly competitive nowadays.
Quality control in production process in textile industry has been a key factor
for retaining existence in such competitive market. Automated textile
inspection systems are very useful in this respect, because manual inspection
is time consuming and not accurate enough. Hence, automated textile inspection
systems have been drawing plenty of attention of the researchers of different
countries in order to replace manual inspection. Defect detection and defect
classification are the two major problems that are posed by the research of
automated textile inspection systems. In this paper, we perform an extensive
investigation on the applicability of genetic algorithm (GA) in the context of
textile defect classification using neural network (NN). We observe the effect
of tuning different network parameters and explain the reasons. We empirically
find a suitable NN model in the context of textile defect classification. We
compare the performance of this model with that of the classification models
implemented by others.
","[{'version': 'v1', 'created': 'Sat, 11 Aug 2012 21:45:46 GMT'}]",2012-08-31,"[['Habib', 'Md. Tarek', ''], ['Faisal', 'Rahat Hossain', ''], ['Rokonuzzaman', 'M.', '']]","['Textile Defect', 'Neural Network', 'Genetic Algorithm', 'Model Complexity', 'Accuracy']"
16603,1004.0944,Roberto Bagnara,"Roberto Bagnara, Fred Mesnard, Andrea Pescetti, Enea Zaffanella","The Automatic Synthesis of Linear Ranking Functions: The Complete
  Unabridged Version","47 pages, 3 tables",,,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The classical technique for proving termination of a generic sequential
computer program involves the synthesis of a ranking function for each loop of
the program. Linear ranking functions are particularly interesting because many
terminating loops admit one and algorithms exist to automatically synthesize
it. In this paper we present two such algorithms: one based on work dated 1991
by Sohn and Van Gelder; the other, due to Podelski and Rybalchenko, dated 2004.
Remarkably, while the two algorithms will synthesize a linear ranking function
under exactly the same set of conditions, the former is mostly unknown to the
community of termination analysis and its general applicability has never been
put forward before the present paper. In this paper we thoroughly justify both
algorithms, we prove their correctness, we compare their worst-case complexity
and experimentally evaluate their efficiency, and we present an open-source
implementation of them that will make it very easy to include
termination-analysis capabilities in automatic program verifiers.
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2010 19:54:20 GMT'}, {'version': 'v2', 'created': 'Sun, 1 Apr 2012 07:14:21 GMT'}]",2012-04-03,"[['Bagnara', 'Roberto', ''], ['Mesnard', 'Fred', ''], ['Pescetti', 'Andrea', ''], ['Zaffanella', 'Enea', '']]","['Static analysis', 'computer-aided verification', 'termination analysis']"
16604,1702.01676,Talel Abdessalem,"Hajer Kefi (DRM, NUS, CEDAG), Sitesh Indra (NUS, LTCI, IPAL), Talel
  Abdessalem (IPAL, LTCI, NUS)","Social media marketing analytics : a multicultural approach applied to
  the beauty \& cosmetic sector","20th Pacific Asia Conference on Information Systems, PACIS 2016, Jun
  2016, Chiayi, Taiwan. 2016",,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present in this paper a multicultural approach to social media marketing
analytics, applied in two Facebook brand pages: French (individualistic
culture, the country home of the brand) versus Saudi Arabian (collectivistic
culture, one of its country hosts), which are published by an
internationalbeauty \& cosmetics firm. Using social network analysis and
content analysis, we identify the most popular posts and the most influential
users within these two brand pages and highlight the different communities
emerging from brand and users interactions. These communities seem to be
culture oriented when they are constructed around socialization branded posts
and product-line oriented when advertising branded posts are concerned.
","[{'version': 'v1', 'created': 'Mon, 6 Feb 2017 16:07:43 GMT'}]",2017-02-07,"[['Kefi', 'Hajer', '', 'DRM, NUS, CEDAG'], ['Indra', 'Sitesh', '', 'NUS, LTCI, IPAL'], ['Abdessalem', 'Talel', '', 'IPAL, LTCI, NUS']]","['Social media marketing', 'Multicultural differences', 'Social Network analysis', 'Facebook']"
16605,1109.0937,Manoj Kumar,Manoj Kumar,"Impact of the Evolution of Smart Phones in Education Technology and its
  Application in Technical and Professional Studies: Indian Perspective",,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The greatness of any nation depends largely on the system of education that
is used to nurture its talent from within. With the digital era taking the
spotlight, and the world rapidly reforming into a global village, it is now
quintessential that a spirit of healthy competitiveness be inculcated in the
budding minds of this country. While trying to remodel and upgrade the
education system, a key issue is that of quality of education processes in the
country. Needs and expectations of the society are changing very fast and the
quality of higher education requires to be sustained at the desired level. The
use of internet for educational purposes has increased many folds among Indian
youths. Online video lectures and e-books are the emerging trends among
learners. The birth of high speed internet access and its availability on
recently evolved smart phones has opened several new avenues for learning. The
growing popularity of these smart phones among the youth can potentially
revolutionize the way we learn. The introduction of 3G technology is already
being pinned as the next big thing in the mobile internet revolution. This
paper discusses the use of Smart Phones in Education Technology and its
application in Technical & Professional studies in India. We intend to put
forward some challenges and advices.
","[{'version': 'v1', 'created': 'Mon, 5 Sep 2011 15:33:22 GMT'}]",2011-09-06,"[['Kumar', 'Manoj', '']]","['Indian education system', 'high speed internet on smart phone', 'video lectures', 'e-books']"
16606,1205.0125,Rafayel Kamalian,"A.M. Khachatryan, R.R. Kamalian",On the parameter $\mu_{21}$ of a complete bipartite graph,"5 pages, no figures",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A proper edge $t$-coloring of a graph $G$ is a coloring of edges of $G$ with
colors $1,2,...,t$ such that all colors are used, and no two adjacent edges
receive the same color. The set of colors of edges incident with a vertex $x$
is called a spectrum of $x$. An arbitrary nonempty subset of consecutive
integers is called an interval.
  Suppose that all edges of a graph $G$ are colored in the game of Alice and
Bob with asymmetric distribution of roles. Alice determines the number $t$ of
colors in the future proper edge coloring of $G$ and aspires to minimize the
number of vertices with an interval spectrum in it. Bob colors edges of $G$
with $t$ colors and aspires to maximize that number. $\mu_{21}(G)$ is equal to
the number of vertices of $G$ with an interval spectrum at the finish of the
game on the supposition that both players choose their best strategies.
  In this paper, for arbitrary positive integers $m$ and $n$, the exact value
of the parameter $\mu_{21}(K_{m,n})$ is found.
","[{'version': 'v1', 'created': 'Tue, 1 May 2012 10:21:51 GMT'}]",2012-05-02,"[['Khachatryan', 'A. M.', ''], ['Kamalian', 'R. R.', '']]","['proper edge coloring', 'interval spectrum', 'game', 'complete bipartite graph']"
16607,1402.3643,Shayan Oveis Gharan,Mohammad Akbarpour and Shengwu Li and Shayan Oveis Gharan,Dynamic Matching Market Design,,,,,cs.GT cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a simple benchmark model of dynamic matching in networked
markets, where agents arrive and depart stochastically and the network of
acceptable transactions among agents forms a random graph. We analyze our model
from three perspectives: waiting, optimization, and information. The main
insight of our analysis is that waiting to thicken the market can be
substantially more important than increasing the speed of transactions, and
this is quite robust to the presence of waiting costs. From an optimization
perspective, naive local algorithms, that choose the right time to match agents
but do not exploit global network structure, can perform very close to optimal
algorithms. From an information perspective, algorithms that employ even
partial information on agents' departure times perform substantially better
than those that lack such information. To elicit agents' departure times, we
design an incentive-compatible continuous-time dynamic mechanism without
transfers.
","[{'version': 'v1', 'created': 'Sat, 15 Feb 2014 04:30:41 GMT'}]",2014-02-18,"[['Akbarpour', 'Mohammad', ''], ['Li', 'Shengwu', ''], ['Gharan', 'Shayan Oveis', '']]","['Market Design', 'Matching', 'Networks', 'Continuous-time Markov Chains', 'Mechanism Design']"
16608,1204.6492,Fernando Brito e Abreu,"Tiago Pessoa, Fernando Brito e Abreu, Miguel Pessoa Monteiro, Sergio
  Bryton",An Eclipse Plugin to Support Code Smells Detection,"12 pages, 7 figures","INFORUM'2011 conference proceedings, Luis Caires e Raul Barbosa
  (eds.), 8-9 September, Coimbra, Portugal, 2011",,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Eradication of code smells is often pointed out as a way to improve
readability, extensibility and design in existing software. However, code smell
detection in large systems remains time consuming and error-prone, partly due
to the inherent subjectivity of the detection processes presently available. In
view of mitigating the subjectivity problem, this paper presents a tool that
automates a technique for the detection and assessment of code smells in Java
source code, developed as an Eclipse plug-in. The technique is based upon a
Binary Logistic Regression model and calibrated by expert's knowledge. A short
overview of the technique is provided and the tool is described.
","[{'version': 'v1', 'created': 'Sun, 29 Apr 2012 16:33:53 GMT'}]",2012-05-01,"[['Pessoa', 'Tiago', ''], ['Abreu', 'Fernando Brito e', ''], ['Monteiro', 'Miguel Pessoa', ''], ['Bryton', 'Sergio', '']]","['refactoring', 'code smells', 'binary logistic regression', 'automated software engineering']"
16609,1306.1677,Christoforos Raptopoulos Christoforos Raptopoulos,"S. Nikoletseas, P. Panagopoulou, C. Raptopoulos and P.G. Spirakis",On the Structure of Equilibria in Basic Network Formation,"11 pages, 4 figures",,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study network connection games where the nodes of a network perform edge
swaps in order to improve their communication costs. For the model proposed by
Alon et al. (2010), in which the selfish cost of a node is the sum of all
shortest path distances to the other nodes, we use the probabilistic method to
provide a new, structural characterization of equilibrium graphs. We show how
to use this characterization in order to prove upper bounds on the diameter of
equilibrium graphs in terms of the size of the largest $k$-vicinity (defined as
the the set of vertices within distance $k$ from a vertex), for any $k \geq 1$
and in terms of the number of edges, thus settling positively a conjecture of
Alon et al. in the cases of graphs of large $k$-vicinity size (including graphs
of large maximum degree) and of graphs which are dense enough.
  Next, we present a new swap-based network creation game, in which selfish
costs depend on the immediate neighborhood of each node; in particular, the
profit of a node is defined as the sum of the degrees of its neighbors. We
prove that, in contrast to the previous model, this network creation game
admits an exact potential, and also that any equilibrium graph contains an
induced star. The existence of the potential function is exploited in order to
show that an equilibrium can be reached in expected polynomial time even in the
case where nodes can only acquire limited knowledge concerning non-neighboring
nodes.
","[{'version': 'v1', 'created': 'Fri, 7 Jun 2013 09:57:29 GMT'}]",2013-06-10,"[['Nikoletseas', 'S.', ''], ['Panagopoulou', 'P.', ''], ['Raptopoulos', 'C.', ''], ['Spirakis', 'P. G.', '']]","['network creation game', 'diameter', 'swap equilibrium', 'potential game', 'probabilistic method']"
16610,1504.07459,Marian-Andrei Rizoiu,"Marian-Andrei Rizoiu, Adrien Guille and Julien Velcin","CommentWatcher: An Open Source Web-based platform for analyzing
  discussions on web forums",,,,,cs.CL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present CommentWatcher, an open source tool aimed at analyzing discussions
on web forums. Constructed as a web platform, CommentWatcher features automatic
mass fetching of user posts from forum on multiple sites, extracting topics,
visualizing the topics as an expression cloud and exploring their temporal
evolution. The underlying social network of users is simultaneously constructed
using the citation relations between users and visualized as a graph structure.
Our platform addresses the issues of the diversity and dynamics of structures
of webpages hosting the forums by implementing a parser architecture that is
independent of the HTML structure of webpages. This allows easy on-the-fly
adding of new websites. Two types of users are targeted: end users who seek to
study the discussed topics and their temporal evolution, and researchers in
need of establishing a forum benchmark dataset and comparing the performances
of analysis tools.
","[{'version': 'v1', 'created': 'Tue, 28 Apr 2015 13:18:00 GMT'}]",2015-04-29,"[['Rizoiu', 'Marian-Andrei', ''], ['Guille', 'Adrien', ''], ['Velcin', 'Julien', '']]","['Social media analysis', 'topic extraction', 'visualization']"
16611,1407.2412,Monali Gulhane ku,Monali Gulhane and P. S. Mohod,Intelligent Fatigue Detection and Automatic Vehicle Control System,,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes method for detecting the early signs of fatigue in train
drivers. As soon as the train driver is falling in symptoms of fatigue
immediate message will be transfer to the control room indicating the status of
the drivers. In addition of the advance technology of heart rate sensors is
also added in the system for correct detection of status of driver if in either
case driver is falling to fatigue due to any sever medical problems .The
fatigue is detected in the system by the image processing method of comparing
the image(frames) in the video and by using the human features we are able to
estimate the indirect way of detecting fatigue. The technique also focuses on
modes of person when driving the train i.e. awake, drowsy state or sleepy and
sleep state. The system is very efficient to detect the fatigue and control the
train also train can be controlled if it cross any such signal by which the
train may collide on another train.
","[{'version': 'v1', 'created': 'Wed, 9 Jul 2014 10:04:10 GMT'}]",2014-07-10,"[['Gulhane', 'Monali', ''], ['Mohod', 'P. S.', '']]","['Fatigue', 'Drowsiness', 'Heart Rate Detection', 'Automatic Buzzer System.  1']"
16612,1704.02489,Arif Mohaimin Sadri,"Arif Mohaimin Sadri, Samiul Hasan, Satish V. Ukkusuri and Juan Esteban
  Suarez Lopez","Analyzing Social Interaction Networks from Twitter for Planned Special
  Events","20 pages, 6 figures, 1 table. arXiv admin note: text overlap with
  arXiv:1704.01706",,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The complex topology of real networks allows its actors to change their
functional behavior. Network models provide better understanding of the
evolutionary mechanisms being accountable for the growth of such networks by
capturing the dynamics in the ways network agents interact and change their
behavior. Considerable amount of research efforts is required for developing
novel network modeling techniques to understand the structural properties such
networks, reproducing similar properties based on empirical evidence, and
designing such networks efficiently. First, we demonstrate how to construct
social interaction networks using social media data and then present the key
findings obtained from the network analytics. We analyze the characteristics
and growth of such interaction networks, examine the network properties and
derive important insights based on the theories of network science literature.
We also discuss the application of such networks as a useful tool to
effectively disseminate targeted information during planned special events. We
observed that the degree-distributions of such networks follow power-law that
is indicative of the existence of fewer nodes in the network with higher levels
of interactions, and many other nodes with less interactions. While the network
elements and average user degree grow linearly each day, densities of such
networks tend to become zero. Largest connected components exhibit higher
connectivity (density) when compared with the whole graph. Network radius and
diameter become stable over time evidencing the small-world property. We also
observe increased transitivity and higher stability of the power-law exponents
as the networks grow. Data is specific to the Purdue University community and
two large events, namely Purdue Day of Giving and Senator Bernie Sanders' visit
to Purdue University as part of Indiana Primary Election 2016.
","[{'version': 'v1', 'created': 'Sat, 8 Apr 2017 12:40:51 GMT'}]",2017-04-11,"[['Sadri', 'Arif Mohaimin', ''], ['Hasan', 'Samiul', ''], ['Ukkusuri', 'Satish V.', ''], ['Lopez', 'Juan Esteban Suarez', '']]","['planned special events', 'social media', 'Twitter', 'user mention', 'social interaction', 'network science']"
16613,1209.1482,Haya Shulman,Amir Herzberg and Haya Shulman,Unilateral Antidotes to DNS Cache Poisoning,,SecureComm 2011,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate defenses against DNS cache poisoning focusing on mechanisms
that can be readily deployed unilaterally by the resolving organisation,
preferably in a single gateway or a proxy. DNS poisoning is (still) a major
threat to Internet security; determined spoofing attackers are often able to
circumvent currently deployed antidotes such as port randomisation. The
adoption of DNSSEC, which would foil DNS poisoning, remains a long-term
challenge. We discuss limitations of the prominent resolver-only defenses,
mainly port and IP randomisation, 0x20 encoding and birthday protection. We
then present two new (unilateral) defenses: the sandwich antidote and the NAT
antidote. The defenses are simple, effective and efficient, and can be
implemented in a gateway connecting the resolver to the Internet. The sandwich
antidote is composed of two phases: poisoning-attack detection and then
prevention. The NAT antidote adds entropy to DNS requests by switching the
resolver's IP address to a random address (belonging to the same autonomous
system). Finally, we show how to implement the birthday protection mechanism in
the gateway, thus allowing to restrict the number of DNS requests with the same
query to 1 even when the resolver does not support this.
","[{'version': 'v1', 'created': 'Fri, 7 Sep 2012 10:28:00 GMT'}]",2015-03-20,"[['Herzberg', 'Amir', ''], ['Shulman', 'Haya', '']]","['DNS security', 'unilateral defenses', 'cache poisoning']"
16614,0907.2300,Yao Sun,Yao Sun and Dingkang Wang,"An Efficient Algorithm for Factoring Polynomials over Algebraic
  Extension Field",,,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new efficient algorithm is proposed for factoring polynomials over an
algebraic extension field. The extension field is defined by a polynomial ring
modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no
extra Groebner basis computation is needed for factoring a polynomial over this
extension field. Nothing more than linear algebraic technique is used to get a
polynomial over the ground field by a generic linear map. Then this polynomial
is factorized over the ground field. From these factors, the factorization of
the polynomial over the extension field is obtained. The new algorithm has been
implemented and computer experiments indicate that the new algorithm is very
efficient, particularly in complicated examples.
","[{'version': 'v1', 'created': 'Tue, 14 Jul 2009 07:25:07 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Oct 2010 10:15:16 GMT'}]",2010-10-04,"[['Sun', 'Yao', ''], ['Wang', 'Dingkang', '']]","['algorithm', 'factorization', 'algebraic extension field']"
16615,1203.0740,Bo  Li,"Bo Li, Yijian Pei, Bin Shen, Hao Wu, Min He, Jundong Yang","Resource Availability-Aware Advance Reservation for Parallel Jobs with
  Deadlines","25 pages,7 figures",,,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Advance reservation is important to guarantee the quality of services of jobs
by allowing exclusive access to resources over a defined time interval on
resources. It is a challenge for the scheduler to organize available resources
efficiently and to allocate them for parallel AR jobs with deadline constraint
appropriately. This paper provides a slot-based data structure to organize
available resources of multiprocessor systems in a way that enables efficient
search and update operations, and formulates a suite of scheduling policies to
allocate resources for dynamically arriving AR requests. The performance of the
scheduling algorithms were investigated by simulations with different job sizes
and durations, system loads and scheduling flexibilities. Simulation results
show that job sizes and durations, system load and the flexibility of
scheduling will impact the performance metrics of all the scheduling
algorithms, and the PE-Worst-Fit algorithm becomes the best algorithm for the
scheduler with the highest acceptance rate of AR requests, and the jobs with
the First-Fit algorithm experience the lowest average slowdown. The data
structure and scheduling policies can be used to organize and allocate
resources for parallel AR jobs with deadline constraint in large-scale
computing systems.
","[{'version': 'v1', 'created': 'Sun, 4 Mar 2012 14:11:56 GMT'}]",2012-03-06,"[['Li', 'Bo', ''], ['Pei', 'Yijian', ''], ['Shen', 'Bin', ''], ['Wu', 'Hao', ''], ['He', 'Min', ''], ['Yang', 'Jundong', '']]","['multiprocessor', 'advance reservation', 'data structure', 'scheduling algorithm', 'deadline']"
16616,1501.02785,Mohammad Hassan Lotfi,"Mohammad Hassan Lotfi, Saswati Sarkar, Karthikeyan Sundaresan, and
  Mohammad Ali Khojastepour",The Economics of Quality Sponsored Data in Non-Neutral Networks,Submitted to IEEE/ACM Transaction on Networking,,,,cs.NI cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The growing demand for data has driven the Service Providers (SPs) to provide
differential treatment of traffic to generate additional revenue streams from
Content Providers (CPs). While SPs currently only provide best-effort services
to their CPs, it is plausible to envision a model in near future, where CPs are
willing to sponsor quality of service for their content in exchange of sharing
a portion of their profit with SPs. This quality sponsoring becomes invaluable
especially when the available resources are scarce such as in wireless
networks, and can be accommodated in a non-neutral network. In this paper, we
consider the problem of Quality-Sponsored Data (QSD) in a non-neutral network.
In our model, SPs allow CPs to sponsor a portion of their resources, and price
it appropriately to maximize their payoff. The payoff of the SP depends on the
monetary revenue and the satisfaction of end-users both for the non-sponsored
and sponsored content, while CPs generate revenue through advertisement. We
analyze the market dynamics and equilibria in two different frameworks, i.e.
sequential and bargaining game frameworks, and provide strategies for (i) SPs:
to determine if and how to price resources, and (ii) CPs: to determine if and
what quality to sponsor. The frameworks characterize different sets of
equilibrium strategies and market outcomes depending on the parameters of the
market.
","[{'version': 'v1', 'created': 'Mon, 12 Jan 2015 20:05:02 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Apr 2015 16:38:40 GMT'}, {'version': 'v3', 'created': 'Tue, 15 Sep 2015 04:55:57 GMT'}, {'version': 'v4', 'created': 'Fri, 29 Apr 2016 15:05:18 GMT'}, {'version': 'v5', 'created': 'Mon, 17 Oct 2016 16:55:20 GMT'}]",2016-10-18,"[['Lotfi', 'Mohammad Hassan', ''], ['Sarkar', 'Saswati', ''], ['Sundaresan', 'Karthikeyan', ''], ['Khojastepour', 'Mohammad Ali', '']]","['net neutrality', 'game theory', 'sponsored data plans', 'wireless networks']"
16617,1002.2182,Rdv Ijcsis,"T. Balakumaran, I.L.A. Vennila, C. Gowri Shankar","Detection of Microcalcification in Mammograms Using Wavelet Transform
  and Fuzzy Shell Clustering","IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS January 2010, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 7, No. 1, pp. 121-125, January 2010, USA",,"Journal of Computer Science, ISSN 19475500",cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Microcalcifications in mammogram have been mainly targeted as a reliable
earliest sign of breast cancer and their early detection is vital to improve
its prognosis. Since their size is very small and may be easily overlooked by
the examining radiologist, computer-based detection output can assist the
radiologist to improve the diagnostic accuracy. In this paper, we have proposed
an algorithm for detecting microcalcification in mammogram. The proposed
microcalcification detection algorithm involves mammogram quality enhancement
using multirresolution analysis based on the dyadic wavelet transform and
microcalcification detection by fuzzy shell clustering. It may be possible to
detect nodular components such as microcalcification accurately by introducing
shape information. The effectiveness of the proposed algorithm for
microcalcification detection is confirmed by experimental results.
","[{'version': 'v1', 'created': 'Wed, 10 Feb 2010 19:22:25 GMT'}]",2010-02-11,"[['Balakumaran', 'T.', ''], ['Vennila', 'I. L. A.', ''], ['Shankar', 'C. Gowri', '']]","['Computer-aided diagnosis', 'dyadic wavelet transform', 'skewness and kurtosis', 'Fuzzy shell clustering']"
16618,0909.1138,Richard Diamond,Richard V. Diamond,"User Experience, Software Interfaces, and The Unconscious",Under Review,,,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Ideas about how to increase the unconscious participation in interaction
between 'a human' and 'a computer' are developed in this paper. Evidence of
impact of the unconscious functioning is presented. The unconscious is
characterised as being a responsive, contextual, and autonomous participant of
human-computer interaction. The unconscious participation occurs independently
of one's cognitive and educational levels and, if ignored, leads to learning
inefficiencies and compulsive behaviours, illustrations of which are provided.
Three practical approaches to a study of subjective user experience are
outlined as follows: (a) tracing operant conditioning effects of software, (b)
registering signs of brain activity psychological or information processing
meaning of which is well-explored and (c) exploring submodality interfaces.
Implications for improvement of current usability study methods, such as
eye-tracking, are generally considered. Conclusions consider advantages and
disadvantages of unconscious-embracing design and remind about a loss of human
evolutionary choices if unconscious participation is ignored, complicated or
blocked in interaction with computer interfaces and built environment.
","[{'version': 'v1', 'created': 'Mon, 7 Sep 2009 03:15:42 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Sep 2009 04:20:05 GMT'}, {'version': 'v3', 'created': 'Mon, 2 Nov 2009 01:46:35 GMT'}]",2009-11-02,"[['Diamond', 'Richard V.', '']]","['design', 'interface', 'user experience', 'human factors', 'unconscious', 'evolution']"
16619,1307.0571,Marius Nicolae,Marius Nicolae and Sanguthevar Rajasekaran,Efficient Sequential and Parallel Algorithms for Planted Motif Search,,,,,cs.DS cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motif searching is an important step in the detection of rare events
occurring in a set of DNA or protein sequences. One formulation of the problem
is known as (l,d)-motif search or Planted Motif Search (PMS). In PMS we are
given two integers l and d and n biological sequences. We want to find all
sequences of length l that appear in each of the input sequences with at most d
mismatches. The PMS problem is NP-complete. PMS algorithms are typically
evaluated on certain instances considered challenging. This paper presents an
exact parallel PMS algorithm called PMS8. PMS8 is the first algorithm to solve
the challenging (l,d) instances (25,10) and (26,11). PMS8 is also efficient on
instances with larger l and d such as (50,21). This paper also introduces
necessary and sufficient conditions for 3 l-mers to have a common d-neighbor.
","[{'version': 'v1', 'created': 'Tue, 2 Jul 2013 01:51:06 GMT'}]",2013-07-03,"[['Nicolae', 'Marius', ''], ['Rajasekaran', 'Sanguthevar', '']]","['Planted Motif Search', 'PMS', 'Parallel Algorithms', 'MPI']"
16620,1406.6529,Christian Bauckhage,"Christian Bauckhage, Kristian Kersting","Strong Regularities in Growth and Decline of Popularity of Social Media
  Services",,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze general trends and pattern in time series that characterize the
dynamics of collective attention to social media services and Web-based
businesses. Our study is based on search frequency data available from Google
Trends and considers 175 different services. For each service, we collect data
from 45 different countries as well as global averages. This way, we obtain
more than 8,000 time series which we analyze using diffusion models from the
economic sciences. We find that these models accurately characterize the
empirical data and our analysis reveals that collective attention to social
media grows and subsides in a highly regular and predictable manner.
Regularities persist across regions, cultures, and topics and thus hint at
general mechanisms that govern the adoption of Web-based services. We discuss
several cases in detail to highlight interesting findings. Our methods are of
economic interest as they may inform investment decisions and can help
assessing at what stage of the general life-cycle a Web service is at.
","[{'version': 'v1', 'created': 'Wed, 25 Jun 2014 11:47:44 GMT'}]",2014-06-26,"[['Bauckhage', 'Christian', ''], ['Kersting', 'Kristian', '']]","['social media services', 'collective attention', 'trend prediction']"
16621,1402.0239,Wojciech Mazurczyk,"Bartosz Lipinski, Wojciech Mazurczyk, Krzysztof Szczypiorski","Improving Hard Disk Contention-based Covert Channel in Cloud Computing
  Environment","8 pages, 9 figures, 1 table",,,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Steganographic methods allow the covert exchange of secret data between
parties aware of the procedure. The cloud computing environment is a new and
hot target for steganographers, and currently not many solutions have been
proposed. This paper proposes CloudSteg which is a steganographic method that
allows the creation of a covert channel based on hard disk contention between
the two cloud instances that reside on the same physical machine. Experimental
results conducted using open source cloud environment OpenStack, show that
CloudSteg is able to achieve a bandwidth of about 0.1 bps which is 1000 times
higher than is known from the state-of-the-art version.
","[{'version': 'v1', 'created': 'Sun, 2 Feb 2014 20:01:30 GMT'}]",2014-02-04,"[['Lipinski', 'Bartosz', ''], ['Mazurczyk', 'Wojciech', ''], ['Szczypiorski', 'Krzysztof', '']]","['covert channel', 'steganography', 'cloud computing', 'information hiding']"
16622,1603.06182,Haimin Zhang,Haimin Zhang,"Modelling Temporal Information Using Discrete Fourier Transform for
  Video Classification",to be revised,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, video classification attracts intensive research efforts. However,
most existing works are based on framelevel visual features, which might fail
to model the temporal information, e.g. characteristics accumulated along time.
In order to capture video temporal information, we propose to analyse features
in frequency domain transformed by discrete Fourier transform (DFT features).
Frame-level features are firstly extract by a pre-trained deep convolutional
neural network (CNN). Then, time domain features are transformed and
interpolated into DFT features. CNN and DFT features are further encoded by
using different pooling methods and fused for video classification. In this
way, static image features extracted from a pre-trained deep CNN and temporal
information represented by DFT features are jointly considered for video
classification. We test our method for video emotion classification and action
recognition. Experimental results demonstrate that combining DFT features can
effectively capture temporal information and therefore improve the performance
of both video emotion classification and action recognition. Our approach has
achieved a state-of-the-art performance on the largest video emotion dataset
(VideoEmotion-8 dataset) and competitive results on UCF-101.
","[{'version': 'v1', 'created': 'Sun, 20 Mar 2016 04:28:21 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Mar 2016 00:42:37 GMT'}, {'version': 'v3', 'created': 'Wed, 20 Jul 2016 07:29:40 GMT'}, {'version': 'v4', 'created': 'Thu, 21 Jul 2016 01:17:17 GMT'}, {'version': 'v5', 'created': 'Wed, 17 Aug 2016 00:48:55 GMT'}]",2016-08-18,"[['Zhang', 'Haimin', '']]","['video classification', 'temporal information', 'discrete Fourier transform', 'CNN']"
16623,1412.7868,P.K. Srijith,"P. K. Srijith, P. Balamurugan and Shirish Shevade",Gaussian Process Pseudo-Likelihood Models for Sequence Labeling,"18 pages, 5 figures",,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several machine learning problems arising in natural language processing can
be modeled as a sequence labeling problem. We provide Gaussian process models
based on pseudo-likelihood approximation to perform sequence labeling. Gaussian
processes (GPs) provide a Bayesian approach to learning in a kernel based
framework. The pseudo-likelihood model enables one to capture long range
dependencies among the output components of the sequence without becoming
computationally intractable. We use an efficient variational Gaussian
approximation method to perform inference in the proposed model. We also
provide an iterative algorithm which can effectively make use of the
information from the neighboring labels to perform prediction. The ability to
capture long range dependencies makes the proposed approach useful for a wide
range of sequence labeling problems. Numerical experiments on some sequence
labeling data sets demonstrate the usefulness of the proposed approach.
","[{'version': 'v1', 'created': 'Thu, 25 Dec 2014 21:59:46 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Sep 2016 05:41:08 GMT'}]",2016-09-22,"[['Srijith', 'P. K.', ''], ['Balamurugan', 'P.', ''], ['Shevade', 'Shirish', '']]","['Gaussian processes', 'sequence labeling', 'variational inference']"
16624,1009.0078,Wei Yang,"Wei Yang, Lihua Li, and Wanlu Sun","Energy-Efficient Relay Selection and Optimal Relay Location in
  Cooperative Cellular Networks with Asymmetric Traffic","To appear in Journal of China Universities of Posts and
  Telecommunications",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Energy-efficient communication is an important requirement for mobile relay
networks due to the limited battery power of user terminals. This paper
considers energy-efficient relaying schemes through selection of mobile relays
in cooperative cellular systems with asymmetric traffic. The total energy
consumption per information bit of the battery-powered terminals, i.e., the
mobile station (MS) and the relay, is derived in theory. In the Joint Uplink
and Downlink Relay Selection (JUDRS) scheme we proposed, the relay which
minimizes the total energy consumption is selected. Additionally, the
energy-efficient cooperation regions are investigated, and the optimal relay
location is found for cooperative cellular systems with asymmetric traffic. The
results reveal that the MS-relay and the relay-base station (BS) channels have
different influence over relay selection decisions for optimal
energy-efficiency. Information theoretic analysis of the diversity-multiplexing
tradeoff (DMT) demonstrates that the proposed scheme achieves full spatial
diversity in the quantity of cooperating terminals in this network. Finally,
numerical results further confirm a significant energy efficiency gain of the
proposed algorithm comparing to the previous best worse channel selection and
best harmonic mean selection algorithms.
","[{'version': 'v1', 'created': 'Wed, 1 Sep 2010 02:37:57 GMT'}]",2010-09-02,"[['Yang', 'Wei', ''], ['Li', 'Lihua', ''], ['Sun', 'Wanlu', '']]","['energy-efficient', 'relay selection', 'cooperative communication', 'optimal relay location', 'asymmetric traffic']"
16625,1304.3183,M.M.A. Hashem,"Palash Gupta, Hussain Mohammed and M.M.A. Hashem","Characterization of Downlink Transmit Power Control during Soft Handover
  in WCDMA Systems",,"Procs. of the 9th International Conference on Computer and
  Information Technology (ICCIT 2006), pp. 448-452, Dhaka, Bangladesh, December
  21-23, (2006)",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the characterization of power control in WCDMA systems.
We know that CDMA is an interference limited system. It is shown that the
unbalance scheme is reliable and successful for both 2-way and 3-way soft
handover. Unbalance scheme minimizes interference and speed up the soft
handover algorithm to support more users quickly. Furthermore it requires
minimum time to make decision for proper power control in soft handover status.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2013 03:04:18 GMT'}]",2013-04-12,"[['Gupta', 'Palash', ''], ['Mohammed', 'Hussain', ''], ['Hashem', 'M. M. A.', '']]","['Downlink capacity', 'Soft handover', 'Power control', 'WCDMA']"
16626,1106.5457,Ilango Sriram,John Cartlidge and Ilango Sriram,Modelling Resilience in Cloud-Scale Data Centres,"To appear in: Proceedings of the 23rd European Modeling & Simulation
  Symposium (Simulation in Industry) 2011",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The trend for cloud computing has initiated a race towards data centres (DC)
of an ever-increasing size. The largest DCs now contain many hundreds of
thousands of virtual machine (VM) services. Given the finite lifespan of
hardware, such large DCs are subject to frequent hardware failure events that
can lead to disruption of service. To counter this, multiple redundant copies
of task threads may be distributed around a DC to ensure that individual
hardware failures do not cause entire jobs to fail. Here, we present results
demonstrating the resilience of different job scheduling algorithms in a
simulated DC with hardware failure. We use a simple model of jobs distributed
across a hardware network to demonstrate the relationship between resilience
and additional communication costs of different scheduling methods.
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2011 17:31:49 GMT'}]",2011-06-28,"[['Cartlidge', 'John', ''], ['Sriram', 'Ilango', '']]","['cloud computing', 'simulation modelling', 'data centres', 'resilience']"
16627,1406.5797,Masao Kasahara,Masao Kasahara and Shigeichi Hirasawa,Constructions of A Large Class of Optimum Constant Weight Codes over F_2,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new method of constructing optimum constant weight codes over F_2 based on
a generalized $(u, u+v)$ construction is presented. We present a new method of
constructing superimposed code $C_{(s_1,s_2,\cdots,s_I)}^{(h_1, h_2, \cdots,
h_I)}$ bound. and presented a large class of optimum constant weight codes over
F_2 that meet the bound due to Brouwer and Verhoeff, which will be referred to
as BV . We present large classes of optimum constant weight codes over F_2 for
$k=2$ and $k=3$ for $n \leqq 128$. We also present optimum constant weight
codes over F_2 that meet the BV bound for $k=2,3,4,5$ and 6, for $n \leqq 128$.
The authors would like to present the following conjectures :
  $C_{I}$: $C_{(s_1)}^{(h_1)}$ presented in this paper yields the optimum
constant weight codes for the code-length $n=3h_1$, number of information
symbols $k=2$ and minimum distance $d=2h_1$ for any positive integer $h_1$.
  $C_{II}$: $C_{(s_1)}^{(h_1)}$ yields the optimum constant weight codes at
$n=7h_1, k=3$ and $d=4h_1$ for any $h_1$.
  $C_{III}$: Code $C_{(s_1,s_2,\cdots,s_I)}^{(h_1, h_2, \cdots, h_I)}$ yields
the optimum constant weight codes of length $n=2^{k+1}-2$, and minimum distance
$d=2^{k}$ for any number of information symbols $k\geq 3$.
","[{'version': 'v1', 'created': 'Mon, 23 Jun 2014 02:32:52 GMT'}]",2014-06-24,"[['Kasahara', 'Masao', ''], ['Hirasawa', 'Shigeichi', '']]","['Optimum code', 'Constant weight code', 'Brouwer·Verhoef bound', '(u', 'u + v) construction']"
16628,1705.05509,Yang Yang,"W Su, Y Yang, Z Zhou, X Tang",New quaternary sequences of even length with optimal auto-correlation,"This paper was submitted to Science China: Information Sciences at
  Oct 16, 2016, and accpted for publication at Apr 27, 2017",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sequences with low auto-correlation property have been applied in
code-division multiple access communication systems, radar and cryptography.
Using the inverse Gray mapping, a quaternary sequence of even length $N$ can be
obtained from two binary sequences of the same length, which are called
component sequences. In this paper, using interleaving method, we present
several classes of component sequences from twin-prime sequences pairs or GMW
sequences pairs given by Tang and Ding in 2010; two, three or four binary
sequences defined by cyclotomic classes of order $4$. Hence we can obtain new
classes of quaternary sequences, which are different from known ones, since
known component sequences are constructed from a pair of binary sequences with
optimal auto-correlation or Sidel'nikov sequences.
","[{'version': 'v1', 'created': 'Tue, 16 May 2017 03:00:11 GMT'}]",2017-05-17,"[['Su', 'W', ''], ['Yang', 'Y', ''], ['Zhou', 'Z', ''], ['Tang', 'X', '']]","['Binary sequences', 'quaternary sequences', 'Gray mapping', 'interleaving', 'cyclotomy']"
16629,1702.03812,Stefano Nichele,Stefano Nichele and Magnus S. Gundersen,Reservoir Computing Using Non-Uniform Binary Cellular Automata,,,,,cs.ET cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Reservoir Computing (RC) paradigm utilizes a dynamical system, i.e., a
reservoir, and a linear classifier, i.e., a read-out layer, to process data
from sequential classification tasks. In this paper the usage of Cellular
Automata (CA) as a reservoir is investigated. The use of CA in RC has been
showing promising results. In this paper, selected state-of-the-art experiments
are reproduced. It is shown that some CA-rules perform better than others, and
the reservoir performance is improved by increasing the size of the CA
reservoir itself. In addition, the usage of parallel loosely coupled
CA-reservoirs, where each reservoir has a different CA-rule, is investigated.
The experiments performed on quasi-uniform CA reservoir provide valuable
insights in CA reservoir design. The results herein show that some rules do not
work well together, while other combinations work remarkably well. This
suggests that non-uniform CA could represent a powerful tool for novel CA
reservoir implementations.
","[{'version': 'v1', 'created': 'Mon, 13 Feb 2017 15:23:06 GMT'}]",2017-02-14,"[['Nichele', 'Stefano', ''], ['Gundersen', 'Magnus S.', '']]","['Reservoir Computing', 'Cellular Automata', 'ParallelReservoir', 'Recurrent Neural Networks', 'Non-Uniform Cellular Automata']"
16630,1209.1300,Nisheeth Joshi,"Nisheeth Joshi, Iti Mathur",Input Scheme for Hindi Using Phonetic Mapping,"Proceedings of National Conference on ICT: Theory, Practice and
  Applications. SPSU Press. Organized by Sir Padampat Singhania University,
  Udaipur. Sponsored by CSIR, New Delhi. March, 2010",,,,cs.CL,http://creativecommons.org/licenses/by/3.0/,"  Written Communication on Computers requires knowledge of writing text for the
desired language using Computer. Mostly people do not use any other language
besides English. This creates a barrier. To resolve this issue we have
developed a scheme to input text in Hindi using phonetic mapping scheme. Using
this scheme we generate intermediate code strings and match them with
pronunciations of input text. Our system show significant success over other
input systems available.
","[{'version': 'v1', 'created': 'Sun, 19 Aug 2012 02:38:12 GMT'}]",2012-09-07,"[['Joshi', 'Nisheeth', ''], ['Mathur', 'Iti', '']]","['Transliteration', 'Text Input', 'Hindi', 'Phonetic Mapping', 'Human Computer Interaction.    1']"
16631,1504.08168,Jan \v{Z}egklitz,Jan \v{Z}egklitz and Petr Po\v{s}\'ik,"Model Selection and Overfitting in Genetic Programming: Empirical Study
  [Extended Version]","8 pages, 12 figures, full paper for GECCO 2015 (accepted as poster,
  this is the original paper submitted to the conference); added subtitle and
  removed copyright text at the first page, fixed some typography",,,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Genetic Programming has been very successful in solving a large area of
problems but its use as a machine learning algorithm has been limited so far.
One of the reasons is the problem of overfitting which cannot be solved or
suppresed as easily as in more traditional approaches. Another problem, closely
related to overfitting, is the selection of the final model from the
population.
  In this article we present our research that addresses both problems:
overfitting and model selection. We compare several ways of dealing with
ovefitting, based on Random Sampling Technique (RST) and on using a validation
set, all with an emphasis on model selection. We subject each approach to a
thorough testing on artificial and real--world datasets and compare them with
the standard approach, which uses the full training data, as a baseline.
","[{'version': 'v1', 'created': 'Thu, 30 Apr 2015 11:12:52 GMT'}, {'version': 'v2', 'created': 'Mon, 4 May 2015 14:29:34 GMT'}]",2015-05-05,"[['Žegklitz', 'Jan', ''], ['Pošík', 'Petr', '']]","['machine learning', 'genetic programming', 'grammatical evolution', 'overfitting']"
16632,0803.0048,Xin Dong,"Xin Dong, Gene Cooperman","A Bit-Compatible Shared Memory Parallelization for ILU(k)
  Preconditioning and a Bit-Compatible Generalization to Distributed Memory",25 pages,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  ILU(k) is a commonly used preconditioner for iterative linear solvers for
sparse, non-symmetric systems. It is often preferred for the sake of its
stability. We present TPILU(k), the first efficiently parallelized ILU(k)
preconditioner that maintains this important stability property. Even better,
TPILU(k) preconditioning produces an answer that is bit-compatible with the
sequential ILU(k) preconditioning. In terms of performance, the TPILU(k)
preconditioning is shown to run faster whenever more cores are made available
to it --- while continuing to be as stable as sequential ILU(k). This is in
contrast to some competing methods that may become unstable if the degree of
thread parallelism is raised too far. Where Block Jacobi ILU(k) fails in an
application, it can be replaced by TPILU(k) in order to maintain good
performance, while also achieving full stability. As a further optimization,
TPILU(k) offers an optional level-based incomplete inverse method as a fast
approximation for the original ILU(k) preconditioned matrix. Although this
enhancement is not bit-compatible with classical ILU(k), it is bit-compatible
with the output from the single-threaded version of the same algorithm. In
experiments on a 16-core computer, the enhanced TPILU(k)-based iterative linear
solver performed up to 9 times faster. As we approach an era of many-core
computing, the ability to efficiently take advantage of many cores will become
ever more important. TPILU(k) also demonstrates good performance on cluster or
Grid. For example, the new algorithm achieves 50 times speedup with 80 nodes
for general sparse matrices of dimension 160,000 that are diagonally dominant.
","[{'version': 'v1', 'created': 'Sat, 1 Mar 2008 07:21:27 GMT'}, {'version': 'v2', 'created': 'Sun, 3 Oct 2010 05:30:32 GMT'}, {'version': 'v3', 'created': 'Tue, 3 May 2011 19:48:42 GMT'}, {'version': 'v4', 'created': 'Thu, 12 May 2011 06:02:29 GMT'}]",2011-05-13,"[['Dong', 'Xin', ''], ['Cooperman', 'Gene', '']]","['ILU(k)', 'bit-compatible parallelization', 'preconditioning', 'Gaussianelimination', 'task-oriented parallelism']"
16633,1501.02716,Peter Robinson,"Martin Biely and Peter Robinson and Ulrich Schmid and Manfred Schwarz
  and Kyrill Winkler","Gracefully Degrading Consensus and $k$-Set Agreement in Directed Dynamic
  Networks",arXiv admin note: text overlap with arXiv:1204.0641,,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study distributed agreement in synchronous directed dynamic networks,
where an omniscient message adversary controls the availability of
communication links. We prove that consensus is impossible under a message
adversary that guarantees weak connectivity only, and introduce vertex-stable
root components (VSRCs) as a means for circumventing this impossibility: A
VSRC(k, d) message adversary guarantees that, eventually, there is an interval
of $d$ consecutive rounds where every communication graph contains at most $k$
strongly (dynamic) connected components consisting of the same processes, which
have at most outgoing links to the remaining processes. We present a consensus
algorithm that works correctly under a VSRC(1, 4H + 2) message adversary, where
$H$ is the dynamic causal network diameter. On the other hand, we show that
consensus is impossible against a VSRC(1, H - 1) or a VSRC(2, $\infty$) message
adversary, revealing that there is not much hope to deal with stronger message
adversaries.
  However, we show that gracefully degrading consensus, which degrades to
general $k$-set agreement in case of unfavourable network conditions, is
feasible against stronger message adversaries: We provide a $k$-uniform $k$-set
agreement algorithm, where the number of system-wide decision values $k$ is not
encoded in the algorithm, but rather determined by the actual power of the
message adversary in a run: Our algorithm guarantees at most $k$ decision
values under a VSRC(n, d) + MAJINF(k) message adversary, which combines VSRC(n,
d) (for some small $d$, ensuring termination) with some information flow
guarantee MAJINF(k) between certain VSRCs (ensuring $k$-agreement). Our results
provide a significant step towards the exact solvability/impossibility border
of general $k$-set agreement in directed dynamic networks.
","[{'version': 'v1', 'created': 'Mon, 12 Jan 2015 16:54:52 GMT'}]",2015-01-13,"[['Biely', 'Martin', ''], ['Robinson', 'Peter', ''], ['Schmid', 'Ulrich', ''], ['Schwarz', 'Manfred', ''], ['Winkler', 'Kyrill', '']]","['Directed dynamic networks', 'consensus', 'k-set agreement', 'message adveraries', 'impossibility results', 'lower bounds']"
16634,1610.07033,Martin Leinberger,"Martin Leinberger and Ralf L\""ammel and Steffen Staab",LambdaDL: Syntax and Semantics (Preliminary Report),,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semantic data fuels many different applications, but is still lacking proper
integration into programming languages. Untyped access is error-prone while
mapping approaches cannot fully capture the conceptualization of semantic data.
In this paper, we present $\lambda_{DL}$,a $\lambda$-calculus with a modified
type system to provide type-safe integration of semantic data. This is achieved
by the integration of description logics into the $\lambda$-calculus for typing
and data access. It is centered around several key design principles. Among
these are (1) the usage of semantic conceptualizations as types, (2) subtype
inference for these types, and (3) type-checked query access to the data by
both ensuring the satisfiability of queries as well as typing query results
precisely in $\lambda_{DL}$. The paper motivates the use of a modified type
system for semantic data and it provides the theoretic foundation for the
integration of description logics as well as the core formal specifications of
$\lambda_{DL}$ including a proof of type safety.
","[{'version': 'v1', 'created': 'Sat, 22 Oct 2016 11:07:59 GMT'}]",2016-10-25,"[['Leinberger', 'Martin', ''], ['Lämmel', 'Ralf', ''], ['Staab', 'Steffen', '']]","['Semantic data', 'Type systems', 'Typecase']"
16635,1710.04176,Yueru Chen,C.-C. Jay Kuo and Yueru Chen,On Data-Driven Saak Transform,"30 pages, 7 figures, 4 tables",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Being motivated by the multilayer RECOS (REctified-COrrelations on a Sphere)
transform, we develop a data-driven Saak (Subspace approximation with augmented
kernels) transform in this work. The Saak transform consists of three steps: 1)
building the optimal linear subspace approximation with orthonormal bases using
the second-order statistics of input vectors, 2) augmenting each transform
kernel with its negative, 3) applying the rectified linear unit (ReLU) to the
transform output. The Karhunen-Lo\'eve transform (KLT) is used in the first
step. The integration of Steps 2 and 3 is powerful since they resolve the sign
confusion problem, remove the rectification loss and allow a straightforward
implementation of the inverse Saak transform at the same time. Multiple Saak
transforms are cascaded to transform images of a larger size. All Saak
transform kernels are derived from the second-order statistics of input random
vectors in a one-pass feedforward manner. Neither data labels nor
backpropagation is used in kernel determination. Multi-stage Saak transforms
offer a family of joint spatial-spectral representations between two extremes;
namely, the full spatial-domain representation and the full spectral-domain
representation. We select Saak coefficients of higher discriminant power to
form a feature vector for pattern recognition, and use the MNIST dataset
classification problem as an illustrative example.
","[{'version': 'v1', 'created': 'Wed, 11 Oct 2017 17:08:28 GMT'}, {'version': 'v2', 'created': 'Sat, 14 Oct 2017 17:40:37 GMT'}]",2017-10-17,"[['Kuo', 'C. -C. Jay', ''], ['Chen', 'Yueru', '']]","['Data-Driven Transform', 'RECOS Transform', 'Saak Transform', 'the Karhunen-Lo´eve transform (KLT)', 'Linear Subspace Approximation', 'Principal Component Analysis']"
16636,1603.06675,Swaroop Ghosh,"Nitin Rathi, Helia Naeimi and Swaroop Ghosh",Side Channel Attacks on STTRAM and Low-Overhead Countermeasures,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spin Transfer Torque RAM (STTRAM) is a promising candidate for Last Level
Cache (LLC) due to high endurance, high density and low leakage. One of the
major disadvantages of STTRAM is high write latency and write current.
Additionally, the latency and current depends on the polarity of the data being
written. These features introduce major security vulnerabilities and expose the
cache memory to side channel attacks. In this paper we propose a novel side
channel attack model where the adversary can monitor the supply current of the
memory array to partially identify the sensitive cache data that is being read
or written. We propose several low cost solutions such as short retention
STTRAM, 1-bit parity, multi-bit random write and constant current write driver
to mitigate the attack. 1-bit parity reduces the number of distinct write
current states by 30% for 32-bit word and the current signature is further
obfuscated by multi-bit random writes. The constant current write makes it more
challenging for the attacker to extract the entire word using a single supply
current signature.
","[{'version': 'v1', 'created': 'Tue, 22 Mar 2016 04:44:49 GMT'}]",2016-03-23,"[['Rathi', 'Nitin', ''], ['Naeimi', 'Helia', ''], ['Ghosh', 'Swaroop', '']]","['Side Channel Attack', 'Last Level Cache', 'STTRAM', 'Data Privacy']"
16637,1212.2864,Lazar Velimirovic,"Jelena Nikolic, Zoran Peric, Lazar Velimirovic","Simple Solution for Designing the Piecewise Linear Scalar Companding
  Quantizer for Gaussian Source",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To overcome the difficulties in determining an inverse compressor function
for a Gaussian source, which appear in designing the nonlinear optimal
companding quantizers and also in the nonlinear optimal companding quantization
procedure, in this paper a piecewise linear compressor function based on the
first derivate approximation of the optimal compressor function is proposed. We
show that the approximations used in determining the piecewise linear
compressor function contribute to the simple solution for designing the novel
piecewise linear scalar companding quantizer (PLSCQ) for a Gaussian source of
unit variance. For the given number of segments, we perform optimization
procedure in order to obtain optimal value of the support region threshold
which maximizes the signal to quantization noise ratio (SQNR) of the proposed
PLSCQ. We study how the SQNR of the considered PLSCQ depends on the number of
segments and we show that for the given number of quantization levels, SQNR of
the PLSCQ approaches the one of the nonlinear optimal companding quantizer with
the increase of the number of segments. The presented features of the proposed
PLSCQ indicate that the obtained model should be of high practical significance
for quantization of signals having Gaussian probability density function.
","[{'version': 'v1', 'created': 'Wed, 12 Dec 2012 16:19:57 GMT'}]",2012-12-13,"[['Nikolic', 'Jelena', ''], ['Peric', 'Zoran', ''], ['Velimirovic', 'Lazar', '']]","['piecewise linear scalar companding quantizer', 'support region threshold optimization', 'compressor function']"
16638,1110.1277,Amel Ben Hadj Salem Mhamdia,"Amel Ben Hadj Salem-Mhamdia, Bahia Bejar Ghadhab","Performance improvement of the software development project using the
  Value Management approach",,"IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 3, No. 2, 2011, 298-306",,,cs.SE cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Improving performance and delivering value for customers have become a
central theme in business. The software industry has become an increasingly
important sector for the economy growth in Tunisia. This study aims to show how
using Value Management in the Tunisian software industry for project analysis
gives new insight about true project value and performance. This new approach
is considered as an appropriate tool for guiding the process of making
decisions. It offers tools in order to analyze the service value from the
customer and organization perspectives. The results showed that the VM allows
to have better performance in the software development project by linking
customer satisfaction and cost analysis. The present case shows to service
managers how they can benchmark project function to reduce their costs and
improve resource allocation taking into consideration what customers consider
important during their overall service experience. It can identify best
professional practices, orient decisions to improve service value
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2011 07:25:37 GMT'}]",2011-10-07,"[['Salem-Mhamdia', 'Amel Ben Hadj', ''], ['Ghadhab', 'Bahia Bejar', '']]","['Process driven Services', 'Business collaboration Network', 'Interoperability Assessment', 'Periodic Monitoring']"
16639,1212.2614,Michael  Gr. Voskoglou Prof. Dr.,Michael Gr. Voskoglou,A Study on Fuzzy Systems,"9 pages, 3 figures, 1 table","American Journal of Computational and Applied Mathematics, 2(5),
  232-240, 2012",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We use princiles of fuzzy logic to develop a general model representing
several processes in a system's operation characterized by a degree of
vagueness and/or uncertainy. Further, we introduce three altenative measures of
a fuzzy system's effectiveness connected to the above model. An applcation is
also developed for the Mathematical Modelling process illustrating our results.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2012 20:31:01 GMT'}]",2012-12-12,"[['Voskoglou', 'Michael Gr.', '']]","['Systems Theory', 'Fuzzy Sets and Logic', 'Possibility', 'Uncertainty', 'Center of Mass', 'Mathematical Modelling']"
16640,1701.03734,Seyed Navid Mirnouri Langeroudi,Navid Mirnouri,"Applying Data Compression Techniques on Systolic Neural Network
  Accelerator","6 pages,2 figures",,,,cs.DC,http://creativecommons.org/publicdomain/zero/1.0/,"  New directions in computing and algorithms has lead to some new applications
that have tolerance to imprecision. Although, These applications are creating
large volumes of data which exceeds the capability of today's computing
systems. Therefore, researchers are trying to find new techniques to alleviate
this crisis. Approximate Computing is one promising technique that uses a trade
off between precision and efficiency of computing. Acceleration is another
solution that uses specialized logics in order to do computations in a way that
is more power efficient. Another technique is Data compression which is used in
memory systems in order to save capacity and bandwidth.
","[{'version': 'v1', 'created': 'Tue, 13 Dec 2016 13:41:23 GMT'}]",2017-01-16,"[['Mirnouri', 'Navid', '']]","['Approximate Computing', 'Neural Acceleration', 'Data Compression', 'SNNAP']"
16641,1107.4157,Nizami Gasilov,"Nizami Gasilov, \c{S}ahin Emrah Amrahov and Afet Golayo\u{g}lu
  Fatullayev",Linear Differential Equations with Fuzzy Boundary Values,"5 pages, 2 figures",,,,cs.NA cs.CE math.DS math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, we consider a linear differential equation with fuzzy boundary
values. We express the solution of the problem in terms of a fuzzy set of crisp
real functions. Each real function from the solution set satisfies differential
equation, and its boundary values belong to intervals, determined by the
corresponding fuzzy numbers. The least possibility among possibilities of
boundary values in corresponding fuzzy sets is defined as the possibility of
the real function in the fuzzy solution. In order to find the fuzzy solution we
propose a method based on the properties of linear transformations. We show
that, if the corresponding crisp problem has a unique solution then the fuzzy
problem has unique solution too. We also prove that if the boundary values are
triangular fuzzy numbers, then the value of the solution at any time is also a
triangular fuzzy number. We find that the fuzzy solution determined by our
method is the same as the one that is obtained from solution of crisp problem
by the application of the extension principle. We present two examples
describing the proposed method.
","[{'version': 'v1', 'created': 'Thu, 21 Jul 2011 04:46:02 GMT'}]",2011-07-22,"[['Gasilov', 'Nizami', ''], ['Amrahov', 'Şahin Emrah', ''], ['Fatullayev', 'Afet Golayoğlu', '']]","['fuzzy boundary value problem', 'fuzzy set', 'lineartransformation']"
16642,1603.09631,Miroslav Vodol\'an,"Miroslav Vodol\'an, Filip Jur\v{c}\'i\v{c}ek",Data Collection for Interactive Learning through the Dialog,,,,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a dataset collected from natural dialogs which enables to
test the ability of dialog systems to learn new facts from user utterances
throughout the dialog. This interactive learning will help with one of the most
prevailing problems of open domain dialog system, which is the sparsity of
facts a dialog system can reason about. The proposed dataset, consisting of
1900 collected dialogs, allows simulation of an interactive gaining of
denotations and questions explanations from users which can be used for the
interactive learning.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2016 15:13:51 GMT'}, {'version': 'v2', 'created': 'Sun, 15 May 2016 13:03:26 GMT'}]",2016-05-17,"[['Vodolán', 'Miroslav', ''], ['Jurčíček', 'Filip', '']]","['dataset', 'data collection', 'dialog', 'knowledge graph', 'interactive learning']"
16643,1212.5801,Youssef Bassil,Youssef Bassil,Image Steganography Method Based on Brightness Adjustment,"LACSC Lebanese Association for Computational Sciences,
  http://www.lacsc.org. arXiv admin note: text overlap with arXiv:1212.2064","Advances in Computer Science and its Applications (ACSA), Vol. 2,
  No. 2, 2012",,,cs.CR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Steganography is an information hiding technique in which secret data are
secured by covering them into a computer carrier file without damaging the file
or changing its size. The difference between steganography and cryptography is
that steganography is a stealthy method of communication that only the
communicating parties are aware of; while, cryptography is an overt method of
communication that anyone is aware of, despite its payload is scribbled.
Typically, an irrecoverable steganography algorithm is the algorithm that makes
it hard for malicious third parties to discover how it works and how to recover
the secret data out of the carrier file. One popular way to achieve
irrecoverability is to digitally process the carrier file after hiding the
secret data into it. However, such process is irreversible as it would destroy
the concealed data. This paper proposes a new image steganography method for
textual data, as well as for any form of digital data, based on adjusting the
brightness of the carrier image after covering the secret data into it. The
algorithm used is parameterized as it can be configured using three different
parameters defined by the communicating parties. They include the amount of
brightness to apply on the carrier image after the completion of the covering
process, the color channels whose brightness should be adjusted, and the bytes
that should carry in the secret data. The novelty of the proposed method is
that it embeds bits of the secret data into the three LSBs of the bytes that
compose the carrier image in such a way that does not destroy the secret data
when restoring back the original brightness of the carrier image. The
simulation conducted proved that the proposed algorithm is valid and correct.
","[{'version': 'v1', 'created': 'Sun, 23 Dec 2012 14:54:10 GMT'}]",2012-12-27,"[['Bassil', 'Youssef', '']]","['Computer Security', 'Information Hiding', 'Image Steganography', 'Brightness Adjustment   1']"
16644,1602.07764,Kamyar Azizzadenesheli Ph.D.,"Kamyar Azizzadenesheli, Alessandro Lazaric, Animashree Anandkumar",Reinforcement Learning of POMDPs using Spectral Methods,,"29th Annual Conference on Learning Theory, PMLR 49:193-256, 2016",,,cs.AI cs.LG cs.NA math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new reinforcement learning algorithm for partially observable
Markov decision processes (POMDP) based on spectral decomposition methods.
While spectral methods have been previously employed for consistent learning of
(passive) latent variable models such as hidden Markov models, POMDPs are more
challenging since the learner interacts with the environment and possibly
changes the future observations in the process. We devise a learning algorithm
running through episodes, in each episode we employ spectral techniques to
learn the POMDP parameters from a trajectory generated by a fixed policy. At
the end of the episode, an optimization oracle returns the optimal memoryless
planning policy which maximizes the expected reward based on the estimated
POMDP model. We prove an order-optimal regret bound with respect to the optimal
memoryless policy and efficient scaling with respect to the dimensionality of
observation and action spaces.
","[{'version': 'v1', 'created': 'Thu, 25 Feb 2016 01:25:36 GMT'}, {'version': 'v2', 'created': 'Sun, 29 May 2016 07:15:21 GMT'}]",2017-06-20,"[['Azizzadenesheli', 'Kamyar', ''], ['Lazaric', 'Alessandro', ''], ['Anandkumar', 'Animashree', '']]","['Spectral Methods', 'Method of Moments', 'Partially Observable Markov Decision Process', 'Latent Variable Model', 'Upper Confidence Reinforcement Learning']"
16645,1603.09158,Guy Even,Guy Even and Matthias Rost and Stefan Schmid,"An Approximation Algorithm for Path Computation and Function Placement
  in SDNs",12 pages,,,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We consider the task of computing (combined) function mapping and routing for
requests in Software-Defined Networks (SDNs). Function mapping refers to the
assignment of nodes in the substrate network to various processing stages that
requests must undergo. Routing refers to the assignment of a path in the
substrate network that begins in a source node of the request, traverses the
nodes that are assigned functions for this request, and ends in a destination
of the request. The algorithm either rejects a request or completely serves a
request, and its goal is to maximize the sum of the benefits of the served
requests. The solution must abide edge and vertex capacities. We follow the
framework suggested by Even for the specification of the processing
requirements and routing of requests via processing-and-routing graphs
(PR-graphs). In this framework, each request has a demand, a benefit, and
PR-graph. Our main result is a randomized approximation algorithm for path
computation and function placement with the following guarantee. Let $m$ denote
the number of links in the substrate network, $\eps$ denote a parameter such
that $0< \eps <1$, and $\opt_f$ denote the maximum benefit that can be attained
by a fractional solution (one in which requests may be partly served and flow
may be split along multiple paths). Let $\cmin$ denote the minimum edge
capacity, and let $\dmax$ denote the maximum demand. Let $\Deltamax$ denote an
upper bound on the number of processing stages a request undergoes. If
$\cmin/(\Deltamax\cdot\dmax)=\Omega((\log m)/\eps^2)$, then with probability at
least $1-\frac{1}{m}-\textit{exp}(-\Omega(\eps^2\cdot \opt_f /(\bmax \cdot
\dmax)))$, the algorithm computes a $(1-\eps)$-approximate solution.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2016 12:39:38 GMT'}]",2016-03-31,"[['Even', 'Guy', ''], ['Rost', 'Matthias', ''], ['Schmid', 'Stefan', '']]","['Approximation algorithms', 'linear programming', 'randomized rounding', 'software defined networks', 'routing', 'throughput maximization']"
16646,1208.0984,Marc Schoenauer,"Riad Akrour (INRIA Saclay - Ile de France, LRI), Marc Schoenauer
  (INRIA Saclay - Ile de France, LRI), Mich\`ele Sebag (LRI)",APRIL: Active Preference-learning based Reinforcement Learning,,ECML PKDD 2012 7524 (2012) 116-131,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper focuses on reinforcement learning (RL) with limited prior
knowledge. In the domain of swarm robotics for instance, the expert can hardly
design a reward function or demonstrate the target behavior, forbidding the use
of both standard RL and inverse reinforcement learning. Although with a limited
expertise, the human expert is still often able to emit preferences and rank
the agent demonstrations. Earlier work has presented an iterative
preference-based RL framework: expert preferences are exploited to learn an
approximate policy return, thus enabling the agent to achieve direct policy
search. Iteratively, the agent selects a new candidate policy and demonstrates
it; the expert ranks the new demonstration comparatively to the previous best
one; the expert's ranking feedback enables the agent to refine the approximate
policy return, and the process is iterated. In this paper, preference-based
reinforcement learning is combined with active ranking in order to decrease the
number of ranking queries to the expert needed to yield a satisfactory policy.
Experiments on the mountain car and the cancer treatment testbeds witness that
a couple of dozen rankings enable to learn a competent policy.
","[{'version': 'v1', 'created': 'Sun, 5 Aug 2012 06:34:44 GMT'}]",2012-08-07,"[['Akrour', 'Riad', '', 'INRIA Saclay - Ile de France, LRI'], ['Schoenauer', 'Marc', '', 'INRIA Saclay - Ile de France, LRI'], ['Sebag', 'Michèle', '', 'LRI']]","['reinforcement learning', 'preference learning', 'interactive optimization', 'robotics']"
16647,1603.04581,Jeremy Frey,"Renaud Gervais (Potioc), Joan Sol Roo (Potioc), J\'er\'emy Frey (UB,
  Potioc), Martin Hachet (Potioc)",Introspectibles: Tangible Interaction to Foster Introspection,"in CHI '16 - SIGCHI Conference on Human Factors in Computing System -
  Computing and Mental Health Workshop, May 2016, San Jose, United States",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Digital devices are now ubiquitous and have the potential to be used to
support positive changes in human lives and promote psychological well-being.
This paper presents three interactive systems that we created focusing on
introspection activities, leveraging tangible interaction and spatial augmented
reality. More specifically, we describe anthropomorphic augmented avatars that
display the users' inner states using physiological sensors. We also present a
first prototype of an augmented sandbox specifically dedicated to promoting
mindfulness activities.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2016 07:36:10 GMT'}]",2016-08-22,"[['Gervais', 'Renaud', '', 'Potioc'], ['Roo', 'Joan Sol', '', 'Potioc'], ['Frey', 'Jérémy', '', 'UB,\n  Potioc'], ['Hachet', 'Martin', '', 'Potioc']]","['H.5.1 Multimedia Information Systems Artificial', 'augmented', 'virtual realities; H.5']"
16648,1602.07038,Barak Sober,"Barak Sober, David Levin",Computer Aided Restoration of Handwritten Character Strokes,"11 pages, 17 figures",,,,cs.GR cs.CV math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work suggests a new variational approach to the task of computer aided
restoration of incomplete characters, residing in a highly noisy document. We
model character strokes as the movement of a pen with a varying radius.
Following this model, a cubic spline representation is being utilized to
perform gradient descent steps, while maintaining interpolation at some initial
(manually sampled) points. The proposed algorithm was utilized in the process
of restoring approximately 1000 ancient Hebrew characters (dating to ca.
8th-7th century BCE), some of which are presented herein and show that the
algorithm yields plausible results when applied on deteriorated documents.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2016 04:47:28 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Jul 2016 23:24:19 GMT'}]",2016-07-08,"[['Sober', 'Barak', ''], ['Levin', 'David', '']]","['Computer Aided Design', 'Hebrew Ostraca', 'First Temple Period', 'Historical Document Analysis']"
16649,1607.00872,Patrick O. Glauner,"Patrick Glauner, Jorge Meira, Lautaro Dolberg, Radu State, Franck
  Bettinger, Yves Rangoni, Diogo Duarte","Neighborhood Features Help Detecting Non-Technical Losses in Big Data
  Sets","Proceedings of the 3rd IEEE/ACM International Conference on Big Data
  Computing Applications and Technologies (BDCAT 2016)",,,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Electricity theft is a major problem around the world in both developed and
developing countries and may range up to 40% of the total electricity
distributed. More generally, electricity theft belongs to non-technical losses
(NTL), which are losses that occur during the distribution of electricity in
power grids. In this paper, we build features from the neighborhood of
customers. We first split the area in which the customers are located into
grids of different sizes. For each grid cell we then compute the proportion of
inspected customers and the proportion of NTL found among the inspected
customers. We then analyze the distributions of features generated and show why
they are useful to predict NTL. In addition, we compute features from the
consumption time series of customers. We also use master data features of
customers, such as their customer class and voltage of their connection. We
compute these features for a Big Data base of 31M meter readings, 700K
customers and 400K inspection results. We then use these features to train four
machine learning algorithms that are particularly suitable for Big Data sets
because of their parallelizable structure: logistic regression, k-nearest
neighbors, linear support vector machine and random forest. Using the
neighborhood features instead of only analyzing the time series has resulted in
appreciable results for Big Data sets for varying NTL proportions of 1%-90%.
This work can therefore be deployed to a wide range of different regions around
the world.
","[{'version': 'v1', 'created': 'Mon, 4 Jul 2016 13:08:19 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Jul 2017 04:41:44 GMT'}]",2017-07-26,"[['Glauner', 'Patrick', ''], ['Meira', 'Jorge', ''], ['Dolberg', 'Lautaro', ''], ['State', 'Radu', ''], ['Bettinger', 'Franck', ''], ['Rangoni', 'Yves', ''], ['Duarte', 'Diogo', '']]","['Data mining', 'electricity theft detection', 'feature engineering', 'feature selection', 'machine learning', 'non-technical losses', 'time series classification']"
16650,1710.06303,Aditya Mogadala,"Aditya Mogadala, Umanga Bista, Lexing Xie and Achim Rettinger","Describing Natural Images Containing Novel Objects with Knowledge Guided
  Assitance","10 pages, 5 figures",,,,cs.CV cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Images in the wild encapsulate rich knowledge about varied abstract concepts
and cannot be sufficiently described with models built only using image-caption
pairs containing selected objects. We propose to handle such a task with the
guidance of a knowledge base that incorporate many abstract concepts. Our
method is a two-step process where we first build a multi-entity-label image
recognition model to predict abstract concepts as image labels and then
leverage them in the second step as an external semantic attention and
constrained inference in the caption generation model for describing images
that depict unseen/novel objects. Evaluations show that our models outperform
most of the prior work for out-of-domain captioning on MSCOCO and are useful
for integration of knowledge and vision in general.
","[{'version': 'v1', 'created': 'Tue, 17 Oct 2017 14:11:37 GMT'}]",2017-10-18,"[['Mogadala', 'Aditya', ''], ['Bista', 'Umanga', ''], ['Xie', 'Lexing', ''], ['Rettinger', 'Achim', '']]","['Knowlede Base Semantic Attention', 'Image Caption Generation', 'Deep Neural Networks', 'Images with Novel Objects']"
16651,1304.3762,Mark Burgin,Mark Burgin and Eugene Eberbach,Evolutionary Turing in the Context of Evolutionary Machines,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the roots of evolutionary computation was the idea of Turing about
unorganized machines. The goal of this work is the development of foundations
for evolutionary computations, connecting Turing's ideas and the contemporary
state of art in evolutionary computations. To achieve this goal, we develop a
general approach to evolutionary processes in the computational context,
building mathematical models of computational systems, functioning of which is
based on evolutionary processes, and studying properties of such systems.
Operations with evolutionary machines are described and it is explored when
definite classes of evolutionary machines are closed with respect to basic
operations with these machines. We also study such properties as linguistic and
functional equivalence of evolutionary machines and their classes, as well as
computational power of evolutionary machines and their classes, comparing of
evolutionary machines to conventional automata, such as finite automata or
Turing machines.
","[{'version': 'v1', 'created': 'Sat, 13 Apr 2013 02:16:46 GMT'}]",2013-04-16,"[['Burgin', 'Mark', ''], ['Eberbach', 'Eugene', '']]","['evolutionary computation', 'complexity theory', 'computer science', 'global optimization', 'search theory', 'cost benefit analysis']"
16652,1306.4245,Omar S. G\'omez,"Omar S. G\'omez, Jos\'e L. Bat\'un and Ra\'ul A. Aguilar","Pair versus Solo Programming -- An Experience Report from a Course on
  Design of Experiments in Software Engineering","9 pages; International Journal of Computer Science Issues, 2013",,,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper presents an experience report about an experiment that evaluates
duration and effort of pair and solo programming. The experiment was performed
as part of a course on Design of Experiments (DOE) in Software Engineering (SE)
at Autonomous University of Yucatan (UADY). A total of 21 junior student
subjects enrolled in the bachelor's degree program in SE participated in the
experiment. During the experiment, subjects (7 pairs and 7 solos) wrote two
small programs in two sessions. Results show a significant difference (at
alpha=0.1) in favor of pair programming regarding duration (28% decrease), and
a significant difference (at alpha=0.1) in favor of solo programming with
respect to effort (30% decrease). With only a difference of 1%, our results
regarding duration and effort are practically the same as those reported by
Nosek in 1998.
","[{'version': 'v1', 'created': 'Tue, 18 Jun 2013 15:35:09 GMT'}]",2013-06-19,"[['Gómez', 'Omar S.', ''], ['Batún', 'José L.', ''], ['Aguilar', 'Raúl A.', '']]","['Software Engineering', 'Pair Programming', 'Design of Experiments', 'Latin Square Design', 'Experimentation', 'Experience Report']"
16653,0906.5007,Ali Parandehgheibi,"Daron Acemoglu, Asuman Ozdaglar, Ali ParandehGheibi",Spread of Misinformation in Social Networks,Submitted to Games and Economic Behavior,,,LIDS report 2812,cs.IT cs.DC math.IT math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide a model to investigate the tension between information aggregation
and spread of misinformation in large societies (conceptualized as networks of
agents communicating with each other). Each individual holds a belief
represented by a scalar. Individuals meet pairwise and exchange information,
which is modeled as both individuals adopting the average of their pre-meeting
beliefs. When all individuals engage in this type of information exchange, the
society will be able to effectively aggregate the initial information held by
all individuals. There is also the possibility of misinformation, however,
because some of the individuals are ""forceful,"" meaning that they influence the
beliefs of (some) of the other individuals they meet, but do not change their
own opinion. The paper characterizes how the presence of forceful agents
interferes with information aggregation. Under the assumption that even
forceful agents obtain some information (however infrequent) from some others
(and additional weak regularity conditions), we first show that beliefs in this
class of societies converge to a consensus among all individuals. This
consensus value is a random variable, however, and we characterize its
behavior. Our main results quantify the extent of misinformation in the society
by either providing bounds or exact results (in some special cases) on how far
the consensus value can be from the benchmark without forceful agents (where
there is efficient information aggregation). The worst outcomes obtain when
there are several forceful agents and forceful agents themselves update their
beliefs only on the basis of information they obtain from individuals most
likely to have received their own information previously.
","[{'version': 'v1', 'created': 'Fri, 26 Jun 2009 20:57:55 GMT'}]",2009-06-30,"[['Acemoglu', 'Daron', ''], ['Ozdaglar', 'Asuman', ''], ['ParandehGheibi', 'Ali', '']]","['information aggregation', 'learning', 'misinformation', 'social networks']"
16654,1504.05770,Takahiro Wada,"Ryota Nishimura, Takahiro Wada, Seiji Sugiyama","Haptic Shared Control in Steering Operation Based on Cooperative Status
  Between a Driver and a Driver Assistance System",Accepted for International Journal of Human Robot Interaction,,,,cs.RO,http://creativecommons.org/licenses/by/3.0/,"  Haptic shared control is expected to achieve a smooth collaboration between
humans and automated systems, because haptics facilitate mutual communication.
A methodology for sharing a given task is important to achieve effective shared
control. Therefore, the appropriate cooperative relationship between a human
operator and automated system should be considered. This paper proposes a
methodology to evaluate the cooperative status between the operator and the
automated system in the haptic shared control of a steering operation using a
pseudo-power pair of torque from each agent and the vehicle lateral velocity as
each agent's contribution to vehicle motion. This method allows us to estimate
cooperative status based on two axes: the initiative holder and the intent
consistency between the two agents. A control method for a lane-keeping assist
system (LKAS) that enables drivers to change lanes smoothly is proposed based
on the estimated cooperative status. A gain-tuning control method based on the
estimated cooperative status is proposed to decrease the assistance system's
pseudo-power when intent inconsistency occurs. A method for switching the
followed lane to match the driver's and assistance system's intentions is also
proposed. A user study using a driving simulator is conducted to demonstrate
the effectiveness of the proposed methods. The results demonstrate that the
proposed methods facilitate smooth driver-initiated lane changes without
significantly affecting the driver's torque or steering wheel angle while
significantly improve lane-keeping performance.
","[{'version': 'v1', 'created': 'Wed, 22 Apr 2015 12:56:25 GMT'}]",2015-04-23,"[['Nishimura', 'Ryota', ''], ['Wada', 'Takahiro', ''], ['Sugiyama', 'Seiji', '']]","['Haptic shared control', 'haptic guidance control', 'cooperative states', 'steering', 'lane keeping assist system', 'lane changing', 'driver assistance system']"
16655,1712.04596,Son-Il Kwak,"Son-Il Kwak, Oh-Chol Gwon, Chung-Jin Kwak","Consideration on Example 2 of ""An Algorithm of General Fuzzy
  InferenceWith The Reductive Property""","6 pages, 0 figures",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we will show that (1) the results about the fuzzy reasoning
algoritm obtained in the paper ""Computer Sciences Vol. 34, No.4, pp.145-148,
2007"" according to the paper ""IEEE Transactions On systems, Man and
cybernetics, 18, pp.1049-1056, 1988"" are correct; (2) example 2 in the paper
""An Algorithm of General Fuzzy Inference With The Reductive Property"" presented
by He Ying-Si, Quan Hai-Jin and Deng Hui-Wen according to the paper ""An
approximate analogical reasoning approach based on similarity measures""
presented by Tursken I.B. and Zhong zhao is incorrect; (3) the mistakes in
their paper are modified and then a calculation example of FMT is supplemented.
","[{'version': 'v1', 'created': 'Wed, 13 Dec 2017 03:13:25 GMT'}]",2017-12-14,"[['Kwak', 'Son-Il', ''], ['Gwon', 'Oh-Chol', ''], ['Kwak', 'Chung-Jin', '']]","['; Fuzzy reasoning', 'CRI principle', 'Triple I method', 'Similarity fuzzy inference method', 'Reductive property']"
16656,1701.07500,Paras Jain,"Paras Jain, Chirag Tailor, Sam Ford, Liexiao Ding, Michael Phillips,
  Fang Liu, Nagi Gebraeel, Duen Horng Chau","Scalable Architecture for Anomaly Detection and Visualization in Power
  Generating Assets",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Power-generating assets (e.g., jet engines, gas turbines) are often
instrumented with tens to hundreds of sensors for monitoring physical and
performance degradation. Anomaly detection algorithms highlight deviations from
predetermined benchmarks with the goal of detecting incipient faults. We are
developing an integrated system to address three key challenges within
analyzing sensor data from power-generating assets: (1) difficulty in ingesting
and analyzing data from large numbers of machines; (2) prevalence of false
alarms generated by anomaly detection algorithms resulting in unnecessary
downtime and maintenance; and (3) lack of an integrated visualization that
helps users understand and explore the flagged anomalies and relevant sensor
context in the energy domain. We present preliminary results and our key
findings in addressing these challenges. Our system's scalable event ingestion
framework, based on OpenTSDB, ingests nearly 400,000 sensor data samples per
seconds using a 30 machine cluster. To reduce false alarm rates, we leverage
the False Discovery Rate (FDR) algorithm which significantly reduces the number
of false alarms. Our visualization tool presents the anomalies and associated
content flagged by the FDR algorithm to inform users and practitioners in their
decision making process. We believe our integrated platform will help reduce
maintenance costs significantly while increasing asset lifespan. We are working
to extend our system on multiple fronts, such as scaling to more data and more
compute nodes (70 in total).
","[{'version': 'v1', 'created': 'Wed, 25 Jan 2017 21:51:28 GMT'}]",2017-01-27,"[['Jain', 'Paras', ''], ['Tailor', 'Chirag', ''], ['Ford', 'Sam', ''], ['Ding', 'Liexiao', ''], ['Phillips', 'Michael', ''], ['Liu', 'Fang', ''], ['Gebraeel', 'Nagi', ''], ['Chau', 'Duen Horng', '']]","['False discovery rate', 'visualization', 'OpenTSDB', 'power asset', 'energy sensor']"
16657,1205.3125,Md Nazmul Islam Khan Mr.,"Md Nazmul Islam Khan, Rashed Ahmed, Md. Tariq Aziz","A Survey of TCP Reno, New Reno and Sack Over Mobile Ad-Hoc Network","8 Figures, MANET","International Journal of Distributed and Parallel Systems (IJDPS),
  Volume 3(1) ISSN : 0976 - 9757 (2012) [Online]",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transmission Control Protocol (TCP) is often preferred to be implemented at
the transport layer of a Mobile Ad-hoc Network (MANET) because of its wide
range of applications, which enjoys the advantage of reliable data transmission
in the Internet. However, because of some unique characteristics of MANET, TCP
cannot offer reliable services while using e-mail, internet search and file
transmission in such a network. The research investigates how well the
different versions of TCP respond to various performance differentials when
subjected to different network stresses and topology changes, aside from
identifying the most efficient and robust TCP version(s) for different MANET
scenarios. Among several TCP variants, three types are considered important for
the analysis, namely TCP Reno, TCP New Reno and TCP Selective Acknowledgment
(SACK). In most cases, the TCP performance is found in our study to decrease
when the node size and mobility rate is increased in the network. There is,
however, exception to this. As our simulation results demonstrate, the
increases in the node velocity sometimes help the TCP to attain a better
performance. The study also reveals that out of the three variants, TCP SACK
can adapt relatively well to the changing network sizes while TCP Reno performs
most robustly in the presence of different mobility rates within MANET.
","[{'version': 'v1', 'created': 'Thu, 9 Feb 2012 20:37:27 GMT'}]",2012-05-15,"[['Khan', 'Md Nazmul Islam', ''], ['Ahmed', 'Rashed', ''], ['Aziz', 'Md. Tariq', '']]","['MANET', 'Reno', 'New Reno', 'SACK']"
16658,1109.1134,Anis Ismail,"Anis Ismail, Aziz Barbar and Ziad Ismail",P2P Simulator for Queries Routing using Data Mining,"14 pages, 10 figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data mining is used to extract hidden information from large databases. In
Peer-to-Peer context, a challenging problem is how to find the appropriate Peer
to deal with a given query without overly consuming bandwidth. Different
methods proposed routing strategies of queries taking into account the P2P
network at hand. An unstructured P2P system based on an organization of Peers
around Super-Peers that are connected to Super-Super-Peer according to their
semantic domains is considered. This paper integrates Decision Trees in P2P
architectures for predicting Query-Suitable Super-Peers representing a
community of Peers, where one among them is able to answer the given query. In
fact, by analyzing the queries' log file, a predictive model that avoids
flooding queries in the P2P networks constructed by predicting the appropriate
Super-Peer, and hence the Peer to answer the query. The proposed architecture
is based on a Decision Tree (Base-Knowledge - BK). The efficiency of these
architectures is discussed considering architecture without knowledge
(Baseline) using only the flooding queries method to answer queries. The
advantage of this knowledge based model is the robustness in Queries routing
mechanism and scalability in P2P Network.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2011 10:25:17 GMT'}]",2011-09-07,"[['Ismail', 'Anis', ''], ['Barbar', 'Aziz', ''], ['Ismail', 'Ziad', '']]","['Data mining', 'Decision Trees', 'P2P Answering Queries', 'Queries routing', 'WEKA']"
16659,1401.3928,Han Mao Kiah,"Yeow Meng Chee, Zouha Cherif, Jean-Luc Danger, Sylvain Guilley, Han
  Mao Kiah, Jon-Lark Kim, Patrick Sol\'e, Xiande Zhang","Multiply Constant-Weight Codes and the Reliability of Loop Physically
  Unclonable Functions",,,,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the class of multiply constant-weight codes to improve the
reliability of certain physically unclonable function (PUF) response. We extend
classical coding methods to construct multiply constant-weight codes from known
$q$-ary and constant-weight codes. Analogues of Johnson bounds are derived and
are shown to be asymptotically tight to a constant factor under certain
conditions. We also examine the rates of the multiply constant-weight codes and
interestingly, demonstrate that these rates are the same as those of
constant-weight codes of suitable parameters. Asymptotic analysis of our code
constructions is provided.
","[{'version': 'v1', 'created': 'Thu, 16 Jan 2014 08:28:28 GMT'}]",2014-01-17,"[['Chee', 'Yeow Meng', ''], ['Cherif', 'Zouha', ''], ['Danger', 'Jean-Luc', ''], ['Guilley', 'Sylvain', ''], ['Kiah', 'Han Mao', ''], ['Kim', 'Jon-Lark', ''], ['Solé', 'Patrick', ''], ['Zhang', 'Xiande', '']]","['constant-weight codes', 'doubly constant-weight codes', 'multiply constant-weight codes', 'physically unclonable functions']"
16660,1511.06575,Wolfgang Fuhl,"Wolfgang Fuhl, Thiago C. Santini, Thomas Kuebler, Enkelejda Kasneci","ElSe: Ellipse Selection for Robust Pupil Detection in Real-World
  Environments",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fast and robust pupil detection is an essential prerequisite for video-based
eye-tracking in real-world settings. Several algorithms for image-based pupil
detection have been proposed, their applicability is mostly limited to
laboratory conditions. In realworld scenarios, automated pupil detection has to
face various challenges, such as illumination changes, reflections (on
glasses), make-up, non-centered eye recording, and physiological eye
characteristics. We propose ElSe, a novel algorithm based on ellipse evaluation
of a filtered edge image. We aim at a robust, resource-saving approach that can
be integrated in embedded architectures e.g. driving. The proposed algorithm
was evaluated against four state-of-the-art methods on over 93,000 hand-labeled
images from which 55,000 are new images contributed by this work. On average,
the proposed method achieved a 14.53% improvement on the detection rate
relative to the best state-of-the-art performer.
download:ftp://emmapupildata@messor.informatik.unituebingen. de
(password:eyedata).
","[{'version': 'v1', 'created': 'Fri, 20 Nov 2015 12:49:20 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Nov 2015 06:56:10 GMT'}]",2015-11-24,"[['Fuhl', 'Wolfgang', ''], ['Santini', 'Thiago C.', ''], ['Kuebler', 'Thomas', ''], ['Kasneci', 'Enkelejda', '']]","['Pupil detection', 'Eye tracking', 'Pupil data set']"
16661,1011.2719,Pierre Fraigniaud,Pierre Fraigniaud and Andrzej Pelc,Decidability Classes for Mobile Agents Computing,,,,,cs.DC cs.CC cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We establish a classification of decision problems that are to be solved by
mobile agents operating in unlabeled graphs, using a deterministic protocol.
The classification is with respect to the ability of a team of agents to solve
the problem, possibly with the aid of additional information. In particular,
our focus is on studying differences between the decidability of a decision
problem by agents and its verifiability when a certificate for a positive
answer is provided to the agents. We show that the class MAV of mobile agents
verifiable problems is much wider than the class MAD of mobile agents decidable
problems. Our main result shows that there exist natural MAV-complete problems:
the most difficult problems in this class, to which all problems in MAV are
reducible. Our construction of a MAV-complete problem involves two main
ingredients in mobile agents computability: the topology of the quotient graph
and the number of operating agents. Beyond the class MAV we show that, for a
single agent, three natural oracles yield a strictly increasing chain of
relative decidability classes.
","[{'version': 'v1', 'created': 'Thu, 11 Nov 2010 17:46:08 GMT'}]",2010-11-12,"[['Fraigniaud', 'Pierre', ''], ['Pelc', 'Andrzej', '']]","['decision problem', 'mobile agent', 'graph', 'rendezvous']"
16662,1111.6401,Hajar Elmaghraoui,"Hajar Elmaghraoui, Imane Zaoui, Dalila Chiadmi, Laila Benhlima",Graph based E-Government web service composition,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, e-government has emerged as a government policy to improve the
quality and efficiency of public administrations. By exploiting the potential
of new information and communication technologies, government agencies are
providing a wide spectrum of online services. These services are composed of
several web services that comply with well defined processes. One of the big
challenges is the need to optimize the composition of the elementary web
services. In this paper, we present a solution for optimizing the computation
effort in web service composition. Our method is based on Graph Theory. We
model the semantic relationship between the involved web services through a
directed graph. Then, we compute all shortest paths using for the first time,
an extended version of the Floyd-Warshall algorithm.
","[{'version': 'v1', 'created': 'Mon, 28 Nov 2011 10:52:28 GMT'}]",2011-11-29,"[['Elmaghraoui', 'Hajar', ''], ['Zaoui', 'Imane', ''], ['Chiadmi', 'Dalila', ''], ['Benhlima', 'Laila', '']]","['Web services composition', 'optimization', 'graph theory; Floyd-Warshall', 'e-government']"
16663,1212.6183,Xiaojie Deng,"Xiaojie Deng, Yu Zhang, Yuxin Deng, and Farong Zhong",The Buffered \pi-Calculus: A Model for Concurrent Languages,,,,,cs.LO cs.FL,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Message-passing based concurrent languages are widely used in developing
large distributed and coordination systems. This paper presents the buffered
$\pi$-calculus --- a variant of the $\pi$-calculus where channel names are
classified into buffered and unbuffered: communication along buffered channels
is asynchronous, and remains synchronous along unbuffered channels. We show
that the buffered $\pi$-calculus can be fully simulated in the polyadic
$\pi$-calculus with respect to strong bisimulation. In contrast to the
$\pi$-calculus which is hard to use in practice, the new language enables easy
and clear modeling of practical concurrent languages. We encode two real-world
concurrent languages in the buffered $\pi$-calculus: the (core) Go language and
the (Core) Erlang. Both encodings are fully abstract with respect to weak
bisimulations.
","[{'version': 'v1', 'created': 'Wed, 26 Dec 2012 14:12:03 GMT'}]",2012-12-27,"[['Deng', 'Xiaojie', ''], ['Zhang', 'Yu', ''], ['Deng', 'Yuxin', ''], ['Zhong', 'Farong', '']]","['process calculus', 'formal model', 'full abstraction']"
16664,1304.7204,Filip Mazowiecki sheriff,"Witold Charatonik, Emanuel Kiero\'nski, Filip Mazowiecki","Satisfiability of the Two-Variable Fragment of First-Order Logic over
  Trees",,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the satisfiability problem for the two-variable fragment of
first-order logic over finite unranked trees. We work with signatures
consisting of some unary predicates and the binary navigational predicates
child, right sibling, and their respective transitive closures. We prove that
the satisfiability problem for the logic containing all these predicates is
EXPSPACE-complete. Further, we consider the restriction of the class of
structures to singular trees, i.e., we assume that at every node precisely one
unary predicate holds. We observe that the full logic and even for unordered
trees remain EXPSPACE-complete over finite singular trees, but the complexity
decreases for some weaker logics. Namely, the logic with one binary predicate,
descendant is NEXPTIME-complete, and its guarded version is PSPACE-complete
over finite singular trees, even though both these logics are EXPSPACE-complete
over arbitrary finite trees.
","[{'version': 'v1', 'created': 'Fri, 26 Apr 2013 15:35:41 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Oct 2014 14:53:00 GMT'}]",2014-10-22,"[['Charatonik', 'Witold', ''], ['Kieroński', 'Emanuel', ''], ['Mazowiecki', 'Filip', '']]","['two-variable logic', 'finite trees', 'satisfiability', 'XML']"
16665,1708.01927,Muaz Niazi,"Faisal Riaz, Muaz A. Niazi","Emotion Controlled Spectrum Mobility Scheme for Efficient Syntactic
  Interoperability In Cognitive Radio Based Internet of Vehicles","33 pages, 16 figures",,,,cs.NI cs.AI cs.GT cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Blind spots are one of the causes of road accidents in the hilly and flat
areas. These blind spot accidents can be decreased by establishing an Internet
of Vehicles (IoV) using Vehicle-2-Vehicle (V2V) and Vehicle-2-Infrastrtructure
(V2I) communication systems. But the problem with these IoV is that most of
them are using DSRC or single Radio Access Technology (RAT) as a wireless
technology, which has been proven to be failed for efficient communication
between vehicles. Recently, Cognitive Radio (CR) based IoV have to be proven
best wireless communication systems for vehicular networks. However, the
spectrum mobility is a challenging task to keep CR based vehicular networks
interoperable and has not been addressed sufficiently in existing research. In
our previous research work, the Cognitive Radio Site (CR-Site) has been
proposed as in-vehicle CR-device, which can be utilized to establish efficient
IoV systems. H In this paper, we have introduced the Emotions Inspired
Cognitive Agent (EIC_Agent) based spectrum mobility mechanism in CR-Site and
proposed a novel emotions controlled spectrum mobility scheme for efficient
syntactic interoperability between vehicles. For this purpose, a probabilistic
deterministic finite automaton using fear factor is proposed to perform
efficient spectrum mobility using fuzzy logic. In addition, the quantitative
computation of different fear intensity levels has been performed with the help
of fuzzy logic. The system has been tested using active data from different GSM
service providers on Mangla-Mirpur road. This is supplemented by extensive
simulation experiments which validate the proposed scheme for CR based
high-speed vehicular networks. The qualitative comparison with the
existing-state-of the-art has proven the superiority of the proposed emotions
controlled syntactic interoperable spectrum mobility scheme within cognitive
radio based IoV systems.
","[{'version': 'v1', 'created': 'Sun, 6 Aug 2017 19:40:50 GMT'}]",2017-08-08,"[['Riaz', 'Faisal', ''], ['Niazi', 'Muaz A.', '']]","['Affective Computing', 'Cognitive Radio', 'Fear', 'Fuzzy Logic', 'Syntactic Interoperability', 'Vehicular Networks']"
16666,1610.09190,Lican Huang,Lican Huang,Domain Specific Distributed Search Engine Based on Semantic P2P Networks,"10 pages, 7 figures , ICNDC2016 conference",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a distributed search engine based on semantic P2P
Networks. The user's computers join the domains in which user wants to share
information in semantic P2P networks which is domain specific virtual tree
(VIRGO ). Each user computer contains search engine which indexes the domain
specific information on local computer or Internet. We can get all search
information through P2P message provided by all joined computers. By companies'
effort, we have implemented a prototype of distributed search engine, which
demonstrates easily retrieving domain-related information provided by joined
computers .
","[{'version': 'v1', 'created': 'Fri, 28 Oct 2016 12:53:02 GMT'}]",2016-10-31,"[['Huang', 'Lican', '']]","['Search Engines', 'Distributed Search Engine', 'Semantic P2PNetworks', 'Information Retrieve', 'Local Information Retrieve']"
16667,1110.1263,Giovanni Pighizzini,"Viliam Geffert, Bruno Guillon, Giovanni Pighizzini",Two-Way Automata Making Choices Only at the Endmarkers,23 pages,,,,cs.FL cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The question of the state-size cost for simulation of two-way
nondeterministic automata (2NFAs) by two-way deterministic automata (2DFAs) was
raised in 1978 and, despite many attempts, it is still open. Subsequently, the
problem was attacked by restricting the power of 2DFAs (e.g., using a
restricted input head movement) to the degree for which it was already possible
to derive some exponential gaps between the weaker model and the standard
2NFAs. Here we use an opposite approach, increasing the power of 2DFAs to the
degree for which it is still possible to obtain a subexponential conversion
from the stronger model to the standard 2DFAs. In particular, it turns out that
subexponential conversion is possible for two-way automata that make
nondeterministic choices only when the input head scans one of the input tape
endmarkers. However, there is no restriction on the input head movement. This
implies that an exponential gap between 2NFAs and 2DFAs can be obtained only
for unrestricted 2NFAs using capabilities beyond the proposed new model. As an
additional bonus, conversion into a machine for the complement of the original
language is polynomial in this model. The same holds for making such machines
self-verifying, halting, or unambiguous. Finally, any superpolynomial lower
bound for the simulation of such machines by standard 2DFAs would imply L<>NL.
In the same way, the alternating version of these machines is related to L =?
NL =? P, the classical computational complexity problems.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2011 13:52:34 GMT'}]",2011-10-07,"[['Geffert', 'Viliam', ''], ['Guillon', 'Bruno', ''], ['Pighizzini', 'Giovanni', '']]","['two-way automata', 'descriptional complexity', 'regular languages']"
16668,0803.1521,Wenbing Zhao,Wenbing Zhao,"Proactive Service Migration for Long-Running Byzantine Fault Tolerant
  Systems",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we describe a novel proactive recovery scheme based on service
migration for long-running Byzantine fault tolerant systems. Proactive recovery
is an essential method for ensuring long term reliability of fault tolerant
systems that are under continuous threats from malicious adversaries. The
primary benefit of our proactive recovery scheme is a reduced vulnerability
window. This is achieved by removing the time-consuming reboot step from the
critical path of proactive recovery. Our migration-based proactive recovery is
coordinated among the replicas, therefore, it can automatically adjust to
different system loads and avoid the problem of excessive concurrent proactive
recoveries that may occur in previous work with fixed watchdog timeouts.
Moreover, the fast proactive recovery also significantly improves the system
availability in the presence of faults.
","[{'version': 'v1', 'created': 'Tue, 11 Mar 2008 04:34:04 GMT'}]",2008-03-12,"[['Zhao', 'Wenbing', '']]","['Proactive Recovery', 'Byzantine Fault Tolerance', 'Service Migration', 'Replication', 'Byzantine Agreement']"
16669,0802.1362,Lance Fortnow,"Yiling Chen, Lance Fortnow, Nicolas Lambert, David M. Pennock,
  Jennifer Wortman",Complexity of Combinatorial Market Makers,,,,,cs.GT,,"  We analyze the computational complexity of market maker pricing algorithms
for combinatorial prediction markets. We focus on Hanson's popular logarithmic
market scoring rule market maker (LMSR). Our goal is to implicitly maintain
correct LMSR prices across an exponentially large outcome space. We examine
both permutation combinatorics, where outcomes are permutations of objects, and
Boolean combinatorics, where outcomes are combinations of binary events. We
look at three restrictive languages that limit what traders can bet on. Even
with severely limited languages, we find that LMSR pricing is $\SP$-hard, even
when the same language admits polynomial-time matching without the market
maker. We then propose an approximation technique for pricing permutation
markets based on a recent algorithm for online permutation learning. The
connections we draw between LMSR pricing and the vast literature on online
learning with expert advice may be of independent interest.
","[{'version': 'v1', 'created': 'Mon, 11 Feb 2008 00:23:17 GMT'}]",2008-02-12,"[['Chen', 'Yiling', ''], ['Fortnow', 'Lance', ''], ['Lambert', 'Nicolas', ''], ['Pennock', 'David M.', ''], ['Wortman', 'Jennifer', '']]","['Prediction market', 'market maker', 'logarithmic market scoring rule', 'computational complexity']"
16670,0906.4663,R Doomun,"Hafeez Ullah Amin, Abdur Rashid Khan","Acquiring Knowledge for Evaluation of Teachers Performance in Higher
  Education using a Questionnaire","7 pages, International Journal of Computer Science and Information
  Security (IJCSIS)","IJCSIS, June 2009 Issue, Vol. 2, No.1",,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present the step by step knowledge acquisition process by
choosing a structured method through using a questionnaire as a knowledge
acquisition tool. Here we want to depict the problem domain as, how to evaluate
teachers performance in higher education through the use of expert system
technology. The problem is how to acquire the specific knowledge for a selected
problem efficiently and effectively from human experts and encode it in the
suitable computer format. Acquiring knowledge from human experts in the process
of expert systems development is one of the most common problems cited till
yet. This questionnaire was sent to 87 domain experts within all public and
private universities in Pakistani. Among them 25 domain experts sent their
valuable opinions. Most of the domain experts were highly qualified, well
experienced and highly responsible persons. The whole questionnaire was divided
into 15 main groups of factors, which were further divided into 99 individual
questions. These facts were analyzed further to give a final shape to the
questionnaire. This knowledge acquisition technique may be used as a learning
tool for further research work.
","[{'version': 'v1', 'created': 'Thu, 25 Jun 2009 11:09:39 GMT'}]",2009-06-26,"[['Amin', 'Hafeez Ullah', ''], ['Khan', 'Abdur Rashid', '']]","['Expert system', 'knowledge acquisition', 'decision making', 'human resource management', 'questionnaire', 'domain experts']"
16671,1107.5607,Ian Petersen,Ian R. Petersen,"Low Frequency Approximation for a class of Linear Quantum Systems using
  Cascade Cavity Realization",,,,,cs.SY math.OC quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a method for approximating a class of complex transfer
function matrices corresponding to physically realizable complex linear quantum
systems. The class of linear quantum systems under consideration includes
interconnections of passive optical components such as cavities,
beam-splitters, phase-shifters and interferometers. This approximation method
builds on a previous result for cascade realization and gives good
approximations at low frequencies.
","[{'version': 'v1', 'created': 'Thu, 28 Jul 2011 00:04:05 GMT'}]",2011-07-29,"[['Petersen', 'Ian R.', '']]","['Quantum Linear Systems', 'Model Reduction', 'Cascade Realization']"
16672,1702.05197,Abhishek  Sinha,"Abhishek Sinha, Eytan Modiano","Throughput-Optimal Broadcast in Wireless Networks with
  Point-to-Multipoint Transmissions","Submitted to the proceedings of ACM MobiHoc, 2017",,,,cs.NI cs.IT math.IT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of efficient packet dissemination in wireless
networks with point-to-multi-point wireless broadcast channels. We propose a
dynamic policy, which achieves the broadcast capacity of the network. This
policy is obtained by first transforming the original multi-hop network into a
precedence-relaxed virtual single-hop network and then finding an optimal
broadcast policy for the relaxed network. The resulting policy is shown to be
throughput-optimal for the original wireless network using a sample-path
argument. We also prove the NP-completeness of the finite-horizon broadcast
problem, which is in contrast with the polynomial time solvability of the
problem with point-to-point channels. Illustrative simulation results
demonstrate the efficacy of the proposed broadcast policy in achieving the full
broadcast capacity with low delay.
","[{'version': 'v1', 'created': 'Fri, 17 Feb 2017 00:50:45 GMT'}]",2017-02-20,"[['Sinha', 'Abhishek', ''], ['Modiano', 'Eytan', '']]","['Broadcasting', 'Scheduling', 'Qeueing Teory', 'Troughput Optimality']"
16673,0704.2841,Lun Dong,"Athina P. Petropulu, Lun Dong, H. Vincent Poor","A High-Throughput Cross-Layer Scheme for Distributed Wireless Ad Hoc
  Networks","6 pages, Appeared in the Proceedings of the 41st Annual Conference on
  Information Sciences and Systems, John Hopkins University, March 2007",,,,cs.IT math.IT,,"  In wireless ad hoc networks, distributed nodes can collaboratively form an
antenna array for long-distance communications to achieve high energy
efficiency. In recent work, Ochiai, et al., have shown that such collaborative
beamforming can achieve a statistically nice beampattern with a narrow main
lobe and low sidelobes. However, the process of collaboration introduces
significant delay, since all collaborating nodes need access to the same
information. In this paper, a technique that significantly reduces the
collaboration overhead is proposed. It consists of two phases. In the first
phase, nodes transmit locally in a random access fashion. Collisions, when they
occur, are viewed as linear mixtures of the collided packets. In the second
phase, a set of cooperating nodes acts as a distributed antenna system and
beamform the received analog waveform to one or more faraway destinations. This
step requires multiplication of the received analog waveform by a complex
number, which is independently computed by each cooperating node, and which
enables separation of the collided packets based on their final destination.
The scheme requires that each node has global knowledge of the network
coordinates. The proposed scheme can achieve high throughput, which in certain
cases exceeds one.
","[{'version': 'v1', 'created': 'Sat, 21 Apr 2007 17:44:24 GMT'}]",2007-07-13,"[['Petropulu', 'Athina P.', ''], ['Dong', 'Lun', ''], ['Poor', 'H. Vincent', '']]","['distributedwirelesssystems', 'cooperation', 'beamforming']"
16674,0804.0352,"\^Hamed  \""Owladeghaffari","M.Sharifzadeh, H.Owladeghaffari, K.Shahriar, E.Bakhtavar",Permeability Analysis based on information granulation theory,"8 pages,7 figures",,,,cs.NE cs.AI,http://creativecommons.org/licenses/by/3.0/,"  This paper describes application of information granulation theory, on the
analysis of ""lugeon data"". In this manner, using a combining of Self Organizing
Map (SOM) and Neuro-Fuzzy Inference System (NFIS), crisp and fuzzy granules are
obtained. Balancing of crisp granules and sub- fuzzy granules, within non fuzzy
information (initial granulation), is rendered in open-close iteration. Using
two criteria, ""simplicity of rules ""and ""suitable adaptive threshold error
level"", stability of algorithm is guaranteed. In other part of paper, rough set
theory (RST), to approximate analysis, has been employed >.Validation of the
proposed methods, on the large data set of in-situ permeability in rock masses,
in the Shivashan dam, Iran, has been highlighted. By the implementation of the
proposed algorithm on the lugeon data set, was proved the suggested method,
relating the approximate analysis on the permeability, could be applied.
","[{'version': 'v1', 'created': 'Wed, 2 Apr 2008 13:45:51 GMT'}]",2008-04-03,"[['Sharifzadeh', 'M.', ''], ['Owladeghaffari', 'H.', ''], ['Shahriar', 'K.', ''], ['Bakhtavar', 'E.', '']]","['Information granulation theory', 'SOM', 'NFIS', 'RST', 'permeability']"
16675,1208.3313,Tomasz Kociumaka,"Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka, Marcin Kubica,
  Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczy\'nski,
  Tomasz Wale\'n",A Note on Efficient Computation of All Abelian Periods in a String,,,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We derive a simple efficient algorithm for Abelian periods knowing all
Abelian squares in a string. An efficient algorithm for the latter problem was
given by Cummings and Smyth in 1997. By the way we show an alternative
algorithm for Abelian squares. We also obtain a linear time algorithm finding
all `long' Abelian periods. The aim of the paper is a (new) reduction of the
problem of all Abelian periods to that of (already solved) all Abelian squares
which provides new insight into both connected problems.
","[{'version': 'v1', 'created': 'Thu, 16 Aug 2012 08:33:36 GMT'}]",2015-03-20,"[['Crochemore', 'Maxime', ''], ['Iliopoulos', 'Costas', ''], ['Kociumaka', 'Tomasz', ''], ['Kubica', 'Marcin', ''], ['Pachocki', 'Jakub', ''], ['Radoszewski', 'Jakub', ''], ['Rytter', 'Wojciech', ''], ['Tyczyński', 'Wojciech', ''], ['Waleń', 'Tomasz', '']]","['algorithms', 'Abelian period', 'Abelian square']"
16676,1002.2184,Rdv Ijcsis,"V. Ashok, T. Balakumaran, C. Gowrishankar, I.L.A. Vennila, A. Nirmal
  kumar",The Fast Haar Wavelet Transform for Signal & Image Processing,"IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS January 2010, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 7, No. 1, pp. 126-130, January 2010, USA",,"Journal of Computer Science, ISSN 19475500",cs.MM cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A method for the design of Fast Haar wavelet for signal processing and image
processing has been proposed. In the proposed work, the analysis bank and
synthesis bank of Haar wavelet is modified by using polyphase structure.
Finally, the Fast Haar wavelet was designed and it satisfies alias free and
perfect reconstruction condition. Computational time and computational
complexity is reduced in Fast Haar wavelet transform.
","[{'version': 'v1', 'created': 'Wed, 10 Feb 2010 19:27:25 GMT'}]",2010-02-11,"[['Ashok', 'V.', ''], ['Balakumaran', 'T.', ''], ['Gowrishankar', 'C.', ''], ['Vennila', 'I. L. A.', ''], ['kumar', 'A. Nirmal', '']]","['computational complexity', 'Haar wavelet', 'perfect reconstruction', 'polyphase components', 'Quardrature mirror filter']"
16677,1212.5101,Tamal Ghosh Tamal Ghosh,"Sourav Sengupta, Tamal Ghosh, Pranab K Dan, Manojit Chattopadhyay","Hybrid Fuzzy-ART based K-Means Clustering Methodology to Cellular
  Manufacturing Using Operational Time","Proceedings of International Conference on Operational Excellence for
  Global Competitiveness (ICOEGC 2011)",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new hybrid Fuzzy-ART based K-Means Clustering technique
to solve the part machine grouping problem in cellular manufacturing systems
considering operational time. The performance of the proposed technique is
tested with problems from open literature and the results are compared to the
existing clustering models such as simple K-means algorithm and modified ART1
algorithm using an efficient modified performance measure known as modified
grouping efficiency (MGE) as found in the literature. The results support the
better performance of the proposed algorithm. The Novelty of this study lies in
the simple and efficient methodology to produce quick solutions for shop floor
managers with least computational efforts and time.
","[{'version': 'v1', 'created': 'Thu, 20 Dec 2012 15:53:43 GMT'}]",2012-12-21,"[['Sengupta', 'Sourav', ''], ['Ghosh', 'Tamal', ''], ['Dan', 'Pranab K', ''], ['Chattopadhyay', 'Manojit', '']]","['cell formation', 'group technology', 'cellular manufacturing', 'ratio data', 'artificial neural network', 'fuzzy adaptive resonance theory', 'k-means clustering']"
16678,1707.07923,Daniel S\'aez Trigueros,"Daniel S\'aez Trigueros, Li Meng, Margaret Hartnett","Enhancing Convolutional Neural Networks for Face Recognition with
  Occlusion Maps and Batch Triplet Loss","12 pages, 7 figures, 2 tables",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the recent success of convolutional neural networks for computer
vision applications, unconstrained face recognition remains a challenge. In
this work, we make two contributions to the field. Firstly, we consider the
problem of face recognition with partial occlusions and show how current
approaches might suffer significant performance degradation when dealing with
this kind of face images. We propose a simple method to find out which parts of
the human face are more important to achieve a high recognition rate, and use
that information during training to force a convolutional neural network to
learn discriminative features from all the face regions more equally, including
those that typical approaches tend to pay less attention to. We test the
accuracy of the proposed method when dealing with real-life occlusions using
the AR face database. Secondly, we propose a novel loss function called batch
triplet loss that improves the performance of the triplet loss by adding an
extra term to the loss function to cause minimisation of the standard deviation
of both positive and negative scores. We show consistent improvement in the
Labeled Faces in the Wild (LFW) benchmark by applying both proposed adjustments
to the convolutional neural network training.
","[{'version': 'v1', 'created': 'Tue, 25 Jul 2017 11:35:18 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Mar 2018 15:02:34 GMT'}, {'version': 'v3', 'created': 'Mon, 26 Mar 2018 14:05:34 GMT'}, {'version': 'v4', 'created': 'Sun, 10 Jun 2018 09:42:33 GMT'}]",2018-06-12,"[['Trigueros', 'Daniel Sáez', ''], ['Meng', 'Li', ''], ['Hartnett', 'Margaret', '']]","['face recognition', 'convolutional neural networks', 'facial occlusions', 'distance metric learning']"
16679,1607.02955,Henning Meyerhenke,"Elisabetta Bergamini, Michael Wegner, Dimitar Lukarski, Henning
  Meyerhenke","Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian
  Solver",Conference version published in Proceedings of SIAM CSC 2016,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Matrices associated with graphs, such as the Laplacian, lead to numerous
interesting graph problems expressed as linear systems. One field where
Laplacian linear systems play a role is network analysis, e. g. for certain
centrality measures that indicate if a node (or an edge) is important in the
network. One such centrality measure is current-flow closeness. To allow
network analysis workflows to profit from a fast Laplacian solver, we provide
an implementation of the LAMG multigrid solver in the NetworKit package,
facilitating the computation of current-flow closeness values or related
quantities. Our main contribution consists of two algorithms that accelerate
the current-flow computation for one node or a reasonably small node subset
significantly. One sampling-based algorithm provides an unbiased estimation of
the related electrical farness, the other one is based on the
Johnson-Lindenstrauss transform. Our inexact algorithms lead to very accurate
results in practice. Thanks to them one is now able to compute an estimation of
current-flow closeness of one node on networks with tens of millions of nodes
and edges within seconds or a few minutes. From a network analytical point of
view, our experiments indicate that current-flow closeness can discriminate
among different nodes significantly better than traditional shortest-path
closeness and is also considerably more resistant to noise -- we thus show that
two known drawbacks of shortest-path closeness are alleviated by the
current-flow variant.
","[{'version': 'v1', 'created': 'Mon, 11 Jul 2016 14:03:06 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Nov 2020 17:29:23 GMT'}]",2020-11-09,"[['Bergamini', 'Elisabetta', ''], ['Wegner', 'Michael', ''], ['Lukarski', 'Dimitar', ''], ['Meyerhenke', 'Henning', '']]","['Laplacian linear system', 'current-flowcloseness centrality', 'algebraic multigrid', 'commutetime', 'network analysis']"
16680,1609.01459,Emmanuel Osegi,"Emmanuel Ndidi Osegi (NOUN), Vincent Ike Anireh","Deviant Learning Algorithm: Learning Sparse Mismatch Representations
  through Time and Space",Working Paper,,,,cs.AI cs.NE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Predictive coding (PDC) has recently attracted attention in the neuroscience
and computing community as a candidate unifying paradigm for neuronal studies
and artificial neural network implementations particularly targeted at
unsupervised learning systems. The Mismatch Negativity (MMN) has also recently
been studied in relation to PC and found to be a useful ingredient in neural
predictive coding systems. Backed by the behavior of living organisms, such
networks are particularly useful in forming spatio-temporal transitions and
invariant representations of the input world. However, most neural systems
still do not account for large number of synapses even though this has been
shown by a few machine learning researchers as an effective and very important
component of any neural system if such a system is to behave properly. Our
major point here is that PDC systems with the MMN effect in addition to a large
number of synapses can greatly improve any neural learning system's performance
and ability to make decisions in the machine world. In this paper, we propose a
novel bio-mimetic computational intelligence algorithm -- the Deviant Learning
Algorithm, inspired by these key ideas and functional properties of recent
brain-cognitive discoveries and theories. We also show by numerical experiments
guided by theoretical insights, how our invented bio-mimetic algorithm can
achieve competitive predictions even with very small problem specific data.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2016 09:35:14 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Sep 2016 09:20:09 GMT'}, {'version': 'v3', 'created': 'Tue, 6 Dec 2016 18:53:24 GMT'}, {'version': 'v4', 'created': 'Wed, 7 Dec 2016 20:55:33 GMT'}, {'version': 'v5', 'created': 'Sun, 1 Jan 2017 11:26:06 GMT'}, {'version': 'v6', 'created': 'Tue, 3 Jan 2017 02:49:15 GMT'}]",2017-01-04,"[['Osegi', 'Emmanuel Ndidi', '', 'NOUN'], ['Anireh', 'Vincent Ike', '']]","['Artificial Neural Networks', 'Deviant Learning', 'Mixed-Integer Programming', 'Mismatch Negativity', 'Predictive Coding', 'Temporal Learning']"
16681,1111.6349,Awny Sayed,Awny Sayed,XML Information Retrieval Systems: A Survey,"10 pages, 25 references",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The continuous growth in the XML information repositories has been matched by
increasing efforts in development of XML retrieval systems, in large parts
aiming at supporting content-oriented XML retrieval. These systems exploit the
available structural information, as market up in XML documents, in order to
return documents components- the so called XML elements-instead of the
complement documents in repose to the user query. In this paper, we provide an
overview of the different XML information retrieval systems and classify them
according to their storage and query evaluation strategies.
","[{'version': 'v1', 'created': 'Mon, 28 Nov 2011 05:45:43 GMT'}]",2011-11-29,"[['Sayed', 'Awny', '']]","['XML', 'XML storing', 'XML indexing', 'XML querying', 'Information Retrieval']"
16682,1301.5871,Pierre-Francois Marteau,"Muhammad Marwan Muhammad Fuad (VALORIA), Pierre-Fran\c{c}ois Marteau
  (VALORIA)",Towards a faster symbolic aggregate approximation method,"ICSOFT 2010 - Fifth International Conference on Software and Data
  Technologies, Athens : Greece (2010)",,,,cs.DB cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The similarity search problem is one of the main problems in time series data
mining. Traditionally, this problem was tackled by sequentially comparing the
given query against all the time series in the database, and returning all the
time series that are within a predetermined threshold of that query. But the
large size and the high dimensionality of time series databases that are in use
nowadays make that scenario inefficient. There are many representation
techniques that aim at reducing the dimensionality of time series so that the
search can be handled faster at a lower-dimensional space level. The symbolic
aggregate approximation (SAX) is one of the most competitive methods in the
literature. In this paper we present a new method that improves the performance
of SAX by adding to it another exclusion condition that increases the exclusion
power. This method is based on using two representations of the time series:
one of SAX and the other is based on an optimal approximation of the time
series. Pre-computed distances are calculated and stored offline to be used
online to exclude a wide range of the search space using two exclusion
conditions. We conduct experiments which show that the new method is faster
than SAX.
","[{'version': 'v1', 'created': 'Thu, 24 Jan 2013 19:24:33 GMT'}]",2013-01-25,"[['Fuad', 'Muhammad Marwan Muhammad', '', 'VALORIA'], ['Marteau', 'Pierre-François', '', 'VALORIA']]","['Time Series Information Retrieval', 'Symbolic Aggregate Approximation', 'Fast SAX']"
16683,0906.3919,Serguei Mokhov,Serguei A. Mokhov and Joey Paquet,"A Type System Theory for Higher-Order Intensional Logic Support for
  Variable Bindings in Hybrid Intensional-Imperative Programs in GIPSY","12 pages, 1 table; 2 figures",,,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a type system for a platform called the General Intensional
Programming System (GIPSY), designed to support intensional programming
languages built upon intensional logic and their imperative counter-parts for
the intensional execution model. In GIPSY, the type system glues the static and
dynamic typing between intensional and imperative languages in its compiler and
run-time environments to support the intensional evaluation of expressions
written in various dialects of the intensional programming language Lucid. The
intensionality makes expressions to explicitly take into the account a
multidimensional context of evaluation with the context being a first-class
value that serves a number of applications that need the notion of context to
proceed. We describe and discuss the properties of such a type system and the
related type theory as well as particularities of the semantics, design and
implementation of the GIPSY type system.
","[{'version': 'v1', 'created': 'Mon, 22 Jun 2009 05:27:49 GMT'}]",2009-12-21,"[['Mokhov', 'Serguei A.', ''], ['Paquet', 'Joey', '']]","['Intensional Programming', 'Imperative Programming', 'Type System', 'Type Theory', 'General Intensional Programming System (GIPSY)', 'Context']"
16684,1107.4573,Peter Turney,Peter D. Turney (National Research Council of Canada),Analogy perception applied to seven tests of word comprehension,related work available at http://purl.org/peter.turney/,"Journal of Experimental & Theoretical Artificial Intelligence
  (JETAI), 2011, Volume 23, Issue 3, pages 343-362",,,cs.AI cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It has been argued that analogy is the core of cognition. In AI research,
algorithms for analogy are often limited by the need for hand-coded high-level
representations as input. An alternative approach is to use high-level
perception, in which high-level representations are automatically generated
from raw data. Analogy perception is the process of recognizing analogies using
high-level perception. We present PairClass, an algorithm for analogy
perception that recognizes lexical proportional analogies using representations
that are automatically generated from a large corpus of raw textual data. A
proportional analogy is an analogy of the form A:B::C:D, meaning ""A is to B as
C is to D"". A lexical proportional analogy is a proportional analogy with
words, such as carpenter:wood::mason:stone. PairClass represents the semantic
relations between two words using a high-dimensional feature vector, in which
the elements are based on frequencies of patterns in the corpus. PairClass
recognizes analogies by applying standard supervised machine learning
techniques to the feature vectors. We show how seven different tests of word
comprehension can be framed as problems of analogy perception and we then apply
PairClass to the seven resulting sets of analogy perception problems. We
achieve competitive results on all seven tests. This is the first time a
uniform approach has handled such a range of tests of word comprehension.
","[{'version': 'v1', 'created': 'Fri, 22 Jul 2011 16:54:11 GMT'}]",2011-07-25,"[['Turney', 'Peter D.', '', 'National Research Council of Canada']]","['analogies', 'word comprehension', 'test-based AI', 'semantic relations', 'synonyms', 'antonyms']"
16685,1603.00709,Mouna Ben Ishak,"Mouna Ben Ishak (LARODEC), Rajani Chulyadyo (LINA), Philippe Leray
  (LINA)",Probabilistic Relational Model Benchmark Generation,,,,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The validation of any database mining methodology goes through an evaluation
process where benchmarks availability is essential. In this paper, we aim to
randomly generate relational database benchmarks that allow to check
probabilistic dependencies among the attributes. We are particularly interested
in Probabilistic Relational Models (PRMs), which extend Bayesian Networks (BNs)
to a relational data mining context and enable effective and robust reasoning
over relational data. Even though a panoply of works have focused, separately ,
on the generation of random Bayesian networks and relational databases, no work
has been identified for PRMs on that track. This paper provides an algorithmic
approach for generating random PRMs from scratch to fill this gap. The proposed
method allows to generate PRMs as well as synthetic relational data from a
randomly generated relational schema and a random set of probabilistic
dependencies. This can be of interest not only for machine learning researchers
to evaluate their proposals in a common framework, but also for databases
designers to evaluate the effectiveness of the components of a database
management system.
","[{'version': 'v1', 'created': 'Wed, 2 Mar 2016 13:46:31 GMT'}]",2016-03-03,"[['Ishak', 'Mouna Ben', '', 'LARODEC'], ['Chulyadyo', 'Rajani', '', 'LINA'], ['Leray', 'Philippe', '', 'LINA']]","['Probabilistic Relational Model', 'Relational data representation', 'Benchmark generation']"
16686,1206.3559,Saumil Srivastava,Saumil Srivastava,Real time facial expression recognition using a novel method,"The International Journal of Multimedia & Its Applications (IJMA)
  Vol.4, No.2, April 2012",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses a novel method for Facial Expression Recognition System
which performs facial expression analysis in a near real time from a live web
cam feed. Primary objectives were to get results in a near real time with light
invariant, person independent and pose invariant way. The system is composed of
two different entities trainer and evaluator. Each frame of video feed is
passed through a series of steps including haar classifiers, skin detection,
feature extraction, feature points tracking, creating a learned Support Vector
Machine model to classify emotions to achieve a tradeoff between accuracy and
result rate. A processing time of 100-120 ms per 10 frames was achieved with
accuracy of around 60%. We measure our accuracy in terms of variety of
interaction and classification scenarios. We conclude by discussing relevance
of our work to human computer interaction and exploring further measures that
can be taken.
","[{'version': 'v1', 'created': 'Tue, 8 May 2012 06:54:41 GMT'}]",2012-06-18,"[['Srivastava', 'Saumil', '']]","['Haar Classifier', 'SVM', 'Shi Tomasi Corner Detection', 'facial expression analysis', 'affective user interface']"
16687,1702.00700,Rodrigo Agerri,Egoitz Laparra and Rodrigo Agerri and Itziar Aldabe and German Rigau,Multilingual and Cross-lingual Timeline Extraction,"20 pages, 7 tables, 7 figures; submitted to Knowledge Based Systems
  (Elsevier), January, 2017",,,,cs.CL cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this paper we present an approach to extract ordered timelines of events,
their participants, locations and times from a set of multilingual and
cross-lingual data sources. Based on the assumption that event-related
information can be recovered from different documents written in different
languages, we extend the Cross-document Event Ordering task presented at
SemEval 2015 by specifying two new tasks for, respectively, Multilingual and
Cross-lingual Timeline Extraction. We then develop three deterministic
algorithms for timeline extraction based on two main ideas. First, we address
implicit temporal relations at document level since explicit time-anchors are
too scarce to build a wide coverage timeline extraction system. Second, we
leverage several multilingual resources to obtain a single, inter-operable,
semantic representation of events across documents and across languages. The
result is a highly competitive system that strongly outperforms the current
state-of-the-art. Nonetheless, further analysis of the results reveals that
linking the event mentions with their target entities and time-anchors remains
a difficult challenge. The systems, resources and scorers are freely available
to facilitate its use and guarantee the reproducibility of results.
","[{'version': 'v1', 'created': 'Thu, 2 Feb 2017 14:44:17 GMT'}]",2017-02-03,"[['Laparra', 'Egoitz', ''], ['Agerri', 'Rodrigo', ''], ['Aldabe', 'Itziar', ''], ['Rigau', 'German', '']]","['Timeline extraction', 'Event ordering', 'Temporal processing', 'Cross-document eventcoreference', 'Predicate Matrix', 'Natural Language Processing']"
16688,1602.06823,Manuel Mazzara,"Alexander Tchitchigin, Larisa Safina, Manuel Mazzara, Mohamed Elwakil,
  Fabrizio Montesi and Victor Rivera",Refinement types in Jolie,,,,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Jolie is the first language for microservices and it is currently dynamically
type checked. This paper considers the opportunity to integrate dynamic and
static type checking with the introduction of refinement types, verified via
SMT solver. The integration of the two aspects allows a scenario where the
static verification of internal services and the dynamic verification of
(potentially malicious) external services cooperates in order to reduce testing
effort and enhancing security.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2016 15:40:04 GMT'}]",2016-02-23,"[['Tchitchigin', 'Alexander', ''], ['Safina', 'Larisa', ''], ['Mazzara', 'Manuel', ''], ['Elwakil', 'Mohamed', ''], ['Montesi', 'Fabrizio', ''], ['Rivera', 'Victor', '']]","['Microservices', 'Jolie', 'Refinement Types', 'SMT', 'SAT', 'Z3']"
16689,1710.03561,Geraint Palmer,"Geraint I. Palmer, Vincent A. Knight, Paul R. Harper, Asyl L. Hawa",Ciw: An open source discrete event simulation library,,,,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces Ciw, an open source library for conducting discrete
event simulations that has been developed in Python. The strengths of the
library are illustrated in terms of best practice and reproducibility for
computational research. An analysis of Ciw's performance and comparison to
several alternative discrete event simulation frameworks is presented.
","[{'version': 'v1', 'created': 'Wed, 27 Sep 2017 11:05:34 GMT'}]",2017-10-11,"[['Palmer', 'Geraint I.', ''], ['Knight', 'Vincent A.', ''], ['Harper', 'Paul R.', ''], ['Hawa', 'Asyl L.', '']]","['reproducibility', 'discrete event simulation', 'open source', 'python']"
16690,1407.7924,Michael Metel,"Antoine Deza, Kai Huang, and Michael R. Metel",Chance Constrained Optimization for Targeted Internet Advertising,,,,,cs.CE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a chance constrained optimization model for the fulfillment of
guaranteed display Internet advertising campaigns. The proposed formulation for
the allocation of display inventory takes into account the uncertainty of the
supply of Internet viewers. We discuss and present theoretical and
computational features of the model via Monte Carlo sampling and convex
approximations. Theoretical upper and lower bounds are presented along with a
numerical substantiation.
","[{'version': 'v1', 'created': 'Wed, 30 Jul 2014 02:33:57 GMT'}]",2014-07-31,"[['Deza', 'Antoine', ''], ['Huang', 'Kai', ''], ['Metel', 'Michael R.', '']]","['Internet advertising', 'chance constrained programming', 'sampleapproximation', 'convex programming']"
16691,1607.02677,Jin Li,"Minghui Yang, Jin Li, Keqin Feng","Construction of Cyclic and Constacyclic Codes for b-symbol Read Channels
  Meeting the Plotkin-like Bound",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The symbol-pair codes over finite fields have been raised for symbol-pair
read channels and motivated by application of high-density data storage
technologies [1, 2]. Their generalization is the code for b-symbol read
channels (b > 2). Many MDS codes for b-symbol read channels have been
constructed which meet the Singleton-like bound ([3, 4, 10] for b = 2 and [11]
for b > 2). In this paper we show the Plotkin-like bound and present a
construction on irreducible cyclic codes and constacyclic codes meeting the
Plotkin-like bound.
","[{'version': 'v1', 'created': 'Sun, 10 Jul 2016 02:06:42 GMT'}]",2016-07-12,"[['Yang', 'Minghui', ''], ['Li', 'Jin', ''], ['Feng', 'Keqin', '']]","['Symbol-pair codes', 'b-symbol read channel', 'Plotkin bound', 'codes for magnetic storage', 'cyclic codes']"
16692,1109.3524,L. A. Barba,Simon K Layton and Anush Krishnan and Lorena A. Barba,cuIBM -- A GPU-accelerated Immersed Boundary Method,"Extended paper post-conference, presented at the 23rd International
  Conference on Parallel Computational Fluid Dynamics (http://www.parcfd.org),
  ParCFD 2011, Barcelona (unpublished)",,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A projection-based immersed boundary method is dominated by sparse linear
algebra routines. Using the open-source Cusp library, we observe a speedup
(with respect to a single CPU core) which reflects the constraints of a
bandwidth-dominated problem on the GPU. Nevertheless, GPUs offer the capacity
to solve large problems on commodity hardware. This work includes validation
and a convergence study of the GPU-accelerated IBM, and various optimizations.
","[{'version': 'v1', 'created': 'Fri, 16 Sep 2011 04:02:15 GMT'}, {'version': 'v2', 'created': 'Sat, 9 Apr 2016 00:39:08 GMT'}]",2016-04-12,"[['Layton', 'Simon K', ''], ['Krishnan', 'Anush', ''], ['Barba', 'Lorena A.', '']]","['Immersed Boundary Method', 'Computational Fluid Dynamics', 'GPU Computing']"
16693,1312.7279,Pierre-Jean Spaenlehauer,\'Eric Schost and Pierre-Jean Spaenlehauer,"A Quadratically Convergent Algorithm for Structured Low-Rank
  Approximation","37 pages, Maple package available at
  http://www.pjspaenlehauer.net/data/software/NewtonSLRA_notes.html",,,,cs.NA cs.SC math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Structured Low-Rank Approximation is a problem arising in a wide range of
applications in Numerical Analysis and Engineering Sciences. Given an input
matrix $M$, the goal is to compute a matrix $M'$ of given rank $r$ in a linear
or affine subspace $E$ of matrices (usually encoding a specific structure) such
that the Frobenius distance $\lVert M-M'\rVert$ is small. We propose a
Newton-like iteration for solving this problem, whose main feature is that it
converges locally quadratically to such a matrix under mild transversality
assumptions between the manifold of matrices of rank $r$ and the linear/affine
subspace $E$. We also show that the distance between the limit of the iteration
and the optimal solution of the problem is quadratic in the distance between
the input matrix and the manifold of rank $r$ matrices in $E$. To illustrate
the applicability of this algorithm, we propose a Maple implementation and give
experimental results for several applicative problems that can be modeled by
Structured Low-Rank Approximation: univariate approximate GCDs (Sylvester
matrices), low-rank Matrix completion (coordinate spaces) and denoising
procedures (Hankel matrices). Experimental results give evidence that this
all-purpose algorithm is competitive with state-of-the-art numerical methods
dedicated to these problems.
","[{'version': 'v1', 'created': 'Fri, 27 Dec 2013 15:17:39 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Oct 2014 09:20:30 GMT'}]",2014-10-28,"[['Schost', 'Éric', ''], ['Spaenlehauer', 'Pierre-Jean', '']]","['Structured low-rank approximation', 'Newton iteration', 'quadratic convergence', 'Approximate GCD', 'Matrix completion']"
16694,1707.08029,Dietmar Jannach,Dietmar Jannach and Gediminas Adomavicius,Price and Profit Awareness in Recommender Systems,"Presented at the 2017 Workshop on Value-Aware and Multi-Stakeholder
  Recommendation (VAMS) collocated with ACM RecSys 2017",,,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Academic research in the field of recommender systems mainly focuses on the
problem of maximizing the users' utility by trying to identify the most
relevant items for each user. However, such items are not necessarily the ones
that maximize the utility of the service provider (e.g., an online retailer) in
terms of the business value, such as profit. One approach to increasing the
providers' utility is to incorporate purchase-oriented information, e.g., the
price, sales probabilities, and the resulting profit, into the recommendation
algorithms. In this paper we specifically focus on price- and profit-aware
recommender systems. We provide a brief overview of the relevant literature and
use numerical simulations to illustrate the potential business benefit of such
approaches.
","[{'version': 'v1', 'created': 'Tue, 25 Jul 2017 15:07:33 GMT'}]",2017-07-26,"[['Jannach', 'Dietmar', ''], ['Adomavicius', 'Gediminas', '']]","['Recommender systems', 'e-commerce', 'price and proft awareness']"
16695,1205.1600,Joanne Mun-Yee Lim,"Joanne Mun-Yee Lim, Chee-Onn Chow","Smart handover based on fuzzy logic trend in IEEE802.11 mobile IPv6
  networks",19 pages,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A properly designed handoff algorithm is essential in reducing the connection
quality deterioration when a mobile node moves across the cell boundaries.
Therefore, to improve communication quality, we identified three goals in our
paper. The first goal is to minimize unnecessary handovers and increase
communication quality by reducing misrepresentations of RSSI readings due to
multipath and shadow effect with the use of additional parameters. The second
goal is to control the handover decisions depending on the users' mobility by
utilizing location factors as one of the input parameters in a fuzzy logic
handover algorithm. The third goal is to minimize false handover alarms caused
by sudden fluctuations of parameters by monitoring the trend of fuzzy logic
outputs for a period of time before making handover decision. In this paper, we
use RSSI, speed and distance as the input decision criteria of a handover
trigger algorithm by means of fuzzy logic. The fuzzy logic output trend is
monitored for a period of time before handover is triggered. Finally, through
simulations, we show the effectiveness of the proposed handover algorithm in
achieving better communication quality.
","[{'version': 'v1', 'created': 'Tue, 8 May 2012 06:34:03 GMT'}]",2012-05-09,"[['Lim', 'Joanne Mun-Yee', ''], ['Chow', 'Chee-Onn', '']]","['Handover', 'Mobile IPv6', 'Fuzzy Logic', 'RSSI', 'Speed', 'Distance  1']"
16696,1602.06373,Jinye Zhang,"Jinye Zhang, Laming Chen, Petros T. Boufounos, and Yuantao Gu","Cross Validation in Compressive Sensing and its Application of OMP-CV
  Algorithm",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Compressive sensing (CS) is a data acquisition technique that measures sparse
or compressible signals at a sampling rate lower than their Nyquist rate.
Results show that sparse signals can be reconstructed using greedy algorithms,
often requiring prior knowledge such as the signal sparsity or the noise level.
As a substitute to prior knowledge, cross validation (CV), a statistical method
that examines whether a model overfits its data, has been proposed to determine
the stopping condition of greedy algorithms. This paper first analyzes cross
validation in a general compressive sensing framework and developed general
cross validation techniques which could be used to understand CV-based sparse
recovery algorithms. Furthermore, we provide theoretical analysis for OMP-CV, a
cross validation modification of orthogonal matching pursuit, which has very
good sparse recovery performance. Finally, numerical experiments are given to
validate our theoretical results and investigate the behaviors of OMP-CV.
","[{'version': 'v1', 'created': 'Sat, 20 Feb 2016 06:55:35 GMT'}]",2016-02-23,"[['Zhang', 'Jinye', ''], ['Chen', 'Laming', ''], ['Boufounos', 'Petros T.', ''], ['Gu', 'Yuantao', '']]","['Compressive sensing', 'signal reconstruction', 'cross validation', 'orthogonalmatching pursuit']"
16697,1005.4013,William Jackson,Sami Halawani and Abdul Waheed Khan,"Sensors Lifetime Enhancement Techniques in Wireless Sensor Networks - A
  Survey",http://www.journalofcomputing.org,"Journal of Computing, Volume 2, Issue 5, May 2010",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless Sensor Networks are basically used for gathering information needed
by smart environments but they are particularly useful in unattended situations
where terrain, climate and other environmental constraints may hinder in the
deployment of wired/conventional networks. Unlike traditional networks, these
sensor networks do not have a continuous power supply at their disposal. Rather
the individual sensors are battery operated and the lifetime of the individual
sensors and thus the overall network depend heavily on duty cycle of these
sensors. Analysis on WSNs shows that communication module is the main part
which consumes most of the sensor energy and that is why energy conservation is
the major optimization goal. Since routing protocols and MAC protocols directly
access the communication module therefore the design of protocols in these two
domains should take into account the energy conservation goal. In this paper,
we discuss different state-of-the-art protocols both in MAC and routing domains
that have been proposed for WSNs to achieve the overall goal of prolonging the
network lifetime. The routing protocols in WSNs are generally categorized into
three groups - data centric, hierarchical and location-based but we focus on
only the first two categories because location-based routing protocols
generally require a prior knowledge about sensors location which most of the
times is not available due to random deployment of the sensors. We then discuss
how schedule-based and contention-based MAC protocols can contribute to achieve
optimal utilization of the limited energy resource by avoiding or reducing the
chances of collisions and thus the need for retransmission.
","[{'version': 'v1', 'created': 'Fri, 21 May 2010 17:15:08 GMT'}]",2010-05-24,"[['Halawani', 'Sami', ''], ['Khan', 'Abdul Waheed', '']]","['WSN', 'Data-Centric Routing', 'Data Aggregation', 'Hierarchical Routing', 'Clustering', 'Schedule-Based MAC Protocols', 'Contention-Based MAC Protocols']"
16698,1505.02810,Paola Focchini,"Amir Afrasiabi Rad, Paola Flocchini, Joanne Gaudet",Tempus Fugit: The Impact of Time in Knowledge Mobilization Networks,,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The temporal component of social networks is often neglected in their
analysis, and statistical measures are typically performed on a ""static""
representation of the network. As a result, measures of importance (like
betweenness centrality) cannot reveal any temporal role of the entities
involved. Our goal is to start filling this limitation by proposing a form of
temporal betweenness measure, and by using it to analyse a knowledge
mobilization network. We show that this measure, which takes time explicitly
into account, allows us to detect centrality roles that were completely hidden
in the classical statistical analysis. In particular, we uncover nodes whose
static centrality was considered negligible, but whose temporal role is instead
important to accelerate mobilization flow in the network. We also observe the
reverse behaviour by detecting nodes with high static centrality, whose role as
temporal bridges is instead very low. By revealing important temporal roles,
this study is a first step towards a better understanding of the impact of time
in social networks, and opens the road to further investigation.
","[{'version': 'v1', 'created': 'Mon, 11 May 2015 21:31:24 GMT'}]",2015-05-13,"[['Rad', 'Amir Afrasiabi', ''], ['Flocchini', 'Paola', ''], ['Gaudet', 'Joanne', '']]","['Time-varying graphs', 'temporal betweenness', 'dynamic networks', 'temporalanalysis', 'social networks']"
16699,0704.2201,Hassan Satori,"H. Satori, M. Harti and N. Chenfour",Arabic Speech Recognition System using CMU-Sphinx4,"5 pages, 3 figures and 2 tables, in French",,,,cs.CL cs.AI,,"  In this paper we present the creation of an Arabic version of Automated
Speech Recognition System (ASR). This system is based on the open source
Sphinx-4, from the Carnegie Mellon University. Which is a speech recognition
system based on discrete hidden Markov models (HMMs). We investigate the
changes that must be made to the model to adapt Arabic voice recognition.
  Keywords: Speech recognition, Acoustic model, Arabic language, HMMs,
CMUSphinx-4, Artificial intelligence.
","[{'version': 'v1', 'created': 'Tue, 17 Apr 2007 17:04:26 GMT'}]",2007-05-23,"[['Satori', 'H.', ''], ['Harti', 'M.', ''], ['Chenfour', 'N.', '']]","['Speech recognition', 'Acoustic model', 'Arabic language', 'HMMs', 'CMUSphinx-4', 'Artificial intelligence.  Résume']"
16700,1105.1109,Thu-Hien To,Michel Habib and Thu-Hien To,On a conjecture of compatibility of multi-states characters,,,,,cs.DS q-bio.PE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Perfect phylogeny consisting of determining the compatibility of a set of
characters is known to be NP-complete. We propose in this article a conjecture
on the necessary and sufficient conditions of compatibility: Given a set
$\mathcal{C}$ of $r$-states full characters, there exists a function $f(r)$
such that $\mathcal{C}$ is compatible iff every set of $f(r)$ characters of
$\mathcal{C}$ is compatible. Some previous work showed that $f(2)=2$, $f(3)=3$
and $f(r) \ge r-1$. Gusfield et al. 09 conjectured that $f(r) = r$ for any $r
\ge 2$. In this paper, we present an example showing that $f(4) \ge 5$ and then
a closure operation for chordal sandwich graphs. The later problem is a common
approach of perfect phylogeny. This operation can be the first step to simplify
the problem before solving some particular cases $f(4), f(5), ... $, and
determining the function $f(r)$.
","[{'version': 'v1', 'created': 'Thu, 5 May 2011 15:58:02 GMT'}]",2011-05-06,"[['Habib', 'Michel', ''], ['To', 'Thu-Hien', '']]","['perfect phylogeny', 'multi-states characters', 'chordal completion', 'triangulation']"
16701,0807.2053,Aikaterini Mitrokotsa,Aikaterini Mitrokotsa and Nikos Komninos and Christos Douligeris,"Towards an Effective Intrusion Response Engine Combined with Intrusion
  Detection in Ad Hoc Networks","8 pages, 9 figures, presented at MedHocNet07",,,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present an effective intrusion response engine combined
with intrusion detection in ad hoc networks. The intrusion response engine is
composed of a secure communication module, a local and a global response
module. Its function is based on an innovative tree-based key agreement
protocol while the intrusion detection engine is based on a class of neural
networks called eSOM. The proposed intrusion response model and the tree-based
protocol, it is based on, are analyzed concerning key secrecy while the
intrusion detection engine is evaluated for MANET under different traffic
conditions and mobility patterns. The results show a high detection rate for
packet dropping attacks.
","[{'version': 'v1', 'created': 'Sun, 13 Jul 2008 18:50:48 GMT'}]",2008-07-15,"[['Mitrokotsa', 'Aikaterini', ''], ['Komninos', 'Nikos', ''], ['Douligeris', 'Christos', '']]","['Ad Hoc Networks', 'Intrusion Response', 'Intrusion Detection', 'Key Agreement Protocol']"
16702,1504.01840,Yegor Tkachenko,Yegor Tkachenko,"Autonomous CRM Control via CLV Approximation with Deep Reinforcement
  Learning in Discrete and Continuous Action Space","13 pages, 8 figures",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper outlines a framework for autonomous control of a CRM (customer
relationship management) system. First, it explores how a modified version of
the widely accepted Recency-Frequency-Monetary Value system of metrics can be
used to define the state space of clients or donors. Second, it describes a
procedure to determine the optimal direct marketing action in discrete and
continuous action space for the given individual, based on his position in the
state space. The procedure involves the use of model-free Q-learning to train a
deep neural network that relates a client's position in the state space to
rewards associated with possible marketing actions. The estimated value
function over the client state space can be interpreted as customer lifetime
value, and thus allows for a quick plug-in estimation of CLV for a given
client. Experimental results are presented, based on KDD Cup 1998 mailing
dataset of donation solicitations.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2015 06:22:44 GMT'}]",2015-04-09,"[['Tkachenko', 'Yegor', '']]","['direct marketing', 'CRM', 'CLV', 'RFM', 'deep reinforcement learning', 'autonomous control']"
16703,0706.4323,Khalil Djelloul,"Khalil Djelloul, Thi-bich-hanh Dao and Thom Fruehwirth",Theory of Finite or Infinite Trees Revisited,,,,,cs.LO cs.AI,,"  We present in this paper a first-order axiomatization of an extended theory
$T$ of finite or infinite trees, built on a signature containing an infinite
set of function symbols and a relation $\fini(t)$ which enables to distinguish
between finite or infinite trees. We show that $T$ has at least one model and
prove its completeness by giving not only a decision procedure, but a full
first-order constraint solver which gives clear and explicit solutions for any
first-order constraint satisfaction problem in $T$. The solver is given in the
form of 16 rewriting rules which transform any first-order constraint $\phi$
into an equivalent disjunction $\phi$ of simple formulas such that $\phi$ is
either the formula $\true$ or the formula $\false$ or a formula having at least
one free variable, being equivalent neither to $\true$ nor to $\false$ and
where the solutions of the free variables are expressed in a clear and explicit
way. The correctness of our rules implies the completeness of $T$. We also
describe an implementation of our algorithm in CHR (Constraint Handling Rules)
and compare the performance with an implementation in C++ and that of a recent
decision procedure for decomposable theories.
","[{'version': 'v1', 'created': 'Thu, 28 Jun 2007 21:18:19 GMT'}]",2007-07-02,"[['Djelloul', 'Khalil', ''], ['Dao', 'Thi-bich-hanh', ''], ['Fruehwirth', 'Thom', '']]","['Logical first-order formula', 'Theory of finite or infinite trees', 'Completetheory', 'Rewriting rules']"
16704,1312.6201,Farn Wang,"Farn Wang, Jung-Hsuan Wu, Sven Schewe, Chung-Hao Huang",Coverage Games for Testing Nondeterministic Systems,"21 pages, 5 figures, 15 pages in the main text, 6 pages in appendices",,,,cs.SE cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern software systems may exhibit a nondeterministic behavior due to many
unpredictable factors. In this work, we propose the node coverage game, a two
player turn-based game played on a finite game graph, as a formalization of the
problem to test such systems. Each node in the graph represents a {\em
functional equivalence class} of the software under test (SUT). One player, the
tester, wants to maximize the node coverage, measured by the number of nodes
visited when exploring the game graphs, while his opponent, the SUT, wants to
minimize it. An optimal test would maximize the cover, and it is an interesting
problem to find the maximal number of nodes that the tester can guarantee to
visit, irrespective of the responses of the SUT. We show that the decision
problem of whether the guarantee is less than a given number is NP-complete.
Then we present techniques for testing nondeterministic SUTs with existing test
suites for deterministic models. Finally, we report our implementation and
experiments.
","[{'version': 'v1', 'created': 'Sat, 21 Dec 2013 04:00:26 GMT'}]",2013-12-24,"[['Wang', 'Farn', ''], ['Wu', 'Jung-Hsuan', ''], ['Schewe', 'Sven', ''], ['Huang', 'Chung-Hao', '']]","['testing', 'nondeterminism', 'coverage', 'game', 'strategy', 'complexity']"
16705,1212.3540,Dima Kagan,"Yehonatan Bitton, Michael Fire, Dima Kagan, Bracha Shapira, Lior
  Rokach, Judit Bar-Ilan",Social Network Based Search for Experts,Participated in HCIR 2012,,,,cs.SI cs.HC cs.IR physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our system illustrates how information retrieved from social networks can be
used for suggesting experts for specific tasks. The system is designed to
facilitate the task of finding the appropriate person(s) for a job, as a
conference committee member, an advisor, etc. This short description will
demonstrate how the system works in the context of the HCIR2012 published
tasks.
","[{'version': 'v1', 'created': 'Fri, 14 Dec 2012 17:35:31 GMT'}]",2012-12-17,"[['Bitton', 'Yehonatan', ''], ['Fire', 'Michael', ''], ['Kagan', 'Dima', ''], ['Shapira', 'Bracha', ''], ['Rokach', 'Lior', ''], ['Bar-Ilan', 'Judit', '']]","['Social networks', 'Text categorization', 'HCIR']"
16706,1704.02737,Gabriella Fiore,"Gabriella Fiore, Elena De Santis, Maria Domenica Di Benedetto","Secure Mode Distinguishability for Switching Systems Subject to Sparse
  Attacks",8 pages,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Switching systems are an important mathematical formalism when dealing with
Cyber-Physical Systems (CPSs). In this paper we provide conditions for the
exact reconstruction of the initial discrete state of a switching system, when
only the continuous output is measurable, and the discrete output signal is not
available. In particular, assuming that the continuous input and output signals
may be corrupted by additive malicious attacks, we provide conditions for the
secure mode distinguishability for linear switching systems. As illustrative
example, we consider the hybrid model of a DC/DC boost converter.
","[{'version': 'v1', 'created': 'Mon, 10 Apr 2017 07:17:51 GMT'}]",2017-04-11,"[['Fiore', 'Gabriella', ''], ['De Santis', 'Elena', ''], ['Di Benedetto', 'Maria Domenica', '']]","['Switching systems', 'mode distinguishability', 'secure state estimation']"
16707,1003.4919,Laurent Poinsot,Laurent Poinsot (LIPN),Doubly Perfect Nonlinear Boolean Permutations,,"Journal of Discrete Mathematical Sciences and Cryptography 13, 6
  (2010) 571-582",,,cs.DM cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to implementation constraints the XOR operation is widely used in order
to combine plaintext and key bit-strings in secret-key block ciphers. This
choice directly induces the classical version of the differential attack by the
use of XOR-kind differences. While very natural, there are many alternatives to
the XOR. Each of them inducing a new form for its corresponding differential
attack (using the appropriate notion of difference) and therefore block-ciphers
need to use S-boxes that are resistant against these nonstandard differential
cryptanalysis. In this contribution we study the functions that offer the best
resistance against a differential attack based on a finite field
multiplication. We also show that in some particular cases, there are robust
permutations which offers the best resistant against both multiplication and
exponentiation base differential attacks. We call them doubly perfect nonlinear
permutations.
","[{'version': 'v1', 'created': 'Thu, 25 Mar 2010 14:38:44 GMT'}]",2011-01-14,"[['Poinsot', 'Laurent', '', 'LIPN']]","['finite field', 'perfect nonlinear function', 'group action']"
16708,1511.03639,Johannes Hofmann,"Johannes Hofmann, Dietmar Fey, Jan Eitzinger, Georg Hager, Gerhard
  Wellein","Analysis of Intel's Haswell Microarchitecture Using The ECM Model and
  Microbenchmarks",arXiv admin note: substantial text overlap with arXiv:1509.03118,,,,cs.DC cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an in-depth analysis of Intel's Haswell microarchitecture
for streaming loop kernels. Among the new features examined is the dual-ring
Uncore design, Cluster-on-Die mode, Uncore Frequency Scaling, core improvements
as new and improved execution units, as well as improvements throughout the
memory hierarchy. The Execution-Cache-Memory diagnostic performance model is
used together with a generic set of microbenchmarks to quantify the efficiency
of the microarchitecture. The set of microbenchmarks is chosen such that it can
serve as a blueprint for other streaming loop kernels.
","[{'version': 'v1', 'created': 'Wed, 11 Nov 2015 20:20:03 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Nov 2015 12:43:22 GMT'}]",2015-11-16,"[['Hofmann', 'Johannes', ''], ['Fey', 'Dietmar', ''], ['Eitzinger', 'Jan', ''], ['Hager', 'Georg', ''], ['Wellein', 'Gerhard', '']]","['Intel Haswell', 'Architecture Analysis', 'ECM Model', 'Performance Modeling']"
16709,1702.07470,Rajarshi Ray,"Rajarshi Ray, Arup Deka, Kamalika Datta",Exact Synthesis of Reversible Logic Circuits using Model Checking,,,,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Synthesis of reversible logic circuits has gained great atten- tion during
the last decade. Various synthesis techniques have been pro- posed, some
generate optimal solutions (in gate count) and are termed as exact, while
others are scalable in the sense that they can handle larger functions but
generate sub-optimal solutions. Although scalable synthe- sis is very much
essential for circuit design, exact synthesis is also of great importance as it
helps in building design library for the synthesis of larger functions. In this
paper, we propose an exact synthesis technique for re- versible circuits using
model checking. We frame the synthesis problem as a model checking instance and
propose an iterative bounded model checking calls for an optimal synthesis.
Experiments on reversible logic benchmarks shows successful synthesis of
optimal circuits. We also illus- trate optimal synthesis of random functions
with as many as 10 variables and up to 10 gates.
","[{'version': 'v1', 'created': 'Fri, 24 Feb 2017 06:02:16 GMT'}]",2017-02-27,"[['Ray', 'Rajarshi', ''], ['Deka', 'Arup', ''], ['Datta', 'Kamalika', '']]","['Reversible circuits', 'exact synthesis', 'model checking', 'NuSMV ModelChecker']"
16710,1412.3729,Etienne Payet,Etienne Payet and Fred Mesnard,Non-termination of Dalvik bytecode via compilation to CLP,"5 pages, presented at the 13th International Workshop on Termination
  (WST) 2013",,,,cs.PL,http://creativecommons.org/licenses/by/3.0/,"  We present a set of rules for compiling a Dalvik bytecode program into a
logic program with array constraints. Non-termination of the resulting program
entails that of the original one, hence the techniques we have presented before
for proving non-termination of constraint logic programs can be used for
proving non-termination of Dalvik programs.
","[{'version': 'v1', 'created': 'Wed, 10 Dec 2014 12:20:13 GMT'}]",2014-12-12,"[['Payet', 'Etienne', ''], ['Mesnard', 'Fred', '']]","['Non-Termination', 'Android', 'Dalvik', 'Constraint Logic Programming']"
16711,1609.05876,Roberto Alonso,"Roberto Alonso, Ra\'ul Monroy, Eduardo Aguirre","On the Phase Transition of Finding a Biclique in a larger Bipartite
  Graph",,,,,cs.AI cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We report on the phase transition of finding a complete subgraph, of
specified dimensions, in a bipartite graph. Finding a complete subgraph in a
bipartite graph is a problem that has growing attention in several domains,
including bioinformatics, social network analysis and domain clustering. A key
step for a successful phase transition study is identifying a suitable order
parameter, when none is known. To this purpose, we have applied a decision tree
classifier to real-world instances of this problem, in order to understand what
problem features separate an instance that is hard to solve from those that is
not. We have successfully identified one such order parameter and with it the
phase transition of finding a complete bipartite subgraph of specified
dimensions. Our phase transition study shows an
easy-to-hard-to-easy-to-hard-to-easy pattern. Further, our results indicate
that the hardest instances are in a region where it is more likely that the
corresponding bipartite graph will have a complete subgraph of specified
dimensions, a positive answer. By contrast, instances with a negative answer
are more likely to appear in a region where the computational cost is
negligible. This behaviour is remarkably similar for problems of a number of
different sizes.
","[{'version': 'v1', 'created': 'Mon, 19 Sep 2016 19:22:08 GMT'}]",2016-09-20,"[['Alonso', 'Roberto', ''], ['Monroy', 'Raúl', ''], ['Aguirre', 'Eduardo', '']]","['Phase transition', 'bipartite graphs', 'bicliques', 'inducedsubgraphs', 'complete graphs']"
16712,1611.00467,Ruijie Fang,Ruijie Fang and Siqi Liu,A Performance Survey on Stack-based and Register-based Virtual Machines,"Short paper for evaluating performance differences between a
  stack-based and a register-based virtual machine",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Virtual machines have been widely adapted for high-level programming language
implementations and for providing a degree of platform neutrality. As the
overall use and adaptation of virtual machines grow, the overall performance of
virtual machines has become a widely-discussed topic. In this paper, we present
a survey on the performance differences of the two most widely adapted types of
virtual machines - the stack-based virtual machine and the register-based
virtual machine - using various benchmark programs. Additionally, we adopted a
new approach of measuring performance by measuring the overall dispatch time,
amount of dispatches, fetch time, and execution time while running benchmarks
on custom-implemented, lightweight virtual machines. Finally, we present two
lightweight, custom-designed, Turing-equivalent virtual machines that are
specifically designed in benchmarking virtual machine performance - the
""Conceptum"" stack-based virtual machine, and the ""Inertia"" register-based
virtual machine. Our result showed that while on average the register machine
spends 20.39% less time in executing benchmarks than the stack machine, the
stack-based virtual machine is still faster than the virtual machine regarding
the instruction fetch time.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2016 04:37:13 GMT'}]",2016-11-03,"[['Fang', 'Ruijie', ''], ['Liu', 'Siqi', '']]","['Virtual Machine', 'Interpreters', 'Stack Architecture', 'Register Architecture']"
16713,1505.02765,Mikhail Kaluzhsky L.,Mikhail Kaluzhsky,Dropshipping - a new business revolution,"11 pages, in Russian. ISSN 0131-7652",ECO. 2013. No 2 (192). P. 128-141,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Article about the new form of trade in a network the Internet. Advantages of
dropshipping open to the Russian manufacturers and businessmen new horizons in
international trade and marketing. The author considers features of evolution
and a role of dropshipping in electronic commerce of a new millennium.
","[{'version': 'v1', 'created': 'Sun, 10 May 2015 15:31:49 GMT'}]",2015-05-13,"[['Kaluzhsky', 'Mikhail', '']]","['dropshipping', 'e-commerce', 'internet-marketing', 'e-trade']"
16714,0906.5123,R Doomun,Poonam Garg,Cryptanalysis of SDES via evolutionary computation techniques,"7 Pages, International Journal of Computer Science and Information
  Security (IJCSIS)","IJCSIS May 2009 Issue, Vol. 1, No. 1",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The cryptanalysis of simplified data encryption standard can be formulated as
NP-Hard combinatorial problem. The goal of this paper is two fold. First we
want to make a study about how evolutionary computation techniques can
efficiently solve the NP-Hard combinatorial problem. For achieving this goal we
test several evolutionary computation techniques like memetic algorithm,
genetic algorithm and simulated annealing for the cryptanalysis of simplified
data encryption standard problem (SDES). And second was a comparison between
memetic algorithm, genetic algorithm and simulated annealing were made in order
to investigate the performance for the cryptanalysis on SDES. The methods were
tested and extensive computational results show that memetic algorithm performs
better than genetic algorithms and simulated annealing for such type of NP-Hard
combinatorial problem. This paper represents our first effort toward efficient
memetic algorithm for the cryptanalysis of SDES.
","[{'version': 'v1', 'created': 'Sun, 28 Jun 2009 09:29:04 GMT'}]",2009-06-30,"[['Garg', 'Poonam', '']]","['Simplified data encryption standard', 'Memetic algorithm', 'Genetic algorithm', 'Simulated annealing', 'Key search space']"
16715,1304.6274,Rohan Padhye,Rohan Padhye and Uday P. Khedker,Interprocedural Data Flow Analysis in Soot using Value Contexts,SOAP 2013 Final Version,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An interprocedural analysis is precise if it is flow sensitive and fully
context-sensitive even in the presence of recursion. Many methods of
interprocedural analysis sacrifice precision for scalability while some are
precise but limited to only a certain class of problems.
  Soot currently supports interprocedural analysis of Java programs using graph
reachability. However, this approach is restricted to IFDS/IDE problems, and is
not suitable for general data flow frameworks such as heap reference analysis
and points-to analysis which have non-distributive flow functions.
  We describe a general-purpose interprocedural analysis framework for Soot
using data flow values for context-sensitivity. This framework is not
restricted to problems with distributive flow functions, although the lattice
must be finite. It combines the key ideas of the tabulation method of the
functional approach and the technique of value-based termination of call string
construction.
  The efficiency and precision of interprocedural analyses is heavily affected
by the precision of the underlying call graph. This is especially important for
object-oriented languages like Java where virtual method invocations cause an
explosion of spurious call edges if the call graph is constructed naively. We
have instantiated our framework with a flow and context-sensitive points-to
analysis in Soot, which enables the construction of call graphs that are far
more precise than those constructed by Soot's SPARK engine.
","[{'version': 'v1', 'created': 'Tue, 23 Apr 2013 13:02:09 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Jul 2013 06:48:43 GMT'}]",2013-07-30,"[['Padhye', 'Rohan', ''], ['Khedker', 'Uday P.', '']]","['Interprocedural analysis', 'context-sensitive analysis', 'points-to analysis', 'call graph']"
16716,1107.4570,Marco Manna,"Marco Manna, Francesco Ricca and Giorgio Terracina","Consistent Query Answering via ASP from Different Perspectives: Theory
  and Practice",,,,,cs.DB cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A data integration system provides transparent access to different data
sources by suitably combining their data, and providing the user with a unified
view of them, called global schema. However, source data are generally not
under the control of the data integration process, thus integrated data may
violate global integrity constraints even in presence of locally-consistent
data sources. In this scenario, it may be anyway interesting to retrieve as
much consistent information as possible. The process of answering user queries
under global constraint violations is called consistent query answering (CQA).
Several notions of CQA have been proposed, e.g., depending on whether
integrated information is assumed to be sound, complete, exact or a variant of
them. This paper provides a contribution in this setting: it uniforms solutions
coming from different perspectives under a common ASP-based core, and provides
query-driven optimizations designed for isolating and eliminating
inefficiencies of the general approach for computing consistent answers.
Moreover, the paper introduces some new theoretical results enriching existing
knowledge on decidability and complexity of the considered problems. The
effectiveness of the approach is evidenced by experimental results.
  To appear in Theory and Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Fri, 22 Jul 2011 16:45:21 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Oct 2011 14:09:50 GMT'}]",2011-10-10,"[['Manna', 'Marco', ''], ['Ricca', 'Francesco', ''], ['Terracina', 'Giorgio', '']]","['Answer Set Programming', 'Data Integration', 'Consistent Query Answering']"
16717,0907.4622,Rajkumar Buyya,"Christian Vecchiola, Xingchen Chu, and Rajkumar Buyya",Aneka: A Software Platform for .NET-based Cloud Computing,"30 pages, 10 figures",,,"GRIDS-TR-2009-4, Grid Computing and Distributed Systems Laboratory,
  The University of Melbourne, Australia, May 25, 2009",cs.DC cs.CE cs.NI cs.OS cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aneka is a platform for deploying Clouds developing applications on top of
it. It provides a runtime environment and a set of APIs that allow developers
to build .NET applications that leverage their computation on either public or
private clouds. One of the key features of Aneka is the ability of supporting
multiple programming models that are ways of expressing the execution logic of
applications by using specific abstractions. This is accomplished by creating a
customizable and extensible service oriented runtime environment represented by
a collection of software containers connected together. By leveraging on these
architecture advanced services including resource reservation, persistence,
storage management, security, and performance monitoring have been implemented.
On top of this infrastructure different programming models can be plugged to
provide support for different scenarios as demonstrated by the engineering,
life science, and industry applications.
","[{'version': 'v1', 'created': 'Sun, 26 Jul 2009 02:19:42 GMT'}]",2009-07-28,"[['Vecchiola', 'Christian', ''], ['Chu', 'Xingchen', ''], ['Buyya', 'Rajkumar', '']]","['Cloud Computing', 'Enterprise frameworks for Cloud Computing', 'Software Engineering', 'Service Oriented Computing']"
16718,0803.3099,Mark Burgin,Mark Burgin a and Marc L. Smith,"Concurrent Composition and Algebras of Events, Actions, and Processes",,,,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are many different models of concurrent processes. The goal of this
work is to introduce a common formalized framework for current research in this
area and to eliminate shortcomings of existing models of concurrency. Following
up the previous research of the authors and other researchers on concurrency,
here we build a high-level metamodel EAP (event-action-process) for concurrent
processes. This metamodel comprises a variety of other models of concurrent
processes. We shape mathematical models for, and study events, actions, and
processes in relation to important practical problems, such as communication in
networks, concurrent programming, and distributed computations. In the third
section of the work, a three-level algebra of events, actions and processes is
constructed and studied as a new stage of algebra for concurrent processes.
Relations between EAP process algebra and other models of concurrency are
considered in the fourth section of this work.
","[{'version': 'v1', 'created': 'Fri, 21 Mar 2008 00:27:38 GMT'}]",2008-03-24,"[['a', 'Mark Burgin', ''], ['Smith', 'Marc L.', '']]","['event', 'action', 'process', 'signal', 'action composition', 'process composition', 'true concurrency', 'process algebra']"
16719,1108.3268,Al-Sakib Khan Pathan,"Abdelgadir Tageldin Abdelgadir, Al-Sakib Khan Pathan, Mohiuddin Ahmed",On the Performance of MPI-OpenMP on a 12 nodes Multi-core Cluster,"11 pages, to appear in ICA3PP'11 conference",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the increasing number of Quad-Core-based clusters and the introduction
of compute nodes designed with large memory capacity shared by multiple cores,
new problems related to scalability arise. In this paper, we analyze the
overall performance of a cluster built with nodes having a dual Quad-Core
Processor on each node. Some benchmark results are presented and some
observations are mentioned when handling such processors on a benchmark test. A
Quad-Core-based cluster's complexity arises from the fact that both local
communication and network communications between the running processes need to
be addressed. The potentials of an MPI-OpenMP approach are pinpointed because
of its reduced communication overhead. At the end, we come to a conclusion that
an MPI-OpenMP solution should be considered in such clusters since optimizing
network communications between nodes is as important as optimizing local
communications between processors in a multi-core cluster.
","[{'version': 'v1', 'created': 'Tue, 16 Aug 2011 15:26:44 GMT'}]",2011-08-17,"[['Abdelgadir', 'Abdelgadir Tageldin', ''], ['Pathan', 'Al-Sakib Khan', ''], ['Ahmed', 'Mohiuddin', '']]","['MPI-OpenMP', 'hybrid', 'Multi-Core', 'Cluster']"
16720,1511.05778,Herv\'e Paulino,"Herv\'e Paulino, Nuno Delgado",Cache-Conscious Run-time Decomposition of Data Parallel Computations,24 pages,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-core architectures feature an intricate hierarchy of cache memories,
with multiple levels and sizes. To adequately decompose an application
according to the traits of a particular memory hierarchy is a cumbersome task
that may be rewarded with significant performance gains. The current
state-of-the-art in memory-hierarchy-aware parallel computing delegates this
endeavour on the programmer, demanding from him deep knowledge of both parallel
programming and computer architecture. In this paper we propose the shifting of
these memory-hierarchy-related concerns to the run-time system, which then
takes on the responsibility of distributing the computation's data across the
target memory hierarchy. We evaluate our approach from a performance
perspective, comparing it against the common cache-neglectful data
decomposition strategy.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2015 13:48:35 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Nov 2015 11:27:22 GMT'}]",2015-11-20,"[['Paulino', 'Hervé', ''], ['Delgado', 'Nuno', '']]","['Data parallelism', 'Data locality', 'Cache Optimizations', 'Parallelcomputing', 'Run-time support']"
16721,1207.5345,Lian Luo,"Gang Liao, Lei Liu, Lian Luo",A New P2N Approach to Software Development Under the Clustering,,,,,cs.SE cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this computer era of rapid development, software development can be seen
everywhere, but a lot of softwares are dead in modern development of software.
Just as The Mythical Man-Month said, it exists a problem in the software
development, and the problem is interflow.A lock of interflow can be said great
calamity. Clustering is a environment to breed new life. In this thesis, we
elaborate how P2N can be used to thinking, planning, developing, collaborating,
releasing. And the approach that make your team and organization more perfect.
","[{'version': 'v1', 'created': 'Mon, 23 Jul 2012 10:41:28 GMT'}]",2012-07-24,"[['Liao', 'Gang', ''], ['Liu', 'Lei', ''], ['Luo', 'Lian', '']]","['Software engineering', 'Software development', 'Clustering']"
16722,1409.5257,Stefano Salsano,"Stefano Salsano, Nicola Blefari-Melazzi, Francesco Lo Presti, Giuseppe
  Siracusano, Pier Luigi Ventre","Generalized Virtual Networking: an enabler for Service Centric
  Networking and Network Function Virtualization",,"Networks 2014, 16th International Telecommunications Network
  Strategy and Planning Symposium, 17-19 September 2014, Funchal, Portugal",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we introduce the Generalized Virtual Networking (GVN) concept.
GVN provides a framework to influence the routing of packets based on service
level information that is carried in the packets. It is based on a protocol
header inserted between the Network and Transport layers, therefore it can be
seen as a layer 3.5 solution. Technically, GVN is proposed as a new transport
layer protocol in the TCP/IP protocol suite. An IP router that is not GVN
capable will simply process the IP destination address as usual. Similar
concepts have been proposed in other works, and referred to as Service Oriented
Networking, Service Centric Networking, Application Delivery Networking, but
they are now generalized in the proposed GVN framework. In this respect, the
GVN header is a generic container that can be adapted to serve the needs of
arbitrary service level routing solutions. The GVN header can be managed by GVN
capable end-hosts and applications or can be pushed/popped at the edge of a GVN
capable network (like a VLAN tag). In this position paper, we show that
Generalized Virtual Networking is a powerful enabler for SCN (Service Centric
Networking) and NFV (Network Function Virtualization) and how it couples with
the SDN (Software Defined Networking) paradigm.
","[{'version': 'v1', 'created': 'Thu, 18 Sep 2014 11:02:48 GMT'}]",2014-09-19,"[['Salsano', 'Stefano', ''], ['Blefari-Melazzi', 'Nicola', ''], ['Presti', 'Francesco Lo', ''], ['Siracusano', 'Giuseppe', ''], ['Ventre', 'Pier Luigi', '']]","['Virtual Networking', 'Service Centric Networking', 'Software Defined Networking', 'Network Function Virtualization', 'Information Centric Networking']"
16723,1410.5976,Adam Barker,Michael Luckeneder and Adam Barker,"Uncovering the Perfect Place: Optimising Workflow Engine Deployment in
  the Cloud","Extended Abstract for the ACM International Symposium on
  High-Performance Parallel and Distributed Computing (HPDC 2013) Poster Track",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When orchestrating highly distributed and data-intensive Web service
workflows the geographical placement of the orchestration engine can greatly
affect the overall performance of a workflow. We present CloudForecast: a Web
service framework and analysis tool which, given a workflow specification,
computes the optimal Amazon EC2 Cloud region to automatically deploy the
orchestration engine and execute the workflow. We use geographical distance of
the workflow, network latency and HTTP round-trip time between Amazon Cloud
regions and the workflow nodes to find a ranking of Cloud regions. This overall
ranking predicts where the workflow orchestration engine should be deployed in
order to reduce overall execution time. Our experimental results show that our
proposed optimisation strategy, depending on the particular workflow, can speed
up execution time on average by 82.25% compared to local execution.
","[{'version': 'v1', 'created': 'Wed, 22 Oct 2014 10:03:16 GMT'}]",2014-10-23,"[['Luckeneder', 'Michael', ''], ['Barker', 'Adam', '']]","['Workflow optimisation', 'Scientific Workflows', 'IaaS Clouds']"
16724,1209.5695,Rehna V J,Rehna. V. J and Jeyakumar. M. K,Hybrid Approaches to Image Coding: A Review,"7 pages, 3 figures","(IJACSA) International Journal of Advanced Computer Science and
  Applications, Vol. 2, No. 7, 2011",,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, the digital world is most focused on storage space and speed. With
the growing demand for better bandwidth utilization, efficient image data
compression techniques have emerged as an important factor for image data
transmission and storage. To date, different approaches to image compression
have been developed like the classical predictive coding, popular transform
coding and vector quantization. Several second generation coding schemes or the
segmentation based schemes are also gaining popularity. Practically efficient
compression systems based on hybrid coding which combines the advantages of
different traditional methods of image coding have also been developed over the
years. In this paper, different hybrid approaches to image compression are
discussed. Hybrid coding of images, in this context, deals with combining two
or more traditional approaches to enhance the individual methods and achieve
better-quality reconstructed images with higher compression ratio. Literature
on hybrid techniques of image coding over the past years is also reviewed. An
attempt is made to highlight the neuro-wavelet approach for enhancing coding
efficiency.
","[{'version': 'v1', 'created': 'Wed, 12 Sep 2012 08:14:21 GMT'}]",2012-09-26,"[['J', 'Rehna. V.', ''], ['K', 'Jeyakumar. M.', '']]","['Hybrid coding', 'Predictive coding', 'Segmentation', 'Vector Quantization', 'Compression ratio']"
16725,1207.5310,Udayakumar P udayakumar P,"P. Udayakumar, M. Indhumathi","Semantic web based Sensor Planning Services (SPS) for Sensor Web
  Enablement (SWE)",13 Pages,,,,cs.SE cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Sensor Planning Service (SPS) is service model to define the web service
interface for requesting user driven acquisitions and observation. It's defined
by the Open Geospatial Consortium (OGC) Sensor Web Enablement (SWE) group to
provide standardized interface for tasking sensors to allow to defining,
checking, modifying and cancelling tasks of sensor and sensor data. The goal of
Sensor Planning Service (SPS) of OGC - SWE is standardize the interoperability
between a client and a server collection management environment. The Sensor
Planning Service (SPS) is need to automate complex data flow in a large
enterprises that are depend on live & stored data from sensors and multimedia
equipment. The obstacle are faced in Sensor Planning Service (SPS) are (I)
Observation from sensor at the right time and right place will be problem, (II)
acquisition information(data) that are collected at a specific time and
specific place will be problem. The above two obstacle are accomplished and
obtained by the web based semantic technology in order to provide & apply the
ontology based semantic rule to user driven a acquisitions and observation of
Sensor Planning Service (SPS). The novelty of our approach is by adding the
semantic rule to Sensor Planning Service model in SWE and we implemented Sensor
Planning Service (SPS) with semantic knowledge based to achieve high
standardized service model for Sensor Planning Service (SPS) of OGC - SWE.
","[{'version': 'v1', 'created': 'Mon, 23 Jul 2012 07:23:54 GMT'}]",2012-07-24,"[['Udayakumar', 'P.', ''], ['Indhumathi', 'M.', '']]","['Sensor Planning Service (SPS)', 'Open Geospatial Consortium (OGC)', 'Sensor Web']"
16726,1110.2867,Rami Mochaourab,Rami Mochaourab and Eduard A. Jorswieck,"Robust Beamforming in Interference Channels with Imperfect Transmitter
  Channel Information","27 pages, 5 figures, EURASIP Signal Processing",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider $K$ links operating concurrently in the same spectral band. Each
transmitter has multiple antennas, while each receiver uses a single antenna.
This setting corresponds to the multiple-input single-output interference
channel. We assume perfect channel state information at the single-user
decoding receivers whereas the transmitters only have estimates of the true
channels. The channel estimation errors are assumed to be bounded in elliptical
regions whose geometry is known at the transmitters. Robust beamforming
optimizes worst-case received power gains, and a Pareto optimal point is a
worst-case achievable rate tuple from which it is impossible to increase a
link's performance without degrading the performance of another. We
characterize the robust beamforming vectors necessary to operate at any Pareto
optimal point. Moreover, these beamforming vectors are parameterized by
$K(K-1)$ real-valued parameters. We analyze the system's spectral efficiency at
high and low signal-to-noise ratio (SNR). Zero forcing transmission achieves
full multiplexing gain at high SNR only if the estimation errors scale linearly
with inverse SNR. If the errors are SNR independent, then single-user
transmission is optimal at high SNR. At low SNR, robust maximum ratio
transmission optimizes the minimum energy per bit for reliable communication.
Numerical simulations illustrate the gained theoretical results.
","[{'version': 'v1', 'created': 'Thu, 13 Oct 2011 08:48:54 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Mar 2012 14:38:34 GMT'}]",2012-03-23,"[['Mochaourab', 'Rami', ''], ['Jorswieck', 'Eduard A.', '']]","['Interference channel', 'multiple-input single-output', 'imperfectchannel state information', 'robust beamforming', 'Pareto optimality']"
16727,1712.04010,Tathagata Mukherjee,"Tathagata Mukherjee, Alexander Veremyev, Piyush Kumar, Eduardo
  Pasiliao Jr",The Minimum Edge Compact Spanner Network Design Problem,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we introduce and study the Minimum Edge Compact Spanner~(MECS)
problem. We prove hardness results related to the problem, design exact and
greedy algorithms for solving the problem, and show related experimental
results. The MECS problem looks for sparse subgraphs of an input graph, such
that the average shortest path distance is preserved to a constant factor.
Average distance is a measure of the ease of communication over the network. As
a result such problems have applications in areas where one wants to substitute
a dense graph with a sparse subgraph while maintaining a low cost of
communication.
","[{'version': 'v1', 'created': 'Mon, 11 Dec 2017 20:32:01 GMT'}]",2017-12-13,"[['Mukherjee', 'Tathagata', ''], ['Veremyev', 'Alexander', ''], ['Kumar', 'Piyush', ''], ['Pasiliao', 'Eduardo', 'Jr']]","['Algorithms', 'Complexity', 'Theory', 'Graph Theory', 'IntegerProgramming', 'Greedy Algorithms']"
16728,1207.5055,Somantika Datta,Somantika Datta,Construction of zero autocorrelation stochastic waveforms,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stochastic waveforms are constructed whose expected autocorrelation can be
made arbitrarily small outside the origin. These waveforms are unimodular and
complex-valued. Waveforms with such spike like autocorrelation are desirable in
waveform design and are particularly useful in areas of radar and
communications. Both discrete and continuous waveforms with low expected
autocorrelation are constructed. Further, in the discrete case, frames for the
d-dimensional complex space are constructed from these waveforms and the frame
properties of such frames are studied.
","[{'version': 'v1', 'created': 'Fri, 20 Jul 2012 20:28:26 GMT'}]",2012-07-24,"[['Datta', 'Somantika', '']]","['Autocorrelation', 'Frames', 'Stochastic waveforms']"
16729,1111.1093,Sabu Thampi m,"Sabu M. Thampi, Ann Jisma Jacob",Securing Biometric Images using Reversible Watermarking,"8 pages, 7 figures","International Journal of Image Processing (IJIP), Volume:
  5,Issue:4, September/October 2011",,,cs.CV cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Biometric security is a fast growing area. Protecting biometric data is very
important since it can be misused by attackers. In order to increase security
of biometric data there are different methods in which watermarking is widely
accepted. A more acceptable, new important development in this area is
reversible watermarking in which the original image can be completely restored
and the watermark can be retrieved. But reversible watermarking in biometrics
is an understudied area. Reversible watermarking maintains high quality of
biometric data. This paper proposes Rotational Replacement of LSB as a
reversible watermarking scheme for biometric images. PSNR is the regular method
used for quality measurement of biometric data. In this paper we also show that
SSIM Index is a better alternate for effective quality assessment for
reversible watermarked biometric data by comparing with the well known
reversible watermarking scheme using Difference Expansion.
","[{'version': 'v1', 'created': 'Fri, 4 Nov 2011 10:50:45 GMT'}]",2011-11-07,"[['Thampi', 'Sabu M.', ''], ['Jacob', 'Ann Jisma', '']]","['Biometric', 'reversible watermarking', 'Difference Expansion', 'SSIM Index', 'Image Processing']"
16730,1203.0550,Afshin Rostamizadeh,"Corinna Cortes, Mehryar Mohri, Afshin Rostamizadeh",Algorithms for Learning Kernels Based on Centered Alignment,,Journal of Machine Learning Research 13 (2012) 795-828,,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents new and effective algorithms for learning kernels. In
particular, as shown by our empirical results, these algorithms consistently
outperform the so-called uniform combination solution that has proven to be
difficult to improve upon in the past, as well as other algorithms for learning
kernels based on convex combinations of base kernels in both classification and
regression. Our algorithms are based on the notion of centered alignment which
is used as a similarity measure between kernels or kernel matrices. We present
a number of novel algorithmic, theoretical, and empirical results for learning
kernels based on our notion of centered alignment. In particular, we describe
efficient algorithms for learning a maximum alignment kernel by showing that
the problem can be reduced to a simple QP and discuss a one-stage algorithm for
learning both a kernel and a hypothesis based on that kernel using an
alignment-based regularization. Our theoretical results include a novel
concentration bound for centered alignment between kernel matrices, the proof
of the existence of effective predictors for kernels with high alignment, both
for classification and for regression, and the proof of stability-based
generalization bounds for a broad family of algorithms for learning kernels
based on centered alignment. We also report the results of experiments with our
centered alignment-based algorithms in both classification and regression.
","[{'version': 'v1', 'created': 'Fri, 2 Mar 2012 19:20:42 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Apr 2014 18:30:21 GMT'}]",2014-04-09,"[['Cortes', 'Corinna', ''], ['Mohri', 'Mehryar', ''], ['Rostamizadeh', 'Afshin', '']]","['kernel methods', 'learning kernels', 'feature selection']"
16731,1409.3767,Hanumanthappa J Dr,"J. Hanumanthappa, H. Annaiah",DW&C:Dollops Wise Curtail IPv4/IPv6 Transition Mechanism using NS2,"9 pages, International Journal of Engineering Trends and
  Technology(IJETT),2014",,,,cs.NI cs.PF,http://creativecommons.org/licenses/by/3.0/,"  BD-SIIT and DSTM are widely deployed IPv4/IPv6 Transition mechanism to
improve the performance of the computer network in terms of Throughput,End to
End Delay(EED) and Packet Drop Rate(PDR).In this journal paper we have
Implemented and Compared the Performance Issues of our newly proposed Dollops
Wise Curtail(DW&C)IPv4/IPv6 Migration Mechanism with BD-SIIT and DSTM in NS2.
Implementation and Comparison Performance Analysis between Dollops Wise
Curtail,BD-SIIT and DSTM shows that Dollops Wise Curtail IPv4/IPv6 migration
algorithm performance outperforms than BD-SIIT and DSTM.Based on extensive
simulations,we show that DW&C algorithm reduces the Packet Drop Rate(PDR),End
to End Delay(EED) and achieves better Throughput than BD-SIIT and DSTM.In our
research work observation,the performance metrics such as Throughput,EED and
PLR for DW&C,BD-SIIT and DSTM are measured using TCP,UDP,FTP and CBR Traffics
","[{'version': 'v1', 'created': 'Thu, 11 Sep 2014 08:26:23 GMT'}]",2014-09-15,"[['Hanumanthappa', 'J.', ''], ['Annaiah', 'H.', '']]","['BD-SIIT', 'DSTM', 'DW&C etc']"
16732,1610.10048,Arulkumar Subramaniam,"Arulkumar Subramaniam, Vismay Patel, Ashish Mishra, Prashanth
  Balasubramanian, Anurag Mittal","Bi-modal First Impressions Recognition using Temporally Ordered Deep
  Audio and Stochastic Visual Features","to be published in: ECCV 2016 Workshops proceedings (Apparent
  Personality Analysis)",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel approach for First Impressions Recognition in terms of the
Big Five personality-traits from short videos. The Big Five personality traits
is a model to describe human personality using five broad categories:
Extraversion, Agreeableness, Conscientiousness, Neuroticism and Openness. We
train two bi-modal end-to-end deep neural network architectures using
temporally ordered audio and novel stochastic visual features from few frames,
without over-fitting. We empirically show that the trained models perform
exceptionally well, even after training from a small sub-portions of inputs.
Our method is evaluated in ChaLearn LAP 2016 Apparent Personality Analysis
(APA) competition using ChaLearn LAP APA2016 dataset and achieved excellent
performance.
","[{'version': 'v1', 'created': 'Mon, 31 Oct 2016 18:21:13 GMT'}]",2016-11-01,"[['Subramaniam', 'Arulkumar', ''], ['Patel', 'Vismay', ''], ['Mishra', 'Ashish', ''], ['Balasubramanian', 'Prashanth', ''], ['Mittal', 'Anurag', '']]","['Deep Learning', 'Bi-modal Neural Networks', 'First Impressions Analysis', 'Apparent Personality Analysis']"
16733,1606.08541,Lu Lu,"Lu Lu, Haiquan Zhao","A Class of Diffusion Algorithms with Logarithmic Cost over Adaptive
  Sparse Volterra Network",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this Letter, we present a novel class of diffusion algorithms that can be
used to estimate the coefficients of sparse Volterra network (SVN). The
development of the algorithms is based on the logarithmic cost and l0-norm
constraint. Simulations for Gaussian and impulsive scenarios are conducted to
demonstrate the superior performance of the proposed algorithms as compared
with the existing algorithms.
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2016 02:41:10 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jun 2016 00:38:12 GMT'}, {'version': 'v3', 'created': 'Fri, 17 Mar 2017 02:22:21 GMT'}, {'version': 'v4', 'created': 'Fri, 28 Apr 2017 19:07:15 GMT'}, {'version': 'v5', 'created': 'Tue, 2 May 2017 00:28:40 GMT'}]",2017-05-03,"[['Lu', 'Lu', ''], ['Zhao', 'Haiquan', '']]","['Distributed adaptation', 'Volterra filter', 'Sparse', 'Logarithmic cost']"
16734,1412.4322,Mostafa Zaman Chowdhury,"Mostafa Zaman Chowdhury, Yeong Min Jang, and Zygmunt J. Haas","Priority based Bandwidth Adaptation for Multi-class Traffic in Wireless
  Networks",,"International Journal of Multimedia and Ubiquitous Engineering,
  vol. 7, no. 2, pp. 445-450, April, 2012",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The bandwidth adaptation is the technique that allows the flexibility in
bandwidth allocation for a call. Using the bandwidth adaptation technique, the
number of call admission in the system can be increased significantly. In this
paper we propose a priority based bandwidth adaptation scheme that can release
multi-level of bandwidth from the existing calls to accept call requests. The
amount of released bandwidth is based on the number of existing bandwidth
adaptive calls and the priority of requesting traffic call. This priority
scheme does not reduce the bandwidth utilization. Moreover, the proposed
bandwidth adaptation strategy provides significantly reduced call blocking
probability for the higher priority traffic calls. The performance analyses
show the improvement of the proposed scheme.
","[{'version': 'v1', 'created': 'Sun, 14 Dec 2014 06:32:22 GMT'}]",2014-12-16,"[['Chowdhury', 'Mostafa Zaman', ''], ['Jang', 'Yeong Min', ''], ['Haas', 'Zygmunt J.', '']]","['Priority traffic', 'multi-level bandwidth adaptation', 'traffic class', 'call blocking']"
16735,1412.6150,Deepika Dua,"Deepika Dua, Atul Mishra","Selective Watchdog Technique for Intrusion Detection in Mobile Ad-Hoc
  Network","12 pages,8 figures","International Journal on Applications of Graph Theory in Wireless
  Ad hoc Networks and Sensor Networks (GRAPH-HOC) Vol.6, No.3, September 2014",,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile ad-hoc networks(MANET) is the collection of mobile nodes which are
self organizing and are connected by wireless links where nodes which are not
in the direct range communicate with each other relying on the intermediate
nodes. As a result of trusting other nodes in the route, a malicious node can
easily compromise the security of the network. A black-hole node is the
malicious node which drops the entire packet coming to it and always shows the
fresh route to the destination, even if the route to destination doesn't exist.
This paper describes a scheme that will detect the intrusion in the network in
the presence of black-hole node and its performance is compared with the
previous technique. This novel technique helps to increase the network
performance by reducing the overhead in the network.
","[{'version': 'v1', 'created': 'Mon, 13 Oct 2014 17:14:12 GMT'}]",2014-12-22,"[['Dua', 'Deepika', ''], ['Mishra', 'Atul', '']]","['MANET', 'Intrusion', 'Intrusion Detection System', 'Attacks']"
16736,1108.5619,Sivakumar Madesan,Karanjit Singh and Shuchita Bhasin,Modification of GTD from Flat File Format to OLAP for Data Mining,"GTD, OLAP, Data Mining, Terror Databases",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This document is part of original research work by the authors in a bid to
explore new fields for applying Data Mining Techniques. The sample data is part
of a large data set from University of Maryland (UMD) and outlines how more
meaningful patterns can be discovered by preprocessing the data in the form of
OLAP cubes.
","[{'version': 'v1', 'created': 'Fri, 26 Aug 2011 07:06:03 GMT'}]",2011-08-30,"[['Singh', 'Karanjit', ''], ['Bhasin', 'Shuchita', '']]","['GTD', 'OLAP', 'Data Mining', 'Terror Databases']"
16737,1403.7802,Arvind Merwaday,"Arvind Merwaday, Sayandev Mukherjee, and Ismail Guvenc","Capacity Analysis of LTE-Advanced HetNets with Reduced Power Subframes
  and Range Expansion","Submitted to EURASIP Journal on Wireless Communications and
  Networking (JWCN)",,,,cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The time domain inter-cell interference coordination techniques specified in
LTE Rel. 10 standard improves the throughput of picocell-edge users by
protecting them from macrocell interference. On the other hand, it also
degrades the aggregate capacity in macrocell because the macro base station
(MBS) does not transmit data during certain subframes known as almost blank
subframes. The MBS data transmission using reduced power subframes was
standardized in LTE Rel. 11, which can improve the capacity in macrocell while
not causing high interference to the nearby picocells. In order to get maximum
benefit from the reduced power subframes, setting the key system parameters,
such as the amount of power reduction, carries critical importance. Using
stochastic geometry, this paper lays down a theoretical foundation for the
performance evaluation of heterogeneous networks with reduced power subframes
and range expansion bias. The analytic expressions for average capacity and 5th
percentile throughput are derived as a function of transmit powers, node
densities, and interference coordination parameters in a heterogeneous network
scenario, and are validated through Monte Carlo simulations. Joint optimization
of range expansion bias, power reduction factor, scheduling thresholds, and
duty cycle of reduced power subframes are performed to study the trade-offs
between aggregate capacity of a cell and fairness among the users. To validate
our analysis, we also compare the stochastic geometry based theoretical results
with the real MBS deployment (in the city of London) and the hexagonal-grid
model. Our analysis shows that with optimum parameter settings, the LTE Rel. 11
with reduced power subframes can provide substantially better performance than
the LTE Rel. 10 with almost blank subframes, in terms of both aggregate
capacity and fairness.
","[{'version': 'v1', 'created': 'Sun, 30 Mar 2014 19:26:45 GMT'}]",2014-04-01,"[['Merwaday', 'Arvind', ''], ['Mukherjee', 'Sayandev', ''], ['Guvenc', 'Ismail', '']]","['fairness', 'FeICIC', 'HetNets', 'LTE-Advanced', 'performance analysis', 'Poisson point']"
16738,1206.2544,Shah Mahmood Mr.,Shah Mahmood and Ismatullah Nazar,Education in Conflict Zones: a Web and Mobility Approach,,,,,cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new framework for education in conflict zones, considering the
explosive growth of social media, web services, and mobile Internet over the
past decade. Moreover, we focus on one conflict zone, Afghanistan, as a case
study, because of its alarmingly high illiteracy rate, lack of qualified
teachers, rough terrain, and relatively high mobile penetration of over 50%. In
several of Afghanistan's provinces, it is hard to currently sustain the
traditional bricks-and-mortar school model, due to numerous incidents of
schools, teachers, and students being attacked because of the ongoing
insurgency and political instability. Our model improves the virtual school
model, by addressing most of its disadvantages, to provide students in
Afghanistan with an opportunity to achieve standardised education, even when
the security situation does not allow them to attend traditional schools. One
of the biggest advantages of this model is that it is sufficiently robust to
deal with gender discrimination, imposed by culture or politics of the region.
","[{'version': 'v1', 'created': 'Tue, 12 Jun 2012 14:32:55 GMT'}]",2012-06-13,"[['Mahmood', 'Shah', ''], ['Nazar', 'Ismatullah', '']]","['Education', 'Conflict Zone', 'Social Network', 'Mobile Internet', 'Afghanistan']"
16739,1207.4247,Mohammad  Nabil Almunawar Dr,Mohammad Nabil Almunawar,Acquiring IT Solutions through Open Source Software,"15 pages, conference paper",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Open source software is free software that provides user freedom to use,
replicate, modify, and distribute for any purpose. The quality of well-known
open source software is very high and they are used by big companies such as
IBM, Google and Amazon.com. Recently the number of open source software project
growing very fast, which indicates that adoption of open source software is
growing although still limited. Businesses should consider open source software
as alternative solutions to their business problems or opportunities. An
example of a very good open source software for office suite is discussed and
compared with the well-known proprietary counterpart.
","[{'version': 'v1', 'created': 'Wed, 18 Jul 2012 01:44:32 GMT'}]",2012-07-19,"[['Almunawar', 'Mohammad Nabil', '']]","['open source software', 'software quality', 'OpenOffice', 'software acquisition']"
16740,1504.04716,Vishal Shukla,Vishal Shukla,"Gap Analysis of Natural Language Processing Systems with respect to
  Linguistic Modality",,,,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modality is one of the important components of grammar in linguistics. It
lets speaker to express attitude towards, or give assessment or potentiality of
state of affairs. It implies different senses and thus has different
perceptions as per the context. This paper presents an account showing the gap
in the functionality of the current state of art Natural Language Processing
(NLP) systems. The contextual nature of linguistic modality is studied. In this
paper, the works and logical approaches employed by Natural Language Processing
systems dealing with modality are reviewed. It sees human cognition and
intelligence as multi-layered approach that can be implemented by intelligent
systems for learning. Lastly, current flow of research going on within this
field is talked providing futurology.
","[{'version': 'v1', 'created': 'Sat, 18 Apr 2015 13:28:59 GMT'}]",2015-04-21,"[['Shukla', 'Vishal', '']]","['modality', 'NLP', 'gap', 'shortcomings', 'multi-layered', 'learning']"
16741,1510.04194,Dmytro Terletskyi,"Dmytro Terletskyi, Alexandr Provotar",Object-Oriented Dynamic Networks,arXiv admin note: text overlap with arXiv:1510.04183,"International Book Series Information Science and Computing, Book
  30 Computational Models for Business and Engineering Domains, ITHEA, 2014,
  pp. 123-136",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper contains description of such knowledge representation model as
Object-Oriented Dynamic Network (OODN), which gives us an opportunity to
represent knowledge, which can be modified in time, to build new relations
between objects and classes of objects and to represent results of their
modifications. The model is based on representation of objects via their
properties and methods. It gives us a possibility to classify the objects and,
in a sense, to build hierarchy of their types. Furthermore, it enables to
represent relation of modification between concepts, to build new classes of
objects based on existing classes and to create sets and multisets of concepts.
OODN can be represented as a connected and directed graph, where nodes are
concepts and edges are relations between them. Using such model of knowledge
representation, we can consider modifications of knowledge and movement through
the graph of network as a process of logical reasoning or finding the right
solutions or creativity, etc. The proposed approach gives us an opportunity to
model some aspects of human knowledge system and main mechanisms of human
thought, in particular getting a new experience and knowledge.
","[{'version': 'v1', 'created': 'Wed, 14 Oct 2015 16:39:30 GMT'}]",2015-10-15,"[['Terletskyi', 'Dmytro', ''], ['Provotar', 'Alexandr', '']]","['class of objects', 'inhomogeneous class of objects', 'sets of objects']"
16742,1206.3522,Dirk Sudholt,"J\""org L\""assig and Dirk Sudholt","General Upper Bounds on the Running Time of Parallel Evolutionary
  Algorithms",,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new method for analyzing the running time of parallel
evolutionary algorithms with spatially structured populations. Based on the
fitness-level method, it yields upper bounds on the expected parallel running
time. This allows to rigorously estimate the speedup gained by parallelization.
Tailored results are given for common migration topologies: ring graphs, torus
graphs, hypercubes, and the complete graph. Example applications for
pseudo-Boolean optimization show that our method is easy to apply and that it
gives powerful results. In our examples the possible speedup increases with the
density of the topology. Surprisingly, even sparse topologies like ring graphs
lead to a significant speedup for many functions while not increasing the total
number of function evaluations by more than a constant factor. We also identify
which number of processors yield asymptotically optimal speedups, thus giving
hints on how to parametrize parallel evolutionary algorithms.
","[{'version': 'v1', 'created': 'Fri, 15 Jun 2012 17:28:51 GMT'}]",2012-06-18,"[['Lässig', 'Jörg', ''], ['Sudholt', 'Dirk', '']]","['Parallel evolutionary algorithms', 'runtime analysis', 'island model', 'spatial structures']"
16743,1403.2031,Asha V,"V.Asha, N.U.Bhajantri, P.Nagabhushan",Texture Defect Detection in Gradient Space,"4 pages, ICFoCS-2011",,,ICFoCS-2011,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a machine vision algorithm for automatically
detecting defects in patterned textures with the help of gradient space and its
energy. Experiments on real fabric images with defects show that the proposed
method can be used for automatic detection of fabric defects in textile
industries.
","[{'version': 'v1', 'created': 'Sun, 9 Mar 2014 06:53:13 GMT'}]",2014-03-11,"[['Asha', 'V.', ''], ['Bhajantri', 'N. U.', ''], ['Nagabhushan', 'P.', '']]","['cluster', 'defect', 'energy', 'gradient space', 'periodicity']"
16744,0904.0058,Damien Chablat,"Damien Chablat (IRCCyN), Stefan Staicu",Kinematics of A 3-PRP planar parallel robot,,"UPB Scientific Bulletin, Series D: Mechanical Engineering 71, 1
  (2009) 3-16",,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recursive modelling for the kinematics of a 3-PRP planar parallel robot is
presented in this paper. Three planar chains connecting to the moving platform
of the manipulator are located in a vertical plane. Knowing the motion of the
platform, we develop the inverse kinematics and determine the positions,
velocities and accelerations of the robot. Several matrix equations offer
iterative expressions and graphs for the displacements, velocities and
accelerations of three prismatic actuators.
","[{'version': 'v1', 'created': 'Wed, 1 Apr 2009 19:31:33 GMT'}]",2009-04-02,"[['Chablat', 'Damien', '', 'IRCCyN'], ['Staicu', 'Stefan', '']]","['kinematics', 'planar parallel robot', 'singularity']"
16745,1607.02096,Christos Giatsidis,"Christos Giatsidis, Fragkiskos D. Malliaros, Nikolaos Tziortziotis,
  Charanpal Dhanjal, Emmanouil Kiagias, Dimitrios M. Thilikos, Michalis
  Vazirgiannis",A k-core Decomposition Framework for Graph Clustering,,,,,cs.SI cs.DS,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Graph clustering or community detection constitutes an important task for
investigating the internal structure of graphs, with a plethora of applications
in several domains. Traditional techniques for graph clustering, such as
spectral methods, typically suffer from high time and space complexity. In this
article, we present CoreCluster, an efficient graph clustering framework based
on the concept of graph degeneracy, that can be used along with any known graph
clustering algorithm. Our approach capitalizes on processing the graph in an
hierarchical manner provided by its core expansion sequence, an ordered
partition of the graph into different levels according to the k-core
decomposition. Such a partition provides an efficient way to process the graph
in an incremental manner that preserves its clustering structure, while making
the execution of the chosen clustering algorithm much faster due to the smaller
size of the graph's partitions onto which the algorithm operates. An
experimental analysis on a multitude of real and synthetic data demonstrates
that our approach can be applied to any clustering algorithm accelerating the
clustering process, while the quality of the clustering structure is preserved
or even improved.
","[{'version': 'v1', 'created': 'Thu, 7 Jul 2016 17:31:18 GMT'}]",2016-07-08,"[['Giatsidis', 'Christos', ''], ['Malliaros', 'Fragkiskos D.', ''], ['Tziortziotis', 'Nikolaos', ''], ['Dhanjal', 'Charanpal', ''], ['Kiagias', 'Emmanouil', ''], ['Thilikos', 'Dimitrios M.', ''], ['Vazirgiannis', 'Michalis', '']]","['Graph clustering', 'community detection', 'k-core decomposition', 'graph degeneracy', 'graph mining']"
16746,1304.3405,Amit Sharma,"Amit Sharma, Dan Cosley","Do Social Explanations Work? Studying and Modeling the Effects of Social
  Explanations in Recommender Systems","11 pages, WWW 2013",,,,cs.SI cs.IR physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender systems associated with social networks often use social
explanations (e.g. ""X, Y and 2 friends like this"") to support the
recommendations. We present a study of the effects of these social explanations
in a music recommendation context. We start with an experiment with 237 users,
in which we show explanations with varying levels of social information and
analyze their effect on users' decisions. We distinguish between two key
decisions: the likelihood of checking out the recommended artist, and the
actual rating of the artist based on listening to several songs. We find that
while the explanations do have some influence on the likelihood, there is
little correlation between the likelihood and actual (listening) rating for the
same artist. Based on these insights, we present a generative probabilistic
model that explains the interplay between explanations and background
information on music preferences, and how that leads to a final likelihood
rating for an artist. Acknowledging the impact of explanations, we discuss a
general recommendation framework that models external informational elements in
the recommendation interface, in addition to inherent preferences of users.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2013 19:31:39 GMT'}]",2013-04-18,"[['Sharma', 'Amit', ''], ['Cosley', 'Dan', '']]","['recommender systems', 'social explanation', 'influence']"
16747,1509.09211,Jarek Duda dr,Jarek Duda,"Normalized rotation shape descriptors and lossy compression of molecular
  shape","10 pages, 10 figures",,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a common need to search of molecular databases for compounds
resembling some shape, what suggests having similar biological activity while
searching for new drugs. The large size of the databases requires fast methods
for such initial screening, for example based on feature vectors constructed to
fulfill the requirement that similar molecules should correspond to close
vectors. Ultrafast Shape Recognition (USR) is a popular approach of this type.
It uses vectors of 12 real number as 3 first moments of distances from 4
emphasized points. These coordinates might contain unnecessary correlations and
does not allow to reconstruct the approximated shape. In contrast, spherical
harmonic (SH) decomposition uses orthogonal coordinates, suggesting their
independence and so lager informational content of the feature vector. There is
usually considered rotationally invariant SH descriptors, what means discarding
of some essential information.
  This article discusses framework for descriptors with normalized rotation,
for example by using principal component analysis (PCA-SH). As one of the most
interesting are ligands which have to slide into a protein, we will introduce
descriptors optimized for such flat elongated shapes. Bent deformed cylinder
(BDC) describes the molecule as a cylinder which was first bent, then deformed
such that its cross-sections became ellipses of evolving shape. Legendre
polynomials are used to describe the central axis of such bent cylinder.
Additional polynomials are used to define evolution of such elliptic
cross-section along the main axis. There will be also discussed bent
cylindrical harmonics (BCH), which uses cross-sections described by cylindrical
harmonics instead of ellipses. All these normalized rotation descriptors allow
to reconstruct (decode) the approximated representation of the shape, hence can
be also used for lossy compression purposes.
","[{'version': 'v1', 'created': 'Wed, 30 Sep 2015 15:11:33 GMT'}]",2015-10-01,"[['Duda', 'Jarek', '']]","['shape descriptors', 'molecular fingerprints', 'spherical harmonics', 'virtual screening', 'lossy compression']"
16748,1511.04628,Luis Sentis,"Ye Zhao, Benito R. Fernandez, and Luis Sentis",A Framework for Planning and Controlling Non-Periodic Bipedal Locomotion,"33 pages, 18 figures, journal",,,,cs.RO cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study presents a theoretical framework for planning and controlling
agile bipedal locomotion based on robustly tracking a set of non-periodic apex
states. Based on the prismatic inverted pendulum model, we formulate a hybrid
phase-space planning and control framework which includes the following key
components: (1) a step transition solver that enables dynamically tracking
non-periodic apex or keyframe states over various types of terrains, (2) a
robust hybrid automaton to effectively formulate planning and control
algorithms, (3) a phase-space metric to measure distance to the planned
locomotion manifolds, and (4) a hybrid control method based on the previous
distance metric to produce robust dynamic locomotion under external
disturbances. Compared to other locomotion frameworks, we have a larger focus
on non-periodic gait generation and robustness metrics to deal with
disturbances. Such focus enables the proposed control framework to robustly
track non-periodic apex states over various challenging terrains and under
external disturbances as illustrated through several simulations. Additionally,
it allows a bipedal robot to perform non-periodic bouncing maneuvers over
disjointed terrains.
","[{'version': 'v1', 'created': 'Sat, 14 Nov 2015 22:12:13 GMT'}]",2015-11-17,"[['Zhao', 'Ye', ''], ['Fernandez', 'Benito R.', ''], ['Sentis', 'Luis', '']]","['Phase-Space Locomotion Planning', 'Non-Periodic Apex Stability', 'Robust Hybrid Automaton', 'Optimal Control']"
16749,1702.01886,Sara Bernardini,"Sara Bernardini, Fabio Fagnani, David E. Smith","Extracting Lifted Mutual Exclusion Invariants from Temporal Planning
  Domains",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a technique for automatically extracting mutual exclusion
invariants from temporal planning instances. It first identifies a set of
invariant templates by inspecting the lifted representation of the domain and
then checks these templates against properties that assure invariance. Our
technique builds on other approaches to invariant synthesis presented in the
literature, but departs from their limited focus on instantaneous actions by
addressing temporal domains. To deal with time, we formulate invariance
conditions that account for the entire structure of the actions and the
possible concurrent interactions between them. As a result, we construct a
significantly more comprehensive technique than previous methods, which is able
to find not only invariants for temporal domains, but also a broader set of
invariants for non-temporal domains. The experimental results reported in this
paper provide evidence that identifying a broader set of invariants results in
the generation of fewer multi-valued state variables with larger domains. We
show that, in turn, this reduction in the number of variables reflects
positively on the performance of a number of temporal planners that use a
variable/value representation by significantly reducing their running time.
","[{'version': 'v1', 'created': 'Tue, 7 Feb 2017 06:02:50 GMT'}]",2017-02-08,"[['Bernardini', 'Sara', ''], ['Fagnani', 'Fabio', ''], ['Smith', 'David E.', '']]","['Automated Planning', 'Temporal Planning', 'Mutual Exclusion Invariants', 'AutomaticDomain Analysis']"
16750,0907.3202,Yong-Hyuk Kim,"Yourim Yoon, Yong-Hyuk Kim, Alberto Moraglio, and Byung-Ro Moon","Mathematical Interpretation between Genotype and Phenotype Spaces and
  Induced Geometric Crossovers","21 pages, 3 figures",,,,cs.NE cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present that genotype-phenotype mapping can be
theoretically interpreted using the concept of quotient space in mathematics.
Quotient space can be considered as mathematically-defined phenotype space in
the evolutionary computation theory. The quotient geometric crossover has the
effect of reducing the search space actually searched by geometric crossover,
and it introduces problem knowledge in the search by using a distance better
tailored to the specific solution interpretation. Quotient geometric crossovers
are directly applied to the genotype space but they have the effect of the
crossovers performed on phenotype space. We give many example applications of
the quotient geometric crossover.
","[{'version': 'v1', 'created': 'Sat, 18 Jul 2009 10:31:07 GMT'}]",2009-07-21,"[['Yoon', 'Yourim', ''], ['Kim', 'Yong-Hyuk', ''], ['Moraglio', 'Alberto', ''], ['Moon', 'Byung-Ro', '']]","['Geometric crossover', 'genotype-phenotype mapping', 'quotient metric space', 'quotient geometric crossover']"
16751,1606.06172,"Torsten M\""utze","Torsten M\""utze, Jerri Nummenpalo",A constant-time algorithm for middle levels Gray codes,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For any integer $n\geq 1$ a middle levels Gray code is a cyclic listing of
all $n$-element and $(n+1)$-element subsets of $\{1,2,\ldots,2n+1\}$ such that
any two consecutive subsets differ in adding or removing a single element. The
question whether such a Gray code exists for any $n\geq 1$ has been the subject
of intensive research during the last 30 years, and has been answered
affirmatively only recently [T. M\""utze. Proof of the middle levels conjecture.
Proc. London Math. Soc., 112(4):677--713, 2016]. In a follow-up paper [T.
M\""utze and J. Nummenpalo. An efficient algorithm for computing a middle levels
Gray code. To appear in ACM Transactions on Algorithms, 2018] this existence
proof was turned into an algorithm that computes each new set in the Gray code
in time $\mathcal{O}(n)$ on average. In this work we present an algorithm for
computing a middle levels Gray code in optimal time and space: each new set is
generated in time $\mathcal{O}(1)$ on average, and the required space is
$\mathcal{O}(n)$.
","[{'version': 'v1', 'created': 'Mon, 20 Jun 2016 15:11:16 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Jul 2016 15:22:11 GMT'}, {'version': 'v3', 'created': 'Sun, 16 Oct 2016 07:07:39 GMT'}, {'version': 'v4', 'created': 'Tue, 20 Jun 2017 07:03:40 GMT'}, {'version': 'v5', 'created': 'Mon, 12 Mar 2018 20:09:25 GMT'}, {'version': 'v6', 'created': 'Mon, 5 Aug 2019 13:12:04 GMT'}]",2019-08-06,"[['Mütze', 'Torsten', ''], ['Nummenpalo', 'Jerri', '']]","['Middle levels conjecture', 'Gray code', 'Hamilton cycle']"
16752,0908.1223,Rajesh Ramachandran,R Rajesh and Vinod Sharma,"Joint Source-Channel Coding over a Fading Multiple Access Channel with
  Partial Channel State Information","7 Pages, 3 figures. To Appear in IEEE GLOBECOM, 2009",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we address the problem of transmission of correlated sources
over a fast fading multiple access channel (MAC) with partial channel state
information available at both the encoders and the decoder. We provide
sufficient conditions for transmission with given distortions. Next these
conditions are specialized to a Gaussian MAC (GMAC). We provide the optimal
power allocation strategy and compare the strategy with various levels of
channel state information.
  Keywords: Fading MAC, Power allocation, Partial channel state information,
Correlated sources.
","[{'version': 'v1', 'created': 'Sun, 9 Aug 2009 10:40:59 GMT'}]",2009-08-11,"[['Rajesh', 'R', ''], ['Sharma', 'Vinod', '']]","['Fading MAC', 'Power allocation', 'Partial channel stateinformation', 'Correlated sources']"
16753,1111.3996,Jakub Kovac,Jakub Kov\'a\v{c},Complexity of the path avoiding forbidden pairs problem revisited,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let G = (V, E) be a directed acyclic graph with two distinguished vertices s,
t and let F be a set of forbidden pairs of vertices. We say that a path in G is
safe, if it contains at most one vertex from each pair {u, v} in F. Given G and
F, the path avoiding forbidden pairs (PAFP) problem is to find a safe s-t path
in G. We systematically study the complexity of different special cases of the
PAFP problem defined according to the mutual positions of forbidden pairs. Fix
one topological ordering of vertices; we say that pairs {u, v} and {x, y} are
disjoint, if u, v < x, y, nested, if u < x, y < v, and halving, if u < x < v <
y. The PAFP problem is known to be NP-hard in general or if no two pairs are
disjoint; we prove that it remains NP-hard even when no two forbidden pairs are
nested. On the other hand, if no two pairs are halving, the problem is known to
be solvable in cubic time. We simplify and improve this result by showing an
O(M(n)) time algorithm, where M(n) is the time to multiply two n \times n
boolean matrices.
","[{'version': 'v1', 'created': 'Thu, 17 Nov 2011 01:04:15 GMT'}, {'version': 'v2', 'created': 'Sun, 25 Dec 2011 11:27:53 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Jan 2013 13:19:09 GMT'}]",2015-03-19,"[['Kováč', 'Jakub', '']]","['path', 'forbidden pair', 'NP-hard', 'dynamic programming']"
16754,1610.03957,Sourish Ghosh,"Sourish Ghosh, Aaditya Sanjay Boob, Nishant Nikhil, Nayan Raju
  Vysyaraju, Ankit Kumar",A Fuzzy Logic System to Analyze a Student's Lifestyle,To appear at ICACI 2017,,,,cs.CY cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A college student's life can be primarily categorized into domains such as
education, health, social and other activities which may include daily chores
and travelling time. Time management is crucial for every student. A self
realisation of one's daily time expenditure in various domains is therefore
essential to maximize one's effective output. This paper presents how a mobile
application using Fuzzy Logic and Global Positioning System (GPS) analyzes a
student's lifestyle and provides recommendations and suggestions based on the
results.
","[{'version': 'v1', 'created': 'Thu, 13 Oct 2016 07:14:34 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Nov 2016 17:06:34 GMT'}]",2016-11-09,"[['Ghosh', 'Sourish', ''], ['Boob', 'Aaditya Sanjay', ''], ['Nikhil', 'Nishant', ''], ['Vysyaraju', 'Nayan Raju', ''], ['Kumar', 'Ankit', '']]","['Fuzzy Logic', 'GPS', 'Android Application']"
16755,0805.0865,EDA Publishing Association,"Z. Szucs, G. Bognar, Vladimir Szekely, M. Rencz",Contactless Thermal Characterization of High Temperature Test Chamber,"Submitted on behalf of EDA Publishing Association
  (http://irevues.inist.fr/handle/2042/16838)","Dans Symposium on Design, Test, Integration and Packaging of
  MEMS/MOEMS - DTIP 2008, Nice : France (2008)",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper the methodology and the results of a contactless thermal
characterization of a high temperature test chamber will be introduced. The
test chamber is used for fatigue testing of different MEMS devices where the
homogenous temperature distribution within the close proximity from the heating
filaments is very important. Our aim was to characterize the evolving
temperature distribution inside the test chamber. In order to achieve smaller
time constant a new contactless sensor card was developed. The contactless
thermal characterization method introduced in this paper enables in situ heat
distribution measurement inside the test chamber during operation, with the
detection of potentially uneven heat distribution.
","[{'version': 'v1', 'created': 'Wed, 7 May 2008 08:48:35 GMT'}]",2008-12-18,"[['Szucs', 'Z.', ''], ['Bognar', 'G.', ''], ['Szekely', 'Vladimir', ''], ['Rencz', 'M.', '']]","['High temperature test chamber', 'IR sensor', 'infrared radiation', 'temperature mapping']"
16756,1702.03062,Hatef Monajemi Dr.,Hatef Monajemi and David L. Donoho,"Sparsity/Undersampling Tradeoffs in Anisotropic Undersampling, with
  Applications in MR Imaging/Spectroscopy",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study anisotropic undersampling schemes like those used in
multi-dimensional NMR spectroscopy and MR imaging, which sample exhaustively in
certain time dimensions and randomly in others.
  Our analysis shows that anisotropic undersampling schemes are equivalent to
certain block-diagonal measurement systems. We develop novel exact formulas for
the sparsity/undersampling tradeoffs in such measurement systems. Our formulas
predict finite-N phase transition behavior differing substantially from the
well known asymptotic phase transitions for classical Gaussian undersampling.
Extensive empirical work shows that our formulas accurately describe observed
finite-N behavior, while the usual formulas based on universality are
substantially inaccurate.
  We also vary the anisotropy, keeping the total number of samples fixed, and
for each variation we determine the precise sparsity/undersampling tradeoff
(phase transition). We show that, other things being equal, the ability to
recover a sparse object decreases with an increasing number of
exhaustively-sampled dimensions.
","[{'version': 'v1', 'created': 'Fri, 10 Feb 2017 04:22:26 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Mar 2017 20:29:22 GMT'}, {'version': 'v3', 'created': 'Fri, 16 Mar 2018 18:41:39 GMT'}]",2018-03-20,"[['Monajemi', 'Hatef', ''], ['Donoho', 'David L.', '']]","['Sparse Recovery', 'Compressed Sensing', 'Block Diagonal Measurement Matrix']"
16757,1110.0124,Kyatsandra Nagananda,"K. G. Nagananda, Chandra R. Murthy and Shalinee Kishore",Capacity Bounds for State-Dependent Broadcast Channels,"27 pages, 3 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we derive information-theoretic performance limits for three
classes of two-user state-dependent discrete memoryless broadcast channels,
with noncausal side-information at the encoder. The first class of channels
comprises a sender broadcasting two independent messages to two non-cooperating
receivers; for channels of the second class, each receiver is given the message
it need not decode; and the third class comprises channels where the sender is
constrained to keep each message confidential from the unintended receiver. We
derive inner bounds for all the three classes of channels. For the first and
second class of channels, we discuss the rate penalty on the achievable region
for having to deal with side-information. For channels of third class, we
characterize the rate penalties for having to deal not only with
side-information, but also to satisfy confidentiality constraints. We then
derive outer bounds, where we present an explicit characterization of sum-rate
bounds for the first and third class of channels. For channels of the second
class, we show that our outer bounds are within a fixed gap away from the
achievable rate region, where the gap is independent of the distribution
characterizing this class of channels. The channel models presented in this
paper are useful variants of the classical broadcast channel, and provide
fundamental building blocks for cellular downlink communications with
side-information, such as fading in the wireless medium, interference caused by
neighboring nodes in the network, {\etc}. at the encoder; two-way relay
communications; and secure wireless broadcasting.
","[{'version': 'v1', 'created': 'Sat, 1 Oct 2011 20:27:16 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Oct 2011 19:49:22 GMT'}, {'version': 'v3', 'created': 'Sun, 16 Oct 2011 19:57:21 GMT'}, {'version': 'v4', 'created': 'Sat, 22 Oct 2011 14:04:46 GMT'}, {'version': 'v5', 'created': 'Tue, 22 Nov 2011 13:59:06 GMT'}, {'version': 'v6', 'created': 'Mon, 16 Jul 2012 08:50:23 GMT'}]",2012-07-17,"[['Nagananda', 'K. G.', ''], ['Murthy', 'Chandra R.', ''], ['Kishore', 'Shalinee', '']]","['State-dependent broadcast channels', 'side-information', 'rate regions', 'outer bounds']"
16758,1610.02277,Carl Lundholm,"Christian Valdemar Hansen, Anders Logg, Carl Lundholm","Simulation of flow and view with applications in computational design of
  settlement layouts","Preprint submitted to Computers and Mathematics with Applications
  September 30, 2016",,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present methodology, algorithms and software for evaluating flow and view
for architectural settlement layouts. For a given settlement layout consisting
of a number of buildings arbitrarily positioned on a piece of land, in the
present study an island situated on the west coast of Sweden, the methodology
allows for evaluation of flow patterns and for evaluating the view experienced
from the buildings. The computation of flow is based on a multimesh finite
element method, which allows each building to be embedded in a boundary-fitted
mesh which can be moved around freely in a fixed background mesh. The
computation of view is based on a novel and objective measure of the view which
can be efficiently computed by rasterization.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2016 13:33:50 GMT'}]",2016-10-10,"[['Hansen', 'Christian Valdemar', ''], ['Logg', 'Anders', ''], ['Lundholm', 'Carl', '']]","['multi-mesh', 'cut finite element method', 'FEniCS', 'view computation', 'urbandesign', 'multi-objective optimization']"
16759,1409.6616,Bernhard Rumpe,Bernhard Rumpe,Agile Test-based Modeling,"6 pages, 3 figures, Proceedings of the 2006 International Conference
  on Software Engineering Research & Practice. SERP'2006. CSREA Press, USA,
  June 2006",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Model driven architecture (MDA) concentrates on the use of models during
software development. An approach using models as the central development
artifact is more abstract, more compact and thus more effective and probably
also less error prone. Although the ideas of MDA exist already for years, there
is still much to improve in the development process as well as the underlying
techniques and tools. Therefore, this paper is a follow up on, reexamining und
updating the statements made there. Here two major and strongly related
techniques are identified and discussed: Test case modeling and an evolutionary
approach to model transformation.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 17:08:05 GMT'}]",2014-09-24,"[['Rumpe', 'Bernhard', '']]","['Model-based programming', 'Model-based testing', 'Agile methods', 'Model evolution']"
16760,1009.3240,Hugh Brendan McMahan,H. Brendan McMahan,"A Unified View of Regularized Dual Averaging and Mirror Descent with
  Implicit Updates","Extensively updated version of earlier draft with new analysis
  including a general treatment of composite objectives and experiments. Also
  fixes a small bug in some of one of the proofs in the early version",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study three families of online convex optimization algorithms:
follow-the-proximally-regularized-leader (FTRL-Proximal), regularized dual
averaging (RDA), and composite-objective mirror descent. We first prove
equivalence theorems that show all of these algorithms are instantiations of a
general FTRL update. This provides theoretical insight on previous experimental
observations. In particular, even though the FOBOS composite mirror descent
algorithm handles L1 regularization explicitly, it has been observed that RDA
is even more effective at producing sparsity. Our results demonstrate that
FOBOS uses subgradient approximations to the L1 penalty from previous rounds,
leading to less sparsity than RDA, which handles the cumulative penalty in
closed form. The FTRL-Proximal algorithm can be seen as a hybrid of these two,
and outperforms both on a large, real-world dataset.
  Our second contribution is a unified analysis which produces regret bounds
that match (up to logarithmic terms) or improve the best previously known
bounds. This analysis also extends these algorithms in two important ways: we
support a more general type of composite objective and we analyze implicit
updates, which replace the subgradient approximation of the current loss
function with an exact optimization.
","[{'version': 'v1', 'created': 'Thu, 16 Sep 2010 18:40:32 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Sep 2011 18:38:13 GMT'}]",2011-09-21,"[['McMahan', 'H. Brendan', '']]","['online learning', 'online convex optimization', 'subgradient methods', 'regretbounds', 'follow-the-leader algorithms']"
16761,1606.06557,Marlin Frickenschmidt,"Michael Elberfeld, Marlin Frickenschmidt, Martin Grohe",Order Invariance on Decomposable Structures,Accepted for LICS 2016,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Order-invariant formulas access an ordering on a structure's universe, but
the model relation is independent of the used ordering. Order invariance is
frequently used for logic-based approaches in computer science. Order-invariant
formulas capture unordered problems of complexity classes and they model the
independence of the answer to a database query from low-level aspects of
databases. We study the expressive power of order-invariant monadic
second-order (MSO) and first-order (FO) logic on restricted classes of
structures that admit certain forms of tree decompositions (not necessarily of
bounded width).
  While order-invariant MSO is more expressive than MSO and, even, CMSO (MSO
with modulo-counting predicates), we show that order-invariant MSO and CMSO are
equally expressive on graphs of bounded tree width and on planar graphs. This
extends an earlier result for trees due to Courcelle. Moreover, we show that
all properties definable in order-invariant FO are also definable in MSO on
these classes. These results are applications of a theorem that shows how to
lift up definability results for order-invariant logics from the bags of a
graph's tree decomposition to the graph itself.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2016 13:23:26 GMT'}]",2016-06-22,"[['Elberfeld', 'Michael', ''], ['Frickenschmidt', 'Marlin', ''], ['Grohe', 'Martin', '']]","['finite model theory', 'first-order logic', 'monadic second-order logic', 'order-invariant logic', 'modulo-counting logic', 'bounded tree width', 'planarity']"
16762,1005.4216,William Jackson,Y.Babykalpana and K.ThanushKodi,"Classification of LULC Change Detection using Remotely Sensed Data for
  Coimbatore City, Tamilnadu, India",http://www.journalofcomputing.org,"Journal of Computing, Volume 2, Issue 5, May 2010",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Maps are used to describe far-off places . It is an aid for navigation and
military strategies. Mapping of the lands are important and the mapping work is
based on (i). Natural resource management & development (ii). Information
technology ,(iii). Environmental development ,(iv). Facility management and
(v). e-governance. The Landuse / Landcover system espoused by almost all
Organisations and scientists, engineers and remote sensing community who are
involved in mapping of earth surface features, is a system which is derived
from the united States Geological Survey (USGS) LULC classification system. The
application of RS and GIS involves influential of homogeneous zones, drift
analysis of land use integration of new area changes or change detection
etc.,National Remote Sensing Agency(NRSA) Govt. of India has devised a
generalized LULC classification system respect to the Indian conditions based
on the various categories of Earth surface features , resolution of available
satellite data, capabilities of sensors and present and future applications.
The profusion information of the earth surface offered by the high resolution
satellite images for remote sensing applications. Using change detection
methodologies to extract the target changes in the areas from high resolution
images and rapidly updates geodatabase information processing.Traditionally,
classification approaches have focused on per-pixel technologies. Pixels within
areas assumed to be automatically homogeneous are analyzed independently.
","[{'version': 'v1', 'created': 'Sun, 23 May 2010 18:16:49 GMT'}]",2010-05-25,"[['Babykalpana', 'Y.', ''], ['ThanushKodi', 'K.', '']]","['Espouse', 'LULC classification', 'profusion information', 'multi-scale amalgamation', 'change detection', 'Remote sensing images']"
16763,0908.0551,R Doomun,"Dr. Shishir Kumar, U.S. Rawat, Sameer Kumar Jasra, Akshay Kumar Jain","Efficient methodology for implementation of Encrypted File System in
  User Space","8 Pages IEEE Format, International Journal of Computer Science and
  Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423","International Journal of Computer Science and Information
  Security, IJCSIS July 2009, Vol. 3, No. 1, USA",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Encrypted File System (EFS) pushes encryption services into the file
system itself. EFS supports secure storage at the system level through a
standard UNIX file system interface to encrypted files. User can associate a
cryptographic key with the directories they wish to protect. Files in these
directories (as well as their pathname components) are transparently encrypted
and decrypted with the specified key without further user intervention; clear
text is never stored on a disk or sent to a remote file server. EFS can use any
available file system for its underlying storage without modifications,
including remote file servers such as NFS. System management functions, such as
file backup, work in a normal manner and without knowledge of the key.
Performance is an important factor to users since encryption can be time
consuming. This paper describes the design and implementation of EFS in user
space using faster cryptographic algorithms on UNIX Operating system.
Implementing EFS in user space makes it portable and flexible; Kernel size will
also not increase resulting in more reliable & efficient Operating System.
Encryption techniques for file system level encryption are described, and
general issues of cryptographic system interfaces to support routine secure
computing are discussed.
","[{'version': 'v1', 'created': 'Tue, 4 Aug 2009 21:30:18 GMT'}]",2009-08-06,"[['Kumar', 'Dr. Shishir', ''], ['Rawat', 'U. S.', ''], ['Jasra', 'Sameer Kumar', ''], ['Jain', 'Akshay Kumar', '']]","['Advance Encryption standerd', 'Electronic code book mode', 'EFS daemon', 'Intialization vector', 'Network File system']"
16764,1206.4124,Harshavardhan Kayarkar,Harshavardhan Kayarkar,"Classification of Various Security Techniques in Databases and their
  Comparative Analysis","8 pages, 1 table","ACTA Technica Corviniensis, Vol. 5, Issue 2, April-June 2012, pp.
  135-138",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data security is one of the most crucial and a major challenge in the digital
world. Security, privacy and integrity of data are demanded in every operation
performed on internet. Whenever security of data is discussed, it is mostly in
the context of secure transfer of data over the unreliable communication
networks. But the security of the data in databases is also as important. In
this paper we will be presenting some of the common security techniques for the
data that can be implemented in fortifying and strengthening the databases.
","[{'version': 'v1', 'created': 'Tue, 19 Jun 2012 05:38:22 GMT'}]",2012-07-04,"[['Kayarkar', 'Harshavardhan', '']]","['Security techniques', 'cryptography', 'hashing', 'steganography']"
16765,1604.07939,Andre Araujo,"Andre Araujo, Jason Chaves, Haricharan Lakshman, Roland Angst, Bernd
  Girod",Large-Scale Query-by-Image Video Retrieval Using Bloom Filters,,,,,cs.MM cs.DB cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of using image queries to retrieve videos from a
database. Our focus is on large-scale applications, where it is infeasible to
index each database video frame independently. Our main contribution is a
framework based on Bloom filters, which can be used to index long video
segments, enabling efficient image-to-video comparisons. Using this framework,
we investigate several retrieval architectures, by considering different types
of aggregation and different functions to encode visual information -- these
play a crucial role in achieving high performance. Extensive experiments show
that the proposed technique improves mean average precision by 24% on a public
dataset, while being 4X faster, compared to the previous state-of-the-art.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2016 05:46:52 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Jul 2016 17:58:16 GMT'}]",2016-07-13,"[['Araujo', 'Andre', ''], ['Chaves', 'Jason', ''], ['Lakshman', 'Haricharan', ''], ['Angst', 'Roland', ''], ['Girod', 'Bernd', '']]","['Bloom filters', 'large-scale', 'query-by-image', 'video retrieval']"
16766,1401.6543,Ananthanarayanan Chockalingam,"T. Lakshmi Narasimhan, Yalagala Naresh, Tanumay Datta, and A.
  Chockalingam",Pseudo-random Phase Precoded Spatial Modulation,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spatial modulation (SM) is a transmission scheme that uses multiple transmit
antennas but only one transmit RF chain. At each time instant, only one among
the transmit antennas will be active and the others remain silent. The index of
the active transmit antenna will also convey information bits in addition to
the information bits conveyed through modulation symbols (e.g.,QAM).
Pseudo-random phase precoding (PRPP) is a technique that can achieve high
diversity orders even in single antenna systems without the need for channel
state information at the transmitter (CSIT) and transmit power control (TPC).
In this paper, we exploit the advantages of both SM and PRPP simultaneously. We
propose a pseudo-random phase precoded SM (PRPP-SM) scheme, where both the
modulation bits and the antenna index bits are precoded by pseudo-random
phases. The proposed PRPP-SM system gives significant performance gains over SM
system without PRPP and PRPP system without SM. Since maximum likelihood (ML)
detection becomes exponentially complex in large dimensions, we propose low
complexity local search based detection (LSD) algorithm suited for PRPP-SM
systems with large precoder sizes. Our simulation results show that with 4
transmit antennas, 1 receive antenna, $5\times 20$ pseudo-random phase precoder
matrix and BPSK modulation, the performance of PRPP-SM using ML detection is
better than SM without PRPP with ML detection by about 9 dB at $10^{-2}$ BER.
This performance advantage gets even better for large precoding sizes.
","[{'version': 'v1', 'created': 'Sat, 25 Jan 2014 15:03:27 GMT'}]",2014-01-28,"[['Narasimhan', 'T. Lakshmi', ''], ['Naresh', 'Yalagala', ''], ['Datta', 'Tanumay', ''], ['Chockalingam', 'A.', '']]","['Multi-antenna systems', 'spatial modulation', 'pseudorandom phase precoding', 'local search based detection']"
16767,1207.6355,Varun  Jog,Varun Jog and Venkat Anantharam,"The Entropy Power Inequality and Mrs. Gerber's Lemma for Abelian Groups
  of Order 2^n","37 pages, 5 figures. Submitted to IEEE Transactions on Information
  Theory",,,,cs.IT math.CO math.GR math.IT math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Shannon's Entropy Power Inequality can be viewed as characterizing the
minimum differential entropy achievable by the sum of two independent random
variables with fixed differential entropies. The entropy power inequality has
played a key role in resolving a number of problems in information theory. It
is therefore interesting to examine the existence of a similar inequality for
discrete random variables. In this paper we obtain an entropy power inequality
for random variables taking values in an abelian group of order 2^n, i.e. for
such a group G we explicitly characterize the function f_G(x,y) giving the
minimum entropy of the sum of two independent G-valued random variables with
respective entropies x and y. Random variables achieving the extremum in this
inequality are thus the analogs of Gaussians in this case, and these are also
determined. It turns out that f_G(x,y) is convex in x for fixed y and, by
symmetry, convex in y for fixed x. This is a generalization to abelian groups
of order 2^n of the result known as Mrs. Gerber's Lemma.
","[{'version': 'v1', 'created': 'Thu, 26 Jul 2012 18:17:09 GMT'}]",2012-07-31,"[['Jog', 'Varun', ''], ['Anantharam', 'Venkat', '']]","['Entropy', 'Entropy power inequality', 'Mrs. Gerber’s Lemma', 'Finite abelian groups']"
16768,1407.3716,Mohammadreza Malek-Mohammadi,"Mohammadreza Malek-Mohammadi, Massoud Babaie-Zadeh, and Mikael
  Skoglund","Performance Guarantees for Schatten-$p$ Quasi-Norm Minimization in
  Recovery of Low-Rank Matrices",Submitted to Elsevier Signal Processing,,,,cs.IT math.IT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address some theoretical guarantees for Schatten-$p$ quasi-norm
minimization ($p \in (0,1]$) in recovering low-rank matrices from compressed
linear measurements. Firstly, using null space properties of the measurement
operator, we provide a sufficient condition for exact recovery of low-rank
matrices. This condition guarantees unique recovery of matrices of ranks equal
or larger than what is guaranteed by nuclear norm minimization. Secondly, this
sufficient condition leads to a theorem proving that all restricted isometry
property (RIP) based sufficient conditions for $\ell_p$ quasi-norm minimization
generalize to Schatten-$p$ quasi-norm minimization. Based on this theorem, we
provide a few RIP-based recovery conditions.
","[{'version': 'v1', 'created': 'Mon, 14 Jul 2014 16:37:51 GMT'}, {'version': 'v2', 'created': 'Sun, 26 Oct 2014 15:59:54 GMT'}]",2014-10-28,"[['Malek-Mohammadi', 'Mohammadreza', ''], ['Babaie-Zadeh', 'Massoud', ''], ['Skoglund', 'Mikael', '']]","['Affine Rank Minimization (ARM)', 'Nuclear Norm Minimization (NNM)', 'RestrictedIsometry Property (RIP)', 'Schatten-p Quasi-Norm Minimization (pSNM)']"
16769,1111.4144,Aravindh Krishnamoorthy,Aravindh Krishnamoorthy and Deepak Menon,Matrix Inversion Using Cholesky Decomposition,"3pp with minor changes, pre-print; accepted for publication 2013 IEEE
  Signal Processing: Algorithms, Architectures, Arrangements, and Applications
  (SPA) conference",,,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a method for matrix inversion based on Cholesky
decomposition with reduced number of operations by avoiding computation of
intermediate results; further, we use fixed point simulations to compare the
numerical accuracy of the method.
","[{'version': 'v1', 'created': 'Thu, 17 Nov 2011 16:44:40 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Oct 2013 20:33:59 GMT'}]",2013-10-21,"[['Krishnamoorthy', 'Aravindh', ''], ['Menon', 'Deepak', '']]","['matrix', 'inversion', 'Cholesky', 'LDL']"
16770,1707.09965,Sascha Hunold,Sascha Hunold and Alexandra Carpen-Amarie,Tuning MPI Collectives by Verifying Performance Guidelines,"16 pages, 14 figures",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  MPI collective operations provide a standardized interface for performing
data movements within a group of processes. The efficiency of collective
communication operations depends on the actual algorithm, its implementation,
and the specific communication problem (type of communication, message size,
number of processes). Many MPI libraries provide numerous algorithms for
specific collective operations. The strategy for selecting an efficient
algorithm is often times predefined (hard-coded) in MPI libraries, but some of
them, such as Open MPI, allow users to change the algorithm manually. Finding
the best algorithm for each case is a hard problem, and several approaches to
tune these algorithmic parameters have been proposed. We use an orthogonal
approach to the parameter-tuning of MPI collectives, that is, instead of
testing individual algorithmic choices provided by an MPI library, we compare
the latency of a specific MPI collective operation to the latency of
semantically equivalent functions, which we call the mock-up implementations.
The structure of the mock-up implementations is defined by self-consistent
performance guidelines. The advantage of this approach is that tuning using
mock-up implementations is always possible, whether or not an MPI library
allows users to select a specific algorithm at run-time. We implement this
concept in a library called PGMPITuneLib, which is layered between the user
code and the actual MPI implementation. This library selects the
best-performing algorithmic pattern of an MPI collective by intercepting MPI
calls and redirecting them to our mock-up implementations. Experimental results
show that PGMPITuneLib can significantly reduce the latency of MPI collectives,
and also equally important, that it can help identifying the tuning potential
of MPI libraries.
","[{'version': 'v1', 'created': 'Mon, 31 Jul 2017 17:19:09 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Aug 2017 14:08:30 GMT'}]",2017-08-11,"[['Hunold', 'Sascha', ''], ['Carpen-Amarie', 'Alexandra', '']]","['MPI', 'collective operations', 'tuning', 'performance guidelines']"
16771,1504.06817,Lijun Zhang,"Lijun Zhang, Tianbao Yang, Rong Jin, Zhi-Hua Zhou",Analysis of Nuclear Norm Regularization for Full-rank Matrix Completion,,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we provide a theoretical analysis of the nuclear-norm
regularized least squares for full-rank matrix completion. Although similar
formulations have been examined by previous studies, their results are
unsatisfactory because only additive upper bounds are provided. Under the
assumption that the top eigenspaces of the target matrix are incoherent, we
derive a relative upper bound for recovering the best low-rank approximation of
the unknown matrix. Our relative upper bound is tighter than previous additive
bounds of other methods if the mass of the target matrix is concentrated on its
top eigenspaces, and also implies perfect recovery if it is low-rank. The
analysis is built upon the optimality condition of the regularized formulation
and existing guarantees for low-rank matrix completion. To the best of our
knowledge, this is first time such a relative bound is proved for the
regularized formulation of matrix completion.
","[{'version': 'v1', 'created': 'Sun, 26 Apr 2015 13:12:16 GMT'}]",2015-04-28,"[['Zhang', 'Lijun', ''], ['Yang', 'Tianbao', ''], ['Jin', 'Rong', ''], ['Zhou', 'Zhi-Hua', '']]","['matrix completion', 'nuclear norm regularization', 'least squares', 'low-rank', 'full-rank']"
16772,1511.05798,Dirk Lewandowski,Dirk Lewandowski,"Problems with the use of Web search engines to find results in foreign
  languages","Research paper, World Wide Web, search engines, advanced search
  options, language restriction",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose - To test the ability of major search engines, Google, Yahoo, MSN,
and Ask, to distinguish between German and English-language documents
  Design/methodology/approach - 50 queries, using words common in German and in
English, were posed to the engines. The advanced search option of language
restriction was used, once in German and once in English. The first 20 results
per engine in each language were investigated.
  Findings - While none of the search engines faces problems in providing
results in the language of the interface that is used, both Google and MSN face
problems when the results are restricted to a foreign language.
  Research limitations/implications - Search engines were only tested in German
and in English. We have only anecdotal evidence that the problems are the same
with other languages.
  Practical implications - Searchers should not use the language restriction in
Google and MSN when searching for foreign-language documents. Instead,
searchers should use Yahoo or Ask. If searching for foreign language documents
in Google or MSN, the interface in the target language/country should be used.
  Value of paper - Demonstrates a problem with search engines that has not been
previously investigated.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2015 14:26:58 GMT'}]",2015-11-19,"[['Lewandowski', 'Dirk', '']]","['World Wide Web', 'search engines', 'advanced search options', 'language restriction Paper type – Research paper']"
16773,1605.00194,Xiaojing Shen,"Hang Rao, Xiaojing Shen, Yunmin Zhu and Jianxin Pan",Distributed Detection Fusion via Monte Carlo Importance Sampling,"20 pages, 2 figures, submitted",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed detection fusion with high-dimension conditionally dependent
observations is known to be a challenging problem. When a fusion rule is fixed,
this paper attempts to make progress on this problem for the large sensor
networks by proposing a new Monte Carlo framework. Through the Monte Carlo
importance sampling, we derive a necessary condition for optimal sensor
decision rules in the sense of minimizing the approximated Bayesian cost
function. Then, a Gauss-Seidel/person-by-person optimization algorithm can be
obtained to search the optimal sensor decision rules. It is proved that the
discretized algorithm is finitely convergent. The complexity of the new
algorithm is $O(LN)$ compared with $O(LN^L)$ of the previous algorithm where
$L$ is the number of sensors and $N$ is a constant. Thus, the proposed methods
allows us to design the large sensor networks with general high-dimension
dependent observations. Furthermore, an interesting result is that, for the
fixed AND or OR fusion rules, we can analytically derive the optimal solution
in the sense of minimizing the approximated Bayesian cost function. In general,
the solution of the Gauss-Seidel algorithm is only local optimal. However, in
the new framework, we can prove that the solution of Gauss-Seidel algorithm is
same as the analytically optimal solution in the case of the AND or OR fusion
rule. The typical examples with dependent observations and large number of
sensors are examined under this new framework. The results of numerical
examples demonstrate the effectiveness of the new algorithm.
","[{'version': 'v1', 'created': 'Sun, 1 May 2016 01:28:28 GMT'}]",2016-05-03,"[['Rao', 'Hang', ''], ['Shen', 'Xiaojing', ''], ['Zhu', 'Yunmin', ''], ['Pan', 'Jianxin', '']]","['Distributed detection', 'Monte Carlo importance sampling', 'dependent observations', 'sensor decision rule', 'fusion rule']"
16774,1702.03101,Sylvain Sen\'e,"Florian Bridoux, Pierre Guillon, K\'evin Perrot, Sylvain Sen\'e,
  Guillaume Theyssier","On the cost of simulating a parallel Boolean automata network by a
  block-sequential one",,,,,cs.DM cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article we study the minimum number $\kappa$ of additional automata
that a Boolean automata network (BAN) associated with a given block-sequential
update schedule needs in order to simulate a given BAN with a parallel update
schedule. We introduce a graph that we call $\mathsf{NECC}$ graph built from
the BAN and the update schedule. We show the relation between $\kappa$ and the
chromatic number of the $\mathsf{NECC}$ graph. Thanks to this $\mathsf{NECC}$
graph, we bound $\kappa$ in the worst case between $n/2$ and $2n/3+2$ ($n$
being the size of the BAN simulated) and we conjecture that this number equals
$n/2$. We support this conjecture with two results: the clique number of a
$\mathsf{NECC}$ graph is always less than or equal to $n/2$ and, for the
subclass of bijective BANs, $\kappa$ is always less than or equal to $n/2+1$.
","[{'version': 'v1', 'created': 'Fri, 10 Feb 2017 08:52:51 GMT'}]",2017-02-13,"[['Bridoux', 'Florian', ''], ['Guillon', 'Pierre', ''], ['Perrot', 'Kévin', ''], ['Sené', 'Sylvain', ''], ['Theyssier', 'Guillaume', '']]","['Boolean automata networks', 'intrinsic simulation', 'block-sequential update schedules']"
16775,1003.4149,Claude Martineau,"Claude Martineau (IGM-LabInfo), Elsa Tolone (IGM-LabInfo), Stavroula
  Voyatzi (IGM-LabInfo)","Les Entit\'es Nomm\'ees : usage et degr\'es de pr\'ecision et de
  d\'esambigu\""isation",,"26\`eme Colloque international sur le Lexique et la Grammaire
  (LGC'07), Bonifacio : France (2007)",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The recognition and classification of Named Entities (NER) are regarded as an
important component for many Natural Language Processing (NLP) applications.
The classification is usually made by taking into account the immediate context
in which the NE appears. In some cases, this immediate context does not allow
getting the right classification. We show in this paper that the use of an
extended syntactic context and large-scale resources could be very useful in
the NER task.
","[{'version': 'v1', 'created': 'Mon, 22 Mar 2010 13:09:57 GMT'}]",2010-04-01,"[['Martineau', 'Claude', '', 'IGM-LabInfo'], ['Tolone', 'Elsa', '', 'IGM-LabInfo'], ['Voyatzi', 'Stavroula', '', 'IGM-LabInfo']]","['named entity', 'electronic dictionary', 'transducer', 'syntactic context']"
16776,1403.0001,Venugopal K r,"T Shiva Prakash, K B Raja, K R Venugopal, S S Iyengar, L M Patnaik",Link-Reliability Based Two-Hop Routing for Wireless Sensor Networks,"15 pages. arXiv admin note: substantial text overlap with
  arXiv:1402.7198","International Journal of Information Processing, 7(1), 15-29, 2013",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless Sensor Networks (WSNs) emerge as underlying infrastructures for new
classes of large scale net- worked embedded systems. However, WSNs system
designers must fulfill the Quality-of-Service (QoS) requirements imposed by the
applications (and users). Very harsh and dynamic physical environments and
extremely limited energy/computing/memory/communication node resources are
major obstacles for satisfying QoS metrics such as reliability, timeliness and
system lifetime. The limited communication range of WSN nodes, link asymmetry
and the characteristics of the physical environment lead to a major source of
QoS degradation in WSNs. This paper proposes a Link Reliability based Two-Hop
Routing protocol for wireless Sensor Networks (WSNs). The protocol achieves to
reduce packet deadline miss ratio while consid- ering link reliability, two-hop
velocity and power efficiency and utilizes memory and computational effective
methods for estimating the link metrics. Numerical results provide insights
that the protocol has a lower packet deadline miss ratio and longer sensor
network lifetime. The results show that the proposed protocol is a feasible
solution to the QoS routing problem in wireless sensor networks that support
real-time applications.
","[{'version': 'v1', 'created': 'Fri, 28 Feb 2014 11:02:45 GMT'}]",2014-03-04,"[['Prakash', 'T Shiva', ''], ['Raja', 'K B', ''], ['Venugopal', 'K R', ''], ['Iyengar', 'S S', ''], ['Patnaik', 'L M', '']]","['Deadline Miss Ratio (DMR)', 'Energy efficiency', 'Link reliability', 'Quality-of-service(QoS)', 'Twohop neighbors', 'Wireless Sensor Networks']"
16777,1606.07103,Sai Praneeth Suggu,"Sai Praneeth Suggu, Kushwanth N. Goutham, Manoj K. Chinnakotla and
  Manish Shrivastava","Deep Feature Fusion Network for Answer Quality Prediction in Community
  Question Answering","Neu-IR '16 SIGIR Workshop on Neural Information Retrieval, July 21,
  2016, Pisa, Italy",,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Community Question Answering (cQA) forums have become a popular medium for
soliciting direct answers to specific questions of users from experts or other
experienced users on a given topic. However, for a given question, users
sometimes have to sift through a large number of low-quality or irrelevant
answers to find out the answer which satisfies their information need. To
alleviate this, the problem of Answer Quality Prediction (AQP) aims to predict
the quality of an answer posted in response to a forum question. Current AQP
systems either learn models using - a) various hand-crafted features (HCF) or
b) use deep learning (DL) techniques which automatically learn the required
feature representations.
  In this paper, we propose a novel approach for AQP known as - ""Deep Feature
Fusion Network (DFFN)"" which leverages the advantages of both hand-crafted
features and deep learning based systems. Given a question-answer pair along
with its metadata, DFFN independently - a) learns deep features using a
Convolutional Neural Network (CNN) and b) computes hand-crafted features using
various external resources and then combines them using a deep neural network
trained to predict the final answer quality. DFFN achieves state-of-the-art
performance on the standard SemEval-2015 and SemEval-2016 benchmark datasets
and outperforms baseline approaches which individually employ either HCF or DL
based techniques alone.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2016 20:58:08 GMT'}, {'version': 'v2', 'created': 'Sun, 26 Jun 2016 05:54:51 GMT'}]",2016-06-28,"[['Suggu', 'Sai Praneeth', ''], ['Goutham', 'Kushwanth N.', ''], ['Chinnakotla', 'Manoj K.', ''], ['Shrivastava', 'Manish', '']]","['Community Question Answering', 'Answer Quality Prediction', 'Answer Selection', 'Deep Learning', 'Convolutional Neural Networks', 'Feature Engineering']"
16778,1003.5627,Ashley Smith,Mahmoud I. Abdalla and Hanaa S. Ali,"Wavelet-Based Mel-Frequency Cepstral Coefficients for Speaker
  Identification using Hidden Markov Models",,"Journal of Telecommunications, Volume 1, Issue 2, pp16-21, March
  2010",,,cs.SD cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To improve the performance of speaker identification systems, an effective
and robust method is proposed to extract speech features, capable of operating
in noisy environment. Based on the time-frequency multi-resolution property of
wavelet transform, the input speech signal is decomposed into various frequency
channels. For capturing the characteristic of the signal, the Mel-Frequency
Cepstral Coefficients (MFCCs) of the wavelet channels are calculated. Hidden
Markov Models (HMMs) were used for the recognition stage as they give better
recognition for the speaker's features than Dynamic Time Warping (DTW).
Comparison of the proposed approach with the MFCCs conventional feature
extraction method shows that the proposed method not only effectively reduces
the influence of noise, but also improves recognition. A recognition rate of
99.3% was obtained using the proposed feature extraction technique compared to
98.7% using the MFCCs. When the test patterns were corrupted by additive white
Gaussian noise with 20 dB S/N ratio, the recognition rate was 97.3% using the
proposed method compared to 93.3% using the MFCCs.
","[{'version': 'v1', 'created': 'Mon, 29 Mar 2010 17:54:55 GMT'}]",2010-03-31,"[['Abdalla', 'Mahmoud I.', ''], ['Ali', 'Hanaa S.', '']]","['Dynamic Time Warping', 'Hidden Markov Modes', 'Mel-Frequency Cepestral Coefficients', 'Speaker Identification', 'Wavelet Transform']"
16779,1511.05862,Jeff Jones Dr,"Jeff Jones, Richard Mayne, Andrew Adamatzky","Representation of Shape Mediated by Environmental Stimuli in Physarum
  polycephalum and a Multi-agent Model",,,,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The slime mould Physarum polycephalum is known to construct proto- plasmic
transport networks which approximate proximity graphs by forag- ing for
nutrients during its plasmodial life cycle stage. In these networks, nodes are
represented by nutrients and edges are represented by proto- plasmic tubes.
These networks have been shown to be efficient in terms of length and
resilience of the overall network to random damage. However relatively little
research has been performed in the potential for Physarum transport networks to
approximate the overall shape of a dataset. In this paper we distinguish
between connectivity and shape of a planar point dataset and demonstrate, using
scoping experiments with plasmodia of P. polycephalum and a multi-agent model
of the organism, how we can gen- erate representations of the external and
internal shapes of a set of points. As with proximity graphs formed by P.
polycephalum, the behaviour of the plasmodium (real and model) is mediated by
environmental stimuli. We further explore potential morphological computation
approaches with the multi-agent model, presenting methods which approximate the
Convex Hull and the Concave Hull. We demonstrate how a growth parameter in the
model can be used to transition between Convex and Concave Hulls. These results
suggest novel mechanisms of morphological computation mediated by environmental
stimuli.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2015 16:26:34 GMT'}]",2015-11-19,"[['Jones', 'Jeff', ''], ['Mayne', 'Richard', ''], ['Adamatzky', 'Andrew', '']]","['Physarum polycephalum', 'morphological adaptation', 'unconventional computation', 'convex hull', 'concave hull']"
16780,1304.2080,Sofiane Chemaa,"Sofiane Chemaa, Raida Elmansouri, Allaoua Chaoui","Web Services Modeling and Composition Approach using Object-Oriented
  Petri Nets","16 pages, 14 figures","International Journal of Computer Science Issues (IJCSI), volume
  9, issue 4, No 3, July 2012",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, with the emergence and the evolution of new technologies, such as
e-business, a large number of companies are connected to Internet, and have
proposed web services to trade. Web services as presented, are conceptually
limited components to relatively simple functionalities. Generally, a single
service does not satisfy the users needs that are more and more complex.
Therefore, services must be made able to be composed to offer added value
services. In this paper, a web services composition approach, modelled by
Objects-Oriented Petri nets, is presented. In his context, an expressive
algebra, which successfully solves the web services complex composition
problem, is proposed. A java tool that allows automating this approach; based
on a definite algebra and a G-nets meta-model, proposed by us, is developed.
","[{'version': 'v1', 'created': 'Mon, 8 Apr 2013 00:08:49 GMT'}]",2013-04-09,"[['Chemaa', 'Sofiane', ''], ['Elmansouri', 'Raida', ''], ['Chaoui', 'Allaoua', '']]","['web services', 'web services composition', 'e-business', 'algebra', 'Objects-Oriented Petri nets', 'meta-model']"
16781,1209.5245,Tarek Behi Mr,"Tarek Behi, Najet Arous and Noureddine Ellouze","Spike Timing Dependent Competitive Learning in Recurrent Self Organizing
  Pulsed Neural Networks Case Study: Phoneme and Word Recognition","10 pages, 15 tables","International Journal of Computer Science Issues, Vol. 9, Issue 4,
  No 2, (2012)328-337",,,cs.CV cs.AI q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Synaptic plasticity seems to be a capital aspect of the dynamics of neural
networks. It is about the physiological modifications of the synapse, which
have like consequence a variation of the value of the synaptic weight. The
information encoding is based on the precise timing of single spike events that
is based on the relative timing of the pre- and post-synaptic spikes, local
synapse competitions within a single neuron and global competition via lateral
connections. In order to classify temporal sequences, we present in this paper
how to use a local hebbian learning, spike-timing dependent plasticity for
unsupervised competitive learning, preserving self-organizing maps of spiking
neurons. In fact we present three variants of self-organizing maps (SOM) with
spike-timing dependent Hebbian learning rule, the Leaky Integrators Neurons
(LIN), the Spiking_SOM and the recurrent Spiking_SOM (RSSOM) models. The case
study of the proposed SOM variants is phoneme classification and word
recognition in continuous speech and speaker independent.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2012 12:28:16 GMT'}]",2012-09-25,"[['Behi', 'Tarek', ''], ['Arous', 'Najet', ''], ['Ellouze', 'Noureddine', '']]","['Kohonen map', 'Leaky Integrators Neurons', 'Spiking_SOM', 'Recurrent Spiking_SOM', 'STDP', 'speech recognition']"
16782,1407.3646,Zbigniew Lipi\'nski,Z. Lipinski,"Stability of routing strategies for the maximum lifetime problem in
  ad-hoc wireless networks",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We solve the maximum lifetime problem for a one-dimensional, regular ad-hoc
wireless network with one data collector $L_N$ for any data transmission cost
energy matrix which elements $E_{i,j}$ are superadditive functions, i.e.,
satisfy the inequality $\forall_{i\leq j\leq k}\;E_{i,j}+E_{j,k}\leq E_{i,k}$.
We analyze stability of the solution under modification of two sets of
parameters, the amount of data $Q_i$, $i\in [1,N]$ generated by each node and
location of the nodes $x_i$ in the network. We assume, that the data
transmission cost energy matrix $E_{i,j}$ is a function of a distance between
network nodes and thus the change of the node location causes change of
$E_{i,j}$. We say, that a solution $q(t_0)$ of the maximum network lifetime
problem is stable under modification of a given parameter $t_0$ in the
stability region $U(t_0)$, if the data flow matrix $q(t)$ is a solution of the
problem for any $t\in U(t_0)$. In the paper we estimate the size of the
stability region $U(Q^0,d^0)$ for the solution of the maximum network lifetime
problem for the $L_N$ network in the neighborhoods of the points $Q^0_i=1$,
$d^0_i=0$, where $d_i\in (-1,1)$ describes the shift of the nodes from their
initial location $x_i^0=i$, i.e., $x_i=i-d_i$.
","[{'version': 'v1', 'created': 'Mon, 14 Jul 2014 13:36:16 GMT'}]",2014-07-15,"[['Lipinski', 'Z.', '']]","['sensitivity analysis', 'wireless ad-hoc network', 'energy efficiency']"
16783,1209.5260,Mingkui Tan,Mingkui Tan and Ivor W. Tsang and Li Wang,Towards Ultrahigh Dimensional Feature Selection for Big Data,61 pages,"JMLR, 15(1): 1371 - 1429, 2014",,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a new adaptive feature scaling scheme for
ultrahigh-dimensional feature selection on Big Data. To solve this problem
effectively, we first reformulate it as a convex semi-infinite programming
(SIP) problem and then propose an efficient \emph{feature generating paradigm}.
In contrast with traditional gradient-based approaches that conduct
optimization on all input features, the proposed method iteratively activates a
group of features and solves a sequence of multiple kernel learning (MKL)
subproblems of much reduced scale. To further speed up the training, we propose
to solve the MKL subproblems in their primal forms through a modified
accelerated proximal gradient approach. Due to such an optimization scheme,
some efficient cache techniques are also developed. The feature generating
paradigm can guarantee that the solution converges globally under mild
conditions and achieve lower feature selection bias. Moreover, the proposed
method can tackle two challenging tasks in feature selection: 1) group-based
feature selection with complex structures and 2) nonlinear feature selection
with explicit feature mappings. Comprehensive experiments on a wide range of
synthetic and real-world datasets containing tens of million data points with
$O(10^{14})$ features demonstrate the competitive performance of the proposed
method over state-of-the-art feature selection methods in terms of
generalization performance and training efficiency.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2012 13:23:39 GMT'}, {'version': 'v2', 'created': 'Sun, 15 Dec 2019 15:57:22 GMT'}]",2019-12-17,"[['Tan', 'Mingkui', ''], ['Tsang', 'Ivor W.', ''], ['Wang', 'Li', '']]","['Big data', 'Ultrahigh dimensionality', 'feature selection', 'nonlinear feature selection', 'multiple kernel learning', 'feature generation']"
16784,0908.4116,Nikos Triandopoulos,"Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos","Efficient Authenticated Data Structures for Graph Connectivity and
  Geometric Search Problems",Full version of related paper appearing in CT-RSA 2003,,,,cs.CR cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Authenticated data structures provide cryptographic proofs that their answers
are as accurate as the author intended, even if the data structure is being
controlled by a remote untrusted host. We present efficient techniques for
authenticating data structures that represent graphs and collections of
geometric objects. We introduce the path hash accumulator, a new primitive
based on cryptographic hashing for efficiently authenticating various
properties of structured data represented as paths, including any decomposable
query over sequences of elements. We show how to employ our primitive to
authenticate queries about properties of paths in graphs and search queries on
multi-catalogs. This allows the design of new, efficient authenticated data
structures for fundamental problems on networks, such as path and connectivity
queries over graphs, and complex queries on two-dimensional geometric objects,
such as intersection and containment queries.
","[{'version': 'v1', 'created': 'Fri, 28 Aug 2009 00:18:06 GMT'}]",2009-08-31,"[['Goodrich', 'Michael T.', ''], ['Tamassia', 'Roberto', ''], ['Triandopoulos', 'Nikos', '']]","['authenticated data structures', 'data authentication', 'information integrity', 'graph connectivity', 'geometric searching']"
16785,1704.08119,Salvatore Corrente,"Francesca Abastante, Salvatore Corrente, Salvatore Greco, Alessio
  Ishizaka, Isabella Lami","Using a new parsimonious AHP methodology combined with the Choquet
  integral: An application for evaluating social housing initiatives",,,,,cs.AI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a development of the Analytic Hierarchy Process (AHP) permitting
to use the methodology also in cases of decision problems with a very large
number of alternatives evaluated with respect to several criteria. While the
application of the original AHP method involves many pairwise comparisons
between alternatives and criteria, our proposal is composed of three steps: (i)
direct evaluation of the alternatives at hand on the considered criteria, (ii)
selection of some reference evaluations; (iii) application of the original AHP
method to reference evaluations; (iv) revision of the direct evaluation on the
basis of the prioritization supplied by AHP on reference evaluations. The new
proposal has been tested and validated in an experiment conducted on a sample
of university students. The new methodology has been therefore applied to a
real world problem involving the evaluation of 21 Social Housing initiatives
sited in the Piedmont region (Italy). To take into account interaction between
criteria, the Choquet integral preference model has been considered within a
Non Additive Robust Ordinal Regression approach.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 12:38:22 GMT'}]",2017-04-27,"[['Abastante', 'Francesca', ''], ['Corrente', 'Salvatore', ''], ['Greco', 'Salvatore', ''], ['Ishizaka', 'Alessio', ''], ['Lami', 'Isabella', '']]","['Analytic Hierarchy Process', 'Parsimonious preference information', 'Social Housing', 'Choquet Integral', 'Robust Ordinal Regression']"
16786,0704.2725,Manuel Cebri\'an,Manuel Cebrian and Ivan Cantador,"Exploiting Heavy Tails in Training Times of Multilayer Perceptrons: A
  Case Study with the UCI Thyroid Disease Database","8 pages, 4 figures, submitted for consideration to the ""Statistics
  and Its Interface"" journal",,,,cs.NE,,"  The random initialization of weights of a multilayer perceptron makes it
possible to model its training process as a Las Vegas algorithm, i.e. a
randomized algorithm which stops when some required training error is obtained,
and whose execution time is a random variable. This modeling is used to perform
a case study on a well-known pattern recognition benchmark: the UCI Thyroid
Disease Database. Empirical evidence is presented of the training time
probability distribution exhibiting a heavy tail behavior, meaning a big
probability mass of long executions. This fact is exploited to reduce the
training time cost by applying two simple restart strategies. The first assumes
full knowledge of the distribution yielding a 40% cut down in expected time
with respect to the training without restarts. The second, assumes null
knowledge, yielding a reduction ranging from 9% to 23%.
","[{'version': 'v1', 'created': 'Fri, 20 Apr 2007 15:58:04 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Dec 2007 03:06:49 GMT'}]",2011-11-09,"[['Cebrian', 'Manuel', ''], ['Cantador', 'Ivan', '']]","['Stochastic Modeling', 'Multilayer Perceptron', 'Heavy Tail Distribution', 'Restart Strategy', 'UCI Thyroid Disease Database']"
16787,1208.4490,Wojciech Zabo{\l}otny PhD,Wojciech M. Zabolotny,"Efficient transmission of measurement data from FPGA to embedded system
  via Ethernet link",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a system consisting of the FPGA IP core, the simple
network protocol and the Linux device driver, capable of efficient and reliable
data transmission from a low resources FPGA chip to the Linux-based embedded
computer system, via a private Ethernet network (consisting of a single segment
or a few segments connected via an Ethernet switch). The embedded system may
optionally process the acquired data, and distribute them further, using
standard network protocols. Proposed design targets cost-efficient multichannel
data acquisition systems, in which multiple FPGA based front end boards (FEB)
should transmit the stream of acquired data to the computer network,
responsible for their final processing and archiving. The presented solution
allows to minimize the cost of data concentration due to use of inexpensive
Ethernet network infrastructure. The work is mainly focused on minimization of
resources consumption in the FPGA, and minimization of acknowledge latency in
the Linux based system - which allows to achieve high throughput in spite of
use of inexpensive FPGA chips with small internal memory.
","[{'version': 'v1', 'created': 'Wed, 22 Aug 2012 12:56:36 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Sep 2012 07:20:20 GMT'}, {'version': 'v3', 'created': 'Mon, 17 Sep 2012 18:27:37 GMT'}, {'version': 'v4', 'created': 'Sun, 30 Sep 2012 13:56:43 GMT'}]",2012-10-02,"[['Zabolotny', 'Wojciech M.', '']]","['FPGA', 'Ethernet', 'Ethernet Protocol', 'Embedded Systems', 'Data Acquisition', 'Data Concentrator']"
16788,1401.4844,Rosy Madaan,"Ashish Kumar Mourya, Niraj Singhal",Managing Congestion Control in Mobile AD-HOC Network Using Mobile Agents,"9 Pages. IJCEA, 2014. arXiv admin note: substantial text overlap with
  arXiv:0907.5441 by other authors without attribution",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In mobile adhoc networks, congestion occurs with limited resources. The
standard TCP congestion control mechanism is not able to handle the special
properties of a shared wireless channel. TCP congestion control works very well
on the Internet. But mobile adhoc networks exhibit some unique properties that
greatly affect the design of appropriate protocols and protocol stacks in
general, and of congestion control mechanism in particular. As it turned out,
the vastly differing environment in a mobile adhoc network is highly
problematic for standard TCP. Many approaches have been proposed to overcome
these difficulties. Mobile agent based congestion control Technique is proposed
to avoid congestion in adhoc network. When mobile agent travels through the
network, it can select a less-loaded neighbor node as its next hop and update
the routing table according to the node congestion status. With the aid of
mobile agents, the nodes can get the dynamic network topology in time. In this
paper, a mobile agent based congestion control mechanism is presented.
","[{'version': 'v1', 'created': 'Mon, 20 Jan 2014 09:51:07 GMT'}]",2014-01-21,"[['Mourya', 'Ashish Kumar', ''], ['Singhal', 'Niraj', '']]","['Mobile Ad-hoc Networks', 'Mobile Agents', 'TCP', 'Congestion']"
16789,1407.2700,Anwar Ebrahim alawady,"Ghazali Sulong, Anwar Yahy Ebrahim and Muhammad Jehanzeb","Offline handwritten signature identification using adaptive window
  positioning techniques","13 pages, 9 figures, 2 tables, Offline Handwritten Signature, GPDS
  dataset, Verification, Identification, Adaptive window positioning",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents to address this challenge, we have proposed the use of
Adaptive Window Positioning technique which focuses on not just the meaning of
the handwritten signature but also on the individuality of the writer. This
innovative technique divides the handwritten signature into 13 small windows of
size nxn(13x13).This size should be large enough to contain ample information
about the style of the author and small enough to ensure a good identification
performance.The process was tested with a GPDS data set containing 4870
signature samples from 90 different writers by comparing the robust features of
the test signature with that of the user signature using an appropriate
classifier. Experimental results reveal that adaptive window positioning
technique proved to be the efficient and reliable method for accurate signature
feature extraction for the identification of offline handwritten signatures.The
contribution of this technique can be used to detect signatures signed under
emotional duress.
","[{'version': 'v1', 'created': 'Thu, 10 Jul 2014 06:03:00 GMT'}]",2014-07-11,"[['Sulong', 'Ghazali', ''], ['Ebrahim', 'Anwar Yahy', ''], ['Jehanzeb', 'Muhammad', '']]","['Offline Handwritten Signature', 'GPDS dataset', 'Verification', 'Identification', 'Adaptive window positioning']"
16790,1009.0623,Sakthivel Subramaniam S,"S. Sakthivel, R. Lakshmipathi",Weighted Attribute Fusion Model for Face Recognition,"Keywords - Face Recognition, Feature Fusion Method, Parallel Method,
  PCA, DCT, Histogram Matching","International Journal of Computer Science and Information
  Security,Vol. 8, No. 3, 2010",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recognizing a face based on its attributes is an easy task for a human to
perform as it is a cognitive process. In recent years, Face Recognition is
achieved with different kinds of facial features which were used separately or
in a combined manner. Currently, Feature fusion methods and parallel methods
are the facial features used and performed by integrating multiple feature sets
at different levels. However, this integration and the combinational methods do
not guarantee better result. Hence to achieve better results, the feature
fusion model with multiple weighted facial attribute set is selected. For this
feature model, face images from predefined data set has been taken from
Olivetti Research Laboratory (ORL) and applied on different methods like
Principal Component Analysis (PCA) based Eigen feature extraction technique,
Discrete Cosine Transformation (DCT) based feature extraction technique,
Histogram Based Feature Extraction technique and Simple Intensity based
features. The extracted feature set obtained from these methods were compared
and tested for accuracy. In this work we have developed a model which will use
the above set of feature extraction techniques with different levels of weights
to attain better accuracy. The results show that the selection of optimum
weight for a particular feature will lead to improvement in recognition rate.
","[{'version': 'v1', 'created': 'Fri, 3 Sep 2010 10:05:20 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Sep 2010 15:57:24 GMT'}]",2010-11-10,"[['Sakthivel', 'S.', ''], ['Lakshmipathi', 'R.', '']]","['Face Recognition', 'Feature Fusion Method', 'Parallel Method', 'PCA', 'DCT', 'Histogram Matching']"
16791,1106.5174,Dmitry Zinoviev,Dmitry Zinoviev and Vy Duong,"A Game Theoretical Approach to Broadcast Information Diffusion in Social
  Networks","6 pages, 3 figures, presented at ANSS-2011 (Boston, MA)",,,,cs.SI cs.GT physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One major function of social networks (e.g., massive online social networks)
is the dissemination of information, such as scientific knowledge, news, and
rumors. Information can be propagated by the users of the network via natural
connections in written, oral or electronic form. The information passing from a
sender to receivers and back (in the form of comments) involves all of the
actors considering their knowledge, trust, and popularity, which shape their
publishing and commenting strategies. To understand such human aspects of the
information dissemination, we propose a game theoretical model of a one-way
information forwarding and feedback mechanism in a star-shaped social network
that takes into account the personalities of the communicating actors.
","[{'version': 'v1', 'created': 'Sat, 25 Jun 2011 21:30:42 GMT'}]",2011-06-28,"[['Zinoviev', 'Dmitry', ''], ['Duong', 'Vy', '']]","['Social Network', 'Game Theory', 'Knowledge', 'Popularity', 'Trust', 'Reputation', 'Rumor']"
16792,1506.02106,Amy Bearman,"Amy Bearman, Olga Russakovsky, Vittorio Ferrari, Li Fei-Fei",What's the Point: Semantic Segmentation with Point Supervision,ECCV (2016) submission,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The semantic image segmentation task presents a trade-off between test time
accuracy and training-time annotation cost. Detailed per-pixel annotations
enable training accurate models but are very time-consuming to obtain,
image-level class labels are an order of magnitude cheaper but result in less
accurate models. We take a natural step from image-level annotation towards
stronger supervision: we ask annotators to point to an object if one exists. We
incorporate this point supervision along with a novel objectness potential in
the training loss function of a CNN model. Experimental results on the PASCAL
VOC 2012 benchmark reveal that the combined effect of point-level supervision
and objectness potential yields an improvement of 12.9% mIOU over image-level
supervision. Further, we demonstrate that models trained with point-level
supervision are more accurate than models trained with image-level,
squiggle-level or full supervision given a fixed annotation budget.
","[{'version': 'v1', 'created': 'Sat, 6 Jun 2015 02:45:48 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Jun 2015 15:45:20 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Sep 2015 18:52:24 GMT'}, {'version': 'v4', 'created': 'Tue, 10 Nov 2015 20:19:47 GMT'}, {'version': 'v5', 'created': 'Sat, 23 Jul 2016 17:41:43 GMT'}]",2016-07-26,"[['Bearman', 'Amy', ''], ['Russakovsky', 'Olga', ''], ['Ferrari', 'Vittorio', ''], ['Fei-Fei', 'Li', '']]","['semantic segmentation', 'weak supervision', 'data annotation']"
16793,1409.6234,Alexandr Klimchik,"Alexandr Klimchik (EM NANTES, IRCCyN), Yier Wu (EM NANTES, IRCCyN),
  St\'ephane Caro (IRCCyN), Beno\^it Furet (IRCCyN), Anatol Pashkevich (EM
  NANTES, IRCCyN)","Accuracy Improvement of Robot-Based Milling Using an Enhanced
  Manipulator Model",,"Advances on Theory and Practice of Robots and Manipulators (2014)
  73-81",,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper is devoted to the accuracy improvement of robot-based milling by
using an enhanced manipulator model that takes into account both geometric and
elastostatic factors. Particular attention is paid to the model parameters
identification accuracy. In contrast to other works, the proposed approach
takes into account impact of the gravity compensator and link weights on the
manipulator elastostatic properties. In order to improve the identification
accuracy, the industry oriented performance measure is used to define optimal
measurement configurations and an enhanced partial pose measurement method is
applied for the identification of the model parameters. The advantages of the
developed approach are confirmed by experimental results that deal with the
elastostatic calibration of a heavy industrial robot used for milling. The
achieved accuracy improvement factor is about 2.4.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 16:37:46 GMT'}]",2014-09-23,"[['Klimchik', 'Alexandr', '', 'EM NANTES, IRCCyN'], ['Wu', 'Yier', '', 'EM NANTES, IRCCyN'], ['Caro', 'Stéphane', '', 'IRCCyN'], ['Furet', 'Benoît', '', 'IRCCyN'], ['Pashkevich', 'Anatol', '', 'EM\n  NANTES, IRCCyN']]","['Robot-based milling', 'elastostatic calibration', 'gravity compensator']"
16794,1407.3836,David Toth,David Toth,Imparo is complete by inverse subsumption,3 pages,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Inverse subsumption for complete explanatory induction Yamamoto et al.
investigate which inductive logic programming systems can learn a correct
hypothesis $H$ by using the inverse subsumption instead of inverse entailment.
We prove that inductive logic programming system Imparo is complete by inverse
subsumption for learning a correct definite hypothesis $H$ wrt the definite
background theory $B$ and ground atomic examples $E$, by establishing that
there exists a connected theory $T$ for $B$ and $E$ such that $H$ subsumes $T$.
","[{'version': 'v1', 'created': 'Mon, 14 Jul 2014 22:21:22 GMT'}]",2014-07-16,"[['Toth', 'David', '']]","['Imparo', 'Inverse subsumption', 'Inductive Logic Programming']"
16795,1506.03885,Dietmar Berwanger,Dietmar Berwanger and Marie van den Bogaard,Games with Delays. A Frankenstein Approach,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate infinite games on finite graphs where the information flow is
perturbed by nondeterministic signalling delays. It is known that such
perturbations make synthesis problems virtually unsolvable, in the general
case. On the classical model where signals are attached to states, tractable
cases are rare and difficult to identify.
  Here, we propose a model where signals are detached from control states, and
we identify a subclass on which equilibrium outcomes can be preserved, even if
signals are delivered with a delay that is finitely bounded. To offset the
perturbation, our solution procedure combines responses from a collection of
virtual plays following an equilibrium strategy in the instant- signalling game
to synthesise, in a Frankenstein manner, an equivalent equilibrium strategy for
the delayed-signalling game.
","[{'version': 'v1', 'created': 'Fri, 12 Jun 2015 01:19:54 GMT'}]",2015-06-15,"[['Berwanger', 'Dietmar', ''], ['Bogaard', 'Marie van den', '']]","['infinite games on graphs', 'imperfect information', 'delayed monitoring', 'distributed synthesis']"
16796,1304.6459,Cheng Wang,"Cheng Wang, Zhenzhen Zhang, Jieren Zhou, Yuan He, Jipeng Cui, Changjun
  Jiang","Measuring Transport Difficulty of Data Dissemination in Large-Scale
  Online Social Networks: An Interest-Driven Case",,,,,cs.SI cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we aim to model the formation of data dissemination in online
social networks (OSNs), and measure the transport difficulty of generated data
traffic. We focus on a usual type of interest-driven social sessions in OSNs,
called \emph{Social-InterestCast}, under which a user will autonomously
determine whether to view the content from his followees depending on his
interest. It is challenging to figure out the formation mechanism of such a
Social-InterestCast, since it involves multiple interrelated factors such as
users' social relationships, users' interests, and content semantics. We
propose a four-layered system model, consisting of physical layer, social
layer, content layer, and session layer. By this model we successfully obtain
the geographical distribution of Social-InterestCast sessions, serving as the
precondition for quantifying data transport difficulty. We define the
fundamental limit of \emph{transport load} as a new metric, called
\emph{transport complexity}, i.e., the \emph{minimum required} transport load
for an OSN over a given carrier network. Specifically, we derive the transport
complexity for Social-InterestCast sessions in a large-scale OSN over the
carrier network with optimal communication architecture. The results can act as
the common lower bounds on transport load for Social-InterestCast over any
carrier networks. To the best of our knowledge, this is the first work to
measure the transport difficulty for data dissemination in OSNs by modeling
session patterns with the interest-driven characteristics.
","[{'version': 'v1', 'created': 'Wed, 24 Apr 2013 01:13:50 GMT'}, {'version': 'v2', 'created': 'Sat, 27 Jul 2013 16:23:50 GMT'}, {'version': 'v3', 'created': 'Sat, 4 Apr 2015 02:26:36 GMT'}, {'version': 'v4', 'created': 'Mon, 26 Oct 2015 14:41:03 GMT'}, {'version': 'v5', 'created': 'Thu, 12 May 2016 07:40:07 GMT'}]",2016-05-13,"[['Wang', 'Cheng', ''], ['Zhang', 'Zhenzhen', ''], ['Zhou', 'Jieren', ''], ['He', 'Yuan', ''], ['Cui', 'Jipeng', ''], ['Jiang', 'Changjun', '']]","['Online social networks', 'data dissemination', 'transport load', 'fundamental limits', 'scaling behavior']"
16797,1603.00636,Gudmund Grov PhD,"Gudmund Grov, Andrew Ireland, Maria Teresa Llano, Peter Kovacs, Simon
  Colton and Jeremy Gow",Semi-Automated Design Space Exploration for Formal Modelling,14 pages. Long version of a short paper to be published at ABZ 2016,,,,cs.SE cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Refinement based formal methods allow the modelling of systems through
incremental steps via abstraction. Discovering the right levels of abstraction,
formulating correct and meaningful invariants, and analysing faulty models are
some of the challenges faced when using this technique. Here, we propose Design
Space Exploration, an approach that aims to assist a designer by automatically
providing high-level modelling guidance in real-time. More specifically,
through the combination of common patterns of modelling with techniques from
automated theory formation and automated reasoning, different design
alternatives are explored and suitable models that deal with faults are
proposed.
","[{'version': 'v1', 'created': 'Wed, 2 Mar 2016 09:54:44 GMT'}]",2016-03-03,"[['Grov', 'Gudmund', ''], ['Ireland', 'Andrew', ''], ['Llano', 'Maria Teresa', ''], ['Kovacs', 'Peter', ''], ['Colton', 'Simon', ''], ['Gow', 'Jeremy', '']]","['Formal Methods', 'Design', 'Modelling', 'Refinement', 'Abstraction', 'Event-B', 'Automated Reasoning', 'Automated Theory Formation']"
16798,0806.3215,Xiahong Lin,"Xiahong Lin, Lin Gao, Kefei Chen, and David K. Y. Chiu",MOHCS: Towards Mining Overlapping Highly Connected Subgraphs,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many networks in real-life typically contain parts in which some nodes are
more highly connected to each other than the other nodes of the network. The
collection of such nodes are usually called clusters, communities, cohesive
groups or modules. In graph terminology, it is called highly connected graph.
In this paper, we first prove some properties related to highly connected
graph. Based on these properties, we then redefine the highly connected
subgraph which results in an algorithm that determines whether a given graph is
highly connected in linear time. Then we present a computationally efficient
algorithm, called MOHCS, for mining overlapping highly connected subgraphs. We
have evaluated experimentally the performance of MOHCS using real and synthetic
data sets from computer-generated graph and yeast protein network. Our results
show that MOHCS is effective and reliable in finding overlapping highly
connected subgraphs. Keywords-component; Highly connected subgraph, clustering
algorithms, minimum cut, minimum degree
","[{'version': 'v1', 'created': 'Thu, 19 Jun 2008 15:13:38 GMT'}]",2008-06-20,"[['Lin', 'Xiahong', ''], ['Gao', 'Lin', ''], ['Chen', 'Kefei', ''], ['Chiu', 'David K. Y.', '']]","['component; Highly connected subgraph', 'clustering algorithms', 'minimum cut', 'minimum degree']"
16799,1606.05032,Yang Yang,"Yang Yang, Weilun Chen, Yadan Luo, Fumin Shen, Jie Shao and Heng Tao
  Shen",Zero-Shot Hashing via Transferring Supervised Knowledge,11 pages,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hashing has shown its efficiency and effectiveness in facilitating
large-scale multimedia applications. Supervised knowledge e.g. semantic labels
or pair-wise relationship) associated to data is capable of significantly
improving the quality of hash codes and hash functions. However, confronted
with the rapid growth of newly-emerging concepts and multimedia data on the
Web, existing supervised hashing approaches may easily suffer from the scarcity
and validity of supervised information due to the expensive cost of manual
labelling. In this paper, we propose a novel hashing scheme, termed
\emph{zero-shot hashing} (ZSH), which compresses images of ""unseen"" categories
to binary codes with hash functions learned from limited training data of
""seen"" categories. Specifically, we project independent data labels i.e.
0/1-form label vectors) into semantic embedding space, where semantic
relationships among all the labels can be precisely characterized and thus seen
supervised knowledge can be transferred to unseen classes. Moreover, in order
to cope with the semantic shift problem, we rotate the embedded space to more
suitably align the embedded semantics with the low-level visual feature space,
thereby alleviating the influence of semantic gap. In the meantime, to exert
positive effects on learning high-quality hash functions, we further propose to
preserve local structural property and discrete nature in binary codes.
Besides, we develop an efficient alternating algorithm to solve the ZSH model.
Extensive experiments conducted on various real-life datasets show the superior
zero-shot image retrieval performance of ZSH as compared to several
state-of-the-art hashing methods.
","[{'version': 'v1', 'created': 'Thu, 16 Jun 2016 02:56:39 GMT'}]",2016-06-17,"[['Yang', 'Yang', ''], ['Chen', 'Weilun', ''], ['Luo', 'Yadan', ''], ['Shen', 'Fumin', ''], ['Shao', 'Jie', ''], ['Shen', 'Heng Tao', '']]","['zero-shot hashing', 'supervision transfer', 'semantic alignment']"
16800,1304.6181,GuangGang Geng,"Guang-Gang Geng, Xiao-Bo Jin, Xin-Chang Zhang, De-Xian Zhang",Evaluating Web Content Quality via Multi-scale Features,"4 pages, 1 figures, ecml/pkdd 2010 discovery challenge",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web content quality measurement is crucial to various web content processing
applications. This paper will explore multi-scale features which may affect the
quality of a host, and develop automatic statistical methods to evaluate the
Web content quality. The extracted properties include statistical content
features, page and host level link features and TFIDF features. The experiments
on ECML/PKDD 2010 Discovery Challenge data set show that the algorithm is
effective and feasible for the quality tasks of multiple languages, and the
multi-scale features have different identification ability and provide good
complement to each other for most tasks.
","[{'version': 'v1', 'created': 'Tue, 23 Apr 2013 06:42:55 GMT'}]",2013-04-24,"[['Geng', 'Guang-Gang', ''], ['Jin', 'Xiao-Bo', ''], ['Zhang', 'Xin-Chang', ''], ['Zhang', 'De-Xian', '']]","['Web Spam', 'Web Content Quality', 'Quality Assessment']"
16801,1409.5900,Moran Feldman,Moran Feldman,Maximizing Symmetric Submodular Functions,"31 pages, an extended abstract appeared in ESA 2015",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Symmetric submodular functions are an important family of submodular
functions capturing many interesting cases including cut functions of graphs
and hypergraphs. Maximization of such functions subject to various constraints
receives little attention by current research, unlike similar minimization
problems which have been widely studied. In this work, we identify a few
submodular maximization problems for which one can get a better approximation
for symmetric objectives than the state of the art approximation for general
submodular functions.
  We first consider the problem of maximizing a non-negative symmetric
submodular function $f\colon 2^\mathcal{N} \to \mathbb{R}^+$ subject to a
down-monotone solvable polytope $\mathcal{P} \subseteq [0, 1]^\mathcal{N}$. For
this problem we describe an algorithm producing a fractional solution of value
at least $0.432 \cdot f(OPT)$, where $OPT$ is the optimal integral solution.
Our second result considers the problem $\max \{f(S) : |S| = k\}$ for a
non-negative symmetric submodular function $f\colon 2^\mathcal{N} \to
\mathbb{R}^+$. For this problem, we give an approximation ratio that depends on
the value $k / |\mathcal{N}|$ and is always at least $0.432$. Our method can
also be applied to non-negative non-symmetric submodular functions, in which
case it produces $1/e - o(1)$ approximation, improving over the best known
result for this problem. For unconstrained maximization of a non-negative
symmetric submodular function we describe a deterministic linear-time
$1/2$-approximation algorithm. Finally, we give a $[1 - (1 - 1/k)^{k -
1}]$-approximation algorithm for Submodular Welfare with $k$ players having
identical non-negative submodular utility functions, and show that this is the
best possible approximation ratio for the problem.
","[{'version': 'v1', 'created': 'Sat, 20 Sep 2014 15:48:35 GMT'}, {'version': 'v2', 'created': 'Sun, 17 Apr 2016 08:44:17 GMT'}]",2016-04-19,"[['Feldman', 'Moran', '']]","['Symmetric submodular functions', 'cardinality constraint', 'matroid constraint']"
16802,0706.3679,Yann Guermeur,Yann Guermeur (LORIA),"Scale-sensitive Psi-dimensions: the Capacity Measures for Classifiers
  Taking Values in R^Q",,ASMDA 2007 (2007) 1-8,,,cs.LG,,"  Bounds on the risk play a crucial role in statistical learning theory. They
usually involve as capacity measure of the model studied the VC dimension or
one of its extensions. In classification, such ""VC dimensions"" exist for models
taking values in {0, 1}, {1,..., Q} and R. We introduce the generalizations
appropriate for the missing case, the one of models with values in R^Q. This
provides us with a new guaranteed risk for M-SVMs which appears superior to the
existing one.
","[{'version': 'v1', 'created': 'Mon, 25 Jun 2007 17:28:57 GMT'}]",2007-06-26,"[['Guermeur', 'Yann', '', 'LORIA']]","['Large margin classifiers', 'Generalized VC dimensions', 'M-SVMs']"
16803,1305.0032,Mario Blaum,Mario Blaum,Construction of PMDS and SD Codes extending RAID 5,7 pages,,,"IBM Research Report, IBM Research Report, RJ10504, March 2013",cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A construction of Partial Maximum Distance Separable (PMDS) and Sector-Disk
(SD) codes extending RAID 5 with two extra parities is given, solving an open
problem. Previous constructions relied on computer searches, while our
constructions provide a theoretical solution to the problem.
","[{'version': 'v1', 'created': 'Tue, 30 Apr 2013 21:45:17 GMT'}]",2013-05-02,"[['Blaum', 'Mario', '']]","['Error-correcting codes', 'RAID architectures', 'MDS codes', 'array codes', 'Reed-Solomon codes', 'Blaum-Roth codes', 'PMDS codes', 'SD codes']"
16804,1304.0809,Guillaume Allais,"Guillaume Allais, Pierre Boutillier, Conor McBride","New Equations for Neutral Terms: A Sound and Complete Decision
  Procedure, Formalized",,,,,cs.PL,http://creativecommons.org/licenses/by/3.0/,"  The definitional equality of an intensional type theory is its test of type
compatibility. Today's systems rely on ordinary evaluation semantics to compare
expressions in types, frustrating users with type errors arising when
evaluation fails to identify two `obviously' equal terms. If only the machine
could decide a richer theory! We propose a way to decide theories which
supplement evaluation with `$\nu$-rules', rearranging the neutral parts of
normal forms, and report a successful initial experiment.
  We study a simple -calculus with primitive fold, map and append operations on
lists and develop in Agda a sound and complete decision procedure for an
equational theory enriched with monoid, functor and fusion laws.
","[{'version': 'v1', 'created': 'Tue, 2 Apr 2013 22:55:32 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Apr 2013 00:45:07 GMT'}, {'version': 'v3', 'created': 'Mon, 17 Jun 2013 15:30:20 GMT'}]",2013-06-18,"[['Allais', 'Guillaume', ''], ['Boutillier', 'Pierre', ''], ['McBride', 'Conor', '']]","['Normalization by Evaluation', 'Logical Relations', 'SimplyTyped Lambda Calculus', 'Map Fusion']"
16805,1609.01508,Mohammadi Zaki,"Aditya Gopalan, Odalric-Ambrym Maillard and Mohammadi Zaki",Low-rank Bandits with Latent Mixtures,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the task of maximizing rewards from recommending items (actions) to
users sequentially interacting with a recommender system. Users are modeled as
latent mixtures of C many representative user classes, where each class
specifies a mean reward profile across actions. Both the user features (mixture
distribution over classes) and the item features (mean reward vector per class)
are unknown a priori. The user identity is the only contextual information
available to the learner while interacting. This induces a low-rank structure
on the matrix of expected rewards r a,b from recommending item a to user b. The
problem reduces to the well-known linear bandit when either user or item-side
features are perfectly known. In the setting where each user, with its
stochastically sampled taste profile, interacts only for a small number of
sessions, we develop a bandit algorithm for the two-sided uncertainty. It
combines the Robust Tensor Power Method of Anandkumar et al. (2014b) with the
OFUL linear bandit algorithm of Abbasi-Yadkori et al. (2011). We provide the
first rigorous regret analysis of this combination, showing that its regret
after T user interactions is $\tilde O(C\sqrt{BT})$, with B the number of
users. An ingredient towards this result is a novel robustness property of
OFUL, of independent interest.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2016 12:01:30 GMT'}]",2016-09-07,"[['Gopalan', 'Aditya', ''], ['Maillard', 'Odalric-Ambrym', ''], ['Zaki', 'Mohammadi', '']]","['Multi-armed bandits', 'online learning', 'low-rank matrices', 'recommender systems', 'reinforcement learning']"
16806,1510.05218,Tareq Malas,"Tareq M. Malas, Julian Hornich, Georg Hager, Hatem Ltaief, Christoph
  Pflaum and David E. Keyes","Optimization of an electromagnetics code with multicore wavefront
  diamond blocking and multi-dimensional intra-tile parallelization",,,,,cs.CE cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding and optimizing the properties of solar cells is becoming a key
issue in the search for alternatives to nuclear and fossil energy sources. A
theoretical analysis via numerical simulations involves solving Maxwell's
Equations in discretized form and typically requires substantial computing
effort. We start from a hybrid-parallel (MPI+OpenMP) production code that
implements the Time Harmonic Inverse Iteration Method (THIIM) with
Finite-Difference Frequency Domain (FDFD) discretization. Although this
algorithm has the characteristics of a strongly bandwidth-bound stencil update
scheme, it is significantly different from the popular stencil types that have
been exhaustively studied in the high performance computing literature to date.
We apply a recently developed stencil optimization technique, multicore
wavefront diamond tiling with multi-dimensional cache block sharing, and
describe in detail the peculiarities that need to be considered due to the
special stencil structure. Concurrency in updating the components of the
electric and magnetic fields provides an additional level of parallelism. The
dependence of the cache size requirement of the optimized code on the blocking
parameters is modeled accurately, and an auto-tuner searches for optimal
configurations in the remaining parameter space. We were able to completely
decouple the execution from the memory bandwidth bottleneck, accelerating the
implementation by a factor of three to four compared to an optimal
implementation with pure spatial blocking on an 18-core Intel Haswell CPU.
","[{'version': 'v1', 'created': 'Sun, 18 Oct 2015 10:13:47 GMT'}]",2015-10-20,"[['Malas', 'Tareq M.', ''], ['Hornich', 'Julian', ''], ['Hager', 'Georg', ''], ['Ltaief', 'Hatem', ''], ['Pflaum', 'Christoph', ''], ['Keyes', 'David E.', '']]","['Parallelprogramming', 'electromagnetics', 'performance analysis', 'stencils']"
16807,1607.04298,Farshid Farhat,Diman Zad Tootaghaj and Farshid Farhat,"Optimal Placement of Cores, Caches and Memory Controllers in Network
  On-Chip",,,,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parallel programming is emerging fast and intensive applications need more
resources, so there is a huge demand for on-chip multiprocessors. Accessing L1
caches beside the cores are the fastest after registers but the size of private
caches cannot increase because of design, cost and technology limits. Then
split I-cache and D-cache are used with shared LLC (last level cache). For a
unified shared LLC, bus interface is not scalable, and it seems that
distributed shared LLC (DSLLC) is a better choice. Most of papers assume a
distributed shared LLC beside each core in on-chip network. Many works assume
that DSLLCs are placed in all cores; however, we will show that this design
ignores the effect of traffic congestion in on-chip network. In fact, our work
focuses on optimal placement of cores, DSLLCs and even memory controllers to
minimize the expected latency based on traffic load in a mesh on-chip network
with fixed number of cores and total cache capacity. We try to do some
analytical modeling deriving intended cost function and then optimize the mean
delay of the on-chip network communication. This work is supposed to be
verified using some traffic patterns that are run on CSIM simulator.
","[{'version': 'v1', 'created': 'Thu, 14 Jul 2016 20:09:47 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Aug 2016 23:52:56 GMT'}, {'version': 'v3', 'created': 'Thu, 25 Aug 2016 19:05:46 GMT'}, {'version': 'v4', 'created': 'Mon, 26 Sep 2016 16:48:31 GMT'}]",2016-09-27,"[['Tootaghaj', 'Diman Zad', ''], ['Farhat', 'Farshid', '']]","['Network on Chip', 'Mathematical Modeling', 'Simulation', 'Optimization']"
16808,1010.3983,R Devarakonda,"Ranjeet Devarakonda, Giri Palanisamy, Jim Green",Digitizing scientific data and data retrieval techniques,,,,,cs.IT math.IT,http://creativecommons.org/licenses/publicdomain/,"  Storing data is easy, but finding and using data is not. It is desirable that
the data is stored in a structured format, which can be preserved and retrieved
in future. Creating Metadata for the data is one way of creating structured
data formats. Metadata can provide Multidisciplinary data access and will
foster more robust scientific discoveries. In the recent years, there has been
significant advancement in the areas of scientific data management and
retrieval techniques, particularly in terms of standards and protocols for
archiving data and metadata. New search technologies are being implemented
around these protocols, which makes searching easy, fast and yet robust.
Scientific data is generally rich, not easy to understand, and spread across
different places. In order to integrate these pieces together, a data archive
and an associated metadata is generated. This data should be stored in a format
that can be locatable, retrievable and understandable, more importantly it
should be in a form that will continue to be accessible as technology changes,
such as XML.
","[{'version': 'v1', 'created': 'Tue, 19 Oct 2010 17:22:55 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Jan 2011 17:20:51 GMT'}]",2011-01-04,"[['Devarakonda', 'Ranjeet', ''], ['Palanisamy', 'Giri', ''], ['Green', 'Jim', '']]","['Metadata', 'Scientific data archiving', 'Metadata standards', 'Mercury']"
16809,1107.3297,Soumaya Amdouni,"Soumaya Amdouni, Wahiba Ben Abdessalem Karaa, Sondes Bouabid","Semantic annotation of requirements for automatic UML class diagram
  generation",,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing complexity of software engineering requires effective methods
and tools to support requirements analysts' activities. While much of a
company's knowledge can be found in text repositories, current content
management systems have limited capabilities for structuring and interpreting
documents. In this context, we propose a tool for transforming text documents
describing users' requirements to an UML model. The presented tool uses Natural
Language Processing (NLP) and semantic rules to generate an UML class diagram.
The main contribution of our tool is to provide assistance to designers
facilitating the transition from a textual description of user requirements to
their UML diagrams based on GATE (General Architecture of Text) by formulating
necessary rules that generate new semantic annotations.
","[{'version': 'v1', 'created': 'Sun, 17 Jul 2011 12:51:30 GMT'}]",2011-07-19,"[['Amdouni', 'Soumaya', ''], ['Karaa', 'Wahiba Ben Abdessalem', ''], ['Bouabid', 'Sondes', '']]","['annotation', 'class diagram', 'GATE', 'requirements', 'semantic techniques', 'software engineering', 'UML model']"
16810,0707.0704,Alexandre d'Aspremont,"Onureena Banerjee, Laurent El Ghaoui, Alexandre d'Aspremont",Model Selection Through Sparse Maximum Likelihood Estimation,,,,,cs.AI cs.LG,,"  We consider the problem of estimating the parameters of a Gaussian or binary
distribution in such a way that the resulting undirected graphical model is
sparse. Our approach is to solve a maximum likelihood problem with an added
l_1-norm penalty term. The problem as formulated is convex but the memory
requirements and complexity of existing interior point methods are prohibitive
for problems with more than tens of nodes. We present two new algorithms for
solving problems with at least a thousand nodes in the Gaussian case. Our first
algorithm uses block coordinate descent, and can be interpreted as recursive
l_1-norm penalized regression. Our second algorithm, based on Nesterov's first
order method, yields a complexity estimate with a better dependence on problem
size than existing interior point methods. Using a log determinant relaxation
of the log partition function (Wainwright & Jordan (2006)), we show that these
same algorithms can be used to solve an approximate sparse maximum likelihood
problem for the binary case. We test our algorithms on synthetic data, as well
as on gene expression and senate voting records data.
","[{'version': 'v1', 'created': 'Wed, 4 Jul 2007 22:13:42 GMT'}]",2007-07-06,"[['Banerjee', 'Onureena', ''], ['Ghaoui', 'Laurent El', ''], [""d'Aspremont"", 'Alexandre', '']]","['Model Selection', 'Maximum Likelihood Estimation', 'Convex Optimization', 'Gaussian Graphical Model', 'Binary Data']"
16811,1510.08546,Xiao Liu,"Seth Gilbert, Xiao Liu, Haifeng Yu",On Differentially Private Online Collaborative Recommendation Systems,"35 pages, 2 figures",,,,cs.CR cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In collaborative recommendation systems, privacy may be compromised, as
users' opinions are used to generate recommendations for others. In this paper,
we consider an online collaborative recommendation system, and we measure
users' privacy in terms of the standard differential privacy. We give the first
quantitative analysis of the trade-offs between recommendation quality and
users' privacy in such a system by showing a lower bound on the best achievable
privacy for any non-trivial algorithm, and proposing a near-optimal algorithm.
From our results, we find that there is actually little trade-off between
recommendation quality and privacy for any non-trivial algorithm. Our results
also identify the key parameters that determine the best achievable privacy.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2015 02:28:46 GMT'}]",2015-10-30,"[['Gilbert', 'Seth', ''], ['Liu', 'Xiao', ''], ['Yu', 'Haifeng', '']]","['differential privacy', 'collaborative recommendation system', 'lower bound', 'online algorithm']"
16812,1610.04935,Richard Taylor Dr,Richard Taylor,"Approximations of the Densest k-Subhypergraph and Set Union Knapsack
  problems",There are two figures,,,,cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For any given $\epsilon>0$ we provide an algorithm for the Densest
$k$-Subhypergraph Problem with an approximation ratio of at most
$O(n^{\theta_m+2\epsilon})$ for
$\theta_m=\frac{1}{2}m-\frac{1}{2}-\frac{1}{2m}$ and run time at most
$O(n^{m-2+1/\epsilon})$, where the hyperedges have at most $m$ vertices. We use
this result to give an algorithm for the Set Union Knapsack Problem with an
approximation ratio of at most $O(n^{\alpha_m+\epsilon})$ for
$\alpha_m=\frac{2}{3}[m-1-\frac{2m-2}{m^2+m-1}]$ and run time at most
$O(n^{5(m-2)+9/\epsilon})$, where the subsets have at most $m$ elements. The
author is not aware of any previous results on the approximation of either of
these two problems.
","[{'version': 'v1', 'created': 'Mon, 17 Oct 2016 00:28:12 GMT'}]",2016-10-18,"[['Taylor', 'Richard', '']]","['Densest k-Subhypergraph Problem', 'Set Union KnapsackProblem', 'Approximation algorithms']"
16813,1501.00976,Zaaloul Abdellah,"Zaaloul Abdellah, Haqiq Abdelkrim",Enhanced Slotted Aloha Mechanism by Introducing ZigZag Decoding,"11 pages, 10 figures in Journal of mathematics and computer science
  2014. arXiv admin note: substantial text overlap with arXiv:1501.00881",,,,cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Various random access mechanisms, such as Aloha protocol and its
corresponding variants have been widely studied as efficient methods to
coordinate the medium access among competing users. But when two or more
wireless users transmit packets at the same time over the same channel a
collisions occur. When this happens, the received packets are discarded and
retransmissions are required, which is a waste of power and bandwidth. In such
a situation one of the most important objectives is to find techniques to
improve these protocols to reduce the number of collisions or to avoid them.
Several studies have contributed to this problem. In this paper, we propose a
new approach named ZigZag decoding to enhance slotted Aloha mechanism by
reducing the loss rate of packets colliding. We model the system by a Markov
chain witch the number of backlogged packets is taken as the system state. We
use a stochastic game to achieve our objective. We evaluate and compare the
performances parameters of the proposed approach with those of slotted Aloha
mechanism. All found results show that our approach is more efficient than the
slotted Aloha mechanism.
","[{'version': 'v1', 'created': 'Mon, 5 Jan 2015 17:08:45 GMT'}]",2015-01-07,"[['Abdellah', 'Zaaloul', ''], ['Abdelkrim', 'Haqiq', '']]","['Slotted Aloha', 'Markov Process', 'MAC Protocol', 'ZigZag Decoding']"
16814,1305.7454,Uwe Aickelin,"Jan Feyereisl, Uwe Aickelin",Privileged Information for Data Clustering,"Information Sciences 194, 4-23, 2012",,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many machine learning algorithms assume that all input samples are
independently and identically distributed from some common distribution on
either the input space X, in the case of unsupervised learning, or the input
and output space X x Y in the case of supervised and semi-supervised learning.
In the last number of years the relaxation of this assumption has been explored
and the importance of incorporation of additional information within machine
learning algorithms became more apparent. Traditionally such fusion of
information was the domain of semi-supervised learning. More recently the
inclusion of knowledge from separate hypothetical spaces has been proposed by
Vapnik as part of the supervised setting. In this work we are interested in
exploring Vapnik's idea of master-class learning and the associated learning
using privileged information, however within the unsupervised setting. Adoption
of the advanced supervised learning paradigm for the unsupervised setting
instigates investigation into the difference between privileged and technical
data. By means of our proposed aRi-MAX method stability of the KMeans algorithm
is improved and identification of the best clustering solution is achieved on
an artificial dataset. Subsequently an information theoretic dot product based
algorithm called P-Dot is proposed. This method has the ability to utilize a
wide variety of clustering techniques, individually or in combination, while
fusing privileged and technical data for improved clustering. Application of
the P-Dot method to the task of digit recognition confirms our findings in a
real-world scenario.
","[{'version': 'v1', 'created': 'Fri, 31 May 2013 15:28:44 GMT'}]",2013-06-03,"[['Feyereisl', 'Jan', ''], ['Aickelin', 'Uwe', '']]","['Clustering', 'Privileged Information', 'Hidden Information', 'Master-Class Learning', 'Machine Learning']"
16815,1603.09596,Georgios Samaras,"Yannis Avrithis, Ioannis Z. Emiris, and Georgios Samaras","High-dimensional approximate nearest neighbor: k-d Generalized
  Randomized Forests",,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new data-structure, the generalized randomized kd forest, or
kgeraf, for approximate nearest neighbor searching in high dimensions. In
particular, we introduce new randomization techniques to specify a set of
independently constructed trees where search is performed simultaneously, hence
increasing accuracy. We omit backtracking, and we optimize distance
computations, thus accelerating queries. We release public domain software
geraf and we compare it to existing implementations of state-of-the-art methods
including BBD-trees, Locality Sensitive Hashing, randomized kd forests, and
product quantization. Experimental results indicate that our method would be
the method of choice in dimensions around 1,000, and probably up to 10,000, and
pointsets of cardinality up to a few hundred thousands or even one million;
this range of inputs is encountered in many critical applications today. For
instance, we handle a real dataset of $10^6$ images represented in 960
dimensions with a query time of less than $1$sec on average and 90\% responses
being true nearest neighbors.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2016 14:04:30 GMT'}]",2016-04-01,"[['Avrithis', 'Yannis', ''], ['Emiris', 'Ioannis Z.', ''], ['Samaras', 'Georgios', '']]","['data-structure', 'randomized tree', 'space partition', 'geometric search', 'open software', 'practical complexity']"
16816,0807.2328,Wei Tsang Ooi,"Huiguang Liang, Ian Tay, Ming Feng Neo, Wei Tsang Ooi, Mehul Motani","Avatar Mobility in Networked Virtual Environments: Measurements,
  Analysis, and Implications",,,,,cs.NI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We collected mobility traces of 84,208 avatars spanning 22 regions over two
months in Second Life, a popular networked virtual environment. We analyzed the
traces to characterize the dynamics of the avatars mobility and behavior, both
temporally and spatially. We discuss the implications of the our findings to
the design of peer-to-peer networked virtual environments, interest management,
mobility modeling of avatars, server load balancing and zone partitioning,
client-side caching, and prefetching.
","[{'version': 'v1', 'created': 'Tue, 15 Jul 2008 09:51:46 GMT'}]",2008-07-16,"[['Liang', 'Huiguang', ''], ['Tay', 'Ian', ''], ['Neo', 'Ming Feng', ''], ['Ooi', 'Wei Tsang', ''], ['Motani', 'Mehul', '']]","['Networked Virtual Environment', 'Avatar Mobility', 'Avatar Behavior', 'Caching', 'Interest Management', 'Load Balancing', 'Peer-to-Peer']"
16817,1304.7881,Gobithaasan Rudrusamy,R.U. Gobithaasan,Various Types of Aesthetic Curves,,"2011 The Proceedings of Seminar Bidang Kepakaran Jabatan Matematik
  2010, Cherating, Pahang. Disember 27th- 30th 2010, Pg.9-22",,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The research on developing planar curves to produce visually pleasing
products (ranges from electric appliances to car body design) and
indentifying/modifying planar curves for special purposes namely for railway
design, highway design and robot trajectories have been progressing since
1970s. The pattern of research in this field of study has branched to five
major groups namely curve synthesis, fairing process, improvement in control of
natural spiral, construction of new type of planar curves and, natural spiral
fitting & approximation techniques. The purpose of is this paper is to briefly
review recent progresses in Computer Aided Geometric Design (CAGD) focusing on
the topics states above.
","[{'version': 'v1', 'created': 'Tue, 30 Apr 2013 05:25:31 GMT'}]",2013-05-01,"[['Gobithaasan', 'R. U.', '']]","['Computer Aided Geometric Design', 'Computer Aided Design', 'Automobile Design', 'Ergonomic Design', 'Visually pleasing curves', 'surfaces']"
16818,1607.01993,Nikos Gorogiannis,"James Brotherston, Nikos Gorogiannis and Max Kanovich",Biabduction (and Related Problems) in Array Separation Logic,,,,,cs.LO cs.DS cs.PL math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate array separation logic (ASL), a variant of symbolic-heap
separation logic in which the data structures are either pointers or arrays,
i.e., contiguous blocks of allocated memory. This logic provides a language for
compositional memory safety proofs of imperative array programs.
  We focus on the biabduction problem for this logic, which has been
established as the key to automatic specification inference at the industrial
scale. We present an NP decision procedure for biabduction in ASL that produces
solutions of reasonable quality, and we also show that the problem of finding a
consistent solution is NP-hard.
  Along the way, we study satisfiability and entailment in our logic, giving
decision procedures and complexity bounds for both problems. We show
satisfiability to be NP-complete, and entailment to be decidable with high
complexity. The somewhat surprising fact that biabduction is much simpler than
entailment is explained by the fact that, as we show, the element of choice
over biabduction solutions enables us to dramatically reduce the search space.
","[{'version': 'v1', 'created': 'Thu, 7 Jul 2016 12:49:04 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Nov 2016 21:44:27 GMT'}, {'version': 'v3', 'created': 'Fri, 18 Nov 2016 11:20:20 GMT'}]",2016-11-21,"[['Brotherston', 'James', ''], ['Gorogiannis', 'Nikos', ''], ['Kanovich', 'Max', '']]","['Separation logic', 'arrays', 'biabduction', 'satisfiability', 'entailment', 'complexity']"
16819,0805.0782,Michael Hilker,Michael Hilker and Christoph Schommer,A new queueing strategy for the Adversarial Queueing Theory,"8 pages, 1 figure, ps-trix","Proceedings, IPSI-2005, December 2005, Bled, Slovenia",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the today's Internet and TCP/IP-networks, the queueing of packets is
commonly implemented using the protocol FIFO (First In First Out).
Unfortunately, FIFO performs poorly in the Adversarial Queueing Theory. Other
queueing strategies are researched in this model and better results are
performed by alternative queueing strategies, e.g. LIS (Longest In System).
This article introduces a new queueing protocol called interval-strategy that
is concerned with the reduction from dynamic to static routing. We discuss the
maximum system time for a packet and estimate with up-to-date results how this
can be achieved. We figure out the maximum amount of time where a packet can
spend in the network (i.e. worst case system time), and argue that the
universal instability of the presented interval-strategy can be reached through
these results. When a large group of queueing strategies is used for queueing,
we prove that the interval-strategy will be universally unstable. Finally, we
calculate the maximum time of the static routing to reach an universal stable
and polynomial - in detail linear - bounded interval-strategy. Afterwards we
close - in order to check this upper bound - with up-to-date results about the
delivery times in static routing.
","[{'version': 'v1', 'created': 'Tue, 6 May 2008 19:25:41 GMT'}, {'version': 'v2', 'created': 'Wed, 7 May 2008 15:37:23 GMT'}]",2008-05-07,"[['Hilker', 'Michael', ''], ['Schommer', 'Christoph', '']]","['(Adversarial) Queueing Theory', 'Internet TrafficManagement', 'Data Streams']"
16820,1110.1428,Ziheng Lin,Duy Khang Ly and Kazunari Sugiyama and Ziheng Lin and Min-Yen Kan,"Product Review Summarization based on Facet Identification and Sentence
  Clustering","10 pages, 3 figures, 3 tables, short paper version published in JCDL
  2011",,,TR30/11,cs.CL cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Product review nowadays has become an important source of information, not
only for customers to find opinions about products easily and share their
reviews with peers, but also for product manufacturers to get feedback on their
products. As the number of product reviews grows, it becomes difficult for
users to search and utilize these resources in an efficient way. In this work,
we build a product review summarization system that can automatically process a
large collection of reviews and aggregate them to generate a concise summary.
More importantly, the drawback of existing product summarization systems is
that they cannot provide the underlying reasons to justify users' opinions. In
our method, we solve this problem by applying clustering, prior to selecting
representative candidates for summarization.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2011 04:56:43 GMT'}]",2011-10-10,"[['Ly', 'Duy Khang', ''], ['Sugiyama', 'Kazunari', ''], ['Lin', 'Ziheng', ''], ['Kan', 'Min-Yen', '']]","['Sentiment Analysis', 'Summarization', 'Clustering']"
16821,1109.6270,Pabitra Pal Choudhury,"Avishek Ghosh, Joydeep Banerjee, Sk. S. Hassan, P. Pal Choudhury",Fractal String Generation and Its Application in Music Composition,,,,,cs.SD cs.DM,http://creativecommons.org/licenses/by/3.0/,"  Music is a string of some of the notes out of 12 notes (Sa, Komal_re, Re,
Komal_ga, Ga, Ma, Kari_ma, Pa, Komal_dha, Dha, Komal_ni, Ni) and their
harmonics. Each note corresponds to a particular frequency. When such strings
are encoded to form discrete sequences, different frequencies present in the
music corresponds to different amplitude levels (value) of the discrete
sequence. Initially, a class of discrete sequences has been generated using
logistic map. All these discrete sequences have at most n-different amplitude
levels (value) (depending on the particular raga). Without loss of generality,
we have chosen two discrete sequences of two types of Indian raga viz. Bhairabi
and Bhupali having same number of amplitude levels to obtain/search close
relatives from the class. The relative / closeness can be assured through
correlation coefficient.The search is unbiased, random and non-adaptive. The
obtained string is that which maximally resembles the given two sequences. The
same can be thought of as a music composition of the given two strings. It is
to be noted that all these string are fractal string which can be persuaded by
fractal dimension.
","[{'version': 'v1', 'created': 'Tue, 27 Sep 2011 10:04:45 GMT'}]",2011-09-29,"[['Ghosh', 'Avishek', ''], ['Banerjee', 'Joydeep', ''], ['Hassan', 'Sk. S.', ''], ['Choudhury', 'P. Pal', '']]","['Bhairabi', 'Bhupali', 'Logistic map', 'Fractal dimension', 'Correlation Coefficient']"
16822,1603.05152,Kleanthis Malialis,Kleanthis Malialis and Jun Wang and Gary Brooks and George Frangou,Feature Selection as a Multiagent Coordination Problem,AAMAS-16 Workshop on Adaptive and Learning Agents (ALA-16),,,,cs.LG stat.ML,http://creativecommons.org/licenses/by/4.0/,"  Datasets with hundreds to tens of thousands features is the new norm. Feature
selection constitutes a central problem in machine learning, where the aim is
to derive a representative set of features from which to construct a
classification (or prediction) model for a specific task. Our experimental
study involves microarray gene expression datasets, these are high-dimensional
and noisy datasets that contain genetic data typically used for distinguishing
between benign or malicious tissues or classifying different types of cancer.
In this paper, we formulate feature selection as a multiagent coordination
problem and propose a novel feature selection method using multiagent
reinforcement learning. The central idea of the proposed approach is to
""assign"" a reinforcement learning agent to each feature where each agent learns
to control a single feature, we refer to this approach as MARL. Applying this
to microarray datasets creates an enormous multiagent coordination problem
between thousands of learning agents. To address the scalability challenge we
apply a form of reward shaping called CLEAN rewards. We compare in total nine
feature selection methods, including state-of-the-art methods, and show that
the proposed method using CLEAN rewards can significantly scale-up, thus
outperforming the rest of learning-based methods. We further show that a hybrid
variant of MARL achieves the best overall performance.
","[{'version': 'v1', 'created': 'Wed, 16 Mar 2016 15:49:37 GMT'}]",2016-03-17,"[['Malialis', 'Kleanthis', ''], ['Wang', 'Jun', ''], ['Brooks', 'Gary', ''], ['Frangou', 'George', '']]","['Feature selection', 'wrapper methods', 'reinforcement learning', 'microarray gene expression']"
16823,1305.7252,Ansuman Adhikary Ansuman Adhikary,Ansuman Adhikary and Giuseppe Caire,"Joint Spatial Division and Multiplexing: Opportunistic Beamforming and
  User Grouping","37 pages, 10 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Joint Spatial Division and Multiplexing (JSDM) is a recently proposed scheme
to enable massive MIMO like gains and simplified system operations for
Frequency Division Duplexing (FDD) systems. The key idea lies in partitioning
the users into groups with approximately similar covariances, and use a two
stage downlink beamforming: a pre-beamformer that depends on the channel
covariances and minimizes interference across groups and a multiuser MIMO
precoder for the effective channel after pre-beamforming, to counteract
interference within a group. We first focus on the regime of a fixed number of
antennas and large number of users, and show that opportunistic beamforming
with user selection yields significant gain, and thus, channel correlation may
yield a capacity improvement over the uncorrelated ""isotropic"" channel result
of Sharif and Hassibi. We prove that in the presence of different correlations
among groups, a block diagonalization approach for the design of
pre-beamformers achieves the optimal sum-rate scaling. Next, we consider the
regime of large number of antennas and users, where user selection does not
provide significant gain. Here, we propose a simplified user grouping algorithm
to cluster users into groups when the number of antennas becomes very large, in
a realistic setting where users are randomly distributed and have different
angles of arrival and angular spreads depending on the propagation environment.
Our subsequent analysis leads to a probabilistic scheduling algorithm, where
users within each group are preselected at random based on probabilities
derived from the large system analysis, depending on the fairness criterion.
This is advantageous since only the selected users are required to feedback
their channel state information (CSIT).
","[{'version': 'v1', 'created': 'Thu, 30 May 2013 20:52:38 GMT'}]",2013-06-03,"[['Adhikary', 'Ansuman', ''], ['Caire', 'Giuseppe', '']]","['JSDM', 'Opportunistic Beamforming', 'User Grouping', 'Probabilistic Scheduling']"
16824,1206.3883,Michael Codish,Amit Metodi and Michael Codish,Compiling Finite Domain Constraints to SAT with BEE,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present BEE, a compiler which enables to encode finite domain constraint
problems to CNF. Using BEE both eases the encoding process for the user and
also performs transformations to simplify constraints and optimize their
encoding to CNF. These optimizations are based primarily on equi-propagation
and on partial evaluation, and also on the idea that a given constraint may
have various possible CNF encodings. Often, the better encoding choice is made
after constraint simplification. BEE is written in Prolog and integrates
directly with a SAT solver through a suitable Prolog interface. We demonstrate
that constraint simplification is often highly beneficial when solving hard
finite domain constraint problems. A BEE implementation is available with this
paper.
","[{'version': 'v1', 'created': 'Mon, 18 Jun 2012 10:57:13 GMT'}]",2012-06-19,"[['Metodi', 'Amit', ''], ['Codish', 'Michael', '']]","['SAT encoding', 'FD constraints', 'Equi-propagation', 'partial evaluation']"
16825,1704.02897,Daisuke Iwai,Daisuke Iwai,Projection Mapping Technologies for AR,"3 pages, 1 figure, 23rd International Display Workshops in
  conjunction with Asia Display 2016. arXiv admin note: substantial text
  overlap with arXiv:1510.02710","Proceedings of International Display Workshops (IDW), pp.
  1076-1078, 2016",,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This invited talk will present recent projection mapping technologies for
augmented reality. First, fundamental technologies are briefly explained, which
have been proposed to overcome the technical limitations of ordinary
projectors. Second, augmented reality (AR) applications using projection
mapping technologies are introduced.
","[{'version': 'v1', 'created': 'Mon, 10 Apr 2017 15:13:40 GMT'}]",2017-04-11,"[['Iwai', 'Daisuke', '']]","['Projection mapping', 'augmented reality', 'computational display']"
16826,1701.06264,Guo-Jun Qi,Guo-Jun Qi,Loss-Sensitive Generative Adversarial Networks on Lipschitz Densities,"The source codes for both LS-GAN and GLS-GAN are available at
  \url{https://github.com/maple-research-lab}. LS-GAN is also supported by
  Microsoft CNTK at
  \url{https://www.cntk.ai/pythondocs/CNTK_206C_WGAN_LSGAN.html}. The original
  codes of LS-GAN and GLS-GAN are also available at
  https://github.com/guojunq/lsgan/ and https://github.com/guojunq/glsgan/","in International Journal of Computer Vision (IJCV), 2019",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present the Lipschitz regularization theory and algorithms
for a novel Loss-Sensitive Generative Adversarial Network (LS-GAN).
Specifically, it trains a loss function to distinguish between real and fake
samples by designated margins, while learning a generator alternately to
produce realistic samples by minimizing their losses. The LS-GAN further
regularizes its loss function with a Lipschitz regularity condition on the
density of real data, yielding a regularized model that can better generalize
to produce new data from a reasonable number of training examples than the
classic GAN. We will further present a Generalized LS-GAN (GLS-GAN) and show it
contains a large family of regularized GAN models, including both LS-GAN and
Wasserstein GAN, as its special cases. Compared with the other GAN models, we
will conduct experiments to show both LS-GAN and GLS-GAN exhibit competitive
ability in generating new images in terms of the Minimum Reconstruction Error
(MRE) assessed on a separate test set. We further extend the LS-GAN to a
conditional form for supervised and semi-supervised learning problems, and
demonstrate its outstanding performance on image classification tasks.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2017 04:46:22 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Feb 2017 16:34:53 GMT'}, {'version': 'v3', 'created': 'Tue, 14 Feb 2017 16:34:28 GMT'}, {'version': 'v4', 'created': 'Mon, 6 Mar 2017 00:25:06 GMT'}, {'version': 'v5', 'created': 'Wed, 15 Mar 2017 06:44:32 GMT'}, {'version': 'v6', 'created': 'Mon, 19 Mar 2018 03:54:50 GMT'}]",2019-11-19,"[['Qi', 'Guo-Jun', '']]","['Generative Adversarial Nets (GANs)', 'Lipschitz regularity', 'Minimum Reconstruction Error (MRE)']"
16827,0909.3658,Narasimha Shashidhar,"Aggelos Kiayias, Yona Raekow, Alexander Russell, Narasimha Shashidhar",Efficient Steganography with Provable Security Guarantees,12 pages,,,,cs.CR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide a new provably-secure steganographic encryption protocol that is
proven secure in the complexity-theoretic framework of Hopper et al. The
fundamental building block of our steganographic encryption protocol is a
""one-time stegosystem"" that allows two parties to transmit messages of length
shorter than the shared key with information-theoretic security guarantees. The
employment of a pseudorandom generator (PRG) permits secure transmission of
longer messages in the same way that such a generator allows the use of
one-time pad encryption for messages longer than the key in symmetric
encryption. The advantage of our construction, compared to that of Hopper et
al., is that it avoids the use of a pseudorandom function family and instead
relies (directly) on a pseudorandom generator in a way that provides linear
improvement in the number of applications of the underlying one-way permutation
per transmitted bit. This advantageous trade-off is achieved by substituting
the pseudorandom function family employed in the previous construction with an
appropriate combinatorial construction that has been used extensively in
derandomization, namely almost t-wise independent function families.
","[{'version': 'v1', 'created': 'Sun, 20 Sep 2009 22:54:26 GMT'}]",2009-09-22,"[['Kiayias', 'Aggelos', ''], ['Raekow', 'Yona', ''], ['Russell', 'Alexander', ''], ['Shashidhar', 'Narasimha', '']]","['Information hiding', 'steganography', 'data hiding', 'steganalysis', 'covert communication']"
16828,1707.08308,Jean Kossaifi,"Jean Kossaifi, Zachary C. Lipton, Arinbjorn Kolbeinsson, Aran Khanna,
  Tommaso Furlanello, Anima Anandkumar",Tensor Regression Networks,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convolutional neural networks typically consist of many convolutional layers
followed by one or more fully connected layers. While convolutional layers map
between high-order activation tensors, the fully connected layers operate on
flattened activation vectors. Despite empirical success, this approach has
notable drawbacks. Flattening followed by fully connected layers discards
multilinear structure in the activations and requires many parameters. We
address these problems by incorporating tensor algebraic operations that
preserve multilinear structure at every layer. First, we introduce Tensor
Contraction Layers (TCLs) that reduce the dimensionality of their input while
preserving their multilinear structure using tensor contraction. Next, we
introduce Tensor Regression Layers (TRLs), which express outputs through a
low-rank multilinear mapping from a high-order activation tensor to an output
tensor of arbitrary order. We learn the contraction and regression factors
end-to-end, and produce accurate nets with fewer parameters. Additionally, our
layers regularize networks by imposing low-rank constraints on the activations
(TCL) and regression weights (TRL). Experiments on ImageNet show that, applied
to VGG and ResNet architectures, TCLs and TRLs reduce the number of parameters
compared to fully connected layers by more than 65% while maintaining or
increasing accuracy. In addition to the space savings, our approach's ability
to leverage topological structure can be crucial for structured data such as
MRI. In particular, we demonstrate significant performance improvements over
comparable architectures on three tasks associated with the UK Biobank dataset.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 07:37:57 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Nov 2017 16:40:06 GMT'}, {'version': 'v3', 'created': 'Tue, 24 Jul 2018 17:17:27 GMT'}, {'version': 'v4', 'created': 'Mon, 20 Jul 2020 22:11:36 GMT'}]",2020-07-22,"[['Kossaifi', 'Jean', ''], ['Lipton', 'Zachary C.', ''], ['Kolbeinsson', 'Arinbjorn', ''], ['Khanna', 'Aran', ''], ['Furlanello', 'Tommaso', ''], ['Anandkumar', 'Anima', '']]","['Machine Learning', 'Tensor Methods', 'Tensor Regression Networks', 'Low-RankRegression', 'Tensor Regression Layers', 'Deep Learning', 'Tensor Contraction']"
16829,1306.0424,Lionel Tabourier,"Abdelhamid Salah Brahim, Lionel Tabourier, B\'en\'edicte Le Grand","A data-driven analysis to question epidemic models for citation cascades
  on the blogosphere","18 pages, 9 figures, to be published in ICWSM-13 proceedings",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Citation cascades in blog networks are often considered as traces of
information spreading on this social medium. In this work, we question this
point of view using both a structural and semantic analysis of five months
activity of the most representative blogs of the french-speaking
community.Statistical measures reveal that our dataset shares many features
with those that can be found in the literature, suggesting the existence of an
identical underlying process. However, a closer analysis of the post content
indicates that the popular epidemic-like descriptions of cascades are
misleading in this context.A basic model, taking only into account the behavior
of bloggers and their restricted social network, accounts for several important
statistical features of the data.These arguments support the idea that
citations primary goal may not be information spreading on the blogosphere.
","[{'version': 'v1', 'created': 'Mon, 3 Jun 2013 14:17:54 GMT'}]",2013-06-04,"[['Brahim', 'Abdelhamid Salah', ''], ['Tabourier', 'Lionel', ''], ['Grand', 'Bénédicte Le', '']]","['blog network', 'citation cascades', 'information spreading', 'statistical analysis', 'epidemic models']"
16830,1607.02168,Andrew Adamatzky,"Simon Harding, Jan Koutnik, Klaus Greff, Jurgen Schmidhuber, Andy
  Adamatzky",Discovering Boolean Gates in Slime Mould,,,,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Slime mould of Physarum polycephalum is a large cell exhibiting rich spatial
non-linear electrical characteristics. We exploit the electrical properties of
the slime mould to implement logic gates using a flexible hardware platform
designed for investigating the electrical properties of a substrate (MECOBO).
We apply arbitrary electrical signals to `configure' the slime mould, i.e.
change shape of its body and, measure the slime mould's electrical response. We
show that it is possible to find configurations that allow the Physarum to act
as any 2-input Boolean gate. The occurrence frequency of the gates discovered
in the slime was analysed and compared to complexity hierarchies of logical
gates obtained in other unconventional materials. The search for gates was
performed by both sweeping across configurations in the real material as well
as training a neural network-based model and searching the gates therein using
gradient descent.
","[{'version': 'v1', 'created': 'Thu, 7 Jul 2016 20:47:05 GMT'}]",2016-07-11,"[['Harding', 'Simon', ''], ['Koutnik', 'Jan', ''], ['Greff', 'Klaus', ''], ['Schmidhuber', 'Jurgen', ''], ['Adamatzky', 'Andy', '']]","['Slime Mould', 'Physarum', 'Unconventional computing']"
16831,1210.0153,Wazir Zada Khan,"Mohammed Y Aalsalem, Wazir Zada Khan and Quratul Ain Arshad","A Low Cost Vision Based Hybrid Fiducial Mark Tracking Technique for
  Mobile Industrial Robots","6 pages, 7 figures","IJCSI International Journal of Computer Science Issues, Vol. 9,
  Issue 4, No 2, July 2012 ISSN (Online): 1694-0814 www.IJCSI.org",,,cs.CV cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The field of robotic vision is developing rapidly. Robots can react
intelligently and provide assistance to user activities through sentient
computing. Since industrial applications pose complex requirements that cannot
be handled by humans, an efficient low cost and robust technique is required
for the tracking of mobile industrial robots. The existing sensor based
techniques for mobile robot tracking are expensive and complex to deploy,
configure and maintain. Also some of them demand dedicated and often expensive
hardware. This paper presents a low cost vision based technique called Hybrid
Fiducial Mark Tracking (HFMT) technique for tracking mobile industrial robot.
HFMT technique requires off-the-shelf hardware (CCD cameras) and printable 2-D
circular marks used as fiducials for tracking a mobile industrial robot on a
pre-defined path. This proposed technique allows the robot to track on a
predefined path by using fiducials for the detection of Right and Left turns on
the path and White Strip for tracking the path. The HFMT technique is
implemented and tested on an indoor mobile robot at our laboratory.
Experimental results from robot navigating in real environments have confirmed
that our approach is simple and robust and can be adopted in any hostile
industrial environment where humans are unable to work.
","[{'version': 'v1', 'created': 'Sat, 29 Sep 2012 22:00:19 GMT'}]",2012-10-02,"[['Aalsalem', 'Mohammed Y', ''], ['Khan', 'Wazir Zada', ''], ['Arshad', 'Quratul Ain', '']]","['Context-Aware Computing', 'Mobile Robots Path Tracking', 'Fiducial Detection', 'Computer Vision', 'Autonomous Robot Navigation']"
16832,1002.1955,Rdv Ijcsis,"K. K. Guatam, Anurag Rai,","Performance Modeling and Evaluation of Traffic management for Mobile
  Networks by SINR Prediction","IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS January 2010, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 7, No. 1, pp. 92-94, January 2010, USA",,"Journal of Computer Science, ISSN 1947 5500",cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the recent years a considerable amount of effort has been devoted
towards the performance evaluation and prediction of Mobile Networks.
Performance modeling and evaluation of mobile networks are very important in
view of their ever expending usage and the multiplicity of their component
parts together with the complexity of their functioning. The present paper
addresses current issues in traffic management and congestion control by
(signal to interference plus noise ratio) SINR prediction congestion control,
routing and optimization of cellular mobile networks.
","[{'version': 'v1', 'created': 'Tue, 9 Feb 2010 19:58:07 GMT'}]",2010-02-10,"[['Guatam', 'K. K.', ''], ['Rai', 'Anurag', '']]","['Mobile Networks', 'Modeling', 'call admission control', 'QoS (Quality of Service) SINR']"
16833,1603.06995,Zhicheng Cui,Zhicheng Cui and Wenlin Chen and Yixin Chen,Multi-Scale Convolutional Neural Networks for Time Series Classification,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Time series classification (TSC), the problem of predicting class labels of
time series, has been around for decades within the community of data mining
and machine learning, and found many important applications such as biomedical
engineering and clinical prediction. However, it still remains challenging and
falls short of classification accuracy and efficiency. Traditional approaches
typically involve extracting discriminative features from the original time
series using dynamic time warping (DTW) or shapelet transformation, based on
which an off-the-shelf classifier can be applied. These methods are ad-hoc and
separate the feature extraction part with the classification part, which limits
their accuracy performance. Plus, most existing methods fail to take into
account the fact that time series often have features at different time scales.
To address these problems, we propose a novel end-to-end neural network model,
Multi-Scale Convolutional Neural Networks (MCNN), which incorporates feature
extraction and classification in a single framework. Leveraging a novel
multi-branch layer and learnable convolutional layers, MCNN automatically
extracts features at different scales and frequencies, leading to superior
feature representation. MCNN is also computationally efficient, as it naturally
leverages GPU computing. We conduct comprehensive empirical evaluation with
various existing methods on a large number of benchmark datasets, and show that
MCNN advances the state-of-the-art by achieving superior accuracy performance
than other leading methods.
","[{'version': 'v1', 'created': 'Tue, 22 Mar 2016 21:37:33 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Apr 2016 04:51:24 GMT'}, {'version': 'v3', 'created': 'Wed, 20 Apr 2016 18:58:29 GMT'}, {'version': 'v4', 'created': 'Wed, 11 May 2016 04:48:21 GMT'}]",2016-05-12,"[['Cui', 'Zhicheng', ''], ['Chen', 'Wenlin', ''], ['Chen', 'Yixin', '']]","['Time series classification', 'deep learning', 'convolutional neural network']"
16834,1602.07591,Jose Alvaro Perez Gonzalez,"Jose Alvaro Perez, Thomas Loquen, Daniel Alazard and Christelle Pittet","Linear Modeling of a Flexible Substructure Actuated through
  Piezoelectric Components for Use in Integrated Control/Structure Design",submitted to IFAC ACA 2016,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study presents a generic TITOP (Two-Input Two-Output Port) model of a
substructure actuated with embedded piezoelectric materials as actuators
(PEAs), previously modeled with the FE technique. This allows intuitive
assembly of actuated flexible substructures in large flexible multi-body
systems. The modeling technique is applied to an illustrative example of a
flexible beam with bonded piezoelectric strip and vibration attenuation of a
chain of flexible beams.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2016 16:53:24 GMT'}]",2016-02-25,"[['Perez', 'Jose Alvaro', ''], ['Loquen', 'Thomas', ''], ['Alazard', 'Daniel', ''], ['Pittet', 'Christelle', '']]","['Finite Element', 'Piezoelectric actuators and sensors (PEAs)', 'Multi-body FlexibleStructures', 'Flexible Structures Control', 'TITOP modeling']"
16835,1205.2726,David Leoni,David Leoni,Non-Interactive Differential Privacy: a Survey,"Presented at the First International Workshop On Open Data, WOD-2012
  (http://arxiv.org/abs/1204.3726)",,,WOD/2012/NANTES/12,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  OpenData movement around the globe is demanding more access to information
which lies locked in public or private servers. As recently reported by a
McKinsey publication, this data has significant economic value, yet its release
has potential to blatantly conflict with people privacy. Recent UK government
inquires have shown concern from various parties about publication of
anonymized databases, as there is concrete possibility of user identification
by means of linkage attacks. Differential privacy stands out as a model that
provides strong formal guarantees about the anonymity of the participants in a
sanitized database. Only recent results demonstrated its applicability on
real-life datasets, though. This paper covers such breakthrough discoveries, by
reviewing applications of differential privacy for non-interactive publication
of anonymized real-life datasets. Theory, utility and a data-aware comparison
are discussed on a variety of principles and concrete applications.
","[{'version': 'v1', 'created': 'Fri, 11 May 2012 21:38:16 GMT'}]",2012-05-15,"[['Leoni', 'David', '']]","['Anonymization', 'Differential privacy', 'Survey']"
16836,0910.1014,Pierrick Tranouez,"Pierrick Tranouez (LITIS), Antoine Dutot (LITIS)",Building upon Fast Multipole Methods to Detect and Model Organizations,,"DCDIS Series B: Applications & Algorithms 16, 4 (2009) 489 - 500",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many models in natural and social sciences are comprised of sets of
inter-acting entities whose intensity of interaction decreases with distance.
This often leads to structures of interest in these models composed of dense
packs of entities. Fast Multipole Methods are a family of methods developed to
help with the calculation of a number of computable models such as described
above. We propose a method that builds upon FMM to detect and model the dense
structures of these systems.
","[{'version': 'v1', 'created': 'Tue, 6 Oct 2009 14:19:56 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Oct 2009 08:35:15 GMT'}]",2009-10-08,"[['Tranouez', 'Pierrick', '', 'LITIS'], ['Dutot', 'Antoine', '', 'LITIS']]","['Organization detection', 'structure management', 'multiscale', 'N body systems', 'hierarchical tree code approximations']"
16837,1702.01460,Piotr Szyma\'nski,"Piotr Szyma\'nski, Tomasz Kajdanowicz","A scikit-based Python environment for performing multi-label
  classification",,,,,cs.LG cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  scikit-multilearn is a Python library for performing multi-label
classification. The library is compatible with the scikit/scipy ecosystem and
uses sparse matrices for all internal operations. It provides native Python
implementations of popular multi-label classification methods alongside a novel
framework for label space partitioning and division. It includes modern
algorithm adaptation methods, network-based label space division approaches,
which extracts label dependency information and multi-label embedding
classifiers. It provides python wrapped access to the extensive multi-label
method stack from Java libraries and makes it possible to extend deep learning
single-label methods for multi-label tasks. The library allows multi-label
stratification and data set management. The implementation is more efficient in
problem transformation than other established libraries, has good test coverage
and follows PEP8. Source code and documentation can be downloaded from
http://scikit.ml and also via pip. The library follows BSD licensing scheme.
","[{'version': 'v1', 'created': 'Sun, 5 Feb 2017 22:28:20 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Feb 2017 17:28:44 GMT'}, {'version': 'v3', 'created': 'Thu, 9 Feb 2017 15:03:23 GMT'}, {'version': 'v4', 'created': 'Fri, 7 Dec 2018 10:39:48 GMT'}, {'version': 'v5', 'created': 'Mon, 10 Dec 2018 15:01:50 GMT'}]",2018-12-11,"[['Szymański', 'Piotr', ''], ['Kajdanowicz', 'Tomasz', '']]","['Python', 'multi-label classification', 'label-space clustering', 'multi-label embedding', 'multi-label stratification']"
16838,1111.5654,Ben Y. Zhao,"Gang Wang, Christo Wilson, Xiaohan Zhao, Yibo Zhu, Manish Mohanlal,
  Haitao Zheng and Ben Y. Zhao",Serf and Turf: Crowdturfing for Fun and Profit,"Proceedings of WWW 2012 Conference, 10 pages, 23 figures, 4 tables",,,,cs.SI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Popular Internet services in recent years have shown that remarkable things
can be achieved by harnessing the power of the masses using crowd-sourcing
systems. However, crowd-sourcing systems can also pose a real challenge to
existing security mechanisms deployed to protect Internet services. Many of
these techniques make the assumption that malicious activity is generated
automatically by machines, and perform poorly or fail if users can be organized
to perform malicious tasks using crowd-sourcing systems. Through measurements,
we have found surprising evidence showing that not only do malicious
crowd-sourcing systems exist, but they are rapidly growing in both user base
and total revenue. In this paper, we describe a significant effort to study and
understand these ""crowdturfing"" systems in today's Internet. We use detailed
crawls to extract data about the size and operational structure of these
crowdturfing systems. We analyze details of campaigns offered and performed in
these sites, and evaluate their end-to-end effectiveness by running active,
non-malicious campaigns of our own. Finally, we study and compare the source of
workers on crowdturfing sites in different countries. Our results suggest that
campaigns on these systems are highly effective at reaching users, and their
continuing growth poses a concrete threat to online communities such as social
networks, both in the US and elsewhere.
","[{'version': 'v1', 'created': 'Thu, 24 Nov 2011 00:06:58 GMT'}, {'version': 'v2', 'created': 'Fri, 18 May 2012 23:09:12 GMT'}]",2012-05-22,"[['Wang', 'Gang', ''], ['Wilson', 'Christo', ''], ['Zhao', 'Xiaohan', ''], ['Zhu', 'Yibo', ''], ['Mohanlal', 'Manish', ''], ['Zheng', 'Haitao', ''], ['Zhao', 'Ben Y.', '']]","['Crowdturfing', 'Crowdsourcing', 'Spam', 'Sybils', 'Experimentation']"
16839,1305.0939,Debajyoti Mukhopadhyay Prof.,"Debajyoti Mukhopadhyay, Manoj Sharma, Gajanan Joshi, Trupti Pagare,
  Adarsha Palwe",Intelligent Agent Based Semantic Web in Cloud Computing Environment,"10 pages, 10 figures",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Considering today's web scenario, there is a need of effective and meaningful
search over the web which is provided by Semantic Web. Existing search engines
are keyword based. They are vulnerable in answering intelligent queries from
the user due to the dependence of their results on information available in web
pages. While semantic search engines provides efficient and relevant results as
the semantic web is an extension of the current web in which information is
given well defined meaning. MetaCrawler is a search tool that uses several
existing search engines and provides combined results by using their own page
ranking algorithm. This paper proposes development of a meta-semantic-search
engine called SemanTelli which works within cloud. SemanTelli fetches results
from different semantic search engines such as Hakia, DuckDuckGo, SenseBot with
the help of intelligent agents that eliminate the limitations of existing
search engines.
","[{'version': 'v1', 'created': 'Sat, 4 May 2013 17:22:12 GMT'}]",2013-05-07,"[['Mukhopadhyay', 'Debajyoti', ''], ['Sharma', 'Manoj', ''], ['Joshi', 'Gajanan', ''], ['Pagare', 'Trupti', ''], ['Palwe', 'Adarsha', '']]","['SemanTelli', 'Intelligent Agent', 'Semantic Web', 'Cloud Computing', 'MetaCrawler', 'Semantic Search']"
16840,1610.03660,Yihong Wu,"Yihong Wu, Fulin Tang, Heping Li",Image Based Camera Localization: an Overview,,"Invited Paper by Visual Computing for Industry, Biomedicine and
  Art, 2018",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, virtual reality, augmented reality, robotics, autonomous driving et
al attract much attention of both academic and industrial community, in which
image based camera localization is a key task. However, there has not been a
complete review on image-based camera localization. It is urgent to map this
topic to help people enter the field quickly. In this paper, an overview of
image based camera localization is presented. A new and complete kind of
classifications for image based camera localization is provided and the related
techniques are introduced. Trends for the future development are also
discussed. It will be useful to not only researchers but also engineers and
other people interested.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2016 10:19:36 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Dec 2017 08:43:29 GMT'}, {'version': 'v3', 'created': 'Tue, 17 Apr 2018 09:55:59 GMT'}, {'version': 'v4', 'created': 'Thu, 3 May 2018 11:09:03 GMT'}]",2018-05-04,"[['Wu', 'Yihong', ''], ['Tang', 'Fulin', ''], ['Li', 'Heping', '']]","['PnP problem', 'SLAM', 'Camera localization', 'Camera pose determination  1']"
16841,1204.5373,Chris De Vries,Shlomo Geva and Christopher M. De Vries,TopSig: Topology Preserving Document Signatures,"12 pages, 8 figures, CIKM 2011",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Performance comparisons between File Signatures and Inverted Files for text
retrieval have previously shown several significant shortcomings of file
signatures relative to inverted files. The inverted file approach underpins
most state-of-the-art search engine algorithms, such as Language and
Probabilistic models. It has been widely accepted that traditional file
signatures are inferior alternatives to inverted files. This paper describes
TopSig, a new approach to the construction of file signatures. Many advances in
semantic hashing and dimensionality reduction have been made in recent times,
but these were not so far linked to general purpose, signature file based,
search engines. This paper introduces a different signature file approach that
builds upon and extends these recent advances. We are able to demonstrate
significant improvements in the performance of signature file based indexing
and retrieval, performance that is comparable to that of state of the art
inverted file based systems, including Language models and BM25. These findings
suggest that file signatures offer a viable alternative to inverted files in
suitable settings and from the theoretical perspective it positions the file
signatures model in the class of Vector Space retrieval models.
","[{'version': 'v1', 'created': 'Tue, 24 Apr 2012 13:36:39 GMT'}]",2012-04-25,"[['Geva', 'Shlomo', ''], ['De Vries', 'Christopher M.', '']]","['Signature Files', 'Random Indexing', 'Topology', 'Quantisation', 'Vector Space IR', 'Search Engines', 'Document Clustering', 'Document Signatures']"
16842,1403.7991,Mirtha Lina Fern\'andez Venero,Mirtha Lina Fern\'andez Venero and Fl\'avio Soares Corr\^ea da Silva,A general translation from nested Petri nets into PROMELA,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nested Petri nets have been applied for modeling interaction protocols,
mobility, adaptive systems and interorganizational workflows. However, few
results have been reported on the use of automated tools for analyzing the
behavior of these nets. In this paper we present a general translation from
nested Petri nets into PROMELA and explain how some properties of these nets
can be studied using SPIN model checker. Besides, we discuss how to deal with
the main limitations that may influence SPIN performance when verifying
practical examples.
","[{'version': 'v1', 'created': 'Mon, 31 Mar 2014 13:34:44 GMT'}]",2014-04-01,"[['Venero', 'Mirtha Lina Fernández', ''], ['da Silva', 'Flávio Soares Corrêa', '']]","['nested Petri nets', 'model checking', 'SPIN']"
16843,1506.00128,Pedro Quaresma,Pedro Quaresma and Vanda Santos and Milena Mari\'c,A Web Environment for Geometry,"CICM 2015, Conference on Intelligent Computer Mathematics
  (Work-in-Progress track), July 13-17, 2015, Washington DC, USA",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Web Geometry Laboratory, (WGL), is a blended-learning, collaborative and
adaptive, Web environment for geometry. It integrates a well known dynamic
geometry system. In a collaborative session, exchange of geometrical and
textual information between the user engaged in the session is possible. In a
normal work session (stand-alone mode), all the geometric steps done by the
students are recorded, alongside the navigation information, allowing, in a
latter stage, their teachers to ""play back"" the students sessions, using that
info to assert the students level and adjust the teaching strategies to each
individual student. Teachers can register and begin using one of the public
servers, defining students, preparing materials to be released to the students,
open collaborative sessions, etc. Using an action research methodology the WGL
system is being developed, validated through case-studies, and further
improved, in a cycle where the implementation steps are intertwined with case
studies.
","[{'version': 'v1', 'created': 'Sat, 30 May 2015 15:27:53 GMT'}]",2015-06-02,"[['Quaresma', 'Pedro', ''], ['Santos', 'Vanda', ''], ['Marić', 'Milena', '']]","['adaptive learning', 'collaborative learning', 'blended-learning', 'dynamic geometry']"
16844,1409.6678,Anant Bhardwaj,"Anant Bhardwaj, Dave Luciano, and Scott Klemmer","Redprint: Integrating API specific ""instant example"" and ""instant
  documentation"" display interface in IDEs",UIST 2011,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software libraries for most of the modern programming languages are numerous,
large and complex. Remembering the syntax and usage of APIs is a difficult task
for not just novices but also expert programmers. IDEs (Integrated Development
Environment) provide capabilities like autocomplete and intellisense to assist
programmers; however, programmers still need to visit search engines like
Google to find API (Application Program Interface) documentation and samples.
This paper evaluates Redprint - a browser based development environment for PHP
that integrates API specific ""Instant Example"" and ""Instant Documentation""
display interfaces. A comparative laboratory study shows that integrating API
specific ""Instant Example"" and ""Instant Documentation"" display interfaces into
a development environment significantly reduces the cost of searching and thus
significantly reduces the time to develop software.
","[{'version': 'v1', 'created': 'Tue, 23 Sep 2014 17:42:31 GMT'}]",2014-09-24,"[['Bhardwaj', 'Anant', ''], ['Luciano', 'Dave', ''], ['Klemmer', 'Scott', '']]","['Redprint', 'instant example display interface', 'instant documentation display interface', 'example centric programming']"
16845,1403.2294,Sergey Nikolaev,Sergei Nikolaev,"Non-linear mass-spring system for large soft tissue deformations
  modeling","9 pages, 2 figures, 4 charts","Scientific and Technical Journal of Information Technologies,
  Mechanics and Optics 5(87) (2013) 88-94",,,cs.NA physics.comp-ph,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Implant placement under soft tissues operation is described. In this
operation tissues can reach such deformations that nonlinear properties are
appeared. A mass-spring model modification for modeling nonlinear tissue
operation is developed. A method for creating elasticity module using splines
is described. For Poisson ratio different stiffness for different types of
springs in cubic grid is used. For stiffness finding an equation system that
described material tension is solved. The model is verified with quadratic
sample tension experiment. These tests show that sample tension under external
forces is equal to defined nonlinear elasticity module. The accuracy of Poisson
ratio modeling is thirty five percent that is better the results of available
ratio modeling method.
","[{'version': 'v1', 'created': 'Mon, 10 Mar 2014 16:34:40 GMT'}]",2014-03-11,"[['Nikolaev', 'Sergei', '']]","['mass-spring model', 'material tension', 'nonlinear elasticity module', 'Poissonratio', 'soft tissues charts']"
16846,1603.04298,Matthijs V\'ak\'ar,Matthijs V\'ak\'ar,An Effectful Treatment of Dependent Types,arXiv admin note: substantial text overlap with arXiv:1512.08009,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We extend Levy's call-by-push-value (CBPV) analysis from simple to dependent
type theory (DTT) in order to study the interaction between computational
effects and dependent types. We define the naive system of dependently typed
CBPV, dCBPV-, and its extension with a principle of Kleisli extensions for
dependent functions, dCBPV+. We investigate these systems from the points of
view of syntax, categorical semantics, concrete models and operational
semantics, in presence of a range of effects. We observe that, while the
expressive power of dCBPV+ is needed if we want well-defined call-by-value
(CBV) and call-by-name (CBN) translations of DTT, it is a less straightforward
system than dCBPV-, in presence of some effects. Indeed, to be able to
construct specific models and to retain the subject reduction property in the
operational semantics, we are required to impose certain subtyping conditions,
the idea being that the type of a computation may only become more (not less)
specified as certain effects are executed.
","[{'version': 'v1', 'created': 'Mon, 14 Mar 2016 15:09:42 GMT'}]",2016-03-15,"[['Vákár', 'Matthijs', '']]","['Dependent types', 'effects', 'call-by-push-value', 'linear dependent types']"
16847,1002.1300,Mukul Agarwal,"Mukul Agarwal, Sanjoy Mitter","Architecture for communication with a fidelity criterion in unknown
  networks",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove that in order to communicate independent sources (this is the
unicast problem) between various users over an unknown medium to within various
distortion levels, it is sufficient to consider source-channel separation based
architectures: architectures which first compress the sources to within the
corresponding distortion levels followed by reliable communication over the
unknown medium. We are reducing the problem of universal rate-distortion
communication of independent sources over a network to the universal reliable
communication problem over networks. This is a reductionist view. We are not
solving the reliable communication problem in networks.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 17:21:42 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Jan 2011 03:57:20 GMT'}]",2011-01-24,"[['Agarwal', 'Mukul', ''], ['Mitter', 'Sanjoy', '']]","['Source-channel separation', 'rate-distortion', 'digital communication', 'communication networks']"
16848,1010.5421,Subhash Kak,Subhash Kak,On the Mesh Array for Matrix Multiplication,6 pages,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents new properties of the mesh array for matrix
multiplication. In contrast to the standard array that requires 3n-2 steps to
complete its computation, the mesh array requires only 2n-1 steps. Symmetries
of the mesh array computed values are presented which enhance the efficiency of
the array for specific applications. In multiplying symmetric matrices, the
results are obtained in 3n/2+1 steps. The mesh array is examined for its
application as a scrambling system.
","[{'version': 'v1', 'created': 'Tue, 26 Oct 2010 15:10:37 GMT'}]",2015-03-17,"[['Kak', 'Subhash', '']]","['Matrix multiplication', 'systolic arrays', 'scrambling systems']"
16849,1009.3134,Kostas Tsichlas,"G.S. Brodal, S. Sioutas, K. Tsichlas, and C. Zaroliagis",D$^2$-Tree: A New Overlay with Deterministic Bounds,,,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new overlay, called the {\em Deterministic Decentralized tree}
($D^2$-tree). The $D^2$-tree compares favourably to other overlays for the
following reasons: (a) it provides matching and better complexities, which are
deterministic for the supported operations; (b) the management of nodes (peers)
and elements are completely decoupled from each other; and (c) an efficient
deterministic load-balancing mechanism is presented for the uniform
distribution of elements into nodes, while at the same time probabilistic
optimal bounds are provided for the congestion of operations at the nodes. The
load-balancing scheme of elements into nodes is deterministic and general
enough to be applied to other hierarchical tree-based overlays. This
load-balancing mechanism is based on an innovative lazy weight-balancing
mechanism, which is interesting in its own right.
","[{'version': 'v1', 'created': 'Thu, 16 Sep 2010 10:11:04 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Mar 2012 20:05:39 GMT'}]",2012-03-09,"[['Brodal', 'G. S.', ''], ['Sioutas', 'S.', ''], ['Tsichlas', 'K.', ''], ['Zaroliagis', 'C.', '']]","['Overlay', 'indexing scheme', 'decentralized system', 'distributed data structure', 'load-balancing']"
16850,1002.4784,Rong Xiao,"Changbo Chen, James H. Davenport, John P. May, Marc Moreno Maza, Bican
  Xia, and Rong Xiao",Triangular Decomposition of Semi-algebraic Systems,"8 pages, accepted by ISSAC 2010",,,,cs.SC cs.CG cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Regular chains and triangular decompositions are fundamental and
well-developed tools for describing the complex solutions of polynomial
systems. This paper proposes adaptations of these tools focusing on solutions
of the real analogue: semi-algebraic systems. We show that any such system can
be decomposed into finitely many {\em regular semi-algebraic systems}. We
propose two specifications of such a decomposition and present corresponding
algorithms. Under some assumptions, one type of decomposition can be computed
in singly exponential time w.r.t.\ the number of variables. We implement our
algorithms and the experimental results illustrate their effectiveness.
","[{'version': 'v1', 'created': 'Thu, 25 Feb 2010 13:39:09 GMT'}, {'version': 'v2', 'created': 'Thu, 13 May 2010 20:21:31 GMT'}]",2010-05-17,"[['Chen', 'Changbo', ''], ['Davenport', 'James H.', ''], ['May', 'John P.', ''], ['Maza', 'Marc Moreno', ''], ['Xia', 'Bican', ''], ['Xiao', 'Rong', '']]","['regular semi-algebraic system', 'regular chain', 'triangular decomposition', 'border polynomial', 'fingerprint polynomial set']"
16851,1004.0594,Secretary Aircc Journal,"Mohammed Misbahuddin, Sachin Narayanan and Bishwa Ranjan Ghosh",Dynamic IDP Signature processing by fast elimination using DFA,10Pages,"International Journal of Network Security & Its Applications 1.2
  (2009) 29-38",,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Intrusion Detection & Prevention Systems generally aims at detecting /
preventing attacks against Information systems and networks. The basic task of
IDPS is to monitor network & system traffic for any malicious packets/patterns
and hence to prevent any unwarranted incidents which leads the systems to
insecure state. The monitoring is done by checking each packet for its validity
against the signatures formulated for identified vulnerabilities. Since,
signatures are the heart & soul of an Intrusion Detection and Prevention System
(IDPS), we, in this paper, discuss two methodologies we adapted in our research
effort to improve the current Intrusion Detection and Prevention (IDP) systems.
The first methodology RUDRAA is for formulating, verifying & validating the
potential signatures to be used with IDPS. The second methodology DSP-FED is
aimed at processing the signatures in less time with our proposed fast
elimination method using DFA. The research objectives of this project are 1) To
formulate & process potential IPS signatures to be used with Intrusion
prevention system. 2) To propose a DFA based approach for signature processing
which, upon a pattern match, could process the signatures faster else could
eliminate it efficiently if not matched
","[{'version': 'v1', 'created': 'Mon, 5 Apr 2010 08:48:54 GMT'}]",2010-07-15,"[['Misbahuddin', 'Mohammed', ''], ['Narayanan', 'Sachin', ''], ['Ghosh', 'Bishwa Ranjan', '']]","['Intrusion Detection / Prevention Systems', 'Signature Formulation', 'signature processing', 'Vulnerability', 'DFA']"
16852,1304.3112,Masaki Togai,"Masaki Togai, Hiroyuki Watanabe",A VLSI Design and Implementation for a Real-Time Approximate Reasoning,"Appears in Proceedings of the Second Conference on Uncertainty in
  Artificial Intelligence (UAI1986)",,,UAI-P-1986-PG-289-296,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The role of inferencing with uncertainty is becoming more important in
rule-based expert systems (ES), since knowledge given by a human expert is
often uncertain or imprecise. We have succeeded in designing a VLSI chip which
can perform an entire inference process based on fuzzy logic. The design of the
VLSI fuzzy inference engine emphasizes simplicity, extensibility, and
efficiency (operational speed and layout area). It is fabricated in 2.5 um CMOS
technology. The inference engine consists of three major components; a rule set
memory, an inference processor, and a controller. In this implementation, a
rule set memory is realized by a read only memory (ROM). The controller
consists of two counters. In the inference processor, one data path is laid out
for each rule. The number of the inference rule can be increased adding more
data paths to the inference processor. All rules are executed in parallel, but
each rule is processed serially. The logical structure of fuzzy inference
proposed in the current paper maps nicely onto the VLSI structure. A two-phase
nonoverlapping clocking scheme is used. Timing tests indicate that the
inference engine can operate at approximately 20.8 MHz. This translates to an
execution speed of approximately 80,000 Fuzzy Logical Inferences Per Second
(FLIPS), and indicates that the inference engine is suitable for a demanding
real-time application. The potential applications include decision-making in
the area of command and control for intelligent robot systems, process control,
missile and aircraft guidance, and other high performance machines.
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2013 19:54:27 GMT'}]",2013-04-12,"[['Togai', 'Masaki', ''], ['Watanabe', 'Hiroyuki', '']]","['fuzzy logic', 'expert system', 'semiconductor (VLSI)']"
16853,1209.5567,Qingyin Li,Qingyin Li and William Zhu,"Closed-set lattice of regular sets based on a serial and transitive
  relation through matroids",12 pages,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rough sets are efficient for data pre-processing in data mining. Matroids are
based on linear algebra and graph theory, and have a variety of applications in
many fields. Both rough sets and matroids are closely related to lattices. For
a serial and transitive relation on a universe, the collection of all the
regular sets of the generalized rough set is a lattice. In this paper, we use
the lattice to construct a matroid and then study relationships between the
lattice and the closed-set lattice of the matroid. First, the collection of all
the regular sets based on a serial and transitive relation is proved to be a
semimodular lattice. Then, a matroid is constructed through the height function
of the semimodular lattice. Finally, we propose an approach to obtain all the
closed sets of the matroid from the semimodular lattice. Borrowing from
matroids, results show that lattice theory provides an interesting view to
investigate rough sets.
","[{'version': 'v1', 'created': 'Tue, 25 Sep 2012 10:36:27 GMT'}, {'version': 'v2', 'created': 'Sat, 14 Dec 2013 14:53:48 GMT'}]",2013-12-17,"[['Li', 'Qingyin', ''], ['Zhu', 'William', '']]","['Rough set', 'Regular set', 'Semimodular lattice', 'Height function', 'Matroid', 'Independent set', 'Rank function', 'Closed-set lattice']"
16854,1205.1639,Sajilal Divakaran,Sajilal Divakaran,"Spectral Analysis of Projection Histogram for Enhancing Close matching
  character Recognition in Malayalam",,,,,cs.CL cs.CV cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The success rates of Optical Character Recognition (OCR) systems for printed
Malayalam documents is quite impressive with the state of the art accuracy
levels in the range of 85-95% for various. However for real applications,
further enhancement of this accuracy levels are required. One of the bottle
necks in further enhancement of the accuracy is identified as close-matching
characters. In this paper, we delineate the close matching characters in
Malayalam and report the development of a specialised classifier for these
close-matching characters. The output of a state of the art of OCR is taken and
characters falling into the close-matching character set is further fed into
this specialised classifier for enhancing the accuracy. The classifier is based
on support vector machine algorithm and uses feature vectors derived out of
spectral coefficients of projection histogram signals of close-matching
characters.
","[{'version': 'v1', 'created': 'Tue, 8 May 2012 09:25:14 GMT'}]",2012-05-09,"[['Divakaran', 'Sajilal', '']]","['OCR', 'Malayalam', 'Close-matching Characters', 'Feature Extraction', 'Pattern Classification']"
16855,1307.2915,Woo-Cheol Kim Dr.,"Woo-Cheol Kim, Changryong Baek, Dongwon Lee",Measuring the Optimality of Hadoop Optimization,,,,,cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, much research has focused on how to optimize Hadoop jobs.
Their approaches are diverse, ranging from improving HDFS and Hadoop job
scheduler to optimizing parameters in Hadoop configurations. Despite their
success in improving the performance of Hadoop jobs, however, very little is
known about the limit of their optimization performance. That is, how optimal
is a given Hadoop optimization? When a Hadoop optimization method X improves
the performance of a job by Y %, how do we know if this improvement is as good
as it can be? To answer this question, in this paper, we first examine the
ideal best case, the lower bound, of running time for Hadoop jobs and develop a
measure to accurately estimate how optimal a given Hadoop optimization is with
respect to the lower bound. Then, we demonstrate how one may exploit the
proposed measure to improve the optimization of Hadoop jobs.
","[{'version': 'v1', 'created': 'Wed, 10 Jul 2013 20:39:24 GMT'}]",2013-07-12,"[['Kim', 'Woo-Cheol', ''], ['Baek', 'Changryong', ''], ['Lee', 'Dongwon', '']]","['Hadoop optimization', 'Optimization measure', 'Performance profiling', 'Map Reduce']"
16856,1111.1586,Abarna Sundaramurthy,"Thirumaran.M, Dhavachelvan.P, Aranganayagi.G and S.Abarna","Evaluation of Computability Criterions for Runtime Web Service
  Integration",16 pages,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today's competitive environment drives the enterprises to extend their focus
and collaborate with their business partners to carry out the necessities.
Tight coordination among business partners assists to share and integrate the
service logic globally. But integrating service logics across diverse
enterprises leads to exponential problem which stipulates developers to
comprehend the whole service and must resolve suitable method to integrate the
services. It is complex and time-consuming task. So the present focus is to
have a mechanized system to analyze the Business logics and convey the proper
mode to integrate them. There is no standard model to undertake these issues
and one such a framework proposed in this paper examines the Business logics
individually and suggests proper structure to integrate them. One of the
innovative concepts of proposed model is Property Evaluation System which
scrutinizes the service logics and generates Business Logic Property Schema
(BLPS) for the required services. BLPS holds necessary information to recognize
the correct structure for integrating the service logics. At the time of
integration, System consumes this BLPS schema and suggests the feasible ways to
integrate the service logics. Also if the service logics are attempted to
integrate in invalid structure or attempted to violate accessibility levels,
system will throw exception with necessary information. This helps developers
to ascertain the efficient structure to integrate the services with least
effort.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2011 14:12:44 GMT'}]",2015-03-13,"[['M', 'Thirumaran.', ''], ['P', 'Dhavachelvan.', ''], ['G', 'Aranganayagi.', ''], ['Abarna', 'S.', '']]","['Business Logic Model', 'Service Integration', 'Business Logic Property Evaluation System', 'Computability', 'Traceability Evaluation']"
16857,0712.1519,Stephane Le Roux,St\'ephane Le Roux (LIP),Discrete Nondeterminism and Nash Equilibria for Strategy-Based Games,,,,,cs.GT,,"  Several notions of game enjoy a Nash-like notion of equilibrium without
guarantee of existence. There are different ways of weakening a definition of
Nash-like equilibrium in order to guarantee the existence of a weakened
equilibrium. Nash's approach to the problem for strategic games is
probabilistic, \textit{i.e.} continuous, and static. CP and BR approaches for
CP and BR games are discrete and dynamic. This paper proposes an approach that
lies between those two different approaches: a discrete and static approach.
multi strategic games are introduced as a formalism that is able to express
both sequential and simultaneous decision-making, which promises a good
modelling power. multi strategic games are a generalisation of strategic games
and sequential graph games that still enjoys a Cartesian product structure,
\textit{i.e.} where agent actually choose their strategies. A pre-fixed point
result allows guaranteeing existence of discrete and non deterministic
equilibria. On the one hand, these equilibria can be computed with polynomial
(low) complexity. On the other hand, they are effective in terms of
recommendation, as shown by a numerical example.
","[{'version': 'v1', 'created': 'Mon, 10 Dec 2007 15:53:54 GMT'}]",2007-12-11,"[['Roux', 'Stéphane Le', '', 'LIP']]","['Abstract strategic games', 'Nash equilibrium', 'discrete non-determinism', 'discrete equilibrium', 'constructive', 'fixed-point', 'multi-strategic games']"
16858,1802.07324,Upulee Kanewala,Bonnie Hardin and Upulee Kanewala,Using Semi-Supervised Learning for Predicting Metamorphic Relations,,,,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Software testing is difficult to automate, especially in programs which have
no oracle, or method of determining which output is correct. Metamorphic
testing is a solution this problem. Metamorphic testing uses metamorphic
relations to define test cases and expected outputs. A large amount of time is
needed for a domain expert to determine which metamorphic relations can be used
to test a given program. Metamorphic relation prediction removes this need for
such an expert. We propose a method using semi-supervised machine learning to
detect which metamorphic relations are applicable to a given code base. We
compare this semi-supervised model with a supervised model, and show that the
addition of unlabeled data improves the classification accuracy of the MR
prediction model.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 20:58:17 GMT'}]",2018-02-22,"[['Hardin', 'Bonnie', ''], ['Kanewala', 'Upulee', '']]","['Metamorphic Testing', 'Metamorphic Relations', 'Machine Learning', 'Semi-Supervised Learning']"
16859,1502.03918,Smitha M.L.,"B.H. Shekar, Smitha M.L","Gradient Difference based approach for Text Localization in Compressed
  domain","11 pages, Second International Conference on Emerging Research in
  Computing, Information, Communications and Applications, Elsevier
  Publications, ISBN: 9789351072638, vol. III, pp: 299-308, held at NMIT,
  Bangalore August 2014",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a gradient difference based approach to text
localization in videos and scene images. The input video frame/ image is first
compressed using multilevel 2-D wavelet transform. The edge information of the
reconstructed image is found which is further used for finding the maximum
gradient difference between the pixels and then the boundaries of the detected
text blocks are computed using zero crossing technique. We perform logical AND
operation of the text blocks obtained by gradient difference and the zero
crossing technique followed by connected component analysis to eliminate the
false positives. Finally, the morphological dilation operation is employed on
the detected text blocks for scene text localization. The experimental results
obtained on publicly available standard datasets illustrate that the proposed
method can detect and localize the texts of various sizes, fonts and colors.
","[{'version': 'v1', 'created': 'Fri, 13 Feb 2015 09:08:35 GMT'}]",2015-02-23,"[['Shekar', 'B. H.', ''], ['L', 'Smitha M.', '']]","['Wavelet Analysis', 'Image Compression', 'Gradient difference', 'Zero crossing', 'Text Localization']"
16860,1404.0144,"Julian-Steffen M\""uller","Juha Kontinen and Julian-Steffen M\""uller and Henning Schnoor and
  Heribert Vollmer",Modal Independence Logic,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces modal independence logic MIL, a modal logic that can
explicitly talk about independence among propositional variables. Formulas of
MIL are not evaluated in worlds but in sets of worlds, so called teams. In this
vein, MIL can be seen as a variant of V\""a\""an\""anen's modal dependence logic
MDL. We show that MIL embeds MDL and is strictly more expressive. However, on
singleton teams, MIL is shown to be not more expressive than usual modal logic,
but MIL is exponentially more succinct. Making use of a new form of
bisimulation, we extend these expressivity results to modal logics extended by
various generalized dependence atoms. We demonstrate the expressive power of
MIL by giving a specification of the anonymity requirement of the dining
cryptographers protocol in MIL. We also study complexity issues of MIL and show
that, though it is more expressive, its satisfiability and model checking
problem have the same complexity as for MDL.
","[{'version': 'v1', 'created': 'Tue, 1 Apr 2014 06:57:00 GMT'}]",2014-04-02,"[['Kontinen', 'Juha', ''], ['Müller', 'Julian-Steffen', ''], ['Schnoor', 'Henning', ''], ['Vollmer', 'Heribert', '']]","['dependence logic', 'team semantics', 'independence', 'expressivity over finitemodels', 'computational complexity']"
16861,2006.04532,Edward Gehringer,"Yunkai Xiao, Gabriel Zingle, Qinjin Jia, Harsh R. Shah, Yi Zhang,
  Tianyi Li, Mohsin Karovaliya, Weixiang Zhao, Yang Song, Jie Ji, Ashwin
  Balasubramaniam, Harshit Patel, Priyankha Bhalasubbramanian, Vikram Patel,
  and Edward F. Gehringer",Detecting Problem Statements in Peer Assessments,"8 pages, 9 images. Extended version of a paper published at EDM 2020,
  13th International Conference on Educational Data Mining",,,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Effective peer assessment requires students to be attentive to the
deficiencies in the work they rate. Thus, their reviews should identify
problems. But what ways are there to check that they do? We attempt to automate
the process of deciding whether a review comment detects a problem. We use over
18,000 review comments that were labeled by the reviewees as either detecting
or not detecting a problem with the work. We deploy several traditional
machine-learning models, as well as neural-network models using GloVe and BERT
embeddings. We find that the best performer is the Hierarchical Attention
Network classifier, followed by the Bidirectional Gated Recurrent Units (GRU)
Attention and Capsule model with scores of 93.1% and 90.5% respectively. The
best non-neural network model was the support vector machine with a score of
89.71%. This is followed by the Stochastic Gradient Descent model and the
Logistic Regression model with 89.70% and 88.98%.
","[{'version': 'v1', 'created': 'Sat, 30 May 2020 03:03:46 GMT'}]",2020-06-09,"[['Xiao', 'Yunkai', ''], ['Zingle', 'Gabriel', ''], ['Jia', 'Qinjin', ''], ['Shah', 'Harsh R.', ''], ['Zhang', 'Yi', ''], ['Li', 'Tianyi', ''], ['Karovaliya', 'Mohsin', ''], ['Zhao', 'Weixiang', ''], ['Song', 'Yang', ''], ['Ji', 'Jie', ''], ['Balasubramaniam', 'Ashwin', ''], ['Patel', 'Harshit', ''], ['Bhalasubbramanian', 'Priyankha', ''], ['Patel', 'Vikram', ''], ['Gehringer', 'Edward F.', '']]","['Peer assessment', 'problem detection', 'text mining', 'text analytics', 'machine learning']"
16862,1510.07148,Abhinav Singh,"Abhinav Singh, Awadhesh Kumar Singh",Mobility and Energy Conscious Clustering Protocol for Wireless Networks,"10 pages, International Congress on Information and Communication
  Technology(ICICT-2015)",,,,cs.NI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a distributed clustering protocol for mobile
wireless sensor networks. A large majority of research in clustering and
routing algorithms for WSNs assume a static network and hence are rendered
inefficient in cases of highly mobile sensor networks, which is an aspect
addressed here. MECP is an energy efficient, mobility aware protocol and
utilizes information about movement of sensor nodes and residual energy as
attributes in network formation. It also provides a mechanism for fault
tolerance to decrease packet data loss in case of cluster head failures.
","[{'version': 'v1', 'created': 'Sat, 24 Oct 2015 13:50:14 GMT'}]",2015-10-27,"[['Singh', 'Abhinav', ''], ['Singh', 'Awadhesh Kumar', '']]","['Wireless sensor network', 'Clustering', 'Mobility', 'Energy efficient', 'Distributed']"
16863,1409.2778,Matteo Camilli M.Sc.,Matteo Camilli,Verification of Reachability Problems for Time Basic Petri Nets,"21 pages. arXiv admin note: substantial text overlap with
  arXiv:1107.1166 by other authors",,,,cs.LO cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Time-Basic Petri nets, is a powerful formalism for model- ing real-time
systems where time constraints are expressed through time functions of
marking's time description associated with transition, representing possible
firing times. We introduce a technique for reachability analysis based on the
building of finite contraction of the infinite state space associated with such
a models. The technique constructs a finite symbolic reachability graph relying
on a sort of time coverage, and over- comes the limitations of the existing
available analyzers for Time-Basic nets, based in turn on a time-bounded
inspection of a (possibly infinite) reachability-tree. A key feature of the
technique is the introduction of the Time Anonymous concept, which allows the
identification of components not influencing the evolution of a model. A
running example is used throughout the paper to sketch the symbolic graph
construction. The graph construction algorithm has been automated by a Java
tool-set, described in the paper together with its main functionality and
analysis capability. A use case describing a real-world example has been
employed to benchmark the technique and the tool-set. The main outcome of this
test are also presented in the paper.
","[{'version': 'v1', 'created': 'Tue, 9 Sep 2014 15:31:00 GMT'}]",2014-09-10,"[['Camilli', 'Matteo', '']]","['real-time systems', 'timed Petri nets', 'infinite-states systems', 'linear constraints', 'reachability graph', 'reachability problems']"
16864,0803.3490,Huan Xu Mr.,"Huan Xu, Constantine Caramanis and Shie Mannor",Robustness and Regularization of Support Vector Machines,,"Journal of Machine Learning Research, vol 10, 1485-1510, year 2009",,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider regularized support vector machines (SVMs) and show that they are
precisely equivalent to a new robust optimization formulation. We show that
this equivalence of robust optimization and regularization has implications for
both algorithms, and analysis. In terms of algorithms, the equivalence suggests
more general SVM-like algorithms for classification that explicitly build in
protection to noise, and at the same time control overfitting. On the analysis
front, the equivalence of robustness and regularization, provides a robust
optimization interpretation for the success of regularized SVMs. We use the
this new robustness interpretation of SVMs to give a new proof of consistency
of (kernelized) SVMs, thus establishing robustness as the reason regularized
SVMs generalize well.
","[{'version': 'v1', 'created': 'Tue, 25 Mar 2008 03:51:59 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Nov 2008 22:36:47 GMT'}]",2010-02-25,"[['Xu', 'Huan', ''], ['Caramanis', 'Constantine', ''], ['Mannor', 'Shie', '']]","['Robustness', 'Regularization', 'Generalization', 'Kernel', 'Support Vector Machine']"
16865,1501.02661,Damianos Gavalas,"Vlasios Kasapakis, Damianos Gavalas, Thomas Chatzidimitris","Evaluation of Pervasive Games: Recruitment of Qualified Participants
  through Preparatory Game Phases","7 pages, 4 Tables, Proceedings of the International Conference on
  Pervasive Games (PERGAMES'2014), Rome, Italy, 27 October 2014",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present the evaluation process for Barbarossa, a pervasive
role playing game. Barbarossa involves an invitational (preparatory) and a main
execution phase. The former is freely available though Google Play store and
may be played anytime/ anywhere. The latter defines three inter-dependent
player roles acted by players who need to collaborate in a treasure hunting
game. The eligibility of players for participating in the main game phase is
restricted among those ranked relatively high in the invitational phase.
Herein, we investigate the impact of the invitational game mode on the players
overall game experience. The main hypothesis tested is that game awareness
(gained from participating in a preliminary game phase) may serve as a means
for recruiting the most suitable subjects for user trials on pervasive game
research prototypes.
","[{'version': 'v1', 'created': 'Mon, 12 Jan 2015 14:33:07 GMT'}]",2015-01-13,"[['Kasapakis', 'Vlasios', ''], ['Gavalas', 'Damianos', ''], ['Chatzidimitris', 'Thomas', '']]","['Pervasive games', 'evaluation', 'user trials']"
16866,1510.07293,Peter Thiemann,Martin Sulzmann and Peter Thiemann,Forkable Regular Expressions,"12 pages plus technical appendix, to appear in LATA 2016",,,,cs.FL cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider forkable regular expressions, which enrich regular expressions
with a fork operator, to establish a formal basis for static and dynamic
analysis of the communication behavior of concurrent programs. We define a
novel compositional semantics for forkable expressions, establish their
fundamental properties, and define derivatives for them as a basis for the
generation of automata, for matching, and for language containment tests.
Forkable expressions may give rise to non-regular languages, in general, but we
identify sufficient conditions on expressions that guarantee finiteness of the
automata construction via derivatives.
","[{'version': 'v1', 'created': 'Sun, 25 Oct 2015 19:42:43 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Dec 2015 20:23:31 GMT'}]",2015-12-09,"[['Sulzmann', 'Martin', ''], ['Thiemann', 'Peter', '']]","['automata and logic', 'forkable expressions', 'derivatives']"
16867,1505.03344,Anjith George,"Anjith George, Anirban Dasgupta, Aurobinda Routray",A Framework for Fast Face and Eye Detection,"5 pages , 10 figures,",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Face detection is an essential step in many computer vision applications like
surveillance, tracking, medical analysis, facial expression analysis etc.
Several approaches have been made in the direction of face detection. Among
them, Haar-like features based method is a robust method. In spite of the
robustness, Haar - like features work with some limitations. However, with some
simple modifications in the algorithm, its performance can be made faster and
more robust. The present work refers to the increase in speed of operation of
the original algorithm by down sampling the frames and its analysis with
different scale factors. It also discusses the detection of tilted faces using
an affine transformation of the input image.
","[{'version': 'v1', 'created': 'Wed, 13 May 2015 11:56:01 GMT'}]",2015-05-14,"[['George', 'Anjith', ''], ['Dasgupta', 'Anirban', ''], ['Routray', 'Aurobinda', '']]","['Haar-like feature', 'Face detection', 'ROC', 'Affine transformation']"
16868,1010.5610,Ju Sun,"Ju Sun, Qiang Chen, Shuicheng Yan, Loong-Fah Cheong",Selective Image Super-Resolution,"20 pages, 5 figures. Submitted to Computer Vision and Image
  Understanding in March 2010. Keywords: image super resolution, semantic image
  segmentation, vision system, vision application",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a vision system that performs image Super Resolution
(SR) with selectivity. Conventional SR techniques, either by multi-image fusion
or example-based construction, have failed to capitalize on the intrinsic
structural and semantic context in the image, and performed ""blind"" resolution
recovery to the entire image area. By comparison, we advocate example-based
selective SR whereby selectivity is exemplified in three aspects: region
selectivity (SR only at object regions), source selectivity (object SR with
trained object dictionaries), and refinement selectivity (object boundaries
refinement using matting). The proposed system takes over-segmented
low-resolution images as inputs, assimilates recent learning techniques of
sparse coding (SC) and grouped multi-task lasso (GMTL), and leads eventually to
a framework for joint figure-ground separation and interest object SR. The
efficiency of our framework is manifested in our experiments with subsets of
the VOC2009 and MSRC datasets. We also demonstrate several interesting vision
applications that can build on our system.
","[{'version': 'v1', 'created': 'Wed, 27 Oct 2010 08:58:48 GMT'}]",2010-10-28,"[['Sun', 'Ju', ''], ['Chen', 'Qiang', ''], ['Yan', 'Shuicheng', ''], ['Cheong', 'Loong-Fah', '']]","['image super resolution', 'semantic image segmentation', 'visionsystem', 'vision application']"
16869,1605.00724,Lisi Jiang,Lisi Jiang and Juling Zeng,"An Effective Limited Feedback Scheme for FD-MIMO Based on Noncoherent
  Detection and Kronecker Product Codebook","7 pages,conference",,,,cs.IT math.IT,http://creativecommons.org/licenses/by/4.0/,"  The low complexity quantization of channel state information (CSI) and the
utilization of vertical freedom of three dimension (3D) channels are two
critical issues in the limited feedback design of the \emph{full dimension
multi-input-multi-output} (FD-MIMO) systems. In this paper, we propose an
effective limited feedback scheme. We first employ Kronecker product based
codebook (KPC) to explore the vertical freedom of 3D channels, extending the
limited feedback from two dimension (2D) to 3D. Fruthermore, we use noncoherent
sequence detection (NCSD) to quantify the CSI which includes both the vertical
and horizontal channel information. This quantization method exploits the
duality between codebook searching and NCSD to transform the CSI quntization on
KPC to two parallel NCSD. The complexity is reduced from exponential to linear
with the number of antennas. We also show the proposed scheme does not affect
the diversity gain of the system by demonstrating the full diversity order.
Monte Carlo simulation results show that the proposed scheme provides at least
1.2dB coding gain compared with traditional 2D limited feedback schemes.
Moreover, the proposed scheme outperforms other FD/3D CSI quantization schemes
by 0.8dB coding gain with moderate complexity when the channel is highly
spatially correlated.
","[{'version': 'v1', 'created': 'Tue, 3 May 2016 01:37:09 GMT'}]",2016-05-04,"[['Jiang', 'Lisi', ''], ['Zeng', 'Juling', '']]","['FD-MIMO', 'Limited feedback', 'CSI quantization', 'Kronecker product', 'Low complexity']"
16870,1105.1945,Reza Keyvan,"MohammadReza Keyvanpour (Department of Computer Engineering Al-Zahra
  University), Somayyeh Seifi Moradi (Department of Computer Engineering
  Islamic Azad University)","Classification and Evaluation the Privacy Preserving Data Mining
  Techniques by using a Data Modification-based Framework",,"International Journal on Computer Science and Engineering
  (IJCSE)Vol. 3 No. 2 Feb 2011",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, the data mining techniques have met a serious challenge due
to the increased concerning and worries of the privacy, that is, protecting the
privacy of the critical and sensitive data. Different techniques and algorithms
have been already presented for Privacy Preserving data mining, which could be
classified in three common approaches: Data modification approach, Data
sanitization approach and Secure Multi-party Computation approach. This paper
presents a Data modification- based Framework for classification and evaluation
of the privacy preserving data mining techniques. Based on our framework the
techniques are divided into two major groups, namely perturbation approach and
anonymization approach. Also in proposed framework, eight functional criteria
will be used to analyze and analogically assessment of the techniques in these
two major groups. The proposed framework provides a good basis for more
accurate comparison of the given techniques to privacy preserving data mining.
In addition, this framework allows recognizing the overlapping amount for
different approaches and identifying modern approaches in this field.
","[{'version': 'v1', 'created': 'Tue, 10 May 2011 13:50:18 GMT'}]",2011-05-11,"[['Keyvanpour', 'MohammadReza', '', 'Department of Computer Engineering Al-Zahra\n  University'], ['Moradi', 'Somayyeh Seifi', '', 'Department of Computer Engineering\n  Islamic Azad University']]","['Privacy Preserving Data Mining', 'Data Modification', 'Perturbation', 'Anonymization']"
16871,1106.3517,Shashikumar D R,"Shashi Kumar D. R., K. B. Raja, R. K. Chhootaray, Sabyasachi Pattanaik",DWT Based Fingerprint Recognition using Non Minutiae Features,9 pages,"IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 2, March 2011, 257-265",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Forensic applications like criminal investigations, terrorist identification
and National security issues require a strong fingerprint data base and
efficient identification system. In this paper we propose DWT based Fingerprint
Recognition using Non Minutiae (DWTFR) algorithm. Fingerprint image is
decomposed into multi resolution sub bands of LL, LH, HL and HH by applying 3
level DWT. The Dominant local orientation angle {\theta} and Coherence are
computed on LL band only. The Centre Area Features and Edge Parameters are
determined on each DWT level by considering all four sub bands. The comparison
of test fingerprint with database fingerprint is decided based on the Euclidean
Distance of all the features. It is observed that the values of FAR, FRR and
TSR are improved compared to the existing algorithm.
","[{'version': 'v1', 'created': 'Fri, 17 Jun 2011 15:52:56 GMT'}]",2011-06-20,"[['R.', 'Shashi Kumar D.', ''], ['Raja', 'K. B.', ''], ['Chhootaray', 'R. K.', ''], ['Pattanaik', 'Sabyasachi', '']]","['Fingerprint', 'Gradient', 'Coherence', 'Dominant local orientation angle', 'Centre Area Features', 'Canny Edge Parameters;']"
16872,1410.5696,Rajesh Sharma,"Rajesh Sharma, Deepak Subramanian, Satish N. Srirama","DAPriv: Decentralized architecture for preserving the privacy of medical
  data",7 pages,,,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The digitization of the medical data has been a sensitive topic. In modern
times laws such as the HIPAA provide some guidelines for electronic
transactions in medical data to prevent attacks and fraudulent usage of private
information. In our paper, we explore an architecture that uses hybrid
computing with decentralized key management and show how it is suitable in
preventing a special form of re-identification attack that we name as the
re-assembly attack. This architecture would be able to use current
infrastructure from mobile phones to server certificates and cloud based
decentralized storage models in an efficient way to provide a reliable model
for communication of medical data. We encompass entities including patients,
doctors, insurance agents, emergency contacts, researchers, medical test
laboratories and technicians. This is a complete architecture that provides
patients with a good level of privacy, secure communication and more direct
control.
","[{'version': 'v1', 'created': 'Tue, 21 Oct 2014 15:02:55 GMT'}]",2014-10-22,"[['Sharma', 'Rajesh', ''], ['Subramanian', 'Deepak', ''], ['Srirama', 'Satish N.', '']]","['privacy', 'medical data', 'architecture']"
16873,1110.1038,Reza Sabbaghi,"Parisa Soleimani, Reza Sabbaghi-Nadooshan, Sattar Mirzakuchaki, and
  Mahdi Bagheri","Using Genetic Algorithm in the Evolutionary Design of Sequential Logic
  Circuits",,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evolvable hardware (EHW) is a set of techniques that are based on the idea of
combining reconfiguration hardware systems with evolutionary algorithms. In
other word, EHW has two sections; the reconfigurable hardware and evolutionary
algorithm where the configurations are under the control of an evolutionary
algorithm. This paper, suggests a method to design and optimize the synchronous
sequential circuits. Genetic algorithm (GA) was applied as evolutionary
algorithm. In this approach, for building input combinational logic circuit of
each DFF, and also output combinational logic circuit, the cell arrays have
been used. The obtained results show that our method can reduce the average
number of generations by limitation the search space.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2011 16:52:26 GMT'}]",2011-10-06,"[['Soleimani', 'Parisa', ''], ['Sabbaghi-Nadooshan', 'Reza', ''], ['Mirzakuchaki', 'Sattar', ''], ['Bagheri', 'Mahdi', '']]","['Combinational logic circuit', 'Evolutionary algorithms', 'Evolvable hardware', 'genetic algorithm', 'sequential logic circuit']"
16874,1603.04990,Lasse Laursen,"Lasse Farnung Laursen, Hsiang-Ting Chen (1), Paulo Silva (2), Lintalo
  Suehiro, and Takeo Igarashi (2) ((1) University of Technology Sydney, (2) The
  University of Tokyo)","TapDrag: An Alternative Dragging Technique on Medium-Sized MultiTouch
  Displays Reducing Skin Irritation and Arm Fatigue","6 pages, 8 figures",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Medium-sized touch displays, sized 30 to 50 inches, are becoming more
affordable and more widely available. Prolonged use of such displays can result
in arm fatigue or skin irritation, especially when multiple long distance drags
are involved. To address this issue, we present TapDrag, an alternative
dragging technique that complements traditional dragging with a simple tapping
gesture on both ends of the intended dragging path. Our experimental evaluation
suggests that TapDrag is a viable alternative to traditional dragging with
faster task completion times for long distances. Qualitative user feedback
indicates that TapDrag helps prevent skin irritation. A reduction in arm
fatigue remains unconfirmed.
","[{'version': 'v1', 'created': 'Wed, 16 Mar 2016 08:50:20 GMT'}]",2016-03-17,"[['Laursen', 'Lasse Farnung', ''], ['Chen', 'Hsiang-Ting', ''], ['Silva', 'Paulo', ''], ['Suehiro', 'Lintalo', ''], ['Igarashi', 'Takeo', '']]","['Drag', '2D target acquisition', 'large display', 'empirical evaluation', 'interaction design']"
16875,1609.01821,Ezer Yeboah-Boateng,Ezer Osei Yeboah-Boateng and Francis Edmund Boaten,"Bring-Your-Own-Device (BYOD): An Evaluation of Associated Risks to
  Corporate Information Security",,"International Journal of Information Technology (IT) &
  Engineering, Vol. 4, Issue 8, pp 12-30, 2016",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study evaluates the cyber-risks to Business Information Assets posed by
the adoption of Bring-Your-Own-Device (BYOD) to the workplace. BYOD is an
emerging trend where employees bring and use personal computing devices on the
companys network to access applications and sensitive data like emails,
calendar and scheduling applications, documents, etc. Employees are captivated
by BYOD because they can have access to private items as well as perform
certain job functions while being unrestricted to their desks. This is however
usually done on the blind side of management or the system administrator; a
situation that tends to expose vital and sensitive corporate information to
various threats like unwanted network traffic, unknown applications, malwares,
and viruses. Expert opinions were elicited in this exploratory study. The study
evaluated the characteristics of BYOD, assessed associated risks, threats and
vulnerabilities. The findings indicate that little or no security measures were
instituted to mitigate risks associated with BYOD. Though, profound benefits
abound with BYOD adoption, they could be eroded by security threats and costs
of mitigation in curing breaches. The most significant risk was found to be
Data Loss which was in consonance with similar studies on Smartphone security
risks. Some mitigation measures are then recommended.
","[{'version': 'v1', 'created': 'Mon, 5 Sep 2016 23:26:23 GMT'}]",2016-09-08,"[['Yeboah-Boateng', 'Ezer Osei', ''], ['Boaten', 'Francis Edmund', '']]","['BYOD', 'Vulnerabilities', 'Threats', 'Risks', 'Policies', 'Malware', 'Technology Adoption']"
16876,1304.5045,Chii Chang,"Chii Chang, Sea Ling",Towards an Infrastructure-less SOA for Mobile Web Service Composition,"6 pages, 7 figures",,,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Service composition enables customizable services to be provided to the
service consumers. Since the capabilities and the performances of mobile
devices (e.g., smart phone, PDA, handheld media player) have improved, a mobile
device can be utilized to interact with external mobile service providers
towards providing composite Web service to remote clients. Existing approaches
on mobile-hosted service composition are usually platform dependent, and rely
on centralized infrastructure. Such approaches are not feasible in an open,
mobile infrastructure-less environment, in which networked services are
implemented using different technologies, devices are capable of dynamically
joining or leaving the network, and a centralized management entity is
nonexistent. This paper proposes a solution to enable mobile Web service
composition in an open, infrastructure-less environment based on loosely
coupled SOA techniques.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2013 08:10:19 GMT'}]",2013-04-19,"[['Chang', 'Chii', ''], ['Ling', 'Sea', '']]","['Mobile communication', 'Composite systems', 'Distributed']"
16877,1304.3560,Vasanthi V,V. Vasanthi and M. Hemalatha,"Simulation of Obstruction Avoidance Generously Mobility (OAGM) Model
  using Graph-theory Technique",9 pages,"Research Journal of Applied Sciences, Engineering and Technology
  5(7): 2799-2808, 2013",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An Obstruction Avoidance Generously Mobility (OAGM) model has been introduced
for controlling ad-hoc sensor networks and thereby operating emerging fields
like military and healthcare services. According to this model, the ability to
send a message to a group of users simultaneously, based solely on their
geographic location, is desirable by using Mission Critical Mobility model that
assumes the obstacle shapes like rectangle or square in the simulation terrain.
The OAGM model is developed by grasping the critical situations of military and
healthcare services by incorporating the node movement model, hierarchical node
organization, placement of obstacle that affect the movement of nodes and also
signal propagation. Graph theory technique is used to find the shortest path of
the node movement process. The varying number of parameter sets with DSR
protocol is analyzed for MCM and OAGM mobility model. The results show OAGM
performance is better than MCM.
","[{'version': 'v1', 'created': 'Fri, 12 Apr 2013 07:57:07 GMT'}]",2013-04-15,"[['Vasanthi', 'V.', ''], ['Hemalatha', 'M.', '']]","['Hybrid bellman-ford-dijkstra algorithm', 'mission critical mobility', 'mobility model', 'NS2', 'performance']"
16878,1704.04374,Paul Springer,"Paul Springer, Tong Su, Paolo Bientinesi",HPTT: A High-Performance Tensor Transposition C++ Library,,,,,cs.MS cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently we presented TTC, a domain-specific compiler for tensor
transpositions. Despite the fact that the performance of the generated code is
nearly optimal, due to its offline nature, TTC cannot be utilized in all the
application codes in which the tensor sizes and the necessary tensor
permutations are determined at runtime. To overcome this limitation, we
introduce the open-source C++ library High-Performance Tensor Transposition
(HPTT). Similar to TTC, HPTT incorporates optimizations such as blocking,
multi-threading, and explicit vectorization; furthermore it decomposes any
transposition into multiple loops around a so called micro-kernel. This modular
design---inspired by BLIS---makes HPTT easy to port to different architectures,
by only replacing the hand-vectorized micro-kernel (e.g., a 4x4 transpose).
HPTT also offers an optional autotuning framework---guided by a performance
model---that explores a vast search space of implementations at runtime
(similar to FFTW). Across a wide range of different tensor transpositions and
architectures (e.g., Intel Ivy Bridge, Intel Knights Landing, ARMv7, IBM
Power7), HPTT attains a bandwidth comparable to that of SAXPY, and yields
remarkable speedups over Eigen's tensor transposition implementation. Most
importantly, the integration of HPTT into the Cyclops Tensor Framework (CTF)
improves the overall performance of tensor contractions by up to 3.1x.
","[{'version': 'v1', 'created': 'Fri, 14 Apr 2017 09:45:06 GMT'}, {'version': 'v2', 'created': 'Wed, 10 May 2017 21:34:51 GMT'}]",2017-05-12,"[['Springer', 'Paul', ''], ['Su', 'Tong', ''], ['Bientinesi', 'Paolo', '']]","['multidimensionaltransposition', 'High-PerformanceComputing', 'vectorization', 'tensors', 'autotuning']"
16879,1007.1033,Michelle Effros,"Ralf Koetter, Michelle Effros, and Muriel Medard","A Theory of Network Equivalence, Parts I and II","91 pages, 18 figures. Submitted to the IEEE Transactions on
  Information Theory on April 14, 2010. Draft 2",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A family of equivalence tools for bounding network capacities is introduced.
Part I treats networks of point-to-point channels. The main result is roughly
as follows. Given a network of noisy, independent, memoryless point-to-point
channels, a collection of communication demands can be met on the given network
if and only if it can be met on another network where each noisy channel is
replaced by a noiseless bit pipe with throughput equal to the noisy channel
capacity. This result was known previously for the case of a single-source
multicast demand. The result given here treats general demands -- including,
for example, multiple unicast demands -- and applies even when the achievable
rate region for the corresponding demands is unknown in the noiseless network.
In part II, definitions of upper and lower bounding channel models for general
channels are introduced. By these definitions, a collection of communication
demands can be met on a network of independent channels if it can be met on a
network where each channel is replaced by its lower bounding model andonly if
it can be met on a network where each channel is replaced by its upper bounding
model. This work derives general conditions under which a network of noiseless
bit pipes is an upper or lower bounding model for a multiterminal channel.
Example upper and lower bounding models for broadcast, multiple access, and
interference channels are given. It is then shown that bounding the difference
between the upper and lower bounding models for a given channel yields bounds
on the accuracy of network capacity bounds derived using those models. By
bounding the capacity of a network of independent noisy channels by the network
coding capacity of a network of noiseless bit pipes, this approach represents
one step towards the goal of building computational tools for bounding network
capacities.
","[{'version': 'v1', 'created': 'Wed, 7 Jul 2010 01:35:17 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Sep 2010 00:38:57 GMT'}]",2010-09-06,"[['Koetter', 'Ralf', ''], ['Effros', 'Michelle', ''], ['Medard', 'Muriel', '']]","['Capacity', 'network coding', 'equivalence', 'component models']"
16880,1603.07401,Csaba D. Toth,"Hugo Akitaya, Greg Aloupis, Jeff Erickson, Csaba D. T\'oth",Recognizing Weakly Simple Polygons,"35 pages, 28 figures. A 15-page extended abstract has appeared in the
  Proceeding of the 32nd International Symposium on Computational Geometry
  (Boston, MA, 2016)",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an $O(n\log n)$-time algorithm that determines whether a given
planar $n$-gon is weakly simple. This improves upon an $O(n^2\log n)$-time
algorithm by Chang, Erickson, and Xu (2015). Weakly simple polygons are
required as input for several geometric algorithms. As such, how to recognize
simple or weakly simple polygons is a fundamental question.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2016 00:53:05 GMT'}, {'version': 'v2', 'created': 'Sun, 30 Jul 2017 12:11:28 GMT'}]",2017-08-01,"[['Akitaya', 'Hugo', ''], ['Aloupis', 'Greg', ''], ['Erickson', 'Jeff', ''], ['Tóth', 'Csaba D.', '']]","['simple polygon', 'combinatorial embedding', 'perturbation']"
16881,1607.04077,Kristina Kapanova G,"K.G.Kapanova, J.M.Sellier",Designing a High Performance Parallel Personal Cluster,"12 pages, 12 figures",,,,cs.DC cs.PF,http://creativecommons.org/licenses/by/4.0/,"  Today, many scientific and engineering areas require high performance
computing to perform computationally intensive experiments. For example, many
advances in transport phenomena, thermodynamics, material properties,
computational chemistry and physics are possible only because of the
availability of such large scale computing infrastructures. Yet many challenges
are still open. The cost of energy consumption, cooling, competition for
resources have been some of the reasons why the scientific and engineering
communities are turning their interests to the possibility of implementing
energy-efficient servers utilizing low-power CPUs for computing-intensive
tasks. In this paper we introduce a novel approach, which was recently
presented at Linux Conference Europe 2015, based on the Beowulf concept and
utilizing single board computers (SBC). We present a low-energy consumption
architecture capable to tackle heavily demanding scientific computational
problems. Additionally, our goal is to provide a low cost personal solution for
scientists and engineers. In order to evaluate the performance of the proposed
architecture we ran several standard benchmarking tests. Furthermore, we assess
the reliability of the machine in real life situations by performing two
benchmark tools involving practical TCAD for physicist and engineers in the
semiconductor industry.
","[{'version': 'v1', 'created': 'Thu, 14 Jul 2016 10:41:52 GMT'}]",2016-07-15,"[['Kapanova', 'K. G.', ''], ['Sellier', 'J. M.', '']]","['parallel computing', 'system on a chip', 'Beowulf', 'performanceassessment', 'technology computer aided design']"
16882,1511.03100,Nicola Apollonio,"Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa,
  Jean-Fran\c{c}ois Mascari","A tight relation between series-parallel graphs and Bipartite Distance
  Hereditary graphs",,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bandelt and Mulder's structural characterization of Bipartite Distance
Hereditary graphs asserts that such graphs can be built inductively starting
from a single vertex and by repeatedly adding either pending vertices or twins
(i.e., vertices with the same neighborhood as an existing one). Dirac and
Duffin's structural characterization of 2-connected series-parallel graphs
asserts that such graphs can be built inductively starting from a single edge
by adding either edges in series or in parallel. In this paper we prove that
the two constructions are the same construction when bipartite graphs are
viewed as the fundamental graphs of a graphic matroid. We then apply the result
to re-prove known results concerning bipartite distance hereditary graphs and
series-parallel graphs, to characterize self-dual outer-planar graphs and,
finally, to provide a new class of polynomially-solvable instances for the
integer multi commodity flow of maximum value.
","[{'version': 'v1', 'created': 'Tue, 10 Nov 2015 13:21:19 GMT'}]",2015-11-11,"[['Apollonio', 'Nicola', ''], ['Caramia', 'Massimiliano', ''], ['Franciosa', 'Paolo Giulio', ''], ['Mascari', 'Jean-François', '']]","['distance Hereditary graphs', 'series-parallel graphs', 'GF(2)-pivoting', 'fundamentalgraphs', 'outerplanar graphs']"
16883,1108.5703,Sivakumar Madesan,"Jeevan H E, Prashanth P P, Punith Kumar S N, Vinay Hegde",Web Pages Clustering: A New Approach,"Clustering, concept mining, information retrieval, metasearch engine",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rapid growth of web has resulted in vast volume of information.
Information availability at a rapid speed to the user is vital. English
language (or any for that matter) has lot of ambiguity in the usage of words.
So there is no guarantee that a keyword based search engine will provide the
required results. This paper introduces the use of dictionary (standardised) to
obtain the context with which a keyword is used and in turn cluster the results
based on this context. These ideas can be merged with a metasearch engine to
enhance the search efficiency.
","[{'version': 'v1', 'created': 'Fri, 26 Aug 2011 07:02:35 GMT'}]",2011-08-30,"[['E', 'Jeevan H', ''], ['P', 'Prashanth P', ''], ['N', 'Punith Kumar S', ''], ['Hegde', 'Vinay', '']]","['Clustering', 'concept mining', 'information retrieval', 'metasearch engine']"
16884,1111.2097,Preetha K G,Preetha K. G,A Novel Solution to the Short Range Bluetooth Communication,10 pages; IJANS-2011 October Issue,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bluetooth is developed for short range communication. Bluetooth Devices are
normally having low power and low cost. This is a wireless communication
technology designed to connect phones, laptops and PDAs. The greater
availability of portable devices with Bluetooth connectivity imposes wireless
connection between enabled devices. On an average the range of Bluetooth
devices is about 10 meters. The basic limitation of the Bluetooth communication
is this range limitation. In this paper I have studied the limitations of
Bluetooth communication and consider range constraint as the major limitation.
I propose a new expanded Blue tooth network to overcome the range constraint of
Bluetooth device. This creates a network of Bluetooth enabled devices that will
include laptops, set top devices and also mobile phones. The main purpose of
this proposal is to establish a network will enable the users to communicate
outside the range without any range constraint.
","[{'version': 'v1', 'created': 'Wed, 9 Nov 2011 04:11:57 GMT'}]",2011-11-10,"[['G', 'Preetha K.', '']]","['Bluetooth', 'Pico net', 'Scatter net', 'Frequency hoping', 'ISM']"
16885,0908.1222,Rajesh Ramachandran,R Rajesh and Vinod Sharma,"Distributed Joint Source-Channel Coding for Functions over a Multiple
  Access Channel","7 Pages, 2 Figures. To Appear in IEEE GLOBECOM, 2009",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we provide sufficient conditions for lossy transmission of
functions of correlated data over a multiple access channel (MAC). The
conditions obtained can be shown as generalized version of Yamamoto's result.
We also obtain efficient joint source-channel coding schemes for transmission
of discrete and continuous alphabet sources to recover the function values.
  Keywords: Joint source-channel coding, Graph coloring, Lipschitz functions,
Correlated sources.
","[{'version': 'v1', 'created': 'Sun, 9 Aug 2009 10:34:24 GMT'}]",2009-08-11,"[['Rajesh', 'R', ''], ['Sharma', 'Vinod', '']]","['Joint source-channel coding', 'Graph coloring', 'Lipschitz functions', 'Correlated sources']"
16886,1107.1270,Animashree Anandkumar,"Animashree Anandkumar, Vincent Y. F. Tan and Alan. S. Willsky","High-Dimensional Gaussian Graphical Model Selection: Walk Summability
  and Local Separation Criterion",,,,,cs.LG math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of high-dimensional Gaussian graphical model
selection. We identify a set of graphs for which an efficient estimation
algorithm exists, and this algorithm is based on thresholding of empirical
conditional covariances. Under a set of transparent conditions, we establish
structural consistency (or sparsistency) for the proposed algorithm, when the
number of samples n=omega(J_{min}^{-2} log p), where p is the number of
variables and J_{min} is the minimum (absolute) edge potential of the graphical
model. The sufficient conditions for sparsistency are based on the notion of
walk-summability of the model and the presence of sparse local vertex
separators in the underlying graph. We also derive novel non-asymptotic
necessary conditions on the number of samples required for sparsistency.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2011 22:21:57 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Nov 2011 02:43:43 GMT'}, {'version': 'v3', 'created': 'Sun, 4 Mar 2012 04:42:39 GMT'}]",2012-03-06,"[['Anandkumar', 'Animashree', ''], ['Tan', 'Vincent Y. F.', ''], ['Willsky', 'Alan. S.', '']]","['Gaussian graphical model selection', 'high-dimensional learning', 'local-separationproperty', 'walk-summability', 'necessary conditions for model selection']"
16887,1207.4694,Martin R. Schuster,Maciej Liskiewicz and Martin R. Schuster,A New Upper Bound for the Traveling Salesman Problem in Cubic Graphs,,,,,cs.DS cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide a new upper bound for traveling salesman problem (TSP) in cubic
graphs, i.e. graphs with maximum vertex degree three, and prove that the
problem for an $n$-vertex graph can be solved in $O(1.2553^n)$ time and in
linear space. We show that the exact TSP algorithm of Eppstein, with some minor
modifications, yields the stated result. The previous best known upper bound
$O(1.251^n)$ was claimed by Iwama and Nakashima [Proc. COCOON 2007].
Unfortunately, their analysis contains several mistakes that render the proof
for the upper bound invalid.
","[{'version': 'v1', 'created': 'Thu, 19 Jul 2012 14:58:30 GMT'}, {'version': 'v2', 'created': 'Fri, 30 Nov 2012 13:44:09 GMT'}]",2012-12-03,"[['Liskiewicz', 'Maciej', ''], ['Schuster', 'Martin R.', '']]","['Exact Algorithms', 'Traveling Salesman Problem', 'Cubic Graphs', 'Hamiltonian Cycle']"
16888,1610.01741,Mohamad Ivan Fanany,"Endang Purnama Giri, Mohamad Ivan Fanany, Aniati Murni Arymurthy","Combining Generative and Discriminative Neural Networks for Sleep Stages
  Classification","Submitted to Computational Intelligence and Neuroscience (Hindawi
  Publishing). 13 pages",,,3184843,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sleep stages pattern provides important clues in diagnosing the presence of
sleep disorder. By analyzing sleep stages pattern and extracting its features
from EEG, EOG, and EMG signals, we can classify sleep stages. This study
presents a novel classification model for predicting sleep stages with a high
accuracy. The main idea is to combine the generative capability of Deep Belief
Network (DBN) with a discriminative ability and sequence pattern recognizing
capability of Long Short-term Memory (LSTM). We use DBN that is treated as an
automatic higher level features generator. The input to DBN is 28 ""handcrafted""
features as used in previous sleep stages studies. We compared our method with
other techniques which combined DBN with Hidden Markov Model (HMM).In this
study, we exploit the sequence or time series characteristics of sleep dataset.
To the best of our knowledge, most of the present sleep analysis from
polysomnogram relies only on single instanced label (nonsequence) for
classification. In this study, we used two datasets: an open data set that is
treated as a benchmark; the other dataset is our sleep stages dataset
(available for download) to verify the results further. Our experiments showed
that the combination of DBN with LSTM gives better overall accuracy 98.75\%
(Fscore=0.9875) for benchmark dataset and 98.94\% (Fscore=0.9894) for MKG
dataset. This result is better than the state of the art of sleep stages
classification that was 91.31\%.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2016 06:05:16 GMT'}]",2016-10-07,"[['Giri', 'Endang Purnama', ''], ['Fanany', 'Mohamad Ivan', ''], ['Arymurthy', 'Aniati Murni', '']]","['sleep stages classification', 'long short term memory', 'deep belief network', 'deep learning']"
16889,0806.1640,Arnaud Martin,"Arnaud Martin (E3I2), Christophe Osswald (E3I2)","Toward a combination rule to deal with partial conflict and specificity
  in belief functions theory","International Conference on Information Fusion, Qu\'ebec : Canada
  (2007)",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present and discuss a mixed conjunctive and disjunctive rule, a
generalization of conflict repartition rules, and a combination of these two
rules. In the belief functions theory one of the major problem is the conflict
repartition enlightened by the famous Zadeh's example. To date, many
combination rules have been proposed in order to solve a solution to this
problem. Moreover, it can be important to consider the specificity of the
responses of the experts. Since few year some unification rules are proposed.
We have shown in our previous works the interest of the proportional conflict
redistribution rule. We propose here a mixed combination rule following the
proportional conflict redistribution rule modified by a discounting procedure.
This rule generalizes many combination rules.
","[{'version': 'v1', 'created': 'Tue, 10 Jun 2008 12:03:43 GMT'}]",2008-12-18,"[['Martin', 'Arnaud', '', 'E3I2'], ['Osswald', 'Christophe', '', 'E3I2']]","['belief functions theory', 'conflict repartition', 'combination rules', 'proportional conflict redistributionrules']"
16890,1412.4039,Jonas Degrave,Jonas Degrave,Resolving multi-proxy transitive vote delegation,,,,,cs.MA,http://creativecommons.org/licenses/by/3.0/,"  Solving a delegation graph for transitive votes is already a non-trivial task
for many programmers. When extending the current main paradigm, where each
voter can only appoint a single transitive delegation, to a system where each
vote can be separated over multiple delegations, solving the delegation graph
becomes even harder. This article presents a solution of an example graph, and
a non-formal proof of why this algorithm works.
","[{'version': 'v1', 'created': 'Thu, 11 Dec 2014 13:06:38 GMT'}]",2014-12-15,"[['Degrave', 'Jonas', '']]","['Liquid democracy', 'voting system', 'delegation', 'graph', 'multiple proxies', 'transitive']"
16891,1606.09367,Sepehr Valipour,"Sepehr Valipour, Mennatullah Siam, Eleni Stroulia, Martin Jagersand","Parking Stall Vacancy Indicator System Based on Deep Convolutional
  Neural Networks",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parking management systems, and vacancy-indication services in particular,
can play a valuable role in reducing traffic and energy waste in large cities.
Visual detection methods represent a cost-effective option, since they can take
advantage of hardware usually already available in many parking lots, namely
cameras. However, visual detection methods can be fragile and not easily
generalizable. In this paper, we present a robust detection algorithm based on
deep convolutional neural networks. We implemented and tested our algorithm on
a large baseline dataset, and also on a set of image feeds from actual cameras
already installed in parking lots. We have developed a fully functional system,
from server-side image analysis to front-end user interface, to demonstrate the
practicality of our method.
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2016 06:57:11 GMT'}]",2016-07-01,"[['Valipour', 'Sepehr', ''], ['Siam', 'Mennatullah', ''], ['Stroulia', 'Eleni', ''], ['Jagersand', 'Martin', '']]","['Smart Cities', 'Smart Parking', 'Deep Learning', 'Internet of Things']"
16892,0705.4185,Tony Thomas,Tony Thomas,Secure Two-party Protocols for Point Inclusion Problem,,,,,cs.CR,,"  It is well known that, in theory, the general secure multi-party computation
problem is solvable using circuit evaluation protocols. However, the
communication complexity of the resulting protocols depend on the size of the
circuit that expresses the functionality to be computed and hence can be
impractical. Hence special solutions are needed for specific problems for
efficiency reasons. The point inclusion problem in computational geometry is a
special multiparty computation and has got many applications. Previous
protocols for the secure point inclusion problem are not adequate. In this
paper we modify some known solutions to the point inclusion problem in
computational geometry to the frame work of secure two-party computation.
","[{'version': 'v1', 'created': 'Tue, 29 May 2007 10:21:25 GMT'}]",2007-05-30,"[['Thomas', 'Tony', '']]","['multiparty computation', 'point inclusion problem', 'computational geometry']"
16893,1606.02995,Atamli-Ahmad Reineh,"Ahmad-Atamli Reineh, Giuseppe Petracca, Janne Uusilehto, Andrew Martin","Enabling Secure and Usable Mobile Application: Revealing the Nuts and
  Bolts of software TPM in todays Mobile Devices",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The emergence of mobile applications to execute sensitive operations has
brought a myriad of security threats to both enterprises and users. In order to
benefit from the large potential in smartphones there is a need to manage the
risks arising from threats, while maintaining an easy interface for the users.
In this paper we investigate the use of Trusted Platform Model (TPM) 2.0 to
develop a secure application for smartphones using Windows Phone 8.1. In
particular, we suggest a framework based on remote attestation as a proxy to
authenticate remote services, where the device is associated to the user and
replaces the users credentials. In addition, we use the TPM 2.0 to enable
secured information and data storage within the device itself. We present an
implementation and performance evaluation of the suggested architecture that
uses our novel attestation and authentication scheme and reveal the caveats of
using software TPM in todays mobile devices.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2016 15:23:31 GMT'}]",2016-06-10,"[['Reineh', 'Ahmad-Atamli', ''], ['Petracca', 'Giuseppe', ''], ['Uusilehto', 'Janne', ''], ['Martin', 'Andrew', '']]","['Security', 'Trusted Computing', 'Application Security']"
16894,1108.5825,Lena Wiese,Katsumi Inoue and Chiaki Sakama and Lena Wiese,"Confidentiality-Preserving Data Publishing for Credulous Users by
  Extended Abduction","Paper appears in the Proceedings of the 19th International Conference
  on Applications of Declarative Programming and Knowledge Management (INAP
  2011)",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Publishing private data on external servers incurs the problem of how to
avoid unwanted disclosure of confidential data. We study a problem of
confidentiality in extended disjunctive logic programs and show how it can be
solved by extended abduction. In particular, we analyze how credulous
non-monotonic reasoning affects confidentiality.
","[{'version': 'v1', 'created': 'Tue, 30 Aug 2011 04:19:40 GMT'}]",2011-08-31,"[['Inoue', 'Katsumi', ''], ['Sakama', 'Chiaki', ''], ['Wiese', 'Lena', '']]","['Data publishing', 'confidentiality', 'privacy', 'extended abduction', 'answer set programming', 'negation as failure', 'non-monotonic reasoning']"
16895,1511.02460,Ken-ichi Kawarabayashi,Ken-ichi Kawarabayashi,Graph Isomorphism for Bounded Genus Graphs In Linear Time,,,,,cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For every integer $g$, isomorphism of graphs of Euler genus at most $g$ can
be decided in linear time.
  This improves previously known algorithms whose time complexity is $n^{O(g)}$
(shown in early 1980's), and in fact, this is the first fixed-parameter
tractable algorithm for the graph isomorphism problem for bounded genus graphs
in terms of the Euler genus $g$. Our result also generalizes the seminal result
of Hopcroft and Wong in 1974, which says that the graph isomorphism problem can
be decided in linear time for planar graphs.
  Our proof is quite lengthly and complicated, but if we are satisfied with an
$O(n^3)$ time algorithm for the same problem, the proof is shorter and easier.
","[{'version': 'v1', 'created': 'Sun, 8 Nov 2015 09:22:59 GMT'}]",2015-11-10,"[['Kawarabayashi', 'Ken-ichi', '']]","['Graph isomorphism', 'Map isomorphism', 'Linear time algorithm', 'Surface', 'Face-width', 'Polyhedral embedding']"
16896,1205.1143,Onur Kucuktunc,"Onur K\""u\c{c}\""uktun\c{c}, Erik Saule, Kamer Kaya, \""Umit V.
  \c{C}ataly\""urek","Recommendation on Academic Networks using Direction Aware Citation
  Analysis","10 pages, 8 figures, 3 tables",,,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The literature search has always been an important part of an academic
research. It greatly helps to improve the quality of the research process and
output, and increase the efficiency of the researchers in terms of their novel
contribution to science. As the number of published papers increases every
year, a manual search becomes more exhaustive even with the help of today's
search engines since they are not specialized for this task. In academics, two
relevant papers do not always have to share keywords, cite one another, or even
be in the same field. Although a well-known paper is usually an easy pray in
such a hunt, relevant papers using a different terminology, especially recent
ones, are not obvious to the eye.
  In this work, we propose paper recommendation algorithms by using the
citation information among papers. The proposed algorithms are direction aware
in the sense that they can be tuned to find either recent or traditional
papers. The algorithms require a set of papers as input and recommend a set of
related ones. If the user wants to give negative or positive feedback on the
suggested paper set, the recommendation is refined. The search process can be
easily guided in that sense by relevance feedback. We show that this slight
guidance helps the user to reach a desired paper in a more efficient way. We
adapt our models and algorithms also for the venue and reviewer recommendation
tasks. Accuracy of the models and algorithms is thoroughly evaluated by
comparison with multiple baselines and algorithms from the literature in terms
of several objectives specific to citation, venue, and reviewer recommendation
tasks. All of these algorithms are implemented within a publicly available
web-service framework (http://theadvisor.osu.edu/) which currently uses the
data from DBLP and CiteSeer to construct the proposed citation graph.
","[{'version': 'v1', 'created': 'Sat, 5 May 2012 14:48:54 GMT'}]",2012-05-08,"[['Küçüktunç', 'Onur', ''], ['Saule', 'Erik', ''], ['Kaya', 'Kamer', ''], ['Çatalyürek', 'Ümit V.', '']]","['Literature search', 'graph', 'random walks', 'paper recommendation', 'web service']"
16897,0712.3757,Alexander Kholosha,Tor Helleseth and Alexander Kholosha and Aina Johanssen,$m$-Sequences of Different Lengths with Four-Valued Cross Correlation,26 pages,,,,cs.DM cs.CR,,"  {\bf Abstract.} Considered is the distribution of the cross correlation
between $m$-sequences of length $2^m-1$, where $m$ is even, and $m$-sequences
of shorter length $2^{m/2}-1$. The infinite family of pairs of $m$-sequences
with four-valued cross correlation is constructed and the complete correlation
distribution of this family is determined.
","[{'version': 'v1', 'created': 'Fri, 21 Dec 2007 17:31:27 GMT'}]",2007-12-24,"[['Helleseth', 'Tor', ''], ['Kholosha', 'Alexander', ''], ['Johanssen', 'Aina', '']]","['m-sequences', 'cross correlation', 'linearized polynomials']"
16898,1105.0362,Achoura Najoua Mrs,Najoua Achoura And Ridha Bouallegue,Impact of Limited Feedback on MIMO-OFDM Systems using Joint Beamforming,,"International Journal of Wireless & Mobile Networks (IJWMN) Vol.
  3, No. 2, April 2011, 39-45",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In multi input multi output antenna systems, beamforming is a technique for
guarding against the negative effects of fading. However, this technique
requires the transmitter to have perfect knowledge of the channel which is
often not available a priori. A solution to overcome this problem is to design
the beamforming vector using a limited number of feedback bits sent from the
receiver to the transmitter. In the case of limited feedback, the beamforming
vector is limited to lie in a codebook that is known to both the transmitter
and receiver.When the feedback is strictly limited, important issues are how to
quantize the information needed at the transmitter and how much improvement in
associated performance can be obtained as a function of the amount of feedback
available.In this paper channel quantization schema using simple approach to
codebook design (random vector quantization)is illustrated. Performance results
show that even with a few bits of feedback, performance can be close to that
with perfect channel knowledge at the transmitter.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2011 09:02:19 GMT'}]",2011-05-03,"[['Bouallegue', 'Najoua Achoura And Ridha', '']]","['MIMO', 'OFDM', 'Linear precoding', 'CSIT', 'Random Vector Quantization']"
16899,1507.01767,Frank Kammer,Amr Elmasry and Frank Kammer,Space-Efficient Plane-Sweep Algorithms,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce space-efficient plane-sweep algorithms for basic planar
geometric problems. It is assumed that the input is in a read-only array of $n$
items and that the available workspace is $\Theta(s)$ bits, where $\lg n \leq s
\leq n \cdot \lg n$. Three techniques that can be used as general tools in
different space-efficient algorithms are introduced and employed within our
algorithms. In particular, we give an almost-optimal algorithm for finding the
closest pair among a set of $n$ points that runs in $O(n^2/s + n \cdot \lg s)$
time. We also give a simple algorithm to enumerate the intersections of $n$
line segments that runs in $O((n^2/s^{2/3}) \cdot \lg s + k)$ time, where $k$
is the number of intersections. The counting version can be solved in
$O((n^2/s^{2/3}) \cdot \lg s)$~time. When the segments are axis-parallel, we
give an $O((n^2/s) \cdot \lg^{4/3} s + n^{4/3} \cdot \lg^{1/3} n)$-time
algorithm for counting the intersections, and an algorithm for enumerating the
intersections that runs in $O((n^2/s) \cdot \lg s \cdot \lg \lg s + n \cdot \lg
s + k)$ time, where $k$ is the number of intersections. We finally present an
algorithm that runs in $O((n^2/s + n \cdot \lg s) \cdot \sqrt{(n/s) \cdot \lg
n})$ time to calculate Klee's measure of axis-parallel rectangles.
","[{'version': 'v1', 'created': 'Tue, 7 Jul 2015 11:53:49 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Apr 2016 19:47:12 GMT'}]",2016-04-25,"[['Elmasry', 'Amr', ''], ['Kammer', 'Frank', '']]","['closest pair', 'line-segments intersection', 'Klee’s measure']"
16900,1111.3758,Sugata Sanyal,"Soumyendu Das, Subhendu Das, Bijoy Bandyopadhyay, Sugata Sanyal",Steganography and Steganalysis: Different Approaches,"11 Pages, 5 Figures; International Journal of Computers, Information
  Technology and Engineering (IJCITAE), Vol. 2, No 1, June, 2008, Serial
  Publications",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Steganography is the technique of hiding confidential information within any
media. Steganography is often confused with cryptography because the two are
similar in the way that they both are used to protect confidential information.
The difference between the two is in the appearance in the processed output;
the output of steganography operation is not apparently visible but in
cryptography the output is scrambled so that it can draw attention. Steganlysis
is process to detect of presence of steganography. In this article we have
tried to elucidate the different approaches towards implementation of
steganography using 'multimedia' file (text, static image, audio and video) and
Network IP datagram as cover. Also some methods of steganalysis will be
discussed.
","[{'version': 'v1', 'created': 'Wed, 16 Nov 2011 10:44:11 GMT'}]",2011-11-17,"[['Das', 'Soumyendu', ''], ['Das', 'Subhendu', ''], ['Bandyopadhyay', 'Bijoy', ''], ['Sanyal', 'Sugata', '']]","['Steganography', 'Steganalysis', 'Discrete Cosine Transformation (DCT)', 'Ipv4 header', 'IP datagram fragmentation']"
16901,1511.04026,Mohammed Al-Sarem,Mohammed Al-Sarem,"Building a Decision Tree Model for Academic Advising Affairs Based on
  the Algorithm C 4-5",,,,,cs.OH,http://creativecommons.org/publicdomain/zero/1.0/,"  The ability to recognize students weakness and solve any problem that may
confront them in timely fashion is always a target for all educational
institutions. Thus, colleges and universities implement the so-called academic
advising affairs. On the academic advisor relies the responsibility of solving
any problem that may confront students learning progress. This paper shows how
the adviser can benefit from data mining techniques, namely decision trees
techniques. The C 4.5 algorithm is used as a method for building such trees.
The output is evaluated based on the accuracy measure, Kappa measure, and ROC
area. The difference between the registered and gained credit hours is
considered as the main attribute on which advisor can rely
","[{'version': 'v1', 'created': 'Tue, 10 Nov 2015 19:47:05 GMT'}]",2015-11-13,"[['Al-Sarem', 'Mohammed', '']]","['Decision tree', 'data mining', 'C4.5 algorithm', 'academic advisory']"
16902,1105.1720,Wajeb Gharibi,"Wajeb Gharibi, Abdulrahman Mirza","Software Vulnerabilities, Banking Threats, Botnets and Malware
  Self-Protection Technologies",5 pages,"IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 1, January 2011, 236-241",,,cs.NI cs.CR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information security is the protection of information from a wide range of
threats in order to ensure success business continuity by minimizing risks and
maximizing the return of investments and business opportunities. In this paper,
we study and discuss the software vulnerabilities, banking threats, botnets and
propose the malware self-protection technologies.
","[{'version': 'v1', 'created': 'Mon, 9 May 2011 16:36:51 GMT'}]",2011-05-10,"[['Gharibi', 'Wajeb', ''], ['Mirza', 'Abdulrahman', '']]","['Informatics', 'Information Security', 'Cyber Threats', 'Malware Self-Protection Technologies']"
16903,1609.06323,Benjamin Hughes,"Benjamin Hughes, Tilo Burghardt",Automated Visual Fin Identification of Individual Great White Sharks,"17 pages, 16 figures. To be published in IJCV. Article replaced to
  update first author contact details and to correct a Figure reference on page
  6",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses the automated visual identification of individual great
white sharks from dorsal fin imagery. We propose a computer vision photo ID
system and report recognition results over a database of thousands of
unconstrained fin images. To the best of our knowledge this line of work
establishes the first fully automated contour-based visual ID system in the
field of animal biometrics. The approach put forward appreciates shark fins as
textureless, flexible and partially occluded objects with an individually
characteristic shape. In order to recover animal identities from an image we
first introduce an open contour stroke model, which extends multi-scale region
segmentation to achieve robust fin detection. Secondly, we show that
combinatorial, scale-space selective fingerprinting can successfully encode fin
individuality. We then measure the species-specific distribution of visual
individuality along the fin contour via an embedding into a global `fin space'.
Exploiting this domain, we finally propose a non-linear model for individual
animal recognition and combine all approaches into a fine-grained
multi-instance framework. We provide a system evaluation, compare results to
prior work, and report performance and properties in detail.
","[{'version': 'v1', 'created': 'Tue, 20 Sep 2016 20:00:12 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Oct 2016 16:32:53 GMT'}]",2016-10-04,"[['Hughes', 'Benjamin', ''], ['Burghardt', 'Tilo', '']]","['animal biometrics', 'textureless objectrecognition', 'shape analysis']"
16904,1208.1670,Josphineleela Ramakrishnan,"Josphineleela Ramakrishnan, Ramakrishnan Malaisamy","Performance Measurement and Method Analysis (PMMA) for Fingerprint
  Reconstruction","4pages,1 figure,1 table",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fingerprint reconstruction is one of the most well-known and publicized
biometrics. Because of their uniqueness and consistency over time, fingerprints
have been used for identification over a century, more recently becoming
automated due to advancements in computed capabilities. Fingerprint
reconstruction is popular because of the inherent ease of acquisition, the
numerous sources (e.g. ten fingers) available for collection, and their
established use and collections by law enforcement and immigration.
Fingerprints have always been the most practical and positive means of
identification. Offenders, being well aware of this, have been coming up with
ways to escape identification by that means. Erasing left over fingerprints,
using gloves, fingerprint forgery; are certain examples of methods tried by
them, over the years. Failing to prevent themselves, they moved to an extent of
mutilating their finger skin pattern, to remain unidentified. This article is
based upon obliteration of finger ridge patterns and discusses some known cases
in relation to the same, in chronological order; highlighting the reasons why
offenders go to an extent of performing such act. The paper gives an overview
of different methods and performance measurement of the fingerprint
reconstruction.
","[{'version': 'v1', 'created': 'Wed, 8 Aug 2012 14:15:38 GMT'}]",2012-08-09,"[['Ramakrishnan', 'Josphineleela', ''], ['Malaisamy', 'Ramakrishnan', '']]","['Fingerprint reconstruction', 'Immigration', 'Obliteration', 'Fingerprint forgery']"
16905,1401.6541,Tao Yang,"Tao Yang, Ziyang Meng, Guodong Shi, Yiguang Hong, Karl Henrik
  Johansson","Network Synchronization with Nonlinear Dynamics and Switching
  Interactions","27 pages, 0 figures",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the synchronization problem for networks of coupled
nonlinear dynamical systems under switching communication topologies. Two types
of nonlinear agent dynamics are considered. The first one is non-expansive
dynamics (stable dynamics with a convex Lyapunov function $\varphi(\cdot)$) and
the second one is dynamics that satisfies a global Lipschitz condition. For the
non-expansive case, we show that various forms of joint connectivity for
communication graphs are sufficient for networks to achieve global asymptotic
$\varphi$-synchronization. We also show that $\varphi$-synchronization leads to
state synchronization provided that certain additional conditions are
satisfied. For the globally Lipschitz case, unlike the non-expansive case,
joint connectivity alone is not sufficient for achieving synchronization. A
sufficient condition for reaching global exponential synchronization is
established in terms of the relationship between the global Lipschitz constant
and the network parameters. We also extend the results to leader-follower
networks.
","[{'version': 'v1', 'created': 'Sat, 25 Jan 2014 14:41:21 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Dec 2014 07:01:30 GMT'}, {'version': 'v3', 'created': 'Mon, 24 Aug 2015 03:40:44 GMT'}]",2015-08-25,"[['Yang', 'Tao', ''], ['Meng', 'Ziyang', ''], ['Shi', 'Guodong', ''], ['Hong', 'Yiguang', ''], ['Johansson', 'Karl Henrik', '']]","['Multi-agent systems', 'nonlinear agents', 'switching interactions', 'synchronization']"
16906,1108.6223,Mark Levin,Mark Sh. Levin,Towards Configuration of applied Web-based information system,"13 pages, 9 tables, 17 figures",,,,cs.SE cs.AI cs.DM cs.NI cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the paper, combinatorial synthesis of structure for applied Web-based
systems is described. The problem is considered as a combination of selected
design alternatives for system parts/components into a resultant composite
decision (i.e., system configuration design). The solving framework is based on
Hierarchical Morphological Multicriteria Design (HMMD) approach: (i)
multicriteria selection of alternatives for system parts, (ii) composing the
selected alternatives into a resultant combination (while taking into account
ordinal quality of the alternatives above and their compatibility). A
lattice-based discrete space is used to evaluate (to integrate) quality of the
resultant combinations (i.e., composite system decisions or system
configurations). In addition, a simplified solving framework based on
multicriteria multiple choice problem is considered. A multistage design
process to obtain a system trajectory is described as well. The basic applied
example is targeted to an applied Web-based system for a communication service
provider. Two other applications are briefly described (corporate system and
information system for academic application).
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2011 13:26:14 GMT'}]",2011-09-05,"[['Levin', 'Mark Sh.', '']]","['Web-based system', 'System design', 'Communication provider', 'Configuration', 'Composition', 'Synthesis', 'Combinatorial optimization']"
16907,1205.0110,Jung-Hun Yang,"Jung-Hun Yang, Dick Ettema, Koen Frenken, Frank Van Oort and Evert-Jan
  Visser",Modelling spatial patterns of economic activity in the Netherlands,16 pages,"Proceedings of Computers on Urban Planning and Urban Management,
  HongKong, 2009",,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding how spatial configurations of economic activity emerge is
important when formulating spatial planning and economic policy. Not only
micro-simulation and agent-based model such as UrbanSim, ILUMAS and SIMFIRMS,
but also Simon's model of hierarchical concentration have widely applied, for
this purpose. These models, however, have limitations with respect to
simulating structural changes in spatial economic systems and the impact of
proximity. The present paper proposes a model of firm development that is based
on behavioural rules such as growth, closure, spin-off and relocation. An
important aspect of the model is that locational preferences of firms are based
on agglomeration advantages, accessibility of markets and congestion, allowing
for a proper description of concentration and deconcentration tendencies. By
comparing the outcomes of the proposed model with real world data, we will
calibrate the parameters and assess how well the model predicts existing
spatial configurations and decide. The model is implemented as an agent-based
simulation model describing firm development in the Netherlands in 21
industrial sectors from 1950 to 2004.
","[{'version': 'v1', 'created': 'Tue, 1 May 2012 08:47:55 GMT'}]",2012-05-02,"[['Yang', 'Jung-Hun', ''], ['Ettema', 'Dick', ''], ['Frenken', 'Koen', ''], ['Van Oort', 'Frank', ''], ['Visser', 'Evert-Jan', '']]","['Agent based simulation', 'Firm development', 'Spatial pattern', 'Economic']"
16908,1410.2686,F. Ozgur Catak,"Ferhat \""Ozg\""ur \c{C}atak","Polarization Measurement of High Dimensional Social Media Messages With
  Support Vector Machine Algorithm Using Mapreduce","12 pages, in Turkish",,,,cs.LG cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, we propose a new Support Vector Machine (SVM) training
algorithm based on distributed MapReduce technique. In literature, there are a
lots of research that shows us SVM has highest generalization property among
classification algorithms used in machine learning area. Also, SVM classifier
model is not affected by correlations of the features. But SVM uses quadratic
optimization techniques in its training phase. The SVM algorithm is formulated
as quadratic optimization problem. Quadratic optimization problem has $O(m^3)$
time and $O(m^2)$ space complexity, where m is the training set size. The
computation time of SVM training is quadratic in the number of training
instances. In this reason, SVM is not a suitable classification algorithm for
large scale dataset classification. To solve this training problem we developed
a new distributed MapReduce method developed. Accordingly, (i) SVM algorithm is
trained in distributed dataset individually; (ii) then merge all support
vectors of classifier model in every trained node; and (iii) iterate these two
steps until the classifier model converges to the optimal classifier function.
In the implementation phase, large scale social media dataset is presented in
TFxIDF matrix. The matrix is used for sentiment analysis to get polarization
value. Two and three class models are created for classification method.
Confusion matrices of each classification model are presented in tables. Social
media messages corpus consists of 108 public and 66 private universities
messages in Turkey. Twitter is used for source of corpus. Twitter user messages
are collected using Twitter Streaming API. Results are shown in graphics and
tables.
","[{'version': 'v1', 'created': 'Fri, 10 Oct 2014 06:42:25 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Mar 2015 05:56:51 GMT'}]",2015-03-12,"[['Çatak', 'Ferhat Özgür', '']]","['Big Data', 'Machine Learning', 'MapReduce', 'Social Media', 'Support Vector Machines']"
16909,1705.07674,Ahmed Alaa,"Ahmed M. Alaa, Jinsung Yoon, Scott Hu, and Mihaela van der Schaar","Individualized Risk Prognosis for Critical Care Patients: A Multi-task
  Gaussian Process Model",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We report the development and validation of a data-driven real-time risk
score that provides timely assessments for the clinical acuity of ward patients
based on their temporal lab tests and vital signs, which allows for timely
intensive care unit (ICU) admissions. Unlike the existing risk scoring
technologies, the proposed score is individualized; it uses the electronic
health record (EHR) data to cluster the patients based on their static
covariates into subcohorts of similar patients, and then learns a separate
temporal, non-stationary multi-task Gaussian Process (GP) model that captures
the physiology of every subcohort. Experiments conducted on data from a
heterogeneous cohort of 6,094 patients admitted to the Ronald Reagan UCLA
medical center show that our risk score significantly outperforms the
state-of-the-art risk scoring technologies, such as the Rothman index and MEWS,
in terms of timeliness, true positive rate (TPR), and positive predictive value
(PPV). In particular, the proposed score increases the AUC with 20% and 38% as
compared to Rothman index and MEWS respectively, and can predict ICU admissions
8 hours before clinicians at a PPV of 35% and a TPR of 50%. Moreover, we show
that the proposed risk score allows for better decisions on when to discharge
clinically stable patients from the ward, thereby improving the efficiency of
hospital resource utilization.
","[{'version': 'v1', 'created': 'Mon, 22 May 2017 11:27:58 GMT'}]",2017-05-23,"[['Alaa', 'Ahmed M.', ''], ['Yoon', 'Jinsung', ''], ['Hu', 'Scott', ''], ['van der Schaar', 'Mihaela', '']]","['Critical Care Prognostication', 'Gaussian Process', 'IntensiveCare Unit', 'Personalized Medicine']"
16910,1010.4986,Emmanouil Panaousis A,"Emmanouil A. Panaousis and George Drew and Grant P. Millar and Tipu A.
  Ramrekha and Christos Politis",A Testbed Implementation for Securing OLSR in Mobile Ad hoc Networks,"20 pages, 13 figures","E.A. Panaousis, G. Drew, G. Millar, T.A. Ramrekha, C. Politis, ""A
  Test-bed Implementation for Securing OLSR in Mobile Ad-hoc Networks,""
  International Journal of Network Security & Its Applications, Vol. 2, No. 4,
  October, 2010",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Contemporary personal computing devices are increasingly required to be
portable and mobile enabling user's wireless access, to wired network
infrastructures and services. This approach to mobile computing and
communication is only appropriate in situations where a coherent infrastructure
is available. There are many situations where these requirements are not
fulfilled such as; developing nations, rural areas, natural disasters, and
military conflicts to name but a few. A practical solution is to use mobile
devices interconnected via a wireless medium to form a network, known as a
Mobile Ad-hoc Network (MANET), and provide the services normally found in wired
networks. Security in MANETs is an issue of paramount importance due to the
wireless nature of the communication links. Additionally due to the lack of
central administration security issues are different from conventional
networks. For the purposes of this article we have used the ""WMN test-bed"" to
enable secure routing in MANETs. The use of cryptography is an efficient proven
way of securing data in communications, but some cryptographic algorithms are
not as efficient as others and require more processing power, which is
detrimental to MANETs. In this article we have assessed different cryptographic
approaches to securing the OLSR (Optimised Link State Routing) protocol to
provide a basis for research. We conclude the paper with a series of
performance evaluation results regarding different cryptographic and hashing
schemes. Our findings clearly show that the most efficient combination of
algorithms used for authentication and encryption are SHA-1 and AES
respectively. Using this combination over their counterparts will lead to a
considerable reduction in processing time and delay on the network, creating an
efficient transaction moving towards satisfying resource constraints and
security requirements.
","[{'version': 'v1', 'created': 'Sun, 24 Oct 2010 18:24:44 GMT'}]",2010-11-13,"[['Panaousis', 'Emmanouil A.', ''], ['Drew', 'George', ''], ['Millar', 'Grant P.', ''], ['Ramrekha', 'Tipu A.', ''], ['Politis', 'Christos', '']]","['Mobile Ad-hoc Network', 'Routing', 'Security']"
16911,1704.07004,Hanwen Wu,Hanwen Wu and Hongwei Xi,Dependent Session Types,,,,,cs.PL cs.DC,http://creativecommons.org/licenses/by/4.0/,"  Session types offer a type-based discipline for enforcing communication
protocols in distributed programming. We have previously formalized simple
session types in the setting of multi-threaded $\lambda$-calculus with linear
types. In this work, we build upon our earlier work by presenting a form of
dependent session types (of DML-style). The type system we formulate provides
linearity and duality guarantees with no need for any runtime checks or special
encodings. Our formulation of dependent session types is the first of its kind,
and it is particularly suitable for practical implementation. As an example, we
describe one implementation written in ATS that compiles to an Erlang/Elixir
back-end.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 00:33:36 GMT'}]",2017-04-25,"[['Wu', 'Hanwen', ''], ['Xi', 'Hongwei', '']]","['session types', 'linear types', 'dependent types', 'lambda calculus']"
16912,1203.1463,Anuj Gupta,Anuj Gupta and Prasant Gopal and Piyush Bansal and Kannan Srinathan,A New Look at Composition of Authenticated Byzantine Generals,"27 pages. Keywords: Protocol composition, Authenticated Byzantine
  Generals, Universal composability, Unique session identifiers",,,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of Authenticated Byzantine Generals (ABG) aims to simulate a
virtual reliable broadcast channel from the General to all the players via a
protocol over a real (point-to-point) network in the presence of faults. We
propose a new model to study the self-composition of ABG protocols. The central
dogma of our approach can be phrased as follows: Consider a player who
diligently executes (only) the delegated protocol but the adversary steals some
private information from him. Should such a player be considered faulty? With
respect to ABG protocols, we argue that the answer has to be no.
  In the new model we show that in spite of using unique session identifiers,
if $n < 2t$, there cannot exist any ABG protocol that composes in parallel even
twice. Further, for $n \geq 2t$, we design ABG protocols that compose for any
number of parallel executions. Besides investigating the composition of ABG
under a new light, our work also brings out several new insights into Canetti's
Universal Composability framework. Specifically, we show that there are several
undesirable effects if one deviates from our dogma. This provides further
evidence as to why our dogma is the right framework to study the composition of
ABG protocols.
","[{'version': 'v1', 'created': 'Wed, 7 Mar 2012 13:29:31 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Jul 2012 04:08:55 GMT'}]",2012-07-11,"[['Gupta', 'Anuj', ''], ['Gopal', 'Prasant', ''], ['Bansal', 'Piyush', ''], ['Srinathan', 'Kannan', '']]","['Protocol composition', 'Authenticated Byzantine Generals', 'Universal composability', 'Unique session identifiers']"
16913,1702.06332,Fabio Maria Carlucci,"Fabio Maria Carlucci and Lorenzo Porzi and Barbara Caputo and Elisa
  Ricci and Samuel Rota Bul\`o",Just DIAL: DomaIn Alignment Layers for Unsupervised Domain Adaptation,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The empirical fact that classifiers, trained on given data collections,
perform poorly when tested on data acquired in different settings is
theoretically explained in domain adaptation through a shift among
distributions of the source and target domains. Alleviating the domain shift
problem, especially in the challenging setting where no labeled data are
available for the target domain, is paramount for having visual recognition
systems working in the wild. As the problem stems from a shift among
distributions, intuitively one should try to align them. In the literature,
this has resulted in a stream of works attempting to align the feature
representations learned from the source and target domains. Here we take a
different route. Rather than introducing regularization terms aiming to promote
the alignment of the two representations, we act at the distribution level
through the introduction of \emph{DomaIn Alignment Layers} (\DIAL), able to
match the observed source and target data distributions to a reference one.
Thorough experiments on three different public benchmarks we confirm the power
of our approach.
","[{'version': 'v1', 'created': 'Tue, 21 Feb 2017 11:23:48 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Apr 2017 12:34:28 GMT'}, {'version': 'v3', 'created': 'Thu, 27 Apr 2017 08:45:08 GMT'}]",2017-04-28,"[['Carlucci', 'Fabio Maria', ''], ['Porzi', 'Lorenzo', ''], ['Caputo', 'Barbara', ''], ['Ricci', 'Elisa', ''], ['Bulò', 'Samuel Rota', '']]","['unsupervised domain adaptation', 'deep models', 'feature normalization', 'entropy loss']"
16914,1701.05766,Osman Tursun,"Osman Tursun, Cemal Aker, Sinan Kalkan",A Large-scale Dataset and Benchmark for Similar Trademark Retrieval,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Trademark retrieval (TR) has become an important yet challenging problem due
to an ever increasing trend in trademark applications and infringement
incidents. There have been many promising attempts for the TR problem, which,
however, fell impracticable since they were evaluated with limited and mostly
trivial datasets. In this paper, we provide a large-scale dataset with
benchmark queries with which different TR approaches can be evaluated
systematically. Moreover, we provide a baseline on this benchmark using the
widely-used methods applied to TR in the literature. Furthermore, we identify
and correct two important issues in TR approaches that were not addressed
before: reversal of contrast, and presence of irrelevant text in trademarks
severely affect the TR methods. Lastly, we applied deep learning, namely,
several popular Convolutional Neural Network models, to the TR problem. To the
best of the authors, this is the first attempt to do so.
","[{'version': 'v1', 'created': 'Fri, 20 Jan 2017 11:36:30 GMT'}, {'version': 'v2', 'created': 'Sat, 14 Oct 2017 11:44:56 GMT'}]",2017-10-17,"[['Tursun', 'Osman', ''], ['Aker', 'Cemal', ''], ['Kalkan', 'Sinan', '']]","['Trademark Retrieval', 'Benchmark', 'Comparison', 'Deep Learning']"
16915,1208.2675,Gerald Paul,Gerald Paul,"A GPU implementation of the Simulated Annealing Heuristic for the
  Quadratic Assignment Problem",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The quadratic assignment problem (QAP) is one of the most difficult
combinatorial optimization problems. An effective heuristic for obtaining
approximate solutions to the QAP is simulated annealing (SA). Here we describe
an SA implementation for the QAP which runs on a graphics processing unit
(GPU). GPUs are composed of low cost commodity graphics chips which in
combination provide a powerful platform for general purpose parallel computing.
For SA runs with large numbers of iterations, we find performance 50-100 times
better than that of a recent non-parallel but very efficient implementation of
SA for the QAP
","[{'version': 'v1', 'created': 'Mon, 13 Aug 2012 19:30:44 GMT'}]",2015-03-20,"[['Paul', 'Gerald', '']]","['quadratic assignment problem', 'simulated annealing', 'graphics processing unit']"
16916,1003.5342,Samih Mohammed Mostafa,Samih Mohemmed Mostafa,"Improving Waiting Time of Tasks Scheduled Under Preemptive Round Robin
  Using Changeable Time Quantum",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Minimizing waiting time for tasks waiting in the queue for execution is one
of the important scheduling cri-teria which took a wide area in scheduling
preemptive tasks. In this paper we present Changeable Time Quan-tum (CTQ)
approach combined with the round-robin algorithm, we try to adjust the time
quantum according to the burst times of the tasks in the ready queue. There are
two important benefits of using (CTQ) approach: minimizing the average waiting
time of the tasks, consequently minimizing the average turnaround time, and
keeping the number of context switches as low as possible, consequently
minimizing the scheduling overhead. In this paper, we consider the scheduling
problem for preemptive tasks, where the time costs of these tasks are known a
priori. Our experimental results demonstrate that CTQ can provide much lower
scheduling overhead and better scheduling criteria.
","[{'version': 'v1', 'created': 'Sun, 28 Mar 2010 06:34:20 GMT'}]",2010-03-30,"[['Mostafa', 'Samih Mohemmed', '']]","['Processor sharing', 'proportional sharing', 'residual time', 'survived tasks', 'cyclic queue']"
16917,1603.03464,Wengu Chen,Wengu Chen and Yaling Li,"Recovery of signals under the high order RIP condition via prior support
  information",,,,,cs.IT math.CA math.FA math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we study the recovery conditions of weighted $l_{1}$
minimization for signal reconstruction from incomplete linear measurements when
partial prior support information is available. We obtain that a high order RIP
condition can guarantee stable and robust recovery of signals in bounded
$l_{2}$ and Dantzig selector noise settings. Meanwhile, we not only prove that
the sufficient recovery condition of weighted $l_{1}$ minimization method is
weaker than that of standard $l_{1}$ minimization method, but also prove that
weighted $l_{1}$ minimization method provides better upper bounds on the
reconstruction error in terms of the measurement noise and the compressibility
of the signal, provided that the accuracy of prior support estimate is at least
$50\%$. Furthermore, the condition is proved sharp.
","[{'version': 'v1', 'created': 'Sat, 27 Feb 2016 05:43:01 GMT'}]",2016-03-14,"[['Chen', 'Wengu', ''], ['Li', 'Yaling', '']]","['Compressed sensing', 'restricted isometry property', 'weighted l1 minimization']"
16918,1506.01977,Tim Weninger PhD,"Maria Glenski, Thomas J. Johnston, Tim Weninger","Random Voting Effects in Social-Digital Spaces: A case study of Reddit
  Post Submissions",Paper preprint accepted to 2015 ACM Hypertext Conference,,,,cs.SI cs.CY cs.MM,http://creativecommons.org/licenses/by/3.0/,"  At a time when information seekers first turn to digital sources for news and
opinion, it is critical that we understand the role that social media plays in
human behavior. This is especially true when information consumers also act as
information producers and editors by their online activity. In order to better
understand the effects that editorial ratings have on online human behavior, we
report the results of a large-scale in-vivo experiment in social media. We find
that small, random rating manipulations on social media submissions created
significant changes in downstream ratings resulting in significantly different
final outcomes. Positive treatment resulted in a positive effect that increased
the final rating by 11.02% on average. Compared to the control group, positive
treatment also increased the probability of reaching a high rating (>=2000) by
24.6%. Contrary to the results of related work we also find that negative
treatment resulted in a negative effect that decreased the final rating by
5.15% on average.
","[{'version': 'v1', 'created': 'Fri, 5 Jun 2015 17:11:53 GMT'}]",2015-06-08,"[['Glenski', 'Maria', ''], ['Johnston', 'Thomas J.', ''], ['Weninger', 'Tim', '']]","['social media', 'voting', 'herding effects']"
16919,1406.6778,Chandrakant  MAHOBIYA,"Chandrakant Mahobiya, M. Kumar",Performance Comparison of Two Streaming Data Clustering Algorithms,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The weighted fuzzy c-mean clustering algorithm and weighted fuzzy
c-mean-adaptive cluster number are extension of traditional fuzzy c-mean
Algorithm to stream data clustering algorithm.
","[{'version': 'v1', 'created': 'Thu, 26 Jun 2014 06:09:26 GMT'}]",2014-06-27,"[['Mahobiya', 'Chandrakant', ''], ['Kumar', 'M.', '']]","['Streaming data', 'weighted fuzzy c-mean', 'weighted fuzzy c-mean-adaptive clustering']"
16920,1511.02420,Ehsan Lotfi,Ehsan Lotfi,"Design of an Alarm System for Isfahan Ozone Level based on Artificial
  Intelligence Predictor Models",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ozone level prediction is an important task of air quality agencies of
modern cities. In this paper, we design an ozone level alarm system (OLP) for
Isfahan city and test it through the real word data from 1-1-2000 to 7-6-2011.
We propose a computer based system with three inputs and single output. The
inputs include three sensors of solar ultraviolet (UV), total solar radiation
(TSR) and total ozone (O3). And the output of the system is the predicted O3 of
the next day and the alarm massages. A developed artificial intelligence (AI)
algorithm is applied to determine the output, based on the inputs variables.
For this issue, AI models, including supervised brain emotional learning (BEL),
adaptive neuro-fuzzy inference system (ANFIS) and artificial neural networks
(ANNs), are compared in order to find the best model. The simulation of the
proposed system shows that it can be used successfully in prediction of major
cities ozone level.
","[{'version': 'v1', 'created': 'Sun, 8 Nov 2015 01:01:11 GMT'}]",2015-11-10,"[['Lotfi', 'Ehsan', '']]","['ozone predictor', 'artificial intelligence', 'UV     1']"
16921,1802.06636,J\'er\'emie Chalopin,"Evangelos Bampas, J\'er\'emie Chalopin, Shantanu Das, Jan Hackfeld,
  Christina Karousatou",Maximal Exploration of Trees with Energy-Constrained Agents,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of exploring an unknown tree with a team of $k$
initially colocated mobile agents. Each agent has limited energy and cannot, as
a result, traverse more than $B$ edges. The goal is to maximize the number of
nodes collectively visited by all agents during the execution. Initially, the
agents have no knowledge about the structure of the tree, but they gradually
discover the topology as they traverse new edges. We assume that the agents can
communicate with each other at arbitrary distances. Therefore the knowledge
obtained by one agent after traversing an edge is instantaneously transmitted
to the other agents. We propose an algorithm that divides the tree into
subtrees during the exploration process and makes a careful trade-off between
breadth-first and depth-first exploration. We show that our algorithm is
3-competitive compared to an optimal solution that we could obtain if we knew
the map of the tree in advance. While it is easy to see that no algorithm can
be better than 2-competitive, we give a non-trivial lower bound of 2.17 on the
competitive ratio of any online algorithm.
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 14:11:50 GMT'}]",2018-02-20,"[['Bampas', 'Evangelos', ''], ['Chalopin', 'Jérémie', ''], ['Das', 'Shantanu', ''], ['Hackfeld', 'Jan', ''], ['Karousatou', 'Christina', '']]","['graph exploration', 'mobile agents', 'online algorithm']"
16922,1205.3570,Gopalakrishnan Tr Nair,"Mary Cherian, T.R Gopalakrishnan Nair","A QoS-Aware Routing Protocol for Real-time Applications in Wireless
  Sensor Networks","10 pages. arXiv admin note: text overlap with arXiv:1001.5339 by
  other authors","Innovative Systems Design and Engineering, ISSN 2222-1727
  (Paper),ISSN 2222-2871 (Online), Vol 2, No 7, 2011 pp. 84-93",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents a quality of service aware routing protocol which provides
low latency for high priority packets. Packets are differentiated based on
their priority by applying queuing theory. Low priority packets are transferred
through less energy paths. The sensor nodes interact with the pivot nodes which
in turn communicate with the sink node. This protocol can be applied in
monitoring context aware physical environments for critical applications.
","[{'version': 'v1', 'created': 'Wed, 16 May 2012 06:48:43 GMT'}]",2012-05-17,"[['Cherian', 'Mary', ''], ['Nair', 'T. R Gopalakrishnan', '']]","['Wireless Sensor Network (WSN)', 'Quality of service', 'Pivot Node', 'Queuing model']"
16923,1507.01082,Jaderick Pabico,Chezka Camille P. Arevalo and Jaderick P. Pabico,Preferential Attachment in an Internet-mediated Human Network,"5 pages, 3 figures, this version appeared in H.N. Adorna and R.P.
  Salda\~na (eds.) Proceedings (CDROM ISSN 1908-1146) of the 2009 Philippine
  Computing Science Congress, Silliman University, Dumaguete City, 2-3 March
  2009, pp 97-101","Philippine Computing Journal 2009, vol 4, num 1, pp 31-35 (ISSN
  1908-1995)",,,cs.SI physics.soc-ph,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In the advent of the Internet, web-mediated social networking has become of
great influence to Filipinos. Networking sites such as Friendster, YouTube,
FaceBook and MySpace are among the most well known sites on the Internet. These
sites provide a wide range of services to users from different parts of the
world, such as connecting and finding people, as well as, sharing and
organizing contents. The popularity and accessibility of these sites enable
information to be available. These allow people to analyze and study the
characteristics of the population of online social networks. In this study, we
developed a computer program to analyze the structural dynamics of a locally
popular social networking site: The Friendster Network. Understanding the
structural dynamics of a virtual community has many implications, such as
finding an improvement on the current networking system, among others. Based on
our analysis, we found out that users of the site exhibit preferential
attachment to users with high number of friends.
","[{'version': 'v1', 'created': 'Sat, 4 Jul 2015 09:00:32 GMT'}]",2015-07-07,"[['Arevalo', 'Chezka Camille P.', ''], ['Pabico', 'Jaderick P.', '']]","['preferential attachment', 'Internet', 'virtual community', 'socialnetworks']"
16924,1406.3280,Alban Ponse,Jan A. Bergstra and Alban Ponse,"Three Datatype Defining Rewrite Systems for Datatypes of Integers each
  extending a Datatype of Naturals","33 pages; 19 tables. All DDRSes in S.2 are proven ground-complete
  (gc). In S.3, the DDRS for Z_{ut} contains 16 equations and is proven gc; the
  DDRS for Z_{bt} has one more equation ([bt22]) and is proven gc; the DDRSes
  for N_{dt} (Table 14) and Z_{dt} (Table 16) are proven gc in [13]. In
  Appendix C, corrected versions of the DDRSes for N_{u'} and Z_{u'} are proven
  gc",,,,cs.LO cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Integer arithmetic is specified according to three views: unary, binary, and
decimal notation. The binary and decimal view have as their characteristic that
each normal form resembles common number notation, that is, either a digit, or
a string of digits without leading zero, or the negated versions of the latter.
The unary view comprises a specification of integer arithmetic based on 0,
successor function $S$, and predecessor function, with negative normal forms
$-S^i(0)$. Integer arithmetic in binary and decimal notation is based on
(postfix) digit append functions. For each view we define a ground-confluent
and terminating datatype defining rewrite system (DDRS), and in each case the
resulting datatype is a canonical term algebra that extends a corresponding
canonical term algebra for natural numbers.
  Then, for each view, we consider an alternative DDRS based on tree
constructors that yield comparable normal forms, which for that binary and
decimal view admits expressions that are algorithmically more involved. These
DDRSes are incorporated because they are closer to existing literature. For
these DDRSes we also provide ground-completeness results.
  Finally, we define a DDRS for the ring of Integers (comprising fifteen
rewrite rules) and prove its ground-completeness.
","[{'version': 'v1', 'created': 'Thu, 12 Jun 2014 16:21:18 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Aug 2014 12:21:03 GMT'}, {'version': 'v3', 'created': 'Wed, 3 Feb 2016 16:45:56 GMT'}, {'version': 'v4', 'created': 'Mon, 18 Jul 2016 11:45:16 GMT'}]",2016-07-19,"[['Bergstra', 'Jan A.', ''], ['Ponse', 'Alban', '']]","['Equational specification', 'Initial algebra', 'Datatype defining rewritesystem', 'Abstract datatype']"
16925,1206.3777,Mahjabeen Mirza Beg,Mahjabeen Mirza Beg and Monika Jain,An Analysis of the Methods Employed for Breast Cancer Diagnosis,"5 pages, 6 figures","International Journal of Research in Computer Science 2 (2012)
  25-29",,,cs.NE q-bio.TO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Breast cancer research over the last decade has been tremendous. The ground
breaking innovations and novel methods help in the early detection, in setting
the stages of the therapy and in assessing the response of the patient to the
treatment. The prediction of the recurrent cancer is also crucial for the
survival of the patient. This paper studies various techniques used for the
diagnosis of breast cancer. Different methods are explored for their merits and
de-merits for the diagnosis of breast lesion. Some of the methods are yet
unproven but the studies look very encouraging. It was found that the recent
use of the combination of Artificial Neural Networks in most of the instances
gives accurate results for the diagnosis of breast cancer and their use can
also be extended to other diseases.
","[{'version': 'v1', 'created': 'Sun, 17 Jun 2012 18:02:57 GMT'}]",2012-06-19,"[['Beg', 'Mahjabeen Mirza', ''], ['Jain', 'Monika', '']]","['Artificial neural network (ANN)', 'Breast cancer', 'Fuzzy Logic']"
16926,1701.05935,Ke Li Kl,"Ke Li, Kalyanmoy Deb and Xin Yao",Integration of Preferences in Decomposition Multi-Objective Optimization,,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most existing studies on evolutionary multi-objective optimization focus on
approximating the whole Pareto-optimal front. Nevertheless, rather than the
whole front, which demands for too many points (especially in a
high-dimensional space), the decision maker might only interest in a partial
region, called the region of interest. In this case, solutions outside this
region can be noisy to the decision making procedure. Even worse, there is no
guarantee that we can find the preferred solutions when tackling problems with
complicated properties or a large number of objectives. In this paper, we
develop a systematic way to incorporate the decision maker's preference
information into the decomposition-based evolutionary multi-objective
optimization methods. Generally speaking, our basic idea is a non-uniform
mapping scheme by which the originally uniformly distributed reference points
on a canonical simplex can be mapped to the new positions close to the
aspiration level vector specified by the decision maker. By these means, we are
able to steer the search process towards the region of interest either directly
or in an interactive manner and also handle a large number of objectives. In
the meanwhile, the boundary solutions can be approximated given the decision
maker's requirements. Furthermore, the extent of the region of the interest is
intuitively understandable and controllable in a closed form. Extensive
experiments, both proof-of-principle and on a variety of problems with 3 to 10
objectives, fully demonstrate the effectiveness of our proposed method for
approximating the preferred solutions in the region of interest.
","[{'version': 'v1', 'created': 'Fri, 20 Jan 2017 22:05:09 GMT'}]",2017-01-24,"[['Li', 'Ke', ''], ['Deb', 'Kalyanmoy', ''], ['Yao', 'Xin', '']]","['evolutionary multi-objective optimization', 'decomposition-based method', 'user-preferenceincorporation', 'reference points']"
16927,1605.00214,Boris Ryabko,Boris Ryabko,Information-Theoretical Analysis of Two Shannon's Ciphers,,,,,cs.CR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe generalized running key ciphers and apply them for analysis of
two Shannon's methods. In particular, we suggest some estimation of the cipher
equivocation and the probability of correct deciphering without key.
","[{'version': 'v1', 'created': 'Sun, 1 May 2016 08:13:31 GMT'}]",2016-05-03,"[['Ryabko', 'Boris', '']]","['running-key cipher', 'cipher equivocation', 'Shan']"
16928,1209.5025,Mohammed Amin Abdullah Dr,Mohammed Amin Abdullah and Moez Draief,"Global Majority Consensus by Local Majority Polling on Graphs of a Given
  Degree Sequence",Discrete Applied Mathematics 180:1-10 2015,,,,cs.DC math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Suppose in a graph $G$ vertices can be either red or blue. Let $k$ be odd. At
each time step, each vertex $v$ in $G$ polls $k$ random neighbours and takes
the majority colour. If it doesn't have $k$ neighbours, it simply polls all of
them, or all less one if the degree of $v$ is even. We study this protocol on
graphs of a given degree sequence, in the following setting: initially each
vertex of $G$ is red independently with probability $\alpha < \frac{1}{2}$, and
is otherwise blue. We show that if $\alpha$ is sufficiently biased, then with
high probability consensus is reached on the initial global majority within
$O(\log_k \log_k n)$ steps if $5 \leq k \leq d$, and $O(\log_d \log_d n)$ steps
if $k > d$. Here, $d\geq 5$ is the effective minimum degree, the smallest
integer which occurs $\Theta(n)$ times in the degree sequence. We further show
that on such graphs, any local protocol in which a vertex does not change
colour if all its neighbours have that same colour, takes time at least
$\Omega(\log_d \log_d n)$, with high probability. Additionally, we demonstrate
how the technique for the above sparse graphs can be applied in a
straightforward manner to get bounds for the Erd\H{o}s-R\'enyi random graphs in
the connected regime.
","[{'version': 'v1', 'created': 'Sat, 22 Sep 2012 22:32:57 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Feb 2013 22:00:31 GMT'}, {'version': 'v3', 'created': 'Tue, 30 Jul 2019 23:17:52 GMT'}]",2019-08-01,"[['Abdullah', 'Mohammed Amin', ''], ['Draief', 'Moez', '']]","['Local majority', 'consensus', 'social networks', 'distributedcomputing']"
16929,1106.1105,Bradly  Alicea,Bradly Alicea,Naturally Supervised Learning in Manipulable Technologies,"27 pages, 12 figures, 5 tables",,,,cs.HC q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The relationship between physiological systems and modern electromechanical
technologies is fast becoming intimate with high degrees of complex
interaction. It can be argued that muscular function, limb movements, and touch
perception serve supervisory functions for movement control in motion and
touch-based (e.g. manipulable) devices/interfaces and human-machine interfaces
in general. To get at this hypothesis requires the use of novel techniques and
analyses which demonstrate the multifaceted and regulatory role of adaptive
physiological processes in these interactions. Neuromechanics is an approach
that unifies the role of physiological function, motor performance, and
environmental effects in determining human performance. A neuromechanical
perspective will be used to explain the effect of environmental fluctuations on
supervisory mechanisms, which leads to adaptive physiological responses. Three
experiments are presented using two different types of virtual environment that
allowed for selective switching between two sets of environmental forces. This
switching was done in various ways to maximize the variety of results.
Electromyography (EMG) and kinematic information contributed to the development
of human performance-related measures. Both descriptive and specialized
analyses were conducted: peak amplitude analysis, loop trace analysis, and the
analysis of unmatched muscle power. Results presented here provide a window
into performance under a range of conditions. These analyses also demonstrated
myriad consequences for force-related fluctuations on dynamic physiological
regulation. The findings presented here could be applied to the dynamic control
of touch-based and movement-sensitive human-machine systems. In particular, the
design of systems such as human-robotic systems, touch screen devices, and
rehabilitative technologies could benefit from this research.
","[{'version': 'v1', 'created': 'Mon, 6 Jun 2011 16:01:10 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Mar 2012 13:49:43 GMT'}]",2012-03-15,"[['Alicea', 'Bradly', '']]","['Biomechanics', 'Brain-Computer Interfaces', 'Virtual Reality']"
16930,1110.1730,Shinichi Kuribayashi,Shin-ichi Kuribayashi,"Optimal Joint Multiple Resource Allocation Method for Cloud Computing
  Environments",,"International Journal of Research and Reviews in Computer Science
  (IJRRCS), Vol.2, No.1, March 2011",,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing is a model for enabling convenient, on-demand network access
to a shared pool of configurable computing resources. To provide cloud
computing services economically, it is important to optimize resource
allocation under the assumption that the required resource can be taken from a
shared resource pool. In addition, to be able to provide processing ability and
storage capacity, it is necessary to allocate bandwidth to access them at the
same time.
  This paper proposes an optimal resource allocation method for cloud computing
environments. First, this paper develops a resource allocation model of cloud
computing environments, assuming both processing ability and bandwidth are
allocated simultaneously to each service request and rented out on an hourly
basis. The allocated resources are dedicated to each service request. Next,
this paper proposes an optimal joint multiple resource allocation method, based
on the above resource allocation model. It is demonstrated by simulation
evaluation that the proposed method can reduce the request loss probability and
as a result, reduce the total resource required, compared with the conventional
allocation method. Then, this paper defines basic principles and a measure for
achieving fair resource allocation among multiple users in a cloud computing
environment, and proposes a fair joint multiple resource allocation method. It
is demonstrated by simulation evaluations that the proposed method enables the
fair resource allocation among multiple users without a large decline in
resource efficiency. Keywords: Cloud computing, joint multiple resource
allocation, fairness
","[{'version': 'v1', 'created': 'Sat, 8 Oct 2011 12:21:47 GMT'}]",2011-10-11,"[['Kuribayashi', 'Shin-ichi', '']]","['Cloud computing', 'joint multiple resource allocation', 'fairness  1']"
16931,1007.0626,Debotosh Bhattacharjee,"M. K. Bhowmik, Debotosh Bhattacharjee, M. Nasipuri, D. K. Basu, and M.
  Kundu","Fusion of Wavelet Coefficients from Visual and Thermal Face Images for
  Human Face Recognition - A Comparative Study",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a comparative study on fusion of visual and thermal
images using different wavelet transformations. Here, coefficients of discrete
wavelet transforms from both visual and thermal images are computed separately
and combined. Next, inverse discrete wavelet transformation is taken in order
to obtain fused face image. Both Haar and Daubechies (db2) wavelet transforms
have been used to compare recognition results. For experiments IRIS
Thermal/Visual Face Database was used. Experimental results using Haar and
Daubechies wavelets show that the performance of the approach presented here
achieves maximum success rate of 100% in many cases.
","[{'version': 'v1', 'created': 'Mon, 5 Jul 2010 07:33:45 GMT'}]",2010-07-06,"[['Bhowmik', 'M. K.', ''], ['Bhattacharjee', 'Debotosh', ''], ['Nasipuri', 'M.', ''], ['Basu', 'D. K.', ''], ['Kundu', 'M.', '']]","['Thermal image', 'Daubechies Wavelet Transform', 'Haar Wavelet Transform', 'Fusion', 'Principal Component Analysis (PCA)', 'Multi-layer Perceptron', 'Face Recognition']"
16932,1712.02768,Dimitris Konomis,"Christy Li, Dimitris Konomis, Graham Neubig, Pengtao Xie, Carol Cheng,
  Eric Xing",Convolutional Neural Networks for Medical Diagnosis from Admission Notes,,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  $\textbf{Objective}$ Develop an automatic diagnostic system which only uses
textual admission information from Electronic Health Records (EHRs) and assist
clinicians with a timely and statistically proved decision tool. The hope is
that the tool can be used to reduce mis-diagnosis.
  $\textbf{Materials and Methods}$ We use the real-world clinical notes from
MIMIC-III, a freely available dataset consisting of clinical data of more than
forty thousand patients who stayed in intensive care units of the Beth Israel
Deaconess Medical Center between 2001 and 2012. We proposed a Convolutional
Neural Network model to learn semantic features from unstructured textual input
and automatically predict primary discharge diagnosis.
  $\textbf{Results}$ The proposed model achieved an overall 96.11% accuracy and
80.48% weighted F1 score values on 10 most frequent disease classes,
significantly outperforming four strong baseline models by at least 12.7% in
weighted F1 score.
  $\textbf{Discussion}$ Experimental results imply that the CNN model is
suitable for supporting diagnosis decision making in the presence of complex,
noisy and unstructured clinical data while at the same time using fewer layers
and parameters that other traditional Deep Network models.
  $\textbf{Conclusion}$ Our model demonstrated capability of representing
complex medical meaningful features from unstructured clinical notes and
prediction power for commonly misdiagnosed frequent diseases. It can use easily
adopted in clinical setting to provide timely and statistically proved decision
support.
  $\textbf{Keywords}$ Convolutional neural network, text classification,
discharge diagnosis prediction, admission information from EHRs.
","[{'version': 'v1', 'created': 'Wed, 6 Dec 2017 08:39:29 GMT'}]",2017-12-08,"[['Li', 'Christy', ''], ['Konomis', 'Dimitris', ''], ['Neubig', 'Graham', ''], ['Xie', 'Pengtao', ''], ['Cheng', 'Carol', ''], ['Xing', 'Eric', '']]","['Convolutional neural network', 'text classification', 'discharge diagnosis prediction', 'admission information from EHRs']"
16933,1605.02935,Casper Bach Poulsen,Casper Bach Poulsen and Peter D. Mosses,Flag-Based Big-Step Semantics,"To appear in The Journal of Logical and Algebraic Methods in
  Programming, Special Issue: 26th Nordic Workshop for Programming Theory, 2014",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Structural operational semantic specifications come in different styles:
small-step and big-step. A problem with the big-step style is that specifying
divergence and abrupt termination gives rise to annoying duplication. We
present a novel approach to representing divergence and abrupt termination in
big-step semantics using status flags. This avoids the duplication problem, and
uses fewer rules and premises for representing divergence than previous
approaches in the literature.
","[{'version': 'v1', 'created': 'Tue, 10 May 2016 10:47:02 GMT'}]",2016-05-11,"[['Poulsen', 'Casper Bach', ''], ['Mosses', 'Peter D.', '']]","['structural operational semantics', 'SOS', 'coinduction', 'big-step semantics', 'natural semantics', 'small-step semantics']"
16934,1704.03057,Samet Hicsonmez,"Samet Hicsonmez, Nermin Samet, Fadime Sener, Pinar Duygulu","DRAW: Deep networks for Recognizing styles of Artists Who illustrate
  children's books",ACM ICMR 2017,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is motivated from a young boy's capability to recognize an
illustrator's style in a totally different context. In the book ""We are All
Born Free"" [1], composed of selected rights from the Universal Declaration of
Human Rights interpreted by different illustrators, the boy was surprised to
see a picture similar to the ones in the ""Winnie the Witch"" series drawn by
Korky Paul (Figure 1). The style was noticeable in other characters of the same
illustrator in different books as well. The capability of a child to easily
spot the style was shown to be valid for other illustrators such as Axel
Scheffler and Debi Gliori. The boy's enthusiasm let us to start the journey to
explore the capabilities of machines to recognize the style of illustrators.
  We collected pages from children's books to construct a new illustrations
dataset consisting of about 6500 pages from 24 artists. We exploited deep
networks for categorizing illustrators and with around 94% classification
performance our method over-performed the traditional methods by more than 10%.
Going beyond categorization we explored transferring style. The classification
performance on the transferred images has shown the ability of our system to
capture the style. Furthermore, we discovered representative illustrations and
discriminative stylistic elements.
","[{'version': 'v1', 'created': 'Mon, 10 Apr 2017 21:03:51 GMT'}]",2017-04-12,"[['Hicsonmez', 'Samet', ''], ['Samet', 'Nermin', ''], ['Sener', 'Fadime', ''], ['Duygulu', 'Pinar', '']]","['Deep Learning for Art Analysis', 'Illustrator Classifcation', 'Convolutional Neural Networks']"
16935,1407.2883,Atanu Roy,"Ayush Singhal, Atanu Roy, Jaideep Srivastava",Understanding Co-evolution in Large Multi-relational Social Networks,,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding dynamics of evolution in large social networks is an important
problem. In this paper, we characterize evolution in large multi-relational
social networks. The proliferation of online media such as Twitter, Facebook,
Orkut and MMORPGs\footnote{Massively Multi-player Online Role Playing Games}
have created social networking data at an unprecedented scale. Sony's Everquest
2 is one such example. We used game multi-relational networks to reveal the
dynamics of evolution in a multi-relational setting by macroscopic study of the
game network. Macroscopic analysis involves fragmenting the network into
smaller portions for studying the dynamics within these sub-networks, referred
to as `communities'. From an evolutionary perspective of multi-relational
network analysis, we have made the following contributions. Specifically, we
formulated and analyzed various metrics to capture evolutionary properties of
networks. We find that co-evolution rates in trust based `communities' are
approximately $60\%$ higher than the trade based `communities'. We also find
that the trust and trade connections within the `communities' reduce as their
size increases. Finally, we study the interrelation between the dynamics of
trade and trust within `communities' and find interesting results about the
precursor relationship between the trade and the trust dynamics within the
`communities'.
","[{'version': 'v1', 'created': 'Thu, 10 Jul 2014 18:04:44 GMT'}]",2014-07-11,"[['Singhal', 'Ayush', ''], ['Roy', 'Atanu', ''], ['Srivastava', 'Jaideep', '']]","['Evolution', 'communities', 'co-evolution', 'multirelational network', 'trust dynamics', 'influence dynamics']"
16936,1403.8123,Jihua Lu Dr,"Jihua Lu, Jianping An, Xiangming Li, Jie Yang and Lei Yang","A Percolation based M2M Networking Architecture for Data Transmission
  and Routing","15 pages, 7 figures. We propose a percolation based routing and data
  transmission method for the M2M network, which consists of routing phase and
  transmission phases. In the routing phase, probes packets are transmitted and
  flowed in the network, multiple paths are built to form a route. After that,
  the data file will be fountain encoded and the transmitted","KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS VOL. 6, NO.
  2, Feb 2012",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a percolation based M2M networking architecture and its data
transmission method. The proposed network architecture can be server-free and
router-free, which allows us to operate routing efficiently with percolations
based on six degrees of separation theory in small world network modeling. The
data transmission can be divided into two phases: routing and data transmission
phases. In the routing phase, probe packets will be transmitted and forwarded
in the network thus multiple paths are selected and performed based on the
constriction of the maximum hop number. In the second phase, the information
will be encoded, say, with the fountain codes, and transmitted using the paths
generated in the first phase. In such a way, an efficient routing and data
transmission mechanism can be built, which allow us to construct a low-cost,
flexible and ubiquitous network. Such a networking architecture and data
transmission can be used in many M2M communications, such as the stub network
of internet of things, and deep space networking, and so on.
","[{'version': 'v1', 'created': 'Mon, 31 Mar 2014 18:47:17 GMT'}, {'version': 'v2', 'created': 'Thu, 8 May 2014 11:48:38 GMT'}]",2014-05-09,"[['Lu', 'Jihua', ''], ['An', 'Jianping', ''], ['Li', 'Xiangming', ''], ['Yang', 'Jie', ''], ['Yang', 'Lei', '']]","['Machine-to-machine', 'percolation networking', 'fountain codes', 'internet of things']"
16937,1304.7864,Gobithaasan Rudrusamy,"Gobithasan Rudrusamy, Azrudin Ahmad, Rahmat Budiarto, Azman Samsudin,
  Sureswaran Ramadass","Fuzzy Based Diagnostics System for Identifying Network Traffic Flow
  Anomalies",,"2003 Proceedings of the International Conference of Robotics,
  Vision, Information and Signal Processing ROVISP, Penang, IEEE, Pg.190-195",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses the usage of network traffic properties in passive
network monitoring which are used in recognizing and identifying anomaly.
","[{'version': 'v1', 'created': 'Tue, 30 Apr 2013 04:23:11 GMT'}]",2013-05-01,"[['Rudrusamy', 'Gobithasan', ''], ['Ahmad', 'Azrudin', ''], ['Budiarto', 'Rahmat', ''], ['Samsudin', 'Azman', ''], ['Ramadass', 'Sureswaran', '']]","['fuzzy systems', 'neural network', 'passive network monitoring', 'network operation anomaly']"
16938,1707.09432,Jo\~ao Miguel Cunha,"Jo\~ao Miguel Cunha, Pedro Martins, Am\'ilcar Cardoso, Penousal
  Machado",Generation of concept-representative symbols,"cite as ""Cunha, J. M., Martins, P., Cardoso, A., & Machado, P.
  (2015). Generation of Concept-Representative Symbols. In ICCBR (Workshops)."",
  Computational creativity, Computational generation, Concept representation,
  Visual representation",,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The visual representation of concepts or ideas through the use of simple
shapes has always been explored in the history of Humanity, and it is believed
to be the origin of writing. We focus on computational generation of visual
symbols to represent concepts. We aim to develop a system that uses background
knowledge about the world to find connections among concepts, with the goal of
generating symbols for a given concept. We are also interested in exploring the
system as an approach to visual dissociation and visual conceptual blending.
This has a great potential in the area of Graphic Design as a tool to both
stimulate creativity and aid in brainstorming in projects such as logo,
pictogram or signage design.
","[{'version': 'v1', 'created': 'Fri, 28 Jul 2017 22:33:01 GMT'}]",2017-08-01,"[['Cunha', 'João Miguel', ''], ['Martins', 'Pedro', ''], ['Cardoso', 'Amílcar', ''], ['Machado', 'Penousal', '']]","['Computational creativity', 'Computational generation', 'Concept representation', 'Visual representation']"
16939,1410.1864,Maurice Margenstern,Maurice Margenstern,A weakly universal cellular automaton in the heptagrid with three states,"27 pages, 21 figures. arXiv admin note: substantial text overlap with
  arXiv:1403.2373",,,,cs.DM nlin.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we construct a cellular automaton on the heptagrid which is
planar, weakly universal and which have three states only. This result improves
the best result which was with four states.
","[{'version': 'v1', 'created': 'Tue, 7 Oct 2014 19:54:18 GMT'}]",2014-10-08,"[['Margenstern', 'Maurice', '']]","['cellular automata', 'universality', 'tilings', 'hyperbolic geometry']"
16940,1609.05722,Yunjin Chen,"Wensen Feng, Hong Qiao, and Yunjin Chen",Poisson Noise Reduction with Higher-order Natural Image Prior Model,"31 pages, 10 figures. To appear in SIAM Journal on Imaging Sciences",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Poisson denoising is an essential issue for various imaging applications,
such as night vision, medical imaging and microscopy. State-of-the-art
approaches are clearly dominated by patch-based non-local methods in recent
years. In this paper, we aim to propose a local Poisson denoising model with
both structure simplicity and good performance. To this end, we consider a
variational modeling to integrate the so-called Fields of Experts (FoE) image
prior, that has proven an effective higher-order Markov Random Fields (MRF)
model for many classic image restoration problems. We exploit several feasible
variational variants for this task. We start with a direct modeling in the
original image domain by taking into account the Poisson noise statistics,
which performs generally well for the cases of high SNR. However, this strategy
encounters problem in cases of low SNR. Then we turn to an alternative modeling
strategy by using the Anscombe transform and Gaussian statistics derived data
term. We retrain the FoE prior model directly in the transform domain. With the
newly trained FoE model, we end up with a local variational model providing
strongly competitive results against state-of-the-art non-local approaches,
meanwhile bearing the property of simple structure. Furthermore, our proposed
model comes along with an additional advantage, that the inference is very
efficient as it is well-suited for parallel computation on GPUs. For images of
size $512 \times 512$, our GPU implementation takes less than 1 second to
produce state-of-the-art Poisson denoising performance.
","[{'version': 'v1', 'created': 'Mon, 19 Sep 2016 13:35:14 GMT'}]",2016-09-20,"[['Feng', 'Wensen', ''], ['Qiao', 'Hong', ''], ['Chen', 'Yunjin', '']]","['Poisson denoising', 'Fields of Experts', 'Anscombe roottransformation', 'non-convex optimization']"
16941,1210.0075,Aiping  Huang,"Aiping Huang, William Zhu","Geometric lattice structure of covering-based rough sets through
  matroids",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Covering-based rough set theory is a useful tool to deal with inexact,
uncertain or vague knowledge in information systems. Geometric lattice has
widely used in diverse fields, especially search algorithm design which plays
important role in covering reductions. In this paper, we construct four
geometric lattice structures of covering-based rough sets through matroids, and
compare their relationships. First, a geometric lattice structure of
covering-based rough sets is established through the transversal matroid
induced by the covering, and its characteristics including atoms, modular
elements and modular pairs are studied. We also construct a one-to-one
correspondence between this type of geometric lattices and transversal matroids
in the context of covering-based rough sets. Second, sufficient and necessary
conditions for three types of covering upper approximation operators to be
closure operators of matroids are presented. We exhibit three types of matroids
through closure axioms, and then obtain three geometric lattice structures of
covering-based rough sets. Third, these four geometric lattice structures are
compared. Some core concepts such as reducible elements in covering-based rough
sets are investigated with geometric lattices. In a word, this work points out
an interesting view, namely geometric lattice, to study covering-based rough
sets.
","[{'version': 'v1', 'created': 'Sat, 29 Sep 2012 03:26:18 GMT'}]",2012-10-02,"[['Huang', 'Aiping', ''], ['Zhu', 'William', '']]","['Rough sets', 'Covering', 'Matroid', 'Geometric lattice', 'Closure operator', 'Upper approximations']"
16942,1106.2670,Perrot Kevin,K\'evin Perrot and Eric R\'emila,"Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave
  Pattern Emergence",14 pages,"MFCS 2011, ARCoSS LNCS Springer-Verlag, volume 6907, pages 508-520",,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sand pile models are dynamical systems describing the evolution from $N$
stacked grains to a stable configuration. It uses local rules to depict grain
moves and iterate it until reaching a fixed configuration from which no rule
can be applied. The main interest of sand piles relies in their {\em Self
Organized Criticality} (SOC), the property that a small perturbation | adding
some sand grains | on a fixed configuration has uncontrolled consequences on
the system, involving an arbitrary number of grain fall. Physicists L. Kadanoff
{\em et al} inspire KSPM, a model presenting a sharp SOC behavior, extending
the well known {\em Sand Pile Model}. In KSPM($D$), we start from a pile of $N$
stacked grains and apply the rule: $D-1$ grains can fall from column $i$ onto
the $D-1$ adjacent columns to the right if the difference of height between
columns $i$ and $i+1$ is greater or equal to $D$. This paper develops a formal
background for the study of KSPM fixed points. This background, resumed in a
finite state word transducer, is used to provide a plain formula for fixed
points of KSPM(3).
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2011 10:52:49 GMT'}]",2013-02-19,"[['Perrot', 'Kévin', ''], ['Rémila', 'Eric', '']]","['Discrete dynamical system', 'self-organized criticality', 'sandpile model', 'transducer']"
16943,1407.4833,Nikita Zhiltsov,"Olga Nevzorova, Nikita Zhiltsov, Alexander Kirillovich, and Evgeny
  Lipachev",$OntoMath^{PRO}$ Ontology: A Linked Data Hub for Mathematics,"15 pages, 6 images, 1 table, Knowledge Engineering and the Semantic
  Web - 5th International Conference",,,,cs.AI cs.DL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present an ontology of mathematical knowledge concepts that
covers a wide range of the fields of mathematics and introduces a balanced
representation between comprehensive and sensible models. We demonstrate the
applications of this representation in information extraction, semantic search,
and education. We argue that the ontology can be a core of future integration
of math-aware data sets in the Web of Data and, therefore, provide mappings
onto relevant datasets, such as DBpedia and ScienceWISE.
","[{'version': 'v1', 'created': 'Thu, 17 Jul 2014 20:36:36 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Aug 2014 06:54:16 GMT'}]",2014-08-12,"[['Nevzorova', 'Olga', ''], ['Zhiltsov', 'Nikita', ''], ['Kirillovich', 'Alexander', ''], ['Lipachev', 'Evgeny', '']]","['Ontology engineering', 'mathematical knowledge', 'Linking OpenData']"
16944,1802.07887,Si Si,Si Si and Sanjiv Kumar and Yang Li,"Nonlinear Online Learning with Adaptive Nystr\""{o}m Approximation",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Use of nonlinear feature maps via kernel approximation has led to success in
many online learning tasks. As a popular kernel approximation method,
Nystr\""{o}m approximation, has been well investigated, and various landmark
points selection methods have been proposed to improve the approximation
quality. However, these improved Nystr\""{o}m methods cannot be directly applied
to the online learning setting as they need to access the entire dataset to
learn the landmark points, while we need to update model on-the-fly in the
online setting. To address this challenge, we propose Adaptive Nystr\""{o}m
approximation for solving nonlinear online learning problems. The key idea is
to adaptively modify the landmark points via online kmeans and adjust the model
accordingly via solving least square problem followed by a gradient descent
step. We show that the resulting algorithm outperforms state-of-the-art online
learning methods under the same budget.
","[{'version': 'v1', 'created': 'Wed, 21 Feb 2018 04:38:38 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Feb 2018 18:21:54 GMT'}]",2018-02-26,"[['Si', 'Si', ''], ['Kumar', 'Sanjiv', ''], ['Li', 'Yang', '']]","['Online Learning', 'Kernel Methods', 'Classification']"
16945,1402.7293,Akira Matsubayashi,Akira Matsubayashi,"Separator-Based Graph Embedding into Multidimensional Grids with Small
  Edge-Congestion","30 pages, 8 figures",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of embedding a guest graph with minimum edge-congestion
into a multidimensional grid with the same size as that of the guest graph.
Based on a well-known notion of graph separators, we show that an embedding
with a smaller edge-congestion can be obtained if the guest graph has a smaller
separator, and if the host grid has a higher but constant dimension.
Specifically, we prove that any graph with $N$ nodes, maximum node degree
$\Delta$, and with a node-separator of size $O(n^\alpha)$ ($0\leq\alpha<1$) can
be embedded into a grid of a fixed dimension $d\geq 2$ with at least $N$ nodes,
with an edge-congestion of $O(\Delta)$ if $d>1/(1-\alpha)$, $O(\Delta\log N)$
if $d=1/(1-\alpha)$, and $O(\Delta N^{\alpha-1+\frac{1}{d}})$ if $d<
1/(1-\alpha)$. This edge-congestion achieves constant ratio approximation if
$d>1/(1-\alpha)$, and matches an existential lower bound within a constant
factor if $d\leq 1/(1-\alpha)$. Our result implies that if the guest graph has
an excluded minor of a fixed size, such as a planar graph, then we can obtain
an edge-congestion of $O(\Delta\log N)$ for $d=2$ and $O(\Delta)$ for any fixed
$d\geq 3$. Moreover, if the guest graph has a fixed treewidth, such as a tree,
an outerplanar graph, and a series-parallel graph, then we can obtain an
edge-congestion of $O(\Delta)$ for any fixed $d\geq 2$. To design our embedding
algorithm, we introduce edge-separators bounding expansion, such that in
partitioning a graph into isolated nodes using edge-separators recursively, the
number of outgoing edges from a subgraph to be partitioned in a recursive step
is bounded. We present an algorithm to construct an edge-separator with
expansion of $O(\Delta n^\alpha)$ from a node-separator of size $O(n^\alpha)$.
","[{'version': 'v1', 'created': 'Fri, 28 Feb 2014 16:03:09 GMT'}]",2014-03-03,"[['Matsubayashi', 'Akira', '']]","['graph embedding', 'edge-congestion', 'grid', 'separator', 'expansion']"
16946,1109.0138,Atef Boujelben Atef boujelben,"Atef Boujelben, Hedi Tmar, Jameleddine Mnif, Mohamed Abid","Automatic Application Level Set Approach in Detection Calcifications in
  Mammographic Image","14 pages, 9 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Breast cancer is considered as one of a major health problem that constitutes
the strongest cause behind mortality among women in the world. So, in this
decade, breast cancer is the second most common type of cancer, in term of
appearance frequency, and the fifth most common cause of cancer related death.
In order to reduce the workload on radiologists, a variety of CAD systems;
Computer-Aided Diagnosis (CADi) and Computer-Aided Detection (CADe) have been
proposed. In this paper, we interested on CADe tool to help radiologist to
detect cancer. The proposed CADe is based on a three-step work flow; namely,
detection, analysis and classification. This paper deals with the problem of
automatic detection of Region Of Interest (ROI) based on Level Set approach
depended on edge and region criteria. This approach gives good visual
information from the radiologist. After that, the features extraction using
textures characteristics and the vector classification using Multilayer
Perception (MLP) and k-Nearest Neighbours (KNN) are adopted to distinguish
different ACR (American College of Radiology) classification. Moreover, we use
the Digital Database for Screening Mammography (DDSM) for experiments and these
results in term of accuracy varied between 60 % and 70% are acceptable and must
be ameliorated to aid radiologist.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2011 09:51:42 GMT'}]",2011-09-02,"[['Boujelben', 'Atef', ''], ['Tmar', 'Hedi', ''], ['Mnif', 'Jameleddine', ''], ['Abid', 'Mohamed', '']]","['Detection', 'Level Set', 'texture', 'mammographic image']"
16947,0704.3588,Cristina Comaniciu,Cristina Comaniciu and H. Vincent Poor,"On Energy Efficient Hierarchical Cross-Layer Design: Joint Power Control
  and Routing for Ad Hoc Networks","To appear in the EURASIP Journal on Wireless Communications and
  Networking, Special Issue on Wireless Mobile Ad Hoc Networks",,,,cs.IT math.IT,,"  In this paper, a hierarchical cross-layer design approach is proposed to
increase energy efficiency in ad hoc networks through joint adaptation of
nodes' transmitting powers and route selection. The design maintains the
advantages of the classic OSI model, while accounting for the cross-coupling
between layers, through information sharing. The proposed joint power control
and routing algorithm is shown to increase significantly the overall energy
efficiency of the network, at the expense of a moderate increase in complexity.
Performance enhancement of the joint design using multiuser detection is also
investigated, and it is shown that the use of multiuser detection can increase
the capacity of the ad hoc network significantly for a given level of energy
consumption.
","[{'version': 'v1', 'created': 'Thu, 26 Apr 2007 16:33:55 GMT'}]",2007-07-13,"[['Comaniciu', 'Cristina', ''], ['Poor', 'H. Vincent', '']]","['ad hoc networks', 'power control', 'routing', 'cross-layer']"
16948,1010.2465,Loet Leydesdorff,Loet Leydesdorff and Jung C. Shin,"How to evaluate universities in terms of their relative citation
  impacts: Fractional counting of citations and the normalization of
  differences among disciplines",,,,,cs.DL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fractional counting of citations can improve on ranking of multi-disciplinary
research units (such as universities) by normalizing the differences among
fields of science in terms of differences in citation behavior. Furthermore,
normalization in terms of citing papers abolishes the unsolved questions in
scientometrics about the delineation of fields of science in terms of journals
and normalization when comparing among different journals. Using publication
and citation data of seven Korean research universities, we demonstrate the
advantages and the differences in the rankings, explain the possible
statistics, and suggest ways to visualize the differences in (citing) audiences
in terms of a network.
","[{'version': 'v1', 'created': 'Tue, 12 Oct 2010 18:39:10 GMT'}]",2010-10-13,"[['Leydesdorff', 'Loet', ''], ['Shin', 'Jung C.', '']]","['Evaluation', 'ranking', 'citation', 'indicator', 'impact', 'university', 'Korea']"
16949,0908.0912,Gene Golovchinsky,Colum Foley and Alan F. Smeaton,"Evaluation of Coordination Techniques in Synchronous Collaborative
  Information Retrieval","Presented at 1st Intl Workshop on Collaborative Information Seeking,
  2008 (arXiv:0908.0583)",,,JCDL2008CIRWS/2008/folsme,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional Information Retrieval (IR) research has focussed on a single user
interaction modality, where a user searches to satisfy an information need.
Recent advances in web technologies and computer hardware have enabled multiple
users to collaborate on many computer-supported tasks, therefore there is an
increasing opportunity to support two or more users searching together at the
same time in order to satisfy a shared information need, which we refer to as
Synchronous Collaborative Information Retrieval (SCIR). SCIR systems represent
a significant paradigmatic shift from traditional IR systems. In order to
support effective SCIR, new techniques are required to coordinate users'
activities. In addition, the novel domain of SCIR presents challenges for
effective evaluations of these systems. In this paper we will propose an
effective and re-usable evaluation methodology based on simulating users
searching together. We will outline how we have used this evaluation in
empirical studies of the effects of different division of labour and sharing of
knowledge techniques for SCIR.
","[{'version': 'v1', 'created': 'Thu, 6 Aug 2009 17:23:01 GMT'}]",2009-08-07,"[['Foley', 'Colum', ''], ['Smeaton', 'Alan F.', '']]","['Collaborative information retrieval', 'synchronous', 'evaluation']"
16950,1401.0886,Najashi Bara'u Gafai,"Barau Gafai Najashi, Feng Wenjiang, Mohammed Dikko Almustapha","Spectrum Hole Prediction Based On Historical Data: A Neural Network
  Approach","8 pages,9 figures",,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The concept of cognitive radio pioneered by Mitola promises to change the
future of wireless communication especially in the area of spectrum management.
Currently, the command and control strategy employed in spectrum assignment is
too rigid and needs to be reviewed. Recent studies have shown that assigned
spectrum is underutilized spectrally and temporally. Cognitive radio provides a
viable solution whereby licensed users can share the spectrum with unlicensed
users opportunistically without causing interference. Unlicensed users must be
able to sense weather the channel is busy or idle, failure to do so will lead
to interference to the licensed user. In this paper, a neural network based
prediction model for predicting the channel status using historical data
obtained during a spectrum occupancy measurement is presented. Genetic
algorithm is combined with LM BP for increasing the probability of obtaining
the best weights thus optimizing the network. The results obtained indicate
high prediction accuracy over all bands considered
","[{'version': 'v1', 'created': 'Sun, 5 Jan 2014 11:41:43 GMT'}]",2014-01-07,"[['Najashi', 'Barau Gafai', ''], ['Wenjiang', 'Feng', ''], ['Almustapha', 'Mohammed Dikko', '']]","['Cognitive radio', 'spectrum sensing', 'prediction model', 'neural network', 'genetic algorithm']"
16951,1505.04260,Giuseppe Boccignone,"Vittorio Cuculo, Raffaella Lanzarotti, Giuseppe Boccignone",The color of smiling: computational synaesthesia of facial expressions,"Submitted to: 18th International Conference on Image Analysis and
  Processing (ICIAP 2015), 7-11 September 2015, Genova, Italy",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This note gives a preliminary account of the transcoding or rechanneling
problem between different stimuli as it is of interest for the natural
interaction or affective computing fields. By the consideration of a simple
example, namely the color response of an affective lamp to a sensed facial
expression, we frame the problem within an information- theoretic perspective.
A full justification in terms of the Information Bottleneck principle promotes
a latent affective space, hitherto surmised as an appealing and intuitive
solution, as a suitable mediator between the different stimuli.
","[{'version': 'v1', 'created': 'Sat, 16 May 2015 10:28:51 GMT'}]",2015-05-19,"[['Cuculo', 'Vittorio', ''], ['Lanzarotti', 'Raffaella', ''], ['Boccignone', 'Giuseppe', '']]","['Affective computing', 'Facial expressions', 'Information-bottleneck', 'Graphical models']"
16952,1505.02449,Daniel Raggi,"Daniel Raggi, Alan Bundy, Gudmund Grov, Alison Pease",Automating change of representation for proofs in discrete mathematics,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Representation determines how we can reason about a specific problem.
Sometimes one representation helps us find a proof more easily than others.
Most current automated reasoning tools focus on reasoning within one
representation. There is, therefore, a need for the development of better tools
to mechanise and automate formal and logically sound changes of representation.
  In this paper we look at examples of representational transformations in
discrete mathematics, and show how we have used Isabelle's Transfer tool to
automate the use of these transformations in proofs. We give a brief overview
of a general theory of transformations that we consider appropriate for
thinking about the matter, and we explain how it relates to the Transfer
package. We show our progress towards developing a general tactic that
incorporates the automatic search for representation within the proving
process.
","[{'version': 'v1', 'created': 'Sun, 10 May 2015 22:14:55 GMT'}]",2015-05-12,"[['Raggi', 'Daniel', ''], ['Bundy', 'Alan', ''], ['Grov', 'Gudmund', ''], ['Pease', 'Alison', '']]","['change of representation', 'transformation', 'automated reasoning', 'Isabelle proof assistant']"
16953,1505.06524,Hao  Chen,Liqing Xu and Hao Chen,New Explicit Binary Constant Weight Codes from Reed-Solomon Codes,"15 pages, submitted",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Binary constant weight codes have important applications and have been
studied for many years. Optimal or near-optimal binary constant weight codes of
small lengths have been determined. In this paper we propose a new construction
of explicit binary constant weight codes from $q$-ary Reed-Solomon codes. Some
of our binary constant weight codes are optimal or new. In particular new
binary constant weight codes $A(64, 10, 8) \geq 4108$ and $A(64, 12, 8) \geq
522$ are constructed. We also give explicitly constructed binary constant
weight codes which improve Gilbert and Graham-Sloane lower bounds in some range
of parameters. An extension to algebraic geometric codes is also presented.
","[{'version': 'v1', 'created': 'Mon, 25 May 2015 02:14:47 GMT'}, {'version': 'v2', 'created': 'Sat, 30 May 2015 00:58:20 GMT'}, {'version': 'v3', 'created': 'Sat, 25 Jul 2015 11:47:29 GMT'}, {'version': 'v4', 'created': 'Fri, 7 Aug 2015 22:11:14 GMT'}]",2015-08-11,"[['Xu', 'Liqing', ''], ['Chen', 'Hao', '']]","['Constant weight code', 'Reed-Solomon codes', 'algebraic geometric codes']"
16954,1501.02311,Dmitry Zinoviev,Dmitry Zinoviev and Zhen Zhu and Kate Li,Building Mini-Categories in Product Networks,"Accepted to CompleNet, March 2015, NYC, NY, USA; 12 pages, 4 figures",,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We constructed a product network based on the sales data collected and
provided by a Fortune 500 speciality retailer. The structure of the network is
dominated by small isolated components, dense clique-based communities, and
sparse stars and linear chains and pendants. We used the identified structural
elements (tiles) to organize products into mini-categories -- compact
collections of potentially complementary and substitute items. The
mini-categories extend the traditional hierarchy of retail products (group -
class - subcategory) and may serve as building blocks towards exploration of
consumer projects and long-term customer behavior.
","[{'version': 'v1', 'created': 'Sat, 10 Jan 2015 04:31:49 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Jan 2015 20:21:58 GMT'}]",2015-01-29,"[['Zinoviev', 'Dmitry', ''], ['Zhu', 'Zhen', ''], ['Li', 'Kate', '']]","['retailing', 'product network', 'mini-category', 'category management']"
16955,1212.6055,Seifedine Kadry Seifedine Kadry,"Seifedine Kadry, Ayman Abdallah, Chibli Joumaa",On The Optimization of Dijkstras Algorithm,"Informatics in Control, Automation and Robotics, Volume 2,
  Springer-Verlag Berlin Heidelberg 2011",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose some amendment on Dijkstras algorithm in order to
optimize it by reducing the number of iterations. The main idea is to solve the
problem where more than one node satisfies the condition of the second step in
the traditional Dijkstras algorithm. After application of the proposed
modifications, the maximum number of iterations of Dijkstras algorithm is less
than the number of the graphs nodes.
","[{'version': 'v1', 'created': 'Tue, 25 Dec 2012 14:18:45 GMT'}]",2012-12-27,"[['Kadry', 'Seifedine', ''], ['Abdallah', 'Ayman', ''], ['Joumaa', 'Chibli', '']]","['Dijkstra’s algorithm', 'directed graph', 'shortest path']"
16956,0705.1886,Francoise Armand,"Michel Crampes (LGI2P), Sylvie Ranwez (LGI2P)","Ontology-Supported and Ontology-Driven Conceptual Navigation on the
  World Wide Web",,Proceedings Hypertext 2000 (2000) 80,,,cs.IR,,"  This paper presents the principles of ontology-supported and ontology-driven
conceptual navigation. Conceptual navigation realizes the independence between
resources and links to facilitate interoperability and reusability. An engine
builds dynamic links, assembles resources under an argumentative scheme and
allows optimization with a possible constraint, such as the user's available
time. Among several strategies, two are discussed in detail with examples of
applications. On the one hand, conceptual specifications for linking and
assembling are embedded in the resource meta-description with the support of
the ontology of the domain to facilitate meta-communication. Resources are like
agents looking for conceptual acquaintances with intention. On the other hand,
the domain ontology and an argumentative ontology drive the linking and
assembling strategies.
","[{'version': 'v1', 'created': 'Mon, 14 May 2007 08:19:28 GMT'}]",2007-05-23,"[['Crampes', 'Michel', '', 'LGI2P'], ['Ranwez', 'Sylvie', '', 'LGI2P']]","['Adaptive hypertext', 'conceptual navigation', 'metadata', 'XML', 'ontology', 'narration', 'time optimization', 'WWW']"
16957,1704.02797,Marcelo Carvalho M,"Fadhil Firyaguna, Ana C. O. Christ\'ofaro, \'Everton A. L. Andrade,
  Tiago Bonfim and Marcelo M. Carvalho","Joint Spatial Multiplexing and Transmit Diversity in MIMO Ad Hoc
  Networks",16 pages,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates the performance of MIMO ad hoc networks that employ
transmit diversity, as delivered by the Alamouti scheme, and/or spatial
multiplexing, according to the Vertical Bell Labs Layered Space-Time system
(V-BLAST). Both techniques are implemented in a discrete-event network
simulator by focusing on their overall effect on the resulting
signal-to-interference-plus-noise ratio (SINR) at the intended receiver. Unlike
previous works that have studied fully-connected scenarios or have assumed
simple abstractions to represent MIMO behavior, this paper evaluates MIMO ad
hoc networks that are not fully connected by taking into account the effects of
multiple antennas on the clear channel assessment (CCA) mechanism of CSMA-like
medium access control (MAC) protocols. In addition to presenting a performance
evaluation of ad hoc networks operating according to each individual MIMO
scheme, this paper proposes simple modifications to the IEEE 802.11 DCF MAC to
allow the joint operation of both MIMO techniques. Hence, each pair of nodes is
allowed to select the best MIMO configuration for the impending data transfer.
The joint operation is based on three operation modes that are selected based
on the estimated SINR at the intended receiver and its comparision with a set
of threshold values. The performance of ad hoc networks operating with the
joint MIMO scheme is compared with their operation using each individual MIMO
scheme and the standard SISO IEEE 802.11. Performance results are presented
based on MAC-level throughput per node, delay, and fairness under saturated
traffic conditions.
","[{'version': 'v1', 'created': 'Mon, 10 Apr 2017 10:56:08 GMT'}]",2017-04-11,"[['Firyaguna', 'Fadhil', ''], ['Christófaro', 'Ana C. O.', ''], ['Andrade', 'Éverton A. L.', ''], ['Bonfim', 'Tiago', ''], ['Carvalho', 'Marcelo M.', '']]","['MIMO networks', 'ad hoc networks', 'medium access control protocols', 'wireless networks']"
16958,1010.5943,Szymon Chojnacki Mr,Szymon Chojnacki and Mieczys{\l}aw K{\l}opotek,Random Graph Generator for Bipartite Networks Modeling,,,,,cs.AI cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this article is to introduce a new iterative algorithm with
properties resembling real life bipartite graphs. The algorithm enables us to
generate wide range of random bigraphs, which features are determined by a set
of parameters.We adapt the advances of last decade in unipartite complex
networks modeling to the bigraph setting. This data structure can be observed
in several situations. However, only a few datasets are freely available to
test the algorithms (e.g. community detection, influential nodes
identification, information retrieval) which operate on such data. Therefore,
artificial datasets are needed to enhance development and testing of the
algorithms. We are particularly interested in applying the generator to the
analysis of recommender systems. Therefore, we focus on two characteristics
that, besides simple statistics, are in our opinion responsible for the
performance of neighborhood based collaborative filtering algorithms. The
features are node degree distribution and local clustering coeficient.
","[{'version': 'v1', 'created': 'Thu, 28 Oct 2010 12:39:10 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Nov 2010 16:47:39 GMT'}]",2010-11-03,"[['Chojnacki', 'Szymon', ''], ['Kłopotek', 'Mieczysław', '']]","['complex networks', 'random graphs', 'bipartite graphs', 'recommender systems', 'affiliation networks']"
16959,1409.4925,Matt Lewis,Cristina David and Daniel Kroening and Matt Lewis,Second-Order Propositional Satisfiability,19 pages,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fundamentally, every static program analyser searches for a proof through a
combination of heuristics providing candidate solutions and a candidate
validation technique. Essentially, the heuristic reduces a second-order problem
to a first-order/propositional one, while the validation is often just a call
to a SAT/SMT solver. This results in a monolithic design of such analyses that
conflates the formulation of the problem with the solving process.
Consequently, any change to the latter causes changes to the whole analysis.
This design is dictated by the state of the art in solver technology. While
SAT/SMT solvers have experienced tremendous progress, there are barely any
second-order solvers. This paper takes a step towards addressing this situation
by proposing a decidable fragment of second-order logic that is still
expressive enough to capture numerous program analysis problems (e.g. safety
proving, bug finding, termination and non-termination proving,
superoptimisation). We refer to the satisfiability problem for this fragment as
Second-Order SAT and show it is NEXPTIME-complete. Finally, we build a decision
procedure for Second-Order SAT based on program synthesis and present
experimental evidence that our approach is tractable for program analysis
problems.
","[{'version': 'v1', 'created': 'Wed, 17 Sep 2014 09:44:43 GMT'}, {'version': 'v2', 'created': 'Sun, 19 Oct 2014 16:33:56 GMT'}, {'version': 'v3', 'created': 'Tue, 21 Oct 2014 11:47:35 GMT'}, {'version': 'v4', 'created': 'Sat, 17 Jan 2015 14:29:58 GMT'}]",2015-01-20,"[['David', 'Cristina', ''], ['Kroening', 'Daniel', ''], ['Lewis', 'Matt', '']]","['Second-order logic', 'decision procedure', 'program synthesis', 'bitvectors']"
16960,0908.3574,Christian Esteve Rothenberg,"Christian Esteve Rothenberg, Carlos A. Macapuna, Fabio L. Verdi,
  Mauricio F. Magalhaes, Alexander Wiesmaier",In-packet Bloom filters: Design and networking applications,"15 pages, 11 figures, preprint submitted to Elsevier COMNET Journal",,,,cs.DS cs.IT cs.NI cs.PF math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Bloom filter (BF) is a well-known space-efficient data structure that
answers set membership queries with some probability of false positives. In an
attempt to solve many of the limitations of current inter-networking
architectures, some recent proposals rely on including small BFs in packet
headers for routing, security, accountability or other purposes that move
application states into the packets themselves. In this paper, we consider the
design of such in-packet Bloom filters (iBF). Our main contributions are
exploring the design space and the evaluation of a series of extensions (1) to
increase the practicality and performance of iBFs, (2) to enable
false-negative-free element deletion, and (3) to provide security enhancements.
In addition to the theoretical estimates, extensive simulations of the multiple
design parameters and implementation alternatives validate the usefulness of
the extensions, providing for enhanced and novel iBF networking applications.
","[{'version': 'v1', 'created': 'Tue, 25 Aug 2009 09:10:51 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Jan 2010 00:35:00 GMT'}]",2010-01-20,"[['Rothenberg', 'Christian Esteve', ''], ['Macapuna', 'Carlos A.', ''], ['Verdi', 'Fabio L.', ''], ['Magalhaes', 'Mauricio F.', ''], ['Wiesmaier', 'Alexander', '']]","['Bloom filter', 'algorithms', 'distributed systems', 'packet forwarding', 'inter-networking']"
16961,1304.3273,Md. Kamal Hossain,"Md. Kamal Hossain, Ayman Abd El-Saleh","Cognitive Radio Engine Model Utilizing Soft Fusion Based Genetic
  Algorithm For Cooperative Spectrum Optimization",15 pages,"International Journal of Computer Networks & Communications
  (IJCNC),ISSN : 0974 - 9322[Online]; 0975 - 2293, 2013 [Print]",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cognitive radio (CR) is to detect the presence of primary users (PUs)
reliably in order to reduce the interference to licensed communications.
Genetic algorithms (GAs) are well suited for CR optimization problems to
increase efficiency of bandwidth utilization by manipulating its unused
portions of the apparent spectrum. In this paper, a binary genetic algorithm
(BGA)-based soft fusion (SF) scheme for cooperative spectrum sensing in
cognitive radio network is proposed to improve detection performance and
bandwidth utilization. The BGA-based optimization method is implemented at the
fusion centre of a linear SF scheme to optimize the weighting coefficients
vector to maximize global probability of detection performance. Simulation
results and analyses confirm that the proposed scheme meets real time
requirements of cognitive radio spectrum sensing and it outperforms
conventional natural deflection coefficient- (NDC-), modified deflection
coefficient- (MDC-), maximal ratio combining- (MRC-) and equal gain combining-
(EGC-) based SDF schemes as well as the OR-rule based hard decision fusion
(HDF). The propose BGA scheme also converges fast and achieves the optimum
performance, which means that BGA-based method is efficient and quite stable
also.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2013 12:27:39 GMT'}]",2013-04-12,"[['Hossain', 'Md. Kamal', ''], ['El-Saleh', 'Ayman Abd', '']]","['Genetic Algorithm', 'Cognitive radio', 'Cooperative spectrum sensing', 'Soft fusion']"
16962,1305.6021,Xu Zhiqiang,Guangwu Xu and Zhiqiang Xu,On the $\ell_1$-Norm Invariant Convex k-Sparse Decomposition of Signals,Add some comments for the noise case,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Inspired by an interesting idea of Cai and Zhang, we formulate and prove the
convex $k$-sparse decomposition of vectors which is invariant with respect to
$\ell_1$ norm. This result fits well in discussing compressed sensing problems
under RIP, but we believe it also has independent interest. As an application,
a simple derivation of the RIP recovery condition $\delta_k+\theta_{k,k} < 1$
is presented.
","[{'version': 'v1', 'created': 'Sun, 26 May 2013 12:49:20 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Nov 2013 08:27:26 GMT'}]",2013-11-12,"[['Xu', 'Guangwu', ''], ['Xu', 'Zhiqiang', '']]","['Convex k-sparse decomposition', 'ℓ1 minimization', 'restricted isometry property', 'sparse recovery']"
16963,1003.5993,Xiangyong Zeng,Xiangyong Zeng and Jinyong Shan and Lei Hu,"A Triple-Error-Correcting Cyclic Code from the Gold and Kasami-Welch APN
  Power Functions",29 pages,,,,cs.DM cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Based on a sufficient condition proposed by Hollmann and Xiang for
constructing triple-error-correcting codes, the minimum distance of a binary
cyclic code $\mathcal{C}_{1,3,13}$ with three zeros $\alpha$, $\alpha^3$, and
$\alpha^{13}$ of length $2^m-1$ and the weight divisibility of its dual code
are studied, where $m\geq 5$ is odd and $\alpha$ is a primitive element of the
finite field $\mathbb{F}_{2^m}$. The code $\mathcal{C}_{1,3,13}$ is proven to
have the same weight distribution as the binary triple-error-correcting
primitive BCH code $\mathcal{C}_{1,3,5}$ of the same length.
","[{'version': 'v1', 'created': 'Wed, 31 Mar 2010 09:08:32 GMT'}]",2010-04-01,"[['Zeng', 'Xiangyong', ''], ['Shan', 'Jinyong', ''], ['Hu', 'Lei', '']]","['Cyclic code', 'BCH code', 'triple-error-correcting code', 'minimum distance', 'almost perfect nonlinear function']"
16964,0908.2462,Hyoungshick Kim,"Ji Won Yoon, Hyoungshick Kim and Jun Ho Huh",Hybrid Spam Filtering for Mobile Communication,"6 pages, 5 figures, 1 table",,,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spam messages are an increasing threat to mobile communication. Several
mitigation techniques have been proposed, including white and black listing,
challenge-response and content-based filtering. However, none are perfect and
it makes sense to use a combination rather than just one. We propose an
anti-spam framework based on the hybrid of content-based filtering and
challenge-response. There is the trade-offs between accuracy of anti-spam
classifiers and the communication overhead. Experimental results show how,
depending on the proportion of spam messages, different filtering %%@
parameters should be set.
","[{'version': 'v1', 'created': 'Mon, 17 Aug 2009 23:10:02 GMT'}]",2009-08-19,"[['Yoon', 'Ji Won', ''], ['Kim', 'Hyoungshick', ''], ['Huh', 'Jun Ho', '']]","['Anti-spam filtering', 'a threshold sensitivity problem', 'Uncertain area in decision', 'Human Interaction']"
16965,0903.3329,Emmanuel Duflos,"Thomas Br\'ehard (INRIA Futurs), Emmanuel Duflos (INRIA Futurs,
  LAGIS), Philippe Vanheeghe (LAGIS), Pierre-Arnaud Coquelin (INRIA Futurs)",Optimal Policies Search for Sensor Management,,,,,cs.LG stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a new approach to solve sensor management problems.
Classically sensor management problems can be well formalized as
Partially-Observed Markov Decision Processes (POMPD). The original approach
developped here consists in deriving the optimal parameterized policy based on
a stochastic gradient estimation. We assume in this work that it is possible to
learn the optimal policy off-line (in simulation) using models of the
environement and of the sensor(s). The learned policy can then be used to
manage the sensor(s). In order to approximate the gradient in a stochastic
context, we introduce a new method to approximate the gradient, based on
Infinitesimal Perturbation Approximation (IPA). The effectiveness of this
general framework is illustrated by the managing of an Electronically Scanned
Array Radar. First simulations results are finally proposed.
","[{'version': 'v1', 'created': 'Thu, 19 Mar 2009 13:44:35 GMT'}]",2009-03-20,"[['Bréhard', 'Thomas', '', 'INRIA Futurs'], ['Duflos', 'Emmanuel', '', 'INRIA Futurs,\n  LAGIS'], ['Vanheeghe', 'Philippe', '', 'LAGIS'], ['Coquelin', 'Pierre-Arnaud', '', 'INRIA Futurs']]","['Sensor(s) Management', 'Partially ObservableMarkov Decision Process', 'Stochastic Gradient Estimation', 'AESA Radar']"
16966,1609.01131,Jorge Luis Rivero Jlrivero,"Jorge Luis Rivero P\'erez, Yaimara Pe\~nate Santana, Pedro Harenton
  Mart\'inez L\'opez",Proposal of Data Processing Platform for Direct Marketing Data,in Spanish,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data mining has been widely used to identify potential customers for a new
product or service. In this article is done a study of previous work relating
to the application of data mining methodologies for software projects,
specifically for direct marketing projects. Several data sets of demographic
and historical customer purchases data available for evaluation of algorithms
in this area, some of them very new and current are described. The main
contribution of this paper is the proposal of a platform for distributed data
stream processing for the processes of targeting customers and building
predictive models required response; thus facilitating several of the
functional requirements for development environments.
","[{'version': 'v1', 'created': 'Mon, 5 Sep 2016 12:31:58 GMT'}]",2016-09-06,"[['Pérez', 'Jorge Luis Rivero', ''], ['Santana', 'Yaimara Peñate', ''], ['López', 'Pedro Harenton Martínez', '']]","['Data stream', 'direct marketing', 'data mining']"
16967,1409.2579,Gang Wu,"Ting-ting Feng, Gang Wu","A theoretical contribution to the fast implementation of null linear
  discriminant analysis method using random matrix multiplication with scatter
  matrices",7 pages,,,,cs.NA cs.CV cs.LG,http://creativecommons.org/licenses/by/3.0/,"  The null linear discriminant analysis method is a competitive approach for
dimensionality reduction. The implementation of this method, however, is
computationally expensive. Recently, a fast implementation of null linear
discriminant analysis method using random matrix multiplication with scatter
matrices was proposed. However, if the random matrix is chosen arbitrarily, the
orientation matrix may be rank deficient, and some useful discriminant
information will be lost. In this paper, we investigate how to choose the
random matrix properly, such that the two criteria of the null LDA method are
satisfied theoretically. We give a necessary and sufficient condition to
guarantee full column rank of the orientation matrix. Moreover, the geometric
characterization of the condition is also described.
","[{'version': 'v1', 'created': 'Tue, 9 Sep 2014 11:46:40 GMT'}]",2014-09-10,"[['Feng', 'Ting-ting', ''], ['Wu', 'Gang', '']]","['Dimensionality reduction', 'Linear discriminant analysis (LDA)', 'Null linear discriminant analysis (Null LDA)', 'Small sample size problem']"
16968,1802.09059,Ahmad Pesaranghader,"Ahmad Pesaranghader, Ali Pesaranghader, Stan Matwin, Marina Sokolova","One Single Deep Bidirectional LSTM Network for Word Sense Disambiguation
  of Text Data","12 pages, 1 figure, to appear in the Proceedings of the 31st Canadian
  Conference on Artificial Intelligence, 8-11 May, 2018, Toronto, Canada",,,,cs.LG cs.CL cs.IR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to recent technical and scientific advances, we have a wealth of
information hidden in unstructured text data such as offline/online narratives,
research articles, and clinical reports. To mine these data properly,
attributable to their innate ambiguity, a Word Sense Disambiguation (WSD)
algorithm can avoid numbers of difficulties in Natural Language Processing
(NLP) pipeline. However, considering a large number of ambiguous words in one
language or technical domain, we may encounter limiting constraints for proper
deployment of existing WSD models. This paper attempts to address the problem
of one-classifier-per-one-word WSD algorithms by proposing a single
Bidirectional Long Short-Term Memory (BLSTM) network which by considering
senses and context sequences works on all ambiguous words collectively.
Evaluated on SensEval-3 benchmark, we show the result of our model is
comparable with top-performing WSD algorithms. We also discuss how applying
additional modifications alleviates the model fault and the need for more
training data.
","[{'version': 'v1', 'created': 'Sun, 25 Feb 2018 18:51:53 GMT'}]",2018-03-01,"[['Pesaranghader', 'Ahmad', ''], ['Pesaranghader', 'Ali', ''], ['Matwin', 'Stan', ''], ['Sokolova', 'Marina', '']]","['Natural Language Processing', 'Word Sense Disambiguation', 'Deep Learning', 'Bidirectional Long Short-Term Memory', 'Text Mining']"
16969,1609.02846,Milica Gasic,"Milica Gasic, Nikola Mrksic, Lina M. Rojas-Barahona, Pei-Hao Su,
  Stefan Ultes, David Vandyke, Tsung-Hsien Wen and Steve Young","Dialogue manager domain adaptation using Gaussian process reinforcement
  learning",accepted for publication in Computer Speech and Language,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spoken dialogue systems allow humans to interact with machines using natural
speech. As such, they have many benefits. By using speech as the primary
communication medium, a computer interface can facilitate swift, human-like
acquisition of information. In recent years, speech interfaces have become ever
more popular, as is evident from the rise of personal assistants such as Siri,
Google Now, Cortana and Amazon Alexa. Recently, data-driven machine learning
methods have been applied to dialogue modelling and the results achieved for
limited-domain applications are comparable to or outperform traditional
approaches. Methods based on Gaussian processes are particularly effective as
they enable good models to be estimated from limited training data.
Furthermore, they provide an explicit estimate of the uncertainty which is
particularly useful for reinforcement learning. This article explores the
additional steps that are necessary to extend these methods to model multiple
dialogue domains. We show that Gaussian process reinforcement learning is an
elegant framework that naturally supports a range of methods, including prior
knowledge, Bayesian committee machines and multi-agent learning, for
facilitating extensible and adaptable dialogue systems.
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2016 16:02:57 GMT'}]",2016-09-12,"[['Gasic', 'Milica', ''], ['Mrksic', 'Nikola', ''], ['Rojas-Barahona', 'Lina M.', ''], ['Su', 'Pei-Hao', ''], ['Ultes', 'Stefan', ''], ['Vandyke', 'David', ''], ['Wen', 'Tsung-Hsien', ''], ['Young', 'Steve', '']]","['Dialogue systems', 'Reinforcement learning', 'Gaussian process']"
16970,1506.03857,Marco Di Renzo,Wei Lu and Marco Di Renzo,"Stochastic Geometry Modeling of Cellular Networks: Analysis, Simulation
  and Experimental Validation",submitted for publication,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the increasing heterogeneity and deployment density of emerging
cellular networks, new flexible and scalable approaches for their modeling,
simulation, analysis and optimization are needed. Recently, a new approach has
been proposed: it is based on the theory of point processes and it leverages
tools from stochastic geometry for tractable system-level modeling, performance
evaluation and optimization. In this paper, we investigate the accuracy of this
emerging abstraction for modeling cellular networks, by explicitly taking
realistic base station locations, building footprints, spatial blockages and
antenna radiation patterns into account. More specifically, the base station
locations and the building footprints are taken from two publicly available
databases from the United Kingdom. Our study confirms that the abstraction
model based on stochastic geometry is capable of accurately modeling the
communication performance of cellular networks in dense urban environments.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2015 22:22:34 GMT'}]",2015-06-15,"[['Lu', 'Wei', ''], ['Di Renzo', 'Marco', '']]","['Cellular networks', 'stochastic geometry', 'point processes']"
16971,1408.0096,Jiankou Li,Jiankou Li and Wei Zhang,Conditional Restricted Boltzmann Machines for Cold Start Recommendations,"12 pages, 3 figures",,,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Restricted Boltzman Machines (RBMs) have been successfully used in
recommender systems. However, as with most of other collaborative filtering
techniques, it cannot solve cold start problems for there is no rating for a
new item. In this paper, we first apply conditional RBM (CRBM) which could take
extra information into account and show that CRBM could solve cold start
problem very well, especially for rating prediction task. CRBM naturally
combine the content and collaborative data under a single framework which could
be fitted effectively. Experiments show that CRBM can be compared favourably
with matrix factorization models, while hidden features learned from the former
models are more easy to be interpreted.
","[{'version': 'v1', 'created': 'Fri, 1 Aug 2014 07:51:37 GMT'}]",2014-08-04,"[['Li', 'Jiankou', ''], ['Zhang', 'Wei', '']]","['cold start', 'conditional RBM', 'rating prediction']"
16972,1702.05355,Hamidou Tembine,Giulia Rossi and Alain Tcheukam and Hamidou Tembine,"How Much Does Users' Psychology Matter in Engineering Mean-Field-Type
  Games",44 pages,,,,cs.GT cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Until now mean-field-type game theory was not focused on
cognitively-plausible models of choices in humans, animals, machines, robots,
software-defined and mobile devices strategic interactions. This work presents
some effects of users' psychology in mean-field-type games. In addition to the
traditional ""material"" payoff modelling, psychological patterns are introduced
in order to better capture and understand behaviors that are observed in
engineering practice or in experimental settings. The psychological payoff
value depends upon choices, mean-field states, mean-field actions, empathy and
beliefs. It is shown that the affective empathy enforces mean-field equilibrium
payoff equity and improves fairness between the players. It establishes
equilibrium systems for such interactive decision-making problems. Basic
empathy concepts are illustrated in several important problems in engineering
including resource sharing, packet collision minimization, energy markets, and
forwarding in Device-to-Device communications. The work conducts also an
experiment with 47 people who have to decide whether to cooperate or not. The
basic Interpersonal Reactivity Index of empathy metrics were used to measure
the empathy distribution of each participant. Android app called Empathizer is
developed to analyze systematically the data obtained from the participants.
The experimental results reveal that the dominated strategies of the classical
game theory are not dominated any more when users' psychology is involved, and
a significant level of cooperation is observed among the users who are
positively partially empathetic.
","[{'version': 'v1', 'created': 'Fri, 17 Feb 2017 14:29:27 GMT'}, {'version': 'v2', 'created': 'Sat, 25 Feb 2017 09:23:38 GMT'}]",2017-02-28,"[['Rossi', 'Giulia', ''], ['Tcheukam', 'Alain', ''], ['Tembine', 'Hamidou', '']]","['Psychology', 'empathy', 'game theory', 'mean-field', 'belief', 'consistency']"
16973,1410.5944,Tarik Anouari,Tarik Anouari and Abdelkrim Haqiq,An Improved UGS Scheduling with QoE Metrics in WiMAX Network,"6 pages, 8 figures","(IJCSIS) International Journal of Computer Science and Information
  Security, Vol. 12, No. 9, September 2014",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  WiMAX (Worldwide Interoperability for Microwave Access) technology has
emerged in response to the increasing demand for multimedia services in the
internet broadband networks. WiMAX standard has defined five different
scheduling services to meet the QoS (Quality of Service) requirement of
multimedia applications and this paper investigates one specific scheduling
service, i.e. UGS scheduling. In parallel, it was observed that in the
difference of the traditional quality assessment approaches, nowadays, current
researches are centered on the user perception of the quality, the existing
scheduling approaches take into account the QoS, mobility and many other
parameters, but do not consider the Quality of Experience (QoE). In order to
control the packet transmission rate so as to match with the minimum subjective
rate requirements of each user and therefore reduce packet loss and delays, an
efficient scheduling approach has been proposed in this paper. The solution has
been implemented and evaluated in the WiMAX simulation platform developed based
on NS-2. Simulation results show that by applying various levels of MOS (Mean
Opinion Score) the QoE provided to the users is enhanced in term of jitter,
packet loss rate, throughput and delay.
","[{'version': 'v1', 'created': 'Wed, 22 Oct 2014 08:41:31 GMT'}]",2014-10-23,"[['Anouari', 'Tarik', ''], ['Haqiq', 'Abdelkrim', '']]","['WiMAX', 'QoE', 'QoS', 'UGS', 'NS-2']"
16974,1712.02870,Sounaka Mishra,Sounaka Mishra and Shijin Rajakrishnan,The Complexity of Maximum $k$-Order Bounded Component Set Problem,"14 pages, 1 figure",,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a graph $G=(V, E)$ and a positive integer $k$, in Maximum $k$-Order
Bounded Component Set (Max-$k$-OBCS), it is required to find a vertex set $S
\subseteq V$ of maximum size such that each component in the induced graph
$G[S]$ has at most $k$ vertices. We prove that for constant $k$, Max-$k$-OBCS
is hard to approximate within a factor of $n^{1 -\epsilon}$, for any $\epsilon
> 0$, unless $\mathsf{P} = \mathsf{NP}$. This is an improvement on the previous
lower bound of $\sqrt{n}$ for Max-2-OBCS due to Orlovich et al. We provide
lower bounds on the approximability when $k$ is not a constant as well.
Max-$k$-OBCS can be seen as a generalization of Maximum Independent Set
(Max-IS). We generalize Tur\'an's greedy algorithm for Max-IS and prove that it
approximates Max-$k$-OBCS within a factor of $(2k - 1)\overline{d} + k$, where
$\overline{d}$ is the average degree of the input graph $G$. This approximation
factor is a generalization of Tur\'an's approximation factor for Max-IS.
","[{'version': 'v1', 'created': 'Wed, 29 Nov 2017 09:52:09 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Mar 2018 15:04:37 GMT'}, {'version': 'v3', 'created': 'Wed, 28 Mar 2018 03:33:38 GMT'}]",2018-03-29,"[['Mishra', 'Sounaka', ''], ['Rajakrishnan', 'Shijin', '']]","['Approximation algorithms', 'Graph algorithm', 'Dissociation set', 'k-orderbounded component']"
16975,1205.0839,Evgeny Shulkin,"Evgeny V. Shulkin, Sergey M. Krasnopeyev","Development of application for discovering and binding to published
  geospatial processes in distributed environments","8 pages, 5 figures",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, society has recognized that the lack of access to spatial data and
tools for their analysis is the limiting factor of economic development. It
came to the realization that without the single information space, which is
implemented in the form of spatial data infrastructures, a progressive business
development is impossible. Spatial data infrastructures will support a variety
of tasks, which requires the binding of geospatial information from multiple
sources. In the last few years, the rate of progress in spatial data collection
was higher, than in management and analysis of data. Infrastructures allow the
accumulated data to be available to large groups of users, and infrastructure
of analysis allows the data to be effectively used for such tasks as municipal
planning, science research, etc. Moreover, free access to the information
resources and instruments of analysis will serve as an additional impulse to
development of application models in corresponding areas of expertise. The goal
of this paper is to indicate possible solutions to the client-side problems of
spatial data analysis in distributed environments, using the developing
application for data analysis as an example.
","[{'version': 'v1', 'created': 'Fri, 4 May 2012 00:47:53 GMT'}]",2012-05-07,"[['Shulkin', 'Evgeny V.', ''], ['Krasnopeyev', 'Sergey M.', '']]","['spatial data analysis', 'Open Geospatial Consortium', 'spatial data infrastructure', 'Web Processing Service', 'client for spatial data analysis']"
16976,1402.1241,Shafi'i Muhammad Abdulhamid Mr,"Shafii Muhammad Abdulhamid, Ismaila Idris","Design Evaluation of Some Nigerian University Portals: A Programmer's
  Point of View",8 pages. Computer Science and Telecommunications 2010,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today, Nigerian Universities feel pressured to get a portal up and running
dynamic, individualized web systems have become essential for institutions of
higher learning. As a result, most of the Nigerian University portals nowadays
do not meet up to standard. In this paper, ten Nigerian University portals were
selected and their design evaluated in accordance with the international best
practices. The result was revealing.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2014 04:25:53 GMT'}]",2014-02-07,"[['Abdulhamid', 'Shafii Muhammad', ''], ['Idris', 'Ismaila', '']]","['Portal', 'Database', 'Website', 'Personalization', 'Internet and System design']"
16977,1505.00040,Mohammad Ehab Ragab,Mohammad Ehab Ragab,Overlapping and Non-overlapping Camera Layouts for Robot Pose Estimation,"7 pages, 5 figures","IJCSI - March 2015 Issue (Volume 12, Issue 2)",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the use of overlapping and non-overlapping camera layouts in
estimating the ego-motion of a moving robot. To estimate the location and
orientation of the robot, we investigate using four cameras as non-overlapping
individuals, and as two stereo pairs. The pros and cons of the two approaches
are elucidated. The cameras work independently and can have larger field of
view in the non-overlapping layout. However, a scale factor ambiguity should be
dealt with. On the other hand, stereo systems provide more accuracy but require
establishing feature correspondence with more computational demand. For both
approaches, the extended Kalman filter is used as a real-time recursive
estimator. The approaches studied are verified with synthetic and real
experiments alike.
","[{'version': 'v1', 'created': 'Thu, 30 Apr 2015 21:42:23 GMT'}]",2015-05-04,"[['Ragab', 'Mohammad Ehab', '']]","['Stereo', 'Multiple Cameras', 'Extended Kalman Filter', 'Robot Pose Estimation']"
16978,1710.04450,Parvin Razzaghi,Parvin Razzaghi,Self-Taught Support Vector Machine,,,,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a new approach for classification of target task using limited
labeled target data as well as enormous unlabeled source data is proposed which
is called self-taught learning. The target and source data can be drawn from
different distributions. In the previous approaches, covariate shift assumption
is considered where the marginal distributions p(x) change over domains and the
conditional distributions p(y|x) remain the same. In our approach, we propose a
new objective function which simultaneously learns a common space T(.) where
the conditional distributions over domains p(T(x)|y) remain the same and learns
robust SVM classifiers for target task using both source and target data in the
new representation. Hence, in the proposed objective function, the hidden label
of the source data is also incorporated. We applied the proposed approach on
Caltech-256, MSRC+LMO datasets and compared the performance of our algorithm to
the available competing methods. Our method has a superior performance to the
successful existing algorithms.
","[{'version': 'v1', 'created': 'Thu, 12 Oct 2017 11:12:30 GMT'}]",2017-10-13,"[['Razzaghi', 'Parvin', '']]","['self-taught learning', 'domain adaption', 'inductive transfer learning', 'self-taught SVM']"
16979,1607.03854,John V Monaco,John V. Monaco and Charles C. Tappert,"The Partially Observable Hidden Markov Model and its Application to
  Keystroke Dynamics",,,,,cs.IT cs.CR math.IT stat.ML,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The partially observable hidden Markov model is an extension of the hidden
Markov Model in which the hidden state is conditioned on an independent Markov
chain. This structure is motivated by the presence of discrete metadata, such
as an event type, that may partially reveal the hidden state but itself
emanates from a separate process. Such a scenario is encountered in keystroke
dynamics whereby a user's typing behavior is dependent on the text that is
typed. Under the assumption that the user can be in either an active or passive
state of typing, the keyboard key names are event types that partially reveal
the hidden state due to the presence of relatively longer time intervals
between words and sentences than between letters of a word. Using five public
datasets, the proposed model is shown to consistently outperform other anomaly
detectors, including the standard HMM, in biometric identification and
verification tasks and is generally preferred over the HMM in a Monte Carlo
goodness of fit test.
","[{'version': 'v1', 'created': 'Wed, 13 Jul 2016 18:30:33 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Aug 2016 14:03:42 GMT'}, {'version': 'v3', 'created': 'Mon, 29 Aug 2016 15:22:22 GMT'}, {'version': 'v4', 'created': 'Wed, 21 Dec 2016 20:54:21 GMT'}, {'version': 'v5', 'created': 'Tue, 11 Apr 2017 17:22:17 GMT'}, {'version': 'v6', 'created': 'Fri, 17 Nov 2017 14:48:33 GMT'}, {'version': 'v7', 'created': 'Mon, 20 Nov 2017 16:02:39 GMT'}]",2017-11-21,"[['Monaco', 'John V.', ''], ['Tappert', 'Charles C.', '']]","['hidden Markov model', 'keystroke biometrics', 'behavioralbiometrics', 'time intervals', 'anomaly detection']"
16980,1303.6782,Carlo Silva,"Carlo Marcelo Revoredo da Silva, Jose Lutiano Costa da Silva, Ricardo
  Batista Rodrigues, Leandro Marques do Nascimento, Vinicius Cardoso Garcia",Systematic Mapping Study On Security Threats in Cloud Computing,10 pages,"(IJCSIS) International Journal of Computer Science and Information
  Security, Vol. 11, No. 3, March 2013",,,cs.CR,http://creativecommons.org/licenses/by/3.0/,"  Today, Cloud Computing is rising strongly, presenting itself to the market by
its main service models, known as IaaS, PaaS and SaaS, that offer advantages in
operational investments by means of on-demand costs, where consumers pay by
resources used. In face of this growth, security threats also rise,
compromising the Confidentiality, Integrity and Availability of the services
provided. Our work is a Systematic Mapping where we hope to present metrics
about publications available in literature that deal with some of the seven
security threats in Cloud Computing, based in the guide entitled ""Top Threats
to Cloud Computing"" from the Cloud Security Alliance (CSA). In our research we
identified the more explored threats, distributed the results between fifteen
Security Domains and identified the types of solutions proposed for the
threats. In face of those results, we highlight the publications that are
concerned to fulfill some standard of compliance.
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2013 10:37:25 GMT'}]",2013-03-28,"[['da Silva', 'Carlo Marcelo Revoredo', ''], ['da Silva', 'Jose Lutiano Costa', ''], ['Rodrigues', 'Ricardo Batista', ''], ['Nascimento', 'Leandro Marques do', ''], ['Garcia', 'Vinicius Cardoso', '']]","['Security Threats', 'Cloud Computing', 'Systematic Literature Review', 'Security Domains', 'Compliance Issues']"
16981,1209.5901,Koen Holtman,Koen Holtman,"Appcessory Economics: Enabling loosely coupled hardware / software
  innovation",,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An appcessory (app + accessory) is a smart phone accessory that is combined
with a specially written app to perform a useful function. An example is a toy
helicopter controlled by a smart phone app: the full value proposition involves
both new hardware outside the phone and new software running inside the phone.
Like the smart phone itself and like a PC, the appcessory hardware is a
platform: it has the property that it becomes even more valuable if innovative
new software is written for it. It is technically possible that innovation in
the appcessory space becomes loosely coupled, with different parties
specializing to innovate on either the hardware (accessory) side or the
software (app) side. However, we are not seeing this loose coupling yet in the
current market. We argue that the reason for this is economical: a market
framework in which loosely coupled software parties are adequately rewarded is
not yet in place. We describe a technical solution for creating the needed
market framework, consisting of an automated micropayment system by which money
can flow from appcessory hardware makers to app software innovators. This
solution also has a broader applicability to the problem of innovation in the
Internet of Things.
","[{'version': 'v1', 'created': 'Wed, 26 Sep 2012 11:14:56 GMT'}]",2012-09-27,"[['Holtman', 'Koen', '']]","['appcessories', 'smart phones', 'apps', 'accessories', 'micropayments', 'security', 'Internet of Things', 'economics of innovation']"
16982,0907.3246,Martyn Amos,Alan Gibbons and Martyn Amos,Wave propagation in filamental cellular automata,"To appear in the International Journal of Natural Computing Research.
  Changes to previous version: (1) Made title more specific, (2) added several
  explanatory figures, (3) improved background material, (4) several
  clarifications as requested by referees",,,,cs.FL nlin.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by questions in biology and distributed computing, we investigate
the behaviour of particular cellular automata, modelled as one-dimensional
arrays of identical finite automata. We investigate what sort of
self-stabilising cooperative behaviour these can induce in terms of waves of
cellular state changes along a filament of cells. We discover what the minimum
requirements are, in terms of numbers of states and the range of communication
between automata, to observe this for individual filaments. We also discover
that populations of growing filaments may have useful features that the
individual filament does not have, and we give the results of numerical
simulations.
","[{'version': 'v1', 'created': 'Sat, 18 Jul 2009 22:18:24 GMT'}, {'version': 'v2', 'created': 'Sat, 14 Nov 2009 00:27:17 GMT'}]",2009-11-14,"[['Gibbons', 'Alan', ''], ['Amos', 'Martyn', '']]","['Cellular automata', 'distributed control', 'pattern formation']"
16983,1501.05390,Victor Pan,Victor Y. Pan and Liang Zhao,"Real Polynomial Root-finding by Means of Matrix and Polynomial
  Iterations","24 pages 12 tables. arXiv admin note: substantial text overlap with
  arXiv:1404.6817",,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Univariate polynomial root-finding is a classical subject, still important
for modern computing. Frequently one seeks just the real roots of a polynomial
with real coefficients. They can be approximated at a low computational cost if
the polynomial has no nonreal roots, but for high degree polynomials, nonreal
roots are typically much more numerous than the real ones. The challenge is
known for a long time, and the subject has been intensively studied.
Nevertheless, we produce some novel ideas and techniques and obtain dramatic
acceleration of the known algorithms. In order to achieve our progress we
exploit the correlation between the computations with matrices and polynomials,
randomized matrix computations, and complex plane geometry, extend the
techniques of the matrix sign iterations, and use the structure of the
companion matrix of the input polynomial. The results of our extensive tests
with benchmark polynomials and random matrices are quite encouraging. In
particular in our tests the number of iterations required for convergence of
our algorithms grew very slowly (if at all) as we increased the degree of the
univariate input polynomials and the dimension of the input matrices from 64 to
1024.
","[{'version': 'v1', 'created': 'Thu, 22 Jan 2015 04:30:09 GMT'}, {'version': 'v2', 'created': 'Sat, 1 Aug 2015 04:01:28 GMT'}, {'version': 'v3', 'created': 'Thu, 13 Apr 2017 15:56:28 GMT'}]",2017-04-14,"[['Pan', 'Victor Y.', ''], ['Zhao', 'Liang', '']]","['Polynomials', 'Real roots', 'Matrices', 'Matrix sign iterations', 'Companion matrix', 'Frobenius algebra', 'Square root iterations', 'Root squaring']"
16984,1610.01518,Giorgio Sonnino,"Alberto Sonnino, Giorgio Sonnino",Elliptic-Curves Cryptography on High-Dimensional Surfaces,"10 pages, 4 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We discuss the use of elliptic curves in cryptography on high-dimensional
surfaces. In particular, instead of a Diffie-Hellman key exchange protocol
written in the form of a bi-dimensional row, where the elements are made up
with 256 bits, we propose a key exchange protocol given in a matrix form, with
four independent entries each of them constructed with 64 bits. Apart from the
great advantage of significantly reducing the number of used bits, this
methodology appears to be immune to attacks of the style of Western, Miller,
and Adleman, and at the same time it is also able to reach the same level of
security as the cryptographic system presently obtained by the Microsoft
Digital Rights Management. A nonlinear differential equation (NDE) admitting
the elliptic curves as a special case is also proposed. The study of the class
of solutions of this NDE is in progress.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2016 15:33:34 GMT'}]",2016-10-06,"[['Sonnino', 'Alberto', ''], ['Sonnino', 'Giorgio', '']]","['Elliptic-curve cryptography', 'Elliptic-curve discrete log problem', 'Publickey cryptography', 'Nonlinear differential equations']"
16985,1606.05991,Nadir  k.Salih nks,"Nadir K.Salih, Tianyi Zang",Modeling and Self-Configuring SaaS Application,,,,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The main objectives of SaaS application are to make the management and
control of software easier and take the management strain away from consumers.
However, it also leads to software services available globally and this has
been realized in our paper by designing a new model for SaaS application. The
three levels we have classified in our model easy adapted to workflow and
services. From the application layers meat-model description we discovered a
new algorithm for the self-configuration of SaaS application. We used a feature
model to define the variation of our model's management levels. The Xml file
obtained from the feature model gave interactive communication between three
levels and our new self-configuration algorithm. That increased the performance
by selecting from the web a suitable configuration for every level. We have
explained all the processes by an online booking example. Finally we present a
conclusion and future work.
","[{'version': 'v1', 'created': 'Mon, 20 Jun 2016 07:06:14 GMT'}]",2016-06-21,"[['Salih', 'Nadir K.', ''], ['Zang', 'Tianyi', '']]","['SaaS application', 'Modeling', 'meta-model', 'Selfconfiguration', 'Feature model']"
16986,0804.4347,Sossio Vergara,Sossio Vergara,Nonorthogonal Bases and Phase Decomposition: Properties and Applications,11 pages,"Published in : Digital Signal Processing (2014), pp. 223-230",,,cs.NA cs.SD math.FA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a previous paper [1] it was discussed the viability of functional analysis
using as a basis a couple of generic functions, and hence vectorial
decomposition. Here we complete the paradigm exploiting one of the analysis
methodologies developed there, but applied to phase coordinates, so needing
only one function as a basis. It will be shown that, thanks to the novel
iterative analysis, any function satisfying a rather loose requisite is
ontologically a basis. This in turn generalizes the polar version of the
Fourier theorem to an ample class of nonorthogonal bases. The main advantage of
this generalization is that it inherits some of the properties of the original
Fourier theorem. As a result the new transform has a wide range of applications
and some remarkable consequences. The new tool will be compared with wavelets
and frames. Examples of analysis and reconstruction of functions using the
developed algorithms and generic bases will be given. Some of the properties,
and applications that can promptly benefit from the theory, will be discussed.
The implementation of a matched filter for noise suppression will be used as an
example of the potential of the theory.
","[{'version': 'v1', 'created': 'Mon, 28 Apr 2008 08:59:52 GMT'}, {'version': 'v2', 'created': 'Sat, 23 Nov 2013 08:32:29 GMT'}]",2013-11-26,"[['Vergara', 'Sossio', '']]","['Fourier analysis', 'wavelets', 'nonorthogonal', 'polar.          vsossio@gmail']"
16987,0806.3630,Chau Yuen,"Chau Yuen, Sumei Sun, Jian-Kang Zhang",Comparative Study of SVD and QRS in Closed-Loop Beamforming Systems,Milcom 2007,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We compare two closed-loop beamforming algorithms, one based on singular
value decomposition (SVD) and the other based on equal diagonal QR
decomposition (QRS). SVD has the advantage of parallelizing the MIMO channel,
but each of the sub-channels has different gain. QRS has the advantage of
having equal diagonal value for the decomposed channel, but the subchannels are
not fully parallelized, hence requiring successive interference cancellation or
other techniques to perform decoding. We consider a closed-loop system where
the feedback information is a unitary beamforming matrix. Due to the discrete
and limited modulation set, SVD may have inferior performance to QRS when no
modulation set selection is performed. However, if the selection of modulation
set is performed optimally, we show that SVD can outperform QRS.
","[{'version': 'v1', 'created': 'Mon, 23 Jun 2008 07:54:55 GMT'}]",2008-06-24,"[['Yuen', 'Chau', ''], ['Sun', 'Sumei', ''], ['Zhang', 'Jian-Kang', '']]","['closed-loop beamforming', 'singular value decomposition', 'equal diagonal decomposition', 'geometry mean decomposition']"
16988,1610.04073,Wenhao Huang,"Wenhao Huang, Ge Li, Zhi Jin",Improved Knowledge Base Completion by Path-Augmented TransR Model,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge base completion aims to infer new relations from existing
information. In this paper, we propose path-augmented TransR (PTransR) model to
improve the accuracy of link prediction. In our approach, we base PTransR model
on TransR, which is the best one-hop model at present. Then we regularize
TransR with information of relation paths. In our experiment, we evaluate
PTransR on the task of entity prediction. Experimental results show that
PTransR outperforms previous models.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2016 08:34:15 GMT'}]",2016-10-14,"[['Huang', 'Wenhao', ''], ['Li', 'Ge', ''], ['Jin', 'Zhi', '']]","['knowledge base completion', 'relation path', 'link prediction']"
16989,1604.07781,Andrey Makarenko,A.V. Makarenko,"The dynamics of publishing of posts and comments on facebook (the
  russian segment, the first five months of 2013)","14 pages, 16 figures, 2 tables",,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The article presents a study of some characteristics of post and comment
publishing in the Russian segment of Facebook. A number of non-trivial results
has been obtained. For example, a significant anomaly has been detected in the
number of user accounts with the rate of publishing posts of approximately two
posts per three days. The analysis has been carried out at the level of basic
characteristics that are shared by most social media platforms. It makes
possible a direct comparison of obtained results with data from other
platforms. The article presents an approach to formalization and ordering of
structural and informational elements on social media platforms. The approach
is based on the representation of these structural elements in the form of a
coherent hierarchy of container objects and their relations. This method allows
to structure and analyze raw data from different social media platforms in a
unified algorithmic design. The described approach is more formal, universal
and constructive than other known approaches.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2016 18:19:47 GMT'}]",2016-04-27,"[['Makarenko', 'A. V.', '']]","['social media', 'data representation scheme', 'Facebook', 'dynamics of publishing', 'posts', 'comments']"
16990,1111.6757,Fadi  Battah,Hussain A.H. Awad and Fadi M. Battah,"Enhancing Information Systems Security in Educational Organizations in
  KSA through proposing security model",,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is well known that technology utilization is not restricted for one sector
than the other anymore, Educational organizations share many parts of their
information systems with commercial organizations. In this paper we will try to
identify the main characteristics of information systems in educational
organizations, then we will propose a model of two parts to enhance the
information systems security, the first part of the model will handle the
policy and laws of the information system, the second part will provide a
technical approach on how to audit and subsequently maintain the security of
information system.
","[{'version': 'v1', 'created': 'Tue, 29 Nov 2011 10:41:17 GMT'}]",2011-11-30,"[['Awad', 'Hussain A. H.', ''], ['Battah', 'Fadi M.', '']]","['Information Systems', 'Security', 'Model', 'Enhancing Security', 'Security Policy']"
16991,1511.00112,Arkadiusz Biernacki,Arkadiusz Biernacki,A Novel Play-out Algorithm for HTTP Adaptive Streaming,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the paper, we proposed a novel algorithm dedicated to adaptive video
streaming based on HTTP. The algorithm employs a hybrid play-out strategy which
combines two popular approaches: an estimation of network bandwidth and a
control of a player buffer. The proposed algorithm was implemented in two
versions which differ in the method of handling fluctuations of network
throughput.
  The proposed hybrid algorithm was evaluated against solutions which base
their play-out strategy purely on bandwidth or buffer level assessment. The
comparison was performed in an environment which emulated two systems: a Wi-Fi
network with a single immobile node and HSPA (High Speed Packet Access) network
with a mobile node. The evaluation shows that the hybrid approach in most cases
achieves better results compared to its competitors, being able to stream the
video more smoothly without unnecessary bit-rate switches. However, in certain
network conditions, this score is traded for a worse throughput utilisation
compared to other play-out strategies.
","[{'version': 'v1', 'created': 'Sat, 31 Oct 2015 11:18:53 GMT'}]",2015-11-03,"[['Biernacki', 'Arkadiusz', '']]","['Video streaming', 'Adaptive video', 'Performance evaluation']"
16992,1401.4674,Ronald Hochreiter,Ronald Hochreiter and Christoph Waldhauser,"Evolving Accuracy: A Genetic Algorithm to Improve Election Night
  Forecasts",,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we apply genetic algorithms to the field of electoral studies.
Forecasting election results is one of the most exciting and demanding tasks in
the area of market research, especially due to the fact that decisions have to
be made within seconds on live television. We show that the proposed method
outperforms currently applied approaches and thereby provide an argument to
tighten the intersection between computer science and social science,
especially political science, further. We scrutinize the performance of our
algorithm's runtime behavior to evaluate its applicability in the field.
Numerical results with real data from a local election in the Austrian province
of Styria from 2010 substantiate the applicability of the proposed approach.
","[{'version': 'v1', 'created': 'Sun, 19 Jan 2014 14:46:09 GMT'}]",2014-01-21,"[['Hochreiter', 'Ronald', ''], ['Waldhauser', 'Christoph', '']]","['election night forecasting', 'genetic algorithm', 'ecological regression', 'constituencyclustering']"
16993,1712.03689,Andrea Asperti,"Andrea Asperti, Claudio Mastronardo","The Effectiveness of Data Augmentation for Detection of Gastrointestinal
  Diseases from Endoscopical Images",,"Proceedings of the 5th International Conference on Bioimaging,
  BIOIMAGING 2018, 19-21 January 2018, Funchal, Madeira - Portugal",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The lack, due to privacy concerns, of large public databases of medical
pathologies is a well-known and major problem, substantially hindering the
application of deep learning techniques in this field. In this article, we
investigate the possibility to supply to the deficiency in the number of data
by means of data augmentation techniques, working on the recent Kvasir dataset
of endoscopical images of gastrointestinal diseases. The dataset comprises
4,000 colored images labeled and verified by medical endoscopists, covering a
few common pathologies at different anatomical landmarks: Z-line, pylorus and
cecum. We show how the application of data augmentation techniques allows to
achieve sensible improvements of the classification with respect to previous
approaches, both in terms of precision and recall.
","[{'version': 'v1', 'created': 'Mon, 11 Dec 2017 09:29:01 GMT'}]",2017-12-12,"[['Asperti', 'Andrea', ''], ['Mastronardo', 'Claudio', '']]","['Data Augmentation', 'Deep Learning', 'Gastrointestinal Disease', 'Endoscopy', 'Kvasir']"
16994,1609.06221,Avnish Chandra Suman,"Saraswati Mishra, Avnish Chandra Suman","An Efficient Method of Partitioning High Volumes of Multidimensional
  Data for Parallel Clustering Algorithms","5 pages, 6 figures","Int. Journal of Engineering Research and Application ISSN :
  2248-9622, Vol. 6, Issue 8, August 2016, pp.67-71",,,cs.AI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An optimal data partitioning in parallel & distributed implementation of
clustering algorithms is a necessary computation as it ensures independent task
completion, fair distribution, less number of affected points and better &
faster merging. Though partitioning using Kd Tree is being conventionally used
in academia, it suffers from performance drenches and bias (non equal
distribution) as dimensionality of data increases and hence is not suitable for
practical use in industry where dimensionality can be of order of 100s to
1000s. To address these issues we propose two new partitioning techniques using
existing mathematical models & study their feasibility, performance (bias and
partitioning speed) & possible variants in choosing initial seeds. First method
uses an n dimensional hashed grid based approach which is based on mapping the
points in space to a set of cubes which hashes the points. Second method uses a
tree of voronoi planes where each plane corresponds to a partition. We found
that grid based approach was computationally impractical, while using a tree of
voronoi planes (using scalable K-Means++ initial seeds) drastically
outperformed the Kd-tree tree method as dimensionality increased.
","[{'version': 'v1', 'created': 'Tue, 20 Sep 2016 15:26:37 GMT'}]",2016-09-21,"[['Mishra', 'Saraswati', ''], ['Suman', 'Avnish Chandra', '']]","['Clustering', 'Data Partitioning', 'Parallel Processing', 'KD Tree', 'KD-Tree', 'Voronoi Diagrams']"
16995,1304.5755,Puneet Kishor,"Puneet Kishor, Oshani Seneviratne, and Noah Giansiracusa",Policy Aware Geospatial Data,"5 pages. Accepted for ACMGIS 2009, but withdrawn because ACM would
  not include this paper unless I presented in person (prior commitments
  prevented me from travel even though I had registered)",,,,cs.OH,http://creativecommons.org/licenses/publicdomain/,"  Digital Rights Management (DRM) prevents end-users from using content in a
manner inconsistent with its creator's wishes. The license describing these
use-conditions typically accompanies the content as its metadata. A resulting
problem is that the license and the content can get separated and lose track of
each other. The best metadata have two distinct qualities--they are created
automatically without user intervention, and they are embedded within the data
that they describe. If licenses are also created and transported this way, data
will always have licenses, and the licenses will be readily examinable. When
two or more datasets are combined, a new dataset, and with it a new license,
are created. This new license is a function of the licenses of the component
datasets and any additional conditions that the person combining the datasets
might want to impose. Following the notion of a data-purpose algebra, we model
this phenomenon by interpreting the transfer and conjunction of data as
inducing an algebraic operation on the corresponding licenses. When a dataset
passes from one source to the next its license is transformed in a
deterministic way, and similarly when datasets are combined the associated
licenses are combined in a non-trivial algebraic manner. Modern,
computer-savvy, licensing regimes such as Creative Commons allow writing the
license in a special kind of language called Creative Commons Rights Expression
Language (ccREL). ccREL allows creating and embedding the license using RDFa
utilizing XHTML. This is preferred over DRM which includes the rights in a
binary file completely opaque to nearly all users. The colocation of metadata
with human-visible XHTML makes the license more transparent. In this paper we
describe a methodology for creating and embedding licenses in geographic data
utilizing ccREL, and programmatically examining embedded licenses in component
data...
","[{'version': 'v1', 'created': 'Sun, 21 Apr 2013 15:50:46 GMT'}]",2013-04-23,"[['Kishor', 'Puneet', ''], ['Seneviratne', 'Oshani', ''], ['Giansiracusa', 'Noah', '']]","['Data', 'Mash-ups', 'License', 'Geospatial']"
16996,1306.4493,Ezio Bartocci,"Ezio Bartocci, Luca Bortolussi, and Laura Nenzi","A temporal logic approach to modular design of synthetic biological
  circuits",,,,,cs.LO cs.ET q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new approach for the design of a synthetic biological circuit
whose behaviour is specified in terms of signal temporal logic (STL) formulae.
We first show how to characterise with STL formulae the input/output behaviour
of biological modules miming the classical logical gates (AND, NOT, OR). Hence,
we provide the regions of the parameter space for which these specifications
are satisfied. Given a STL specification of the target circuit to be designed
and the networks of its constituent components, we propose a methodology to
constrain the behaviour of each module, then identifying the subset of the
parameter space in which those constraints are satisfied, providing also a
measure of the robustness for the target circuit design. This approach, which
leverages recent results on the quantitative semantics of Signal Temporal
Logic, is illustrated by synthesising a biological implementation of an
half-adder.
","[{'version': 'v1', 'created': 'Wed, 19 Jun 2013 11:29:01 GMT'}]",2013-06-20,"[['Bartocci', 'Ezio', ''], ['Bortolussi', 'Luca', ''], ['Nenzi', 'Laura', '']]","['Synthetic Biology', 'Parameter Synthesis', 'Temporal Logic']"
16997,1510.01276,Kardi Teknomo,"Michael Yba\~nez, Kardi Teknomo, Proceso Fernandez","Hadamard Product Decomposition and Mutually Exclusive Matrices on
  Network Structure and Utilization","Proceeding of the International Conference on Innovation Challenges
  in Multidisciplinary Research and Practice (ICMRP 2013), Kuala Lumpur, Dec
  13-14, 2013",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graphs are very important mathematical structures used in many applications,
one of which is transportation science. When dealing with transportation
networks, one deals not only with the network structure, but also with
information related to the utilization of the elements of the network, which
can be shown using flow and origin-destination matrices. This paper extends an
algebraic model used to relate all these components by deriving additional
relationships and constructing a more structured understanding of the model.
Specifically, the paper introduces the concept of mutually exclusive matrices,
and shows their effect when decomposing the components of a Hadamard product on
matrices
","[{'version': 'v1', 'created': 'Thu, 1 Oct 2015 11:30:07 GMT'}]",2015-10-06,"[['Ybañez', 'Michael', ''], ['Teknomo', 'Kardi', ''], ['Fernandez', 'Proceso', '']]","['network theory and technology', 'ICT', 'intelligent transportation']"
16998,1108.2095,Rakesh Kumar Er.,Rakesh Kumar and Mayank Dave,Mobile Agent as an Approach to Improve QoS in Vehicular Ad Hoc Network,"6 pages,5 figures; IJCA Special Issue on ""Mobile Ad-hoc Networks""
  2011",,,,cs.NI cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vehicular traffic is a foremost problem in modern cities. Huge amount of time
and resources are wasted while traveling due to traffic congestion. With the
introduction of sophisticated traffic management systems, such as those
incorporating dynamic traffic assignments, more stringent demands are being
placed upon the available real time traffic data. In this paper we have
proposed mobile agent as a mechanism to handle the traffic problem on road.
Mobile software agents can be used to provide the better QoS (Quality of
Service) in vehicular ad hoc network to improve the safety application and
driver comfort.
","[{'version': 'v1', 'created': 'Wed, 10 Aug 2011 04:30:55 GMT'}]",2011-08-11,"[['Kumar', 'Rakesh', ''], ['Dave', 'Mayank', '']]","['QoS', 'Mobile Agent', 'VANET']"
16999,1610.05646,Anisur Molla Rahaman,Anisur Rahaman Molla and Gopal Pandurangan,Distributed Computation of Mixing Time,"To appear in the Proceedings of ICDCN 2017, 10 pages",,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The mixing time of a graph is an important metric, which is not only useful
in analyzing connectivity and expansion properties of the network, but also
serves as a key parameter in designing efficient algorithms. We present an
efficient distributed algorithm for computing the mixing time of undirected
graphs. Our algorithm estimates the mixing time $\tau_s$ (with respect to a
source node $s$) of any $n$-node undirected graph in $O(\tau_s \log n)$ rounds.
Our algorithm is based on random walks and require very little memory and use
lightweight local computations, and work in the CONGEST model. Hence our
algorithm is scalable under bandwidth constraints and can be an helpful
building block in the design of topologically aware networks.
","[{'version': 'v1', 'created': 'Tue, 18 Oct 2016 14:40:12 GMT'}]",2016-10-19,"[['Molla', 'Anisur Rahaman', ''], ['Pandurangan', 'Gopal', '']]","['distributed algorithm', 'random walk', 'mixing time', 'conductance', 'spectralproperties']"
17000,1702.06510,Juan-Manuel Torres-Moreno,"Luis Adri\'an Cabrera-Diego, St\'ephane Huet, Bassam Jabaian,
  Alejandro Molina, Juan-Manuel Torres-Moreno, Marc El-B\`eze, Barth\'el\'emy
  Durette","Algorithmes de classification et d'optimisation: participation du
  LIA/ADOC \'a DEFT'14","8 pages, 3 tables, Conference paper (in French)",,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This year, the DEFT campaign (D\'efi Fouilles de Textes) incorporates a task
which aims at identifying the session in which articles of previous TALN
conferences were presented. We describe the three statistical systems developed
at LIA/ADOC for this task. A fusion of these systems enables us to obtain
interesting results (micro-precision score of 0.76 measured on the test corpus)
","[{'version': 'v1', 'created': 'Tue, 21 Feb 2017 18:24:52 GMT'}]",2017-02-22,"[['Cabrera-Diego', 'Luis Adrián', ''], ['Huet', 'Stéphane', ''], ['Jabaian', 'Bassam', ''], ['Molina', 'Alejandro', ''], ['Torres-Moreno', 'Juan-Manuel', ''], ['El-Bèze', 'Marc', ''], ['Durette', 'Barthélémy', '']]","['text classification', 'optimization', 'similarity']"
17001,1702.00736,Artur Je\.z,Artur Je\.z,Word equations in linear space,"Presented at ICALP 2017, submitted to a journal. Second version
  includeds simpliefied construction and clearer notation as well as fixes some
  small errors from the first version",,,,cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Satisfiability of word equations is an important problem in the intersection
of formal languages and algebra: Given two sequences consisting of letters and
variables we are to decide whether there is a substitution for the variables
that turns this equation into true equality of strings. The exact computational
complexity of this problem remains unknown, with the best lower and upper
bounds being, respectively, NP and PSPACE. Recently, the novel technique of
recompression was applied to this problem, simplifying the known proofs and
lowering the space complexity to (nondeterministic) O(n log n). In this paper
we show that satisfiability of word equations is in nondeterministic linear
space, thus the language of satisfiable word equations is context-sensitive,
and by the famous Immerman-Szelepcsenyi theorem: the language of unsatisfiable
word equations is also context-sensitive. We use the known recompression-based
algorithm and additionally employ Huffman coding for letters. The proof,
however, uses analysis of how the fragments of the equation depend on each
other as well as a new strategy for nondeterministic choices of the algorithm,
which uses several new ideas to limit the space occupied by the letters.
","[{'version': 'v1', 'created': 'Thu, 2 Feb 2017 16:18:31 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Oct 2020 12:50:42 GMT'}]",2020-10-19,"[['Jeż', 'Artur', '']]","['Word equations', 'string unification', 'context-sensitive languages', 'space efficient computations', 'linear space']"
17002,1610.02085,Tim Althoff,"Tim Althoff, Ryen W. White, Eric Horvitz",Influence of Pok\'emon Go on Physical Activity: Study and Implications,,,,,cs.CY cs.HC cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Physical activity helps people maintain a healthy weight and reduces the risk
for several chronic diseases. Although this knowledge is widely recognized,
adults and children in many countries around the world do not get recommended
amounts of physical activity. While many interventions are found to be
ineffective at increasing physical activity or reaching inactive populations,
there have been anecdotal reports of increased physical activity due to novel
mobile games that embed game play in the physical world. The most recent and
salient example of such a game is Pok\'emon Go, which has reportedly reached
tens of millions of users in the US and worldwide.
  We study the effect of Pok\'emon Go on physical activity through a
combination of signals from large-scale corpora of wearable sensor data and
search engine logs for 32 thousand users over a period of three months.
Pok\'emon Go players are identified through search engine queries and activity
is measured through accelerometry. We find that Pok\'emon Go leads to
significant increases in physical activity over a period of 30 days, with
particularly engaged users (i.e., those making multiple search queries for
details about game usage) increasing their activity by 1473 steps a day on
average, a more than 25% increase compared to their prior activity level
($p<10^{-15}$). In the short time span of the study, we estimate that Pok\'emon
Go has added a total of 144 billion steps to US physical activity. Furthermore,
Pok\'emon Go has been able to increase physical activity across men and women
of all ages, weight status, and prior activity levels showing this form of game
leads to increases in physical activity with significant implications for
public health. We find that Pok\'emon Go is able to reach low activity
populations while all four leading mobile health apps studied in this work
largely draw from an already very active population.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2016 21:58:00 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Oct 2016 00:50:50 GMT'}]",2016-10-31,"[['Althoff', 'Tim', ''], ['White', 'Ryen W.', ''], ['Horvitz', 'Eric', '']]","['physical activity', 'Pokémon Go', 'wearable']"
17003,1710.05420,Ermao Cai,"Ermao Cai, Da-Cheng Juan, Dimitrios Stamoulis, Diana Marculescu","NeuralPower: Predict and Deploy Energy-Efficient Convolutional Neural
  Networks",Accepted as a conference paper at ACML 2017,,,,cs.LG cs.PF stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  ""How much energy is consumed for an inference made by a convolutional neural
network (CNN)?"" With the increased popularity of CNNs deployed on the
wide-spectrum of platforms (from mobile devices to workstations), the answer to
this question has drawn significant attention. From lengthening battery life of
mobile devices to reducing the energy bill of a datacenter, it is important to
understand the energy efficiency of CNNs during serving for making an
inference, before actually training the model. In this work, we propose
NeuralPower: a layer-wise predictive framework based on sparse polynomial
regression, for predicting the serving energy consumption of a CNN deployed on
any GPU platform. Given the architecture of a CNN, NeuralPower provides an
accurate prediction and breakdown for power and runtime across all layers in
the whole network, helping machine learners quickly identify the power,
runtime, or energy bottlenecks. We also propose the ""energy-precision ratio""
(EPR) metric to guide machine learners in selecting an energy-efficient CNN
architecture that better trades off the energy consumption and prediction
accuracy. The experimental results show that the prediction accuracy of the
proposed NeuralPower outperforms the best published model to date, yielding an
improvement in accuracy of up to 68.5%. We also assess the accuracy of
predictions at the network level, by predicting the runtime, power, and energy
of state-of-the-art CNN architectures, achieving an average accuracy of 88.24%
in runtime, 88.34% in power, and 97.21% in energy. We comprehensively
corroborate the effectiveness of NeuralPower as a powerful framework for
machine learners by testing it on different GPU platforms and Deep Learning
software tools.
","[{'version': 'v1', 'created': 'Sun, 15 Oct 2017 23:39:29 GMT'}]",2017-10-17,"[['Cai', 'Ermao', ''], ['Juan', 'Da-Cheng', ''], ['Stamoulis', 'Dimitrios', ''], ['Marculescu', 'Diana', '']]","['Power', 'Runtime', 'Energy', 'Polynomial Regression', 'Convolutional Neural Networks']"
17004,1502.04820,Tanmoy Maitra,Tanmoy Maitra,"Cryptanalysis of A Secure Remote User Authentication Scheme Using Smart
  Cards","4 pages, no figure, fresh submission",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smart card based authentication schemes are used in various fields like
e-banking, e-commerce, wireless sensor networks, medical system and so on to
authenticate the both remote user and the application server during the
communication via internet. Recently, Karuppiah and Saravanan proposed an
authentication scheme which is based on password and one-way cryptographic hash
function. They have used a secure identity mechanism i.e., users' and server's
identity are not public. Thus, the user and the server do not send their
identity directly to each other during communications. In this paper, we have
found out that their scheme does not overcome the reply attack and also there
is a fault in the login phase, which makes their scheme is not perfect for
practical use.
","[{'version': 'v1', 'created': 'Tue, 17 Feb 2015 07:55:50 GMT'}]",2015-02-18,"[['Maitra', 'Tanmoy', '']]","['Attack', 'Authentication', 'Password', 'Smart card']"
17005,0705.4094,Ian Kash,"Eric j. Friedman, Joseph Y. Halpern, Ian Kash",Efficiency and Nash Equilibria in a Scrip System for P2P Networks,,,,,cs.GT,,"  A model of providing service in a P2P network is analyzed. It is shown that
by adding a scrip system, a mechanism that admits a reasonable Nash equilibrium
that reduces free riding can be obtained. The effect of varying the total
amount of money (scrip) in the system on efficiency (i.e., social welfare) is
analyzed, and it is shown that by maintaining the appropriate ratio between the
total amount of money and the number of agents, efficiency is maximized. The
work has implications for many online systems, not only P2P networks but also a
wide variety of online forums for which scrip systems are popular, but formal
analyses have been lacking.
","[{'version': 'v1', 'created': 'Mon, 28 May 2007 20:53:09 GMT'}]",2007-05-30,"[['Friedman', 'Eric j.', ''], ['Halpern', 'Joseph Y.', ''], ['Kash', 'Ian', '']]","['Game Theory', 'P2P Networks', 'Scrip Systems']"
17006,1402.2271,Narges Hesami rostami,Narges Hesami Rostami and Esmaeil Kheirkhah and Mehrdad Jalali,"An Optimized Semantic Web Service Composition Method Based on Clustering
  and Ant Colony Algorithm","8 pages, 2 figure, International Journal of Web & Semantic Technology
  (IJWesT)",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In today's Web, Web Services are created and updated on the fly. For
answering complex needs of users, the construction of new web services based on
existing ones is required. It has received a great attention from different
communities. This problem is known as web services composition. However, it is
one of big challenge problems of recent years in a distributed and dynamic
environment. Web services can be composed manually but it is a time consuming
task. The automatic web service composition is one of the key features for
future the semantic web. The various approaches in field of web service
compositions proposed by the researchers. In this paper, we propose a novel
architecture for semantic web service composition using clustering and Ant
colony algorithm.
","[{'version': 'v1', 'created': 'Mon, 10 Feb 2014 20:59:22 GMT'}]",2014-02-11,"[['Rostami', 'Narges Hesami', ''], ['Kheirkhah', 'Esmaeil', ''], ['Jalali', 'Mehrdad', '']]","['Semantic Web Service', 'Web Service Composition', 'Clustering', 'Ant Colony Algorithm']"
17007,1312.4075,Ebrahim Nasrabadi,"Ebrahim Nasrabadi, James B. Orlin",Robust optimization with incremental recourse,,,,,cs.CC math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider an adaptive approach to address optimization
problems with uncertain cost parameters. Here, the decision maker selects an
initial decision, observes the realization of the uncertain cost parameters,
and then is permitted to modify the initial decision. We treat the uncertainty
using the framework of robust optimization in which uncertain parameters lie
within a given set. The decision maker optimizes so as to develop the best cost
guarantee in terms of the worst-case analysis. The recourse decision is
``incremental""; that is, the decision maker is permitted to change the initial
solution by a small fixed amount. We refer to the resulting problem as the
robust incremental problem. We study robust incremental variants of several
optimization problems. We show that the robust incremental counterpart of a
linear program is itself a linear program if the uncertainty set is polyhedral.
Hence, it is solvable in polynomial time. We establish the NP-hardness for
robust incremental linear programming for the case of a discrete uncertainty
set. We show that the robust incremental shortest path problem is NP-complete
when costs are chosen from a polyhedral uncertainty set, even in the case that
only one new arc may be added to the initial path. We also address the
complexity of several special cases of the robust incremental shortest path
problem and the robust incremental minimum spanning tree problem.
","[{'version': 'v1', 'created': 'Sat, 14 Dec 2013 18:14:09 GMT'}]",2013-12-17,"[['Nasrabadi', 'Ebrahim', ''], ['Orlin', 'James B.', '']]","['robust optimization', 'incremental optimization', 'network optimization', 'complexity']"
17008,0705.2235,Tshilidzi Marwala,"S. Chakraverty, T. Marwala, Pallavi Gupta and Thando Tettey","Response Prediction of Structural System Subject to Earthquake Motions
  using Artificial Neural Network",18 pages,,,,cs.AI,,"  This paper uses Artificial Neural Network (ANN) models to compute response of
structural system subject to Indian earthquakes at Chamoli and Uttarkashi
ground motion data. The system is first trained for a single real earthquake
data. The trained ANN architecture is then used to simulate earthquakes with
various intensities and it was found that the predicted responses given by ANN
model are accurate for practical purposes. When the ANN is trained by a part of
the ground motion data, it can also identify the responses of the structural
system well. In this way the safeness of the structural systems may be
predicted in case of future earthquakes without waiting for the earthquake to
occur for the lessons. Time period and the corresponding maximum response of
the building for an earthquake has been evaluated, which is again trained to
predict the maximum response of the building at different time periods. The
trained time period versus maximum response ANN model is also tested for real
earthquake data of other place, which was not used in the training and was
found to be in good agreement.
","[{'version': 'v1', 'created': 'Tue, 15 May 2007 20:29:06 GMT'}]",2007-05-23,"[['Chakraverty', 'S.', ''], ['Marwala', 'T.', ''], ['Gupta', 'Pallavi', ''], ['Tettey', 'Thando', '']]","['Earthquake', 'Neural Network', 'Frequency', 'Structure', 'Building']"
17009,0707.2833,Damien Chablat,"Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), Jean-Pierre Merlet
  (INRIA Sophia Antipolis)","A Comparative Study between Two Three-DOF Parallel Kinematic Machines
  using Kinetostatic Criteria and Interval Analysis",,11th World Congress in Mechanism and Machine Science (04/2004) 1-6,,,cs.RO,,"  This paper addresses the workspace analysis of two 3-DOF translational
parallel mechanisms designed for machining applications. The two machines
features three fixed linear joints. The joint axes of the first machine are
orthogonal whereas these of the second are parallel. In both cases, the mobile
platform moves in the Cartesian $x-y-z$ space with fixed orientation. The
workspace analysis is conducted on the basis of prescribed kinetostatic
performances. Interval analysis based methods are used to compute the dextrous
workspace and the largest cube enclosed in this workspace.
","[{'version': 'v1', 'created': 'Thu, 19 Jul 2007 04:44:06 GMT'}]",2007-07-20,"[['Chablat', 'Damien', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN'], ['Merlet', 'Jean-Pierre', '', 'INRIA Sophia Antipolis']]","['Parallel kinematic architecture', 'Singularity', 'Workspace', 'Transmissions factors', 'Stiffness', 'Design', 'Interval analysis']"
17010,1510.00203,Kardi Teknomo,R. Alampay and K. Teknomo,"Data Association for an Adaptive Multi-target Particle Filter Tracking
  System",,"Philippine Computing Journal Vol 7 (1) August 2012, p. 16-25",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel approach to improve the accuracy of tracking
multiple objects in a static scene using a particle filter system by
introducing a data association step, a state queue for the collection of
tracked objects and adaptive parameters to the system. The data association
step makes use of the object detection phase and appearance model to determine
if the approximated targets given by the particle filter step match the given
set of detected objects. The remaining detected objects are used as information
to instantiate new objects for tracking. State queues are also used for each
tracked object to deal with occlusion events and occlusion recovery. Finally we
present how the parameters adjust to occlusion events. The adaptive property of
the system is also used for possible occlusion recovery. Results of the system
are then compared to a ground truth data set for performance evaluation. Our
system produced accurate results and was able to handle partially occluded
objects as well as proper occlusion recovery from tracking multiple objects
","[{'version': 'v1', 'created': 'Thu, 1 Oct 2015 12:40:18 GMT'}]",2015-10-02,"[['Alampay', 'R.', ''], ['Teknomo', 'K.', '']]","['Multi object tracking', 'particle filter', 'data association', 'target hijacking', 'computer vision']"
17011,1409.7228,Virgilio Sison,Dixie F. Falcunit Jr. and Virgilio P. Sison,"Cyclic Codes over the Matrix Ring $M_2(F_p)$ and Their Isometric Images
  over $F_{p^2}+uF_{p^2}$","14 pages, presented at the International Zurich Seminar on
  Communications, Zurich, Switzerland, February 2014",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $F_p$ be the prime field with $p$ elements. We derive the homogeneous
weight on the Frobenius matrix ring $M_2(F_p)$ in terms of the generating
character. We also give a generalization of the Lee weight on the finite chain
ring $F_{p^2}+uF_{p^2}$ where $u^2=0$. A non-commutative ring, denoted by
$\mathcal{F}_{p^2}+\mathbf{v}_p \mathcal{F}_{p^2}$, $\mathbf{v}_p$ an
involution in $M_2(F_p)$, that is isomorphic to $M_2(F_p)$ and is a left
$F_{p^2}$-vector space, is constructed through a unital embedding $\tau$ from
$F_{p^2}$ to $M_2(F_p)$. The elements of $\mathcal{F}_{p^2}$ come from
$M_2(F_p)$ such that $\tau(F_{p^2})=\mathcal{F}_{p^2}$. The irreducible
polynomial $f(x)=x^2+x+(p-1) \in F_p[x]$ required in $\tau$ restricts our study
of cyclic codes over $M_2(F_p)$ endowed with the Bachoc weight to the case
$p\equiv$ $2$ or $3$ mod $5$. The images of these codes via a left $F_p$-module
isometry are additive cyclic codes over $F_{p^2}+uF_{p^2}$ endowed with the Lee
weight. New examples of such codes are given.
","[{'version': 'v1', 'created': 'Thu, 25 Sep 2014 12:35:40 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Jun 2017 12:28:20 GMT'}]",2017-06-30,"[['Falcunit', 'Dixie F.', 'Jr.'], ['Sison', 'Virgilio P.', '']]","['Frobenius matrix ring', 'finite chain ring', 'homogeneous weight', 'cycliccodes']"
17012,1702.06677,George Berry,George Berry and Sean J. Taylor,Discussion quality diffuses in the digital public square,"10 pages, 6 figures, 2 tables",,,,cs.CY cs.CL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Studies of online social influence have demonstrated that friends have
important effects on many types of behavior in a wide variety of settings.
However, we know much less about how influence works among relative strangers
in digital public squares, despite important conversations happening in such
spaces. We present the results of a study on large public Facebook pages where
we randomly used two different methods--most recent and social feedback--to
order comments on posts. We find that the social feedback condition results in
higher quality viewed comments and response comments. After measuring the
average quality of comments written by users before the study, we find that
social feedback has a positive effect on response quality for both low and high
quality commenters. We draw on a theoretical framework of social norms to
explain this empirical result. In order to examine the influence mechanism
further, we measure the similarity between comments viewed and written during
the study, finding that similarity increases for the highest quality
contributors under the social feedback condition. This suggests that, in
addition to norms, some individuals may respond with increased relevance to
high-quality comments.
","[{'version': 'v1', 'created': 'Wed, 22 Feb 2017 04:54:43 GMT'}]",2017-02-23,"[['Berry', 'George', ''], ['Taylor', 'Sean J.', '']]","['Online discussions', 'comment ranking', 'social influence', 'socialnorms']"
17013,1109.1651,Ardhendu Mandal,Ardhendu Mandal,SRS BUILDER 1.0: An Upper Type CASE Tool For Requirement Specification,6 Pages; Proceedings of the 4th National Conference; INDIACom-2010,,,,cs.SE,http://creativecommons.org/licenses/by/3.0/,"  Software (SW) development is a labor intensive activity. Modern software
projects generally have to deal with producing and managing large and complex
software products. Developing such software has become an extremely challenging
job not only because of inherent complexity, but also mainly for economic
constraints unlike time, quality, maintainability concerns. Hence, developing
modern software within the budget still remains as one of the main software
crisis. The most significant way to reduce the software development cost is to
use the Computer-Aided Software Engineering (CASE) tools over the entire
Software Development Life Cycle (SDLC) process as substitute to expensive human
labor cost. We think that automation of software development methods is a
valuable support for the software engineers in coping with this complexity and
for improving quality too. This paper demonstrates the newly developed CASE
tools name ""SRS Builder 1.0"" for software requirement specification developed
at our university laboratory, University of North Bengal, India. This paper
discusses our new developed product with its functionalities and usages. We
believe the tool has the potential to play an important role in the software
development process.
","[{'version': 'v1', 'created': 'Thu, 8 Sep 2011 08:07:58 GMT'}]",2011-09-09,"[['Mandal', 'Ardhendu', '']]","['CASE tool', 'software development', 'SDLC', 'SRS', 'SE', 'FHD.  1']"
17014,0708.4284,Mariano Zelke,Mariano Zelke,Optimal Per-Edge Processing Times in the Semi-Streaming Model,"8 pages, 1 table","Information Processing Letters, Volume 104, Issue 3, 2007, Pages
  106-112",,,cs.DM cs.DS,,"  We present semi-streaming algorithms for basic graph problems that have
optimal per-edge processing times and therefore surpass all previous
semi-streaming algorithms for these tasks. The semi-streaming model, which is
appropriate when dealing with massive graphs, forbids random access to the
input and restricts the memory to O(n*polylog n) bits.
  Particularly, the formerly best per-edge processing times for finding the
connected components and a bipartition are O(alpha(n)), for determining
k-vertex and k-edge connectivity O(k^2n) and O(n*log n) respectively for any
constant k and for computing a minimum spanning forest O(log n). All these time
bounds we reduce to O(1).
  Every presented algorithm determines a solution asymptotically as fast as the
best corresponding algorithm up to date in the classical RAM model, which
therefore cannot convert the advantage of unlimited memory and random access
into superior computing times for these problems.
","[{'version': 'v1', 'created': 'Fri, 31 Aug 2007 07:19:27 GMT'}]",2007-09-03,"[['Zelke', 'Mariano', '']]","['graph algorithms', 'streaming algorithms', 'per-edge processing time']"
17015,1712.03249,Tobias Moers,"Florian Krebs, Bruno Lubascher, Tobias Moers, Pieter Schaap, Gerasimos
  Spanakis",Social Emotion Mining Techniques for Facebook Posts Reaction Prediction,"10 pages, 13 figures and accepted at ICAART 2018. (Dataset:
  https://github.com/jerryspan/FacebookR)",,,,cs.AI cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As of February 2016 Facebook allows users to express their experienced
emotions about a post by using five so-called `reactions'. This research paper
proposes and evaluates alternative methods for predicting these reactions to
user posts on public pages of firms/companies (like supermarket chains). For
this purpose, we collected posts (and their reactions) from Facebook pages of
large supermarket chains and constructed a dataset which is available for other
researches. In order to predict the distribution of reactions of a new post,
neural network architectures (convolutional and recurrent neural networks) were
tested using pretrained word embeddings. Results of the neural networks were
improved by introducing a bootstrapping approach for sentiment and emotion
mining on the comments for each post. The final model (a combination of neural
network and a baseline emotion miner) is able to predict the reaction
distribution on Facebook posts with a mean squared error (or misclassification
rate) of 0.135.
","[{'version': 'v1', 'created': 'Fri, 8 Dec 2017 19:05:50 GMT'}]",2017-12-12,"[['Krebs', 'Florian', ''], ['Lubascher', 'Bruno', ''], ['Moers', 'Tobias', ''], ['Schaap', 'Pieter', ''], ['Spanakis', 'Gerasimos', '']]","['Emotion mining', 'Social media', 'Deep Learning', 'Natural Language Processing']"
17016,1111.2948,Marcos Domingues,"Marcos A. Domingues, Alipio Mario Jorge, Carlos Soares","Using Contextual Information as Virtual Items on Top-N Recommender
  Systems","Workshop on Context-Aware Recommender Systems (CARS'09) in
  conjunction with the 3rd ACM Conference on Recommender Systems (RecSys'09)",,,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditionally, recommender systems for the Web deal with applications that
have two dimensions, users and items. Based on access logs that relate these
dimensions, a recommendation model can be built and used to identify a set of N
items that will be of interest to a certain user. In this paper we propose a
method to complement the information in the access logs with contextual
information without changing the recommendation algorithm. The method consists
in representing context as virtual items. We empirically test this method with
two top-N recommender systems, an item-based collaborative filtering technique
and association rules, on three data sets. The results show that our method is
able to take advantage of the context (new dimensions) when it is informative.
","[{'version': 'v1', 'created': 'Sat, 12 Nov 2011 17:53:10 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Nov 2011 10:20:57 GMT'}]",2011-11-16,"[['Domingues', 'Marcos A.', ''], ['Jorge', 'Alipio Mario', ''], ['Soares', 'Carlos', '']]","['Context', 'Multidimensional data', 'Recommender system']"
17017,1610.04834,Mohsen Ghafoorian,"Mohsen Ghafoorian, Nico Karssemeijer, Tom Heskes, Inge van Uden, Clara
  Sanchez, Geert Litjens, Frank-Erik de Leeuw, Bram van Ginneken, Elena
  Marchiori and Bram Platel","Location Sensitive Deep Convolutional Neural Networks for Segmentation
  of White Matter Hyperintensities","13 pages, 8 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The anatomical location of imaging features is of crucial importance for
accurate diagnosis in many medical tasks. Convolutional neural networks (CNN)
have had huge successes in computer vision, but they lack the natural ability
to incorporate the anatomical location in their decision making process,
hindering success in some medical image analysis tasks.
  In this paper, to integrate the anatomical location information into the
network, we propose several deep CNN architectures that consider multi-scale
patches or take explicit location features while training. We apply and compare
the proposed architectures for segmentation of white matter hyperintensities in
brain MR images on a large dataset. As a result, we observe that the CNNs that
incorporate location information substantially outperform a conventional
segmentation method with hand-crafted features as well as CNNs that do not
integrate location information. On a test set of 46 scans, the best
configuration of our networks obtained a Dice score of 0.791, compared to 0.797
for an independent human observer. Performance levels of the machine and the
independent human observer were not statistically significantly different
(p-value=0.17).
","[{'version': 'v1', 'created': 'Sun, 16 Oct 2016 09:35:36 GMT'}, {'version': 'v2', 'created': 'Sat, 29 Oct 2016 15:10:46 GMT'}]",2016-11-01,"[['Ghafoorian', 'Mohsen', ''], ['Karssemeijer', 'Nico', ''], ['Heskes', 'Tom', ''], ['van Uden', 'Inge', ''], ['Sanchez', 'Clara', ''], ['Litjens', 'Geert', ''], ['de Leeuw', 'Frank-Erik', ''], ['van Ginneken', 'Bram', ''], ['Marchiori', 'Elena', ''], ['Platel', 'Bram', '']]","['white matter hyperintensities', 'white matter lesions', 'small vessel disease', 'automated segmentation', 'deeplearning', 'convolutional neural networks']"
17018,1704.02441,Glen Rodriguez Dr.Eng.,"Danny Velasco, Glen Rodriguez",Ontologies for Network Security and Future Challenges,"12th International Conference on Cyber Warfare and Security - ICCWS
  2017, At Dayton, USA","Proceedings of the 12th International Conference on Cyber Warfare
  and Security - ICCWS 2017, pp.541-547",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efforts have been recently made to construct ontologies for network security.
The proposed ontologies are related to specific aspects of network security.
Therefore, it is necessary to identify the specific aspects covered by existing
ontologies for network security. A review and analysis of the principal issues,
challenges, and the extent of progress related to distinct ontologies was
performed. Each example was classified according to the typology of the
ontologies for network security. Some aspects include identifying threats,
intrusion detection systems (IDS), alerts, attacks, countermeasures, security
policies, and network management tools. The research performed here proposes
the use of three stages: 1. Inputs; 2. Processing; and 3. Outputs. The analysis
resulted in the introduction of new challenges and aspects that may be used as
the basis for future research. One major issue that was discovered identifies
the need to develop new ontologies that relate to distinct aspects of network
security, thereby facilitating management tasks.
","[{'version': 'v1', 'created': 'Sat, 8 Apr 2017 05:09:01 GMT'}]",2017-04-11,"[['Velasco', 'Danny', ''], ['Rodriguez', 'Glen', '']]","['ontology', 'network security', 'network management', 'network monitoring', 'ontology network security']"
17019,0805.0200,Joel Goossens,"Jo\""el Goossens","(m,k)-firm constraints and DBP scheduling: impact of the initial
  k-sequence and exact schedulability test",,,,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we study the scheduling of (m,k)-firm synchronous periodic task
systems using the Distance Based Priority (DBP) scheduler. We first show three
phenomena: (i) choosing, for each task, the initial k-sequence 1^k is not
optimal, (ii) we can even start the scheduling from a (fictive) error state (in
regard to the initial k-sequence) and (iii) the period of feasible
DBP-schedules is not necessarily the task hyper-period. We then show that any
feasible DBP-schedule is periodic and we upper-bound the length of that period.
Lastly, based on our periodicity result we provide an exact schedulability
test.
","[{'version': 'v1', 'created': 'Fri, 2 May 2008 09:32:03 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Sep 2008 09:22:24 GMT'}]",2008-09-08,"[['Goossens', 'Joël', '']]","['(m', 'k)–firm constraints', 'real-time scheduling', 'uniprocessor', 'periodic tasks', 'nonpreemptive tasks']"
17020,1003.5447,Andrew Gacek,Andrew Gacek,Relating Nominal and Higher-order Abstract Syntax Specifications,To appear in PPDP 2010,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nominal abstract syntax and higher-order abstract syntax provide a means for
describing binding structure which is higher-level than traditional techniques.
These approaches have spawned two different communities which have developed
along similar lines but with subtle differences that make them difficult to
relate. The nominal abstract syntax community has devices like names,
freshness, name-abstractions with variable capture, and the new-quantifier,
whereas the higher-order abstract syntax community has devices like
lambda-binders, lambda-conversion, raising, and the nabla-quantifier. This
paper aims to unify these communities and provide a concrete correspondence
between their different devices. In particular, we develop a
semantics-preserving translation from alpha-Prolog, a nominal abstract syntax
based logic programming language, to G-, a higher-order abstract syntax based
logic programming language. We also discuss higher-order judgments, a common
and powerful tool for specifications with higher-order abstract syntax, and we
show how these can be incorporated into G-. This establishes G- as a language
with the power of higher-order abstract syntax, the fine-grained variable
control of nominal specifications, and the desirable properties of higher-order
judgments.
","[{'version': 'v1', 'created': 'Mon, 29 Mar 2010 07:54:09 GMT'}, {'version': 'v2', 'created': 'Fri, 14 May 2010 07:22:33 GMT'}]",2010-05-17,"[['Gacek', 'Andrew', '']]","['proof search', 'nominal logic', 'higher-order abstract syntax']"
17021,1111.6860,R\'emi Diana,R\'emi Diana and Emmanuel Lochin,"Modelling the Delay Distribution of Binary Spray and Wait Routing
  Protocol",Accepted for publication. AOC 2012,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article proposes a stochastic model to obtain the end-to-end delay law
between two nodes of a Delay Tolerant Network (DTN). We focus on the commonly
used Binary Spray and Wait (BSW) routing protocol and propose a model that can
be applied to homogeneous or heterogeneous networks (i.e. when the
inter-contact law parameter takes one or several values). To the best of our
knowledge, this is the first model allowing to estimate the delay distribution
of Binary Spray and Wait DTN protocol in heterogeneous networks. We first
detail the model and propose a set of simulations to validate the theoretical
results.
","[{'version': 'v1', 'created': 'Tue, 29 Nov 2011 15:46:10 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Apr 2012 12:20:58 GMT'}]",2012-04-16,"[['Diana', 'Rémi', ''], ['Lochin', 'Emmanuel', '']]","['DTN routing', 'modelling', 'binary spray and wait']"
17022,1402.7341,Brijesh Mehta,"Brijesh B. Mehta, Udai Pratap Rao",A Novel approach as Multi-place Watermarking for Security in Database,"5 pages, 3 figures, Int'l Conf. Security and Management, SAM'11",,,,cs.DB cs.CR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Digital multimedia watermarking technology had suggested in the last decade
to embed copyright information in digital objects such as images, audio and
video. However, the increasing use of relational database systems in many
real-life applications created an ever-increasing need for watermarking
database systems. As a result, watermarking relational database system is now
emerging as a research area that deals with the legal issue of copyright
protection of database systems. The main goal of database watermarking is to
generate robust and impersistent watermark for database. In this paper we
propose a method, based on image as watermark and this watermark is embedded
over the database at two different attribute of tuple, one in the numeric
attribute of tuple and another in the date attribute's time (seconds) field.
Our approach can be applied for numerical and categorical database.
","[{'version': 'v1', 'created': 'Fri, 28 Feb 2014 18:43:29 GMT'}]",2014-03-03,"[['Mehta', 'Brijesh B.', ''], ['Rao', 'Udai Pratap', '']]","['DatabaseSecurity', 'DatabaseWatermarking', 'Multi-place Watermarking']"
17023,1710.01367,Antonio Roque,Antonio Roque,"Validating Computer Security Methods: Meta-methodology for an
  Adversarial Science","v3: wording changes, clarification of figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  How can we justify the validity of our computer security methods? This
meta-methodological question is related to recent explorations on the science
of computer security, which have been hindered by computer security's unique
properties. We confront this by developing a taxonomy of properties and
methods. Interdisciplinary foundations provide a solid grounding for a set of
essential concepts, including a decision tree for characterizing adversarial
interaction. Several types of invalidation and general ways of addressing them
are described for technical methods. An interdisciplinary argument from theory
explains the role that meta-methodological validation plays in the adversarial
science of computer security.
","[{'version': 'v1', 'created': 'Tue, 3 Oct 2017 20:04:33 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Oct 2017 17:09:36 GMT'}, {'version': 'v3', 'created': 'Mon, 22 Jan 2018 16:47:33 GMT'}]",2018-01-23,"[['Roque', 'Antonio', '']]","['Foundations of cyber security', 'methodology', 'adversarial humanbehavior']"
17024,1109.2696,Quentin Godfroy,"Cyril Gavoille (LaBRI, INRIA Bordeaux - Sud-Ouest, IUF), Quentin
  Godfroy (LaBRI), Laurent Viennot (INRIA Rocquencourt)","Node-Disjoint Multipath Spanners and their Relationship with
  Fault-Tolerant Spanners",,,,,cs.NI cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by multipath routing, we introduce a multi-connected variant of
spanners. For that purpose we introduce the $p$-multipath cost between two
nodes $u$ and $v$ as the minimum weight of a collection of $p$ internally
vertex-disjoint paths between $u$ and $v$. Given a weighted graph $G$, a
subgraph $H$ is a $p$-multipath $s$-spanner if for all $u,v$, the $p$-multipath
cost between $u$ and $v$ in $H$ is at most $s$ times the $p$-multipath cost in
$G$. The $s$ factor is called the stretch. Building upon recent results on
fault-tolerant spanners, we show how to build $p$-multipath spanners of
constant stretch and of $\tO(n^{1+1/k})$ edges, for fixed parameters $p$ and
$k$, $n$ being the number of nodes of the graph. Such spanners can be
constructed by a distributed algorithm running in $O(k)$ rounds. Additionally,
we give an improved construction for the case $p=k=2$. Our spanner $H$ has
$O(n^{3/2})$ edges and the $p$-multipath cost in $H$ between any two node is at
most twice the corresponding one in $G$ plus $O(W)$, $W$ being the maximum edge
weight.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2011 07:43:17 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Sep 2011 19:30:51 GMT'}]",2011-09-19,"[['Gavoille', 'Cyril', '', 'LaBRI, INRIA Bordeaux - Sud-Ouest, IUF'], ['Godfroy', 'Quentin', '', 'LaBRI'], ['Viennot', 'Laurent', '', 'INRIA Rocquencourt']]","['distributed graph algorithm', 'spanner', 'multipath routing']"
17025,1507.00955,Olga Kolchyna,"Olga Kolchyna, Tharsis T. P. Souza, Philip Treleaven, Tomaso Aste","Twitter Sentiment Analysis: Lexicon Method, Machine Learning Method and
  Their Combination","32 pages, 5 figures","Handbook of Sentiment Analysis in Finance. Mitra, G. and Yu, X.
  (Eds.). (2016). ISBN 1910571571",,,cs.CL cs.IR cs.LG stat.ME stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper covers the two approaches for sentiment analysis: i) lexicon based
method; ii) machine learning method. We describe several techniques to
implement these approaches and discuss how they can be adopted for sentiment
classification of Twitter messages. We present a comparative study of different
lexicon combinations and show that enhancing sentiment lexicons with emoticons,
abbreviations and social-media slang expressions increases the accuracy of
lexicon-based classification for Twitter. We discuss the importance of feature
generation and feature selection processes for machine learning sentiment
classification. To quantify the performance of the main sentiment analysis
methods over Twitter we run these algorithms on a benchmark Twitter dataset
from the SemEval-2013 competition, task 2-B. The results show that machine
learning method based on SVM and Naive Bayes classifiers outperforms the
lexicon method. We present a new ensemble method that uses a lexicon based
sentiment score as input feature for the machine learning approach. The
combined method proved to produce more precise classifications. We also show
that employing a cost-sensitive classifier for highly unbalanced datasets
yields an improvement of sentiment classification performance up to 7%.
","[{'version': 'v1', 'created': 'Fri, 3 Jul 2015 15:46:55 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Jul 2015 17:24:18 GMT'}, {'version': 'v3', 'created': 'Fri, 18 Sep 2015 11:44:33 GMT'}]",2019-02-19,"[['Kolchyna', 'Olga', ''], ['Souza', 'Tharsis T. P.', ''], ['Treleaven', 'Philip', ''], ['Aste', 'Tomaso', '']]","['sentiment analysis', 'social media', 'Twitter', 'natural language processing', 'lexicon', 'emoticons']"
17026,1402.0081,Jonathan Heras,J\'onathan Heras and Ekaterina Komendantskaya,Proof Pattern Search in Coq/SSReflect,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  ML4PG is an extension of the Proof General interface, allowing the user to
invoke machine-learning algorithms and find proof similarities in Coq/SSReect
libraries. In this paper, we present three new improvements to ML4PG. First, a
new method of ""recurrent clustering"" is introduced to collect statistical
features from Coq terms. Now the user can receive suggestions about similar
definitions, types and lemma statements, in addition to proof strategies.
Second, Coq proofs are split into patches to capture proof strategies that
could arise at different stages of a proof. Finally, we improve ML4PG's output
introducing an automaton-shape representation for proof patterns.
","[{'version': 'v1', 'created': 'Sat, 1 Feb 2014 11:52:38 GMT'}]",2014-02-04,"[['Heras', 'Jónathan', ''], ['Komendantskaya', 'Ekaterina', '']]","['Coq/SSReflect', 'Proof-Patterns', 'Recurrent Clustering', 'Pattern Recognition', 'Feature Extraction']"
17027,0711.0128,Manoj Kumar,Manoj Kumar,"Security Analysis of a Remote User Authentication Scheme with Smart
  Cards",,,,,cs.CR,,"  Yoon et al. proposed a new efficient remote user authentication scheme using
smart cards to solve the security problems of W. C. Ku and S. M. Chen scheme.
This paper reviews Yoon et al. scheme and then proves that the password change
phase of Yoon et al. scheme is still insecure. This paper also proves that the
Yoon et al. is still vulnerable to parallel session attack.
","[{'version': 'v1', 'created': 'Thu, 1 Nov 2007 14:24:41 GMT'}]",2007-11-02,"[['Kumar', 'Manoj', '']]","['Cryptography', 'Cryptanalysis', 'Network security', 'Authentication', 'Smart cards', 'Password', 'Parallel session attack']"
17028,1406.3727,Jubair Basha N Md,"N.Md Jubair Basha, Chandra Mohan",A methodology to identify the level of reuse using template factors,"arXiv admin note: text overlap with arXiv:1203.1328, arXiv:1207.4938,
  arXiv:1202.5609",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To build large scale software systems, Component Based Software Engineering
(CBSE) has played a vital role. The current practices of software industry
demands more development of a software within time and budget which is highly
productive to them. It became so necessary to achieve how effectively the
software component is reusable. In order to meet this, the component level
reuse, in terms of both class and method level can be possibly done. The
traditional approaches are presented in the literature upto the level of extent
of achievement of reuse. Any how still effective reuse is a challenging issue
as a part. In this paper, a methodology has proposed for the identification of
reuse level which has been considered by the using reuse metrics such as the
Class Template Factor(CTF) and Method Template Factor(MTF). By considering
these measures makes easy to identify the level of reuse so that helps in the
growth the productivity in the organization.
","[{'version': 'v1', 'created': 'Sat, 14 Jun 2014 13:26:39 GMT'}]",2014-06-17,"[['Basha', 'N. Md Jubair', ''], ['Mohan', 'Chandra', '']]","['Reuse', 'Domain Engineering', 'class', 'method', 'metric']"
17029,1802.06464,Tat-Jun Chin Dr,Tat-Jun Chin and Zhipeng Cai and Frank Neumann,Robust Fitting in Computer Vision: Easy or Hard?,,"European Conference on Computer Vision (ECCV), 2018",,,cs.CV cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robust model fitting plays a vital role in computer vision, and research into
algorithms for robust fitting continues to be active. Arguably the most popular
paradigm for robust fitting in computer vision is consensus maximisation, which
strives to find the model parameters that maximise the number of inliers.
Despite the significant developments in algorithms for consensus maximisation,
there has been a lack of fundamental analysis of the problem in the computer
vision literature. In particular, whether consensus maximisation is ""tractable""
remains a question that has not been rigorously dealt with, thus making it
difficult to assess and compare the performance of proposed algorithms,
relative to what is theoretically achievable. To shed light on these issues, we
present several computational hardness results for consensus maximisation. Our
results underline the fundamental intractability of the problem, and resolve
several ambiguities existing in the literature.
","[{'version': 'v1', 'created': 'Sun, 18 Feb 2018 22:54:50 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Mar 2018 00:52:02 GMT'}, {'version': 'v3', 'created': 'Mon, 23 Jul 2018 05:42:28 GMT'}]",2019-07-11,"[['Chin', 'Tat-Jun', ''], ['Cai', 'Zhipeng', ''], ['Neumann', 'Frank', '']]","['Robust fitting', 'consensus maximisation', 'inlier set maximisation', 'computational hardness']"
17030,1704.06569,Caiyun Huang,"Caiyun Huang, Peng Zhang, Junpeng Liu, Yong Sun, Xueqiang Zou","SFCSD: A Self-Feedback Correction System for DNS Based on Active and
  Passive Measurement","7 pages, 3 figures, 7 tables, submitted to GlobeCOM 2017",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Domain Name System (DNS), one of the important infrastructure in the
Internet, was vulnerable to attacks, for the DNS designer didn't take security
issues into consideration at the beginning. The defects of DNS may lead to
users' failure of access to the websites, what's worse, users might suffer a
huge economic loss.
  In order to correct the DNS wrong resource records, we propose a
Self-Feedback Correction System for DNS (SFCSD), which can find and track a
large number of common websites' domain name and IP address correct
correspondences to provide users with a real-time auto-updated correct (IP,
Domain) binary tuple list. By matching specific strings with SSL, DNS and HTTP
traffic passively, filtering with the CDN CNAME and non-homepage URL feature
strings, verifying with webpage fingerprint algorithm, SFCSD obtains a large
number of highly possibly correct IP addresses to make an active manual
correction in the end. Its self-feedback mechanism can expand search range and
improve performance.
  Experiments show that, SFCSD can achieve 94.3% precision and 93.07% recall
rate with the optimal threshold selection in the test dataset. It has 8Gbps
processing speed stand-alone to find almost 1000 possibly correct (IP, Domain)
per day for the each specific string and to correct almost 200.
","[{'version': 'v1', 'created': 'Fri, 21 Apr 2017 14:41:10 GMT'}]",2017-04-24,"[['Huang', 'Caiyun', ''], ['Zhang', 'Peng', ''], ['Liu', 'Junpeng', ''], ['Sun', 'Yong', ''], ['Zou', 'Xueqiang', '']]","['DNS', 'Self-feedback', 'Active and Passive Measurement']"
17031,2007.05163,Leonard Poon,Leonard K. M. Poon and Nevin L. Zhang and Haoran Xie and Gary Cheng,"Handling Collocations in Hierarchical Latent Tree Analysis for Topic
  Modeling",,,,,cs.CL cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Topic modeling has been one of the most active research areas in machine
learning in recent years. Hierarchical latent tree analysis (HLTA) has been
recently proposed for hierarchical topic modeling and has shown superior
performance over state-of-the-art methods. However, the models used in HLTA
have a tree structure and cannot represent the different meanings of multiword
expressions sharing the same word appropriately. Therefore, we propose a method
for extracting and selecting collocations as a preprocessing step for HLTA. The
selected collocations are replaced with single tokens in the bag-of-words model
before running HLTA. Our empirical evaluation shows that the proposed method
led to better performance of HLTA on three of the four data sets tested.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 04:56:36 GMT'}]",2020-07-13,"[['Poon', 'Leonard K. M.', ''], ['Zhang', 'Nevin L.', ''], ['Xie', 'Haoran', ''], ['Cheng', 'Gary', '']]","['Collocations', 'Topic modeling', 'Hierarchical latent tree analysis', 'Latent tree models', 'Document clustering']"
17032,1307.2434,Firouz AL-Wassai,"Firouz A. Al-Wassai, N.V. Kalyankar",Major Limitations of Satellite images,,"Journal of Global Research in Computer Science, 4 (5), May 2013,
  51-59",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Remote sensing has proven to be a powerful tool for the monitoring of the
Earth surface to improve our perception of our surroundings has led to
unprecedented developments in sensor and information technologies. However,
technologies for effective use of the data and for extracting useful
information from the data of Remote sensing are still very limited since no
single sensor combines the optimal spectral, spatial and temporal resolution.
This paper briefly reviews the limitations of satellite remote sensing. Also,
reviews on the problems of image fusion techniques. The conclusion of this,
According to literature, the remote sensing is still the lack of software tools
for effective information extraction from remote sensing data. The trade-off in
spectral and spatial resolution will remain and new advanced data fusion
approaches are needed to make optimal use of remote sensors for extract the
most useful information.
","[{'version': 'v1', 'created': 'Tue, 9 Jul 2013 13:01:46 GMT'}]",2013-07-10,"[['Al-Wassai', 'Firouz A.', ''], ['Kalyankar', 'N. V.', '']]","['Sensor Limitations', 'Remote Sensing', 'Spatial', 'Spectral', 'Resolution', 'Image Fusion']"
17033,1610.06218,Seyed Amir Tafrishi,"Seyed Amir Tafrishi and Sandor M. Veres and Esmaeil Esmaeilzadeh and
  Mikhail Svinin","Dynamical Behavior Investigation and Analysis of Novel Mechanism for
  Simulated Spherical Robot named ""RollRoller""","30 pages, 24 figures, submitted to Mechanism and Machine Theory",,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a simulation study of fluid actuated multi-driven
closed system as spherical mobile robot called ""RollRoller"". Robot's mechanism
design consists of two essential parts: tubes to lead a core and mechanical
controlling parts to correspond movements. Our robot gets its motivation force
by displacing the spherical movable mass known as core in curvy manners inside
certain pipes. This simulation investigates by explaining the mechanical and
structural features of the robot for creating hydraulic-base actuation via
force and momentum analysis. Next, we categorize difficult and integrated 2D
motions to omit unstable equilibrium points through derived nonlinear dynamics.
We propose an algorithmic position control in forward direction that creates
hybrid model as solution for motion planning problem in spherical robot. By
deriving nonlinear dynamics of the spherical robot and implementing designed
motion planning, we show how RollRoller can be efficient in high speed
movements in comparison to the other pendulum-driven models. Then, we validate
the results of this position control obtained by nonlinear dynamics via
Adams/view simulation which uses the imported solid model of RollRoller.
Lastly, We have a look to the circular maneuver of this robot by the same
simulator.
","[{'version': 'v1', 'created': 'Wed, 19 Oct 2016 21:01:28 GMT'}]",2016-10-21,"[['Tafrishi', 'Seyed Amir', ''], ['Veres', 'Sandor M.', ''], ['Esmaeilzadeh', 'Esmaeil', ''], ['Svinin', 'Mikhail', '']]","['Spherical mobile robot', 'mechanism', 'hydraulic actuation', 'nonlinaerdynamics', 'Adams/View simulation', 'instability region']"
17034,1407.3361,Joris van der Hoeven,"David Harvey, Joris van der Hoeven, Gr\'egoire Lecerf",Faster polynomial multiplication over finite fields,,,,,cs.CC cs.SC math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two
polynomials in F_p[X] of degree less than n. For n large compared to p, we
establish the bound M_p(n) = O(n log n 8^(log^* n) log p), where log^* is the
iterated logarithm. This is the first known F\""urer-type complexity bound for
F_p[X], and improves on the previously best known bound M_p(n) = O(n log n log
log n log p).
","[{'version': 'v1', 'created': 'Sat, 12 Jul 2014 07:57:14 GMT'}]",2014-07-15,"[['Harvey', 'David', ''], ['van der Hoeven', 'Joris', ''], ['Lecerf', 'Grégoire', '']]","['Polynomial multiplication', 'nite \x1celd', 'algorithm', 'complexity bound', 'FFT']"
17035,1402.0273,Siti Nurul Mahfuzah Mohamad,"Sazilah Salam, Siti Nurul Mahfuzah Mohamad, Norasiken Bakar, Linda
  Khoo Mei Sui","The Designing of Online Multiple Intelligence Tools for Lecturers at
  Polytechnic","7 pages, 4 figures, 1 table, International Journal of Soft Computing
  and Software Engineering [JSCSE], Vol. 3, No. 3",,,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the designing of Online Multiple Intelligence (MI)
Teaching Tools for Polytechnic lecturers. These teaching tools can assist
lecturers to create their own teaching materials without having any knowledge
of Information Technology (IT) especially in programming. The theory of MI is
used in this paper and this theory postulates that everybody has at least two
or more intelligences. Multiple approaches embedded into a series of activities
via online teaching tools must be implemented in order to achieve effective
teaching and learning in the classroom. The objectives of this paper are to
identify the relationship between the students self-perceived MI and their
academic achievement in Polytechnic, and design online MI tools for teaching at
Polytechnic. This paper also addressed the theoretical framework and MI
teaching activities. The instrument used for this study was Ujian Multiple
Intelligence (UMI). The results showed Polytechnic students have strength in
Interpersonal, Visual-Spatial and Verbal-Linguistic intelligences.
","[{'version': 'v1', 'created': 'Mon, 3 Feb 2014 03:13:49 GMT'}]",2014-02-04,"[['Salam', 'Sazilah', ''], ['Mohamad', 'Siti Nurul Mahfuzah', ''], ['Bakar', 'Norasiken', ''], ['Sui', 'Linda Khoo Mei', '']]","['Multiple Intelligences', 'Online Teaching Tools', 'Interpersonal', 'Visual-Spatial', 'Verbal-Linguistic']"
17036,1301.6972,James McLaughlin,"James McLaughlin, John A. Clark","Using evolutionary computation to create vectorial Boolean functions
  with low differential uniformity and high nonlinearity",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The two most important criteria for vectorial Boolean functions used as
S-boxes in block ciphers are differential uniformity and nonlinearity. Previous
work in this field has focused only on nonlinearity and a different criterion,
autocorrelation. In this paper, we describe the results of experiments in using
simulated annealing, memetic algorithms, and ant colony optimisation to create
vectorial Boolean functions with low differential uniformity.
  Keywords: Metaheuristics, simulated annealing, memetic algorithms, ant colony
optimization, cryptography, Boolean functions, vectorial Boolean functions.
","[{'version': 'v1', 'created': 'Tue, 29 Jan 2013 16:31:18 GMT'}]",2013-01-30,"[['McLaughlin', 'James', ''], ['Clark', 'John A.', '']]","['Metaheuristics', 'simulated annealing', 'memetic algorithms', 'ant colony optimization', 'cryptography', 'Boolean functions', 'vectorial Boolean functions']"
17037,1412.7277,Shiv Ram Dubey,"Shiv Ram Dubey, Anand Singh Jalal","Fusing Color and Texture Cues to Categorize the Fruit Diseases from
  Images",arXiv admin note: substantial text overlap with arXiv:1405.4930,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The economic and production losses in agricultural industry worldwide are due
to the presence of diseases in the several kinds of fruits. In this paper, a
method for the classification of fruit diseases is proposed and experimentally
validated. The image processing based proposed approach is composed of the
following main steps; in the first step K-Means clustering technique is used
for the defect segmentation, in the second step color and textural cues are
extracted and fused from the segmented image, and finally images are classified
into one of the classes by using a Multi-class Support Vector Machine. We have
considered diseases of apple as a test case and evaluated our approach for
three types of apple diseases namely apple scab, apple blotch and apple rot and
normal apples without diseases. Our experimentation points out that the
proposed fusion scheme can significantly support accurate detection and
automatic classification of fruit diseases.
","[{'version': 'v1', 'created': 'Tue, 23 Dec 2014 07:46:03 GMT'}]",2014-12-24,"[['Dubey', 'Shiv Ram', ''], ['Jalal', 'Anand Singh', '']]","['K-Means Clustering', 'Color', 'Texture', 'LBP', 'SVM', 'Feature Fusion']"
17038,1505.00058,David Tian,"Wenhong Tian, GuoZhong Li, Xinyang Wang, Qin Xiong, Yaqiu Jiang",Transforming NP to P: An Approach to Solve NP Complete Problems,10 pages,,,,cs.CC,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  NP complete problem is one of the most challenging issues. The question of
whether all problems in NP are also in P is generally considered one of the
most important open questions in mathematics and theoretical computer science
as it has far-reaching consequences to other problems in mathematics, computer
science, biology, philosophy and cryptography. There are intensive research on
proving `NP not equal to P' and `NP equals to P'. However, none of the `proved'
results is commonly accepted by the research community up to now. In this
paper, instead of proving either one, we aim to provide new perspective:
transforming two typical NP complete problems to exactly solvable P problems in
polynomial time. This approach helps to solve originally NP complete problems
with practical applications. It may shine light on solving other NP complete
problems in similar way.
","[{'version': 'v1', 'created': 'Tue, 28 Apr 2015 18:27:10 GMT'}]",2015-05-04,"[['Tian', 'Wenhong', ''], ['Li', 'GuoZhong', ''], ['Wang', 'Xinyang', ''], ['Xiong', 'Qin', ''], ['Jiang', 'Yaqiu', '']]","['NP complete problems', 'P Problems', 'Transforming NP to P', 'Exact Solution inPolynomial Time']"
17039,1304.3345,Marzieh Parandehgheibi,Marzieh Parandehgheibi,Probabilistic Classification using Fuzzy Support Vector Machines,"6 pages, Proceedings of the 6th INFORMS Workshop on Data Mining and
  Health Informatics (DM-HI 2011)",,,,cs.LG math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In medical applications such as recognizing the type of a tumor as Malignant
or Benign, a wrong diagnosis can be devastating. Methods like Fuzzy Support
Vector Machines (FSVM) try to reduce the effect of misplaced training points by
assigning a lower weight to the outliers. However, there are still uncertain
points which are similar to both classes and assigning a class by the given
information will cause errors. In this paper, we propose a two-phase
classification method which probabilistically assigns the uncertain points to
each of the classes. The proposed method is applied to the Breast Cancer
Wisconsin (Diagnostic) Dataset which consists of 569 instances in 2 classes of
Malignant and Benign. This method assigns certain instances to their
appropriate classes with probability of one, and the uncertain instances to
each of the classes with associated probabilities. Therefore, based on the
degree of uncertainty, doctors can suggest further examinations before making
the final diagnosis.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2013 15:44:18 GMT'}]",2013-04-12,"[['Parandehgheibi', 'Marzieh', '']]","['Support Vector Machine(SVM)', 'Fuzzy Classification', 'Training Data', 'Uncertain Points']"
17040,1406.3693,Partha Pratim Ray,Partha Pratim Ray,"Channel Modeling of Human Somatosensory Nanonetwork: Body Discriminative
  Touch and Proprioception Perspective","11 pages, 6 figures","International Journal on Computer Science and Engineering, Vol. 5
  No. 10, pp. 874-884, Oct 2013",,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nanonetwork design and analysis has become a very interesting topic in recent
years. Though this area of research is in its formative stage, it definitely
posses a strong integrity in finding out numerous applications in medical and
allied sciences. Nanonetworking is indeed a nature built foundation which
comprises human intra body communications. Somatosensory system is the one of
the critical and must have systems of human body. This literature concentrates
on the body discriminative touch and proprioception mechanism of somatosensory
system. This particular system is well architecture by medial lemniscal
pathway, in human body for transduction of touch and proprioceptive
information. This paper seeks out the novel communication channel model of
somatosensory system. The working principle of the channel model is established
by an equivalent Moore machine. A novel algorithm MLP is proposed after its
name, medial lemniscal pathway. A novel naomachine and appropriate processing
unit are also devised, based on the automaton.
","[{'version': 'v1', 'created': 'Sat, 14 Jun 2014 07:04:30 GMT'}]",2014-06-17,"[['Ray', 'Partha Pratim', '']]","['Nanonetwork', 'naomachine', 'somatosensory system', 'medial lemniscal pathway', 'moore machine', 'finite state automata', 'nanotechnlogy']"
17041,0909.3786,Damien Chablat,"Anatoly Pashkevich (IRCCyN), Damien Chablat (IRCCyN), Philippe Wenger
  (IRCCyN)","Kinematic calibration of Orthoglide-type mechanisms from observation of
  parallel leg motions",,"Mechatronics 19, 4 (2009) 478-488",,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper proposes a new calibration method for parallel manipulators that
allows efficient identification of the joint offsets using observations of the
manipulator leg parallelism with respect to the base surface. The method
employs a simple and low-cost measuring system, which evaluates deviation of
the leg location during motions that are assumed to preserve the leg
parallelism for the nominal values of the manipulator parameters. Using the
measured deviations, the developed algorithm estimates the joint offsets that
are treated as the most essential parameters to be identified. The validity of
the proposed calibration method and efficiency of the developed numerical
algorithms are confirmed by experimental results. The sensitivity of the
measurement methods and the calibration accuracy are also studied.
","[{'version': 'v1', 'created': 'Mon, 21 Sep 2009 14:15:09 GMT'}]",2009-09-22,"[['Pashkevich', 'Anatoly', '', 'IRCCyN'], ['Chablat', 'Damien', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN']]","['parallel robots', 'kinematic calibration', 'model identification', 'joint offsets', 'error compensation']"
17042,1212.0640,Sasanka Roy,Ritankar Mandal and Anirban Ghosh and Sasanka Roy and Subhas C. Nandy,"Greedy is good: An experimental study on minimum clique cover and
  maximum independent set problems for randomly generated rectangles",,,,,cs.CG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a set ${\cal R}=\{R_1,R_2,..., R_n\}$ of $n$ randomly positioned axis
parallel rectangles in 2D, the problem of computing the minimum clique cover
(MCC) and maximum independent set (MIS) for the intersection graph $G({\cal
R})$ of the members in $\cal R$ are both computationally hard \cite{CC05}. For
the MCC problem, it is proved that polynomial time constant factor
approximation is impossible to obtain \cite{PT11}. Though such a result is not
proved yet for the MIS problem, no polynomial time constant factor
approximation algorithm exists in the literature. We study the performance of
greedy algorithms for computing these two parameters of $G({\cal R})$.
Experimental results shows that for each of the MCC and MIS problems, the
corresponding greedy algorithm produces a solution that is very close to its
optimum solution. Scheinerman \cite{Scheinerman80} showed that the size of MIS
is tightly bounded by $\sqrt{n}$ for a random instance of the 1D version of the
problem, (i.e., for the interval graph). Our experiment shows that the size of
independent set and the clique cover produced by the greedy algorithm is at
least $2\sqrt{n}$ and at most $3\sqrt{n}$, respectively. Thus the
experimentally obtained approximation ratio of the greedy algorithm for MIS
problem is at most 3/2 and the same for the MCC problem is at least 2/3.
Finally we will provide refined greedy algorithms based on a concept of {\it
simplicial rectangle}. The characteristics of this algorithm may be of interest
in getting a provably constant factor approximation algorithm for random
instance of both the problems. We believe that the result also holds true for
any finite dimension.
","[{'version': 'v1', 'created': 'Tue, 4 Dec 2012 08:50:27 GMT'}]",2012-12-05,"[['Mandal', 'Ritankar', ''], ['Ghosh', 'Anirban', ''], ['Roy', 'Sasanka', ''], ['Nandy', 'Subhas C.', '']]","['Minimum clique cover', 'maximum independent set', 'rectangle intersection graph', 'approximation algorithm', 'empirical study']"
17043,1209.6337,Mohammad Eftekhari,"Mohammad Eftekhari (LAMFA), Herish Abdullah","Cryptanalysis and Improvements on Some Graph-based Authentication
  Schemes",,"cryptanalysis and improvements on some graph-based authentication
  schemes (2012) 7",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 2010, Grigoriev and Shpilrain, introduced some graph-based authentication
schemes. We present a cryptanalysis of some of these protocols, and introduce
some new schemes to fix the problems.
","[{'version': 'v1', 'created': 'Thu, 27 Sep 2012 19:27:26 GMT'}]",2012-09-28,"[['Eftekhari', 'Mohammad', '', 'LAMFA'], ['Abdullah', 'Herish', '']]","['Authentication', 'cryptanalysis', 'NP-complete problems in graph theory']"
17044,1704.01672,Fei Chen,"Fei Chen, Sofie Haesaert, Alessandro Abate, Siep Weiland","Control refinement for discrete-time descriptor systems: a behavioural
  approach via simulation relations","8 pages, 3 figures",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The analysis of industrial processes, modelled as descriptor systems, is
often computationally hard due to the presence of both algebraic couplings and
difference equations of high order. In this paper, we introduce a control
refinement notion for these descriptor systems that enables analysis and
control design over related reduced-order systems. Utilising the behavioural
framework, we extend upon the standard hierarchical control refinement for
ordinary systems and allow for algebraic couplings inherent to descriptor
systems.
","[{'version': 'v1', 'created': 'Thu, 6 Apr 2017 00:18:16 GMT'}]",2017-04-07,"[['Chen', 'Fei', ''], ['Haesaert', 'Sofie', ''], ['Abate', 'Alessandro', ''], ['Weiland', 'Siep', '']]","['Descriptor systems', 'simulation relations', 'control refinement', 'behavioural theory']"
17045,1704.06920,Lu-Xing Yang,"Pengdeng Li, Xiaofan Yang, Lu-Xing Yang, Qingyu Xiong, Yingbo Wu, Yuan
  Yan Tang","Maximizing the overall profit of a word-of-mouth marketing campaign: A
  modeling study",,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As compared to the traditional advertising, the word-of-mouth (WOM)
communications have striking advantages such as significantly lower cost and
rapid delivery; this is especially the case with the popularity of online
social networks. This paper addresses the issue of maximizing the overall
profit of a WOM marketing campaign. A marketing process with both positive and
negative WOM is modeled as a dynamical model knwn as the SIPNS model, and the
profit maximization problem is modeled as a constrained optimization problem.
The influence of different factors on the dynamics of the SIPNS model is
revealed experimentally. Also, the impact of different factors on the expected
overall profit of a WOM marketing campaign is uncovered experimentally. On this
basis, some promotion strategies are suggested. To our knowledge, this is the
first time a WOM marketing campaign is treated this way.
","[{'version': 'v1', 'created': 'Sun, 23 Apr 2017 13:22:41 GMT'}]",2017-04-25,"[['Li', 'Pengdeng', ''], ['Yang', 'Xiaofan', ''], ['Yang', 'Lu-Xing', ''], ['Xiong', 'Qingyu', ''], ['Wu', 'Yingbo', ''], ['Tang', 'Yuan Yan', '']]","['word-of-mouth', 'marketing campaign', 'overall profit', 'dynamical model', 'constrained optimization']"
17046,1110.1701,Shaik Rasool,"Shaik Rasool, G. Sridhar, K. Hemanth Kumar, P. Ravi Kumar",Enhanced Secure Algorithm for Message Communion,,"International Journal of Network Security & Its Applications
  (IJNSA), Vol.3, No.5, Sep 2011",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper puts forward a safe mechanism of data transmission to tackle the
security problem of information which is transmitted in Internet. The
encryption standards such as DES (Data Encryption Standard), AES (Advanced
Encryption Standard) and EES (Escrowed Encryption Standard) are widely used to
solve the problem of communication over an insecure channel. With advanced
technologies in computer hardware and software, these standards seem not to be
as secure and fast as one would like. In this paper we propose a encryption
technique which provides security to both the message and the secret key
achieving confidentiality and authentication. The Symmetric algorithm used has
two advantages over traditional schemes. First, the encryption and decryption
procedures are much simpler, and consequently, much faster. Second, the
security level is higher due to the inherent poly-alphabetic nature of the
substitution mapping method used here, together with the translation and
transposition operations performed in the algorithm. Asymmetric algorithm RSA
is worldwide known for its high security. In this paper a detailed report of
the process is presented and analysis is done comparing our proposed technique
with familiar techniques
","[{'version': 'v1', 'created': 'Sat, 8 Oct 2011 06:05:44 GMT'}]",2011-10-11,"[['Rasool', 'Shaik', ''], ['Sridhar', 'G.', ''], ['Kumar', 'K. Hemanth', ''], ['Kumar', 'P. Ravi', '']]","['Cipher text', 'Encryption', 'Decryption', 'Substitution', 'Translation']"
17047,1502.06133,Swapnil Dhamal,"Swapnil Dhamal, Prabuchandran K. J., Y. Narahari","A Multi-phase Approach for Improving Information Diffusion in Social
  Networks","To appear in Proceedings of The 14th International Conference on
  Autonomous Agents & Multiagent Systems (AAMAS), 2015",,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For maximizing influence spread in a social network, given a certain budget
on the number of seed nodes, we investigate the effects of selecting and
activating the seed nodes in multiple phases. In particular, we formulate an
appropriate objective function for two-phase influence maximization under the
independent cascade model, investigate its properties, and propose algorithms
for determining the seed nodes in the two phases. We also study the problem of
determining an optimal budget-split and delay between the two phases.
","[{'version': 'v1', 'created': 'Sat, 21 Feb 2015 19:20:08 GMT'}]",2015-02-24,"[['Dhamal', 'Swapnil', ''], ['J.', 'Prabuchandran K.', ''], ['Narahari', 'Y.', '']]","['Social Networks', 'Viral Marketing', 'Information Diffusion', 'Influence Maximization', 'Independent Cascade Model', 'Cross Entropy Method']"
17048,0803.3455,Marc Lelarge,Marc Lelarge and Jean Bolot,A Local Mean Field Analysis of Security Investments in Networks,Proofs added,,,,cs.GT cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Getting agents in the Internet, and in networks in general, to invest in and
deploy security features and protocols is a challenge, in particular because of
economic reasons arising from the presence of network externalities. Our goal
in this paper is to carefully model and quantify the impact of such
externalities on the investment in, and deployment of, security features and
protocols in a network.
  Specifically, we study a network of interconnected agents, which are subject
to epidemic risks such as those caused by propagating viruses and worms, and
which can decide whether or not to invest some amount to self-protect and
deploy security solutions. We make three contributions in the paper. First, we
introduce a general model which combines an epidemic propagation model with an
economic model for agents which captures network effects and externalities.
Second, borrowing ideas and techniques used in statistical physics, we
introduce a Local Mean Field (LMF) model, which extends the standard mean-field
approximation to take into account the correlation structure on local
neighborhoods. Third, we solve the LMF model in a network with externalities,
and we derive analytic solutions for sparse random graphs, for which we obtain
asymptotic results. We explicitly identify the impact of network externalities
on the decision to invest in and deploy security features. In other words, we
identify both the economic and network properties that determine the adoption
of security technologies.
","[{'version': 'v1', 'created': 'Tue, 25 Mar 2008 18:29:17 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Jun 2008 09:59:52 GMT'}]",2008-06-19,"[['Lelarge', 'Marc', ''], ['Bolot', 'Jean', '']]","['Security', 'Game Theory', 'Epidemics', 'Economics', 'Price of An']"
17049,1802.06451,Shuang Ma,"Shuang Ma, Chang Wen Chen","D-Sempre: Learning Deep Semantic-Preserving Embeddings for User
  interests-Social Contents Modeling",ACM Multimedia,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Exponential growth of social media consumption demands effective user
interests-social contents modeling for more personalized recommendation and
social media summarization. However, due to the heterogeneous nature of social
contents, traditional approaches lack the ability of capturing the hidden
semantic correlations across these multi-modal data, which leads to semantic
gaps between social content understanding and user interests. To effectively
bridge the semantic gaps, we propose a novel deep learning framework for user
interests-social contents modeling. We first mine and parse data, i.e. textual
content, visual content, social context and social relation, from heterogeneous
social media feeds. Then, we design a two-branch network to map the social
contents and users into a same latent space. Particularly, the network is
trained by a large margin objective that combines a cross-instance distance
constraint with a within-instance semantic-preserving constraint in an end-to-
end manner. At last, a Deep Semantic-Preserving Embedding (D-Sempre) is
learned, and the ranking results can be given by calculating distances between
social contents and users. To demonstrate the effectiveness of D-Sempre in user
interests-social contents modeling, we construct a Twitter dataset and conduct
extensive experiments on it. As a result, D-Sempre effectively integrates the
multi-modal data from heterogeneous social media feeds and captures the hidden
semantic correlations between users' interests and social contents.
","[{'version': 'v1', 'created': 'Sun, 18 Feb 2018 21:36:00 GMT'}]",2018-02-20,"[['Ma', 'Shuang', ''], ['Chen', 'Chang Wen', '']]","['Deep Learning', 'Semantic-Preserving Embeddings', 'Social network', 'user interests-social contents modeling']"
17050,0710.1455,Mark Burgin,Mark Burgin,Superrecursive Features of Interactive Computation,,,,,cs.DC cs.PF,,"  Functioning and interaction of distributed devices and concurrent algorithms
are analyzed in the context of the theory of algorithms. Our main concern here
is how and under what conditions algorithmic interactive devices can be more
powerful than the recursive models of computation, such as Turing machines.
Realization of such a higher computing power makes these systems
superrecursive. We find here five sources for superrecursiveness in
interaction. In addition, we prove that when all of these sources are excluded,
the algorithmic interactive system in question is able to perform only
recursive computations. These results provide computer scientists with
necessary and sufficient conditions for achieving superrecursiveness by
algorithmic interactive devices.
","[{'version': 'v1', 'created': 'Mon, 8 Oct 2007 01:56:20 GMT'}]",2007-10-09,"[['Burgin', 'Mark', '']]","['distributed computation', 'concurrent process', 'interaction', 'grid automaton', 'super-recursive algorithm']"
17051,1506.02455,Samy Abbes,Samy Abbes and Jean Mairesse,Uniform generation in trace monoids,Full version of the paper in MFCS 2015 with the same title,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of random uniform generation of traces (the elements
of a free partially commutative monoid) in light of the uniform measure on the
boundary at infinity of the associated monoid. We obtain a product
decomposition of the uniform measure at infinity if the trace monoid has
several irreducible components-a case where other notions such as Parry
measures, are not defined. Random generation algorithms are then examined.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2015 11:54:22 GMT'}]",2015-06-09,"[['Abbes', 'Samy', ''], ['Mairesse', 'Jean', '']]","['trace monoid', 'uniform generation', 'Möbius polynomial']"
17052,1105.1950,Reza Keyvan,"Mahnoosh Kholghi (Department of Electronic, Computer and IT, Islamic
  Azad University, Qazvin Branch, Qazvin, Iran and member of Young Researchers
  Club) and Mohammadreza Keyvanpour (Department of Computer Engineering Alzahra
  University Tehran, Iran)","An analytical framework for data stream mining techniques based on
  challenges and requirements",,"International Journal of Engineering Science and Technology
  (IJEST)Vol. 3 No. 3 Mar 2011",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A growing number of applications that generate massive streams of data need
intelligent data processing and online analysis. Real-time surveillance
systems, telecommunication systems, sensor networks and other dynamic
environments are such examples. The imminent need for turning such data into
useful information and knowledge augments the development of systems,
algorithms and frameworks that address streaming challenges. The storage,
querying and mining of such data sets are highly computationally challenging
tasks. Mining data streams is concerned with extracting knowledge structures
represented in models and patterns in non stopping streams of information.
Generally, two main challenges are designing fast mining methods for data
streams and need to promptly detect changing concepts and data distribution
because of highly dynamic nature of data streams. The goal of this article is
to analyze and classify the application of diverse data mining techniques in
different challenges of data stream mining. In this paper, we present the
theoretical foundations of data stream analysis and propose an analytical
framework for data stream mining techniques.
","[{'version': 'v1', 'created': 'Tue, 10 May 2011 13:58:10 GMT'}]",2011-05-11,"[['Kholghi', 'Mahnoosh', '', 'Department of Electronic, Computer and IT, Islamic\n  Azad University, Qazvin Branch, Qazvin, Iran and member of Young Researchers\n  Club'], ['Keyvanpour', 'Mohammadreza', '', 'Department of Computer Engineering Alzahra\n  University Tehran, Iran']]","['Data Stream', 'Data Stream Mining', 'Stream Preprocessing']"
17053,1610.01397,Abuzer Yakaryilmaz,Mika Hirvensalo and Abuzer Yakary{\i}lmaz,Decision problems on unary probabilistic and quantum automata,14 pages,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is well known that the emptiness problem for binary probabilistic automata
and so for quantum automata is undecidable. We present the current status of
the emptiness problems for unary probabilistic and quantum automata with
connections with Skolem's and positivity problems. We also introduce the
concept of linear recurrence automata in order to show the connection
naturally. Then, we also give possible generalizations of linear recurrence
relations and automata on vectors.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2016 13:06:02 GMT'}]",2016-10-06,"[['Hirvensalo', 'Mika', ''], ['Yakaryılmaz', 'Abuzer', '']]","['emptiness problem', 'unary alphabet', 'probabilistic and quantum automata', 'Skolem’s problem', 'positivity problem']"
17054,0909.0572,Andri Mirzal M.Sc.,Andri Mirzal and Masashi Furukawa,A Method for Accelerating the HITS Algorithm,"10 pages, 3 figures, to be appear in Journal of Advanced
  Computational Intelligence and Intelligent Informatics, Vol. 14 No. 1, 2010",,,,cs.IR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We present a new method to accelerate the HITS algorithm by exploiting
hyperlink structure of the web graph. The proposed algorithm extends the idea
of authority and hub scores from HITS by introducing two diagonal matrices
which contain constants that act as weights to make authority pages more
authoritative and hub pages more hubby. This method works because in the web
graph good authorities are pointed to by good hubs and good hubs point to good
authorities. Consequently, these pages will collect their scores faster under
the proposed algorithm than under the standard HITS. We show that the authority
and hub vectors of the proposed algorithm exist but are not necessarily be
unique, and then give a treatment to ensure the uniqueness property of the
vectors. The experimental results show that the proposed algorithm can improve
HITS computations, especially for back button datasets.
","[{'version': 'v1', 'created': 'Thu, 3 Sep 2009 05:34:35 GMT'}]",2009-09-04,"[['Mirzal', 'Andri', ''], ['Furukawa', 'Masashi', '']]","['acceleration method', 'HITS', 'hyperlink structure', 'power method', 'web graph']"
17055,1401.6536,"Mike M\""uller","Mike M\""uller and Svetlana Puzynina and Micha\""el Rao",Infinite square-free self-shuffling words,,,,,cs.DM cs.FL math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we answer two recent questions from Charlier et al. and Harju
about self-shuffling words. An infinite word $w$ is called self-shuffling, if
$w=\prod_{i=0}^\infty U_iV_i=\prod_{i=0}^\infty U_i=\prod_{i=0}^\infty V_i$ for
some finite words $U_i$, $V_i$. Harju recently asked whether square-free
self-shuffling words exist. We answer this question affirmatively. Besides
that, we build an infinite word such that no word in its shift orbit closure is
self-shuffling, answering positively a question from Charlier et al.
","[{'version': 'v1', 'created': 'Sat, 25 Jan 2014 14:08:39 GMT'}, {'version': 'v2', 'created': 'Sat, 8 Nov 2014 15:08:37 GMT'}]",2014-11-11,"[['Müller', 'Mike', ''], ['Puzynina', 'Svetlana', ''], ['Rao', 'Michaël', '']]","['infinite words', 'shuffling', 'square-free words', 'shift orbit closure', 'selfshuffling words']"
17056,1306.4092,Xiao Lin wang,Xiaolin Wang and Xun Qiu,"Application of particle swarm optimization for enhanced cyclic steam
  stimulation in a offshore heavy oil reservoir","11 pages,6 figures",,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Three different variations of PSO algorithms, i.e. Canonical, Gaussian
Bare-bone and L\'evy Bare-bone PSO, are tested to optimize the ultimate oil
recovery of a large heavy oil reservoir. The performance of these algorithms
was compared in terms of convergence behaviour and the final optimization
results. It is found that, in general, all three types of PSO methods are able
to improve the objective function. The best objective function is found by
using the Canonical PSO, while the other two methods give similar results. The
Gaussian Bare-bone PSO may picks positions that are far away from the optimal
solution. The L\'evy Bare-bone PSO has similar convergence behaviour as the
Canonical PSO. For the specific optimization problem investigated in this
study, it is found that the temperature of the injection steam, CO2 composition
in the injection gas, and the gas injection rates have bigger impact on the
objective function, while steam injection rate and the liquid production rate
have less impact on the objective function.
","[{'version': 'v1', 'created': 'Tue, 18 Jun 2013 07:42:20 GMT'}]",2013-06-19,"[['Wang', 'Xiaolin', ''], ['Qiu', 'Xun', '']]","['Particle Swarm Optimization', 'Gaussian Bare-bone PSO', 'Lévy Bare-bone PSO', 'Reservoir Simulation', 'Steam Stimulation']"
17057,1512.01364,Amelia Carolina Sparavigna,A.C. Sparavigna and R. Marazzato,"Using Google Ngram Viewer for Scientific Referencing and History of
  Science","Keywords: Computers and Society, Literary works, Time-series,
  Referencing",,,,cs.DL cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today, several universal digital libraries exist such as Google Books,
Project Gutenberg, Internet Archive libraries, which possess texts from general
collections, and many other archives are available, concerning more specific
subjects. On the digitalized texts available from these libraries, we can
perform several analyses, from those typically used for time-series to those of
network theory. For what concerns time-series, an interesting tool provided by
Google Books exists, which can help us in bibliographical and reference
researches. This tool is the Ngram Viewer, based on yearly count of n-grams. As
we will show in this paper, although it seems suitable just for literary works,
it can be useful for scientific researches, not only for history of science,
but also for acquiring references often unknown to researchers.
","[{'version': 'v1', 'created': 'Fri, 4 Dec 2015 10:48:35 GMT'}]",2015-12-07,"[['Sparavigna', 'A. C.', ''], ['Marazzato', 'R.', '']]","['Computers and Society', 'Literary works', 'Time-series', 'Referencing']"
17058,1505.05451,Nasser Ghadiri,"Javad Salimi Sartakhti, Homayun Afrabandpey, Nasser Ghadiri",Fuzzy Least Squares Twin Support Vector Machines,,,,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Least Squares Twin Support Vector Machine (LST-SVM) has been shown to be an
efficient and fast algorithm for binary classification. It combines the
operating principles of Least Squares SVM (LS-SVM) and Twin SVM (T-SVM); it
constructs two non-parallel hyperplanes (as in T-SVM) by solving two systems of
linear equations (as in LS-SVM). Despite its efficiency, LST-SVM is still
unable to cope with two features of real-world problems. First, in many
real-world applications, labels of samples are not deterministic; they come
naturally with their associated membership degrees. Second, samples in
real-world applications may not be equally important and their importance
degrees affect the classification. In this paper, we propose Fuzzy LST-SVM
(FLST-SVM) to deal with these two characteristics of real-world data. Two
models are introduced for FLST-SVM: the first model builds up crisp hyperplanes
using training samples and their corresponding membership degrees. The second
model, on the other hand, constructs fuzzy hyperplanes using training samples
and their membership degrees. Numerical evaluation of the proposed method with
synthetic and real datasets demonstrate significant improvement in the
classification accuracy of FLST-SVM when compared to well-known existing
versions of SVM.
","[{'version': 'v1', 'created': 'Wed, 20 May 2015 16:57:02 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Jul 2016 08:59:40 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Nov 2018 21:05:16 GMT'}]",2018-11-26,"[['Sartakhti', 'Javad Salimi', ''], ['Afrabandpey', 'Homayun', ''], ['Ghadiri', 'Nasser', '']]","['Pattern classification', 'least squares twin support vector machine (LST-SVM)', 'fuzzy hyperplane', 'fuzzy SVM']"
17059,1501.00828,Aleksandr Cariow,Aleksandr Cariow and Galina Cariowa,A new algorithm for multiplying two Dirac numbers,"14 pages, 1 figure",,,,cs.DS cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work a rationalized algorithm for Dirac numbers multiplication is
presented. This algorithm has a low computational complexity feature and is
well suited to FPGA implementation. The computation of two Dirac numbers
product using the na\""ive method takes 256 real multiplications and 240 real
additions, while the proposed algorithm can compute the same result in only 88
real multiplications and 256 real additions. During synthesis of the discussed
algorithm we use the fact that Dirac numbers product may be represented as
vector-matrix product. The matrix participating in the product has unique
structural properties that allow performing its advantageous decomposition.
Namely this decomposition leads to significant reducing of the computational
complexity.
","[{'version': 'v1', 'created': 'Mon, 5 Jan 2015 12:00:11 GMT'}]",2015-01-06,"[['Cariow', 'Aleksandr', ''], ['Cariowa', 'Galina', '']]","['Dirac numbers', 'multiplication of hypercomplex numbers', 'fast algorithms']"
17060,1802.09566,Mudasir Ahmad Wani,"Mudasir Ahmad Wani, Nancy Agarwal, Suraiya Jabin, Syed Zeeshan Hussai","Design of iMacros-based Data Crawler and the Behavioral Analysis of
  Facebook Users",,,,,cs.SI cs.HC cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Obtaining the desired dataset is still a prime challenge faced by researchers
while analyzing Online Social Network (OSN) sites. Application Programming
Interfaces (APIs) provided by OSN service providers for retrieving data impose
several unavoidable restrictions which make it difficult to get a desirable
dataset. In this paper, we present an iMacros technology-based data crawler
called IMcrawler, capable of collecting every piece of information which is
accessible through a browser from the Facebook website within the legal
framework which permits access to publicly shared user content on OSNs. The
proposed crawler addresses most of the challenges allied with web data
extraction approaches and most of the APIs provided by OSN service providers.
Two broad sections have been extracted from Facebook user profiles, namely,
Personal Information and Wall Activities. The present work is the first attempt
towards providing the detailed description of crawler design for the Facebook
website.
","[{'version': 'v1', 'created': 'Sun, 18 Feb 2018 18:36:46 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Nov 2019 11:16:01 GMT'}]",2019-11-27,"[['Wani', 'Mudasir Ahmad', ''], ['Agarwal', 'Nancy', ''], ['Jabin', 'Suraiya', ''], ['Hussai', 'Syed Zeeshan', '']]","['Online Social Networks', 'Information Retrieval', 'Data Extraction', 'Behavioral Analysis', 'Privacy and']"
17061,0906.0151,Didehvar Farzaad,"Mahtab Hoseininia, Farzad Didehvar, Mir Mehdi Seyyed Esfahani","Inventory competition in a multi channel distribution system: The Nash
  and Stackelberg game","20 pages, 1 figure",,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates inventory management in a multi channel distribution
system consisting of one manufacturer and an arbitrary number of retailers that
face stochastic demand. Existence of the pure Nash equilibrium is proved and
parameter restriction which implies uniqueness of it is derived. Also the
Stackelberg game where the manufacturer plays a roll as a leader is discussed.
Under specified parameter restrictions which guarantee profitability,
sufficient condition for uniqueness of Stackelberg equilibrium is obtained. In
addition comparison with simultaneous move game is made. The result shows that
when whole prices are equal to production cost, manufacturer carries more
inventory than simultaneous move game. Keywords: Inventory management,
Substitution, Nash equilibrium, Stackelberg equilibrium.
","[{'version': 'v1', 'created': 'Sun, 31 May 2009 12:25:12 GMT'}]",2009-06-02,"[['Hoseininia', 'Mahtab', ''], ['Didehvar', 'Farzad', ''], ['Esfahani', 'Mir Mehdi Seyyed', '']]","['Inventory management', 'Substitution', 'Nash equilibrium', 'Stackelberg']"
17062,1105.2849,James Currie,James D. Currie,Pattern avoidance with involution,,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give the avoidance indices (morphic and antimorphic) for all unary
patterns with involution.
","[{'version': 'v1', 'created': 'Fri, 13 May 2011 22:59:27 GMT'}]",2011-05-17,"[['Currie', 'James D.', '']]","['words avoiding patterns', 'combinatorics on words', 'repetitions', 'Thue-Morse word']"
17063,1606.06566,"Martin F\""urer","Martin F\""urer",Faster Computation of Path-Width,14 pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tree-width and path-width are widely successful concepts. Many NP-hard
problems have efficient solutions when restricted to graphs of bounded
tree-width. Many efficient algorithms are based on a tree decomposition.
Sometimes the more restricted path decomposition is required. The bottleneck
for such algorithms is often the computation of the width and a corresponding
tree or path decomposition. For graphs with $n$ vertices and tree-width or
path-width $k$, the standard linear time algorithm to compute these
decompositions dates back to 1996. Its running time is linear in $n$ and
exponential in $k^3$ and not usable in practice. Here we present a more
efficient algorithm to compute the path-width and provide a path decomposition.
Its running time is $2^{O(k^2)} n$. In the classical algorithm of Bodlaender
and Kloks, the path decomposition is computed from a tree decomposition. Here,
an optimal path decomposition is computed from a path decomposition of about
twice the width. The latter is computed from a constant factor smaller graph.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2016 13:40:01 GMT'}]",2016-06-22,"[['Fürer', 'Martin', '']]","['Path-width', 'tree-width', 'Bodlaender’s algorithm', 'path decomposition', 'FPT']"
17064,1501.00108,Gholamreza Anbarjafari,Gholamreza Anbarjafari,"HSI based colour image equalization using iterative nth root and nth
  power",,,,,cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper an equalization technique for colour images is introduced. The
method is based on nth root and nth power equalization approach but with
optimization of the mean of the image in different colour channels such as RGB
and HSI. The performance of the proposed method has been measured by the means
of peak signal to noise ratio. The proposed algorithm has been compared with
conventional histogram equalization and the visual and quantitative
experimental results are showing that the proposed method over perform the
histogram equalization.
","[{'version': 'v1', 'created': 'Wed, 31 Dec 2014 10:53:50 GMT'}]",2015-01-06,"[['Anbarjafari', 'Gholamreza', '']]","['Image equalization', 'iterative nth root and nth power equalization', 'peak signal to']"
17065,1511.02393,Bojian Xu,Bojian Xu,On Stabbing Queries for Generalized Longest Repeat,10 pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A longest repeat query on a string, motivated by its applications in many
subfields including computational biology, asks for the longest repetitive
substring(s) covering a particular string position (point query). In this
paper, we extend the longest repeat query from point query to \emph{interval
query}, allowing the search for longest repeat(s) covering any position
interval, and thus significantly improve the usability of the solution. Our
method for interval query takes a different approach using the insight from a
recent work on \emph{shortest unique substrings} [1], as the prior work's
approach for point query becomes infeasible in the setting of interval query.
Using the critical insight from [1], we propose an indexing structure, which
can be constructed in the optimal $O(n)$ time and space for a string of size
$n$, such that any future interval query can be answered in $O(1)$ time.
Further, our solution can find \emph{all} longest repeats covering any given
interval using optimal $O(occ)$ time, where $occ$ is the number of longest
repeats covering that given interval, whereas the prior $O(n)$-time and space
work can find only one candidate for each point query. Experiments with
real-world biological data show that our proposal is competitive with prior
works, both time and space wise, while providing with the new functionality of
interval queries as opposed to point queries provided by prior works.
","[{'version': 'v1', 'created': 'Sat, 7 Nov 2015 20:11:33 GMT'}]",2015-11-10,"[['Xu', 'Bojian', '']]","['string', 'repeats', 'longest repeats', 'stabbing query']"
17066,1607.00136,Collins Leke,Collins Leke and Tshilidzi Marwala,"Missing Data Estimation in High-Dimensional Datasets: A Swarm
  Intelligence-Deep Neural Network Approach","12 pages, 3 figures",,,,cs.AI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we examine the problem of missing data in high-dimensional
datasets by taking into consideration the Missing Completely at Random and
Missing at Random mechanisms, as well as theArbitrary missing pattern.
Additionally, this paper employs a methodology based on Deep Learning and Swarm
Intelligence algorithms in order to provide reliable estimates for missing
data. The deep learning technique is used to extract features from the input
data via an unsupervised learning approach by modeling the data distribution
based on the input. This deep learning technique is then used as part of the
objective function for the swarm intelligence technique in order to estimate
the missing data after a supervised fine-tuning phase by minimizing an error
function based on the interrelationship and correlation between features in the
dataset. The investigated methodology in this paper therefore has longer
running times, however, the promising potential outcomes justify the trade-off.
Also, basic knowledge of statistics is presumed.
","[{'version': 'v1', 'created': 'Fri, 1 Jul 2016 07:34:50 GMT'}]",2016-07-04,"[['Leke', 'Collins', ''], ['Marwala', 'Tshilidzi', '']]","['Missing Data', 'Deep Learning', 'Swarm Intelligence', 'HighDimensional Data', 'Supervised Learning', 'Unsupervised Learning']"
17067,1506.03355,Junya Honda,Junya Honda,Exact Asymptotics for the Random Coding Error Probability,"Full version of the paper in ISIT2015 with some corrections and
  refinements",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Error probabilities of random codes for memoryless channels are considered in
this paper. In the area of communication systems, admissible error probability
is very small and it is sometimes more important to discuss the relative gap
between the achievable error probability and its bound than to discuss the
absolute gap. Scarlett et al. derived a good upper bound of a random coding
union bound based on the technique of saddlepoint approximation but it is not
proved that the relative gap of their bound converges to zero. This paper
derives a new bound on the achievable error probability in this viewpoint for a
class of memoryless channels. The derived bound is strictly smaller than that
by Scarlett et al. and its relative gap with the random coding error
probability (not a union bound) vanishes as the block length increases for a
fixed coding rate.
","[{'version': 'v1', 'created': 'Wed, 10 Jun 2015 15:17:54 GMT'}]",2015-06-11,"[['Honda', 'Junya', '']]","['channel coding', 'random coding', 'error exponent', 'finite-length analysis', 'asymptotic expansion']"
17068,1510.02873,Arya Mazumdar,Alexander Barg and Arya Mazumdar,Group testing schemes from codes and designs,18 pages,,,,cs.IT cs.DM math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In group testing, simple binary-output tests are designed to identify a small
number $t$ of defective items that are present in a large population of $N$
items. Each test takes as input a group of items and produces a binary output
indicating whether the group is free of the defective items or contains one or
more of them. In this paper we study a relaxation of the combinatorial group
testing problem. A matrix is called $(t,\epsilon)$-disjunct if it gives rise to
a nonadaptive group testing scheme with the property of identifying a uniformly
random $t$-set of defective subjects out of a population of size $N$ with false
positive probability of an item at most $\epsilon$. We establish a new
connection between $(t,\epsilon)$-disjunct matrices and error correcting codes
based on the dual distance of the codes and derive estimates of the parameters
of codes that give rise to such schemes. Our methods rely on the moments of the
distance distribution of codes and inequalities for moments of sums of
independent random variables. We also provide a new connection between group
testing schemes and combinatorial designs.
","[{'version': 'v1', 'created': 'Sat, 10 Oct 2015 04:13:06 GMT'}, {'version': 'v2', 'created': 'Sat, 8 Apr 2017 16:48:03 GMT'}]",2017-04-11,"[['Barg', 'Alexander', ''], ['Mazumdar', 'Arya', '']]","['Group testing', 'disjunct matrices', 'error-correcting codes', 'constant weight codes', 'dualdistance', 'combinatorial designs']"
17069,1312.4265,Pierre-Louis Cayrel,Pierre-Louis Cayrel and Mohammed Meziani,Post-Quantum Cryptography: Code-based Signatures,,"Proceedings of ISA 2010, LNCS 6059, pages 82-99, Springer-Verlag,
  2010",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This survey provides a comparative overview of code-based signature schemes
with respect to security and performance. Furthermore, we explicitly describe
serveral code-based signature schemes with additional properties such as
identity-based, threshold ring and blind signatures.
","[{'version': 'v1', 'created': 'Mon, 16 Dec 2013 08:32:19 GMT'}]",2013-12-17,"[['Cayrel', 'Pierre-Louis', ''], ['Meziani', 'Mohammed', '']]","['post-quantum cryptography', 'coding-based cryptography', 'digital signatures']"
17070,1401.5367,Roberto Lopez-Herrejon,"Roberto E. Lopez-Herrejon, Javier Ferrer, Francisco Chicano, Evelyn
  Nicole Haslinger, Alexander Egyed, Enrique Alba","Towards a Benchmark and a Comparison Framework for Combinatorial
  Interaction Testing of Software Product Lines",,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As Software Product Lines (SPLs) are becoming a more pervasive development
practice, their effective testing is becoming a more important concern. In the
past few years many SPL testing approaches have been proposed, among them, are
those that support Combinatorial Interaction Testing (CIT) whose premise is to
select a group of products where faults, due to feature interactions, are more
likely to occur. Many CIT techniques for SPL testing have been put forward;
however, no systematic and comprehensive comparison among them has been
performed. To achieve such goal two items are important: a common benchmark of
feature models, and an adequate comparison framework. In this
research-in-progress paper, we propose 19 feature models as the base of a
benchmark, which we apply to three different techniques in order to analyze the
comparison framework proposed by Perrouin et al. We identify the shortcomings
of this framework and elaborate alternatives for further study.
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2014 16:20:24 GMT'}]",2014-01-22,"[['Lopez-Herrejon', 'Roberto E.', ''], ['Ferrer', 'Javier', ''], ['Chicano', 'Francisco', ''], ['Haslinger', 'Evelyn Nicole', ''], ['Egyed', 'Alexander', ''], ['Alba', 'Enrique', '']]","['Combinatorial Interaction Testing', 'Software Product Lines', 'Pairwise Testing', 'Feature Models']"
17071,1107.3193,Chengpu Wang,Chengpu Wang,"Type Expressiveness and Its Application in Separation of Behavior
  Programming and Data Management Programming","13 pages, 10 figures",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new behavior descriptive entity type called spec is proposed, which
combines the traditional interface with test rules and test cases, to
completely specify the desired behavior of each method, and to enforce the
behavior-wise correctness of all compiled units. Using spec, a new programming
paradigm is proposed, which allows the separation programming space into 1) a
behavior domain to aggregate all behavior programming in the format of specs,
2) a object domain to bind each concrete spec to its data representation in a
particular address space, and 3) a realization domain to connect the behavior
domain and the object domain. Such separation guarantees the strictness of
behavior satisfaction at compile time, while allows flexibility of dynamical
binding of actual implementation at runtime. A new convention call type
expressiveness to allow data exchange between different programming languages
and between different software environments is also proposed.
","[{'version': 'v1', 'created': 'Sat, 16 Jul 2011 03:03:10 GMT'}, {'version': 'v10', 'created': 'Wed, 20 Aug 2014 04:36:19 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Jul 2011 10:57:53 GMT'}, {'version': 'v3', 'created': 'Wed, 27 Jul 2011 11:12:39 GMT'}, {'version': 'v4', 'created': 'Wed, 10 Aug 2011 01:44:52 GMT'}, {'version': 'v5', 'created': 'Tue, 27 Sep 2011 02:10:59 GMT'}, {'version': 'v6', 'created': 'Thu, 13 Oct 2011 01:01:00 GMT'}, {'version': 'v7', 'created': 'Fri, 18 Nov 2011 16:09:51 GMT'}, {'version': 'v8', 'created': 'Sat, 3 Dec 2011 05:57:19 GMT'}, {'version': 'v9', 'created': 'Tue, 19 Aug 2014 03:54:50 GMT'}]",2014-08-21,"[['Wang', 'Chengpu', '']]","['Computer Programming Language', 'Programming Paradigm', 'Serialization']"
17072,1701.07484,Kenneth Johnson,"Kenneth Johnson, John V. Tucker, Victoria Wang",Monitoring and Intervention: Concepts and Formal Models,"29 pages, 1 figure",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our machines, products, utilities, and environments have long been monitored
by embedded software systems. Our professional, commercial, social and personal
lives are also subject to monitoring as they are mediated by software systems.
Data on nearly everything now exists, waiting to be collected and analysed for
all sorts of reasons. Given the rising tide of data we pose the questions: What
is monitoring? Do diverse and disparate monitoring systems have anything in
common? We attempt answer these questions by proposing an abstract conceptual
framework for studying monitoring. We argue that it captures a structure common
to many different monitoring practices, and that from it detailed formal models
can be derived, customised to applications. The framework formalises the idea
that monitoring is a process that observes the behaviour of people and objects
in a context. The entities and their behaviours are represented by abstract
data types and the observable attributes by logics. Since monitoring usually
has a specific purpose, we extend the framework with protocols for detecting
attributes or events that require interventions and, possibly, a change in
behaviour. Our theory is illustrated by a case study from criminal justice,
that of electronic tagging.
","[{'version': 'v1', 'created': 'Wed, 25 Jan 2017 20:58:13 GMT'}]",2017-01-27,"[['Johnson', 'Kenneth', ''], ['Tucker', 'John V.', ''], ['Wang', 'Victoria', '']]","['monitoring', 'intervention', 'criminal monitoring', 'surveillance', 'policy compliance', 'abstract data types', 'streams', 'logics']"
17073,1802.09333,Hanzhou Wu,"Hanzhou Wu, Wei Wang, Jing Dong, Hongxia Wang and Lizhi Xiong",The Cut and Dominating Set Problem in A Steganographer Network,,,,,cs.DS cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A steganographer network corresponds to a graphic structure that the involved
vertices (or called nodes) denote social entities such as the data encoders and
data decoders, and the associated edges represent any real communicable
channels or other social links that could be utilized for steganography. Unlike
traditional steganographic algorithms, a steganographer network models
steganographic communication by an abstract way such that the concerned
underlying characteristics of steganography are quantized as analyzable
parameters in the network. In this paper, we will analyze two problems in a
steganographer network. The first problem is a passive attack to a
steganographer network where a network monitor has collected a list of
suspicious vertices corresponding to the data encoders or decoders. The network
monitor expects to break (disconnect) the steganographic communication down
between the suspicious vertices while keeping the cost as low as possible. The
second one relates to determining a set of vertices corresponding to the data
encoders (senders) such that all vertices can share a message by neighbors. We
point that, the two problems are equivalent to the minimum cut problem and the
minimum-weight dominating set problem.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 04:06:33 GMT'}]",2018-02-27,"[['Wu', 'Hanzhou', ''], ['Wang', 'Wei', ''], ['Dong', 'Jing', ''], ['Wang', 'Hongxia', ''], ['Xiong', 'Lizhi', '']]","['Steganographer network', 'steganography', 'steganalysis', 'cut', 'dominating set', 'graph', 'social networks']"
17074,1306.4069,Azhar Mahmood,"Azhar Mahmood, Shi Ke, Shaheen Khatoon","An Efficient Distributed Data Extraction Method for Mining Sensor
  Networks Data","IJCSI International Journal of Computer Science Issues, Vol. 10,
  Issue 1, No 2, January 2013",,,,cs.DB cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A wide range of Sensor Networks (SNs) are deployed in real world applications
which generate large amount of raw sensory data. Data mining technique to
extract useful knowledge from these applications is an emerging research area
due to its crucial importance but still its a challenge to discover knowledge
efficiently from the sensor network data. In this paper we proposed a
Distributed Data Extraction (DDE) method to extract data from sensor networks
by applying rules based clustering and association rule mining techniques. A
significant amount of sensor readings sent from the sensors to the data
processing point(s) may be lost or corrupted. DDE is also estimating these
missing values from available sensor reading instead of requesting the sensor
node to resend lost reading. DDE also apply data reduction which is able to
reduce the data size while transmitting to sink. Results show our proposed
approach exhibits the maximum data accuracy and efficient data extraction in
term of the entire networks energy consumption.
","[{'version': 'v1', 'created': 'Tue, 18 Jun 2013 05:40:45 GMT'}]",2013-06-19,"[['Mahmood', 'Azhar', ''], ['Ke', 'Shi', ''], ['Khatoon', 'Shaheen', '']]","['Sensor Network', 'Data Mining', 'Data Extraction', 'Association Rules', 'Clustering', 'Frequent Pattern', 'Data Reduction']"
17075,1603.02413,Pascal Held,"Pascal Held, Benjamin Krause, Rudolf Kruse",Dynamic Clustering in Social Networks using Louvain and Infomap Method,,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finding communities or clusters in social networks is a fa- mous topic in
social network analysis. Most algorithms are limited to static snapshots, so
they cannot handle dynamics within the underlying graph. In this paper we
present a modification of the Louvain community detec- tion method to handle
changes in the graph without rerunning the full algorithm. Also, we adapted the
Louvain greedy approach to optimize the Infomap measure. The main idea is, to
recalculate only a small area around the changes. Depending on the graph size
and the amount of changes, this yields a massive runtime decrease. As
validation data, we provide a graph generator, which produces spe- cific
community structures, at given times and also intermediate steps to transform
the graph from one to another specific graph. Experiments show that runtime
decrease is possible without much loss of quality. These values depend on the
reprocessed area inside the graph.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2016 08:28:56 GMT'}]",2016-03-09,"[['Held', 'Pascal', ''], ['Krause', 'Benjamin', ''], ['Kruse', 'Rudolf', '']]","['Dynamic Graph Clustering', 'Community Detection', 'Louvain', 'Infomap', 'Graph Generator']"
17076,1107.0998,Samuel Epstein,Samuel Epstein and Margrit Betke,"An Information Theoretic Representation of Agent Dynamics as Set
  Intersections",,,,,cs.IT cs.AI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We represent agents as sets of strings. Each string encodes a potential
interaction with another agent or environment. We represent the total set of
dynamics between two agents as the intersection of their respective strings, we
prove complexity properties of player interactions using Algorithmic
Information Theory. We show how the proposed construction is compatible with
Universal Artificial Intelligence, in that the AIXI model can be seen as
universal with respect to interaction.
","[{'version': 'v1', 'created': 'Tue, 5 Jul 2011 22:23:42 GMT'}]",2015-03-19,"[['Epstein', 'Samuel', ''], ['Betke', 'Margrit', '']]","['Universal Artificial Intelligence', 'AIXI Model', 'KolmogorovComplexity', 'Algorithmic Information Theory']"
17077,0903.3889,Marius Zimand,Marius Zimand,On generating independent random strings,"CiE 2009, Heidelberg",,,,cs.IT cs.CC math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is shown that from two strings that are partially random and independent
(in the sense of Kolmogorov complexity) it is possible to effectively construct
polynomially many strings that are random and pairwise independent. If the two
initial strings are random, then the above task can be performed in polynomial
time. It is also possible to construct in polynomial time a random string, from
two strings that have constant randomness rate.
","[{'version': 'v1', 'created': 'Mon, 23 Mar 2009 16:03:08 GMT'}]",2009-03-24,"[['Zimand', 'Marius', '']]","['Kolmogorov complexity', 'random strings', 'independent strings', 'randomness extraction']"
17078,1705.08708,Chun Tian,Chun Tian,SNMP for Common Lisp,"10 pages; reprinted from ILC '09, Proceedings of the International
  Lisp Conference, March 22-25, 2009, Cambridge, Massachusetts, USA","ILC '09, Proceedings of the International Lisp Conference, March
  22-25, 2009, Cambridge, Massachusetts, USA",,,cs.NI cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Simple Network Management Protocol (SNMP) is widely used for management of
Internet-based network today. In Lisp community, there're large Lisp-based
applications which may need be monitored, and there're Lispers who may need to
monitor other remote systems which are either Lisp-based or not. However, the
relationship between Lisp and SNMP haven't been studied enough during past 20
years.
  The cl-net-snmp project has developed a new Common Lisp package which
implemented the SNMP protocol. On client side, it can be used to query remote
SNMP peers, and on server side, it brings SNMP capability into Common Lisp
based applications, which could be monitored from remote through any SNMP-based
management system. It's also a flexible platform for researches on network
management and SNMP itself. But the most important, this project tries to
prove: Common Lisp is the most fit language to implement SNMP.
  Different from other exist SNMP projects on Common Lisp, cl-net-snmp is
clearly targeted on full SNMP protocol support include SNMPv3 and server-side
work (agent). During the development, an general ASN.1 compiler and runtime
package and an portable UDP networking package are also implemented, which
would be useful for other related projects.
  In this paper, the author first introduces the SNMP protocol and a quick
tutorial of cl-net-snmp on both client and server sides, and then the Lisp
native design and the implementation details of the ASN.1 and SNMP package,
especially the ""code generation""' approach on compiling SNMP MIB definitions
from ASN.1 into Common Lisp.
","[{'version': 'v1', 'created': 'Wed, 24 May 2017 11:46:01 GMT'}]",2017-05-25,"[['Tian', 'Chun', '']]","['Lisp', 'SNMP', 'ASN']"
17079,0906.0049,Serguei Mokhov,"Serguei A. Mokhov, Joey Paquet, and Mourad Debbabi","Towards Automated Deduction in Blackmail Case Analysis with Forensic
  Lucid","11 pages, 7 figures; related to arXiv:0904.3789 and arXiv:0905.2449",,,,cs.LO cs.CR cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work-in-progress focuses on the refinement of application of the
intensional logic to cyberforensic analysis and its benefits are compared with
the finite-state automata approach. This work extends the use of the scientific
intensional programming paradigm onto modeling and implementation of a
cyberforensics investigation process with the backtrace of event
reconstruction, modeling the evidence as multidimensional hierarchical
contexts, and proving or disproving the claims with it in the intensional
manner of evaluation. This is a practical, context-aware improvement over the
finite state automata (FSA) approach we have seen in the related works. As a
base implementation language model we use in this approach is a new dialect of
the Lucid programming language, that we call Forensic Lucid and in this paper
we focus on defining hierarchical contexts based on the intensional logic for
the evaluation of cyberforensic expressions.
","[{'version': 'v1', 'created': 'Sat, 30 May 2009 02:04:15 GMT'}]",2009-06-02,"[['Mokhov', 'Serguei A.', ''], ['Paquet', 'Joey', ''], ['Debbabi', 'Mourad', '']]","['intensional logic', 'intensional programming', 'cyberforensics', 'Forensic Lucid', 'Lucid', 'finitestate automata']"
17080,1412.6092,Vasile Patrascu,Vasile Patrascu,"Image enhancement using the mean dynamic range maximization with
  logarithmic operations","Periodica Politechnica, Transactions on Automatic Control and
  Computer Science, Vol.47 (61), 2002, ISSN 1224-600X, pp. 121-126, Timisoara,
  Romania. arXiv admin note: text overlap with arXiv:1412.5764",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we use a logarithmic model for gray level image enhancement. We
begin with a short presentation of the model and then, we propose a new formula
for the mean dynamic range. After that we present two image transforms: one
performs an optimal enhancement of the mean dynamic range using the logarithmic
addition, and the other does the same for positive and negative values using
the logarithmic scalar multiplication. We present the comparison of the results
obtained by dynamic ranges optimization with the results obtained using
classical image enhancement methods like gamma correction and histogram
equalization.
","[{'version': 'v1', 'created': 'Thu, 18 Dec 2014 10:19:02 GMT'}]",2014-12-22,"[['Patrascu', 'Vasile', '']]","['Image enhancement', 'logarithmic image processing', 'mean dynamic range']"
17081,1111.4036,Tamal Chakraborty,"Tamal Chakraborty, Atri Mukhopadhyay, Iti Saha Misra and Salil Kumar
  Sanyal","VoIP Call Optimization in Diverse Network Scenarios Using Learning Based
  State-Space Search Technique",,"International Journal of Wireless & Mobile Networks (IJWMN) Vol.
  3, No. 5, 2011, 211-228",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A VoIP based call has stringent QoS requirements with respect to delay,
jitter, loss, MOS and R-Factor. Various QoS mechanisms implemented to satisfy
these requirements must be adaptive under diverse network scenarios and applied
in proper sequence, otherwise they may conflict with each other. The objective
of this paper is to address the problem of adaptive QoS maintenance and
sequential execution of available QoS implementation mechanisms with respect to
VoIP under varying network conditions. In this paper, we generalize this
problem as state-space problem and solve it. Firstly, we map the problem of QoS
optimization into state-space domain and apply incremental heuristic search. We
implement the proposed algorithm under various network and user scenarios in a
VoIP test-bed for QoS enhancement. Then learning strategy is implemented for
refinement of knowledge base to improve the performance of call quality over
time. Finally, we discuss the advantages and uniqueness of our approach.
","[{'version': 'v1', 'created': 'Thu, 17 Nov 2011 09:05:34 GMT'}]",2011-11-18,"[['Chakraborty', 'Tamal', ''], ['Mukhopadhyay', 'Atri', ''], ['Misra', 'Iti Saha', ''], ['Sanyal', 'Salil Kumar', '']]","['Voice over IP', 'Quality of Service', 'State-space', 'Incremental Heuristic Search', 'Learning']"
17082,1209.4297,Benjamin Ong,"Benjamin Ong, Andrew Melfi and Andrew Christlieb",Parallel Semi-Implicit Time Integrators,,,,,cs.DC math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we further develop a family of parallel time integrators known
as Revisionist Integral Deferred Correction methods (RIDC) to allow for the
semi-implicit solution of time dependent PDEs. Additionally, we show that our
semi-implicit RIDC algorithm can harness the computational potential of
multiple general purpose graphical processing units (GPUs) in a single node by
utilizing existing CUBLAS libraries for matrix linear algebra routines in our
implementation. In the numerical experiments, we show that our implementation
computes a fourth order solution using four GPUs and four CPUs in approximately
the same wall clock time as a first order solution computed using a single GPU
and a single CPU.
","[{'version': 'v1', 'created': 'Wed, 19 Sep 2012 16:18:33 GMT'}]",2012-09-20,"[['Ong', 'Benjamin', ''], ['Melfi', 'Andrew', ''], ['Christlieb', 'Andrew', '']]","['Advection–Diffusion', 'Reaction–Diffusion', 'integraldeferred correction', 'parallel integrators', 'graphics processingunits']"
17083,1407.0643,Stefano Leucci,"Davide Bil\`o and Luciano Gual\`a and Stefano Leucci and Guido
  Proietti",The Max-Distance Network Creation Game on General Host Graphs,"17 pages, 4 figures",,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we study a generalization of the classic \emph{network creation
game} in the scenario in which the $n$ players sit on a given arbitrary
\emph{host graph}, which constrains the set of edges a player can activate at a
cost of $\alpha \geq 0$ each. This finds its motivations in the physical
limitations one can have in constructing links in practice, and it has been
studied in the past only when the routing cost component of a player is given
by the sum of distances to all the other nodes. Here, we focus on another
popular routing cost, namely that which takes into account for each player its
\emph{maximum} distance to any other player. For this version of the game, we
first analyze some of its computational and dynamic aspects, and then we
address the problem of understanding the structure of associated pure Nash
equilibria. In this respect, we show that the corresponding price of anarchy
(PoA) is fairly bad, even for several basic classes of host graphs. More
precisely, we first exhibit a lower bound of $\Omega (\sqrt{ n / (1+\alpha)})$
for any $\alpha = o(n)$. Notice that this implies a counter-intuitive lower
bound of $\Omega(\sqrt{n})$ for very small values of $\alpha$ (i.e., edges can
be activated almost for free). Then, we show that when the host graph is
restricted to be either $k$-regular (for any constant $k \geq 3$), or a
2-dimensional grid, the PoA is still $\Omega(1+\min\{\alpha,
\frac{n}{\alpha}\})$, which is proven to be tight for
$\alpha=\Omega(\sqrt{n})$. On the positive side, if $\alpha \geq n$, we show
the PoA is $O(1)$. Finally, in the case in which the host graph is very sparse
(i.e., $|E(H)|=n-1+k$, with $k=O(1)$), we prove that the PoA is $O(1)$, for any
$\alpha$.
","[{'version': 'v1', 'created': 'Wed, 2 Jul 2014 16:48:53 GMT'}]",2014-07-03,"[['Bilò', 'Davide', ''], ['Gualà', 'Luciano', ''], ['Leucci', 'Stefano', ''], ['Proietti', 'Guido', '']]","['Network creation games', 'Pure Nash equilibrium', 'Price of Anarchy', 'Hostgraph']"
17084,1701.06672,Edgar Martinez-Moro,"Edgar Mart\'inez-Moro, Kamil Otal and Ferruh \""Ozbudak",Additive cyclic codes over finite commutative chain rings,,,,,cs.IT math.IT math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Additive cyclic codes over Galois rings were investigated in previous works.
In this paper, we investigate the same problem but over a more general ring
family, finite commutative chain rings. When we focus on non-Galois finite
commutative chain rings, we observe two different kinds of additivity. One of
them is a natural generalization of the previous studies, whereas the other one
has some unusual properties especially while constructing dual codes. We
interpret the reasons of such properties and illustrate our results giving
concrete examples.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2017 23:12:08 GMT'}]",2017-01-25,"[['Martínez-Moro', 'Edgar', ''], ['Otal', 'Kamil', ''], ['Özbudak', 'Ferruh', '']]","['Cyclic codes', 'additive codes', 'codes over rings', 'finite commutative chainrings', 'Galois rings']"
17085,1205.6593,Jun Zhang,"Jun Zhang, Fang-Wei Fu and Qun-Ying Liao",New Deep Holes of Generalized Reed-Solomon Codes,,,,,cs.IT math.IT math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep holes play an important role in the decoding of generalized Reed-Solomon
codes. Recently, Wu and Hong \cite{WH} found a new class of deep holes for
standard Reed-Solomon codes. In the present paper, we give a concise method to
obtain a new class of deep holes for generalized Reed-Solomon codes. In
particular, for standard Reed-Solomon codes, we get the new class of deep holes
given in \cite{WH}.
  Li and Wan \cite{L.W1} studied deep holes of generalized Reed-Solomon codes
$GRS_{k}(\f,D)$ and characterized deep holes defined by polynomials of degree
$k+1$. They showed that this problem is reduced to be a subset sum problem in
finite fields. Using the method of Li and Wan, we obtain some new deep holes
for special Reed-Solomon codes over finite fields with even characteristic.
Furthermore, we study deep holes of the extended Reed-Solomon code, i.e.,
$D=\f$ and show polynomials of degree $k+2$ can not define deep holes.
","[{'version': 'v1', 'created': 'Wed, 30 May 2012 09:08:40 GMT'}]",2012-05-31,"[['Zhang', 'Jun', ''], ['Fu', 'Fang-Wei', ''], ['Liao', 'Qun-Ying', '']]","['coding theory', 'Reed-Solomon codes', 'list decoding', 'deepholes', 'multiplicative character', 'quadratic equation']"
17086,1603.00954,Hanie Sedghi,Hanie Sedghi and Anima Anandkumar,Training Input-Output Recurrent Neural Networks through Spectral Methods,,,,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of training input-output recurrent neural networks
(RNN) for sequence labeling tasks. We propose a novel spectral approach for
learning the network parameters. It is based on decomposition of the
cross-moment tensor between the output and a non-linear transformation of the
input, based on score functions. We guarantee consistent learning with
polynomial sample and computational complexity under transparent conditions
such as non-degeneracy of model parameters, polynomial activations for the
neurons, and a Markovian evolution of the input sequence. We also extend our
results to Bidirectional RNN which uses both previous and future information to
output the label at each time point, and is employed in many NLP tasks such as
POS tagging.
","[{'version': 'v1', 'created': 'Thu, 3 Mar 2016 03:14:47 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Mar 2016 03:46:12 GMT'}, {'version': 'v3', 'created': 'Fri, 3 Jun 2016 07:03:46 GMT'}, {'version': 'v4', 'created': 'Fri, 22 Jul 2016 19:52:21 GMT'}, {'version': 'v5', 'created': 'Mon, 31 Oct 2016 18:30:51 GMT'}]",2016-11-01,"[['Sedghi', 'Hanie', ''], ['Anandkumar', 'Anima', '']]","['Recurrent neural networks', 'sequence labeling', 'spectral methods', 'score function']"
17087,1301.6770,Zhixiang Eddie Xu,"Zhixiang (Eddie) Xu, Minmin Chen, Kilian Q. Weinberger, Fei Sha",An alternative text representation to TF-IDF and Bag-of-Words,,,,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In text mining, information retrieval, and machine learning, text documents
are commonly represented through variants of sparse Bag of Words (sBoW) vectors
(e.g. TF-IDF). Although simple and intuitive, sBoW style representations suffer
from their inherent over-sparsity and fail to capture word-level synonymy and
polysemy. Especially when labeled data is limited (e.g. in document
classification), or the text documents are short (e.g. emails or abstracts),
many features are rarely observed within the training corpus. This leads to
overfitting and reduced generalization accuracy. In this paper we propose Dense
Cohort of Terms (dCoT), an unsupervised algorithm to learn improved sBoW
document features. dCoT explicitly models absent words by removing and
reconstructing random sub-sets of words in the unlabeled corpus. With this
approach, dCoT learns to reconstruct frequent words from co-occurring
infrequent words and maps the high dimensional sparse sBoW vectors into a
low-dimensional dense representation. We show that the feature removal can be
marginalized out and that the reconstruction can be solved for in closed-form.
We demonstrate empirically, on several benchmark datasets, that dCoT features
significantly improve the classification accuracy across several document
classification tasks.
","[{'version': 'v1', 'created': 'Mon, 28 Jan 2013 21:04:45 GMT'}]",2013-01-30,"[['Zhixiang', '', '', 'Eddie'], ['Xu', '', ''], ['Chen', 'Minmin', ''], ['Weinberger', 'Kilian Q.', ''], ['Sha', 'Fei', '']]","['Denoising Autoencoder', 'Marginalized', 'Stacked', 'Text features']"
17088,1203.1793,Riadh Bouslimi,"Riadh Bouslimi, Jalel Akaichi",Using Hausdorff Distance for New Medical Image Annotation,"7 pages, 3 figures, 2 tables; International Journal of Database
  Management Systems (IJDMS) Vol.4, No.1, February 2012",,,,cs.IR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Medical images annotation is most of the time a repetitive hard task.
Collecting old similar annotations and assigning them to new medical images may
not only enhance the annotation process, but also reduce ambiguity caused by
repetitive annotations. The goal of this work is to propose an approach based
on Hausdorff distance able to compute similarity between a new medical image
and old stored images. User has to choose then one of the similar images and
annotations related to the selected one are assigned to the new one.
","[{'version': 'v1', 'created': 'Thu, 8 Mar 2012 13:28:47 GMT'}]",2012-03-09,"[['Bouslimi', 'Riadh', ''], ['Akaichi', 'Jalel', '']]","['hausdorff distance', 'medical image annotation', 'similarity image', 'retrieval image', 'local feature']"
17089,1611.00739,"Dilek K\""u\c{c}\""uk","Dilek K\""u\c{c}\""uk and Turan Demirci","Enerji \.Izleme Yaz{\i}l{\i}mlar{\i} i\c{c}in Merkezi ve Genel bir
  Mimari (A Centralized and Generic Architecture for Energy Monitoring
  Software)","in Turkish. 10. Ulusal Yaz{\i}l{\i}m M\""uhendisli\u{g}i Sempozyumu'na
  (UYMS 2016) kabul edildi",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is need for several software systems within the energy domain and
corresponding systems are being developed to satisfy these needs. These systems
include energy monitoring, information, wide area monitoring and control
systems, and SCADA systems. Energy monitoring systems are one of the most
important and common systems among them. In this study, after briefly reviewing
several of the software systems within the energy domain, a centralized and
generic software architecture for energy monitoring systems is presented. Next,
sample projects are described in which energy monitoring systems based on this
architecture have been implemented. We envisage that this study will be an
important resource for software projects in the energy domain.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2016 19:33:45 GMT'}]",2016-11-03,"[['Küçük', 'Dilek', ''], ['Demirci', 'Turan', '']]","['system architecture', 'software architecture', 'energy monitoring software', 'energy software systems']"
17090,2007.05505,Chetan Bansal,"Manish Shetty, Chetan Bansal, Sumit Kumar, Nikitha Rao, Nachiappan
  Nagappan, Thomas Zimmermann",Neural Knowledge Extraction From Cloud Service Incidents,"To be published in the proceedings of ICSE 2021 - Software
  Engineering in Practice Track",,,,cs.SE cs.AI cs.DC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last decade, two paradigm shifts have reshaped the software industry -
the move from boxed products to services and the widespread adoption of cloud
computing. This has had a huge impact on the software development life cycle
and the DevOps processes. Particularly, incident management has become critical
for developing and operating large-scale services. Incidents are created to
ensure timely communication of service issues and, also, their resolution.
Prior work on incident management has been heavily focused on the challenges
with incident triaging and de-duplication. In this work, we address the
fundamental problem of structured knowledge extraction from service incidents.
We have built SoftNER, a framework for unsupervised knowledge extraction from
service incidents. We frame the knowledge extraction problem as a Named-entity
Recognition task for extracting factual information. SoftNER leverages
structural patterns like key,value pairs and tables for bootstrapping the
training data. Further, we build a novel multi-task learning based BiLSTM-CRF
model which leverages not just the semantic context but also the data-types for
named-entity extraction. We have deployed SoftNER at Microsoft, a major cloud
service provider and have evaluated it on more than 2 months of cloud
incidents. We show that the unsupervised machine learning based approach has a
high precision of 0.96. Our multi-task learning based deep learning model also
outperforms the state of the art NER models. Lastly, using the knowledge
extracted by SoftNER we are able to build significantly more accurate models
for important downstream tasks like incident triaging.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 17:33:07 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Jul 2020 06:47:23 GMT'}, {'version': 'v3', 'created': 'Wed, 15 Jul 2020 07:07:03 GMT'}, {'version': 'v4', 'created': 'Fri, 15 Jan 2021 21:56:16 GMT'}]",2021-01-19,"[['Shetty', 'Manish', ''], ['Bansal', 'Chetan', ''], ['Kumar', 'Sumit', ''], ['Rao', 'Nikitha', ''], ['Nagappan', 'Nachiappan', ''], ['Zimmermann', 'Thomas', '']]","['Cloud Services', 'Service Incidents', 'Knowledge Extraction', 'DeepLearning', 'Machine Learning']"
17091,1702.00528,Yutao Tang,Yutao Tang,"Output Average Consensus Over Heterogeneous Multi-Agent Systems via
  Two-Level Approach","12 pages, 3 figures",,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a novel two-level framework was proposed and applied to solve
the output average consensus problem over heterogeneous multi-agent systems.
This approach is mainly based on the recent technique of system abstraction.
For given multi-agent systems, we first constructed their abstractions as the
upper level and solved their average consensus problem by leveraging well-known
results for single integrators. Then the control protocols for physical agents
in the lower level were synthesized in a hierarchical way by embedding the
designed law for abstractions into an interface between two levels. In this
way, the complexity coming from heterogeneous dynamics of agents is totally
decoupled from that of the coordination task and the communication topologies.
An example was given to show its effectiveness.
","[{'version': 'v1', 'created': 'Thu, 2 Feb 2017 02:40:37 GMT'}]",2017-02-03,"[['Tang', 'Yutao', '']]","['average consensus', 'system abstraction', 'two-level control', 'heterogeneous multi-agent system']"
17092,1306.1271,Kevin Xu,Kevin S. Xu,Predictability of social interactions,"Extended abstract selected as the winner of the 2013 International
  Conference on Social Computing, Behavioral-Cultural Modeling, and Prediction
  (SBP) Challenge",,,,cs.SI cs.CY physics.soc-ph stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ability to predict social interactions between people has profound
applications including targeted marketing and prediction of information
diffusion and disease propagation. Previous work has shown that the location of
an individual at any given time is highly predictable. This study examines the
predictability of social interactions between people to determine whether
interaction patterns are similarly predictable. I find that the locations and
times of interactions for an individual are highly predictable; however, the
other person the individual interacts with is less predictable. Furthermore, I
show that knowledge of the locations and times of interactions has almost no
effect on the predictability of the other person. Finally I demonstrate that a
simple Markov chain model is able to achieve close to the upper bound in terms
of predicting the next person with whom a given individual will interact.
","[{'version': 'v1', 'created': 'Thu, 6 Jun 2013 00:40:55 GMT'}]",2013-06-07,"[['Xu', 'Kevin S.', '']]","['predictability', 'social', 'interaction', 'human dynamics', 'entropy']"
17093,1501.04797,Sven Puchinger,"Wenhui Li, Johan S. R. Nielsen, Sven Puchinger, Vladimir Sidorenko","Solving Shift Register Problems over Skew Polynomial Rings using Module
  Minimisation","10 pages, submitted to WCC 2015",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For many algebraic codes the main part of decoding can be reduced to a shift
register synthesis problem. In this paper we present an approach for solving
generalised shift register problems over skew polynomial rings which occur in
error and erasure decoding of $\ell$-Interleaved Gabidulin codes. The algorithm
is based on module minimisation and has time complexity $O(\ell \mu^2)$ where
$\mu$ measures the size of the input problem.
","[{'version': 'v1', 'created': 'Tue, 20 Jan 2015 13:07:59 GMT'}]",2015-01-21,"[['Li', 'Wenhui', ''], ['Nielsen', 'Johan S. R.', ''], ['Puchinger', 'Sven', ''], ['Sidorenko', 'Vladimir', '']]","['Skew Polynomials', 'Ore Polynomials', 'Shift Register Synthesis', 'Module Minimisation', 'Gabidulin Codes']"
17094,1501.03210,Piyush Bansal,"Piyush Bansal, Romil Bansal and Vasudeva Varma",Towards Deep Semantic Analysis Of Hashtags,To Appear in 37th European Conference on Information Retrieval,,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hashtags are semantico-syntactic constructs used across various social
networking and microblogging platforms to enable users to start a topic
specific discussion or classify a post into a desired category. Segmenting and
linking the entities present within the hashtags could therefore help in better
understanding and extraction of information shared across the social media.
However, due to lack of space delimiters in the hashtags (e.g #nsavssnowden),
the segmentation of hashtags into constituent entities (""NSA"" and ""Edward
Snowden"" in this case) is not a trivial task. Most of the current
state-of-the-art social media analytics systems like Sentiment Analysis and
Entity Linking tend to either ignore hashtags, or treat them as a single word.
In this paper, we present a context aware approach to segment and link entities
in the hashtags to a knowledge base (KB) entry, based on the context within the
tweet. Our approach segments and links the entities in hashtags such that the
coherence between hashtag semantics and the tweet is maximized. To the best of
our knowledge, no existing study addresses the issue of linking entities in
hashtags for extracting semantic information. We evaluate our method on two
different datasets, and demonstrate the effectiveness of our technique in
improving the overall entity linking in tweets via additional semantic
information provided by segmenting and linking entities in a hashtag.
","[{'version': 'v1', 'created': 'Tue, 13 Jan 2015 23:51:29 GMT'}]",2015-01-15,"[['Bansal', 'Piyush', ''], ['Bansal', 'Romil', ''], ['Varma', 'Vasudeva', '']]","['Hashtag Segmentation', 'Entity Linking', 'Entity Disambiguation', 'Information Extraction']"
17095,1003.3492,Weiguo Zhang,WeiGuo Zhang and GuoZhen Xiao,"Generalized Maiorana-McFarland Constructions for Almost Optimal
  Resilient Functions",18 pages,,,,cs.CR cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a recent paper \cite{Zhang-Xiao}, Zhang and Xiao describe a technique on
constructing almost optimal resilient functions on even number of variables. In
this paper, we will present an extensive study of the constructions of almost
optimal resilient functions by using the generalized Maiorana-McFarland (GMM)
construction technique. It is shown that for any given $m$, it is possible to
construct infinitely many $n$-variable ($n$ even), $m$-resilient Boolean
functions with nonlinearity equal to $2^{n-1}-2^{n/2-1}-2^{k-1}$ where $k<n/2$.
A generalized version of GMM construction is further described to obtain almost
optimal resilient functions with higher nonlinearity. We then modify the GMM
construction slightly to make the constructed functions satisfying strict
avalanche criterion (SAC). Furthermore we can obtain infinitely many new
resilient functions with nonlinearity $>2^{n-2}-2^{(n-1)/2}$ ($n$ odd) by using
Patterson-Wiedemann functions or Kavut-Y$\ddot{u}$cel functions. Finally, we
provide a GMM construction technique for multiple-output almost optimal
$m$-resilient functions $F: \mathbb{F}_2^n\mapsto \mathbb{F}_2^r$ ($n$ even)
with nonlinearity $>2^{n-1}-2^{n/2}$. Using the methods proposed in this paper,
a large class of previously unknown cryptographic resilient functions are
obtained.
","[{'version': 'v1', 'created': 'Wed, 17 Mar 2010 23:06:43 GMT'}]",2010-03-19,"[['Zhang', 'WeiGuo', ''], ['Xiao', 'GuoZhen', '']]","['Boolean functions', 'nonlinearity', 'resiliency', 'stream ciphers', 'strict avalanche criterion']"
17096,1003.3784,Uwe Aickelin,"Peer-Olaf Siebers, Uwe Aickelin, Helen Celia, Chris Clegg","Simulating Customer Experience and Word Of Mouth in Retail - A Case
  Study","32 pages, Simulation: Transactions of the Society for Modeling and
  Simulation International","Simulation: Transactions of the Society for Modeling and
  Simulation International, 86 (1), 5-30, 2010",,,cs.MA cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Agents offer a new and exciting way of understanding the world of work. In
this paper we describe the development of agent-based simulation models,
designed to help to understand the relationship between people management
practices and retail performance. We report on the current development of our
simulation models which includes new features concerning the evolution of
customers over time. To test the features we have conducted a series of
experiments dealing with customer pool sizes, standard and noise reduction
modes, and the spread of customers' word of mouth. To validate and evaluate our
model, we introduce new performance measure specific to retail operations. We
show that by varying different parameters in our model we can simulate a range
of customer experiences leading to significant differences in performance
measures. Ultimately, we are interested in better understanding the impact of
changes in staff behavior due to changes in store management practices. Our
multi-disciplinary research team draws upon expertise from work psychologists
and computer scientists. Despite the fact we are working within a relatively
novel and complex domain, it is clear that intelligent agents offer potential
for fostering sustainable organizational capabilities in the future.
","[{'version': 'v1', 'created': 'Fri, 19 Mar 2010 12:31:55 GMT'}]",2010-07-05,"[['Siebers', 'Peer-Olaf', ''], ['Aickelin', 'Uwe', ''], ['Celia', 'Helen', ''], ['Clegg', 'Chris', '']]","['agent-based modeling', 'agent-based simulation', 'retail performance', 'management practices', 'shopping behavior', 'customer satisfaction', 'word of mouth']"
17097,1603.06821,Steven Gortler,Hui Zhao and Steven J. Gortler,A Report on Shape Deformation with a Stretching and Bending Energy,,,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this report we describe a mesh editing system that we implemented that
uses a natural stretching and bending energy defined over smooth surfaces. As
such, this energy behaves uniformly under various mesh resolutions. All of the
elements of our approach already exist in the literature. We hope that our
discussions of these energies helps to shed light on the behaviors of these
methods and provides a unified discussion of these methods.
","[{'version': 'v1', 'created': 'Tue, 22 Mar 2016 15:14:21 GMT'}]",2016-03-23,"[['Zhao', 'Hui', ''], ['Gortler', 'Steven J.', '']]","['deformation energy', 'discrete differential geometry', 'rotation', 'digital geometry processing', 'elasticity', 'stretching and bending']"
17098,1412.7645,Hampei Sasahara,"Hampei Sasahara, Masaaki Nagahara, Kazunori Hayashi, and Yutaka
  yamamoto","Communication Performance Analysis of Sampled-Data H-infinity Optimal
  Coupling Wave Canceler","submitted to the SICE International Symposium on Control Systems
  2015, Dec. 2014; 2 pages, 4 figures",,,,cs.IT cs.SY math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this manuscript, we propose a design method of digital filters which
cancel coupling waves generated in single-frequency full-duplex wireless relay
stations by using the sampled-data H-infinity control theory. Simulation
results show effectiveness of the proposed method to communication performance
from a base station to a terminal.
","[{'version': 'v1', 'created': 'Wed, 24 Dec 2014 11:36:06 GMT'}]",2014-12-25,"[['Sasahara', 'Hampei', ''], ['Nagahara', 'Masaaki', ''], ['Hayashi', 'Kazunori', ''], ['yamamoto', 'Yutaka', '']]","['Wireless communication', 'Coupling waves', 'Sampled-data H∞ optimization', 'Relay station']"
17099,0704.2902,Stefan Pohl,"Stefan Pohl, Filip Radlinski and Thorsten Joachims",Recommending Related Papers Based on Digital Library Access Records,"2 pages, 3 postscript figures, to appear in proceedings of JCDL'07,
  additional and more detailed results can be found in arXiv:0704.2963v1",,,,cs.DL cs.IR,,"  An important goal for digital libraries is to enable researchers to more
easily explore related work. While citation data is often used as an indicator
of relatedness, in this paper we demonstrate that digital access records (e.g.
http-server logs) can be used as indicators as well. In particular, we show
that measures based on co-access provide better coverage than co-citation, that
they are available much sooner, and that they are more accurate for recent
papers.
","[{'version': 'v1', 'created': 'Mon, 23 Apr 2007 16:51:40 GMT'}]",2007-05-23,"[['Pohl', 'Stefan', ''], ['Radlinski', 'Filip', ''], ['Joachims', 'Thorsten', '']]","['Recommendations', 'co-citation', 'co-download', 'http access logs']"
17100,1312.3182,Prasanth G Narasimha-Shenoi,"Ram Kumar. R, Kannan Balakrishnan, Manoj Changat, A.Sreekumar,
  Prasanth G. Narasimha-Shenoi",On The Center Sets and Center Numbers of Some Graph Classes,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For a set $S$ of vertices and the vertex $v$ in a connected graph $G$,
$\displaystyle\max_{x \in S}d(x,v)$ is called the $S$-eccentricity of $v$ in
$G$. The set of vertices with minimum $S$-eccentricity is called the $S$-center
of $G$. Any set $A$ of vertices of $G$ such that $A$ is an $S$-center for some
set $S$ of vertices of $G$ is called a center set. We identify the center sets
of certain classes of graphs namely, Block graphs, $K_{m,n}$, $K_n-e$, wheel
graphs, odd cycles and symmetric even graphs and enumerate them for many of
these graph classes. We also introduce the concept of center number which is
defined as the number of distinct center sets of a graph and determine the
center number of some graph classes.
","[{'version': 'v1', 'created': 'Wed, 11 Dec 2013 14:20:55 GMT'}]",2013-12-12,"[['R', 'Ram Kumar.', ''], ['Balakrishnan', 'Kannan', ''], ['Changat', 'Manoj', ''], ['Sreekumar', 'A.', ''], ['Narasimha-Shenoi', 'Prasanth G.', '']]","['Center', 'Center Sets', 'Center Number', 'Symmetric Even Graphs', 'Block Graphs']"
17101,1704.07938,Tien Thanh Nguyen,"Tien Thanh Nguyen, Thi Thu Thuy Nguyen, Xuan Cuong Pham, Alan
  Wee-Chung Liew, James C. Bezdek",An ensemble-based online learning algorithm for streaming data,"19 pages, 3 figures",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, we introduce an ensemble-based approach for online machine
learning. The ensemble of base classifiers in our approach is obtained by
learning Naive Bayes classifiers on different training sets which are generated
by projecting the original training set to lower dimensional space. We propose
a mechanism to learn sequences of data using data chunks paradigm. The
experiments conducted on a number of UCI datasets and one synthetic dataset
demonstrate that the proposed approach performs significantly better than some
well-known online learning algorithms.
","[{'version': 'v1', 'created': 'Wed, 26 Apr 2017 00:33:36 GMT'}]",2017-04-27,"[['Nguyen', 'Tien Thanh', ''], ['Nguyen', 'Thi Thu Thuy', ''], ['Pham', 'Xuan Cuong', ''], ['Liew', 'Alan Wee-Chung', ''], ['Bezdek', 'James C.', '']]","['Online learning', 'ensemble method', 'multi classifiers system', 'random projection', 'Naïve Bayes']"
17102,1205.2285,Chi-Kin Chau,Lan Yu and Chi-Kin Chau,Complex-Demand Knapsack Problems and Incentives in AC Power Systems,"Appears in: Proceedings of the 12th International Conference on
  Autonomous Agents and Multiagent Systems (AAMAS 2013)",,,,cs.DS,http://creativecommons.org/licenses/by/3.0/,"  We consider AC electrical systems where each electrical device has a power
demand expressed as a complex number, and there is a limit on the magnitude of
total power supply. Motivated by this scenario, we introduce the complex-demand
knapsack problem (C-KP), a new variation of the traditional knapsack problem,
where each item is associated with a demand as a complex number, rather than a
real number often interpreted as weight or size of the item. While keeping the
same goal as to maximize the sum of values of the selected items, we put the
capacity limit on the magnitude of the sum of satisfied demands. For C-KP, we
prove its inapproximability by FPTAS (unless P = NP), as well as presenting a
(1/2-epsilon)-approximation algorithm. Furthermore, we investigate the selfish
multi-agent setting where each agent is in charge of one item, and an agent may
misreport the demand and value of his item for his own interest. We show a
simple way to adapt our approximation algorithm to be monotone, which is
sufficient for the existence of incentive compatible payments such that no
agent has an incentive to misreport. Our results shed insight on the design of
multi-agent systems for smart grid.
","[{'version': 'v1', 'created': 'Thu, 10 May 2012 14:59:58 GMT'}, {'version': 'v2', 'created': 'Sun, 26 Jan 2014 06:09:21 GMT'}]",2014-01-28,"[['Yu', 'Lan', ''], ['Chau', 'Chi-Kin', '']]","['knapsack problem', 'approximation algorithm', 'FPTAS', 'incentive compatibility', 'truthfulness', 'AC electrical system', 'smart grid']"
17103,1004.2993,Saumay Pushp,"Saumay Pushp, Priya Ranjan",Hybrid CDN structure with a P2P based streaming protocol,9 Pages,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the last decade, internet has seen an exponential increase in its
growth.With more and more people using it, efficient data delivery over the
internet has become a key issue. Peer-to-peer (P2P)/seed sharing based networks
have several desirable features for content distribution, such as low costs,
scalability, and fault tolerance. While the invention of each of such
specialized systems has improved the user experience, some fundamental
shortcomings of these systems have often been neglected. These shortcomings of
content distribution systems have become severe bottlenecks in scalability of
the internet.In order to combine the desired features of classical Content
Distribution Networks (CDNs) and P2P/seed sharing based networks, we propose a
hybrid CDN structure with a P2P/seed sharing based streaming protocol in the
access network . In this work, we focus on the problem of data redundancy (at
each node) and show how severely it impacts the network economics and the
experience of end-user and hence leads to low traffic load and redundancy
","[{'version': 'v1', 'created': 'Sun, 18 Apr 2010 03:34:47 GMT'}]",2010-04-20,"[['Pushp', 'Saumay', ''], ['Ranjan', 'Priya', '']]","['Multicast', 'Peer-to-Peer', 'congestion', 'contention']"
17104,1504.05159,Marek Szyku{\l}a,"Janusz Brzozowski, Marek Szyku{\l}a",Complexity of Suffix-Free Regular Languages,"27 pages, 7 figures, 2 tables",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study various complexity properties of suffix-free regular languages. The
quotient complexity of a regular language $L$ is the number of left quotients
of $L$; this is the same as the state complexity of $L$. A regular language
$L'$ is a dialect of a regular language $L$ if it differs only slightly from
$L$. The quotient complexity of an operation on regular languages is the
maximal quotient complexity of the result of the operation expressed as a
function of the quotient complexities of the operands. A sequence
$(L_k,L_{k+1},\dots)$ of regular languages in some class ${\mathcal C}$, where
$n$ is the quotient complexity of $L_n$, is called a stream. A stream is most
complex in class ${\mathcal C}$ if its languages $L_n$ meet the complexity
upper bounds for all basic measures. It is known that there exist such most
complex streams in the class of regular languages, in the class of prefix-free
languages, and also in the classes of right, left, and two-sided ideals. In
contrast to this, we prove that there does not exist a most complex stream in
the class of suffix-free regular languages. However, we do exhibit one ternary
suffix-free stream that meets the bound for product and whose restrictions to
binary alphabets meet the bounds for star and boolean operations. We also
exhibit a quinary stream that meets the bounds for boolean operations,
reversal, size of syntactic semigroup, and atom complexities. Moreover, we
solve an open problem about the bound for the product of two languages of
quotient complexities $m$ and $n$ in the binary case by showing that it can be
met for infinitely many $m$ and $n$.
","[{'version': 'v1', 'created': 'Mon, 20 Apr 2015 19:09:34 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Apr 2015 09:45:27 GMT'}, {'version': 'v3', 'created': 'Wed, 18 Nov 2015 20:23:35 GMT'}, {'version': 'v4', 'created': 'Mon, 12 Dec 2016 17:23:16 GMT'}]",2016-12-13,"[['Brzozowski', 'Janusz', ''], ['Szykuła', 'Marek', '']]","['most complex', 'regular language', 'state complexity', 'suffix-free', 'syntactic complexity', 'transition semigroup']"
17105,1410.1681,Guillaume Jourjon,"Thierry Rakotoarivelo, Guillaume Jourjon, Olivier Mehani, Maximilian
  Ott, Mike Zink",Repeatable Experiments with LabWiki,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ability to repeat the experiments from a research study and obtain
similar results is a corner stone in experiment-based scientific discovery.
This essential feature has been often ignored by the distributed computing and
networking community. There are many reasons for that, such as the complexity
of provisioning, configuring, and orchestrating the resources used by
experiments, their multiple external dependencies, and the difficulty to
seamlessly record these dependencies. This paper describes a methodology based
on well-established principles to plan, prepare and execute experiments. We
propose and describe a family of tools, the LabWiki workspace, to support an
experimenter's workflow based on that methodology. This proposed workspace
provides services and mechanisms for each step of an experiment-based study,
while automatically capturing the necessary information to allow others to
repeat, inspect, validate and modify prior experiments. Our LabWiki workspace
builds on existing contributions, and de-facto protocol and model standards,
which emerged from recent experimental facility initiatives. We use a real
experiment as a thread to guide and illustrate the discussion throughout this
paper.
","[{'version': 'v1', 'created': 'Tue, 7 Oct 2014 11:12:31 GMT'}]",2014-10-08,"[['Rakotoarivelo', 'Thierry', ''], ['Jourjon', 'Guillaume', ''], ['Mehani', 'Olivier', ''], ['Ott', 'Maximilian', ''], ['Zink', 'Mike', '']]","['reproducible experiments', 'testbeds', 'LabWiki', 'OMF', 'OML']"
17106,1406.6832,Michel Plantie,Michel Crampes and Michel Planti\'e,Overlapping Community Detection Optimization and Nash Equilibrium,Submitted to KDD,,,,cs.SI physics.soc-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Community detection using both graphs and social networks is the focus of
many algorithms. Recent methods aimed at optimizing the so-called modularity
function proceed by maximizing relations within communities while minimizing
inter-community relations.
  However, given the NP-completeness of the problem, these algorithms are
heuristics that do not guarantee an optimum. In this paper, we introduce a new
algorithm along with a function that takes an approximate solution and modifies
it in order to reach an optimum. This reassignment function is considered a
'potential function' and becomes a necessary condition to asserting that the
computed optimum is indeed a Nash Equilibrium. We also use this function to
simultaneously show partitioning and overlapping communities, two detection and
visualization modes of great value in revealing interesting features of a
social network. Our approach is successfully illustrated through several
experiments on either real unipartite, multipartite or directed graphs of
medium and large-sized datasets.
","[{'version': 'v1', 'created': 'Thu, 26 Jun 2014 10:28:36 GMT'}]",2014-06-27,"[['Crampes', 'Michel', ''], ['Plantié', 'Michel', '']]","['Community detection', 'Social networks', 'Nash Equilibrium']"
17107,1403.7315,Chuan Shi,"Yitong Li, Chuan Shi, Philip S. Yu, and Qing Chen","HRank: A Path based Ranking Framework in Heterogeneous Information
  Network","12 pages, 11 figures",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, there is a surge of interests on heterogeneous information network
analysis. As a newly emerging network model, heterogeneous information networks
have many unique features (e.g., complex structure and rich semantics) and a
number of interesting data mining tasks have been exploited in this kind of
networks, such as similarity measure, clustering, and classification. Although
evaluating the importance of objects has been well studied in homogeneous
networks, it is not yet exploited in heterogeneous networks. In this paper, we
study the ranking problem in heterogeneous networks and propose the HRank
framework to evaluate the importance of multiple types of objects and meta
paths. Since the importance of objects depends upon the meta paths in
heterogeneous networks, HRank develops a path based random walk process.
Moreover, a constrained meta path is proposed to subtly capture the rich
semantics in heterogeneous networks. Furthermore, HRank can simultaneously
determine the importance of objects and meta paths through applying the tensor
analysis. Extensive experiments on three real datasets show that HRank can
effectively evaluate the importance of objects and paths together. Moreover,
the constrained meta path shows its potential on mining subtle semantics by
obtaining more accurate ranking results.
","[{'version': 'v1', 'created': 'Fri, 28 Mar 2014 09:31:43 GMT'}]",2014-03-31,"[['Li', 'Yitong', ''], ['Shi', 'Chuan', ''], ['Yu', 'Philip S.', ''], ['Chen', 'Qing', '']]","['heterogeneous information network', 'rank', 'random walk', 'tensor analysis']"
17108,1504.03287,Mohammed Shafiul Alam Khan,"Mohammed Shafiul Alam Khan, Chris J Mitchell",Improving Air Interface User Privacy in Mobile Telephony,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although the security properties of 3G and 4G mobile networks have
significantly improved by comparison with 2G (GSM), significant shortcomings
remain with respect to user privacy. A number of possible modifications to 2G,
3G and 4G protocols have been proposed designed to provide greater user
privacy; however, they all require significant modifications to existing
deployed infrastructures, which are almost certainly impractical to achieve in
practice. In this article we propose an approach which does not require any
changes to the existing deployed network infrastructures or mobile devices, but
offers improved user identity protection over the air interface. The proposed
scheme makes use of multiple IMSIs for an individual USIM to offer a degree of
pseudonymity for a user. The only changes required are to the operation of the
authentication centre in the home network and to the USIM, and the scheme could
be deployed immediately since it is completely transparent to the existing
mobile telephony infrastructure. We present two different approaches to the use
and management of multiple IMSIs.
","[{'version': 'v1', 'created': 'Mon, 13 Apr 2015 18:23:53 GMT'}]",2015-04-14,"[['Khan', 'Mohammed Shafiul Alam', ''], ['Mitchell', 'Chris J', '']]","['User privacy threats', 'anonymity', 'multiple IMSIs USIM', 'mobile telephony']"
17109,1504.06320,Keith Wiley,"Keith B. Wiley, Randal A. Koene","The Fallacy of Favoring Gradual Replacement Mind Uploading Over
  Scan-and-Copy","14 pages, 0 figures","Wiley, K. B. and Koene, R. A. The Fallacy of Favoring Gradual
  Replacement Mind Uploading Over Scan-and-Copy. Journal of Consciousness
  Studies (JoCS), Vol. 23, No. 3-4, pp212-235, Mar 2016",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mind uploading speculation and debate often concludes that a procedure
described as gradual in-place replacement preserves personal identity while a
procedure described as destructive scan-and-copy produces some other identity
in the target substrate such that personal identity is lost along with the
biological brain. This paper demonstrates a chain of reasoning that establishes
metaphysical equivalence between these two methods in terms of preserving
personal identity.
","[{'version': 'v1', 'created': 'Thu, 23 Apr 2015 14:09:50 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Sep 2015 14:33:58 GMT'}, {'version': 'v3', 'created': 'Tue, 24 Nov 2015 18:04:53 GMT'}, {'version': 'v4', 'created': 'Mon, 17 Dec 2018 13:59:52 GMT'}]",2018-12-18,"[['Wiley', 'Keith B.', ''], ['Koene', 'Randal A.', '']]","['mind uploading', 'whole brain emulation', 'personal identity', 'metaphysics', 'scan', 'copy', 'replacement']"
17110,1602.06174,Adi Rosen,"Guy Even, Moti Medina, Adi Ros\'en","A Constant Approximation Algorithm for Scheduling Packets on Line
  Networks",,ESA 2016,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we improve the approximation ratio for the problem of
scheduling packets on line networks with bounded buffers, where the aim is that
of maximizing the throughput. Each node in the network has a local buffer of
bounded size $B$, and each edge (or link) can transmit a limited number, $c$,
of packets in every time unit. The input to the problem consists of a set of
packet requests, each defined by a source node, a destination node, and a
release time. We denote by $n$ the size of the network. A solution for this
problem is a schedule that delivers (some of the) packets to their destinations
without violating the capacity constraints of the network (buffers or edges).
Our goal is to design an efficient algorithm that computes a schedule that
maximizes the number of packets that arrive to their respective destinations.
  We give a randomized approximation algorithm with constant approximation
ratio for the case where $B=\Theta(c)$. This improves over the previously best
result of $O(\log^* n)$ (R\""acke and Ros\'en, Theory Comput. Syst., 49(4),
2011). Our improvement is based on a new combinatorial lemma that we prove,
stating, roughly speaking, that if packets are allowed to stay put in buffers
only a limited number of time steps, $2d$, where $d$ is the longest
source-destination distance of any input packet, then the cardinality of the
optimal solution is decreased by only a constant factor. This claim was not
previously known in the directed integral (i.e., unsplittable, zero-one) case,
and may find additional applications for routing and scheduling algorithms.
","[{'version': 'v1', 'created': 'Fri, 19 Feb 2016 15:06:11 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Sep 2020 12:36:10 GMT'}]",2020-09-30,"[['Even', 'Guy', ''], ['Medina', 'Moti', ''], ['Rosén', 'Adi', '']]","['Approximation algorithms', 'packet scheduling', 'admission control', 'randomized rounding', 'linear programming']"
17111,1109.6166,Yu Wu,"Yu Wu, Loc Bui, Ramesh Johari",Heavy Traffic Approximation of Equilibria in Resource Sharing Games,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a model of priced resource sharing that combines both queueing
behavior and strategic behavior. We study a priority service model where a
single server allocates its capacity to agents in proportion to their payment
to the system, and users from different classes act to minimize the sum of
their cost for processing delay and payment. As the exact processing time of
this system is hard to compute, we introduce the notion of heavy traffic
equilibrium as an approximation of the Nash equilibrium, derived by considering
the asymptotic regime where the system load approaches capacity. We discuss
efficiency and revenue, and in particular provide a bound for the price of
anarchy of the heavy traffic equilibrium.
","[{'version': 'v1', 'created': 'Wed, 28 Sep 2011 11:09:04 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Dec 2011 11:10:38 GMT'}, {'version': 'v3', 'created': 'Sat, 2 Jun 2012 17:42:52 GMT'}]",2012-06-05,"[['Wu', 'Yu', ''], ['Bui', 'Loc', ''], ['Johari', 'Ramesh', '']]","['resource sharing', 'discriminatory processor sharing', 'equilibrium', 'heavy traffic approxi']"
17112,1406.5554,Zahed Rahmati,"Zahed Rahmati, Valerie King, Sue Whitesides",Kinetic Reverse $k$-Nearest Neighbor Problem,,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper provides the first solution to the kinetic reverse $k$-nearest
neighbor (\rknn) problem in $\mathbb{R}^d$, which is defined as follows: Given
a set $P$ of $n$ moving points in arbitrary but fixed dimension $d$, an integer
$k$, and a query point $q\notin P$ at any time $t$, report all the points $p\in
P$ for which $q$ is one of the $k$-nearest neighbors of $p$.
","[{'version': 'v1', 'created': 'Fri, 20 Jun 2014 22:59:17 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Sep 2014 22:55:58 GMT'}]",2014-09-29,"[['Rahmati', 'Zahed', ''], ['King', 'Valerie', ''], ['Whitesides', 'Sue', '']]","['reverse k-nearest neighbor query', 'moving points', 'k-nearestneighbors', 'kinetic data structure', 'continuous monitoring', 'continuous queries']"
17113,1705.07877,Chen Chen,"Chen Chen, Changtong Luo, Zonglin Jiang",Block building programming for symbolic regression,Accepted for publication in Neurocomputing,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Symbolic regression that aims to detect underlying data-driven models has
become increasingly important for industrial data analysis. For most existing
algorithms such as genetic programming (GP), the convergence speed might be too
slow for large-scale problems with a large number of variables. This situation
may become even worse with increasing problem size. The aforementioned
difficulty makes symbolic regression limited in practical applications.
Fortunately, in many engineering problems, the independent variables in target
models are separable or partially separable. This feature inspires us to
develop a new approach, block building programming (BBP). BBP divides the
original target function into several blocks, and further into factors. The
factors are then modeled by an optimization engine (e.g. GP). Under such
circumstances, BBP can make large reductions to the search space. The partition
of separability is based on a special method, block and factor detection. Two
different optimization engines are applied to test the performance of BBP on a
set of symbolic regression problems. Numerical results show that BBP has a good
capability of structure and coefficient optimization with high computational
efficiency.
","[{'version': 'v1', 'created': 'Mon, 22 May 2017 17:42:10 GMT'}, {'version': 'v2', 'created': 'Tue, 23 May 2017 15:50:09 GMT'}, {'version': 'v3', 'created': 'Wed, 24 May 2017 14:57:15 GMT'}, {'version': 'v4', 'created': 'Sat, 28 Oct 2017 15:19:37 GMT'}]",2017-10-31,"[['Chen', 'Chen', ''], ['Luo', 'Changtong', ''], ['Jiang', 'Zonglin', '']]","['Symbolic regression', 'Separable function', 'Block building programming', 'Geneticprogramming']"
17114,1707.08458,Ekaterina Vylomova,"Ekaterina Vylomova, Andrei Shcherbakov, Yuriy Philippovich, Galina
  Cherkasova","Men Are from Mars, Women Are from Venus: Evaluation and Modelling of
  Verbal Associations",AIST 2017 camera-ready,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a quantitative analysis of human word association pairs and study
the types of relations presented in the associations. We put our main focus on
the correlation between response types and respondent characteristics such as
occupation and gender by contrasting syntagmatic and paradigmatic associations.
Finally, we propose a personalised distributed word association model and show
the importance of incorporating demographic factors into the models commonly
used in natural language processing.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 14:20:12 GMT'}]",2017-07-27,"[['Vylomova', 'Ekaterina', ''], ['Shcherbakov', 'Andrei', ''], ['Philippovich', 'Yuriy', ''], ['Cherkasova', 'Galina', '']]","['associative experiments', 'sociolinguistics', 'language models', 'word associations']"
17115,1406.3191,Hadi Fanaee-T,Hadi Fanaee-T and Joao Gama,An eigenvector-based hotspot detection,,"In Proceedings of 16th Portuguese Conference on Artificial
  Intelligence (EPIA 2013), Acores, Portugal, 9-12 September 2013, PP. 290-301",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Space and time are two critical components of many real world systems. For
this reason, analysis of anomalies in spatiotemporal data has been a great of
interest. In this work, application of tensor decomposition and eigenspace
techniques on spatiotemporal hotspot detection is investigated. An algorithm
called SST-Hotspot is proposed which accounts for spatiotemporal variations in
data and detect hotspots using matching of eigenvector elements of two cases
and population tensors. The experimental results reveal the interesting
application of tensor decomposition and eigenvector-based techniques in hotspot
analysis.
","[{'version': 'v1', 'created': 'Thu, 12 Jun 2014 10:55:08 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Jun 2014 10:44:49 GMT'}]",2014-06-16,"[['Fanaee-T', 'Hadi', ''], ['Gama', 'Joao', '']]","['Hotspot analysis', 'Tensor decomposition', 'Spatiotemporal data']"
17116,1610.03477,Carlos Barron-Romero Prof.,Carlos Barr\'on-Romero,"Complexity and Stop Conditions for NP as General Assignment Problems,
  the Travel Salesman Problem in $\mathbb{R}^2$, Knight Tour Problem and
  Boolean Satisfiability Problem",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents stop conditions for solving General Assignment Problems
(GAP), in particular for Travel Salesman Problem in an Euclidian 2D space the
well known condition Jordan's simple curve and opposite condition for the
Knight Tour Problem. The Jordan's simple curve condition means that a optimal
trajectory must be simple curve, i.e., without crossing but for Knight Tour
Problem we use the contrary, the feasible trajectory must have crossing in all
cities of the tour. The paper presents the algorithms, examples and some
results come from Concorde's Home page. Several problem are studied to depict
their properties. A classical decision problem SAT is studied in detail.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2016 03:55:53 GMT'}]",2016-10-12,"[['Barrón-Romero', 'Carlos', '']]","['Algorithms', 'TSP', 'NP', 'Numerical optimization']"
17117,1307.4567,Michael Lange,"Michael Lange and Gerard Gorman and Michele Weiland and Lawrence
  Mitchell and Xiaohu Guo and James Southern","Benchmarking mixed-mode PETSc performance on high-performance
  architectures",arXiv admin note: substantial text overlap with arXiv:1303.5275,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The trend towards highly parallel multi-processing is ubiquitous in all
modern computer architectures, ranging from handheld devices to large-scale HPC
systems; yet many applications are struggling to fully utilise the multiple
levels of parallelism exposed in modern high-performance platforms. In order to
realise the full potential of recent hardware advances, a mixed-mode between
shared-memory programming techniques and inter-node message passing can be
adopted which provides high-levels of parallelism with minimal overheads. For
scientific applications this entails that not only the simulation code itself,
but the whole software stack needs to evolve. In this paper, we evaluate the
mixed-mode performance of PETSc, a widely used scientific library for the
scalable solution of partial differential equations. We describe the addition
of OpenMP threaded functionality to the library, focusing on sparse
matrix-vector multiplication. We highlight key challenges in achieving good
parallel performance, such as explicit communication overlap using task-based
parallelism, and show how to further improve performance by explicitly load
balancing threads within MPI processes. Using a set of matrices extracted from
Fluidity, a CFD application code which uses the library as its linear solver
engine, we then benchmark the parallel performance of mixed-mode PETSc across
multiple nodes on several modern HPC architectures. We evaluate the parallel
scalability on Uniform Memory Access (UMA) systems, such as the Fujitsu
PRIMEHPC FX10 and IBM BlueGene/Q, as well as a Non-Uniform Memory Access (NUMA)
Cray XE6 platform. A detailed comparison is performed which highlights the
characteristics of each particular architecture, before demonstrating efficient
strong scalability of sparse matrix-vector multiplication with significant
speedups over the pure-MPI mode.
","[{'version': 'v1', 'created': 'Wed, 17 Jul 2013 10:36:35 GMT'}]",2013-07-19,"[['Lange', 'Michael', ''], ['Gorman', 'Gerard', ''], ['Weiland', 'Michele', ''], ['Mitchell', 'Lawrence', ''], ['Guo', 'Xiaohu', ''], ['Southern', 'James', '']]","['PETSc', 'hybrid MPI/OpenMP', 'strong scaling', 'task-based parallelism', 'hierarchical load balancing', 'sparse matrix-vectormultiply']"
17118,1110.1796,Dipnarayan Ray,"Dip Narayan Ray, Somajyoti Majumder, Sumit Mukhopadhyay","A Behavior-based Approach for Multi-agent Q-learning for Autonomous
  Exploration",15 pages;(ISSN:2045-8711),"International Journal of Innovative Technology & Creative
  Engineering, Vol.1 No.7 July 2011, page 1-15",,,cs.RO cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of mobile robots is being popular over the world mainly for
autonomous explorations in hazardous/ toxic or unknown environments. This
exploration will be more effective and efficient if the explorations in unknown
environment can be aided with the learning from past experiences. Currently
reinforcement learning is getting more acceptances for implementing learning in
robots from the system-environment interactions. This learning can be
implemented using the concept of both single-agent and multiagent. This paper
describes such a multiagent approach for implementing a type of reinforcement
learning using a priority based behaviour-based architecture. This proposed
methodology has been successfully tested in both indoor and outdoor
environments.
","[{'version': 'v1', 'created': 'Sun, 9 Oct 2011 06:16:57 GMT'}]",2011-10-11,"[['Ray', 'Dip Narayan', ''], ['Majumder', 'Somajyoti', ''], ['Mukhopadhyay', 'Sumit', '']]","['Multiagent', 'Reinforcement learning', 'Qlearning', 'Behavior-based robotics', 'Autonomous exploration']"
17119,1105.3685,Afzal  Godil,"Afzal Godil, Zhouhui Lian, Helin Dutagaci, Rui Fang, Vanamali T.P.,
  Chun Pan Cheung","Benchmarks, Performance Evaluation and Contests for 3D Shape Retrieval","Performance Metrics for Intelligent Systems (PerMIS'10) Workshop,
  September, 2010",,,,cs.CV cs.CG,http://creativecommons.org/licenses/publicdomain/,"  Benchmarking of 3D Shape retrieval allows developers and researchers to
compare the strengths of different algorithms on a standard dataset. Here we
describe the procedures involved in developing a benchmark and issues involved.
We then discuss some of the current 3D shape retrieval benchmarks efforts of
our group and others. We also review the different performance evaluation
measures that are developed and used by researchers in the community. After
that we give an overview of the 3D shape retrieval contest (SHREC) tracks run
under the EuroGraphics Workshop on 3D Object Retrieval and give details of
tracks that we organized for SHREC 2010. Finally we demonstrate some of the
results based on the different SHREC contest tracks and the NIST shape
benchmark.
","[{'version': 'v1', 'created': 'Wed, 18 May 2011 16:48:47 GMT'}]",2011-05-19,"[['Godil', 'Afzal', ''], ['Lian', 'Zhouhui', ''], ['Dutagaci', 'Helin', ''], ['Fang', 'Rui', ''], ['P.', 'Vanamali T.', ''], ['Cheung', 'Chun Pan', '']]","['3D Shape retrieval', 'benchmarks', 'performance evaluation measures', 'contests']"
17120,1511.07732,Thiago Santini,"Thiago Santini, Wolfgang Fuhl, Thomas K\""ubler, and Enkelejda Kasneci","Bayesian Identification of Fixations, Saccades, and Smooth Pursuits",8 pages,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smooth pursuit eye movements provide meaningful insights and information on
subject's behavior and health and may, in particular situations, disturb the
performance of typical fixation/saccade classification algorithms. Thus, an
automatic and efficient algorithm to identify these eye movements is paramount
for eye-tracking research involving dynamic stimuli. In this paper, we propose
the Bayesian Decision Theory Identification (I-BDT) algorithm, a novel
algorithm for ternary classification of eye movements that is able to reliably
separate fixations, saccades, and smooth pursuits in an online fashion, even
for low-resolution eye trackers. The proposed algorithm is evaluated on four
datasets with distinct mixtures of eye movements, including fixations,
saccades, as well as straight and circular smooth pursuits; data was collected
with a sample rate of 30 Hz from six subjects, totaling 24 evaluation datasets.
The algorithm exhibits high and consistent performance across all datasets and
movements relative to a manual annotation by a domain expert (recall: \mu =
91.42%, \sigma = 9.52%; precision: \mu = 95.60%, \sigma = 5.29%; specificity
\mu = 95.41%, \sigma = 7.02%) and displays a significant improvement when
compared to I-VDT, an state-of-the-art algorithm (recall: \mu = 87.67%, \sigma
= 14.73%; precision: \mu = 89.57%, \sigma = 8.05%; specificity \mu = 92.10%,
\sigma = 11.21%). For algorithm implementation and annotated datasets, please
contact the first author.
","[{'version': 'v1', 'created': 'Tue, 24 Nov 2015 14:40:05 GMT'}]",2015-11-25,"[['Santini', 'Thiago', ''], ['Fuhl', 'Wolfgang', ''], ['Kübler', 'Thomas', ''], ['Kasneci', 'Enkelejda', '']]","['smooth pursuit', 'eye-tracking', 'probabilistic', 'model', 'online', 'classification', 'dynamic stimuli', 'open-source']"
17121,1512.01400,Haibing Wu,Haibing Wu and Xiaodong Gu,Max-Pooling Dropout for Regularization of Convolutional Neural Networks,"The journal version of this paper [arXiv:1512.00242] has been
  published in Neural Networks,
  http://www.sciencedirect.com/science/article/pii/S0893608015001446",,,,cs.LG cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, dropout has seen increasing use in deep learning. For deep
convolutional neural networks, dropout is known to work well in fully-connected
layers. However, its effect in pooling layers is still not clear. This paper
demonstrates that max-pooling dropout is equivalent to randomly picking
activation based on a multinomial distribution at training time. In light of
this insight, we advocate employing our proposed probabilistic weighted
pooling, instead of commonly used max-pooling, to act as model averaging at
test time. Empirical evidence validates the superiority of probabilistic
weighted pooling. We also compare max-pooling dropout and stochastic pooling,
both of which introduce stochasticity based on multinomial distributions at
pooling stage.
","[{'version': 'v1', 'created': 'Fri, 4 Dec 2015 13:18:37 GMT'}]",2015-12-07,"[['Wu', 'Haibing', ''], ['Gu', 'Xiaodong', '']]","['Deep learning', 'convolutional neural network', 'max-pooling dropout']"
17122,1702.05361,Hamidou Tembine,Giulia Rossi and Alain Tcheukam and Hamidou Tembine,Empathy in One-Shot Prisoner Dilemma,46 pages,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Strategic decision making involves affective and cognitive functions like
reasoning, cognitive and emotional empathy which may be subject to age and
gender differences. However, empathy-related changes in strategic
decision-making and their relation to age, gender and neuropsychological
functions have not been studied widely. In this article, we study a one-shot
prisoner dilemma from a psychological game theory viewpoint. Forty seven
participants (28 women and 19 men), aged 18 to 42 years, were tested with a
empathy questionnaire and a one-shot prisoner dilemma questionnaire comprising
a closiness option with the other participant. The percentage of cooperation
and defection decisions was analyzed. A new empathetic payoff model was
calculated to fit the observations from the test whether multi-dimensional
empathy levels matter in the outcome. A significant level of cooperation is
observed in the experimental one-shot game. The collected data suggests that
perspective taking, empathic concern and fantasy scale are strongly correlated
and have an important effect on cooperative decisions. However, their effect in
the payoff is not additive. Mixed scales as well as other non-classified
subscales (25+8 out of 47) were observed from the data.
","[{'version': 'v1', 'created': 'Fri, 17 Feb 2017 14:38:42 GMT'}, {'version': 'v2', 'created': 'Sat, 25 Feb 2017 09:20:25 GMT'}]",2017-02-28,"[['Rossi', 'Giulia', ''], ['Tcheukam', 'Alain', ''], ['Tembine', 'Hamidou', '']]","['Empathy', 'other-regarding payoff', 'cooperation']"
17123,1401.5602,Laurent Najman,"Fabio Dias (LIGM), Jean Cousty (LIGM), Laurent Najman (LIGM)","Dimensional operators for mathematical morphology on simplicial
  complexes",Pattern Recognition Letters (2014) To appear,,,,cs.DM math.AT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we study the framework of mathematical morphology on simplicial
complex spaces. Simplicial complexes are widely used to represent
multidimensional data, such as meshes, that are two dimensional complexes, or
graphs, that can be interpreted as one dimensional complexes. Mathematical
morphology is one of the most powerful frameworks for image processing,
including the processing of digital structures, and is heavily used for many
applications. However, mathematical morphology operators on simplicial complex
spaces is not a concept fully developed in the literature. Specifically, we
explore properties of the dimensional operators, small, versatile operators
that can be used to define new operators on simplicial complexes, while
maintaining properties from mathematical morphology. These operators can also
be used to recover many morphological operators from the literature. Matlab
code and additional material, including the proofs of the original properties,
are freely available at
\url{https://code.google.com/p/math-morpho-simplicial-complexes.}
","[{'version': 'v1', 'created': 'Wed, 22 Jan 2014 09:56:25 GMT'}]",2014-01-23,"[['Dias', 'Fabio', '', 'LIGM'], ['Cousty', 'Jean', '', 'LIGM'], ['Najman', 'Laurent', '', 'LIGM']]","['Mathematical morphology', 'simplicial complexes', 'granulometries', 'alternating sequential filters', 'imagefiltering']"
17124,1506.02128,Rua-Huan Tsaih Dr.,"Wen-Jan Chang, Rua-HuanTsaih, David C. Yen, Tzu-Shian Han",The ICT predicament of new ICT-enabled service,,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The advancement of information and communication technologies (ICT) has
triggered many ICT-enabled services. Regarding this service, the complementary
ICT system involves with customers' devices, industry-wide ICT development and
nation-wide ICT infrastructure, which are difficult for any individual
organization to control. The ICT predicament is the phenomenon that the
complementary ICT system is inferior in delivering the promised service quality
of new ICT-enabled service. With the ICT predicament, companies face the
decision-making dilemma in launching the new service or postponing the launch.
This study proposes a process to resolve the decision-making dilemma regarding
the ICT predicament.
","[{'version': 'v1', 'created': 'Sat, 6 Jun 2015 08:47:48 GMT'}]",2015-06-09,"[['Chang', 'Wen-Jan', ''], ['Rua-HuanTsaih', '', ''], ['Yen', 'David C.', ''], ['Han', 'Tzu-Shian', '']]","['ICT predicament', 'Radical innovation', 'ICT-enabled service', 'complementary ICT system', 'iPalace channel']"
17125,1501.05547,David Manlove,"Katarina Cechlarova, Tamas Fleiner, David F. Manlove, Iain McBride",Stable matchings of teachers to schools,15 pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several countries successfully use centralized matching schemes for school or
higher education assignment, or for entry-level labour markets. In this paper
we explore the computational aspects of a possible similar scheme for assigning
teachers to schools. Our model is motivated by a particular characteristic of
the education system in many countries where each teacher specializes in two
subjects. We seek stable matchings, which ensure that no teacher and school
have the incentive to deviate from their assignments. Indeed we propose two
stability definitions depending on the precise format of schools' preferences.
If the schools' ranking of applicants is independent of their subjects of
specialism, we show that the problem of deciding whether a stable matching
exists is NP-complete, even if there are only three subjects, unless there are
master lists of applicants or of schools. By contrast, if the schools may order
applicants differently in each of their specialization subjects, the problem of
deciding whether a stable matching exists is NP-complete even in the presence
of subject-specific master lists plus a master list of schools. Finally, we
prove a strong inapproximability result for the problem of finding a matching
with the minimum number of blocking pairs with respect to both stability
definitions.
","[{'version': 'v1', 'created': 'Thu, 22 Jan 2015 16:02:16 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Jan 2015 10:40:15 GMT'}]",2015-01-26,"[['Cechlarova', 'Katarina', ''], ['Fleiner', 'Tamas', ''], ['Manlove', 'David F.', ''], ['McBride', 'Iain', '']]","['stable matchings', 'serial dictatorship', 'NP-completeness', 'polynomial-timealgorithm', 'inapproximability']"
17126,1407.3552,Shuotian Bai,"Shuotian Bai, Rui Gao, Bibo Hao, Sha Yuan, and Tingshao Zhu",Identifying Social Satisfaction from Social Media,"8 pages, 2 figures",,,,cs.CY cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We demonstrate the critical need to identify social situation and instability
factors by acquiring public social satisfaction in this research. However,
subject to the large amount of manual work cost in subject recruitment and data
processing, conventional self-reported method cannot be implemented in real
time or applied in large scale investigation. To solve the problem, this paper
proposed an approach to predict users' social satisfaction, especially for the
economy-related satisfaction based on users' social media records. We recruited
2,018 Cantonese active participants from each city in Guangdong province
according to the population distribution. Both behavioral and linguistic
features of the participants are extracted from the online records of social
media, i.e., Sina Weibo. Regression models are used to predict Sina Weibo
users' social satisfaction. Furthermore, we consult the economic indexes of
Guangdong in 2012, and calculate the correlations between these indexes and the
predicted social satisfaction. Results indicate that social satisfaction can be
significantly expressed by specific social media features; local economy
satisfaction has significant positive correlations with several local economy
indexes, which supports that it is reliable to predict social satisfaction from
social media.
","[{'version': 'v1', 'created': 'Mon, 14 Jul 2014 07:36:45 GMT'}]",2014-07-15,"[['Bai', 'Shuotian', ''], ['Gao', 'Rui', ''], ['Hao', 'Bibo', ''], ['Yuan', 'Sha', ''], ['Zhu', 'Tingshao', '']]","['Social satisfaction', 'economy indexes', 'social media', 'prediction']"
17127,1406.5720,James Alderman,"James Alderman, Carlos Cid, Jason Crampton and Christian Janson","Publicly Verifiable Outsourced Computation with a Key Distribution
  Centre",Conference version,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The combination of software-as-a-service and the increasing use of mobile
devices gives rise to a considerable difference in computational power between
servers and clients. Thus, there is a desire for clients to outsource the
evaluation of complex functions to a server and to be able to verify that the
resulting value is correct. Previous work in this area of Publicly Verifiable
Outsourced Computation (PVC) requires a costly pre-processing stage. However,
in many practical situations multiple clients will be interested in the same
set of core functions and will make use of the same servers. Thus, the
pre-processing phase may be performed many more times than is necessary. In
this paper we introduce a Key Distribution Center (KDC) that handles the
generation and distribution of the keys that are required to support PVC,
thereby eliminating this redundancy. We define a number of new security models
and functionalities that arise with the introduction of the KDC, and present a
construction of such a scheme built upon Key-Policy Attribute-based Encryption.
","[{'version': 'v1', 'created': 'Sun, 22 Jun 2014 12:54:51 GMT'}]",2014-06-24,"[['Alderman', 'James', ''], ['Cid', 'Carlos', ''], ['Crampton', 'Jason', ''], ['Janson', 'Christian', '']]","['Publicly Verifiable Outsourced Computation', 'Key DistributionCenter', 'Key-policy Attribute-based Encryption', 'Revocation']"
17128,1605.00252,Nishant Mehta,"Peter D. Gr\""unwald and Nishant A. Mehta","Fast Rates for General Unbounded Loss Functions: from ERM to Generalized
  Bayes",accepted to JMLR pending minor final modifications,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present new excess risk bounds for general unbounded loss functions
including log loss and squared loss, where the distribution of the losses may
be heavy-tailed. The bounds hold for general estimators, but they are optimized
when applied to $\eta$-generalized Bayesian, MDL, and empirical risk
minimization estimators. In the case of log loss, the bounds imply convergence
rates for generalized Bayesian inference under misspecification in terms of a
generalization of the Hellinger metric as long as the learning rate $\eta$ is
set correctly. For general loss functions, our bounds rely on two separate
conditions: the $v$-GRIP (generalized reversed information projection)
conditions, which control the lower tail of the excess loss; and the newly
introduced witness condition, which controls the upper tail. The parameter $v$
in the $v$-GRIP conditions determines the achievable rate and is akin to the
exponent in the Tsybakov margin condition and the Bernstein condition for
bounded losses, which the $v$-GRIP conditions generalize; favorable $v$ in
combination with small model complexity leads to $\tilde{O}(1/n)$ rates. The
witness condition allows us to connect the excess risk to an ""annealed"" version
thereof, by which we generalize several previous results connecting Hellinger
and R\'enyi divergence to KL divergence.
","[{'version': 'v1', 'created': 'Sun, 1 May 2016 13:35:15 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Dec 2017 07:39:14 GMT'}, {'version': 'v3', 'created': 'Wed, 5 Sep 2018 16:26:22 GMT'}, {'version': 'v4', 'created': 'Tue, 5 Nov 2019 18:36:02 GMT'}]",2019-11-06,"[['Grünwald', 'Peter D.', ''], ['Mehta', 'Nishant A.', '']]","['statistical learning theory', 'fast rates', 'PAC-Bayes', 'misspecification', 'generalized Bayes']"
17129,1008.1825,Yaser Miaji PhD,Yaser Miaji and Suhaidi Hassan,Breaking the Legend: Maxmin Fairness notion is no longer effective,8 Pages,"International journal on applications of graph theory in wireless
  ad hoc networks and sensor networks(GRAPH-HOC) Vol.2, No.2, June 2010",,UUM-2010-1,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we analytically propose an alternative approach to achieve
better fairness in scheduling mechanisms which could provide better quality of
service particularly for real time application. Our proposal oppose the
allocation of the bandwidth which adopted by all previous scheduling mechanism.
It rather adopt the opposition approach be proposing the notion of
Maxmin-charge which fairly distribute the congestion. Furthermore, analytical
proposition of novel mechanism named as Just Queueing is been demonstrated.
","[{'version': 'v1', 'created': 'Wed, 11 Aug 2010 03:02:51 GMT'}]",2010-08-12,"[['Miaji', 'Yaser', ''], ['Hassan', 'Suhaidi', '']]","['scheduling mechanism', 'Queueing', 'Maxmin', 'WFQ']"
17130,1609.06281,Sou-Chi Chang,"Sou-Chi Chang, Sasikanth Manipatruni, Dmitri E. Nikonov, Ian A. Young,
  and Azad Naeemi","Low-power Spin Valve Logic using Spin-transfer Torque with Automotion of
  Domain Walls",9 pages,,,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel scheme for non-volatile digital computation is proposed using
spin-transfer torque (STT) and automotion of magnetic domain walls (DWs). The
basic computing element is composed of a lateral spin valve (SV) with two
ferromagnetic (FM) wires served as interconnects, where DW automotion is used
to propagate the information from one device to another. The non-reciprocity of
both device and interconnect is realized by sizing different contact areas at
the input and the output as well as enhancing the local damping mechanism. The
proposed logic is suitable for scaling due to a high energy barrier provided by
a long FM wire. Compared to the scheme based on non-local spin valves (NLSVs)
in the previous proposal, the devices can be operated at lower current density
due to utilizing all injected spins for local magnetization reversals, and thus
improve both energy efficiency and resistance to electromigration. This device
concept is justified by simulating a buffer, an inverter, and a 3-input
majority gate with comprehensive numerical simulations, including spin
transport through the FM/non-magnetic (NM) interfaces as well as the NM channel
and stochastic magnetization dynamics inside FM wires. In addition to digital
computing, the proposed framework can also be used as a transducer between DWs
and spin currents for higher wiring flexibility in the interconnect network.
","[{'version': 'v1', 'created': 'Tue, 20 Sep 2016 18:27:03 GMT'}]",2016-09-21,"[['Chang', 'Sou-Chi', ''], ['Manipatruni', 'Sasikanth', ''], ['Nikonov', 'Dmitri E.', ''], ['Young', 'Ian A.', ''], ['Naeemi', 'Azad', '']]","['spin-transfer torque', 'domain wall', 'digital logic']"
17131,1206.3877,Gregory Kucherov,"Gregory Kucherov, Lilla T\'othm\'er\'esz, St\'ephane Vialette",On the combinatorics of suffix arrays,,,,,cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove several combinatorial properties of suffix arrays, including a
characterization of suffix arrays through a bijection with a certain
well-defined class of permutations. Our approach is based on the
characterization of Burrows-Wheeler arrays given in [1], that we apply by
reducing suffix sorting to cyclic shift sorting through the use of an
additional sentinel symbol. We show that the characterization of suffix arrays
for a special case of binary alphabet given in [2] easily follows from our
characterization. Based on our results, we also provide simple proofs for the
enumeration results for suffix arrays, obtained in [3]. Our approach to
characterizing suffix arrays is the first that exploits their relationship with
Burrows-Wheeler permutations.
","[{'version': 'v1', 'created': 'Mon, 18 Jun 2012 10:30:02 GMT'}]",2012-06-19,"[['Kucherov', 'Gregory', ''], ['Tóthmérész', 'Lilla', ''], ['Vialette', 'Stéphane', '']]","['combinatorics', 'permutations', 'suffix array', 'Burrows-Wheeler transform']"
17132,1108.5985,Luis Pe\~naranda,"Ioannis Z. Emiris, Vissarion Fisikopoulos, Christos Konaxis, Luis
  Pe\~naranda","An Oracle-based, Output-sensitive Algorithm for Projections of Resultant
  Polytopes","27 pages, 7 figures, 4 tables. In IJCGA (invited papers from SoCG
  '12)",,,,cs.SC cs.CG,http://creativecommons.org/licenses/by/3.0/,"  We design an algorithm to compute the Newton polytope of the resultant, known
as resultant polytope, or its orthogonal projection along a given direction.
The resultant is fundamental in algebraic elimination, optimization, and
geometric modeling. Our algorithm exactly computes vertex- and
halfspace-representations of the polytope using an oracle producing resultant
vertices in a given direction, thus avoiding walking on the polytope whose
dimension is alpha-n-1, where the input consists of alpha points in Z^n. Our
approach is output-sensitive as it makes one oracle call per vertex and facet.
It extends to any polytope whose oracle-based definition is advantageous, such
as the secondary and discriminant polytopes. Our publicly available
implementation uses the experimental CGAL package triangulation. Our method
computes 5-, 6- and 7-dimensional polytopes with 35K, 23K and 500 vertices,
respectively, within 2hrs, and the Newton polytopes of many important surface
equations encountered in geometric modeling in <1sec, whereas the corresponding
secondary polytopes are intractable. It is faster than tropical geometry
software up to dimension 5 or 6. Hashing determinantal predicates accelerates
execution up to 100 times. One variant computes inner and outer approximations
with, respectively, 90% and 105% of the true volume, up to 25 times faster.
","[{'version': 'v1', 'created': 'Tue, 30 Aug 2011 15:38:54 GMT'}, {'version': 'v2', 'created': 'Mon, 5 Dec 2011 12:04:16 GMT'}, {'version': 'v3', 'created': 'Thu, 29 Mar 2012 13:40:54 GMT'}, {'version': 'v4', 'created': 'Thu, 25 Apr 2013 17:47:52 GMT'}]",2013-04-26,"[['Emiris', 'Ioannis Z.', ''], ['Fisikopoulos', 'Vissarion', ''], ['Konaxis', 'Christos', ''], ['Peñaranda', 'Luis', '']]","['General Dimension', 'Convex Hull', 'Regular Triangulation', 'Secondary Polytope', 'Resultant', 'CGAL Implementation', 'Experimental Complexity']"
17133,0804.1974,Nitin Saxena,"G\'abor Ivanyos, Marek Karpinski, Nitin Saxena",Schemes for Deterministic Polynomial Factoring,"14 pages, preliminary version",,,,cs.CC cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we relate the deterministic complexity of factoring polynomials
(over finite fields) to certain combinatorial objects we call m-schemes. We
extend the known conditional deterministic subexponential time polynomial
factoring algorithm for finite fields to get an underlying m-scheme. We
demonstrate how the properties of m-schemes relate to improvements in the
deterministic complexity of factoring polynomials over finite fields assuming
the generalized Riemann Hypothesis (GRH). In particular, we give the first
deterministic polynomial time algorithm (assuming GRH) to find a nontrivial
factor of a polynomial of prime degree n where (n-1) is a smooth number.
","[{'version': 'v1', 'created': 'Fri, 11 Apr 2008 23:04:17 GMT'}]",2008-04-15,"[['Ivanyos', 'Gábor', ''], ['Karpinski', 'Marek', ''], ['Saxena', 'Nitin', '']]","['Polynomials', 'Factoring', 'Deterministic', 'Schemes', 'GRH']"
17134,1406.3943,Chandra Sekhar Mr,"Mrudula Sarvabhatla, M.Giri, Chandra Sekhar Vorugunti","Cryptanalysis of Cryptanalysis and Improvement of Yan et al
  Biometric-Based Authentication Scheme for TMIS",arXiv admin note: text overlap with arXiv:1309.4944 by other authors,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Remote user authentication is critical requirement in Telecare Medicine
Information System (TMIS) to protect the patient personal details, security and
integrity of the critical medical records of the patient as the patient data is
transmitted over insecure public communication channel called Internet. In
2013, Yan proposed a biometric based remote user authentication scheme and
claimed that his scheme is secure. Recently, Dheerendra et al. demonstrated
some drawbacks in Yan et al scheme and proposed an improved scheme to erase the
drawbacks of Yan et al scheme. We analyze Dheerendra et al scheme and identify
that their scheme is vulnerable to off-line identity guessing attack, and on
successfully mounting it, the attacker can perfom all major cryptographic
attacks.
","[{'version': 'v1', 'created': 'Mon, 16 Jun 2014 09:06:57 GMT'}]",2014-06-17,"[['Sarvabhatla', 'Mrudula', ''], ['Giri', 'M.', ''], ['Vorugunti', 'Chandra Sekhar', '']]","['TMIS', 'Tele Medicine', 'Identity guessing attack', 'User Authentication']"
17135,1401.2778,Loet Leydesdorff,"Loet Leydesdorff, Floortje Alkemade, Gaston Heimeriks, and Rinke
  Hoekstra","Patents as Instruments for Exploring Innovation Dynamics: Geographic and
  Technological Perspectives on ""Photovoltaic Cells""","accepted for publication in Scientometrics on September 10, 2014",,,,cs.CY cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The dynamics of innovation are nonlinear and complex: geographical,
technological, and economic selection environments can be expected to interact.
Can patents provide an analytical lens to this process in terms of different
attributes such as inventor addresses, classification codes, backward and
forward citations, etc.? Two recently developed patent maps with interactive
overlay techniques--Google Maps and maps based on citation relations among
International Patent Classifications (IPC)--are elaborated into dynamic
versions that allow for online animations and comparisons by using split
screens. Various forms of animation are explored. The recently developed
Cooperative Patent Classifications (CPC) of the U.S. Patent and Trade Office
(USPTO) and the European Patent Office (EPO) provide new options for a precise
delineation of samples in both USPTO data and the Worldwide Patent Statistics
Database (PatStat) of EPO. Among the ""technologies for the mitigation of
climate change"" (class Y02), we zoom in on nine material technologies for
photovoltaic cells; and focus on one of them (CuInSe2) as a lead case. The
longitudinal development of Rao-Stirling diversity in the IPC-based maps
provides a heuristics for studying technological generations during the period
under study (1975-2012). The sequencing of generations prevails in USPTO data
more than in PatStat data because PatStat aggregates patent information from
countries in different stages of technological development, whereas one can
expect USPTO patents to be competitive at the technological edge.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2014 10:43:40 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Sep 2014 14:47:39 GMT'}]",2014-09-11,"[['Leydesdorff', 'Loet', ''], ['Alkemade', 'Floortje', ''], ['Heimeriks', 'Gaston', ''], ['Hoekstra', 'Rinke', '']]","['innovation', 'trajectory', 'patent', 'classification', 'map', 'generations', 'photovoltaics']"
17136,1501.05222,Ryan Curtin,"Ryan R. Curtin, Dongryeol Lee, William B. March, Parikshit Ram",Plug-and-play dual-tree algorithm runtime analysis,Submitted to JMLR,,,,cs.DS cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Numerous machine learning algorithms contain pairwise statistical problems at
their core---that is, tasks that require computations over all pairs of input
points if implemented naively. Often, tree structures are used to solve these
problems efficiently. Dual-tree algorithms can efficiently solve or approximate
many of these problems. Using cover trees, rigorous worst-case runtime
guarantees have been proven for some of these algorithms. In this paper, we
present a problem-independent runtime guarantee for any dual-tree algorithm
using the cover tree, separating out the problem-dependent and the
problem-independent elements. This allows us to just plug in bounds for the
problem-dependent elements to get runtime guarantees for dual-tree algorithms
for any pairwise statistical problem without re-deriving the entire proof. We
demonstrate this plug-and-play procedure for nearest-neighbor search and
approximate kernel density estimation to get improved runtime guarantees. Under
mild assumptions, we also present the first linear runtime guarantee for
dual-tree based range search.
","[{'version': 'v1', 'created': 'Wed, 21 Jan 2015 16:39:43 GMT'}]",2015-01-22,"[['Curtin', 'Ryan R.', ''], ['Lee', 'Dongryeol', ''], ['March', 'William B.', ''], ['Ram', 'Parikshit', '']]","['dual-tree algorithms', 'branch and bound', 'nearest neighbor search', 'kerneldensity estimation', 'range search']"
17137,1603.02078,Jiang Liu,"Lan Wang, Chenqiang Gao, Jiang Liu, Deyu Meng",A novel learning-based frame pooling method for Event Detection,,,,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Detecting complex events in a large video collection crawled from video
websites is a challenging task. When applying directly good image-based feature
representation, e.g., HOG, SIFT, to videos, we have to face the problem of how
to pool multiple frame feature representations into one feature representation.
In this paper, we propose a novel learning-based frame pooling method. We
formulate the pooling weight learning as an optimization problem and thus our
method can automatically learn the best pooling weight configuration for each
specific event category. Experimental results conducted on TRECVID MED 2011
reveal that our method outperforms the commonly used average pooling and max
pooling strategies on both high-level and low-level 2D image features.
","[{'version': 'v1', 'created': 'Mon, 7 Mar 2016 14:15:55 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Aug 2016 02:59:56 GMT'}]",2016-08-22,"[['Wang', 'Lan', ''], ['Gao', 'Chenqiang', ''], ['Liu', 'Jiang', ''], ['Meng', 'Deyu', '']]","['Optimal pooling', 'Event detection', 'Feature representation']"
17138,1009.3771,Germ\'an Vidal,Nicos Angelopoulos and Paul Taylor,"An extensible web interface for databases and its application to storing
  biochemical data","Online proceedings of the Joint Workshop on Implementation of
  Constraint Logic Programming Systems and Logic-based Methods in Programming
  Environments (CICLOPS-WLPE 2010), Edinburgh, Scotland, U.K., July 15, 2010",,,,cs.PL cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a generic web-based database interface implemented in
Prolog. We discuss the advantages of the implementation platform and
demonstrate the system's applicability in providing access to integrated
biochemical data. Our system exploits two libraries of SWI-Prolog to create a
schema-transparent interface within a relational setting. As is expected in
declarative programming, the interface was written with minimal programming
effort due to the high level of the language and its suitability to the task.
We highlight two of Prolog's features that are well suited to the task at hand:
term representation of structured documents and relational nature of Prolog
which facilitates transparent integration of relational databases. Although we
developed the system for accessing in-house biochemical and genomic data the
interface is generic and provides a number of extensible features. We describe
some of these features with references to our research databases. Finally we
outline an in-house library that facilitates interaction between Prolog and the
R statistical package. We describe how it has been employed in the present
context to store output from statistical analysis on to the database.
","[{'version': 'v1', 'created': 'Mon, 20 Sep 2010 11:06:25 GMT'}]",2010-09-21,"[['Angelopoulos', 'Nicos', ''], ['Taylor', 'Paul', '']]","['user interface', 'web services', 'Prolog programming', 'biochemical data']"
17139,1407.1165,Prashant  Borde,"Prashant Bordea, Amarsinh Varpeb, Ramesh Manzac, Pravin Yannawara","Recognition of Isolated Words using Zernike and MFCC features for Audio
  Visual Speech Recognition",,,,,cs.CV cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic Speech Recognition (ASR) by machine is an attractive research topic
in signal processing domain and has attracted many researchers to contribute in
this area. In recent year, there have been many advances in automatic speech
reading system with the inclusion of audio and visual speech features to
recognize words under noisy conditions. The objective of audio-visual speech
recognition system is to improve recognition accuracy. In this paper we
computed visual features using Zernike moments and audio feature using Mel
Frequency Cepstral Coefficients (MFCC) on vVISWa (Visual Vocabulary of
Independent Standard Words) dataset which contains collection of isolated set
of city names of 10 speakers. The visual features were normalized and dimension
of features set was reduced by Principal Component Analysis (PCA) in order to
recognize the isolated word utterance on PCA space.The performance of
recognition of isolated words based on visual only and audio only features
results in 63.88 and 100 respectively.
","[{'version': 'v1', 'created': 'Fri, 4 Jul 2014 09:32:10 GMT'}]",2014-07-07,"[['Bordea', 'Prashant', ''], ['Varpeb', 'Amarsinh', ''], ['Manzac', 'Ramesh', ''], ['Yannawara', 'Pravin', '']]","['Lip tracking', 'Zernike moment', 'Principal Component Analysis (PCA)', 'Mel Frequency Cepstral Coefficients (MFCC)']"
17140,1502.04013,Konstantin Selyunin,"Konstantin Selyunin, Denise Ratasich, Ezio Bartocci and Radu Grosu",Deep Neural Programs for Adaptive Control in Cyber-Physical Systems,,,,,cs.AI cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce Deep Neural Programs (DNP), a novel programming paradigm for
writing adaptive controllers for cy-ber-physical systems (CPS). DNP replace if
and while statements, whose discontinuity is responsible for undecidability in
CPS analysis, intractability in CPS design, and frailness in CPS
implementation, with their smooth, neural nif and nwhile counterparts. This not
only makes CPS analysis decidable and CPS design tractable, but also allows to
write robust and adaptive CPS code. In DNP the connection between the sigmoidal
guards of the nif and nwhile statements has to be given as a Gaussian Bayesian
network, which reflects the partial knowledge, the CPS program has about its
environment. To the best of our knowledge, DNP are the first approach linking
neural networks to programs, in a way that makes explicit the meaning of the
network. In order to prove and validate the usefulness of DNP, we use them to
write and learn an adaptive CPS controller for the parallel parking of the
Pioneer rovers available in our CPS lab.
","[{'version': 'v1', 'created': 'Fri, 13 Feb 2015 14:50:22 GMT'}]",2015-02-16,"[['Selyunin', 'Konstantin', ''], ['Ratasich', 'Denise', ''], ['Bartocci', 'Ezio', ''], ['Grosu', 'Radu', '']]","['Cyber-Physical Systems', 'Adaptive Control', 'Car Parking', 'Deep Neural Programs', 'Gaussian Bayesian Networks']"
17141,1009.1478,Saradha Devi a,"A. Saradha Devi, S. Suja Priyadharsini, S. Athinarayanan",A Block Based Scheme for Enhancing Low Luminated Images,"13 pages, 5 figures, 2 national conferences","International Journal of Multimedia & Its Applications(IJMA),
  Vol.2, No.3, August 2010",,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper the background detection in images in poor lighting can be done
by the use of morphological filters. Lately contrast image enhancement
technique is used to detect the background in image which uses Weber's Law. The
proposed technique is more effective one in which the background detection in
image can be done in color images. The given image obtained in this method is
very effective one. More enhancement can be obtained while comparing the
results. In this technique compressed domain enhancement has been used for
better result.
","[{'version': 'v1', 'created': 'Wed, 8 Sep 2010 08:23:47 GMT'}]",2010-09-09,"[['Devi', 'A. Saradha', ''], ['Priyadharsini', 'S. Suja', ''], ['Athinarayanan', 'S.', '']]","['Morphological Filters', 'Morphological Contrast', 'Opening by reconstruction', 'Color Image Enhancement', 'DC and AC Co-efficient']"
17142,1009.3802,Ju Sun,"Yuzhao Ni, Ju Sun, Xiaotong Yuan, Shuicheng Yan, Loong-Fah Cheong",Robust Low-Rank Subspace Segmentation with Semidefinite Guarantees,"10 pages, 4 figures. Accepted by ICDM Workshop on Optimization Based
  Methods for Emerging Data Mining Problems (OEDM), 2010. Main proof simplified
  and typos corrected. Experimental data slightly added",,,,cs.CV cs.IT cs.LG math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently there is a line of research work proposing to employ Spectral
Clustering (SC) to segment (group){Throughout the paper, we use segmentation,
clustering, and grouping, and their verb forms, interchangeably.}
high-dimensional structural data such as those (approximately) lying on
subspaces {We follow {liu2010robust} and use the term ""subspace"" to denote both
linear subspaces and affine subspaces. There is a trivial conversion between
linear subspaces and affine subspaces as mentioned therein.} or low-dimensional
manifolds. By learning the affinity matrix in the form of sparse
reconstruction, techniques proposed in this vein often considerably boost the
performance in subspace settings where traditional SC can fail. Despite the
success, there are fundamental problems that have been left unsolved: the
spectrum property of the learned affinity matrix cannot be gauged in advance,
and there is often one ugly symmetrization step that post-processes the
affinity for SC input. Hence we advocate to enforce the symmetric positive
semidefinite constraint explicitly during learning (Low-Rank Representation
with Positive SemiDefinite constraint, or LRR-PSD), and show that factually it
can be solved in an exquisite scheme efficiently instead of general-purpose SDP
solvers that usually scale up poorly. We provide rigorous mathematical
derivations to show that, in its canonical form, LRR-PSD is equivalent to the
recently proposed Low-Rank Representation (LRR) scheme {liu2010robust}, and
hence offer theoretic and practical insights to both LRR-PSD and LRR, inviting
future research. As per the computational cost, our proposal is at most
comparable to that of LRR, if not less. We validate our theoretic analysis and
optimization scheme by experiments on both synthetic and real data sets.
","[{'version': 'v1', 'created': 'Mon, 20 Sep 2010 12:54:12 GMT'}, {'version': 'v2', 'created': 'Sun, 26 Sep 2010 16:07:15 GMT'}, {'version': 'v3', 'created': 'Fri, 8 Oct 2010 16:53:06 GMT'}]",2010-10-11,"[['Ni', 'Yuzhao', ''], ['Sun', 'Ju', ''], ['Yuan', 'Xiaotong', ''], ['Yan', 'Shuicheng', ''], ['Cheong', 'Loong-Fah', '']]","['spectral clustering', 'affinity matrix learning', 'rankminimization', 'robust estimation', 'eigenvalue thresholding']"
17143,1407.4859,Kuldeep Meel,"Deepak Majeti, Kuldeep S. Meel, Rajkishore Barik, Vivek Sarkar",ADHA: Automatic Data layout framework for Heterogeneous Architectures,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data layouts play a crucial role in determining the performance of a given
application running on a given architecture. Existing parallel programming
frameworks for both multicore and heterogeneous systems leave the onus of
selecting a data layout to the programmer. Therefore, shifting the burden of
data layout selection to optimizing compilers can greatly enhance programmer
productivity and application performance. In this work, we introduce {\ADHA}: a
two-level hierarchal formulation of the data layout problem for modern
heterogeneous architectures. We have created a reference implementation of ADHA
in the Heterogeneous Habanero-C (H2C) parallel programming system. ADHA shows
significant performance benefits of up to 6.92$\times$ compared to manually
specified layouts for two benchmark programs running on a CPU+GPU heterogeneous
platform.
","[{'version': 'v1', 'created': 'Fri, 18 Jul 2014 00:09:04 GMT'}]",2014-07-21,"[['Majeti', 'Deepak', ''], ['Meel', 'Kuldeep S.', ''], ['Barik', 'Rajkishore', ''], ['Sarkar', 'Vivek', '']]","['Compilers', 'Data Layout', 'Heterogeneous Architectures']"
17144,1701.02446,Amit Tambe,"Juan Guarnizo, Amit Tambe, Suman Sankar Bhunia, Mart\'in Ochoa, Nils
  Tippenhauer, Asaf Shabtai and Yuval Elovici",SIPHON: Towards Scalable High-Interaction Physical Honeypots,,,,,cs.CR,http://creativecommons.org/licenses/by-sa/4.0/,"  In recent years, the emerging Internet-of-Things (IoT) has led to rising
concerns about the security of networked embedded devices. In this work, we
focus on the adaptation of Honeypots for improving the security of IoTs.
Low-interaction honeypots are used so far in the context of IoT. Such honeypots
are limited and easily detectable, and thus, there is a need to find ways how
to develop high-interaction, reliable, IoT honeypots that will attract skilled
attackers. In this work, we propose the SIPHON architecture - a Scalable
high-Interaction Honeypot platform for IoT devices. Our architecture leverages
IoT devices that are physically at one location and are connected to the
Internet through so-called wormholes distributed around the world. The
resulting architecture allows exposing few physical devices over a large number
of geographically distributed IP addresses. We demonstrate the proposed
architecture in a large scale experiment with 39 wormhole instances in 16
cities in 9 countries. Based on this setup, six physical IP cameras, one NVR
and one IP printer are presented as 85 real IoT devices on the Internet,
attracting a daily traffic of 700MB for a period of two months. A preliminary
analysis of the collected traffic indicates that devices in some cities
attracted significantly more traffic than others (ranging from 600 000 incoming
TCP connections for the most popular destination to less than 50000 for the
least popular). We recorded over 400 brute-force login attempts to the
web-interface of our devices using a total of 1826 distinct credentials, from
which 11 attempts were successful. Moreover, we noted login attempts to Telnet
and SSH ports some of which used credentials found in the recently disclosed
Mirai malware.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2017 06:27:00 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Jan 2017 03:35:13 GMT'}]",2017-01-13,"[['Guarnizo', 'Juan', ''], ['Tambe', 'Amit', ''], ['Bhunia', 'Suman Sankar', ''], ['Ochoa', 'Martín', ''], ['Tippenhauer', 'Nils', ''], ['Shabtai', 'Asaf', ''], ['Elovici', 'Yuval', '']]","['Internet of Things', 'Low-Interaction Honeypot', 'High-InteractionHoneypot', 'Wormholes', 'Scalability']"
17145,1407.3987,Deepali Virmani,"Deepali Virmani, Ankita Soni, Shringarica Chandel, Manas Hemrajani",Routing Attacks in Wireless Sensor Networks: A Survey,IJCSIT April 2014,,,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless Sensor Networks (WSN) is an emerging technology now-a-days and has a
wide range of applications such as battlefield surveillance, traffic
surveillance, forest fire detection, flood detection etc. But wireless sensor
networks are susceptible to a variety of potential attacks which obstructs the
normal operation of the network. The security of a wireless sensor network is
compromised because of the random deployment of sensor nodes in open
environment, memory limitations, power limitations and unattended nature. This
paper focuses on various attacks that manifest in the network and provides a
tabular representation of the attacks, their effects and severity. The paper
depicts a comparison of attacks basis packet loss and packet corruption. Also,
the paper discusses the known defence mechanisms and countermeasures against
the attacks.
","[{'version': 'v1', 'created': 'Thu, 29 May 2014 11:12:41 GMT'}]",2014-07-16,"[['Virmani', 'Deepali', ''], ['Soni', 'Ankita', ''], ['Chandel', 'Shringarica', ''], ['Hemrajani', 'Manas', '']]","['wireless sensor network', 'security', 'attacks', 'defence mechanism']"
17146,1109.3957,Rajendiran Muthusamy,"M. Rajendiran, S. K. Srivatsa ((1) Department of Computer Science and
  Engineering, Sathyabama University, Chennai, (2) Department of Computer
  Science and Engineering, St. Josephs College of Engineering, Chennai)","On-Demand Multicasting in Ad-hoc Networks: Performance Evaluation of
  AODV, ODMRP and FSR",,,,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  Adhoc networks are characterized by connectivity through a collection of
wireless nodes and fast changing network topology. Wireless nodes are free to
move independent of each other which makes routing much difficult. This calls
for the need of an efficient dynamic routing protocol. Mesh-based multicast
routing technique establishes communications between mobile nodes of wireless
adhoc networks in a faster and efficient way. In this article the performance
of prominent on-demand routing protocols for mobile adhoc networks such as
ODMRP (On Demand Multicast Routing Protocol), AODV (Adhoc on Demand Distance
Vector) and FSR (Fisheye State Routing protocol) was studied. The parameters
viz., average throughput, packet delivery ration and end-to-end delay were
evaluated. From the simulation results and analysis, a suitable routing
protocol can be chosen for a specified network. The results show that the ODMRP
protocol performance is remarkably superior as compared with AODV and FSR
routing protocols. Keywords: MANET, Multicast Routing, ODMRP, AODV, FSR.
","[{'version': 'v1', 'created': 'Mon, 19 Sep 2011 07:42:07 GMT'}]",2011-09-20,"[['Rajendiran', 'M.', ''], ['Srivatsa', 'S. K.', '']]","['MANET', 'Multicast Routing', 'ODMRP', 'AODV', 'FSR']"
17147,1204.5443,Sergey Nikolenko,"Kirill Kogan, Alejandro L\'opez-Ortiz, Sergey I. Nikolenko, Alexander
  V. Sirotkin, Denis Tugaryov",FIFO Queueing Policies for Packets with Heterogeneous Processing,15 pages,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of managing a bounded size First-In-First-Out (FIFO)
queue buffer, where each incoming unit-sized packet requires several rounds of
processing before it can be transmitted out. Our objective is to maximize the
total number of successfully transmitted packets. We consider both push-out
(when the policy is permitted to drop already admitted packets) and
non-push-out cases. In particular, we provide analytical guarantees for the
throughput performance of our algorithms. We further conduct a comprehensive
simulation study which experimentally validates the predicted theoretical
behaviour.
","[{'version': 'v1', 'created': 'Tue, 24 Apr 2012 17:37:25 GMT'}]",2012-04-25,"[['Kogan', 'Kirill', ''], ['López-Ortiz', 'Alejandro', ''], ['Nikolenko', 'Sergey I.', ''], ['Sirotkin', 'Alexander V.', ''], ['Tugaryov', 'Denis', '']]","['Scheduling', 'Buffer Management', 'First-In-First-Out Queueing', 'Switches', 'Online Algorithms', 'Competitive Analysis']"
17148,1106.5736,Erik Demaine,"Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw,
  Andrew Winslow",Algorithms for Solving Rubik's Cubes,"34 pages, 9 figures. A short version of this paper is to appear at
  the 19th Annual European Symposium on Algorithms",,,,cs.DS cs.CC cs.CG math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Rubik's Cube is perhaps the world's most famous and iconic puzzle,
well-known to have a rich underlying mathematical structure (group theory). In
this paper, we show that the Rubik's Cube also has a rich underlying
algorithmic structure. Specifically, we show that the n x n x n Rubik's Cube,
as well as the n x n x 1 variant, has a ""God's Number"" (diameter of the
configuration space) of Theta(n^2/log n). The upper bound comes from
effectively parallelizing standard Theta(n^2) solution algorithms, while the
lower bound follows from a counting argument. The upper bound gives an
asymptotically optimal algorithm for solving a general Rubik's Cube in the
worst case. Given a specific starting state, we show how to find the shortest
solution in an n x O(1) x O(1) Rubik's Cube. Finally, we show that finding this
optimal solution becomes NP-hard in an n x n x 1 Rubik's Cube when the
positions and colors of some of the cubies are ignored (not used in determining
whether the cube is solved).
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2011 17:35:09 GMT'}]",2011-06-29,"[['Demaine', 'Erik D.', ''], ['Demaine', 'Martin L.', ''], ['Eisenstat', 'Sarah', ''], ['Lubiw', 'Anna', ''], ['Winslow', 'Andrew', '']]","['combinatorial puzzles', 'diameter', 'God’s number', 'combinatorial optimization']"
17149,1110.4623,Jeff A Stuart,Jeff A. Stuart and John D. Owens,Efficient Synchronization Primitives for GPUs,"13 pages with appendix, several figures, plans to submit to CompSci
  conference in early 2012",,,,cs.OS cs.DC cs.DS cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we revisit the design of synchronization
primitives---specifically barriers, mutexes, and semaphores---and how they
apply to the GPU. Previous implementations are insufficient due to the
discrepancies in hardware and programming model of the GPU and CPU. We create
new implementations in CUDA and analyze the performance of spinning on the GPU,
as well as a method of sleeping on the GPU, by running a set of memory-system
benchmarks on two of the most common GPUs in use, the Tesla- and Fermi-class
GPUs from NVIDIA. From our results we define higher-level principles that are
valid for generic many-core processors, the most important of which is to limit
the number of atomic accesses required for a synchronization operation because
atomic accesses are slower than regular memory accesses. We use the results of
the benchmarks to critique existing synchronization algorithms and guide our
new implementations, and then define an abstraction of GPUs to classify any GPU
based on the behavior of the memory system. We use this abstraction to create
suitable implementations of the primitives specifically targeting the GPU, and
analyze the performance of these algorithms on Tesla and Fermi. We then predict
performance on future GPUs based on characteristics of the abstraction. We also
examine the roles of spin waiting and sleep waiting in each primitive and how
their performance varies based on the machine abstraction, then give a set of
guidelines for when each strategy is useful based on the characteristics of the
GPU and expected contention.
","[{'version': 'v1', 'created': 'Thu, 20 Oct 2011 19:43:58 GMT'}]",2011-10-21,"[['Stuart', 'Jeff A.', ''], ['Owens', 'John D.', '']]","['GPGPU', 'Locks', 'Synchronization Primitives', 'Mutex', 'Barrier']"
17150,0712.3215,Francoise Sandoz-Guermond,"Fran\c{c}oise Sandoz-Guermond (LIESP), Marc-Eric Bobiller-Chaumon
  (GRePS)","L'accessibilit\'e des E-services aux personnes non-voyantes :
  difficult\'es d'usage et recommandations",4 pages,"Dans International Conference Proceedings of IHM'2006 - IIHM :
  Interaction Homme Machine, Montr\'eal : Canada (2006)",,,cs.HC,,"  While taking into account handicapped people in the design of technologies
represents a social and political stake that becomes important (in particular
with the recent law on equal rights for all the citizens, March 2004), this
paper aims at evaluating the level of accessibility of two sites of E-services
thanks to tests of use and proposing a set of recommendations in order to
increase usability for the largest amount of people.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2007 15:54:07 GMT'}]",2007-12-20,"[['Sandoz-Guermond', 'Françoise', '', 'LIESP'], ['Bobiller-Chaumon', 'Marc-Eric', '', 'GRePS']]","['Inclusive design', 'accessibility', 'utilisability', 'E-administration', 'blind people']"
17151,1301.1950,Bogdan Patrut,Bogdan Patrut,"Syntactic Analysis Based on Morphological Characteristic Features of the
  Romanian Language","13 pages, 3 figures, DIASEXP, International Journal on Natural
  Language Computing, 2012, Volume 1, Number 4",,,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper refers to the syntactic analysis of phrases in Romanian, as an
important process of natural language processing. We will suggest a real-time
solution, based on the idea of using some words or groups of words that
indicate grammatical category; and some specific endings of some parts of
sentence. Our idea is based on some characteristics of the Romanian language,
where some prepositions, adverbs or some specific endings can provide a lot of
information about the structure of a complex sentence. Such characteristics can
be found in other languages, too, such as French. Using a special grammar, we
developed a system (DIASEXP) that can perform a dialogue in natural language
with assertive and interogative sentences about a ""story"" (a set of sentences
describing some events from the real life).
","[{'version': 'v1', 'created': 'Wed, 9 Jan 2013 19:17:31 GMT'}]",2013-01-10,"[['Patrut', 'Bogdan', '']]","['Natural Language Processing', 'Syntactic Analysis', 'Morphology', 'Grammar', 'Romanian Language']"
17152,1305.5753,Peter Bruza,"Peter D. Bruza and Kirsty Kitto and Brentyn J. Ramm and Laurianne
  Sitbon","A probabilistic framework for analysing the compositionality of
  conceptual combinations",Revisions (Journal of Mathematical Psychology),,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Conceptual combination performs a fundamental role in creating the broad
range of compound phrases utilized in everyday language. This article provides
a novel probabilistic framework for assessing whether the semantics of
conceptual combinations are compositional, and so can be considered as a
function of the semantics of the constituent concepts, or not. While the
systematicity and productivity of language provide a strong argument in favor
of assuming compositionality, this very assumption is still regularly
questioned in both cognitive science and philosophy. Additionally, the
principle of semantic compositionality is underspecified, which means that
notions of both ""strong"" and ""weak"" compositionality appear in the literature.
Rather than adjudicating between different grades of compositionality, the
framework presented here contributes formal methods for determining a clear
dividing line between compositional and non-compositional semantics. In
addition, we suggest that the distinction between these is contextually
sensitive. Utilizing formal frameworks developed for analyzing composite
systems in quantum theory, we present two methods that allow the semantics of
conceptual combinations to be classified as ""compositional"" or
""non-compositional"". Compositionality is first formalised by factorising the
joint probability distribution modeling the combination, where the terms in the
factorisation correspond to individual concepts. This leads to the necessary
and sufficient condition for the joint probability distribution to exist. A
failure to meet this condition implies that the underlying concepts cannot be
modeled in a single probability space when considering their combination, and
the combination is thus deemed ""non-compositional"". The formal analysis methods
are demonstrated by applying them to an empirical study of twenty-four
non-lexicalised conceptual combinations.
","[{'version': 'v1', 'created': 'Thu, 23 May 2013 03:14:50 GMT'}, {'version': 'v2', 'created': 'Sat, 28 Sep 2013 00:27:07 GMT'}, {'version': 'v3', 'created': 'Fri, 21 Nov 2014 02:15:45 GMT'}]",2014-11-24,"[['Bruza', 'Peter D.', ''], ['Kitto', 'Kirsty', ''], ['Ramm', 'Brentyn J.', ''], ['Sitbon', 'Laurianne', '']]","['conceptual combination', 'semantic compositionality', 'quantumcognition']"
17153,1205.4681,George Saad,"Jeffrey Knockel, George Saad and Jared Saia",Self-Healing Algorithms of Byzantine Faults,"17 pages, 5 figures and submitted to SSS 2013, Paper #13",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent years have seen significant interest in designing networks that are
self-healing in the sense that they can automatically recover from adversarial
attacks. Previous work shows that it is possible for a network to automatically
recover, even when an adversary repeatedly deletes nodes in the network.
However, there have not yet been any algorithms that self-heal in the case
where an adversary takes over nodes in the network. In this paper, we address
this gap. In particular, we describe a communication network over n nodes that
ensures the following properties, even when an adversary controls up to t <=
(1/8 - \epsilon)n nodes, for any non-negative \epsilon. First, the network
provides a point-to-point communication with bandwidth and latency costs that
are asymptotically optimal. Second, the expected total number of message
corruptions is O(t(log* n)^2) before the adversarially controlled nodes are
effectively quarantined so that they cause no more corruptions. Empirical
results show that our algorithm can reduce the bandwidth cost by up to a factor
of 70.
","[{'version': 'v1', 'created': 'Mon, 21 May 2012 18:42:47 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Jul 2013 18:30:46 GMT'}]",2015-03-20,"[['Knockel', 'Jeffrey', ''], ['Saad', 'George', ''], ['Saia', 'Jared', '']]","['Byzantine Faults', 'Threshold Cryptography', 'Self-Healing Algorithms']"
17154,1206.3027,"J\""org Pohle","J\""org Pohle","Social Networks, Functional Differentiation of Society, and Data
  Protection",8 pages,,,,cs.CY cs.SI physics.soc-ph,http://creativecommons.org/licenses/by/3.0/,"  Most scholars, politicians, and activists are following individualistic
theories of privacy and data protection. In contrast, some of the pioneers of
the data protection legislation in Germany like Adalbert Podlech, Paul J.
M\""uller, and Ulrich Dammann used a systems theory approach. Following Niklas
Luhmann, the aim of data protection is (1) maintaining the functional
differentiation of society against the threats posed by the possibilities of
modern information processing, and (2) countering undue information power by
organized social players. It could be, therefore, no surprise that the first
data protection law in the German state of Hesse contained rules to protect the
individual as well as the balance of power between the legislative and the
executive body of the state. Social networks like Facebook or Google+ do not
only endanger their users by exposing them to other users or the public. They
constitute, first and foremost, a threat to society as a whole by collecting
information about individuals, groups, and organizations from different social
systems and combining them in a centralized data bank. They transgress the
boundaries between social systems that act as a shield against total visibility
and transparency of the individual and protect the freedom and the autonomy of
the people. Without enforcing structural limitations on the organizational use
of collected data by the social network itself or the company behind it, social
networks pose the worst totalitarian peril for western societies since the fall
of the Soviet Union.
","[{'version': 'v1', 'created': 'Thu, 14 Jun 2012 07:59:05 GMT'}]",2012-06-15,"[['Pohle', 'Jörg', '']]","['privacy', 'data protection', 'right of personality', 'functional differentiation', 'separation of duties', 'balance of power', 'social networks']"
17155,1606.03855,Iryna Kononenko,"Iryna Kononenko, Oleksiy Kononenko","Mathematical Modeling of Dynamics for Partially Filled Shells of
  Revolution","13 pages, 8 figures",,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we study the dynamic behaviour of compound shells of revolution
partially filled with an ideal incompressible fluid based on boundary-value
problems. New analytical mathematical model with corresponding discrete scheme
for the elastic displacements and the dynamic liquid pressure is developed. The
discrete scheme is based on the method of discrete singularities. A code to
perform the numerical analysis is developed. Comprehensive benchmarking of the
obtained results against other methods is done and good agreement is observed.
The convergence of the proposed numerical method is demonstrated. One of the
advantages of this new model is that the initial 3D problem is analytically
reduced to a 1D integral equation. Moreover, it can handle the behaviour of the
pressure in the vicinity of the nodes explicitly and the computational
technique used has a quick convergence requiring a negligible amount of CPU
time.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2016 08:27:21 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Jun 2016 05:13:40 GMT'}]",2016-06-15,"[['Kononenko', 'Iryna', ''], ['Kononenko', 'Oleksiy', '']]","['mathematical modeling', 'hydroelastic vibration', 'boundary-valueproblem', 'singular integral equation', 'method of the discrete singularities']"
17156,1110.1700,Shirin Mohammadi,"Shirin Mohammadi, Ali A. Safaei, Fatemeh Abdi and Mostafa S. Haghjoo",Adaptive Data Stream Management System Using Learning Automata,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many modern applications, data are received as infinite, rapid,
unpredictable and time- variant data elements that are known as data streams.
Systems which are able to process data streams with such properties are called
Data Stream Management Systems (DSMS). Due to the unpredictable and time-
variant properties of data streams as well as system, adaptivity of the DSMS is
a major requirement for each DSMS. Accordingly, determining parameters which
are effective on the most important performance metric of a DSMS (i.e.,
response time) and analysing them will affect on designing an adaptive DSMS. In
this paper, effective parameters on response time of DSMS are studied and
analysed and a solution is proposed for DSMSs' adaptivity. The proposed
adaptive DSMS architecture includes a learning unit that frequently evaluates
system to adjust the optimal value for each of tuneable effective. Learning
Automata is used as the learning mechanism of the learning unit to adjust the
value of tuneable effective parameters. So, when system faces some changes, the
learning unit increases performance by tuning each of tuneable effective
parameters to its optimum value. Evaluation results illustrate that after a
while, parameters reach their optimum value and then DSMS's adaptivity will be
improved considerably.
","[{'version': 'v1', 'created': 'Sat, 8 Oct 2011 06:05:02 GMT'}]",2011-10-11,"[['Mohammadi', 'Shirin', ''], ['Safaei', 'Ali A.', ''], ['Abdi', 'Fatemeh', ''], ['Haghjoo', 'Mostafa S.', '']]","['Data Stream', 'DSMS', 'Adaptivity', 'Performance Metrics', 'Response Time', 'Learning Automata']"
17157,1712.03043,Zengkun Li,Zengkun Li,"A Heuristic Search Algorithm Using the Stability of Learning Algorithms
  in Certain Scenarios as the Fitness Function: An Artificial General
  Intelligence Engineering Approach",12 pages,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a non-manual design engineering method based on heuristic
search algorithm to search for candidate agents in the solution space which
formed by artificial intelligence agents modeled on the base of
bionics.Compared with the artificial design method represented by meta-learning
and the bionics method represented by the neural architecture chip,this method
is more feasible for realizing artificial general intelligence,and it has a
much better interaction with cognitive neuroscience;at the same time,the
engineering method is based on the theoretical hypothesis that the final
learning algorithm is stable in certain scenarios,and has generalization
ability in various scenarios.The paper discusses the theory preliminarily and
proposes the possible correlation between the theory and the fixed-point
theorem in the field of mathematics.Limited by the author's knowledge
level,this correlation is proposed only as a kind of conjecture.
","[{'version': 'v1', 'created': 'Fri, 8 Dec 2017 12:23:13 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Dec 2017 13:46:49 GMT'}, {'version': 'v3', 'created': 'Fri, 27 Jul 2018 02:08:04 GMT'}]",2018-07-30,"[['Li', 'Zengkun', '']]","['Artificial general intelligence', 'Heuristic search', 'Fitness function', 'Neural network', 'Learning algorithm']"
17158,1509.09090,Krzysztof Wo{\l}k,"Krzysztof Wo{\l}k, Krzysztof Marasek",Real-Time Statistical Speech Translation,"machine translation, polish english","Advances in Intelligent Systems and Computing volume 275,
  p.107-114, Publisher: Springer, ISSN 2194-5357, ISBN 978-3-319-05950-1, 2014",,,cs.CL stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This research investigates the Statistical Machine Translation approaches to
translate speech in real time automatically. Such systems can be used in a
pipeline with speech recognition and synthesis software in order to produce a
real-time voice communication system between foreigners. We obtained three main
data sets from spoken proceedings that represent three different types of human
speech. TED, Europarl, and OPUS parallel text corpora were used as the basis
for training of language models, for developmental tuning and testing of the
translation system. We also conducted experiments involving part of speech
tagging, compound splitting, linear language model interpolation, TrueCasing
and morphosyntactic analysis. We evaluated the effects of variety of data
preparations on the translation results using the BLEU, NIST, METEOR and TER
metrics and tried to give answer which metric is most suitable for PL-EN
language pair.
","[{'version': 'v1', 'created': 'Wed, 30 Sep 2015 09:20:27 GMT'}]",2015-10-01,"[['Wołk', 'Krzysztof', ''], ['Marasek', 'Krzysztof', '']]","['Machine translation', 'Speech translation', 'Machine learning', 'NLP', 'Knowledge-free learning']"
17159,1205.1900,Luisa Gargano,"Luisa Gargano, Adele A. Rescigno",Strong Conflict-Free Coloring of Intervals,,,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the k-strong conflict-free coloring of a set of points on a line
with respect to a family of intervals: Each point on the line must be assigned
a color so that the coloring has to be conflict-free, in the sense that in
every interval I there are at least k colors each appearing exactly once in I.
In this paper, we present a polynomial algorithm for the general problem; the
algorithm has an approximation factor 5-2/k when k\geq2 and approximation
factor 2 for k=1. In the special case the family contains all the possible
intervals on the given set of points, we show that a 2 approximation algorithm
exists, for any k\geq1.
","[{'version': 'v1', 'created': 'Wed, 9 May 2012 08:06:18 GMT'}]",2015-03-20,"[['Gargano', 'Luisa', ''], ['Rescigno', 'Adele A.', '']]","['Conflict-Free Coloring', 'Intervals', 'Hypergraphs', 'Wireless networks']"
17160,1412.7959,Maulahikmah Galinium,"Maulahikmah Galinium, Negar Shahbaz","Case Studies: Business and Technical Perspectives in Migration of Legacy
  Systems to Service Oriented Architecture","11 pages, 4 figures","ECTI Transactions on Computer and Information Technology, Vol 7,
  No, 2, November 2013",,,cs.CY cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In adoption process of Service Oriented Architecture (SOA), the legacy
systems of a company can not be neglected. The reason is the legacy systems
have been deployed in the past and have been running critical business
processes within an enterprise in its current IT architecture. However not all
migration process of legacy systems to SOA has been successfull. Highlighting
the right factors to reach legacy systems migration success in a specific
company is the key value. The main adopted research method in this study has
been interviewed for different companies with different enterprises including
bank, furniture, engineering and airline companies in Europe. Through separate
interviews, critical success factors of migrating legacy systems into SOA have
been collected and identified in each case company. Finally collected results
are analyzed and presented as the recognized factors affecting successful
migration of legacy assets into SOA from business and technical perspectives.
","[{'version': 'v1', 'created': 'Fri, 26 Dec 2014 17:11:58 GMT'}]",2014-12-30,"[['Galinium', 'Maulahikmah', ''], ['Shahbaz', 'Negar', '']]","['service oriented architecture (soa)', 'migration', 'legacy system', 'success factors']"
17161,1504.07499,Sophie Lemaitre,"Sophie Lemaitre and Vladimir Salnikov and Daniel Choi and Philippe
  Karamian","Computation of thermal properties via 3D homogenization of multiphase
  materials using FFT-based accelerated scheme",,,,,cs.CE physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we study the thermal effective behaviour for 3D multiphase
composite material consisting of three isotropic phases which are the matrix,
the inclusions and the coating media. For this purpose we use an accelerated
FFT-based scheme initially proposed in Eyre and Milton (1999) to evaluate the
thermal conductivity tensor. Matrix and spherical inclusions media are polymers
with similar properties whereas the coating medium is metallic hence better
conducting. Thus, the contrast between the coating and the others media is very
large. For our study, we use RVEs (Representative volume elements) generated by
RSA (Random Sequential Adsorption) method developed in our previous works,
then, we compute effective thermal properties using an FFT-based homogenization
technique validated by comparison with the direct finite elements method. We
study the thermal behaviour of the 3D-multiphase composite material and we show
what features should be taken into account to make the computational approach
efficient.
","[{'version': 'v1', 'created': 'Tue, 28 Apr 2015 14:32:52 GMT'}]",2015-04-29,"[['Lemaitre', 'Sophie', ''], ['Salnikov', 'Vladimir', ''], ['Choi', 'Daniel', ''], ['Karamian', 'Philippe', '']]","['composite material', 'coated medium', '3D-multiphases', 'stochastic homogenization', 'FFT']"
17162,1710.02093,Sreelekha S,"Sreelekha S, Pushpak Bhattacharyya",Morphology Generation for Statistical Machine Translation,4 pages 4 tables and 3 figures submitted to LREC 2018,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When translating into morphologically rich languages, Statistical MT
approaches face the problem of data sparsity. The severity of the sparseness
problem will be high when the corpus size of morphologically richer language is
less. Even though we can use factored models to correctly generate
morphological forms of words, the problem of data sparseness limits their
performance. In this paper, we describe a simple and effective solution which
is based on enriching the input corpora with various morphological forms of
words. We use this method with the phrase-based and factor-based experiments on
two morphologically rich languages: Hindi and Marathi when translating from
English. We evaluate the performance of our experiments both in terms automatic
evaluation and subjective evaluation such as adequacy and fluency. We observe
that the morphology injection method helps in improving the quality of
translation. We further analyze that the morph injection method helps in
handling the data sparseness problem to a great level.
","[{'version': 'v1', 'created': 'Thu, 5 Oct 2017 16:15:23 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Nov 2017 11:03:27 GMT'}, {'version': 'v3', 'created': 'Fri, 10 Nov 2017 05:00:16 GMT'}]",2017-11-13,"[['S', 'Sreelekha', ''], ['Bhattacharyya', 'Pushpak', '']]","['Morphology', 'Machine Translation', 'Morphology Injection']"
17163,1603.09114,Eduard Trulls,Kwang Moo Yi and Eduard Trulls and Vincent Lepetit and Pascal Fua,LIFT: Learned Invariant Feature Transform,Accepted to ECCV 2016 (spotlight),,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a novel Deep Network architecture that implements the full
feature point handling pipeline, that is, detection, orientation estimation,
and feature description. While previous works have successfully tackled each
one of these problems individually, we show how to learn to do all three in a
unified manner while preserving end-to-end differentiability. We then
demonstrate that our Deep pipeline outperforms state-of-the-art methods on a
number of benchmark datasets, without the need of retraining.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2016 10:33:18 GMT'}, {'version': 'v2', 'created': 'Fri, 29 Jul 2016 15:29:39 GMT'}]",2016-08-01,"[['Yi', 'Kwang Moo', ''], ['Trulls', 'Eduard', ''], ['Lepetit', 'Vincent', ''], ['Fua', 'Pascal', '']]","['Local Features', 'Feature Descriptors', 'Deep Learning']"
17164,1110.1753,Kavisankar Leelasankar,L.Kavisankar and C.Chellappan,"CNoA: Challenging Number Approach for uncovering TCP SYN flooding using
  SYN spoofing attack",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The challenging number is used for the detection of Spoofing attack. The IP
Spoofing is considered to be one of the potentially brutal attack which acts as
a tool for the DDoS attack which is considered to be a major threat among
security problems in today's internet. These kinds of attack are extremely
severe. They bring down business of company drastically. DDoS attack can easily
exhaust the computing and communication resources of its victim within a short
period of time. There are attacks exploiting some vulnerability or
implementation bug in the software implementation of a service to bring that
down and some attacks will use all the available resources at the target
machine. This deals on attacks that consume all the bandwidth available to the
victim machine. While concentrating on the bandwidth attack the TCP SYN flood
is the more prominent attack. TCP/IP protocol suite is the most widely used
protocol suite for data communication. The TCP SYN flood works by exhausting
the TCP connection queue of the host and thus denying legitimate connection
request. There are various methods used to detect and prevent this attack, one
of which is to block the packet based on SYN flag count from the same IP
address. This kind of prevention methods becomes unsuitable when the attackers
use the Spoofed IP address. The SYN spoofing becomes a major tool the TCP SYN
flooding. For the prevention of this kind of attacks, the TCP specific probing
is used in the proposed scheme where the client is requested challenging number
while sending the ACK in the three way hand shake. This is very useful to find
the Spoofed IP Packets/TCP SYN flood and preventing them.
","[{'version': 'v1', 'created': 'Sat, 8 Oct 2011 18:02:11 GMT'}]",2011-10-11,"[['Kavisankar', 'L.', ''], ['Chellappan', 'C.', '']]","['TCP SYN flooding', 'DDoS', 'IP Spoofing', 'SYN Spoofing', 'Challenging number', 'CNoA']"
17165,1309.7457,Armin Hemmerling,Armin Hemmerling,On the Tape-Number Problem for Deterministic Time Classes,"10 pages, 1 figure",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For any time bound f, let H(f) denote the hierarchy conjecture which means
that the restriction of the numbers of work tapes of deterministic Turing
machines to some b generates an infinite hierarchy of proper subclasses
DTIME_b(f) \subset \DTIME(f). We show that H(f) implies separations of
deterministic from nondeterministic time classes. H(f) follows from the gap
property, G(f), which says that there is a time-constructible bound f_2 such
that f \in o(f_2) and DTIME(f)=DTIME(f_2). G(f) implies further separations.
All these relationships relativize.
","[{'version': 'v1', 'created': 'Sat, 28 Sep 2013 13:18:26 GMT'}]",2013-10-01,"[['Hemmerling', 'Armin', '']]","['Turing machine', 'time complexity', 'tape number', 'determinism versus nondeterminism', 'gap property', 'relativization']"
17166,1110.1862,Quanyan Zhu,Quanyan Zhu and Tamer Basar,"Indices of Power in Optimal IDS Default Configuration: Theory and
  Examples",,,,,cs.GT cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intrusion Detection Systems (IDSs) are becoming essential to protecting
modern information infrastructures. The effectiveness of an IDS is directly
related to the computational resources at its disposal. However, it is
difficult to guarantee especially with an increasing demand of network capacity
and rapid proliferation of attacks. On the other hand, modern intrusions often
come as sequences of attacks to reach some predefined goals. It is therefore
critical to identify the best default IDS configuration to attain the highest
possible overall protection within a given resource budget. This paper proposes
a game theory based solution to the problem of optimal signature-based IDS
configuration under resource constraints. We apply the concepts of indices of
power, namely, Shapley value and Banzhaf-Coleman index, from cooperative game
theory to quantify the influence or contribution of libraries in an IDS with
respect to given attack graphs. Such valuations take into consideration the
knowledge on common attack graphs and experienced system attacks and are used
to configure an IDS optimally at its default state by solving a knapsack
optimization problem.
","[{'version': 'v1', 'created': 'Sun, 9 Oct 2011 17:36:33 GMT'}]",2011-10-11,"[['Zhu', 'Quanyan', ''], ['Basar', 'Tamer', '']]","['Intrusion Detection Systems', 'IDS Configuration', 'Cooperative Games', 'Shapley Value', 'Banzhaf-Coleman Index']"
17167,1609.02770,Andrew Gilbert,"Andrew Gilbert, Richard Bowden",Image and Video Mining through Online Learning,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Within the field of image and video recognition, the traditional approach is
a dataset split into fixed training and test partitions. However, the labelling
of the training set is time-consuming, especially as datasets grow in size and
complexity. Furthermore, this approach is not applicable to the home user, who
wants to intuitively group their media without tirelessly labelling the
content. Our interactive approach is able to iteratively cluster classes of
images and video. Our approach is based around the concept of an image
signature which, unlike a standard bag of words model, can express
co-occurrence statistics as well as symbol frequency. We efficiently compute
metric distances between signatures despite their inherent high dimensionality
and provide discriminative feature selection, to allow common and distinctive
elements to be identified from a small set of user labelled examples. These
elements are then accentuated in the image signature to increase similarity
between examples and pull correct classes together. By repeating this process
in an online learning framework, the accuracy of similarity increases
dramatically despite labelling only a few training examples. To demonstrate
that the approach is agnostic to media type and features used, we evaluate on
three image datasets (15 scene, Caltech101 and FG-NET), a mixed text and image
dataset (ImageTag), a dataset used in active learning (Iris) and on three
action recognition datasets (UCF11, KTH and Hollywood2). On the UCF11 video
dataset, the accuracy is 86.7% despite using only 90 labelled examples from a
dataset of over 1200 videos, instead of the standard 1122 training videos. The
approach is both scalable and efficient, with a single iteration over the full
UCF11 dataset of around 1200 videos taking approximately 1 minute on a standard
desktop machine.
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2016 12:49:22 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Dec 2016 12:26:30 GMT'}]",2016-12-08,"[['Gilbert', 'Andrew', ''], ['Bowden', 'Richard', '']]","['Action Recognition', 'Data Mining', 'Real-time', 'Learning', 'Spatio-temporal', 'Clustering']"
17168,1506.08907,Sidharth Kashyap N,"Sidharth N. Kashyap, Ade J. Fewings, Jay Davies, Ian Morris, Andrew
  Thomas Thomas Green, Martyn F. Guest",Big Data at HPC Wales,"Accepted for publication at the 'Big Data Analytics Workshop' - 2014
  http://web.ornl.gov/sci/knowledgediscovery/CloudComputing/PDAC-SC14/BDAC-14-Agenda.htm",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes an automated approach to handling Big Data workloads on
HPC systems. We describe a solution that dynamically creates a unified cluster
based on YARN in an HPC Environment, without the need to configure and allocate
a dedicated Hadoop cluster. The end user can choose to write the solution in
any combination of supported frameworks, a solution that scales seamlessly from
a few cores to thousands of cores. This coupling of environments creates a
platform for applications to utilize the native HPC solutions along with the
Big Data Frameworks. The user will be provided with HPC Wales APIs in multiple
languages that will let them integrate this flow into their environment,
thereby ensuring that the traditional means of HPC access do not become a
bottleneck. We describe the behavior of the cluster creation and performance
results on Terasort.
","[{'version': 'v1', 'created': 'Tue, 30 Jun 2015 00:18:11 GMT'}]",2015-07-01,"[['Kashyap', 'Sidharth N.', ''], ['Fewings', 'Ade J.', ''], ['Davies', 'Jay', ''], ['Morris', 'Ian', ''], ['Green', 'Andrew Thomas Thomas', ''], ['Guest', 'Martyn F.', '']]","['Hadoop', 'HPC', 'YARN', 'Lustre']"
17169,1003.4066,William Jackson,"S. Vidhya, S. Karthikeyan",A Security Based Data Mining Approach in Data Grid,,"Journal of Computing, Volume 2, Issue 3, March 2010,
  https://sites.google.com/site/journalofcomputing/",,,cs.DC cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Grid computing is the next logical step to distributed computing. Main
objective of grid computing is an innovative approach to share resources such
as CPU usage; memory sharing and software sharing. Data Grids provide
transparent access to semantically related data resources in a heterogeneous
system. The system incorporates both data mining and grid computing techniques
where Grid application reduces the time for sending results to several clients
at the same time and Data mining application on computational grids gives fast
and sophisticated results to users. In this work, grid based data mining
technique is used to do automatic allocation based on probabilistic mining
frequent sequence algorithm. It finds frequent sequences for many users at a
time with accurate result. It also includes the trust management architecture
for trust enhanced security.
","[{'version': 'v1', 'created': 'Mon, 22 Mar 2010 05:30:53 GMT'}]",2010-03-23,"[['Vidhya', 'S.', ''], ['Karthikeyan', 'S.', '']]","['trust enhanced security', 'Data Grids', 'computational grids']"
17170,1708.00965,"Niko S\""underhauf","Niko S\""underhauf and Michael Milford","Dual Quadrics from Object Detection BoundingBoxes as Landmark
  Representations in SLAM",,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Research in Simultaneous Localization And Mapping (SLAM) is increasingly
moving towards richer world representations involving objects and high level
features that enable a semantic model of the world for robots, potentially
leading to a more meaningful set of robot-world interactions. Many of these
advances are grounded in state-of-the-art computer vision techniques primarily
developed in the context of image-based benchmark datasets, leaving several
challenges to be addressed in adapting them for use in robotics. In this paper,
we derive a formulation for Simultaneous Localization And Mapping (SLAM) that
uses dual quadrics as 3D landmark representations, and show how 2D bounding
boxes (such as those typically obtained from visual object detection systems)
can directly constrain the quadric parameters. Our paper demonstrates how to
jointly estimate the robot pose and dual quadric parameters in factor graph
based SLAM with a general perspective camera, and covers the use-cases of a
robot moving with a monocular camera with and without the availability of
additional depth information.
","[{'version': 'v1', 'created': 'Thu, 3 Aug 2017 01:30:18 GMT'}]",2017-08-04,"[['Sünderhauf', 'Niko', ''], ['Milford', 'Michael', '']]","['Semantic SLAM', 'Landmarks', 'Factor Graphs']"
17171,1602.06832,Mehmet Bask{\i}n,Mehmet Bask{\i}n and Kemal Leblebicio\u{g}lu,"Robust stabilization loop design for gimbaled electro-optical imaging
  system","13 pages, 9 figures",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For electro-optical imaging systems, line-of-sight stabilization against
different disturbances created by mobile platforms is crucial property. The
development of high resolution sensors and the demand in increased operating
distances have recently increased the expectations from stabilization loops.
For that reason, higher gains and larger bandwidths become necessary. As the
stabilization loop satisfies these requirements for good disturbance
attenuation, it must also satisfy sufficient loop stability. In gimbaled
imaging systems, the main difficulties in satisfying sufficient loop stability
are structural resonances and model uncertainties. Therefore, satisfying high
stabilization performance in the presence of model uncertainties or modeling
errors requires utilization of robust control methods. In this paper, robust
LQG/LTR controller design is described for a two-axis gimbal. First, the
classical LQG/LTR method is modified such that it becomes very powerful loop
shaping method. Next, using this method, controller is synthesized. Robust
stability and robust performance of stabilization loop is investigated by using
singular value tests. The report is concluded with the experimental validation
of the designed robust controller.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2016 15:49:18 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Mar 2016 13:24:13 GMT'}, {'version': 'v3', 'created': 'Mon, 25 Apr 2016 17:44:16 GMT'}]",2016-04-26,"[['Baskın', 'Mehmet', ''], ['Leblebicioğlu', 'Kemal', '']]","['LQG/LTR', 'robust multivariable control', 'line-of-sight stabilization', 'multi-axis gimbal', 'loop shaping']"
17172,1007.4114,Christian Drescher,Christian Drescher and Toby Walsh,A Translational Approach to Constraint Answer Set Solving,17 pages,"Theory and Practice of Logic Programming, 10(4-6), 465-480, 2010",,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new approach to enhancing Answer Set Programming (ASP) with
Constraint Processing techniques which allows for solving interesting
Constraint Satisfaction Problems in ASP. We show how constraints on finite
domains can be decomposed into logic programs such that unit-propagation
achieves arc, bound or range consistency. Experiments with our encodings
demonstrate their computational impact.
","[{'version': 'v1', 'created': 'Fri, 23 Jul 2010 12:37:00 GMT'}]",2010-07-26,"[['Drescher', 'Christian', ''], ['Walsh', 'Toby', '']]","['answer set programming', 'constraint processing', 'decomposition']"
17173,1507.01685,Archana Bhat,"Archana N., S. S. Pawar","Periodicity Detection of Outlier Sequences Using Constraint Based
  Pattern Tree with MAD","7 pages, 6 figures","International Journal of Advanced Studies in Computer Science and
  Engineering (IJASCSE), Volume 4, Issue 6;June 2015; PageNumber: 34-40",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Patterns that appear rarely or unusually in the data can be defined as
outlier patterns. The basic idea behind detecting outlier patterns is
comparison of their relative frequencies with frequent patterns. Their
frequencies of appearance are less and thus have lesser support in the data.
Detecting outlier patterns is an important data mining task which will reveal
some interesting facts. The search for periodicity of patterns gives the
behavior of these patterns across time as to when they repeat likely. This in
turn helps in prediction of events. These patterns are found in Time
series-data, social networks etc. In this paper, an algorithm for periodic
outlier pattern detection is proposed with the usage of a Constraint Based FP
(Frequent Pattern)-tree as the underlying data structure for time series data.
The growth of the tree is limited by using level and monotonic constraints. The
protein sequence of bacteria named E.Coli is collected and periodic outlier
patterns in the sequence are identified. Further the enhancement of results is
obtained by finding the Median Absolute Deviation (MAD) in defining candidate
outlier patterns. The comparative results between STNR-out (Suffix Tree Noise
Resilient for Outlier Detection) and proposed algorithm are illustrated. The
results show the effectiveness and applicability of the proposed algorithm.
","[{'version': 'v1', 'created': 'Tue, 7 Jul 2015 06:48:40 GMT'}]",2015-07-08,"[['N.', 'Archana', ''], ['Pawar', 'S. S.', '']]","['Periodic patterns', 'protein sequence', 'pattern mining', 'outlier pattern', 'periodicity detection', 'constraint based periodicity mining', 'MAD']"
17174,1403.0481,Arindam Chaudhuri AC,Arindam Chaudhuri,Support Vector Machine Model for Currency Crisis Discrimination,"Book Chapter Selected Works in Infrastructural Finance, Rudra P.
  Pradhan, Indian Institute of Technology Kharagpur, Editor, Macmillan
  Publishers, India, pp 249 - 256, 2011",,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Support Vector Machine (SVM) is powerful classification technique based on
the idea of structural risk minimization. Use of kernel function enables curse
of dimensionality to be addressed. However, proper kernel function for certain
problem is dependent on specific dataset and as such there is no good method on
choice of kernel function. In this paper, SVM is used to build empirical models
of currency crisis in Argentina. An estimation technique is developed by
training model on real life data set which provides reasonably accurate model
outputs and helps policy makers to identify situations in which currency crisis
may happen. The third and fourth order polynomial kernel is generally best
choice to achieve high generalization of classifier performance. SVM has high
level of maturity with algorithms that are simple, easy to implement, tolerates
curse of dimensionality and good empirical performance. The satisfactory
results show that currency crisis situation is properly emulated using only
small fraction of database and could be used as an evaluation tool as well as
an early warning system. To the best of knowledge this is the first work on SVM
approach for currency crisis evaluation of Argentina.
","[{'version': 'v1', 'created': 'Mon, 3 Mar 2014 16:34:38 GMT'}]",2014-03-04,"[['Chaudhuri', 'Arindam', '']]","['Currency crisis discrimination', 'Support Vector Machine', 'Sensitivity', 'Specificity', 'Accuracy', 'Noise/Signal Ratio']"
17175,1409.4447,Changhong Zhao,"Changhong Zhao, Michael Chertkov, and Scott Backhaus","Optimal Sizing of Voltage Control Devices for Distribution Circuit with
  Intermittent Load","10 pages, 7 figures, submitted to HICSS'15",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider joint control of a switchable capacitor and a D-STATCOM for
voltage regulation in a distribution circuit with intermittent load. The
control problem is formulated as a two-timescale optimal power flow problem
with chance constraints, which minimizes power loss while limiting the
probability of voltage violations due to fast changes in load. The control
problem forms the basis of an optimization problem which determines the sizes
of the control devices by minimizing sum of the expected power loss cost and
the capital cost. We develop computationally efficient heuristics to solve the
optimal sizing problem and implement real-time control. Numerical experiments
on a circuit with high-performance computing (HPC) load show that the proposed
sizing and control schemes significantly improve the reliability of voltage
regulation on the expense of only a moderate increase in cost.
","[{'version': 'v1', 'created': 'Mon, 15 Sep 2014 20:53:46 GMT'}]",2014-09-17,"[['Zhao', 'Changhong', ''], ['Chertkov', 'Michael', ''], ['Backhaus', 'Scott', '']]","['Distribution circuit', 'voltage control', 'device sizing']"
17176,1605.01126,Yi Ren,"Wei-Han Chen, Yi Ren, Chia-Wei Chang, and Jyh-Cheng Chen","Design and Analysis of Optimal Threshold Offloading (OTO) Algorithm for
  LTE Femtocell/Macrocell Networks","31 pages, 8 figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  LTE femtocells have been widely deployed to increase network capacity and to
offload mobile data traffic from macrocells. While cellular users' mobility
behaviors are taken into consideration, a dilemma is formed: Should a User
Equipment (UE) either handover into a femtocell or keep the current connection
with a macrocell? Indeed, various user mobility behaviors may incur significant
signaling overhead and degrade femtocell offloading capability due to frequent
handover in/out femtocells. To address this dilemma, in this paper we propose
an Optimal Threshold Offloading (OTO) algorithm considering the tradeoff
between the signaling overhead and femtocell offloading capability. We develop
an analytical model and define two performance metrics to quantify the
tradeoff. The proposed model not only models user mobility behaviors but also
captures femtocell offloading benefits, and shed light on their fundamental
relationship. The correctness of analytical model and simulation model are
cross-validated by extensive ns2 simulations. Both analytical and simulation
results demonstrate that the OTO algorithm can significantly reduce signaling
overhead at the minor cost of femtocell offloading capability. The results
enable wide applicability in various scenarios, and therefore, have important
theoretical significance. Moreover, the analytical results provide a quick way
to evaluate signaling overhead and offloading capability in LTE networks
without wide deployment, saving on cost and time.
","[{'version': 'v1', 'created': 'Wed, 4 May 2016 01:58:57 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Jun 2016 01:42:33 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Jul 2016 01:40:51 GMT'}]",2016-07-14,"[['Chen', 'Wei-Han', ''], ['Ren', 'Yi', ''], ['Chang', 'Chia-Wei', ''], ['Chen', 'Jyh-Cheng', '']]","['LTE', 'Offloading', 'Femtocell', 'Performance Analysis']"
17177,1512.02356,Sanjib Sadhu Mr,"Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheswari, and Subhas C.
  Nandy",Approximation algorithms for the two-center problem of convex polygon,"27 pages, 18 figures",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a convex polygon $P$ with $n$ vertices, the two-center problem is to
find two congruent closed disks of minimum radius such that they completely
cover $P$. We propose an algorithm for this problem in the streaming setup,
where the input stream is the vertices of the polygon in clockwise order. It
produces a radius $r$ satisfying $r\leq2r_{opt}$ using $O(1)$ space, where
$r_{opt}$ is the optimum solution. Next, we show that in non-streaming setup,
we can improve the approximation factor by $r\leq 1.84 r_{opt}$, maintaining
the time complexity of the algorithm to $O(n)$, and using $O(1)$ extra space in
addition to the space required for storing the input.
","[{'version': 'v1', 'created': 'Tue, 8 Dec 2015 07:15:56 GMT'}]",2015-12-09,"[['Sadhu', 'Sanjib', ''], ['Roy', 'Sasanka', ''], ['Nandi', 'Soumen', ''], ['Maheswari', 'Anil', ''], ['Nandy', 'Subhas C.', '']]","['Computational geometry', 'two-center problem', 'lower bound', 'approximationalgorithm', 'streaming algorithm']"
17178,0906.1680,Pierre Cocheteux,"Pierre Cocheteux (CRAN), Alexandre Voisin (CRAN), Eric Levrat (CRAN),
  Beno\^it Iung (CRAN)","Methodology for assessing system performance loss within a proactive
  maintenance framework",,"13th IFAC Symposium on Information Control Problems in
  Manufacturing, INCOM'09, Moscow : Russie (2009)",,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Maintenance plays now a critical role in manufacturing for achieving
important cost savings and competitive advantage while preserving product
conditions. It suggests moving from conventional maintenance practices to
predictive strategy. Indeed the maintenance action has to be done at the right
time based on the system performance and component Remaining Useful Life (RUL)
assessed by a prognostic process. In that way, this paper proposes a
methodology in order to evaluate the performance loss of the system according
to the degradation of component and the deviations of system input flows. This
methodology is supported by the neuro-fuzzy tool ANFIS (Adaptive Neuro-Fuzzy
Inference Systems) that allows to integrate knowledge from two different
sources: expertise and real data. The feasibility and added value of such
methodology is then highlighted through an application case extracted from the
TELMA platform used for education and research.
","[{'version': 'v1', 'created': 'Tue, 9 Jun 2009 09:54:49 GMT'}]",2009-06-10,"[['Cocheteux', 'Pierre', '', 'CRAN'], ['Voisin', 'Alexandre', '', 'CRAN'], ['Levrat', 'Eric', '', 'CRAN'], ['Iung', 'Benoît', '', 'CRAN']]","['maintenance', 'prognostic', 'system performance', 'ANFIS']"
17179,0706.0507,Hichem Geryville,"Hichem Geryville (LIESP), Yacine Ouzrout (LIESP), Abdelaziz Bouras
  (LIESP), Nikolaos Sapidis","A collaborative framework to exchange and share product information
  within a supply chain context",,,,,cs.HC,,"  The new requirement for ""collaboration"" between multidisciplinary
collaborators induces to exchange and share adequate information on the
product, processes throughout the products' lifecycle. Thus, effective capture
of information, and also its extraction, recording, exchange, sharing, and
reuse become increasingly critical. These lead companies to adopt new improved
methodologies in managing the exchange and sharing of information. The aim of
this paper is to describe a collaborative framework system to exchange and
share information, which is based on: (i) The Product Process Collaboration
Organization model (PPCO) which defines product and process information, and
the various collaboration methods for the organizations involved in the supply
chain. (ii) Viewpoint model describes relationships between each actor and the
comprehensive Product/Process model, defining each actor's ""domain of interest""
within the evolving product definition. (iii) A layer which defines the
comprehensive organization and collaboration relationships between the actors
within the supply chain. (iv) Based on the above relationships, the last layer
proposes a typology of exchanged messages. A communication method, based on
XML, is developed that supports optimal exchange/sharing of information. To
illustrate the proposed framework system, an example is presented related to
collaborative design of a new piston for an automotive engine. The focus is on
user-viewpoint integration to ensure that the adequate information is retrieved
from the PPCO.
","[{'version': 'v1', 'created': 'Mon, 4 Jun 2007 19:48:07 GMT'}]",2011-11-10,"[['Geryville', 'Hichem', '', 'LIESP'], ['Ouzrout', 'Yacine', '', 'LIESP'], ['Bouras', 'Abdelaziz', '', 'LIESP'], ['Sapidis', 'Nikolaos', '']]","['― Product Lifecycle Management (PLM)', 'Supply Chain Management (SCM)', 'Collaboration', 'Viewpoint', 'Product Information Exchange']"
17180,1306.4022,Vasilis Syrgkanis,"Balasubramanian Sivan, Vasilis Syrgkanis",Vickrey Auctions for Irregular Distributions,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The classic result of Bulow and Klemperer \cite{BK96} says that in a
single-item auction recruiting one more bidder and running the Vickrey auction
achieves a higher revenue than the optimal auction's revenue on the original
set of bidders, when values are drawn i.i.d. from a regular distribution. We
give a version of Bulow and Klemperer's result in settings where bidders'
values are drawn from non-i.i.d. irregular distributions. We do this by
modeling irregular distributions as some convex combination of regular
distributions. The regular distributions that constitute the irregular
distribution correspond to different population groups in the bidder
population. Drawing a bidder from this collection of population groups is
equivalent to drawing from some convex combination of these regular
distributions. We show that recruiting one extra bidder from each underlying
population group and running the Vickrey auction gives at least half of the
optimal auction's revenue on the original set of bidders.
","[{'version': 'v1', 'created': 'Mon, 17 Jun 2013 21:19:08 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Oct 2013 19:07:13 GMT'}]",2013-10-07,"[['Sivan', 'Balasubramanian', ''], ['Syrgkanis', 'Vasilis', '']]","['Bulow-Klemperer', 'irregular distributions', 'prior-independent', 'Vickrey auction']"
17181,1702.01666,Maciej  Skorski,Maciej Skorski,On the Complexity of Estimating Renyi Divergences,"some typos fixed and references added (comparing to the previous
  version)",,,,cs.IT cs.CC math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies the complexity of estimating Renyi divergences of discrete
distributions: $p$ observed from samples and the baseline distribution $q$
known \emph{a priori}. Extending the results of Acharya et al. (SODA'15) on
estimating Renyi entropy, we present improved estimation techniques together
with upper and lower bounds on the sample complexity.
  We show that, contrarily to estimating Renyi entropy where a sublinear (in
the alphabet size) number of samples suffices, the sample complexity is heavily
dependent on \emph{events occurring unlikely} in $q$, and is unbounded in
general (no matter what an estimation technique is used). For any divergence of
order bigger than $1$, we provide upper and lower bounds on the number of
samples dependent on probabilities of $p$ and $q$. We conclude that the
worst-case sample complexity is polynomial in the alphabet size if and only if
the probabilities of $q$ are non-negligible.
  This gives theoretical insights into heuristics used in applied papers to
handle numerical instability, which occurs for small probabilities of $q$. Our
result explains that small probabilities should be handled with care not only
because of numerical issues, but also because of a blow up in sample
complexity.
","[{'version': 'v1', 'created': 'Mon, 6 Feb 2017 15:48:51 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Feb 2017 12:08:22 GMT'}]",2017-02-09,"[['Skorski', 'Maciej', '']]","['Renyi divergence', 'sampling complexity', 'anomalydetection']"
17182,1502.05871,Maja Lakicevic,"Maja Lakicevic, Mitar Moracanin, Nadja Djerkovic",Robust CS reconstruction based on appropriate minimization norm,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Noise robust compressive sensing algorithm is considered. This algorithm
allows an efficient signal reconstruction in the presence of different types of
noise due to the possibility to change minimization norm. For instance, the
commonly used l1 and l2 norms, provide good results in case of Laplace and
Gaussian noise. However, when the signal is corrupted by Cauchy or Cubic
Gaussian noise, these norms fail to provide accurate reconstruction. Therefore,
in order to achieve accurate reconstruction, the application of l3 minimization
norm is analyzed. The efficiency of algorithm will be demonstrated on examples.
","[{'version': 'v1', 'created': 'Fri, 20 Feb 2015 13:53:54 GMT'}]",2015-02-23,"[['Lakicevic', 'Maja', ''], ['Moracanin', 'Mitar', ''], ['Djerkovic', 'Nadja', '']]","['Compressive sensing', 'signal reconstruction', 'minimization norms', 'sparse', 'non-iterative algorithm']"
17183,1108.0502,Ankit Chaudhary,"Jagdish Lal Raheja, Karen Das, Ankit Chaudhary",An Efficient Real Time Method of Fingertip Detection,"This paper was published in the 7th International Conference on
  Trends in Industrial Measurements and Automation (TIMA 2011), CSIR Complex,
  Chennai, India, 6-8 Jan, 2011, pp. 447-450","7th International Conference on Trends in Industrial Measurements
  and Automation (TIMA 2011), CSIR Complex, Chennai, India, 6-8 Jan, 2011, pp.
  447-450",,,cs.CV cs.AI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fingertips detection has been used in many applications, and it is very
popular and commonly used in the area of Human Computer Interaction these days.
This paper presents a novel time efficient method that will lead to fingertip
detection after cropping the irrelevant parts of input image. Binary silhouette
of the input image is generated using HSV color space based skin filter and
hand cropping done based on histogram of the hand image. The cropped image will
be used to figure out the fingertips.
","[{'version': 'v1', 'created': 'Tue, 2 Aug 2011 07:46:16 GMT'}]",2015-03-13,"[['Raheja', 'Jagdish Lal', ''], ['Das', 'Karen', ''], ['Chaudhary', 'Ankit', '']]","['Human Computer Interface', 'Skin Filter', 'Image Segmentation', 'Binary Silhouette', 'Interactive Real Time Systems']"
17184,1307.1805,Michele Scquizzato,Michele Scquizzato and Francesco Silvestri,Communication Lower Bounds for Distributed-Memory Computations,Minor edits,,,,cs.DS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give lower bounds on the communication complexity required to solve
several computational problems in a distributed-memory parallel machine, namely
standard matrix multiplication, stencil computations, comparison sorting, and
the Fast Fourier Transform. We revisit the assumptions under which preceding
results were derived and provide new lower bounds which use much weaker and
appropriate hypotheses. Our bounds rely on a mild assumption on work
distribution, and strengthen previous results which require either the
computation to be balanced among the processors, or specific initial
distributions of the input data, or an upper bound on the size of processors'
local memories.
","[{'version': 'v1', 'created': 'Sat, 6 Jul 2013 18:40:47 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Sep 2013 21:51:59 GMT'}]",2013-09-24,"[['Scquizzato', 'Michele', ''], ['Silvestri', 'Francesco', '']]","['Communication', 'lower bounds', 'distributed memory', 'parallel algorithms', 'BSP']"
17185,1307.2001,Uwe Aickelin,"Aslam Ahmed, Julie Greensmith, Uwe Aickelin","Variance in System Dynamics and Agent Based Modelling Using the SIR
  Model of Infectious Disease","Proceedings of the 26th European Conference on Modelling and
  Simulation (ECMS), Koblenz, Germany, May 2012, pp 9-15, 2012",,,,cs.CE cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classical deterministic simulations of epidemiological processes, such as
those based on System Dynamics, produce a single result based on a fixed set of
input parameters with no variance between simulations. Input parameters are
subsequently modified on these simulations using Monte-Carlo methods, to
understand how changes in the input parameters affect the spread of results for
the simulation. Agent Based simulations are able to produce different output
results on each run based on knowledge of the local interactions of the
underlying agents and without making any changes to the input parameters. In
this paper we compare the influence and effect of variation within these two
distinct simulation paradigms and show that the Agent Based simulation of the
epidemiological SIR (Susceptible, Infectious, and Recovered) model is more
effective at capturing the natural variation within SIR compared to an
equivalent model using System Dynamics with Monte-Carlo simulation. To
demonstrate this effect, the SIR model is implemented using both System
Dynamics (with Monte-Carlo simulation) and Agent Based Modelling based on
previously published empirical data.
","[{'version': 'v1', 'created': 'Mon, 8 Jul 2013 09:28:27 GMT'}]",2013-07-09,"[['Ahmed', 'Aslam', ''], ['Greensmith', 'Julie', ''], ['Aickelin', 'Uwe', '']]","['System Dynamics', 'Agent Based Modelling', 'SIR', 'Uncertainty', 'Variance']"
17186,1207.4278,Jyotirmoy Karjee,"Jyotirmoy Karjee, H.S Jamadagni","Spatio-Temporal Data Correlation with Adaptive Strategies in Wireless
  Sensor Networks",9 pages,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the major task of sensor nodes in wireless sensor networks is to
transmit a subset of sensor readings to the sink node estimating a desired data
accuracy. Therefore in this paper, we propose an accuracy model using Steepest
Decent method called Adaptive Data Accuracy (ADA) model which doesn't require
any a priori information of input signal statistics to select an optimal set of
sensor nodes in the network. Moreover we develop another model using LMS filter
called Spatio-Temporal Data Prediction (STDP) model which captures the spatial
and temporal correlation of sensing data to reduce the communication overhead
under data reduction strategies. Finally using STDP model, we illustrate a
mechanism to trace the malicious nodes in the network under extreme physical
environment. Computer simulations illustrate the performance of ADA and STDP
models respectively.
","[{'version': 'v1', 'created': 'Wed, 18 Jul 2012 07:10:04 GMT'}]",2012-07-19,"[['Karjee', 'Jyotirmoy', ''], ['Jamadagni', 'H. S', '']]","['Wireless senor networks', 'data accuracy', 'spatial correlation', 'adaptive filter']"
17187,0805.0747,Daniel Lemire,"Hazel Webb, Owen Kaser, Daniel Lemire",Pruning Attribute Values From Data Cubes with Diamond Dicing,,,,TR-08-011 (UNB Saint John),cs.DB cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data stored in a data warehouse are inherently multidimensional, but most
data-pruning techniques (such as iceberg and top-k queries) are unidimensional.
However, analysts need to issue multidimensional queries. For example, an
analyst may need to select not just the most profitable stores
or--separately--the most profitable products, but simultaneous sets of stores
and products fulfilling some profitability constraints. To fill this need, we
propose a new operator, the diamond dice. Because of the interaction between
dimensions, the computation of diamonds is challenging. We present the first
diamond-dicing experiments on large data sets. Experiments show that we can
compute diamond cubes over fact tables containing 100 million facts in less
than 35 minutes using a standard PC.
","[{'version': 'v1', 'created': 'Tue, 6 May 2008 15:45:15 GMT'}]",2008-05-07,"[['Webb', 'Hazel', ''], ['Kaser', 'Owen', ''], ['Lemire', 'Daniel', '']]","['Diamond cube', 'data warehouses', 'information retrieval', 'OLAP']"
17188,1609.05235,Saurav Agarwal,"Saurav Agarwal, Vikram Shree, Suman Chakravorty","RFM-SLAM: Exploiting Relative Feature Measurements to Separate
  Orientation and Position Estimation in SLAM","9 pages, submitted to IEEE ICRA 2017",,,,cs.RO cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The SLAM problem is known to have a special property that when robot
orientation is known, estimating the history of robot poses and feature
locations can be posed as a standard linear least squares problem. In this
work, we develop a SLAM framework that uses relative feature-to-feature
measurements to exploit this structural property of SLAM. Relative feature
measurements are used to pose a linear estimation problem for pose-to-pose
orientation constraints. This is followed by solving an iterative non-linear
on-manifold optimization problem to compute the maximum likelihood estimate for
robot orientation given relative rotation constraints. Once the robot
orientation is computed, we solve a linear problem for robot position and map
estimation. Our approach reduces the computational burden of non-linear
optimization by posing a smaller optimization problem as compared to standard
graph-based methods for feature-based SLAM. Further, empirical results show our
method avoids catastrophic failures that arise in existing methods due to using
odometery as an initial guess for non-linear optimization, while its accuracy
degrades gracefully as sensor noise is increased. We demonstrate our method
through extensive simulations and comparisons with an existing state-of-the-art
solver.
","[{'version': 'v1', 'created': 'Fri, 16 Sep 2016 21:01:08 GMT'}]",2016-09-20,"[['Agarwal', 'Saurav', ''], ['Shree', 'Vikram', ''], ['Chakravorty', 'Suman', '']]","['SLAM', 'graph-based SLAM', 'non-linear optimization', 'relative measurements']"
17189,0908.3670,Jinwoo Shin,"Devavrat Shah, Jinwoo Shin",Randomized Scheduling Algorithm for Queueing Networks,,,,,cs.IT cs.NI math.IT math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There has recently been considerable interest in design of low-complexity,
myopic, distributed and stable scheduling policies for constrained queueing
network models that arise in the context of emerging communication networks.
Here, we consider two representative models. One, a model for the collection of
wireless nodes communicating through a shared medium, that represents randomly
varying number of packets in the queues at the nodes of networks. Two, a
buffered circuit switched network model for an optical core of future Internet,
to capture the randomness in calls or flows present in the network. The maximum
weight scheduling policy proposed by Tassiulas and Ephremide in 1992 leads to a
myopic and stable policy for the packet-level wireless network model. But
computationally it is very expensive (NP-hard) and centralized. It is not
applicable to the buffered circuit switched network due to the requirement of
non-premption of the calls in the service. As the main contribution of this
paper, we present a stable scheduling algorithm for both of these models. The
algorithm is myopic, distributed and performs few logical operations at each
node per unit time.
","[{'version': 'v1', 'created': 'Tue, 25 Aug 2009 19:44:58 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Apr 2010 18:26:21 GMT'}]",2010-04-06,"[['Shah', 'Devavrat', ''], ['Shin', 'Jinwoo', '']]","['Wireless Medium Access', 'Buffered Circuit Switched Network', 'Aloha', 'Stability', 'Scheduling', 'Mixing time', 'Slowly Varying Markov Chain']"
17190,1312.6273,Minyar Sassi,"Sonia Alouane-Ksouri, Minyar Sassi-Hidri, Kamel Barkaoui",Parallel architectures for fuzzy triadic similarity learning,,"International Conference on Control, Engineering & Information
  Technology (CEIT), Proceedings Engineering & Technology, Vol. 1, pp. 121-126,
  2013",,,cs.DC cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a context of document co-clustering, we define a new similarity measure
which iteratively computes similarity while combining fuzzy sets in a
three-partite graph. The fuzzy triadic similarity (FT-Sim) model can deal with
uncertainty offers by the fuzzy sets. Moreover, with the development of the Web
and the high availability of storage spaces, more and more documents become
accessible. Documents can be provided from multiple sites and make similarity
computation an expensive processing. This problem motivated us to use parallel
computing. In this paper, we introduce parallel architectures which are able to
treat large and multi-source data sets by a sequential, a merging or a
splitting-based process. Then, we proceed to a local and a central (or global)
computing using the basic FT-Sim measure. The idea behind these architectures
is to reduce both time and space complexities thanks to parallel computation.
","[{'version': 'v1', 'created': 'Sat, 21 Dec 2013 16:51:26 GMT'}]",2013-12-24,"[['Alouane-Ksouri', 'Sonia', ''], ['Sassi-Hidri', 'Minyar', ''], ['Barkaoui', 'Kamel', '']]","['Documentco-clustering', 'Three-partitegraph', 'Fuzzy sets', 'Parallel computing']"
17191,1704.03761,Juan Jacobo Sim\'on-Pinero,"J. J. Bernal, M. Guerreiro, J. J. Sim\'on",From ds-bounds for cyclic codes to true distance for abelian codes,arXiv admin note: text overlap with arXiv:1604.02949,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we develop a technique to extend any bound for the minimum
distance of cyclic codes constructed from its defining sets (ds-bounds) to
abelian (or multivariate) codes through the notion of $\mathbb{B}$-apparent
distance. We use this technique to improve the searching for new bounds for the
minimum distance of abelian codes. We also study conditions for an abelian code
to verify that its $\mathbb{B}$-apparent distance reaches its (true) minimum
distance. Then we construct some tables of such codes as an application
","[{'version': 'v1', 'created': 'Wed, 12 Apr 2017 14:00:45 GMT'}]",2017-04-13,"[['Bernal', 'J. J.', ''], ['Guerreiro', 'M.', ''], ['Simón', 'J. J.', '']]","['Abelian code', 'bounds for minimum distance', 'true minimum distance', 'algorithm']"
17192,1208.0203,Mohamed Salah  Gouider Dr,Saida Aissi and Mohamed Salah Gouider,"Towards the Next Generation of Data Warehouse Personalization System: A
  Survey and a Comparative Study",8 pages,"IJCSI International Journal of Computer Science Issues, Vol 9,
  Issue 3, No 2, May 2012, pages 561-568",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multidimensional databases are a great asset for decision making. Their users
express complex OLAP (On-Line Analytical Processing) queries, often returning
huge volumes of facts, sometimes providing little or no information.
Furthermore, due to the huge volume of historical data stored in DWs, the OLAP
applications may return a big amount of irrelevant information that could make
the data exploration process not efficient and tardy. OLAP personalization
systems play a major role in reducing the effort of decision-makers to find the
most interesting information. Several works dealing with OLAP personalization
were presented in the last few years. This paper aims to provide a
comprehensive review of literature on OLAP personalization approaches. A
benchmarking study of OLAP personalization methods is proposed. Several
evaluation criteria are used to identify the existence of trends as well as
potential needs for further investigations.
","[{'version': 'v1', 'created': 'Wed, 1 Aug 2012 13:27:20 GMT'}]",2012-08-02,"[['Aissi', 'Saida', ''], ['Gouider', 'Mohamed Salah', '']]","['OLAP personalization', 'recommendation', 'personalization', 'profile']"
17193,1511.06053,Nitesh Goyal,Nitesh Goyal,Designing for Collaborative Sensemaking: Using Expert & Non-Expert Crowd,"conference in Companion of The Third AAAI Conference on Human
  Computation and Crowdsourcing (HCOMP-2015). arXiv admin note: substantial
  text overlap with arXiv:1511.05737",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crime solving is a domain where solution discovery is often serendipitous.
Unstructured mechanisms, like Reddit, for crime solving through crowds have
failed so far. Mechanisms, collaborations, workflows, and micro-tasks necessary
for successful crime solving might also vary across different crimes.
Cognitively, while experts might have deeper domain knowledge, they might also
fall prey to biased analysis. Non-experts, while lacking formal training, might
instead offer non-conventional perspectives requiring direction. The analytical
process is itself an iterative process of foraging and sensemaking. Users would
explore to broaden solution space and narrow down to a solution iteratively
until identifying the global maxima instead of local maxima. In this proposal,
my research aims to design systems for enabling complex sensemaking tasks that
require collaboration between remotely located non-expert crowds with expert
crowds to compensate for their cognitive challenges and lack of training. This
would require better understanding of the structure, workflow, and micro-tasks
necessary for successful collaborations. This proposal builds upon previous
work on collaborative sensemaking between remote partners in lab experiments
and endeavors to scale it across multiple team members, with varying expertise
levels.
","[{'version': 'v1', 'created': 'Thu, 19 Nov 2015 03:55:13 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Nov 2015 01:41:04 GMT'}]",2015-11-25,"[['Goyal', 'Nitesh', '']]","['sensemaking', 'collaborative sensemaking', 'expert crowdsourcing']"
17194,0910.0316,Rdv Ijcsis,"P. Ganeshkumar, K. Thyagarajah","An Analysis of Energy Consumption on ACK plus Rate Packet in Rate Based
  Transport Protocol","7 pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 5, No. 1, pp. 96-102, September 2009, USA",,ISSN 1947 5500,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rate based transport protocol determines the rate of data transmission
between the sender and receiver and then sends the data according to that rate.
To notify the rate to the sender, the receiver sends ACKplusRate packet based
on epoch timer expiry. In this paper, through detailed arguments and simulation
it is shown that the transmission of ACKplusRate packet based on epoch timer
expiry consumes more energy in network with low mobility. To overcome this
problem, a new technique called Dynamic Rate Feedback (DRF) is proposed. DRF
sends ACKplusRate whenever there is a change in rate of (plus or minus) 25
percent than the previous rate. Based on ns2 simulation DRF is compared with a
reliable transport protocol for ad hoc network (ATP)
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2009 03:28:20 GMT'}]",2009-10-05,"[['Ganeshkumar', 'P.', ''], ['Thyagarajah', 'K.', '']]","['Ad hoc network', 'Ad hoc transport Protocol', 'Rate based transport protocols', 'energy consumption', 'Intermediate node']"
17195,1712.03645,Kumiko Tanaka-Ishii,Kumiko Tanaka-Ishii,"Long-Range Correlation Underlying Childhood Language and Generative
  Models",,,,,cs.CL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Long-range correlation, a property of time series exhibiting long-term
memory, is mainly studied in the statistical physics domain and has been
reported to exist in natural language. Using a state-of-the-art method for such
analysis, long-range correlation is first shown to occur in long CHILDES data
sets. To understand why, Bayesian generative models of language, originally
proposed in the cognitive scientific domain, are investigated. Among
representative models, the Simon model was found to exhibit surprisingly good
long-range correlation, but not the Pitman-Yor model. Since the Simon model is
known not to correctly reflect the vocabulary growth of natural language, a
simple new model is devised as a conjunct of the Simon and Pitman-Yor models,
such that long-range correlation holds with a correct vocabulary growth rate.
The investigation overall suggests that uniform sampling is one cause of
long-range correlation and could thus have a relation with actual linguistic
processes.
","[{'version': 'v1', 'created': 'Mon, 11 Dec 2017 04:48:43 GMT'}]",2017-12-12,"[['Tanaka-Ishii', 'Kumiko', '']]","['Bayesian generative models of language', 'long-range correlation', 'autocorrelationfunction', 'vocabulary growth']"
17196,0806.2008,Arnaud Martin,"Arnaud Martin (E3I2), Christophe Osswald (E3I2)","Generalized proportional conflict redistribution rule applied to Sonar
  imagery and Radar targets classification",,"Advances and Applications of DSmT for Information Fusion,
  Florentin Smarandache & Jean Dezert (Ed.) (2006) 289-304",,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this chapter, we present two applications in information fusion in order
to evaluate the generalized proportional conflict redistribution rule presented
in the chapter \cite{Martin06a}. Most of the time the combination rules are
evaluated only on simple examples. We study here different combination rules
and compare them in terms of decision on real data. Indeed, in real
applications, we need a reliable decision and it is the final results that
matter. Two applications are presented here: a fusion of human experts opinions
on the kind of underwater sediments depict on sonar image and a classifier
fusion for radar targets recognition.
","[{'version': 'v1', 'created': 'Thu, 12 Jun 2008 06:47:26 GMT'}]",2008-12-18,"[['Martin', 'Arnaud', '', 'E3I2'], ['Osswald', 'Christophe', '', 'E3I2']]","['Experts fusion', 'classification', 'DST', 'DSmT', 'generalizedPCR', 'Sonar', 'Radar']"
17197,1111.3530,Shah Mahmood Mr.,Shah Mahmood and Yvo Desmedt,Preliminary Analysis of Google+'s Privacy,"CCS'11, October 17-21, 2011, Chicago, Illinois, USA",,,,cs.SI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we provide a preliminary analysis of Google+ privacy. We
identified that Google+ shares photo metadata with users who can access the
photograph and discuss its potential impact on privacy. We also identified that
Google+ encourages the provision of other names including maiden name, which
may help criminals performing identity theft. We show that Facebook lists are a
superset of Google+ circles, both functionally and logically, even though
Google+ provides a better user interface. Finally we compare the use of
encryption and depth of privacy control in Google+ versus in Facebook.
","[{'version': 'v1', 'created': 'Tue, 15 Nov 2011 13:52:30 GMT'}]",2011-11-16,"[['Mahmood', 'Shah', ''], ['Desmedt', 'Yvo', '']]","['Google+', 'Social Network', 'Privacy', 'Facebook']"
17198,0806.1797,Arnaud Martin,"Arnaud Martin (E3I2), Christophe Osswald (E3I2)","A new generalization of the proportional conflict redistribution rule
  stable in terms of decision",,"Advances and Applications of DSmT for Information Fusion,
  Florentin Smarandache & Jean Dezert (Ed.) (2006) 69-88",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this chapter, we present and discuss a new generalized proportional
conflict redistribution rule. The Dezert-Smarandache extension of the
Demster-Shafer theory has relaunched the studies on the combination rules
especially for the management of the conflict. Many combination rules have been
proposed in the last few years. We study here different combination rules and
compare them in terms of decision on didactic example and on generated data.
Indeed, in real applications, we need a reliable decision and it is the final
results that matter. This chapter shows that a fine proportional conflict
redistribution rule must be preferred for the combination in the belief
function theory.
","[{'version': 'v1', 'created': 'Wed, 11 Jun 2008 07:05:48 GMT'}]",2008-12-18,"[['Martin', 'Arnaud', '', 'E3I2'], ['Osswald', 'Christophe', '', 'E3I2']]","['Experts fusion', 'DST', 'DSmT', 'generalized PCR', 'DSmH']"
17199,1602.07721,Matthew Guzdial,Matthew Guzdial and Mark Riedl,Toward Game Level Generation from Gameplay Videos,"8 pages, 10 figures, Procedural Content Generation Workshop 2015",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Algorithms that generate computer game content require game design knowledge.
We present an approach to automatically learn game design knowledge for level
design from gameplay videos. We further demonstrate how the acquired design
knowledge can be used to generate sections of game levels. Our approach
involves parsing video of people playing a game to detect the appearance of
patterns of sprites and utilizing machine learning to build a probabilistic
model of sprite placement. We show how rich game design information can be
automatically parsed from gameplay videos and represented as a set of
generative probabilistic models. We use Super Mario Bros. as a proof of
concept. We evaluate our approach on a measure of playability and stylistic
similarity to the original levels as represented in the gameplay videos.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2016 02:38:16 GMT'}]",2016-02-26,"[['Guzdial', 'Matthew', ''], ['Riedl', 'Mark', '']]","['Procedural content generation', 'probabilistic models', 'machine learning']"
17200,1504.02840,Ahmad Pahlavan Tafti,"Ahmad Pahlavan Tafti, Hamid Hassannia, Zeyun Yu","siftservice.com - Turning a Computer Vision algorithm into a World Wide
  Web Service","8 pages, 7 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image features detection and description is a longstanding topic in computer
vision and pattern recognition areas. The Scale Invariant Feature Transform
(SIFT) is probably the most popular and widely demanded feature descriptor
which facilitates a variety of computer vision applications such as image
registration, object tracking, image forgery detection, and 3D surface
reconstruction. This work introduces a Software as a Service (SaaS) based
implementation of the SIFT algorithm which is freely available at
http://siftservice.com for any academic, educational and research purposes. The
service provides application-to-application interaction and aims Rapid
Application Development (RAD) and also fast prototyping for computer vision
students and researchers all around the world. An Internet connection is all
they need!
","[{'version': 'v1', 'created': 'Sat, 11 Apr 2015 05:47:09 GMT'}]",2015-04-14,"[['Tafti', 'Ahmad Pahlavan', ''], ['Hassannia', 'Hamid', ''], ['Yu', 'Zeyun', '']]","['Computer Vision', 'SIFT Algorithm', 'Software as a Service(SaaS)']"
17201,1402.5768,Richard McClatchey,"David Manset, Richard McClatchey and Herve Verjus",Model Driven Engineering for Science Gateways,"10 pages, 6 figures and 1 table. 14th International Conference on
  Enterprise Information Systems (ICEIS) Vol 2 pp 421-431 ISBN
  978-989-8565-11-2 . Wroclaw, Poland. July 2012",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  From n-Tier client/server applications, to more complex academic Grids, or
even the most recent and promising industrial Clouds, the last decade has
witnessed significant developments in distributed computing. In spite of this
conceptual heterogeneity, Service-Oriented Architectures (SOA) seem to have
emerged as the common underlying abstraction paradigm. Suitable access to data
and applications resident in SOAs via so-called Science Gateways has thus
become a pressing need in various fields of science, in order to realize the
benefits of Grid and Cloud infrastructures. In this context, authors have
consolidated work from three complementary experiences in European projects,
which have developed and deployed large-scale production quality
infrastructures as Science Gateways to support research in breast cancer,
paediatric diseases and neurodegenerative pathologies respectively. In
analysing the requirements from these biomedical applications the authors were
able to elaborate on commonly faced Grid development issues, while proposing an
adaptable and extensible engineering framework for Science Gateways. This paper
thus proposes the application of an architecture-centric Model-Driven
Engineering (MDE) approach to service-oriented developments, making it possible
to define Science Gateways that satisfy quality of service requirements,
execution platform and distribution criteria at design time. An novel
investigation is presented on the applicability of the resulting grid MDE
(gMDE) to specific examples, and conclusions are drawn on the benefits of this
approach and its possible application to other areas, in particular that of
Distributed Computing Infrastructures (DCI) interoperability.
","[{'version': 'v1', 'created': 'Mon, 24 Feb 2014 09:56:34 GMT'}]",2014-02-25,"[['Manset', 'David', ''], ['McClatchey', 'Richard', ''], ['Verjus', 'Herve', '']]","['MDE', 'SOA', 'ADL', 'Architecture-centric', 'Grid', 'Cloud', 'Science Gateway', 'Biomedical Research']"
17202,1409.6142,Matthieu Picantin,"Ines Klimann, Matthieu Picantin and Dmytro Savchuk","A connected 3-state reversible Mealy automaton cannot generate an
  infinite Burnside group","12 pages, 4 figures",,,,cs.FL math.GR,http://creativecommons.org/licenses/publicdomain/,"  The class of automaton groups is a rich source of the simplest examples of
infinite Burnside groups. However, there are some classes of automata that do
not contain such examples. For instance, all infinite Burnside automaton groups
in the literature are generated by non reversible Mealy automata and it was
recently shown that 2-state invertible-reversible Mealy automata cannot
generate infinite Burnside groups. Here we extend this result to connected
3-state invertible-reversible Mealy automata, using new original techniques.
The results provide the first uniform method to construct elements of infinite
order in each infinite group in this class.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 11:15:35 GMT'}]",2014-09-23,"[['Klimann', 'Ines', ''], ['Picantin', 'Matthieu', ''], ['Savchuk', 'Dmytro', '']]","['Burnside groups', 'reversible Mealy automata', 'automaton groups']"
17203,1205.0128,Rafayel Kamalian,R.R. Kamalian,It was not known about simple cycles,"7 pages, no figures",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A proper edge $t$-coloring of a graph is a coloring of its edges with colors
$1,2,...,t$ such that all colors are used, and no two adjacent edges receive
the same color. For any integer $n\geq 3$, all possible values of $t$ are
found, for which there exists such a proper edge $t$-coloring of the simple
cycle C(n), which uses for each pair of adjacent edges either consecutive
colors or the first and the last ones.
","[{'version': 'v1', 'created': 'Tue, 1 May 2012 10:38:18 GMT'}]",2012-05-02,"[['Kamalian', 'R. R.', '']]","['proper edge coloring', 'cyclically interval coloring', 'simple cycle']"
17204,1504.03744,Mohammad Reza Khalili Shoja,"Mohammad Reza Khalili Shoja, George Traian Amariucai, Shuangqing Wei,
  Jing Deng","KERMAN: A Key Establishment Algorithm based on Harvesting Randomness in
  MANETs",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Establishing secret common randomness between two or multiple devices in a
network resides at the root of communication security. The problem is
traditionally decomposed into a randomness generation stage (randomness purity
is subject to employing often costly true random number generators) and a
key-agreement information exchange stage, which can rely on public-key
infrastructure or on key wrapping. In this paper, we propose KERMAN, an
alternative key establishment algorithm for ad-hoc networks which works by
harvesting randomness directly from the network routing metadata, thus
achieving both pure randomness generation and (implicitly) secret-key
agreement. Our algorithm relies on the route discovery phase of an ad-hoc
network employing the Dynamic Source Routing protocol, is lightweight, and
requires minimal communication overhead.
","[{'version': 'v1', 'created': 'Tue, 14 Apr 2015 23:45:12 GMT'}]",2015-04-16,"[['Shoja', 'Mohammad Reza Khalili', ''], ['Amariucai', 'George Traian', ''], ['Wei', 'Shuangqing', ''], ['Deng', 'Jing', '']]","['Ad hoc mesh network', 'Dynamic source routing', 'Common randomness', 'Secret key establishment', 'Minimum entropy']"
17205,0804.0273,Alwen Tiu,Alwen Tiu and Rajeev Gore,A proof theoretic analysis of intruder theories,"This is an extended version of a conference paper accepted to RTA
  2009",,,,cs.LO cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of intruder deduction in security protocol analysis:
that is, deciding whether a given message $M$ can be deduced from a set of
messages $\Gamma$ under the theory of blind signatures and arbitrary convergent
equational theories modulo associativity and commutativity (AC) of certain
binary operators. The traditional formulations of intruder deduction are
usually given in natural-deduction-like systems and proving decidability
requires significant effort in showing that the rules are ""local"" in some
sense. By using the well-known translation between natural deduction and
sequent calculus, we recast the intruder deduction problem as proof search in
sequent calculus, in which locality is immediate. Using standard proof
theoretic methods, such as permutability of rules and cut elimination, we show
that the intruder deduction problem can be reduced, in polynomial time, to the
elementary deduction problems, which amounts to solving certain equations in
the underlying individual equational theories. We further show that this result
extends to combinations of disjoint AC-convergent theories whereby the
decidability of intruder deduction under the combined theory reduces to the
decidability of elementary deduction in each constituent theory. Although
various researchers have reported similar results for individual cases, our
work shows that these results can be obtained using a systematic and uniform
methodology based on the sequent calculus.
","[{'version': 'v1', 'created': 'Wed, 2 Apr 2008 00:21:27 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Apr 2009 06:52:58 GMT'}]",2009-04-06,"[['Tiu', 'Alwen', ''], ['Gore', 'Rajeev', '']]","['AC convergent theories', 'sequent calculus', 'intruder deduction', 'security protocols']"
17206,1109.0614,Gadda KoteswaraRao,"G. Koteswara Rao, Roshan Kumar","Framework to Integrate Business Intelligence and Knowledge Management in
  Banking Industry",,"Review of Business and Technology Research, Vol.4, No.1,
  July-2011, ISSN 1941-9406",,,cs.OH,http://creativecommons.org/licenses/by/3.0/,"  In this digital age organizations depend upon the technologies to provide
customer-centric solutions by understanding well about their customers'
behaviour and continuously improving business process of the organization.
Business intelligence (BI) applications will play a vital role at this stage by
discovering the knowledge hidden in internal as well as external sources. On
the other hand, Knowledge Management (KM) will enhance the organisations
performance by providing collaborative tools to learn, create and share the
knowledge among the employees. The main intention of the BI is to enhance the
employees' knowledge with information that allows them to make decisions to
achieve its organisational strategies. However only twenty percent of data
exist in structured form, majority of banks knowledge is in unstructured or
minds of its employees. Organizations are needed to integrate KM with Knowledge
which is discovered from data and information. The purpose of this paper is to
discuss the need of business insiders in the process of knowledge discovery and
distribution, to make BI more relevant to business of the bank. We have also
discussed about the BI/KM applications in banking industry and provided a
framework to integrate BI and KM in banking industry.
","[{'version': 'v1', 'created': 'Sat, 3 Sep 2011 11:01:40 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Nov 2011 04:10:09 GMT'}, {'version': 'v3', 'created': 'Thu, 8 Dec 2011 12:33:03 GMT'}]",2015-03-12,"[['Rao', 'G. Koteswara', ''], ['Kumar', 'Roshan', '']]","['Business Intelligence', 'Customer-centric solutions', 'Knowledge Management', 'Banking Industry']"
17207,1107.3784,Kato Mivule,Kato Mivule and Claude Turner,Applying Data Privacy Techniques on Tabular Data in Uganda,"10 pages, 6 figures",,,,cs.CR cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The growth of Information Technology(IT) in Africa has led to an increase in
the utilization of communication networks for data transaction across the
continent. A growing number of entities in the private sector, academia, and
government, have deployed the Internet as a medium to transact in data,
routinely posting statistical and non statistical data online and thereby
making many in Africa increasingly dependent on the Internet for data
transactions. In the country of Uganda, exponential growth in data transaction
has presented a new challenge: What is the most efficient way to implement data
privacy. This article discusses data privacy challenges faced by the country of
Uganda and implementation of data privacy techniques for published tabular
data. We make the case for data privacy, survey concepts of data privacy, and
implementations that could be employed to provide data privacy in Uganda.
","[{'version': 'v1', 'created': 'Tue, 19 Jul 2011 17:31:37 GMT'}]",2011-07-20,"[['Mivule', 'Kato', ''], ['Turner', 'Claude', '']]","['Data Privacy', 'Database Security', 'De-identification', 'Statistical Disclosure Control', 'k-anonymity', 'Tabular data']"
17208,1407.4422,Jakub Tomczak Ph.D.,Jakub M. Tomczak and Adam Gonczarek,Subspace Restricted Boltzmann Machine,7 pages,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The subspace Restricted Boltzmann Machine (subspaceRBM) is a third-order
Boltzmann machine where multiplicative interactions are between one visible and
two hidden units. There are two kinds of hidden units, namely, gate units and
subspace units. The subspace units reflect variations of a pattern in data and
the gate unit is responsible for activating the subspace units. Additionally,
the gate unit can be seen as a pooling feature. We evaluate the behavior of
subspaceRBM through experiments with MNIST digit recognition task, measuring
reconstruction error and classification error.
","[{'version': 'v1', 'created': 'Wed, 16 Jul 2014 18:50:40 GMT'}]",2014-07-17,"[['Tomczak', 'Jakub M.', ''], ['Gonczarek', 'Adam', '']]","['feature learning', 'unsupervised learning', 'invariant features', 'subspace features']"
17209,0907.3099,Kamal Ahmat,Kamal Ahmat,Graph Theory and Optimization Problems for Very Large Networks,,,,TR-20091970,cs.NI cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph theory provides a primary tool for analyzing and designing computer
communication networks. In the past few decades, Graph theory has been used to
study various types of networks, including the Internet, wide Area Networks,
Local Area Networks, and networking protocols such as border Gateway Protocol,
Open shortest Path Protocol, and Networking Networks. In this paper, we present
some key graph theory concepts used to represent different types of networks.
Then we describe how networks are modeled to investigate problems related to
network protocols. Finally, we present some of the tools used to generate graph
for representing practical networks.
","[{'version': 'v1', 'created': 'Fri, 17 Jul 2009 16:33:30 GMT'}]",2009-07-20,"[['Ahmat', 'Kamal', '']]","['Complex Networks', 'Graph Theory', 'Complex Graphs', 'Network Models', 'Network Generators']"
17210,1304.5140,Irena Rusu Ph.D.,Irena Rusu,"MinMax-Profiles: A Unifying View of Common Intervals, Nested Common
  Intervals and Conserved Intervals of K Permutations","25 pages, 2 figures",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Common intervals of K permutations over the same set of n elements were
firstly investigated by T. Uno and M.Yagiura (Algorithmica, 26:290:309, 2000),
who proposed an efficient algorithm to find common intervals when K=2. Several
particular classes of intervals have been defined since then, e.g. conserved
intervals and nested common intervals, with applications mainly in genome
comparison. Each such class, including common intervals, led to the development
of a specific algorithmic approach for K=2, and - except for nested common
intervals - for its extension to an arbitrary K.
  In this paper, we propose a common and efficient algorithmic framework for
finding different types of common intervals in a set P of K permutations, with
arbitrary K. Our generic algorithm is based on a global representation of the
information stored in P, called the MinMax-profile of P, and an efficient data
structure, called an LR-stack, that we introduce here. We show that common
intervals (and their subclasses of irreducible common intervals and same-sign
common intervals), nested common intervals (and their subclass of maximal
nested common intervals) as well as conserved intervals (and their subclass of
irreducible conserved intervals) may be obtained by appropriately setting the
parameters of our algorithm in each case. All the resulting algorithms run in
O(Kn+N)-time and need O(n) additional space, where N is the number of
solutions. The algorithms for nested common intervals and maximal nested common
intervals are new for K>2, in the sense that no other algorithm has been given
so far to solve the problem with the same complexity, or better. The other
algorithms are as efficient as the best known algorithms.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2013 14:09:17 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Jun 2013 10:16:17 GMT'}]",2013-06-18,"[['Rusu', 'Irena', '']]","['permutation', 'genome', 'algorithm', 'common intervals', 'conserved intervals', 'nested commonintervals']"
17211,1109.4565,Sivakumar Madesan,"Minal Moharir, A. V. Suresh","An Adaptive Technique using Advanced Encryption Standard to Implement
  Hard Disk Security","Information Security, Integrity, confidentiality, Authentication,
  Encryption",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The main objective of the paper is to study and develop an efficient method
for Hard Disk Drive(HDD) Security using Full Disk Encryption (FDE) with
Advanced Encryption Standards(AES) for data security specifically for Personal
Computers(PCS) and Laptops . The focus of this work is to authenticate and
protect the content of HDD from illegal use. The paper proposes an adaptive
methods for protecting a HDD based on FDE. The proposed method is labeled as
DiskTrust. FDE encrypts entire content or a single volume on your disk.
DiskTrust implements Symmetric key cryptography with, Advanced Encryption
Standards. Finally, the applicability of these methodologies for HDD security
will be evaluated on a set of data files with different key sizes.
","[{'version': 'v1', 'created': 'Fri, 26 Aug 2011 07:22:57 GMT'}]",2011-09-22,"[['Moharir', 'Minal', ''], ['Suresh', 'A. V.', '']]","['Information Security', 'Integrity', 'confidentiality', 'Authentication', 'Encryption']"
17212,1603.07376,Paolo Cintia,"Paolo Cintia, Mirco Nanni",An effective Time-Aware Map Matching process for low sampling GPS data,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the era of the proliferation of Geo-Spatial Data, induced by the diffusion
of GPS devices, the map matching problem still represents an important and
valuable challenge. The process of associating a segment of the underlying road
network to a GPS point gives us the chance to enrich raw data with the semantic
layer provided by the roadmap, with all contextual information associated to
it, e.g. the presence of speed limits, attraction points, changes in elevation,
etc. Most state-of-art solutions for this classical problem simply look for the
shortest or fastest path connecting any pair of consecutive points in a trip.
While in some contexts that is reasonable, in this work we argue that the
shortest/fastest path assumption can be in general erroneous. Indeed, we show
that such approaches can yield travel times that are significantly incoherent
with the real ones, and propose a Time-Aware Map matching process that tries to
improve the state-of-art by taking into account also such temporal aspect. Our
algorithm results to be very efficient, effective on low- sampling data and to
outperform existing solutions, as proved by experiments on large datasets of
real GPS trajectories. Moreover, our algorithm is parameter-free and does not
depend on specific characteristics of the GPS localization error and of the
road network (e.g. density of roads, road network topology, etc.).
","[{'version': 'v1', 'created': 'Wed, 23 Mar 2016 21:48:38 GMT'}]",2016-03-25,"[['Cintia', 'Paolo', ''], ['Nanni', 'Mirco', '']]","['Spatio-temporal Database', 'Semantic enrichment', 'Map Matching']"
17213,0905.1755,Raymond Chi-Wing Wong,"Raymond Chi-Wing Wong, Ada Wai-Chee Fu, Ke Wang, Yabo Xu, Philip S. Yu",Can the Utility of Anonymized Data be used for Privacy Breaches?,11 pages,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Group based anonymization is the most widely studied approach for privacy
preserving data publishing. This includes k-anonymity, l-diversity, and
t-closeness, to name a few. The goal of this paper is to raise a fundamental
issue on the privacy exposure of the current group based approach. This has
been overlooked in the past. The group based anonymization approach basically
hides each individual record behind a group to preserve data privacy. If not
properly anonymized, patterns can actually be derived from the published data
and be used by the adversary to breach individual privacy. For example, from
the medical records released, if patterns such as people from certain countries
rarely suffer from some disease can be derived, then the information can be
used to imply linkage of other people in an anonymized group with this disease
with higher likelihood. We call the derived patterns from the published data
the foreground knowledge. This is in contrast to the background knowledge that
the adversary may obtain from other channels as studied in some previous work.
Finally, we show by experiments that the attack is realistic in the privacy
benchmark dataset under the traditional group based anonymization approach.
","[{'version': 'v1', 'created': 'Tue, 12 May 2009 03:36:26 GMT'}]",2009-05-13,"[['Wong', 'Raymond Chi-Wing', ''], ['Fu', 'Ada Wai-Chee', ''], ['Wang', 'Ke', ''], ['Xu', 'Yabo', ''], ['Yu', 'Philip S.', '']]","['privacypreservation', 'datapublishing', 'l-diversity', 'kanonymity']"
17214,1704.05356,Nicolas Pr\'ollochs,"Nicolas Pr\""ollochs, Stefan Feuerriegel, Dirk Neumann","Understanding Negations in Information Processing: Learning from
  Replicating Human Behavior",39 pages,,,,cs.AI stat.AP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information systems experience an ever-growing volume of unstructured data,
particularly in the form of textual materials. This represents a rich source of
information from which one can create value for people, organizations and
businesses. For instance, recommender systems can benefit from automatically
understanding preferences based on user reviews or social media. However, it is
difficult for computer programs to correctly infer meaning from narrative
content. One major challenge is negations that invert the interpretation of
words and sentences. As a remedy, this paper proposes a novel learning strategy
to detect negations: we apply reinforcement learning to find a policy that
replicates the human perception of negations based on an exogenous response,
such as a user rating for reviews. Our method yields several benefits, as it
eliminates the former need for expensive and subjective manual labeling in an
intermediate stage. Moreover, the inferred policy can be used to derive
statistical inferences and implications regarding how humans process and act on
negations.
","[{'version': 'v1', 'created': 'Tue, 18 Apr 2017 14:27:46 GMT'}]",2017-04-19,"[['Pröllochs', 'Nicolas', ''], ['Feuerriegel', 'Stefan', ''], ['Neumann', 'Dirk', '']]","['Unstructured data', 'information processing', 'decision-making', 'natural language']"
17215,0803.0248,Emmanuelle Lebhar,"Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar",Networks become navigable as nodes move and forget,"21 pages, 1 figure",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a dynamical process for network evolution, aiming at explaining
the emergence of the small world phenomenon, i.e., the statistical observation
that any pair of individuals are linked by a short chain of acquaintances
computable by a simple decentralized routing algorithm, known as greedy
routing. Previously proposed dynamical processes enabled to demonstrate
experimentally (by simulations) that the small world phenomenon can emerge from
local dynamics. However, the analysis of greedy routing using the probability
distributions arising from these dynamics is quite complex because of mutual
dependencies. In contrast, our process enables complete formal analysis. It is
based on the combination of two simple processes: a random walk process, and an
harmonic forgetting process. Both processes reflect natural behaviors of the
individuals, viewed as nodes in the network of inter-individual acquaintances.
We prove that, in k-dimensional lattices, the combination of these two
processes generates long-range links mutually independently distributed as a
k-harmonic distribution. We analyze the performances of greedy routing at the
stationary regime of our process, and prove that the expected number of steps
for routing from any source to any target in any multidimensional lattice is a
polylogarithmic function of the distance between the two nodes in the lattice.
Up to our knowledge, these results are the first formal proof that navigability
in small worlds can emerge from a dynamical process for network evolution. Our
dynamical process can find practical applications to the design of spatial
gossip and resource location protocols.
","[{'version': 'v1', 'created': 'Mon, 3 Mar 2008 14:44:08 GMT'}]",2008-03-04,"[['Chaintreau', 'Augustin', ''], ['Fraigniaud', 'Pierre', ''], ['Lebhar', 'Emmanuelle', '']]","['Small world phenomenon', 'dynamical process', 'routing', 'spatial gossip', 'resource location', 'random walks']"
17216,1609.04955,Benjamin Leiding,"Benjamin Leiding, Clemens H. Cap, Thomas Mundt, Samaneh Rashidibajgan",Authcoin: Validation and Authentication in Decentralized Networks,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Authcoin is an alternative approach to the commonly used public key
infrastructures such as central authorities and the PGP web of trust. It
combines a challenge response-based validation and authentication process for
domains, certificates, email accounts and public keys with the advantages of a
block chain-based storage system. As a result, Authcoin does not suffer from
the downsides of existing solutions and is much more resilient to sybil
attacks.
","[{'version': 'v1', 'created': 'Fri, 16 Sep 2016 08:53:05 GMT'}]",2016-09-19,"[['Leiding', 'Benjamin', ''], ['Cap', 'Clemens H.', ''], ['Mundt', 'Thomas', ''], ['Rashidibajgan', 'Samaneh', '']]","['PGP', 'Authentication', 'Validation', 'Block Chain']"
17217,1307.3818,Xiongping Dai,"Xiongping Dai, Tingwen Huang, Yu Huang and Mingqing Xiao","Chaotic Characteristics of Discrete-time Linear Inclusion Dynamical
  Systems",7 pages; submitted,,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the chaotic behavior of a discrete-time linear
inclusion.
","[{'version': 'v1', 'created': 'Mon, 15 Jul 2013 05:13:03 GMT'}]",2013-07-16,"[['Dai', 'Xiongping', ''], ['Huang', 'Tingwen', ''], ['Huang', 'Yu', ''], ['Xiao', 'Mingqing', '']]","['Linear inclusions', 'chaos', 'periodical stability']"
17218,0908.0464,S{\l}awomir Staworko,"Slawomir Staworko, Jan Chomicki and Jerzy Marcinkowski","Prioritized Repairing and Consistent Query Answering in Relational
  Databases",Accepted to the special SUM'08 issue of AMAI,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A consistent query answer in an inconsistent database is an answer obtained
in every (minimal) repair. The repairs are obtained by resolving all conflicts
in all possible ways. Often, however, the user is able to provide a preference
on how conflicts should be resolved. We investigate here the framework of
preferred consistent query answers, in which user preferences are used to
narrow down the set of repairs to a set of preferred repairs. We axiomatize
desirable properties of preferred repairs. We present three different families
of preferred repairs and study their mutual relationships. Finally, we
investigate the complexity of preferred repairing and computing preferred
consistent query answers.
","[{'version': 'v1', 'created': 'Tue, 4 Aug 2009 15:10:25 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Mar 2010 13:27:17 GMT'}, {'version': 'v3', 'created': 'Fri, 7 Oct 2011 16:45:52 GMT'}]",2011-10-10,"[['Staworko', 'Slawomir', ''], ['Chomicki', 'Jan', ''], ['Marcinkowski', 'Jerzy', '']]","['repairing', 'consistent query answers', 'preferences', 'priorities']"
17219,1407.8088,Alejandro Edera,"Alejandro Edera, Yanela Strappa and Facundo Bromberg","The Grow-Shrink strategy for learning Markov network structures
  constrained by context-specific independences","12 pages, and 8 figures. This works was presented in IBERAMIA 2014",,,,cs.LG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Markov networks are models for compactly representing complex probability
distributions. They are composed by a structure and a set of numerical weights.
The structure qualitatively describes independences in the distribution, which
can be exploited to factorize the distribution into a set of compact functions.
A key application for learning structures from data is to automatically
discover knowledge. In practice, structure learning algorithms focused on
""knowledge discovery"" present a limitation: they use a coarse-grained
representation of the structure. As a result, this representation cannot
describe context-specific independences. Very recently, an algorithm called
CSPC was designed to overcome this limitation, but it has a high computational
complexity. This work tries to mitigate this downside presenting CSGS, an
algorithm that uses the Grow-Shrink strategy for reducing unnecessary
computations. On an empirical evaluation, the structures learned by CSGS
achieve competitive accuracies and lower computational complexity with respect
to those obtained by CSPC.
","[{'version': 'v1', 'created': 'Wed, 30 Jul 2014 15:24:46 GMT'}]",2014-07-31,"[['Edera', 'Alejandro', ''], ['Strappa', 'Yanela', ''], ['Bromberg', 'Facundo', '']]","['Markov networks', 'structure learning', 'context-specific independences', 'knowledge discovery', 'canonical models']"
17220,1004.2003,Norbert B\'atfai,Norbert B\'atfai,The Socceral Force,"20 pages, 13 figures, added FerSML 0.0.2",,,,cs.AI cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We have an audacious dream, we would like to develop a simulation and virtual
reality system to support the decision making in European football (soccer). In
this review, we summarize the efforts that we have made to fulfil this dream
until recently. In addition, an introductory version of FerSML (Footballer and
Football Simulation Markup Language) is presented in this paper.
","[{'version': 'v1', 'created': 'Mon, 12 Apr 2010 16:24:54 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Apr 2010 11:26:15 GMT'}]",2010-04-23,"[['Bátfai', 'Norbert', '']]","['simulation of football', 'XML-based modeling', 'Football WorldCup', 'mobile game', 'RELAX NG compact syntax', 'Java', 'open source']"
17221,1407.7849,Loet Leydesdorff,Loet Leydesdorff and Lutz Bornmann,"The Operationalization of ""Fields"" as WoS Subject Categories (WCs) in
  Evaluative Bibliometrics: The cases of ""Library and Information Science"" and
  ""Science & Technology Studies""","accepted for publication in the Journal of the Association for
  Information Science and Technology (JASIST); 22 August 2014",,,,cs.DL cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Normalization of citation scores using reference sets based on Web-of-Science
Subject Categories (WCs) has become an established (""best"") practice in
evaluative bibliometrics. For example, the Times Higher Education World
University Rankings are, among other things, based on this operationalization.
However, WCs were developed decades ago for the purpose of information
retrieval and evolved incrementally with the database; the classification is
machine-based and partially manually corrected. Using the WC ""information
science & library science"" and the WCs attributed to journals in the field of
""science and technology studies,"" we show that WCs do not provide sufficient
analytical clarity to carry bibliometric normalization in evaluation practices
because of ""indexer effects."" Can the compliance with ""best practices"" be
replaced with an ambition to develop ""best possible practices""? New research
questions can then be envisaged.
","[{'version': 'v1', 'created': 'Tue, 29 Jul 2014 19:54:33 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Jul 2014 09:12:27 GMT'}, {'version': 'v3', 'created': 'Fri, 22 Aug 2014 18:29:32 GMT'}]",2014-08-25,"[['Leydesdorff', 'Loet', ''], ['Bornmann', 'Lutz', '']]","['evaluation', 'bibliometrics', 'scientometrics', 'normalization', 'impact indicator']"
17222,1704.05267,Mieczys{\l}aw K{\l}opotek,Mieczys{\l}aw A. K{\l}opotek,"A Comment on ""Analysis of Video Image Sequences Using Point and Line
  Correspondences""",,"preliminary version of: M.A. K{\l}opotek: A comment on ""Analysis
  of video image sequences using point and line correspondences"". Pattern
  Recognition 28(1995)2, pp. 283-292",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we would like to deny the results of Wang et al. raising two
fundamental claims:
  * A line does not contribute anything to recognition of motion parameters
from two images
  * Four traceable points are not sufficient to recover motion parameters from
two perspective
  To be constructive, however, we show that four traceable points are
sufficient to recover motion parameters from two frames under orthogonal
projection and that five points are sufficient to simplify the solution of the
two-frame problem under orthogonal projection to solving a linear equation
system.
","[{'version': 'v1', 'created': 'Tue, 18 Apr 2017 10:56:14 GMT'}]",2017-04-19,"[['Kłopotek', 'Mieczysław A.', '']]","['Structure', 'Motion', 'Point', 'Line', 'Image']"
17223,1402.5843,Gabriele Fici,"Julien Cassaigne, Gabriele Fici, Marinella Sciortino, Luca Q. Zamboni",Cyclic Complexity of Words,"To appear in Journal of Combinatorial Theory, Series A",,,,cs.FL cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce and study a complexity function on words $c_x(n),$ called
\emph{cyclic complexity}, which counts the number of conjugacy classes of
factors of length $n$ of an infinite word $x.$ We extend the well-known
Morse-Hedlund theorem to the setting of cyclic complexity by showing that a
word is ultimately periodic if and only if it has bounded cyclic complexity.
Unlike most complexity functions, cyclic complexity distinguishes between
Sturmian words of different slopes. We prove that if $x$ is a Sturmian word and
$y$ is a word having the same cyclic complexity of $x,$ then up to renaming
letters, $x$ and $y$ have the same set of factors. In particular, $y$ is also
Sturmian of slope equal to that of $x.$ Since $c_x(n)=1$ for some $n\geq 1$
implies $x$ is periodic, it is natural to consider the quantity
$\liminf_{n\rightarrow \infty} c_x(n).$ We show that if $x$ is a Sturmian word,
then $\liminf_{n\rightarrow \infty} c_x(n)=2.$ We prove however that this is
not a characterization of Sturmian words by exhibiting a restricted class of
Toeplitz words, including the period-doubling word, which also verify this same
condition on the limit infimum. In contrast we show that, for the Thue-Morse
word $t$, $\liminf_{n\rightarrow \infty} c_t(n)=+\infty.$
","[{'version': 'v1', 'created': 'Mon, 24 Feb 2014 14:49:22 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Apr 2014 15:37:23 GMT'}, {'version': 'v3', 'created': 'Mon, 23 Jun 2014 13:18:54 GMT'}, {'version': 'v4', 'created': 'Tue, 26 May 2015 13:58:28 GMT'}, {'version': 'v5', 'created': 'Tue, 28 Jun 2016 07:37:08 GMT'}]",2016-06-29,"[['Cassaigne', 'Julien', ''], ['Fici', 'Gabriele', ''], ['Sciortino', 'Marinella', ''], ['Zamboni', 'Luca Q.', '']]","['Cyclic complexity', 'factor complexity', 'Sturmian words']"
17224,1602.08741,Nikolay N. Vasiliev,Nikolay N. Vasiliev,"Gibberish Semantics: How Good is Russian Twitter in Word Semantic
  Similarity Task?",,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The most studied and most successful language models were developed and
evaluated mainly for English and other close European languages, such as
French, German, etc. It is important to study applicability of these models to
other languages. The use of vector space models for Russian was recently
studied for multiple corpora, such as Wikipedia, RuWac, lib.ru. These models
were evaluated against word semantic similarity task. For our knowledge Twitter
was not considered as a corpus for this task, with this work we fill the gap.
Results for vectors trained on Twitter corpus are comparable in accuracy with
other single-corpus trained models, although the best performance is currently
achieved by combination of multiple corpora.
","[{'version': 'v1', 'created': 'Sun, 28 Feb 2016 16:58:01 GMT'}]",2016-03-01,"[['Vasiliev', 'Nikolay N.', '']]","['vector space language model', 'Word2Vec', 'semantic similarity']"
17225,1603.05368,Shengfeng Xu,"Shengfeng Xu, Gang Zhu, Bo Ai, Zhangdui Zhong","A Survey on High-Speed Railway Communications: A Radio Resource
  Management Perspective","40 pages, 10 figures. Submitted to Computer Communications",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  High-speed railway (HSR) communications will become a key feature supported
by intelligent transportation communication systems. The increasing demand for
HSR communications leads to significant attention on the study of radio
resource management (RRM), which enables efficient resource utilization and
improved system performance. RRM design is a challenging problem due to
heterogenous quality of service (QoS) requirements and dynamic characteristics
of HSR wireless communications. The objective of this paper is to provide an
overview on the key issues that arise in the RRM design for HSR wireless
communications. A detailed description of HSR communication systems is first
presented, followed by an introduction on HSR channel models and
characteristics, which are vital to the cross-layer RRM design. Then we provide
a literature survey on state-of-the-art RRM schemes for HSR wireless
communications, with an in-depth discussion on various RRM aspects including
admission control, mobility management, power control and resource allocation.
Finally, this paper outlines the current challenges and open issues in the area
of RRM design for HSR wireless communications.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2016 06:46:49 GMT'}]",2016-03-18,"[['Xu', 'Shengfeng', ''], ['Zhu', 'Gang', ''], ['Ai', 'Bo', ''], ['Zhong', 'Zhangdui', '']]","['High-speed railway communications', 'HSR', 'radio resource management', 'RRM', 'optimization design']"
17226,1205.2738,Rajeev Bedi,"Rajeev Bedi, Mohit Marwaha, Tajinder Singh, Harwinder Singh, and
  Amritpal Singh",Analysis of Different Privacy Preserving Cloud Storage Frameworks,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Privacy Security of data in Cloud Storage is one of the main issues. Many
Frameworks and Technologies are used to preserve data security in cloud
storage. [1] Proposes a framework which includes the design of data
organization structure, the generation and management of keys, the treatment of
change of user's access right and dynamic operations of data, and the
interaction between participants. It also design an interactive protocol and an
extirpation-based key derivation algorithm, which are combined with lazy
revocation, it uses multi-tree structure and symmetric encryption to form a
privacy-preserving, efficient framework for cloud storage. [2] Proposes a
framework which design a privacy-preserving cloud storage framework in which he
designed an interaction protocol among participants, use key derivation
algorithm to generate and manage keys, use both symmetric and asymmetric
encryption to hide the sensitive data of users, and apply Bloom filter for
cipher text retrieval. A system based on this framework is realized. This paper
analyzes both the frameworks in terms of the feasibility of the frameworks,
running overhead of the system and the privacy security of the frameworks.
","[{'version': 'v1', 'created': 'Sat, 14 Jan 2012 13:36:24 GMT'}]",2012-05-15,"[['Bedi', 'Rajeev', ''], ['Marwaha', 'Mohit', ''], ['Singh', 'Tajinder', ''], ['Singh', 'Harwinder', ''], ['Singh', 'Amritpal', '']]","['Cloud storage', 'key derivation', 'Bloom filter', 'cipher text retrieval', 'symmetric encryption', 'Asymmetric encryption']"
17227,1409.4587,Med Karim Abdmouleh,"Med Karim Abdmouleh, Ali Khalfallah and Med Salim Bouhlel","A new Watermarking Technique for Medical Image using Hierarchical
  Encryption","6 pages, 9 figures","IJCSI International Journal of Computer Science Issues 11(4)
  (2014) 27-32",,,cs.MM cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, characterized by the innovation of technology and the
digital revolution, the field of media has become important. The transfer and
exchange of multimedia data and duplication have become major concerns of
researchers. Consequently, protecting copyrights and ensuring service safety is
needed. Cryptography has a specific role, is to protect secret files against
unauthorized access. In this paper, a hierarchical cryptosystem algorithm based
on Logistic Map chaotic systems is proposed. The results show that the proposed
method improves the security of the image. Experimental results on a database
of 200 medical images show that the proposed method significantly gives better
results.
","[{'version': 'v1', 'created': 'Tue, 16 Sep 2014 11:27:38 GMT'}]",2016-02-10,"[['Abdmouleh', 'Med Karim', ''], ['Khalfallah', 'Ali', ''], ['Bouhlel', 'Med Salim', '']]","['Image encryption', 'Medical Image', 'Cryptosystem', 'Watermarking', 'Chaotic system', 'Logistic Map']"
17228,1702.03154,Pierre Peterlongo,"Antoine Limasset and Guillaume Rizk and Rayan Chikhi and Pierre
  Peterlongo",Fast and scalable minimal perfect hashing for massive key sets,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Minimal perfect hash functions provide space-efficient and collision-free
hashing on static sets. Existing algorithms and implementations that build such
functions have practical limitations on the number of input elements they can
process, due to high construction time, RAM or external memory usage. We
revisit a simple algorithm and show that it is highly competitive with the
state of the art, especially in terms of construction time and memory usage. We
provide a parallel C++ implementation called BBhash. It is capable of creating
a minimal perfect hash function of $10^{10}$ elements in less than 7 minutes
using 8 threads and 5 GB of memory, and the resulting function uses 3.7
bits/element. To the best of our knowledge, this is also the first
implementation that has been successfully tested on an input of cardinality
$10^{12}$. Source code: https://github.com/rizkg/BBHash
","[{'version': 'v1', 'created': 'Fri, 10 Feb 2017 12:51:54 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Feb 2017 13:13:02 GMT'}]",2018-11-06,"[['Limasset', 'Antoine', ''], ['Rizk', 'Guillaume', ''], ['Chikhi', 'Rayan', ''], ['Peterlongo', 'Pierre', '']]","['Minimal Perfect Hash Functions', 'Algorithms', 'Data Structures', 'Big Data']"
17229,1304.2035,Said El Kafhali,"Youssef Saadi, Said El Kafhali, Abdelkrim Haqiq and Bouchaib
  Nassereddine","Simulation Analysis of Routing Protocols using Manhattan Grid Mobility
  Model in MANET",7 pages,International Journal of Computer Applications May 2012,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Mobile Ad-hoc Network (MANET) is a self-configuring infrastructure less
network of mobile devices connected by wireless links. In this network
technology, simulative analysis is a significant method to understand the
performance of routing protocols. In this paper three protocols AODV, DSDV and
DSR were simulated using Manhattan Grid Mobility Model. The reactive (AODV,
DSR) and proactive (DSDV) protocols internal mechanism leads to considerable
performance difference. The performance differentials are analyzed using NS-2
which is the main network simulator, NAM (Network Animator), AWK (post
processing script) and were compared in terms of Packet Delivery Fraction
(PDF), Average end-to-end Delay and Throughput, in different environments
specified by varying network load, mobility rate and number of nodes. Our
results presented in this research work demonstrate the performance analysis of
AODV, DSDV and DSR routing protocols. It has been observed that, under
Manhattan Grid mobility model, AODV and DSR performs better than DSDV in terms
of PDF and Throughput. However in term of Average end-to-end Delay, DSDV
appears to be the best one.
","[{'version': 'v1', 'created': 'Sun, 7 Apr 2013 18:12:07 GMT'}]",2013-04-09,"[['Saadi', 'Youssef', ''], ['Kafhali', 'Said El', ''], ['Haqiq', 'Abdelkrim', ''], ['Nassereddine', 'Bouchaib', '']]","['AODV', 'DSR', 'DSDV', 'Performance Parameters', 'Network Simulator (NS-2)', 'Mobile Ad hoc Network', 'Manhattan Grid Mobility Model', 'BONNMOTION']"
17230,1401.7486,Mehdi Gheisari,"Payam Porkar Rezaeiye, mehrnoosh bazrafkan, ali akbar movassagh,
  Mojtaba Sedigh Fazli, Gholam hossein bazyari",Use HMM and KNN for classifying corneal data,,,,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  These days to gain classification system with high accuracy that can classify
complicated pattern are so useful in medicine and industry. In this article a
process for getting the best classifier for Lasik data is suggested. However at
first it's been tried to find the best line and curve by this classifier in
order to gain classifier fitting, and in the end by using the Markov method a
classifier for topographies is gained.
","[{'version': 'v1', 'created': 'Wed, 29 Jan 2014 12:27:39 GMT'}]",2014-01-30,"[['Rezaeiye', 'Payam Porkar', ''], ['bazrafkan', 'mehrnoosh', ''], ['movassagh', 'ali akbar', ''], ['Fazli', 'Mojtaba Sedigh', ''], ['bazyari', 'Gholam hossein', '']]","['HMM', 'KNN', 'classification', 'topography', 'corneal']"
17231,1107.0098,Alexander Davydov,Alexander Y. Davydov,A Probabilistic Attack on NP-complete Problems,"16 pages, 8 figures, 2 tables",,,,cs.CC cs.AI cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using the probability theory-based approach, this paper reveals the
equivalence of an arbitrary NP-complete problem to a problem of checking
whether a level set of a specifically constructed harmonic cost function (with
all diagonal entries of its Hessian matrix equal to zero) intersects with a
unit hypercube in many-dimensional Euclidean space. This connection suggests
the possibility that methods of continuous mathematics can provide crucial
insights into the most intriguing open questions in modern complexity theory.
","[{'version': 'v1', 'created': 'Fri, 1 Jul 2011 03:43:19 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Jul 2011 01:57:22 GMT'}, {'version': 'v3', 'created': 'Thu, 2 Aug 2012 21:14:17 GMT'}]",2012-08-06,"[['Davydov', 'Alexander Y.', '']]","['NP-complete', 'Harmonic cost function', 'Level set', 'Union bound', 'Universality']"
17232,0806.4073,Frank Gurski,Frank Gurski,"A comparison of two approaches for polynomial time algorithms computing
  basic graph parameters","25 pages, 3 figures",,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we compare and illustrate the algorithmic use of graphs of
bounded tree-width and graphs of bounded clique-width. For this purpose we give
polynomial time algorithms for computing the four basic graph parameters
independence number, clique number, chromatic number, and clique covering
number on a given tree structure of graphs of bounded tree-width and graphs of
bounded clique-width in polynomial time. We also present linear time algorithms
for computing the latter four basic graph parameters on trees, i.e. graphs of
tree-width 1, and on co-graphs, i.e. graphs of clique-width at most 2.
","[{'version': 'v1', 'created': 'Wed, 25 Jun 2008 11:26:47 GMT'}]",2008-12-18,"[['Gurski', 'Frank', '']]","['graph algorithms', 'graph parameters', 'clique-width', 'NLC-width', 'tree-width']"
17233,1702.01348,Jyotirmoy Karjee,"Jyotirmoy Karjee, H.S Jamadagni","Information Estimation with Node Placement Strategy in 3D Wireless
  Sensor Networks",11 pages,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The cluster formation in Three Dimensional Wireless Sensor Networks (3D-WSN)
give rise to overlapping of signals due to spherical sensing range which leads
to information redundancy in the network. To address this problem, we develop a
sensing algorithm for 3D-WSN based on dodecahedron topology which we call Three
Dimensional Distributed Clustering (3D-DC) algorithm. Using 3D-DC algorithm in
3D-WSN, accurate information extraction appears to be a major challenge due to
the environmental noise where a Cluster Head (CH) node gathers and estimates
information in each dodecahedron cluster. Hence, to extract precise information
in each dodecahedron cluster, we propose Three Dimensional Information
Estimation (3D-IE) algorithm. Moreover, Node deployment strategy also plays an
important factor to maximize information accuracy in 3D-WSN. In most cases,
sensor nodes are deployed deterministically or randomly. But both the
deployment scenario are not aware of where to exactly place the sensor nodes to
extract more information in terms of accuracy. Therefore, placing nodes in its
appropriate positions in 3D-WSN is a challenging task. We propose a Three
Dimensional Node Placement (3D-NP) algorithm which can find the possible nodes
and their deployment strategy to maximize information accuracy in the network.
We perform simulations using MATLAB to validate the 3D-DC, 3D-IE and 3D-NP,
algorithms respectively.
","[{'version': 'v1', 'created': 'Sat, 4 Feb 2017 21:37:37 GMT'}]",2017-02-07,"[['Karjee', 'Jyotirmoy', ''], ['Jamadagni', 'H. S', '']]","['Spatial correlation', 'information estimation', 'nodeplacement', 'three dimensional sensor networks']"
17234,1610.03542,Liane Gabora,Liane Gabora,"Clinical and Educational Applications of LIVEIA: An Immersive
  Visualization Environment","5 pages, In Proceedings of International Psychological Applications
  Conference and Trends (InPACT2016). Lisbon, Portugal: World Institute for
  Advanced Research and Science (WIARS), 2016",,,,cs.CY q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The association between light and psychological states has a long history and
permeates our language. LIVEIA (Light-based Immersive Visualization Environment
for Imaginative Actualization) is a new immersive, interactive technology that
uses physical light as a metaphor for visualizing peoples' inner lives and
relationships. This paper outlines its educational value, as a tool for
understanding and explaining aspects of how people think and interact, and its
potential therapeutic value as a form of art therapy in which the artwork has
straightforwardly interpretable symbolic meanings.
","[{'version': 'v1', 'created': 'Sat, 8 Oct 2016 04:33:58 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Mar 2019 22:31:23 GMT'}]",2019-03-15,"[['Gabora', 'Liane', '']]","['clinical tool', 'educational tool', 'immersive environment; interactive technology; light']"
17235,1109.4240,Stefan Plantikow,Stefan Plantikow,"Actor Continuation Passing: Efficient and Extensible Request Routing for
  Event-Driven Architectures",,,,,cs.PL cs.DC cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The logic for handling of application requests to a staged, event-driven
architecture is often distributed over different portions of the source code.
This complicates changing and understanding the flow of events in the system.
The article presents an approach that extracts request handling logic from
regular stage functionality into a set of request scripts. These scripts are
executed step-wise by sending continuations that encapsulate their request's
current execution state to stages for local processing and optional forwarding
of follow-up continuations. A new internal domain specific language (DSL) that
aims to simplify writing of request scripts is described along with its
implementation for the scala actors library. Evaluation results indicate that
request handling with actor continuations performs about equally or better
compared to using separate stages for request handling logic for scripts of at
least 3 sequential steps.
","[{'version': 'v1', 'created': 'Tue, 20 Sep 2011 08:55:10 GMT'}]",2011-09-21,"[['Plantikow', 'Stefan', '']]","['Request Routing', 'Staged Event-Driven Architecture', 'Continuations', 'Actor Model', 'Scala']"
17236,1205.4813,Praveen Sivadasan,"Praveen Sivadasan, P. Sojan Lal","Securing SQLJ Source Codes from Business Logic Disclosure by Data Hiding
  Obfuscation","4 pages,3 Figures",,,,cs.CR cs.DB cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information security is protecting information from unauthorized access, use,
disclosure, disruption, modification, perusal and destruction. CAIN model
suggest maintaining the Confidentiality, Authenticity, Integrity and
Non-repudiation (CAIN) of information. Oracle 8i, 9i and 11g Databases support
SQLJ framework allowing embedding of SQL statements in Java Programs and
providing programmer friendly means to access the Oracle database. As cloud
computing technology is becoming popular, SQLJ is considered as a flexible and
user friendly language for developing distributed applications in grid
architectures. SQLJ source codes are translated to java byte codes and
decompilation is generation of source codes from intermediate byte codes. The
intermediate SQLJ application byte codes are open to decompilation, allowing a
malicious reader to forcefully decompile it for understanding confidential
business logic or data from the codes. To the best of our knowledge, strong and
cost effective techniques exist for Oracle Database security, but still data
security techniques are lacking for client side applications, giving
possibility for revelation of confidential business data. Data obfuscation is
hiding the data in codes and we suggest enhancing the data security in SQLJ
source codes by data hiding, to mitigate disclosure of confidential business
data, especially integers in distributed applications.
","[{'version': 'v1', 'created': 'Tue, 22 May 2012 06:18:32 GMT'}]",2012-05-23,"[['Sivadasan', 'Praveen', ''], ['Lal', 'P. Sojan', '']]","['; Information Security', 'Data Obfuscation', 'SQLJ']"
17237,1210.0347,Sasirekha D Mrs,"D. Sasirekha, E. Chandra",Enhanced Techniques for PDF Image Segmentation and Text Extraction,"5 pages, 5 figures",,,,cs.CV,http://creativecommons.org/licenses/by/3.0/,"  Extracting text objects from the PDF images is a challenging problem. The
text data present in the PDF images contain certain useful information for
automatic annotation, indexing etc. However variations of the text due to
differences in text style, font, size, orientation, alignment as well as
complex structure make the problem of automatic text extraction extremely
difficult and challenging job. This paper presents two techniques under
block-based classification. After a brief introduction of the classification
methods, two methods were enhanced and results were evaluated. The performance
metrics for segmentation and time consumption are tested for both the models.
","[{'version': 'v1', 'created': 'Mon, 1 Oct 2012 10:38:08 GMT'}]",2012-10-02,"[['Sasirekha', 'D.', ''], ['Chandra', 'E.', '']]","['Block based segmentation', 'Histogram based', 'AC Coefficient based']"
17238,1704.06392,Mohamed Elawady,"Mohamed Elawady, Olivier Alata, Christophe Ducottet, Cecile Barat,
  Philippe Colantoni","Multiple Reflection Symmetry Detection via Linear-Directional Kernel
  Density Estimation",Submitted to CAIP 2017,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Symmetry is an important composition feature by investigating similar sides
inside an image plane. It has a crucial effect to recognize man-made or nature
objects within the universe. Recent symmetry detection approaches used a
smoothing kernel over different voting maps in the polar coordinate system to
detect symmetry peaks, which split the regions of symmetry axis candidates in
inefficient way. We propose a reliable voting representation based on weighted
linear-directional kernel density estimation, to detect multiple symmetries
over challenging real-world and synthetic images. Experimental evaluation on
two public datasets demonstrates the superior performance of the proposed
algorithm to detect global symmetry axes respect to the major image shapes.
","[{'version': 'v1', 'created': 'Fri, 21 Apr 2017 04:15:15 GMT'}]",2017-04-24,"[['Elawady', 'Mohamed', ''], ['Alata', 'Olivier', ''], ['Ducottet', 'Christophe', ''], ['Barat', 'Cecile', ''], ['Colantoni', 'Philippe', '']]","['Multiple Symmetry', 'Symmetry Detection', 'Reflection Symmetry', 'Kernel Density Estimation', 'Linear-Directional Data']"
17239,1704.08592,Elisabetta Bergamini,"Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann and Arie Slobbe",Faster Betweenness Centrality Updates in Evolving Networks,"Accepted at the 16th International Symposium on Experimental
  Algorithms (SEA 2017)",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finding central nodes is a fundamental problem in network analysis.
Betweenness centrality is a well-known measure which quantifies the importance
of a node based on the fraction of shortest paths going though it. Due to the
dynamic nature of many today's networks, algorithms that quickly update
centrality scores have become a necessity. For betweenness, several dynamic
algorithms have been proposed over the years, targeting different update types
(incremental- and decremental-only, fully-dynamic). In this paper we introduce
a new dynamic algorithm for updating betweenness centrality after an edge
insertion or an edge weight decrease. Our method is a combination of two
independent contributions: a faster algorithm for updating pairwise distances
as well as number of shortest paths, and a faster algorithm for updating
dependencies. Whereas the worst-case running time of our algorithm is the same
as recomputation, our techniques considerably reduce the number of operations
performed by existing dynamic betweenness algorithms.
","[{'version': 'v1', 'created': 'Thu, 27 Apr 2017 14:21:19 GMT'}]",2017-04-28,"[['Bergamini', 'Elisabetta', ''], ['Meyerhenke', 'Henning', ''], ['Ortmann', 'Mark', ''], ['Slobbe', 'Arie', '']]","['Graph algorithms', 'shortest paths', 'distances', 'dynamic algorithms']"
17240,1111.1684,Soumya Ghosal,"Biswarup Neogi, Soumya Ghosal, Soumyajit Mukherjee, Achintya Das,
  D.N.Tibarewala","Simulation Techniques and Prosthetic Approach Towards Biologically
  Efficient Artificial Sense Organs- An Overview",12 Pages,,,,cs.RO cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An overview of the applications of control theory to prosthetic sense organs
including the senses of vision, taste and odor is being presented in this
paper. Simulation aspect nowadays has been the centre of research in the field
of prosthesis. There have been various successful applications of prosthetic
organs, in case of natural biological organs dis-functioning patients.
Simulation aspects and control modeling are indispensible for knowing system
performance, and to generate an original approach of artificial organs. This
overview focuses mainly on control techniques, by far a theoretical overview
and fusion of artificial sense organs trying to mimic the efficacies of
biologically active sensory organs. Keywords: virtual reality, prosthetic
vision, artificial
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2011 19:16:16 GMT'}]",2011-11-08,"[['Neogi', 'Biswarup', ''], ['Ghosal', 'Soumya', ''], ['Mukherjee', 'Soumyajit', ''], ['Das', 'Achintya', ''], ['Tibarewala', 'D. N.', '']]","['virtual reality', 'prosthetic vision', 'artificial electronic tongue', 'prosthetic nose', 'artificial neural network', 'vibrotactile sensing']"
17241,1207.5104,Asmita Khulage A,A. A. Khulage and Prof. B. V. Pathak,"Analysis of speech under stress using Linear techniques and Non-Linear
  techniques for emotion recognition system","10 pages, 12 figures",,,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Analysis of speech for recognition of stress is important for identification
of emotional state of person. This can be done using 'Linear Techniques', which
has different parameters like pitch, vocal tract spectrum, formant frequencies,
Duration, MFCC etc. which are used for extraction of features from speech.
TEO-CB-Auto-Env is the method which is non-linear method of features
extraction. Analysis is done using TU-Berlin (Technical University of Berlin)
German database. Here emotion recognition is done for different emotions like
neutral, happy, disgust, sad, boredom and anger. Emotion recognition is used in
lie detector, database access systems, and in military for recognition of
soldiers' emotion identification during the war.
","[{'version': 'v1', 'created': 'Sat, 21 Jul 2012 05:25:27 GMT'}]",2012-07-24,"[['Khulage', 'A. A.', ''], ['Pathak', 'Prof. B. V.', '']]","['Formant frequencies', 'LPC', 'vocal tract spectrum', 'Duration', 'MFCC', 'TEO-CB-Auto-Env']"
17242,1002.3995,William Jackson,"N. Holban, V. Ditoiu, E. Iancu",Determining the quality evaluation procedures using the expert systems,,"Journal of Computing, Volume 2, Issue 2, February 2010,
  https://sites.google.com/site/journalofcomputing/",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  At this time, quality is a strategic instrument of the entities' global
management, but it is also a determining element of their competitive spirit.
The importance given to quality is abundantly found in the preoccupations of
the European Union's Minister Board, by elaborating documents with a high
impact over the quality of products/ services in special, and organizations in
general. We live in an era, when the evolution of the social life puts the
accent more and more on quality, resulted from various processes, at the level
of various domains of the economical and social development.
","[{'version': 'v1', 'created': 'Sun, 21 Feb 2010 19:20:51 GMT'}]",2010-03-25,"[['Holban', 'N.', ''], ['Ditoiu', 'V.', ''], ['Iancu', 'E.', '']]","['evaluation procedures', 'the national and international standards', 'quality manual', 'Expert Systems', 'specific knowledge']"
17243,1504.07091,Elisabetta Bergamini,Elisabetta Bergamini and Henning Meyerhenke,Fully-dynamic Approximation of Betweenness Centrality,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Betweenness is a well-known centrality measure that ranks the nodes of a
network according to their participation in shortest paths. Since an exact
computation is prohibitive in large networks, several approximation algorithms
have been proposed. Besides that, recent years have seen the publication of
dynamic algorithms for efficient recomputation of betweenness in evolving
networks. In previous work we proposed the first semi-dynamic algorithms that
recompute an approximation of betweenness in connected graphs after batches of
edge insertions.
  In this paper we propose the first fully-dynamic approximation algorithms
(for weighted and unweighted undirected graphs that need not to be connected)
with a provable guarantee on the maximum approximation error. The transfer to
fully-dynamic and disconnected graphs implies additional algorithmic problems
that could be of independent interest. In particular, we propose a new upper
bound on the vertex diameter for weighted undirected graphs. For both weighted
and unweighted graphs, we also propose the first fully-dynamic algorithms that
keep track of such upper bound. In addition, we extend our former algorithm for
semi-dynamic BFS to batches of both edge insertions and deletions.
  Using approximation, our algorithms are the first to make in-memory
computation of betweenness in fully-dynamic networks with millions of edges
feasible. Our experiments show that they can achieve substantial speedups
compared to recomputation, up to several orders of magnitude.
","[{'version': 'v1', 'created': 'Mon, 27 Apr 2015 13:53:32 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Jul 2015 13:51:54 GMT'}]",2015-07-06,"[['Bergamini', 'Elisabetta', ''], ['Meyerhenke', 'Henning', '']]","['betweenness centrality', 'algorithmic network analysis', 'fullydynamic graph algorithms', 'approximation algorithms', 'shortest paths']"
17244,1701.04010,Kapil Ahuja,"Aditya A. Shastri, Deepti Tamrakar, and Kapil Ahuja","Density-Wise Two Stage Mammogram Classification using Texture Exploiting
  Descriptors","28 Pages, 8 Figures, and 7 Tables",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Breast cancer is becoming pervasive with each passing day. Hence, its early
detection is a big step in saving the life of any patient. Mammography is a
common tool in breast cancer diagnosis. The most important step here is
classification of mammogram patches as normal-abnormal and benign-malignant.
  Texture of a breast in a mammogram patch plays a significant role in these
classifications. We propose a variation of Histogram of Gradients (HOG) and
Gabor filter combination called Histogram of Oriented Texture (HOT) that
exploits this fact. We also revisit the Pass Band - Discrete Cosine Transform
(PB-DCT) descriptor that captures texture information well. All features of a
mammogram patch may not be useful. Hence, we apply a feature selection
technique called Discrimination Potentiality (DP). Our resulting descriptors,
DP-HOT and DP-PB-DCT, are compared with the standard descriptors.
  Density of a mammogram patch is important for classification, and has not
been studied exhaustively. The Image Retrieval in Medical Application (IRMA)
database from RWTH Aachen, Germany is a standard database that provides
mammogram patches, and most researchers have tested their frameworks only on a
subset of patches from this database. We apply our two new descriptors on all
images of the IRMA database for density wise classification, and compare with
the standard descriptors. We achieve higher accuracy than all of the existing
standard descriptors (more than 92%).
","[{'version': 'v1', 'created': 'Sun, 15 Jan 2017 08:59:06 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Feb 2017 08:45:25 GMT'}, {'version': 'v3', 'created': 'Wed, 10 May 2017 21:28:52 GMT'}, {'version': 'v4', 'created': 'Wed, 3 Jan 2018 04:34:02 GMT'}]",2018-01-04,"[['Shastri', 'Aditya A.', ''], ['Tamrakar', 'Deepti', ''], ['Ahuja', 'Kapil', '']]","['Mammogram', 'Gabor Filter', 'Histogram of Gradients', 'DiscreteCosine Transform', 'Feature Selection']"
17245,0803.3539,Michael Fairbank Mr,Michael Fairbank,Reinforcement Learning by Value Gradients,,,,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The concept of the value-gradient is introduced and developed in the context
of reinforcement learning. It is shown that by learning the value-gradients
exploration or stochastic behaviour is no longer needed to find locally optimal
trajectories. This is the main motivation for using value-gradients, and it is
argued that learning value-gradients is the actual objective of any
value-function learning algorithm for control problems. It is also argued that
learning value-gradients is significantly more efficient than learning just the
values, and this argument is supported in experiments by efficiency gains of
several orders of magnitude, in several problem domains. Once value-gradients
are introduced into learning, several analyses become possible. For example, a
surprising equivalence between a value-gradient learning algorithm and a
policy-gradient learning algorithm is proven, and this provides a robust
convergence proof for control problems using a value function with a general
function approximator.
","[{'version': 'v1', 'created': 'Tue, 25 Mar 2008 11:57:15 GMT'}]",2008-03-26,"[['Fairbank', 'Michael', '']]","['Reinforcement Learning', 'Control Problems', 'Value-gradient', 'Function approximators']"
17246,1307.1730,Dmitry Ageyev,"D. Ageyev, A. Ignatenko and Fouad Wehbe (TCS Department, Kharkiv
  National University of Radioelectronics, UKRAINE)","Design of Information and Telecommunication Systems with the Usage of
  the Multi-Layer Graph Model","Keywords - Multilayer graph, Overlay network, Information and
  Telecommunication system, Design, Flow model","in Proc. of XIIth International Conference The Experience of
  Designing and Application of CAD Systems in Microelectronics (CADSM),
  Lviv-Polyana, Ukraine, 2013. pp. 1-4",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Considered in the paper is the overlaid nature of modern telecommunication
networks and expediency of usage the multi-layer graph model for its design.
General statement of design problem is given. The design method in general
using multi-layer graph model and its application for a typical information and
telecommunication system is proposed.
","[{'version': 'v1', 'created': 'Fri, 5 Jul 2013 22:23:03 GMT'}]",2013-07-09,"[['Ageyev', 'D.', '', 'TCS Department, Kharkiv\n  National University of Radioelectronics, UKRAINE'], ['Ignatenko', 'A.', '', 'TCS Department, Kharkiv\n  National University of Radioelectronics, UKRAINE'], ['Wehbe', 'Fouad', '', 'TCS Department, Kharkiv\n  National University of Radioelectronics, UKRAINE']]","['Multilayer graph', 'Overlay network', 'Information']"
17247,1301.3946,Hoyt Koepke,Hoyt Koepke and Elizabeth Thompson,"Efficient Identification of Equivalences in Dynamic Graphs and Pedigree
  Structures","Code for paper available at
  http://www.stat.washington.edu/~hoytak/code/hashreduce",,,,cs.DS q-bio.QM stat.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new framework for designing test and query functions for complex
structures that vary across a given parameter such as genetic marker position.
The operations we are interested in include equality testing, set operations,
isolating unique states, duplication counting, or finding equivalence classes
under identifiability constraints. A motivating application is locating
equivalence classes in identity-by-descent (IBD) graphs, graph structures in
pedigree analysis that change over genetic marker location. The nodes of these
graphs are unlabeled and identified only by their connecting edges, a
constraint easily handled by our approach. The general framework introduced is
powerful enough to build a range of testing functions for IBD graphs, dynamic
populations, and other structures using a minimal set of operations. The
theoretical and algorithmic properties of our approach are analyzed and proved.
Computational results on several simulations demonstrate the effectiveness of
our approach.
","[{'version': 'v1', 'created': 'Wed, 16 Jan 2013 23:11:14 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Jan 2013 21:41:35 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Feb 2013 21:15:43 GMT'}]",2013-02-20,"[['Koepke', 'Hoyt', ''], ['Thompson', 'Elizabeth', '']]","['HashFunctions', 'Algorithms', 'DataStructures', 'PedigreeAnalysis', 'Identity-by-Descent Graphs']"
17248,1208.3047,Edi Winarko,Arif Nurwidyantoro and Edi Winarko,"Parallelization of Maximum Entropy POS Tagging for Bahasa Indonesia with
  MapReduce","International Journal of Computer Science Issues (IJCSI), Vol. 9,
  Issue 4, No 2, July 2012",,,,cs.DC cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, MapReduce programming model is used to parallelize training
and tagging proceess in Maximum Entropy part of speech tagging for Bahasa
Indonesia. In training process, MapReduce model is implemented dictionary,
tagtoken, and feature creation. In tagging process, MapReduce is implemented to
tag lines of document in parallel. The training experiments showed that total
training time using MapReduce is faster, but its result reading time inside the
process slow down the total training time. The tagging experiments using
different number of map and reduce process showed that MapReduce implementation
could speedup the tagging process. The fastest tagging result is showed by
tagging process using 1,000,000 word corpus and 30 map process.
","[{'version': 'v1', 'created': 'Wed, 15 Aug 2012 07:16:14 GMT'}]",2012-08-16,"[['Nurwidyantoro', 'Arif', ''], ['Winarko', 'Edi', '']]","['POS tagging', 'Maximum Entropy', 'MapReduce']"
17249,1304.3758,Gaurav Pande,Gaurav Pande,Metrics for Video Quality Assessment in Mobile Scenarios,Submitted to International Journal of Digital Multimedia Broadcasting,,,,cs.MM cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With exponential increase in the volumes of video traffic in cellular
net-works, there is an increasing need for optimizing the quality of video
delivery. 4G networks (Long Term Evolution Advanced or LTE A) are being
introduced in many countries worldwide, which allow a downlink speed of upto 1
Gbps and uplink of 100 Mbps over a single base station. This makes a strong
push towards video broadcasting over LTE networks, characterizing its
performance and developing metrics which can be deployed to provide user
feedback of video quality and feed-back them to network operators to fine tune
the network. In this paper, we characterize the performance of video
transmission over LTE A physical layer using popular video quality metrics such
as SSIM, Blocking, Blurring, NIQE and BRISQUE. We conduct experiments to find a
suitable no-reference metrics for mobile scenario and find that Blocking
Metrics is most promising in case of channel or modulation variations but it
does not perform well to quantize variations in compression ratios. The metrics
BRISQUE is very efficient in quantizing this distortion and performs well in
case of network variations also.
","[{'version': 'v1', 'created': 'Sat, 13 Apr 2013 01:59:01 GMT'}]",2013-04-16,"[['Pande', 'Gaurav', '']]","['LTE-A', 'mobile video', 'quality assessment', 'Matlab', 'blocking', 'blurring']"
17250,1212.2257,Yan Zhang,"Yan Zhang, Zhaohui Zhu, Jinjin Zhang, Yong Zhou",A Process Calculus with Logical Operators,52 pages,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In order to combine operational and logical styles of specifications in one
unified framework, the notion of logic labelled transition systems (Logic LTS,
for short) has been presented and explored by L\""{u}ttgen and Vogler in [TCS
373(1-2):19-40; Inform. & Comput. 208:845-867]. In contrast with usual LTS, two
logical constructors $\wedge$ and $\vee$ over Logic LTSs are introduced to
describe logical combinations of specifications. Hitherto such framework has
been dealt with in considerable depth, however, process algebraic style way has
not yet been involved and the axiomatization of constructors over Logic LTSs is
absent. This paper tries to develop L\""{u}ttgen and Vogler's work along this
direction. We will present a process calculus for Logic LTSs (CLL, for short).
The language CLL is explored in detail from two different but equivalent views.
Based on behavioral view, the notion of ready simulation is adopted to
formalize the refinement relation, and the behavioral theory is developed.
Based on proof-theoretic view, a sound and ground-complete axiomatic system for
CLL is provided, which captures operators in CLL through (in)equational laws.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2012 00:21:51 GMT'}]",2012-12-12,"[['Zhang', 'Yan', ''], ['Zhu', 'Zhaohui', ''], ['Zhang', 'Jinjin', ''], ['Zhou', 'Yong', '']]","['Logic operators', 'Process calculus', 'Ready simulation', 'Axiomaticsystem', 'Logic labelled transition system']"
17251,1307.5437,Chanchal Yadav Ms.,"Chanchal Yadav, Shuliang Wang, Manoj Kumar",Algorithm and approaches to handle large Data- A Survey,5 pages,"International Journal of computer science and network, vol 2,
  issue 3, 2013",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data mining environment produces a large amount of data, that need to be
analyzed, patterns have to be extracted from that to gain knowledge. In this
new era with boom of data both structured and unstructured, in the field of
genomics, meteorology, biology, environmental research and many others, it has
become difficult to process, manage and analyze patterns using traditional
databases and architectures. So, a proper architecture should be understood to
gain knowledge about the Big Data. This paper presents a review of various
algorithms from 1994-2013 necessary for handling such large data set. These
algorithms define various structures and methods implemented to handle Big
Data, also in the paper are listed various tool that were developed for
analyzing them.
","[{'version': 'v1', 'created': 'Sat, 20 Jul 2013 16:19:35 GMT'}]",2013-07-23,"[['Yadav', 'Chanchal', ''], ['Wang', 'Shuliang', ''], ['Kumar', 'Manoj', '']]","['Big Data', 'Clustering', 'Data Mining']"
17252,1505.05642,Chinnappillai Durairajan,J. Mahalakshmi and C. Durairajan,On the $Z_q$-MacDonald Code and its Weight Distribution of dimension 3,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we determine the parameters of $\mathbb{Z}_q$-MacDonald Code
of dimension k for any positive integer $q \geq 2.$ Further, we have obtained
the weight distribution of $\mathbb{Z}_q$-MacDonald code of dimension 3 and
furthermore, we have given the weight distribution of $\mathbb{Z}_q$-Simplex
code of dimension 3 for any positive integer $q \geq 2.$
","[{'version': 'v1', 'created': 'Thu, 21 May 2015 08:19:11 GMT'}]",2015-05-22,"[['Mahalakshmi', 'J.', ''], ['Durairajan', 'C.', '']]","['Zq-linear code', 'Codes over finite rings', 'Zq-Simplex code', 'Zq-MacDonald code']"
17253,1609.09748,Arnaud Martin,"Amal Ben Rjab (LARODEC, DRUID), Mouloud Kharoune (DRUID), Zoltan
  Miklos (DRUID), Arnaud Martin (DRUID)",Characterization of experts in crowdsourcing platforms,"in The 4th International Conference on Belief Functions, Sep 2016,
  Prague, Czech Republic",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crowdsourcing platforms enable to propose simple human intelligence tasks to
a large number of participants who realise these tasks. The workers often
receive a small amount of money or the platforms include some other incentive
mechanisms, for example they can increase the workers reputation score, if they
complete the tasks correctly. We address the problem of identifying experts
among participants, that is, workers, who tend to answer the questions
correctly. Knowing who are the reliable workers could improve the quality of
knowledge one can extract from responses. As opposed to other works in the
literature, we assume that participants can give partial or incomplete
responses, in case they are not sure that their answers are correct. We model
such partial or incomplete responses with the help of belief functions, and we
derive a measure that characterizes the expertise level of each participant.
This measure is based on precise and exactitude degrees that represent two
parts of the expertise level. The precision degree reflects the reliability
level of the participants and the exactitude degree reflects the knowledge
level of the participants. We also analyze our model through simulation and
demonstrate that our richer model can lead to more reliable identification of
experts.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2016 14:23:42 GMT'}]",2016-10-03,"[['Rjab', 'Amal Ben', '', 'LARODEC, DRUID'], ['Kharoune', 'Mouloud', '', 'DRUID'], ['Miklos', 'Zoltan', '', 'DRUID'], ['Martin', 'Arnaud', '', 'DRUID']]","['Crowdsourcing', 'expert', 'expertise level', 'exactitude', 'precision degrees']"
17254,1301.1917,Martin Kasparick,"Gerhard Wunder, Chan Zhou, Martin Kasparick","Stability and Cost Optimization in Controlled Random Walks Using
  Scheduling Fields","submitted to SIAM Journal on Control and Optimization. arXiv admin
  note: text overlap with arXiv:1208.2972, arXiv:0904.2302",,,,cs.SY cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The control of large queueing networks is a notoriously difficult problem.
Recently, an interesting new policy design framework for the control problem
called h-MaxWeight has been proposed: h-MaxWeight is a natural generalization
of the famous MaxWeight policy where instead of the quadratic any other
surrogate value function can be applied. Stability of the policy is then
achieved through a perturbation technique. However, stability crucially depends
on parameter choice which has to be adapted in simulations. In this paper we
use a different technique where the required perturbations can be directly
implemented in the weight domain, which we call a scheduling field then.
Specifically, we derive the theoretical arsenal that guarantees universal
stability while still operating close to the underlying cost criterion.
Simulation examples suggest that the new approach to policy synthesis can even
provide significantly higher gains irrespective of any further assumptions on
the network model or parameter choice.
","[{'version': 'v1', 'created': 'Wed, 9 Jan 2013 16:46:59 GMT'}]",2013-01-10,"[['Wunder', 'Gerhard', ''], ['Zhou', 'Chan', ''], ['Kasparick', 'Martin', '']]","['Queueing Networks', 'Routing', 'Scheduling', 'Optimal Control']"
17255,1207.6839,Jorge Fabrega,"Jorge Fabrega, Pablo Paredes",Three Degrees of Distance on Twitter,"6 pages, 7 figures",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent work has found that the propagation of behaviors and sentiments
through networks extends in ranges up to 2 to 4 degrees of distance. The
regularity with which the same observation is found in dissimilar phenomena has
been associated with friction in the propagation process and the instability of
link structure that emerges in the dynamic of social networks. We study a
contagious behavior, the practice of retweeting, in a setting where neither of
those restrictions is present and still found the same result.
","[{'version': 'v1', 'created': 'Mon, 30 Jul 2012 05:19:05 GMT'}, {'version': 'v2', 'created': 'Tue, 31 Jul 2012 05:55:33 GMT'}, {'version': 'v3', 'created': 'Wed, 1 Aug 2012 01:52:51 GMT'}]",2012-08-02,"[['Fabrega', 'Jorge', ''], ['Paredes', 'Pablo', '']]","['Twitter', 'information difussion', 'contagion', 'social networks', 'social distance']"
17256,1704.07149,Katsuhiko Sano,Katsuhiko Sano,Axiomatizing Epistemic Logic of Friendship via Tree Sequent Calculus,"24 pages, 1 figure",,,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper positively solves an open problem if it is possible to provide a
Hilbert system to Epistemic Logic of Friendship (EFL) by Seligman, Girard and
Liu. To find a Hilbert system, we first introduce a sound, complete and
cut-free tree (or nested) sequent calculus for EFL, which is an integrated
combination of Seligman's sequent calculus for basic hybrid logic and a tree
sequent calculus for modal logic. Then we translate a tree sequent into an
ordinary formula to specify a Hilbert system of EFL and finally show that our
Hilbert system is sound and complete for the intended two-dimensional
semantics.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 11:28:24 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Sep 2017 07:27:27 GMT'}, {'version': 'v3', 'created': 'Wed, 10 Jul 2019 14:00:03 GMT'}]",2019-07-11,"[['Sano', 'Katsuhiko', '']]","['Epistemic Logics of Friendship', 'Tree Sequent Calculus', 'HilbertSystem', 'Completeness', 'Cut Elimination Theorem']"
17257,1403.1006,Maria Spichkova,Maria Spichkova,Towards Focus on Time,"12th International Workshop on Automated Verification of Critical
  Systems (AVoCS'12), 2012",,,,cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This short paper introduces a model for the specification and verification of
real-time system design: timed state transition diagrams.
","[{'version': 'v1', 'created': 'Wed, 5 Mar 2014 05:02:55 GMT'}]",2014-03-06,"[['Spichkova', 'Maria', '']]","['Formal Methods', 'Specification', 'Verification', 'Real-Time Systems']"
17258,1203.0135,Pankaj Dayama Mr.,"Pankaj Dayama, Aditya Karnik and Y. Narahari","Optimal Mix of Incentive Strategies for Product Marketing on Social
  Networks",,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of devising incentive strategies for viral marketing
of a product. In particular, we assume that the seller can influence
penetration of the product by offering two incentive programs: a) direct
incentives to potential buyers (influence) and b) referral rewards for
customers who influence potential buyers to make the purchase (exploit
connections). The problem is to determine the optimal timing of these programs
over a finite time horizon. In contrast to algorithmic perspective popular in
the literature, we take a mean-field approach and formulate the problem as a
continuous-time deterministic optimal control problem. We show that the optimal
strategy for the seller has a simple structure and can take both forms, namely,
influence-and-exploit and exploit-and-influence. We also show that in some
cases it may optimal for the seller to deploy incentive programs mostly for low
degree nodes. We support our theoretical results through numerical studies and
provide practical insights by analyzing various scenarios.
","[{'version': 'v1', 'created': 'Thu, 1 Mar 2012 10:32:02 GMT'}]",2012-03-02,"[['Dayama', 'Pankaj', ''], ['Karnik', 'Aditya', ''], ['Narahari', 'Y.', '']]","['Incentive Strategies', 'Social Networks', 'Viral Marketing']"
17259,1407.8476,Sabyasachi  Mukhopadhyay,"Sabyasachi Mukhopadhyay, Debadatta Dash, Asish Mitra, Paritosh
  Bhattacharya","A comparative study between seasonal wind speed by Fourier and Wavelet
  analysis",,,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wind Energy is a useful resource for Renewable energy purpose. Wind speed
plays a vital role for wind energy calculation of certain location. So, it is
very much necessary to know the wind speed data characteristics. In this paper
fourier and wavelet transform are applied to study the wind speed data. We have
compared wind speed of winter with summer by taking their speed into account
using various discrete wavelets namely Haar and Daubechies-4 (Db-4). Also the
periodicity of wind speed is checked using Continuous Wavelet Transform (MCWT)
like Morlet. Thereafter a comparative study is done for detecting the
periodicity of both summer and winter. Then wavelet coherence is checked
between these two data for extracting the phase coherency information.
","[{'version': 'v1', 'created': 'Thu, 31 Jul 2014 16:17:39 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Aug 2014 12:48:43 GMT'}]",2014-08-07,"[['Mukhopadhyay', 'Sabyasachi', ''], ['Dash', 'Debadatta', ''], ['Mitra', 'Asish', ''], ['Bhattacharya', 'Paritosh', '']]","['Fourier Transform', 'Wavelet Transforms', 'Wavelet Coherence', 'Scalogram', 'Periodogram', 'Wind speed']"
17260,1409.2650,Ihab Sbeity,"Ihab Sbeity, Mohamed Dbouk, Habib Kobeissi","Combining the analytical hierarchy process and the genetic algorithm to
  solve the timetable problem","International Journal of Software Engineering & Applications (IJSEA),
  Vol.5, No.4, July 2014",,,,cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The main problems of school course timetabling are time, curriculum, and
classrooms. In addition there are other problems that vary from one institution
to another. This paper is intended to solve the problem of satisfying the
teachers preferred schedule in a way that regards the importance of the teacher
to the supervising institute, i.e. his score according to some criteria.
Genetic algorithm (GA) has been presented as an elegant method in solving
timetable problem (TTP) in order to produce solutions with no conflict. In this
paper, we consider the analytic hierarchy process (AHP) to efficiently obtain a
score for each teacher, and consequently produce a GA-based TTP solution that
satisfies most of the teachers preferences.
","[{'version': 'v1', 'created': 'Tue, 9 Sep 2014 09:30:48 GMT'}]",2014-09-10,"[['Sbeity', 'Ihab', ''], ['Dbouk', 'Mohamed', ''], ['Kobeissi', 'Habib', '']]","['Timetable problem', 'Genetic algorithm', 'Analytic Hierarchy process', 'Multi-criteria decision making']"
17261,1802.08612,Libby Hemphill,Libby Hemphill,"More Specificity, More Attention to Social Context: Reframing How We
  Address ""Bad Actors""","Paper submitted Workshop Paper Submitted to CHI 2018: Understanding
  ""Bad Actors"" Online",,,,cs.SI cs.CY cs.HC,http://creativecommons.org/licenses/by/4.0/,"  To address ""bad actors"" online, I argue for more specific definitions of
acceptable and unacceptable behaviors and explicit attention to the social
structures in which behaviors occur.
","[{'version': 'v1', 'created': 'Fri, 23 Feb 2018 15:48:56 GMT'}]",2018-02-26,"[['Hemphill', 'Libby', '']]","['feminism', 'harassment', 'online communities']"
17262,1701.03452,Fathi Salem,Joel Heck and Fathi M. Salem,Simplified Minimal Gated Unit Variations for Recurrent Neural Networks,"5 pages, 3 Figures, 5 Tables",,,,cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recurrent neural networks with various types of hidden units have been used
to solve a diverse range of problems involving sequence data. Two of the most
recent proposals, gated recurrent units (GRU) and minimal gated units (MGU),
have shown comparable promising results on example public datasets. In this
paper, we introduce three model variants of the minimal gated unit (MGU) which
further simplify that design by reducing the number of parameters in the
forget-gate dynamic equation. These three model variants, referred to simply as
MGU1, MGU2, and MGU3, were tested on sequences generated from the MNIST dataset
and from the Reuters Newswire Topics (RNT) dataset. The new models have shown
similar accuracy to the MGU model while using fewer parameters and thus
lowering training expense. One model variant, namely MGU2, performed better
than MGU on the datasets considered, and thus may be used as an alternate to
MGU or GRU in recurrent neural networks.
","[{'version': 'v1', 'created': 'Thu, 12 Jan 2017 18:52:31 GMT'}]",2017-01-13,"[['Heck', 'Joel', ''], ['Salem', 'Fathi M.', '']]","['recurrent neural networks (RNN)', 'gated recurrent units (GRU)', 'minimal gated units (MGU)']"
17263,0806.0576,Wojciech Mazurczyk,"Krzysztof Szczypiorski, Igor Margasinski, Wojciech Mazurczyk",Steganographic Routing in Multi Agent System Environment,"9 pages, 10 figures,","""Secured Information Systems"" of Journal of Information Assurance
  and Security (JIAS), Dynamic Publishers Inc., Atlanta, GA 30362, USA, Volume
  2, Issue 3, September 2007, pp. 235-243, ISSN 1554-1010",,,cs.CR cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present an idea of trusted communication platform for
Multi-Agent Systems (MAS) called TrustMAS. Based on analysis of routing
protocols suitable for MAS we have designed a new proactive hidden routing.
Proposed steg-agents discovery procedure, as well as further routes updates and
hidden communication, are cryptographically independent. Steganographic
exchange can cover heterogeneous and geographically outlying environments using
available cross-layer covert channels. Finally we have specified rules that
agents have to follow to benefit the TrustMAS distributed router platform.
","[{'version': 'v1', 'created': 'Tue, 3 Jun 2008 16:15:16 GMT'}]",2008-06-04,"[['Szczypiorski', 'Krzysztof', ''], ['Margasinski', 'Igor', ''], ['Mazurczyk', 'Wojciech', '']]","['Multi Agent Systems', 'Information Hiding', 'Steganography', 'Trust Management', 'Routing Protocols']"
17264,1704.08030,Qier Meng,"Qier Meng, Takayuki Kitasaka, Masahiro Oda, Junji Ueno, Kensaku Mori","Airway segmentation from 3D chest CT volumes based on volume of interest
  using gradient vector flow",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Some lung diseases are related to bronchial airway structures and morphology.
Although airway segmentation from chest CT volumes is an important task in the
computer-aided diagnosis and surgery assistance systems for the chest, complete
3-D airway structure segmentation is a quite challenging task due to its
complex tree-like structure. In this paper, we propose a new airway
segmentation method from 3D chest CT volumes based on volume of interests (VOI)
using gradient vector flow (GVF). This method segments the bronchial regions by
applying the cavity enhancement filter (CEF) to trace the bronchial tree
structure from the trachea. It uses the CEF in the VOI to segment each branch.
And a tube-likeness function based on GVF and the GVF magnitude map in each VOI
are utilized to assist predicting the positions and directions of child
branches. By calculating the tube-likeness function based on GVF and the GVF
magnitude map, the airway-like candidate structures are identified and their
centrelines are extracted. Based on the extracted centrelines, we can detect
the branch points of the bifurcations and directions of the airway branches in
the next level. At the same time, a leakage detection is performed to avoid the
leakage by analysing the pixel information and the shape information of airway
candidate regions extracted in the VOI. Finally, we unify all of the extracted
bronchial regions to form an integrated airway tree. Preliminary experiments
using four cases of chest CT volumes demonstrated that the proposed method can
extract more bronchial branches in comparison with other methods.
","[{'version': 'v1', 'created': 'Wed, 26 Apr 2017 09:27:18 GMT'}]",2017-04-27,"[['Meng', 'Qier', ''], ['Kitasaka', 'Takayuki', ''], ['Oda', 'Masahiro', ''], ['Ueno', 'Junji', ''], ['Mori', 'Kensaku', '']]","['CT', 'Airway segmentation', 'Volume of interest', 'Gradient vector flow', 'Shape information']"
17265,1109.2434,Kim Bauters,"Kim Bauters and Jeroen Janssen and Steven Schockaert and Dirk Vermeir
  and Martine De Cock",Expressiveness of Communication in Answer Set Programming,"35 pages. This article has been accepted for publication in Theory
  and Practice of Logic Programming, Copyright Cambridge University Press",,,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Answer set programming (ASP) is a form of declarative programming that allows
to succinctly formulate and efficiently solve complex problems. An intuitive
extension of this formalism is communicating ASP, in which multiple ASP
programs collaborate to solve the problem at hand. However, the expressiveness
of communicating ASP has not been thoroughly studied. In this paper, we present
a systematic study of the additional expressiveness offered by allowing ASP
programs to communicate. First, we consider a simple form of communication
where programs are only allowed to ask questions to each other. For the most
part, we deliberately only consider simple programs, i.e. programs for which
computing the answer sets is in P. We find that the problem of deciding whether
a literal is in some answer set of a communicating ASP program using simple
communication is NP-hard. In other words: we move up a step in the polynomial
hierarchy due to the ability of these simple ASP programs to communicate and
collaborate. Second, we modify the communication mechanism to also allow us to
focus on a sequence of communicating programs, where each program in the
sequence may successively remove some of the remaining models. This mimics a
network of leaders, where the first leader has the first say and may remove
models that he or she finds unsatisfactory. Using this particular communication
mechanism allows us to capture the entire polynomial hierarchy. This means, in
particular, that communicating ASP could be used to solve problems that are
above the second level of the polynomial hierarchy, such as some forms of
abductive reasoning as well as PSPACE-complete problems such as STRIPS
planning.
","[{'version': 'v1', 'created': 'Mon, 12 Sep 2011 11:48:38 GMT'}]",2011-09-13,"[['Bauters', 'Kim', ''], ['Janssen', 'Jeroen', ''], ['Schockaert', 'Steven', ''], ['Vermeir', 'Dirk', ''], ['De Cock', 'Martine', '']]","['logic programming', 'answer set programming', 'multi-agent reasoning']"
17266,1701.06428,Leon Abdillah,Leon Andretti Abdillah,Ujian Online Mahasiswa Ilmu Komputer Berbasis Smartphone,"8 pages, in Indonesian. Paper presented at the Seminar Nasional Riset
  Ilmu Komputer Ke-2 (SNRIK2016), Makassar. http://snrik.fikom.umi.ac.id/
  (2016)",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information technology influence higher education in various aspects,
including education sector. This article discusses how smartphones facilitate
online examination in computer science and information systems students. The
research objective to be achieved by the researchers through the research, are
as follows: 1) Utilizing smartphone as a media test online exam, 2) How to make
use of social technologies in online test, and 3) Identify the features or
facilities that could be used for the implementation of an online exam.
Observations was conducted with 87 early year students as respondents. Author
develop the online questions by using google forms, and facebook to disseminate
online examination questions. Research findings show that Android are
dominantly gadgets used by students for their online examination. Smartphone
based online exam help students concentration in online exam. Social
information technology like facebook and google forms have rich features in
supporting online examination for computer science students. The use of
smartphones, google forms, and facebook can create an atmosphere of exams
modern, efficient, and environmentally friendly.
","[{'version': 'v1', 'created': 'Sat, 17 Dec 2016 02:41:14 GMT'}]",2017-01-24,"[['Abdillah', 'Leon Andretti', '']]","['Online Exam', 'Google Forms', 'SmartPhones.  1']"
17267,1506.08801,Sourjya Dutta,"Marco Mezzavilla, Sourjya Dutta, Menglei Zhang, Mustafa Riza Akdeniz,
  Sundeep Rangan",5G mmWave Module for ns-3 Network Simulator,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increasing demand of data, along with the spectrum scarcity, are
motivating a urgent shift towards exploiting new bands. This is the main reason
behind identifying mmWaves as the key disruptive enabling technology for 5G
cellular networks. Indeed, utilizing new bands means facing new challenges; in
this context, they are mainly related to the radio propagation, which is
shorter in range and more sensitive to obstacles. The resulting key aspects
that need to be taken into account when designing mmWave cellular systems are
directionality and link intermittency. The lack of network level results
motivated this work, which aims at providing the first of a kind open source
mmWave framework, based on the network simulator ns-3. The main focus of this
work is the modeling of customizable channel, physical (PHY) and medium access
control (MAC) layers for mmWave systems. The overall design and architecture of
the model are discussed in details. Finally, the validity of our proposed
framework is corroborated through the simulation of a simple scenario.
","[{'version': 'v1', 'created': 'Mon, 29 Jun 2015 19:43:34 GMT'}]",2015-06-30,"[['Mezzavilla', 'Marco', ''], ['Dutta', 'Sourjya', ''], ['Zhang', 'Menglei', ''], ['Akdeniz', 'Mustafa Riza', ''], ['Rangan', 'Sundeep', '']]","['mmWave', '5G', 'Cellular', 'Channel', 'Propagation', 'PHY', 'MAC']"
17268,1305.0961,William Hoover,Wm. G. Hoover and Carol G. Hoover,"Time-Reversible Random Number Generators : Solution of Our Challenge by
  Federico Ricci-Tersenghi","Seven pages with a single Figure, dedicated to the memories of our
  late colleague Ian Snook",,,,cs.DM cond-mat.stat-mech physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nearly all the evolution equations of physics are time-reversible, in the
sense that a movie of the solution, played backwards, would obey exactly the
same differential equations as the original forward solution. By way of
contrast, stochastic approaches are typically not time-reversible, though they
could be made so by the simple expedient of storing their underlying
pseudorandom numbers in an array. Here we illustrate the notion of
time-reversible random number generators. In Version 1 we offered a suitable
reward for the first arXiv response furnishing a reversed version of an only
slightly-more-complicated pseudorandom number generator. Here we include
Professor Ricci-Tersenghi's prize-winning reversed version as described in his
arXiv:1305.1805 contribution: ""The Solution to the Challenge in
`Time-Reversible Random Number Generators' by Wm. G. Hoover and Carol G.
Hoover"".
","[{'version': 'v1', 'created': 'Sat, 4 May 2013 21:30:36 GMT'}, {'version': 'v2', 'created': 'Sat, 18 May 2013 10:36:48 GMT'}]",2013-05-21,"[['Hoover', 'Wm. G.', ''], ['Hoover', 'Carol G.', '']]","['Time Reversibility', 'Algorithms', 'Langevin Equation']"
17269,1712.03991,Jianshu Zhang,"Jianshu Zhang, Jun Du, Lirong Dai","A GRU-based Encoder-Decoder Approach with Attention for Online
  Handwritten Mathematical Expression Recognition",Accepted by ICDAR 2017 conference,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, we present a novel end-to-end approach based on the
encoder-decoder framework with the attention mechanism for online handwritten
mathematical expression recognition (OHMER). First, the input two-dimensional
ink trajectory information of handwritten expression is encoded via the gated
recurrent unit based recurrent neural network (GRU-RNN). Then the decoder is
also implemented by the GRU-RNN with a coverage-based attention model. The
proposed approach can simultaneously accomplish the symbol recognition and
structural analysis to output a character sequence in LaTeX format. Validated
on the CROHME 2014 competition task, our approach significantly outperforms the
state-of-the-art with an expression recognition accuracy of 52.43% by only
using the official training dataset. Furthermore, the alignments between the
input trajectories of handwritten expressions and the output LaTeX sequences
are visualized by the attention mechanism to show the effectiveness of the
proposed method.
","[{'version': 'v1', 'created': 'Mon, 4 Dec 2017 02:20:25 GMT'}]",2017-12-13,"[['Zhang', 'Jianshu', ''], ['Du', 'Jun', ''], ['Dai', 'Lirong', '']]","['OnlineHandwrittenMathematicalExpressionRecognition', 'Encoder-Decoder', 'Gated Recurrent Unit', 'Attention']"
17270,1409.8493,Mark Scanlon,Mark Scanlon and M-Tahar Kechadi,Digital Evidence Bag Selection for P2P Network Investigation,"The 7th International Symposium on Digital Forensics and Information
  Security (DFIS-2013); Future Information Technology, Application, and Service",,,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The collection and handling of court admissible evidence is a fundamental
component of any digital forensic investigation. While the procedures for
handling digital evidence take much of their influence from the established
policies for the collection of physical evidence, due to the obvious
differences in dealing with non-physical evidence, a number of extra policies
and procedures are required. This paper compares and contrasts some of the
existing digital evidence formats or ""bags"" and analyses them for their
compatibility with evidence gathered from a network source. A new digital
extended evidence bag is proposed to specifically deal with evidence gathered
from P2P networks, incorporating the network byte stream and on-the-fly
metadata generation to aid in expedited identification and analysis.
","[{'version': 'v1', 'created': 'Tue, 30 Sep 2014 11:31:59 GMT'}]",2014-10-01,"[['Scanlon', 'Mark', ''], ['Kechadi', 'M-Tahar', '']]","['Peer-to-Peer', 'Network', 'Digital Forensics', 'Evidence Handling']"
17271,1105.3833,Eliezer Lozinskii,Eliezer L. Lozinskii,Typical models: minimizing false beliefs,,"Journal of Experimental & Theoretical Artificial Intelligence,
  vol. 22, no.4, December 2010, 321-340",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A knowledge system S describing a part of real world does in general not
contain complete information. Reasoning with incomplete information is prone to
errors since any belief derived from S may be false in the present state of the
world. A false belief may suggest wrong decisions and lead to harmful actions.
So an important goal is to make false beliefs as unlikely as possible. This
work introduces the notions of ""typical atoms"" and ""typical models"", and shows
that reasoning with typical models minimizes the expected number of false
beliefs over all ways of using incomplete information. Various properties of
typical models are studied, in particular, correctness and stability of beliefs
suggested by typical models, and their connection to oblivious reasoning.
","[{'version': 'v1', 'created': 'Thu, 19 May 2011 10:00:39 GMT'}]",2011-05-20,"[['Lozinskii', 'Eliezer L.', '']]","['Incomplete information', 'reasoning errors', 'false beliefs', 'typicalmodels', 'evidence', 'oblivious reasoning', 'counting models']"
17272,0804.2992,Eberhard H.-A. Gerbracht,Eberhard H.-A. Gerbracht,"""E pluribus unum"" or How to Derive Single-equation Descriptions for
  Output-quantities in Nonlinear Circuits using Differential Algebra","V1: documentclass IEEEtran, 7 pages, 10 figures. Re-release of the
  printed version, with some minor typographical errors corrected","Proceedings of the 7th International Workshop on Symbolic Methods
  and Applications to Circuit Design, SMACD 2002, Sinaia, Romania, October
  10-11, 2002; pp. 65-70; ISBN 973-85072-5-1",,,cs.SC math.CA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we describe by a number of examples how to deduce one single
characterizing higher order differential equation for output quantities of an
analog circuit.
  In the linear case, we apply basic ""symbolic"" methods from linear algebra to
the system of differential equations which is used to model the analog circuit.
For nonlinear circuits and their corresponding nonlinear differential
equations, we show how to employ computer algebra tools implemented in Maple,
which are based on differential algebra.
","[{'version': 'v1', 'created': 'Fri, 18 Apr 2008 19:55:58 GMT'}]",2008-12-18,"[['Gerbracht', 'Eberhard H. -A.', '']]","['(semi-)state equations', 'systems of nonlinear ODEs', 'nonlinear circuits', 'differential algebra', 'Maple']"
17273,1501.05757,Zheng Wang,Zheng Wang and Cong Ling,"On the Geometric Ergodicity of Metropolis-Hastings Algorithms for
  Lattice Gaussian Sampling",Submitted to IEEE Transactions on Information Theory,"same version, IEEE Transactions on Information Theory, Volume 64,
  Issue 2, Feb. 2018, Pages 738 - 751",,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sampling from the lattice Gaussian distribution is emerging as an important
problem in coding and cryptography. In this paper, the classic
Metropolis-Hastings (MH) algorithm from Markov chain Monte Carlo (MCMC) methods
is adapted for lattice Gaussian sampling. Two MH-based algorithms are proposed,
which overcome the restriction suffered by the default Klein's algorithm. The
first one, referred to as the independent Metropolis-Hastings-Klein (MHK)
algorithm, tries to establish a Markov chain through an independent proposal
distribution. We show that the Markov chain arising from the independent MHK
algorithm is uniformly ergodic, namely, it converges to the stationary
distribution exponentially fast regardless of the initial state. Moreover, the
rate of convergence is explicitly calculated in terms of the theta series,
leading to a predictable mixing time. In order to further exploit the
convergence potential, a symmetric Metropolis-Klein (SMK) algorithm is
proposed. It is proven that the Markov chain induced by the SMK algorithm is
geometrically ergodic, where a reasonable selection of the initial state is
capable to enhance the convergence performance.
","[{'version': 'v1', 'created': 'Fri, 23 Jan 2015 09:58:20 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Dec 2015 16:55:58 GMT'}, {'version': 'v3', 'created': 'Mon, 28 Mar 2016 16:04:54 GMT'}, {'version': 'v4', 'created': 'Fri, 3 Feb 2017 16:48:03 GMT'}, {'version': 'v5', 'created': 'Mon, 6 Feb 2017 13:11:09 GMT'}]",2020-10-23,"[['Wang', 'Zheng', ''], ['Ling', 'Cong', '']]","['Lattice Gaussian distribution', 'lattice coding', 'lattice decoding', 'MCMC methods']"
17274,1008.3314,Tijl De Bie,Tijl De Bie,"Maximum entropy models and subjective interestingness: an application to
  tiles in binary databases","43 pages, submitted",,,University of Bristol Tech. Rep. 125861,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent research has highlighted the practical benefits of subjective
interestingness measures, which quantify the novelty or unexpectedness of a
pattern when contrasted with any prior information of the data miner
(Silberschatz and Tuzhilin, 1995; Geng and Hamilton, 2006). A key challenge
here is the formalization of this prior information in a way that lends itself
to the definition of an interestingness subjective measure that is both
meaningful and practical.
  In this paper, we outline a general strategy of how this could be achieved,
before working out the details for a use case that is important in its own
right.
  Our general strategy is based on considering prior information as constraints
on a probabilistic model representing the uncertainty about the data. More
specifically, we represent the prior information by the maximum entropy
(MaxEnt) distribution subject to these constraints. We briefly outline various
measures that could subsequently be used to contrast patterns with this MaxEnt
model, thus quantifying their subjective interestingness.
","[{'version': 'v1', 'created': 'Thu, 19 Aug 2010 14:41:55 GMT'}]",2010-08-20,"[['De Bie', 'Tijl', '']]","['Maximum Entropy Principle', 'Subjective InterestingnessMeasures', 'Prior Information', 'Rectangular Databases', 'Swap Randomizations']"
17275,1307.1926,Seyed Kaveh Fayazbakhsh,Seyed Kaveh Fayazbakhsh,"Modeling Human Mobility and its Applications in Routing in
  Delay-Tolerant Networks: a Short Survey",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human mobility patterns are complex and distinct from one person to another.
Nevertheless, motivated by tremendous potential benefits of modeling such
patterns in enabling new mobile services and technologies, researchers have
attempted to capture salient characteristics of human mobility. In this short
survey paper, we review some of the major techniques for modeling humans'
co-location, as well as predicting human location and trajectory. Further, we
review one of the most important application areas of such models, namely,
routing in delay-tolerant networks.
","[{'version': 'v1', 'created': 'Sun, 7 Jul 2013 22:12:45 GMT'}]",2013-07-09,"[['Fayazbakhsh', 'Seyed Kaveh', '']]","['Human mobility', 'delay-tolerant networks', 'routing']"
17276,1705.07666,Pedro Martins,Pedro Martins,Goal Clustering: VNS based heuristics,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a set V of n elements on m attributes, we want to find a partition of V
on the minimum number of clusters such that the associated R-squared ratio is
at least a given threshold. We denote this problem as Goal Clustering (GC).
This problem represents a new perspective, characterizing a different
methodology within unsupervised non-hierarchical clustering. In effect, while
in the k-means we set the number of clusters in advance and then test the
associated R-squared ratio; in the GC we set an R-squared threshold lower limit
in advance and minimize k. We present two Variable Neighborhood Search (VNS)
based heuristics for the GC problem. The two heuristics use different
methodologies to start the VNS algorithms. One is based on the Ward's
construction and the other one resorts to the k-means method. Computational
tests are conducted over a set of large sized instances in order to show the
performance of the two proposed heuristics.
","[{'version': 'v1', 'created': 'Mon, 22 May 2017 11:13:12 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Jun 2017 15:22:28 GMT'}, {'version': 'v3', 'created': 'Sat, 1 Jul 2017 10:14:02 GMT'}, {'version': 'v4', 'created': 'Wed, 20 Sep 2017 21:50:07 GMT'}]",2017-09-22,"[['Martins', 'Pedro', '']]","['non-hierarchical clustering', 'unsupervised clustering', 'k-means', 'Ward’s algorithm', 'R-squared ratio', 'VNS metaheuristics']"
17277,1705.07327,Fabian Kuhn,Abdolhamid Ghodselahi and Fabian Kuhn,"Dynamic Analysis of the Arrow Distributed Directory Protocol in General
  Networks","31 pages, 3 figures",,,,cs.DS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Arrow protocol is a simple and elegant protocol to coordinate exclusive
access to a shared object in a network. The protocol solves the underlying
distributed queueing problem by using path reversal on a pre-computed spanning
tree (or any other tree topology simulated on top of the given network).
  It is known that the Arrow protocol solves the problem with a competitive
ratio of O(log D) on trees of diameter D. This implies a distributed queueing
algorithm with competitive ratio O(s*log D) for general networks with a
spanning tree of diameter D and stretch s. In this work we show that when
running the Arrow protocol on top of the well-known probabilistic tree
embedding of Fakcharoenphol, Rao, and Talwar [STOC 03], we obtain a randomized
distributed queueing algorithm with a competitive ratio of O(log n) even on
general network topologies. The result holds even if the queueing requests
occur in an arbitrarily dynamic and concurrent fashion and even if
communication is asynchronous. From a technical point of view, the main of the
paper shows that the competitive ratio of the Arrow protocol is constant on a
special family of tree topologies, known as hierarchically well separated
trees.
","[{'version': 'v1', 'created': 'Sat, 20 May 2017 16:25:22 GMT'}]",2017-05-23,"[['Ghodselahi', 'Abdolhamid', ''], ['Kuhn', 'Fabian', '']]","['competitive analysis', 'distributed queueing', 'shared objects', 'tree embeddings']"
17278,1705.07600,"Art\""ur Manukyan","Art\""ur Manukyan and Elvan Ceyhan",Classification Using Proximity Catch Digraphs (Technical Report),"41 pages, 16 figures",,,,cs.LG stat.ME stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We employ random geometric digraphs to construct semi-parametric classifiers.
These data-random digraphs are from parametrized random digraph families called
proximity catch digraphs (PCDs). A related geometric digraph family, class
cover catch digraph (CCCD), has been used to solve the class cover problem by
using its approximate minimum dominating set. CCCDs showed relatively good
performance in the classification of imbalanced data sets, and although CCCDs
have a convenient construction in $\mathbb{R}^d$, finding minimum dominating
sets is NP-hard and its probabilistic behaviour is not mathematically tractable
except for $d=1$. On the other hand, a particular family of PCDs, called
\emph{proportional-edge} PCDs (PE-PCDs), has mathematical tractable minimum
dominating sets in $\mathbb{R}^d$; however their construction in higher
dimensions may be computationally demanding. More specifically, we show that
the classifiers based on PE-PCDs are prototype-based classifiers such that the
exact minimum number of prototypes (equivalent to minimum dominating sets) are
found in polynomial time on the number of observations. We construct two types
of classifiers based on PE-PCDs. One is a family of hybrid classifiers depend
on the location of the points of the training data set, and another type is a
family of classifiers solely based on class covers. We assess the
classification performance of our PE-PCD based classifiers by extensive Monte
Carlo simulations, and compare them with that of other commonly used
classifiers. We also show that, similar to CCCD classifiers, our classifiers
are relatively better in classification in the presence of class imbalance.
","[{'version': 'v1', 'created': 'Mon, 22 May 2017 08:09:29 GMT'}]",2017-05-23,"[['Manukyan', 'Artür', ''], ['Ceyhan', 'Elvan', '']]","['Class cover problem', 'Delaunay tessellation', 'Digraph', 'Domination', 'Prototype selection', 'Separability', 'Support estimation', 'Delaunay tessellation']"
17279,1610.04789,Bernardo Gon\c{c}alves,Bernardo Gon\c{c}alves and H. V. Jagadish,"Bsmooth: Learning from user feedback to disambiguate query terms in
  interactive data retrieval","30 pages, 10 figures, 5 tables",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is great interest in supporting imprecise queries (e.g., keyword search
or natural language queries) over databases today. To support such queries, the
database system is typically required to disambiguate parts of the
user-specified query against the database, using whatever resources are
intrinsically available to it (the database schema, data values distributions,
natural language models etc). Often, systems will also have a user-interaction
log available, which can serve as an extrinsic resource to supplement their
model based on their own intrinsic resources. This leads to a problem of how
best to combine the system's prior ranking with insight derived from the
user-interaction log. Statistical inference techniques such as maximum
likelihood or Bayesian updates from a subjective prior turn out not to apply in
a straightforward way due to possible noise from user search behavior and to
encoding biases endemic to the system's models. In this paper, we address such
learning problem in interactive data retrieval, with specific focus on type
classification for user-specified query terms. We develop a novel Bayesian
smoothing algorithm, Bsmooth, which is simple, fast, flexible and accurate. We
analytically establish some desirable properties and show, through experiments
against an independent benchmark, that the addition of such a learning layer
performs much better than standard methods.
","[{'version': 'v1', 'created': 'Sat, 15 Oct 2016 22:24:50 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Oct 2016 00:58:47 GMT'}, {'version': 'v3', 'created': 'Wed, 26 Apr 2017 15:37:29 GMT'}]",2017-04-27,"[['Gonçalves', 'Bernardo', ''], ['Jagadish', 'H. V.', '']]","['Uncertainty management', 'Bayesian smoothing', 'Database usability']"
17280,0903.4770,Sk Sarif Hassan s,"Pal Choudhury Pabitra, Sahoo Sudhakar, Nayak Birendra Kumar, and
  Hassan Sk. Sarif",Act of CVT and EVT In The Formation of Number-Theoretic Fractals,15 pages,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we have defined two functions that have been used to construct
different fractals having fractal dimensions between 1 and 2. More precisely,
we can say that one of our defined functions produce the fractals whose fractal
dimension lies in [1.58, 2) and rest function produce the fractals whose
fractal dimension lies in (1, 1.58]. Also we tried to calculate the amount of
increment of fractal dimension in accordance with base of the number systems.
And in switching of fractals from one base to another, the increment of fractal
dimension is constant, which is 1.58, its quite surprising!
","[{'version': 'v1', 'created': 'Fri, 27 Mar 2009 10:38:32 GMT'}]",2009-03-30,"[['Pabitra', 'Pal Choudhury', ''], ['Sudhakar', 'Sahoo', ''], ['Kumar', 'Nayak Birendra', ''], ['Sarif', 'Hassan Sk.', '']]","['Carry Value Transformation', 'Extreme Value Transformation', 'Fractals', 'Fractal dimension']"
17281,1207.7139,Nicolas Christin,Nicolas Christin,"Traveling the Silk Road: A measurement analysis of a large anonymous
  online marketplace","26 pages, 13 figures, 4 tables; changes to v1 include revised sales
  volume and commission estimates (Sec. 5) and slightly expanded discussion",,,CMU-Cylab-12-018,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We perform a comprehensive measurement analysis of Silk Road, an anonymous,
international online marketplace that operates as a Tor hidden service and uses
Bitcoin as its exchange currency. We gather and analyze data over eight months
between the end of 2011 and 2012, including daily crawls of the marketplace for
nearly six months in 2012. We obtain a detailed picture of the type of goods
being sold on Silk Road, and of the revenues made both by sellers and Silk Road
operators. Through examining over 24,400 separate items sold on the site, we
show that Silk Road is overwhelmingly used as a market for controlled
substances and narcotics, and that most items sold are available for less than
three weeks. The majority of sellers disappears within roughly three months of
their arrival, but a core of 112 sellers has been present throughout our
measurement interval. We evaluate the total revenue made by all sellers, from
public listings, to slightly over USD 1.2 million per month; this corresponds
to about USD 92,000 per month in commissions for the Silk Road operators. We
further show that the marketplace has been operating steadily, with daily sales
and number of sellers overall increasing over our measurement interval. We
discuss economic and policy implications of our analysis and results, including
ethical considerations for future research in this area.
","[{'version': 'v1', 'created': 'Tue, 31 Jul 2012 00:21:48 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Nov 2012 23:01:33 GMT'}]",2012-11-30,"[['Christin', 'Nicolas', '']]","['Online crime', 'anonymity', 'electronic commerce']"
17282,1510.02453,Loet Leydesdorff,"Gabriel Velez-Cuartas, Diana Lucio-Arias, and Loet Leydesdorff","Regional and Global Science: Latin American and Caribbean publications
  in the SciELO Citation Index and the Web of Science",,,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We compare the visibility of Latin American and Caribbean (LAC) publications
in the Core Collection indexes of the Web of Science (WoS)--Science Citation
Index Expanded, Social Sciences Citation Index, and Arts & Humanities Citation
Index--and the SciELO Citation Index (SciELO CI) which was integrated into the
larger WoS platform in 2014. The purpose of this comparison is to contribute to
our understanding of the communication of scientific knowledge produced in
Latin America and the Caribbean, and to provide some reflections on the
potential benefits of the articulation of regional indexing exercises into WoS
for a better understanding of geographic and disciplinary contributions. How is
the regional level of SciELO CI related to the global range of WoS? In WoS, LAC
authors are integrated at the global level in international networks, while
SciELO has provided a platform for interactions among LAC researchers. The
articulation of SciELO into WoS may improve the international visibility of the
regional journals, but at the cost of independent journal inclusion criteria.
","[{'version': 'v1', 'created': 'Thu, 8 Oct 2015 19:29:35 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Nov 2015 05:34:56 GMT'}]",2015-11-09,"[['Velez-Cuartas', 'Gabriel', ''], ['Lucio-Arias', 'Diana', ''], ['Leydesdorff', 'Loet', '']]","['journals', 'databases', 'index', 'SciELO', 'WoS', 'Latin America', 'Caribbean']"
17283,1702.07499,Marc Hellmuth,"Marc Hellmuth, Adrian Fritz, Nicolas Wieseke and Peter F. Stadler",Cograph Editing: Merging Modules is equivalent to Editing P4's,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The modular decomposition of a graph $G=(V,E)$ does not contain prime modules
if and only if $G$ is a cograph, that is, if no quadruple of vertices induces a
simple connected path $P_4$. The cograph editing problem consists in inserting
into and deleting from $G$ a set $F$ of edges so that $H=(V,E\Delta F)$ is a
cograph and $|F|$ is minimum. This NP-hard combinatorial optimization problem
has recently found applications, e.g., in the context of phylogenetics.
Efficient heuristics are hence of practical importance. The simple
characterization of cographs in terms of their modular decomposition suggests
that instead of editing $G$ one could operate directly on the modular
decomposition. We show here that editing the induced $P_4$s is equivalent to
resolving prime modules by means of a suitable defined merge operation on the
submodules. Moreover, we characterize so-called module-preserving edit sets and
demonstrate that optimal pairwise sequences of module-preserving edit sets
exist for every non-cograph. This eventually leads to an exact algorithm for
the cograph editing problem as well as fixed-parameter tractable (FPT) results
when cograph editing is parameterized by the so-called modular-width. In
addition, we provide two heuristics with time complexity $O(|V|^3)$, resp.,
$O(|V|^2)$.
","[{'version': 'v1', 'created': 'Fri, 24 Feb 2017 08:51:13 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Jan 2018 19:24:45 GMT'}, {'version': 'v3', 'created': 'Tue, 10 Sep 2019 13:03:56 GMT'}]",2019-09-11,"[['Hellmuth', 'Marc', ''], ['Fritz', 'Adrian', ''], ['Wieseke', 'Nicolas', ''], ['Stadler', 'Peter F.', '']]","['Cograph Editing', 'Modular Decomposition', 'Module Merge', 'Prime Modules', 'P4']"
17284,1410.2786,Hanli Qiao,Hanli Qiao,"New SVD based initialization strategy for Non-negative Matrix
  Factorization",,,,,cs.LG cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are two problems need to be dealt with for Non-negative Matrix
Factorization (NMF): choose a suitable rank of the factorization and provide a
good initialization method for NMF algorithms. This paper aims to solve these
two problems using Singular Value Decomposition (SVD). At first we extract the
number of main components as the rank, actually this method is inspired from
[1, 2]. Second, we use the singular value and its vectors to initialize NMF
algorithm. In 2008, Boutsidis and Gollopoulos [3] provided the method titled
NNDSVD to enhance initialization of NMF algorithms. They extracted the positive
section and respective singular triplet information of the unit matrices
{C(j)}k j=1 which were obtained from singular vector pairs. This strategy aims
to use positive section to cope with negative elements of the singular vectors,
but in experiments we found that even replacing negative elements by their
absolute values could get better results than NNDSVD. Hence, we give another
method based SVD to fulfil initialization for NMF algorithms (SVD-NMF).
Numerical experiments on two face databases ORL and YALE [16, 17] show that our
method is better than NNDSVD.
","[{'version': 'v1', 'created': 'Fri, 10 Oct 2014 13:56:58 GMT'}]",2014-10-13,"[['Qiao', 'Hanli', '']]","['NMF', 'SVD', 'SVD-NMF', 'NNDSVD', 'Non-negative Matrix Factorization', 'Singular Value Decomposition']"
17285,0711.3935,Andrea Montanari,Andrea Montanari and Ruediger Urbanke,Coding for Network Coding,"12 pages, 2 ps figures",,,,cs.IT cs.NI math.IT,,"  We consider communication over a noisy network under randomized linear
network coding. Possible error mechanism include node- or link- failures,
Byzantine behavior of nodes, or an over-estimate of the network min-cut.
Building on the work of Koetter and Kschischang, we introduce a probabilistic
model for errors. We compute the capacity of this channel and we define an
error-correction scheme based on random sparse graphs and a low-complexity
decoding algorithm. By optimizing over the code degree profile, we show that
this construction achieves the channel capacity in complexity which is jointly
quadratic in the number of coded information bits and sublogarithmic in the
error probability.
","[{'version': 'v1', 'created': 'Mon, 26 Nov 2007 02:38:01 GMT'}]",2007-11-27,"[['Montanari', 'Andrea', ''], ['Urbanke', 'Ruediger', '']]","['Sparse graph codes', 'probabilistic channel models', 'Shannon channel capacity', 'network coding']"
17286,1505.01887,Francisco Chicano,"Darrell Whitley, Renato Tin\'os and Francisco Chicano","Optimal Neuron Selection: NK Echo State Networks for Reinforcement
  Learning",,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces the NK Echo State Network. The problem of learning in
the NK Echo State Network is reduced to the problem of optimizing a special
form of a Spin Glass Problem known as an NK Landscape. No weight adjustment is
used; all learning is accomplished by spinning up (turning on) or spinning down
(turning off) neurons in order to find a combination of neurons that work
together to achieve the desired computation. For special types of NK
Landscapes, an exact global solution can be obtained in polynomial time using
dynamic programming. The NK Echo State Network is applied to a reinforcement
learning problem requiring a recurrent network: balancing two poles on a cart
given no velocity information. Empirical results shows that the NK Echo State
Network learns very rapidly and yields very good generalization.
","[{'version': 'v1', 'created': 'Thu, 7 May 2015 22:58:28 GMT'}]",2015-05-11,"[['Whitley', 'Darrell', ''], ['Tinós', 'Renato', ''], ['Chicano', 'Francisco', '']]","['Neuroevolution', 'Echo State Networks', 'Neural Networks', 'NKLandscapes', 'Reinforcement Learning']"
17287,1505.04211,John Loverich,John Loverich,Discontinuous Piecewise Polynomial Neural Networks,,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An artificial neural network is presented based on the idea of connections
between units that are only active for a specific range of input values and
zero outside that range (and so are not evaluated outside the active range).
The connection function is represented by a polynomial with compact support.
The finite range of activation allows for great activation sparsity in the
network and means that theoretically you are able to add computational power to
the network without increasing the computational time required to evaluate the
network for a given input. The polynomial order ranges from first to fifth
order. Unit dropout is used for regularization and a parameter free weight
update is used. Better performance is obtained by moving from piecewise linear
connections to piecewise quadratic, even better performance can be obtained by
moving to higher order polynomials. The algorithm is tested on the MAGIC Gamma
ray data set as well as the MNIST data set.
","[{'version': 'v1', 'created': 'Fri, 15 May 2015 22:21:39 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Jun 2016 18:58:11 GMT'}]",2016-06-15,"[['Loverich', 'John', '']]","['artificial neural network', 'piecewise polynomial', 'discontinuous', 'high order', 'autoencoder', 'FLANN']"
17288,1412.5802,Vasile Patrascu,Vasile Patrascu,"Contour Detection Using Contrast Formulas in the Framework of
  Logarithmic Models","The 8th International Conference, Exhibition on Optimization of
  Electrical and Electronic Equipment, OPTIM 2002, Vol III, pp 751-756, 16 - 17
  May 2002, Brasov, Romania",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we use a new logarithmic model of image representation,
developed in [1,2], for edge detection. In fact, in the framework of the new
model we obtain the formulas for computing the ""contrast of a pixel"" and the
""contrast"" image is just the ""contour"" or edge image. In our setting the range
of values is preserved and the quality of the contour is good for high as well
as for low luminosity regions. We present the comparison of our results with
the results using classical edge detection operators.
","[{'version': 'v1', 'created': 'Thu, 18 Dec 2014 10:59:09 GMT'}]",2014-12-19,"[['Patrascu', 'Vasile', '']]","['logarithmic image processing', 'contour operations', 'contrast of pixel', 'real space vector']"
17289,1705.06181,Nikolai Dokuchaev,Nikolai Dokuchaev,"Spectrum degeneracy for functions on branching lines and impact on
  extrapolation and sampling",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper studies functions defined on continuous branching lines connected
into a system. A notion of spectrum degeneracy for these functions is
introduced. This degeneracy is based on the properties of the Fourier
transforms for processes representing functions on the branches. It is shown
that processes with this spectrum degeneracy are everywhere dense in the set of
processes equivalent to functions on the branching lines. Some applications to
extrapolation and sampling are considered.
","[{'version': 'v1', 'created': 'Wed, 17 May 2017 14:39:32 GMT'}, {'version': 'v2', 'created': 'Sat, 20 May 2017 01:43:54 GMT'}, {'version': 'v3', 'created': 'Sun, 21 Oct 2018 06:26:46 GMT'}]",2018-10-23,"[['Dokuchaev', 'Nikolai', '']]","['branching lines', 'spectrum degeneracy', 'extrapolation', 'bandlimitness']"
17290,1407.1082,Daniel Golovin,"Daniel Golovin, Andreas Krause, Matthew Streeter","Online Submodular Maximization under a Matroid Constraint with
  Application to Learning Assignments",20 pages,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Which ads should we display in sponsored search in order to maximize our
revenue? How should we dynamically rank information sources to maximize the
value of the ranking? These applications exhibit strong diminishing returns:
Redundancy decreases the marginal utility of each ad or information source. We
show that these and other problems can be formalized as repeatedly selecting an
assignment of items to positions to maximize a sequence of monotone submodular
functions that arrive one by one. We present an efficient algorithm for this
general problem and analyze it in the no-regret model. Our algorithm possesses
strong theoretical guarantees, such as a performance ratio that converges to
the optimal constant of 1 - 1/e. We empirically evaluate our algorithm on two
real-world online optimization problems on the web: ad allocation with
submodular utilities, and dynamically ranking blogs to detect information
cascades. Finally, we present a second algorithm that handles the more general
case in which the feasible sets are given by a matroid constraint, while still
maintaining a 1 - 1/e asymptotic performance ratio.
","[{'version': 'v1', 'created': 'Thu, 3 Jul 2014 23:06:10 GMT'}]",2014-07-07,"[['Golovin', 'Daniel', ''], ['Krause', 'Andreas', ''], ['Streeter', 'Matthew', '']]","['Submodular Functions', 'Matroid Constraints', 'No Regret Algorithms', 'Online Algorithms']"
17291,1407.5319,T.R. Gopalakrishnan Nair,"T.R. Gopalakrishnan Nair, Suma V, Shashi Kumar N.R","Impact Analysis of Allocation of Resources by Project Manager on Success
  of Software Projects","5 pages,5 figures, 1 tables, International Conference on Data Mining
  and Computer Engineering (ICDMCE'2012) December 21-22, 2012 Bangkok
  (Thailand)",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generation Production of successful software project is one of the prime
considerations of software industry. Engineering high quality software products
is further influenced by several factors such as budget, schedule, resource
constraints etc. A project manager is responsible for estimation and allocation
of these resources in a project. Hence, role of project manager has a vital
influence on success of the project. This research comprises of an empirical
study of several projects developed in a product and service based CMMI Level 5
Software Company. The investigation result shows a significant impact of
aforementioned factors on the success of software and on the company. The
analysis further indicates the vital role of project managers in optimizing the
resource allocation towards development of software. This paper brings in
impact analysis of efficiency of project manager in effectively allocating
resources such as time, cost, number of developers etc. An awareness of
efficiency level of project manager in optimal allocation of resources enables
one to realize the desired level of quality.
","[{'version': 'v1', 'created': 'Sun, 20 Jul 2014 18:20:37 GMT'}]",2014-07-22,"[['Nair', 'T. R. Gopalakrishnan', ''], ['V', 'Suma', ''], ['R', 'Shashi Kumar N.', '']]","['Defect Management', 'Project Management', 'Project Manager', 'Software Quality', 'Software Engineering']"
17292,1604.08336,Somaiyeh Mahmoud Zadeh,"Somaiyeh Mahmoud.Zadeh, David M.W Powers, Karl Sammut","An Autonomous Reactive Architecture for Efficient AUV Mission Time
  Management in Realistic Severe Ocean Environment",,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today AUVs operation still remains restricted to very particular tasks with
low real autonomy due to battery restrictions. Efficient motion planning and
mission scheduling are principle requirement toward advance autonomy and
facilitate the vehicle to handle long-range operations. A single vehicle cannot
carry out all tasks in a large scale terrain; hence, it needs a certain degree
of autonomy in performing robust decision making and awareness of the
mission/environment to trade-off between tasks to be completed, managing the
available time, and ensuring safe deployment at all stages of the mission. In
this respect, this research introduces a modular control architecture including
higher/lower level planners, in which the higher level module is responsible
for increasing mission productivity by assigning prioritized tasks while
guiding the vehicle toward its final destination in a terrain covered by
several waypoints; and the lower level is responsible for vehicle's safe
deployment in a smaller scale encountering time-varying ocean current and
different uncertain static/moving obstacles similar to actual ocean
environment. Synchronization between higher and lower level modules is
efficiently configured to manage the mission time and to guarantee on-time
termination of the mission. The performance and accuracy of two higher and
lower level modules are tested and validated using ant colony and firefly
optimization algorithm, respectively. After all, the overall performance of the
architecture is investigated in 10 different mission scenarios. The analyze of
the captured results from different simulated missions confirm the efficiency
and inherent robustness of the introduced architecture in efficient time
management, safe deployment, and providing beneficial operation by proper
prioritizing the tasks in accordance with mission time.
","[{'version': 'v1', 'created': 'Thu, 28 Apr 2016 07:48:49 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Jun 2016 23:24:06 GMT'}]",2016-12-06,"[['Zadeh', 'Somaiyeh Mahmoud.', ''], ['Powers', 'David M. W', ''], ['Sammut', 'Karl', '']]","['Autonomous vehicle', 'Hierarchal architecture', 'Mission/motion/path planning', 'Underwater missions', 'Task assignment', 'Time management', 'Decision Autonomy']"
17293,1702.06878,Ashkan Kalantari,"Ashkan Kalantari, Christos Tsinos, Mojtaba Soltanalian, Symeon
  Chatzinotas, Wing-Kin Ma, Erik G. Larsson, and Bj\""orn Ottersten",$M$-QAM Precoder Design for MIMO Directional Modulation Transceivers,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spectrally efficient multi-antenna wireless communication systems are a key
challenge as service demands continue to increase. At the same time, powering
up radio access networks is facing environmental and regulation limitations. In
order to achieve more power efficiency, we design a directional modulation
precoder by considering an $M$-QAM constellation, particularly with
$M=4,8,16,32$. First, extended detection regions are defined for desired
constellations using analytical geometry. Then, constellation points are placed
in the optimal positions of these regions while the minimum Euclidean distance
to adjacent constellation points and detection region boundaries is kept as in
the conventional $M$-QAM modulation. For further power efficiency and symbol
error rate similar to that of fixed design in high SNR, relaxed detection
regions are modeled for inner points of $M=16,32$ constellations. The modeled
extended and relaxed detection regions as well as the modulation
characteristics are utilized to formulate symbol-level precoder design problems
for directional modulation to minimize the transmission power while preserving
the minimum required SNR at the destination. In addition, the extended and
relaxed detection regions are used for precoder design to minimize the output
of each power amplifier. We transform the design problems into convex ones and
devise an interior point path-following iterative algorithm to solve the
mentioned problems and provide details on finding the initial values of the
parameters and the starting point. Results show that compared to the benchmark
schemes, the proposed method performs better in terms of power and peak power
reduction as well as symbol error rate reduction for a wide range of SNRs.
","[{'version': 'v1', 'created': 'Wed, 22 Feb 2017 16:27:17 GMT'}, {'version': 'v2', 'created': 'Sat, 24 Nov 2018 19:27:09 GMT'}]",2018-11-27,"[['Kalantari', 'Ashkan', ''], ['Tsinos', 'Christos', ''], ['Soltanalian', 'Mojtaba', ''], ['Chatzinotas', 'Symeon', ''], ['Ma', 'Wing-Kin', ''], ['Larsson', 'Erik G.', ''], ['Ottersten', 'Björn', '']]","['Directional modulation', 'extended detection region', 'power efficiency', 'spatial peak power', 'M-QAM modulation', 'symbollevel precoding']"
17294,1512.00312,Anton Aristov AA,Anton Aristov,The Quasi cellular nets-based models of transport and logistic systems,,"Reports of the XXIII XXIII International Scientific Symposium
  Miner's Week, 2015, Moscow : NUST MISIS., PP. 280-287",,,cs.OH,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  There are many systems in different subjects such as industry, medicine,
transport, social and others, can be discribed on their dynamic of flows.
Nowadays models of flows consist of micro- and macro-models. In practice there
is a problem of convertation from different levels of simulation. In the
different articles author descriptes quasi cellular nets. Quasi cellular nets
are new type of discrete structures without signature. It may be used for
simulation instruments. This structures can simulate flows on micro- and macro
levels on the single model structure. In this article described using quasi
cellular nets in transport and logistics of open-cast mining.
","[{'version': 'v1', 'created': 'Fri, 27 Nov 2015 01:49:02 GMT'}]",2015-12-04,"[['Aristov', 'Anton', '']]","['quasi cellular nets', 'model', 'simulation', 'logistics', 'transport', 'open-cast mining logistics']"
17295,0712.1800,Sebastien George,"S\'ebastien George (LIESP), C\'ecile Bothorel (TECH/EASY)","Conception d'outils de communication sp\'ecifiques au contexte
  \'educatif",,"Sciences et Technologies de l'Information et de la Communication
  pour l'Education et la Formation 13 (2007) 317-344",,,cs.HC,,"  In a distance learning context, providing usual communication tools (forum,
chat, ...) is not always enough to create efficient interactions between
learners and to favour collective knowledge building. A solution consists in
setting-up collective activities which encourage learners to communicate. But,
even in that case, tools can sometimes become a barrier to communication. We
present in this paper examples of specific tools that are designed in order to
favour and to guide communications in an educational context, but also to
foster interactions during learning activities that are not inherently
collaborative. We describe synchronous communication tools (semi-structured
chat), asynchronous tools (temporally structured forum, contextual forum) and a
system which promotes mutual aid between learners.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2007 19:30:46 GMT'}]",2007-12-12,"[['George', 'Sébastien', '', 'LIESP'], ['Bothorel', 'Cécile', '', 'TECH/EASY']]","['• synchronous and asynchronous discussion', 'chat', 'forum', 'online learning', 'discussion structuring', 'mutual aid network']"
17296,1312.6585,Dimitrios Thilikos,"Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos",Explicit linear kernels via dynamic programming,32 pages,,,,cs.DS cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several algorithmic meta-theorems on kernelization have appeared in the last
years, starting with the result of Bodlaender et al. [FOCS 2009] on graphs of
bounded genus, then generalized by Fomin et al. [SODA 2010] to graphs excluding
a fixed minor, and by Kim et al. [ICALP 2013] to graphs excluding a fixed
topological minor. Typically, these results guarantee the existence of linear
or polynomial kernels on sparse graph classes for problems satisfying some
generic conditions but, mainly due to their generality, it is not clear how to
derive from them constructive kernels with explicit constants. In this paper we
make a step toward a fully constructive meta-kernelization theory on sparse
graphs. Our approach is based on a more explicit protrusion replacement
machinery that, instead of expressibility in CMSO logic, uses dynamic
programming, which allows us to find an explicit upper bound on the size of the
derived kernels. We demonstrate the usefulness of our techniques by providing
the first explicit linear kernels for $r$-Dominating Set and $r$-Scattered Set
on apex-minor-free graphs, and for Planar-\mathcal{F}-Deletion on graphs
excluding a fixed (topological) minor in the case where all the graphs in
\mathcal{F} are connected.
","[{'version': 'v1', 'created': 'Mon, 23 Dec 2013 15:54:24 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Apr 2014 16:10:31 GMT'}, {'version': 'v3', 'created': 'Wed, 7 May 2014 15:28:52 GMT'}, {'version': 'v4', 'created': 'Thu, 20 Nov 2014 13:03:31 GMT'}]",2014-11-21,"[['Garnero', 'Valentin', ''], ['Paul', 'Christophe', ''], ['Sau', 'Ignasi', ''], ['Thilikos', 'Dimitrios M.', '']]","['parameterized complexity', 'linear kernels', 'dynamic programming', 'protrusion replacement', 'graph minors']"
17297,0712.3333,Abraham Punnen,Qiaoming Han and Abraham P. Punnen,On the approximability of the vertex cover and related problems,,,,,cs.DS cs.DM,,"  In this paper we show that the problem of identifying an edge $(i,j)$ in a
graph $G$ such that there exists an optimal vertex cover $S$ of $G$ containing
exactly one of the nodes $i$ and $j$ is NP-hard. Such an edge is called a weak
edge. We then develop a polynomial time approximation algorithm for the vertex
cover problem with performance guarantee $2-\frac{1}{1+\sigma}$, where $\sigma$
is an upper bound on a measure related to a weak edge of a graph. Further, we
discuss a new relaxation of the vertex cover problem which is used in our
approximation algorithm to obtain smaller values of $\sigma$. We also obtain
linear programming representations of the vertex cover problem for special
graphs. Our results provide new insights into the approximability of the vertex
cover problem - a long standing open problem.
","[{'version': 'v1', 'created': 'Thu, 20 Dec 2007 06:35:05 GMT'}]",2007-12-21,"[['Han', 'Qiaoming', ''], ['Punnen', 'Abraham P.', '']]","['vertex cover problem', 'approximation algorithm', 'LP-relaxation', 'weak edgereduction', 'NP-complete problems']"
17298,1610.08111,Ritu Kundu,Costas Iliopoulos and Ritu Kundu and Solon Pissis,Efficient Pattern Matching in Elastic-Degenerate Strings,11 pages (without references),,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we extend the notion of gapped strings to elastic-degenerate
strings. An elastic-degenerate string can been seen as an ordered collection of
k > 1 seeds (substrings/subpatterns) interleaved by elastic-degenerate symbols
such that each elastic-degenerate symbol corresponds to a set of two or more
variable length strings. Here, we present an algorithm for solving the pattern
matching problem with (solid) pattern and elastic-degenerate text, running in
O(N+{\alpha}{\gamma}nm) time; where m is the length of the given pattern; n and
N are the length and total size of the given elastic-degenerate text,
respectively; {\alpha} and {\gamma} are small constants, respectively
representing the maximum number of strings in any elastic-degenerate symbol of
the text and the largest number of elastic-degenerate symbols spanned by any
occurrence of the pattern in the text. The space used by the algorithm is
linear in the size of the input for a constant number of elastic-degenerate
symbols in the text; {\alpha} and {\gamma} are so small in real applications
that the algorithm is expected to work very efficiently in practice.
","[{'version': 'v1', 'created': 'Tue, 25 Oct 2016 22:38:08 GMT'}]",2016-10-27,"[['Iliopoulos', 'Costas', ''], ['Kundu', 'Ritu', ''], ['Pissis', 'Solon', '']]","['pattern matching', 'elastic-degenerate strings', 'degenerate strings', 'indeterminate strings', 'gapped patterns']"
17299,1212.5352,Kah Keong Chua,"Kah Keong Chua, Yong Haur Tay",On the Adaptability of Neural Network Image Super-Resolution,"Image Super Resolution, Neural Network, Multilayer Perceptron, Mean
  Squared Error, Peak Signal-to-Noise Ratio, Structural Similarity Index",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we described and developed a framework for Multilayer
Perceptron (MLP) to work on low level image processing, where MLP will be used
to perform image super-resolution. Meanwhile, MLP are trained with different
types of images from various categories, hence analyse the behaviour and
performance of the neural network. The tests are carried out using qualitative
test, in which Mean Squared Error (MSE), Peak Signal-to-Noise Ratio (PSNR) and
Structural Similarity Index (SSIM). The results showed that MLP trained with
single image category can perform reasonably well compared to methods proposed
by other researchers.
","[{'version': 'v1', 'created': 'Fri, 21 Dec 2012 07:30:38 GMT'}]",2012-12-24,"[['Chua', 'Kah Keong', ''], ['Tay', 'Yong Haur', '']]","['Image Super Resolution', 'Neural Network', 'Multilayer Perceptron', 'Mean Squared Error', 'Peak Signal-to-Noise Ratio', 'Structural Similarity Index']"
17300,1010.5875,Nikolai Stoianov,"Nikolai Todorov Stoianov, Veselin Tsenov Tselkov",E-Net Models of a Software System for E-Mail Security,"6 pages, 3 figures, Mathematics and Education in Mathematics, 2002
  Proceedings of the Thirty First Spring Conference of the Union of Bulgarian
  Mathematicians,pp.198-203, ISBN 954-8880-11-3",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents solutions for cryptography protection in MS Outlook. The
solutions comprise the authors' experience in development and implementation of
systems for information security in the Automated Information Systems of
Bulgarian Armed Forces. The architecture, the models and the methods are being
explained.
","[{'version': 'v1', 'created': 'Thu, 28 Oct 2010 07:15:36 GMT'}]",2010-10-29,"[['Stoianov', 'Nikolai Todorov', ''], ['Tselkov', 'Veselin Tsenov', '']]","['computer security', 'information security', 'e-mail security', 'e-mail messages.  1']"
17301,1707.09242,Alexey Gotsman,Alexey Gotsman and Sebastian Burckhardt,"Consistency models with global operation sequencing and their
  composition (extended version)",Extended version of the paper from DISC'17,,,,cs.DC cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern distributed systems often achieve availability and scalability by
providing consistency guarantees about the data they manage weaker than
linearizability. We consider a class of such consistency models that, despite
this weakening, guarantee that clients eventually agree on a global sequence of
operations, while seeing a subsequence of this final sequence at any given
point of time. Examples of such models include the classical Total Store Order
(TSO) and recently proposed dual TSO, Global Sequence Protocol (GSP) and
Ordered Sequential Consistency.
  We define a unified model, called Global Sequence Consistency (GSC), that has
the above models as its special cases, and investigate its key properties.
First, we propose a condition under which multiple objects each satisfying GSC
can be composed so that the whole set of objects satisfies GSC. Second, we
prove an interesting relationship between special cases of GSC---GSP, TSO and
dual TSO: we show that clients that do not communicate out-of-band cannot tell
the difference between these models. To obtain these results, we propose a
novel axiomatic specification of GSC and prove its equivalence to the
operational definition of the model.
","[{'version': 'v1', 'created': 'Fri, 28 Jul 2017 14:09:01 GMT'}]",2017-07-31,"[['Gotsman', 'Alexey', ''], ['Burckhardt', 'Sebastian', '']]","['Consistency conditions', 'Weak memory models', 'Compositionality']"
17302,1705.07375,Yansong Gao,"Yansong Gao, Hua Ma, Said F. Al-Sarawi, Derek Abbott, Damith C.
  Ranasinghe","Detecting Recycled Commodity SoCs: Exploiting Aging-Induced SRAM PUF
  Unreliability",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A physical unclonable function (PUF), analogous to a human fingerprint, has
gained an enormous amount of attention from both academia and industry. SRAM
PUF is among one of the popular silicon PUF constructions that exploits random
initial power-up states from SRAM cells to extract hardware intrinsic secrets
for identification and key generation applications. The advantage of SRAM PUFs
is that they are widely embedded into commodity devices, thus such a PUF is
obtained without a custom design and virtually free of implementation costs. A
phenomenon known as `aging' alters the consistent
reproducibility---reliability---of responses that can be extracted from a
readout of a set of SRAM PUF cells. Similar to how a PUF exploits undesirable
manufacturing randomness for generating a hardware intrinsic fingerprint, SRAM
PUF unreliability induced by aging can be exploited to detect recycled
commodity devices requiring no additional cost to the device. In this context,
the SRAM PUF itself acts as an aging sensor by exploiting responses sensitive
to aging. We use SRAMs available in pervasively deployed commercial
off-the-shelf micro-controllers for experimental validations, which complements
recent work demonstrated in FPGA platforms, and we present a simplified
detection methodology along experimental results. We show that less than 1,000
SRAM responses are adequate to guarantee that both false acceptance rate and
false rejection rate are no more than 0.001.
","[{'version': 'v1', 'created': 'Sun, 21 May 2017 01:55:44 GMT'}]",2017-05-23,"[['Gao', 'Yansong', ''], ['Ma', 'Hua', ''], ['Al-Sarawi', 'Said F.', ''], ['Abbott', 'Derek', ''], ['Ranasinghe', 'Damith C.', '']]","['Anti-counterfeiting', 'Recycled SoCs', 'SRAM PUF', 'hardware security']"
17303,1005.3350,Yipeng Liu Dr.,"Yipeng Liu, Jia Xu, Qun Wan, Yingning Peng","Minimum Variance Multi-Frequency Distortionless Restriction for Digital
  Wideband Beamformer","3 pages, 1 figures; accepted by RADAR2011",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a digital amplitude-phase weighting array based a minimum
variance multi-frequency distortionless restriction (MVMFDR) to aviod the
frequency band signal distortion in digital beamformer and too short time delay
line (TDL) requirement in analoge wideband TDL array.
","[{'version': 'v1', 'created': 'Wed, 19 May 2010 02:07:50 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Jun 2011 09:01:23 GMT'}]",2011-06-21,"[['Liu', 'Yipeng', ''], ['Xu', 'Jia', ''], ['Wan', 'Qun', ''], ['Peng', 'Yingning', '']]","['amplitude-phase weighting', 'wideband beamformer', 'ultra-wideband (UWB)']"
17304,1206.4283,Maurizio Naldi,Loretta Mastroeni and Maurizio Naldi,Pricing of insurance policies against cloud storage price rises,,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When a company migrates to cloud storage, the way back is neither easy nor
cheap. The company is then locked up in the storage contract and exposed to
upward market prices, which reduce the company's profit and may even bring it
below zero. We propose a protection means based on an insurance contract, by
which the cloud purchaser is indemnified when the current storage price exceeds
a pre-defined threshold. By applying the financial options theory, we provide a
formula for the insurance price (the premium). By using historical data on
market prices for disks, we apply the formula in realistic scenarios. We show
that the premium grows nearly quadratically with the length of the coverage
period as long as this is below one year, but grows more slowly, though faster
than linearly, over longer coverage periods.
","[{'version': 'v1', 'created': 'Fri, 15 Jun 2012 18:39:12 GMT'}]",2012-06-20,"[['Mastroeni', 'Loretta', ''], ['Naldi', 'Maurizio', '']]","['Cloud storage', 'Pricing', 'Insurance']"
17305,1704.01704,Yi Han,"Yi Han, Benjamin I. P. Rubinstein",Adequacy of the Gradient-Descent Method for Classifier Evasion Attacks,"10 pages, 7 figures, 10 tables",,,,cs.CR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the wide use of machine learning in adversarial settings including
computer security, recent studies have demonstrated vulnerabilities to evasion
attacks---carefully crafted adversarial samples that closely resemble
legitimate instances, but cause misclassification. In this paper, we examine
the adequacy of the leading approach to generating adversarial samples---the
gradient descent approach. In particular (1) we perform extensive experiments
on three datasets, MNIST, USPS and Spambase, in order to analyse the
effectiveness of the gradient-descent method against non-linear support vector
machines, and conclude that carefully reduced kernel smoothness can
significantly increase robustness to the attack; (2) we demonstrate that
separated inter-class support vectors lead to more secure models, and propose a
quantity similar to margin that can efficiently predict potential
susceptibility to gradient-descent attacks, before the attack is launched; and
(3) we design a new adversarial sample construction algorithm based on
optimising the multiplicative ratio of class decision functions.
","[{'version': 'v1', 'created': 'Thu, 6 Apr 2017 04:35:40 GMT'}, {'version': 'v2', 'created': 'Thu, 25 May 2017 04:32:43 GMT'}]",2017-05-26,"[['Han', 'Yi', ''], ['Rubinstein', 'Benjamin I. P.', '']]","['Adversarial learning', 'evasion attacks', 'gradient descent', 'RBF SVM']"
17306,1610.06009,Anand Kulkarni Dr,"Omkar Kulkarni, Ninad Kulkarni, Anand J Kulkarni, Ganesh Kakandikar","Constrained Cohort Intelligence using Static and Dynamic Penalty
  Function Approach for Mechanical Components Design",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most of the metaheuristics can efficiently solve unconstrained problems;
however, their performance may degenerate if the constraints are involved. This
paper proposes two constraint handling approaches for an emerging metaheuristic
of Cohort Intelligence (CI). More specifically CI with static penalty function
approach (SCI) and CI with dynamic penalty function approach (DCI) are
proposed. The approaches have been tested by solving several constrained test
problems. The performance of the SCI and DCI have been compared with algorithms
like GA, PSO, ABC, d-Ds. In addition, as well as three real world problems from
mechanical engineering domain with improved solutions. The results were
satisfactory and validated the applicability of CI methodology for solving real
world problems.
","[{'version': 'v1', 'created': 'Mon, 26 Sep 2016 16:36:39 GMT'}]",2016-10-20,"[['Kulkarni', 'Omkar', ''], ['Kulkarni', 'Ninad', ''], ['Kulkarni', 'Anand J', ''], ['Kakandikar', 'Ganesh', '']]","['Cohort Intelligence', 'Static Penalty Function Approach', 'Dynamic Penalty Function Approach', 'Constrained Optimization']"
17307,1401.7743,Balaji T,T.Balaji and Dr.M.Sumathi,"Effective Features of Remote Sensing Image Classification Using
  Interactive Adaptive Thresholding Method","5 pages,International Conference on Intelligent Computing
  Applications - ICICA 2014",,,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Remote sensing image classification can be performed in many different ways
to extract meaningful features. One common approach is to perform edge
detection. A second approach is to try and detect whole shapes, given the fact
that these shapes usually tend to have distinctive properties such as object
foreground or background. To get optimal results, these two approaches can be
combined. This paper adopts a combinatorial optimization method to adaptively
select threshold based features to improve remote sensing image. Feature
selection is an important combinatorial optimization problem in the remote
sensing image classification. The feature selection method has to achieve three
characteristics: first the performance issues by facilitating data collection
and reducing storage space and classification time, second to perform semantics
analysis helping to understand the problem, and third to improve prediction
accuracy by avoiding the curse of dimensionality. The goal of this thresholding
an image is to classify pixels as either dark or light and evaluation of
classification results. Interactive adaptive thresholding is a form of
thresholding that takes into account spatial variations in illumination of
remote sensing image. We present a technique for remote sensing based adaptive
thresholding using the interactive satellite image of the input. However, our
solution is more robust to illumination changes in the remote sensing image.
Additionally, our method is simple and easy to implement but it is effective
algorithm to classify the image pixels. This technique is suitable for
preprocessing the remote sensing image classification, making it a valuable
tool for interactive remote based applications such as augmented reality of the
classification procedure.
","[{'version': 'v1', 'created': 'Thu, 30 Jan 2014 05:33:27 GMT'}]",2014-01-31,"[['Balaji', 'T.', ''], ['Sumathi', 'Dr. M.', '']]","['Simple Thresholding', 'Colour Thresholding', 'Region', 'Clustering', 'Matching', 'Edge Based Classification', 'AT(Adaptive Threshold)', 'BG(Background)']"
17308,0907.0971,Yann Laigle-Chapuy,"Fr\'ed\'eric Didier, Yann Laigle-Chapuy (INRIA Rocquencourt)",Attacking the combination generator,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present one of the most efficient attacks against the combination
generator. This attack is inherent to this system as its only assumption is
that the filtering function has a good autocorrelation. This is usually the
case if the system is designed to be resistant to other kinds of attacks. We
use only classical tools, namely vectorial correlation, weight 4 multiples and
Walsh transform.
","[{'version': 'v1', 'created': 'Mon, 6 Jul 2009 11:45:19 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Jul 2009 06:56:22 GMT'}]",2009-07-13,"[['Didier', 'Frédéric', '', 'INRIA Rocquencourt'], ['Laigle-Chapuy', 'Yann', '', 'INRIA Rocquencourt']]","['Stream cipher', 'combination generator', 'Boolean functions', 'low weightmultiples', 'Walsh transform']"
17309,0706.1926,Michele Bezzi,"Michele Bezzi, Robin Groenevelt",Towards understanding and modelling office daily life,"5 pages, ECHISE 2006 - 2nd International Workshop on Exploiting
  Context Histories in Smart Environments - Infrastructures and Design, 8th
  International Conference of Ubiquitous Computing (Ubicomp 2006), Orange
  County, CA, 17-21 September 2006",,,,cs.CV cs.CY,,"  Measuring and modeling human behavior is a very complex task. In this paper
we present our initial thoughts on modeling and automatic recognition of some
human activities in an office. We argue that to successfully model human
activities, we need to consider both individual behavior and group dynamics. To
demonstrate these theoretical approaches, we introduce an experimental system
for analyzing everyday activity in our office.
","[{'version': 'v1', 'created': 'Wed, 13 Jun 2007 15:15:00 GMT'}]",2007-06-14,"[['Bezzi', 'Michele', ''], ['Groenevelt', 'Robin', '']]","['Probabilistic data', 'office activities', 'information theory; social networks']"
17310,1403.0307,Loc Tran Vinh,"Loc V. Tran, Chien H. Thai, Buntara S. Gan and H. Nguyen-Xuan","Isogeometric finite element analysis of laminated composite plates based
  on a four variable refined plate theory",arXiv admin note: substantial text overlap with arXiv:1310.1847,,,,cs.CE math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a novel and effective formulation based on isogeometric
approach (IGA) and Refined Plate Theory (RPT) is proposed to study the behavior
of laminated composite plates. Using many kinds of higher-order distributed
functions, RPT model naturally satisfies the traction-free boundary conditions
at plate surfaces and describes the non-linear distribution of shear stresses
without requiring shear correction factor (SCF). IGA utilizes the basis
functions, namely B-splines or non-uniform rational B-splines (NURBS), which
achieve easily the smoothness of any arbitrary order. It hence satisfies the C1
requirement of the RPT model. The static, dynamic and buckling analysis of
rectangular plates is investigated for different boundary conditions. Numerical
results show high effectiveness of the present formulation.
","[{'version': 'v1', 'created': 'Mon, 3 Mar 2014 04:10:48 GMT'}]",2014-03-04,"[['Tran', 'Loc V.', ''], ['Thai', 'Chien H.', ''], ['Gan', 'Buntara S.', ''], ['Nguyen-Xuan', 'H.', '']]","['plate', 'composite', 'isogeometric analysis (IGA)', 'refined plate theory (RPT)']"
17311,1010.1234,Arthur Sorkin,Arthur Sorkin and Peter Donovan,"LR(1) Parser Generation System: LR(1) Error Recovery, Oracles, and
  Generic Tokens",6 pages,,,,cs.PL cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The LR(1) Parser Generation System generates full LR(1) parsers that are
comparable in speed and size to those generated by LALR(1) parser generators,
such as yacc [5]. LR contains a number of novel feature. This paper discusses
three of them in detail: an LR(1) grammar specified automatic error recovery
algorithm, oracles, and generic tokens.
","[{'version': 'v1', 'created': 'Wed, 6 Oct 2010 19:13:38 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Jun 2012 01:00:59 GMT'}]",2015-03-17,"[['Sorkin', 'Arthur', ''], ['Donovan', 'Peter', '']]","['parser construction', 'parsing', 'error recovery', 'LR(1)', 'Pager', 'generic tokens', 'oracles']"
17312,1402.5045,Lucas Paletta,"Nicolas Sabouret, Haza\""el Jones, Magalie Ochs, Mathieu Chollet,
  Catherine Pelachaud",Expressing social attitudes in virtual agents for social training games,,,,IDGEI/2014/11,cs.HC cs.AI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of virtual agents in social coaching has increased rapidly in the
last decade. In order to train the user in different situations than can occur
in real life, the virtual agent should be able to express different social
attitudes. In this paper, we propose a model of social attitudes that enables a
virtual agent to reason on the appropriate social attitude to express during
the interaction with a user given the course of the interaction, but also the
emotions, mood and personality of the agent. Moreover, the model enables the
virtual agent to display its social attitude through its non-verbal behaviour.
The proposed model has been developed in the context of job interview
simulation. The methodology used to develop such a model combined a theoretical
and an empirical approach. Indeed, the model is based both on the literature in
Human and Social Sciences on social attitudes but also on the analysis of an
audiovisual corpus of job interviews and on post-hoc interviews with the
recruiters on their expressed attitudes during the job interview.
","[{'version': 'v1', 'created': 'Thu, 20 Feb 2014 15:41:26 GMT'}]",2014-02-21,"[['Sabouret', 'Nicolas', ''], ['Jones', 'Hazaël', ''], ['Ochs', 'Magalie', ''], ['Chollet', 'Mathieu', ''], ['Pelachaud', 'Catherine', '']]","['Social Attitudes', 'Emotions', 'Affective computing', 'VirtualAgent', 'Non-verbal behaviour']"
17313,1009.0605,Louis Dorard,Louis Dorard and John Shawe-Taylor,"Gaussian Process Bandits for Tree Search: Theory and Application to
  Planning in Discounted MDPs","Second draft. Tried to follow the JMLR formatting guidelines. Made
  corrections to the section on planning in MDPs",,,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We motivate and analyse a new Tree Search algorithm, GPTS, based on recent
theoretical advances in the use of Gaussian Processes for Bandit problems. We
consider tree paths as arms and we assume the target/reward function is drawn
from a GP distribution. The posterior mean and variance, after observing data,
are used to define confidence intervals for the function values, and we
sequentially play arms with highest upper confidence bounds. We give an
efficient implementation of GPTS and we adapt previous regret bounds by
determining the decay rate of the eigenvalues of the kernel matrix on the whole
set of tree paths. We consider two kernels in the feature space of binary
vectors indexed by the nodes of the tree: linear and Gaussian. The regret grows
in square root of the number of iterations T, up to a logarithmic factor, with
a constant that improves with bigger Gaussian kernel widths. We focus on
practical values of T, smaller than the number of arms. Finally, we apply GPTS
to Open Loop Planning in discounted Markov Decision Processes by modelling the
reward as a discounted sum of independent Gaussian Processes. We report similar
regret bounds to those of the OLOP algorithm.
","[{'version': 'v1', 'created': 'Fri, 3 Sep 2010 08:36:07 GMT'}, {'version': 'v2', 'created': 'Sat, 15 Jan 2011 15:34:21 GMT'}]",2011-01-18,"[['Dorard', 'Louis', ''], ['Shawe-Taylor', 'John', '']]","['Bandits', 'Gaussian Processes', 'Tree Search', 'Open Loop Planning', 'MarkovDecision Processes']"
17314,1205.4891,Amit Daniely,Amit Daniely and Nati Linial and Michael Saks,Clustering is difficult only when it does not matter,,,,,cs.LG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Numerous papers ask how difficult it is to cluster data. We suggest that the
more relevant and interesting question is how difficult it is to cluster data
sets {\em that can be clustered well}. More generally, despite the ubiquity and
the great importance of clustering, we still do not have a satisfactory
mathematical theory of clustering. In order to properly understand clustering,
it is clearly necessary to develop a solid theoretical basis for the area. For
example, from the perspective of computational complexity theory the clustering
problem seems very hard. Numerous papers introduce various criteria and
numerical measures to quantify the quality of a given clustering. The resulting
conclusions are pessimistic, since it is computationally difficult to find an
optimal clustering of a given data set, if we go by any of these popular
criteria. In contrast, the practitioners' perspective is much more optimistic.
Our explanation for this disparity of opinions is that complexity theory
concentrates on the worst case, whereas in reality we only care for data sets
that can be clustered well.
  We introduce a theoretical framework of clustering in metric spaces that
revolves around a notion of ""good clustering"". We show that if a good
clustering exists, then in many cases it can be efficiently found. Our
conclusion is that contrary to popular belief, clustering should not be
considered a hard task.
","[{'version': 'v1', 'created': 'Tue, 22 May 2012 12:25:01 GMT'}]",2012-05-23,"[['Daniely', 'Amit', ''], ['Linial', 'Nati', ''], ['Saks', 'Michael', '']]","['Cluster Analysis', 'Hardness of clustering', 'Theoretical Frameworkfor clustering', 'Stability']"
17315,1802.09001,Batya Kenig,Batya Kenig,"The Complexity of the Possible Winner Problem over Partitioned
  Preferences",,,,,cs.GT cs.CC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Possible-Winner problem asks, given an election where the voters'
preferences over the set of candidates is partially specified, whether a
distinguished candidate can become a winner. In this work, we consider the
computational complexity of Possible-Winner under the assumption that the voter
preferences are $partitioned$. That is, we assume that every voter provides a
complete order over sets of incomparable candidates (e.g., candidates are
ranked by their level of education). We consider elections with partitioned
profiles over positional scoring rules, with an unbounded number of candidates,
and unweighted voters. Our first result is a polynomial time algorithm for
voting rules with $2$ distinct values, which include the well-known
$k$-approval voting rule. We then go on to prove NP-hardness for a class of
rules that contain all voting rules that produce scoring vectors with at least
$4$ distinct values.
","[{'version': 'v1', 'created': 'Sun, 25 Feb 2018 13:21:40 GMT'}]",2018-02-27,"[['Kenig', 'Batya', '']]","['Computational Social Choice', 'NP-Completeness', 'Maxflow', 'Voting', 'PossibleWinner']"
17316,1307.3013,Takahiro Kawamura,"Keisuke Umezu, Takahiro Kawamura, and Akihiko Ohsuga","Context-based Barrier Notification Service Toward Outdoor Support for
  the Elderly",,,,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aging society has been becoming a global problem not only in advanced
countries. Under such circumstances, it is said that participation of elderly
people in social activities is highly desirable from various perspectives
including decrease of social welfare costs. Thus, we propose a mobile service
that notifies barrier information nearby users outside to lowers the anxiety of
elderly people and promote their social activities. There are barrier free maps
in some areas, but those are static and updated annually at the earliest.
However, there exist temporary barriers like road repairing and parked
bicycles, and also every barrier is not for every elder person. That is, the
elder people are under several conditions and wills to go out, so that a
barrier for an elder person is not necessarily the one for the other.
Therefore, we first collect the barrier information in the user participatory
manner and select the ones the user need to know, then timely provide them via
a mobile phone equipped with GPS. This paper shows the public experiment that
we conducted in Tokyo, and confirms the usability and the accuracy of the
information filtering.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2013 08:24:02 GMT'}]",2013-07-12,"[['Umezu', 'Keisuke', ''], ['Kawamura', 'Takahiro', ''], ['Ohsuga', 'Akihiko', '']]","['Barrier Free', 'Elder People', 'Bayesian Network']"
17317,1312.2501,"Jesper Larsson Tr\""aff","Martin Wimmer and Daniel Cederman and Francesco Versaci and Jesper
  Larsson Tr\""aff and Philippas Tsigas",Data Structures for Task-based Priority Scheduling,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many task-parallel applications can benefit from attempting to execute tasks
in a specific order, as for instance indicated by priorities associated with
the tasks. We present three lock-free data structures for priority scheduling
with different trade-offs on scalability and ordering guarantees. First we
propose a basic extension to work-stealing that provides good scalability, but
cannot provide any guarantees for task-ordering in-between threads. Next, we
present a centralized priority data structure based on $k$-fifo queues, which
provides strong (but still relaxed with regard to a sequential specification)
guarantees. The parameter $k$ allows to dynamically configure the trade-off
between scalability and the required ordering guarantee. Third, and finally, we
combine both data structures into a hybrid, $k$-priority data structure, which
provides scalability similar to the work-stealing based approach for larger
$k$, while giving strong ordering guarantees for smaller $k$. We argue for
using the hybrid data structure as the best compromise for generic,
priority-based task-scheduling.
  We analyze the behavior and trade-offs of our data structures in the context
of a simple parallelization of Dijkstra's single-source shortest path
algorithm. Our theoretical analysis and simulations show that both the
centralized and the hybrid $k$-priority based data structures can give strong
guarantees on the useful work performed by the parallel Dijkstra algorithm. We
support our results with experimental evidence on an 80-core Intel Xeon system.
","[{'version': 'v1', 'created': 'Mon, 9 Dec 2013 16:27:10 GMT'}]",2013-12-10,"[['Wimmer', 'Martin', ''], ['Cederman', 'Daniel', ''], ['Versaci', 'Francesco', ''], ['Träff', 'Jesper Larsson', ''], ['Tsigas', 'Philippas', '']]","['Task-parallel programming', 'priority scheduling', 'k-priority data structure', 'work-stealing', 'parallel single-source shortest path algorithm']"
17318,1603.03007,Alexander Tchitchigin,"Alexander Tchitchigin, Max Talanov, Larisa Safina, Manuel Mazzara",Robot Dream,"keywords: robotics, spiking neural networks, artificial emotions,
  affective computing",,,,cs.RO cs.AI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In this position paper we present a novel approach to neurobiologically
plausible implementation of emotional reactions and behaviors for real-time
autonomous robotic systems. The working metaphor we use is the ""day"" and
""night"" phases of mammalian life. During the ""day"" phase a robotic system
stores the inbound information and is controlled by a light-weight rule-based
system in real time. In contrast to that, during the ""night"" phase the stored
information is been transferred to the supercomputing system to update the
realistic neural network: emotional and behavioral strategies.
","[{'version': 'v1', 'created': 'Wed, 9 Mar 2016 19:14:27 GMT'}]",2016-03-10,"[['Tchitchigin', 'Alexander', ''], ['Talanov', 'Max', ''], ['Safina', 'Larisa', ''], ['Mazzara', 'Manuel', '']]","['robotics', 'spiking neural networks', 'artificial emotions', 'affective computing']"
17319,1710.02049,Lucca Hirschi,"Lucca Hirschi, David Baelde and St\'ephanie Delaune",A method for unbounded verification of privacy-type properties,Will appear in the Journal of Computer Security (IOS Press),,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider the problem of verifying anonymity and
unlinkability in the symbolic model, where protocols are represented as
processes in a variant of the applied pi calculus, notably used in the ProVerif
tool. Existing tools and techniques do not allow to verify directly these
properties, expressed as behavioral equivalences. We propose a different
approach: we design two conditions on protocols which are sufficient to ensure
anonymity and unlinkability, and which can then be effectively checked
automatically using ProVerif. Our two conditions correspond to two broad
classes of attacks on unlinkability, i.e. data and control-flow leaks. This
theoretical result is general enough that it applies to a wide class of
protocols based on a variety of cryptographic primitives. In particular, using
our tool, UKano, we provide the first formal security proofs of protocols such
as BAC and PACE (e-passport), Hash-Lock (RFID authentication), etc. Our work
has also lead to the discovery of new attacks, including one on the LAK
protocol (RFID authentication) which was previously claimed to be unlinkable
(in a weak sense).
","[{'version': 'v1', 'created': 'Thu, 5 Oct 2017 14:44:02 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Nov 2018 17:40:58 GMT'}, {'version': 'v3', 'created': 'Mon, 8 Apr 2019 14:44:33 GMT'}]",2019-04-09,"[['Hirschi', 'Lucca', ''], ['Baelde', 'David', ''], ['Delaune', 'Stéphanie', '']]","['formal verification', 'security protocols', 'symbolic model', 'equivalence-based properties']"
17320,1609.06570,Guillaume Lemaitre,Guillaume Lemaitre and Fernando Nogueira and Christos K. Aridas,"Imbalanced-learn: A Python Toolbox to Tackle the Curse of Imbalanced
  Datasets in Machine Learning",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Imbalanced-learn is an open-source python toolbox aiming at providing a wide
range of methods to cope with the problem of imbalanced dataset frequently
encountered in machine learning and pattern recognition. The implemented
state-of-the-art methods can be categorized into 4 groups: (i) under-sampling,
(ii) over-sampling, (iii) combination of over- and under-sampling, and (iv)
ensemble learning methods. The proposed toolbox only depends on numpy, scipy,
and scikit-learn and is distributed under MIT license. Furthermore, it is fully
compatible with scikit-learn and is part of the scikit-learn-contrib supported
project. Documentation, unit tests as well as integration tests are provided to
ease usage and contribution. The toolbox is publicly available in GitHub:
https://github.com/scikit-learn-contrib/imbalanced-learn.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2016 14:16:14 GMT'}]",2016-09-22,"[['Lemaitre', 'Guillaume', ''], ['Nogueira', 'Fernando', ''], ['Aridas', 'Christos K.', '']]","['Imbalanced Dataset', 'Over-Sampling', 'Under-Sampling', 'Ensemble Learning', 'Machine Learning', 'Python']"
17321,1506.04429,Stelios Erotokritou,Yvo Desmedt and Stelios Erotokritou,"Making Code Voting Secure against Insider Threats using Unconditionally
  Secure MIX Schemes and Human PSMT Protocols",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Code voting was introduced by Chaum as a solution for using a possibly
infected-by-malware device to cast a vote in an electronic voting application.
Chaum's work on code voting assumed voting codes are physically delivered to
voters using the mail system, implicitly requiring to trust the mail system.
This is not necessarily a valid assumption to make - especially if the mail
system cannot be trusted. When conspiring with the recipient of the cast
ballots, privacy is broken.
  It is clear to the public that when it comes to privacy, computers and
""secure"" communication over the Internet cannot fully be trusted. This
emphasizes the importance of using: (1) Unconditional security for secure
network communication. (2) Reduce reliance on untrusted computers.
  In this paper we explore how to remove the mail system trust assumption in
code voting. We use PSMT protocols (SCN 2012) where with the help of visual
aids, humans can carry out $\mod 10$ addition correctly with a 99\% degree of
accuracy. We introduce an unconditionally secure MIX based on the combinatorics
of set systems.
  Given that end users of our proposed voting scheme construction are humans we
\emph{cannot use} classical Secure Multi Party Computation protocols.
  Our solutions are for both single and multi-seat elections achieving:
\begin{enumerate}[i)]
  \item An anonymous and perfectly secure communication network secure against
a $t$-bounded passive adversary used to deliver voting,
  \item The end step of the protocol can be handled by a human to evade the
threat of malware. \end{enumerate} We do not focus on active adversaries.
","[{'version': 'v1', 'created': 'Sun, 14 Jun 2015 19:07:51 GMT'}]",2015-06-16,"[['Desmedt', 'Yvo', ''], ['Erotokritou', 'Stelios', '']]","['Voting Systems', 'Internet Voting', 'Information Theoretic Anonymity', 'Private and Secure Message Transmission', 'Computer System Diversity']"
17322,1410.4477,Amir Rastegarnia,"Azam Khalili, Wael M. Bazzi, Amir Rastegarnia","Analysis of incremental augmented affine projection algorithm for
  distributed estimation of complex signals","23 pages, 6 figures",,,,cs.DC cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the problem of distributed estimation in an incremental
network when the measurements taken by the node follow a widely linear model.
The proposed algorithm which we refer to it as incremental augmented affine
projection algorithm (incAAPA) utilizes the full second order statistical
information in the complex domain. Moreover, it exploits spatio-temporal
diversity to improve the estimation performance. We derive steady-state
performance metric of the incAAPA in terms of the mean-square deviation (MSD).
We further derive sufficient conditions to ensure mean-square convergence. Our
analysis illustrate that the proposed algorithm is able to process both second
order circular (proper) and noncircular (improper) signals. The validity of the
theoretical results and the good performance of the proposed algorithm are
demonstrated by several computer simulations.
","[{'version': 'v1', 'created': 'Thu, 16 Oct 2014 16:03:22 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Dec 2014 12:57:13 GMT'}]",2014-12-19,"[['Khalili', 'Azam', ''], ['Bazzi', 'Wael M.', ''], ['Rastegarnia', 'Amir', '']]","['adaptive networks', 'incremental', 'complex data', 'affine']"
17323,1206.0396,Abdullah Elewi M.Sc.,"Elsayed Saad, Medhat Awadalla, Mohamed Shalan and Abdullah Elewi",Energy-Aware Task Partitioning on Heterogeneous Multiprocessor Platforms,"8 pages, 9 figures","the International Journal of Computer Science Issues (IJCSI), Vol.
  9, Issue 2, No. 1, 2012, pp. 176-183",,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efficient task partitioning plays a crucial role in achieving high
performance at multiprocessor plat forms. This paper addresses the problem of
energy-aware static partitioning of periodic real-time tasks on heterogeneous
multiprocessor platforms. A Particle Swarm Optimization variant based on
Min-min technique for task partitioning is proposed. The proposed approach aims
to minimize the overall energy consumption, meanwhile avoid deadline
violations. An energy-aware cost function is proposed to be considered in the
proposed approach. Extensive simulations and comparisons are conducted in order
to validate the effectiveness of the proposed technique. The achieved results
demonstrate that the proposed partitioning scheme significantly surpasses
previous approaches in terms of both number of iterations and energy savings.
","[{'version': 'v1', 'created': 'Sat, 2 Jun 2012 18:22:37 GMT'}]",2017-10-31,"[['Saad', 'Elsayed', ''], ['Awadalla', 'Medhat', ''], ['Shalan', 'Mohamed', ''], ['Elewi', 'Abdullah', '']]","['Task Partitioning', 'Task Assignment', 'Heterogeneous Multiprocessors', 'Particle Swarm Optimization', 'Min-min']"
17324,1004.0774,Secretary Aircc Journal,"Johnneth Fonseca, Zair Abdelouahab, Denivaldo Lopes and Sofiane Labidi",A security framework for SOA applications in mobile environment,18Pages,"International Journal of Network Security & Its Applications 1.3
  (2009) 90-107",,,cs.SE cs.CR cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  A Rapid evolution of mobile technologies has led to the development of more
sophisticated mobile devices with better storage, processing and transmission
power. These factors enable support to many types of application but also give
rise to a necessity to find a model of service development. Actually, SOA
(Service Oriented Architecture) is a good option to support application
development. This paper presents a framework that allows the development of SOA
based application in mobile environment. The objective of the framework is to
give developers with tools for provision of services in this environment with
the necessary security characteristics.
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2010 05:32:22 GMT'}]",2010-07-15,"[['Fonseca', 'Johnneth', ''], ['Abdelouahab', 'Zair', ''], ['Lopes', 'Denivaldo', ''], ['Labidi', 'Sofiane', '']]","['SOA', 'Security', 'Framework', 'Mobile devices']"
17325,1202.6395,Stephen A. Fenner,Stephen A. Fenner,Functions that preserve p-randomness,"24 pages, 2 figures. An extended abstract of this paper appeared in
  Proceedings of the 18th International Symposium on Fundamentals of
  Computation Theory (FCT), volume 6914 of Lecture Notes in Computer Science,
  Springer-Verlag, pages 336-347, 2011",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that polynomial-time randomness (p-randomness) is preserved under a
variety of familiar operations, including addition and multiplication by a
nonzero polynomial-time computable real number. These results follow from a
general theorem: If $I$ is an open interval in the reals, $f$ is a function
mapping $I$ into the reals, and $r$ in $I$ is p-random, then $f(r)$ is p-random
provided
  1. $f$ is p-computable on the dyadic rational points in $I$, and
  2. $f$ varies sufficiently at $r$, i.e., there exists a real constant $C > 0$
such that either (a) $(f(x) - f(r))/(x-r) > C$ for all $x$ in $I$ with $x \ne
r$, or (b) $(f(x) - f(r))(x-r) < -C$ for all $x$ in $I$ with $x \ne r$.
  Our theorem implies in particular that any analytic function about a
p-computable point whose power series has uniformly p-computable coefficients
preserves p-randomness in its open interval of absolute convergence. Such
functions include all the familiar functions from first-year calculus.
","[{'version': 'v1', 'created': 'Tue, 28 Feb 2012 22:03:38 GMT'}]",2012-03-01,"[['Fenner', 'Stephen A.', '']]","['Randomness', 'p-randomness', 'complexity', 'polynomial time', 'measure', 'martingale', 'real analysis']"
17326,1209.5246,Ian Sommerville Prof,"Ian Sommerville, Russell Lock, Tim Storer",Information requirements for enterprise systems,"17 pages, 4 figures. 17th Monterey workshop, Oxford",,,,cs.SE cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we discuss an approach to system requirements engineering,
which is based on using models of the responsibilities assigned to agents in a
multi-agency system of systems. The responsibility models serve as a basis for
identifying the stakeholders that should be considered in establishing the
requirements and provide a basis for a structured approach, described here, for
information requirements elicitation. We illustrate this approach using a case
study drawn from civil emergency management.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2012 12:36:32 GMT'}]",2012-09-25,"[['Sommerville', 'Ian', ''], ['Lock', 'Russell', ''], ['Storer', 'Tim', '']]","['requirements engineering', 'requirements', 'enterprise systems', 'responsibility modeling', 'socio-technical systems']"
17327,0907.5290,Alexander Shkotin,Alex Shkotin,Program structure,"22 pages, 4 figures",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A program is usually represented as a word chain. It is exactly a word chain
that appears as the lexical analyzer output and is parsed. The work shows that
a program can be syntactically represented as an oriented word tree, that is a
syntactic program tree, program words being located both in tree nodes and on
tree arrows. The basic property of a tree is that arrows starting from each
node are marked by different words (including an empty word). Semantics can
then be directly specified on such tree using either requirements or additional
links, and adding instructions to some tree nodes enables program execution
specification.
","[{'version': 'v1', 'created': 'Thu, 30 Jul 2009 09:33:53 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Mar 2012 18:58:15 GMT'}]",2012-03-23,"[['Shkotin', 'Alex', '']]","['program syntax', 'program semantics', 'finite labeled graph']"
17328,0705.1397,Damien Chablat,"Damien Chablat (IRCCyN), Fouad Bennis (IRCCyN)",Realistic Rendering of Kinetostatic Indices of Mechanisms,,Virtual Concept (2003) 1-8,,,cs.RO,,"  The work presented in this paper is related to the use of a haptic device in
an environment of robotic simulation. Such device introduces a new approach to
feel and to understand the boundaries of the workspace of mechanisms as well as
its kinetostatic properties. Indeed, these concepts are abstract and thus often
difficult to understand for the end-users. To catch his attention, we propose
to amplify the problems of the mechanisms in order to help him to take the good
decisions.
","[{'version': 'v1', 'created': 'Thu, 10 May 2007 06:56:25 GMT'}]",2007-05-23,"[['Chablat', 'Damien', '', 'IRCCyN'], ['Bennis', 'Fouad', '', 'IRCCyN']]","['Kinetostatic properties', 'Mechanisms', 'Virtual reality devices', 'Simulation', 'Virtual manufacturing']"
17329,0710.3536,Krzysztof R. Apt,Krzysztof R. Apt and Jonathan A. Zvesper,"Common Beliefs and Public Announcements in Strategic Games with
  Arbitrary Strategy Sets",36 pages. Revised version,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide an epistemic analysis of arbitrary strategic games based on
possibility correspondences. We first establish a generic result that links
true common beliefs (and, respectively, common knowledge) of players'
rationality defined by means of `monotonic' properties, with the iterated
elimination of strategies that do not satisfy these properties. It allows us to
deduce the customary results concerned with true common beliefs of rationality
and iterated elimination of strictly dominated strategies as simple
corollaries. This approach relies on Tarski's Fixpoint Theorem. We also provide
an axiomatic presentation of this generic result. This allows us to clarify the
proof-theoretic principles assumed in players' reasoning. Finally, we provide
an alternative characterization of the iterated elimination of strategies based
on the concept of a public announcement. It applies to `global properties'.
Both classes of properties include the notions of rationalizability and the
iterated elimination of strictly dominated strategies.
","[{'version': 'v1', 'created': 'Thu, 18 Oct 2007 15:28:58 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Nov 2008 08:24:11 GMT'}]",2008-11-07,"[['Apt', 'Krzysztof R.', ''], ['Zvesper', 'Jonathan A.', '']]","['epistemic analysis', 'possibility correspondences', 'fixpoints', 'monotonicity', 'rationalizability', 'public announcements']"
17330,1604.07898,Somaiyeh Mahmoud.Zadeh,"Somaiyeh Mahmoud.Zadeh, Karl Sammut, David M.W Powers, Adham Atyabi,
  Amir Mehdi Yazdani","A Hierarchal Planning Framework for AUV Mission Management in a
  Spatio-Temporal Varying Ocean",,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this paper is to provide a hierarchical dynamic mission
planning framework for a single autonomous underwater vehicle (AUV) to
accomplish task-assign process in a limited time interval while operating in an
uncertain undersea environment, where spatio-temporal variability of the
operating field is taken into account. To this end, a high level reactive
mission planner and a low level motion planning system are constructed. The
high level system is responsible for task priority assignment and guiding the
vehicle toward a target of interest considering on-time termination of the
mission. The lower layer is in charge of generating optimal trajectories based
on sequence of tasks and dynamicity of operating terrain. The mission planner
is able to reactively re-arrange the tasks based on mission/terrain updates
while the low level planner is capable of coping unexpected changes of the
terrain by correcting the old path and re-generating a new trajectory. As a
result, the vehicle is able to undertake the maximum number of tasks with
certain degree of maneuverability having situational awareness of the operating
field. The computational engine of the mentioned framework is based on the
biogeography based optimization (BBO) algorithm that is capable of providing
efficient solutions. To evaluate the performance of the proposed framework,
firstly, a realistic model of undersea environment is provided based on
realistic map data, and then several scenarios, treated as real experiments,
are designed through the simulation study. Additionally, to show the robustness
and reliability of the framework, Monte-Carlo simulation is carried out and
statistical analysis is performed. The results of simulations indicate the
significant potential of the two-level hierarchical mission planning system in
mission success and its applicability for real-time implementation.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2016 01:04:34 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Jun 2016 23:19:37 GMT'}, {'version': 'v3', 'created': 'Mon, 20 Nov 2017 00:41:47 GMT'}]",2017-11-21,"[['Zadeh', 'Somaiyeh Mahmoud.', ''], ['Sammut', 'Karl', ''], ['Powers', 'David M. W', ''], ['Atyabi', 'Adham', ''], ['Yazdani', 'Amir Mehdi', '']]","['mission planning', 'optimization', 'autonomous underwater vehicle', 'autonomy', 'dynamic current', 'spatio-temporal ocean']"
17331,1511.06470,Zhengjun Cao,Zhengjun Cao and Lihua Liu,Comment on Two schemes for Secure Outsourcing of Linear Programming,4 pages,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, Wang et al. [IEEE INFOCOM 2011, 820-828], and Nie et al. [IEEE AINA
2014, 591-596] have proposed two schemes for secure outsourcing of large-scale
linear programming (LP). They did not consider the standard form: minimize
c^{T}x, subject to Ax=b, x>0. Instead, they studied a peculiar form: minimize
c^{T}x, subject to Ax = b, Bx>0, where B is a non-singular matrix. In this
note, we stress that the proposed peculiar form is unsolvable and meaningless.
The two schemes have confused the functional inequality constraints Bx>0 with
the nonnegativity constraints x>0 in the linear programming model. But the
condition x>0 is indispensable to the simplex method. Therefore, both two
schemes failed.
","[{'version': 'v1', 'created': 'Fri, 20 Nov 2015 01:28:15 GMT'}]",2015-11-23,"[['Cao', 'Zhengjun', ''], ['Liu', 'Lihua', '']]","['Cloud computing', 'confidentiality-preserving image search', 'additivehomomorphic encryption', 'symmetric key encryption']"
17332,1512.00378,Bojian Xu,Wing-Kai Hon and Sharma V. Thankachan and Bojian Xu,"An In-place Framework for Exact and Approximate Shortest Unique
  Substring Queries","15 pages. A preliminary version of this paper appears in Proceedings
  of the 26th International Symposium on Algorithms and Computation (ISAAC),
  Nagoya, Japan, 2015",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We revisit the exact shortest unique substring (SUS) finding problem, and
propose its approximate version where mismatches are allowed, due to its
applications in subfields such as computational biology. We design a generic
in-place framework that fits to solve both the exact and approximate
$k$-mismatch SUS finding, using the minimum $2n$ memory words plus $n$ bytes
space, where $n$ is the input string size. By using the in-place framework, we
can find the exact and approximate $k$-mismatch SUS for every string position
using a total of $O(n)$ and $O(n^2)$ time, respectively, regardless of the
value of $k$. Our framework does not involve any compressed or succinct data
structures and thus is practical and easy to implement.
","[{'version': 'v1', 'created': 'Tue, 1 Dec 2015 18:34:23 GMT'}]",2015-12-02,"[['Hon', 'Wing-Kai', ''], ['Thankachan', 'Sharma V.', ''], ['Xu', 'Bojian', '']]","['string pattern matching', 'shortest unique substring', 'in-place algorithms']"
17333,0906.2135,Michael Nelson,"Herbert Van de Sompel, Carl Lagoze, Michael L. Nelson, Simeon Warner,
  Robert Sanderson, Pete Johnston",Adding eScience Assets to the Data Web,"10 pages, 7 figures. Proceedings of Linked Data on the Web (LDOW2009)
  Workshop",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aggregations of Web resources are increasingly important in scholarship as it
adopts new methods that are data-centric, collaborative, and networked-based.
The same notion of aggregations of resources is common to the mashed-up,
socially networked information environment of Web 2.0. We present a mechanism
to identify and describe aggregations of Web resources that has resulted from
the Open Archives Initiative - Object Reuse and Exchange (OAI-ORE) project. The
OAI-ORE specifications are based on the principles of the Architecture of the
World Wide Web, the Semantic Web, and the Linked Data effort. Therefore, their
incorporation into the cyberinfrastructure that supports eScholarship will
ensure the integration of the products of scholarly research into the Data Web.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2009 15:33:37 GMT'}]",2009-06-12,"[['Van de Sompel', 'Herbert', ''], ['Lagoze', 'Carl', ''], ['Nelson', 'Michael L.', ''], ['Warner', 'Simeon', ''], ['Sanderson', 'Robert', ''], ['Johnston', 'Pete', '']]","['Cyberinfrastructure', 'eScience', 'OAI-ORE', 'Web Architecture', 'Linked Data', 'RDF', 'Atom']"
17334,1007.3961,Pablo Chico de Guzman Huerta,"Pablo Chico de Guzman, Manuel Carro and David S. Warren","Swapping Evaluation: A Memory-Scalable Solution for Answer-On-Demand
  Tabling","16 pages, 5 figures, published in TPLP 2010","Swapping Evaluation in TPLP, volume 10, number 4-6, year 2010,
  pages 401-416",,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the differences among the various approaches to suspension-based
tabled evaluation is the scheduling strategy. The two most popular strategies
are local and batched evaluation.
  The former collects all the solutions to a tabled predicate before making any
one of them available outside the tabled computation. The latter returns
answers one by one before computing them all, which in principle is better if
only one answer (or a subset of the answers) is desired.
  Batched evaluation is closer to SLD evaluation in that it computes solutions
lazily as they are demanded, but it may need arbitrarily more memory than local
evaluation, which is able to reclaim memory sooner. Some programs which in
practice can be executed under the local strategy quickly run out of memory
under batched evaluation. This has led to the general adoption of local
evaluation at the expense of the more depth-first batched strategy.
  In this paper we study the reasons for the high memory consumption of batched
evaluation and propose a new scheduling strategy which we have termed swapping
evaluation. Swapping evaluation also returns answers one by one before
completing a tabled call, but its memory usage can be orders of magnitude less
than batched evaluation. An experimental implementation in the XSB system shows
that swapping evaluation is a feasible memory-scalable strategy that need not
compromise execution speed.
","[{'version': 'v1', 'created': 'Thu, 22 Jul 2010 18:26:48 GMT'}]",2010-07-23,"[['de Guzman', 'Pablo Chico', ''], ['Carro', 'Manuel', ''], ['Warren', 'David S.', '']]","['Logic Programming', 'Tabling', 'Implementation', 'On-Demand Answers', 'Performance']"
17335,1206.1450,Debalina Ghosh,"Debalina Ghosh, Depanwita Sarkar Debnath, Saikat Bose","A comparative study of performance of fpga based mel filter bank & bark
  filter bank","16 pages, 20 figures, 6 tables; International Journal of Artificial
  Intelligence & Applications (IJAIA), Vol.3, No.3, May 2012",,,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The sensitivity of human ear is dependent on frequency which is nonlinearly
resolved across the audio spectrum .Now to improve the recognition performance
in a similar non linear approach requires a front -end design, suggested by
empirical evidences. A popular alternative to linear prediction based analysis
is therefore filter bank analysis since this provides a much more
straightforward route to obtain the desired non-linear frequency resolution.
MEL filter bank and BARK filter bank are two popular filter bank analysis
techniques. This paper presents FPGA based implementation of MEL filter bank
and BARK filter bank with different bandwidths and different signal spectrum
ranges. The designs have been implemented using VHDL, simulated and verified
using Xilinx 11.1.For each filter bank, the basic building block is implemented
in Spartan 3E. A comparative study among these two mentioned filter banks is
also done in this paper.
","[{'version': 'v1', 'created': 'Thu, 7 Jun 2012 11:08:25 GMT'}]",2012-06-08,"[['Ghosh', 'Debalina', ''], ['Debnath', 'Depanwita Sarkar', ''], ['Bose', 'Saikat', '']]","['BARK filter', 'MEL filter', 'Bartlett Window', 'Hamming Window', 'filter bank', 'FPGA', 'VHDL']"
17336,1704.05647,Eric Verheul,Eric R. Verheul,Remote Document Encryption - encrypting data for e-passport holders,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show how any party can encrypt data for an e-passport holder such that
only with physical possession of the e-passport decryption is possible. The
same is possible for electronic identity cards and driver licenses. We also
indicate possible applications. Dutch passports allow for 160 bit security,
theoretically giving sufficient security beyond the year 2079, exceeding
current good practice of 128 bit security. We also introduce the notion of RDE
Extraction PIN which effectively provides the same security as a regular PIN.
Our results ironically suggest that carrying a passport when traveling abroad
might violate export or import laws on strong cryptography.
","[{'version': 'v1', 'created': 'Wed, 19 Apr 2017 08:33:49 GMT'}, {'version': 'v2', 'created': 'Sat, 22 Apr 2017 12:11:47 GMT'}, {'version': 'v3', 'created': 'Fri, 9 Jun 2017 10:42:13 GMT'}]",2017-06-12,"[['Verheul', 'Eric R.', '']]","['e-passport', 'electronic driver license', 'encryption', 'chip authentication', 'identity card']"
17337,1701.07842,Nicholas V. Lewchenko,"Arjun Radhakrishna, Nicholas V. Lewchenko, Shawn Meier, Sergio Mover,
  Krishna Chaitanya Sripada, Damien Zufferey, Bor-Yuh Evan Chang, and Pavol
  \v{C}ern\'y",DroidStar: Callback Typestates for Android Classes,Appearing at ICSE 2018,,,,cs.LO cs.LG cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Event-driven programming frameworks, such as Android, are based on components
with asynchronous interfaces. The protocols for interacting with these
components can often be described by finite-state machines we dub *callback
typestates*. Callback typestates are akin to classical typestates, with the
difference that their outputs (callbacks) are produced asynchronously. While
useful, these specifications are not commonly available, because writing them
is difficult and error-prone.
  Our goal is to make the task of producing callback typestates significantly
easier. We present a callback typestate assistant tool, DroidStar, that
requires only limited user interaction to produce a callback typestate. Our
approach is based on an active learning algorithm, L*. We improved the
scalability of equivalence queries (a key component of L*), thus making active
learning tractable on the Android system.
  We use DroidStar to learn callback typestates for Android classes both for
cases where one is already provided by the documentation, and for cases where
the documentation is unclear. The results show that DroidStar learns callback
typestates accurately and efficiently. Moreover, in several cases, the
synthesized callback typestates uncovered surprising and undocumented
behaviors.
","[{'version': 'v1', 'created': 'Thu, 26 Jan 2017 19:06:45 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Feb 2018 23:43:09 GMT'}, {'version': 'v3', 'created': 'Fri, 2 Mar 2018 18:45:04 GMT'}]",2018-03-05,"[['Radhakrishna', 'Arjun', ''], ['Lewchenko', 'Nicholas V.', ''], ['Meier', 'Shawn', ''], ['Mover', 'Sergio', ''], ['Sripada', 'Krishna Chaitanya', ''], ['Zufferey', 'Damien', ''], ['Chang', 'Bor-Yuh Evan', ''], ['Černý', 'Pavol', '']]","['typestate', 'specification inference', 'Android', 'active learning']"
17338,1412.5077,Ridvan Sahin,R{\i}dvan \c{S}ahin and Muhammed Yi\u{g}ider,"A Multi-criteria neutrosophic group decision making metod based TOPSIS
  for supplier selection",,,,,cs.AI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The process of multiple criteria decision making (MCDM) is of determining the
best choice among all of the probable alternatives. The problem of supplier
selection on which decision maker has usually vague and imprecise knowledge is
a typical example of multi criteria group decision-making problem. The
conventional crisp techniques has not much effective for solving MCDM problems
because of imprecise or fuzziness nature of the linguistic assessments. To find
the exact values for MCDM problems is both difficult and impossible in more
cases in real world. So, it is more reasonable to consider the values of
alternatives according to the criteria as single valued neutrosophic sets
(SVNS). This paper deal with the technique for order preference by similarity
to ideal solution (TOPSIS) approach and extend the TOPSIS method to MCDM
problem with single valued neutrosophic information. The value of each
alternative and the weight of each criterion are characterized by single valued
neutrosophic numbers. Here, the importance of criteria and alternatives is
identified by aggregating individual opinions of decision makers (DMs) via
single valued neutrosophic weighted averaging (IFWA) operator. The proposed
method is, easy use, precise and practical for solving MCDM problem with single
valued neutrosophic data. Finally, to show the applicability of the developed
method, a numerical experiment for supplier choice is given as an application
of single valued neutrosophic TOPSIS method at end of this paper.
","[{'version': 'v1', 'created': 'Tue, 16 Dec 2014 18:39:06 GMT'}]",2020-01-01,"[['Şahin', 'Rıdvan', ''], ['Yiğider', 'Muhammed', '']]","['Neutrosophic sets', 'single valued neutrosophic sets', 'TOPSIS method', 'multi-criteria decision making', 'distance measure']"
17339,1511.01974,Xu Chen,"Xu Chen, Han Zhang, Judith Gelernter",Multi-lingual Geoparsing based on Machine Translation,"7 pages, 4 figures,",,,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our method for multi-lingual geoparsing uses monolingual tools and resources
along with machine translation and alignment to return location words in many
languages. Not only does our method save the time and cost of developing
geoparsers for each language separately, but also it allows the possibility of
a wide range of language capabilities within a single interface. We evaluated
our method in our LanguageBridge prototype on location named entities using
newswire, broadcast news and telephone conversations in English, Arabic and
Chinese data from the Linguistic Data Consortium (LDC). Our results for
geoparsing Chinese and Arabic text using our multi-lingual geoparsing method
are comparable to our results for geoparsing English text with our English
tools. Furthermore, experiments using our machine translation approach results
in accuracy comparable to results from the same data that was translated
manually.
","[{'version': 'v1', 'created': 'Fri, 6 Nov 2015 03:07:20 GMT'}]",2015-11-09,"[['Chen', 'Xu', ''], ['Zhang', 'Han', ''], ['Gelernter', 'Judith', '']]","['Named Entity Recognition (NER)', 'Location', 'Geoparser', 'Machine Translation', 'Word Alignment']"
17340,1303.5929,Sourish Dasgupta,"Sourish Dasgupta, Ankur Padia, Kushal Shah, Rupali KaPatel, Prasenjit
  Majumder",DLOLIS-A: Description Logic based Text Ontology Learning,11 pages,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ontology Learning has been the subject of intensive study for the past
decade. Researchers in this field have been motivated by the possibility of
automatically building a knowledge base on top of text documents so as to
support reasoning based knowledge extraction. While most works in this field
have been primarily statistical (known as light-weight Ontology Learning) not
much attempt has been made in axiomatic Ontology Learning (called heavy-weight
Ontology Learning) from Natural Language text documents. Heavy-weight Ontology
Learning supports more precise formal logic-based reasoning when compared to
statistical ontology learning. In this paper we have proposed a sound Ontology
Learning tool DLOL_(IS-A) that maps English language IS-A sentences into their
equivalent Description Logic (DL) expressions in order to automatically
generate a consistent pair of T-box and A-box thereby forming both regular
(definitional form) and generalized (axiomatic form) DL ontology. The current
scope of the paper is strictly limited to IS-A sentences that exclude the
possible structures of: (i) implicative IS-A sentences, and (ii) ""Wh"" IS-A
questions. Other linguistic nuances that arise out of pragmatics and epistemic
of IS-A sentences are beyond the scope of this present work. We have adopted
Gold Standard based Ontology Learning evaluation on chosen IS-A rich Wikipedia
documents.
","[{'version': 'v1', 'created': 'Sun, 24 Mar 2013 08:39:18 GMT'}]",2013-03-26,"[['Dasgupta', 'Sourish', ''], ['Padia', 'Ankur', ''], ['Shah', 'Kushal', ''], ['KaPatel', 'Rupali', ''], ['Majumder', 'Prasenjit', '']]","['Heavy-weight Ontology Learning', 'NL Understanding', 'Description Logics', 'Semantic Web']"
17341,1502.05275,Stefano Bilotta,"Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani",Cross-bifix-free sets in two dimensions,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A bidimensional bifix (in short bibifix) of a square matrix T is a square
submatrix of T which occurs in the top-left and bottom-right corners of T. This
allows us to extend the definition of bifix-free words and cross-bifix-free set
of words to bidimensional structures. In this paper we exhaustively generate
all the bibifix-free square matrices and we construct a particular
non-expandable cross-bibifix-free set of square matrices. Moreover, we provide
a Gray code for listing this set.
","[{'version': 'v1', 'created': 'Wed, 18 Feb 2015 15:33:43 GMT'}]",2015-02-19,"[['Barcucci', 'Elena', ''], ['Bernini', 'Antonio', ''], ['Bilotta', 'Stefano', ''], ['Pinzani', 'Renzo', '']]","['Bidimensional code', 'Exhaustive generation', 'Gray code']"
17342,1306.4635,Mark Levin,Mark Sh. Levin,Towards Multistage Design of Modular Systems,"13 pages, 25 figures, 14 tables",,,,cs.AI cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper describes multistage design of composite (modular) systems (i.e.,
design of a system trajectory). This design process consists of the following:
(i) definition of a set of time/logical points; (ii) modular design of the
system for each time/logical point (e.g., on the basis of combinatorial
synthesis as hierarchical morphological design or multiple choice problem) to
obtain several system solutions; (iii) selection of the system solution for
each time/logical point while taking into account their quality and the quality
of compatibility between neighbor selected system solutions (here,
combinatorial synthesis is used as well). Mainly, the examined time/logical
points are based on a time chain. In addition, two complicated cases are
considered: (a) the examined logical points are based on a tree-like structure,
(b) the examined logical points are based on a digraph. Numerical examples
illustrate the approach.
","[{'version': 'v1', 'created': 'Wed, 19 Jun 2013 18:07:54 GMT'}]",2013-06-20,"[['Levin', 'Mark Sh.', '']]","['modular systems', 'systems design', 'engineering frameworks', 'combinatorial synthesis', 'heuristics']"
17343,1409.4575,Shubao Zhang,Shubao Zhang and Hui Qian and Xiaojin Gong and Jianying Zhou,Stable Cosparse Recovery via \ell_p-analysis Optimization,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we study the $\ell_p$-analysis optimization ($0<p\leq1$)
problem for cosparse signal recovery. We establish a bound for recovery error
via the restricted $p$-isometry property over any subspace. We further prove
that the nonconvex $\ell_q$-analysis optimization can do recovery with a lower
sample complexity and in a wider range of cosparsity than its convex
counterpart. In addition, we develop an iteratively reweighted method to solve
the optimization problem under a variational framework. Empirical results of
preliminary computational experiments illustrate that the nonconvex method
outperforms its convex counterpart.
","[{'version': 'v1', 'created': 'Tue, 16 Sep 2014 10:48:56 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Jan 2016 09:03:59 GMT'}, {'version': 'v3', 'created': 'Mon, 10 Oct 2016 13:47:44 GMT'}, {'version': 'v4', 'created': 'Wed, 22 Aug 2018 01:22:15 GMT'}]",2018-08-28,"[['Zhang', 'Shubao', ''], ['Qian', 'Hui', ''], ['Gong', 'Xiaojin', ''], ['Zhou', 'Jianying', '']]","['Cosparsity', 'ℓq-analysis minimization', 'Medical Signal Process']"
17344,1205.3554,Manoj Prabhakaran,"Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran",Limits of Random Oracles in Secure Computation,,,,,cs.CR cs.CC,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The seminal result of Impagliazzo and Rudich (STOC 1989) gave a black-box
separation between one-way functions and public-key encryption: informally, a
public-key encryption scheme cannot be constructed using one-way functions as
the sole source of computational hardness. In addition, this implied a
black-box separation between one-way functions and protocols for certain Secure
Function Evaluation (SFE) functionalities (in particular, Oblivious Transfer).
Surprisingly, however, {\em since then there has been no further progress in
separating one-way functions and SFE functionalities} (though several other
black-box separation results were shown). In this work, we present the complete
picture for deterministic 2-party SFE functionalities. We show that one-way
functions are black-box separated from {\em all such SFE functionalities},
except the ones which have unconditionally secure protocols (and hence do not
rely on any computational hardness), when secure computation against
semi-honest adversaries is considered. In the case of security against active
adversaries, a black-box one-way function is indeed useful for SFE, but we show
that it is useful only as much as access to an ideal commitment functionality
is useful.
  Technically, our main result establishes the limitations of random oracles
for secure computation.
","[{'version': 'v1', 'created': 'Wed, 16 May 2012 05:27:08 GMT'}]",2012-05-17,"[['Mahmoody', 'Mohammad', ''], ['Maji', 'Hemanta K.', ''], ['Prabhakaran', 'Manoj', '']]","['Secure Function Evaluation', 'Random Oracle Model', 'One-Way Function', 'Random Permutation Oracle', 'Ideal Ci']"
17345,1412.2675,Yilun Wang,"Yaru Fan, Yilun Wang and Tingzhu Huang",Enhanced joint sparsity via Iterative Support Detection,arXiv admin note: text overlap with arXiv:1008.4348 by other authors,,,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Joint sparsity has attracted considerable attention in recent years in many
fields including sparse signal recovery in compressed sensing (CS), statistics,
and machine learning. Traditional convex models suffer from the suboptimal
performance though enjoying tractable computation. In this paper, we propose a
new non-convex joint sparsity model, and develop a corresponding multi-stage
adaptive convex relaxation algorithm. This method extends the idea of iterative
support detection (ISD) from the single vector estimation to the multi-vector
estimation by considering the joint sparsity prior. We provide some preliminary
theoretical analysis including convergence analysis and a sufficient recovery
condition. Numerical experiments from both compressive sensing and feature
learning show the better performance of the proposed method in comparison with
several state-of-the-art alternatives. Moreover, we demonstrate that the
extension of ISD from the single vector to multi-vector estimation is not
trivial. In particular, while ISD does not work well for reconstructing the
signal channel sparse Bernoulli signal, it does achieve significantly improved
performance when recovering the multi-channel sparse Bernoulli signal thanks to
its ability of natural incorporation of the joint sparsity structure.
","[{'version': 'v1', 'created': 'Mon, 8 Dec 2014 17:42:58 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Dec 2014 19:02:25 GMT'}, {'version': 'v3', 'created': 'Tue, 20 Oct 2015 02:25:56 GMT'}, {'version': 'v4', 'created': 'Sun, 25 Jun 2017 09:42:10 GMT'}]",2017-06-27,"[['Fan', 'Yaru', ''], ['Wang', 'Yilun', ''], ['Huang', 'Tingzhu', '']]","['Iterative support detection', 'joint sparsity', 'ℓ2', '1-normminimization', 'non-convex optimization', 'compressive sensing', 'multi-taskfeature learning']"
17346,1208.0153,Mohamed Salah  Gouider Dr,Saida Aissi and Mohamed Salah Gouider,Personalization in Geographic information systems: A survey,,"IJCSI International Journal of Computer Science Issues, Vol. 9,
  Issue 4, No 3, July 2012 , pp 291-298",,,cs.IR cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Geographic Information Systems (GIS) are widely used in different domains of
applications, such as maritime navigation, museums visits and route planning,
as well as ecological, demographical and economical applications. Nowadays,
organizations need sophisticated and adapted GIS-based Decision Support System
(DSS) to get quick access to relevant information and to analyze data with
respect to geographic information, represented not only as spatial objects, but
also as maps.
  Several research works on GIS personalization was proposed: Face the great
challenge of developing both the theory and practice to provide personalization
GIS visualization systems. This paper aims to provide a comprehensive review of
literature on presented GIS personalization approaches. A benchmarking study of
GIS personalization methods is proposed. Several evaluation criteria are used
to identify the existence of trends as well as potential needs for further
investigations.
","[{'version': 'v1', 'created': 'Wed, 1 Aug 2012 09:45:07 GMT'}]",2012-08-14,"[['Aissi', 'Saida', ''], ['Gouider', 'Mohamed Salah', '']]","['GIS', 'recommendation', 'personalization', 'profile']"
17347,1603.09185,"\""Ozlem Salehi","\""Ozlem Salehi, A.C. Cem Say, Flavio D'Alessandro",Homing Vector Automata,"This is the extended version of our paper homing vector automata
  arXiv:1504.04859","RAIRO-Theoretical Informatics and Applications 50.4 (2016):
  371-386",,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce homing vector automata, which are finite automata augmented by a
vector that is multiplied at each step by a matrix determined by the current
transition, and have to return the vector to its original setting in order to
accept the input. The computational power and properties of deterministic,
nondeterministic, blind, non-blind, real-time and one-way versions of these
machines are examined and compared to various related types of automata. A
generalized version of the Stern-Brocot encoding method, suitable for
representing strings on arbitrary alphabets, is also developed.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2016 13:35:01 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Aug 2016 20:13:26 GMT'}]",2017-08-01,"[['Salehi', 'Özlem', ''], ['Say', 'A. C. Cem', ''], [""D'Alessandro"", 'Flavio', '']]","['vector automata', 'group automata', 'Stern-Brocot']"
17348,1401.3385,Val\'erio Ramos Batista,Antonio Elias Fabris and Val\'erio Ramos Batista,"A programme to determine the exact interior of any connected digital
  picture",,,,,cs.CG cs.CV cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Region filling is one of the most important and fundamental operations in
computer graphics and image processing. Many filling algorithms and their
implementations are based on the Euclidean geometry, which are then translated
into computational models moving carelessly from the continuous to the finite
discrete space of the computer. The consequences of this approach is that most
implementations fail when tested for challenging degenerate and nearly
degenerate regions. We present a correct integer-only procedure that works for
all connected digital pictures. It finds all possible interior points, which
are then displayed and stored in a locating matrix. Namely, we present a
filling and locating procedure that can be used in computer graphics and image
processing applications.
","[{'version': 'v1', 'created': 'Tue, 14 Jan 2014 23:21:58 GMT'}]",2014-01-16,"[['Fabris', 'Antonio Elias', ''], ['Batista', 'Valério Ramos', '']]","['Raster Graphics', 'Region Filling', 'Point-based Modelling', 'Discrete Jordan Curve Theorem']"
17349,1511.02494,Athena Elafrou,"Athena Elafrou, Georgios Goumas, Nectarios Koziris","A lightweight optimization selection method for Sparse Matrix-Vector
  Multiplication",10 pages,,,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose an optimization selection methodology for the
ubiquitous sparse matrix-vector multiplication (SpMV) kernel. We propose two
models that attempt to identify the major performance bottleneck of the kernel
for every instance of the problem and then select an appropriate optimization
to tackle it. Our first model requires online profiling of the input matrix in
order to detect its most prevailing performance issue, while our second model
only uses comprehensive structural features of the sparse matrix. Our method
delivers high performance stability for SpMV across different platforms and
sparse matrices, due to its application and architecture awareness. Our
experimental results demonstrate that a) our approach is able to distinguish
and appropriately optimize special matrices in multicore platforms that fall
out of the standard class of memory bandwidth bound matrices, and b) lead to a
significant performance gain of 29% in a manycore platform compared to an
architecture-centric optimization, as a result of the successful selection of
the appropriate optimization for the great majority of the matrices. With a
runtime overhead equivalent to a couple dozen SpMV operations, our approach is
practical for use in iterative numerical solvers of real-life applications.
","[{'version': 'v1', 'created': 'Sun, 8 Nov 2015 15:06:10 GMT'}, {'version': 'v2', 'created': 'Sun, 22 Nov 2015 19:44:35 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Jan 2016 02:20:27 GMT'}]",2016-01-12,"[['Elafrou', 'Athena', ''], ['Goumas', 'Georgios', ''], ['Koziris', 'Nectarios', '']]","['Sparse Matrices', 'Sparse Matrix-Vector Multiplication', 'Machine Learning', 'SpMV']"
17350,2007.05186,Xuan Shan,"Xuan Shan, Chuanjie Liu, Yiqian Xia, Qi Chen, Yusi Zhang, Kaize Ding,
  Yaobo Liang, Angen Luo, Yuxiang Luo",GLOW : Global Weighted Self-Attention Network for Web Search,"8pages,2figures",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep matching models aim to facilitate search engines retrieving more
relevant documents by mapping queries and documents into semantic vectors in
the first-stage retrieval. When leveraging BERT as the deep matching model, the
attention score across two words are solely built upon local contextualized
word embeddings. It lacks prior global knowledge to distinguish the importance
of different words, which has been proved to play a critical role in
information retrieval tasks. In addition to this, BERT only performs attention
across sub-words tokens which weakens whole word attention representation. We
propose a novel Global Weighted Self-Attention (GLOW) network for web document
search. GLOW fuses global corpus statistics into the deep matching model. By
adding prior weights into attention generation from global information, like
BM25, GLOW successfully learns weighted attention scores jointly with query
matrix $Q$ and key matrix $K$. We also present an efficient whole word weight
sharing solution to bring prior whole word knowledge into sub-words level
attention. It aids Transformer to learn whole word level attention. To make our
models applicable to complicated web search scenarios, we introduce combined
fields representation to accommodate documents with multiple fields even with
variable number of instances. We demonstrate GLOW is more efficient to capture
the topical and semantic representation both in queries and documents.
Intrinsic evaluation and experiments conducted on public data sets reveal GLOW
to be a general framework for document retrieve task. It significantly
outperforms BERT and other competitive baselines by a large margin while
retaining the same model complexity with BERT.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 06:18:07 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Apr 2021 16:21:30 GMT'}, {'version': 'v3', 'created': 'Mon, 24 May 2021 03:02:50 GMT'}]",2021-05-25,"[['Shan', 'Xuan', ''], ['Liu', 'Chuanjie', ''], ['Xia', 'Yiqian', ''], ['Chen', 'Qi', ''], ['Zhang', 'Yusi', ''], ['Ding', 'Kaize', ''], ['Liang', 'Yaobo', ''], ['Luo', 'Angen', ''], ['Luo', 'Yuxiang', '']]","['Web search', 'transformer models', 'global weight representation', 'deepmatching models']"
17351,1212.2546,Jonathan Masci,"Jonathan Masci and Jes\'us Angulo and J\""urgen Schmidhuber","A Learning Framework for Morphological Operators using Counter-Harmonic
  Mean",Submitted to ISMM'13,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a novel framework for learning morphological operators using
counter-harmonic mean. It combines concepts from morphology and convolutional
neural networks. A thorough experimental validation analyzes basic
morphological operators dilation and erosion, opening and closing, as well as
the much more complex top-hat transform, for which we report a real-world
application from the steel industry. Using online learning and stochastic
gradient descent, our system learns both the structuring element and the
composition of operators. It scales well to large datasets and online settings.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2012 17:29:04 GMT'}]",2012-12-12,"[['Masci', 'Jonathan', ''], ['Angulo', 'Jesús', ''], ['Schmidhuber', 'Jürgen', '']]","['mathematical morphology', 'convolutional networks', 'onlinelearning', 'machine learning']"
17352,1207.6051,Mark Levin,Mark Sh. Levin,Composition of Modular Telemetry System with Interval Multiset Estimates,"9 pages, 9 figures, 6 tables",,,,cs.SY cs.AI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper describes combinatorial synthesis approach with interval multset
estimates of system elements for modeling, analysis, design, and improvement of
a modular telemetry system. Morphological (modular) system design and
improvement are considered as composition of the telemetry system elements
(components) configuration. The solving process is based on Hierarchical
Morphological Multicriteria Design (HMMD): (i) multicriteria selection of
alternatives for system components, (ii) synthesis of the selected alternatives
into a resultant combination (while taking into account quality of the
alternatives above and their compatibility). Interval multiset estimates are
used for assessment of design alternatives for telemetry system elements. Two
additional systems problems are examined: (a) improvement of the obtained
solutions, (b) aggregation of the obtained solutions into a resultant system
configuration. The improvement and aggregation processes are based on multiple
choice problem with interval multiset estimates. Numerical examples for an
on-board telemetry subsystem illustrate the design and improvement processes.
","[{'version': 'v1', 'created': 'Wed, 25 Jul 2012 16:51:45 GMT'}]",2012-07-26,"[['Levin', 'Mark Sh.', '']]","['modular system', 'composition', 'telemetry', 'combinatorial optimization', 'heuristics', 'multiset']"
17353,1401.1903,Young-Chul Shim,Young-Chul Shim,"Distributed Cloud Computing Environment Enhanced with Capabilities for
  Wide-Area Migration and Replication of Virtual Machines",13 pages,"International Journal of Computer Science & Information
  Technology, Vol. 5, No. 6, December 2013",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When a network application is implmented as a virtual machine on a cloud and
is used by a large number of users, the location of the virtual machine should
be selected carefully so that the response time experienced by users is
minimized. As the user population moves and/or increases, the virtual machine
may need to be migrated to a new location or replicated on many locations over
a wide-area network. Virtual machine migration and replication have been
studied extensively but in most cases are limited within a subnetwork to be
able to maintain service continuity. In this paper we introduce a distributed
cloud computing environment which facilitates the migration and replication of
a virtual machine over a wide area network. The mechanism is provided by an
overlay network of smart routers, each of which connects a cooperating data
center to the Internet. The proposed approach is analyzed and compared with
related works
","[{'version': 'v1', 'created': 'Thu, 9 Jan 2014 06:39:15 GMT'}]",2014-01-10,"[['Shim', 'Young-Chul', '']]","['Cloud Computing', 'Virtual Machine', 'Wide-Area Network', 'Migration', 'Replication']"
17354,0709.2225,Ananthanarayanan Chockalingam,"T. Srikanth, K. Vishnu Vardhan, A. Chockalingam, and L. B. Milstein",Improved Linear Parallel Interference Cancellers,Accepted in IEEE Trans. on Wireless Communications,,,,cs.IT cs.SC cs.SD cs.SE math.IT,,"  In this paper, taking the view that a linear parallel interference canceller
(LPIC) can be seen as a linear matrix filter, we propose new linear matrix
filters that can result in improved bit error performance compared to other
LPICs in the literature. The motivation for the proposed filters arises from
the possibility of avoiding the generation of certain interference and noise
terms in a given stage that would have been present in a conventional LPIC
(CLPIC). In the proposed filters, we achieve such avoidance of the generation
of interference and noise terms in a given stage by simply making the diagonal
elements of a certain matrix in that stage equal to zero. Hence, the proposed
filters do not require additional complexity compared to the CLPIC, and they
can allow achieving a certain error performance using fewer LPIC stages. We
also extend the proposed matrix filter solutions to a multicarrier DS-CDMA
system, where we consider two types of receivers. In one receiver (referred to
as Type-I receiver), LPIC is performed on each subcarrier first, followed by
multicarrier combining (MCC). In the other receiver (called Type-II receiver),
MCC is performed first, followed by LPIC. We show that in both Type-I and
Type-II receivers, the proposed matrix filters outperform other matrix filters.
Also, Type-II receiver performs better than Type-I receiver because of enhanced
accuracy of the interference estimates achieved due to frequency diversity
offered by MCC.
","[{'version': 'v1', 'created': 'Fri, 14 Sep 2007 07:56:21 GMT'}]",2007-09-17,"[['Srikanth', 'T.', ''], ['Vardhan', 'K. Vishnu', ''], ['Chockalingam', 'A.', ''], ['Milstein', 'L. B.', '']]","['Linear parallel interference cancellation', 'linear matrix filters', 'decorrelating detector', 'MMSE']"
17355,1702.00108,Yusaku Yamamoto Dr.,Yusaku Yamamoto,"On the optimality and sharpness of Laguerre's lower bound on the
  smallest eigenvalue of a symmetric positive definite matrix","13 pages, 4 figures",,,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lower bounds on the smallest eigenvalue of a symmetric positive definite
matrices $A\in\mathbb{R}^{m\times m}$ play an important role in condition
number estimation and in iterative methods for singular value computation. In
particular, the bounds based on ${\rm Tr}(A^{-1})$ and ${\rm Tr}(A^{-2})$
attract attention recently because they can be computed in $O(m)$ work when $A$
is tridiagonal. In this paper, we focus on these bounds and investigate their
properties in detail. First, we consider the problem of finding the optimal
bound that can be computed solely from ${\rm Tr}(A^{-1})$ and ${\rm
Tr}(A^{-2})$ and show that so called Laguerre's lower bound is the optimal one
in terms of sharpness. Next, we study the gap between the Laguerre bound and
the smallest eigenvalue. We characterize the situation in which the gap becomes
largest in terms of the eigenvalue distribution of $A$ and show that the gap
becomes smallest when ${\rm Tr}(A^{-2})/\{{\rm Tr}(A^{-1})\}^2$ approaches 1 or
$\frac{1}{m}$. These results will be useful, for example, in designing
efficient shift strategies for singular value computation algorithms.
","[{'version': 'v1', 'created': 'Wed, 1 Feb 2017 03:00:08 GMT'}]",2017-02-02,"[['Yamamoto', 'Yusaku', '']]","['eigenvalue bounds', 'symmetric positive definite matrix', 'Laguerre bound', 'singular value computation', 'dqds algorithm']"
17356,1209.4523,Egor Samosvat,"Damien Lefortier, Liudmila Ostroumova and Egor Samosvat",Evolution of the Media Web,,,,,cs.IR cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a detailed study of the part of the Web related to media content,
i.e., the Media Web. Using publicly available data, we analyze the evolution of
incoming and outgoing links from and to media pages. Based on our observations,
we propose a new class of models for the appearance of new media content on the
Web where different \textit{attractiveness} functions of nodes are possible
including ones taken from well-known preferential attachment and fitness
models. We analyze these models theoretically and empirically and show which
ones realistically predict both the incoming degree distribution and the
so-called \textit{recency property} of the Media Web, something that existing
models did not do well. Finally we compare these models by estimating the
likelihood of the real-world link graph from our data set given each model and
obtain that models we introduce are significantly more likely than previously
proposed ones. One of the most surprising results is that in the Media Web the
probability for a post to be cited is determined, most likely, by its quality
rather than by its current popularity.
","[{'version': 'v1', 'created': 'Thu, 20 Sep 2012 13:18:00 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Aug 2013 14:38:37 GMT'}]",2013-08-02,"[['Lefortier', 'Damien', ''], ['Ostroumova', 'Liudmila', ''], ['Samosvat', 'Egor', '']]","['Media Web', 'random graph models', 'recency']"
17357,1306.0497,Givon Zirkind,Givon Zirkind,"One Time Pad Password Protection: Using T.E.C. Steganography and Secure
  Password Transmission Protocols",Draft for CAESER 2014 submission,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A while ago, I developed what I called an encryption method. The most
favorable of reviews did not see a method but a collection of techniques. Be
that as it may, the process used, is described in the paper, Windtalking
Computers. This paper is about the steganographic method described, the
cryptanalysis efforts of that method and; a real world application of that
method as an answer to the increasing problem of password file hacking. The
premise is that the technique is a variant of one time pad, using a novel way
to produce one time pad output for digital input. There is no record in the
literature of such a method being used for encryption at all. Digital
encryption generally treats the letters of the plaintext as a binary number and
does some mathematical computation to produce ciphertext. The idea of inserting
bits with a random generated key is new. Therefore (because a uniquely random
generated key is used), the encryption is cryptanalytically unbreakable and/or
computationally secure and/or information theoretic. An academic version was
made. Challenges for decryption have not produced to-date a decryption.
Advantages and disadvantages of the method are discussed.
  Hackers are constantly penetrating networks and stealing password files.
Which, once in possession of a password file, hackers individually or
collectively with distributed processing over the Internet, decrypt the values
of the hash passwords. Thereby gaining access to systems. This problem has
become sufficiently significant for CAESAR (Competition for Authenticated
Encryption: Security, Applicability, and Robustness) to make calls for papers
for solutions. Herein is one proposed solution. While one time pad presents a
problem being computationally intensive, for the relatively short length of
passwords, the cost of computation may be cost effective for the security
provided.
","[{'version': 'v1', 'created': 'Tue, 14 May 2013 22:02:02 GMT'}]",2013-06-04,"[['Zirkind', 'Givon', '']]","['Binary  Coding', 'Binary  Encryption', 'Data  Encryption', 'Decryption', 'Encryption', 'Fibonacci', 'Fibonacci Representation', 'Secret Encryption']"
17358,1704.05594,Ahmed Attia,Ahmed Attia and Adrian Sandu,DATeS: A Highly-Extensible Data Assimilation Testing Suite v1.0,,,,CSTR-5/2017,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A flexible and highly-extensible data assimilation testing suite, named
DATeS, is described in this paper. DATeS aims to offer a unified testing
environment that allows researchers to compare different data assimilation
methodologies and understand their performance in various settings. The core of
DATeS is implemented in Python and takes advantage of its object-oriented
capabilities. The main components of the package (the numerical models, the
data assimilation algorithms, the linear algebra solvers, and the time
discretization routines) are independent of each other, which offers great
flexibility to configure data assimilation applications. DATeS can interface
easily with large third-party numerical models written in Fortran or in C, and
with a plethora of external solvers.
","[{'version': 'v1', 'created': 'Wed, 19 Apr 2017 02:58:23 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Jul 2018 03:06:51 GMT'}]",2018-07-03,"[['Attia', 'Ahmed', ''], ['Sandu', 'Adrian', '']]","['Data assimilation', 'object-oriented programming', 'problem solving environment', 'Markov chain', 'Monte-Carlo methods']"
17359,1511.00346,Ichiro Hasuo,"Ichiro Hasuo, Shunsuke Shimizu, Corina Cirstea","Lattice-Theoretic Progress Measures and Coalgebraic Model Checking (with
  Appendices)","24 pages, Extended version with appendices of a paper accepted to
  POPL 2016",,,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the context of formal verification in general and model checking in
particular, parity games serve as a mighty vehicle: many problems are encoded
as parity games, which are then solved by the seminal algorithm by Jurdzinski.
In this paper we identify the essence of this workflow to be the notion of
progress measure, and formalize it in general, possibly infinitary,
lattice-theoretic terms. Our view on progress measures is that they are to
nested/alternating fixed points what invariants are to safety/greatest fixed
points, and what ranking functions are to liveness/least fixed points. That is,
progress measures are combination of the latter two notions (invariant and
ranking function) that have been extensively studied in the context of
(program) verification.
  We then apply our theory of progress measures to a general model-checking
framework, where systems are categorically presented as coalgebras. The
framework's theoretical robustness is witnessed by a smooth transfer from the
branching-time setting to the linear-time one. Although the framework can be
used to derive some decision procedures for finite settings, we also expect the
proposed framework to form a basis for sound proof methods for some
undecidable/infinitary problems.
","[{'version': 'v1', 'created': 'Mon, 2 Nov 2015 00:53:41 GMT'}, {'version': 'v2', 'created': 'Mon, 9 Nov 2015 09:22:36 GMT'}, {'version': 'v3', 'created': 'Sat, 9 Jan 2016 08:11:59 GMT'}]",2016-01-12,"[['Hasuo', 'Ichiro', ''], ['Shimizu', 'Shunsuke', ''], ['Cirstea', 'Corina', '']]","['fixed-point logic', 'model checking', 'coalgebra']"
17360,1107.1956,Gopalakrishnan Tr Nair,"Dr T.R. Gopalakrishnan Nair, Meenakshi Malhotra","Informledge System: A Modified Knowledge Network with Autonomous Nodes
  using Multi-lateral Links","4 pages, 5 figures, International Conference on Knowledge Engineering
  and Ontology Development, KEOD 2010, Proceeding of KEOD-2010, pp 351-354,
  Valencia-Spain, October 2010",,,,cs.IR cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Research in the field of Artificial Intelligence is continually progressing
to simulate the human knowledge into automated intelligent knowledge base,
which can encode and retrieve knowledge efficiently along with the capability
of being is consistent and scalable at all times. However, there is no system
at hand that can match the diversified abilities of human knowledge base. In
this position paper, we put forward a theoretical model of a different system
that intends to integrate pieces of knowledge, Informledge System (ILS). ILS
would encode the knowledge, by virtue of knowledge units linked across
diversified domains. The proposed ILS comprises of autonomous knowledge units
termed as Knowledge Network Node (KNN), which would help in efficient
cross-linking of knowledge units to encode fresh knowledge. These links are
reasoned and inferred by the Parser and Link Manager, which are part of KNN.
","[{'version': 'v1', 'created': 'Mon, 11 Jul 2011 07:54:51 GMT'}]",2011-07-12,"[['Nair', 'Dr T. R. Gopalakrishnan', ''], ['Malhotra', 'Meenakshi', '']]","['Informledge System (ILS)', 'Knowledge Network Node (KNN)', 'Multi-lateral links', 'Link Manager']"
17361,1303.6091,Anna Zygmunt,"Jaros{\l}aw Ko\'zlak, Anna Zygmunt",Agent-based modelling of social organisations,"International Conference on Complex, Intelligent and Software
  Intensive Systems, CISIS 2011, June 30 - July 2, 2011, Korean Bible
  University, Seoul, Korea, pp. 467-472","IEEE Computer Society, 2011",,,cs.SI cs.MA physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the paper, the model of the society represented by a social network and
the model of a multi-agent system built on the basis of this, is presented. The
particular aim of the system is to predict the evolution of a society and an
analysis of the communities that appear, their characteristic features and
reasons for coming into being. As an example of application, an analysis was
made of a social portal which makes it possible to offer and reserve places in
rooms for travelling tourists
","[{'version': 'v1', 'created': 'Mon, 25 Mar 2013 11:17:29 GMT'}]",2016-10-05,"[['Koźlak', 'Jarosław', ''], ['Zygmunt', 'Anna', '']]","['social organisation', 'social network analysis', 'agentbased simulations']"
17362,1705.08865,Galina Lavrentyeva,"Galina Lavrentyeva, Sergey Novoselov and Konstantin Simonchik",Anti-spoofing Methods for Automatic SpeakerVerification System,"12 pages, 0 figures, published in Springer Communications in Computer
  and Information Science (CCIS) vol. 661",,,,cs.SD cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Growing interest in automatic speaker verification (ASV)systems has lead to
significant quality improvement of spoofing attackson them. Many research works
confirm that despite the low equal er-ror rate (EER) ASV systems are still
vulnerable to spoofing attacks. Inthis work we overview different acoustic
feature spaces and classifiersto determine reliable and robust countermeasures
against spoofing at-tacks. We compared several spoofing detection systems,
presented so far,on the development and evaluation datasets of the Automatic
SpeakerVerification Spoofing and Countermeasures (ASVspoof) Challenge
2015.Experimental results presented in this paper demonstrate that the useof
magnitude and phase information combination provides a substantialinput into
the efficiency of the spoofing detection systems. Also wavelet-based features
show impressive results in terms of equal error rate. Inour overview we compare
spoofing performance for systems based on dif-ferent classifiers. Comparison
results demonstrate that the linear SVMclassifier outperforms the conventional
GMM approach. However, manyresearchers inspired by the great success of deep
neural networks (DNN)approaches in the automatic speech recognition, applied
DNN in thespoofing detection task and obtained quite low EER for known and
un-known type of spoofing attacks.
","[{'version': 'v1', 'created': 'Wed, 24 May 2017 16:58:03 GMT'}]",2017-05-25,"[['Lavrentyeva', 'Galina', ''], ['Novoselov', 'Sergey', ''], ['Simonchik', 'Konstantin', '']]","['spoofing', 'anti-spoofing', 'spoofing detection', 'speaker verification']"
17363,0907.0611,Serge Tichkiewitch,"S. Butdee (KMRC), Chaiwat Noomtong (LGS), Serge Tichkiewitch (LGS)","A process planning system with feature based neural network search
  strategy for aluminum extrusion die manufacturing",,"Asian International Journal of Science and Technology in
  Production and Manufacturing Engineering 2, 1 (2009) 137-157",,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aluminum extrusion die manufacturing is a critical task for productive
improvement and increasing potential of competition in aluminum extrusion
industry. It causes to meet the efficiency not only consistent quality but also
time and production cost reduction. Die manufacturing consists first of die
design and process planning in order to make a die for extruding the customer's
requirement products. The efficiency of die design and process planning are
based on the knowledge and experience of die design and die manufacturer
experts. This knowledge has been formulated into a computer system called the
knowledge-based system. It can be reused to support a new die design and
process planning. Such knowledge can be extracted directly from die geometry
which is composed of die features. These features are stored in die feature
library to be prepared for producing a new die manufacturing. Die geometry is
defined according to the characteristics of the profile so we can reuse die
features from the previous similar profile design cases. This paper presents
the CaseXpert Process Planning System for die manufacturing based on feature
based neural network technique. Die manufacturing cases in the case library
would be retrieved with searching and learning method by neural network for
reusing or revising it to build a die design and process planning when a new
case is similar with the previous die manufacturing cases. The results of the
system are dies design and machining process. The system has been successfully
tested, it has been proved that the system can reduce planning time and respond
high consistent plans.
","[{'version': 'v1', 'created': 'Fri, 3 Jul 2009 12:08:13 GMT'}]",2009-07-06,"[['Butdee', 'S.', '', 'KMRC'], ['Noomtong', 'Chaiwat', '', 'LGS'], ['Tichkiewitch', 'Serge', '', 'LGS']]","['Process Planning', 'Feature-Based Neural Network', 'Aluminum Extrusion Die Manufacturing']"
17364,1712.03049,Gadi Pinkas,Gadi Pinkas and Shimon Cohen,Artificial Neural Networks that Learn to Satisfy Logic Constraints,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Logic-based problems such as planning, theorem proving, or puzzles, typically
involve combinatoric search and structured knowledge representation. Artificial
neural networks are very successful statistical learners, however, for many
years, they have been criticized for their weaknesses in representing and in
processing complex structured knowledge which is crucial for combinatoric
search and symbol manipulation. Two neural architectures are presented, which
can encode structured relational knowledge in neural activation, and store
bounded First Order Logic constraints in connection weights. Both architectures
learn to search for a solution that satisfies the constraints. Learning is done
by unsupervised practicing on problem instances from the same domain, in a way
that improves the network-solving speed. No teacher exists to provide answers
for the problem instances of the training and test sets. However, the domain
constraints are provided as prior knowledge to a loss function that measures
the degree of constraint violations. Iterations of activation calculation and
learning are executed until a solution that maximally satisfies the constraints
emerges on the output units. As a test case, block-world planning problems are
used to train networks that learn to plan in that domain, but the techniques
proposed could be used more generally as in integrating prior symbolic
knowledge with statistical learning
","[{'version': 'v1', 'created': 'Fri, 8 Dec 2017 13:12:04 GMT'}]",2017-12-11,"[['Pinkas', 'Gadi', ''], ['Cohen', 'Shimon', '']]","['artificial neural networks', 'planning', 'constraint satisfaction', 'unsupervised']"
17365,1109.6181,J\'er\^ome Javelle,"Sylvain Gravier, J\'er\^ome Javelle, Mehdi Mhalla, Simon Perdrix",Optimal accessing and non-accessing structures for graph protocols,,,,,cs.CC math.CO quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An accessing set in a graph is a subset B of vertices such that there exists
D subset of B, such that each vertex of V\B has an even number of neighbors in
D. In this paper, we introduce new bounds on the minimal size kappa'(G) of an
accessing set, and on the maximal size kappa(G) of a non-accessing set of a
graph G. We show strong connections with perfect codes and give explicitly
kappa(G) and kappa'(G) for several families of graphs. Finally, we show that
the corresponding decision problems are NP-Complete.
","[{'version': 'v1', 'created': 'Wed, 28 Sep 2011 12:12:43 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Oct 2011 07:05:58 GMT'}]",2011-10-05,"[['Gravier', 'Sylvain', ''], ['Javelle', 'Jérôme', ''], ['Mhalla', 'Mehdi', ''], ['Perdrix', 'Simon', '']]","['Complexity', 'Graph Theory', 'NP-Completeness']"
17366,1212.6643,Photios Stavrou,Photios A. Stavrou and Charalambos D. Charalambous,"Nonanticipative Rate Distortion Function and Filtering Theory: A weak
  Convergence Approach","26 pages and 4 figures, part of this work is published in European
  Control Conference (ECC' 13)",,,,cs.IT cs.SY math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper the relation between nonanticipative rate distortion function
(RDF) and Bayesian filtering theory is further investigated on general Polish
spaces. The relation is established via an optimization on the space of
conditional distributions of the so-called directed information subject to
fidelity constraints. Existence of the optimal reproduction distribution of the
nonanticipative RDF is shown using the topology of weak convergence of
probability measures. Subsequently, we use the solution of the nonanticipative
RDF to present the realization of a multidimensional partially observable
source over a scalar Gaussian channel. We show that linear encoders are
optimal, establishing joint source-channel coding in real-time.
","[{'version': 'v1', 'created': 'Sat, 29 Dec 2012 16:10:57 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Jan 2014 20:38:11 GMT'}]",2014-01-21,"[['Stavrou', 'Photios A.', ''], ['Charalambous', 'Charalambos D.', '']]","['Nonanticipative rate distortion function', 'realizability', 'weakconvergence', 'filtering theory', 'optimal reproduction conditional distribution']"
17367,1702.07478,Igor Tarasyuk,"Igor V. Tarasyuk, Hermenegilda Maci\`a, Valent\'in Valero","Stochastic equivalence for performance analysis of concurrent systems in
  dtsiPBC","Prepared for submission to Discrete Mathematics and Theoretical
  Computer Science",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an extension with immediate multiactions of discrete time
stochastic Petri Box Calculus (dtsPBC), presented by I.V. Tarasyuk. The
resulting algebra dtsiPBC is a discrete time analogue of stochastic Petri Box
Calculus (sPBC) with immediate multiactions, designed by H. Maci\`a, V. Valero
et al. within a continuous time domain. The step operational semantics is
constructed via labeled probabilistic transition systems. The denotational
semantics is based on labeled discrete time stochastic Petri nets with
immediate transitions. To evaluate performance, the corresponding semi-Markov
chains are analyzed. We define step stochastic bisimulation equivalence of
expressions that is applied to reduce their transition systems and underlying
semi-Markov chains while preserving the functionality and performance
characteristics. We explain how this equivalence can be used to simplify
performance analysis of the algebraic processes. In a case study, a method of
modeling, performance evaluation and behaviour reduction for concurrent systems
is outlined and applied to the shared memory system.
","[{'version': 'v1', 'created': 'Fri, 24 Feb 2017 07:07:24 GMT'}]",2017-02-27,"[['Tarasyuk', 'Igor V.', ''], ['Macià', 'Hermenegilda', ''], ['Valero', 'Valentín', '']]","['stochastic process algebra', 'Petri box calculus', 'discrete time', 'immediate multiaction', 'performance evaluation', 'stochastic equivalence']"
17368,1712.04649,Theodosios Mourouzis,"Theodosis Mourouzis, Chrysostomos Filipou",The Blockchain Revolution: Insights from Top-Management,"26 pages, 22 figures",,,,cs.CY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This is an exploration of Blockchain technology that is growing in popularity
and it seems to be able to disrupt a plethora of industries. A research is
being conducted to examine Blockchain potential to be adopted by enterprises
from different sectors as well as the parameters that could affect its
adoption. Mostly known as the technology that underpins Bitcoin, this concept
raised a significant interest within various markets. Blockchain offers a new
approach to valued information management and sharing and it is introduced as a
solution against the inefficiencies that affect the industry. Experts,
infrastructure providers and banks can now work on this technology and explore
its uses. This is a new technology journey with obstacles that will need to be
overcome and it can not be clear yet what will eventually arise. Professionals
from around the world express their views on the adoption of Blockchain by
organisations and how these plan to support its deployment. Thoughts are shared
in terms of the required budget and the parameters that can impact its
adoption. There is a great interest in Blockchain technology and its
revolutionary potential to modernize the world economy and this is only the
beginning.
","[{'version': 'v1', 'created': 'Wed, 13 Dec 2017 08:14:19 GMT'}]",2017-12-14,"[['Mourouzis', 'Theodosis', ''], ['Filipou', 'Chrysostomos', '']]","['blockchain', 'distributed-ledger technologies', 'top management', 'peer-to-peer systems']"
17369,1412.7858,Christopher Tucker Ph.D.,Christopher A. Tucker,"Models of robotic feeding, choice, and the survival mechanism",,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Diagrammatic models of feeding choices reveal fundamental robotic behaviors.
Successful choices are reinforced by positive feedback, while unsuccessful ones
by negative feedback. This paper will address robotic feeding by casually
relating consequential behavior subtended by a strong dependence upon survival.
","[{'version': 'v1', 'created': 'Thu, 25 Dec 2014 19:43:25 GMT'}]",2014-12-30,"[['Tucker', 'Christopher A.', '']]","['Robotic control architectures', 'feeding strategies', 'wireless power transfer', 'entropy']"
17370,1306.4361,Collin David Anderson,Collin Anderson,"Dimming the Internet: Detecting Throttling as a Mechanism of Censorship
  in Iran",Working Draft,,,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In the days immediately following the contested June 2009 Presidential
election, Iranians attempting to reach news content and social media platforms
were subject to unprecedented levels of the degradation, blocking and jamming
of communications channels. Rather than shut down networks, which would draw
attention and controversy, the government was rumored to have slowed connection
speeds to rates that would render the Internet nearly unusable, especially for
the consumption and distribution of multimedia content. Since, political
upheavals elsewhere have been associated with headlines such as ""High usage
slows down Internet in Bahrain"" and ""Syrian Internet slows during Friday
protests once again,"" with further rumors linking poor connectivity with
political instability in Myanmar and Tibet. For governments threatened by
public expression, the throttling of Internet connectivity appears to be an
increasingly preferred and less detectable method of stifling the free flow of
information. In order to assess this perceived trend and begin to create
systems of accountability and transparency on such practices, we attempt to
outline an initial strategy for utilizing a ubiquitious set of network
measurements as a monitoring service, then apply such methodology to shed light
on the recent history of censorship in Iran.
","[{'version': 'v1', 'created': 'Tue, 18 Jun 2013 21:30:57 GMT'}]",2013-06-20,"[['Anderson', 'Collin', '']]","['censorship', 'national Internet', 'Iran', 'throttling', 'M-Lab']"
17371,1512.01596,Volodymyr Turchenko,"Volodymyr Turchenko, Artur Luczak",Creation of a Deep Convolutional Auto-Encoder in Caffe,"9 pages, 7 figures, 5 tables, 34 references in the list; Added
  references, corrected Table 3, changed several paragraphs in the text",,,,cs.NE cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The development of a deep (stacked) convolutional auto-encoder in the Caffe
deep learning framework is presented in this paper. We describe simple
principles which we used to create this model in Caffe. The proposed model of
convolutional auto-encoder does not have pooling/unpooling layers yet. The
results of our experimental research show comparable accuracy of dimensionality
reduction in comparison with a classic auto-encoder on the example of MNIST
dataset.
","[{'version': 'v1', 'created': 'Fri, 4 Dec 2015 23:58:47 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Apr 2016 01:51:14 GMT'}, {'version': 'v3', 'created': 'Fri, 22 Apr 2016 03:20:41 GMT'}]",2016-04-25,"[['Turchenko', 'Volodymyr', ''], ['Luczak', 'Artur', '']]","['Deep convolutional auto-encoder', 'machine learning', 'neural networks', 'visualization', 'dimensionality reduction']"
17372,0910.0735,Erika De Francesco,"Erika De Francesco, Salvatore Iiritano, Antonino Spagnolo, Marco
  Iannelli",A methodology for semi-automatic classification schema building,36 pages,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describe a methodology for semi-automatic classification schema
definition (a classification schema is a taxonomy of categories useful for
automatic document classification). The methodology is based on: (i) an
extensional approach useful to create a typology starting from a document base,
and (ii) an intensional approach to build the classification schema starting
from the typology. The extensional approach uses clustering techniques to group
together documents on the basis of a similarity measure, whereas the
intensional approach uses different operations (aggregation, reduction,
generalization specialization) to define classes. keywords: ontology,
classification schema, fundamentum divisionis, cluster analysis classification
task.
","[{'version': 'v1', 'created': 'Mon, 5 Oct 2009 11:44:54 GMT'}]",2009-10-06,"[['De Francesco', 'Erika', ''], ['Iiritano', 'Salvatore', ''], ['Spagnolo', 'Antonino', ''], ['Iannelli', 'Marco', '']]","['ontology', 'classification schema', 'fundamentum divisionis', 'cluster analysis classification task']"
17373,1304.4329,Rajesh Pasupuleti,"Pasupuleti Rajesh, Gugulothu Narsimha",Privacy Preserving Data Mining by Using Implicit Function Theorem,,,,,cs.CR cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data mining has made broad significant multidisciplinary field used in vast
application domains and extracts knowledge by identifying structural
relationship among the objects in large data bases. Privacy preserving data
mining is a new area of data mining research for providing privacy of sensitive
knowledge of information extracted from data mining system to be shared by the
intended persons not to everyone to access. In this paper, we proposed a new
approach of privacy preserving data mining by using implicit function theorem
for secure transformation of sensitive data obtained from data mining system.
we proposed two way enhanced security approach. First transforming original
values of sensitive data into different partial derivatives of functional
values for perturbation of data. secondly generating symmetric key value by
Eigen values of jacobian matrix for secure computation. we given an example of
academic sensitive data converting into vector valued functions to explain
about our proposed concept and presented implementation based results of new
proposed of approach.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2013 04:30:38 GMT'}]",2013-04-17,"[['Rajesh', 'Pasupuleti', ''], ['Narsimha', 'Gugulothu', '']]","['Data Mining', 'Implicit Function Theorem', 'Privacy Preserving', 'Vector Valued Functions']"
17374,1704.08068,Dawei Dai,Dawei Dai and Weimin Tan and Hong Zhan,"Understanding the Feedforward Artificial Neural Network Model From the
  Perspective of Network Flow",arXiv admin note: text overlap with arXiv:1702.04595 by other authors,,,,cs.LG,http://creativecommons.org/publicdomain/zero/1.0/,"  In recent years, deep learning based on artificial neural network (ANN) has
achieved great success in pattern recognition. However, there is no clear
understanding of such neural computational models. In this paper, we try to
unravel ""black-box"" structure of Ann model from network flow. Specifically, we
consider the feed forward Ann as a network flow model, which consists of many
directional class-pathways. Each class-pathway encodes one class. The
class-pathway of a class is obtained by connecting the activated neural nodes
in each layer from input to output, where activation value of neural node
(node-value) is defined by the weights of each layer in a trained
ANN-classifier. From the perspective of the class-pathway, training an
ANN-classifier can be regarded as the formulation process of class-pathways of
different classes. By analyzing the the distances of each two class-pathways in
a trained ANN-classifiers, we try to answer the questions, why the classifier
performs so? At last, from the neural encodes view, we define the importance of
each neural node through the class-pathways, which is helpful to optimize the
structure of a classifier. Experiments for two types of ANN model including
multi-layer MLP and CNN verify that the network flow based on class-pathway is
a reasonable explanation for ANN models.
","[{'version': 'v1', 'created': 'Wed, 26 Apr 2017 11:45:05 GMT'}]",2017-04-27,"[['Dai', 'Dawei', ''], ['Tan', 'Weimin', ''], ['Zhan', 'Hong', '']]","['Ann', 'cnn', 'mlp', 'deep learning', 'network flow;']"
17375,1412.3751,Rama Krishna Bandi,"Rama Krishna Bandi, Maheshanand Bhaintwal",Negacyclic codes over Z4+uZ4,18 pages,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study negacyclic codes of odd length and of length $2^k$
over the ring $R=\mathbb{Z}_4+u\mathbb{Z}_4$, $u^2=0$. We give the complete
structure of negacyclic codes for both the cases. We have obtained a minimal
spanning set for negacyclic codes of odd lengths over $R$. A necessary and
sufficient condition for negacyclic codes of odd lengths to be free is
presented. We have determined the cardinality of negacyclic codes in each case.
We have obtained the structure of the duals of negacyclic codes of length $2^k$
over $R$ and also characterized self-dual negacyclic codes of length $2^k$ over
$R$.
","[{'version': 'v1', 'created': 'Thu, 11 Dec 2014 18:28:49 GMT'}]",2014-12-12,"[['Bandi', 'Rama Krishna', ''], ['Bhaintwal', 'Maheshanand', '']]","['Codes over Z4 + uZ4', 'negacyclic codes', 'cyclic codes', 'repeated root cyclic codes']"
17376,1506.04810,Ali Boyali,Ali Boyali and Naohisa Hashimoto and Osamu Matsumoto,"Paradigm Shift in Continuous Signal Pattern Classification: Mobile Ride
  Assistance System for two-wheeled Mobility Robots","This paper introduce a training approach for continuous signal
  pattern classification and its application to braking state classification of
  a mobility robots. In our previous journal article, we didn't employ a
  training method thus this paper is an improvement of a previously published
  journal article",,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study we describe the development of a ride assistance application
which can be implemented on the widespread smart phones and tablet. The ride
assistance application has a signal processing and pattern classification
module which yield almost 100% recognition accuracy for real-time signal
pattern classification. We introduce a novel framework to build a training
dictionary with an overwhelming discriminating capacity which eliminates the
need of human intervention spotting the pattern on the training samples. We
verify the recognition accuracy of the proposed methodologies by providing the
results of another study in which the hand posture and gestures are tracked and
recognized for steering a robotic wheelchair.
","[{'version': 'v1', 'created': 'Tue, 16 Jun 2015 01:09:19 GMT'}]",2015-06-17,"[['Boyali', 'Ali', ''], ['Hashimoto', 'Naohisa', ''], ['Matsumoto', 'Osamu', '']]","['Ride Assistance', 'Continuous Signal Pattern Classification', 'Subspace Training', 'Mobility Robots']"
17377,1306.4460,Michal \v{C}ertick\'y,Michal Certicky,"Implementing a Wall-In Building Placement in StarCraft with Declarative
  Programming",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In real-time strategy games like StarCraft, skilled players often block the
entrance to their base with buildings to prevent the opponent's units from
getting inside. This technique, called ""walling-in"", is a vital part of
player's skill set, allowing him to survive early aggression. However, current
artificial players (bots) do not possess this skill, due to numerous
inconveniences surfacing during its implementation in imperative languages like
C++ or Java. In this text, written as a guide for bot programmers, we address
the problem of finding an appropriate building placement that would block the
entrance to player's base, and present a ready to use declarative solution
employing the paradigm of answer set programming (ASP). We also encourage the
readers to experiment with different declarative approaches to this problem.
","[{'version': 'v1', 'created': 'Wed, 19 Jun 2013 09:08:48 GMT'}]",2013-06-20,"[['Certicky', 'Michal', '']]","['StarCraft', 'Real-time Strategy', 'Answer Set Programming', 'Wall-In', 'BWAPI']"
17378,1510.03173,Shafi'i Muhammad Abdulhamid Mr,"Shafii Muhammad Abdulhamid, Muhammad Shafie Abd Latiff and Ismaila
  Idris","Tasks Scheduling Technique Using League Championship Algorithm for
  Makespan Minimization in IaaS Cloud","5 pages, 4 figures","ARPN Journal of Engineering and Applied Sciences 9 (12), 2528 -
  2533 (2014)",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Makespan minimization in tasks scheduling of infrastructure as a service
(IaaS) cloud is an NP-hard problem. A number of techniques had been used in the
past to optimize the makespan time of scheduled tasks in IaaS cloud, which is
propotional to the execution cost billed to customers. In this paper, we
proposed a League Championship Algorithm (LCA) based makespan time minimization
scheduling technique in IaaS cloud. The LCA is a sports-inspired population
based algorithmic framework for global optimization over a continuous search
space. Three other existing algorithms that is, First Come First Served (FCFS),
Last Job First (LJF) and Best Effort First (BEF) were used to evaluate the
performance of the proposed algorithm. All algorithms under consideration
assumed to be non-preemptive. The results obtained shows that, the LCA
scheduling technique perform moderately better than the other algorithms in
minimizing the makespan time of scheduled tasks in IaaS cloud.
","[{'version': 'v1', 'created': 'Mon, 12 Oct 2015 08:00:45 GMT'}]",2015-10-13,"[['Abdulhamid', 'Shafii Muhammad', ''], ['Latiff', 'Muhammad Shafie Abd', ''], ['Idris', 'Ismaila', '']]","['League Championship Algorithm; IaaS Cloud', 'Job Scheduling Algorithm', 'Cloud Computing', 'Cloud Scheduling', 'Optimization Algorithm']"
17379,1606.03765,Assaf Hoogi,"Assaf Hoogi, Christopher F. Beaulieu, Guilherme M. Cunha, Elhamy Heba,
  Claude B. Sirlin, Sandy Napel, and Daniel L. Rubin","Adaptive Local Window for Level Set Segmentation of CT and MRI Liver
  Lesions","24 pages, 11 figures, 3 tables",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel method, the adaptive local window, for improving level set
segmentation technique. The window is estimated separately for each contour
point, over iterations of the segmentation process, and for each individual
object. Our method considers the object scale, the spatial texture, and changes
of the energy functional over iterations. Global and local statistics are
considered by calculating several gray level co-occurrence matrices. We
demonstrate the capabilities of the method in the domain of medical imaging for
segmenting 233 images with liver lesions. To illustrate the strength of our
method, those images were obtained by either Computed Tomography or Magnetic
Resonance Imaging. Moreover, we analyzed images using three different energy
models. We compare our method to a global level set segmentation and to local
framework that uses predefined fixed-size square windows. The results indicate
that our proposed method outperforms the other methods in terms of agreement
with the manual marking and dependence on contour initialization or the energy
model used. In case of complex lesions, such as low contrast lesions,
heterogeneous lesions, or lesions with a noisy background, our method shows
significantly better segmentation with an improvement of 0.25+- 0.13 in Dice
similarity coefficient, compared with state of the art fixed-size local windows
(Wilcoxon, p < 0.001).
","[{'version': 'v1', 'created': 'Sun, 12 Jun 2016 21:31:38 GMT'}]",2016-06-14,"[['Hoogi', 'Assaf', ''], ['Beaulieu', 'Christopher F.', ''], ['Cunha', 'Guilherme M.', ''], ['Heba', 'Elhamy', ''], ['Sirlin', 'Claude B.', ''], ['Napel', 'Sandy', ''], ['Rubin', 'Daniel L.', '']]","['Adaptive local window', 'deformable models', 'Lesion segmentation']"
17380,1412.4217,Zeeshan Bhatti,"Dil Nawaz Hakro, A. Z. Talib, Zeeshan Bhatti, G. N. Moja","A Study of Sindhi Related and Arabic Script Adapted languages
  Recognition","11 pages, 8 Figures, Sindh Univ. Res. Jour. (Sci. Ser.)","Sindh University Research Journal (Science Series) Vol. 46 (3)
  323-334 (2014)",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A large number of publications are available for the Optical Character
Recognition (OCR). Significant researches, as well as articles are present for
the Latin, Chinese and Japanese scripts. Arabic script is also one of mature
script from OCR perspective. The adaptive languages which share Arabic script
or its extended characters; still lacking the OCRs for their language. In this
paper we present the efforts of researchers on Arabic and its related and
adapted languages. This survey is organized in different sections, in which
introduction is followed by properties of Sindhi Language. OCR process
techniques and methods used by various researchers are presented. The last
section is dedicated for future work and conclusion is also discussed.
","[{'version': 'v1', 'created': 'Sat, 13 Dec 2014 10:01:51 GMT'}]",2014-12-16,"[['Hakro', 'Dil Nawaz', ''], ['Talib', 'A. Z.', ''], ['Bhatti', 'Zeeshan', ''], ['Moja', 'G. N.', '']]","['optical character recognition', 'adaptive languages', 'script', 'segmentation']"
17381,1205.2889,Youssef Bassil,Youssef Bassil,A Comparative Study on the Performance of the Top DBMS Systems,"LACSC - Lebanese Association for Computational Sciences,
  http://www.lacsc.org","Journal of Computer Science & Research (JCSCR), Vol.1, No.1,
  pp.20-31, 2012",,,cs.DB cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Database management systems are today's most reliable mean to organize data
into collections that can be searched and updated. However, many DBMS systems
are available on the market each having their pros and cons in terms of
reliability, usability, security, and performance. This paper presents a
comparative study on the performance of the top DBMS systems. They are mainly
MS SQL Server 2008, Oracle 11g, IBM DB2, MySQL 5.5, and MS Access 2010. The
testing is aimed at executing different SQL queries with different level of
complexities over the different five DBMSs under test. This would pave the way
to build a head-to-head comparative evaluation that shows the average execution
time, memory usage, and CPU utilization of each DBMS after completion of the
test.
","[{'version': 'v1', 'created': 'Sun, 13 May 2012 17:54:51 GMT'}]",2012-05-15,"[['Bassil', 'Youssef', '']]","['DBMS', 'Performance Study', 'SQL Server', 'MySQL', 'Oracle', 'DB2', 'Access']"
17382,1304.7055,Zhihan Gao,Zhihan Gao,An LP-based 3/2-approximation algorithm for the graphic s-t path TSP,,,,,cs.DS,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We design a new LP-based algorithm for the graphic $s$-$t$ path Traveling
Salesman Problem (TSP), which achieves the best approximation factor of 1.5.
The algorithm is based on the idea of narrow cuts due to An, Kleinberg, and
Shmoys. It partly answers an open question of Seb\H{o}.
","[{'version': 'v1', 'created': 'Fri, 26 Apr 2013 02:28:22 GMT'}]",2013-04-29,"[['Gao', 'Zhihan', '']]","['approximation algorithms', 'linear programming', 's-t path TSP']"
17383,1010.0169,Massoud Masoumi,Massoud Masoumi,"A Novel and Highly Efficient AES Implementation Robust against
  Differential Power Analysis",,,,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Developed by Paul Kocher, Joshua Jaffe, and Benjamin Jun in 1999,
Differential Power Analysis (DPA) represents a unique and powerful
cryptanalysis technique. Insight into the encryption and decryption behavior of
a cryptographic device can be determined by examining its electrical power
signature. This paper describes a novel approach for implementation of the AES
algorithm which provides a significantly improved strength against differential
power analysis with a minimal additional hardware overhead. Our method is based
on randomization in composite field arithmetic which entails an area penalty of
only 7% while does not decrease the working frequency, does not alter the
algorithm and keeps perfect compatibility with the published standard. The
efficiency of the proposed technique was verified by practical results obtained
from real implementation on a Xilinx Spartan-II FPGA.
","[{'version': 'v1', 'created': 'Fri, 1 Oct 2010 14:10:56 GMT'}]",2010-10-04,"[['Masoumi', 'Massoud', '']]","['Advanced Encryption Standard (AES) Algorithm', 'Differential Power Analysis', 'FPGA Implementation', 'Countermeasure', 'Composite Field Arithmetic']"
17384,1111.1904,Nicolas Ferry,"Nicolas Ferry, Jean-Yves Tigli, St\'ephane Lavirotte, Ga\""etan Rey,
  Michel Riveill","Aspects of Assembly and Cascaded Aspects of Assembly: Logical and
  Temporal Properties","14 pages, published in International Journal of Computer Science,
  Volume 8, issue 4, Jul 2011, ISSN 1694-0814","International Journal of Computer Science (IJCSI), Volume 8, Issue
  4(1), JUL 2011, 1-15",,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Highly dynamic computing environments, like ubiquitous and pervasive
computing environments, require frequent adaptation of applications. This has
to be done in a timely fashion, and the adaptation process must be as fast as
possible and mastered. Moreover the adaptation process has to ensure a
consistent result when finished whereas adaptations to be implemented cannot be
anticipated at design time. In this paper we present our mechanism for
self-adaptation based on the aspect oriented programming paradigm called Aspect
of Assembly (AAs). Using AAs: (1) the adaptations process is fast and its
duration is mastered; (2) adaptations' entities are independent of each other
thanks to the weaver logical merging mechanism; and (3) the high variability of
the software infrastructure can be managed using a mono or multi-cycle weaving
approach.
","[{'version': 'v1', 'created': 'Tue, 8 Nov 2011 13:34:36 GMT'}]",2011-11-09,"[['Ferry', 'Nicolas', ''], ['Tigli', 'Jean-Yves', ''], ['Lavirotte', 'Stéphane', ''], ['Rey', 'Gaëtan', ''], ['Riveill', 'Michel', '']]","['Aspect oriented programming', 'Context-awareness', 'Dynamic adaptation', 'Component Based Software Engineering']"
17385,1611.00137,Hailin Shi,"Hailin Shi, Yang Yang, Xiangyu Zhu, Shengcai Liao, Zhen Lei, Weishi
  Zheng, Stan Z. Li","Embedding Deep Metric for Person Re-identication A Study Against Large
  Variations","Published in ECCV2016. arXiv admin note: substantial text overlap
  with arXiv:1511.07545",,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Person re-identification is challenging due to the large variations of pose,
illumination, occlusion and camera view. Owing to these variations, the
pedestrian data is distributed as highly-curved manifolds in the feature space,
despite the current convolutional neural networks (CNN)'s capability of feature
extraction. However, the distribution is unknown, so it is difficult to use the
geodesic distance when comparing two samples. In practice, the current deep
embedding methods use the Euclidean distance for the training and test. On the
other hand, the manifold learning methods suggest to use the Euclidean distance
in the local range, combining with the graphical relationship between samples,
for approximating the geodesic distance. From this point of view, selecting
suitable positive i.e. intra-class) training samples within a local range is
critical for training the CNN embedding, especially when the data has large
intra-class variations. In this paper, we propose a novel moderate positive
sample mining method to train robust CNN for person re-identification, dealing
with the problem of large variation. In addition, we improve the learning by a
metric weight constraint, so that the learned metric has a better
generalization ability. Experiments show that these two strategies are
effective in learning robust deep metrics for person re-identification, and
accordingly our deep model significantly outperforms the state-of-the-art
methods on several benchmarks of person re-identification. Therefore, the study
presented in this paper may be useful in inspiring new designs of deep models
for person re-identification.
","[{'version': 'v1', 'created': 'Tue, 1 Nov 2016 06:03:48 GMT'}]",2016-11-02,"[['Shi', 'Hailin', ''], ['Yang', 'Yang', ''], ['Zhu', 'Xiangyu', ''], ['Liao', 'Shengcai', ''], ['Lei', 'Zhen', ''], ['Zheng', 'Weishi', ''], ['Li', 'Stan Z.', '']]","['person re-identification', 'deep learning', 'CNN']"
17386,1707.09790,Carsten Eickhoff,"Zsolt Mezei, Carsten Eickhoff",Evaluating Music Recommender Systems for Groups,"Presented at the 2017 Workshop on Value-Aware and Multistakeholder
  Recommendation",,,,cs.AI cs.HC cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommendation to groups of users is a challenging and currently only
passingly studied task. Especially the evaluation aspect often appears ad-hoc
and instead of truly evaluating on groups of users, synthesizes groups by
merging individual preferences.
  In this paper, we present a user study, recording the individual and shared
preferences of actual groups of participants, resulting in a robust,
standardized evaluation benchmark. Using this benchmarking dataset, that we
share with the research community, we compare the respective performance of a
wide range of music group recommendation techniques proposed in the
","[{'version': 'v1', 'created': 'Mon, 31 Jul 2017 10:00:55 GMT'}]",2017-08-01,"[['Mezei', 'Zsolt', ''], ['Eickhoff', 'Carsten', '']]","['User study', 'evaluation', 'ranking', 'music', 'groups', 'recommendations']"
17387,1604.07510,Gunupudi Rajesh Kumar Mr,"Gunupudi Rajesh Kumar, N Mangathayaru, G Narsimha","A Novel Similarity Measure for Intrusion Detection using Gaussian
  Function","11 Pages, SCI Indexed Journal, REVISTA TECNICA DE LA FACULTAD DE
  INGENIERIA UNIVERSIDAD DEL ZULIA",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper the major objective is to design and analyze the suitability of
Gaussian similarity measure for intrusion detection. The objective is to use
this as a distance measure to find the distance between any two data samples of
training set such as DARPA Data Set, KDD Data Set. This major objective is to
use this measure as a distance metric when applying k- means algorithm. The
novelty of this approach is making use of the proposed distance function as
part of k-means algorithm so as to obtain disjoint clusters. This is followed
by a case study, which demonstrates the process of Intrusion Detection. The
proposed similarity has fixed upper and lower bounds. The proposed similarity
measure satisfies all properties of a typical similarity measure.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2016 04:26:00 GMT'}]",2016-04-27,"[['Kumar', 'Gunupudi Rajesh', ''], ['Mangathayaru', 'N', ''], ['Narsimha', 'G', '']]","['Intrusion Detection', 'Similarity Function', 'k-Means', 'Gaussian', 'Text Processing  1']"
17388,1111.2108,Xiongping Dai,Xiongping Dai,"A criterion of simultaneously symmetrization and spectral finiteness for
  a finite set of real 2-by-2 matrices",5 pages,,,,cs.SY cs.NA math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider the simultaneously symmetrization and spectral
finiteness for a finite set of real 2-by-2 matrices.
","[{'version': 'v1', 'created': 'Wed, 9 Nov 2011 05:57:02 GMT'}]",2011-11-10,"[['Dai', 'Xiongping', '']]","['Symmetrization of matrices', 'generalized spectral radius', 'spectral finiteness']"
17389,1402.3655,V Karthikeyan VKK,"V. Karthikeyan, A. Vinod, P. Jeyakumar","An Energy Efficient Neighbour Node Discovery Method for Wireless Sensor
  Networks",4 figures and 5 pages,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The discovery of neighbouring nodes in multihop wireless networks has become
a key challenge. Due to tribulations in communication, synchronization loss
between nodes, disparity in transmission power etc, the connectivity of nodes
will always experience disruptions. On the other hand, the energy utilization
by the nodes also became critical . In this paper, we propose a new method for
neighbour discovery in wireless sensor networks (WSNs) which pays an eminent
consideration for energy utilization and QoS parameters like latency,
throughput, error rate etc. In the proposed method, the network routing is
enhanced using AOMDV protocol which can accurately discover the neighbour nodes
and power management with HMAC protocol which reduces the energy utilization
significantly. A complete analysis is being performed to estimate how the Q o S
metrics varies in various scenarios of power consumption in wireless networks.
","[{'version': 'v1', 'created': 'Sat, 15 Feb 2014 06:33:50 GMT'}]",2014-02-18,"[['Karthikeyan', 'V.', ''], ['Vinod', 'A.', ''], ['Jeyakumar', 'P.', '']]","['neighbour discovery', 'power utilization', 'throughput', 'synchronization', 'end to end delay']"
17390,1610.08843,Julien Lange,Julien Lange and Nicholas Ng and Bernardo Toninho and Nobuko Yoshida,"Fencing off Go: Liveness and Safety for Channel-based Programming
  (extended version)",,,,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Go is a production-level statically typed programming language whose design
features explicit message-passing primitives and lightweight threads, enabling
(and encouraging) programmers to develop concurrent systems where components
interact through communication more so than by lock-based shared memory
concurrency. Go can only detect global deadlocks at runtime, but provides no
compile-time protection against all too common communication mismatches or
partial deadlocks. This work develops a static verification framework for
liveness and safety in Go programs, able to detect communication errors and
partial deadlocks in a general class of realistic concurrent programs,
including those with dynamic channel creation, unbounded thread creation and
recursion. Our approach infers from a Go program a faithful representation of
its communication patterns as a behavioural type. By checking a syntactic
restriction on channel usage, dubbed fencing, we ensure that programs are made
up of finitely many different communication patterns that may be repeated
infinitely many times. This restriction allows us to implement procedures to
check for liveness and safety in types which in turn approximates liveness and
safety in Go programs. We have implemented a type inference and liveness and
safety checks in a tool-chain and tested it against publicly available Go
programs.
  Note: This is a revised extended version of a paper that appeared in POPL
2017, see page 13 for details.
","[{'version': 'v1', 'created': 'Thu, 27 Oct 2016 15:40:45 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Jan 2017 18:06:37 GMT'}, {'version': 'v3', 'created': 'Tue, 28 Feb 2017 13:55:03 GMT'}]",2017-03-01,"[['Lange', 'Julien', ''], ['Ng', 'Nicholas', ''], ['Toninho', 'Bernardo', ''], ['Yoshida', 'Nobuko', '']]","['Channel-based programming', 'Message-passing programming', 'Process calculus', 'Types', 'Safety and Liveness', 'Compiletime (static) deadlock detection']"
17391,1212.3162,Aaron Gerow,Aaron Gerow and Khurshid Ahmad,Diachronic Variation in Grammatical Relations,,"Proceedings of the 24th International Conference on Computational
  Linguistics (COLING 2012), Mumbai, India",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a method of finding and analyzing shifts in grammatical relations
found in diachronic corpora. Inspired by the econometric technique of measuring
return and volatility instead of relative frequencies, we propose them as a way
to better characterize changes in grammatical patterns like nominalization,
modification and comparison. To exemplify the use of these techniques, we
examine a corpus of NIPS papers and report trends which manifest at the token,
part-of-speech and grammatical levels. Building up from frequency observations
to a second-order analysis, we show that shifts in frequencies overlook deeper
trends in language, even when part-of-speech information is included. Examining
token, POS and grammatical levels of variation enables a summary view of
diachronic text as a whole. We conclude with a discussion about how these
methods can inform intuitions about specialist domains as well as changes in
language use as a whole.
","[{'version': 'v1', 'created': 'Thu, 13 Dec 2012 13:00:55 GMT'}]",2012-12-14,"[['Gerow', 'Aaron', ''], ['Ahmad', 'Khurshid', '']]","['Corpus Analysis', 'Diachronic Analysis', 'Language Variation', 'Text Classification']"
17392,1602.07715,Matthew Yancey,"Austin J. Parker, Kelly B. Yancey, Matthew P. Yancey",Regular Language Distance and Entropy,,,,,cs.FL math.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the problem of determining the distance between two
regular languages. It will show how to expand Jaccard distance, which works on
finite sets, to potentially-infinite regular languages. The entropy of a
regular language plays a large role in the extension. Much of the paper is
spent investigating the entropy of a regular language. This includes addressing
issues that have required previous authors to rely on the upper limit of
Shannon's traditional formulation of entropy, because its limit does not always
exist. The paper also includes proposing a new limit based formulation for the
entropy of a regular language and proves that formulation to both exist and be
equivalent to Shannon's original formulation (when it exists). Additionally,
the proposed formulation is shown to equal an analogous but formally quite
different notion of topological entropy from Symbolic Dynamics -- consequently
also showing Shannon's original formulation to be equivalent to topological
entropy. Surprisingly, the natural Jaccard-like entropy distance is trivial in
most cases. Instead, the {\it entropy sum} distance metric is suggested, and
shown to be granular in certain situations.
","[{'version': 'v1', 'created': 'Fri, 19 Feb 2016 21:49:27 GMT'}]",2016-02-26,"[['Parker', 'Austin J.', ''], ['Yancey', 'Kelly B.', ''], ['Yancey', 'Matthew P.', '']]","['regular languages', 'channel capacity', 'entropy', 'Jaccard', 'symbolic dynamics']"
17393,0805.3484,Heide Gluesing-Luerssen,"Heide Gluesing-Luerssen, Gert Schneider",A MacWilliams Identity for Convolutional Codes: The General Case,20 pages,,,,cs.IT math.IT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A MacWilliams Identity for convolutional codes will be established. It makes
use of the weight adjacency matrices of the code and its dual, based on state
space realizations (the controller canonical form) of the codes in question.
The MacWilliams Identity applies to various notions of duality appearing in the
literature on convolutional coding theory.
","[{'version': 'v1', 'created': 'Thu, 22 May 2008 15:06:50 GMT'}]",2008-05-23,"[['Gluesing-Luerssen', 'Heide', ''], ['Schneider', 'Gert', '']]","['Convolutional codes', 'controller canonical form', 'weight distribution', 'weight adjacency matrix', 'MacWilliams identity']"
17394,1501.04000,Ha Bui,"H.H. Bui, J.A. Kodikara, R. Pathegama, A. Bouazza, A. Haque","Large deformation and post-failure simulations of segmental retaining
  walls using mesh-free method (SPH)",,,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Numerical methods are extremely useful in gaining insights into the behaviour
of reinforced soil retaining walls. However, traditional numerical approaches
such as limit equilibrium or finite element methods are unable to simulate
large deformation and post-failure behaviour of soils and retaining wall blocks
in the reinforced soil retaining walls system. To overcome this limitation, a
novel numerical approach is developed aiming to predict accurately the large
deformation and post-failure behaviour of soil and segmental wall blocks.
Herein, soil is modelled using an elasto-plastic constitutive model, while
segmental wall blocks are assumed rigid with full degrees of freedom. A soft
contact model is proposed to simulate the interaction between soil-block and
block-block. A two dimensional experiment of reinforced soil retaining walls
collapse was conducted to verify the numerical results. It is shown that the
proposed method can simulate satisfactory post-failure behaviour of segmental
wall blocks in reinforced soil retaining wall systems. The comparison showed
that the proposed method can provide satisfactory agreement with experiments.
","[{'version': 'v1', 'created': 'Fri, 16 Jan 2015 14:52:42 GMT'}]",2015-01-19,"[['Bui', 'H. H.', ''], ['Kodikara', 'J. A.', ''], ['Pathegama', 'R.', ''], ['Bouazza', 'A.', ''], ['Haque', 'A.', '']]","['retaining wall modelling', 'segmental walls', 'large deformation and failure', 'mesh-free', 'SPH']"
17395,1504.01661,Youssef Khmou,"Youssef Khmou, Said Safi",An original Propagator for large array,Fourteen pages and four figures,,,,cs.IT math.IT stat.AP stat.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we demonstrate that when the ratio $n$ of the number of
antenna elements $N$ to the number $P$ of radiating sources is superior or
equal to $2$, then it is possible to choose a propagator from a set of
$n(n+1)/2-1$ operators to compute the Angles of Arrival (AoA) of the narrowband
incoming waves. This new non eigenbased approach is efficient when the Signal
to Noise Ratio (SNR) is moderate, and gives multitude of possibilities, that
are dependent of the random data, to construct the complex sets whose columns
are orthogonal to the signal subspace generated by the radiating sources.
Elementary examples are given for $n=3$, $n=4$ and $n=6$. The simulation
results are presented to illustrate the performance of the proposed
computational methods.
","[{'version': 'v1', 'created': 'Mon, 16 Mar 2015 14:40:41 GMT'}]",2015-04-08,"[['Khmou', 'Youssef', ''], ['Safi', 'Said', '']]","['Propagator', 'DoA', 'Narrowband', 'large array', 'angular spectrum', 'subspace projector', 'Highresolution']"
17396,1009.1977,Carlos A. Romero-Diaz,Mario Rodr\'iguez-Artalejo and Carlos A. Romero-D\'iaz,"Fixpoint & Proof-theoretic Semantics for CLP with Qualification and
  Proximity","47 pages, 2 figures, extended version with full proofs of A
  Declarative Semantics for CLP with Qualification and Proximity
  (arXiv:1007.3629). Theory and Practice of Logic Programming, 26th Int'l.
  Conference on Logic Programming (ICLP'10) Special Issue, 10(4-6):627-642,
  2010. Revised definition 2.10, theorem 2.1 & proposition 2.2, results
  unchanged",,,SIC-1-10,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Uncertainty in Logic Programming has been investigated during the last
decades, dealing with various extensions of the classical LP paradigm and
different applications. Existing proposals rely on different approaches, such
as clause annotations based on uncertain truth values, qualification values as
a generalization of uncertain truth values, and unification based on proximity
relations. On the other hand, the CLP scheme has established itself as a
powerful extension of LP that supports efficient computation over specialized
domains while keeping a clean declarative semantics. In this report we propose
a new scheme SQCLP designed as an extension of CLP that supports qualification
values and proximity relations. We show that several previous proposals can be
viewed as particular cases of the new scheme, obtained by partial
instantiation. We present a declarative semantics for SQCLP that is based on
observables, providing fixpoint and proof-theoretical characterizations of
least program models as well as an implementation-independent notion of goal
solutions.
","[{'version': 'v1', 'created': 'Fri, 10 Sep 2010 10:42:09 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Jan 2011 14:21:03 GMT'}]",2011-01-17,"[['Rodríguez-Artalejo', 'Mario', ''], ['Romero-Díaz', 'Carlos A.', '']]","['Constraint Logic Programming', 'Qualification Domains and Values', 'Proximity Relations']"
17397,0804.2112,Shai  Gutner,"Yossi Azar, Iftah Gamzu and Shai Gutner",Truthful Unsplittable Flow for Large Capacity Networks,,"Proc. of 19th SPAA (2007), 320-329",,,cs.DS cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we focus our attention on the large capacities unsplittable
flow problem in a game theoretic setting. In this setting, there are selfish
agents, which control some of the requests characteristics, and may be
dishonest about them. It is worth noting that in game theoretic settings many
standard techniques, such as randomized rounding, violate certain monotonicity
properties, which are imperative for truthfulness, and therefore cannot be
employed. In light of this state of affairs, we design a monotone deterministic
algorithm, which is based on a primal-dual machinery, which attains an
approximation ratio of $\frac{e}{e-1}$, up to a disparity of $\epsilon$ away.
This implies an improvement on the current best truthful mechanism, as well as
an improvement on the current best combinatorial algorithm for the problem
under consideration. Surprisingly, we demonstrate that any algorithm in the
family of reasonable iterative path minimizing algorithms, cannot yield a
better approximation ratio. Consequently, it follows that in order to achieve a
monotone PTAS, if exists, one would have to exert different techniques. We also
consider the large capacities \textit{single-minded multi-unit combinatorial
auction problem}. This problem is closely related to the unsplittable flow
problem since one can formulate it as a special case of the integer linear
program of the unsplittable flow problem. Accordingly, we obtain a comparable
performance guarantee by refining the algorithm suggested for the unsplittable
flow problem.
","[{'version': 'v1', 'created': 'Mon, 14 Apr 2008 08:03:30 GMT'}]",2008-12-18,"[['Azar', 'Yossi', ''], ['Gamzu', 'Iftah', ''], ['Gutner', 'Shai', '']]","['Mechanism design', 'approximation algorithms', 'combinatorial and multi-unit auctions', 'primal-dual method']"
17398,1504.02235,Gowri Rajasekaran,"R. Gowri, R. Rathipriya",Extraction of Protein Sequence Motif Information using PSO K-Means,,,,,cs.CV,http://creativecommons.org/licenses/by/3.0/,"  The main objective of the paper is to find the motif information.The
functionalities of the proteins are ideally found from their motif information
which is extracted using various techniques like clustering with k-means,
hybrid k-means, self-organising maps, etc., in the literature. In this work
protein sequence information is extracted using optimised k-means algorithm.
The particle swarm optimisation technique is one of the frequently used
optimisation method. In the current work the PSO k-means is used for motif
information extraction. This paper also deals with the comparison between the
motif information obtained from clusters and biclustersusing PSO k-means
algorithm. The motif information acquired is based on the structure homogeneity
of the protein sequence.
","[{'version': 'v1', 'created': 'Thu, 9 Apr 2015 09:53:44 GMT'}]",2015-04-10,"[['Gowri', 'R.', ''], ['Rathipriya', 'R.', '']]","['Biclustering', 'Clustering', 'PSO K-Means', 'Protein Motifs']"
17399,0710.2156,Daniel Lemire,"Kamel Aouiche, Daniel Lemire and Robert Godin","Collaborative OLAP with Tag Clouds: Web 2.0 OLAP Formalism and
  Experimental Evaluation",Software at https://github.com/lemire/OLAPTagCloud,,,,cs.DB,http://creativecommons.org/licenses/by/4.0/,"  Increasingly, business projects are ephemeral. New Business Intelligence
tools must support ad-lib data sources and quick perusal. Meanwhile, tag clouds
are a popular community-driven visualization technique. Hence, we investigate
tag-cloud views with support for OLAP operations such as roll-ups, slices,
dices, clustering, and drill-downs. As a case study, we implemented an
application where users can upload data and immediately navigate through its ad
hoc dimensions. To support social networking, views can be easily shared and
embedded in other Web sites. Algorithmically, our tag-cloud views are
approximate range top-k queries over spontaneous data cubes. We present
experimental evidence that iceberg cuboids provide adequate online
approximations. We benchmark several browser-oblivious tag-cloud layout
optimizations.
","[{'version': 'v1', 'created': 'Thu, 11 Oct 2007 19:48:10 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Jan 2008 21:23:11 GMT'}, {'version': 'v3', 'created': 'Tue, 15 Mar 2016 21:52:12 GMT'}]",2016-03-17,"[['Aouiche', 'Kamel', ''], ['Lemire', 'Daniel', ''], ['Godin', 'Robert', '']]","['OLAP', 'Data Warehouse', 'Business Intelligence', 'Tag Cloud', 'Social Web']"
17400,1410.0610,Zhe Liu,Zhe Liu and Ingmar Weber,"Is Twitter a Public Sphere for Online Conflicts? A Cross-Ideological and
  Cross-Hierarchical Look","To appear in the 6th International Conference on Social Informatics
  (SocInfo 2014), Barcelona",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rise in popularity of Twitter has led to a debate on its impact on public
opinions. The optimists foresee an increase in online participation and
democratization due to social media's personal and interactive nature.
Cyber-pessimists, on the other hand, explain how social media can lead to
selective exposure and can be used as a disguise for those in power to
disseminate biased information. To investigate this debate empirically, we
evaluate Twitter as a public sphere using four metrics: equality, diversity,
reciprocity and quality. Using these measurements, we analyze the communication
patterns between individuals of different hierarchical levels and ideologies.
We do this within the context of three diverse conflicts: Israel-Palestine, US
Democrats-Republicans, and FC Barcelona-Real Madrid. In all cases, we collect
data around a central pair of Twitter accounts representing the two main
parties. Our results show in a quantitative manner that Twitter is not an ideal
public sphere for democratic conversations and that hierarchical effects are
part of the reason why it is not.
","[{'version': 'v1', 'created': 'Thu, 2 Oct 2014 17:17:56 GMT'}]",2014-10-03,"[['Liu', 'Zhe', ''], ['Weber', 'Ingmar', '']]","['public sphere', 'social stratification', 'conflict', 'political communication', 'twitter']"
17401,1606.04573,Marcin Pi\k{a}tkowski,"Juha K\""arkk\""ainen, Marcin Pi\k{a}tkowski, Simon J. Puglisi",String Inference from the LCP Array,Added algorithm for general alphabets,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The suffix array, perhaps the most important data structure in modern string
processing, is often augmented with the longest common prefix (LCP) array which
stores the lengths of the LCPs for lexicographically adjacent suffixes of a
string. Together the two arrays are roughly equivalent to the suffix tree with
the LCP array representing the tree shape.
  In order to better understand the combinatorics of LCP arrays, we consider
the problem of inferring a string from an LCP array, i.e., determining whether
a given array of integers is a valid LCP array, and if it is, reconstructing
some string or all strings with that LCP array. There are recent studies of
inferring a string from a suffix tree shape but using significantly more
information (in the form of suffix links) than is available in the LCP array.
  We provide two main results. (1) We describe two algorithms for inferring
strings from an LCP array when we allow a generalized form of LCP array defined
for a multiset of cyclic strings: a linear time algorithm for binary alphabet
and a general algorithm with polynomial time complexity for a constant alphabet
size. (2) We prove that determining whether a given integer array is a valid
LCP array is NP-complete when we require more restricted forms of LCP array
defined for a single cyclic or non-cyclic string or a multiset of non-cyclic
strings. The result holds whether or not the alphabet is restricted to be
binary. In combination, the two results show that the generalized form of LCP
array for a multiset of cyclic strings is fundamentally different from the
other more restricted forms.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2016 21:21:17 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Feb 2017 21:32:38 GMT'}]",2017-02-27,"[['Kärkkäinen', 'Juha', ''], ['Piątkowski', 'Marcin', ''], ['Puglisi', 'Simon J.', '']]","['LCP array', 'string inference', 'BWT', 'suffix array', 'suffix tree', 'NP-hardness']"
17402,1310.0810,Dean Mohamedally,"Siri Vinay, Manoj Vaseekharan and Dean Mohamedally","RoboRun: A gamification approach to control flow learning for young
  students with TouchDevelop",Promoto 2013 Workshop demo paper at SPLASH 2013,,,PrMoTo/2013/08,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This demo paper introduces young students to writing code in a touch enabled
interactive maze game. Problem-based learning is given a gamified approach to
learning, while simultaneously introducing the TouchDevelop platform to build
basic first control flow algorithms and to learn about ordering and loops in
conditional statements.
","[{'version': 'v1', 'created': 'Tue, 1 Oct 2013 21:27:29 GMT'}]",2013-10-04,"[['Vinay', 'Siri', ''], ['Vaseekharan', 'Manoj', ''], ['Mohamedally', 'Dean', '']]","['Education tool', 'early programming', 'learning programming environment', 'touch-based programming']"
17403,1110.3535,Balaji Venu,Balaji Venu,Multi-core processors - An overview,"6 pages, Best Literature review",,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Microprocessors have revolutionized the world we live in and continuous
efforts are being made to manufacture not only faster chips but also smarter
ones. A number of techniques such as data level parallelism, instruction level
parallelism and hyper threading (Intel's HT) already exists which have
dramatically improved the performance of microprocessor cores. This paper
briefs on evolution of multi-core processors followed by introducing the
technology and its advantages in today's world. The paper concludes by
detailing on the challenges currently faced by multi-core processors and how
the industry is trying to address these issues.
","[{'version': 'v1', 'created': 'Sun, 16 Oct 2011 22:48:56 GMT'}]",2011-10-18,"[['Venu', 'Balaji', '']]","['Microprocessor', 'Multi core', 'multi threading technology', 'hardware parallelism', 'software challenges', 'High performance computing (HPC)']"
17404,0907.0937,"Rapha\""el Rossignol","Nadia Creignou, Herve Daude, Uwe Egly and Raphael Rossignol","The threshold for random (1,2)-QSAT","20 pages. Preliminary, conference versions of this article appeared
  in SAT08 and SAT09",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The QSAT problem is the quantified version of the SAT problem. We show the
existence of a threshold effect for the phase transition associated with the
satisfiability of random quantified extended 2-CNF formulas. We consider
boolean CNF formulas of the form $\forall X \exists Y \varphi(X,Y)$, where $X$
has $m$ variables, $Y$ has $n$ variables and each clause in $\varphi$ has one
literal from $X$ and two from $Y$. For such formulas, we show that the
threshold phenomenon is controlled by the ratio between the number of clauses
and the number $n$ of existential variables. Then we give the exact location of
the associated critical ratio $c^{*}$. Indeed, we prove that $c^{*}$ is a
decreasing function of $ \alpha$, where $\alpha$ is the limiting value of $m /
\log (n)$ when $n$ tends to infinity.
","[{'version': 'v1', 'created': 'Mon, 6 Jul 2009 15:30:21 GMT'}]",2009-07-07,"[['Creignou', 'Nadia', ''], ['Daude', 'Herve', ''], ['Egly', 'Uwe', ''], ['Rossignol', 'Raphael', '']]","['Random quantified formulas', 'satisfiability', 'phase transition', 'sharp threshold']"
17405,1407.3178,Tingyao Xiong,Tingyao Xiong and Jonathan I. Hall,"Modifications on Character Sequences and Construction of Large Even
  Length Binary Sequences",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It has been noticed that all the known binary sequences having the asymptotic
merit factor $\ge 6$ are the modifications to the real primitive characters. In
this paper, we give a new modification of the character sequences at length
$N=p_1p_2\dots p_r$, where $p_i$'s are distinct odd primes and $r$ is finite.
Based on these new modifications, for $N=p_1p_2\dots p_r$ with $p_i$'s distinct
odd primes, we can construct a binary sequence of length $2N$ with asymptotic
merit factor $6.0$
","[{'version': 'v1', 'created': 'Fri, 11 Jul 2014 14:50:47 GMT'}]",2014-07-14,"[['Xiong', 'Tingyao', ''], ['Hall', 'Jonathan I.', '']]","['aperiodic correlation', 'merit factor', 'primitive characters']"
17406,1305.0435,Joshua Drew,"Emily S. Darling1, David Shiffman, Isabelle M. C\^ot\'e, Joshua A.
  Drew",The role of twitter in the life cycle of a scientific publication,"31 pages, 5 figures",,,,cs.DL cs.CY physics.soc-ph q-bio.PE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Twitter is a micro-blogging social media platform for short messages that can
have a long-term impact on how scientists create and publish ideas. We
investigate the usefulness of twitter in the development and distribution of
scientific knowledge. At the start of the life cycle of a scientific
publication, twitter provides a large virtual department of colleagues that can
help to rapidly generate, share and refine new ideas. As ideas become
manuscripts, twitter can be used as an informal arena for the pre-review of
works in progress. Finally, tweeting published findings can communicate
research to a broad audience of other researchers, decision makers, journalists
and the general public that can amplify the scientific and social impact of
publications. However, there are limitations, largely surrounding issues of
intellectual property and ownership, inclusiveness and misrepresentations of
science sound bites. Nevertheless, we believe twitter is a useful social media
tool that can provide a valuable contribution to scientific publishing in the
21st century.
","[{'version': 'v1', 'created': 'Thu, 2 May 2013 13:54:23 GMT'}]",2013-05-03,"[['Darling1', 'Emily S.', ''], ['Shiffman', 'David', ''], ['Côté', 'Isabelle M.', ''], ['Drew', 'Joshua A.', '']]","['social media', 'tweets', 'altmetrics', 'scientific publishing']"
17407,1603.06729,Xiaowang Zhang,"Xingwang Han and Zhiyong Feng and Xiaowang Zhang and Xin Wang and
  Guozheng Rao and Shuo Jiang",On the Statistical Analysis of Practical SPARQL Queries,6 pages,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we analyze some basic features of SPARQL queries coming from
our practical world in a statistical way. These features include three
statistic features such as the occurrence frequency of triple patterns,
fragments, well-designed patterns and four semantic features such as
monotonicity, non-monotonicity, weak monotonicity (old solutions are still
served as parts of new solutions when some new triples are added) and
satisfiability. All these features contribute to characterize SPARQL queries in
different dimensions. We hope that this statistical analysis would provide some
useful observation for researchers and engineers who are interested in what
practical SPARQL queries look like, so that they could develop some practical
heuristics for processing SPARQL queries and build SPARQL query processing
engines and benchmarks. Besides, they can narrow the scope of their problems by
avoiding those cases that do possibly not happen in our practical world.
","[{'version': 'v1', 'created': 'Tue, 22 Mar 2016 10:44:02 GMT'}]",2016-03-23,"[['Han', 'Xingwang', ''], ['Feng', 'Zhiyong', ''], ['Zhang', 'Xiaowang', ''], ['Wang', 'Xin', ''], ['Rao', 'Guozheng', ''], ['Jiang', 'Shuo', '']]","['RDF', 'SPARQL', 'Well-designed patterns', 'Monotonicity', 'Satisfiability']"
17408,1406.4845,Diego Sebasti\'an P\'erez,"Diego Sebasti\'an P\'erez, Facundo Bromberg, Francisco Gonzalez
  Antivilo","Computer Vision Approach for Low Cost, High Precision Measurement of
  Grapevine Trunk Diameter in Outdoor Conditions","10 pages, 5 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Trunk diameter is a variable of agricultural interest, used mainly in the
prediction of fruit trees production. It is correlated with leaf area and
biomass of trees, and consequently gives a good estimate of the potential
production of the plants. This work presents a low cost, high precision method
for the measurement of trunk diameter of grapevines based on Computer Vision
techniques. Several methods based on Computer Vision and other techniques are
introduced in the literature. These methods present different advantages for
crop management: they are amenable to be operated by unknowledgeable personnel,
with lower operational costs; they result in lower stress levels to
knowledgeable personnel, avoiding the deterioration of the measurement quality
over time; and they make the measurement process amenable to be embedded in
larger autonomous systems, allowing more measurements to be taken with
equivalent costs. To date, all existing autonomous methods are either of low
precision, or have a prohibitive cost for massive agricultural adoption,
leaving the manual Vernier caliper or tape measure as the only choice in most
situations. In this work we present a semi-autonomous measurement method that
is susceptible to be fully automated, cost effective for mass adoption, and its
precision is competitive (with slight improvements) over the caliper manual
method.
","[{'version': 'v1', 'created': 'Fri, 16 May 2014 18:44:58 GMT'}, {'version': 'v2', 'created': 'Mon, 9 May 2016 21:10:16 GMT'}]",2016-05-11,"[['Pérez', 'Diego Sebastián', ''], ['Bromberg', 'Facundo', ''], ['Antivilo', 'Francisco Gonzalez', '']]","['Computer vision', 'Gaussian mixture model', 'Grapevine', 'Trunk diameter', 'Measurement']"
17409,1511.04320,Manuel Chica,Manuel Chica and Pascual Campoy,"Standard methods for inexpensive pollen loads authentication by means of
  computer vision and machine learning",24 pages. Book chapter to appear,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a complete methodology for authenticating local bee pollen against
fraudulent samples using image processing and machine learning techniques. The
proposed standard methods do not need expensive equipment such as advanced
microscopes and can be used for a preliminary fast rejection of unknown pollen
types. The system is able to rapidly reject the non-local pollen samples with
inexpensive hardware and without the need to send the product to the
laboratory. Methods are based on the color properties of bee pollen loads
images and the use of one-class classifiers which are appropriate to reject
unknown pollen samples when there is limited data about them. The validation of
the method is carried out by authenticating Spanish bee pollen types.
Experimentation shows that the proposed methods can obtain an overall
authentication accuracy of 94%. We finally illustrate the user interaction with
the software in some practical cases by showing the developed application
prototype.
","[{'version': 'v1', 'created': 'Fri, 13 Nov 2015 15:35:22 GMT'}]",2015-11-16,"[['Chica', 'Manuel', ''], ['Campoy', 'Pascual', '']]","['Bee pollen loads', 'authentication', 'multi-classification', 'computer vision  Short title']"
17410,1609.03897,Reza Faghih Mirzaee,"Reza Faghih Mirzaee, Niloofar Farahani","Design of a Ternary Edge-Triggered D Flip-Flap-Flop for Multiple-Valued
  Sequential Logic","9 Pages, 7 Figures, 5 Tables",,,,cs.AR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Development of large computerized systems requires both combinational and
sequential circuits. Registers and counters are two important examples of
sequential circuits, which are widely used in practical applications like CPUs.
The basic element of sequential logic is Flip-Flop, which stores an input value
and returns two outputs (Q and Q_bar). This paper presents an innovative
ternary D Flip-Flap-Flop, which offers circuit designers to customize their
design by eliminating one of the outputs if it is not required. This unique
feature of the new design leads to considerable power reduction in comparison
with the previously presented structures. The proposed design is simulated and
tested by HSPICE and 45 nm CMOS technology.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2016 15:33:06 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Mar 2017 18:33:06 GMT'}, {'version': 'v3', 'created': 'Fri, 10 Mar 2017 16:15:21 GMT'}]",2017-03-13,"[['Mirzaee', 'Reza Faghih', ''], ['Farahani', 'Niloofar', '']]","['D Flip-Flop', 'Multiple-Valued Logic', 'Sequential Logic', 'Ternary Flip-Flop', 'Ternary Flip-Flap-Flop', 'Ternary Latch']"
17411,1209.1224,Nilanjan  Dey,"Nilanjan Dey, Achintya Das, Sheli Sinha Chaudhuri","Wavelet Based Normal and Abnormal Heart Sound Identification using
  Spectrogram Analysis","7 pages, 13 figures","International Journal of Computer Science & Engineering Technology
  (IJCSET), Vol. 3 No. 6 June 2012, ISSN : 2229-3345",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The present work proposes a computer-aided normal and abnormal heart sound
identification based on Discrete Wavelet Transform (DWT), it being useful for
tele-diagnosis of heart diseases. Due to the presence of Cumulative Frequency
components in the spectrogram, DWT is applied on the spectro-gram up to n level
to extract the features from the individual approximation components. One
dimensional feature vector is obtained by evaluating the Row Mean of the
approximation components of these spectrograms. For this present approach, the
set of spectrograms has been considered as the database, rather than raw sound
samples. Minimum Euclidean distance is computed between feature vector of the
test sample and the feature vectors of the stored samples to identify the heart
sound. By applying this algorithm, almost 82% of accuracy was achieved.
","[{'version': 'v1', 'created': 'Thu, 6 Sep 2012 08:37:44 GMT'}]",2012-09-11,"[['Dey', 'Nilanjan', ''], ['Das', 'Achintya', ''], ['Chaudhuri', 'Sheli Sinha', '']]","['Discrete Wavelet Transform (DWT)', 'Spectrogram', 'Euclidean distance', 'Heart Sound']"
17412,1208.6137,Deepak Kumar,"Deepak Kumar, M N Anil Prasad and A G Ramakrishnan",Benchmarking recognition results on word image datasets,"16 pages, 4 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We have benchmarked the maximum obtainable recognition accuracy on various
word image datasets using manual segmentation and a currently available
commercial OCR. We have developed a Matlab program, with graphical user
interface, for semi-automated pixel level segmentation of word images. We
discuss the advantages of pixel level annotation. We have covered five
databases adding up to over 3600 word images. These word images have been
cropped from camera captured scene, born-digital and street view images. We
recognize the segmented word image using the trial version of Nuance Omnipage
OCR. We also discuss, how the degradations introduced during acquisition or
inaccuracies introduced during creation of word images affect the recognition
of the word present in the image. Word images for different kinds of
degradations and correction for slant and curvy nature of words are also
discussed. The word recognition rates obtained on ICDAR 2003, Sign evaluation,
Street view, Born-digital and ICDAR 2011 datasets are 83.9%, 89.3%, 79.6%,
88.5% and 86.7% respectively.
","[{'version': 'v1', 'created': 'Thu, 30 Aug 2012 11:24:44 GMT'}]",2012-08-31,"[['Kumar', 'Deepak', ''], ['Prasad', 'M N Anil', ''], ['Ramakrishnan', 'A G', '']]","['word images', 'pixel level segmentation', 'annotation', 'graphical user interface', 'word recognition', 'benchmarking', 'scenic images', 'borndigital images']"
17413,1401.5934,Sufyan Faraj,"Muhammad Adnan Khan, Muhammad Umair, Muhammad Aamer Saleem Choudry","Accelerated Assistant to SubOptimum Receiver for Multi Carrier Code
  Division Multiple Access System",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Multiple Input Multiple output system are considered to be the strongest
candidate for the maximum utilization of available bandwidth. In this paper,
the MIMO system with the combination of Multi-Carrier Code Division Multiple
Access and Space Time Coding using the Alamoutis scheme is considered. A
Genetic Algorithm based receiver with an exceptional relationship between
filter weights while detecting symbols is proposed. This scheme has better
Convergence Rate and Bit Error Rate than the Fast-LMS Adaptive receiver.
","[{'version': 'v1', 'created': 'Thu, 23 Jan 2014 10:58:50 GMT'}]",2014-01-24,"[['Khan', 'Muhammad Adnan', ''], ['Umair', 'Muhammad', ''], ['Choudry', 'Muhammad Aamer Saleem', '']]","['MIMO', 'MC-CDMA', 'STBC', 'GA', 'BER', 'Convergence Rate']"
17414,1505.05768,Emanuela Merelli,"Emanuela Merelli, Matteo Rucco, Peter Sloot, and Luca Tesei","Topological characterization of S[B] systems: From data to models of
  complexity","26 pages, 10 figures",,,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a methodology for deriving a model of a complex
system by exploiting the information extracted from Topological Data Analysis.
Central to our approach is the S[B] paradigm in which a complex system is
represented by a two-level model. One level, the structural S one, is derived
using the newly introduced quantitative concept of Persistent Entropy. The
other level, the behavioral B one, is characterized by a network of interacting
computational agents described by a Higher Dimensional Automaton. The
methodology yields also a representation of the evolution of the derived
two-level model as a Persistent Entropy Automaton. The presented methodology is
applied to a real case study, the Idiotypic Network of the mammal immune
system.
","[{'version': 'v1', 'created': 'Thu, 21 May 2015 15:27:46 GMT'}, {'version': 'v2', 'created': 'Mon, 25 May 2015 16:14:41 GMT'}]",2015-05-26,"[['Merelli', 'Emanuela', ''], ['Rucco', 'Matteo', ''], ['Sloot', 'Peter', ''], ['Tesei', 'Luca', '']]","['Topological Data Analysis', 'Persistent Entropy', 'Transition Systems', 'Higher Dimensional Automata', 'Immune System', 'Complex Systems', 'Computational Agents']"
17415,1606.07873,Jacob Walker,"Jacob Walker, Carl Doersch, Abhinav Gupta, and Martial Hebert","An Uncertain Future: Forecasting from Static Images using Variational
  Autoencoders",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a given scene, humans can often easily predict a set of immediate future
events that might happen. However, generalized pixel-level anticipation in
computer vision systems is difficult because machine learning struggles with
the ambiguity inherent in predicting the future. In this paper, we focus on
predicting the dense trajectory of pixels in a scene, specifically what will
move in the scene, where it will travel, and how it will deform over the course
of one second. We propose a conditional variational autoencoder as a solution
to this problem. In this framework, direct inference from the image shapes the
distribution of possible trajectories, while latent variables encode any
necessary information that is not available in the image. We show that our
method is able to successfully predict events in a wide variety of scenes and
can produce multiple different predictions when the future is ambiguous. Our
algorithm is trained on thousands of diverse, realistic videos and requires
absolutely no human labeling. In addition to non-semantic action prediction, we
find that our method learns a representation that is applicable to semantic
vision tasks.
","[{'version': 'v1', 'created': 'Sat, 25 Jun 2016 05:56:46 GMT'}]",2016-06-28,"[['Walker', 'Jacob', ''], ['Doersch', 'Carl', ''], ['Gupta', 'Abhinav', ''], ['Hebert', 'Martial', '']]","['Generative Models', 'Variational Autoencoders', 'Scene Understanding', 'Action Forecasting']"
17416,1710.02511,Hao Li,Hao Li and Zhijian Liu,"Performance Prediction and Optimization of Solar Water Heater via a
  Knowledge-Based Machine Learning Method",20 pages,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Measuring the performance of solar energy and heat transfer systems requires
a lot of time, economic cost and manpower. Meanwhile, directly predicting their
performance is challenging due to the complicated internal structures.
Fortunately, a knowledge-based machine learning method can provide a promising
prediction and optimization strategy for the performance of energy systems. In
this Chapter, the authors will show how they utilize the machine learning
models trained from a large experimental database to perform precise prediction
and optimization on a solar water heater (SWH) system. A new energy system
optimization strategy based on a high-throughput screening (HTS) process is
proposed. This Chapter consists of: i) Comparative studies on varieties of
machine learning models (artificial neural networks (ANNs), support vector
machine (SVM) and extreme learning machine (ELM)) to predict the performances
of SWHs; ii) Development of an ANN-based software to assist the quick
prediction and iii) Introduction of a computational HTS method to design a
high-performance SWH system.
","[{'version': 'v1', 'created': 'Fri, 6 Oct 2017 17:39:32 GMT'}]",2017-10-09,"[['Li', 'Hao', ''], ['Liu', 'Zhijian', '']]","['Machine Learning', 'Solar Water Heater', 'Artificial Neural Network', 'Support Vector Machine', 'Software', 'Prediction', 'Optimization', 'High-Throughput Screening']"
17417,1408.0384,Chhaya Trehan,Shay Kutten and Chhaya Trehan,"Fast and Compact Distributed Verification and Self-Stabilization of a
  DFS Tree",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present algorithms for distributed verification and silent-stabilization
of a DFS(Depth First Search) spanning tree of a connected network. Computing
and maintaining such a DFS tree is an important task, e.g., for constructing
efficient routing schemes. Our algorithm improves upon previous work in various
ways. Comparable previous work has space and time complexities of $O(n\log
\Delta)$ bits per node and $O(nD)$ respectively, where $\Delta$ is the highest
degree of a node, $n$ is the number of nodes and $D$ is the diameter of the
network. In contrast, our algorithm has a space complexity of $O(\log n)$ bits
per node, which is optimal for silent-stabilizing spanning trees and runs in
$O(n)$ time. In addition, our solution is modular since it utilizes the
distributed verification algorithm as an independent subtask of the overall
solution. It is possible to use the verification algorithm as a stand alone
task or as a subtask in another algorithm. To demonstrate the simplicity of
constructing efficient DFS algorithms using the modular approach, We also
present a (non-sielnt) self-stabilizing DFS token circulation algorithm for
general networks based on our silent-stabilizing DFS tree. The complexities of
this token circulation algorithm are comparable to the known ones.
","[{'version': 'v1', 'created': 'Sat, 2 Aug 2014 15:19:46 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Dec 2014 22:18:10 GMT'}]",2014-12-19,"[['Kutten', 'Shay', ''], ['Trehan', 'Chhaya', '']]","['Fault Tolerance', 'Self-* Solutions', 'Silent-Stabilization', 'DFS', 'Spanning Trees']"
17418,1305.7057,Sahar Mokhtar,Sahar A. Mokhtar and Alaa. M. Elsayad,Predicting the Severity of Breast Masses with Data Mining Methods,,"International Journal of Computer Science Issues (IJCSI) March
  2013 Issue (Volume 10, Issue 2)",,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mammography is the most effective and available tool for breast cancer
screening. However, the low positive predictive value of breast biopsy
resulting from mammogram interpretation leads to approximately 70% unnecessary
biopsies with benign outcomes. Data mining algorithms could be used to help
physicians in their decisions to perform a breast biopsy on a suspicious lesion
seen in a mammogram image or to perform a short term follow-up examination
instead. In this research paper data mining classification algorithms; Decision
Tree (DT), Artificial Neural Network (ANN), and Support Vector Machine (SVM)
are analyzed on mammographic masses data set. The purpose of this study is to
increase the ability of physicians to determine the severity (benign or
malignant) of a mammographic mass lesion from BI-RADS attributes and the
patient,s age. The whole data set is divided for training the models and test
them by the ratio of 70:30% respectively and the performances of classification
algorithms are compared through three statistical measures; sensitivity,
specificity, and classification accuracy. Accuracy of DT, ANN and SVM are
78.12%, 80.56% and 81.25% of test samples respectively. Our analysis shows that
out of these three classification models SVM predicts severity of breast cancer
with least error rate and highest accuracy.
","[{'version': 'v1', 'created': 'Thu, 30 May 2013 10:44:41 GMT'}]",2013-06-04,"[['Mokhtar', 'Sahar A.', ''], ['Elsayad', 'Alaa. M.', '']]","['Breast cancer', 'data mining', 'decision tree', 'neural network', 'support vector machine']"
17419,0906.5039,R Doomun,"Ahmed Ben Jmaa, Walid Mahdi, Yousra Ben Jemaa, Abdelmajid Ben Hamadou",A new approach for digit recognition based on hand gesture analysis,"8 Pages, International Journal of Computer Science and Information
  Security","IJCSIS June 2009 Issue, Vol. 2, No. 1",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present in this paper a new approach for hand gesture analysis that allows
digit recognition. The analysis is based on extracting a set of features from a
hand image and then combining them by using an induction graph. The most
important features we extract from each image are the fingers locations, their
heights and the distance between each pair of fingers. Our approach consists of
three steps: (i) Hand detection and localization, (ii) fingers extraction and
(iii) features identification and combination to digit recognition. Each input
image is assumed to contain only one person, thus we apply a fuzzy classifier
to identify the skin pixels. In the finger extraction step, we attempt to
remove all the hand components except the fingers, this process is based on the
hand anatomy properties. The final step consists on representing histogram of
the detected fingers in order to extract features that will be used for digit
recognition. The approach is invariant to scale, rotation and translation of
the hand. Some experiments have been undertaken to show the effectiveness of
the proposed approach.
","[{'version': 'v1', 'created': 'Sat, 27 Jun 2009 04:46:23 GMT'}]",2009-06-30,"[['Jmaa', 'Ahmed Ben', ''], ['Mahdi', 'Walid', ''], ['Jemaa', 'Yousra Ben', ''], ['Hamadou', 'Abdelmajid Ben', '']]","['Sign language', 'keyboard application', 'digits recognition']"
17420,1506.00944,Fabio Protti,"Maise Dantas da Silva, F\'abio Protti, Jayme Luiz Szwarcfiter",Parameterized mixed cluster editing via modular decomposition,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we introduce a natural generalization of the well-known
problems Cluster Editing and Bicluster Editing, whose parameterized versions
have been intensively investigated in the recent literature. The generalized
problem, called Mixed Cluster Editing or ${\cal M}$-Cluster Editing, is
formulated as follows. Let ${\cal M}$ be a family of graphs. Given a graph $G$
and a nonnegative integer $k$, transform $G$, through a sequence of at most $k$
edge editions, into a target graph $G'$ with the following property: $G'$ is a
vertex-disjoint union of graphs $G_1, G_2, \ldots$ such that every $G_i$ is a
member of ${\cal M}$. The graph $G'$ is called a mixed cluster graph or ${\cal
M}$-cluster graph. Let ${\cal K}$ denote the family of complete graphs, ${\cal
KL}$ the family of complete $l$-partite graphs ($l \geq 2$), and $\L={\cal K}
\cup {\cal KL}$. In this work we focus on the case ${\cal M} = {\cal L}$. Using
modular decomposition techniques previously applied to Cluster/Bicluster
Editing, we present a linear-time algorithm to construct a problem kernel for
the parameterized version of ${\cal L}$-Cluster Editing. Keywords: bicluster
graphs, cluster graphs, edge edition problems, edge modification problems,
fixed-parameter tractability, NP-complete problems.
","[{'version': 'v1', 'created': 'Tue, 2 Jun 2015 16:22:46 GMT'}]",2015-06-03,"[['da Silva', 'Maise Dantas', ''], ['Protti', 'Fábio', ''], ['Szwarcfiter', 'Jayme Luiz', '']]","['bicluster graphs', 'cluster graphs', 'edge edition problems', 'edge modification problems', 'fixed-parameter tractability', 'NP-complete problems']"
17421,1510.05572,Jan Leike,Jan Leike and Marcus Hutter,On the Computability of AIXI,UAI 2015,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  How could we solve the machine learning and the artificial intelligence
problem if we had infinite computation? Solomonoff induction and the
reinforcement learning agent AIXI are proposed answers to this question. Both
are known to be incomputable. In this paper, we quantify this using the
arithmetical hierarchy, and prove upper and corresponding lower bounds for
incomputability. We show that AIXI is not limit computable, thus it cannot be
approximated using finite computation. Our main result is a limit-computable
{\epsilon}-optimal version of AIXI with infinite horizon that maximizes
expected rewards.
","[{'version': 'v1', 'created': 'Mon, 19 Oct 2015 16:31:37 GMT'}]",2015-10-20,"[['Leike', 'Jan', ''], ['Hutter', 'Marcus', '']]","['AIXI', 'Solomonoff induction', 'general reinforcement learning', 'computability', 'complexity', 'arithmetical hierarchy', 'universal Turing machine']"
17422,1712.06568,Joel Lehman,"Joel Lehman, Jay Chen, Jeff Clune, Kenneth O. Stanley",ES Is More Than Just a Traditional Finite-Difference Approximator,,,,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An evolution strategy (ES) variant based on a simplification of a natural
evolution strategy recently attracted attention because it performs
surprisingly well in challenging deep reinforcement learning domains. It
searches for neural network parameters by generating perturbations to the
current set of parameters, checking their performance, and moving in the
aggregate direction of higher reward. Because it resembles a traditional
finite-difference approximation of the reward gradient, it can naturally be
confused with one. However, this ES optimizes for a different gradient than
just reward: It optimizes for the average reward of the entire population,
thereby seeking parameters that are robust to perturbation. This difference can
channel ES into distinct areas of the search space relative to gradient
descent, and also consequently to networks with distinct properties. This
unique robustness-seeking property, and its consequences for optimization, are
demonstrated in several domains. They include humanoid locomotion, where
networks from policy gradient-based reinforcement learning are significantly
less robust to parameter perturbation than ES-based policies solving the same
task. While the implications of such robustness and robustness-seeking remain
open to further study, this work's main contribution is to highlight such
differences and their potential importance.
","[{'version': 'v1', 'created': 'Mon, 18 Dec 2017 18:25:35 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Jan 2018 18:36:12 GMT'}, {'version': 'v3', 'created': 'Tue, 1 May 2018 20:29:42 GMT'}]",2018-05-03,"[['Lehman', 'Joel', ''], ['Chen', 'Jay', ''], ['Clune', 'Jeff', ''], ['Stanley', 'Kenneth O.', '']]","['Evolution strategies', 'finite differences', 'robustness', 'neuroevolution']"
17423,1712.05674,Zai Yang,"Zai Yang, Jinhui Tang, Yonina C. Eldar, and Lihua Xie","On the Sample Complexity of Multichannel Frequency Estimation via Convex
  Optimization","14 pages, double column, to appear in IEEE Trans. Information Theory",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of multichannel data in line spectral estimation (or frequency
estimation) is common for improving the estimation accuracy in array
processing, structural health monitoring, wireless communications, and more.
Recently proposed atomic norm methods have attracted considerable attention due
to their provable superiority in accuracy, flexibility and robustness compared
with conventional approaches. In this paper, we analyze atomic norm
minimization for multichannel frequency estimation from noiseless compressive
data, showing that the sample size per channel that ensures exact estimation
decreases with the increase of the number of channels under mild conditions. In
particular, given $L$ channels, order $K\left(\log K\right)
\left(1+\frac{1}{L}\log N\right)$ samples per channel, selected randomly from
$N$ equispaced samples, suffice to ensure with high probability exact
estimation of $K$ frequencies that are normalized and mutually separated by at
least $\frac{4}{N}$. Numerical results are provided corroborating our analysis.
","[{'version': 'v1', 'created': 'Fri, 15 Dec 2017 13:51:32 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Oct 2018 08:09:45 GMT'}]",2018-10-15,"[['Yang', 'Zai', ''], ['Tang', 'Jinhui', ''], ['Eldar', 'Yonina C.', ''], ['Xie', 'Lihua', '']]","['Multichannel frequency estimation', 'atomicnorm', 'convex optimization', 'sample complexity', 'average caseanalysis', 'compressed sensing']"
17424,1301.2785,Rafi Muhammad,"Muhammad Rafi, Mohammad Shahid Shaikh",A comparison of SVM and RVM for Document Classification,"ICoCSIM 2012, Medan Indonesia",,,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Document classification is a task of assigning a new unclassified document to
one of the predefined set of classes. The content based document classification
uses the content of the document with some weighting criteria to assign it to
one of the predefined classes. It is a major task in library science,
electronic document management systems and information sciences. This paper
investigates document classification by using two different classification
techniques (1) Support Vector Machine (SVM) and (2) Relevance Vector Machine
(RVM). SVM is a supervised machine learning technique that can be used for
classification task. In its basic form, SVM represents the instances of the
data into space and tries to separate the distinct classes by a maximum
possible wide gap (hyper plane) that separates the classes. On the other hand
RVM uses probabilistic measure to define this separation space. RVM uses
Bayesian inference to obtain succinct solution, thus RVM uses significantly
fewer basis functions. Experimental studies on three standard text
classification datasets reveal that although RVM takes more training time, its
classification is much better as compared to SVM.
","[{'version': 'v1', 'created': 'Sun, 13 Jan 2013 15:58:09 GMT'}]",2013-01-15,"[['Rafi', 'Muhammad', ''], ['Shaikh', 'Mohammad Shahid', '']]","['Document classification', 'Support Vector Machine (SVM)', 'Relevance Vector  Machine(RVM)']"
17425,1407.6506,Reza Azad,"Reza Azad, Hamid Reza Shayegh","Novel and Tuneable Method for Skin Detection Based on Hybrid Color Space
  and Color Statistical Features","2013 First International Conference on computer, Information
  Technology and Digital Media. arXiv admin note: substantial text overlap with
  arXiv:1407.6318",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Skin detection is one of the most important and primary stages in some of
image processing applications such as face detection and human tracking. So
far, many approaches are proposed to done this case. Near all of these methods
have tried to find best match intensity distribution with skin pixels based on
popular color spaces such as RGB, CMYK or YCbCr. Results show these methods
cannot provide an accurate approach for every kinds of skin. In this paper, an
approach is proposed to solve this problem using statistical features
technique. This approach is including two stages. In the first one, from pure
skin statistical features were extracted and at the second stage, the skin
pixels are detected using HSV and YCbCr color spaces. In the result part, the
proposed approach is applied on FEI database and the accuracy rate reached
99.25 + 0.2. Further proposed method is applied on complex background database
and accuracy rate obtained 95.40+0.31%. The proposed approach can be used for
all kinds of skin using train stage which is the main advantages of it. Low
noise sensitivity and low computational complexity are some of other
advantages.
","[{'version': 'v1', 'created': 'Thu, 24 Jul 2014 09:31:13 GMT'}]",2014-07-25,"[['Azad', 'Reza', ''], ['Shayegh', 'Hamid Reza', '']]","['Skin detection', 'HSV', 'YCbCr', 'Hybrid color space', 'Statistical features']"
17426,1111.2391,Vijaya Lakshmi,"B. Vijayalakshmi, V. Subbiah Bharathi",A Novel Approach to Texture classification using statistical feature,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Texture is an important spatial feature which plays a vital role in content
based image retrieval. The enormous growth of the internet and the wide use of
digital data have increased the need for both efficient image database creation
and retrieval procedure. This paper describes a new approach for texture
classification by combining statistical texture features of Local Binary
Pattern and Texture spectrum. Since most significant information of a texture
often appears in the high frequency channels, the features are extracted by the
computation of LBP and Texture Spectrum and Legendre Moments. Euclidean
distance is used for similarity measurement. The experimental result shows that
97.77% classification accuracy is obtained by the proposed method.
","[{'version': 'v1', 'created': 'Thu, 10 Nov 2011 04:28:08 GMT'}]",2011-11-11,"[['Vijayalakshmi', 'B.', ''], ['Bharathi', 'V. Subbiah', '']]","['Texture features', 'Local Binary Pattern', 'Texture Spectrum', 'Legendre Moment', 'Similarity measure']"
17427,1407.6295,Xavier Vila\c{c}a,Xavier Vilaca and Luis Rodrigues,"On the Range of Equilibria Utilities of a Repeated Epidemic
  Dissemination Game with a Mediator","14 pages, 2 algorithms, accepted in ICDCN'15, proofs of D4 and D5
  improved, improved definition of Non-disclosure",,,,cs.DC cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider eager-push epidemic dissemination in a complete graph. Time is
divided into synchronous stages. In each stage, a source disseminates $\nu$
events. Each event is sent by the source, and forwarded by each node upon its
first reception, to $f$ nodes selected uniformly at random, where $f$ is the
fanout. We use Game Theory to study the range of $f$ for which equilibria
strategies exist, assuming that players are either rational or obedient to the
protocol, and that they do not collude. We model interactions as an infinitely
repeated game. We devise a monitoring mechanism that extends the repeated game
with communication rounds used for exchanging monitoring information, and
define strategies for this extended game. We assume the existence of a trusted
mediator, that players are computationally bounded such that they cannot break
the cryptographic primitives used in our mechanism, and that symmetric
ciphering is cheap. Under these assumptions, we show that, if the size of the
stream is sufficiently large and players attribute enough value to future
utilities, then the defined strategies are Sequential Equilibria of the
extended game for any value of $f$. Moreover, the utility provided to each
player is arbitrarily close to that provided in the original game. This shows
that we can persuade rational nodes to follow a dissemination protocol that
uses any fanout, while arbitrarily minimising the relative overhead of
monitoring.
","[{'version': 'v1', 'created': 'Wed, 23 Jul 2014 17:02:58 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Jul 2014 09:07:38 GMT'}, {'version': 'v3', 'created': 'Sun, 19 Oct 2014 19:03:07 GMT'}]",2014-10-21,"[['Vilaca', 'Xavier', ''], ['Rodrigues', 'Luis', '']]","['epidemic dissemination', 'repeated games', 'monitoring']"
17428,1109.6442,Ankit Chaudhary,"Ankit Chaudhary, Jagdish L. Raheja",ABHIVYAKTI: A Vision Based Intelligent System for Elder and Sick Persons,"Proceedings of 3rd IEEE International Conference on Machine Vision,
  Hong Kong, ICMV 2010
  (http://www.ieee.org/conferences_events/conferences/conferencedetails/index.html?Conf_ID=18047),
  28-30 Dec, 2010, pp. 361-364",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes an intelligent system ABHIVYAKTI, which would be
pervasive in nature and based on the Computer Vision. It would be very easy in
use and deployment. Elder and sick people who are not able to talk or walk,
they are dependent on other human beings and need continuous monitoring, while
our system provides flexibility to the sick or elder person to announce his or
her need to their caretaker by just showing a particular gesture with the
developed system, if the caretaker is not nearby. This system will use
fingertip detection techniques for acquiring gesture and Artificial Neural
Networks (ANNs) will be used for gesture recognition.
","[{'version': 'v1', 'created': 'Thu, 29 Sep 2011 08:59:29 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Oct 2011 08:32:23 GMT'}]",2011-10-24,"[['Chaudhary', 'Ankit', ''], ['Raheja', 'Jagdish L.', '']]","['Human Computer Interaction', 'elder monitoring systems', 'Computer Vision', 'image processing', 'Gesture']"
17429,1407.5732,Sonali Gupta,"Sonali Gupta, Komal Kumar Bhatia",A Comparative Study of Hidden Web Crawlers,"8 pages, 8 figures","Vol 12 number 3 , Jun 2014 V12(3):111-118",,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A large amount of data on the WWW remains inaccessible to crawlers of Web
search engines because it can only be exposed on demand as users fill out and
submit forms. The Hidden web refers to the collection of Web data which can be
accessed by the crawler only through an interaction with the Web-based search
form and not simply by traversing hyperlinks. Research on Hidden Web has
emerged almost a decade ago with the main line being exploring ways to access
the content in online databases that are usually hidden behind search forms.
The efforts in the area mainly focus on designing hidden Web crawlers that
focus on learning forms and filling them with meaningful values. The paper
gives an insight into the various Hidden Web crawlers developed for the purpose
giving a mention to the advantages and shortcoming of the techniques employed
in each.
","[{'version': 'v1', 'created': 'Tue, 22 Jul 2014 05:25:53 GMT'}]",2014-07-23,"[['Gupta', 'Sonali', ''], ['Bhatia', 'Komal Kumar', '']]","['WWW', 'Surface Web', 'Hidden Web', 'Deep Web', 'Crawler', 'search form', 'Surfacing', 'Virtual Integration']"
17430,0801.1415,Dietrich Stauffer,S. Wichmann,The emerging field of language dynamics,,,,,cs.CL physics.soc-ph,,"  A simple review by a linguist, citing many articles by physicists:
Quantitative methods, agent-based computer simulations, language dynamics,
language typology, historical linguistics
","[{'version': 'v1', 'created': 'Wed, 9 Jan 2008 12:34:40 GMT'}]",2008-01-10,"[['Wichmann', 'S.', '']]","['Quantitative methods', 'agent-based computer simulations', 'language dynamics', 'language']"
17431,1410.2828,Omar Alonso,"Omar Alonso, Vasilis Kandylas",A Study on Placement of Social Buttons in Web Pages,,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the explosion of social media in the last few years, web pages nowadays
include different social network buttons where users can express if they
support or recommend content. Those social buttons are very visual and their
presentations, along with the counters, mark the importance of the social
network and the interest on the content. In this paper, we analyze the presence
of four types of social buttons (Facebook, Twitter, Google+1, and LinkedIn) in
a large collection of web pages that we tracked over a period of time. We
report on the distribution and counts along with some characteristics per
domain. Finally, we outline some research directions.
","[{'version': 'v1', 'created': 'Fri, 10 Oct 2014 16:12:20 GMT'}]",2014-10-13,"[['Alonso', 'Omar', ''], ['Kandylas', 'Vasilis', '']]","['Social buttons', 'Social search', 'Facebook', 'Twitter', 'LinkedIn', 'Google+']"
17432,1008.1328,Zeeshan Ahmed Mr.,Zeeshan Ahmed and Detlef Gerhard,"Semantic Oriented Agent based Approach towards Engineering Data
  Management, Web Information Retrieval and User System Communication Problems","In the proceedings of 3rd International Conference for Internet
  Technology and Secured Transactions, Dublin Institute of Technology, ICITST
  08, June 23-28, pp 19-22 Dublin Ireland, 2008",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The four intensive problems to the software rose by the software industry
.i.e., User System Communication / Human Machine Interface, Meta Data
extraction, Information processing & management and Data representation are
discussed in this research paper. To contribute in the field we have proposed
and described an intelligent semantic oriented agent based search engine
including the concepts of intelligent graphical user interface, natural
language based information processing, data management and data reconstruction
for the final user end information representation.
","[{'version': 'v1', 'created': 'Sat, 7 Aug 2010 12:08:43 GMT'}]",2010-08-10,"[['Ahmed', 'Zeeshan', ''], ['Gerhard', 'Detlef', '']]","['Agent', 'Information\xa0Engineering', 'Search', 'Semantic']"
17433,1708.00979,Yi Janet Lu,Yi Janet Lu,New Results on the DMC Capacity and Renyi's Divergence,"Part of the material was presented at the 2nd International Workshop
  on Boolean Functions and their Applications (BFA), Sosltrand, Norway, July
  3-8, 2017",,,,cs.CR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work is part of a project ""Walsh Spectrum Analysis and the Cryptographic
Applications"". The project initiates the study of finding the largest (and/or
significantly large) Walsh coefficients as well as the index positions of an
unknown distribution by random sampling. This proposed problem has great
significance in cryptography and communications.
  In early 2015, Yi JANET Lu first constructed novel imaginary channel
transition matrices and introduced Shannon's channel coding problem to
statistical cryptanalysis. For the first time, the channel capacity results of
well-chosen transition matrices, which might be impossible to calculate
traditionally, become of hottest research focus. For a few Discrete Memoryless
Channels (DMCs), it is known that the capacity can be computed analytically; in
general, there is no closed-form solution. This work is concerned with
analytical results of channel capacity in the new setting. We study both the
Blahut-Arimoto algorithm (which gave the first numerical solution historically)
and the most recent results [Sutter et al'2014] for the transition matrix of
$N\times M$. For an $\epsilon$-approximation (i.e., the desired absolute
accuracy of the approximate solution) of the capacity, the former has the
computational complexity $ O(MN^2 \log N/\epsilon) $, while the latter has the
complexity $ O(M^2N\sqrt{\log N}/\epsilon) $. We also study the relation of
Renyi's divergence of degree $1/2$ and the generalized channel capacity of
degree $1/2$.
","[{'version': 'v1', 'created': 'Thu, 3 Aug 2017 03:01:25 GMT'}]",2017-08-04,"[['Lu', 'Yi Janet', '']]","['DMC', 'Channel capacity', 'Blahut-Arimoto algorithm', 'Transition matrix construction', 'Statistical cryptanalysis', 'Renyi’s divergence']"
17434,1609.02976,Nhien-An Le-Khac,"Fan Cai, Nhien-An Le-Khac, M-T. Kechadi",An Integrated Classification Model for Financial Data Mining,,,,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, financial data analysis is becoming increasingly important in the
business market. As companies collect more and more data from daily operations,
they expect to extract useful knowledge from existing collected data to help
make reasonable decisions for new customer requests, e.g. user credit category,
churn analysis, real estate analysis, etc. Financial institutes have applied
different data mining techniques to enhance their business performance.
However, simple ap-proach of these techniques could raise a performance issue.
Besides, there are very few general models for both understanding and
forecasting different finan-cial fields. We present in this paper a new
classification model for analyzing fi-nancial data. We also evaluate this model
with different real-world data to show its performance.
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2016 23:45:19 GMT'}]",2016-09-13,"[['Cai', 'Fan', ''], ['Le-Khac', 'Nhien-An', ''], ['Kechadi', 'M-T.', '']]","['Data mining', 'decision tree', 'multilayer perceptron', 'Gaussian Process', 'classification model']"
17435,0908.2744,Manish Gupta,"Anshul Chaurasia, Sudhanshu Dwivedi, Prateek Jain and Manish K. Gupta",XTile: An Error-Correction Package for DNA Self-Assembly,"5 pages, FNANO 2009 conference paper, The tool XTile is available for
  download and use at http://www.guptalab.org/xtile","Proceedings of 6th Annual Conference on Foundations of Nanoscience
  (FNANO 09): Self-Assembled Architectures and Devices, Salt Lake City, Utah,
  U.S.A., 20th-24th April 2009, pp. 225 - 229",,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self assembly is a process by which supramolecular species form spontaneously
from their components. This process is ubiquitous throughout the life chemistry
and is central to biological information processing. It has been predicted that
in future self assembly will become an important engineering discipline by
combining the fields of bio molecular computation, nano technology and
medicine. However error control is a key challenge in realizing the potential
of self assembly. Recently many authors have proposed several combinatorial
error correction schemes to control errors which have a close analogy with the
coding theory such as Winfree s proofreading scheme and its generalizations by
Chen and Goel and compact scheme of Reif, Sahu and Yin. In this work, we
present an error correction computational tool XTile that can be used to create
input files to the Xgrow simulator of Winfree by providing the design logic of
the tiles and it also allows the user to apply proofreading, snake and compact
error correction schemes.
","[{'version': 'v1', 'created': 'Wed, 19 Aug 2009 13:02:57 GMT'}]",2009-08-20,"[['Chaurasia', 'Anshul', ''], ['Dwivedi', 'Sudhanshu', ''], ['Jain', 'Prateek', ''], ['Gupta', 'Manish K.', '']]","['DNA self-assembly', 'error-correction', 'algorithmic self-assembly', 'Wang tile', 'DNA computing', 'Xgrow', 'XTile']"
17436,1712.06899,Ludmila Kuncheva,"Ludmila I. Kuncheva, Paria Yousefi, and Iain A. D. Gunn",On the Evaluation of Video Keyframe Summaries using User Ground Truth,"12 pages, 10 figures, 2 tables",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given the great interest in creating keyframe summaries from video, it is
surprising how little has been done to formalise their evaluation and
comparison. User studies are often carried out to demonstrate that a proposed
method generates a more appealing summary than one or two rival methods. But
larger comparison studies cannot feasibly use such user surveys. Here we
propose a discrimination capacity measure as a formal way to quantify the
improvement over the uniform baseline, assuming that one or more ground truth
summaries are available. Using the VSUMM video collection, we examine 10 video
feature types, including CNN and SURF, and 6 methods for matching frames from
two summaries. Our results indicate that a simple frame representation through
hue histograms suffices for the purposes of comparing keyframe summaries. We
subsequently propose a formal protocol for comparing summaries when ground
truth is available.
","[{'version': 'v1', 'created': 'Tue, 19 Dec 2017 12:37:02 GMT'}]",2017-12-20,"[['Kuncheva', 'Ludmila I.', ''], ['Yousefi', 'Paria', ''], ['Gunn', 'Iain A. D.', '']]","['video summarization / summarisation', 'keyframe selection', 'evaluation of summaries', 'F-measure', 'discriminationcapacity']"
17437,1107.3363,Pankaj Sehgal Kumar,Rajender Nath and Pankaj Kumar Sehgal,"SD-AODV: A Protocol for Secure and Dynamic Data Dissemination in Mobile
  Ad Hoc Network","8 pages, 11 figures, 1 table, IJCSI International Journal of Computer
  Science Issues, Vol. 7, Issue 6, November 2010",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security remains as a major concern in the mobile ad hoc networks. This paper
presents a new protocol SD-AODV, which is an extension of the exiting protocol
AODV. The proposed protocol is made secure and dynamic against three main types
of routing attacks- wormhole attack, byzantine attack and blackhole attack.
SD-AODV protocol was evaluated through simulation experiments done on Glomosim
and performance of the network was measured in terms of packet delivery
fraction, average end-to-end delay, global throughput and route errors of a
mobile ad hoc network where a defined percentage of nodes behave maliciously.
Experimentally it was found that the performance of the network did not degrade
in the presence of the above said attacks indicating that the proposed protocol
was secure against these attacks.
","[{'version': 'v1', 'created': 'Mon, 18 Jul 2011 06:34:38 GMT'}]",2011-07-19,"[['Nath', 'Rajender', ''], ['Sehgal', 'Pankaj Kumar', '']]","['Nework Security', 'Routing Attacks', 'Routing Protocol', 'Simulation Experiments']"
17438,1401.5174,Zhi Li,"Zhi Li, Ali C. Begen, Joshua Gahm, Yufeng Shan, Bruce Osler, David
  Oran",Streaming Video over HTTP with Consistent Quality,"Refined version submitted to ACM Multimedia Systems Conference
  (MMSys), 2014",,,,cs.NI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In conventional HTTP-based adaptive streaming (HAS), a video source is
encoded at multiple levels of constant bitrate representations, and a client
makes its representation selections according to the measured network
bandwidth. While greatly simplifying adaptation to the varying network
conditions, this strategy is not the best for optimizing the video quality
experienced by end users. Quality fluctuation can be reduced if the natural
variability of video content is taken into consideration. In this work, we
study the design of a client rate adaptation algorithm to yield consistent
video quality. We assume that clients have visibility into incoming video
within a finite horizon. We also take advantage of the client-side video
buffer, by using it as a breathing room for not only network bandwidth
variability, but also video bitrate variability. The challenge, however, lies
in how to balance these two variabilities to yield consistent video quality
without risking a buffer underrun. We propose an optimization solution that
uses an online algorithm to adapt the video bitrate step-by-step, while
applying dynamic programming at each step. We incorporate our solution into
PANDA -- a practical rate adaptation algorithm designed for HAS deployment at
scale.
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2014 04:35:08 GMT'}]",2014-01-22,"[['Li', 'Zhi', ''], ['Begen', 'Ali C.', ''], ['Gahm', 'Joshua', ''], ['Shan', 'Yufeng', ''], ['Osler', 'Bruce', ''], ['Oran', 'David', '']]","['Adaptation', 'DASH', 'HTTP', 'Video', 'Quality', 'QoE']"
17439,1604.07002,Somaiyeh Mahmoud Zadeh,"Somaiyeh Mahmoud Zadeh, Amir Mehdi Yazdani, Karl Sammut, David M.W
  Powers","AUV Rendezvous Online Path Planning in a Highly Cluttered Undersea
  Environment Using Evolutionary Algorithms",,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, a single autonomous underwater vehicle (AUV) aims to
rendezvous with a submerged leader recovery vehicle through a cluttered and
variable operating field. The rendezvous problem is transformed into a
nonlinear optimal control problem (NOCP) and then numerical solutions are
provided. A penalty function method is utilized to combine the boundary
conditions, vehicular and environmental constraints with the performance index
that is final rendezvous time.Four evolutionary based path planning methods
namely particle swarm optimization (PSO), biogeography-based optimization
(BBO), differential evolution (DE) and Firefly algorithm (FA) are employed to
establish a reactive planner module and provide a numerical solution for the
proposed NOCP. The objective is to synthesize and analysis the performance and
capability of the mentioned methods for guiding an AUV from loitering point
toward the rendezvous place through a comprehensive simulation study.The
proposed planner module entails a heuristic for refining the path considering
situational awareness of underlying environment, encompassing static and
dynamic obstacles overwhelmed in spatiotemporal current vectors.This leads to
accommodate the unforeseen changes in the operating field like emergence of
unpredicted obstacles or variability of current vector filed and turbulent
regions. The simulation results demonstrate the inherent robustness and
significant efficiency of the proposed planner in enhancement of the vehicle's
autonomy in terms of using current force, coping undesired current disturbance
for the desired rendezvous purpose. Advantages and shortcoming of all utilized
methods are also presented based on the obtained results.
","[{'version': 'v1', 'created': 'Sun, 24 Apr 2016 09:25:25 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Jun 2016 23:14:42 GMT'}]",2016-06-17,"[['Zadeh', 'Somaiyeh Mahmoud', ''], ['Yazdani', 'Amir Mehdi', ''], ['Sammut', 'Karl', ''], ['Powers', 'David M. W', '']]","['Rendezvous', 'nonlinear optimal control problem', 'reactive path planning', 'autonomous underwater vehicles', 'evolutionary algorithms']"
17440,1004.3521,Mohsen Toorani,"M. Toorani, A. A. Beheshti",Cryptanalysis of an Elliptic Curve-based Signcryption Scheme,"6 Pages, 2 Figures","International Journal of Network Security, Vol. 10, No. 1, pp.
  51-56, Jan. 2010",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The signcryption is a relatively new cryptographic technique that is supposed
to fulfill the functionalities of encryption and digital signature in a single
logical step. Although several signcryption schemes are proposed over the
years, some of them are proved to have security problems. In this paper, the
security of Han et al.'s signcryption scheme is analyzed, and it is proved that
it has many security flaws and shortcomings. Several devastating attacks are
also introduced to the mentioned scheme whereby it fails all the desired and
essential security attributes of a signcryption scheme.
","[{'version': 'v1', 'created': 'Tue, 20 Apr 2010 18:17:39 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Mar 2012 20:37:05 GMT'}]",2012-03-21,"[['Toorani', 'M.', ''], ['Beheshti', 'A. A.', '']]","['Public key cryptography', 'Elliptic curves', 'Invalid-curve attack', 'Unknown key share attack']"
17441,1712.05359,Jace Robinson,"Jace Robinson, and Derek Doran","Seasonal Stochastic Blockmodeling for Anomaly Detection in Dynamic
  Networks","Working manuscript, to be update before aimed conference submission
  in Spring 2018",,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sociotechnological and geospatial processes exhibit time varying structure
that make insight discovery challenging. To detect abnormal moments in these
processes, a definition of `normal' must be established. This paper proposes a
new statistical model for such systems, modeled as dynamic networks, to address
this challenge. It assumes that vertices fall into one of k types and that the
probability of edge formation at a particular time depends on the types of the
incident nodes and the current time. The time dependencies are driven by unique
seasonal processes, which many systems exhibit (e.g., predictable spikes in
geospatial or web traffic each day). The paper defines the model as a
generative process and an inference procedure to recover the `normal' seasonal
processes from data when they are unknown. An outline of anomaly detection
experiments to be completed over Enron emails and New York City taxi trips is
presented.
","[{'version': 'v1', 'created': 'Thu, 14 Dec 2017 17:38:47 GMT'}]",2017-12-15,"[['Robinson', 'Jace', ''], ['Doran', 'Derek', '']]","['Dynamic Networks', 'Anomaly Detection', 'Kalman Filter', 'Time Series']"
17442,1307.3760,Peter Sasvari,Peter Sasvari,"The Impacts of Using Business Information Systems on Operational
  Effectiveness in Hungary",5 pages,"International Journal of Emerging Research in Management &
  Technology, ISSN: 2278-9359 (Volume-2, Issue-4), 2013",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Business expectations regarding the introduction of business information
systems were investigated according to company size categories. The results
clearly showed that according to the majority of the respondents the
information supply for decision-makers improved. In contrast, business
information systems as a means of improving competitiveness were only regarded
by corporations, this aspect was only around the average in the other company
size categories. The respondents evaluated to what extent the usage of business
information system provided assistance for their economic analyses. The
obtained results show that business information systems can be utilized well in
controlling and reporting. There are differences in their judgement by size
categories. Particularly corporations can take advantage of the support of
business information systems mainly in the field of planning, plan-actual
analysis and the exploration of cost reducing possibilities.
","[{'version': 'v1', 'created': 'Sun, 14 Jul 2013 17:42:43 GMT'}]",2013-07-16,"[['Sasvari', 'Peter', '']]","['Business Information Systems', 'Hungary', 'micro', 'small', 'medium-sized enterprises']"
17443,1305.6555,Sandor P. Fekete,"Michael A. Bender and Martin Farach-Colton and S\'andor P. Fekete and
  Jeremy T. Fineman and Seth Gilbert",Reallocation Problems in Scheduling,"9 oages, 1 table; extended abstract version to appear in SPAA 2013",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In traditional on-line problems, such as scheduling, requests arrive over
time, demanding available resources. As each request arrives, some resources
may have to be irrevocably committed to servicing that request. In many
situations, however, it may be possible or even necessary to reallocate
previously allocated resources in order to satisfy a new request. This
reallocation has a cost. This paper shows how to service the requests while
minimizing the reallocation cost. We focus on the classic problem of scheduling
jobs on a multiprocessor system. Each unit-size job has a time window in which
it can be executed. Jobs are dynamically added and removed from the system. We
provide an algorithm that maintains a valid schedule, as long as a sufficiently
feasible schedule exists. The algorithm reschedules only a total number of
O(min{log^* n, log^* Delta}) jobs for each job that is inserted or deleted from
the system, where n is the number of active jobs and Delta is the size of the
largest window.
","[{'version': 'v1', 'created': 'Tue, 28 May 2013 16:34:44 GMT'}]",2013-05-29,"[['Bender', 'Michael A.', ''], ['Farach-Colton', 'Martin', ''], ['Fekete', 'Sándor P.', ''], ['Fineman', 'Jeremy T.', ''], ['Gilbert', 'Seth', '']]","['Scheduling', 'online problems', 'reallocation']"
17444,1511.03451,Emanuele Bellini,"Emanuele Bellini, Nadir Murru","An efficient and secure RSA--like cryptosystem exploiting R\'edei
  rational functions over conics","18 pages, 1 figure",,,,cs.IT cs.CR math.IT math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We define an isomorphism between the group of points of a conic and the set
of integers modulo a prime equipped with a non-standard product. This product
can be efficiently evaluated through the use of R\'edei rational functions. We
then exploit the isomorphism to construct a novel RSA-like scheme. We compare
our scheme with classic RSA and with RSA-like schemes based on the cubic or
conic equation. The decryption operation of the proposed scheme turns to be two
times faster than RSA, and involves the lowest number of modular inversions
with respect to other RSA-like schemes based on curves. Our solution offers the
same security as RSA in a one-to-one communication and more security in
broadcast applications.
","[{'version': 'v1', 'created': 'Wed, 11 Nov 2015 11:05:13 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Jan 2016 10:19:47 GMT'}]",2016-01-28,"[['Bellini', 'Emanuele', ''], ['Murru', 'Nadir', '']]","['R´edei function', 'RSA', 'public cryptography']"
17445,1005.0972,Rdv Ijcsis,"S. F. Rodd, U. P. Kulkarni","Adaptive Tuning Algorithm for Performance tuning of Database Management
  System","IEEE Publication format, International Journal of Computer Science
  and Information Security, IJCSIS, Vol. 8 No. 1, April 2010, USA. ISSN 1947
  5500, http://sites.google.com/site/ijcsis/",,,,cs.DB,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Performance tuning of Database Management Systems(DBMS) is both complex and
challenging as it involves identifying and altering several key performance
tuning parameters. The quality of tuning and the extent of performance
enhancement achieved greatly depends on the skill and experience of the
Database Administrator (DBA). As neural networks have the ability to adapt to
dynamically changing inputs and also their ability to learn makes them ideal
candidates for employing them for tuning purpose. In this paper, a novel tuning
algorithm based on neural network estimated tuning parameters is presented. The
key performance indicators are proactively monitored and fed as input to the
Neural Network and the trained network estimates the suitable size of the
buffer cache, shared pool and redo log buffer size. The tuner alters these
tuning parameters using the estimated values using a rate change computing
algorithm. The preliminary results show that the proposed method is effective
in improving the query response time for a variety of workload types. .
","[{'version': 'v1', 'created': 'Thu, 6 May 2010 10:47:03 GMT'}]",2010-05-07,"[['Rodd', 'S. F.', ''], ['Kulkarni', 'U. P.', '']]","['DBA', 'Buffer Miss Ratio', 'Data Miner', 'Neural Network', 'Buffer Cache']"
17446,1005.0212,Olivier Teste,"Fr\'ed\'eric Bret (IRIT), Olivier Teste (IRIT)",Construction graphique d'entrep\^ots et de magasins de donn\'ees,,"Congr\`es INFormatique des ORganisations et Syst\`emes
  d'Information et de D\'ecision - INFORSID'99, La Garde : France (1999)",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, decisional systems have became a significant research topic in
databases. Data warehouses and data marts are the main elements of such
systems. This paper presents our decisional support system. We present
graphical interfaces which help the administrator to build data warehouses and
data marts. We present a data warehouse building interface based on an
object-oriented conceptual model. This model allows the warehouse data
historisation at three levels: attribute, class and environment. Also, we
present a data mart building interface which allows warehouse data to be
reorganised through a multidimensional object-oriented model.
","[{'version': 'v1', 'created': 'Mon, 3 May 2010 07:43:22 GMT'}]",2010-05-20,"[['Bret', 'Frédéric', '', 'IRIT'], ['Teste', 'Olivier', '', 'IRIT']]","['data warehouses', 'data marts', 'historisation', 'multidimensional', 'graphical interfaces for administrator']"
17447,1212.1609,Stavros Kolliopoulos,Stavros G. Kolliopoulos and Yannis Moysoglou,The 2-valued case of makespan minimization with assignment constraints,"8 pages, 1 figure, to appear in Information Processing Letters",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the following special case of minimizing makespan. A set of jobs
$J$ and a set of machines $M$ are given. Each job $j \in J$ can be scheduled on
a machine from a subset $M_j$ of $M$. The processing time of $j$ is the same on
all machines in $M_j.$ The jobs are of two sizes, namely $b$ (big) and $s$
(small). We present a polynomial-time algorithm that approximates the value of
the optimal makespan within a factor of 1.883 and some further improvements
when every job can be scheduled on at most two machines.
","[{'version': 'v1', 'created': 'Fri, 7 Dec 2012 14:03:44 GMT'}]",2012-12-10,"[['Kolliopoulos', 'Stavros G.', ''], ['Moysoglou', 'Yannis', '']]","['approximation algorithms', 'scheduling', 'makespan minimization', 'graph balancing']"
17448,1407.8258,Jill Slay,Jill Slay and Fiona Schulz,"Development of an Ontology Based Forensic Search Mechanism: Proof of
  Concept",,"Journal of Digital Forensics, Security and Law, 1(1), 25-44",,,cs.CR cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper examines the problems faced by Law Enforcement in searching large
quantities of electronic evidence. It examines the use of ontologies as the
basis for new forensic software filters and provides a proof of concept tool
based on an ontological design. It demonstrates that efficient searching is
produced through the use of such a design and points to further work that might
be carried out to extend this concept.
","[{'version': 'v1', 'created': 'Thu, 31 Jul 2014 01:58:02 GMT'}]",2014-08-01,"[['Slay', 'Jill', ''], ['Schulz', 'Fiona', '']]","['forensic computing', 'electronic evidence', 'search', 'filter', 'ontology']"
17449,1212.2902,Michael Schneider,"Michael Schneider, Sebastian Rudolph, Geoff Sutcliffe",Modeling in OWL 2 without Restrictions,Technical Report,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Semantic Web ontology language OWL 2 DL comes with a variety of language
features that enable sophisticated and practically useful modeling. However,
the use of these features has been severely restricted in order to retain
decidability of the language. For example, OWL 2 DL does not allow a property
to be both transitive and asymmetric, which would be desirable, e.g., for
representing an ancestor relation. In this paper, we argue that the so-called
global restrictions of OWL 2 DL preclude many useful forms of modeling, by
providing a catalog of basic modeling patterns that would be available in OWL 2
DL if the global restrictions were discarded. We then report on the results of
evaluating several state-of-the-art OWL 2 DL reasoners on problems that use
combinations of features in a way that the global restrictions are violated.
The systems turn out to rely heavily on the global restrictions and are thus
largely incapable of coping with the modeling patterns. Next we show how
off-the-shelf first-order logic theorem proving technology can be used to
perform reasoning in the OWL 2 direct semantics, the semantics that underlies
OWL 2 DL, but without requiring the global restrictions. Applying a naive
proof-of-concept implementation of this approach to the test problems was
successful in all cases. Based on our observations, we make suggestions for
future lines of research on expressive description logic-style OWL reasoning.
","[{'version': 'v1', 'created': 'Wed, 12 Dec 2012 17:58:01 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Dec 2012 06:41:41 GMT'}, {'version': 'v3', 'created': 'Sun, 28 Apr 2013 22:30:09 GMT'}]",2013-04-30,"[['Schneider', 'Michael', ''], ['Rudolph', 'Sebastian', ''], ['Sutcliffe', 'Geoff', '']]","['Semantic Web', 'Ontology', 'Modeling', 'OWL DL']"
17450,1307.5667,Masoumeh Vali,Masoumeh Vali,"New Optimization Approach Using Clustering-Based Parallel Genetic
  Algorithm",,,,,cs.NE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many global Optimization Problems, it is required to evaluate a global
point (min or max) in large space that calculation effort is very high. In this
paper is presented new approach for optimization problem with subdivision
labeling method (SLM) but in this method for higher dimensional has high
calculation effort. Clustering-Based Parallel Genetic Algorithm (CBPGA) in
optimization problems is one of the solutions of this problem. That the initial
population is crossing points and subdividing in each step is according to
mutation. After labeling all of crossing points, selecting is according to
polytope that has complete label. In this method we propose an algorithm, based
on parallelization scheme using master-slave. SLM algorithm is implemented by
CBPGA and compared the experimental results. The numerical examples and
numerical results show that SLMCBPGA is improved speed up and efficiency.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2013 12:07:22 GMT'}]",2013-07-23,"[['Vali', 'Masoumeh', '']]","['Clustering-Based Parallel Genetic Algorithm (CBPGA)', 'Subdivision Labeling method (SLM)', 'crossing point']"
17451,1510.01364,Pierre Horgue,"Pierre Horgue (IMFT), Jacques Franc (IMFT), Romain Guibert (IMFT),
  G\'erald Debenest (IMFT)","An extension of the open-source porousMultiphaseFoam toolbox dedicated
  to groundwater flows solving the Richards' equation",,,,,cs.CE physics.class-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this note, the existing porousMultiphaseFoam toolbox, developed initially
for any two-phase flow in porous media is extended to the specific case of the
Richards' equation which neglect the pressure gradient of the non-wetting
phase. This model is typically used for saturated and unsaturated groundwater
flows. A Picard's algorithm is implemented to linearize and solve the Richards'
equation developed in the pressure head based form. This new solver of the
porousMultiphaseFoam toolbox is named groundwaterFoam. The validation of
thesolver is achieved by a comparison between numerical simulations and results
obtained from the literature. Finally, a parallel efficiency test is performed
on a large unstructured mesh and exhibits a super-linear behavior as observed
for the other solvers of the toolbox.
","[{'version': 'v1', 'created': 'Wed, 30 Sep 2015 12:34:41 GMT'}]",2015-10-07,"[['Horgue', 'Pierre', '', 'IMFT'], ['Franc', 'Jacques', '', 'IMFT'], ['Guibert', 'Romain', '', 'IMFT'], ['Debenest', 'Gérald', '', 'IMFT']]","['Porous medium', 'Unsaturated flow', 'OpenFOAM', 'Richards’ equation', 'Picard’s algorithm']"
17452,1401.0400,Simon Schmidt,Gabriel Renault and Simon Schmidt,"On the Complexity of the Mis\`ere Version of Three Games Played on
  Graphs",,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the complexity of finding a winning strategy for the mis\`ere
version of three games played on graphs : two variants of the game
$\text{NimG}$, introduced by Stockmann in 2004 and the game $\text{Vertex
Geography}$ on both directed and undirected graphs. We show that on general
graphs those three games are $\text{PSPACE}$-Hard or Complete. For one
$\text{PSPACE}$-Hard variant of $\text{NimG}$, we find an algorithm to compute
an effective winning strategy in time $\mathcal{O}(\sqrt{|V(G)|}.|E(G)|)$ when
$G$ is a bipartite graph.
","[{'version': 'v1', 'created': 'Thu, 2 Jan 2014 09:43:40 GMT'}, {'version': 'v2', 'created': 'Sun, 3 May 2015 16:12:37 GMT'}]",2015-05-05,"[['Renault', 'Gabriel', ''], ['Schmidt', 'Simon', '']]","['Combinatorial Games', 'Complexity', 'Graphs', 'Mis`ere']"
17453,1209.6001,Jonathan Shapiro,Ruefei He and Jonathan Shapiro,Bayesian Mixture Models for Frequent Itemset Discovery,,,,,cs.LG cs.IR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In binary-transaction data-mining, traditional frequent itemset mining often
produces results which are not straightforward to interpret. To overcome this
problem, probability models are often used to produce more compact and
conclusive results, albeit with some loss of accuracy. Bayesian statistics have
been widely used in the development of probability models in machine learning
in recent years and these methods have many advantages, including their
abilities to avoid overfitting. In this paper, we develop two Bayesian mixture
models with the Dirichlet distribution prior and the Dirichlet process (DP)
prior to improve the previous non-Bayesian mixture model developed for
transaction dataset mining. We implement the inference of both mixture models
using two methods: a collapsed Gibbs sampling scheme and a variational
approximation algorithm. Experiments in several benchmark problems have shown
that both mixture models achieve better performance than a non-Bayesian mixture
model. The variational algorithm is the faster of the two approaches while the
Gibbs sampling method achieves a more accurate results. The Dirichlet process
mixture model can automatically grow to a proper complexity for a better
approximation. Once the model is built, it can be very fast to query and run
analysis on (typically 10 times faster than Eclat, as we will show in the
experiment section). However, these approaches also show that mixture models
underestimate the probabilities of frequent itemsets. Consequently, these
models have a higher sensitivity but a lower specificity.
","[{'version': 'v1', 'created': 'Wed, 26 Sep 2012 16:41:59 GMT'}]",2012-09-27,"[['He', 'Ruefei', ''], ['Shapiro', 'Jonathan', '']]","['Bayesian mixture model', 'Frequent itemsets mining', 'Gibbssampling', 'Variational inference', 'Dirichlet process']"
17454,1603.08592,Bor-Jeng Chen,Bor-Jeng Chen and Gerard Medioni,"Exploring Local Context for Multi-target Tracking in Wide Area Aerial
  Surveillance",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tracking many vehicles in wide coverage aerial imagery is crucial for
understanding events in a large field of view. Most approaches aim to associate
detections from frame differencing into tracks. However, slow or stopped
vehicles result in long-term missing detections and further cause tracking
discontinuities. Relying merely on appearance clue to recover missing
detections is difficult as targets are extremely small and in grayscale. In
this paper, we address the limitations of detection association methods by
coupling it with a local context tracker (LCT), which does not rely on motion
detections. On one hand, our LCT learns neighboring spatial relation and tracks
each target in consecutive frames using graph optimization. It takes the
advantage of context constraints to avoid drifting to nearby targets. We
generate hypotheses from sparse and dense flow efficiently to keep solutions
tractable. On the other hand, we use detection association strategy to extract
short tracks in batch processing. We explicitly handle merged detections by
generating additional hypotheses from them. Our evaluation on wide area aerial
imagery sequences shows significant improvement over state-of-the-art methods.
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2016 23:47:25 GMT'}]",2016-03-30,"[['Chen', 'Bor-Jeng', ''], ['Medioni', 'Gerard', '']]","['multi-target tracking', 'context tracker', 'wide area motion imagery']"
17455,1206.1430,Yogita Khatri,Yogita Khatri,"Distance Based Asynchronous Recovery Approach in Mobile Computing
  Environment","7 pages, 1figure",,,,cs.DB cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A mobile computing system is a distributed system in which at least one of
the processes is mobile. They are constrained by lack of stable storage, low
network bandwidth, mobility, frequent disconnection and limited battery life.
Checkpointing is one of the commonly used techniques to provide fault tolerance
in mobile computing environment. In order to suit the mobile environment a
distance based recovery scheme is proposed which is based on checkpointing and
message logging. After the system recovers from failures, only the failed
processes rollback and restart from their respective recent checkpoints,
independent of the others. The salient feature of this scheme is to reduce the
transfer and recovery cost. While the mobile host moves with in a specific
range, recovery information is not moved and thus only be transferred nearby if
the mobile host moves out of certain range.
","[{'version': 'v1', 'created': 'Thu, 7 Jun 2012 09:44:13 GMT'}]",2012-06-08,"[['Khatri', 'Yogita', '']]","['Mobile Computing System', 'Fault tolerance', 'Asynchronous Recovery', 'Checkpointing', 'Message-logging']"
17456,1007.0413,Dimple Juneja Dr.,"Dimple Juneja, Neha Arora","An Ant Based Framework for Preventing DDoS Attack in Wireless Sensor
  Networks","ISSN : 0976-4860 (Online).
  http://ijict.org/index.php/ijoat/article/view/ant-based-framework-ddos-wsn","International Journal of Advancements in Technology (IJoAT), Vol
  1, No 1 (2010)",,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  Security and Privacy are two important parameters that need to be considered
when dealing with wireless sensor networks as WSN operate in an unattended
environment and carry sensitive information critical to the application.
However, applying security techniques that consume minimum resources is still a
challenge and this paper makes an attempt to address the same. One of the major
attacks in sensor network is denial of service attack that not only diminishes
the network capacity but also affects the reliability of information being
transmitted. This work is an extension of our previous work which could
successfully detect DDoS using ants. However, no emphasis was made towards the
prevention mechanism. In this paper an ant-based framework that exploits the
significance of stateless and stateful signatures and hence preserving the
legtimate packets only, thereby discarding the contaminated packets has been
proposed.
","[{'version': 'v1', 'created': 'Thu, 1 Jul 2010 09:18:03 GMT'}]",2010-07-05,"[['Juneja', 'Dimple', ''], ['Arora', 'Neha', '']]","['Ants', 'DDoS', 'Stateless', 'Stateful Signatures']"
17457,1111.6713,Mohammed Elmogy Dr.,Ahmed Tolba and Nabila Eladawi and Mohammed Elmogy,An Enhanced Indexing And Ranking Technique On The Semantic Web,"8 pages, 7 figures","IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 5, No 3, 2011, 118-125",,,cs.AI,http://creativecommons.org/licenses/by/3.0/,"  With the fast growth of the Internet, more and more information is available
on the Web. The Semantic Web has many features which cannot be handled by using
the traditional search engines. It extracts metadata for each discovered Web
documents in RDF or OWL formats, and computes relations between documents. We
proposed a hybrid indexing and ranking technique for the Semantic Web which
finds relevant documents and computes the similarity among a set of documents.
First, it returns with the most related document from the repository of
Semantic Web Documents (SWDs) by using a modified version of the ObjectRank
technique. Then, it creates a sub-graph for the most related SWDs. Finally, It
returns the hubs and authorities of these document by using the HITS algorithm.
Our technique increases the quality of the results and decreases the execution
time of processing the user's query.
","[{'version': 'v1', 'created': 'Tue, 29 Nov 2011 07:24:27 GMT'}]",2011-11-30,"[['Tolba', 'Ahmed', ''], ['Eladawi', 'Nabila', ''], ['Elmogy', 'Mohammed', '']]","['Indexing', 'Ranking Semantic Web Documents', 'Search Engines', 'Semantic Web']"
17458,1105.3414,Jia-Huai  You,Guohua Liu and Jia-Huai You,"Relating Weight Constraint and Aggregate Programs: Semantics and
  Representation","To appear in Theory and Practice of Logic Programming (TPLP), 2011.
  30 pages",,,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Weight constraint and aggregate programs are among the most widely used logic
programs with constraints. In this paper, we relate the semantics of these two
classes of programs, namely the stable model semantics for weight constraint
programs and the answer set semantics based on conditional satisfaction for
aggregate programs. Both classes of programs are instances of logic programs
with constraints, and in particular, the answer set semantics for aggregate
programs can be applied to weight constraint programs. We show that the two
semantics are closely related. First, we show that for a broad class of weight
constraint programs, called strongly satisfiable programs, the two semantics
coincide. When they disagree, a stable model admitted by the stable model
semantics may be circularly justified. We show that the gap between the two
semantics can be closed by transforming a weight constraint program to a
strongly satisfiable one, so that no circular models may be generated under the
current implementation of the stable model semantics. We further demonstrate
the close relationship between the two semantics by formulating a
transformation from weight constraint programs to logic programs with nested
expressions which preserves the answer set semantics. Our study on the
semantics leads to an investigation of a methodological issue, namely the
possibility of compact representation of aggregate programs by weight
constraint programs. We show that almost all standard aggregates can be encoded
by weight constraints compactly. This makes it possible to compute the answer
sets of aggregate programs using the ASP solvers for weight constraint
programs. This approach is compared experimentally with the ones where
aggregates are handled more explicitly, which show that the weight constraint
encoding of aggregates enables a competitive approach to answer set computation
for aggregate programs.
","[{'version': 'v1', 'created': 'Mon, 16 May 2011 05:36:39 GMT'}]",2011-05-18,"[['Liu', 'Guohua', ''], ['You', 'Jia-Huai', '']]","['Stable model', 'Weight Constraint', 'Aggregates', 'Logic Programs with Constraints']"
17459,1702.05376,Dmitry Ignatov,Dmitry I. Ignatov and Bruce W. Watson,Towards a Unified Taxonomy of Biclustering Methods,http://ceur-ws.org/Vol-1552/,"Russian and South African Workshop on Knowledge Discovery
  Techniques Based on Formal Concept Analysis (RuZA 2015), November 30 -
  December 5, 2015, Stellenbosch, South Africa, In CEUR Workshop Proceedings,
  Vol. 1552, p. 23-39",,,cs.AI cs.DM stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Being an unsupervised machine learning and data mining technique,
biclustering and its multimodal extensions are becoming popular tools for
analysing object-attribute data in different domains. Apart from conventional
clustering techniques, biclustering is searching for homogeneous groups of
objects while keeping their common description, e.g., in binary setting, their
shared attributes. In bioinformatics, biclustering is used to find genes, which
are active in a subset of situations, thus being candidates for biomarkers.
However, the authors of those biclustering techniques that are popular in gene
expression analysis, may overlook the existing methods. For instance, BiMax
algorithm is aimed at finding biclusters, which are well-known for decades as
formal concepts. Moreover, even if bioinformatics classify the biclustering
methods according to reasonable domain-driven criteria, their classification
taxonomies may be different from survey to survey and not full as well. So, in
this paper we propose to use concept lattices as a tool for taxonomy building
(in the biclustering domain) and attribute exploration as means for
cross-domain taxonomy completion.
","[{'version': 'v1', 'created': 'Fri, 17 Feb 2017 15:12:31 GMT'}]",2017-02-20,"[['Ignatov', 'Dmitry I.', ''], ['Watson', 'Bruce W.', '']]","['Biclustering', 'taxonomy', 'concept lattices', 'attribute exploration']"
17460,1209.4633,Sachin Lakra,"Sachin Lakra, Nand Kumar, Sugandha Hooda, Nitin Bhardwaj",A Metric For The Activeness Of An Object-Oriented Component Library,6 pages. arXiv admin note: text overlap with arXiv:1209.4453,"Software Engineering Research and Practice, WORLDCOMP 2007 - The
  2007 World Congress in Computer Science, Computer Engineering, and Applied
  Computing, Las Vegas, Nevada, USA, 25th - 28th June 2007, pp. 704-709",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, an attempt has been made to analyze the Activeness of an
Object Oriented Component Library and develop a special type of software metric
called Component Activeness Quotient which is defined as the degree of
readiness of an OOCL. The advantages of the CAQ include a possible comparison
between various OOCLs leading to selection of the best OOCL for use during the
development task, and Stability of the software can be gauged as indicated by
the value of the CAQ. The disadvantage of the CAQ is that it may have some
error because of its subjective and random nature. The paper also tries to
improvise the calculation of the Activeness Quotient. The extreme case of a
software organization having an RQ greater than 1 and MQ equal to 0 was not
handled by the method of taking an average of RQ and MQ to calculate the AQ.
The improvisation is that the AQ must be equal to a product of MQ and RQ and
this is mentioned in the Appendix.
","[{'version': 'v1', 'created': 'Thu, 20 Sep 2012 08:37:25 GMT'}]",2012-09-24,"[['Lakra', 'Sachin', ''], ['Kumar', 'Nand', ''], ['Hooda', 'Sugandha', ''], ['Bhardwaj', 'Nitin', '']]","['Object Oriented Programming', 'Object Oriented Component Library', 'Activeness', 'Component Activeness Quotient', 'Organizedness', 'Stability']"
17461,1312.4800,Thabet Slimani,Thabet Slimani,New Approach to Optimize the Time of Association Rules Extraction,"10 pages, 6 figures","IJCSI International Journal of Computer Science Issues, Vol. 10,
  Issue 5, No 1, September 2013",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The knowledge discovery algorithms have become ineffective at the abundance
of data and the need for fast algorithms or optimizing methods is required. To
address this limitation, the objective of this work is to adapt a new method
for optimizing the time of association rules extractions from large databases.
Indeed, given a relational database (one relation) represented as a set of
tuples, also called set of attributes, we transform the original database as a
binary table (Bitmap table) containing binary numbers. Then, we use this Bitmap
table to construct a data structure called Peano Tree stored as a binary file
on which we apply a new algorithm called BF-ARM (extension of the well known
Apriori algorithm). Since the database is loaded into a binary file, our
proposed algorithm will traverse this file, and the processes of association
rules extractions will be based on the file stored on disk. The BF-ARM
algorithm is implemented and compared with Apriori, Apriori+ and RS-Rules+
algorithms. The evaluation process is based on three benchmarks (Mushroom, Car
Evaluation and Adult). Our preliminary experimental results showed that our
algorithm produces association rules with a minimum time compared to other
algorithms.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2013 14:30:38 GMT'}]",2013-12-18,"[['Slimani', 'Thabet', '']]","['Data Mining', 'Association Rules', 'Large Databases', 'Frequent Itemsets', 'Peano Trees (Ptree)']"
17462,1407.3948,Denys Matthies,"Denys J.C. Matthies, Felix M. Manke, Franz M\""uller, Charalampia
  Makri, Christoph Anthes, Dieter Kranzlm\""uller","VR-Stepper: A Do-It-Yourself Game Interface For Locomotion In Virtual
  Environments",,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Compared to real world tasks, completing tasks in a virtual environment (VE)
seldom involves the whole spectrum of skills the human body offers. User input
in a VE is commonly accomplished through simple finger gestures, such as
walking in a scene by simply pressing a button, even if this kind of
interaction is not very suitable. In order to create a more intuitive and
natural interaction, diverse projects try to tackle the problem of locomotion
in VEs by trying to enable a natural walking movement, which is also supposed
to increase the level of immersion. Existing solutions such as treadmills are
still expensive and need additional fixation of the body. In this paper, we
describe a simple and inexpensive way to build a useful locomotion interface
using a conventional sports stepper and an Arduino. This device enables control
in a VE by walking-in-place and without the need for any additional fixation
gadgets. We conducted a user study with 10 participants to evaluate the
impression on the joy and ease of use, immersion and reliability in comparison
to other interfaces used for locomotion, such as the Wii Balance Board and a
Wand Joystick. We found out that the stepper is experienced slightly better in
terms of immersion and joy of use. Furthermore, found that pressing buttons on
a Joystick was perceived to be more reliable.
","[{'version': 'v1', 'created': 'Tue, 15 Jul 2014 11:40:10 GMT'}]",2014-07-16,"[['Matthies', 'Denys J. C.', ''], ['Manke', 'Felix M.', ''], ['Müller', 'Franz', ''], ['Makri', 'Charalampia', ''], ['Anthes', 'Christoph', ''], ['Kranzlmüller', 'Dieter', '']]","['Input device', 'physical interface', 'foot input', 'locomotion', 'interaction method', 'hands-free', 'VR']"
17463,1609.06772,Yi Zhu,Yi Zhu and Shawn Newsam,Spatio-Temporal Sentiment Hotspot Detection Using Geotagged Photos,To appear in ACM SIGSPATIAL 2016,,,,cs.CV cs.CY cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We perform spatio-temporal analysis of public sentiment using geotagged photo
collections. We develop a deep learning-based classifier that predicts the
emotion conveyed by an image. This allows us to associate sentiment with place.
We perform spatial hotspot detection and show that different emotions have
distinct spatial distributions that match expectations. We also perform
temporal analysis using the capture time of the photos. Our spatio-temporal
hotspot detection correctly identifies emerging concentrations of specific
emotions and year-by-year analyses of select locations show there are strong
temporal correlations between the predicted emotions and known events.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2016 22:43:54 GMT'}]",2016-09-23,"[['Zhu', 'Yi', ''], ['Newsam', 'Shawn', '']]","['Hotspot detection', 'emotion recognition', 'geotagged photos', 'spatio-temporal geographic analysis', 'deep learning']"
17464,1305.0135,Gloria Lanci,Gloria Lanci,"Translating cities: the use of digital technologies in urban
  environments","Working Paper, 9 pages, author name and contact details added",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer models and information systems have been used for urban planning and
design since the 1950s. Their capacity for analysis and problem-solving has
increased substantially since then with hardware and software being able to
manage large amounts of data. The beginning of the 2000s brought better
technologies for data visualisation and intuitive software products and
nowadays they are being used to design and manipulate highly complex urban
systems. However, ontological and epistemological questions remain about the
nature of urban environments. What do we know about cities - and what is a city
exactly? What theoretical models can be applied to the study of cities? How do
we translate a city into data? What type of information really matters and what
do we want to communicate with them? What are the implications of computer
modelling for urban planning and design? This paper reviews how digital
technologies have been used to shape our understanding of cities and how they
impact the design and planning of cities. The point of depart is a scrutiny of
the emergence of modern planning in the nineteenth century when cities became a
scientific subject. A range of theories and concepts of the urban form and
urban growth developed during the twentieth century will be presented and then
linked to the first investigations involving the use of the computer for
modelling and planning. The paper concludes with some discussions around the
interaction of computing and urban theories.
","[{'version': 'v1', 'created': 'Wed, 1 May 2013 10:02:22 GMT'}, {'version': 'v2', 'created': 'Tue, 7 May 2013 16:25:08 GMT'}]",2013-05-08,"[['Lanci', 'Gloria', '']]","['Digital technologies', 'spatial analysis', 'urban design and planning', 'urban theory']"
17465,1204.6233,Serge Gaspers,Serge Gaspers and Stefan Szeider,Strong Backdoors to Bounded Treewidth SAT,arXiv admin note: substantial text overlap with arXiv:1202.4331,,,,cs.DS cs.AI cs.CC cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are various approaches to exploiting ""hidden structure"" in instances of
hard combinatorial problems to allow faster algorithms than for general
unstructured or random instances. For SAT and its counting version #SAT, hidden
structure has been exploited in terms of decomposability and strong backdoor
sets. Decomposability can be considered in terms of the treewidth of a graph
that is associated with the given CNF formula, for instance by considering
clauses and variables as vertices of the graph, and making a variable adjacent
with all the clauses it appears in. On the other hand, a strong backdoor set of
a CNF formula is a set of variables such that each possible partial assignment
to this set moves the formula into a fixed class for which (#)SAT can be solved
in polynomial time.
  In this paper we combine the two above approaches. In particular, we study
the algorithmic question of finding a small strong backdoor set into the class
W_t of CNF formulas whose associated graphs have treewidth at most t. The main
results are positive:
  (1) There is a cubic-time algorithm that, given a CNF formula F and two
constants k,t\ge 0, either finds a strong W_t-backdoor set of size at most 2^k,
or concludes that F has no strong W_t-backdoor set of size at most k.
  (2) There is a cubic-time algorithm that, given a CNF formula F, computes the
number of satisfying assignments of F or concludes that sb_t(F)>k, for any pair
of constants k,t\ge 0. Here, sb_t(F) denotes the size of a smallest strong
W_t-backdoor set of F.
  The significance of our results lies in the fact that they allow us to
exploit algorithmically a hidden structure in formulas that is not accessible
by any one of the two approaches (decomposability, backdoors) alone. Already a
backdoor size 1 on top of treewidth 1 (i.e., sb_1(F)=1) entails formulas of
arbitrarily large treewidth and arbitrarily large cycle cutsets.
","[{'version': 'v1', 'created': 'Fri, 27 Apr 2012 14:51:23 GMT'}]",2012-04-30,"[['Gaspers', 'Serge', ''], ['Szeider', 'Stefan', '']]","['algorithms', '#SAT', 'parameterized complexity', 'graph minors']"
17466,1111.6121,Roberto Mu\~noz,"Roberto Mu\~noz, Marta Barr\'ia, Cristian Rusu",Virtual Worlds as a Support to Engineering Teaching,"XIII Chilean Congress on Higher Education in Computer Science,
  CCESC'2011",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Virtual Worlds (VWs) are an emerging technology used by a growing number of
educational institutions around the world. It is an environment, a way of
learning and an educational tool that allows different levels of online
interaction. In the course ""Programming I"", of the career Informatics
Engineering at Universidad de Valpara\'iso, we conducted a pilot experience
with the VW of Second Life, in order to evaluate the potential of using VWs in
the teaching practice.
","[{'version': 'v1', 'created': 'Fri, 25 Nov 2011 22:22:36 GMT'}]",2011-11-29,"[['Muñoz', 'Roberto', ''], ['Barría', 'Marta', ''], ['Rusu', 'Cristian', '']]","['Virtual Worlds', 'Second Life', 'Virtual Education', 'Distance Education', 'Online Teaching']"
17467,1401.2234,Noppadon Phumeechanya,Noppadon Phumeechanya and Panita Wannapiroon,"Ubiquitous Scaffold Learning Environment Using Problem-based Learning to
  Enhance Problem-solving Skills and Context Awareness","11 page, 2 figures","International Journal on Integrating Technology in Education
  (IJITE) Vol.2, No.4, December 2013, 23-33",,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The purpose of this research is to 1) design of an Ubiquitous Scaffold
Learning Environment Using Problem-based Learning model to enhance
problem-solving skills and context awareness, and 2) evaluate the developed
model. The research procedures divide into two phases. The first phase is to
design of Ubiquitous Scaffold Learning Environment Using Problem-based Learning
model, and the second phase is to evaluate the developed model. The sample
group in this study consists of five experts selected by purposive sampling
method. Data were analyzed by arithmetic mean and standard deviation. The
research findings are as follows: 1. The developed model consist of three
components is 1) principles of ubiquitous learning environment (ULE),
problem-based learning with scaffolding in ULE, problem solving skill and
context awareness 2) objectives of the model are to enhance problem solving
skill and context awareness and 3) Process of the instructional model 2. The
experts agree Ubiquitous Scaffold Learning Environment Using Problem-based
Learning model model is high level of appropriateness.
","[{'version': 'v1', 'created': 'Fri, 10 Jan 2014 06:20:16 GMT'}]",2015-06-01,"[['Phumeechanya', 'Noppadon', ''], ['Wannapiroon', 'Panita', '']]","['Problem-based Learning', 'Ubiquitous Learning', 'Scaffolding', 'Problem-solving Skills', 'Context Awareness']"
17468,1304.2617,Stefano Ferretti Stefano Ferretti,Stefano Ferretti,Resilience of Dynamic Overlays through Local Interactions,"A version of this paper is published in the Proceedings of 5th
  International Workshop on Simplifying Complex Networks for Pratictioners
  (SIMPLEX 2013) - World Wide Web Conference (WWW 2013), ACM, Rio de Janeiro
  (Brazil), May 2013",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a self-organizing protocol for dynamic (unstructured P2P)
overlay networks, which allows to react to the variability of node arrivals and
departures. Through local interactions, the protocol avoids that the departure
of nodes causes a partitioning of the overlay. We show that it is sufficient to
have knowledge about 1st and 2nd neighbours, plus a simple interaction P2P
protocol, to make unstructured networks resilient to node faults. A simulation
assessment over different kinds of overlay networks demonstrates the viability
of the proposal.
","[{'version': 'v1', 'created': 'Tue, 9 Apr 2013 14:43:02 GMT'}]",2013-04-10,"[['Ferretti', 'Stefano', '']]","['Unstructured Overlays', 'Complex Networks', 'Simulation']"
17469,0807.2836,Olivier Champalle,"Olivier Champalle (ICTT, Liesp), Bertrand David (ICTT, Liesp), Ren\'e
  Chalon (ICTT, Liesp), Guillaume Masserey (ICTT, Liesp)","Ordinateur port\'e support de r\'ealit\'e augment\'ee pour des
  activit\'es de maintenance et de d\'epannage","Ubimob'06 3e Journ\'ees Francophones Mobilit\'e et Ubiquit\'e, Paris
  : France (2006)",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a case study of use of wearable computer within the
framework of activities of maintenance and repairing. Besides the study of
configuration of this wearable computer and its peripherals, we show the
integration of context, in-situ storage, traceability and regulation in these
activities. This case study is in the scope of a huge project called HMTD (Help
Me To Do) which aim is to apply MOCOCO (Mobility, COoperation,
COntextualisation) and IMERA (Mobile Interaction in the Augmented Real
Environment) principles for better use, maintenance and repairing of equipments
in the domestic, public and professional situations.
","[{'version': 'v1', 'created': 'Thu, 17 Jul 2008 17:22:55 GMT'}]",2008-07-18,"[['Champalle', 'Olivier', '', 'ICTT, Liesp'], ['David', 'Bertrand', '', 'ICTT, Liesp'], ['Chalon', 'René', '', 'ICTT, Liesp'], ['Masserey', 'Guillaume', '', 'ICTT, Liesp']]","['Mobile User Interfaces', 'Mixed Reality Environments', 'Collaborative work', 'Ambient Intelligence. 1']"
17470,1502.06250,Aleksandr Cariow,"Aleksandr Cariow, Galina Cariowa, Jaroslaw Knapinski","Derivation of a low multiplicative complexity algorithm for multiplying
  hyperbolic octonions","15 pages, 4 figures",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an efficient algorithm to multiply two hyperbolic octonions. The
direct multiplication of two hyperbolic octonions requires 64 real
multiplications and 56 real additions. More effective solutions still do not
exist. We show how to compute a product of the hyperbolic octonions with 26
real multiplications and 92 real additions. During synthesis of the discussed
algorithm we use the fact that product of two hyperbolic octonions may be
represented as a matrix - vector product. The matrix multiplicand that
participates in the product calculating has unique structural properties that
allow performing its advantageous factorization. Namely this factorization
leads to significant reducing of the computational complexity of hyperbolic
octonions multiplication.
","[{'version': 'v1', 'created': 'Sun, 22 Feb 2015 17:17:44 GMT'}]",2015-02-24,"[['Cariow', 'Aleksandr', ''], ['Cariowa', 'Galina', ''], ['Knapinski', 'Jaroslaw', '']]","['hyperbolic octonion', 'multiplication of hypercomplex numbers', 'fast algorithms']"
17471,1301.2976,Ran Wolff,Ran Wolff,Local Thresholding on Distributed Hash Tables,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a binary routing tree protocol for distributed hash table
overlays. Using this protocol each peer can independently route messages to its
parent and two descendants on the fly without any maintenance, global context,
and synchronization. The protocol is then extended to support tree change
notification with similar efficiency. The resulting tree is almost perfectly
dense and balanced, and has O(1) stretch if the distributed hash table is
symmetric Chord. We use the tree routing protocol to overcome the main
impediment for implementation of local thresholding algorithms in peer-to-peer
systems -- their requirement for cycle free routing. Direct comparison of a
gossip-based algorithm and a corresponding local thresholding algorithm on a
majority voting problem reveals that the latter obtains superior accuracy using
a fraction of the communication overhead.
","[{'version': 'v1', 'created': 'Mon, 14 Jan 2013 13:56:17 GMT'}]",2013-01-15,"[['Wolff', 'Ran', '']]","['Distributed Hash Table', 'Local Thresholding Algorithms', 'Binary Tree']"
17472,1511.07299,"Thomas C. K\""ubler","Thomas C. K\""ubler and Tobias Rittig and Judith Ungewiss and Christina
  Krauss and Enkelejda Kasneci","Rendering refraction and reflection of eyeglasses for synthetic eye
  tracker images",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While for the evaluation of robustness of eye tracking algorithms the use of
real-world data is essential, there are many applications where simulated,
synthetic eye images are of advantage. They can generate labelled ground-truth
data for appearance based gaze estimation algorithms or enable the development
of model based gaze estimation techniques by showing the influence on gaze
estimation error of different model factors that can then be simplified or
extended. We extend the generation of synthetic eye images by a simulation of
refraction and reflection for eyeglasses. On the one hand this allows for the
testing of pupil and glint detection algorithms under different illumination
and reflection conditions, on the other hand the error of gaze estimation
routines can be estimated in conjunction with different eyeglasses. We show how
a polynomial function fitting calibration performs equally well with and
without eyeglasses, and how a geometrical eye model behaves when exposed to
glasses.
","[{'version': 'v1', 'created': 'Mon, 23 Nov 2015 16:28:14 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Nov 2015 15:01:57 GMT'}]",2015-11-25,"[['Kübler', 'Thomas C.', ''], ['Rittig', 'Tobias', ''], ['Ungewiss', 'Judith', ''], ['Krauss', 'Christina', ''], ['Kasneci', 'Enkelejda', '']]","['eye tracking', 'rendering', 'eyeglasses', 'refraction', 'reflection', 'pupil detection', 'calibration']"
17473,1301.2857,Rami Al-Rfou',Rami Al-Rfou' and Steven Skiena,SpeedRead: A Fast Named Entity Recognition Pipeline,Long paper at COLING 2012,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online content analysis employs algorithmic methods to identify entities in
unstructured text. Both machine learning and knowledge-base approaches lie at
the foundation of contemporary named entities extraction systems. However, the
progress in deploying these approaches on web-scale has been been hampered by
the computational cost of NLP over massive text corpora. We present SpeedRead
(SR), a named entity recognition pipeline that runs at least 10 times faster
than Stanford NLP pipeline. This pipeline consists of a high performance Penn
Treebank- compliant tokenizer, close to state-of-art part-of-speech (POS)
tagger and knowledge-based named entity recognizer.
","[{'version': 'v1', 'created': 'Mon, 14 Jan 2013 04:01:25 GMT'}]",2013-01-15,"[[""Al-Rfou'"", 'Rami', ''], ['Skiena', 'Steven', '']]","['Tokenization', 'Part Of Speech', 'Named Entity Recognition', 'NLP pipelines']"
17474,1605.02431,Zai Yang,Zai Yang and Lihua Xie,"Frequency-Selective Vandermonde Decomposition of Toeplitz Matrices with
  Applications","23 pages, accepted by Signal Processing",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The classical result of Vandermonde decomposition of positive semidefinite
Toeplitz matrices, which dates back to the early twentieth century, forms the
basis of modern subspace and recent atomic norm methods for frequency
estimation. In this paper, we study the Vandermonde decomposition in which the
frequencies are restricted to lie in a given interval, referred to as
frequency-selective Vandermonde decomposition. The existence and uniqueness of
the decomposition are studied under explicit conditions on the Toeplitz matrix.
The new result is connected by duality to the positive real lemma for
trigonometric polynomials nonnegative on the same frequency interval. Its
applications in the theory of moments and line spectral estimation are
illustrated. In particular, it provides a solution to the truncated
trigonometric $K$-moment problem. It is used to derive a primal semidefinite
program formulation of the frequency-selective atomic norm in which the
frequencies are known {\em a priori} to lie in certain frequency bands.
Numerical examples are also provided.
","[{'version': 'v1', 'created': 'Mon, 9 May 2016 06:48:48 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Oct 2016 01:45:13 GMT'}, {'version': 'v3', 'created': 'Fri, 21 Jul 2017 06:11:11 GMT'}]",2017-07-24,"[['Yang', 'Zai', ''], ['Xie', 'Lihua', '']]","['Frequency-selective Vandermonde decomposition', 'Toeplitz matrix', 'truncated trigonometricK-moment problem', 'line spectral estimation', 'atomic norm']"
17475,0907.0329,James Whitacre,James M Whitacre,Evidence of coevolution in multi-objective evolutionary algorithms,,"WorldComp 2009, Las Vegas, NV, USA",,,cs.NE cs.AI,http://creativecommons.org/licenses/by/3.0/,"  This paper demonstrates that simple yet important characteristics of
coevolution can occur in evolutionary algorithms when only a few conditions are
met. We find that interaction-based fitness measurements such as fitness
(linear) ranking allow for a form of coevolutionary dynamics that is observed
when 1) changes are made in what solutions are able to interact during the
ranking process and 2) evolution takes place in a multi-objective environment.
This research contributes to the study of simulated evolution in a at least two
ways. First, it establishes a broader relationship between coevolution and
multi-objective optimization than has been previously considered in the
literature. Second, it demonstrates that the preconditions for coevolutionary
behavior are weaker than previously thought. In particular, our model indicates
that direct cooperation or competition between species is not required for
coevolution to take place. Moreover, our experiments provide evidence that
environmental perturbations can drive coevolutionary processes; a conclusion
that mirrors arguments put forth in dual phase evolution theory. In the
discussion, we briefly consider how our results may shed light onto this and
other recent theories of evolution.
","[{'version': 'v1', 'created': 'Thu, 2 Jul 2009 10:15:31 GMT'}]",2009-07-03,"[['Whitacre', 'James M', '']]","['coevolution', 'dual phase evolution', 'evolutionary algorithms', 'multi-objective optimization', 'self-organized criticality']"
17476,1306.2663,Guoqiang Zhong,Guoqiang Zhong and Mohamed Cheriet,Large Margin Low Rank Tensor Analysis,30 pages,,,,cs.LG cs.NA,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Other than vector representations, the direct objects of human cognition are
generally high-order tensors, such as 2D images and 3D textures. From this
fact, two interesting questions naturally arise: How does the human brain
represent these tensor perceptions in a ""manifold"" way, and how can they be
recognized on the ""manifold""? In this paper, we present a supervised model to
learn the intrinsic structure of the tensors embedded in a high dimensional
Euclidean space. With the fixed point continuation procedures, our model
automatically and jointly discovers the optimal dimensionality and the
representations of the low dimensional embeddings. This makes it an effective
simulation of the cognitive process of human brain. Furthermore, the
generalization of our model based on similarity between the learned low
dimensional embeddings can be viewed as counterpart of recognition of human
brain. Experiments on applications for object recognition and face recognition
demonstrate the superiority of our proposed model over state-of-the-art
approaches.
","[{'version': 'v1', 'created': 'Tue, 11 Jun 2013 21:39:56 GMT'}]",2013-06-13,"[['Zhong', 'Guoqiang', ''], ['Cheriet', 'Mohamed', '']]","['Dimensionality reduction', 'tensor analysis', 'large margin', 'low rank']"
17477,1708.00622,Prafullkumar Tale Mr,"Akanksha Agrawal, Saket Saurabh and Prafullkumar Tale","On the Parameterized Complexity of Contraction to Generalization of
  Trees",Full version of paper appeared in IPEC 2017,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For a family of graphs $\cal F$, the $\mathcal{F}$-Contraction problem takes
as an input a graph $G$ and an integer $k$, and the goal is to decide if there
exists $S \subseteq E(G)$ of size at most $k$ such that $G/S$ belongs to $\cal
F$. Here, $G/S$ is the graph obtained from $G$ by contracting all the edges in
$S$. Heggernes et al.~[Algorithmica (2014)] were the first to study edge
contraction problems in the realm of Parameterized Complexity. They studied
$\cal F$-Contraction when $\cal F$ is a simple family of graphs such as trees
and paths. In this paper, we study the $\mathcal{F}$-Contraction problem, where
$\cal F$ generalizes the family of trees. In particular, we define this
generalization in a ""parameterized way"". Let $\mathbb{T}_\ell$ be the family of
graphs such that each graph in $\mathbb{T}_\ell$ can be made into a tree by
deleting at most $\ell$ edges. Thus, the problem we study is
$\mathbb{T}_\ell$-Contraction. We design an FPT algorithm for
$\mathbb{T}_\ell$-Contraction running in time
$\mathcal{O}((2\sqrt(\ell))^{\mathcal{O}(k + \ell)} \cdot n^{\mathcal{O}(1)})$.
Furthermore, we show that the problem does not admit a polynomial kernel when
parameterized by $k$. Inspired by the negative result for the kernelization, we
design a lossy kernel for $\mathbb{T}_\ell$-Contraction of size $
\mathcal{O}([k(k + 2\ell)] ^{(\lceil {\frac{\alpha}{\alpha-1}\rceil + 1)}})$.
","[{'version': 'v1', 'created': 'Wed, 2 Aug 2017 07:44:40 GMT'}]",2017-08-03,"[['Agrawal', 'Akanksha', ''], ['Saurabh', 'Saket', ''], ['Tale', 'Prafullkumar', '']]","['Graph Contraction', 'Fixed Parameter Tractability', 'Graph Algorithms', 'Generalization of Trees']"
17478,1407.3434,Zelalem Yalew Jembre,Yalew Zelalem Jembre and Young-June Choi,Enhanced Out-of-Band Sensing Algorithm for Cognitive Radio Networks,"the 6th International Conference on Ubiquitous Information
  Technologies and Application, Seoul, Korea, Dec. 15-16, 2011",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In cognitive radio networks (CRN), Out-of-Band (OoB) spectrum sensing
provides seamless communication. Cognitive radio (CR) users, so called
secondary users (SUs), should avoid interference with primary users (PUs), the
owner of the licensed band, while trying to access the unused licensed or
unlicensed band, for spectrum utilization. When PUs request to access their
band, SUs need to vacate the band, thus it is inconvenient to provide seamless
communication without OoB sensing. In this paper, we suggest an OoB sensing
algorithm to guarantee seamless communication and also minimize the
interference of SUs on PUs. Also we obtain analysis-based achievable throughput
by considering the OoB sensing duration. To verify our algorithm, we perform
simulation and find that the effect due to OoB sensing on the aggregate
throughput is insignificant.
","[{'version': 'v1', 'created': 'Sun, 13 Jul 2014 05:50:56 GMT'}]",2014-07-15,"[['Jembre', 'Yalew Zelalem', ''], ['Choi', 'Young-June', '']]","['Cognitive radio', 'spectrum sensing', 'out-of-band (OoB) sensing', 'throughput analysis']"
17479,1408.0058,Mehrab Norouzitallab,"Mehrab Norouzitallab, Valiallah Monajjemi, Saeed Shiry Ghidary and
  Mohammad Bagher Menhaj","A Framework for learning multi-agent dynamic formation strategy in
  real-time applications","27 pages, 9 figures",,,,cs.RO cs.LG cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Formation strategy is one of the most important parts of many multi-agent
systems with many applications in real world problems. In this paper, a
framework for learning this task in a limited domain (restricted environment)
is proposed. In this framework, agents learn either directly by observing an
expert behavior or indirectly by observing other agents or objects behavior.
First, a group of algorithms for learning formation strategy based on limited
features will be presented. Due to distributed and complex nature of many
multi-agent systems, it is impossible to include all features directly in the
learning process; thus, a modular scheme is proposed in order to reduce the
number of features. In this method, some important features have indirect
influence in learning instead of directly involving them as input features.
This framework has the ability to dynamically assign a group of positions to a
group of agents to improve system performance. In addition, it can change the
formation strategy when the context changes. Finally, this framework is able to
automatically produce many complex and flexible formation strategy algorithms
without directly involving an expert to present and implement such complex
algorithms.
","[{'version': 'v1', 'created': 'Fri, 1 Aug 2014 01:29:08 GMT'}]",2014-08-04,"[['Norouzitallab', 'Mehrab', ''], ['Monajjemi', 'Valiallah', ''], ['Ghidary', 'Saeed Shiry', ''], ['Menhaj', 'Mohammad Bagher', '']]","['multi-agent systems', 'formation strategy', 'machine learning', 'framework', 'modular scheme', 'context based reasoning', 'dynamic position assignment']"
17480,0707.1534,Kamel Aouiche,"J\'er\^ome Darmont, Omar Boussaid, Jean-Christian Ralaivao and Kamel
  Aouiche",An Architecture Framework for Complex Data Warehouses,,,,,cs.DB,,"  Nowadays, many decision support applications need to exploit data that are
not only numerical or symbolic, but also multimedia, multistructure,
multisource, multimodal, and/or multiversion. We term such data complex data.
Managing and analyzing complex data involves a lot of different issues
regarding their structure, storage and processing, and metadata are a key
element in all these processes. Such problems have been addressed by classical
data warehousing (i.e., applied to ""simple"" data). However, data warehousing
approaches need to be adapted for complex data. In this paper, we first propose
a precise, though open, definition of complex data. Then we present a general
architecture framework for warehousing complex data. This architecture heavily
relies on metadata and domain-related knowledge, and rests on the XML language,
which helps storing data, metadata and domain-specific knowledge altogether,
and facilitates communication between the various warehousing processes.
","[{'version': 'v1', 'created': 'Tue, 10 Jul 2007 22:01:40 GMT'}]",2007-07-12,"[['Darmont', 'Jérôme', ''], ['Boussaid', 'Omar', ''], ['Ralaivao', 'Jean-Christian', ''], ['Aouiche', 'Kamel', '']]","['Data warehousing', 'Complex data', 'XML warehousing', 'Metadata', 'Domain-specific knowledge']"
17481,1501.04760,Gaurav Kumar Agarwal,"Gaurav Kumar Agarwal, Birenjith Sasidharan and P. Vijay Kumar","An Alternate Construction of an Access-Optimal Regenerating Code with
  Optimal Sub-Packetization Level",To appear in National Conference on Communications 2015,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given the scale of today's distributed storage systems, the failure of an
individual node is a common phenomenon. Various metrics have been proposed to
measure the efficacy of the repair of a failed node, such as the amount of data
download needed to repair (also known as the repair bandwidth), the amount of
data accessed at the helper nodes, and the number of helper nodes contacted.
Clearly, the amount of data accessed can never be smaller than the repair
bandwidth. In the case of a help-by-transfer code, the amount of data accessed
is equal to the repair bandwidth. It follows that a help-by-transfer code
possessing optimal repair bandwidth is access optimal. The focus of the present
paper is on help-by-transfer codes that employ minimum possible bandwidth to
repair the systematic nodes and are thus access optimal for the repair of a
systematic node.
  The zigzag construction by Tamo et al. in which both systematic and parity
nodes are repaired is access optimal. But the sub-packetization level required
is $r^k$ where $r$ is the number of parities and $k$ is the number of
systematic nodes. To date, the best known achievable sub-packetization level
for access-optimal codes is $r^{k/r}$ in a MISER-code-based construction by
Cadambe et al. in which only the systematic nodes are repaired and where the
location of symbols transmitted by a helper node depends only on the failed
node and is the same for all helper nodes. Under this set-up, it turns out that
this sub-packetization level cannot be improved upon. In the present paper, we
present an alternate construction under the same setup, of an access-optimal
code repairing systematic nodes, that is inspired by the zigzag code
construction and that also achieves a sub-packetization level of $r^{k/r}$.
","[{'version': 'v1', 'created': 'Tue, 20 Jan 2015 11:01:47 GMT'}]",2015-01-21,"[['Agarwal', 'Gaurav Kumar', ''], ['Sasidharan', 'Birenjith', ''], ['Kumar', 'P. Vijay', '']]","['Distributed storage', 'array codes', 'access-optimal', 'regenerating codes', 'sub-packetization']"
17482,1412.6072,Khaled Elbassioni,"Endre Boros, Khaled Elbassioni, Vladimir Gurvich and Kazuhisa Makino",A Nested Family of $k$-total Effective Rewards for Positional Games,,,,,cs.DM cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider Gillette's two-person zero-sum stochastic games with perfect
information. For each $k \in \ZZ_+$ we introduce an effective reward function,
called $k$-total. For $k = 0$ and $1$ this function is known as {\it mean
payoff} and {\it total reward}, respectively. We restrict our attention to the
deterministic case. For all $k$, we prove the existence of a saddle point which
can be realized by uniformly optimal pure stationary strategies. We also
demonstrate that $k$-total reward games can be embedded into $(k+1)$-total
reward games.
","[{'version': 'v1', 'created': 'Thu, 20 Nov 2014 09:28:24 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Aug 2015 07:25:42 GMT'}]",2015-08-17,"[['Boros', 'Endre', ''], ['Elbassioni', 'Khaled', ''], ['Gurvich', 'Vladimir', ''], ['Makino', 'Kazuhisa', '']]","['stochastic game with perfect information', 'cyclic games', 'two-person', 'zero-sum', 'mean payoff', 'total reward']"
17483,1403.0306,Loc Tran Vinh,"Loc V. Tran, Vinh Phu Nguyen, M. Abdel Wahab, H. Nguyen-Xuan","An extended isogeometric analysis for vibration of cracked FGM plates
  using higher-order shear deformation theory",,,,,cs.CE math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel and effective formulation that combines the eXtended IsoGeometric
Approach (XIGA) and Higher-order Shear Deformation Theory (HSDT) is proposed to
study the free vibration of cracked Functionally Graded Material (FGM) plates.
Herein, the general HSDT model with five unknown variables per node is applied
for calculating the stiffness matrix without needing Shear Correction Factor
(SCF). In order to model the discontinuous and singular phenomena in the
cracked plates, IsoGeometric Analysis (IGA) utilizing the Non-Uniform Rational
B-Spline (NURBS) functions is incorporated with enrichment functions through
the partition of unity method. NURBS basis functions with their inherent
arbitrary high order smoothness permit the C1 requirement of the HSDT model.
The material properties of the FGM plates vary continuously through the plate
thickness according to an exponent function. The effects of gradient index,
crack length, crack location, length to thickness on the natural frequencies
and mode shapes of simply supported and clamped FGM plate are studied.
Numerical examples are provided to show excellent performance of the proposed
method compared with other published solutions in the literature.
","[{'version': 'v1', 'created': 'Mon, 3 Mar 2014 04:09:30 GMT'}]",2014-03-04,"[['Tran', 'Loc V.', ''], ['Nguyen', 'Vinh Phu', ''], ['Wahab', 'M. Abdel', ''], ['Nguyen-Xuan', 'H.', '']]","['Functionally Graded Material', 'Non-Uniform Rational B-Spline', 'Higher-order']"
17484,1412.5272,Qiang Wu,Jun Fan and Ting Hu and Qiang Wu and Ding-Xuan Zhou,Consistency Analysis of an Empirical Minimum Error Entropy Algorithm,,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we study the consistency of an empirical minimum error entropy
(MEE) algorithm in a regression setting. We introduce two types of consistency.
The error entropy consistency, which requires the error entropy of the learned
function to approximate the minimum error entropy, is shown to be always true
if the bandwidth parameter tends to 0 at an appropriate rate. The regression
consistency, which requires the learned function to approximate the regression
function, however, is a complicated issue. We prove that the error entropy
consistency implies the regression consistency for homoskedastic models where
the noise is independent of the input variable. But for heteroskedastic models,
a counterexample is used to show that the two types of consistency do not
coincide. A surprising result is that the regression consistency is always
true, provided that the bandwidth parameter tends to infinity at an appropriate
rate. Regression consistency of two classes of special models is shown to hold
with fixed bandwidth parameter, which further illustrates the complexity of
regression consistency of MEE. Fourier transform plays crucial roles in our
analysis.
","[{'version': 'v1', 'created': 'Wed, 17 Dec 2014 07:11:01 GMT'}]",2014-12-18,"[['Fan', 'Jun', ''], ['Hu', 'Ting', ''], ['Wu', 'Qiang', ''], ['Zhou', 'Ding-Xuan', '']]","['minimum error entropy', 'learning theory', 'R´enyi’s entropy', 'error entropy consistency', 'regression consistency']"
17485,1705.05785,Sebastijan Dumancic,Sebastijan Duman\v{c}i\'c and Hendrik Blockeel,Demystifying Relational Latent Representations,"12 pages, 8 figures; accepted to ILP 2017",,,,cs.AI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Latent features learned by deep learning approaches have proven to be a
powerful tool for machine learning. They serve as a data abstraction that makes
learning easier by capturing regularities in data explicitly. Their benefits
motivated their adaptation to relational learning context. In our previous
work, we introduce an approach that learns relational latent features by means
of clustering instances and their relations. The major drawback of latent
representations is that they are often black-box and difficult to interpret.
This work addresses these issues and shows that (1) latent features created by
clustering are interpretable and capture interesting properties of data; (2)
they identify local regions of instances that match well with the label, which
partially explains their benefit; and (3) although the number of latent
features generated by this approach is large, often many of them are highly
redundant and can be removed without hurting performance much.
","[{'version': 'v1', 'created': 'Tue, 16 May 2017 16:06:59 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Sep 2017 13:46:17 GMT'}, {'version': 'v3', 'created': 'Fri, 29 Sep 2017 07:36:32 GMT'}]",2017-10-02,"[['Dumančić', 'Sebastijan', ''], ['Blockeel', 'Hendrik', '']]","['relational learning', 'deep learning', 'unsupervised representation learning', 'clustering']"
17486,1407.1428,Avery Miller,"Avery Miller, Andrzej Pelc",Fast Rendezvous with Advice,,,,,cs.DS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two mobile agents, starting from different nodes of an $n$-node network at
possibly different times, have to meet at the same node. This problem is known
as rendezvous. Agents move in synchronous rounds using a deterministic
algorithm. In each round, an agent decides to either remain idle or to move to
one of the adjacent nodes. Each agent has a distinct integer label from the set
$\{1,...,L\}$, which it can use in the execution of the algorithm, but it does
not know the label of the other agent.
  If $D$ is the distance between the initial positions of the agents, then
$\Omega(D)$ is an obvious lower bound on the time of rendezvous. However, if
each agent has no initial knowledge other than its label, time $O(D)$ is
usually impossible to achieve. We study the minimum amount of information that
has to be available a priori to the agents to achieve rendezvous in optimal
time $\Theta(D)$. This information is provided to the agents at the start by an
oracle knowing the entire instance of the problem, i.e., the network, the
starting positions of the agents, their wake-up rounds, and both of their
labels. The oracle helps the agents by providing them with the same binary
string called advice, which can be used by the agents during their navigation.
The length of this string is called the size of advice. Our goal is to find the
smallest size of advice which enables the agents to meet in time $\Theta(D)$.
We show that this optimal size of advice is $\Theta(D\log(n/D)+\log\log L)$.
The upper bound is proved by constructing an advice string of this size, and
providing a natural rendezvous algorithm using this advice that works in time
$\Theta(D)$ for all networks. The matching lower bound, which is the main
contribution of this paper, is proved by exhibiting classes of networks for
which it is impossible to achieve rendezvous in time $\Theta(D)$ with smaller
advice.
","[{'version': 'v1', 'created': 'Sat, 5 Jul 2014 19:33:08 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Oct 2014 13:08:32 GMT'}]",2014-10-07,"[['Miller', 'Avery', ''], ['Pelc', 'Andrzej', '']]","['rendezvous', 'advice', 'deterministic distributed algorithm', 'mobile agent', 'time']"
17487,1402.6859,Ahmed Ibrahim Taloba,"M. H. Marghny, Ahmed I. Taloba",Outlier Detection using Improved Genetic K-means,,,,,cs.LG cs.DB,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The outlier detection problem in some cases is similar to the classification
problem. For example, the main concern of clustering-based outlier detection
algorithms is to find clusters and outliers, which are often regarded as noise
that should be removed in order to make more reliable clustering. In this
article, we present an algorithm that provides outlier detection and data
clustering simultaneously. The algorithmimprovesthe estimation of centroids of
the generative distribution during the process of clustering and outlier
discovery. The proposed algorithm consists of two stages. The first stage
consists of improved genetic k-means algorithm (IGK) process, while the second
stage iteratively removes the vectors which are far from their cluster
centroids.
","[{'version': 'v1', 'created': 'Thu, 27 Feb 2014 11:07:00 GMT'}]",2014-05-25,"[['Marghny', 'M. H.', ''], ['Taloba', 'Ahmed I.', '']]","['Outlier detection', 'Genetic algorithms', 'Clustering', 'K-means algorithm', 'Improved Genetic K-means (IGK)']"
17488,1603.08701,Enrico Santus,"Enrico Santus, Tin-Shing Chiu, Qin Lu, Alessandro Lenci, Chu-Ren Huang","What a Nerd! Beating Students and Vector Cosine in the ESL and TOEFL
  Datasets",in LREC 2016,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we claim that Vector Cosine, which is generally considered one
of the most efficient unsupervised measures for identifying word similarity in
Vector Space Models, can be outperformed by a completely unsupervised measure
that evaluates the extent of the intersection among the most associated
contexts of two target words, weighting such intersection according to the rank
of the shared contexts in the dependency ranked lists. This claim comes from
the hypothesis that similar words do not simply occur in similar contexts, but
they share a larger portion of their most relevant contexts compared to other
related words. To prove it, we describe and evaluate APSyn, a variant of
Average Precision that, independently of the adopted parameters, outperforms
the Vector Cosine and the co-occurrence on the ESL and TOEFL test sets. In the
best setting, APSyn reaches 0.73 accuracy on the ESL dataset and 0.70 accuracy
in the TOEFL dataset, beating therefore the non-English US college applicants
(whose average, as reported in the literature, is 64.50%) and several
state-of-the-art approaches.
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2016 10:00:27 GMT'}]",2016-03-30,"[['Santus', 'Enrico', ''], ['Chiu', 'Tin-Shing', ''], ['Lu', 'Qin', ''], ['Lenci', 'Alessandro', ''], ['Huang', 'Chu-Ren', '']]","['Vector Space Models', 'VSMs', 'Distributional Semantic Models', 'DSMs', 'Semantic Relations', 'Words Similarity']"
17489,1110.0578,Pavel Vasev,Pavel Vasev,Open Input: A New Way for Websites to Grow,"4 pages, 1 figure",,,,cs.HC cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Regardless of current web 2.0 and 3.0 trends, there are still a lot of
websites made in web 1.0 style. These websites have fixed pages which are
editable only by owner and not by community. It is normal for a lot of cases,
but looks like not modern and engaging approach. Are there any ways to make
these sites closer to life? This paper is devoted to open input technique, a
way for websites of web 1.0 era to grow and evolve community. The idea of open
input, in general, means that anybody from the web can add information to any
section of the website even without registration on that website. People can
add news, billboard announcements, testimonials, questions, pictures, videos
etc - whatever site owner permitted. We have tested this idea in practice and
have positive results approving that open input is a vital approach for
collaboration on the web.
","[{'version': 'v1', 'created': 'Tue, 4 Oct 2011 04:50:00 GMT'}]",2011-10-05,"[['Vasev', 'Pavel', '']]","['Internet', 'collaboration', 'websites', 'web 2.0', 'open input', 'CMS', 'website builder']"
17490,1606.08928,Annamalai Narayanan,"Annamalai Narayanan, Mahinthan Chandramohan, Lihui Chen, Yang Liu and
  Santhoshkumar Saminathan","subgraph2vec: Learning Distributed Representations of Rooted Sub-graphs
  from Large Graphs",,,,,cs.LG cs.AI cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present subgraph2vec, a novel approach for learning latent
representations of rooted subgraphs from large graphs inspired by recent
advancements in Deep Learning and Graph Kernels. These latent representations
encode semantic substructure dependencies in a continuous vector space, which
is easily exploited by statistical models for tasks such as graph
classification, clustering, link prediction and community detection.
subgraph2vec leverages on local information obtained from neighbourhoods of
nodes to learn their latent representations in an unsupervised fashion. We
demonstrate that subgraph vectors learnt by our approach could be used in
conjunction with classifiers such as CNNs, SVMs and relational data clustering
algorithms to achieve significantly superior accuracies. Also, we show that the
subgraph vectors could be used for building a deep learning variant of
Weisfeiler-Lehman graph kernel. Our experiments on several benchmark and
large-scale real-world datasets reveal that subgraph2vec achieves significant
improvements in accuracies over existing graph kernels on both supervised and
unsupervised learning tasks. Specifically, on two realworld program analysis
tasks, namely, code clone and malware detection, subgraph2vec outperforms
state-of-the-art kernels by more than 17% and 4%, respectively.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2016 01:05:36 GMT'}]",2016-06-30,"[['Narayanan', 'Annamalai', ''], ['Chandramohan', 'Mahinthan', ''], ['Chen', 'Lihui', ''], ['Liu', 'Yang', ''], ['Saminathan', 'Santhoshkumar', '']]","['Graph Kernels', 'Deep Learning', 'Representation Learning']"
17491,1603.06798,Fran\c{c}ois Simon,Francois Simon,On The Capacity Of Noisy Computations,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an analysis of the concept of capacity for noisy com-
putations, i.e. functions implemented by unreliable or random devices. An
information theoretic model of noisy computation of a perfect function f
(measurable function between sequence spaces) thanks to an unreliable device
(random channel) F is given: a noisy computation is a product fxF of channels.
A model of reliable computation based on input encoding and output decoding is
also proposed. These models extend those of noisy communication channel and of
reliable communication through a noisy channel. The capacity of a noisy
computation is defined and justified by a coding theorem and a converse. Under
some constraints on the encoding process, capacity is the upper bound of input
rates allowing reliable computation, i.e. decodability of noisy outputs into
expected outputs. These results hold when the one-sided random processes under
concern are asymptotic mean stationary (AMS) and ergodic. In addition, some
characterizations of AMS and ergodic noisy computations are given based on
stability properties of the perfect function f and of the random channel F.
These results are derived from the more general framework of channel products.
Finally, a way to apply the noisy and reliable computation models to cases
where the perfect function f is defined according to a formal computational
model is proposed.
","[{'version': 'v1', 'created': 'Tue, 22 Mar 2016 14:08:40 GMT'}]",2016-03-23,"[['Simon', 'Francois', '']]","['Noisy Computation', 'Capacity of Noisy Computation', 'Coding Theorem', 'Channel Product']"
17492,1506.04111,Wei Wang,Wei Wang and Kenneth Shirley,Breaking Bad: Detecting malicious domains using word segmentation,"In Proceedings of the 9th Workshop on Web 2.0 Security and Privacy
  (W2SP) 2015",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, vulnerable hosts and maliciously registered domains have
been frequently involved in mobile attacks. In this paper, we explore the
feasibility of detecting malicious domains visited on a cellular network based
solely on lexical characteristics of the domain names. In addition to using
traditional quantitative features of domain names, we also use a word
segmentation algorithm to segment the domain names into individual words to
greatly expand the size of the feature set. Experiments on a sample of
real-world data from a large cellular network show that using word segmentation
improves our ability to detect malicious domains relative to approaches without
segmentation, as measured by misclassification rates and areas under the ROC
curve. Furthermore, the results are interpretable, allowing one to discover
(with little supervision or tuning required) which words are used most often to
attract users to malicious domains. Such a lightweight approach could be
performed in near-real time when a device attempts to visit a domain. This
approach can complement (rather than substitute) other more expensive and
time-consuming approaches to similar problems that use richer feature sets.
","[{'version': 'v1', 'created': 'Fri, 12 Jun 2015 18:48:50 GMT'}]",2015-06-15,"[['Wang', 'Wei', ''], ['Shirley', 'Kenneth', '']]","['Mobile Network Security', 'Domain Name Analysis', 'Text Mining', 'Logistic Regression', 'Word Segmentation', 'LassoRegularization']"
17493,1410.0640,Hugo Jair  Escalante,"Hugo Jair Escalante, Mauricio A. Garc\'ia-Lim\'on, Alicia
  Morales-Reyes, Mario Graff, Manuel Montes-y-G\'omez, Eduardo F. Morales",Term-Weighting Learning via Genetic Programming for Text Classification,,,,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a novel approach to learning term-weighting schemes
(TWSs) in the context of text classification. In text mining a TWS determines
the way in which documents will be represented in a vector space model, before
applying a classifier. Whereas acceptable performance has been obtained with
standard TWSs (e.g., Boolean and term-frequency schemes), the definition of
TWSs has been traditionally an art. Further, it is still a difficult task to
determine what is the best TWS for a particular problem and it is not clear
yet, whether better schemes, than those currently available, can be generated
by combining known TWS. We propose in this article a genetic program that aims
at learning effective TWSs that can improve the performance of current schemes
in text classification. The genetic program learns how to combine a set of
basic units to give rise to discriminative TWSs. We report an extensive
experimental study comprising data sets from thematic and non-thematic text
classification as well as from image classification. Our study shows the
validity of the proposed method; in fact, we show that TWSs learned with the
genetic program outperform traditional schemes and other TWSs proposed in
recent works. Further, we show that TWSs learned from a specific domain can be
effectively used for other tasks.
","[{'version': 'v1', 'created': 'Thu, 2 Oct 2014 18:38:11 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Oct 2014 19:47:03 GMT'}, {'version': 'v3', 'created': 'Mon, 6 Oct 2014 20:48:29 GMT'}]",2014-10-08,"[['Escalante', 'Hugo Jair', ''], ['García-Limón', 'Mauricio A.', ''], ['Morales-Reyes', 'Alicia', ''], ['Graff', 'Mario', ''], ['Montes-y-Gómez', 'Manuel', ''], ['Morales', 'Eduardo F.', '']]","['Term-weighting Learning', 'Genetic Programming', 'Text Mining', 'Representation Learning', 'Bag of words']"
17494,1802.06852,Zeeshan Bhatti,"Zeeshan Bhatti, Ahsan Abro, Abdul Rehman Gillal, Mostafa Karbasi",Be-Educated: Multimedia Learning through 3D Animation,"10 pages, 32 figures","INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND EMERGING
  TECHNOLOGIES,(IJCET)- VOL1(1) DECEMBER 2017- 13-22",,,cs.GR cs.MM,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Multimedia learning tools and techniques are placing its importance with
large scale in education sector. With the help of multimedia learning, various
complex phenomenon and theories can be explained and taught easily and
conveniently. This project aims to teach and spread the importance of education
and respecting the tools of education: pen, paper, pencil, rubber. To achieve
this cognitive learning, a 3D animated movie has been developed using
principles of multimedia learning with 3D cartoon characters resembling the
actual educational objects, where the buildings have also been modelled to
resemble real books and diaries. For modelling and animation of these
characters, polygon mesh tools are used in 3D Studio Max. Additionally, the
final composition of video and audio is performed in adobe premiere. This 3D
animated video aims to highlight a message of importance for education and
stationary. The Moral of movie is that do not waste your stationary material,
use your Pen and Paper for the purpose they are made for. To be a good citizen
you have to Be-Educated yourself and for that you need to give value to Pen.
The final rendered and composited 3D animated video reflects this moral and
portrays the intended message with very vibrant visuals
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 21:08:50 GMT'}]",2018-02-21,"[['Bhatti', 'Zeeshan', ''], ['Abro', 'Ahsan', ''], ['Gillal', 'Abdul Rehman', ''], ['Karbasi', 'Mostafa', '']]","['Education', 'Animation', 'Multimedia', 'Learning', 'cognitive learning', '3D']"
17495,1710.02316,Jean Stawiaski,Jean Stawiaski,"A Multiscale Patch Based Convolutional Network for Brain Tumor
  Segmentation",,,,,cs.CV q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents a multiscale patch based convolutional neural network
for the automatic segmentation of brain tumors in multi-modality 3D MR images.
We use multiscale deep supervision and inputs to train a convolutional network.
We evaluate the effectiveness of the proposed approach on the BRATS 2017
segmentation challenge where we obtained dice scores of 0.755, 0.900, 0.782 and
95% Hausdorff distance of 3.63mm, 4.10mm, and 6.81mm for enhanced tumor core,
whole tumor and tumor core respectively.
","[{'version': 'v1', 'created': 'Fri, 6 Oct 2017 09:04:28 GMT'}]",2017-10-09,"[['Stawiaski', 'Jean', '']]","['Brain tumor', 'convolutional neural network', 'image segmentation']"
17496,1611.00889,Kasra Khosoussi,"Kasra Khosoussi, Gaurav S. Sukhatme, Shoudong Huang, Gamini
  Dissanayake",Designing Sparse Reliable Pose-Graph SLAM: A Graph-Theoretic Approach,WAFR 2016,,,,cs.RO cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we aim to design sparse D-optimal (determinantoptimal)
pose-graph SLAM problems through the synthesis of sparse graphs with the
maximum weighted number of spanning trees. Characterizing graphs with the
maximum number of spanning trees is an open problem in general. To tackle this
problem, several new theoretical results are established in this paper,
including the monotone log-submodularity of the weighted number of spanning
trees. By exploiting these structures, we design a complementary pair of
near-optimal efficient approximation algorithms with provable guarantees. Our
theoretical results are validated using random graphs and a publicly available
pose-graph SLAM dataset.
","[{'version': 'v1', 'created': 'Thu, 3 Nov 2016 05:52:37 GMT'}]",2016-11-04,"[['Khosoussi', 'Kasra', ''], ['Sukhatme', 'Gaurav S.', ''], ['Huang', 'Shoudong', ''], ['Dissanayake', 'Gamini', '']]","['Number of Spanning Trees', 'D-Optimal Pose-Graph SLAM', 'Approximation Algorithms']"
17497,1305.7254,Imen Ayachi,"I. Ayachi, R. Kammarti, M.Ksouri, P.Borne LACS, ENIT, Tunis-Belvedere
  Tunisie LAGIS, ECL, Villeneuve d Ascq, France","Harmony search to solve the container storage problem with different
  container types",7 pages,"International Journal of Computer Applications, June 2012",,"Volume 48-- No.22, June 2012",cs.AI,http://creativecommons.org/licenses/by/3.0/,"  This paper presents an adaptation of the harmony search algorithm to solve
the storage allocation problem for inbound and outbound containers. This
problem is studied considering multiple container type (regular, open side,
open top, tank, empty and refrigerated) which lets the situation more
complicated, as various storage constraints appeared. The objective is to find
an optimal container arrangement which respects their departure dates, and
minimize the re-handle operations of containers. The performance of the
proposed approach is verified comparing to the results generated by genetic
algorithm and LIFO algorithm.
","[{'version': 'v1', 'created': 'Thu, 30 May 2013 21:13:25 GMT'}]",2013-06-03,"[['Ayachi', 'I.', ''], ['Kammarti', 'R.', ''], ['Ksouri', 'M.', ''], ['LACS', 'P. Borne', ''], ['ENIT', '', ''], ['LAGIS', 'Tunis-Belvedere Tunisie', ''], ['ECL', '', ''], ['Ascq', 'Villeneuve d', ''], ['France', '', '']]","['Harmony search', 'Genetic algorithm', 'transport scheduling', 'metaheuristic', 'optimization', 'container storage']"
17498,1402.0761,Kristina Sojakova,Kristina Sojakova,Higher Inductive Types as Homotopy-Initial Algebras,,,,,cs.LO math.CT math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Homotopy Type Theory is a new field of mathematics based on the surprising
and elegant correspondence between Martin-Lofs constructive type theory and
abstract homotopy theory. We have a powerful interplay between these
disciplines - we can use geometric intuition to formulate new concepts in type
theory and, conversely, use type-theoretic machinery to verify and often
simplify existing mathematical proofs. A crucial ingredient in this new system
are higher inductive types, which allow us to represent objects such as
spheres, tori, pushouts, and quotients. We investigate a variant of higher
inductive types whose computational behavior is determined up to a higher path.
We show that in this setting, higher inductive types are characterized by the
universal property of being a homotopy-initial algebra.
","[{'version': 'v1', 'created': 'Tue, 4 Feb 2014 15:22:49 GMT'}]",2014-02-10,"[['Sojakova', 'Kristina', '']]","['Homotopy Type Theory', 'higher inductive types', 'homotopy-initial algebras']"
17499,1506.01701,Yuliya Boyarinova,"Yakiv O. Kalinovsky, Yuliya E. Boyarinova, Iana V. Khitsko","Reversible Digital Filters Total Parametric Sensitivity Optimization
  using Non-canonical Hypercomplex Number Systems",,,,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Digital filter construction method, which is optimal by parametric
sensitivity, based on using of non-canonical hypercomplex number systems is
proposed and investigated. It is shown that the use of non-canonical
hypercomplex number system with greater number of non-zero structure constants
in multiplication table can significantly improve the sensitivity of the
digital filter.
","[{'version': 'v1', 'created': 'Sun, 25 Jan 2015 18:38:09 GMT'}]",2015-06-08,"[['Kalinovsky', 'Yakiv O.', ''], ['Boyarinova', 'Yuliya E.', ''], ['Khitsko', 'Iana V.', '']]","['non-canonical  hypercomplex  number  system', 'digital  filter', 'hypercomplex  numbers', 'frequency']"
17500,1701.08893,Connelly Barnes,"Eric Risser, Pierre Wilmot, Connelly Barnes","Stable and Controllable Neural Texture Synthesis and Style Transfer
  Using Histogram Losses",,,,,cs.GR cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, methods have been proposed that perform texture synthesis and style
transfer by using convolutional neural networks (e.g. Gatys et al.
[2015,2016]). These methods are exciting because they can in some cases create
results with state-of-the-art quality. However, in this paper, we show these
methods also have limitations in texture quality, stability, requisite
parameter tuning, and lack of user controls. This paper presents a multiscale
synthesis pipeline based on convolutional neural networks that ameliorates
these issues. We first give a mathematical explanation of the source of
instabilities in many previous approaches. We then improve these instabilities
by using histogram losses to synthesize textures that better statistically
match the exemplar. We also show how to integrate localized style losses in our
multiscale framework. These losses can improve the quality of large features,
improve the separation of content and style, and offer artistic controls such
as paint by numbers. We demonstrate that our approach offers improved quality,
convergence in fewer iterations, and more stability over the optimization.
","[{'version': 'v1', 'created': 'Tue, 31 Jan 2017 02:37:19 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Feb 2017 23:30:20 GMT'}]",2017-02-09,"[['Risser', 'Eric', ''], ['Wilmot', 'Pierre', ''], ['Barnes', 'Connelly', '']]","['style transfer', 'texture synthesis', 'neural networks']"
17501,1410.6558,Raja Giryes,Raja Giryes,Sampling in the Analysis Transform Domain,"13 Pages, 2 figures",,,,cs.IT math.IT math.NA stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many signal and image processing applications have benefited remarkably from
the fact that the underlying signals reside in a low dimensional subspace. One
of the main models for such a low dimensionality is the sparsity one. Within
this framework there are two main options for the sparse modeling: the
synthesis and the analysis ones, where the first is considered the standard
paradigm for which much more research has been dedicated. In it the signals are
assumed to have a sparse representation under a given dictionary. On the other
hand, in the analysis approach the sparsity is measured in the coefficients of
the signal after applying a certain transformation, the analysis dictionary, on
it. Though several algorithms with some theory have been developed for this
framework, they are outnumbered by the ones proposed for the synthesis
methodology.
  Given that the analysis dictionary is either a frame or the two dimensional
finite difference operator, we propose a new sampling scheme for signals from
the analysis model that allows to recover them from their samples using any
existing algorithm from the synthesis model. The advantage of this new sampling
strategy is that it makes the existing synthesis methods with their theory also
available for signals from the analysis framework.
","[{'version': 'v1', 'created': 'Fri, 24 Oct 2014 03:32:07 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Mar 2015 22:35:05 GMT'}]",2015-03-25,"[['Giryes', 'Raja', '']]","['Sparse representations', 'Compressed sensing', 'Synthesis', 'Analysis', 'Transform Domain']"
17502,1701.04341,Pablo Solerno,"Amir Hashemi, Joos Heintz, Luis Miguel Pardo, Pablo Solern\'o",On Bezout Inequalities for non-homogeneous Polynomial Ideals,,,,,cs.SC cs.CC math.AC math.AG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a ""workable"" notion of degree for non-homogeneous polynomial
ideals and formulate and prove ideal theoretic B\'ezout Inequalities for the
sum of two ideals in terms of this notion of degree and the degree of
generators. We compute probabilistically the degree of an equidimensional
ideal.
","[{'version': 'v1', 'created': 'Mon, 16 Jan 2017 15:59:40 GMT'}]",2017-01-17,"[['Hashemi', 'Amir', ''], ['Heintz', 'Joos', ''], ['Pardo', 'Luis Miguel', ''], ['Solernó', 'Pablo', '']]","['Non-homogeneous polynomial ideal', 'ideal degree', 'idealistic B´ezoutInequality']"
17503,1206.6201,Yushi Uno,"Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno",On Complexity of Flooding Games on Graphs with Interval Representations,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The flooding games, which are called Flood-It, Mad Virus, or HoneyBee, are a
kind of coloring games and they have been becoming popular online. In these
games, each player colors one specified cell in his/her turn, and all connected
neighbor cells of the same color are also colored by the color. This flooding
or coloring spreads on the same color cells. It is natural to consider these
new coloring games on more general boards, or general graphs. Recently,
computational complexities of the variants of the flooding games on several
graph classes have been studied. In this paper, we investigate the flooding
games on some graph classes characterized by interval representations. Our
results state that the number of colors is a key parameter to determine the
computational complexity of the flooding games. When the number of colors is a
fixed constant, these games can be solved in polynomial time on an interval
graph. On the other hand, if the number of colors is not bounded, the flooding
game is NP-complete on a proper interval graph. We also state similar results
for split graphs.
","[{'version': 'v1', 'created': 'Wed, 27 Jun 2012 08:27:44 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Jan 2013 04:11:25 GMT'}]",2013-01-28,"[['Fukui', 'Hiroyuki', ''], ['Otachi', 'Yota', ''], ['Uehara', 'Ryuhei', ''], ['Uno', 'Takeaki', ''], ['Uno', 'Yushi', '']]","['Computational complexity', 'fixed parameter tractable', 'flooding game', 'graph coloring', 'interval graph', 'split graph']"
17504,0907.0808,Hal Daum\'e III,Hal Daum\'e III and Daniel Marcu,"A Bayesian Model for Supervised Clustering with the Dirichlet Process
  Prior",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We develop a Bayesian framework for tackling the supervised clustering
problem, the generic problem encountered in tasks such as reference matching,
coreference resolution, identity uncertainty and record linkage. Our clustering
model is based on the Dirichlet process prior, which enables us to define
distributions over the countably infinite sets that naturally arise in this
problem. We add supervision to our model by positing the existence of a set of
unobserved random variables (we call these ""reference types"") that are generic
across all clusters. Inference in our framework, which requires integrating
over infinitely many parameters, is solved using Markov chain Monte Carlo
techniques. We present algorithms for both conjugate and non-conjugate priors.
We present a simple--but general--parameterization of our model based on a
Gaussian assumption. We evaluate this model on one artificial task and three
real-world tasks, comparing it against both unsupervised and state-of-the-art
supervised algorithms. Our results show that our model is able to outperform
other models across a variety of tasks and performance metrics.
","[{'version': 'v1', 'created': 'Sat, 4 Jul 2009 22:32:58 GMT'}]",2009-07-07,"[['Daumé', 'Hal', 'III'], ['Marcu', 'Daniel', '']]","['supervised clustering', 'record linkage', 'citation matching', 'coreference', 'Dirichletprocess', 'non-parametric Bayesian']"
17505,1702.07835,Wajdi Zaghouani,Wajdi Zaghouani,Critical Survey of the Freely Available Arabic Corpora,"Published in the Proceedings of the International Conference on
  Language Resources and Evaluation (LREC'2014), OSACT Workshop. Reykjavik,
  Iceland, 26-31 May 2014",,,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  The availability of corpora is a major factor in building natural language
processing applications. However, the costs of acquiring corpora can prevent
some researchers from going further in their endeavours. The ease of access to
freely available corpora is urgent needed in the NLP research community
especially for language such as Arabic. Currently, there is not easy was to
access to a comprehensive and updated list of freely available Arabic corpora.
We present in this paper, the results of a recent survey conducted to identify
the list of the freely available Arabic corpora and language resources. Our
preliminary results showed an initial list of 66 sources. We presents our
findings in the various categories studied and we provided the direct links to
get the data when possible.
","[{'version': 'v1', 'created': 'Sat, 25 Feb 2017 05:16:15 GMT'}]",2017-02-28,"[['Zaghouani', 'Wajdi', '']]","['Arabic', 'Open source', 'Free', 'Corpora', 'Corpus', 'Survey']"
17506,1207.5734,Selvakanmani Nandakumar,S. Selvakanmani and M. Sumathi,A Review of routing protocols for mobile cognitive radio ad hoc networks,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ad hoc network is a collection of wireless mobile nodes that dynamically form
a temporary network without the use of any existing network infrastructure or
centralized administration. A cognitive radio is a radio that can change its
transmitter parameters based on interaction with the environment in which it
operates. The basic idea of cognitive radio networks is that the unlicensed
devices (cognitive radio users or secondary users) need to vacate the spectrum
band once the licensed device (primary user) is detected. Cognitive capability
and reconfigurability are the key characteristics of cognitive radio. Routing
is an important issue in Mobile Cognitive Radio Ad Hoc Networks (MCRAHNs). In
this paper, a survey of routing protocols for mobile cognitive radio ad
networks is discussed.
","[{'version': 'v1', 'created': 'Tue, 24 Jul 2012 15:56:44 GMT'}]",2012-07-25,"[['Selvakanmani', 'S.', ''], ['Sumathi', 'M.', '']]","['Cognitive Radio (CR)', 'Ad hoc networks', 'Spectrum Opportunities', 'Primary Users', 'Common Control Channel', 'Cognitive user']"
17507,1306.1894,Alejandro Frery,Mar\'ia Elena Buemi and Alejandro C. Frery and Heitor S. Ramos,Speckle Reduction with Adaptive Stack Filters,"Accepted for publication on Pattern Recognition Letters. arXiv admin
  note: substantial text overlap with arXiv:1207.4308",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stack filters are a special case of non-linear filters. They have a good
performance for filtering images with different types of noise while preserving
edges and details. A stack filter decomposes an input image into stacks of
binary images according to a set of thresholds. Each binary image is then
filtered by a Boolean function, which characterizes the filter. Adaptive stack
filters can be computed by training using a prototype (ideal) image and its
corrupted version, leading to optimized filters with respect to a loss
function. In this work we propose the use of training with selected samples for
the estimation of the optimal Boolean function. We study the performance of
adaptive stack filters when they are applied to speckled imagery, in particular
to Synthetic Aperture Radar (SAR) images. This is done by evaluating the
quality of the filtered images through the use of suitable image quality
indexes and by measuring the classification accuracy of the resulting images.
We used SAR images as input, since they are affected by speckle noise that
makes classification a difficult task.
","[{'version': 'v1', 'created': 'Sat, 8 Jun 2013 08:21:06 GMT'}]",2013-06-11,"[['Buemi', 'María Elena', ''], ['Frery', 'Alejandro C.', ''], ['Ramos', 'Heitor S.', '']]","['Non-linear filters', 'speckle noise', 'stack filters', 'SAR image filtering']"
17508,0803.3777,Vitaly Skachek,Vitaly Skachek and Mark F. Flanagan,"Lower Bounds on the Minimum Pseudodistance for Linear Codes with $q$-ary
  PSK Modulation over AWGN","6 pages, Proceedings 5-th International Symposium on Turbo Codes &
  related topics",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present lower bounds on the minimum pseudocodeword effective Euclidean
distance (or minimum ""pseudodistance"") for coded modulation systems using
linear codes with $q$-ary phase-shift keying (PSK) modulation over the additive
white Gaussian noise (AWGN) channel. These bounds apply to both binary and
nonbinary coded modulation systems which use direct modulation mapping of coded
symbols. The minimum pseudodistance may serve as a first-order measure of
error-correcting performance for both linear-programming and message-passing
based receivers. In the case of a linear-programming based receiver, the
minimum pseudodistance may be used to form an exact bound on the codeword error
rate of the system.
","[{'version': 'v1', 'created': 'Wed, 26 Mar 2008 17:28:46 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Jun 2008 18:01:07 GMT'}]",2008-06-12,"[['Skachek', 'Vitaly', ''], ['Flanagan', 'Mark F.', '']]","['Iterative decoding', 'linear-programming decoding', 'factor graph', 'graph cover', 'pseudocodewords', 'pseudodistance']"
17509,1212.2154,Yongming Li,"Yongming Li, Manfred Droste and Lihui Lei",Model-Checking of Linear-Time Properties in Multi-Valued Systems,"50 pages, 9 figures, 2 tables",,,,cs.LO cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study model-checking of linear-time properties in
multi-valued systems. Safety property, invariant property, liveness property,
persistence and dual-persistence properties in multi-valued logic systems are
introduced. Some algorithms related to the above multi-valued linear-time
properties are discussed. The verification of multi-valued regular safety
properties and multi-valued $\omega$-regular properties using lattice-valued
automata are thoroughly studied. Since the law of non-contradiction (i.e.,
$a\wedge \neg a=0$) and the law of excluded-middle (i.e., $a\vee \neg a=1$) do
not hold in multi-valued logic, the linear-time properties introduced in this
paper have the new forms compared to those in classical logic. Compared to
those classical model checking methods, our methods to multi-valued model
checking are more directly accordingly. A new form of multi-valued model
checking with membership degree is also introduced. In particular, we show that
multi-valued model-checking can be reduced to the classical model checking. The
related verification algorithms are also presented. Some illustrative examples
and case study are also provided.
","[{'version': 'v1', 'created': 'Mon, 26 Nov 2012 08:26:11 GMT'}, {'version': 'v2', 'created': 'Sun, 25 Sep 2016 02:59:13 GMT'}]",2016-09-27,"[['Li', 'Yongming', ''], ['Droste', 'Manfred', ''], ['Lei', 'Lihui', '']]","['Model checking', 'multi-valued transition system', 'invariant', 'safety', 'liveness', 'lattice-valued finite automaton']"
17510,1611.00169,Ananthanarayanan Chockalingam,Bharath Shamasundar and A. Chockalingam,Multiuser Media-based Modulation for Massive MIMO Systems,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider {\em media-based modulation (MBM)}, an attractive
modulation scheme which is getting increased research attention recently, for
the uplink of a massive MIMO system. Each user is equipped with one transmit
antenna with multiple radio frequency (RF) mirrors (parasitic elements) placed
near it. The base station (BS) is equipped with tens to hundreds of receive
antennas. MBM with $m_{rf}$ RF mirrors and $n_r$ receive antennas over a
multipath channel has been shown to asymptotically (as $m_{rf}\rightarrow
\infty$) achieve the capacity of $n_r$ parallel AWGN channels. This suggests
that MBM can be attractive for use in massive MIMO systems which typically
employ a large number of receive antennas at the BS. In this paper, we
investigate the potential performance advantage of multiuser MBM (MU-MBM) in a
massive MIMO setting. Our results show that multiuser MBM (MU-MBM) can
significantly outperform other modulation schemes. For example, a bit error
performance achieved using 500 receive antennas at the BS in a massive MIMO
system using conventional modulation can be achieved using just 128 antennas
using MU-MBM. Even multiuser spatial modulation, and generalized spatial
modulation in the same massive MIMO settings require more than 200 antennas to
achieve the same bit error performance. Also, recognizing that the MU-MBM
signal vectors are inherently sparse, we propose an efficient MU-MBM signal
detection scheme that uses compressive sensing based reconstruction algorithms
like orthogonal matching pursuit (OMP), compressive sampling matching pursuit
(CoSaMP), and subspace pursuit (SP).
","[{'version': 'v1', 'created': 'Tue, 1 Nov 2016 09:38:48 GMT'}]",2016-11-02,"[['Shamasundar', 'Bharath', ''], ['Chockalingam', 'A.', '']]","['Media-based modulation', 'RF mirrors', 'massiveMIMO', 'compressive sensing', 'sparse recovery', 'OMP', 'CoSaMP', 'subspace pursuit']"
17511,1402.5557,Vito Veneziano Dr,"Vito Veneziano, Austen W. Rainer, Sheraz Haider","When Agile Is Not Good Enough: an initial attempt at understanding how
  to make the right decision",,,,,cs.SE cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Particularly over the last ten years, Agile has attracted not only the
praises of a broad range of enthusiast software developers, but also the
criticism of others. Either way, adoption or rejection of Agile seems sometimes
to be based more on a questionable understanding than on a critical,
well-informed decision making process. In this paper, the dual nature of the
above criticism is discussed, and the arguments against Agile have been
classified within a critical taxonomy of risk factors. A decisional model and
tool based on such taxonomy are consequently proposed for supporting software
engineers and other stakeholders in the decision-making about whether or not to
use Agile. The tool, which is freely available online, comes with a set of
guidelines: its purpose is to facilitate the community of software developers
to contribute to further assessing the potential and the criticalities of Agile
Methods.
","[{'version': 'v1', 'created': 'Sat, 22 Feb 2014 22:16:35 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Jul 2014 16:31:57 GMT'}]",2014-07-03,"[['Veneziano', 'Vito', ''], ['Rainer', 'Austen W.', ''], ['Haider', 'Sheraz', '']]","['Agile', 'Criticism', 'Process Models', 'Decision-Making', 'Software Engineering', 'Critical Taxonomy']"
17512,1407.6954,"Robert Kl\""ofkorn","Martin Alk\""amper, Andreas Dedner, Robert Kl\""ofkorn, and Martin Nolte",The DUNE-ALUGrid Module,"25 pages, 11 figures",,,,cs.MS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present the new DUNE-ALUGrid module. This module contains a
major overhaul of the sources from the ALUgrid library and the binding to the
DUNE software framework. The main changes include user defined load balancing,
parallel grid construction, and an redesign of the 2d grid which can now also
be used for parallel computations. In addition many improvements have been
introduced into the code to increase the parallel efficiency and to decrease
the memory footprint.
  The original ALUGrid library is widely used within the DUNE community due to
its good parallel performance for problems requiring local adaptivity and
dynamic load balancing. Therefore, this new model will benefit a number of DUNE
users. In addition we have added features to increase the range of problems for
which the grid manager can be used, for example, introducing a 3d tetrahedral
grid using a parallel newest vertex bisection algorithm for conforming grid
refinement. In this paper we will discuss the new features, extensions to the
DUNE interface, and explain for various examples how the code is used in
parallel environments.
","[{'version': 'v1', 'created': 'Fri, 25 Jul 2014 16:12:26 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Jul 2014 08:02:59 GMT'}, {'version': 'v3', 'created': 'Sat, 15 Aug 2015 11:23:22 GMT'}]",2015-08-18,"[['Alkämper', 'Martin', ''], ['Dedner', 'Andreas', ''], ['Klöfkorn', 'Robert', ''], ['Nolte', 'Martin', '']]","['Numerical software', 'Adaptive-parallel grid', 'Load Balancing', 'Dune']"
17513,1705.06524,Mehmet Turan,"Mehmet Turan, Yusuf Yigit Pilavci, Redhwan Jamiruddin, Helder Araujo,
  Ender Konukoglu, Metin Sitti","A fully dense and globally consistent 3D map reconstruction approach for
  GI tract to enhance therapeutic relevance of the endoscopic capsule robot",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the gastrointestinal (GI) tract endoscopy field, ingestible wireless
capsule endoscopy is emerging as a novel, minimally invasive diagnostic
technology for inspection of the GI tract and diagnosis of a wide range of
diseases and pathologies. Since the development of this technology, medical
device companies and many research groups have made substantial progress in
converting passive capsule endoscopes to robotic active capsule endoscopes with
most of the functionality of current active flexible endoscopes. However,
robotic capsule endoscopy still has some challenges. In particular, the use of
such devices to generate a precise three-dimensional (3D) mapping of the entire
inner organ remains an unsolved problem. Such global 3D maps of inner organs
would help doctors to detect the location and size of diseased areas more
accurately and intuitively, thus permitting more reliable diagnoses. To our
knowledge, this paper presents the first complete pipeline for a complete 3D
visual map reconstruction of the stomach. The proposed pipeline is modular and
includes a preprocessing module, an image registration module, and a final
shape-from-shading-based 3D reconstruction module; the 3D map is primarily
generated by a combination of image stitching and shape-from-shading
techniques, and is updated in a frame-by-frame iterative fashion via capsule
motion inside the stomach. A comprehensive quantitative analysis of the
proposed 3D reconstruction method is performed using an esophagus gastro
duodenoscopy simulator, three different endoscopic cameras, and a 3D optical
scanner.
","[{'version': 'v1', 'created': 'Thu, 18 May 2017 11:12:32 GMT'}]",2017-05-19,"[['Turan', 'Mehmet', ''], ['Pilavci', 'Yusuf Yigit', ''], ['Jamiruddin', 'Redhwan', ''], ['Araujo', 'Helder', ''], ['Konukoglu', 'Ender', ''], ['Sitti', 'Metin', '']]","['Endoscopic Capsule Robot', '3D map reconstruction', 'Frame']"
17514,1702.03970,Ray Smith,"Raymond Smith, Chunhui Gu, Dar-Shyang Lee, Huiyi Hu, Ranjith
  Unnikrishnan, Julian Ibarz, Sacha Arnoud, Sophia Lin",End-to-End Interpretation of the French Street Name Signs Dataset,Presented at the IWRR workshop at ECCV 2016,"Computer Vision - ECCV 2016 Workshops Volume 9913 of the series
  Lecture Notes in Computer Science pp 411-426",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the French Street Name Signs (FSNS) Dataset consisting of more
than a million images of street name signs cropped from Google Street View
images of France. Each image contains several views of the same street name
sign. Every image has normalized, title case folded ground-truth text as it
would appear on a map. We believe that the FSNS dataset is large and complex
enough to train a deep network of significant complexity to solve the street
name extraction problem ""end-to-end"" or to explore the design trade-offs
between a single complex engineered network and multiple sub-networks designed
and trained to solve sub-problems. We present such an ""end-to-end""
network/graph for Tensor Flow and its results on the FSNS dataset.
","[{'version': 'v1', 'created': 'Mon, 13 Feb 2017 20:18:18 GMT'}]",2017-02-15,"[['Smith', 'Raymond', ''], ['Gu', 'Chunhui', ''], ['Lee', 'Dar-Shyang', ''], ['Hu', 'Huiyi', ''], ['Unnikrishnan', 'Ranjith', ''], ['Ibarz', 'Julian', ''], ['Arnoud', 'Sacha', ''], ['Lin', 'Sophia', '']]","['Deep Networks', 'End-to-end Networks', 'Image Dataset', 'Multiview Dataset']"
17515,1108.3250,Firouz Wassai,"Firouz Abdullah Al-Wassai, N.V. Kalyankar, Ali A. Al-Zaky",The Statistical methods of Pixel-Based Image Fusion Techniques,"Keywords: Data Fusion, Resolution Enhancement, Statistical fusion,
  Correlation Modeling, Matching, pixel based fusion","International Journal of Artificial Intelligence and Knowledge
  Discovery Vol.1, Issue 3, July, 2011",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are many image fusion methods that can be used to produce
high-resolution mutlispectral images from a high-resolution panchromatic (PAN)
image and low-resolution multispectral (MS) of remote sensed images. This paper
attempts to undertake the study of image fusion techniques with different
Statistical techniques for image fusion as Local Mean Matching (LMM), Local
Mean and Variance Matching (LMVM), Regression variable substitution (RVS),
Local Correlation Modeling (LCM) and they are compared with one another so as
to choose the best technique, that can be applied on multi-resolution satellite
images. This paper also devotes to concentrate on the analytical techniques for
evaluating the quality of image fusion (F) by using various methods including
Standard Deviation (SD), Entropy(En), Correlation Coefficient (CC), Signal-to
Noise Ratio (SNR), Normalization Root Mean Square Error (NRMSE) and Deviation
Index (DI) to estimate the quality and degree of information improvement of a
fused image quantitatively.
","[{'version': 'v1', 'created': 'Fri, 12 Aug 2011 16:51:21 GMT'}]",2011-08-17,"[['Al-Wassai', 'Firouz Abdullah', ''], ['Kalyankar', 'N. V.', ''], ['Al-Zaky', 'Ali A.', '']]","['Data Fusion', 'Resolution Enhancement', 'Statistical fusion', 'Correlation Modeling', 'Matching', 'pixel based fusion']"
17516,1505.03402,Mabel Iglesias-Ham,"Herbert Edelsbrunner, Mabel Iglesias-Ham and Vitaliy Kurlin",Relaxed Disk Packing,"8 pages => 5 pages of main text plus 3 pages in appendix. Submitted
  to CCCG 2015",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by biological questions, we study configurations of equal-sized
disks in the Euclidean plane that neither pack nor cover. Measuring the quality
by the probability that a random point lies in exactly one disk, we show that
the regular hexagonal grid gives the maximum among lattice configurations.
","[{'version': 'v1', 'created': 'Wed, 13 May 2015 14:29:51 GMT'}]",2015-05-14,"[['Edelsbrunner', 'Herbert', ''], ['Iglesias-Ham', 'Mabel', ''], ['Kurlin', 'Vitaliy', '']]","['Packing and covering', 'disks', 'lattices', 'Voronoi domains', 'Delaunay triangulations']"
17517,1206.1418,Dinh Que Tran,"Thuy Van T. Duong, Dinh Que Tran and Cong Hung Tran","A weighted combination similarity measure for mobility patterns in
  wireless networks","15 pages, 2 figures; International Journal of Computer Networks &
  Communications (IJCNC) http://airccse.org/journal/ijc2012.html",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The similarity between trajectory patterns in clustering has played an
important role in discovering movement behaviour of different groups of mobile
objects. Several approaches have been proposed to measure the similarity
between sequences in trajectory data. Most of these measures are based on
Euclidean space or on spatial network and some of them have been concerned with
temporal aspect or ordering types. However, they are not appropriate to
characteristics of spatiotemporal mobility patterns in wireless networks. In
this paper, we propose a new similarity measure for mobility patterns in
cellular space of wireless network. The framework for constructing our measure
is composed of two phases as follows. First, we present formal definitions to
capture mathematically two spatial and temporal similarity measures for
mobility patterns. And then, we define the total similarity measure by means of
a weighted combination of these similarities. The truth of the partial and
total similarity measures are proved in mathematics. Furthermore, instead of
the time interval or ordering, our work makes use of the timestamp at which two
mobility patterns share the same cell. A case study is also described to give a
comparison of the combination measure with other ones.
","[{'version': 'v1', 'created': 'Thu, 7 Jun 2012 07:58:18 GMT'}]",2012-06-08,"[['Duong', 'Thuy Van T.', ''], ['Tran', 'Dinh Que', ''], ['Tran', 'Cong Hung', '']]","['Wireless Network', 'Clustering', 'Mobility Patterns', 'Mobile Object', 'Similarity Measure', 'Trajectory']"
17518,1507.01677,Jagmohan Chauhan,"Jagmohan Chauhan, Mohamed Ali Kaafar, Anirban Mahanti","The Web for Under-Powered Mobile Devices: Lessons learned from Google
  Glass",,,,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper examines some of the potential challenges associated with enabling
a seamless web experience on underpowered mobile devices such as Google Glass
from the perspective of web content providers, device, and the network. We
conducted experiments to study the impact of webpage complexity, individual web
components and different application layer protocols while accessing webpages
on the performance of Glass browser, by measuring webpage load time,
temperature variation and power consumption and compare it to a smartphone. Our
findings suggest that (a) performance of Glass compared to a smartphone in
terms of power consumption and webpage load time deteriorates with increasing
webpage complexity (b) execution time for popular JavaScript benchmarks is
about 3-8 times higher on Glass compared to a smartphone, (c) WebP is more
energy efficient image format than JPEG and PNG, and (d) seven out of 50
websites studied are optimized for content delivery to Glass.
","[{'version': 'v1', 'created': 'Tue, 7 Jul 2015 05:20:51 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Jul 2015 07:44:44 GMT'}, {'version': 'v3', 'created': 'Sat, 28 Nov 2015 04:58:13 GMT'}]",2015-12-01,"[['Chauhan', 'Jagmohan', ''], ['Kaafar', 'Mohamed Ali', ''], ['Mahanti', 'Anirban', '']]","['Web Browser', 'Performance', 'Google Glass']"
17519,0708.4324,Stephane Caro,"St\'ephane Caro (IRCCyN), Philippe Wenger (IRCCyN), Fouad Bennis
  (IRCCyN), Damien Chablat (IRCCyN)","Sensitivity Analysis of the Orthoglide, a 3-DOF Translational Parallel
  Kinematic Machine",,Journal of Mechanical Design 128 (2006) 392-402,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a sensitivity analysis of the Orthoglide, a 3-DOF
translational Parallel Kinematic Machine. Two complementary methods are
developed to analyze its sensitivity to its dimensional and angular variations.
First, a linkage kinematic analysis method is used to have a rough idea of the
influence of the dimensional variations on the location of the end-effector.
Besides, this method shows that variations in the design parameters of the same
type from one leg to the other have the same influence on the end-effector.
However, this method does not take into account the variations in the
parallelograms. Thus, a differential vector method is used to study the
influence of the dimensional and angular variations in the parts of the
manipulator on the position and orientation of the end-effector, and
particularly the influence of the variations in the parallelograms. It turns
out that the kinematic isotropic configuration of the manipulator is the least
sensitive one to its dimensional and angular variations. On the contrary, the
closest configurations to its kinematic singular configurations are the most
sensitive ones to geometrical variations.
","[{'version': 'v1', 'created': 'Fri, 31 Aug 2007 11:53:35 GMT'}, {'version': 'v2', 'created': 'Wed, 4 Dec 2013 08:49:13 GMT'}]",2013-12-05,"[['Caro', 'Stéphane', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN'], ['Bennis', 'Fouad', '', 'IRCCyN'], ['Chablat', 'Damien', '', 'IRCCyN']]","['Parallel Kinematic Machine', 'Sensitivity Analysis', 'Kinematic Analysis', 'Kinematic Singularity', 'Isotropy']"
17520,1701.08030,Valentin Touzeau,"Valentin Touzeau (VERIMAG - IMAG), Claire Ma\""iza (VERIMAG - IMAG),
  David Monniaux (VERIMAG - IMAG)",Model Checking of Cache for WCET Analysis Refinement,,,,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  On real-time systems running under timing constraints, scheduling can be
performed when one is aware of the worst case execution time (WCET) of tasks.
Usually, the WCET of a task is unknown and schedulers make use of safe
over-approximations given by static WCET analysis. To reduce the
over-approximation, WCET analysis has to gain information about the underlying
hardware behavior, such as pipelines and caches. In this paper, we focus on the
cache analysis, which classifies memory accesses as hits/misses according to
the set of possible cache states. We propose to refine the results of classical
cache analysis using a model checker, introducing a new cache model for the
least recently used (LRU) policy.
","[{'version': 'v1', 'created': 'Fri, 27 Jan 2017 12:33:58 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Jul 2017 09:04:04 GMT'}]",2017-07-07,"[['Touzeau', 'Valentin', '', 'VERIMAG - IMAG'], ['Maïza', 'Claire', '', 'VERIMAG - IMAG'], ['Monniaux', 'David', '', 'VERIMAG - IMAG']]","['WorstCaseExecutionTime', 'CacheAnalysis', 'ModelChecking', 'Least Recently Used Cache']"
17521,0707.3553,Damien Chablat,"Mazen Zein (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)","An Exhaustive Study of the Workspace Topologies of all 3R Orthogonal
  Manipulators with Geometric Simplifications",,"Dans Proceedings of CK2005 - Proceedings of CK2005, International
  Workshop on Computational Kinematics, Cassino : Italie (05/2005)",,,cs.RO,,"  This paper analyses the workspace of the three-revolute orthogonal
manipulators that have at least one of their DH parameters equal to zero. These
manipulators are classified into different groups with similar kinematic
properties. The classification criteria are based on the topology of the
workspace. Each group is evaluated according to interesting kinematic
properties such as the size of the workspace subregion reachable with four
inverse kinematic solutions, the existence and the size of voids, and the size
of the regions of feasible paths in the workspace.
","[{'version': 'v1', 'created': 'Tue, 24 Jul 2007 13:49:51 GMT'}]",2007-07-25,"[['Zein', 'Mazen', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN'], ['Chablat', 'Damien', '', 'IRCCyN']]","['Workspace', 'classification', 'design parameter', 'node', 'void', 'feasible path']"
17522,1704.02319,Andre Anjos,"Andr\'e Anjos, Laurent El-Shafey and S\'ebastien Marcel",BEAT: An Open-Source Web-Based Open-Science Platform,References to papers published on the platform incorporated,,,,cs.SE cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the increased interest in computational sciences, machine learning (ML),
pattern recognition (PR) and big data, governmental agencies, academia and
manufacturers are overwhelmed by the constant influx of new algorithms and
techniques promising improved performance, generalization and robustness.
Sadly, result reproducibility is often an overlooked feature accompanying
original research publications, competitions and benchmark evaluations. The
main reasons behind such a gap arise from natural complications in research and
development in this area: the distribution of data may be a sensitive issue;
software frameworks are difficult to install and maintain; Test protocols may
involve a potentially large set of intricate steps which are difficult to
handle. Given the raising complexity of research challenges and the constant
increase in data volume, the conditions for achieving reproducible research in
the domain are also increasingly difficult to meet.
  To bridge this gap, we built an open platform for research in computational
sciences related to pattern recognition and machine learning, to help on the
development, reproducibility and certification of results obtained in the
field. By making use of such a system, academic, governmental or industrial
organizations enable users to easily and socially develop processing
toolchains, re-use data, algorithms, workflows and compare results from
distinct algorithms and/or parameterizations with minimal effort. This article
presents such a platform and discusses some of its key features, uses and
limitations. We overview a currently operational prototype and provide design
insights.
","[{'version': 'v1', 'created': 'Fri, 7 Apr 2017 07:18:55 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Jul 2017 07:53:11 GMT'}]",2017-07-28,"[['Anjos', 'André', ''], ['El-Shafey', 'Laurent', ''], ['Marcel', 'Sébastien', '']]","['Machine Learning', 'Pattern Recognition', 'Reproducible Research', 'Online Platform']"
17523,1203.2200,Ryan Rossi,"Ryan Rossi, Brian Gallagher, Jennifer Neville, Keith Henderson",Role-Dynamics: Fast Mining of Large Dynamic Networks,,,,,cs.SI cs.AI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To understand the structural dynamics of a large-scale social, biological or
technological network, it may be useful to discover behavioral roles
representing the main connectivity patterns present over time. In this paper,
we propose a scalable non-parametric approach to automatically learn the
structural dynamics of the network and individual nodes. Roles may represent
structural or behavioral patterns such as the center of a star, peripheral
nodes, or bridge nodes that connect different communities. Our novel approach
learns the appropriate structural role dynamics for any arbitrary network and
tracks the changes over time. In particular, we uncover the specific global
network dynamics and the local node dynamics of a technological, communication,
and social network. We identify interesting node and network patterns such as
stationary and non-stationary roles, spikes/steps in role-memberships (perhaps
indicating anomalies), increasing/decreasing role trends, among many others.
Our results indicate that the nodes in each of these networks have distinct
connectivity patterns that are non-stationary and evolve considerably over
time. Overall, the experiments demonstrate the effectiveness of our approach
for fast mining and tracking of the dynamics in large networks. Furthermore,
the dynamic structural representation provides a basis for building more
sophisticated models and tools that are fast for exploring large dynamic
networks.
","[{'version': 'v1', 'created': 'Fri, 9 Mar 2012 22:45:34 GMT'}]",2012-03-13,"[['Rossi', 'Ryan', ''], ['Gallagher', 'Brian', ''], ['Neville', 'Jennifer', ''], ['Henderson', 'Keith', '']]","['Dynamic network analysis', 'scalable network algorithms', 'roledynamics', 'non-negative matrix factorization']"
17524,1305.6108,Keehang Kwon,Keehang Kwon,Bounded Choice Queries for Logic Programming,5 pages,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Adding versatile interactions to goals and queries in logic programming is an
essential task. Unfortunately, existing logic languages can take input from the
user only via the $read$ construct.
  We propose to add a new interactive goal to allow for more controlled and
more guided participation from the user. We illustrate our idea via \muprolog,
an extension of Prolog with bounded choice goals.
","[{'version': 'v1', 'created': 'Mon, 27 May 2013 05:22:24 GMT'}, {'version': 'v2', 'created': 'Sat, 3 Aug 2013 12:18:41 GMT'}]",2013-08-06,"[['Kwon', 'Keehang', '']]","['interactive queries', 'logic programming', 'bounded choice', 'read']"
17525,1511.01287,Adrian Kosowski,"Pierre Fraigniaud (GANG), Marc Heinrich (GANG), Adrian Kosowski (GANG)",Local Conflict Coloring,,,,,cs.DS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Locally finding a solution to symmetry-breaking tasks such as
vertex-coloring, edge-coloring, maximal matching, maximal independent set,
etc., is a long-standing challenge in distributed network computing. More
recently, it has also become a challenge in the framework of centralized local
computation. We introduce conflict coloring as a general symmetry-breaking task
that includes all the aforementioned tasks as specific instantiations ---
conflict coloring includes all locally checkable labeling tasks from
[Naor\&Stockmeyer, STOC 1993]. Conflict coloring is characterized by two
parameters $l$ and $d$, where the former measures the amount of freedom given
to the nodes for selecting their colors, and the latter measures the number of
constraints which colors of adjacent nodes are subject to.We show that, in the
standard LOCAL model for distributed network computing, if $l/d \textgreater{}
\Delta$, then conflict coloring can be solved in $\tilde
O(\sqrt{\Delta})+\log^*n$ rounds in $n$-node graphs with maximum degree
$\Delta$, where $\tilde O$ ignores the polylog factors in $\Delta$. The
dependency in~$n$ is optimal, as a consequence of the $\Omega(\log^*n)$ lower
bound by [Linial, SIAM J. Comp. 1992] for $(\Delta+1)$-coloring. An important
special case of our result is a significant improvement over the best known
algorithm for distributed $(\Delta+1)$-coloring due to [Barenboim, PODC 2015],
which required $\tilde O(\Delta^{3/4})+\log^*n$ rounds. Improvements for other
variants of coloring, including $(\Delta+1)$-list-coloring,
$(2\Delta-1)$-edge-coloring, $T$-coloring, etc., also follow from our general
result on conflict coloring. Likewise, in the framework of centralized local
computation algorithms (LCAs), our general result yields an LCA which requires
a smaller number of probes than the previously best known algorithm for
vertex-coloring, and works for a wide range of coloring problems.
","[{'version': 'v1', 'created': 'Wed, 4 Nov 2015 10:56:55 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Feb 2017 12:38:21 GMT'}]",2017-02-03,"[['Fraigniaud', 'Pierre', '', 'GANG'], ['Heinrich', 'Marc', '', 'GANG'], ['Kosowski', 'Adrian', '', 'GANG']]","['Distributed Network Computing', 'Symmetry Breaking', 'List-coloring', '(∆ + 1)-coloring', 'Local Computation Algorithm']"
17526,1109.0094,Heba Affify,"Heba Afify, Muhammad Islam and Manal Abdel Wahed","DNA Lossless Differential Compression Algorithm based on Similarity of
  Genomic Sequence Database",,,,,cs.DS cs.CE cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern biological science produces vast amounts of genomic sequence data.
This is fuelling the need for efficient algorithms for sequence compression and
analysis. Data compression and the associated techniques coming from
information theory are often perceived as being of interest for data
communication and storage. In recent years, a substantial effort has been made
for the application of textual data compression techniques to various
computational biology tasks, ranging from storage and indexing of large
datasets to comparison of genomic databases. This paper presents a differential
compression algorithm that is based on production of difference sequences
according to op-code table in order to optimize the compression of homologous
sequences in dataset. Therefore, the stored data are composed of reference
sequence, the set of differences, and differences locations, instead of storing
each sequence individually. This algorithm does not require a priori knowledge
about the statistics of the sequence set. The algorithm was applied to three
different datasets of genomic sequences, it achieved up to 195-fold compression
rate corresponding to 99.4% space saving.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2011 05:39:35 GMT'}]",2011-09-05,"[['Afify', 'Heba', ''], ['Islam', 'Muhammad', ''], ['Wahed', 'Manal Abdel', '']]","['Data compression', 'Genomic sequences', 'Differential compression algorithm']"
17527,1412.2697,Hocine Cherifi,"Abdelkaher Ait Abdelouahad, Mohammed El Hassouni, Hocine Cherifi, and
  Driss Aboutajdine","Image quality assessment measure based on natural image statistics in
  the Tetrolet domain",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with a reduced reference (RR) image quality measure based on
natural image statistics modeling. For this purpose, Tetrolet transform is used
since it provides a convenient way to capture local geometric structures. This
transform is applied to both reference and distorted images. Then, Gaussian
Scale Mixture (GSM) is proposed to model subbands in order to take account
statistical dependencies between tetrolet coefficients. In order to quantify
the visual degradation, a measure based on Kullback Leibler Divergence (KLD) is
provided. The proposed measure was tested on the Cornell VCL A-57 dataset and
compared with other measures according to FR-TV1 VQEG framework.
","[{'version': 'v1', 'created': 'Mon, 8 Dec 2014 18:48:26 GMT'}]",2014-12-09,"[['Abdelouahad', 'Abdelkaher Ait', ''], ['Hassouni', 'Mohammed El', ''], ['Cherifi', 'Hocine', ''], ['Aboutajdine', 'Driss', '']]","['RRIQA', 'Tetrolet transform', 'natural image statistics', 'Gaussian Scale Mixture']"
17528,1111.4316,Giuseppe Pirr\'o,"Valeria Fionda, Claudio Gutierrez, Giuseppe Pirr\'o","Semantic Navigation on the Web of Data: Specification of Routes, Web
  Fragments and Actions",10 pages - first submission,,,,cs.NI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The massive semantic data sources linked in the Web of Data give new meaning
to old features like navigation; introduce new challenges like semantic
specification of Web fragments; and make it possible to specify actions relying
on semantic data. In this paper we introduce a declarative language to face
these challenges. Based on navigational features, it is designed to specify
fragments of the Web of Data and actions to be performed based on these data.
We implement it in a centralized fashion, and show its power and performance.
Finally, we explore the same ideas in a distributed setting, showing their
feasibility, potentialities and challenges.
","[{'version': 'v1', 'created': 'Fri, 18 Nov 2011 10:13:54 GMT'}]",2011-11-21,"[['Fionda', 'Valeria', ''], ['Gutierrez', 'Claudio', ''], ['Pirró', 'Giuseppe', '']]","['Navigation', 'Web of Data', 'Linked Data', 'Semantic Web']"
17529,0909.1768,Alan Fekete,"David Lomet (Microsoft Research), Alan Fekete (University of Sydney),
  Gerhard Weikum (Max Plank Institute), Mike Zwilling (Microsoft SQL Server)",Unbundling Transaction Services in the Cloud,CIDR 2009,,,,cs.DB cs.DC,http://creativecommons.org/licenses/by/3.0/,"  The traditional architecture for a DBMS engine has the recovery, concurrency
control and access method code tightly bound together in a storage engine for
records. We propose a different approach, where the storage engine is factored
into two layers (each of which might have multiple heterogeneous instances). A
Transactional Component (TC) works at a logical level only: it knows about
transactions and their ""logical"" concurrency control and undo/redo recovery,
but it does not know about page layout, B-trees etc. A Data Component (DC)
knows about the physical storage structure. It supports a record oriented
interface that provides atomic operations, but it does not know about
transactions. Providing atomic record operations may itself involve DC-local
concurrency control and recovery, which can be implemented using system
transactions. The interaction of the mechanisms in TC and DC leads to
multi-level redo (unlike the repeat history paradigm for redo in integrated
engines). This refactoring of the system architecture could allow easier
deployment of application-specific physical structures and may also be helpful
to exploit multi-core hardware. Particularly promising is its potential to
enable flexible transactions in cloud database deployments. We describe the
necessary principles for unbundled recovery, and discuss implementation issues.
","[{'version': 'v1', 'created': 'Wed, 9 Sep 2009 18:09:36 GMT'}]",2009-09-15,"[['Lomet', 'David', '', 'Microsoft Research'], ['Fekete', 'Alan', '', 'University of Sydney'], ['Weikum', 'Gerhard', '', 'Max Plank Institute'], ['Zwilling', 'Mike', '', 'Microsoft SQL Server']]","['System architecture', 'cloud computing', 'logical locking and logging']"
17530,1705.08861,Hamid Shahrokh Shahraki,Pouya Sharifi and Hamid Shahrokh Shahraki,Handover analysis of the Improved Phantom Cells,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Improved Phantom cell is a new scenario which has been introduced recently to
enhance the capacity of Heterogeneous Networks (HetNets). The main trait of
this scenario is that, besides maximizing the total network capacity in both
indoor and outdoor environments, it claims to reduce the handover number
compared to the conventional scenarios. In this paper, by a comprehensive
review of the Improved Phantom cells structure, an appropriate algorithm will
be introduced for the handover procedure of this scenario. To reduce the number
of handover in the proposed algorithm, various parameters such as the received
Signal to Interference plus Noise Ratio (SINR) at the user equipment (UE),
users access conditions to the phantom cells, and users staying time in the
target cell based on its velocity, has been considered. Theoretical analyses
and simulation results show that applying the suggested algorithm the improved
phantom cell structure has a much better performance than conventional HetNets
in terms of the number of handover.
","[{'version': 'v1', 'created': 'Wed, 24 May 2017 16:51:03 GMT'}]",2017-05-25,"[['Sharifi', 'Pouya', ''], ['Shahraki', 'Hamid Shahrokh', '']]","['Phantom cell', 'Femtocells', 'Heterogeneous Networks', 'Handover', 'Markov chain']"
17531,1406.4641,Kleanthis Thramboulidis,Kleanthis Thramboulidis,"Comments on ""A model-based design methodology for the development of
  mechatronic systems""",6 pages,,,,cs.SE cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the paper by G. Barbieri et al. (Mechatronics (2014),
http://dx.doi.org/10.1016/j.mechatronics. 2013.12.004), a design methodology,
based on the W life cycle process model, is presented and SysML is proposed as
a tool to support the whole development process. In this letter, we discuss the
presented approach, we point out technical errors and raise additional issues
that might help in making the proposed approach applicable.
","[{'version': 'v1', 'created': 'Wed, 18 Jun 2014 08:50:53 GMT'}]",2014-06-19,"[['Thramboulidis', 'Kleanthis', '']]","['System Modeling', 'Mechatronic systems development process', 'SysML', 'System life cycle process model', 'Model-based development']"
17532,1005.4518,Thomas Hugel,Yacine Boufkhad and Thomas Hugel,Estimating Satisfiability,"31 pages, added the 4.419 upper-bound on the cores",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of estimating the proportion of satisfiable instances of a given
CSP (constraint satisfaction problem) can be tackled through weighting. It
consists in putting onto each solution a non-negative real value based on its
neighborhood in a way that the total weight is at least 1 for each satisfiable
instance. We define in this paper a general weighting scheme for the estimation
of satisfiability of general CSPs. First we give some sufficient conditions for
a weighting system to be correct. Then we show that this scheme allows for an
improvement on the upper bound on the existence of non-trivial cores in 3-SAT
obtained by Maneva and Sinclair (2008) to 4.419. Another more common way of
estimating satisfiability is ordering. This consists in putting a total order
on the domain, which induces an orientation between neighboring solutions in a
way that prevents circuits from appearing, and then counting only minimal
elements. We compare ordering and weighting under various conditions.
","[{'version': 'v1', 'created': 'Tue, 25 May 2010 09:33:06 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Mar 2011 15:43:58 GMT'}]",2015-03-17,"[['Boufkhad', 'Yacine', ''], ['Hugel', 'Thomas', '']]","['Constraint Satisfaction Problem', 'Satisfiability', 'First Moment Method']"
17533,1510.08568,Wanru Gao,"Wanru Gao, Samadhi Nallaperuma and Frank Neumann",Feature-Based Diversity Optimization for Problem Instance Classification,"20 pages, 18 figures",,,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding the behaviour of heuristic search methods is a challenge. This
even holds for simple local search methods such as 2-OPT for the Traveling
Salesperson problem. In this paper, we present a general framework that is able
to construct a diverse set of instances that are hard or easy for a given
search heuristic. Such a diverse set is obtained by using an evolutionary
algorithm for constructing hard or easy instances that are diverse with respect
to different features of the underlying problem. Examining the constructed
instance sets, we show that many combinations of two or three features give a
good classification of the TSP instances in terms of whether they are hard to
be solved by 2-OPT.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2015 05:40:54 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Apr 2016 05:12:48 GMT'}, {'version': 'v3', 'created': 'Fri, 29 May 2020 08:40:06 GMT'}]",2020-06-01,"[['Gao', 'Wanru', ''], ['Nallaperuma', 'Samadhi', ''], ['Neumann', 'Frank', '']]","['Combinatorial optimization', 'Travelling Salesman Problem', 'Feature selection', 'Classification', 'Evolving Instances']"
17534,1406.3149,Christian Napoli,"Francesco Bonanno, Giacomo Capizzi, Grazia Lo Sciuto, Christian
  Napoli, Giuseppe Pappalardo, Emiliano Tramontana","A Cascade Neural Network Architecture investigating Surface Plasmon
  Polaritons propagation for thin metals in OpenMP",,"International conference on Artificial Intelligence and Soft
  Computing (ICAISC 2014), Vol I, 22-33 (2014)",,,cs.NE cond-mat.mes-hall cond-mat.mtrl-sci cs.DC cs.LG,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Surface plasmon polaritons (SPPs) confined along metal-dielectric interface
have attracted a relevant interest in the area of ultracompact photonic
circuits, photovoltaic devices and other applications due to their strong field
confinement and enhancement. This paper investigates a novel cascade neural
network (NN) architecture to find the dependance of metal thickness on the SPP
propagation. Additionally, a novel training procedure for the proposed cascade
NN has been developed using an OpenMP-based framework, thus greatly reducing
training time. The performed experiments confirm the effectiveness of the
proposed NN architecture for the problem at hand.
","[{'version': 'v1', 'created': 'Thu, 12 Jun 2014 08:40:04 GMT'}]",2014-06-13,"[['Bonanno', 'Francesco', ''], ['Capizzi', 'Giacomo', ''], ['Sciuto', 'Grazia Lo', ''], ['Napoli', 'Christian', ''], ['Pappalardo', 'Giuseppe', ''], ['Tramontana', 'Emiliano', '']]","['Cascade neural network architectures', 'Surface plasmon polaritons', 'Plasmonics', 'Plasmon structure']"
17535,1603.01032,Javier Arias Navarro,Javier Arias Navarro,Right Ideals of a Ring and Sublanguages of Science,"Keywords: Zellig Sabbetai Harris, Information Structure of Language,
  Sublanguages of Science, Ideal Numbers, Ernst Kummer, Ideals, Richard
  Dedekind, Ring Theory, Right Ideals, Emmy Noether, Order Theory, Marshall
  Harvey Stone",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Among Zellig Harris's numerous contributions to linguistics his theory of the
sublanguages of science probably ranks among the most underrated. However, not
only has this theory led to some exhaustive and meaningful applications in the
study of the grammar of immunology language and its changes over time, but it
also illustrates the nature of mathematical relations between chunks or subsets
of a grammar and the language as a whole. This becomes most clear when dealing
with the connection between metalanguage and language, as well as when
reflecting on operators.
  This paper tries to justify the claim that the sublanguages of science stand
in a particular algebraic relation to the rest of the language they are
embedded in, namely, that of right ideals in a ring.
","[{'version': 'v1', 'created': 'Thu, 3 Mar 2016 09:33:09 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Mar 2016 10:52:54 GMT'}]",2016-03-07,"[['Navarro', 'Javier Arias', '']]","['Zellig Sabbetai Harris', 'Information Structure of Language', 'Sublanguages of']"
17536,1606.08501,Giorgio Gnecco,Giorgio Gnecco,"Symmetric and antisymmetric properties of solutions to kernel-based
  machine learning problems",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A particularly interesting instance of supervised learning with kernels is
when each training example is associated with two objects, as in pairwise
classification (Brunner et al., 2012), and in supervised learning of preference
relations (Herbrich et al., 1998). In these cases, one may want to embed
additional prior knowledge into the optimization problem associated with the
training of the learning machine, modeled, respectively, by the symmetry of its
optimal solution with respect to an exchange of order between the two objects,
and by its antisymmetry. Extending the approach proposed in (Brunner et al.,
2012) (where the only symmetric case was considered), we show, focusing on
support vector binary classification, how such embedding is possible through
the choice of a suitable pairwise kernel, which takes as inputs the individual
feature vectors and also the group feature vectors associated with the two
objects. We also prove that the symmetry/antisymmetry constraints still hold
when considering the sequence of suboptimal solutions generated by one version
of the Sequential Minimal Optimization (SMO) algorithm, and we present
numerical results supporting the theoretical findings. We conclude discussing
extensions of the main results to support vector regression, to transductive
support vector machines, and to several kinds of graph kernels, including
diffusion kernels.
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2016 22:34:14 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Oct 2016 02:13:31 GMT'}]",2016-10-31,"[['Gnecco', 'Giorgio', '']]","['Kernel Methods', 'Symmetry and Antisymmetry', 'Pairwise Support Vector Machines', 'Sequential Minimal Optimization', 'Optimal', 'Suboptimal Solutions']"
17537,1010.4760,Petr Jancar,Petr Jancar,"A Short Decidability Proof for DPDA Language Equivalence via First-Order
  Grammars","28 pages, version 4 reworks the main proof and omits the
  nondeterministic case where a problem was found by G. Senizergues",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The main aim of the paper is to give a short self-contained proof of the
decidability of language equivalence for deterministic pushdown automata, which
is the famous problem solved by G. Senizergues, for which C. Stirling has
derived a primitive recursive complexity upper bound. The proof here is given
in the framework of first-order grammars, which seems to be particularly apt
for the aim. An appendix presents a modification of Stirling's approach,
yielding a complexity bound of the form tetr(2,g(n)) where tetr is the
(nonelementary) operator of iterated exponentiation (tetration) and g is an
elementary function of the input size.
","[{'version': 'v1', 'created': 'Fri, 22 Oct 2010 17:20:28 GMT'}, {'version': 'v2', 'created': 'Thu, 18 Nov 2010 18:24:35 GMT'}, {'version': 'v3', 'created': 'Thu, 9 Dec 2010 17:35:47 GMT'}, {'version': 'v4', 'created': 'Wed, 9 Mar 2011 11:08:23 GMT'}]",2011-03-10,"[['Jancar', 'Petr', '']]","['pushdown automaton', 'deterministic context-free language', 'first-order grammar', 'language equivalence', 'trace equivalence', 'decidability']"
17538,1004.1706,Rdv Ijcsis,"Sujata V. Mallapur, Sujata Terdal",Enhanced Ad-Hoc on Demand Multipath Distance Vector Routing protocol,"IEEE Publication format, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","IJCSIS, Vol. 7 No. 3, March 2010, 166-170",,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Due to mobility in Ad-Hoc network the topology of the network may change
randomly, rapidly and unexpectedly, because of these aspects, the routes in the
network often disappear and new to arise. To avoid frequent route discovery and
route failure EAOMDV was proposed based on existing routing protocol AOMDV. The
EAOMDV (Enhanced Ad-Hoc on Demand Multipath Distance Vector) Routing protocol
was proposed to solve the ""route failure"" problem in AOMDV. EAOMDV protocol
reduces the route failure problem by preemptively predicting the link failure
by the signal power received by the receiver (pr). This proposed protocol
controls overhead, increases throughput and reduces the delay. The EAOMDV
protocol was implemented on NS-2 and evaluation results show that the EAOMDV
outperformed AOMDV.
","[{'version': 'v1', 'created': 'Sat, 10 Apr 2010 10:53:32 GMT'}]",2010-04-13,"[['Mallapur', 'Sujata V.', ''], ['Terdal', 'Sujata', '']]","['AD-HOC NETWORKS', 'AODV', 'AOMDV', 'MULTIPATH ROUTING', 'EAOMDV']"
17539,1312.6546,Haris Aziz,Haris Aziz and Serge Gaspers and Simon Mackenzie and Toby Walsh,Fair assignment of indivisible objects under ordinal preferences,extended version of a paper presented at AAMAS 2014,,,,cs.GT cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the discrete assignment problem in which agents express ordinal
preferences over objects and these objects are allocated to the agents in a
fair manner. We use the stochastic dominance relation between fractional or
randomized allocations to systematically define varying notions of
proportionality and envy-freeness for discrete assignments. The computational
complexity of checking whether a fair assignment exists is studied for these
fairness notions. We also characterize the conditions under which a fair
assignment is guaranteed to exist. For a number of fairness concepts,
polynomial-time algorithms are presented to check whether a fair assignment
exists. Our algorithmic results also extend to the case of unequal entitlements
of agents. Our NP-hardness result, which holds for several variants of
envy-freeness, answers an open question posed by Bouveret, Endriss, and Lang
(ECAI 2010). We also propose fairness concepts that always suggest a non-empty
set of assignments with meaningful fairness properties. Among these concepts,
optimal proportionality and optimal weak proportionality appear to be desirable
fairness concepts.
","[{'version': 'v1', 'created': 'Mon, 23 Dec 2013 13:37:19 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Sep 2014 03:57:49 GMT'}, {'version': 'v3', 'created': 'Sat, 6 Dec 2014 04:30:06 GMT'}, {'version': 'v4', 'created': 'Wed, 17 Jun 2015 04:25:04 GMT'}]",2015-06-18,"[['Aziz', 'Haris', ''], ['Gaspers', 'Serge', ''], ['Mackenzie', 'Simon', ''], ['Walsh', 'Toby', '']]","['Fair Division', 'Resource Allocation', 'Envy-freeness', 'Proportionality']"
17540,1109.0624,Marwa Graja,Marwa Graja and Maher Jaoua and Lamia Hadrich Belguith,Building Ontologies to Understand Spoken Tunisian Dialect,"10 pages, 3 figures","International Journal of Computer Science, Engineering and
  Applications (IJCSEA) Vol.1, No.4, August 2011",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a method to understand spoken Tunisian dialect based on
lexical semantic. This method takes into account the specificity of the
Tunisian dialect which has no linguistic processing tools. This method is
ontology-based which allows exploiting the ontological concepts for semantic
annotation and ontological relations for speech interpretation. This
combination increases the rate of comprehension and limits the dependence on
linguistic resources. This paper also details the process of building the
ontology used for annotation and interpretation of Tunisian dialect in the
context of speech understanding in dialogue systems for restricted domain.
","[{'version': 'v1', 'created': 'Sat, 3 Sep 2011 14:30:44 GMT'}]",2011-09-06,"[['Graja', 'Marwa', ''], ['Jaoua', 'Maher', ''], ['Belguith', 'Lamia Hadrich', '']]","['Tunisian dialect', 'utterances', 'ontology', 'semantic annotation', 'semantic interpretation']"
17541,1511.08547,Alex Druinsky,"Alex Druinsky, Eyal Carlebach, and Sivan Toledo","Wilkinson's Inertia-Revealing Factorization and Its Application to
  Sparse Matrices",,,,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new inertia-revealing factorization for sparse symmetric
matrices. The factorization scheme and the method for extracting the inertia
from it were proposed in the 1960s for dense, banded, or tridiagonal matrices,
but they have been abandoned in favor of faster methods. We show that this
scheme can be applied to any sparse symmetric matrix and that the fill in the
factorization is bounded by the fill in the sparse QR factorization of the same
matrix (but is usually much smaller). We describe our serial proof-of-concept
implementation, and present experimental results, studying the method's
numerical stability and performance.
","[{'version': 'v1', 'created': 'Fri, 27 Nov 2015 03:11:17 GMT'}, {'version': 'v2', 'created': 'Sat, 14 Oct 2017 16:17:33 GMT'}]",2017-10-17,"[['Druinsky', 'Alex', ''], ['Carlebach', 'Eyal', ''], ['Toledo', 'Sivan', '']]","['sparse matrix factorization', 'matrix inertia', 'symmetric indefinite matrices']"
17542,1107.1177,Stefan Szeider,Stefan Szeider,Not So Easy Problems for Tree Decomposable Graphs,Author's self-archived copy,"Ramanujan Mathematical Society, Lecture Notes Series no. 13, 2010,
  pp. 179-190",,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider combinatorial problems that can be solved in polynomial time for
graphs of bounded treewidth but where the order of the polynomial that bounds
the running time is expected to depend on the treewidth bound. First we review
some recent results for problems regarding list and equitable colorings,
general factors, and generalized satisfiability. Second we establish a new
hardness result for the problem of minimizing the maximum weighted outdegree
for orientations of edge-weighted graphs of bounded treewidth.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2011 16:28:54 GMT'}]",2015-03-19,"[['Szeider', 'Stefan', '']]","['Treewidth', 'W[1]-Hardness', 'Graph Coloring', 'General Factors', 'Generalized Satisfiability', 'Minimum Maximum Outdegree Orientations']"
17543,1303.5907,Dmitry Zinoviev,"Dmitry Zinoviev and Hamid Benbrahim and Greta Meszoely and Dan
  Stefanescu",Simulating Resilience in Transaction-Oriented Networks,"5 pages, 5 figures. Accepted to HPC-2013",,,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The power of networks manifests itself in a highly non-linear amplification
of a number of effects, and their weakness - in propagation of cascading
failures. The potential systemic risk effects can be either exacerbated or
mitigated, depending on the resilience characteristics of the network. The
goals of this paper are to study some characteristics of network amplification
and resilience. We simulate random Erdos-Renyi networks and measure
amplification by varying node capacity, transaction volume, and expected
failure rates. We discover that network throughput scales almost quadratically
with respect to the node capacity and that the effects of excessive network
load and random and irreparable node faults are equivalent and almost perfectly
anticorrelated. This knowledge can be used by capacity planners to determine
optimal reliability requirements that maximize the optimal operational regions.
","[{'version': 'v1', 'created': 'Sun, 24 Mar 2013 02:37:42 GMT'}]",2013-03-26,"[['Zinoviev', 'Dmitry', ''], ['Benbrahim', 'Hamid', ''], ['Meszoely', 'Greta', ''], ['Stefanescu', 'Dan', '']]","['Distributed systems', 'distributed transactions', 'resilience']"
17544,1007.0411,Dimple Juneja Dr.,"Addepalli V.N Krishna, A Vinay Babu","Role of Statistical tests in Estimation of the Security of a New
  Encryption Algorithm",http://ijict.org/index.php/ijoat/article/view/statistical-tests-for-encryption-algorithm,"International Journal of Advancements in Technology, Vol 1, No 1
  (2010)",,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  Encryption study basically deals with three levels of algorithms. The first
algorithm deals with encryption mechanism, second deals with decryption
Mechanism and the third discusses about the generation of keys and sub keys
used in the encryption study. In the given study, a new algorithm is discussed.
The algorithm executes a series of steps and generates a sequence. This
sequence is being used as sub key to be mapped to plain text to generate cipher
text. The strength of the encryption & Decryption process depends on the
strength of sequence generated against crypto analysis.. In this part of work
some statistical tests like Uniformity tests, Universal tests & Repetition
tests are tried on the sequence generated to test the strength of it.
","[{'version': 'v1', 'created': 'Thu, 1 Jul 2010 09:27:09 GMT'}]",2010-07-05,"[['Krishna', 'Addepalli V. N', ''], ['Babu', 'A Vinay', '']]","['Encryption & Decryption Mechanism', 'Key & Sub key Generation', 'Statistical tests', 'Strength of the algorithm.   1']"
17545,0708.3019,Ananthanarayanan Chockalingam,"D. Sreedhar, A. Chockalingam, B. Sundar Rajan","Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent
  Cooperative Networks",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Space-time block codes (STBCs) that are single-symbol decodable (SSD) in a
co-located multiple antenna setting need not be SSD in a distributed
cooperative communication setting. A relay network with N relays and a single
source-destination pair is called a partially-coherent relay channel (PCRC) if
the destination has perfect channel state information (CSI) of all the channels
and the relays have only the phase information of the source-to-relay channels.
In this paper, first, a new set of necessary and sufficient conditions for a
STBC to be SSD for co-located multiple antenna communication is obtained. Then,
this is extended to a set of necessary and sufficient conditions for a
distributed STBC (DSTBC) to be SSD for a PCRC, by identifying the additional
conditions. Using this, several SSD DSTBCs for PCRC are identified among the
known classes of STBCs. It is proved that even if a SSD STBC for a co-located
MIMO channel does not satisfy the additional conditions for the code to be SSD
for a PCRC, single-symbol decoding of it in a PCRC gives full-diversity and
only coding gain is lost. It is shown that when a DSTBC is SSD for a PCRC, then
arbitrary coordinate interleaving of the in-phase and quadrature-phase
components of the variables does not disturb its SSD property for PCRC.
Finally, it is shown that the possibility of {\em channel phase compensation}
operation at the relay nodes using partial CSI at the relays increases the
possible rate of SSD DSTBCs from $\frac{2}{N}$ when the relays do not have CSI
to 1/2, which is independent of N.
","[{'version': 'v1', 'created': 'Wed, 22 Aug 2007 13:58:36 GMT'}, {'version': 'v2', 'created': 'Sat, 29 Nov 2008 04:34:11 GMT'}]",2008-11-29,"[['Sreedhar', 'D.', ''], ['Chockalingam', 'A.', ''], ['Rajan', 'B. Sundar', '']]","['Cooperative communications', 'amplify-and-forward protocol', 'distributed STBC', 'single-symbol']"
17546,1604.07906,Ruck Thawonmas,"YuXuan Jiang, Misaki Kaidan, Chun Yin Chu, Tomohiro Harada, and Ruck
  Thawonmas","Procedural Generation of Angry Birds Levels using Building Constructive
  Grammar with Chinese-Style and/or Japanese-Style Models",,"Proc. of ASIAGRAPH 2016, Toyama, Japan, pp. 53-54, Mar. 5-6, 2016",,,cs.AI cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a procedural generation method that creates visually
attractive levels for the Angry Birds game. Besides being an immensely popular
mobile game, Angry Birds has recently become a test bed for various artificial
intelligence technologies. We propose a new approach for procedurally
generating Angry Birds levels using Chinese style and Japanese style building
structures. A conducted experiment confirms the effectiveness of our approach
with statistical significance.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2016 02:21:28 GMT'}]",2016-04-28,"[['Jiang', 'YuXuan', ''], ['Kaidan', 'Misaki', ''], ['Chu', 'Chun Yin', ''], ['Harada', 'Tomohiro', ''], ['Thawonmas', 'Ruck', '']]","['Procedural Content Generation', 'Angry Birds', 'Game Levels', 'Chinese Style', 'Japanese Style']"
17547,1407.4884,Jie Peng,"Jie Peng, Chik How Tan and Qichun Wang","A new construction of differentially 4-uniform permutations over
  $F_{2^{2k}}$",18pages,,,,cs.IT math.IT,http://creativecommons.org/licenses/by/3.0/,"  Permutations over $F_{2^{2k}}$ with low differential uniform, high algebraic
degree and high nonlinearity are of great cryptographical importance since they
can be chosen as the substitution boxes (S-boxes) for many block ciphers. A
well known example is that the Advanced Encryption Standard (AES) chooses a
differentially 4-uniform permutation, the multiplicative inverse function, as
its S-box. In this paper, we present a new construction of differentially
4-uniformity permutations over even characteristic finite fields and obtain
many new CCZ-inequivalent functions. All the functions are switching neighbors
in the narrow sense of the multiplicative inverse function and have the optimal
algebraic degree and high nonlinearity.
","[{'version': 'v1', 'created': 'Fri, 18 Jul 2014 04:58:49 GMT'}]",2014-07-21,"[['Peng', 'Jie', ''], ['Tan', 'Chik How', ''], ['Wang', 'Qichun', '']]","['Differentially 4-uniform function', 'Permutation', 'Algebraic degree', 'Nonlinearity']"
17548,1208.6318,Dmitriy Kuptsov,"Dmitriy Kuptsov, Boris Nechaev, Andrey Lukyanenko and Andrei Gurtov","How Penalty Leads to Improvement: a Measurement Study of Wireless
  Backoff","14 pages, 21 figures, 3 tables",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite much theoretical work, different modifications of backoff protocols
in 802.11 networks lack empirical evidence demonstrating their real-life
performance. To fill the gap we have set out to experiment with performance of
exponential backoff by varying its backoff factor. Despite the satisfactory
results for throughput, we have witnessed poor fairness manifesting in severe
capture effect. The design of standard backoff protocol allows already
successful nodes to remain successful, giving little chance to those nodes that
failed to capture the channel in the beginning. With this at hand, we ask a
conceptual question: Can one improve the performance of wireless backoff by
introducing a mechanism of self-penalty, when overly successful nodes are
penalized with big contention windows? Our real-life measurements using
commodity hardware demonstrate that in many settings such mechanism not only
allows to achieve better throughput, but also assures nearly perfect fairness.
We further corroborate these results with simulations and an analytical model.
Finally, we present a backoff factor selection protocol which can be
implemented in access points to enable deployment of the penalty backoff
protocol to consumer devices.
","[{'version': 'v1', 'created': 'Thu, 30 Aug 2012 21:39:35 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Sep 2012 19:45:34 GMT'}, {'version': 'v3', 'created': 'Thu, 12 Dec 2013 20:06:29 GMT'}]",2013-12-13,"[['Kuptsov', 'Dmitriy', ''], ['Nechaev', 'Boris', ''], ['Lukyanenko', 'Andrey', ''], ['Gurtov', 'Andrei', '']]","['Wireless networks', 'channel access', 'performance measurement and modeling', 'protocol design']"
17549,0905.4163,Murat Guzeltepe Mr,"Murat Guzeltepe, Mehmet Ozen",Cyclic Codes over Some Finite Rings,,,,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper cyclic codes are established with respect to the Mannheim
metric over some finite rings by using Gaussian integers and the decoding
algorithm for these codes is given.
","[{'version': 'v1', 'created': 'Tue, 26 May 2009 11:06:33 GMT'}]",2009-05-27,"[['Guzeltepe', 'Murat', ''], ['Ozen', 'Mehmet', '']]","['Block codes', 'Mannheim distance', 'Cyclic codes', 'Syndrome decoding']"
17550,1501.00820,Odell Hegna,Odell Hegna,Software Safety Demonstration and Idemnification,64 pages,,,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  Computers may control safety-critical operations in machines having embedded
software. This memoir proposes a regimen to verify such algorithms at
prescribed levels of statistical confidence. The United States Department of
Defense standard for system safety engineering (MIL-STD-882E) defines
development procedures for safety-critical systems. However, a problem exists:
the Standard fails to distinguish quantitative product assurance technique from
categorical process assurance method for software development. Resulting is
conflict in the technical definition of the term risk. The primary goal here is
to show that a quantitative risk-based product assurance method exists and is
consistent with hardware practice. Discussion appears in two major parts:
theory, which shows the relationship between automata and software; and
application, which covers demonstration and indemnification. Demonstration is a
technique for generating random tests; indemnification converts pass/fail test
results to compound Poisson parameters (severity and intensity). Together,
demonstration and indemnification yield statistical confidence that
safety-critical code meets design intent. Statistical confidence is the
keystone of quantitative product assurance. A secondary goal is resolving the
conflict over the term risk. The first meaning is an accident model known in
mathematics as the compound Poisson stochastic process, and so is called
statistical risk. Various of its versions underlie the theories of safety and
reliability. The second is called developmental risk. It considers software
autonomy, which considers time until manual recovery of control. Once these
meanings are separated, MIL-STD-882 can properly support either formal
quantitative safety assurance or empirical process robustness, which differ in
impact.
","[{'version': 'v1', 'created': 'Mon, 5 Jan 2015 11:10:15 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Nov 2015 21:52:09 GMT'}, {'version': 'v3', 'created': 'Sun, 14 Feb 2016 20:37:16 GMT'}, {'version': 'v4', 'created': 'Mon, 11 Mar 2019 01:52:07 GMT'}]",2019-03-12,"[['Hegna', 'Odell', '']]","['software', 'safety', 'hazard', 'operational profile', 'automata', 'confidence', 'statistics']"
17551,0908.4062,R Doomun,"Sushma Kejgir, and Manesh Kokare","Optimization of Bit Plane Combination for Efficient Digital Image
  Watermarking","10 pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 4, No. 1 & No. 2, August 2009, USA",,ISSN 1947 5500,cs.CR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In view of the frequent multimedia data transfer authentication and
protection of images has gained importance in todays world. In this paper we
propose a new watermarking technique, based on bit plane, which enhances
robustness and capacity of the watermark, as well as maintains transparency of
the watermark and fidelity of the image. In the proposed technique, higher
strength bit plane of digital signature watermark is embedded in to a
significant bit plane of the original image. The combination of bit planes
(image and watermark) selection is an important issue. Therefore, a mechanism
is developed for appropriate bit plane selection. Ten different attacks are
selected to test different alternatives. These attacks are given different
weightings as appropriate to user requirement. A weighted correlation
coefficient for retrieved watermark is estimated for each of the alternatives.
Based on these estimated values optimal bit plane combination is identified for
a given user requirement. The proposed method is found to be useful for
authentication and to prove legal ownership. We observed better results by our
proposed method in comparison with the previously reported work on pseudorandom
watermark embedded in least significant bit (LSB) plane.
","[{'version': 'v1', 'created': 'Thu, 27 Aug 2009 18:52:26 GMT'}]",2009-08-28,"[['Kejgir', 'Sushma', ''], ['Kokare', 'Manesh', '']]","['Digital signature watermark', 'Bit plane watermark embedding method', 'Correlation coefficient', 'weighted correlation coefficient']"
17552,1511.06653,F\'elix G. Harvey,"F\'elix G. Harvey, Julien Roy, David Kanaa, Christopher Pal","Recurrent Semi-supervised Classification and Constrained Adversarial
  Generation with Motion Capture Data",IVC Journal Submission,,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore recurrent encoder multi-decoder neural network architectures for
semi-supervised sequence classification and reconstruction. We find that the
use of multiple reconstruction modules helps models generalize in a
classification task when only a small amount of labeled data is available,
which is often the case in practice. Such models provide useful high-level
representations of motions allowing clustering, searching and faster labeling
of new sequences. We also propose a new, realistic partitioning of a
well-known, high quality motion-capture dataset for better evaluations. We
further explore a novel formulation for future-predicting decoders based on
conditional recurrent generative adversarial networks, for which we propose
both soft and hard constraints for transition generation derived from desired
physical properties of synthesized future movements and desired animation
goals. We find that using such constraints allow to stabilize the training of
recurrent adversarial architectures for animation generation.
","[{'version': 'v1', 'created': 'Fri, 20 Nov 2015 15:47:55 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Apr 2016 01:03:26 GMT'}, {'version': 'v3', 'created': 'Mon, 25 Jul 2016 18:13:00 GMT'}, {'version': 'v4', 'created': 'Fri, 26 May 2017 18:31:48 GMT'}, {'version': 'v5', 'created': 'Mon, 5 Jun 2017 13:54:26 GMT'}, {'version': 'v6', 'created': 'Tue, 6 Jun 2017 12:54:48 GMT'}, {'version': 'v7', 'created': 'Wed, 21 Feb 2018 15:04:43 GMT'}, {'version': 'v8', 'created': 'Wed, 11 Jul 2018 12:25:55 GMT'}]",2018-07-12,"[['Harvey', 'Félix G.', ''], ['Roy', 'Julien', ''], ['Kanaa', 'David', ''], ['Pal', 'Christopher', '']]","['Action Recognition', 'Motion Capture', 'Semi-supervisedLearning', 'Recurrent Neural Networks', 'Generative Adversarial Networks', 'Transition Generation']"
17553,1702.04028,Alan David,Alan David,Scheduling Algorithms for Asymmetric Multi-core Processors,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Growing power dissipation due to high performance requirement of processor
suggests multicore processor technology, which has become the technology for
present and next decade. Research advocates asymmetric multi-core processor
system for better utilization of chip real state. However, asymmetric multi
core architecture poses a new challenge to operating system scheduler, which
traditionally assumes homogeneous hardware. So, scheduling threads to core has
become a major issue to operating system kernel. In this paper, proposed
scheduling algorithms for asymmetric multicore processors have been
categorized. This paper explores some representative algorithms of these
classes to get an overview of scheduling algorithms for asymmetric multicore
system.
","[{'version': 'v1', 'created': 'Tue, 14 Feb 2017 00:11:12 GMT'}]",2017-02-15,"[['David', 'Alan', '']]","['Asymmetric multicore', 'Scheduling', 'Heterogeneous']"
17554,1511.00725,Wajdi Dhifli,"Wajdi Dhifli, Abdoulaye Banir\'e Diallo",Toward an Efficient Multi-class Classification in an Open Universe,,,,,cs.LG cs.AI cs.DB cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classification is a fundamental task in machine learning and data mining.
Existing classification methods are designed to classify unknown instances
within a set of previously known training classes. Such a classification takes
the form of a prediction within a closed-set of classes. However, a more
realistic scenario that fits real-world applications is to consider the
possibility of encountering instances that do not belong to any of the training
classes, $i.e.$, an open-set classification. In such situation, existing
closed-set classifiers will assign a training label to these instances
resulting in a misclassification. In this paper, we introduce Galaxy-X, a novel
multi-class classification approach for open-set recognition problems. For each
class of the training set, Galaxy-X creates a minimum bounding hyper-sphere
that encompasses the distribution of the class by enclosing all of its
instances. In such manner, our method is able to distinguish instances
resembling previously seen classes from those that are of unknown ones. To
adequately evaluate open-set classification, we introduce a novel evaluation
procedure. Experimental results on benchmark datasets show the efficiency of
our approach in classifying novel instances from known as well as unknown
classes.
","[{'version': 'v1', 'created': 'Mon, 2 Nov 2015 22:04:00 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Jan 2016 02:27:55 GMT'}, {'version': 'v3', 'created': 'Thu, 1 Mar 2018 17:22:56 GMT'}]",2018-03-02,"[['Dhifli', 'Wajdi', ''], ['Diallo', 'Abdoulaye Baniré', '']]","['Multi-class classification', 'open-set classification', 'galaxy-X']"
17555,1310.0864,Kester Quist-Aphetsi,Quist-Aphetsi Kester,"Criminal Geographical Profiling: Using FCA for Visualization and
  Analysis of Crime Data","Submitted to International Journal of Research in Engineering &
  Advanced Technology (IJREAT).pp: 1-5.1.5.(2013). arXiv admin note:
  substantial text overlap with arXiv:1307.8112, arXiv:1307.7788","International Journal of Research in Engineering & Advanced
  Technology (IJREAT).pp: 1-5.1.5.(2013)",,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Fighting criminal activities in our modern societies required the engagement
of intelligent information systems that can analyze crime data geographically
and enable new concepts to be deduced from it. These information systems should
be able to create visualization of such data as well as have the capability of
giving new incite of information, if data is updated whilst maintaining the
previously predicted patterns. This paper proposed the use of Formal Concept
Analysis, or Galois Lattices, a data analysis technique grounded on Lattice
Theory and Propositional Calculus, for the visualization and analysis of crime
data. This method considered the set of common and distinct attributes of
crimes in such a way that categorization are done based on related crime types,
geographical locations and the persons involved.
","[{'version': 'v1', 'created': 'Wed, 2 Oct 2013 23:38:35 GMT'}]",2013-10-04,"[['Kester', 'Quist-Aphetsi', '']]","['Criminal Geographical Profiling', 'FCA', 'Visualization', 'Analysis', 'Galois Lattices']"
17556,1305.1428,Urmila Shrawankar Ms,"Urmila Shrawankar, V M Thakare",Speech based Password Protected Cyber Applications,Pages: 04 Figures : 03,"Conference Proceedings International Conference On Emerging
  Technologies and Applications in Engineering, Technology and Sciences
  (ICETAETS-2008), India, pp 1563-1566",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Whenever we think of cyber applications, we visualize the model that gives
the idea that we are sitting in front of computer at home or workplace
connected to internet and performing all the work that generally we have to go
and do on a specific place for example e-shopping, e-banking, e-education etc.
In case of e-shopping, we view all the products on the computer screen with all
details by a single mouse click, select the product and do all further money
transaction through net. When we think of security, is it 100% secure? No, not
at all because though it is password protected, the password is a text base
secrete code that can be open. Therefore this paper is concentrated on
preparation of speech based password protected applications.
","[{'version': 'v1', 'created': 'Tue, 7 May 2013 07:24:12 GMT'}]",2013-05-08,"[['Shrawankar', 'Urmila', ''], ['Thakare', 'V M', '']]","['Speech base Password', 'Speaker Recognition', 'Speaker Dependent', 'Text Independent', 'Isolated Word', 'Real-Time Speech Recognition System']"
17557,1708.00992,Xiaoran Xu,"Xiaoran Xu, Chunrong Fang, Qing Wu, Jia Liu, Zhenyu Chen",Testing as an Investment,"6 pages, The 26th International Conference on Software Engineering
  and Knowledge Engineering (SEKE 2014)",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software testing is an expensive and important task. Plenty of researches and
industrial efforts have been invested on improving software testing techniques,
including criteria, tools, etc. These studies can provide guidelines to select
suitable test techniques for software engineers. However, in some engineering
projects, business issues may be more important than technical ones, hence we
need to lobby non-technical members to support our decisions. In this paper, a
well-known investment model, Nelson-Siegel model, is introduced to evaluate and
forecast the processes of testing with different testing criteria. Through this
model, we provide a new perspective to understand short-term, medium-term, and
long-term returns of investments throughout the process of testing. A
preliminary experiment is conducted to investigate three testing criteria from
the viewpoint of investments. The results show that statement-coverage
criterion performs best in gaining long-term yields; the short-term and
medium-term yields of testing depend on the scale of programs and the number of
faults they contain.
","[{'version': 'v1', 'created': 'Thu, 3 Aug 2017 04:21:45 GMT'}]",2017-08-07,"[['Xu', 'Xiaoran', ''], ['Fang', 'Chunrong', ''], ['Wu', 'Qing', ''], ['Liu', 'Jia', ''], ['Chen', 'Zhenyu', '']]","['Investment', 'Nelson-Siegel model', 'Costyields', 'Testing criterion']"
17558,1407.1807,Mohammed Al-Maolegi,"Raed Shatnawi, Qutaibah Althebyan, Baraq Ghalib, Mohammed Al-Maolegi",Building A Smart Academic Advising System Using Association Rule Mining,5 pages,,,,cs.DB,http://creativecommons.org/licenses/by/3.0/,"  In an academic environment, student advising is considered a paramount
activity for both advisors and student to improve the academic performance of
students. In universities of large numbers of students, advising is a
time-consuming activity that may take a considerable effort of advisors and
university administration in guiding students to complete their registration
successfully and efficiently. Current systems are traditional and depend
greatly on the effort of the advisor to find the best selection of courses to
improve students performance. There is a need for a smart system that can
advise a large number of students every semester. In this paper, we propose a
smart system that uses association rule mining to help both students and
advisors in selecting and prioritizing courses. The system helps students to
improve their performance by suggesting courses that meet their current needs
and at the same time improve their academic performance. The system uses
association rule mining to find associations between courses that have been
registered by students in many previous semesters. The system successfully
generates a list of association rules that guide a particular student to select
courses registered by similar students.
","[{'version': 'v1', 'created': 'Fri, 4 Jul 2014 19:28:35 GMT'}]",2014-07-08,"[['Shatnawi', 'Raed', ''], ['Althebyan', 'Qutaibah', ''], ['Ghalib', 'Baraq', ''], ['Al-Maolegi', 'Mohammed', '']]","['Academic advising', 'association mining', 'smart systems']"
17559,1412.4576,Masoumeh Azghani,"Masoumeh Azghani, Mostafa Karimi, and Farokh Marvasti",Multi-Hypothesis Compressed Video Sensing Technique,,,,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a compressive sampling and Multi-Hypothesis (MH)
reconstruction strategy for video sequences which has a rather simple encoder,
while the decoding system is not that complex. We introduce a convex cost
function that incorporates the MH technique with the sparsity constraint and
the Tikhonov regularization. Consequently, we derive a new iterative algorithm
based on these criteria. This algorithm surpasses its counterparts (Elasticnet
and Tikhonov) in the recovery performance. Besides it is computationally much
faster than the Elasticnet and comparable to the Tikhonov. Our extensive
simulation results confirm these claims.
","[{'version': 'v1', 'created': 'Mon, 15 Dec 2014 13:19:24 GMT'}]",2014-12-16,"[['Azghani', 'Masoumeh', ''], ['Karimi', 'Mostafa', ''], ['Marvasti', 'Farokh', '']]","['Video Compression', 'compressed sensing', 'compressedvideo sensing', 'muti-hypothesis motion compensation']"
17560,1212.3055,Alexander Gamkrelidze,"Alexander Gamkrelidze, Gunter Hotz, Levan Varamashvili",New Invariants for the Graph Isomorphism Problem,,,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we introduce a novel polynomial-time algorithm to compute graph
invariants based on the modified random walk idea on graphs. However not proved
to be a full graph invariant by now, our method gives the right answer for the
graph instances other well-known methods could not compute (such as special
Furer Gadgets and point-line incidence graphs of finite projective planes of
higher degrees
","[{'version': 'v1', 'created': 'Thu, 13 Dec 2012 05:35:32 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Aug 2015 10:39:32 GMT'}]",2015-08-24,"[['Gamkrelidze', 'Alexander', ''], ['Hotz', 'Gunter', ''], ['Varamashvili', 'Levan', '']]","['graphs', 'graph isomorphism problem', 'efficient algorithms']"
17561,1402.1637,Wasantha Samarathunga,"Wasantha Samarathunga, Masatoshi Seki, Hidenobu Saito, Ken Ichiryu,
  Yasuhiro Ohyama",Vertical Clustering of 3D Elliptical Helical Data,,"International Journal of Computer Trends and Technology, volume 6
  number 2,Dec 2013",,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This research proposes an effective vertical clustering strategy of 3D data
in an elliptical helical shape based on 2D geometry. The clustering object is
an elliptical cross-sectioned metal pipe which is been bended in to an
elliptical helical shape which is used in wearable muscle support designing for
welfare industry. The aim of this proposed method is to maximize the vertical
clustering (vertical partitioning) ability of surface data in order to run the
product evaluation process addressed in research [2]. The experiment results
prove that the proposed method outperforms the existing threshold no of
clusters that preserves the vertical shape than applying the conventional 3D
data. This research also proposes a new product testing strategy that provides
the flexibility in computer aided testing by not restricting the sequence
depending measurements which apply weight on measuring process. The clustering
algorithms used for the experiments in this research are self-organizing map
(SOM) and K-medoids.
","[{'version': 'v1', 'created': 'Fri, 7 Feb 2014 13:42:54 GMT'}]",2014-02-10,"[['Samarathunga', 'Wasantha', ''], ['Seki', 'Masatoshi', ''], ['Saito', 'Hidenobu', ''], ['Ichiryu', 'Ken', ''], ['Ohyama', 'Yasuhiro', '']]","['3D Vertical Clustering', 'SOM', 'K-medoids', 'Computer Aided Testing', 'Elliptical Helical Bending']"
17562,1002.3008,Selva Rani R,"Abhishek Kotnala, R. Selvarani","Cognitive Process of Comprehension in Requirement Analysis in IT
  Applications","4 pages, 1 figure","International Conference, TeamTech, IISc., pp 42, 2008",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Requirement Analysis is an important phase in software development which
deals with understanding the customers requirements. It includes the collection
of information from the customer, which is regarding the customers requirements
and what he expects from the software which is to be developed. By doing so,
you can have a better understanding of what the customer actually needs and
hence can deliver the output as per the customers requirements. Studies are
being carried out to bring about improvements in the process of requirement
analysis so that errors in software development could be minimized and hence
improved and reliable products could be delivered.
","[{'version': 'v1', 'created': 'Tue, 16 Feb 2010 06:19:35 GMT'}]",2016-09-08,"[['Kotnala', 'Abhishek', ''], ['Selvarani', 'R.', '']]","['Cognition', 'cognitive informatics', 'cognitive comprehension', 'software engineering', 'requirement analysis']"
17563,1712.04622,Ghassan Samara,"Amer O. Abu Salem, Ghassan Samara, Tareq Alhmiedat",Performance Analysis of Dynamic Source Routing Protocol,4 pages,"Journal of Emerging Trends in Computing and Information Sciences,
  2014",,"Vol. 5, No. 2 February 2014",cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dynamic Source Routing (DSR) is an efficient on-demand routing protocol for
mobile ad-hoc networks (MANET). It depends on two main procedures: Route
Discovery and Route Maintenance. Route discovery is the procedure used at the
source of the packets to discover a route to the destination. Route Maintenance
is the procedure that discovers link failures and repairs them. Route caching
is the sub procedure serviceable to avoid the demand for discovering a route or
to reduce route discovery delay before every data packet is sent. The goal of
this paper is to evaluate the performance of DSR. Different performance
expressions are investigated including, delivery ratio, end to-end delay, and
throughput, depending on different cache sizes and different speeds. All of
that as a study to develop a new caching strategy as a future work.
","[{'version': 'v1', 'created': 'Wed, 13 Dec 2017 06:50:44 GMT'}]",2017-12-14,"[['Salem', 'Amer O. Abu', ''], ['Samara', 'Ghassan', ''], ['Alhmiedat', 'Tareq', '']]","['MANET', 'NS-2 Simulation', 'Routing', 'Caching', 'End-to-end delay', 'Throughput']"
17564,1701.01763,Wei Cai,"Wei Cai, Cheng Li and ShiWei Luan",SOI RF Switch for Wireless Sensor Network,,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The objective of this research was to design a 0-5 GHz RF SOI switch, with
0.18um power Jazz SOI technology by using Cadence software, for health care
applications. This paper introduces the design of a RF switch implemented in
shunt-series topology. An insertion loss of 0.906 dB and an isolation of 30.95
dB were obtained at 5 GHz. The switch also achieved a third order distortion of
53.05 dBm and 1 dB compression point reached 50.06dBm. The RF switch
performance meets the desired specification requirements.
","[{'version': 'v1', 'created': 'Fri, 6 Jan 2017 21:50:56 GMT'}]",2017-01-10,"[['Cai', 'Wei', ''], ['Li', 'Cheng', ''], ['Luan', 'ShiWei', '']]","['Shunt-Series', 'RF Switch', 'Isolation Loss', 'Insertion Loss']"
17565,1212.1368,Jos\'e Luis Ram\'irez,"Jos\'e L. Ram\'irez, Gustavo N. Rubiano, Rodrigo de Castro","A Generalization of the Fibonacci Word Fractal and the Fibonacci
  Snowflake",,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we introduce a family of infinite words that generalize the
Fibonacci word and we study their combinatorial properties. Moreover, we
associate to this family of words a family of curves, which have fractal
properties, in particular these curves have as attractor the Fibonacci word
fractal. Finally, we describe an infinite family of polyominoes (double
squares) from the generalized Fibonacci words and we study some of their
geometric properties. These last polyominoes generalize the Fibonacci
snowflake.
","[{'version': 'v1', 'created': 'Thu, 6 Dec 2012 16:27:51 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Jan 2013 17:05:32 GMT'}, {'version': 'v3', 'created': 'Tue, 4 Feb 2014 17:56:54 GMT'}]",2014-02-05,"[['Ramírez', 'José L.', ''], ['Rubiano', 'Gustavo N.', ''], ['de Castro', 'Rodrigo', '']]","['Fibonacci word', 'Fibonacci word fractal', 'Fibonacci snowflake', 'Polyomino', 'Tessellation']"
17566,1505.07062,Hajer Braham,"Hajer Braham, Sana Ben Jemaa, Gersende Fort, Eric Moulines and Berna
  Sayrac",Fixed Rank Kriging for Cellular Coverage Analysis,,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Coverage planning and optimization is one of the most crucial tasks for a
radio network operator. Efficient coverage optimization requires accurate
coverage estimation. This estimation relies on geo-located field measurements
which are gathered today during highly expensive drive tests (DT); and will be
reported in the near future by users' mobile devices thanks to the 3GPP
Minimizing Drive Tests (MDT) feature~\cite{3GPPproposal}. This feature consists
in an automatic reporting of the radio measurements associated with the
geographic location of the user's mobile device. Such a solution is still
costly in terms of battery consumption and signaling overhead. Therefore,
predicting the coverage on a location where no measurements are available
remains a key and challenging task. This paper describes a powerful tool that
gives an accurate coverage prediction on the whole area of interest: it builds
a coverage map by spatially interpolating geo-located measurements using the
Kriging technique. The paper focuses on the reduction of the computational
complexity of the Kriging algorithm by applying Fixed Rank Kriging (FRK). The
performance evaluation of the FRK algorithm both on simulated measurements and
real field measurements shows a good trade-off between prediction efficiency
and computational complexity. In order to go a step further towards the
operational application of the proposed algorithm, a multicellular use-case is
studied. Simulation results show a good performance in terms of coverage
prediction and detection of the best serving cell.
","[{'version': 'v1', 'created': 'Tue, 26 May 2015 17:42:16 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Mar 2016 21:50:11 GMT'}]",2016-03-16,"[['Braham', 'Hajer', ''], ['Jemaa', 'Sana Ben', ''], ['Fort', 'Gersende', ''], ['Moulines', 'Eric', ''], ['Sayrac', 'Berna', '']]","['Wireless Network', 'Coverage Map', 'Radio Environment Map', 'Spatial Statistics', 'Fixed Rank Kriging', 'ExpectationMaximization algorithm']"
17567,1111.1648,Archana Shukla,Archana Shukla,Sentiment Analysis of Document Based on Annotation,"14 pages, 14 figures, published in IJWEST Journal",,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  I present a tool which tells the quality of document or its usefulness based
on annotations. Annotation may include comments, notes, observation,
highlights, underline, explanation, question or help etc. comments are used for
evaluative purpose while others are used for summarization or for expansion
also. Further these comments may be on another annotation. Such annotations are
referred as meta-annotation. All annotation may not get equal weightage. My
tool considered highlights, underline as well as comments to infer the
collective sentiment of annotators. Collective sentiments of annotators are
classified as positive, negative, objectivity. My tool computes collective
sentiment of annotations in two manners. It counts all the annotation present
on the documents as well as it also computes sentiment scores of all annotation
which includes comments to obtain the collective sentiments about the document
or to judge the quality of document. I demonstrate the use of tool on research
paper.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2011 17:11:50 GMT'}]",2011-11-08,"[['Shukla', 'Archana', '']]","['Sentiment Analysis', 'Opinion Mining', 'Classification', 'Annotation', 'Sentiment Words', 'Polarity Value']"
17568,1410.0474,Ivo Herman,"Dan Martinec, Ivo Herman, Michael \v{S}ebek","A travelling wave approach to a multi-agent system with a path-graph
  topology",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents a novel approach for the analysis and control of a
multi-agent system with non-identical agents and a path-graph topology. With
the help of irrational wave transfer functions, the approach describes the
interaction among the agents from the `local' perspective and identifies
travelling waves in the system. It is shown that different dynamics of the
agents creates a virtual boundary that causes a partial reflection of the
travelling waves. Undesired effects due to the reflection of the waves, such as
amplification/attenuation, long transients or string instability, can be
compensated by the feedback controllers introduced in this paper. We show that
the controllers achieve asymptotic and even string stability of the system.
","[{'version': 'v1', 'created': 'Thu, 2 Oct 2014 08:13:47 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Jul 2015 09:59:42 GMT'}, {'version': 'v3', 'created': 'Tue, 27 Oct 2015 12:26:30 GMT'}, {'version': 'v4', 'created': 'Tue, 29 Mar 2016 13:12:25 GMT'}, {'version': 'v5', 'created': 'Tue, 11 Oct 2016 16:03:57 GMT'}]",2016-10-12,"[['Martinec', 'Dan', ''], ['Herman', 'Ivo', ''], ['Šebek', 'Michael', '']]","['multi-agent system', 'travelling waves', 'wave transfer function', 'path graph', 'irrational transfer function']"
17569,1707.09383,Matthew  Johnson,"Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson,
  Daniel Paulusma",Independent Feedback Vertex Sets for Graphs of Bounded Diameter,,,,,cs.DS cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Near-Bipartiteness problem is that of deciding whether or not the
vertices of a graph can be partitioned into sets $A$ and $B$, where $A$ is an
independent set and $B$ induces a forest. The set $A$ in such a partition is
said to be an independent feedback vertex set. Yang and Yuan proved that
Near-Bipartiteness is polynomial-time solvable for graphs of diameter 2 and
NP-complete for graphs of diameter 4. We show that Near-Bipartiteness is
NP-complete for graphs of diameter 3, resolving their open problem. We also
generalise their result for diameter 2 by proving that even the problem of
computing a minimum independent feedback vertex is polynomial-time solvable for
graphs of diameter 2.
","[{'version': 'v1', 'created': 'Fri, 28 Jul 2017 19:26:46 GMT'}]",2017-08-01,"[['Bonamy', 'Marthe', ''], ['Dabrowski', 'Konrad K.', ''], ['Feghali', 'Carl', ''], ['Johnson', 'Matthew', ''], ['Paulusma', 'Daniel', '']]","['near-bipartite graphs', 'independent feedback vertex set', 'diameter', 'computational complexity']"
17570,1004.3256,Vishal Goyal,"Fatima-Zahra Belouadha, Hajar Omrana, Ounsa Roudies",A model-driven approach for composing SAWSDL semantic Web services,"International Journal of Computer Science Issues at
  http://ijcsi.org/articles/A-model-driven-approach-for-composing-SAWSDL-semantic-Web-services.php","IJCSI, Volume 7, Issue 2, March 2010",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Composing Web services is a convenient means of dealing with complex
requests. However, the number of Web services on the Internet is increasing.
This explains the growing interest in composing Web services automatically.
Nevertheless, the Web services' semantics is necessary for any dynamic
composition process. In this article, we present an MDA approach to develop and
compose SAWSDL semantic Web services. To model Web services, we use a UML
profile which is independent of the description standards. The SAWSDL interface
files are generated by using transformation rules. To model the behavior of a
composite Web service and generate its executable BPEL file, we use the BPMN
notation in a platform of modeling and implementing business process. The main
contribution of this work is the easy and extensible solution to a model-driven
development of the semantic atomic and composite Web services.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2010 17:45:40 GMT'}]",2010-04-20,"[['Belouadha', 'Fatima-Zahra', ''], ['Omrana', 'Hajar', ''], ['Roudies', 'Ounsa', '']]","['Composite semantic Web service', 'SAWSDL', 'UML profile', 'BPMN', 'MDA']"
17571,1511.03020,Loet Leydesdorff,Loet Leydesdorff and Adina Nerghes,"Co-word Maps and Topic Modeling: A Comparison Using Small and
  Medium-Sized Corpora (n < 1000)","Journal of the Association for Information Science and Technology
  (JASIST, in press)",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Induced by ""big data,"" ""topic modeling"" has become an attractive alternative
to mapping co-words in terms of co-occurrences and co-absences using network
techniques. Does topic modeling provide an alternative for co-word mapping in
research practices using moderately sized document collections? We return to
the word/document matrix using first a single text with a strong argument (""The
Leiden Manifesto"") and then upscale to a sample of moderate size (n = 687) to
study the pros and cons of the two approaches in terms of the resulting
possibilities for making semantic maps that can serve an argument. The results
from co-word mapping (using two different routines) versus topic modeling are
significantly uncorrelated. Whereas components in the co-word maps can easily
be designated, the topic models provide sets of words that are very differently
organized. In these samples, the topic models seem to reveal similarities other
than semantic ones (e.g., linguistic ones). In other words, topic modeling does
not replace co-word mapping in small and medium-sized sets; but the paper
leaves open the possibility that topic modeling would work well for the
semantic mapping of large sets.
","[{'version': 'v1', 'created': 'Tue, 10 Nov 2015 08:43:43 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Feb 2016 07:53:45 GMT'}]",2016-02-29,"[['Leydesdorff', 'Loet', ''], ['Nerghes', 'Adina', '']]","['topic model', 'co-word map', 'word/document matrix', 'comparison', 'semantics']"
17572,1712.05893,Emmanouil Panaousis Dr,"Andrew Fielder, Sandra Konig, Emmanouil Panaousis, Stefan Schauer,
  Stefan Rass",Uncertainty in Cyber Security Investments,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When undertaking cyber security risk assessments, we must assign numeric
values to metrics to compute the final expected loss that represents the risk
that an organization is exposed to due to cyber threats. Even if risk
assessment is motivated from real-world observations and data, there is always
a high chance of assigning inaccurate values due to different uncertainties
involved (e.g., evolving threat landscape, human errors) and the natural
difficulty of quantifying risk per se. Our previous work has proposed a model
and a software tool that empowers organizations to compute optimal cyber
security strategies given their financial constraints, i.e., available cyber
security budget. We have also introduced a general game-theoretic model with
uncertain payoffs (probability-distribution-valued payoffs) showing that such
uncertainty can be incorporated in the game-theoretic model by allowing payoffs
to be random. In this paper, we combine our aforesaid works and we conclude
that although uncertainties in cyber security risk assessment lead, on average,
to different cyber security strategies, they do not play significant role into
the final expected loss of the organization when using our model and
methodology to derive this strategies. We show that our tool is capable of
providing effective decision support. To the best of our knowledge this is the
first paper that investigates how uncertainties on various parameters affect
cyber security investments.
","[{'version': 'v1', 'created': 'Sat, 16 Dec 2017 02:05:44 GMT'}]",2017-12-19,"[['Fielder', 'Andrew', ''], ['Konig', 'Sandra', ''], ['Panaousis', 'Emmanouil', ''], ['Schauer', 'Stefan', ''], ['Rass', 'Stefan', '']]","['Cyber security investments', 'uncertainty', 'game theory']"
17573,1510.03998,Pavel Klav\'ik,"Pavel Klav\'ik, Yota Otachi, Ji\v{r}\'i \v{S}ejnoha","On the Classes of Interval Graphs of Limited Nesting and Count of
  Lengths",,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 1969, Roberts introduced proper and unit interval graphs and proved that
these classes are equal. Natural generalizations of unit interval graphs called
$k$-length interval graphs were considered in which the number of different
lengths of intervals is limited by $k$. Even after decades of research, no
insight into their structure is known and the complexity of recognition is open
even for $k=2$. We propose generalizations of proper interval graphs called
$k$-nested interval graphs in which there are no chains of $k+1$ intervals
nested in each other. It is easy to see that $k$-nested interval graphs are a
superclass of $k$-length interval graphs.
  We give a linear-time recognition algorithm for $k$-nested interval graphs.
This algorithm adds a missing piece to Gajarsk\'y et al. [FOCS 2015] to show
that testing FO properties on interval graphs is FPT with respect to the
nesting $k$ and the length of the formula, while the problem is W2-hard when
parameterized just by the length of the formula. We show that a generalization
of recognition called partial representation extension is NP-hard for
$k$-length interval graphs, even when $k=2$, while Klav\'ik et al. show that it
is polynomial-time solvable for $k$-nested interval graphs.
","[{'version': 'v1', 'created': 'Wed, 14 Oct 2015 08:26:50 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Apr 2017 17:29:44 GMT'}]",2017-04-13,"[['Klavík', 'Pavel', ''], ['Otachi', 'Yota', ''], ['Šejnoha', 'Jiří', '']]","['interval graphs', 'proper and unit interval graphs', 'recognition', 'partial representationextension']"
17574,1008.3546,Ioannis Paparrizos,Ioannis Paparrizos,Homogeneous and Non Homogeneous Algorithms,"This (full) paper was accepted for publication in the 13th
  Panhellenic Conference on Informatics (PCI 2009), 10-12 September 2009,
  Corfu, Greece (8 pages)",,,,cs.DS cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by recent best case analyses for some sorting algorithms and based
on the type of complexity we partition the algorithms into two classes:
homogeneous and non homogeneous algorithms. Although both classes contain
algorithms with worst and best cases, homogeneous algorithms behave uniformly
on all instances. This partition clarifies in a completely mathematical way the
previously mentioned terms and reveals that in classifying an algorithm as
homogeneous or not best case analysis is equally important with worst case
analysis.
","[{'version': 'v1', 'created': 'Fri, 20 Aug 2010 17:58:00 GMT'}]",2010-08-23,"[['Paparrizos', 'Ioannis', '']]","['Algorithm analysis', 'Algorithm complexity', 'Algorithm classification']"
17575,1212.2067,Youssef Bassil,Youssef Bassil,A Generation-based Text Steganography Method using SQL Queries,"LACSC - Lebanese Association for Computational Sciences,
  http://www.lacsc.org","International Journal of Computer Applications, vol. 57, no.12,
  pp.27-31, 2012",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cryptography and Steganography are two techniques commonly used to secure and
safely transmit digital data. Nevertheless, they do differ in important ways.
In fact, cryptography scrambles data so that they become unreadable by
eavesdroppers; while, steganography hides the very existence of data so that
they can be transferred unnoticed. Basically, steganography is a technique for
hiding data such as messages into another form of data such as images.
Currently, many types of steganography are in use; however, there is yet no
known steganography application for query languages such as SQL. This paper
proposes a new steganography method for textual data. It encodes input text
messages into SQL carriers made up of SELECT queries. In effect, the output SQL
carrier is dynamically generated out of the input message using a dictionary of
words implemented as a hash table and organized into 65 categories, each of
which represents a particular character in the language. Generally speaking,
every character in the message to hide is mapped to a random word from a
corresponding category in the dictionary. Eventually, all input characters are
transformed into output words which are then put together to form an SQL query.
Experiments conducted, showed how the proposed method can operate on real
examples proving the theory behind it. As future work, other types of SQL
queries are to be researched including INSERT, DELETE, and UPDATE queries,
making the SQL carrier quite puzzling for malicious third parties to recuperate
the secret message that it encodes.
","[{'version': 'v1', 'created': 'Mon, 10 Dec 2012 14:01:51 GMT'}]",2012-12-11,"[['Bassil', 'Youssef', '']]","['Steganography', 'Text Steganography', 'SQL Queries']"
17576,1606.07487,Santiago Ontanon,"Adam James Summerville, Sam Snodgrass, Michael Mateas, Santiago
  Onta\~n\'on",The VGLC: The Video Game Level Corpus,"To appear in proceedings of the 7th Workshop on Procedural Content
  Generation",,,,cs.HC cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Levels are a key component of many different video games, and a large body of
work has been produced on how to procedurally generate game levels. Recently,
Machine Learning techniques have been applied to video game level generation
towards the purpose of automatically generating levels that have the properties
of the training corpus. Towards that end we have made available a corpora of
video game levels in an easy to parse format ideal for different machine
learning and other game AI research purposes.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2016 21:36:36 GMT'}, {'version': 'v2', 'created': 'Sun, 3 Jul 2016 20:04:55 GMT'}]",2016-07-05,"[['Summerville', 'Adam James', ''], ['Snodgrass', 'Sam', ''], ['Mateas', 'Michael', ''], ['Ontañón', 'Santiago', '']]","['Video Games', 'Level Design', 'Procedural Content Generation', 'Machine Learning', 'Corpus']"
17577,1607.01657,Barun Gorain,Barun Gorain and Andrzej Pelc,Deterministic Graph Exploration with Advice,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the task of graph exploration. An $n$-node graph has unlabeled
nodes, and all ports at any node of degree $d$ are arbitrarily numbered
$0,\dots, d-1$. A mobile agent has to visit all nodes and stop. The exploration
time is the number of edge traversals. We consider the problem of how much
knowledge the agent has to have a priori, in order to explore the graph in a
given time, using a deterministic algorithm. This a priori information (advice)
is provided to the agent by an oracle, in the form of a binary string, whose
length is called the size of advice. We consider two types of oracles. The
instance oracle knows the entire instance of the exploration problem, i.e., the
port-numbered map of the graph and the starting node of the agent in this map.
The map oracle knows the port-numbered map of the graph but does not know the
starting node of the agent.
  We first consider exploration in polynomial time, and determine the exact
minimum size of advice to achieve it. This size is $\log\log\log n -\Theta(1)$,
for both types of oracles.
  When advice is large, there are two natural time thresholds: $\Theta(n^2)$
for a map oracle, and $\Theta(n)$ for an instance oracle, that can be achieved
with sufficiently large advice. We show that, with a map oracle, time
$\Theta(n^2)$ cannot be improved in general, regardless of the size of advice.
We also show that the smallest size of advice to achieve this time is larger
than $n^\delta$, for any $\delta <1/3$.
  For an instance oracle, advice of size $O(n\log n)$ is enough to achieve time
$O(n)$. We show that, with any advice of size $o(n\log n)$, the time of
exploration must be at least $n^\epsilon$, for any $\epsilon <2$, and with any
advice of size $O(n)$, the time must be $\Omega(n^2)$.
  We also investigate minimum advice sufficient for fast exploration of
hamiltonian graphs.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2016 15:06:13 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Nov 2016 02:00:33 GMT'}]",2016-11-17,"[['Gorain', 'Barun', ''], ['Pelc', 'Andrzej', '']]","['algorithm', 'graph', 'exploration', 'mobile agent', 'advice']"
17578,0708.0505,Luca Di Gaspero PhD,"Luca Di Gaspero, Andrea Roli","A preliminary analysis on metaheuristics methods applied to the
  Haplotype Inference Problem","22 pages, 4 figures Technical Report: DEIS - Alma Mater Studiorum,
  University of Bologna no. DEIS-LIA-006-07",,,DEIS-LIA-006-07,cs.AI cs.CE cs.DM q-bio.QM,,"  Haplotype Inference is a challenging problem in bioinformatics that consists
in inferring the basic genetic constitution of diploid organisms on the basis
of their genotype. This information allows researchers to perform association
studies for the genetic variants involved in diseases and the individual
responses to therapeutic agents.
  A notable approach to the problem is to encode it as a combinatorial problem
(under certain hypotheses, such as the pure parsimony criterion) and to solve
it using off-the-shelf combinatorial optimization techniques. The main methods
applied to Haplotype Inference are either simple greedy heuristic or exact
methods (Integer Linear Programming, Semidefinite Programming, SAT encoding)
that, at present, are adequate only for moderate size instances.
  We believe that metaheuristic and hybrid approaches could provide a better
scalability. Moreover, metaheuristics can be very easily combined with problem
specific heuristics and they can also be integrated with tree-based search
techniques, thus providing a promising framework for hybrid systems in which a
good trade-off between effectiveness and efficiency can be reached.
  In this paper we illustrate a feasibility study of the approach and discuss
some relevant design issues, such as modeling and design of approximate solvers
that combine constructive heuristics, local search-based improvement strategies
and learning mechanisms. Besides the relevance of the Haplotype Inference
problem itself, this preliminary analysis is also an interesting case study
because the formulation of the problem poses some challenges in modeling and
hybrid metaheuristic solver design that can be generalized to other problems.
","[{'version': 'v1', 'created': 'Fri, 3 Aug 2007 12:49:21 GMT'}]",2007-08-06,"[['Di Gaspero', 'Luca', ''], ['Roli', 'Andrea', '']]","['Metaheuristics', 'haplotype inference', 'bioinformatics']"
17579,1710.02759,Forrest Iandola,Forrest Iandola and Kurt Keutzer,"Keynote: Small Neural Nets Are Beautiful: Enabling Embedded Systems with
  Small Deep-Neural-Network Architectures",Keynote at Embedded Systems Week (ESWEEK) 2017,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the last five years Deep Neural Nets have offered more accurate
solutions to many problems in speech recognition, and computer vision, and
these solutions have surpassed a threshold of acceptability for many
applications. As a result, Deep Neural Networks have supplanted other
approaches to solving problems in these areas, and enabled many new
applications. While the design of Deep Neural Nets is still something of an art
form, in our work we have found basic principles of design space exploration
used to develop embedded microprocessor architectures to be highly applicable
to the design of Deep Neural Net architectures. In particular, we have used
these design principles to create a novel Deep Neural Net called SqueezeNet
that requires as little as 480KB of storage for its model parameters. We have
further integrated all these experiences to develop something of a playbook for
creating small Deep Neural Nets for embedded systems.
","[{'version': 'v1', 'created': 'Sat, 7 Oct 2017 23:33:31 GMT'}]",2017-10-10,"[['Iandola', 'Forrest', ''], ['Keutzer', 'Kurt', '']]","['Embedded computer vision', 'Deep Learning', 'Deep Neural Nets', 'Convolutional Neural Nets']"
17580,1008.4115,Weituo Zhang,"Weituo Zhang, Chjan C. Lim","Noise in Naming Games, partial synchronization and community detection
  in social networks",,,,,cs.MA cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Naming Games (NG) are agent-based models for agreement dynamics, peer
pressure and herding in social networks, and protocol selection in autonomous
ad-hoc sensor networks. By introducing a small noise term to the NG, the
resulting Markov Chain model called Noisy Naming Games (NNG) are ergodic, in
which all partial consensus states are recurrent. By using Gibbs-Markov
equivalence we show how to get the NNG's stationary distribution in terms of
the local specification of a related Markov Random Field (MRF). By ordering the
partially-synchronized states according to their Gibbs energy, taken here to be
a good measure of social tension, this method offers an enhanced method for
community-detection in social interaction data. We show how the lowest Gibbs
energy multi-name states separate and display the hidden community structures
within a social network.
","[{'version': 'v1', 'created': 'Tue, 24 Aug 2010 19:24:24 GMT'}]",2010-08-25,"[['Zhang', 'Weituo', ''], ['Lim', 'Chjan C.', '']]","['Naming Game', 'Social network', 'Noise in Markov Chain']"
17581,1402.3346,Guido F.  Montufar,"Guido Montufar, Nihat Ay, Keyan Ghazi-Zahedi","Geometry and Expressive Power of Conditional Restricted Boltzmann
  Machines","30 pages, 5 figures, 1 algorithm",,,,cs.NE cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Conditional restricted Boltzmann machines are undirected stochastic neural
networks with a layer of input and output units connected bipartitely to a
layer of hidden units. These networks define models of conditional probability
distributions on the states of the output units given the states of the input
units, parametrized by interaction weights and biases. We address the
representational power of these models, proving results their ability to
represent conditional Markov random fields and conditional distributions with
restricted supports, the minimal size of universal approximators, the maximal
model approximation errors, and on the dimension of the set of representable
conditional distributions. We contribute new tools for investigating
conditional probability models, which allow us to improve the results that can
be derived from existing work on restricted Boltzmann machine probability
models.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2014 02:15:09 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Jul 2014 17:00:35 GMT'}, {'version': 'v3', 'created': 'Thu, 12 Mar 2015 15:20:04 GMT'}]",2015-03-13,"[['Montufar', 'Guido', ''], ['Ay', 'Nihat', ''], ['Ghazi-Zahedi', 'Keyan', '']]","['conditional restricted Boltzmann machine', 'universal approximation', 'Kullback-Leiblerapproximation error', 'expected dimension']"
17582,1409.3600,Adrian Dumitrescu,Ke Chen and Adrian Dumitrescu,Selection Algorithms with Small Groups,"13 pages, 5 figures, 1 table",,,,cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We revisit the selection problem, namely that of computing the $i$th order
statistic of $n$ given elements, in particular the classic deterministic
algorithm by grouping and partition due to Blum, Floyd, Pratt, Rivest, and
Tarjan (1973). Whereas the original algorithm uses groups of odd size at least
$5$ and runs in linear time, it has been perpetuated in the literature that
using smaller group sizes will force the worst-case running time to become
superlinear, namely $\Omega(n \log{n})$. We first point out that the usual
arguments found in the literature justifying the superlinear worst-case running
time fall short of proving this claim. We further prove that it is possible to
use group size smaller than $5$ while maintaining the worst case linear running
time. To this end we introduce three simple variants of the classic algorithm,
the repeated step algorithm, the shifting target algorithm, and the hyperpair
algorithm, all running in linear time.
","[{'version': 'v1', 'created': 'Thu, 11 Sep 2014 21:18:21 GMT'}, {'version': 'v2', 'created': 'Sat, 20 Oct 2018 03:18:57 GMT'}, {'version': 'v3', 'created': 'Fri, 5 Apr 2019 19:08:10 GMT'}]",2019-04-09,"[['Chen', 'Ke', ''], ['Dumitrescu', 'Adrian', '']]","['median selection', 'ith order statistic', 'comparison algorithm']"
17583,1307.0468,Aliaksei Sandryhaila,"Aliaksei Sandryhaila, Jose M. F. Moura",Discrete Signal Processing on Graphs: Frequency Analysis,,,,,cs.SI math.SP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Signals and datasets that arise in physical and engineering applications, as
well as social, genetics, biomolecular, and many other domains, are becoming
increasingly larger and more complex. In contrast to traditional time and image
signals, data in these domains are supported by arbitrary graphs. Signal
processing on graphs extends concepts and techniques from traditional signal
processing to data indexed by generic graphs. This paper studies the concepts
of low and high frequencies on graphs, and low-, high-, and band-pass graph
filters. In traditional signal processing, there concepts are easily defined
because of a natural frequency ordering that has a physical interpretation. For
signals residing on graphs, in general, there is no obvious frequency ordering.
We propose a definition of total variation for graph signals that naturally
leads to a frequency ordering on graphs and defines low-, high-, and band-pass
graph signals and filters. We study the design of graph filters with specified
frequency response, and illustrate our approach with applications to sensor
malfunction detection and data classification.
","[{'version': 'v1', 'created': 'Mon, 1 Jul 2013 18:33:04 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Nov 2013 19:44:53 GMT'}]",2013-11-19,"[['Sandryhaila', 'Aliaksei', ''], ['Moura', 'Jose M. F.', '']]","['Signal processing on graphs', 'graph filter', 'totalvariation', 'filter design', 'regularization', 'low pass', 'high pass', 'bandpass']"
17584,1108.5017,Maxime Amblard,"Sai Qian (LORIA), Maxime Amblard (LORIA)",Event in Compositional Dynamic Semantics,"16 pages; Logical Aspect of Computational Linguistic, Montpellier :
  France (2011)",,,,cs.CL cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a framework which constructs an event-style dis- course semantics.
The discourse dynamics are encoded in continuation semantics and various
rhetorical relations are embedded in the resulting interpretation of the
framework. We assume discourse and sentence are distinct semantic objects, that
play different roles in meaning evalua- tion. Moreover, two sets of composition
functions, for handling different discourse relations, are introduced. The
paper first gives the necessary background and motivation for event and dynamic
semantics, then the framework with detailed examples will be introduced.
","[{'version': 'v1', 'created': 'Thu, 25 Aug 2011 06:08:16 GMT'}]",2011-08-26,"[['Qian', 'Sai', '', 'LORIA'], ['Amblard', 'Maxime', '', 'LORIA']]","['Event', 'Dynamics', 'Continuation Semantics', 'DRT', 'DiscourseStructure', 'Rhetorical Relation', 'Accessibility', 'λ-calculus']"
17585,1704.02608,Moran Feldman,"Moran Feldman, Ola Svensson and Rico Zenklusen",A Framework for the Secretary Problem on the Intersection of Matroids,45 pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The secretary problem became one of the most prominent online selection
problems due to its numerous applications in online mechanism design. The task
is to select a maximum weight subset of elements subject to given constraints,
where elements arrive one-by-one in random order, revealing a weight upon
arrival. The decision whether to select an element has to be taken immediately
after its arrival. The different applications that map to the secretary problem
ask for different constraint families to be handled. The most prominent ones
are matroid constraints, which both capture many relevant settings and admit
strongly competitive secretary algorithms. However, dealing with more involved
constraints proved to be much more difficult, and strong algorithms are known
only for a few specific settings. In this paper, we present a general framework
for dealing with the secretary problem over the intersection of several
matroids. This framework allows us to combine and exploit the large set of
matroid secretary algorithms known in the literature. As one consequence, we
get constant-competitive secretary algorithms over the intersection of any
constant number of matroids whose corresponding (single-)matroid secretary
problems are currently known to have a constant-competitive algorithm.
Moreover, we show that our results extend to submodular objectives.
","[{'version': 'v1', 'created': 'Sun, 9 Apr 2017 14:19:17 GMT'}]",2017-04-11,"[['Feldman', 'Moran', ''], ['Svensson', 'Ola', ''], ['Zenklusen', 'Rico', '']]","['matroid secretary problem', 'matroid intersection', 'online algorithms']"
17586,1406.2783,Prof. Dr. Vladimir Rybakov Mr,Vladimir Rybakov,"Linear Non-Transitive Temporal Logic, Knowledge Operations, Algorithms
  for Admissibility",arXiv admin note: text overlap with arXiv:1405.0559,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper studies problems of satisfiability, decidability and admissibility
of inference rules, conceptions of knowledge and agent's knowledge in
non-transitive temporal linear logic LTL(Past,m). We find algorithms solving
mentioned problems, justify our approach to consider linear non-transitive time
with several examples. Main, most complicated, technical new result is
decidability of LTL(Past,m) w.r.t. admissible rules. We discuss several ways to
formalize conceptions of knowledge and agent's knowledge within given approach
in non-transitive linear logic with models directed to past.
","[{'version': 'v1', 'created': 'Wed, 11 Jun 2014 05:46:05 GMT'}]",2014-06-12,"[['Rybakov', 'Vladimir', '']]","['temporal logic', 'non-transitive accessibility relations', 'knowledge', 'parameterized knowledge operations', 'satisfiability', 'admissible rules', 'decidingalgorithms']"
17587,1206.5021,L\'aszl\'o Dobos,"L\'aszl\'o Dobos, Tam\'as Budav\'ari, Nolan Li, Alexander S. Szalay
  and Istv\'an Csabai","SkyQuery: An Implementation of a Parallel Probabilistic Join Engine for
  Cross-Identification of Multiple Astronomical Databases",,,,,cs.DB astro-ph.IM cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-wavelength astronomical studies require cross-identification of
detections of the same celestial objects in multiple catalogs based on
spherical coordinates and other properties. Because of the large data volumes
and spherical geometry, the symmetric N-way association of astronomical
detections is a computationally intensive problem, even when sophisticated
indexing schemes are used to exclude obviously false candidates. Legacy
astronomical catalogs already contain detections of more than a hundred million
objects while the ongoing and future surveys will produce catalogs of billions
of objects with multiple detections of each at different times. The varying
statistical error of position measurements, moving and extended objects, and
other physical properties make it necessary to perform the cross-identification
using a mathematically correct, proper Bayesian probabilistic algorithm,
capable of including various priors. One time, pair-wise cross-identification
of these large catalogs is not sufficient for many astronomical scenarios.
Consequently, a novel system is necessary that can cross-identify multiple
catalogs on-demand, efficiently and reliably. In this paper, we present our
solution based on a cluster of commodity servers and ordinary relational
databases. The cross-identification problems are formulated in a language based
on SQL, but extended with special clauses. These special queries are
partitioned spatially by coordinate ranges and compiled into a complex workflow
of ordinary SQL queries. Workflows are then executed in a parallel framework
using a cluster of servers hosting identical mirrors of the same data sets.
","[{'version': 'v1', 'created': 'Thu, 21 Jun 2012 21:50:44 GMT'}]",2012-06-25,"[['Dobos', 'László', ''], ['Budavári', 'Tamás', ''], ['Li', 'Nolan', ''], ['Szalay', 'Alexander S.', ''], ['Csabai', 'István', '']]","['probabilistic join', 'query optimization and languages', 'astronomical catalogs', 'workflow', 'computational statistics']"
17588,1212.4608,Vittal Premachandran,"Vittal Premachandran, Ramakrishna Kakarala",Perceptually Motivated Shape Context Which Uses Shape Interiors,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we identify some of the limitations of current-day shape
matching techniques. We provide examples of how contour-based shape matching
techniques cannot provide a good match for certain visually similar shapes. To
overcome this limitation, we propose a perceptually motivated variant of the
well-known shape context descriptor. We identify that the interior properties
of the shape play an important role in object recognition and develop a
descriptor that captures these interior properties. We show that our method can
easily be augmented with any other shape matching algorithm. We also show from
our experiments that the use of our descriptor can significantly improve the
retrieval rates.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2012 09:40:09 GMT'}]",2012-12-20,"[['Premachandran', 'Vittal', ''], ['Kakarala', 'Ramakrishna', '']]","['Computer Vision', 'Shape Retrieval', 'Shape Context', 'Perceptual Techniques']"
17589,1204.5929,Fabrizio Luccio,Fabrizio Luccio and Linda Pagli,Chain Rotations: a New Look at Tree Distance,,,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As well known the rotation distance D(S,T) between two binary trees S, T of n
vertices is the minimum number of rotations of pairs of vertices to transform S
into T. We introduce the new operation of chain rotation on a tree, involving
two chains of vertices, that requires changing exactly three pointers in the
data structure as for a standard rotation, and define the corresponding chain
distance C(S,T). As for D(S,T), no polynomial time algorithm to compute C(S,T)
is known. We prove a constructive upper bound and an analytical lower bound on
C(S,T) based on the number of maximal chains in the two trees. In terms of n we
prove the general upper bound C(S,T)<= n-1 and we show that there are pairs of
trees for which this bound is tight. No similar result is known for D(S,T)
where the best upper and lower bounds are 2n-6 and 5n/3-4 respectively.
","[{'version': 'v1', 'created': 'Thu, 26 Apr 2012 14:05:22 GMT'}]",2012-04-27,"[['Luccio', 'Fabrizio', ''], ['Pagli', 'Linda', '']]","['Binary tree', 'Rotation distance', 'Chain distance', 'Upper and lowerbounds', 'Design of algorithms']"
17590,0907.1839,Michael Palmer,"Michael E. Palmer, Daniel B. Miller",An Evolved Neural Controller for Bipdedal Walking with Dynamic Balance,"6 pages, 7 figures. In Proceedings of the Genetic and Evolutionary
  Computation Conference (GECCO) 2009, Montreal","Palmer, M.E. and Miller, D.B. An Evolved Neural Controller for
  Bipdedal Walking with Dynamic Balance. In Proceedings of the Genetic and
  Evolutionary Computation Conference (GECCO) 2009, Montreal, July 8-12, 2009",,,cs.NE cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We successfully evolved a neural network controller that produces dynamic
walking in a simulated bipedal robot with compliant actuators, a difficult
control problem. The evolutionary evaluation uses a detailed software
simulation of a physical robot. We describe: 1) a novel theoretical method to
encourage populations to evolve ""around"" local optima, which employs multiple
demes and fitness functions of progressively increasing difficulty, and 2) the
novel genetic representation of the neural controller.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2009 15:21:56 GMT'}]",2009-07-13,"[['Palmer', 'Michael E.', ''], ['Miller', 'Daniel B.', '']]","['Neural networks', 'robotics', 'bipedal', 'dynamic walking', 'evolution']"
17591,1009.2270,Luciano Caroprese,L. Caroprese and M. Truszczynski,Active Integrity Constraints and Revision Programming,"48 pages, 3 figures",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study active integrity constraints and revision programming, two
formalisms designed to describe integrity constraints on databases and to
specify policies on preferred ways to enforce them. Unlike other more commonly
accepted approaches, these two formalisms attempt to provide a declarative
solution to the problem. However, the original semantics of founded repairs for
active integrity constraints and justified revisions for revision programs
differ. Our main goal is to establish a comprehensive framework of semantics
for active integrity constraints, to find a parallel framework for revision
programs, and to relate the two. By doing so, we demonstrate that the two
formalisms proposed independently of each other and based on different
intuitions when viewed within a broader semantic framework turn out to be
notational variants of each other. That lends support to the adequacy of the
semantics we develop for each of the formalisms as the foundation for a
declarative approach to the problem of database update and repair. In the paper
we also study computational properties of the semantics we consider and
establish results concerned with the concept of the minimality of change and
the invariance under the shifting transformation.
","[{'version': 'v1', 'created': 'Sun, 12 Sep 2010 22:14:04 GMT'}]",2010-09-14,"[['Caroprese', 'L.', ''], ['Truszczynski', 'M.', '']]","['inconsistent databases', 'active integrity constraints', 'revision programming']"
17592,1412.4051,Vahan Mkrtchyan,"Zola Donovan, Vahan Mkrtchyan, K. Subramani",Complexity issues in some clustering problems in combinatorial circuits,"20 pages, 10 figures",,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The modern integrated circuit is one of the most complex products that has
been engineered to-date. It continues to grow in complexity as the years
progress. As a result, very large-scale integrated (VLSI) circuit design now
involves massive design teams employing state-of-the art computer-aided design
(CAD) tools. One of the oldest, yet most important CAD problems for VLSI
circuits is physical design automation, where one needs to compute the best
physical layout of millions to billions of circuit components on a tiny silicon
surface \cite{Lim08}. The process of mapping an electronic design to a chip
involves a number of physical design stages, one of which is clustering. In
this paper, we focus on problems in clustering which are critical for more
sustainable chips. The clustering problem in combinatorial circuits alone is a
source of multiple models. In particular, we consider the problem of clustering
combinatorial circuits for delay minimization, when logic replication is not
allowed ({\sc CN}). The problem of delay minimization when logic replication is
allowed ({\sc CA}) has been well studied, and is known to be solvable in
polynomial-time \cite{Wong1}. However, unbounded logic replication can be quite
expensive. Thus, {\sc CN} is an important problem. We show that selected
variants of {\sc CN} are {\bf NP-hard}. We also obtain approximability and
inapproximability results for these problems. A preliminary version of this
paper appeared in \cite{Don15}.
","[{'version': 'v1', 'created': 'Thu, 11 Dec 2014 18:03:48 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Jan 2017 13:19:42 GMT'}]",2017-01-20,"[['Donovan', 'Zola', ''], ['Mkrtchyan', 'Vahan', ''], ['Subramani', 'K.', '']]","['Clustering without replication', 'computational complexity', 'NPcompleteness', 'approximation', 'inapproximability']"
17593,1312.2383,Griffith Klogo S,"Griffith S. Klogo, Akpeko Gasonoo and Isaac K. E. Ampomah","On the Performance of Filters for Reduction of Speckle Noise in SAR
  Images off the Coast of the Gulf of Guinea",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Synthetic Aperture Radar (SAR) imagery to monitor oil spills are some methods
that have been proposed for the West African sub-region. With the increase in
the number of oil exploration companies in Ghana (and her neighbors) and the
rise in the coastal activities in the sub-region, there is the need for proper
monitoring of the environmental impact of these socio-economic activities on
the environment. Detection and near real-time information about oil spills are
fundamental in reducing oil spill environmental impact. SAR images are prone to
some noise, which is predominantly speckle noise around the coastal areas. This
paper evaluates the performance of the mean and median filters used in the
preprocessing filtering to reduce speckle noise in SAR images for most image
processing algorithms.
","[{'version': 'v1', 'created': 'Mon, 9 Dec 2013 11:14:21 GMT'}]",2013-12-10,"[['Klogo', 'Griffith S.', ''], ['Gasonoo', 'Akpeko', ''], ['Ampomah', 'Isaac K. E.', '']]","['SAR images', 'Mean filter', 'Median filter', 'Speckle noise', 'MSE and PSNR']"
17594,1010.3201,Marie Ferbus-Zanda,"Marie Ferbus-Zanda (LIAFA), Serge Grigorieff (LIAFA)","Kolmogorov Complexity in perspective. Part I: Information Theory and
  Randomnes",40 pages,Synthese / Synth\`ese (2010) 00,,,cs.LO cs.CC cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We survey diverse approaches to the notion of information: from Shannon
entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov
complexity are presented: randomness and classification. The survey is divided
in two parts in the same volume. Part I is dedicated to information theory and
the mathematical formalization of randomness based on Kolmogorov complexity.
This last application goes back to the 60's and 70's with the work of
Martin-L\""of, Schnorr, Chaitin, Levin, and has gained new impetus in the last
years.
","[{'version': 'v1', 'created': 'Fri, 15 Oct 2010 15:58:13 GMT'}]",2010-10-20,"[['Ferbus-Zanda', 'Marie', '', 'LIAFA'], ['Grigorieff', 'Serge', '', 'LIAFA']]","['Logic', 'Computer Science', 'Algoritmmic Information Theory', 'Shannon Information Theory', 'Kolmogorov Complexity', 'Randomness']"
17595,1305.7467,Uwe Aickelin,"Simon Miller, Susan Appleby, Jonathan M. Garibaldi, Uwe Aickelin",Towards a More Systematic Approach to Secure Systems Design and Analysis,,"International Journal of Secure Software Engineering 4(1), 11-30,
  2013",,,cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The task of designing secure software systems is fraught with uncertainty, as
data on uncommon attacks is limited, costs are difficult to estimate, and
technology and tools are continually changing. Consequently, experts may
interpret the security risks posed to a system in different ways, leading to
variation in assessment. This paper presents research into measuring the
variability in decision making between security professionals, with the
ultimate goal of improving the quality of security advice given to software
system designers. A set of thirty nine cyber-security experts took part in an
exercise in which they independently assessed a realistic system scenario. This
study quantifies agreement in the opinions of experts, examines methods of
aggregating opinions, and produces an assessment of attacks from ratings of
their components. We show that when aggregated, a coherent consensus view of
security emerges which can be used to inform decisions made during systems
design.
","[{'version': 'v1', 'created': 'Fri, 31 May 2013 15:59:58 GMT'}]",2013-06-03,"[['Miller', 'Simon', ''], ['Appleby', 'Susan', ''], ['Garibaldi', 'Jonathan M.', ''], ['Aickelin', 'Uwe', '']]","['Secure Systems Design', 'Expert Decision Making', 'Aggregation', 'Group Decision Making', 'Interval-Value Survey Data', 'Ordered Weighted Average']"
17596,1603.06297,Chandra Sekhar Mr,"Mrudula S, ChandraMouli Reddy, Lakshmi Narayana, JayaPrakash, Chandra
  Sekhar Vorugunti","Notes on ""An Effective ECC based User Access Control Scheme with
  Attribute based Encryption for WSN""",AIMOC 2016 Jadavpur university,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rapid growth of networking and communication technologies results in
amalgamation of 'Internet of Things' and 'Wireless sensor networks' to form
WSNIT. WSNIT facilitates the WSN to connect dynamically to Internet and
exchange the data with the external world. The critical data stored in sensor
nodes related to patient health, environment can be accessed by attackers via
insecure internet. To counterattack this, there is a demand for data integrity
and controlled data access by incorporating a highly secure and light weight
authentication schemes. In this context, Santanu et al had proposed an
attribute based authentication framework for WSN and discussed on its security
strengths. In this paper, we do a thorough analysis on Santanu et al scheme, to
show that their scheme is susceptible to privileged insider attack and node
capture attack. We also demonstrate that Santanu et al scheme consists of major
inconsistencies which restrict the protocol execution.
","[{'version': 'v1', 'created': 'Fri, 18 Mar 2016 08:33:29 GMT'}]",2016-03-22,"[['S', 'Mrudula', ''], ['Reddy', 'ChandraMouli', ''], ['Narayana', 'Lakshmi', ''], ['JayaPrakash', '', ''], ['Vorugunti', 'Chandra Sekhar', '']]","['WSN security', 'Authentication', 'Attribute based']"
17597,1710.06516,David Broman,David Broman,Hybrid Simulation Safety: Limbos and Zero Crossings,,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Physical systems can be naturally modeled by combining continuous and
discrete models. Such hybrid models may simplify the modeling task of complex
system, as well as increase simulation performance. Moreover, modern simulation
engines can often efficiently generate simulation traces, but how do we know
that the simulation results are correct? If we detect an error, is the error in
the model or in the simulation itself? This paper discusses the problem of
simulation safety, with the focus on hybrid modeling and simulation. In
particular, two key aspects are studied: safe zero-crossing detection and
deterministic hybrid event handling. The problems and solutions are discussed
and partially implemented in Modelica and Ptolemy II.
","[{'version': 'v1', 'created': 'Tue, 17 Oct 2017 22:24:10 GMT'}]",2017-10-19,"[['Broman', 'David', '']]","['Modeling', 'Simulation', 'Hybrid Semantics', 'Zero-Crossing Detector']"
17598,1511.08899,Mohamed Moustafa,Mohamed Moustafa,Applying deep learning to classify pornographic images and videos,"PSIVT 2015, the final publication is available at link.springer.com",,,,cs.CV cs.MM cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is no secret that pornographic material is now a one-click-away from
everyone, including children and minors. General social media networks are
striving to isolate adult images and videos from normal ones. Intelligent image
analysis methods can help to automatically detect and isolate questionable
images in media. Unfortunately, these methods require vast experience to design
the classifier including one or more of the popular computer vision feature
descriptors. We propose to build a classifier based on one of the recently
flourishing deep learning techniques. Convolutional neural networks contain
many layers for both automatic features extraction and classification. The
benefit is an easier system to build (no need for hand-crafting features and
classifiers). Additionally, our experiments show that it is even more accurate
than the state of the art methods on the most recent benchmark dataset.
","[{'version': 'v1', 'created': 'Sat, 28 Nov 2015 13:55:25 GMT'}]",2015-12-01,"[['Moustafa', 'Mohamed', '']]","['deep learning', 'convolutional neural networks', 'adult imageclassification']"
17599,1710.05723,Gerardo Tiban\'a-Herrera,"Gerardo Tiban\'a-Herrera, Mar\'ia Teresa Fern\'andez-Baj\'on, F\'elix
  de Moya-Aneg\'on","Categorization of an emerging discipline in the world publication system
  (SCOPUS): E-learning","30 pages, 6 figures, 3 tables",,,,cs.DL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  E-learning has been continuously present in current educational discourse,
thanks to technological advances, learning methodologies and public or
organizational policies, among other factors. However, despite its boom and
dominance in various subject areas, this thematic does not yet exist in the
world system of publications. Therefore, works in this thematic end up being
published under related categories, particularly Education or categories within
subject area Computer Science, thus fragmenting and make invisible the existing
knowledge. This work is based on the hypothesis that the scientific
communication of e-learning has a sufficient degree of cohesion to be
considered as a thematic category in itself. From a bibliometric approach, its
scientific production was analyzed, obtaining the bibliographic data of SCOPUS
and SCImago, selecting its main descriptors and generating visualizations
through VOSViewer with the mapping overlay technique, to represent its set and
proximity. As a result, it was determined that a set of 219 publications show a
high bibliometric interrelation among its articles and these are presented
transversely between the social sciences, computer science and health. This set
serves as a channel of scientific communication and structure of knowledge on
the thematic and can therefore be considered as the basis for establishing the
""e-learning"" thematic category in the world system of scientific publications,
contributing to the consolidation of the discipline, to its access and
development by researchers.
","[{'version': 'v1', 'created': 'Mon, 16 Oct 2017 14:23:37 GMT'}]",2017-10-17,"[['Tibaná-Herrera', 'Gerardo', ''], ['Fernández-Bajón', 'María Teresa', ''], ['de Moya-Anegón', 'Félix', '']]","['e-learning', 'Bibliometric', 'Map of science', 'SCOPUS', 'SCImago']"
17600,1307.2724,A. Emre Cetin,A. Emre Cetin,The technique of in-place associative sorting,"34 Pages. arXiv admin note: substantial text overlap with
  arXiv:1209.0572, arXiv:1210.1771, arXiv:1209.3668, arXiv:1209.1942,
  arXiv:1209.4714",,,,cs.DS,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In the first place, a novel, yet straightforward in-place integer
value-sorting algorithm is presented. It sorts in linear time using constant
amount of additional memory for storing counters and indices beside the input
array. The technique is inspired from the principal idea behind one of the
ordinal theories of ""serial order in behavior"" and explained by the analogy
with the three main stages in the formation and retrieval of memory in
cognitive neuroscience: (i) practicing, (ii) storage and (iii) retrieval. It is
further improved in terms of time complexity as well as specialized for
distinct integers, though still improper for rank-sorting.
  Afterwards, another novel, yet straightforward technique is introduced which
makes this efficient value-sorting technique proper for rank-sorting. Hence,
given an array of n elements each have an integer key, the technique sorts the
elements according to their integer keys in linear time using only constant
amount of additional memory. The devised technique is very practical and
efficient outperforming bucket sort, distribution counting sort and address
calculation sort family of algorithms making it attractive in almost every case
even when space is not a critical resource.
","[{'version': 'v1', 'created': 'Wed, 10 Jul 2013 09:13:35 GMT'}]",2013-07-11,"[['Cetin', 'A. Emre', '']]","['associative sort', 'in-situ permutation sort', 'stimulation sort', 'linear time sorting']"
17601,0908.0856,Tobias Renk,"Tobias Renk, Holger Jaekel, Friedrich K. Jondral, Deniz Gunduz, Andrea
  Goldsmith",Outage Capacity of Incremental Relaying at Low Signal-to-Noise Ratios,"5 pages, 4 figures, to be presented at VTC Fall 2009 in Anchorage,
  Alaska",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the \epsilon-outage capacity of incremental relaying at low
signal-to-noise ratios (SNR) in a wireless cooperative network with slow
Rayleigh fading channels. The relay performs decode-and-forward and repetition
coding is employed in the network, which is optimal in the low SNR regime. We
derive an expression on the optimal relay location that maximizes the
\epsilon-outage capacity. It is shown that this location is independent of the
outage probability and SNR but only depends on the channel conditions
represented by a path-loss factor. We compare our results to the
\epsilon-outage capacity of the cut-set bound and demonstrate that the ratio
between the \epsilon-outage capacity of incremental relaying and the cut-set
bound lies within 1/\sqrt{2} and 1. Furthermore, we derive lower bounds on the
\epsilon-outage capacity for the case of K relays.
","[{'version': 'v1', 'created': 'Thu, 6 Aug 2009 13:06:26 GMT'}]",2009-08-07,"[['Renk', 'Tobias', ''], ['Jaekel', 'Holger', ''], ['Jondral', 'Friedrich K.', ''], ['Gunduz', 'Deniz', ''], ['Goldsmith', 'Andrea', '']]","['cooperative communications', 'incremental relaying', 'ǫ-outage capacity']"
17602,0803.1111,Abedelaziz Mohaisen,"Abedelaziz Mohaisen, DaeHun Nyang, KyungHee Lee","Hierarchical Grid-Based Pairwise Key Pre-distribution in Wireless Sensor
  Networks","13 pages, 9 figures, 2 tables, to appear in the International Journal
  of Networks and Security",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The security of wireless sensor networks is an active topic of research where
both symmetric and asymmetric key cryptography issues have been studied. Due to
their computational feasibility on typical sensor nodes, symmetric key
algorithms that use the same key to encrypt and decrypt messages have been
intensively studied and perfectly deployed in such environment. Because of the
wireless sensor's limited infrastructure, the bottleneck challenge for
deploying these algorithms is the key distribution. For the same reason of
resources restriction, key distribution mechanisms which are used in
traditional wireless networks are not efficient for sensor networks.
  To overcome the key distribution problem, several key pre-distribution
algorithms and techniques that assign keys or keying material for the networks
nodes in an offline phase have been introduced recently. In this paper, we
introduce a supplemental distribution technique based on the communication
pattern and deployment knowledge modeling. Our technique is based on the
hierarchical grid deployment. For granting a proportional security level with
number of dependent sensors, we use different polynomials in different orders
with different weights. In seek of our proposed work's value, we provide a
detailed analysis on the used resources, resulting security, resiliency, and
connectivity compared with other related works.
","[{'version': 'v1', 'created': 'Fri, 7 Mar 2008 15:30:18 GMT'}]",2008-03-10,"[['Mohaisen', 'Abedelaziz', ''], ['Nyang', 'DaeHun', ''], ['Lee', 'KyungHee', '']]","['Sensornetworksecurity', 'keypredistribution', 'deployment knowledge', 'grid network', 'communication efficiency']"
17603,0907.1755,Khnykin Ivan Gennadyevich,"R.T. Faizullin, I.G. Khnykin, V.I.Dylkeyt","The SAT solving method as applied to cryptographic analysis of
  asymmetric ciphers","10 pages, 3 figures",,,,cs.CR cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The one of the most interesting problem of discrete mathematics is the SAT
(satisfiability) problem. Good way in SAT solver developing is to transform the
SAT problem to the problem of continuous search of global minimums of the
functional associated with the CNF. This article proves the special
construction of the functional and offers to solve the system of non-linear
algebraic equation that determines functional stationary points via modified
method of consecutive approximation. The article describes parallel versions of
the method. Also gives the schema of using the method to important problems of
cryptographic analysis of asymmetric ciphers, including determining concrete
bits of multipliers (in binary form) in large factorization problems and
concrete bits of exponent of discrete logarithm problem.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2009 08:18:17 GMT'}]",2009-07-13,"[['Faizullin', 'R. T.', ''], ['Khnykin', 'I. G.', ''], ['Dylkeyt', 'V. I.', '']]","['CNF', 'SAT', 'resolution', 'minimization', 'cryptographic analysis', 'factorization']"
17604,1409.6596,Bernhard Rumpe,"Marcus Fontoura, Wolfgang Pree, Bernhard Rumpe",The WebShop E-Commerce Framework,"6 pages, 15 figures","International Conference on Internet Computing CSREA press, 2001",,,cs.SE cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an e-commerce framework called WebShop, which was
developed by the authors for the purpose of demonstrating the use of UML and
the UML-F in the domain of Web applications. Thus, the WebShop is not regarded
as a full-fledged system out of which real Web stores can be derived. For
example, the framework in the presented version does not encounter security
features. However, it presents the most important variation points related to
online catalogs. The UML-F Web site http://www.UML-F.net provides the Java
source files and some sample adaptations of WebShop.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 18:09:12 GMT'}]",2014-09-24,"[['Fontoura', 'Marcus', ''], ['Pree', 'Wolfgang', ''], ['Rumpe', 'Bernhard', '']]","['e-commerce', 'UML', 'UML-F', 'objectoriented frameworks']"
17605,1603.08564,Bodhisattwa Majumder,"Satrajit Mukherjee, Bodhisattwa Prasad Majumder, Aritran Piplai, and
  Swagatam Das","Kernelized Weighted SUSAN based Fuzzy C-Means Clustering for Noisy Image
  Segmentation",Journal Version,,,,cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper proposes a novel Kernelized image segmentation scheme for noisy
images that utilizes the concept of Smallest Univalue Segment Assimilating
Nucleus (SUSAN) and incorporates spatial constraints by computing circular
colour map induced weights. Fuzzy damping coefficients are obtained for each
nucleus or center pixel on the basis of the corresponding weighted SUSAN area
values, the weights being equal to the inverse of the number of horizontal and
vertical moves required to reach a neighborhood pixel from the center pixel.
These weights are used to vary the contributions of the different nuclei in the
Kernel based framework. The paper also presents an edge quality metric obtained
by fuzzy decision based edge candidate selection and final computation of the
blurriness of the edges after their selection. The inability of existing
algorithms to preserve edge information and structural details in their
segmented maps necessitates the computation of the edge quality factor (EQF)
for all the competing algorithms. Qualitative and quantitative analysis have
been rendered with respect to state-of-the-art algorithms and for images ridden
with varying types of noises. Speckle noise ridden SAR images and Rician noise
ridden Magnetic Resonance Images have also been considered for evaluating the
effectiveness of the proposed algorithm in extracting important segmentation
information.
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2016 21:09:52 GMT'}]",2016-03-30,"[['Mukherjee', 'Satrajit', ''], ['Majumder', 'Bodhisattwa Prasad', ''], ['Piplai', 'Aritran', ''], ['Das', 'Swagatam', '']]","['SUSAN', 'Circular color map', 'Edge Quality Factor', 'kernel', 'SAR', 'MRI', 'segmentation accuracy']"
17606,1605.01505,Mathilde Noual,Mathilde Noual,"A combinatorial problem about binary necklaces and attractors of Boolean
  automata networks",,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is known that there are no more Lyndon words of length n than there are
periodic necklaces of same length. This paper considers a similar problem
where, additionally, the necklaces must be without some forbidden factors. This
problem relates to a different context, concerned with the behaviours of
particular discrete dynamical systems, namely, Boolean automata networks. A
formal argument supporting the following idea is provided: addition of cycle
intersections in network structures causes exponential reduction of the
networks' number of attractors.
","[{'version': 'v1', 'created': 'Thu, 5 May 2016 06:53:22 GMT'}]",2016-05-06,"[['Noual', 'Mathilde', '']]","['Interaction networks', 'attractors', 'cycle interactions', 'combinatoricson words']"
17607,1004.2132,Mamta Juneja,"Mamta Juneja, Parvinder singh Sandhu",Improved information security using robust Steganography system,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Steganography is an emerging area which is used for secured data transmission
over any public media.Steganography is a process that involves hiding a message
in an appropriate carrier like image or audio. It is of Greek origin and means
""covered or hidden writing"". The carrier can be sent to a receiver without any
one except the authenticated receiver knowing the existence of this
information. In this paper, a specific image based steganography technique for
communicating information more securely between two locations is proposed. The
author incorporated the idea of secret key and password security features for
authentication at both ends in order to achieve high level of security. As a
further improvement of security level, the information has been permuted,
encoded and then finally embedded on an image to form the stego image. In
addition segmented objects extraction and reassembly of the stego image through
normalized cut method has been carried out at the sender side and receiver side
respectively in order to prevent distortion of the Stego image during
transmission.
","[{'version': 'v1', 'created': 'Tue, 13 Apr 2010 09:35:43 GMT'}]",2010-05-27,"[['Juneja', 'Mamta', ''], ['Sandhu', 'Parvinder singh', '']]","['Steganography', 'Cover Image', 'Stego Image', 'Normalized Cut']"
17608,1301.6687,James Cussens,James Cussens,Loglinear models for first-order probabilistic reasoning,"Appears in Proceedings of the Fifteenth Conference on Uncertainty in
  Artificial Intelligence (UAI1999)",,,UAI-P-1999-PG-126-133,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent work on loglinear models in probabilistic constraint logic programming
is applied to first-order probabilistic reasoning. Probabilities are defined
directly on the proofs of atomic formulae, and by marginalisation on the atomic
formulae themselves. We use Stochastic Logic Programs (SLPs) composed of
labelled and unlabelled definite clauses to define the proof probabilities. We
have a conservative extension of first-order reasoning, so that, for example,
there is a one-one mapping between logical and random variables. We show how,
in this framework, Inductive Logic Programming (ILP) can be used to induce the
features of a loglinear model from data. We also compare the presented
framework with other approaches to first-order probabilistic reasoning.
","[{'version': 'v1', 'created': 'Wed, 23 Jan 2013 15:57:26 GMT'}]",2013-01-30,"[['Cussens', 'James', '']]","['loglinear models', 'constraint logic program\xadming', 'inductive logic programming']"
17609,0706.4298,Christian Boulinier,Christian Boulinier (LaRIA),"Unison as a Self-Stabilizing Wave Stream Algorithm in Asynchronous
  Anonymous Networks",,Rapport de recherche. (28/06/2007),,,cs.DC,,"  How to pass from local to global scales in anonymous networks? How to
organize a selfstabilizing propagation of information with feedback. From the
Angluin impossibility results, we cannot elect a leader in a general anonymous
network. Thus, it is impossible to build a rooted spanning tree. Many problems
can only be solved by probabilistic methods. In this paper we show how to use
Unison to design a self-stabilizing barrier synchronization in an anonymous
network. We show that the commuication structure of this barrier
synchronization designs a self-stabilizing wave-stream, or pipelining wave, in
anonymous networks. We introduce two variants of Wave: the strong waves and the
wavelets. A strong wave can be used to solve the idempotent r-operator
parametrized computation problem. A wavelet deals with k-distance computation.
We show how to use Unison to design a self-stabilizing wave stream, a
self-stabilizing strong wave stream and a self-stabilizing wavelet stream.
","[{'version': 'v1', 'created': 'Thu, 28 Jun 2007 18:51:36 GMT'}]",2007-06-29,"[['Boulinier', 'Christian', '', 'LaRIA']]","['Anonymous Network', 'Barrier Synchronization', 'Self-Stabilization', 'Unison', 'Wave']"
17610,1305.7111,Jose Hernandez-Orallo,"Celestine Periale Maguedong-Djoumessi, Jos\'e Hern\'andez-Orallo",Test cost and misclassification cost trade-off using reframing,"Keywords: test cost, misclassification cost, missing values,
  reframing, ROC analysis, operating context, feature configuration, feature
  selection",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many solutions to cost-sensitive classification (and regression) rely on some
or all of the following assumptions: we have complete knowledge about the cost
context at training time, we can easily re-train whenever the cost context
changes, and we have technique-specific methods (such as cost-sensitive
decision trees) that can take advantage of that information. In this paper we
address the problem of selecting models and minimising joint cost (integrating
both misclassification cost and test costs) without any of the above
assumptions. We introduce methods and plots (such as the so-called JROC plots)
that can work with any off-the-shelf predictive technique, including ensembles,
such that we reframe the model to use the appropriate subset of attributes (the
feature configuration) during deployment time. In other words, models are
trained with the available attributes (once and for all) and then deployed by
setting missing values on the attributes that are deemed ineffective for
reducing the joint cost. As the number of feature configuration combinations
grows exponentially with the number of features we introduce quadratic methods
that are able to approximate the optimal configuration and model choices, as
shown by the experimental results.
","[{'version': 'v1', 'created': 'Thu, 30 May 2013 13:52:32 GMT'}]",2013-05-31,"[['Maguedong-Djoumessi', 'Celestine Periale', ''], ['Hernández-Orallo', 'José', '']]","['test cost', 'misclassification cost', 'missing values', 'reframing', 'ROC analysis', 'operating context', 'featureconfiguration', 'feature selection']"
17611,1401.5465,Wanling Gao,"Zijian Ming, Chunjie Luo, Wanling Gao, Rui Han, Qiang Yang, Lei Wang,
  and Jianfeng Zhan",BDGS: A Scalable Big Data Generator Suite in Big Data Benchmarking,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data generation is a key issue in big data benchmarking that aims to generate
application-specific data sets to meet the 4V requirements of big data.
Specifically, big data generators need to generate scalable data (Volume) of
different types (Variety) under controllable generation rates (Velocity) while
keeping the important characteristics of raw data (Veracity). This gives rise
to various new challenges about how we design generators efficiently and
successfully. To date, most existing techniques can only generate limited types
of data and support specific big data systems such as Hadoop. Hence we develop
a tool, called Big Data Generator Suite (BDGS), to efficiently generate
scalable big data while employing data models derived from real data to
preserve data veracity. The effectiveness of BDGS is demonstrated by developing
six data generators covering three representative data types (structured,
semi-structured and unstructured) and three data sources (text, graph, and
table data).
","[{'version': 'v1', 'created': 'Wed, 22 Jan 2014 02:17:52 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Feb 2014 08:13:48 GMT'}, {'version': 'v3', 'created': 'Thu, 27 Feb 2014 03:40:26 GMT'}]",2014-02-28,"[['Ming', 'Zijian', ''], ['Luo', 'Chunjie', ''], ['Gao', 'Wanling', ''], ['Han', 'Rui', ''], ['Yang', 'Qiang', ''], ['Wang', 'Lei', ''], ['Zhan', 'Jianfeng', '']]","['Big Data', 'Benchmark', 'Data Generator', 'Scalable', 'Veracity']"
17612,1410.1625,Elango  B,"Bakthavachalam Elango, Periyaswamy Rajendran and Lutz Bornmann","A macro level scientometric analysis of world tribology research output
  (1998 - 2012)",Submitted to the Malaysian Journal of Library and Information Science,,,,cs.DL,http://creativecommons.org/licenses/by/3.0/,"  Bibliographic records related to tribology research were extracted from
SCOPUS and Web of Science databases for the period of 15 years from 1998 to
2012. Macro-level scientometric indicators such as growth rate, share of
international collaborative papers, citations per paper, and share of non-cited
papers were employed. Further, the Gini coefficient and Simpson Index of
Diversity were used. Two new relative indicators : Relative International
Collaboration Rate (RICR) and Relative Growth Index (RGI) are proposed in this
study. The performance of top countries contributing more than 1000 papers
across the study period was discussed. Contributions and share of continents
and countries by income groups were examined. Further research contributions
and citation impact of selected country groups such as the Developing Eight
Countries (D8), the Association of Southeast Asian Nations (ASEAN), the Union
of South American Nations (UNASUR) and the Emerging and Growth-Leading
Economies (EAGLEs) countries were analyzed. High levels of interdisciplinarity
exist in tribology research. Inequality of distribution between countries is
highest for number of publications and citations. Asia outperforms the other
world regions and China contributes most of the papers (25%), while the United
States receives most of the citations (22%). 84% of total output was
contributed by the Asiatic region, Western Europe and North America together.
Publications from these three world regions received 88% of total citations.
Around 50% of global research output was contributed by China, the United
States and Japan.
","[{'version': 'v1', 'created': 'Tue, 7 Oct 2014 06:48:14 GMT'}]",2014-10-08,"[['Elango', 'Bakthavachalam', ''], ['Rajendran', 'Periyaswamy', ''], ['Bornmann', 'Lutz', '']]","['Scientometrics', 'Bibliometrics', 'Tribology', 'SCOPUS', 'Web of Science', 'Macro Level Study', 'Interdisciplinarity']"
17613,1003.0662,Carla Selmi,"Mustapha Arfi (LITIS), Bedine Ould M. Lemine (LITIS), Carla Selmi
  (LITIS)",Strategical languages of infinite words,,Information Processing Letters 109 (2009) 749-753,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We deal in this paper with strategical languages of infinite words, that is
those generated by a nondeterministic strategy in the sense of game theory. We
first show the existence of a minimal strategy for such languages, for which we
give an explicit expression. Then we characterize the family of strategical
languages as that of closed ones, in the topological space of infinite words.
Finally, we give a definition of a Nash equilibrium for such languages, that we
illustrate with a famous example.
","[{'version': 'v1', 'created': 'Tue, 2 Mar 2010 19:47:21 GMT'}]",2010-03-03,"[['Arfi', 'Mustapha', '', 'LITIS'], ['Lemine', 'Bedine Ould M.', '', 'LITIS'], ['Selmi', 'Carla', '', 'LITIS']]","['Words', 'infinite words', 'formal languages', 'game theory', 'strategy', 'topology', 'Nashequilibrium']"
17614,1303.6885,Hui Kong,"Hui Kong, Fei He, Xiaoyu Song, William N. N. Hung and Ming Gu","Exponential-Condition-Based Barrier Certificate Generation for Safety
  Verification of Hybrid Systems","18 pages, 7 figures",,,,cs.SE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A barrier certificate is an inductive invariant function which can be used
for the safety verification of a hybrid system. Safety verification based on
barrier certificate has the benefit of avoiding explicit computation of the
exact reachable set which is usually intractable for nonlinear hybrid systems.
In this paper, we propose a new barrier certificate condition, called
Exponential Condition, for the safety verification of semi-algebraic hybrid
systems. The most important benefit of Exponential Condition is that it has a
lower conservativeness than the existing convex condition and meanwhile it
possesses the property of convexity. On the one hand, a less conservative
barrier certificate forms a tighter over-approximation for the reachable set
and hence is able to verify critical safety properties. On the other hand, the
property of convexity guarantees its solvability by semidefinite programming
method. Some examples are presented to illustrate the effectiveness and
practicality of our method.
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2013 16:28:35 GMT'}]",2013-03-28,"[['Kong', 'Hui', ''], ['He', 'Fei', ''], ['Song', 'Xiaoyu', ''], ['Hung', 'William N. N.', ''], ['Gu', 'Ming', '']]","['inductive invariant', 'barrier certificate', 'safety verification', 'hybrid system', 'nonlinear system', 'sum of squares']"
17615,1410.2442,Steven Schockaert,Steven Schockaert and Sanjiang Li,Realizing RCC8 networks using convex regions,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  RCC8 is a popular fragment of the region connection calculus, in which
qualitative spatial relations between regions, such as adjacency, overlap and
parthood, can be expressed. While RCC8 is essentially dimensionless, most
current applications are confined to reasoning about two-dimensional or
three-dimensional physical space. In this paper, however, we are mainly
interested in conceptual spaces, which typically are high-dimensional Euclidean
spaces in which the meaning of natural language concepts can be represented
using convex regions. The aim of this paper is to analyze how the restriction
to convex regions constrains the realizability of networks of RCC8 relations.
First, we identify all ways in which the set of RCC8 base relations can be
restricted to guarantee that consistent networks can be convexly realized in
respectively 1D, 2D, 3D, and 4D. Most surprisingly, we find that if the
relation 'partially overlaps' is disallowed, all consistent atomic RCC8
networks can be convexly realized in 4D. If instead refinements of the relation
'part of' are disallowed, all consistent atomic RCC8 relations can be convexly
realized in 3D. We furthermore show, among others, that any consistent RCC8
network with 2n+1 variables can be realized using convex regions in the
n-dimensional Euclidean space.
","[{'version': 'v1', 'created': 'Thu, 9 Oct 2014 12:54:08 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Oct 2014 10:14:17 GMT'}]",2014-10-20,"[['Schockaert', 'Steven', ''], ['Li', 'Sanjiang', '']]","['Qualitative spatial reasoning', 'Region connection calculus', 'Convexity', 'Conceptual spaces']"
17616,1401.3090,Bin Guo,"Bin Guo, Zhiwen Yu, Daqing Zhang, Xingshe Zhou",From Participatory Sensing to Mobile Crowd Sensing,,,,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The research on the efforts of combining human and machine intelligence has a
long history. With the development of mobile sensing and mobile Internet
techniques, a new sensing paradigm called Mobile Crowd Sensing (MCS), which
leverages the power of citizens for large-scale sensing has become popular in
recent years. As an evolution of participatory sensing, MCS has two unique
features: (1) it involves both implicit and explicit participation; (2) MCS
collects data from two user-participant data sources: mobile social networks
and mobile sensing. This paper presents the literary history of MCS and its
unique issues. A reference framework for MCS systems is also proposed. We
further clarify the potential fusion of human and machine intelligence in MCS.
Finally, we discuss the future research trends as well as our efforts to MCS.
","[{'version': 'v1', 'created': 'Tue, 14 Jan 2014 07:32:50 GMT'}]",2014-01-15,"[['Guo', 'Bin', ''], ['Yu', 'Zhiwen', ''], ['Zhang', 'Daqing', ''], ['Zhou', 'Xingshe', '']]","['Hybrid human-machine intelligence', 'mobile crowd sensing', 'participatory sensing', 'heterogeneous/cross-space data']"
17617,1208.2128,V.p.gladis Pushparathi,V. P. Gladis Pushpa Rathi and S. Palani,"Brain tumor MRI image classification with feature selection and
  extraction using linear discriminant analysis",,,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feature extraction is a method of capturing visual content of an image. The
feature extraction is the process to represent raw image in its reduced form to
facilitate decision making such as pattern classification. We have tried to
address the problem of classification MRI brain images by creating a robust and
more accurate classifier which can act as an expert assistant to medical
practitioners. The objective of this paper is to present a novel method of
feature selection and extraction. This approach combines the Intensity,
Texture, shape based features and classifies the tumor as white matter, Gray
matter, CSF, abnormal and normal area. The experiment is performed on 140 tumor
contained brain MR images from the Internet Brain Segmentation Repository. The
proposed technique has been carried out over a larger database as compare to
any previous work and is more robust and effective. PCA and Linear Discriminant
Analysis (LDA) were applied on the training sets. The Support Vector Machine
(SVM) classifier served as a comparison of nonlinear techniques Vs linear ones.
PCA and LDA methods are used to reduce the number of features used. The feature
selection using the proposed technique is more beneficial as it analyses the
data according to grouping class variable and gives reduced feature set with
high classification accuracy.
","[{'version': 'v1', 'created': 'Fri, 10 Aug 2012 09:33:37 GMT'}]",2012-08-13,"[['Rathi', 'V. P. Gladis Pushpa', ''], ['Palani', 'S.', '']]","['Linear Discriminant Analysis', 'BrainTumor', 'Shape', 'Intensity', 'Texture', 'PCA', 'SVM', 'MRI']"
17618,0909.2157,Maurice Margenstern,Maurice Margenstern,Navigation in tilings of the hyperbolic plane and possible applications,"7 pages, 10 figures",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a method of navigation in a large family of tilings of
the hyperbolic plane and looks at the question of possible applications in the
light of the few ones which were already obtained.
","[{'version': 'v1', 'created': 'Fri, 11 Sep 2009 12:39:22 GMT'}]",2009-09-14,"[['Margenstern', 'Maurice', '']]","['hyperbolic tilings', 'cellular automata', 'applications']"
17619,1710.04211,Biswa Sengupta,"Alessandro Bay, Biswa Sengupta",StackSeq2Seq: Dual Encoder Seq2Seq Recurrent Networks,,,,,cs.LG cs.DM cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A widely studied non-deterministic polynomial time (NP) hard problem lies in
finding a route between the two nodes of a graph. Often meta-heuristics
algorithms such as $A^{*}$ are employed on graphs with a large number of nodes.
Here, we propose a deep recurrent neural network architecture based on the
Sequence-2-Sequence (Seq2Seq) model, widely used, for instance in text
translation. Particularly, we illustrate that utilising a context vector that
has been learned from two different recurrent networks enables increased
accuracies in learning the shortest route of a graph. Additionally, we show
that one can boost the performance of the Seq2Seq network by smoothing the loss
function using a homotopy continuation of the decoder's loss function.
","[{'version': 'v1', 'created': 'Wed, 11 Oct 2017 11:22:26 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Jan 2018 21:47:46 GMT'}]",2018-01-18,"[['Bay', 'Alessandro', ''], ['Sengupta', 'Biswa', '']]","['Recurrent neural networks', 'Sequence-to-sequence models', 'Shortestpaths on graphs', 'A∗ meta-heuristic', 'Homotopy continuation']"
17620,1206.5587,Shafqat Shad Mr,"Shafqat Ali Shad, Enhong Chen",Spatial Outlier Detection from GSM Mobility Data,,"International Journal of Advanced Research in Computer Science,
  vol. 3, no. 3, pp. 68-74, 2012",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper has been withdrawn by the authors. With the rigorous growth of
cellular network many mobility datasets are available publically, which
attracted researchers to study human mobility fall under spatio-temporal
phenomenon. Mobility profile building is main task in spatio-temporal trend
analysis which can be extracted from the location information available in the
dataset. The location information is usually gathered through the GPS, service
provider assisted faux GPS and Cell Global Identity (CGI). Because of high
power consumption and extra resource installation requirement in GPS related
methods, Cell Global Identity is most inexpensive method and readily available
solution for location information. CGI location information is four set head
i.e. Mobile country code (MCC), Mobile network code (MNC), Location area code
(LAC) and Cell ID, location information is retrieved in form of longitude and
latitude coordinates through any of publically available Cell Id databases e.g.
Google location API using CGI. However due to of fast growth in GSM network,
change in topology by the GSM service provider and technology shift toward 3G
exact spatial extraction is somehow a problem in it, so location extraction
must dealt with spatial outlier's problem first for mobility building. In this
paper we proposed a methodology for the detection of spatial outliers from GSM
CGI data, the proposed methodology is hierarchical clustering based and used
the basic GSM network architecture properties.
","[{'version': 'v1', 'created': 'Mon, 25 Jun 2012 06:47:46 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Aug 2012 18:33:59 GMT'}, {'version': 'v3', 'created': 'Fri, 21 Sep 2012 02:21:33 GMT'}]",2012-09-24,"[['Shad', 'Shafqat Ali', ''], ['Chen', 'Enhong', '']]","['Mobility data mining', 'Spatial outlier detection', 'Spatial information retrieval', 'Spatial clustering']"
17621,1307.3325,Marcel Heusinger,J. Marcel Heusinger,"Challenges of Critical and Emancipatory Design Science Research: The
  Design of 'Possible Worlds' as Response","Presented at the 15th International Conference on Enterprise
  Information Systems, 4-7 July, 2013 Angers FR. Website:
  http://www.iceis.org/?y=2013",,,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Popper's (1967) 'piecemeal social change' is an approach manifesting itself
in science as critical and emancipatory (C&E) research. It is concerned with
incrementally removing manifested inequalities to achieve a 'better' world.
Although design science research in information systems seems to be a prime
candidate for such endeavors, respective projects are clearly underrepresented.
This position paper argues that this is due to the demand of justifying
research ex post by an evaluation in practical settings. From the perspective
of C&E research it is questionable if powerful actors grant access to their
organization and support projects which ultimately challenge their position. It
is suggested that theory development based on a synthesis of justificatory
knowledge is a complementary approach that allows designing realizable
responses to C&E issues---the design of 'possible worlds' (Lewis, 1986) as
basis for C&E design science research.
","[{'version': 'v1', 'created': 'Fri, 12 Jul 2013 05:00:37 GMT'}]",2013-07-15,"[['Heusinger', 'J. Marcel', '']]","['Critical and Emancipatory Research', 'Design Science', 'Possible Worlds', 'Design Theory']"
17622,1312.5469,Anjali Pp,"PP Anjali, A Binu",Network Traffic Analysis:Hadoop Pig vs Typical MapReduce,"7 pages, 5 figures, Conference - ITCSE 2013",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Big data analysis has become much popular in the present day scenario and the
manipulation of big data has gained the keen attention of researchers in the
field of data analytics. Analysis of big data is currently considered as an
integral part of many computational and statistical departments. As a result,
novel approaches in data analysis are evolving on a daily basis. Thousands of
transaction requests are handled and processed everyday by different websites
associated with e-commerce, e-banking, e-shopping carts etc. The network
traffic and weblog analysis comes to play a crucial role in such situations
where Hadoop can be suggested as an efficient solution for processing the
Netflow data collected from switches as well as website access-logs during
fixed intervals.
","[{'version': 'v1', 'created': 'Thu, 19 Dec 2013 10:32:54 GMT'}]",2013-12-20,"[['Anjali', 'PP', ''], ['Binu', 'A', '']]","['Big Data', 'MapReduce', 'Hadoop', 'Pig', 'netflow', 'network traffic']"
17623,1206.3881,Alessandro Rozza,"Claudio Ceruti and Simone Bassis and Alessandro Rozza and Gabriele
  Lombardi and Elena Casiraghi and Paola Campadelli",DANCo: Dimensionality from Angle and Norm Concentration,,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last decades the estimation of the intrinsic dimensionality of a
dataset has gained considerable importance. Despite the great deal of research
work devoted to this task, most of the proposed solutions prove to be
unreliable when the intrinsic dimensionality of the input dataset is high and
the manifold where the points lie is nonlinearly embedded in a higher
dimensional space. In this paper we propose a novel robust intrinsic
dimensionality estimator that exploits the twofold complementary information
conveyed both by the normalized nearest neighbor distances and by the angles
computed on couples of neighboring points, providing also closed-forms for the
Kullback-Leibler divergences of the respective distributions. Experiments
performed on both synthetic and real datasets highlight the robustness and the
effectiveness of the proposed algorithm when compared to state of the art
methodologies.
","[{'version': 'v1', 'created': 'Mon, 18 Jun 2012 10:33:29 GMT'}]",2012-06-19,"[['Ceruti', 'Claudio', ''], ['Bassis', 'Simone', ''], ['Rozza', 'Alessandro', ''], ['Lombardi', 'Gabriele', ''], ['Casiraghi', 'Elena', ''], ['Campadelli', 'Paola', '']]","['Intrinsic dimensionality estimation', 'manifold learning', 'vonMises distribution', 'Kullback-Leibler divergence']"
17624,1702.05854,Hung Nguyen,"Hung T. Nguyen, Alberto Cano, Tam Vu, Thang N. Dinh","Blocking Self-avoiding Walks Stops Cyber-epidemics: A Scalable GPU-based
  Approach",,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cyber-epidemics, the widespread of fake news or propaganda through social
media, can cause devastating economic and political consequences. A common
countermeasure against cyber-epidemics is to disable a small subset of
suspected social connections or accounts to effectively contain the epidemics.
An example is the recent shutdown of 125,000 ISIS-related Twitter accounts.
Despite many proposed methods to identify such subset, none are scalable enough
to provide high-quality solutions in nowadays billion-size networks.
  To this end, we investigate the Spread Interdiction problems that seek most
effective links (or nodes) for removal under the well-known Linear Threshold
model. We propose novel CPU-GPU methods that scale to networks with billions of
edges, yet, possess rigorous theoretical guarantee on the solution quality. At
the core of our methods is an $O(1)$-space out-of-core algorithm to generate a
new type of random walks, called Hitting Self-avoiding Walks (HSAWs). Such a
low memory requirement enables handling of big networks and, more importantly,
hiding latency via scheduling of millions of threads on GPUs. Comprehensive
experiments on real-world networks show that our algorithms provides much
higher quality solutions and are several order of magnitude faster than the
state-of-the art. Comparing to the (single-core) CPU counterpart, our GPU
implementations achieve significant speedup factors up to 177x on a single GPU
and 338x on a GPU pair.
","[{'version': 'v1', 'created': 'Mon, 20 Feb 2017 04:28:46 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Feb 2017 08:22:53 GMT'}]",2017-02-22,"[['Nguyen', 'Hung T.', ''], ['Cano', 'Alberto', ''], ['Vu', 'Tam', ''], ['Dinh', 'Thang N.', '']]","['Spread Interdiction', 'Approximation Algorithm', 'GPUs']"
17625,1501.00154,Zhengli Xing,"Zhengli Xing, Jie Zhou, Jiangfeng Ye, Jun Yan, Lin Zou, Qun Wan","Automatic Modulation Recognition of PSK Signals Using Nonuniform
  Compressive Samples Based on High Order Statistics","4 pages, 6 figures, submitted to the International Conference on
  Communications Problem -Solving (ICCP) 2014",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Phase modulation is a commonly used modulation mode in digital communication,
which usually brings phase sparsity to digital signals. It is naturally to
connect the sparsity with the newly emerged theory of compressed sensing (CS),
which enables sub-Nyquist sampling of high-bandwidth to sparse signals. For the
present, applications of CS theory in communication field mainly focus on
spectrum sensing, sparse channel estimation etc. Few of current researches take
the phase sparse character into consideration. In this paper, we establish the
novel model of phase modulation signals based on phase sparsity, and introduce
CS theory to the phase domain. According to CS theory, rather than the
bandwidth, the sampling rate required here is scaling with the symbol rate,
which is usually much lower than the Nyquist rate. In this paper, we provide
analytical support for the model, and simulations verify its validity.
","[{'version': 'v1', 'created': 'Wed, 31 Dec 2014 15:35:55 GMT'}]",2015-01-05,"[['Xing', 'Zhengli', ''], ['Zhou', 'Jie', ''], ['Ye', 'Jiangfeng', ''], ['Yan', 'Jun', ''], ['Zou', 'Lin', ''], ['Wan', 'Qun', '']]","['compressed sensing', 'modulation classification', 'Nth power nonlinear transformation', 'PSK signals']"
17626,1712.04982,Kevin Sullivan,"Chong Tang, Kevin Sullivan, Jian Xiang, Trent Weiss, Baishakhi Ray",Interpreted Formalisms for Configurations,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Imprecise and incomplete specification of system \textit{configurations}
threatens safety, security, functionality, and other critical system properties
and uselessly enlarges the configuration spaces to be searched by configuration
engineers and auto-tuners. To address these problems, this paper introduces
\textit{interpreted formalisms based on real-world types for configurations}.
Configuration values are lifted to values of real-world types, which we
formalize as \textit{subset types} in Coq. Values of these types are dependent
pairs whose components are values of underlying Coq types and proofs of
additional properties about them. Real-world types both extend and further
constrain \textit{machine-level} configurations, enabling richer, proof-based
checking of their consistency with real-world constraints. Tactic-based proof
scripts are written once to automate the construction of proofs, if proofs
exist, for configuration fields and whole configurations. \textit{Failures to
prove} reveal real-world type errors. Evaluation is based on a case study of
combinatorial optimization of Hadoop performance by meta-heuristic search over
Hadoop configurations spaces.
","[{'version': 'v1', 'created': 'Wed, 13 Dec 2017 19:57:07 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Dec 2017 17:08:19 GMT'}]",2017-12-18,"[['Tang', 'Chong', ''], ['Sullivan', 'Kevin', ''], ['Xiang', 'Jian', ''], ['Weiss', 'Trent', ''], ['Ray', 'Baishakhi', '']]","['real-world types', 'interpreted formalism', 'formal methods', 'configuration', 'Coq']"
17627,1504.07758,Jeremy Debattista,"Jeremy Debattista, Christoph Lange, S\""oren Auer","Luzzu Quality Metric Language -- A DSL for Linked Data Quality
  Assessment",arXiv admin note: text overlap with arXiv:1412.3750,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The steadily growing number of linked open datasets brought about a number of
reservations amongst data consumers with regard to the datasets' quality.
Quality assessment requires significant effort and consideration, including the
definition of data quality metrics and a process to assess datasets based on
these definitions. Luzzu is a quality assessment framework for linked data that
allows domain-specific metrics to be plugged in. LQML offers notations,
abstractions and expressive power, focusing on the representation of quality
metrics. It provides expressive power for defining sophisticated quality
metrics. Its integration with Luzzu enables their efficient processing and
execution and thus the comprehensive assessment of extremely large datasets in
a streaming way. We also describe a novel ontology that enables the reuse,
sharing and querying of such definitions. Finally, we evaluate the proposed DSL
against the cognitive dimensions of notation framework.
","[{'version': 'v1', 'created': 'Wed, 29 Apr 2015 08:17:20 GMT'}]",2015-04-30,"[['Debattista', 'Jeremy', ''], ['Lange', 'Christoph', ''], ['Auer', 'Sören', '']]","['data quality', 'quality metrics', 'linked data', 'domain specific language']"
17628,1403.6413,Zeyuan Allen-Zhu,"Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu",Knightian Analysis of the Vickrey Mechanism,To appear in Econometrica,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze the Vickrey mechanism for auctions of multiple identical goods
when the players have both Knightian uncertainty over their own valuations and
incomplete preferences. In this model, the Vickrey mechanism is no longer
dominant-strategy, and we prove that all dominant-strategy mechanisms are
inadequate. However, we also prove that, in undominated strategies, the social
welfare produced by the Vickrey mechanism in the worst case is not only very
good, but also essentially optimal.
","[{'version': 'v1', 'created': 'Tue, 25 Mar 2014 16:32:19 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Apr 2014 18:47:00 GMT'}, {'version': 'v3', 'created': 'Fri, 24 Apr 2015 17:28:18 GMT'}]",2015-04-27,"[['Chiesa', 'Alessandro', ''], ['Micali', 'Silvio', ''], ['Zhu', 'Zeyuan Allen', '']]","['Knightian uncertainty', 'implementation in undominated strategies', 'incomplete preferences']"
17629,1504.06719,Anurag Mittal,"Smit Marvaniya, Raj Gupta and Anurag Mittal",Adaptive Locally Affine-Invariant Shape Matching,submitted to Image and Vision Computing,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Matching deformable objects using their shapes is an important problem in
computer vision since shape is perhaps the most distinguishable characteristic
of an object. The problem is difficult due to many factors such as intra-class
variations, local deformations, articulations, viewpoint changes and missed and
extraneous contour portions due to errors in shape extraction. While small
local deformations has been handled in the literature by allowing some leeway
in the matching of individual contour points via methods such as Chamfer
distance and Hausdorff distance, handling more severe deformations and
articulations has been done by applying local geometric corrections such as
similarity or affine. However, determining which portions of the shape should
be used for the geometric corrections is very hard, although some methods have
been tried. In this paper, we address this problem by an efficient search for
the group of contour segments to be clustered together for a geometric
correction using Dynamic Programming by essentially searching for the
segmentations of two shapes that lead to the best matching between them. At the
same time, we allow portions of the contours to remain unmatched to handle
missing and extraneous contour portions. Experiments indicate that our method
outperforms other algorithms, especially when the shapes to be matched are more
complex.
","[{'version': 'v1', 'created': 'Sat, 25 Apr 2015 12:01:30 GMT'}]",2015-04-28,"[['Marvaniya', 'Smit', ''], ['Gupta', 'Raj', ''], ['Mittal', 'Anurag', '']]","['Shape Matching', 'Shape Retrieval', 'Contour Segmentation', 'Occlusion Handling']"
17630,1606.05806,Harsha Nagarajan,"Harsha Nagarajan, Mowen Lu, Emre Yamangil, Russell Bent","Tightening McCormick Relaxations for Nonlinear Programs via Dynamic
  Multivariate Partitioning",,,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we propose a two-stage approach to strengthen piecewise
McCormick relaxations for mixed-integer nonlinear programs (MINLP) with
multi-linear terms. In the first stage, we exploit Constraint Programing (CP)
techniques to contract the variable bounds. In the second stage we partition
the variables domains using a dynamic multivariate partitioning scheme. Instead
of equally partitioning the domains of variables appearing in multi-linear
terms, we construct sparser partitions yet tighter relax- ations by iteratively
partitioning the variable domains in regions of interest. This approach
decouples the number of partitions from the size of the variable domains, leads
to a significant reduction in computation time, and limits the number of binary
variables that are introduced by the partitioning. We demonstrate the
performance of our algorithm on well-known benchmark problems from MINLPLIB and
discuss the computational benefits of CP-based bound tightening procedures.
","[{'version': 'v1', 'created': 'Sat, 18 Jun 2016 20:49:09 GMT'}]",2016-06-21,"[['Nagarajan', 'Harsha', ''], ['Lu', 'Mowen', ''], ['Yamangil', 'Emre', ''], ['Bent', 'Russell', '']]","['McCormick relaxations', 'MINLP', 'dynamic partitioning', 'bound tightening']"
17631,0712.4101,Gerard Briscoe Mr,"P. De Wilde, G. Briscoe",Digital Ecosystems: Stability of Evolving Agent Populations,"8 pages, 6 figures, ACM Management of Emergent Digital EcoSystems
  (MEDES) 2009",,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stability is perhaps one of the most desirable features of any engineered
system, given the importance of being able to predict its response to various
environmental conditions prior to actual deployment. Engineered systems are
becoming ever more complex, approaching the same levels of biological
ecosystems, and so their stability becomes ever more important, but taking on
more and more differential dynamics can make stability an ever more elusive
property. The Chli-DeWilde definition of stability views a Multi-Agent System
as a discrete time Markov chain with potentially unknown transition
probabilities. With a Multi-Agent System being considered stable when its
state, a stochastic process, has converged to an equilibrium distribution,
because stability of a system can be understood intuitively as exhibiting
bounded behaviour. We investigate an extension to include Multi-Agent Systems
with evolutionary dynamics, focusing on the evolving agent populations of our
Digital Ecosystem. We then built upon this to construct an entropy-based
definition for the degree of instability (entropy of the limit probabilities),
which was later used to perform a stability analysis. The Digital Ecosystem is
considered to investigate the stability of an evolving agent population through
simulations, for which the results were consistent with the original
Chli-DeWilde definition.
","[{'version': 'v1', 'created': 'Wed, 26 Dec 2007 04:40:16 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Oct 2008 10:38:12 GMT'}, {'version': 'v3', 'created': 'Thu, 19 Feb 2009 18:33:26 GMT'}, {'version': 'v4', 'created': 'Fri, 20 Feb 2009 02:43:08 GMT'}, {'version': 'v5', 'created': 'Mon, 5 Oct 2009 00:31:13 GMT'}]",2009-10-05,"[['De Wilde', 'P.', ''], ['Briscoe', 'G.', '']]","['Evolution', 'stability', 'agent', 'population', 'entropy', 'equilibrium']"
17632,1002.3769,Benoit Masson,"Lila Kari, Beno\^it Masson",Polyominoes Simulating Arbitrary-Neighborhood Zippers and Tilings,Submitted to Theoretical Computer Science,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper provides a bridge between the classical tiling theory and the
complex neighborhood self-assembling situations that exist in practice. The
neighborhood of a position in the plane is the set of coordinates which are
considered adjacent to it. This includes classical neighborhoods of size four,
as well as arbitrarily complex neighborhoods. A generalized tile system
consists of a set of tiles, a neighborhood, and a relation which dictates which
are the ""admissible"" neighboring tiles of a given tile. Thus, in correctly
formed assemblies, tiles are assigned positions of the plane in accordance to
this relation. We prove that any validly tiled path defined in a given but
arbitrary neighborhood (a zipper) can be simulated by a simple ""ribbon"" of
microtiles. A ribbon is a special kind of polyomino, consisting of a
non-self-crossing sequence of tiles on the plane, in which successive tiles
stick along their adjacent edge. Finally, we extend this construction to the
case of traditional tilings, proving that we can simulate
arbitrary-neighborhood tilings by simple-neighborhood tilings, while preserving
some of their essential properties.
","[{'version': 'v1', 'created': 'Fri, 19 Feb 2010 16:19:53 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Apr 2011 07:34:36 GMT'}]",2011-04-12,"[['Kari', 'Lila', ''], ['Masson', 'Benoît', '']]","['DNA computing', 'self-assembly', 'tilings', 'polyominoes']"
17633,1407.0189,Madhumangal Pal Dr.,Rajkumar Pradhan and Madhumangal Pal,"Convergence of maxgeneralized mean-mingeneralized mean powers of
  intuitionistic fuzzy matrices",20 pages,"The Journal of Fuzzy Mathematics, 22(2) (2014) 477-492",,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intuitionistic fuzzy relations on finite universes can be represent by
intuitionistic fuzzy matrices and the
  limiting behavior of the power matrices depends on the algebraic operation
employed on the matrices. In this
  paper, the power of intuitionistic fuzzy matrices with maxgeneralized
mean-mingeneralized mean operation have
  been studied. Here it is shown that the power of intuitionistic fuzzy
matrices with the said operations are
  always convergent. The convergence of powers for an intuitionistic fuzzy
matrix with convex combination of
  max-min and maxarithmetic mean-minarithmetic mean are also dicussed here.
","[{'version': 'v1', 'created': 'Tue, 1 Jul 2014 11:10:17 GMT'}]",2014-07-02,"[['Pradhan', 'Rajkumar', ''], ['Pal', 'Madhumangal', '']]","['Intuitionistic fuzzy number', 'intuitionistic fuzzy matrix', 'intuitionistic']"
17634,0707.4524,Shiguo Lian,Shiguo Lian,Image Authentication Based on Neural Networks,"16 pages,10 figures, submitted",,,,cs.MM cs.NE,,"  Neural network has been attracting more and more researchers since the past
decades. The properties, such as parameter sensitivity, random similarity,
learning ability, etc., make it suitable for information protection, such as
data encryption, data authentication, intrusion detection, etc. In this paper,
by investigating neural networks' properties, the low-cost authentication
method based on neural networks is proposed and used to authenticate images or
videos. The authentication method can detect whether the images or videos are
modified maliciously. Firstly, this chapter introduces neural networks'
properties, such as parameter sensitivity, random similarity, diffusion
property, confusion property, one-way property, etc. Secondly, the chapter
gives an introduction to neural network based protection methods. Thirdly, an
image or video authentication scheme based on neural networks is presented, and
its performances, including security, robustness and efficiency, are analyzed.
Finally, conclusions are drawn, and some open issues in this field are
presented.
","[{'version': 'v1', 'created': 'Tue, 31 Jul 2007 02:27:10 GMT'}]",2007-08-01,"[['Lian', 'Shiguo', '']]","['neural network', 'security', 'encryption', 'authentication', 'intrusion detection']"
17635,0711.2114,Michel Grabisch,"Michel Grabisch (CES), Christophe Labreuche (TRT)","Bi-capacities -- Part I: definition, M\""obius transform and interaction",,Fuzzy Sets and Systems (2005) 211-236,,,cs.DM cs.GT,,"  Bi-capacities arise as a natural generalization of capacities (or fuzzy
measures) in a context of decision making where underlying scales are bipolar.
They are able to capture a wide variety of decision behaviours, encompassing
models such as Cumulative Prospect Theory (CPT). The aim of this paper in two
parts is to present the machinery behind bi-capacities, and thus remains on a
rather theoretical level, although some parts are firmly rooted in decision
theory, notably cooperative game theory. The present first part is devoted to
the introduction of bi-capacities and the structure on which they are defined.
We define the M\""obius transform of bi-capacities, by just applying the well
known theory of M\"" obius functions as established by Rota to the particular
case of bi-capacities. Then, we introduce derivatives of bi-capacities, by
analogy with what was done for pseudo-Boolean functions (another view of
capacities and set functions), and this is the key point to introduce the
Shapley value and the interaction index for bi-capacities. This is done in a
cooperative game theoretic perspective. In summary, all familiar notions used
for fuzzy measures are available in this more general framework.
","[{'version': 'v1', 'created': 'Wed, 14 Nov 2007 06:15:05 GMT'}]",2007-11-15,"[['Grabisch', 'Michel', '', 'CES'], ['Labreuche', 'Christophe', '', 'TRT']]","['fuzzy measure', 'capacity', 'bi-capacity', 'M¨obius transform', 'bicooperative game', 'Shapley value', 'interaction index']"
17636,1307.3411,Ahmadreza Montazerolghaem,Ahmad Reza Montazerolghaem and Mohammad Hossein Yaghmaee,"Sip Overload Control Testbed: Design, Building and Evaluation","10 pages, 9 figures, 2 table, 37 references",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Having facilities such as being in text form, end-to-end connection
establishment, and being independence from the type of transmitted data, SIP
protocol is a good choice for signaling protocol in order to set up a
connection between two users of an IP network. Although utilization of SIP
protocol in a wide range of applications has made various vulnerabilities in
this protocol, amongst which overload could make serious problems in SIP
servers. A SIP is overloaded when it does not have sufficient resources
(majorly CPU processing power and memory) to process all messages. In this
paper the window-based overload control mechanism which does not require
explicit feedback is developed and implemented on Asterisk open source proxy
and evaluated. The results of implementation show that this method could
practically maintain throughput in case of overload. As we know this is the
only overload control method which is implemented on a real platform without
using explicit feedback. The results show that the under load server maintains
its throughput at the maximum capacity.
","[{'version': 'v1', 'created': 'Fri, 12 Jul 2013 11:07:09 GMT'}]",2013-07-15,"[['Montazerolghaem', 'Ahmad Reza', ''], ['Yaghmaee', 'Mohammad Hossein', '']]","['Overload control', 'Asterisk Proxy', 'SIP']"
17637,1510.01577,Jaroslaw Jankowski,"Przemyslaw Rozewski, Jaroslaw Jankowski","Model of Multilayer Knowledge Diffusion for Competence Development in an
  Organization",,"Mathematical Problems in Engineering, Article ID 529256, 2014",,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Growing role of intellectual capital within organizations is affecting new
strategies related to knowledge management and competence development. Among
different aspects related to this field, knowledge diffusion has become one of
interesting areas from both practitioner and researchers perspective. Several
models were proposed with main goal to simulate diffusion and to explain the
nature of these processes. Existing models are focused on knowledge diffusion
and they assume diffusion within a single layer using knowledge representation.
From the organizational perspective connecting several types of knowledge and
modelling changes of competence can bring additional value. In the article we
extended existing approaches by using multilayer diffusion model and focused on
analysis of competence development process. The proposed model describes
competence development process in a new way through horizontal and vertical
knowledge diffusion in multilayer network. In the network, agents collaborate
and interchange various kind of knowledge through different layers and this
mutual activities affect the competences in a positive or negative way. Taking
under consideration workers cognitive and social abilities and the previous
level of competence the new competence level can be estimated. The model is
developed to support competence management in different organizations.
","[{'version': 'v1', 'created': 'Tue, 6 Oct 2015 13:57:47 GMT'}]",2015-10-07,"[['Rozewski', 'Przemyslaw', ''], ['Jankowski', 'Jaroslaw', '']]","['competence development', 'computational model', 'knowledge diffusion', 'multilayer']"
17638,1606.08297,Pavel Smirnov A.,"Pavel A. Smirnov, Sergey V. Kovalchuk, Alexander V.Boukhanovsky","Computer-assisted workflows composition based on Virtual Simulation
  Objects technology",,,,,cs.SE,http://creativecommons.org/licenses/by/4.0/,"  The existing approaches for scientific workflows composition face the
problems of domain knowledge integration. By this paper we summarize the
results, which have been elaborated and implemented during the 2-year research
concerning to Virtual Simulation Objects (VSO) concept and technology
development. The contribution of this paper consists of formal models of the
VSO internal structures and user-assistance logic, which may be obtained as a
result of the reasoning over knowledge base. (This paper was rejected to appear
in ""Recent Advances in Knowledge Based Technologies and Applications"" by
Hindawi in 2014, but was stolen and published by Ke Han under the name ""The
Study on Workflows Composition Based on Virtual Simulation Objects Technology"")
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2016 14:46:27 GMT'}]",2016-06-28,"[['Smirnov', 'Pavel A.', ''], ['Kovalchuk', 'Sergey V.', ''], ['Boukhanovsky', 'Alexander V.', '']]","['scientific experiment', 'workflow composite application', 'domain knowledge integration']"
17639,1504.08039,Panagiotis Vekris,"Panagiotis Vekris, Benjamin Cosman, Ranjit Jhala","Trust, but Verify: Two-Phase Typing for Dynamic Languages",,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A key challenge when statically typing so-called dynamic languages is the
ubiquity of value-based overloading, where a given function can dynamically
reflect upon and behave according to the types of its arguments. Thus, to
establish basic types, the analysis must reason precisely about values, but in
the presence of higher-order functions and polymorphism, this reasoning itself
can require basic types. In this paper we address this chicken-and-egg problem
by introducing the framework of two-phased typing. The first ""trust"" phase
performs classical, i.e. flow-, path- and value-insensitive type checking to
assign basic types to various program expressions. When the check inevitably
runs into ""errors"" due to value-insensitivity, it wraps problematic expressions
with DEAD-casts, which explicate the trust obligations that must be discharged
by the second phase. The second phase uses refinement typing, a flow- and
path-sensitive analysis, that decorates the first phase's types with logical
predicates to track value relationships and thereby verify the casts and
establish other correctness properties for dynamically typed languages.
","[{'version': 'v1', 'created': 'Wed, 29 Apr 2015 22:31:14 GMT'}]",2015-05-01,"[['Vekris', 'Panagiotis', ''], ['Cosman', 'Benjamin', ''], ['Jhala', 'Ranjit', '']]","['Dynamic Languages', 'Type Systems', 'Refinement Types', 'IntersectionTypes', 'Overloading']"
17640,1312.2225,Amor Lazzez Dr.,Amor Lazzez,VoIP Technology: Security Issues Analysis,9 pages,"International Journal of Emerging Trends & Technology in Computer
  Science (IJETTCS), Volume 2, Issue 4, July-August 2013",,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Voice over IP (VoIP) is the technology allowing voice and multimedia
transmissions as data packets over a private or a public IP network. Thanks to
the benefits that it may provide, the VoIP technology is increasingly
attracting attention and interest in the industry. Actually, VoIP allows
significant benefits for customers and communication services providers such as
cost savings, rich media service, phone and service portability, mobility, and
the integration with other applications. Nevertheless, the deployment of the
VoIP technology encounters many challenges such as architecture complexity,
interoperability issues, QoS issues, and security concerns. Among these
disadvantages, VoIP security issues are becoming more serious because
traditional security devices, protocols, and architectures cannot adequately
protect VoIP systems from recent intelligent attacks. The aim of this paper is
carry out a deep analysis of the security concerns of the VoIP technology.
Firstly, we present a brief overview about the VoIP technology. Then, we
discuss security attacks and vulnerabilities related to VoIP protocols and
devices. After that, we talk about the security profiles of the VoIP protocols,
and we present the main security components designed to help the deployment of
a reliable and secured VoIP systems.
","[{'version': 'v1', 'created': 'Sun, 8 Dec 2013 15:07:24 GMT'}]",2013-12-10,"[['Lazzez', 'Amor', '']]","['VoIP', 'Vulnerabilities', 'Security Attacks', 'Security Mechanisms']"
17641,1705.07558,Mark Levin,Mark Sh. Levin,"Note on Evolution and Forecasting of Requirements: Communications
  Example","8 pages, 8 figures, 9 tables",,,,cs.NI cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Combinatorial evolution and forecasting of system requirements is examined.
The morphological model is used for a hierarchical requirements system (i.e.,
system parts, design alternatives for the system parts, ordinal estimates for
the alternatives). A set of system changes involves changes of the system
structure, component alternatives and their estimates. The composition process
of the forecast is based on combinatorial synthesis (knapsack problem, multiple
choice problem, hierarchical morphological design). An illustrative numerical
example for four-phase evolution and forecasting of requirements to
communications is described.
","[{'version': 'v1', 'created': 'Mon, 22 May 2017 05:22:53 GMT'}]",2017-05-23,"[['Levin', 'Mark Sh.', '']]","['Modular system', 'requirements', 'communications', 'evolution', 'forecasting', 'decision making', 'combinatorial optimization']"
17642,1301.0129,Paul Tarau,Paul Tarau,On Two Infinite Families of Pairing Bijections,UNPUBLISHED DRAFT,,,,cs.MS cs.DM cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe two general mechanisms for producing pairing bijections
(bijective functions defined from N x N to N).
  The first mechanism, using n-adic valuations results in parameterized
algorithms generating a countable family of distinct pairing bijections.
  The second mechanism, using characteristic functions of subsets of N provides
2^N distinct pairing bijections.
  Mechanisms to combine such pairing functions and their application to
generate families of permutations of N are also described.
  The paper uses a small subset of the functional language Haskell to provide
type checked executable specifications of all the functions defined in a
literate programming style. The self-contained Haskell code extracted from the
paper is available at http://logic.cse.unt.edu/tarau/research/2012/infpair.hs .
","[{'version': 'v1', 'created': 'Tue, 1 Jan 2013 20:10:51 GMT'}]",2013-01-03,"[['Tarau', 'Paul', '']]","['pairing / unpairing functions', 'data type isomorphisms', 'infinitedata objects', 'lazy evaluation', 'functional programming']"
17643,1603.00841,Jhony Heriberto Giraldo Zuluaga Engineer,Jhony Giraldo and Augusto Salazar,Automatic segmentation of lizard spots using an active contour model,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Animal biometrics is a challenging task. In the literature, many algorithms
have been used, e.g. penguin chest recognition, elephant ears recognition and
leopard stripes pattern recognition, but to use technology to a large extent in
this area of research, still a lot of work has to be done. One important target
in animal biometrics is to automate the segmentation process, so in this paper
we propose a segmentation algorithm for extracting the spots of Diploglossus
millepunctatus, an endangered lizard species. The automatic segmentation is
achieved with a combination of preprocessing, active contours and morphology.
The parameters of each stage of the segmentation algorithm are found using an
optimization procedure, which is guided by the ground truth. The results show
that automatic segmentation of spots is possible. A 78.37 % of correct
segmentation in average is reached.
","[{'version': 'v1', 'created': 'Wed, 2 Mar 2016 19:42:55 GMT'}]",2016-03-03,"[['Giraldo', 'Jhony', ''], ['Salazar', 'Augusto', '']]","['Diploglossus millepunctatus', 'active contours', 'gamma correction', 'morphological']"
17644,1712.02549,Nicolas Ruiz,Nicolas Ruiz,"A multiplicative masking method for preserving the skewness of the
  original micro-records",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Masking methods for the safe dissemination of microdata consist of distorting
the original data while preserving a pre-defined set of statistical properties
in the microdata. For continuous variables, available methodologies rely
essentially on matrix masking and in particular on adding noise to the original
values, using more or less refined procedures depending on the extent of
information that one seeks to preserve. Almost all of these methods make use of
the critical assumption that the original datasets follow a normal distribution
and/or that the noise has such a distribution. This assumption is, however,
restrictive in the sense that few variables follow empirically a Gaussian
pattern: the distribution of household income, for example, is positively
skewed, and this skewness is essential information that has to be considered
and preserved. This paper addresses these issues by presenting a simple
multiplicative masking method that preserves skewness of the original data
while offering a sufficient level of disclosure risk control. Numerical
examples are provided, leading to the suggestion that this method could be
well-suited for the dissemination of a broad range of microdata, including
those based on administrative and business records.
","[{'version': 'v1', 'created': 'Thu, 7 Dec 2017 09:30:12 GMT'}]",2017-12-08,"[['Ruiz', 'Nicolas', '']]","['disclosure', 'microdata perturbation', 'sufficient statistics', 'skewness', 'log normal distribution']"
17645,1510.02070,Kumar Sankar Ray,"Kingshuk Chatterjee, Kumar Sankar Ray","Non-regular unary language and parallel communicating Watson-Crick
  automata systems",arXiv admin note: text overlap with arXiv:1507.05284,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 2006, Czeizler et.al. introduced parallel communicating Watson-Crick
automata system. They showed that parallel communicating Watson-Crick automata
system can accept the non-regular unary language L={a^(n^2 ),where n>1} using
non-injective complementarity relation and three components. In this paper, we
improve on Czeizler et.al. work by showing that parallel communicating
Watson-Crick automata system can accept the same language L using just two
components.
","[{'version': 'v1', 'created': 'Wed, 7 Oct 2015 19:35:48 GMT'}]",2015-10-08,"[['Chatterjee', 'Kingshuk', ''], ['Ray', 'Kumar Sankar', '']]","['non-deterministic Watson-Crick automata', 'parallel communicating Watson-Crick automata systems', 'multi-head finite automata', 'non-regular unary languages']"
17646,1705.06333,Aliasghar Mortazi,"Aliasghar Mortazi, Rashed Karim, Kawal Rhode, Jeremy Burt, Ulas Bagci","CardiacNET: Segmentation of Left Atrium and Proximal Pulmonary Veins
  from MRI Using Multi-View CNN",The paper is accepted by MICCAI 2017 for publication,,,,cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Anatomical and biophysical modeling of left atrium (LA) and proximal
pulmonary veins (PPVs) is important for clinical management of several cardiac
diseases. Magnetic resonance imaging (MRI) allows qualitative assessment of LA
and PPVs through visualization. However, there is a strong need for an advanced
image segmentation method to be applied to cardiac MRI for quantitative
analysis of LA and PPVs. In this study, we address this unmet clinical need by
exploring a new deep learning-based segmentation strategy for quantification of
LA and PPVs with high accuracy and heightened efficiency. Our approach is based
on a multi-view convolutional neural network (CNN) with an adaptive fusion
strategy and a new loss function that allows fast and more accurate convergence
of the backpropagation based optimization. After training our network from
scratch by using more than 60K 2D MRI images (slices), we have evaluated our
segmentation strategy to the STACOM 2013 cardiac segmentation challenge
benchmark. Qualitative and quantitative evaluations, obtained from the
segmentation challenge, indicate that the proposed method achieved the
state-of-the-art sensitivity (90%), specificity (99%), precision (94%), and
efficiency levels (10 seconds in GPU, and 7.5 minutes in CPU).
","[{'version': 'v1', 'created': 'Wed, 17 May 2017 20:18:32 GMT'}, {'version': 'v2', 'created': 'Fri, 19 May 2017 15:57:13 GMT'}]",2017-05-23,"[['Mortazi', 'Aliasghar', ''], ['Karim', 'Rashed', ''], ['Rhode', 'Kawal', ''], ['Burt', 'Jeremy', ''], ['Bagci', 'Ulas', '']]","['Left Atrium', 'Pulmonary Veins', 'Deep Learning', 'CardiacMagnetic Resonance', 'MRI', 'Image Segmentation', 'CardiacNET']"
17647,1712.05798,Laurent Truffet,Chams Lahlou and Laurent Truffet,"Self-organization and the Maximum Empower Principle in the Framework of
  max-plus Algebra","Emergy, Graph, Max-plus algebra, Sustainability, Fourth law of
  thermodynamics",,,,cs.FL nlin.AO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-organization is a process where order of a whole system arises out of
local interactions between small components of a system.
  Emergy, spelled with an 'm', defined as the amount of (solar) energy used to
make a product or service, is becoming an important ecological indicator. The
Maximum Empower Principle (MEP) was proposed as the fourth law of
thermodynamics by the ecologist Odum in the 90's to explain observed
self-organization of energy driven systems. But this principle suffers a lack
of mathematical formulation due to an insufficiency of details about the
underlying computation of empower (i.e. emergy per time).
  For empower computation in steady-state an axiomatic basis has been developed
recently by Le Corre and the second author of this paper. In this axiomatic
basis emergy is defined as a recursive max-plus linear function.
  Using this axiomatic basis and a correspondance between ecological theory and
dynamic systems theory, we prove the MEP. In particular, we show that the
empower computation in steady-state is equivalent to a combinatorial
optimization problem.
","[{'version': 'v1', 'created': 'Sat, 16 Dec 2017 06:22:28 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Jun 2019 15:13:19 GMT'}]",2019-06-26,"[['Lahlou', 'Chams', ''], ['Truffet', 'Laurent', '']]","['Emergy', 'Graph', 'Max-plus algebra', 'Sustainability', 'Fourth law of thermodynamics']"
17648,1401.2342,Loet Leydesdorff,Loet Leydesdorff and Han Woo Park,"Can Synergy in Triple-Helix Relations be Quantified? A Review of the
  Development of the Triple-Helix Indicator",,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Triple-Helix arrangements of bi- and trilateral relations can be considered
as adaptive eco-systems. During the last decade, we have further developed a
Triple-Helix indicator of synergy as reduction of uncertainty in niches that
can be shaped among three or more distributions. Reduction of uncertainty can
be generated in correlations among distributions of relations, but this
(next-order) effect can be counterbalanced by uncertainty generated in the
relations. We first explain the indicator, and then review possible results
when this indicator is applied to (i) co-author networks of academic,
industrial, and governmental authors and (ii) synergies in the distributions of
firms over geographical addresses, technological classes, and industrial-size
classes for a number of nations. Co-variation is then considered as a measure
of relationship. The balance between globalizing and localizing dynamics can be
quantified. Too much synergy locally can also be considered as lock-in.
Tendencies are different for the globalizing knowledge dynamics versus locally
retaining wealth from knowledge in industrial innovations.
","[{'version': 'v1', 'created': 'Fri, 10 Jan 2014 14:25:53 GMT'}]",2019-08-19,"[['Leydesdorff', 'Loet', ''], ['Park', 'Han Woo', '']]","['indicator', 'probabilistic entropy', 'niche', 'synergy']"
17649,1511.03194,Mamdouh Alenezi,Mamdouh Alenezi and Ibrahim Abunadi,Quality of Open Source Systems from Product Metrics Perspective,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software engineering and information systems practices seek ultimately to
create the flawless product. One of the tools used to improve the quality of
software development is the use of metrics. In this paper, metrics retrieved
from open source software were analyzed for quality attributes. Defect density
is considered a strong indication of the quality of software product. Few
studies have taken into consideration the density of defects while looking into
quality of software and proneness to defects. Analysis of this study has shown
that defect density is relevant to different developers and different product
sizes. Thus, open source project has shown to have low defect density and the
larger the product the lower the defect density is. In addition, this study has
shown that there are different metrics that correlate with each other
indicating that some of these metrics have conceptual and practical relevance
to each other. Another relationship was tested between the number of bugs and
the metrics. Results indicated that most attributes had positive correlation
with the number of bugs with exception to coupling between cohesion among
methods of class.
","[{'version': 'v1', 'created': 'Tue, 10 Nov 2015 17:36:35 GMT'}]",2015-11-11,"[['Alenezi', 'Mamdouh', ''], ['Abunadi', 'Ibrahim', '']]","['Software Quality', 'Software Metrics', 'Open Source', 'Defect Density']"
17650,1704.08778,Ayan Chaudhury,Ayan Chaudhury and John L. Barron,"Partially Occluded Leaf Recognition via Subgraph Matching and Energy
  Optimization",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an approach to match partially occluded plant leaves with
databases of full plant leaves. Although contour based 2D shape matching has
been studied extensively in the last couple of decades, matching occluded
leaves with full leaf databases is an open and little worked on problem.
Classifying occluded plant leaves is even more challenging than full leaf
matching because of large variations and complexity of leaf structures.
Matching an occluded contour with all the full contours in a database is an
NP-hard problem [Su et al. ICCV2015], so our algorithm is necessarily
suboptimal.
","[{'version': 'v1', 'created': 'Fri, 28 Apr 2017 00:15:49 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Jul 2017 20:04:12 GMT'}]",2017-07-05,"[['Chaudhury', 'Ayan', ''], ['Barron', 'John L.', '']]","['Leaf Classification', 'Beta Splines', 'Affine transformations', 'Curvature', 'Shape Context', 'Subgraph Matching', 'Fr´echetDistance', 'Energy Optimization']"
17651,1304.5389,Aziza Sabri,"Sabri Aziza, Kjiri Laila",Patterns to analyze requirements of a Decisional Information System,"paper accepted alson in SEDEXS'2012: International Conference On
  Software Engineering, Databases and EXpert Systems, Settat, Maroc, 14-16 Juin
  2012, International Journal of Computer Application (IJCA), Special Issue On
  Software Engineering Databases and EXpert Systems (SEDEXS), Number 2, ISBN:
  973-93-80870-26-8, 17 Septembre 2012",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The domain of analysis and conception of Decisional Information System (DIS)
is, highly, applying new techniques and methods to succeed the process of the
decision and minimizing the time of conception. Our objective in this paper is
to define a group of patterns to ensure a systematic reuse of our approach to
analyse a DIS s business requirements. We seek, through this work, to guide the
discovery of an organizations business requirements, expressed as goals by
introducing the notion of context, to promote good processes design for a DIS,
to capitalize the process and models proposed in our approach and systematize
reuse steps of this approach to analyze similar projects or adapt them as
needed. The patterns are at the same time the process s patterns and product s
patterns as they capitalize models and their associated processes. These
patterns are represented according to the PSIGMA formalism.
","[{'version': 'v1', 'created': 'Fri, 19 Apr 2013 12:13:00 GMT'}]",2013-04-22,"[['Aziza', 'Sabri', ''], ['Laila', 'Kjiri', '']]","['Decisional Information System (DIS)', 'Engineering Business requirements', 'Business context', 'P-Sigma formalism', 'Product pattern', 'Process pattern']"
17652,1505.01325,Waldemar Koczkodaj Prof.,"Waldemar W. Koczkodaj, Jacek Szybowski","On the Convergence of the Pairwise Comparisons Inconsistency Reduction
  Process","16 page, 1 figure. For pairwise comparisons, the normalized vector o
  geometric means (GM) is equal to the normalized principal eigenvector (EV)
  for consistent matrices. For inconsistent matrices, the limit is ""make it
  consistent"" process is GM (specifically, not EV). This contribution finally
  concludes the discussion ""GM or EV"" originated in 1980s",,,2015-05-05,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study investigates a powerful model, targeted to subjective assessments,
based on pairwise comparisons. It provides a proof that a distance-based
inconsistency reduction transforms an inconsistent pairwise comparisons (PC)
matrix into a consistent PC matrix which is generated by the geometric means of
rows of a given inconsistent PC matrix. The distance-based inconsistency
indicator was defined in 1993 for pairwise comparisons. Its convergence was
analyzed in 1996 (regretfully, with an incomplete proof; finally completed in
2010). However, there was no clear interpretation of the convergence limit
which is of considerable importance for applications and this study does so.
","[{'version': 'v1', 'created': 'Wed, 6 May 2015 11:43:37 GMT'}, {'version': 'v2', 'created': 'Thu, 7 May 2015 16:41:52 GMT'}]",2015-05-08,"[['Koczkodaj', 'Waldemar W.', ''], ['Szybowski', 'Jacek', '']]","['pairwise comparisons', 'inconsistency reduction', 'convergencelimit', 'decision making', 'assessment', 'software development']"
17653,1705.08094,Guangdong Bai,"Zhengkui Wang, Guangdong Bai, Soumyadeb Chowdhury, Quanqing Xu, Zhi
  Lin Seow",TwiInsight: Discovering Topics and Sentiments from Social Media Datasets,,,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media platforms contain a great wealth of information which provides
opportunities for us to explore hidden patterns or unknown correlations, and
understand people's satisfaction with what they are discussing. As one
showcase, in this paper, we present a system, TwiInsight which explores the
insight of Twitter data. Different from other Twitter analysis systems,
TwiInsight automatically extracts the popular topics under different categories
(e.g., healthcare, food, technology, sports and transport) discussed in Twitter
via topic modeling and also identifies the correlated topics across different
categories. Additionally, it also discovers the people's opinions on the tweets
and topics via the sentiment analysis. The system also employs an intuitive and
informative visualization to show the uncovered insight. Furthermore, we also
develop and compare six most popular algorithms - three for sentiment analysis
and three for topic modeling.
","[{'version': 'v1', 'created': 'Tue, 23 May 2017 06:49:12 GMT'}]",2017-05-24,"[['Wang', 'Zhengkui', ''], ['Bai', 'Guangdong', ''], ['Chowdhury', 'Soumyadeb', ''], ['Xu', 'Quanqing', ''], ['Seow', 'Zhi Lin', '']]","['Topic Modeling', 'Sentiment Analysis', 'Topic Correlation Detection', 'Data Visualization', 'Social Media', 'System Design']"
17654,1412.7309,Renato Fabbri,Renato Fabbri,"A connective differentiation of textual production in interaction
  networks",,,,,cs.SI physics.data-an physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper explores textual production in interaction networks, with special
emphasis on its relation to topological measures. Four email lists were
selected, in which measures were taken from the texts participants wrote.
Peripheral, intermediary and hub sectors of these networks were observed to
have discrepant linguistic elaborations. For completeness of exposition,
correlation of textual and topological measures were observed for the entire
network and for each connective sector. The formation of principal components
is used for further insights of how measures are related.
","[{'version': 'v1', 'created': 'Tue, 23 Dec 2014 10:31:20 GMT'}]",2014-12-31,"[['Fabbri', 'Renato', '']]","['complex networks', 'natural language processing', 'social network analysis', 'statistical physics']"
17655,1606.08955,Vinay Bettadapura,"Vinay Bettadapura, Caroline Pantofaru, Irfan Essa",Leveraging Contextual Cues for Generating Basketball Highlights,Proceedings of ACM Multimedia 2016,,,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The massive growth of sports videos has resulted in a need for automatic
generation of sports highlights that are comparable in quality to the
hand-edited highlights produced by broadcasters such as ESPN. Unlike previous
works that mostly use audio-visual cues derived from the video, we propose an
approach that additionally leverages contextual cues derived from the
environment that the game is being played in. The contextual cues provide
information about the excitement levels in the game, which can be ranked and
selected to automatically produce high-quality basketball highlights. We
introduce a new dataset of 25 NCAA games along with their play-by-play stats
and the ground-truth excitement data for each basket. We explore the
informativeness of five different cues derived from the video and from the
environment through user studies. Our experiments show that for our study
participants, the highlights produced by our system are comparable to the ones
produced by ESPN for the same games.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2016 05:04:27 GMT'}]",2016-06-30,"[['Bettadapura', 'Vinay', ''], ['Pantofaru', 'Caroline', ''], ['Essa', 'Irfan', '']]","['Basketball Video', 'Video Highlights', 'Content Analysis', 'Highlight Ranking']"
17656,1406.4879,Ovidiu Andrei Schipor OA,"Ovidiu-Andrei Schipor, Titus-Marian Nestor","Automat Parsing of Audio Recordings. Testing Children with Dyslalia.
  Theoretical Background","6 pages, 3 figures, in Romanian",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present our researches regarding automat parsing of audio
recordings. These recordings are obtained from children with dyslalia and are
necessary for an accurate identification of speech problems. We develop the ADM
algorithm and we analyze the complexity of this solution. We utilize a digital
voice recorder in High Quality mode and with VCVA (Variable Control Voice
Actuator) activated. The record format is IMA-ADPCM, 16KHz and 4bits (16 bits
PCM). A microphone was placed at 10 cm from mouth in order to minimize
environment noise. A software set of classes (C#) was created for handling
audio stream (read, conversion between different format, write). We also
propose an original solution for placing markers in audio stream. These markers
are needed for a correct parsing af full recoding.
","[{'version': 'v1', 'created': 'Thu, 29 May 2014 06:43:34 GMT'}]",2014-06-20,"[['Schipor', 'Ovidiu-Andrei', ''], ['Nestor', 'Titus-Marian', '']]","['automat parsing', 'ADPCM', 'speech therapy', 'dyslalia', 'phoneme recording']"
17657,0909.0732,R Doomun,"Shahid Hussain, Muhammad Zubair Asghar, Bashir Ahmad, Shakeel Ahmad",A Step towards Software Corrective Maintenance Using RCM model,"6 Pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 4, No. 1 & 2, August 2009, USA",,ISSN 1947 5500,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  From the preliminary stage of software engineering, selection of appropriate
enforcement of standards remained a challenge for stakeholders during entire
cycle of software development, but it can lead to reduce the efforts desired
for software maintenance phase. Corrective maintenance is the reactive
modification of a software product performed after delivery to correct
discovered faults. Studies conducted by different researchers reveal that
approximately 50 to 75 percent of the effort is spent on maintenance, out of
which about 17 to 21 percent is exercised on corrective maintenance. In this
paper, authors proposed a RCM (Reduce Corrective Maintenance) model which
represents the implementation process of number of checklists to guide the
stakeholders of all phases of software development. These check lists will be
filled by corresponding stake holder of all phases before its start. More
precise usage of the check list in relevant phase ensures successful
enforcement of analysis, design, coding and testing standards for reducing
errors in operation stage. Moreover authors represent the step by step
integration of checklists in software development life cycle through RCM model.
","[{'version': 'v1', 'created': 'Thu, 3 Sep 2009 19:06:50 GMT'}]",2009-09-04,"[['Hussain', 'Shahid', ''], ['Asghar', 'Muhammad Zubair', ''], ['Ahmad', 'Bashir', ''], ['Ahmad', 'Shakeel', '']]","['RCM model', 'Maintenance', 'Checklist', 'Corrective maintenance', 'stakeholders']"
17658,0806.0250,Arjen Hommersom,"Arjen Hommersom, Peter J.F. Lucas, and Patrick van Bommel","Checking the Quality of Clinical Guidelines using Automated Reasoning
  Tools",To appear in Theory and Practice of Logic Programming,,,,cs.AI cs.LO cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Requirements about the quality of clinical guidelines can be represented by
schemata borrowed from the theory of abductive diagnosis, using temporal logic
to model the time-oriented aspects expressed in a guideline. Previously, we
have shown that these requirements can be verified using interactive theorem
proving techniques. In this paper, we investigate how this approach can be
mapped to the facilities of a resolution-based theorem prover, Otter, and a
complementary program that searches for finite models of first-order
statements, Mace. It is shown that the reasoning required for checking the
quality of a guideline can be mapped to such fully automated theorem-proving
facilities. The medical quality of an actual guideline concerning diabetes
mellitus 2 is investigated in this way.
","[{'version': 'v1', 'created': 'Mon, 2 Jun 2008 11:02:40 GMT'}]",2008-12-18,"[['Hommersom', 'Arjen', ''], ['Lucas', 'Peter J. F.', ''], ['van Bommel', 'Patrick', '']]","['automated reasoning', 'clinical guideline', 'temporal logic', 'abduction']"
17659,0802.1113,Damien Vergnaud,Beno\^it Libert and Damien Vergnaud,Multi-Use Unidirectional Proxy Re-Signatures,16 pages,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 1998, Blaze, Bleumer, and Strauss suggested a cryptographic primitive
named proxy re-signatures where a proxy turns a signature computed under
Alice's secret key into one from Bob on the same message. The semi-trusted
proxy does not learn either party's signing key and cannot sign arbitrary
messages on behalf of Alice or Bob. At CCS 2005, Ateniese and Hohenberger
revisited the primitive by providing appropriate security definitions and
efficient constructions in the random oracle model. Nonetheless, they left open
the problem of designing a multi-use unidirectional scheme where the proxy is
able to translate in only one direction and signatures can be re-translated
several times.
  This paper solves this problem, suggested for the first time 10 years ago,
and shows the first multi-hop unidirectional proxy re-signature schemes. We
describe a random-oracle-using system that is secure in the
Ateniese-Hohenberger model. The same technique also yields a similar
construction in the standard model (i.e. without relying on random oracles).
Both schemes are efficient and require newly defined -- but falsifiable --
Diffie-Hellman-like assumptions in bilinear groups.
","[{'version': 'v1', 'created': 'Fri, 8 Feb 2008 09:34:27 GMT'}]",2008-02-11,"[['Libert', 'Benoît', ''], ['Vergnaud', 'Damien', '']]","['Multi-use proxy re-signatures', 'unidirectionality', 'pairings']"
17660,1003.3967,Andreas Krause,Daniel Golovin and Andreas Krause,"Adaptive Submodularity: Theory and Applications in Active Learning and
  Stochastic Optimization","60 pages, 6 figures. Version 5 addresses a flaw in the proof of
  Theorem 13 identified by Nan and Saligrama (2017). The revision includes a
  weaker version of Theorem 13, guaranteeing squared logarithmic approximation
  under an additional strong adaptive submodularity condition. This condition
  is met by all applications considered in the paper, as discussed in the
  revised Sections 7, 8 and 9",,,,cs.LG cs.AI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Solving stochastic optimization problems under partial observability, where
one needs to adaptively make decisions with uncertain outcomes, is a
fundamental but notoriously difficult challenge. In this paper, we introduce
the concept of adaptive submodularity, generalizing submodular set functions to
adaptive policies. We prove that if a problem satisfies this property, a simple
adaptive greedy algorithm is guaranteed to be competitive with the optimal
policy. In addition to providing performance guarantees for both stochastic
maximization and coverage, adaptive submodularity can be exploited to
drastically speed up the greedy algorithm by using lazy evaluations. We
illustrate the usefulness of the concept by giving several examples of adaptive
submodular objectives arising in diverse applications including sensor
placement, viral marketing and active learning. Proving adaptive submodularity
for these problems allows us to recover existing results in these applications
as special cases, improve approximation guarantees and handle natural
generalizations.
","[{'version': 'v1', 'created': 'Sun, 21 Mar 2010 04:06:22 GMT'}, {'version': 'v2', 'created': 'Mon, 24 May 2010 02:25:04 GMT'}, {'version': 'v3', 'created': 'Mon, 30 Aug 2010 23:00:54 GMT'}, {'version': 'v4', 'created': 'Wed, 17 Oct 2012 03:04:19 GMT'}, {'version': 'v5', 'created': 'Wed, 6 Dec 2017 08:21:07 GMT'}]",2017-12-07,"[['Golovin', 'Daniel', ''], ['Krause', 'Andreas', '']]","['Adaptive Optimization', 'Stochastic Optimization', 'Submodularity', 'Partial Observability', 'ActiveLearning', 'Optimal Decision Trees']"
17661,1603.01523,Manuel Gall,"Stefanie Rinderle-Ma, Manuel Gall, Walid Fdhila, J\""urgen Mangler,
  Conrad Indiono",Collecting Examples for Instance-Spanning Constraints,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This report presents a meta analysis of various sources from literature,
research projects, and experience with the goal of collecting examples for
instance-spanning constraints to be implemented through Process-Aware
Information Systems.
","[{'version': 'v1', 'created': 'Fri, 4 Mar 2016 16:20:31 GMT'}]",2016-03-07,"[['Rinderle-Ma', 'Stefanie', ''], ['Gall', 'Manuel', ''], ['Fdhila', 'Walid', ''], ['Mangler', 'Jürgen', ''], ['Indiono', 'Conrad', '']]","['Process-Aware Information Systems', 'Instance-spanning Constraints', 'Requirements', 'Meta analysis']"
17662,1607.02641,Dominik Wurzer Dominik Wurzer,"Dominik Wurzer, Miles Osborne, Victor Lavrenko",Randomised Relevance Model,"Information Retrieval, Query Expansion, Locality Sensitive Hashing,
  Randomized Algorithm, Relevance Model",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Relevance Models are well-known retrieval models and capable of producing
competitive results. However, because they use query expansion they can be very
slow. We address this slowness by incorporating two variants of locality
sensitive hashing (LSH) into the query expansion process. Results on two
document collections suggest that we can obtain large reductions in the amount
of work, with a small reduction in effectiveness. Our approach is shown to be
additive when pruning query terms.
","[{'version': 'v1', 'created': 'Sat, 9 Jul 2016 18:10:06 GMT'}]",2016-07-12,"[['Wurzer', 'Dominik', ''], ['Osborne', 'Miles', ''], ['Lavrenko', 'Victor', '']]","['Information Retrieval', 'Query Expansion', 'Locality SensitiveHashing']"
17663,1702.03250,Ananthanarayanan Chockalingam,"Bharath Shamasundar, Swaroop Jacob, Sandeep Bhat, and A. Chockalingam",Multidimensional Index Modulation in Wireless Communications,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In index modulation schemes, information bits are conveyed through indexing
of transmission entities such as antennas, subcarriers, times slots, precoders,
subarrays, and radio frequency (RF) mirrors. Index modulation schemes are
attractive for their advantages such as good performance, high rates, and
hardware simplicity. This paper focuses on index modulation schemes in which
multiple transmission entities, namely, {\em antennas}, {\em time slots}, and
{\em RF mirrors}, are indexed {\em simultaneously}. Recognizing that such
multidimensional index modulation schemes encourage sparsity in their transmit
signal vectors, we propose efficient signal detection schemes that use
compressive sensing based reconstruction algorithms. Results show that, for a
given rate, improved performance is achieved when the number of indexed
transmission entities is increased. We also explore indexing opportunities in
{\em load modulation}, which is a modulation scheme that offers power
efficiency and reduced RF hardware complexity advantages in multiantenna
systems. Results show that indexing space and time in load modulated
multiantenna systems can achieve improved performance.
","[{'version': 'v1', 'created': 'Fri, 10 Feb 2017 17:01:26 GMT'}]",2017-02-13,"[['Shamasundar', 'Bharath', ''], ['Jacob', 'Swaroop', ''], ['Bhat', 'Sandeep', ''], ['Chockalingam', 'A.', '']]","['Multidimensional index modulation', 'transmit antennas', 'trans']"
17664,1707.08484,Tomasz Jurdzinski,Tomasz Jurdzinski and Krzysztof Nowicki,MST in O(1) Rounds of the Congested Clique,,,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a distributed randomized algorithm finding Minimum Spanning Tree
(MST) of a given graph in O(1) rounds, with high probability, in the Congested
Clique model. The input graph in the Congested Clique model is a graph of n
nodes, where each node initially knows only its incident edges. The
communication graph is a clique with limited edge bandwidth: each two nodes
(not necessarily neighbours in the input graph) can exchange $O(\log n)$ bits.
  As in previous works, the key part of the MST algorithm is an efficient
Connected Components (CC) algorithm. However, unlike the former approaches, we
do not aim at simulating the standard Boruvka algorithm, at least at initial
stages of the CC algorithm. Instead, we develop a new technique which combines
connected components of sample sparse subgraphs of the input graph in order to
accelerate the process of uncovering connected components of the original input
graph. More specifically, we develop a sparsification technique which reduces
an initial CC problem in $O(1)$ rounds to its two restricted instances. The
former instance has a graph with maximal degree $O(\log \log n)$ as the input
-- here our sample-combining technique helps. In the latter instance, a
partition of the input graph into $O(n/\log \log n)$ connected components is
known. This gives an opportunity to apply previous algorithms to determine
connected components in $O(1)$ rounds.
  Our result addresses the problem from and the $O(\log \log n)$ algorithm of
Lotker et al. [SPAA 2003; SICOMP 2005], improves over previous $O(\log* n)$
algorithm of Ghaffari et al. [PODC 2016] and $O(\log \log \log n)$ algorithm of
Hegeman et al. [PODC 2015] . It also determines $\Theta(1)$ round complexity in
the congested clique for MST, as well as other graph problems, including
bipartiteness, cut verification, s-t connectivity and cycle containment.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 15:04:22 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Jul 2017 12:54:35 GMT'}, {'version': 'v3', 'created': 'Tue, 31 Oct 2017 16:33:48 GMT'}]",2017-11-01,"[['Jurdzinski', 'Tomasz', ''], ['Nowicki', 'Krzysztof', '']]","['congested clique', 'connected components', 'minimum spanning tree', 'randomized algorithms', 'broadcast', 'unicast']"
17665,1505.02908,Kim-Kwang Raymond Choo,"Nurul Hidayah Ab Rahman, Kim-Kwang Raymond Choo","Factors Influencing the Adoption of Cloud Incident Handling Strategy: A
  Preliminary Study in Malaysia","Proceedings of 21st Americas Conference on Information Systems (AMCIS
  2015)",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study seeks to understand the factors influencing the adoption of an
incident handling strategy by organisational cloud service users. We propose a
conceptual model that draws upon the Situation Awareness (SA) model and
Protection Motivation Theory (PMT) to guide this research. 40 organisational
cloud service users in Malaysia were surveyed. We also conduct face-to-face
interviews with participants from four of the organisations. Findings from the
study indicate that four PMT factors (Perceived Vulnerability, Self-Efficacy,
Response Efficacy, and Perceived Severity) have a significantly influence on
the adoption of cloud incident handling strategy within the organisations. We,
therefore, suggest a successful adoption cloud incident handling strategy by
organisational cloud service users involves the nexus between these four PMT
factors. We also outline future research required to validate the model.
","[{'version': 'v1', 'created': 'Tue, 12 May 2015 08:42:28 GMT'}]",2015-05-13,"[['Rahman', 'Nurul Hidayah Ab', ''], ['Choo', 'Kim-Kwang Raymond', '']]","['Cloud computing', 'Incident handling', 'Protection Motivation Theory', 'Situation Awareness']"
17666,1306.1702,Evgenii Evgenii Khokhryakov,Evgenii Khokhryakov,Stable equilibrium study cascaded one bit sigma-delta modulator,Pdf-format Russian version,Voprosi RadioElectronici ISSN 0233-9950 2 (2013) 144-154,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the paper defines a boundary of stability zone for sigma-delta modulator.
The boundary depends from inner sigma-delta modulator coefficients. For
designing purposes such result could be used to find or compare some
appropriate schemes with each other. It is proved some statements and showed
that boundary could be found theoretically for any order of sigma-delta
modulator, but practically till 5-th order.
","[{'version': 'v1', 'created': 'Fri, 7 Jun 2013 12:29:52 GMT'}]",2013-06-18,"[['Khokhryakov', 'Evgenii', '']]","['SDM', 'cascaded', 'stable equilibrium', 'modeling', 'nonlinear model']"
17667,1701.01677,Krishna Khatri,Krishna Khatri,The Shapley Value of Digraph Games,5 pages,,,,cs.GT q-fin.EC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper the Shapley value of digraph (directed graph) games are
considered. Digraph games are transferable utility (TU) games with limited
cooperation among players, where players are represented by nodes. A
restrictive relation between two adjacent players is established by a directed
line segment. Directed path, connecting the initial player with the terminal
player, form the coalition among players. A dominance relation is established
between players and this relation determines whether or not a player wants to
cooperate. To cooperate, we assume that a player joins a coalition where he/she
is not dominated by any other players.The Shapley value is defined as the
average of marginal contribution vectors corresponding to all permutations that
do not violate the subordination of players. The Shapley value for cyclic
digraph games is calculated and analyzed. For a given family of characteristic
functions, a quick way to calculate Shapley values is formulated.
","[{'version': 'v1', 'created': 'Fri, 6 Jan 2017 16:07:10 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Jun 2017 18:29:08 GMT'}]",2017-06-09,"[['Khatri', 'Krishna', '']]","['Cooperative game', 'TU game', 'Shapley value', 'digraph', 'domination']"
17668,1011.0078,Marek Karpinski,"Jean Cardinal, Marek Karpinski, Richard Schmied and Claus Viehmann",Approximating Subdense Instances of Covering Problems,,,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study approximability of subdense instances of various covering problems
on graphs, defined as instances in which the minimum or average degree is
Omega(n/psi(n)) for some function psi(n)=omega(1) of the instance size. We
design new approximation algorithms as well as new polynomial time
approximation schemes (PTASs) for those problems and establish first
approximation hardness results for them. Interestingly, in some cases we were
able to prove optimality of the underlying approximation ratios, under usual
complexity-theoretic assumptions. Our results for the Vertex Cover problem
depend on an improved recursive sampling method which could be of independent
interest.
","[{'version': 'v1', 'created': 'Sat, 30 Oct 2010 15:11:30 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Nov 2010 16:21:22 GMT'}]",2010-11-10,"[['Cardinal', 'Jean', ''], ['Karpinski', 'Marek', ''], ['Schmied', 'Richard', ''], ['Viehmann', 'Claus', '']]","['Approximation Algorithms', 'Approximation Schemes', 'Set Cover', 'Vertex Cover', 'Connected Vertex Cover', 'Steiner Tree', 'Subdense Instances', 'Approximation Lower Bounds']"
17669,1402.6742,Richard McClatchey,"Jetendr Shamdasani, Andrew Branson, Richard McClatchey, Coralie Blanc,
  Florent Martin, Pierre Bornand, Sandra Massonnat, Olivier Gattaz and Patrick
  Emin",CRISTAL-ISE : Provenance Applied in Industry,"6 pages, 3 figures; Presented at the 16th International Conference on
  Enterprise Information Systems (ICEIS 2014)",,,,cs.DB cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the CRISTAL-iSE project as a framework for the management
of provenance information in industry. The project itself is a research
collaboration between academia and industry. A key factor in the project is the
use of a system known as CRISTAL which is a mature system based on proven
description driven principles. A crucial element in the description driven
approach is that the fact that objects (Items) are described at runtime
enabling managed systems to be both dynamic and flexible. Another factor is the
notion that all Items in CRISTAL are stored and versioned, therefore enabling a
provenance collection system. In this paper a concrete application, called
Agilium, is briefly described and a future application CIMAG-RA is presented
which will harness the power of both CRISTAL and Agilium.
","[{'version': 'v1', 'created': 'Wed, 26 Feb 2014 23:17:58 GMT'}]",2014-02-28,"[['Shamdasani', 'Jetendr', ''], ['Branson', 'Andrew', ''], ['McClatchey', 'Richard', ''], ['Blanc', 'Coralie', ''], ['Martin', 'Florent', ''], ['Bornand', 'Pierre', ''], ['Massonnat', 'Sandra', ''], ['Gattaz', 'Olivier', ''], ['Emin', 'Patrick', '']]","['Provenance', 'Semantic Web', 'Industrial Collaboration', 'XML', 'XML Schema', 'BPM', 'Resource Allocation']"
17670,1304.7434,Renu Jose,"Renu Jose, Sooraj K. Ambat, K.V.S. Hari","Low Complexity Joint Estimation of Synchronization Impairments in Sparse
  Channel for MIMO-OFDM System","7 pages, 4 figures, under review in AEU - International Journal of
  Electronics and Communications (Elsevier) (paper id-AEUE-D-12-00625)",,,,cs.IT math.IT,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Low complexity joint estimation of synchronization impairments and channel in
a single-user MIMO-OFDM system is presented in this letter. Based on a system
model that takes into account the effects of synchronization impairments such
as carrier frequency offset, sampling frequency offset, and symbol timing
error, and channel, a Maximum Likelihood (ML) algorithm for the joint
estimation is proposed. To reduce the complexity of ML grid search, the number
of received signal samples used for estimation need to be reduced. The
conventional channel estimation methods using Least-Squares (LS) fail for the
reduced sample under-determined system, which results in poor performance of
the joint estimator. The proposed ML algorithm uses Compressed Sensing (CS)
based channel estimation method in a sparse fading scenario, where the received
samples used for estimation are less than that required for an LS based
estimation. The performance of the estimation method is studied through
numerical simulations, and it is observed that CS based joint estimator
performs better than LS based joint estimator
","[{'version': 'v1', 'created': 'Sun, 28 Apr 2013 07:03:45 GMT'}]",2013-04-30,"[['Jose', 'Renu', ''], ['Ambat', 'Sooraj K.', ''], ['Hari', 'K. V. S.', '']]","['MIMO', 'OFDM', 'Synchronization', 'Channel Estimation', 'Sparse Channel', 'Compressed Sensing']"
17671,1410.0804,Maciej Burak Mr.,Maciej Burak,"Multi-step Uniformization with Steady-State Detection in Nonstationary
  M/M/s Queuing Systems",added DOI information in References,,,,cs.PF cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new approach to the steady state detection in the uniformization method of
solving continuous time Markov chains is introduced. The method is particularly
useful in solving inhomogenous CTMC's in multiple steps, where the desired
error bound of the whole solution can be distributed not proportionally to the
lengths of the respective intervals, but rather in a way, that maximizes the
chances of detecting a steady state. Additionally, the convergence properties
of the underlying DTMC are used to further enhance the computational savings
due to the steady state detection. The method is applied to the problem of
modeling a Call Center using inhomogenous CTMC model of a M(t)/M(t)/s(t)
queuing system.
","[{'version': 'v1', 'created': 'Fri, 3 Oct 2014 10:13:03 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Oct 2014 08:01:08 GMT'}, {'version': 'v3', 'created': 'Sat, 11 Oct 2014 09:11:41 GMT'}]",2014-10-14,"[['Burak', 'Maciej', '']]","['Markov processes', 'OR in service industries', 'transientsolutions', 'uniformization', 'numerical methods', 'nonstationary', 'algorithms', 'Contact Centre']"
17672,1710.05512,Roberto Calandra,"Roberto Calandra, Andrew Owens, Manu Upadhyaya, Wenzhen Yuan, Justin
  Lin, Edward H. Adelson, Sergey Levine",The Feeling of Success: Does Touch Sensing Help Predict Grasp Outcomes?,"10 pages, accepted at the 1st Annual Conference on Robot Learning
  (CoRL)",,,,cs.RO cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A successful grasp requires careful balancing of the contact forces. Deducing
whether a particular grasp will be successful from indirect measurements, such
as vision, is therefore quite challenging, and direct sensing of contacts
through touch sensing provides an appealing avenue toward more successful and
consistent robotic grasping. However, in order to fully evaluate the value of
touch sensing for grasp outcome prediction, we must understand how touch
sensing can influence outcome prediction accuracy when combined with other
modalities. Doing so using conventional model-based techniques is exceptionally
difficult. In this work, we investigate the question of whether touch sensing
aids in predicting grasp outcomes within a multimodal sensing framework that
combines vision and touch. To that end, we collected more than 9,000 grasping
trials using a two-finger gripper equipped with GelSight high-resolution
tactile sensors on each finger, and evaluated visuo-tactile deep neural network
models to directly predict grasp outcomes from either modality individually,
and from both modalities together. Our experimental results indicate that
incorporating tactile readings substantially improve grasping performance.
","[{'version': 'v1', 'created': 'Mon, 16 Oct 2017 05:32:38 GMT'}]",2017-10-24,"[['Calandra', 'Roberto', ''], ['Owens', 'Andrew', ''], ['Upadhyaya', 'Manu', ''], ['Yuan', 'Wenzhen', ''], ['Lin', 'Justin', ''], ['Adelson', 'Edward H.', ''], ['Levine', 'Sergey', '']]","['Robot Learning', 'Grasping', 'Tactile Sensors', 'Multi-modal Sensing']"
17673,1109.2548,Jael Kriener,Jael Kriener and Andy King,RedAlert: Determinacy Inference for Prolog,"Theory and Practice of Logic Programming, 2011, 27th Int'l.
  Conference on Logic Programming (ICLP'11) Special Issue, volume 11, issue 4-5",,,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper revisits the problem of determinacy inference addressing the
problem of how to uniformly handle cut. To this end a new semantics is
introduced for cut, which is abstracted to systematically derive a backward
analysis that derives conditions sufficient for a goal to succeed at most once.
The method is conceptionally simpler and easier to implement than existing
techniques, whilst improving the latter's handling of cut. Formal arguments
substantiate correctness and experimental work, and a tool called 'RedAlert'
demonstrates the method's generality and applicability.
","[{'version': 'v1', 'created': 'Mon, 12 Sep 2011 17:49:01 GMT'}]",2011-09-13,"[['Kriener', 'Jael', ''], ['King', 'Andy', '']]","['abstract interpretation', 'backwards analysis', 'Boolean formulae', 'constraints', 'cut', 'determinacy inference', 'Prolog']"
17674,1702.06112,Fabio Protti,"Jo\~ao Vinicius C. Thompson, Loana T. Nogueira, F\'abio Protti, Raquel
  S. F. Bravo, Mitre C. Dourado, U\'everton S. Souza",A general framework for path convexities,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we deal with the so-called path convexities, defined over
special collections of paths. For example, the collection of the shortest paths
in a graph is associated with the well-known geodesic convexity, while the
collection of the induced paths is associated with the monophonic convexity;
and there are many other examples. Besides reviewing the path convexities in
the literature, we propose a general path convexity framework, of which most
existing path convexities can be viewed as particular cases. Some benefits of
the proposed framework are the systematization of the algorithmic study of
related problems and the possibility of defining new convexities not yet
investigated.
","[{'version': 'v1', 'created': 'Mon, 20 Feb 2017 18:53:37 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Jun 2019 18:15:30 GMT'}]",2019-06-21,"[['Thompson', 'João Vinicius C.', ''], ['Nogueira', 'Loana T.', ''], ['Protti', 'Fábio', ''], ['Bravo', 'Raquel S. F.', ''], ['Dourado', 'Mitre C.', ''], ['Souza', 'Uéverton S.', '']]","['Algorithmic Complexity', 'Graph Convexity', 'Path Convexity']"
17675,1707.09422,Prasad Calyam,"Andrew Crutcher, Caleb Koch, Kyle Coleman, Jon Patman, Flavio
  Esposito, Prasad Calyam",Hyperprofile-based Computation Offloading for Mobile Edge Networks,"5 pages, NSF REU Site publication",,,,cs.NI cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent studies, researchers have developed various computation offloading
frameworks for bringing cloud services closer to the user via edge networks.
Specifically, an edge device needs to offload computationally intensive tasks
because of energy and processing constraints. These constraints present the
challenge of identifying which edge nodes should receive tasks to reduce
overall resource consumption. We propose a unique solution to this problem
which incorporates elements from Knowledge-Defined Networking (KDN) to make
intelligent predictions about offloading costs based on historical data. Each
server instance can be represented in a multidimensional feature space where
each dimension corresponds to a predicted metric. We compute features for a
""hyperprofile"" and position nodes based on the predicted costs of offloading a
particular task. We then perform a k-Nearest Neighbor (kNN) query within the
hyperprofile to select nodes for offloading computation. This paper formalizes
our hyperprofile-based solution and explores the viability of using machine
learning (ML) techniques to predict metrics useful for computation offloading.
We also investigate the effects of using different distance metrics for the
queries. Our results show various network metrics can be modeled accurately
with regression, and there are circumstances where kNN queries using Euclidean
distance as opposed to rectilinear distance is more favorable.
","[{'version': 'v1', 'created': 'Fri, 28 Jul 2017 21:28:45 GMT'}]",2017-08-01,"[['Crutcher', 'Andrew', ''], ['Koch', 'Caleb', ''], ['Coleman', 'Kyle', ''], ['Patman', 'Jon', ''], ['Esposito', 'Flavio', ''], ['Calyam', 'Prasad', '']]","['Knowledge-defined networking', 'machine learning', 'computation offloading', 'mobile edge networks', 'k-Nearest Neighbor']"
17676,1005.0704,Christophe Guyeux,"Jacques M. Bahi, Christophe Guyeux",A chaos-based approach for information hiding security,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a new framework for data hiding security. Contrary to
the existing ones, the approach introduced here is not based on probability
theory. In this paper, a scheme is considered as secure if its behavior is
proven unpredictable. The objective of this study is to enrich the existing
notions of data hiding security with a new rigorous and practicable one. This
new definition of security is based on the notion of topological chaos. It
could be used to reinforce the confidence on a scheme previously proven as
secure by other approaches and it could also be used to study some classes of
attacks that currently cannot be studied by the existing security approaches.
After presenting the theoretical framework of the study, a concrete example is
detailed in order to show how our approach can be applied.
","[{'version': 'v1', 'created': 'Wed, 5 May 2010 09:02:17 GMT'}]",2010-05-06,"[['Bahi', 'Jacques M.', ''], ['Guyeux', 'Christophe', '']]","['Information hiding security', 'Theory of chaos', 'Spread-spectrum']"
17677,1501.02646,Philipp Mayr,"Philipp Mayr, Ingo Frommholz, Andrea Scharnhorst, Peter Mutschke","Bibliometric-enhanced Information Retrieval: 2nd International BIR
  Workshop","4 pages, 37th European Conference on Information Retrieval, BIR
  workshop",,,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This workshop brings together experts of communities which often have been
perceived as different once: bibliometrics / scientometrics / informetrics on
the one side and information retrieval on the other. Our motivation as
organizers of the workshop started from the observation that main discourses in
both fields are different, that communities are only partly overlapping and
from the belief that a knowledge transfer would be profitable for both sides.
Bibliometric techniques are not yet widely used to enhance retrieval processes
in digital libraries, although they offer value-added effects for users. On the
other side, more and more information professionals, working in libraries and
archives are confronted with applying bibliometric techniques in their
services. This way knowledge exchange becomes more urgent. The first workshop
set the research agenda, by introducing in each other methods, reporting about
current research problems and brainstorming about common interests. This
follow-up workshop continues the overall communication, but also puts one
problem into the focus. In particular, we will explore how statistical
modelling of scholarship can improve retrieval services for specific
communities, as well as for large, cross-domain collections like Mendeley or
ResearchGate. This second BIR workshop continues to raise awareness of the
missing link between Information Retrieval (IR) and bibliometrics and
contributes to create a common ground for the incorporation of
bibliometric-enhanced services into retrieval at the scholarly search engine
interface.
","[{'version': 'v1', 'created': 'Mon, 12 Jan 2015 13:59:13 GMT'}]",2015-01-13,"[['Mayr', 'Philipp', ''], ['Frommholz', 'Ingo', ''], ['Scharnhorst', 'Andrea', ''], ['Mutschke', 'Peter', '']]","['Bibliometrics', 'Scientometrics', 'Informetrics', 'Information Retrieval', 'Digital Libraries']"
17678,1410.4449,Alina S\^irbu,"Alina S\^irbu, Ozalp Babaoglu","A Holistic Approach to Log Data Analysis in High-Performance Computing
  Systems: The Case of IBM Blue Gene/Q","12 pages, 7 Figures",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The complexity and cost of managing high-performance computing
infrastructures are on the rise. Automating management and repair through
predictive models to minimize human interventions is an attempt to increase
system availability and contain these costs. Building predictive models that
are accurate enough to be useful in automatic management cannot be based on
restricted log data from subsystems but requires a holistic approach to data
analysis from disparate sources. Here we provide a detailed multi-scale
characterization study based on four datasets reporting power consumption,
temperature, workload, and hardware/software events for an IBM Blue Gene/Q
installation. We show that the system runs a rich parallel workload, with low
correlation among its components in terms of temperature and power, but higher
correlation in terms of events. As expected, power and temperature correlate
strongly, while events display negative correlations with load and power. Power
and workload show moderate correlations, and only at the scale of components.
The aim of the study is a systematic, integrated characterization of the
computing infrastructure and discovery of correlation sources and levels to
serve as basis for future predictive modeling efforts.
","[{'version': 'v1', 'created': 'Thu, 16 Oct 2014 14:40:00 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Feb 2015 10:41:57 GMT'}, {'version': 'v3', 'created': 'Mon, 7 Sep 2015 11:08:50 GMT'}]",2015-09-08,"[['Sîrbu', 'Alina', ''], ['Babaoglu', 'Ozalp', '']]","['Data science', 'correlation analysis', 'HPC system monitoring', 'log data integration', 'predictive modeling']"
17679,1603.06359,Seungryong Kim,"Seungryong Kim, Kihong Park, Kwanghoon Sohn, and Stephen Lin","Unified Depth Prediction and Intrinsic Image Decomposition from a Single
  Image via Joint Convolutional Neural Fields",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a method for jointly predicting a depth map and intrinsic images
from single-image input. The two tasks are formulated in a synergistic manner
through a joint conditional random field (CRF) that is solved using a novel
convolutional neural network (CNN) architecture, called the joint convolutional
neural field (JCNF) model. Tailored to our joint estimation problem, JCNF
differs from previous CNNs in its sharing of convolutional activations and
layers between networks for each task, its inference in the gradient domain
where there exists greater correlation between depth and intrinsic images, and
the incorporation of a gradient scale network that learns the confidence of
estimated gradients in order to effectively balance them in the solution. This
approach is shown to surpass state-of-the-art methods both on single-image
depth estimation and on intrinsic image decomposition.
","[{'version': 'v1', 'created': 'Mon, 21 Mar 2016 09:10:38 GMT'}]",2016-03-22,"[['Kim', 'Seungryong', ''], ['Park', 'Kihong', ''], ['Sohn', 'Kwanghoon', ''], ['Lin', 'Stephen', '']]","['single-image depth estimation', 'intrinsic image decomposition', 'conditional random field', 'convolutional neural networks']"
17680,1504.01623,Yoann Dieudonn\'e,"S\'ebastien Bouchard, Yoann Dieudonn\'e and Bertrand Ducourthial",Byzantine Gathering in Networks,,,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates an open problem introduced in [14]. Two or more
mobile agents start from different nodes of a network and have to accomplish
the task of gathering which consists in getting all together at the same node
at the same time. An adversary chooses the initial nodes of the agents and
assigns a different positive integer (called label) to each of them. Initially,
each agent knows its label but does not know the labels of the other agents or
their positions relative to its own. Agents move in synchronous rounds and can
communicate with each other only when located at the same node. Up to f of the
agents are Byzantine. A Byzantine agent can choose an arbitrary port when it
moves, can convey arbitrary information to other agents and can change its
label in every round, in particular by forging the label of another agent or by
creating a completely new one.
  What is the minimum number M of good agents that guarantees deterministic
gathering of all of them, with termination?
  We provide exact answers to this open problem by considering the case when
the agents initially know the size of the network and the case when they do
not. In the former case, we prove M=f+1 while in the latter, we prove M=f+2.
More precisely, for networks of known size, we design a deterministic algorithm
gathering all good agents in any network provided that the number of good
agents is at least f+1. For networks of unknown size, we also design a
deterministic algorithm ensuring the gathering of all good agents in any
network but provided that the number of good agents is at least f+2. Both of
our algorithms are optimal in terms of required number of good agents, as each
of them perfectly matches the respective lower bound on M shown in [14], which
is of f+1 when the size of the network is known and of f+2 when it is unknown.
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2015 14:40:31 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Apr 2015 12:56:52 GMT'}, {'version': 'v3', 'created': 'Mon, 27 Apr 2015 06:38:07 GMT'}]",2015-04-28,"[['Bouchard', 'Sébastien', ''], ['Dieudonné', 'Yoann', ''], ['Ducourthial', 'Bertrand', '']]","['rendezvous', 'deterministic algorithm', 'mobile agent', 'Byzantine fault']"
17681,1505.04657,Phong Minh Vu,"Phong Minh Vu, Tam The Nguyen, Hung Viet Pham, Tung Thanh Nguyen",Mining User Opinions in Mobile App Reviews: A Keyword-based Approach,,,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  User reviews of mobile apps often contain complaints or suggestions which are
valuable for app developers to improve user experience and satisfaction.
However, due to the large volume and noisy-nature of those reviews, manually
analyzing them for useful opinions is inherently challenging. To address this
problem, we propose MARK, a keyword-based framework for semi-automated review
analysis. MARK allows an analyst describing his interests in one or some mobile
apps by a set of keywords. It then finds and lists the reviews most relevant to
those keywords for further analysis. It can also draw the trends over time of
those keywords and detect their sudden changes, which might indicate the
occurrences of serious issues. To help analysts describe their interests more
effectively, MARK can automatically extract keywords from raw reviews and rank
them by their associations with negative reviews. In addition, based on a
vector-based semantic representation of keywords, MARK can divide a large set
of keywords into more cohesive subsets, or suggest keywords similar to the
selected ones.
","[{'version': 'v1', 'created': 'Mon, 18 May 2015 14:25:03 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Oct 2015 02:23:32 GMT'}]",2015-10-27,"[['Vu', 'Phong Minh', ''], ['Nguyen', 'Tam The', ''], ['Pham', 'Hung Viet', ''], ['Nguyen', 'Tung Thanh', '']]","['Opinion Mining', 'Review Analysis', 'Keyword']"
17682,1410.2470,Jalaj Upadhyay,Jalaj Upadhyay,"Randomness Efficient Fast-Johnson-Lindenstrauss Transform with
  Applications in Differential Privacy and Compressed Sensing",Corrected a mistake in the proof and few small typos,,,,cs.DS cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Johnson-Lindenstrauss property ({\sf JLP}) of random matrices has immense
application in computer science ranging from compressed sensing, learning
theory, numerical linear algebra, to privacy. This paper explores the
properties and applications of a distribution of random matrices. Our
distribution satisfies {\sf JLP} with desirable properties like fast
matrix-vector multiplication, sparsity, and optimal subspace embedding. We can
sample a random matrix from this distribution using exactly $2n+n \log n$
random bits. We show that a random matrix picked from this distribution
preserves differential privacy under the condition that the input private
matrix satisfies certain spectral property. This improves the run-time of
various differentially private mechanisms like Blocki {\it et al.} (FOCS 2012)
and Upadhyay (ASIACRYPT 13). Our final construction has a bounded column
sparsity. Therefore, this answers an open problem stated in Blocki {\it et al.}
(FOCS 2012). Using the results of Baranuik {\it et al.} (Constructive
Approximation: 28(3)), our result implies a randomness efficient matrices that
satisfies the Restricted-Isometry Property of optimal order for small sparsity
with exactly linear random bits.
  We also show that other known distributions of sparse random matrices with
the {\sf JLP} does not preserves differential privacy; thereby, answering one
of the open problem posed by Blocki {\it et al.} (FOCS 2012). Extending on the
works of Kane and Nelson (JACM: 61(1)), we also give unified analysis of some
of the known Johnson-Lindenstrauss transform. We also present a self-contained
simplified proof of an inequality on quadratic form of Gaussian variables that
we use in all our proofs.
","[{'version': 'v1', 'created': 'Thu, 9 Oct 2014 14:04:26 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Oct 2014 15:42:47 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Oct 2014 00:42:07 GMT'}, {'version': 'v4', 'created': 'Wed, 5 Nov 2014 13:39:49 GMT'}, {'version': 'v5', 'created': 'Thu, 2 Apr 2015 19:24:35 GMT'}, {'version': 'v6', 'created': 'Thu, 16 Jul 2015 16:09:50 GMT'}]",2015-07-17,"[['Upadhyay', 'Jalaj', '']]","['Johnson-Lindenstrauss Transform', 'Differential Privacy', 'Restricted-Isometry Property']"
17683,1506.01652,George Mertzios,"Archontia C. Giannopoulou, George B. Mertzios, and Rolf Niedermeier","Polynomial Fixed-Parameter Algorithms: A Case Study for Longest Path on
  Interval Graphs","34 pages, 1 figure, 1 algorithm, 4 reduction rules",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the design of fixed-parameter algorithms for problems already known
to be solvable in polynomial time. The main motivation is to get more efficient
algorithms for problems with unattractive polynomial running times. Here, we
focus on a fundamental graph problem: Longest Path, that is, given an
undirected graph, find a maximum-length path in $G$. Longest Path is NP-hard in
general but known to be solvable in $O(n^{4})$ time on $n$-vertex interval
graphs. We show how to solve Longest Path on Interval Graphs, parameterized by
vertex deletion number $k$ to proper interval graphs, in $O(k^{9}n)$ time.
Notably, Longest Path is trivially solvable in linear time on proper interval
graphs, and the parameter value $k$ can be approximated up to a factor of 4 in
linear time. From a more general perspective, we believe that using
parameterized complexity analysis may enable a refined understanding of
efficiency aspects for polynomial-time solvable problems similarly to what
classical parameterized complexity analysis does for NP-hard problems.
","[{'version': 'v1', 'created': 'Thu, 4 Jun 2015 16:49:35 GMT'}, {'version': 'v2', 'created': 'Wed, 11 May 2016 20:22:22 GMT'}, {'version': 'v3', 'created': 'Fri, 2 Jun 2017 15:07:45 GMT'}, {'version': 'v4', 'created': 'Mon, 4 Jan 2021 21:43:10 GMT'}]",2021-01-06,"[['Giannopoulou', 'Archontia C.', ''], ['Mertzios', 'George B.', ''], ['Niedermeier', 'Rolf', '']]","['polynomial-time algorithm', 'longest path problem', 'interval graphs', 'proper interval vertexdeletion set', 'data reduction', 'fixed-parameter algorithm']"
17684,1506.02465,Marius Lindauer,"Bernd Bischl, Pascal Kerschke, Lars Kotthoff, Marius Lindauer, Yuri
  Malitsky, Alexandre Frechette, Holger Hoos, Frank Hutter, Kevin Leyton-Brown,
  Kevin Tierney, Joaquin Vanschoren",ASlib: A Benchmark Library for Algorithm Selection,Accepted to be published in Artificial Intelligence Journal,,,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The task of algorithm selection involves choosing an algorithm from a set of
algorithms on a per-instance basis in order to exploit the varying performance
of algorithms over a set of instances. The algorithm selection problem is
attracting increasing attention from researchers and practitioners in AI. Years
of fruitful applications in a number of domains have resulted in a large amount
of data, but the community lacks a standard format or repository for this data.
This situation makes it difficult to share and compare different approaches
effectively, as is done in other, more established fields. It also
unnecessarily hinders new researchers who want to work in this area. To address
this problem, we introduce a standardized format for representing algorithm
selection scenarios and a repository that contains a growing number of data
sets from the literature. Our format has been designed to be able to express a
wide variety of different scenarios. Demonstrating the breadth and power of our
platform, we describe a set of example experiments that build and evaluate
algorithm selection models through a common interface. The results display the
potential of algorithm selection to achieve significant performance
improvements across a broad range of problems and algorithms.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2015 12:35:04 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Feb 2016 14:38:52 GMT'}, {'version': 'v3', 'created': 'Wed, 6 Apr 2016 13:20:23 GMT'}]",2016-04-07,"[['Bischl', 'Bernd', ''], ['Kerschke', 'Pascal', ''], ['Kotthoff', 'Lars', ''], ['Lindauer', 'Marius', ''], ['Malitsky', 'Yuri', ''], ['Frechette', 'Alexandre', ''], ['Hoos', 'Holger', ''], ['Hutter', 'Frank', ''], ['Leyton-Brown', 'Kevin', ''], ['Tierney', 'Kevin', ''], ['Vanschoren', 'Joaquin', '']]","['algorithm selection', 'machine learning', 'empirical performanceestimation']"
17685,0708.3740,Noelle Carbonell,"J\'er\^ome Simonin (INRIA Rocquencourt / INRIA Lorraine - LORIA),
  Marius Hategan (INRIA Rocquencourt / INRIA Lorraine - LORIA), No\""elle
  Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)","Plate-forme Magicien d'Oz pour l'\'etude de l'apport des ACAs \`a
  l'interaction",,"Dans Actes du Second Workshop sur les Agents Conversationnels
  anim\'es - Second Workshop sur les Agents Conversationnels anim\'es, Toulouse
  : France (2007)",,,cs.HC,,"  In order to evaluate the contribution of Embodied (Animated) Conversational
Agents (ECAs) to the effectiveness and usability of human-computer interaction,
we developed a software platform meant to collect usage data. This platform,
which implements the wizard of Oz paradigm, makes it possible to simulate user
interfaces integrating ACAs for any Windows software application. It can also
save and ""replay"" a rich interaction trace including user and system events,
screen captures, users' speech and eye fixations. This platform has been used
to assess users' subjective judgements and reactions to a multimodal online
help system meant to facilitate the use of software for the general public
(Flash). The online help system is embodied using a 3D talking head (developed
by FT R&D) which ""says"" oral help messages illustrated with Flash screen
copies.
","[{'version': 'v1', 'created': 'Tue, 28 Aug 2007 09:56:05 GMT'}]",2007-08-29,"[['Simonin', 'Jérôme', '', 'INRIA Rocquencourt / INRIA Lorraine - LORIA'], ['Hategan', 'Marius', '', 'INRIA Rocquencourt / INRIA Lorraine - LORIA'], ['Carbonell', 'Noëlle', '', 'INRIA Rocquencourt / INRIA Lorraine - LORIA']]","['Multimodal software platform', 'embodied conversational agents', 'wizard of Oz', 'online help', 'human-computer interaction']"
17686,1206.6015,Sundararajan Sellamanickam,"Sundararajan Sellamanickam, Sathiya Keerthi Selvaraj",Transductive Classification Methods for Mixed Graphs,"8 Pages, 2 Tables, 2 Figures, KDD Workshop - MLG'11 San Diego, CA,
  USA",,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we provide a principled approach to solve a transductive
classification problem involving a similar graph (edges tend to connect nodes
with same labels) and a dissimilar graph (edges tend to connect nodes with
opposing labels). Most of the existing methods, e.g., Information
Regularization (IR), Weighted vote Relational Neighbor classifier (WvRN) etc,
assume that the given graph is only a similar graph. We extend the IR and WvRN
methods to deal with mixed graphs. We evaluate the proposed extensions on
several benchmark datasets as well as two real world datasets and demonstrate
the usefulness of our ideas.
","[{'version': 'v1', 'created': 'Tue, 26 Jun 2012 14:56:33 GMT'}]",2012-06-27,"[['Sellamanickam', 'Sundararajan', ''], ['Selvaraj', 'Sathiya Keerthi', '']]","['Classification', 'Graph based semi-supervisedlearning', 'Transductive learning', 'Mixed graphs']"
17687,1606.03963,Igor Barahona Dr,"Igor Barahona, Daria Micaela Hernandez and Hector Hugo
  Perez-Villarreal","How marketing vocabulary was evolving from 2005 to 2014? An illustrative
  application of statistical methods on text mining","Marketing, Textual Statistics, Vocabulary evolving, Influential
  articles, Correspondence analysis","JSM Proceedings (2015) Section on Statistics in Marketing.
  Alexandria, VA. American Statistical Association. 1121-1131",,,cs.DL cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Here a collection of 1169 abstracts, which corresponds to articles that the
Journal of Marketing Research has published from 2005 to 2014, are analysed
under a novel approach. We apply several statistical methods, such as Principal
Components Analysis and Correspondence Analysis to identify the way Marketing
vocabulary is evolving. Similarly those articles that introduce new vocabulary
are identified and the preferred words by authors are also detected. In order
to provide an easy-to-understand explanation, we provide our results
graphically. A word-cloud with the most frequent words is given first. Secondly
abstracts-words are represented on the factorial plane. Finally one
representation of word-years allows us to detect changes on the vocabulary
through the passing of time.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2016 18:06:26 GMT'}]",2016-06-14,"[['Barahona', 'Igor', ''], ['Hernandez', 'Daria Micaela', ''], ['Perez-Villarreal', 'Hector Hugo', '']]","['Marketing', 'Textual Statistics', 'Vocabulary evolving', 'Influential articles', 'Correspondence analysis']"
17688,1607.01205,David Novotn\'y,"David Novotny, Diane Larlus, Andrea Vedaldi",Learning the semantic structure of objects from Web supervision,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While recent research in image understanding has often focused on recognizing
more types of objects, understanding more about the objects is just as
important. Recognizing object parts and attributes has been extensively studied
before, yet learning large space of such concepts remains elusive due to the
high cost of providing detailed object annotations for supervision. The key
contribution of this paper is an algorithm to learn the nameable parts of
objects automatically, from images obtained by querying Web search engines. The
key challenge is the high level of noise in the annotations; to address it, we
propose a new unified embedding space where the appearance and geometry of
objects and their semantic parts are represented uniformly. Geometric
relationships are induced in a soft manner by a rich set of nonsemantic
mid-level anchors, bridging the gap between semantic and non-semantic parts. We
also show that the resulting embedding provides a visually-intuitive mechanism
to navigate the learned concepts and their corresponding images.
","[{'version': 'v1', 'created': 'Tue, 5 Jul 2016 11:56:31 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Dec 2021 14:59:48 GMT'}]",2021-12-03,"[['Novotny', 'David', ''], ['Larlus', 'Diane', ''], ['Vedaldi', 'Andrea', '']]","['object part detection', 'Web supervision', 'mid-level patches']"
17689,1008.1671,K. M. Azharul Hasan,"K. M. Azharul Hasan, Mohammad Sabbir Hasan","A Parsing Scheme for Finding the Design Pattern and Reducing the
  Development Cost of Reusable Object Oriented Software","15 pages, 5 figures","International journal of computer science & information Technology
  (IJCSIT), 2(3), 2010",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Because of the importance of object oriented methodologies, the research in
developing new measure for object oriented system development is getting
increased focus. The most of the metrics need to find the interactions between
the objects and modules for developing necessary metric and an influential
software measure that is attracting the software developers, designers and
researchers. In this paper a new interactions are defined for object oriented
system. Using these interactions, a parser is developed to analyze the existing
architecture of the software. Within the design model, it is necessary for
design classes to collaborate with one another. However, collaboration should
be kept to an acceptable minimum i.e. better designing practice will introduce
low coupling. If a design model is highly coupled, the system is difficult to
implement, to test and to maintain overtime. In case of enhancing software, we
need to introduce or remove module and in that case coupling is the most
important factor to be considered because unnecessary coupling may make the
system unstable and may cause reduction in the system's performance. So
coupling is thought to be a desirable goal in software construction, leading to
better values for external software qualities such as maintainability,
reusability and so on. To test this hypothesis, a good measure of class
coupling is needed. In this paper, based on the developed tool called Design
Analyzer we propose a methodology to reuse an existing system with the
objective of enhancing an existing Object oriented system keeping the coupling
as low as possible.
","[{'version': 'v1', 'created': 'Tue, 10 Aug 2010 09:23:09 GMT'}]",2010-08-11,"[['Hasan', 'K. M. Azharul', ''], ['Hasan', 'Mohammad Sabbir', '']]","['Coupling', 'Cohesion', 'Design Pattern', 'Object Oriented Paradigm', 'Principal Component Analysis', 'Reusable Software']"
17690,1401.8152,Dibakar Saha,"Dibakar Saha, Nabanita Das","Distributed Area Coverage by Connected Set Cover Partitioning in
  Wireless Sensor Networks",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Assuming a random uniform distribution of n sensor nodes over a virtual grid,
this paper addresses the problem of finding the maximum number of connected set
covers each ensuring 100% coverage of the query region. The connected sets
remain active one after another in a round robin fashion such that if there are
P such set covers, it can enhance the network lifetime P-fold. From
graph-theoretic point of view, a centralized O(n3) heuristic is proposed here
to maximize P. Next, for large self-organized sensor networks, a distributed
algorithm is developed. The proposed algorithm is to be executed just once,
during the initialization of the network. In case of failure, a distributed
recovery algorithm is executed to rearrange the partitions. Simulation studies
show that the performance of the proposed distributed algorithm is comparable
with that of the centralized algorithm in terms of number of partitions. Also,
comparison with earlier works shows significant improvement in terms of number
of partitions, message complexity and network lifetime.
","[{'version': 'v1', 'created': 'Fri, 31 Jan 2014 12:38:35 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Feb 2014 09:48:04 GMT'}]",2014-02-14,"[['Saha', 'Dibakar', ''], ['Das', 'Nabanita', '']]","['Sensor networks', 'area coverage', 'connectivity', 'partition']"
17691,1702.06167,Gustavo Maciel Dias Vieira,"Islene C. Garcia, Gustavo M. D. Vieira, Luiz E. Buzato",A Rollback in the History of Communication-Induced Checkpointing,Revised manuscript,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The literature on communication-induced checkpointing presents a family of
protocols that use logical clocks to control whether forced checkpoints must be
taken. Efficiency of these protocols is measured by how many forced checkpoints
are needed to ensure no checkpoint will be useless to the application; the
fewer forced checkpoints the better. For many years, HMNR, also called Fully
Informed (FI), was the most complex and efficient protocol of this family. The
Lazy-FI protocol applies a lazy strategy that defers the increase of logical
clocks, resulting in a protocol with better efficiency for distributed systems
where processes can take basic checkpoints at different rates. Recently, the
Fully Informed aNd Efficient (FINE) protocol was proposed using the same
control structures as FI, but with a stronger and, presumably better,
checkpoint-inducing condition. FINE and its lazy version, called Lazy-FINE,
would now be the most efficient checkpointing protocols based on logical
clocks. This paper reviews this family of protocols, proves a theorem on a
condition that must be enforced by all stronger versions of FI, and proves that
both FINE and Lazy-FINE do not guarantee the absence of useless checkpoints. As
a consequence, FI and Lazy-FI can be rolled back to the position of most
efficient protocols of this family of index-based checkpointing protocols.
","[{'version': 'v1', 'created': 'Mon, 20 Feb 2017 20:35:33 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Jun 2019 18:33:15 GMT'}]",2019-06-12,"[['Garcia', 'Islene C.', ''], ['Vieira', 'Gustavo M. D.', ''], ['Buzato', 'Luiz E.', '']]","['Reliability', 'Checkpointing/restart', 'Fault-tolerance']"
17692,1205.4889,Thomas Brihaye,"Thomas Brihaye, V\'eronique Bruy\`ere, Julie De Pril",On Equilibria in Quantitative Games with Reachability/Safety Objectives,Full version of the CSR 2010 proceedings paper,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study turn-based quantitative multiplayer non zero-sum
games played on finite graphs with both reachability and safety objectives. In
this framework a player with a reachability objective aims at reaching his own
goal as soon as possible, whereas a player with a safety objective aims at
avoiding his bad set or, if impossible, delaying its visit as long as possible.
We prove the existence of Nash equilibria with finite memory in quantitative
multiplayer reachability/safety games. Moreover, we prove the existence of
finite-memory secure equilibria for quantitative two-player reachability games.
","[{'version': 'v1', 'created': 'Tue, 22 May 2012 12:08:37 GMT'}]",2012-05-23,"[['Brihaye', 'Thomas', ''], ['Bruyère', 'Véronique', ''], ['De Pril', 'Julie', '']]","['Nash equilibrium', 'Turn-based quantitative game', 'Secure equilibrium', 'Reachability/Safety objectives']"
17693,1712.05990,Wiktor Daszczuk,"Bogdan Czejdo, Wiktor B. Daszczuk, Miko{\l}aj Baszun",Using Machine Learning to Enhance Vehicles Traffic in ATN (PRT) Systems,"6 pages, 3 figures","Autobusy-TEST vol. 18(2017), No. 12, pp. 1484-1489",,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses new techniques to enhance Automated Transit Networks
(ATN, previously called Personal Rapid Transit - PRT) based on Artificial
Intelligence tools. The main direction is improvement of the cooperation of
autonomous modules that use negotiation protocols, following the IoT paradigm.
One of the goals is to increase ATN system throughput by tuning up autonomous
vehicles cooperation. Machine learning (ML) was used to improve algorithms
designed by human programmers. We used ""existing controls"" corresponding to
near-optimal solutions and built refinement models to more accurately relate a
system's dynamics to its performance. A mechanism that mostly influences ATN
performance is Empty Vehicle Management (EVM). The algorithms designed by human
programmers was used: calls to empty vehicles for waiting passengers and
balancing based on reallocation of empty vehicles to achieve better regularity
of their settlement. In this paper we discuss how we can improve these
algorithms (and tune them to current conditions) by using ML to tailor
individual behavioral policies. Using ML techniques was possible because our
algorithm is based on a set of parameters. A number of weights and thresholds
could be tuned up to give better decisions on moving empty vehicles across the
track.
","[{'version': 'v1', 'created': 'Sat, 16 Dec 2017 17:01:40 GMT'}]",2017-12-19,"[['Czejdo', 'Bogdan', ''], ['Daszczuk', 'Wiktor B.', ''], ['Baszun', 'Mikołaj', '']]","['Automated Transit Networks', 'ATN traffic', 'Personal Rapid Transit', 'IoT', 'negotiation protocols', 'Machine']"
17694,1702.06335,Nitinder Mohan,Nitinder Mohan and Jussi Kangasharju,Edge-Fog Cloud: A Distributed Cloud for Internet of Things Computations,"Published in IEEE 2nd Conference on Cloudification of Internet of
  Things (CIoT) - 2016, Paris, France",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet of Things typically involves a significant number of smart sensors
sensing information from the environment and sharing it to a cloud service for
processing. Various architectural abstractions, such as Fog and Edge computing,
have been proposed to localize some of the processing near the sensors and away
from the central cloud servers. In this paper, we propose Edge-Fog Cloud which
distributes task processing on the participating cloud resources in the
network. We develop the Least Processing Cost First (LPCF) method for assigning
the processing tasks to nodes which provide the optimal processing time and
near optimal networking costs. We evaluate LPCF in a variety of scenarios and
demonstrate its effectiveness in finding the processing task assignments.
","[{'version': 'v1', 'created': 'Tue, 21 Feb 2017 11:32:34 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Mar 2017 10:39:51 GMT'}]",2017-03-08,"[['Mohan', 'Nitinder', ''], ['Kangasharju', 'Jussi', '']]","['Cloud Computing', 'Fog Computing', 'EdgeComputing', 'Internet of Things', 'Task Assignment']"
17695,1605.00621,Bahman Kalantari,Bahman Kalantari,"A Necessary and Sufficient Condition for Local Maxima of Polynomial
  Modulus Over Unit Disc","6 pages, 4 figures",,,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An important quantity associated with a complex polynomial $p(z)$ is $\Vert p
\Vert_\infty$, the maximum of its modulus over the unit disc $D$. We prove,
$z_* \in D$ is a local maximum of $|p(z)|$ if and only if $a_*$ satisfies,
$z_*=p(z_*)|p'(z_*)|/p'(z_*)|p(z_*)|$, i.e. it is proportional to its
corresponding Newton direction. This explicit formula gives rise to novel
iterative algorithms for computing $\Vert p \Vert_\infty$. We describe two such
algorithms, including a Newton-like method and present some visualization of
their performance.
","[{'version': 'v1', 'created': 'Mon, 2 May 2016 19:06:46 GMT'}]",2016-05-03,"[['Kalantari', 'Bahman', '']]","['Complex Polynomial', 'Infinity Norm', 'Fixed Point', 'Iterative Methods', 'Polynomiography']"
17696,1702.05607,Benjamin Rubinstein,"Maryam Fanaeepour, Benjamin I. P. Rubinstein",End-to-End Differentially-Private Parameter Tuning in Spatial Histograms,"13 pages, 11 figures",,,,cs.DB cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Differentially-private histograms have emerged as a key tool for location
privacy. While past mechanisms have included theoretical & experimental
analysis, it has recently been observed that much of the existing literature
does not fully provide differential privacy. The missing component, private
parameter tuning, is necessary for rigorous evaluation of these mechanisms.
Instead works frequently tune on training data to optimise parameters without
consideration of privacy; in other cases selection is performed arbitrarily and
independent of data, degrading utility. We address this open problem by
deriving a principled tuning mechanism that privately optimises data-dependent
error bounds. Theoretical results establish privacy and utility while extensive
experimentation demonstrates that we can practically achieve true end-to-end
privacy.
","[{'version': 'v1', 'created': 'Sat, 18 Feb 2017 12:43:46 GMT'}]",2017-02-21,"[['Fanaeepour', 'Maryam', ''], ['Rubinstein', 'Benjamin I. P.', '']]","['Diferential Privacy', 'Histograms', 'Location Privacy']"
17697,1802.08872,Hamid Hamraz,"Hamid Hamraz, Nathan B. Jacobs, Marco A. Contreras, and Chase H. Clark","Deep learning for conifer/deciduous classification of airborne LiDAR 3D
  point clouds representing individual trees",Under review as of the date of submission,,,,cs.LG cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this study was to investigate the use of deep learning for
coniferous/deciduous classification of individual trees from airborne LiDAR
data. To enable efficient processing by a deep convolutional neural network
(CNN), we designed two discrete representations using leaf-off and leaf-on
LiDAR data: a digital surface model with four channels (DSMx4) and a set of
four 2D views (4x2D). A training dataset of labeled tree crowns was generated
via segmentation of tree crowns, followed by co-registration with field data.
Potential mislabels due to GPS error or tree leaning were corrected using a
statistical ensemble filtering procedure. Because the training data was heavily
unbalanced (~8% conifers), we trained an ensemble of CNNs on random balanced
sub-samples of augmented data (180 rotational variations per instance). The
4x2D representation yielded similar classification accuracies to the DSMx4
representation (~82% coniferous and ~90% deciduous) while converging faster.
The data augmentation improved the classification accuracies, but more real
training instances (especially coniferous) likely results in much stronger
improvements. Leaf-off LiDAR data were the primary source of useful
information, which is likely due to the perennial nature of coniferous foliage.
LiDAR intensity values also proved to be useful, but normalization yielded no
significant improvements. Lastly, the classification accuracies of overstory
trees (~90%) were more balanced than those of understory trees (~90% deciduous
and ~65% coniferous), which is likely due to the incomplete capture of
understory tree crowns via airborne LiDAR. Automatic derivation of optimal
features via deep learning provide the opportunity for remarkable improvements
in prediction tasks where captured data are not friendly to human visual system
- likely yielding sub-optimal human-designed features.
","[{'version': 'v1', 'created': 'Sat, 24 Feb 2018 16:10:39 GMT'}]",2018-02-27,"[['Hamraz', 'Hamid', ''], ['Jacobs', 'Nathan B.', ''], ['Contreras', 'Marco A.', ''], ['Clark', 'Chase H.', '']]","['remote sensing', 'spatial representation', 'convolutional neural network', 'data fusion', 'unbalanced']"
17698,1003.3543,Saber Jafarizadeh,Saber Jafarizadeh,Fastest Distributed Consensus Problem on Fusion of Two Star Networks,"26 pages, 4 figures",,,,cs.IT cs.DC math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finding optimal weights for the problem of Fastest Distributed Consensus on
networks with different topologies has been an active area of research for a
number of years. Here in this work we present an analytical solution for the
problem of Fastest Distributed Consensus for a network formed from fusion of
two different symmetric star networks or in other words a network consists of
two different symmetric star networks which share the same central node. The
solution procedure consists of stratification of associated connectivity graph
of network and Semidefinite Programming (SDP), particularly solving the
slackness conditions, where the optimal weights are obtained by inductive
comparing of the characteristic polynomials initiated by slackness conditions.
Some numerical simulations are carried out to investigate the trade-off between
the parameters of two fused star networks, namely the length and number of
branches.
","[{'version': 'v1', 'created': 'Thu, 18 Mar 2010 10:25:51 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Mar 2010 16:57:59 GMT'}]",2010-03-29,"[['Jafarizadeh', 'Saber', '']]","['Fastest distributed consensus', 'Weight optimization', 'Sensor networks', 'Second largest']"
17699,1502.06344,Erik Rodner,"Clemens-Alexander Brust, Sven Sickert, Marcel Simon, Erik Rodner,
  Joachim Denzler","Convolutional Patch Networks with Spatial Prior for Road Detection and
  Urban Scene Understanding",VISAPP 2015 paper,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classifying single image patches is important in many different applications,
such as road detection or scene understanding. In this paper, we present
convolutional patch networks, which are convolutional networks learned to
distinguish different image patches and which can be used for pixel-wise
labeling. We also show how to incorporate spatial information of the patch as
an input to the network, which allows for learning spatial priors for certain
categories jointly with an appearance model. In particular, we focus on road
detection and urban scene understanding, two application areas where we are
able to achieve state-of-the-art results on the KITTI as well as on the
LabelMeFacade dataset.
  Furthermore, our paper offers a guideline for people working in the area and
desperately wandering through all the painstaking details that render training
CNs on image patches extremely difficult.
","[{'version': 'v1', 'created': 'Mon, 23 Feb 2015 08:47:37 GMT'}]",2015-02-24,"[['Brust', 'Clemens-Alexander', ''], ['Sickert', 'Sven', ''], ['Simon', 'Marcel', ''], ['Rodner', 'Erik', ''], ['Denzler', 'Joachim', '']]","['convolutional neural networks', 'patch classification', 'road detection', 'semantic segmentation', 'scene understanding', 'deep learning', 'context priming']"
17700,1402.1864,Massimiliano Pontil,"Andreas Maurer, Massimiliano Pontil, Bernardino Romera-Paredes","An Inequality with Applications to Structured Sparsity and Multitask
  Dictionary Learning",,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  From concentration inequalities for the suprema of Gaussian or Rademacher
processes an inequality is derived. It is applied to sharpen existing and to
derive novel bounds on the empirical Rademacher complexities of unit balls in
various norms appearing in the context of structured sparsity and multitask
dictionary learning or matrix factorization. A key role is played by the
largest eigenvalue of the data covariance matrix.
","[{'version': 'v1', 'created': 'Sat, 8 Feb 2014 16:39:30 GMT'}, {'version': 'v2', 'created': 'Sat, 7 Jun 2014 07:37:52 GMT'}]",2014-06-10,"[['Maurer', 'Andreas', ''], ['Pontil', 'Massimiliano', ''], ['Romera-Paredes', 'Bernardino', '']]","['Concentration inequalities', 'multitask learning', 'Rademacher complexity', 'riskbounds', 'structured sparsity']"
17701,1707.09252,Xuan Lu,"Huoran Li, Xuan Lu","Mining Device-Specific Apps Usage Patterns from Large-Scale Android
  Users",arXiv admin note: text overlap with arXiv:1702.05060,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When smartphones, applications (a.k.a, apps), and app stores have been widely
adopted by the billions, an interesting debate emerges: whether and to what
extent do device models influence the behaviors of their users? The answer to
this question is critical to almost every stakeholder in the smartphone app
ecosystem, including app store operators, developers, end-users, and network
providers. To approach this question, we collect a longitudinal data set of app
usage through a leading Android app store in China, called Wandoujia. The data
set covers the detailed behavioral profiles of 0.7 million (761,262) unique
users who use 500 popular types of Android devices and about 0.2 million
(228,144) apps, including their app management activities, daily network access
time, and network traffic of apps. We present a comprehensive study on
investigating how the choices of device models affect user behaviors such as
the adoption of app stores, app selection and abandonment, data plan usage,
online time length, the tendency to use paid/free apps, and the preferences to
choosing competing apps. Some significant correlations between device models
and app usage are derived, leading to important findings on the various user
behaviors. For example, users owning different device models have a substantial
diversity of selecting competing apps, and users owning lower-end devices spend
more money to purchase apps and spend more time under cellular network.
","[{'version': 'v1', 'created': 'Thu, 27 Jul 2017 07:47:55 GMT'}]",2017-07-31,"[['Li', 'Huoran', ''], ['Lu', 'Xuan', '']]","['Mobile apps', 'price effect', 'user behavior']"
17702,1507.01759,Anjali Radkar,"Anjali N. Radkar, S.S. Pawar","Mining high on-shelf utility itemsets with negative values from dynamic
  updated database","7 pages, 4 figures","International Journal of advanced studies in Computer Science and
  Engineering IJASCSE, Volume 4, Issue 6, pp.27-33,2015",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Utility mining emerged to overcome the limitations of frequent itemset mining
by considering the utility of an item. Utility of an item is based on user's
interest or preference. Recently, temporal data mining has become a core
technical data processing technique to deal with changing data. On-shelf
utility mining considers on-shelf time period of item and gets the accurate
utility values of itemsets in temporal database. In traditional on-shelf
utility mining, profits of all items in databases are considered as positive
values. However, in real applications, some items may have negative profit.
Most of the traditional algorithms are used to handle static database. In
practical situations, temporal databases are continually appended or updated.
High on-shelf utility itemsets needs to be updated. Re-running the temporal
mining algorithm every time is ineffective since it neglects previously
discovered itemsets. It repeats the work done previously. In this paper, an
effective algorithm is proposed to find high on-shelf utility itemsets with
negative values from the dynamic updated temporal database.
","[{'version': 'v1', 'created': 'Tue, 7 Jul 2015 11:40:47 GMT'}]",2015-07-08,"[['Radkar', 'Anjali N.', ''], ['Pawar', 'S. S.', '']]","['Data Mining', 'Dynamic Updated Database', 'High Utility Itemset Mining', 'On-shelf utility mining', 'Negative value', 'Utility Tree']"
17703,1304.7121,Jordi Arjona Aroca,"Jordi Arjona Aroca, Antonio Fernandez Anta, Miguel A. Mosteiro,
  Christopher Thraves and Lin Wang",Power-efficient Assignment of Virtual Machines to Physical Machines,,,,,cs.DS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by current trends in cloud computing, we study a version of the
generalized assignment problem where a set of virtual processors has to be
implemented by a set of identical processors. For literature consistency, we
say that a set of virtual machines (VMs) is assigned to a set of physical
machines (PMs). The optimization criteria is to minimize the power consumed by
all the PMs. We term the problem Virtual Machine Assignment (VMA). Crucial
differences with previous work include a variable number of PMs, that each VM
must be assigned to exactly one PM (i.e., VMs cannot be implemented
fractionally), and a minimum power consumption for each active PM. Such
infrastructure may be strictly constrained in the number of PMs or in the PMs'
capacity, depending on how costly (in terms of power consumption) is to add a
new PM to the system or to heavily load some of the existing PMs. Low usage or
ample budget yields models where PM capacity and/or the number of PMs may be
assumed unbounded for all practical purposes. We study 4 VMA problems depending
on whether the capacity or the number of PMs is bounded or not. Specifically,
we study hardness and online competitiveness for a variety of cases. To the
best of our knowledge, this is the first comprehensive study of the VMA problem
for this cost function.
","[{'version': 'v1', 'created': 'Fri, 26 Apr 2013 10:58:16 GMT'}, {'version': 'v2', 'created': 'Sun, 22 Sep 2013 21:02:45 GMT'}, {'version': 'v3', 'created': 'Tue, 10 Jun 2014 08:55:55 GMT'}]",2014-06-11,"[['Aroca', 'Jordi Arjona', ''], ['Anta', 'Antonio Fernandez', ''], ['Mosteiro', 'Miguel A.', ''], ['Thraves', 'Christopher', ''], ['Wang', 'Lin', '']]","['Cloud computing', 'generalized assignment', 'scheduling', 'load balancing']"
17704,1610.07948,Kwangsu Lee,Seunghwan Park and Dong Hoon Lee and Kwangsu Lee,Revocable Hierarchical Identity-Based Encryption from Multilinear Maps,30 pages,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In identity-based encryption (IBE) systems, an efficient key delegation
method to manage a large number of users and an efficient key revocation method
to handle the dynamic credentials of users are needed. Revocable hierarchical
IBE (RHIBE) can provide these two methods by organizing the identities of users
as a hierarchy and broadcasting an update key for non-revoked users per each
time period. To provide the key revocation functionality, previous RHIBE
schemes use a tree-based revocation scheme. However, this approach has an
inherent limitation such that the number of update key elements depends on the
number of revoked users.
  In this paper, we propose two new RHIBE schemes in multilinear maps that use
the public-key broadcast encryption scheme instead of using the tree-based
revocation scheme to overcome the mentioned limitation. In our first RHIBE
scheme, the number of private key elements and update key elements is reduced
to $O(\ell)$ and $O(\ell)$ respectively where $\ell$ is the depth of a
hierarchical identity. In our second RHIBE scheme, we can further reduce the
number of private key elements from $O(\ell)$ to $O(1)$.
","[{'version': 'v1', 'created': 'Tue, 25 Oct 2016 16:10:43 GMT'}]",2016-10-26,"[['Park', 'Seunghwan', ''], ['Lee', 'Dong Hoon', ''], ['Lee', 'Kwangsu', '']]","['Hierarchical identity-based encryption', 'Key revocation', 'Key delegation', 'Multilinear maps']"
17705,1207.4318,Bernd Hartke,Johannes M. Dieterich and Bernd Hartke,"Empirical review of standard benchmark functions using evolutionary
  global optimization","22 pages, 11 figures",,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We have employed a recent implementation of genetic algorithms to study a
range of standard benchmark functions for global optimization. It turns out
that some of them are not very useful as challenging test functions, since they
neither allow for a discrimination between different variants of genetic
operators nor exhibit a dimensionality scaling resembling that of real-world
problems, for example that of global structure optimization of atomic and
molecular clusters. The latter properties seem to be simulated better by two
other types of benchmark functions. One type is designed to be deceptive,
exemplified here by Lunacek's function. The other type offers additional
advantages of markedly increased complexity and of broad tunability in search
space characteristics. For the latter type, we use an implementation based on
randomly distributed Gaussians. We advocate the use of the latter types of test
functions for algorithm development and benchmarking.
","[{'version': 'v1', 'created': 'Wed, 18 Jul 2012 09:44:22 GMT'}]",2012-07-19,"[['Dieterich', 'Johannes M.', ''], ['Hartke', 'Bernd', '']]","['global optimization', 'genetic algorithms', 'benchmark functions', 'dimensionalityscaling', 'crossover operators']"
17706,1704.07075,Diego Perez Liebana Dr.,"Raluca D. Gaina and Jialin Liu and Simon M. Lucas and Diego
  Perez-Liebana","Analysis of Vanilla Rolling Horizon Evolution Parameters in General
  Video Game Playing",,"Applications of Evolutionary Computation, EvoApplications, Lecture
  Notes in Computer Science, vol. 10199, Springer, Cham., p. 418-434, 2017",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Monte Carlo Tree Search techniques have generally dominated General Video
Game Playing, but recent research has started looking at Evolutionary
Algorithms and their potential at matching Tree Search level of play or even
outperforming these methods. Online or Rolling Horizon Evolution is one of the
options available to evolve sequences of actions for planning in General Video
Game Playing, but no research has been done up to date that explores the
capabilities of the vanilla version of this algorithm in multiple games. This
study aims to critically analyse the different configurations regarding
population size and individual length in a set of 20 games from the General
Video Game AI corpus. Distinctions are made between deterministic and
stochastic games, and the implications of using superior time budgets are
studied. Results show that there is scope for the use of these techniques,
which in some configurations outperform Monte Carlo Tree Search, and also
suggest that further research in these methods could boost their performance.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 08:01:39 GMT'}]",2017-04-25,"[['Gaina', 'Raluca D.', ''], ['Liu', 'Jialin', ''], ['Lucas', 'Simon M.', ''], ['Perez-Liebana', 'Diego', '']]","['general video game playing', 'rolling horizon evolution', 'games', 'monte carlotree search', 'random search']"
17707,1402.4258,Bino Sebastian v,"V. Bino Sebastian, A Unnikrishnan, Kannan Balakrishnan, P. B Ramkumar",Morphological filtering on hypergraphs,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The focus of this article is to develop computationally efficient
mathematical morphology operators on hypergraphs. To this aim we consider
lattice structures on hypergraphs on which we build morphological operators. We
develop a pair of dual adjunctions between the vertex set and the hyper edge
set of a hypergraph H, by defining a vertex-hyperedge correspondence. This
allows us to recover the classical notion of a dilation/erosion of a subset of
vertices and to extend it to subhypergraphs of H. Afterward, we propose several
new openings, closings, granulometries and alternate sequential filters acting
(i) on the subsets of the vertex and hyperedge set of H and (ii) on the
subhypergraphs of a hypergraph.
","[{'version': 'v1', 'created': 'Tue, 18 Feb 2014 09:32:56 GMT'}]",2014-02-19,"[['Sebastian', 'V. Bino', ''], ['Unnikrishnan', 'A', ''], ['Balakrishnan', 'Kannan', ''], ['Ramkumar', 'P. B', '']]","['Hypergraphs', 'Mathematical Morphology', 'Complete Lattices', 'Adjunctions', 'Granulometries', 'Alternating Sequential Filters']"
17708,0801.0455,Jorg Liebeherr,"Jorg Liebeherr, Markus Fidler, Shahrokh Valaee",A System Theoretic Approach to Bandwidth Estimation,23 pages,,,,cs.NI cs.PF,,"  It is shown that bandwidth estimation in packet networks can be viewed in
terms of min-plus linear system theory. The available bandwidth of a link or
complete path is expressed in terms of a {\em service curve}, which is a
function that appears in the network calculus to express the service available
to a traffic flow. The service curve is estimated based on measurements of a
sequence of probing packets or passive measurements of a sample path of
arrivals. It is shown that existing bandwidth estimation methods can be derived
in the min-plus algebra of the network calculus, thus providing further
mathematical justification for these methods. Principal difficulties of
estimating available bandwidth from measurement of network probes are related
to potential non-linearities of the underlying network. When networks are
viewed as systems that operate either in a linear or in a non-linear regime, it
is argued that probing schemes extract the most information at a point when the
network crosses from a linear to a non-linear regime. Experiments on the Emulab
testbed at the University of Utah evaluate the robustness of the system
theoretic interpretation of networks in practice. Multi-node experiments
evaluate how well the convolution operation of the min-plus algebra provides
estimates for the available bandwidth of a path from estimates of individual
links.
","[{'version': 'v1', 'created': 'Thu, 3 Jan 2008 00:11:26 GMT'}]",2008-01-04,"[['Liebeherr', 'Jorg', ''], ['Fidler', 'Markus', ''], ['Valaee', 'Shahrokh', '']]","['Network Calculus', 'Bandwidth Estimation', 'Min-Plus Algebra']"
17709,1704.06823,Yingkai Li,"Jing Chen, Bo Li, Yingkai Li",Efficient Approximations for the Online Dispersion Problem,,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The dispersion problem has been widely studied in computational geometry and
facility location, and is closely related to the packing problem. The goal is
to locate n points (e.g., facilities or persons) in a k-dimensional polytope,
so that they are far away from each other and from the boundary of the
polytope. In many real-world scenarios however, the points arrive and depart at
different times, and decisions must be made without knowing future events.
Therefore we study, for the first time in the literature, the online dispersion
problem in Euclidean space.
  There are two natural objectives when time is involved: the all-time
worst-case (ATWC) problem tries to maximize the minimum distance that ever
appears at any time; and the cumulative distance (CD) problem tries to maximize
the integral of the minimum distance throughout the whole time interval.
Interestingly, the online problems are highly non-trivial even on a segment.
For cumulative distance, this remains the case even when the problem is
time-dependent but offline, with all the arriving and departure times given in
advance.
  For the online ATWC problem on a segment, we construct a deterministic
polynomial-time algorithm which is (2ln2+epsilon)-competitive, where epsilon>0
can be arbitrarily small and the algorithm's running time is polynomial in
1/epsilon. We show this algorithm is actually optimal. For the same problem in
a square, we provide a 1.591-competitive algorithm and a 1.183 lower-bound.
Furthermore, for arbitrary k-dimensional polytopes with k>=2, we provide a
2/(1-epsilon)-competitive algorithm and a 7/6 lower-bound. Interestingly, for
the offline CD problem in arbitrary k-dimensional polytopes, we provide a
polynomial-time black-box reduction to the online ATWC problem, and the
resulting competitive ratio increases by a factor of at most 2.
","[{'version': 'v1', 'created': 'Sat, 22 Apr 2017 17:29:58 GMT'}]",2017-04-25,"[['Chen', 'Jing', ''], ['Li', 'Bo', ''], ['Li', 'Yingkai', '']]","['dispersion', 'online algorithms', 'geometric optimization', 'packing', 'competitive algorithms']"
17710,1212.2064,Youssef Bassil,Youssef Bassil,"An Image Steganography Scheme using Randomized Algorithm and
  Context-Free Grammar","LACSC - Lebanese Association for Computational Sciences,
  http://www.lacsc.org","Journal of Advanced Computer Science and Technology (JACST), Vol.
  1, No. 4, pp. 291-305, 2012",,,cs.CR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Currently, cryptography is in wide use as it is being exploited in various
domains from data confidentiality to data integrity and message authentication.
Basically, cryptography shuffles data so that they become unreadable by
unauthorized parties. However, clearly visible encrypted messages, no matter
how unbreakable, will arouse suspicions. A better approach would be to hide the
very existence of the message using steganography. Fundamentally, steganography
conceals secret data into innocent-looking mediums called carriers which can
then travel from the sender to the receiver safe and unnoticed. This paper
proposes a novel steganography scheme for hiding digital data into uncompressed
image files using a randomized algorithm and a context-free grammar. Besides,
the proposed scheme uses two mediums to deliver the secret data: a carrier
image into which the secret data are hidden into random pixels, and a
well-structured English text that encodes the location of the random carrier
pixels. The English text is generated at runtime using a context-free grammar
coupled with a lexicon of English words. The proposed scheme is stealthy, and
hard to be noticed, detected, and recovered. Experiments conducted showed how
the covering and the uncovering processes of the proposed scheme work. As
future work, a semantic analyzer is to be developed so as to make the English
text medium semantically correct, and consequently safer to be transmitted
without drawing any attention.
","[{'version': 'v1', 'created': 'Mon, 10 Dec 2012 13:54:44 GMT'}]",2012-12-11,"[['Bassil', 'Youssef', '']]","['Computer Security', 'Information Hiding', 'Image Steganography', 'Randomized Algorithm', 'Context-Free Grammar']"
17711,1111.2018,Lionel Tabourier,"Bivas Mitra, Lionel Tabourier and Camille Roth",Intrinsically Dynamic Network Communities,"27 pages, 11 figures",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Community finding algorithms for networks have recently been extended to
dynamic data. Most of these recent methods aim at exhibiting community
partitions from successive graph snapshots and thereafter connecting or
smoothing these partitions using clever time-dependent features and sampling
techniques. These approaches are nonetheless achieving longitudinal rather than
dynamic community detection. We assume that communities are fundamentally
defined by the repetition of interactions among a set of nodes over time.
According to this definition, analyzing the data by considering successive
snapshots induces a significant loss of information: we suggest that it blurs
essentially dynamic phenomena - such as communities based on repeated
inter-temporal interactions, nodes switching from a community to another across
time, or the possibility that a community survives while its members are being
integrally replaced over a longer time period. We propose a formalism which
aims at tackling this issue in the context of time-directed datasets (such as
citation networks), and present several illustrations on both empirical and
synthetic dynamic networks. We eventually introduce intrinsically dynamic
metrics to qualify temporal community structure and emphasize their possible
role as an estimator of the quality of the community detection - taking into
account the fact that various empirical contexts may call for distinct
`community' definitions and detection criteria.
","[{'version': 'v1', 'created': 'Tue, 8 Nov 2011 19:12:43 GMT'}]",2011-11-09,"[['Mitra', 'Bivas', ''], ['Tabourier', 'Lionel', ''], ['Roth', 'Camille', '']]","['community detection', 'dynamic networks', 'citation networks', 'community quality metrics']"
17712,1406.3287,Matthew Mayo,Matthew Mayo,A Clustering Analysis of Tweet Length and its Relation to Sentiment,6 pages,,,,cs.CL cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sentiment analysis of Twitter data is performed. The researcher has made the
following contributions via this paper: (1) an innovative method for deriving
sentiment score dictionaries using an existing sentiment dictionary as seed
words is explored, and (2) an analysis of clustered tweet sentiment scores
based on tweet length is performed.
","[{'version': 'v1', 'created': 'Thu, 12 Jun 2014 17:01:10 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Jan 2015 14:07:35 GMT'}, {'version': 'v3', 'created': 'Wed, 18 Feb 2015 19:44:24 GMT'}]",2015-02-19,"[['Mayo', 'Matthew', '']]","['sentiment\xa0analysis', 'Twitter', 'Weka', 'clustering', 'machine\xa0learning', 'data\xa0mining', 'natural\xa0language\xa0processing']"
17713,1307.1893,Arindam Chaudhuri AC,"Arindam Chaudhuri, Kajal De, Dipak Chatterjee, Pabitra Mitra",Trapezoidal Fuzzy Numbers for the Transportation Problem,"International Journal of Intelligent Computing and Applications,
  Volume 1, Number 2, 2009",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transportation Problem is an important problem which has been widely studied
in Operations Research domain. It has been often used to simulate different
real life problems. In particular, application of this Problem in NP Hard
Problems has a remarkable significance. In this Paper, we present the closed,
bounded and non empty feasible region of the transportation problem using fuzzy
trapezoidal numbers which ensures the existence of an optimal solution to the
balanced transportation problem. The multivalued nature of Fuzzy Sets allows
handling of uncertainty and vagueness involved in the cost values of each cells
in the transportation table. For finding the initial solution of the
transportation problem we use the Fuzzy Vogel Approximation Method and for
determining the optimality of the obtained solution Fuzzy Modified Distribution
Method is used. The fuzzification of the cost of the transportation problem is
discussed with the help of a numerical example. Finally, we discuss the
computational complexity involved in the problem. To the best of our knowledge,
this is the first work on obtaining the solution of the transportation problem
using fuzzy trapezoidal numbers.
","[{'version': 'v1', 'created': 'Sun, 7 Jul 2013 18:32:23 GMT'}]",2013-07-09,"[['Chaudhuri', 'Arindam', ''], ['De', 'Kajal', ''], ['Chatterjee', 'Dipak', ''], ['Mitra', 'Pabitra', '']]","['Transportation Problem', 'Linear Programming Problem', 'Fuzzy trapezoidal numbers', 'Fuzzy Vogel’s Approximation Method', 'Fuzzy Modified Distribution Method']"
17714,1407.0286,Hoai An Le Thi,"Hoai An Le Thi, Tao Pham Dinh, Hoai Minh Le, Xuan Thanh Vo",DC approximation approaches for sparse optimization,35 pages,,,,cs.NA cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sparse optimization refers to an optimization problem involving the zero-norm
in objective or constraints. In this paper, nonconvex approximation approaches
for sparse optimization have been studied with a unifying point of view in DC
(Difference of Convex functions) programming framework. Considering a common DC
approximation of the zero-norm including all standard sparse inducing penalty
functions, we studied the consistency between global minimums (resp. local
minimums) of approximate and original problems. We showed that, in several
cases, some global minimizers (resp. local minimizers) of the approximate
problem are also those of the original problem. Using exact penalty techniques
in DC programming, we proved stronger results for some particular
approximations, namely, the approximate problem, with suitable parameters, is
equivalent to the original problem. The efficiency of several sparse inducing
penalty functions have been fully analyzed. Four DCA (DC Algorithm) schemes
were developed that cover all standard algorithms in nonconvex sparse
approximation approaches as special versions. They can be viewed as, an $\ell
_{1}$-perturbed algorithm / reweighted-$\ell _{1}$ algorithm / reweighted-$\ell
_{1}$ algorithm. We offer a unifying nonconvex approximation approach, with
solid theoretical tools as well as efficient algorithms based on DC programming
and DCA, to tackle the zero-norm and sparse optimization. As an application, we
implemented our methods for the feature selection in SVM (Support Vector
Machine) problem and performed empirical comparative numerical experiments on
the proposed algorithms with various approximation functions.
","[{'version': 'v1', 'created': 'Tue, 1 Jul 2014 15:45:05 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Jul 2014 08:28:33 GMT'}]",2014-07-23,"[['Thi', 'Hoai An Le', ''], ['Dinh', 'Tao Pham', ''], ['Le', 'Hoai Minh', ''], ['Vo', 'Xuan Thanh', '']]","['Global optimization', 'Sparse Optimization', 'DC Approximation function', 'DC Programming', 'DCA', 'Feature selection in SVM']"
17715,0709.1197,Avraham Trahtman N,A.N. Trahtman,"An efficient algorithm finds noticeable trends and examples concerning
  the \v{C}erny conjecture","MFCS06. LNCS 4162, 10 pages","Lectures Notes in Computer Science, 4162(2006), 789-80",,,cs.DM,,"  A word w is called synchronizing (recurrent, reset, directed) word of a
deterministic finite automaton (DFA) if w sends all states of the automaton on
a unique state. Jan Cerny had found in 1964 a sequence of n-state complete DFA
with shortest synchronizing word of length (n-1)^2. He had conjectured that it
is an upper bound for the length of the shortest synchronizing word for any
$n$-state complete DFA.
  The examples of DFA with shortest synchronizing word of length (n-1)^2 are
relatively rare. To the Cerny sequence were added in all examples of Cerny,
Piricka and Rosenauerova (1971), of Kari (2001) and of Roman (2004).
  By help of a program based on some effective algorithms, a wide class of
automata of size less than 11 was checked. The order of the algorithm finding
synchronizing word is quadratic for overwhelming majority of known to date
automata. Some new examples of n-state DFA with minimal synchronizing word of
length (n-1)^2 were discovered. The program recognized some remarkable trends
concerning the length of the minimal synchronizing word.
http://www.cs.biu.ac.il/~trakht/Testas.html
","[{'version': 'v1', 'created': 'Sat, 8 Sep 2007 10:07:52 GMT'}]",2007-09-11,"[['Trahtman', 'A. N.', '']]","['deterministic finite automaton', 'synchronizing word', 'algorithm', 'complexity', 'ˇCerny conjecture']"
17716,1702.04597,"Stefan D\""uck","Manfred Droste, Stefan D\""uck, Dino Mandrioli, Matteo Pradella",Weighted Operator Precedence Languages,"full version, 31 pages",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last years renewed investigation of operator precedence languages
(OPL) led to discover important properties thereof: OPL are closed with respect
to all major operations, are characterized, besides the original grammar
family, in terms of an automata family and an MSO logic; furthermore they
significantly generalize the well-known visibly pushdown languages (VPL). In
another area of research, quantitative models of systems are also greatly in
demand. In this paper, we lay the foundation to marry these two research
fields. We introduce weighted operator precedence automata and show how they
are both strict extensions of OPA and weighted visibly pushdown automata. We
prove a Nivat-like result which shows that quantitative OPL can be described by
unweighted OPA and very particular weighted OPA. In a B\""uchi-like theorem, we
show that weighted OPA are expressively equivalent to a weighted MSO-logic for
OPL.
","[{'version': 'v1', 'created': 'Wed, 15 Feb 2017 13:27:49 GMT'}]",2017-02-16,"[['Droste', 'Manfred', ''], ['Dück', 'Stefan', ''], ['Mandrioli', 'Dino', ''], ['Pradella', 'Matteo', '']]","['quantitative automata', 'operator precedence languages', 'VPL', 'quantitative logic']"
17717,0705.1284,Damien Chablat,"Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), Jean-Pierre Merlet
  (COPRIN)",Workspace Analysis of the Orthoglide using Interval Analysis,,"8th International Symposium on Advances in Robot Kinematics,
  Kluwer Academic Publishers (2002) 1-10",,,cs.RO,,"  This paper addresses the workspace analysis of the orthoglide, a 3-DOF
parallel mechanism designed for machining applications. This machine features
three fixed parallel linear joints which are mounted orthogonally and a mobile
platform which moves in the Cartesian x-y-z space with fixed orientation. The
workspace analysis is conducted on the bases of prescribed kinetostatic
performances. The interesting features of the orthoglide are a regular
Cartesian workspace shape, uniform performances in all directions and good
compactness. Interval analysis based methods for computing the dextrous
workspace and the largest cube enclosed in this workspace are presented.
","[{'version': 'v1', 'created': 'Wed, 9 May 2007 13:24:39 GMT'}]",2007-05-23,"[['Chablat', 'Damien', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN'], ['Merlet', 'Jean-Pierre', '', 'COPRIN']]","['Optimal design', 'Parallel Mechanism', 'Machining', 'Workspace', 'IntervalAnalysis', 'Transmission factor']"
17718,1610.04577,Kratika Tyagi,"Kratika Tyagi, Prof. Sanjeev Thakur",A Survey on Various Data Mining Techniques for ECG Meta Analysis,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data Mining is the process of examining the information from different point
of view and compressing it for the relevant data. This data can also be
utilized to build the incomes. Data Mining is also known as Data or Knowledge
Discovery. The basic purpose of data mining is to search patterns which have
minimal user inputs and efforts. Data Mining plays a very crucial role in the
various fields. There are various data mining procedures which can be connected
in different fields of innovation. By using data mining techniques, it is
observed that less time is taken for the prediction of any disease with more
accuracy. In this paper we would review various data mining techniques which
are categorized under classification, regression and clustering and apply these
algorithms over an ECG dataset. The purpose of this work is to determine the
most suitable data mining technique and use it to improve the accuracy of
analyzing ECG data for better decision making.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2016 11:41:23 GMT'}]",2016-10-17,"[['Tyagi', 'Kratika', ''], ['Thakur', 'Prof. Sanjeev', '']]","['Data Mining', 'Data Mining Techniques-Classification', 'Clustering', 'Regression', 'ECG']"
17719,1408.0023,Michael Winterrose,Michael L. Winterrose and Kevin M. Carter,"Strategic Evolution of Adversaries Against Temporal Platform Diversity
  Active Cyber Defenses",,"Proceedings of the Agent-Directed Simulation Symposium at the
  Spring Simulation Multiconference (2014): 68-76",,,cs.CR cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Adversarial dynamics are a critical facet within the cyber security domain,
in which there exists a co-evolution between attackers and defenders in any
given threat scenario. While defenders leverage capabilities to minimize the
potential impact of an attack, the adversary is simultaneously developing
countermeasures to the observed defenses. In this study, we develop a set of
tools to model the adaptive strategy formulation of an intelligent actor
against an active cyber defensive system. We encode strategies as binary
chromosomes representing finite state machines that evolve according to
Holland's genetic algorithm. We study the strategic considerations including
overall actor reward balanced against the complexity of the determined
strategies. We present a series of simulation results demonstrating the ability
to automatically search a large strategy space for optimal resultant fitness
against a variety of counter-strategies.
","[{'version': 'v1', 'created': 'Thu, 31 Jul 2014 20:32:09 GMT'}]",2014-08-19,"[['Winterrose', 'Michael L.', ''], ['Carter', 'Kevin M.', '']]","['cyber security', 'genetic algorithm', 'moving target', 'learning']"
17720,0711.2489,Michel Grabisch,"Pedro Miranda, Michel Grabisch (CES), Pedro Gil",Axiomatic structure of k-additive capacities,,Mathematical Social Sciences (2005) 153-178,,,cs.DM,,"  In this paper we deal with the problem of axiomatizing the preference
relations modelled through Choquet integral with respect to a $k$-additive
capacity, i.e. whose M\""obius transform vanishes for subsets of more than $k$
elements. Thus, $k$-additive capacities range from probability measures ($k=1$)
to general capacities ($k=n$). The axiomatization is done in several steps,
starting from symmetric 2-additive capacities, a case related to the Gini
index, and finishing with general $k$-additive capacities. We put an emphasis
on 2-additive capacities. Our axiomatization is done in the framework of social
welfare, and complete previous results of Weymark, Gilboa and Ben Porath, and
Gajdos.
","[{'version': 'v1', 'created': 'Thu, 15 Nov 2007 19:24:22 GMT'}]",2007-11-16,"[['Miranda', 'Pedro', '', 'CES'], ['Grabisch', 'Michel', '', 'CES'], ['Gil', 'Pedro', '']]","['axiomatic', 'capacities', 'k-additivity']"
17721,1410.2488,Ahmed Elgammal,Emily L. Spratt and Ahmed Elgammal,"Computational Beauty: Aesthetic Judgment at the Intersection of Art and
  Science",,,,,cs.CV physics.hist-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In part one of the Critique of Judgment, Immanuel Kant wrote that ""the
judgment of taste...is not a cognitive judgment, and so not logical, but is
aesthetic.""\cite{Kant} While the condition of aesthetic discernment has long
been the subject of philosophical discourse, the role of the arbiters of that
judgment has more often been assumed than questioned. The art historian,
critic, connoisseur, and curator have long held the esteemed position of the
aesthetic judge, their training, instinct, and eye part of the inimitable
subjective processes that Kant described as occurring upon artistic evaluation.
Although the concept of intangible knowledge in regard to aesthetic theory has
been much explored, little discussion has arisen in response to the development
of new types of artificial intelligence as a challenge to the seemingly
ineffable abilities of the human observer. This paper examines the developments
in the field of computer vision analysis of paintings from canonical movements
with the history of Western art and the reaction of art historians to the
application of this technology in the field. Through an investigation of the
ethical consequences of this innovative technology, the unquestioned authority
of the art expert is challenged and the subjective nature of aesthetic judgment
is brought to philosophical scrutiny once again.
","[{'version': 'v1', 'created': 'Tue, 30 Sep 2014 01:31:58 GMT'}]",2014-10-10,"[['Spratt', 'Emily L.', ''], ['Elgammal', 'Ahmed', '']]","['Computer Vision', 'Aesthetic Judgment', 'Aesthetic Theory', 'Critical Theory', 'Formalism']"
17722,1603.04046,Mina Masoudifar,Mina Masoudifar and Hamid Reza Pourreza,"Image and Depth from a Single Defocused Image Using Coded Aperture
  Photography","18 pages, 14 figures, submitted",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Depth from defocus and defocus deblurring from a single image are two
challenging problems that are derived from the finite depth of field in
conventional cameras. Coded aperture imaging is one of the techniques that is
used for improving the results of these two problems. Up to now, different
methods have been proposed for improving the results of either defocus
deblurring or depth estimation. In this paper, a multi-objective function is
proposed for evaluating and designing aperture patterns with the aim of
improving the results of both depth from defocus and defocus deblurring.
Pattern evaluation is performed by considering the scene illumination condition
and camera system specification. Based on the proposed criteria, a single
asymmetric pattern is designed that is used for restoring a sharp image and a
depth map from a single input. Since the designed pattern is asymmetric,
defocus objects on the two sides of the focal plane can be distinguished. Depth
estimation is performed by using a new algorithm, which is based on image
quality assessment criteria and can distinguish between blurred objects lying
in front or behind the focal plane. Extensive simulations as well as
experiments on a variety of real scenes are conducted to compare our aperture
with previously proposed ones.
","[{'version': 'v1', 'created': 'Sun, 13 Mar 2016 16:29:50 GMT'}]",2016-03-15,"[['Masoudifar', 'Mina', ''], ['Pourreza', 'Hamid Reza', '']]","['coded aperture', 'depth from defocus', 'defocus deblurring']"
17723,1802.09324,Malte Milatz,Malte Milatz,Random Walks on Polytopes of Constant Corank,"This is the full version with appendix of the conference paper with
  the same name presented at SOCG 2018",,,,cs.DM math.CO,http://creativecommons.org/licenses/by/4.0/,"  We show that the pivoting process associated with one line and $n$ points in
$r$-dimensional space may need $\Omega(\log^r n)$ steps in expectation as $n
\to \infty$. The only cases for which the bound was known previously were for
$r \le 3$. Our lower bound is also valid for the expected number of pivoting
steps in the following applications: (1) The Random-Edge simplex algorithm on
linear programs with $n$ constraints in $d = n - r$ variables; and (2) the
directed random walk on a grid polytope of corank $r$ with $n$ facets.
","[{'version': 'v1', 'created': 'Mon, 26 Feb 2018 14:37:29 GMT'}]",2018-02-27,"[['Milatz', 'Malte', '']]","['polytope', 'unique sink orientation', 'grid', 'random walk']"
17724,1505.02648,Waqar  Ahmed,Waqar Ahmed and Osman Hasan,Towards Formal Fault Tree Analysis using Theorem Proving,16,,,,cs.LO cs.AI cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fault Tree Analysis (FTA) is a dependability analysis technique that has been
widely used to predict reliability, availability and safety of many complex
engineering systems. Traditionally, these FTA-based analyses are done using
paper-and-pencil proof methods or computer simulations, which cannot ascertain
absolute correctness due to their inherent limitations. As a complementary
approach, we propose to use the higher-order-logic theorem prover HOL4 to
conduct the FTA-based analysis of safety-critical systems where accuracy of
failure analysis is a dire need. In particular, the paper presents a
higher-order-logic formalization of generic Fault Tree gates, i.e., AND, OR,
NAND, NOR, XOR and NOT and the formal verification of their failure probability
expressions. Moreover, we have formally verified the generic probabilistic
inclusion-exclusion principle, which is one of the foremost requirements for
conducting the FTA-based failure analysis of any given system. For illustration
purposes, we conduct the FTA-based failure analysis of a solar array that is
used as the main source of power for the Dong Fang Hong-3 (DFH-3) satellite.
","[{'version': 'v1', 'created': 'Fri, 8 May 2015 05:14:08 GMT'}]",2015-05-12,"[['Ahmed', 'Waqar', ''], ['Hasan', 'Osman', '']]","['Higher-order Logic', 'Probabilistic Analysis', 'Theorem Proving', 'Satellite’s Solar Arrays']"
17725,1208.4568,Stas  Verberkt,J. Slobbe and S.L.C. Verberkt,Hacktivists: Cyberterrorists or Online Activists?,,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The last decade, online activism has vastly grown. In the current digital
society, from time to time citizens decide to express their opinion by
attacking large corporations digitally in some way. Where the activists claim
this to be a digital assembly, others see it as criminal offences.
  In this paper, we will explore the legal and technical borders of the digital
right to assembly. By doing so, we can gain insight into digital manifestations
and make up the balance on the digital right to assembly. As an additional
contribution, we will discuss how the digital right to assembly could be
granted and which legal and technical requirements should be set for a digital
assembly.
","[{'version': 'v1', 'created': 'Sun, 22 Jul 2012 11:25:26 GMT'}]",2012-08-23,"[['Slobbe', 'J.', ''], ['Verberkt', 'S. L. C.', '']]","['Right to Assembly', 'Digital Assembly', 'Distributed Denial of Service (DDoS)', 'VirtualSit-In', 'Digital Blockade']"
17726,1212.3074,Jigyasu Dubey Mr.,"Jigyasu Dubey, Vrinda Tokekar","Identification of efficient peers in P2P computing system for real time
  applications","12 Pages, 3 figures",,,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Currently the Peer to Peer computing paradigm rises as an economic solution
for the large scale computation problems. However due to the dynamic nature of
peers it is very difficult to use this type of systems for the computations of
real time applications. Strict deadline of scientific and real time
applications require predictable performance in such applications. We propose
an algorithm to identify the group of reliable peers, from the available peers
on the Internet, for the processing of real time applications tasks. The
algorithm is based on joint evaluation of peer properties like peer
availability, credibility, computation time and the turnaround time of the peer
with respect to the task distributor peer. Here we also define a method to
calculate turnaround time on task distributor peers at application level.
","[{'version': 'v1', 'created': 'Thu, 13 Dec 2012 07:29:01 GMT'}]",2012-12-14,"[['Dubey', 'Jigyasu', ''], ['Tokekar', 'Vrinda', '']]","['Peer', 'P2P Networks', 'P2P Computing', 'Real Time Application']"
17727,1409.3771,Gerasimos Razis,Gerasimos Razis and Ioannis Anagnostopoulos,Semantifying Twitter: the influenceTracker ontology,arXiv admin note: text overlap with arXiv:1404.5239,,,,cs.SI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose an ontology schema towards semantification
provision of Twitter social analytics. The ontology is deployed over a publicly
available service that measures how influential a Twitter account is, by
combining its social activity and interaction over Twittersphere. Apart from
influential quantity and quality measures, the service provides a SPARQL
endpoint where users can perform advance semantic queries through the RDFized
Twitter entities (mentions, replies, hashtags, photos, URLs) over the semantic
graph.
","[{'version': 'v1', 'created': 'Fri, 12 Sep 2014 15:28:18 GMT'}]",2014-09-15,"[['Razis', 'Gerasimos', ''], ['Anagnostopoulos', 'Ioannis', '']]","['Semantics', 'Social Media', 'Twitter']"
17728,0711.1290,Willemien Visser,Willemien Visser (INRIA Rocquencourt),"Conception individuelle et collective. Approche de l'ergonomie cognitive
  [Individual and Collective Design. The Cognitive-Ergonomics Approach]",,"Cognition et cr\'eation. Explorations cognitives des processus de
  conception (Cognition and creation. Cognitive explorations of design
  processes) Mardaga (Ed.) (2002) 311-327",,,cs.OH,,"  This text presents the cognitive-ergonomics approach to design, in both its
individual and collective form. It focuses on collective design with respect to
individual design. The theoretical framework adopted is that of information
processing, specified for design problems. The cognitive characteristics of
design problems are presented: the effects of their ill-defined character and
of the different types of representation implemented in solving these problems,
amongst others the more or less ""satisficing"" character of the different
possible solutions. The text first describes the cognitive activities
implemented in both individual and collective design: different types of
control activities and of the executive activities of solution development and
evaluation. Specific collective-design characteristics are then presented:
co-design and distributed-design activities, temporo-operative and cognitive
synchronisation, and different types of argumentation, of co-designers'
intervention modes in the design process, of solution-proposals evaluation. The
paper concludes by a confrontation between the two types of design, individual
and collective.
","[{'version': 'v1', 'created': 'Thu, 8 Nov 2007 14:48:44 GMT'}]",2007-11-09,"[['Visser', 'Willemien', '', 'INRIA Rocquencourt']]","['Individual design', 'Collective design', 'Cognitive ergonomics', 'Cognitive psychology', 'Cognitive']"
17729,0909.3554,R Doomun,"Harsh K Verma, Abhishek Narain Singh, Raman Kumar","Robustness of the Digital Image Watermarking Techniques against
  Brightness and Rotation Attack","5 Pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS 2009, ISSN 1947 5500, Impact factor 0.423","Harsh K Verma, Abhishek Narain Singh, Raman Kumar, International
  Journal of Computer Science and Information Security, IJCSIS, Vol. 5, No. 1,
  September 2009, USA",,ISSN 1947 5500,cs.MM cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The recent advent in the field of multimedia proposed a many facilities in
transport, transmission and manipulation of data. Along with this advancement
of facilities there are larger threats in authentication of data, its licensed
use and protection against illegal use of data. A lot of digital image
watermarking techniques have been designed and implemented to stop the illegal
use of the digital multimedia images. This paper compares the robustness of
three different watermarking schemes against brightness and rotation attacks.
The robustness of the watermarked images has been verified on the parameters of
PSNR (Peak Signal to Noise Ratio), RMSE (Root Mean Square Error) and MAE (Mean
Absolute Error).
","[{'version': 'v1', 'created': 'Sat, 19 Sep 2009 03:06:57 GMT'}]",2009-09-22,"[['Verma', 'Harsh K', ''], ['Singh', 'Abhishek Narain', ''], ['Kumar', 'Raman', '']]","['Watermarking', 'Spread Spectrum', 'Fingerprinting', 'Copyright Protection']"
17730,1708.01286,Rafael S. Gon\c{c}alves,"Rafael S. Gon\c{c}alves, Martin J. O'Connor, Marcos Mart\'inez-Romero,
  John Graybeal and Mark A. Musen","Metadata in the BioSample Online Repository are Impaired by Numerous
  Anomalies",,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The metadata about scientific experiments are crucial for finding,
reproducing, and reusing the data that the metadata describe. We present a
study of the quality of the metadata stored in BioSample--a repository of
metadata about samples used in biomedical experiments managed by the U.S.
National Center for Biomedical Technology Information (NCBI). We tested whether
6.6 million BioSample metadata records are populated with values that fulfill
the stated requirements for such values. Our study revealed multiple anomalies
in the analyzed metadata. The BioSample metadata field names and their values
are not standardized or controlled--15% of the metadata fields use field names
not specified in the BioSample data dictionary. Only 9 out of 452
BioSample-specified fields ordinarily require ontology terms as values, and the
quality of these controlled fields is better than that of uncontrolled ones, as
even simple binary or numeric fields are often populated with inadequate values
of different data types (e.g., only 27% of Boolean values are valid). Overall,
the metadata in BioSample reveal that there is a lack of principled mechanisms
to enforce and validate metadata requirements. The aberrancies in the metadata
are likely to impede search and secondary use of the associated datasets.
","[{'version': 'v1', 'created': 'Thu, 3 Aug 2017 19:27:06 GMT'}]",2017-08-07,"[['Gonçalves', 'Rafael S.', ''], [""O'Connor"", 'Martin J.', ''], ['Martínez-Romero', 'Marcos', ''], ['Graybeal', 'John', ''], ['Musen', 'Mark A.', '']]","['Metadata', 'metadata quality', 'metadata repository', 'ontology', 'CEDAR']"
17731,1504.05451,Jing Yang,"Qingshan Liu, Jing Yang, Kaihua Zhang, Yi Wu","Adaptive Compressive Tracking via Online Vector Boosting Feature
  Selection",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, the compressive tracking (CT) method has attracted much attention
due to its high efficiency, but it cannot well deal with the large scale target
appearance variations due to its data-independent random projection matrix that
results in less discriminative features. To address this issue, in this paper
we propose an adaptive CT approach, which selects the most discriminative
features to design an effective appearance model. Our method significantly
improves CT in three aspects: Firstly, the most discriminative features are
selected via an online vector boosting method. Secondly, the object
representation is updated in an effective online manner, which preserves the
stable features while filtering out the noisy ones. Finally, a simple and
effective trajectory rectification approach is adopted that can make the
estimated location more accurate. Extensive experiments on the CVPR2013
tracking benchmark demonstrate the superior performance of our algorithm
compared over state-of-the-art tracking algorithms.
","[{'version': 'v1', 'created': 'Tue, 21 Apr 2015 14:55:07 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Apr 2015 01:27:08 GMT'}]",2015-04-23,"[['Liu', 'Qingshan', ''], ['Yang', 'Jing', ''], ['Zhang', 'Kaihua', ''], ['Wu', 'Yi', '']]","['tracking by detection', 'compressive tracking', 'feature template', 'model update']"
17732,1004.0056,Dai Tri Man Le,Dai Tri Man Le,"A Characterization of Combined Traces Using Labeled Stratified Order
  Structures","22 pages, preliminary version, some typos fixed.",,,,cs.DC cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper defines a class of labeled stratified order structures that
characterizes exactly the notion of combined traces (i.e., comtraces) proposed
by Janicki and Koutny in 1995. Our main technical contributions are the
representation theorems showing that comtrace quotient monoid, combined
dependency graph (Kleijn and Koutny 2008) and our labeled stratified order
structure characterization are three different and yet equivalent ways to
represent comtraces.
","[{'version': 'v1', 'created': 'Thu, 1 Apr 2010 05:22:13 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Apr 2010 20:59:28 GMT'}]",2010-04-13,"[['Le', 'Dai Tri Man', '']]","['causality theory of concurrency', 'combined traces monoids', 'step sequences', 'stratified order structures', 'label-preserving isomorphism']"
17733,1501.00923,Zaaloul Abdellah,"Abdellah Zaaloul, Mohamed Ben El Aattar, Mohamed Hanini, Abdelkrim
  Haqiq, and Mohammed Boulmalaf","Sharing Channel In IEEE 802.16 Using The Cooperative Model Of Slotted
  ALOHA","5 pages, 4 figures in International Journal of Computer &
  Organization Trends 2013",,,,cs.IT cs.NI math.IT,http://creativecommons.org/licenses/by/3.0/,"  One of the main problems in WIMAX is to share the medium by multiple users
who compete for access. Various random access mechanisms, such as ALOHA and its
corresponding variations have been widely studied as efficient methods to
coordinate the medium access among competing users. In this paper the slotted
ALOHA protocol is implemented as a two-state system. Using Markov Models, we
evaluate the channel utilization and we analyze the throughput under different
fairness conditions. The cooperative team problem is considered.
","[{'version': 'v1', 'created': 'Mon, 5 Jan 2015 16:57:45 GMT'}]",2015-01-06,"[['Zaaloul', 'Abdellah', ''], ['Aattar', 'Mohamed Ben El', ''], ['Hanini', 'Mohamed', ''], ['Haqiq', 'Abdelkrim', ''], ['Boulmalaf', 'Mohammed', '']]","['slotted ALOHA', 'Markov process', 'Mac protocol', 'cooperative game']"
17734,1107.1967,Gopalakrishnan Tr Nair,"T. R. Gopalakrishnan Nair, Kavitha Sooda","A Novel Adaptive Routing through Fitness Function Estimation Technique
  with Multiple QoS Parameters Compliance","4 pages, 3 figures, Fourth International Conference on Information
  Processing (ICIP- 2010), Proceedings pp 489-491, May 2010",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents a method which shows a significant improvement in
discovering the path over the distance vector protocol. The proposed method is
a multi-parameter QoS along with the fitness function which shows that it
overcomes the limitation of DV like routing loops by spanning tree approach,
count-to-infinity problem by decision attribute. The input considered is a
topology satisfying the QoS parameters of size 1 to 64 nodes and it was shown
that an optimal path selection was obtained efficiently over the classical
distance vector algorithm
","[{'version': 'v1', 'created': 'Mon, 11 Jul 2011 08:53:30 GMT'}]",2011-07-12,"[['Nair', 'T. R. Gopalakrishnan', ''], ['Sooda', 'Kavitha', '']]","['Distance Vector algorithm', 'fitness function estimation method', 'QoS', 'optimal path', 'routing']"
17735,1609.02954,Nhien-An Le-Khac,"Robert van Voorst, M-Tahar Kechadi, Nhien-An Le-Khac",Forensics Acquisition of IMVU: A Case Study,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are many applications available for personal computers and mobile
devices that facilitate users in meeting potential partners. There is, however,
a risk associated with the level of anonymity on using instant message
applications, because there exists the potential for predators to attract and
lure vulnerable users. Today Instant Messaging within a Virtual Universe (IMVU)
combines custom avatars, chat or instant message (IM), community, content
creation, commerce, and anonymity. IMVU is also being exploited by criminals to
commit a wide variety of offenses. However, there are very few researches on
digital forensic acquisition of IMVU applications. In this paper, we discuss
first of all on challenges of IMVU forensics. We present a forensic acquisition
of an IMVU 3D application as a case study. We also describe and analyse our
experiments with this application.
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2016 21:59:00 GMT'}]",2016-09-13,"[['van Voorst', 'Robert', ''], ['Kechadi', 'M-Tahar', ''], ['Le-Khac', 'Nhien-An', '']]","['Instant Messaging', 'forensic acquisition', 'Virtual Universe 3D', 'forensic process', 'forensic case study']"
17736,1109.1211,Ramya  C,"C. Ramya, and G. Kavitha","An Efficient Preprocessing Methodology for Discovering Patterns and
  Clustering of Web Users using a Dynamic ART1 Neural Network","6 pages; International Conference on Information Processing,
  august-2011",,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a complete preprocessing methodology for discovering patterns
in web usage mining process to improve the quality of data by reducing the
quantity of data has been proposed. A dynamic ART1 neural network clustering
algorithm to group users according to their Web access patterns with its neat
architecture is also proposed. Several experiments are conducted and the
results show the proposed methodology reduces the size of Web log files down to
73-82% of the initial size and the proposed ART1 algorithm is dynamic and
learns relatively stable quality clusters.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2011 15:19:48 GMT'}]",2011-09-07,"[['Ramya', 'C.', ''], ['Kavitha', 'G.', '']]","['Adaptive Resonance Theory (ART)', 'ART1 neural network', 'Clustering', 'Preprocessing', 'Web usage mining']"
17737,1207.6774,Revathi Rajendran,"A. R. Revathi, Dhananjay Kumar","A Survey Of Activity Recognition And Understanding The Behavior In Video
  Survelliance","14 pages, 5 figures, 5 tables",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a review of human activity recognition and behaviour
understanding in video sequence. The key objective of this paper is to provide
a general review on the overall process of a surveillance system used in the
current trend. Visual surveillance system is directed on automatic
identification of events of interest, especially on tracking and classification
of moving objects. The processing step of the video surveillance system
includes the following stages: Surrounding model, object representation, object
tracking, activity recognition and behaviour understanding. It describes
techniques that use to define a general set of activities that are applicable
to a wide range of scenes and environments in video sequence.
","[{'version': 'v1', 'created': 'Sun, 29 Jul 2012 13:07:09 GMT'}]",2012-07-31,"[['Revathi', 'A. R.', ''], ['Kumar', 'Dhananjay', '']]","['Segmentation', 'Objects Classification', 'Tracking', 'Behaviour understanding', 'Data Fusion']"
17738,1406.4840,David Castells-Rufas,"David Castells-Rufas, Jordi Carrabina, Pablo Gonz\'alez de Aledo
  Marug\'an, Pablo S\'anchez Espeso","Fast Trace Generation of Many-Core Embedded Systems with Native
  Simulation","Proceedings of HIP3ES Workshop, Vienna, January, 21st 2014",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Embedded Software development and optimization are complex tasks. Late
availably of hardware platforms, their usual low visibility and
controllability, and their limiting resource constraints makes early
performance estimation an attractive option instead of using the final
execution platform. With early performance estimation, software development can
progress although the real hardware is not yet available or it is too complex
to interact with. In this paper, we present how the native simulation framework
SCoPE is extended to generate OTF trace files. Those trace files can be later
visualized with trace visualization tools, which recently were only used to
optimize HPC workloads in order to iterate in the development process.
","[{'version': 'v1', 'created': 'Wed, 18 Jun 2014 18:59:45 GMT'}]",2014-06-19,"[['Castells-Rufas', 'David', ''], ['Carrabina', 'Jordi', ''], ['Marugán', 'Pablo González de Aledo', ''], ['Espeso', 'Pablo Sánchez', '']]","['Native simulation', 'Performance Analysis', 'Virtual Platforms']"
17739,1409.3941,Victor Magron,"Assal\'e Adj\'e, Victor Magron",Polynomial Template Generation using Sum-of-Squares Programming,"23 pages, 3 figures, 1 table",,,,cs.LO math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Template abstract domains allow to express more interesting properties than
classical abstract domains. However, template generation is a challenging
problem when one uses template abstract domains for program analysis. In this
paper, we relate template generation with the program properties that we want
to prove. We focus on one-loop programs with nested conditional branches. We
formally define the notion of well-representative template basis with respect
to such programs and a given property. The definition relies on the fact that
template abstract domains produce inductive invariants. We show that these
invariants can be obtained by solving certain systems of functional
inequalities. Then, such systems can be strengthened using a hierarchy of
sum-of-squares (SOS) problems when we consider programs written in polynomial
arithmetic. Each step of the SOS hierarchy can possibly provide a solution
which in turn yields an invariant together with a certificate that the desired
property holds. The interest of this approach is illustrated on nontrivial
program examples in polynomial arithmetic.
","[{'version': 'v1', 'created': 'Sat, 13 Sep 2014 12:34:10 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Oct 2014 14:14:26 GMT'}]",2014-10-21,"[['Adjé', 'Assalé', ''], ['Magron', 'Victor', '']]","['static analysis', 'abstract interpretation', 'template abstractdomains', 'sum-of-squares programming', 'piecewise discrete-time polynomial systems']"
17740,1409.7311,Matthijs van Leeuwen,Matthijs van Leeuwen and Antti Ukkonen,Estimating the pattern frequency spectrum inside the browser,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a browser application for estimating the number of frequent
patterns, in particular itemsets, as well as the pattern frequency spectrum.
The pattern frequency spectrum is defined as the function that shows for every
value of the frequency threshold $\sigma$ the number of patterns that are
frequent in a given dataset. Our demo implements a recent algorithm proposed by
the authors for finding the spectrum. The demo is 100% JavaScript, and runs in
all modern browsers. We observe that modern JavaScript engines can deliver
performance that makes it viable to run non-trivial data analysis algorithms in
browser applications.
","[{'version': 'v1', 'created': 'Thu, 25 Sep 2014 16:08:14 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Sep 2014 15:22:51 GMT'}]",2014-10-01,"[['van Leeuwen', 'Matthijs', ''], ['Ukkonen', 'Antti', '']]","['pattern mining', 'JavaScript', 'web browser']"
17741,1004.1746,Rdv Ijcsis,"S Qamar, Niranjan Lal, Mrityunjay Singh",Internet ware cloud computing :Challenges,"IEEE Publication format, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","IJCSIS, Vol. 7 No. 3, March 2010, 206-210",,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  After decades of engineering development and infrastructural investment,
Internet connections have become commodity product in many countries, and
Internet scale ""cloud computing"" has started to compete with traditional
software business through its technological advantages and economy of scale.
Cloud computing is a promising enabling technology of Internet ware Cloud
Computing is termed as the next big thing in the modern corporate world. Apart
from the present day software and technologies, cloud computing will have a
growing impact on enterprise IT and business activities in many large
organizations. This paper provides an insight to cloud computing, its impacts
and discusses various issues that business organizations face while
implementing cloud computing. Further, it recommends various strategies that
organizations need to adopt while migrating to cloud computing. The purpose of
this paper is to develop an understanding of cloud computing in the modern
world and its impact on organizations and businesses. Initially the paper
provides a brief description of the cloud computing model introduction and its
purposes. Further it discusses various technical and non-technical issues that
need to be overcome in order for the benefits of cloud computing to be realized
in corporate businesses and organizations. It then provides various
recommendations and strategies that businesses need to work on before stepping
into new technologies.
","[{'version': 'v1', 'created': 'Sat, 10 Apr 2010 22:17:18 GMT'}]",2010-04-13,"[['Qamar', 'S', ''], ['Lal', 'Niranjan', ''], ['Singh', 'Mrityunjay', '']]","['Distributed system', 'Distributing computing', 'cloud computing', 'issues and Challenges in cloud computing', 'Grid computing', 'Saa', 'Iaas', 'Paas']"
17742,1108.4547,William Harrison,William Harrison,Language Support for Declarative Future Commitments,,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sequential programming and work-flow programming are two useful, but
radically different, ways of describing computational processing. Of the two,
it is sequential programming that we teach all programmers and support by
programming languages, whether in procedural, objectoriented, or functional
paradigms. We teach workflow as a secondary style of problem decomposition for
use in special situations, like distributed or networked processing. Both
styles offer complementary advantages, but the fact that they employ radically
different models for ownership of continuations interferes with our ability to
integrate them in a way that allows them to be taught and used in a single
programming language. This paper describes a programming language construct,
declarative future commitments, that permit better integration of the two.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2011 10:44:28 GMT'}]",2011-08-24,"[['Harrison', 'William', '']]","['event-flow', 'broadcast', 'complex-event-processing', 'eventdriven programming']"
17743,1111.4729,Yanhua Li,Yanhua Li and Wei Chen and Yajun Wang and Zhi-Li Zhang,"Influence Diffusion Dynamics and Influence Maximization in Social
  Networks with Friend and Foe Relationships","27 pages, 23 figures, A short version appears in proceedings of the
  6th ACM International Conference on Web Search and Data Mining (WSDM 2013)",,,,cs.SI cs.DM physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Influence diffusion and influence maximization in large-scale online social
networks (OSNs) have been extensively studied, because of their impacts on
enabling effective online viral marketing. Existing studies focus on social
networks with only friendship relations, whereas the foe or enemy relations
that commonly exist in many OSNs, e.g., Epinions and Slashdot, are completely
ignored. In this paper, we make the first attempt to investigate the influence
diffusion and influence maximization in OSNs with both friend and foe
relations, which are modeled using positive and negative edges on signed
networks. In particular, we extend the classic voter model to signed networks
and analyze the dynamics of influence diffusion of two opposite opinions. We
first provide systematic characterization of both short-term and long-term
dynamics of influence diffusion in this model, and illustrate that the steady
state behaviors of the dynamics depend on three types of graph structures,
which we refer to as balanced graphs, anti-balanced graphs, and strictly
unbalanced graphs. We then apply our results to solve the influence
maximization problem and develop efficient algorithms to select initial seeds
of one opinion that maximize either its short-term influence coverage or
long-term steady state influence coverage. Extensive simulation results on both
synthetic and real-world networks, such as Epinions and Slashdot, confirm our
theoretical analysis on influence diffusion dynamics, and demonstrate the
efficacy of our influence maximization algorithm over other heuristic
algorithms.
","[{'version': 'v1', 'created': 'Mon, 21 Nov 2011 04:53:57 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Feb 2012 06:44:07 GMT'}, {'version': 'v3', 'created': 'Sat, 1 Dec 2012 06:05:18 GMT'}]",2012-12-04,"[['Li', 'Yanhua', ''], ['Chen', 'Wei', ''], ['Wang', 'Yajun', ''], ['Zhang', 'Zhi-Li', '']]","['Signed networks', 'voter model', 'influence maximization', 'social networks']"
17744,1502.05752,Zhiwu Lu,Zhenyong Fu and Zhiwu Lu,Pairwise Constraint Propagation: A Survey,,,,,cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As one of the most important types of (weaker) supervised information in
machine learning and pattern recognition, pairwise constraint, which specifies
whether a pair of data points occur together, has recently received significant
attention, especially the problem of pairwise constraint propagation. At least
two reasons account for this trend: the first is that compared to the data
label, pairwise constraints are more general and easily to collect, and the
second is that since the available pairwise constraints are usually limited,
the constraint propagation problem is thus important.
  This paper provides an up-to-date critical survey of pairwise constraint
propagation research. There are two underlying motivations for us to write this
survey paper: the first is to provide an up-to-date review of the existing
literature, and the second is to offer some insights into the studies of
pairwise constraint propagation. To provide a comprehensive survey, we not only
categorize existing propagation techniques but also present detailed
descriptions of representative methods within each category.
","[{'version': 'v1', 'created': 'Thu, 19 Feb 2015 23:59:48 GMT'}]",2015-02-23,"[['Fu', 'Zhenyong', ''], ['Lu', 'Zhiwu', '']]","['Pairwise constraint propagation', 'semi-supervised learning', 'constrained spectral']"
17745,1205.4572,Jing Liu,"Jing Liu, Fei Qiao, Qi Wei, Huazhong Yang","A Novel Video Compression Approach Based on Underdetermined Blind Source
  Separation",4 pages with 4 figures and 1 table,,,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper develops a new video compression approach based on underdetermined
blind source separation. Underdetermined blind source separation, which can be
used to efficiently enhance the video compression ratio, is combined with
various off-the-shelf codecs in this paper. Combining with MPEG-2, video
compression ratio could be improved slightly more than 33%. As for combing with
H.264, 4X~12X more compression ratio could be achieved with acceptable PSNR,
according to different kinds of video sequences.
","[{'version': 'v1', 'created': 'Mon, 21 May 2012 11:57:55 GMT'}]",2012-05-22,"[['Liu', 'Jing', ''], ['Qiao', 'Fei', ''], ['Wei', 'Qi', ''], ['Yang', 'Huazhong', '']]","['Underdetermined blind source separation', 'Sparse component analysis', 'Video surveillance system', 'Video compression']"
17746,1501.00728,Ahmed Ibrahim Taloba,"M. H. Marghny, Rasha M. Abd ElAziz, Ahmed I. Taloba","Differential Search Algorithm-based Parametric Optimization of Fuzzy
  Generalized Eigenvalue Proximal Support Vector Machine",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Support Vector Machine (SVM) is an effective model for many classification
problems. However, SVM needs the solution of a quadratic program which require
specialized code. In addition, SVM has many parameters, which affects the
performance of SVM classifier. Recently, the Generalized Eigenvalue Proximal
SVM (GEPSVM) has been presented to solve the SVM complexity. In real world
applications data may affected by error or noise, working with this data is a
challenging problem. In this paper, an approach has been proposed to overcome
this problem. This method is called DSA-GEPSVM. The main improvements are
carried out based on the following: 1) a novel fuzzy values in the linear case.
2) A new Kernel function in the nonlinear case. 3) Differential Search
Algorithm (DSA) is reformulated to find near optimal values of the GEPSVM
parameters and its kernel parameters. The experimental results show that the
proposed approach is able to find the suitable parameter values, and has higher
classification accuracy compared with some other algorithms.
","[{'version': 'v1', 'created': 'Sun, 4 Jan 2015 22:12:36 GMT'}]",2015-01-06,"[['Marghny', 'M. H.', ''], ['ElAziz', 'Rasha M. Abd', ''], ['Taloba', 'Ahmed I.', '']]","['Support Vector Machines', 'Generalized Eigenvalues', 'Proximal Classifier', 'Fuzzy Data Classification', 'Differential Search Algorithm', 'Kernel Function']"
17747,1704.04579,Nicole Radziwill,"Nicole M. Radziwill, Morgan C. Benton",Evaluating Quality of Chatbots and Intelligent Conversational Agents,"Software Quality Professional, June 2017",,,,cs.CY cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Chatbots are one class of intelligent, conversational software agents
activated by natural language input (which can be in the form of text, voice,
or both). They provide conversational output in response, and if commanded, can
sometimes also execute tasks. Although chatbot technologies have existed since
the 1960s and have influenced user interface development in games since the
early 1980s, chatbots are now easier to train and implement. This is due to
plentiful open source code, widely available development platforms, and
implementation options via Software as a Service (SaaS). In addition to
enhancing customer experiences and supporting learning, chatbots can also be
used to engineer social harm - that is, to spread rumors and misinformation, or
attack people for posting their thoughts and opinions online. This paper
presents a literature review of quality issues and attributes as they relate to
the contemporary issue of chatbot development and implementation. Finally,
quality assessment approaches are reviewed, and a quality assessment method
based on these attributes and the Analytic Hierarchy Process (AHP) is proposed
and examined.
","[{'version': 'v1', 'created': 'Sat, 15 Apr 2017 04:47:25 GMT'}]",2017-04-18,"[['Radziwill', 'Nicole M.', ''], ['Benton', 'Morgan C.', '']]","['chatbot', 'artificial intelligence', 'intelligent agents', 'usability', 'quality attributes', 'Analytic Hierarchy Process (AHP)   Introduction']"
17748,1610.03176,Md. Khaledur Rahman,Md. Khaledur Rahman,NEDindex: A new metric for community structure in networks,"In Proceedings of 18th ICCIT, Dhaka, Bangladesh",,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are several metrics (Modularity, Mutual Information, Conductance, etc.)
to evaluate the strength of graph clustering in large graphs. These metrics
have great significance to measure the effectiveness and they are often used to
find the strongly connected clusters with respect to the whole graph. In this
paper, we propose a new metric to evaluate the strength of graph clustering and
also study its applications. We show that our proposed metric has great
consistency which is similar to other metrics and easy to calculate. Our
proposed metric also shows consistency where other metrics fail in some special
cases. We demonstrate that our metric has reasonable strength while extracting
strongly connected communities in both simulated (in silico) data and real data
networks. We also show some comparative results of our proposed metric with
other popular metric(s) for Online Social Networks (OSN) and Gene Regulatory
Networks (GRN).
","[{'version': 'v1', 'created': 'Mon, 25 Jan 2016 13:22:59 GMT'}]",2016-10-12,"[['Rahman', 'Md. Khaledur', '']]","['Social network', 'Graph clustering', 'Community structure', 'Complex network']"
17749,1712.03622,George Philipp,"George Philipp, Ryen W. White",Interactions between Health Searchers and Search Engines,SIGIR 2014,,,,cs.IR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Web is an important resource for understanding and diagnosing medical
conditions. Based on exposure to online content, people may develop undue
health concerns, believing that common and benign symptoms are explained by
serious illnesses. In this paper, we investigate potential strategies to mine
queries and searcher histories for clues that could help search engines choose
the most appropriate information to present in response to exploratory medical
queries. To do this, we performed a longitudinal study of health search
behavior using the logs of a popular search engine. We found that query
variations which might appear innocuous (e.g. ""bad headache"" vs ""severe
headache"") may hold valuable information about the searcher which could be used
by search engines to improve performance. Furthermore, we investigated how
medically concerned users respond differently to search engine result pages
(SERPs) and find that their disposition for clicking on concerning pages is
pronounced, potentially leading to a self-reinforcement of concern. Finally, we
studied to which degree variations in the SERP impact future search and
real-world health-seeking behavior and obtained some surprising results (e.g.,
viewing concerning pages may lead to a short-term reduction of real-world
health seeking).
","[{'version': 'v1', 'created': 'Mon, 11 Dec 2017 01:44:54 GMT'}]",2017-12-12,"[['Philipp', 'George', ''], ['White', 'Ryen W.', '']]","['Health search', 'medical search', 'diagnosis', 'log/behavioral analysis', 'cyberchondria']"
17750,1501.05576,Salem Alkhalaf PhD,"Mohammed Amasha, Salem Alkhalaf","The effect of using facebook markup language (fbml) for designing an
  e-learning model in higher education","Mohammed Amasha, Salem Alkhalaf, ""The Effect of using Facebook Markup
  Language (FBML) for Designing an E-Learning Model in Higher Education"".
  International Journal of Research in Computer Science, 4 (5): pp. 1-9,
  January 2015",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study examines the use of Facebook Markup Language (FBML) to design an
e-learning model to facilitate teaching and learning in an academic setting.
The qualitative research study presents a case study on how, Facebook is used
to support collaborative activities in higher education. We used FBML to design
an e-learning model called processes for e-learning resources in the Specialist
Learning Resources Diploma (SLRD) program. Two groups drawn from the SLRD
program were used; First were the participants in the treatment group and
second in the control group. Statistical analysis in the form of a t-test was
used to compare the dependent variables between the two groups. The findings
show a difference in the mean score between the pre-test and the post-test for
the treatment group (achievement, the skill, trends). Our findings suggest that
the use of FBML can support collaborative knowledge creation and improved the
academic achievement of participatns. The findings are expected to provide
insights into promoting the use of Facebook in a learning management system
(LMS).
","[{'version': 'v1', 'created': 'Thu, 22 Jan 2015 17:05:57 GMT'}]",2015-01-23,"[['Amasha', 'Mohammed', ''], ['Alkhalaf', 'Salem', '']]","['Social network', 'Facebook', 'E-learning model', 'Teaching and learning', 'Web 2.0']"
17751,2007.05270,Edward Beeching,"Edward Beeching and Jilles Dibangoye and Olivier Simonin and Christian
  Wolf",Learning to plan with uncertain topological maps,ECCV 2020,,,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We train an agent to navigate in 3D environments using a hierarchical
strategy including a high-level graph based planner and a local policy. Our
main contribution is a data driven learning based approach for planning under
uncertainty in topological maps, requiring an estimate of shortest paths in
valued graphs with a probabilistic structure. Whereas classical symbolic
algorithms achieve optimal results on noise-less topologies, or optimal results
in a probabilistic sense on graphs with probabilistic structure, we aim to show
that machine learning can overcome missing information in the graph by taking
into account rich high-dimensional node features, for instance visual
information available at each location of the map. Compared to purely learned
neural white box algorithms, we structure our neural model with an inductive
bias for dynamic programming based shortest path algorithms, and we show that a
particular parameterization of our neural model corresponds to the Bellman-Ford
algorithm. By performing an empirical analysis of our method in simulated
photo-realistic 3D environments, we demonstrate that the inclusion of visual
features in the learned neural planner outperforms classical symbolic solutions
for graph based planning.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 09:28:30 GMT'}]",2020-07-13,"[['Beeching', 'Edward', ''], ['Dibangoye', 'Jilles', ''], ['Simonin', 'Olivier', ''], ['Wolf', 'Christian', '']]","['Visual navigation', 'topological maps', 'graph neural networks']"
17752,1301.6058,Edward Moroshko,"Edward Moroshko, Koby Crammer","Weighted Last-Step Min-Max Algorithm with Improved Sub-Logarithmic
  Regret",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In online learning the performance of an algorithm is typically compared to
the performance of a fixed function from some class, with a quantity called
regret. Forster proposed a last-step min-max algorithm which was somewhat
simpler than the algorithm of Vovk, yet with the same regret. In fact the
algorithm he analyzed assumed that the choices of the adversary are bounded,
yielding artificially only the two extreme cases. We fix this problem by
weighing the examples in such a way that the min-max problem will be well
defined, and provide analysis with logarithmic regret that may have better
multiplicative factor than both bounds of Forster and Vovk. We also derive a
new bound that may be sub-logarithmic, as a recent bound of Orabona et.al, but
may have better multiplicative factor. Finally, we analyze the algorithm in a
weak-type of non-stationary setting, and show a bound that is sub-linear if the
non-stationarity is sub-linear as well.
","[{'version': 'v1', 'created': 'Fri, 25 Jan 2013 15:09:39 GMT'}]",2013-01-28,"[['Moroshko', 'Edward', ''], ['Crammer', 'Koby', '']]","['Online learning', 'Regression', 'Min-max learning']"
17753,1609.01585,Aleksandr Cariow,Aleksandr Cariow and Galina Cariowa,"A Hardware-Efficient Approach to Computing the Rotation Matrix from a
  Quaternion","5 pages, 5 figures",,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we have proposed a novel VLSI-oriented approach to computing
the rotation matrix entries from the quaternion coefficients. The advantage of
this approach is the complete elimination of multiplications and replacing them
by less costly squarings. Our approach uses Logan's identity, which proposes to
replace the calculation of the product of two numbers on summing the squares
via the Binomial Theorem. Replacing multiplications by squarings implies
reducing power consumption as well as decreases hardware circuit complexity.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2016 14:54:26 GMT'}]",2016-09-07,"[['Cariow', 'Aleksandr', ''], ['Cariowa', 'Galina', '']]","['quaternions', 'Rotation matrix', 'Logan’s identity for number multiplication', 'computational algorithms']"
17754,1603.09701,Vida Ravanmehr,"Vida Ravanmehr, Gregory J. Puleo, Sadegh Bolouki, Olgica Milenkovic",Paired Threshold Graphs,,,,,cs.SI cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Threshold graphs are recursive deterministic network models that have been
proposed for describing certain economic and social interactions. One drawback
of this graph family is that it has limited generative attachment rules. To
mitigate this problem, we introduce a new class of graphs termed Paired
Threshold (PT) graphs described through vertex weights that govern the
existence of edges via two inequalities. One inequality imposes the constraint
that the sum of weights of adjacent vertices has to exceed a specified
threshold. The second inequality ensures that adjacent vertices have a weight
difference upper bounded by another threshold. We provide a conceptually simple
characterization and decomposition of PT graphs, analyze their forbidden
induced subgraphs and present a method for performing vertex weight assignments
on PT graphs that satisfy the defining constraints. Furthermore, we describe a
polynomial-time algorithm for recognizing PT graphs. We conclude our exposition
with an analysis of the intersection number, diameter and clustering
coefficient of PT graphs.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2016 18:09:15 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Jul 2016 22:09:29 GMT'}, {'version': 'v3', 'created': 'Wed, 23 May 2018 17:03:24 GMT'}]",2018-05-24,"[['Ravanmehr', 'Vida', ''], ['Puleo', 'Gregory J.', ''], ['Bolouki', 'Sadegh', ''], ['Milenkovic', 'Olgica', '']]","['Forbidden induced subgraphs', 'Polynomial-time graph recognitionalgorithms', 'Threshold graphs', 'Unit interval graphs']"
17755,1209.5561,Leto Peel,Leto Peel,Supervised Blockmodelling,Workshop on Collective Learning and Inference on Structured Data 2012,,,,cs.LG cs.SI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Collective classification models attempt to improve classification
performance by taking into account the class labels of related instances.
However, they tend not to learn patterns of interactions between classes and/or
make the assumption that instances of the same class link to each other
(assortativity assumption). Blockmodels provide a solution to these issues,
being capable of modelling assortative and disassortative interactions, and
learning the pattern of interactions in the form of a summary network. The
Supervised Blockmodel provides good classification performance using link
structure alone, whilst simultaneously providing an interpretable summary of
network interactions to allow a better understanding of the data. This work
explores three variants of supervised blockmodels of varying complexity and
tests them on four structurally different real world networks.
","[{'version': 'v1', 'created': 'Tue, 25 Sep 2012 09:59:56 GMT'}]",2012-09-26,"[['Peel', 'Leto', '']]","['Collective Classification', 'Supervised Learning', 'Blockmodelling', 'Node Classification', 'Statistical Network Analysis']"
17756,1306.4308,Zohra Sbai,"Zohra Sba\""i, Kamel Barkaoui",V\'erification Formelle des Processus Workflow Collaboratifs,"14 pages, 6 figures, In 1\`ere conf\'erence francophone sur les
  Syst\`emes Collaboratifs (SysCo), pp., 2012",,,,cs.SE cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a method of verification of collaborative workflow
processes based on model checking techniques. In particular, we propose to
verify soundness properties of these processes using SPIN model checker. First
we translate the adopted specification of workflows (i.e. the WF-net) to
Promela which is the description language of models to be verified by SPIN.
Then we express the soundness properties in Linear Temporal Logic (LTL) and use
SPIN to test whether each property is satisfied by the Promela model of the
WF-net in question. Finally, we express the properties of k-soundness for
WF-nets modeling multiple instances and (k,R)-soundness for workflow processes
with multiple instances and sharing resources.
","[{'version': 'v1', 'created': 'Tue, 18 Jun 2013 22:06:34 GMT'}]",2013-06-20,"[['Sbaï', 'Zohra', ''], ['Barkaoui', 'Kamel', '']]","['Model checking', 'collaborative workflow', 'SPIN', 'Linear TemporalLogic', 'resource contraints']"
17757,1108.5027,Maxime Amblard,Maxime Amblard (LORIA),"Encoding Phases using Commutativity and Non-commutativity in a Logical
  Framework","Logical Aspect of Computational Linguistic, Montpellier : France
  (2011)",,,,cs.CL cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents an extension of Minimalist Categorial Gram- mars (MCG)
to encode Chomsky's phases. These grammars are based on Par- tially Commutative
Logic (PCL) and encode properties of Minimalist Grammars (MG) of Stabler. The
first implementation of MCG were using both non- commutative properties (to
respect the linear word order in an utterance) and commutative ones (to model
features of different constituents). Here, we pro- pose to adding Chomsky's
phases with the non-commutative tensor product of the logic. Then we could give
account of the PIC just by using logical prop- erties of the framework.
","[{'version': 'v1', 'created': 'Thu, 25 Aug 2011 07:22:09 GMT'}]",2011-08-26,"[['Amblard', 'Maxime', '', 'LORIA']]","['type theory', 'syntax', 'linguistic modeling', 'generative theory', 'phase', 'Partially Commutative Logic']"
17758,1111.5108,Aswin Sankaranarayanan,Sriram Nagaraj and Aswin C. Sankaranarayanan and Richard G. Baraniuk,A Theory for Optical flow-based Transport on Image Manifolds,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An image articulation manifold (IAM) is the collection of images formed when
an object is articulated in front of a camera. IAMs arise in a variety of image
processing and computer vision applications, where they provide a natural
low-dimensional embedding of the collection of high-dimensional images. To date
IAMs have been studied as embedded submanifolds of Euclidean spaces.
Unfortunately, their promise has not been realized in practice, because real
world imagery typically contains sharp edges that render an IAM
non-differentiable and hence non-isometric to the low-dimensional parameter
space under the Euclidean metric. As a result, the standard tools from
differential geometry, in particular using linear tangent spaces to transport
along the IAM, have limited utility. In this paper, we explore a nonlinear
transport operator for IAMs based on the optical flow between images and
develop new analytical tools reminiscent of those from differential geometry
using the idea of optical flow manifolds (OFMs). We define a new metric for
IAMs that satisfies certain local isometry conditions, and we show how to use
this metric to develop a new tools such as flow fields on IAMs, parallel flow
fields, parallel transport, as well as a intuitive notion of curvature. The
space of optical flow fields along a path of constant curvature has a natural
multi-scale structure via a monoid structure on the space of all flow fields
along a path. We also develop lower bounds on approximation errors while
approximating non-parallel flow fields by parallel flow fields.
","[{'version': 'v1', 'created': 'Tue, 22 Nov 2011 05:55:25 GMT'}]",2011-11-23,"[['Nagaraj', 'Sriram', ''], ['Sankaranarayanan', 'Aswin C.', ''], ['Baraniuk', 'Richard G.', '']]","['Image articulation manifolds', 'Transport operators', 'Optical flow']"
17759,1208.3751,Fabi\'an Riquelme,"Xavier Molinero, Fabi\'an Riquelme, Maria Serna","Social Influence as a Voting System: a Complexity Analysis of Parameters
  and Properties",23 pages,,,,cs.GT cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a simple and altruistic multiagent system in which the agents are
eager to perform a collective task but where their real engagement depends on
the willingness to perform the task of other influential agents. We model this
scenario by an influence game, a cooperative simple game in which a team (or
coalition) of players succeeds if it is able to convince enough agents to
participate in the task (to vote in favor of a decision). We take the linear
threshold model as the influence model. We show first the expressiveness of
influence games showing that they capture the class of simple games. Then we
characterize the computational complexity of various problems on influence
games, including measures (length and width), values (Shapley-Shubik and
Banzhaf) and properties (of teams and players). Finally, we analyze those
problems for some particular extremal cases, with respect to the propagation of
influence, showing tighter complexity characterizations.
","[{'version': 'v1', 'created': 'Sat, 18 Aug 2012 15:08:22 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Aug 2012 14:03:24 GMT'}, {'version': 'v3', 'created': 'Fri, 7 Mar 2014 19:56:57 GMT'}]",2014-03-10,"[['Molinero', 'Xavier', ''], ['Riquelme', 'Fabián', ''], ['Serna', 'Maria', '']]","['Spread of influence', 'Simple games', 'Influence games', 'Computational complexity']"
17760,1409.6235,Shiry Ginosar,"Shiry Ginosar, Daniel Haas, Timothy Brown, and Jitendra Malik",Detecting People in Cubist Art,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although the human visual system is surprisingly robust to extreme distortion
when recognizing objects, most evaluations of computer object detection methods
focus only on robustness to natural form deformations such as people's pose
changes. To determine whether algorithms truly mirror the flexibility of human
vision, they must be compared against human vision at its limits. For example,
in Cubist abstract art, painted objects are distorted by object fragmentation
and part-reorganization, to the point that human vision often fails to
recognize them. In this paper, we evaluate existing object detection methods on
these abstract renditions of objects, comparing human annotators to four
state-of-the-art object detectors on a corpus of Picasso paintings. Our results
demonstrate that while human perception significantly outperforms current
methods, human perception and part-based models exhibit a similarly graceful
degradation in object detection performance as the objects become increasingly
abstract and fragmented, corroborating the theory of part-based object
representation in the brain.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 16:37:57 GMT'}]",2014-09-23,"[['Ginosar', 'Shiry', ''], ['Haas', 'Daniel', ''], ['Brown', 'Timothy', ''], ['Malik', 'Jitendra', '']]","['object detection', 'perception', 'abstract art', 'cubism']"
17761,1209.6405,Mehmet Donmez,"Mehmet A. Donmez, Huseyin A. Inan, Suleyman S. Kozat","Robust Estimation in Rayleigh Fading Channels Under Bounded Channel
  Uncertainties",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate channel equalization for Rayleigh fading channels under
bounded channel uncertainties. We analyze three robust methods to estimate an
unknown signal transmitted through a Rayleigh fading channel, where we avoid
directly tuning the equalizer parameters to the available inaccurate channel
information. These methods are based on minimizing certain mean-square error
criteria that incorporate the channel uncertainties into the problem
formulations. We present closed-form solutions to the channel equalization
problems for each method and for both zero mean and nonzero mean signals. We
illustrate the performances of the equalization methods through simulations.
","[{'version': 'v1', 'created': 'Fri, 28 Sep 2012 01:19:05 GMT'}]",2012-10-01,"[['Donmez', 'Mehmet A.', ''], ['Inan', 'Huseyin A.', ''], ['Kozat', 'Suleyman S.', '']]","['Channel equalization', 'Rayleigh fading', 'minimax', 'minimin', 'minimax regret']"
17762,1710.04142,Nishtha Madaan,"Nishtha Madaan, Sameep Mehta, Mayank Saxena, Aditi Aggarwal, Taneea S
  Agrawaal, Vrinda Malhotra","Bollywood Movie Corpus for Text, Images and Videos",,,,,cs.CY cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In past few years, several data-sets have been released for text and images.
We present an approach to create the data-set for use in detecting and removing
gender bias from text. We also include a set of challenges we have faced while
creating this corpora. In this work, we have worked with movie data from
Wikipedia plots and movie trailers from YouTube. Our Bollywood Movie corpus
contains 4000 movies extracted from Wikipedia and 880 trailers extracted from
YouTube which were released from 1970-2017. The corpus contains csv files with
the following data about each movie - Wikipedia title of movie, cast, plot
text, co-referenced plot text, soundtrack information, link to movie poster,
caption of movie poster, number of males in poster, number of females in
poster. In addition to that, corresponding to each cast member the following
data is available - cast name, cast gender, cast verbs, cast adjectives, cast
relations, cast centrality, cast mentions. We present some preliminary results
on the task of bias removal which suggest that the data-set is quite useful for
performing such tasks.
","[{'version': 'v1', 'created': 'Wed, 11 Oct 2017 15:51:13 GMT'}]",2017-10-12,"[['Madaan', 'Nishtha', ''], ['Mehta', 'Sameep', ''], ['Saxena', 'Mayank', ''], ['Aggarwal', 'Aditi', ''], ['Agrawaal', 'Taneea S', ''], ['Malhotra', 'Vrinda', '']]","['Bollywood Movie Corpus', 'Gender-bias detection', 'Gender-bias removal']"
17763,1004.0602,Secretary Aircc Journal,"N.Jaisankar(1), R.Saravanan(1), K. Durai Swamy(2), ((1)VIT University,
  India,(2)Dean, K.S.R.C.T., Tiruchengodu, India)",Intelligent Detection System framework using Mobile agents,17Pages,"International Journal of Network Security & Its Applications 1.2
  (2009) 72-88",,,cs.NI cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  An intrusion detection system framework using mobile agents is a layered
framework mechanism designed to support heterogeneous network environments to
identify intruders at its best. Traditional computer misuse detection
techniques can identify known attacks efficiently, but perform very poorly in
other cases. Anomaly detection has the potential to detect unknown attacks;
however, it is a very challenging task since its aim is to detect unknown
attacks without any priori knowledge about specific intrusions. This technology
is still at its early stage. The objective of this paper is that the system can
detect anomalous user activity. Existing research in this area focuses either
on user activity or on program operation but not on both simultaneously. In
this paper, an attempt to look at both concurrently is presented. Based on an
intrusion detection framework [1], a novel user anomaly detection system has
been implemented and conducted several intrusion detection experiments in a
simulated environment by analyzing user activity and program operation
activities. The proposed framework is a layered framework, which is designed to
satisfy the core purpose of IDS, and allows detecting the intrusion as quickly
as possible with available data using mobile agents. This framework was mainly
designed to provide security for the network using mobile agent mechanisms to
add mobility features to monitor the user processes from different
computational systems. The experimental results have shown that the system can
detect anomalous user activity effectively.
","[{'version': 'v1', 'created': 'Mon, 5 Apr 2010 09:39:51 GMT'}]",2010-07-15,"[['Jaisankar', 'N.', ''], ['Saravanan', 'R.', ''], ['Swamy', 'K. Durai', '']]","['Intrusion detection', 'anomaly detection', 'mobile agents', 'User profile']"
17764,1607.00554,Mikhail Volkov,Evgenija Bondar and Mikhail Volkov,Completely Reachable Automata,"23 pages, 12 figures. This is an expanded version of the conference
  paper published in C. Campeanu et al. (eds.), Descriptional Complexity of
  Formal Systems. DCFS 2016 [Lect. Notes Comp. Sci. 9777], Springer-Verlag,
  Berlin-Heidelberg-N.Y., 2016, 1-17",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a few results and several open problems concerning complete
deterministic finite automata in which every non-empty subset of the state set
occurs as the image of the whole state set under the action of a suitable input
word.
","[{'version': 'v1', 'created': 'Sat, 2 Jul 2016 19:50:20 GMT'}]",2016-07-05,"[['Bondar', 'Evgenija', ''], ['Volkov', 'Mikhail', '']]","['Deterministic finite automaton', 'Complete reachability', 'Transition monoid', 'Syntactic complexity', 'PSPACE-completeness']"
17765,1603.04953,Matthieu Vergne,Matthieu Vergne,"Mitigation Procedures to Rank Experts through Information Retrieval
  Measures","Technical report, 16 pages",,,,cs.IR,http://creativecommons.org/publicdomain/zero/1.0/,"  In order to find experts, different approaches build rankings of people,
assuming that they are ranked by level of expertise, and use typical
Information Retrieval (IR) measures to evaluate their effectiveness. However,
we figured out that expert rankings (i) tend to be partially ordered, (ii)
incomplete, and (iii) consequently provide more an order rather than absolute
ranks, which is not what usual IR measures exploit. To improve this state of
the art, we propose to revise the formalism used in IR to design proper
measures for comparing expert rankings. In this report, we investigate a first
step by providing mitigation procedures for the three issues, and we analyse IR
measures with the help of these procedures to identify interesting revisions
and remaining limitations. From this analysis, we see that most of the measures
can be exploited for this more generic context because of our mitigation
procedures. Moreover, measures based on precision and recall, usually unable to
consider the order of the ranked items, are of first interest if we represent a
ranking as a set of ordered pairs. Cumulative measures, on the other hand, are
specifically designed for considering the order but suffer from a higher
complexity, motivating the use of precision/recall measures with the right
representation.
","[{'version': 'v1', 'created': 'Wed, 16 Mar 2016 03:58:38 GMT'}]",2016-03-17,"[['Vergne', 'Matthieu', '']]","['Expert Recommendation', 'Information Retrieval', 'Design Evaluation']"
17766,1401.5111,Dave Stikkolorum,"Dave R. Stikkolorum, Michel R.V. Chaudron, Oswald de Bruin","The Art of Software Design, a Video Game for Learning Software Design
  Principles","Winning paper gamification contest at ACM/IEEE 15th International
  Conference on Model Driven Engineering Languages and Systems (Models 2012,
  Innsbruck)",,,,cs.HC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces our gamification of a part of our software design
curriculum. Based on typical design principles a motivating learning game is
developed to train students in software design. We use Bloom's taxonomy to
determine learning objectives. We keep the player engaged with direct feedback
in a challenging level based game with increasing complexity. Players can
evaluate their design actions with the help of the visualisation of control and
data flows. The main learning objective: applying design principles, fits the
game's main activity. This supports the learning by doing approach of
lecturers. A user test indicates possible learning effects and a playable game.
","[{'version': 'v1', 'created': 'Mon, 20 Jan 2014 22:36:27 GMT'}]",2014-01-22,"[['Stikkolorum', 'Dave R.', ''], ['Chaudron', 'Michel R. V.', ''], ['de Bruin', 'Oswald', '']]","['Gamification', 'Video Game', 'Education', 'Software Design', 'Modelling']"
17767,0708.2021,Juan J. Merelo Pr.,Juan J. Merelo and Carlos Cotta,"Who is the best connected EC researcher? Centrality analysis of the
  complex network of authors in evolutionary computation",Abstract accepted as poster to the GECCO 2007 conference,,,,cs.CY cs.NE,,"  Co-authorship graphs (that is, the graph of authors linked by co-authorship
of papers) are complex networks, which expresses the dynamics of a complex
system. Only recently its study has started to draw interest from the EC
community, the first paper dealing with it having been published two years ago.
In this paper we will study the co-authorship network of EC at a microscopic
level. Our objective is ascertaining which are the most relevant nodes (i.e.
authors) in it. For this purpose, we examine several metrics defined in the
complex-network literature, and analyze them both in isolation and combined
within a Pareto-dominance approach. The result of our analysis indicates that
there are some well-known researchers that appear systematically in top
rankings. This also provides some hints on the social behavior of our
community.
","[{'version': 'v1', 'created': 'Wed, 15 Aug 2007 10:13:03 GMT'}]",2007-08-16,"[['Merelo', 'Juan J.', ''], ['Cotta', 'Carlos', '']]","['Social networks', 'co-authorship networks', 'scientometrics', 'sociology of science', 'evolutionary computation', 'eigenvalues', 'Pareto front']"
17768,1501.03617,M. H. Marghny,"Marghny H. Mohamed, Yousef B. Mahdy, and Wafaa Abd El-Wahed Shaban",Confidential Algorithm for Golden Cryptography Using Haar Wavelet,,,,,cs.CR,http://creativecommons.org/licenses/by/3.0/,"  One of the most important consideration techniques when one want to solve the
protecting of digital signal is the golden matrix. The golden matrices can be
used for creation of a new kind of cryptography called the golden cryptography.
Many research papers have proved that the method is very fast and simple for
technical realization and can be used for cryptographic protection of digital
signals. In this paper, we introduce a technique of encryption based on
combination of haar wavelet and golden matrix. These combinations carry out
after compression data by adaptive Huffman code to reduce data size and remove
redundant data. This process will provide multisecurity services. In addition
Message Authentication Code (MAC) technique can be used to provide
authentication and the integrity of this scheme. The proposed scheme is
accomplished through five stages, the compression data, key generation,
encryption stage, the decryption stage and decompression at communication ends.
","[{'version': 'v1', 'created': 'Thu, 15 Jan 2015 10:07:05 GMT'}]",2015-01-16,"[['Mohamed', 'Marghny H.', ''], ['Mahdy', 'Yousef B.', ''], ['Shaban', 'Wafaa Abd El-Wahed', '']]","['Cryptography', 'Golden matrix', 'Adaptive Huffman Compression', 'Haar wavelet', 'Message Authentication Code(MAC)']"
17769,1110.3672,Daniele Theseider Dupr\'e,"Laura Giordano, Alberto Martelli, Daniele Theseider Dupr\'e",Reasoning about Actions with Temporal Answer Sets,To appear in Theory and Practice of Logic Programming,,,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we combine Answer Set Programming (ASP) with Dynamic Linear
Time Temporal Logic (DLTL) to define a temporal logic programming language for
reasoning about complex actions and infinite computations. DLTL extends
propositional temporal logic of linear time with regular programs of
propositional dynamic logic, which are used for indexing temporal modalities.
The action language allows general DLTL formulas to be included in domain
descriptions to constrain the space of possible extensions. We introduce a
notion of Temporal Answer Set for domain descriptions, based on the usual
notion of Answer Set. Also, we provide a translation of domain descriptions
into standard ASP and we use Bounded Model Checking techniques for the
verification of DLTL constraints.
","[{'version': 'v1', 'created': 'Mon, 17 Oct 2011 14:12:07 GMT'}]",2011-10-18,"[['Giordano', 'Laura', ''], ['Martelli', 'Alberto', ''], ['Dupré', 'Daniele Theseider', '']]","['Answer Set Programming', 'Temporal Logic', 'Bounded Model Checking']"
17770,1409.2651,Walter Quattrociocchi,"Alessandro Bessi, Guido Caldarelli, Michela Del Vicario, Antonio
  Scala, Walter Quattrociocchi",Social determinants of content selection in the age of (mis)information,"misinformation, collective narratives, crowd dynamics, information
  spreading",,,,cs.SI cs.CY physics.data-an physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the enthusiastic rhetoric about the so called \emph{collective
intelligence}, conspiracy theories -- e.g. global warming induced by chemtrails
or the link between vaccines and autism -- find on the Web a natural medium for
their dissemination. Users preferentially consume information according to
their system of beliefs and the strife within users of opposite narratives may
result in heated debates. In this work we provide a genuine example of
information consumption from a sample of 1.2 million of Facebook Italian users.
We show by means of a thorough quantitative analysis that information
supporting different worldviews -- i.e. scientific and conspiracist news -- are
consumed in a comparable way by their respective users. Moreover, we measure
the effect of the exposure to 4709 evidently false information (satirical
version of conspiracy theses) and to 4502 debunking memes (information aiming
at contrasting unsubstantiated rumors) of the most polarized users of
conspiracy claims. We find that either contrasting or teasing consumers of
conspiracy narratives increases their probability to interact again with
unsubstantiated rumors.
","[{'version': 'v1', 'created': 'Tue, 9 Sep 2014 09:43:44 GMT'}]",2014-09-10,"[['Bessi', 'Alessandro', ''], ['Caldarelli', 'Guido', ''], ['Del Vicario', 'Michela', ''], ['Scala', 'Antonio', ''], ['Quattrociocchi', 'Walter', '']]","['misinformation', 'collective narratives', 'crowd dynamics', 'information spreading']"
17771,1707.09629,Christos Mousas,"Christos Ouzounis, Alex Kilias, Christos Mousas","Kernel Projection of Latent Structures Regression for Facial Animation
  Retargeting",,,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Inspired by kernel methods that have been used extensively in achieving
efficient facial animation retargeting, this paper presents a solution to
retargeting facial animation in virtual character's face model based on the
kernel projection of latent structure (KPLS) regression between semantically
similar facial expressions. Specifically, a given number of corresponding
semantically similar facial expressions are projected into the latent space. By
using the Nonlinear Iterative Partial Least Square method, decomposition of the
latent variables is achieved. Finally, the KPLS is achieved by solving a
kernalized version of the eigenvalue problem. By evaluating our methodology
with other kernel-based solutions, the efficiency of the presented methodology
in transferring facial animation to face models with different morphological
variations is demonstrated.
","[{'version': 'v1', 'created': 'Sun, 30 Jul 2017 15:12:52 GMT'}]",2017-08-15,"[['Ouzounis', 'Christos', ''], ['Kilias', 'Alex', ''], ['Mousas', 'Christos', '']]","['facial animation', 'motion retargeting', 'KPLS']"
17772,1004.3351,Xiaolin Shi,"Xiaolin Shi, Jure Leskovec, Daniel A. McFarland",Citing for High Impact,"10 pages, 6 figures, 1 table",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The question of citation behavior has always intrigued scientists from
various disciplines. While general citation patterns have been widely studied
in the literature we develop the notion of citation projection graphs by
investigating the citations among the publications that a given paper cites. We
investigate how patterns of citations vary between various scientific
disciplines and how such patterns reflect the scientific impact of the paper.
We find that idiosyncratic citation patterns are characteristic for low impact
papers; while narrow, discipline-focused citation patterns are common for
medium impact papers. Our results show that crossing-community, or bridging
citation patters are high risk and high reward since such patterns are
characteristic for both low and high impact papers. Last, we observe that
recently citation networks are trending toward more bridging and
interdisciplinary forms.
","[{'version': 'v1', 'created': 'Tue, 20 Apr 2010 06:10:04 GMT'}]",2010-04-21,"[['Shi', 'Xiaolin', ''], ['Leskovec', 'Jure', ''], ['McFarland', 'Daniel A.', '']]","['Citation projection', 'citation networks', 'publication impact']"
17773,1712.05912,Thai Hoang Dinh DTH,"Dinh Thai Hoang, Dusit Niyato, Ping Wang, Antonio De Domenico and
  Emilio Calvanese Strinati",Optimal Cross Slice Orchestration for 5G Mobile Services,"6 pages, 6 figures, WCNC 2018 conference",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  5G mobile networks encompass the capabilities of hosting a variety of
services such as mobile social networks, multimedia delivery, healthcare,
transportation, and public safety. Therefore, the major challenge in designing
the 5G networks is how to support different types of users and applications
with different quality-of-service requirements under a single physical network
infrastructure. Recently, network slicing has been introduced as a promising
solution to address this challenge. Network slicing allows programmable network
instances which match the service requirements by using network virtualization
technologies. However, how to efficiently allocate resources across network
slices has not been well studied in the literature. Therefore, in this paper,
we first introduce a model for orchestrating network slices based on the
service requirements and available resources. Then, we propose a Markov
decision process framework to formulate and determine the optimal policy that
manages cross-slice admission control and resource allocation for the 5G
networks. Through simulation results, we show that the proposed framework and
solution are efficient not only in providing slice-as-a-service based on the
service requirements, but also in maximizing the provider's revenue.
","[{'version': 'v1', 'created': 'Sat, 16 Dec 2017 07:09:25 GMT'}]",2017-12-19,"[['Hoang', 'Dinh Thai', ''], ['Niyato', 'Dusit', ''], ['Wang', 'Ping', ''], ['De Domenico', 'Antonio', ''], ['Strinati', 'Emilio Calvanese', '']]","['5G networks', 'network slicing', 'Markov decisionprocesses', 'admission control']"
17774,1007.0412,Dimple Juneja Dr.,"Ujwalla Gawande, Mukesh Zaveri, Avichal Kapur",Improving Iris Recognition Accuracy By Score Based Fusion Method,http://ijict.org/index.php/ijoat/article/view/improving-iris-recognition,"International Journal of Advancements in Technology, Vol 1, No 1
  (2010)",,,cs.AI,http://creativecommons.org/licenses/by/3.0/,"  Iris recognition technology, used to identify individuals by photographing
the iris of their eye, has become popular in security applications because of
its ease of use, accuracy, and safety in controlling access to high-security
areas. Fusion of multiple algorithms for biometric verification performance
improvement has received considerable attention. The proposed method combines
the zero-crossing 1 D wavelet Euler number, and genetic algorithm based for
feature extraction. The output from these three algorithms is normalized and
their score are fused to decide whether the user is genuine or imposter. This
new strategies is discussed in this paper, in order to compute a multimodal
combined score.
","[{'version': 'v1', 'created': 'Thu, 1 Jul 2010 09:24:37 GMT'}]",2010-07-05,"[['Gawande', 'Ujwalla', ''], ['Zaveri', 'Mukesh', ''], ['Kapur', 'Avichal', '']]","['Iris', 'Score', 'Feature Extraction', 'Matching', 'Fusion']"
17775,1606.03509,Kirsten Ellis,"Kirsten Ellis, Julie Fisher, Louisa Willoughby and Jan Carlo Barca","A design science exploration of a visual-spatial learning system with
  feedback","Research-in-progress ISBN# 978-0-646-95337-3 Presented at the
  Australasian Conference on Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/201,cs.CY cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Our paper is research in progress that is research investigating the use of
games technology to enhance the learning of a physical skill. The Microsoft
Kinect is a system designed for gaming with the capability to track the
movement of users. Our research explored whether such a system could be used to
provide feedback when teaching sign vocabulary. Whilst there are technologies
available for teaching sign language, currently none provide feedback on the
accuracy of the users' attempts at making signs. In this paper we report how
the three-dimensional dsplay capability of the technology can enhance the
users' experience. Also, when using tracking to identify errors in physical
movements, how and when should feedback be given. A design science approach was
undertaken to find a solution to this real world problem. The design and
implementation of the solution provides interesting insights into how
technology can not only emulate but also improve upon traditional learning of
physical skills.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 00:21:04 GMT'}]",2016-06-14,"[['Ellis', 'Kirsten', ''], ['Fisher', 'Julie', ''], ['Willoughby', 'Louisa', ''], ['Barca', 'Jan Carlo', '']]","['(Sign Language', 'Microsoft Kinect', 'Design Science)']"
17776,1701.06119,Hiroshi Nagaoka,Hiroshi Nagaoka,The exponential family of Markov chains and its information geometry,"This work was presented in the 28th Symposium on Information Theory
  and Its Applications (SITA2005) in 2005","Proc. of the 28th Symposium on Information Theory and Its
  Applications, 2005 pp. 601-604,",,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a new definition of exponential family of Markov chains, and
show that many characteristic properties of the usual exponential family of
probability distributions are properly extended to Markov chains. The method of
information geometry is effectively applied to our framework, which enables us
to characterize the divergence rate of Markov chain from a differential
geometric viewpoint.
","[{'version': 'v1', 'created': 'Sun, 22 Jan 2017 03:58:33 GMT'}]",2017-01-24,"[['Nagaoka', 'Hiroshi', '']]","['exponential family', 'Markov chain', 'Markovprocess', 'information geometry']"
17777,1209.0863,Chang-Hun Lee,"Chang-Hun Lee, Tae-Hun Kim, and Min-Jea Tahk","Agile Missile Controller Based on Adaptive Nonlinear Backstepping
  Control","25 pages, 10 figures, 2 tables. The modified and improved version of
  this work has been accepted for publication in Transactions of the Japan
  Society for Aeronautical and Space Sciences","Transactions of the Japan Society for Aeronautical and Space
  Sciences, Vol. 57, No. 1, 2014, pp. 9-20",,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with a nonlinear adaptive autopilot design for agile missile
systems. In advance of the autopilot design, an investigation of the agile turn
maneuver, based on the trajectory optimization, is performed to determine state
behaviors during the agile turn phase. This investigation shows that there
exist highly nonlinear, rapidly changing dynamics and aerodynamic
uncertainties. To handle of these difficulties, we propose a longitudinal
autopilot for angle-of-attack tracking based on backstepping control
methodology in conjunction with the time-delay adaptation scheme.
","[{'version': 'v1', 'created': 'Wed, 5 Sep 2012 05:49:26 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Jan 2013 05:58:07 GMT'}, {'version': 'v3', 'created': 'Mon, 2 Sep 2013 12:28:40 GMT'}, {'version': 'v4', 'created': 'Wed, 4 Sep 2013 14:53:18 GMT'}, {'version': 'v5', 'created': 'Mon, 20 Jan 2014 14:48:15 GMT'}]",2014-01-21,"[['Lee', 'Chang-Hun', ''], ['Kim', 'Tae-Hun', ''], ['Tahk', 'Min-Jea', '']]","['Agile missile', 'missile autopilot', 'backstepping control', 'adaptive control', 'time-delay adaptation']"
17778,1604.08202,Ke Li,Ke Li and Jitendra Malik,Amodal Instance Segmentation,"23 pages, 14 figures; European Conference on Computer Vision (ECCV),
  2016",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of amodal instance segmentation, the objective of
which is to predict the region encompassing both visible and occluded parts of
each object. Thus far, the lack of publicly available amodal segmentation
annotations has stymied the development of amodal segmentation methods. In this
paper, we sidestep this issue by relying solely on standard modal instance
segmentation annotations to train our model. The result is a new method for
amodal instance segmentation, which represents the first such method to the
best of our knowledge. We demonstrate the proposed method's effectiveness both
qualitatively and quantitatively.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2016 19:56:11 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Aug 2016 19:13:04 GMT'}]",2016-08-18,"[['Li', 'Ke', ''], ['Malik', 'Jitendra', '']]","['instance segmentation', 'amodal completion', 'occlusion reasoning']"
17779,0805.0149,Guangwu Xu,"T. Tony Cai, Guangwu Xu, and Jun Zhang",On Recovery of Sparse Signals via $\ell_1$ Minimization,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article considers constrained $\ell_1$ minimization methods for the
recovery of high dimensional sparse signals in three settings: noiseless,
bounded error and Gaussian noise. A unified and elementary treatment is given
in these noise settings for two $\ell_1$ minimization methods: the Dantzig
selector and $\ell_1$ minimization with an $\ell_2$ constraint. The results of
this paper improve the existing results in the literature by weakening the
conditions and tightening the error bounds. The improvement on the conditions
shows that signals with larger support can be recovered accurately. This paper
also establishes connections between restricted isometry property and the
mutual incoherence property. Some results of Candes, Romberg and Tao (2006) and
Donoho, Elad, and Temlyakov (2006) are extended.
","[{'version': 'v1', 'created': 'Thu, 1 May 2008 20:25:27 GMT'}]",2008-05-05,"[['Cai', 'T. Tony', ''], ['Xu', 'Guangwu', ''], ['Zhang', 'Jun', '']]","['Dantzig selector', 'ℓ1 minimization', 'Lasso', 'overcomplete representation', 'sparserecovery', 'sparsity']"
17780,1401.4063,Maciej Cytowski Mr,Jakub Katarzy\'nski and Maciej Cytowski,Towards Autotuning of OpenMP Applications on Multicore Architectures,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we describe an autotuning tool for optimization of OpenMP
applications on highly multicore and multithreaded architectures. Our work was
motivated by in-depth performance analysis of scientific applications and
synthetic benchmarks on IBM Power 775 architecture. The tool provides an
automatic code instrumentation of OpenMP parallel regions. Based on measurement
of chosen hardware performance counters the tool decides on the number of
parallel threads that should be used for execution of chosen code fragments.
","[{'version': 'v1', 'created': 'Thu, 16 Jan 2014 15:30:17 GMT'}]",2014-01-17,"[['Katarzyński', 'Jakub', ''], ['Cytowski', 'Maciej', '']]","['autotuning', 'code instrumentation', 'parallel computing', 'OpenMP']"
17781,1603.05955,Yin Yin,"Yin Yin, Sergei V. Fotin, Hrishikesh Haldankar, Jeffrey W.
  Hoffmeister, and Senthil Periaswamy","Transferring Learned Microcalcification Group Detection from 2D
  Mammography to 3D Digital Breast Tomosynthesis Using a Hierarchical Model and
  Scope-based Normalization Features",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel hierarchical model is introduced to solve a general problem of
detecting groups of similar objects. Under this model, detection of groups is
performed in hierarchically organized layers while each layer represents a
scope for target objects. The processing of these layers involves sequential
extraction of appearance features for an individual object, consistency
measurement features for nearby objects, and finally the distribution features
for all objects within the group. Using the concept of scope-based
normalization, the extracted features not only enhance local contrast of an
individual object, but also provide consistent characterization for all related
objects. As an example, a microcalcification group detection system for 2D
mammography was developed, and then the learned model was transferred to 3D
digital breast tomosynthesis without any retraining or fine-tuning. The
detection system demonstrated state-of-the-art performance and detected 96% of
cancerous lesions at the rate of 1.2 false positives per volume as measured on
an independent tomosynthesis test set.
","[{'version': 'v1', 'created': 'Fri, 18 Mar 2016 18:46:36 GMT'}]",2016-03-21,"[['Yin', 'Yin', ''], ['Fotin', 'Sergei V.', ''], ['Haldankar', 'Hrishikesh', ''], ['Hoffmeister', 'Jeffrey W.', ''], ['Periaswamy', 'Senthil', '']]","['Computer-aided detection', 'tomosynthesis', 'transfer learning']"
17782,1712.05913,Thai Hoang Dinh DTH,"Dinh Thai Hoang, Dusit Niyato, Ping Wang, Shaun Shuxun Wang, Diep
  Nguyen, and Eryk Dutkiewicz","A Stochastic Programming Approach for Risk Management in Mobile Cloud
  Computing","6 pages, 4 figures, 4 tables, WCNC 2018 conference",,,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The development of mobile cloud computing has brought many benefits to mobile
users as well as cloud service providers. However, mobile cloud computing is
facing some challenges, especially security-related problems due to the growing
number of cyberattacks which can cause serious losses. In this paper, we
propose a dynamic framework together with advanced risk management strategies
to minimize losses caused by cyberattacks to a cloud service provider. In
particular, this framework allows the cloud service provider to select
appropriate security solutions, e.g., security software/hardware implementation
and insurance policies, to deal with different types of attacks. Furthermore,
the stochastic programming approach is adopted to minimize the expected total
loss for the cloud service provider under its financial capability and
uncertainty of attacks and their potential losses. Through numerical
evaluation, we show that our approach is an effective tool in not only dealing
with cyberattacks under uncertainty, but also minimizing the total loss for the
cloud service provider given its available budget.
","[{'version': 'v1', 'created': 'Sat, 16 Dec 2017 07:18:46 GMT'}]",2017-12-19,"[['Hoang', 'Dinh Thai', ''], ['Niyato', 'Dusit', ''], ['Wang', 'Ping', ''], ['Wang', 'Shaun Shuxun', ''], ['Nguyen', 'Diep', ''], ['Dutkiewicz', 'Eryk', '']]","['Cyber insurance', 'cybersecurity', 'cloud services', 'mobile cloud', 'stochastic programming']"
17783,1607.03039,Salma Sadat Mahdavi,"Mohammad Ghodsi, Salma Sadat Mahdavi, and Ali Narenji Sheshkalani",Clearing an Orthogonal Polygon Using Sliding Robots,"11 pages, 6 figures",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a multi-robot system, a number of autonomous robots would sense,
communicate, and decide to move within a given domain to achieve a common goal.
In this paper, we consider a new variant of the pursuit-evasion problem in
which the robots (pursuers) each move back and forth along an orthogonal line
segment inside a simple orthogonal polygon $P$. A point $p$ can be covered by a
sliding robot that moves along a line segment s, if there exists a point $q\in
s$ such that $\overline{pq}$ is a line segment perpendicular to $s$. In the
pursuit-evasion problem, a polygonal region is given and a robot called a
pursuer tries to find some mobile targets called evaders. The goal of this
problem is to design a motion strategy for the pursuer such that it can detect
all the evaders. We assume that $P$ includes unpredictable, moving evaders that
have unbounded speed. We propose a motion-planning algorithm for a group of
sliding robots, assuming that they move along the pre-located line segments
with a constant speed to detect all the evaders with unbounded speed.
","[{'version': 'v1', 'created': 'Mon, 11 Jul 2016 17:09:53 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Aug 2016 19:53:52 GMT'}]",2016-08-16,"[['Ghodsi', 'Mohammad', ''], ['Mahdavi', 'Salma Sadat', ''], ['Sheshkalani', 'Ali Narenji', '']]","['Computational Geometry', 'Motion Planning', 'Pursuit Evasion', 'MultiRobot Systems', 'Sliding Robots']"
17784,1512.01952,Kamila Barylska,Kamila Barylska and Edward Ochma\'nski,"Hierarchy of persistence with respect to the length of action's
  disability",,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The notion of persistence, based on the rule ""no action can disable another
one"" is one of the classical notions in concurrency theory. It is also one of
the issues discussed in the Petri net theory. We recall two ways of
generalization of this notion: the first is ""no action can kill another one""
(called l/l-persistence) and the second ""no action can kill another enabled
one"" (called the delayed persistence, or shortly e/l-persistence). Afterwards
we introduce a more precise notion, called e/l-k-persistence, in which one
action disables another one for no longer than a specified number k of single
sequential steps. Then we consider an infinite hie\-rarchy of such e/l-k
persistencies. We prove that if an action is disabled, and not killed, by
another one, it can not be postponed indefinitely. Afterwards, we investigate
the set of markings in which two actions are enabled simultaneously, and also
the set of reachable markings with that feature. We show that the minimum of
the latter is finite and effectively computable. Finally we deal with decision
problems about e/l-k persistencies. We show that all the kinds of e/l-k
persistencies are decidable with respect to steps, markings and nets.
","[{'version': 'v1', 'created': 'Mon, 7 Dec 2015 09:29:07 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Mar 2016 14:31:26 GMT'}]",2016-03-23,"[['Barylska', 'Kamila', ''], ['Ochmański', 'Edward', '']]","['Petri nets', 'concurrency', 'persistence', 'decision problems']"
17785,1712.04927,Siddharth Srivastava,"Aarushi Agrawal, Prerana Mukherjee, Siddharth Srivastava, Brejesh Lall",Enhanced Characterness for Text Detection in the Wild,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Text spotting is an interesting research problem as text may appear at any
random place and may occur in various forms. Moreover, ability to detect text
opens the horizons for improving many advanced computer vision problems. In
this paper, we propose a novel language agnostic text detection method
utilizing edge enhanced Maximally Stable Extremal Regions in natural scenes by
defining strong characterness measures. We show that a simple combination of
characterness cues help in rejecting the non text regions. These regions are
further fine-tuned for rejecting the non-textual neighbor regions.
Comprehensive evaluation of the proposed scheme shows that it provides
comparative to better generalization performance to the traditional methods for
this task.
","[{'version': 'v1', 'created': 'Mon, 4 Dec 2017 08:44:35 GMT'}]",2017-12-14,"[['Agrawal', 'Aarushi', ''], ['Mukherjee', 'Prerana', ''], ['Srivastava', 'Siddharth', ''], ['Lall', 'Brejesh', '']]","['Text detection', 'HOG', 'enhanced MSER', 'stroke width']"
17786,1312.5225,Benjamin Tams,Johannes Merkle and Benjamin Tams,"Security of the Improved Fuzzy Vault Scheme in the Presence of Record
  Multiplicity (Full Version)",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dodis et al. proposed an improved version of the fuzzy vault scheme, one of
the most popular primitives used in biometric cryptosystems, requiring less
storage and leaking less information. Recently, Blanton and Aliasgari have
shown that the relation of two improved fuzzy vault records of the same
individual may be determined by solving a system of non-linear equations.
However, they conjectured that this is feasible for small parameters only. In
this paper, we present a new attack against the improved fuzzy vault scheme
based on the extended Euclidean algorithm that determines if two records are
related and recovers the elements by which the protected features, e.g., the
biometric templates, differ. Our theoretical and empirical analysis
demonstrates that the attack is very effective and efficient for practical
parameters. Furthermore, we show how this attack can be extended to fully
recover both feature sets from related vault records much more efficiently than
possible by attacking each record individually. We complement this work by
deriving lower bounds for record multiplicity attacks and use these to show
that our attack is asymptotically optimal in an information theoretic sense.
Finally, we propose remedies to harden the scheme against record multiplicity
attacks.
","[{'version': 'v1', 'created': 'Wed, 18 Dec 2013 17:08:22 GMT'}, {'version': 'v2', 'created': 'Sun, 22 Dec 2013 13:44:00 GMT'}, {'version': 'v3', 'created': 'Sat, 11 Jan 2014 17:48:40 GMT'}, {'version': 'v4', 'created': 'Sun, 5 Oct 2014 14:20:56 GMT'}]",2014-10-07,"[['Merkle', 'Johannes', ''], ['Tams', 'Benjamin', '']]","['fuzzy vault scheme', 'record multiplicity attack', 'cross-matching']"
17787,1802.06321,Paul Ralph,"Paul Ralph, Briony J. Oates",The Dangerous Dogmas of Software Engineering,12 pages,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To legitimize itself as a scientific discipline, the software engineering
academic community must let go of its non-empirical dogmas. A dogma is belief
held regardless of evidence. This paper analyzes the nature and detrimental
effects of four software engineering dogmas - 1) the belief that software has
""requirements""; 2) the division of software engineering tasks into analysis,
design, coding and testing; 3) the belief that software engineering is
predominantly concerned with designing ""software"" systems; 4) the belief that
software engineering follows methods effectively. Deconstructing these dogmas
reveals that they each oversimplify and over-rationalize aspects of software
engineering practice, which obscures underlying phenomena and misleads
researchers and practitioners. Evidenced-based practice is analyzed as a means
to expose and repudiate non-empirical dogmas. This analysis results in several
novel recommendations for overcoming the practical challenges of evidence-based
practice.
","[{'version': 'v1', 'created': 'Sun, 18 Feb 2018 02:23:43 GMT'}]",2018-02-20,"[['Ralph', 'Paul', ''], ['Oates', 'Briony J.', '']]","['Empiricism', 'Empirical Software Engineering', 'Evidenced-Based Software Engineering', 'Requirements', 'Methods']"
17788,1104.5566,Stefan Szeider,Stefan Szeider,Limits of Preprocessing,"This is a slightly longer version of a paper that appeared in the
  proceedings of AAAI 2011",,,,cs.AI cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a first theoretical analysis of the power of polynomial-time
preprocessing for important combinatorial problems from various areas in AI. We
consider problems from Constraint Satisfaction, Global Constraints,
Satisfiability, Nonmonotonic and Bayesian Reasoning. We show that, subject to a
complexity theoretic assumption, none of the considered problems can be reduced
by polynomial-time preprocessing to a problem kernel whose size is polynomial
in a structural problem parameter of the input, such as induced width or
backdoor size. Our results provide a firm theoretical boundary for the
performance of polynomial-time preprocessing algorithms for the considered
problems.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2011 08:31:41 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Aug 2011 15:53:23 GMT'}]",2011-08-12,"[['Szeider', 'Stefan', '']]","['Fixed-Parameter Tractability', 'Constraint Satisfaction', 'Global Constraints', 'Satisfiability', 'Bayesian Networks', 'Normal Logic Programs', 'Computational Complexity']"
17789,1304.7852,Gobithaasan Rudrusamy,"K. T. Miura, R. Shirahata, S. Agari, S. Usuki, R.U. Gobithaasan","Variational Formulation of the Log-Aesthetic Surface and Development of
  Discrete Surface Filters",,"2012 Computer Aided Design & Application, Vol.9 (6), Pg.901-914",,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The log-aesthetic curves include the logarithmic (equiangular) spiral,
clothoid, and involute curves. Although most of them are expressed only by an
integral form of the tangent vector, it is possible to interactively generate
and deform them and they are expected to be utilized for practical use of
industrial and graphical design. The discrete log-aesthetic filter based on the
formulation of the log-aesthetic curve has successfully been introduced not to
impose strong constraints on the designer's activity, to let him/her design
freely and to embed the properties of the log-aesthetic curves for complicated
ones with both increasing and decreasing curvature. In this paper, in order to
define the log-aesthetic surface and develop surface filters based on its
formulation, at first we reformulate the log-aesthetic curve with variational
principle. Then we propose several new functionals to be minimized for
free-form surfaces and define the log-aesthetic surface. Furthermore we propose
new discrete surface filters based on the log-aesthetic surface formulation
","[{'version': 'v1', 'created': 'Tue, 30 Apr 2013 03:41:31 GMT'}]",2013-05-01,"[['Miura', 'K. T.', ''], ['Shirahata', 'R.', ''], ['Agari', 'S.', ''], ['Usuki', 'S.', ''], ['Gobithaasan', 'R. U.', '']]","['log-aesthetic surface', 'log-aesthetic curve', 'variational principle', 'digital filter', 'discrete curve and surface']"
17790,1802.06194,Praveen Krishnan,Praveen Krishnan and C.V. Jawahar,"HWNet v2: An Efficient Word Image Representation for Handwritten
  Documents","20 pages, 14 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a framework for learning an efficient holistic representation for
handwritten word images. The proposed method uses a deep convolutional neural
network with traditional classification loss. The major strengths of our work
lie in: (i) the efficient usage of synthetic data to pre-train a deep network,
(ii) an adapted version of the ResNet-34 architecture with the region of
interest pooling (referred to as HWNet v2) which learns discriminative features
for variable sized word images, and (iii) a realistic augmentation of training
data with multiple scales and distortions which mimics the natural process of
handwriting. We further investigate the process of transfer learning to reduce
the domain gap between synthetic and real domain, and also analyze the
invariances learned at different layers of the network using visualization
techniques proposed in the literature.
  Our representation leads to a state-of-the-art word spotting performance on
standard handwritten datasets and historical manuscripts in different languages
with minimal representation size. On the challenging IAM dataset, our method is
first to report an mAP of around 0.90 for word spotting with a representation
size of just 32 dimensions. Furthermore, we also present results on printed
document datasets in English and Indic scripts which validates the generic
nature of the proposed framework for learning word image representation.
","[{'version': 'v1', 'created': 'Sat, 17 Feb 2018 05:12:03 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Mar 2019 09:07:02 GMT'}]",2019-03-20,"[['Krishnan', 'Praveen', ''], ['Jawahar', 'C. V.', '']]","['Word image representation', 'handwrittenand historical documents', 'word spotting', 'convolutionalneural networks']"
17791,1504.05046,Eduard Valeyev,Justus A. Calvin and Edward F. Valeev,"Task-Based Algorithm for Matrix Multiplication: A Step Towards
  Block-Sparse Tensor Computing","submitted to SC15 (9 pages, 8 figures)",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed-memory matrix multiplication (MM) is a key element of algorithms
in many domains (machine learning, quantum physics). Conventional algorithms
for dense MM rely on regular/uniform data decomposition to ensure load balance.
These traits conflict with the irregular structure (block-sparse or rank-sparse
within blocks) that is increasingly relevant for fast methods in quantum
physics. To deal with such irregular data we present a new MM algorithm based
on Scalable Universal Matrix Multiplication Algorithm (SUMMA). The novel
features are: (1) multiple-issue scheduling of SUMMA iterations, and (2)
fine-grained task-based formulation. The latter eliminates the need for
explicit internodal synchronization; with multiple-iteration scheduling this
allows load imbalance due to nonuniform matrix structure. For square MM with
uniform and nonuniform block sizes (the latter simulates matrices with general
irregular structure) we found excellent performance in weak and strong-scaling
regimes, on commodity and high-end hardware.
","[{'version': 'v1', 'created': 'Mon, 20 Apr 2015 13:18:10 GMT'}]",2015-04-21,"[['Calvin', 'Justus A.', ''], ['Valeev', 'Edward F.', '']]","['matrix multiplication', 'tensor contraction', 'task parallelism', 'SUMMA', 'latency tolerance', 'distributed computation']"
17792,1603.00772,Azad Naik,"Azad Naik, Huzefa Rangwala","Filter based Taxonomy Modification for Improving Hierarchical
  Classification",The conference version of the paper is submitted for publication,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hierarchical Classification (HC) is a supervised learning problem where
unlabeled instances are classified into a taxonomy of classes. Several methods
that utilize the hierarchical structure have been developed to improve the HC
performance. However, in most cases apriori defined hierarchical structure by
domain experts is inconsistent; as a consequence performance improvement is not
noticeable in comparison to flat classification methods. We propose a scalable
data-driven filter based rewiring approach to modify an expert-defined
hierarchy. Experimental comparisons of top-down HC with our modified hierarchy,
on a wide range of datasets shows classification performance improvement over
the baseline hierarchy (i:e:, defined by expert), clustered hierarchy and
flattening based hierarchy modification approaches. In comparison to existing
rewiring approaches, our developed method (rewHier) is computationally
efficient, enabling it to scale to datasets with large numbers of classes,
instances and features. We also show that our modified hierarchy leads to
improved classification performance for classes with few training samples in
comparison to flat and state-of-the-art HC approaches.
","[{'version': 'v1', 'created': 'Wed, 2 Mar 2016 16:14:49 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Jun 2016 06:41:42 GMT'}, {'version': 'v3', 'created': 'Sat, 15 Oct 2016 06:21:54 GMT'}]",2016-10-18,"[['Naik', 'Azad', ''], ['Rangwala', 'Huzefa', '']]","['Top-Down Hierarchical Classification', 'Rewiring', 'Clustering', 'Flattening']"
17793,1606.03541,Steve Elliot,"Steve Elliot, Martin McCann and Kory Manley","Disruptive Transformation of Enterprise Supply Chain Performance through
  Strategic Technology-enabled Networking to Improve Business Value","ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
  Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/223,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In a dynamically changing world, businesses must transform themselves to
survive. Although the necessity for change may be apparent; how to change is
not. Learning from the experiences of successful pioneers in a core business
function is useful. Procurement is essential for all organisations. It is how
organisations acquire assets and inputs including facilities, materials and
people. Traditionally, the business objective from procurement was to increase
availability and reduce costs. Subsequently, the objective became more
tactical. Leading procurement practice today is disruptive; beyond cost to
creating value. The strategy for market leaders has also transformed; from
competition to collaboration. Technology-enabled business networks are now
driving business disruption globally. Through a rigorous field study of two
world-class pioneering corporations, this paper explores how disruption is
transforming Enterprise Supply Chains. Lessons, contributions and their
implications for current IS theory and practice, are discussed.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 03:30:45 GMT'}]",2016-06-14,"[['Elliot', 'Steve', ''], ['McCann', 'Martin', ''], ['Manley', 'Kory', '']]","['Business transformation', 'supply chain', 'procurement', 'business networks', 'IS theory and practice']"
17794,1603.07150,Martyn Harris,"Martyn Harris, Mark Levene, Dell Zhang, Dan Levene",The Anatomy of a Search and Mining System for Digital Archives,49 pages,,,,cs.DL cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Samtla (Search And Mining Tools with Linguistic Analysis) is a digital
humanities system designed in collaboration with historians and linguists to
assist them with their research work in quantifying the content of any textual
corpora through approximate phrase search and document comparison. The
retrieval engine uses a character-based n-gram language model rather than the
conventional word-based one so as to achieve great flexibility in language
agnostic query processing.
  The index is implemented as a space-optimised character-based suffix tree
with an accompanying database of document content and metadata. A number of
text mining tools are integrated into the system to allow researchers to
discover textual patterns, perform comparative analysis, and find out what is
currently popular in the research community.
  Herein we describe the system architecture, user interface, models and
algorithms, and data storage of the Samtla system. We also present several case
studies of its usage in practice together with an evaluation of the systems'
ranking performance through crowdsourcing.
","[{'version': 'v1', 'created': 'Wed, 23 Mar 2016 12:02:12 GMT'}]",2016-03-24,"[['Harris', 'Martyn', ''], ['Levene', 'Mark', ''], ['Zhang', 'Dell', ''], ['Levene', 'Dan', '']]","['Digital Humanities', 'Statistical Language Model', 'Information Retrieval', 'Text Analysis']"
17795,1207.5027,Les Hatton,Les Hatton,"Power-Laws and the Conservation of Information in discrete token
  systems: Part 1 General Theory","26 pages, 7 figures","IFIP AICT 377 Advances in Information and Communication Technology
  2011, ISBN 978-3-642-32676-9",,,cs.IT math-ph math.IT math.MP q-bio.GN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Conservation of Energy plays a pivotal part in the development of the
physical sciences. With the growth of computation and the study of other
discrete token based systems such as the genome, it is useful to ask if there
are conservation principles which apply to such systems and what kind of
functional behaviour they imply for such systems.
  Here I propose that the Conservation of Hartley-Shannon Information plays the
same over-arching role in discrete token based systems as the Conservation of
Energy does in physical systems. I will go on to prove that this implies
power-law behaviour in component sizes in software systems no matter what they
do or how they were built, and also implies the constancy of average gene
length in biological systems as reported for example by Lin Xu et al
(10.1093/molbev/msk019).
  These propositions are supported by very large amounts of experimental data
extending the first presentation of these ideas in Hatton (2011, IFIP / SIAM /
NIST Working Conference on Uncertainty Quantification in Scientific Computing,
Boulder, August 2011).
","[{'version': 'v1', 'created': 'Fri, 20 Jul 2012 19:09:49 GMT'}]",2012-09-25,"[['Hatton', 'Les', '']]","['Information content', 'gene length', 'Component size distribution', 'Power-law']"
17796,1704.05204,Shixiang Wan,Shixiang Wan and Quan Zou,"HPSLPred: An Ensemble Multi-label Classifier for Human Protein
  Subcellular Location Prediction with Imbalanced Source",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predicting the subcellular localization of proteins is an important and
challenging problem. Traditional experimental approaches are often expensive
and time-consuming. Consequently, a growing number of research efforts employ a
series of machine learning approaches to predict the subcellular location of
proteins. There are two main challenges among the state-of-the-art prediction
methods. First, most of the existing techniques are designed to deal with
multi-class rather than multi-label classification, which ignores connections
between multiple labels. In reality, multiple locations of particular proteins
implies that there are vital and unique biological significances that deserve
special focus and cannot be ignored. Second, techniques for handling imbalanced
data in multi-label classification problems are necessary, but never employed.
For solving these two issues, we have developed an ensemble multi-label
classifier called HPSLPred, which can be applied for multi-label classification
with an imbalanced protein source. For convenience, a user-friendly webserver
has been established at http://server.malab.cn/HPSLPred.
","[{'version': 'v1', 'created': 'Tue, 18 Apr 2017 05:18:25 GMT'}]",2017-04-19,"[['Wan', 'Shixiang', ''], ['Zou', 'Quan', '']]","['subcellular location', 'ensemble classifier', 'multi-label', 'imbalance source']"
17797,1610.03604,Yu Song,"Yu Song, Yiquan Wu","Subspace clustering based on low rank representation and weighted
  nuclear norm minimization","17 pages, 3 figures, 5 tables This paper is also submitted to the
  journal 'pattern recognition'. arXiv admin note: text overlap with
  arXiv:1203.1005 by other authors",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Subspace clustering refers to the problem of segmenting a set of data points
approximately drawn from a union of multiple linear subspaces. Aiming at the
subspace clustering problem, various subspace clustering algorithms have been
proposed and low rank representation based subspace clustering is a very
promising and efficient subspace clustering algorithm. Low rank representation
method seeks the lowest rank representation among all the candidates that can
represent the data points as linear combinations of the bases in a given
dictionary. Nuclear norm minimization is adopted to minimize the rank of the
representation matrix. However, nuclear norm is not a very good approximation
of the rank of a matrix and the representation matrix thus obtained can be of
high rank which will affect the final clustering accuracy. Weighted nuclear
norm (WNN) is a better approximation of the rank of a matrix and WNN is adopted
in this paper to describe the rank of the representation matrix. The convex
program is solved via conventional alternation direction method of multipliers
(ADMM) and linearized alternating direction method of multipliers (LADMM) and
they are respectively refer to as WNNM-LRR and WNNM-LRR(L). Experimental
results show that, compared with low rank representation method and several
other state-of-the-art subspace clustering methods, WNNM-LRR and WNNM-LRR(L)
can get higher clustering accuracy.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2016 06:11:34 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Oct 2016 14:26:17 GMT'}, {'version': 'v3', 'created': 'Fri, 14 Oct 2016 03:08:52 GMT'}]",2016-10-17,"[['Song', 'Yu', ''], ['Wu', 'Yiquan', '']]","['subspace clustering', 'low rank representation', 'weighted nuclear norm minimization', 'linearized alternating']"
17798,1611.01152,Gouri Ginde,Gouri Ginde,"Visualisation of massive data from scholarly Article and Journal
  Database A Novel Scheme","5 pages, conference",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scholarly articles publishing and getting cited has become a way of life for
academicians. These scholarly publications shape up the career growth of not
only the authors but also of the country, continent and the technological
domains. Author affiliations, country and other information of an author
coupled with data analytics can provide useful and insightful results. However,
massive and complete data is required to perform this research. Google scholar
which is a comprehensive and free repository of scholarly articles has been
used as a data source for this purpose. Data scraped from Google scholar when
stored as a graph and visualized in the form of nodes and relationships, can
offer discerning and concealed information. Such as, evident domain shift of an
author, various research domains spread for an author, prediction of emerging
domain and sub domains, detection of journal and author level citation cartel
behaviors etc. The data from graph database is also used in computation of
scholastic indicators for the journals. Eventually, econometric model, named
Cobb Douglas model is used to compute the journals Modeling ""Internationality""
Index based on these scholastic indicators.
","[{'version': 'v1', 'created': 'Thu, 3 Nov 2016 10:23:59 GMT'}]",2016-11-08,"[['Ginde', 'Gouri', '']]","['Data acquisition methods', 'Web scraping', 'Graph database', 'Neo4j', 'Data visualization', 'Cobb Douglas model']"
17799,1603.01845,Mingming Liu,"Joe Naoum-Sawaya, Emanuele Crisostomi, Mingming Liu, Yingqi Gu, Robert
  Shorten","Smart Procurement of Naturally Generated Energy (SPONGE) for Plug-in
  Hybrid Electric Buses","This paper is recently submitted to the IEEE Transactions on
  Automation Science and Engineering",,,,cs.SY,http://creativecommons.org/licenses/by/4.0/,"  We discuss a recently introduced ECO-driving concept known as SPONGE in the
context of Plug-in Hybrid Electric Buses (PHEB)'s.Examples are given to
illustrate the benefits of this approach to ECO-driving. Finally, distributed
algorithms to realise SPONGE are discussed, paying attention to the privacy
implications of the underlying optimisation problems.
","[{'version': 'v1', 'created': 'Sun, 6 Mar 2016 17:14:34 GMT'}]",2016-03-08,"[['Naoum-Sawaya', 'Joe', ''], ['Crisostomi', 'Emanuele', ''], ['Liu', 'Mingming', ''], ['Gu', 'Yingqi', ''], ['Shorten', 'Robert', '']]","['Index Terms—PrimaryTopics Number 7', 'Number 8; Secondary Topic KeywordsRouting', 'Distributed Systems']"
17800,1003.1455,Rdv Ijcsis,"Rama N., Meenakshi Lakshmanan","A Computational Algorithm based on Empirical Analysis, that Composes
  Sanskrit Poetry","Pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS February 2010, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 7, No. 2, pp. 056-062, February 2010, USA",,Computer Science ISSN 19475500,cs.CL,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Poetry-writing in Sanskrit is riddled with problems for even those who know
the language well. This is so because the rules that govern Sanskrit prosody
are numerous and stringent. We propose a computational algorithm that converts
prose given as E-text into poetry in accordance with the metrical rules of
Sanskrit prosody, simultaneously taking care to ensure that sandhi or euphonic
conjunction, which is compulsory in verse, is handled. The algorithm is
considerably speeded up by a novel method of reducing the target search
database. The algorithm further gives suggestions to the poet in case what
he/she has given as the input prose is impossible to fit into any allowed
metrical format. There is also an interactive component of the algorithm by
which the algorithm interacts with the poet to resolve ambiguities. In
addition, this unique work, which provides a solution to a problem that has
never been addressed before, provides a simple yet effective speech recognition
interface that would help the visually impaired dictate words in E-text, which
is in turn versified by our Poetry Composer Engine.
","[{'version': 'v1', 'created': 'Sun, 7 Mar 2010 11:28:08 GMT'}]",2010-03-09,"[['N.', 'Rama', ''], ['Lakshmanan', 'Meenakshi', '']]","['Sanskrit', 'poetry composer', 'sandhi', 'metre', 'metrical analysis', 'long-short analysis', 'speech recognition']"
17801,1606.06905,Ying Wen,"Ying Wen, Weinan Zhang, Rui Luo, Jun Wang","Learning text representation using recurrent convolutional neural
  network with highway layers",Neu-IR '16 SIGIR Workshop on Neural Information Retrieval,,,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, the rapid development of word embedding and neural networks has
brought new inspiration to various NLP and IR tasks. In this paper, we describe
a staged hybrid model combining Recurrent Convolutional Neural Networks (RCNN)
with highway layers. The highway network module is incorporated in the middle
takes the output of the bi-directional Recurrent Neural Network (Bi-RNN) module
in the first stage and provides the Convolutional Neural Network (CNN) module
in the last stage with the input. The experiment shows that our model
outperforms common neural network models (CNN, RNN, Bi-RNN) on a sentiment
analysis task. Besides, the analysis of how sequence length influences the RCNN
with highway layers shows that our model could learn good representation for
the long text.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2016 11:30:47 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Aug 2016 16:17:05 GMT'}]",2016-08-03,"[['Wen', 'Ying', ''], ['Zhang', 'Weinan', ''], ['Luo', 'Rui', ''], ['Wang', 'Jun', '']]","['Neural Networks', 'Highway Networks', 'Sentiment Analysis']"
17802,0908.0060,Mugurel Ionut Andreica,Mugurel Ionut Andreica,"Algorithmic Decision Optimization Techniques for Multiple Types of
  Agents with Contrasting Interests",,"Metalurgia International, vol. 14, special issue no. 11, pp.
  162-170, 2009. (ISSN: 1582-2214)",,,cs.GT cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper I present several algorithmic techniques for improving the
decision process of multiple types of agents behaving in environments where
their interests are in conflict. The interactions between the agents are
modelled by using several types of two-player games, where the agents have
identical roles and compete for the same resources, or where they have
different roles, like in query-response games. The described situations have
applications in modelling behavior in many types of environments, like
distributed systems, learning environments, resource negotiation environments,
and many others. The mentioned models are applicable in a wide range of
domains, like computer science or the industrial (e.g. metallurgical), economic
or financial sector.
","[{'version': 'v1', 'created': 'Sat, 1 Aug 2009 10:06:49 GMT'}]",2009-08-04,"[['Andreica', 'Mugurel Ionut', '']]","['Contrasting Interests', 'Decision Optimization Techniques', 'Two-Player Games', 'Equitable Resource Allocation']"
17803,1609.01464,Kardi Teknomo,"Jacob Chan, Kardi Teknomo",Hub Identification of the Metro Manila Road Network Using PageRank,"10 pages, Chan, J. and Teknomo, K. (2015) Hub Identification of the
  Metro Manila Road Network Using PageRank, Proceedings of the 8th ATRANS
  Symposium Young Researcher's Forum, August 21, 2015, Bangkok, Thailand",,,,cs.SI cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We attempt to identify the different node hubs of a road network using
PageRank for preparation for possible random terrorist attacks. The robustness
of a road network against such attack is crucial to be studied because it may
cripple its connectivity by simply shutting down these hubs. We show the
important hubs in a road network based on network structure and propose a model
for robustness analysis. By identifying important hubs in a road network,
possible preparation schemes may be done earlier to mitigate random terrorist
attacks, including defense reinforcement and transportation security. A case
study of the Metro Manila road network is also presented. The case study shows
that the most important hubs in the Metro Manila road network are near
airports, piers, major highways and expressways
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2016 09:58:03 GMT'}]",2016-09-07,"[['Chan', 'Jacob', ''], ['Teknomo', 'Kardi', '']]","['PageRank', 'Terrorist Attack', 'Robustness  1']"
17804,1412.7689,Roshan Ragel,Akmal Jahan Mac and Roshan G Ragel,"Locating Tables in Scanned Documents for Reconstructing and Republishing
  (ICIAfS14)","The 7th International Conference on Information and Automation for
  Sustainability (ICIAfS) 2014",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pool of knowledge available to the mankind depends on the source of learning
resources, which can vary from ancient printed documents to present electronic
material. The rapid conversion of material available in traditional libraries
to digital form needs a significant amount of work if we are to maintain the
format and the look of the electronic documents as same as their printed
counterparts. Most of the printed documents contain not only characters and its
formatting but also some associated non text objects such as tables, charts and
graphical objects. It is challenging to detect them and to concentrate on the
format preservation of the contents while reproducing them. To address this
issue, we propose an algorithm using local thresholds for word space and line
height to locate and extract all categories of tables from scanned document
images. From the experiments performed on 298 documents, we conclude that our
algorithm has an overall accuracy of about 75% in detecting tables from the
scanned document images. Since the algorithm does not completely depend on rule
lines, it can detect all categories of tables in a range of scanned documents
with different font types, styles and sizes to extract their formatting
features. Moreover, the algorithm can be applied to locate tables in multi
column layouts with small modification in layout analysis. Treating tables with
their existing formatting features will tremendously help the reproducing of
printed documents for reprinting and updating purposes.
","[{'version': 'v1', 'created': 'Wed, 24 Dec 2014 15:29:13 GMT'}]",2014-12-25,"[['Mac', 'Akmal Jahan', ''], ['Ragel', 'Roshan G', '']]","['OCR-optical character recognition', 'table detection', 'format preservation']"
17805,0710.4670,EDA Publishing Association,"Ilia Polian, Alejandro Czutro, Bernd Becker",Evolutionary Optimization in Code-Based Test Compression,Submitted on behalf of EDAA (http://www.edaa.com/),"Dans Design, Automation and Test in Europe - DATE'05, Munich :
  Allemagne (2005)",,,cs.AR,,"  We provide a general formulation for the code-based test compression problem
with fixed-length input blocks and propose a solution approach based on
Evolutionary Algorithms. In contrast to existing code-based methods, we allow
unspecified values in matching vectors, which allows encoding of arbitrary test
sets using a relatively small number of code-words. Experimental results for
both stuck-at and path delay fault test sets for ISCAS circuits demonstrate an
improvement compared to existing techniques.
","[{'version': 'v1', 'created': 'Thu, 25 Oct 2007 08:45:52 GMT'}]",2011-11-09,"[['Polian', 'Ilia', ''], ['Czutro', 'Alejandro', ''], ['Becker', 'Bernd', '']]","['Test compression', 'code-based compression', 'evolutionary algorithms']"
17806,1602.06778,Martin Tancer,"Alfredo Hubard, Vojt\v{e}ch Kalu\v{z}a, Arnaud de Mesmay, Martin
  Tancer",Shortest path embeddings of graphs on surfaces,"22 pages, 11 figures: Version 3 is updated after comments of
  reviewers",,,,cs.CG cs.DM math.CO math.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The classical theorem of F\'{a}ry states that every planar graph can be
represented by an embedding in which every edge is represented by a straight
line segment. We consider generalizations of F\'{a}ry's theorem to surfaces
equipped with Riemannian metrics. In this setting, we require that every edge
is drawn as a shortest path between its two endpoints and we call an embedding
with this property a shortest path embedding. The main question addressed in
this paper is whether given a closed surface S, there exists a Riemannian
metric for which every topologically embeddable graph admits a shortest path
embedding. This question is also motivated by various problems regarding
crossing numbers on surfaces.
  We observe that the round metrics on the sphere and the projective plane have
this property. We provide flat metrics on the torus and the Klein bottle which
also have this property.
  Then we show that for the unit square flat metric on the Klein bottle there
exists a graph without shortest path embeddings. We show, moreover, that for
large g, there exist graphs G embeddable into the orientable surface of genus
g, such that with large probability a random hyperbolic metric does not admit a
shortest path embedding of G, where the probability measure is proportional to
the Weil-Petersson volume on moduli space.
  Finally, we construct a hyperbolic metric on every orientable surface S of
genus g, such that every graph embeddable into S can be embedded so that every
edge is a concatenation of at most O(g) shortest paths.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2016 13:58:39 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Aug 2016 13:42:18 GMT'}, {'version': 'v3', 'created': 'Mon, 28 Aug 2017 10:15:12 GMT'}]",2017-08-29,"[['Hubard', 'Alfredo', ''], ['Kaluža', 'Vojtěch', ''], ['de Mesmay', 'Arnaud', ''], ['Tancer', 'Martin', '']]","['Embedded graphs', 'Shortest paths', 'F´ary’s theorem', 'Hyperbolic geometry', 'Graphdrawing']"
17807,1009.4979,S. M. Kamruzzaman,"Md. Abul Kalam Azad, Rezwana Sharmeen, Shabbir Ahmad, and S. M.
  Kamruzzaman",Smart Bengali Cell Phone Keypad Layout,"4 Pages, International Conference","Proc. 8th International Conference on Computer and Information
  Technology (ICCIT 2005), Dhaka, Bangladesh, pp. 1208-1211, Dec. 2005",,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays cell phone is the most common communicating used by mass people. SMS
based communication is a cheap and popular communication method. It is human
tendency to have the opportunity to write SMS in their mother language. Text
input in mother language is more flexible when the alphabets of that language
are printed on the keypad. Bangla mobile keypad based on phonetics has been
proposed earlier. But the keypad is not scientific from frequency and
flexibility point of view. Since it is not a feasible solution in this paper we
have proposed an efficient Bengali keypad for cell phone and other cellular
device. The proposed keypad is based on the frequency of the alphabets in
Bengali language and also with the view of structure of human finger movements.
We took the two points in count to provide a flexible and fast cell phone
keypad.
","[{'version': 'v1', 'created': 'Sat, 25 Sep 2010 06:27:49 GMT'}]",2010-09-28,"[['Azad', 'Md. Abul Kalam', ''], ['Sharmeen', 'Rezwana', ''], ['Ahmad', 'Shabbir', ''], ['Kamruzzaman', 'S. M.', '']]","['Cell phone keypad', 'Frequency', 'Flexible', 'Bengali alphabet']"
17808,1111.1647,Deepak Gupta,"Sunil Joshi, Deepak Gupta","Throughput Performance of 2$\times$2 Mimo LTE Downlink in a Spatial
  Correlation Based Microcellular Channel for Wireless Broadband Networks",11,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multiple Input Multiple Output (MIMO) technology is going to be a viable
alternative for future generation wireless broadband services in order to meet
the striving requirements for throughput and system robustness. In Long Term
Evolution (LTE), MIMO technologies have been broadly used to get better
downlink peak rate, cell coverage, as well as average cell throughput. In the
present paper a 2x2 MIMO is taken as baseline configuration for a LTE downlink
under a Microcellular propagation scenario considering a non physical
correlation based channel with Poor and rich scattering environment. The
throughput capacity of the downlink is obtained for poor and rich scattering
environments. Besides, two vital aspects of MIMO technique viz Spatial
Multiplexing (SM) and Transmit Diversity (TD) are investigated in order to see
their effect on throughput of the system. The effect of parameters like Speed
of mobile station, number of Multipath, Rician factor (K) on throughput of such
systems is reported and discussed. The investigations reported in this paper
helps in estimating the throughput capacity of LTE downlink under SM and TD
mode.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2011 17:09:35 GMT'}]",2011-11-08,"[['Joshi', 'Sunil', ''], ['Gupta', 'Deepak', '']]","['Spatial Multiplexing', 'Spatial Diversity', 'Multiple Input-Multiple Output (MIMO)', 'Space Time Coding', 'Rician factor']"
17809,1209.6204,Mikhail Kharinov Vyacheslavovich,M. Kharinov,Reclassification formula that provides to surpass K-means method,"10 pages, 2 figures, 13 formulas",,,,cs.CV cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents a formula for the reclassification of multidimensional
data points (columns of real numbers, ""objects"", ""vectors"", etc.). This formula
describes the change in the total squared error caused by reclassification of
data points from one cluster into another and prompts the way to calculate the
sequence of optimal partitions, which are characterized by a minimum value of
the total squared error E (weighted sum of within-class variance,
within-cluster sum of squares WCSS etc.), i.e. the sum of squared distances
from each data point to its cluster center. At that source data points are
treated with repetitions allowed, and resulting clusters from different
partitions, in general case, overlap each other. The final partitions are
characterized by ""equilibrium"" stability with respect to the reclassification
of the data points, where the term ""stability"" means that any prescribed
reclassification of data points does not increase the total squared error E. It
is important that conventional K-means method, in general case, provides
generation of instable partitions with overstated values of the total squared
error E. The proposed method, based on the formula of reclassification, is more
efficient than K-means method owing to converting of any partition into stable
one, as well as involving into the process of reclassification of certain sets
of data points, in contrast to the classification of individual data points
according to K-means method.
","[{'version': 'v1', 'created': 'Thu, 27 Sep 2012 12:24:05 GMT'}]",2012-09-28,"[['Kharinov', 'M.', '']]","['total squared error', 'minimization', 'overlapping partitions', 'K–means method', 'reclassification formula', 'stability condition']"
17810,1710.01275,Stefano Bromuri Dr,"Stefano Bromuri and Albert Brugues de la Torre and Fabien Duboisson
  and Michael Schumacher",Indexing the Event Calculus with Kd-trees to Monitor Diabetes,"24 pages, preliminary results calculated on an implementation of
  CECKD, precursor to Journal paper being submitted in 2017, with further
  indexing and results possibilities, put here for reference and chronological
  purposes to remember how the idea evolved",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Personal Health Systems (PHS) are mobile solutions tailored to monitoring
patients affected by chronic non communicable diseases. A patient affected by a
chronic disease can generate large amounts of events. Type 1 Diabetic patients
generate several glucose events per day, ranging from at least 6 events per day
(under normal monitoring) to 288 per day when wearing a continuous glucose
monitor (CGM) that samples the blood every 5 minutes for several days. This is
a large number of events to monitor for medical doctors, in particular when
considering that they may have to take decisions concerning adjusting the
treatment, which may impact the life of the patients for a long time. Given the
need to analyse such a large stream of data, doctors need a simple approach
towards physiological time series that allows them to promptly transfer their
knowledge into queries to identify interesting patterns in the data. Achieving
this with current technology is not an easy task, as on one hand it cannot be
expected that medical doctors have the technical knowledge to query databases
and on the other hand these time series include thousands of events, which
requires to re-think the way data is indexed. In order to tackle the knowledge
representation and efficiency problem, this contribution presents the kd-tree
cached event calculus (\ceckd) an event calculus extension for knowledge
engineering of temporal rules capable to handle many thousands events produced
by a diabetic patient. \ceckd\ is built as a support to a graphical interface
to represent monitoring rules for diabetes type 1. In addition, the paper
evaluates the \ceckd\ with respect to the cached event calculus (CEC) to show
how indexing events using kd-trees improves scalability with respect to the
current state of the art.
","[{'version': 'v1', 'created': 'Tue, 3 Oct 2017 17:01:54 GMT'}]",2017-10-04,"[['Bromuri', 'Stefano', ''], ['de la Torre', 'Albert Brugues', ''], ['Duboisson', 'Fabien', ''], ['Schumacher', 'Michael', '']]","['Diabetes type 1', 'Event Calculus', 'Kd-trees', 'Expert Systems', 'Rulemanagement']"
17811,1203.0516,Dmitry Ageyev,"Dmitry Ageyev, Artem Ignatenko","Describing and Modeling of Video-on-Demand Service with the Usage of
  Multi-Layer Graph","2 pages, 1 figure, 4 references","Proceedings of the XI th International Conference on Modern
  Problems of Radio Engineering, Telecommunications and Computer Science
  TCSET'2012, 2012, pp. 340 - 341",,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Considered in this paper is the method of describingc of telecommunications
systems providing VoD service using multi-layer graph. The paper describes the
relations between the structural elements at each hierarchical level of the
multi-layer graph. Transfer of video is a resource consuming task, and it
requires an optimal configuration of the studied system. The usage of the
multi-layer graph makes it possible to consider the telecommunication system as
a whole and avoid falling in the local optimums when solving optimization
problems.
","[{'version': 'v1', 'created': 'Fri, 2 Mar 2012 16:32:24 GMT'}]",2012-03-07,"[['Ageyev', 'Dmitry', ''], ['Ignatenko', 'Artem', '']]","['Video-on-Demand', 'Multi-Layer graph', 'Network design', 'Topology synthesis']"
17812,1307.6770,Nadine Rons,"Nadine Rons, Lucy Amez",Impact Vitality - A Measure for Excellent Scientists,3 pages,"Book of Abstracts, 10th International Conference on Science and
  Technology Indicators, Vienna, Austria, 17-20 September 2008, 211-213",,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many countries and at European level, research policy increasingly focuses
on 'excellent' researchers. The concept of excellence however is complex and
multidimensional. For individual scholars it involves talents for innovative
knowledge creation and successful transmission to peers, as well as management
capacities. Excellence is also a comparative concept, implying the ability to
surpass others [TIJSSEN, 2003]. Grants are in general awarded based on
assessments by expert committees. While peer review is a widely accepted
practice, it nevertheless is also subject to criticism. At higher aggregation
levels, peer assessments are often supported by quantitative measures. At
individual level, most of these measures are much less appropriate and there is
a need for new, dedicated indicators.
","[{'version': 'v1', 'created': 'Thu, 25 Jul 2013 15:04:43 GMT'}]",2013-07-26,"[['Rons', 'Nadine', ''], ['Amez', 'Lucy', '']]","['Research Evaluation', 'Excellence', 'Citation Impact', 'Impact Vitality']"
17813,1007.1222,Steven Bitner,Steven Bitner and Ovidiu Daescu,Minimum Sum Dipolar Spanning Tree in R^3,"11 pages, 4 figures, submitted to Computational Geometry: Theory and
  Applications",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider finding a geometric minimum-sum dipolar spanning
tree in R^3, and present an algorithm that takes O(n^2 log^2 n) time using
O(n^2) space, thus almost matching the best known results for the planar case.
Our solution uses an interesting result related to the complexity of the common
intersection of n balls in R^3, of possible different radii, that are all
tangent to a given point p. The problem has applications in communication
networks, when the goal is to minimize the distance between two hubs or servers
as well as the distance from any node in the network to the closer of the two
hubs. The approach used in this paper also provides a solution to the discrete
2-center problem in R^3 within the same time and space bounds.
","[{'version': 'v1', 'created': 'Wed, 7 Jul 2010 18:57:34 GMT'}]",2010-07-08,"[['Bitner', 'Steven', ''], ['Daescu', 'Ovidiu', '']]","['dipolar spanning tree', 'msst', 'discrete two center']"
17814,1704.02075,Fangchang Ma,"Fangchang Ma, Sertac Karaman","On Sensing, Agility, and Computation Requirements for a Data-gathering
  Agile Robotic Vehicle","22 pages, 11 figures",,,,cs.RO cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a robotic vehicle tasked with gathering information by visiting a
set of spatially-distributed data sources, the locations of which are not known
a priori, but are discovered on the fly. We assume a first-order robot dynamics
involving drift and that the locations of the data sources are
Poisson-distributed. In this setting, we characterize the performance of the
robot in terms of its sensing, agility, and computation capabilities. More
specifically, the robot's performance is characterized in terms of its ability
to sense the target locations from a distance, to maneuver quickly, and to
perform computations for inference and planning. We also characterize the
performance of the robot in terms of the amount and distribution of information
that can be acquired at each data source. The following are among our
theoretical results: the distribution of the amount of information among the
target locations immensely impacts the requirements for sensing targets from a
distance; performance increases with increasing maneuvering capability, but
with diminishing returns; and the computation requirements increase more
rapidly for planning as opposed to inference, with both increasing sensing
range and maneuvering ability. We provide computational experiments to validate
our theoretical results. Finally, we demonstrate that these results can be
utilized in the co-design of sensing, actuation, and computation capabilities
of mobile robotic systems for an information-gathering mission. Our proof
techniques establish novel connections between the fundamental problems of
robotic information-gathering and the last-passage percolation problem of
statistical mechanics, which may be of interest on its own right.
","[{'version': 'v1', 'created': 'Fri, 7 Apr 2017 02:54:29 GMT'}]",2017-04-10,"[['Ma', 'Fangchang', ''], ['Karaman', 'Sertac', '']]","['Motion planning', 'stochastic environments', 'nonequilibrium statistical mechanics']"
17815,1206.0968,Omri Mohamed Nazih,"Kamel Garrouch, Mohamed Nazih Omri and Bachir Elayeb","Pertinent Information retrieval based on Possibilistic Bayesian network
  : origin and possibilistic perspective",The International Conference on Computing & e-Systems - 2008,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a synthesis of work performed on tow information
retrieval models: Bayesian network information retrieval model witch encode
(in) dependence relation between terms and possibilistic network information
retrieval model witch make use of necessity and possibility measures to
represent the fuzziness of pertinence measure. It is known that the use of a
general Bayesian network methodology as the basis for an IR system is difficult
to tackle. The problem mainly appears because of the large number of variables
involved and the computational efforts needed to both determine the
relationships between variables and perform the inference processes. To resolve
these problems, many models have been proposed such as BNR model. Generally,
Bayesian network models doesn't consider the fuzziness of natural language in
the relevance measure of a document to a given query and possibilistic models
doesn't undertake the dependence relations between terms used to index
documents. As a first solution we propose a hybridization of these two models
in one that will undertake both the relationship between terms and the
intrinsic fuzziness of natural language. We believe that the translation of
Bayesian network model from the probabilistic framework to possibilistic one
will allow a performance improvement of BNRM.
","[{'version': 'v1', 'created': 'Tue, 5 Jun 2012 15:45:06 GMT'}]",2012-06-06,"[['Garrouch', 'Kamel', ''], ['Omri', 'Mohamed Nazih', ''], ['Elayeb', 'Bachir', '']]","['information retrieval', 'Bayesian network', 'possibilistic network']"
17816,1510.08276,Yixin Cao,Jie You and Jianxin Wang and Yixin Cao,Approximate Association via Dissociation,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A vertex set $X$ of a graph $G$ is an association set if each component of $G
- X$ is a clique, or a dissociation set if each component of $G - X$ is a
single vertex or a single edge. Interestingly, $G - X$ is then precisely a
graph containing no induced $P_3$'s or containing no $P_3$'s, respectively. We
observe some special structures and show that if none of them exists, then the
minimum association set problem can be reduced to the minimum (weighted)
dissociation set problem. This yields the first nontrivial approximation
algorithm for association set, and its approximation ratio is 2.5, matching the
best result of the closely related cluster editing problem. The reduction is
based on a combinatorial study of modular decomposition of graphs free of these
special structures. Further, a novel algorithmic use of modular decomposition
enables us to implement this approach in $O(m n + n^2)$ time.
","[{'version': 'v1', 'created': 'Wed, 28 Oct 2015 12:01:50 GMT'}]",2015-10-29,"[['You', 'Jie', ''], ['Wang', 'Jianxin', ''], ['Cao', 'Yixin', '']]","['approximation algorithm', 'association set (cluster vertex deletion)', 'dissociation set', 'clustergraph', 'modular decomposition', 'triangle-free graph']"
17817,1712.04008,Michael Bernico,"Michael Bernico, Yuntao Li, Dingchao Zhang","Investigating the Impact of Data Volume and Domain Similarity on
  Transfer Learning Applications",9 pages,,,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transfer learning allows practitioners to recognize and apply knowledge
learned in previous tasks (source task) to new tasks or new domains (target
task), which share some commonality. The two important factors impacting the
performance of transfer learning models are: (a) the size of the target
dataset, and (b) the similarity in distribution between source and target
domains. Thus far, there has been little investigation into just how important
these factors are. In this paper, we investigate the impact of target dataset
size and source/target domain similarity on model performance through a series
of experiments. We find that more data is always beneficial, and model
performance improves linearly with the log of data size, until we are out of
data. As source/target domains differ, more data is required and fine tuning
will render better performance than feature extraction. When source/target
domains are similar and data size is small, fine tuning and feature extraction
renders equivalent performance. Our hope is that by beginning this quantitative
investigation on the effect of data volume and domain similarity in transfer
learning we might inspire others to explore the significance of data in
developing more accurate statistical models.
","[{'version': 'v1', 'created': 'Mon, 11 Dec 2017 20:30:44 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Jan 2018 18:14:44 GMT'}, {'version': 'v3', 'created': 'Thu, 24 May 2018 19:09:19 GMT'}, {'version': 'v4', 'created': 'Wed, 30 May 2018 19:35:08 GMT'}]",2018-06-01,"[['Bernico', 'Michael', ''], ['Li', 'Yuntao', ''], ['Zhang', 'Dingchao', '']]","['Computer Vision', 'Deep Learning', 'Transfer Learning', 'Business Application', 'Domain Similarity', 'Data Volume Effect']"
17818,1309.7334,Ankit Chadha Mr.,"Ankit Chadha, Neha Satam and Beena Ballal",Orthogonal Frequency Division Multiplexing and its Applications,,"nternational Journal of Science and Research (IJSR) Online ISSN:
  2319-7064 , January 2013",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Orthogonal Frequency Division Multiplexing (OFDM) is a multi-carrier
modulation technique which is very much popular in new wireless networks of
IEEE standard, digital television, audio broadcasting and 4G mobile
communications. The main benefit of OFDM over single-carrier schemes is its
ability to cope with severe channel conditions without complex equalization
filters. It has improved the quality of long-distance communication by
eliminating InterSymbol Interference (ISI) and improving Signal-to-Noise ratio
(SNR). The main drawbacks of OFDM are its high peak to average power ratio and
its sensitivity to phase noise and frequency offset. This paper gives an
overview of OFDM, its applications in various systems such as IEEE 802.11a,
Digital Audio Broadcasting (DAB) and Digital Broadcast Services to Handheld
Devices (DVB-H) along with its advantages and disadvantages.
","[{'version': 'v1', 'created': 'Thu, 26 Sep 2013 12:06:58 GMT'}]",2013-09-30,"[['Chadha', 'Ankit', ''], ['Satam', 'Neha', ''], ['Ballal', 'Beena', '']]","['OFDM', 'Multipath Fading', 'Time-Slicing', 'Spectral Efficiency', 'ISI']"
17819,1512.00607,Hideitsu Hino,"Toshiyuki Kato, Hideitsu Hino, and Noboru Murata",Double Sparse Multi-Frame Image Super Resolution,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A large number of image super resolution algorithms based on the sparse
coding are proposed, and some algorithms realize the multi-frame super
resolution. In multi-frame super resolution based on the sparse coding, both
accurate image registration and sparse coding are required. Previous study on
multi-frame super resolution based on sparse coding firstly apply block
matching for image registration, followed by sparse coding to enhance the image
resolution. In this paper, these two problems are solved by optimizing a single
objective function. The results of numerical experiments support the
effectiveness of the proposed approch.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2015 08:25:23 GMT'}]",2015-12-03,"[['Kato', 'Toshiyuki', ''], ['Hino', 'Hideitsu', ''], ['Murata', 'Noboru', '']]","['Image Super Resolution', 'Sparse Coding', 'Double Sparsity']"
17820,1603.00254,Eva Jelinkova,V\'it Jel\'inek and Eva Jel\'inkov\'a and Jan Kratochv\'il,On the hardness of switching to a small number of edges,"19 pages, 7 figures. An extended abstract submitted to COCOON 2016",,,,cs.CC cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Seidel's switching is a graph operation which makes a given vertex adjacent
to precisely those vertices to which it was non-adjacent before, while keeping
the rest of the graph unchanged. Two graphs are called switching-equivalent if
one can be made isomorphic to the other one by a sequence of switches.
  Jel\'inkov\'a et al. [DMTCS 13, no. 2, 2011] presented a proof that it is
NP-complete to decide if the input graph can be switched to contain at most a
given number of edges. There turns out to be a flaw in their proof. We present
a correct proof.
  Furthermore, we prove that the problem remains NP-complete even when
restricted to graphs whose density is bounded from above by an arbitrary fixed
constant. This partially answers a question of Matou\v{s}ek and Wagner
[Discrete Comput. Geom. 52, no. 1, 2014].
","[{'version': 'v1', 'created': 'Tue, 1 Mar 2016 12:59:49 GMT'}]",2016-03-02,"[['Jelínek', 'Vít', ''], ['Jelínková', 'Eva', ''], ['Kratochvíl', 'Jan', '']]","['Seidel’s switching', 'Computational complexity', 'Graph density', 'Switching-minimal graphs', 'NP-completeness']"
17821,1301.2698,Jiankou Li,Jiankou Li,Evaluating community structure in large network with random walks,"10 pages, 5 figures",,,,cs.SI physics.soc-ph,http://creativecommons.org/licenses/by/3.0/,"  Community structure is one of the most important properties of networks. Most
community algorithms are not suitable for large networks because of their time
consuming. In fact there are lots of networks with millons even billons of
nodes. In such case, most algorithms running in time O(n2logn) or even larger
are not practical. What we need are linear or approximately linear time
algorithm. Rising in response to such needs, we propose a quick methods to
evaluate community structure in networks and then put forward a local community
algorithm with nearly linear time based on random walks. Using our community
evaluating measure, we could find some difference results from measures used
before, i.e., the Newman Modularity. Our algorithm are effective in small
benchmark networks with small less accuracy than more complex algorithms but a
great of advantage in time consuming for large networks, especially super large
networks.
","[{'version': 'v1', 'created': 'Sat, 12 Jan 2013 16:49:08 GMT'}]",2013-01-15,"[['Li', 'Jiankou', '']]","['community structure', 'random walk', 'modularity']"
17822,1410.2862,Rafael Dowsley,Rafael Dowsley and Anderson C. A. Nascimento,"On the Oblivious Transfer Capacity of Generalized Erasure Channels
  against Malicious Adversaries",,,,,cs.CR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Noisy channels are a powerful resource for cryptography as they can be used
to obtain information-theoretically secure key agreement, commitment and
oblivious transfer protocols, among others. Oblivious transfer (OT) is a
fundamental primitive since it is complete for secure multi-party computation,
and the OT capacity characterizes how efficiently a channel can be used for
obtaining string oblivious transfer. Ahlswede and Csisz\'{a}r (\emph{ISIT'07})
presented upper and lower bounds on the OT capacity of generalized erasure
channels (GEC) against passive adversaries. In the case of GEC with erasure
probability at least 1/2, the upper and lower bounds match and therefore the OT
capacity was determined. It was later proved by Pinto et al. (\emph{IEEE Trans.
Inf. Theory 57(8)}) that in this case there is also a protocol against
malicious adversaries achieving the same lower bound, and hence the OT capacity
is identical for passive and malicious adversaries. In the case of GEC with
erasure probability smaller than 1/2, the known lower bound against passive
adversaries that was established by Ahlswede and Csisz\'{a}r does not match
their upper bound and it was unknown whether this OT rate could be achieved
against malicious adversaries as well. In this work we show that there is a
protocol against malicious adversaries achieving the same OT rate that was
obtained against passive adversaries.
  In order to obtain our results we introduce a novel use of interactive
hashing that is suitable for dealing with the case of low erasure probability
($p^* <1/2$).
","[{'version': 'v1', 'created': 'Fri, 10 Oct 2014 18:35:57 GMT'}]",2014-10-13,"[['Dowsley', 'Rafael', ''], ['Nascimento', 'Anderson C. A.', '']]","['Oblivious transfer', 'generalized erasure channel', 'oblivious transfer capacity', 'malicious adversaries', 'information-theoretic security']"
17823,1511.07910,Ahmad RezazadehReyhani,Ahmad RezazadehReyhani and Behrouz Farhang-Boroujeny,Asynchronous Performance of Circularly Pulse-Shaped Waveforms for 5G,"6 pages, 6 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The fifth generation of wireless networks (5G) necessitates the use of
waveforms with loose constraints on synchronization in multiuser scenarios.
Also, carrier aggregation, as a way to better utilize the spectrum in 5G, needs
a waveform with low out-of-band (OOB) emission. Generalized frequency division
multiplexing (GFDM) and circular filter bank multicarrier (C-FBMC) are two
candidate waveforms that fulfill these requirements. Both GFDM and C-FBMC
operate based on circular convolution, and use cyclic prefix to combat channel
response. In this paper, we develop an analytical technique for examining the
OOB emission and multiuser interference (MUI) in circularly shaped waveforms,
like GFDM and C-FBMC. To stay focused, the study in this paper is limited to
C-FBMC modulation. However, the approach we take is trivially extendable to
other waveforms as well. We derive equations that quantify OOB emission and
MUI. Our analysis allows us to identify the source of OOB emission and MUI.
This leads us to quantify the methods proposed by other researchers to decrease
OOB emission and MUI. Moreover, we quantify the impact of signal windowing at
the transmitter and receiver in reducing OOB emission and MUI, respectively.
","[{'version': 'v1', 'created': 'Tue, 24 Nov 2015 22:52:59 GMT'}]",2015-11-26,"[['RezazadehReyhani', 'Ahmad', ''], ['Farhang-Boroujeny', 'Behrouz', '']]","['GFDM', 'C-FBMC', 'OOB emission', 'Asynchronousmultiuser network', 'MUI', '5G']"
17824,0806.1816,Michael Mrissa,"M. Mrissa, Ph. Thiran, J-M. Jacquet, D. Benslimane and Z. Maamar","Cardinality heterogeneities in Web service composition: Issues and
  solutions",,,,,cs.SE cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data exchanges between Web services engaged in a composition raise several
heterogeneities. In this paper, we address the problem of data cardinality
heterogeneity in a composition. Firstly, we build a theoretical framework to
describe different aspects of Web services that relate to data cardinality, and
secondly, we solve this problem by developing a solution for cardinality
mediation based on constraint logic programming.
","[{'version': 'v1', 'created': 'Wed, 11 Jun 2008 09:05:21 GMT'}]",2008-12-18,"[['Mrissa', 'M.', ''], ['Thiran', 'Ph.', ''], ['Jacquet', 'J-M.', ''], ['Benslimane', 'D.', ''], ['Maamar', 'Z.', '']]","['Web services', 'Composition', 'Mediation', 'Cardinality']"
17825,1111.4645,Yaniv Altshuler,"Yaniv Altshuler, Nadav Aharony, Michael Fire, Yuval Elovici, Alex
  Pentland","Incremental Learning with Accuracy Prediction of Social and Individual
  Properties from Mobile-Phone Data",10 pages,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile phones are quickly becoming the primary source for social, behavioral,
and environmental sensing and data collection. Today's smartphones are equipped
with increasingly more sensors and accessible data types that enable the
collection of literally dozens of signals related to the phone, its user, and
its environment. A great deal of research effort in academia and industry is
put into mining this raw data for higher level sense-making, such as
understanding user context, inferring social networks, learning individual
features, predicting outcomes, and so on. In this work we investigate the
properties of learning and inference of real world data collected via mobile
phones over time. In particular, we look at the dynamic learning process over
time, and how the ability to predict individual parameters and social links is
incrementally enhanced with the accumulation of additional data. To do this, we
use the Friends and Family dataset, which contains rich data signals gathered
from the smartphones of 140 adult members of a young-family residential
community for over a year, and is one of the most comprehensive mobile phone
datasets gathered in academia to date. We develop several models that predict
social and individual properties from sensed mobile phone data, including
detection of life-partners, ethnicity, and whether a person is a student or
not. Then, for this set of diverse learning tasks, we investigate how the
prediction accuracy evolves over time, as new data is collected. Finally, based
on gained insights, we propose a method for advance prediction of the maximal
learning accuracy possible for the learning task at hand, based on an initial
set of measurements. This has practical implications, like informing the design
of mobile data collection campaigns, or evaluating analysis strategies.
","[{'version': 'v1', 'created': 'Sun, 20 Nov 2011 16:10:53 GMT'}]",2011-11-22,"[['Altshuler', 'Yaniv', ''], ['Aharony', 'Nadav', ''], ['Fire', 'Michael', ''], ['Elovici', 'Yuval', ''], ['Pentland', 'Alex', '']]","['Rich data', 'reality mining', 'social network', 'mobile sensing', 'inferring attributes']"
17826,0710.4655,EDA Publishing Association,"Baosheng Wang, Yuejian Wu, Andre Ivanov",A Fast Diagnosis Scheme for Distributed Small Embedded SRAMs,Submitted on behalf of EDAA (http://www.edaa.com/),"Dans Design, Automation and Test in Europe - DATE'05, Munich :
  Allemagne (2005)",,,cs.AR,,"  This paper proposes a diagnosis scheme aimed at reducing diagnosis time of
distributed small embedded SRAMs (e-SRAMs). This scheme improves the one
proposed in [A parallel built-in self-diagnostic method for embedded memory
buffers, A parallel built-in self-diagnostic method for embedded memory
arrays]. The improvements are mainly two-fold. On one hand, the diagnosis of
time-consuming Data Retention Faults (DRFs), which is neglected by the
diagnosis architecture in [A parallel built-in self-diagnostic method for
embedded memory buffers, A parallel built-in self-diagnostic method for
embedded memory arrays], is now considered and performed via a DFT technique
referred to as the ""No Write Recovery Test Mode (NWRTM)"". On the other hand, a
pair comprising a Serial to Parallel Converter (SPC) and a Parallel to Serial
Converter (PSC) is utilized to replace the bi-directional serial interface, to
avoid the problems of serial fault masking and defect rate dependent diagnosis.
Results from our evaluations show that the proposed diagnosis scheme achieves
an increased diagnosis coverage and reduces diagnosis time compared to those
obtained in [A parallel built-in self-diagnostic method for embedded memory
buffers, A parallel built-in self-diagnostic method for embedded memory
arrays], with neglectable extra area cost.
","[{'version': 'v1', 'created': 'Thu, 25 Oct 2007 08:34:09 GMT'}]",2011-11-09,"[['Wang', 'Baosheng', ''], ['Wu', 'Yuejian', ''], ['Ivanov', 'Andre', '']]","['Distributed Small Embedded SRAMs', 'Memory Diagnosis', 'Data Retention Fault', 'SPC', 'PSC', 'Diagnosis Time']"
17827,0711.2780,Salvatore Scellato,"Salvatore Scellato (Scuola Superiore di Catania), Cecilia Mascolo
  (Department of Computer Science, University College London), Mirco Musolesi
  (Department of Computer Science, Dartmouth College), Vito Latora
  (Dipartimento di Fisica e Astronomia, Universita' di Catania)","Epcast: Controlled Dissemination in Human-based Wireless Networks by
  means of Epidemic Spreading Models",,,,,cs.NI,,"  Epidemics-inspired techniques have received huge attention in recent years
from the distributed systems and networking communities. These algorithms and
protocols rely on probabilistic message replication and redundancy to ensure
reliable communication. Moreover, they have been successfully exploited to
support group communication in distributed systems, broadcasting, multicasting
and information dissemination in fixed and mobile networks. However, in most of
the existing work, the probability of infection is determined heuristically,
without relying on any analytical model. This often leads to unnecessarily high
transmission overheads.
  In this paper we show that models of epidemic spreading in complex networks
can be applied to the problem of tuning and controlling the dissemination of
information in wireless ad hoc networks composed of devices carried by
individuals, i.e., human-based networks. The novelty of our idea resides in the
evaluation and exploitation of the structure of the underlying human network
for the automatic tuning of the dissemination process in order to improve the
protocol performance. We evaluate the results using synthetic mobility models
and real human contacts traces.
","[{'version': 'v1', 'created': 'Sun, 18 Nov 2007 09:29:19 GMT'}]",2007-11-20,"[['Scellato', 'Salvatore', '', 'Scuola Superiore di Catania'], ['Mascolo', 'Cecilia', '', 'Department of Computer Science, University College London'], ['Musolesi', 'Mirco', '', 'Department of Computer Science, Dartmouth College'], ['Latora', 'Vito', '', ""Dipartimento di Fisica e Astronomia, Universita' di Catania""]]","['Wireless Networks', 'Mobile Ad Hoc Networks', 'Epidemic Spreading Models', 'Complex Networks', 'Data Dissemination']"
17828,0708.2303,W Saba,Walid S. Saba,Compositional Semantics Grounded in Commonsense Metaphysics,,,,,cs.AI cs.CL,,"  We argue for a compositional semantics grounded in a strongly typed ontology
that reflects our commonsense view of the world and the way we talk about it in
ordinary language. Assuming the existence of such a structure, we show that the
semantics of various natural language phenomena may become nearly trivial.
","[{'version': 'v1', 'created': 'Fri, 17 Aug 2007 01:15:11 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Aug 2007 17:48:14 GMT'}]",2009-09-29,"[['Saba', 'Walid S.', '']]","['Semantics', 'ontology', 'commonsense knowledge']"
17829,1710.04999,Somphong Jitman,Somphong Jitman and Todsapol Mankean,Matrix-Product Constructions for Hermitian Self-Orthogonal Codes,,,,,cs.IT math.IT math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-orthogonal codes have been of interest due to there rich algebraic
structures and wide applications. Euclidean self-orthogonal codes have been
quite well studied in literature. Here, we have focused on Hermitian
self-orthogonal codes. Constructions of such codes have been given based on the
well-known matrix-product construction for linear codes. Criterion for the
underlying matrix and the input codes required in such constructions have been
determined. In many cases, the Hermitian self-orthogonality of the input codes
and the assumption that the underlying matrix is unitary can be relaxed. Some
special matrices used in the constructions and illustrative examples of good
Hermitian self-orthogonal codes have been provided as well.
","[{'version': 'v1', 'created': 'Fri, 13 Oct 2017 16:43:49 GMT'}]",2017-10-16,"[['Jitman', 'Somphong', ''], ['Mankean', 'Todsapol', '']]","['matrix-product codes', 'Hermitian self-orthogonal codes', 'quasi-unitary matrices']"
17830,1604.08826,Katsunori Ohnishi,"Katsunori Ohnishi, Masatoshi Hidaka, Tatsuya Harada",Improved Dense Trajectory with Cross Streams,"6 pages, 3 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Improved dense trajectories (iDT) have shown great performance in action
recognition, and their combination with the two-stream approach has achieved
state-of-the-art performance. It is, however, difficult for iDT to completely
remove background trajectories from video with camera shaking. Trajectories in
less discriminative regions should be given modest weights in order to create
more discriminative local descriptors for action recognition. In addition, the
two-stream approach, which learns appearance and motion information separately,
cannot focus on motion in important regions when extracting features from
spatial convolutional layers of the appearance network, and vice versa. In
order to address the above mentioned problems, we propose a new local
descriptor that pools a new convolutional layer obtained from crossing two
networks along iDT. This new descriptor is calculated by applying
discriminative weights learned from one network to a convolutional layer of the
other network. Our method has achieved state-of-the-art performance on ordinal
action recognition datasets, 92.3% on UCF101, and 66.2% on HMDB51.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2016 13:39:40 GMT'}]",2016-05-02,"[['Ohnishi', 'Katsunori', ''], ['Hidaka', 'Masatoshi', ''], ['Harada', 'Tatsuya', '']]","['Action Recognition', 'Egocentric Vision', 'Video representation', 'Local descriptors', 'Video classification']"
17831,0710.5002,Boris Skoric,B. Skoric,The entropy of keys derived from laser speckle,,,,,cs.CR cs.CV,,"  Laser speckle has been proposed in a number of papers as a high-entropy
source of unpredictable bits for use in security applications. Bit strings
derived from speckle can be used for a variety of security purposes such as
identification, authentication, anti-counterfeiting, secure key storage, random
number generation and tamper protection. The choice of laser speckle as a
source of random keys is quite natural, given the chaotic properties of
speckle. However, this same chaotic behaviour also causes reproducibility
problems. Cryptographic protocols require either zero noise or very low noise
in their inputs; hence the issue of error rates is critical to applications of
laser speckle in cryptography. Most of the literature uses an error reduction
method based on Gabor filtering. Though the method is successful, it has not
been thoroughly analysed.
  In this paper we present a statistical analysis of Gabor-filtered speckle
patterns. We introduce a model in which perturbations are described as random
phase changes in the source plane. Using this model we compute the second and
fourth order statistics of Gabor coefficients. We determine the mutual
information between perturbed and unperturbed Gabor coefficients and the bit
error rate in the derived bit string. The mutual information provides an
absolute upper bound on the number of secure bits that can be reproducibly
extracted from noisy measurements.
","[{'version': 'v1', 'created': 'Fri, 26 Oct 2007 06:56:23 GMT'}]",2007-10-29,"[['Skoric', 'B.', '']]","['Physical Unclonable Function', 'PUF', 'speckle', 'Gabor transform', 'entropy', 'keyextraction', 'fuzzy extractor']"
17832,1212.3753,Samet Oymak,"Samet Oymak, Amin Jalali, Maryam Fazel, Yonina C. Eldar, and Babak
  Hassibi","Simultaneously Structured Models with Application to Sparse and Low-rank
  Matrices","38 pages, 9 figures",,,,cs.IT math.IT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The topic of recovery of a structured model given a small number of linear
observations has been well-studied in recent years. Examples include recovering
sparse or group-sparse vectors, low-rank matrices, and the sum of sparse and
low-rank matrices, among others. In various applications in signal processing
and machine learning, the model of interest is known to be structured in
several ways at the same time, for example, a matrix that is simultaneously
sparse and low-rank.
  Often norms that promote each individual structure are known, and allow for
recovery using an order-wise optimal number of measurements (e.g., $\ell_1$
norm for sparsity, nuclear norm for matrix rank). Hence, it is reasonable to
minimize a combination of such norms. We show that, surprisingly, if we use
multi-objective optimization with these norms, then we can do no better,
order-wise, than an algorithm that exploits only one of the present structures.
This result suggests that to fully exploit the multiple structures, we need an
entirely new convex relaxation, i.e. not one that is a function of the convex
relaxations used for each structure. We then specialize our results to the case
of sparse and low-rank matrices. We show that a nonconvex formulation of the
problem can recover the model from very few measurements, which is on the order
of the degrees of freedom of the matrix, whereas the convex problem obtained
from a combination of the $\ell_1$ and nuclear norms requires many more
measurements. This proves an order-wise gap between the performance of the
convex and nonconvex recovery problems in this case. Our framework applies to
arbitrary structure-inducing norms as well as to a wide range of measurement
ensembles. This allows us to give performance bounds for problems such as
sparse phase retrieval and low-rank tensor completion.
","[{'version': 'v1', 'created': 'Sun, 16 Dec 2012 06:14:44 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Feb 2013 13:20:56 GMT'}, {'version': 'v3', 'created': 'Fri, 25 Jul 2014 06:35:46 GMT'}]",2014-07-28,"[['Oymak', 'Samet', ''], ['Jalali', 'Amin', ''], ['Fazel', 'Maryam', ''], ['Eldar', 'Yonina C.', ''], ['Hassibi', 'Babak', '']]","['Compressed sensing', 'convex relaxation', 'regularization']"
17833,1606.04662,Igor Korkin,Igor Korkin and Iwan Nesterow,"Acceleration of Statistical Detection of Zero-day Malware in the Memory
  Dump Using CUDA-enabled GPU Hardware",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper focuses on the anticipatory enhancement of methods of detecting
stealth software. Cyber security detection tools are insufficiently powerful to
reveal the most recent cyber-attacks which use malware. In this paper, we will
present first an idea of the highest stealth malware, as this is the most
complicated scenario for detection because it combines both existing
anti-forensic techniques together with their potential improvements. Second, we
present new detection methods, which are resilient to this hidden prototype. To
help solve this detection challenge, we have analyzed Windows memory content
using a new method of Shannon Entropy calculation; methods of digital
photogrammetry; the Zipf Mandelbrot law, as well as by disassembling the memory
content and analyzing the output. Finally, we present an idea and architecture
of the software tool, which uses CUDA enabled GPU hardware to speed-up memory
forensics. All three ideas are currently a work in progress.
","[{'version': 'v1', 'created': 'Wed, 15 Jun 2016 07:33:38 GMT'}]",2016-06-16,"[['Korkin', 'Igor', ''], ['Nesterow', 'Iwan', '']]","['rootkit detection', 'anti-forensics', 'memory analysis', 'scattered fragments', 'anticipatory enhancement', 'CUDA']"
17834,1206.1751,Kristoffer Arnsfelt Hansen,"Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V.
  Podolskii, Elias Tsigaridas",Patience of Matrix Games,,,,,cs.DM cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For matrix games we study how small nonzero probability must be used in
optimal strategies. We show that for nxn win-lose-draw games (i.e. (-1,0,1)
matrix games) nonzero probabilities smaller than n^{-O(n)} are never needed. We
also construct an explicit nxn win-lose game such that the unique optimal
strategy uses a nonzero probability as small as n^{-Omega(n)}. This is done by
constructing an explicit (-1,1) nonsingular nxn matrix, for which the inverse
has only nonnegative entries and where some of the entries are of value
n^{Omega(n)}.
","[{'version': 'v1', 'created': 'Fri, 8 Jun 2012 12:54:06 GMT'}]",2012-06-12,"[['Hansen', 'Kristoffer Arnsfelt', ''], ['Ibsen-Jensen', 'Rasmus', ''], ['Podolskii', 'Vladimir V.', ''], ['Tsigaridas', 'Elias', '']]","['Matrix Games', 'Ill-conditioned Matrices', 'Nonnegative Inverse']"
17835,1007.4853,Nadir Farhi,Nadir Farhi and Bruno Gaujal,"Performance bounds in wormhole routing, a network calculus approach",26 pages,,,,cs.PF cs.NI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a model of performance bound calculus on feedforward networks
where data packets are routed under wormhole routing discipline. We are
interested in determining maximum end-to-end delays and backlogs of messages or
packets going from a source node to a destination node, through a given virtual
path in the network. Our objective here is to give a network calculus approach
for calculating the performance bounds. First we propose a new concept of
curves that we call packet curves. The curves permit to model constraints on
packet lengths of a given data flow, when the lengths are allowed to be
different. Second, we use this new concept to propose an approach for
calculating residual services for data flows served under non preemptive
service disciplines. Third, we model a binary switch (with two input ports and
two output ports), where data is served under wormhole discipline. We present
our approach for computing the residual services and deduce the worst case
bounds for flows passing through a wormhole binary switch. Finally, we
illustrate this approach in numerical examples, and show how to extend it to
feedforward networks.
","[{'version': 'v1', 'created': 'Tue, 27 Jul 2010 23:47:58 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Aug 2010 14:10:38 GMT'}]",2010-08-04,"[['Farhi', 'Nadir', ''], ['Gaujal', 'Bruno', '']]","['Network Calculus', 'Quality of Service Guarantees', 'Wormhole Routing', 'Spacewire']"
17836,1504.06054,Muhammad Ali Raza Anjum,Muhammad Ali Raza Anjum,A New Approach to Adaptive Signal Processing,,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A unified linear algebraic approach to adaptive signal processing (ASP) is
presented. Starting from just Ax=b, key ASP algorithms are derived in a simple,
systematic, and integrated manner without requiring any background knowledge to
the field. Algorithms covered are Steepest Descent, LMS, Normalized LMS,
Kaczmarz, Affine Projection, RLS, Kalman filter, and MMSE/Least Square Wiener
filters. By following this approach, readers will discover a synthesis; they
will learn that one and only one equation is involved in all these algorithms.
They will also learn that this one equation forms the basis of more advanced
algorithms like reduced rank adaptive filters, extended Kalman filter, particle
filters, multigrid methods, preconditioning methods, Krylov subspace methods
and conjugate gradients. This will enable them to enter many sophisticated
realms of modern research and development. Eventually, this one equation will
not only become their passport to ASP but also to many highly specialized areas
of computational science and engineering.
","[{'version': 'v1', 'created': 'Thu, 23 Apr 2015 06:37:29 GMT'}]",2015-04-24,"[['Anjum', 'Muhammad Ali Raza', '']]","['Adaptive signal processing', 'Adaptive filters', 'Adaptive algorithms', 'Kalman filter', 'RLS', 'Wiener filter']"
17837,1506.02543,Noman Islam Dr.,"Noman Islam, Zubair A. Shaikh",A novel approach to Service Discovery in Mobile Adhoc Network,International Networking and Communications Conference (INCC-2008),,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile Adhoc Network (MANET) is a network of a number of mobile routers and
associated hosts, organized in a random fashion via wireless links. During
recent years MANET has gained enormous amount of attention and has been widely
used for not only military purposes but for search-and-rescue operations,
intelligent transportation system, data collection, virtual classrooms and
ubiquitous computing. Service Discovery is one of the most important issues in
MANET. It is defined as the process of facilitating service providers to
advertise their services in a dynamic way and to allow consumers to discover
and access those services in an efficient and scalable manner. In this paper,
we are proposing a flexible and efficient approach to service discovery for
MANET by extending the work of Torres et al. (2004)...
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2015 15:19:18 GMT'}]",2015-06-09,"[['Islam', 'Noman', ''], ['Shaikh', 'Zubair A.', '']]","['MANET', 'Ad hoc network', 'Service Discovery', 'Ubiquitous Computing']"
17838,1708.00352,Hung Cao,"Lilian Hernandez, Hung Cao, Monica Wachowicz",Implementing an Edge-Fog-Cloud architecture for stream data management,"stream data life cycle, edge computing, cloud computing, fog
  computing, Internet of Moving Things, will be published in OpenFog Congress
  2017",,,,cs.DC cs.CY cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Internet of Moving Things (IoMT) requires support for a data life cycle
process ranging from sorting, cleaning and monitoring data streams to more
complex tasks such as querying, aggregation, and analytics. Current solutions
for stream data management in IoMT have been focused on partial aspects of a
data life cycle process, with special emphasis on sensor networks. This paper
aims to address this problem by developing streaming data life cycle process
that incorporates an edge/fog/cloud architecture that is needed for handling
heterogeneous, streaming and geographically-dispersed IoMT devices. We propose
a 3-tier architecture to support an instant intra-layer communication that
establishes a stream data flow in real-time to respond to immediate data life
cycle tasks in the system. Communication and process are thus the defining
factors in the design of our stream data management solution for IoMT. We
describe and evaluate our prototype implementation using real-time transit data
feeds. Preliminary results are showing the advantages of running data life
cycle tasks for reducing the volume of data streams that are redundant and
should not be transported to the cloud.
","[{'version': 'v1', 'created': 'Tue, 1 Aug 2017 14:19:44 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Sep 2017 17:19:48 GMT'}]",2017-09-28,"[['Hernandez', 'Lilian', ''], ['Cao', 'Hung', ''], ['Wachowicz', 'Monica', '']]","['stream data life cycle', 'edge computing', 'cloud']"
17839,1305.1221,Mario Blaum,Mario Blaum and James S. Plank,Construction of two SD Codes,8 pages. arXiv admin note: text overlap with arXiv:1305.0032,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  SD codes are erasure codes that address the mixed failure mode of current
RAID systems. Rather than dedicate entire disks to erasure coding, as done in
RAID-5, RAID-6 and Reed-Solomon coding, an SD code dedicates entire disks, plus
individual sectors to erasure coding. The code then tolerates combinations of
disk and sector errors, rather than solely disk errors. It is been an open
problem to construct general codes that have the SD property, and previous work
has relied on Monte Carlo searches. In this paper, we present two general
constructions that address the cases with one disk and two sectors, and two
disks and two sectors. Additionally, we make an observation about shortening SD
codes that allows us to prune Monte Carlo searches.
","[{'version': 'v1', 'created': 'Mon, 6 May 2013 15:30:31 GMT'}]",2013-05-07,"[['Blaum', 'Mario', ''], ['Plank', 'James S.', '']]","['Error-correcting codes', 'RAID architectures', 'MDS codes', 'array codes', 'Reed-Solomon codes', 'Blaum-Roth codes', 'PMDS codes', 'SD codes']"
17840,0806.2533,Ananthanarayanan Chockalingam,"Saif K. Mohammed, A. Chockalingam, and B. Sundar Rajan","Asymptotic Analysis of the Performance of LAS Algorithm for Large-MIMO
  Detection","This work in part was presented in IEEE PIMRC'2008, Cannes, France,
  September 2008",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In our recent work, we reported an exhaustive study on the simulated bit
error rate (BER) performance of a low-complexity likelihood ascent search (LAS)
algorithm for detection in large multiple-input multiple-output (MIMO) systems
with large number of antennas that achieve high spectral efficiencies. Though
the algorithm was shown to achieve increasingly closer to near
maximum-likelihood (ML) performance through simulations, no BER analysis was
reported. Here, we extend our work on LAS and report an asymptotic BER analysis
of the LAS algorithm in the large system limit, where $N_t,N_r \to \infty$ with
$N_t=N_r$, where $N_t$ and $N_r$ are the number of transmit and receive
antennas. We prove that the error performance of the LAS detector in V-BLAST
with 4-QAM in i.i.d. Rayleigh fading converges to that of the ML detector as
$N_t,N_r \to \infty$.
","[{'version': 'v1', 'created': 'Mon, 16 Jun 2008 13:14:37 GMT'}, {'version': 'v2', 'created': 'Sat, 31 Oct 2009 08:03:16 GMT'}]",2009-10-31,"[['Mohammed', 'Saif K.', ''], ['Chockalingam', 'A.', ''], ['Rajan', 'B. Sundar', '']]","['High spectral efficiencies', 'large-MIMO detection', 'likelihood ascent search']"
17841,1504.02092,Balaji Dhanasekaran,"R.D. Balaji, Ramkumar Lakshminarayan, Er. Malathi Balaji",Revolutionary Hybrid E-Books for Enhanced Higher Learning,"8 pages, ICOET 2015, Oman. arXiv admin note: substantial text overlap
  with arXiv:1504.01855",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Books are the best friends of human beings and make them a rational animal.
In this E-world our traditional books are losing their values. Recent surveys
are proving that the younger generations are not much interested in visiting
libraries and reading books due to their addiction towards the electronic
gadgets. Many publishers are now changed their strategy by publishing and
promoting ebooks. Academicians are also badly affected by this trend and they
are forced to motivate the students to improve their reading habits for their
better performance in the institutions and to be responsible citizens of a
country.
  There are many difficulties faced by the ebook readers and it discourages the
people to read an ebook for long time like a normal printed book. The main
objective of this paper is to introduce a hybrid Ebook which is capable of
having audio and video files also in it. This makes the people to read the
e-book with modern electronic formats. This multimedia facility makes the
people to read or listen or watch the ebooks for long time. We have quoted the
survey results which prove that the students prefer to read hybrid books than
normal ebooks or the printed handouts in College of Applied Sciences, Oman.
Still we feel these books should have few more facilities, so that people who
like traditional books will also adopt these ebooks, without losing the
satisfaction of reading printed books. These things are listed in the
recommendations and conclusion section.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2015 08:06:25 GMT'}]",2015-04-10,"[['Balaji', 'R. D.', ''], ['Lakshminarayan', 'Ramkumar', ''], ['Balaji', 'Er. Malathi', '']]","['E-Book', 'M-Learning', 'Flipped Classroom', 'ICT', 'Higher Education']"
17842,1303.6906,Mateusz Fedoryszak,"Mateusz Fedoryszak, Dominika Tkaczyk and {\L}ukasz Bolikowski",Large scale citation matching using Apache Hadoop,"11 pages, 4 figures",,,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During the process of citation matching links from bibliography entries to
referenced publications are created. Such links are indicators of topical
similarity between linked texts, are used in assessing the impact of the
referenced document and improve navigation in the user interfaces of digital
libraries. In this paper we present a citation matching method and show how to
scale it up to handle great amounts of data using appropriate indexing and a
MapReduce paradigm in the Hadoop environment.
","[{'version': 'v1', 'created': 'Tue, 26 Mar 2013 16:33:00 GMT'}]",2013-03-28,"[['Fedoryszak', 'Mateusz', ''], ['Tkaczyk', 'Dominika', ''], ['Bolikowski', 'Łukasz', '']]","['citation matching', 'CRF', 'SVM', 'approximate indexing', 'editdistance', 'map-reduce', 'Hadoop']"
17843,1701.02080,Sudhir Kumar,Sudhir Kumar and Rajesh M. Hegde,"A Review of Localization and Tracking Algorithms in Wireless Sensor
  Networks",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a comprehensive survey of the pioneer as well as the state
of-the-art localization and tracking methods in the wireless sensor networks is
presented. Localization is mostly applicable for the static sensor nodes,
whereas, tracking for the mobile sensor nodes. The localization algorithms are
broadly classified as range-based and range-free methods. The estimated range
(distance) between an anchor and an unknown node is highly erroneous in an
indoor scenario. This limitation can be handled up to a large extent by
employing a large number of existing access points (APs) in the range free
localization method. Recent works emphasize on the use multi-sensor data like
magnetic, inertial, compass, gyroscope, ultrasound, infrared, visual and/or
odometer to improve the localization accuracy further. Additionally, tracking
method does the future prediction of location based on the past location
history. A smooth trajectory is noted even if some of the received measurements
are erroneous. Real experimental set-ups such as National Instruments (NI)
wireless sensor nodes, Crossbow motes and hand-held devices for carrying out
the localization and tracking are also highlighted herein.
","[{'version': 'v1', 'created': 'Mon, 9 Jan 2017 07:02:26 GMT'}]",2017-01-10,"[['Kumar', 'Sudhir', ''], ['Hegde', 'Rajesh M.', '']]","['Wireless Sensor Networks', 'Localization', 'Tracking']"
17844,1307.3398,Karnavel Kuppusamy,"K. Karnavel, V. Divya, Gnanakeerthika, P. Karthika","Agent Based Software Testing Framework (ABSTF) for Application
  Maintenance",,,,,cs.SE,http://creativecommons.org/licenses/by/3.0/,"  Software testing framework can be stated as the process of verifying and
validating that a computer program/application works as expected and meets the
requirements of the user. Usually testing can be done manually or using tools.
Manual testing can be time consuming and tedious, also it requires heavy
investment of human resources. Testing tools in fact have many advantages and
are widely used nowadays, but also has several disadvantages. One particular
problem is that human intervention is no longer needed. Testing tools are of
high cost and so, it cannot be used for small companies. Hence in this paper we
propose Agent based testing, which is a fast growing approach in testing field.
The proposed system (ABSTF) has to reduce the application testing moment,
easily find out bug and solve the bug by Regression Testing. Here by we are
going to use a safe efficient regression selection technique algorithm to
selectively retest the modified program. We also use Traceability relation of
completeness checking for agent oriented system, which identifies missing
elements in entire application and classifies defect in the testing moment.
With the ability of agents to act autonomously, monitoring code changes and
generating test cases for the changed version of code can be done dynamically.
","[{'version': 'v1', 'created': 'Fri, 12 Jul 2013 10:28:07 GMT'}]",2013-07-15,"[['Karnavel', 'K.', ''], ['Divya', 'V.', ''], ['Gnanakeerthika', '', ''], ['Karthika', 'P.', '']]","['Regression Testing', 'Selection Technique Algorithm', 'Agent based software testing']"
17845,1407.2082,Satish Bhairannawar,"Satish S Bhairannawar, Rathan R, Raja K B, Venugopal K R and L M
  Patnaik","FPGA Based Efficient Multiplier for Image Processing Applications Using
  Recursive Error Free Mitchell Log Multiplier and KOM Architecture",,,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Digital Image processing applications like medical imaging, satellite
imaging, Biometric trait images etc., rely on multipliers to improve the
quality of image. However, existing multiplication techniques introduce errors
in the output with consumption of more time, hence error free high speed
multipliers has to be designed. In this paper we propose FPGA based Recursive
Error Free Mitchell Log Multiplier (REFMLM) for image Filters. The 2x2 error
free Mitchell log multiplier is designed with zero error by introducing error
correction term is used in higher order Karastuba-Ofman Multiplier (KOM)
Architectures. The higher order KOM multipliers is decomposed into number of
lower order multipliers using radix 2 till basic multiplier block of order 2x2
which is designed by error free Mitchell log multiplier. The 8x8 REFMLM is
tested for Gaussian filter to remove noise in fingerprint image. The Multiplier
is synthesized using Spartan 3 FPGA family device XC3S1500-5fg320. It is
observed that the performance parameters such as area utilization, speed, error
and PSNR are better in the case of proposed architecture compared to existing
architectures
","[{'version': 'v1', 'created': 'Tue, 8 Jul 2014 13:46:42 GMT'}]",2014-07-09,"[['Bhairannawar', 'Satish S', ''], ['R', 'Rathan', ''], ['B', 'Raja K', ''], ['R', 'Venugopal K', ''], ['Patnaik', 'L M', '']]","['Mitchell Log Multiplier', 'Karatsuba Ofman Multiplier', 'Gaussian Image Filter', 'PSNR', 'FPGA']"
17846,1212.6040,Seifedine Kadry Seifedine Kadry,"Seifedine Kadry, Maha ElShalkamy",Toward New Vision in Teaching Calculus,"IERI Procedia, Elsevier. 2012",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Usually the first course in mathematics is calculus. Its a core course in the
curriculum of the Business, Engineering and the Sciences. However many students
face difficulties to learn calculus. These difficulties are often caused by the
prior fear of mathematics. The students today cant live without using computer
technology. The uses of computer for teaching and learning can transform the
boring traditional methodology of teach to more active and attractive method.
In this paper, we will show how we can use Excel in teaching calculus to
improve our students learning and understanding through different types of
applications ranging from Business to Engineering. The effectiveness of the
proposed methodology was tested on a random sample of 45 students from
different majors over a period of two semesters.
","[{'version': 'v1', 'created': 'Tue, 25 Dec 2012 12:59:01 GMT'}]",2012-12-27,"[['Kadry', 'Seifedine', ''], ['ElShalkamy', 'Maha', '']]","['teaching methodology', 'visual approach', 'Microsoft Excel', 'calculus', 'statistical evaluation']"
17847,1704.01927,Barun Gorain,Barun Gorain and Andrzej Pelc,"Short Labeling Schemes for Topology Recognition in Wireless Tree
  Networks",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of topology recognition in wireless (radio) networks
modeled as undirected graphs. Topology recognition is a fundamental task in
which every node of the network has to output a map of the underlying graph
i.e., an isomorphic copy of it, and situate itself in this map. In wireless
networks, nodes communicate in synchronous rounds. In each round a node can
either transmit a message to all its neighbors, or stay silent and listen. At
the receiving end, a node $v$ hears a message from a neighbor $w$ in a given
round, if $v$ listens in this round, and if $w$ is its only neighbor that
transmits in this round. Nodes have labels which are (not necessarily
different) binary strings. The length of a labeling scheme is the largest
length of a label. We concentrate on wireless networks modeled by trees, and we
investigate two problems.
  \begin{itemize} \item What is the shortest labeling scheme that permits
topology recognition in all wireless tree networks of diameter $D$ and maximum
degree $\Delta$?
  \item What is the fastest topology recognition algorithm working for all
wireless tree networks of diameter $D$ and maximum degree $\Delta$, using such
a short labeling scheme? \end{itemize}
  We are interested in deterministic topology recognition algorithms. For the
first problem, we show that the minimum length of a labeling scheme allowing
topology recognition in all trees of maximum degree $\Delta \geq 3$ is
$\Theta(\log\log \Delta)$. For such short schemes, used by an algorithm working
for the class of trees of diameter $D\geq 4$ and maximum degree $\Delta \geq
3$, we show almost matching bounds on the time of topology recognition: an
upper bound $O(D\Delta)$, and a lower bound $\Omega(D\Delta^{\epsilon})$, for
any constant $\epsilon<1$.
","[{'version': 'v1', 'created': 'Thu, 6 Apr 2017 16:47:59 GMT'}]",2017-04-07,"[['Gorain', 'Barun', ''], ['Pelc', 'Andrzej', '']]","['topology recognition', 'wireless network', 'labeling scheme', 'feasibility', 'tree', 'time']"
17848,1003.0691,Joshua Dillon,Joshua V Dillon and Guy Lebanon,"Statistical and Computational Tradeoffs in Stochastic Composite
  Likelihood","30 pages, 97 figures, 2 authors",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Maximum likelihood estimators are often of limited practical use due to the
intensive computation they require. We propose a family of alternative
estimators that maximize a stochastic variation of the composite likelihood
function. Each of the estimators resolve the computation-accuracy tradeoff
differently, and taken together they span a continuous spectrum of
computation-accuracy tradeoff resolutions. We prove the consistency of the
estimators, provide formulas for their asymptotic variance, statistical
robustness, and computational complexity. We discuss experimental results in
the context of Boltzmann machines and conditional random fields. The
theoretical and experimental studies demonstrate the effectiveness of the
estimators when the computational resources are insufficient. They also
demonstrate that in some cases reduced computational complexity is associated
with robustness thereby increasing statistical accuracy.
","[{'version': 'v1', 'created': 'Tue, 2 Mar 2010 21:54:16 GMT'}]",2010-03-04,"[['Dillon', 'Joshua V', ''], ['Lebanon', 'Guy', '']]","['Markov random fields', 'composite likelihood', 'maximum likelihood estimation']"
17849,1306.4633,Mayank Shishodia B.Tech,Sumit Goswami and Mayank Singh Shishodia,A Fuzzy Based Approach to Text Mining and Document Clustering,"10 pages, 6 tables, 1 figure, review paper, International Journal of
  Data Mining & Knowledge Management Process (IJDKP) ISSN : 2230 - 9608[Online]
  ; 2231 - 007X [Print]. Paper can be found at
  http://airccse.org/journal/ijdkp/current2013.html",,,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fuzzy logic deals with degrees of truth. In this paper, we have shown how to
apply fuzzy logic in text mining in order to perform document clustering. We
took an example of document clustering where the documents had to be clustered
into two categories. The method involved cleaning up the text and stemming of
words. Then, we chose m number of features which differ significantly in their
word frequencies (WF), normalized by document length, between documents
belonging to these two clusters. The documents to be clustered were represented
as a collection of m normalized WF values. Fuzzy c-means (FCM) algorithm was
used to cluster these documents into two clusters. After the FCM execution
finished, the documents in the two clusters were analysed for the values of
their respective m features. It was known that documents belonging to a
document type, say X, tend to have higher WF values for some particular
features. If the documents belonging to a cluster had higher WF values for
those same features, then that cluster was said to represent X. By fuzzy logic,
we not only get the cluster name, but also the degree to which a document
belongs to a cluster.
","[{'version': 'v1', 'created': 'Thu, 6 Jun 2013 07:35:23 GMT'}]",2013-06-20,"[['Goswami', 'Sumit', ''], ['Shishodia', 'Mayank Singh', '']]","['Fuzzy Logic', 'Text Mining', 'Fuzzy c-means', 'Document Clustering']"
17850,1107.1031,Pabitra Pal Choudhury,"Sk. S. Hassan, A. Roy, P. Pal. Choudhury, B. K. Nayak",Integral Value Transformations: A Class of Discrete Dynamical Systems,,,,,cs.DM math.DS,http://creativecommons.org/licenses/publicdomain/,"  Here the Integral Value Transformations (IVTs) are considered to be Discrete
Dynamical System map in the space\mathbb{N}_(0). In this paper, the dynamics of
IVTs is deciphered through the light of Topological Dynamics.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2011 06:16:13 GMT'}]",2011-07-07,"[['Hassan', 'Sk. S.', ''], ['Roy', 'A.', ''], ['Choudhury', 'P. Pal.', ''], ['Nayak', 'B. K.', '']]","['Discrete Dynamical Systems', 'Topological Dynamics', 'integral value Transformations']"
17851,1004.0084,Yao Sun,Yao Sun and Dingkang Wang,A New Proof for the Correctness of F5 (F5-Like) Algorithm,,,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The famous F5 algorithm for computing Gr\""obner basis was presented by
Faug\`ere in 2002 without complete proofs for its correctness. The current
authors have simplified the original F5 algorithm into an F5 algorithm in
Buchberger's style (F5B algorithm), which is equivalent to original F5
algorithm and may deduce some F5-like versions. In this paper, the F5B
algorithm is briefly revisited and a new complete proof for the correctness of
F5B algorithm is proposed. This new proof is not limited to homogeneous systems
and does not depend on the strategy of selecting critical pairs (i.e. the
strategy deciding which critical pair is computed first) such that any strategy
could be utilized in F5B (F5) algorithm. From this new proof, we find that the
special reduction procedure (F5-reduction) is the key of F5 algorithm, so
maintaining this special reduction, various variation algorithms become
available. A natural variation of F5 algorithm, which transforms original F5
algorithm to a non-incremental algorithm, is presented and proved in this paper
as well. This natural variation has been implemented over the Boolean ring. The
two revised criteria in this natural variation are also able to reject almost
all unnecessary computations and few polynomials reduce to 0 in most examples.
","[{'version': 'v1', 'created': 'Thu, 1 Apr 2010 08:51:30 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Apr 2010 09:17:21 GMT'}, {'version': 'v3', 'created': 'Sun, 25 Apr 2010 09:01:16 GMT'}, {'version': 'v4', 'created': 'Wed, 30 Jun 2010 04:30:02 GMT'}]",2010-07-01,"[['Sun', 'Yao', ''], ['Wang', 'Dingkang', '']]","['Gr¨obner basis', 'F5 algorithm', 'proof of correctness', 'variation algorithm']"
17852,1009.5347,Ali Reza Manashty,"Ali Reza Manashty, Mohammad Reza Ahmadzadeh Raji, Zahra Forootan
  Jahromi and Amir Rajabzadeh","ARMrayan Multimedia Mobile CMS: a Simplified Approach towards
  Content-Oriented Mobile Application Designing","6 Pages, 4 figures, Keywords- Mobile CMS, MCMS, Mobile Content
  Builder, J2ME Application, Multimedia Mobile Application, Multimedia CMS,
  Multimedia Mobile CMS, Content Management System; ISSN. 2070-3724","International Conference on Wireless Communication and Mobile
  Computing (ICWCMC 2010), Proceedings of WASET, vol. 62, pp. 62-67, February
  2010",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ARMrayan Multimedia Mobile CMS (Content Management System) is the first
mobile CMS that gives the opportunity to users for creating multimedia J2ME
mobile applications with their desired content, design and logo; simply,
without any need for writing even a line of code. The low-level programming and
compatibility problems of the J2ME, along with UI designing difficulties, makes
it hard for most people -even programmers- to broadcast their content to the
widespread mobile phones used by nearly all people. This system provides
user-friendly, PC-based tools for creating a tree index of pages and inserting
multiple multimedia contents (e.g. sound, video and picture) in each page for
creating a J2ME mobile application. The output is a stand-alone Java mobile
application that has a user interface, shows texts and pictures and plays music
and videos regardless of the type of devices used as long as the devices
support the J2ME platform. Bitmap fonts have also been used thus Middle Eastern
languages can be easily supported on all mobile phone devices. We omitted
programming concepts for users in order to simplify multimedia content-oriented
mobile application designing for use in educational, cultural or marketing
centers. Ordinary operators can now create a variety of multimedia mobile
applications such as tutorials, catalogues, books, and guides in minutes rather
than months. Simplicity and power has been the goal of this CMS. In this paper,
we present the software engineered-designed concepts of the ARMrayan MCMS along
with the implementation challenges faces and solutions adapted.
","[{'version': 'v1', 'created': 'Mon, 27 Sep 2010 18:22:50 GMT'}]",2010-09-28,"[['Manashty', 'Ali Reza', ''], ['Raji', 'Mohammad Reza Ahmadzadeh', ''], ['Jahromi', 'Zahra Forootan', ''], ['Rajabzadeh', 'Amir', '']]","['Mobile CMS', 'MCMS', 'Mobile Content Builder', 'J2ME Application', 'Multimedia Mobile Application', 'Multimedia CMS', 'Multimedia Mobile CMS', 'Content Management System']"
17853,1607.00653,Aditya Grover,"Aditya Grover, Jure Leskovec",node2vec: Scalable Feature Learning for Networks,"In Proceedings of the 22nd ACM SIGKDD International Conference on
  Knowledge Discovery and Data Mining, 2016",,,,cs.SI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Prediction tasks over nodes and edges in networks require careful effort in
engineering features used by learning algorithms. Recent research in the
broader field of representation learning has led to significant progress in
automating prediction by learning the features themselves. However, present
feature learning approaches are not expressive enough to capture the diversity
of connectivity patterns observed in networks. Here we propose node2vec, an
algorithmic framework for learning continuous feature representations for nodes
in networks. In node2vec, we learn a mapping of nodes to a low-dimensional
space of features that maximizes the likelihood of preserving network
neighborhoods of nodes. We define a flexible notion of a node's network
neighborhood and design a biased random walk procedure, which efficiently
explores diverse neighborhoods. Our algorithm generalizes prior work which is
based on rigid notions of network neighborhoods, and we argue that the added
flexibility in exploring neighborhoods is the key to learning richer
representations. We demonstrate the efficacy of node2vec over existing
state-of-the-art techniques on multi-label classification and link prediction
in several real-world networks from diverse domains. Taken together, our work
represents a new way for efficiently learning state-of-the-art task-independent
representations in complex networks.
","[{'version': 'v1', 'created': 'Sun, 3 Jul 2016 16:09:30 GMT'}]",2016-07-05,"[['Grover', 'Aditya', ''], ['Leskovec', 'Jure', '']]","['Information networks', 'Feature learning', 'Node embeddings', 'Graph representations']"
17854,0907.0328,James Whitacre,"James M Whitacre, Axel Bender",Degenerate neutrality creates evolvable fitness landscapes,,"WorldComp 2009, Las Vegas, NV, USA",,,cs.NE cs.AI cs.MA,http://creativecommons.org/licenses/by/3.0/,"  Understanding how systems can be designed to be evolvable is fundamental to
research in optimization, evolution, and complex systems science. Many
researchers have thus recognized the importance of evolvability, i.e. the
ability to find new variants of higher fitness, in the fields of biological
evolution and evolutionary computation. Recent studies by Ciliberti et al
(Proc. Nat. Acad. Sci., 2007) and Wagner (Proc. R. Soc. B., 2008) propose a
potentially important link between the robustness and the evolvability of a
system. In particular, it has been suggested that robustness may actually lead
to the emergence of evolvability. Here we study two design principles,
redundancy and degeneracy, for achieving robustness and we show that they have
a dramatically different impact on the evolvability of the system. In
particular, purely redundant systems are found to have very little evolvability
while systems with degeneracy, i.e. distributed robustness, can be orders of
magnitude more evolvable. These results offer insights into the general
principles for achieving evolvability and may prove to be an important step
forward in the pursuit of evolvable representations in evolutionary
computation.
","[{'version': 'v1', 'created': 'Thu, 2 Jul 2009 09:59:39 GMT'}]",2009-07-03,"[['Whitacre', 'James M', ''], ['Bender', 'Axel', '']]","['degeneracy', 'evolutionary computation', 'evolvability', 'neutral networks', 'optimization', 'redundancy', 'robustness']"
17855,0712.2183,Francoise Sandoz-Guermond,"Marc-Eric Bobiller-Chaumon (GRePS), Fran\c{c}oise Sandoz-Guermond
  (LIESP)","Apports des d\'emarches d'inspection et des tests d'usage dans
  l'\'evaluation de l'accessibilit\'e de E-services",4 pages,"Dans Actes du congr\`es ERGO IA'2006 - ERGO'IA : L'humain comme
  facteur de performance des syst\`emes complexes, Biarritz : France (2006)",,,cs.HC,,"  This article proposes to describe and compare the contributions of various
techniques of evaluation of the accessibility of E-services carried out
starting from (i) methods of inspection (on the basis of traditional ergonomic
criteria and accessibility) and (ii) of tests of use. It show that these are
the latter which show the best rate of identification of the problems of uses
for the poeple with disabilities
","[{'version': 'v1', 'created': 'Thu, 13 Dec 2007 16:43:56 GMT'}]",2007-12-14,"[['Bobiller-Chaumon', 'Marc-Eric', '', 'GRePS'], ['Sandoz-Guermond', 'Françoise', '', 'LIESP']]","['Accessibility', 'E-services', 'poeple with disabilities']"
17856,1409.7984,Mingming Chen,"Mingming Chen, Jichang Zhao, Xiao Liang, Ke Xu","Weighted Shortest Path Models: A Revisit to the Simulation of Internet
  Routing","12 pages, 10 figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding how packets are routed in Internet is significantly important
to Internet measurement and modeling. The conventional solution for route
simulation is based on the assumption of unweighted shortest path. However, it
has been found and widely accepted that a packet in Internet is usually not
transmitted along the unweighted shortest path between its source and
destination. To better simulate the routing behavior of a packet, we thoroughly
explore the real-world Internet routes and present a novel local information
based simulation model, with a tuning parameter, which assigns weights to links
based on local information and then simulates the Internet route with weighted
shortest path. Comparisons with baseline approaches show its capability in well
replicating the route length distribution and other structural properties of
the Internet topology. Meanwhile, the optimal parameter of this model locates
in the range of (0, 2), which implies that a packet inside the Internet
inclines to move to nodes with small degrees. This behavior actually reflects
the design philosophy of Internet routing, balancing between network efficiency
and traffic congestion.
","[{'version': 'v1', 'created': 'Mon, 29 Sep 2014 03:00:06 GMT'}]",2014-09-30,"[['Chen', 'Mingming', ''], ['Zhao', 'Jichang', ''], ['Liang', 'Xiao', ''], ['Xu', 'Ke', '']]","['Internet Routing', 'Shortest Path', 'Internet Measurement', 'Traceroute', 'Local Information']"
17857,1701.01000,Tao Hong,Tao Hong and Zhihui Zhu,"Online Learning Sensing Matrix and Sparsifying Dictionary Simultaneously
  for Compressive Sensing","6 figures, 2 tables",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the problem of simultaneously learning the Sensing
Matrix and Sparsifying Dictionary (SMSD) on a large training dataset. To
address the formulated joint learning problem, we propose an online algorithm
that consists of a closed-form solution for optimizing the sensing matrix with
a fixed sparsifying dictionary and a stochastic method for learning the
sparsifying dictionary on a large dataset when the sensing matrix is given.
Benefiting from training on a large dataset, the obtained compressive sensing
(CS) system by the proposed algorithm yields a much better performance in terms
of signal recovery accuracy than the existing ones. The simulation results on
natural images demonstrate the effectiveness of the suggested online algorithm
compared with the existing methods.
","[{'version': 'v1', 'created': 'Wed, 4 Jan 2017 13:26:57 GMT'}, {'version': 'v2', 'created': 'Sun, 28 May 2017 18:26:05 GMT'}, {'version': 'v3', 'created': 'Tue, 7 Nov 2017 20:03:29 GMT'}, {'version': 'v4', 'created': 'Sat, 2 Jun 2018 16:09:47 GMT'}]",2018-06-05,"[['Hong', 'Tao', ''], ['Zhu', 'Zhihui', '']]","['Compressive sensing', 'sensing matrix design', 'sparsifying dictionary', 'large dataset', 'online learning']"
17858,1701.06412,Mihai Nadin,"Asma Naz, Regis Kopper, Ryan P. McMahan, Mihai Nadin",Emotional Qualities of VR Space,12 figures,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The emotional response a person has to a living space is predominantly
affected by light, color and texture as space-making elements. In order to
verify whether this phenomenon could be replicated in a simulated environment,
we conducted a user study in a six-sided projected immersive display that
utilized equivalent design attributes of brightness, color and texture in order
to assess to which extent the emotional response in a simulated environment is
affected by the same parameters affecting real environments. Since emotional
response depends upon the context, we evaluated the emotional responses of two
groups of users: inactive (passive) and active (performing a typical daily
activity). The results from the perceptual study generated data from which
design principles for a virtual living space are articulated. Such a space, as
an alternative to expensive built dwellings, could potentially support new,
minimalist lifestyles of occupants, defined as the neo-nomads, aligned with
their work experience in the digital domain through the generation of emotional
experiences of spaces. Data from the experiments confirmed the hypothesis that
perceivable emotional aspects of real-world spaces could be successfully
generated through simulation of design attributes in the virtual space. The
subjective response to the virtual space was consistent with corresponding
responses from real-world color and brightness emotional perception. Our data
could serve the virtual reality (VR) community in its attempt to conceive of
further applications of virtual spaces for well-defined activities.
","[{'version': 'v1', 'created': 'Wed, 18 Jan 2017 23:58:54 GMT'}]",2017-01-24,"[['Naz', 'Asma', ''], ['Kopper', 'Regis', ''], ['McMahan', 'Ryan P.', ''], ['Nadin', 'Mihai', '']]","['Architectural design', 'affective space', 'neo-nomads', 'aesthetics']"
17859,1607.02637,Shrisha Rao,"Samiksha Sarwari, Shrisha Rao",Network Flows Under Thermal Restrictions,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We define a \emph{thermal network}, which is a network where the flow
functionality of a node depends upon its temperature. This model is inspired by
several types of real-life networks, and generalizes some conventional network
models wherein nodes have fixed capacities and the problem is to maximize the
flow through the network. In a thermal network, the temperature of a node
increases as traffic moves through it, and nodes may also cool spontaneously
over time, or by employing cooling packets. We analyze the problems of
maximizing the flow from a source to a sink for both these cases, for a
holistic view with respect to the single-source-single-sink dynamic flow
problem in a thermal network. We have studied certain properties such a thermal
network exhibits, and give closed-form solutions for the maximum flow that can
be achieved through such a network.
","[{'version': 'v1', 'created': 'Sat, 9 Jul 2016 17:25:37 GMT'}]",2016-07-12,"[['Sarwari', 'Samiksha', ''], ['Rao', 'Shrisha', '']]","['max flow', 'network problems', 'graph walks', 'thermal networks']"
17860,0903.2972,Ivo Danihelka,Ivo Danihelka,Optimistic Simulated Exploration as an Incentive for Real Exploration,"accepted, noted that the initial path was 217 steps long",POSTER 2009,,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many reinforcement learning exploration techniques are overly optimistic and
try to explore every state. Such exploration is impossible in environments with
the unlimited number of states. I propose to use simulated exploration with an
optimistic model to discover promising paths for real exploration. This reduces
the needs for the real exploration.
","[{'version': 'v1', 'created': 'Tue, 17 Mar 2009 14:24:13 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Mar 2009 13:31:55 GMT'}, {'version': 'v3', 'created': 'Wed, 20 May 2009 18:44:07 GMT'}]",2009-05-20,"[['Danihelka', 'Ivo', '']]","['Reinforcement learning', 'model-based', 'environmentprediction', 'exploration']"
17861,1212.2281,Ashok Kumar ps,"Ashok kumar.P.S, G.Mahadevan, Gopal Krishna.C",Recapitulation of Web Services based on Tree Structure,"5pages,3 figures, 2 tables, IJCA conference","ACCTHPCA, June 2012",,,cs.SE cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Recapitulation of Web service is an approach for the effective
integration of distributed, heterogeneous and autonomous applications to build
more Structured and value added services. Web services selection algorithms are
required to find and select the best services. A QoS is a benchmark to select
the best service for the task of composition. The importance of the web
services selection algorithm is to maximize the QoS of the web services
recapitulation using complex service provider's (CSP) QoS requirement
parameters. This paper have discussed about different Web service
Service-offers. We have classified the CSP's requirements defined on the QoS
and Service-offers based on its structure. We have proposed a tree structure to
represent the CSP's requirement to be defined based on the multiple QoS
properties.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2012 02:24:13 GMT'}]",2012-12-12,"[['S', 'Ashok kumar. P.', ''], ['Mahadevan', 'G.', ''], ['C', 'Gopal Krishna.', '']]","['QoS', 'SOA', 'Recapitulation', 'Service-offer', 'Service selection']"
17862,1407.3867,Ning Zhang,"Ning Zhang, Jeff Donahue, Ross Girshick, Trevor Darrell",Part-based R-CNNs for Fine-grained Category Detection,"16 pages. To appear at European Conference on Computer Vision (ECCV),
  2014",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semantic part localization can facilitate fine-grained categorization by
explicitly isolating subtle appearance differences associated with specific
object parts. Methods for pose-normalized representations have been proposed,
but generally presume bounding box annotations at test time due to the
difficulty of object detection. We propose a model for fine-grained
categorization that overcomes these limitations by leveraging deep
convolutional features computed on bottom-up region proposals. Our method
learns whole-object and part detectors, enforces learned geometric constraints
between them, and predicts a fine-grained category from a pose-normalized
representation. Experiments on the Caltech-UCSD bird dataset confirm that our
method outperforms state-of-the-art fine-grained categorization methods in an
end-to-end evaluation without requiring a bounding box at test time.
","[{'version': 'v1', 'created': 'Tue, 15 Jul 2014 02:32:16 GMT'}]",2014-07-16,"[['Zhang', 'Ning', ''], ['Donahue', 'Jeff', ''], ['Girshick', 'Ross', ''], ['Darrell', 'Trevor', '']]","['Fine-grained recognition', 'object detection', 'convolutional models']"
17863,1407.5416,Luis Marujo,"Luis Marujo, Jos\'e Port\^elo, David Martins de Matos, Jo\~ao P. Neto,
  Anatole Gershman, Jaime Carbonell, Isabel Trancoso, Bhiksha Raj",Privacy-Preserving Important Passage Retrieval,"Secure Passage Retrieval, Important Passage Retrieval, KP-Centrality,
  Secure Binary Embeddings, Data Privacy, Automatic Key Phrase Extraction,
  Proceedings of SIGIR 2014 Workshop Privacy-Preserving IR: When Information
  Retrieval Meets Privacy and Security",,,,cs.IR cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  State-of-the-art important passage retrieval methods obtain very good
results, but do not take into account privacy issues. In this paper, we present
a privacy preserving method that relies on creating secure representations of
documents. Our approach allows for third parties to retrieve important passages
from documents without learning anything regarding their content. We use a
hashing scheme known as Secure Binary Embeddings to convert a key phrase and
bag-of-words representation to bit strings in a way that allows the computation
of approximate distances, instead of exact ones. Experiments show that our
secure system yield similar results to its non-private counterpart on both
clean text and noisy speech recognized text.
","[{'version': 'v1', 'created': 'Mon, 21 Jul 2014 08:56:09 GMT'}]",2016-08-10,"[['Marujo', 'Luis', ''], ['Portêlo', 'José', ''], ['de Matos', 'David Martins', ''], ['Neto', 'João P.', ''], ['Gershman', 'Anatole', ''], ['Carbonell', 'Jaime', ''], ['Trancoso', 'Isabel', ''], ['Raj', 'Bhiksha', '']]","['Secure Passage Retrieval', 'Important Passage Retrieval', 'KPCentrality', 'Secure Binary Embeddings', 'Data Privacy', 'Automatic Key Phrase Extraction']"
17864,1209.6228,Maryam Tanha,"Maryam Tanha, Fazirulhisyam Hashima, S. Shamalab, Khairulmizam
  Samsudin",Highly Available Smart Grid Control Centers through Intrusion Tolerance,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Societies' norms of operation relies on the proper and secure functioning of
several critical infrastructures, particularly modern power grid which is also
known as smart grid. Smart grid is interwoven with the information and
communication technology infrastructure, and thus it is exposed to cyber
security threats. Intrusion tolerance proves a promising security approach
against malicious attacks and contributes to enhance the resilience and
security of the key components of smart grid, mainly SCADA and control centers.
Hence, an intrusion tolerant system architecture for smart grid control centers
is proposed in this paper. The proposed architecture consists of several
modules namely, replication & diversity, compromised/faulty replica detector,
reconfiuration, auditing and proxy. Some of distinctive features of the
proposed ITS are diversity as well as the combined and fine-grained
rejuvenation approach. The security of the proposed architecture is evaluated
with regard to availability and mean time to security failure as performance
measures. The analysis is conducted using a Discrete Time Semi Markov Model and
the acquired results show improvements compared to two established intrusion
tolerant architectures. The viability of SLA as another performance metric is
also investigated.
","[{'version': 'v1', 'created': 'Wed, 26 Sep 2012 16:12:39 GMT'}]",2012-09-28,"[['Tanha', 'Maryam', ''], ['Hashima', 'Fazirulhisyam', ''], ['Shamalab', 'S.', ''], ['Samsudin', 'Khairulmizam', '']]","['Smart grid security', 'Control center', 'Availability', 'SCADA', 'Intrusion tolerance']"
17865,1205.6515,Mohammed Debbal,"Mohammed Debbal, Mohamed Chikh-Bled","Designing the Mode solving of the photonic crystal fiber via BPM and
  Exploring the Single-Mode Properties","8 pages, 6 figures",,,,cs.OH physics.optics,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Microstructured optical fibers (MOFs) are one of the most exciting recent
developments in fiber optics. A MOF usually consists of a hexagonal arrangement
of air holes running down the length of a silica fiber surrounding a central
core of solid silica or, in some cases air. MOFs can exhibit a number of unique
properties, including zero dispersion at visible wavelengths and low or high
effective nonlinearity [3]-[17], By varying the size of the holes and their
number and position, one can also design MOFs with carefully controlled
dispersive and modal properties. In this paper, we analyze and modeling the
behavior of the photonic crystal fiber (PCF) by using in the first step a
propagator method based on the BPM method. With our BPM software, the electric
field contour of the fundamental mode of PCF was demonstrated. We also used it
to see the variation of the effective index; an effective index model confirms
that such a fiber can be single mode for any wavelength. It would make a study
of photonic crystal fibers, and a study of the numerical simulation methods
allow the simulation of optical properties and has modeled the propagation of
light in this fiber type. After that we use the V-parameter because it offers a
simple way to design a photonic crystal fiber (PCF), by basing in a recent
formulation of this parameter of a PCF, we provide numerically based empirical
expression for this quantity only dependent on the two structural parameters,
the air hole diameter and the hole-to-hole center spacing.
","[{'version': 'v1', 'created': 'Tue, 29 May 2012 22:51:51 GMT'}]",2012-05-31,"[['Debbal', 'Mohammed', ''], ['Chikh-Bled', 'Mohamed', '']]","['Optical Telecommunication', 'V-Parameter', 'BPM Method', 'Photonic crystals fibers', 'nanotechnologies']"
17866,1105.2813,Wolfgang Gatterbauer,"Wolfgang Gatterbauer, Dan Suciu",Optimal Upper and Lower Bounds for Boolean Expressions by Dissociation,"7 pages, 2 figures; for details see the project page:
  http://LaPushDB.com/",,,,cs.AI cs.DB cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper develops upper and lower bounds for the probability of Boolean
expressions by treating multiple occurrences of variables as independent and
assigning them new individual probabilities. Our technique generalizes and
extends the underlying idea of a number of recent approaches which are
varyingly called node splitting, variable renaming, variable splitting, or
dissociation for probabilistic databases. We prove that the probabilities we
assign to new variables are the best possible in some sense.
","[{'version': 'v1', 'created': 'Fri, 13 May 2011 19:41:45 GMT'}]",2015-03-19,"[['Gatterbauer', 'Wolfgang', ''], ['Suciu', 'Dan', '']]","['Boolean expressions', 'approximation algorithms', 'node splitting', 'relaxation', 'probabilistic databases', 'partition function']"
17867,1208.2002,Horia Vlad Balan,Horia Vlad Balan and Konstantinos Psounis,Tag Spotting at the Interference Range,30 pages,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In wireless networks, the presence of interference among wireless links in-
troduces dependencies among flows that do not share a single link or node. As a
result, when designing a resource allocation scheme, be it a medium access
scheduler or a flow rate controller, one needs to consider the interdependence
among nodes within interference range of each other. Specifically, control
plane information needs to reach nearby nodes which often lie outside the
communi- cation range, but within the interference range of a node of interest.
But how can one communicate control plane information well beyond the existing
communication range? To address this fundamental need we introduce tag
spotting. Tag spotting refers to a communication system which allows re- liable
control data transmission at SNR values as low as 0 dB. It does this by
employing a number of signal encoding techniques including adding redundancy to
multitone modulation, shaping the spectrum to reduce inter-carrier interfer-
ence, and the use of algebraic coding. Making use of a detection theory-based
model we analyze the performance achievable by our modulation as well as the
trade-off between the rate of the information transmitted and the likelihood of
error. Using real-world experiments on an OFDM system built with software
radios, we show that we can transmit data at the target SNR value of 0 dB with
a 6% overhead; that is, 6% of our packet is used for our low-SNR decodable tags
(which carry up to a couple of bytes of data in our testbed), while the remain-
ing 94% is used for traditional header and payload data. We also demonstrate
via simulations how tag spotting can be used in implementing fair and efficient
rate control and scheduling schemes.
","[{'version': 'v1', 'created': 'Thu, 9 Aug 2012 18:59:07 GMT'}]",2012-08-10,"[['Balan', 'Horia Vlad', ''], ['Psounis', 'Konstantinos', '']]","['Wireless', 'Tag Spotting', 'Software Radios', 'Resource Allocation']"
17868,1710.01779,Alexander Panchenko,"Alexander Panchenko, Eugen Ruppert, Stefano Faralli, Simone Paolo
  Ponzetto, Chris Biemann",Building a Web-Scale Dependency-Parsed Corpus from CommonCrawl,"In Proceedings of the 11th Conference on Language Resources and
  Evaluation (LREC'2018). Miyazaki, Japan",,,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  We present DepCC, the largest-to-date linguistically analyzed corpus in
English including 365 million documents, composed of 252 billion tokens and 7.5
billion of named entity occurrences in 14.3 billion sentences from a web-scale
crawl of the \textsc{Common Crawl} project. The sentences are processed with a
dependency parser and with a named entity tagger and contain provenance
information, enabling various applications ranging from training syntax-based
word embeddings to open information extraction and question answering. We built
an index of all sentences and their linguistic meta-data enabling quick search
across the corpus. We demonstrate the utility of this corpus on the verb
similarity task by showing that a distributional model trained on our corpus
yields better results than models trained on smaller corpora, like Wikipedia.
This distributional model outperforms the state of art models of verb
similarity trained on smaller corpora on the SimVerb3500 dataset.
","[{'version': 'v1', 'created': 'Wed, 4 Oct 2017 19:42:37 GMT'}, {'version': 'v2', 'created': 'Wed, 28 Feb 2018 18:14:30 GMT'}]",2018-03-01,"[['Panchenko', 'Alexander', ''], ['Ruppert', 'Eugen', ''], ['Faralli', 'Stefano', ''], ['Ponzetto', 'Simone Paolo', ''], ['Biemann', 'Chris', '']]","['text corpus', 'Web as a corpus', 'Common Crawl', 'dependency parsing', 'verb similarity', 'distributional semantics']"
17869,1306.4363,Sears Merritt,Sears Merritt and Aaron Clauset,"Social Network Dynamics in a Massive Online Game: Network Turnover,
  Non-densification, and Team Engagement in Halo Reach","8 pages, 13 figures",,,,cs.SI physics.data-an physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online multiplayer games are a popular form of social interaction, used by
hundreds of millions of individuals. However, little is known about the social
networks within these online games, or how they evolve over time. Understanding
human social dynamics within massive online games can shed new light on social
interactions in general and inform the development of more engaging systems.
Here, we study a novel, large friendship network, inferred from nearly 18
billion social interactions over 44 weeks between 17 million individuals in the
popular online game Halo: Reach. This network is one of the largest, most
detailed temporal interaction networks studied to date, and provides a novel
perspective on the dynamics of online friendship networks, as opposed to mere
interaction graphs. Initially, this network exhibits strong structural turnover
and decays rapidly from a peak size. In the following period, however, both
network size and turnover stabilize, producing a dynamic structural
equilibrium. In contrast to other studies, we find that the Halo friendship
network is non-densifying: both the mean degree and the average pairwise
distance are stable, suggesting that densification cannot occur when
maintaining friendships is costly. Finally, players with greater long-term
engagement exhibit stronger local clustering, suggesting a group-level social
engagement process. These results demonstrate the utility of online games for
studying social networks, shed new light on empirical temporal graph patterns,
and clarify the claims of universality of network densification.
","[{'version': 'v1', 'created': 'Tue, 18 Jun 2013 21:36:55 GMT'}]",2013-06-20,"[['Merritt', 'Sears', ''], ['Clauset', 'Aaron', '']]","['graph mining', 'graph evolution', 'social networks', 'friendshipinference', 'temporal data']"
17870,1406.2728,Hanna Furmanczyk,"Hanna Furma\'nczyk, Marek Kubale, Stanis{\l}aw Radziszowski",On bipartization of cubic graphs by removal of an independent set,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study a new problem for cubic graphs: bipartization of a cubic graph $Q$
by deleting sufficiently large independent set $I$. It can be expressed as
follows: \emph{Given a connected $n$-vertex tripartite cubic graph $Q=(V,E)$
with independence number $\alpha(Q)$, does $Q$ contain an independent set $I$
of size $k$ such that $Q-I$ is bipartite?} We are interested for which value of
$k$ the answer to this question is affirmative. We prove constructively that if
$\alpha(Q) \geq 4n/10$, then the answer is positive for each $k$ fulfilling
$\lfloor (n-\alpha(Q))/2 \rfloor \leq k \leq \alpha(Q)$. It remains an open
question if a similar construction is possible for cubic graphs with
$\alpha(Q)<4n/10$.
  Next, we show that this problem with $\alpha(Q)\geq 4n/10$ and $k$ fulfilling
inequalities $\lfloor n/3 \rfloor \leq k \leq \alpha(Q)$ can be related to
semi-equitable graph 3-coloring, where one color class is of size $k$, and the
subgraph induced by the remaining vertices is equitably 2-colored. This means
that $Q$ has a coloring of type $(k, \lceil(n-k)/2\rceil, \lfloor (n-k)/2
\rfloor)$.
","[{'version': 'v1', 'created': 'Tue, 10 Jun 2014 21:45:03 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Jul 2014 18:55:58 GMT'}]",2014-07-22,"[['Furmańczyk', 'Hanna', ''], ['Kubale', 'Marek', ''], ['Radziszowski', 'Stanisław', '']]","['cubic graphs', 'bipartization', 'independent set', 'decycling number', 'feedbackvertex set', 'equitable coloring']"
17871,1306.2499,Mohammed Alaeddine Abderrahim,"Mohammed Alaeddine Abderrahim, Mohammed El Amine Abderrahim, Mohammed
  Amine Chikh","Using Arabic Wordnet for semantic indexation in information retrieval
  system","6 pages,2 figures,7 tables","IJCSI International Journal of Computer Science Issues, Vol. 10,
  Issue 1, No 2, January 2013",,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the context of arabic Information Retrieval Systems (IRS) guided by arabic
ontology and to enable those systems to better respond to user requirements,
this paper aims to representing documents and queries by the best concepts
extracted from Arabic Wordnet. Identified concepts belonging to Arabic WordNet
synsets are extracted from documents and queries, and those having a single
sense are expanded. The expanded query is then used by the IRS to retrieve the
relevant documents searched. Our experiments are based primarily on a medium
size corpus of arabic text. The results obtained shown us that there are a
global improvement in the performance of the arabic IRS.
","[{'version': 'v1', 'created': 'Tue, 11 Jun 2013 12:24:55 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Jun 2013 22:05:37 GMT'}]",2013-06-28,"[['Abderrahim', 'Mohammed Alaeddine', ''], ['Abderrahim', 'Mohammed El Amine', ''], ['Chikh', 'Mohammed Amine', '']]","['Information Retrieval System', 'Disambiguation', 'Arabic WordNet', 'ontologies', 'Semantic indexing']"
17872,1510.01970,Khadija Tijani,"Khadija Tijani (CSTB, G-SCOP\_GCSP, LIG Laboratoire d'Informatique de
  Grenoble), Dung Ngo, Stephane Ploix (G-SCOP\_GCSP), Benjamin Haas (CSTB),
  Julie Dugdale (LIG Laboratoire d'Informatique de Grenoble)","Towards a general framework for an observation and knowledge based model
  of occupant behaviour in office buildings","IBPC 2015 Turin , Jun 2015, Turin, Italy. 2015",,,,cs.AI cs.CY math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a new general approach based on Bayesian networks to
model the human behaviour. This approach represents human behaviour
withprobabilistic cause-effect relations based not only on previous works, but
also with conditional probabilities coming either from expert knowledge or
deduced from observations. The approach has been used in the co-simulation of
building physics and human behaviour in order to assess the CO 2 concentration
in an office.
","[{'version': 'v1', 'created': 'Wed, 7 Oct 2015 14:49:58 GMT'}]",2015-10-08,"[['Tijani', 'Khadija', '', ""CSTB, G-SCOP\\_GCSP, LIG Laboratoire d'Informatique de\n  Grenoble""], ['Ngo', 'Dung', '', 'G-SCOP\\_GCSP'], ['Ploix', 'Stephane', '', 'G-SCOP\\_GCSP'], ['Haas', 'Benjamin', '', 'CSTB'], ['Dugdale', 'Julie', '', ""LIG Laboratoire d'Informatique de Grenoble""]]","['occupant behaviour', 'indoor air quality', 'bayesian network']"
17873,1402.1974,Rajesh Chauhan Ramjanam,"Rajesh R Chauhan, G S Praveen Kumar","A Novel Approach to Detect Spam Worms Propagation with Monitoring the
  Footprinting",,"International Journal of Computer Trends and Technology (IJCTT)
  6(23):3-6, December 2013",,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the key security threats on the Internet are the compromised machines
that can be used to launch various security attacks such as spamming and
spreading malware, accessing useful information and DDoS. Attackers for
spamming activity are volunteer by large number of compromised machines. Our
main focus is on detection of the compromised machines in a network that may be
or are involved in the spamming activities; these machines are commonly known
as spam zombies. Activities such as port scan, DB scan and so on are treated as
malicious activity within the network. So to overcome that we develop one of
the most effective spam zombie detection system within the network based on the
behavior of other systems as if performing the above activities are treated as
zombies machines. If any system within the network try's to gather some
information about any other system then this is treated as a malicious activity
and should be not allowed to do so. SYN packets are used in order to initiate
communication within the network so as to establish connection. If any system
try's to flood the network with these packets we can make an assumption that
the system is trying to gather the information about other system. This is what
called footprinting. So we will try to detect any system involved in
footprinting and report to the administrator.
","[{'version': 'v1', 'created': 'Sun, 9 Feb 2014 18:19:59 GMT'}]",2014-02-11,"[['Chauhan', 'Rajesh R', ''], ['Kumar', 'G S Praveen', '']]","['DDos-Distributed denial of services', 'Footprinting', 'Malicious activity', 'Spam Zombies', 'SYNsynchronize packets']"
17874,0907.3781,Stephanie Leon,St\'ephanie L\'eon (LIRMM),"Un syst\`eme modulaire d'acquisition automatique de traductions \`a
  partir du Web",,"TALN'09 (Traitement Automatique des Langues Naturelles), France
  (2009)",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a method of automatic translation (French/English) of Complex
Lexical Units (CLU) for aiming at extracting a bilingual lexicon. Our modular
system is based on linguistic properties (compositionality, polysemy, etc.).
Different aspects of the multilingual Web are used to validate candidate
translations and collect new terms. We first build a French corpus of Web pages
to collect CLU. Three adapted processing stages are applied for each linguistic
property : compositional and non polysemous translations, compositional
polysemous translations and non compositional translations. Our evaluation on a
sample of CLU shows that our technique based on the Web can reach a very high
precision.
","[{'version': 'v1', 'created': 'Wed, 22 Jul 2009 06:25:59 GMT'}]",2009-07-23,"[['Léon', 'Stéphanie', '', 'LIRMM']]","['Automatic translation', 'Complex lexical units', 'Lexical disambiguisation', 'World Wide Web', 'Terminology']"
17875,1504.07863,Adam Kasperski,"Adam Kasperski, Pawel Zielinski",Using the WOWA operator in robust discrete optimization problems,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper a class of discrete optimization problems with uncertain costs
is discussed. The uncertainty is modeled by introducing a scenario set
containing a finite number of cost scenarios. A probability distribution in the
scenario set is available. In order to choose a solution the weighted OWA
criterion (WOWA) is applied. This criterion allows decision makers to take into
account both probabilities for scenarios and the degree of pessimism/ optimism.
In this paper the complexity of the considered class of discrete optimization
problems is described and some exact and approximation algorithms for solving
it are proposed. An application to a selection problem, together with results
of computational tests are shown.
","[{'version': 'v1', 'created': 'Wed, 29 Apr 2015 13:59:34 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Oct 2015 09:36:09 GMT'}]",2015-10-09,"[['Kasperski', 'Adam', ''], ['Zielinski', 'Pawel', '']]","['robust optimization', 'weighted OWA', 'computational complexity', 'approximationalgorithms']"
17876,1510.00542,Gaurav Sharma,Gaurav Sharma and Frederic Jurie,"Local Higher-Order Statistics (LHS) describing images with statistics of
  local non-binarized pixel patterns",CVIU preprint,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new image representation for texture categorization and facial
analysis, relying on the use of higher-order local differential statistics as
features. It has been recently shown that small local pixel pattern
distributions can be highly discriminative while being extremely efficient to
compute, which is in contrast to the models based on the global structure of
images. Motivated by such works, we propose to use higher-order statistics of
local non-binarized pixel patterns for the image description. The proposed
model does not require either (i) user specified quantization of the space (of
pixel patterns) or (ii) any heuristics for discarding low occupancy volumes of
the space. We propose to use a data driven soft quantization of the space, with
parametric mixture models, combined with higher-order statistics, based on
Fisher scores. We demonstrate that this leads to a more expressive
representation which, when combined with discriminatively learned classifiers
and metrics, achieves state-of-the-art performance on challenging texture and
facial analysis datasets, in low complexity setup. Further, it is complementary
to higher complexity features and when combined with them improves performance.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2015 09:41:39 GMT'}]",2015-10-05,"[['Sharma', 'Gaurav', ''], ['Jurie', 'Frederic', '']]","['local features', 'texture categorization', 'face verification', 'image classification']"
17877,1304.7053,Chetan Jhurani,"Chetan Jhurani, Paul Mullowney","A GEMM interface and implementation on NVIDIA GPUs for multiple small
  matrices",,,,,cs.MS cs.DC math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an interface and an implementation of the General Matrix Multiply
(GEMM) routine for multiple small matrices processed simultaneously on NVIDIA
graphics processing units (GPUs). We focus on matrix sizes under 16. The
implementation can be easily extended to larger sizes. For single precision
matrices, our implementation is 30% to 600% faster than the batched cuBLAS
implementation distributed in the CUDA Toolkit 5.0 on NVIDIA Tesla K20c. For
example, we obtain 104 GFlop/s and 216 GFlop/s when multiplying 100,000
independent matrix pairs of size 10 and 16, respectively. Similar improvement
in performance is obtained for other sizes, in single and double precision for
real and complex types, and when the number of matrices is smaller. Apart from
our implementation, our different function interface also plays an important
role in the improved performance. Applications of this software include Finite
Element computation on GPUs.
","[{'version': 'v1', 'created': 'Fri, 26 Apr 2013 02:22:14 GMT'}]",2013-04-29,"[['Jhurani', 'Chetan', ''], ['Mullowney', 'Paul', '']]","['NVIDIA CUDA', 'GPU', 'GEMM', 'BLAS', 'cuBLAS', 'Parallel programming', 'Dense linear algebra']"
17878,1501.03435,Hema Thiagarajan,K.S. Easwarakumar and T. Hema,"BITS-Tree-An Efficient Data Structure for Segment Storage and Query
  Processing","11 pages, 5 figures","International Journal of Computers and
  Technology,11(10):3108-3116, December 2013",,,cs.CG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a new and novel data structure is proposed to dynamically
insert and delete segments. Unlike the standard segment trees[3], the proposed
data structure permits insertion of a segment with interval range beyond the
interval range of the existing tree, which is the interval between minimum and
maximum values of the end points of all the segments. Moreover, the number of
nodes in the proposed tree is lesser as compared to the dynamic version of the
standard segment trees, and is able to answer both stabbing and range queries
practically much faster compared to the standard segment trees.
","[{'version': 'v1', 'created': 'Wed, 14 Jan 2015 18:28:45 GMT'}]",2015-01-15,"[['Easwarakumar', 'K. S.', ''], ['Hema', 'T.', '']]","['Segment Trees', 'Stabbing Query', 'Threaded Binary Tree', 'Height Balancing']"
17879,1305.7476,Uwe Aickelin,"Feng Gu, Julie Greensmith, Uwe Aickelin","Theoretical formulation and analysis of the deterministic dendritic cell
  algorithm",,"Biosystems 111 (2), 127-135, 2013",,,cs.NE cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As one of the emerging algorithms in the field of Artificial Immune Systems
(AIS), the Dendritic Cell Algorithm (DCA) has been successfully applied to a
number of challenging real-world problems. However, one criticism is the lack
of a formal definition, which could result in ambiguity for understanding the
algorithm. Moreover, previous investigations have mainly focused on its
empirical aspects. Therefore, it is necessary to provide a formal definition of
the algorithm, as well as to perform runtime analyses to revealits theoretical
aspects. In this paper, we define the deterministic version of the DCA, named
the dDCA, using set theory and mathematical functions. Runtime analyses of the
standard algorithm and the one with additional segmentation are performed. Our
analysis suggests that the standard dDCA has a runtime complexity of O(n2) for
the worst-case scenario, where n is the number of input data instances. The
introduction of segmentation changes the algorithm's worst case runtime
complexity to O(max(nN; nz)), for DC population size N with size of each
segment z. Finally, two runtime variables of the algorithm are formulated based
on the input data, to understand its runtime behaviour as guidelines for
further development.
","[{'version': 'v1', 'created': 'Fri, 31 May 2013 16:20:40 GMT'}]",2013-06-03,"[['Gu', 'Feng', ''], ['Greensmith', 'Julie', ''], ['Aickelin', 'Uwe', '']]","['Artificial Immune Systems', 'Dendritic Cell Algorithm', 'RuntimeAnalysis', 'Formulation and Formalisation']"
17880,1305.0336,Elena Pribavkina,"Vladimir V. Gusev, Marina I. Maslennikova, Elena V. Pribavkina",Finitely generated ideal languages and synchronizing automata,Submitted to WORDS 2013,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study representations of ideal languages by means of strongly connected
synchronizing automata. For every finitely generated ideal language L we
construct such an automaton with at most 2^n states, where n is the maximal
length of words in L. Our constructions are based on the De Bruijn graph.
","[{'version': 'v1', 'created': 'Thu, 2 May 2013 03:53:41 GMT'}]",2013-05-03,"[['Gusev', 'Vladimir V.', ''], ['Maslennikova', 'Marina I.', ''], ['Pribavkina', 'Elena V.', '']]","['ideal language', 'synchronizing automaton', 'synchronizing word', 'reset complexity']"
17881,1407.4409,Ming Jin,"Ruoxi Jia, Ming Jin, Costas J. Spanos",SoundLoc: Acoustic Method for Indoor Localization without Infrastructure,BuildSys 2014,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identifying locations of occupants is beneficial to energy management in
buildings. A key observation in indoor environment is that distinct functional
areas are typically controlled by separate HVAC and lighting systems and room
level localization is sufficient to provide a powerful tool for energy usage
reduction by occupancy-based actuation of the building facilities. Based upon
this observation, this paper focuses on identifying the room where a person or
a mobile device is physically present. Existing room localization methods,
however, require special infrastructure to annotate rooms.
  SoundLoc is a room-level localization system that exploits the intrinsic
acoustic properties of individual rooms and obviates the needs for
infrastructures. As we show in the study, rooms' acoustic properties can be
characterized by Room Impulse Response (RIR). Nevertheless, obtaining precise
RIRs is a time-consuming and expensive process. The main contributions of our
work are the following. First, a cost-effective RIR measurement system is
implemented and the Noise Adaptive Extraction of Reverberation (NAER) algorithm
is developed to estimate room acoustic parameters in noisy conditions. Second,
a comprehensive physical and statistical analysis of features extracted from
RIRs is performed. Also, SoundLoc is evaluated using the dataset consisting of
ten (10) different rooms. The overall accuracy of 97.8% achieved demonstrates
the potential to be integrated into automatic mapping of building space.
","[{'version': 'v1', 'created': 'Wed, 16 Jul 2014 18:16:00 GMT'}]",2014-07-17,"[['Jia', 'Ruoxi', ''], ['Jin', 'Ming', ''], ['Spanos', 'Costas J.', '']]","['Indoor localization', 'Room acoustics', 'Room identification']"
17882,0908.0703,Gene Golovchinsky,"Max L. Wilson, m.c. schraefel","Evaluating Collaborative Search Interfaces with Information Seeking
  Theory","Presented at 1st Intl Workshop on Collaborative Information Seeking,
  2008 (arXiv:0908.0583)",,,JCDL2008CIRWS/2008/wilsch,cs.IR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the many implicit references to the social aspects of search within
Information Seeking and Retrieval research, there has been relatively little
work that has specifically investigated the additional requirements for
collaborative search software. In this paper we re-assess a recent evaluation
framework, designed for individual information seeking experiences, to see a)
how it could still be applied to collaborative search software; b) how it could
produce additional requirements for collaborative search; and c) how it could
be extended in future work to be even more appropriate for collaborative search
evaluation. The position held after the assessment is that it can be used to
evaluate collaborative search software, while providing new insights into their
requirements. Finally, future work will validate the frameworks applicability
to collaborative search and investigate roles within collaborative groups as a
means to extend the framework.
","[{'version': 'v1', 'created': 'Wed, 5 Aug 2009 16:43:45 GMT'}]",2009-08-06,"[['Wilson', 'Max L.', ''], ['schraefel', 'm. c.', '']]","['Collaborative', 'search', 'seeking', 'evaluation']"
17883,1506.02013,Eric Bax,"James Li, Eric Bax, Nilanjan Roy, Andrea Leistra",VCG Payments for Portfolio Allocations in Online Advertising,,,,,cs.GT q-fin.RM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Some online advertising offers pay only when an ad elicits a response.
Randomness and uncertainty about response rates make showing those ads a risky
investment for online publishers. Like financial investors, publishers can use
portfolio allocation over multiple advertising offers to pursue revenue while
controlling risk. Allocations over multiple offers do not have a distinct
winner and runner-up, so the usual second-price mechanism does not apply. This
paper develops a pricing mechanism for portfolio allocations. The mechanism is
efficient, truthful, and rewards offers that reduce risk.
","[{'version': 'v1', 'created': 'Fri, 5 Jun 2015 19:17:46 GMT'}]",2015-06-08,"[['Li', 'James', ''], ['Bax', 'Eric', ''], ['Roy', 'Nilanjan', ''], ['Leistra', 'Andrea', '']]","['online advertising', 'auction mechanism', 'portfolio allocation', 'VCG', 'uncertainty']"
17884,1606.06991,Nawal Ould Amer,Nawal Ould-Amer and Philippe Mulhem and Mathias Gery,Toward Word Embedding for Personalized Information Retrieval,,,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents preliminary works on using Word Embedding (word2vec) for
query expansion in the context of Personalized Information Retrieval.
Traditionally, word embeddings are learned on a general corpus, like Wikipedia.
In this work we try to personalize the word embeddings learning, by achieving
the learning on the user's profile. The word embeddings are then in the same
context than the user interests. Our proposal is evaluated on the CLEF Social
Book Search 2016 collection. The results obtained show that some efforts should
be made in the way to apply Word Embedding in the context of Personalized
Information Retrieval.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2016 15:53:29 GMT'}]",2016-06-23,"[['Ould-Amer', 'Nawal', ''], ['Mulhem', 'Philippe', ''], ['Gery', 'Mathias', '']]","['Word Embedding', 'word2vec', 'Personalization', 'Social BookSearch', 'Query expansion']"
17885,1502.04232,Changqing Zou,"Changqing Zou, Zhe Huang, Rynson W. H. Lau, Jianzhuang Liu, and Hongbo
  Fu",Sketch-based Shape Retrieval using Pyramid-of-Parts,,,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a multi-scale approach to sketch-based shape retrieval. It is
based on a novel multi-scale shape descriptor called Pyramidof- Parts, which
encodes the features and spatial relationship of the semantic parts of query
sketches. The same descriptor can also be used to represent 2D projected views
of 3D shapes, allowing effective matching of query sketches with 3D shapes
across multiple scales. Experimental results show that the proposed method
outperforms the state-of-the-art method, whether the sketch segmentation
information is obtained manually or automatically by considering each stroke as
a semantic part.
","[{'version': 'v1', 'created': 'Sat, 14 Feb 2015 17:42:02 GMT'}]",2015-02-17,"[['Zou', 'Changqing', ''], ['Huang', 'Zhe', ''], ['Lau', 'Rynson W. H.', ''], ['Liu', 'Jianzhuang', ''], ['Fu', 'Hongbo', '']]","['sketch-based retrieval', 'shape retrieval', 'incompletematching', 'feature representation']"
17886,1710.01387,Ruian Duan,"Ruian Duan, Weiren Wang and Wenke Lee",Cloaker Catcher: A Client-based Cloaking Detection System,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloaking has long been exploited by spammers for the purpose of increasing
the exposure of their websites. In other words, cloaking has long served as a
major malicious technique in search engine optimization (SEO). Cloaking hides
the true nature of a website by delivering blatantly different content to users
versus web crawlers. Recently, we have also witnessed a rising trend of
employing cloaking in search engine marketing (SEM). However, detecting
cloaking is challenging. Existing approaches cannot detect IP cloaking and are
not suitable for detecting cloaking in SEM because their search-and-visit
method leads to click fraud. In addition, they focus on detecting and measuring
cloaking on the server side, but the results are not visible to users to help
them avoid frauds.
  Our work focuses on mitigating IP cloaking and SEM cloaking, and providing
client-based real-time cloaking detection services. To achieve these goals, we
first propose the Simhash-based Website Model (SWM), a condensed representation
of websites, which can model natural page dynamics. Based on SWM, we design and
implement Cloaker Catcher, an accurate, efficient and privacy-preserving
system, that consists of a server that crawls websites visited by users on
demand and a client-side extension that fetches spider views of websites from
the server and compares them with user views to detect cloaking. Since Cloaker
Catcher checks on the client side for each real user, IP cloaking can be
detected whenever it occurs and click fraud in SEM can also be prevented. Using
our system, we conducted the first analysis of SEM cloaking and found that the
main purpose of SEM cloakers is to provide illicit services.
","[{'version': 'v1', 'created': 'Tue, 3 Oct 2017 20:58:05 GMT'}]",2017-10-05,"[['Duan', 'Ruian', ''], ['Wang', 'Weiren', ''], ['Lee', 'Wenke', '']]","['Cloaking', 'Search Engine Optimization', 'Search Engine Mar']"
17887,1610.02481,Shan Huang,"Shan Huang, Haijian Zhang, Hong Sun, Lei Yu, Liwen Chen","Frequency Estimation of Multiple Sinusoids with Three Sub-Nyquist
  Channels","7 pages, 3 figures. arXiv admin note: text overlap with
  arXiv:1601.00270",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Frequency estimation of multiple sinusoids is significant in both theory and
application. In some application scenarios, only sub-Nyquist samples are
available to estimate the frequencies. A conventional approach is to sample the
signals at several lower rates. In this paper, we address frequency estimation
of the signals in the time domain through undersampled data. We analyze the
impact of undersampling and demonstrate that three sub-Nyquist channels are
generally enough to estimate the frequencies provided the undersampling ratios
are pairwise coprime. We deduce the condition that leads to the failure of
resolving frequency ambiguity when two coprime undersampling channels are
utilized. When three-channel sub-Nyquist samples are used jointly, the
frequencies can be determined uniquely and the correct frequencies are
estimated. Numerical experiments verify the correctness of our analysis and
conclusion.
","[{'version': 'v1', 'created': 'Sat, 8 Oct 2016 04:33:49 GMT'}, {'version': 'v2', 'created': 'Sun, 19 Mar 2017 05:57:08 GMT'}]",2017-03-21,"[['Huang', 'Shan', ''], ['Zhang', 'Haijian', ''], ['Sun', 'Hong', ''], ['Yu', 'Lei', ''], ['Chen', 'Liwen', '']]","['Frequency estimation', 'Sub-Nyquist sampling', 'Coprime sampling']"
17888,1707.09364,Weilin Cong,"Weilin Cong, Sanyuan Zhao, Hui Tian, Jianbing Shen","Improved Face Detection and Alignment using Cascade Deep Convolutional
  Network",,,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real-world face detection and alignment demand an advanced discriminative
model to address challenges by pose, lighting and expression. Illuminated by
the deep learning algorithm, some convolutional neural networks based face
detection and alignment methods have been proposed. Recent studies have
utilized the relation between face detection and alignment to make models
computationally efficiency, however they ignore the connection between each
cascade CNNs. In this paper, we propose an structure to propose higher quality
training data for End-to-End cascade network training, which give computers
more space to automatic adjust weight parameter and accelerate convergence.
Experiments demonstrate considerable improvement over existing detection and
alignment models.
","[{'version': 'v1', 'created': 'Fri, 28 Jul 2017 06:07:38 GMT'}]",2017-08-01,"[['Cong', 'Weilin', ''], ['Zhao', 'Sanyuan', ''], ['Tian', 'Hui', ''], ['Shen', 'Jianbing', '']]","['Face detection', 'facial key points detection', 'cascade CNNs', 'End-to-End']"
17889,1008.3431,Venkatareddy Dwarampudi Mr.,"Venkatreddy Dwarampudi, Shahbaz Singh Dhillon, Jivitesh Shah, Nikhil
  Joseph Sebastian, Nitin Kanigicharla","Comparative study of the Pros and Cons of Programming languages Java,
  Scala, C++, Haskell, VB .NET, AspectJ, Perl, Ruby, PHP & Scheme - a Team 11
  COMP6411-S10 Term Report","28 pages, 2 tables",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the advent of numerous languages it is difficult to realize the edge of
one language in a particular scope over another one. We are making an effort,
realizing these few issues and comparing some main stream languages like Java,
Scala, C++, Haskell, VB .NET, AspectJ, Perl, Ruby, PHP and Scheme keeping in
mind some core issues in program development.
","[{'version': 'v1', 'created': 'Fri, 20 Aug 2010 03:17:43 GMT'}]",2010-08-23,"[['Dwarampudi', 'Venkatreddy', ''], ['Dhillon', 'Shahbaz Singh', ''], ['Shah', 'Jivitesh', ''], ['Sebastian', 'Nikhil Joseph', ''], ['Kanigicharla', 'Nitin', '']]","['comparing', 'languages', 'program development']"
17890,1412.5034,Mikkel Abrahamsen,Mikkel Abrahamsen,"Spiral Toolpaths for High-Speed Machining of 2D Pockets with or without
  Islands","22 pages, 13 figures",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe new methods for the construction of spiral toolpaths for
high-speed machining. In the simplest case, our method takes a polygon as input
and a number $\delta>0$ and returns a spiral starting at a central point in the
polygon, going around towards the boundary while morphing to the shape of the
polygon. The spiral consists of linear segments and circular arcs, it is $G^1$
continuous, it has no self-intersections, and the distance from each point on
the spiral to each of the neighboring revolutions is at most $\delta$. Our
method has the advantage over previously described methods that it is easily
adjustable to the case where there is an island in the polygon to be avoided by
the spiral. In that case, the spiral starts at the island and morphs the island
to the outer boundary of the polygon. It is shown how to apply that method to
make significantly shorter spirals in polygons with no islands. Finally, we
show how to make a spiral in a polygon with multiple islands by connecting the
islands into one island.
","[{'version': 'v1', 'created': 'Tue, 16 Dec 2014 15:17:15 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Dec 2014 06:44:42 GMT'}, {'version': 'v3', 'created': 'Sat, 20 Dec 2014 09:10:07 GMT'}, {'version': 'v4', 'created': 'Tue, 20 Jan 2015 12:40:54 GMT'}]",2015-01-21,"[['Abrahamsen', 'Mikkel', '']]","['Computer-aided manufacturing', 'CNC machining', 'High-speed machining', 'Pocket machining', 'Spiral toolpath']"
17891,0707.0701,Alexandre d'Aspremont,"Ronny Luss, Alexandre d'Aspremont","Clustering and Feature Selection using Sparse Principal Component
  Analysis",More experiments,,,,cs.AI cs.LG cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the application of sparse principal component
analysis (PCA) to clustering and feature selection problems. Sparse PCA seeks
sparse factors, or linear combinations of the data variables, explaining a
maximum amount of variance in the data while having only a limited number of
nonzero coefficients. PCA is often used as a simple clustering technique and
sparse factors allow us here to interpret the clusters in terms of a reduced
set of variables. We begin with a brief introduction and motivation on sparse
PCA and detail our implementation of the algorithm in d'Aspremont et al.
(2005). We then apply these results to some classic clustering and feature
selection problems arising in biology.
","[{'version': 'v1', 'created': 'Wed, 4 Jul 2007 21:53:11 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Oct 2008 18:41:53 GMT'}]",2008-10-08,"[['Luss', 'Ronny', ''], [""d'Aspremont"", 'Alexandre', '']]","['Sparse principal component analysis', 'semidefinite programming', 'clustering', 'feature selection']"
17892,0704.2083,Hassan Satori,"H. Satori, M. Harti and N. Chenfour",Introduction to Arabic Speech Recognition Using CMUSphinx System,"4 pages, 3 figures and 2 tables, was in Information and Communication
  Technologies International Symposium proceeding ICTIS07 Fes (2007)",,,,cs.CL cs.AI,,"  In this paper Arabic was investigated from the speech recognition problem
point of view. We propose a novel approach to build an Arabic Automated Speech
Recognition System (ASR). This system is based on the open source CMU Sphinx-4,
from the Carnegie Mellon University. CMU Sphinx is a large-vocabulary;
speaker-independent, continuous speech recognition system based on discrete
Hidden Markov Models (HMMs). We build a model using utilities from the
OpenSource CMU Sphinx. We will demonstrate the possible adaptability of this
system to Arabic voice recognition.
","[{'version': 'v1', 'created': 'Tue, 17 Apr 2007 01:04:01 GMT'}]",2007-05-23,"[['Satori', 'H.', ''], ['Harti', 'M.', ''], ['Chenfour', 'N.', '']]","['Speech recognition', 'Arabic language', 'HMMs', 'CMUSphinx-4', 'Artificial intelligence']"
17893,1603.03758,Dane Bell,"Dane Bell and Gus Hahn-Powell and Marco A. Valenzuela-Esc\'arcega and
  Mihai Surdeanu",Sieve-based Coreference Resolution in the Biomedical Domain,This paper appears in LREC 2016,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe challenges and advantages unique to coreference resolution in the
biomedical domain, and a sieve-based architecture that leverages domain
knowledge for both entity and event coreference resolution. Domain-general
coreference resolution algorithms perform poorly on biomedical documents,
because the cues they rely on such as gender are largely absent in this domain,
and because they do not encode domain-specific knowledge such as the number and
type of participants required in chemical reactions. Moreover, it is difficult
to directly encode this knowledge into most coreference resolution algorithms
because they are not rule-based. Our rule-based architecture uses sequentially
applied hand-designed ""sieves"", with the output of each sieve informing and
constraining subsequent sieves. This architecture provides a 3.2% increase in
throughput to our Reach event extraction system with precision parallel to that
of the stricter system that relies solely on syntactic patterns for extraction.
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2016 20:48:49 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Sep 2016 18:32:35 GMT'}]",2016-09-05,"[['Bell', 'Dane', ''], ['Hahn-Powell', 'Gus', ''], ['Valenzuela-Escárcega', 'Marco A.', ''], ['Surdeanu', 'Mihai', '']]","['coreference resolution', 'information extraction', 'biomedical text mining']"
17894,1107.1779,Eya Ben Ahmed,"Eya Ben Ahmed, Ahlem Nabli, Fa\""iez Gargouri","A Survey of User-Centric Data Warehouses: From Personalization to
  Recommendation","13 pages, 3 figures, 1 table","The International Journal of Database Management Systems (IJDMS),
  May 2011, Volume 3, Number 2",,,cs.DB,http://creativecommons.org/licenses/by/3.0/,"  Providing a customized support for the OLAP brings tremendous challenges to
the OLAP technology. Standing at the crossroads of the preferences and the data
warehouse, two emerging trends are pointed out; namely: (i) the personalization
and (ii) the recommendation. Although the panoply of the proposed approaches,
the user-centric data warehouse community issues have not been addressed yet.
In this paper we draw an overview of several user centric data warehouse
proposals. We also discuss the two promising concepts in this issue, namely,
the personalization and the recommendation of the data warehouses. We compare
the current approaches among each others with respect to some criteria.
","[{'version': 'v1', 'created': 'Sat, 9 Jul 2011 12:26:14 GMT'}]",2015-06-01,"[['Ahmed', 'Eya Ben', ''], ['Nabli', 'Ahlem', ''], ['Gargouri', 'Faïez', '']]","['Data warehouses', 'OLAP', 'user-centric data warehouse', 'preferences', 'personalization', 'recommendation', 'recommended system']"
17895,1702.02289,Zhenhao Ge,"Zhenhao Ge, Ananth N. Iyer, Srinath Cheluvaraja, Ram Sundaram, Aravind
  Ganapathiraju","Neural Network Based Speaker Classification and Verification Systems
  with Enhanced Features","Intelligent Systems Conference 2017, Sep. 7-8 2017, London, UK. arXiv
  admin note: text overlap with arXiv:1702.02285",,,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work presents a novel framework based on feed-forward neural network for
text-independent speaker classification and verification, two related systems
of speaker recognition. With optimized features and model training, it achieves
100% classification rate in classification and less than 6% Equal Error Rate
(ERR), using merely about 1 second and 5 seconds of data respectively. Features
with stricter Voice Active Detection (VAD) than the regular one for speech
recognition ensure extracting stronger voiced portion for speaker recognition,
speaker-level mean and variance normalization helps to eliminate the
discrepancy between samples from the same speaker. Both are proven to improve
the system performance. In building the neural network speaker classifier, the
network structure parameters are optimized with grid search and dynamically
reduced regularization parameters are used to avoid training terminated in
local minimum. It enables the training goes further with lower cost. In speaker
verification, performance is improved with prediction score normalization,
which rewards the speaker identity indices with distinct peaks and penalizes
the weak ones with high scores but more competitors, and speaker-specific
thresholding, which significantly reduces ERR in the ROC curve. TIMIT corpus
with 8K sampling rate is used here. First 200 male speakers are used to train
and test the classification performance. The testing files of them are used as
in-domain registered speakers, while data from the remaining 126 male speakers
are used as out-of-domain speakers, i.e. imposters in speaker verification.
","[{'version': 'v1', 'created': 'Wed, 8 Feb 2017 04:59:00 GMT'}]",2017-03-20,"[['Ge', 'Zhenhao', ''], ['Iyer', 'Ananth N.', ''], ['Cheluvaraja', 'Srinath', ''], ['Sundaram', 'Ram', ''], ['Ganapathiraju', 'Aravind', '']]","['Neural Network', 'Speaker Classification', 'SpeakerVerification', 'Feature Engineering']"
17896,1412.5488,Ashirbani Saha,"Ashirbani Saha, Q. M. Jonathan Wu","Full-reference image quality assessment by combining global and local
  distortion measures","31 pages, 8 figures, 2 tables",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Full-reference image quality assessment (FR-IQA) techniques compare a
reference and a distorted/test image and predict the perceptual quality of the
test image in terms of a scalar value representing an objective score. The
evaluation of FR-IQA techniques is carried out by comparing the objective
scores from the techniques with the subjective scores (obtained from human
observers) provided in the image databases used for the IQA. Hence, we
reasonably assume that the goal of a human observer is to rate the distortion
present in the test image. The goal oriented tasks are processed by the human
visual system (HVS) through top-down processing which actively searches for
local distortions driven by the goal. Therefore local distortion measures in an
image are important for the top-down processing. At the same time, bottom-up
processing also takes place signifying spontaneous visual functions in the HVS.
To account for this, global perceptual features can be used. Therefore, we
hypothesize that the resulting objective score for an image can be derived from
the combination of local and global distortion measures calculated from the
reference and test images. We calculate the local distortion by measuring the
local correlation differences from the gradient and contrast information. For
global distortion, dissimilarity of the saliency maps computed from a bottom-up
model of saliency is used. The motivation behind the proposed approach has been
thoroughly discussed, accompanied by an intuitive analysis. Finally,
experiments are conducted in six benchmark databases suggesting the
effectiveness of the proposed approach that achieves competitive performance
with the state-of-the-art methods providing an improvement in the overall
performance.
","[{'version': 'v1', 'created': 'Wed, 17 Dec 2014 17:15:12 GMT'}]",2014-12-18,"[['Saha', 'Ashirbani', ''], ['Wu', 'Q. M. Jonathan', '']]","['Image Quality Assessment', 'Saliency', 'Image Gradient', 'Localstandard deviation']"
17897,1712.05855,Joseph Gonzalez,"Ion Stoica, Dawn Song, Raluca Ada Popa, David Patterson, Michael W.
  Mahoney, Randy Katz, Anthony D. Joseph, Michael Jordan, Joseph M.
  Hellerstein, Joseph E. Gonzalez, Ken Goldberg, Ali Ghodsi, David Culler,
  Pieter Abbeel",A Berkeley View of Systems Challenges for AI,Berkeley Technical Report,,,EECS-2017-159,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the increasing commoditization of computer vision, speech recognition
and machine translation systems and the widespread deployment of learning-based
back-end technologies such as digital advertising and intelligent
infrastructures, AI (Artificial Intelligence) has moved from research labs to
production. These changes have been made possible by unprecedented levels of
data and computation, by methodological advances in machine learning, by
innovations in systems software and architectures, and by the broad
accessibility of these technologies.
  The next generation of AI systems promises to accelerate these developments
and increasingly impact our lives via frequent interactions and making (often
mission-critical) decisions on our behalf, often in highly personalized
contexts. Realizing this promise, however, raises daunting challenges. In
particular, we need AI systems that make timely and safe decisions in
unpredictable environments, that are robust against sophisticated adversaries,
and that can process ever increasing amounts of data across organizations and
individuals without compromising confidentiality. These challenges will be
exacerbated by the end of the Moore's Law, which will constrain the amount of
data these technologies can store and process. In this paper, we propose
several open research directions in systems, architectures, and security that
can address these challenges and help unlock AI's potential to improve lives
and society.
","[{'version': 'v1', 'created': 'Fri, 15 Dec 2017 22:01:52 GMT'}]",2017-12-19,"[['Stoica', 'Ion', ''], ['Song', 'Dawn', ''], ['Popa', 'Raluca Ada', ''], ['Patterson', 'David', ''], ['Mahoney', 'Michael W.', ''], ['Katz', 'Randy', ''], ['Joseph', 'Anthony D.', ''], ['Jordan', 'Michael', ''], ['Hellerstein', 'Joseph M.', ''], ['Gonzalez', 'Joseph E.', ''], ['Goldberg', 'Ken', ''], ['Ghodsi', 'Ali', ''], ['Culler', 'David', ''], ['Abbeel', 'Pieter', '']]","['AI', 'Machine Learning', 'Systems', 'Security']"
17898,1412.6137,Anum Ali,"Anum Ali, Mudassir Masood, Muhammad S. Sohail, Samir Al-Ghadhban and
  Tareq Y. Al-Naffouri","Narrowband Interference Mitigation in SC-FDMA Using Bayesian Sparse
  Recovery",,,,,cs.IT math.IT stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel narrowband interference (NBI) mitigation scheme
for SC-FDMA systems. The proposed NBI cancellation scheme exploits the
frequency domain sparsity of the unknown signal and adopts a low complexity
Bayesian sparse recovery procedure. At the transmitter, a few randomly chosen
sub-carriers are kept data free to sense the NBI signal at the receiver.
Further, it is noted that in practice, the sparsity of the NBI signal is
destroyed by a grid mismatch between NBI sources and the system under
consideration. Towards this end, first an accurate grid mismatch model is
presented that is capable of assuming independent offsets for multiple NBI
sources. Secondly, prior to NBI reconstruction, the sparsity of the unknown
signal is restored by employing a sparsifying transform. To improve the
spectral efficiency of the proposed scheme, a data-aided NBI recovery procedure
is outlined that relies on adaptively selecting a subset of data carriers and
uses them as additional measurements to enhance the NBI estimation. Finally,
the proposed scheme is extended to single-input multi-output systems by
performing a collaborative NBI support search over all antennas. Numerical
results are presented that depict the suitability of the proposed scheme for
NBI mitigation.
","[{'version': 'v1', 'created': 'Wed, 8 Oct 2014 13:17:10 GMT'}]",2014-12-22,"[['Ali', 'Anum', ''], ['Masood', 'Mudassir', ''], ['Sohail', 'Muhammad S.', ''], ['Al-Ghadhban', 'Samir', ''], ['Al-Naffouri', 'Tareq Y.', '']]","['Narrowband interference mitigation', 'Bayesian sparsesignal estimation', 'SC-FDMA', 'multiple measurement vectors', 'dataaided compressed sensing']"
17899,0906.3966,R Doomun,"K Pradheep Kumar, A P Shanthi","Application of non-uniform laxity to EDF for aperiodic tasks to improve
  task utilisation on multicore platforms","7 pages, Journal of Computer Science and Information Security","IJCSIS 2009, June Issue, Vol. 2, No. 1",,,cs.PF cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a new scheduler applying the concept of non-uniform
laxity to Earliest deadline first (EDF) approach for aperiodic tasks. This
scheduler improves task utilisation (Execution time / deadline) and also
increases the number of tasks that are being scheduled. Laxity is a measure of
the spare time permitted for the task before it misses its deadline, and is
computed using the expression (deadline - (current time + execution time)).
Weight decides the priority of the task and is defined by the expression
(quantum slice time / allocated time)*total core time for the task. Quantum
slice time is the time actually used, allocated time is the time allocated by
the scheduler, and total core time is the time actually reserved by the core
for execution of one quantum of the task. Non-uniform laxity enables scheduling
of tasks that have higher priority before the normal execution of other tasks
and is computed by multiplying the weight of the task with its laxity. The
algorithm presented in the paper has been simulated on Cheddar, a real time
scheduling tool and also on SESC, an architectural simulator for multicore
platforms, for upto 5000 random task sets, and upto 5000 cores. This scheduler
improves task utilisation by 35% and the number of tasks being scheduled by
36%, compared to conventional EDF.
","[{'version': 'v1', 'created': 'Mon, 22 Jun 2009 09:33:17 GMT'}]",2009-06-23,"[['Kumar', 'K Pradheep', ''], ['Shanthi', 'A P', '']]","['non-uniform laxity', 'weight', 'EDF', 'scheduling', 'Cheddar', 'SESC']"
17900,1504.08070,Moein  Falahatgar,"Moein Falahatgar and Ashkan Jafarpour and Alon Orlitsky and
  Venkatadheeraj Pichapati and Ananda Theertha Suresh",Universal Compression of Power-Law Distributions,20 pages,,,,cs.IT math.IT math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  English words and the outputs of many other natural processes are well-known
to follow a Zipf distribution. Yet this thoroughly-established property has
never been shown to help compress or predict these important processes. We show
that the expected redundancy of Zipf distributions of order $\alpha>1$ is
roughly the $1/\alpha$ power of the expected redundancy of unrestricted
distributions. Hence for these orders, Zipf distributions can be better
compressed and predicted than was previously known. Unlike the expected case,
we show that worst-case redundancy is roughly the same for Zipf and for
unrestricted distributions. Hence Zipf distributions have significantly
different worst-case and expected redundancies, making them the first natural
distribution class shown to have such a difference.
","[{'version': 'v1', 'created': 'Thu, 30 Apr 2015 03:31:05 GMT'}, {'version': 'v2', 'created': 'Fri, 1 May 2015 01:01:37 GMT'}]",2015-05-04,"[['Falahatgar', 'Moein', ''], ['Jafarpour', 'Ashkan', ''], ['Orlitsky', 'Alon', ''], ['Pichapati', 'Venkatadheeraj', ''], ['Suresh', 'Ananda Theertha', '']]","['Power-law', 'Zipf', 'Universal Compression', 'Distinct elements', 'Redundancy']"
17901,1510.05497,Filippo Bonazzi,"Elena Reshetova, Filippo Bonazzi, Thomas Nyman, Ravishankar Borgaonkar
  and N. Asokan",Characterizing SEAndroid Policies in the Wild,"10 pages, 3 figures. v2: Added acknowledgment to Jan-Erik Ekberg. v3:
  Fixed typo in abstract",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Starting from the 5.0 Lollipop release all Android processes must be run
inside confined SEAndroid access control domains. As a result, Android device
manufacturers were compelled to develop SEAndroid expertise in order to create
policies for their device-specific components. In this paper we analyse
SEAndroid policies from a number of 5.0 Lollipop devices on the market, and
identify patterns of common problems we found. We also suggest some practical
tools that can improve policy design and analysis. We implemented the first of
such tools, SEAL.
","[{'version': 'v1', 'created': 'Mon, 19 Oct 2015 14:42:32 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Oct 2015 09:30:19 GMT'}, {'version': 'v3', 'created': 'Wed, 28 Oct 2015 08:58:30 GMT'}]",2015-10-29,"[['Reshetova', 'Elena', ''], ['Bonazzi', 'Filippo', ''], ['Nyman', 'Thomas', ''], ['Borgaonkar', 'Ravishankar', ''], ['Asokan', 'N.', '']]","['Security', 'Access Control', 'SELinux', 'SEAndroid']"
17902,1009.1121,Kamaljit  I Lakhtaria,"Kamaljit I. Lakhtaria, Dhinaharan Nagamalai","Analyzing Web 2.0 Integration with Next Generation Networks for Services
  Rendering",,,,"International Conferences, NeCoM 2010, India, July 23-25, 2010,
  ISBN: 978-3-642-14492-9",cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Next Generation Networks (NGN) aims to integrate for IP-based telecom
infrastructures and provide most advance & high speed emerging value added
services. NGN capable to provide higher innovative services, these services
will able to integrate communication and Web service into a single platform. IP
Multimedia Subsystem, a NGN leading technology, enables a variety of
NGN-compliant communications services to interoperate while being accessed
through different kinds of access networks, preferably broadband. IMS-NGN
services essential by both consumer and corporate users are by now used to
access services, even communications services through the web and web-based
communities and social networks, It is key for success of IMS-based services to
be provided with efficient web access, so users can benefit from those new
services by using web-based applications and user interfaces, not only NGN-IMS
User Equipments and SIP protocol. Many Service are under planning which
provided only under convergence of IMS & Web 2.0. Convergence between Web 2.0
and NGN-IMS creates and serves new invented innovative, entertainment and
information appealing as well as user centric services and applications. These
services merge features from WWW and Communication worlds. On the one hand,
interactivity, ubiquity, social orientation, user participation and content
generation, etc. are relevant characteristics coming from Web 2.0 services.
Parallel IMS enables services including multimedia telephony, media sharing
(video-audio), instant messaging with presence and context, online directory,
etc. all of them applicable to mobile, fixed or convergent telecom networks.
With this paper, this paper brings out the benefits of adopting web 2.0
technologies for telecom services. As the services are today mainly driven by
the user's needs, and proposed the concept of unique customizable service
interface.
","[{'version': 'v1', 'created': 'Mon, 6 Sep 2010 18:43:57 GMT'}]",2011-11-10,"[['Lakhtaria', 'Kamaljit I.', ''], ['Nagamalai', 'Dhinaharan', '']]","['Next Generation Networks (NGN)', 'IP Multimedia Subsystem (IMS)', 'WWW', 'Web 2']"
17903,1109.5153,Wojciech Golab,Wojciech Golab,"A Complexity Separation Between the Cache-Coherent and Distributed
  Shared Memory Models",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider asynchronous multiprocessor systems where processes communicate
by accessing shared memory. Exchange of information among processes in such a
multiprocessor necessitates costly memory accesses called \emph{remote memory
references} (RMRs), which generate communication on the interconnect joining
processors and main memory. In this paper we compare two popular shared memory
architecture models, namely the \emph{cache-coherent} (CC) and
\emph{distributed shared memory} (DSM) models, in terms of their power for
solving synchronization problems efficiently with respect to RMRs. The
particular problem we consider entails one process sending a ""signal"" to a
subset of other processes. We show that a variant of this problem can be solved
very efficiently with respect to RMRs in the CC model, but not so in the DSM
model, even when we consider amortized RMR complexity.
  To our knowledge, this is the first separation in terms of amortized RMR
complexity between the CC and DSM models. It is also the first separation in
terms of RMR complexity (for asynchronous systems) that does not rely in any
way on wait-freedom---the requirement that a process makes progress in a
bounded number of its own steps.
","[{'version': 'v1', 'created': 'Fri, 23 Sep 2011 18:39:18 GMT'}]",2011-09-26,"[['Golab', 'Wojciech', '']]","['Shared memory models', 'remote memory references', 'complexity']"
17904,1008.4249,Md. Saiful Islam,"Md. Saiful Islam, Abdullah Al Mahmud, Md. Rafiqul Islam",Machine Learning Approaches for Modeling Spammer Behavior,"12 pages, 3 figures, 5 tables, Submitted to AIRS 2010",,,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spam is commonly known as unsolicited or unwanted email messages in the
Internet causing potential threat to Internet Security. Users spend a valuable
amount of time deleting spam emails. More importantly, ever increasing spam
emails occupy server storage space and consume network bandwidth. Keyword-based
spam email filtering strategies will eventually be less successful to model
spammer behavior as the spammer constantly changes their tricks to circumvent
these filters. The evasive tactics that the spammer uses are patterns and these
patterns can be modeled to combat spam. This paper investigates the
possibilities of modeling spammer behavioral patterns by well-known
classification algorithms such as Na\""ive Bayesian classifier (Na\""ive Bayes),
Decision Tree Induction (DTI) and Support Vector Machines (SVMs). Preliminary
experimental results demonstrate a promising detection rate of around 92%,
which is considerably an enhancement of performance compared to similar spammer
behavior modeling research.
","[{'version': 'v1', 'created': 'Wed, 25 Aug 2010 10:36:40 GMT'}]",2010-08-26,"[['Islam', 'Md. Saiful', ''], ['Mahmud', 'Abdullah Al', ''], ['Islam', 'Md. Rafiqul', '']]","['Spam Email', 'MLA', 'Naïve Bayes', 'DTI', 'SVMs']"
17905,1004.3566,Vishal Goyal,"G. Murugesan, C. Chellappan","An Economic-based Resource Management and Scheduling for Grid Computing
  Applications","International Journal of Computer Science Issues online at
  http://ijcsi.org/articles/An-Economic-based-Resource-Management-and-Scheduling-for-Grid-Computing-Applications.php","IJCSI, Volume 7, Issue 2, March 2010",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Resource management and scheduling plays a crucial role in achieving high
utilization of resources in grid computing environments. Due to heterogeneity
of resources, scheduling an application is significantly complicated and
challenging task in grid system. Most of the researches in this area are mainly
focused on to improve the performance of the grid system. There were some
allocation model has been proposed based on divisible load theory with
different type of workloads and a single originating processor. In this paper
we introduce a new resource allocation model with multiple load originating
processors as an economic model. Solutions for an optimal allocation of
fraction of loads to nodes obtained to minimize the cost of the grid users via
linear programming approach. It is found that the resource allocation model can
efficiently and effectively allocate workloads to proper resources.
Experimental results showed that the proposed model obtained the better
solution in terms of cost and time.
","[{'version': 'v1', 'created': 'Tue, 20 Apr 2010 20:32:31 GMT'}]",2010-04-22,"[['Murugesan', 'G.', ''], ['Chellappan', 'C.', '']]","['Grid Scheduling', 'Resource management', 'Workload distribution', 'Economic model', 'Cost Optimization']"
17906,1003.1456,Rdv Ijcsis,"Devpriya Soni, Namita Shrivastava, M. Kumar",A Methodology for Empirical Quality Assessment of Object-Oriented Design,"Pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS February 2010, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 7, No. 2, pp. 047-055, February 2010, USA",,Computer Science ISSN 19475500,cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The direct measurement of quality is difficult because there is no way we can
measure quality factors. For measuring these factors, we have to express them
in terms of metrics or models. Researchers have developed quality models that
attempt to measure quality in terms of attributes, characteristics and metrics.
In this work we have proposed the methodology of controlled experimentation
coupled with power of Logical Scoring of Preferences to evaluate global quality
of four object-oriented designs.
","[{'version': 'v1', 'created': 'Sun, 7 Mar 2010 11:49:16 GMT'}]",2010-04-28,"[['Soni', 'Devpriya', ''], ['Shrivastava', 'Namita', ''], ['Kumar', 'M.', '']]","['Software Quality', 'Quantitative Measurement', 'LSP']"
17907,1604.07805,Mohammad Roohitavaf,Mohammad Roohitavaf,Consistency in Distributed Data Stores,12 pages,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper focuses on the problem of consistency in distributed data
stores.We define strong consistency model which provides a simple semantics for
application programmers, but impossible to achieve with availability and
partition-tolerance. We also define weaker consistency models including causal
and eventual consistency. We review COPS and GentleRain as two causally
consistent data stores as well as Dynamo as an eventually consistent data
store. We provide insights about scenarios where each of these methods is
suitable, and some future research directions.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2016 19:23:52 GMT'}]",2016-04-27,"[['Roohitavaf', 'Mohammad', '']]","['Distributed data store', 'consistency', 'COPS', 'GentleRain', 'Dynamo']"
17908,0805.3939,Arnaud Martin,"Arnaud Martin (E3I2), Isabelle Quidu (E3I2)","Decision Support with Belief Functions Theory for Seabed
  Characterization",,"Dans Proceeding of the 11th International Conference on
  Information Fusion - International Conference on Information Fusion, Cologne
  : Allemagne (2008)",,,cs.AI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The seabed characterization from sonar images is a very hard task because of
the produced data and the unknown environment, even for an human expert. In
this work we propose an original approach in order to combine binary
classifiers arising from different kinds of strategies such as one-versus-one
or one-versus-rest, usually used in the SVM-classification. The decision
functions coming from these binary classifiers are interpreted in terms of
belief functions in order to combine these functions with one of the numerous
operators of the belief functions theory. Moreover, this interpretation of the
decision function allows us to propose a process of decisions by taking into
account the rejected observations too far removed from the learning data, and
the imprecise decisions given in unions of classes. This new approach is
illustrated and evaluated with a SVM in order to classify the different kinds
of sediment on image sonar.
","[{'version': 'v1', 'created': 'Mon, 26 May 2008 11:55:55 GMT'}]",2008-12-18,"[['Martin', 'Arnaud', '', 'E3I2'], ['Quidu', 'Isabelle', '', 'E3I2']]","['belief functions theory', 'decision support', 'SVM', 'sonar image']"
17909,1502.06369,Mostafa Zaman Chowdhury,"Mostafa Zaman Chowdhury, Bui Minh Trung, and Yeong Min Jang","Neighbor Cell List Optimization for Femtocell-to-Femtocell Handover in
  Dense Femtocellular Networks","International Conference on Ubiquitous and Future Networks (ICUFN),
  June 2011, Dalian, China, pp 241-245",,,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  Dense femtocells are the ultimate goal of the femtocellular network
deployment. Among three types of handovers: femtocell-to-macrocell,
macrocell-to-femtocell, and femtocell-to-femtocell, the latter two are the main
concern for the dense femtocellular network deployment. For these handover
cases, minimum as well appropriate neighbor cell list is the key element for
the successful handover. In this paper, we propose an algorithm to make minimum
but appropriate number of neighbor femtocell list for the
femtocell-to-femtocell handover. Our algorithm considers received signal level
from femto APs (FAPs); open and close access cases; and detected frequencyfrom
the neighbor femtocells. The simulation results show that the proposed scheme
is able to attain minimum but optimal number of neighbor femtocell list for the
possible femtocell-to-femtocell handover.
","[{'version': 'v1', 'created': 'Mon, 23 Feb 2015 10:16:30 GMT'}]",2015-02-24,"[['Chowdhury', 'Mostafa Zaman', ''], ['Trung', 'Bui Minh', ''], ['Jang', 'Yeong Min', '']]","['\uf0be Femtocell', 'dense femtocell', 'handover', 'SON', 'neighbor cell list', 'femtocell-to-femtocell handover']"
17910,1107.1564,Naresh Manwani,Naresh Manwani and P. S. Sastry,Polyceptron: A Polyhedral Learning Algorithm,,,,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a new algorithm for learning polyhedral classifiers
which we call as Polyceptron. It is a Perception like algorithm which updates
the parameters only when the current classifier misclassifies any training
data. We give both batch and online version of Polyceptron algorithm. Finally
we give experimental results to show the effectiveness of our approach.
","[{'version': 'v1', 'created': 'Fri, 8 Jul 2011 06:26:03 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Jun 2013 08:34:52 GMT'}, {'version': 'v3', 'created': 'Wed, 12 Mar 2014 07:08:13 GMT'}]",2015-03-19,"[['Manwani', 'Naresh', ''], ['Sastry', 'P. S.', '']]","['Classification', 'Polyhedral Sets', 'Alternating Minimization']"
17911,1402.4963,Julius Hannink,"Julius Hannink, Remco Duits and Erik Bekkers",Vesselness via Multiple Scale Orientation Scores,"9 pages, 8 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The multi-scale Frangi vesselness filter is an established tool in (retinal)
vascular imaging. However, it cannot cope with crossings or bifurcations, since
it only looks for elongated structures. Therefore, we disentangle crossing
structures in the image via (multiple scale) invertible orientation scores. The
described vesselness filter via scale-orientation scores performs considerably
better at enhancing vessels throughout crossings and bifurcations than the
Frangi version. Both methods are evaluated on a public dataset. Performance is
measured by comparing ground truth data to the segmentation results obtained by
basic thresholding and morphological component analysis of the filtered images.
","[{'version': 'v1', 'created': 'Thu, 20 Feb 2014 11:06:35 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Feb 2014 18:30:55 GMT'}, {'version': 'v3', 'created': 'Tue, 4 Mar 2014 12:33:37 GMT'}, {'version': 'v4', 'created': 'Mon, 19 May 2014 09:20:06 GMT'}]",2014-05-20,"[['Hannink', 'Julius', ''], ['Duits', 'Remco', ''], ['Bekkers', 'Erik', '']]","['Multi–scale vesselness filters', 'multi–scale orientation scores', 'line detection', 'gauge frames', 'retinal imaging']"
17912,1010.0430,Mohammad javad Sayadi,Sayadi Mohammad Javad and Fathy Mahmood,A New Approach in Packet Scheduling in the Vanet,,,,,cs.NI,http://creativecommons.org/licenses/publicdomain/,"  Vehicular Ad hoc Networks (VANET) are expected to have great potential to
improve both traffic safety and comfort in the future. When many vehicles want
to access data through roadside unit, data scheduling become an important
issue. In this paper, we identify some challenges in roadside based data
access. To address these challenges we first review some existing scheduling
schemes. We then propose a priority scheduling and finally show that using this
idea can increase QOS compare to previous algorithms.
","[{'version': 'v1', 'created': 'Sun, 3 Oct 2010 19:04:35 GMT'}]",2010-10-05,"[['Javad', 'Sayadi Mohammad', ''], ['Mahmood', 'Fathy', '']]","['VANET', 'V2V', 'V2I', 'RSU', 'Packet scheduling']"
17913,1304.2732,Wray L. Buntine,Wray L. Buntine,Decision Tree Induction Systems: A Bayesian Analysis,"Appears in Proceedings of the Third Conference on Uncertainty in
  Artificial Intelligence (UAI1987)",,,UAI-P-1987-PG-190-197,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Decision tree induction systems are being used for knowledge acquisition in
noisy domains. This paper develops a subjective Bayesian interpretation of the
task tackled by these systems and the heuristic methods they use. It is argued
that decision tree systems implicitly incorporate a prior belief that the
simpler (in terms of decision tree complexity) of two hypotheses be preferred,
all else being equal, and that they perform a greedy search of the space of
decision rules to find one in which there is strong posterior belief. A number
of improvements to these systems are then suggested.
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2013 19:48:00 GMT'}]",2013-04-11,"[['Buntine', 'Wray L.', '']]","['induction', 'binary classification', 'similarity', 'decision trees']"
17914,1606.04006,Joao Marcos,"Ori Lahav, Jo\~ao Marcos, Yoni Zohar",It ain't necessarily so: Basic sequent systems for negative modalities,"20 pages, to appear in Advances in Modal Logic Vol 11 (a few typos
  corrected)",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We look at non-classical negations and their corresponding adjustment
connectives from a modal viewpoint, over complete distributive lattices, and
apply a very general mechanism in order to offer adequate analytic proof
systems to logics that are based on them. Defining non-classical negations
within usual modal semantics automatically allows one to treat equivalent
formulas as synonymous, and to have a natural justification for a global
version of the contraposition rule. From that perspective, our study offers a
particularly useful environment in which negative modalities and their
companions may be used for dealing with inconsistency and indeterminacy. After
investigating modal logics based on arbitrary frames, we extend the results to
serial frames, reflexive frames, functional frames, and symmetric frames. In
each case we also investigate when and how classical negation may thereby be
defined.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2016 15:58:35 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Jun 2016 09:44:50 GMT'}]",2016-06-24,"[['Lahav', 'Ori', ''], ['Marcos', 'João', ''], ['Zohar', 'Yoni', '']]","['negative modalities', 'sequent systems', 'cut-admissibility', 'analyticity']"
17915,1610.01221,Kyriakos Sideris,"Kyriakos Sideris, Reza Nejabati, Dimitra Simeonidou",Seer: Empowering Software Defined Networking with Data Analytics,"8 pages, 6 figures, Big data, data analytics, data mining, knowledge
  centric networking (KCN), software defined networking (SDN), Seer, 2016 15th
  International Conference on Ubiquitous Computing and Communications and 2016
  International Symposium on Cyberspace and Security (IUCC-CSS 2016)",,,,cs.NI cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network complexity is increasing, making network control and orchestration a
challenging task. The proliferation of network information and tools for data
analytics can provide an important insight into resource provisioning and
optimisation. The network knowledge incorporated in software defined networking
can facilitate the knowledge driven control, leveraging the network
programmability. We present Seer: a flexible, highly configurable data
analytics platform for network intelligence based on software defined
networking and big data principles. Seer combines a computational engine with a
distributed messaging system to provide a scalable, fault tolerant and
real-time platform for knowledge extraction. Our first prototype uses Apache
Spark for streaming analytics and open network operating system (ONOS)
controller to program a network in real-time. The first application we
developed aims to predict the mobility pattern of mobile devices inside a smart
city environment.
","[{'version': 'v1', 'created': 'Tue, 4 Oct 2016 22:22:53 GMT'}]",2016-10-06,"[['Sideris', 'Kyriakos', ''], ['Nejabati', 'Reza', ''], ['Simeonidou', 'Dimitra', '']]","['Big data', 'data analytics', 'data mining', 'knowledge']"
17916,1504.03340,Amirhosein Bodaghi,Amir Hosein Bodaghi,"A Novel Model for Integration of Information Security Management against
  Replication Attack Based on Biological Structures of the Body",7 pages,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  By developing communications and increase of access points, computer networks
have been vulnerable considerably against wide range of information attacks,
specially new and complicated attacks. Every day, replication attacks attack
millions of network and mobile users. Increase in amount of replication attack
may be a potential danger for income of SMS or network and causes losing
customers of these services provider. Humans or software can be used to
encounter these replication attacks. It is obvious that lonely absolute use of
each method will not result in a proper answer to encounter replication
attack`s problem. Since replication attack is one of the important problems of
information protection and security in organizations for computer and mobile
phone users, while reviewing types of replication attacks and methods of
encountering, this paper uses similarities between pathologies in body and
invader factors in replication attacks, a model is provided based on biological
simulation methods existing in body`s adapted immune system to encounter these
threats.
","[{'version': 'v1', 'created': 'Sun, 23 Nov 2014 16:20:49 GMT'}]",2015-04-15,"[['Bodaghi', 'Amir Hosein', '']]","['network security', 'anti-replication attack immune system', 'short transaction', 'replication attack', 'adapted immune system']"
17917,1306.5003,Shai Vardi,Yishay Mansour and Shai Vardi,A Local Computation Approximation Scheme to Maximum Matching,Appears in Approx 2013,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a polylogarithmic local computation matching algorithm which
guarantees a $(1-\eps)$-approximation to the maximum matching in graphs of
bounded degree.
","[{'version': 'v1', 'created': 'Thu, 20 Jun 2013 21:31:14 GMT'}]",2013-06-24,"[['Mansour', 'Yishay', ''], ['Vardi', 'Shai', '']]","['Local Computation Algortithms', 'Sublinear Algorithms', 'Approximation Algorithms', 'Maximum Matching']"
17918,1506.01195,Tianyi Liu,"Tianyi Liu, Shuangsang Fang, Yuehui Zhao, Peng Wang, Jun Zhang",Implementation of Training Convolutional Neural Networks,"10 pages, 6 figures",,,,cs.CV cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning refers to the shining branch of machine learning that is based
on learning levels of representations. Convolutional Neural Networks (CNN) is
one kind of deep neural network. It can study concurrently. In this article, we
gave a detailed analysis of the process of CNN algorithm both the forward
process and back propagation. Then we applied the particular convolutional
neural network to implement the typical face recognition problem by java. Then,
a parallel strategy was proposed in section4. In addition, by measuring the
actual time of forward and backward computing, we analysed the maximal speed up
and parallel efficiency theoretically.
","[{'version': 'v1', 'created': 'Wed, 3 Jun 2015 10:18:49 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Jun 2015 02:10:39 GMT'}]",2015-06-05,"[['Liu', 'Tianyi', ''], ['Fang', 'Shuangsang', ''], ['Zhao', 'Yuehui', ''], ['Wang', 'Peng', ''], ['Zhang', 'Jun', '']]","['Convolutional Neural Networks', 'face training', 'Parallel Strategy', 'Maximal speedup']"
17919,1412.2416,Johannes Stegmann Dr.,Johannes Stegmann,"Paradigm shifts. Part II. Reverse Transcriptase. Analysis of reference
  stability and word frequencies","10 pages, 7 tables, 1 figure, corrections",,,,cs.DL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The reverse transcription paradigm shift in RNA tumor virus research marked
by the discovery of the reverse transcriptase in 1970 was traced using
co-citation and title word frequency analysis. It is shown that this event is
associated with a break in citation patterns and the occurrence of previously
unknown technical terms.
","[{'version': 'v1', 'created': 'Sun, 7 Dec 2014 23:51:35 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Dec 2014 17:22:04 GMT'}]",2014-12-10,"[['Stegmann', 'Johannes', '']]","['Paradigm Shift', 'Co-Citation analysis', 'Word Frequency Analysis', 'Reverse Transcriptase']"
17920,1208.2429,Sergio Grammatico,Sergio Grammatico and Gabriele Pannocchia,"Linear model predictive control based on polyhedral control Lyapunov
  functions: theory and applications","10 pages, 2 figures",,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Polyhedral control Lyapunov functions (PCLFs) are exploited in finite-horizon
linear model predictive control formulations in order to guarantee the maximal
domain of attraction (DoA), in contrast to traditional formulations based on
quadratic control Lyapunov functions. In particular, the terminal region is
chosen as the largest DoA, namely the entire controllable set, which is
parametrized by a level set of a suitable PCLF. Closed-loop stability of the
origin is guaranteed either by using an ""inflated"" PCLF as terminal cost or by
adding a contraction constraint for the PCLF evaluated at the current state.
Two variants of the formulation based on the inflated PCLF terminal cost are
also presented. In all proposed formulations, the guaranteed DoA is always the
entire controllable set, independently of the chosen finite horizon.
Closed-loop inherent robustness with respect to arbitrary, sufficiently small
perturbations is also established. Moreover, all proposed schemes can be
formulated as Quadratic Programming problems. Numerical examples show the main
benefits and achievements of the proposed formulations.
","[{'version': 'v1', 'created': 'Sun, 12 Aug 2012 13:40:18 GMT'}]",2012-08-14,"[['Grammatico', 'Sergio', ''], ['Pannocchia', 'Gabriele', '']]","['Model predictive control', 'control Lyapunov functions', 'stability', 'inherent robustness']"
17921,1401.3584,Abdul Kadir,"Abdul Kadir, Lukito Edi Nugroho, Adhi Susanto and Paulus Insap Santosa",Experiments of Distance Measurements in a Foliage Plant Retrieval System,"14 pages, International Journal of Signal Processing, Image
  Processing and Pattern Recognition Vol. 5, No. 2, June, 2012",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of important components in an image retrieval system is selecting a
distance measure to compute rank between two objects. In this paper, several
distance measures were researched to implement a foliage plant retrieval
system. Sixty kinds of foliage plants with various leaf color and shape were
used to test the performance of 7 different kinds of distance measures: city
block distance, Euclidean distance, Canberra distance, Bray-Curtis distance, x2
statistics, Jensen Shannon divergence and Kullback Leibler divergence. The
results show that city block and Euclidean distance measures gave the best
performance among the others.
","[{'version': 'v1', 'created': 'Wed, 20 Nov 2013 07:51:59 GMT'}]",2014-01-16,"[['Kadir', 'Abdul', ''], ['Nugroho', 'Lukito Edi', ''], ['Susanto', 'Adhi', ''], ['Santosa', 'Paulus Insap', '']]","['Distance Measure', 'Retrieval system', 'City block distance', 'Euclidean distance']"
17922,1212.3216,Ram  Raw,"Ram Shringar Raw, Sanjoy Das, Nanhay Singh, Sanjeet Kumar, Shailender
  Kumar","Feasibility Evaluation of VANET using Directional-Location Aided Routing
  (D-LAR) Protocol",,"IJCSI International Journal of Computer Science Issues, Vol. 9,
  Issue 5, No 3, September 2012",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vehicular Ad hoc Networks (VANETs) allow vehicles to form a self-organized
network without any fixed infrastructure. VANETs have received wide attention
and numerous research issues have been identified in the recent time. The
design and implementation of efficient and scalable routing protocols for
VANETs is a challenging task due to high dynamics and mobility constraints. In
this paper, we have proposed D-LAR (Directional-Location Aided Routing), is an
extension of Location Aided Routing (LAR) with Directional Routing (DIR)
capability. D-LAR is a greedy approach based-position based routing protocol to
forward packet to the node present in request zone within the transmission
range of the source node as most suitable next-hop node. We have justified the
feasibility of our proposed protocol for VANET.
","[{'version': 'v1', 'created': 'Thu, 13 Dec 2012 16:52:56 GMT'}]",2012-12-14,"[['Raw', 'Ram Shringar', ''], ['Das', 'Sanjoy', ''], ['Singh', 'Nanhay', ''], ['Kumar', 'Sanjeet', ''], ['Kumar', 'Shailender', '']]","['VANET', 'Routing Protocol', 'DIR', 'LAR', 'D-LAR', 'Feasibility Evaluation']"
17923,1701.02927,Sebastian Muskalla,"Mohamed Faouzi Atig, Roland Meyer, Sebastian Muskalla, Prakash
  Saivasan",On the Upward/Downward Closures of Petri Nets,"The conference version of this paper has been published in the
  proceedings of the 42nd International Symposium on Mathematical Foundations
  of Computer Science, MFCS 2017",,,,cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the size and the complexity of computing finite state automata (FSA)
representing and approximating the downward and the upward closure of Petri net
languages with coverability as the acceptance condition. We show how to
construct an FSA recognizing the upward closure of a Petri net language in
doubly-exponential time, and therefore the size is at most doubly exponential.
For downward closures, we prove that the size of the minimal automata can be
non-primitive recursive. In the case of BPP nets, a well-known subclass of
Petri nets, we show that an FSA accepting the downward/upward closure can be
constructed in exponential time. Furthermore, we consider the problem of
checking whether a simple regular language is included in the downward/upward
closure of a Petri net/BPP net language. We show that this problem is
EXPSPACE-complete (resp. NP-complete) in the case of Petri nets (resp. BPP
nets). Finally, we show that it is decidable whether a Petri net language is
upward/downward closed. To this end, we prove that one can decide whether a
given regular language is a subset of a Petri net coverability language.
","[{'version': 'v1', 'created': 'Wed, 11 Jan 2017 11:20:31 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Apr 2018 17:05:17 GMT'}]",2018-04-09,"[['Atig', 'Mohamed Faouzi', ''], ['Meyer', 'Roland', ''], ['Muskalla', 'Sebastian', ''], ['Saivasan', 'Prakash', '']]","['Petri nets', 'BPP nets', 'downward closure', 'upward closure']"
17924,1501.01914,Roy Freedman,Roy S. Freedman,Some New Results on Binary Relations,"13 pages, 7 figures, 1 appendix",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is well known that if a function from set A to set B has a right inverse
then the function is a surjection and the right inverse is an injection. For
finite sets, the number of functions, injections, and surjections can also be
counted. Relations generalize functions: do similar results exist for
relations? This paper proves several new results concerning binary relations.
For finite sets, we derive formulas for the number of right total, right
unique, left total, and left unique relations. We also provide formulas that
count the number of relations that are both right unique and left unique; right
unique and right total; and left unique and left total. We conclude by
discussing the probability that a relation selected at random is right unique
or right total.
","[{'version': 'v1', 'created': 'Thu, 8 Jan 2015 17:49:36 GMT'}]",2015-01-09,"[['Freedman', 'Roy S.', '']]","['binary relation', 'right total', 'right unique', 'left total', 'left unique', 'relation calculus']"
17925,1312.5480,Maurizio Bocca Ph.D.,"Maurizio Bocca, Anh Luong, Neal Patwari, Thomas Schmid",Dial It In: Rotating RF Sensors to Enhance Radio Tomography,9 pages,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A radio tomographic imaging (RTI) system uses the received signal strength
(RSS) measured by RF sensors in a static wireless network to localize people in
the deployment area, without having them to carry or wear an electronic device.
This paper addresses the fact that small-scale changes in the position and
orientation of the antenna of each RF sensor can dramatically affect imaging
and localization performance of an RTI system. However, the best placement for
a sensor is unknown at the time of deployment. Improving performance in a
deployed RTI system requires the deployer to iteratively ""guess-and-retest"",
i.e., pick a sensor to move and then re-run a calibration experiment to
determine if the localization performance had improved or degraded. We present
an RTI system of servo-nodes, RF sensors equipped with servo motors which
autonomously ""dial it in"", i.e., change position and orientation to optimize
the RSS on links of the network. By doing so, the localization accuracy of the
RTI system is quickly improved, without requiring any calibration experiment
from the deployer. Experiments conducted in three indoor environments
demonstrate that the servo-nodes system reduces localization error on average
by 32% compared to a standard RTI system composed of static RF sensors.
","[{'version': 'v1', 'created': 'Thu, 19 Dec 2013 11:05:58 GMT'}]",2013-12-20,"[['Bocca', 'Maurizio', ''], ['Luong', 'Anh', ''], ['Patwari', 'Neal', ''], ['Schmid', 'Thomas', '']]","['Radio tomographic imaging', 'device-free localization', 'RF sensors', 'multipath fading']"
17926,0905.2509,Stefano Zacchiroli,"Angelo Di Iorio, Fabio Vitali, Davide Rossi, Stefano Zacchiroli (PPS)",Where are your Manners? Sharing Best Community Practices in the Web 2.0,"ACM symposium on Applied Computing, Honolulu : \'Etats-Unis
  d'Am\'erique (2009)",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Web 2.0 fosters the creation of communities by offering users a wide
array of social software tools. While the success of these tools is based on
their ability to support different interaction patterns among users by imposing
as few limitations as possible, the communities they support are not free of
rules (just think about the posting rules in a community forum or the editing
rules in a thematic wiki). In this paper we propose a framework for the sharing
of best community practices in the form of a (potentially rule-based)
annotation layer that can be integrated with existing Web 2.0 community tools
(with specific focus on wikis). This solution is characterized by minimal
intrusiveness and plays nicely within the open spirit of the Web 2.0 by
providing users with behavioral hints rather than by enforcing the strict
adherence to a set of rules.
","[{'version': 'v1', 'created': 'Fri, 15 May 2009 10:04:29 GMT'}]",2009-05-18,"[['Di Iorio', 'Angelo', '', 'PPS'], ['Vitali', 'Fabio', '', 'PPS'], ['Rossi', 'Davide', '', 'PPS'], ['Zacchiroli', 'Stefano', '', 'PPS']]","['Web personalization', 'web annotations', 'best-practices', 'validation']"
17927,1504.03749,Kevin Carlberg,"Kevin Carlberg, Matthew Barone, Harbir Antil","Galerkin v. least-squares Petrov--Galerkin projection in nonlinear model
  reduction",Submitted to Journal of Computational Physics,,,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Least-squares Petrov--Galerkin (LSPG) model-reduction techniques such as the
Gauss--Newton with Approximated Tensors (GNAT) method have shown promise, as
they have generated stable, accurate solutions for large-scale turbulent,
compressible flow problems where standard Galerkin techniques have failed.
However, there has been limited comparative analysis of the two approaches.
This is due in part to difficulties arising from the fact that Galerkin
techniques perform optimal projection associated with residual minimization at
the time-continuous level, while LSPG techniques do so at the time-discrete
level. This work provides a detailed theoretical and computational comparison
of the two techniques for two common classes of time integrators: linear
multistep schemes and Runge--Kutta schemes. We present a number of new
findings, including conditions under which the LSPG ROM has a time-continuous
representation, conditions under which the two techniques are equivalent, and
time-discrete error bounds for the two approaches. Perhaps most surprisingly,
we demonstrate both theoretically and computationally that decreasing the time
step does not necessarily decrease the error for the LSPG ROM; instead, the
time step should be `matched' to the spectral content of the reduced basis. In
numerical experiments carried out on a turbulent compressible-flow problem with
over one million unknowns, we show that increasing the time step to an
intermediate value decreases both the error and the simulation time of the LSPG
reduced-order model by an order of magnitude.
","[{'version': 'v1', 'created': 'Wed, 15 Apr 2015 00:19:15 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Dec 2015 23:58:15 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Aug 2016 23:34:39 GMT'}]",2016-08-18,"[['Carlberg', 'Kevin', ''], ['Barone', 'Matthew', ''], ['Antil', 'Harbir', '']]","['model reduction', 'GNAT', 'least-squares Petrov–Galerkin projection', 'Galerkin projection', 'CFD']"
17928,1207.4710,Dror Fried,"Dror Fried, Solomon Eyal Shimony, Amit Benbassat, Cenny Wenner",Complexity of Canadian Traveler Problem Variants,,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Canadian traveler problem (CTP) is the problem of traversing a given
graph, where some of the edges may be blocked - a state which is revealed only
upon reaching an incident vertex. Originally stated by Papadimitriou and
Yannakakis (1991), the adversarial version of CTP was shown to be
PSPACE-complete, with the stochastic version shown to be #P-hard. We show that
stochastic CTP is also PSPACE-complete: initially proving PSPACE-hardness for
the dependent version of stochastic CTP,and proceeding with gadgets that allow
us to extend the proof to the independent case. Since for disjoint-path graphs,
CTP can be solved in polynomial time, we examine the complexity of the more
general remote-sensing CTP, and show that it is NP-hard even for disjoint-path
graphs.
","[{'version': 'v1', 'created': 'Thu, 19 Jul 2012 15:39:52 GMT'}]",2012-07-20,"[['Fried', 'Dror', ''], ['Shimony', 'Solomon Eyal', ''], ['Benbassat', 'Amit', ''], ['Wenner', 'Cenny', '']]","['Canadian Traveler Problem', 'Complexity of Navigation underUncertainty', 'Stochastic Shortest Path with Recourse']"
17929,1008.3459,Xavier Dahan,"Xavier Dahan, Abdulilah Kadri, \'Eric Schost",Bit-size estimates for triangular sets in positive dimension,37 pages,,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give bit-size estimates for the coefficients appearing in triangular sets
describing positive-dimensional algebraic sets defined over Q. These estimates
are worst case upper bounds; they depend only on the degree and height of the
underlying algebraic sets. We illustrate the use of these results in the
context of a modular algorithm. This extends results by the first and last
author, which were confined to the case of dimension 0. Our strategy is to get
back to dimension 0 by evaluation and inter- polation techniques. Even though
the main tool (height theory) remains the same, new difficulties arise to
control the growth of the coefficients during the interpolation process.
","[{'version': 'v1', 'created': 'Fri, 20 Aug 2010 08:43:03 GMT'}]",2010-11-24,"[['Dahan', 'Xavier', ''], ['Kadri', 'Abdulilah', ''], ['Schost', 'Éric', '']]","['triangular set', 'regular chain', 'Chow form', 'height function', 'bit-size']"
17930,1701.04763,Eugenio Gianniti,"Eugenio Gianniti, Danilo Ardagna, Michele Ciavotta, and Mauro
  Passacantando",A Game-Theoretic Approach for Runtime Capacity Allocation in MapReduce,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays many companies have available large amounts of raw, unstructured
data. Among Big Data enabling technologies, a central place is held by the
MapReduce framework and, in particular, by its open source implementation,
Apache Hadoop. For cost effectiveness considerations, a common approach entails
sharing server clusters among multiple users. The underlying infrastructure
should provide every user with a fair share of computational resources,
ensuring that Service Level Agreements (SLAs) are met and avoiding wastes. In
this paper we consider two mathematical programming problems that model the
optimal allocation of computational resources in a Hadoop 2.x cluster with the
aim to develop new capacity allocation techniques that guarantee better
performance in shared data centers. Our goal is to get a substantial reduction
of power consumption while respecting the deadlines stated in the SLAs and
avoiding penalties associated with job rejections. The core of this approach is
a distributed algorithm for runtime capacity allocation, based on Game Theory
models and techniques, that mimics the MapReduce dynamics by means of
interacting players, namely the central Resource Manager and Class Managers.
","[{'version': 'v1', 'created': 'Tue, 17 Jan 2017 16:57:15 GMT'}]",2017-01-18,"[['Gianniti', 'Eugenio', ''], ['Ardagna', 'Danilo', ''], ['Ciavotta', 'Michele', ''], ['Passacantando', 'Mauro', '']]","['Hadoop', 'Resource Management', 'Capacity Allocation', 'Admission Control', 'Game Theory', 'Generalized Nash Equilibrium Problem']"
17931,1610.08325,Andrea Gorrini,"Andrea Gorrini, Luca Crociani, Claudio Feliciani, Pengfei Zhao,
  Katsuhiro Nishinari and Stefania Bandini","Social Groups and Pedestrian Crowds: Experiment on Dyads in a Counter
  Flow Scenario","Pre-print of a paper presented at the 8th International Conference on
  Pedestrian and Evacuation Dynamics (PED2016), Hefei, China - Oct 17-21, 2016",,,,cs.MA physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The calibration and validation of pedestrian simulations require the
acquisition of empirical evidences of human behaviour. The current work
presents the results of an experiment focused on the potentially combined
effect of counter flow and grouping on pedestrian dynamics. In particular, we
focused on: (i) four different configurations of flow ratio (the rate between
the minor flow and the total flow in bidirectional scenarios); (ii) dyads, as
the most frequently observed and basic social groups of crowds. Results showed
that the increase of flow ratio negatively impacted the speed of pedestrians.
Dyads walked significantly slower than singletons, due to the difficulty in
movement coordination among group members (proxemics) in case of counter flow.
The collected results represent an useful contribution towards the validation
of pedestrian simulations.
","[{'version': 'v1', 'created': 'Tue, 25 Oct 2016 14:22:11 GMT'}]",2016-10-27,"[['Gorrini', 'Andrea', ''], ['Crociani', 'Luca', ''], ['Feliciani', 'Claudio', ''], ['Zhao', 'Pengfei', ''], ['Nishinari', 'Katsuhiro', ''], ['Bandini', 'Stefania', '']]","['Pedestrian', 'Experiment', 'Counter Flow', 'Bidirectional Flow', 'Dyads', 'Proxemics']"
17932,1307.3014,Karthik Keyan vkk,"V.Karthikeyan, S.Senthilkumar, and V.J.Vijayalakshmi","A New Approach to the Solution of Economic Dispatch Using Particle Swarm
  Optimization with Simulated Annealing","12 pages,3 figures. arXiv admin note: text overlap with
  arXiv:1206.0915, arXiv:0910.4116, arXiv:1306.1454 by other authors","International Journal on Computational Sciences & Applications
  (IJCSA)Vol.3, No.3, June 2013",,,cs.CE cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new approach to the solution of Economic Dispatch using Particle Swarm
Optimization is presented. It is the progression of allocating production
amongst the dedicated units such that the restriction forced are fulfilled and
the power needs are reduced. More just, the soft computing method has received
supplementary concentration and was used in a quantity of successful and
sensible applications. Here, an attempt has been made to find out the minimum
cost by using Particle Swarm Optimization Algorithm using the data of three
generating units. In this work, data has been taken such as the loss
coefficients with the max-min power limit and cost function. PSO and Simulated
Annealing are functional to put out the least amount for dissimilar energy
requirements. When the outputs are compared with the conventional method, PSO
seems to give an improved result with enhanced convergence feature. All the
methods are executed in MATLAB environment. The effectiveness and feasibility
of the proposed method were demonstrated by three generating units case study.
Output gives hopeful results, signifying that the projected method of
calculation is competent of economically formative advanced eminence solutions
addressing economic dispatch problems.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2013 08:42:30 GMT'}]",2013-07-12,"[['Karthikeyan', 'V.', ''], ['Senthilkumar', 'S.', ''], ['Vijayalakshmi', 'V. J.', '']]","['Economic dispatch', 'particle swarm optimization', 'prohibited zones', 'ramp rate limits', 'simulated annealing']"
17933,1701.08557,Igor Sergeev S.,"M. I. Grinchuk, I. S. Sergeev","Thin circulant matrices and lower bounds on the complexity of some
  Boolean operators",15 pages,"Diskretnyi Analiz i Issledovanie Operatsii (Discrete analysis and
  operations research). 2011. 18(5), 38-53. (in Russian)",,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove a lower bound
$\Omega\left(\frac{k+l}{k^2l^2}N^{2-\frac{k+l+2}{kl}}\right)$ on the maximal
possible weight of a $(k,l)$-free (that is, free of all-ones $k\times l$
submatrices) Boolean circulant $N \times N$ matrix. The bound is close to the
known bound for the class of all $(k,l)$-free matrices. As a consequence, we
obtain new bounds for several complexity measures of Boolean sums' systems and
a lower bound $\Omega(N^2\log^{-6} N)$ on the monotone complexity of the
Boolean convolution of order $N$.
","[{'version': 'v1', 'created': 'Mon, 30 Jan 2017 11:39:38 GMT'}]",2017-01-31,"[['Grinchuk', 'M. I.', ''], ['Sergeev', 'I. S.', '']]","['complexity', 'circulant matrix', 'thin matrix', 'Zarankiewicz problem', 'monotone circuit', 'rectifier circuit', 'Boolean sum', 'Boolean convolution']"
17934,1407.1957,Hilton Bristow,Hilton Bristow and Simon Lucey,Regression-Based Image Alignment for General Object Categories,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Gradient-descent methods have exhibited fast and reliable performance for
image alignment in the facial domain, but have largely been ignored by the
broader vision community. They require the image function be smooth and
(numerically) differentiable -- properties that hold for pixel-based
representations obeying natural image statistics, but not for more general
classes of non-linear feature transforms. We show that transforms such as Dense
SIFT can be incorporated into a Lucas Kanade alignment framework by predicting
descent directions via regression. This enables robust matching of instances
from general object categories whilst maintaining desirable properties of Lucas
Kanade such as the capacity to handle high-dimensional warp parametrizations
and a fast rate of convergence. We present alignment results on a number of
objects from ImageNet, and an extension of the method to unsupervised joint
alignment of objects from a corpus of images.
","[{'version': 'v1', 'created': 'Tue, 8 Jul 2014 05:43:47 GMT'}]",2014-07-09,"[['Bristow', 'Hilton', ''], ['Lucey', 'Simon', '']]","['Lucas Kanade', 'alignment', 'regression', 'Dense SIFT']"
17935,1109.2015,Michael Leuschel,Stefan Hallerstede and Michael Leuschel,Constraint-Based Deadlock Checking of High-Level Specifications,,"Theory and Practice of Logic Programming 11(4--5): 767--782, 2011",,,cs.LO cs.PL cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Establishing the absence of deadlocks is important in many applications of
formal methods. The use of model checking for finding deadlocks in formal
models is often limited. In this paper we propose a constraint-based approach
to finding deadlocks employing the ProB constraint solver. We present the
general technique, as well as various improvements that had to be performed on
ProB's Prolog kernel, such as reification of membership and arithmetic
constraints. This work was guided by an industrial case study, where a team
from Bosch was modeling a cruise control system. Within this case study, ProB
was able to quickly find counter examples to very large deadlock-freedom
constraints. In the paper, we also present other successful applications of
this new technique. Experiments using SAT and SMT solvers on these constraints
were thus far unsuccessful.
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2011 14:03:41 GMT'}]",2011-09-12,"[['Hallerstede', 'Stefan', ''], ['Leuschel', 'Michael', '']]","['Constraints', 'Formal Methods', 'Deadlocks', 'Prolog', 'Applications']"
17936,1702.04067,Devorah Kletenik,"Eric Bach, Jeremie Dusart, Lisa Hellerstein, and Devorah Kletenik",Submodular Goal Value of Boolean Functions,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, Deshpande et al. introduced a new measure of the complexity of a
Boolean function. We call this measure the ""goal value"" of the function. The
goal value of $f$ is defined in terms of a monotone, submodular utility
function associated with $f$. As shown by Deshpande et al., proving that a
Boolean function $f$ has small goal value can lead to a good approximation
algorithm for the Stochastic Boolean Function Evaluation problem for $f$. Also,
if $f$ has small goal value, it indicates a close relationship between two
other measures of the complexity of $f$, its average-case decision tree
complexity and its average-case certificate complexity. In this paper, we
explore the goal value measure in detail. We present bounds on the goal values
of arbitrary and specific Boolean functions, and present results on properties
of the measure. We compare the goal value measure to other, previously studied,
measures of the complexity of Boolean functions. Finally, we discuss a number
of open questions provoked by our work.
","[{'version': 'v1', 'created': 'Tue, 14 Feb 2017 03:48:32 GMT'}, {'version': 'v2', 'created': 'Sun, 23 Apr 2017 19:10:49 GMT'}, {'version': 'v3', 'created': 'Wed, 27 Sep 2017 17:59:39 GMT'}]",2017-09-28,"[['Bach', 'Eric', ''], ['Dusart', 'Jeremie', ''], ['Hellerstein', 'Lisa', ''], ['Kletenik', 'Devorah', '']]","['Boolean functions', 'submodularity', 'read-once formulas']"
17937,1304.4738,Jaroslav Hor\'a\v{c}ek,"Jaroslav Hor\'a\v{c}ek, Milan Hlad\'ik",Computing Enclosures of Overdetermined Interval Linear Systems,Presented at SCAN 2012,,,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work considers special types of interval linear systems - overdetermined
systems. Simply said these systems have more equations than variables. The
solution set of an interval linear system is a collection of all solutions of
all instances of an interval system. By the instance we mean a point real
system that emerges when we independently choose a real number from each
interval coefficient of the interval system. Enclosing the solution set of
these systems is in some ways more difficult than for square systems. The main
goal of this work is to present various methods for solving overdetermined
interval linear systems. We would like to present them in an understandable way
even for nonspecialists in a field of linear systems. The second goal is a
numerical comparison of all the methods on random interval linear systems
regarding widths of enclosures, computation times and other special properties
of methods.
","[{'version': 'v1', 'created': 'Wed, 17 Apr 2013 09:04:39 GMT'}]",2013-04-18,"[['Horáček', 'Jaroslav', ''], ['Hladík', 'Milan', '']]","['interval linear systems', 'enclosure methods', 'overdetermined systems']"
17938,1402.3107,Abdelhafid Zitouni,Zitouni Abdelhafid,"Rigorous Description Of Design Components Functionality: An Approach
  Based Contract","10pages, 7 figures","IJCSI : International Journal of Computer Science Issues, ISSN:
  1694-0814, Vol. 9, Issue. 1, pp 187-196, January 2012",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current models for software components have made component-based software
engineering practical. However, these models are limited in the sense that
their support for the characterization/specification of design components
primarily deals with syntactic issues. To avoid mismatch and misuse of
components, more comprehensive specification of software components is
required, In this paper, we present a contract-based approach to analyze and
model the both aspects (functional and non-functional) properties of design
components and their composition in order to detect and correct composition
errors. This approach permits to characterize the structural, interface and
behavioural aspects of design component. To enable this we present a pattern
contract language that captures the structural and behavioral requirements
associated with a range of patterns, as well as the system properties that are
guaranteed as a result. In addition, we propose the use of the LOTOS language
as an ADL for formalizing these aspects. We illustrate the approach by applying
it to a standard design
","[{'version': 'v1', 'created': 'Thu, 13 Feb 2014 12:25:34 GMT'}]",2014-02-14,"[['Abdelhafid', 'Zitouni', '']]","['Architecture Description Language', 'Design by contract', 'Design components', 'Design patterns', 'LOTOS']"
17939,1304.2981,Sultan Ullah,Sultan Ullah and Zheng Xuefeng,Cloud Computing: a Prologue,04 Pages,"International Journal of Advanced Research in Computer and
  Communication Engineering Vol. 1, No. 1, March, 2012",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An emerging internet based super computing model is represented by cloud
computing. Cloud computing is the convergence and evolution of several concepts
from virtualization, distributed storage, grid, and automation management to
enable a more flexible approach for deploying and scaling applications.
However, cloud computing moves the application software and databases to the
large data centers, where the management of the data and services may not be
fully trustworthy. The concept of cloud computing on the basis of the various
definitions available in the industry and the characteristics of cloud
computing are being analyzed in this paper. The paper also describes the main
cloud service providers and their products followed by primary cloud computing
operating systems.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2013 14:45:47 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Apr 2013 01:48:59 GMT'}]",2013-04-30,"[['Ullah', 'Sultan', ''], ['Xuefeng', 'Zheng', '']]","['Cloud Computing', 'IaaS', 'PaaS', 'SaaS', 'Cloud OS']"
17940,1603.07438,Shouhuai Xu,Zhenxin Zhan and Maochao Xu and Shouhuai Xu,A Characterization of Cybersecurity Posture from Network Telescope Data,,"Proceedings of the 6th International Conference Trusted Systems
  (INTRUST'2014), pp 105-126",,,cs.CR stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data-driven understanding of cybersecurity posture is an important problem
that has not been adequately explored. In this paper, we analyze some real data
collected by CAIDA's network telescope during the month of March 2013. We
propose to formalize the concept of cybersecurity posture from the perspectives
of three kinds of time series: the number of victims (i.e., telescope IP
addresses that are attacked), the number of attackers that are observed by the
telescope, and the number of attacks that are observed by the telescope.
Characterizing cybersecurity posture therefore becomes investigating the
phenomena and statistical properties exhibited by these time series, and
explaining their cybersecurity meanings. For example, we propose the concept of
{\em sweep-time}, and show that sweep-time should be modeled by stochastic
process, rather than random variable. We report that the number of attackers
(and attacks) from a certain country dominates the total number of attackers
(and attacks) that are observed by the telescope. We also show that
substantially smaller network telescopes might not be as useful as a large
telescope.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2016 04:44:18 GMT'}]",2016-03-25,"[['Zhan', 'Zhenxin', ''], ['Xu', 'Maochao', ''], ['Xu', 'Shouhuai', '']]","['Cybersecurity data analytics', 'cybersecurity posture', 'network telescope', 'network blackhole', 'darknet', 'cyber attack sweep-time', 'time series data']"
17941,1409.6768,Bernhard Rumpe,"Carsten Jacobi, Bernhard Rumpe",Hierarchical XP,"14 pages, 2 figures. arXiv admin note: text overlap with
  arXiv:1409.6604","Extreme Programming Examined. Addison-Wesley, 2001",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  XP is a light-weight methodology suited particularly for small-sized teams
that develop software which has only vague or rapidly changing requirements.
The discipline of systems engineering knows it as approach of incremental
system change or also of ""muddling through"". In this paper, we introduce three
well known methods of reorganizing companies, namely, the holistic approach,
the incremental approach, and the hierarchical approach. We show similarities
between software engineering methods and company reorganizationprocesses. In
this context, we discuss the extreme programming (XP) approach and how the
elements of the hierarchical approach can improve XP. We provide hints on how
to scale up XP to larger projects e.g. those common in the telecommunication
industry.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 18:14:49 GMT'}]",2014-09-25,"[['Jacobi', 'Carsten', ''], ['Rumpe', 'Bernhard', '']]","['reorganization', 'XP', 'mixed scanning', 'project organization', 'hierarchical approach']"
17942,1701.07521,Nikita Polyanskii,"Nikita Polyanskii, Vasiliy Usatyuk, and Ilya Vorobyev",Floor Scale Modulo Lifting for QC-LDPC codes,"7 pages, 2 columns",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the given paper we present a novel approach for constructing a QC-LDPC
code of smaller length by lifting a given QC-LDPC code. The proposed method can
be considered as a generalization of floor lifting. Also we prove several
probabilistic statements concerning a theoretical improvement of the method
with respect to the number of small cycles. Making some offline calculation of
scale parameter it is possible to construct a sequence of QC-LDPC codes with
different circulant sizes generated from a single exponent matrix using only
floor and scale operations. The only parameter we store in memory is a constant
needed for scaling.
","[{'version': 'v1', 'created': 'Wed, 25 Jan 2017 23:57:17 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Feb 2017 23:52:23 GMT'}]",2017-02-07,"[['Polyanskii', 'Nikita', ''], ['Usatyuk', 'Vasiliy', ''], ['Vorobyev', 'Ilya', '']]","['QC-LDPC code', 'floor lifting', 'modulo lifting', 'block cycle', 'girth']"
17943,1205.1871,Mehdi Alipour,"Mehdi Alipour, Mostafa E. Salehi, and Hesamodin shojaei baghini","Design Space Exploration to Find the Optimum Cache and Register File
  Size for Embedded Applications","The 2011 International Conference on Embedded Systems and
  Applications, las vegas, nevada, USA",,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the future, embedded processors must process more computation-intensive
network applications and internet traffic and packet-processing tasks become
heavier and sophisticated. Since the processor performance is severely related
to the average memory access delay and also the number of processor registers
affects the performance, cache and register file are two major parts in
designing embedded processor architecture. Although increasing cache and
register file size leads to performance improvement in embedded applications
and packet-processing tasks in high traffic networks with too much packets, the
increased area, power consumption and memory hierarchy delay are the overheads
of these techniques. Therefore, implementing these components in the optimum
size is of significant interest in the design of embedded processors. This
paper explores the effect of cache and register file size on the processor
performance to calculate the optimum size of these components for embedded
applications. Experimental results show that although having bigger cache and
register file is one of the performance improvement approaches in embedded
processors, however, by increasing the size of these parameters over a
threshold level, performance improvement is saturated and then, decreased.
","[{'version': 'v1', 'created': 'Wed, 9 May 2012 05:23:13 GMT'}]",2012-05-10,"[['Alipour', 'Mehdi', ''], ['Salehi', 'Mostafa E.', ''], ['baghini', 'Hesamodin shojaei', '']]","['Embedded processor', 'design space exploration', 'cache', 'optimum size of register file', 'cache access delay']"
17944,1008.1643,Ninan Sajeeth Philip,Ninan Sajeeth Philip,A Learning Algorithm based on High School Teaching Wisdom,,,,,cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  A learning algorithm based on primary school teaching and learning is
presented. The methodology is to continuously evaluate a student and to give
them training on the examples for which they repeatedly fail, until, they can
correctly answer all types of questions. This incremental learning procedure
produces better learning curves by demanding the student to optimally dedicate
their learning time on the failed examples. When used in machine learning, the
algorithm is found to train a machine on a data with maximum variance in the
feature space so that the generalization ability of the network improves. The
algorithm has interesting applications in data mining, model evaluations and
rare objects discovery.
","[{'version': 'v1', 'created': 'Tue, 10 Aug 2010 07:44:08 GMT'}, {'version': 'v2', 'created': 'Sun, 12 Dec 2010 06:13:31 GMT'}]",2010-12-14,"[['Philip', 'Ninan Sajeeth', '']]","['Optimizationmethods', 'TrainingSample Selection', 'Difference Boosting Neural Network']"
17945,1506.01830,Srdan Kitic,"Sr{\dj}an Kiti\'c (PANAMA), Nancy Bertin (PANAMA), R\'emi Gribonval
  (PANAMA)","Sparsity and cosparsity for audio declipping: a flexible non-convex
  approach",,"LVA/ICA 2015 - The 12th International Conference on Latent
  Variable Analysis and Signal Separation, Aug 2015, Liberec, Czech Republic",,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work investigates the empirical performance of the sparse synthesis
versus sparse analysis regularization for the ill-posed inverse problem of
audio declipping. We develop a versatile non-convex heuristics which can be
readily used with both data models. Based on this algorithm, we report that, in
most cases, the two models perform almost similarly in terms of signal
enhancement. However, the analysis version is shown to be amenable for real
time audio processing, when certain analysis operators are considered. Both
versions outperform state-of-the-art methods in the field, especially for the
severely saturated signals.
","[{'version': 'v1', 'created': 'Fri, 5 Jun 2015 09:20:00 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Jun 2015 12:35:51 GMT'}]",2015-06-10,"[['Kitić', 'Srđan', '', 'PANAMA'], ['Bertin', 'Nancy', '', 'PANAMA'], ['Gribonval', 'Rémi', '', 'PANAMA']]","['Clipping', 'audio', 'sparse', 'cosparse', 'non-convex', 'real-time']"
17946,1305.7448,Hans Bodlaender,"Stefan Fafianie, Hans L. Bodlaender and Jesper Nederlof","Speeding-up Dynamic Programming with Representative Sets - An
  Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dynamic programming on tree decompositions is a frequently used approach to
solve otherwise intractable problems on instances of small treewidth. In recent
work by Bodlaender et al., it was shown that for many connectivity problems,
there exist algorithms that use time, linear in the number of vertices, and
single exponential in the width of the tree decomposition that is used. The
central idea is that it suffices to compute representative sets, and these can
be computed efficiently with help of Gaussian elimination.
  In this paper, we give an experimental evaluation of this technique for the
Steiner Tree problem. A comparison of the classic dynamic programming algorithm
and the improved dynamic programming algorithm that employs the table reduction
shows that the new approach gives significant improvements on the running time
of the algorithm and the size of the tables computed by the dynamic programming
algorithm, and thus that the rank based approach from Bodlaender et al. does
not only give significant theoretical improvements but also is a viable
approach in a practical setting, and showcases the potential of exploiting the
idea of representative sets for speeding up dynamic programming algorithms.
","[{'version': 'v1', 'created': 'Fri, 31 May 2013 15:17:38 GMT'}]",2013-06-03,"[['Fafianie', 'Stefan', ''], ['Bodlaender', 'Hans L.', ''], ['Nederlof', 'Jesper', '']]","['Steiner tree', 'treewidth', 'dynamic programming', 'representative sets', 'exact algorithms', 'rank based approach', 'Gaussian elimination']"
17947,1504.04750,"Dilek K\""u\c{c}\""uk","Dilek K\""u\c{c}\""uk and Tolga \.Inan and Burak Boyrazo\u{g}lu and
  Serkan Buhan and \""Ozg\""ul Salor and I\c{s}{\i}k \c{C}ad{\i}rc{\i} and
  Muammer Ermi\c{s}",PQStream: A Data Stream Architecture for Electrical Power Quality,"Appears in Proceedings of International Workshop on Knowledge
  Discovery from Ubiquitous Data Streams of ECML/PKDD, 2007",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a data stream architecture is presented for electrical power
quality (PQ) which is called PQStream. PQStream is developed to process and
manage time-evolving data coming from the country-wide mobile measurements of
electrical PQ parameters of the Turkish Electricity Transmission System. It is
a full-fledged system with a data measurement module which carries out
processing of continuous PQ data, a stream database which stores the output of
the measurement module, and finally a Graphical User Interface for
retrospective analysis of the PQ data stored in the stream database. The
presented model is deployed and is available to PQ experts, academicians and
researchers of the area. As further studies, data mining methods such as
classification and clustering algorithms will be applied in order to deduce
useful PQ information from this database of PQ data.
","[{'version': 'v1', 'created': 'Sat, 18 Apr 2015 18:25:18 GMT'}]",2015-04-21,"[['Küçük', 'Dilek', ''], ['İnan', 'Tolga', ''], ['Boyrazoğlu', 'Burak', ''], ['Buhan', 'Serkan', ''], ['Salor', 'Özgül', ''], ['Çadırcı', 'Işık', ''], ['Ermiş', 'Muammer', '']]","['Data Streams', 'Data Stream Applications', 'Electrical Power Quality']"
17948,1610.09964,Vinu E V,Vinu E.V and P Sreenivasa Kumar,Ontology Verbalization using Semantic-Refinement,"Currently this paper is under review in the Semantic Web Journal.
  arXiv admin note: text overlap with arXiv:1607.07027",,,,cs.AI cs.CL,http://creativecommons.org/publicdomain/zero/1.0/,"  We propose a rule-based technique to generate redundancy-free NL descriptions
of OWL entities.The existing approaches which address the problem of
verbalizing OWL ontologies generate NL text segments which are close to their
counterpart OWL statements.Some of these approaches also perform grouping and
aggregating of these NL text segments to generate a more fluent and
comprehensive form of the content.Restricting our attention to description of
individuals and concepts, we find that the approach currently followed in the
available tools is that of determining the set of all logical conditions that
are satisfied by the given individual/concept name and translate these
conditions verbatim into corresponding NL descriptions.Human-understandability
of such descriptions is affected by the presence of repetitions and
redundancies, as they have high fidelity to their OWL representation.In the
literature, no efforts had been taken to remove redundancies and repetitions at
the logical-level before generating the NL descriptions of entities and we find
this to be the main reason for lack of readability of the generated
text.Herein, we propose a technique called semantic-refinement(SR) to generate
meaningful and easily-understandable descriptions of individuals and concepts
of a given OWLontology.We identify the combinations of OWL/DL constructs that
lead to repetitive/redundant descriptions and propose a series of refinement
rules to rewrite the conditions that are satisfied by an individual/concept in
a meaning-preserving manner.The reduced set of conditions are then employed for
generating NL descriptions.Our experiments show that, SR leads to significantly
improved descriptions of ontology entities.We also test the effectiveness and
usefulness of the the generated descriptions for the purpose of validating the
ontologies and find that the proposed technique is indeed helpful in the
context.
","[{'version': 'v1', 'created': 'Mon, 31 Oct 2016 15:20:14 GMT'}]",2016-11-01,"[['E.', 'Vinu', 'V'], ['Kumar', 'P Sreenivasa', '']]","['Verbalization', 'Ontologies', 'Rule-based system']"
17949,1610.06251,Cheng Li,"Cheng Li, Xiaoxiao Guo and Qiaozhu Mei",DeepGraph: Graph Structure Predicts Network Growth,,,,,cs.SI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The topological (or graph) structures of real-world networks are known to be
predictive of multiple dynamic properties of the networks. Conventionally, a
graph structure is represented using an adjacency matrix or a set of
hand-crafted structural features. These representations either fail to
highlight local and global properties of the graph or suffer from a severe loss
of structural information. There lacks an effective graph representation, which
hinges the realization of the predictive power of network structures.
  In this study, we propose to learn the represention of a graph, or the
topological structure of a network, through a deep learning model. This
end-to-end prediction model, named DeepGraph, takes the input of the raw
adjacency matrix of a real-world network and outputs a prediction of the growth
of the network. The adjacency matrix is first represented using a graph
descriptor based on the heat kernel signature, which is then passed through a
multi-column, multi-resolution convolutional neural network. Extensive
experiments on five large collections of real-world networks demonstrate that
the proposed prediction model significantly improves the effectiveness of
existing methods, including linear or nonlinear regressors that use
hand-crafted features, graph kernels, and competing deep learning methods.
","[{'version': 'v1', 'created': 'Thu, 20 Oct 2016 00:16:05 GMT'}]",2016-10-21,"[['Li', 'Cheng', ''], ['Guo', 'Xiaoxiao', ''], ['Mei', 'Qiaozhu', '']]","['Graph Representation', 'Network Growth', 'Deep Learning']"
17950,1208.0645,Zhi-Hua Zhou,Wei Gao and Zhi-Hua Zhou,On the Consistency of AUC Pairwise Optimization,,IJCAI 2015,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  AUC (area under ROC curve) is an important evaluation criterion, which has
been popularly used in many learning tasks such as class-imbalance learning,
cost-sensitive learning, learning to rank, etc. Many learning approaches try to
optimize AUC, while owing to the non-convexity and discontinuousness of AUC,
almost all approaches work with surrogate loss functions. Thus, the consistency
of AUC is crucial; however, it has been almost untouched before. In this paper,
we provide a sufficient condition for the asymptotic consistency of learning
approaches based on surrogate loss functions. Based on this result, we prove
that exponential loss and logistic loss are consistent with AUC, but hinge loss
is inconsistent. Then, we derive the $q$-norm hinge loss and general hinge loss
that are consistent with AUC. We also derive the consistent bounds for
exponential loss and logistic loss, and obtain the consistent bounds for many
surrogate loss functions under the non-noise setting. Further, we disclose an
equivalence between the exponential surrogate loss of AUC and exponential
surrogate loss of accuracy, and one straightforward consequence of such finding
is that AdaBoost and RankBoost are equivalent.
","[{'version': 'v1', 'created': 'Fri, 3 Aug 2012 02:37:44 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Aug 2012 08:35:28 GMT'}, {'version': 'v3', 'created': 'Thu, 13 Sep 2012 07:00:09 GMT'}, {'version': 'v4', 'created': 'Wed, 2 Jul 2014 14:46:59 GMT'}]",2020-07-07,"[['Gao', 'Wei', ''], ['Zhou', 'Zhi-Hua', '']]","['AUC', 'consistency', 'surrogate loss', 'cost-sensitive learning', 'learning to rank', 'RankBoost', 'AdaBoost']"
17951,1111.2824,Carla Ferreira,C. Vaz and C. Ferreira,Towards Automated Verification of Web Services,"Proceedings of the IADIS International Conference on WWW/Internet
  2007",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes the use of model-checking software technology for the
verification of workflows and business processes behaviour based on web
services, namely the use of the SPIN model checker. Since the specification of
a business process behaviour based on web services can be decomposed into
patterns, it is proposed a translation of a well known collection of workflow
patterns into PROMELA, the input specification language of SPIN. The use of
this translation is illustrated with one business process example, which
demonstrates how its translation to a PROMELA model can be useful in the web
service specification and verification.
","[{'version': 'v1', 'created': 'Fri, 11 Nov 2011 19:14:05 GMT'}]",2011-11-14,"[['Vaz', 'C.', ''], ['Ferreira', 'C.', '']]","['Web Services', 'Business Processes', 'Workflow Patterns', 'Formal Verification and Validation', 'SPIN']"
17952,1506.01001,Lucius Meredith,Lucius Gregory Meredith,Linear Types Can Change the Blockchain,,,,,cs.LO,http://creativecommons.org/licenses/by/3.0/,"  We give an interpretation of full classical linear logic, and linear proofs
in terms of operations on the blockchain.
","[{'version': 'v1', 'created': 'Tue, 2 Jun 2015 19:35:08 GMT'}]",2015-06-03,"[['Meredith', 'Lucius Gregory', '']]","['linear logic', 'blockchain', 'types', 'Curry-Howard']"
17953,1802.06203,Petr N. Vabishchevich,Alexander G. Churbanov and Petr N. Vabishchevich,"Numerical solution of boundary value problems for the eikonal equation
  in an anisotropic medium","20 pages, 18 figures",,,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Dirichlet problem is considered for the eikonal equation in an anisotropic
medium. The nonlinear boundary value problem (BVP) formulated in the present
work is the limit of the diffusion-reaction problem with a reaction parameter
tending to infinity. To solve numerically the singularly perturbed
diffusion-reaction problem, monotone approximations are employed. Numerical
examples are presented for a two-dimensional BVP for the eikonal equation in an
anisotropic medium. The standard piecewise-linear finite-element approximation
in space is used in computations.
","[{'version': 'v1', 'created': 'Sat, 17 Feb 2018 07:37:34 GMT'}]",2018-02-20,"[['Churbanov', 'Alexander G.', ''], ['Vabishchevich', 'Petr N.', '']]","['The eikonal equation', 'finite-element method', 'diffusion–reactionequation', 'singularly perturbed BVP', 'monotone approximation']"
17954,1111.1854,Aphirak Jansang,Aphirak Jansang and Anan Phonphoem,Framework Architecture for WLAN Testbed,"5 pages, 6 figures, 3rd Asian International Mobile Computing
  Conference (AMOC 2004), May 26-28, 2004, Thailand pp. 96-100 ISBN:
  974-537-487-3",,,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  There has been a tremendous effort in improving wireless LAN for supporting
the demanding multimedia application. Many new protocols or ideas have been
proposed and proved by using a mathematical model or running a simulation
program. That is satisfactory but these proposed designs might not work in the
real world situation. Testbed is an option to alleviate this gap and present
the opportunity to see the real problem and ensure that the design works. A
framework architecture for building a testbed to test a new concept or design
is presented in this paper. The framework is designed in the modularity style
in such a way that can be easily exchanged or modified. A testbed based on the
framework that implements the polling based mechanism has been created and the
results have shown that the QoS of the real time traffic can be maintained in
the presence of the high non-real time traffic.
","[{'version': 'v1', 'created': 'Tue, 8 Nov 2011 10:22:23 GMT'}]",2011-11-09,"[['Jansang', 'Aphirak', ''], ['Phonphoem', 'Anan', '']]","['Wireless LANs', 'Framework', 'Testbed', 'QoS', 'Multimtedia']"
17955,1603.03022,Salvador Tamarit,"Guillermo Vigueras and Manuel Carro and Salvador Tamarit and Julio
  Mari\~no","Towards Automatic Learning of Heuristics for Mechanical Transformations
  of Procedural Code","Part of the Program Transformation for Programmability in
  Heterogeneous Architectures (PROHA) workshop, Barcelona, Spain, 12th March
  2016, 9 pages, LaTeX",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The current trend in next-generation exascale systems goes towards
integrating a wide range of specialized (co-)processors into traditional
supercomputers. However, the integration of different specialized devices
increases the degree of heterogeneity and the complexity in programming such
type of systems. Due to the efficiency of heterogeneous systems in terms of
Watt and FLOPS per surface unit, opening the access of heterogeneous platforms
to a wider range of users is an important problem to be tackled. In order to
bridge the gap between heterogeneous systems and programmers, in this paper we
propose a machine learning-based approach to learn heuristics for defining
transformation strategies of a program transformation system. Our approach
proposes a novel combination of reinforcement learning and classification
methods to efficiently tackle the problems inherent to this type of systems.
Preliminary results demonstrate the suitability of the approach for easing the
programmability of heterogeneous systems.
","[{'version': 'v1', 'created': 'Wed, 9 Mar 2016 20:32:00 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Mar 2016 02:07:48 GMT'}]",2016-03-11,"[['Vigueras', 'Guillermo', ''], ['Carro', 'Manuel', ''], ['Tamarit', 'Salvador', ''], ['Mariño', 'Julio', '']]","['Program Transformation', 'Machine Learning', 'Heterogeneous Systems']"
17956,1002.1159,Vishal Goyal,Yuval Cohen,"Mining The Successful Binary Combinations: Methodology and A Simple Case
  Study","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 2, January 2010,
  http://ijcsi.org/articles/Mining-The-Successful-Binary-Combinations-Methodology-and-A-Simple-Case-Study.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 2, January 2010,
  http://ijcsi.org/articles/Mining-The-Successful-Binary-Combinations-Methodology-and-A-Simple-Case-Study.php",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The importance of finding the characteristics leading to either a success or
a failure is one of the driving forces of data mining. The various application
areas of finding success/failure factors cover vast variety of areas such as
credit risk evaluation and granting loans, micro array analysis, health factors
and health risk factors, and parameter combination leading to a product
success. This paper presents a new approach for making inferences about
dichotomous data. The objective is to determine rules that lead to a certain
result. The method consists of four phases: in the first phase, the data is
processed into a binary format of a truth table, in the second phase; rules are
found by utilizing an algorithm that minimizes Boolean functions. In the third
phase the rules are checked and filtered. In the fourth phase, simple rules
that involve one to two features are revealed.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 09:07:54 GMT'}]",2010-02-08,"[['Cohen', 'Yuval', '']]","['Data Mining', 'Project Success', 'Rule Extraction', 'Knowledge Acquisition', 'Heuristics', 'Binary Data', 'Type dichotomy']"
17957,1305.7144,Uwe Aickelin,"Uwe Aickelin, Julie Greensmith, Jamie Twycross",Immune System Approaches to Intrusion Detection - A Review (ICARIS),"Proceedings of the 3rd International Conference on Artificial Immune
  Systems (ICARIS), 316-329, 2004",,,,cs.CR cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of artificial immune systems in intrusion detection is an appealing
concept for two reasons. Firstly, the human immune system provides the human
body with a high level of protection from invading pathogens, in a robust,
self-organised and distributed manner. Secondly, current techniques used in
computer security are not able to cope with the dynamic and increasingly
complex nature of computer systems and their security. It is hoped that
biologically inspired approaches in this area, including the use of
immune-based systems will be able to meet this challenge. Here we collate the
algorithms used, the development of the systems and the outcome of their
implementation. It provides an introduction and review of the key developments
within this field, in addition to making suggestions for future research.
","[{'version': 'v1', 'created': 'Thu, 30 May 2013 15:42:00 GMT'}]",2013-05-31,"[['Aickelin', 'Uwe', ''], ['Greensmith', 'Julie', ''], ['Twycross', 'Jamie', '']]","['artificial immune systems', 'intrusion detection systems', 'literature review']"
17958,1309.7340,Jiwei Li,Jiwei Li and Claire Cardie,Early Stage Influenza Detection from Twitter,,,,,cs.SI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Influenza is an acute respiratory illness that occurs virtually every year
and results in substantial disease, death and expense. Detection of Influenza
in its earliest stage would facilitate timely action that could reduce the
spread of the illness. Existing systems such as CDC and EISS which try to
collect diagnosis data, are almost entirely manual, resulting in about two-week
delays for clinical data acquisition. Twitter, a popular microblogging service,
provides us with a perfect source for early-stage flu detection due to its
real- time nature. For example, when a flu breaks out, people that get the flu
may post related tweets which enables the detection of the flu breakout
promptly. In this paper, we investigate the real-time flu detection problem on
Twitter data by proposing Flu Markov Network (Flu-MN): a spatio-temporal
unsupervised Bayesian algorithm based on a 4 phase Markov Network, trying to
identify the flu breakout at the earliest stage. We test our model on real
Twitter datasets from the United States along with baselines in multiple
applications, such as real-time flu breakout detection, future epidemic phase
prediction, or Influenza-like illness (ILI) physician visits. Experimental
results show the robustness and effectiveness of our approach. We build up a
real time flu reporting system based on the proposed approach, and we are
hopeful that it would help government or health organizations in identifying
flu outbreaks and facilitating timely actions to decrease unnecessary
mortality.
","[{'version': 'v1', 'created': 'Fri, 27 Sep 2013 19:47:11 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Oct 2013 18:01:47 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Nov 2013 21:09:39 GMT'}]",2013-11-20,"[['Li', 'Jiwei', ''], ['Cardie', 'Claire', '']]","['twitter', 'event detection', 'influenza detection']"
17959,1510.05263,Yung-Yin Lo,"Yung-Yin Lo, Wanjiun Liao, Cheng-Shang Chang","Temporal Matrix Factorization for Tracking Concept Drift in Individual
  User Preferences",,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The matrix factorization (MF) technique has been widely adopted for solving
the rating prediction problem in recommender systems. The MF technique utilizes
the latent factor model to obtain static user preferences (user latent vectors)
and item characteristics (item latent vectors) based on historical rating data.
However, in the real world user preferences are not static but full of
dynamics. Though there are several previous works that addressed this time
varying issue of user preferences, it seems (to the best of our knowledge) that
none of them is specifically designed for tracking concept drift in individual
user preferences. Motivated by this, we develop a Temporal Matrix Factorization
approach (TMF) for tracking concept drift in each individual user latent
vector. There are two key innovative steps in our approach: (i) we develop a
modified stochastic gradient descent method to learn an individual user latent
vector at each time step, and (ii) by the Lasso regression we learn a linear
model for the transition of the individual user latent vectors. We test our
method on a synthetic dataset and several real datasets. In comparison with the
original MF, our experimental results show that our temporal method is able to
achieve lower root mean square errors (RMSE) for both the synthetic and real
datasets. One interesting finding is that the performance gain in RMSE is
mostly from those users who indeed have concept drift in their user latent
vectors at the time of prediction. In particular, for the synthetic dataset and
the Ciao dataset, there are quite a few users with that property and the
performance gains for these two datasets are roughly 20% and 5%, respectively.
","[{'version': 'v1', 'created': 'Sun, 18 Oct 2015 15:33:41 GMT'}]",2015-10-20,"[['Lo', 'Yung-Yin', ''], ['Liao', 'Wanjiun', ''], ['Chang', 'Cheng-Shang', '']]","['Recommender systems', 'Rating prediction', 'Matrix factorization', 'Temporal dynamics', 'Concept drift']"
17960,1510.08789,Travis Johnston,"Travis Johnston, Boyu Zhang, Adam Liwo, Silvia Crivelli, Michela
  Taufer",In-Situ Data Analysis of Protein Folding Trajectories,"40 pages, 15 figures, this paper is presently in the format request
  of the journal to which it was submitted for publication",,,,cs.CE cs.DC q-bio.BM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The transition from petascale to exascale computers is characterized by
substantial changes in the computer architectures and technologies. The
research community relying on computational simulations is being forced to
revisit the algorithms for data generation and analysis due to various
concerns, such as higher degrees of concurrency, deeper memory hierarchies,
substantial I/O and communication constraints. Simulations today typically save
all data to analyze later. Simulations at the exascale will require us to
analyze data as it is generated and save only what is really needed for
analysis, which must be performed predominately in-situ, i.e., executed
sufficiently fast locally, limiting memory and disk usage, and avoiding the
need to move large data across nodes.
  In this paper, we present a distributed method that enables in-situ data
analysis for large protein folding trajectory datasets. Traditional trajectory
analysis methods currently follow a centralized approach that moves the
trajectory datasets to a centralized node and processes the data only after
simulations have been completed. Our method, on the other hand, captures
conformational information in-situ using local data only while reducing the
storage space needed for the part of the trajectory under consideration. This
method processes the input trajectory data in one pass, breaks from the
centralized approach of traditional analysis, avoids the movement of trajectory
data, and still builds the global knowledge on the formation of individual
$\alpha$-helices or $\beta$-strands as trajectory frames are generated.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2015 17:34:57 GMT'}, {'version': 'v2', 'created': 'Fri, 30 Oct 2015 15:41:25 GMT'}]",2015-11-02,"[['Johnston', 'Travis', ''], ['Zhang', 'Boyu', ''], ['Liwo', 'Adam', ''], ['Crivelli', 'Silvia', ''], ['Taufer', 'Michela', '']]","['exascale computing', 'I/O reduction', 'ensemble protein folding', 'eigenvalues']"
17961,1005.2880,Tirza Routtenberg,Tirza Routtenberg and Joseph Tabrikian,"General Classes of Lower Bounds on the Probability of Error in Multiple
  Hypothesis Testing",submitted to IEEE Trans. on Information Theory,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, two new classes of lower bounds on the probability of error
for $m$-ary hypothesis testing are proposed. Computation of the minimum
probability of error which is attained by the maximum a-posteriori probability
(MAP) criterion is usually not tractable. The new classes are derived using
Holder's inequality and reverse Holder's inequality. The bounds in these
classes provide good prediction of the minimum probability of error in multiple
hypothesis testing. The new classes generalize and extend existing bounds and
their relation to some existing upper bounds is presented. It is shown that the
tightest bounds in these classes asymptotically coincide with the optimum
probability of error provided by the MAP criterion for binary or multiple
hypothesis testing problem. These bounds are compared with other existing lower
bounds in several typical detection and classification problems in terms of
tightness and computational complexity.
","[{'version': 'v1', 'created': 'Mon, 17 May 2010 11:08:50 GMT'}]",2015-03-17,"[['Routtenberg', 'Tirza', ''], ['Tabrikian', 'Joseph', '']]","['maximum a-posteriori probability (MAP)', 'Ziv-Zakai lower bound (ZZLB)', 'detection', 'lower bounds', 'hypothesis']"
17962,1002.1167,Vishal Goyal,"A. K. Ojha, A. K. Das","Geometric Programming Problem with Co-Efficients and Exponents
  Associated with Binary Numbers","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 2, January 2010,
  http://ijcsi.org/articles/Geometric-Programming-Problem-with-Co-Efficients-and-Exponents-Associated-with-Binary-Numbers.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 2, January 2010,
  http://ijcsi.org/articles/Geometric-Programming-Problem-with-Co-Efficients-and-Exponents-Associated-with-Binary-Numbers.php",,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Geometric programming (GP) provides a power tool for solving a variety of
optimization problems. In the real world, many applications of geometric
programming (GP) are engineering design problems in which some of the problem
parameters are estimating of actual values. This paper develops a solution
procedure to solve nonlinear programming problems using GP technique by
splitting the cost coefficients, constraint coefficients and exponents with the
help of binary numbers. The equivalent mathematical programming problems are
formulated to find their corresponding value of the objective function based on
the duality theorem. The ability of calculating the cost coefficients,
constraint coefficients and exponents developed in this paper might help lead
to more realistic modeling efforts in engineering design areas. Standard
nonlinear programming software has been used to solve the proposed optimization
problem. Two numerical examples are presented to illustrate the method.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 09:29:23 GMT'}]",2010-02-08,"[['Ojha', 'A. K.', ''], ['Das', 'A. K.', '']]","['Geometric programming', 'Posynomial', 'Binary']"
17963,1502.04495,Vasile Patrascu,Vasile Patrascu,"A Generalization of Gustafson-Kessel Algorithm Using a New Constraint
  Parameter","Proceedings of the Joint 4th Conference of the European Society for
  Fuzzy Logic and Technology and the 11th Rencontres Francophones sur la
  Logique Floue et ses Applications, pp. 1250-1255, Barcelona, Spain, September
  7-9, 2005",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper one presents a new fuzzy clustering algorithm based on a
dissimilarity function determined by three parameters. This algorithm can be
considered a generalization of the Gustafson-Kessel algorithm for fuzzy
clustering.
","[{'version': 'v1', 'created': 'Mon, 16 Feb 2015 11:09:52 GMT'}]",2015-02-17,"[['Patrascu', 'Vasile', '']]","['fuzzy clustering', 'GustafsonKessel algorithm', 'dissimilarity function', 'cluster density', 'cluster volume']"
17964,1501.00381,Rahul Vaze,Srikanth K. Iyer and Rahul Vaze,Achieving Non-Zero Information Velocity in Wireless Networks,to appear in Annals of Applied Probability,,,,cs.IT math.IT math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In wireless networks, where each node transmits independently of other nodes
in the network (the ALOHA protocol), the expected delay experienced by a packet
until it is successfully received at any other node is known to be infinite for
signal-to-interference-plus-noise-ratio (SINR) model with node locations
distributed according to a Poisson point process. Consequently, the information
velocity, defined as the limit of the ratio of the distance to the destination
and the time taken for a packet to successfully reach the destination over
multiple hops, is zero, as the distance tends to infinity. A nearest neighbor
distance based power control policy is proposed to show that the expected delay
required for a packet to be successfully received at the nearest neighbor can
be made finite. Moreover, the information velocity is also shown to be non-zero
with the proposed power control policy. The condition under which these results
hold does not depend on the intensity of the underlying Poisson point process.
","[{'version': 'v1', 'created': 'Fri, 2 Jan 2015 11:05:50 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Nov 2015 08:39:22 GMT'}]",2015-12-01,"[['Iyer', 'Srikanth K.', ''], ['Vaze', 'Rahul', '']]","['wireless networks', 'SINR graphs', 'expected delay', 'information velocity']"
17965,1606.03550,Peter O'Donnell,Peter O'Donnell and Yasmine Al Ahmadi,"Improving pathology reports using business intelligence techniques: An
  experimental study","ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
  Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/241,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Health professionals use pathology reports to monitor and manage a patient's
health. Typically, pathologists diagnose patients' conditions and produce these
reports which are then used as reference by clinicians and eventually shared
with the patient. Pathology reports are difficult to interpret as the reports
are written using complex medical terminology. As patients only see their
doctors for a limited time, the complexity of report content and the manner in
which the information is presented in the reports may hinder patients'
understanding of their medical condition and prognosis. The objective of this
study was to compare patient comprehension of results from two
pathology-reporting styles: the traditional format in current widespread use
and new style developed using techniques common in business intelligence system
(BI) development. The study found that the reports prepared using a ""BI style""
improve experimental subject's understanding and satisfaction with the reports.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 04:12:55 GMT'}]",2016-06-14,"[[""O'Donnell"", 'Peter', ''], ['Ahmadi', 'Yasmine Al', '']]","['Business intelligence', 'pathology reporting', 'pathology', 'report format']"
17966,1406.4161,Daniele Rotolo,Daniele Rotolo and Loet Leydesdorff,"Matching MEDLINE/PubMed Data with Web of Science (WoS): A Routine in R
  language",,,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a novel routine, namely medlineR, based on R-language, that
enables the user to match data from MEDLINE/PubMed with records indexed in the
ISI Web of Science (WoS) database. The matching allows exploiting the rich and
controlled vocabulary of Medical Subject Headings (MeSH) of MEDLINE/PubMed with
additional fields of WoS. The integration provides data (e.g. citation data,
list of cited reference, full list of the addresses of authors' host
organisations, WoS subject categories) to perform a variety of scientometric
analyses. This brief communication describes medlineR, the methodology on which
it relies, and the steps the user should follow to perform the matching across
the two databases. In order to specify the differences from Leydesdorff and
Opthof (2013), we conclude the brief communication by testing the routine on
the case of the ""Burgada Syndrome"".
","[{'version': 'v1', 'created': 'Mon, 16 Jun 2014 20:27:50 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Jun 2014 16:51:43 GMT'}, {'version': 'v3', 'created': 'Wed, 9 Jul 2014 16:24:23 GMT'}, {'version': 'v4', 'created': 'Thu, 10 Jul 2014 16:14:10 GMT'}]",2014-07-11,"[['Rotolo', 'Daniele', ''], ['Leydesdorff', 'Loet', '']]","['in titles (and abstracts)', 'journals', 'or authors’ names']"
17967,1111.5641,Seifedine Kadry Seifedine Kadry,"Seifedine Kadry, Mohamad Smaili",An Improvement of RC4 Cipher Using Vigenere Cipher,,"International Journal of Computational Intelligence and
  Information Security Vo. 1 No. 3, May 2010",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper develops a new algorithm to improve the security of RC4. Given
that RC4 cipher is widely used in the wireless communication and has some
weaknesses in the security of RC4 cipher, our idea is based on the combination
of the RC4 and the poly alphabetic cipher Vigen\`ere to give a new and more
secure algorithm which we called VRC4. In this technique the plain text is
encrypted using the classic RC4 cipher then re-encrypt the resulted cipher text
using Vigen\`ere cipher to be a more secure cipher text. For simplicity, we
have implemented our new algorithm in Java Script taking into consideration two
factors: improvement of the security and the time complexity. To show the
performance of the new algorithm, we have used the well known network cracking
software KisMac.
","[{'version': 'v1', 'created': 'Wed, 23 Nov 2011 22:36:17 GMT'}]",2011-11-28,"[['Kadry', 'Seifedine', ''], ['Smaili', 'Mohamad', '']]","['RC4', 'Vigenère', 'Ciphering', 'Encrypting', 'Cryptography', 'Secure Information']"
17968,1802.09426,Mayank Chaudhari,"Mayank Chaudhari, Aakash Nelson Mattukoyya",Tone Biased MMR Text Summarization,"4 pages, 4 figures, IJCRT, Feb 2018","Mayank Chaudhari, Aakash Nelson Mattukoyya,Tone Biased MMR Text
  Summarization,IJCRT, Feb 2018",,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Text summarization is an interesting area for researchers to develop new
techniques to provide human like summaries for vast amounts of information.
Summarization techniques tend to focus on providing accurate representation of
content, and often the tone of the content is ignored. Tone of the content sets
a baseline for how a reader perceives the content. As such being able to
generate summary with tone that is appropriate for the reader is important. In
our work we implement Maximal Marginal Relevance [MMR] based multi-document
text summarization and propose a naive model to change tone of the
summarization by setting a bias to specific set of words and restricting other
words in the summarization output. This bias towards a specified set of words
produces a summary whose tone is same as tone of specified words.
","[{'version': 'v1', 'created': 'Mon, 26 Feb 2018 16:12:40 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Feb 2018 10:25:07 GMT'}]",2018-02-28,"[['Chaudhari', 'Mayank', ''], ['Mattukoyya', 'Aakash Nelson', '']]","['text summarization', 'maximal marginal relevance', 'tone bias']"
17969,1107.4153,Cem Tekin,"Cem Tekin, Mingyan Liu",Performance and Convergence of Multi-user Online Learning,,in Proceedings of GAMENETS 2011,,,cs.MA cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of allocating multiple users to a set of wireless
channels in a decentralized manner when the channel quali- ties are
time-varying and unknown to the users, and accessing the same channel by
multiple users leads to reduced quality due to interference. In such a setting
the users not only need to learn the inherent channel quality and at the same
time the best allocations of users to channels so as to maximize the social
welfare. Assuming that the users adopt a certain online learning algorithm, we
investigate under what conditions the socially optimal allocation is
achievable. In particular we examine the effect of different levels of
knowledge the users may have and the amount of communications and cooperation.
The general conclusion is that when the cooperation of users decreases and the
uncertainty about channel payoffs increases it becomes harder to achieve the
socially opti- mal allocation.
","[{'version': 'v1', 'created': 'Thu, 21 Jul 2011 04:15:25 GMT'}]",2016-11-25,"[['Tekin', 'Cem', ''], ['Liu', 'Mingyan', '']]","['multi-user learning', 'multi-armed bandits', 'spectrum sharing', 'congestion games']"
17970,1710.02064,Rachel Kalaimani,"Rachel Kalaimani, Milan Jain, Srinivasan Keshav, Catherine Rosenberg","On the Interaction between Personal Comfort Systems and Centralized HVAC
  Systems in Office Buildings",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most modern HVAC systems suffer from two intrinsic problems. First, inability
to meet diverse comfort requirements of the occupants. Second, heat or cool an
entire zone even when the zone is only partially occupied. Both issues can be
mitigated by using personal comfort systems (PCS) which bridge the comfort gap
between what is provided by a central HVAC system and the personal preferences
of the occupants. In recent work, we have proposed and deployed such a system,
called SPOT.
  We address the question, ""How should an existing HVAC system modify its
operation to benefit the availability of PCS like SPOT?"" For example, energy
consumption could be reduced during sparse occupancy by choosing appropriate
thermal set backs, with the PCS providing the additional offset in thermal
comfort required for each occupant. Our control strategy based on Model
Predictive Control (MPC), employs a bi-linear thermal model, and has two
time-scales to accommodate the physical constraints that limit certain
components of the central HVAC system from frequently changing their set
points.
  We compare the energy consumption and comfort offered by our SPOT-aware HVAC
system with that of a state-of-the-art MPC-based central HVAC system in
multiple settings including different room layouts and partial deployment of
PCS. Numerical evaluations show that our system obtains, in average, 45% (15%)
savings in energy in summer (winter), compared with the benchmark system for
the case of homogeneous comfort requirements. For heterogeneous comfort
requirements, we observe 51% (29%) improvement in comfort in summer (winter) in
addition to significant savings in energy.
","[{'version': 'v1', 'created': 'Thu, 5 Oct 2017 15:07:57 GMT'}]",2017-10-06,"[['Kalaimani', 'Rachel', ''], ['Jain', 'Milan', ''], ['Keshav', 'Srinivasan', ''], ['Rosenberg', 'Catherine', '']]","['Personal comfort systems', 'Model predictive control', 'Multiple time-scales', 'Bi-linear system']"
17971,1705.06202,Duncan Brown,"Derek Weitzel, Brian Bockelman, Duncan A. Brown, Peter Couvares, Frank
  W\""urthwein, Edgar Fajardo Hernandez",Data Access for LIGO on the OSG,"6 pages, 3 figures, submitted to PEARC17",,,,cs.DC astro-ph.IM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During 2015 and 2016, the Laser Interferometer Gravitational-Wave Observatory
(LIGO) conducted a three-month observing campaign. These observations delivered
the first direct detection of gravitational waves from binary black hole
mergers. To search for these signals, the LIGO Scientific Collaboration uses
the PyCBC search pipeline. To deliver science results in a timely manner, LIGO
collaborated with the Open Science Grid (OSG) to distribute the required
computation across a series of dedicated, opportunistic, and allocated
resources. To deliver the petabytes necessary for such a large-scale
computation, our team deployed a distributed data access infrastructure based
on the XRootD server suite and the CernVM File System (CVMFS). This data access
strategy grew from simply accessing remote storage to a POSIX-based interface
underpinned by distributed, secure caches across the OSG.
","[{'version': 'v1', 'created': 'Wed, 17 May 2017 15:14:00 GMT'}]",2017-05-18,"[['Weitzel', 'Derek', ''], ['Bockelman', 'Brian', ''], ['Brown', 'Duncan A.', ''], ['Couvares', 'Peter', ''], ['Würthwein', 'Frank', ''], ['Hernandez', 'Edgar Fajardo', '']]","['LIGO', 'CVMFS', 'OSG', 'distributed data access', 'XRootD', 'caching']"
17972,1712.03578,Tryphon Georgiou,"Yongxin Chen, Tryphon T. Georgiou and Michele Pavon",Steering the distribution of agents in mean-field and cooperative games,"20 pages, 8 figures",,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this work is to pose and solve the problem to guide a
collection of weakly interacting dynamical systems (agents, particles, etc.) to
a specified terminal distribution. The framework is that of mean-field and of
cooperative games. A terminal cost is used to accomplish the task; we establish
that the map between terminal costs and terminal probability distributions is
onto. Our approach relies on and extends the theory of optimal mass transport
and its generalizations.
","[{'version': 'v1', 'created': 'Sun, 10 Dec 2017 19:41:24 GMT'}]",2017-12-12,"[['Chen', 'Yongxin', ''], ['Georgiou', 'Tryphon T.', ''], ['Pavon', 'Michele', '']]","['Mean-field games', 'linear stochastic systems', 'weakly interacting particle system', 'McKean-Vlasov dynamics', 'optimal control']"
17973,1108.0786,Kristina Pickl,"Kristina Pickl and Jan G\""otz and Klaus Iglberger and Jayant Pande and
  Klaus Mecke and Ana-Suncana Smith and Ulrich R\""ude","All good things come in threes - Three beads learn to swim with lattice
  Boltzmann and a rigid body solver",,,,,cs.CE cond-mat.soft physics.flu-dyn,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We simulate the self-propulsion of devices in a fluid in the regime of low
Reynolds numbers. Each device consists of three bodies (spheres or capsules)
connected with two damped harmonic springs. Sinusoidal driving forces compress
the springs which are resolved within a rigid body physics engine. The latter
is consistently coupled to a 3D lattice Boltzmann framework for the fluid
dynamics. In simulations of three-sphere devices, we find that the propulsion
velocity agrees well with theoretical predictions. In simulations where some or
all spheres are replaced by capsules, we find that the asymmetry of the design
strongly affects the propelling efficiency.
","[{'version': 'v1', 'created': 'Wed, 3 Aug 2011 08:42:47 GMT'}]",2011-08-20,"[['Pickl', 'Kristina', ''], ['Götz', 'Jan', ''], ['Iglberger', 'Klaus', ''], ['Pande', 'Jayant', ''], ['Mecke', 'Klaus', ''], ['Smith', 'Ana-Suncana', ''], ['Rüde', 'Ulrich', '']]","['Stokes flow', 'self-propelled microorganism', 'lattice Boltzmannmethod', 'numerical simulation']"
17974,1712.03297,Ke Chen,Ke Chen and Adrian Dumitrescu,On the Longest Spanning Tree with Neighborhoods,"12 pages, 4 figures. Section 2 is split into three subsections; more
  technical details are provided in section 3",,,,cs.CG math.MG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study a maximization problem for geometric network design. Given a set of
$n$ compact neighborhoods in $\mathbb{R}^d$, select a point in each
neighborhood, so that the longest spanning tree on these points (as vertices)
has maximum length. Here we give an approximation algorithm with ratio $0.511$,
which represents the first, albeit small, improvement beyond $1/2$. While we
suspect that the problem is NP-hard already in the plane, this issue remains
open.
","[{'version': 'v1', 'created': 'Fri, 8 Dec 2017 22:24:22 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Apr 2020 02:38:40 GMT'}]",2020-04-30,"[['Chen', 'Ke', ''], ['Dumitrescu', 'Adrian', '']]","['Maximum (longest) spanning tree', 'neighborhood', 'geometric network', 'metricproblem', 'approximation algorithm']"
17975,1209.5853,Yi Sun,Yi Sun and Daan Wierstra and Tom Schaul and Juergen Schmidhuber,Efficient Natural Evolution Strategies,Puslished in GECCO'2009,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efficient Natural Evolution Strategies (eNES) is a novel alternative to
conventional evolutionary algorithms, using the natural gradient to adapt the
mutation distribution. Unlike previous methods based on natural gradients, eNES
uses a fast algorithm to calculate the inverse of the exact Fisher information
matrix, thus increasing both robustness and performance of its evolution
gradient estimation, even in higher dimensions. Additional novel aspects of
eNES include optimal fitness baselines and importance mixing (a procedure for
updating the population with very few fitness evaluations). The algorithm
yields competitive results on both unimodal and multimodal benchmarks.
","[{'version': 'v1', 'created': 'Wed, 26 Sep 2012 07:42:06 GMT'}]",2012-09-27,"[['Sun', 'Yi', ''], ['Wierstra', 'Daan', ''], ['Schaul', 'Tom', ''], ['Schmidhuber', 'Juergen', '']]","['evolution strategies', 'natural gradient', 'optimization']"
17976,1004.1239,Rdv Ijcsis,"Saleem Basha, Dhavachelvan Ponnurangam",Analysis of Empirical Software Effort Estimation Models,"IEEE Publication format, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","IJCSIS, Vol. 7 No. 3, March 2010",,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Reliable effort estimation remains an ongoing challenge to software
engineers. Accurate effort estimation is the state of art of software
engineering, effort estimation of software is the preliminary phase between the
client and the business enterprise. The relationship between the client and the
business enterprise begins with the estimation of the software. The credibility
of the client to the business enterprise increases with the accurate
estimation. Effort estimation often requires generalizing from a small number
of historical projects. Generalization from such limited experience is an
inherently under constrained problem. Accurate estimation is a complex process
because it can be visualized as software effort prediction, as the term
indicates prediction never becomes an actual. This work follows the basics of
the empirical software effort estimation models. The goal of this paper is to
study the empirical software effort estimation. The primary conclusion is that
no single technique is best for all situations, and that a careful comparison
of the results of several approaches is most likely to produce realistic
estimates.
","[{'version': 'v1', 'created': 'Thu, 8 Apr 2010 03:58:30 GMT'}]",2010-04-09,"[['Basha', 'Saleem', ''], ['Ponnurangam', 'Dhavachelvan', '']]","['Software Estimation Models', 'Conte’s Criteria', 'Wilcoxon Signed-Rank Test']"
17977,1605.00129,Xinyu Lin,"Xinyu Lin, Ce Zhu, Qian Zhang, Yipeng Liu","3D Keypoint Detection Based on Deep Neural Network with Sparse
  Autoencoder","13 pages, 6 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Researchers have proposed various methods to extract 3D keypoints from the
surface of 3D mesh models over the last decades, but most of them are based on
geometric methods, which lack enough flexibility to meet the requirements for
various applications. In this paper, we propose a new method on the basis of
deep learning by formulating the 3D keypoint detection as a regression problem
using deep neural network (DNN) with sparse autoencoder (SAE) as our regression
model. Both local information and global information of a 3D mesh model in
multi-scale space are fully utilized to detect whether a vertex is a keypoint
or not. SAE can effectively extract the internal structure of these two kinds
of information and formulate high-level features for them, which is beneficial
to the regression model. Three SAEs are used to formulate the hidden layers of
the DNN and then a logistic regression layer is trained to process the
high-level features produced in the third SAE. Numerical experiments show that
the proposed DNN based 3D keypoint detection algorithm outperforms current five
state-of-the-art methods for various 3D mesh models.
","[{'version': 'v1', 'created': 'Sat, 30 Apr 2016 15:47:28 GMT'}]",2016-05-03,"[['Lin', 'Xinyu', ''], ['Zhu', 'Ce', ''], ['Zhang', 'Qian', ''], ['Liu', 'Yipeng', '']]","['3D computer vision', '3D keypoint detection', 'deep neural network', 'sparse autoencoder']"
17978,1701.01232,Dinusha Vatsalan,"Dinusha Vatsalan, Peter Christen, and Erhard Rahm","Scalable Multi-Database Privacy-Preserving Record Linkage using Counting
  Bloom Filters","This is an extended version of an article published in IEEE ICDM
  International Workshop on Privacy and Discrimination in Data Mining (PDDM)
  2016 - Scalable privacy-preserving linking of multiple databases using
  counting Bloom filters",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Privacy-preserving record linkage (PPRL) aims at integrating sensitive
information from multiple disparate databases of different organizations. PPRL
approaches are increasingly required in real-world application areas such as
healthcare, national security, and business. Previous approaches have mostly
focused on linking only two databases as well as the use of a dedicated linkage
unit. Scaling PPRL to more databases (multi-party PPRL) is an open challenge
since privacy threats as well as the computation and communication costs for
record linkage increase significantly with the number of databases. We thus
propose the use of a new encoding method of sensitive data based on Counting
Bloom Filters (CBF) to improve privacy for multi-party PPRL. We also
investigate optimizations to reduce communication and computation costs for
CBF-based multi-party PPRL with and without the use of a dedicated linkage
unit. Empirical evaluations conducted with real datasets show the viability of
the proposed approaches and demonstrate their scalability, linkage quality, and
privacy protection.
","[{'version': 'v1', 'created': 'Thu, 5 Jan 2017 07:57:55 GMT'}]",2017-01-06,"[['Vatsalan', 'Dinusha', ''], ['Christen', 'Peter', ''], ['Rahm', 'Erhard', '']]","['Record linkage', 'similarity', 'privacy', 'multi-party', 'communication patterns', 'secure summation']"
17979,1605.00474,Oliver Woizekowski,Oliver Woizekowski and Ron van der Meyden,On Reductions from Multi-Domain Noninterference to the Two-Level Case,"changed title, abstract; reordered introduction; added some
  clarifying figures; merged two main results into one",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The literature on information flow security with respect to transitive
policies has been concentrated largely on the case of policies with two
security domains, High and Low, because of a presumption that more general
policies can be reduced to this two-domain case. The details of the reduction
have not been the subject of careful study, however. Many works in the
literature use a reduction based on a quantification over ""Low-down""
partitionings of domains into those below and those not below a given domain in
the information flow order. A few use ""High-up"" partitionings of domains into
those above and those not above a given domain. Our paper argues that more
general ""cut"" partitionings are also appropriate, and studies the relationships
between the resulting multi-domain notions of security when the basic notion
for the two-domain case to which we reduce is either Nondeducibility on Inputs
or Generalized Noninterference. The Low-down reduction is shown to be weaker
than the others, and while the High-up reduction is sometimes equivalent to the
cut reduction, both it and the Low-down reduction may have an undesirable
property of non-monotonicity with respect to a natural ordering on policies.
These results suggest that the cut-based partitioning yields a more robust
general approach for reduction to the two-domain case.
","[{'version': 'v1', 'created': 'Mon, 2 May 2016 13:29:57 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Jul 2016 12:55:41 GMT'}]",2016-07-12,"[['Woizekowski', 'Oliver', ''], ['van der Meyden', 'Ron', '']]","['Noninterference', 'nondeterminism', 'information flow', 'covertchannels', 'policies']"
17980,1504.01987,Aravind Sesagiri Raamkumar,"Aravind Sesagiri Raamkumar, Muthu Kumaar Thangavelu, Sudarsan
  Kaleeswaran amd Christopher S.G. Khoo","Designing a Linked Data Migrational Framework for Singapore Government
  Datasets","23 pages, 5 figures",,,,cs.CY cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The subject area of this report is Linked Data and its application to the
Government domain. Linked Data is an alternative method of data representation
that aims to interlink data from varied sources through relationships.
Governments around the world have started publishing their data in this format
to assist citizens in making better use of public services. This report
provides an eight step migrational framework for converting Singapore
Government data from legacy systems to Linked Data format. The framework
formulation is based on a study of the Singapore data ecosystem with help from
Infocomm Development Authority (iDA) of Singapore. Each step in the migrational
framework has been constructed with objectives, recommendations, best practices
and issues with entry and exit points. This work builds on the existing Linked
Data literature, implementations in other countries and cookbooks provided by
Linked Data researchers. iDA can use this report to gain an understanding of
the effort and work involved in the implementation of Linked Data system on top
of their legacy systems. The framework can be evaluated by building a Proof of
Concept (POC) application.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2015 14:34:41 GMT'}]",2015-04-09,"[['Raamkumar', 'Aravind Sesagiri', ''], ['Thangavelu', 'Muthu Kumaar', ''], ['Khoo', 'Sudarsan Kaleeswaran amd Christopher S. G.', '']]","['Linked Data', 'Open Data', 'Linked Open Government Data', 'Data Migration Framework']"
17981,1208.3859,Nishant Doshi mr.,"Vishal Vadgama, Bhavin Tanti, Chirag Modi, Nishant Doshi",A novel approach for e-payment using virtual password system,"http://airccse.org/journal/ijcis/papers/1111ijcis01.pdf, 2012",,,,cs.CR,http://creativecommons.org/licenses/publicdomain/,"  In today's world of E-Commerce everything comes online like Music, E-Books,
Shopping all most everything is online. If you are using some service or buying
things online then you have to pay for that. For that you have to do Net
Banking or you have to use Credit card which will do online payment for you. In
today's environment when everything is online, the service you are using for
E-Payment must be secure and you must protect your banking information like
debit card or credit card information from possible threat of hacking. There
were lots way to threat like Key logger, Forgery Detection, Phishing, Shoulder
surfing. Therefore, we reveal our actual information of Bank and Credit Card
then there will be a chance to lose data and same credit card and hackers can
use banking information for malicious purpose. In this paper we discuss
available E-Payment protocols, examine its advantages and delimitation's and
shows that there are steel needs to design a more secure E-Payment protocol.
The suggested protocol is based on using hash function and using dynamic or
virtual password, which protects your banking or credit card information from
possible threat of hacking when doing online transactions.
","[{'version': 'v1', 'created': 'Sun, 19 Aug 2012 16:17:53 GMT'}]",2012-08-21,"[['Vadgama', 'Vishal', ''], ['Tanti', 'Bhavin', ''], ['Modi', 'Chirag', ''], ['Doshi', 'Nishant', '']]","['E-cash', 'e-payment', 'virtual password']"
17982,1307.7089,Guohui Lin,"Weitian Tong, Zhi-Zhong Chen, Lusheng Wang, Yinfeng Xu, Jiuping Xu,
  Randy Goebel, Guohui Lin",An approximation algorithm for the Bandpass-2 problem,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The general Bandpass-$B$ problem is NP-hard and can be approximated by a
reduction into the weighted $B$-set packing problem, with a worst case
performance ratio of $O(B^2)$. When $B = 2$, a maximum weight matching gives a
2-approximation to the problem. In this paper, we call the Bandpass-2 problem
simply the Bandpass problem. The Bandpass problem can be viewed as a variation
of the maximum traveling salesman problem, in which the edge weights are
dynamic rather than given at the front. We present a ${426}{227}$-approximation
algorithm for the problem. Such an improved approximation is built on an
intrinsic structural property proven for the optimal solution and several novel
schemes to partition a $b$-matching into desired matchings.
","[{'version': 'v1', 'created': 'Fri, 26 Jul 2013 16:46:04 GMT'}]",2013-07-29,"[['Tong', 'Weitian', ''], ['Chen', 'Zhi-Zhong', ''], ['Wang', 'Lusheng', ''], ['Xu', 'Yinfeng', ''], ['Xu', 'Jiuping', ''], ['Goebel', 'Randy', ''], ['Lin', 'Guohui', '']]","['The Bandpass problem', 'maximum weight b-matching', 'acyclic 2-matching', 'approximation algorithm', 'worst case performance ratio']"
17983,0803.4308,Vandy Berten,"Vandy Berten, Chi-Ju Chang, Tei-Wei Kuo",Discrete Frequency Selection of Frame-Based Stochastic Real-Time Tasks,10 pages,,,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Energy-efficient real-time task scheduling has been actively explored in the
past decade. Different from the past work, this paper considers schedulability
conditions for stochastic real-time tasks. A schedulability condition is first
presented for frame-based stochastic real-time tasks, and several algorithms
are also examined to check the schedulability of a given strategy. An approach
is then proposed based on the schedulability condition to adapt a
continuous-speed-based method to a discrete-speed system. The approach is able
to stay as close as possible to the continuous-speed-based method, but still
guaranteeing the schedulability. It is shown by simulations that the energy
saving can be more than 20% for some system configurations
","[{'version': 'v1', 'created': 'Sun, 30 Mar 2008 09:26:38 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Apr 2008 07:55:38 GMT'}]",2008-04-07,"[['Berten', 'Vandy', ''], ['Chang', 'Chi-Ju', ''], ['Kuo', 'Tei-Wei', '']]","['Stochastic low-power real-time scheduling', 'frame-based systems', 'schedulability conditions']"
17984,1604.06650,Denis Gordeev,Rodmonga Potapova and Denis Gordeev,Detecting state of aggression in sentences using CNN,submitted for SPECOM-2016,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article we study verbal expression of aggression and its detection
using machine learning and neural networks methods. We test our results using
our corpora of messages from anonymous imageboards. We also compare Random
forest classifier with convolutional neural network for ""Movie reviews with one
sentence per review"" corpus.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2016 13:33:08 GMT'}]",2016-04-25,"[['Potapova', 'Rodmonga', ''], ['Gordeev', 'Denis', '']]","['word2vec', 'CNN', 'Random forest', 'verbal aggression', 'sentiment analysis', 'imageboards']"
17985,1003.5042,Ravindranath Chowdary C,C Ravindranath Chowdary,Local Popularity based Page Link Analysis,,,,,cs.IR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper we introduce the concept of dynamic link pages. A web site/page
contains a number of links to other pages. All the links are not equally
important. Few links are more frequently visited and few rarely visited. In
this scenario, identifying the frequently used links and placing them in the
top left corner of the page will increase the user's satisfaction. This process
will reduce the time spent by a visitor on the page, as most of the times, the
popular links are presented in the visible part of the screen itself. Also, a
site can be indexed based on the popular links in that page. This will increase
the efficiency of the retrieval system. We presented a model to display the
popular links, and also proposed a method to increase the quality of retrieval
system.
","[{'version': 'v1', 'created': 'Fri, 26 Mar 2010 05:51:30 GMT'}]",2010-03-29,"[['Chowdary', 'C Ravindranath', '']]","['Link Analysis', 'Efficient Retrieval', 'Re-ranking the Pages', 'Increasing User Satisfaction']"
17986,1209.5598,Fan Min,Fan Min,Granular association rules on two universes with four measures,33 pages,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Relational association rules reveal patterns hide in multiple tables.
Existing rules are usually evaluated through two measures, namely support and
confidence. However, these two measures may not be enough to describe the
strength of a rule. In this paper, we introduce granular association rules with
four measures to reveal connections between granules in two universes, and
propose three algorithms for rule mining. An example of such a rule might be
""40% men like at least 30% kinds of alcohol; 45% customers are men and 6%
products are alcohol."" Here 45%, 6%, 40%, and 30% are the source coverage, the
target coverage, the source confidence, and the target confidence,
respectively. With these measures, our rules are semantically richer than
existing ones. Three subtypes of rules are obtained through considering special
requirements on the source/target confidence. Then we define a rule mining
problem, and design a sandwich algorithm with different rule checking
approaches for different subtypes. Experiments on a real world dataset show
that the approaches dedicated to three subtypes are 2-3 orders of magnitudes
faster than the one for the general case. A forward algorithm and a backward
algorithm for one particular subtype can speed up the mining process further.
This work opens a new research trend concerning relational association rule
mining, granular computing and rough sets.
","[{'version': 'v1', 'created': 'Tue, 25 Sep 2012 13:13:11 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Feb 2013 02:24:12 GMT'}, {'version': 'v3', 'created': 'Thu, 28 Jan 2016 02:23:32 GMT'}]",2016-01-29,"[['Min', 'Fan', '']]","['Complete match', 'granule', 'granular computing', 'measure', 'partialmatch', 'relational association rule']"
17987,1412.4053,Neil Toronto,Neil Toronto and Jay McCarthy and David Van Horn,Running Probabilistic Programs Backwards,"26 pages, ESOP 2015 (to appear)",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many probabilistic programming languages allow programs to be run under
constraints in order to carry out Bayesian inference. Running programs under
constraints could enable other uses such as rare event simulation and
probabilistic verification---except that all such probabilistic languages are
necessarily limited because they are defined or implemented in terms of an
impoverished theory of probability. Measure-theoretic probability provides a
more general foundation, but its generality makes finding computational content
difficult.
  We develop a measure-theoretic semantics for a first-order probabilistic
language with recursion, which interprets programs as functions that compute
preimages. Preimage functions are generally uncomputable, so we derive an
abstract semantics. We implement the abstract semantics and use the
implementation to carry out Bayesian inference, stochastic ray tracing (a rare
event simulation), and probabilistic verification of floating-point error
bounds.
","[{'version': 'v1', 'created': 'Fri, 12 Dec 2014 16:59:14 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Jan 2015 15:30:58 GMT'}]",2015-01-19,"[['Toronto', 'Neil', ''], ['McCarthy', 'Jay', ''], ['Van Horn', 'David', '']]","['Probability', 'Semantics', 'Domain-Specific Languages']"
17988,1605.02033,Ramkumar  Lakshminarayanan,Ramkumar Lakshminarayanan and Balaji Dhanasekaran and Ben George Ephre,A Study on Features and Limitations of On-line C Compilers,,"International Journal of Computer Applications 0975 8887 Volume
  125 No.9, September 2015",,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Compilers are used to run programs that are written in a range of designs
from text to executable formats. With the advent of the internet, studies
related to the development of cloud based compilers are being carried out.
There is a considerable increase of on-line compilers enabling on-line
compilation of user programs without any mandate to. This study is specific to
on-line C compilers to investigate the correctness, issues and limitations.
","[{'version': 'v1', 'created': 'Sat, 30 Apr 2016 09:41:07 GMT'}]",2016-05-09,"[['Lakshminarayanan', 'Ramkumar', ''], ['Dhanasekaran', 'Balaji', ''], ['Ephre', 'Ben George', '']]","['C Program', 'Cloud Compiler', 'Compiler Performance', 'Information and Communication Technology', 'Online']"
17989,0805.0849,Michael Hilker,Michael Hilker and Christoph Schommer,SANA - Network Protection through artificial Immunity,5 pages,"Proceedings of the 2nd International Workshop on Theory of
  Computer Viruses (TCV 2007), May 2007, Nancy, France",,,cs.CR cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current network protection systems use a collection of intelligent components
- e.g. classifiers or rule-based firewall systems to detect intrusions and
anomalies and to secure a network against viruses, worms, or trojans. However,
these network systems rely on individuality and support an architecture with
less collaborative work of the protection components. They give less
administration support for maintenance, but offer a large number of individual
single points of failures - an ideal situation for network attacks to succeed.
In this work, we discuss the required features, the performance, and the
problems of a distributed protection system called SANA. It consists of a
cooperative architecture, it is motivated by the human immune system, where the
components correspond to artificial immune cells that are connected for their
collaborative work. SANA promises a better protection against intruders than
common known protection systems through an adaptive self-management while
keeping the resources efficiently by an intelligent reduction of redundant
tasks. We introduce a library of several novel and common used protection
components and evaluate the performance of SANA by a proof-of-concept
implementation.
","[{'version': 'v1', 'created': 'Wed, 7 May 2008 07:13:32 GMT'}]",2008-05-08,"[['Hilker', 'Michael', ''], ['Schommer', 'Christoph', '']]","['Network Protection', 'Artificial Immune Systems', 'Bio-Inspired Computing', 'Distributed Architectures', 'Information Management']"
17990,1111.0158,Sanaa Elyassami,Sanaa Elyassami and Ali Idri,Applying Fuzzy ID3 Decision Tree for Software Effort Estimation,,"IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 4, No 1, 131-138 (2011)",,,cs.SE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web Effort Estimation is a process of predicting the efforts and cost in
terms of money, schedule and staff for any software project system. Many
estimation models have been proposed over the last three decades and it is
believed that it is a must for the purpose of: Budgeting, risk analysis,
project planning and control, and project improvement investment analysis. In
this paper, we investigate the use of Fuzzy ID3 decision tree for software cost
estimation; it is designed by integrating the principles of ID3 decision tree
and the fuzzy set-theoretic concepts, enabling the model to handle uncertain
and imprecise data when describing the software projects, which can improve
greatly the accuracy of obtained estimates. MMRE and Pred are used as measures
of prediction accuracy for this study. A series of experiments is reported
using two different software projects datasets namely, Tukutuku and COCOMO'81
datasets. The results are compared with those produced by the crisp version of
the ID3 decision tree.
","[{'version': 'v1', 'created': 'Tue, 1 Nov 2011 09:58:08 GMT'}]",2011-11-02,"[['Elyassami', 'Sanaa', ''], ['Idri', 'Ali', '']]","['Software cost estimation', 'Decision Tree', 'Fuzzy ID3', 'Fuzzy Entropy']"
17991,1501.04370,Ru He,"Ru He, Jin Tian, Huaiqing Wu","Structure Learning in Bayesian Networks of Moderate Size by Efficient
  Sampling",51 pages,,,,cs.AI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the Bayesian model averaging approach to learning Bayesian network
structures (DAGs) from data. We develop new algorithms including the first
algorithm that is able to efficiently sample DAGs according to the exact
structure posterior. The DAG samples can then be used to construct estimators
for the posterior of any feature. We theoretically prove good properties of our
estimators and empirically show that our estimators considerably outperform the
estimators from the previous state-of-the-art methods.
","[{'version': 'v1', 'created': 'Mon, 19 Jan 2015 01:32:43 GMT'}]",2015-01-20,"[['He', 'Ru', ''], ['Tian', 'Jin', ''], ['Wu', 'Huaiqing', '']]","['Bayesian Networks', 'Structure Learning', 'Bayesian Model Averaging', 'Sampling']"
17992,1409.3192,Pawe{\l} Pszona,"Michael T. Goodrich, Pawe{\l} Pszona","Two-Phase Bicriterion Search for Finding Fast and Efficient Electric
  Vehicle Routes","11 pages, 5 tables, 10 figures. To appear at ACM SIGSPATIAL 2014",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of finding an electric vehicle route that optimizes both driving
time and energy consumption can be modeled as a bicriterion path problem.
Unfortunately, the problem of finding optimal bicriterion paths is NP-complete.
This paper studies such problems restricted to two-phase paths, which
correspond to a common way people drive electric vehicles, where a driver uses
one driving style (say, minimizing driving time) at the beginning of a route
and another driving style (say, minimizing energy consumption) at the end. We
provide efficient polynomial-time algorithms for finding optimal two-phase
paths in bicriterion networks, and we empirically verify the effectiveness of
these algorithms for finding good electric vehicle driving routes in the road
networks of various U.S. states. In addition, we show how to incorporate
charging stations into these algorithms, in spite of the computational
challenges introduced by the negative energy consumption of such network
vertices.
","[{'version': 'v1', 'created': 'Wed, 10 Sep 2014 19:03:16 GMT'}]",2014-09-11,"[['Goodrich', 'Michael T.', ''], ['Pszona', 'Paweł', '']]","['road networks', 'electric vehicles', 'shortest paths', 'bicriterion paths', 'NP-complete']"
17993,1602.07827,Mayssam Mohammadi Nevisi,Pavol Hell and Mayssam Mohammadi Nevisi,Minimum Cost Homomorphisms with Constrained Costs,,,,,cs.CC math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Minimum cost homomorphism problems can be viewed as a generalization of list
homomorphism problems. They also extend two well-known graph colouring
problems: the minimum colour sum problem and the optimum cost chromatic
partition problem. In both of these problems, the cost function meets an
additional constraint: the cost of using a specific colour is the same for
every vertex of the input graph. We study minimum cost homomorphism problems
with cost functions constrained to have this property. Clearly, when the
standard minimum cost homomorphism problem is polynomial, then the problem with
constrained costs is also polynomial. We expect that the same may hold for the
cases when the standard minimum cost homomorphism problem is NP-complete. We
prove that this is the case for trees $H$: we obtain a dichotomy of minimum
constrained cost homomorphism problems which coincides with the dichotomy of
standard minimum cost homomorphism problems. For general graphs $H$, we prove a
partial dichotomy: the problem is polynomial if $H$ is a proper interval graph
and NP-complete when $H$ is not chordal bipartite.
","[{'version': 'v1', 'created': 'Thu, 25 Feb 2016 07:34:37 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Jun 2016 08:54:02 GMT'}, {'version': 'v3', 'created': 'Mon, 22 Aug 2016 06:47:14 GMT'}]",2016-08-23,"[['Hell', 'Pavol', ''], ['Nevisi', 'Mayssam Mohammadi', '']]","['homomorphisms', 'NP-completeness', 'dichotomy']"
17994,1004.0590,Secretary Aircc Journal,"Natasa Zivic,(University of Siegen, Germany)",Iterative method for improvement of coding and decryption,15Pages,"International Journal of Network Security & Its Applications 1.2
  (2009) 1-15",,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Cryptographic check values (digital signatures, MACs and H-MACs) are useful
only if they are free of errors. For that reason all of errors in cryptographic
check values should be corrected after the transmission over a noisy channel
before their verification is performed. Soft Input Decryption is a method of
combining SISO convolutional decoding and decrypting of cryptographic check
values to improve the correction of errors in themselves. If Soft Input
Decryption is successful, i.e. all wrong bit of a cryptographic check value are
corrected, these bit are sent as feedback information to the channel decoder
for a next iteration. The bit of the next iteration are corrected by channel
decoding followed by another Soft Input Decryption. Iterative Soft Input
Decryption uses interleaved blocks. If one block can be corrected by Soft Input
Decryption, the decoding of the interleaved block is improved (serial scheme).
If Soft Input Decryption is applied on both blocks and one of the blocks can be
corrected, the corrected block is used for an improved decoding of the other
block (parallel scheme). Both schemes show significant coding gains compared to
convolutional decoding without iterative Soft Input Decryption.
","[{'version': 'v1', 'created': 'Mon, 5 Apr 2010 08:29:52 GMT'}]",2010-07-15,"[['Zivic', 'Natasa', '']]","['Iterations', 'Decryption', 'Soft Input', 'Convolutional Coding', 'Feedback']"
17995,1110.3126,Daniel Hienert,"Daniel Hienert, Benjamin Zapilko, Philipp Schaer and Brigitte Mathiak",Web-Based Multi-View Visualizations for Aggregated Statistics,"To be published in Proceedings of the 5th International Workshop on
  Web APIs and Services Mashups Proceedings (Mashups '11)",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rise of the open data movement a lot of statistical data has been
made publicly available by governments, statistical offices and other
organizations. First efforts to visualize are made by the data providers
themselves. Data aggregators go a step beyond: they collect data from different
open data repositories and make them comparable by providing data sets from
different providers and showing different statistics in the same chart. Another
approach is to visualize two different indicators in a scatter plot or on a
map. The integration of several data sets in one graph can have several
drawbacks: different scales and units are mixed, the graph gets visually
cluttered and one cannot easily distinguish between different indicators. Our
approach marks a combination of (1) the integration of live data from different
data sources, (2) presenting different indicators in coordinated visualizations
and (3) allows adding user visualizations to enrich official statistics with
personal data. Each indicator gets its own visualization, which fits best for
the individual indicator in case of visualization type, scale, unit etc. The
different visualizations are linked, so that related items can easily be
identified by using mouse over effects on data items.
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2011 06:31:26 GMT'}]",2011-10-17,"[['Hienert', 'Daniel', ''], ['Zapilko', 'Benjamin', ''], ['Schaer', 'Philipp', ''], ['Mathiak', 'Brigitte', '']]","['Visual analytics', 'information visualization', 'open data', 'statistics', 'time series', 'coordinated views', 'dashboards']"
17996,1505.04308,Avery Miller,"Christian Glacet, Avery Miller, Andrzej Pelc",Time vs. Information Tradeoffs for Leader Election in Anonymous Trees,,,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The leader election task calls for all nodes of a network to agree on a
single node. If the nodes of the network are anonymous, the task of leader
election is formulated as follows: every node $v$ of the network must output a
simple path, coded as a sequence of port numbers, such that all these paths end
at a common node, the leader. In this paper, we study deterministic leader
election in anonymous trees.
  Our aim is to establish tradeoffs between the allocated time $\tau$ and the
amount of information that has to be given $\textit{a priori}$ to the nodes to
enable leader election in time $\tau$ in all trees for which leader election in
this time is at all possible. Following the framework of $\textit{algorithms
with advice}$, this information (a single binary string) is provided to all
nodes at the start by an oracle knowing the entire tree. The length of this
string is called the $\textit{size of advice}$. For an allocated time $\tau$,
we give upper and lower bounds on the minimum size of advice sufficient to
perform leader election in time $\tau$.
  We consider $n$-node trees of diameter $diam \leq D$. While leader election
in time $diam$ can be performed without any advice, for time $diam-1$ we give
tight upper and lower bounds of $\Theta (\log D)$. For time $diam-2$ we give
tight upper and lower bounds of $\Theta (\log D)$ for even values of $diam$,
and tight upper and lower bounds of $\Theta (\log n)$ for odd values of $diam$.
For the time interval $[\beta \cdot diam, diam-3]$ for constant $\beta >1/2$,
we prove an upper bound of $O(\frac{n\log n}{D})$ and a lower bound of
$\Omega(\frac{n}{D})$, the latter being valid whenever $diam$ is odd or when
the time is at most $diam-4$. Finally, for time $\alpha \cdot diam$ for any
constant $\alpha <1/2$ (except for the case of very small diameters), we give
tight upper and lower bounds of $\Theta (n)$.
","[{'version': 'v1', 'created': 'Sat, 16 May 2015 18:41:40 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Jun 2015 03:45:23 GMT'}]",2015-06-29,"[['Glacet', 'Christian', ''], ['Miller', 'Avery', ''], ['Pelc', 'Andrzej', '']]","['leader election', 'tree', 'advice', 'deterministic distributed algorithm', 'time']"
17997,1605.01010,UshaRani Yelipe,"Yelipe UshaRani, P. Sammulal","A Novel Approach for Imputation of Missing Attribute Values for
  Efficient Mining of Medical Datasets - Class Based Cluster Approach","Journal Published by University of Zulia, Venezuela and Indexed by
  Web of Science and Scopus , H.index-5, SJR 0.11 (2014 Elsevier SJR Report),
  12 Pages","Revista Tecnica de la Facultad de Ingeniera, Vol. 39, No 2, 184 -
  195, 2016",,,cs.IR cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Missing attribute values are quite common in the datasets available in the
literature. Missing values are also possible because all attributes values may
not be recorded and hence unavailable due to several practical reasons. For all
these one must fix missing attribute vales if the analysis has to be done.
Imputation is the first step in analyzing medical datasets. Hence this has
achieved significant contribution from several medical domain researchers.
Several data mining researchers have proposed various methods and approaches to
impute missing values. However very few of them concentrate on dimensionality
reduction. In this paper, we discuss a novel imputation framework for missing
values imputation. Our approach of filling missing values is rooted on class
based clustering approach and essentially aims at medical records
dimensionality reduction. We use these dimensionality records for carrying
prediction and classification analysis. A case study is discussed which shows
how imputation is performed using proposed method.
","[{'version': 'v1', 'created': 'Tue, 3 May 2016 18:18:57 GMT'}]",2016-05-04,"[['UshaRani', 'Yelipe', ''], ['Sammulal', 'P.', '']]","['medical record', 'attribute domain', 'impute', 'classification', 'prediction', 'clustering  1']"
17998,1301.2443,Andreas Behrend,"Richard Tantius, Daniel Speicher, Andreas Behrend","Towards an Application of Update Propagation on Logic Programs
  Representing Java Source Code",,26th Workshop on Logic Programming (WLP 2012),,,cs.SE cs.PL,http://creativecommons.org/licenses/by/3.0/,"  Logic programs are now used as a representation of object-oriented source
code in academic prototypes for about a decade. This representation allows a
clear and concise implementation of analyses of the object-oriented source
code. The full potential of this approach is far from being explored. In this
paper, we report about an application of the well-established theory of update
propagation within logic programs. Given the representation of the
object-oriented code as facts in a logic program, a change to the code
corresponds to an update of these facts. We demonstrate how update propagation
provides a generic way to generate incremental versions of such analyses.
","[{'version': 'v1', 'created': 'Fri, 11 Jan 2013 10:26:48 GMT'}]",2013-01-14,"[['Tantius', 'Richard', ''], ['Speicher', 'Daniel', ''], ['Behrend', 'Andreas', '']]","['logic program', 'update propagation', 'application', 'logic meta programming', 'refactoring impact']"
17999,1209.5407,Alexei Lisitsa,Alexei Lisitsa and Andrei P. Nemytykh,"A Note on Program Specialization. What Can Syntactical Properties of
  Residual Programs Reveal?",,,,,cs.PL cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents two examples of non-traditional using of program
specialization by Turchin's supercompilation method. In both cases we are
interested in syntactical properties of residual programs produced by
supercompilation. In the first example we apply supercompilation to a program
encoding a word equation and as a result we obtain a program representing a
graph describing the solution set of the word equation. The idea of the second
example belongs to Alexandr V. Korlyukov. He considered an interpreter
simulating the dynamic of the well known missionaries-cannibals puzzle.
Supercompilation of the interpreter allows us to solve the puzzle. The
interpreter may also be seen as an encoding of a non-deterministic protocol.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2012 20:14:27 GMT'}]",2012-09-26,"[['Lisitsa', 'Alexei', ''], ['Nemytykh', 'Andrei P.', '']]","['program specialization', 'supercompilation', 'programanalysis', 'program transformation', 'verification']"
18000,1306.3959,Alti Adel Dr,Alti Adel and Roose Phillipe,"A New Approach for Quality Management in Pervasive Computing
  Environments","10 pages, 10 Figures, Oral Presentation in ECSA 2010","International Journal of Computer Science Issues 10, 1 (2013) 1-10",,,cs.SE,http://creativecommons.org/licenses/publicdomain/,"  This paper provides an extension of MDA called Context-aware Quality Model
Driven Architecture (CQ-MDA) which can be used for quality control in pervasive
computing environments. The proposed CQ-MDA approach based on
ContextualArchRQMM (Contextual ARCHitecture Quality Requirement MetaModel),
being an extension to the MDA, allows for considering quality and
resources-awareness while conducting the design process. The contributions of
this paper are a meta-model for architecture quality control of context-aware
applications and a model driven approach to separate architecture concerns from
context and quality concerns and to configure reconfigurable software
architectures of distributed systems. To demonstrate the utility of our
approach, we use a videoconference system.
","[{'version': 'v1', 'created': 'Mon, 17 Jun 2013 19:24:55 GMT'}]",2013-06-18,"[['Adel', 'Alti', ''], ['Phillipe', 'Roose', '']]","['MDA', 'Context', 'Quality Model', 'Dynamic reconfiguration', 'ADL']"
18001,1412.6143,Rayachoti Eswaraiah,Eswaraiah Rayachoti and Sreenivasa Reddy Edara,"Block Based Medical Image Watermarking Technique for Tamper Detection
  and Recovery","10 pages, 6 figures",ijcsi.org/papers/IJCSI-11-5-1-31-40.pdf 2014,,,cs.MM cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel fragile block based medical image
watermarking technique for embedding data of patient into medical image,
verifying the integrity of ROI (Region of Interest), detecting the tampered
blocks inside ROI and recovering original ROI with less size authentication and
recovery data and with simple mathematical calculations. In the proposed
method, the medical image is divided into three regions called ROI, RONI
(Region of Non Interest) and border pixels. Later, authentication data of ROI
and Electronic Patient Record (EPR) are compressed using Run Length Encoding
(RLE) technique and then embedded into ROI. Recovery information of ROI is
embedded inside RONI and information of ROI is embedded inside border pixels.
Results of experiments conducted on several medical images reveal that proposed
method produces high quality watermarked medical images, identifies tampered
areas inside ROI of watermarked medical images and recovers the original ROI.
","[{'version': 'v1', 'created': 'Mon, 17 Nov 2014 16:58:54 GMT'}]",2014-12-22,"[['Rayachoti', 'Eswaraiah', ''], ['Edara', 'Sreenivasa Reddy', '']]","['Watermarking', 'ROI', 'RONI', 'RLE', 'Tamper Detection', 'Recovery']"
18002,0803.2874,Wolfgang Steiner,"Christiane Frougny (LIAFA), Wolfgang Steiner (LIAFA)",Minimal weight expansions in Pisot bases,,,,,cs.DM cs.CR math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For applications to cryptography, it is important to represent numbers with a
small number of non-zero digits (Hamming weight) or with small absolute sum of
digits. The problem of finding representations with minimal weight has been
solved for integer bases, e.g. by the non-adjacent form in base~2. In this
paper, we consider numeration systems with respect to real bases $\beta$ which
are Pisot numbers and prove that the expansions with minimal absolute sum of
digits are recognizable by finite automata. When $\beta$ is the Golden Ratio,
the Tribonacci number or the smallest Pisot number, we determine expansions
with minimal number of digits $\pm1$ and give explicitely the finite automata
recognizing all these expansions. The average weight is lower than for the
non-adjacent form.
","[{'version': 'v1', 'created': 'Wed, 19 Mar 2008 19:55:38 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Mar 2008 16:30:49 GMT'}, {'version': 'v3', 'created': 'Fri, 9 Jan 2009 20:16:31 GMT'}]",2009-01-09,"[['Frougny', 'Christiane', '', 'LIAFA'], ['Steiner', 'Wolfgang', '', 'LIAFA']]","['Minimal weight', 'beta-expansions', 'Pisot numbers', 'Fibonacci numbers', 'automata']"
18003,1603.02558,Francesca Raimondi,"Francesca Raimondi, Pierre Comon, Olivier Michel, Umberto Spagnolini",Multidimensional factorization through helical mapping,"10 pages, 10 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a new perspective on the problem of multidimensional
spectral factorization, through helical mapping: $d$-dimensional ($d$D) data
arrays are vectorized, processed by $1$D cepstral analysis and then remapped
onto the original space. Partial differential equations (PDEs) are the basic
framework to describe the evolution of physical phenomena. We observe that the
minimum phase helical solution asymptotically converges to the $d$D semi-causal
solution, and allows to decouple the two solutions arising from PDEs describing
physical systems. We prove this equivalence in the theoretical framework of
cepstral analysis, and we also illustrate the validity of helical factorization
through a $2$D wave propagation example and a $3$D application to
helioseismology.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2016 15:47:37 GMT'}]",2016-03-09,"[['Raimondi', 'Francesca', ''], ['Comon', 'Pierre', ''], ['Michel', 'Olivier', ''], ['Spagnolini', 'Umberto', '']]","['Multidimensional Filtering', 'Cepstral Analysis', 'Spectral Factorization', 'Blind Deconvolution', 'Minimum Phase', 'Causality']"
18004,1301.5070,Longkun Guo l,"Longkun Guo, Hong Shen and Kewen Liao","Improved Approximation Algorithms for Computing k Disjoint Paths Subject
  to Two Constraints",12 pages,,,,cs.DS cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For a given graph $G$ with positive integral cost and delay on edges,
distinct vertices $s$ and $t$, cost bound $C\in Z^{+}$ and delay bound $D\in
Z^{+}$, the $k$ bi-constraint path ($k$BCP) problem is to compute $k$ disjoint
$st$-paths subject to $C$ and $D$. This problem is known NP-hard, even when
$k=1$ \cite{garey1979computers}. This paper first gives a simple approximation
algorithm with factor-$(2,2)$, i.e. the algorithm computes a solution with
delay and cost bounded by $2*D$ and $2*C$ respectively. Later, a novel improved
approximation algorithm with ratio
$(1+\beta,\,\max\{2,\,1+\ln\frac{1}{\beta}\})$ is developed by constructing
interesting auxiliary graphs and employing the cycle cancellation method. As a
consequence, we can obtain a factor-$(1.369,\,2)$ approximation algorithm by
setting $1+\ln\frac{1}{\beta}=2$ and a factor-$(1.567,\,1.567)$ algorithm by
setting $1+\beta=1+\ln\frac{1}{\beta}$. Besides, by setting $\beta=0$, an
approximation algorithm with ratio $(1,\, O(\ln n))$, i.e. an algorithm with
only a single factor ratio $O(\ln n)$ on cost, can be immediately obtained. To
the best of our knowledge, this is the first non-trivial approximation
algorithm for the $k$BCP problem that strictly obeys the delay constraint.
","[{'version': 'v1', 'created': 'Tue, 22 Jan 2013 04:52:06 GMT'}, {'version': 'v2', 'created': 'Wed, 3 Apr 2013 13:24:04 GMT'}]",2013-04-04,"[['Guo', 'Longkun', ''], ['Shen', 'Hong', ''], ['Liao', 'Kewen', '']]","['k-disjoint bi-constraint path', 'NP-hard', 'bifactor approximation algorithm', 'auxiliary graph', 'cycle cancellation']"
18005,1002.2084,Iftah Gamzu,"Iftah Gamzu, Danny Segev",A Sublogarithmic Approximation for Highway and Tollbooth Pricing,"14 pages, 3 figure",,,,cs.DS cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An instance of the tollbooth problem consists of an undirected network and a
collection of single-minded customers, each of which is interested in
purchasing a fixed path subject to an individual budget constraint. The
objective is to assign a per-unit price to each edge in a way that maximizes
the collective revenue obtained from all customers. The revenue generated by
any customer is equal to the overall price of the edges in her desired path,
when this cost falls within her budget; otherwise, that customer will not
purchase any edge.
  Our main result is a deterministic algorithm for the tollbooth problem on
trees whose approximation ratio is O(log m / log log m), where m denotes the
number of edges in the underlying graph. This finding improves on the currently
best performance guarantees for trees, due to Elbassioni et al. (SAGT '09), as
well as for paths (commonly known as the highway problem), due to Balcan and
Blum (EC '06). An additional interesting consequence is a computational
separation between tollbooth pricing on trees and the original prototype
problem of single-minded unlimited supply pricing, under a plausible hardness
hypothesis due to Demaine et al. (SODA '06).
","[{'version': 'v1', 'created': 'Wed, 10 Feb 2010 12:21:26 GMT'}]",2010-02-11,"[['Gamzu', 'Iftah', ''], ['Segev', 'Danny', '']]","['Pricing', 'approximation algorithms', 'tollbooth problem', 'highway problem', 'trees', 'balanceddecompositions', 'segment guessing', 'randomization']"
18006,1312.4993,Herv\'e Paulino,Herv\'e Paulino and Eduardo Marques,Heterogeneous Programming with Single Operation Multiple Data,"28 pages, Preprint of the article accepted for publication in a
  special issue of Journal of Computer and System Sciences{\dag} dedicated to
  the 14th IEEE International Conference on High Performance Computing and
  Communication (HPCC 2012)",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Heterogeneity is omnipresent in today's commodity computational systems,
which comprise at least one multi-core Central Processing Unit (CPU) and one
Graphics Processing Unit (GPU). Nonetheless, all this computing power is not
being exploited in mainstream computing, as the programming of these systems
entails many details of the underlying architecture and of its distinct
execution models. Current research on parallel programming is addressing these
issues but, still, the systems' heterogeneity is exposed at language level.
This paper proposes a uniform framework, grounded on the Single Operation
Multiple Data model, for the programming of such heterogeneous systems. The
model is declarative, empowering the compiler to generate code for multiple
architectures from the same source. To this extent, we designed a simple
extension of the Java programming language that embodies the model, and
developed a compiler that generates code for both multi-core CPUs and GPUs. A
performance evaluation attests the validity of the approach that, despite being
based on a simple programming model, is able to deliver performance gains on
par with hand-tuned data parallel multi-threaded Java applications.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2013 22:43:59 GMT'}, {'version': 'v2', 'created': 'Sat, 15 Feb 2014 17:27:22 GMT'}]",2014-02-18,"[['Paulino', 'Hervé', ''], ['Marques', 'Eduardo', '']]","['Data Parallelism', 'Single Operation -Multiple Data', 'Multi-cores', 'GPUs']"
18007,1109.0573,Emmanuel Candes,"Emmanuel J. Candes, Yonina Eldar, Thomas Strohmer and Vlad Voroninski",Phase Retrieval via Matrix Completion,,,,,cs.IT math.IT math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper develops a novel framework for phase retrieval, a problem which
arises in X-ray crystallography, diffraction imaging, astronomical imaging and
many other applications. Our approach combines multiple structured
illuminations together with ideas from convex programming to recover the phase
from intensity measurements, typically from the modulus of the diffracted wave.
We demonstrate empirically that any complex-valued object can be recovered from
the knowledge of the magnitude of just a few diffracted patterns by solving a
simple convex optimization problem inspired by the recent literature on matrix
completion. More importantly, we also demonstrate that our noise-aware
algorithms are stable in the sense that the reconstruction degrades gracefully
as the signal-to-noise ratio decreases. Finally, we introduce some theory
showing that one can design very simple structured illumination patterns such
that three diffracted figures uniquely determine the phase of the object we
wish to recover.
","[{'version': 'v1', 'created': 'Fri, 2 Sep 2011 22:52:18 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Sep 2011 07:37:15 GMT'}]",2011-09-21,"[['Candes', 'Emmanuel J.', ''], ['Eldar', 'Yonina', ''], ['Strohmer', 'Thomas', ''], ['Voroninski', 'Vlad', '']]","['Diffraction', 'Fourier transform', 'convex optimization', 'trace-norm minimization']"
18008,1603.02447,Anithadevi Dhanuskodi,D. Anithadevi and K. Perumal,"A hybrid approach based segmentation technique for brain tumor in MRI
  Images","Attended conference for this paper in NCNHCIIS 2015 at Gandhigram
  University. Published in AIRCC February 2016",,,,cs.CV,http://creativecommons.org/publicdomain/zero/1.0/,"  Automatic image segmentation becomes very crucial for tumor detection in
medical image processing.In general, manual and semi automatic segmentation
techniques require more time and knowledge. However these drawbacks had
overcome by automatic segmentation still there needs to develop more
appropriate techniques for medical image segmentation. Therefore, we proposed
hybrid approach based image segmentation using the combined features of region
growing and threshold based segmentation techniques. It is followed by
pre-processing stage to provide an accurate brain tumor extraction by the help
of Magnetic Resonance Imaging (MRI). If the tumor has holes, the region growing
segmentation algorithm cannot reveal but the proposed hybrid segmentation
technique can be achieved and the result as well improved. Hence the result
used to made assessment with the various performance measures as DICE, JACCARD
similarity, accuracy, sensitivity and specificity. These similarity measures
have been extensively used for evaluation with the ground truth of each
processed image and its results are compared and analyzed.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2016 09:50:43 GMT'}]",2016-03-09,"[['Anithadevi', 'D.', ''], ['Perumal', 'K.', '']]","['Image segmentation', 'Hybrid segmentation', 'Region growing Segmentation', 'Threshold segmentation', 'Performance Measures']"
18009,1802.07710,Wenhui Zhang,Wenhui Zhang,Medical Volume Reconstruction Techniques,arXiv admin note: text overlap with arXiv:1206.1148 by other authors,,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Medical visualization is the use of computers to create 3D images from
medical imaging data sets, almost all surgery and cancer treatment in the
developed world relies on it.Volume visualization techniques includes
iso-surface visualization, mesh visualization and point cloud visualization
techniques, these techniques have revolutionized medicine. Much of modern
medicine relies on the 3D imaging that is possible with magnetic resonance
imaging (MRI) scanners, functional magnetic resonance imaging (fMRI)scanners,
positron emission tomography (PET) scanners, ultrasound imaging (US) scanners,
X-Ray scanners, bio-marker microscopy imaging scanners and computed tomography
(CT) scanners, which make 3D images out of 2D slices. The primary goal of this
report is the application-oriented optimization of existing volume rendering
methods providing interactive frame rates. Techniques are presented for
traditional alpha-blending rendering, surface-shaded display, maximum intensity
projection (MIP), and fast previewing with fully interactive parameter control.
Different preprocessing strategies are proposed for interactive iso-surface
rendering and fast previewing, such as the well-known marching cube algorithm.
","[{'version': 'v1', 'created': 'Wed, 21 Feb 2018 18:33:04 GMT'}]",2018-02-22,"[['Zhang', 'Wenhui', '']]","['Volume rendering', 'Iso-surface visualization', 'Alpha-blending rendering', 'Marching cubealgorithm']"
18010,1704.02592,Keigo Kimura,Keigo Kimura and Lu Sun and Mineichi Kudo,MLC Toolbox: A MATLAB/OCTAVE Library for Multi-Label Classification,Instruction pages are now under construction,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-Label Classification toolbox is a MATLAB/OCTAVE library for Multi-Label
Classification (MLC). There exists a few Java libraries for MLC, but no
MATLAB/OCTAVE library that covers various methods. This toolbox offers an
environment for evaluation, comparison and visualization of the MLC results.
One attraction of this toolbox is that it enables us to try many combinations
of feature space dimension reduction, sample clustering, label space dimension
reduction and ensemble, etc.
","[{'version': 'v1', 'created': 'Sun, 9 Apr 2017 12:36:04 GMT'}]",2017-04-11,"[['Kimura', 'Keigo', ''], ['Sun', 'Lu', ''], ['Kudo', 'Mineichi', '']]","['Multi-Label Classification', 'Multi-Label Learning', 'MATLAB/OCTAVE']"
18011,1401.4655,Karel De Vogeleer,"Karel De Vogeleer, Gerard Memmi, Pierre Jouvelot, Fabien Coelho","The Energy/Frequency Convexity Rule: Modeling and Experimental
  Validation on Mobile Devices",,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper provides both theoretical and experimental evidence for the
existence of an Energy/Frequency Convexity Rule, which relates energy
consumption and CPU frequency on mobile devices. We monitored a typical
smartphone running a specific computing-intensive kernel of multiple nested
loops written in C using a high-resolution power gauge. Data gathered during a
week-long acquisition campaign suggest that energy consumed per input element
is strongly correlated with CPU frequency, and, more interestingly, the curve
exhibits a clear minimum over a 0.2 GHz to 1.6 GHz window. We provide and
motivate an analytical model for this behavior, which fits well with the data.
Our work should be of clear interest to researchers focusing on energy usage
and minimization for mobile devices, and provide new insights for optimization
opportunities.
","[{'version': 'v1', 'created': 'Sun, 19 Jan 2014 11:16:00 GMT'}]",2014-01-21,"[['De Vogeleer', 'Karel', ''], ['Memmi', 'Gerard', ''], ['Jouvelot', 'Pierre', ''], ['Coelho', 'Fabien', '']]","['energy consumption and modeling', 'DVFS', 'power consumption', 'execution time modeling', 'smartphone', 'bit-reverse algorithm']"
18012,1403.0153,Utpal Nandi,"Utpal Nandi, Jyotsna Kumar Mandal",Size Adaptive Region Based Huffman Compression Technique,"3 pages, 4 figures, conference",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A loss-less compression technique is proposed which uses a variable length
Region formation technique to divide the input file into a number of variable
length regions. Huffman codes are obtained for entire file after formation of
regions. Symbols of each region are compressed one by one. Comparisons are made
among proposed technique, Region Based Huffman compression technique and
classical Huffman technique. The proposed technique offers better compression
ratio for some files than other two.
","[{'version': 'v1', 'created': 'Sun, 2 Mar 2014 02:44:54 GMT'}]",2014-03-04,"[['Nandi', 'Utpal', ''], ['Mandal', 'Jyotsna Kumar', '']]","['Compression', 'Huffman Tree', 'Frequency Table (FT)', 'Symbol Code Table (SCT)', 'compression ratio', 'region Based Huffman (RBH)']"
18013,1008.3625,Pedro Peris-Lopez,"Mu'awya Naser, Pedro Peris-Lopez, Mohammd Rafie, Jan van der Lubbe",Vulnerability Analysis of PAP for RFID Tags,"18 pages, 4 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we analyze the security of an RFID authentication protocol
proposed by Liu and Bailey [1], called Privacy and Authentication Protocol
(PAP), and show its vulnerabilities and faulty assumptions. PAP is a privacy
and authentication protocol designed for passive tags. The authors claim that
the protocol, being resistant to commonly assumed attacks, requires little
computation and provides privacy protection and authentication. Nevertheless,
we propose two traceability attacks and an impersonation attack, in which the
revealing of secret information (i.e., secret key and static identifier) shared
between the tag and the reader is unnecessary. Moreover, we review all basic
assumptions on which the design of the protocol resides, and show how many of
them are incorrect and are contrary to the common assumptions in RFID systems.
","[{'version': 'v1', 'created': 'Sat, 21 Aug 2010 11:20:33 GMT'}]",2010-08-24,"[['Naser', ""Mu'awya"", ''], ['Peris-Lopez', 'Pedro', ''], ['Rafie', 'Mohammd', ''], ['van der Lubbe', 'Jan', '']]","['RFID', 'authentication', 'privacy', 'cryptanalysis', 'impersonation']"
18014,1205.4233,Yao Li,"Yao Li, Emina Soljanin, Predrag Spasojevic",Three Schemes for Wireless Coded Broadcast to Heterogeneous Users,accepted by Elsevier PhyCom NetCod Special Issue,,,,cs.NI cs.IT math.IT,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We study and compare three coded schemes for single-server wireless broadcast
of multiple description coded content to heterogeneous users. The users (sink
nodes) demand different number of descriptions over links with different packet
loss rates. The three coded schemes are based on the LT codes, growth codes,
and randomized chunked codes. The schemes are compared on the basis of the
total number of transmissions required to deliver the demands of all users,
which we refer to as the server (source) delivery time. We design the degree
distributions of LT codes by solving suitably defined linear optimization
problems, and numerically characterize the achievable delivery time for
different coding schemes. We find that including a systematic phase (uncoded
transmission) is significantly beneficial for scenarios with low demands, and
that coding is necessary for efficiently delivering high demands. Different
demand and error rate scenarios may require very different coding schemes.
Growth codes and chunked codes do not perform as well as optimized LT codes in
the heterogeneous communication scenario.
","[{'version': 'v1', 'created': 'Fri, 18 May 2012 14:02:47 GMT'}]",2012-05-22,"[['Li', 'Yao', ''], ['Soljanin', 'Emina', ''], ['Spasojevic', 'Predrag', '']]","['LT codes', 'chunked codes', 'growth codes', 'wireless broadcast']"
18015,1605.01368,Mehran Javanmardi,"Mehran Javanmardi, Mehdi Sajjadi, Ting Liu and Tolga Tasdizen","Unsupervised Total Variation Loss for Semi-supervised Deep Learning of
  Semantic Segmentation",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a novel unsupervised loss function for learning semantic
segmentation with deep convolutional neural nets (ConvNet) when densely labeled
training images are not available. More specifically, the proposed loss
function penalizes the L1-norm of the gradient of the label probability vector
image , i.e. total variation, produced by the ConvNet. This can be seen as a
regularization term that promotes piecewise smoothness of the label probability
vector image produced by the ConvNet during learning. The unsupervised loss
function is combined with a supervised loss in a semi-supervised setting to
learn ConvNets that can achieve high semantic segmentation accuracy even when
only a tiny percentage of the pixels in the training images are labeled. We
demonstrate significant improvements over the purely supervised setting in the
Weizmann horse, Stanford background and Sift Flow datasets. Furthermore, we
show that using the proposed piecewise smoothness constraint in the learning
phase significantly outperforms post-processing results from a purely
supervised approach with Markov Random Fields (MRF). Finally, we note that the
framework we introduce is general and can be used to learn to label other types
of structures such as curvilinear structures by modifying the unsupervised loss
function accordingly.
","[{'version': 'v1', 'created': 'Wed, 4 May 2016 18:17:25 GMT'}, {'version': 'v2', 'created': 'Tue, 17 May 2016 20:46:35 GMT'}, {'version': 'v3', 'created': 'Tue, 7 Aug 2018 20:21:16 GMT'}]",2018-08-09,"[['Javanmardi', 'Mehran', ''], ['Sajjadi', 'Mehdi', ''], ['Liu', 'Ting', ''], ['Tasdizen', 'Tolga', '']]","['Semantic segmentation', 'Semi-supervised learning', 'Sparse labeling', 'Convolutional neural networks']"
18016,1402.5759,Anne-Kathrin Schmuck,"Anne-Kathrin Schmuck and J\""org Raisch",Asynchronous $l$-Complete Approximations,,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper extends the $l$-complete approximation method developed for time
invariant systems to a larger system class, ensuring that the resulting
approximation can be realized by a finite state machine. To derive the new
abstraction method, called asynchronous $l$-complete approximation, an
asynchronous version of the well-known concepts of state property, memory span
and $l$-completeness is introduced, extending the behavioral systems theory in
a consistent way.
","[{'version': 'v1', 'created': 'Mon, 24 Feb 2014 09:38:51 GMT'}]",2014-02-25,"[['Schmuck', 'Anne-Kathrin', ''], ['Raisch', 'Jörg', '']]","['finite state abstraction', 'l-complete approximations', 'state property', 'behavioral systems theory']"
18017,1207.6025,Craig Valli,Craig Valli and Andrew Woodward,"The 2008 Australian study of remnant data contained on 2nd hand hard
  disks: the saga continues","6th Australian Digital Forensics Conference, 2008",,,,cs.CR,http://creativecommons.org/licenses/publicdomain/,"  This study looked for remnant data on enterprise level hard drives that were
purchased through auctions. The drives were analysed for information, be it
topical or formatted. In the event that drives were formatted, forensic tools
were used to recover this data. This years study revealed a high level of not
simply un-erased drives, but drives which contained information that related to
critical infrastructure providers. That such a small sample size yielded such a
high rate of un-erased drives is of considerable concern, and it may be
necessary for the government to become involved.
","[{'version': 'v1', 'created': 'Wed, 25 Jul 2012 15:28:06 GMT'}]",2012-07-26,"[['Valli', 'Craig', ''], ['Woodward', 'Andrew', '']]","['Hard disks', 'forensics', 'erasure', 'enterprise drives']"
18018,1305.0195,Chantal Cherifi,Chantal Cherifi,Similartity Network For Semantic Web Services Substitution,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web services substitution is one of the most challenging tasks for automating
the composition process of multiple Web services. It aims to improve
performances and to deal efficiently with Web services failures. Many existing
solutions have approached the problem through classification of substitutable
Web services. To go a step further, we propose in this paper a network based
approach where nodes are Web services operations and links join similar
operations. Four similarity measures based on the comparison of input and
output parameters values of Web services operations are presented. A
comparative evaluation of the topological structure of the corresponding
networks is performed on a benchmark of semantically annotated Web services.
Results show that this approach allows a more detailed analysis of
substitutable Web services.
","[{'version': 'v1', 'created': 'Wed, 1 May 2013 15:13:55 GMT'}]",2013-05-02,"[['Cherifi', 'Chantal', '']]","['Semantic Web services', 'Functional similarity', 'Similarity network', 'Substitution']"
18019,1505.04093,Evgeniy Vodolazskiy,M. Schlesinger and E. Vodolazskiy and V. Yakovenko,Frechet similarity of closed polygonal curves,13 pages. arXiv admin note: text overlap with arXiv:1409.4613,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The article analyzes similarity of closed polygonal curves with respect to
the Frechet metric, which is stronger than the well-known Hausdorff metric and
therefore is more appropriate in some applications. An algorithm is described
that determines whether the Frechet distance between two closed polygonal
curves with m and n vertices is less than a given number. The algorithm takes
O(mn) time whereas the previously known algorithms take O(mn log(mn)) time.
","[{'version': 'v1', 'created': 'Fri, 15 May 2015 15:21:52 GMT'}]",2015-05-18,"[['Schlesinger', 'M.', ''], ['Vodolazskiy', 'E.', ''], ['Yakovenko', 'V.', '']]","['computational geometry', 'Fr´echet distance', 'computational complexity']"
18020,1111.0948,Ashwin Rao,"Ashwin Rao (INRIA Sophia Antipolis / INRIA Grenoble Rh\^one-Alpes),
  Yeon-Sup Lim, Chadi Barakat (INRIA Sophia Antipolis / INRIA Grenoble
  Rh\^one-Alpes), Arnaud Legout (INRIA Sophia Antipolis / INRIA Grenoble
  Rh\^one-Alpes), Don Towsley, Walid Dabbous (INRIA Sophia Antipolis / INRIA
  Grenoble Rh\^one-Alpes)",Network Characteristics of Video Streaming Traffic,"This is the author version of the paper accepted as a full paper at
  ACM CoNEXT 2011",,,,cs.NI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Video streaming represents a large fraction of Internet traffic.
Surprisingly, little is known about the network characteristics of this
traffic. In this paper, we study the network characteristics of the two most
popular video streaming services, Netflix and YouTube. We show that the
streaming strategies vary with the type of the application (Web browser or
native mobile application), and the type of container (Silverlight, Flash, or
HTML5) used for video streaming. In particular, we identify three different
streaming strategies that produce traffic patterns from non-ack clocked ON-OFF
cycles to bulk TCP transfer. We then present an analytical model to study the
potential impact of these streaming strategies on the aggregate traffic and
make recommendations accordingly.
","[{'version': 'v1', 'created': 'Thu, 3 Nov 2011 19:02:51 GMT'}]",2011-11-04,"[['Rao', 'Ashwin', '', 'INRIA Sophia Antipolis / INRIA Grenoble Rhône-Alpes'], ['Lim', 'Yeon-Sup', '', 'INRIA Sophia Antipolis / INRIA Grenoble\n  Rhône-Alpes'], ['Barakat', 'Chadi', '', 'INRIA Sophia Antipolis / INRIA Grenoble\n  Rhône-Alpes'], ['Legout', 'Arnaud', '', 'INRIA Sophia Antipolis / INRIA Grenoble\n  Rhône-Alpes'], ['Towsley', 'Don', '', 'INRIA Sophia Antipolis / INRIA\n  Grenoble Rhône-Alpes'], ['Dabbous', 'Walid', '', 'INRIA Sophia Antipolis / INRIA\n  Grenoble Rhône-Alpes']]","['Video streaming1', 'Streaming strategies', 'YouTube', 'Netflix', 'Silverlight', 'HTML5', 'Flash']"
18021,1401.1942,Ankur Sinha PhD,Ankur Sinha and Pekka Malo and Kalyanmoy Deb,Test Problem Construction for Single-Objective Bilevel Optimization,arXiv admin note: text overlap with arXiv:1303.3901,,,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a procedure for designing controlled test problems
for single-objective bilevel optimization. The construction procedure is
flexible and allows its user to control the different complexities that are to
be included in the test problems independently of each other. In addition to
properties that control the difficulty in convergence, the procedure also
allows the user to introduce difficulties caused by interaction of the two
levels. As a companion to the test problem construction framework, the paper
presents a standard test suite of twelve problems, which includes eight
unconstrained and four constrained problems. Most of the problems are scalable
in terms of variables and constraints. To provide baseline results, we have
solved the proposed test problems using a nested bilevel evolutionary
algorithm. The results can be used for comparison, while evaluating the
performance of any other bilevel optimization algorithm. The codes related to
the paper may be accessed from the website \url{http://bilevel.org}.
","[{'version': 'v1', 'created': 'Thu, 9 Jan 2014 10:22:26 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Jun 2014 10:41:13 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Aug 2016 16:28:15 GMT'}]",2016-08-17,"[['Sinha', 'Ankur', ''], ['Malo', 'Pekka', ''], ['Deb', 'Kalyanmoy', '']]","['Bilevel optimization', 'bilevel test-suite', 'test problem construction', 'evolutionaryalgorithm']"
18022,0908.4374,R Doomun,"Ratnesh Kumar Jain, Dr. Suresh Jain, Dr. R. S. Kasana",Visualization of Mined Pattern and Its Human Aspects,"7 pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 4, No. 1 & 2, August 2009, USA",,ISSN 1947 5500,cs.HC cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Researchers got success in mining the Web usage data effectively and
efficiently. But representation of the mined patterns is often not in a form
suitable for direct human consumption. Hence mechanisms and tools that can
represent mined patterns in easily understandable format are utilized.
Different techniques are used for pattern analysis, one of them is
visualization. Visualization can provide valuable assistance for data analysis
and decision making tasks. In the data visualization process, technical
representations of web pages are replaced by user attractive text
interpretations. Experiments with the real world problems showed that the
visualization can significantly increase the quality and usefulness of web log
mining results. However, how decision makers perceive and interact with a
visual representation can strongly influence their understanding of the data as
well as the usefulness of the visual presentation. Human factors therefore
contribute significantly to the visualization process and should play an
important role in the design and evaluation of visualization tools. This
electronic document is a live template. The various components of your paper,
title, text, heads, etc., are already defined on the style sheet, as
illustrated by the portions given in this document.
","[{'version': 'v1', 'created': 'Sun, 30 Aug 2009 05:30:40 GMT'}]",2009-09-01,"[['Jain', 'Ratnesh Kumar', ''], ['Jain', 'Dr. Suresh', ''], ['Kasana', 'Dr. R. S.', '']]","['Web log mining', 'Knowledge representation', 'Visualization', 'Human Aspects']"
18023,1603.03019,Michael Haythorpe,Michael Haythorpe,Reducing the generalised Sudoku problem to the Hamiltonian cycle problem,,,,,cs.DS cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The generalised Sudoku problem with $N$ symbols is known to be NP-complete,
and hence is equivalent to any other NP-complete problem, even for the standard
restricted version where $N$ is a perfect square. In particular, generalised
Sudoku is equivalent to the, classical, Hamiltonian cycle problem. A
constructive algorithm is given that reduces generalised Sudoku to the
Hamiltonian cycle problem, where the resultant instance of Hamiltonian cycle
problem is sparse, and has $O(N^3)$ vertices. The Hamiltonian cycle problem
instance so constructed is a directed graph, and so a (known) conversion to
undirected Hamiltonian cycle problem is also provided so that it can be
submitted to the best heuristics. A simple algorithm for obtaining the valid
Sudoku solution from the Hamiltonian cycle is provided. Techniques to reduce
the size of the resultant graph are also discussed.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2016 06:34:03 GMT'}]",2016-03-10,"[['Haythorpe', 'Michael', '']]","['Sudoku', 'NP-complete', 'Reduction', 'Hamiltonian cycle problem']"
18024,1104.5660,Anissa Lamani,"Sayaka Kamei, Anissa Lamani (MIS), Fukuhito Ooshita, S\'ebastien
  Tixeuil (LIP6)","Asynchronous mobile robot gathering from symmetric configurations
  without global multiplicity detection",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a set of k autonomous robots that are endowed with visibility
sensors (but that are otherwise unable to communicate) and motion actuators.
Those robots must collaborate to reach a sin- gle vertex that is unknown
beforehand, and to remain there hereafter. Previous works on gathering in
ring-shaped networks suggest that there exists a tradeoff between the size of
the set of potential initial configurations, and the power of the sensing
capabilities of the robots (i.e. the larger the initial configuration set, the
most powerful the sensor needs to be). We prove that there is no such trade
off. We propose a gathering protocol for an odd number of robots in a
ring-shaped network that allows symmetric but not periodic configurations as
initial configurations, yet uses only local weak multiplicity detection. Robots
are assumed to be anonymous and oblivious, and the execution model is the
non-atomic CORDA model with asynchronous fair scheduling. Our protocol allows
the largest set of initial configurations (with respect to impossibility
results) yet uses the weakest multiplicity detector to date. The time
complexity of our protocol is O(n2), where n denotes the size of the ring.
Compared to previous work that also uses local weak multiplicity detection, we
do not have the constraint that k < n/2 (here, we simply have 2 < k < n - 3).
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2011 15:20:45 GMT'}]",2011-05-02,"[['Kamei', 'Sayaka', '', 'MIS'], ['Lamani', 'Anissa', '', 'MIS'], ['Ooshita', 'Fukuhito', '', 'LIP6'], ['Tixeuil', 'Sébastien', '', 'LIP6']]","['Gathering', 'Discrete Universe', 'Local Weak Multiplicity Detection', 'Asynchrony', 'Robots']"
18025,1510.02588,Nima Beygi,"Nima Beygi, Maani Beigy, Mehdi Siahi","Design of Fuzzy self-tuning PID controller for pitch control system of
  aircraft autopilot",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A variety of control systems have been proposed for aircraft autopilot
systems. Traditional approaches such as proportional controller and
conventional PID (CPID) controller are widely used. PID controller has a good
static performance especially for linear and time-invariant systems, but a weak
dynamic performance and discouraging function on nonlinear, time-varying, and
uncertain systems. Fuzzy control theory can improve dynamic response in various
conditions of system performance. This paper designs fuzzy self-tuning PID
(FSPID) controller to improve disadvantages of conventional PID in aircraft
autopilots. We apply proposed controller to pitch angle of aircraft then the
abilities of proposed controller will be compared to the conventional PID and
proportional controller. Inner feedback loop acts as oscillation damper in
traditional schemes, but here is removed to compare the capabilities of Fuzzy
self-tuning PID, conventional PID, and proportional controller. Based on the
simulations, both of Conventional and Fuzzy self-tuning PID controllers can
properly damp oscillations in lack of the inner feedback loop, but proportional
controller cannot do. Then short-period approximation is assumed to assess the
function of FSPID and CPID controllers in confront with abrupt and continuous
disturbances, in addition to inappropriate tuning of parameters. Simulation
results of short-period approximation show a better anti-disturbance function
for Fuzzy self-tuning PID compare to the conventional type. Fuzzy self-tuning
PID can tune the PID parameters for achieving the optimal response in view of
speed, overshoot, and steady-state error in conditions of inappropriate tuning
of PID parameters, based on the results of simulation in short-period
approximation, the proposed controller can adaptively improve the system
response by on-line setting of PID parameters.
","[{'version': 'v1', 'created': 'Fri, 9 Oct 2015 08:06:08 GMT'}]",2015-10-12,"[['Beygi', 'Nima', ''], ['Beigy', 'Maani', ''], ['Siahi', 'Mehdi', '']]","['Fuzzy self-tuning PID', 'Intelligent systems', 'Aircraft autopilot', 'Pitch angle', 'Fuzzy control']"
18026,1407.0547,Mark Phillips,"Mark Phillips, Lauren Ko","Understanding Repository Growth at the University of North Texas: A Case
  Study",5 pages,,,,cs.DL,http://creativecommons.org/licenses/by/3.0/,"  Over the past decade the University of North Texas Libraries (UNTL) has
developed a sizable digital library infrastructure for use in carrying out its
core mission to the students, faculty, staff and associated communities of the
university. This repository of content offers countless research possibilities
for end users across the Internet when it is discovered and used in research,
scholarship, entertainment, and lifelong learning. The characteristics of the
repository itself provide insight into the workings of a modern digital library
infrastructure, how it was created, how often it is updated, or how often it is
modified. In that vein, the authors created a dataset comprised of information
extracted from the UNT Libraries' archival repository Coda and analyzed this
dataset in order to demonstrate the value and insights that can be gained from
sharing repository characteristics more broadly. This case study presents the
findings from an analysis of this dataset.
","[{'version': 'v1', 'created': 'Wed, 2 Jul 2014 12:55:49 GMT'}]",2014-07-03,"[['Phillips', 'Mark', ''], ['Ko', 'Lauren', '']]","['Digital preservation dataset', 'digital repository', 'repository metrics', 'repository growth']"
18027,1207.6053,Benjamin Recht,"Gongguo Tang and Badri Narayan Bhaskar and Parikshit Shah and Benjamin
  Recht",Compressed Sensing off the Grid,"47 pages, 16 figures. Modified Section 2.2 on frequency localization
  via convex programming duality. Minor typos corrected",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of estimating the frequency components of a mixture
of s complex sinusoids from a random subset of n regularly spaced samples.
Unlike previous work in compressed sensing, the frequencies are not assumed to
lie on a grid, but can assume any values in the normalized frequency domain
[0,1]. We propose an atomic norm minimization approach to exactly recover the
unobserved samples. We reformulate this atomic norm minimization as an exact
semidefinite program. Even with this continuous dictionary, we show that most
sampling sets of size O(s log s log n) are sufficient to guarantee the exact
frequency estimation with high probability, provided the frequencies are well
separated. Numerical experiments are performed to illustrate the effectiveness
of the proposed method.
","[{'version': 'v1', 'created': 'Wed, 25 Jul 2012 16:53:18 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Jun 2013 17:56:19 GMT'}, {'version': 'v3', 'created': 'Wed, 10 Jul 2013 20:49:16 GMT'}]",2013-07-12,"[['Tang', 'Gongguo', ''], ['Bhaskar', 'Badri Narayan', ''], ['Shah', 'Parikshit', ''], ['Recht', 'Benjamin', '']]","['Atomic norm', 'basis mismatch', 'compressed sensing', 'continuous dictionary', 'linespectral estimation', 'nuclear norm relaxation', 'Prony’s method', 'sparsity']"
18028,1510.07873,Michele Tucci,"Michele Tucci, Alessandro Floriduz, Stefano Riverso and Giancarlo
  Ferrari-Trecate","Kron reduction methods for plug-and-play control of ac islanded
  microgrids with arbitrary topology",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we provide an extension of the scalable algorithm proposed in
(Riverso et al., 2015) for the design of Plug-and-Play (PnP) controllers for AC
Islanded microGrids (ImGs). The method in (Riverso et al., 2015) assumes DGUs
are arranged in a load-connected topology, i.e. loads can appear only at the
output terminals of inverters. For handling totally general interconnections of
DGUs and loads, we describe an approach based on Kron Reduction (KR), a network
reduction method giving an equivalent load-connected model of the original ImG.
However, existing KR approaches can fail in preserving the structure of
transfer functions representing transmission lines. To avoid this drawback, we
introduce an approximate KR algorithm, still capable to represent exactly the
asymptotic periodic behavior of electric signals even if they are unbalanced.
Our results are backed up with simulations illustrating features of the new KR
approach as well as its use for designing PnP controllers in a 21-bus ImG
derived from an IEEE test feeder.
","[{'version': 'v1', 'created': 'Tue, 27 Oct 2015 11:29:50 GMT'}, {'version': 'v2', 'created': 'Thu, 31 Mar 2016 17:12:08 GMT'}]",2016-04-01,"[['Tucci', 'Michele', ''], ['Floriduz', 'Alessandro', ''], ['Riverso', 'Stefano', ''], ['Ferrari-Trecate', 'Giancarlo', '']]","['Kron reduction', 'graph theory', 'islanded microgrid', 'plug-and-play', 'decentralizedcontrol', 'voltage and frequency control']"
18029,1504.01891,Marios Meimaris,"Marios Meimaris, George Papastefanatos, Stratis Viglas, Yannis
  Stavrakas, Christos Pateritsas and Ioannis Anagnostopoulos",A Query Language for Multi-version Data Web Archives,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Data Web refers to the vast and rapidly increasing quantity of
scientific, corporate, government and crowd-sourced data published in the form
of Linked Open Data, which encourages the uniform representation of
heterogeneous data items on the web and the creation of links between them. The
growing availability of open linked datasets has brought forth significant new
challenges regarding their proper preservation and the management of evolving
information within them. In this paper, we focus on the evolution and
preservation challenges related to publishing and preserving evolving linked
data across time. We discuss the main problems regarding their proper modelling
and querying and provide a conceptual model and a query language for modelling
and retrieving evolving data along with changes affecting them. We present in
details the syntax of the query language and demonstrate its functionality over
a real-world use case of evolving linked dataset from the biological domain.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2015 09:53:52 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Sep 2015 14:38:17 GMT'}, {'version': 'v3', 'created': 'Thu, 12 May 2016 16:00:10 GMT'}]",2016-05-13,"[['Meimaris', 'Marios', ''], ['Papastefanatos', 'George', ''], ['Viglas', 'Stratis', ''], ['Stavrakas', 'Yannis', ''], ['Pateritsas', 'Christos', ''], ['Anagnostopoulos', 'Ioannis', '']]","['Data Web', 'Data Evolution', 'Linked Data Preservation', 'Archiving']"
18030,0909.1030,Amir Ben-Amram,Amir M. Ben-Amram,The Euler Path to Static Level-Ancestors,11 pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Suppose that a rooted tree T is given for preprocessing. The Level-Ancestor
Problem is to answer quickly queries of the following form. Given a vertex v
and an integer i > 0, find the i-th vertex on the path from the root to v.
Algorithms that achieve a linear time bound for preprocessing and a constant
time bound for a query have been published by Dietz (1991), Alstrup and Holm
(2000), and Bender and Farach (2002). The first two algorithms address dynamic
versions of the problem; the last addresses the static version only and is the
simplest so far. The purpose of this note is to expose another simple
algorithm, derived from a complicated PRAM algorithm by Berkman and Vishkin
(1990,1994). We further show some easy extensions of its functionality, adding
queries for descendants and level successors as well as ancestors, extensions
for which the formerly known algorithms are less suitable.
","[{'version': 'v1', 'created': 'Sat, 5 Sep 2009 14:15:29 GMT'}]",2009-09-08,"[['Ben-Amram', 'Amir M.', '']]","['algorithms', 'data structures', 'trees']"
18031,1206.3764,Rajib Das,"Rajib Das, Bipul Syam Purkayastha and Prodipto Das",Security Measures for Black Hole Attack in MANET: An Approach,"7 pages, 8 figures, International Journal of Engineering Science and
  Technology (IJEST)","International Journal of Engineering Science and Technology
  (IJEST), Vol. 3 No. 4 Apr 2011, pp. 2832-2838, ISSN: 0975-5462",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Mobile Ad-Hoc Network is a collection of mobile nodes that are dynamically
and arbitrarily located in such a manner that the interconnections between
nodes are capable of changing on continual basis. Due to security
vulnerabilities of the routing protocols, wireless ad-hoc networks are
unprotected to attacks of the malicious nodes. One of these attacks is the
Black Hole Attack. In this paper, we give an algorithmic approach to focus on
analyzing and improving the security of AODV, which is one of the popular
routing protocols for MANET. Our aim is on ensuring the security against Black
hole attack. The proposed solution is capable of detecting & removing Black
hole node(s) in the MANET at the beginning. Also the objective of this paper is
to provide a simulation study that illustrates the effects of Black hole attack
on network performance.
","[{'version': 'v1', 'created': 'Sun, 17 Jun 2012 15:48:27 GMT'}]",2012-06-19,"[['Das', 'Rajib', ''], ['Purkayastha', 'Bipul Syam', ''], ['Das', 'Prodipto', '']]","['Mobile Ad-Hoc Network', 'routing protocol', 'Black Hole Attack', 'AODV', 'MANET']"
18032,0804.0735,Daniel Karapetyan,Gregory Gutin and Daniel Karapetyan,Generalized Traveling Salesman Problem Reduction Algorithms,To appear in Algorithmic Operations Research,Algorithmic Operations Research 4 (2009) 144-154,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The generalized traveling salesman problem (GTSP) is an extension of the
well-known traveling salesman problem. In GTSP, we are given a partition of
cities into groups and we are required to find a minimum length tour that
includes exactly one city from each group. The aim of this paper is to present
a problem reduction algorithm that deletes redundant vertices and edges,
preserving the optimal solution. The algorithm's running time is O(N^3) in the
worst case, but it is significantly faster in practice. The algorithm has
reduced the problem size by 15-20% on average in our experiments and this has
decreased the solution time by 10-60% for each of the considered solvers.
","[{'version': 'v1', 'created': 'Fri, 4 Apr 2008 13:36:19 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Apr 2009 17:36:47 GMT'}]",2010-03-30,"[['Gutin', 'Gregory', ''], ['Karapetyan', 'Daniel', '']]","['Generalized Traveling Salesman Problem', 'Preprocessing', 'Reduction Algorithm']"
18033,1512.00219,Rashid Mijumbi,Rashid Mijumbi,Placement and Assignment of Servers in Virtualized Radio Access Networks,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The virtualization of Radio Access Networks (RANs) has been proposed as one
of the important use cases of Network Function Virtualization (NFV). In
Virtualized Radio Access Networks (VRANs), some functions from a Base Station
(BS), such as those which make up the Base Band Unit (BBU), may be implemented
in a shared infrastructure located at either a data center or distributed in
network nodes. For the latter option, one challenge is in deciding which subset
of the available network nodes can be used to host the physical BBU servers
(the placement problem), and then to which of the available physical BBUs each
Remote Radio Head (RRH) should be assigned (the assignment problem). These two
problems constitute what we refer to as the VRAN Placement and Assignment
Problem (VRAN-PAP). In this paper, we start by formally defining the VRAN-PAP
before formulating it as a Binary Integer Linear Program (BILP) whose objective
is to minimize the server and front haul link setup costs as well as the
latency between each RRH and its assigned BBU. Since the BILP could become
computationally intractable, we also propose a greedy approximation for larger
instances of the VRAN-PAP. We perform simulations to compare both algorithms in
terms of solution quality as well as computation time under varying network
sizes and setup budgets.
","[{'version': 'v1', 'created': 'Tue, 1 Dec 2015 10:55:41 GMT'}]",2015-12-02,"[['Mijumbi', 'Rashid', '']]","['network function virtualization', 'server placement', 'resource assignment', 'virtualized radio access networks']"
18034,1701.08923,Bilal Khan,"Bilal Khan, Hsuan-Wei Lee and Kirk Dombrowski","One-step Estimation of Networked Population Size with Anonymity Using
  Respondent-Driven Capture-Recapture and Hashing",23 pages,,,,cs.SI cs.DM stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Estimates of population size for hidden and hard-to-reach individuals are of
particular interest to health officials when health problems are concentrated
in such populations. Efforts to derive these estimates are often frustrated by
a range of factors including social stigma or an association with illegal
activities that ordinarily preclude conventional survey strategies. This paper
builds on and extends prior work that proposed a method to meet these
challenges. Here we describe a rigorous formalization of a one-step,
network-based population estimation procedure that can be employed under
conditions of anonymity. The estimation procedure is designed to be implemented
alongside currently accepted strategies for research with hidden populations.
Simulation experiments are described that test the efficacy of the method
across a range of implementation conditions and hidden population sizes. The
results of these experiments show that reliable population estimates can be
derived for hidden, networked population as large as 12,500 and perhaps larger
for one family of random graphs. As such, the method shows potential for
cost-effective implementation health and disease surveillance officials
concerned with hidden populations. Limitations and future work are discussed in
the concluding section.
","[{'version': 'v1', 'created': 'Tue, 31 Jan 2017 05:43:39 GMT'}]",2017-02-01,"[['Khan', 'Bilal', ''], ['Lee', 'Hsuan-Wei', ''], ['Dombrowski', 'Kirk', '']]","['Capture-recapture', 'network size estimation', 'hidden populations', 'respondent drivensampling', 'key populations']"
18035,1304.7054,Chetan Jhurani,Chetan Jhurani,Batched Kronecker product for 2-D matrices and 3-D arrays on NVIDIA GPUs,,,,,cs.MS cs.DC math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe an interface and an implementation for performing Kronecker
product actions on NVIDIA GPUs for multiple small 2-D matrices and 3-D arrays
processed in parallel as a batch. This method is suited to cases where the
Kronecker product component matrices are identical but the operands in a
matrix-free application vary in the batch. Any batched GEMM (General Matrix
Multiply) implementation, for example ours [1] or the one in cuBLAS, can also
be used for performing batched Kronecker products on GPUs. However, the
specialized implementation presented here is faster and uses less memory.
Partly this is because a simple GEMM based approach would require extra copies
to and from main memory. We focus on matrix sizes less than or equal to 16,
since these are the typical polynomial degrees in Finite Elements, but the
implementation can be easily extended for other sizes. We obtain 143 and 285
GFlop/s for single precision real when processing matrices of size 10 and 16,
respectively on NVIDIA Tesla K20c using CUDA 5.0. The corresponding speeds for
3-D array Kronecker products are 126 and 268 GFlop/s, respectively. Double
precision is easily supported using the C++ template mechanism.
","[{'version': 'v1', 'created': 'Fri, 26 Apr 2013 02:22:25 GMT'}]",2013-04-29,"[['Jhurani', 'Chetan', '']]","['NVIDIA CUDA', 'GPU', 'Kronecker product', 'BLAS', 'cuBLAS']"
18036,1611.00873,Qiang Lyu,"Qiang Lyu, Yixin Chen, Zhaorong Li, Zhicheng Cui, Ling Chen, Xing
  Zhang, Haihua Shen","Extracting Actionability from Machine Learning Models by Sub-optimal
  Deterministic Planning","16 pages, 4 figures",,,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A main focus of machine learning research has been improving the
generalization accuracy and efficiency of prediction models. Many models such
as SVM, random forest, and deep neural nets have been proposed and achieved
great success. However, what emerges as missing in many applications is
actionability, i.e., the ability to turn prediction results into actions. For
example, in applications such as customer relationship management, clinical
prediction, and advertisement, the users need not only accurate prediction, but
also actionable instructions which can transfer an input to a desirable goal
(e.g., higher profit repays, lower morbidity rates, higher ads hit rates).
Existing effort in deriving such actionable knowledge is few and limited to
simple action models which restricted to only change one attribute for each
action. The dilemma is that in many real applications those action models are
often more complex and harder to extract an optimal solution.
  In this paper, we propose a novel approach that achieves actionability by
combining learning with planning, two core areas of AI. In particular, we
propose a framework to extract actionable knowledge from random forest, one of
the most widely used and best off-the-shelf classifiers. We formulate the
actionability problem to a sub-optimal action planning (SOAP) problem, which is
to find a plan to alter certain features of a given input so that the random
forest would yield a desirable output, while minimizing the total costs of
actions. Technically, the SOAP problem is formulated in the SAS+ planning
formalism, and solved using a Max-SAT based approach. Our experimental results
demonstrate the effectiveness and efficiency of the proposed approach on a
personal credit dataset and other benchmarks. Our work represents a new
application of automated planning on an emerging and challenging machine
learning paradigm.
","[{'version': 'v1', 'created': 'Thu, 3 Nov 2016 03:53:41 GMT'}]",2016-11-04,"[['Lyu', 'Qiang', ''], ['Chen', 'Yixin', ''], ['Li', 'Zhaorong', ''], ['Cui', 'Zhicheng', ''], ['Chen', 'Ling', ''], ['Zhang', 'Xing', ''], ['Shen', 'Haihua', '']]","['actionable knowledge extraction', 'machine learning', 'planning', 'random forest', 'weightedpartial Max-SAT']"
18037,1510.01291,Samuel Kounaves,"Dongping Fang, Elizabeth Oberlin, Wei Ding, Samuel P. Kounaves","A Common-Factor Approach for Multivariate Data Cleaning with an
  Application to Mars Phoenix Mission Data","12 pages, 10 figures, 1 table",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data quality is fundamentally important to ensure the reliability of data for
stakeholders to make decisions. In real world applications, such as scientific
exploration of extreme environments, it is unrealistic to require raw data
collected to be perfect. As data miners, when it is infeasible to physically
know the why and the how in order to clean up the data, we propose to seek the
intrinsic structure of the signal to identify the common factors of
multivariate data. Using our new data driven learning method, the common-factor
data cleaning approach, we address an interdisciplinary challenge on
multivariate data cleaning when complex external impacts appear to interfere
with multiple data measurements. Existing data analyses typically process one
signal measurement at a time without considering the associations among all
signals. We analyze all signal measurements simultaneously to find the hidden
common factors that drive all measurements to vary together, but not as a
result of the true data measurements. We use common factors to reduce the
variations in the data without changing the base mean level of the data to
avoid altering the physical meaning.
","[{'version': 'v1', 'created': 'Mon, 5 Oct 2015 19:21:22 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Oct 2015 16:47:30 GMT'}]",2015-10-08,"[['Fang', 'Dongping', ''], ['Oberlin', 'Elizabeth', ''], ['Ding', 'Wei', ''], ['Kounaves', 'Samuel P.', '']]","['Data Cleaning', 'Factor Analysis', 'Statistical Learning']"
18038,1603.02644,Christophe Dupuy,"Christophe Dupuy (SIERRA), Francis Bach (LIENS, SIERRA)","Online but Accurate Inference for Latent Variable Models with Local
  Gibbs Sampling",,"Journal of Machine Learning Research, Journal of Machine Learning
  Research, 2017, 18, pp.1 - 45",,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study parameter inference in large-scale latent variable models. We first
propose an unified treatment of online inference for latent variable models
from a non-canonical exponential family, and draw explicit links between
several previously proposed frequentist or Bayesian methods. We then propose a
novel inference method for the frequentist estimation of parameters, that
adapts MCMC methods to online inference of latent variable models with the
proper use of local Gibbs sampling. Then, for latent Dirich-let allocation,we
provide an extensive set of experiments and comparisons with existing work,
where our new approach outperforms all previously proposed methods. In
particular, using Gibbs sampling for latent variable inference is superior to
variational inference in terms of test log-likelihoods. Moreover, Bayesian
inference through variational methods perform poorly, sometimes leading to
worse fits with latent variables of higher dimensionality.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2016 19:57:47 GMT'}, {'version': 'v2', 'created': 'Mon, 14 Mar 2016 20:00:25 GMT'}, {'version': 'v3', 'created': 'Wed, 27 Jul 2016 12:54:53 GMT'}, {'version': 'v4', 'created': 'Tue, 30 Jan 2018 07:19:15 GMT'}, {'version': 'v5', 'created': 'Wed, 31 Jan 2018 08:38:26 GMT'}]",2018-02-01,"[['Dupuy', 'Christophe', '', 'SIERRA'], ['Bach', 'Francis', '', 'LIENS, SIERRA']]","['Latent Variables Models', 'Online Learning', 'Gibbs Sampling', 'Topic Modelling', 'LatentDirichlet Allocation']"
18039,0909.3609,Vinay Jethava,"Vinay Jethava, Krishnan Suresh, Chiranjib Bhattacharyya, Ramesh
  Hariharan",Randomized Algorithms for Large scale SVMs,"17 pages, Submitted to Machine Learning journal (October 2008) -
  under revision",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a randomized algorithm for training Support vector machines(SVMs)
on large datasets. By using ideas from Random projections we show that the
combinatorial dimension of SVMs is $O({log} n)$ with high probability. This
estimate of combinatorial dimension is used to derive an iterative algorithm,
called RandSVM, which at each step calls an existing solver to train SVMs on a
randomly chosen subset of size $O({log} n)$. The algorithm has probabilistic
guarantees and is capable of training SVMs with Kernels for both classification
and regression problems. Experiments done on synthetic and real life data sets
demonstrate that the algorithm scales up existing SVM learners, without loss of
accuracy.
","[{'version': 'v1', 'created': 'Sat, 19 Sep 2009 23:40:10 GMT'}]",2009-09-22,"[['Jethava', 'Vinay', ''], ['Suresh', 'Krishnan', ''], ['Bhattacharyya', 'Chiranjib', ''], ['Hariharan', 'Ramesh', '']]","['Support Vector Machines', 'Randomized Algorithms', 'Random Projections']"
18040,1502.05487,Raik Niemann M.Sc.,"Raik Niemann, Udo Pfingst and Richard G\""obel","Performance Evaluation of netfilter: A Study on the Performance Loss
  When Using netfilter as a Firewall","7 pages, 7 figures, 1 table",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since GNU/Linux became a popular operating system on computer network
routers, its packet routing mechanisms attracted more interest. This does not
only concern 'big' Linux servers acting as a router but more and more small and
medium network access devices, such as DSL or cable access devices.
  Although there are a lot of documents dealing with high performance routing
with GNU/Linux, only a few offer experimental results to prove the given
advices. This study evaluates the throughput performance of Linux' routing
subsystem netfilter under various conditions like different data transport
protocols in combination with different IP address families and transmission
strategies. Those conditions were evaluated with two different types of
netfilter rules for a high number in the rule tables. In addition to this, our
experiments allowed us to evaluate two prominent client connection handling
techniques (threads and the epoll() facility).
  The evaluation of the 1.260 different combinations of our test parameters
shows a nearly linear but small throughput loss with the number of rules which
is independant from the transport protocol and framesize. However, this
evaluation identifies another issue concerning the throughput loss when it
comes to the address family, i.e. IPv4 and IPv6.
","[{'version': 'v1', 'created': 'Thu, 19 Feb 2015 07:52:30 GMT'}]",2015-02-20,"[['Niemann', 'Raik', ''], ['Pfingst', 'Udo', ''], ['Göbel', 'Richard', '']]","['Linux', 'netfilter', 'performance']"
18041,1412.2954,Ying Xiao,Santosh S. Vempala and Ying Xiao,"Max vs Min: Tensor Decomposition and ICA with nearly Linear Sample
  Complexity",,,,,cs.DS cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a simple, general technique for reducing the sample complexity of
matrix and tensor decomposition algorithms applied to distributions. We use the
technique to give a polynomial-time algorithm for standard ICA with sample
complexity nearly linear in the dimension, thereby improving substantially on
previous bounds. The analysis is based on properties of random polynomials,
namely the spacings of an ensemble of polynomials. Our technique also applies
to other applications of tensor decompositions, including spherical Gaussian
mixture models.
","[{'version': 'v1', 'created': 'Tue, 9 Dec 2014 13:33:04 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Dec 2014 14:31:06 GMT'}, {'version': 'v3', 'created': 'Fri, 19 Jun 2015 19:00:25 GMT'}]",2015-06-22,"[['Vempala', 'Santosh S.', ''], ['Xiao', 'Ying', '']]","['Independent Component Analysis', 'Tensor decomposition', 'Fourier PCA', 'Sample Complexity', 'Eigenvalue spacing']"
18042,1606.05735,Muhammed Salman Shamsi,"Muhammed Salman Shamsi, Jhansi Lakshmi","A Comparative Analysis of classification data mining techniques :
  Deriving key factors useful for predicting students performance","6 pages, 6 tables, 2 figures",,,,cs.LG cs.AI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Students opting for Engineering as their discipline is increasing rapidly.
But due to various factors and inappropriate primary education in India,
failure rates are high. Students are unable to excel in core engineering
because of complex and mathematical subjects. Hence, they fail in such
subjects. With the help of data mining techniques, we can predict the
performance of students in terms of grades and failure in subjects. This paper
performs a comparative analysis of various classification techniques, such as
Na\""ive Bayes, LibSVM, J48, Random Forest, and JRip and tries to choose best
among these. Based on the results obtained, we found that Na\""ive Bayes is the
most accurate method in terms of students failure prediction and JRip is most
accurate in terms of students grade prediction. We also found that JRip
marginally differs from Na\""ive Bayes in terms of accuracy for students failure
prediction and gives us a set of rules from which we derive the key factors
influencing students performance. Finally, we suggest various ways to mitigate
these factors. This study is limited to Indian Education system scenarios.
However, the factors found can be helpful in other scenarios as well.
","[{'version': 'v1', 'created': 'Sat, 18 Jun 2016 10:06:44 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Nov 2016 14:47:28 GMT'}]",2016-11-14,"[['Shamsi', 'Muhammed Salman', ''], ['Lakshmi', 'Jhansi', '']]","['data mining', 'classification', 'failure', 'prediction', 'education']"
18043,1510.04748,Marcus Ramos,"Marcus V. M. Ramos, Ruy J. G. B. de Queiroz, Nelma Moreira, Jos\'e
  Carlos Bacelar Almeida",Formalization of the pumping lemma for context-free languages,,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context-free languages (CFLs) are highly important in computer language
processing technology as well as in formal language theory. The Pumping Lemma
is a property that is valid for all context-free languages, and is used to show
the existence of non context-free languages. This paper presents a
formalization, using the Coq proof assistant, of the Pumping Lemma for
context-free languages.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2015 00:02:47 GMT'}]",2015-10-19,"[['Ramos', 'Marcus V. M.', ''], ['de Queiroz', 'Ruy J. G. B.', ''], ['Moreira', 'Nelma', ''], ['Almeida', 'José Carlos Bacelar', '']]","['Context-free languages', 'Pumping Lemma', 'formalization', 'formalmathematics', 'proof assistant', 'interactive proof systems', 'Coq']"
18044,1507.01391,Nodari Sitchinava,Peyman Afshani and Nodari Sitchinava,Sorting and Permuting without Bank Conflicts on GPUs,"12 pages, 2 figures, 23rd European Symposium on Algorithms (ESA)",,,,cs.DS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we look at the complexity of designing algorithms without any
bank conflicts in the shared memory of Graphical Processing Units (GPUs). Given
input of size $n$, $w$ processors and $w$ memory banks, we study three
fundamental problems: sorting, permuting and $w$-way partitioning (defined as
sorting an input containing exactly $n/w$ copies of every integer in $[w]$).
  We solve sorting in optimal $O(\frac{n}{w} \log n)$ time. When $n \ge w^2$,
we solve the partitioning problem optimally in $O(n/w)$ time. We also present a
general solution for the partitioning problem which takes $O(\frac{n}{w}
\log^3_{n/w} w)$ time. Finally, we solve the permutation problem using a
randomized algorithm in $O(\frac{n}{w} \log\log\log_{n/w} n)$ time. Our results
show evidence that when working with banked memory architectures, there is a
separation between these problems and the permutation and partitioning problems
are not as easy as simple parallel scanning.
","[{'version': 'v1', 'created': 'Mon, 6 Jul 2015 11:20:34 GMT'}]",2015-07-07,"[['Afshani', 'Peyman', ''], ['Sitchinava', 'Nodari', '']]","['GPU', 'model', 'algorithm design', 'efficient algorithms', 'prefix sums', 'sorting']"
18045,1402.3080,Santhy Viswam,Santhy Viswam and Sajeer Karattil,Software Requirement Specification Using Reverse Speech Technology,"5 pages, International Journal of Computer Trends and Technology
  (IJCTT) vol.5 no.4",,,,cs.CL cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Speech analysis had been taken to a new level with the discovery of Reverse
Speech (RS). RS is the discovery of hidden messages, referred as reversals, in
normal speech. Works are in progress for exploiting the relevance of RS in
different real world applications such as investigation, medical field etc. In
this paper we represent an innovative method for preparing a reliable Software
Requirement Specification (SRS) document with the help of reverse speech. As
SRS act as the backbone for the successful completion of any project, a
reliable method is needed to overcome the inconsistencies. Using RS such a
reliable method for SRS documentation was developed.
","[{'version': 'v1', 'created': 'Thu, 13 Feb 2014 10:28:43 GMT'}]",2014-02-14,"[['Viswam', 'Santhy', ''], ['Karattil', 'Sajeer', '']]","['Reverse Speech', 'Software Requirement Specification (SRS)', 'Speech Enhancement', 'Speech Recognition']"
18046,1105.0826,Radu Arsinte,"Radu Arsinte, Eugen Lupu",Streaming Multimedia Information Using the Features of the DVB-S Card,"4 pages, 5 figures","Scientific Bulletin of the ""Politehnica"" University Timi\c{s}oara,
  Transaction on Electronics and Telecomunications, Tom 51(65), Fascicola 1-2,
  pag. 181-184, 2006",,,cs.MM cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a study of audio-video streaming using the additional
possibilities of a DVB-S card. The board used for experiments (Technisat
SkyStar 2) is one of the most frequently used cards for this purpose. Using the
main blocks of the board's software support it is possible the implement a
really useful and full functional system for audio-video streaming. The
streaming is possible to be implemented either for decoded MPEG stream or for
transport stream. In this last case it is possible to view not only a program,
but any program from the same multiplex. This allows us to implement
","[{'version': 'v1', 'created': 'Wed, 4 May 2011 13:46:31 GMT'}]",2011-05-05,"[['Arsinte', 'Radu', ''], ['Lupu', 'Eugen', '']]","['Multimedia', 'DVB-S', 'Networking']"
18047,1506.00695,Ventsislav Chonev,"Ventsislav Chonev, Joel Ouaknine, and James Worrell",On the Skolem Problem for Continuous Linear Dynamical Systems,Full version of paper at ICALP'16,,,,cs.SY cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Continuous Skolem Problem asks whether a real-valued function satisfying
a linear differential equation has a zero in a given interval of real numbers.
This is a fundamental reachability problem for continuous linear dynamical
systems, such as linear hybrid automata and continuous-time Markov chains.
Decidability of the problem is currently open---indeed decidability is open
even for the sub-problem in which a zero is sought in a bounded interval. In
this paper we show decidability of the bounded problem subject to Schanuel's
Conjecture, a unifying conjecture in transcendental number theory. We
furthermore analyse the unbounded problem in terms of the frequencies of the
differential equation, that is, the imaginary parts of the characteristic
roots. We show that the unbounded problem can be reduced to the bounded problem
if there is at most one rationally linearly independent frequency, or if there
are two rationally linearly independent frequencies and all characteristic
roots are simple. We complete the picture by showing that decidability of the
unbounded problem in the case of two (or more) rationally linearly independent
frequencies would entail a major new effectiveness result in Diophantine
approximation, namely computability of the Diophantine-approximation types of
all real algebraic numbers.
","[{'version': 'v1', 'created': 'Mon, 1 Jun 2015 22:30:59 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Jul 2015 15:26:33 GMT'}, {'version': 'v3', 'created': 'Tue, 10 May 2016 17:35:05 GMT'}]",2016-05-11,"[['Chonev', 'Ventsislav', ''], ['Ouaknine', 'Joel', ''], ['Worrell', 'James', '']]","['Differential equations', 'Reachability', 'Baker’s theorem', 'Schanuel’s Conjecture', 'Semi-algebraic sets']"
18048,1504.07057,Giuseppe Toscani,Giuseppe Toscani,"The fractional Fisher information and the central limit theorem for
  stable laws",,,,,cs.IT math-ph math.IT math.MP math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new information-theoretic approach to the central limit theorem for stable
laws is presented. The main novelty is the concept of relative fractional
Fisher information, which shares most of the properties of the classical one,
included Blachman-Stam type inequalities. These inequalities relate the
fractional Fisher information of the sum of $n$ independent random variables to
the information contained in sums over subsets containing $n-1$ of the random
variables. As a consequence, a simple proof of the monotonicity of the relative
fractional Fisher information in central limit theorems for stable law is
obtained, together with an explicit decay rate.
","[{'version': 'v1', 'created': 'Mon, 27 Apr 2015 12:37:42 GMT'}]",2015-04-28,"[['Toscani', 'Giuseppe', '']]","['Central limit theorem', 'Fractional calculus', 'Fisher information', 'Information inequalities', 'Stable laws']"
18049,1702.07092,Arman Cohan,"Arman Cohan, Allan Fong, Nazli Goharian, and Raj Ratwani",A Neural Attention Model for Categorizing Patient Safety Events,ECIR 2017,,,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Medical errors are leading causes of death in the US and as such, prevention
of these errors is paramount to promoting health care. Patient Safety Event
reports are narratives describing potential adverse events to the patients and
are important in identifying and preventing medical errors. We present a neural
network architecture for identifying the type of safety events which is the
first step in understanding these narratives. Our proposed model is based on a
soft neural attention model to improve the effectiveness of encoding long
sequences. Empirical results on two large-scale real-world datasets of patient
safety reports demonstrate the effectiveness of our method with significant
improvements over existing methods.
","[{'version': 'v1', 'created': 'Thu, 23 Feb 2017 04:27:49 GMT'}]",2017-02-24,"[['Cohan', 'Arman', ''], ['Fong', 'Allan', ''], ['Goharian', 'Nazli', ''], ['Ratwani', 'Raj', '']]","['Natural Language Processing', 'Text Categorization', 'Medical Text Processing', 'Deep Learning']"
18050,0712.3925,Pascal Heus,"Pascal Heus, Richard Gomez",QIS-XML: A metadata specification for Quantum Information Science,"26 pages, 22 figures",,,,cs.SE cs.DB quant-ph,,"  While Quantum Information Science (QIS) is still in its infancy, the ability
for quantum based hardware or computers to communicate and integrate with their
classical counterparts will be a major requirement towards their success.
Little attention however has been paid to this aspect of QIS. To manage and
exchange information between systems, today's classic Information Technology
(IT) commonly uses the eXtensible Markup Language (XML) and its related tools.
XML is composed of numerous specifications related to various fields of
expertise. No such global specification however has been defined for quantum
computers. QIS-XML is a proposed XML metadata specification for the description
of fundamental components of QIS (gates & circuits) and a platform for the
development of a hardware independent low level pseudo-code for quantum
algorithms. This paper lays out the general characteristics of the QIS-XML
specification and outlines practical applications through prototype use cases.
","[{'version': 'v1', 'created': 'Sun, 23 Dec 2007 15:24:35 GMT'}]",2011-11-10,"[['Heus', 'Pascal', ''], ['Gomez', 'Richard', '']]","['quantum computer', 'information science', 'XML', 'interoperability', 'standards']"
18051,1609.06260,Mohamed Moustafa,"Mai Tolba, Mohamed Moustafa","GAdaBoost: Accelerating Adaboost Feature Selection with Genetic
  Algorithms","8th International Conference on Evolutionary Computation Theory and
  Applications (ECTA 2016). Final paper will appear at the SCITEPRESS Digital
  Library",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Boosted cascade of simple features, by Viola and Jones, is one of the most
famous object detection frameworks. However, it suffers from a lengthy training
process. This is due to the vast features space and the exhaustive search
nature of Adaboost. In this paper we propose GAdaboost: a Genetic Algorithm to
accelerate the training procedure through natural feature selection.
Specifically, we propose to limit Adaboost search within a subset of the huge
feature space, while evolving this subset following a Genetic Algorithm.
Experiments demonstrate that our proposed GAdaboost is up to 3.7 times faster
than Adaboost. We also demonstrate that the price of this speedup is a mere
decrease (3%, 4%) in detection accuracy when tested on FDDB benchmark face
detection set, and Caltech Web Faces respectively.
","[{'version': 'v1', 'created': 'Tue, 20 Sep 2016 17:31:11 GMT'}]",2016-09-21,"[['Tolba', 'Mai', ''], ['Moustafa', 'Mohamed', '']]","['Object Detection', 'Genetic Algorithms', 'Haar Features', 'Adaboost', 'Face Detection']"
18052,1701.06342,Hayato Takahashi,Hayato Takahashi,"Bayesian definition of random sequences with respect to conditional
  probabilities",revised version,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study Martin-L\""{o}f random (ML-random) points on computable probability
measures on sample and parameter spaces (Bayes models). We consider four
variants of conditional random sequences with respect to the conditional
distributions: two of them are defined by ML-randomness on Bayes models
(variants of conditional Bayes randomness) and the others are defined by blind
tests for conditional distributions (variants of conditional blind randomness).
We study the relations between these sets and show that variants of conditional
blind randomness are ill-defined from the Bayes statistical point of view. We
also show that if the sets of random sequences of uniformly computable
parametric models are pairwise disjoint then there is a consistent estimator
\(f\) for the model, i.e.~\(f\) equals the parameter with probability one for
the probability model of the parameter for all parameters. Finally, we present
an algorithmic solution to a classical problem in Bayes statistics, i.e.~the
posterior distributions converge weakly to almost all parameters if and only if
the posterior distributions converge weakly to all ML-random parameters.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2017 11:43:09 GMT'}, {'version': 'v2', 'created': 'Sat, 4 Feb 2017 14:43:24 GMT'}, {'version': 'v3', 'created': 'Thu, 16 Mar 2017 16:56:51 GMT'}, {'version': 'v4', 'created': 'Mon, 8 May 2017 14:48:34 GMT'}, {'version': 'v5', 'created': 'Fri, 9 Jun 2017 11:59:54 GMT'}, {'version': 'v6', 'created': 'Thu, 2 Apr 2020 14:16:20 GMT'}, {'version': 'v7', 'created': 'Fri, 28 Jan 2022 15:31:04 GMT'}, {'version': 'v8', 'created': 'Wed, 9 Feb 2022 07:13:50 GMT'}, {'version': 'v9', 'created': 'Thu, 22 Sep 2022 14:11:09 GMT'}]",2022-09-23,"[['Takahashi', 'Hayato', '']]","['Martin-Löf random', 'generalized van Lambalgen’s theorem', 'con']"
18053,1106.2275,Anwitaman Datta,Fr\'ed\'erique Oggier and Anwitaman Datta,Byzantine Fault Tolerance of Regenerating Codes,"In The 11th IEEE International Conference on Peer-to-Peer Computing
  (P2P 2011)",,,,cs.DC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent years have witnessed a slew of coding techniques custom designed for
networked storage systems. Network coding inspired regenerating codes are the
most prolifically studied among these new age storage centric codes. A lot of
effort has been invested in understanding the fundamental achievable trade-offs
of storage and bandwidth usage to maintain redundancy in presence of different
models of failures, showcasing the efficacy of regenerating codes with respect
to traditional erasure coding techniques. For practical usability in open and
adversarial environments, as is typical in peer-to-peer systems, we need
however not only resilience against erasures, but also from (adversarial)
errors. In this paper, we study the resilience of generalized regenerating
codes (supporting multi-repairs, using collaboration among newcomers) in the
presence of two classes of Byzantine nodes, relatively benign selfish
(non-cooperating) nodes, as well as under more active, malicious polluting
nodes. We give upper bounds on the resilience capacity of regenerating codes,
and show that the advantages of collaborative repair can turn to be detrimental
in the presence of Byzantine nodes. We further exhibit that system mechanisms
can be combined with regenerating codes to mitigate the effect of rogue nodes.
","[{'version': 'v1', 'created': 'Sun, 12 Jun 2011 04:13:57 GMT'}]",2011-06-14,"[['Oggier', 'Frédérique', ''], ['Datta', 'Anwitaman', '']]","['distributed storage', 'regenerating codes', 'Byzantine faults', 'pollution', 'resilience']"
18054,1802.08621,Zhe Cui,"Zhe Cui, Sriram Karthik Badam, Adil Yal\c{c}in, Niklas Elmqvist","DataSite: Proactive Visual Data Exploration with Computation of
  Insight-based Recommendations","Databases, Information Visualization, Human Computer Interaction;
  Accepted at Information Visualization Journal",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Effective data analysis ideally requires the analyst to have high expertise
as well as high knowledge of the data. Even with such familiarity, manually
pursuing all potential hypotheses and exploring all possible views is
impractical. We present DataSite, a proactive visual analytics system where the
burden of selecting and executing appropriate computations is shared by an
automatic server-side computation engine. Salient features identified by these
automatic background processes are surfaced as notifications in a feed
timeline. DataSite effectively turns data analysis into a conversation between
analyst and computer, thereby reducing the cognitive load and domain knowledge
requirements. We validate the system with a user study comparing it to a recent
visualization recommendation system, yielding significant improvement,
particularly for complex analyses that existing analytics systems do not
support well.
","[{'version': 'v1', 'created': 'Fri, 23 Feb 2018 16:27:52 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Mar 2018 16:11:20 GMT'}, {'version': 'v3', 'created': 'Sat, 22 Sep 2018 21:11:20 GMT'}]",2018-09-25,"[['Cui', 'Zhe', ''], ['Badam', 'Sriram Karthik', ''], ['Yalçin', 'Adil', ''], ['Elmqvist', 'Niklas', '']]","['Exploratory analysis', 'user interfaces', 'proactive visualization', 'visual insights']"
18055,1712.04711,Pushparaja Murugan,"Pushparaja Murugan, Shanmugasundaram Durairaj","Regularization and Optimization strategies in Deep Convolutional Neural
  Network",15 pages,,,,cs.CV,http://creativecommons.org/licenses/by-sa/4.0/,"  Convolution Neural Networks, known as ConvNets exceptionally perform well in
many complex machine learning tasks. The architecture of ConvNets demands the
huge and rich amount of data and involves with a vast number of parameters that
leads the learning takes to be computationally expensive, slow convergence
towards the global minima, trap in local minima with poor predictions. In some
cases, architecture overfits the data and make the architecture difficult to
generalise for new samples that were not in the training set samples. To
address these limitations, many regularization and optimization strategies are
developed for the past few years. Also, studies suggested that these techniques
significantly increase the performance of the networks as well as reducing the
computational cost. In implementing these techniques, one must thoroughly
understand the theoretical concept of how this technique works in increasing
the expressive power of the networks. This article is intended to provide the
theoretical concepts and mathematical formulation of the most commonly used
strategies in developing a ConvNet architecture.
","[{'version': 'v1', 'created': 'Wed, 13 Dec 2017 11:23:45 GMT'}]",2017-12-14,"[['Murugan', 'Pushparaja', ''], ['Durairaj', 'Shanmugasundaram', '']]","['Deep learning', 'ConvNets', 'Convolution Neural Netowrk', 'Forward and backwardpropogation', 'Regularizations', 'Optimizations']"
18056,1412.5787,Vasile Patrascu,Vasile Patrascu,Gray Level Image Enhancement Using Polygonal Functions,"The 13th International Conference on Automation, Quality and Testing,
  Robotics, Vol. Robotics, Image and Signal processing, pp. 129-134, May 23-25
  2002, Cluj-Napoca, Romania",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a method for enhancing the gray level images. This method
takes part from the category of point transforms and it is based on
interpolation functions. The latter have a graphic represented by polygonal
lines. The interpolation nodes of these functions are calculated taking into
account the statistics of gray levels belonging to the image.
","[{'version': 'v1', 'created': 'Thu, 18 Dec 2014 10:12:49 GMT'}]",2014-12-19,"[['Patrascu', 'Vasile', '']]","['image enhancement', 'interpolation function', 'polygonal line']"
18057,1504.07298,J\'er\'emy Barbay,J\'er\'emy Barbay and Pablo P\'erez-Lantero,Adaptive Computation of the Swap-Insert Correction Distance,"16 pages, no figures, long version of the extended abstract accepted
  to SPIRE 2015",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Swap-Insert Correction distance from a string $S$ of length $n$ to
another string $L$ of length $m\geq n$ on the alphabet $[1..d]$ is the minimum
number of insertions, and swaps of pairs of adjacent symbols, converting $S$
into $L$. Contrarily to other correction distances, computing it is NP-Hard in
the size $d$ of the alphabet. We describe an algorithm computing this distance
in time within $O(d^2 nm g^{d-1})$, where there are $n_\alpha$ occurrences of
$\alpha$ in $S$, $m_\alpha$ occurrences of $\alpha$ in $L$, and where
$g=\max_{\alpha\in[1..d]} \min\{n_\alpha,m_\alpha-n_\alpha\}$ measures the
difficulty of the instance. The difficulty $g$ is bounded by above by various
terms, such as the length of the shortest string $S$, and by the maximum number
of occurrences of a single character in $S$. Those results illustrate how, in
many cases, the correction distance between two strings can be easier to
compute than in the worst case scenario.
","[{'version': 'v1', 'created': 'Mon, 27 Apr 2015 23:00:16 GMT'}, {'version': 'v2', 'created': 'Sun, 28 Jun 2015 01:30:51 GMT'}]",2015-06-30,"[['Barbay', 'Jérémy', ''], ['Pérez-Lantero', 'Pablo', '']]","['Adaptive', 'Dynamic Programming', 'Edit Distance', 'Insert', 'Swap']"
18058,1506.00255,Vadim E. Levit,"Adi Jarden, Vadim E. Levit and Eugen Mandrescu",Critical and Maximum Independent Sets of a Graph,"12 pages, 9 figures. arXiv admin note: substantial text overlap with
  arXiv:1407.7368",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let G be a simple graph with vertex set V(G). A subset S of V(G) is
independent if no two vertices from S are adjacent. By Ind(G) we mean the
family of all independent sets of G while core(G) and corona(G) denote the
intersection and the union of all maximum independent sets, respectively. The
number d(X)= |X|-|N(X)| is the difference of the set of vertices X, and an
independent set A is critical if d(A)=max{d(I):I belongs to Ind(G)} (Zhang,
1990). Let ker(G) and diadem(G) be the intersection and union, respectively, of
all critical independent sets of G (Levit and Mandrescu, 2012). In this paper,
we present various connections between critical unions and intersections of
maximum independent sets of a graph. These relations give birth to new
characterizations of Koenig-Egervary graphs, some of them involving ker(G),
core(G), corona(G), and diadem(G).
","[{'version': 'v1', 'created': 'Sun, 31 May 2015 17:02:01 GMT'}]",2015-06-02,"[['Jarden', 'Adi', ''], ['Levit', 'Vadim E.', ''], ['Mandrescu', 'Eugen', '']]","['maximum independent set', 'maximum critical set', 'ker', 'core', 'corona', 'diadem', 'maximum matching', 'K¨onig-Egerv´ary graph']"
18059,1407.8499,Chirag Nagpal,Chirag Nagpal and Khushboo Singhal,Twitter User Classification using Ambient Metadata,,,,,cs.SI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Microblogging websites, especially Twitter have become an important means of
communication, in today's time. Often these services have been found to be
faster than conventional news services. With millions of users, a need was felt
to classify users based on ambient metadata associated with their user
accounts. We particularly look at the effectiveness of the profile description
field in order to carry out the task of user classification. Our results show
that such metadata can be an effective feature for any classification task.
","[{'version': 'v1', 'created': 'Thu, 31 Jul 2014 17:55:25 GMT'}]",2014-08-01,"[['Nagpal', 'Chirag', ''], ['Singhal', 'Khushboo', '']]","['Twitter', 'Classification', 'Machine Learning']"
18060,1412.6306,Lidia Dobrescu,"Adrian-Ioan Lita, Ioan Plotog, Lidia Dobrescu","Multiprocessor System Dedicated to Multi-Rotor Mini-UAV Capable of 3D
  flying","International Conference of Scientific Paper AFASES 2014 Brasov,
  22-24 May 2014",,,,cs.CE,http://creativecommons.org/licenses/by/3.0/,"  The paper describes an electronic multiprocessor system that assures
functionality of a miniature UAV capable of 3D flying. The apparatus consists
of six independently controlled brushless DC motors, each having a propeller
attached to it. Since the brushless motor requires complex algorithms in order
to achieve maximum torque, efficiency and response time a DSP must be used. All
the motors are then controlled by a main microprocessor which is capable of
reading sensors (Inertial Measurement Unit (IMU)-orientation and GPS),
receiving input commands (remote controller or trajectory plan) and sending
independent commands to each of the six motors. The apparatus contains a total
of eight microcontrollers: the main unit, the IMU mathematical processor and
one microcontroller for each of the six brushless DC motors. Applications for
such an apparatus could include not only military, but also search-and-rescue,
geodetics, aerial photography and aerial assistance.
","[{'version': 'v1', 'created': 'Fri, 19 Dec 2014 11:53:38 GMT'}]",2014-12-22,"[['Lita', 'Adrian-Ioan', ''], ['Plotog', 'Ioan', ''], ['Dobrescu', 'Lidia', '']]","['hexacopter', 'brushless', 'IMU', 'search-and-rescue', 'BLDC']"
18061,1704.07498,Samir Abdelrahman,"Mohammad Amin Morid, Olivia R. Liu Sheng, Samir Abdelrahman","Leveraging Patient Similarity and Time Series Data in Healthcare
  Predictive Models","To appear:Twenty-third Americas Conference on Information Systems,
  Boston, 2017",,,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Patient time series classification faces challenges in high degrees of
dimensionality and missingness. In light of patient similarity theory, this
study explores effective temporal feature engineering and reduction, missing
value imputation, and change point detection methods that can afford
similarity-based classification models with desirable accuracy enhancement. We
select a piecewise aggregation approximation method to extract fine-grain
temporal features and propose a minimalist method to impute missing values in
temporal features. For dimensionality reduction, we adopt a gradient descent
search method for feature weight assignment. We propose new patient status and
directional change definitions based on medical knowledge or clinical
guidelines about the value ranges for different patient status levels, and
develop a method to detect change points indicating positive or negative
patient status changes. We evaluate the effectiveness of the proposed methods
in the context of early Intensive Care Unit mortality prediction. The
evaluation results show that the k-Nearest Neighbor algorithm that incorporates
methods we select and propose significantly outperform the relevant benchmarks
for early ICU mortality prediction. This study makes contributions to time
series classification and early ICU mortality prediction via identifying and
enhancing temporal feature engineering and reduction methods for
similarity-based time series classification.
","[{'version': 'v1', 'created': 'Tue, 25 Apr 2017 00:25:06 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Apr 2017 00:27:53 GMT'}, {'version': 'v3', 'created': 'Sun, 30 Apr 2017 15:33:25 GMT'}]",2017-05-02,"[['Morid', 'Mohammad Amin', ''], ['Sheng', 'Olivia R. Liu', ''], ['Abdelrahman', 'Samir', '']]","['time-series classification', 'similarity-based classification', 'mortality prediction', 'directional change point']"
18062,1802.06266,Hrushikesh Mhaskar,"Hrushikesh Mhaskar, Tomaso Poggio","An analysis of training and generalization errors in shallow and deep
  networks",21 pages; Accepted for publication in Neural Networks,,,,cs.LG cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is motivated by an open problem around deep networks, namely, the
apparent absence of over-fitting despite large over-parametrization which
allows perfect fitting of the training data. In this paper, we analyze this
phenomenon in the case of regression problems when each unit evaluates a
periodic activation function. We argue that the minimal expected value of the
square loss is inappropriate to measure the generalization error in
approximation of compositional functions in order to take full advantage of the
compositional structure. Instead, we measure the generalization error in the
sense of maximum loss, and sometimes, as a pointwise error. We give estimates
on exactly how many parameters ensure both zero training error as well as a
good generalization error. We prove that a solution of a regularization problem
is guaranteed to yield a good training error as well as a good generalization
error and estimate how much error to expect at which test data.
","[{'version': 'v1', 'created': 'Sat, 17 Feb 2018 17:50:19 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Aug 2018 03:20:24 GMT'}, {'version': 'v3', 'created': 'Sat, 13 Jul 2019 04:56:49 GMT'}, {'version': 'v4', 'created': 'Tue, 27 Aug 2019 05:18:04 GMT'}]",2019-08-28,"[['Mhaskar', 'Hrushikesh', ''], ['Poggio', 'Tomaso', '']]","['Deep learning', 'generalization error', 'interpolatory approximation']"
18063,1510.08535,Qichun Wang,Qichun Wang,"On the Covering Radius of the Second Order Reed-Muller Code of Length
  128",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 1981, Schatz proved that the covering radius of the binary Reed-Muller
code $RM(2,6)$ is 18. For $RM(2,7)$, we only know that its covering radius is
between 40 and 44. In this paper, we prove that the covering radius of the
binary Reed-Muller code $RM(2,7)$ is at most 42. Moreover, we give a sufficient
and necessary condition for Boolean functions of 7-variable to achieve the
second-order nonlinearity 42.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2015 01:21:55 GMT'}]",2015-10-30,"[['Wang', 'Qichun', '']]","['Reed-Muller codes', 'covering radius', 'Boolean functions', 'secondorder nonlinearity']"
18064,1603.07123,Mohamed Sayed Elahl Dr,R. M. Farouk and M. A. SayedElahl,"Robust cDNA microarray image segmentation and analysis technique based
  on Hough circle transform","13 Pages,12 figures,FSP JOURNAL ISSN:1955-2068,Vol.9, Issue.7, part.1","HFSP JOURNAL ISSN:1955-2068,Vol.9, Issue.7, part.1 Human Frontier
  Science Program , HFSP JOURNAL ISSN:1955-2068",,,cs.CV,http://creativecommons.org/publicdomain/zero/1.0/,"  One of the most challenging tasks in microarray image analysis is spot
segmentation. A solution to this problem is to provide an algorithm than can be
used to find any spot within the microarray image. Circular Hough
Transformation (CHT) is a powerful feature extraction technique used in image
analysis, computer vision, and digital image processing. CHT algorithm is
applied on the cDNA microarray images to develop the accuracy and the
efficiency of the spots localization, addressing and segmentation process. The
purpose of the applied technique is to find imperfect instances of spots within
a certain class of circles by applying a voting procedure on the cDNA
microarray images for spots localization, addressing and characterizing the
pixels of each spot into foreground pixels and background simultaneously.
Intensive experiments on the University of North Carolina (UNC) microarray
database indicate that the proposed method is superior to the K-means method
and the Support vector machine (SVM). Keywords: Hough circle transformation,
cDNA microarray image analysis, cDNA microarray image segmentation, spots
localization and addressing, spots segmentation
","[{'version': 'v1', 'created': 'Wed, 23 Mar 2016 10:25:20 GMT'}]",2016-03-24,"[['Farouk', 'R. M.', ''], ['SayedElahl', 'M. A.', '']]","['Hough circle transformation', 'cDNA microarray image analysis', 'cDNA microarray image']"
18065,0806.0134,Feng Xia,"Feng Xia, Wenhong Zhao, Youxian Sun and Yu-Chu Tian","Fuzzy Logic Control Based QoS Management in Wireless Sensor/Actuator
  Networks","13 pages, 8 figures; Open Access at http://www.mdpi.org/sensors","Sensors 2007, 7(12), 3179-3191",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless sensor/actuator networks (WSANs) are emerging rapidly as a new
generation of sensor networks. Despite intensive research in wireless sensor
networks (WSNs), limited work has been found in the open literature in the
field of WSANs. In particular, quality-of-service (QoS) management in WSANs
remains an important issue yet to be investigated. As an attempt in this
direction, this paper develops a fuzzy logic control based QoS management
(FLC-QM) scheme for WSANs with constrained resources and in dynamic and
unpredictable environments. Taking advantage of the feedback control
technology, this scheme deals with the impact of unpredictable changes in
traffic load on the QoS of WSANs. It utilizes a fuzzy logic controller inside
each source sensor node to adapt sampling period to the deadline miss ratio
associated with data transmission from the sensor to the actuator. The deadline
miss ratio is maintained at a pre-determined desired level so that the required
QoS can be achieved. The FLC-QM has the advantages of generality, scalability,
and simplicity. Simulation results show that the FLC-QM can provide WSANs with
QoS support.
","[{'version': 'v1', 'created': 'Sun, 1 Jun 2008 08:39:23 GMT'}]",2008-12-18,"[['Xia', 'Feng', ''], ['Zhao', 'Wenhong', ''], ['Sun', 'Youxian', ''], ['Tian', 'Yu-Chu', '']]","['wireless sensor/actuator network', 'quality of service', 'adaptive resource management', 'fuzzy logic control', 'deadline miss ratio']"
18066,1208.1975,Manuel Birke,"Manuel Birke, Bobby Philip, Zhen Wang, Mark Berrill","Block-Relaxation Methods for 3D Constant-Coefficient Stencils on GPUs
  and Multicore CPUs",Submitted to Journal of Parallel and Distributed Computing,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Block iterative methods are extremely important as smoothers for multigrid
methods, as preconditioners for Krylov methods, and as solvers for diagonally
dominant linear systems. Developing robust and efficient algorithms suitable
for current and evolving GPU and multicore CPU systems is a significant
challenge. We address this issue in the case of constant-coefficient stencils
arising in the solution of elliptic partial differential equations on
structured 3D uniform and adaptively refined grids. Robust, highly parallel
implementations of block Jacobi and chaotic block Gauss-Seidel algorithms with
exact inversion of the blocks are developed using different parallelization
techniques. Experimental results for NVIDIA Fermi GPUs and AMD multicore
systems are presented.
","[{'version': 'v1', 'created': 'Thu, 9 Aug 2012 17:29:16 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Feb 2013 09:12:16 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Jul 2019 16:56:18 GMT'}]",2019-07-16,"[['Birke', 'Manuel', ''], ['Philip', 'Bobby', ''], ['Wang', 'Zhen', ''], ['Berrill', 'Mark', '']]","['Parallel algorithms', 'Graphics processors', 'Smoothing', 'Multigrid and multilevel methods', 'Multicore']"
18067,1212.6808,Kristin Glass,Richard Colbaugh and Kristin Glass,Early Warning Analysis for Social Diffusion Events,,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is considerable interest in developing predictive capabilities for
social diffusion processes, for instance to permit early identification of
emerging contentious situations, rapid detection of disease outbreaks, or
accurate forecasting of the ultimate reach of potentially viral ideas or
behaviors. This paper proposes a new approach to this predictive analytics
problem, in which analysis of meso-scale network dynamics is leveraged to
generate useful predictions for complex social phenomena. We begin by deriving
a stochastic hybrid dynamical systems (S-HDS) model for diffusion processes
taking place over social networks with realistic topologies; this modeling
approach is inspired by recent work in biology demonstrating that S-HDS offer a
useful mathematical formalism with which to represent complex, multi-scale
biological network dynamics. We then perform formal stochastic reachability
analysis with this S-HDS model and conclude that the outcomes of social
diffusion processes may depend crucially upon the way the early dynamics of the
process interacts with the underlying network's community structure and
core-periphery structure. This theoretical finding provides the foundations for
developing a machine learning algorithm that enables accurate early warning
analysis for social diffusion events. The utility of the warning algorithm, and
the power of network-based predictive metrics, are demonstrated through an
empirical investigation of the propagation of political memes over social media
networks. Additionally, we illustrate the potential of the approach for
security informatics applications through case studies involving early warning
analysis of large-scale protests events and politically-motivated cyber
attacks.
","[{'version': 'v1', 'created': 'Mon, 31 Dec 2012 02:27:17 GMT'}]",2013-01-01,"[['Colbaugh', 'Richard', ''], ['Glass', 'Kristin', '']]","['social dynamics', 'predictive analysis', 'early warning', 'protest and mobilization', 'cyber security', 'security informatics']"
18068,1110.4248,Luojie Xiang,Luojie Xiang,Ideogram Based Chinese Sentiment Word Orientation Computation,"4 pages, 3 figures, accepted by CET 2011",,,,cs.CL,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper presents a novel algorithm to compute sentiment orientation of
Chinese sentiment word. The algorithm uses ideograms which are a distinguishing
feature of Chinese language. The proposed algorithm can be applied to any
sentiment classification scheme. To compute a word's sentiment orientation
using the proposed algorithm, only the word itself and a precomputed character
ontology is required, rather than a corpus. The influence of three parameters
over the algorithm performance is analyzed and verified by experiment.
Experiment also shows that proposed algorithm achieves an F Measure of 85.02%
outperforming existing ideogram based algorithm.
","[{'version': 'v1', 'created': 'Wed, 19 Oct 2011 11:45:16 GMT'}]",2011-10-20,"[['Xiang', 'Luojie', '']]","['ideogram', 'Chinese sentiment word', 'sentiment orientation computation']"
18069,1304.3980,Deepakbhai Chhaganbhai vegda,"Deepak.c.vegda, Harshad.B.Prajapati",Scheduling of Dependent Tasks Application using Random Search Technique,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since beginning of Grid computing, scheduling of dependent tasks application
has attracted attention of researchers due to NP-Complete nature of the
problem. In Grid environment, scheduling is deciding about assignment of tasks
to available resources. Scheduling in Grid is challenging when the tasks have
dependencies and resources are heterogeneous. The main objective in scheduling
of dependent tasks is minimizing make-span. Due to NP-complete nature of
scheduling problem, exact solutions cannot generate schedule efficiently.
Therefore, researchers apply heuristic or random search techniques to get
optimal or near to optimal solution of such problems. In this paper, we show
how Genetic Algorithm can be used to solve dependent task scheduling problem.
We describe how initial population can be generated using random assignment and
height based approaches. We also present design of crossover and mutation
operators to enable scheduling of dependent tasks application without violating
dependency constraints. For implementation of GA based scheduling, we explore
and analyze SimGrid and GridSim simulation toolkits. From results, we found
that SimGrid is suitable, as it has support of SimDag API for DAG applications.
We found that GA based approach can generate schedule for dependent tasks
application in reasonable time while trying to minimize make-span.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2013 05:04:31 GMT'}]",2013-04-16,"[['vegda', 'Deepak. c.', ''], ['Prajapati', 'Harshad. B.', '']]","['Genetic Algorithm', 'Grid computing', 'scheduling', 'dependent task', 'SimGrid']"
18070,1704.07329,Murahtan Kurfal{\i},"Murathan Kurfal{\i}, Ahmet \""Ust\""un, Burcu Can","A Trie-Structured Bayesian Model for Unsupervised Morphological
  Segmentation","12 pages, accepted and presented at the CICLING 2017 - 18th
  International Conference on Intelligent Text Processing and Computational
  Linguistics",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce a trie-structured Bayesian model for unsupervised
morphological segmentation. We adopt prior information from different sources
in the model. We use neural word embeddings to discover words that are
morphologically derived from each other and thereby that are semantically
similar. We use letter successor variety counts obtained from tries that are
built by neural word embeddings. Our results show that using different
information sources such as neural word embeddings and letter successor variety
as prior information improves morphological segmentation in a Bayesian model.
Our model outperforms other unsupervised morphological segmentation models on
Turkish and gives promising results on English and German for scarce resources.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 17:07:26 GMT'}]",2017-04-25,"[['Kurfalı', 'Murathan', ''], ['Üstün', 'Ahmet', ''], ['Can', 'Burcu', '']]","['unsupervised learning', 'morphology', 'morphological segmentation', 'Bayesian learning']"
18071,1512.00482,Henning Fernau,"Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, Vojt\v{e}ch
  Vorel",Characterization and Complexity Results on Jumping Finite Automata,,,,,cs.FL cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a jumping finite automaton, the input head can jump to an arbitrary
position within the remaining input after reading and consuming a symbol.
  We characterize the corresponding class of languages in terms of special
shuffle expressions and survey other equivalent notions from the existing
literature.
  Moreover, we present several results concerning computational hardness and
algorithms for parsing and other basic tasks concerning jumping finite
automata.
","[{'version': 'v1', 'created': 'Tue, 1 Dec 2015 21:11:39 GMT'}]",2015-12-03,"[['Fernau', 'Henning', ''], ['Paramasivan', 'Meenakshi', ''], ['Schmid', 'Markus L.', ''], ['Vorel', 'Vojtěch', '']]","['Jumping Finite Automata', 'Shuffle Expressions', 'CommutativeLanguages', 'Semilinear Sets', 'NP-hard problems', 'Exponential Time Hypothesis']"
18072,1304.3742,Robert West,"Robert West, Ryen W. White, Eric Horvitz","From Cookies to Cooks: Insights on Dietary Patterns via Analysis of Web
  Usage Logs","WWW 2013, 11 pages, 11 figures",,,,cs.CY cs.IR physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nutrition is a key factor in people's overall health. Hence, understanding
the nature and dynamics of population-wide dietary preferences over time and
space can be valuable in public health. To date, studies have leveraged small
samples of participants via food intake logs or treatment data. We propose a
complementary source of population data on nutrition obtained via Web logs. Our
main contribution is a spatiotemporal analysis of population-wide dietary
preferences through the lens of logs gathered by a widely distributed
Web-browser add-on, using the access volume of recipes that users seek via
search as a proxy for actual food consumption. We discover that variation in
dietary preferences as expressed via recipe access has two main periodic
components, one yearly and the other weekly, and that there exist
characteristic regional differences in terms of diet within the United States.
In a second study, we identify users who show evidence of having made an acute
decision to lose weight. We characterize the shifts in interests that they
express in their search queries and focus on changes in their recipe queries in
particular. Last, we correlate nutritional time series obtained from recipe
queries with time-aligned data on hospital admissions, aimed at understanding
how behavioral data captured in Web logs might be harnessed to identify
potential relationships between diet and acute health problems. In this
preliminary study, we focus on patterns of sodium identified in recipes over
time and patterns of admission for congestive heart failure, a chronic illness
that can be exacerbated by increases in sodium intake.
","[{'version': 'v1', 'created': 'Fri, 12 Apr 2013 22:04:52 GMT'}]",2013-04-16,"[['West', 'Robert', ''], ['White', 'Ryen W.', ''], ['Horvitz', 'Eric', '']]","['log/behavioral analysis', 'public health', 'nutrition']"
18073,1009.0501,Fabien Tence,"Fabien Tenc\'e (LISYC), C\'edric Buche (LISYC)","Automatable Evaluation Method Oriented toward Behaviour Believability
  for Video Games","GAME-ON 2008, France (2008)",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classic evaluation methods of believable agents are time-consuming because
they involve many human to judge agents. They are well suited to validate work
on new believable behaviours models. However, during the implementation,
numerous experiments can help to improve agents' believability. We propose a
method which aim at assessing how much an agent's behaviour looks like humans'
behaviours. By representing behaviours with vectors, we can store data computed
for humans and then evaluate as many agents as needed without further need of
humans. We present a test experiment which shows that even a simple evaluation
following our method can reveal differences between quite believable agents and
humans. This method seems promising although, as shown in our experiment,
results' analysis can be difficult.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2010 18:36:44 GMT'}]",2010-09-03,"[['Tencé', 'Fabien', '', 'LISYC'], ['Buche', 'Cédric', '', 'LISYC']]","['Artificial intelligence', 'agent evaluation', 'believable behaviour', 'human tracking']"
18074,1406.7048,Victor Goh,Ong Sing Goh,Global Internet-based Crisis Communication: A case Study on SARS,"International Journal of Intelligent Information Technologies,
  Inaugural Issue: January 2005, Idea Group Publishing, ISSN: 1548-3657, USA",,,TJ211.G64 2004,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crisis Communication is an effective communication mechanism in the world.
The outbreak of the SARS disease and the way information on it was disseminated
has illustrated the importance of effective and efficient crisis communication
management. Consequently, we would like to highlight the viability of
incorporating an intelligent agent software robot into a crisis communication
portal (CCNet) to send the alert news to subscribed users via email and others
mobile services such as SMS, MMS and GPRS.
","[{'version': 'v1', 'created': 'Fri, 27 Jun 2014 00:38:35 GMT'}]",2014-11-06,"[['Goh', 'Ong Sing', '']]","['Intelligent Agent', 'Crisis Communication', 'SARS', 'Artificial Intelligence Markup Language (AIML)']"
18075,1406.4075,Francesco Dolce,Francesco Dolce,Regular Interval Exchange Transformations over a Quadratic Field,"13 pages, 5 figures. arXiv admin note: substantial text overlap with
  arXiv:1305.0120",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a generalization of a result of Boshernitzan and Carroll: an
extension of Lagrange's Theorem on continued fraction expansion of quadratic
irrationals to interval exchange transformations. In order to do this, we use a
two-sided version of the Rauzy induction. In particular, we show that starting
from an interval exchange transforma- tion whose lengths are defined over a
quadratic field and applying the two-sided Rauzy induction, one can obtain only
a finite number of new transformations up to homothety.
","[{'version': 'v1', 'created': 'Mon, 16 Jun 2014 17:24:22 GMT'}]",2014-06-17,"[['Dolce', 'Francesco', '']]","['Symbolic Dynamics', 'Interval Exchange Transformations', 'Rauzy Induction', 'Continued Fractions']"
18076,1105.0355,Yilmaz Kaya,"Y{\i}lmaz Kaya, Murat Uyar, Ramazan Tek\D{j}n",A Novel Crossover Operator for Genetic Algorithms: Ring Crossover,"5 pages, 3 fgigures",,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The genetic algorithm (GA) is an optimization and search technique based on
the principles of genetics and natural selection. A GA allows a population
composed of many individuals to evolve under specified selection rules to a
state that maximizes the ""fitness"" function. In that process, crossover
operator plays an important role. To comprehend the GAs as a whole, it is
necessary to understand the role of a crossover operator. Today, there are a
number of different crossover operators that can be used in GAs. However, how
to decide what operator to use for solving a problem? A number of test
functions with various levels of difficulty has been selected as a test polygon
for determine the performance of crossover operators. In this paper, a novel
crossover operator called 'ring crossover' is proposed. In order to evaluate
the efficiency and feasibility of the proposed operator, a comparison between
the results of this study and results of different crossover operators used in
GAs is made through a number of test functions with various levels of
difficulty. Results of this study clearly show significant differences between
the proposed operator and the other crossover operators.
","[{'version': 'v1', 'created': 'Mon, 2 May 2011 15:22:36 GMT'}]",2016-08-14,"[['Kaya', 'Yılmaz', ''], ['Uyar', 'Murat', ''], ['Tek\\D{j}n', 'Ramazan', '']]","['Genetic algorithm', 'crossover operator', 'ring crossover']"
18077,1702.06199,Quan Nguyen,Quan Nguyen,The Dialog State Tracking Challenge with Bayesian Approach,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generative model has been one of the most common approaches for solving the
Dialog State Tracking Problem with the capabilities to model the dialog
hypotheses in an explicit manner. The most important task in such Bayesian
networks models is constructing the most reliable user models by learning and
reflecting the training data into the probability distribution of user actions
conditional on networks states. This paper provides an overall picture of the
learning process in a Bayesian framework with an emphasize on the
state-of-the-art theoretical analyses of the Expectation Maximization learning
algorithm.
","[{'version': 'v1', 'created': 'Mon, 20 Feb 2017 22:43:54 GMT'}]",2017-02-22,"[['Nguyen', 'Quan', '']]","['DSTC', 'Bayesian method', 'Markov', 'Expectation Maximization', 'Forward-Backward Algorithm']"
18078,1409.6628,Bernhard Rumpe,"Hans Gr\""onninger, Jochen Hartmann, Holger Krahn, Stefan Kriebel, Lutz
  Rothhart, Bernhard Rumpe","Modelling Automotive Function Nets with Views for Features, Variants,
  and Modes","7 pages, 7 figures, 4th European Congress ERTS - Embedded Real Time
  Software, Toulouse 2008",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modelling the logical architecture of an automotive system as one central
step in the development process leads to an early understanding of the
fundamental functional properties of the system under design. This supports
developers in making design decisions. However, due to the large size and
complexity of the system and hence the logical architecture, a good notation,
method and tooling is necessary. In this paper, we show how logical
architectures can be modelled succinctly as function nets using a SysML-based
notation. The usefulness for developers is increased by comprehensible views on
the complete model that describe automotive features, variants, and modes.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 12:34:44 GMT'}]",2014-09-24,"[['Grönninger', 'Hans', ''], ['Hartmann', 'Jochen', ''], ['Krahn', 'Holger', ''], ['Kriebel', 'Stefan', ''], ['Rothhart', 'Lutz', ''], ['Rumpe', 'Bernhard', '']]","['Automotive Logical Architecture', 'Variants', 'Modes', 'SysML']"
18079,1410.2903,Yin Tan,"Claude Carlet, Guang Gong, Yin Tan","Quadratic Zero-Difference Balanced Functions, APN Functions and Strongly
  Regular Graphs",,,,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $F$ be a function from $\mathbb{F}_{p^n}$ to itself and $\delta$ a
positive integer. $F$ is called zero-difference $\delta$-balanced if the
equation $F(x+a)-F(x)=0$ has exactly $\delta$ solutions for all non-zero
$a\in\mathbb{F}_{p^n}$. As a particular case, all known quadratic planar
functions are zero-difference 1-balanced; and some quadratic APN functions over
$\mathbb{F}_{2^n}$ are zero-difference 2-balanced. In this paper, we study the
relationship between this notion and differential uniformity; we show that all
quadratic zero-difference $\delta$-balanced functions are differentially
$\delta$-uniform and we investigate in particular such functions with the form
$F=G(x^d)$, where $\gcd(d,p^n-1)=\delta +1$ and where the restriction of $G$ to
the set of all non-zero $(\delta +1)$-th powers in $\mathbb{F}_{p^n}$ is an
injection. We introduce new families of zero-difference $p^t$-balanced
functions. More interestingly, we show that the image set of such functions is
a regular partial difference set, and hence yields strongly regular graphs;
this generalizes the constructions of strongly regular graphs using planar
functions by Weng et al. Using recently discovered quadratic APN functions on
$\mathbb{F}_{2^8}$, we obtain $15$ new $(256, 85, 24, 30)$ negative Latin
square type strongly regular graphs.
","[{'version': 'v1', 'created': 'Fri, 10 Oct 2014 20:32:05 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Oct 2014 15:23:42 GMT'}]",2014-11-03,"[['Carlet', 'Claude', ''], ['Gong', 'Guang', ''], ['Tan', 'Yin', '']]","['Zero-difference balanced functions', 'almost perfect nonlinear functions', 'strongly regular graphs']"
18080,1606.06816,Liangjie Hong,Liangjie Hong and Yue Shi and Suju Rajan,Learning Optimal Card Ranking from Query Reformulation,,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile search has recently been shown to be the major contributor to the
growing search market. The key difference between mobile search and desktop
search is that information presentation is limited to the screen space of the
mobile device. Thus, major search engines have adopted a new type of search
result presentation, known as \textit{information cards}, in which each card
presents summarized results from one domain/vertical, for a given query, to
augment the standard blue-links search results. While it has been widely
acknowledged that information cards are particularly suited to mobile user
experience, it is also challenging to optimize such result sets. Typically,
user engagement metrics like query reformulation are based on whole ranked list
of cards for each query and most traditional learning to rank algorithms
require per-item relevance labels. In this paper, we investigate the
possibility of interpreting query reformulation into effective relevance labels
for query-card pairs. We inherit the concept of conventional learning-to-rank,
and propose pointwise, pairwise and listwise interpretations for query
reformulation. In addition, we propose a learning-to-label strategy that learns
the contribution of each card, with respect to a query, where such
contributions can be used as labels for training card ranking models. We
utilize a state-of-the-art ranking model and demonstrate the effectiveness of
proposed mechanisms on a large-scale mobile data from a major search engine,
showing that models trained from labels derived from user engagement can
significantly outperform ones trained from human judgment labels.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2016 04:52:18 GMT'}]",2016-06-23,"[['Hong', 'Liangjie', ''], ['Shi', 'Yue', ''], ['Rajan', 'Suju', '']]","['Card Ranking', 'Federated Search', 'Mobile Search', 'Labeling', 'Online Metrics', 'Reformulation']"
18081,1306.0755,Dr. Nadeem Javaid,"N. Javaid, M. Ilahi, R. D. Khan, L. Ali, U. Qasim, Z. A. Khan","Evaluating Wireless Reactive Routing Protocols with Linear Programming
  Model for Wireless Ad-hoc Networks",arXiv admin note: substantial text overlap with arXiv:1304.0153,"J. Basic. Appl. Sci. Res., 3(1)1170-1181, 2013",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Wireless Ad-hoc Networks, nodes are free to move randomly and organize
themselves arbitrarily, thus topology may change quickly and capriciously. In
Mobile Ad-hoc NETworks, specially Wireless Multi-hop Networks provide users
with facility of quick communication. In Wireless Multi-hop Networks, routing
protocols with energy efficient and delay reduction techniques are needed to
fulfill users demands. In this paper, we present Linear Programming models to
assess and enhance reactive routing protocols. To practically examine
constraints of respective Linear Programming models over reactive protocols, we
select AODV, DSR and DYMO. It is deduced from analytical simulations of Linear
Programming models in MATLAB that quick route repair reduces routing latency
and optimizations of retransmission attempts results efficient energy
utilization. To provide quick repair, we enhance AODV and DSR. To practically
examine the efficiency of enhanced protocols in different scenarios of Wireless
Multi-hop Networks, we conduct simulations using NS-2. From simulation results,
enhanced DSR and AODV achieve efficient output by optimizing routing latencies
and routing load in terms of retransmission attempts.
","[{'version': 'v1', 'created': 'Tue, 4 Jun 2013 12:47:49 GMT'}]",2013-06-05,"[['Javaid', 'N.', ''], ['Ilahi', 'M.', ''], ['Khan', 'R. D.', ''], ['Ali', 'L.', ''], ['Qasim', 'U.', ''], ['Khan', 'Z. A.', '']]","['Route Discovery', 'Route Maintenance', 'AODV', 'DSR', 'DYMO  I']"
18082,1504.01557,No\'emie Meunier,"Thomas Brihaye, V\'eronique Bruy\`ere, No\'emie Meunier,
  Jean-Fran\c{c}ois Raskin","Weak Subgame Perfect Equilibria and their Application to Quantitative
  Reachability",,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study $n$-player turn-based games played on a finite directed graph. For
each play, the players have to pay a cost that they want to minimize. Instead
of the well-known notion of Nash equilibrium (NE), we focus on the notion of
subgame perfect equilibrium (SPE), a refinement of NE well-suited in the
framework of games played on graphs. We also study natural variants of SPE,
named weak (resp. very weak) SPE, where players who deviate cannot use the full
class of strategies but only a subclass with a finite number of (resp. a
unique) deviation step(s).
  Our results are threefold. Firstly, we characterize in the form of a Folk
theorem the set of all plays that are the outcome of a weak SPE. Secondly, for
the class of quantitative reachability games, we prove the existence of a
finite-memory SPE and provide an algorithm for computing it (only existence was
known with no information regarding the memory). Moreover, we show that the
existence of a constrained SPE, i.e. an SPE such that each player pays a cost
less than a given constant, can be decided. The proofs rely on our Folk theorem
for weak SPEs (which coincide with SPEs in the case of quantitative
reachability games) and on the decidability of MSO logic on infinite words.
Finally with similar techniques, we provide a second general class of games for
which the existence of a (constrained) weak SPE is decidable.
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2015 11:40:31 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Apr 2015 16:05:11 GMT'}]",2015-04-13,"[['Brihaye', 'Thomas', ''], ['Bruyère', 'Véronique', ''], ['Meunier', 'Noémie', ''], ['Raskin', 'Jean-François', '']]","['multi-player games on graphs', 'quantitative objectives', 'Nash equilibrium', 'subgame perfect equilibrium', 'quantitative reachability']"
18083,1705.08112,Martin Zimmermann,"Swen Jacobs, Leander Tentrup, Martin Zimmermann",Distributed Synthesis for Parameterized Temporal Logics,"Extended version of arXiv:1509.05144. Preprint submitted to
  Information and Computation",,,,cs.LO cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the synthesis of distributed implementations for specifications
in parameterized temporal logics such as PROMPT-LTL, which extends LTL by
temporal operators equipped with parameters that bound their scope. For single
process synthesis it is well-established that such parametric extensions do not
increase worst-case complexities. For synchronous distributed systems we show
that, despite being more powerful, the realizability problem for PROMPT-LTL is
not harder than its LTL counterpart. For asynchronous systems we have to
express scheduling assumptions and therefore consider an assume-guarantee
synthesis problem. As asynchronous distributed synthesis is already undecidable
for LTL, we give a semi-decision procedure for the PROMPT-LTL assume-guarantee
synthesis problem based on bounded synthesis. Finally, we show that our results
extend to the stronger logics PLTL and PLDL.
","[{'version': 'v1', 'created': 'Tue, 23 May 2017 08:00:13 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Feb 2018 21:21:54 GMT'}]",2018-02-28,"[['Jacobs', 'Swen', ''], ['Tentrup', 'Leander', ''], ['Zimmermann', 'Martin', '']]","['distributed synthesis', 'distributed realizability', 'incompleteinformation', 'parametric linear temporal logic', 'parametric linear dynamiclogic']"
18084,1407.0009,Sumalatha  G,"G. Sumalatha, N. Zareena, Ch. Gopi Raju","A Review on Failure Node Recovery Algorithms in Wireless Sensor Actor
  Networks",5 pages,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In wireless sensor-actor networks, sensors probe their surroundings and
forward their data to actor nodes. Actors collect sensor data and perform
certain tasks in response to various events. Since actors operate on harsh
environment, they may easily get damaged or failed. Failed actor nodes may
partition the network into disjoint subsets. In order to reestablish
connectivity nodes may be relocated to new positions. This paper focus on
review of three (LeDir, RIM, DARA) node recovery algorithms, and their
performance has been analysed in terms network overhead and path length
validation metrics.
","[{'version': 'v1', 'created': 'Mon, 30 Jun 2014 05:35:36 GMT'}]",2014-07-02,"[['Sumalatha', 'G.', ''], ['Zareena', 'N.', ''], ['Raju', 'Ch. Gopi', '']]","['Fault tolerance', 'network recovery', 'topology management', 'wireless sensor-actor network (WSAN)']"
18085,1307.3855,Yue Shi,"Yue Shi, Alexandros Karatzoglou, Linas Baltrunas, Martha Larson, Alan
  Hanjalic",GAPfm: Optimal Top-N Recommendations for Graded Relevance Domains,"Manuscript under review. A short version of this manuscript has been
  accepted at CIKM 2013",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender systems are frequently used in domains in which users express
their preferences in the form of graded judgments, such as ratings. If accurate
top-N recommendation lists are to be produced for such graded relevance
domains, it is critical to generate a ranked list of recommended items directly
rather than predicting ratings. Current techniques choose one of two
sub-optimal approaches: either they optimize for a binary metric such as
Average Precision, which discards information on relevance grades, or they
optimize for Normalized Discounted Cumulative Gain (NDCG), which ignores the
dependence of an item's contribution on the relevance of more highly ranked
items.
  In this paper, we address the shortcomings of existing approaches by
proposing the Graded Average Precision factor model (GAPfm), a latent factor
model that is particularly suited to the problem of top-N recommendation in
domains with graded relevance data. The model optimizes for Graded Average
Precision, a metric that has been proposed recently for assessing the quality
of ranked results list for graded relevance. GAPfm learns a latent factor model
by directly optimizing a smoothed approximation of GAP. GAPfm's advantages are
twofold: it maintains full information about graded relevance and also
addresses the limitations of models that optimize NDCG. Experimental results
show that GAPfm achieves substantial improvements on the top-N recommendation
task, compared to several state-of-the-art approaches. In order to ensure that
GAPfm is able to scale to very large data sets, we propose a fast learning
algorithm that uses an adaptive item selection strategy. A final experiment
shows that GAPfm is useful not only for generating recommendation lists, but
also for ranking a given list of rated items.
","[{'version': 'v1', 'created': 'Mon, 15 Jul 2013 08:55:11 GMT'}]",2013-07-16,"[['Shi', 'Yue', ''], ['Karatzoglou', 'Alexandros', ''], ['Baltrunas', 'Linas', ''], ['Larson', 'Martha', ''], ['Hanjalic', 'Alan', '']]","['Collaborative filtering', 'graded average precision', 'latent factormodel', 'recommender systems', 'top-n recommendation']"
18086,1511.09120,Soliman Nasser,"Soliman Nasser, Ibrahim Jubran, Dan Feldman",Coresets for Kinematic Data: From Theorems to Real-Time Systems,,,,,cs.RO cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A coreset (or core-set) of a dataset is its semantic compression with respect
to a set of queries, such that querying the (small) coreset provably yields an
approximate answer to querying the original (full) dataset. In the last decade,
coresets provided breakthroughs in theoretical computer science for
approximation algorithms, and more recently, in the machine learning community
for learning ""Big data"". However, we are not aware of real-time systems that
compute coresets in a rate of dozens of frames per second. In this paper we
suggest a framework to turn theorems to such systems using coresets. We begin
with a proof of independent interest, that any set of $n$ matrices in
$\mathbb{R}^{d\times d}$ whose sum is $S$, has a positively weighted subset
whose sum has the same center of mass (mean) and orientation (left+right
singular vectors) as $S$, and consists of $O(dr)$ matrices (independent of
$n$), where $r\leq d$ is the rank of $S$. We provide an algorithm that computes
this (core) set in one pass over possibly infinite stream of matrices in
$d^{O(1)}$ time per matrix insertion. By maintaining such a coreset for
kinematic (moving) set of $n$ points, we can run pose-estimation algorithms,
such as Kabsch or PnP, on the small coresets, instead of the $n$ points, in
real-time using weak devices, while obtaining the same results. This enabled us
to implement a low-cost ($<\$100$) IoT wireless system that tracks a toy (and
harmless) quadcopter which guides guests to a desired room (in a hospital,
mall, hotel, museum, etc.) with no help of additional human or remote
controller. We hope that our framework will encourage researchers outside the
theoretical community to design and use coresets in future systems and papers.
To this end, we provide extensive experimental results on both synthetic and
real data, as well as a link to the open code of our system and algorithms.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2015 00:44:41 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Feb 2016 17:40:31 GMT'}, {'version': 'v3', 'created': 'Fri, 22 Jul 2016 12:43:28 GMT'}, {'version': 'v4', 'created': 'Mon, 18 Dec 2017 14:04:48 GMT'}]",2017-12-19,"[['Nasser', 'Soliman', ''], ['Jubran', 'Ibrahim', ''], ['Feldman', 'Dan', '']]","['Core-sets', 'Pose Estimation', 'Caratheodory', 'Localization']"
18087,1402.1151,Wojciech Biega\'nski,Wojciech Biega\'nski and Andrzej Kasi\'nski,"Image Acquisition in an Underwater Vision System with NIR and VIS
  Illumination",,"Computer Science & Information Technology, Volume 4, Number 1,
  2014, pp. 215-224",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper describes the image acquisition system able to capture images in
two separated bands of light, used to underwater autonomous navigation. The
channels are: the visible light spectrum and near infrared spectrum. The
characteristics of natural, underwater environment were also described together
with the process of the underwater image creation. The results of an experiment
with comparison of selected images acquired in these channels are discussed.
","[{'version': 'v1', 'created': 'Wed, 5 Feb 2014 20:18:26 GMT'}]",2014-02-06,"[['Biegański', 'Wojciech', ''], ['Kasiński', 'Andrzej', '']]","['underwater vision system', 'AUV', 'image enhancement', 'image fusion']"
18088,1710.04158,Lauri Lahti,"Lauri Lahti, Henni Tenhunen, Seppo Heinonen, Minna Helkavaara, Maritta
  P\""oyh\""onen-Alho, Paulus Torkki","Development of computational models for emotional diary text analysis to
  support maternal care","This article manuscript version was completed on 17 October 2017, and
  it was self-archived on the arXiv repository (https://arxiv.org/) on 17
  October 2017. It contains 56 pages (31 for the article and 25 for Appendices
  A-F). The article contains 7 tables and 2 figures. Updated: clarity, previous
  research and statistical results (e.g. significance of correlations, main
  effects and differences)",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose new computational models for analyzing self-reported emotional
diary texts of pregnant women to support maternal care. We gathered affective
ratings outside clinical setting and developed new models to facilitate
interpretation and communication of affective expressions between persons
representing different affective ratings. Relying on constructed emotion
theory, models of dimensional emotion categories and affective ratings of Self
Assessment Manikin, we demonstrate our new proposal to analyze linguistic data
with computational models exploiting vector space and clustering methods. 35
persons having Finnish as a native language provided affective ratings for 195
emotional adjectives and 16 pregnancy-related nouns in Finnish in dimensions of
pleasure, arousal and dominance. We developed new models to represent
dependencies and differences of affective ratings between various population
subgroup categorizations, including ""women without children"", ""women with
children"" and ""men without children"" that we consider important population
segments to be addressed in maternal care. Our affective ratings showed
significant correlations between pleasure and dominance (like Warriner et al.,
2013) and with previous data collections (S\""oderholm et al., 2013; Eilola &
Havelka, 2010; Warriner et al., 2013). Our affective ratings had significant
effects on categorizations based on gender, gender-parental role and the time
of the day and duration of giving ratings. Our results indicate accordance with
significant affectivity differences of gender and age (Warriner et al., 2013)
and motherhood (Rosebrock et al., 2015). Our proposed models aim to support
health-related communication. Our results suggest gathering next the affective
ratings of patients of maternal care in a real clinical setting.
","[{'version': 'v1', 'created': 'Tue, 10 Oct 2017 01:30:04 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Oct 2017 07:08:47 GMT'}, {'version': 'v3', 'created': 'Tue, 17 Oct 2017 05:27:49 GMT'}]",2017-10-18,"[['Lahti', 'Lauri', ''], ['Tenhunen', 'Henni', ''], ['Heinonen', 'Seppo', ''], ['Helkavaara', 'Minna', ''], ['Pöyhönen-Alho', 'Maritta', ''], ['Torkki', 'Paulus', '']]","['affectivity', 'computational model', 'vector space', 'clustering', 'pregnancy', 'maternal care']"
18089,1702.06722,Canggih Puspo Wibowo,"Adityo Priyandito Utomo, Canggih Puspo Wibowo","3D Reconstruction of Temples in the Special Region of Yogyakarta By
  Using Close-Range Photogrammetry","Semnasteknomedia 2017, 5 pages",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Object reconstruction is one of the main problems in cultural heritage
preservation. This problem is due to lack of data in documentation. Thus in
this research we presented a method of 3D reconstruction using close-range
photogrammetry. We collected 1319 photos from five temples in Yogyakarta. Using
A-KAZE algorithm, keypoints of each image were obtained. Then we employed LIOP
to create feature descriptor from it. After performing feature matching, L1RA
was utilized to create sparse point clouds. In order to generate the geometry
shape, MVS was used. Finally, FSSR and Large Scale Texturing were employed to
deal with the surface and texture of the object. The quality of the
reconstructed 3D model was measured by comparing the 3D images of the model
with the original photos utilizing SSIM. The results showed that in terms of
quality, our method was on par with other commercial method such as
PhotoModeler and PhotoScan.
","[{'version': 'v1', 'created': 'Wed, 22 Feb 2017 09:32:09 GMT'}]",2017-02-23,"[['Utomo', 'Adityo Priyandito', ''], ['Wibowo', 'Canggih Puspo', '']]","['Temples', '3D Reconstruction', 'Close-Range Photogrammetry']"
18090,1606.06127,Mitko Veta,"Mitko Veta, Paul J. van Diest and Josien P.W. Pluim","Cutting out the middleman: measuring nuclear area in histopathology
  slides without segmentation",Conditionally accepted for MICCAI 2016,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The size of nuclei in histological preparations from excised breast tumors is
predictive of patient outcome (large nuclei indicate poor outcome).
Pathologists take into account nuclear size when performing breast cancer
grading. In addition, the mean nuclear area (MNA) has been shown to have
independent prognostic value. The straightforward approach to measuring nuclear
size is by performing nuclei segmentation. We hypothesize that given an image
of a tumor region with known nuclei locations, the area of the individual
nuclei and region statistics such as the MNA can be reliably computed directly
from the image data by employing a machine learning model, without the
intermediate step of nuclei segmentation. Towards this goal, we train a deep
convolutional neural network model that is applied locally at each nucleus
location, and can reliably measure the area of the individual nuclei and the
MNA. Furthermore, we show how such an approach can be extended to perform
combined nuclei detection and measurement, which is reminiscent of
granulometry.
","[{'version': 'v1', 'created': 'Mon, 20 Jun 2016 14:10:32 GMT'}]",2016-06-21,"[['Veta', 'Mitko', ''], ['van Diest', 'Paul J.', ''], ['Pluim', 'Josien P. W.', '']]","['Histopathology image analysis', 'breast cancer', 'deep learning', 'convolutional neural networks']"
18091,1301.6849,Loet Leydesdorff,Loet Leydesdorff and Inga A. Ivanova,"Mutual Redundancies in Inter-human Communication Systems: Steps Towards
  a Calculus of Processing Meaning","forthcoming in the Journal of the American Society for Information
  Science and Technology",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The study of inter-human communication requires a more complex framework than
Shannon's (1948) mathematical theory of communication because ""information"" is
defined in the latter case as meaningless uncertainty. Assuming that meaning
cannot be communicated, we extend Shannon's theory by defining mutual
redundancy as a positional counterpart of the relational communication of
information. Mutual redundancy indicates the surplus of meanings that can be
provided to the exchanges in reflexive communications. The information is
redundant because based on ""pure sets,"" that is, without subtraction of mutual
information in the overlaps. We show that in the three-dimensional case (e.g.,
of a Triple Helix of university-industry-government relations), mutual
redundancy is equal to mutual information (Rxyz = Txyz); but when the
dimensionality is even, the sign is different. We generalize to the measurement
in N dimensions and proceed to the interpretation. Using Luhmann's
social-systems theory and/or Giddens' structuration theory, mutual redundancy
can be provided with an interpretation in the sociological case: different
meaning-processing structures code and decode with other algorithms. A surplus
of (""absent"") options can then be generated that add to the redundancy.
Luhmann's ""functional (sub)systems"" of expectations or Giddens' ""rule-resource
sets"" are positioned mutually, but coupled operationally in events or
""instantiated"" in actions. Shannon-type information is generated by the
mediation, but the ""structures"" are (re-)positioned towards one another as sets
of (potentially counterfactual) expectations. The structural differences among
the coding and decoding algorithms provide a source of additional options in
reflexive and anticipatory communications.
","[{'version': 'v1', 'created': 'Tue, 29 Jan 2013 07:26:24 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Jan 2013 13:40:33 GMT'}, {'version': 'v3', 'created': 'Wed, 13 Mar 2013 21:57:55 GMT'}]",2013-03-15,"[['Leydesdorff', 'Loet', ''], ['Ivanova', 'Inga A.', '']]","['meaning', 'communication', 'configuration', 'sociocybernetics', 'mutual information', 'redundancy']"
18092,1701.04249,Dmitry Yarotsky,Dmitry Yarotsky,Geometric features for voxel-based surface recognition,13 pages,,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a library of geometric voxel features for CAD surface
recognition/retrieval tasks. Our features include local versions of the
intrinsic volumes (the usual 3D volume, surface area, integrated mean and
Gaussian curvature) and a few closely related quantities. We also compute Haar
wavelet and statistical distribution features by aggregating raw voxel
features. We apply our features to object classification on the ESB data set
and demonstrate accurate results with a small number of shallow decision trees.
","[{'version': 'v1', 'created': 'Mon, 16 Jan 2017 11:30:31 GMT'}]",2017-01-17,"[['Yarotsky', 'Dmitry', '']]","['CAD surface recognition and retrieval', 'feature vector', 'integralgeometry', 'voxel', 'decision tree', 'Haar wavelet', 'Engineering Shape Benchmark']"
18093,1510.02065,Alexandre Goncalves,"Alexandre Domingues Gon\c{c}alves and Artur Alves Pessoa and L\'ucia
  Maria de Assump\c{c}\~ao Drummond and Cristiana Bentes and Ricardo Farias","Solving the Quadratic Assignment Problem on heterogeneous environment
  (CPUs and GPUs) with the application of Level 2 Reformulation and
  Linearization Technique",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Quadratic Assignment Problem, QAP, is a classic combinatorial
optimization problem, classified as NP-hard and widely studied. This problem
consists in assigning N facilities to N locations obeying the relation of 1 to
1, aiming to minimize costs of the displacement between the facilities. The
application of Reformulation and Linearization Technique, RLT, to the QAP leads
to a tight linear relaxation but large and difficult to solve. Previous works
based on level 3 RLT needed about 700GB of working memory to process one large
instances (N = 30 facilities). We present a modified version of the algorithm
proposed by Adams et al. which executes on heterogeneous systems (CPUs and
GPUs), based on level 2 RLT. For some instances, our algorithm is up to 140
times faster and occupy 97% less memory than the level 3 RLT version. The
proposed algorithm was able to solve by first time two instances: tai35b and
tai40b.
","[{'version': 'v1', 'created': 'Wed, 7 Oct 2015 19:05:47 GMT'}]",2015-10-08,"[['Gonçalves', 'Alexandre Domingues', ''], ['Pessoa', 'Artur Alves', ''], ['Drummond', 'Lúcia Maria de Assumpção', ''], ['Bentes', 'Cristiana', ''], ['Farias', 'Ricardo', '']]","['QAP', 'RLT', 'GPU']"
18094,1702.05202,Ya Meng,"Ya Meng, Liping Li, Chuan Zhang","A Correlation-Breaking Interleaving of Polar Codes in Concatenated
  Systems",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is known that the bit errors of polar codes with successive cancellation
(SC) decoding are coupled. However, existing concatenation schemes of polar
codes with other error correction codes rarely take this coupling effect into
consideration. To achieve a better error performance of concatenated systems
with polar codes as inner codes, one can divide all bits in an outer block into
different polar blocks to completely de-correlate the possible coupled errors
in the transmitter side. We call this interleaving a blind interleaving (BI)
which serves as a benchmark. Two BI schemes, termed BI-DP and BI-CDP, are
proposed in the paper. To better balance performance, memory size, and the
decoding delay from the de-interleaving, a novel interleaving scheme, named the
correlation-breaking interleaving (CBI), is proposed. The CBI breaks the
correlated information bits based on the error correlation pattern proposed and
proven in this paper. The proposed CBI scheme is general in the sense that any
error correction code can serve as the outer code. In this paper, Low-Density
Parity-Check (LDPC) codes and BCH codes are used as two examples of the outer
codes of the interleaving scheme. The CBI scheme 1) can keep the simple SC
polar decoding while achieving a better error performance than the
state-of-the-art (SOA) direct concatenation of polar codes with LDPC codes and
BCH codes; 2) achieves a comparable error performance as the BI-DP scheme with
a smaller memory size and a shorter decoding delay. Numerical results are
provided to verify the performance of the BI schemes and the CBI scheme.
","[{'version': 'v1', 'created': 'Fri, 17 Feb 2017 01:18:25 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Dec 2018 10:02:48 GMT'}]",2018-12-31,"[['Meng', 'Ya', ''], ['Li', 'Liping', ''], ['Zhang', 'Chuan', '']]","['Polar codes', 'SC decoding', 'BP decoding', 'interleaving', 'code concatenation']"
18095,1712.04926,Siddharth Srivastava,"Siddharth Srivastava, Prerana Mukherjee, Brejesh Lall, Kamlesh Jaiswal",Object Classification using Ensemble of Local and Deep Features,"Accepted for publication at Ninth International Conference on
  Advances in Pattern Recognition",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose an ensemble of local and deep features for object
classification. We also compare and contrast effectiveness of feature
representation capability of various layers of convolutional neural network. We
demonstrate with extensive experiments for object classification that the
representation capability of features from deep networks can be complemented
with information captured from local features. We also find out that features
from various deep convolutional networks encode distinctive characteristic
information. We establish that, as opposed to conventional practice,
intermediate layers of deep networks can augment the classification
capabilities of features obtained from fully connected layers.
","[{'version': 'v1', 'created': 'Mon, 4 Dec 2017 08:42:00 GMT'}]",2017-12-14,"[['Srivastava', 'Siddharth', ''], ['Mukherjee', 'Prerana', ''], ['Lall', 'Brejesh', ''], ['Jaiswal', 'Kamlesh', '']]","['Deep Ensemble', 'SIFT', 'Fisher Vector', 'Classification']"
18096,1510.07971,Elisabetta Bergamini,Elisabetta Bergamini and Henning Meyerhenke,Approximating Betweenness Centrality in Fully-dynamic Networks,"arXiv admin note: substantial text overlap with arXiv:1504.07091,
  arXiv:1409.6241",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Betweenness is a well-known centrality measure that ranks the nodes of a
network according to their participation in shortest paths. Since an exact
computation is prohibitive in large networks, several approximation algorithms
have been proposed. Besides that, recent years have seen the publication of
dynamic algorithms for efficient recomputation of betweenness in networks that
change over time. In this paper we propose the first betweenness centrality
approximation algorithms with a provable guarantee on the maximum approximation
error for dynamic networks. Several new intermediate algorithmic results
contribute to the respective approximation algorithms: (i) new upper bounds on
the vertex diameter, (ii) the first fully-dynamic algorithm for updating an
approximation of the vertex diameter in undirected graphs, and (iii) an
algorithm with lower time complexity for updating single-source shortest paths
in unweighted graphs after a batch of edge actions. Using approximation, our
algorithms are the first to make in-memory computation of betweenness in
dynamic networks with millions of edges feasible. Our experiments show that our
algorithms can achieve substantial speedups compared to recomputation, up to
several orders of magnitude. Moreover, the approximation accuracy is usually
significantly better than the theoretical guarantee in terms of absolute error.
More importantly, for reasonably small approximation error thresholds, the rank
of nodes is well preserved, in particular for nodes with high betweenness.
","[{'version': 'v1', 'created': 'Tue, 27 Oct 2015 16:29:20 GMT'}]",2015-10-28,"[['Bergamini', 'Elisabetta', ''], ['Meyerhenke', 'Henning', '']]","['betweenness centrality', 'algorithmic network analysis', 'vertex diameter', 'approximation algorithms', 'shortest paths']"
18097,1506.04584,Lin Xu,"Zhihai Yang, Lin Xu, Zhongmin Cai","Re-scale AdaBoost for Attack Detection in Collaborative Filtering
  Recommender Systems","30 pages, 8 figures",,,,cs.IR cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Collaborative filtering recommender systems (CFRSs) are the key components of
successful e-commerce systems. Actually, CFRSs are highly vulnerable to attacks
since its openness. However, since attack size is far smaller than that of
genuine users, conventional supervised learning based detection methods could
be too ""dull"" to handle such imbalanced classification. In this paper, we
improve detection performance from following two aspects. First, we extract
well-designed features from user profiles based on the statistical properties
of the diverse attack models, making hard classification task becomes easier to
perform. Then, refer to the general idea of re-scale Boosting (RBoosting) and
AdaBoost, we apply a variant of AdaBoost, called the re-scale AdaBoost
(RAdaBoost) as our detection method based on extracted features. RAdaBoost is
comparable to the optimal Boosting-type algorithm and can effectively improve
the performance in some hard scenarios. Finally, a series of experiments on the
MovieLens-100K data set are conducted to demonstrate the outperformance of
RAdaBoost comparing with some classical techniques such as SVM, kNN and
AdaBoost.
","[{'version': 'v1', 'created': 'Mon, 15 Jun 2015 13:07:52 GMT'}]",2015-06-16,"[['Yang', 'Zhihai', ''], ['Xu', 'Lin', ''], ['Cai', 'Zhongmin', '']]","['Recommender system', 'attack detection', 'imbalancedclassification', 're-scale Boosting', 'detection rate']"
18098,1002.1181,Vishal Goyal,"Fu-Chien Kao, Siang-Ru Wang, Ting-Hao Huang","The Design of Circuit-Measuring Collaborative Learning System with
  Embedded Broker","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 3, January 2010,
  http://ijcsi.org/articles/The-Design-of-Circuit-Measuring-Collaborative-Learning-System-with-Embedded-Broker.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 3, January 2010,
  http://ijcsi.org/articles/The-Design-of-Circuit-Measuring-Collaborative-Learning-System-with-Embedded-Broker.php",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, the academic community has been giving much attention to
Cooperative Learning System, a group learning method combined with pedagogy and
social psychology. It allows group members to gain knowledge through
collaborations and interactions. Nowadays, most Internet cooperative learning
systems are designed to provide students mainly with a convenient online
environment to study theoretical courses but rarely with an online environment
to operate practical instruments. Hence, this paper designed a 3D online
cooperative learning system for operating virtual instruments with
circuit-measuring function. By integrating with Virtual Reality, Remote Control
Parameter Transmission and embedded system techniques, this system gives
learners not only a cooperative learning environment via networking to jointly
operate the 3D virtual instruments (for example, multi-meters, power supplies
and oscilloscopes) but also the functions of instant messages and 3D puzzles to
interact with one another. Therefore, learners can effectively improve learning
interests and results.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 10:24:28 GMT'}]",2010-02-08,"[['Kao', 'Fu-Chien', ''], ['Wang', 'Siang-Ru', ''], ['Huang', 'Ting-Hao', '']]","['Cooperative learning system', 'embedded system', 'virtual instruments']"
18099,1301.2774,Jafar Muhammadi,"Jafar Muhammadi, Hamid Reza Rabiee and Abbas Hosseini",Crowd Labeling: a survey,"Under consideration for publication in Knowledge and Information
  Systems",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, there has been a burst in the number of research projects on human
computation via crowdsourcing. Multiple choice (or labeling) questions could be
referred to as a common type of problem which is solved by this approach. As an
application, crowd labeling is applied to find true labels for large machine
learning datasets. Since crowds are not necessarily experts, the labels they
provide are rather noisy and erroneous. This challenge is usually resolved by
collecting multiple labels for each sample, and then aggregating them to
estimate the true label. Although the mechanism leads to high-quality labels,
it is not actually cost-effective. As a result, efforts are currently made to
maximize the accuracy in estimating true labels, while fixing the number of
acquired labels.
  This paper surveys methods to aggregate redundant crowd labels in order to
estimate unknown true labels. It presents a unified statistical latent model
where the differences among popular methods in the field correspond to
different choices for the parameters of the model. Afterwards, algorithms to
make inference on these models will be surveyed. Moreover, adaptive methods
which iteratively collect labels based on the previously collected labels and
estimated models will be discussed. In addition, this paper compares the
distinguished methods, and provides guidelines for future work required to
address the current open issues.
","[{'version': 'v1', 'created': 'Sun, 13 Jan 2013 14:12:53 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Apr 2014 05:59:49 GMT'}, {'version': 'v3', 'created': 'Wed, 3 Sep 2014 06:37:23 GMT'}]",2014-09-04,"[['Muhammadi', 'Jafar', ''], ['Rabiee', 'Hamid Reza', ''], ['Hosseini', 'Abbas', '']]","['Crowdsourcing', 'Human Computation', 'Mechanical Turk', 'Labeling', 'LatentModel', 'Inference']"
18100,1304.6994,Swan Dubois,"Swan Dubois (LPD, EPFL), Rachid Guerraoui (LPD, EPFL)",Sp\'eculation et auto-stabilisation,in French,"15\`emes Rencontres Francophones sur les Aspects Algorithmiques
  des T\'el\'ecommunications (AlgoTel), Pornic : France (2013)",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-stabilization ensures that, after any transient fault, the system
recovers in a finite time and eventually exhibits a correct behaviour.
Speculation consists in guaranteeing that the system satisfies its requirements
for any execution but exhibits significantly better performances for a subset
of executions that are more probable. A speculative protocol is in this sense
supposed to be both robust and efficient in practice. We introduce the notion
of speculative stabilization which we illustrate through the mutual exclusion
problem. We then present a novel speculatively stabilizing mutual exclusion
protocol. Our protocol is self-stabilizing for any asynchronous execution. We
prove that its stabilization time for synchronous executions is diam(g)/2 steps
(where diam(g) denotes the diameter of the system). This complexity result is
of independent interest. The celebrated mutual exclusion protocol of Dijkstra
stabilizes in n steps (where n is the number of processes) in synchronous
executions and the question whether the stabilization time could be strictly
smaller than the diameter has been open since then (almost 40 years). We show
that this is indeed possible for any underlying topology. We also provide a
lower bound proof that shows that our new stabilization time of diam(g)/2 steps
is optimal for synchronous executions, even if asynchronous stabilization is
not required.
","[{'version': 'v1', 'created': 'Thu, 25 Apr 2013 19:54:00 GMT'}]",2013-04-26,"[['Dubois', 'Swan', '', 'LPD, EPFL'], ['Guerraoui', 'Rachid', '', 'LPD, EPFL']]","['Sp´eculation', 'Tol´erance aux fautes', 'Auto-stabilisation', 'Exclusion mutuelle']"
18101,1010.6242,Bernard Jacquemin,"Martine Hurault-Plantet (LIMSI), Elie Naulleau, Bernard Jacquemin
  (CREM-EA3476)",GraphDuplex: visualisation simultan\'ee de N r\'eseaux coupl\'es 2 par 2,,"Conf\'erence en Recherche d'Information et Applications (CORIA
  2009), Prequ'\^ile de Giens : France (2009)",,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While social network analysis often focuses on graph structure of social
actors, an increasing number of communication networks now provide textual
content within social activity (email, instant messaging, blogging,
collaboration networks). We present an open source visualization software,
GraphDuplex, which brings together social structure and textual content, adding
a semantic dimension to social analysis. GraphDuplex eventually connects any
number of social or semantic graphs together, and through dynamic queries
enables user interaction and exploration across multiple graphs of different
nature.
","[{'version': 'v1', 'created': 'Fri, 29 Oct 2010 15:11:05 GMT'}]",2010-11-01,"[['Hurault-Plantet', 'Martine', '', 'LIMSI'], ['Naulleau', 'Elie', '', 'CREM-EA3476'], ['Jacquemin', 'Bernard', '', 'CREM-EA3476']]","['interactive visualization', 'social network', 'lexical network', 'dynamic query']"
18102,1107.1128,Seeja K. R.,K.R Seeja,AISMOTIF-An Artificial Immune System for DNA Motif Discovery,7 pages,"IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 2, March 2011 IJCSI International Journal of Computer Science Issues,
  Vol. 8, Issue 2, March 2011, ISSN (Online): 1694-0814, pages 143-149",,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Discovery of transcription factor binding sites is a much explored and still
exploring area of research in functional genomics. Many computational tools
have been developed for finding motifs and each of them has their own
advantages as well as disadvantages. Most of these algorithms need prior
knowledge about the data to construct background models. However there is not a
single technique that can be considered as best for finding regulatory motifs.
This paper proposes an artificial immune system based algorithm for finding the
transcription factor binding sites or motifs and two new weighted scores for
motif evaluation. The algorithm is enumerative, but sufficient pruning of the
pattern search space has been incorporated using immune system concepts. The
performance of AISMOTIF has been evaluated by comparing it with eight state of
art composite motif discovery algorithms and found that AISMOTIF predicts known
motifs as well as new motifs from the benchmark dataset without any prior
knowledge about the data.
","[{'version': 'v1', 'created': 'Tue, 5 Jul 2011 06:01:20 GMT'}]",2011-07-07,"[['Seeja', 'K. R', '']]","['Artificial immune system', 'motif discovery', 'transcription factor binding sites']"
18103,0908.2237,Manu Basavaraju,"Manu Basavaraju, L. Sunil Chandran",Acyclic Edge coloring of Planar Graphs,10 pages. 0 figures,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An $acyclic$ edge coloring of a graph is a proper edge coloring such that
there are no bichromatic cycles. The \emph{acyclic chromatic index} of a graph
is the minimum number k such that there is an acyclic edge coloring using k
colors and is denoted by $a'(G)$. It was conjectured by Alon, Sudakov and Zaks
(and much earlier by Fiamcik) that $a'(G)\le \Delta+2$, where $\Delta
=\Delta(G)$ denotes the maximum degree of the graph. We prove that if $G$ is a
planar graph with maximum degree $\Delta$, then $a'(G)\le \Delta + 12$.
","[{'version': 'v1', 'created': 'Sun, 16 Aug 2009 13:16:15 GMT'}]",2009-08-18,"[['Basavaraju', 'Manu', ''], ['Chandran', 'L. Sunil', '']]","['Acyclic edge coloring', 'acyclic edge chromatic number', 'planar graphs']"
18104,1604.00136,Pia Bideau,"Pia Bideau, Erik Learned-Miller","It's Moving! A Probabilistic Model for Causal Motion Segmentation in
  Moving Camera Videos",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The human ability to detect and segment moving objects works in the presence
of multiple objects, complex background geometry, motion of the observer, and
even camouflage. In addition to all of this, the ability to detect motion is
nearly instantaneous. While there has been much recent progress in motion
segmentation, it still appears we are far from human capabilities. In this
work, we derive from first principles a new likelihood function for assessing
the probability of an optical flow vector given the 3D motion direction of an
object. This likelihood uses a novel combination of the angle and magnitude of
the optical flow to maximize the information about the true motions of objects.
Using this new likelihood and several innovations in initialization, we develop
a motion segmentation algorithm that beats current state-of-the-art methods by
a large margin. We compare to five state-of-the-art methods on two established
benchmarks, and a third new data set of camouflaged animals, which we introduce
to push motion segmentation to the next level.
","[{'version': 'v1', 'created': 'Fri, 1 Apr 2016 05:37:26 GMT'}]",2016-04-04,"[['Bideau', 'Pia', ''], ['Learned-Miller', 'Erik', '']]","['motion segmentation', 'optical flow', 'moving camera']"
18105,1305.5610,Tao  Ye,Fred Glover and Tao Ye and Abraham P. Punnen and Gary Kochenberger,"Integrating tabu search and VLSN search to develop enhanced algorithms:
  A case study using bipartite boolean quadratic programs",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The bipartite boolean quadratic programming problem (BBQP) is a
generalization of the well studied boolean quadratic programming problem. The
model has a variety of real life applications; however, empirical studies of
the model are not available in the literature, except in a few isolated
instances. In this paper, we develop efficient heuristic algorithms based on
tabu search, very large scale neighborhood (VLSN) search, and a hybrid
algorithm that integrates the two. The computational study establishes that
effective integration of simple tabu search with VLSN search results in
superior outcomes, and suggests the value of such an integration in other
settings. Complexity analysis and implementation details are provided along
with conclusions drawn from experimental analysis. In addition, we obtain
solutions better than the best previously known for almost all medium and large
size benchmark instances.
","[{'version': 'v1', 'created': 'Fri, 24 May 2013 03:36:00 GMT'}]",2013-05-27,"[['Glover', 'Fred', ''], ['Ye', 'Tao', ''], ['Punnen', 'Abraham P.', ''], ['Kochenberger', 'Gary', '']]","['quadratic programming', 'boolean variables', 'metaheuristics', 'tabu search', 'worst-caseanalysis']"
18106,1710.01943,Christoph Treude,"Christoph Treude, Larissa Leite, Maur\'icio Aniche",Unusual Events in GitHub Repositories,Accepted for publication in Journal of Systems and Software,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In large and active software projects, it becomes impractical for a developer
to stay aware of all project activity. While it might not be necessary to know
about each commit or issue, it is arguably important to know about the ones
that are unusual. To investigate this hypothesis, we identified unusual events
in 200 GitHub projects using a comprehensive list of ways in which an artifact
can be unusual and asked 140 developers responsible for or affected by these
events to comment on the usefulness of the corresponding information. Based on
2,096 answers, we identify the subset of unusual events that developers
consider particularly useful, including large code modifications and unusual
amounts of reviewing activity, along with qualitative evidence on the reasons
behind these answers. Our findings provide a means for reducing the amount of
information that developers need to parse in order to stay up to date with
development activity in their projects.
","[{'version': 'v1', 'created': 'Thu, 5 Oct 2017 09:48:21 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Apr 2018 06:02:16 GMT'}]",2018-05-01,"[['Treude', 'Christoph', ''], ['Leite', 'Larissa', ''], ['Aniche', 'Maurício', '']]","['awareness', 'unusual events', 'GitHub']"
18107,1307.2202,Waldemar Gerok,"Waldemar Gerok (1), J\""urgen Peissig (1), Thomas Kaiser (2) ((1)
  Leibniz Universit\""at Hannover, (2) Universit\""at Duisburg-Essen)",TDOA assisted RSSD based localization using UWB and directional antennas,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies the use of directional antennas for received signal
strength difference (RSSD) based localization using ultra-wideband and
demonstrates the achievable accuracy with this localization method applied to
UWB. As introduced in our previous work the RSSD localization is assisted with
one Time Difference of Arrival (TDOA) estimation. The use of directional
receiving antennas and an omni-directional transmitting antenna is assumed.
Localization is performed in 2D. Two localization approaches are considered:
RSSD using statistical channel model and fingerprinting approach. In the case
of statistical channel model simulations are performed using Matlab. In the
case of fingerprinting approach localization is done based on real
indoor-measurements.
","[{'version': 'v1', 'created': 'Mon, 8 Jul 2013 18:57:56 GMT'}]",2013-07-09,"[['Gerok', 'Waldemar', ''], ['Peissig', 'Jürgen', ''], ['Kaiser', 'Thomas', '']]","['UWB', 'RSS', 'RSSD', 'TDOA', 'localization']"
18108,0802.0543,Kazem Jahanbakhsh,"Kazem Jahanbakhsh, Marzieh Hajhosseini","Improving Performance of Cluster Based Routing Protocol using
  Cross-Layer Design",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The main goal of routing protocol is to efficiency delivers data from source
to destination. All routing protocols are the same in this goal, but the way
they adopt to achieve it is different, so routing strategy has an egregious
role on the performance of an ad hoc network. Most of routing protocols
proposed for ad hoc networks have a flat structure. These protocols expand the
control overhead packets to discover or maintain a route. On the other hand a
number of hierarchical-based routing protocols have been developed, mostly are
based on layered design. These protocols improve network performances
especially when the network size grows up since details about remote portion of
network can be handled in an aggregate manner. Although, there is another
approach to design a protocol called cross-layer design. Using this approach
information can exchange between different layer of protocol stack, result in
optimizing network performances.
  In this paper, we intend to exert cross-layer design to optimize Cluster
Based Routing Protocol (Cross-CBRP). Using NS-2 network simulator we evaluate
rate of cluster head changes, throughput and packet delivery ratio. Comparisons
denote that Cross-CBRP has better performances with respect to the original
CBRP.
","[{'version': 'v1', 'created': 'Tue, 5 Feb 2008 02:17:30 GMT'}]",2008-02-06,"[['Jahanbakhsh', 'Kazem', ''], ['Hajhosseini', 'Marzieh', '']]","['Cross-layer design', 'Cross-CBRP', 'Cluster head election']"
18109,1802.07103,George Mertzios,"Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev",Temporal Vertex Cover with a Sliding Time Window,,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern, inherently dynamic systems are usually characterized by a network
structure, i.e. an underlying graph topology, which is subject to discrete
changes over time. Given a static underlying graph $G$, a temporal graph can be
represented via an assignment of a set of integer time-labels to every edge of
$G$, indicating the discrete time steps when this edge is active. While most of
the recent theoretical research on temporal graphs has focused on the notion of
a temporal path and other ""path-related"" temporal notions, only few attempts
have been made to investigate ""non-path"" temporal graph problems. In this
paper, motivated by applications in sensor and in transportation networks, we
introduce and study two natural temporal extensions of the classical problem
Vertex Cover. In both cases we wish to minimize the total number of ""vertex
appearances"" that are needed to ""cover"" the whole temporal graph. In our first
problem, Temporal Vertex Cover, the aim is to cover every edge at least once
during the lifetime of the temporal graph, where an edge can be covered by one
of its endpoints, only at a time step when it is active. In our second, more
pragmatic variation Sliding Window Temporal Vertex Cover, we are also given a
natural number $\Delta$, and our aim is to cover every edge at least once at
every $\Delta$ consecutive time steps. We present a thorough investigation of
the computational complexity and approximability of these two temporal covering
problems. In particular, we provide strong hardness results, complemented by
various approximation and exact algorithms. Some of our algorithms are
polynomial-time, while others are asymptotically almost optimal under the
Exponential Time Hypothesis (ETH) and other plausible complexity assumptions.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 13:24:50 GMT'}, {'version': 'v2', 'created': 'Sun, 17 Mar 2019 16:26:16 GMT'}, {'version': 'v3', 'created': 'Sun, 11 Aug 2019 21:25:36 GMT'}]",2019-08-13,"[['Akrida', 'Eleni C.', ''], ['Mertzios', 'George B.', ''], ['Spirakis', 'Paul G.', ''], ['Zamaraev', 'Viktor', '']]","['Temporal networks', 'temporal vertex cover', 'Exponential Time Hypothesis (ETH)', 'approximation algorithm', 'approximation hardness']"
18110,1511.07174,Bogdan Oancea,"Bogdan Oancea, Tudorel Andrei","Developing a High Performance Software Library with MPI and CUDA for
  Matrix Computations","in Computational Methods for Social Sciences, VOL. I, ISSUE 2/2013","Computational Methods for Social Sciences, VOL. I, ISSUE 2/2013",,,cs.DC cs.MS,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Nowadays, the paradigm of parallel computing is changing. CUDA is now a
popular programming model for general purpose computations on GPUs and a great
number of applications were ported to CUDA obtaining speedups of orders of
magnitude comparing to optimized CPU implementations. Hybrid approaches that
combine the message passing model with the shared memory model for parallel
computing are a solution for very large applications. We considered a
heterogeneous cluster that combines the CPU and GPU computations using MPI and
CUDA for developing a high performance linear algebra library. Our library
deals with large linear systems solvers because they are a common problem in
the fields of science and engineering. Direct methods for computing the
solution of such systems can be very expensive due to high memory requirements
and computational cost. An efficient alternative are iterative methods which
computes only an approximation of the solution. In this paper we present an
implementation of a library that uses a hybrid model of computation using MPI
and CUDA implementing both direct and iterative linear systems solvers. Our
library implements LU and Cholesky factorization based solvers and some of the
non-stationary iterative methods using the MPI/CUDA combination. We compared
the performance of our MPI/CUDA implementation with classic programs written to
be run on a single CPU.
","[{'version': 'v1', 'created': 'Mon, 23 Nov 2015 11:06:12 GMT'}]",2018-02-09,"[['Oancea', 'Bogdan', ''], ['Andrei', 'Tudorel', '']]","['parallel algorithms', 'linear algebra', 'CUDA', 'MPI', 'GPU computing']"
18111,1701.08991,Aleksei Tiulpin,"Aleksei Tiulpin, J\'er\^ome Thevenot, Esa Rahtu, Simo Saarakkala","A novel method for automatic localization of joint area on knee plain
  radiographs",Accepted to Scandinavian Conference on Image Analysis (SCIA) 2017,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Osteoarthritis (OA) is a common musculoskeletal condition typically diagnosed
from radiographic assessment after clinical examination. However, a visual
evaluation made by a practitioner suffers from subjectivity and is highly
dependent on the experience. Computer-aided diagnostics (CAD) could improve the
objectivity of knee radiographic examination. The first essential step of knee
OA CAD is to automatically localize the joint area. However, according to the
literature this task itself remains challenging. The aim of this study was to
develop novel and computationally efficient method to tackle the issue. Here,
three different datasets of knee radiographs were used (n = 473/93/77) to
validate the overall performance of the method. Our pipeline consists of two
parts: anatomically-based joint area proposal and their evaluation using
Histogram of Oriented Gradients and the pre-trained Support Vector Machine
classifier scores. The obtained results for the used datasets show the mean
intersection over the union equal to: 0.84, 0.79 and 0.78. Using a high-end
computer, the method allows to automatically annotate conventional knee
radiographs within 14-16ms and high resolution ones within 170ms. Our results
demonstrate that the developed method is suitable for large-scale analyses.
","[{'version': 'v1', 'created': 'Tue, 31 Jan 2017 11:06:12 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Feb 2017 09:23:16 GMT'}, {'version': 'v3', 'created': 'Wed, 5 Apr 2017 20:05:02 GMT'}]",2017-04-07,"[['Tiulpin', 'Aleksei', ''], ['Thevenot', 'Jérôme', ''], ['Rahtu', 'Esa', ''], ['Saarakkala', 'Simo', '']]","['Knee Radiographs', 'Medical Image Analysis', 'Object localization', 'Proposal generation']"
18112,1007.0484,Blaine Nelson,"Blaine Nelson and Benjamin I. P. Rubinstein and Ling Huang and Anthony
  D. Joseph and Steven J. Lee and Satish Rao and J. D. Tygar",Query Strategies for Evading Convex-Inducing Classifiers,,,,,cs.LG cs.CR cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classifiers are often used to detect miscreant activities. We study how an
adversary can systematically query a classifier to elicit information that
allows the adversary to evade detection while incurring a near-minimal cost of
modifying their intended malfeasance. We generalize the theory of Lowd and Meek
(2005) to the family of convex-inducing classifiers that partition input space
into two sets one of which is convex. We present query algorithms for this
family that construct undetected instances of approximately minimal cost using
only polynomially-many queries in the dimension of the space and in the level
of approximation. Our results demonstrate that near-optimal evasion can be
accomplished without reverse-engineering the classifier's decision boundary. We
also consider general lp costs and show that near-optimal evasion on the family
of convex-inducing classifiers is generally efficient for both positive and
negative convexity for all levels of approximation if p=1.
","[{'version': 'v1', 'created': 'Sat, 3 Jul 2010 09:04:44 GMT'}]",2010-07-06,"[['Nelson', 'Blaine', ''], ['Rubinstein', 'Benjamin I. P.', ''], ['Huang', 'Ling', ''], ['Joseph', 'Anthony D.', ''], ['Lee', 'Steven J.', ''], ['Rao', 'Satish', ''], ['Tygar', 'J. D.', '']]","['Query Algorithms', 'Evasion', 'Reverse Engineering', 'Adversarial Learning']"
18113,0908.3090,Bela Genge,"Bela Genge, Piroska Haller",A Modeling Framework for Generating Security Protocol Specifications,"10th International Symposium on Symbolic and Numeric Algorithms for
  Scientific Computing (SYNASC'08), Workshop on Global Computing Models and
  Technologies, Timisoara, Romania, Sept. 2008, pp. 362-365, ISBN
  978-0-7695-3523-4",,,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a modeling framework for generating security protocol
specifications. The generated protocol specifications rely on the use of a
sequential and a semantical component. The first component defines protocol
properties such as preconditions, effects, message sequences and it is
developed as a WSDL-S specification. The second component defines the semantic
aspects corresponding to the messages included in the first component by the
use of ontological constructions and it is developed as an OWL-based
specification. Our approach was validated on 13 protocols from which we
mention: the ISO9798 protocol, the CCITTX.509 data transfer protocol and the
Kerberos symmetric key protocol.
","[{'version': 'v1', 'created': 'Fri, 21 Aug 2009 10:16:25 GMT'}]",2009-08-24,"[['Genge', 'Bela', ''], ['Haller', 'Piroska', '']]","['security protocol', 'framework', 'specification', 'ontology']"
18114,0709.1701,Jean Dezert,"Xinde Li (ICRL), Xinhan Huang (ICRL), Florentin Smarandache (UNM),
  Jean Dezert (ONERA)",Enrichment of Qualitative Beliefs for Reasoning under Uncertainty,12 pages,,,,cs.AI,,"  This paper deals with enriched qualitative belief functions for reasoning
under uncertainty and for combining information expressed in natural language
through linguistic labels. In this work, two possible enrichments (quantitative
and/or qualitative) of linguistic labels are considered and operators
(addition, multiplication, division, etc) for dealing with them are proposed
and explained. We denote them $qe$-operators, $qe$ standing for
""qualitative-enriched"" operators. These operators can be seen as a direct
extension of the classical qualitative operators ($q$-operators) proposed
recently in the Dezert-Smarandache Theory of plausible and paradoxist reasoning
(DSmT). $q$-operators are also justified in details in this paper. The
quantitative enrichment of linguistic label is a numerical supporting degree in
$[0,\infty)$, while the qualitative enrichment takes its values in a finite
ordered set of linguistic values. Quantitative enrichment is less precise than
qualitative enrichment, but it is expected more close with what human experts
can easily provide when expressing linguistic labels with supporting degrees.
Two simple examples are given to show how the fusion of qualitative-enriched
belief assignments can be done.
","[{'version': 'v1', 'created': 'Tue, 11 Sep 2007 19:12:25 GMT'}]",2007-09-12,"[['Li', 'Xinde', '', 'ICRL'], ['Huang', 'Xinhan', '', 'ICRL'], ['Smarandache', 'Florentin', '', 'UNM'], ['Dezert', 'Jean', '', 'ONERA']]","['Information fusion', 'Qualitative beliefs', 'DSmT', 'DST']"
18115,1011.0539,R Kalaiarasi,"R. Kalaiarasi, Getsy S. Sara, S. Neelavathy Pari and D. Sridharan","Performance Analysis of Contention Window Cheating Misbehaviors in
  Mobile Ad Hoc Networks","12 pages,4 figures, 1 table","International journal of computer science & information Technology
  (IJCSIT) Vol.2, No.5, October 2010",,EFI-94-11,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile Ad Hoc Network (MANET) is a collection of nodes that can be rapidly
deployed as a multi-hop network without the aid of any centralized
administration. Misbehavior is challenged by bandwidth and energy efficient
medium access control and fair share of throughput. Node misbehavior plays an
important role in MANET. In this survey, few of the contention window
misbehavior is reviewed and compared. The contention window cheating either
minimizes the active communication of the network or reduces bandwidth
utilization of a particular node. The classification presented is in no case
unique but summarizes the chief characteristics of many published proposals for
contention window cheating. After getting insight into the different contention
window misbehavior, few of the enhancements that can be done to improve the
existing contention window are suggested. The purpose of this paper is to
facilitate the research efforts in combining the existing solutions to offer
more efficient methods to reduce contention window cheating mechanisms.
","[{'version': 'v1', 'created': 'Tue, 2 Nov 2010 08:38:50 GMT'}]",2010-11-03,"[['Kalaiarasi', 'R.', ''], ['Sara', 'Getsy S.', ''], ['Pari', 'S. Neelavathy', ''], ['Sridharan', 'D.', '']]","['Mobile ad hoc network', 'Backoff manipulation', 'Throughput', 'Packet Delivery Ratio', 'Comparison']"
18116,1412.6079,Hamid Izadinia,"Fereshteh Sadeghi, Hamid Izadinia",Decoding the Text Encoding,5 pages,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Word clouds and text visualization is one of the recent most popular and
widely used types of visualizations. Despite the attractiveness and simplicity
of producing word clouds, they do not provide a thorough visualization for the
distribution of the underlying data. Therefore, it is important to redesign
word clouds for improving their design choices and to be able to do further
statistical analysis on data. In this paper we have proposed a fully automatic
redesigning algorithm for word cloud visualization. Our proposed method is able
to decode an input word cloud visualization and provides the raw data in the
form of a list of (word, value) pairs. To the best of our knowledge our work is
the first attempt to extract raw data from word cloud visualization. We have
tested our proposed method both qualitatively and quantitatively. The results
of our experiments show that our algorithm is able to extract the words and
their weights effectively with considerable low error rate.
","[{'version': 'v1', 'created': 'Tue, 16 Dec 2014 04:34:16 GMT'}]",2014-12-19,"[['Sadeghi', 'Fereshteh', ''], ['Izadinia', 'Hamid', '']]","['Diagram understanding', 'visualization redesign', 'text visualization', 'computer vision', 'word cloud']"
18117,1708.00543,Sarath Sreedharan,"Tathagata Chakraborti, Sarath Sreedharan and Subbarao Kambhampati",Balancing Explicability and Explanation in Human-Aware Planning,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human aware planning requires an agent to be aware of the intentions,
capabilities and mental model of the human in the loop during its decision
process. This can involve generating plans that are explicable to a human
observer as well as the ability to provide explanations when such plans cannot
be generated. This has led to the notion ""multi-model planning"" which aim to
incorporate effects of human expectation in the deliberative process of a
planner - either in the form of explicable task planning or explanations
produced thereof. In this paper, we bring these two concepts together and show
how a planner can account for both these needs and achieve a trade-off during
the plan generation process itself by means of a model-space search method
MEGA. This in effect provides a comprehensive perspective of what it means for
a decision making agent to be ""human-aware"" by bringing together existing
principles of planning under the umbrella of a single plan generation process.
We situate our discussion specifically keeping in mind the recent work on
explicable planning and explanation generation, and illustrate these concepts
in modified versions of two well known planning domains, as well as a
demonstration on a robot involved in a typical search and reconnaissance task
with an external supervisor.
","[{'version': 'v1', 'created': 'Tue, 1 Aug 2017 22:47:42 GMT'}, {'version': 'v2', 'created': 'Sat, 3 Feb 2018 19:04:43 GMT'}]",2018-02-06,"[['Chakraborti', 'Tathagata', ''], ['Sreedharan', 'Sarath', ''], ['Kambhampati', 'Subbarao', '']]","['Human-Aware Planning', 'Explicable Planning', 'Plan Explanations', 'Explanation as Model Reconciliation', 'Minimal Explanations']"
18118,1701.08968,Nhan Truong,"Nhan Truong, Levin Kuhlmann, Mohammad Reza Bonyadi, Jiawei Yang,
  Andrew Faulks, Omid Kavehei","Supervised Learning in Automatic Channel Selection for Epileptic Seizure
  Detection",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Detecting seizure using brain neuroactivations recorded by intracranial
electroencephalogram (iEEG) has been widely used for monitoring, diagnosing,
and closed-loop therapy of epileptic patients, however, computational
efficiency gains are needed if state-of-the-art methods are to be implemented
in implanted devices. We present a novel method for automatic seizure detection
based on iEEG data that outperforms current state-of-the-art seizure detection
methods in terms of computational efficiency while maintaining the accuracy.
The proposed algorithm incorporates an automatic channel selection (ACS) engine
as a pre-processing stage to the seizure detection procedure. The ACS engine
consists of supervised classifiers which aim to find iEEGchannelswhich
contribute the most to a seizure. Seizure detection stage involves feature
extraction and classification. Feature extraction is performed in both
frequency and time domains where spectral power and correlation between channel
pairs are calculated. Random Forest is used in classification of interictal,
ictal and early ictal periods of iEEG signals. Seizure detection in this paper
is retrospective and patient-specific. iEEG data is accessed via Kaggle,
provided by International Epilepsy Electro-physiology Portal. The dataset
includes a training set of 6.5 hours of interictal data and 41 minin ictal data
and a test set of 9.14 hours. Compared to the state-of-the-art on the same
dataset, we achieve 49.4% increase in computational efficiency and 400 mins
better in average for detection delay. The proposed model is able to detect a
seizure onset at 91.95% sensitivity and 94.05% specificity with a mean
detection delay of 2.77 s. The area under the curve (AUC) is 96.44%, that is
comparable to the current state-of-the-art with AUC of 96.29%.
","[{'version': 'v1', 'created': 'Tue, 31 Jan 2017 10:01:45 GMT'}]",2017-02-01,"[['Truong', 'Nhan', ''], ['Kuhlmann', 'Levin', ''], ['Bonyadi', 'Mohammad Reza', ''], ['Yang', 'Jiawei', ''], ['Faulks', 'Andrew', ''], ['Kavehei', 'Omid', '']]","['seizure detection', 'iEEG', 'Random Forest', 'automatic channel selection']"
18119,1710.06000,Marek Szyku{\l}a,"Janusz Brzozowski, Lila Kari, Bai Li, Marek Szyku{\l}a",State Complexity of Overlap Assembly,,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The \emph{state complexity} of a regular language $L_m$ is the number $m$ of
states in a minimal deterministic finite automaton (DFA) accepting $L_m$. The
state complexity of a regularity-preserving binary operation on regular
languages is defined as the maximal state complexity of the result of the
operation where the two operands range over all languages of state complexities
$\le m$ and $\le n$, respectively. We find a tight upper bound on the state
complexity of the binary operation \emph{overlap assembly} on regular
languages. This operation was introduced by Csuhaj-Varj\'u, Petre, and Vaszil
to model the process of self-assembly of two linear DNA strands into a longer
DNA strand, provided that their ends ""overlap"". We prove that the state
complexity of the overlap assembly of languages $L_m$ and $L_n$, where $m\ge 2$
and $n\ge1$, is at most $2 (m-1) 3^{n-1} + 2^n$. Moreover, for $m \ge 2$ and $n
\ge 3$ there exist languages $L_m$ and $L_n$ over an alphabet of size $n$ whose
overlap assembly meets the upper bound and this bound cannot be met with
smaller alphabets. Finally, we prove that $m+n$ is a tight upper bound on the
overlap assembly of unary languages, and that there are binary languages whose
overlap assembly has exponential state complexity at least $m(2^{n-1}-2)+2$.
","[{'version': 'v1', 'created': 'Mon, 16 Oct 2017 20:58:17 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Dec 2017 20:47:23 GMT'}, {'version': 'v3', 'created': 'Thu, 10 May 2018 17:03:40 GMT'}, {'version': 'v4', 'created': 'Tue, 11 Dec 2018 21:47:28 GMT'}]",2018-12-13,"[['Brzozowski', 'Janusz', ''], ['Kari', 'Lila', ''], ['Li', 'Bai', ''], ['Szykuła', 'Marek', '']]","['overlap assembly', 'regular language', 'state complexity', 'tight upper bound']"
18120,1605.02269,Zhiyun Ren,"Zhiyun Ren, Huzefa Rangwala, Aditya Johri",Predicting Performance on MOOC Assessments using Multi-Regression Models,"8 pages, 7 figures",,,,cs.CY cs.LG,http://creativecommons.org/licenses/by/4.0/,"  The past few years has seen the rapid growth of data min- ing approaches for
the analysis of data obtained from Mas- sive Open Online Courses (MOOCs). The
objectives of this study are to develop approaches to predict the scores a stu-
dent may achieve on a given grade-related assessment based on information,
considered as prior performance or prior ac- tivity in the course. We develop a
personalized linear mul- tiple regression (PLMR) model to predict the grade for
a student, prior to attempting the assessment activity. The developed model is
real-time and tracks the participation of a student within a MOOC (via
click-stream server logs) and predicts the performance of a student on the next
as- sessment within the course offering. We perform a com- prehensive set of
experiments on data obtained from three openEdX MOOCs via a Stanford University
initiative. Our experimental results show the promise of the proposed ap-
proach in comparison to baseline approaches and also helps in identification of
key features that are associated with the study habits and learning behaviors
of students.
","[{'version': 'v1', 'created': 'Sun, 8 May 2016 04:00:31 GMT'}]",2016-05-10,"[['Ren', 'Zhiyun', ''], ['Rangwala', 'Huzefa', ''], ['Johri', 'Aditya', '']]","['Personalized Linear Multi-Regression Models', 'MOOC', 'Performance prediction']"
18121,1401.1124,Yu Chen,"Yu Chen, Weicheng Xie, Xiufen Zou","A binary differential evolution algorithm learning from explored
  solutions",,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although real-coded differential evolution (DE) algorithms can perform well
on continuous optimization problems (CoOPs), it is still a challenging task to
design an efficient binary-coded DE algorithm. Inspired by the learning
mechanism of particle swarm optimization (PSO) algorithms, we propose a binary
learning differential evolution (BLDE) algorithm that can efficiently locate
the global optimal solutions by learning from the last population. Then, we
theoretically prove the global convergence of BLDE, and compare it with some
existing binary-coded evolutionary algorithms (EAs) via numerical experiments.
Numerical results show that BLDE is competitive to the compared EAs, and
meanwhile, further study is performed via the change curves of a renewal metric
and a refinement metric to investigate why BLDE cannot outperform some compared
EAs for several selected benchmark problems. Finally, we employ BLDE solving
the unit commitment problem (UCP) in power systems to show its applicability in
practical problems.
","[{'version': 'v1', 'created': 'Mon, 6 Jan 2014 15:54:16 GMT'}, {'version': 'v2', 'created': 'Sat, 10 May 2014 13:01:45 GMT'}]",2014-05-13,"[['Chen', 'Yu', ''], ['Xie', 'Weicheng', ''], ['Zou', 'Xiufen', '']]","['Binary differential evolution algorithm', 'Convergence in probability', 'Renewal metric', 'Refinement metric']"
18122,1207.5871,Haizhang Zhang,"Rui Wang, Haizhang Zhang",Optimal Sampling Points in Reproducing Kernel Hilbert Spaces,,,,,cs.IT math.IT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The recent developments of basis pursuit and compressed sensing seek to
extract information from as few samples as possible. In such applications,
since the number of samples is restricted, one should deploy the sampling
points wisely. We are motivated to study the optimal distribution of finite
sampling points. Formulation under the framework of optimal reconstruction
yields a minimization problem. In the discrete case, we estimate the distance
between the optimal subspace resulting from a general Karhunen-Loeve transform
and the kernel space to obtain another algorithm that is computationally
favorable. Numerical experiments are then presented to illustrate the
performance of the algorithms for the searching of optimal sampling points.
","[{'version': 'v1', 'created': 'Wed, 25 Jul 2012 02:43:12 GMT'}]",2012-07-26,"[['Wang', 'Rui', ''], ['Zhang', 'Haizhang', '']]","['sampling points', 'optimal distribution', 'reproducing kernels', 'the Karhunen-Lo`evetransform']"
18123,0801.0815,Yuval Kochman,Yuval Kochman and Ram Zamir,Joint Wyner-Ziv/Dirty Paper coding by modulo-lattice modulation,"Submitted to IEEE Transactions on Information Theory. Presented in
  part in ISIT-2006, Seattle. New version after review",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The combination of source coding with decoder side-information (Wyner-Ziv
problem) and channel coding with encoder side-information (Gel'fand-Pinsker
problem) can be optimally solved using the separation principle. In this work
we show an alternative scheme for the quadratic-Gaussian case, which merges
source and channel coding. This scheme achieves the optimal performance by a
applying modulo-lattice modulation to the analog source. Thus it saves the
complexity of quantization and channel decoding, and remains with the task of
""shaping"" only. Furthermore, for high signal-to-noise ratio (SNR), the scheme
approaches the optimal performance using an SNR-independent encoder, thus it is
robust to unknown SNR at the encoder.
","[{'version': 'v1', 'created': 'Sat, 5 Jan 2008 15:40:57 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Jan 2008 09:10:35 GMT'}, {'version': 'v3', 'created': 'Wed, 17 Dec 2008 13:01:40 GMT'}]",2008-12-17,"[['Kochman', 'Yuval', ''], ['Zamir', 'Ram', '']]","['joint source/channel coding', 'analog transmission', 'Wyner-Ziv problem', 'writing on dirty']"
18124,1609.06018,Junxuan Chen,"Junxuan Chen, Baigui Sun, Hao Li, Hongtao Lu, Xian-Sheng Hua",Deep CTR Prediction in Display Advertising,"This manuscript is the accepted version for ACM Multimedia Conference
  2016",,,,cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Click through rate (CTR) prediction of image ads is the core task of online
display advertising systems, and logistic regression (LR) has been frequently
applied as the prediction model. However, LR model lacks the ability of
extracting complex and intrinsic nonlinear features from handcrafted
high-dimensional image features, which limits its effectiveness. To solve this
issue, in this paper, we introduce a novel deep neural network (DNN) based
model that directly predicts the CTR of an image ad based on raw image pixels
and other basic features in one step. The DNN model employs convolution layers
to automatically extract representative visual features from images, and
nonlinear CTR features are then learned from visual features and other
contextual features by using fully-connected layers. Empirical evaluations on a
real world dataset with over 50 million records demonstrate the effectiveness
and efficiency of this method.
","[{'version': 'v1', 'created': 'Tue, 20 Sep 2016 04:50:03 GMT'}]",2016-09-21,"[['Chen', 'Junxuan', ''], ['Sun', 'Baigui', ''], ['Li', 'Hao', ''], ['Lu', 'Hongtao', ''], ['Hua', 'Xian-Sheng', '']]","['DNN', 'CNN', 'Click through rate', 'Image Ads', 'Display Advertising']"
18125,1502.04383,Dacheng Tao,"Changxing Ding, Dacheng Tao",A Comprehensive Survey on Pose-Invariant Face Recognition,"final version, ACM Transactions on Intelligent Systems and
  Technology, 2016",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The capacity to recognize faces under varied poses is a fundamental human
ability that presents a unique challenge for computer vision systems. Compared
to frontal face recognition, which has been intensively studied and has
gradually matured in the past few decades, pose-invariant face recognition
(PIFR) remains a largely unsolved problem. However, PIFR is crucial to
realizing the full potential of face recognition for real-world applications,
since face recognition is intrinsically a passive biometric technology for
recognizing uncooperative subjects. In this paper, we discuss the inherent
difficulties in PIFR and present a comprehensive review of established
techniques. Existing PIFR methods can be grouped into four categories, i.e.,
pose-robust feature extraction approaches, multi-view subspace learning
approaches, face synthesis approaches, and hybrid approaches. The motivations,
strategies, pros/cons, and performance of representative approaches are
described and compared. Moreover, promising directions for future research are
discussed.
","[{'version': 'v1', 'created': 'Sun, 15 Feb 2015 23:25:32 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Jul 2015 09:42:50 GMT'}, {'version': 'v3', 'created': 'Sat, 16 Jul 2016 06:40:18 GMT'}]",2016-07-19,"[['Ding', 'Changxing', ''], ['Tao', 'Dacheng', '']]","['Pose-invariant face recognition', 'pose-robust feature', 'multi-view learning', 'face synthesis', 'survey']"
18126,1208.3943,Jay Gholap B.Tech.(Computer Engineering),Jay Gholap,Performance Tuning Of J48 Algorithm For Prediction Of Soil Fertility,5 Pages,"Published in Asian Journal of Computer Science and Information
  Technology,Vol 2,No. 8 (2012)",,,cs.LG cs.DB cs.PF stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data mining involves the systematic analysis of large data sets, and data
mining in agricultural soil datasets is exciting and modern research area. The
productive capacity of a soil depends on soil fertility. Achieving and
maintaining appropriate levels of soil fertility, is of utmost importance if
agricultural land is to remain capable of nourishing crop production. In this
research, Steps for building a predictive model of soil fertility have been
explained.
  This paper aims at predicting soil fertility class using decision tree
algorithms in data mining . Further, it focuses on performance tuning of J48
decision tree algorithm with the help of meta-techniques such as attribute
selection and boosting.
","[{'version': 'v1', 'created': 'Mon, 20 Aug 2012 08:48:40 GMT'}]",2012-08-21,"[['Gholap', 'Jay', '']]","['performance tuning', 'prediction', 'agriculture', 'soil testing', 'data mining', 'classification']"
18127,1505.04041,Bikramjit Singh,Bikramjit Singh,Repeated Games for Inter-operator Spectrum Sharing,"Master Thesis, Published on 25/8/2014, Aalto University
  (https://aaltodoc.aalto.fi/handle/123456789/13922)",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As wireless communication becomes an ever-more evolving and pervasive part of
the existing world, system capacity and Quality of Service (QoS) provisioning
are becoming more critically evident. In order to improve system capacity and
QoS, it is mandatory that we pay closer attention to operational bandwidth
efficiency issues. We address this issue for two operators' spectrum sharing in
the same geographical area.
  We model and analyze interactions between the competitive operators
coexisting in the same frequency band as a strategic noncooperative game, where
the operators simultaneously share the spectrum dynamically as per their
relative requirement. If resources are allocated in a conventional way (static
orthogonal allocation), spectrum utilization becomes inefficient when there is
load asymmetry between the operators and low inter-operator interference.
  Theoretically, operators can share resources in a cooperative manner, but
pragmatically they are reluctant to reveal their network information to
competitors. By using game theory, we design a distributed implementation, in
which self-interested operators play strategies and contend for the spectrum
resources in a noncooperative manner. We have proposed two game theoretic
approaches in the thesis, one using a virtual carrier price; and the other
based on a mutual history of favors. The former approach takes into account a
penalty proportional to spectrum usage in its utility function, whereas in the
latter, operators play strategies based on their history of interactions, i.e.,
how well the other behaved in the past. Finally, based on the simulations, we
assess the performance of the proposed game theoretic approaches in comparison
to existing conventional allocations.
","[{'version': 'v1', 'created': 'Fri, 15 May 2015 12:04:00 GMT'}]",2015-05-18,"[['Singh', 'Bikramjit', '']]","['game theory', 'inter-operator spectrum sharing', 'noncooperative game', 'cooperative spectrum sharing', 'carrier price', 'surplus']"
18128,1610.09411,C. Seshadhri,Ali Pinar and C. Seshadhri and V. Vishal,ESCAPE: Efficiently Counting All 5-Vertex Subgraphs,,,,,cs.SI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Counting the frequency of small subgraphs is a fundamental technique in
network analysis across various domains, most notably in bioinformatics and
social networks. The special case of triangle counting has received much
attention. Getting results for 4-vertex or 5-vertex patterns is highly
challenging, and there are few practical results known that can scale to
massive sizes.
  We introduce an algorithmic framework that can be adopted to count any small
pattern in a graph and apply this framework to compute exact counts for
\emph{all} 5-vertex subgraphs. Our framework is built on cutting a pattern into
smaller ones, and using counts of smaller patterns to get larger counts.
Furthermore, we exploit degree orientations of the graph to reduce runtimes
even further. These methods avoid the combinatorial explosion that typical
subgraph counting algorithms face. We prove that it suffices to enumerate only
four specific subgraphs (three of them have less than 5 vertices) to exactly
count all 5-vertex patterns.
  We perform extensive empirical experiments on a variety of real-world graphs.
We are able to compute counts of graphs with tens of millions of edges in
minutes on a commodity machine. To the best of our knowledge, this is the first
practical algorithm for $5$-vertex pattern counting that runs at this scale. A
stepping stone to our main algorithm is a fast method for counting all
$4$-vertex patterns. This algorithm is typically ten times faster than the
state of the art $4$-vertex counters.
","[{'version': 'v1', 'created': 'Fri, 28 Oct 2016 21:49:44 GMT'}]",2016-11-01,"[['Pinar', 'Ali', ''], ['Seshadhri', 'C.', ''], ['Vishal', 'V.', '']]","['motif analysis', 'subgraph counting', 'graph orientations']"
18129,1704.05660,Freeson Kaniwa,"Freeson Kaniwa, Venu Madhav Kuthadi, Otlhapile Dinakenyane and Heiko
  Schroeder","Alphabet-dependent Parallel Algorithm for Suffix Tree Construction for
  Pattern Searching",,"International Journal of Grid and Distributed Computing, Vol. 10,
  No. 1 (2017), pp.9-20",,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Suffix trees have recently become very successful data structures in handling
large data sequences such as DNA or Protein sequences. Consequently parallel
architectures have become ubiquitous. We present a novel alphabet-dependent
parallel algorithm which attempts to take advantage of the perverseness of the
multicore architecture. Microsatellites are important for their biological
relevance hence our algorithm is based on time efficient construction for
identification of such. We experimentally achieved up to 15x speedup over the
sequential algorithm on different input sizes of biological sequences.
","[{'version': 'v1', 'created': 'Wed, 19 Apr 2017 09:08:55 GMT'}]",2017-04-20,"[['Kaniwa', 'Freeson', ''], ['Kuthadi', 'Venu Madhav', ''], ['Dinakenyane', 'Otlhapile', ''], ['Schroeder', 'Heiko', '']]","['Suffix Trees', 'Parallel Algorithm', 'DNA Sequences']"
18130,0903.1451,Frederic Dambreville,Frederic Dambreville (DGA/Cta/DT/Gip),Definition of evidence fusion rules on the basis of Referee Functions,,,,,cs.AI math.PR stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This chapter defines a new concept and framework for constructing fusion
rules for evidences. This framework is based on a referee function, which does
a decisional arbitrament conditionally to basic decisions provided by the
several sources of information. A simple sampling method is derived from this
framework. The purpose of this sampling approach is to avoid the combinatorics
which are inherent to the definition of fusion rules of evidences. This
definition of the fusion rule by the means of a sampling process makes possible
the construction of several rules on the basis of an algorithmic implementation
of the referee function, instead of a mathematical formulation. Incidentally,
it is a versatile and intuitive way for defining rules. The framework is
implemented for various well known evidence rules. On the basis of this
framework, new rules for combining evidences are proposed, which takes into
account a consensual evaluation of the sources of information.
","[{'version': 'v1', 'created': 'Sun, 8 Mar 2009 19:59:39 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Mar 2009 11:49:20 GMT'}]",2009-03-30,"[['Dambreville', 'Frederic', '', 'DGA/Cta/DT/Gip']]","['Evidence', 'Referee Function', 'Sampling', 'Dempster-Shaferrule', 'PCR6']"
18131,1301.0188,Deepali Virmani,"Deepali Virmani, Satbir Jain","Reliable Robust and Real-Time Communication Protocol for Data Delivery
  in Wireless sensor Networks","15 pages, 6 figures","International Journal of Information Technology and Knowledge
  Management 2011, Volume 4, No. 2, pp. 595-601",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  WSNs can be considered a distributed control system designed to react to
sensor information with an effective and timely action. For this reason, in
WSNs it is important to provide real-time coordination and communication to
guarantee timely execution of the right actions. In this paper a new
communication protocol RRRT to support robust real-time and reliable event data
delivery with minimum energy consumption and with congestion avoidance in WSNs
is proposed. The proposed protocol uses the fault tolerant optimal path for
data delivery. The proposed solution dynamically adjust their protocol
configurations to adapt to the heterogeneous characteristics of WSNs.
Specifically, the interactions between contention resolution and congestion
control mechanisms as well as the physical layer effects in WSNs are
investigated.
","[{'version': 'v1', 'created': 'Wed, 2 Jan 2013 08:43:25 GMT'}]",2013-01-03,"[['Virmani', 'Deepali', ''], ['Jain', 'Satbir', '']]","['Real-time', 'reliable', 'robust', 'congestion', 'energy consumption']"
18132,2006.04227,Sina Sharif Mansouri,"Sina Sharif Mansouri, Christoforos Kanellakis, Emil Fresk, Bjorn
  Lindqvist, Dariusz Kominiak, Anton Koval, Pantelis Sopasakis, George
  Nikolakopoulos","Subterranean MAV Navigation based on Nonlinear MPC with Collision
  Avoidance Constraints",,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Micro Aerial Vehicles (MAVs) navigation in subterranean environments is
gaining attention in the field of aerial robotics, however there are still
multiple challenges for collision free navigation in such harsh environments.
This article proposes a novel baseline solution for collision free navigation
with Nonlinear Model Predictive Control (NMPC). In the proposed method, the MAV
is considered as a floating object, where the velocities on the $x$, $y$ axes
and the position on altitude are the references for the NMPC to navigate along
the tunnel, while the NMPC avoids the collision by considering kinematics of
the obstacles based on measurements from a 2D lidar. Moreover, a novel approach
for correcting the heading of the MAV towards the center of the mine tunnel is
proposed, while the efficacy of the suggested framework has been evaluated in
multiple field trials in an underground mine in Sweden.
","[{'version': 'v1', 'created': 'Sun, 7 Jun 2020 18:48:31 GMT'}]",2020-06-09,"[['Mansouri', 'Sina Sharif', ''], ['Kanellakis', 'Christoforos', ''], ['Fresk', 'Emil', ''], ['Lindqvist', 'Bjorn', ''], ['Kominiak', 'Dariusz', ''], ['Koval', 'Anton', ''], ['Sopasakis', 'Pantelis', ''], ['Nikolakopoulos', 'George', '']]","['NMPC', 'Collision Avoidance', 'Subterranean', 'MAV', 'Autonomous Tunnel Inspection', 'Mining Aerial Robotics']"
18133,0804.1760,Michel Grabisch,Michel Grabisch (LIP6),The Symmetric Sugeno Integral,,Fuzzy Sets and Systems 139 (2003) 473-490,,,cs.DM math.PR math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an extension of the Sugeno integral for negative numbers, in the
spirit of the symmetric extension of Choquet integral, also called \Sipos\
integral. Our framework is purely ordinal, since the Sugeno integral has its
interest when the underlying structure is ordinal. We begin by defining
negative numbers on a linearly ordered set, and we endow this new structure
with a suitable algebra, very close to the ring of real numbers. In a second
step, we introduce the M\""obius transform on this new structure. Lastly, we
define the symmetric Sugeno integral, and show its similarity with the
symmetric Choquet integral.
","[{'version': 'v1', 'created': 'Thu, 10 Apr 2008 17:00:36 GMT'}]",2008-12-18,"[['Grabisch', 'Michel', '', 'LIP6']]","['fuzzy measure', 'ordinal scale', 'Sugeno integral', 'M¨obius transform', 'symmetric integral']"
18134,1610.03039,Morsal Madani,Homayun Motameni and Mirmorsal Madani,"A Survey of Approaches and Challenges in the Real-time Multimedia
  Streaming",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a brief summary of current approaches and challenges in the
network traffic management area. In this contribution, we well cover the most
recent experiments on the network traffic and behavior of applications under
various network conditions. Quality of the users' experience is the most
important factor being considered in this group of experiments.
","[{'version': 'v1', 'created': 'Mon, 10 Oct 2016 19:29:53 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Oct 2016 14:02:42 GMT'}]",2016-10-26,"[['Motameni', 'Homayun', ''], ['Madani', 'Mirmorsal', '']]","['Network Traffic Measurement', 'Quality of Experience', 'Streaming Data']"
18135,0907.3208,Serge Gaspers,"Fedor V. Fomin, Serge Gaspers, Saket Saurabh, and St\'ephan Thomass\'e",A Linear Vertex Kernel for Maximum Internal Spanning Tree,,,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a polynomial time algorithm that for any graph G and integer k >=
0, either finds a spanning tree with at least k internal vertices, or outputs a
new graph G' on at most 3k vertices and an integer k' such that G has a
spanning tree with at least k internal vertices if and only if G' has a
spanning tree with at least k' internal vertices. In other words, we show that
the Maximum Internal Spanning Tree problem parameterized by the number of
internal vertices k, has a 3k-vertex kernel. Our result is based on an
innovative application of a classical min-max result about hypertrees in
hypergraphs which states that ""a hypergraph H contains a hypertree if and only
if H is partition connected.""
","[{'version': 'v1', 'created': 'Mon, 20 Jul 2009 18:50:55 GMT'}, {'version': 'v2', 'created': 'Sat, 3 Mar 2012 18:23:27 GMT'}]",2012-03-06,"[['Fomin', 'Fedor V.', ''], ['Gaspers', 'Serge', ''], ['Saurabh', 'Saket', ''], ['Thomassé', 'Stéphan', '']]","['algorithm', 'crown decomposition', 'kernelization', 'parameterized complexity', 'preprocessing']"
18136,1410.0948,Eug\'enio Rodrigues,"Eug\'enio Rodrigues, Ad\'elio R. Gaspar, \'Alvaro Gomes and Manuel
  Gameiro da Silva","Contributions of natural ventilation on thermal performance of
  alternative floor plan designs","8 pages, 2 figures, Proceeding of RoomVent 2014",,,,cs.NE cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During the earliest phase of architectural design process, practitioners
after analyzing the client's design program, legal requirements, topographic
constraints, and preferences synthesize these requirements into architectural
floor plan drawings. Design decisions taken in this phase may significantly
contribute to the building performance. On account of this reason, it is
important to estimate and compare alternative solutions, when it is still
manageable to change the building design.
  The authors have been developing a prototype tool to assist architects during
this initial design phase. It is made up of two algorithms. The first algorithm
generates alternative floor plans according to the architect's preferences and
requirements, and the client's design program. It consists in one evolutionary
strategy approach enhanced with local search technique to allocate rooms on
several levels in the two-dimensional space. The second algorithm evaluates,
ranks, and optimizes those floor plans according to thermal performance
criteria. The prototype tool is coupled with dynamic simulation program, which
estimates the thermal behavior of each solution. A sequential variable
optimization is used to change several geometric values of different
architectural elements in the floor plans to explore the improvement potential.
  In the present communication, the two algorithms are used in an iterative
process to generate and optimize the thermal performance of alternative floor
plans. In the building simulation specifications of EnergyPlus program, the
airflow network model has been used in order to adequately model the air
infiltration and the airflows through indoor spaces. A case study of a
single-family house with three rooms in a single level is presented.
","[{'version': 'v1', 'created': 'Fri, 3 Oct 2014 19:36:37 GMT'}]",2014-10-06,"[['Rodrigues', 'Eugénio', ''], ['Gaspar', 'Adélio R.', ''], ['Gomes', 'Álvaro', ''], ['da Silva', 'Manuel Gameiro', '']]","['space planning', 'natural ventilation', 'dynamic simulation', 'airflows', 'floor plan design   1 Introduction']"
18137,1511.09231,Zhun Sun,"Zhun Sun, Mete Ozay, Takayuki Okatani","Design of Kernels in Convolutional Neural Networks for Image
  Classification",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the effectiveness of Convolutional Neural Networks (CNNs) for image
classification, our understanding of the relationship between shape of
convolution kernels and learned representations is limited. In this work, we
explore and employ the relationship between shape of kernels which define
Receptive Fields (RFs) in CNNs for learning of feature representations and
image classification. For this purpose, we first propose a feature
visualization method for visualization of pixel-wise classification score maps
of learned features. Motivated by our experimental results, and observations
reported in the literature for modeling of visual systems, we propose a novel
design of shape of kernels for learning of representations in CNNs. In the
experimental results, we achieved a state-of-the-art classification performance
compared to a base CNN model [28] by reducing the number of parameters and
computational time of the model using the ILSVRC-2012 dataset [24]. The
proposed models also outperform the state-of-the-art models employed on the
CIFAR-10/100 datasets [12] for image classification. Additionally, we analyzed
the robustness of the proposed method to occlusion for classification of
partially occluded images compared with the state-of-the-art methods. Our
results indicate the effectiveness of the proposed approach. The code is
available in github.com/minogame/caffe-qhconv.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2015 10:30:35 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Mar 2016 11:59:08 GMT'}, {'version': 'v3', 'created': 'Tue, 29 Nov 2016 04:11:58 GMT'}]",2016-11-30,"[['Sun', 'Zhun', ''], ['Ozay', 'Mete', ''], ['Okatani', 'Takayuki', '']]","['convolutional neural networks', 'deep learning', 'convolution kernel', 'kernel design', 'image classification']"
18138,1305.5956,Jan Bergstra,Jan A. Bergstra and Karl de Leeuw,Questions related to Bitcoin and other Informational Money,"31 pages. In v2 the section on patterns for use and misuse has been
  improved and expanded with so-called contaminations. Other small improvements
  were made and 13 additional references have been included",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A collection of questions about Bitcoin and its hypothetical relatives
Bitguilder and Bitpenny is formulated. These questions concern technical issues
about protocols, security issues, issues about the formalizations of
informational monies in various contexts, and issues about forms of use and
misuse. Some questions are formulated in the more general setting of
informational monies and near-monies.
  We also formulate questions about legal, psychological, and ethical aspects
of informational money. Finally we formulate a number of questions concerning
the economical merits of and outlooks for Bitcoin.
","[{'version': 'v1', 'created': 'Sat, 25 May 2013 18:58:24 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Dec 2013 20:42:45 GMT'}]",2013-12-30,"[['Bergstra', 'Jan A.', ''], ['de Leeuw', 'Karl', '']]","['informational money', 'exclusively informational money', 'Bitcoin', 'Bitguilder', 'Bitpenny', 'interest prohibition', 'gambling prohibition']"
18139,1407.4027,Peter Banda,"Peter Banda, Drew Blount and Christof Teuscher",COEL: A Web-based Chemistry Simulation Framework,"23 pages, 12 figures, 1 table","CoSMoS 2014: Proceedings of the 7th Workshop on Complex Systems
  Modelling and Simulation, 35-60, 2014",,,cs.CE physics.chem-ph q-bio.MN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The chemical reaction network (CRN) is a widely used formalism to describe
macroscopic behavior of chemical systems. Available tools for CRN modelling and
simulation require local access, installation, and often involve local file
storage, which is susceptible to loss, lacks searchable structure, and does not
support concurrency. Furthermore, simulations are often single-threaded, and
user interfaces are non-trivial to use. Therefore there are significant hurdles
to conducting efficient and collaborative chemical research. In this paper, we
introduce a new enterprise chemistry simulation framework, COEL, which
addresses these issues. COEL is the first web-based framework of its kind. A
visually pleasing and intuitive user interface, simulations that run on a large
computational grid, reliable database storage, and transactional services make
COEL ideal for collaborative research and education. COEL's most prominent
features include ODE-based simulations of chemical reaction networks and
multicompartment reaction networks, with rich options for user interactions
with those networks. COEL provides DNA-strand displacement transformations and
visualization (and is to our knowledge the first CRN framework to do so), GA
optimization of rate constants, expression validation, an application-wide
plotting engine, and SBML/Octave/Matlab export. We also present an overview of
the underlying software and technologies employed and describe the main
architectural decisions driving our development. COEL is available at
http://coel-sim.org for selected research teams only. We plan to provide a part
of COEL's functionality to the general public in the near future.
","[{'version': 'v1', 'created': 'Tue, 15 Jul 2014 15:45:00 GMT'}]",2015-12-07,"[['Banda', 'Peter', ''], ['Blount', 'Drew', ''], ['Teuscher', 'Christof', '']]","['COEL', 'chemical reaction network', 'chemical modelling tool', 'web tool', 'computationalgrid', 'DNA-strand displacement transformation']"
18140,1603.08597,Chen-Hsuan Lin,Chen-Hsuan Lin and Rui Zhu and Simon Lucey,The Conditional Lucas & Kanade Algorithm,"17 pages, 11 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Lucas & Kanade (LK) algorithm is the method of choice for efficient dense
image and object alignment. The approach is efficient as it attempts to model
the connection between appearance and geometric displacement through a linear
relationship that assumes independence across pixel coordinates. A drawback of
the approach, however, is its generative nature. Specifically, its performance
is tightly coupled with how well the linear model can synthesize appearance
from geometric displacement, even though the alignment task itself is
associated with the inverse problem. In this paper, we present a new approach,
referred to as the Conditional LK algorithm, which: (i) directly learns linear
models that predict geometric displacement as a function of appearance, and
(ii) employs a novel strategy for ensuring that the generative pixel
independence assumption can still be taken advantage of. We demonstrate that
our approach exhibits superior performance to classical generative forms of the
LK algorithm. Furthermore, we demonstrate its comparable performance to
state-of-the-art methods such as the Supervised Descent Method with
substantially less training examples, as well as the unique ability to ""swap""
geometric warp functions without having to retrain from scratch. Finally, from
a theoretical perspective, our approach hints at possible redundancies that
exist in current state-of-the-art methods for alignment that could be leveraged
in vision systems of the future.
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2016 00:34:07 GMT'}]",2016-03-30,"[['Lin', 'Chen-Hsuan', ''], ['Zhu', 'Rui', ''], ['Lucey', 'Simon', '']]","['Lucas & Kanade', 'Supervised Descent Method', 'image alignment']"
18141,1710.01916,Luiza Mici,"Luiza Mici, German I. Parisi, Stefan Wermter","A self-organizing neural network architecture for learning human-object
  interactions",,,,,cs.NE cs.CV cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The visual recognition of transitive actions comprising human-object
interactions is a key component for artificial systems operating in natural
environments. This challenging task requires jointly the recognition of
articulated body actions as well as the extraction of semantic elements from
the scene such as the identity of the manipulated objects. In this paper, we
present a self-organizing neural network for the recognition of human-object
interactions from RGB-D videos. Our model consists of a hierarchy of
Grow-When-Required (GWR) networks that learn prototypical representations of
body motion patterns and objects, accounting for the development of
action-object mappings in an unsupervised fashion. We report experimental
results on a dataset of daily activities collected for the purpose of this
study as well as on a publicly available benchmark dataset. In line with
neurophysiological studies, our self-organizing architecture exhibits higher
neural activation for congruent action-object pairs learned during training
sessions with respect to synthetically created incongruent ones. We show that
our unsupervised model shows competitive classification results on the
benchmark dataset with respect to strictly supervised approaches.
","[{'version': 'v1', 'created': 'Thu, 5 Oct 2017 08:40:24 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Mar 2018 09:00:41 GMT'}]",2018-03-05,"[['Mici', 'Luiza', ''], ['Parisi', 'German I.', ''], ['Wermter', 'Stefan', '']]","['self-organization', 'hierarchical learning', 'action recognition', 'object recognition', 'human-object interaction']"
18142,1507.01613,Boris Brimkov,Boris Brimkov,A note on the clique number of complete $k$-partite graphs,6 pages,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this note, we show that a complete $k$-partite graph is the only graph
with clique number $k$ among all degree-equivalent simple graphs. This result
gives a lower bound on the clique number, which is sharper than existing bounds
on a large family of graphs.
","[{'version': 'v1', 'created': 'Mon, 6 Jul 2015 20:13:00 GMT'}]",2015-07-08,"[['Brimkov', 'Boris', '']]","['Clique number', 'independence number', 'complete k-partitegraph', 'Tur´an graph']"
18143,1406.5052,Uldis Boj\=ars,Uldis Boj\=ars and Ren\=ars Liepi\c{n}\v{s},The State of Open Data in Latvia: 2014,"keywords: Open Data, Open Government Data, PSI, Latvia","Baltic J. Modern Computing, Vol. 2 (2014), No. 3, 160-170",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper examines the state of Open Data in Latvia at the middle of 2014.
The study is divided into two parts: (i) a survey of open data situation and
(ii) an overview of available open data sets. The first part examines the
general open data climate in Latvia according to the guidelines of the OKFN
Open Data Index making the results comparable to those of other participants of
this index. The second part examines datasets made available on the Latvia Open
Data community catalogue, the only open data catalogue available in Latvia at
the moment. We conclude that Latvia public sector open data mostly fulfil the
basic criteria (e.g., data is available) of the Open Data Index but fail on
more advanced criteria: the majority of data considered in the study are not
published in machine-readable form, are not available for bulk download and
none of the data sources have open license statements.
","[{'version': 'v1', 'created': 'Thu, 19 Jun 2014 14:08:03 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Sep 2014 10:52:45 GMT'}]",2014-09-25,"[['Bojārs', 'Uldis', ''], ['Liepiņš', 'Renārs', '']]","['Open Data', 'Open Government Data', 'PSI', 'Latvia']"
18144,1502.04252,Tizita Nesibu Shewaye Mrs,Tizita Nesibu Shewaye,Cardiac MR Image Segmentation Techniques: an overview,6 pages,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Broadly speaking, the objective in cardiac image segmentation is to delineate
the outer and inner walls of the heart to segment out either the entire or
parts of the organ boundaries. This paper will focus on MR images as they are
the most widely used in cardiac segmentation -- as a result of the accurate
morphological information and better soft tissue contrast they provide. This
cardiac segmentation information is very useful as it eases physical
measurements that provides useful metrics for cardiac diagnosis such as
infracted volumes, ventricular volumes, ejection fraction, myocardial mass,
cardiac movement, and the like. But, this task is difficult due to the
intensity and texture similarities amongst the different cardiac and background
structures on top of some noisy artifacts present in MR images. Thus far,
various researchers have proposed different techniques to solve some of the
pressing issues. This seminar paper presents an overview of representative
medical image segmentation techniques. The paper also highlights preferred
approaches for segmentation of the four cardiac chambers: the left ventricle
(LV), right ventricle (RV), left atrium (LA) and right atrium (RA), on short
axis image planes.
","[{'version': 'v1', 'created': 'Sat, 14 Feb 2015 22:15:39 GMT'}]",2015-02-17,"[['Shewaye', 'Tizita Nesibu', '']]","['Cardiac MRI', 'segmentation', 'medical imageanalysis', 'heart', 'overview']"
18145,1607.01887,Liqi Wang,"Shixin Zhu, Zhonghua Sun, Liqi Wang","The symbol-pair distance distribution of repeated-root cyclic codes over
  $\mathbb{F}_{p^m}$",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Symbol-pair codes are proposed to protect against pair errors in symbol-pair
read channels. One of the most important task in symbol-pair coding theory is
to determine the minimum pair-distance of symbol-pair codes. In this paper, we
investigate the symbol-pair distances of cyclic codes of length $p^e$ over
$\mathbb{F}_{p^m}$. The exact symbol-pair distances of all cyclic codes of such
length are determined.
","[{'version': 'v1', 'created': 'Thu, 7 Jul 2016 06:59:14 GMT'}]",2016-07-08,"[['Zhu', 'Shixin', ''], ['Sun', 'Zhonghua', ''], ['Wang', 'Liqi', '']]","['Symbol-pair codes', 'distance distribution', 'cyclic codes']"
18146,1504.03239,Rekha R,Rekha R Pai,Global Value Numbering: A Precise and Efficient Algorithm,"6 pages, 3 figures, an extended version to be submitted to journal",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Global Value Numbering (GVN) is an important static analysis to detect
equivalent expressions in a program. We present an iterative data-flow analysis
GVN algorithm in SSA for the purpose of detecting total redundancies. The
central challenge is defining a join operation to detect equivalences at a join
point in polynomial time such that later occurrences of redundant expressions
could be detected. For this purpose, we introduce the novel concept of value
$\phi$-function. We claim the algorithm is precise and takes only polynomial
time.
","[{'version': 'v1', 'created': 'Mon, 13 Apr 2015 16:14:43 GMT'}]",2015-04-14,"[['Pai', 'Rekha R', '']]","['Global Value Numbering', 'redundancy detection', 'value φfunction']"
18147,1407.8320,Aftab Ahmed Chandio,"Aftab Ahmed Chandio, Dingju Zhu, Ali Hassan Sodhro, Muhammad Umer Syed","An Implementation of Web Services for Inter-Connectivity of Information
  Systems","7 pages, 5 figures, (Accepted for the Int. J. Com. Dig. Sys. Vol. 3,
  No. 3, ISSN. 2210-142X)","International Journal of Computing and Digital Systems (IJCDS),
  Vol. 3, No. 3, pp. (2014)",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As educational institutions and their departments rapidly increase, a
communication between their end-users becomes more and more difficult in
traditional online management systems (OMS). However, the end-users, i.e.,
employees, teaching staff, and students are associated to different sub-domains
and using different subsystems that are executed on different platforms
following different administrative policies. Because of their
intercommunication is not automated integrated, consequently, the overall
efficiency of the system is degraded and the communication time is increased.
Therefore, a technique for better interoperability and automated integration of
departments is an urgent needed. Many of existing systems does not have a set
of connections yet, such as the system of the University of Sindh (UoS). In
this paper, we propose a system for the UoS, named integration of
inter-connectivity of information system (i3) based on service oriented
architecture (SOA) with web services. The system i3 monitors and exchanges the
students information in support of verification along heterogeneous and
decentralized nature. Moreover, the proposed system provides capability of
interoperability between their subsystems that are deployed in different
departments of UoS and using different programming languages and database
management systems (DBMS)
","[{'version': 'v1', 'created': 'Thu, 31 Jul 2014 08:55:20 GMT'}]",2014-08-01,"[['Chandio', 'Aftab Ahmed', ''], ['Zhu', 'Dingju', ''], ['Sodhro', 'Ali Hassan', ''], ['Syed', 'Muhammad Umer', '']]","['Integration', 'Interoperability', 'University Information System', 'SOA', 'Web Services', 'Distributed System']"
18148,1603.07466,Marlon Dumas,"Diego Calvanese, Marlon Dumas, \""Ulari Laurson, Fabrizio M. Maggi,
  Marco Montali, Irene Teinemaa",Semantics and Analysis of DMN Decision Tables,"Submitted to the International Conference on Business Process
  Management (BPM 2016)",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Decision Model and Notation (DMN) is a standard notation to capture
decision logic in business applications in general and business processes in
particular. A central construct in DMN is that of a decision table. The
increasing use of DMN decision tables to capture critical business knowledge
raises the need to support analysis tasks on these tables such as correctness
and completeness checking. This paper provides a formal semantics for DMN
tables, a formal definition of key analysis tasks and scalable algorithms to
tackle two such tasks, i.e., detection of overlapping rules and of missing
rules. The algorithms are based on a geometric interpretation of decision
tables that can be used to support other analysis tasks by tapping into
geometric algorithms. The algorithms have been implemented in an open-source
DMN editor and tested on large decision tables derived from a credit lending
dataset.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2016 08:22:36 GMT'}]",2016-03-25,"[['Calvanese', 'Diego', ''], ['Dumas', 'Marlon', ''], ['Laurson', 'Ülari', ''], ['Maggi', 'Fabrizio M.', ''], ['Montali', 'Marco', ''], ['Teinemaa', 'Irene', '']]","['Decision Model and Notation', 'Decision Table', 'Sweep algorithm']"
18149,1401.7216,Felip Riera-Palou Dr.,Felip Riera-Palou,Reconfigurable Structures for Direct Equalisation in Mobile Receivers,"PhD Thesis, University of Bradford (UK), 2002",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Any communication channel will usually distort the transmitted signal. This
is especially true in the case of mobile systems, where multipath propagation
causes the received signal to be seriously degraded. Over the years, many
techniques have been proposed to combat channel effects. Two of the most
popular are linear equalisation (LE) and decision feedback equalisation (DFE).
These methods offer a good compromise between performance and computational
complexity. LE and DFE are implemented using finite impulse response (FIR)
filters whose frequency spectrum approximates the inverse of the channel
spectrum plus noise. In mobile systems, the equaliser is made adaptable in
order to be able to respond to the channel variations. Adaptability is achieved
using adaptive FIR filters whose coefficients are iteratively updated. In
principle, an infinite number of filter coefficients would be needed to achieve
perfect channel inversion. In practice, the number of taps must be finite.
Simulations show that, in realistic scenarios, making the equaliser longer than
a certain (undetermined) number of taps will not yield any benefit. Moreover,
computation and power will be wasted. In battery powered devices, like mobile
terminals, it would be desirable to have the equaliser properly dimensioned.
The equaliser's optimum length strongly depends on the particular scenario, and
as channel conditions vary, this optimum is likely to vary. This thesis
presents novel techniques to perform equaliser length adjustment. Methods for
the LE and the DFE have been developed. Simulations in many different scenarios
show that the proposed schemes optimise the number of taps to be used.
Moreover, these techniques are able to detect changes in the channel and
re-adjust the equaliser length appropriately.
","[{'version': 'v1', 'created': 'Tue, 28 Jan 2014 15:25:16 GMT'}]",2014-01-29,"[['Riera-Palou', 'Felip', '']]","['Equalisation', 'Mobile', 'Reconfigurable', 'Adaptive Filter', 'Variable Length']"
18150,1704.05303,Vinayak Prabhu,"Rayna Dimitrova, Ivan Gavran, Rupak Majumdar, Vinayak S. Prabhu, and
  Sadegh Esmaeil Zadeh Soudjani",The Robot Routing Problem for Collecting Aggregate Stochastic Rewards,"20 Pages. Full version of the CONCUR (28th International Conference
  on Concurrency Theory) 2017 paper",,,,cs.SY cs.CC cs.DS cs.GT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new model for formalizing reward collection problems on graphs
with dynamically generated rewards which may appear and disappear based on a
stochastic model. The *robot routing problem* is modeled as a graph whose nodes
are stochastic processes generating potential rewards over discrete time. The
rewards are generated according to the stochastic process, but at each step, an
existing reward disappears with a given probability. The edges in the graph
encode the (unit-distance) paths between the rewards' locations. On visiting a
node, the robot collects the accumulated reward at the node at that time, but
traveling between the nodes takes time. The optimization question asks to
compute an optimal (or epsilon-optimal) path that maximizes the expected
collected rewards.
  We consider the finite and infinite-horizon robot routing problems. For
finite-horizon, the goal is to maximize the total expected reward, while for
infinite horizon we consider limit-average objectives. We study the
computational and strategy complexity of these problems, establish NP-lower
bounds and show that optimal strategies require memory in general. We also
provide an algorithm for computing epsilon-optimal infinite paths for arbitrary
epsilon > 0.
","[{'version': 'v1', 'created': 'Tue, 18 Apr 2017 12:32:19 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Jul 2017 10:44:42 GMT'}]",2017-07-18,"[['Dimitrova', 'Rayna', ''], ['Gavran', 'Ivan', ''], ['Majumdar', 'Rupak', ''], ['Prabhu', 'Vinayak S.', ''], ['Soudjani', 'Sadegh Esmaeil Zadeh', '']]","['Path Planning', 'Graph Games', 'Quantitative Objectives', 'Discounting']"
18151,1710.05370,Erik Velldal,"Erik Velldal and Lilja {\O}vrelid and Eivind Alexander Bergem and
  Cathrine Stadsnes and Samia Touileb and Fredrik J{\o}rgensen",NoReC: The Norwegian Review Corpus,Pending (non-anonymous) review for LREC 2018,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the Norwegian Review Corpus (NoReC), created for training
and evaluating models for document-level sentiment analysis. The full-text
reviews have been collected from major Norwegian news sources and cover a range
of different domains, including literature, movies, video games, restaurants,
music and theater, in addition to product reviews across a range of categories.
Each review is labeled with a manually assigned score of 1-6, as provided by
the rating of the original author. This first release of the corpus comprises
more than 35,000 reviews. It is distributed using the CoNLL-U format,
pre-processed using UDPipe, along with a rich set of metadata. The work
reported in this paper forms part of the SANT initiative (Sentiment Analysis
for Norwegian Text), a project seeking to provide resources and tools for
sentiment analysis and opinion mining for Norwegian. As resources for sentiment
analysis have so far been unavailable for Norwegian, NoReC represents a highly
valuable and sought-after addition to Norwegian language technology.
","[{'version': 'v1', 'created': 'Sun, 15 Oct 2017 18:15:35 GMT'}]",2017-10-17,"[['Velldal', 'Erik', ''], ['Øvrelid', 'Lilja', ''], ['Bergem', 'Eivind Alexander', ''], ['Stadsnes', 'Cathrine', ''], ['Touileb', 'Samia', ''], ['Jørgensen', 'Fredrik', '']]","['Sentiment Analysis', 'Opinion Mining', 'Corpus', 'Norwegian', 'Reviews']"
18152,1307.2262,Huiwen Yu,Martin Furer and Huiwen Yu,Approximate the k-Set Packing Problem by Local Improvements,"14 pages, 2 figures",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study algorithms based on local improvements for the $k$-Set Packing
problem. The well-known local improvement algorithm by Hurkens and Schrijver
has been improved by Sviridenko and Ward from $\frac{k}{2}+\epsilon$ to
$\frac{k+2}{3}$, and by Cygan to $\frac{k+1}{3}+\epsilon$ for any $\epsilon>0$.
In this paper, we achieve the approximation ratio $\frac{k+1}{3}+\epsilon$ for
the $k$-Set Packing problem using a simple polynomial-time algorithm based on
the method by Sviridenko and Ward. With the same approximation guarantee, our
algorithm runs in time singly exponential in $\frac{1}{\epsilon^2}$, while the
running time of Cygan's algorithm is doubly exponential in
$\frac{1}{\epsilon}$. On the other hand, we construct an instance with locality
gap $\frac{k+1}{3}$ for any algorithm using local improvements of size
$O(n^{1/5})$, here $n$ is the total number of sets. Thus, our approximation
guarantee is optimal with respect to results achievable by algorithms based on
local improvements.
","[{'version': 'v1', 'created': 'Mon, 8 Jul 2013 20:34:45 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Sep 2013 21:25:15 GMT'}, {'version': 'v3', 'created': 'Tue, 10 Jun 2014 20:57:11 GMT'}]",2014-06-12,"[['Furer', 'Martin', ''], ['Yu', 'Huiwen', '']]","['k-set packing', 'tail change', 'local improvement', 'color coding']"
18153,1401.5632,Manoj Krishnaswamy,"Manoj Krishnaswamy, G. Hemantha Kumar","Enhancing Template Security of Face Biometrics by Using Edge Detection
  and Hashing","11 pages, 13 figures, Journal. arXiv admin note: text overlap with
  arXiv:1307.7474 by other authors","International Journal of Information Processing, 7(4), 11-20,
  2013, ISSN : 0973-8215",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we address the issues of using edge detection techniques on
facial images to produce cancellable biometric templates and a novel method for
template verification against tampering. With increasing use of biometrics,
there is a real threat for the conventional systems using face databases, which
store images of users in raw and unaltered form. If compromised not only it is
irrevocable, but can be misused for cross-matching across different databases.
So it is desirable to generate and store revocable templates for the same user
in different applications to prevent cross-matching and to enhance security,
while maintaining privacy and ethics. By comparing different edge detection
methods it has been observed that the edge detection based on the Roberts Cross
operator performs consistently well across multiple face datasets, in which the
face images have been taken under a variety of conditions. We have proposed a
novel scheme using hashing, for extra verification, in order to harden the
security of the stored biometric templates.
","[{'version': 'v1', 'created': 'Wed, 22 Jan 2014 11:50:08 GMT'}]",2014-01-23,"[['Krishnaswamy', 'Manoj', ''], ['Kumar', 'G. Hemantha', '']]","['Cancellable Biometrics', 'Edge Detection', 'Face Biometrics', 'Template Security']"
18154,0802.3718,Joaquin Garcia-Alfaro,"Joaquin Garcia-Alfaro, Michael A. Jaeger, Gero Muehl, and Joan Borrell",Preventing Coordinated Attacks Via Distributed Alert Exchange,"19 pages, proposal reviewed","IFIP International Conference on Intelligence in Communication
  Systems (INTELLCOMM 2005) (17/10/2005) 87-98",,,cs.CR cs.NI,,"  Attacks on information systems followed by intrusions may cause large revenue
losses. The prevention of both is not always possible by just considering
information from isolated sources of the network. A global view of the whole
system is necessary to recognize and react to the different actions of such an
attack. The design and deployment of a decentralized system targeted at
detecting as well as reacting to information system attacks might benefit from
the loose coupling realized by publish/subscribe middleware. In this paper, we
present the advantages and convenience in using this communication paradigm for
a general decentralized attack prevention framework. Furthermore, we present
the design and implementation of our approach based on existing
publish/subscribe middleware and evaluate our approach for GNU/Linux systems.
","[{'version': 'v1', 'created': 'Tue, 26 Feb 2008 11:45:43 GMT'}]",2008-02-27,"[['Garcia-Alfaro', 'Joaquin', ''], ['Jaeger', 'Michael A.', ''], ['Muehl', 'Gero', ''], ['Borrell', 'Joan', '']]","['Network Security', 'Attack Prevention System', 'Publish/Subscribe', 'Message Oriented Middleware', 'IDMEF']"
18155,1511.06477,Nirav Bhatt,"Nirav Bhatt, Sriniketh Srinivasan","On Cooperative Behavior of Open Homogeneous Chemical Reaction Systems in
  the Extent Domain",The paper was presented in the first Indian Control Conference 2015,,,,cs.SY math.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Material balance equations describe the dynamics of the species in open
reaction systems and contain information regarding reaction topology, kinetics
and operation mode. For reaction systems, the state variables (the numbers of
moles, or concentrations) have recently been transformed into decoupled
reaction variants (extents of reaction), and reaction invariants (extents of
flow) (Amrhein et al., AIChE Journal, 2010). This paper analyses the conditions
under which an open homogeneous reaction system is cooperative in the extents
domain. Further, it is shown that the dynamics of the extents of flow exhibit
cooperative behavior. Further, we provide the conditions under which the
dynamics of the extents of reaction exhibit cooperative behavior. Our results
provide physical insights into cooperative and competitive nature of the
underlying reaction system in the presence of material exchange with
surrounding (i.e., inlet and outlet flows). The results of the article are
demonstrated via examples.
","[{'version': 'v1', 'created': 'Fri, 20 Nov 2015 02:47:41 GMT'}]",2015-11-23,"[['Bhatt', 'Nirav', ''], ['Srinivasan', 'Sriniketh', '']]","['Extent of reaction', 'Extents of flow', 'Open reaction systems', 'Cooperative Systems', 'Competitive Systems']"
18156,0707.0705,Alexandre d'Aspremont,"Alexandre d'Aspremont, Francis Bach, Laurent El Ghaoui",Optimal Solutions for Sparse Principal Component Analysis,"Revised journal version. More efficient optimality conditions and new
  examples in subset selection and sparse recovery. Original version is in ICML
  proceedings",,,,cs.AI cs.LG,,"  Given a sample covariance matrix, we examine the problem of maximizing the
variance explained by a linear combination of the input variables while
constraining the number of nonzero coefficients in this combination. This is
known as sparse principal component analysis and has a wide array of
applications in machine learning and engineering. We formulate a new
semidefinite relaxation to this problem and derive a greedy algorithm that
computes a full set of good solutions for all target numbers of non zero
coefficients, with total complexity O(n^3), where n is the number of variables.
We then use the same relaxation to derive sufficient conditions for global
optimality of a solution, which can be tested in O(n^3) per pattern. We discuss
applications in subset selection and sparse recovery and show on artificial
examples and biological data that our algorithm does provide globally optimal
solutions in many cases.
","[{'version': 'v1', 'created': 'Wed, 4 Jul 2007 22:28:28 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Aug 2007 22:30:22 GMT'}, {'version': 'v3', 'created': 'Fri, 24 Aug 2007 00:49:31 GMT'}, {'version': 'v4', 'created': 'Fri, 9 Nov 2007 17:27:11 GMT'}]",2011-11-10,"[[""d'Aspremont"", 'Alexandre', ''], ['Bach', 'Francis', ''], ['Ghaoui', 'Laurent El', '']]","['PCA', 'subset selection', 'sparse eigenvalues', 'sparse recovery', 'lasso']"
18157,1802.08286,Ashkan Zeinalzadeh,"Ashkan Zeinalzadeh, Donya Ghavidel, and Vijay Gupta","Reliability and Market Price of Energy in the Presence of Intermittent
  and Non-Dispatchable Renewable Energies",11 pages,,,,cs.SY stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The intermittent nature of the renewable energies increases the operation
costs of conventional generators. As the share of energy supplied by renewable
sources increases, these costs also increase. In this paper, we quantify these
costs by developing a market clearing price of energy in the presence of
renewable energy and congestion constraints. We consider an electricity market
where generators propose their asking price per unit of energy to an
independent system operator (ISO). The ISO solve an optimization problem to
dispatch energy from each generator to minimize the total cost of energy
purchased on behalf of the consumers.
  To ensure that the generators are able to meet the load within a desired
confidence level, we incorporate the notion of load variance using the
Conditional Value-at-Risk (CVAR) measure in an electricity market and we derive
the amount of committed power and market clearing price of energy as a function
of CVAR. It is shown that a higher penetration of renewable energies may
increase the committed power, market clearing price of energy and consumer cost
of energy due to renewable generation uncertainties. We also obtain an
upper-bound on the amount that congestion constraints can affect the committed
power. We present descriptive simulations to illustrate the impact of renewable
energy penetration and reliability levels on committed power by the
non-renewable generators, difference between the dispatched and committed
power, market price of energy and profit of renewable and non-renewable
generators.
","[{'version': 'v1', 'created': 'Mon, 5 Feb 2018 19:22:23 GMT'}]",2018-02-26,"[['Zeinalzadeh', 'Ashkan', ''], ['Ghavidel', 'Donya', ''], ['Gupta', 'Vijay', '']]","['Electricity Market', 'Renewable Energy', 'GridReliability']"
18158,1605.00372,Ching-Chi Lin,Ching-Chi Lin and Cheng-Yu Hsieh,"A Linear-Time Algorithm for the Weighted Paired-Domination Problem on
  Block Graphs",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a graph $G = (V,E)$, a vertex subset $S\subseteq V(G)$ is said to be a
dominating set of $G$ if every vertex not in $S$ is adjacent to a vertex in
$S$. A dominating set $S$ of $G$ is called a paired-dominating set of $G$ if
the induced subgraph $G[S]$ contains a perfect matching. In this paper, we
propose an $O(n+m)$-time algorithm for the weighted paired-domination problem
on block graphs using dynamic programming, which strengthens the results in
[Theoret. Comput. Sci., 410(47--49):5063--5071, 2009] and [J. Comb. Optim.,
19(4):457--470, 2010]. Moreover, the algorithm can be completed in $O(n)$ time
if the block-cut-vertex structure of $G$ is given.
","[{'version': 'v1', 'created': 'Mon, 2 May 2016 07:19:17 GMT'}]",2016-05-03,"[['Lin', 'Ching-Chi', ''], ['Hsieh', 'Cheng-Yu', '']]","['Weighted paired-domination problem', 'perfect matching', 'block graph', 'dynamic programming']"
18159,1605.01180,Alexey Potapov,Alexey Potapov,A Step from Probabilistic Programming to Cognitive Architectures,4 pages,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Probabilistic programming is considered as a framework, in which basic
components of cognitive architectures can be represented in unified and elegant
fashion. At the same time, necessity of adopting some component of cognitive
architectures for extending capabilities of probabilistic programming languages
is pointed out. In particular, implicit specification of generative models via
declaration of concepts and links between them is proposed, and usefulness of
declarative knowledge for achieving efficient inference is briefly discussed.
","[{'version': 'v1', 'created': 'Wed, 4 May 2016 08:34:17 GMT'}]",2016-05-05,"[['Potapov', 'Alexey', '']]","['probabilistic programming', 'cognitive architectures', 'generative models', 'declarative knowledge']"
18160,1701.06404,Emad Zahedi,Jason P Smith and Emad Zahedi,On Distance Preserving and Sequentially Distance Preserving Graphs,,,,,cs.DM cs.SI math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A graph $H$ is an \emph{isometric} subgraph of $G$ if $d_H(u,v)= d_G(u,v)$,
for every pair~$u,v\in V(H)$. A graph is \emph{distance preserving} if it has
an isometric subgraph of every possible order. A graph is \emph{sequentially
distance preserving} if its vertices can be ordered such that deleting the
first $i$ vertices results in an isometric subgraph, for all $i\ge1$. We give
an equivalent condition to sequentially distance preserving based upon
simplicial orderings. Using this condition, we prove that if a graph does not
contain any induced cycles of length~$5$ or greater, then it is sequentially
distance preserving and thus distance preserving. Next we consider the distance
preserving property on graphs with a cut vertex. Finally, we define a family of
non-distance preserving graphs constructed from cycles.
","[{'version': 'v1', 'created': 'Tue, 17 Jan 2017 23:35:26 GMT'}]",2017-01-24,"[['Smith', 'Jason P', ''], ['Zahedi', 'Emad', '']]","['Chordal', 'Cut Vertex', 'Distance Preserving', 'Isometric Subgraph', 'SequentiallyDistance Preserving', 'Simplicial Vertex']"
18161,1802.08484,Oliviero Riganelli,"Flavio Corradini, Alberto Polzonetti and Oliviero Riganelli",Business Rules in e-Government Applications,,"Electronic Journal of e- Government Volume 7 Issue 1 2009, pp. 45
  - 54,",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The introduction of Information and Communication Technologies (ICT) into
public administrations has been radically changing the way organizations
cooperate and, more generally, the way to think about business processes over
organizational boundaries. In this paper we describe our approach to combining
business processes with business rules in order to integrate effectively single
units in an inter- or intra-organizational cooperation. Business rules
represent the knowledge that an administration has about its business; with
regard to this, they can express strategies, contracts and can influence not
only staff relations, but, finally, citizen relations, as well. In other words,
business rules are the core of an administration and affect either the business
processes or the behaviours of the system participants. They are typically
expressed implicitly in business contracts and they are embedded within the
source code of many application modules. So a concise and declarative statement
of business behaviour is converted into a set of programming instructions,
which are spread widely throughout the whole information system. In this way,
business rules are difficult to change and keep consistent over the time. For
this reason, it is necessary to reengineer the system in order to logically and
perhaps physically externalize rules from the application code. In our proposed
approach, we describe a cooperation as a collection of tasks combined in
certain ways according to the organization logic specified by business rules.
Our rule-driven methodology has the goal to make the business process design
more adaptable to the changes of internal or external environment.
","[{'version': 'v1', 'created': 'Fri, 23 Feb 2018 11:14:03 GMT'}]",2018-02-26,"[['Corradini', 'Flavio', ''], ['Polzonetti', 'Alberto', ''], ['Riganelli', 'Oliviero', '']]","['business rule', 'business process', 'end-user approaches', 'BRAIN']"
18162,1610.05971,Shachar Siboni,"Shachar Siboni, Vinay Sachidananda, Asaf Shabtai and Yuval Elovici",Security Testbed for the Internet of Things,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Internet of Things (IoT) is a global ecosystem of information and
communication technologies aimed at connecting any type of object (thing), at
any time and in any place, to each other and to the Internet. One of the major
problems associated with the IoT is maintaining security; the heterogeneous
nature of such deployments poses a challenge to many aspects of security,
including security testing and analysis. In addition, there is no existing
mechanism that performs security testing for IoT devices in different contexts.
In this paper, we propose an innovative security testbed framework targeted at
IoT devices. The security testbed supports both standard and context-based
security testing, with a set of security tests conducted under the different
environmental conditions in which IoT devices operate. The requirements and
architectural design of the proposed testbed are discussed, and the testbed
operation is demonstrated in several testing scenarios.
","[{'version': 'v1', 'created': 'Wed, 19 Oct 2016 11:58:29 GMT'}]",2016-10-20,"[['Siboni', 'Shachar', ''], ['Sachidananda', 'Vinay', ''], ['Shabtai', 'Asaf', ''], ['Elovici', 'Yuval', '']]","['Internet of Things (IoT)', 'Security', 'Privacy', 'Testbed Framework']"
18163,1511.07340,Henry WJ Reeve,Henry W J Reeve and Gavin Brown,Modular Autoencoders for Ensemble Feature Extraction,"18 pages, 8 figures, to appear in a special issue of The Journal Of
  Machine Learning Research (vol.44, Dec 2015)",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the concept of a Modular Autoencoder (MAE), capable of learning
a set of diverse but complementary representations from unlabelled data, that
can later be used for supervised tasks. The learning of the representations is
controlled by a trade off parameter, and we show on six benchmark datasets the
optimum lies between two extremes: a set of smaller, independent autoencoders
each with low capacity, versus a single monolithic encoding, outperforming an
appropriate baseline. In the present paper we explore the special case of
linear MAE, and derive an SVD-based algorithm which converges several orders of
magnitude faster than gradient descent.
","[{'version': 'v1', 'created': 'Mon, 23 Nov 2015 17:51:18 GMT'}]",2015-11-24,"[['Reeve', 'Henry W J', ''], ['Brown', 'Gavin', '']]","['Modularity', 'Autoencoders', 'Diversity', 'Unsupervised', 'Ensembles']"
18164,1208.0848,Qiang Wu,"Ting Hu, Jun Fan, Qiang Wu, Ding-Xuan Zhou",Learning Theory Approach to Minimum Error Entropy Criterion,,JMLR 2013,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the minimum error entropy (MEE) criterion and an empirical risk
minimization learning algorithm in a regression setting. A learning theory
approach is presented for this MEE algorithm and explicit error bounds are
provided in terms of the approximation ability and capacity of the involved
hypothesis space when the MEE scaling parameter is large. Novel asymptotic
analysis is conducted for the generalization error associated with Renyi's
entropy and a Parzen window function, to overcome technical difficulties arisen
from the essential differences between the classical least squares problems and
the MEE setting. A semi-norm and the involved symmetrized least squares error
are introduced, which is related to some ranking algorithms.
","[{'version': 'v1', 'created': 'Fri, 3 Aug 2012 21:15:19 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Feb 2013 21:09:57 GMT'}]",2013-02-26,"[['Hu', 'Ting', ''], ['Fan', 'Jun', ''], ['Wu', 'Qiang', ''], ['Zhou', 'Ding-Xuan', '']]","['minimum error entropy', 'learning theory', 'R´enyi’s entropy', 'empirical riskminimization', 'approximation error']"
18165,0906.4764,Chaitanya Nittala,"Sriram Somanchi, Chaitanya Nittala, Narahari Yadati","A Novel Bid Optimizer for Sponsored Search Auctions based on Cooperative
  Game Theory","To be published in Proceedings of the 2009 IEEE/WIC/ACM International
  Conference on Intelligent Agent Technology. 2009",,,,cs.GT cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a bid optimizer for sponsored keyword search
auctions which leads to better retention of advertisers by yielding attractive
utilities to the advertisers without decreasing the revenue to the search
engine. The bid optimizer is positioned as a key value added tool the search
engine provides to the advertisers. The proposed bid optimizer algorithm
transforms the reported values of the advertisers for a keyword into a
correlated bid profile using many ideas from cooperative game theory. The
algorithm is based on a characteristic form game involving the search engine
and the advertisers. Ideas from Nash bargaining theory are used in formulating
the characteristic form game to provide for a fair share of surplus among the
players involved. The algorithm then computes the nucleolus of the
characteristic form game since we find that the nucleolus is an apt way of
allocating the gains of cooperation among the search engine and the
advertisers. The algorithm next transforms the nucleolus into a correlated bid
profile using a linear programming formulation. This bid profile is input to a
standard generalized second price mechanism (GSP) for determining the
allocation of sponsored slots and the prices to be be paid by the winners. The
correlated bid profile that we determine is a locally envy-free equilibrium and
also a correlated equilibrium of the underlying game. Through detailed
simulation experiments, we show that the proposed bid optimizer retains more
customers than a plain GSP mechanism and also yields better long-run utilities
to the search engine and the advertisers.
","[{'version': 'v1', 'created': 'Thu, 25 Jun 2009 18:25:53 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Jun 2009 11:31:40 GMT'}]",2009-06-30,"[['Somanchi', 'Sriram', ''], ['Nittala', 'Chaitanya', ''], ['Yadati', 'Narahari', '']]","['Bid Optimizer', 'Sponsored Search', 'CooperativeGame Theory', 'Nash bargaining', 'Nucleolus']"
18166,1506.04036,Umberto Mart\'inez-Pe\~nas,Umberto Mart\'inez-Pe\~nas,"On the similarities between generalized rank and Hamming weights and
  their applications to network coding",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rank weights and generalized rank weights have been proven to characterize
error and erasure correction, and information leakage in linear network coding,
in the same way as Hamming weights and generalized Hamming weights describe
classical error and erasure correction, and information leakage in wire-tap
channels of type II and code-based secret sharing. Although many similarities
between both cases have been established and proven in the literature, many
other known results in the Hamming case, such as bounds or characterizations of
weight-preserving maps, have not been translated to the rank case yet, or in
some cases have been proven after developing a different machinery. The aim of
this paper is to further relate both weights and generalized weights, show that
the results and proofs in both cases are usually essentially the same, and see
the significance of these similarities in network coding. Some of the new
results in the rank case also have new consequences in the Hamming case.
","[{'version': 'v1', 'created': 'Fri, 12 Jun 2015 15:03:33 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Jul 2015 16:23:19 GMT'}, {'version': 'v3', 'created': 'Fri, 22 Apr 2016 13:20:20 GMT'}]",2016-04-25,"[['Martínez-Peñas', 'Umberto', '']]","['Rank weight', 'generalized rank weight', 'rank distance', 'rank-metriccodes', 'network coding', 'network error correction', 'secure network coding']"
18167,1009.4980,S. M. Kamruzzaman,"Rezwana Sharmeen, Md. Abul Kalam Azad, Shabbir Ahmad, and S. M.
  Kamruzzaman",Completely Enhanced Cell Phone Keypad,"5 Pages, International Conference","Proc. International Conference on Information Management and
  Business (IMB 2005), Shih Chien University, Taiwan, pp. 217-221, Mar. 2005",,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The enhanced frequency based keypad is designed to speed up the typing
process. This paper will show that the proposed layout will increase the typing
speed and be flexible for thumb. Traditional cell phone keypad is not a
scientific keypad from the frequency point of view. Approaches have been
explored to speed up the typing process. We found that no manufacturer has
considered the frequency of the alphabet. The current architecture does not
provide flexibility although the users are accustomed to the currently
available multi-tapping keypad. Since the currently available keypad layouts
are not best suited for users, this paper will suggest a keypad for cell phone
and other cellular device based on the frequency of the alphabet in English
language and also with the view of structure of human finger movements to
provide a flexible and fast cell phone keypad. It also takes into consideration
the key jamming problem that was available in typewriter. At first we
identified those keys of cell phone, which are easily reachable and create less
pressure on the thumb. Thus the key frequency order is calculated from
anatomical point of view. In our proposed layout we arranged the alphabet in
the frequent keys based on the frequency of the alphabet.
","[{'version': 'v1', 'created': 'Sat, 25 Sep 2010 06:43:43 GMT'}]",2010-09-28,"[['Sharmeen', 'Rezwana', ''], ['Azad', 'Md. Abul Kalam', ''], ['Ahmad', 'Shabbir', ''], ['Kamruzzaman', 'S. M.', '']]","['Cell phone', 'Unitap', 'Multitap', 'keypad']"
18168,1106.3361,Miron Kursa,Miron B. Kursa and {\L}ukasz Komsta and Witold R. Rudnicki,"Random forest models of the retention constants in the thin layer
  chromatography",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the current study we examine an application of the machine learning
methods to model the retention constants in the thin layer chromatography
(TLC). This problem can be described with hundreds or even thousands of
descriptors relevant to various molecular properties, most of them redundant
and not relevant for the retention constant prediction. Hence we employed
feature selection to significantly reduce the number of attributes.
Additionally we have tested application of the bagging procedure to the feature
selection. The random forest regression models were built using selected
variables. The resulting models have better correlation with the experimental
data than the reference models obtained with linear regression. The
cross-validation confirms robustness of the models.
","[{'version': 'v1', 'created': 'Thu, 16 Jun 2011 22:05:21 GMT'}]",2011-06-20,"[['Kursa', 'Miron B.', ''], ['Komsta', 'Łukasz', ''], ['Rudnicki', 'Witold R.', '']]","['random forest', 'chemometry', 'feature selection']"
18169,1406.4086,Leon Abdillah,Leon Andretti Abdillah,Social media as political party campaign in Indonesia,10 pages,"Jurnal Ilmiah MATRIK, vol. 16, pp. 1-10, 2014",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media as a trend in the Internet is now used as a medium for political
campaigns. Author explores the advantages and social media implementation of
any political party in Indonesia legislative elections 2014. Author visited and
analyzed social media used by the contestants, such as: Facebook, and Twitter.
Author collected data from social media until the end of April 2014. This
article discusses the use of social media by political parties and their
features. The results of this study indicate that social media are: 1)
effective tool for current and future political campaigns, 2) reach the voters
and supporters instantly, 3) used by Political parties to show their logo/icon,
and 4) last but not least quick count results also show that political parties
which using social media as part of their campaigns won the legislative
elections.
","[{'version': 'v1', 'created': 'Mon, 16 Jun 2014 17:58:18 GMT'}]",2014-06-17,"[['Abdillah', 'Leon Andretti', '']]","['Social media impact', 'Indonesian legislative elections', 'Political parties presentation']"
18170,1610.07736,Lin Sok,"Minjia Shi, Lin Sok, Patrick Sol\'e",Construction of MDS self-dual codes from orthogonal matrices,"presented in part in the 3rd Sino-Korea International Conference on
  Coding Theory and Related Topics; submitted to IEEE trans. on Information
  Theory",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we give algorithms and methods of construction of self-dual
codes over finite fields using orthogonal matrices. Randomization in the
orthogonal group, and code extension are the main tools. Some optimal, almost
MDS, and MDS self-dual codes over both small and large prime fields are
constructed.
","[{'version': 'v1', 'created': 'Tue, 25 Oct 2016 05:26:13 GMT'}]",2016-10-26,"[['Shi', 'Minjia', ''], ['Sok', 'Lin', ''], ['Solé', 'Patrick', '']]","['Orthogonal matrices', 'self-dual codes', 'optimal codes', 'almostMDS codes', 'MDS codes']"
18171,1712.02893,Kaiyue Lu,"Kaiyue Lu, Shaodi You, Nick Barnes",Deep Texture and Structure Aware Filtering Network for Image Smoothing,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image smoothing is a fundamental task in computer vision, that aims to retain
salient structures and remove insignificant textures. In this paper, we aim to
address the fundamental shortcomings of existing image smoothing methods, which
cannot properly distinguish textures and structures with similar low-level
appearance. While deep learning approaches have started to explore the
preservation of structure through image smoothing, existing work does not yet
properly address textures. To this end, we generate a large dataset by blending
natural textures with clean structure-only images, and then build a texture
prediction network (TPN) that predicts the location and magnitude of textures.
We then combine the TPN with a semantic structure prediction network (SPN) so
that the final texture and structure aware filtering network (TSAFN) is able to
identify the textures to remove (""texture-awareness"") and the structures to
preserve (""structure-awareness""). The proposed model is easy to understand and
implement, and shows excellent performance on real images in the wild as well
as our generated dataset.
","[{'version': 'v1', 'created': 'Thu, 7 Dec 2017 23:54:26 GMT'}, {'version': 'v2', 'created': 'Tue, 8 May 2018 00:51:15 GMT'}]",2018-05-09,"[['Lu', 'Kaiyue', ''], ['You', 'Shaodi', ''], ['Barnes', 'Nick', '']]","['Image smoothing', 'texture prediction', 'deep learning']"
18172,1409.7556,Basura Fernando,"Basura Fernando, Tatiana Tommasi, Tinne Tuytelaars",Location Recognition Over Large Time Lags,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Would it be possible to automatically associate ancient pictures to modern
ones and create fancy cultural heritage city maps? We introduce here the task
of recognizing the location depicted in an old photo given modern annotated
images collected from the Internet. We present an extensive analysis on
different features, looking for the most discriminative and most robust to the
image variability induced by large time lags. Moreover, we show that the
described task benefits from domain adaptation.
","[{'version': 'v1', 'created': 'Fri, 26 Sep 2014 12:36:54 GMT'}, {'version': 'v2', 'created': 'Sat, 7 Mar 2015 15:58:17 GMT'}, {'version': 'v3', 'created': 'Tue, 26 May 2015 03:14:19 GMT'}]",2015-05-27,"[['Fernando', 'Basura', ''], ['Tommasi', 'Tatiana', ''], ['Tuytelaars', 'Tinne', '']]","['location recognition', 'cross-domain image retrieval', 'domain adaptation']"
18173,1606.06580,Christoforos Raptopoulos Christoforos Raptopoulos,"George Christodoulou and Martin Gairing and Sotiris Nikoletseas and
  Christoforos Raptopoulos and Paul Spirakis",Strategic Contention Resolution with Limited Feedback,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study contention resolution protocols from a game-theoretic
perspective. We focus on \emph{acknowledgment-based} protocols, where a user
gets feedback from the channel only when she attempts transmission. In this
case she will learn whether her transmission was successful or not. Users that
do not transmit will not receive any feedback. We are interested in equilibrium
protocols, where no player has an incentive to deviate.
  The limited feedback makes the design of equilibrium protocols a hard task as
best response policies usually have to be modeled as Partially Observable
Markov Decision Processes, which are hard to analyze. Nevertheless, we show how
to circumvent this for the case of two players and present an equilibrium
protocol. For many players, we give impossibility results for a large class of
acknowledgment-based protocols, namely \emph{age-based} and \emph{backoff}
protocols with finite expected finishing time. Finally, we provide an age-based
equilibrium protocol, which has infinite expected finishing time, but every
player finishes in linear time with high probability.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2016 14:05:23 GMT'}]",2016-06-22,"[['Christodoulou', 'George', ''], ['Gairing', 'Martin', ''], ['Nikoletseas', 'Sotiris', ''], ['Raptopoulos', 'Christoforos', ''], ['Spirakis', 'Paul', '']]","['contention resolution', 'acknowledgment-based protocols', 'game theory']"
18174,1208.0682,Jason Teutsch,Frank Stephan and Jason Teutsch,Things that can be made into themselves,,,,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One says that a property $P$ of sets of natural numbers can be made into
itself iff there is a numbering $\alpha_0,\alpha_1,\ldots$ of all left-r.e.
sets such that the index set $\{e: \alpha_e$ satisfies $P\}$ has the property
$P$ as well. For example, the property of being Martin-L\""of random can be made
into itself. Herein we characterize those singleton properties which can be
made into themselves. A second direction of the present work is the
investigation of the structure of left-r.e. sets under inclusion modulo a
finite set. In contrast to the corresponding structure for r.e. sets, which has
only maximal but no minimal members, both minimal and maximal left-r.e. sets
exist. Moreover, our construction of minimal and maximal left-r.e. sets greatly
differs from Friedberg's classical construction of maximal r.e. sets. Finally,
we investigate whether the properties of minimal and maximal left-r.e. sets can
be made into themselves.
","[{'version': 'v1', 'created': 'Fri, 3 Aug 2012 08:13:42 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Sep 2012 05:58:26 GMT'}, {'version': 'v3', 'created': 'Fri, 19 Apr 2013 06:17:13 GMT'}, {'version': 'v4', 'created': 'Wed, 12 Feb 2014 20:24:22 GMT'}]",2014-02-13,"[['Stephan', 'Frank', ''], ['Teutsch', 'Jason', '']]","['numberings', 'self-reference', 'minimal left-r.e. sets', 'maximalleft-r.e. sets', 'Martin-L¨of random sets']"
18175,1704.06485,Byeongchang Kim,"Cesc Chunseong Park, Byeongchang Kim, Gunhee Kim","Attend to You: Personalized Image Captioning with Context Sequence
  Memory Networks",Accepted paper at CVPR 2017,,,,cs.CV cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address personalization issues of image captioning, which have not been
discussed yet in previous research. For a query image, we aim to generate a
descriptive sentence, accounting for prior knowledge such as the user's active
vocabularies in previous documents. As applications of personalized image
captioning, we tackle two post automation tasks: hashtag prediction and post
generation, on our newly collected Instagram dataset, consisting of 1.1M posts
from 6.3K users. We propose a novel captioning model named Context Sequence
Memory Network (CSMN). Its unique updates over previous memory network models
include (i) exploiting memory as a repository for multiple types of context
information, (ii) appending previously generated words into memory to capture
long-term information without suffering from the vanishing gradient problem,
and (iii) adopting CNN memory structure to jointly represent nearby ordered
memory slots for better context understanding. With quantitative evaluation and
user studies via Amazon Mechanical Turk, we show the effectiveness of the three
novel features of CSMN and its performance enhancement for personalized image
captioning over state-of-the-art captioning models.
","[{'version': 'v1', 'created': 'Fri, 21 Apr 2017 11:29:07 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Apr 2017 23:30:43 GMT'}]",2017-04-27,"[['Park', 'Cesc Chunseong', ''], ['Kim', 'Byeongchang', ''], ['Kim', 'Gunhee', '']]","['completing a sentence to describe theme', 'sentiment', 'context of the image']"
18176,1403.1279,Hamid A. Toussi,Hamid A. Toussi and Bahram Sadeghi Bigham,"Design, Implementation and Evaluation of MTBDD based Fuzzy Sets and
  Binary Fuzzy Relations","A shorter version was published in Proceeding of International
  Conference on Computer, Information Technology and Digital Media, Tehran,
  Iran, 2013",,,,cs.DS cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For fast and efficient analysis of large sets of fuzzy data, elimination of
redundancies in the memory representation is needed. We used MTBDDs as the
underlying data-structure to represent fuzzy sets and binary fuzzy relations.
This leads to elimination of redundancies in the representation, less
computations, and faster analyses. We have also extended a BDD package (BuDDy)
to support MTBDDs in general and fuzzy sets and relations in particular.
Different fuzzy operations such as max, min and max-min composition were
implemented based on our representation. Effectiveness of our representation is
shown by applying it on fuzzy connectedness and image segmentation problem.
Compared to a base implementation, the running time of our MTBDD based
implementation was faster (in our test cases) by a factor ranging from 2 to 27.
Also, when the MTBDD based data-structure was employed, the memory needed to
represent the final results was improved by a factor ranging from 37.9 to
265.5.
","[{'version': 'v1', 'created': 'Wed, 5 Mar 2014 21:48:58 GMT'}]",2014-03-07,"[['Toussi', 'Hamid A.', ''], ['Bigham', 'Bahram Sadeghi', '']]","['Boolean Functions', 'BDD', 'MTBDD', 'Binary Fuzzy Relations', 'Fuzzy Connectedness', 'ImageSegmentation']"
18177,0704.3643,Allison Woodruff,"Allison Woodruff, Sally Augustin, and Brooke Foucault","Sabbath Day Home Automation: ""It's Like Mixing Technology and Religion""",,,,,cs.HC,,"  We present a qualitative study of 20 American Orthodox Jewish families' use
of home automation for religious purposes. These lead users offer insight into
real-life, long-term experience with home automation technologies. We discuss
how automation was seen by participants to contribute to spiritual experience
and how participants oriented to the use of automation as a religious custom.
We also discuss the relationship of home automation to family life. We draw
design implications for the broader population, including surrender of control
as a design resource, home technologies that support long-term goals and
lifestyle choices, and respite from technology.
","[{'version': 'v1', 'created': 'Fri, 27 Apr 2007 00:42:22 GMT'}]",2007-05-23,"[['Woodruff', 'Allison', ''], ['Augustin', 'Sally', ''], ['Foucault', 'Brooke', '']]","['Domestic technology', 'family life', 'home automation', 'religious technology', 'smart homes', 'ubiquitous computing']"
18178,0908.0076,R Doomun,"J.C. Miraclin Joyce Pamila, K. Thanushkodi",Log Management support for recovery in mobile computing Environment,"6 Pages, International Journal of Computer Science and Information
  Security, IJCSIS July 2009, ISSN 1947 5500, Impact Factor 0.423","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 3, No. 1, July 2009",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rapid and innovative improvement in wireless communication technologies has
led to an increase in the demand for mobile internet transactions. However,
internet access from mobile devices is very expensive due to limited bandwidth
available on wireless links and high mobility rate of mobile hosts. When a user
executes a transaction with a web portal from a mobile device, the
disconnection necessitates failure of the transaction or redoing all the steps
after reconnection, to get back into consistent application state. Thus
considering challenges in wireless mobile networks, a new log management scheme
is proposed for recovery of mobile transactions.
  In this proposed approach, the model parameters that affect application state
recovery are analyzed. The proposed scheme is compared with the existing Lazy
and Pessimistic scheme and a trade off analysis between the cost invested to
manage log and the return of investment in terms of improved failure
recoverability is made. From the analysis, the best checkpoint interval period
that yields the best return of investment is identified.
","[{'version': 'v1', 'created': 'Sat, 1 Aug 2009 13:32:37 GMT'}]",2010-02-23,"[['Pamila', 'J. C. Miraclin Joyce', ''], ['Thanushkodi', 'K.', '']]","['log', 'recovery', 'mobile environment.  I']"
18179,1402.3661,Hamza Jeljeli,Hamza Jeljeli (INRIA Nancy - Grand Est / LORIA),"Resolution of Linear Algebra for the Discrete Logarithm Problem Using
  GPU and Multi-core Architectures","Euro-Par 2014 Parallel Processing, Aug 2014, Porto, Portugal.
  \&lt;http://europar2014.dcc.fc.up.pt/\&gt;",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In cryptanalysis, solving the discrete logarithm problem (DLP) is key to
assessing the security of many public-key cryptosystems. The index-calculus
methods, that attack the DLP in multiplicative subgroups of finite fields,
require solving large sparse systems of linear equations modulo large primes.
This article deals with how we can run this computation on GPU- and
multi-core-based clusters, featuring InfiniBand networking. More specifically,
we present the sparse linear algebra algorithms that are proposed in the
literature, in particular the block Wiedemann algorithm. We discuss the
parallelization of the central matrix--vector product operation from both
algorithmic and practical points of view, and illustrate how our approach has
contributed to the recent record-sized DLP computation in GF($2^{809}$).
","[{'version': 'v1', 'created': 'Sat, 15 Feb 2014 07:10:15 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Dec 2014 19:28:20 GMT'}]",2014-12-05,"[['Jeljeli', 'Hamza', '', 'INRIA Nancy - Grand Est / LORIA']]","['Discrete logarithm problem', 'sparse linear algebra', 'parallel computing', 'GPU acceleration', 'multi-core processors', 'InfiniBand']"
18180,1403.7869,Badr Benmammar,Badr Benmammar (LTT),"Application des techniques d'ench\`eres dans les r\'eseaux de radio
  cognitive",in French,,,,cs.NI cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rapid proliferation of standards and radio services in recent years
caused the problem of spectrum scarcity. The main objective of Cognitive Radio
(CR) is to facilitate access to radio spectrum. Our contribution in this paper
is the use of auctions to solve the problem of spectrum congestion in the
context of CR, for that, we will combine the theory of auctions with
multi-agent systems. Our approach has shown that it is preferable to use the
Sealed-bid Auction with dynamic programming because this method has many
advantages over other methods.
  ---
  La prolif\'eration rapide de standards et services de radiocommunication ces
derni\`eres ann\'ees provoquent le probl\`eme de la p\'enurie du spectre. Dans
ce contexte, l'objectif principal de la Radio Cognitive (RC) est de faciliter
l'acc\`es au spectre radio. Notre contribution dans le cadre de ce papier est
l'utilisation des ench\`eres pour r\'esoudre le probl\`eme de l'encombrement du
spectre dans le cadre de la RC. Pour cela, nous avons combin\'e la th\'eorie
des ench\`eres avec les syst\`emes multi agents. Notre approche a prouv\'e
qu'il est pr\'ef\'erable d'utiliser les ench\`eres \`a Enveloppe Scell\'ee avec
programmation dynamique car cette m\'ethode a beaucoup d'avantages par rapport
aux autres m\'ethodes.
","[{'version': 'v1', 'created': 'Mon, 31 Mar 2014 04:38:23 GMT'}]",2014-04-01,"[['Benmammar', 'Badr', '', 'LTT']]","['Cognitive radio', 'auction theory', 'multi-agent system', 'dynamic programming', 'dynamic access spectrum']"
18181,1702.01396,Buyang Cao,"Yinhao Lu, Buyang Cao, Cesar Rego, Fred Glover","A Tabu Search based clustering algorithm and its parallel implementation
  on Spark",,,,,cs.DC cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The well-known K-means clustering algorithm has been employed widely in
different application domains ranging from data analytics to logistics
applications. However, the K-means algorithm can be affected by factors such as
the initial choice of centroids and can readily become trapped in a local
optimum. In this paper, we propose an improved K-means clustering algorithm
that is augmented by a Tabu Search strategy, and which is better adapted to
meet the needs of big data applications. Our design is further enhanced to take
advantage of parallel processing based on the Spark framework. Computational
experiments demonstrate the superiority of our Tabu Search based clustering
algorithm over a widely used version of the K-means approach embodied in Spark
MLlib, comparing the algorithms in terms of scalability, accuracy, and
effectiveness.
","[{'version': 'v1', 'created': 'Sun, 5 Feb 2017 13:03:12 GMT'}, {'version': 'v2', 'created': 'Sun, 1 Oct 2017 14:40:55 GMT'}, {'version': 'v3', 'created': 'Thu, 30 Nov 2017 23:47:36 GMT'}]",2017-12-04,"[['Lu', 'Yinhao', ''], ['Cao', 'Buyang', ''], ['Rego', 'Cesar', ''], ['Glover', 'Fred', '']]","['Clustering', '𝐾-means', 'Tabu Search', 'parallel computing', 'Spark', 'Big data']"
18182,1312.2132,Dorsa Sadigh,"Dorsa Sadigh, Henrik Ohlsson, S. Shankar Sastry, Sanjit A. Seshia","Robust Subspace System Identification via Weighted Nuclear Norm
  Optimization",Submitted to the IFAC World Congress 2014,,,,cs.SY cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Subspace identification is a classical and very well studied problem in
system identification. The problem was recently posed as a convex optimization
problem via the nuclear norm relaxation. Inspired by robust PCA, we extend this
framework to handle outliers. The proposed framework takes the form of a convex
optimization problem with an objective that trades off fit, rank and sparsity.
As in robust PCA, it can be problematic to find a suitable regularization
parameter. We show how the space in which a suitable parameter should be sought
can be limited to a bounded open set of the two dimensional parameter space. In
practice, this is very useful since it restricts the parameter space that is
needed to be surveyed.
","[{'version': 'v1', 'created': 'Sat, 7 Dec 2013 19:19:03 GMT'}]",2013-12-10,"[['Sadigh', 'Dorsa', ''], ['Ohlsson', 'Henrik', ''], ['Sastry', 'S. Shankar', ''], ['Seshia', 'Sanjit A.', '']]","['subspace identification', 'robust estimation', 'outliers', 'nuclear norm', 'sparsity', 'robustPCA']"
18183,1505.06939,Wei Shi,"William Lee Croft, Wei Shi, Jorg-Rudiger Sack, Jean-Pierre Corriveau",A Novel Geographic Partitioning System for Anonymizing Health Care Data,,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With large volumes of detailed health care data being collected, there is a
high demand for the release of this data for research purposes. Hospitals and
organizations are faced with conflicting interests of releasing this data and
protecting the confidentiality of the individuals to whom the data pertains.
Similarly, there is a conflict in the need to release precise geographic
information for certain research applications and the requirement to censor or
generalize the same information for the sake of confidentiality. Ultimately the
challenge is to anonymize data in order to comply with government privacy
policies while reducing the loss in geographic information as much as possible.
In this paper, we present a novel geographic-based system for the anonymization
of health care data. This system is broken up into major components for which
different approaches may be supplied. We compare such approaches in order to
make recommendations on which of them to select to best match user
requirements.
","[{'version': 'v1', 'created': 'Tue, 26 May 2015 13:30:19 GMT'}]",2015-05-27,"[['Croft', 'William Lee', ''], ['Shi', 'Wei', ''], ['Sack', 'Jorg-Rudiger', ''], ['Corriveau', 'Jean-Pierre', '']]","['Data Anonymization', 'Geographic Partitioning', 'Health Care']"
18184,0806.1636,Ian Pratt-Hartmann,Ian Pratt-Hartmann,Data-Complexity of the Two-Variable Fragment with Counting Quantifiers,,,,,cs.LO cs.AI cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The data-complexity of both satisfiability and finite satisfiability for the
two-variable fragment with counting is NP-complete; the data-complexity of both
query-answering and finite query-answering for the two-variable guarded
fragment with counting is co-NP-complete.
","[{'version': 'v1', 'created': 'Tue, 10 Jun 2008 11:08:07 GMT'}]",2008-06-11,"[['Pratt-Hartmann', 'Ian', '']]","['data-complexity', 'query answering', 'two-variable fragmentwith counting']"
18185,1505.03406,Tsvetan Asamov,Nuh Aydin and Tsvetan Asamov,A Database of $\mathbb{Z}_4$ Codes,,"Journal of Combinatorics, Information and System Sciences, Vol. 34
  No. 1-4 Comb, 2009, p: 1-12",,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There has been much research on codes over $\mathbb{Z}_4$, sometimes called
quaternary codes, for over a decade. Yet, no database is available for best
known quaternary codes. This work introduces a new database for quaternary
codes. It also presents a new search algorithm called genetic code search
(GCS), as well as new quaternary codes obtained by existing and new search
methods.
","[{'version': 'v1', 'created': 'Wed, 13 May 2015 14:38:59 GMT'}]",2015-05-14,"[['Aydin', 'Nuh', ''], ['Asamov', 'Tsvetan', '']]","['Quaternary codes', 'binary codes', 'cyclic codes', 'quasicyclic codes', 'genetic code search']"
18186,1209.0053,Nilanjan  Dey,"Nilanjan Dey, Moumita Pal, Achintya Das","A Session Based Blind Watermarking Technique within the NROI of Retinal
  Fundus Images for Authentication Using DWT, Spread Spectrum and Harris Corner
  Detection","9 pages, 10 figures","International Journal of Modern Engineering Research
  (IJMER),Vol.2, Issue.3,May-June 2012 pp-749-757,ISSN: 2249-6645",,,cs.CV cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Digital Retinal Fundus Images helps to detect various ophthalmic diseases by
detecting morphological changes in optical cup, optical disc and macula.
Present work proposes a method for the authentication of medical images based
on Discrete Wavelet Transformation (DWT) and Spread Spectrum. Proper selection
of the Non Region of Interest (NROI) for watermarking is crucial, as the area
under concern has to be the least required portion conveying any medical
information. Proposed method discusses both the selection of least impact area
and the blind watermarking technique. Watermark is embedded within the
High-High (HH) sub band. During embedding, watermarked image is dispersed
within the band using a pseudo random sequence and a Session key. Watermarked
image is extracted using the session key and the size of the image. In this
approach the generated watermarked image having an acceptable level of
imperceptibility and distortion is compared to the Original retinal image based
on Peak Signal to Noise Ratio (PSNR) and correlation value.
","[{'version': 'v1', 'created': 'Sat, 1 Sep 2012 04:17:39 GMT'}]",2012-09-04,"[['Dey', 'Nilanjan', ''], ['Pal', 'Moumita', ''], ['Das', 'Achintya', '']]","['DWT', 'Session Based Key', 'Pseudo Random Sequence', 'Harris Corner']"
18187,1609.04793,Loet Leydesdorff,"Loet Leydesdorff, Paul Wouters, and Lutz Bornmann","Professional and Citizen Bibliometrics: Complementarities and
  ambivalences in the development and use of indicators",Scientometrics (in press),,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bibliometric indicators such as journal impact factors, h-indices, and total
citation counts are algorithmic artifacts that can be used in research
evaluation and management. These artifacts have no meaning by themselves, but
receive their meaning from attributions in institutional practices. We
distinguish four main stakeholders in these practices: (1) producers of
bibliometric data and indicators; (2) bibliometricians who develop and test
indicators; (3) research managers who apply the indicators; and (4) the
scientists being evaluated with potentially competing career interests. These
different positions may lead to different and sometimes conflicting
perspectives on the meaning and value of the indicators. The indicators can
thus be considered as boundary objects which are socially constructed in
translations among these perspectives. This paper proposes an analytical
clarification by listing an informed set of (sometimes unsolved) problems in
bibliometrics which can also shed light on the tension between simple but
invalid indicators that are widely used (e.g., the h-index) and more
sophisticated indicators that are not used or cannot be used in evaluation
practices because they are not transparent for users, cannot be calculated, or
are difficult to interpret.
","[{'version': 'v1', 'created': 'Thu, 15 Sep 2016 19:33:39 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Sep 2016 09:42:48 GMT'}, {'version': 'v3', 'created': 'Fri, 23 Sep 2016 12:16:58 GMT'}]",2016-09-26,"[['Leydesdorff', 'Loet', ''], ['Wouters', 'Paul', ''], ['Bornmann', 'Lutz', '']]","['evaluative bibliometrics', 'scientometric indicators', 'validity', 'boundary object']"
18188,1301.0173,Doreswamy,Doreswamy,"Knowledge Discovery System For Fiber Reinforced Polymer Matrix Composite
  Laminate","International Journal of Computing, Vol. 2, Issue 7, pp. 121-130,
  July 2010. (ISSN 2151-9617)",,,,cs.AI cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper Knowledge Discovery System (KDS) is proposed and implemented
for the extraction of knowledge-mean stiffness of a polymer composite material
in which when fibers are placed at different orientations. Cosine amplitude
method is implemented for retrieving compatible polymer matrix and
reinforcement fiber which is coming under predicted fiber class, from the
polymer and reinforcement database respectively, based on the design
requirements. Fuzzy classification rules to classify fibers into short, medium
and long fiber classes are derived based on the fiber length and the computed
or derive critical length of fiber. Longitudinal and Transverse module of
Polymer Matrix Composite consisting of seven layers with different fiber volume
fractions and different fibers orientations at 0,15,30,45,60,75 and 90 degrees
are analyzed through Rule-of Mixture material design model. The analysis
results are represented in different graphical steps and have been measured
with statistical parameters. This data mining application implemented here has
focused the mechanical problems of material design and analysis. Therefore,
this system is an expert decision support system for optimizing the materials
performance for designing light-weight and strong, and cost effective polymer
composite materials.
","[{'version': 'v1', 'created': 'Wed, 2 Jan 2013 06:47:45 GMT'}]",2013-01-03,"[['Doreswamy', '', '']]","['Knowledgebase', 'Knowledge Discovery', 'Fuzzy similarity', 'Cosine amplitude method', 'Polymer Matrix Composite']"
18189,1705.08394,"Janis N\""otzel","Janis N\""otzel, Andreas Winter",Information Theoretic Principles of Universal Discrete Denoising,"10 pages, 6 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today, the internet makes tremendous amounts of data widely available. Often,
the same information is behind multiple different available data sets. This
lends growing importance to latent variable models that try to learn the hidden
information from the available imperfect versions. For example, social media
platforms can contain an abundance of pictures of the same person or object,
yet all of which are taken from different perspectives. In a simplified
scenario, one may consider pictures taken from the same perspective, which are
distorted by noise. This latter application allows for a rigorous mathematical
treatment, which is the content of this contribution. We apply a recently
developed method of dependent component analysis to image denoising when
multiple distorted copies of one and the same image are available, each being
corrupted by a different and unknown noise process. In a simplified scenario,
we assume that the distorted image is corrupted by noise that acts
independently on each pixel. We answer completely the question of how to
perform optimal denoising, when at least three distorted copies are available:
First we define optimality of an algorithm in the presented scenario, and then
we describe an aymptotically optimal universal discrete denoising algorithm
(UDDA). In the case of binary data and binary symmetric noise, we develop a
simplified variant of the algorithm, dubbed BUDDA, which we prove to attain
universal denoising uniformly.
","[{'version': 'v1', 'created': 'Tue, 23 May 2017 16:20:35 GMT'}]",2017-05-24,"[['Nötzel', 'Janis', ''], ['Winter', 'Andreas', '']]","['blind detection', 'image denoising', 'hidden variable', 'latent variable', 'internet of things']"
18190,1409.6621,Bernhard Rumpe,"Christoph Herrmann, Holger Krahn, Bernhard Rumpe, Martin Schindler,
  Steven V\""olkel",An Algebraic View on the Semantics of model Composition,"15 pages, 3 figures, 2 tables","Proceedings of the Third European Conference on Model Driven
  Architecture - Foundations and Applications (ECMDA-FA 2007), Haifa, Israel D.
  H. Akehurst, R. Vogel, R. F. Paige: LNCS 4530, pp. 99-113 Springer-Verlag
  Berlin-Heidelberg, 2007",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the increased complexity of software development projects more and
more systems are described by models. The sheer size makes it impractical to
describe these systems by a single model. Instead many models are developed
that provide several complementary views on the system to be developed. This
however leads to a need for compositional models. This paper describes a
foundational theory of model composition in form of an algebra to explicitly
clarify different variants and uses of composition, their interplay with the
semantics of the involved models and their composition operators.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 17:03:11 GMT'}]",2014-09-24,"[['Herrmann', 'Christoph', ''], ['Krahn', 'Holger', ''], ['Rumpe', 'Bernhard', ''], ['Schindler', 'Martin', ''], ['Völkel', 'Steven', '']]","['Model composition', 'Model merging', 'Semantics']"
18191,1602.08455,Lei You,"Lei You, Jianbo Li, Changjiang Wei, Lejuan Hu","MPAR: A Movement Pattern-Aware Optimal Routing for Social Delay Tolerant
  Networks",18 pages,,,,cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social Delay Tolerant Networks (SDTNs) are a special kind of Delay Tolerant
Network (DTN) that consists of a number of mobile devices with social
characteristics. The current research achievements on routing algorithms tend
to separately evaluate the available profit for each prospective relay node and
cannot achieve the global optimal performance in an overall perspective. In
this paper, we propose a Movement Pattern-Aware optimal Routing (MPAR) for
SDTNs, by choosing the optimal relay node(s) set for each message, which
eventually based on running a search algorithm on a hyper-cube solution space.
Concretely, the movement pattern of a group of node(s) can be extracted from
the movement records of nodes. Then the set of commonly visited locations for
the relay node(s) set and the destination node is obtained, by which we can
further evaluate the co-delivery probability of the relay node(s) set. Both
local search scheme and tabu-search scheme are utilized in finding the optimal
set, and the tabu-search based routing Tabu-MPAR is proved able to guide the
relay node(s) set in evolving to the optimal one. We demonstrate how the MPAR
algorithm significantly outperforms the previous ones through extensive
simulations, based on the synthetic SDTN mobility model.
","[{'version': 'v1', 'created': 'Fri, 26 Feb 2016 19:53:50 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Jun 2017 22:19:14 GMT'}]",2017-06-23,"[['You', 'Lei', ''], ['Li', 'Jianbo', ''], ['Wei', 'Changjiang', ''], ['Hu', 'Lejuan', '']]","['Delay Tolerant Networks', 'Mobile Social Networks', 'Movement', 'Opportunistic routing']"
18192,1212.6041,Seifedine Kadry Seifedine Kadry,"Seifedine Kadry, Jimbo Claver",XML parser GUI using .NET Technology,"IERI Procedia, Elsevier. 2012",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this paper is to implement software that can save time,
effort, and facilitate XML and XSL programming. The XML parser helps the
programmer to determine whether the XML document is Well-formed or not, by
specifying if any the positions of the errors.
","[{'version': 'v1', 'created': 'Tue, 25 Dec 2012 13:03:03 GMT'}]",2012-12-27,"[['Kadry', 'Seifedine', ''], ['Claver', 'Jimbo', '']]","['XML', 'XSL', 'Well formed document', 'GUI', 'NET']"
18193,1007.2980,Satish N. Srirama,Satish Narayana Srirama,Publishing and Discovery of Mobile Web Services in Peer to Peer Networks,"First International Workshop on Mobile Services and Personalized
  Environments (MSPE'06), November 16-17, 2006, pp. 15-28. Lecture Notes in
  Informatics, GI",,,,cs.IR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is now feasible to host Web Services on a mobile device due to the
advances in cellular devices and mobile communication technologies. However,
the reliability, usability and responsiveness of the Mobile Hosts depend on
various factors including the characteristics of available network,
computational resources, and better means of searching the services provided by
them. P2P enhances the adoption of Mobile Host in commercial environments.
Mobile Hosts in P2P can collaboratively share the resources of individual
peers. P2P also enhances the service discovery of huge number of Web Services
possible with Mobile Hosts. Advanced features like post filtering with weight
of keywords and context-awareness can also be exploited to select the best
possible mobile Web Service. This paper proposes the concept of Mobile Hosts in
P2P networks and identifies the means of publishing and discovery of Web
Services in mobile P2P networks.
","[{'version': 'v1', 'created': 'Sun, 18 Jul 2010 09:07:30 GMT'}]",2010-07-20,"[['Srirama', 'Satish Narayana', '']]","['context-awareness', 'Section 6 concludes the paper', 'proposes future research directions']"
18194,1511.04762,Ananya Christman,"Hamza Alsarhan, Davin Chia, Ananya Christman, Shannia Fu, Yanfeng Jin",Bin Packing with Multiple Colors,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the Colored Bin Packing problem a set of items with varying weights and
colors must be packed into bins of uniform weight limit such that no two items
of the same color may be packed adjacently within a bin. We solve this problem
for the case where there are two or more colors when the items have zero weight
and when the items have unit weight. Our algorithms are optimal and run in
linear time. Since our algorithms apply for two or more colors, they
demonstrate that the problem does not get harder as the number of colors
increases. We also provide closed-form expressions for the optimal number of
bins.
","[{'version': 'v1', 'created': 'Sun, 15 Nov 2015 20:28:24 GMT'}]",2015-11-17,"[['Alsarhan', 'Hamza', ''], ['Chia', 'Davin', ''], ['Christman', 'Ananya', ''], ['Fu', 'Shannia', ''], ['Jin', 'Yanfeng', '']]","['algorithms', 'combinatorial optimization', 'bin packing', 'colors', 'class']"
18195,1504.05122,Reinaldo Augusto Uribe Muriel,"Reinaldo Uribe Muriel, Fernando Lozando and Charles Anderson","Optimal Nudging: Solving Average-Reward Semi-Markov Decision Processes
  as a Minimal Sequence of Cumulative Tasks",,,,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a novel method to solve average-reward semi-Markov
decision processes, by reducing them to a minimal sequence of cumulative reward
problems. The usual solution methods for this type of problems update the gain
(optimal average reward) immediately after observing the result of taking an
action. The alternative introduced, optimal nudging, relies instead on setting
the gain to some fixed value, which transitorily makes the problem a
cumulative-reward task, solving it by any standard reinforcement learning
method, and only then updating the gain in a way that minimizes uncertainty in
a minmax sense. The rule for optimal gain update is derived by exploiting the
geometric features of the w-l space, a simple mapping of the space of policies.
The total number of cumulative reward tasks that need to be solved is shown to
be small. Some experiments are presented to explore the features of the
algorithm and to compare its performance with other approaches.
","[{'version': 'v1', 'created': 'Mon, 20 Apr 2015 16:58:26 GMT'}]",2015-04-21,"[['Muriel', 'Reinaldo Uribe', ''], ['Lozando', 'Fernando', ''], ['Anderson', 'Charles', '']]","['Reinforcement Learning', 'Average Rewards', 'Semi-Markov Decision Processes']"
18196,1510.03973,Mostafa Zaman Chowdhury,"Mostafa Zaman Chowdhury, Mohammad Arif Hossain, Shakil Ahmed, and
  Yeong Min Jang","Radio Resource Management Based on Reused Frequency Allocation for
  Dynamic Channel Borrowing Scheme in Wireless Networks","Journal paper (Wireless Networks, Online published)",,,,cs.NI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the modern era, cellular communication consumers are exponentially
increasing as they find the system more user-friendly. Due to enormous users
and their numerous demands, it has become a mandate to make the best use of the
limited radio resources that assures the highest standard of Quality of Service
(QoS). To reach the guaranteed level of QoS for the maximum number of users,
maximum utilization of bandwidth is not only the key issue to be considered,
rather some other factors like interference, call blocking probability etc. are
also needed to keep under deliberation. The lower performances of these factors
may retrograde the overall cellular networks performances. Keeping these
difficulties under consideration, we propose an effective dynamic channel
borrowing model that safeguards better QoS, other factors as well. The proposed
scheme reduces the excessive overall call blocking probability and does
interference mitigation without sacrificing bandwidth utilization. The proposed
scheme is modeled in such a way that the cells are bifurcated after the channel
borrowing process if the borrowed channels have the same type of frequency band
(i.e. reused frequency). We also propose that the unoccupied interfering
channels of adjacent cells can also be inactivated, instead of cell bifurcation
for interference mitigation. The simulation endings show satisfactory
performances in terms of overall call blocking probability and bandwidth
utilization that are compared to the conventional scheme without channel
borrowing. Furthermore, signal to interference plus noise ratio (SINR) level,
capacity, and outage probability are compared to the conventional scheme
without interference mitigation after channel borrowing that may attract the
considerable concentration to the operators.
","[{'version': 'v1', 'created': 'Wed, 14 Oct 2015 06:08:51 GMT'}]",2015-10-15,"[['Chowdhury', 'Mostafa Zaman', ''], ['Hossain', 'Mohammad Arif', ''], ['Ahmed', 'Shakil', ''], ['Jang', 'Yeong Min', '']]","['Dynamic channel borrowing', 'Quality of Service (QoS)', 'cell bifurcation', 'overall call blocking']"
18197,1704.05929,Hanna Furmanczyk,"Hanna Furma\'nczyk, Marek Kubale",Equitable Colorings of $l$-Corona Products of Cubic Graphs,12 pages,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A graph $G$ is equitably $k$-colorable if its vertices can be partitioned
into $k$ independent sets in such a way that the number of vertices in any two
sets differ by at most one. The smallest integer $k$ for which such a coloring
exists is known as the \emph{equitable chromatic number} of $G$ and it is
denoted by $\chi_{=}(G)$.
  In this paper the problem of determinig the value of equitable chromatic
number for multicoronas of cubic graphs $G \circ^l H$ is studied. The problem
of ordinary coloring of multicoronas of cubic graphs is solvable in polynomial
time. The complexity of equitable coloring problem is an open question for
these graphs. We provide some polynomially solvable cases of cubical
multicoronas and give simple linear time algorithms for equitable coloring of
such graphs which use at most $\chi_=(G \circ ^l H) + 1$ colors in the
remaining cases.
","[{'version': 'v1', 'created': 'Wed, 19 Apr 2017 20:52:39 GMT'}]",2017-04-21,"[['Furmańczyk', 'Hanna', ''], ['Kubale', 'Marek', '']]","['corona graph', 'l-corona products', 'cubic graph', 'equitable chromaticnumber', 'polynomial algorithm', '1-absolute aproximation algorithm']"
18198,1704.07091,Won Jun Hwang,"Wonjun Hwang, Yoora Kim, Kyunghan Lee","A Transient Queueing Analysis under Time-varying Arrival and Service
  Rates for Enabling Low-Latency Services","10 pages, 10 figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding the detailed queueing behavior of a networking session is
critical in enabling low-latency services over the Internet. Especially when
the packet arrival and service rates at the queue of a link vary over time and
moreover when the session is short-lived, analyzing the corresponding queue
behavior as a function of time, which involves a transient analysis, becomes
extremely challenging. In this paper, we propose and develop a new analytical
framework that anatomizes the transient queue behavior under time-varying
arrival and service rates even under unstable conditions. Our framework is
capable of answering key questions in designing low-latency services such as
the time-dependent probability distribution of the queue length; the
instantaneous or time-averaged violation probability that the queue length
exceeds a certain threshold; and the fraction of time during an interval $[0,
t]$ at which the queue length exceeds a certain threshold. We validate our
framework by comparing its prediction results over time with the statistical
simulation results and confirm that our analysis is accurate enough. Our
extensive demonstrations on the efficacy of the analytical framework in
designing low-latency services reveal that its prediction ability for the
transient queue behavior in diverse time-varying packet arrival and service
patterns can be of a high practical value.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 08:49:36 GMT'}]",2017-04-25,"[['Hwang', 'Wonjun', ''], ['Kim', 'Yoora', ''], ['Lee', 'Kyunghan', '']]","['Transient analysis', 'Qeueing', 'Time-varying process', 'Low-latencyservices']"
18199,0805.3059,Feng Xia,"Feng Xia, Youxian Sun, Yu-Chu Tian, Moses Tade, Jinxiang Dong","Fuzzy Feedback Scheduling of Resource-Constrained Embedded Control
  Systems","To appear in International Journal of Innovative Computing,
  Information and Control",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The quality of control (QoC) of a resource-constrained embedded control
system may be jeopardized in dynamic environments with variable workload. This
gives rise to the increasing demand of co-design of control and scheduling. To
deal with uncertainties in resource availability, a fuzzy feedback scheduling
(FFS) scheme is proposed in this paper. Within the framework of feedback
scheduling, the sampling periods of control loops are dynamically adjusted
using the fuzzy control technique. The feedback scheduler provides QoC
guarantees in dynamic environments through maintaining the CPU utilization at a
desired level. The framework and design methodology of the proposed FFS scheme
are described in detail. A simplified mobile robot target tracking system is
investigated as a case study to demonstrate the effectiveness of the proposed
FFS scheme. The scheme is independent of task execution times, robust to
measurement noises, and easy to implement, while incurring only a small
overhead.
","[{'version': 'v1', 'created': 'Tue, 20 May 2008 12:09:06 GMT'}]",2008-12-18,"[['Xia', 'Feng', ''], ['Sun', 'Youxian', ''], ['Tian', 'Yu-Chu', ''], ['Tade', 'Moses', ''], ['Dong', 'Jinxiang', '']]","['Feedback scheduling', 'Fuzzy logic control', 'Embedded control systems', 'Resource management', 'Mobile robot']"
18200,1704.04097,Juan Francisco Mar\'in,"Alejandro Cartas, Juan Mar\'in, Petia Radeva and Mariella Dimiccoli",Recognizing Activities of Daily Living from Egocentric Images,To appear in the Proceedings of IbPRIA 2017,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recognizing Activities of Daily Living (ADLs) has a large number of health
applications, such as characterize lifestyle for habit improvement, nursing and
rehabilitation services. Wearable cameras can daily gather large amounts of
image data that provide rich visual information about ADLs than using other
wearable sensors. In this paper, we explore the classification of ADLs from
images captured by low temporal resolution wearable camera (2fpm) by using a
Convolutional Neural Networks (CNN) approach. We show that the classification
accuracy of a CNN largely improves when its output is combined, through a
random decision forest, with contextual information from a fully connected
layer. The proposed method was tested on a subset of the NTCIR-12 egocentric
dataset, consisting of 18,674 images and achieved an overall accuracy of 86%
activity recognition on 21 classes.
","[{'version': 'v1', 'created': 'Thu, 13 Apr 2017 12:49:28 GMT'}]",2017-04-14,"[['Cartas', 'Alejandro', ''], ['Marín', 'Juan', ''], ['Radeva', 'Petia', ''], ['Dimiccoli', 'Mariella', '']]","['egocentric vision', 'lifelogging', 'activity recognition', 'convolutional neural networks']"
18201,0704.2542,Joan Llobera,Joan Llobera,Narratives within immersive technologies,5 pages,,,,cs.HC,,"  The main goal of this project is to research technical advances in order to
enhance the possibility to develop narratives within immersive mediated
environments. An important part of the research is concerned with the question
of how a script can be written, annotated and realized for an immersive
context. A first description of the main theoretical framework and the ongoing
work and a first script example is provided. This project is part of the
program for presence research, and it will exploit physiological feedback and
Computational Intelligence within virtual reality.
","[{'version': 'v1', 'created': 'Thu, 19 Apr 2007 14:27:25 GMT'}]",2007-05-23,"[['Llobera', 'Joan', '']]","['Drama', 'Storytelling', 'Interactive Drama', 'Virtual Reality', 'Immersive Environments']"
18202,1004.2873,Marcello M. Bersani,"Marcello M. Bersani, Luca Cavallaro, Achille Frigeri, Matteo Pradella,
  Matteo Rossi","SMT-based Verification of LTL Specifications with Integer Constraints
  and its Application to Runtime Checking of Service Substitutability",,,,,cs.LO cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An important problem that arises during the execution of service-based
applications concerns the ability to determine whether a running service can be
substituted with one with a different interface, for example if the former is
no longer available. Standard Bounded Model Checking techniques can be used to
perform this check, but they must be able to provide answers very quickly, lest
the check hampers the operativeness of the application, instead of aiding it.
The problem becomes even more complex when conversational services are
considered, i.e., services that expose operations that have Input/Output data
dependencies among them. In this paper we introduce a formal verification
technique for an extension of Linear Temporal Logic that allows users to
include in formulae constraints on integer variables. This technique applied to
the substitutability problem for conversational services is shown to be
considerably faster and with smaller memory footprint than existing ones.
","[{'version': 'v1', 'created': 'Fri, 16 Apr 2010 15:53:38 GMT'}]",2010-04-19,"[['Bersani', 'Marcello M.', ''], ['Cavallaro', 'Luca', ''], ['Frigeri', 'Achille', ''], ['Pradella', 'Matteo', ''], ['Rossi', 'Matteo', '']]","['Bounded Model Checking', 'SMT-solvers', 'ServiceOriented Architectures']"
18203,1108.2606,Mohamed-Haykel Zayani,"Mohamed-Haykel Zayani, Vincent Gauthier, Ines Slama, Djamal Zeghlache","Tensor-Based Link Prediction in Intermittently Connected Wireless
  Networks","13 pages, 9 figures, 8 tables, submitted to the International Journal
  of Computer and Telecommunications Networking (COMNET)",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Through several studies, it has been highlighted that mobility patterns in
mobile networks are driven by human behaviors. This effect has been
particularly observed in intermittently connected networks like DTN (Delay
Tolerant Networks). Given that common social intentions generate similar human
behavior, it is relevant to exploit this knowledge in the network protocols
design, e.g. to identify the closeness degree between two nodes. In this paper,
we propose a temporal link prediction technique for DTN which quantifies the
behavior similarity between each pair of nodes and makes use of it to predict
future links. Our prediction method keeps track of the spatio-temporal aspects
of nodes behaviors organized as a third-order tensor that aims to records the
evolution of the network topology. After collapsing the tensor information, we
compute the degree of similarity for each pair of nodes using the Katz measure.
This metric gives us an indication on the link occurrence between two nodes
relying on their closeness. We show the efficiency of this method by applying
it on three mobility traces: two real traces and one synthetic trace. Through
several simulations, we demonstrate the effectiveness of the technique
regarding another approach based on a similarity metric used in DTN. The
validity of this method is proven when the computation of score is made in a
distributed way (i.e. with local information). We attest that the tensor-based
technique is effective for temporal link prediction applied to the
intermittently connected networks. Furthermore, we think that this technique
can go beyond the realm of DTN and we believe this can be further applied on
every case of figure in which there is a need to derive the underlying social
structure of a network of mobile users.
","[{'version': 'v1', 'created': 'Fri, 12 Aug 2011 11:29:54 GMT'}]",2015-03-19,"[['Zayani', 'Mohamed-Haykel', ''], ['Gauthier', 'Vincent', ''], ['Slama', 'Ines', ''], ['Zeghlache', 'Djamal', '']]","['Link prediction', 'wireless networks', 'intermittent connections', 'tensor', 'Katz measure', 'behavior similarity', 'DTN']"
18204,1401.3112,Ming Liu,"Ming Liu (IETR), Matthieu Crussi\`ere (IETR), Maryline H\'elard
  (IETR), Jean-Fran\c{c}ois H\'elard (IETR)","Achieving Low-Complexity Maximum-Likelihood Detection for the 3D MIMO
  Code",,"EURASIP Journal on Wireless Communications and Networking (EURASIP
  JWCN) (2014) 1-27",,,cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The 3D MIMO code is a robust and efficient space-time block code (STBC) for
the distributed MIMO broadcasting but suffers from high maximum-likelihood (ML)
decoding complexity. In this paper, we first analyze some properties of the 3D
MIMO code to show that the 3D MIMO code is fast-decodable. It is proved that
the ML decoding performance can be achieved with a complexity of O(M^{4.5})
instead of O(M^8) in quasi static channel with M-ary square QAM modulations.
Consequently, we propose a simplified ML decoder exploiting the unique
properties of 3D MIMO code. Simulation results show that the proposed
simplified ML decoder can achieve much lower processing time latency compared
to the classical sphere decoder with Schnorr-Euchner enumeration.
","[{'version': 'v1', 'created': 'Tue, 14 Jan 2014 09:39:51 GMT'}]",2014-01-16,"[['Liu', 'Ming', '', 'IETR'], ['Crussière', 'Matthieu', '', 'IETR'], ['Hélard', 'Maryline', '', 'IETR'], ['Hélard', 'Jean-François', '', 'IETR']]","['MIMO', 'space-time codes', 'maximum likelihood decoding', 'computational complexity']"
18205,1402.1668,John Osborne,"John David Osborne, Binod Gyawali, Thamar Solorio",Evaluation of YTEX and MetaMap for clinical concept recognition,"6 pages, working notes to the ShareClef eHealth 2013 Shared Task",,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We used MetaMap and YTEX as a basis for the construc- tion of two separate
systems to participate in the 2013 ShARe/CLEF eHealth Task 1[9], the
recognition of clinical concepts. No modifications were directly made to these
systems, but output concepts were filtered using stop concepts, stop concept
text and UMLS semantic type. Con- cept boundaries were also adjusted using a
small collection of rules to increase precision on the strict task. Overall
MetaMap had better per- formance than YTEX on the strict task, primarily due to
a 20% perfor- mance improvement in precision. In the relaxed task YTEX had
better performance in both precision and recall giving it an overall F-Score
4.6% higher than MetaMap on the test data. Our results also indicated a 1.3%
higher accuracy for YTEX in UMLS CUI mapping.
","[{'version': 'v1', 'created': 'Fri, 7 Feb 2014 15:33:44 GMT'}]",2014-02-10,"[['Osborne', 'John David', ''], ['Gyawali', 'Binod', ''], ['Solorio', 'Thamar', '']]","['clinical concept recognition', 'MetaMap', 'YTEX', 'evaluation', 'information extraction']"
18206,1106.4719,Marc Thurley,"Lukas Moll, Siamak Tazari, Marc Thurley",Computing hypergraph width measures exactly,"12 pages, 1 figure",,,,cs.CC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hypergraph width measures are a class of hypergraph invariants important in
studying the complexity of constraint satisfaction problems (CSPs). We present
a general exact exponential algorithm for a large variety of these measures. A
connection between these and tree decompositions is established. This enables
us to almost seamlessly adapt the combinatorial and algorithmic results known
for tree decompositions of graphs to the case of hypergraphs and obtain fast
exact algorithms.
  As a consequence, we provide algorithms which, given a hypergraph H on n
vertices and m hyperedges, compute the generalized hypertree-width of H in time
O*(2^n) and compute the fractional hypertree-width of H in time
O(m*1.734601^n).
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2011 13:51:33 GMT'}]",2011-06-24,"[['Moll', 'Lukas', ''], ['Tazari', 'Siamak', ''], ['Thurley', 'Marc', '']]","['generalized hypertree-width', 'fractional hypertree-width', 'exact exponential algorithms', 'monotone f-width']"
18207,1702.00536,Kyeong Soo (Joseph) Kim,Yangyu Wang and Kyeong Soo Kim,"Multi-Hop Extensions of Energy-Efficient Wireless Sensor Network Time
  Synchronization","6 pages, 7 figures, Smart Grid Technology and Data Processing (SGTDP
  2017), Feb.16-18, 2017, Suzhou, China",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the multi-hop extensions of the recently proposed energy-efficient
time synchronization scheme for wireless sensor networks, which is based on the
asynchronous source clock frequency recovery and reversed two-way message
exchanges. We consider two hierarchical extensions based on packet relaying and
time-translating gateways, respectively, and analyze their performance with
respect to the number of layers and the delay variations through simulations.
The simulation results demonstrate that the time synchronization performance of
the packet relaying, which has lower complexity, is close to that of
time-translating gateways.
","[{'version': 'v1', 'created': 'Thu, 2 Feb 2017 04:05:33 GMT'}]",2017-02-03,"[['Wang', 'Yangyu', ''], ['Kim', 'Kyeong Soo', '']]","['Time synchronization', 'wireless sensor network', 'multi-hop extension', 'two-way message exchange']"
18208,1304.0732,Fotis Foukalas,F. Foukalas and G.T.Karetsos,On the Performance of Adaptive Modulation in Cognitive Radio Networks,arXiv admin note: text overlap with arXiv:1210.6910,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the performance of cognitive radio networks (CRNs) when
incorporating adaptive modulation at the physical layer. Three types of CRNs
are considered, namely opportunistic spectrum access (OSA), spectrum sharing
(SS) and sensing-based SS. We obtain closed-form expressions for the average
spectral efficiency achieved at the secondary network and the optimal power
allocation for both continuous and discrete rate types of adaptive modulation
assuming perfect channel state information. The obtained numerical results show
the achievable performance gain in terms of average spectral efficiency and the
impact on power allocation when adaptive modulation is implemented at the
physical layer that is due to the effect of the cut-off level that is
determined from the received signal-to-noise ratio for each CRN type. The
performance assessment is taking place for different target bit error rate
values and fading regions, thereby providing useful performance insights for
various possible implementations.
","[{'version': 'v1', 'created': 'Sat, 30 Mar 2013 21:23:27 GMT'}]",2013-04-03,"[['Foukalas', 'F.', ''], ['Karetsos', 'G. T.', '']]","['cognitive radio networks', 'adaptive modulation', 'optimal power allocation', 'opportunistic spectrum access', 'spectrum sharing', 'spectrum sensing']"
18209,0706.1066,Matthias Brust R.,Matthias R. Brust,"Applying Test-Paradigms in a Generic Tutoring System Concept for
  Web-based Learning",Information and Resource Management (IRMA 2003),,,,cs.CY,,"  Realizing test scenarios through a tutoring system involve questions about
architecture and didactic methods in such a system. Observing the fact that
traditional tutoring systems normally are domain-static, this paper shows
investigations for a generic domain-independent tutoring system for utilizing
test scenarios in computer-based and web-based environments. Furthermore, test
paradigms are analyzed and it is presented an approach for realizing
functionality for applying test paradigms in the presented generic tutoring
system architecture by an XML-specified language.
","[{'version': 'v1', 'created': 'Thu, 7 Jun 2007 19:55:11 GMT'}]",2007-06-08,"[['Brust', 'Matthias R.', '']]","['Tutoring system', 'test paradigm', 'XML']"
18210,1208.2292,Mariano Tepper,Mariano Tepper and Guillermo Sapiro,"L1 Splines for Robust, Simple, and Fast Smoothing of Grid Data",,,,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Splines are a popular and attractive way of smoothing noisy data. Computing
splines involves minimizing a functional which is a linear combination of a
fitting term and a regularization term. The former is classically computed
using a (weighted) L2 norm while the latter ensures smoothness. Thus, when
dealing with grid data, the optimization can be solved very efficiently using
the DCT. In this work we propose to replace the L2 norm in the fitting term
with an L1 norm, leading to automatic robustness to outliers. To solve the
resulting minimization problem we propose an extremely simple and efficient
numerical scheme based on split-Bregman iteration combined with DCT.
Experimental validation shows the high-quality results obtained in short
processing times.
","[{'version': 'v1', 'created': 'Fri, 10 Aug 2012 22:09:15 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Aug 2012 13:51:26 GMT'}]",2012-08-15,"[['Tepper', 'Mariano', ''], ['Sapiro', 'Guillermo', '']]","['Splines', 'L1 fitting', 'split-Bregman', 'grid data']"
18211,1505.05186,Emanuel Diamant,Emanuel Diamant,Advances in Computational Biology: A Real Boost or a Wishful Thinking,"The paper was submitted to the ICCS-2015 conference (Reykjavik,
  Iceland, June 1-3, 2015) and was rejected as irrelevant to the conference
  topic. arXiv admin note: text overlap with arXiv:1411.0054, arXiv:1502.04791,
  arXiv:1505.04785",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computational biology is on the verge of a paradigm shift in its research
practice - from a data-based (computational) paradigm to an information-based
(cognitive) paradigm. As in the other research fields, this transition is
impeded by lack of a right understanding about what is actually hidden behind
the term ""information"". The paper is intended to clarify this issue and
introduces two new notions of ""physical information"" and ""semantic
information"", which together constitute the term ""information"". Some
implications of this introduction are considered.
","[{'version': 'v1', 'created': 'Mon, 18 May 2015 10:51:50 GMT'}]",2015-05-21,"[['Diamant', 'Emanuel', '']]","['Biological information', 'Physical information', 'Semantic information', 'information processing']"
18212,1707.07846,Cong Luong Nguyen,"Nguyen Cong Luong, Dinh Thai Hoang, Ping Wang, Dusit Niyato, Zhu Han","Applications of Economic and Pricing Models for Wireless Network
  Security: A Survey",,,,,cs.GT cs.CR cs.NI,http://creativecommons.org/publicdomain/zero/1.0/,"  This paper provides a comprehensive literature review on applications of
economic and pricing theory to security issues in wireless networks. Unlike
wireline networks, the broadcast nature and the highly dynamic change of
network environments pose a number of nontrivial challenges to security design
in wireless networks. While the security issues have not been completely solved
by traditional or system-based solutions, economic and pricing models recently
were employed as one efficient solution to discourage attackers and prevent
attacks to be performed. In this paper, we review economic and pricing
approaches proposed to address major security issues in wireless networks
including eavesdropping attack, Denial-of-Service (DoS) attack such as jamming
and Distributed DoS (DDoS), and illegitimate behaviors of malicious users.
Additionally, we discuss integrating economic and pricing models with
cryptography methods to reduce information privacy leakage as well as to
guarantee the confidentiality and integrity of information in wireless
networks. Finally, we highlight important challenges, open issues and future
research directions of applying economic and pricing models to wireless
security issues.
","[{'version': 'v1', 'created': 'Tue, 25 Jul 2017 08:21:00 GMT'}]",2017-07-26,"[['Luong', 'Nguyen Cong', ''], ['Hoang', 'Dinh Thai', ''], ['Wang', 'Ping', ''], ['Niyato', 'Dusit', ''], ['Han', 'Zhu', '']]","['Security', 'wireless networks', 'pricing models', 'economic theories']"
18213,1610.04872,Bodhisattwa Majumder,"Bodhisattwa Prasad Majumder, Ayan Sengupta, Sajal jain, Parikshit
  Bhaduri","Fault Detection Engine in Intelligent Predictive Analytics Platform for
  DCIM","Accepted in 4th International Conference on Business Analytics and
  Intelligence (ICBAI 2016)",,,,cs.AI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the advancement of huge data generation and data handling capability,
Machine Learning and Probabilistic modelling enables an immense opportunity to
employ predictive analytics platform in high security critical industries
namely data centers, electricity grids, utilities, airport etc. where downtime
minimization is one of the primary objectives. This paper proposes a novel,
complete architecture of an intelligent predictive analytics platform, Fault
Engine, for huge device network connected with electrical/information flow.
Three unique modules, here proposed, seamlessly integrate with available
technology stack of data handling and connect with middleware to produce online
intelligent prediction in critical failure scenarios. The Markov Failure module
predicts the severity of a failure along with survival probability of a device
at any given instances. The Root Cause Analysis model indicates probable
devices as potential root cause employing Bayesian probability assignment and
topological sort. Finally, a community detection algorithm produces correlated
clusters of device in terms of failure probability which will further narrow
down the search space of finding route cause. The whole Engine has been tested
with different size of network with simulated failure environments and shows
its potential to be scalable in real-time implementation.
","[{'version': 'v1', 'created': 'Sun, 16 Oct 2016 15:14:36 GMT'}]",2016-10-18,"[['Majumder', 'Bodhisattwa Prasad', ''], ['Sengupta', 'Ayan', ''], ['jain', 'Sajal', ''], ['Bhaduri', 'Parikshit', '']]","['Markov Model', 'Recovery function', 'Weibull', 'Root Cause Analysis', 'Correlated Clustering']"
18214,0910.0819,Rdv Ijcsis,"Md. Ashraful Islam, Riaz Uddin Mondal, Md. Zahid Hasan","Performance Evaluation of Wimax Physical Layer under Adaptive Modulation
  Techniques and Communication Channels","4 pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 5, No. 1, pp. 111-114, September 2009, USA",,ISSn 1947 5500,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wimax (Worldwide Interoperability for Microwave Access) is a promising
technology which can offer high speed voice, video and data service up to the
customer end. The aim of this paper is the performance evaluation of an Wimax
system under different combinations of digital modulation (BPSK, QPSK, 4 QAM
and 16 QAM) and different communication channels AWGN and fading channels
(Rayleigh and Rician). And the Wimax system incorporates Reed Solomon (RS)
encoder with Convolutional encoder with half and two third rated codes in FEC
channel coding. The simulation results of estimated Bit Error Rate (BER)
displays that the implementation of interleaved RS code (255, 239, 8) with two
third rated Convolutional code under BPSK modulation technique is highly
effective to combat in the Wimax communication system. To complete this
performance analysis in Wimax based systems, a segment of audio signal is used
for analysis. The transmitted audio message is found to have retrieved
effectively under noisy situation.
","[{'version': 'v1', 'created': 'Mon, 5 Oct 2009 18:30:05 GMT'}]",2009-10-06,"[['Islam', 'Md. Ashraful', ''], ['Mondal', 'Riaz Uddin', ''], ['Hasan', 'Md. Zahid', '']]","['OFDM', 'Block Coding', 'Convolution coding', 'Additive White Gaussian Noise', 'Fading Channel']"
18215,1404.0530,Xinyang Deng,"Haixin Zhang, Daijun Wei, Yong Hu, Xin Lan, Yong Deng",Modelling the Self-similarity in Complex Networks Based on Coulomb's Law,"25 pages, 11 figures",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, self-similarity of complex networks have attracted much attention.
Fractal dimension of complex network is an open issue. Hub repulsion plays an
important role in fractal topologies. This paper models the repulsion among the
nodes in the complex networks in calculation of the fractal dimension of the
networks. The Coulomb's law is adopted to represent the repulse between two
nodes of the network quantitatively. A new method to calculate the fractal
dimension of complex networks is proposed. The Sierpinski triangle network and
some real complex networks are investigated. The results are illustrated to
show that the new model of self-similarity of complex networks is reasonable
and efficient.
","[{'version': 'v1', 'created': 'Tue, 1 Apr 2014 14:12:33 GMT'}]",2014-04-03,"[['Zhang', 'Haixin', ''], ['Wei', 'Daijun', ''], ['Hu', 'Yong', ''], ['Lan', 'Xin', ''], ['Deng', 'Yong', '']]","['self-similarity', 'complex networks', 'fractal dimension', 'Coulomb’s']"
18216,1008.1900,Ali Khajeh-Hosseini,"Ali Khajeh-Hosseini, David Greenwood, James W. Smith, Ian Sommerville","The Cloud Adoption Toolkit: Supporting Cloud Adoption Decisions in the
  Enterprise",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing promises a radical shift in the provisioning of computing
resource within the enterprise. This paper describes the challenges that
decision makers face when assessing the feasibility of the adoption of cloud
computing in their organisations, and describes our Cloud Adoption Toolkit,
which has been developed to support this process. The toolkit provides a
framework to support decision makers in identifying their concerns, and
matching these concerns to appropriate tools/techniques that can be used to
address them. Cost Modeling is the most mature tool in the toolkit, and this
paper shows its effectiveness by demonstrating how practitioners can use it to
examine the costs of deploying their IT systems on the cloud. The Cost Modeling
tool is evaluated using a case study of an organization that is considering the
migration of some of its IT systems to the cloud. The case study shows that
running systems on the cloud using a traditional ""always on"" approach can be
less cost effective, and the elastic nature of the cloud has to be used to
reduce costs. Therefore, decision makers have to be able to model the
variations in resource usage and their systems deployment options to obtain
accurate cost estimates.
","[{'version': 'v1', 'created': 'Wed, 11 Aug 2010 12:56:32 GMT'}]",2010-08-12,"[['Khajeh-Hosseini', 'Ali', ''], ['Greenwood', 'David', ''], ['Smith', 'James W.', ''], ['Sommerville', 'Ian', '']]","['Cloud computing', 'organizational change', 'cloud adoption', 'decision support', 'system deployment', 'infrastructure modeling']"
18217,1501.02917,Martin Kasparick,"Gerhard Wunder, Martin Kasparick, Peter Jung","Spline Waveforms and Interference Analysis for 5G Random Access with
  Short Message Support",Updated version with publication information on front page,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the main drivers for new waveforms in future 5G wireless communication
systems is to handle efficiently the variety of traffic types and requirements.
In this paper, we introduce a new random access within the standard acquisition
procedures to support sporadic traffic as an enabler of the Internet of Things
(IoT). The major challenge hereby is to cope with the highly asynchronous
access of different devices and to allow transmission of control signaling and
payload ""in one shot"". We address this challenge by using a waveform design
approach based on bi-orthogonal frequency division multiplexing where transmit
orthogonality is replaced in favor of better temporal and spectral properties.
We show that this approach allows data transmission in frequencies that
otherwise have to remain unused. More precisely, we utilize frequencies
previously used as guard bands, located towards the standard synchronous
communication pipes as well as in between the typically small amount of
resources used by each IoT device. We demonstrate the superiority of this
waveform approach over the conventional random access using a novel
mathematical approach and numerical experiments.
","[{'version': 'v1', 'created': 'Tue, 13 Jan 2015 08:49:09 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Jan 2015 08:24:40 GMT'}, {'version': 'v3', 'created': 'Mon, 16 Jan 2017 08:34:41 GMT'}]",2017-01-17,"[['Wunder', 'Gerhard', ''], ['Kasparick', 'Martin', ''], ['Jung', 'Peter', '']]","['Waveform design', 'bi-orthogonal frequency division multiplexing', 'splines', 'MTC', 'IoT', 'massive random']"
18218,1206.3747,Loet Leydesdorff,Loet Leydesdorff,"Statistics for the Dynamic Analysis of Scientometric Data: The evolution
  of the sciences in terms of trajectories and regimes","Scientometrics, in press (Nov. 2012)",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The gap in statistics between multi-variate and time-series analysis can be
bridged by using entropy statistics and recent developments in
multi-dimensional scaling. For explaining the evolution of the sciences as
non-linear dynamics, the configurations among variables can be important in
addition to the statistics of individual variables and trend lines. Animations
enable us to combine multiple perspectives (based on configurations of
variables) and to visualize path-dependencies in terms of trajectories and
regimes. Path-dependent transitions and systems formation can be tested using
entropy statistics.
","[{'version': 'v1', 'created': 'Sun, 17 Jun 2012 11:51:13 GMT'}, {'version': 'v2', 'created': 'Sat, 10 Nov 2012 14:34:39 GMT'}]",2012-11-13,"[['Leydesdorff', 'Loet', '']]","['dynamic', 'evolution', 'trajectories', 'regimes', 'entropy']"
18219,1402.0997,Liliana Pasquale,"Liliana Pasquale. Yijun Yu, Luca Cavallaro, Mazeiar Salehie, Thein
  Than Tun, Bashar Nuseibeh",Engineering Adaptive Digital Investigations using Forensics Requirements,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A digital forensic investigation aims to collect and analyse the evidence
necessary to demonstrate a potential hypothesis of a digital crime. Despite the
availability of several digital forensics tools, investigators still approach
each crime case from scratch, postulating potential hypotheses and analysing
large volumes of data. This paper proposes to explicitly model forensic
requirements in order to engineer software systems that are forensic-ready and
guide the activities of a digital investigation. Forensic requirements relate
some speculative hypotheses of a crime to the evidence that should be collected
and analysed in a crime scene. In contrast to existing approaches, we propose
to perform proactive activities to preserve important - potentially ephemeral -
evidence, depending on the risk of a crime to take place. Once an investigation
starts, the evidence collected proactively is analysed to assess if some of the
speculative hypotheses of a crime hold and what further evidence is necessary
to support them. For each hypothesis that is satisfied, a structured argument
is generated to demonstrate how the evidence collected supports that
hypothesis. Our evaluation results suggest that the approach provides correct
investigative findings and reduces significantly the amount of evidence to be
collected and the hypotheses to be analysed.
","[{'version': 'v1', 'created': 'Wed, 5 Feb 2014 10:19:25 GMT'}]",2014-02-06,"[['Yu', 'Liliana Pasquale. Yijun', ''], ['Cavallaro', 'Luca', ''], ['Salehie', 'Mazeiar', ''], ['Tun', 'Thein Than', ''], ['Nuseibeh', 'Bashar', '']]","['Digital forensics', 'forensic requirements', 'adaptation', 'arguments']"
18220,1606.08942,Olivia Simpson,Olivia Simpson and Julian McAuley,Predicting risky behavior in social communities,,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predicting risk profiles of individuals in networks (e.g.~susceptibility to a
particular disease, or likelihood of smoking) is challenging for a variety of
reasons. For one, `local' features (such as an individual's demographic
information) may lack sufficient information to make informative predictions;
this is especially problematic when predicting `risk,' as the relevant features
may be precisely those that an individual is disinclined to reveal in a survey.
Secondly, even if such features are available, they still may miss crucial
information, as `risk' may be a function not just of an individual's features
but also those of their friends and social communities. Here, we predict
individual's risk profiles as a function of both their local features and those
of their friends. Instead of modeling influence from the social network
directly (which proved difficult as friendship links may be sparse and
partially observed), we instead model influence by discovering social
communities in the network that may be related to risky behavior. The result is
a model that predicts risk as a function of local features, while making up for
their deficiencies and accounting for social influence by uncovering community
structure in the network. We test our model by predicting risky behavior among
adolescents from the Add health data set, and hometowns among users in a
Facebook ego net. Compared to prediction by features alone, our model
demonstrates better predictive accuracy when measured as a whole, and in
particular when measured as a function of network ""richness.""
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2016 03:14:34 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Dec 2016 22:51:33 GMT'}]",2016-12-06,"[['Simpson', 'Olivia', ''], ['McAuley', 'Julian', '']]","['Community detection', 'social influence', 'network labeling']"
18221,1704.01610,Christina Lioma Assoc. Prof,"Christina Lioma and Birger Larsen and Hinrich Sch\""utze and Peter
  Ingwersen","A Subjective Logic Formalisation of the Principle of Polyrepresentation
  for Information Needs",,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interactive Information Retrieval refers to the branch of Information
Retrieval that considers the retrieval process with respect to a wide range of
contexts, which may affect the user's information seeking experience. The
identification and representation of such contexts has been the object of the
principle of Polyrepresentation, a theoretical framework for reasoning about
different representations arising from interactive information retrieval in a
given context. Although the principle of Polyrepresentation has received
attention from many researchers, not much empirical work has been done based on
it. One reason may be that it has not yet been formalised mathematically. In
this paper we propose an up-to-date and exible mathematical formalisation of
the principle of Polyrepresentation for information needs. Specifically, we
apply Subjective Logic to model different representations of information needs
as beliefs marked by degrees of uncertainty. We combine such beliefs using
different logical operators, and we discuss these combinations with respect to
different retrieval scenarios and situations. A formal model is introduced and
discussed, with illustrative applications to the modelling of information
needs.
","[{'version': 'v1', 'created': 'Wed, 5 Apr 2017 18:55:37 GMT'}]",2017-04-07,"[['Lioma', 'Christina', ''], ['Larsen', 'Birger', ''], ['Schütze', 'Hinrich', ''], ['Ingwersen', 'Peter', '']]","['Polyrepresentation', 'Subjective Logic', 'Information Needs']"
18222,1511.02801,Du\v{s}an Knop,Du\v{s}an Knop and Pavel Dvo\v{r}\'ak,Parameterized complexity of length-bounded cuts and multi-cuts,"20 pages, 7 figures, TAMC 2015 proceedings",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that the Minimal Length-Bounded L-But problem can be computed in
linear time with respect to L and the tree-width of the input graph as
parameters. In this problem the task is to find a set of edges of a graph such
that after removal of this set, the shortest path between two prescribed
vertices is at least L long. We derive an FPT algorithm for a more general
multi-commodity length bounded cut problem when parameterized by the number of
terminals also.
  For the former problem we show a W[1]-hardness result when the
parameterization is done by the path-width only (instead of the tree-width) and
that this problem does not admit polynomial kernel when parameterized by
tree-width and L. We also derive an FPT algorithm for the Minimal
Length-Bounded Cut problem when parameterized by the tree-depth. Thus showing
an interesting paradigm for this problem and parameters tree-depth and
path-width.
","[{'version': 'v1', 'created': 'Mon, 9 Nov 2015 18:53:32 GMT'}]",2016-10-25,"[['Knop', 'Dušan', ''], ['Dvořák', 'Pavel', '']]","['length bounded cuts', 'parameterized algorithms', 'W[1]-hardness']"
18223,1710.02095,Preslav Nakov,"Francisco Guzm\'an, Shafiq R. Joty, Llu\'is M\`arquez, Preslav Nakov",Machine Translation Evaluation with Neural Networks,"Machine Translation, Reference-based MT Evaluation, Deep Neural
  Networks, Distributed Representation of Texts, Textual Similarity",Computer Speech & Language 45: 180-200 (2017),,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a framework for machine translation evaluation using neural
networks in a pairwise setting, where the goal is to select the better
translation from a pair of hypotheses, given the reference translation. In this
framework, lexical, syntactic and semantic information from the reference and
the two hypotheses is embedded into compact distributed vector representations,
and fed into a multi-layer neural network that models nonlinear interactions
between each of the hypotheses and the reference, as well as between the two
hypotheses. We experiment with the benchmark datasets from the WMT Metrics
shared task, on which we obtain the best results published so far, with the
basic network configuration. We also perform a series of experiments to analyze
and understand the contribution of the different components of the network. We
evaluate variants and extensions, including fine-tuning of the semantic
embeddings, and sentence-based representations modeled with convolutional and
recurrent neural networks. In summary, the proposed framework is flexible and
generalizable, allows for efficient learning and scoring, and provides an MT
evaluation metric that correlates with human judgments, and is on par with the
state of the art.
","[{'version': 'v1', 'created': 'Thu, 5 Oct 2017 16:18:08 GMT'}]",2017-10-06,"[['Guzmán', 'Francisco', ''], ['Joty', 'Shafiq R.', ''], ['Màrquez', 'Lluís', ''], ['Nakov', 'Preslav', '']]","['Machine Translation', 'Reference-based MT Evaluation', 'Deep']"
18224,1401.6145,Monowar Hasan,Hesham ElSawy and Ekram Hossain,"On Stochastic Geometry Modeling of Cellular Uplink Transmission with
  Truncated Channel Inversion Power Control",Submitted to IEEE Transactions on Wireless Communications (TWC),,,,cs.IT cs.NI math.IT math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using stochastic geometry, we develop a tractable uplink modeling paradigm
for outage probability and spectral efficiency in both single and multi-tier
cellular wireless networks. The analysis accounts for per user equipment (UE)
power control as well as the maximum power limitations for UEs. More
specifically, for interference mitigation and robust uplink communication, each
UE is required to control its transmit power such that the average received
signal power at its serving base station (BS) is equal to a certain threshold
$\rho_o$. Due to the limited transmit power, the UEs employ a truncated channel
inversion power control policy with a cutoff threshold of $\rho_o$. We show
that there exists a transfer point in the uplink system performance that
depends on the tuple: BS intensity ($\lambda$), maximum transmit power of UEs
($P_u$), and $\rho_o$. That is, when $P_u$ is a tight operational constraint
with respect to [w.r.t.] $\lambda$ and $\rho_o$, the uplink outage probability
and spectral efficiency highly depend on the values of $\lambda$ and $\rho_o$.
In this case, there exists an optimal cutoff threshold $\rho^*_o$, which
depends on the system parameters, that minimizes the outage probability. On the
other hand, when $P_u$ is not a binding operational constraint w.r.t. $\lambda$
and $\rho_o$, the uplink outage probability and spectral efficiency become
independent of $\lambda$ and $\rho_o$. We obtain approximate yet accurate
simple expressions for outage probability and spectral efficiency which reduce
to closed-forms in some special cases.
","[{'version': 'v1', 'created': 'Thu, 23 Jan 2014 19:59:44 GMT'}]",2014-01-24,"[['ElSawy', 'Hesham', ''], ['Hossain', 'Ekram', '']]","['Multi-tier cellular networks', 'uplink communication', 'power control', 'truncated channel inversion', 'stochasticgeometry']"
18225,1410.5815,Santosh Majhi,Santosh Kumar Majhi and Padmalochan Bera,OHMF: A Query Based Optimal Healthcare Medication Framework,,"International Journal of Information Processing, 8(3), 1-12, 2014
  ISSN : 0973-8215",,,cs.CY cs.IR cs.MA cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today cloud computing infrastructure is largely being deployed in healthcare
to access various healthcare services easily over the Internet on an as needed
basis. The main advantage of healthcare cloud is that it can be used as a tool
for patients, medical professionals and insurance providers, to query and
coordinate among medical departments, organizations and other healthcare
related hubs. Although healthcare cloud services can enable better medication
process with high responsiveness, but the privacy and other requirements of the
patients need to be ensured in the process. Patients medical data may be
required by the medical professionals, hospitals, diagnostic centers for
analysis and diagnosis. However, data privacy and service quality cannot be
compromised. In other words, there may exist various service providers
corresponding to a specific healthcare service. The main challenge is to find
the appropriate providers that comply best with patients requirement. In this
paper, we propose a query based optimal medication framework to support the
patients healthcare service accessibility comprehensively with considerable
response time. The framework accepts related healthcare queries in natural
language through a comprehensive user-interface and then processes the input
query through a first order logic based evaluation engine and finds all
possible services satisfying the requirements. First order logic is used for
modeling of user requirements and queries. The query evaluation engine is built
using zChaff, a Boolean logic satisfiability solver. The efficacy and usability
of the framework is evaluated with initial case studies on synthetic and real
life healthcare cloud.
","[{'version': 'v1', 'created': 'Tue, 21 Oct 2014 18:18:11 GMT'}]",2014-10-23,"[['Majhi', 'Santosh Kumar', ''], ['Bera', 'Padmalochan', '']]","['Cloud healthcare', 'First-order logic', 'zChaff SAT']"
18226,1108.5904,Shailesh Vaya,Shailesh Vaya,Information Dissemination in Unknown Radio networks with Large Labels,19 pages,,,,cs.DC cs.DM cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problems of deterministic broadcasting and gossiping in
completely unknown ad-hoc radio networks. We assume that nothing is known to
the nodes about the topology or even the size of the network, $n$, except that
$n > 1$. Protocols for vanilla model, when $n$ is known, may be run for
increasingly larger estimates $2^i$ on the size of the network, but one cannot
determine when such a protocol should terminate. Thus, to carry this design
paradigm, successful completion or in-completion of the process should be
detected, and this knowledge circulated in the network. We consider the problem
of deterministic Acknowledged Broadcasting and Gossiping when nodes can take
polynomially large labels.
  For the above setting, we present the following results for strongly
connected networks: (a) A deterministic protocol for acknowledged broadcasting
which takes $NRG(n,n^c)$ rounds, where $NRG(n,n^c)$ is the round complexity of
deterministic gossiping for vanilla model. (b) A deterministic protocol for
acknowledged gossiping, which takes $O(n^2 \lg n)$ rounds when collision
detection mechanism is available. The structure of the transmissions of nodes
in the network, to enable them to infer collisions, and discover existence of
unknown in-neighborhood as a result, is abstracted as a family of integral sets
called Selecting-Colliding family. We prove the existence of
Selecting-Colliding families using the probabilistic method and employ them to
design protocol for acknowledged gossiping when no collision detection
mechanism is available.
  Finally, we present a deterministic protocol for acknowledged broadcasting
for bidirectional networks, with a round complexity of $O(n \lg n)$ rounds.
","[{'version': 'v1', 'created': 'Tue, 30 Aug 2011 10:16:16 GMT'}]",2011-08-31,"[['Vaya', 'Shailesh', '']]","['Unknown Radio Networks', 'Acknowledged Broadcasting and Gossiping', 'Polynomially LargeLabels', 'Selecting-Colliding Families']"
18227,1307.1598,Uwe Aickelin,Christopher M. Roadknight and Uwe Aickelin,Extending a Microsimulation of the Port of Dover,"ORS SW12 Simulation Conference, 2012",,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modelling and simulating the traffic of heavily used but secure environments
such as seaports and airports is of increasing importance. This paper discusses
issues and problems that may arise when extending an existing microsimulation
strategy. We also discuss how extensions of these simulations can aid planners
with optimal physical and operational feedback. Conclusions are drawn about how
microsimulations can be moved forward as a robust planning tool for the 21st
century.
","[{'version': 'v1', 'created': 'Fri, 5 Jul 2013 12:46:33 GMT'}]",2013-07-08,"[['Roadknight', 'Christopher M.', ''], ['Aickelin', 'Uwe', '']]","['Simulation validation', 'Operations Research', 'Agents']"
18228,1507.01569,Ashique Rupam Mahmood,"A. Rupam Mahmood, Huizhen Yu, Martha White, Richard S. Sutton",Emphatic Temporal-Difference Learning,"9 pages, accepted for presentation at European Workshop on
  Reinforcement Learning",,,,cs.LG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Emphatic algorithms are temporal-difference learning algorithms that change
their effective state distribution by selectively emphasizing and
de-emphasizing their updates on different time steps. Recent works by Sutton,
Mahmood and White (2015), and Yu (2015) show that by varying the emphasis in a
particular way, these algorithms become stable and convergent under off-policy
training with linear function approximation. This paper serves as a unified
summary of the available results from both works. In addition, we demonstrate
the empirical benefits from the flexibility of emphatic algorithms, including
state-dependent discounting, state-dependent bootstrapping, and the
user-specified allocation of function approximation resources.
","[{'version': 'v1', 'created': 'Mon, 6 Jul 2015 19:28:36 GMT'}]",2015-07-07,"[['Mahmood', 'A. Rupam', ''], ['Yu', 'Huizhen', ''], ['White', 'Martha', ''], ['Sutton', 'Richard S.', '']]","['temporal-difference learning', 'function approximation', 'off-policy learning', 'stability', 'convergence']"
18229,1710.05191,Noushin Eftekhari,"Noushin Eftekheri, Mojtaba Masoudi, Hamidreza Pourreza, Kamaledin
  Ghiasi Shirazi, Ehsan Saeedi","Microaneurysm Detection in Fundus Images Using a Two-step Convolutional
  Neural Networks",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Diabetic Retinopathy (DR) is a prominent cause of blindness in the world. The
early treatment of DR can be conducted from detection of microaneurysms (MAs)
which appears as reddish spots in retinal images. An automated microaneurysm
detection can be a helpful system for ophthalmologists. In this paper, deep
learning, in particular convolutional neural network (CNN), is used as a
powerful tool to efficiently detect MAs from fundus images. In our method a new
technique is used to utilise a two-stage training process which results in an
accurate detection, while decreasing computational complexity in comparison
with previous works. To validate our proposed method, an experiment is
conducted using Keras library to implement our proposed CNN on two standard
publicly available datasets. Our results show a promising sensitivity value of
about 0.8 at the average number of false positive per image greater than 6
which is a competitive value with the state-of-the-art approaches.
","[{'version': 'v1', 'created': 'Sat, 14 Oct 2017 14:15:56 GMT'}, {'version': 'v2', 'created': 'Sun, 8 Jul 2018 12:01:27 GMT'}]",2018-07-10,"[['Eftekheri', 'Noushin', ''], ['Masoudi', 'Mojtaba', ''], ['Pourreza', 'Hamidreza', ''], ['Shirazi', 'Kamaledin Ghiasi', ''], ['Saeedi', 'Ehsan', '']]","['Diabetic Retinopathy (DR)', 'Microaneurysm (MA)', 'Deep learning', 'Convolutional NeuralNetwork (CNN)']"
18230,1705.05983,Chien-Ping Lu,Chien-Ping Lu,"AI, Native Supercomputing and The Revival of Moore's Law","17 pages, 13 figures; to be published in IEEE APSIPA Transaction on
  Signal and Information Processing as an invited paper on Industrial
  Technology Advances",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Based on Alan Turing's proposition on AI and computing machinery, which
shaped Computing as we know it today, the new AI computing machinery should
comprise a universal computer and a universal learning machine. The later
should understand linear algebra natively to overcome the slowdown of Moore's
law. In such a universal learnig machine, a computing unit does not need to
keep the legacy of a universal computing core. The data can be distributed to
the computing units, and the results can be collected from them through
Collective Streaming, reminiscent of Collective Communication in
Supercomputing. It is not necessary to use a GPU-like deep memory hierarchy,
nor a TPU-like fine-grain mesh.
","[{'version': 'v1', 'created': 'Wed, 17 May 2017 02:15:27 GMT'}, {'version': 'v2', 'created': 'Tue, 23 May 2017 16:30:39 GMT'}]",2017-05-24,"[['Lu', 'Chien-Ping', '']]","['AI', 'Deep Learning', 'Moore’s Law', 'History of Computing', 'Parallel Computing', 'Supercomputing', 'High Performance Computing', 'Dataflow']"
18231,1401.6015,Parisa Jalili Marandi,"Parisa Jalili Marandi, Marco Primi, Nicolas Schiper, Fernando Pedone",Ring Paxos: High-Throughput Atomic Broadcast,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Atomic broadcast is an important communication primitive often used to
implement state-machine replication. Despite the large number of atomic
broadcast algorithms proposed in the literature, few papers have discussed how
to turn these algorithms into efficient executable protocols. This paper
focuses on a class of atomic broadcast algorithms based on Paxos, with its
corresponding desirable properties: safety under asynchrony assumptions,
liveness under weak synchrony assumptions, and resiliency-optimality. The paper
presents two protocols, M-Ring Paxos and U-Ring Paxos, derived from Paxos. The
protocols inherit the properties of Paxos and can be implemented very
efficiently. We report a detailed performance analysis of M-Ring Paxos and
U-Ring Paxos and compare them to other atomic broadcast protocols.
","[{'version': 'v1', 'created': 'Thu, 23 Jan 2014 15:49:17 GMT'}]",2014-01-24,"[['Marandi', 'Parisa Jalili', ''], ['Primi', 'Marco', ''], ['Schiper', 'Nicolas', ''], ['Pedone', 'Fernando', '']]","['software fault-tolerance', 'replication', 'total order broadcast', 'cluster computing']"
18232,1107.4110,Carlos Astudillo A.,"Carlos A. Astudillo, Oscar J. Calder\'on and Jes\'us H. Ortiz",PM2PLS: An Integration of Proxy Mobile IPv6 and MPLS,"9 Pages, 8 Figures, 9 Tables","IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 3, No. 1, May 2011",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a handover scheme supporting Multi-Protocol Label
Switching (MPLS) in a Proxy Mobile IPv6 (PMIPv6) domain that improves the
mobility and gives Quality of Service (QoS) and Traffic Engineering (TE)
capabilities in wireless access networks. The proposed scheme takes advantages
of both PMIPv6 and MPLS. PMIPv6 was designed to provide NETwork-based Localized
Mobility Management (NETLMM) support to a Mobile Node (MN); therefore, the MN
does not perform any mobility related signaling, while MPLS is used as an
alternative tunneling technology between the Mobile Access Gateway (MAG) and
the Local Mobility Anchor (LMA) replacing the IP-in-IP tunnels with Label
Switched Path (LSP) tunnels. It can also be integrated with other QoS
architectures such as Differentiated Services (DiffServ) and/or Integrated
Services (IntServ). In this study, we used MATLAB to perform an analysis to
evaluate the impact of introducing MPLS technology in PMIPv6 domain based on
handover latency, operational overhead and packet loss during the handover.
This was compared with PMIPv6, and a PMIPv6/MPLS integration. We proved that
the proposed scheme can give better performance than other schemes.
","[{'version': 'v1', 'created': 'Wed, 20 Jul 2011 20:21:35 GMT'}]",2011-07-22,"[['Astudillo', 'Carlos A.', ''], ['Calderón', 'Oscar J.', ''], ['Ortiz', 'Jesús H.', '']]","['Localized Mobility Management', 'MPLS', 'PMIPv6', 'PMIPv6/MPLS', 'PM2PLS']"
18233,1609.04602,Hongxi Tong,"Hongxi Tong, Xiaoqing Wang",New MDS or near MDS self-dual codes over finite fields,12 pages,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The study of MDS self-dual codes has attracted lots of attention in recent
years.
  There are many papers on determining existence of $q-$ary MDS self-dual codes
for various lengths.
  There are not existence of $q-$ary MDS self-dual codes of some lengths, even
these lengths $< q$.
  We generalize MDS Euclidean self-dual codes to near MDS Euclidean self-dual
codes and near MDS isodual codes.
  And we obtain many new near MDS isodual codes from extended negacyclic duadic
codes and we obtain many new MDS Euclidean self-dual codes from MDS Euclidean
self-dual codes.
  We generalize MDS Hermitian self-dual codes to near MDS Hermitian self-dual
codes.
  We obtain near MDS Hermitian self-dual codes from extended negacyclic duadic
codes and from MDS Hermitian self-dual codes.
","[{'version': 'v1', 'created': 'Thu, 15 Sep 2016 12:40:30 GMT'}]",2016-09-16,"[['Tong', 'Hongxi', ''], ['Wang', 'Xiaoqing', '']]","['MDS codes', 'near MDS codes', 'almost MDS codes', 'self-dual codes', 'isodual codes', 'extended negacyclic duadic codes']"
18234,1401.0922,Amir Akhavan,"Azam Majooni, Mona Masood, Amir Akhavan","A survey on the importance of visualization and social collaboration in
  academic digital libraries","14 pages, 5 figures",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  From more than half a century ago indexing scientific articles has been
studied intensively to provide a more efficient data retrieval and to conserve
researchers invaluable time. In the last two decades with the emergence of the
World Wide Web and the rapid growth in the number of scientific documents
online many academic databases and search engines were launched with almost
similar structure in order to reduce the difficulty in finding, relating and
sorting of the existing scientific documents published online. The dramatic
increase of the scientific documents in the last few years makes it necessary
that the retrieved information by the search engines be analyzed and more
organized and interpretable representation be displayed to the users.
Information visualization is a great way for exploration of large and complex
data sets, therefore it can be a natural candidate for the purpose of
generating more comprehensible search results for the citation and academic
databases. In this survey the usage pattern of the participants and their
demands and ideas for the existence of other beneficial methods for literature
review has been questioned and the results are quantitatively analyzed.
","[{'version': 'v1', 'created': 'Sun, 5 Jan 2014 18:22:49 GMT'}]",2014-01-07,"[['Majooni', 'Azam', ''], ['Masood', 'Mona', ''], ['Akhavan', 'Amir', '']]","['Visualization', 'Academic databases', 'Citation indexing databases']"
18235,1108.0716,Carlos A. Astudillo,"Carlos A. Astudillo, Adriana M. Gustin, Oscar J. Calder\'on","Policy Creation Model for Policy-Based Management in Telecommunications
  Networks","6 Pages, 2 Figures, 1 Table; In Proceedings of 2010 IEEE
  Latin-American Conference on Communications (LATINCOM). CD-ONLY",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Policy-based management (PBM) is being used as technological solution on the
managing and controlling complex networks and systems. One of the most
important issues involved in the life-cycle of PBM is the policies creation
because the future decisions made by the management system depend on this, and
therefore, the network behavior. In this paper we present a novel model for
creating management policies in telecommunications networks. We propose a model
which includes a Policy Creation Process, Actors, Policy Abstraction Levels and
a Procedure for Creating Policies. An implementation of the proposed model over
the Technology Division at University of Cauca is included.
","[{'version': 'v1', 'created': 'Wed, 3 Aug 2011 00:24:42 GMT'}]",2011-08-04,"[['Astudillo', 'Carlos A.', ''], ['Gustin', 'Adriana M.', ''], ['Calderón', 'Oscar J.', '']]","['Policy Based Management', 'Policy Creation Process', 'Telecommunications Networks Management']"
18236,0705.3468,Neng-Fa Zhou,"Neng-Fa Zhou, Taisuke Sato, and Yi-Dong Shen",Linear Tabling Strategies and Optimizations,"29 pages, 1 figure, TPLP",,,,cs.PL,,"  Recently, the iterative approach named linear tabling has received
considerable attention because of its simplicity, ease of implementation, and
good space efficiency. Linear tabling is a framework from which different
methods can be derived based on the strategies used in handling looping
subgoals. One decision concerns when answers are consumed and returned. This
paper describes two strategies, namely, {\it lazy} and {\it eager} strategies,
and compares them both qualitatively and quantitatively. The results indicate
that, while the lazy strategy has good locality and is well suited for finding
all solutions, the eager strategy is comparable in speed with the lazy strategy
and is well suited for programs with cuts. Linear tabling relies on depth-first
iterative deepening rather than suspension to compute fixpoints. Each cluster
of inter-dependent subgoals as represented by a top-most looping subgoal is
iteratively evaluated until no subgoal in it can produce any new answers. Naive
re-evaluation of all looping subgoals, albeit simple, may be computationally
unacceptable. In this paper, we also introduce semi-naive optimization, an
effective technique employed in bottom-up evaluation of logic programs to avoid
redundant joins of answers, into linear tabling. We give the conditions for the
technique to be safe (i.e. sound and complete) and propose an optimization
technique called {\it early answer promotion} to enhance its effectiveness.
Benchmarking in B-Prolog demonstrates that with this optimization linear
tabling compares favorably well in speed with the state-of-the-art
implementation of SLG.
","[{'version': 'v1', 'created': 'Wed, 23 May 2007 20:52:42 GMT'}]",2007-05-25,"[['Zhou', 'Neng-Fa', ''], ['Sato', 'Taisuke', ''], ['Shen', 'Yi-Dong', '']]","['Prolog', 'Semi-naive evaluation', 'Recursion', 'Tabling', 'Memoization', 'Lineartabling']"
18237,1510.00618,Daniel Gayo Avello,Miguel Fernandez-Fernandez and Daniel Gayo-Avello,"Automatic Taxonomy Extraction from Query Logs with no Additional Sources
  of Information","21 pages, 4 figures, 5 tables. Old (2012) unpublished manuscript",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Search engine logs store detailed information on Web users interactions.
Thus, as more and more people use search engines on a daily basis, important
trails of users common knowledge are being recorded in those files. Previous
research has shown that it is possible to extract concept taxonomies from full
text documents, while other scholars have proposed methods to obtain similar
queries from query logs. We propose a mixture of both lines of research, that
is, mining query logs not to find related queries nor query hierarchies, but
actual term taxonomies that could be used to improve search engine
effectiveness and efficiency. As a result, in this study we have developed a
method that combines lexical heuristics with a supervised classification model
to successfully extract hyponymy relations from specialization search patterns
revealed from log missions, with no additional sources of information, and in a
language independent way.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2015 15:02:38 GMT'}, {'version': 'v2', 'created': 'Mon, 5 Oct 2015 08:11:07 GMT'}]",2015-10-06,"[['Fernandez-Fernandez', 'Miguel', ''], ['Gayo-Avello', 'Daniel', '']]","['Web search', 'query log', 'hyponymy relations', 'query reformulation', 'query classification', 'automatic taxonomy extraction']"
18238,1209.6580,Jo\~ao Eugenio Marynowski,"Jo\~ao Eugenio Marynowski, Michel Albonico, Eduardo Cunha de Almeida,
  Gerson Suny\'e",Testing MapReduce-Based Systems,,,,,cs.DC cs.DB cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  MapReduce (MR) is the most popular solution to build applications for
large-scale data processing. These applications are often deployed on large
clusters of commodity machines, where failures happen constantly due to bugs,
hardware problems, and outages. Testing MR-based systems is hard, since it is
needed a great effort of test harness to execute distributed test cases upon
failures. In this paper, we present a novel testing solution to tackle this
issue called HadoopTest. This solution is based on a scalable harness approach,
where distributed tester components are hung around each map and reduce worker
(i.e., node). Testers are allowed to stimulate each worker to inject failures
on them, monitor their behavior, and validate testing results. HadoopTest was
used to test two applications bundled into Hadoop, the Apache open source
MapReduce implementation. Our initial implementation demonstrates promising
results, with HadoopTest coordinating test cases across distributed MapReduce
workers, and finding bugs.
","[{'version': 'v1', 'created': 'Fri, 28 Sep 2012 17:47:31 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Feb 2013 02:35:01 GMT'}]",2013-02-11,"[['Marynowski', 'João Eugenio', ''], ['Albonico', 'Michel', ''], ['de Almeida', 'Eduardo Cunha', ''], ['Sunyé', 'Gerson', '']]","['MapReduce', 'Hadoop', 'Testing', 'Large-scale']"
18239,1501.05814,Emmanuel Jeandel,"Pierre Guillon (I2M), Emmanuel Jeandel (INRIA Nancy - Grand Est /
  LORIA)",Infinite Communication Complexity,First Version. Written from the Computer Science POV,,,,cs.CC cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Suppose that Alice and Bob are given each an infinite string, and they want
to decide whether their two strings are in a given relation. How much
communication do they need? How can communication be even defined and measured
for infinite strings? In this article, we propose a formalism for a notion of
infinite communication complexity, prove that it satisfies some natural
properties and coincides, for relevant applications, with the classical notion
of amortized communication complexity. More-over, an application is given for
tackling some conjecture about tilings and multidimensional sofic shifts.
","[{'version': 'v1', 'created': 'Fri, 23 Jan 2015 14:39:15 GMT'}]",2015-01-26,"[['Guillon', 'Pierre', '', 'I2M'], ['Jeandel', 'Emmanuel', '', 'INRIA Nancy - Grand Est /\n  LORIA']]","['Symbolic Dynamics', 'Communication Complexity', 'Tilings']"
18240,1705.06218,Yasmin AlNoamany,"Yasmin AlNoamany, Michele C. Weigle, Michael L. Nelson",Stories From the Past Web,,,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Archiving Web pages into themed collections is a method for ensuring these
resources are available for posterity. Services such as Archive-It exists to
allow institutions to develop, curate, and preserve collections of Web
resources. Understanding the contents and boundaries of these archived
collections is a challenge for most people, resulting in the paradox of the
larger the collection, the harder it is to understand. Meanwhile, as the sheer
volume of data grows on the Web, ""storytelling"" is becoming a popular technique
in social media for selecting Web resources to support a particular narrative
or ""story"". There are multiple stories that can be generated from an archived
collection with different perspectives about the collection. For example, a
user may want to see a story that is composed of the key events from a specific
Web site, a story that is composed of the key events of the story regardless of
the sources, or how a specific event at a specific point in time was covered by
different Web sites, etc. In this paper, we provide different case studies for
possible types of stories that can be extracted from a collection. We also
provide the definitions and models of these types of stories.
","[{'version': 'v1', 'created': 'Wed, 17 May 2017 15:39:10 GMT'}]",2017-05-18,"[['AlNoamany', 'Yasmin', ''], ['Weigle', 'Michele C.', ''], ['Nelson', 'Michael L.', '']]","['Web Archiving', 'Storytelling', 'Information Retrieval', 'Document Similarity', 'Archived Collections', 'Web Content mining', 'Internet Archive']"
18241,1603.07699,Andrei Khrennikov Yu,Andrei Khrennikov and Ekaterina Yurova,"Secure cloud computations: Description of (fully)homomorphic ciphers
  within the P-adic model of encryption","submitted to Journal of Mathematical Cryptology (JMC) in July 2015,
  under review",,,,cs.CR cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider the description of homomorphic and fully
homomorphic ciphers in the $p$-adic model of encryption. This model describes a
wide class of ciphers, but certainly not all. Homomorphic and fully homomorphic
ciphers are used to ensure the credibility of remote computing, including cloud
technology. The model describes all homomorphic ciphers with respect to
arithmetic and coordinate-wise logical operations in the ring of $p$-adic
integers $Z_p$. We show that there are no fully homomorphic ciphers for each
pair of the considered set of arithmetic and coordinate-wise logical operations
on $Z_p$. We formulate the problem of constructing a fully homomorphic cipher
as follows. We consider a homomorphic cipher with respect to operation ""$*$"" on
$Z_p$. Then, we describe the complete set of operations ""$G$"", for which the
cipher is homomorphic. As a result, we construct a fully homomorphic cipher
with respect to the operations ""$*$"" and ""$G$"". We give a description of all
operations ""$G$"", for which we obtain fully homomorphic ciphers with respect to
the operations ""$+$"" and ""$G$"" from the homomorphic cipher constructed with
respect to the operation ""$+$"". We also present examples of such ""new""
operations.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2016 18:43:49 GMT'}]",2016-03-25,"[['Khrennikov', 'Andrei', ''], ['Yurova', 'Ekaterina', '']]","['p-adics', 'p-adic functions', 'homomorphic ciphers', 'fully homomorphic ciphers', 'dynamical systems', '1-Lipschitz']"
18242,1407.6321,Reza Azad,"Reza Azad, Majid Nazari","Novel and Automatic Parking Inventory System Based on Pattern
  Recognition and Directional Chain Code",,"2013 First International Conference on computer, Information
  Technology and Digital Media",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The objective of this paper is to design an efficient vehicle license plate
recognition System and to implement it for automatic parking inventory system.
The system detects the vehicle first and then captures the image of the front
view of the vehicle. Vehicle license plate is localized and characters are
segmented. For finding the place of plate, a novel and real time method is
expressed. A new and robust technique based on directional chain code is used
for character recognition. The resulting vehicle number is then compared with
the available database of all the vehicles so as to come up with information
about the vehicle type and to charge entrance cost accordingly. The system is
then allowed to open parking barrier for the vehicle and generate entrance cost
receipt. The vehicle information (such as entrance time, date, and cost amount)
is also stored in the database to maintain the record. The hardware and
software integrated system is implemented and a working prototype model is
developed. Under the available database, the average accuracy of locating
vehicle license plate obtained 100%. Using 70% samples of character for
training, we tested our scheme on whole samples and obtained 100% correct
recognition rate. Further we tested our character recognition stage on Persian
vehicle data set and we achieved 99% correct recognition.
","[{'version': 'v1', 'created': 'Wed, 23 Jul 2014 18:20:56 GMT'}]",2014-07-24,"[['Azad', 'Reza', ''], ['Nazari', 'Majid', '']]","['License plate recognition', 'parking inventory', 'HSV', 'directional chain code', 'KNN classifier']"
18243,1306.5568,Danila Gorodecky,Danila A. Gorodecky,"Combinatorial method of polynomial expansion of symmetric Boolean
  functions","12 pages, 4 figures, 1 table",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel polynomial expansion method of symmetric Boolean functions is
described. The method is efficient for symmetric Boolean function with small
set of valued numbers and has the linear complexity for elementary symmetric
Boolean functions, while the complexity of the known methods for this class of
functions is quadratic. The proposed method is based on the consequence of the
combinatorial Lucas theorem.
","[{'version': 'v1', 'created': 'Mon, 24 Jun 2013 10:39:42 GMT'}]",2013-06-25,"[['Gorodecky', 'Danila A.', '']]","['polynomial expansion', 'symmetric Boolean function', 'carrier vector', 'reduced']"
18244,1412.7680,Roshan Ragel,"G. I. Gunarathna, M. A. P. Chamikara and R. G. Ragel",A Fuzzy Based Model to Identify Printed Sinhala Characters (ICIAfS14),"The 7th International Conference on Information and Automation for
  Sustainability (ICIAfS) 2014",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Character recognition techniques for printed documents are widely used for
English language. However, the systems that are implemented to recognize Asian
languages struggle to increase the accuracy of recognition. Among other Asian
languages (such as Arabic, Tamil, Chinese), Sinhala characters are unique,
mainly because they are round in shape. This unique feature makes it a
challenge to extend the prevailing techniques to improve recognition of Sinhala
characters. Therefore, a little attention has been given to improve the
accuracy of Sinhala character recognition. A novel method, which makes use of
this unique feature, could be advantageous over other methods. This paper
describes the use of a fuzzy inference system to recognize Sinhala characters.
Feature extraction is mainly focused on distance and intersection measurements
in different directions from the center of the letter making use of the round
shape of characters. The results showed an overall accuracy of 90.7% for 140
instances of letters tested, much better than similar systems.
","[{'version': 'v1', 'created': 'Wed, 24 Dec 2014 14:56:54 GMT'}]",2014-12-25,"[['Gunarathna', 'G. I.', ''], ['Chamikara', 'M. A. P.', ''], ['Ragel', 'R. G.', '']]","['OCR (Optical character Recognition)', 'FIS (Fuzzy Inference System)', 'Image Processing', 'Feature Extraction']"
18245,1510.05970,Jure \v{Z}bontar,Jure \v{Z}bontar and Yann LeCun,"Stereo Matching by Training a Convolutional Neural Network to Compare
  Image Patches",,"JMLR 17(65):1-32, 2016",,,cs.CV cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a method for extracting depth information from a rectified image
pair. Our approach focuses on the first stage of many stereo algorithms: the
matching cost computation. We approach the problem by learning a similarity
measure on small image patches using a convolutional neural network. Training
is carried out in a supervised manner by constructing a binary classification
data set with examples of similar and dissimilar pairs of patches. We examine
two network architectures for this task: one tuned for speed, the other for
accuracy. The output of the convolutional neural network is used to initialize
the stereo matching cost. A series of post-processing steps follow: cross-based
cost aggregation, semiglobal matching, a left-right consistency check, subpixel
enhancement, a median filter, and a bilateral filter. We evaluate our method on
the KITTI 2012, KITTI 2015, and Middlebury stereo data sets and show that it
outperforms other approaches on all three data sets.
","[{'version': 'v1', 'created': 'Tue, 20 Oct 2015 17:15:05 GMT'}, {'version': 'v2', 'created': 'Wed, 18 May 2016 19:53:41 GMT'}]",2016-05-19,"[['Žbontar', 'Jure', ''], ['LeCun', 'Yann', '']]","['stereo', 'matching cost', 'similarity learning', 'supervised learning', 'convolutionalneural networks']"
18246,1512.00883,Totok R. Biyanto,"Totok R. Biyanto, Sumitra Wira Suganda, Matraji, Yerry Susatio, Heri
  Justiono, Sarwono","Cleaning Schedule Optimization of Heat Exchanger Networks Using Particle
  Swarm Optimization","8 pages, 3 figures",,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Oil refinery is one of industries that require huge energy consumption. The
today technology advance requires energy saving. Heat integration is a method
used to minimize the energy comsumption though the implementation of Heat
Exchanger Network (HEN). CPT is one of types of Heat Exchanger Network (HEN)
that functions to recover the heat in the flow of product or waste. HEN
comprises a number of heat exchangers (HEs) that are serially connected.
However, the presence of fouling in the heat exchanger has caused the decline
of the performance of both heat exchangers and all heat exchanger networks.
Fouling can not be avoided. However, it can be mitigated. In industry, periodic
heat exchanger cleaning is the most effective and widely used mitigation
technique. On the other side, a very frequent cleaning of heat exchanger can be
much costly in maintenance and lost of production. In this way, an accurate
optimization technique of cleaning schedule interval of heat exchanger is very
essential. Commonly, this technique involves three elements: model to simulate
the heat exchanger network, representative fouling model to describe the
fouling behavior and suitable optimization algorithm to solve the problem of
clening schedule interval for heat exchanger network. This paper describe the
optimization of interval cleaning schedule of HEN within the 44-month period
using PSO (particle swarm optimization). The number of iteration used to
achieve the convergent is 100 iterations and the fitness value in PSO
correlated with the amount of heat recovery, cleaning cost, and additional
pumping cost. The saving after the optimization of cleaning schedule of HEN in
this research achieved at $ 1.236 millions or 23% of maximum potential savings.
","[{'version': 'v1', 'created': 'Wed, 2 Dec 2015 22:08:09 GMT'}]",2015-12-04,"[['Biyanto', 'Totok R.', ''], ['Suganda', 'Sumitra Wira', ''], ['Matraji', '', ''], ['Susatio', 'Yerry', ''], ['Justiono', 'Heri', ''], ['Sarwono', '', '']]","['HEN', 'fouling', 'optimization', 'cleaning schedule', 'PSO']"
18247,1208.2861,Wojciech Mazurczyk,"Wojciech Mazurczyk, Krzysztof Szczypiorski, Bartosz Jankowski",Towards Steganography Detection Through Network Traffic Visualisation,"8 pages, 11 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents initial step toward new network anomaly detection method
that is based on traffic visualisation. The key design principle of the
proposed approach is the lack of direct, linear time dependencies for the
created network traffic visualisations. The method's feasibility is
demonstrated in network steganography environment by presenting steg-tomography
methodology and developing the dedicated visualisation tool. To authors' best
knowledge this is the first utilization of network traffic visualisations for
steganalysis purposes.
","[{'version': 'v1', 'created': 'Tue, 14 Aug 2012 13:37:09 GMT'}]",2012-08-15,"[['Mazurczyk', 'Wojciech', ''], ['Szczypiorski', 'Krzysztof', ''], ['Jankowski', 'Bartosz', '']]","['steganalysis', 'steganography detection', 'traffic visualisation']"
18248,1406.5616,S. K. Sahay,R.K. Roul and S.K. Sahay,"An Effective Approach for Web Document Classification using the Concept
  of Association Analysis of Data Mining",9 Pages,"IJCSET, 2012, Vol. 3, No. 10, p. 483",,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Exponential growth of the web increased the importance of web document
classification and data mining. To get the exact information, in the form of
knowing what classes a web document belongs to, is expensive. Automatic
classification of web document is of great use to search engines which provides
this information at a low cost. In this paper, we propose an approach for
classifying the web document using the frequent item word sets generated by the
Frequent Pattern (FP) Growth which is an association analysis technique of data
mining. These set of associated words act as feature set. The final
classification obtained after Na\""ive Bayes classifier used on the feature set.
For the experimental work, we use Gensim package, as it is simple and robust.
Results show that our approach can be effectively classifying the web document.
","[{'version': 'v1', 'created': 'Sat, 21 Jun 2014 14:33:09 GMT'}]",2014-06-24,"[['Roul', 'R. K.', ''], ['Sahay', 'S. K.', '']]","['Classification', 'FP-growth', 'Gensim', 'Naïve Bayes', 'Vector space model']"
18249,1712.03166,Wei Chen,"Wei Chen and YingYing Cao and Shi Cheng and Yifei Sun and Qunfeng Liu
  and Yun Li",Simplex Search Based Brain Storm Optimization,"25pages,6figures",,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Through modeling human's brainstorming process, the brain storm optimization
(BSO) algorithm has become a promising population-based evolutionary algorithm.
However, BSO is pointed out that it possesses a degenerated L-curve phenomenon,
i.e., it often gets near optimum quickly but needs much more cost to improve
the accuracy. To overcome this question in this paper, an excellent direct
search based local solver, the Nelder-Mead Simplex (NMS) method is adopted in
BSO. Through combining BSO's exploration ability and NMS's exploitation ability
together, a simplex search based BSO (Simplex-BSO) is developed via a better
balance between global exploration and local exploitation. Simplex-BSO is shown
to be able to eliminate the degenerated L-curve phenomenon on unimodal
functions, and alleviate significantly this phenomenon on multimodal functions.
Large number of experimental results show that Simplex-BSO is a promising
algorithm for global optimization problems.
","[{'version': 'v1', 'created': 'Tue, 24 Oct 2017 01:07:42 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Jun 2018 02:25:40 GMT'}, {'version': 'v3', 'created': 'Wed, 6 Jun 2018 07:42:15 GMT'}]",2018-06-07,"[['Chen', 'Wei', ''], ['Cao', 'YingYing', ''], ['Cheng', 'Shi', ''], ['Sun', 'Yifei', ''], ['Liu', 'Qunfeng', ''], ['Li', 'Yun', '']]","['Brain Storm Optimization', 'Nelder-Mead Simplex Method', 'Global Exploration', 'Local Exploitation', 'Visualizing Confidence Intervals']"
18250,1504.01957,Tony Tsang,Tony Tsang,Video Contents Prior Storing Server for Optical Access Network,"10 pages. in March 2015, Volume 7. Number 1 International Journal of
  Computer Networks & Communications (IJCNC) March 2015, Volume 7",,,,cs.NI cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the most important multimedia applications is Internet protocol TV
(IPTV) for next-generation networks. IPTV provides triple-play services that
require high-speed access networks with the functions of multicasting and
quality of service (QoS) guarantees. Among optical access networks, Ethernet
passive optical networks (EPONs) are regarded as among the best solutions to
meet higher bandwidth demands. In this paper, we propose a new architecture for
multicasting live IPTV traffic in optical access network. The proposed
mechanism involves assigning a unique logical link identifier to each IPTV
channel. To manage multicasting, a prior storing server in the optical line
terminal (OLT) and in each optical network unit (ONU) is constructed. In this
work, we propose a partial prior storing strategy that considers the changes in
the popularity of the video content segments over time and the access patterns
of the users to compute the utility of the objects in the prior storage. We
also propose to partition the prior storage to avoid the eviction of the
popular objects (those not accessed frequently) by the unpopular ones which are
accessed with higher frequency. The popularity distribution and ageing of
popularity are measured from two online datasets and use the parameters in
simulations. Simulation results show that our proposed architecture can improve
the system performance and QoS parameters in terms of packet delay, jitter and
packet loss.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2015 13:29:12 GMT'}]",2015-04-09,"[['Tsang', 'Tony', '']]","['Passive Optical Network', 'Video Contents', 'Prior Storing Server', 'Internet Protocol Television.    1']"
18251,1410.2381,Mohamed Sayedelahl Dr,"R. M. Farouk, S. Badr and M. Sayed Elahl","Recognition of cDNA microarray image Using Feedforward artificial neural
  network","17 pages, 7 figures and 23 References","International Journal of Artificial Intelligence & Applications
  (IJAIA), Vol. 5, No. 5, September 2014",,,cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The complementary DNA (cDNA) sequence is considered to be the magic biometric
technique for personal identification. In this paper, we present a new method
for cDNA recognition based on the artificial neural network (ANN). Microarray
imaging is used for the concurrent identification of thousands of genes. We
have segmented the location of the spots in a cDNA microarray. Thus, a precise
localization and segmenting of a spot are essential to obtain a more accurate
intensity measurement, leading to a more precise expression measurement of a
gene. The segmented cDNA microarray image is resized and it is used as an input
for the proposed artificial neural network. For matching and recognition, we
have trained the artificial neural network. Recognition results are given for
the galleries of cDNA sequences . The numerical results show that, the proposed
matching technique is an effective in the cDNA sequences process. We also
compare our results with previous results and find out that, the proposed
technique is an effective matching performance.
","[{'version': 'v1', 'created': 'Thu, 9 Oct 2014 08:37:21 GMT'}]",2014-10-10,"[['Farouk', 'R. M.', ''], ['Badr', 'S.', ''], ['Elahl', 'M. Sayed', '']]","['DNA recognition', 'cDNA microarray image segmentation', 'artificial']"
18252,1407.0822,Fabrice Rossi,"Arnaud De Myttenaere (SAMM), B\'en\'edicte Le Grand (CRI), Boris
  Golden (Viadeo), Fabrice Rossi (SAMM)",Reducing Offline Evaluation Bias in Recommendation Systems,"23rd annual Belgian-Dutch Conference on Machine Learning (Benelearn
  2014), Bruxelles : Belgium (2014)",,,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommendation systems have been integrated into the majority of large online
systems. They tailor those systems to individual users by filtering and ranking
information according to user profiles. This adaptation process influences the
way users interact with the system and, as a consequence, increases the
difficulty of evaluating a recommendation algorithm with historical data (via
offline evaluation). This paper analyses this evaluation bias and proposes a
simple item weighting solution that reduces its impact. The efficiency of the
proposed solution is evaluated on real world data extracted from Viadeo
professional social network.
","[{'version': 'v1', 'created': 'Thu, 3 Jul 2014 09:05:33 GMT'}]",2014-07-04,"[['De Myttenaere', 'Arnaud', '', 'SAMM'], ['Grand', 'Bénédicte Le', '', 'CRI'], ['Golden', 'Boris', '', 'Viadeo'], ['Rossi', 'Fabrice', '', 'SAMM']]","['recommendation systems', 'offline evaluation', 'evaluation bias', 'covariate shift']"
18253,1606.03534,Alemayehu Molla,"Alemayehu Molla, Vanessa Cooper and Vass Karpathiou","IT Managers' Perception and Response to Digital Disruption: An
  Exploratory Study","ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
  Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/213,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Digital disruption introduces technology-enabled changes at a pace and scale
that fundamentally shifts established ways in which we live and work. Given the
impact of digital disruption can span the individual, organisational, industry
and societal levels, it has received growing attention in Information Systems.
A less researched area of digital disruption, however, is the perspective of IT
managers in organisations. This paper draws on i) situational awareness theory
to identify IT managers' perceptions of digital disruption, and ii) disruptive
innovation theory to identify IT managers' responses to digital disruption. A
case study of senior IT managers in an Australian university identifies that IT
managers perceive digital disruption from the technological, learning and
sense-making perspectives. IT managers' first-order responses to digital
disruption were shown to address resource, process and value-based issues while
second-order responses focused on the need to build dynamic capabilities in
order to be prepared for future digital disruption.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 03:03:32 GMT'}]",2016-06-14,"[['Molla', 'Alemayehu', ''], ['Cooper', 'Vanessa', ''], ['Karpathiou', 'Vass', '']]","['Digital Disruption', 'IT Managers', 'Response', 'Resources', 'Capabilities', 'Situational Awareness Theory', 'Disruptive Innovation Theory']"
18254,1306.5209,Gurpreet Saini,"Gurpreet Singh Saini, Priyanka Dubey, Md Tanzilur Rahman","Review Study For Inter-Operability Of Manet Protocols In Wireless Sensor
  Networks",,"International Journal of Computer Trends and Technology (IJCTT),
  Volume 4, Issue 6 May 2013",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless Networks are most appealing in terms of deployment over a wide range
of applications. The key areas are disaster management, industrial unit
automation and battlefield surveillance. The paper presents a study over
inter-operability of MANET (Mobile Ad-Hoc Network) protocols i.e DSDV, OLSR,
ZRP, AODV over WSN (Wireless Sensor Network) [10]. The review here covers all
the prevailing protocol solutions for WSN and deployment of MANET protocols
over them. The need of moving to MANET protocols lie in situation when we talk
about mobile sensory nodes which are a compulsion when we talk about the above
mentioned three areas. However, the deployment may not be limited to these
only.
","[{'version': 'v1', 'created': 'Fri, 21 Jun 2013 18:28:04 GMT'}]",2013-06-24,"[['Saini', 'Gurpreet Singh', ''], ['Dubey', 'Priyanka', ''], ['Rahman', 'Md Tanzilur', '']]","['MANET', 'WSN', 'Protocol Inter-operability', 'QoS Routing', 'Lifetime based routing', 'Minimum cost Routing']"
18255,1401.4857,Ronald Hochreiter,Ronald Hochreiter and Christoph Waldhauser,A Genetic Algorithm to Optimize a Tweet for Retweetability,,Proceedings of MENDEL 2013: 13-18. 2013,,,cs.NE cs.CY cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Twitter is a popular microblogging platform. When users send out messages,
other users have the ability to forward these messages to their own subgraph.
Most research focuses on increasing retweetability from a node's perspective.
Here, we center on improving message style to increase the chance of a message
being forwarded. To this end, we simulate an artificial Twitter-like network
with nodes deciding deterministically on retweeting a message or not. A genetic
algorithm is used to optimize message composition, so that the reach of a
message is increased. When analyzing the algorithm's runtime behavior across a
set of different node types, we find that the algorithm consistently succeeds
in significantly improving the retweetability of a message.
","[{'version': 'v1', 'created': 'Mon, 20 Jan 2014 10:42:51 GMT'}]",2014-01-21,"[['Hochreiter', 'Ronald', ''], ['Waldhauser', 'Christoph', '']]","['Twitter', 'social network', 'message style', 'genetic algorithm', 'deterministic optimization']"
18256,1511.06049,Deyu Meng,Deyu Meng and Qian Zhao and Lu Jiang,What Objective Does Self-paced Learning Indeed Optimize?,"25 pages, 1 figures",,,,cs.LG cs.CV,http://creativecommons.org/publicdomain/zero/1.0/,"  Self-paced learning (SPL) is a recently raised methodology designed through
simulating the learning principle of humans/animals. A variety of SPL
realization schemes have been designed for different computer vision and
pattern recognition tasks, and empirically substantiated to be effective in
these applications. However, the investigation on its theoretical insight is
still a blank. To this issue, this study attempts to provide some new
theoretical understanding under the SPL scheme. Specifically, we prove that the
solving strategy on SPL accords with a majorization minimization algorithm
implemented on a latent objective function. Furthermore, we find that the loss
function contained in this latent objective has a similar configuration with
non-convex regularized penalty (NSPR) known in statistics and machine learning.
Such connection inspires us discovering more intrinsic relationship between SPL
regimes and NSPR forms, like SCAD, LOG and EXP. The robustness insight under
SPL can then be finely explained. We also analyze the capability of SPL on its
easy loss prior embedding property, and provide an insightful interpretation to
the effectiveness mechanism under previous SPL variations. Besides, we design a
group-partial-order loss prior, which is especially useful to weakly labeled
large-scale data processing tasks. Through applying SPL with this loss prior to
the FCVID dataset, which is currently one of the biggest manually annotated
video dataset, our method achieves state-of-the-art performance beyond previous
methods, which further helps supports the proposed theoretical arguments.
","[{'version': 'v1', 'created': 'Thu, 19 Nov 2015 02:55:18 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Nov 2016 13:59:27 GMT'}]",2016-11-02,"[['Meng', 'Deyu', ''], ['Zhao', 'Qian', ''], ['Jiang', 'Lu', '']]","['Self-paced learning', 'curriculum learning', 'multimedia event']"
18257,1504.08183,Andrey Kutuzov,Andrey Kutuzov and Igor Andreev,"Texts in, meaning out: neural language models in semantic similarity
  task for Russian","Proceedings of the Dialog 2015 Conference. Moscow, Russia",,,,cs.CL,http://creativecommons.org/licenses/by/3.0/,"  Distributed vector representations for natural language vocabulary get a lot
of attention in contemporary computational linguistics. This paper summarizes
the experience of applying neural network language models to the task of
calculating semantic similarity for Russian. The experiments were performed in
the course of Russian Semantic Similarity Evaluation track, where our models
took from the 2nd to the 5th position, depending on the task.
  We introduce the tools and corpora used, comment on the nature of the shared
task and describe the achieved results. It was found out that Continuous
Skip-gram and Continuous Bag-of-words models, previously successfully applied
to English material, can be used for semantic modeling of Russian as well.
Moreover, we show that texts in Russian National Corpus (RNC) provide an
excellent training material for such models, outperforming other, much larger
corpora. It is especially true for semantic relatedness tasks (although
stacking models trained on larger corpora on top of RNC models improves
performance even more).
  High-quality semantic vectors learned in such a way can be used in a variety
of linguistic tasks and promise an exciting field for further study.
","[{'version': 'v1', 'created': 'Thu, 30 Apr 2015 12:03:10 GMT'}]",2015-05-01,"[['Kutuzov', 'Andrey', ''], ['Andreev', 'Igor', '']]","['neural embeddings', 'machine learning', 'semantic similarity', 'distributional semantics', 'vector word representations', 'word2vec']"
18258,1005.5223,Swan Dubois,"Swan Dubois (LIP6, INRIA Rocquencourt), Toshimitsu Masuzawa
  (Department of Information and Computer Sciences, Osaka University),
  S\'ebastien Tixeuil (LIP6)",On Byzantine Containment Properties of the $min+1$ Protocol,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Self-stabilization is a versatile approach to fault-tolerance since it
permits a distributed system to recover from any transient fault that
arbitrarily corrupts the contents of all memories in the system. Byzantine
tolerance is an attractive feature of distributed systems that permits to cope
with arbitrary malicious behaviors. We consider the well known problem of
constructing a breadth-first spanning tree in this context. Combining these two
properties proves difficult: we demonstrate that it is impossible to contain
the impact of Byzantine nodes in a strictly or strongly stabilizing manner. We
then adopt the weaker scheme of topology-aware strict stabilization and we
present a similar weakening of strong stabilization. We prove that the
classical $min+1$ protocol has optimal Byzantine containment properties with
respect to these criteria.
","[{'version': 'v1', 'created': 'Fri, 28 May 2010 06:28:10 GMT'}]",2010-05-31,"[['Dubois', 'Swan', '', 'LIP6, INRIA Rocquencourt'], ['Masuzawa', 'Toshimitsu', '', 'Department of Information and Computer Sciences, Osaka University'], ['Tixeuil', 'Sébastien', '', 'LIP6']]","['Byzantine fault', 'Distributed protocol', 'Fault tolerance', 'Stabilization', 'Spanning treeconstruction']"
18259,1203.1328,Jubair Basha N Md,"N. Md. Jubair Basha, Salman Abdul Moiz, A. A. Moiz Qyser",Performance Analysis of HR Portal Domain Components Extraction,"6 pages, 10 figures","International Journal of Computer Science and Information
  Technologies, Vol. 2 (5) , 2011, 2326-2331",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Extraction of components pertaining to a particular domain not only reduces
the cost but also helps in delivering a quality product. However, the
advantages of the Component Level Interaction's (CLI's) are not clearly
presented. In the first part of the paper the design of HR Portal application
is described. Later the results are simulated using the Netbeans Profiler tool
which exposes and highlights the performance characteristics of component based
system pertaining to HR domain.
","[{'version': 'v1', 'created': 'Tue, 6 Mar 2012 21:04:03 GMT'}]",2015-03-13,"[['Basha', 'N. Md. Jubair', ''], ['Moiz', 'Salman Abdul', ''], ['Qyser', 'A. A. Moiz', '']]","['Components', 'Domain Engineering', 'CLI’s', 'CCT’s']"
18260,1304.4047,Hossein Movafegh Ghadirli,"Hossein Movafegh Ghadirli, Maryam Rastgarpour","A Paradigm for the Application of Cloud Computing in Mobile Intelligent
  Tutoring Systems","11 pages, 4 figures, International Journal of Software Engineering &
  Applications (IJSEA)",,,,cs.CY,http://creativecommons.org/licenses/by/3.0/,"  Nowadays, with the rapid growth of cloud computing, many industries are going
to move their computing activities to clouds. Researchers of virtual learning
are also looking for the ways to use clouds through mobile platforms. This
paper offers a model to accompany the benefits of ""Mobile Intelligent Learning""
technology and ""Cloud Computing"". The architecture of purposed system is based
on multi-layer architecture of Mobile Cloud Computing. Despite the existing
challenges, the system has increased the life of mobile device battery. It will
raise working memory capacity and processing capacity of the educational system
in addition to the greater advantage of the educational system. The proposed
system allows the users to enjoy an intelligent learning every-time and
every-where, reduces training costs and hardware dependency, and increases
consistency, efficiency, and data reliability.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2013 10:40:42 GMT'}]",2013-04-16,"[['Ghadirli', 'Hossein Movafegh', ''], ['Rastgarpour', 'Maryam', '']]","['Mobile Services', 'Cloud Computing', 'Mobile Intelligent Learning', 'Expert System    1']"
18261,1505.04880,Nasser Ghadiri,Amin Beiranvand and Nasser Ghadiri,"ADQUEX: Adaptive Processing of Federated Queries over Linked Data based
  on Tuple Routing",,,,,cs.DC cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to the distribution of linked data across the web, the methods that
process federated queries through a distributed approach are more attractive to
the users and have gained more prosperity. In distributed processing of
federated queries, we need methods and procedures to execute the query in an
optimal manner. Most of the existing methods perform the optimization task
based on some statistical information, whereas the query processor does not
have precise statistical information about their properties, since the data
sources are autonomous. When precise statistics are not available, the
possibility of wrong estimations will highly increase, and may lead to
inefficient execution of the query at runtime. Another problem of the existing
methods is that in the optimization phase, they assume that runtime conditions
of query execution are stable, while the environment in which federated queries
are executed over linked data is dynamic and non-predictable. By considering
these two problems, there is a great potential for exploiting the federated
query processing techniques in an adaptive manner. In this paper, an adaptive
method is proposed for processing federated queries over linked data, based on
the concept of routing the tuples. The proposed method, named ADQUEX, is able
to execute the query effectively without any prior statistical information.
This method can change the query execution plan at runtime so that less
intermediate results are produced. It can also adapt the execution plan to new
situation if unpredicted network latencies arise. Extensive evaluation of our
method by running real queries over well-known linked datasets shows very good
results especially for complex queries.
","[{'version': 'v1', 'created': 'Tue, 19 May 2015 05:51:27 GMT'}]",2015-05-20,"[['Beiranvand', 'Amin', ''], ['Ghadiri', 'Nasser', '']]","['Processing Federated Queries over Linked Data', 'Adaptive Query Processing', 'Federation']"
18262,1409.6604,Bernhard Rumpe,"Bernhard Rumpe, Peter Scholz",Scaling the Management of Extreme Programming Projects,"7 pages, 4 figures","Projects & Profits. Special Issue on Management of Extreme
  Programming Projects, Vol. III (8), pp. 11-18. ICFAI-Press, Hyderabat, August
  2003",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  XP is a code-oriented, light-weight software engineering methodology, suited
merely for small-sized teams who develop software that relies on vague or
rapidly changing requirements. Being very code-oriented, the discipline of
systems engineering knows it as approach of incremental system change. In this
contribution, we discuss the enhanced version of a concept on how to extend XP
on large scale projects with hundreds of software engineers and programmers,
respectively. Previous versions were already presented in [1] and [12]. The
basic idea is to apply the ""hierarchical approach"", a management principle of
reorganizing companies, as well as well-known moderation principles to XP
project organization. We show similarities between software engineering methods
and company reorganization processes and discuss how the elements of the
hierarchical approach can improve XP. We provide guidelines on how to scale up
XP to very large projects e.g. those common in telecommunication industry and
IT technology consultancy firms by using moderation techniques.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 17:29:53 GMT'}]",2014-09-24,"[['Rumpe', 'Bernhard', ''], ['Scholz', 'Peter', '']]","['XP', 'reorganization', 'project organization', 'project management', 'hierarchical approach']"
18263,1401.0523,Khalid Jebari hassani,"Khalid Jebari, Mohammed Madiafi, Abdelaziz El Moujahid",Solving Poisson Equation by Genetic Algorithms,,"International Journal of Computer Applications Volume 83, No 5,
  December 2013",,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with a method for solving Poisson Equation (PE) based on
genetic algorithms and grammatical evolution. The method forms generations of
solutions expressed in an analytical form. Several examples of PE are tested
and in most cases the exact solution is recovered. But, when the solution
cannot be expressed in an analytical form, our method produces a satisfactory
solution with a good level of accuracy
","[{'version': 'v1', 'created': 'Thu, 2 Jan 2014 20:15:00 GMT'}]",2014-01-03,"[['Jebari', 'Khalid', ''], ['Madiafi', 'Mohammed', ''], ['Moujahid', 'Abdelaziz El', '']]","['Genetic algorithms', 'Evolutionary Computation', 'Poisson Equation', 'Grammatical Evolution']"
18264,1702.03589,Bhavya Kailkhura,"Bhavya Kailkhura, Lakshmi Narasimhan Theagarajan, Pramod K. Varshney",Subspace-Aware Index Codes,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we generalize the well-known index coding problem to exploit
the structure in the source-data to improve system throughput. In many
applications, the data to be transmitted may lie (or can be well approximated)
in a low-dimensional subspace. We exploit this low-dimensional structure of the
data using an algebraic framework to solve the index coding problem (referred
to as subspace-aware index coding) as opposed to the traditional index coding
problem which is subspace-unaware. Also, we propose an efficient algorithm
based on the alternating minimization approach to obtain near optimal index
codes for both subspace-aware and -unaware cases. Our simulations indicate that
under certain conditions, a significant throughput gain (about 90%) can be
achieved by subspace-aware index codes over conventional subspace-unaware index
codes.
","[{'version': 'v1', 'created': 'Sun, 12 Feb 2017 23:02:10 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Apr 2017 15:04:06 GMT'}]",2017-04-11,"[['Kailkhura', 'Bhavya', ''], ['Theagarajan', 'Lakshmi Narasimhan', ''], ['Varshney', 'Pramod K.', '']]","['Index coding', 'coded side-information', 'low-dimensional data', 'alternating minimization']"
18265,1301.5993,Majed ValadBeigi,Farshad Safaei and Majed ValadBeigi,"A Probabilistic Approach to Analysis of Reliability in n-D Meshes with
  Interconnect Router Failures","11 pages, 1 figure, 2 tables","International Journal of Computer Networks & Communications
  (IJCNC) Vol.3, No.4, July 2011",,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The routing algorithms for parallel computers, on-chip networks, multi-core
processors, and multiprocessors system-on-chip (MP-SoCs) exhibit router
failures must be able to handle interconnect router failures that render a
symmetrical mesh non-symmetrically. When developing a routing methodology, the
time complexity of calculation should be minimal, and thus complicated routing
strategies to introduce profitable paths may not be appropriate. Several
reports have been released in the literature on using the concept of fault
rings to provide detour paths to messages blocked by faults and to route
messages around the fault regions. In order to analyze the performance of such
algorithms, it is required to investigate the characteristics of fault rings.
In this paper, we introduce a novel performance index of network reliability
presenting the probability of message facing fault rings, and evaluating the
performance-related reliability of adaptive routing schemes in n-D mesh-based
interconnection networks with a variety of common cause fault patterns.
Sufficient simulation results of Monte-Carlo method are conducted to
demonstrate the correctness of the proposed analytical model.
","[{'version': 'v1', 'created': 'Fri, 25 Jan 2013 09:18:58 GMT'}]",2013-01-28,"[['Safaei', 'Farshad', ''], ['ValadBeigi', 'Majed', '']]","['Fault-Tolerance', 'Fault Rings', 'Interconnection Networks', 'n-D Meshes', 'Adaptive   Routing', 'Network Reliability', 'Performance Analysis']"
18266,1409.6489,St\'ephane Le Roux,Stephane Le Roux,On terminating improvement in two-player games,"The proof of Proposition 2 (p 11-12) was incomplete in the first
  version",,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A real-valued game has the finite improvement property (FIP), if starting
from an arbitrary strategy profile and letting the players change strategies to
increase their individual payoffs in a sequential but non-deterministic order
always reaches a Nash equilibrium. E.g., potential games have the FIP. Many of
them have the FIP by chance nonetheless, since modifying even a single payoff
may ruin the property. This article characterises (in quadratic time) the class
of the finite games where FIP not only holds but is also preserved when
modifying all the occurrences of an arbitrary payoff. The characterisation
relies on a pattern-matching sufficient condition for games (finite or
infinite) to enjoy the FIP, and is followed by an inductive description of this
class.
  A real-valued game is weakly acyclic if the improvement described above can
reach a Nash equilibrium. This article characterises the finite such games
using Markov chains and almost sure convergence to equilibrium. It also gives
an inductive description of the two-player such games.
","[{'version': 'v1', 'created': 'Tue, 23 Sep 2014 11:16:53 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Oct 2014 11:14:27 GMT'}]",2014-10-17,"[['Roux', 'Stephane Le', '']]","['Nash equilibrium', 'structures', 'potential games', 'weakly terminating games']"
18267,1109.0375,Jan Sefranek,Jan Sefranek and Alexander Simko,Warranted Derivations of Preferred Answer,wlp 2011,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We are aiming at a semantics of logic programs with preferences defined on
rules, which always selects a preferred answer set, if there is a non-empty set
of (standard) answer sets of the given program. It is shown in a seminal paper
by Brewka and Eiter that the goal mentioned above is incompatible with their
second principle and it is not satisfied in their semantics of prioritized
logic programs. Similarly, also according to other established semantics, based
on a prescriptive approach, there are programs with standard answer sets, but
without preferred answer sets. According to the standard prescriptive approach
no rule can be fired before a more preferred rule, unless the more preferred
rule is blocked. This is a rather imperative approach, in its spirit.
  In our approach, rules can be blocked by more preferred rules, but the rules
which are not blocked are handled in a more declarative style, their execution
does not depend on the given preference relation on the rules. An argumentation
framework (different from the Dung's framework) is proposed in this paper.
Argu- mentation structures are derived from the rules of a given program. An
attack relation on argumentation structures is defined, which is derived from
attacks of more preferred rules against the less preferred rules. Preferred
answer sets correspond to complete argumentation structures, which are not
blocked by other complete argumentation structures.
","[{'version': 'v1', 'created': 'Fri, 2 Sep 2011 07:36:57 GMT'}]",2011-09-05,"[['Sefranek', 'Jan', ''], ['Simko', 'Alexander', '']]","['extended logic program', 'answer set', 'preference', 'preferred answer set', 'argumentation structure']"
18268,1407.0843,Michael Meder,"Michael Meder, Brijnesh-Johannes Jain",The Gamification Design Problem,"5 pages, preprint",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Under the assumptions that (i) gamification consists of various types of
users that experience game design elements differently; and (ii) gamification
is deployed in order to achieve some goal in the broadest sense, we pose the
gamification problem as that of assigning each user a game design element that
maximizes their expected contribution in order to achieve that goal. We show
that this problem reduces to a statistical learning problem and suggest matrix
factorization as one solution when user interaction data is given. The
hypothesis is that predictive models as intelligent tools for supporting users
in decision-making may also have potential to support the design process in
gamification.
","[{'version': 'v1', 'created': 'Thu, 3 Jul 2014 10:09:57 GMT'}]",2014-07-04,"[['Meder', 'Michael', ''], ['Jain', 'Brijnesh-Johannes', '']]","['Gamification', 'Design', 'Machine Learning']"
18269,1712.03430,Sharmistha Dey Ms,Sharmistha Dey,"Aspect Extraction and Sentiment Classification of Mobile Apps using
  App-Store Reviews",12 pages,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding of customer sentiment can be useful for product development. On
top of that if the priorities for the development order can be known, then
development procedure become simpler. This work has tried to address this issue
in the mobile app domain. Along with aspect and opinion extraction this work
has also categorized the extracted aspects ac-cording to their importance. This
can help developers to focus their time and energy at the right place.
","[{'version': 'v1', 'created': 'Sat, 9 Dec 2017 20:06:52 GMT'}]",2017-12-12,"[['Dey', 'Sharmistha', '']]","['Entity', 'Aspect', 'Extraction', 'Sentiment analysis', 'Kano’s customer satisfaction model', 'Lexicon', 'mobile apps', 'customer review']"
18270,1510.08805,Ananthanarayanan Chockalingam,"T. Lakshmi Narasimhan, R. Tejaswi, and A. Chockalingam",Quad-LED and Dual-LED Complex Modulation for Visible Light Communication,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose simple and novel complex modulation techniques that
exploit the spatial domain to transmit complex-valued modulation symbols in
visible light wireless communication. The idea is to use multiple light
emitting diodes (LEDs) to convey the real and imaginary parts of a complex
modulation symbol and their sign information, or, alternately, to convey the
magnitude and phase of a complex symbol. The proposed techniques are termed as
{\em quad-LED complex modulation (QCM)} and {\em dual-LED complex modulation
(DCM)}. The proposed QCM scheme uses four LEDs (hence the name `quad-LED');
while the magnitudes of the real and imaginary parts are conveyed through
intensity modulation of LEDs, the sign information is conveyed through spatial
indexing of LEDs. The proposed DCM scheme, on the other hand, exploits the
polar representation of a complex symbol; it uses only two LEDs (hence the name
`dual-LED'), one LED to map the magnitude and another LED to map the phase of a
complex modulation symbol. These techniques do not need Hermitian symmetry
operation to generate LED compatible positive real transmit signals. We present
zero-forcing and minimum distance detectors and their performance for QCM-OFDM
and DCM-OFDM. We further propose another modulation scheme, termed as SM-DCM
{\em (spatial modulation-DCM)} scheme, which brings in the advantage of spatial
modulation (SM) to DCM. The proposed SM-DCM scheme uses two DCM BLOCKs with two
LEDs in each BLOCK, and an index bit decides which among the two BLOCKs will be
used in a given channel use. We study the bit error rate (BER) performance of
the proposed schemes through analysis and simulations. Using tight analytical
BER upper bounds and spatial distribution of the received signal-to-noise
ratios, we compute and plot the achievable rate contours for a given target BER
in QCM, DCM, and SM-DCM.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2015 18:13:13 GMT'}, {'version': 'v2', 'created': 'Mon, 2 May 2016 15:12:49 GMT'}, {'version': 'v3', 'created': 'Sun, 24 Jul 2016 07:38:30 GMT'}]",2016-07-27,"[['Narasimhan', 'T. Lakshmi', ''], ['Tejaswi', 'R.', ''], ['Chockalingam', 'A.', '']]","['Visible light communication', 'quad-LED complexmodulation (QCM)', 'dual-LED complex modulation (DCM)', 'QCMwith phase rotation', 'SM-DCM', 'OFDM']"
18271,1705.06125,Petr Ry\v{s}av\'y,Petr Ry\v{s}av\'y and Filip \v{Z}elezn\'y,"Estimating Sequence Similarity from Read Sets for Clustering
  Next-Generation Sequencing data",,,,,cs.DS q-bio.GN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To cluster sequences given only their read-set representations, one may try
to reconstruct each one from the corresponding read set, and then employ
conventional (dis)similarity measures such as the edit distance on the
assembled sequences. This approach is however problematic and we propose
instead to estimate the similarities directly from the read sets. Our approach
is based on an adaptation of the Monge-Elkan similarity known from the field of
databases. It avoids the NP-hard problem of sequence assembly. For low coverage
data it results in a better approximation of the true sequence similarities and
consequently in better clustering, in comparison to the
first-assemble-then-cluster approach.
","[{'version': 'v1', 'created': 'Tue, 16 May 2017 11:01:47 GMT'}]",2017-05-18,"[['Ryšavý', 'Petr', ''], ['Železný', 'Filip', '']]","['Read sets', 'similarity', 'hierarchical clustering']"
18272,1511.01561,"Andreas M\""uller","Andreas M\""uller, Michal A. Kopera, Simone Marras, Lucas C. Wilcox,
  Tobin Isaac, Francis X. Giraldo","Strong Scaling for Numerical Weather Prediction at Petascale with the
  Atmospheric Model NUMA","33 pages, 12 figures, submitted to the International Journal of
  High-Performance Computing Applications",,,,cs.DC cs.SE physics.ao-ph physics.flu-dyn physics.geo-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Numerical weather prediction (NWP) has proven to be computationally
challenging due to its inherent multiscale nature. Currently, the highest
resolution NWP models use a horizontal resolution of about 10km. In order to
increase the resolution of NWP models highly scalable atmospheric models are
needed.
  The Non-hydrostatic Unified Model of the Atmosphere (NUMA), developed by the
authors at the Naval Postgraduate School, was designed to achieve this purpose.
NUMA is used by the Naval Research Laboratory, Monterey as the engine inside
its next generation weather prediction system NEPTUNE. NUMA solves the fully
compressible Navier-Stokes equations by means of high-order Galerkin methods
(both spectral element as well as discontinuous Galerkin methods can be used).
Mesh generation is done using the p4est library. NUMA is capable of running
middle and upper atmosphere simulations since it does not make use of the
shallow-atmosphere approximation.
  This paper presents the performance analysis and optimization of the spectral
element version of NUMA. The performance at different optimization stages is
analyzed using a theoretical performance model as well as measurements via
hardware counters. Machine independent optimization is compared to machine
specific optimization using BG/Q vector intrinsics. By using vector intrinsics
the main computations reach 1.2 PFlops on the entire machine Mira (12% of the
theoretical peak performance). The paper also presents scalability studies for
two idealized test cases that are relevant for NWP applications. The
atmospheric model NUMA delivers an excellent strong scaling efficiency of 99%
on the entire supercomputer Mira using a mesh with 1.8 billion grid points.
This allows to run a global forecast of a baroclinic wave test case at 3km
uniform horizontal resolution and double precision within the time frame
required for operational weather prediction.
","[{'version': 'v1', 'created': 'Thu, 5 Nov 2015 00:31:29 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Sep 2016 10:50:52 GMT'}, {'version': 'v3', 'created': 'Thu, 8 Sep 2016 11:55:11 GMT'}]",2016-09-09,"[['Müller', 'Andreas', ''], ['Kopera', 'Michal A.', ''], ['Marras', 'Simone', ''], ['Wilcox', 'Lucas C.', ''], ['Isaac', 'Tobin', ''], ['Giraldo', 'Francis X.', '']]","['atmospheric modeling', 'numerical weather prediction', 'dynamical core', 'global']"
18273,1106.1842,James Currie,"James D. Currie, Narad Rampersad",Fixed points avoiding Abelian $k$-powers,,,,,cs.FL math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that the problem of whether the fixed point of a morphism avoids
Abelian $k$-powers is decidable under rather general conditions
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2011 15:50:00 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Jul 2011 16:48:16 GMT'}]",2011-07-05,"[['Currie', 'James D.', ''], ['Rampersad', 'Narad', '']]","['Combinatorics on words', 'abelian repetitions', 'patterns']"
18274,1605.00184,Alexander Nwala,Alexander Nwala and Michael Nelson,"A Supervised Learning Algorithm for Binary Domain Classification of Web
  Queries using SERPs",Figure 6. fix,,,,cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  General purpose Search Engines (SEs) crawl all domains (e.g., Sports, News,
Entertainment) of the Web, but sometimes the informational need of a query is
restricted to a particular domain (e.g., Medical). We leverage the work of SEs
as part of our effort to route domain specific queries to local Digital
Libraries (DLs). SEs are often used even if they are not the ""best"" source for
certain types of queries. Rather than tell users to ""use this DL for this kind
of query"", we intend to automatically detect when a query could be better
served by a local DL (such as a private, access-controlled DL that is not
crawlable via SEs). This is not an easy task because Web queries are short,
ambiguous, and there is lack of quality labeled training data (or it is
expensive to create). To detect queries that should be routed to local,
specialized DLs, we first send the queries to Google and then examine the
features in the resulting Search Engine Result Pages (SERPs), and then classify
the query as belonging to either the scholar or non-scholar domain. Using
400,000 AOL queries for the non-scholar domain and 400,000 queries from the
NASA Technical Report Server (NTRS) for the scholar domain, our classifier
achieved a precision of 0.809 and F-measure of 0.805.
","[{'version': 'v1', 'created': 'Sat, 30 Apr 2016 23:02:43 GMT'}, {'version': 'v2', 'created': 'Tue, 3 May 2016 01:10:45 GMT'}]",2016-05-04,"[['Nwala', 'Alexander', ''], ['Nelson', 'Michael', '']]","['Search Engines', 'Digital Libraries', 'Web queries', 'Query Understanding', 'Web query domain classification']"
18275,1603.02826,Osmanbey Uzunkol,Mehmet Sabir Kiraz and Osmanbey Uzunkol,Still Wrong Use of Pairings in Cryptography,25 pages,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several pairing-based cryptographic protocols are recently proposed with a
wide variety of new novel applications including the ones in emerging
technologies like cloud computing, internet of things (IoT), e-health systems
and wearable technologies. There have been however a wide range of incorrect
use of these primitives. The paper of Galbraith, Paterson, and Smart (2006)
pointed out most of the issues related to the incorrect use of pairing-based
cryptography. However, we noticed that some recently proposed applications
still do not use these primitives correctly. This leads to unrealizable,
insecure or too inefficient designs of pairing-based protocols. We observed
that one reason is not being aware of the recent advancements on solving the
discrete logarithm problems in some groups. The main purpose of this article is
to give an understandable, informative, and the most up-to-date criteria for
the correct use of pairing-based cryptography. We thereby deliberately avoid
most of the technical details and rather give special emphasis on the
importance of the correct use of bilinear maps by realizing secure
cryptographic protocols. We list a collection of some recent papers having
wrong security assumptions or realizability/efficiency issues. Finally, we give
a compact and an up-to-date recipe of the correct use of pairings.
","[{'version': 'v1', 'created': 'Wed, 9 Mar 2016 09:48:11 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Mar 2016 07:46:35 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Nov 2016 11:57:26 GMT'}]",2016-11-24,"[['Kiraz', 'Mehmet Sabir', ''], ['Uzunkol', 'Osmanbey', '']]","['Pairing-Based Protocols', 'Bilinear Maps', 'Security', 'Efficiency', 'The Discrete Logarithm Problem']"
18276,1610.07488,Yu Song,"Yu Song, Yiquan Wu",Laplacian regularized low rank subspace clustering,"17 pages, 4 figures, 5 tables. The paper is submitted to ""computer
  vision and image understanding"". arXiv admin note: text overlap with
  arXiv:1610.03604; text overlap with arXiv:1203.1005 by other authors",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of fitting a union of subspaces to a collection of data points
drawn from multiple subspaces is considered in this paper. In the traditional
low rank representation model, the dictionary used to represent the data points
is chosen as the data points themselves and thus the dictionary is corrupted
with noise. This problem is solved in the low rank subspace clustering model
which decomposes the corrupted data matrix as the sum of a clean and
self-expressive dictionary plus a matrix of noise and gross errors. Also, the
clustering results of the low rank representation model can be enhanced by
using a graph of data similarity. This model is called Laplacian regularized
low rank representation model with a graph regularization term added to the
objective function. Inspired from the above two ideas, in this paper a
Laplacian regularized low rank subspace clustering model is proposed. This
model uses a clean dictionary to represent the data points and a graph
regularization term is also incorporated in the objective function.
Experimental results show that, compared with the traditional low rank
representation model, low rank subspace clustering model and several other
state-of-the-art subspace clustering model, the model proposed in this paper
can get better subspace clustering results with lower clustering error.
","[{'version': 'v1', 'created': 'Mon, 24 Oct 2016 16:51:05 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Oct 2016 01:24:55 GMT'}]",2016-10-31,"[['Song', 'Yu', ''], ['Wu', 'Yiquan', '']]","['subspace clustering', 'low rank representation', 'graph', 'Laplacian matrix']"
18277,0806.1798,Arnaud Martin,"Arnaud Martin (E3I2), Christophe Osswald (E3I2)",Human expert fusion for image classification,,Information & Security. An International Journal 20 (2006) 122-141,,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In image classification, merging the opinion of several human experts is very
important for different tasks such as the evaluation or the training. Indeed,
the ground truth is rarely known before the scene imaging. We propose here
different models in order to fuse the informations given by two or more
experts. The considered unit for the classification, a small tile of the image,
can contain one or more kind of the considered classes given by the experts. A
second problem that we have to take into account, is the amount of certainty of
the expert has for each pixel of the tile. In order to solve these problems we
define five models in the context of the Dempster-Shafer Theory and in the
context of the Dezert-Smarandache Theory and we study the possible decisions
with these models.
","[{'version': 'v1', 'created': 'Wed, 11 Jun 2008 07:09:15 GMT'}]",2008-12-18,"[['Martin', 'Arnaud', '', 'E3I2'], ['Osswald', 'Christophe', '', 'E3I2']]","['Experts fusion', 'DST', 'DSmT', 'image classification']"
18278,1504.07012,Emre Erturk,Emre Erturk and Derwyn Fail,"Information Technology in New Zealand: Review of Emerging Social Trends,
  Current Issues, and Policies",,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses the general state of information technology in New
Zealand society, current issues, and policies. It is a qualitative study that
reviews recent scholarly articles, periodicals, and surveys in order to create
an understanding of some of the information technology issues and trends in New
Zealand. After reviewing previous research, it assesses the potential existence
and nature of a 'digital divide' in New Zealand society whilst also evaluating
possible strategic responses to the issue. New Zealand society has rapidly
accepted emerging online trends as well as achieving an overall high level of
Internet provision nationally. Through government policy and education, this
small island nation has remained at the forefront of information technology and
can be considered somewhat of an e-democracy. However, despite these positives,
there is a risk of low-income communities being left behind as New Zealand
society becomes increasingly dependent on IT in the workplace and in
governmental administration.
","[{'version': 'v1', 'created': 'Mon, 27 Apr 2015 10:11:14 GMT'}]",2015-04-28,"[['Erturk', 'Emre', ''], ['Fail', 'Derwyn', '']]","['IT policy', 'Internet access', 'digital divide', 'e-commerce', 'New Zealand']"
18279,1002.1016,Andrea Clementi,"Andrea Clementi, Angelo Monti, Riccardo Silvestri",Modelling Mobility: A Discrete Revolution,"34 pages, 4 figures, submitted paper",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a new approach to model and analyze \emph{Mobility}. It is fully
based on discrete mathematics and yields a class of mobility models, called the
\emph{Markov Trace} Model. This model can be seen as the discrete version of
the \emph{Random Trip} Model including all variants of the \emph{Random
Way-Point} Model \cite{L06}.
  We derive fundamental properties and \emph{explicit} analytical formulas for
the \emph{stationary distributions} yielded by the Markov Trace Model. Such
results can be exploited to compute formulas and properties for concrete cases
of the Markov Trace Model by just applying counting arguments.
  We apply the above general results to the discrete version of the
\emph{Manhattan Random Way-Point} over a square of bounded size.
  We get formulas for the total stationary distribution and for two important
\emph{conditional} ones: the agent spatial and destination distributions. Our
method makes the analysis of complex mobile systems a feasible task.
  As a further evidence of this important fact, we first model a complex
vehicular-mobile system over a set of crossing streets. Several concrete issues
are implemented such as parking zones, traffic lights, and variable vehicle
speeds. By using a \emph{modular} version of the Markov Trace Model, we get
explicit formulas for the stationary distributions yielded by this
vehicular-mobile model as well.
","[{'version': 'v1', 'created': 'Thu, 4 Feb 2010 17:09:15 GMT'}]",2010-02-05,"[['Clementi', 'Andrea', ''], ['Monti', 'Angelo', ''], ['Silvestri', 'Riccardo', '']]","['Models of Mobility', 'Mobile Ad-Hoc Networks', 'Discrete Markov Chains']"
18280,0807.2358,Sandor P. Fekete,Sandor P. Fekete and Christiane Schmidt,Polygon Exploration with Time-Discrete Vision,"28 pages, 17 figures, 2 photographs, 3 tables, Latex. Updated some
  details (title, figures and text) for final journal revision, including
  explicit assumption of full edge visibility","Computational Geometry: Theory and Applications, 43 (2010),
  148-168",,,cs.CG cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the advent of autonomous robots with two- and three-dimensional scanning
capabilities, classical visibility-based exploration methods from computational
geometry have gained in practical importance. However, real-life laser scanning
of useful accuracy does not allow the robot to scan continuously while in
motion; instead, it has to stop each time it surveys its environment. This
requirement was studied by Fekete, Klein and Nuechter for the subproblem of
looking around a corner, but until now has not been considered in an online
setting for whole polygonal regions.
  We give the first algorithmic results for this important algorithmic problem
that combines stationary art gallery-type aspects with watchman-type issues in
an online scenario: We demonstrate that even for orthoconvex polygons, a
competitive strategy can be achieved only for limited aspect ratio A (the ratio
of the maximum and minimum edge length of the polygon), i.e., for a given lower
bound on the size of an edge; we give a matching upper bound by providing an
O(log A)-competitive strategy for simple rectilinear polygons, using the
assumption that each edge of the polygon has to be fully visible from some scan
point.
","[{'version': 'v1', 'created': 'Tue, 15 Jul 2008 12:10:08 GMT'}, {'version': 'v2', 'created': 'Mon, 27 Sep 2010 17:38:34 GMT'}]",2010-09-28,"[['Fekete', 'Sandor P.', ''], ['Schmidt', 'Christiane', '']]","['Searching', 'scan cost', 'visibility problems', 'watchman problems', 'online searching', 'competitive strategies', 'autonomous mobile robots']"
18281,1312.5481,Siti Salwa Md. Sawari SSMS,"Azlina Mustaffa, Norazura Ezuana Mohd Najid, Siti Salwa Md. Sawari","Students' Perceptions and Attitude towards the effectiveness of Prezi
  Uses in learning Islamic Subject",,International Journal of Computer Science (IJASCSE)2013,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Prezi is a Hungarian software company, producing a cloud-based presentation
software and storytelling tool for presenting ideas on a virtual canvas
(Prezi.com). Prezi is one of the teaching materials that help students in
learning process. This study aims to explore the effectiveness of using Prezi
in Islamic education subject among secondary schools under the topic of
marriage in Islam: polygamy. Specifically its aims to identify students
interest and second examine their attitude towards the uses of Prezi in
learning Islamic educations. A total of 22 students participated in the survey,
employing a 22-item questionnaire. The data was analyzed quantitatively using
Statistical Package for the Social Sciences (SPSS). Result from this study
revealed that student shows their interest in learning Islamic Educations when
teachers uses Prezi. In additions students also show positive attitude towards
uses of Prezi in Classroom. As conclusions, the uses of Prezi presentation is
easy and its technique for developing a more creative and innovative approach
in teaching strategies among Islamic educators.
","[{'version': 'v1', 'created': 'Thu, 19 Dec 2013 11:13:24 GMT'}]",2013-12-20,"[['Mustaffa', 'Azlina', ''], ['Najid', 'Norazura Ezuana Mohd', ''], ['Sawari', 'Siti Salwa Md.', '']]","['Prezi', 'Student Perception', 'Attitude']"
18282,1310.0581,Nisheeth Joshi,"Vaishali Gupta, Nisheeth Joshi, Iti Mathur",Rule Based Stemmer in Urdu,"In Proceedings of 4th International Conference on Computer and
  Communication Technology",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Urdu is a combination of several languages like Arabic, Hindi, English,
Turkish, Sanskrit etc. It has a complex and rich morphology. This is the reason
why not much work has been done in Urdu language processing. Stemming is used
to convert a word into its respective root form. In stemming, we separate the
suffix and prefix from the word. It is useful in search engines, natural
language processing and word processing, spell checkers, word parsing, word
frequency and count studies. This paper presents a rule based stemmer for Urdu.
The stemmer that we have discussed here is used in information retrieval. We
have also evaluated our results by verifying it with a human expert.
","[{'version': 'v1', 'created': 'Wed, 2 Oct 2013 06:15:03 GMT'}]",2013-10-03,"[['Gupta', 'Vaishali', ''], ['Joshi', 'Nisheeth', ''], ['Mathur', 'Iti', '']]","['Stemming', 'Rule Based Stemmer', 'Urdu', 'Complex and Rich morphology']"
18283,0708.3014,Elisa Gorla,"Elisa Gorla, Christoph Puttmann, and Jamshid Shokrollahi",Explicit formulas for efficient multiplication in F_{3^{6m}},"11 pages, to appear in the proceedings of SAC2007",,,,cs.CR cs.CC,,"  Efficient computation of the Tate pairing is an important part of
pairing-based cryptography. Recently with the introduction of the Duursma-Lee
method special attention has been given to the fields of characteristic 3.
Especially multiplication in F_{3^{6m}}, where m is prime, is an important
operation in the above method. In this paper we propose a new method to reduce
the number of F_{3^m} multiplications for multiplication in F_{3^{6m}} from 18
in recent implementations to 15. The method is based on the fast Fourier
tranmsform and explicit formulas are given. The execution times of our software
implementations for F_{3^{6m}} show the efficiency of our results.
","[{'version': 'v1', 'created': 'Wed, 22 Aug 2007 13:52:09 GMT'}]",2007-08-23,"[['Gorla', 'Elisa', ''], ['Puttmann', 'Christoph', ''], ['Shokrollahi', 'Jamshid', '']]","['Finite field arithmetic', 'fast Fourier transform', 'Lagrange interpolation', 'Tate pairing computation']"
18284,1005.2218,Adrian Dumitrescu,"Adrian Dumitrescu, Minghui Jiang and J\'anos Pach",Opaque sets,"18 pages, 7 figures. This version replaces the previous version;
  Lemma 1 and its proof have been revised and simplified",,,,cs.CG cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of finding ""small"" sets that meet every straight-line which
intersects a given convex region was initiated by Mazurkiewicz in 1916. We call
such a set an {\em opaque set} or a {\em barrier} for that region. We consider
the problem of computing the shortest barrier for a given convex polygon with
$n$ vertices. No exact algorithm is currently known even for the simplest
instances such as a square or an equilateral triangle. For general barriers, we
present an approximation algorithm with ratio $1/2 + \frac{2
+\sqrt{2}}{\pi}=1.5867...$. For connected barriers we achieve the approximation
ratio 1.5716, while for single-arc barriers we achieve the approximation ratio
$\frac{\pi+5}{\pi+2} = 1.5834...$. All three algorithms run in O(n) time. We
also show that if the barrier is restricted to the (interior and the boundary
of the) input polygon, then the problem admits a fully polynomial-time
approximation scheme for the connected case and a quadratic-time exact
algorithm for the single-arc case.
","[{'version': 'v1', 'created': 'Wed, 12 May 2010 22:13:35 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Jun 2010 22:47:50 GMT'}, {'version': 'v3', 'created': 'Fri, 2 Jul 2010 20:38:27 GMT'}, {'version': 'v4', 'created': 'Mon, 23 Jan 2012 21:50:19 GMT'}, {'version': 'v5', 'created': 'Mon, 10 Sep 2012 18:52:05 GMT'}]",2015-03-17,"[['Dumitrescu', 'Adrian', ''], ['Jiang', 'Minghui', ''], ['Pach', 'János', '']]","['Opaque set', 'opaque polygon problem', 'point goalie problem', 'traveling salesmanproblem', 'approximation algorithm', 'Cauchy’s surface area formula']"
18285,1603.06200,Florian Geigl,"Florian Geigl, Kristina Lerman, Simon Walk, Markus Strohmaier, Denis
  Helic","Assessing the Navigational Effects of Click Biases and Link Insertion on
  the Web",This paper is currently under review at ACM Hypertext 2016,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Websites have an inherent interest in steering user navigation in order to,
for example, increase sales of specific products or categories, or to guide
users towards specific information. In general, website administrators can use
the following two strategies to influence their visitors' navigation behavior.
First, they can introduce click biases to reinforce specific links on their
website by changing their visual appearance, for example, by locating them on
the top of the page. Second, they can utilize link insertion to generate new
paths for users to navigate over. In this paper, we present a novel approach
for measuring the potential effects of these two strategies on user navigation.
Our results suggest that, depending on the pages for which we want to increase
user visits, optimal link modification strategies vary. Moreover, simple
topological measures can be used as proxies for assessing the impact of the
intended changes on the navigation of users, even before these changes are
implemented.
","[{'version': 'v1', 'created': 'Sun, 20 Mar 2016 11:07:48 GMT'}]",2016-03-22,"[['Geigl', 'Florian', ''], ['Lerman', 'Kristina', ''], ['Walk', 'Simon', ''], ['Strohmaier', 'Markus', ''], ['Helic', 'Denis', '']]","['Click Biases', 'Link Insertion', 'Random Surfer', 'Stationary Distribution']"
18286,1106.1510,Alexander Shkotin,"Alex Shkotin, Vladimir Ryakhovsky, Dmitry Kudryavtsev",Towards OWL-based Knowledge Representation in Petrology,"10 pages. The paper has been accepted by OWLED2011 as a long
  presentation",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents our work on development of OWL-driven systems for formal
representation and reasoning about terminological knowledge and facts in
petrology. The long-term aim of our project is to provide solid foundations for
a large-scale integration of various kinds of knowledge, including basic terms,
rock classification algorithms, findings and reports. We describe three steps
we have taken towards that goal here. First, we develop a semi-automated
procedure for transforming a database of igneous rock samples to texts in a
controlled natural language (CNL), and then a collection of OWL ontologies.
Second, we create an OWL ontology of important petrology terms currently
described in natural language thesauri. We describe a prototype of a tool for
collecting definitions from domain experts. Third, we present an approach to
formalization of current industrial standards for classification of rock
samples, which requires linear equations in OWL 2. In conclusion, we discuss a
range of opportunities arising from the use of semantic technologies in
petrology and outline the future work in this area.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2011 07:01:59 GMT'}]",2011-06-09,"[['Shkotin', 'Alex', ''], ['Ryakhovsky', 'Vladimir', ''], ['Kudryavtsev', 'Dmitry', '']]","['OWL', 'petrology', 'controlled natural language', 'formal conceptualization', 'rock classification', 'formal theory']"
18287,1301.6739,Ross D. Shachter,Ross D. Shachter,Efficient Value of Information Computation,"Appears in Proceedings of the Fifteenth Conference on Uncertainty in
  Artificial Intelligence (UAI1999)",,,UAI-P-1999-PG-594-601,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the most useful sensitivity analysis techniques of decision analysis
is the computation of value of information (or clairvoyance), the difference in
value obtained by changing the decisions by which some of the uncertainties are
observed. In this paper, some simple but powerful extensions to previous
algorithms are introduced which allow an efficient value of information
calculation on the rooted cluster tree (or strong junction tree) used to solve
the original decision problem.
","[{'version': 'v1', 'created': 'Wed, 23 Jan 2013 16:00:56 GMT'}]",2013-01-30,"[['Shachter', 'Ross D.', '']]","['value of information', 'clairvoyance', 'clus\xadter trees', 'junction trees', 'decision analysis', 'influence diagrams']"
18288,0909.2062,Rafael Fernandez-Moctezuma,"Rafael Fern\'andez-Moctezuma (Portland State University), Kristin
  Tufte (Portland State University), Jin Li (Portland State University)","Inter-Operator Feedback in Data Stream Management Systems via
  Punctuation",CIDR 2009,,,,cs.DB,http://creativecommons.org/licenses/by/3.0/,"  High-volume, high-speed data streams may overwhelm the capabilities of stream
processing systems; techniques such as data prioritization, avoidance of
unnecessary processing and on-demand result production may be necessary to
reduce processing requirements. However, the dynamic nature of data streams, in
terms of both rate and content, makes the application of such techniques
challenging. Such techniques have been addressed in the context of static and
centralized query optimization; however, they have not been fully addressed for
data stream management systems. In this work, we present a comprehensive
framework that supports prioritization, avoidance of unnecessary work, and
on-demand result production over distributed, unreliable, bursty, disordered
data sources, typical of many data streams. We propose a form of inter-operator
feedback, which flows against the stream direction, to communicate the
information needed to enable execution of these techniques. This feedback
leverages punctuations to describe the subsets of interest. We identify
potential sources of feedback information, characterize new types of
punctuation to support feedback, and describe the roles of producers,
exploiters, and relayers of feedback that query operators may implement. We
present initial experimental observations using the NiagaraST data-stream
system.
","[{'version': 'v1', 'created': 'Thu, 10 Sep 2009 22:55:16 GMT'}]",2010-02-23,"[['Fernández-Moctezuma', 'Rafael', '', 'Portland State University'], ['Tufte', 'Kristin', '', 'Portland State University'], ['Li', 'Jin', '', 'Portland State University']]","['Data Stream Management Systems', 'Punctuation', 'Feedback']"
18289,1304.5100,V\'ictor L\'opez Mill\'an,"V\'ictor M. L\'opez Mill\'an, Vicent Cholvi, Luis L\'opez and Antonio
  Fern\'andez Anta","Improving Resource Location with Locally Precomputed Partial Random
  Walks","25 pages, 15 figures. arXiv admin note: substantial text overlap with
  arXiv:1107.4660",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Random walks can be used to search complex networks for a desired resource.
To reduce search lengths, we propose a mechanism based on building random walks
connecting together partial walks (PW) previously computed at each network
node. Resources found in each PW are registered. Searches can then jump over
PWs where the resource is not located. However, we assume that perfect
recording of resources may be costly, and hence, probabilistic structures like
Bloom filters are used. Then, unnecessary hops may come from false positives at
the Bloom filters. Two variations of this mechanism have been considered,
depending on whether we first choose a PW in the current node and then check it
for the resource, or we first check all PWs and then choose one. In addition,
PWs can be either simple random walks or self-avoiding random walks. Analytical
models are provided to predict expected search lengths and other magnitudes of
the resulting four mechanisms. Simulation experiments validate these
predictions and allow us to compare these techniques with simple random walk
searches, finding very large reductions of expected search lengths.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2013 12:19:13 GMT'}]",2013-04-19,"[['Millán', 'Víctor M. López', ''], ['Cholvi', 'Vicent', ''], ['López', 'Luis', ''], ['Anta', 'Antonio Fernández', '']]","['Random walks', 'self-avoiding random walks', 'network search', 'resource location', 'search length']"
18290,1504.02001,Paul van der Walt,Paul van der Walt,Constraining application behaviour by generating languages,"8 pages, 8th European Lisp Symposium",,,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Writing a platform for reactive applications which enforces operational
constraints is difficult, and has been approached in various ways. In this
experience report, we detail an approach using an embedded DSL which can be
used to specify the structure and permissions of a program in a given
application domain. Once the developer has specified which components an
application will consist of, and which permissions each one needs, the
specification itself evaluates to a new, tailored, language. The final
implementation of the application is then written in this specialised
environment where precisely the API calls associated with the permissions which
have been granted, are made available.
  Our prototype platform targets the domain of mobile computing, and is
implemented using Racket. It demonstrates resource access control (e.g.,
camera, address book, etc.) and tries to prevent leaking of private data.
Racket is shown to be an extremely effective platform for designing new
programming languages and their run-time libraries. We demonstrate that this
approach allows reuse of an inter-component communication layer, is convenient
for the application developer because it provides high-level building blocks to
structure the application, and provides increased control to the platform
owner, preventing certain classes of errors by the developer.
","[{'version': 'v1', 'created': 'Wed, 8 Apr 2015 15:07:13 GMT'}]",2015-04-09,"[['van der Walt', 'Paul', '']]","['are inbold', 'terminals in italic', 'rules in normal font']"
18291,1312.2341,Meiappane  Aroumougame,"A. Meiappane, V. Prasanna Venkatesan, J. Prabavadhi",Visitor Pattern: Implementation of Enquiry Pattern for Internet Banking,8 pages,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper brings out the design patterns according to the various services
involved in internet banking. The Pattern oriented Software Architecture uses
the pattern which eliminates the difficulty of reusability in a particular
context. The patterns are to be designed using BPM (Business Process Model) for
effective cross cutting on process level. For implementing the above said BPM,
the Internet banking has been taken to implement the pattern into it. The
Analysis and identification of various processes in Internet Banking have been
done, to identify the effective cross cutting features. With this process the
pattern has been designed, as a reusability component to be used by the
Software Architect. The pattern help us to resolve recurring problems
constructively and based on proven solutions and also support us in
understanding the architecture of a given software system. Once the model is
finalized by analyzing we found enquiry pattern as the visitor pattern and
implement the pattern.
","[{'version': 'v1', 'created': 'Mon, 9 Dec 2013 08:45:30 GMT'}]",2015-03-24,"[['Meiappane', 'A.', ''], ['Venkatesan', 'V. Prasanna', ''], ['Prabavadhi', 'J.', '']]","['Pattern', 'Pattern Oriented Software Architecture', 'Business Process Modeling.   1']"
18292,1401.5136,Cong Li,"Cong Li, Michael Georgiopoulos, Georgios C. Anagnostopoulos","A Unifying Framework for Typical Multi-Task Multiple Kernel Learning
  Problems","17 pages, 1 figure. Accepted by IEEE Transactions on Neural Networks
  and Learning Systems; currently published as Early Access Article",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the past few years, Multi-Kernel Learning (MKL) has received significant
attention among data-driven feature selection techniques in the context of
kernel-based learning. MKL formulations have been devised and solved for a
broad spectrum of machine learning problems, including Multi-Task Learning
(MTL). Solving different MKL formulations usually involves designing algorithms
that are tailored to the problem at hand, which is, typically, a non-trivial
accomplishment.
  In this paper we present a general Multi-Task Multi-Kernel Learning
(Multi-Task MKL) framework that subsumes well-known Multi-Task MKL
formulations, as well as several important MKL approaches on single-task
problems. We then derive a simple algorithm that can solve the unifying
framework. To demonstrate the flexibility of the proposed framework, we
formulate a new learning problem, namely Partially-Shared Common Space (PSCS)
Multi-Task MKL, and demonstrate its merits through experimentation.
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2014 01:16:44 GMT'}]",2014-01-22,"[['Li', 'Cong', ''], ['Georgiopoulos', 'Michael', ''], ['Anagnostopoulos', 'Georgios C.', '']]","['Multiple Kernel Learning', 'Multi-task Learning', 'Support Vector Machines']"
18293,1605.02996,Matthieu Jonckheere,"Matthieu Jonckheere, Balakrishna Prabhu",Asymptotics of Insensitive Load Balancing and Blocking Phases,,,,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the problem of giving robust performance bounds based on the study
of the asymptotic behavior of the insensitive load balancing schemes when the
number of servers and the load scales jointly. These schemes have the desirable
property that the stationary distribution of the resulting stochastic network
depends on the distribution of job sizes only through its mean. It was shown
that they give good estimates of performance indicators for systems with finite
buffers, generalizing henceforth Erlang's formula whereas optimal policies are
already theoretically and computationally out of reach for networks of moderate
size. We study a single class of traffic acting on a symmetric set of processor
sharing queues with finite buffers and we consider the case where the load
scales with the number of servers. We characterize central limit theorems and
large deviations, the response of symmetric systems under those schemes at
different scales and show that three amplitudes of deviations can be
identified. A central limit scaling takes place for a sub-critical load; for
$\rho=1$, the number of free servers scales like $n^{ {\theta \over \theta+1}}$
($\theta$ being the buffer depth and $n$ being the number of servers) and is of
order 1 for super-critical loads. This further implies the existence of
different phases for the blocking probability, Before a (refined) critical load
$\rho_c(n)=1-a n^{- {\theta \over \theta+1}}$, the blocking is exponentially
small and becomes of order $ n^{- {\theta \over \theta+1}}$ at $\rho_c(n)$.
This generalizes the well-known Quality and Efficiency Driven (QED) regime or
Halfin-Whitt regime for a one-dimensional queue, and leads to a generalized
staffing rule for a given target blocking probability.
","[{'version': 'v1', 'created': 'Tue, 10 May 2016 13:21:29 GMT'}]",2016-05-11,"[['Jonckheere', 'Matthieu', ''], ['Prabhu', 'Balakrishna', '']]","['Insensitive load balancing', 'blocking phases', 'mean-field scalings', 'QED-JagermanHalfin-Whitt regime']"
18294,1605.00137,Jacek Cicho\'n,"Jacek Cichon, Rafal Kapelko, Dominik Markiewicz",On Leader Green Election,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the number of survivors in the Leader Green Election (LGE)
algorithm introduced by P. Jacquet, D. Milioris and P. Muhlethaler in 2013. Our
method is based on the Rice method and gives quite precise formulas. We derive
upper bounds on the number of survivors in this algorithm and we propose a
proper use of LGE.
  Finally, we discuss one property of a general urns and balls problem and show
a lower bound for a required number of rounds for a large class of distributed
leader election protocols.
","[{'version': 'v1', 'created': 'Sat, 30 Apr 2016 17:07:47 GMT'}, {'version': 'v2', 'created': 'Tue, 10 May 2016 20:23:09 GMT'}]",2016-05-12,"[['Cichon', 'Jacek', ''], ['Kapelko', 'Rafal', ''], ['Markiewicz', 'Dominik', '']]","['leader election', 'distributed algorithms', 'geometric distribution', 'Rice method', 'urns and balls model']"
18295,1610.03229,George Grispos Dr.,"William Bradley Glisson, Tim Storer, Andrew Blyth, George Grispos,
  Matt Campbell",In The Wild Residual Data Research and Privacy,"Residual Data, In-the-wild, Digital Forensics, Privacy","Journal of Digital Forensics, Security and Law, 11(1), pp. 77-98
  (2016)",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As the world becomes increasingly dependent on technology, researchers in
both industry and academia endeavor to understand how technology is used, the
impact it has on everyday life, the artifact life-cycle and overall
integrations of digital information. In doing so, researchers are increasingly
gathering 'real-world' or 'in-the-wild' residual data, obtained from a variety
of sources, without the explicit consent of the original owners. This data
gathering raises significant concerns regarding privacy, ethics and
legislation, as well as practical considerations concerning investigator
training, data storage, overall security and data disposal. This research
surveys recent studies of residual data gathered in-the-wild and analyzes the
challenges that were confronted. Amalgamating these insights, the research
presents a compendium of practices for addressing the issues that can arise
in-the-wild when conducting residual data research. The practices identified in
this research can be used to critique current projects and assess the
feasibility of proposed future research.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2016 08:09:56 GMT'}]",2016-10-12,"[['Glisson', 'William Bradley', ''], ['Storer', 'Tim', ''], ['Blyth', 'Andrew', ''], ['Grispos', 'George', ''], ['Campbell', 'Matt', '']]","['Residual Data', 'In-the-wild', 'Digital Forensics', 'Privacy']"
18296,1507.00459,Jingchao Chen,Jingchao Chen,Fast Blocked Clause Decomposition with High Quality,15 pages,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Any CNF formula can be decomposed two blocked subsets such that both can be
solved by BCE (Blocked Clause Elimination). To make the decomposition more
useful, one hopes to have the decomposition as unbalanced as possible. It is
often time consuming to achieve this goal. So far there have been several
decomposition and post-processing algorithms such as PureDecompose,
QuickDecompose, EagerMover etc. We found that these existing algorithms are
often either inefficient or low-quality decomposition. This paper aims at
improving the decomposition quality, while keeping the runtime of algorithms
under control. To achieve this goal, we improve the existing BCE, and present
two new variants of PureDecompose, a new heuristic decomposition called
LessInterfereDecompose, and a new post-processing algorithm called
RsetGuidedDecompose. Combining these new techniques results in a new algorithm
called MixDecompose. In our experiments, there is no application formula where
the quality of PureDecompose+EagerMover is better than MixDecompose. In terms
of speed, MixDecompose is also very fast. Our average runtime is a little
longer, but the worst-case runtime is shorter. In theory, our two variants of
PureDecompose requires linear time in the number of clauses. By limiting the
size of the touch list used by BCE, we can guarantee always that MixDecompose
runs in linear time.
","[{'version': 'v1', 'created': 'Thu, 2 Jul 2015 08:07:28 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Dec 2015 04:14:23 GMT'}]",2015-12-22,"[['Chen', 'Jingchao', '']]","['Blocked Clause Elimination', 'Blocked Clause Decomposition', 'Tool for CNF preprocessing']"
18297,1412.7961,Martin Homola,Marjan Alirezaie and Amy Loutfi,Reasoning for Improved Sensor Data Interpretation in a Smart Home,"ARCOE-Logic 2014 Workshop Notes, pp. 1-12",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper an ontological representation and reasoning paradigm has been
proposed for interpretation of time-series signals. The signals come from
sensors observing a smart environment. The signal chosen for the annotation
process is a set of unintuitive and complex gas sensor data. The ontology of
this paradigm is inspired form the SSN ontology (Semantic Sensor Network) and
used for representation of both the sensor data and the contextual information.
The interpretation process is mainly done by an incremental ASP solver which as
input receives a logic program that is generated from the contents of the
ontology. The contextual information together with high level domain knowledge
given in the ontology are used to infer explanations (answer sets) for changes
in the ambient air detected by the gas sensors.
","[{'version': 'v1', 'created': 'Fri, 26 Dec 2014 17:38:19 GMT'}]",2014-12-30,"[['Alirezaie', 'Marjan', ''], ['Loutfi', 'Amy', '']]","['semantic sensor ontology', 'non-monotonic reasoning', 'answerset programming', 'knowledge representation']"
18298,1702.03470,Ehsan Sherkat,"Ehsan Sherkat, Evangelos Milios",Vector Embedding of Wikipedia Concepts and Entities,,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using deep learning for different machine learning tasks such as image
classification and word embedding has recently gained many attentions. Its
appealing performance reported across specific Natural Language Processing
(NLP) tasks in comparison with other approaches is the reason for its
popularity. Word embedding is the task of mapping words or phrases to a low
dimensional numerical vector. In this paper, we use deep learning to embed
Wikipedia Concepts and Entities. The English version of Wikipedia contains more
than five million pages, which suggest its capability to cover many English
Entities, Phrases, and Concepts. Each Wikipedia page is considered as a
concept. Some concepts correspond to entities, such as a person's name, an
organization or a place. Contrary to word embedding, Wikipedia Concepts
Embedding is not ambiguous, so there are different vectors for concepts with
similar surface form but different mentions. We proposed several approaches and
evaluated their performance based on Concept Analogy and Concept Similarity
tasks. The results show that proposed approaches have the performance
comparable and in some cases even higher than the state-of-the-art methods.
","[{'version': 'v1', 'created': 'Sun, 12 Feb 2017 00:23:04 GMT'}]",2017-02-14,"[['Sherkat', 'Ehsan', ''], ['Milios', 'Evangelos', '']]","['Wikipedia', 'Concept Embedding', 'Vector Representation']"
18299,1401.6359,Daniel Gor\'in,"Daniel Gor\'in and Lutz Schr\""oder",Subsumption Checking in Conjunctive Coalgebraic Fixpoint Logics,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While reasoning in a logic extending a complete Boolean basis is coNP-hard,
restricting to conjunctive fragments of modal languages sometimes allows for
tractable reasoning even in the presence of greatest fixpoints. One such
example is the EL family of description logics; here, efficient reasoning is
based on satisfaction checking in suitable small models that characterize
formulas in terms of simulations. It is well-known, though, that not every
conjunctive modal language has a tractable reasoning problem. Natural questions
are then how common such tractable fragments are and how to identify them. In
this work we provide sufficient conditions for tractability in a general way by
considering unlabeled tableau rules for a given modal logic. We work in the
framework of coalgebraic logic as a unifying semantic setting. Apart from
recovering known results for description logics such as EL and FL0, we obtain
new ones for conjunctive fragments of relational and non-relational modal
logics with greatest fixpoints. Most notably we find tractable fragments of
game logic and the alternating-time mu-calculus.
","[{'version': 'v1', 'created': 'Fri, 24 Jan 2014 14:50:44 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Feb 2014 10:29:38 GMT'}, {'version': 'v3', 'created': 'Fri, 11 Apr 2014 07:09:19 GMT'}, {'version': 'v4', 'created': 'Mon, 21 Apr 2014 19:39:39 GMT'}, {'version': 'v5', 'created': 'Fri, 6 Jun 2014 12:02:36 GMT'}]",2014-06-09,"[['Gorín', 'Daniel', ''], ['Schröder', 'Lutz', '']]","['Materializers', 'convexity', 'tractable reasoning', 'fixpoints']"
18300,1412.5275,Azade Rezaeezade,"Ismail Nojavani, Azade Rezaeezade and Amirhassan Monadjemi",Iranian cashes recognition using mobile,arXiv #133709,"International Journal of Computer Science & Information
  Technology, volume 6, issue 6, pp.61-71, 2014",,,cs.CV,http://creativecommons.org/licenses/by/3.0/,"  In economical societies of today, using cash is an inseparable aspect of
human life. People use cashes for marketing, services, entertainments, bank
operations and so on. This huge amount of contact with cash and the necessity
of knowing the monetary value of it caused one of the most challenging problems
for visually impaired people. In this paper we propose a mobile phone based
approach to identify monetary value of a picture taken from cashes using some
image processing and machine vision techniques. While the developed approach is
very fast, it can recognize the value of cash by average accuracy of about 95%
and can overcome different challenges like rotation, scaling, collision,
illumination changes, perspective, and some others.
","[{'version': 'v1', 'created': 'Wed, 17 Dec 2014 07:51:56 GMT'}]",2014-12-18,"[['Nojavani', 'Ismail', ''], ['Rezaeezade', 'Azade', ''], ['Monadjemi', 'Amirhassan', '']]","['Cash Identification Using Mobile', 'Visually Impaired Assistant', 'Iranian Cash Identification', 'Mobile Phone Extra Usage']"
18301,1705.08362,Thorsten Wi{\ss}mann,"Ulrich Dorsch, Stefan Milius, Lutz Schr\""oder, Thorsten Wi{\ss}mann",Efficient Coalgebraic Partition Refinement,,,,,cs.DS cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a generic partition refinement algorithm that quotients
coalgebraic systems by behavioural equivalence, an important task in reactive
verification; coalgebraic generality implies in particular that we cover not
only classical relational systems but also various forms of weighted systems.
Under assumptions on the type functor that allow representing its finite
coalgebras in terms of nodes and edges, our algorithm runs in time
$\mathcal{O}(m\cdot \log n)$ where $n$ and $m$ are the numbers of nodes and
edges, respectively. Instances of our generic algorithm thus match the runtime
of the best known algorithms for unlabelled transition systems, Markov chains,
and deterministic automata (with fixed alphabets), and improve the best known
algorithms for Segala systems.
","[{'version': 'v1', 'created': 'Tue, 23 May 2017 15:31:59 GMT'}, {'version': 'v2', 'created': 'Sat, 8 Jul 2017 09:53:47 GMT'}, {'version': 'v3', 'created': 'Thu, 13 Jul 2017 10:49:21 GMT'}, {'version': 'v4', 'created': 'Mon, 9 Oct 2017 10:19:12 GMT'}]",2017-10-10,"[['Dorsch', 'Ulrich', ''], ['Milius', 'Stefan', ''], ['Schröder', 'Lutz', ''], ['Wißmann', 'Thorsten', '']]","['Coalgebra', 'Markov chains', 'partition refinement', 'transition systems']"
18302,1009.0923,Ammar Adl,"Ammar Adl, Amr Badr, Ibrahim Farag",A Note on the Membrane Computer,,"COMPUTING AND INFORMATION SYSTEMS JOURNAL, Issue2, May 2010, P 1-7",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Inspired by the emergent membrane computing (P Systems) concepts, some
efforts are carried out introducing simulation models, some are software
oriented, and others are hardware, yet all are applied with the current vision
of the conventional computers, based on ""Von Neumann architecture"", which is a
sequential design in its essence. We think that these models will need ""as a
consequent result"" to a new architecture exposing a true parallel design, in
this paper; we try to investigate and introduce a global view for how it would
be like to have such architecture. The main goal is to point out to this
direction broadly, suggesting that it might be useful considering some aspects,
like the need for a new definition of an operating system and its programs,
which will eventually lead to a higher scope: the membrane computer.
","[{'version': 'v1', 'created': 'Sun, 5 Sep 2010 14:34:13 GMT'}]",2010-12-03,"[['Adl', 'Ammar', ''], ['Badr', 'Amr', ''], ['Farag', 'Ibrahim', '']]","['P Systems', 'simulation', 'membrane OS', 'membrane computer.     1']"
18303,1610.03554,Surabhi Singh Ludu,Surabhi Singh Ludu,Review of Inferring Latent Attributes from Twitter,,,,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper reviews literature from 2011 to 2013 on how Latent attributes like
gender, political leaning etc. can be inferred from a person's twitter and
neighborhood data. Prediction of demographic data can bring value to
businesses, can prove instrumental in legal investigation. Moreover, political
leanings can be inferred from the wide variety of user data available on-line.
The motive of this review is to understand how large data sets can be made from
available twitter data. The tweeting and re tweeting behavior of a user can be
user to infer attributes like, gender, age etc. We explore in this text how
this field can be expanded in future and possible avenues for future research.
","[{'version': 'v1', 'created': 'Sun, 25 Oct 2015 18:22:13 GMT'}]",2016-10-13,"[['Ludu', 'Surabhi Singh', '']]","['inference twitter', 'latent attributes', 'Gender on Twitter', 'social network analysis']"
18304,1504.06963,Szabolcs M\'esz\'aros,"Endre Cs\'oka, Szabolcs M\'esz\'aros, Andr\'as Pongr\'acz",Generalized solution for the Herman Protocol Conjecture,"18 pages, 2 figures, extended and improved version",,,,cs.DS cs.DC math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Herman Protocol Conjecture states that the expected time
$\mathbb{E}(\mathbf{T})$ of Herman's self-stabilizing algorithm in a system
consisting of $N$ identical processes organized in a ring holding several
tokens is at most $\frac{4}{27}N^{2}$. We prove the conjecture in its standard
unbiased and also in a biased form for discrete processes, and extend the
result to further variants where the tokens move via certain L\'evy processes.
Moreover, we derive a bound on the expected value of
$\mathbb{E}(\alpha^{\mathbf{T}})$ for all $1\leq \alpha\leq
(1-\varepsilon)^{-1}$ with a specific $\varepsilon>0$. Subject to the
correctness of an optimization result that can be demonstrated empirically, all
these estimations attain their maximum on the initial state with three tokens
distributed equidistantly on the ring of $N$ processes. Such a relation is the
symptom of the fact that both $\mathbb{E}(\mathbf{T})$ and
$\mathbb{E}(\alpha^{\mathbf{T}})$ are weighted sums of the probabilities
$\mathbb{P}(\mathbf{T}\geq t)$.
","[{'version': 'v1', 'created': 'Mon, 27 Apr 2015 08:14:33 GMT'}, {'version': 'v2', 'created': 'Wed, 6 May 2015 06:57:25 GMT'}, {'version': 'v3', 'created': 'Sat, 27 Jun 2015 14:01:37 GMT'}, {'version': 'v4', 'created': 'Wed, 30 Nov 2022 08:49:35 GMT'}]",2022-12-01,"[['Csóka', 'Endre', ''], ['Mészáros', 'Szabolcs', ''], ['Pongrácz', 'András', '']]","['Stochastic processes', 'Discrete optimization', 'Random algorithms', 'Stochastic optimization']"
18305,1506.00190,Ruo-Wei Hung,Ruo-Wei Hung,Hamiltonian Cycles in Linear-Convex Supergrid Graphs,"17 pages, 24 figurs",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A supergrid graph is a finite induced subgraph of the infinite graph
associated with the two-dimensional supergrid. The supergrid graphs contain
grid graphs and triangular grid graphs as subgraphs. The Hamiltonian cycle
problem for grid and triangular grid graphs was known to be NP-complete. In the
past, we have shown that the Hamiltonian cycle problem for supergrid graphs is
also NP-complete. The Hamiltonian cycle problem on supergrid graphs can be
applied to control the stitching trace of computerized sewing machines. In this
paper, we will study the Hamiltonian cycle property of linear-convex supergrid
graphs which form a subclass of supergrid graphs. A connected graph is called
$k$-connected if there are $k$ vertex-disjoint paths between every pair of
vertices, and is called locally connected if the neighbors of each vertex in it
form a connected subgraph. In this paper, we first show that any 2-connected,
linear-convex supergrid graph is locally connected. We then prove that any
2-connected, linear-convex supergrid graph contains a Hamiltonian cycle.
","[{'version': 'v1', 'created': 'Sun, 31 May 2015 03:42:31 GMT'}]",2015-06-02,"[['Hung', 'Ruo-Wei', '']]","['Hamiltonian cycle', 'locally connected', 'linear-convex supergrid graph', 'supergrid graph', 'grid graph', 'triangular grid graph', 'computer sewing machine']"
18306,0805.0868,EDA Publishing Association,"R.F. Shyu, Litsai Weng, Chi-Ting Ho","Manufacturing of A micro probe using supersonic aided electrolysis
  process","Submitted on behalf of EDA Publishing Association
  (http://irevues.inist.fr/handle/2042/16838)","Dans Symposium on Design, Test, Integration and Packaging of
  MEMS/MOEMS - DTIP 2008, Nice : France (2008)",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a practical micromachining technology was applied for the
fabrication of a micro probe using a complex nontraditional machining process.
A series process was combined to machine tungsten carbide rods from original
dimension. The original dimension of tungsten carbide rods was 3mm ; the rods
were ground to a fixed-dimension of 50 micrometers using precision grinding
machine in first step. And then, the rod could be machined to a
middle-dimension of 20 micrometers by electrolysis. A final desired micro
dimension can be achieved using supersonic aided electrolysis.
High-aspect-ratio of micro tungsten carbide rod was easily obtained by this
process. Surface roughness of the sample with supersonic aided agitation was
compared with that with no agitation in electrolysis. The machined surface of
the sample is very smooth due to ionized particles of anode could be removed by
supersonic aided agitation during electrolysis. Deep micro holes can also be
achieved by the machined high-aspect-rati tungsten carbide rod using EDM
process. A micro probe of a ball shape at the end was processed by proposed
supersonic aided electrolysis machining process.
","[{'version': 'v1', 'created': 'Wed, 7 May 2008 08:53:39 GMT'}]",2008-12-18,"[['Shyu', 'R. F.', ''], ['Weng', 'Litsai', ''], ['Ho', 'Chi-Ting', '']]","['Micromachining', 'Micro probe', 'Electrode', 'Electrolysis', 'Supersonic']"
18307,1212.3719,Jyotsna Kumar Mandal Prof.,"Madhumita Sengupta, J. K. Mandal, N. Ghoshal","An Authentication Technique in Frequency Domain through Wavelet
  Transform (ATFDWT)","18 Page Journal in 'Advances in Modelling Signal Processing and
  Pattern Recognition' (AMSE), vol-54, Issue 2, 20011","Advances in Modelling Signal Processing and Pattern Recognition
  (AMSE), vol-54, Issue 2, 20011, Published Journal:2011-Vol.54No1-2",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper a DWT based steganography in frequency domain, termed as ATFDWT
has been proposed. Here, the cover image is transformed into the time domain
signal through DWT, resulting four sub-image components as 'Low resolution',
'Horizontal orientation', 'Vertical orientation' and 'Diagonal orientation'.
The secret message/image bits stream in varying positions are embedded in
'Vertical orientation sub-image' followed by reverse transformation to generate
embedded/encrypted image. The decoding is done through the reverse procedure.
The experimental results against statistical and visual attack has been
computed and compared with the existing technique like IAFDDFTT[1], in terms of
Mean Square Error (MSE), Peak Signal to Noise Ratio (PSNR), Standard
Deviation(SD) and Image Fidelity(IF) analysis, which shows better performances
in ATFDWT.
","[{'version': 'v1', 'created': 'Sat, 15 Dec 2012 19:37:28 GMT'}]",2012-12-18,"[['Sengupta', 'Madhumita', ''], ['Mandal', 'J. K.', ''], ['Ghoshal', 'N.', '']]","['Authentication', 'Discrete Wavelet Transformation (DWT)', 'Frequency Domain', 'Mean Square']"
18308,1412.3284,Tamir Bendory,Tamir Bendory and Shai Dekel and Arie Feuer,"Exact recovery of Dirac ensembles from the projection onto spaces of
  spherical harmonics",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we consider the problem of recovering an ensemble of Diracs on
the sphere from its projection onto spaces of spherical harmonics. We show that
under an appropriate separation condition on the unknown locations of the
Diracs, the ensemble can be recovered through Total Variation norm
minimization. The proof of the uniqueness of the solution uses the method of
`dual' interpolating polynomials and is based on [8], where the theory was
developed for trigonometric polynomials. We also show that in the special case
of non-negative ensembles, a sparsity condition is sufficient for exact
recovery.
","[{'version': 'v1', 'created': 'Wed, 10 Dec 2014 12:47:05 GMT'}]",2014-12-11,"[['Bendory', 'Tamir', ''], ['Dekel', 'Shai', ''], ['Feuer', 'Arie', '']]","['Super resolution', 'signal recovery', 'sparse spike trains', 'l1 minimization', 'dual certificates', 'interpolation', 'semidefinite programming']"
18309,1504.08265,Erez Kantor,Erez Kantor and Shay Kutten,Optimal competitiveness for the Rectilinear Steiner Arborescence problem,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present optimal online algorithms for two related known problems involving
Steiner Arborescence, improving both the lower and the upper bounds. One of
them is the well studied continuous problem of the {\em Rectilinear Steiner
Arborescence} ($RSA$). We improve the lower bound and the upper bound on the
competitive ratio for $RSA$ from $O(\log N)$ and $\Omega(\sqrt{\log N})$ to
$\Theta(\frac{\log N}{\log \log N})$, where $N$ is the number of Steiner
points. This separates the competitive ratios of $RSA$ and the Symetric-$RSA$,
two problems for which the bounds of Berman and Coulston is STOC 1997 were
identical. The second problem is one of the Multimedia Content Distribution
problems presented by Papadimitriou et al. in several papers and Charikar et
al. SODA 1998. It can be viewed as the discrete counterparts (or a network
counterpart) of $RSA$. For this second problem we present tight bounds also in
terms of the network size, in addition to presenting tight bounds in terms of
the number of Steiner points (the latter are similar to those we derived for
$RSA$).
","[{'version': 'v1', 'created': 'Thu, 30 Apr 2015 15:18:08 GMT'}]",2015-05-01,"[['Kantor', 'Erez', ''], ['Kutten', 'Shay', '']]","['Online Algorithm', 'Approximation Algorithm', 'Video-on-Demand']"
18310,0910.2317,Andreas Spillner,"A. Dress, K. T. Huber, J. Koolen, V. Moulton, A. Spillner",An algorithm for computing cutpoints in finite metric spaces,"17 pages, 1 eps-figure",,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The theory of the tight span, a cell complex that can be associated to every
metric $D$, offers a unifying view on existing approaches for analyzing
distance data, in particular for decomposing a metric $D$ into a sum of simpler
metrics as well as for representing it by certain specific edge-weighted
graphs, often referred to as realizations of $D$. Many of these approaches
involve the explicit or implicit computation of the so-called cutpoints of (the
tight span of) $D$, such as the algorithm for computing the ""building blocks""
of optimal realizations of $D$ recently presented by A. Hertz and S. Varone.
The main result of this paper is an algorithm for computing the set of these
cutpoints for a metric $D$ on a finite set with $n$ elements in $O(n^3)$ time.
As a direct consequence, this improves the run time of the aforementioned
$O(n^6)$-algorithm by Hertz and Varone by ``three orders of magnitude''.
","[{'version': 'v1', 'created': 'Tue, 13 Oct 2009 07:09:03 GMT'}]",2009-10-14,"[['Dress', 'A.', ''], ['Huber', 'K. T.', ''], ['Koolen', 'J.', ''], ['Moulton', 'V.', ''], ['Spillner', 'A.', '']]","['metric', 'cutpoint', 'realization', 'tight span', 'decomposition', 'block']"
18311,1710.05387,Xinyan Yan,"Xinyan Yan, Krzysztof Choromanski, Byron Boots, Vikas Sindhwani",Manifold Regularization for Kernelized LSTD,"6 pages, CoRL 2017 non-archival track",,,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Policy evaluation or value function or Q-function approximation is a key
procedure in reinforcement learning (RL). It is a necessary component of policy
iteration and can be used for variance reduction in policy gradient methods.
Therefore its quality has a significant impact on most RL algorithms. Motivated
by manifold regularized learning, we propose a novel kernelized policy
evaluation method that takes advantage of the intrinsic geometry of the state
space learned from data, in order to achieve better sample efficiency and
higher accuracy in Q-function approximation. Applying the proposed method in
the Least-Squares Policy Iteration (LSPI) framework, we observe superior
performance compared to widely used parametric basis functions on two standard
benchmarks in terms of policy quality.
","[{'version': 'v1', 'created': 'Sun, 15 Oct 2017 19:59:13 GMT'}]",2017-10-17,"[['Yan', 'Xinyan', ''], ['Choromanski', 'Krzysztof', ''], ['Boots', 'Byron', ''], ['Sindhwani', 'Vikas', '']]","['Reinforcement Learning', 'Manifold Learning', 'Policy Evaluation', 'Policy Iteration']"
18312,1710.05527,Devashish Gosain,"Devashish Gosain, Anshika Agarwal, Sambuddho Chakravarty, H. B.
  Acharya",The Devils in The Details: Placing Decoy Routers in the Internet,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Decoy Routing, the use of routers (rather than end hosts) as proxies, is a
new direction in anti-censorship research. Decoy Routers (DRs), placed in
Autonomous Systems, proxy traffic from users; so the adversary, e.g., a
censorious government, attempts to avoid them. It is quite difficult to place
DRs so the adversary cannot route around them for example, we need the
cooperation of 850 ASes to contain China alone. In this paper, we consider a
different approach. We begin by noting that DRs need not intercept all the
network paths from a country, just those leading to Overt Destinations, i.e.,
unfiltered websites hosted outside the country (usually popular ones, so that
client traffic to the OD does not make the censor suspicious. Our first
question is; How many ASes are required for installing DRs to intercept a large
fraction of paths from, e.g., China to the top n websites (as per Alexa)? How
does this number grow with n? Few ASes (approx. 30) intercept over 90% of paths
to the top n sites, for n = 10, 20...200. Our first contribution is to
demonstrate with real paths that the number of ASes required for a world-wide
DR framework is small (approx. 30). Further, censor nations attempts to filter
traffic along the paths transiting these 30 ASes will not only block their own
citizens, but others residing in foreign ASes. Our second contribution in this
paper is to consider the details of DR placement: not just in which ASes DRs
should be placed to intercept traffic, but exactly where in each AS. We find
that even with our small number of ASes, we still need a total of about 11,700
DRs.We conclude that, even though a DR system involves far fewer ASes than
previously thought, it is still a major undertaking. For example, the current
routers cost over 10.3 billion USD, so if DR at line speed requires all new
hardware, the cost alone would make such a project unfeasible for most actors.
","[{'version': 'v1', 'created': 'Mon, 16 Oct 2017 06:14:46 GMT'}]",2017-10-17,"[['Gosain', 'Devashish', ''], ['Agarwal', 'Anshika', ''], ['Chakravarty', 'Sambuddho', ''], ['Acharya', 'H. B.', '']]","['Anti-Censorship', 'Decoy Routing', 'Internet topology', 'Traceroute']"
18313,1610.07282,Alireza Majzoobi,"Alireza Majzoobi, Amin Khodaei, Shay Bahramirad, Math H J Bollen","Capturing the Variabilities of Distribution Network Net-Load via
  Available Flexibility of Microgrids","CIGRE Grid of the Future Symposium, Oct.30-Nov.1 2016, Philadelphia,
  PA",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Renewable energy has attracted significant attention over the last decade,
conceivably due to its environmental benefits and the recent drops in the
development and deployment cost of the technology. The increase in renewable
generation, however, has resulted in new challenges in supply-load balancing,
owing to its intermittent, non-predictable and volatile generation features.
Several methods have been introduced to cope with negative impacts of the
renewable generation deployment. In this paper, a novel method, i.e., the
application of microgrids in capturing the variabilities of distributed
renewable generation in distribution networks is proposed and investigated.
Utilizing available flexibility of microgrids represents a local and viable
solution which leads to lower investments from electric utilities for
increasing their flexibility and providing more reserved power. It is
investigated that how the system flexibility requirements can be integrated
into the microgrid optimal scheduling model to enable microgrids in supporting
the grid operators by offering flexibility services. Using the proposed
flexibility constraints, intra-hour and inter-hour variabilities at the
distribution feeder will be efficiently captured. Numerical simulations on a
test distribution feeder, with one microgrid and several renewable-equipped
consumers, show the effectiveness of the proposed model.
","[{'version': 'v1', 'created': 'Mon, 24 Oct 2016 05:22:03 GMT'}]",2016-10-25,"[['Majzoobi', 'Alireza', ''], ['Khodaei', 'Amin', ''], ['Bahramirad', 'Shay', ''], ['Bollen', 'Math H J', '']]","['Distributed generation', 'distribution network variabilities', 'microgrid', 'flexibility', 'renewable energy', 'utility grid']"
18314,1505.06605,Ravi Kiran Sarvadevabhatla,"Ravi Kiran Sarvadevabhatla, R. Venkatesh Babu","Expresso : A user-friendly GUI for Designing, Training and Exploring
  Convolutional Neural Networks",Project page : http://val.serc.iisc.ernet.in/expresso/,,,,cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With a view to provide a user-friendly interface for designing, training and
developing deep learning frameworks, we have developed Expresso, a GUI tool
written in Python. Expresso is built atop Caffe, the open-source, prize-winning
framework popularly used to develop Convolutional Neural Networks. Expresso
provides a convenient wizard-like graphical interface which guides the user
through various common scenarios -- data import, construction and training of
deep networks, performing various experiments, analyzing and visualizing the
results of these experiments. The multi-threaded nature of Expresso enables
concurrent execution and notification of events related to the aforementioned
scenarios. The GUI sub-components and inter-component interfaces in Expresso
have been designed with extensibility in mind. We believe Expresso's
flexibility and ease of use will come in handy to researchers, newcomers and
seasoned alike, in their explorations related to deep learning.
","[{'version': 'v1', 'created': 'Mon, 25 May 2015 12:12:30 GMT'}, {'version': 'v2', 'created': 'Sun, 18 Oct 2015 07:06:35 GMT'}]",2015-10-20,"[['Sarvadevabhatla', 'Ravi Kiran', ''], ['Babu', 'R. Venkatesh', '']]","['Open Source', 'Computer Vision', 'Neural Networks', 'ParallelComputation', 'Graphical User Interface']"
18315,1704.05554,Elliot Meyerson,Elliot Meyerson and Risto Miikkulainen,Discovering Evolutionary Stepping Stones through Behavior Domination,"To Appear in Proceedings of the Genetic and Evolutionary Computation
  Conference (GECCO 2017)",,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Behavior domination is proposed as a tool for understanding and harnessing
the power of evolutionary systems to discover and exploit useful stepping
stones. Novelty search has shown promise in overcoming deception by collecting
diverse stepping stones, and several algorithms have been proposed that combine
novelty with a more traditional fitness measure to refocus search and help
novelty search scale to more complex domains. However, combinations of novelty
and fitness do not necessarily preserve the stepping stone discovery that
novelty search affords. In several existing methods, competition between
solutions can lead to an unintended loss of diversity. Behavior domination
defines a class of algorithms that avoid this problem, while inheriting
theoretical guarantees from multiobjective optimization. Several existing
algorithms are shown to be in this class, and a new algorithm is introduced
based on fast non-dominated sorting. Experimental results show that this
algorithm outperforms existing approaches in domains that contain useful
stepping stones, and its advantage is sustained with scale. The conclusion is
that behavior domination can help illuminate the complex dynamics of
behavior-driven search, and can thus lead to the design of more scalable and
robust algorithms.
","[{'version': 'v1', 'created': 'Tue, 18 Apr 2017 22:27:44 GMT'}]",2017-04-20,"[['Meyerson', 'Elliot', ''], ['Miikkulainen', 'Risto', '']]","['novelty search', 'diversity', 'non-dominated sorting', 'selection']"
18316,1109.0132,Sushma Yalamanchili,"Sushma Yalamanchili, M.Kameswara Rao",A Framework for Devanagari Script-based Captcha,"10 pages, 8 Figures, CCSEA 2011 - First International Conference,
  Chennai, July 15-17, 2011","International Journal of Advanced Information Technology, Vol. 1,
  No. 4, August, pp. 47-57, 2011",,,cs.CR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human Interactive Proofs (HIPs) are automatic reverse Turing tests designed
to distinguish between various groups of users. Completely Automatic Public
Turing test to tell Computers and Humans Apart (CAPTCHA) is a HIP system that
distinguish between humans and malicious computer programs. Many CAPTCHAs have
been proposed in the literature that text-graphical based, audio-based,
puzzle-based and mathematical questions-based. The design and implementation of
CAPTCHAs fall in the realm of Artificial Intelligence. We aim to utilize
CAPTCHAs as a tool to improve the security of Internet based applications. In
this paper we present a framework for a text-based CAPTCHA based on Devanagari
script which can exploit the difference in the reading proficiency between
humans and computer programs. Our selection of Devanagari script-based CAPTCHA
is based on the fact that it is used by a large number of Indian languages
including Hindi which is the third most spoken language. There is potential for
an exponential rise in the applications that are likely to be developed in that
script thereby making it easy to secure Indian language based applications.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2011 09:04:56 GMT'}]",2011-09-02,"[['Yalamanchili', 'Sushma', ''], ['Rao', 'M. Kameswara', '']]","['CAPTCHA', 'Devanagari', 'Human Interactive Proof', 'Optical Character Recognition', 'text-based']"
18317,0711.0917,Jan Wielemaker,"Jan Wielemaker, Zhisheng Huang and Lourens van der Meij",SWI-Prolog and the Web,"31 pages, 24 figures and 2 tables. To appear in Theory and Practice
  of Logic Programming (TPLP)",,,,cs.PL cs.SC,,"  Where Prolog is commonly seen as a component in a Web application that is
either embedded or communicates using a proprietary protocol, we propose an
architecture where Prolog communicates to other components in a Web application
using the standard HTTP protocol. By avoiding embedding in external Web servers
development and deployment become much easier. To support this architecture, in
addition to the transfer protocol, we must also support parsing, representing
and generating the key Web document types such as HTML, XML and RDF.
  This paper motivates the design decisions in the libraries and extensions to
Prolog for handling Web documents and protocols. The design has been guided by
the requirement to handle large documents efficiently. The described libraries
support a wide range of Web applications ranging from HTML and XML documents to
Semantic Web RDF processing.
  To appear in Theory and Practice of Logic Programming (TPLP)
","[{'version': 'v1', 'created': 'Tue, 6 Nov 2007 16:22:39 GMT'}]",2007-11-07,"[['Wielemaker', 'Jan', ''], ['Huang', 'Zhisheng', ''], ['van der Meij', 'Lourens', '']]","['Prolog', 'HTTP', 'HTML', 'XML', 'RDF', 'DOM', 'Semantic Web']"
18318,1702.06005,Dirk Vanhoudt,"Dirk Vanhoudt, Bert Claessens, Robbe Salenbien, Johan Desmedt","The use of distributed thermal storage in district heating grids for
  demand side management",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The work presented in this paper relates to a small scale district heating
network heated by a gas fired CHP. In most common situations, such a CHP is
heat driven operated, meaning that the CHP will switch on whenever heat is
needed, while not taking into account the demand of electricity at that time.
In this paper however, an active control strategy is developed, aiming to
maximize the profit of the CHP, selling its electricity to the spot market. The
CHP will therefore switch on at moments of high electricity prices.
Nevertheless, since there never is a perfect match between the demand of heat
and the demand of electricity, a thermal energy storage is included in the
network to overcome the difference between supply and demand of heat in the
network. In this study, three different storage concepts are compared: (1) a
central buffer tank next to the CHP; (2) small storage vessels distributed over
the different connected buildings; and (3) the use of the thermal mass if the
buildings as storage capacity. Besides the development of the control
algorithms based on model predictive control, a simulation model of the network
is described to evaluate the performance of the different storage concept
during a representative winter week. The results show that the presented
control algorithm can significantly influence the heat demand profile of the
connected buildings. As a results, active control of the CHP can drastically
increase the profit of the CHP. The concept with the distributed buffers gives
the best results, however the profit for the thermal mass concept is only
marginally smaller. Since in this latter case no significant investment costs
are needed, the conclusion for this case study is that the use of thermal mass
of buildings for demand side management in district heating systems is very
promising.
","[{'version': 'v1', 'created': 'Mon, 6 Feb 2017 10:55:24 GMT'}]",2017-02-21,"[['Vanhoudt', 'Dirk', ''], ['Claessens', 'Bert', ''], ['Salenbien', 'Robbe', ''], ['Desmedt', 'Johan', '']]","['district heating', 'demand side management', 'demand response', 'thermal energy storage', 'CHP', 'operationalmanagement']"
18319,1401.6121,Chandra Sekhar Mr,"Vorugunti Chandra Sekhar, Mrudula Sarvabhatla",A Robust Password-Based Multi-Server Authentication Scheme,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In 2013, Tsai et al. cryptanalyzed Yeh et al. scheme and shown that Yeh et
al., scheme is vulnerable to various cryptographic attacks and proposed an
improved scheme. In this poster we will show that Tsai et al., scheme is also
vulnerable to undetectable online password guessing attack, on success of the
attack, the adversary can perform all major cryptographic attacks. As apart of
our contribution, we have proposed an improved scheme which overcomes the
defects in Tsai et al. and Yeh et al. schemes.
","[{'version': 'v1', 'created': 'Sat, 7 Dec 2013 03:48:11 GMT'}]",2014-01-24,"[['Sekhar', 'Vorugunti Chandra', ''], ['Sarvabhatla', 'Mrudula', '']]","['Multi-Server', 'Authentication', 'Multi-Server Authentication']"
18320,1401.0034,Atta ur Rehman Khan,"Atta ur Rehman Khan, Mazliza Othman, Abdul Nasir Khan",A Novel Application Licensing Framework for Mobile Cloud Environment,,,,,cs.CY cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile cloud computing is a new technology that enhances smartphone
applications capabilities in terms of performance, energy efficiency, and
execution support. These features are achieved via computation offloading
technique that is supported by specialized mobile cloud application development
models. However, the cloud-enabled applications are prone to application piracy
issue for which the traditional licensing frameworks are of no use. Therefore,
a new licensing framework is required to control application piracy in mobile
cloud environment. This paper presents a preliminary design of a novel
application licensing framework for mobile cloud environment that restricts
execution of applications on unauthenticated smartphones and cloud resources.
","[{'version': 'v1', 'created': 'Mon, 30 Dec 2013 21:59:30 GMT'}]",2014-01-03,"[['Khan', 'Atta ur Rehman', ''], ['Othman', 'Mazliza', ''], ['Khan', 'Abdul Nasir', '']]","['application piracy', 'mobile cloud computing', 'mobile cloud applications piracy', 'mobile cloud application models', 'mobile cloud data privacy']"
18321,1702.01179,Helge Holzmann,"Helge Holzmann, Thomas Risse",Extraction of Evolution Descriptions from the Web,"Digital Libraries (JCDL) 2014, London, UK",,,,cs.CL cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The evolution of named entities affects exploration and retrieval tasks in
digital libraries. An information retrieval system that is aware of name
changes can actively support users in finding former occurrences of evolved
entities. However, current structured knowledge bases, such as DBpedia or
Freebase, do not provide enough information about evolutions, even though the
data is available on their resources, like Wikipedia. Our \emph{Evolution Base}
prototype will demonstrate how excerpts describing name evolutions can be
identified on these websites with a promising precision. The descriptions are
classified by means of models that we trained based on a recent analysis of
named entity evolutions on Wikipedia.
","[{'version': 'v1', 'created': 'Fri, 3 Feb 2017 21:48:18 GMT'}]",2017-02-07,"[['Holzmann', 'Helge', ''], ['Risse', 'Thomas', '']]","['Named Entity Evolution', 'Wikipedia', 'Semantics']"
18322,1701.03720,Azam Moosavi,"Azam Moosavi, Razvan Stefanescu, Adrian Sandu","Multivariate predictions of local reduced-order-model errors and
  dimensions","19 pages, 15 figures, 7 tables. arXiv admin note: substantial text
  overlap with arXiv:1511.02909",,,CSL-2017-1,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces multivariate input-output models to predict the errors
and bases dimensions of local parametric Proper Orthogonal Decomposition
reduced-order models. We refer to these multivariate mappings as the MP-LROM
models. We employ Gaussian Processes and Artificial Neural Networks to
construct approximations of these multivariate mappings. Numerical results with
a viscous Burgers model illustrate the performance and potential of the machine
learning based regression MP-LROM models to approximate the characteristics of
parametric local reduced-order models. The predicted reduced-order models
errors are compared against the multi-fidelity correction and reduced order
model error surrogates methods predictions, whereas the predicted reduced-order
dimensions are tested against the standard method based on the spectrum of
snapshots matrix. Since the MP-LROM models incorporate more features and
elements to construct the probabilistic mappings they achieve more accurate
results. However, for high-dimensional parametric spaces, the MP-LROM models
might suffer from the curse of dimensionality. Scalability challenges of
MP-LROM models and the feasible ways of addressing them are also discussed in
this study.
","[{'version': 'v1', 'created': 'Fri, 13 Jan 2017 16:49:25 GMT'}]",2017-01-16,"[['Moosavi', 'Azam', ''], ['Stefanescu', 'Razvan', ''], ['Sandu', 'Adrian', '']]","['Local reduced-order models', 'Proper Orthogonal Decomposition', 'regression machine learning techniques']"
18323,1705.08963,Bita Darvish Rouhani,"Bita Darvish Rouhani, M. Sadegh Riazi, Farinaz Koushanfar",DeepSecure: Scalable Provably-Secure Deep Learning,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes DeepSecure, a novel framework that enables scalable
execution of the state-of-the-art Deep Learning (DL) models in a
privacy-preserving setting. DeepSecure targets scenarios in which neither of
the involved parties including the cloud servers that hold the DL model
parameters or the delegating clients who own the data is willing to reveal
their information. Our framework is the first to empower accurate and scalable
DL analysis of data generated by distributed clients without sacrificing the
security to maintain efficiency. The secure DL computation in DeepSecure is
performed using Yao's Garbled Circuit (GC) protocol. We devise GC-optimized
realization of various components used in DL. Our optimized implementation
achieves more than 58-fold higher throughput per sample compared with the
best-known prior solution. In addition to our optimized GC realization, we
introduce a set of novel low-overhead pre-processing techniques which further
reduce the GC overall runtime in the context of deep learning. Extensive
evaluations of various DL applications demonstrate up to two
orders-of-magnitude additional runtime improvement achieved as a result of our
pre-processing methodology. This paper also provides mechanisms to securely
delegate GC computations to a third party in constrained embedded settings.
","[{'version': 'v1', 'created': 'Wed, 24 May 2017 20:44:38 GMT'}]",2017-05-26,"[['Rouhani', 'Bita Darvish', ''], ['Riazi', 'M. Sadegh', ''], ['Koushanfar', 'Farinaz', '']]","['Deep Learning', 'Secure Function Evaluation', 'Garbled Circuit', 'Content-Aware Data Pre-processing']"
18324,1610.07901,Luca Crociani,"Luca Crociani, Daichi Yanagisawa, Giuseppe Vizzari, Katsuhiro
  Nishinari, Stefania Bandini","Avoid or Follow? Modelling Route Choice Based on Experimental Empirical
  Evidences","Pre-print of the paper presented at the 8th International Conference
  on Pedestrian and Evacuation Dynamics (PED2016), Hefei, China - Oct 17 -- 21,
  2016",,,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer-based simulation of pedestrian dynamics reached meaningful results
in the last decade, thanks to empirical evidences and acquired knowledge
fitting fundamental diagram constraints and space utilization. Moreover,
computational models for pedestrian wayfinding often neglect extensive
empirical evidences supporting the calibration and validation phase of
simulations. The paper presents the results of a set of controlled experiments
(with human volunteers) designed and performed to understand pedestrian's route
choice. The setting offers alternative paths to final destinations, at
different crowding conditions. Results show that the length of paths and level
of congestion influence decisions (negative feedback), as well as imitative
behaviour of ""emergent leaders"" choosing a new path (positive feedback). A
novel here illustrated model for the simulation of pedestrian route choice
captures such evidences, encompassing both the tendency to avoid congestion and
to follow emerging leaders. The found conflicting tendencies are modelled with
the introduction of a utility function allowing a consistent calibration over
the achieved results. A demonstration of the simulated dynamics on a larger
scenario will be also illustrated in the paper.
","[{'version': 'v1', 'created': 'Tue, 25 Oct 2016 14:45:24 GMT'}]",2016-10-26,"[['Crociani', 'Luca', ''], ['Yanagisawa', 'Daichi', ''], ['Vizzari', 'Giuseppe', ''], ['Nishinari', 'Katsuhiro', ''], ['Bandini', 'Stefania', '']]","['Pedestrian Dynamics', 'Route Choice', 'Experiment', 'Simulation', 'Validation']"
18325,1011.0636,Kouider Mekkia,Kouider Mekkia,Stability number and f-factors in graphs,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new sufficient condition on stability number and toughness of
the graph to have an f-factor.
","[{'version': 'v1', 'created': 'Tue, 2 Nov 2010 15:15:04 GMT'}]",2010-11-03,"[['Mekkia', 'Kouider', '']]","['Factor', 'stability number', 'connectivity', 'toughness', 'minimumdegree']"
18326,1611.00096,Ambuj Varshney,"Ambuj Varshney, Oliver Harms, Carlos Perez Penichet, Christian Rohner,
  Frederik Hermans, Thiemo Voigt","LoRea: A Backscatter Architecture that Achieves a Long Communication
  Range","Accepted and presented at ACM SenSys 2017, Delft, Netherlands",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is the long-standing assumption that radio communication in the range
of hundreds of meters needs to consume mWs of power at the transmitting device.
In this paper, we demonstrate that this is not necessarily the case for some
devices equipped with backscatter radios. We present LoRea an architecture
consisting of a tag, a reader and multiple carrier generators that overcomes
the power, cost and range limitations of existing systems such as Computational
Radio Frequency Identification~(CRFID). LoRea achieves this by: First,
generating narrow-band backscatter transmissions that improve receiver
sensitivity. Second, mitigating self-interference without the complex designs
employed on RFID readers by keeping carrier signal and backscattered signal
apart in frequency. Finally, decoupling carrier generation from the reader and
using devices such as WiFi routers and sensor nodes as a source of the carrier
signal. An off-the-shelf implementation of LoRea costs 70 USD, a drastic
reduction in price considering commercial RFID readers cost 2000 USD. LoRea's
range scales with the carrier strength, and proximity to the carrier source and
achieves a maximum range of 3.4 kilometre when the tag is located at 1 meter
distance from a 28 dBm carrier source while consuming 70 microwatts at the tag.
When the tag is equidistant from the carrier source and the receiver, we can
communicate upto 75 meter, a significant improvement over existing RFID
readers.
","[{'version': 'v1', 'created': 'Tue, 1 Nov 2016 01:10:39 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Nov 2017 22:05:28 GMT'}]",2017-11-20,"[['Varshney', 'Ambuj', ''], ['Harms', 'Oliver', ''], ['Penichet', 'Carlos Perez', ''], ['Rohner', 'Christian', ''], ['Hermans', 'Frederik', ''], ['Voigt', 'Thiemo', '']]","['Battery-free', 'Backscatter', 'CRFIDs', 'WISP', 'Moo', 'Ultra-low power']"
18327,0905.4863,Florentina Pintea,"K. S. Jasmine, R. Vasantha","Derivation of UML Based Performance Models for Design Assessment in a
  Reuse Based Software Development Approach","18 pages, exposed on 5th International Conference ""Actualities and
  Perspectives on Hardware and Software"" - APHS2009, Timisoara, Romania","Ann. Univ. Tibiscus Comp. Sci. Series VII(2009),163-180",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reuse-based software development provides an opportunity for better quality
and increased productivity in the software products. One of the most critical
aspects of the quality of a software system is its performance. The systematic
application of software performance engineering techniques throughout the
development process can help to identify design alternatives that preserve
desirable qualities such as extensibility and reusability while meeting
performance objectives. In the present scenario, most of the performance
failures are due to a lack of consideration of performance issues early in the
development process, especially in the design phase. These performance failures
results in damaged customer relations, lost productivity for users, cost
overruns due to tuning or redesign, and missed market windows. In this paper,
we propose UML based Performance Models for design assessment in a reuse based
software development scenario.
","[{'version': 'v1', 'created': 'Fri, 29 May 2009 13:42:19 GMT'}]",2009-06-01,"[['Jasmine', 'K. S.', ''], ['Vasantha', 'R.', '']]","['Software Reuse', 'Reuse-based development', 'Unified Modeling Language', 'Software performance', 'Performance failures', 'Performance engineering', 'Performance Models']"
18328,1407.8339,Wei Chen,"Wei Chen, Yajun Wang, Yang Yuan, Qinshi Wang","Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically
  Triggered Arms",A preliminary version of the paper is published in ICML'2013,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We define a general framework for a large class of combinatorial multi-armed
bandit (CMAB) problems, where subsets of base arms with unknown distributions
form super arms. In each round, a super arm is played and the base arms
contained in the super arm are played and their outcomes are observed. We
further consider the extension in which more based arms could be
probabilistically triggered based on the outcomes of already triggered arms.
The reward of the super arm depends on the outcomes of all played arms, and it
only needs to satisfy two mild assumptions, which allow a large class of
nonlinear reward instances. We assume the availability of an offline
(\alpha,\beta)-approximation oracle that takes the means of the outcome
distributions of arms and outputs a super arm that with probability {\beta}
generates an {\alpha} fraction of the optimal expected reward. The objective of
an online learning algorithm for CMAB is to minimize
(\alpha,\beta)-approximation regret, which is the difference between the
\alpha{\beta} fraction of the expected reward when always playing the optimal
super arm, and the expected reward of playing super arms according to the
algorithm. We provide CUCB algorithm that achieves O(log n)
distribution-dependent regret, where n is the number of rounds played, and we
further provide distribution-independent bounds for a large class of reward
functions. Our regret analysis is tight in that it matches the bound of UCB1
algorithm (up to a constant factor) for the classical MAB problem, and it
significantly improves the regret bound in a earlier paper on combinatorial
bandits with linear rewards. We apply our CMAB framework to two new
applications, probabilistic maximum coverage and social influence maximization,
both having nonlinear reward structures. In particular, application to social
influence maximization requires our extension on probabilistically triggered
arms.
","[{'version': 'v1', 'created': 'Thu, 31 Jul 2014 10:09:11 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Sep 2014 01:33:08 GMT'}, {'version': 'v3', 'created': 'Tue, 3 Mar 2015 06:26:10 GMT'}, {'version': 'v4', 'created': 'Sun, 15 Nov 2015 06:02:45 GMT'}, {'version': 'v5', 'created': 'Mon, 28 Mar 2016 05:02:24 GMT'}, {'version': 'v6', 'created': 'Tue, 29 Mar 2016 01:00:59 GMT'}]",2016-03-30,"[['Chen', 'Wei', ''], ['Wang', 'Yajun', ''], ['Yuan', 'Yang', ''], ['Wang', 'Qinshi', '']]","['combinatorial multi-armed bandit', 'online learning', 'upper confidence bound', 'social influencemaximization', 'online advertising']"
18329,1603.01407,Karim Djemame,"Karim Djemame and Django Armstrong and Richard Kavanagh and
  Jean-Christophe Deprez and Ana Juan Ferrer and David Garcia Perez and Rosa
  Badia and Raul Sirvent and Jorge Ejarque and Yiannis Georgiou","TANGO: Transparent heterogeneous hardware Architecture deployment for
  eNergy Gain in Operation","Part of the Program Transformation for Programmability in
  Heterogeneous Architectures (PROHA) workshop, Barcelona, Spain, 12th March
  2016, 7 pages, LaTeX, 3 PNG figures",,,,cs.SE cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper is concerned with the issue of how software systems actually use
Heterogeneous Parallel Architectures (HPAs), with the goal of optimizing power
consumption on these resources. It argues the need for novel methods and tools
to support software developers aiming to optimise power consumption resulting
from designing, developing, deploying and running software on HPAs, while
maintaining other quality aspects of software to adequate and agreed levels. To
do so, a reference architecture to support energy efficiency at application
construction, deployment, and operation is discussed, as well as its
implementation and evaluation plans.
","[{'version': 'v1', 'created': 'Fri, 4 Mar 2016 10:13:56 GMT'}]",2016-03-07,"[['Djemame', 'Karim', ''], ['Armstrong', 'Django', ''], ['Kavanagh', 'Richard', ''], ['Deprez', 'Jean-Christophe', ''], ['Ferrer', 'Ana Juan', ''], ['Perez', 'David Garcia', ''], ['Badia', 'Rosa', ''], ['Sirvent', 'Raul', ''], ['Ejarque', 'Jorge', ''], ['Georgiou', 'Yiannis', '']]","['Heterogeneous parallel architectures', 'low power computing', 'energy efficiency', 'programming model', 'self-adaptation']"
18330,1009.5557,Ali Reza Manashty,"Amir Rajabzadeh, Ali Reza Manashty and Zahra Forootan Jahromi",A Mobile Application for Smart House Remote Control System,"7 pages, 8 figures, Keywords-Smart House, Mobile Application, Remote
  Control, Automated Home, Windows Mobile","International Conference on Wireless Communication and Mobile
  Computing (ICWCMC 2010), Proceedings of WASET, vol. 62, ISSN. 2070-3724, pp.
  80-86, February 2010",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  At the start of the second decade of 21th century, the time has come to make
the Smart Houses a reality for regular use. The different parts of a Smart
House are researched but there are still distances from an applicable system,
using the modern technology. In this paper we present an overview of the Smart
House subsystems necessary for controlling the house using a mobile application
efficiently and securely. The sequence diagram of the mobile application
connecting to the server application and also the use-cases possible are
presented. The challenges faced in designing the mobile application and
illustrating the updated house top plane view in that application, are
discussed and solutions are adapted for it. Finally the designed mobile
application was implemented and the important sections of it were described,
such as the interactive house top view map which indicates the status of the
devices using predefined icons. The facilities to manage the scheduled tasks
and defined rules are also implemented in this mobile application that was
developed for use in Windows Mobile platform. This application has the
capability of connecting to the main server using GPRS mobile internet and SMS.
This system is expected to be an important step towards a unified system
structure that can be used efficiently in near future regular houses.
","[{'version': 'v1', 'created': 'Mon, 27 Sep 2010 18:13:37 GMT'}]",2010-09-29,"[['Rajabzadeh', 'Amir', ''], ['Manashty', 'Ali Reza', ''], ['Jahromi', 'Zahra Forootan', '']]","['Smart House', 'Mobile Application', 'Remote Control', 'Automated Home', 'Windows Mobile']"
18331,1407.6603,Zaid Alyasseri,"Zaid Abdi Alkareem Alyasseri, Kadhim Al-Attar, Mazin Nasser (ISMAIL)",Parallelize Bubble Sort Algorithm Using OpenMP,"4 pages, 5 firgyes",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sorting has been a profound area for the algorithmic researchers and many
resources are invested to suggest more works for sorting algorithms. For this
purpose, many existing sorting algorithms were observed in terms of the
efficiency of the algorithmic complexity. In this paper we implemented the
bubble sort algorithm using multithreading (OpenMP). The proposed work tested
on two standard datasets (text file) with different size . The main idea of the
proposed algorithm is distributing the elements of the input datasets into many
additional temporary sub-arrays according to a number of characters in each
word. The sizes of each of these sub-arrays are decided depending on a number
of elements with the same number of characters in the input array. We
implemented OpenMP using Intel core i7-3610QM ,(8 CPUs),using two approaches
(vectors of string and array 3D) . Finally, we get the data structure effects
on the performance of the algorithm for that we choice the second approach.
","[{'version': 'v1', 'created': 'Thu, 24 Jul 2014 14:47:48 GMT'}]",2014-07-25,"[['Alyasseri', 'Zaid Abdi Alkareem', '', 'ISMAIL'], ['Al-Attar', 'Kadhim', '', 'ISMAIL'], ['Nasser', 'Mazin', '', 'ISMAIL']]","['Bubble sort', 'OpemMP', 'sorting algorithms', 'parallel   computing', 'Parallelize Bubble algorithm']"
18332,1010.2000,Julien Langou,Henricus Bouwmeester and Julien Langou,"A Critical Path Approach to Analyzing Parallelism of Algorithmic
  Variants. Application to Cholesky Inversion",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Algorithms come with multiple variants which are obtained by changing the
mathematical approach from which the algorithm is derived. These variants offer
a wide spectrum of performance when implemented on a multicore platform and we
seek to understand these differences in performances from a theoretical point
of view. To that aim, we derive and present the critical path lengths of each
algorithmic variant for our application problem which enables us to determine a
lower bound on the time to solution. This metric provides an intuitive grasp of
the performance of a variant and we present numerical experiments to validate
the tightness of our lower bounds on practical applications. Our case study is
the Cholesky inversion and its use in computing the inverse of a symmetric
positive definite matrix.
","[{'version': 'v1', 'created': 'Mon, 11 Oct 2010 05:34:40 GMT'}]",2010-10-12,"[['Bouwmeester', 'Henricus', ''], ['Langou', 'Julien', '']]","['critical path', 'dense linear algebra', 'Cholesky inversion', 'tilealgorithms', 'scheduling']"
18333,1609.02320,Dohan Kim,Dohan Kim,"Distributed agent-based automated theorem proving in order-sorted
  first-order logic",14 pages,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a distributed agent-based automated theorem proving
framework based on order-sorted first-order logic. Each agent in our framework
has its own knowledge base, communicating to its neighboring agent(s) using
message-passing algorithms. The communication language between agents is
restricted in such a manner that each agent can only communicate to its
neighboring agent(s) by means of their common language. In this paper we
provide a refutation-complete report procedure for automated theorem proving in
order-sorted first-order logic in a subclass of distributed agent-based
networks. Rather than studying and evaluating the performance improvement of
the automated theorem proving in order-sorted first-order logic using parallel
or distributed agents, this paper focuses on building proofs in order-sorted
first-order logic in a distributed manner under the restriction that agents may
report their knowledge or observations only with their predefined language.
","[{'version': 'v1', 'created': 'Thu, 8 Sep 2016 08:29:30 GMT'}]",2016-09-09,"[['Kim', 'Dohan', '']]","['Order-sorted first-order logic', 'Distributed automated theorem proving', 'Distributed ordersorted resolution', 'Distributed agents']"
18334,1603.06560,Lisha Li,"Lisha Li, Kevin Jamieson, Giulia DeSalvo, Afshin Rostamizadeh, Ameet
  Talwalkar",Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimization,Changes: - Updated to JMLR version,Journal of Machine Learning Research 18 (2018) 1-52,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Performance of machine learning algorithms depends critically on identifying
a good set of hyperparameters. While recent approaches use Bayesian
optimization to adaptively select configurations, we focus on speeding up
random search through adaptive resource allocation and early-stopping. We
formulate hyperparameter optimization as a pure-exploration non-stochastic
infinite-armed bandit problem where a predefined resource like iterations, data
samples, or features is allocated to randomly sampled configurations. We
introduce a novel algorithm, Hyperband, for this framework and analyze its
theoretical properties, providing several desirable guarantees. Furthermore, we
compare Hyperband with popular Bayesian optimization methods on a suite of
hyperparameter optimization problems. We observe that Hyperband can provide
over an order-of-magnitude speedup over our competitor set on a variety of
deep-learning and kernel-based learning problems.
","[{'version': 'v1', 'created': 'Mon, 21 Mar 2016 19:51:04 GMT'}, {'version': 'v2', 'created': 'Mon, 31 Oct 2016 19:04:57 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Nov 2016 19:39:54 GMT'}, {'version': 'v4', 'created': 'Mon, 18 Jun 2018 23:01:43 GMT'}]",2018-06-20,"[['Li', 'Lisha', ''], ['Jamieson', 'Kevin', ''], ['DeSalvo', 'Giulia', ''], ['Rostamizadeh', 'Afshin', ''], ['Talwalkar', 'Ameet', '']]","['hyperparameter optimization', 'model selection', 'infinite-armed bandits', 'onlineoptimization', 'deep learning']"
18335,1003.1492,Rdv Ijcsis,"Harshvardhan Tiwari, Dr. Krishna Asawa",A Secure Hash Function MD-192 With Modified Message Expansion,"Pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS, Vol. 7 No. 2, February 2010, USA. ISSN 1947
  5500, http://sites.google.com/site/ijcsis/",,,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Cryptographic hash functions play a central role in cryptography. Hash
functions were introduced in cryptology to provide message integrity and
authentication. MD5, SHA1 and RIPEMD are among the most commonly used message
digest algorithm. Recently proposed attacks on well known and widely used hash
functions motivate a design of new stronger hash function. In this paper a new
approach is presented that produces 192 bit message digest and uses a modified
message expansion mechanism which generates more bit difference in each working
variable to make the algorithm more secure. This hash function is collision
resistant and assures a good compression and preimage resistance.
","[{'version': 'v1', 'created': 'Sun, 7 Mar 2010 17:03:10 GMT'}]",2010-03-09,"[['Tiwari', 'Harshvardhan', ''], ['Asawa', 'Dr. Krishna', '']]","['Cryptology', 'Hashfunction', 'MD5', 'SHA1', 'RIPEMD', 'Message Integrity and Authentication', 'Message expansion']"
18336,1401.6098,Guohua Wu,"Guohua Wu, Huilin Wang, Haifeng Li, Witold Pedrycz, Dishan Qiu, Manhao
  Ma, Jin Liu","An adaptive Simulated Annealing-based satellite observation scheduling
  method combined with a dynamic task clustering strategy","23 pages, 5 figures, 4 tables",,,,cs.AI cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efficient scheduling is of great significance to rationally make use of
scarce satellite resources. Task clustering has been demonstrated to realize an
effective strategy to improve the efficiency of satellite scheduling. However,
the previous task clustering strategy is static. That is, it is integrated into
the scheduling in a two-phase manner rather than in a dynamic fashion, without
expressing its full potential in improving the satellite scheduling
performance. In this study, we present an adaptive Simulated Annealing based
scheduling algorithm aggregated with a dynamic task clustering strategy (or
ASA-DTC for short) for satellite observation scheduling problems (SOSPs).
First, we develop a formal model for the scheduling of Earth observing
satellites. Second, we analyze the related constraints involved in the
observation task clustering process. Thirdly, we detail an implementation of
the dynamic task clustering strategy and the adaptive Simulated Annealing
algorithm. The adaptive Simulated Annealing algorithm is efficient, with the
endowment of some sophisticated mechanisms, i.e. adaptive temperature control,
tabu-list based revisiting avoidance mechanism, and intelligent combination of
neighborhood structures. Finally, we report on experimental simulation studies
to demonstrate the competitive performance of ASA-DTC. Moreover, we show that
ASA-DTC is especially effective when SOSPs contain a large number of targets or
these targets are densely distributed in a certain area.
","[{'version': 'v1', 'created': 'Tue, 14 Jan 2014 22:46:27 GMT'}]",2014-01-24,"[['Wu', 'Guohua', ''], ['Wang', 'Huilin', ''], ['Li', 'Haifeng', ''], ['Pedrycz', 'Witold', ''], ['Qiu', 'Dishan', ''], ['Ma', 'Manhao', ''], ['Liu', 'Jin', '']]","['Scheduling', 'adaptive Simulated Annealing', 'Earth observing satellite', 'dynamic task clustering']"
18337,1401.2058,Rachit Puri,Rachit Puri,Gesture recognition based mouse events,"9 pages, IJCSIT",,,,cs.CV,http://creativecommons.org/licenses/by/3.0/,"  This paper presents the maneuver of mouse pointer and performs various mouse
operations such as left click, right click, double click, drag etc using
gestures recognition technique. Recognizing gestures is a complex task which
involves many aspects such as motion modeling, motion analysis, pattern
recognition and machine learning. Keeping all the essential factors in mind a
system has been created which recognizes the movement of fingers and various
patterns formed by them. Color caps have been used for fingers to distinguish
it from the background color such as skin color. Thus recognizing the gestures
various mouse events have been performed. The application has been created on
MATLAB environment with operating system as windows 7.
","[{'version': 'v1', 'created': 'Thu, 9 Jan 2014 16:26:54 GMT'}]",2014-01-10,"[['Puri', 'Rachit', '']]","['YCbCr color model', 'user interface', 'gesture recognition', 'image processing']"
18338,1402.4101,Val\'erio Ramos Batista,Marcelo Zanchetta do Nascimento and Val\'erio Ramos Batista,"First steps to Virtual Mammography: Simulating external compressions of
  the breast with the Surface Evolver",,,,,cs.CE physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we introduce a computational modelling that reproduces the
breast compression processes used to obtain the mammogram. The main result is a
programme in which one can track the first steps of virtual mammography. On the
one hand, our modelling enables addition of structures that represent different
tissues, muscles and glands in the breast. On the other hand, we shall validate
and implement it by means of laboratory tests with phantoms. To the best of our
knowledge, these two characteristics do confer originality to our research.
This is because their interrelation seems not to be properly established
elsewhere yet. We conclude that our model reproduces the same shapes and
measurements really taken from the volunteer's breasts.
","[{'version': 'v1', 'created': 'Mon, 17 Feb 2014 19:56:22 GMT'}]",2014-02-18,"[['Nascimento', 'Marcelo Zanchetta do', ''], ['Batista', 'Valério Ramos', '']]","['Tumour location', 'Breast compression', 'Surface Evolver']"
18339,1602.07393,Zhenhao Ge,Zhenhao Ge and Yufang Sun,"Domain Specific Author Attribution Based on Feedforward Neural Network
  Language Models","International Conference on Pattern Recognition Application and
  Methods (ICPRAM) 2016",,,,cs.CL cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Authorship attribution refers to the task of automatically determining the
author based on a given sample of text. It is a problem with a long history and
has a wide range of application. Building author profiles using language models
is one of the most successful methods to automate this task. New language
modeling methods based on neural networks alleviate the curse of dimensionality
and usually outperform conventional N-gram methods. However, there have not
been much research applying them to authorship attribution. In this paper, we
present a novel setup of a Neural Network Language Model (NNLM) and apply it to
a database of text samples from different authors. We investigate how the NNLM
performs on a task with moderate author set size and relatively limited
training and test data, and how the topics of the text samples affect the
accuracy. NNLM achieves nearly 2.5% reduction in perplexity, a measurement of
fitness of a trained language model to the test data. Given 5 random test
sentences, it also increases the author classification accuracy by 3.43% on
average, compared with the N-gram methods using SRILM tools. An open source
implementation of our methodology is freely available at
https://github.com/zge/authorship-attribution/.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2016 04:32:34 GMT'}]",2016-02-25,"[['Ge', 'Zhenhao', ''], ['Sun', 'Yufang', '']]","['Authorship Attribution', 'Neural Networks', 'Language Modeling']"
18340,1207.6185,Yusnani Mohd Yussoff Mrs,"Yusnani Mohd Yussoff, Habibah Hashim and Mohd Dani Baba",Identity-based Trusted Authentication in Wireless Sensor Network,"10 pages, 5 figures, 4 tables; IJCSI International Journal of
  Computer Science Issues, Vol. 9, Issue 3, No 2, May 2012 ISSN (Online):
  1694-0814",,,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Secure communication mechanisms in Wireless Sensor Networks (WSNs) have been
widely deployed to ensure confidentiality, authenticity and integrity of the
nodes and data. Recently many WSNs applications rely on trusted communication
to ensure large user acceptance. Indeed, the trusted relationship thus far can
only be achieved through Trust Management System (TMS) or by adding external
security chip on the WSN platform. In this study an alternative mechanism is
proposed to accomplish trusted communication between sensors based on the
principles defined by Trusted Computing Group (TCG). The results of other
related study have also been analyzed to validate and support our findings.
Finally the proposed trusted mechanism is evaluated for the potential
application on resource constraint devices by quantifying their power
consumption on selected major processes. The result proved the proposed scheme
can establish trust in WSN with less computation and communication and most
importantly eliminating the need for neighboring evaluation for TMS or relying
on external security chip.
","[{'version': 'v1', 'created': 'Thu, 26 Jul 2012 07:26:10 GMT'}]",2012-07-27,"[['Yussoff', 'Yusnani Mohd', ''], ['Hashim', 'Habibah', ''], ['Baba', 'Mohd Dani', '']]","['Trusted', 'Security', 'Authentication', 'Wireless Sensor Network', 'Identity-based cryptography']"
18341,1511.04134,Jisun An,Jisun An and Ingmar Weber,"Whom Should We Sense in ""Social Sensing"" -- Analyzing Which Users Work
  Best for Social Media Now-Casting",This is a pre-print of a forthcoming EPJ Data Science paper,,,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given the ever increasing amount of publicly available social media data,
there is growing interest in using online data to study and quantify phenomena
in the offline ""real"" world. As social media data can be obtained in near
real-time and at low cost, it is often used for ""now-casting"" indices such as
levels of flu activity or unemployment. The term ""social sensing"" is often used
in this context to describe the idea that users act as ""sensors"", publicly
reporting their health status or job losses. Sensor activity during a time
period is then typically aggregated in a ""one tweet, one vote"" fashion by
simply counting. At the same time, researchers readily admit that social media
users are not a perfect representation of the actual population. Additionally,
users differ in the amount of details of their personal lives that they reveal.
Intuitively, it should be possible to improve now-casting by assigning
different weights to different user groups.
  In this paper, we ask ""How does social sensing actually work?"" or, more
precisely, ""Whom should we sense--and whom not--for optimal results?"". We
investigate how different sampling strategies affect the performance of
now-casting of two common offline indices: flu activity and unemployment rate.
We show that now-casting can be improved by 1) applying user filtering
techniques and 2) selecting users with complete profiles. We also find that,
using the right type of user groups, now-casting performance does not degrade,
even when drastically reducing the size of the dataset. More fundamentally, we
describe which type of users contribute most to the accuracy by asking if
""babblers are better"". We conclude the paper by providing guidance on how to
select better user groups for more accurate now-casting.
","[{'version': 'v1', 'created': 'Fri, 13 Nov 2015 01:13:48 GMT'}]",2015-11-16,"[['An', 'Jisun', ''], ['Weber', 'Ingmar', '']]","['nowcasting', 'sampling', 'social media', 'Twitter', 'prediction', 'unemployment rate', 'flu']"
18342,1603.02836,Anirban Santara,"Anirban Santara, Debapriya Maji, DP Tejas, Pabitra Mitra and Arobinda
  Gupta","Faster learning of deep stacked autoencoders on multi-core systems using
  synchronized layer-wise pre-training",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep neural networks are capable of modelling highly non-linear functions by
capturing different levels of abstraction of data hierarchically. While
training deep networks, first the system is initialized near a good optimum by
greedy layer-wise unsupervised pre-training. However, with burgeoning data and
increasing dimensions of the architecture, the time complexity of this approach
becomes enormous. Also, greedy pre-training of the layers often turns
detrimental by over-training a layer causing it to lose harmony with the rest
of the network. In this paper a synchronized parallel algorithm for
pre-training deep networks on multi-core machines has been proposed. Different
layers are trained by parallel threads running on different cores with regular
synchronization. Thus the pre-training process becomes faster and chances of
over-training are reduced. This is experimentally validated using a stacked
autoencoder for dimensionality reduction of MNIST handwritten digit database.
The proposed algorithm achieved 26\% speed-up compared to greedy layer-wise
pre-training for achieving the same reconstruction accuracy substantiating its
potential as an alternative.
","[{'version': 'v1', 'created': 'Wed, 9 Mar 2016 10:31:00 GMT'}]",2016-03-10,"[['Santara', 'Anirban', ''], ['Maji', 'Debapriya', ''], ['Tejas', 'DP', ''], ['Mitra', 'Pabitra', ''], ['Gupta', 'Arobinda', '']]","['Deep learning', 'stacked autoencoder', 'RBM', 'backpropagation', 'contrastive divergence', 'MNIST']"
18343,1604.07030,Clemens Grabmayer,Clemens Grabmayer,"Linear Depth Increase of Lambda Terms along Leftmost-Outermost
  Beta-Reduction",,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Performing $n$ steps of $\beta$-reduction to a given term in the
$\lambda$-calculus can lead to an increase in the size of the resulting term
that is exponential in $n$. The same is true for the possible depth increase of
terms along a $\beta$-reduction sequence. We explain that the situation is
different for the leftmost-outermost strategy for $\beta$-reduction: while
exponential size increase is still possible, depth increase is bounded linearly
in the number of steps. For every $\lambda$-term $M$ with depth $d$, in every
step of a leftmost-outermost $\beta$-reduction rewrite sequence starting from
$M$ the term depth increases by at most $d$. Hence the depth of the $n$-th
reduct of $M$ in such a rewrite sequence is bounded by $d\cdot (n+1)$.
  We prove the lifting of this result to $\lambda$-term representations as
orthogonal first-order term rewriting systems, which can be obtained by the
lambda-lifting transformation. For the transfer to lambda-calculus, we rely on
correspondence statements via lambda-lifting. We argue that the
linear-depth-increase property can be a stepping stone for an alternative proof
of, and so can shed new light on, a result by Accattoli and Dal Lago (2015)
that states: leftmost-outermost $\beta$-reduction rewrite sequences of length
$n$ in the lambda-calculus can be implemented on a reasonable machine with an
overhead that is polynomial in $n$ and the size of the initial term.
","[{'version': 'v1', 'created': 'Sun, 24 Apr 2016 13:45:54 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Nov 2019 08:58:39 GMT'}]",2019-11-19,"[['Grabmayer', 'Clemens', '']]","['lambda calculus', 'beta reduction', 'leftmost-outermost strategy', 'complexity']"
18344,1609.04809,Sashikumaar Ganesan,"Sashikumaar Ganesan, Volker John, Gunar Matthies, Raviteja Meesala,
  Shamim Abdus, Ulrich Wilbrandt","An object oriented parallel finite element scheme for computations of
  PDEs: Design and implementation","10 pages, 9 figures, 1 table",,,,cs.MS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parallel finite element algorithms based on object-oriented concepts are
presented. Moreover, the design and implementation of a data structure proposed
are utilized in realizing a parallel geometric multigrid method. The
ParFEMapper and the ParFECommunicator are the key components of the data
structure in the proposed parallel scheme. These classes are constructed based
on the type of finite elements (continuous or nonconforming or discontinuous)
used. The proposed solver is compared with the open source direct solvers,
MUMPS and PasTiX. Further, the performance of the parallel multigrid solver is
analyzed up to 1080 processors. The solver shows a very good speedup up to 960
processors and the problem size has to be increased in order to maintain the
good speedup when the number of processors are increased further. As a result,
the parallel solver is able to handle large scale problems on massively
parallel supercomputers. The proposed parallel finite element algorithms and
multigrid solver are implemented in our in-house package ParMooN.
","[{'version': 'v1', 'created': 'Thu, 15 Sep 2016 05:05:29 GMT'}]",2016-09-19,"[['Ganesan', 'Sashikumaar', ''], ['John', 'Volker', ''], ['Matthies', 'Gunar', ''], ['Meesala', 'Raviteja', ''], ['Abdus', 'Shamim', ''], ['Wilbrandt', 'Ulrich', '']]","['Finite elements', 'Geometric multigrid methods', 'Iterative Methods', 'Parallel computations']"
18345,1402.2641,Mart\'in Dar\'io Safe,Luciano N. Grippo and Mart\'in D. Safe,"On circular-arc graphs having a model with no three arcs covering the
  circle","15 pages, 3 figures. This paper originally appeared in proceedings of
  the XVI Congreso Latino-Iberoamericano de Investigaci\'on Operativa and the
  XLIV Simp\'osio Brasileiro de Pesquisa Operacional, September 24-28, 2012,
  Rio de Janeiro, Brazil. Anais do XLIV Simposio Brasileiro de Pesquisa
  Operacional, SOBRAPO, Rio de Janeiro, Brazil, 2012, pages 4093--4104.
  http://www.din.uem.br/sbpo/sbpo2012/pdf/arq0518.pdf",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An interval graph is the intersection graph of a finite set of intervals on a
line and a circular-arc graph is the intersection graph of a finite set of arcs
on a circle. While a forbidden induced subgraph characterization of interval
graphs was found fifty years ago, finding an analogous characterization for
circular-arc graphs is a long-standing open problem. In this work, we study the
intersection graphs of finite sets of arcs on a circle no three of which cover
the circle, known as normal Helly circular-arc graphs. Those circular-arc
graphs which are minimal forbidden induced subgraphs for the class of normal
Helly circular-arc graphs were identified by Lin, Soulignac, and Szwarcfiter,
who also posed the problem of determining the remaining minimal forbidden
induced subgraphs. In this work, we solve their problem, obtaining the complete
list of minimal forbidden induced subgraphs for the class of normal Helly
circular-arc graphs.
","[{'version': 'v1', 'created': 'Tue, 11 Feb 2014 20:46:22 GMT'}]",2014-02-12,"[['Grippo', 'Luciano N.', ''], ['Safe', 'Martín D.', '']]","['Forbidden subgraphs', 'interval graphs', 'normal Helly circular-arc graphs']"
18346,1403.2090,Janusz Brzozowski,Janusz Brzozowski and Marek Szyku{\l}a,Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals,"15 pages, 7 figures",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We solve two open problems concerning syntactic complexity: We prove that the
cardinality of the syntactic semigroup of a left ideal or a suffix-closed
language with $n$ left quotients (that is, with state complexity $n$) is at
most $n^{n-1}+n-1$, and that of a two-sided ideal or a factor-closed language
is at most $n^{n-2}+(n-2)2^{n-2}+1$. Since these bounds are known to be
reachable, this settles the problems.
","[{'version': 'v1', 'created': 'Sun, 9 Mar 2014 18:50:12 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Jul 2014 18:17:59 GMT'}]",2014-07-04,"[['Brzozowski', 'Janusz', ''], ['Szykuła', 'Marek', '']]","['factor-closed', 'left ideal', 'regular language', 'suffix-closed', 'syntactic complexity', 'transition semigroup', 'two-sided ideal', 'upper bound']"
18347,1205.0837,Sean Chester,"Sean Chester, Alex Thomo, S. Venkatesh, Sue Whitesides",Indexing Reverse Top-k Queries,,,,,cs.DB cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the recently introduced monochromatic reverse top-k queries which
ask for, given a new tuple q and a dataset D, all possible top-k queries on D
union {q} for which q is in the result. Towards this problem, we focus on
designing indexes in two dimensions for repeated (or batch) querying, a novel
but practical consideration. We present the insight that by representing the
dataset as an arrangement of lines, a critical k-polygon can be identified and
used exclusively to respond to reverse top-k queries. We construct an index
based on this observation which has guaranteed worst-case query cost that is
logarithmic in the size of the k-polygon.
  We implement our work and compare it to related approaches, demonstrating
that our index is fast in practice. Furthermore, we demonstrate through our
experiments that a k-polygon is comprised of a small proportion of the original
data, so our index structure consumes little disk space.
","[{'version': 'v1', 'created': 'Fri, 4 May 2012 00:03:18 GMT'}]",2012-05-07,"[['Chester', 'Sean', ''], ['Thomo', 'Alex', ''], ['Venkatesh', 'S.', ''], ['Whitesides', 'Sue', '']]","['Reverse top-k', 'top-k depth', 'arrangements of lines', 'accessmethods']"
18348,1501.04691,Sagi Eppel,Sagi Eppel,"Tracing the boundaries of materials in transparent vessels using
  computer vision","Code and documentation for the method described is freely available
  at:
  http://www.mathworks.com/matlabcentral/fileexchange/49076-find-the-boundaries-of-materials-in-transparent-vessels-using-computer-vision",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visual recognition of material boundaries in transparent vessels is valuable
for numerous applications. Such recognition is essential for estimation of
fill-level, volume and phase-boundaries as well as for tracking of such
chemical processes as precipitation, crystallization, condensation, evaporation
and phase-separation. The problem of material boundary recognition in images is
particularly complex for materials with non-flat surfaces, i.e., solids,
powders and viscous fluids, in which the material interfaces have unpredictable
shapes. This work demonstrates a general method for finding the boundaries of
materials inside transparent containers in images. The method uses an image of
the transparent vessel containing the material and the boundary of the vessel
in this image. The recognition is based on the assumption that the material
boundary appears in the image in the form of a curve (with various constraints)
whose endpoints are both positioned on the vessel contour. The probability that
a curve matches the material boundary in the image is evaluated using a cost
function based on some image properties along this curve. Several image
properties were examined as indicators for the material boundary. The optimal
boundary curve was found using Dijkstra's algorithm. The method was
successfully examined for recognition of various types of phase-boundaries,
including liquid-air, solid-air and solid-liquid interfaces, as well as for
various types of glassware containers from everyday life and the chemistry
laboratory (i.e., bottles, beakers, flasks, jars, columns, vials and
separation-funnels). In addition, the method can be easily extended to
materials carried on top of carrier vessels (i.e., plates, spoons, spatulas).
","[{'version': 'v1', 'created': 'Tue, 20 Jan 2015 01:19:33 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Jan 2015 17:12:32 GMT'}, {'version': 'v3', 'created': 'Sat, 31 Jan 2015 20:59:29 GMT'}]",2015-02-03,"[['Eppel', 'Sagi', '']]","['Fill-level', 'image-segmentation', 'interface-recognition', 'Phase-boundary', 'Lab']"
18349,1312.5764,Benhaoua Kamal,"Mohammed kamel Benhaoua, Abbou El Hassen Benyamina and Pierre Boulet","Heuristics for Routing and Spiral Run-time Task Mapping in NoC-based
  Heterogeneous MPSOCs",,"IJCSI International Journal of Computer Science Issues, Vol. 10,
  Issue 4, No 1, July 2013 ISSN (Print): 1694-0814 | ISSN (Online): 1694-0784",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a new Spiral Dynamic Task Mapping heuristic for mapping
applications onto NoC-based Heterogeneous MPSoC. The heuristic proposed in this
paper attempts to map the tasks of an applications that are most related to
each other in spiral manner and to find the best possible path load that
minimizes the communication overhead. In this context, we have realized a
simulation environment for experimental evaluations to map applications with
varying number of tasks onto an 8x8 NoC-based Heterogeneous MPSoCs platform, we
demonstrate that the new mapping heuristics with the new modified dijkstra
routing algorithm proposed are capable of reducing the total execution time and
energy consumption of applications when compared to state-of the-art run-time
mapping heuristics reported in the literature.
","[{'version': 'v1', 'created': 'Thu, 19 Dec 2013 21:55:30 GMT'}]",2013-12-23,"[['Benhaoua', 'Mohammed kamel', ''], ['Benyamina', 'Abbou El Hassen', ''], ['Boulet', 'Pierre', '']]","['MultiProcessor System on Chip (MPSoC)', 'Network on Chip (NoC)', 'Heterogeneous architectures', 'Dynamic mapping Heuristics', 'Routing Algorithm']"
18350,1501.02886,Hoang Dinh Thai DTH,"Dinh Thai Hoang, Xiao Lu, Dusit Niyato, Ping Wang, and Zhu Han",Applications of Repeated Games in Wireless Networks: A Survey,"32 pages, 15 figures, 5 tables, 168 references",,,,cs.GT cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A repeated game is an effective tool to model interactions and conflicts for
players aiming to achieve their objectives in a long-term basis. Contrary to
static noncooperative games that model an interaction among players in only one
period, in repeated games, interactions of players repeat for multiple periods;
and thus the players become aware of other players' past behaviors and their
future benefits, and will adapt their behavior accordingly. In wireless
networks, conflicts among wireless nodes can lead to selfish behaviors,
resulting in poor network performances and detrimental individual payoffs. In
this paper, we survey the applications of repeated games in different wireless
networks. The main goal is to demonstrate the use of repeated games to
encourage wireless nodes to cooperate, thereby improving network performances
and avoiding network disruption due to selfish behaviors. Furthermore, various
problems in wireless networks and variations of repeated game models together
with the corresponding solutions are discussed in this survey. Finally, we
outline some open issues and future research directions.
","[{'version': 'v1', 'created': 'Sun, 11 Jan 2015 13:35:35 GMT'}]",2015-01-14,"[['Hoang', 'Dinh Thai', ''], ['Lu', 'Xiao', ''], ['Niyato', 'Dusit', ''], ['Wang', 'Ping', ''], ['Han', 'Zhu', '']]","['Repeated games', 'wireless networks', 'game theory', 'Folk theorem', 'subgame perfect equilibirum']"
18351,1403.6305,Hanae Sbai Mrs,Hanae Sbai and Mounia Fredj and Laila Kjiri,"A Pattern based methodology for evolution management in business process
  reuse",10 pages,"IJCSI International Journal of Computer Science Issues, Vol. 11,
  Issue 1, No 1, January 2014",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today, there are Process-Aware Information Systems (PAIS) with a set of
business process models which vary over time to meet the new requirements. In a
competitive environment, the key challenge of enterprises is to reduce the cost
and time of process design and application development. For this purpose,
research on reuse in business process management have introduced the concept of
configurable process models which attempts to manage business process
variability, by integrating a set of process variants in a single model. In
this context, many research works were interested in creating and elaborating
configurable process models. However, this has become insufficient since the
configurable process model should itself evolve to add new variations. In turn,
this requires a comprehensive support for managing the evolution of
configurable process models. In this paper, we present a complete pattern based
methodology for managing the evolution of configurable process models in terms
of activities, data and resources. Our objective is to propose a process
patterns system for guiding designers in modeling and evolving configurable
process models. Furthermore, our process patterns system will be used for an
automated support so as to manage the evolution of configurable process models.
","[{'version': 'v1', 'created': 'Tue, 25 Mar 2014 11:23:14 GMT'}]",2014-03-27,"[['Sbai', 'Hanae', ''], ['Fredj', 'Mounia', ''], ['Kjiri', 'Laila', '']]","['PAIS', 'business process variability', 'process evolution', 'configurable process model', 'process pattern']"
18352,1611.00740,Qianli Liao,"Tomaso Poggio, Hrushikesh Mhaskar, Lorenzo Rosasco, Brando Miranda,
  Qianli Liao","Why and When Can Deep -- but Not Shallow -- Networks Avoid the Curse of
  Dimensionality: a Review",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper characterizes classes of functions for which deep learning can be
exponentially better than shallow learning. Deep convolutional networks are a
special case of these conditions, though weight sharing is not the main reason
for their exponential advantage.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2016 19:35:52 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Nov 2016 06:15:39 GMT'}, {'version': 'v3', 'created': 'Tue, 29 Nov 2016 21:24:07 GMT'}, {'version': 'v4', 'created': 'Wed, 25 Jan 2017 01:09:40 GMT'}, {'version': 'v5', 'created': 'Sat, 4 Feb 2017 09:10:41 GMT'}]",2017-02-07,"[['Poggio', 'Tomaso', ''], ['Mhaskar', 'Hrushikesh', ''], ['Rosasco', 'Lorenzo', ''], ['Miranda', 'Brando', ''], ['Liao', 'Qianli', '']]","['Deep and Shallow Networks', 'Convolutional Neural Networks', 'Function Approximation', 'Deep Learning']"
18353,0707.2228,Damien Chablat,"Maher Baili (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat
  (IRCCyN)",Kinematic Analysis of a Family of 3R Manipulators,,"Problems of Mechanics 15, 2 (07/2004) 27-32",,,cs.RO,,"  The workspace topologies of a family of 3-revolute (3R) positioning
manipulators are enumerated. The workspace is characterized in a half-cross
section by the singular curves. The workspace topology is defined by the number
of cusps that appear on these singular curves. The design parameters space is
shown to be divided into five domains where all manipulators have the same
number of cusps. Each separating surface is given as an explicit expression in
the DH-parameters. As an application of this work, we provide a necessary and
sufficient condition for a 3R orthogonal manipulator to be cuspidal, i.e. to
change posture without meeting a singularity. This condition is set as an
explicit expression in the DH parameters.
","[{'version': 'v1', 'created': 'Sun, 15 Jul 2007 18:00:53 GMT'}]",2007-07-17,"[['Baili', 'Maher', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN'], ['Chablat', 'Damien', '', 'IRCCyN']]","['Workspace', 'Singularity', '3R manipulator', 'Cuspidal manipulator']"
18354,1701.07238,Nicola Prezza,Nicola Prezza,A Framework of Dynamic Data Structures for String Processing,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present DYNAMIC, an open-source C++ library implementing
dynamic compressed data structures for string manipulation. Our framework
includes useful tools such as searchable partial sums, succinct/gap-encoded
bitvectors, and entropy/run-length compressed strings and FM-indexes. We prove
close-to-optimal theoretical bounds for the resources used by our structures,
and show that our theoretical predictions are empirically tightly verified in
practice. To conclude, we turn our attention to applications. We compare the
performance of four recently-published compression algorithms implemented using
DYNAMIC with those of state-of-the-art tools performing the same task. Our
experiments show that algorithms making use of dynamic compressed data
structures can be up to three orders of magnitude more space-efficient (albeit
slower) than classical ones performing the same tasks.
","[{'version': 'v1', 'created': 'Wed, 25 Jan 2017 10:16:30 GMT'}]",2017-01-26,"[['Prezza', 'Nicola', '']]","['C++', 'dynamic', 'compression', 'data structure', 'bitvector', 'string']"
18355,1306.4280,Chaker Ben Mahmoud,"Chaker Ben Mahmoud, Fathia Bettahar, Hajer Abderrahim, Houda Saidi",Towards a Graph-Based Approach for Web Services Composition,,"IJCSI Volume 10, Issue 1, January 2013 , Page 351",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, Web services (WS) remain a main actor in the implementation of
distributed applications. They represent a new promising paradigm for the
development, deployment and integration of Internet applications. The aim of
Web services composition is to use the skills of several departments to resolve
any problem that cannot be solved individually. The result of this composition
is a compound of Web services that define how they will be used. In this paper,
we propose an approach for automatic web services composition based on the
concepts of directed graphs for the representation and description of Web
services, and the ordering of web services compound execution. In this context,
the user query, defined by a set of inputs and outputs, can be viewed as a
directed graph composed of Web services.
","[{'version': 'v1', 'created': 'Tue, 18 Jun 2013 18:02:20 GMT'}]",2013-06-19,"[['Mahmoud', 'Chaker Ben', ''], ['Bettahar', 'Fathia', ''], ['Abderrahim', 'Hajer', ''], ['Saidi', 'Houda', '']]","['Web Services', 'Automatic composition', 'WSDL', 'service-oriented architecture', 'Theory of graphs']"
18356,0704.3501,Jerome Darmont,"J\'er\^ome Darmont (ERIC), Fadila Bentayeb (ERIC), Omar Boussa\""id
  (ERIC)",Conception d'un banc d'essais d\'ecisionnel,20 pages,"20\`emes Journ\'ees Bases de Donn\'ees Avanc\'ees (BDA 04),
  Montpellier (19/10/2004) 493-511",,,cs.DB,,"  We present in this paper a new benchmark for evaluating the performances of
data warehouses. Benchmarking is useful either to system users for comparing
the performances of different systems, or to system engineers for testing the
effect of various design choices. While the TPC (Transaction Processing
Performance Council) standard benchmarks address the first point, they are not
tuneable enough to address the second one. Our Data Warehouse Engineering
Benchmark (DWEB) allows to generate various ad-hoc synthetic data warehouses
and workloads. DWEB is fully parameterized. However, two levels of
parameterization keep it easy to tune. Since DWEB mainly meets engineering
benchmarking needs, it is complimentary to the TPC standard benchmarks, and not
a competitor. Finally, DWEB is implemented as a Java free software that can be
interfaced with most existing relational database management systems.
","[{'version': 'v1', 'created': 'Thu, 26 Apr 2007 09:13:04 GMT'}]",2007-05-23,"[['Darmont', 'Jérôme', '', 'ERIC'], ['Bentayeb', 'Fadila', '', 'ERIC'], ['Boussaïd', 'Omar', '', 'ERIC']]","['Data warehouses', 'decision support queries', 'OLAP', 'benchmarking', 'performanceevaluation', 'data warehouse design']"
18357,1304.1913,Carlo Spaccasassi Mr,Carlo Spaccasassi and Vasileios Koutavas,Towards Efficient Abstractions for Concurrent Consensus,"15 pages, 5 figures, symposium: TFP 2013",,,,cs.PL cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consensus is an often occurring problem in concurrent and distributed
programming. We present a programming language with simple semantics and
build-in support for consensus in the form of communicating transactions. We
motivate the need for such a construct with a characteristic example of
generalized consensus which can be naturally encoded in our language. We then
focus on the challenges in achieving an implementation that can efficiently run
such programs. We setup an architecture to evaluate different implementation
alternatives and use it to experimentally evaluate runtime heuristics. This is
the basis for a research project on realistic programming language support for
consensus.
","[{'version': 'v1', 'created': 'Sat, 6 Apr 2013 17:00:00 GMT'}, {'version': 'v2', 'created': 'Tue, 7 May 2013 16:47:24 GMT'}]",2013-05-08,"[['Spaccasassi', 'Carlo', ''], ['Koutavas', 'Vasileios', '']]","['Concurrent programming', 'consensus', 'communicating transactions']"
18358,1409.7724,Vijay Gadepally,Zachary Weber and Vijay Gadepally,Using 3D Printing to Visualize Social Media Big Data,,,,,cs.GR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Big data volume continues to grow at unprecedented rates. One of the key
features that makes big data valuable is the promise to find unknown patterns
or correlations that may be able to improve the quality of processes or
systems. Unfortunately, with the exponential growth in data, users often have
difficulty in visualizing the often-unstructured, non-homogeneous data coming
from a variety of sources. The recent growth in popularity of 3D printing has
ushered in a revolutionary way to interact with big data. Using a 3D printed
mockup up a physical or notional environment, one can display data on the
mockup to show real-time data patterns. In this poster and demonstration, we
describe the process of 3D printing and demonstrate an application of
displaying Twitter data on a 3D mockup of the Massachusetts Institute of
Technology (MIT) campus, known as LuminoCity.
","[{'version': 'v1', 'created': 'Wed, 23 Jul 2014 19:17:11 GMT'}]",2014-09-30,"[['Weber', 'Zachary', ''], ['Gadepally', 'Vijay', '']]","['LADAR', '3D printing', 'Big Data Visualization']"
18359,1206.1032,Zarrouk Manel,"Manel Zarrouk, Med Salah Gouider",Frequent Patterns mining in time-sensitive Data Stream,8pages,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mining frequent itemsets through static Databases has been extensively
studied and used and is always considered a highly challenging task. For this
reason it is interesting to extend it to data streams field. In the streaming
case, the frequent patterns' mining has much more information to track and much
greater complexity to manage. Infrequent items can become frequent later on and
hence cannot be ignored. The output structure needs to be dynamically
incremented to reflect the evolution of itemset frequencies over time. In this
paper, we study this problem and specifically the methodology of mining
time-sensitive data streams. We tried to improve an existing algorithm by
increasing the temporal accuracy and discarding the out-of-date data by adding
a new concept called the ""Shaking Point"". We presented as well some experiments
illustrating the time and space required.
","[{'version': 'v1', 'created': 'Tue, 5 Jun 2012 19:26:24 GMT'}]",2012-06-06,"[['Zarrouk', 'Manel', ''], ['Gouider', 'Med Salah', '']]","['frequent pattern', 'data stream', 'stream data mining', 'time-sensitive data stream']"
18360,0805.2938,Wojciech Mazurczyk,Wojciech Mazurczyk and Krzysztof Szczypiorski,Steganography of VoIP Streams,"18 pages, 9 figures, content changed, accepted to The 3rd
  International Symposium on Information Security (IS'08), Monterrey, Mexico,
  November 10-11, 2008 (Proceedings will be published by Springer LNCS)",,,,cs.MM cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper concerns available steganographic techniques that can be used for
creating covert channels for VoIP (Voice over Internet Protocol) streams. Apart
from characterizing existing steganographic methods we provide new insights by
presenting two new techniques. The first one is network steganography solution
which exploits free/unused protocols' fields and is known for IP, UDP or TCP
protocols but has never been applied to RTP (Real-Time Transport Protocol) and
RTCP (Real-Time Control Protocol) which are characteristic for VoIP. The second
method, called LACK (Lost Audio Packets Steganography), provides hybrid
storage-timing covert channel by utilizing delayed audio packets. The results
of the experiment, that was performed to estimate a total amount of data that
can be covertly transferred during typical VoIP conversation phase, regardless
of steganalysis, are also included in this paper.
","[{'version': 'v1', 'created': 'Mon, 19 May 2008 20:46:38 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Aug 2008 10:40:57 GMT'}]",2008-08-25,"[['Mazurczyk', 'Wojciech', ''], ['Szczypiorski', 'Krzysztof', '']]","['VoIP', 'information hiding', 'steganography']"
18361,1511.07409,Saining Xie,"Saining Xie, Xun Huang and Zhuowen Tu",Top-Down Learning for Structured Labeling with Convolutional Pseudoprior,"To appear in ECCV 2016, 16 pages, 6 figures",,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current practice in convolutional neural networks (CNN) remains largely
bottom-up and the role of top-down process in CNN for pattern analysis and
visual inference is not very clear. In this paper, we propose a new method for
structured labeling by developing convolutional pseudo-prior (ConvPP) on the
ground-truth labels. Our method has several interesting properties: (1)
compared with classical machine learning algorithms like CRFs and Structural
SVM, ConvPP automatically learns rich convolutional kernels to capture both
short- and long- range contexts; (2) compared with cascade classifiers like
Auto-Context, ConvPP avoids the iterative steps of learning a series of
discriminative classifiers and automatically learns contextual configurations;
(3) compared with recent efforts combing CNN models with CRFs and RNNs, ConvPP
learns convolution in the labeling space with much improved modeling capability
and less manual specification; (4) compared with Bayesian models like MRFs,
ConvPP capitalizes on the rich representation power of convolution by
automatically learning priors built on convolutional filters. We accomplish our
task using pseudo-likelihood approximation to the prior under a novel
fixed-point network structure that facilitates an end-to-end learning process.
We show state-of-the-art results on sequential labeling and image labeling
benchmarks.
","[{'version': 'v1', 'created': 'Mon, 23 Nov 2015 20:43:14 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Jul 2016 05:25:29 GMT'}]",2016-07-27,"[['Xie', 'Saining', ''], ['Huang', 'Xun', ''], ['Tu', 'Zhuowen', '']]","['Structured Prediction', 'Deep Learning', 'Semantic Segmentation', 'Top-down Processing']"
18362,1204.5416,Pradeep  Singla,"Manoj Kumar, Vikas Kaushik, Pradeep Singla",A New Approach of Improving CFA Image for Digital Camera's,"4 Pages, 6 Figures","Proceedings of ETEIC-2012:pp 256-259, April-2012",,,cs.CV,http://creativecommons.org/licenses/by/3.0/,"  This paper work directly towards the improving the quality of the image for
the digital cameras and other visual capturing products. In this Paper, the
authors clearly defines the problems occurs in the CFA image. A different
methodology for removing the noise is discuses in the paper for color
correction and color balancing of the image. At the same time, the authors also
proposed a new methodology of providing denoisiing process before the
demosaickingfor the improving the image quality of CFA which is much efficient
then the other previous defined. The demosaicking process for producing the
colors in the image in a best way is also discuss.
","[{'version': 'v1', 'created': 'Tue, 24 Apr 2012 15:45:37 GMT'}]",2012-04-25,"[['Kumar', 'Manoj', ''], ['Kaushik', 'Vikas', ''], ['Singla', 'Pradeep', '']]","['Demosaicking operation', 'CFA', 'Interpolation', 'Bayer pattern', 'image']"
18363,1501.01537,Nuha Khediri,Nouha Kh\'ediri and Montaceur Zaghdoud,"Survey of Uncertainty Handling in Cloud Service Discovery and
  Composition","10 pages,2 tables",,,,cs.SE,http://creativecommons.org/licenses/publicdomain/,"  With the spread of services related to cloud environment, it is tiresome and
time consuming for users to look for the appropriate service that meet with
their needs. Therefore, finding a valid and reliable service is essential.
However, in case a single cloud service cannot fulfil every user requirements,
a composition of cloud services is needed. In addition, the need to treat
uncertainty in cloud service discovery and composition induces a lot of
concerns in order to minimize the risk. Risk includes some sort of either loss
or damage which is possible to be received by a target (i.e., the environment,
cloud providers or customers). In this paper, we will focus on the uncertainty
application for cloud service discovery and composition. A set of existing
approaches in literature are reviewed and categorized according to the risk
modeling.
","[{'version': 'v1', 'created': 'Wed, 7 Jan 2015 15:58:25 GMT'}]",2015-01-08,"[['Khédiri', 'Nouha', ''], ['Zaghdoud', 'Montaceur', '']]","['Cloud Computing', 'Cloud Service Discovery', 'Cloud Service Composition', 'Risk', 'Uncertainty']"
18364,1506.01082,Carlo Comin MSc,"Carlo Comin, Romeo Rizzi","An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast
  Matrix Multiplication",,,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The first output-sensitive algorithm for the Maximal Clique Listing problem
was given by Tsukiyama et.al. in 1977. As any algorithm falling within the
Reverse Search paradigm, it performs a DFS visit of a directed tree (the
RS-tree) having the objects to be listed (i.e. maximal cliques) as its nodes.
In a recursive implementation, the RS-tree corresponds to the recursion tree of
the algorithm. The time delay is given by the cost of generating the next child
of a node, and Tsukiyama showed it is $O(mn)$. In 2004, Makino and Uno
sharpened the time delay to $O(n^{\omega})$ by generating all the children of a
node in one single shot performed by computing a \emph{square} fast matrix
multiplication. In this paper, we further improve the asymptotics for the
exploration of the same RS-tree by grouping the offsprings' computation even
further. Our idea is to rely on rectangular fast matrix multiplication in order
to compute all children of $n^2$ nodes in one shot. According to the current
upper bounds on fast matrix multiplication, with this the time delay improves
from $O(n^{2.3728639})$ to $O(n^{2.093362})$.
","[{'version': 'v1', 'created': 'Tue, 2 Jun 2015 22:48:34 GMT'}, {'version': 'v2', 'created': 'Sun, 7 Jun 2015 19:48:10 GMT'}, {'version': 'v3', 'created': 'Thu, 11 Jun 2015 23:05:59 GMT'}, {'version': 'v4', 'created': 'Sun, 21 Jun 2015 12:35:25 GMT'}, {'version': 'v5', 'created': 'Mon, 24 Aug 2015 08:19:05 GMT'}]",2015-08-25,"[['Comin', 'Carlo', ''], ['Rizzi', 'Romeo', '']]","['Maximal Clique Listing', 'Rectangular Fast Matrix Multiplication', 'Output SensitiveAlgorithm', 'Polynomial Time Delay', 'Reverse Search Enumeration', 'Backtracking']"
18365,1412.7250,Deepan Palguna,"Deepan Palguna, David J. Love, Ilya Pollak",Secondary Spectrum Auctions for Markets with Communication Constraints,37 pages,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Auctions have been proposed as a way to provide economic incentives for
primary users to dynamically allocate unused spectrum to other users in need of
it. Previously proposed schemes do not take into account the fact that the
power constraints of users might prevent them from transmitting their bid
prices to the auctioneer with high precision and that transmitted bid prices
must travel through a noisy channel. These schemes also have very high
overheads which cannot be accommodated in wireless standards. We propose
auction schemes where a central clearing authority auctions spectrum to users
who bid for it, while taking into account quantization of prices, overheads in
bid revelation, and noise in the channel explicitly. Our schemes are closely
related to channel output feedback problems and, specifically, to the technique
of posterior matching. We consider several scenarios where the objective of the
clearing authority is to award spectrum to the bidders who value spectrum the
most. We prove theoretically that this objective is asymptotically attained by
our scheme when the bidders are non-strategic with constant bids. We propose
separate schemes to make strategic users reveal their private values
truthfully, to auction multiple sub-channels among strategic users, and to
track slowly time-varying bid prices. Our simulations illustrate the optimality
of our schemes for constant bid prices, and also demonstrate the effectiveness
of our tracking algorithm for slowly time-varying bids.
","[{'version': 'v1', 'created': 'Tue, 23 Dec 2014 04:35:23 GMT'}]",2014-12-24,"[['Palguna', 'Deepan', ''], ['Love', 'David J.', ''], ['Pollak', 'Ilya', '']]","['Secondary spectrum markets', 'auctions', 'posterior matching']"
18366,1004.3563,Vishal Goyal,"Ramesh Babu H.S., Gowrishankar, Satyanarayana P.S","A QoS Provisioning Recurrent Neural Network based Call Admission Control
  for beyond 3G Networks","International Journal of Computer Science Issues online at
  http://ijcsi.org/articles/A-QoS-Provisioning-Recurrent-Neural-Network-based-Call-Admission-Control-for-beyond-3G-Networks.php","IJCSI, Volume 7, Issue 2, March 2010",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Call admission control (CAC) is one of the Radio Resource Management
(RRM) techniques that plays influential role in ensuring the desired Quality of
Service (QoS) to the users and applications in next generation networks. This
paper proposes a fuzzy neural approach for making the call admission control
decision in multi class traffic based Next Generation Wireless Networks (NGWN).
The proposed Fuzzy Neural call admission control (FNCAC) scheme is an
integrated CAC module that combines the linguistic control capabilities of the
fuzzy logic controller and the learning capabilities of the neural networks.
The model is based on recurrent radial basis function networks which have
better learning and adaptability that can be used to develop intelligent system
to handle the incoming traffic in an heterogeneous network environment. The
simulation results are optimistic and indicates that the proposed FNCAC
algorithm performs better than the other two methods and the call blocking
probability is minimal when compared to other two methods.
","[{'version': 'v1', 'created': 'Tue, 20 Apr 2010 20:24:51 GMT'}]",2010-04-22,"[['S.', 'Ramesh Babu H.', ''], ['Gowrishankar', '', ''], ['S', 'Satyanarayana P.', '']]","['Radio resource management', 'Heterogeneous wireless Networks', 'Call admission control', 'Call blocking probability', 'Recurrent radial basis function networks']"
18367,1205.1603,Win Win  Thant,"Win Win Thant, Tin Myat Htwe and Ni Lar Thein",Parsing of Myanmar sentences with function tagging,"18 pages, 8 figures, 10 tables. arXiv admin note: substantial text
  overlap with arXiv:1203.1685, and with arXiv:0912.1820 by other authors
  without attribution",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the use of Naive Bayes to address the task of assigning
function tags and context free grammar (CFG) to parse Myanmar sentences. Part
of the challenge of statistical function tagging for Myanmar sentences comes
from the fact that Myanmar has free-phrase-order and a complex morphological
system. Function tagging is a pre-processing step for parsing. In the task of
function tagging, we use the functional annotated corpus and tag Myanmar
sentences with correct segmentation, POS (part-of-speech) tagging and chunking
information. We propose Myanmar grammar rules and apply context free grammar
(CFG) to find out the parse tree of function tagged Myanmar sentences.
Experiments show that our analysis achieves a good result with parsing of
simple sentences and three types of complex sentences.
","[{'version': 'v1', 'created': 'Tue, 8 May 2012 07:01:40 GMT'}]",2012-05-09,"[['Thant', 'Win Win', ''], ['Htwe', 'Tin Myat', ''], ['Thein', 'Ni Lar', '']]","['Function tagging', 'Parsing', 'Naive Bayes theory', 'Context free grammar', 'Myanmar sentences']"
18368,1512.00215,Rashid Mijumbi,Rashid Mijumbi,On the Energy Efficiency Prospects of Network Function Virtualization,arXiv admin note: text overlap with arXiv:1509.07675,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network Function Virtualization (NFV) has recently received significant
attention as an innovative way of deploying network services. By decoupling
network functions from the physical equipment on which they run, NFV has been
proposed as passage towards service agility, better time-to-market, and reduced
Capital Expenses (CAPEX) and Operating Expenses (OPEX). One of the main selling
points of NFV is its promise for better energy efficiency resulting from
consolidation of resources as well as their more dynamic utilization. However,
there are currently no studies or implementations which attach values to energy
savings that can be expected, which could make it hard for Telecommunication
Service Providers (TSPs) to make investment decisions. In this paper, we
utilize Bell Labs' GWATT tool to estimate the energy savings that could result
from the three main NFV use cases Virtualized Evolved Packet Core (VEPC),
Virtualized Customer Premises Equipment (VCPE) and Virtualized Radio Access
Network (VRAN). We determine that the part of the mobile network with the
highest energy utilization prospects is the Evolved Packet Core (EPC) where
virtualization of functions leads to a 22% reduction in energy consumption and
a 32% enhancement in energy efficiency.
","[{'version': 'v1', 'created': 'Tue, 1 Dec 2015 10:38:52 GMT'}]",2015-12-02,"[['Mijumbi', 'Rashid', '']]","['Network function virtualization', 'cloud computing', 'energy efficiency', 'estimation', 'measurements']"
18369,1206.5468,Hassan Keshavarz,"Hero Modares (Corresponding author), Rosli Salleh, Amirhosein
  Moravejosharieh, Hassan Keshavarz, Majid Talebi Shahgoli",A Survey on Cloud Computing Security,,,,,cs.NI cs.CR,http://creativecommons.org/licenses/by/3.0/,"  Computation encounter the new approach of cloud computing which maybe keeps
the world and possibly can prepare all the human's necessities. In other words,
cloud computing is the subsequent regular step in the evolution of on-demand
information technology services and products. The Cloud is a metaphor for the
Internet and is a concept for the covered complicated infrastructure; it also
depends on sketching in computer network diagrams. In this paper we will focus
on concept of cloud computing, cloud deployment models, cloud security
challenges encryption and data protection, privacy and security and data
management and movement from grid to cloud.
","[{'version': 'v1', 'created': 'Sun, 24 Jun 2012 07:20:46 GMT'}]",2012-06-26,"[['Modares', 'Hero', '', 'Corresponding author'], ['Salleh', 'Rosli', ''], ['Moravejosharieh', 'Amirhosein', ''], ['Keshavarz', 'Hassan', ''], ['Shahgoli', 'Majid Talebi', '']]","['cloud computing', 'Security in cloud computing', 'Data Management and movement']"
18370,1109.0216,Asadollah Shahbahrami,"Asadollah Shahbahrami, Ramin Bahrampour, Mobin Sabbaghi Rostami, and
  Mostafa Ayoubi Mobarhan","Evaluation of Huffman and Arithmetic Algorithms for Multimedia
  Compression Standards","11 pages; http://airccse.org/journal/ijcsea/current.html
  International Journal of Computer Science, Engineering and Applications
  (IJCSEA) August 2011, Volume 1, Number 4",,,,cs.IT cs.MM math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Compression is a technique to reduce the quantity of data without excessively
reducing the quality of the multimedia data. The transition and storing of
compressed multimedia data is much faster and more efficient than original
uncompressed multimedia data. There are various techniques and standards for
multimedia data compression, especially for image compression such as the JPEG
and JPEG2000 standards. These standards consist of different functions such as
color space conversion and entropy coding. Arithmetic and Huffman coding are
normally used in the entropy coding phase. In this paper we try to answer the
following question. Which entropy coding, arithmetic or Huffman, is more
suitable compared to other from the compression ratio, performance, and
implementation points of view? We have implemented and tested Huffman and
arithmetic algorithms. Our implemented results show that compression ratio of
arithmetic coding is better than Huffman coding, while the performance of the
Huffman coding is higher than Arithmetic coding. In addition, implementation of
Huffman coding is much easier than the Arithmetic coding.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2011 15:34:23 GMT'}]",2011-09-02,"[['Shahbahrami', 'Asadollah', ''], ['Bahrampour', 'Ramin', ''], ['Rostami', 'Mobin Sabbaghi', ''], ['Mobarhan', 'Mostafa Ayoubi', '']]","['Multimedia Compression', 'JPEG standard', 'Arithmetic coding', 'Huffman coding']"
18371,1607.02281,Stavros Nikolopoulos D.,Anna Mpanti and Stavros D. Nikolopoulos,"Two RPG Flow-graphs for Software Watermarking using Bitonic Sequences of
  Self-inverting Permutations","10 pages, 2 figures",,,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software watermarking has received considerable attention and was adopted by
the software development community as a technique to prevent or discourage
software piracy and copyright infringement. A wide range of software
watermarking techniques has been proposed among which the graph-based methods
that encode watermarks as graph structures. Following up on our recently
proposed methods for encoding watermark numbers $w$ as reducible permutation
flow-graphs $F[\pi^*]$ through the use of self-inverting permutations $\pi^*$,
in this paper, we extend the types of flow-graphs available for software
watermarking by proposing two different reducible permutation flow-graphs
$F_1[\pi^*]$ and $F_2[\pi^*]$ incorporating important properties which are
derived from the bitonic subsequences composing the self-inverting permutation
$\pi^*$. We show that a self-inverting permutation $\pi^*$ can be efficiently
encoded into either $F_1[\pi^*]$ or $F_2[\pi^*]$ and also efficiently decoded
from theses graph structures. The proposed flow-graphs $F_1[\pi^*]$ and
$F_2[\pi^*]$ enrich the repository of graphs which can encode the same
watermark number $w$ and, thus, enable us to embed multiple copies of the same
watermark $w$ into an application program $P$. Moreover, the enrichment of that
repository with new flow-graphs increases our ability to select a graph
structure more similar to the structure of a given application program $P$
thereby enhancing the resilience of our codec system to attacks.
","[{'version': 'v1', 'created': 'Fri, 8 Jul 2016 09:12:07 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Jul 2016 08:57:56 GMT'}]",2016-07-18,"[['Mpanti', 'Anna', ''], ['Nikolopoulos', 'Stavros D.', '']]","['Watermarking', 'self-inverting permutation', 'reducible permutation graphs', 'codecalgorithms', 'encoding', 'decoding']"
18372,1606.03540,Zahir Al Rashdi,"Zahir Al Rashdi, Martin Dick and Ian Storey","A Conceptual Framework for Accountability in Cloud Computing Service
  Provision","ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
  Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/221,cs.CY cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper uses a comprehensive review of the academic and professional
literature in relation to accountability in the area of cloud computing service
provision. It identifies four key conceptual factors that are necessary for an
organisation to be considered as accountable. The four factors were found to
be: responsibility, assurance, transparency and remediation. A key finding of
the paper is that in order to be considered as an accountable cloud service
provider, all four factors need to be implemented and be demonstrable by the
organisation.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 03:27:35 GMT'}]",2016-06-14,"[['Rashdi', 'Zahir Al', ''], ['Dick', 'Martin', ''], ['Storey', 'Ian', '']]","['Accountability', 'cloud computing', 'service provision', 'information security']"
18373,0906.1644,Florentina Pintea,"Dorel Micle, Marcel Torok-Oance, Liviu Maruia","The morpho-topographic and cartographic analysis of the archaeological
  site Cornesti ""Iarcuri"", Timis County, Romania, using computer sciences
  methods (GIS and Remote Sensing techniques)","14 pages, exposed on 5th International Conference ""Actualities and
  Perspectives on Hardware and Software"" - APHS2009, Timisoara, Romania","Ann. Univ. Tibiscus Comp. Sci. Series VII(2009),249-262",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The archaeological site Cornesti ""Iarcuri"" is the largest earth fortification
in Romania, made out of four concentric compounds, spreading over 1780
hectares. It is known since 1700, but it had only a few small attempts of
systematic research, the fortress gained interest only after the publishing of
some satellite images by Google Earth. It is located in an area of high fields
and it occupies three interfluves and contains two streams. Our paper contains
a geomorphologic, topographic and cartographic analysis of the site in order to
determine the limits, the structure, the morphology, the construction technique
and the functionality of such a fortification.Our research is based on
satellite image analysis, on archaeological topography, on soil, climate and
vegetation analysis as a way to offer a complex image, through this
interdisciplinary study of landscape archaeology. Through our work we try not
to date the site as this objective will be achieved only after completing the
systematic excavations which started in 2007, but only to analyze the
co-relationship with the environment.
","[{'version': 'v1', 'created': 'Tue, 9 Jun 2009 07:02:11 GMT'}]",2009-06-10,"[['Micle', 'Dorel', ''], ['Torok-Oance', 'Marcel', ''], ['Maruia', 'Liviu', '']]","['computer science', 'remote sensing', 'landscape']"
18374,1712.02770,Ron Levie,"Ron Levie, Nir Sochen","A Wavelet Plancherel Theory with Application to Multipliers and Sparse
  Approximations",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce an extension of continuous wavelet theory that enables an
efficient implementation of multiplicative operators in the coefficient space.
In the new theory, the signal space is embedded in a larger abstract signal
space -- the so called window-signal space. There is a canonical extension of
the wavelet transform to an isometric isomorphism between the window-signal
space and the coefficient space. Hence, the new framework is called a
wavelet-Plancherel theory, and the extended wavelet transform is called the
wavelet-Plancherel transform. Since the wavelet-Plancherel transform is an
isometric isomorphism, any operation in the coefficient space can be
pulled-back to an operation in the window-signal space. It is then possible to
improve the computational complexity of methods that involve a multiplicative
operator in the coefficient space, by performing all computations directly in
the window-signal space. As one example application, we show how continuous
wavelet multipliers (also called Calder\'{o}n-Toeplitz Operators), with
polynomial symbols, can be implemented with linear complexity in the resolution
of the 1D signal. As another example, we develop a framework for efficiently
computing greedy sparse approximations to signals based on elements of
continuous wavelet systems.
","[{'version': 'v1', 'created': 'Thu, 7 Dec 2017 18:32:13 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Dec 2017 15:44:04 GMT'}, {'version': 'v3', 'created': 'Thu, 1 Mar 2018 13:38:17 GMT'}, {'version': 'v4', 'created': 'Sat, 10 Mar 2018 14:03:37 GMT'}, {'version': 'v5', 'created': 'Wed, 6 Jun 2018 14:17:04 GMT'}, {'version': 'v6', 'created': 'Tue, 10 Jul 2018 13:24:38 GMT'}, {'version': 'v7', 'created': 'Fri, 17 Aug 2018 14:06:51 GMT'}, {'version': 'v8', 'created': 'Sun, 26 Apr 2020 15:59:22 GMT'}, {'version': 'v9', 'created': 'Tue, 6 Jul 2021 19:17:00 GMT'}]",2021-07-08,"[['Levie', 'Ron', ''], ['Sochen', 'Nir', '']]","['Continuous wavelet', 'Plancherel theorem', 'wavelet multiplier', 'sparse decomposition', 'matching pursuitMSC']"
18375,1511.01955,Ousmane Ndiaye,Ousmane Ndiaye,"One Cyclic Codes over $\mathbb{F}_{p^k} + v\mathbb{F}_{p^k} +
  v^2\mathbb{F}_{p^k} + ... + v^r\mathbb{F}_{p^k}$",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate cyclic code over the ring $\mathbb{F}_{p^k} +
v\mathbb{F}_{p^k} + v^2\mathbb{F}_{p^k} + ... + v^r\mathbb{F}_{p^k}$, where
$v^{r+1}=v$, $p$ a prime number, $r>1$ and $\gcd(r,p)=1$, we prove as
generalisation of P. Sol\'e et al. in 2015 that these codes are principally
generated, give generator polynomial and idempotent depending on idempotents
over this ring as response to an open problem related by J. QIAN et al. in
2005. we also give a gray map and proprieties of the related dual code.
","[{'version': 'v1', 'created': 'Thu, 5 Nov 2015 23:46:02 GMT'}]",2015-11-09,"[['Ndiaye', 'Ousmane', '']]","['cyclic codes', 'generating idempotents', 'dual codes']"
18376,1206.6646,Arnab Bhattacharya,Arnab Bhattacharya and B. Palvali Teja,"Aggregate Skyline Join Queries: Skylines with Aggregate Operations over
  Multiple Relations","Best student paper award; COMAD 2010 (International Conference on
  Management of Data)",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The multi-criteria decision making, which is possible with the advent of
skyline queries, has been applied in many areas. Though most of the existing
research is concerned with only a single relation, several real world
applications require finding the skyline set of records over multiple
relations. Consequently, the join operation over skylines where the preferences
are local to each relation, has been proposed. In many of those cases, however,
the join often involves performing aggregate operations among some of the
attributes from the different relations. In this paper, we introduce such
queries as ""aggregate skyline join queries"". Since the naive algorithm is
impractical, we propose three algorithms to efficiently process such queries.
The algorithms utilize certain properties of skyline sets, and processes the
skylines as much as possible locally before computing the join. Experiments
with real and synthetic datasets exhibit the practicality and scalability of
the algorithms with respect to the cardinality and dimensionality of the
relations.
","[{'version': 'v1', 'created': 'Thu, 28 Jun 2012 12:06:51 GMT'}]",2012-06-29,"[['Bhattacharya', 'Arnab', ''], ['Teja', 'B. Palvali', '']]","['Skyline', 'Join', 'Preferences', 'Aggregation']"
18377,1603.08124,Wenbin Li,"Wenbin Li, Darren Cosker",Video Interpolation using Optical Flow and Laplacian Smoothness,,,,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Non-rigid video interpolation is a common computer vision task. In this paper
we present an optical flow approach which adopts a Laplacian Cotangent Mesh
constraint to enhance the local smoothness. Similar to Li et al., our approach
adopts a mesh to the image with a resolution up to one vertex per pixel and
uses angle constraints to ensure sensible local deformations between image
pairs. The Laplacian Mesh constraints are expressed wholly inside the optical
flow optimization, and can be applied in a straightforward manner to a wide
range of image tracking and registration problems. We evaluate our approach by
testing on several benchmark datasets, including the Middlebury and Garg et al.
datasets. In addition, we show application of our method for constructing 3D
Morphable Facial Models from dynamic 3D data.
","[{'version': 'v1', 'created': 'Sat, 26 Mar 2016 17:13:25 GMT'}]",2016-03-29,"[['Li', 'Wenbin', ''], ['Cosker', 'Darren', '']]","['Optical Flow', 'Computer Vision', 'Non-rigid Deformation', 'Video Interpolation', 'Laplacian Smoothness', 'Meshrepresentation']"
18378,1611.00228,Amit Mishra,Amit Kumar Mishra,"Application Specific Instrumentation (ASIN): A Bio-inspired Paradigm to
  Instrumentation using recognition before detection",,,,,cs.OH cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a new scheme for instrumentation, which has been
inspired by the way small mammals sense their environment. We call this scheme
Application Specific Instrumentation (ASIN). A conventional instrumentation
system focuses on gathering as much information about the scene as possible.
This, usually, is a generic system whose data can be used by another system to
take a specific action. ASIN fuses these two steps into one. The major merit of
the proposed scheme is that it uses low resolution sensors and much less
computational overhead to give good performance for a highly specialised
application
","[{'version': 'v1', 'created': 'Mon, 31 Oct 2016 10:58:12 GMT'}]",2016-11-02,"[['Mishra', 'Amit Kumar', '']]","['Bio-inspired', 'Instrumentation', 'Machine learning']"
18379,1407.7368,Vadim E. Levit,Vadim E. Levit and Eugen Mandrescu,Critical Independent Sets of a Graph,"15 pages; 12 figures. arXiv admin note: substantial text overlap with
  arXiv:1102.1138",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $G$ be a simple graph with vertex set $V\left( G\right) $. A set
$S\subseteq V\left( G\right) $ is independent if no two vertices from $S$ are
adjacent, and by $\mathrm{Ind}(G)$ we mean the family of all independent sets
of $G$.
  The number $d\left( X\right) =$ $\left\vert X\right\vert -\left\vert
N(X)\right\vert $ is the difference of $X\subseteq V\left( G\right) $, and a
set $A\in\mathrm{Ind}(G)$ is critical if $d(A)=\max \{d\left( I\right)
:I\in\mathrm{Ind}(G)\}$ (Zhang, 1990).
  Let us recall the following definitions:
  $\mathrm{core}\left( G\right) $ = $\bigcap$ {S : S is a maximum independent
set}.
  $\mathrm{corona}\left( G\right)$ = $\bigcup$ {S :S is a maximum independent
set}.
  $\mathrm{\ker}(G)$ = $\bigcap$ {S : S is a critical independent set}.
  $\mathrm{diadem}(G)$ = $\bigcup$ {S : S is a critical independent set}.
  In this paper we present various structural properties of $\mathrm{\ker}(G)$,
in relation with $\mathrm{core}\left( G\right) $, $\mathrm{corona}\left(
G\right) $, and $\mathrm{diadem}(G)$.
","[{'version': 'v1', 'created': 'Mon, 28 Jul 2014 09:36:29 GMT'}]",2014-07-29,"[['Levit', 'Vadim E.', ''], ['Mandrescu', 'Eugen', '']]","['independent set', 'critical set', 'ker', 'core', 'corona', 'diadem', 'matching']"
18380,1312.2381,Jakub Radoszewski,"Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin
  Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder,
  Tomasz Wale\'n",A Note on the Longest Common Compatible Prefix Problem for Partial Words,,,,,cs.DS cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For a partial word $w$ the longest common compatible prefix of two positions
$i,j$, denoted $lccp(i,j)$, is the largest $k$ such that $w[i,i+k-1]\uparrow
w[j,j+k-1]$, where $\uparrow$ is the compatibility relation of partial words
(it is not an equivalence relation). The LCCP problem is to preprocess a
partial word in such a way that any query $lccp(i,j)$ about this word can be
answered in $O(1)$ time. It is a natural generalization of the longest common
prefix (LCP) problem for regular words, for which an $O(n)$ preprocessing time
and $O(1)$ query time solution exists.
  Recently an efficient algorithm for this problem has been given by F.
Blanchet-Sadri and J. Lazarow (LATA 2013). The preprocessing time was
$O(nh+n)$, where $h$ is the number of ""holes"" in $w$. The algorithm was
designed for partial words over a constant alphabet and was quite involved.
  We present a simple solution to this problem with slightly better runtime
that works for any linearly-sortable alphabet. Our preprocessing is in time
$O(n\mu+n)$, where $\mu$ is the number of blocks of holes in $w$. Our algorithm
uses ideas from alignment algorithms and dynamic programming.
","[{'version': 'v1', 'created': 'Mon, 9 Dec 2013 11:10:11 GMT'}]",2013-12-10,"[['Crochemore', 'Maxime', ''], ['Iliopoulos', 'Costas S.', ''], ['Kociumaka', 'Tomasz', ''], ['Kubica', 'Marcin', ''], ['Langiu', 'Alessio', ''], ['Radoszewski', 'Jakub', ''], ['Rytter', 'Wojciech', ''], ['Szreder', 'Bartosz', ''], ['Waleń', 'Tomasz', '']]","['partial word', 'longest common compatible prefix', 'longest commonprefix', 'dynamic programming']"
18381,1207.5384,Piotr Filipiuk,"Piotr Filipiuk, Flemming Nielson and Hanne Riis Nielson",Lattice based Least Fixed Point Logic,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As software systems become more complex, there is an increasing need for new
static analyses. Thanks to the declarative style, logic programming is an
attractive formalism for specifying them. However, prior work on using logic
programming for static analysis focused on analyses defined over some powerset
domain, which is quite limiting. In this paper we present a logic that lifts
this restriction, called Lattice based Least Fixed Point Logic (LLFP), that
allows interpretations over any complete lattice satisfying Ascending Chain
Condition. The main theoretical contribution is a Moore Family result that
guarantees that there always is a unique least solution for a given problem.
Another contribution is the development of solving algorithm that computes the
least model of LLFP formulae guaranteed by the Moore Family result.
","[{'version': 'v1', 'created': 'Mon, 23 Jul 2012 13:15:24 GMT'}]",2012-07-24,"[['Filipiuk', 'Piotr', ''], ['Nielson', 'Flemming', ''], ['Nielson', 'Hanne Riis', '']]","['Static analysis', 'logic programming', 'abstract interpretation']"
18382,0710.0232,Maurice Margenstern,Maurice Margenstern,"Constructing a uniform plane-filling path in the ternary heptagrid of
  the hyperbolic plane",,,,,cs.CG cs.DM,,"  In this paper, we distinguish two levels for the plane-filling property. We
consider a simple and a strong one. In this paper, we give the construction
which proves that the simple plane-filling property also holds for the
hyperbolic plane. The plane-filling property was established for the Euclidean
plane by J. Kari, in 1994, in the strong version.
","[{'version': 'v1', 'created': 'Mon, 1 Oct 2007 08:42:03 GMT'}]",2007-10-02,"[['Margenstern', 'Maurice', '']]","['hyperbolic plane', 'tilings', 'tiling problem', 'plane-filling property']"
18383,1705.07961,Irina Georgescu,Irina Georgescu,Compatible extensions and consistent closures: a fuzzy approach,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper $\ast$--compatible extensions of fuzzy relations are studied,
generalizing some results obtained by Duggan in case of crisp relations. From
this general result are obtained as particular cases fuzzy versions of some
important extension theorems for crisp relations (Szpilrajn, Hansson,
Suzumura). Two notions of consistent closure of a fuzzy relation are
introduced.
","[{'version': 'v1', 'created': 'Mon, 22 May 2017 19:27:19 GMT'}]",2017-05-24,"[['Georgescu', 'Irina', '']]","['compatible extension', 'fuzzy consistency', 'fuzzy relation', 'consistent closure']"
18384,1511.02564,Dennis Gamayunov,George Noseevich and Dennis Gamayunov,"Towards automated web application logic reconstruction for application
  level security",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern overlay security mechanisms like Web Application Firewalls (WAF)
suffer from inability to recognize custom high-level application logic and data
objects, which results in low accuracy, high false positives rates, and
overhelming manual effort for fine tuning. In this paper we propose an approach
to web application modeling for security purposes that could help
next-generation WAFs to adapt to specific web applications, and do it
automatically whenever possible. We aim at creating multi-layer models that
adequately simulate various aspects of web application functionality that are
significant for intrusion detection and prevention, including request parsing
and routing, reconstruction of actions and data objects, and action
interdependencies.
","[{'version': 'v1', 'created': 'Mon, 9 Nov 2015 04:30:47 GMT'}]",2015-11-10,"[['Noseevich', 'George', ''], ['Gamayunov', 'Dennis', '']]","['web applications', 'intrusion detection', 'web application firewalls', 'functional modeling']"
18385,0803.0666,Soumaya El Kadiri,"Soumaya El Kadiri (LIESP), Philippe Pernelle (LIESP), Miguel Delattre
  (LIESP), Abdelaziz Bouras (LIESP)",An approach to control collaborative processes in PLM systems,,"Dans Workshop on Extended Product and Process Analysis aNd Design
  - Extended Product and Process Analysis aNd Design, Bordeaux : France (2008)",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Companies that collaborate within the product development processes need to
implement an effective management of their collaborative activities. Despite
the implementation of a PLM system, the collaborative activities are not
efficient as it might be expected. This paper presents an analysis of the
problems related to the collaborative work using a PLM system. From this
analysis, we propose an approach for improving collaborative processes within a
PLM system, based on monitoring indicators. This approach leads to identify and
therefore to mitigate the brakes of the collaborative work.
","[{'version': 'v1', 'created': 'Wed, 5 Mar 2008 14:04:19 GMT'}]",2008-12-18,"[['Kadiri', 'Soumaya El', '', 'LIESP'], ['Pernelle', 'Philippe', '', 'LIESP'], ['Delattre', 'Miguel', '', 'LIESP'], ['Bouras', 'Abdelaziz', '', 'LIESP']]","['PLM', 'collaborative processes', 'collaborative indicators', 'tracks', 'observation']"
18386,1510.05048,Zhengchun Zhou,Cuiling Fan and Nian Li and Zhengchun Zhou,A class of optimal ternary cyclic codes and their duals,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cyclic codes are a subclass of linear codes and have applications in consumer
electronics, data storage systems, and communication systems as they have
efficient encoding and decoding algorithms. Let $m=2\ell+1$ for an integer
$\ell\geq 1$ and $\pi$ be a generator of $\gf(3^m)^*$. In this paper, a class
of cyclic codes $\C_{(u,v)}$ over $\gf(3)$ with two nonzeros $\pi^{u}$ and
$\pi^{v}$ is studied, where $u=(3^m+1)/2$, and $v=2\cdot 3^{\ell}+1$ is the
ternary Welch-type exponent. Based on a result on the non-existence of
solutions to certain equation over $\gf(3^m)$, the cyclic code $\C_{(u,v)}$ is
shown to have minimal distance four, which is the best minimal distance for any
linear code over $\gf(3)$ with length $3^m-1$ and dimension $3^m-1-2m$
according to the Sphere Packing bound. The duals of this class of cyclic codes
are also studied.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2015 23:34:55 GMT'}]",2015-10-20,"[['Fan', 'Cuiling', ''], ['Li', 'Nian', ''], ['Zhou', 'Zhengchun', '']]","['Cyclic code', 'optimal code', 'sphere packing bound']"
18387,1209.5569,Qingyin Li,Qingyin Li and William Zhu,"Lattice structures of fixed points of the lower approximations of two
  types of covering-based rough sets",17 pages,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Covering is a common type of data structure and covering-based rough set
theory is an efficient tool to process this data. Lattice is an important
algebraic structure and used extensively in investigating some types of
generalized rough sets. In this paper, we propose two family of sets and study
the conditions that these two sets become some lattice structures. These two
sets are consisted by the fixed point of the lower approximations of the first
type and the sixth type of covering-based rough sets, respectively. These two
sets are called the fixed point set of neighborhoods and the fixed point set of
covering, respectively. First, for any covering, the fixed point set of
neighborhoods is a complete and distributive lattice, at the same time, it is
also a double p-algebra. Especially, when the neighborhood forms a partition of
the universe, the fixed point set of neighborhoods is both a boolean lattice
and a double Stone algebra. Second, for any covering, the fixed point set of
covering is a complete lattice.When the covering is unary, the fixed point set
of covering becomes a distributive lattice and a double p-algebra. a
distributive lattice and a double p-algebra when the covering is unary.
Especially, when the reduction of the covering forms a partition of the
universe, the fixed point set of covering is both a boolean lattice and a
double Stone algebra.
","[{'version': 'v1', 'created': 'Tue, 25 Sep 2012 10:41:45 GMT'}]",2012-09-26,"[['Li', 'Qingyin', ''], ['Zhu', 'William', '']]","['rough sets', 'neighborhood', 'covering', 'lattice', 'join-irreducible', 'minimaldescription', 'unary', 'double Stone algebra']"
18388,1107.0901,Joachim Spoerhase,"Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen Kobourov,
  Joachim Spoerhase, Alexander Wolff",Approximating Minimum Manhattan Networks in Higher Dimensions,,,,,cs.CG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the minimum Manhattan network problem, which is defined as follows.
Given a set of points called \emph{terminals} in $\R^d$, find a minimum-length
network such that each pair of terminals is connected by a set of axis-parallel
line segments whose total length is equal to the pair's Manhattan (that is,
$L_1$-) distance. The problem is NP-hard in 2D and there is no PTAS for 3D
(unless ${\cal P}={\cal NP}$). Approximation algorithms are known for 2D, but
not for 3D.
  We present, for any fixed dimension $d$ and any $\eps>0$, an
$O(n^\eps)$-approximation algorithm. For 3D, we also give a
$4(k-1)$-approximation algorithm for the case that the terminals are contained
in the union of $k \ge 2$ parallel planes.
","[{'version': 'v1', 'created': 'Tue, 5 Jul 2011 15:27:34 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Apr 2012 13:04:25 GMT'}]",2012-04-30,"[['Das', 'Aparna', ''], ['Gansner', 'Emden R.', ''], ['Kaufmann', 'Michael', ''], ['Kobourov', 'Stephen', ''], ['Spoerhase', 'Joachim', ''], ['Wolff', 'Alexander', '']]","['Approximation Algorithms', 'Computational Geometry', 'Minimum Manhattan Network']"
18389,1205.5525,Anisur Molla Rahaman,"Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan",Fast Distributed Computation in Dynamic Networks via Random Walks,,,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper investigates efficient distributed computation in dynamic networks
in which the network topology changes (arbitrarily) from round to round.
  Our first contribution is a rigorous framework for design and analysis of
distributed random walk algorithms in dynamic networks. We then develop a fast
distributed random walk based algorithm that runs in $\tilde{O}(\sqrt{\tau
\Phi})$ rounds (with high probability), where $\tau$ is the dynamic mixing time
and $\Phi$ is the dynamic diameter of the network respectively, and returns a
sample close to a suitably defined stationary distribution of the dynamic
network. We also apply our fast random walk algorithm to devise fast
distributed algorithms for two key problems, namely, information dissemination
and decentralized computation of spectral properties in a dynamic network.
  Our next contribution is a fast distributed algorithm for the fundamental
problem of information dissemination (also called as gossip) in a dynamic
network. In gossip, or more generally, $k$-gossip, there are $k$ pieces of
information (or tokens) that are initially present in some nodes and the
problem is to disseminate the $k$ tokens to all nodes. We present a random-walk
based algorithm that runs in $\tilde{O}(\min\{n^{1/3}k^{2/3}(\tau \Phi)^{1/3},
nk\})$ rounds (with high probability). To the best of our knowledge, this is
the first $o(nk)$-time fully-distributed token forwarding algorithm that
improves over the previous-best $O(nk)$ round distributed algorithm [Kuhn et
al., STOC 2010], although in an oblivious adversary model.
  Our final contribution is a simple and fast distributed algorithm for
estimating the dynamic mixing time and related spectral properties of the
underlying dynamic network.
","[{'version': 'v1', 'created': 'Thu, 24 May 2012 18:36:18 GMT'}]",2012-05-25,"[['Sarma', 'Atish Das', ''], ['Molla', 'Anisur Rahaman', ''], ['Pandurangan', 'Gopal', '']]","['Dynamic Network', 'Distributed Algorithm', 'Random walks', 'Random sampling', 'Information Dissemination', 'Gossip']"
18390,1607.00868,Leo Liberti,"Claudia D'Ambrosio, Ky Vu, Carlile Lavor, Leo Liberti, Nelson Maculan","New error measures and methods for realizing protein graphs from
  distance data",,,,,cs.CG math.MG math.OC q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The interval Distance Geometry Problem (iDGP) consists in finding a
realization in $\mathbb{R}^K$ of a simple undirected graph $G=(V,E)$ with
nonnegative intervals assigned to the edges in such a way that, for each edge,
the Euclidean distance between the realization of the adjacent vertices is
within the edge interval bounds. In this paper, we focus on the application to
the conformation of proteins in space, which is a basic step in determining
protein function: given interval estimations of some of the inter-atomic
distances, find their shape. Among different families of methods for
accomplishing this task, we look at mathematical programming based methods,
which are well suited for dealing with intervals. The basic question we want to
answer is: what is the best such method for the problem? The most meaningful
error measure for evaluating solution quality is the coordinate root mean
square deviation. We first introduce a new error measure which addresses a
particular feature of protein backbones, i.e. many partial reflections also
yield acceptable backbones. We then present a set of new and existing quadratic
and semidefinite programming formulations of this problem, and a set of new and
existing methods for solving these formulations. Finally, we perform a
computational evaluation of all the feasible solver$+$formulation combinations
according to new and existing error measures, finding that the best methodology
is a new heuristic method based on multiplicative weights updates.
","[{'version': 'v1', 'created': 'Mon, 4 Jul 2016 13:03:34 GMT'}]",2016-07-05,"[[""D'Ambrosio"", 'Claudia', ''], ['Vu', 'Ky', ''], ['Lavor', 'Carlile', ''], ['Liberti', 'Leo', ''], ['Maculan', 'Nelson', '']]","['distance geometry', 'protein conformation', 'mathematical programming']"
18391,1501.04553,Nidhi Lal,"Nidhi Lal, Anurag Prakash Singh, Shishupal Kumar, Shikha Mittal,
  Meenakshi Singh","A Heuristic EDF Uplink Scheduler for Real Time Application in WiMAX
  Communication",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  WiMAX, Worldwide Interoperability for Microwave Access, is a developing
wireless communication scheme that can provide broadband access to large-scale
coverage. WiMAX belongs to the family of standards of IEEE-802.16. To satisfy
user demands and support a new set of real time services and applications, a
realistic and dynamic resource allocation algorithm is mandatory. One of the
most efficient algorithm is EDF (earliest deadline first). But the problem is
that when the difference between deadlines is large enough, then lower priority
queues have to starve. So in this paper, we present a heuristic earliest
deadline first (H-EDF) approach of the uplink scheduler of the WiMAX real time
system. This H-EDF presents a way for efficient allocation of the bandwidth for
uplink, so that bandwidth utilization is proper and appropriate fairness is
provided to the system. We use Opnet simulator for implementing the WiMAX
network, which uses this H-EDF scheduling algorithm. We will analysis the
performance of the H-EDF algorithm in consideration with throughput as well as
involvement of delay.
","[{'version': 'v1', 'created': 'Mon, 19 Jan 2015 16:49:11 GMT'}, {'version': 'v2', 'created': 'Sat, 24 Jan 2015 01:30:39 GMT'}]",2015-01-27,"[['Lal', 'Nidhi', ''], ['Singh', 'Anurag Prakash', ''], ['Kumar', 'Shishupal', ''], ['Mittal', 'Shikha', ''], ['Singh', 'Meenakshi', '']]","['WiMAX', 'EDF', 'H-EDF', 'QoS', 'rtPS', 'SSBPF', 'SS', 'BS;']"
18392,1005.3889,Shiro Ikeda Dr.,"Shiro Ikeda, Kazunori Hayashi, and Toshiyuki Tanaka",Capacity and Modulations with Peak Power Constraint,9 pages with 12 figures. Preparing for submission,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A practical communication channel often suffers from constraints on input
other than the average power, such as the peak power constraint. In order to
compare achievable rates with different constellations as well as the channel
capacity under such constraints, it is crucial to take these constraints into
consideration properly. In this paper, we propose a direct approach to compare
the achievable rates of practical input constellations and the capacity under
such constraints. As an example, we study the discrete-time complex-valued
additive white Gaussian noise (AWGN) channel and compare the capacity under the
peak power constraint with the achievable rates of phase shift keying (PSK) and
quadrature amplitude modulation (QAM) input constellations.
","[{'version': 'v1', 'created': 'Fri, 21 May 2010 05:29:13 GMT'}, {'version': 'v2', 'created': 'Mon, 16 May 2011 05:06:11 GMT'}]",2011-05-17,"[['Ikeda', 'Shiro', ''], ['Hayashi', 'Kazunori', ''], ['Tanaka', 'Toshiyuki', '']]","['peak power constraint', 'capacity', 'AWGN channel', 'PSK', 'QAM', 'APSK']"
18393,0903.5054,Knud Thomsen,Knud Thomsen,Flow of Activity in the Ouroboros Model,"6 pages, 4 figures",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Ouroboros Model is a new conceptual proposal for an algorithmic structure
for efficient data processing in living beings as well as for artificial
agents. Its central feature is a general repetitive loop where one iteration
cycle sets the stage for the next. Sensory input activates data structures
(schemata) with similar constituents encountered before, thus expectations are
kindled. This corresponds to the highlighting of empty slots in the selected
schema, and these expectations are compared with the actually encountered
input. Depending on the outcome of this consumption analysis different next
steps like search for further data or a reset, i.e. a new attempt employing
another schema, are triggered. Monitoring of the whole process, and in
particular of the flow of activation directed by the consumption analysis,
yields valuable feedback for the optimum allocation of attention and resources
including the selective establishment of useful new memory entries.
","[{'version': 'v1', 'created': 'Sun, 29 Mar 2009 15:29:17 GMT'}]",2009-03-31,"[['Thomsen', 'Knud', '']]","['algorithm', 'schema', 'iterative data processing']"
18394,1501.00994,Vikram Krishnamurthy,Vikram Krishnamurthy and William Hoiles,"Online Reputation and Polling Systems: Data Incest, Social Learning and
  Revealed Preferences",arXiv admin note: substantial text overlap with arXiv:1412.4171,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers online reputation and polling systems where individuals
make recommendations based on their private observations and recommendations of
friends. Such interaction of individuals and their social influence is modelled
as social learning on a directed acyclic graph. Data incest (misinformation
propagation) occurs due to unintentional re-use of identical actions in the
for- mation of public belief in social learning; the information gathered by
each agent is mistakenly considered to be independent. This results in
overconfidence and bias in estimates of the state. Necessary and sufficient
conditions are given on the structure of information exchange graph to mitigate
data incest. Incest removal algorithms are presented. Experimental results on
human subjects are presented to illustrate the effect of social influence and
data incest on decision making. These experimental results indicate that social
learning protocols require careful design to handle and mitigate data incest.
The incest removal algorithms are illustrated in an expectation polling system
where participants in a poll respond with a summary of their friends' beliefs.
Finally, the principle of revealed preferences arising in micro-economics
theory is used to parse Twitter datasets to determine if social sensors are
utility maximizers and then determine their utility functions.
","[{'version': 'v1', 'created': 'Mon, 5 Jan 2015 21:00:51 GMT'}]",2015-01-07,"[['Krishnamurthy', 'Vikram', ''], ['Hoiles', 'William', '']]","['social learning', 'data incest', 'reputation systems', 'Bayesian estimation', 'expectation polling', 'Afriat’stheorem', 'revealed preferences']"
18395,1704.08331,Narapureddy Dinesh Reddy,"Nazrul Haque, N Dinesh Reddy and K. Madhava Krishna","Joint Semantic and Motion Segmentation for dynamic scenes using Deep
  Convolutional Networks","In Proceedings of the 12th International Joint Conference on Computer
  Vision, Imaging and Computer Graphics Theory and Applications - Volume 5:
  Visapp, (Visigrapp 2017)",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dynamic scene understanding is a challenging problem and motion segmentation
plays a crucial role in solving it. Incorporating semantics and motion enhances
the overall perception of the dynamic scene. For applications of outdoor
robotic navigation, joint learning methods have not been extensively used for
extracting spatio-temporal features or adding different priors into the
formulation. The task becomes even more challenging without stereo information
being incorporated. This paper proposes an approach to fuse semantic features
and motion clues using CNNs, to address the problem of monocular semantic
motion segmentation. We deduce semantic and motion labels by integrating
optical flow as a constraint with semantic features into dilated convolution
network. The pipeline consists of three main stages i.e Feature extraction,
Feature amplification and Multi Scale Context Aggregation to fuse the semantics
and flow features. Our joint formulation shows significant improvements in
monocular motion segmentation over the state of the art methods on challenging
KITTI tracking dataset.
","[{'version': 'v1', 'created': 'Tue, 18 Apr 2017 03:06:03 GMT'}]",2017-04-28,"[['Haque', 'Nazrul', ''], ['Reddy', 'N Dinesh', ''], ['Krishna', 'K. Madhava', '']]","['Monocular Semantic Motion segmentation', 'Scene understanding', 'Convolutional Neural Networks']"
18396,1504.03385,Chen-Yu Lee,"Chen-Yu Lee, Deng-Jyi Chen",A Content Creation and Protection Scheme for Medical Images,"15 pages, submitted",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Medical images contain metadata information on where, when, and how an image
was acquired, and the majority of this information is stored as pixel data.
Image feature descriptions are often captured only as free text stored in the
image file or in the hospital information system. Correlations between the free
text and the location of the feature are often inaccurate, making it difficult
to link image observations to their corresponding image locations. This limits
the interpretation of image data from a clinical, research, and academic
standpoint. An efficient medical image protection design should allow for
compatibility, usability, and privacy. This paper proposes a medical-content
creation and protection scheme that contains a) a DICOM-compatible multimedia
annotation scheme for medical content creation; b) a DICOM-compatible partial
DRM scheme for medical record transmission under this scheme, authorized users
can view only information to which they have been granted to access.
","[{'version': 'v1', 'created': 'Mon, 13 Apr 2015 22:43:45 GMT'}]",2015-04-15,"[['Lee', 'Chen-Yu', ''], ['Chen', 'Deng-Jyi', '']]","['Digital rights management', 'DICOM', 'medical image', 'annotation']"
18397,1710.03594,Mohamed Issa Elsayed,"Mohamed Issa, Abou Ella Hassanien, Ahmed Abd Elbaset","PID-EVOA: Tuning PID Controller Parameter Optimzation based on the
  Habits of the Egyptian Vulture","6 pages, 8 figures",,,,cs.SY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Proportional - Integral - Derivative (PID) Controller is a primary component
in industrial control systems nowadays. Its gain parameters have a powerful
effect on its transient response criteria such as integral squared error (ISE),
settling time, rise time and overshooting. Tuning gain parameters of PID to
reach the optimal transient response of control systems is a hard problem. The
standard method is Ziegler-Nichols (ZN) method that initially computes the
values of the parameters which produce reasonable response but can be enhanced.
In this paper Egyptian Vulture Optimization Algorithm (EVOA) is used to tune
the parameters of PID controller by minimizing the ISE function more than that
using ZN. The results show that using EVOA enhanced the performance of the
controller response better than ZN method when implemented to liquid level
control system. The ISE was reduced from 32 to 8.9 and the settling time from
189 to 81 second.
","[{'version': 'v1', 'created': 'Fri, 6 Oct 2017 23:09:10 GMT'}]",2017-10-11,"[['Issa', 'Mohamed', ''], ['Hassanien', 'Abou Ella', ''], ['Elbaset', 'Ahmed Abd', '']]","['PID', 'Liquid level control system', 'Meta-Heuristics', 'EVOA']"
18398,1304.6241,Myongchol Ri,"Chol-Un Kim, Dok-Jun An and Song Han","A Security Protocol for the Identification and Data Encrypt Key
  Management of Secure Mobile Devices","7 pages, 1 figure, in version 2 added a secure cryptographic key
  management protocol based on the secure user authentication scheme in version
  1 and references, changed the title; version 3 developed abstract and
  conclusions, accepted in JTPC","Journal of Theoretical Physics and Cryptography, Vol.3, July 2013,
  pp21-24",,KISU-MATH-2012-E-R-016,cs.CR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we proposed an identification and data encrypt key manage
protocol that can be used in some security system based on such secure devices
as secure USB memories or RFIDs, which are widely used for identifying persons
or other objects recently. In general, the default functions of the security
system using a mobile device are the authentication for the owner of the device
and secure storage of data stored on the device. We proposed a security model
that consists of the server and mobile devices in order to realize these
security features. In this model we defined the secure communication protocol
for the authentication and management of data encryption keys using a private
key encryption algorithm with the public key between the server and mobile
devices. In addition, we was performed the analysis for the attack to the
communication protocol between the mobile device and server. Using the
communication protocol, the system will attempt to authenticate the mobile
device. The data decrypt key is transmitted only if the authentication process
is successful. The data in the mobile device can be decrypted using the key.
Our analysis proved that this Protocol ensures anonymity, prevents replay
attacks and realizes the interactive identification between the security
devices and the authentication server.
","[{'version': 'v1', 'created': 'Tue, 23 Apr 2013 11:27:22 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Jun 2013 02:54:34 GMT'}, {'version': 'v3', 'created': 'Tue, 2 Jul 2013 10:06:30 GMT'}]",2013-07-08,"[['Kim', 'Chol-Un', ''], ['An', 'Dok-Jun', ''], ['Han', 'Song', '']]","['security', 'user authentication', 'identification protocol', 'data encrypt key', 'secure']"
18399,1403.6392,Arturo Tlaca\'elel Curiel D\'iaz,"Arturo Curiel, Christophe Collet","Implementation of an Automatic Sign Language Lexical Annotation
  Framework based on Propositional Dynamic Logic","Accepted in the ""LREC 2014: 6th Workshop on the Representation and
  Processing of Signed Languages""",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present the implementation of an automatic Sign Language
(SL) sign annotation framework based on a formal logic, the Propositional
Dynamic Logic (PDL). Our system relies heavily on the use of a specific variant
of PDL, the Propositional Dynamic Logic for Sign Language (PDLSL), which lets
us describe SL signs as formulae and corpora videos as labeled transition
systems (LTSs). Here, we intend to show how a generic annotation system can be
constructed upon these underlying theoretical principles, regardless of the
tracking technologies available or the input format of corpora. With this in
mind, we generated a development framework that adapts the system to specific
use cases. Furthermore, we present some results obtained by our application
when adapted to one distinct case, 2D corpora analysis with pre-processed
tracking information. We also present some insights on how such a technology
can be used to analyze 3D real-time data, captured with a depth device.
","[{'version': 'v1', 'created': 'Tue, 25 Mar 2014 15:36:36 GMT'}, {'version': 'v2', 'created': 'Mon, 31 Mar 2014 11:06:00 GMT'}]",2014-04-01,"[['Curiel', 'Arturo', ''], ['Collet', 'Christophe', '']]","['sign language framework', 'automatic annotation', 'propositional dynamic logic']"
18400,1307.2700,Zahed Rahmati,"Zahed Rahmati, Mohammad Ali Abam, Valerie King, and Sue Whitesides","Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors
  in R^d",,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a simple kinetic data structure for maintaining all the
nearest neighbors of a set of $n$ moving points in $\mathbb{R}^d$, where the
trajectory of each point is an algebraic function of at most constant degree
$s$. The approach is based on maintaining the edges of the Semi-Yao graph, a
sparse graph whose edge set includes the pairs of nearest neighbors as a
subset.
  Our kinetic data structure (KDS) for maintaining all the nearest neighbors is
deterministic. It processes $O(n^2\beta_{2s+2}^2(n)\log n)$ events with a total
cost of $O(n^2\beta_{2s+2}(n)\log^{d+1} n)$. Here, $\beta_s(n)$ is an extremely
slow-growing function. The best previous KDS for all the nearest neighbors in $
\mathbb{R}^d$ is by Agarwal, Kaplan, and Sharir (TALG 2008). It is a randomized
result. Our structure and analysis are simpler than theirs. Also, we improve
their result by a factor of $\log^d n$ in the number of events and by a $\log
n$ factor in the total cost.
  This paper generalizes and improves the 2013 work of Rahmati, King and
Whitesides (SoCG 2013) on maintaining the Semi-Yao graph in $\mathbb{R}^2$; its
new technique provides the first KDS for the Semi-Yao graph in $\mathbb{R}^d$.
Our KDS is local in the worst case, meaning that only a constant number of
events is associated with any one point at any time.
  For maintaining all the nearest neighbors, neither our KDS nor the KDS by
Agarwal~\etal~is local, and furthermore, each event in our KDS and in their KDS
is handled in polylogarithmic time in an amortized sense.
  Finally, in this paper, we also give a KDS for maintenance of all the
$(1+\epsilon)$-nearest neighbors which is local and each event can be handled
in a polylogarithmic worst-case time.
","[{'version': 'v1', 'created': 'Wed, 10 Jul 2013 07:13:38 GMT'}, {'version': 'v2', 'created': 'Sun, 14 Jul 2013 03:42:13 GMT'}, {'version': 'v3', 'created': 'Sun, 29 Sep 2013 23:08:03 GMT'}, {'version': 'v4', 'created': 'Fri, 15 Nov 2013 03:18:17 GMT'}]",2013-11-18,"[['Rahmati', 'Zahed', ''], ['Abam', 'Mohammad Ali', ''], ['King', 'Valerie', ''], ['Whitesides', 'Sue', '']]","['kinetic data structure', 'all nearest neighbors', 'Semi-Yao graph (theta graph)', 'range tree', 'closest pair', 'Rd']"
18401,1005.0990,David Sevilla,"David Sevilla, Daniel Wachsmuth",Polynomial integration on regions defined by a triangle and a conic,"8 pages, accepted by ISSAC 2010",,,,cs.SC math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an efficient solution to the following problem, of relevance in a
numerical optimization scheme: calculation of integrals of the type \[\iint_{T
\cap \{f\ge0\}} \phi_1\phi_2 \, dx\,dy\] for quadratic polynomials
$f,\phi_1,\phi_2$ on a plane triangle $T$. The naive approach would involve
consideration of the many possible shapes of $T\cap\{f\geq0\}$ (possibly after
a convenient transformation) and parameterizing its border, in order to
integrate the variables separately. Our solution involves partitioning the
triangle into smaller triangles on which integration is much simpler.
","[{'version': 'v1', 'created': 'Thu, 6 May 2010 12:55:28 GMT'}]",2010-05-07,"[['Sevilla', 'David', ''], ['Wachsmuth', 'Daniel', '']]","['symbolic integration', 'triangular subdivision', 'optimal control', 'variational discretization', 'quadratic shape functions']"
18402,1009.4981,S. M. Kamruzzaman,"Md. Abul Kalam Azad, Rezwana Sharmeen, Shabbir Ahmad, and S. M.
  Kamruzzaman",An Efficient Technique for Text Compression,"7 Pages, International Conference","Proc. International Conference on Information Management and
  Business (IMB 2005), Shih Chien University, Taiwan, pp. 467-473, Mar. 2005",,,cs.IT cs.IR math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For storing a word or the whole text segment, we need a huge storage space.
Typically a character requires 1 Byte for storing it in memory. Compression of
the memory is very important for data management. In case of memory requirement
compression for text data, lossless memory compression is needed. We are
suggesting a lossless memory requirement compression method for text data
compression. The proposed compression method will compress the text segment or
the text file based on two level approaches firstly reduction and secondly
compression. Reduction will be done using a word lookup table not using
traditional indexing system, then compression will be done using currently
available compression methods. The word lookup table will be a part of the
operating system and the reduction will be done by the operating system.
According to this method each word will be replaced by an address value. This
method can quite effectively reduce the size of persistent memory required for
text data. At the end of the first level compression with the use of word
lookup table, a binary file containing the addresses will be generated. Since
the proposed method does not use any compression algorithm in the first level
so this file can be compressed using the popular compression algorithms and
finally will provide a great deal of data compression on purely English text
data.
","[{'version': 'v1', 'created': 'Sat, 25 Sep 2010 06:49:28 GMT'}]",2010-09-28,"[['Azad', 'Md. Abul Kalam', ''], ['Sharmeen', 'Rezwana', ''], ['Ahmad', 'Shabbir', ''], ['Kamruzzaman', 'S. M.', '']]","['Text', 'reduction', 'compression', 'lookup table', 'size']"
18403,1005.1953,Sugata Sanyal,"Sandipan Dey, Hameed Al-Qaheri, Suneeta Sane, Sugata Sanyal","A Note On the Bounds for the Generalized Fibonacci-p-Sequence and its
  Application in Data-Hiding","15 Pages, 2 Figures, 2 Tables","International Journal of Computer Science and Applications, ISSN:
  0972-9038, Editor-in-Chief: Rajendra Akerkar, Vol. 7 No. 4, pp. 1 - 15,
  October, 2010, Published by: Technomathematics Research Foundation",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we suggest a lower and an upper bound for the Generalized
Fibonacci-p-Sequence, for different values of p. The Fibonacci-p-Sequence is a
generalization of the Classical Fibonacci Sequence. We first show that the
ratio of two consecutive terms in generalized Fibonacci sequence converges to a
p-degree polynomial and then use this result to prove the bounds for
generalized Fibonacci-p sequence, thereby generalizing the exponential bounds
for classical Fibonacci Sequence. Then we show how these results can be used to
prove efficiency for data hiding techniques using generalized Fibonacci
sequence. These steganographic techniques use generalized Fibonacci-p-Sequence
for increasing number available of bit-planes to hide data, so that more and
more data can be hidden into the higher bit-planes of any pixel without causing
much distortion of the cover image. This bound can be used as a theoretical
proof for efficiency of those techniques, for instance it explains why more and
more data can be hidden into the higher bit-planes of a pixel, without causing
considerable decrease in PSNR.
","[{'version': 'v1', 'created': 'Tue, 11 May 2010 21:23:42 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Oct 2010 10:42:11 GMT'}]",2016-11-25,"[['Dey', 'Sandipan', ''], ['Al-Qaheri', 'Hameed', ''], ['Sane', 'Suneeta', ''], ['Sanyal', 'Sugata', '']]","['Fibonacci-sequence', 'LSB Data-hiding', 'PSNR']"
18404,1208.3295,Preetha Theresa Joy,Preetha Theresa Joy and K. Poulose Jacob,"Cache Replacement Policies for Cooperative Caching in Mobile Ad hoc
  Networks","6 pages, 1 Table; IJCSI International Journal of Computer Science
  Issues, Vol. 9, Issue 3, No 2, May 2012 ISSN (Online): 1694-0814",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cooperative caching is a technique used in mobile ad hoc networks to improve
the efficiency of information access by reducing the access latency and
bandwidth usage. Cache replacement policy plays a significant role in response
time reduction by selecting suitable subset of items for eviction from the
cache. In this paper we have made a review of the existing cache replacement
algorithms proposed for cooperative caching in ad hoc networks. We made an
attempt to classify existing replacement policies for ad hoc networks based on
the replacement decision taken. In addition, this paper suggests some
alternative techniques for cache replacement. Finally, the paper concludes with
a discussion on future research directions.
","[{'version': 'v1', 'created': 'Thu, 16 Aug 2012 06:02:06 GMT'}]",2012-08-17,"[['Joy', 'Preetha Theresa', ''], ['Jacob', 'K. Poulose', '']]","['Data  Caching', 'Cache  Replacement', 'MANET', 'Cooperative caching']"
18405,0704.1274,Dev Rajnarayan,David H. Wolpert and Dev G. Rajnarayan,Parametric Learning and Monte Carlo Optimization,,,,,cs.LG,,"  This paper uncovers and explores the close relationship between Monte Carlo
Optimization of a parametrized integral (MCO), Parametric machine-Learning
(PL), and `blackbox' or `oracle'-based optimization (BO). We make four
contributions. First, we prove that MCO is mathematically identical to a broad
class of PL problems. This identity potentially provides a new application
domain for all broadly applicable PL techniques: MCO. Second, we introduce
immediate sampling, a new version of the Probability Collectives (PC) algorithm
for blackbox optimization. Immediate sampling transforms the original BO
problem into an MCO problem. Accordingly, by combining these first two
contributions, we can apply all PL techniques to BO. In our third contribution
we validate this way of improving BO by demonstrating that cross-validation and
bagging improve immediate sampling. Finally, conventional MC and MCO procedures
ignore the relationship between the sample point locations and the associated
values of the integrand; only the values of the integrand at those locations
are considered. We demonstrate that one can exploit the sample location
information using PL techniques, for example by forming a fit of the sample
locations to the associated values of the integrand. This provides an
additional way to apply PL techniques to improve MCO.
","[{'version': 'v1', 'created': 'Tue, 10 Apr 2007 17:01:07 GMT'}]",2011-11-09,"[['Wolpert', 'David H.', ''], ['Rajnarayan', 'Dev G.', '']]","['Monte Carlo Optimization', 'Black-box Optimization', 'Parametric Learning', 'Automated Annealing', 'Bias-variance-covariance']"
18406,1609.01187,Joaquin Torr\'e Zaffaroni,"Camilo Melani, Joaqu\'in Torr\'e Zaffaroni, Alejandro Hernandez, Juan
  Echag\""ue","An\'alisis de resultados electorales: comparaci\'on de m\'etodos y
  estimaci\'on de votos por franja etaria","6 pages, in Spanish, 3 figures",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The State and its citizens generate lots of data. Once stored and processed,
data can help resolve questions in Social Sciences, where it is common to need
data in a different level of aggregation than the data is presented. In
election results, we would like to understand the decision of each voter or
group of voters, but the data is only available at the polling-place level.
This problem is known as ecological inference. In this work we compare two
methods to estimate the share of votes for each party according to different
age groups. This work is complemented with the analysis of votes between the
first and second rounds, as well as a referendum during the first. This
analysis was performed on the 2014 uruguayan presidential elections.
","[{'version': 'v1', 'created': 'Mon, 5 Sep 2016 14:55:15 GMT'}]",2016-09-06,"[['Melani', 'Camilo', ''], ['Zaffaroni', 'Joaquín Torré', ''], ['Hernandez', 'Alejandro', ''], ['Echagüe', 'Juan', '']]","['Analytics', 'Big Data', 'Resultados electorales', 'Inferencia ecol´ogica']"
18407,1604.07759,Maxime Gasse,Maxime Gasse and Alex Aussem,"F-measure Maximization in Multi-Label Classification with Conditionally
  Independent Label Subsets",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We discuss a method to improve the exact F-measure maximization algorithm
called GFM, proposed in (Dembczynski et al. 2011) for multi-label
classification, assuming the label set can be can partitioned into
conditionally independent subsets given the input features. If the labels were
all independent, the estimation of only $m$ parameters ($m$ denoting the number
of labels) would suffice to derive Bayes-optimal predictions in $O(m^2)$
operations. In the general case, $m^2+1$ parameters are required by GFM, to
solve the problem in $O(m^3)$ operations. In this work, we show that the number
of parameters can be reduced further to $m^2/n$, in the best case, assuming the
label set can be partitioned into $n$ conditionally independent subsets. As
this label partition needs to be estimated from the data beforehand, we use
first the procedure proposed in (Gasse et al. 2015) that finds such partition
and then infer the required parameters locally in each label subset. The latter
are aggregated and serve as input to GFM to form the Bayes-optimal prediction.
We show on a synthetic experiment that the reduction in the number of
parameters brings about significant benefits in terms of performance.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2016 17:18:24 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Jun 2016 12:26:27 GMT'}, {'version': 'v3', 'created': 'Fri, 1 Jul 2016 13:17:01 GMT'}]",2016-07-04,"[['Gasse', 'Maxime', ''], ['Aussem', 'Alex', '']]","['Multi-label classification', 'F-measure', 'Bayes optimal prediction', 'label dependence']"
18408,1604.08723,Bob Sturm,"Bob L. Sturm, Jo\~ao Felipe Santos, Oded Ben-Tal and Iryna Korshunova",Music transcription modelling and composition using deep learning,"16 pages, 4 figures, contribution to 1st Conference on Computer
  Simulation of Musical Creativity",,,,cs.SD cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We apply deep learning methods, specifically long short-term memory (LSTM)
networks, to music transcription modelling and composition. We build and train
LSTM networks using approximately 23,000 music transcriptions expressed with a
high-level vocabulary (ABC notation), and use them to generate new
transcriptions. Our practical aim is to create music transcription models
useful in particular contexts of music composition. We present results from
three perspectives: 1) at the population level, comparing descriptive
statistics of the set of training transcriptions and generated transcriptions;
2) at the individual level, examining how a generated transcription reflects
the conventions of a music practice in the training transcriptions (Celtic
folk); 3) at the application level, using the system for idea generation in
music composition. We make our datasets, software and sound examples open and
available: \url{https://github.com/IraKorshunova/folk-rnn}.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2016 08:03:00 GMT'}]",2016-05-02,"[['Sturm', 'Bob L.', ''], ['Santos', 'João Felipe', ''], ['Ben-Tal', 'Oded', ''], ['Korshunova', 'Iryna', '']]","['Deep learning', 'recurrent neural network', 'music modelling', 'algorithmic composition']"
18409,1208.6268,Tanmoy Chakraborty,Tanmoy Chakraborty,Authorship Identification in Bengali Literature: a Comparative Analysis,"9 pages, 5 tables, 4 pictures","Chakraborty, T., Authorship Identification in Bengali Literature:
  a Comparative Analysis, Proceedings of COLING 2012: Demonstration Papers,
  December, 2012, pp. 41-50",,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stylometry is the study of the unique linguistic styles and writing behaviors
of individuals. It belongs to the core task of text categorization like
authorship identification, plagiarism detection etc. Though reasonable number
of studies have been conducted in English language, no major work has been done
so far in Bengali. In this work, We will present a demonstration of authorship
identification of the documents written in Bengali. We adopt a set of
fine-grained stylistic features for the analysis of the text and use them to
develop two different models: statistical similarity model consisting of three
measures and their combination, and machine learning model with Decision Tree,
Neural Network and SVM. Experimental results show that SVM outperforms other
state-of-the-art methods after 10-fold cross validations. We also validate the
relative importance of each stylistic feature to show that some of them remain
consistently significant in every model used in this experiment.
","[{'version': 'v1', 'created': 'Thu, 30 Aug 2012 19:09:24 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Aug 2012 19:34:18 GMT'}, {'version': 'v3', 'created': 'Thu, 6 Sep 2012 17:08:33 GMT'}, {'version': 'v4', 'created': 'Sun, 24 Feb 2013 09:27:56 GMT'}]",2013-02-26,"[['Chakraborty', 'Tanmoy', '']]","['Stylometry', 'Authorship Identification', 'Vocabulary Richness', 'MachineLearning']"
18410,1603.03520,Odessa Consorte,"Odessa D. Consorte, Lilibeth D. Valdez","On Euclidean and Hermitian Self-Dual Cyclic Codes over
  $\mathbb{F}_{2^r}$",,,,,cs.IT math.IT math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cyclic and self-dual codes are important classes of codes in coding theory.
Jia, Ling and Xing \cite{Jia} as well as Kai and Zhu \cite{Kai} proved that
Euclidean self-dual cyclic codes of length $n$ over $\mathbb{F}_q$ exist if and
only if $n$ is even and $q=2^r$, where $r$ is any positive integer. For $n$ and
$q$ even, there always exists an $[n, \frac{n}{2}]$ self-dual cyclic code with
generator polynomial $x^{\frac{n}{2}}+1$ called the \textit{trivial self-dual
cyclic code}. In this paper we prove the existence of nontrivial self-dual
cyclic codes of length $n=2^\nu \cdot \bar{n}$, where $\bar{n}$ is odd, over
$\mathbb{F}_{2^r}$ in terms of the existence of a nontrivial splitting $(Z,
X_0, X_1)$ of $\mathbb{Z}_{\bar{n}}$ by $\mu_{-1}$, where $Z, X_0,X_1$ are
unions of $2^r$-cyclotomic cosets mod $\bar{n}.$ We also express the formula
for the number of cyclic self-dual codes over $\mathbb{F}_{2^r}$ for each $n$
and $r$ in terms of the number of $2^r$-cyclotomic cosets in $X_0$ (or in
$X_1$).
  We also look at Hermitian self-dual cyclic codes and show properties which
are analogous to those of Euclidean self-dual cyclic codes. That is, the
existence of nontrivial Hermitian self-dual codes over $\mathbb{F}_{2^{2
\ell}}$ based on the existence of a nontrivial splitting $(Z, X_0, X_1)$ of
$\mathbb{Z}_{\bar{n}}$ by $\mu_{-2^\ell}$, where $Z, X_0,X_1$ are unions of
$2^{2 \ell}$-cyclotomic cosets mod $\bar{n}.$ We also determine the lengths at
which nontrivial Hermitian self-dual cyclic codes exist and the formula for the
number of Hermitian self-dual cyclic codes for each $n$.
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2016 05:04:14 GMT'}]",2016-03-14,"[['Consorte', 'Odessa D.', ''], ['Valdez', 'Lilibeth D.', '']]","['Cyclic codes', 'self-dual codes', 'splittings']"
18411,1007.2327,Michal Kryczka,"Ruben Cuevas, Michal Kryczka, Angel Cuevas, Sebastian Kaune, Carmen
  Guerrero, Reza Rejaie",Is Content Publishing in BitTorrent Altruistic or Profit-Driven,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  BitTorrent is the most popular P2P content delivery application where
individual users share various type of content with tens of thousands of other
users. The growing popularity of BitTorrent is primarily due to the
availability of valuable content without any cost for the consumers. However,
apart from required resources, publishing (sharing) valuable (and often
copyrighted) content has serious legal implications for user who publish the
material (or publishers). This raises a question that whether (at least major)
content publishers behave in an altruistic fashion or have other incentives
such as financial. In this study, we identify the content publishers of more
than 55k torrents in 2 major BitTorrent portals and examine their behavior. We
demonstrate that a small fraction of publishers are responsible for 66% of
published content and 75% of the downloads. Our investigations reveal that
these major publishers respond to two different profiles. On one hand,
antipiracy agencies and malicious publishers publish a large amount of fake
files to protect copyrighted content and spread malware respectively. On the
other hand, content publishing in BitTorrent is largely driven by companies
with financial incentive. Therefore, if these companies lose their interest or
are unable to publish content, BitTorrent traffic/portals may disappear or at
least their associated traffic will significantly reduce.
","[{'version': 'v1', 'created': 'Wed, 14 Jul 2010 13:40:22 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Jul 2010 10:56:31 GMT'}]",2010-07-23,"[['Cuevas', 'Ruben', ''], ['Kryczka', 'Michal', ''], ['Cuevas', 'Angel', ''], ['Kaune', 'Sebastian', ''], ['Guerrero', 'Carmen', ''], ['Rejaie', 'Reza', '']]","['BitTorrent', 'content publishing', 'business model']"
18412,0803.0528,Abdelhamid Mellouk,"Said Hoceini (LISSI - Ea 3956), Abdelhamid Mellouk (LISSI - Ea 3956),
  Hayet Hafi (LISSI - Ea 3956)","Une approche modulaire probabiliste pour le routage \`a Qualit\'e de
  Service int\'egr\'ee",,"Colloque Francophone sur l'Ing\'enierie des Protocoles (CFIP), Les
  Arcs : France (2008)",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to emerging real-time and multimedia applications, efficient routing of
information packets in dynamically changing communication network requires that
as the load levels, traffic patterns and topology of the network change, the
routing policy also adapts. We focused in this paper on QoS based routing by
developing a neuro-dynamic programming to construct dynamic state dependent
routing policies. We propose an approach based on adaptive algorithm for packet
routing using reinforcement learning which optimizes two criteria: cumulative
cost path and end-to-end delay. Numerical results obtained with OPNET simulator
for different packet interarrival times statistical distributions with
different levels of traffic's load show that the proposed approach gives better
results compared to standard optimal path routing algorithms.
","[{'version': 'v1', 'created': 'Tue, 4 Mar 2008 19:43:55 GMT'}]",2008-12-18,"[['Hoceini', 'Said', '', 'LISSI - Ea 3956'], ['Mellouk', 'Abdelhamid', '', 'LISSI - Ea 3956'], ['Hafi', 'Hayet', '', 'LISSI - Ea 3956']]","['Multi path Routing', 'Min. end-to-end delay', 'QoS Routing', 'Q-Routing', 'Reinforcement Learning']"
18413,1401.4714,Ronald Hochreiter,Ronald Hochreiter and Christoph Waldhauser,Revolutionary Algorithms,,Proceedings of BIOMA 2012: 37-48. 2012,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The optimization of dynamic problems is both widespread and difficult. When
conducting dynamic optimization, a balance between reinitialization and
computational expense has to be found. There are multiple approaches to this.
In parallel genetic algorithms, multiple sub-populations concurrently try to
optimize a potentially dynamic problem. But as the number of sub-population
increases, their efficiency decreases. Cultural algorithms provide a framework
that has the potential to make optimizations more efficient. But they adapt
slowly to changing environments. We thus suggest a confluence of these
approaches: revolutionary algorithms. These algorithms seek to extend the
evolutionary and cultural aspects of the former to approaches with a notion of
the political. By modeling how belief systems are changed by means of
revolution, these algorithms provide a framework to model and optimize dynamic
problems in an efficient fashion.
","[{'version': 'v1', 'created': 'Sun, 19 Jan 2014 18:27:41 GMT'}]",2014-01-21,"[['Hochreiter', 'Ronald', ''], ['Waldhauser', 'Christoph', '']]","['Genetic algorithm', 'cultural algorithm', 'dynamic optimization']"
18414,1603.05435,Rajeev Rajan,Rajeev Rajan and Hema A. Murthy,Modified Group Delay Based MultiPitch Estimation in Co-Channel Speech,,,,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Phase processing has been replaced by group delay processing for the
extraction of source and system parameters from speech. Group delay functions
are ill-behaved when the transfer function has zeros that are close to unit
circle in the z-domain. The modified group delay function addresses this
problem and has been successfully used for formant and monopitch estimation. In
this paper, modified group delay functions are used for multipitch estimation
in concurrent speech. The power spectrum of the speech is first flattened in
order to annihilate the system characteristics, while retaining the source
characteristics. Group delay analysis on this flattened spectrum picks the
predominant pitch in the first pass and a comb filter is used to filter out the
estimated pitch along with its harmonics. The residual spectrum is again
analyzed for the next candidate pitch estimate in the second pass. The final
pitch trajectories of the constituent speech utterances are formed using pitch
grouping and post processing techniques. The performance of the proposed
algorithm was evaluated on standard datasets using two metrics; pitch accuracy
and standard deviation of fine pitch error. Our results show that the proposed
algorithm is a promising pitch detection method in multipitch environment for
real speech recordings.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2016 11:35:09 GMT'}]",2016-03-18,"[['Rajan', 'Rajeev', ''], ['Murthy', 'Hema A.', '']]","['power spectrum', 'modified group delay', 'comb filter', 'spectrum estimation']"
18415,1412.7311,Renato Fabbri,Renato Fabbri,Versinus: a visualization method for graphs in evolution,"article written by request of research colleagues that appreciated
  these visualizations. arXiv admin note: text overlap with arXiv:1310.7769",,,,cs.SI physics.comp-ph physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents a novel visualization approach for dynamic graphs, the
versinus method, specially useful for real world networks exhibiting free-scale
properties. With a simple and fixed layout, and a small set of visual markups,
the method has been useful for understanding network dynamics. Local community
often suggests that it be reported, which motivated this article. Online
resources deliver videos and computer scripts for rendering new animations.
This article has a concise description of the method.
","[{'version': 'v1', 'created': 'Tue, 23 Dec 2014 10:38:16 GMT'}]",2014-12-30,"[['Fabbri', 'Renato', '']]","['complex networks', 'visualization', 'social network analysis', 'pattern recognition', 'statistics']"
18416,1307.0261,Bhavana Dalvi,"Bhavana Dalvi, William W. Cohen, and Jamie Callan","WebSets: Extracting Sets of Entities from the Web Using Unsupervised
  Information Extraction",10 pages; International Conference on Web Search and Data Mining 2012,,,,cs.LG cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a open-domain information extraction method for extracting
concept-instance pairs from an HTML corpus. Most earlier approaches to this
problem rely on combining clusters of distributionally similar terms and
concept-instance pairs obtained with Hearst patterns. In contrast, our method
relies on a novel approach for clustering terms found in HTML tables, and then
assigning concept names to these clusters using Hearst patterns. The method can
be efficiently applied to a large corpus, and experimental results on several
datasets show that our method can accurately extract large numbers of
concept-instance pairs.
","[{'version': 'v1', 'created': 'Mon, 1 Jul 2013 02:49:08 GMT'}]",2013-07-02,"[['Dalvi', 'Bhavana', ''], ['Cohen', 'William W.', ''], ['Callan', 'Jamie', '']]","['Web Mining', 'Clustering', 'Hyponymy RelationAcquisition']"
18417,1208.2076,Ryul Kim,"Ryul Kim, Myong-Son Sin, Ok-Hyon Song",Upper Bounds on the Number of Codewords of Some Separating Codes,"7 pages, in version 2 corrected typos","Journal of Theoretical Physics and Cryptography, 2013, Vol.2,
  pp17-20",,KISU-MATH-2012-E-R-001,cs.IT cs.CR math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Separating codes have their applications in collusion-secure fingerprinting
for generic digital data, while they are also related to the other structures
including hash family, intersection code and group testing. In this paper we
study upper bounds for separating codes. First, some new upper bound for
restricted separating codes is proposed. Then we illustrate that the Upper
Bound Conjecture for separating Reed-Solomon codes inherited from Silverberg's
question holds true for almost all Reed-Solomon codes.
","[{'version': 'v1', 'created': 'Fri, 10 Aug 2012 02:05:44 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Nov 2013 02:45:10 GMT'}]",2013-11-25,"[['Kim', 'Ryul', ''], ['Sin', 'Myong-Son', ''], ['Song', 'Ok-Hyon', '']]","['Separating Code', 'Fingerprinting', 'Silverberg’s Question']"
18418,1603.02641,Joelle Despeyroux,"Joelle Despeyroux (INRIA), Kaustuv Chaudhuri (PARSIFAL)",A Hybrid Linear Logic for Constrained Transition Systems,"LIPIcs. TYPES'2013, Apr 2013, Toulouse, France. Post-proceedings of
  TYPES'2013, 19th Intl Conference on Types for Proofs and Programs, LIPIcs.,
  26, pp.150-168, 2014. arXiv admin note: substantial text overlap with
  arXiv:1310.4310",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linear implication can represent state transitions, but real transition
systems operate under temporal, stochastic or probabilistic constraints that
are not directly representable in ordinary linear logic. We propose a general
modal extension of intuitionistic linear logic where logical truth is indexed
by constraints and hybrid connectives combine constraint reasoning with logical
reasoning. The logic has a focused cut-free sequent calculus that can be used
to internalize the rules of particular constrained transition systems; we
illustrate this with an adequate encoding of the synchronous stochastic
pi-calculus.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2016 19:51:23 GMT'}]",2016-03-09,"[['Despeyroux', 'Joelle', '', 'INRIA'], ['Chaudhuri', 'Kaustuv', '', 'PARSIFAL']]","['linear logic', 'hybrid logic', 'stochastic pi-calculus', 'focusing', 'adequacy']"
18419,1704.02965,Adrian Albert,Adrian Albert and Jasleen Kaur and Marta Gonzalez,"Using convolutional networks and satellite imagery to identify patterns
  in urban environments at a large scale","10 pages, 11 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Urban planning applications (energy audits, investment, etc.) require an
understanding of built infrastructure and its environment, i.e., both
low-level, physical features (amount of vegetation, building area and geometry
etc.), as well as higher-level concepts such as land use classes (which encode
expert understanding of socio-economic end uses). This kind of data is
expensive and labor-intensive to obtain, which limits its availability
(particularly in developing countries). We analyze patterns in land use in
urban neighborhoods using large-scale satellite imagery data (which is
available worldwide from third-party providers) and state-of-the-art computer
vision techniques based on deep convolutional neural networks. For supervision,
given the limited availability of standard benchmarks for remote-sensing data,
we obtain ground truth land use class labels carefully sampled from open-source
surveys, in particular the Urban Atlas land classification dataset of $20$ land
use classes across $~300$ European cities. We use this data to train and
compare deep architectures which have recently shown good performance on
standard computer vision tasks (image classification and segmentation),
including on geospatial data. Furthermore, we show that the deep
representations extracted from satellite imagery of urban environments can be
used to compare neighborhoods across several cities. We make our dataset
available for other machine learning researchers to use for remote-sensing
applications.
","[{'version': 'v1', 'created': 'Mon, 10 Apr 2017 17:42:37 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Sep 2017 20:09:46 GMT'}]",2017-09-15,"[['Albert', 'Adrian', ''], ['Kaur', 'Jasleen', ''], ['Gonzalez', 'Marta', '']]","['Satellite imagery', 'land use classifcation', 'convolutional networks']"
18420,1611.01228,Deepika Punj,Deepika and Ashutosh Dixit,URL ordering policies for distributed crawlers: a review,"6 Pages, 5 figures, 1 Table, International Conference on Recent
  Trends in Computer and Information Technology Research September 2015",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the increase in size of web, the information is also spreading at large
scale. Search Engines are the medium to access this information. Crawler is the
module of search engine which is responsible for download the web pages. In
order to download the fresh information and get the database rich, crawler
should crawl the web in some order. This is called as ordering of URLs. URL
ordering should be done in efficient and effective manner in order to crawl the
web in proficient manner. In this paper, a survey is done on some existing
methods of URL ordering and at the end of this paper comparison is also carried
out among them.
","[{'version': 'v1', 'created': 'Wed, 30 Dec 2015 10:11:56 GMT'}]",2016-11-07,"[['Deepika', '', ''], ['Dixit', 'Ashutosh', '']]","['URL ordering', 'URL structure', 'hashing', 'task', 'link count', 'clustering']"
18421,1402.6690,Jalal Mahmud,"Jalal Mahmud, Jilin Chen, Jeffrey Nichols",Why Are You More Engaged? Predicting Social Engagement from Word Use,,,,,cs.SI cs.CL cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a study to analyze how word use can predict social engagement
behaviors such as replies and retweets in Twitter. We compute psycholinguistic
category scores from word usage, and investigate how people with different
scores exhibited different reply and retweet behaviors on Twitter. We also
found psycholinguistic categories that show significant correlations with such
social engagement behaviors. In addition, we have built predictive models of
replies and retweets from such psycholinguistic category based features. Our
experiments using a real world dataset collected from Twitter validates that
such predictions can be done with reasonable accuracy.
","[{'version': 'v1', 'created': 'Wed, 26 Feb 2014 20:58:00 GMT'}]",2014-02-27,"[['Mahmud', 'Jalal', ''], ['Chen', 'Jilin', ''], ['Nichols', 'Jeffrey', '']]","['Word Use', 'Social Engagement', 'Psycholinguistic']"
18422,1607.04243,Thomas Bamford,"Thomas Bamford, Kamran Esmaeili, Angela P. Schoellig",A real-time analysis of rock fragmentation using UAV technology,"12 pages, 12 figures, 6th International Conference on Computer
  Applications in the Minerals Industries",,,,cs.RO cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate measurement of blast-induced rock fragmentation is of great
importance for many mining operations. The post-blast rock size distribution
can significantly influence the efficiency of all the downstream mining and
comminution processes. Image analysis methods are one of the most common
methods used to measure rock fragment size distribution in mines regardless of
criticism for lack of accuracy to measure fine particles and other perceived
deficiencies. The current practice of collecting rock fragmentation data for
image analysis is highly manual and provides data with low temporal and spatial
resolution. Using UAVs for collecting images of rock fragments can not only
improve the quality of the image data but also automate the data collection
process. Ultimately, real-time acquisition of high temporal- and
spatial-resolution data based on UAV technology will provide a broad range of
opportunities for both improving blast design without interrupting the
production process and reducing the cost of the human operator. This paper
presents the results of a series of laboratory-scale rock fragment measurements
using a quadrotor UAV equipped with a camera. The goal of this work is to
highlight the benefits of aerial fragmentation analysis in terms of both
prediction accuracy and time effort. A pile of rock fragments with different
fragment sizes was placed in a lab that is equipped with a motion capture
camera system for precise UAV localization and control. Such an environment
presents optimal conditions for UAV flight and thus, is well-suited for
conducting proof-of-concept experiments before testing them in large-scale
field experiments. The pile was photographed by a camera attached to the UAV,
and the particle size distribution curves were generated in almost real-time.
The pile was also manually photographed and the results of the manual method
were compared to the UAV method.
","[{'version': 'v1', 'created': 'Thu, 14 Jul 2016 18:47:18 GMT'}]",2016-07-15,"[['Bamford', 'Thomas', ''], ['Esmaeili', 'Kamran', ''], ['Schoellig', 'Angela P.', '']]","['drone', 'unmanned aerial vehicle', 'UAV', 'real-time analysis', 'rock fragmentation analysis', 'blasting']"
18423,1208.5429,Hajime Matsui,Hajime Matsui,"Fast Erasure-and-Error Decoding and Systematic Encoding of a Class of
  Affine Variety Codes","6 pages, 2 columns, presented at The 34th Symposium on Information
  Theory and Its Applications (SITA2011)",,,,cs.IT cs.DM math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a lemma in algebraic coding theory is established, which is
frequently appeared in the encoding and decoding for algebraic codes such as
Reed-Solomon codes and algebraic geometry codes. This lemma states that two
vector spaces, one corresponds to information symbols and the other is indexed
by the support of Grobner basis, are canonically isomorphic, and moreover, the
isomorphism is given by the extension through linear feedback shift registers
from Grobner basis and discrete Fourier transforms. Next, the lemma is applied
to fast unified system of encoding and decoding erasures and errors in a
certain class of affine variety codes.
","[{'version': 'v1', 'created': 'Mon, 27 Aug 2012 16:15:56 GMT'}]",2012-08-28,"[['Matsui', 'Hajime', '']]","['Berlekamp–Massey–Sakata algorithm', 'Gr¨obnerbasis', 'discrete Fourier transforms', 'order domain codes', 'evaluation codes']"
18424,1005.0220,Olivier Teste,Olivier Teste (IRIT),Elaboration d'entrep\^ots de donn\'ees complexes,,"congr\`es INFormatique des ORganisations et Syst\`emes
  d'Information et de D\'ecision - INFORSID'00, Lyon : France (2000)",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the data warehouse modelling used in decision support
systems. We provide an object-oriented data warehouse model allowing data
warehouse description as a central repository of relevant, complex and temporal
data. Our model integrates three concepts such as warehouse object, environment
and warehouse class. Each warehouse object is composed of one current state,
several past states (modelling its detailed evolutions) and several archive
states (modelling its evolutions within a summarised form). The environment
concept defines temporal parts in the data warehouse schema with significant
granularities (attribute, class, graph). Finally, we provide five functions
aiming at defining the data warehouse structures and two functions allowing the
warehouse class inheritance hierarchy organisation.
","[{'version': 'v1', 'created': 'Mon, 3 May 2010 07:49:14 GMT'}]",2010-05-20,"[['Teste', 'Olivier', '', 'IRIT']]","['Warehouse modelling', 'object-oriented model', 'complex temporal data']"
18425,0708.0604,L.T. Handoko,T.B. Waluyo and L.T. Handoko,Introducing OPTO : Portal for Optical Communities in Indonesia,"3 pages, Proceeding of the 2nd International Conf. on Optics and
  Laser Applications 2007",,,FISIKALIPI-07006,cs.CY,,"  Since January 1, 2005 we have launched ""OPTO"" Portal, a website dedicated to
optical communities in Indonesia. The address of this portal is
http://www.opto.lipi.go.id and is self-supporting managed and not for
commercial purposes. Our aims in launching this portal are to benefit Internet
facility in increasing the communities' scientific activity; to provide an
online reference in Indonesian language for optics-based science and technology
subjects; as well as to pioneer the communities' online activities with real
impacts and benefits for our society. We will describe in the paper the
features of this portal that can be utilized by all individuals or members of
optical communities to store and share information and to build networks or
partnership as well. We realized that this portal is still not popular and most
of our aims are still not reached. This conference should be a good place for
all of us to collaborate to properly utilize this portal for the advantages to
the optical communities in Indonesia and our society at large.
","[{'version': 'v1', 'created': 'Sat, 4 Aug 2007 05:16:10 GMT'}]",2007-08-07,"[['Waluyo', 'T. B.', ''], ['Handoko', 'L. T.', '']]","['Internet facility', 'scientific portal', 'online activity', 'optical communities', 'collaboration']"
18426,1610.05932,Emanuele Bellini,"Emanuele Bellini, Teo Mora, Massimiliano Sala","An algorithmic approach using multivariate polynomials for the
  nonlinearity of Boolean functions",arXiv admin note: substantial text overlap with arXiv:1404.2741,,,,cs.IT math.AC math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The nonlinearity of a Boolean function is a key property in deciding its
suitability for cryptographic purposes, e.g. as a combining function in stream
ciphers, and so the nonlinearity computation is an important problem for
applications. Traditional methods to compute the nonlinearity are based on
transforms, such as the Fast Walsh Transform. In 2007 Simonetti proposed a
method to solve the above problem seen as a decision problem on the existence
of solutions for some multivariate polynomial systems. Although novel as
approach, her algorithm suffered from a direct application of Groebner bases
and was thus impractical. We now propose two more practical approaches, one
that determines the existence of solutions for Simonetti's systems in a faster
way and another that writes similar systems but over fields with a different
characteristics. For our algorithms we provide an efficient implementation in
the software package MAGMA.
","[{'version': 'v1', 'created': 'Wed, 19 Oct 2016 09:36:01 GMT'}]",2016-10-20,"[['Bellini', 'Emanuele', ''], ['Mora', 'Teo', ''], ['Sala', 'Massimiliano', '']]","['Boolean function', 'Cryptography', 'multivariate polynomials', 'Gröbner bases']"
18427,1701.01477,Evgeniy Abramov G.,E. G. Abramov,Unconstrained inverse quadratic programming problem,7 pages with 1 Octave script,,,,cs.NA math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper covers a formulation of the inverse quadratic programming problem
in terms of unconstrained optimization where it is required to find the unknown
parameters (the matrix of the quadratic form and the vector of the quasi-linear
part of the quadratic form) provided that approximate estimates of the optimal
solution of the direct problem and those of the target function to be minimized
in the form of pairs of values lying in the corresponding neighborhoods are
only known. The formulation of the inverse problem and its solution are based
on the least squares method. In the explicit form the inverse problem solution
has been derived in the form a system of linear equations. The parameters
obtained can be used for reconstruction of the direct quadratic programming
problem and determination of the optimal solution and the extreme value of the
target function, which were not known formerly. It is possible this approach
opens new ways in over applications, for example, in neurocomputing and quadric
surfaces fitting. Simple numerical examples have been demonstrated. A scenario
in the Octave/MATLAB programming language has been proposed for practical
implementation of the method.
","[{'version': 'v1', 'created': 'Wed, 4 Jan 2017 15:48:59 GMT'}]",2017-01-09,"[['Abramov', 'E. G.', '']]","['inverse problem', 'quadratic programming problem', 'least squares method', 'quadric surfaces fitting']"
18428,1606.09458,Maryam Sabzevari,"Maryam Sabzevari, Gonzalo Mart\'inez-Mu\~noz, Alberto Su\'arez",Vote-boosting ensembles,,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vote-boosting is a sequential ensemble learning method in which the
individual classifiers are built on different weighted versions of the training
data. To build a new classifier, the weight of each training instance is
determined in terms of the degree of disagreement among the current ensemble
predictions for that instance. For low class-label noise levels, especially
when simple base learners are used, emphasis should be made on instances for
which the disagreement rate is high. When more flexible classifiers are used
and as the noise level increases, the emphasis on these uncertain instances
should be reduced. In fact, at sufficiently high levels of class-label noise,
the focus should be on instances on which the ensemble classifiers agree. The
optimal type of emphasis can be automatically determined using
cross-validation. An extensive empirical analysis using the beta distribution
as emphasis function illustrates that vote-boosting is an effective method to
generate ensembles that are both accurate and robust.
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2016 12:24:04 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Feb 2018 12:31:01 GMT'}]",2018-02-22,"[['Sabzevari', 'Maryam', ''], ['Martínez-Muñoz', 'Gonzalo', ''], ['Suárez', 'Alberto', '']]","['Ensemble learning', 'boosting', 'uncertainty-based emphasis']"
18429,1504.05830,Bert Besser,Bert Besser and Bastian Werth,On the Approximation Performance of Degree Heuristics for Matching,v2: added inapproximability bounds for two-sided algorithms,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the design of greedy algorithms for the maximum cardinality matching
problem the utilization of degree information when selecting the next edge is a
well established and successful approach.
  We define the class of ""degree sensitive"" greedy matching algorithms, which
allows us to analyze many well-known heuristics, and provide tight
approximation guarantees under worst case tie breaking. We exhibit algorithms
in this class with optimal approximation guarantee for bipartite graphs. In
particular the Karp-Sipser algorithm, which picks an edge incident with a
degree-1 node if possible and otherwise an arbitrary edge, turns out to be
optimal with approximation guarantee D/(2D-2), where D is the maximum degree.
","[{'version': 'v1', 'created': 'Wed, 22 Apr 2015 14:45:32 GMT'}, {'version': 'v2', 'created': 'Tue, 20 Dec 2016 11:54:24 GMT'}]",2016-12-21,"[['Besser', 'Bert', ''], ['Werth', 'Bastian', '']]","['matching', 'greedy', 'approximation', 'priority algorithms']"
18430,1702.03226,Bernardo Furtado,Bernardo Alves Furtado and Isaque Daniel Eberhardt Rocha,"An applied spatial agent-based model of administrative boundaries using
  SEAL","11 pages. 4 figures. Accepted ABMUS 2017 as part of AAMAS 2017, S\~ao
  Paulo, Brazil",,,,cs.MA q-fin.EC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper extends and adapts an existing abstract model into an empirical
metropolitan region in Brazil. The model - named SEAL: a Spatial Economic
Agent-based Lab - comprehends a framework to enable public policy ex-ante
analysis. The aim of the model is to use official data and municipalities
spatial boundaries to allow for policy experimentation. The current version
considers three markets: housing, labor and goods. Families' members age,
consume, join the labor market and trade houses. A single consumption tax is
collected by municipalities that invest back into quality of life improvements.
We test whether a single metropolitan government - which is an aggregation of
municipalities - would be in the best interest of its citizens. Preliminary
results for 20 simulation runs indicate that it may be the case. Future
developments include improving performance to enable running of higher
percentage of the population and a number of runs that make the model more
robust.
","[{'version': 'v1', 'created': 'Fri, 10 Feb 2017 15:53:45 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Mar 2017 11:29:52 GMT'}]",2017-03-27,"[['Furtado', 'Bernardo Alves', ''], ['Rocha', 'Isaque Daniel Eberhardt', '']]","['Agent-based model', 'Public Policy', 'Spatial modeling', 'Metropolitan regions', 'Public Finances']"
18431,1009.3448,Kapil Vhatkar kapil vhatkar,"Kapil N. Vhatkar, G. P. Bhole",Internal Location Based System for Mobile Devices Using Passive RFID,"7 pages IEEE format. The original authors of this paper Lect. kapil
  N. Vhatkar & Prof. G. P. Bhole claim for the ownership of the said paper so
  IJCSIS modified authors of the said paper.
  http://sites.google.com/site/ijcsis/vol-6-no-3-december-2009. arXiv admin
  note: this article was plagiarized by arXiv:1001.2258","International Journal of Computer Science and Information
  Security, IJCSIS December 2009, ISSN 1947 5500",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We have explored our own innovative work about the design & development of
internal location-identification system for mobile devices based on integration
of RFID and wireless technology. The function of our system is based on
strategically located passive RFID tags placed on objects around building which
are identified using an RFID reader attached to a mobile device. The mobile
device reads the RFID tag and through the wireless network, sends the request
to the server. The server resolves the request and sends the desired
location-based information back to the mobile device. We had addressed that we
can go through the RFID technology for internal location identification
(indoor), which provides us better location accuracy because of no contact
between the tag and the reader, and the system requires no line of sight. In
this paper we had also focused on the issues of RFID technologies i.e.
Non-line-of-sight & High inventory speeds.
","[{'version': 'v1', 'created': 'Thu, 16 Sep 2010 06:50:56 GMT'}]",2011-11-15,"[['Vhatkar', 'Kapil N.', ''], ['Bhole', 'G. P.', '']]","['Location Based Services', 'RFID', 'J2ME']"
18432,1205.5921,Noreddine Gherabi,"Hakim El Massari, Zineb Sabouri, Sajida Mhammedi, and Noreddine
  Gherabi",Diabetes prediction using Machine Learning algorithms and ontology,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Diabetes is one of the chronic diseases, which is increasing from year to
year. The problems begin when diabetes is not detected at an early phase and
diagnosed properly at the appropriate time. Different machine learning
techniques, as well as ontology-based ML techniques, have recently played an
important role in medical science by developing an automated system that can
detect diabetes patients. This paper provides a comparative study and review of
the most popular machine learning techniques and ontology-based Machine
Learning classification. Various types of classification algorithms were
considered namely: SVM, KNN, ANN, Naive Bayes, Logistic regression, and
Decision Tree. The results are evaluated based on performance metrics like
Recall, Accuracy, Precision, and F-Measure that are derived from the confusion
matrix. The experimental results showed that the best accuracy goes for
ontology classifiers and SVM.
","[{'version': 'v1', 'created': 'Sat, 26 May 2012 22:37:10 GMT'}, {'version': 'v2', 'created': 'Tue, 19 Jul 2022 12:16:30 GMT'}]",2022-07-20,"[['Massari', 'Hakim El', ''], ['Sabouri', 'Zineb', ''], ['Mhammedi', 'Sajida', ''], ['Gherabi', 'Noreddine', '']]","['Machine Learning', 'Ontology', 'Diabetes', 'Prediction']"
18433,1610.00841,Muhammad Farooq-i-Azam,"Muhammad Farooq-i-Azam, Muhammad Naeem Ayyaz","Parameters Differentiating the Characteristics and Security of Military
  Information Systems",,,,,cs.CR cs.CY cs.SY,http://creativecommons.org/publicdomain/zero/1.0/,"  Revolution in the area of information technology has brought about changes in
many spheres of life. Today, information systems are being used in very
sensitive areas such as defence and missile control systems, nuclear plants,
etc. Not only has it changed how business is conducted, it has also brought
about entirely new paradigms like that of information and cyber warfare.
Similarly, one of the many impacts that it has made, is how wars are fought.
For all what it has contributed, the information stored on digital devices and
computers has become a precious resource and special measures are taken to
guard it against attacks from malicious users. These special measures are
needed by any enterprise be it a business firm, a commercial entity, a
government agency or a military organization. However, requirements and
specifications for information security and assurance for a military
organization are essentially different from those of commercial or business
applications. This paper highlights and discusses various aspects related to
the security of information resources of military importance and outlines
certain parameters that should be taken into consideration when talking about
the security of military information resources. W also describe the role
satellite reconnaissance can play in cyber war. Authors proclaim that this
paper is first such attempt to correlate cyber war with satellite
reconnaissance.
","[{'version': 'v1', 'created': 'Tue, 4 Oct 2016 04:52:10 GMT'}]",2016-10-05,"[['Farooq-i-Azam', 'Muhammad', ''], ['Ayyaz', 'Muhammad Naeem', '']]","['Military information systems', 'cyber warfare', 'cyber arms', 'information warfare']"
18434,1306.4094,Mohammadi Akheela Khanum Mrs,"Mohammadi Akheela Khanum, Munesh C. Trivedi","Exploring Verbalization and Collaboration during Usability Evaluation
  with Children in Context",7 pages. arXiv admin note: text overlap with arXiv:1204.2138,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate the effect of context on usability evaluation.
The focus is on how children behave and perform when they are tested in
different settings. Two most commonly applied usability evaluation methods: the
think-aloud and constructive interactions are applied to the children in
different physical contexts. We present an experimental design involving 54
children participating in two different configurations of constructive
interaction and a traditional think-aloud. The behavior and performance of the
children in two different physical contexts is measured by evaluating the
results of application of think-aloud and constructive interaction. Finally, we
outline lessons on the impact of context on involving children in usability
testing.
","[{'version': 'v1', 'created': 'Tue, 18 Jun 2013 08:03:11 GMT'}]",2013-06-19,"[['Khanum', 'Mohammadi Akheela', ''], ['Trivedi', 'Munesh C.', '']]","['usability evaluation', 'children', 'physical context', 'think-aloud', 'constructive interaction']"
18435,1610.00434,Muhammad Farooq-i-Azam,"Muhammad Salman Raheel, Muhammad Raza Asfi, Muhammad Farooq-i-Azam,
  H.R. Shaukat, Jaweria Shafqat","Wireless Authentication System for Barcode Scanning Using Infrared
  Communication Technique",,,,,cs.CR,http://creativecommons.org/publicdomain/zero/1.0/,"  This paper presents the verified methodology for wireless authentication
system using infrared barcode based scanner. An alternate approach of scanning
a barcode using an infrared communication is implemented here, comprises of a
card on which a barcode is printed is illuminated with an infrared beam. The
reflections from the card are received by an infrared receiver and transmit
them to a remote machine over wireless channel where the retrieve information
is further processed and converted into the corresponding barcode digits which
are further matched against the database stored in the server and the
authenticity of the user is established. The system developed is
cost-effective, efficient, provide double security and robust.
","[{'version': 'v1', 'created': 'Mon, 3 Oct 2016 07:44:42 GMT'}]",2016-10-04,"[['Raheel', 'Muhammad Salman', ''], ['Asfi', 'Muhammad Raza', ''], ['Farooq-i-Azam', 'Muhammad', ''], ['Shaukat', 'H. R.', ''], ['Shafqat', 'Jaweria', '']]","['Infrared Communication', 'Barcodes', 'Wireless', 'VC++']"
18436,1304.0513,"Mika G\""o\""os","Magnus Find, Mika G\""o\""os, Matti J\""arvisalo, Petteri Kaski, Mikko
  Koivisto, Janne H. Korhonen","Separating OR, SUM, and XOR Circuits","1 + 16 pages, 2 figures. In this version we have improved the
  presentation following comments made by Stasys Jukna and Igor Sergeev",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a boolean n by n matrix A we consider arithmetic circuits for computing
the transformation x->Ax over different semirings. Namely, we study three
circuit models: monotone OR-circuits, monotone SUM-circuits (addition of
non-negative integers), and non-monotone XOR-circuits (addition modulo 2). Our
focus is on \emph{separating} these models in terms of their circuit
complexities. We give three results towards this goal:
  (1) We prove a direct sum type theorem on the monotone complexity of tensor
product matrices. As a corollary, we obtain matrices that admit OR-circuits of
size O(n), but require SUM-circuits of size \Omega(n^{3/2}/\log^2n).
  (2) We construct so-called \emph{k-uniform} matrices that admit XOR-circuits
of size O(n), but require OR-circuits of size \Omega(n^2/\log^2n).
  (3) We consider the task of \emph{rewriting} a given OR-circuit as a
XOR-circuit and prove that any subquadratic-time algorithm for this task
violates the strong exponential time hypothesis.
","[{'version': 'v1', 'created': 'Tue, 2 Apr 2013 01:25:48 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Apr 2013 02:03:17 GMT'}]",2013-04-24,"[['Find', 'Magnus', ''], ['Göös', 'Mika', ''], ['Järvisalo', 'Matti', ''], ['Kaski', 'Petteri', ''], ['Koivisto', 'Mikko', ''], ['Korhonen', 'Janne H.', '']]","['arithmetic circuits', 'boolean arithmetic', 'idempotent arithmetic', 'monotone separations', 'rewriting']"
18437,1704.03324,Luis Veiga,Duarte Patr\'icio and Jos\'e Sim\~ao and Lu\'is Veiga,"Gang-GC: Locality-aware Parallel Data Placement Optimizations for
  Key-Value Storages",,,,"INESC-ID Tec. Rep. 5/2017, Feb 2017",cs.PL cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many cloud applications rely on fast and non-relational storage to aid in the
processing of large amounts of data. Managed runtimes are now widely used to
support the execution of several storage solutions of the NoSQL movement,
particularly when dealing with big data key-value store-driven applications.
The benefits of these runtimes can however be limited by modern parallel
throughput-oriented GC algorithms, where related objects have the potential to
be dispersed in memory, either in the same or different generations. In the
long run this causes more page faults and degradation of locality on
system-level memory caches.
  We propose, Gang-CG, an extension to modern heap layouts and to a parallel GC
algorithm to promote locality between groups of related objects. This is done
without extensive profiling of the applications and in a way that is
transparent to the programmer, without the need to use specialized data
structures. The heap layout and algorithmic extensions were implemented over
the Parallel Scavenge garbage collector of the HotSpot JVM\@.
  Using microbenchmarks that capture the architecture of several key-value
stores databases, we show negligible overhead in frequent operations such as
the allocation of new objects and improvements to the access speed of data,
supported by lower misses in system-level memory caches. Overall, we show a 6\%
improvement in the average time of read and update operations and an average
decrease of 12.4\% in page faults.
","[{'version': 'v1', 'created': 'Tue, 11 Apr 2017 14:44:29 GMT'}]",2017-04-12,"[['Patrício', 'Duarte', ''], ['Simão', 'José', ''], ['Veiga', 'Luís', '']]","['JVM', 'Garbage Collection', 'Locality-aware']"
18438,1306.1335,Hedi Raggad,"H. Raggad, M. Latrach, A. Gharsallah and T. Razban","A Compact Dual Band Dielectric Resonator Antenna For Wireless
  Applications",IJCNC 2013,,,,cs.OH,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper presents the design of a dual band rectangular Dielectric
Resonator Antenna (DRA) coupled to narrow slot aperture that is fed by
microstrip line. The fundamental TE111 mode and higher-order TE113 mode are
excited with their resonant frequencies respectively. These frequencies can be
controlled by changing the DRA dimensions. A dielectric resonator with high
permittivity is used to miniaturize the global structure. The proposed antenna
is designed to have dual band operation suitable for both DCS (1710 - 1880 MHz)
and WLAN (2400 - 2484 MHz) applications. The return loss, radiation pattern and
gain of the proposed antenna are evaluated. Reasonable agreement between
simulation and experimental results is obtained.
","[{'version': 'v1', 'created': 'Thu, 6 Jun 2013 08:21:18 GMT'}]",2013-06-07,"[['Raggad', 'H.', ''], ['Latrach', 'M.', ''], ['Gharsallah', 'A.', ''], ['Razban', 'T.', '']]","['DRA', 'Dual Band', 'DCS and WLAN']"
18439,1404.0640,Akin Osman Kazakci,Akin Osman Kazakci (CGS),Conceptive Artificial Intelligence: Insights from design theory,,"International Design Conference DESIGN2014, Croatia (2014)",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The current paper offers a perspective on what we term conceptive
intelligence - the capacity of an agent to continuously think of new object
definitions (tasks, problems, physical systems, etc.) and to look for methods
to realize them. The framework, called a Brouwer machine, is inspired by
previous research in design theory and modeling, with its roots in the
constructivist mathematics of intuitionism. The dual constructivist perspective
we describe offers the possibility to create novelty both in terms of the types
of objects and the methods for constructing objects. More generally, the
theoretical work on which Brouwer machines are based is called imaginative
constructivism. Based on the framework and the theory, we discuss many
paradigms and techniques omnipresent in AI research and their merits and
shortcomings for modeling aspects of design, as described by imaginative
constructivism. To demonstrate and explain the type of creative process
expressed by the notion of a Brouwer machine, we compare this concept with a
system using genetic algorithms for scientific law discovery.
","[{'version': 'v1', 'created': 'Wed, 2 Apr 2014 18:06:40 GMT'}]",2014-04-03,"[['Kazakci', 'Akin Osman', '', 'CGS']]","['artificial intelligence', 'design', 'design creativity', 'artificial creativity']"
18440,1109.3781,Zhongkui Li,"Zhongkui Li, Zhisheng Duan, Lihua Xie, Xiangdong Liu","Distributed Robust Control of Linear Multi-Agent Systems with Parameter
  Uncertainties","17 pages, 3 figures. Submitted to International Journal of Robust and
  Nonlinear Control",,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the distributed robust control problems of uncertain
linear multi-agent systems with undirected communication topologies. It is
assumed that the agents have identical nominal dynamics while subject to
different norm-bounded parameter uncertainties, leading to weakly heterogeneous
multi-agent systems. Distributed controllers are designed for both continuous-
and discrete-time multi-agent systems, based on the relative states of
neighboring agents and a subset of absolute states of the agents. It is shown
for both the continuous- and discrete-time cases that the distributed robust
control problems under such controllers in the sense of quadratic stability are
equivalent to the $H_\infty$ control problems of a set of decoupled linear
systems having the same dimensions as a single agent. A two-step algorithm is
presented to construct the distributed controller for the continuous-time case,
which does not involve any conservatism and meanwhile decouples the feedback
gain design from the communication topology. Furthermore, a sufficient
existence condition in terms of linear matrix inequalities is derived for the
distributed discrete-time controller. Finally, the distributed robust
$H_\infty$ control problems of uncertain linear multi-agent systems subject to
external disturbances are discussed.
","[{'version': 'v1', 'created': 'Sat, 17 Sep 2011 14:01:20 GMT'}]",2011-09-20,"[['Li', 'Zhongkui', ''], ['Duan', 'Zhisheng', ''], ['Xie', 'Lihua', ''], ['Liu', 'Xiangdong', '']]","['Multi-agent system', 'distributed control', 'robustness', 'H∞ control', 'parameter uncertainty']"
18441,1409.2826,Guofeng Cao,"Guofeng Cao, Shaowen Wang, Myunghwa Hwang, Anand Padmanabhan, Zhenhua
  Zhang, Kiumars Soltani","A Scalable Framework for Spatiotemporal Analysis of Location-based
  Social Media Data",,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the past several years, social media (e.g., Twitter and Facebook) has been
experiencing a spectacular rise and popularity, and becoming a ubiquitous
discourse for content sharing and social networking. With the widespread of
mobile devices and location-based services, social media typically allows users
to share whereabouts of daily activities (e.g., check-ins and taking photos),
and thus strengthens the roles of social media as a proxy to understand human
behaviors and complex social dynamics in geographic spaces. Unlike conventional
spatiotemporal data, this new modality of data is dynamic, massive, and
typically represented in stream of unstructured media (e.g., texts and photos),
which pose fundamental representation, modeling and computational challenges to
conventional spatiotemporal analysis and geographic information science. In
this paper, we describe a scalable computational framework to harness massive
location-based social media data for efficient and systematic spatiotemporal
data analysis. Within this framework, the concept of space-time trajectories
(or paths) is applied to represent activity profiles of social media users. A
hierarchical spatiotemporal data model, namely a spatiotemporal data cube
model, is developed based on collections of space-time trajectories to
represent the collective dynamics of social media users across aggregation
boundaries at multiple spatiotemporal scales. The framework is implemented
based upon a public data stream of Twitter feeds posted on the continent of
North America. To demonstrate the advantages and performance of this framework,
an interactive flow mapping interface (including both single-source and
multiple-source flow mapping) is developed to allow real-time, and interactive
visual exploration of movement dynamics in massive location-based social media
at multiple scales.
","[{'version': 'v1', 'created': 'Mon, 8 Sep 2014 03:13:07 GMT'}]",2019-08-17,"[['Cao', 'Guofeng', ''], ['Wang', 'Shaowen', ''], ['Hwang', 'Myunghwa', ''], ['Padmanabhan', 'Anand', ''], ['Zhang', 'Zhenhua', ''], ['Soltani', 'Kiumars', '']]","['big data', 'cyberGIS', 'data cube', 'OLAP', 'social media']"
18442,1007.4767,Marcello Balduccini,Marcello Balduccini and Sara Girotto,"Formalization of Psychological Knowledge in Answer Set Programming and
  its Application",26th Int'l. Conference on Logic Programming (ICLP'10),"Theory and Practice of Logic Programming, 10(4-6), 725-740, 2010",,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we explore the use of Answer Set Programming (ASP) to
formalize, and reason about, psychological knowledge. In the field of
psychology, a considerable amount of knowledge is still expressed using only
natural language. This lack of a formalization complicates accurate studies,
comparisons, and verification of theories. We believe that ASP, a knowledge
representation formalism allowing for concise and simple representation of
defaults, uncertainty, and evolving domains, can be used successfully for the
formalization of psychological knowledge. To demonstrate the viability of ASP
for this task, in this paper we develop an ASP-based formalization of the
mechanics of Short-Term Memory. We also show that our approach can have rather
immediate practical uses by demonstrating an application of our formalization
to the task of predicting a user's interaction with a graphical interface.
","[{'version': 'v1', 'created': 'Tue, 27 Jul 2010 16:33:33 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Feb 2011 14:28:48 GMT'}]",2011-02-11,"[['Balduccini', 'Marcello', ''], ['Girotto', 'Sara', '']]","['answer set programming', 'reasoning about actions and change', 'psychology', 'short-termmemory']"
18443,1209.1181,Nilanjan  Dey,"Nilanjan Dey, Anamitra Bardhan Roy, Moumita Pal, Achintya Das",FCM Based Blood Vessel Segmentation Method for Retinal Images,"5 pages,3figures","International Journal of Computer Science and Network
  (IJCSN),Volume 1, Issue 3, June 2012,ISSN 2277-5420",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Segmentation of blood vessels in retinal images provides early diagnosis of
diseases like glaucoma, diabetic retinopathy and macular degeneration. Among
these diseases occurrence of Glaucoma is most frequent and has serious ocular
consequences that can even lead to blindness, if it is not detected early. The
clinical criteria for the diagnosis of glaucoma include intraocular pressure
measurement, optic nerve head evaluation, retinal nerve fiber layer and visual
field defects. This form of blood vessel segmentation helps in early detection
for ophthalmic diseases, and potentially reduces the risk of blindness. The
low-contrast images at the retina owing to narrow blood vessels of the retina
are difficult to extract. These low contrast images are, however useful in
revealing certain systemic diseases. Motivated by the goals of improving
detection of such vessels, this present work proposes an algorithm for
segmentation of blood vessels and compares the results between expert
ophthalmologist hand-drawn ground-truths and segmented image(i.e. the output of
the present work).Sensitivity, specificity, positive predictive value (PPV),
positive likelihood ratio (PLR) and accuracy are used to evaluate overall
performance.It is found that this work segments blood vessels successfully with
sensitivity, specificity, PPV, PLR and accuracy of 99.62%, 54.66%, 95.08%,
219.72 and 95.03%, respectively.
","[{'version': 'v1', 'created': 'Thu, 6 Sep 2012 05:12:53 GMT'}]",2012-09-07,"[['Dey', 'Nilanjan', ''], ['Roy', 'Anamitra Bardhan', ''], ['Pal', 'Moumita', ''], ['Das', 'Achintya', '']]","['Fuzzy C-Means(FCM)', 'PPV', 'PLR', 'sensitivity', 'specificity', 'accuracy']"
18444,1009.5030,Sophie Toulouse,Sophie Toulouse (LIPN),Approximability of the Multiple Stack TSP,,,,,cs.CC cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  STSP seeks a pair of pickup and delivery tours in two distinct networks,
where the two tours are related by LIFO contraints. We address here the problem
approximability. We notably establish that asymmetric MaxSTSP and MinSTSP12 are
APX, and propose a heuristic that yields to a 1/2, 3/4 and 3/2 standard
approximation for respectively Max2STSP, Max2STSP12 and Min2STSP12.
","[{'version': 'v1', 'created': 'Sat, 25 Sep 2010 19:42:20 GMT'}]",2010-09-28,"[['Toulouse', 'Sophie', '', 'LIPN']]","['Approximation algorithms', 'multiple stack TSP', 'TSP', 'LIFO constraints']"
18445,1409.3651,Dushyant Vaghela Mr.,Dushyant Vaghela,An Advanced Approach On Load Balancing in Grid Computing,"We have applied our Research work on various servers, NGIX performs
  better, VPS Hosting Godadday servers Representative for
  http://explorequotes.com/ working fine, finally we have concluded that all
  the experiments were satisfactory",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rapid development in wide area networks and low cost, powerful
computational resources, grid computing has gained its popularity. With the
advent of grid computing, space limitations of conventional distributed systems
can be overcome and underutilized computing resources at different locations
around the world can be put to distributed jobs. Workload and resource
management is the main key grid services at the service level of grid
infrastructures, out of which load balancing in the main concern for grid
developers. It has been found that load is the major problem which server
faces, especially when the number of users increases. A lot of research is
being done in the area of load management. This paper presents the various
mechanisms of load balancing in grid computing so that the readers will get an
idea of which algorithm would be suitable in different situations. Keywords:
wide area network, distributed computing, load balancing.
","[{'version': 'v1', 'created': 'Fri, 12 Sep 2014 05:40:34 GMT'}]",2014-09-15,"[['Vaghela', 'Dushyant', '']]","['wide area network', 'distributed computing', 'load balancing']"
18446,1107.4386,Ozan Candogan,"Ozan Candogan, Asuman Ozdaglar, Pablo A. Parrilo",Dynamics in Near-Potential Games,"42 pages, 8 figures",,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Except for special classes of games, there is no systematic framework for
analyzing the dynamical properties of multi-agent strategic interactions.
Potential games are one such special but restrictive class of games that allow
for tractable dynamic analysis. Intuitively, games that are ""close"" to a
potential game should share similar properties. In this paper, we formalize and
develop this idea by quantifying to what extent the dynamic features of
potential games extend to ""near-potential"" games. We study convergence of three
commonly studied classes of adaptive dynamics: discrete-time better/best
response, logit response, and discrete-time fictitious play dynamics. For
better/best response dynamics, we focus on the evolution of the sequence of
pure strategy profiles and show that this sequence converges to a (pure)
approximate equilibrium set, whose size is a function of the ""distance"" from a
close potential game. We then study logit response dynamics and provide a
characterization of the stationary distribution of this update rule in terms of
the distance of the game from a close potential game and the corresponding
potential function. We further show that the stochastically stable strategy
profiles are pure approximate equilibria. Finally, we turn attention to
fictitious play, and establish that the sequence of empirical frequencies of
player actions converges to a neighborhood of (mixed) equilibria of the game,
where the size of the neighborhood increases with distance of the game to a
potential game. Thus, our results suggest that games that are close to a
potential game inherit the dynamical properties of potential games. Since a
close potential game to a given game can be found by solving a convex
optimization problem, our approach also provides a systematic framework for
studying convergence behavior of adaptive learning dynamics in arbitrary finite
strategic form games.
","[{'version': 'v1', 'created': 'Thu, 21 Jul 2011 21:45:02 GMT'}]",2011-07-25,"[['Candogan', 'Ozan', ''], ['Ozdaglar', 'Asuman', ''], ['Parrilo', 'Pablo A.', '']]","['Dynamics in games', 'near-potential games', 'best response dynamics', 'logitresponse dynamics', 'fictitious play']"
18447,1605.02860,Fahmida Aseez,Fahmida Aseez and Sheena Mathew,"Hierarchical Partition-Based Anonymous Routing Protocol(HPAR) in Manet
  for Efficient and Secure Transmission","8 pages, 5 figues",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Anonymous routing protocols are used in MANET's to hide the nodes from
outsiders in order to protect from various attacks. HPAR partitions the network
area dynamically into zones and chooses nodes in zones randomly as intermediate
relay nodes .This relay nodes help in secure routing. In HPAR anonymity
protection is given to source, destination and route. HPAR have low cost and
provide high level of protection. It has techniques to counter various attacks.
","[{'version': 'v1', 'created': 'Tue, 10 May 2016 05:40:35 GMT'}]",2016-05-11,"[['Aseez', 'Fahmida', ''], ['Mathew', 'Sheena', '']]","['Anonymous routing', 'Mobile ad hoc networks', 'Anonymity']"
18448,1207.6188,Mahyuddin K. M.  Nasution,Mahyuddin K. M. Nasution,Kolmogorov Complexity: Clustering Objects and Similarity,"13 pages; Bulletin of Mathematics, Vol. 3 (2011), No. 1: 1-16",,,,cs.CC cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The clustering objects has become one of themes in many studies, and do not
few researchers use the similarity to cluster the instances automatically.
However, few research consider using Kommogorov Complexity to get information
about objects from documents, such as Web pages, where the rich information
from an approach proved to be difficult to. In this paper, we proposed a
similarity measure from Kolmogorov Complexity, and we demonstrate the
possibility of exploiting features from Web based on hit counts for objects of
Indonesia Intellectual.
","[{'version': 'v1', 'created': 'Thu, 26 Jul 2012 07:35:53 GMT'}]",2012-07-27,"[['Nasution', 'Mahyuddin K. M.', '']]","['Kolmogorov complexity', 'distance', 'similarity', 'singleton', 'doubleton']"
18449,1212.1313,Debajyoti Banerji,"Debajyoti Banerji, Ranjit Ray, Jhankar Basu and Indrajit Basak",Autonomous Navigation by Robust Scan Matching Technique,"7 pages, 9 figures","INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGY AND CREATIVE
  ENGINEERING (ISSN:2045-8711), VOL.2 NO.10 OCTOBER 2012",,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For effective autonomous navigation,estimation of the pose of the robot is
essential at every sampling time. For computing an accurate
estimation,odometric error needs to be reduced with the help of data from
external sensor. In this work, a technique has been developed for accurate pose
estimation of mobile robot by using Laser Range data. The technique is robust
to noisy data, which may contain considerable amount of outliers. A grey image
is formed from laser range data and the key points from this image are
extracted by Harris corner detector. The matching of the key points from
consecutive data sets have been done while outliers have been rejected by
RANSAC method. Robot state is measured by the correspondence between the two
sets of keypoints. Finally, optimal robot state is estimated by Extended Kalman
Filter. The technique has been applied to an operational robot in the
laboratory environment to show the robustness of the technique in presence of
noisy sensor data. The performance of this new technique has been compared with
that of conventional ICP method. Through this method, effective and accurate
navigation has been achieved even in presence of substantial noise in the
sensor data at the cost of a small amount of additional computational
complexity.
","[{'version': 'v1', 'created': 'Thu, 6 Dec 2012 12:53:26 GMT'}]",2012-12-07,"[['Banerji', 'Debajyoti', ''], ['Ray', 'Ranjit', ''], ['Basu', 'Jhankar', ''], ['Basak', 'Indrajit', '']]","['Autonomous Navigation', 'Laser data', 'Scan Match', 'Kalman Filter']"
18450,1504.03071,Jaeyong Sung,"Jaeyong Sung, Seok Hyun Jin, Ashutosh Saxena","Robobarista: Object Part based Transfer of Manipulation Trajectories
  from Crowd-sourcing in 3D Pointclouds",In International Symposium on Robotics Research (ISRR) 2015,,,,cs.RO cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a large variety of objects and appliances in human environments,
such as stoves, coffee dispensers, juice extractors, and so on. It is
challenging for a roboticist to program a robot for each of these object types
and for each of their instantiations. In this work, we present a novel approach
to manipulation planning based on the idea that many household objects share
similarly-operated object parts. We formulate the manipulation planning as a
structured prediction problem and design a deep learning model that can handle
large noise in the manipulation demonstrations and learns features from three
different modalities: point-clouds, language and trajectory. In order to
collect a large number of manipulation demonstrations for different objects, we
developed a new crowd-sourcing platform called Robobarista. We test our model
on our dataset consisting of 116 objects with 249 parts along with 250 language
instructions, for which there are 1225 crowd-sourced manipulation
demonstrations. We further show that our robot can even manipulate objects it
has never seen before.
","[{'version': 'v1', 'created': 'Mon, 13 Apr 2015 06:25:42 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Sep 2015 23:43:19 GMT'}]",2015-09-22,"[['Sung', 'Jaeyong', ''], ['Jin', 'Seok Hyun', ''], ['Saxena', 'Ashutosh', '']]","['Robotics and Learning', 'Crowd-sourcing', 'Manipulation']"
18451,1704.08343,James Ross,"David Richie, James Ross, Jamie Infantolino","A Distributed Shared Memory Model and C++ Templated Meta-Programming
  Interface for the Epiphany RISC Array Processor","10 pages, 2 figures, ICCS/ALCHEMY Workshop 2017",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Adapteva Epiphany many-core architecture comprises a scalable 2D mesh
Network-on-Chip (NoC) of low-power RISC cores with minimal uncore
functionality. Whereas such a processor offers high computational energy
efficiency and parallel scalability, developing effective programming models
that address the unique architecture features has presented many challenges. We
present here a distributed shared memory (DSM) model supported in software
transparently using C++ templated metaprogramming techniques. The approach
offers an extremely simple parallel programming model well suited for the
architecture. Initial results are presented that demonstrate the approach and
provide insight into the efficiency of the programming model and also the
ability of the NoC to support a DSM without explicit control over data movement
and localization.
","[{'version': 'v1', 'created': 'Wed, 26 Apr 2017 20:38:57 GMT'}]",2017-04-28,"[['Richie', 'David', ''], ['Ross', 'James', ''], ['Infantolino', 'Jamie', '']]","['2D RISC array', 'Adapteva Epiphany', 'Parallella', 'distributed shared memory', 'templated metaprogramming', 'parallel programming model']"
18452,1107.4396,Firouz Wassai,"Firouz Abdullah Al-Wassai, N.V. Kalyankar, Ali A. Al-Zuky",The IHS Transformations Based Image Fusion,"Image Fusion, Color Models, IHS, HSV, HSL, YIQ, transformations","Journal-ref: International Journal of Advanced Research in
  Computer Science,Volume 2, No. 5, Sept-Oct 2011,www.ijarcs.info",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The IHS sharpening technique is one of the most commonly used techniques for
sharpening. Different transformations have been developed to transfer a color
image from the RGB space to the IHS space. Through literature, it appears that,
various scientists proposed alternative IHS transformations and many papers
have reported good results whereas others show bad ones as will as not those
obtained which the formula of IHS transformation were used. In addition to
that, many papers show different formulas of transformation matrix such as IHS
transformation. This leads to confusion what is the exact formula of the IHS
transformation?. Therefore, the main purpose of this work is to explore
different IHS transformation techniques and experiment it as IHS based image
fusion. The image fusion performance was evaluated, in this study, using
various methods to estimate the quality and degree of information improvement
of a fused image quantitatively.
","[{'version': 'v1', 'created': 'Tue, 19 Jul 2011 06:18:56 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Jul 2011 01:08:40 GMT'}]",2012-09-18,"[['Al-Wassai', 'Firouz Abdullah', ''], ['Kalyankar', 'N. V.', ''], ['Al-Zuky', 'Ali A.', '']]","['Image Fusion', 'Color Models', 'IHS', 'HSV', 'HSL', 'YIQ', 'transformations']"
18453,1208.2486,Nitish Upreti Nitish Upreti,Nitish Upreti,`CodeAliker' - Plagiarism Detection on the Cloud,,"Advanced Computing: An International Journal ( ACIJ ), Vol.3,
  No.4, July 2012, 21-26",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Plagiarism is a burning problem that academics have been facing in all of the
varied levels of the educational system. With the advent of digital content,
the challenge to ensure the integrity of academic work has been amplified. This
paper discusses on defining a precise definition of plagiarized computer code,
various solutions available for detecting plagiarism and building a cloud
platform for plagiarism disclosure. 'CodeAliker', our application thus
developed automates the submission of assignments and the review process
associated for essay text as well as computer code. It has been made available
under the GNU's General Public License as a Free and Open Source Software.
","[{'version': 'v1', 'created': 'Mon, 13 Aug 2012 02:52:26 GMT'}]",2012-08-14,"[['Upreti', 'Nitish', '']]","['Plagiarism', 'String matching', 'Cloud Computing']"
18454,1406.4799,Martin Gro{\ss},Martin Gro{\ss} and Martin Skutella,"A tight bound on the speed-up through storage for quickest
  multi-commodity flows",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-commodity flows over time exhibit the non-intuitive property that
letting flow wait can allow us to send flow faster overall. Fleischer and
Skutella (IPCO~2002) show that the speed-up through storage is at most a factor
of~$2$, and that there are instances where the speed-up is as large as a factor
of~$4/3$. We close this gap by presenting a family of instances for which the
speed-up factor through storage converges to~$2$.
","[{'version': 'v1', 'created': 'Wed, 18 Jun 2014 17:12:14 GMT'}]",2014-06-19,"[['Groß', 'Martin', ''], ['Skutella', 'Martin', '']]","['dynamic flow', 'flow over time', 'quickest flow', 'holdover', 'multicommodity', 'storage', 'waiting']"
18455,0710.5512,Santiago Moreno,"U. Horst, S. Moreno","Risk Minimization and Optimal Derivative Design in a Principal Agent
  Game","28 pages, 4 figures",,,,cs.CE,,"  We consider the problem of Adverse Selection and optimal derivative design
within a Principal-Agent framework. The principal's income is exposed to
non-hedgeable risk factors arising, for instance, from weather or climate
phenomena. She evaluates her risk using a coherent and law invariant risk
measure and tries minimize her exposure by selling derivative securities on her
income to individual agents. The agents have mean-variance preferences with
heterogeneous risk aversion coefficients. An agent's degree of risk aversion is
private information and hidden to the principal who only knows the overall
distribution. We show that the principal's risk minimization problem has a
solution and illustrate the effects of risk transfer on her income by means of
two specific examples. Our model extends earlier work of Barrieu and El Karoui
(2005) and Carlier, Ekeland and Touzi (2007).
","[{'version': 'v1', 'created': 'Mon, 29 Oct 2007 20:00:15 GMT'}]",2007-10-31,"[['Horst', 'U.', ''], ['Moreno', 'S.', '']]","['Optimal derivative design', 'structured securities', 'adverse selection', 'risk transfer']"
18456,1108.2462,Marco Baldi,"Marco Baldi, Marco Bianchi, Franco Chiaraluce, Joachim Rosenthal and
  Davide Schipani",Enhanced public key security for the McEliece cryptosystem,"31 pages, 1 figure. Accepted for publication in the Journal of
  Cryptology",,,,cs.IT cs.CR math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies a variant of the McEliece cryptosystem able to ensure that
the code used as the public key is no longer permutation-equivalent to the
secret code. This increases the security level of the public key, thus opening
the way for reconsidering the adoption of classical families of codes, like
Reed-Solomon codes, that have been longly excluded from the McEliece
cryptosystem for security reasons. It is well known that codes of these classes
are able to yield a reduction in the key size or, equivalently, an increased
level of security against information set decoding; so, these are the main
advantages of the proposed solution. We also describe possible vulnerabilities
and attacks related to the considered system, and show what design choices are
best suited to avoid them.
","[{'version': 'v1', 'created': 'Thu, 11 Aug 2011 16:59:38 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Oct 2011 18:10:16 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Nov 2012 10:24:11 GMT'}, {'version': 'v4', 'created': 'Tue, 20 May 2014 13:04:27 GMT'}]",2014-05-21,"[['Baldi', 'Marco', ''], ['Bianchi', 'Marco', ''], ['Chiaraluce', 'Franco', ''], ['Rosenthal', 'Joachim', ''], ['Schipani', 'Davide', '']]","['McEliece cryptosystem', 'Niederreiter cryptosystem', 'error correcting codes', 'Reed-Solomon codes', 'public key security']"
18457,0706.4015,Franck Petit,"Christian Boulinier (LaRIA), Franck Petit (LaRIA)",Self-Stabilizing Wavelets and r-Hops Coordination,,Rapport Interne (01/04/2007),,,cs.DC,,"  We introduce a simple tool called the wavelet (or, r-wavelet) scheme.
Wavelets deals with coordination among processes which are at most r hops away
of each other. We present a selfstabilizing solution for this scheme. Our
solution requires no underlying structure and works in arbritrary anonymous
networks, i.e., no process identifier is required. Moreover, our solution works
under any (even unfair) daemon. Next, we use the wavelet scheme to design
self-stabilizing layer clocks. We show that they provide an efficient device in
the design of local coordination problems at distance r, i.e., r-barrier
synchronization and r-local resource allocation (LRA) such as r-local mutual
exclusion (LME), r-group mutual exclusion (GME), and r-Reader/Writers. Some
solutions to the r-LRA problem (e.g., r-LME) also provide transformers to
transform algorithms written assuming any r-central daemon into algorithms
working with any distributed daemon.
","[{'version': 'v1', 'created': 'Wed, 27 Jun 2007 12:53:06 GMT'}]",2007-06-28,"[['Boulinier', 'Christian', '', 'LaRIA'], ['Petit', 'Franck', '', 'LaRIA']]","['Barrier Synchronization', 'Local Synchronization', 'Resource Allocation', 'Self-Stabilization', 'Unison']"
18458,1802.09623,Biao Zhao,"Biao Zhao, Shigang Yue","A Resilient Image Matching Method with an Affine Invariant Feature
  Detector and Descriptor",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image feature matching is to seek, localize and identify the similarities
across the images. The matched local features between different images can
indicate the similarities of their content. Resilience of image feature
matching to large view point changes is challenging for a lot of applications
such as 3D object reconstruction, object recognition and navigation, etc, which
need accurate and robust feature matching from quite different view points. In
this paper we propose a novel image feature matching algorithm, integrating our
previous proposed Affine Invariant Feature Detector (AIFD) and new proposed
Affine Invariant Feature Descriptor (AIFDd). Both stages of this new proposed
algorithm can provide sufficient resilience to view point changes. With
systematic experiments, we can prove that the proposed method of feature
detector and descriptor outperforms other state-of-the-art feature matching
algorithms especially on view points robustness. It also performs well under
other conditions such as the change of illumination, rotation and compression,
etc.
","[{'version': 'v1', 'created': 'Fri, 29 Dec 2017 11:36:58 GMT'}]",2018-02-28,"[['Zhao', 'Biao', ''], ['Yue', 'Shigang', '']]","['Feature detector', 'Feature descriptor', 'Image feature matching', 'Histogram']"
18459,1710.02019,Daniel Augot,"Daniel Augot (GRACE), Herv\'e Chabanne, Thomas Chenevier, William
  George (LIX, GRACE), Laurent Lamber",A User-Centric System for Verified Identities on the Bitcoin Blockchain,,"International Workshop on Cryptocurrencies and Blockchain
  Technology - CBT'17, Sep 2017, Oslo, Norway",,,cs.CR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an identity management scheme built into the Bitcoin blockchain,
allowing for identities that are as indelible as the blockchain itself.
Moreover, we take advantage of Bitcoin's decentralized nature to facilitate a
shared control between users and identity providers, allowing users to directly
manage their own identities, fluidly coordinating identities from different
providers, even as identity providers can revoke identities and impose
controls.
","[{'version': 'v1', 'created': 'Thu, 5 Oct 2017 13:48:04 GMT'}]",2017-10-06,"[['Augot', 'Daniel', '', 'GRACE'], ['Chabanne', 'Hervé', '', 'LIX, GRACE'], ['Chenevier', 'Thomas', '', 'LIX, GRACE'], ['George', 'William', '', 'LIX, GRACE'], ['Lamber', 'Laurent', '']]","['Bitcoin blockchain', 'Identity proofs', 'Discrete Logarithm REPresentation (DLREP)', 'Personal Identity Management Systems (PIMS)']"
18460,1504.07908,Maciej Burak Mr.,Maciej Rafal Burak,Inhomogeneous CTMC Model of a Call Center with Balking and Abandonment,"submitted to Studia Informatica (http://studiainformatica.polsl.pl/).
  arXiv admin note: substantial text overlap with arXiv:1410.0804","Studia Informatica, Vol 36, No 2 (2015):23-34, jun 2015",,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers a nonstationary multiserver queuing model with
abandonment and balking for inbound call centers. We present a continuous time
Markov chain (CTMC) model which captures the important characteristics of an
inbound call center and obtain a numerical solution for its transient state
probabilities using uniformization method with steady-state detection.
Keywords: call center, transient, Markov processes, numerical methods,
uniformization, abandonment, balking
","[{'version': 'v1', 'created': 'Wed, 29 Apr 2015 16:03:40 GMT'}]",2015-06-26,"[['Burak', 'Maciej Rafal', '']]","['call center', 'transient', 'Markov processes', 'numerical methods', 'uniformization', 'abandonment', 'balking']"
18461,1507.01111,Fernando Soler-Toscano,"David Fern\'andez-Duque, \'Angel Nepomuceno-Fern\'andez, Enrique
  Sarri\'on-Morrillo, Fernando Soler-Toscano, Fernando R. Vel\'azquez-Quesada",Forgetting complex propositions,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper uses possible-world semantics to model the changes that may occur
in an agent's knowledge as she loses information. This builds on previous work
in which the agent may forget the truth-value of an atomic proposition, to a
more general case where she may forget the truth-value of a propositional
formula. The generalization poses some challenges, since in order to forget
whether a complex proposition $\pi$ is the case, the agent must also lose
information about the propositional atoms that appear in it, and there is no
unambiguous way to go about this.
  We resolve this situation by considering expressions of the form
$[\boldsymbol{\ddagger} \pi]\varphi$, which quantify over all possible (but
minimal) ways of forgetting whether $\pi$. Propositional atoms are modified
non-deterministically, although uniformly, in all possible worlds. We then
represent this within action model logic in order to give a sound and complete
axiomatization for a logic with knowledge and forgetting. Finally, some
variants are discussed, such as when an agent forgets $\pi$ (rather than
forgets whether $\pi$) and when the modification of atomic facts is done
non-uniformly throughout the model.
","[{'version': 'v1', 'created': 'Sat, 4 Jul 2015 14:46:31 GMT'}]",2015-07-07,"[['Fernández-Duque', 'David', ''], ['Nepomuceno-Fernández', 'Ángel', ''], ['Sarrión-Morrillo', 'Enrique', ''], ['Soler-Toscano', 'Fernando', ''], ['Velázquez-Quesada', 'Fernando R.', '']]","['forgetting', 'dynamic epistemic logic', 'action models', 'theorycontraction', 'knowledge representation']"
18462,1605.00366,Pavel Svoboda,Pavel Svoboda and Michal Hradis and David Barina and Pavel Zemcik,Compression Artifacts Removal Using Convolutional Neural Networks,To be published in WSCG 2016,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper shows that it is possible to train large and deep convolutional
neural networks (CNN) for JPEG compression artifacts reduction, and that such
networks can provide significantly better reconstruction quality compared to
previously used smaller networks as well as to any other state-of-the-art
methods. We were able to train networks with 8 layers in a single step and in
relatively short time by combining residual learning, skip architecture, and
symmetric weight initialization. We provide further insights into convolution
networks for JPEG artifact reduction by evaluating three different objectives,
generalization with respect to training dataset size, and generalization with
respect to JPEG quality level.
","[{'version': 'v1', 'created': 'Mon, 2 May 2016 06:40:08 GMT'}]",2016-05-03,"[['Svoboda', 'Pavel', ''], ['Hradis', 'Michal', ''], ['Barina', 'David', ''], ['Zemcik', 'Pavel', '']]","['Deep learning', 'Convolutional neural networks', 'JPEG', 'Compression artifacts', 'Deblocking', 'Deringing']"
18463,1203.1568,Amir Houmansadr,Amir Houmansadr and Nikita Borisov,BotMosaic: Collaborative Network Watermark for Botnet Detection,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent research has made great strides in the field of detecting botnets.
However, botnets of all kinds continue to plague the Internet, as many ISPs and
organizations do not deploy these techniques. We aim to mitigate this state by
creating a very low-cost method of detecting infected bot host. Our approach is
to leverage the botnet detection work carried out by some organizations to
easily locate collaborating bots elsewhere. We created BotMosaic as a
countermeasure to IRC-based botnets. BotMosaic relies on captured bot instances
controlled by a watermarker, who inserts a particular pattern into their
network traffic. This pattern can then be detected at a very low cost by client
organizations and the watermark can be tuned to provide acceptable
false-positive rates. A novel feature of the watermark is that it is inserted
collaboratively into the flows of multiple captured bots at once, in order to
ensure the signal is strong enough to be detected. BotMosaic can also be used
to detect stepping stones and to help trace back to the botmaster. It is
content agnostic and can operate on encrypted traffic. We evaluate BotMosaic
using simulations and a testbed deployment.
","[{'version': 'v1', 'created': 'Wed, 7 Mar 2012 18:51:26 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Mar 2012 03:08:18 GMT'}]",2015-03-20,"[['Houmansadr', 'Amir', ''], ['Borisov', 'Nikita', '']]","['Botnet detection', 'botmaster traceback', 'traffic analysis', 'network flowwatermarking', 'network security']"
18464,1701.02617,Amit Awekar,"Anasua Mitra, Amit Awekar",On Low Overlap Among Search Results of Academic Search Engines,"2 pages, submitted to ACM WWW Conference 2017",,,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Number of published scholarly articles is growing exponentially. To tackle
this information overload, researchers are increasingly depending on niche
academic search engines. Recent works have shown that two major general web
search engines: Google and Bing, have high level of agreement in their top
search results. In contrast, we show that various academic search engines have
low degree of agreement among themselves. We performed experiments using 2500
queries over four academic search engines. We observe that overlap in search
result sets of any pair of academic search engines is significantly low and in
most of the cases the search result sets are mutually exclusive. We also
discuss implications of this low overlap.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2017 14:46:17 GMT'}]",2017-01-11,"[['Mitra', 'Anasua', ''], ['Awekar', 'Amit', '']]","['Web mining', 'Scholarly data', 'Search engine comparison']"
18465,1505.05322,Ai Munandar Tb,Azhari SN and Tb. Ai Munandar,"Unsupervised Neural Network-Naive Bayes Model for Grouping Data Regional
  Development Results",6 pages,"International Journal of Computer Applications, Volume 104, No 15,
  October 2014",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Determination quadrant development has an important role in order to
determine the achievement of the development of a district, in terms of the
sector's gross regional domestic product (GDP). The process of determining the
quadrant development typically uses Klassen rules based on its sector GDP. This
study aims to provide a new approach in the conduct of regional development
quadrant clustering using cluster techniques. Clustering is performed based on
the average value of the growth and development of a district contribution
compared with the average value and contribution of the development of the
province based on data in comparison with a year of data to be compared.
Testing models of clustering, performed on a dataset of two provinces, namely
Banten (as a data testing) and Central Java (as the training data), to see the
accuracy of the classification model proposed. The proposed model consists of
two learning methods in it, namely unsupervised (Self Organizing Map / SOM-NN)
method and supervised (Naive Bayess). SOM-NN method is used as a learning
engine to generate training data for the target Class that will be used in the
machine learning Naive Bayess. The results showed the clustering accuracy rate
of the model was 98.1%, while the clustering accuracy rate of the model results
compared to manual analysis shows the accuracy of the typology Klassen smaller,
ie 29.63%. On one side, clustering results of the proposed model is influenced
by the number and keagaraman data sets used.
","[{'version': 'v1', 'created': 'Wed, 20 May 2015 11:22:18 GMT'}]",2015-05-21,"[['SN', 'Azhari', ''], ['Munandar', 'Tb. Ai', '']]","['GDP', 'naive bayess', 'self organizing map', 'Klassen tipology', 'classification']"
18466,1406.7128,Gonzalo Galiano,"Gonzalo Galiano, Juli\'an Velasco","On a new formulation of nonlocal image filters involving the relative
  rearrangement",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nonlocal filters are simple and powerful techniques for image denoising. In
this paper we study the reformulation of a broad class of nonlocal filters in
terms of two functional rearrangements: the decreasing and the relative
rearrangements.
  Independently of the dimension of the image, we reformulate these filters as
integral operators defined in a one-dimensional space corresponding to the
level sets measures.
  We prove the equivalency between the original and the rearranged versions of
the filters and propose a discretization in terms of constant-wise
interpolators, which we prove to be convergent to the solution of the
continuous setting.
  For some particular cases, this new formulation allows us to perform a
detailed analysis of the filtering properties. Among others, we prove that the
filtered image is a contrast change of the original image, and that the
filtering procedure behaves asymptotically as a shock filter combined with a
border diffusive term, responsible for the staircaising effect and the loss of
contrast.
","[{'version': 'v1', 'created': 'Fri, 27 Jun 2014 09:43:53 GMT'}]",2014-06-30,"[['Galiano', 'Gonzalo', ''], ['Velasco', 'Julián', '']]","['Nonlocal image filters', 'Neighborhood filter', 'Bilateral filter', 'decreasing rearrangement', 'relative rearrangement', 'denoising']"
18467,1301.3248,Junhong Lin,Junhong Lin and Song Li,"Sparse Recovery with Coherent Tight Frames via Analysis Dantzig Selector
  and Analysis LASSO",21 pages; Corrected some typos and grammatical errors,,,,cs.IT math.IT math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article considers recovery of signals that are sparse or approximately
sparse in terms of a (possibly) highly overcomplete and coherent tight frame
from undersampled data corrupted with additive noise. We show that the properly
constrained $l_1$-analysis, called analysis Dantzig selector, stably recovers a
signal which is nearly sparse in terms of a tight frame provided that the
measurement matrix satisfies a restricted isometry property adapted to the
tight frame. As a special case, we consider the Gaussian noise. Further, under
a sparsity scenario, with high probability, the recovery error from noisy data
is within a log-like factor of the minimax risk over the class of vectors which
are at most $s$ sparse in terms of the tight frame. Similar results for the
analysis LASSO are showed.
  The above two algorithms provide guarantees only for noise that is bounded or
bounded with high probability (for example, Gaussian noise). However, when the
underlying measurements are corrupted by sparse noise, these algorithms perform
suboptimally. We demonstrate robust methods for reconstructing signals that are
nearly sparse in terms of a tight frame in the presence of bounded noise
combined with sparse noise. The analysis in this paper is based on the
restricted isometry property adapted to a tight frame, which is a natural
extension to the standard restricted isometry property.
","[{'version': 'v1', 'created': 'Tue, 15 Jan 2013 07:44:34 GMT'}, {'version': 'v2', 'created': 'Sun, 8 Sep 2013 08:03:21 GMT'}]",2013-09-10,"[['Lin', 'Junhong', ''], ['Li', 'Song', '']]","['l1-analysis', 'Restricted isometry property', 'Sparse recovery', 'Dantzig selector', 'LASSO', 'Gaussian noise', 'Sparse noise']"
18468,1604.07360,Emily Hand,Emily M. Hand and Rama Chellappa,"Attributes for Improved Attributes: A Multi-Task Network for Attribute
  Classification",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Attributes, or semantic features, have gained popularity in the past few
years in domains ranging from activity recognition in video to face
verification. Improving the accuracy of attribute classifiers is an important
first step in any application which uses these attributes. In most works to
date, attributes have been considered to be independent. However, we know this
not to be the case. Many attributes are very strongly related, such as heavy
makeup and wearing lipstick. We propose to take advantage of attribute
relationships in three ways: by using a multi-task deep convolutional neural
network (MCNN) sharing the lowest layers amongst all attributes, sharing the
higher layers for related attributes, and by building an auxiliary network on
top of the MCNN which utilizes the scores from all attributes to improve the
final classification of each attribute. We demonstrate the effectiveness of our
method by producing results on two challenging publicly available datasets.
","[{'version': 'v1', 'created': 'Mon, 25 Apr 2016 18:49:55 GMT'}]",2016-04-26,"[['Hand', 'Emily M.', ''], ['Chellappa', 'Rama', '']]","['Attributes', 'Face Recognition', 'CNN', 'Multi-Task Learning']"
18469,1705.06870,Chuyang Ye,"Chuyang Ye, Jerry L. Prince",Fiber Orientation Estimation Guided by a Deep Network,A shorter version is accepted by MICCAI 2017,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Diffusion magnetic resonance imaging (dMRI) is currently the only tool for
noninvasively imaging the brain's white matter tracts. The fiber orientation
(FO) is a key feature computed from dMRI for fiber tract reconstruction.
Because the number of FOs in a voxel is usually small, dictionary-based sparse
reconstruction has been used to estimate FOs with a relatively small number of
diffusion gradients. However, accurate FO estimation in regions with complex FO
configurations in the presence of noise can still be challenging. In this work
we explore the use of a deep network for FO estimation in a dictionary-based
framework and propose an algorithm named Fiber Orientation Reconstruction
guided by a Deep Network (FORDN). FORDN consists of two steps. First, we use a
smaller dictionary encoding coarse basis FOs to represent the diffusion
signals. To estimate the mixture fractions of the dictionary atoms (and thus
coarse FOs), a deep network is designed specifically for solving the sparse
reconstruction problem. Here, the smaller dictionary is used to reduce the
computational cost of training. Second, the coarse FOs inform the final FO
estimation, where a larger dictionary encoding dense basis FOs is used and a
weighted l1-norm regularized least squares problem is solved to encourage FOs
that are consistent with the network output. FORDN was evaluated and compared
with state-of-the-art algorithms that estimate FOs using sparse reconstruction
on simulated and real dMRI data, and the results demonstrate the benefit of
using a deep network for FO estimation.
","[{'version': 'v1', 'created': 'Fri, 19 May 2017 06:37:34 GMT'}]",2017-05-22,"[['Ye', 'Chuyang', ''], ['Prince', 'Jerry L.', '']]","['diffusion MRI', 'fiber orientation estimation', 'deep network', 'sparse reconstruction']"
18470,1304.3157,Rayed AlGhamdi,"Mohammed Alshehri, Steve Drew and Rayed AlGhamdi","Analysis of Citizens Acceptance for E-government Services: Applying the
  UTAUT Model","Presented to IADIS International Conferences Theory and Practice in
  Modern Computing and Internet Applications and Research 2012, pp. 69-76",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  E-government services aims to provide citizens with more accessible,
accurate, real-time and high quality services and information. Although the
public sectors in Kingdom of Saudi Arabia (KSA) have promoted their
e-Government services for many years, its uses and achievements are few.
Therefore, this paper explores the key factors of Saudi citizens acceptance
through a research survey and by gathering empirical evidence based on the
Unified Theory of Acceptance and the Use of Technology (UTAUT). Survey Data
collected from 400 respondents was examined using structural equation modelling
(SEM) technique and utilized AMOS tools. The study results explored the factors
that affect the acceptance of e-government services in KSA based on UTAUT
model. Moreover, as a result of this study an amended UTAUT model was proposed.
Such a model contributes to the discussion and development of adoption models
for technology.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2013 22:02:45 GMT'}]",2013-04-12,"[['Alshehri', 'Mohammed', ''], ['Drew', 'Steve', ''], ['AlGhamdi', 'Rayed', '']]","['E-Government', 'KSA', 'UTAUT', 'Information Systems adoption', 'SEM', 'AMOS']"
18471,1203.1745,Yajuan Sun,Yajuan Sun and Hai Lin and Ben M. Chen,"Bisimilarity Enforcing Supervisory Control for Deterministic
  Specifications",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates the supervisory control of nondeterministic discrete
event systems to enforce bisimilarity with respect to deterministic
specifications. A notion of synchronous simulation-based controllability is
introduced as a necessary and sufficient condition for the existence of a
bisimilarity enforcing supervisor, and a polynomial algorithm is developed to
verify such a condition. When the existence condition holds, a supervisor
achieving bisimulation equivalence is constructed. Furthermore, when the
existence condition does not hold, two different methods are provided for
synthesizing maximal permissive sub-specifications.
","[{'version': 'v1', 'created': 'Thu, 8 Mar 2012 10:51:22 GMT'}]",2012-03-09,"[['Sun', 'Yajuan', ''], ['Lin', 'Hai', ''], ['Chen', 'Ben M.', '']]","['Supervisory control', 'bisimulation', 'discrete event systems']"
18472,1203.0332,Frederico Durao,"Frederico Durao, Peter Dolog",A Personalized Tag-Based Recommendation in Social Web Systems,,"Original language English, Journal CEUR Workshop Proceedings,
  Publication date 2009, Volume 485, Pages 40-49, ISSN 1613-0073",,,cs.SI cs.IR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Tagging activity has been recently identified as a potential source of
knowledge about personal interests, preferences, goals, and other attributes
known from user models. Tags themselves can be therefore used for finding
personalized recommendations of items. In this paper, we present a tag-based
recommender system which suggests similar Web pages based on the similarity of
their tags from a Web 2.0 tagging application. The proposed approach extends
the basic similarity calculus with external factors such as tag popularity, tag
representativeness and the affinity between user and tag. In order to study and
evaluate the recommender system, we have conducted an experiment involving 38
people from 12 countries using data from Del.icio.us, a social bookmarking web
system on which users can share their personal bookmarks.
","[{'version': 'v1', 'created': 'Thu, 1 Mar 2012 22:11:22 GMT'}]",2012-03-05,"[['Durao', 'Frederico', ''], ['Dolog', 'Peter', '']]","['personalization', 'recommendation', 'tags', 'bookmarks', 'similarity']"
18473,1404.0117,George Mertzios,Josep Diaz and George B. Mertzios,Minimum Bisection is NP-hard on Unit Disk Graphs,"17 pages, 6 figures",,,,cs.CC math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we prove that the \textsc{Min-Bisection} problem is NP-hard on
\emph{unit disk graphs}, thus solving a longstanding open question.
","[{'version': 'v1', 'created': 'Tue, 1 Apr 2014 03:31:55 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Apr 2014 00:44:11 GMT'}, {'version': 'v3', 'created': 'Thu, 27 Apr 2017 17:27:28 GMT'}]",2017-04-28,"[['Diaz', 'Josep', ''], ['Mertzios', 'George B.', '']]","['Minimum bisection problem', 'unit disk graphs', 'planargraphs', 'NP-hardness']"
18474,1610.04957,Arnold Wiliem,"Liangchen Liu, Arnold Wiliem, Shaokang Chen, Brian C. Lovell",What is the Best Way for Extracting Meaningful Attributes from Pictures?,Submission to Pattern Recognition,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic attribute discovery methods have gained in popularity to extract
sets of visual attributes from images or videos for various tasks. Despite
their good performance in some classification tasks, it is difficult to
evaluate whether the attributes discovered by these methods are meaningful and
which methods are the most appropriate to discover attributes for visual
descriptions. In its simplest form, such an evaluation can be performed by
manually verifying whether there is any consistent identifiable visual concept
distinguishing between positive and negative exemplars labelled by an
attribute. This manual checking is tedious, expensive and labour intensive. In
addition, comparisons between different methods could also be problematic as it
is not clear how one could quantitatively decide which attribute is more
meaningful than the others. In this paper, we propose a novel attribute
meaningfulness metric to address this challenging problem. With this metric,
automatic quantitative evaluation can be performed on the attribute sets; thus,
reducing the enormous effort to perform manual evaluation. The proposed metric
is applied to some recent automatic attribute discovery and hashing methods on
four attribute-labelled datasets. To further validate the efficacy of the
proposed method, we conducted a user study. In addition, we also compared our
metric with a semi-supervised attribute discover method using the mixture of
probabilistic PCA. In our evaluation, we gleaned several insights that could be
beneficial in developing new automatic attribute discovery methods.
","[{'version': 'v1', 'created': 'Mon, 17 Oct 2016 02:51:43 GMT'}]",2016-10-18,"[['Liu', 'Liangchen', ''], ['Wiliem', 'Arnold', ''], ['Chen', 'Shaokang', ''], ['Lovell', 'Brian C.', '']]","['Visual Attribute', 'Meaningfulness Metric', 'Attribute Discovering', 'Semantic Content']"
18475,1306.3955,Abderrahim Mohammed El Amine,"Abderrahim Mohammed El Amine, Benameur Said, Abderrahim Mohammed
  Alaeddine","The Number of Terms and Documents for Pseudo-Relevant Feedback for
  Ad-hoc Information Retrieval",7 pages,"IJCSI International Journal of Computer Science Issues, Vol. 10,
  Issue 1, No 1, January 2013; pp 661-667; ISSN 1694-0784",,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Information Retrieval System (IRS), the Automatic Relevance Feedback (ARF)
is a query reformulation technique that modifies the initial one without the
user intervention. It is applied mainly through the addition of terms coming
from the external resources such as the ontologies and or the results of the
current research. In this context we are mainly interested in the local
analysis technique for the ARF in ad-hoc IRS on Arabic documents. In this
article, we have examined the impact of the variation of the two parameters
implied in this technique, that is to say, the number of the documents
{\guillemotleft}D{\guillemotright} and the number of terms
{\guillemotleft}T{\guillemotright}, on an Arabic IRS performance. The
experimentation, carried out on an Arabic corpus text, enables us to deduce
that there are queries which are not easily improvable with the query
reformulation. In addition, the success of the ARF is due mainly to the
selection of a sufficient number of documents D and to the extraction of a very
reduced set of relevant terms T for retrieval.
","[{'version': 'v1', 'created': 'Mon, 17 Jun 2013 19:14:12 GMT'}]",2013-06-18,"[['Amine', 'Abderrahim Mohammed El', ''], ['Said', 'Benameur', ''], ['Alaeddine', 'Abderrahim Mohammed', '']]","['Arabic Information Retrieval', 'Pseudo Relevance Feedback', 'Local Analysis', 'Query Reformulation']"
18476,1402.2782,Roland Glantz,"Roland Glantz, Henning Meyerhenke, Christian Schulz",Tree-based Coarsening and Partitioning of Complex Networks,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many applications produce massive complex networks whose analysis would
benefit from parallel processing. Parallel algorithms, in turn, often require a
suitable network partition. For solving optimization tasks such as graph
partitioning on large networks, multilevel methods are preferred in practice.
Yet, complex networks pose challenges to established multilevel algorithms, in
particular to their coarsening phase.
  One way to specify a (recursive) coarsening of a graph is to rate its edges
and then contract the edges as prioritized by the rating. In this paper we (i)
define weights for the edges of a network that express the edges' importance
for connectivity, (ii) compute a minimum weight spanning tree $T^m$ with
respect to these weights, and (iii) rate the network edges based on the
conductance values of $T^m$'s fundamental cuts. To this end, we also (iv)
develop the first optimal linear-time algorithm to compute the conductance
values of \emph{all} fundamental cuts of a given spanning tree. We integrate
the new edge rating into a leading multilevel graph partitioner and equip the
latter with a new greedy postprocessing for optimizing the maximum
communication volume (MCV). Experiments on bipartitioning frequently used
benchmark networks show that the postprocessing already reduces MCV by 11.3%.
Our new edge rating further reduces MCV by 10.3% compared to the previously
best rating with the postprocessing in place for both ratings. In total, with a
modest increase in running time, our new approach reduces the MCV of complex
network partitions by 20.4%.
","[{'version': 'v1', 'created': 'Wed, 12 Feb 2014 10:53:01 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Feb 2014 10:56:20 GMT'}]",2014-02-14,"[['Glantz', 'Roland', ''], ['Meyerhenke', 'Henning', ''], ['Schulz', 'Christian', '']]","['Graph coarsening', 'multilevel graph partitioning', 'complex networks', 'fundamental cuts', 'spanning trees']"
18477,1402.5180,Majid Janzamin,Animashree Anandkumar and Rong Ge and Majid Janzamin,"Guaranteed Non-Orthogonal Tensor Decomposition via Alternating Rank-$1$
  Updates","We have added an additional sub-algorithm to remove the (approximate)
  residual error left after the tensor power iteration",,,,cs.LG math.NA stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we provide local and global convergence guarantees for
recovering CP (Candecomp/Parafac) tensor decomposition. The main step of the
proposed algorithm is a simple alternating rank-$1$ update which is the
alternating version of the tensor power iteration adapted for asymmetric
tensors. Local convergence guarantees are established for third order tensors
of rank $k$ in $d$ dimensions, when $k=o \bigl( d^{1.5} \bigr)$ and the tensor
components are incoherent. Thus, we can recover overcomplete tensor
decomposition. We also strengthen the results to global convergence guarantees
under stricter rank condition $k \le \beta d$ (for arbitrary constant $\beta >
1$) through a simple initialization procedure where the algorithm is
initialized by top singular vectors of random tensor slices. Furthermore, the
approximate local convergence guarantees for $p$-th order tensors are also
provided under rank condition $k=o \bigl( d^{p/2} \bigr)$. The guarantees also
include tight perturbation analysis given noisy tensor.
","[{'version': 'v1', 'created': 'Fri, 21 Feb 2014 01:37:02 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Jun 2014 16:29:13 GMT'}, {'version': 'v3', 'created': 'Sun, 3 Aug 2014 22:00:58 GMT'}, {'version': 'v4', 'created': 'Wed, 4 Mar 2015 20:40:42 GMT'}]",2015-03-05,"[['Anandkumar', 'Animashree', ''], ['Ge', 'Rong', ''], ['Janzamin', 'Majid', '']]","['Tensor decomposition', 'alternating minimization', 'overcomplete representation', 'latentvariable models']"
18478,0905.4596,Dominique Duval,"Dominique Duval (LMC - IMAG), Jean-Claude Reynaud (LSR - IMAG)",About raising and handling exceptions,,,,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a unified framework for dealing with a deduction system
and a denotational semantics of exceptions. It is based on the fact that
handling exceptions can be seen as a kind of generalized case distinction. This
point of view on exceptions has been introduced in 2004, it is based on the
notion of diagrammatic logic, which assumes some familiarity with category
theory. Extensive sums of types can be used for dealing with case distinctions.
The aim of this new paper is to focus on the role of generalized extensivity
property for dealing with exceptions. Moreover, the presentation of this paper
makes only a restricted use of category theory.
","[{'version': 'v1', 'created': 'Thu, 28 May 2009 10:01:47 GMT'}]",2009-05-29,"[['Duval', 'Dominique', '', 'LMC - IMAG'], ['Reynaud', 'Jean-Claude', '', 'LSR - IMAG']]","['semantics of exceptions', 'case distinction', 'extensive sums', 'diagrammatic logic']"
18479,0804.0879,Serban E. Vlad,Serban E. Vlad,The equations of the ideal latches,"The 12-th Conference on Applied and Industrial Mathematics CAIM 2004,
  University of Pitesti, October 15-17, 2004",,,,cs.GL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The latches are simple circuits with feedback from the digital electrical
engineering. We have included in our work the C element of Muller, the RS
latch, the clocked RS latch, the D latch and also circuits containing two
interconnected latches: the edge triggered RS flip-flop, the D flip-flop, the
JK flip-flop, the T flip-flop. The purpose of this study is to model with
equations the previous circuits, considered to be ideal, i.e. non-inertial. The
technique of analysis is the pseudoboolean differential calculus.
","[{'version': 'v1', 'created': 'Sat, 5 Apr 2008 23:55:16 GMT'}]",2008-12-18,"[['Vlad', 'Serban E.', '']]","['latch', 'flip-flop', 'pseudo-boolean equations']"
18480,1402.1425,Ragnar Nevries,Ragnar Nevries and Christian Rosenke,Towards a Characterization of Leaf Powers by Clique Arrangements,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The class ${\cal L}_k$ of $k$-leaf powers consists of graphs $G=(V,E)$ that
have a $k$-leaf root, that is, a tree $T$ with leaf set $V$, where $xy \in E$,
if and only if the $T$-distance between $x$ and $y$ is at most $k$. Structure
and linear time recognition algorithms have been found for $2$-, $3$-, $4$-,
and, to some extent, $5$-leaf powers, and it is known that the union of all
$k$-leaf powers, that is, the graph class ${\cal L} = \bigcup_{k=2}^\infty
{\cal L}_k$, forms a proper subclass of strongly chordal graphs. Despite from
that, no essential progress has been made lately. In this paper, we use the new
notion of clique arrangements to suggest that leaf powers are a natural special
case of strongly chordal graphs. The clique arrangement ${\cal A}(G)$ of a
chordal graph $G$ is a directed graph that represents the intersections between
maximal cliques of $G$ by nodes and the mutual inclusion of these vertex
subsets by arcs. Recently, strongly chordal graphs have been characterized as
the graphs that have a clique arrangement without bad $k$-cycles for $k \geq
3$. We show that the clique arrangement of every graph of ${\cal L}$ is free of
bad $2$-cycles. The question whether this characterizes the class ${\cal L}$
exactly remains open.
","[{'version': 'v1', 'created': 'Thu, 6 Feb 2014 17:35:18 GMT'}]",2014-02-07,"[['Nevries', 'Ragnar', ''], ['Rosenke', 'Christian', '']]","['Leaf Powers', 'Clique Arrangement', 'Strongly Chordal Graphs', 'NeSTGraphs']"
18481,1008.1629,Sabu Thampi m,"Sabu M. Thampi, Chandra Sekaran K",Survey of Search and Replication Schemes in Unstructured P2P Networks,39 Pages 5 Figures,"Network Protocols and Algorithms, ISSN 1943-3581, Vol. 2, No. 1,
  2010",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  P2P computing lifts taxing issues in various areas of computer science. The
largely used decentralized unstructured P2P systems are ad hoc in nature and
present a number of research challenges. In this paper, we provide a
comprehensive theoretical survey of various state-of-the-art search and
replication schemes in unstructured P2P networks for file-sharing applications.
The classifications of search and replication techniques and their advantages
and disadvantages are briefly explained. Finally, the various issues on
searching and replication for unstructured P2P networks are discussed.
","[{'version': 'v1', 'created': 'Tue, 10 Aug 2010 04:28:45 GMT'}]",2010-08-11,"[['Thampi', 'Sabu M.', ''], ['K', 'Chandra Sekaran', '']]","['Replication', 'Searching', 'Unstructured P2P network']"
18482,1312.4527,Khoat Than,Khoat Than and Tu Bao Ho,Probable convexity and its application to Correlated Topic Models,22 pages,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Non-convex optimization problems often arise from probabilistic modeling,
such as estimation of posterior distributions. Non-convexity makes the problems
intractable, and poses various obstacles for us to design efficient algorithms.
In this work, we attack non-convexity by first introducing the concept of
\emph{probable convexity} for analyzing convexity of real functions in
practice. We then use the new concept to analyze an inference problem in the
\emph{Correlated Topic Model} (CTM) and related nonconjugate models. Contrary
to the existing belief of intractability, we show that this inference problem
is concave under certain conditions. One consequence of our analyses is a novel
algorithm for learning CTM which is significantly more scalable and qualitative
than existing methods. Finally, we highlight that stochastic gradient
algorithms might be a practical choice to resolve efficiently non-convex
problems. This finding might find beneficial in many contexts which are beyond
probabilistic modeling.
","[{'version': 'v1', 'created': 'Mon, 16 Dec 2013 09:34:43 GMT'}]",2013-12-18,"[['Than', 'Khoat', ''], ['Ho', 'Tu Bao', '']]","['Non-convex optimization', 'Posterior estimation', 'Posterior inference', 'Nonconjugate models', 'CTM', 'Stochastic gradient decent']"
18483,1009.2252,Masud Hasan,"Masud Hasan, Mohammad Monoar Hossain, Alejandro L\'opez-Ortiz, Sabrina
  Nusrat, Saad Altaful Quader and Nabila Rahman",Some New Equiprojective Polyhedra,"10 pages, 8 figures",,,,cs.CG cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A convex polyhedron $P$ is $k$-equiprojective if all of its orthogonal
projections, i.e., shadows, except those parallel to the faces of $P$ are
$k$-gon for some fixed value of $k$. Since 1968, it is an open problem to
construct all equiprojective polyhedra. Recently, Hasan and Lubiw [CGTA
40(2):148-155, 2008] have given a characterization of equiprojective polyhedra.
Based on their characterization, in this paper we discover some new
equiprojective polyhedra by cutting and gluing existing polyhedra.
","[{'version': 'v1', 'created': 'Sun, 12 Sep 2010 17:32:19 GMT'}]",2010-09-14,"[['Hasan', 'Masud', ''], ['Hossain', 'Mohammad Monoar', ''], ['López-Ortiz', 'Alejandro', ''], ['Nusrat', 'Sabrina', ''], ['Quader', 'Saad Altaful', ''], ['Rahman', 'Nabila', '']]","['Algorithm', 'equiprojective polyhedra', 'orthogonal projection', 'prism', 'zonohedra']"
18484,1304.6499,Frank Nielsen,Frank Nielsen,Logging safely in public spaces using color PINs,,,,,cs.HC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, we are increasingly logging on many different Internet sites to
access private data like emails or photos remotely stored in the clouds. This
makes us all the more concerned with digital identity theft and passwords being
stolen either by key loggers or shoulder-surfing attacks. Quite surprisingly,
the current bottleneck of computer security when logging for authentication is
the User Interface (UI): How can we enter safely secret passwords when
concealed spy cameras or key loggers may be recording the login session?
Logging safely requires to design a secure Human Computer Interface (HCI)
robust to those attacks. We describe a novel method and system based on
entering secret ID passwords by means of associative secret UI passwords that
provides zero-knowledge to observers. We demonstrate the principles using a
color Personal Identification Numbers (PINs) login system and describes its
various extensions.
","[{'version': 'v1', 'created': 'Wed, 24 Apr 2013 07:52:22 GMT'}]",2013-04-25,"[['Nielsen', 'Frank', '']]","['HCI', 'password', 'PIN', 'shoulder-surfing attack', 'key logger', 'onetime password']"
18485,1609.05394,Barack Wanjawa Mr.,Barack Wamkaya Wanjawa,"Predicting Future Shanghai Stock Market Price using ANN in the Period
  21-Sep-2016 to 11-Oct-2016","10 pages, 2 figures, 1 table",,,,cs.LG q-fin.ST,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predicting the prices of stocks at any stock market remains a quest for many
investors and researchers. Those who trade at the stock market tend to use
technical, fundamental or time series analysis in their predictions. These
methods usually guide on trends and not the exact likely prices. It is for this
reason that Artificial Intelligence systems, such as Artificial Neural Network,
that is feedforward multi-layer perceptron with error backpropagation, can be
used for such predictions. A difficulty in neural network application is the
determination of suitable network parameters. A previous research by the author
already determined the network parameters as 5:21:21:1 with 80% training data
or 4-year of training data as a good enough model for stock prediction. This
model has been put to the test in predicting selected Shanghai Stock Exchange
stocks in the future period of 21-Sep-2016 to 11-Oct-2016, about one week after
the publication of these predictions. The research aims at confirming that
simple neural network systems can be quite powerful in typical stock market
predictions.
","[{'version': 'v1', 'created': 'Sat, 17 Sep 2016 21:37:10 GMT'}]",2016-09-20,"[['Wanjawa', 'Barack Wamkaya', '']]","['ANN', 'Neural Networks', 'Prediction', 'Shanghai Stock Exchange']"
18486,1406.4803,Deepshree Vadeyar,"Deepshree A. Vadeyar, Yogish H.K",Reorganization of Links to Improve User Navigation,,,,,cs.HC cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Website can be easily design but to efficient user navigation is not a easy
task since user behavior is keep changing and developer view is quite different
from what user wants, so to improve navigation one way is reorganization of
website structure. For reorganization here proposed strategy is farthest first
traversal clustering algorithm perform clustering on two numeric parameters and
for finding frequent traversal path of user Apriori algorithm is used. Our aim
is to perform reorganization with fewer changes in website structure.
","[{'version': 'v1', 'created': 'Wed, 18 Jun 2014 17:25:06 GMT'}]",2014-06-19,"[['Vadeyar', 'Deepshree A.', ''], ['K', 'Yogish H.', '']]","['Farthest-first', 'web mining', 'website design', 'web logs']"
18487,1003.1010,Anca Muscholl,"Blaise Genest (INRIA - Irisa), Anca Muscholl (LaBRI), Zhilin Wu
  (LaBRI)",Verifying Recursive Active Documents with Positive Data Tree Rewriting,,,,,cs.DB cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a data tree-rewriting framework for modeling evolving
documents. The framework is close to Guarded Active XML, a platform used for
handling XML repositories evolving through web services. We focus on automatic
verification of properties of evolving documents that can contain data from an
infinite domain. We establish the boundaries of decidability, and show that
verification of a {\em positive} fragment that can handle recursive service
calls is decidable. We also consider bounded model-checking in our data
tree-rewriting framework and show that it is $\nexptime$-complete.
","[{'version': 'v1', 'created': 'Thu, 4 Mar 2010 10:31:01 GMT'}]",2010-03-05,"[['Genest', 'Blaise', '', 'INRIA - Irisa'], ['Muscholl', 'Anca', '', 'LaBRI'], ['Wu', 'Zhilin', '', 'LaBRI']]","['Active documents', 'Guarded Active XML', 'automated verification', 'data tree rewriting', 'tree decompositions']"
18488,1004.0515,Mahmoud Khademi,"Mahmoud Khademi, Mohammad T. Manzuri-Shalmani, Mohammad H. Kiapour,
  and Ali A. Kiaei","Recognizing Combinations of Facial Action Units with Different Intensity
  Using a Mixture of Hidden Markov Models and Neural Network",,"LNCS vol. 5997, pp. 304--313, Springer, Heidelberg (Proc. of 9th
  IAPR Workshop on Multiple Classifier Systems), 2010.",,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Facial Action Coding System consists of 44 action units (AUs) and more than
7000 combinations. Hidden Markov models (HMMs) classifier has been used
successfully to recognize facial action units (AUs) and expressions due to its
ability to deal with AU dynamics. However, a separate HMM is necessary for each
single AU and each AU combination. Since combinations of AU numbering in
thousands, a more efficient method will be needed. In this paper an accurate
real-time sequence-based system for representation and recognition of facial
AUs is presented. Our system has the following characteristics: 1) employing a
mixture of HMMs and neural network, we develop a novel accurate classifier,
which can deal with AU dynamics, recognize subtle changes, and it is also
robust to intensity variations, 2) although we use an HMM for each single AU
only, by employing a neural network we can recognize each single and
combination AU, and 3) using both geometric and appearance-based features, and
applying efficient dimension reduction techniques, our system is robust to
illumination changes and it can represent the temporal information involved in
formation of the facial expressions. Extensive experiments on Cohn-Kanade
database show the superiority of the proposed method, in comparison with other
classifiers. Keywords: classifier design and evaluation, data fusion, facial
action units (AUs), hidden Markov models (HMMs), neural network (NN).
","[{'version': 'v1', 'created': 'Sun, 4 Apr 2010 16:23:53 GMT'}]",2010-04-06,"[['Khademi', 'Mahmoud', ''], ['Manzuri-Shalmani', 'Mohammad T.', ''], ['Kiapour', 'Mohammad H.', ''], ['Kiaei', 'Ali A.', '']]","['classifier design and evaluation', 'data fusion', 'facial action units (AUs)', 'hidden Markov models (HMMs)', 'neural network (NN)']"
18489,1401.1910,"J\""urgen M\""unch","Martin Kowalczyk, J\""urgen M\""unch, Masafumi Katahira, Tatsuya Kaneko,
  Yuko Miyamoto, Yumi Koishi",Aligning Software-related Strategies in Multi-Organizational Settings,"14 pages. The final publication is available at
  http://www.shaker.de/de/content/catalogue/index.asp?
  lang=de&ID=8&ISBN=978-3-8322-9618-6","Proceedings of the International Conference on Software Process
  and Product Measurement (IWSM/MetriKon/ Mensura 2010), pages 261-274,
  Stuttgart, Germany, November 10-12 2010",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Aligning the activities of an organization with its business goals is a
challenging task that is critical for success. Alignment in a
multi-organizational setting requires the integration of different internal or
external organizational units. The anticipated benefits of multi-organizational
alignment consist of clarified contributions and increased transparency of the
involved organizational units. The GQM+Strategies approach provides mechanisms
for explicitly linking goals and strategies within an organization and is based
on goal-oriented measurement. This paper presents the process and first-hand
experience of applying GQM+Strategies in a multi-organizational setting from
the aerospace industry. Additionally, the resulting GQM+Strategies grid is
sketched and selected parts are discussed. Finally, the results are reflected
on and an overview of future work is given.
","[{'version': 'v1', 'created': 'Thu, 9 Jan 2014 07:38:07 GMT'}]",2014-01-10,"[['Kowalczyk', 'Martin', ''], ['Münch', 'Jürgen', ''], ['Katahira', 'Masafumi', ''], ['Kaneko', 'Tatsuya', ''], ['Miyamoto', 'Yuko', ''], ['Koishi', 'Yumi', '']]","['Measurement-based business IT alignment', 'multi-organizational goal alignment', 'GQM+Strategies deployment', 'strategic measurement systems']"
18490,0711.0829,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",Instruction sequences with indirect jumps,"23 pages; typos corrected, phrasing improved, reference replaced","Scientific Annals of Computer Science, 17:19--46, 2007.
  http://www.infoiasi.ro/bin/download/Annals/XVII/XVII_1.pdf",,PRG0709,cs.PL,,"  We study sequential programs that are instruction sequences with direct and
indirect jump instructions. The intuition is that indirect jump instructions
are jump instructions where the position of the instruction to jump to is the
content of some memory cell. We consider several kinds of indirect jump
instructions. For each kind, we define the meaning of programs with indirect
jump instructions of that kind by means of a translation into programs without
indirect jump instructions. For each kind, the intended behaviour of a program
with indirect jump instructions of that kind under execution is the behaviour
of the translated program under execution on interaction with some memory
device.
","[{'version': 'v1', 'created': 'Tue, 6 Nov 2007 10:26:03 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Dec 2007 07:58:45 GMT'}]",2008-04-08,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['instruction sequence', 'indirect jump instruction', 'projectionsemantics', 'program algebra', 'thread algebra']"
18491,1609.06379,Daniel Hausmann Daniel Hausmann,"Daniel Hausmann, Lutz Schr\""oder and Christoph Egger",Global Caching for the Alternation-free $\mu$-Calculus,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a sound, complete, and optimal single-pass tableau algorithm for
the alternation-free $\mu$-calculus. The algorithm supports global caching with
intermediate propagation and runs in time $2^{\mathcal{O}(n)}$. In
game-theoretic terms, our algorithm integrates the steps for constructing and
solving the B\""uchi game arising from the input tableau into a single
procedure; this is done on-the-fly, i.e. may terminate before the game has been
fully constructed. This suggests a slogan to the effect that global caching =
game solving on-the-fly. A prototypical implementation shows promising initial
results.
","[{'version': 'v1', 'created': 'Tue, 20 Sep 2016 22:56:46 GMT'}]",2016-09-22,"[['Hausmann', 'Daniel', ''], ['Schröder', 'Lutz', ''], ['Egger', 'Christoph', '']]","['modal logic', 'fixpoint logic', 'satisfiability', 'global caching', 'coalgebraic logic']"
18492,1610.09743,Hala Assal,"Hala Assal, Ahsan Imran, Sonia Chiasson",An Exploration of Graphical Password Authentication for Children,,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we explore graphical passwords as a child-friendly alternative
for user authentication. We evaluate the usability of three variants of the
PassTiles graphical password scheme for children, and explore the similarities
and differences in performance and preferences between children and adults
while using these schemes. Children were most successful at recalling passwords
containing images of distinct objects. Both children and adults prefer
graphical passwords to their existing schemes, but password memorization
strategies differ considerably between the two groups. Based on our findings,
we provide recommendations for designing more child-friendly authentication
schemes.
","[{'version': 'v1', 'created': 'Mon, 31 Oct 2016 00:19:00 GMT'}]",2016-11-01,"[['Assal', 'Hala', ''], ['Imran', 'Ahsan', ''], ['Chiasson', 'Sonia', '']]","['Children authentication', 'Graphical passwords', 'Usability evaluation']"
18493,1111.2826,Carla Ferreira,A.Gravell and Y. Howard and J.C. Augusto and C. Ferreira and S. Gruner,Concurrent Development of Model and Implementation,,"16th International Conference on Software and Systems Engineering
  and their Applications (ICSSEA 2003)",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers how a formal mathematically-based model can be used in
support of evolutionary software development, and in particular how such a
model can be kept consistent with the implementation as it changes to meet new
requirements. A number of techniques are listed can make use of such a model to
enhance the development process, and also ways to keep model and implementation
consistent. The effectiveness of these techniques is investigated through two
case studies concerning the development of small e-business applications, a
travel agent and a mortgage broker. Some successes are reported, notably in the
use of rapid throwaway modelling to investigate design alternatives, and also
in the use of close team working and modelbased trace-checking to maintain
synchronisation between model and implementation throughout the development.
The main areas of weakness were seen to derive from deficiencies in tool
support. Recommendations are therefore made for future improvements to tools
supporting formal models which would, in principle, make this co-evolutionary
approach attractive to industrial software developers. It is claimed that in
fact tools already exist that provide the desired facilities, but these are not
necessarily production-quality, and do not all support the same notations, and
hence cannot be used together.
","[{'version': 'v1', 'created': 'Fri, 11 Nov 2011 19:15:09 GMT'}]",2011-11-14,"[['Gravell', 'A.', ''], ['Howard', 'Y.', ''], ['Augusto', 'J. C.', ''], ['Ferreira', 'C.', ''], ['Gruner', 'S.', '']]","['evolutionary development', 'formal models', 'model-checking', 'UML and B']"
18494,1504.03834,Pornchai Phukpattaranont Dr,Pornchai Phukpattaranont,"Comparisons of wavelet functions in QRS signal to noise ratio
  enhancement and detection accuracy","16 pages, 8 figures, Article submitted to Journal of the Korean
  Physical Society for considering of publication",,,,cs.CV cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We compare the capability of wavelet functions used for noise removal in
preprocessing step of a QRS detection algorithm in the electrocardiogram (ECG)
signal. The QRS signal to noise ratio enhancement and the detection accuracy of
each wavelet function are evaluated using three measures: (1) the ratio of the
maximum beat amplitude to the minimum beat amplitude (RMM), (2) the mean of
absolute of time error (MATE), and (3) the figure of merit (FOM). Three wavelet
functions from previous well-known publications are explored, i.e., Bior1.3,
Db10, and Mexican hat wavelet functions. Results evaluated with the ECG signal
from MIT-BIH arrhythmia database show that the Mexican hat wavelet function is
better than the others. While the scale 8 of Mexican hat wavelet function can
provide the best enhancement in QRS signal to noise ratio, the scale 4 of
Mexican hat wavelet function can provide the best detection accuracy. These
results may be combined and may enable the use of a single fixed threshold for
all ECG records leading to the reduction in computational complexity of the QRS
detection algorithm.
","[{'version': 'v1', 'created': 'Wed, 15 Apr 2015 09:22:31 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Apr 2015 04:35:37 GMT'}]",2015-04-17,"[['Phukpattaranont', 'Pornchai', '']]","['Electrocardiography (ECG)', 'Signal to noise ratio', 'QRS detection', 'Signal processing', 'Continuous']"
18495,1409.7780,Jim Jing-Yan Wang,"Jim Jing-Yan Wang, Yi Wang, Shiguang Zhao, Xin Gao",Maximum mutual information regularized classification,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a novel pattern classification approach is proposed by
regularizing the classifier learning to maximize mutual information between the
classification response and the true class label. We argue that, with the
learned classifier, the uncertainty of the true class label of a data sample
should be reduced by knowing its classification response as much as possible.
The reduced uncertainty is measured by the mutual information between the
classification response and the true class label. To this end, when learning a
linear classifier, we propose to maximize the mutual information between
classification responses and true class labels of training samples, besides
minimizing the classification error and reduc- ing the classifier complexity.
An objective function is constructed by modeling mutual information with
entropy estimation, and it is optimized by a gradi- ent descend method in an
iterative algorithm. Experiments on two real world pattern classification
problems show the significant improvements achieved by maximum mutual
information regularization.
","[{'version': 'v1', 'created': 'Sat, 27 Sep 2014 07:45:56 GMT'}]",2014-09-30,"[['Wang', 'Jim Jing-Yan', ''], ['Wang', 'Yi', ''], ['Zhao', 'Shiguang', ''], ['Gao', 'Xin', '']]","['Pattern Classification', 'Maximum Mutual Information', 'Entropy', 'Gradient Descend']"
18496,1606.06650,"\""Ozg\""un \c{C}i\c{c}ek","\""Ozg\""un \c{C}i\c{c}ek, Ahmed Abdulkadir, Soeren S. Lienkamp, Thomas
  Brox, and Olaf Ronneberger",3D U-Net: Learning Dense Volumetric Segmentation from Sparse Annotation,Conditionally accepted for MICCAI 2016,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a network for volumetric segmentation that learns from
sparsely annotated volumetric images. We outline two attractive use cases of
this method: (1) In a semi-automated setup, the user annotates some slices in
the volume to be segmented. The network learns from these sparse annotations
and provides a dense 3D segmentation. (2) In a fully-automated setup, we assume
that a representative, sparsely annotated training set exists. Trained on this
data set, the network densely segments new volumetric images. The proposed
network extends the previous u-net architecture from Ronneberger et al. by
replacing all 2D operations with their 3D counterparts. The implementation
performs on-the-fly elastic deformations for efficient data augmentation during
training. It is trained end-to-end from scratch, i.e., no pre-trained network
is required. We test the performance of the proposed method on a complex,
highly variable 3D structure, the Xenopus kidney, and achieve good results for
both use cases.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2016 16:42:20 GMT'}]",2016-06-22,"[['Çiçek', 'Özgün', ''], ['Abdulkadir', 'Ahmed', ''], ['Lienkamp', 'Soeren S.', ''], ['Brox', 'Thomas', ''], ['Ronneberger', 'Olaf', '']]","['Convolutional Neural Networks', '3D', 'Biomedical Volumetric Image Segmentation', 'Xenopus Kidney', 'Semi-automated', 'Fully-automated', 'Sparse Annotation']"
18497,1306.2267,Patrizio Dazzi,Patrizio Dazzi,Let's Annotate to Let Our Code Run in Parallel,"4 pages, 1 figure",,,,cs.PL cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an approach that exploits Java annotations to provide
meta information needed to automatically transform plain Java programs into
parallel code that can be run on multicore workstation. Programmers just need
to decorate the methods that will eventually be executed in parallel with
standard Java annotations. Annotations are automatically processed at
launch-time and parallel byte code is derived. Once in execution the program
automatically retrieves the information about the executing platform and
evaluates the information specified inside the annotations to transform the
byte-code into a semantically equivalent multithreaded version, depending on
the target architecture features. The results returned by the annotated
methods, when invoked, are futures with a wait-by-necessity semantics.
","[{'version': 'v1', 'created': 'Thu, 6 Jun 2013 13:07:30 GMT'}]",2013-06-11,"[['Dazzi', 'Patrizio', '']]","['Asynchronous method invocation', 'wait-by-necessity', 'annotations', 'skeletons', 'grids']"
18498,1105.2554,Lars Bergstrom,"Sven Auhagen, Lars Bergstrom, Matthew Fluet, John Reppy",Garbage Collection for Multicore NUMA Machines,To appear in Memory Systems Performance and Correctness 2011 (MSPC11),,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern high-end machines feature multiple processor packages, each of which
contains multiple independent cores and integrated memory controllers connected
directly to dedicated physical RAM. These packages are connected via a shared
bus, creating a system with a heterogeneous memory hierarchy. Since this shared
bus has less bandwidth than the sum of the links to memory, aggregate memory
bandwidth is higher when parallel threads all access memory local to their
processor package than when they access memory attached to a remote package.
This bandwidth limitation has traditionally limited the scalability of modern
functional language implementations, which seldom scale well past 8 cores, even
on small benchmarks.
  This work presents a garbage collector integrated with our strict, parallel
functional language implementation, Manticore, and shows that it scales
effectively on both a 48-core AMD Opteron machine and a 32-core Intel Xeon
machine.
","[{'version': 'v1', 'created': 'Thu, 12 May 2011 19:41:34 GMT'}]",2011-05-13,"[['Auhagen', 'Sven', ''], ['Bergstrom', 'Lars', ''], ['Fluet', 'Matthew', ''], ['Reppy', 'John', '']]","['garbage collection', 'parallelism', 'NUMA']"
18499,1009.2902,Jan Bergstra,Jan A. Bergstra,Informal Control code logic,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  General definitions as well as rules of reasoning regarding control code
production, distribution, deployment, and usage are described. The role of
testing, trust, confidence and risk analysis is considered. A rationale for
control code testing is sought and found for the case of safety critical
embedded control code.
","[{'version': 'v1', 'created': 'Wed, 15 Sep 2010 12:02:04 GMT'}]",2010-09-16,"[['Bergstra', 'Jan A.', '']]","['(polyadic) control code', 'box', 'execution', 'testing', 'risk analysis']"
18500,1501.05714,Qi Zhang,"Meizhu Li, Qi Zhang, Qi Liu, Yong Deng",Identification of influential nodes in network of networks,3 figures,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The network of networks(NON) research is focused on studying the properties
of n interdependent networks which is ubiquitous in the real world. Identifying
the influential nodes in the network of networks is theoretical and practical
significance. However, it is hard to describe the structure property of the NON
based on traditional methods. In this paper, a new method is proposed to
identify the influential nodes in the network of networks base on the evidence
theory. The proposed method can fuse different kinds of relationship between
the network components to constructed a comprehensive similarity network. The
nodes which have a big value of similarity are the influential nodes in the
NON. The experiment results illustrate that the proposed method is reasonable
and significant
","[{'version': 'v1', 'created': 'Fri, 23 Jan 2015 05:03:40 GMT'}]",2015-01-26,"[['Li', 'Meizhu', ''], ['Zhang', 'Qi', ''], ['Liu', 'Qi', ''], ['Deng', 'Yong', '']]","['Network of networks', 'Evidence theory', 'Influential nodes']"
18501,1401.8022,Lili Su,"Lili Su, Olgica Milenkovic",Synchronizing Rankings via Interactive Communication,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of exact synchronization of two rankings at remote
locations connected by a two-way channel. Such synchronization problems arise
when items in the data are distinguishable, as is the case for playlists,
tasklists, crowdvotes and recommender systems rankings. Our model accounts for
different constraints on the communication throughput of the forward and
feedback links, resulting in different anchoring, syndrome and checksum
computation strategies. Information editing is assumed of the form of
deletions, insertions, block deletions/insertions, translocations and
transpositions. The protocols developed under the given model are order-optimal
with respect to genie aided lower bounds.
","[{'version': 'v1', 'created': 'Thu, 30 Jan 2014 23:10:59 GMT'}, {'version': 'v2', 'created': 'Wed, 12 Feb 2014 00:41:32 GMT'}]",2014-02-13,"[['Su', 'Lili', ''], ['Milenkovic', 'Olgica', '']]","['[7]', 'bioinformatics and gene prioritization', 'where one ranks genes according to']"
18502,1306.3507,Faissal Ouardi,Jean-Marc Champarnaud and Faissal Ouardi and Djelloul Ziadi,"Extended to Multi-Tilde-Bar Regular Expressions and Efficient Finite
  Automata Constructions",,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several algorithms have been designed to convert a regular expression into an
equivalent finite automaton. One of the most popular constructions, due to
Glushkov and to McNaughton and Yamada, is based on the computation of the Null,
First, Last and Follow sets (called Glushkov functions) associated with a
linearized version of the expression. Recently Mignot considered a family of
extended expressions called Extended to multi-tilde-bar Regular Expressions
(EmtbREs) and he showed that, under some restrictions, Glushkov functions can
be defined for an EmtbRE. In this paper we present an algorithm which
efficiently computes the Glushkov functions of an unrestricted EmtbRE. Our
approach is based on a recursive definition of the language associated with an
EmtbRE which enlightens the fact that the worst case time complexity of the
conversion of an EmtbRE into an automaton is related to the worst case time
complexity of the computation of the Null function. Finally we show how to
extend the ZPC-structure to EmtbREs, which allows us to apply to this family of
extended expressions the efficient constructions based on this structure (in
particular the construction of the c-continuation automaton, the position
automaton, the follow automaton and the equation automaton).
","[{'version': 'v1', 'created': 'Fri, 14 Jun 2013 20:32:31 GMT'}]",2013-06-18,"[['Champarnaud', 'Jean-Marc', ''], ['Ouardi', 'Faissal', ''], ['Ziadi', 'Djelloul', '']]","['Regular Expressions and languages', 'Finite automata', 'ComputationComplexity']"
18503,1303.7115,Dmitry Namiot,"Dmitry Namiot, Manfred Schneps-Schneppe",Smart Cities Software from the developer's point of view,"8 pages, submitted to 6-th Conference Applied Information and
  Communication Technology AICT2013",,,,cs.CY cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper discusses the current state and development proposals for Smart
Cities and Future Internet projects. Definitions of a Smart City can vary but
usually tend to suggest the use of innovative Info-Communication technologies
such as the Internet of Things and Web 2.0 to deliver more effective and
efficient public services that improve living and working conditions and create
more sustainable urban environments. Our goal is to analyze the current
proposals from the developer's point of view, highlight the really new
elements, the positions borrowed from the existing tools as well as propose
some new extensions. We would like to discuss the possible extensions for the
existing proposals and describe add-ons that, by our opinion, let keep the
future research inline with the modern approaches in the web development
domain.
","[{'version': 'v1', 'created': 'Thu, 28 Mar 2013 12:53:22 GMT'}]",2013-03-29,"[['Namiot', 'Dmitry', ''], ['Schneps-Schneppe', 'Manfred', '']]","['m2m', 'future internet', 'open API', 'Smart City', 'Web Intents']"
18504,1606.03528,Craig A. Horne,"Craig A. Horne, Atif Ahmad and Sean B. Maynard","Information Security Strategy in Organisations: Review, Discussion and
  Future Research Directions","ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
  Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/209,cs.CY cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Dependence on information, including for some of the world's largest
organisations such as governments and multi-national corporations, has grown
rapidly in recent years. However, reports of information security breaches and
their associated consequences continue to indicate that attacks are still
escalating on organisations when conducting these information-based activities.
Clearly, more research is needed to better understand how organisations should
formulate strategy to secure their information. Through a thematic review of
academic security literature, we (1) analyse the antecedent conditions that
motivate the potential adoption of a comprehensive information security
strategy, (2) the current perspectives of strategy and (3) the yields and
benefits that could be enjoyed post-adoption. Our contributions include a
definition of information security strategy. We argue for a paradigm shift to
extend from internally-focussed protection of organisation-wide information
towards a strategic view that considers the inter-organisational level. Our
findings are then used to suggest future research directions.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 02:53:06 GMT'}]",2016-06-14,"[['Horne', 'Craig A.', ''], ['Ahmad', 'Atif', ''], ['Maynard', 'Sean B.', '']]","['Information security strategy', 'organisational strategy', 'security quality', 'strategic information systems', 'business management']"
18505,1212.3889,Shashank Mehta,"Pawan Aurora, Sumit Singh, Shashank K. Mehta",Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds,12 pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the Partial Degree Bounded Edge Packing (PDBEP) problem introduced
in [5] by Zhang. They have shown that this problem is NP-Hard even for uniform
degree constraint. They also presented approximation algorithms for the case
when all the vertices have degree constraint of 1 and 2 with approximation
ratio of 2 and 32=11 respectively. In this work we study general degree
constraint case (arbitrary degree constraint for each vertex) and present two
combinatorial approximation algorithms with approximation factors 4 and 2. We
also study integer program based solution and present an iterative rounding
algorithm with approximation factor 3/(1 - \epsilon)^2 for any positive
\epsilon. Next we study the same problem with weighted edges. In this case we
present an O(log n) approximation algorithm. Zhang has given an exact O(n^2)
complexity algorithm for trees in case of uniform degree constraint. We improve
their result by giving O(nlog n) complexity exact algorithm for trees with
general degree constraint.
","[{'version': 'v1', 'created': 'Mon, 17 Dec 2012 05:28:46 GMT'}]",2012-12-18,"[['Aurora', 'Pawan', ''], ['Singh', 'Sumit', ''], ['Mehta', 'Shashank K.', '']]","['Edge-Packing Problems', 'Iterative Rounding', 'Lagrangian Relaxation']"
18506,0903.2516,Susan Khor,Susan Khor,Effect of Degree Distribution on Evolutionary Search,,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a method to generate hierarchically modular networks
with prescribed node degree list and proposes a metric to measure network
modularity based on the notion of edge distance. The generated networks are
used as test problems to explore the effect of modularity and degree
distribution on evolutionary algorithm performance. Results from the
experiments (i) confirm a previous finding that modularity increases the
performance advantage of genetic algorithms over hill climbers, and (ii)
support a new conjecture that test problems with modularized constraint
networks having heavy-tailed right-skewed degree distributions are more easily
solved than test problems with modularized constraint networks having
bell-shaped normal degree distributions.
","[{'version': 'v1', 'created': 'Sat, 14 Mar 2009 00:18:08 GMT'}]",2009-03-17,"[['Khor', 'Susan', '']]","['Network topology', 'hierarchy', 'modularity', 'degree distribution', 'mutation', 'crossover', 'evolutionary algorithm difficulty']"
18507,1407.4607,Thomas Hartmann,"Thomas Hartmann, Francois Fouquet, Yves Le Traon, Brice Morin","Leveraging Time Distortion for seamless Navigation into Data Space-Time
  Continuum",,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intelligent software systems continuously analyze their surrounding
environment and accordingly adapt their internal state. Depending on the
criticality index of the situation, the system should dynamically focus or
widen its analysis and reasoning scope. A naive -why have less when you can
have more- approach would consist in systematically sampling the context at a
very high rate and triggering the reasoning process regularly. This reasoning
process would then need to mine a huge amount of data, extract a relevant view,
and finally analyze this adequate view. This overall process would require some
heavy resources and/or be time-consuming, conflicting with the (near) real-time
response time requirements of intelligent systems. We claim that a continuous
and more flexible navigation into context models, in space and in time, can
significantly improve reasoning processes. This paper thus introduces a novel
modeling approach together with a navigation concept, which consider time and
locality as first-class properties crosscutting any model element, and enable
the seamless navigation of models in this space-time continuum. In particular,
we leverage a time-relative navigation (inspired by the space-time and
distortion theory [7]) able to efficiently empower continuous reasoning
processes. We integrate our approach into an open-source modeling framework and
evaluate it on a smart grid reasoning engine for electric load prediction. We
demonstrate that reasoners leveraging this distorted space-time continuum
outperform the full sampling approach, and is compatible with most of (near)
real-time requirements.
","[{'version': 'v1', 'created': 'Thu, 17 Jul 2014 09:16:07 GMT'}]",2014-07-18,"[['Hartmann', 'Thomas', ''], ['Fouquet', 'Francois', ''], ['Traon', 'Yves Le', ''], ['Morin', 'Brice', '']]","['Temporal data', 'Time distortion', 'Time-aware context modeling', 'Model-driven engineering', 'Reactive systems', 'Intelligence systems']"
18508,1208.6112,Xiaoxian Tang,"Xiaoxian Tang, Zhenghong Chen, Bican Xia",Generic Regular Decompositions for Generic Zero-Dimensional Systems,Accepted by Science China: Information Science,,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two new concepts, generic regular decomposition and
regular-decomposition-unstable (RDU) variety for generic zero-dimensional
systems, are introduced in this paper and an algorithm is proposed for
computing a generic regular decomposition and the associated RDU variety of a
given generic zero-dimensional system simultaneously. The solutions of the
given system can be expressed by finitely many zero-dimensional regular chains
if the parameter value is not on the RDU variety.
  The so called weakly relatively simplicial decomposition plays a crucial role
in the algorithm, which is based on the theories of subresultant chains.
Furthermore, the algorithm can be naturally adopted to compute a non-redundant
Wu's decomposition and the decomposition is stable at any parameter value that
is not on the RDU variety. The algorithm has been implemented with Maple 15 and
experimented with a number of benchmarks from the literature. Empirical results
are also presented to show the good performance of the algorithm.
","[{'version': 'v1', 'created': 'Thu, 30 Aug 2012 08:43:38 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Aug 2012 08:27:48 GMT'}, {'version': 'v3', 'created': 'Mon, 3 Sep 2012 06:27:13 GMT'}, {'version': 'v4', 'created': 'Wed, 16 Jan 2013 03:16:31 GMT'}]",2013-01-17,"[['Tang', 'Xiaoxian', ''], ['Chen', 'Zhenghong', ''], ['Xia', 'Bican', '']]","['generic zero-dimensional system', 'regular-decomposition-unstable variety', 'parametric triangular decomposition', 'generic regular decomposition']"
18509,1004.0799,Somayeh Salimi,"Somayeh Salimi, Mahmoud Salmasizadeh, Mohammad Reza Aref",Rate Regions of Secret Key Sharing in a New Source Model,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A source model for secret key generation between terminals is considered. Two
users, namely users 1 and 2, at one side communicate with another user, namely
user 3, at the other side via a public channel where three users can observe
i.i.d. outputs of correlated sources. Each of users 1 and 2 intends to share a
secret key with user 3 where user 1 acts as a wiretapper for user 2 and vice
versa. In this model, two situations are considered: communication from users 1
and 2 to user 3 (the forward key strategy) and from user 3 to users 1 and 2
(the backward key strategy). In both situations, the goal is sharing a secret
key between user 1 and user 3 while leaking no effective information about that
key to user 2, and simultaneously, sharing another secret key between user 2
and user 3 while leaking no effective information about the latter key to user
1. This model is motivated by wireless communications when considering user 3
as a base station and users 1 and 2 as network users. In this paper, for both
the forward and backward key strategies, inner and outer bounds of secret key
capacity regions are derived. In special situations where one of users 1 and 2
is only interested in wiretapping and not key sharing, our results agree with
that of Ahlswede and Csiszar. Also, we investigate some special cases in which
the inner bound coincides with the outer bound and secret key capacity region
is deduced.
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2010 08:45:35 GMT'}]",2010-04-07,"[['Salimi', 'Somayeh', ''], ['Salmasizadeh', 'Mahmoud', ''], ['Aref', 'Mohammad Reza', '']]","['Information theoretic security', 'secret key sharing', 'source model', 'secret key capacity region']"
18510,1307.3863,Meena Mahajan,Meena Mahajan,Algebraic Complexity Classes,"Corrected some typos, added some references",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This survey describes, at an introductory level, the algebraic complexity
framework originally proposed by Leslie Valiant in 1979, and some of the
insights that have been obtained more recently.
","[{'version': 'v1', 'created': 'Mon, 15 Jul 2013 09:31:15 GMT'}, {'version': 'v2', 'created': 'Mon, 9 Dec 2013 05:43:23 GMT'}]",2013-12-10,"[['Mahajan', 'Meena', '']]","['algebraic complexity', 'circuits', 'formulas', 'branchingprograms', 'determinant', 'permanent']"
18511,1108.5724,Gabriele Oliva,"Gabriele Oliva, Stefano Panzieri and Roberto Setola",On the Stability of Linear Discrete-Time Fuzzy Systems,,,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper the linear and stationary Discrete-time systems with state
variables and dynamic coefficients represented by fuzzy numbers are studied,
providing some stability criteria, and characterizing the bounds of the set of
solutions in the case of positive systems.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2011 19:41:11 GMT'}]",2011-09-05,"[['Oliva', 'Gabriele', ''], ['Panzieri', 'Stefano', ''], ['Setola', 'Roberto', '']]","['Fuzzy Systems', 'System Theory', 'Discrete-Time Systems']"
18512,1605.02941,Tomas Petricek,"Tomas Petricek, Gustavo Guerra, Don Syme",Types from data: Making structured data first-class citizens in F#,"In proceedings of ACM SIGPLAN conference on Programming Language
  Design and Implementation, PLDI 2016, Santa Barbara",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most modern applications interact with external services and access data in
structured formats such as XML, JSON and CSV. Static type systems do not
understand such formats, often making data access more cumbersome. Should we
give up and leave the messy world of external data to dynamic typing and
runtime checks? Of course, not!
  We present F# Data, a library that integrates external structured data into
F#. As most real-world data does not come with an explicit schema, we develop a
shape inference algorithm that infers a shape from representative sample
documents. We then integrate the inferred shape into the F# type system using
type providers. We formalize the process and prove a relative type soundness
theorem.
  Our library significantly reduces the amount of data access code and it
provides additional safety guarantees when contrasted with the widely used
weakly typed techniques.
","[{'version': 'v1', 'created': 'Tue, 10 May 2016 11:09:13 GMT'}]",2016-05-11,"[['Petricek', 'Tomas', ''], ['Guerra', 'Gustavo', ''], ['Syme', 'Don', '']]","['F#', 'Type Providers', 'Inference', 'JSON', 'XML']"
18513,1009.5346,Murugesan Kuttikrishnan,Murugesan Kuttikrishnan,"A Novel Approach for Cardiac Disease Prediction and Classification Using
  Intelligent Agents",8 pages 2 figures and 7 tables,"(IJCSIS) International Journal of Computer Science and Information
  Security, Vol. 8, No. 5, August 2010",,,cs.MA cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The goal is to develop a novel approach for cardiac disease prediction and
diagnosis using intelligent agents. Initially the symptoms are preprocessed
using filter and wrapper based agents. The filter removes the missing or
irrelevant symptoms. Wrapper is used to extract the data in the data set
according to the threshold limits. Dependency of each symptom is identified
using dependency checker agent. The classification is based on the prior and
posterior probability of the symptoms with the evidence value. Finally the
symptoms are classified in to five classes namely absence, starting, mild,
moderate and serious. Using the cooperative approach the cardiac problem is
solved and verified.
","[{'version': 'v1', 'created': 'Mon, 27 Sep 2010 18:20:56 GMT'}]",2010-09-28,"[['Kuttikrishnan', 'Murugesan', '']]","['Traditional Chinese Medicine (TCM)', 'Naïve Bayesian Classification (NBC)', 'Bayesian Networks (BN)']"
18514,1701.06439,Teik Koon Cheang,"Teik Koon Cheang, Yong Shean Chong, Yong Haur Tay",Segmentation-free Vehicle License Plate Recognition using ConvNet-RNN,"5 pages, 3 figures, International Workshop on Advanced Image
  Technology, January, 8-10, 2017. Penang, Malaysia. Proceeding IWAIT2017",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While vehicle license plate recognition (VLPR) is usually done with a sliding
window approach, it can have limited performance on datasets with characters
that are of variable width. This can be solved by hand-crafting algorithms to
prescale the characters. While this approach can work fairly well, the
recognizer is only aware of the pixels within each detector window, and fails
to account for other contextual information that might be present in other
parts of the image. A sliding window approach also requires training data in
the form of presegmented characters, which can be more difficult to obtain. In
this paper, we propose a unified ConvNet-RNN model to recognize real-world
captured license plate photographs. By using a Convolutional Neural Network
(ConvNet) to perform feature extraction and using a Recurrent Neural Network
(RNN) for sequencing, we address the problem of sliding window approaches being
unable to access the context of the entire image by feeding the entire image as
input to the ConvNet. This has the added benefit of being able to perform
end-to-end training of the entire model on labelled, full license plate images.
Experimental results comparing the ConvNet-RNN architecture to a sliding
window-based approach shows that the ConvNet-RNN architecture performs
significantly better.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2017 15:11:12 GMT'}]",2017-01-24,"[['Cheang', 'Teik Koon', ''], ['Chong', 'Yong Shean', ''], ['Tay', 'Yong Haur', '']]","['Vehicle license plate recognition', 'end-to-end recognition', 'ConvNet-RNN', 'segmentation-free recognition']"
18515,1106.1853,Ching-an Hsiao,Ching-an Hsiao and Xinchun Tian,Intelligent decision: towards interpreting the Pe Algorithm,"23pages, 12 figures, 7 tables",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The human intelligence lies in the algorithm, the nature of algorithm lies in
the classification, and the classification is equal to outlier detection. A lot
of algorithms have been proposed to detect outliers, meanwhile a lot of
definitions. Unsatisfying point is that definitions seem vague, which makes the
solution an ad hoc one. We analyzed the nature of outliers, and give two clear
definitions. We then develop an efficient RDD algorithm, which converts outlier
problem to pattern and degree problem. Furthermore, a collapse mechanism was
introduced by IIR algorithm, which can be united seamlessly with the RDD
algorithm and serve for the final decision. Both algorithms are originated from
the study on general AI. The combined edition is named as Pe algorithm, which
is the basis of the intelligent decision. Here we introduce longest k-turn
subsequence problem and corresponding solution as an example to interpret the
function of Pe algorithm in detecting curve-type outliers. We also give a
comparison between IIR algorithm and Pe algorithm, where we can get a better
understanding at both algorithms. A short discussion about intelligence is
added to demonstrate the function of the Pe algorithm. Related experimental
results indicate its robustness.
","[{'version': 'v1', 'created': 'Thu, 9 Jun 2011 16:45:49 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Jun 2011 13:53:05 GMT'}, {'version': 'v3', 'created': 'Tue, 23 Aug 2011 03:25:58 GMT'}]",2011-08-24,"[['Hsiao', 'Ching-an', ''], ['Tian', 'Xinchun', '']]","['Curve', 'Integrated Inconsistent Rate', 'classification', 'Pattern', 'Relative Deviation Degree']"
18516,1406.5306,Pierre-\'Etienne Meunier,Pierre-\'Etienne Meunier,Unraveling simplicity in elementary cellular automata,,,,,cs.CC cs.DM cs.FL nlin.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that a large number of elementary cellular automata are
computationally simple. This work is the first systematic classification of
elementary cellular automata based on a formal notion of computational
complexity. Thanks to the generality of communication complexity, the
perspectives of our method include its application to other natural systems
such as neural networks and gene regulatory networks.
","[{'version': 'v1', 'created': 'Fri, 20 Jun 2014 08:10:02 GMT'}]",2014-06-23,"[['Meunier', 'Pierre-Étienne', '']]","['Elementary cellular automata', 'Communication complexity', 'Intrinsic universality']"
18517,1209.5770,Ligia Cremene dr,"Ligia C. Cremene, D. Dumitrescu, Reka Nagy, Noemi Gasko",Cognitive Radio Simultaneous Spectrum Access/ One-shot Game Modelling,"6 double-column pages, 8 figures, CSNDSP 2012. arXiv admin note:
  substantial text overlap with arXiv:1207.3365, arXiv:1209.5387,
  arXiv:1209.5013",,,,cs.GT cs.NI nlin.AO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of this work is to asses simultaneous spectrum access situations that
may occur in Cognitive Radio (CR) environments. The approach is that of one
shot, noncooperative games describing CR interactions. Open spectrum access
scenarios are modelled based on continuous and discrete reformulations of the
Cournot game theoretical model. CR interaction situations are described by Nash
and Pareto equilibria. Also, the heterogeneity of players is captured by the
new concept of joint Nash-Pareto equilibrium, allowing CRs to be biased toward
different types of equilibrium. Numerical simulations reveal equilibrium
situations that may be reached in simultaneous access scenarios of two and
three users.
","[{'version': 'v1', 'created': 'Sat, 22 Sep 2012 18:58:59 GMT'}]",2012-09-27,"[['Cremene', 'Ligia C.', ''], ['Dumitrescu', 'D.', ''], ['Nagy', 'Reka', ''], ['Gasko', 'Noemi', '']]","['open spectrum access', 'cognitive radio environments', 'spectrum-aware communications', 'non-cooperative one-shot games']"
18518,1606.06314,Mohammad Haris Baig,"Mohammad Haris Baig, Lorenzo Torresani",Multiple Hypothesis Colorization,16 Pages (including Appendices),,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we focus on the problem of colorization for image compression.
Since color information occupies a large proportion of the total storage size
of an image, a method that can predict accurate color from its grayscale
version can produce dramatic reduction in image file size. But colorization for
compression poses several challenges. First, while colorization for artistic
purposes simply involves predicting plausible chroma, colorization for
compression requires generating output colors that are as close as possible to
the ground truth. Second, many objects in the real world exhibit multiple
possible colors. Thus, to disambiguate the colorization problem some additional
information must be stored to reproduce the true colors with good accuracy. To
account for the multimodal color distribution of objects we propose a deep
tree-structured network that generates multiple color hypotheses for every
pixel from a grayscale picture (as opposed to a single color produced by most
prior colorization approaches). We show how to leverage the multimodal output
of our model to reproduce with high fidelity the true colors of an image by
storing very little additional information. In the experiments we show that our
proposed method outperforms traditional JPEG color coding by a large margin,
producing colors that are nearly indistinguishable from the ground truth at the
storage cost of just a few hundred bytes for high-resolution pictures!
","[{'version': 'v1', 'created': 'Mon, 20 Jun 2016 20:15:34 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Jan 2017 22:48:50 GMT'}, {'version': 'v3', 'created': 'Wed, 1 Mar 2017 17:02:29 GMT'}]",2017-03-03,"[['Baig', 'Mohammad Haris', ''], ['Torresani', 'Lorenzo', '']]","['Colorization', 'Deep Learning', 'Image Compression']"
18519,1609.01823,Ezer Yeboah-Boateng,"Edward Ayebeng Botchway, Ezer Osei Yeboah-Boateng, and Titus Ebenezer
  Kwofie","Challenges to Integration of Information Technology in Physical
  Infrastructure Development Processes at the Local Government Level","14 pages, 5 figures, 13 tables",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ghana's Decentralization Policy has made significant contribution in
infrastructural implementation and delivery through Metropolitan, Municipal and
District Assemblies as an alternative development strategy to ensure the
implementation of the overall national agenda. To date, many systems and
strategies have been implemented towards improving development of
infrastructure at the local government level. Given that initiation and
implementation of infrastructural development at the local level involves the
multi-institutional participation of various stakeholders in local governance
for effective monitoring and development, several governance forms including
e-governance have been initiated towards improvement and effective management
of the assemblies. E-Governance through the use of relevant Information and
Communication Technology has been implemented through the Government Policy on
Information and Communications Technology for Accelerated Development as a
catalyst to facilitate the cross-sectoral participation in the implementation
of infrastructural development. Unfortunately, to date, the ICT4AD does not
appear to be successfully on course having been in existence for over a decade.
Similarly, the development and monitoring of the physical infrastructure at the
local level continue to suffer several setbacks and it is currently clearly
evident that a refined system of best practices must be put in place to
simplify and harmonize the entire development process. This paper is aimed at
the assessment of the challenges of e-governance in infrastructural development
at the local government level in Ghana. Using a mixed approach with purposive
sampling, data gathered from the MMDAs in Ashanti Region suggest that the
entire programme has been very slow; bedeviled with lack of funding and
","[{'version': 'v1', 'created': 'Tue, 20 Oct 2015 23:49:30 GMT'}]",2016-09-08,"[['Botchway', 'Edward Ayebeng', ''], ['Yeboah-Boateng', 'Ezer Osei', ''], ['Kwofie', 'Titus Ebenezer', '']]","['Decentralization policy', 'MMDAs', 'E-governance', 'Infrastructural development', 'ICT4AD']"
18520,1011.1874,Davide Quatrini,"Davide Quatrini, Roberta De Angelis",Reusing optical supports using a simple software,,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we show how it is possible to reuse optical supports (CDs,
DVDs, etc.) without using chemical or physical transformation, only employing a
software that can easily run on domestic computers. This software can make
obsolete optical supports useful again, converting de facto WEEE (Waste
electric and electronic equipment) into EEE (Electric and electronic
equipment). A massive use of such a software can lead to a significant change
in EEE every-day use, reducing its production to sustainable levels.
","[{'version': 'v1', 'created': 'Mon, 8 Nov 2010 19:01:02 GMT'}]",2010-11-09,"[['Quatrini', 'Davide', ''], ['De Angelis', 'Roberta', '']]","['WEEE', 'EEE', 'Optical support', 'Reuse']"
18521,1203.1395,Anirban Kundu (PhD),"Anirban Kundu, Chunlin Ji",Swarm Behavior of Intelligent Cloud,"15 pages, 10 figures",,,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the main aim is to exhibit swarm intelligence power in cloud
based scenario. Heterogeneous environment has been configured at server-side
network of the whole cloud network. In the proposed system, different types of
servers are being used to manage useful assorted atmosphere. Swarm intelligence
has been adopted for enhancing the performance of overall system network.
Specific location at server-side of the network is going to be selected by the
swarm intelligence concept for accessing desired elements. Flexibility,
robustness and self-organization, which are to be considered at the time of
designing the system environment, are the main features of swarm intelligence.
","[{'version': 'v1', 'created': 'Wed, 7 Mar 2012 08:02:35 GMT'}]",2012-03-08,"[['Kundu', 'Anirban', ''], ['Ji', 'Chunlin', '']]","['Swarm Intelligence', 'Distributed system', 'Cloud', 'Cloud Activity']"
18522,1002.1335,Srinivasan Venkatramanan,"Srinivasan Venkatramanan, Anurag Kumar","New Insights from an Analysis of Social Influence Networks under the
  Linear Threshold Model","13 pages, 6 figures",,,,cs.OH physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the spread of influence in a social network based on the Linear
Threshold model. We derive an analytical expression for evaluating the expected
size of the eventual influenced set for a given initial set, using the
probability of activation for each node in the social network. We then provide
an equivalent interpretation for the influence spread, in terms of acyclic path
probabilities in the Markov chain obtained by reversing the edges in the social
network influence graph. We use some properties of such acyclic path
probabilities to provide an alternate proof for the submodularity of the
influence function. We illustrate the usefulness of the analytical expression
in estimating the most influential set, in special cases such as the
UILT(Uniform Influence Linear Threshold), USLT(Uniform Susceptance Linear
Threshold) and node-degree based influence models. We show that the PageRank
heuristic is either provably optimal or performs very well in the above models,
and explore its limitations in more general cases. Finally, based on the
insights obtained from the analytical expressions, we provide an efficient
algorithm which approximates the greedy algorithm for the influence
maximization problem.
","[{'version': 'v1', 'created': 'Sat, 6 Feb 2010 07:41:28 GMT'}]",2010-02-09,"[['Venkatramanan', 'Srinivasan', ''], ['Kumar', 'Anurag', '']]","['Social networks', 'Spread of influence', 'Linear threshold', 'Markovchains', 'self avoiding paths', 'PageRank']"
18523,1704.08883,Seyed Sajad Mousavi,"Seyed Sajad Mousavi, Michael Schukat, Enda Howley","Traffic Light Control Using Deep Policy-Gradient and Value-Function
  Based Reinforcement Learning",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advances in combining deep neural network architectures with
reinforcement learning techniques have shown promising potential results in
solving complex control problems with high dimensional state and action spaces.
Inspired by these successes, in this paper, we build two kinds of reinforcement
learning algorithms: deep policy-gradient and value-function based agents which
can predict the best possible traffic signal for a traffic intersection. At
each time step, these adaptive traffic light control agents receive a snapshot
of the current state of a graphical traffic simulator and produce control
signals. The policy-gradient based agent maps its observation directly to the
control signal, however the value-function based agent first estimates values
for all legal control signals. The agent then selects the optimal control
action with the highest value. Our methods show promising results in a traffic
network simulated in the SUMO traffic simulator, without suffering from
instability issues during the training process.
","[{'version': 'v1', 'created': 'Fri, 28 Apr 2017 11:44:42 GMT'}, {'version': 'v2', 'created': 'Sat, 27 May 2017 14:45:56 GMT'}]",2017-05-30,"[['Mousavi', 'Seyed Sajad', ''], ['Schukat', 'Michael', ''], ['Howley', 'Enda', '']]","['Traffic control', 'Reinforcement learning', 'Deep learning', 'Policy gradient method', 'Value-function method', 'Artificial neural networks']"
18524,0910.4179,Goutam Paul,Sounak Gupta and Goutam Paul,Revisiting Fermat's Factorization for the RSA Modulus,,,,,cs.CR cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We revisit Fermat's factorization method for a positive integer $n$ that is a
product of two primes $p$ and $q$. Such an integer is used as the modulus for
both encryption and decryption operations of an RSA cryptosystem. The security
of RSA relies on the hardness of factoring this modulus. As a consequence of
our analysis, two variants of Fermat's approach emerge. We also present a
comparison between the two methods' effective regions. Though our study does
not yield a new state-of-the-art algorithm for integer factorization, we
believe that it reveals some interesting observations that are open for further
analysis.
","[{'version': 'v1', 'created': 'Wed, 21 Oct 2009 21:13:55 GMT'}]",2009-10-23,"[['Gupta', 'Sounak', ''], ['Paul', 'Goutam', '']]","['Factoring', 'Prime numbers', 'RSA']"
18525,1506.02804,Douglas Leith,"Miguel B\'aguena Albaladejo, Douglas J. Leith, Pietro Manzoni",Measurement-Based Modelling of LTE Performance in Dublin City,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  LTE/4G is the next generation of cellular network which specifically aims to
improve the network performance for data traffic and is currently being rolled
out by many network operators. We present results from an extensive LTE
measurement campaign in Dublin, Ireland using a custom performance measurement
tool. Performance data was measured at a variety of locations within the city
(including cell edge locations, indoors, outdoors etc) as well as for mobile
users on public transport within the city. Using this data we derive a model of
the characteristics of link layer RTT and bandwidth vs link signal strength.
This model is suited to use for performance evaluation of applications and
services, and since it is based on real measurements it allows realistic
evaluation of performance.
","[{'version': 'v1', 'created': 'Tue, 9 Jun 2015 07:31:53 GMT'}]",2015-06-10,"[['Albaladejo', 'Miguel Báguena', ''], ['Leith', 'Douglas J.', ''], ['Manzoni', 'Pietro', '']]","['LTE', '4G', 'Measurement', 'Performance Modeling']"
18526,1306.5296,Sourangsu Banerji,Sourangsu Banerji,"Design and Implementation of an Unmanned Vehicle using a GSM Network
  without Microcontrollers","8 pages, 6 figures, 6 tables","Journal of Electrical Engineering, Volume 14, Issue 1, April 2014",,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the recent past, wireless controlled vehicles had been extensively used in
a lot of areas like unmanned rescue missions, military usage for unmanned
combat and many others. But the major disadvantage of these wireless unmanned
robots is that they typically make use of RF circuits for maneuver and control.
Essentially RF circuits suffer from a lot of drawbacks such as limited
frequency range i.e. working range, and limited control. To overcome such
problems associated with RF control, few papers have been written, describing
methods which make use of the GSM network and the DTMF function of a cell phone
to control the robotic vehicle. This paper although uses the same principle
technology of the GSM network and the DTMF based mobile phone but it
essentially shows the construction of a circuit using only 4 bits of wireless
data communication to control the motion of the vehicle without the use of any
microcontroller. This improvement results in considerable reduction of circuit
complexity and of manpower for software development as the circuit built using
this system does not require any form of programming. Moreover, practical
results obtained showed an appreciable degree of accuracy of the system and
friendliness without the use of any microcontroller.
","[{'version': 'v1', 'created': 'Sat, 22 Jun 2013 06:48:18 GMT'}, {'version': 'v10', 'created': 'Wed, 12 Mar 2014 06:47:41 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Jun 2013 04:38:16 GMT'}, {'version': 'v3', 'created': 'Thu, 27 Jun 2013 07:56:02 GMT'}, {'version': 'v4', 'created': 'Mon, 1 Jul 2013 03:34:19 GMT'}, {'version': 'v5', 'created': 'Tue, 2 Jul 2013 19:06:15 GMT'}, {'version': 'v6', 'created': 'Fri, 5 Jul 2013 18:29:27 GMT'}, {'version': 'v7', 'created': 'Sun, 21 Jul 2013 11:52:55 GMT'}, {'version': 'v8', 'created': 'Sun, 4 Aug 2013 09:46:56 GMT'}, {'version': 'v9', 'created': 'Sun, 16 Feb 2014 18:36:52 GMT'}]",2014-03-13,"[['Banerji', 'Sourangsu', '']]","['DTMF decoder', 'GSM network', 'Motor driver', 'Microcontroller', 'Unmanned Surface Vehicles (USVs).  1']"
18527,0903.4128,Rohit  Aggarwal,"Rohit Aggarwal, Philip Schniter, and C. Emre Koksal","Rate Adaptation via Link-Layer Feedback for Goodput Maximization over a
  Time-Varying Channel","25 pages, 9 figures, submitted to IEEE Transactions on Wireless
  Communications in August 2008 and revised in March 2009",,,,cs.IT cs.NI math.IT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider adapting the transmission rate to maximize the goodput, i.e., the
amount of data transmitted without error, over a continuous Markov flat-fading
wireless channel. In particular, we consider schemes in which transmitter
channel state is inferred from degraded causal error-rate feedback, such as
packet-level ACK/NAKs in an automatic repeat request (ARQ) system. In such
schemes, the choice of transmission rate affects not only the subsequent
goodput but also the subsequent feedback, implying that the optimal rate
schedule is given by a partially observable Markov decision process (POMDP).
Because solution of the POMDP is computationally impractical, we consider
simple suboptimal greedy rate assignment and show that the optimal scheme would
itself be greedy if the error-rate feedback was non-degraded. Furthermore, we
show that greedy rate assignment using non-degraded feedback yields a total
goodput that upper bounds that of optimal rate assignment using degraded
feedback. We then detail the implementation of the greedy scheme and propose a
reduced-complexity greedy scheme that adapts the transmission rate only once
per block of packets. We also investigate the performance of the schemes
numerically, and show that the proposed greedy scheme achieves steady-state
goodputs that are reasonably close to the upper bound on goodput calculated
using non-degraded feedback. A similar improvement is obtained in steady-state
goodput, drop rate, and average buffer occupancy in the presence of data
buffers. We also investigate an upper bound on the performance of optimal rate
assignment for a discrete approximation of the channel and show that such
quantization leads to a significant loss in achievable goodput.
","[{'version': 'v1', 'created': 'Tue, 24 Mar 2009 16:43:40 GMT'}]",2009-03-25,"[['Aggarwal', 'Rohit', ''], ['Schniter', 'Philip', ''], ['Koksal', 'C. Emre', '']]","['Communication systems', 'adaptive modulation', 'ARQ', 'cross-layer strategies']"
18528,1604.00066,Wenbin Li,"Wenbin Li, Seyedmajid Azimi, Ale\v{s} Leonardis, Mario Fritz","To Fall Or Not To Fall: A Visual Approach to Physical Stability
  Prediction",,,,,cs.CV cs.AI cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding physical phenomena is a key competence that enables humans and
animals to act and interact under uncertain perception in previously unseen
environments containing novel object and their configurations. Developmental
psychology has shown that such skills are acquired by infants from observations
at a very early stage.
  In this paper, we contrast a more traditional approach of taking a
model-based route with explicit 3D representations and physical simulation by
an end-to-end approach that directly predicts stability and related quantities
from appearance. We ask the question if and to what extent and quality such a
skill can directly be acquired in a data-driven way bypassing the need for an
explicit simulation.
  We present a learning-based approach based on simulated data that predicts
stability of towers comprised of wooden blocks under different conditions and
quantities related to the potential fall of the towers. The evaluation is
carried out on synthetic data and compared to human judgments on the same
stimuli.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2016 21:53:32 GMT'}]",2016-04-04,"[['Li', 'Wenbin', ''], ['Azimi', 'Seyedmajid', ''], ['Leonardis', 'Aleš', ''], ['Fritz', 'Mario', '']]","['Intuitive Physics', 'Physics-based simulation', 'Stability', 'Visual Learning and Inference']"
18529,1603.04335,Lena Feinbube,"Lena Feinbube, Peter Tr\""oger, Andreas Polze",The landscape of software failure cause models,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The software engineering field has a long history of classifying software
failure causes. Understanding them is paramount for fault injection, focusing
testing efforts or reliability prediction. Since software fails in manifold
complex ways, a broad range of software failure cause models is meanwhile
published in dependability literature. We present the results of a meta-study
that classifies publications containing a software failure cause model in topic
clusters. Our results structure the research field and can help to identify
gaps. We applied the systematic mapping methodology for performing a repeatable
analysis.
  We identified 156 papers presenting a model of software failure causes. Their
examination confirms the assumption that a large number of the publications
discusses source code defects only. Models of fault-activating state conditions
and error states are rare. Research seems to be driven mainly by the need for
better testing methods and code-based quality improvement. Other motivations
such as online error detection are less frequently given. Mostly, the IEEE
definitions or orthogonal defect classification is used as base terminology.
The majority of use cases comes from web, safety- and security-critical
applications.
","[{'version': 'v1', 'created': 'Mon, 14 Mar 2016 16:38:47 GMT'}]",2016-03-15,"[['Feinbube', 'Lena', ''], ['Tröger', 'Peter', ''], ['Polze', 'Andreas', '']]","['systematic map', 'mapping study', 'software', 'fault', 'bug', 'defect', 'model']"
18530,1304.4320,Subir  Ghosh,"Arijit Bishnu, Subir Kumar Ghosh, Partha Pratim Goswami, Sudebkumar
  Prasant Pal, Swami Sarvattomananda","An Algorithm for Computing Constrained Reflection Paths in Simple
  Polygon",,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $s$ be a source point and $t$ be a destination point inside an $n$-vertex
simple polygon $P$. Euclidean shortest paths and minimum-link paths between $s$
and $t$ inside $P$ have been well studied. Both these kinds of paths are simple
and piecewise-convex. However, computing optimal paths in the context of
diffuse or specular reflections does not seem to be an easy task. A path from a
light source $s$ to $t$ inside $P$ is called a diffuse reflection path if the
turning points of the path lie in the interiors of the boundary edges of $P$. A
diffuse reflection path is said to be optimal if it has the minimum number of
turning points amongst all diffuse reflection paths between $s$ and $t$. The
minimum diffuse reflection path may not be simple. The problem of computing the
minimum diffuse reflection path in low degree polynomial time has remained
open.
  In our quest for understanding the geometric structure of the minimum diffuse
reflection paths vis-a-vis shortest paths and minimum link paths, we define a
new kind of diffuse reflection path called a constrained diffuse reflection
path where (i) the path is simple, (ii) it intersects only the eaves of the
Euclidean shortest path between $s$ and $t$, and (iii) it intersects each eave
exactly once. For computing a minimum constrained diffuse reflection path from
$s$ to $t$, we present an $O(n(n+\beta))$ time algorithm, where $\beta =\Theta
(n^2)$ in the worst case. Here, $\beta$ depends on the shape of the polygon. We
also establish some properties relating minimum constrained diffuse reflection
paths and minimum diffuse reflection paths. Constrained diffuse reflection
paths introduced in this paper provide new geometric insights into the hitherto
unknown structures and shapes of optimal reflection paths.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2013 03:31:05 GMT'}, {'version': 'v2', 'created': 'Thu, 1 May 2014 12:56:49 GMT'}]",2014-05-02,"[['Bishnu', 'Arijit', ''], ['Ghosh', 'Subir Kumar', ''], ['Goswami', 'Partha Pratim', ''], ['Pal', 'Sudebkumar Prasant', ''], ['Sarvattomananda', 'Swami', '']]","['diffuse reflection', 'simple polygon', 'minimum diffuse reflection path', 'visibility', 'constrained diffuse reflection path']"
18531,1203.1392,Zoltan Somogyi,"Quan Phan, Gerda Janssens and Zoltan Somogyi",Region-based memory management for Mercury programs,"74 pages, 23 figures, 11 tables. A shorter version of this paper,
  without proofs, is to appear in the journal Theory and Practice of Logic
  Programming (TPLP)",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Region-based memory management (RBMM) is a form of compile time memory
management, well-known from the functional programming world. In this paper we
describe our work on implementing RBMM for the logic programming language
Mercury. One interesting point about Mercury is that it is designed with strong
type, mode, and determinism systems. These systems not only provide Mercury
programmers with several direct software engineering benefits, such as
self-documenting code and clear program logic, but also give language
implementors a large amount of information that is useful for program analyses.
In this work, we make use of this information to develop program analyses that
determine the distribution of data into regions and transform Mercury programs
by inserting into them the necessary region operations. We prove the
correctness of our program analyses and transformation. To execute the
annotated programs, we have implemented runtime support that tackles the two
main challenges posed by backtracking. First, backtracking can require regions
removed during forward execution to be ""resurrected""; and second, any memory
allocated during a computation that has been backtracked over must be recovered
promptly and without waiting for the regions involved to come to the end of
their life. We describe in detail our solution of both these problems. We study
in detail how our RBMM system performs on a selection of benchmark programs,
including some well-known difficult cases for RBMM. Even with these difficult
cases, our RBMM-enabled Mercury system obtains clearly faster runtimes for 15
out of 18 benchmarks compared to the base Mercury system with its Boehm runtime
garbage collector, with an average runtime speedup of 24%, and an average
reduction in memory requirements of 95%. In fact, our system achieves optimal
memory consumption in some programs.
","[{'version': 'v1', 'created': 'Wed, 7 Mar 2012 07:28:08 GMT'}]",2012-03-08,"[['Phan', 'Quan', ''], ['Janssens', 'Gerda', ''], ['Somogyi', 'Zoltan', '']]","['region-based memory management', 'region analysis', 'runtime support', 'backtracking', 'logic programming', 'Mercury']"
18532,1610.01891,Mohamad Ivan Fanany,"Sadikin Mujiono, Mohamad Ivan Fanany, Chan Basaruddin","A New Data Representation Based on Training Data Characteristics to
  Extract Drug Named-Entity in Medical Text","Hindawi Publishing. Computational Intelligence and Neuroscience
  Volume 2016 (2016), Article ID 3483528, 24 pages Received 27 May 2016;
  Revised 8 August 2016; Accepted 18 September 2016. Special Issue on ""Smart
  Data: Where the Big Data Meets the Semantics"". Academic Editor: Trong H.
  Duong","Computational Intelligence and Neuroscience Volume 2016 (2016),
  Article ID 3483528, 24 pages",,3483528,cs.CL cs.AI cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One essential task in information extraction from the medical corpus is drug
name recognition. Compared with text sources come from other domains, the
medical text is special and has unique characteristics. In addition, the
medical text mining poses more challenges, e.g., more unstructured text, the
fast growing of new terms addition, a wide range of name variation for the same
drug. The mining is even more challenging due to the lack of labeled dataset
sources and external knowledge, as well as multiple token representations for a
single drug name that is more common in the real application setting. Although
many approaches have been proposed to overwhelm the task, some problems
remained with poor F-score performance (less than 0.75). This paper presents a
new treatment in data representation techniques to overcome some of those
challenges. We propose three data representation techniques based on the
characteristics of word distribution and word similarities as a result of word
embedding training. The first technique is evaluated with the standard NN
model, i.e., MLP (Multi-Layer Perceptrons). The second technique involves two
deep network classifiers, i.e., DBN (Deep Belief Networks), and SAE (Stacked
Denoising Encoders). The third technique represents the sentence as a sequence
that is evaluated with a recurrent NN model, i.e., LSTM (Long Short Term
Memory). In extracting the drug name entities, the third technique gives the
best F-score performance compared to the state of the art, with its average
F-score being 0.8645.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2016 14:38:09 GMT'}]",2016-10-07,"[['Mujiono', 'Sadikin', ''], ['Fanany', 'Mohamad Ivan', ''], ['Basaruddin', 'Chan', '']]","['drug name entity', 'word embedding', 'MLP', 'DBN', 'SAE', 'LSTM']"
18533,1205.0193,Rafayel Kamalian,R.R. Kamalian,On cyclically-interval edge colorings of trees,"9 pages, no figures",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For an undirected, simple, finite, connected graph $G$, we denote by $V(G)$
and $E(G)$ the sets of its vertices and edges, respectively. A function
$\varphi:E(G)\rightarrow\{1,2,\ldots,t\}$ is called a proper edge $t$-coloring
of a graph $G$ if adjacent edges are colored differently and each of $t$ colors
is used. An arbitrary nonempty subset of consecutive integers is called an
interval. If $\varphi$ is a proper edge $t$-coloring of a graph $G$ and $x\in
V(G)$, then $S_G(x,\varphi)$ denotes the set of colors of edges of $G$ which
are incident with $x$. A proper edge $t$-coloring $\varphi$ of a graph $G$ is
called a cyclically-interval $t$-coloring if for any $x\in V(G)$ at least one
of the following two conditions holds: a) $S_G(x,\varphi)$ is an interval, b)
$\{1,2,\ldots,t\}\setminus S_G(x,\varphi)$ is an interval. For any $t\in
\mathbb{N}$, let $\mathfrak{M}_t$ be the set of graphs for which there exists a
cyclically-interval $t$-coloring, and let
$$\mathfrak{M}\equiv\bigcup_{t\geq1}\mathfrak{M}_t.$$ For an arbitrary tree
$G$, it is proved that $G\in\mathfrak{M}$ and all possible values of $t$ are
found for which $G\in\mathfrak{M}_t.$
","[{'version': 'v1', 'created': 'Tue, 1 May 2012 15:40:33 GMT'}]",2012-05-02,"[['Kamalian', 'R. R.', '']]","['tree', 'interval edge coloring', 'cyclically-interval edge coloring']"
18534,1009.5168,Konstantin Voevodski,"Konstantin Voevodski, Maria-Florina Balcan, Heiko Roglin, Shang-Hua
  Teng, Yu Xia",Efficient Clustering with Limited Distance Information,Full version of UAI 2010 paper,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a point set S and an unknown metric d on S, we study the problem of
efficiently partitioning S into k clusters while querying few distances between
the points. In our model we assume that we have access to one versus all
queries that given a point s in S return the distances between s and all other
points. We show that given a natural assumption about the structure of the
instance, we can efficiently find an accurate clustering using only O(k)
distance queries. Our algorithm uses an active selection strategy to choose a
small set of points that we call landmarks, and considers only the distances
between landmarks and other points to produce a clustering. We use our
algorithm to cluster proteins by sequence similarity. This setting nicely fits
our model because we can use a fast sequence database search program to query a
sequence against an entire dataset. We conduct an empirical study that shows
that even though we query a small fraction of the distances between the points,
we produce clusterings that are close to a desired clustering given by manual
classification.
","[{'version': 'v1', 'created': 'Mon, 27 Sep 2010 06:29:35 GMT'}, {'version': 'v2', 'created': 'Mon, 9 May 2011 04:03:47 GMT'}]",2011-05-10,"[['Voevodski', 'Konstantin', ''], ['Balcan', 'Maria-Florina', ''], ['Roglin', 'Heiko', ''], ['Teng', 'Shang-Hua', ''], ['Xia', 'Yu', '']]","['clustering', 'active clustering', 'k-median', 'approximation algorithms', 'approximation stability', 'clustering accuracy', 'protein sequences']"
18535,1412.7059,Huibo Bi,Huibo Bi and Erol Gelenbe,"Cloud Enabled Emergency Navigation Using Faster-than-real-time
  Simulation",Submitted to PerNEM'15 for review,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  State-of-the-art emergency navigation approaches are designed to evacuate
civilians during a disaster based on real-time decisions using a pre-defined
algorithm and live sensory data. Hence, casualties caused by the poor decisions
and guidance are only apparent at the end of the evacuation process and cannot
then be remedied. Previous research shows that the performance of routing
algorithms for evacuation purposes are sensitive to the initial distribution of
evacuees, the occupancy levels, the type of disaster and its as well its
locations. Thus an algorithm that performs well in one scenario may achieve bad
results in another scenario. This problem is especially serious in
heuristic-based routing algorithms for evacuees where results are affected by
the choice of certain parameters. Therefore, this paper proposes a
simulation-based evacuee routing algorithm that optimises evacuation by making
use of the high computational power of cloud servers. Rather than guiding
evacuees with a predetermined routing algorithm, a robust Cognitive Packet
Network based algorithm is first evaluated via a cloud-based simulator in a
faster-than-real-time manner, and any ""simulated casualties"" are then re-routed
using a variant of Dijkstra's algorithm to obtain new safe paths for them to
exits. This approach can be iterated as long as corrective action is still
possible.
","[{'version': 'v1', 'created': 'Mon, 22 Dec 2014 17:08:59 GMT'}, {'version': 'v2', 'created': 'Sat, 3 Jan 2015 15:41:35 GMT'}]",2015-01-06,"[['Bi', 'Huibo', ''], ['Gelenbe', 'Erol', '']]","['Emergency Navigation', 'Faster-than-real-time simulation', 'Simulation-based Routing', 'Cloud computing']"
18536,1506.03377,Subhash Kak,"Sieteng Soh, Gongqi Lin, Subhash Kak",Connectivity in Social Networks,"8 pages, 5 figures",,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The value of a social network is generally determined by its size and the
connectivity of its nodes. But since some of the nodes may be fake ones and
others that are dormant, the question of validating the node counts by
statistical tests becomes important. In this paper we propose the use of the
Benford's distribution to check on the trustworthiness of the connectivity
statistics. Our experiments using statistics of both symmetric and asymmetric
networks show that when the accumulation processes are random, the convergence
to Benford's law is significantly better, and therefore this fact can be used
to distinguish between processes which are randomly generated and those with
internal dependencies.
","[{'version': 'v1', 'created': 'Wed, 10 Jun 2015 16:20:45 GMT'}]",2015-06-11,"[['Soh', 'Sieteng', ''], ['Lin', 'Gongqi', ''], ['Kak', 'Subhash', '']]","['Social networks', 'connectivity', 'value of a network', 'first digit phenomenon']"
18537,1511.08531,Chunhua Shen,"Sakrapee Paisitkriangkrai, Lin Wu, Chunhua Shen, Anton van den Hengel","Structured learning of metric ensembles with application to person
  re-identification","16 pages. Extended version of ""Learning to Rank in Person
  Re-Identification With Metric Ensembles"", at
  http://www.cv-foundation.org/openaccess/content_cvpr_2015/html/Paisitkriangkrai_Learning_to_Rank_2015_CVPR_paper.html.
  arXiv admin note: text overlap with arXiv:1503.01543",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Matching individuals across non-overlapping camera networks, known as person
re-identification, is a fundamentally challenging problem due to the large
visual appearance changes caused by variations of viewpoints, lighting, and
occlusion. Approaches in literature can be categoried into two streams: The
first stream is to develop reliable features against realistic conditions by
combining several visual features in a pre-defined way; the second stream is to
learn a metric from training data to ensure strong inter-class differences and
intra-class similarities. However, seeking an optimal combination of visual
features which is generic yet adaptive to different benchmarks is a unsoved
problem, and metric learning models easily get over-fitted due to the scarcity
of training data in person re-identification. In this paper, we propose two
effective structured learning based approaches which explore the adaptive
effects of visual features in recognizing persons in different benchmark data
sets. Our framework is built on the basis of multiple low-level visual features
with an optimal ensemble of their metrics. We formulate two optimization
algorithms, CMCtriplet and CMCstruct, which directly optimize evaluation
measures commonly used in person re-identification, also known as the
Cumulative Matching Characteristic (CMC) curve.
","[{'version': 'v1', 'created': 'Fri, 27 Nov 2015 00:10:59 GMT'}, {'version': 'v2', 'created': 'Tue, 24 May 2016 04:48:59 GMT'}]",2016-05-25,"[['Paisitkriangkrai', 'Sakrapee', ''], ['Wu', 'Lin', ''], ['Shen', 'Chunhua', ''], ['Hengel', 'Anton van den', '']]","['Person re-identification', 'Learning to rank', 'Metric ensembles', 'Structured learning']"
18538,1307.1681,Lianggui Liu,Lianggui Liu,"Extracting the trustworthiest way to service provider in complex online
  social networks",,,,,cs.SI cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In complex online social networks, it is crucial for a service consumer to
extract the trustworthiest way to a target service provider from numerous
social trust paths between them. The extraction of the trustworthiest way
(namely, optimal social trust path (OSTP)) with multiple end-to-end quality of
trust (QoT) constraints has been proved to be NP-Complete. Heuristic algorithms
with polynomial and pseudo-polynomial-time complexities are often used to deal
with this challenging problem. However, existing solutions cannot guarantee the
efficiency of searching, that is, they can hardly avoid obtaining partial
optimal solutions during searching process. Quantum annealing uses
delocalization and tunneling to avoid falling into local minima without
sacrifying execution time. It has been proved to be a promising way to many
optimization problems in recently published literatures. In this paper, for the
first time, QA based OSTP algorithms (QA_OSTP) is applied to the extraction of
the trustworthiest way. The experiment results show that QA based algorithms
have better performance than its heuristic opponents.
","[{'version': 'v1', 'created': 'Tue, 18 Jun 2013 07:23:20 GMT'}]",2013-07-08,"[['Liu', 'Lianggui', '']]","['Qulity of trust', 'trustworthiest way', 'quantum annealing', 'quantum tunneling', 'complex online social networks']"
18539,1403.1928,Haryono Haryono,"Haryono, Jazi Eko Istiyanto, Agus Harjoko, Agfianto Eko Putra","Five Modular Redundancy with Mitigation Technique to Recover the Error
  Module",6 Pages,"Haryono, Istiyanto, J.E., Harjoko, A., Putra, A.E., 2014,
  International Journal of advanced studies in Computer Science and Engineering
  IJASCSE, Volume 3, Issue 2, 2014",,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hazard radiation can lead the system fault therefore Fault Tolerance is
required. Fault Tolerant is a system, which is designed to keep operations
running, despite the degradation in the specific module is happening. Many
fault tolerances have been developed to handle the problem, to find the most
robust and efficient in the possible technology. This paper will present the
Five Modular Redundancy (FMR) with Mitigation Technique to Recover the Error
Module. With Dynamic Partial Reconfiguration technology that have already
available today, such fault tolerance technique can be implemented
successfully. The project showed the robustness of the system is increased and
module which is error can be recovered immediately.
","[{'version': 'v1', 'created': 'Sat, 8 Mar 2014 04:21:39 GMT'}]",2014-03-11,"[['Haryono', '', ''], ['Istiyanto', 'Jazi Eko', ''], ['Harjoko', 'Agus', ''], ['Putra', 'Agfianto Eko', '']]","['FPGA', 'Fault Tolerance', 'Dynamic Partial Reconfiguration']"
18540,1603.05314,Te-Hsuan Chen,Te-Hsuan Chen and Ju-Yi Lu,"Hardware Acceleration for Boolean Satisfiability Solver by Applying
  Belief Propagation Algorithm",,,,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Boolean satisfiability (SAT) has an extensive application domain in computer
science, especially in electronic design automation applications. Circuit
synthesis, optimization, and verification problems can be solved by
transforming original problems to SAT problems. However, the SAT problem is
known as NP-complete, which means there is no efficient method to solve it.
Therefore, an efficient SAT solver to enhance the performance is always
desired. We propose a hardware acceleration method for SAT problems. By
surveying the properties of SAT problems and the decoding of low-density
parity-check (LDPC) codes, a special class of error-correcting codes, we
discover that both of them are constraint satisfaction problems. The belief
propagation algorithm has been successfully applied to the decoding of LDPC,
and the corresponding decoder hardware designs are extensively studied.
Therefore, we proposed a belief propagation based algorithm to solve SAT
problems. With this algorithm, the SAT solver can be accelerated by hardware. A
software simulator is implemented to verify the proposed algorithm and the
performance improvement is estimated. Our experiment results show that time
complexity does not increase with the size of SAT problems and the proposed
method can achieve at least 30x speedup compared to MiniSat.
","[{'version': 'v1', 'created': 'Wed, 16 Mar 2016 23:57:27 GMT'}]",2016-03-18,"[['Chen', 'Te-Hsuan', ''], ['Lu', 'Ju-Yi', '']]","['SAT', 'Boolean Satisfiability', 'Belief Propagation Algorithm']"
18541,1702.00882,Ahmed Taha,"Ahmed Taha, Marwan Torki","Seeded Laplaican: An Eigenfunction Solution for Scribble Based
  Interactive Image Segmentation",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we cast the scribble-based interactive image segmentation as a
semi-supervised learning problem. Our novel approach alleviates the need to
solve an expensive generalized eigenvector problem by approximating the
eigenvectors using efficiently computed eigenfunctions. The smoothness operator
defined on feature densities at the limit n tends to infinity recovers the
exact eigenvectors of the graph Laplacian, where n is the number of nodes in
the graph. To further reduce the computational complexity without scarifying
our accuracy, we select pivots pixels from user annotations. In our
experiments, we evaluate our approach using both human scribble and ""robot
user"" annotations to guide the foreground/background segmentation. We developed
a new unbiased collection of five annotated images datasets to standardize the
evaluation procedure for any scribble-based segmentation method. We
experimented with several variations, including different feature vectors,
pivot count and the number of eigenvectors. Experiments are carried out on
datasets that contain a wide variety of natural images. We achieve better
qualitative and quantitative results compared to state-of-the-art interactive
segmentation algorithms.
","[{'version': 'v1', 'created': 'Fri, 3 Feb 2017 01:13:07 GMT'}, {'version': 'v2', 'created': 'Sun, 27 Aug 2017 20:12:37 GMT'}]",2017-08-29,"[['Taha', 'Ahmed', ''], ['Torki', 'Marwan', '']]","['interactive segmentation', 'eigenfunctions', 'vision', 'graph Laplacian']"
18542,1312.6802,Bhagwati Pande,"B. P. Pande, Pawan Tamta and H. S. Dhami",Suffix Stripping Problem as an Optimization Problem,"14 pages, 4 tables",,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stemming or suffix stripping, an important part of the modern Information
Retrieval systems, is to find the root word (stem) out of a given cluster of
words. Existing algorithms targeting this problem have been developed in a
haphazard manner. In this work, we model this problem as an optimization
problem. An Integer Program is being developed to overcome the shortcomings of
the existing approaches. The sample results of the proposed method are also
being compared with an established technique in the field for English language.
An AMPL code for the same IP has also been given.
","[{'version': 'v1', 'created': 'Tue, 24 Dec 2013 12:06:48 GMT'}]",2013-12-25,"[['Pande', 'B. P.', ''], ['Tamta', 'Pawan', ''], ['Dhami', 'H. S.', '']]","['Affix removal', 'Stemming', 'Information Retrieval (IR)', 'Conflation', 'Integer Program (IP)']"
18543,1606.08667,Mong-Jen Kao,Mong-Jen Kao,Iterative Partial Rounding for Vertex Cover with Hard Capacities,,,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide a simple and novel algorithmic design technique, for which we call
iterative partial rounding, that gives a tight rounding-based approximation for
vertex cover with hard capacities (VC-HC). In particular, we obtain an
$f$-approximation for VC-HC on hypergraphs, improving over a previous results
of Cheung et al (SODA 2014) to the tight extent. This also closes the gap of
approximation since it was posted by Chuzhoy and Naor in (FOCS 2002). We
believe that our rounding technique is of independence interests when hard
constraints are considered.
  Our main technical tool for establishing the approximation guarantee is a
separation lemma that certifies the existence of a strong partition for
solutions that are basic feasible in an extended version of the natural LP.
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2016 12:09:31 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jun 2016 10:35:41 GMT'}, {'version': 'v3', 'created': 'Tue, 5 Jul 2016 02:18:22 GMT'}, {'version': 'v4', 'created': 'Fri, 14 Oct 2016 13:40:19 GMT'}]",2016-10-17,"[['Kao', 'Mong-Jen', '']]","['iterative partial rounding', 'capacitated vertex cover', 'hard capacities', 'approximation algorithm']"
18544,1304.4137,Piotr Br\'odka,"Piotr Br\'odka, Stanis{\l}aw Saganowski, Przemys{\l}aw Kazienko",Group Evolution Discovery in Social Networks,"Brodka, P.; Saganowski, S.; Kazienko, P., ""Group Evolution Discovery
  in Social Networks,"" Advances in Social Networks Analysis and Mining
  (ASONAM), 2011 International Conference on, vol., no., pp.247,253, 25-27 July
  2011 doi: 10.1109/ASONAM.2011.69",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Group extraction and their evolution are among the topics which arouse the
greatest interest in the domain of social network analysis. However, while the
grouping methods in social networks are developed very dynamically, the methods
of group evolution discovery and analysis are still uncharted territory on the
social network analysis map. Therefore the new method for the group evolution
discovery called GED is proposed in this paper. Additionally, the results of
the first experiments on the email based social network together with
comparison with two other methods of group evolution discovery are presented.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2013 15:43:37 GMT'}]",2013-04-16,"[['Bródka', 'Piotr', ''], ['Saganowski', 'Stanisław', ''], ['Kazienko', 'Przemysław', '']]","['social network', 'group evolution', 'groups in social']"
18545,0906.4327,R Doomun,"Jigyasa Bisaria, Namita Shrivastava, K.R. Pardasani","A Rough Sets Partitioning Model for Mining Sequential Patterns with Time
  Constraint","9 pages, International Journal of Computer Science and Information
  Security, IJCSIS 2009","IJCSIS, June 2009 Issue, Vol. 2, No.1",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Now a days, data mining and knowledge discovery methods are applied to a
variety of enterprise and engineering disciplines to uncover interesting
patterns from databases. The study of Sequential patterns is an important data
mining problem due to its wide applications to real world time dependent
databases. Sequential patterns are inter-event patterns ordered over a
time-period associated with specific objects under study. Analysis and
discovery of frequent sequential patterns over a predetermined time-period are
interesting data mining results, and can aid in decision support in many
enterprise applications. The problem of sequential pattern mining poses
computational challenges as a long frequent sequence contains enormous number
of frequent subsequences. Also useful results depend on the right choice of
event window. In this paper, we have studied the problem of sequential pattern
mining through two perspectives, one the computational aspect of the problem
and the other is incorporation and adjustability of time constraint. We have
used Indiscernibility relation from theory of rough sets to partition the
search space of sequential patterns and have proposed a novel algorithm that
allows previsualization of patterns and allows adjustment of time constraint
prior to execution of mining task. The algorithm Rough Set Partitioning is at
least ten times faster than the naive time constraint based sequential pattern
mining algorithm GSP. Besides this an additional knowledge of time interval of
sequential patterns is also determined with the method.
","[{'version': 'v1', 'created': 'Tue, 23 Jun 2009 18:29:06 GMT'}]",2009-06-24,"[['Bisaria', 'Jigyasa', ''], ['Shrivastava', 'Namita', ''], ['Pardasani', 'K. R.', '']]","['Data mining', 'Sequential patterns', 'indiscernibility relation', 'partitioning etc']"
18546,1708.00354,Scott Haag,"Scott Haag, Ali Shokoufandeh",A Watershed Delineation Algorithm for 2D Flow Direction Grids,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose an algorithm and associated data model for creating
a watershed boundary using a 2D Flow Direction Grid. Flow Direction Grids
(FDGs) are common abstractions for hydrodynamic models and are utilized for
delineating physical systems (e.g. watersheds, fluvial, and non-fluvial flow
paths). The proposed algorithm and associated data model provides geometric
speed increases in watershed boundary retrieval while keeping storage
constraints linear in comparison to existing techniques. The algorithm called
Haag Shokoufandehs' March (HSM) relies on an existing data structure, the
modified nested set model, originally described by Celko and applied to
hydrodynamic models by Haag and Shokoufandeh in 2017. The proposed algorithm
creates watershed boundaries by marching around the edges of its' corresponding
region, never entering the internal area. In contrast to existing algorithms
that scales in proportional to the area of the underlying region, the
complexity of the HSM algorithm is proportional to the boundary length. Results
for a group of tested watersheds (n = 14,718) in the approximately 36,000 km^2
Delaware River Watershed show a reduction of between 0 and 99% in computational
complexity using a 30 m DEM vs. existing techniques. Larger watersheds have a
consistent reduction in the number of (read) operation complexity, with the
largest watershed resulting in approximately 35 million reads using traditional
techniques compared to approximately 45 thousand using the HSM algorithm,
respectively. Modelled estimates of the complexity for the approximately 6.1
million km^2 Amazon River basin show a reduction from 6.7 billion to 1.4
million reads.
","[{'version': 'v1', 'created': 'Tue, 1 Aug 2017 14:25:38 GMT'}]",2017-08-02,"[['Haag', 'Scott', ''], ['Shokoufandeh', 'Ali', '']]","['Haag and Shokoufandehs’ marching (HSM) algorithm', 'Graph Theory', 'Modified Nested Set Algorithm', 'Watershed Boundaries']"
18547,1412.3138,Yichao Zhou,"Yichao Zhou, Yuexin Wu, and Jianyang Zeng",Computational Protein Design Using AND/OR Branch-and-Bound Search,RECOMB 2015,,,,cs.AI cs.CE cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The computation of the global minimum energy conformation (GMEC) is an
important and challenging topic in structure-based computational protein
design. In this paper, we propose a new protein design algorithm based on the
AND/OR branch-and-bound (AOBB) search, which is a variant of the traditional
branch-and-bound search algorithm, to solve this combinatorial optimization
problem. By integrating with a powerful heuristic function, AOBB is able to
fully exploit the graph structure of the underlying residue interaction network
of a backbone template to significantly accelerate the design process. Tests on
real protein data show that our new protein design algorithm is able to solve
many prob- lems that were previously unsolvable by the traditional exact search
algorithms, and for the problems that can be solved with traditional provable
algorithms, our new method can provide a large speedup by several orders of
magnitude while still guaranteeing to find the global minimum energy
conformation (GMEC) solution.
","[{'version': 'v1', 'created': 'Mon, 8 Dec 2014 12:23:10 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Jan 2015 14:06:36 GMT'}]",2015-01-16,"[['Zhou', 'Yichao', ''], ['Wu', 'Yuexin', ''], ['Zeng', 'Jianyang', '']]","['protein design', 'AND/OR branch-and-bound', 'global minimum energyconformation', 'residue interaction network', 'mini-bucket heuristic']"
18548,1008.3123,Ronen Gradwohl,"Ronen Gradwohl, Noam Livne, and Alon Rosen",Sequential Rationality in Cryptographic Protocols,Extended abstract in FOCS 2010,,,,cs.GT cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Much of the literature on rational cryptography focuses on analyzing the
strategic properties of cryptographic protocols. However, due to the presence
of computationally-bounded players and the asymptotic nature of cryptographic
security, a definition of sequential rationality for this setting has thus far
eluded researchers.
  We propose a new framework for overcoming these obstacles, and provide the
first definitions of computational solution concepts that guarantee sequential
rationality. We argue that natural computational variants of subgame perfection
are too strong for cryptographic protocols. As an alternative, we introduce a
weakening called threat-free Nash equilibrium that is more permissive but still
eliminates the undesirable ``empty threats'' of non-sequential solution
concepts.
  To demonstrate the applicability of our framework, we revisit the problem of
implementing a mediator for correlated equilibria (Dodis-Halevi-Rabin,
Crypto'00), and propose a variant of their protocol that is sequentially
rational for a non-trivial class of correlated equilibria. Our treatment
provides a better understanding of the conditions under which mediators in a
correlated equilibrium can be replaced by a stable protocol.
","[{'version': 'v1', 'created': 'Wed, 18 Aug 2010 16:11:35 GMT'}]",2010-08-19,"[['Gradwohl', 'Ronen', ''], ['Livne', 'Noam', ''], ['Rosen', 'Alon', '']]","['rational cryptography', 'Nash equilibrium', 'subgame perfect equilibrium', 'sequential rationality', 'cryptographic protocols', 'correlated equilibrium']"
18549,1111.6689,Stephane Durocher,Majid Khabbazian and Stephane Durocher and Alireza Haghnegahdar,"Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random
  Position",,,,,cs.CG cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The interference at a wireless node s can be modelled by the number of
wireless nodes whose transmission ranges cover s. Given a set of positions for
wireless nodes, the interference minimization problem is to assign a
transmission radius (equivalently, a power level) to each node such that the
resulting communication graph is connected, while minimizing the maximum
interference. We consider the model introduced by von Rickenback et al. (2005),
in which each transmission range is represented by a ball and edges in the
communication graph are symmetric. The problem is NP-complete in two dimensions
(Buchin 2008) and no polynomial-time approximation algorithm is known.
Furthermore, even in one dimension (the highway model), the problem's
complexity is unknown and the maximum interference of a set of n wireless nodes
can be as high as Theta(sqrt(n)) (von Rickenback et al. 2005). In this paper we
show how to solve the problem efficiently in settings typical for wireless ad
hoc networks. In particular, we show that if node positions are represented by
a set P of n points selected uniformly and independently at random over a
d-dimensional rectangular region, for any fixed d, then the topology given by
the closure of the Euclidean minimum spanning tree of P has maximum
interference O(log n) with high probability. We extend this bound to a general
class of communication graphs over a broad set of probability distributions.
Next we present a local algorithm that constructs a graph from this class; this
is the first local algorithm to provide an upper bound on the expected maximum
interference. Finally, we discuss an empirical evaluation of our algorithm with
a suite of simulation results.
","[{'version': 'v1', 'created': 'Tue, 29 Nov 2011 04:38:52 GMT'}]",2011-11-30,"[['Khabbazian', 'Majid', ''], ['Durocher', 'Stephane', ''], ['Haghnegahdar', 'Alireza', '']]","['interference', 'topology control', 'minimum spanning tree', 'random distribution', 'expectation']"
18550,1412.2562,Vincent Delos,"Vincent Delos (I2M), Denis Teissandier (I2M)",Minkowski sum of HV-polytopes in Rn,"4th Annual International Conference on Computational Mathematics,
  Computational Geometry and Statistics, Jan 2015, Singapore, Singapore",,,,cs.CG cs.MS physics.class-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Minkowski sums cover a wide range of applications in many different fields
like algebra, morphing, robotics, mechanical CAD/CAM systems ... This paper
deals with sums of polytopes in a n dimensional space provided that both
H-representation and V-representation are available i.e. the polytopes are
described by both their half-spaces and vertices. The first method uses the
polytope normal fans and relies on the ability to intersect dual polyhedral
cones. Then we introduce another way of considering Minkowski sums of polytopes
based on the primal polyhedral cones attached to each vertex.
","[{'version': 'v1', 'created': 'Mon, 8 Dec 2014 13:56:17 GMT'}]",2014-12-09,"[['Delos', 'Vincent', '', 'I2M'], ['Teissandier', 'Denis', '', 'I2M']]","['Computational Geometry', 'ConvexPolytope', 'Minkowski Sum', 'Normal Fan', 'Polyhedrical Cone']"
18551,1511.05808,Dirk Lewandowski,Dirk Lewandowski,Using Search Engine Technology to Improve Library Catalogs,"Search engines, online catalogs, ranking, information seeking
  behavior, query types",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This chapter outlines how search engine technology can be used in online
public access library catalogs (OPACs) to help improve users experiences, to
identify users intentions, and to indicate how it can be applied in the library
context, along with how sophisticated ranking criteria can be applied to the
online library catalog. A review of the literature and current OPAC
developments form the basis of recommendations on how to improve OPACs.
Findings were that the major shortcomings of current OPACs are that they are
not sufficiently user-centered and that their results presentations lack
sophistication. Further, these shortcomings are not addressed in current 2.0
developments. It is argued that OPAC development should be made search-centered
before additional features are applied. While the recommendations on ranking
functionality and the use of user intentions are only conceptual and not yet
applied to a library catalogue, practitioners will find recommendations for
developing better OPACs in this chapter. In short, readers will find a
systematic view on how the search engines strengths can be applied to improving
libraries online catalogs.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2015 14:38:45 GMT'}]",2015-11-19,"[['Lewandowski', 'Dirk', '']]","['Search engines', 'online catalogs', 'ranking', 'information seeking behavior', 'query types']"
18552,1105.2925,Loet Leydesdorff,Loet Leydesdorff and Ismael Rafols,"Interactive Overlays: A New Method for Generating Global Journal Maps
  from Web-of-Science Data",,,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent advances in methods and techniques enable us to develop an interactive
overlay to the global map of science based on aggregated citation relations
among the 9,162 journals contained in the Science Citation Index and Social
Science Citation Index 2009 combined. The resulting mapping is provided by
VOSViewer. We first discuss the pros and cons of the various options: cited
versus citing, multidimensional scaling versus spring-embedded algorithms,
VOSViewer versus Gephi, and the various clustering algorithms and similarity
criteria. Our approach focuses on the positions of journals in the
multidimensional space spanned by the aggregated journal-journal citations. A
number of choices can be left to the user, but we provide default options
reflecting our preferences. Some examples are also provided; for example, the
potential of using this technique to assess the interdisciplinarity of
organizations and/or document sets.
","[{'version': 'v1', 'created': 'Sun, 15 May 2011 06:19:13 GMT'}]",2011-05-17,"[['Leydesdorff', 'Loet', ''], ['Rafols', 'Ismael', '']]","['map', 'journal', 'overlay', 'interactive', 'VOSViewer', 'Gephi']"
18553,1701.08661,Jasper De Bock,Jasper De Bock,Credal Networks under Epistemic Irrelevance,,,,,cs.AI math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A credal network under epistemic irrelevance is a generalised type of
Bayesian network that relaxes its two main building blocks. On the one hand,
the local probabilities are allowed to be partially specified. On the other
hand, the assessments of independence do not have to hold exactly.
Conceptually, these two features turn credal networks under epistemic
irrelevance into a powerful alternative to Bayesian networks, offering a more
flexible approach to graph-based multivariate uncertainty modelling. However,
in practice, they have long been perceived as very hard to work with, both
theoretically and computationally.
  The aim of this paper is to demonstrate that this perception is no longer
justified. We provide a general introduction to credal networks under epistemic
irrelevance, give an overview of the state of the art, and present several new
theoretical results. Most importantly, we explain how these results can be
combined to allow for the design of recursive inference methods. We provide
numerous concrete examples of how this can be achieved, and use these to
demonstrate that computing with credal networks under epistemic irrelevance is
most definitely feasible, and in some cases even highly efficient. We also
discuss several philosophical aspects, including the lack of symmetry, how to
deal with probability zero, the interpretation of lower expectations, the
axiomatic status of graphoid properties, and the difference between updating
and conditioning.
","[{'version': 'v1', 'created': 'Fri, 27 Jan 2017 08:57:40 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Mar 2017 15:00:19 GMT'}]",2017-03-20,"[['De Bock', 'Jasper', '']]","['Credal networks', 'Epistemic irrelevance', 'Irrelevant natural extension', 'Sets of probabilities', 'Lower expectation']"
18554,1412.3421,Juan Eugenio Iglesias,Juan Eugenio Iglesias and Mert Rory Sabuncu,Multi-Atlas Segmentation of Biomedical Images: A Survey,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-atlas segmentation (MAS), first introduced and popularized by the
pioneering work of Rohlfing, Brandt, Menzel and Maurer Jr (2004), Klein, Mensh,
Ghosh, Tourville and Hirsch (2005), and Heckemann, Hajnal, Aljabar, Rueckert
and Hammers (2006), is becoming one of the most widely-used and successful
image segmentation techniques in biomedical applications. By manipulating and
utilizing the entire dataset of ""atlases"" (training images that have been
previously labeled, e.g., manually by an expert), rather than some model-based
average representation, MAS has the flexibility to better capture anatomical
variation, thus offering superior segmentation accuracy. This benefit, however,
typically comes at a high computational cost. Recent advancements in computer
hardware and image processing software have been instrumental in addressing
this challenge and facilitated the wide adoption of MAS. Today, MAS has come a
long way and the approach includes a wide array of sophisticated algorithms
that employ ideas from machine learning, probabilistic modeling, optimization,
and computer vision, among other fields. This paper presents a survey of
published MAS algorithms and studies that have applied these methods to various
biomedical problems. In writing this survey, we have three distinct aims. Our
primary goal is to document how MAS was originally conceived, later evolved,
and now relates to alternative methods. Second, this paper is intended to be a
detailed reference of past research activity in MAS, which now spans over a
decade (2003 - 2014) and entails novel methodological developments and
application-specific solutions. Finally, our goal is to also present a
perspective on the future of MAS, which, we believe, will be one of the
dominant approaches in biomedical image segmentation.
","[{'version': 'v1', 'created': 'Wed, 10 Dec 2014 19:28:09 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Jun 2015 14:35:30 GMT'}]",2015-06-15,"[['Iglesias', 'Juan Eugenio', ''], ['Sabuncu', 'Mert Rory', '']]","['Multi-atlas segmentation', 'Label fusion', 'Survey']"
18555,1210.0595,Amir Hosein Asiaee,"Amir H. Asiaee, Prashant Doshi, Todd Minning, Satya Sahoo, Priti
  Parikh, Amit Sheth, Rick L. Tarleton","From Questions to Effective Answers: On the Utility of Knowledge-Driven
  Querying Systems for Life Sciences Data",,,,,cs.IR cs.DB,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  We compare two distinct approaches for querying data in the context of the
life sciences. The first approach utilizes conventional databases to store the
data and intuitive form-based interfaces to facilitate easy querying of the
data. These interfaces could be seen as implementing a set of ""pre-canned""
queries commonly used by the life science researchers that we study. The second
approach is based on semantic Web technologies and is knowledge (model) driven.
It utilizes a large OWL ontology and same datasets as before but associated as
RDF instances of the ontology concepts. An intuitive interface is provided that
allows the formulation of RDF triples-based queries. Both these approaches are
being used in parallel by a team of cell biologists in their daily research
activities, with the objective of gradually replacing the conventional approach
with the knowledge-driven one. This provides us with a valuable opportunity to
compare and qualitatively evaluate the two approaches. We describe several
benefits of the knowledge-driven approach in comparison to the traditional way
of accessing data, and highlight a few limitations as well. We believe that our
analysis not only explicitly highlights the specific benefits and limitations
of semantic Web technologies in our context but also contributes toward
effective ways of translating a question in a researcher's mind into precise
computational queries with the intent of obtaining effective answers from the
data. While researchers often assume the benefits of semantic Web technologies,
we explicitly illustrate these in practice.
","[{'version': 'v1', 'created': 'Mon, 1 Oct 2012 22:10:30 GMT'}]",2012-10-03,"[['Asiaee', 'Amir H.', ''], ['Doshi', 'Prashant', ''], ['Minning', 'Todd', ''], ['Sahoo', 'Satya', ''], ['Parikh', 'Priti', ''], ['Sheth', 'Amit', ''], ['Tarleton', 'Rick L.', '']]","['ontology-driven querying', 'SPARQL-DL', 'SQL', 'parasitic data', 'evaluation']"
18556,1502.05775,Pradeep Kr. Banerjee,Pradeep Kr. Banerjee,A Secret Common Information Duality for Tripartite Noisy Correlations,"12 pages, 1 figure, v3: Improved readability",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore the duality between the simulation and extraction of secret
correlations in light of a similar well-known operational duality between the
two notions of common information due to Wyner, and G\'acs and K\""orner. For
the inverse problem of simulating a tripartite noisy correlation from noiseless
secret key and unlimited public communication, we show that Winter's (2005)
result for the key cost in terms of a conditional version of Wyner's common
information can be simply reexpressed in terms of the existence of a bipartite
protocol monotone. For the forward problem of key distillation from noisy
correlations, we construct simple distributions for which the conditional
G\'acs and K\""orner common information achieves a tight bound on the secret key
rate. We conjecture that this holds in general for non-communicative key
agreement models. We also comment on the interconvertibility of secret
correlations under local operations and public communication.
","[{'version': 'v1', 'created': 'Fri, 20 Feb 2015 05:14:28 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Apr 2015 06:58:48 GMT'}, {'version': 'v3', 'created': 'Sat, 30 May 2015 07:40:35 GMT'}]",2015-06-02,"[['Banerjee', 'Pradeep Kr.', '']]","['Information-theoretic security', 'secret key agreement', 'common information', 'monotones']"
18557,1209.6129,Deepak Garg Dr,"Deepak Garg, S C Saxena, L M Bhardwaj",A New Middle Path Approach For Alignements In Blast,,"Journal of Biological Systems, Vol. 14, No. 4 , pp. 567-581 ISSN
  0218-3390 2006",,,cs.DS cs.CE q-bio.QM,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper deals with a new middle path approach developed for reducing
alignment calculations in BLAST algorithm. This is a new step which is
introduced in BLAST algorithm in between the ungapped and gapped alignments.
This step of middle path approach between the ungapped and gapped alignments
reduces the number of sequences going for gapped alignment. This results in the
improvement in speed for alignment up to 30 percent.
","[{'version': 'v1', 'created': 'Thu, 27 Sep 2012 05:47:32 GMT'}]",2012-09-28,"[['Garg', 'Deepak', ''], ['Saxena', 'S C', ''], ['Bhardwaj', 'L M', '']]","['Gapped Alignment', 'BLAST', 'Middle Path', 'DNA sequences', 'HSPs  1']"
18558,1609.06119,Thomas Keck,Thomas Keck,"FastBDT: A speed-optimized and cache-friendly implementation of
  stochastic gradient-boosted decision trees for multivariate classification",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stochastic gradient-boosted decision trees are widely employed for
multivariate classification and regression tasks. This paper presents a
speed-optimized and cache-friendly implementation for multivariate
classification called FastBDT. FastBDT is one order of magnitude faster during
the fitting-phase and application-phase, in comparison with popular
implementations in software frameworks like TMVA, scikit-learn and XGBoost. The
concepts used to optimize the execution time and performance studies are
discussed in detail in this paper. The key ideas include: An equal-frequency
binning on the input data, which allows replacing expensive floating-point with
integer operations, while at the same time increasing the quality of the
classification; a cache-friendly linear access pattern to the input data, in
contrast to usual implementations, which exhibit a random access pattern.
FastBDT provides interfaces to C/C++, Python and TMVA. It is extensively used
in the field of high energy physics by the Belle II experiment.
","[{'version': 'v1', 'created': 'Tue, 20 Sep 2016 11:50:52 GMT'}]",2016-09-21,"[['Keck', 'Thomas', '']]","['boosted decision trees', 'multivariate classification', 'equal-frequency binning', 'cache-friendly', 'belle']"
18559,0708.3920,Damien Chablat,"Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), Ilian Bonev (GPA)",Kinematic analysis of the 3-RPR parallel manipulator,,"Dans Advances in Robot Kinematics - 10th International Symposium
  on Advances in Robot Kinematics, Ljubljana : Slov\'enie (2006)",,,cs.RO,,"  The aim of this paper is the kinematic study of a 3-RPR planar parallel
manipulator where the three fixed revolute joints are actuated. The direct and
inverse kinematic problem as well as the singular configuration is
characterized. On parallel singular configurations, the motion produce by the
mobile platform can be compared to the Reuleaux straight-line mechanism.
","[{'version': 'v1', 'created': 'Wed, 29 Aug 2007 09:28:52 GMT'}]",2007-08-30,"[['Chablat', 'Damien', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN'], ['Bonev', 'Ilian', '', 'GPA']]","['Kinematics', 'Planar parallel manipulators', 'Singularity']"
18560,1406.5316,Preetha Theresa Joy,Preetha Theresa Joy and K. Poulose Jacob,Cache Discovery Over a Multihop Wireless Ad Hoc Network,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multihop ad hoc wireless networks consist of mobile nodes that communicate
with each other without any fixed infrastructure. The nodes in these networks
are power constrained, since they operate in limited battery energy.
Cooperative caching is an attractive solution for reducing network traffic and
bandwidth demands in mobile ad hoc networks. Deploying caches in mobile nodes
can reduce the overall traffic considerably.
  Cache hits eliminate the need to contact the data source frequently, which
avoids additional network overhead. In this paper we propose a cache discovery
policy for cooperative caching, which reduces the power usage, caching overhead
and delay. This is done by power control and transmission range adjustment. A
cache discovery process based on position coordinates of neighboring nodes is
developed for this. The simulation results gives a promising result based on
the metrics of studies.
","[{'version': 'v1', 'created': 'Fri, 20 Jun 2014 08:46:34 GMT'}]",2014-06-23,"[['Joy', 'Preetha Theresa', ''], ['Jacob', 'K. Poulose', '']]","['Cache Discovery', 'Cache Placement', 'Cache Replacement', 'Cooperative Caching', 'Data Dissemination']"
18561,1702.01533,Rodrigo Picos,"Rodrigo Picos, Juan Bautista Roldan, Mohamed Moner Al Chawa, Pedro
  Garcia-Fernandez, Francisco Jimenez-Molinos, Eugeni Garcia-Moreno","Semiempirical Modeling of Reset Transitions in Unipolar
  Resistive-Switching Based Memristors",,"Radioengineering, 24(2): 420-424 (2015).
  [http://hdl.handle.net/10481/36994]",,,cs.ET,http://creativecommons.org/licenses/by/4.0/,"  We have measured the transition process from the high to low resistivity
states, i.e., the reset process of resistive switching based memristors based
on Ni/HfO2/Si-n+ structures, and have also developed an analytical model for
their electrical characteristics. When the characteristic curves are plotted in
the current-voltage (I-V) domain a high variability is observed. In spite of
that, when the same curves are plotted in the charge-flux domain (Q-f), they
can be described by a simple model containing only three parameters: the charge
(Qrst) and the flux (frst) at the reset point, and an exponent, n, relating the
charge and the flux before the reset transition. The three parameters can be
easily extracted from the Q-f plots. There is a strong correlation between
these three parameters, the origin of which is still under study.
","[{'version': 'v1', 'created': 'Mon, 6 Feb 2017 09:02:38 GMT'}]",2017-02-07,"[['Picos', 'Rodrigo', ''], ['Roldan', 'Juan Bautista', ''], ['Chawa', 'Mohamed Moner Al', ''], ['Garcia-Fernandez', 'Pedro', ''], ['Jimenez-Molinos', 'Francisco', ''], ['Garcia-Moreno', 'Eugeni', '']]","['RRAM', 'memristor modeling', 'reset voltage (Vrst) determination', 'variability']"
18562,1511.04317,Mansour Ahmadi,"Mansour Ahmadi, Dmitry Ulyanov, Stanislav Semenov, Mikhail Trofimov,
  Giorgio Giacinto","Novel Feature Extraction, Selection and Fusion for Effective Malware
  Family Classification",,,,,cs.CR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern malware is designed with mutation characteristics, namely polymorphism
and metamorphism, which causes an enormous growth in the number of variants of
malware samples. Categorization of malware samples on the basis of their
behaviors is essential for the computer security community, because they
receive huge number of malware everyday, and the signature extraction process
is usually based on malicious parts characterizing malware families. Microsoft
released a malware classification challenge in 2015 with a huge dataset of near
0.5 terabytes of data, containing more than 20K malware samples. The analysis
of this dataset inspired the development of a novel paradigm that is effective
in categorizing malware variants into their actual family groups. This paradigm
is presented and discussed in the present paper, where emphasis has been given
to the phases related to the extraction, and selection of a set of novel
features for the effective representation of malware samples. Features can be
grouped according to different characteristics of malware behavior, and their
fusion is performed according to a per-class weighting paradigm. The proposed
method achieved a very high accuracy ($\approx$ 0.998) on the Microsoft Malware
Challenge dataset.
","[{'version': 'v1', 'created': 'Fri, 13 Nov 2015 15:33:02 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Mar 2016 10:21:15 GMT'}]",2016-03-11,"[['Ahmadi', 'Mansour', ''], ['Ulyanov', 'Dmitry', ''], ['Semenov', 'Stanislav', ''], ['Trofimov', 'Mikhail', ''], ['Giacinto', 'Giorgio', '']]","['Windows Malware', 'Machine learning', 'Malware family', 'Computer security', 'Classification', 'Microsoft Malware Classification Challenge']"
18563,1111.6337,Tianbao Yang,"Tianbao Yang, Mehrdad Mahdavi, Rong Jin, Shenghuo Zhu",Regret Bound by Variation for Online Convex Optimization,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In citep{Hazan-2008-extract}, the authors showed that the regret of online
linear optimization can be bounded by the total variation of the cost vectors.
In this paper, we extend this result to general online convex optimization. We
first analyze the limitations of the algorithm in \citep{Hazan-2008-extract}
when applied it to online convex optimization. We then present two algorithms
for online convex optimization whose regrets are bounded by the variation of
cost functions. We finally consider the bandit setting, and present a
randomized algorithm for online bandit convex optimization with a
variation-based regret bound. We show that the regret bound for online bandit
convex optimization is optimal when the variation of cost functions is
independent of the number of trials.
","[{'version': 'v1', 'created': 'Mon, 28 Nov 2011 03:50:18 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Nov 2011 14:05:49 GMT'}, {'version': 'v3', 'created': 'Mon, 11 Jun 2012 21:56:31 GMT'}, {'version': 'v4', 'created': 'Thu, 14 Jun 2012 01:40:01 GMT'}]",2012-06-15,"[['Yang', 'Tianbao', ''], ['Mahdavi', 'Mehrdad', ''], ['Jin', 'Rong', ''], ['Zhu', 'Shenghuo', '']]","['online convex optimization', 'regret bound', 'variation', 'bandit']"
18564,1301.1262,Yordan Kalmukov,Yordan Kalmukov,"Protecting Online Documents from an Unauthorized External Access (in
  Bulgarian)",in Bulgarian,"Conference Proceedings of ""Days of Science 2011"", Volume 2, pp.
  442-451, Veliko Tarnovo, Bulgaria, 2011, ISSN: 1314-2283",,,cs.CR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The modern multi-tier web applications and information systems store and
process various types of data. Some of them are stored in a database,
controlled by an external database management system, while other data are
stored directly within the server's file system. The database is secured by the
database management system itself, but it is a programmer's responsibility to
design and develop a security protection of the files managed by the
information system. This paper summarizes the existing and suggests new rules
for design and implementation of an in-depth security protection of file
resources, published on the Internet, from an unauthorized external access. The
paper is in Bulgarian.
","[{'version': 'v1', 'created': 'Mon, 17 Dec 2012 00:29:43 GMT'}]",2013-01-08,"[['Kalmukov', 'Yordan', '']]","['web applications', 'information systems', 'in-depth security protection of file resources']"
18565,1506.01204,Edmond Nurellari,"Edmond Nurellari, Des McLernon, Mounir Ghogho, and Syed Ali Raza Zaidi","Distributed Optimal Quantization and Power Allocation for Sensor
  Detection Via Consensus","5 pages, 5 figures, proceeding VTC Spring,2015, Glasgow, United
  Kingdom, vtc15spr, (Vehicular Technology Conference Spring 2015)",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the optimal transmit power allocation problem (from the sensor
nodes (SNs) to the fusion center (FC)) for the decentralized detection of an
unknown deterministic spatially uncorrelated signal which is being observed by
a distributed wireless sensor network. We propose a novel fully distributed
algorithm, in order to calculate the optimal transmit power allocation for each
sensor node (SN) and the optimal number of quantization bits for the test
statistic in order to match the channel capacity. The SNs send their quantized
information over orthogonal uncorrelated channels to the FC which linearly
combines them and makes a final decision. What makes this scheme attractive is
that the SNs share with their neighbours just their individual transmit powers
at the current states. As a result, the SN processing complexity is further
reduced.
","[{'version': 'v1', 'created': 'Wed, 3 Jun 2015 10:56:09 GMT'}]",2015-06-04,"[['Nurellari', 'Edmond', ''], ['McLernon', 'Des', ''], ['Ghogho', 'Mounir', ''], ['Zaidi', 'Syed Ali Raza', '']]","['Distributed detection', 'distributed processing', 'softdecision', 'wireless sensor networks']"
18566,1603.04002,Richard Nock,"Giorgio Patrini, Richard Nock, Stephen Hardy, Tiberio Caetano",Fast Learning from Distributed Datasets without Entity Matching,,,,,cs.LG cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consider the following data fusion scenario: two datasets/peers contain the
same real-world entities described using partially shared features, e.g.
banking and insurance company records of the same customer base. Our goal is to
learn a classifier in the cross product space of the two domains, in the hard
case in which no shared ID is available -- e.g. due to anonymization.
Traditionally, the problem is approached by first addressing entity matching
and subsequently learning the classifier in a standard manner. We present an
end-to-end solution which bypasses matching entities, based on the recently
introduced concept of Rademacher observations (rados). Informally, we replace
the minimisation of a loss over examples, which requires to solve entity
resolution, by the equivalent minimisation of a (different) loss over rados.
Among others, key properties we show are (i) a potentially huge subset of these
rados does not require to perform entity matching, and (ii) the algorithm that
provably minimizes the rado loss over these rados has time and space
complexities smaller than the algorithm minimizing the equivalent example loss.
Last, we relax a key assumption of the model, that the data is vertically
partitioned among peers --- in this case, we would not even know the existence
of a solution to entity resolution. In this more general setting, experiments
validate the possibility of significantly beating even the optimal peer in
hindsight.
","[{'version': 'v1', 'created': 'Sun, 13 Mar 2016 06:03:39 GMT'}]",2016-03-15,"[['Patrini', 'Giorgio', ''], ['Nock', 'Richard', ''], ['Hardy', 'Stephen', ''], ['Caetano', 'Tiberio', '']]","['entity resolution', 'distributed learning', 'Rademacher observations', 'square loss', 'Ridgeregularization']"
18567,1011.1578,Edoardo Carta-Gerardino,Edoardo Carta-Gerardino,"The $z$-Transform and Automata-Recognizable Systems of Nonhomogeneous
  Linear Recurrence Equations over Semirings",7 pages,,,,cs.SC cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A nonhomogeneous system of linear recurrence equations can be recognized by
an automaton $\mathcal{A}$ over a one-letter alphabet $A = \{z\}$. Conversely,
the automaton $\mathcal{A}$ generates precisely this nonhomogeneous system of
linear recurrence equations. We present the solutions of these systems and
apply the $z$-transform to these solutions to obtain their series
representation. Finally, we show some results that simplify the series
representation of the $z$-transform of these solutions. We consider single
systems as well as the composition of two systems.
","[{'version': 'v1', 'created': 'Sat, 6 Nov 2010 18:50:05 GMT'}]",2010-11-09,"[['Carta-Gerardino', 'Edoardo', '']]","['z-transform', 'automata', 'nonhomogeneous linear recurrence equations', 'semirings']"
18568,1303.7310,Niraj Kumar,"Niraj Kumar, Rashmi Gangadharaiah, Kannan Srinathan and Vasudeva Varma","Exploring the Role of Logically Related Non-Question Phrases for
  Answering Why-Questions","Got accepted in NLDB-2013; as Paper ID: 23; Title: ""Exploring the
  Role of Logically Related Non-Question Phrases for Answering Why-Questions"",
  Withdrawn",,,,cs.CL cs.IR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper, we show that certain phrases although not present in a given
question/query, play a very important role in answering the question. Exploring
the role of such phrases in answering questions not only reduces the dependency
on matching question phrases for extracting answers, but also improves the
quality of the extracted answers. Here matching question phrases means phrases
which co-occur in given question and candidate answers. To achieve the above
discussed goal, we introduce a bigram-based word graph model populated with
semantic and topical relatedness of terms in the given document. Next, we apply
an improved version of ranking with a prior-based approach, which ranks all
words in the candidate document with respect to a set of root words (i.e.
non-stopwords present in the question and in the candidate document). As a
result, terms logically related to the root words are scored higher than terms
that are not related to the root words. Experimental results show that our
devised system performs better than state-of-the-art for the task of answering
Why-questions.
","[{'version': 'v1', 'created': 'Fri, 29 Mar 2013 06:31:40 GMT'}]",2013-04-02,"[['Kumar', 'Niraj', ''], ['Gangadharaiah', 'Rashmi', ''], ['Srinathan', 'Kannan', ''], ['Varma', 'Vasudeva', '']]","['Ranking with Prior', 'Non-Factoid question answering', 'semantic relatedness', 'topical relatedness']"
18569,1406.4781,Anthony Bagnall Dr,Anthony Bagnall and Luke Davis,"Predictive Modelling of Bone Age through Classification and Regression
  of Bone Shapes",,,,CMPC14-02,cs.LG physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bone age assessment is a task performed daily in hospitals worldwide. This
involves a clinician estimating the age of a patient from a radiograph of the
non-dominant hand.
  Our approach to automated bone age assessment is to modularise the algorithm
into the following three stages: segment and verify hand outline; segment and
verify bones; use the bone outlines to construct models of age. In this paper
we address the final question: given outlines of bones, can we learn how to
predict the bone age of the patient? We examine two alternative approaches.
Firstly, we attempt to train classifiers on individual bones to predict the
bone stage categories commonly used in bone ageing. Secondly, we construct
regression models to directly predict patient age.
  We demonstrate that models built on summary features of the bone outline
perform better than those built using the one dimensional representation of the
outline, and also do at least as well as other automated systems. We show that
models constructed on just three bones are as accurate at predicting age as
expert human assessors using the standard technique. We also demonstrate the
utility of the model by quantifying the importance of ethnicity and sex on age
development. Our conclusion is that the feature based system of separating the
image processing from the age modelling is the best approach for automated bone
ageing, since it offers flexibility and transparency and produces accurate
estimates.
","[{'version': 'v1', 'created': 'Wed, 18 Jun 2014 16:13:10 GMT'}]",2014-06-19,"[['Bagnall', 'Anthony', ''], ['Davis', 'Luke', '']]","['Bone Age Assessment', 'Automated Tanner-Whitehouse', 'Shapelet', 'Elastic Ensemble']"
18570,1007.1045,Edoardo Carta-Gerardino,"Edoardo Carta-Gerardino, Parisa Babaali",Weighted Automata and Recurrence Equations for Regular Languages,"14 pages, 6 figures",,,,cs.FL cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $\mathcal{P}(\Sigma^*)$ be the semiring of languages, and consider its
subset $\mathcal{P}(\Sigma)$. In this paper we define the language recognized
by a weighted automaton over $\mathcal{P}(\Sigma)$ and a one-letter alphabet.
Similarly, we introduce the notion of language recognition by linear recurrence
equations with coefficients in $\mathcal{P}(\Sigma)$. As we will see, these two
definitions coincide. We prove that the languages recognized by linear
recurrence equations with coefficients in $\mathcal{P}(\Sigma)$ are precisely
the regular languages, thus providing an alternative way to present these
languages. A remarkable consequence of this kind of recognition is that it
induces a partition of the language into its cross-sections, where the $n$th
cross-section contains all the words of length $n$ in the language. Finally, we
show how to use linear recurrence equations to calculate the density function
of a regular language, which assigns to every $n$ the number of words of length
$n$ in the language. We also show how to count the number of successful paths
of a weighted automaton.
","[{'version': 'v1', 'created': 'Wed, 7 Jul 2010 04:27:59 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Jul 2010 17:02:32 GMT'}]",2010-07-27,"[['Carta-Gerardino', 'Edoardo', ''], ['Babaali', 'Parisa', '']]","['cross-section of a language', 'density of a language', 'language recognition', 'recurrence equations', 'semirings', 'weighted automata']"
18571,1506.02553,Noman Islam Dr.,Noman Islam and Zubair A. Shaikh,"Exploiting Correlation among Data Items for Cache Replacement in Ad-hoc
  Networks","2nd IEEE International Conference on Information Management and
  Engineering (IEEE ICIME 2010), Chengdu, China, April 14-16, 2010",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we have proposed a novel technique for cache replacement in
Ad-hoc Network based on the mining of Association Rules
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2015 15:30:52 GMT'}]",2015-06-09,"[['Islam', 'Noman', ''], ['Shaikh', 'Zubair A.', '']]","['Ad-hoc Network', 'Caching', 'Cache Replacment', 'Disconnected Operation', 'MANET']"
18572,1604.06936,Marek Szyku{\l}a,Marek Szyku{\l}a and John Wittnebel,Syntactic complexity of bifix-free languages,,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the properties of syntactic monoids of bifix-free regular languages.
In particular, we solve an open problem concerning syntactic complexity: We
prove that the cardinality of the syntactic semigroup of a bifix-free language
with state complexity $n$ is at most $(n-1)^{n-3}+(n-2)^{n-3}+(n-3)2^{n-3}$ for
$n\ge 6$. The main proof uses a large construction with the method of injective
function. Since this bound is known to be reachable, and the values for $n \le
5$ are known, this completely settles the problem. We also prove that
$(n-2)^{n-3} + (n-3)2^{n-3} - 1$ is the minimal size of the alphabet required
to meet the bound for $n \ge 6$. Finally, we show that the largest transition
semigroups of minimal DFAs which recognize bifix-free languages are unique up
to renaming the states.
","[{'version': 'v1', 'created': 'Sat, 23 Apr 2016 19:05:47 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Mar 2017 11:34:38 GMT'}, {'version': 'v3', 'created': 'Sat, 6 Oct 2018 17:18:30 GMT'}]",2018-10-09,"[['Szykuła', 'Marek', ''], ['Wittnebel', 'John', '']]","['bifix-free', 'prefix-free', 'regular language', 'suffix-free', 'syntactic complexity', 'transitionsemigroup']"
18573,0903.5289,Vincent Rialle,"Vincent Rialle (TIMC, DMIS), Annick Vila, Yves Besnard (TIMC)","Heterogeneous knowledge representation using a finite automaton and
  first order logic: a case study in electromyography",,"Artificial Intelligence in Medicine 3, 2 (1991) 65-74",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a certain number of situations, human cognitive functioning is difficult
to represent with classical artificial intelligence structures. Such a
difficulty arises in the polyneuropathy diagnosis which is based on the spatial
distribution, along the nerve fibres, of lesions, together with the synthesis
of several partial diagnoses. Faced with this problem while building up an
expert system (NEUROP), we developed a heterogeneous knowledge representation
associating a finite automaton with first order logic. A number of knowledge
representation problems raised by the electromyography test features are
examined in this study and the expert system architecture allowing such a
knowledge modeling are laid out.
","[{'version': 'v1', 'created': 'Mon, 30 Mar 2009 19:08:10 GMT'}]",2009-03-31,"[['Rialle', 'Vincent', '', 'TIMC, DMIS'], ['Vila', 'Annick', '', 'TIMC'], ['Besnard', 'Yves', '', 'TIMC']]","['Medical expert systems', 'Heterogeneous knowledge representation', 'Finite']"
18574,1510.06547,Illia Safiulin,"Illia Safiulin, Stefan Schwarz, Tal Philosof and Markus Rupp","Latency and Resource Utilization Analysis for V2X Communication over LTE
  MBSFN Transmission",,,,,cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate the performance of LTE Multicast-Broadcast
Single-Frequency Networks (MBSFN). LTE-MBSFN is viewed as one of the most
promising candidates for vehicular communications which can enhance reliability
of vehicular application traffic. This is achieved due to the possibility to
efficiently support message exchange in-between vehicles by multicasting
information to several vehicles in parallel (point-to-multipoint transmission)
employing an Multimedia Broadcast/Multicast Service (MBMS). We investigate two
metrics to gauge the performance of MBMS/MBSFN transmissions in comparison with
standard unicast transmissions for vehicular communications: latency of packet
delivery and overhead caused by vehicular traffic, i.e., network utilization.
Additionally, we present technique of prediction of system behaviour and
explore the influence of transmission bandwidth and transmission rate on
mentioned metrics.
","[{'version': 'v1', 'created': 'Thu, 22 Oct 2015 09:37:49 GMT'}]",2015-10-23,"[['Safiulin', 'Illia', ''], ['Schwarz', 'Stefan', ''], ['Philosof', 'Tal', ''], ['Rupp', 'Markus', '']]","['Multicasting', 'MBSFN', 'Vehicular Communications', 'V2X', 'Latency.I']"
18575,1108.6304,Eraldo Marinho,Eraldo Pereira Marinho and Carmen Maria Andreazza,Anisotropic k-Nearest Neighbor Search Using Covariance Quadtree,"Work presented at the Minisymposia of Computational Geometry in the
  joint events IX Argentinian Congress on Computational Mechanics, XXXI
  Iberian-Latin-American Congress on Computational Methods in Engineering, II
  South American Congress on Computational Mechanics, held in Buenos Aires in
  15-18 November 2010; Mec\'anica Computacional (Computational Mechanics) Vol.
  XXIX, 2010, ISSN 1666-6070","2010, Mec\'anica Computacional, Volume XXIX. Number 60.
  Computational Geometry (A), pp 6045-6064",,,cs.CV cs.CG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a variant of the hyper-quadtree that divides a multidimensional
space according to the hyperplanes associated to the principal components of
the data in each hyperquadrant. Each of the $2^\lambda$ hyper-quadrants is a
data partition in a $\lambda$-dimension subspace, whose intrinsic
dimensionality $\lambda\leq d$ is reduced from the root dimensionality $d$ by
the principal components analysis, which discards the irrelevant eigenvalues of
the local covariance matrix. In the present method a component is irrelevant if
its length is smaller than, or comparable to, the local inter-data spacing.
Thus, the covariance hyper-quadtree is fully adaptive to the local
dimensionality. The proposed data-structure is used to compute the anisotropic
K nearest neighbors (kNN), supported by the Mahalanobis metric. As an
application, we used the present k nearest neighbors method to perform density
estimation over a noisy data distribution. Such estimation method can be
further incorporated to the smoothed particle hydrodynamics, allowing computer
simulations of anisotropic fluid flows.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2011 17:57:27 GMT'}]",2014-03-31,"[['Marinho', 'Eraldo Pereira', ''], ['Andreazza', 'Carmen Maria', '']]","['k nearest neighbors', 'quadtrees', 'hyper-quadtrees', 'principal components analysis', 'anisotropy']"
18576,0907.4653,Yao Yu,"Athina P. Petropulu, Yao Yu and H. Vincent Poor",Distributed MIMO radar using compressive sampling,,"Proc. 42th Asilomar Conf.Signals, Syst. Comput, pp. 203 - 207,
  Nov. 2008",,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A distributed MIMO radar is considered, in which the transmit and receive
antennas belong to nodes of a small scale wireless network. The transmit
waveforms could be uncorrelated, or correlated in order to achieve a desirable
beampattern. The concept of compressive sampling is employed at the receive
nodes in order to perform direction of arrival (DOA) estimation. According to
the theory of compressive sampling, a signal that is sparse in some domain can
be recovered based on far fewer samples than required by the Nyquist sampling
theorem. The DOAs of targets form a sparse vector in the angle space, and
therefore, compressive sampling can be applied for DOA estimation. The proposed
approach achieves the superior resolution of MIMO radar with far fewer samples
than other approaches. This is particularly useful in a distributed scenario,
in which the results at each receive node need to be transmitted to a fusion
center.
","[{'version': 'v1', 'created': 'Mon, 27 Jul 2009 15:14:10 GMT'}]",2009-07-28,"[['Petropulu', 'Athina P.', ''], ['Yu', 'Yao', ''], ['Poor', 'H. Vincent', '']]","['Compressive sampling', 'MIMO Radar', 'DOA Estimation']"
18577,1410.1776,Maurizio Proietti,"Fabrizio Smith, Maurizio Proietti","Ontology-based Representation and Reasoning on Process Models: A Logic
  Programming Approach",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a framework grounded in Logic Programming for representing and
reasoning about business processes from both the procedural and ontological
point of views. In particular, our goal is threefold: (1) define a logical
language and a formal semantics for process models enriched with ontology-based
annotations; (2) provide an effective inference mechanism that supports the
combination of reasoning services dealing with the structural definition of a
process model, its behavior, and the domain knowledge related to the
participating business entities; (3) implement such a theoretical framework
into a process modeling and reasoning platform. To this end we define a process
ontology coping with a relevant fragment of the popular BPMN modeling notation.
The behavioral semantics of a process is defined as a state transition system
by following an approach similar to the Fluent Calculus, and allows us to
specify state change in terms of preconditions and effects of the enactment of
activities. Then we show how the procedural process knowledge can be seamlessly
integrated with the domain knowledge specified by using the OWL 2 RL rule-based
ontology language. Our framework provides a wide range of reasoning services,
including CTL model checking, which can be performed by using standard Logic
Programming inference engines through a goal-oriented, efficient, sound and
complete evaluation procedure. We also present a software environment
implementing the proposed framework, and we report on an experimental
evaluation of the system, whose results are encouraging and show the viability
of the approach.
","[{'version': 'v1', 'created': 'Tue, 7 Oct 2014 15:39:03 GMT'}]",2014-10-08,"[['Smith', 'Fabrizio', ''], ['Proietti', 'Maurizio', '']]","['Business Processes', 'Ontologies', 'Logic Programming', 'Knowledge Representation', 'Verification']"
18578,1603.04615,Jean-Florent Raymond,Jean-Florent Raymond and Dimitrios M. Thilikos,Recent techniques and results on the Erd\H{o}s-P\'osa property,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several min-max relations in graph theory can be expressed in the framework
of the Erd\H{o}s-P\'osa property. Typically, this property reveals a connection
between packing and covering problems on graphs. We describe some recent
techniques for proving this property that are related to tree-like
decompositions. We also provide an unified presentation of the current state of
the art on this topic.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2016 09:58:15 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Apr 2016 15:40:51 GMT'}, {'version': 'v3', 'created': 'Wed, 19 Oct 2016 08:33:24 GMT'}, {'version': 'v4', 'created': 'Tue, 13 Dec 2016 11:03:23 GMT'}]",2016-12-14,"[['Raymond', 'Jean-Florent', ''], ['Thilikos', 'Dimitrios M.', '']]","['Erd˝os–P´osa property', 'min-max theorems', 'tree decompositions', 'tree partitions', 'girth', 'graph minors', 'topological minors', 'graph immersions']"
18579,1011.1368,Andrew Krizhanovsky A,A. A. Krizhanovsky,"Transformation of Wiktionary entry structure into tables and relations
  in a relational database schema","10 pages, 7 figures, preprint",,,,cs.IR,http://creativecommons.org/licenses/publicdomain/,"  This paper addresses the question of automatic data extraction from the
Wiktionary, which is a multilingual and multifunctional dictionary. Wiktionary
is a collaborative project working on the same principles as the Wikipedia. The
Wiktionary entry is a plain text from the text processing point of view.
Wiktionary guidelines prescribe the entry layout and rules, which should be
followed by editors of the dictionary. The presence of the structure of a
Wiktionary article and formatting rules allows transforming the Wiktionary
entry structure into tables and relations in a relational database schema,
which is a part of a machine-readable dictionary (MRD). The paper describes how
the flat text of the Wiktionary entry was extracted, converted, and stored in
the specially designed relational database. The MRD contains the definitions,
semantic relations, and translations extracted from the English and Russian
Wiktionaries. The parser software is released under the open source license
agreement (GPL), to facilitate its dissemination, modification and upgrades, to
draw researchers and programmers into parsing other Wiktionaries, not only
Russian and English.
","[{'version': 'v1', 'created': 'Fri, 5 Nov 2010 11:01:45 GMT'}]",2010-11-08,"[['Krizhanovsky', 'A. A.', '']]","['Wiktionary', 'Dictionary', 'Thesaurus', 'Lexicography', 'Machine-readable dictionary', 'Parser']"
18580,1605.00774,Ahmed Mateen Mr.,"Ahmad Mateen, Muhammad Azeem Akbar","Estimating software reliability in maintenance phase through ann and
  statistics",,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Maintenance is the last and the most critical phase of the software
development life cycle. It involves debugging of errors and different types of
enhancements which are requested by the user. Software reliability regarding
maintenance is the most crucial part as it depends upon the time and cost to
correct the errors and make enchantements. It is often felt that software
errors or correction takes time to be removed. The maintenance time depends
upon the nature of the occurred errors and requested enhancements. In this
research work we predict the software reliability in terms of time taken to
maintain the errors and enhancements. Artificial Neural Network is used to
analyze and predict the software reliability of the maintenance phase. At the
end statistical results and proposed neural network results are also compared
to make sure that forecasted results are equal to the output results. These
results are compared to show that the ANN can understand the relationship
between data in a better way. This research work also shows how much it is
difficult to understand the nature of maintenance data.
","[{'version': 'v1', 'created': 'Tue, 3 May 2016 07:53:04 GMT'}]",2016-05-04,"[['Mateen', 'Ahmad', ''], ['Akbar', 'Muhammad Azeem', '']]","['SDLC', 'Software maintenance', 'Software reliability', 'ANN', 'BPNN', 'Regression']"
18581,1609.09709,Francesco Mazzoli,"Francesco Mazzoli, Andreas Abel",Type checking through unification,,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we describe how to leverage higher-order unification to type
check a dependently typed language with meta-variables. The literature usually
presents the unification algorithm as a standalone component, however the need
to check definitional equality of terms while type checking gives rise to a
tight interplay between type checking and unification. This interplay is a
major source of complexity in the type-checking algorithm for existing
dependently typed programming languages. We propose an algorithm that encodes a
type-checking problem entirely in the form of unification constraints, reducing
the complexity of the type-checking code by taking advantage of higher order
unification, which is already part of the implementation of many dependently
typed languages.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2016 13:03:25 GMT'}]",2016-10-03,"[['Mazzoli', 'Francesco', ''], ['Abel', 'Andreas', '']]","['Dependent types', 'type checking', 'higher order unification', 'type reconstruction']"
18582,1309.6989,Keyan Zahedi,Keyan Zahedi and Georg Martius and Nihat Ay,"Linear combination of one-step predictive information with an external
  reward in an episodic policy gradient setting: a critical analysis",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the main challenges in the field of embodied artificial intelligence
is the open-ended autonomous learning of complex behaviours. Our approach is to
use task-independent, information-driven intrinsic motivation(s) to support
task-dependent learning. The work presented here is a preliminary step in which
we investigate the predictive information (the mutual information of the past
and future of the sensor stream) as an intrinsic drive, ideally supporting any
kind of task acquisition. Previous experiments have shown that the predictive
information (PI) is a good candidate to support autonomous, open-ended learning
of complex behaviours, because a maximisation of the PI corresponds to an
exploration of morphology- and environment-dependent behavioural regularities.
The idea is that these regularities can then be exploited in order to solve any
given task. Three different experiments are presented and their results lead to
the conclusion that the linear combination of the one-step PI with an external
reward function is not generally recommended in an episodic policy gradient
setting. Only for hard tasks a great speed-up can be achieved at the cost of an
asymptotic performance lost.
","[{'version': 'v1', 'created': 'Thu, 26 Sep 2013 17:44:59 GMT'}]",2013-09-27,"[['Zahedi', 'Keyan', ''], ['Martius', 'Georg', ''], ['Ay', 'Nihat', '']]","['information-driven self-organisation', 'predictive information', 'reinforcement learning', 'embodied artificial intelligence', 'embodied machine learning']"
18583,1502.04244,Nian Li,Maosheng Xiong and Nian Li,"Optimal cyclic codes with generalized Niho type zeroes and the weight
  distribution",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we extend the works \cite{gegeng2,XLZD} further in two
directions and compute the weight distribution of these cyclic codes under more
relaxed conditions. It is interesting to note that many cyclic codes in the
family are optimal and have only a few non-zero weights. Besides using similar
ideas from \cite{gegeng2,XLZD}, we carry out some subtle manipulation of
certain exponential sums.
","[{'version': 'v1', 'created': 'Sat, 14 Feb 2015 21:15:43 GMT'}]",2015-02-17,"[['Xiong', 'Maosheng', ''], ['Li', 'Nian', '']]","['Cyclic codes', 'weight distribution', 'Vandermonde matrix', 'Niho exponent']"
18584,1504.04596,Yadong Zhu,"Yadong Zhu, Yanyan Lan, Jiafeng Guo, Xueqi Cheng",Structural Learning of Diverse Ranking,"Discriminant Function, Diversity Feature, Learning Framework",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Relevance and diversity are both crucial criteria for an effective search
system. In this paper, we propose a unified learning framework for
simultaneously optimizing both relevance and diversity. Specifically, the
problem is formalized as a structural learning framework optimizing
Diversity-Correlated Evaluation Measures (DCEM), such as ERR-IA, a-NDCG and
NRBP. Within this framework, the discriminant function is defined to be a
bi-criteria objective maximizing the sum of the relevance scores and
dissimilarities (or diversity) among the documents. Relevance and diversity
features are utilized to define the relevance scores and dissimilarities,
respectively. Compared with traditional methods, the advantages of our approach
lie in that: (1) Directly optimizing DCEM as the loss function is more
fundamental for the task; (2) Our framework does not rely on explicit diversity
information such as subtopics, thus is more adaptive to real application; (3)
The representation of diversity as the feature-based scoring function is more
flexible to incorporate rich diversity-based features into the learning
framework. Extensive experiments on the public TREC datasets show that our
approach significantly outperforms state-of-the-art diversification approaches,
which validate the above advantages.
","[{'version': 'v1', 'created': 'Fri, 17 Apr 2015 18:23:16 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Apr 2015 09:59:00 GMT'}]",2015-04-21,"[['Zhu', 'Yadong', ''], ['Lan', 'Yanyan', ''], ['Guo', 'Jiafeng', ''], ['Cheng', 'Xueqi', '']]","['Discriminant Function', 'Diversity Feature', 'Learning Framework']"
18585,1511.08458,Keiron O'Shea,Keiron O'Shea and Ryan Nash,An Introduction to Convolutional Neural Networks,"10 pages, 5 figures",,,,cs.NE cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The field of machine learning has taken a dramatic twist in recent times,
with the rise of the Artificial Neural Network (ANN). These biologically
inspired computational models are able to far exceed the performance of
previous forms of artificial intelligence in common machine learning tasks. One
of the most impressive forms of ANN architecture is that of the Convolutional
Neural Network (CNN). CNNs are primarily used to solve difficult image-driven
pattern recognition tasks and with their precise yet simple architecture,
offers a simplified method of getting started with ANNs.
  This document provides a brief introduction to CNNs, discussing recently
published papers and newly formed techniques in developing these brilliantly
fantastic image recognition models. This introduction assumes you are familiar
with the fundamentals of ANNs and machine learning.
","[{'version': 'v1', 'created': 'Thu, 26 Nov 2015 17:45:01 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Dec 2015 18:06:03 GMT'}]",2015-12-03,"[[""O'Shea"", 'Keiron', ''], ['Nash', 'Ryan', '']]","['Pattern recognition', 'artificial neural networks', 'machine learning', 'image analysis']"
18586,1606.03513,Sanjib Tiwari,"Sanjib Tiwari, Michael Lane and Khorshed Alam","The challenges and opportunities of delivering wireless high speed
  broadband services in Rural and Remote Australia: A Case Study of Western
  Downs Region (WDR)","ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
  Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/205,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper critically assesses wireless broadband internet infrastructure, in
the rural and remote communities of WDR in terms of supply, demand and
utilisation. Only 8 of 20 towns have ADSL/ADSL2+, and only 3 towns have 4G
mobile network coverage. Conversely all of the towns have 2G/3G mobile network
coverage but have problems with speed, reliability of service and capacity to
handle data traffic loads at peak times. Satellite broadband internet for
remote areas is also patchy at best. Satisfaction with existing wireless
broadband internet services is highly variable across rural and remote
communities in WDR. Finally we provide suggestions to improve broadband
internet access for rural and remote communities. Public and private investment
and sharing of wired and wireless broadband internet infrastructure is needed
to provide the backhaul networks and 4G mobile and fixed wireless services to
ensure high speed, reliable and affordable broadband services for rural and
remote communities.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 00:40:39 GMT'}]",2016-06-14,"[['Tiwari', 'Sanjib', ''], ['Lane', 'Michael', ''], ['Alam', 'Khorshed', '']]","['Broadband internet', 'Wireless network', 'rural and remote']"
18587,0903.0174,Zhe Chen,"Zhe Chen, Dunwei Wen","Accelerating and Evaluation of Syntactic Parsing in Natural Language
  Question Answering Systems","7 pages, International Conference on Artificial Intelligence
  (ICAI'07)",,,,cs.AI cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the development of Natural Language Processing (NLP), more and more
systems want to adopt NLP in User Interface Module to process user input, in
order to communicate with user in a natural way. However, this raises a speed
problem. That is, if NLP module can not process sentences in durable time
delay, users will never use the system. As a result, systems which are strict
with processing time, such as dialogue systems, web search systems, automatic
customer service systems, especially real-time systems, have to abandon NLP
module in order to get a faster system response. This paper aims to solve the
speed problem. In this paper, at first, the construction of a syntactic parser
which is based on corpus machine learning and statistics model is introduced,
and then a speed problem analysis is performed on the parser and its
algorithms. Based on the analysis, two accelerating methods, Compressed POS Set
and Syntactic Patterns Pruning, are proposed, which can effectively improve the
time efficiency of parsing in NLP module. To evaluate different parameters in
the accelerating algorithms, two new factors, PT and RT, are introduced and
explained in detail. Experiments are also completed to prove and test these
methods, which will surely contribute to the application of NLP.
","[{'version': 'v1', 'created': 'Sun, 1 Mar 2009 20:39:52 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Mar 2009 11:37:36 GMT'}]",2009-09-30,"[['Chen', 'Zhe', ''], ['Wen', 'Dunwei', '']]","['Parsing Algorithm', 'Evaluation', 'CorpusLearning', 'Question Answering', 'Natural Language Processing']"
18588,1412.4933,Sankha Dutta,"Sankha Baran Dutta, Robert McLeod, and Marcia Friesen","GPU accelerated Nature Inspired Methods for Modelling Large Scale
  Bi-Directional Pedestrian Movement",,,,,cs.DC,http://creativecommons.org/licenses/by/3.0/,"  Pedestrian movement, although ubiquitous and well-studied, is still not that
well understood due to the complicating nature of the embedded social dynamics.
Interest among researchers in simulating pedestrian movement and interactions
has grown significantly in part due to increased computational and
visualization capabilities afforded by high power computing. Different
approaches have been adopted to simulate pedestrian movement under various
circumstances and interactions. In the present work, bi-directional crowd
movement is simulated where an equal numbers of individuals try to reach the
opposite sides of an environment. Two movement methods are considered. First a
Least Effort Model (LEM) is investigated where agents try to take an optimal
path with as minimal changes from their intended path as possible. Following
this, a modified form of Ant Colony Optimization (ACO) is proposed, where
individuals are guided by a goal of reaching the other side in a least effort
mode as well as a pheromone trail left by predecessors. The basic idea is to
increase agent interaction, thereby more closely reflecting a real world
scenario. The methodology utilizes Graphics Processing Units (GPUs) for general
purpose computing using the CUDA platform. Because of the inherent parallel
properties associated with pedestrian movement such as proximate interactions
of individuals on a 2D grid, GPUs are well suited. The main feature of the
implementation undertaken here is that the parallelism is data driven. The data
driven implementation leads to a speedup up to 18x compared to its sequential
counterpart running on a single threaded CPU. The numbers of pedestrians
considered in the model ranged from 2K to 100K representing numbers typical of
mass gathering events. A detailed discussion addresses implementation
challenges faced and averted.
","[{'version': 'v1', 'created': 'Tue, 16 Dec 2014 10:03:30 GMT'}]",2014-12-17,"[['Dutta', 'Sankha Baran', ''], ['McLeod', 'Robert', ''], ['Friesen', 'Marcia', '']]","['Crowd Simulation', 'Agents', 'GPU Programming', 'CUDA', 'Least Effort Model', 'Metaheuristics', 'Ant Colony Optimization']"
18589,1003.1473,Rdv Ijcsis,"T. D. Roopamala, S. K. Katti","Comments on ""Routh Stability Criterion""","Pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS February 2010, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/",,,,cs.NA,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this note, we have shown special case on Routh stability criterion, which
is not discussed, in previous literature. This idea can be useful in computer
science applications.
","[{'version': 'v1', 'created': 'Sun, 7 Mar 2010 14:09:11 GMT'}]",2010-04-28,"[['Roopamala', 'T. D.', ''], ['Katti', 'S. K.', '']]","['Routh stability criterion', 'Routh array', 'Hurwitz criterion', 'stability']"
18590,1704.01814,Jayadev Misra,Jayadev Misra,"Bilateral Proofs of Safety and Progress Properties of Concurrent
  Programs",,,,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper suggests a theomisra@utexas.edury of composable specification of
concurrent programs that permits: (1) verification of program code for a given
specification, and (2) composition of the specifications of the components to
yield the specification of a program. The specification consists of both
terminal properties that hold at the end of a program execution (if the
execution terminates) and perpetual properties that hold throughout an
execution. We devise (1) proof techniques for verification, and (2) composition
rules to derive the specification of a program from those of its components. We
employ terminal properties of components to derive perpetual properties of a
program and conversely. Hence, this proof strategy is called bilateral. The
compositional aspect of the theory is important in assembling a program out of
components some of whose source code may not be available, as is increasingly
the case with cross-vendor program integration.
","[{'version': 'v1', 'created': 'Wed, 5 Apr 2017 17:48:36 GMT'}]",2017-04-07,"[['Misra', 'Jayadev', '']]","['Program specification', 'concurrent programming', 'verification', 'composition', 'safety and progress properties']"
18591,1511.00221,Ilya Loshchilov,Ilya Loshchilov,LM-CMA: an Alternative to L-BFGS for Large Scale Black-box Optimization,"to appear in Evolutionary Computation Journal, MIT Press",,,,cs.NE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The limited memory BFGS method (L-BFGS) of Liu and Nocedal (1989) is often
considered to be the method of choice for continuous optimization when first-
and/or second- order information is available. However, the use of L-BFGS can
be complicated in a black-box scenario where gradient information is not
available and therefore should be numerically estimated. The accuracy of this
estimation, obtained by finite difference methods, is often problem-dependent
that may lead to premature convergence of the algorithm.
  In this paper, we demonstrate an alternative to L-BFGS, the limited memory
Covariance Matrix Adaptation Evolution Strategy (LM-CMA) proposed by Loshchilov
(2014). The LM-CMA is a stochastic derivative-free algorithm for numerical
optimization of non-linear, non-convex optimization problems. Inspired by the
L-BFGS, the LM-CMA samples candidate solutions according to a covariance matrix
reproduced from $m$ direction vectors selected during the optimization process.
The decomposition of the covariance matrix into Cholesky factors allows to
reduce the memory complexity to $O(mn)$, where $n$ is the number of decision
variables. The time complexity of sampling one candidate solution is also
$O(mn)$, but scales as only about 25 scalar-vector multiplications in practice.
The algorithm has an important property of invariance w.r.t. strictly
increasing transformations of the objective function, such transformations do
not compromise its ability to approach the optimum. The LM-CMA outperforms the
original CMA-ES and its large scale versions on non-separable ill-conditioned
problems with a factor increasing with problem dimension. Invariance properties
of the algorithm do not prevent it from demonstrating a comparable performance
to L-BFGS on non-trivial large scale smooth and nonsmooth optimization
problems.
","[{'version': 'v1', 'created': 'Sun, 1 Nov 2015 09:52:58 GMT'}]",2015-11-03,"[['Loshchilov', 'Ilya', '']]","['LM-CMA', 'L-BFGS', 'CMA-ES', 'large scale optimization', 'black-box optimization']"
18592,1511.06833,Thenmalar S,"S. Thenmalar, J. Balaji, and T.V. Geetha",Semi-supervised Bootstrapping approach for Named Entity Recognition,"13 pages, 2 figures, 5 tables",,,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of Named Entity Recognition (NER) is to identify references of named
entities in unstructured documents, and to classify them into pre-defined
semantic categories. NER often aids from added background knowledge in the form
of gazetteers. However using such a collection does not deal with name variants
and cannot resolve ambiguities associated in identifying the entities in
context and associating them with predefined categories. We present a
semi-supervised NER approach that starts with identifying named entities with a
small set of training data. Using the identified named entities, the word and
the context features are used to define the pattern. This pattern of each named
entity category is used as a seed pattern to identify the named entities in the
test set. Pattern scoring and tuple value score enables the generation of the
new patterns to identify the named entity categories. We have evaluated the
proposed system for English language with the dataset of tagged (IEER) and
untagged (CoNLL 2003) named entity corpus and for Tamil language with the
documents from the FIRE corpus and yield an average f-measure of 75% for both
the languages.
","[{'version': 'v1', 'created': 'Sat, 21 Nov 2015 04:11:44 GMT'}]",2015-11-24,"[['Thenmalar', 'S.', ''], ['Balaji', 'J.', ''], ['Geetha', 'T. V.', '']]","['Named entity recognition', 'semi-supervised', 'pattern based bootstrapping', 'Tamil natural language processing']"
18593,1505.01462,Nihar Shah,"Nihar B. Shah, Sivaraman Balakrishnan, Joseph Bradley, Abhay Parekh,
  Kannan Ramchandran, Martin J. Wainwright","Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology
  Dependence","39 pages, 5 figures. Significant extension of arXiv:1406.6618",,,,cs.LG cs.IT math.IT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data in the form of pairwise comparisons arises in many domains, including
preference elicitation, sporting competitions, and peer grading among others.
We consider parametric ordinal models for such pairwise comparison data
involving a latent vector $w^* \in \mathbb{R}^d$ that represents the
""qualities"" of the $d$ items being compared; this class of models includes the
two most widely used parametric models--the Bradley-Terry-Luce (BTL) and the
Thurstone models. Working within a standard minimax framework, we provide tight
upper and lower bounds on the optimal error in estimating the quality score
vector $w^*$ under this class of models. The bounds depend on the topology of
the comparison graph induced by the subset of pairs being compared via its
Laplacian spectrum. Thus, in settings where the subset of pairs may be chosen,
our results provide principled guidelines for making this choice. Finally, we
compare these error rates to those under cardinal measurement models and show
that the error rates in the ordinal and cardinal settings have identical
scalings apart from constant pre-factors.
","[{'version': 'v1', 'created': 'Wed, 6 May 2015 19:04:09 GMT'}]",2015-05-07,"[['Shah', 'Nihar B.', ''], ['Balakrishnan', 'Sivaraman', ''], ['Bradley', 'Joseph', ''], ['Parekh', 'Abhay', ''], ['Ramchandran', 'Kannan', ''], ['Wainwright', 'Martin J.', '']]","['Pairwise comparisons', 'inference', 'ranking', 'topology', 'crowdsourcingAbstract']"
18594,1702.07071,Vladimir Vargas-Calder\'on,Keith Y. Patarroyo and Vladimir Vargas-Calder\'on,"Pronunciation recognition of English phonemes /\textipa{@}/, /{\ae}/,
  /\textipa{A}:/ and /\textipa{2}/ using Formants and Mel Frequency Cepstral
  Coefficients","11 pages, pre-print version",,,,cs.CL cs.SD,http://creativecommons.org/licenses/by/4.0/,"  The Vocal Joystick Vowel Corpus, by Washington University, was used to study
monophthongs pronounced by native English speakers. The objective of this study
was to quantitatively measure the extent at which speech recognition methods
can distinguish between similar sounding vowels. In particular, the phonemes
/\textipa{@}/, /{\ae}/, /\textipa{A}:/ and /\textipa{2}/ were analysed. 748
sound files from the corpus were used and subjected to Linear Predictive Coding
(LPC) to compute their formants, and to Mel Frequency Cepstral Coefficients
(MFCC) algorithm, to compute the cepstral coefficients. A Decision Tree
Classifier was used to build a predictive model that learnt the patterns of the
two first formants measured in the data set, as well as the patterns of the 13
cepstral coefficients. An accuracy of 70\% was achieved using formants for the
mentioned phonemes. For the MFCC analysis an accuracy of 52 \% was achieved and
an accuracy of 71\% when /\textipa{@}/ was ignored. The results obtained show
that the studied algorithms are far from mimicking the ability of
distinguishing subtle differences in sounds like human hearing does.
","[{'version': 'v1', 'created': 'Thu, 23 Feb 2017 02:31:03 GMT'}]",2017-02-24,"[['Patarroyo', 'Keith Y.', ''], ['Vargas-Calderón', 'Vladimir', '']]","['sound processing', 'formants', 'Mel frequency cepstral coefficients', 'pronunciation recognition', 'machine learning']"
18595,1502.03942,"Lorenz H\""ubschle-Schneider","Lorenz H\""ubschle-Schneider and Peter Sanders and Ingo M\""uller",Communication Efficient Algorithms for Top-k Selection Problems,,,,,cs.DS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present scalable parallel algorithms with sublinear per-processor
communication volume and low latency for several fundamental problems related
to finding the most relevant elements in a set, for various notions of
relevance: We begin with the classical selection problem with unsorted input.
We present generalizations with locally sorted inputs, dynamic content
(bulk-parallel priority queues), and multiple criteria. Then we move on to
finding frequent objects and top-k sum aggregation. Since it is unavoidable
that the output of these algorithms might be unevenly distributed over the
processors, we also explain how to redistribute this data with minimal
communication.
","[{'version': 'v1', 'created': 'Fri, 13 Feb 2015 11:01:29 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Oct 2015 15:28:27 GMT'}]",2015-10-20,"[['Hübschle-Schneider', 'Lorenz', ''], ['Sanders', 'Peter', ''], ['Müller', 'Ingo', '']]","['selection', 'frequent elements', 'sum aggregation', 'priority queue', 'sampling', 'branchand-bound', 'data redistribution', 'threshold algorithm']"
18596,1108.5624,Serge Kernbach,"Donny K. Sutantyo, Serge Kernbach, Valentin A. Nepomnyashchikh, Paul
  Levi","Multi-Robot Searching Algorithm Using Levy Flight and Artificial
  Potential Field","Eighth IEEE International Workshop on Safety, Security, and Rescue
  Robotics (SSRR-2010), Bremen, Germany, 26-30 July 2010",,,,cs.RO cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An efficient search algorithm is very crucial in robotic area, especially for
exploration missions, where the target availability is unknown and the
condition of the environment is highly unpredictable. In a very large
environment, it is not sufficient to scan an area or volume by a single robot,
multiple robots should be involved to perform the collective exploration. In
this paper, we propose to combine bio-inspired search algorithm called Levy
flight and artificial potential field method to perform an efficient searching
algorithm for multi-robot applications. The main focus of this work is not only
to prove the concept or to measure the efficiency of the algorithm by
experiments, but also to develop an appropriate generic framework to be
implemented both in simulation and on real robotic platforms. Several
experiments, which compare different search algorithms, are also performed.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2011 16:12:11 GMT'}]",2011-08-30,"[['Sutantyo', 'Donny K.', ''], ['Kernbach', 'Serge', ''], ['Nepomnyashchikh', 'Valentin A.', ''], ['Levi', 'Paul', '']]","['Multi-Robot', 'Levy Flight', 'Artificial PotentialField', 'Random Search Algorithm']"
18597,1209.4246,Xiaojing Shen,"Xiaojing Shen, Pramod K. Varshney, Yunmin Zhu",Distributed Bayesian Detection Under Unknown Observation Statistics,"17 pages, 6 figures, submitted to journal",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, distributed Bayesian detection problems with unknown prior
probabilities of hypotheses are considered. The sensors obtain observations
which are conditionally dependent across sensors and their probability density
functions (pdf) are not exactly known. The observations are quantized and are
sent to the fusion center. The fusion center fuses the current quantized
observations and makes a final decision. It also designs (updated) quantizers
to be used at the sensors and the fusion rule based on all previous quantized
observations. Information regarding updated quantizers is sent back to the
sensors for use at the next time. In this paper, the conditional joint pdf is
represented in a parametric form by using the copula framework. The unknown
parameters include dependence parameters and marginal parameters. Maximum
likelihood estimation (MLE) with feedback based on quantized data is proposed
to estimate the unknown parameters. These estimates are iteratively used to
refine the quantizers and the fusion rule to improve distributed detection
performance by using feedback. Numerical examples show that the new detection
method based on MLE with feedback is much better than the usual detection
method based on the assumption of conditionally independent observations.
","[{'version': 'v1', 'created': 'Wed, 19 Sep 2012 14:12:23 GMT'}]",2012-09-20,"[['Shen', 'Xiaojing', ''], ['Varshney', 'Pramod K.', ''], ['Zhu', 'Yunmin', '']]","['Bayesian detection', 'copula-based dependence modeling', 'copulas', 'maximum likelihood estimation', 'distributed detection', 'information fusion']"
18598,1606.05597,Kieran Greer Dr,Kieran Greer,Adding Context to Concept Trees,,"International Journal of Intelligent Systems Design and Computing,
  Inderscience, Vol. 3, No. 1, pp.84-100, 2019",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Concept Tree is a structure for storing knowledge where the trees are
stored in a database called a Concept Base. It sits between the highly
distributed neural architectures and the distributed information systems, with
the intention of bringing brain-like and computer systems closer together.
Concept Trees can grow from the semi-structured sources when consistent
sequences of concepts are presented. Each tree ideally represents a single
cohesive concept and the trees can link with each other for navigation and
semantic purposes. The trees are therefore also a type of semantic network and
would benefit from having a consistent level of context for each node. A
consistent build process is managed through a 'counting rule' and some other
rules that can normalise the database structure. This restricted structure can
then be complimented and enriched by the more dynamic context. It is also
suggested to use the linking structure of the licas system [15] as a basis for
the context links, where the mathematical model is extended further to define
this. A number of tests have demonstrated the soundness of the architecture.
Building the trees from text documents shows that the tree structure could be
inherent in natural language. Then, two types of query language are described.
Both of these can perform consistent query processes to return knowledge to the
user and even enhance the query with new knowledge. This is supported even
further with direct comparisons to a cognitive model, also being developed by
the author.
","[{'version': 'v1', 'created': 'Fri, 17 Jun 2016 17:32:11 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Sep 2017 10:58:32 GMT'}, {'version': 'v3', 'created': 'Thu, 1 Mar 2018 15:54:50 GMT'}, {'version': 'v4', 'created': 'Tue, 7 Aug 2018 14:49:17 GMT'}, {'version': 'v5', 'created': 'Fri, 17 Jan 2020 10:08:32 GMT'}]",2020-04-07,"[['Greer', 'Kieran', '']]","['Concept', 'tree', 'context', 'link', 'natural order', 'semantic', 'self-organise']"
18599,1307.0087,Fabrizio M.A. Lolli,Fabrizio M.A. Lolli,"Semantics and pragmatics in actual software applications and in web
  search engines: exploring innovations",,"International Symposium on Language and Communication: Exploring
  Novelties, vol.3, 955-962. IICS, 2013, Turkey",,,cs.IR cs.CL cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While new ways to use the Semantic Web are developed every week, which allow
the user to find information on web more accurately - for example in search
engines - some sophisticated pragmatic tools are becoming more important - for
example in web interfaces known as Social Intelligence, or in the most famous
Siri by Apple. The work aims to analyze whether and where we can identify the
boundary between semantics and pragmatics in the software used by analyzed
systems. examining how the linguistic disciplines are fundamental in their
progress. Is it possible to assume that the tools of social intelligence have a
pragmatic approach to the questions of the user, or it is just a use of a very
rich vocabulary, with the use of semantic tools?
","[{'version': 'v1', 'created': 'Sat, 29 Jun 2013 10:40:59 GMT'}]",2013-07-02,"[['Lolli', 'Fabrizio M. A.', '']]","['Semantic', 'Pragmatic', 'Web', 'Artificial Intelligence', 'Google', 'Siri']"
18600,1010.1982,Jing-wei Chen,"Jingwei Chen, Yong Feng, Xiaolin Qin and Jingzhong Zhang",Detecting Simultaneous Integer Relations for Several Real Vectors,10 pages,,,,cs.SC cs.CC math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An algorithm which either finds an nonzero integer vector ${\mathbf m}$ for
given $t$ real $n$-dimensional vectors ${\mathbf x}_1,...,{\mathbf x}_t$ such
that ${\mathbf x}_i^T{\mathbf m}=0$ or proves that no such integer vector with
norm less than a given bound exists is presented in this paper. The cost of the
algorithm is at most ${\mathcal O}(n^4 + n^3 \log \lambda(X))$ exact arithmetic
operations in dimension $n$ and the least Euclidean norm $\lambda(X)$ of such
integer vectors. It matches the best complexity upper bound known for this
problem. Experimental data show that the algorithm is better than an already
existing algorithm in the literature. In application, the algorithm is used to
get a complete method for finding the minimal polynomial of an unknown complex
algebraic number from its approximation, which runs even faster than the
corresponding \emph{Maple} built-in function.
","[{'version': 'v1', 'created': 'Mon, 11 Oct 2010 01:26:08 GMT'}]",2010-10-12,"[['Chen', 'Jingwei', ''], ['Feng', 'Yong', ''], ['Qin', 'Xiaolin', ''], ['Zhang', 'Jingzhong', '']]","['integer relation', 'PSLQ', 'HJLS', 'algebraic number', 'minimal polynomial']"
18601,1702.06662,Davoud Mougouei,"Davoud Mougouei, David M. W. Powers, Asghar Moeini","An Integer Programming Model for Binary Knapsack Problem with
  Value-Related Dependencies among Elements",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Binary Knapsack Problem (BKP) is to select a subset of an element (item) set
with the highest value while keeping the total weight within the capacity of
the knapsack. This paper presents an integer programming model for a variation
of BKP where the value of each element may depend on selecting or ignoring
other elements. Strengths of such Value-Related Dependencies are assumed to be
imprecise and hard to specify. To capture this imprecision, we have proposed
modeling value-related dependencies using fuzzy graphs and their algebraic
structure.
","[{'version': 'v1', 'created': 'Wed, 22 Feb 2017 03:14:05 GMT'}]",2017-02-23,"[['Mougouei', 'Davoud', ''], ['Powers', 'David M. W.', ''], ['Moeini', 'Asghar', '']]","['Binary Knapsack Problem', 'Integer Programming', 'Dependency', 'Value']"
18602,1603.08300,Shouhuai Xu,Xiaohu Li and Paul Parker and Shouhuai Xu,"A Stochastic Model for Quantitative Security Analyses of Networked
  Systems",,"IEEE Transactions on Dependable and Secure Computing (IEEE TDSC),
  8(1): 28-43 (2011)",,,cs.CR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional security analyses are often geared towards cryptographic
primitives or protocols. Although such analyses are necessary, they cannot
address a defender's need for insight into {\em which aspects of a networked
system having a significant impact on its security, and how to tune its
configurations or parameters so as to improve security}. This question is known
to be notoriously difficult to answer, and the state-of-the-art is that we know
little about it. Towards ultimately addressing this question, this paper
presents a stochastic model for quantifying security of networked systems. The
resulting model captures two aspects of a networked system: (1) the strength of
deployed security mechanisms such as intrusion detection systems, and (2) the
underlying {\em vulnerability graph}, which reflects how attacks may proceed.
The resulting model brings the following insights: (1) How should a defender
""tune"" system configurations (e.g., network topology) so as to improve
security? (2) How should a defender ""tune"" system parameters (e.g., by
upgrading which security mechanisms) so as to improve security? (3) Under what
conditions is the steady-state number of compromised entities of interest below
a given threshold with a high probability? Simulation studies are conducted to
confirm the analytic results, and to show the tightness of the bounds of
certain important metric that cannot be resolved analytically.
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2016 04:23:28 GMT'}]",2016-03-29,"[['Li', 'Xiaohu', ''], ['Parker', 'Paul', ''], ['Xu', 'Shouhuai', '']]","['Security modeling', 'quantitative security analysis', 'vulnerability graph', 'networked']"
18603,1304.5063,Hichem Bannour,Hichem Bannour and C\'eline Hudelot,"Combinaison d'information visuelle, conceptuelle, et contextuelle pour
  la construction automatique de hierarchies semantiques adaptees a
  l'annotation d'images","RFIA 2012 (Reconnaissance des Formes et Intelligence Artificielle)
  Lyon, France pg. 462-469. 9 pages","RFIA 2012 (Reconnaissance des Formes et Intelligence Artificielle)
  Lyon, France pg. 462-469",,,cs.CV cs.LG cs.MM,http://creativecommons.org/licenses/publicdomain/,"  This paper proposes a new methodology to automatically build semantic
hierarchies suitable for image annotation and classification. The building of
the hierarchy is based on a new measure of semantic similarity. The proposed
measure incorporates several sources of information: visual, conceptual and
contextual as we defined in this paper. The aim is to provide a measure that
best represents image semantics. We then propose rules based on this measure,
for the building of the final hierarchy, and which explicitly encode
hierarchical relationships between different concepts. Therefore, the built
hierarchy is used in a semantic hierarchical classification framework for image
annotation. Our experiments and results show that the hierarchy built improves
classification results.
  Ce papier propose une nouvelle methode pour la construction automatique de
hierarchies semantiques adaptees a la classification et a l'annotation
d'images. La construction de la hierarchie est basee sur une nouvelle mesure de
similarite semantique qui integre plusieurs sources d'informations: visuelle,
conceptuelle et contextuelle que nous definissons dans ce papier. L'objectif
est de fournir une mesure qui est plus proche de la semantique des images. Nous
proposons ensuite des regles, basees sur cette mesure, pour la construction de
la hierarchie finale qui encode explicitement les relations hierarchiques entre
les differents concepts. La hierarchie construite est ensuite utilisee dans un
cadre de classification semantique hierarchique d'images en concepts visuels.
Nos experiences et resultats montrent que la hierarchie construite permet
d'ameliorer les resultats de la classification.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2013 09:40:12 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Apr 2013 11:49:10 GMT'}]",2013-04-29,"[['Bannour', 'Hichem', ''], ['Hudelot', 'Céline', '']]","['Semantic hierarchies building', 'image semantics', 'image annotation', 'semantic relatedness measure', 'hierarchical imageclassification']"
18604,1702.07069,Hakan Erdogms,Hakan Erdogmus and Cecile Peraire,Flipping a Graduate-Level Software Engineering Foundations Course,"10 pages, accepted to ICSE 2017, Software Engineering and Education
  Track",,,,cs.SE cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Creating a graduate-level software engineering breadth course is challenging.
The scope is wide. Students prefer hands-on work over theory. Industry
increasingly values soft skills. Changing software technology requires the
syllabus to be technology-agnostic, yet abstracting away technology compromises
realism. Instructors must balance scope with depth of learning. At Carnegie
Mellon University, we designed a flipped-classroom course that tackles these
tradeoffs. The course has been offered since Fall 2014 in the Silicon Valley
campus. In this paper, we describe the course's key features and summarize our
experiences and lessons learned while designing, teaching, and maintaining it.
We found that the pure flipped-classroom format was not optimal in ensuring
sufficient transfer of knowledge, especially in remote settings. We initially
underestimated teaching assistantship resources. We gradually complemented
video lectures and hands-on live sessions with additional live components:
easily replaceable recitations that focus on current technology and mini
lectures that address application of theory and common wisdom. We also provided
the students with more opportunities to share their successes and experiments
with their peers. We achieved scalability by increasing the number of teaching
assistants, paying attention to teaching assistant recruitment, and fostering a
culture of mentoring among the teaching team.
","[{'version': 'v1', 'created': 'Thu, 23 Feb 2017 02:25:15 GMT'}]",2017-02-24,"[['Erdogmus', 'Hakan', ''], ['Peraire', 'Cecile', '']]","['software engineering education', 'flipped classroom', 'inverted instruction', 'software education curricula']"
18605,0712.0948,Stefan Woltran,Stefan Woltran,"A Common View on Strong, Uniform, and Other Notions of Equivalence in
  Answer-Set Programming",,,,,cs.AI cs.LO,,"  Logic programming under the answer-set semantics nowadays deals with numerous
different notions of program equivalence. This is due to the fact that
equivalence for substitution (known as strong equivalence) and ordinary
equivalence are different concepts. The former holds, given programs P and Q,
iff P can be faithfully replaced by Q within any context R, while the latter
holds iff P and Q provide the same output, that is, they have the same answer
sets. Notions in between strong and ordinary equivalence have been introduced
as theoretical tools to compare incomplete programs and are defined by either
restricting the syntactic structure of the considered context programs R or by
bounding the set A of atoms allowed to occur in R (relativized equivalence).For
the latter approach, different A yield properly different equivalence notions,
in general. For the former approach, however, it turned out that any
``reasonable'' syntactic restriction to R coincides with either ordinary,
strong, or uniform equivalence. In this paper, we propose a parameterization
for equivalence notions which takes care of both such kinds of restrictions
simultaneously by bounding, on the one hand, the atoms which are allowed to
occur in the rule heads of the context and, on the other hand, the atoms which
are allowed to occur in the rule bodies of the context. We introduce a general
semantical characterization which includes known ones as SE-models (for strong
equivalence) or UE-models (for uniform equivalence) as special cases.
Moreover,we provide complexity bounds for the problem in question and sketch a
possible implementation method.
  To appear in Theory and Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Thu, 6 Dec 2007 14:26:42 GMT'}]",2007-12-07,"[['Woltran', 'Stefan', '']]","['Answer-set programming', 'strong equivalence', 'relativized equivalence']"
18606,0910.1762,Laurent Tapie,"Kwamiwi Mawussi (LURPA), Laurent Tapie (LURPA)","D\'efinition d'une pi\`ece test pour la caract\'erisation d'une machine
  UGV",,"1er Conrg\`es International Conception et Mod\'elisation des
  Syst\`emes M\'ecaniques, CMSM\'05, Tunisie (2005)",,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In several fields like aeronautics, die and automotive, the machining of the
parts is done more and more on high speed machines tools. Today, the offer for
purchasing these machine tools is very wide. This situation poses the problem
of the judicious and objective choice meeting industrial needs that must be
necessary well expressed. The choice remains difficult insofar as the technical
data provided to the customers by the manufacturers of machine tools are
insufficient as well quantitatively as qualitatively. In this paper we present
a protocol for the characterization of machines tools in order to direct the
choice. The protocol is based on the one hand on no-load complementary tests to
those recommended by the standards ISO 230 and ISO 10791 and on the other hand
on the tests in load on a part test. In the first part, we present the
industrial needs as well as an analysis of the technical data of machine tools.
The second part is devoted to the study of the standards, the description of
the protocol and the presentation of the results.
","[{'version': 'v1', 'created': 'Fri, 9 Oct 2009 14:37:27 GMT'}]",2009-10-12,"[['Mawussi', 'Kwamiwi', '', 'LURPA'], ['Tapie', 'Laurent', '', 'LURPA']]","['Characterization of machine tools', 'high speed machining', 'ISO standards for tests of machine tools']"
18607,1111.6883,Martin Moguillansky,"Mart\'in O. Moguillansky, Nicol\'as D. Rotstein, Marcelo A. Falappa,
  Alejandro J. Garc\'ia and Guillermo R. Simari",Dynamics of Knowledge in DeLP through Argument Theory Change,61 pages To appear in Theory and Practice of Logic Programming (TPLP),,,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article is devoted to the study of methods to change defeasible logic
programs (de.l.p.s) which are the knowledge bases used by the Defeasible Logic
Programming (DeLP) interpreter. DeLP is an argumentation formalism that allows
to reason over potentially inconsistent de.l.p.s. Argument Theory Change (ATC)
studies certain aspects of belief revision in order to make them suitable for
abstract argumentation systems. In this article, abstract arguments are
rendered concrete by using the particular rule-based defeasible logic adopted
by DeLP. The objective of our proposal is to define prioritized argument
revision operators \`a la ATC for de.l.p.s, in such a way that the newly
inserted argument ends up undefeated after the revision, thus warranting its
conclusion. In order to ensure this warrant, the de.l.p. has to be changed in
concordance with a minimal change principle. To this end, we discuss different
minimal change criteria that could be adopted. Finally, an algorithm is
presented, implementing the argument revision operations.
","[{'version': 'v1', 'created': 'Tue, 29 Nov 2011 16:34:22 GMT'}]",2011-11-30,"[['Moguillansky', 'Martín O.', ''], ['Rotstein', 'Nicolás D.', ''], ['Falappa', 'Marcelo A.', ''], ['García', 'Alejandro J.', ''], ['Simari', 'Guillermo R.', '']]","['Knowledge Representation and Reasoning', 'Logic Programming', 'Belief Revision', 'Argumentation', 'Non-monotonic Reasoning']"
18608,1009.2622,Anindya Das Shohag,"Anindya Das, Ifat Jahangir, Masud Hasan",On the Design and Analysis of Quaternary Serial and Parallel Adders,,,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optimization techniques for decreasing the time and area of adder circuits
have been extensively studied for years mostly in binary logic system. In this
paper, we provide the necessary equations required to design a full adder in
quaternary logic system. We develop the equations for single-stage parallel
adder which works as a carry look-ahead adder. We also provide the design of a
logarithmic stage parallel adder which can compute the carries within log2(n)
time delay for n qudits. At last, we compare the designs and finally propose a
hybrid adder which combines the advantages of serial and parallel adder.
","[{'version': 'v1', 'created': 'Tue, 14 Sep 2010 10:48:56 GMT'}]",2010-09-15,"[['Das', 'Anindya', ''], ['Jahangir', 'Ifat', ''], ['Hasan', 'Masud', '']]","['Quaternary fast adder', 'Logarithmic time adder', 'Sparse adder', 'Hybrid adder']"
18609,1301.0534,"Peter Gr\""unwald","Steven de Rooij, Tim van Erven, Peter D. Gr\""unwald, Wouter M. Koolen","Follow the Leader If You Can, Hedge If You Must",under submission,"Journal of Machine Learning Research 15(37):1281-1316, 2014",,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Follow-the-Leader (FTL) is an intuitive sequential prediction strategy that
guarantees constant regret in the stochastic setting, but has terrible
performance for worst-case data. Other hedging strategies have better
worst-case guarantees but may perform much worse than FTL if the data are not
maximally adversarial. We introduce the FlipFlop algorithm, which is the first
method that provably combines the best of both worlds.
  As part of our construction, we develop AdaHedge, which is a new way of
dynamically tuning the learning rate in Hedge without using the doubling trick.
AdaHedge refines a method by Cesa-Bianchi, Mansour and Stoltz (2007), yielding
slightly improved worst-case guarantees. By interleaving AdaHedge and FTL, the
FlipFlop algorithm achieves regret within a constant factor of the FTL regret,
without sacrificing AdaHedge's worst-case guarantees.
  AdaHedge and FlipFlop do not need to know the range of the losses in advance;
moreover, unlike earlier methods, both have the intuitive property that the
issued weights are invariant under rescaling and translation of the losses. The
losses are also allowed to be negative, in which case they may be interpreted
as gains.
","[{'version': 'v1', 'created': 'Thu, 3 Jan 2013 19:49:14 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Jan 2013 10:03:03 GMT'}]",2021-08-31,"[['de Rooij', 'Steven', ''], ['van Erven', 'Tim', ''], ['Grünwald', 'Peter D.', ''], ['Koolen', 'Wouter M.', '']]","['Hedge', 'Learning Rate', 'Mixability', 'Online learning', 'Prediction with ExpertAdvice']"
18610,1107.4724,Pablo Chico de Guzman Huerta,"Pablo Chico de Guzm\'an, Amadeo Casas, Manuel Carro and Manuel V.
  Hermenegildo","Parallel Backtracking with Answer Memoing for Independent
  And-Parallelism","19 pages, 15 figures, uses tlp style","Theory and Practice of Logic Programming (2011) volume 11, issue
  4-5, pages 555-574",,,cs.PL cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Goal-level Independent and-parallelism (IAP) is exploited by scheduling for
simultaneous execution two or more goals which will not interfere with each
other at run time. This can be done safely even if such goals can produce
multiple answers. The most successful IAP implementations to date have used
recomputation of answers and sequentially ordered backtracking. While in
principle simplifying the implementation, recomputation can be very inefficient
if the granularity of the parallel goals is large enough and they produce
several answers, while sequentially ordered backtracking limits parallelism.
And, despite the expected simplification, the implementation of the classic
schemes has proved to involve complex engineering, with the consequent
difficulty for system maintenance and extension, while still frequently running
into the well-known trapped goal and garbage slot problems. This work presents
an alternative parallel backtracking model for IAP and its implementation. The
model features parallel out-of-order (i.e., non-chronological) backtracking and
relies on answer memoization to reuse and combine answers. We show that this
approach can bring significant performance advantages. Also, it can bring some
simplification to the important engineering task involved in implementing the
backtracking mechanism of previous approaches.
","[{'version': 'v1', 'created': 'Sun, 24 Jul 2011 06:28:05 GMT'}]",2011-07-26,"[['de Guzmán', 'Pablo Chico', ''], ['Casas', 'Amadeo', ''], ['Carro', 'Manuel', ''], ['Hermenegildo', 'Manuel V.', '']]","['Parallelism', 'Logic Programming', 'Memoization', 'Backtracking', 'Performance']"
18611,1409.2760,Inga Ivanova,"Inga Ivanova, Oivind Strand, and Loet Leydesdorff","Synergy cycles in the Norwegian innovation system: The relation between
  synergy and cycle values","31 pages, 16 figures","Foresight and STI Governance, 13(1)(2019), 48-6",,,cs.CY q-fin.EC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The knowledge base of an economy measured in terms of Triple Helix relations
can be analyzed in terms of mutual information among geographical, sectorial,
and size distributions of firms as dimensions of the probabilistic entropy. The
resulting synergy values of a TH system provide static snapshots. In this
study, we add the time dimension and analyze the synergy dynamics using the
Norwegian innovation system as an example. The synergy among the three
dimensions can be mapped as a set of partial time series and spectrally
analyzed. The results suggest that the synergy at the level of both the country
and its 19 counties shoe non-chaotic oscillatory behavior and resonates in a
set of natural frequencies. That is, synergy surges and drops are non-random
and can be analyzed and predicted. There is a proportional dependence between
the amplitudes of oscillations and synergy values and an inverse proportional
dependence between the oscillation frequencies' relative inputs and synergy
values. This analysis of the data informs us that one can expect
frequency-related synergy-volatility growth in relation to the synergy value
and a shift in the synergy volatility towards the long-term fluctuations with
the synergy growth.
","[{'version': 'v1', 'created': 'Mon, 8 Sep 2014 10:06:35 GMT'}]",2019-12-18,"[['Ivanova', 'Inga', ''], ['Strand', 'Oivind', ''], ['Leydesdorff', 'Loet', '']]","['knowledge base', 'probabilistic entropy', 'triple helix', 'spectral analysis']"
18612,1712.04787,Ingmar Steiner,"Ingmar Steiner, S\'ebastien Le Maguer","Creating New Language and Voice Components for the Updated MaryTTS
  Text-to-Speech Synthesis Platform",,Proc. LREC 11 (2018) 3171-3175,,,cs.CL cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  We present a new workflow to create components for the MaryTTS text-to-speech
synthesis platform, which is popular with researchers and developers, extending
it to support new languages and custom synthetic voices. This workflow replaces
the previous toolkit with an efficient, flexible process that leverages modern
build automation and cloud-hosted infrastructure. Moreover, it is compatible
with the updated MaryTTS architecture, enabling new features and
state-of-the-art paradigms such as synthesis based on deep neural networks
(DNNs). Like MaryTTS itself, the new tools are free, open source software
(FOSS), and promote the use of open data.
","[{'version': 'v1', 'created': 'Wed, 13 Dec 2017 14:29:09 GMT'}, {'version': 'v2', 'created': 'Fri, 11 May 2018 09:23:11 GMT'}]",2018-05-14,"[['Steiner', 'Ingmar', ''], ['Maguer', 'Sébastien Le', '']]","['text-to-speech synthesis (TTS)', 'front-end', 'multilingual']"
18613,1410.4876,Elis\^angela Silva Dias,"Elis\^angela Silva Dias, Diane Castonguay, Humberto Longo, Walid
  Abdala Rfaei Jradi, Hugo A. D. do Nascimento","A GPU-based parallel algorithm for enumerating all chordless cycles in
  graphs",15 pages,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a finite undirected simple graph, a chordless cycle is an induced subgraph
which is a cycle. We propose a GPU parallel algorithm for enumerating all
chordless cycles of such a graph. The algorithm, implemented in OpenCL, is
based on a previous sequential algorithm developed by the current authors for
the same problem. It uses a more compact data structure for solution
representation which is suitable for the memory-size limitation of a GPU.
Moreover, for graphs with a sufficiently large amount of chordless cycles, the
algorithm presents a significant improvement in execution time that outperforms
the sequential method.
","[{'version': 'v1', 'created': 'Fri, 17 Oct 2014 21:48:50 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Jun 2015 14:19:14 GMT'}]",2015-06-26,"[['Dias', 'Elisângela Silva', ''], ['Castonguay', 'Diane', ''], ['Longo', 'Humberto', ''], ['Jradi', 'Walid Abdala Rfaei', ''], ['Nascimento', 'Hugo A. D. do', '']]","['Graphs', 'Chordless Cycles', 'Parallel Algorithm', 'GPU', 'OpenCL']"
18614,1011.1121,Dan Tavrov,"Oleg Chertov, Dan Tavrov",Providing Group Anonymity Using Wavelet Transform,"12 pages, 2 tables. Accepted to be printed by Springer in BNCOD 2010
  proceedings (Lecture Notes in Computer Science series)",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Providing public access to unprotected digital data can pose a threat of
unwanted disclosing the restricted information. The problem of protecting such
information can be divided into two main subclasses, namely, individual and
group data anonymity. By group anonymity we define protecting important data
patterns, distributions, and collective features which cannot be determined
through analyzing individual records only. An effective and comparatively
simple way of solving group anonymity problem is doubtlessly applying wavelet
transform. It's easy-to-implement, powerful enough, and might produce
acceptable results if used properly. In the paper, we present a novel method of
using wavelet transform for providing group anonymity; it is gained through
redistributing wavelet approximation values, along with simultaneous fixing
data mean value and leaving wavelet details unchanged (or proportionally
altering them). Moreover, we provide a comprehensive example to illustrate the
method.
","[{'version': 'v1', 'created': 'Thu, 4 Nov 2010 11:45:54 GMT'}]",2010-11-05,"[['Chertov', 'Oleg', ''], ['Tavrov', 'Dan', '']]","['wavelet transform', 'group anonymity', 'statistical disclosure control', 'privacy-preserving data mining']"
18615,1407.3392,Khaled Sellami KSI,"Khaled Sellami, Mohamed Ahmed-Nacer, Pierre Tiako",From Social Network to Semantic Social Network in Recommender System,"International Journal of Computer Science Issues (IJCSI),2012, 9(4)",,,,cs.SI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due the success of emerging Web 2.0, and different social network Web sites
such as Amazon and movie lens, recommender systems are creating unprecedented
opportunities to help people browsing the web when looking for relevant
information, and making choices. Generally, these recommender systems are
classified in three categories: content based, collaborative filtering, and
hybrid based recommendation systems. Usually, these systems employ standard
recommendation methods such as artificial neural networks, nearest neighbor, or
Bayesian networks. However, these approaches are limited compared to methods
based on web applications, such as social networks or semantic web. In this
paper, we propose a novel approach for recommendation systems called semantic
social recommendation systems that enhance the analysis of social networks
exploiting the power of semantic social network analysis. Experiments on
real-world data from Amazon examine the quality of our recommendation method as
well as the performance of our recommendation algorithms.
","[{'version': 'v1', 'created': 'Sat, 12 Jul 2014 14:37:01 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Jul 2015 20:37:02 GMT'}]",2015-07-21,"[['Sellami', 'Khaled', ''], ['Ahmed-Nacer', 'Mohamed', ''], ['Tiako', 'Pierre', '']]","['Recommender system', 'social network', 'semantic web', 'user profile']"
18616,1105.2274,Hua Ouyang,"Hua Ouyang, Alexander Gray",Data-Distributed Weighted Majority and Online Mirror Descent,,,,,cs.LG cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we focus on the question of the extent to which online
learning can benefit from distributed computing. We focus on the setting in
which $N$ agents online-learn cooperatively, where each agent only has access
to its own data. We propose a generic data-distributed online learning
meta-algorithm. We then introduce the Distributed Weighted Majority and
Distributed Online Mirror Descent algorithms, as special cases. We show, using
both theoretical analysis and experiments, that compared to a single agent:
given the same computation time, these distributed algorithms achieve smaller
generalization errors; and given the same generalization errors, they can be
$N$ times faster.
","[{'version': 'v1', 'created': 'Wed, 11 May 2011 18:59:13 GMT'}]",2019-08-17,"[['Ouyang', 'Hua', ''], ['Gray', 'Alexander', '']]","['online learning', 'stochastic approximation', 'mirror descent', 'parallel computing', 'large scale']"
18617,1005.0657,Jonathan Voris,Alexander Gallego and Nitesh Saxena and Jonathan Voris,"Security Through Entertainment: Experiences Using a Memory Game for
  Secure Device Pairing",This paper is 11 pages with 3 figures,,,,cs.CR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The secure ""pairing"" of wireless devices based on auxiliary or out-of-band
(OOB) communication, such as audio, visual, or tactile channels, is a
well-established research direction. However, prior work shows that this
approach to pairing can be prone to human errors of different forms that may
directly or indirectly translate into man-in-the-middle attacks. To address
this problem, we propose a general direction of the use of computer games for
pairing. Since games are a popular means of entertainment, our hypothesis is
that they may serve as an incentive to users and make the pairing process
enjoyable for them, thus improving the usability, as well as the security, of
the pairing process. We consider an emerging use case of pairing whereby two
different users are involved, each in possession of his or her own device
(e.g., Alice and Bob pairing their smartphones for social interactions). We
develop ""Alice Says,"" a pairing game based on a popular memory game called
Simon (Says), and discuss the underlying design challenges. We also present a
preliminary evaluation of Alice Says via a usability study and demonstrate its
feasibility in terms of usability and security. Our results indicate that
overall Alice Says was deemed as a fun and an enjoyable way to pair devices,
confirming our hypothesis. However, contrary to our intuition, the relatively
slower speed of Alice Says pairing was found to be a cause of concern and
prompts the need for the design of faster pairing games. We put forth several
ways in which this issue can be ameliorated. In addition, we also discuss
several other security problems which are lacking optimal solutions and suggest
ideas on how entertainment can be used to improve the current state of the art
solutions that have been developed to address them.
","[{'version': 'v1', 'created': 'Wed, 5 May 2010 01:04:26 GMT'}, {'version': 'v2', 'created': 'Thu, 6 May 2010 16:44:44 GMT'}]",2010-05-07,"[['Gallego', 'Alexander', ''], ['Saxena', 'Nitesh', ''], ['Voris', 'Jonathan', '']]","['Device Pairing', 'Entertainment', 'Games', 'Mobility', 'Security', 'Ubiquitous Computing', 'Usability']"
18618,1511.01756,Suzanne Patience Mpouli Njanga Seh,"Suzanne Mpouli (ACASA), Jean-Gabriel Ganascia (ACASA)","""Pale as death"" or ""p\^ale comme la mort"" : Frozen similes used as
  literary clich\'es","EUROPHRAS2015:COMPUTERISED AND CORPUS-BASED APPROACHES TO
  PHRASEOLOGY: MONOLINGUAL AND MULTILINGUAL PERSPECTIVES, Jun 2015, Malaga,
  Spain",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The present study is focused on the automatic identification and description
of frozen similes in British and French novels written between the 19 th
century and the beginning of the 20 th century. Two main patterns of frozen
similes were considered: adjectival ground + simile marker + nominal vehicle
(e.g. happy as a lark) and eventuality + simile marker + nominal vehicle (e.g.
sleep like a top). All potential similes and their components were first
extracted using a rule-based algorithm. Then, frozen similes were identified
based on reference lists of existing similes and semantic distance between the
tenor and the vehicle. The results obtained tend to confirm the fact that
frozen similes are not used haphazardly in literary texts. In addition,
contrary to how they are often presented, frozen similes often go beyond the
ground or the eventuality and the vehicle to also include the tenor.
","[{'version': 'v1', 'created': 'Thu, 5 Nov 2015 14:20:01 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Jun 2016 07:35:38 GMT'}]",2016-06-14,"[['Mpouli', 'Suzanne', '', 'ACASA'], ['Ganascia', 'Jean-Gabriel', '', 'ACASA']]","['frozen simile', 'simile mining', 'literary cliché', 'simile classification', 'English', 'French']"
18619,1606.07572,S Subhashree,Subhashree S and P Sreenivasa Kumar,Enriching Linked Datasets with New Object Properties,Technical report,,,,cs.DB cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although several RDF knowledge bases are available through the LOD
initiative, the ontology schema of such linked datasets is not very rich. In
particular, they lack object properties. The problem of finding new object
properties (and their instances) between any two given classes has not been
investigated in detail in the context of Linked Data. In this paper, we present
DART (Detecting Arbitrary Relations for enriching T-Boxes of Linked Data) - an
unsupervised solution to enrich the LOD cloud with new object properties
between two given classes. DART exploits contextual similarity to identify text
patterns from the web corpus that can potentially represent relations between
individuals. These text patterns are then clustered by means of paraphrase
detection to capture the object properties between the two given LOD classes.
DART also performs fully automated mapping of the discovered relations to the
properties in the linked dataset. This serves many purposes such as
identification of completely new relations, elimination of irrelevant
relations, and generation of prospective property axioms. We have empirically
evaluated our approach on several pairs of classes and found that the system
can indeed be used for enriching the linked datasets with new object properties
and their instances. We compared DART with newOntExt system which is an
offshoot of the NELL (Never-Ending Language Learning) effort. Our experiments
reveal that DART gives better results than newOntExt with respect to both the
correctness, as well as the number of relations.
","[{'version': 'v1', 'created': 'Fri, 24 Jun 2016 06:00:42 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Mar 2017 04:49:49 GMT'}, {'version': 'v3', 'created': 'Mon, 4 Sep 2017 11:12:42 GMT'}]",2017-09-05,"[['S', 'Subhashree', ''], ['Kumar', 'P Sreenivasa', '']]","['Linked Data', 'LOD enrichment', 'arbitrary relations', 'object properties', 'grounding']"
18620,1505.01728,Yamuna Prasad,"Yamuna Prasad, K. K. Biswas",Integrating K-means with Quadratic Programming Feature Selection,"17 pages, 11 figures",,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several data mining problems are characterized by data in high dimensions.
One of the popular ways to reduce the dimensionality of the data is to perform
feature selection, i.e, select a subset of relevant and non-redundant features.
Recently, Quadratic Programming Feature Selection (QPFS) has been proposed
which formulates the feature selection problem as a quadratic program. It has
been shown to outperform many of the existing feature selection methods for a
variety of applications. Though, better than many existing approaches, the
running time complexity of QPFS is cubic in the number of features, which can
be quite computationally expensive even for moderately sized datasets. In this
paper we propose a novel method for feature selection by integrating k-means
clustering with QPFS. The basic variant of our approach runs k-means to bring
down the number of features which need to be passed on to QPFS. We then enhance
this idea, wherein we gradually refine the feature space from a very coarse
clustering to a fine-grained one, by interleaving steps of QPFS with k-means
clustering. Every step of QPFS helps in identifying the clusters of irrelevant
features (which can then be thrown away), whereas every step of k-means further
refines the clusters which are potentially relevant. We show that our iterative
refinement of clusters is guaranteed to converge. We provide bounds on the
number of distance computations involved in the k-means algorithm. Further,
each QPFS run is now cubic in number of clusters, which can be much smaller
than actual number of features. Experiments on eight publicly available
datasets show that our approach gives significant computational gains (both in
time and memory), over standard QPFS as well as other state of the art feature
selection methods, even while improving the overall accuracy.
","[{'version': 'v1', 'created': 'Thu, 7 May 2015 14:45:11 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Aug 2015 18:06:36 GMT'}]",2015-08-12,"[['Prasad', 'Yamuna', ''], ['Biswas', 'K. K.', '']]","['Feature Selection', 'Support Vector Machine (SVM)', 'Quadratic Programming Feature Selection(QPFS)']"
18621,1306.1148,Dr. Nadeem Javaid,"S. Ahmed, I. U. Khan, M. B. Rasheed, M. Ilahi, R. D. Khan, S. H. Bouk,
  N.Javaid","Comparative Analysis of Routing Protocols for Under Water Wireless
  Sensor Networks",,"J. Basic. Appl. Sci. Res., 3(6)130-147, 2013",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Underwater Wireless Sensor Networks are significantly different from
terrestrial sensor networks due to peculiar characteristics of low bandwidth,
high latency, limited energy, node float mobility and high error probability.
These features bring many challenges to the network protocol design of UWSNs.
Several routing protocols have been developed in recent years for these
networks. One of the major difficulties in comparison and validation of the
performance of these proposals is the lack of a common standard to model the
acoustic propagation in the harsh underwater environment. In this paper we
analyze the evolution of certain underwater routing protocols like VBF, DBR,
H2-DAB, QELAR etc. in terms of their localization techniques, energy
minimization characteristics and holding time calculations. The design of each
protocol follows certain goals i.e. reduction of energy consumption,
improvement of communication latency, achievement of robustness and scalability
etc. This paper examines the main approaches and challenges in the design and
implementation of underwater sensor networks. The detailed descriptions of the
selected protocols contribute in understanding the direction of the current
research on routing layer in UWSN.
","[{'version': 'v1', 'created': 'Wed, 5 Jun 2013 15:27:58 GMT'}]",2013-06-06,"[['Ahmed', 'S.', ''], ['Khan', 'I. U.', ''], ['Rasheed', 'M. B.', ''], ['Ilahi', 'M.', ''], ['Khan', 'R. D.', ''], ['Bouk', 'S. H.', ''], ['Javaid', 'N.', '']]","['Underwater Wireless Sensor Networks', 'Bandwidth', 'Latency', 'Localization', 'Holding Time', 'Robustness', 'Scalability']"
18622,1708.00219,Mohammad Reza Hooshmandasl,"P. Sharifani, M.R. Hooshmandasl","Some Results on [1, k]-sets of Lexicographic Products of Graphs",,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A subset $S \subseteq V$ in a graph $G = (V,E)$ is called a $[1, k]$-set, if
for every vertex $v \in V \setminus S$, $1 \leq | N_G(v) \cap S | \leq k$. The
$[1,k]$-domination number of $G$, denoted by $\gamma_{[1, k]}(G)$ is the size
of the smallest $[1,k]$-sets of $G$. A set $S'\subseteq V(G)$ is called a total
$[1,k]$-set, if for every vertex $v \in V$, $1 \leq | N_G(v) \cap S | \leq k$.
If a graph $G$ has at least one total $[1, k]$-set then the cardinality of the
smallest such set is denoted by $\gamma_{t[1, k]}(G)$. We consider $[1,
k]$-sets that are also independent. Note that not every graph has an
independent $[1, k]$-set. For graphs having an independent $[1, k]$-set, we
define $[1, k]$-independence numbers which is denoted by $\gamma_{i[1, k]}(G)$.
In this paper, we investigate the existence of $[1,k]$-sets in lexicographic
products $G\circ H$. Furthermore, we completely characterize graphs which their
lexicographic product has at least one total $[1,k]$-set. Also, we determine
$\gamma_{[1, k]}(G\circ H)$, $\gamma_{t[1, k]}(G\circ H)$ and $\gamma_{i[1,
k]}(G\circ H)$. Finally, we show that finding smallest total $[1, k]$-set is
$NP$-complete.
","[{'version': 'v1', 'created': 'Tue, 1 Aug 2017 09:30:40 GMT'}]",2017-08-02,"[['Sharifani', 'P.', ''], ['Hooshmandasl', 'M. R.', '']]","['Domination; Total Domination; [1', 'k]-set; Total [1', 'k]-set; Independent [1', 'k]-set;Lexicographic Products']"
18623,1604.00047,Niloy J. Mitra,"Bongjin Koo, Jean Hergel, Sylvain Lefebvre, Niloy J. Mitra",Towards Zero-Waste Furniture Design,,,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In traditional design, shapes are first conceived, and then fabricated. While
this decoupling simplifies the design process, it can result in inefficient
material usage, especially where off-cut pieces are hard to reuse. The
designer, in absence of explicit feedback on material usage remains helpless to
effectively adapt the design -- even though design variabilities exist. In this
paper, we investigate {\em waste minimizing furniture design} wherein based on
the current design, the user is presented with design variations that result in
more effective usage of materials. Technically, we dynamically analyze material
space layout to determine {\em which} parts to change and {\em how}, while
maintaining original design intent specified in the form of design constraints.
We evaluate the approach on simple and complex furniture design scenarios, and
demonstrate effective material usage that is difficult, if not impossible, to
achieve without computational support.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2016 20:40:14 GMT'}]",2016-04-04,"[['Koo', 'Bongjin', ''], ['Hergel', 'Jean', ''], ['Lefebvre', 'Sylvain', ''], ['Mitra', 'Niloy J.', '']]","['computational design', 'fabrication', 'material usage', 'guided design']"
18624,1301.1825,Saied M. Abd El-atty,Saied M. Abd El-atty and Z. M. Gharsseldien,"Analytical model for mobile user connectivity in coexisting
  femtocell/macrocell networks",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we investigate the performance of mobile user connectivity in
femtocell/macrocell networks. The femto user equipment (FUE) can connect to
femto access point (FAP) with low communication range rather than higher
communication range to macro base station (MBS). Furthermore, in such emerging
networks, the spatial reuse of resources is permissible and the transmission
range can be decreased, then the probability of connectivity is high. Thereby
in this study, we propose a tractable analytical model for the connectivity
probability based on communication range and the mobility of mobile users in
femtocell/macrocell networks. Further, we study the interplays between outage
probability and spectral efficiency in such networks. Numerical results
demonstrate the effectiveness of computing the connectivity probability in
femtocell/macrocell networks.
","[{'version': 'v1', 'created': 'Wed, 9 Jan 2013 12:18:27 GMT'}]",2015-03-13,"[['El-atty', 'Saied M. Abd', ''], ['Gharsseldien', 'Z. M.', '']]","['Femtocell', 'Macrocell', 'Connectivity', 'Mobility', 'Communication range']"
18625,1504.02531,Zhimin Gao,"Zhimin Gao, Lei Wang, Luping Zhou, Jianjia Zhang",HEp-2 Cell Image Classification with Deep Convolutional Neural Networks,32 pages,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efficient Human Epithelial-2 (HEp-2) cell image classification can facilitate
the diagnosis of many autoimmune diseases. This paper presents an automatic
framework for this classification task, by utilizing the deep convolutional
neural networks (CNNs) which have recently attracted intensive attention in
visual recognition. This paper elaborates the important components of this
framework, discusses multiple key factors that impact the efficiency of
training a deep CNN, and systematically compares this framework with the
well-established image classification models in the literature. Experiments on
benchmark datasets show that i) the proposed framework can effectively
outperform existing models by properly applying data augmentation; ii) our
CNN-based framework demonstrates excellent adaptability across different
datasets, which is highly desirable for classification under varying laboratory
settings. Our system is ranked high in the cell image classification
competition hosted by ICPR 2014.
","[{'version': 'v1', 'created': 'Fri, 10 Apr 2015 01:58:17 GMT'}, {'version': 'v2', 'created': 'Mon, 18 May 2015 01:12:12 GMT'}]",2015-05-19,"[['Gao', 'Zhimin', ''], ['Wang', 'Lei', ''], ['Zhou', 'Luping', ''], ['Zhang', 'Jianjia', '']]","['Indirect immunofluorescence', 'staining patterns classification', 'deep convolutional neural networks', 'data augmentation']"
18626,1008.5391,Hesam Dashti,"Hesam T. Dashti, Alireza F. Siahpirani, Liya Wang, Mary Kloc and Amir
  H. Assadi","Parallel Evolutionary Computation in Very Large Scale Eigenvalue
  Problems","Proceedings of the 2008 International Conference on Scientific
  Computing, CSC 2008",,,,cs.DC cs.NA,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The history of research on eigenvalue problems is rich with many outstanding
contributions. Nonetheless, the rapidly increasing size of data sets requires
new algorithms for old problems in the context of extremely large matrix
dimensions. This paper reports on a new method for finding eigenvalues of very
large matrices by a synthesis of evolutionary computation, parallel
programming, and empirical stochastic search. The direct design of our method
has the added advantage that it could be adapted to extend many algorithmic
variants of solutions of generalized eigenvalue problems to improve the
accuracy of our algorithms. The preliminary evaluation results are encouraging
and demonstrate the method's efficiency and practicality.
","[{'version': 'v1', 'created': 'Tue, 31 Aug 2010 18:56:04 GMT'}, {'version': 'v2', 'created': 'Sun, 15 Dec 2013 19:24:23 GMT'}]",2013-12-17,"[['Dashti', 'Hesam T.', ''], ['Siahpirani', 'Alireza F.', ''], ['Wang', 'Liya', ''], ['Kloc', 'Mary', ''], ['Assadi', 'Amir H.', '']]","['Parallel algorithm', 'Arnoldi method', 'Simulated annealing', 'Genetic algorithm']"
18627,1606.03561,P.K. Srijith,"P. K. Srijith, Mark Hepple, Kalina Bontcheva, Daniel Preotiuc-Pietro",Sub-Story Detection in Twitter with Hierarchical Dirichlet Processes,,,,,cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social media has now become the de facto information source on real world
events. The challenge, however, due to the high volume and velocity nature of
social media streams, is in how to follow all posts pertaining to a given event
over time, a task referred to as story detection. Moreover, there are often
several different stories pertaining to a given event, which we refer to as
sub-stories and the corresponding task of their automatic detection as
sub-story detection. This paper proposes hierarchical Dirichlet processes
(HDP), a probabilistic topic model, as an effective method for automatic
sub-story detection. HDP can learn sub-topics associated with sub-stories which
enables it to handle subtle variations in sub-stories. It is compared with
state- of-the-art story detection approaches based on locality sensitive
hashing and spectral clustering. We demonstrate the superior performance of HDP
for sub-story detection on real world Twitter data sets using various
evaluation measures. The ability of HDP to learn sub-topics helps it to recall
the sub- stories with high precision. Another contribution of this paper is in
demonstrating that the conversational structures within the Twitter stream can
be used to improve sub-story detection performance significantly.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 06:52:18 GMT'}]",2016-06-14,"[['Srijith', 'P. K.', ''], ['Hepple', 'Mark', ''], ['Bontcheva', 'Kalina', ''], ['Preotiuc-Pietro', 'Daniel', '']]","['sub-story detection', 'hierarchical Dirichlet process', 'spectralclustering', 'locality sensitive hashing']"
18628,1603.05922,Erick Elejalde,Erick Elejalde and Jose Fuentes-Sep\'ulveda and Leo Ferres,"Empirical Evaluation of a Thread-Safe Dynamic Range Min-Max Tree using
  HTM","5 pages, 2 figures",,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Succinct trees, such as wavelet trees and those based on, for instance, range
Min-Max trees (RMMTs), are a family of practical data structures that store
information close to their information-theoretic space lower bound. These
structures are often static; meaning that once they are built, nodes cannot be
added, deleted or modified. This read-only property simplifies concurrency.
However, newer versions of these data structures allow for a fair degree of
dynamism. Parallel programming using Hardware Transactional Memory(HTM), has
been available in mainstream microprocessors since a few years ago. One
limitation of HTM is still on the size of each transaction. This is why HTM's
use, for the moment, is limited to operations that involve few memory addresses
that need to be updated atomically, or where the level of concurrency is low.
We provide the first available implementation of a concurrent, dynamic RMMT
based on HTM, and we compare empirically how well HTM performs compared to a
naive implementation using locks. We have shown that because of the formal
properties of RMMTs, HTM is a good fit for adding concurrency to otherwise slow
lock-based alternatives. We have also shown that HTM performs better than locks
when the number of write operations increase, making it a practical structure
to use in several write-intensive contexts. This is, as far as we know, the
only practical implementation of RMMTs thoroughly tested using HTM.
","[{'version': 'v1', 'created': 'Fri, 18 Mar 2016 16:55:16 GMT'}]",2016-03-21,"[['Elejalde', 'Erick', ''], ['Fuentes-Sepúlveda', 'Jose', ''], ['Ferres', 'Leo', '']]","['concurrent data structures', 'dynamic range min-max tree', 'hardwaretransactional memory']"
18629,1607.02951,Arnaud Casteigts,"Arnaud Casteigts, Yves M\'etivier, John Michael Robson, Akka Zemmari","Design Patterns in Beeping Algorithms: Examples, Emulation, and Analysis","Final version (accepted for publication in Information and
  Computation, Elsevier)",,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider networks of processes which interact with beeps. In the basic
model defined by Cornejo and Kuhn (2010), processes can choose in each round
either to beep or to listen. Those who beep are unable to detect simultaneous
beeps. Those who listen can only distinguish between silence and the presence
of at least one beep. We refer to this model as $BL$ (beep or listen). Stronger
models exist where the nodes can detect collision while they are beeping
($B_{cd}L$), listening ($BL_{cd}$), or both ($B_{cd}L_{cd}$). Beeping models
are weak in essence and even simple tasks are difficult or unfeasible within.
  We present a set of generic building blocks (design patterns) which seem to
occur frequently in the design of beeping algorithms. They include multi-slot
phases: the fact of dividing the main loop into a number of specialised slots;
exclusive beeps: having a single node beep at a time in a neighbourhood (within
one or two hops); adaptive probability: increasing or decreasing the
probability of beeping to produce more exclusive beeps; internal (resp.
peripheral) collision detection: for detecting collision while beeping (resp.
listening). Based on these patterns, we provide algorithms for a number of
basic problems, including colouring, 2-hop colouring, degree computation, 2-hop
MIS, and collision detection (in $BL$). The patterns make it possible to
formulate these algorithms in a rather concise and elegant way. Their analyses
are more technical; one of them improves significantly upon that of the best
known MIS algorithm by Jeavons et al. (2016). Finally, inspired by a technique
from Afek et al. (2013), our last contribution is to show that any Las Vegas
algorithm relying on collision detection can be transposed into a Monte Carlo
algorithm without collision detection at the cost of a logarithmic slowdown,
which we prove is optimal.
","[{'version': 'v1', 'created': 'Mon, 11 Jul 2016 13:56:45 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Mar 2017 09:25:08 GMT'}, {'version': 'v3', 'created': 'Wed, 20 Jun 2018 14:29:55 GMT'}, {'version': 'v4', 'created': 'Thu, 30 Aug 2018 13:02:11 GMT'}]",2018-08-31,"[['Casteigts', 'Arnaud', ''], ['Métivier', 'Yves', ''], ['Robson', 'John Michael', ''], ['Zemmari', 'Akka', '']]","['Beeping models', 'Design patterns', 'Collision detection', 'Colouring', '2-hop colouring', 'Degree computation', 'Emulation']"
18630,1106.2650,Luca Rose,"Luca Rose, Samir M. Perlaza, M\'erouane Debbah",On the Nash Equilibria in Decentralized Parallel Interference Channels,"6 pages, 4 figures, presented in ICCC Kyoto 2011",,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the 2-dimensional decentralized parallel interference channel
(IC) with 2 transmitter-receiver pairs is modelled as a non-cooperative static
game. Each transmitter is assumed to be a fully rational entity with complete
information on the game, aiming to maximize its own individual spectral
efficiency by tuning its own power allocation (PA) vector. Two scenarios are
analysed. First, we consider that transmitters can split their transmit power
between both dimensions (PA game). Second, we consider that each transmitter is
limited to use only one dimension (channel selection CS game). In the first
scenario, the game might have either one or three NE in pure strategies (PS).
However, two or infinitely many NE in PS might also be observed with zero
probability. In the second scenario, there always exists either one or two NE
in PS. We show that in both games there always exists a non-zero probability of
observing more than one NE. More interestingly, using Monte-Carlo simulations,
we show that the highest and lowest network spectral efficiency at any of the
NE in the CS game are always higher than the ones in the PA.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2011 09:38:51 GMT'}]",2011-06-15,"[['Rose', 'Luca', ''], ['Perlaza', 'Samir M.', ''], ['Debbah', 'Mérouane', '']]","['Interference Channel', 'Decentralized Network', 'NashEquilibrium', 'Braess Paradox', 'Spectrum Efficiency']"
18631,1309.7187,Alberto Lumbreras,"Alberto Lumbreras, James Lanagan, Julien Velcin, Bertrand Jouve","Analyse des r\^oles dans les communaut\'es virtuelles : d\'efinitions et
  premi\`eres exp\'erimentations sur IMDb","4e Conf\'erence sur les mod\`eles et l'analyse des r\'eseaux :
  Approches math\'ematiques et informatiques, MARAMI 2013, in French",,,,cs.SI,http://creativecommons.org/licenses/by/4.0/,"  Role analysis in online communities allows us to understand and predict users
behavior. Though several approaches have been followed, there is still lack of
generalization of their methods and their results. In this paper, we discuss
about the ground theory of roles and search for a consistent and computable
definition that allows the automatic detection of roles played by users in
forum threads on the internet. We analyze the web site IMDb to illustrate the
discussion.
","[{'version': 'v1', 'created': 'Fri, 27 Sep 2013 10:01:37 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Mar 2016 15:24:10 GMT'}]",2016-03-14,"[['Lumbreras', 'Alberto', ''], ['Lanagan', 'James', ''], ['Velcin', 'Julien', ''], ['Jouve', 'Bertrand', '']]","['role theory', 'social network and media analysis', 'pattern recognition']"
18632,1802.08362,Alaaeldin El-Nouby,"Alaaeldin El-Nouby, Graham W. Taylor",Real-Time End-to-End Action Detection with Two-Stream Networks,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two-stream networks have been very successful for solving the problem of
action detection. However, prior work using two-stream networks train both
streams separately, which prevents the network from exploiting regularities
between the two streams. Moreover, unlike the visual stream, the dominant forms
of optical flow computation typically do not maximally exploit GPU parallelism.
We present a real-time end-to-end trainable two-stream network for action
detection. First, we integrate the optical flow computation in our framework by
using Flownet2. Second, we apply early fusion for the two streams and train the
whole pipeline jointly end-to-end. Finally, for better network initialization,
we transfer from the task of action recognition to action detection by
pre-training our framework using the recently released large-scale Kinetics
dataset. Our experimental results show that training the pipeline jointly
end-to-end with fine-tuning the optical flow for the objective of action
detection improves detection performance significantly. Additionally, we
observe an improvement when initializing with parameters pre-trained using
Kinetics. Last, we show that by integrating the optical flow computation, our
framework is more efficient, running at real-time speeds (up to 31 fps).
","[{'version': 'v1', 'created': 'Fri, 23 Feb 2018 02:21:46 GMT'}]",2018-02-26,"[['El-Nouby', 'Alaaeldin', ''], ['Taylor', 'Graham W.', '']]","['Action detection', 'Two-stream networks', 'Video understanding']"
18633,1505.06713,Dmitry Namiot,"Manfred Sneps-Sneppe, Dmitry Namiot",On Web-based Domain-Specific Language for Internet of Things,submitted to ICUMT 2015,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses the challenges of the Internet of Things programming.
Sensing and data gathering from the various sources are often the key elements
of applications for Smart Cities. So, the effective programming models for them
are very important. In this article, we discuss system software models and
solutions, rather than network related aspects. In our paper, we present the
web-based domain-specific language for Internet of Things applications. Our
goal is to present the modern models for data processing in Internet of Things
and Smart Cities applications. In our view, the use of this kind of tools
should seriously reduce the time to develop new applications.
","[{'version': 'v1', 'created': 'Mon, 25 May 2015 18:48:20 GMT'}]",2015-05-26,"[['Sneps-Sneppe', 'Manfred', ''], ['Namiot', 'Dmitry', '']]","['domain-specific languages', 'micro-service', 'software standards', 'actors', 'middleware']"
18634,1512.01976,Nina Gizzie Nina Gizzie,"Nina Gizzie, Richard Mayne, Shlomo Yitzchaik, Muhamad Ikbal, Andrew
  Adamatzky","Living Wires - Effects of Size and Coating of Gold Nanoparticles in
  Altering the Electrical Properties of Physarum polycephalum and Lettuce
  Seedlings",,,,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The manipulation of biological substrates is becoming more popular route
towards generating novel computing devices. Physarum polycephalum is used as a
model organism in biocomputing because it can create `wires' for use in hybrid
circuits; programmable growth by manipulation through external stimuli and the
ability withstanding a current and its tolerance to hybridisation with a
variety of nano/microparticles. Lettuce seedlings have also had previous
interest invested in them for generating plant wires, although currently there
is little information as to their suitability for such applications. In this
study both P. polycephalum and Lettuce seedlings were hybridised with gold
nanoparticles - functionalised and unfunctionalised - to explore their uptake,
toxicological effects and, crucially, any alterations in electrical properties
they bestow upon the organisms. Using various microscopy techniques it was
shown that P. polycephalum and lettuce seedlings are able to internalize
nanoparticles and assemble them in vivo, however some toxicological effects
were observed. The electrical resistance of both lettuce seedlings and P.
polycephalum was found to decrease, the most significant reduction being with
lettuce seedlings whose resistance reduced from 3MOhms to 0.5MOhms. We conclude
that gold is a suitable nanomaterial for biohybridisation specifically in
creating conductive pathways for more efficient biological wires in
self-growing hybrid circuitry.
","[{'version': 'v1', 'created': 'Mon, 7 Dec 2015 11:00:53 GMT'}]",2015-12-08,"[['Gizzie', 'Nina', ''], ['Mayne', 'Richard', ''], ['Yitzchaik', 'Shlomo', ''], ['Ikbal', 'Muhamad', ''], ['Adamatzky', 'Andrew', '']]","['Slime mould', 'Nanotechnology', 'Biohybrid', 'UnconventionalComputing']"
18635,1710.01294,Andrei Gagarin,"Padraig Corcoran, Andrei Gagarin","Multiple domination models for placement of electric vehicle charging
  stations in road networks","20 pages, 5 figures; Original version from March-April 2017",,,,cs.DM math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Electric and hybrid vehicles play an increasing role in the road transport
networks. Despite their advantages, they have a relatively limited cruising
range in comparison to traditional diesel/petrol vehicles, and require
significant battery charging time. We propose to model the facility location
problem of the placement of charging stations in road networks as a multiple
domination problem on reachability graphs. This model takes into consideration
natural assumptions such as a threshold for remaining battery load, and
provides some minimal choice for a travel direction to recharge the battery.
Experimental evaluation and simulations for the proposed facility location
model are presented in the case of real road networks corresponding to the
cities of Boston and Dublin.
","[{'version': 'v1', 'created': 'Tue, 3 Oct 2017 17:51:44 GMT'}]",2017-10-04,"[['Corcoran', 'Padraig', ''], ['Gagarin', 'Andrei', '']]","['Road networks', 'Electric vehicles', 'Facility location problem', 'k-Domination', 'α-Domination', 'Heuristic optimization']"
18636,0707.0724,Damien Chablat,"Daniel Kanaan (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat
  (IRCCyN)",Workspace Analysis of the Parallel Module of the VERNE Machine,,"Problems of Mechanics 25, 4 (01/12/2006) 26-42",,,cs.RO physics.class-ph,,"  The paper addresses geometric aspects of a spatial three-degree-of-freedom
parallel module, which is the parallel module of a hybrid serial-parallel
5-axis machine tool. This parallel module consists of a moving platform that is
connected to a fixed base by three non-identical legs. Each leg is made up of
one prismatic and two pairs of spherical joint, which are connected in a way
that the combined effects of the three legs lead to an over-constrained
mechanism with complex motion. This motion is defined as a simultaneous
combination of rotation and translation. A method for computing the complete
workspace of the VERNE parallel module for various tool lengths is presented.
An algorithm describing this method is also introduced.
","[{'version': 'v1', 'created': 'Thu, 5 Jul 2007 06:43:49 GMT'}]",2007-07-06,"[['Kanaan', 'Daniel', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN'], ['Chablat', 'Damien', '', 'IRCCyN']]","['Parallel manipulators', 'parallel kinematic machines', 'workspace', 'hybrid machine tools', 'complex motion', 'mobility analysis', 'inverse kinematics', 'singularity']"
18637,0910.0651,Benjamin Recht,Benjamin Recht,A Simpler Approach to Matrix Completion,13 pages. Fixed typos. Added references,,,,cs.IT cs.NA math.IT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper provides the best bounds to date on the number of randomly sampled
entries required to reconstruct an unknown low rank matrix. These results
improve on prior work by Candes and Recht, Candes and Tao, and Keshavan,
Montanari, and Oh. The reconstruction is accomplished by minimizing the nuclear
norm, or sum of the singular values, of the hidden matrix subject to agreement
with the provided entries. If the underlying matrix satisfies a certain
incoherence condition, then the number of entries required is equal to a
quadratic logarithmic factor times the number of parameters in the singular
value decomposition. The proof of this assertion is short, self contained, and
uses very elementary analysis. The novel techniques herein are based on recent
work in quantum information theory.
","[{'version': 'v1', 'created': 'Mon, 5 Oct 2009 17:48:42 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Oct 2009 16:23:52 GMT'}]",2009-10-21,"[['Recht', 'Benjamin', '']]","['Matrix completion', 'low-rank matrices', 'convex optimization', 'nuclear norm minimization', 'randommatrices', 'operator Chernoff bound', 'compressed sensing']"
18638,1708.01295,Nilesh Chakraborty,"Nilesh Chakraborty, Shreya Singh, Samrat Mondal","On Designing A Questionnaire Based Legacy-UI Honeyword Generation
  Approach For Achieving Flatness",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern trend sees a lot usage of \textit{honeywords} (or fake password) for
protecting the original passwords in the password file. However, the usage of
\textit{honeywords} has strongly been criticized under the different security
and usability parameters. Though many of these issues have been successfully
resolved, research in this domain is still facing difficulties in
\textit{achieving flatness} (or producing the equally probable
\textit{honeywords} with reference to the original password). Though recent
studies have made a significant effort to meet this criterion, we show that
they either fall short or are based on some unrealistic assumptions. To
practically fulfill this flatness criterion, we propose a
questionnaire-oriented authentication system based on the episodic (or long
term) memory of the users. Our study reveals that proposed mechanism is capable
of generating significantly improved flatter list of \textit{honeywords}
compared to the existing protocols. The subsequent discussion shows that the
proposed system also overcomes all the limitations of the existing state of
arts with no lesser than $95\%$ goodness.
","[{'version': 'v1', 'created': 'Thu, 3 Aug 2017 20:23:14 GMT'}]",2017-08-07,"[['Chakraborty', 'Nilesh', ''], ['Singh', 'Shreya', ''], ['Mondal', 'Samrat', '']]","['Questionnaire based authentication', 'Episodic memory', 'Password', 'Legacy-UI', 'Honeyword']"
18639,1306.2815,Casper Kejlberg-Rasmussen,"Casper Kejlberg-Rasmussen and Yufei Tao and Konstantinos Tsakalidis
  and Kostas Tsichlas and Jeonghun Yoon",I/O-Efficient Planar Range Skyline and Attrition Priority Queues,"Appeared at PODS 2013, New York, 19 pages, 10 figures. arXiv admin
  note: text overlap with arXiv:1208.4511, arXiv:1207.2341",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the planar range skyline reporting problem, we store a set P of n 2D
points in a structure such that, given a query rectangle Q = [a_1, a_2] x [b_1,
b_2], the maxima (a.k.a. skyline) of P \cap Q can be reported efficiently. The
query is 3-sided if an edge of Q is grounded, giving rise to two variants:
top-open (b_2 = \infty) and left-open (a_1 = -\infty) queries.
  All our results are in external memory under the O(n/B) space budget, for
both the static and dynamic settings:
  * For static P, we give structures that answer top-open queries in O(log_B n
+ k/B), O(loglog_B U + k/B), and O(1 + k/B) I/Os when the universe is R^2, a U
x U grid, and a rank space grid [O(n)]^2, respectively (where k is the number
of reported points). The query complexity is optimal in all cases.
  * We show that the left-open case is harder, such that any linear-size
structure must incur \Omega((n/B)^e + k/B) I/Os for a query. We show that this
case is as difficult as the general 4-sided queries, for which we give a static
structure with the optimal query cost O((n/B)^e + k/B).
  * We give a dynamic structure that supports top-open queries in O(log_2B^e
(n/B) + k/B^1-e) I/Os, and updates in O(log_2B^e (n/B)) I/Os, for any e
satisfying 0 \le e \le 1. This leads to a dynamic structure for 4-sided queries
with optimal query cost O((n/B)^e + k/B), and amortized update cost O(log
(n/B)).
  As a contribution of independent interest, we propose an I/O-efficient
version of the fundamental structure priority queue with attrition (PQA). Our
PQA supports FindMin, DeleteMin, and InsertAndAttrite all in O(1) worst case
I/Os, and O(1/B) amortized I/Os per operation.
  We also add the new CatenateAndAttrite operation that catenates two PQAs in
O(1) worst case and O(1/B) amortized I/Os. This operation is a non-trivial
extension to the classic PQA of Sundar, even in internal memory.
","[{'version': 'v1', 'created': 'Wed, 12 Jun 2013 13:05:49 GMT'}]",2013-06-13,"[['Kejlberg-Rasmussen', 'Casper', ''], ['Tao', 'Yufei', ''], ['Tsakalidis', 'Konstantinos', ''], ['Tsichlas', 'Kostas', ''], ['Yoon', 'Jeonghun', '']]","['Skyline', 'range reporting', 'priority queues', 'external memory', 'data structures']"
18640,1108.5466,Nabendu Chaki Dr.,Supriya Chakrabarty and Nabendu Chaki,"Quality Evaluation of Conceptual Level Object Multidimensional Data
  Model","14 pages - accepted in June 2011 for publication in the International
  Journal of Computer Science & Information Technology (ISSN: 0975-3826)",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The advancement of technology facilitates explosive growth of mobile usage in
the last decade. Numerous applications have been developed to support its
usage. However, gap in technology exists in obtaining correct and trusted
values for evaluation indexes of the precise amount of usage. The claims of
loss in revenue by the service providers could be more due to unexpected
behaviour of the hardware. A similar mistrust is often observed in the users of
the services. A trustworthy subscription scheme is in demand for consumers
whereas revenue needs to be assured of the service providers. Multiple
Authorizations by Multiple Owners (MAMO) has already been introduced as a
technology to build trust in the third party billing system. In this paper,
MAMO is extended to ensure trustworthiness of the parameters for subscription.
Along with call transaction data are reconciled to assure the proper revenue
generation.
","[{'version': 'v1', 'created': 'Sat, 27 Aug 2011 17:37:50 GMT'}]",2011-08-30,"[['Chakrabarty', 'Supriya', ''], ['Chaki', 'Nabendu', '']]","['Trusted Billing Amount', 'Synchronized Billing scheme', 'Revenue assurance', 'Customer Trust']"
18641,1603.00438,Team Lear,"Mattis Paulin (LEAR), Julien Mairal (LEAR), Matthijs Douze (LEAR),
  Zaid Harchaoui (NYU), Florent Perronnin, Cordelia Schmid (LEAR)","Convolutional Patch Representations for Image Retrieval: an Unsupervised
  Approach",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convolutional neural networks (CNNs) have recently received a lot of
attention due to their ability to model local stationary structures in natural
images in a multi-scale fashion, when learning all model parameters with
supervision. While excellent performance was achieved for image classification
when large amounts of labeled visual data are available, their success for
un-supervised tasks such as image retrieval has been moderate so far. Our paper
focuses on this latter setting and explores several methods for learning patch
descriptors without supervision with application to matching and instance-level
retrieval. To that effect, we propose a new family of convolutional descriptors
for patch representation , based on the recently introduced convolutional
kernel networks. We show that our descriptor, named Patch-CKN, performs better
than SIFT as well as other convolutional networks learned by artificially
introducing supervision and is significantly faster to train. To demonstrate
its effectiveness, we perform an extensive evaluation on standard benchmarks
for patch and image retrieval where we obtain state-of-the-art results. We also
introduce a new dataset called RomePatches, which allows to simultaneously
study descriptor performance for patch and image retrieval.
","[{'version': 'v1', 'created': 'Tue, 1 Mar 2016 20:13:07 GMT'}]",2016-03-02,"[['Paulin', 'Mattis', '', 'LEAR'], ['Mairal', 'Julien', '', 'LEAR'], ['Douze', 'Matthijs', '', 'LEAR'], ['Harchaoui', 'Zaid', '', 'NYU'], ['Perronnin', 'Florent', '', 'LEAR'], ['Schmid', 'Cordelia', '', 'LEAR']]","['Low-level image description', 'Instance-levelretrieval', 'Convolutional Neural Networks']"
18642,1410.4956,David Insa,David Insa and Josep Silva,Transforming while/do/for/foreach-Loops into Recursive Methods,"16 pages, 8 figures, 6 algorithms, 2 tables",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In software engineering, taking a good election between recursion and
iteration is essential because their efficiency and maintenance are different.
In fact, developers often need to transform iteration into recursion (e.g., in
debugging, to decompose the call graph into iterations); thus, it is quite
surprising that there does not exist a public transformation from loops to
recursion that handles all kinds of loops. This article describes a
transformation able to transform iterative loops into equivalent recursive
methods. The transformation is described for the programming language Java, but
it is general enough as to be adapted to many other languages that allow
iteration and recursion. We describe the changes needed to transform loops of
types while/do/for/foreach into recursion. Each kind of loop requires a
particular treatment that is described and exemplified.
","[{'version': 'v1', 'created': 'Sat, 18 Oct 2014 13:43:53 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Oct 2014 09:37:14 GMT'}]",2014-10-22,"[['Insa', 'David', ''], ['Silva', 'Josep', '']]","['Program transformation', 'Iteration', 'Recursion']"
18643,1407.2044,Mohamed Hedi Dridi,Mohamed H. Dridi,"Tracking Individual Targets in High Density Crowd Scenes Analysis of a
  Video Recording in Hajj 2009","20 pages, 17 figures, correction of some references",,,,cs.CV physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a number of methods (manual, semi-automatic and
automatic) for tracking individual targets in high density crowd scenes where
thousand of people are gathered. The necessary data about the motion of
individuals and a lot of other physical information can be extracted from
consecutive image sequences in different ways, including optical flow and block
motion estimation. One of the famous methods for tracking moving objects is the
block matching method. This way to estimate subject motion requires the
specification of a comparison window which determines the scale of the
estimate. In this work we present a real-time method for pedestrian recognition
and tracking in sequences of high resolution images obtained by a stationary
(high definition) camera located in different places on the Haram mosque in
Mecca. The objective is to estimate pedestrian velocities as a function of the
local density.The resulting data of tracking moving pedestrians based on video
sequences are presented in the following section. Through the evaluated system
the spatio-temporal coordinates of each pedestrian during the Tawaf ritual are
established. The pilgrim velocities as function of the local densities in the
Mataf area (Haram Mosque Mecca) are illustrated and very precisely documented.
","[{'version': 'v1', 'created': 'Tue, 8 Jul 2014 11:41:27 GMT'}, {'version': 'v2', 'created': 'Thu, 7 Aug 2014 14:53:06 GMT'}]",2014-08-08,"[['Dridi', 'Mohamed H.', '']]","['Pedestrian dynamics', 'Crowd management', 'Crowd control', 'Objects tracking']"
18644,1506.02312,Renato Pereira,Renato de Pontes Pereira and Paulo Martins Engel,A Framework for Constrained and Adaptive Behavior-Based Agents,2015; 15 pages,,,,cs.AI cs.LG cs.RO cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Behavior Trees are commonly used to model agents for robotics and games,
where constrained behaviors must be designed by human experts in order to
guarantee that these agents will execute a specific chain of actions given a
specific set of perceptions. In such application areas, learning is a desirable
feature to provide agents with the ability to adapt and improve interactions
with humans and environment, but often discarded due to its unreliability. In
this paper, we propose a framework that uses Reinforcement Learning nodes as
part of Behavior Trees to address the problem of adding learning capabilities
in constrained agents. We show how this framework relates to Options in
Hierarchical Reinforcement Learning, ensuring convergence of nested learning
nodes, and we empirically show that the learning nodes do not affect the
execution of other nodes in the tree.
","[{'version': 'v1', 'created': 'Sun, 7 Jun 2015 20:52:31 GMT'}]",2015-06-09,"[['Pereira', 'Renato de Pontes', ''], ['Engel', 'Paulo Martins', '']]","['Behavior Trees', 'Reinforcement Learning', 'Hierarchical Reinforcement Learning', 'Agent Modeling', 'Robotics', 'Games']"
18645,1406.6614,Emmanuel Baccelli,"Hauke Petersen, Emmanuel Baccelli, Matthias W\""ahlisch, Thomas C.
  Schmidt, Jochen Schiller",The Role of the Internet of Things in Network Resilience,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Disasters lead to devastating structural damage not only to buildings and
transport infrastructure, but also to other critical infrastructure, such as
the power grid and communication backbones. Following such an event, the
availability of minimal communication services is however crucial to allow
efficient and coordinated disaster response, to enable timely public
information, or to provide individuals in need with a default mechanism to post
emergency messages. The Internet of Things consists in the massive deployment
of heterogeneous devices, most of which battery-powered, and interconnected via
wireless network interfaces. Typical IoT communication architectures enables
such IoT devices to not only connect to the communication backbone (i.e. the
Internet) using an infrastructure-based wireless network paradigm, but also to
communicate with one another autonomously, without the help of any
infrastructure, using a spontaneous wireless network paradigm. In this paper,
we argue that the vast deployment of IoT-enabled devices could bring benefits
in terms of data network resilience in face of disaster. Leveraging their
spontaneous wireless networking capabilities, IoT devices could enable minimal
communication services (e.g. emergency micro-message delivery) while the
conventional communication infrastructure is out of service. We identify the
main challenges that must be addressed in order to realize this potential in
practice. These challenges concern various technical aspects, including
physical connectivity requirements, network protocol stack enhancements, data
traffic prioritization schemes, as well as social and political aspects.
","[{'version': 'v1', 'created': 'Wed, 25 Jun 2014 15:32:49 GMT'}]",2014-06-26,"[['Petersen', 'Hauke', ''], ['Baccelli', 'Emmanuel', ''], ['Wählisch', 'Matthias', ''], ['Schmidt', 'Thomas C.', ''], ['Schiller', 'Jochen', '']]","['Disaster resilience', 'IoT', 'spontaneous wireless networking', 'minimal communication']"
18646,1802.06669,Jocelyn Thiebaut,"St\'ephane Bessy, Marin Bougeret and Jocelyn Thiebaut","(Arc-disjoint) cycle packing in tournament: classical and parameterized
  complexity","17 pages, 2 figures",,,,cs.DM math.CO,http://creativecommons.org/licenses/by/4.0/,"  Given a tournament $T$, the problem MaxCT consists of finding a maximum
(arc-disjoint) cycle packing of $T$. In the same way, MaxTT corresponds to the
specific case where the collection of cycles are triangles (i.e. directed
3-cycles). Although MaxCT can be seen as the LP dual of minimum feedback arc
set in tournaments which have been widely studied, surprisingly no algorithmic
results seem to exist concerning the former.
  In this paper, we prove the NP-hardness of both MaxCT and MaxTT. We also show
that deciding if a tournament has a cycle packing and a feedback arc set with
the same size is an NP-complete problem. In light of this, we show that MaxTT
admits a vertex linear-kernel when parameterized with the size of the solution.
Finally, we provide polynomial algorithms for MaxTT and MaxCT when the
tournament is sparse, that is when it admits a FAS which is a matching.
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 15:32:05 GMT'}]",2018-02-20,"[['Bessy', 'Stéphane', ''], ['Bougeret', 'Marin', ''], ['Thiebaut', 'Jocelyn', '']]","['Tournament', 'arc-disjoint triangle packing', 'arc-disjoint cycle packing', 'NP-hardness', 'parameterized complexity']"
18647,1603.04506,Alexander Gammerman,"Paolo Toccacheli, Ilia Nouretdinov and Alexander Gammerman",Conformal Predictors for Compound Activity Prediction,"17 pages, 5 figures",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents an application of Conformal Predictors to a
chemoinformatics problem of identifying activities of chemical compounds. The
paper addresses some specific challenges of this domain: a large number of
compounds (training examples), high-dimensionality of feature space, sparseness
and a strong class imbalance. A variant of conformal predictors called
Inductive Mondrian Conformal Predictor is applied to deal with these
challenges. Results are presented for several non-conformity measures (NCM)
extracted from underlying algorithms and different kernels. A number of
performance measures are used in order to demonstrate the flexibility of
Inductive Mondrian Conformal Predictors in dealing with such a complex set of
data.
  Keywords: Conformal Prediction, Confidence Estimation, Chemoinformatics,
Non-Conformity Measure.
","[{'version': 'v1', 'created': 'Mon, 14 Mar 2016 23:37:37 GMT'}]",2016-03-16,"[['Toccacheli', 'Paolo', ''], ['Nouretdinov', 'Ilia', ''], ['Gammerman', 'Alexander', '']]","['Conformal Prediction', 'Confidence Estimation', 'Chemoinformatics', 'Non-Conformity Measure']"
18648,1607.01482,Paolo Frasca,Francesca Ceragioli and Paolo Frasca,"Consensus and disagreement: the role of quantized behaviours in opinion
  dynamics","Submitted for journal publication; preliminary incomplete version
  available in the Proceedings of the European Control Conference 2015",,,,cs.SY cs.SI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with continuous-time opinion dynamics that feature the
interplay of continuous opinions and discrete behaviours. In our model, the
opinion of one individual is only influenced by the behaviours of fellow
individuals. The key technical difficulty in the study of these dynamics is
that the right-hand sides of the equations are discontinuous and thus their
solutions must be intended in some generalized sense: in our analysis, we
consider both Carath\'eodory and Krasowskii solutions. We first prove existence
and completeness of Carath\'eodory solutions from every initial condition and
we highlight a pathological behaviour of Carath\'eodory solutions, which can
converge to points that are not (Carath\'eodory) equilibria. Notably, such
points can be arbitrarily far from consensus and indeed simulations show that
convergence to non-consensus configurations is very common. In order to cope
with these pathological attractors, we then study Krasowskii solutions. We give
an estimate of the asymptotic distance of all Krasowskii solutions from
consensus and we prove its tightness via an example: this estimate is quadratic
in the number of agents, implying that quantization can drastically destroy
consensus. However, we are able to prove convergence to consensus in some
special cases, namely when the communication among the individuals is described
by either a complete or a complete bipartite graph.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2016 06:04:14 GMT'}]",2016-07-07,"[['Ceragioli', 'Francesca', ''], ['Frasca', 'Paolo', '']]","['Opinion dynamics', 'quantized consensus', 'disagreement', 'discontinuous differential equations']"
18649,1206.1903,Wenyuan Tang,Wenyuan Tang and Rahul Jain,"Mechanism Designs for Stochastic Resources for Renewable Energy
  Integration",,,,,cs.GT cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Among the many challenges of integrating renewable energy sources into the
existing power grid, is the challenge of integrating renewable energy
generators into the power systems economy. Electricity markets currently are
run in a way that participating generators must supply contracted amounts. And
yet, renewable energy generators such as wind power generators cannot supply
contracted amounts with certainty. Thus, alternative market architectures must
be considered where there are aggregator entities who participate in the
electricity market by buying power from the renewable energy generators, and
assuming risk of any shortfall from contracted amounts. In this paper, we
propose auction mechanisms that can be used by the aggregators for procuring
stochastic resources, such as wind power. The nature of stochastic resources is
different from classical resources in that such a resource is only available
stochastically. The distribution of the generation is private information, and
the system objective is to truthfully elicit such information. We introduce a
variant of the VCG mechanism for this problem. We also propose a non-VCG
mechanism with a contracted-payment-plus-penalty payoff structure. We
generalize the basic mechanisms in various ways. We then consider the setting
where there are two classes of players to demonstrate the difficulty of auction
design in such scenarios. We also consider an alternative architecture where
the generators need to fulfill any shortfall from the contracted amount by
buying from the spot market.
","[{'version': 'v1', 'created': 'Sat, 9 Jun 2012 02:57:49 GMT'}]",2012-06-12,"[['Tang', 'Wenyuan', ''], ['Jain', 'Rahul', '']]","['Renewable energy integration', 'smart grid', 'mechanism design', 'stochastic resource auction']"
18650,1306.5391,Anna Harutyunyan,Glencora Borradaile and Anna Harutyunyan,Boundary-to-boundary flows in planar graphs,"In Proc. IWOCA, 2013",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give an iterative algorithm for finding the maximum flow between a set of
sources and sinks that lie on the boundary of a planar graph. Our algorithm
uses only O(n) queries to simple data structures, achieving an O(n log n)
running time that we expect to be practical given the use of simple primitives.
The only existing algorithm for this problem uses divide and conquer and, in
order to achieve an O(n log n) running time, requires the use of the
(complicated) linear-time shortest-paths algorithm for planar graphs.
","[{'version': 'v1', 'created': 'Sun, 23 Jun 2013 09:45:51 GMT'}]",2013-06-25,"[['Borradaile', 'Glencora', ''], ['Harutyunyan', 'Anna', '']]","['maximum flow', 'multiple terminal', 'planar graphs']"
18651,1701.06462,Eu Koon Cheang,"Eu Koon Cheang, Teik Koon Cheang, Yong Haur Tay","Using Convolutional Neural Networks to Count Palm Trees in Satellite
  Images",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose a supervised learning system for counting and
localizing palm trees in high-resolution, panchromatic satellite imagery
(40cm/pixel to 1.5m/pixel). A convolutional neural network classifier trained
on a set of palm and no-palm images is applied across a satellite image scene
in a sliding window fashion. The resultant confidence map is smoothed with a
uniform filter. A non-maximal suppression is applied onto the smoothed
confidence map to obtain peaks. Trained with a small dataset of 500 images of
size 40x40 cropped from satellite images, the system manages to achieve a tree
count accuracy of over 99%.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2017 15:38:52 GMT'}]",2017-01-24,"[['Cheang', 'Eu Koon', ''], ['Cheang', 'Teik Koon', ''], ['Tay', 'Yong Haur', '']]","['Palm tree detection', 'satellite image', 'ConvNet', 'image processing']"
18652,1610.04711,Mithilesh Kumar,"Mithilesh Kumar, Daniel Lokshtanov",A $2\ell k$ Kernel for $\ell$-Component Order Connectivity,"14 pages, 1 figure, accepted in IPEC 2016",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the $\ell$-Component Order Connectivity problem ($\ell \in \mathbb{N}$),
we are given a graph $G$ on $n$ vertices, $m$ edges and a non-negative integer
$k$ and asks whether there exists a set of vertices $S\subseteq V(G)$ such that
$|S|\leq k$ and the size of the largest connected component in $G-S$ is at most
$\ell$. In this paper, we give a kernel for $\ell$-Component Order Connectivity
with at most $2\ell k$ vertices that takes $n^{\mathcal{O}(\ell)}$ time for
every constant $\ell$. On the way to obtaining our kernel, we prove a
generalization of the $q$-Expansion Lemma to weighted graphs. This
generalization may be of independent interest.
","[{'version': 'v1', 'created': 'Sat, 15 Oct 2016 10:17:35 GMT'}]",2016-10-18,"[['Kumar', 'Mithilesh', ''], ['Lokshtanov', 'Daniel', '']]","['Parameterized algorithms', 'Kernel', 'Component Order Connectivity', 'Maxmin allocation', 'Weighted expansion']"
18653,1606.03548,Moshiur Bhuiyan,"Anna Marie Fortuito, Farzana Haque, Luba Shabnam, Moshiur Bhuiyan,
  Aneesh Krishna and Chandana Withana",Enhancing Public Service Delivery through Organisational Modeling,"Research-in-progress ISBN# 978-0-646-95337-3 Presented at the
  Australasian Conference on Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/235,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Government organisations utilise a Citizen's Charter in order to furnish the
public with comprehensive details of their service offerings that defines how
their overall organisational goals are achieved. Studies on the implementation
of Citizen's Charter in developing countries indicated that important social
factors were not considered. Reviewed literatures indicated that social factors
could accelerate service delivery with the use of goal-oriented modelling (such
as i* organisational modeling) as it represent conditions expected from social
actors and their social dependencies. By modelling role dependencies among
actors carrying out services in a business unit and applying vulnerability and
criticality metrics, problem service areas were identified using the Citizen's
Charter as a source of these methodologies. Improvements in these problem
service areas were based on vulnerability and criticality levels of their
corresponding actors. Recommendations to address these service areas include
monitoring of key performance indicators of actors and task delegation when
necessary.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 04:02:29 GMT'}]",2016-06-14,"[['Fortuito', 'Anna Marie', ''], ['Haque', 'Farzana', ''], ['Shabnam', 'Luba', ''], ['Bhuiyan', 'Moshiur', ''], ['Krishna', 'Aneesh', ''], ['Withana', 'Chandana', '']]","['Organisational Modelling', 'Citizen’s Charter', 'i* Framework', 'Vulnerability', 'Criticality']"
18654,1108.4607,Tianrong Lin,Tianrong Lin,"Simple characterizations for commutativity of quantum weakest
  preconditions","Re-written, comments are welcome",,,,cs.LO quant-ph,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In a recent letter [Information Processing Letters~104 (2007) 152-158], it
has shown some sufficient conditions for commutativity of quantum weakest
preconditions. This paper provides some alternative and simple
characterizations for the commutativity of quantum weakest preconditions, i.e.,
Theorem 3.1, Theorem 3.2 and Proposition 3.3 in what follows. We also show that
to characterize the commutativity of quantum weakest preconditions in terms of
$[M,N]$ ($=MN-NM$) is hard in the sense of Proposition 4.1 and Proposition 4.2.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2011 14:11:30 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Aug 2011 13:04:23 GMT'}, {'version': 'v3', 'created': 'Thu, 25 Aug 2011 05:47:34 GMT'}, {'version': 'v4', 'created': 'Sat, 10 Dec 2011 06:46:21 GMT'}, {'version': 'v5', 'created': 'Mon, 3 Sep 2012 14:32:05 GMT'}, {'version': 'v6', 'created': 'Fri, 14 Sep 2012 12:27:44 GMT'}, {'version': 'v7', 'created': 'Sat, 6 Oct 2012 17:00:42 GMT'}, {'version': 'v8', 'created': 'Mon, 2 Dec 2013 08:23:11 GMT'}, {'version': 'v9', 'created': 'Mon, 23 Mar 2015 15:33:18 GMT'}]",2015-03-24,"[['Lin', 'Tianrong', '']]","['Quantum program', 'Quantum weakest precondition', 'Commutativity']"
18655,1602.08571,Haoxi Zhang,"Haoxi Zhang, Cesar Sanin, Edward Szczerbicki",Towards Neural Knowledge DNA,"8 pages, 3 figures",,,,cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose the Neural Knowledge DNA, a framework that tailors
the ideas underlying the success of neural networks to the scope of knowledge
representation. Knowledge representation is a fundamental field that dedicate
to representing information about the world in a form that computer systems can
utilize to solve complex tasks. The proposed Neural Knowledge DNA is designed
to support discovering, storing, reusing, improving, and sharing knowledge
among machines and organisation. It is constructed in a similar fashion of how
DNA formed: built up by four essential elements. As the DNA produces
phenotypes, the Neural Knowledge DNA carries information and knowledge via its
four essential elements, namely, Networks, Experiences, States, and Actions.
","[{'version': 'v1', 'created': 'Sat, 27 Feb 2016 08:45:35 GMT'}]",2016-03-01,"[['Zhang', 'Haoxi', ''], ['Sanin', 'Cesar', ''], ['Szczerbicki', 'Edward', '']]","['Neural Knowledge DNA', 'Neural Networks', 'Knowledge']"
18656,1301.0176,Doreswamy,"Doreswamy, M.N.Vanajakshi",Similarity Measuring Approuch for Engineering Materials Selection,"International Journal of Computational Intelligence Systems (IJCIS),
  Vol.3, Issue 1, April 2010, pp.115-122. (ISSN: 1875-6883)",,,,cs.AI cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advanced engineering materials design involves the exploration of massive
multidimensional feature spaces, the correlation of materials properties and
the processing parameters derived from disparate sources. The search for
alternative materials or processing property strategies, whether through
analytical, experimental or simulation approaches, has been a slow and arduous
task, punctuated by infrequent and often expected discoveries. A few systematic
efforts have been made to analyze the trends in data as a basis for
classifications and predictions. This is particularly due to the lack of large
amounts of organized data and more importantly the challenging of shifting
through them in a timely and efficient manner. The application of recent
advances in Data Mining on materials informatics is the state of art of
computational and experimental approaches for materials discovery. In this
paper similarity based engineering materials selection model is proposed and
implemented to select engineering materials based on the composite materials
constraints. The result reviewed from this model is sustainable for effective
decision making in advanced engineering materials design applications.
","[{'version': 'v1', 'created': 'Wed, 2 Jan 2013 07:07:20 GMT'}]",2013-01-03,"[['Doreswamy', '', ''], ['Vanajakshi', 'M. N.', '']]","['Data Mining and Knowledge Discovery', 'Composite Materials Selection', 'Similarity Measure']"
18657,1203.1548,Yuantao Gu,"Yang You, Laming Chen, Yuantao Gu, Wei Feng, Hui Dai","Retrieval of Sparse Solutions of Multiple-Measurement Vectors via
  Zero-point Attracting Projection","9 pages, 4 figures","Signal Processing, 92(12): 3075-3079, 2012",,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new sparse signal recovery algorithm for multiple-measurement vectors (MMV)
problem is proposed in this paper. The sparse representation is iteratively
drawn based on the idea of zero-point attracting projection (ZAP). In each
iteration, the solution is first updated along the negative gradient direction
of an approximate $\ell_{2,0}$ norm to encourage sparsity, and then projected
to the solution space to satisfy the under-determined equation. A variable step
size scheme is adopted further to accelerate the convergence as well as to
improve the recovery accuracy. Numerical simulations demonstrate that the
performance of the proposed algorithm exceeds the references in various
aspects, as well as when applied to the Modulated Wideband Converter, where
recovering MMV problem is crucial to its performance.
","[{'version': 'v1', 'created': 'Wed, 7 Mar 2012 17:31:27 GMT'}, {'version': 'v2', 'created': 'Sat, 9 Mar 2013 19:33:28 GMT'}]",2015-03-20,"[['You', 'Yang', ''], ['Chen', 'Laming', ''], ['Gu', 'Yuantao', ''], ['Feng', 'Wei', ''], ['Dai', 'Hui', '']]","['compressed sensing', 'sparse recovery', 'multiple-measurement vectors', 'zero-point attracting projection', 'the Modulated Wideband Converter']"
18658,0805.0785,Michael Hilker,Michael Hilker and Christoph Schommer,AGNOSCO - Identification of Infected Nodes with artificial Ant Colonies,"5 pages, 2 figures","Proceedings of the 6th International Conference on Recent Advances
  in Soft Computing (RASC2006), July 2006, Canterbury, United Kingdom",,,cs.AI cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  If a computer node is infected by a virus, worm or a backdoor, then this is a
security risk for the complete network structure where the node is associated.
Existing Network Intrusion Detection Systems (NIDS) provide a certain amount of
support for the identification of such infected nodes but suffer from the need
of plenty of communication and computational power. In this article, we present
a novel approach called AGNOSCO to support the identification of infected nodes
through the usage of artificial ant colonies. It is shown that AGNOSCO
overcomes the communication and computational power problem while identifying
infected nodes properly.
","[{'version': 'v1', 'created': 'Tue, 6 May 2008 19:47:11 GMT'}, {'version': 'v2', 'created': 'Wed, 7 May 2008 15:33:35 GMT'}]",2008-05-07,"[['Hilker', 'Michael', ''], ['Schommer', 'Christoph', '']]","['Network Protection', 'Intrusion Detection', 'Bio-inspired Computing', 'Ant Colonies']"
18659,1410.0534,Fredrick Ishengoma,Fredrick Romanus Ishengoma,"Authentication System for Smart Homes Based on ARM7TDMI-S and
  IRIS-Fingerprint Recognition Technologies",,"CiiT International Journal of Programmable Device Circuits and
  Systems, Volume 6, Issue 6, August 2014",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rapid advancement in technology, smart homes have become applicable
and so the need arise to solve the security challenges that are accompanied
with its operation. Passwords and identity cards have been used as traditional
authentication mechanisms in home environments, however, the rise of misuse of
these mechanisms are proving them to be less reliable. For instance, ID cards
can be misplaced, copied or counterfeited and being misused. Conversely,
studies have shown that biometrics authentication systems particularly Iris
Recognition Technology (IRT) and Fingerprint Recognition Technology (FRT) have
the most reliable mechanisms to date providing tremendous accuracy and speed.
As the technology becomes less expensive, application of IRT& FRT in
smart-homes becomes more reliable and appropriate solution for security
challenges. In this paper, we present our approach to design an authentication
system for smart homes based on IRT, FRT and ARM7TDMI.The system employs two
biometrics mechanisms for high reliability whereby initially, system users must
enroll their fingerprints and eyes into the camera. Iris and fingerprint
biometrics are scanned and the images are stored in the database. In the stage
of authentication, FRT and IRT fingerprint scan and analyze points of the
user's current input iris and fingerprint and match with the database contents.
If one or more captured images do not match with the one in the database, then
the system will not give authorization.
","[{'version': 'v1', 'created': 'Thu, 2 Oct 2014 12:53:05 GMT'}]",2014-10-03,"[['Ishengoma', 'Fredrick Romanus', '']]","['ARM7TDMI-S', 'Authentication', 'Fingerprint']"
18660,1109.1057,Risheng Liu,"Risheng Liu and Zhouchen Lin and Wei Zhang and Kewei Tang and Zhixun
  Su","Toward Designing Intelligent PDEs for Computer Vision: An Optimal
  Control Approach",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many computer vision and image processing problems can be posed as solving
partial differential equations (PDEs). However, designing PDE system usually
requires high mathematical skills and good insight into the problems. In this
paper, we consider designing PDEs for various problems arising in computer
vision and image processing in a lazy manner: \emph{learning PDEs from real
data via data-based optimal control}. We first propose a general intelligent
PDE system which holds the basic translational and rotational invariance rule
for most vision problems. By introducing a PDE-constrained optimal control
framework, it is possible to use the training data resulting from multiple ways
(ground truth, results from other methods, and manual results from humans) to
learn PDEs for different computer vision tasks. The proposed optimal control
based training framework aims at learning a PDE-based regressor to approximate
the unknown (and usually nonlinear) mapping of different vision tasks. The
experimental results show that the learnt PDEs can solve different vision
problems reasonably well. In particular, we can obtain PDEs not only for
problems that traditional PDEs work well but also for problems that PDE-based
methods have never been tried before, due to the difficulty in describing those
problems in a mathematical way.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2011 04:26:44 GMT'}]",2011-09-07,"[['Liu', 'Risheng', ''], ['Lin', 'Zhouchen', ''], ['Zhang', 'Wei', ''], ['Tang', 'Kewei', ''], ['Su', 'Zhixun', '']]","['Optimal Control', 'PDEs', 'Computer Vision', 'Image Processing']"
18661,0907.2139,Mai-Anh Phan,"Mai-Anh Phan, J\""org Huschke","Adaptive Point-to-Multipoint Transmission for Multimedia Broadcast
  Multicast Services in LTE","6 pages, 7 figures",,,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates point-to-multipoint (PTM) transmission supporting
adaptive modulation and coding (AMC) as well as retransmissions based on
incremental redundancy. In contrast to the classical PTM transmission which was
introduced by the Multimedia Broadcast Multicast Service (MBMS), the
adaptiveness requires user individual feedback channels that allow the
receivers to report their radio conditions and send positive or negative
acknowledgments (ACK/NACK) for a Layer 1 transport block to the eNodeB. In this
work, an adaptive PTM scheme based on feedback from multiple users is presented
and evaluated. Furthermore, a simple NACK-oriented feedback mechanism is
introduced to relieve the feedback channel that is used in the uplink. Finally,
the performance of different single-cell MBMS transmission modes is evaluated
by dynamic radio network simulations. It is shown that adaptive PTM
transmission outperforms the conventional MBMS configurations in terms of radio
resource consumption and user satisfaction rate.
","[{'version': 'v1', 'created': 'Mon, 13 Jul 2009 11:21:23 GMT'}]",2009-09-30,"[['Phan', 'Mai-Anh', ''], ['Huschke', 'Jörg', '']]","['MBMS', 'link adaptation', 'mobile TV']"
18662,1206.1134,Rachit Agarwal,"Rachit Agarwal, Matthew Caesar, P. Brighten Godfrey, Ben Y. Zhao",Shortest Paths in Less Than a Millisecond,6 pages; to appear in SIGCOMM WOSN 2012,,,,cs.SI cs.DB physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of answering point-to-point shortest path queries on
massive social networks. The goal is to answer queries within tens of
milliseconds while minimizing the memory requirements. We present a technique
that achieves this goal for an extremely large fraction of path queries by
exploiting the structure of the social networks.
  Using evaluations on real-world datasets, we argue that our technique offers
a unique trade-off between latency, memory and accuracy. For instance, for the
LiveJournal social network (roughly 5 million nodes and 69 million edges), our
technique can answer 99.9% of the queries in less than a millisecond. In
comparison to storing all pair shortest paths, our technique requires at least
550x less memory; the average query time is roughly 365 microseconds --- 430x
faster than the state-of-the-art shortest path algorithm. Furthermore, the
relative performance of our technique improves with the size (and density) of
the network. For the Orkut social network (3 million nodes and 220 million
edges), for instance, our technique is roughly 2588x faster than the
state-of-the-art algorithm for computing shortest paths.
","[{'version': 'v1', 'created': 'Wed, 6 Jun 2012 07:13:37 GMT'}]",2012-06-07,"[['Agarwal', 'Rachit', ''], ['Caesar', 'Matthew', ''], ['Godfrey', 'P. Brighten', ''], ['Zhao', 'Ben Y.', '']]","['Graph Databases', 'Shortest Paths', 'Social Networks', 'DistanceQueries']"
18663,1705.09695,Alberto Pettorossi,"Alberto Pettorossi, Maurizio Proietti","Regularity of languages generated by non context-free grammars over a
  singleton terminal alphabet",,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is well-known that: (i) every context-free language over a singleton
terminal alphabet is regular, and (ii) the class of languages that satisfy the
Pumping Lemma is a proper super-class of the context-free languages. We show
that any language in this superclass over a singleton terminal alphabet is
regular. Our proof is based on a transformational approach and does not rely on
Parikh's Theorem. Our result extends previously known results because there are
languages that are not context-free, do satisfy the Pumping Lemma, and do not
satisfy the hypotheses of Parikh's Theorem.
","[{'version': 'v1', 'created': 'Fri, 26 May 2017 19:46:02 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Jul 2018 17:35:46 GMT'}]",2018-07-13,"[['Pettorossi', 'Alberto', ''], ['Proietti', 'Maurizio', '']]","['Context-free languages', 'pumping lemma (for context-freelanguages)', 'Parikh’s Theorem', 'regular languages']"
18664,1710.01133,Cosmin Bonchis,"Cosmin Bonchis, Eva Kaslik and Florin Rosu","HPC optimal parallel communication algorithm for the simulation of
  fractional-order systems",,,,,cs.MS cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A parallel numerical simulation algorithm is presented for fractional-order
systems involving Caputo-type derivatives, based on the Adams-Bashforth-Moulton
(ABM) predictor-corrector scheme. The parallel algorithm is implemented using
several different approaches: a pure MPI version, a combination of MPI with
OpenMP optimization and a memory saving speedup approach. All tests run on a
BlueGene/P cluster, and comparative improvement results for the running time
are provided. As an applied experiment, the solutions of a fractional-order
version of a system describing a forced series LCR circuit are numerically
computed, depicting cascades of period-doubling bifurcations which lead to the
onset of chaotic behavior.
","[{'version': 'v1', 'created': 'Thu, 28 Sep 2017 14:36:55 GMT'}]",2017-10-04,"[['Bonchis', 'Cosmin', ''], ['Kaslik', 'Eva', ''], ['Rosu', 'Florin', '']]","['Fractional-order system', 'parallel numerical algorithm', 'HPCprocessing']"
18665,1504.02517,Sugata Sanyal,"Tuhin Borgohain, Uday Kumar, Sugata Sanyal",Survey of Operating Systems for the IoT Environment,"5 pages, 7 tables",,,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is a comprehensive survey of the various operating systems
available for the Internet of Things environment. At first the paper introduces
the various aspects of the operating systems designed for the IoT environment
where resource constraint poses a huge problem for the operation of the general
OS designed for the various computing devices. The latter part of the paper
describes the various OS available for the resource constraint IoT environment
along with the various platforms each OS supports, the software development
kits available for the development of applications in the respective OS along
with the various protocols implemented in these OS for the purpose of
communication and networking.
","[{'version': 'v1', 'created': 'Thu, 9 Apr 2015 23:17:01 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Apr 2015 13:39:37 GMT'}]",2015-04-14,"[['Borgohain', 'Tuhin', ''], ['Kumar', 'Uday', ''], ['Sanyal', 'Sugata', '']]","['IDE', 'IP', 'SDK', 'WSN', 'IoT']"
18666,1008.4310,Nada Matta,"Nada Matta (UTT), Karima Sidoumou (UTT), Goritsa Ninova (UTT, LIPN),
  Hassan Atifi (UTT)","Mod\'elisation d'une analyse pragma-linguistique d'un forum de
  discussion",,"Intelligence collective et organisation des connaissances (ISKO),
  Lyon : France (2009)",,,cs.AI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present in this paper, a modelling of an expertise in pragmatics. We
follow knowledge engineering techniques and observe the expert when he analyses
a social discussion forum. Then a number of models are defined. These models
emphasises the process followed by the expert and a number of criteria used in
his analysis. Results can be used as guides that help to understand and
annotate discussion forum. We aim at modelling other pragmatics analysis in
order to complete the base of guides; criteria, process, etc. of discussion
analysis
","[{'version': 'v1', 'created': 'Wed, 25 Aug 2010 16:23:03 GMT'}]",2010-08-26,"[['Matta', 'Nada', '', 'UTT'], ['Sidoumou', 'Karima', '', 'UTT'], ['Ninova', 'Goritsa', '', 'UTT, LIPN'], ['Atifi', 'Hassan', '', 'UTT']]","['Knowledge Engineering', 'Interaction analysis', 'Pragmatics', 'linguistics']"
18667,0906.0910,Daniel Lemire,"Sylvie Noel, Daniel Lemire",On the Challenges of Collaborative Data Processing,"to appear as a chapter in an upcoming book (Collaborative Information
  Behavior)",,,,cs.DB cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The last 30 years have seen the creation of a variety of electronic
collaboration tools for science and business. Some of the best-known
collaboration tools support text editing (e.g., wikis). Wikipedia's success
shows that large-scale collaboration can produce highly valuable content.
Meanwhile much structured data is being collected and made publicly available.
We have never had access to more powerful databases and statistical packages.
Is large-scale collaborative data analysis now possible? Using a quantitative
analysis of Web 2.0 data visualization sites, we find evidence that at least
moderate open collaboration occurs. We then explore some of the limiting
factors of collaboration over data.
","[{'version': 'v1', 'created': 'Thu, 4 Jun 2009 13:28:51 GMT'}]",2009-06-05,"[['Noel', 'Sylvie', ''], ['Lemire', 'Daniel', '']]","['Web-Based Applications', 'Human-Machine Systems', 'Data Warehousing', 'Collaborative Research', 'Social Web', 'Computer-Supported Collaborative Work']"
18668,1704.07657,Andrey Ignatov,Dmitry Ignatov and Andrey Ignatov,Decision Stream: Cultivating Deep Decision Trees,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Various modifications of decision trees have been extensively used during the
past years due to their high efficiency and interpretability. Tree node
splitting based on relevant feature selection is a key step of decision tree
learning, at the same time being their major shortcoming: the recursive nodes
partitioning leads to geometric reduction of data quantity in the leaf nodes,
which causes an excessive model complexity and data overfitting. In this paper,
we present a novel architecture - a Decision Stream, - aimed to overcome this
problem. Instead of building a tree structure during the learning process, we
propose merging nodes from different branches based on their similarity that is
estimated with two-sample test statistics, which leads to generation of a deep
directed acyclic graph of decision rules that can consist of hundreds of
levels. To evaluate the proposed solution, we test it on several common machine
learning problems - credit scoring, twitter sentiment analysis, aircraft flight
control, MNIST and CIFAR image classification, synthetic data classification
and regression. Our experimental results reveal that the proposed approach
significantly outperforms the standard decision tree learning methods on both
regression and classification tasks, yielding a prediction error decrease up to
35%.
","[{'version': 'v1', 'created': 'Tue, 25 Apr 2017 12:20:33 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Apr 2017 10:22:29 GMT'}, {'version': 'v3', 'created': 'Sun, 3 Sep 2017 18:01:09 GMT'}]",2017-09-05,"[['Ignatov', 'Dmitry', ''], ['Ignatov', 'Andrey', '']]","['decision tree', 'data fusion', 'two-sample test statistic', 'distributed machine learning']"
18669,1304.8080,Urmila Shrawankar Ms,"Rupa Patel, Urmila Shrawankar, V.M Thakare",Secure Transmission of Password Using Speech Watermarking,"Pages: 4 Figures: 7, International Journal of Computer Science and
  Technology (IJCST) Vol.2, Issue 3, September 2011",,,,cs.MM cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet is one of the most valuable resources for information communication
and retrievals. Most multimedia signals today are in digital formats. The
digital data can be duplicated and edited with great ease which has led to a
need for data integrity and protection of digital data. The security
requirements such as integrity or data authentication can be met by
implementing security measures using digital watermarking techniques. In this
paper a blind speech watermarking algorithm that embeds the watermark signal
data in the musical (sequence) host signal by using frequency masking is used.
A different logarithmic approach is proposed. In this regard a logarithmic
function is first applied to watermark data. Then the transformed signal is
embedded to the converted version of host signal which is obtained by applying
Fast Fourier transform method. Finally using inverse Fast Fourier Transform and
antilogarithmic function watermark signal is retrieved.
","[{'version': 'v1', 'created': 'Thu, 25 Apr 2013 10:42:04 GMT'}]",2013-05-01,"[['Patel', 'Rupa', ''], ['Shrawankar', 'Urmila', ''], ['Thakare', 'V. M', '']]","['Digital Watermarking', 'logarithmic', 'speech signals', 'data hiding technique', 'frequency masking']"
18670,1505.04449,Jean Louis Fendji Kedieng Ebongue,Jean Louis Fendji Kedieng Ebongue,Rethinking Network Connectivity in Rural Communities in Cameroon,"10 pages, 10 figures, 1 table, conference IST-Africa 2015",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To bridge the digital divide between the urban and rural regions, the
government of Cameroon has launched the Multipurpose Community Telecentres
(MCT). But this project does not seems to sustain the local development. The
aim of this study is threefold: to determine the ICT penetration in rural
Cameroon and Internet adoption; to evaluate the impact of MCTs in rural region
and to provide some recommendations for both the network planning and the
development of suitable services. The study considers two rural communities in
Cameroon. The results show that despite low incomes, and MCTs that are missing
their goal, there is some readiness of local populations to welcome ICT
projects in order to improve their daily life and activities. To design
sustainable ICT projects for those regions, we provide some recommendations
from network design to business strategy.
","[{'version': 'v1', 'created': 'Sun, 17 May 2015 20:12:12 GMT'}]",2015-05-19,"[['Ebongue', 'Jean Louis Fendji Kedieng', '']]","['ICT4D', 'Rural areas', 'Telecentre', 'Wireless Community']"
18671,1802.07852,Siddharth Siddharth,"Siddharth, Aashish Patel, Tzyy-Ping Jung, and Terrence J. Sejnowski",An Affordable Bio-Sensing and Activity Tagging Platform for HCI Research,,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a novel multi-modal bio-sensing platform capable of integrating
multiple data streams for use in real-time applications. The system is composed
of a central compute module and a companion headset. The compute node collects,
time-stamps and transmits the data while also providing an interface for a wide
range of sensors including electroencephalogram, photoplethysmogram,
electrocardiogram, and eye gaze among others. The companion headset contains
the gaze tracking cameras. By integrating many of the measurements systems into
an accessible package, we are able to explore previously unanswerable questions
ranging from open-environment interactions to emotional response studies.
Though some of the integrated sensors are designed from the ground-up to fit
into a compact form factor, we validate the accuracy of the sensors and find
that they perform similarly to, and in some cases better than, alternatives.
","[{'version': 'v1', 'created': 'Thu, 22 Feb 2018 00:08:42 GMT'}]",2018-02-23,"[['Siddharth', '', ''], ['Patel', 'Aashish', ''], ['Jung', 'Tzyy-Ping', ''], ['Sejnowski', 'Terrence J.', '']]","['bio-sensing', 'multi-modal bio-sensing', 'emotion studies', 'braincomputer interfaces']"
18672,1004.1683,Rdv Ijcsis,"Sudhakar Sengan, S.Chenthur Pandian","Enhanced Authentication and Locality Aided - Destination Mobility in
  Dynamic Routing Protocol for MANET","IEEE Publication format, International Journal of Computer Science
  and Information Security, IJCSIS, Vol. 7 No. 3, March 2010, USA. ISSN 1947
  5500, http://sites.google.com/site/ijcsis/",,,,cs.CR cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In our proposed model, the route selection is a function of following
parameters: hop count, trust level of node and security level of application.
In this paper, to focus on secure neighbor detection, trust factor evaluation,
operational mode, route discovery and route selection. The paper mainly address
the security of geographic routing. The watchdog identifies misbehaving nodes,
while the Pathselector avoids routing packets through these nodes. The
watchdog, the pathselector is run by each server. In order to keep the source
informed about the destination's mobility, the destination keeps sending the
alert message to its previous hop telling that it has changed its position and
any reference to it for data packet forwarding be informed to the VHR server.
","[{'version': 'v1', 'created': 'Sat, 10 Apr 2010 04:49:44 GMT'}]",2010-04-13,"[['Sengan', 'Sudhakar', ''], ['Pandian', 'S. Chenthur', '']]","['Mobile ad hoc networks', 'routing protocols', 'multipath routing', 'Reliable Routing', 'Position Based']"
18673,1504.01310,Tom Crick,"Tom Crick, Benjamin A. Hall and Samin Ishtiaq",Reproducibility as a Technical Specification,"Submitted to the 18th IEEE International Conference on Computational
  Science and Engineering (CSE 2015); 6 pages, LaTeX. arXiv admin note:
  substantial text overlap with arXiv:1502.02448",,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reproducibility of computationally-derived scientific discoveries should be a
certainty. As the product of several person-years' worth of effort, results --
whether disseminated through academic journals, conferences or exploited
through commercial ventures -- should at some level be expected to be
repeatable by other researchers. While this stance may appear to be obvious and
trivial, a variety of factors often stand in the way of making it commonplace.
Whilst there has been detailed cross-disciplinary discussions of the various
social, cultural and ideological drivers and (potential) solutions, one factor
which has had less focus is the concept of reproducibility as a technical
challenge. Specifically, that the definition of an unambiguous and measurable
standard of reproducibility would offer a significant benefit to the wider
computational science community.
  In this paper, we propose a high-level technical specification for a service
for reproducibility, presenting cyberinfrastructure and associated workflow for
a service which would enable such a specification to be verified and validated.
In addition to addressing a pressing need for the scientific community, we
further speculate on the potential contribution to the wider software
development community of services which automate de novo compilation and
testing of code from source. We illustrate our proposed specification and
workflow by using the BioModelAnalyzer tool as a running example.
","[{'version': 'v1', 'created': 'Mon, 6 Apr 2015 15:59:49 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Apr 2015 00:20:57 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Jun 2015 01:57:43 GMT'}]",2015-06-17,"[['Crick', 'Tom', ''], ['Hall', 'Benjamin A.', ''], ['Ishtiaq', 'Samin', '']]","['Reproducibility', 'Artifactevaluation', 'Cyberinfrastructure', 'Benchmarks', 'Research software', 'Open science']"
18674,1604.08810,Chung-Hyok Jang,"Pak Song-Ho, Pak Myong-Suk, Jang Chung-Hyok",Improved IKE Protocol Design Based On PKI/ECC,"6 pages, 2 tables",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This Paper proposes an ECDH key exchange method and an ECsig Digital
Signature Authentication method based on group with Koblits curve,
man-in-the-middle attack prevention method for SA payload and initiator
identification payload to design high intensity IKE that can be implemented in
portable devices.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2016 12:57:38 GMT'}]",2016-05-02,"[['Song-Ho', 'Pak', ''], ['Myong-Suk', 'Pak', ''], ['Chung-Hyok', 'Jang', '']]","['IPSec', 'ECC', 'IKE', 'SA', 'Koblitz']"
18675,1007.5024,James P. Delgrande,James P. Delgrande,"A Program-Level Approach to Revising Logic Programs under the Answer Set
  Semantics",,"Theory and Practice of Logic Programming, 10, 4--6, 2010, pp.
  565-580",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An approach to the revision of logic programs under the answer set semantics
is presented. For programs P and Q, the goal is to determine the answer sets
that correspond to the revision of P by Q, denoted P * Q. A fundamental
principle of classical (AGM) revision, and the one that guides the approach
here, is the success postulate. In AGM revision, this stipulates that A is in K
* A. By analogy with the success postulate, for programs P and Q, this means
that the answer sets of Q will in some sense be contained in those of P * Q.
The essential idea is that for P * Q, a three-valued answer set for Q,
consisting of positive and negative literals, is first determined. The positive
literals constitute a regular answer set, while the negated literals make up a
minimal set of naf literals required to produce the answer set from Q. These
literals are propagated to the program P, along with those rules of Q that are
not decided by these literals. The approach differs from work in update logic
programs in two main respects. First, we ensure that the revising logic program
has higher priority, and so we satisfy the success postulate; second, for the
preference implicit in a revision P * Q, the program Q as a whole takes
precedence over P, unlike update logic programs, since answer sets of Q are
propagated to P. We show that a core group of the AGM postulates are satisfied,
as are the postulates that have been proposed for update logic programs.
","[{'version': 'v1', 'created': 'Wed, 28 Jul 2010 16:14:17 GMT'}]",2010-07-29,"[['Delgrande', 'James P.', '']]","['Answer set programming', 'belief change', 'belief revision']"
18676,1701.04327,Ryuhei Mori,Ryuhei Mori,"Better Protocol for XOR Game using Communication Protocol and Nonlocal
  Boxes",21 pages + the title page,,,,cs.IT math.IT quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Buhrman showed that an efficient communication protocol implies a reliable
XOR game protocol. This idea rederives Linial and Shraibman's lower bounds of
communication complexity, which was derived by using factorization norms, with
worse constant factor in much more intuitive way. In this work, we improve and
generalize Buhrman's idea, and obtain a class of lower bounds for classical
communication complexity including an exact Linial and Shraibman's lower bound
as a special case. In the proof, we explicitly construct a protocol for XOR
game from a classical communication protocol by using a concept of nonlocal
boxes and Paw{\l}owski et al.'s elegant protocol, which was used for showing
the violation of information causality in superquantum theories.
","[{'version': 'v1', 'created': 'Mon, 16 Jan 2017 15:26:55 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Feb 2017 16:58:54 GMT'}, {'version': 'v3', 'created': 'Fri, 28 Apr 2017 12:18:05 GMT'}]",2017-05-01,"[['Mori', 'Ryuhei', '']]","['Communication complexity', 'XOR game', 'nonlocality', 'CHSHinequality', 'Fourier analysis']"
18677,1802.07117,Ana Paula Appel,"Ana Paula Appel, Paulo Rodrigo Cavalin, Marisa Affonso Vasconcelos,
  Claudio Santos Pinhanez",Combining Textual Content and Structure to Improve Dialog Similarity,5 pages,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Chatbots, taking advantage of the success of the messaging apps and recent
advances in Artificial Intelligence, have become very popular, from helping
business to improve customer services to chatting to users for the sake of
conversation and engagement (celebrity or personal bots). However, developing
and improving a chatbot requires understanding their data generated by its
users. Dialog data has a different nature of a simple question and answering
interaction, in which context and temporal properties (turn order) creates a
different understanding of such data. In this paper, we propose a novelty
metric to compute dialogs' similarity based not only on the text content but
also on the information related to the dialog structure. Our experimental
results performed over the Switchboard dataset show that using evidence from
both textual content and the dialog structure leads to more accurate results
than using each measure in isolation.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 14:05:48 GMT'}]",2018-02-21,"[['Appel', 'Ana Paula', ''], ['Cavalin', 'Paulo Rodrigo', ''], ['Vasconcelos', 'Marisa Affonso', ''], ['Pinhanez', 'Claudio Santos', '']]","['dialog Analytics', 'Content Analysis', 'Chatbot', 'Similarity']"
18678,1410.2980,Bakthavachalam Elango,B. Elango and P. Rajendran,"Whole counting vs. whole-normalized counting: A country level
  comparative study of internationally collaborated papers on Tribology",Submitted to the Current Science,,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this study is to compare the changing behavior of two counting
methods (whole counting and whole-normalized counting) and inflation rate at
country level research productivity and impact. For this, publication data on
tribology research published between 1998 and 2012 from SCOPUS has been used.
Only internationally collaborated papers are considered for comparison between
two counting methods. The result of correlation tests shows that there is
highly correlation in all the four indicators between the two counting methods.
However, the result of t-test shows that there is significant difference in the
three indicators (paper count, citation count and h-index) between the two
counting methods. This study concludes that whole-normalized counting
(fractional) is the better choice for publication and citations counting at the
country level assessment.
","[{'version': 'v1', 'created': 'Sat, 11 Oct 2014 09:58:50 GMT'}]",2014-10-14,"[['Elango', 'B.', ''], ['Rajendran', 'P.', '']]","['Bibliometrics', 'Counting Methods', 'Country Level Study', 'International Collaboration']"
18679,1307.1728,Andrea Sportiello,Frederique Bassino and Andrea Sportiello,"Linear-time generation of specifiable combinatorial structures: general
  theory and first examples","10 pages + 5 title/biblio/append., submitted to SODA 2014",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Various specifiable combinatorial structures, with d extensive parameters,
can be exactly sampled both by the recursive method, with linear arithmetic
complexity if a heavy preprocessing is performed, or by the Boltzmann method,
with complexity Theta(n^{1+d/2}). We discuss a modified recursive method,
crucially based on the asymptotic expansion of the associated saddle-point
integrals, which can be adopted for a large number of such structures (e.g.
partitions, permutations, lattice walks, trees, random graphs, all with a
variety of prescribed statistics and/or constraints). The new algorithm
requires no preprocessing, still it has linear complexity on average. In terms
of bit complexity, instead of arithmetic, we only have extra logarithmic
factors. For many families of structures, this provides, at our knowledge, the
only known quasi-linear generators. We present the general theory, and detail a
specific example: the partitions of n elements into k non-empty blocks, counted
by the Stirling numbers of the second kind. These objects are involved in the
exact sampling of minimal automata with prescribed alphabet size and number of
states, which is thus performed here with average Theta(n ln n) bit complexity,
outbreaking all previously known Theta(n^{3/2}) algorithms.
","[{'version': 'v1', 'created': 'Fri, 5 Jul 2013 22:19:06 GMT'}]",2013-07-09,"[['Bassino', 'Frederique', ''], ['Sportiello', 'Andrea', '']]","['Random combinatorial structures', 'Random generation', 'Recursive method', 'Randomminimal automata']"
18680,0806.1610,Andreas U. Schmidt,"Andreas U. Schmidt, Nicolai Kuntze, Rachid El Khayari",SPAM over Internet Telephony and how to deal with it,"7th annual Conference Information Security South Africa (ISSA 2008)
  University of Johannesburg, South Africa, 7 -9 July 2008",,,,cs.CR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In our modern society telephony has developed to an omnipresent service.
People are available at anytime and anywhere. Furthermore the Internet has
emerged to an important communication medium. These facts and the raising
availability of broadband internet access has led to the fusion of these two
services. Voice over IP or short VoIP is the keyword, that describes this
combination. The advantages of VoIP in comparison to classic telephony are
location independence, simplification of transport networks, ability to
establish multimedia communications and the low costs. Nevertheless one can
easily see, that combining two technologies, always brings up new challenges
and problems that have to be solved. It is undeniable that one of the most
annoying facet of the Internet nowadays is email spam. According to different
sources email spam is considered to be 80 to 90 percent of the email traffic
produced. The threat of so called voice spam or Spam over Internet Telephony
(SPIT) is even more fatal, for the annoyance and disturbance factor is much
higher. As instance an email that hits the inbox at 4 p.m. is useless but will
not disturb the user much. In contrast a ringing phone at 4 p.m. will lead to a
much higher disturbance. From the providers point of view both email spam and
voice spam produce unwanted traffic and loss of trust of customers into the
service. In order to mitigate this threat different approaches from different
parties have been developed. This paper focuses on state of the art anti voice
spam solutions, analyses them and reveals their weak points. In the end a SPIT
producing benchmark tool will be introduced, that attacks the presented anti
voice spam solutions. With this tool it is possible for an administrator of a
VoIP network to test how vulnerable his system is.
","[{'version': 'v1', 'created': 'Tue, 10 Jun 2008 09:34:30 GMT'}]",2008-06-11,"[['Schmidt', 'Andreas U.', ''], ['Kuntze', 'Nicolai', ''], ['Khayari', 'Rachid El', '']]","['SPAM', 'Internet Telephony', 'VoIP', 'SPIT', 'attack scenarios']"
18681,0705.0253,Jian Li,Mordecai Golin and Li Jian,"More Efficient Algorithms and Analyses for Unequal Letter Cost
  Prefix-Free Coding",29 pages;9 figures;,,,,cs.IT cs.DS math.IT,,"  There is a large literature devoted to the problem of finding an optimal
(min-cost) prefix-free code with an unequal letter-cost encoding alphabet of
size. While there is no known polynomial time algorithm for solving it
optimally there are many good heuristics that all provide additive errors to
optimal. The additive error in these algorithms usually depends linearly upon
the largest encoding letter size.
  This paper was motivated by the problem of finding optimal codes when the
encoding alphabet is infinite. Because the largest letter cost is infinite, the
previous analyses could give infinite error bounds. We provide a new algorithm
that works with infinite encoding alphabets. When restricted to the finite
alphabet case, our algorithm often provides better error bounds than the best
previous ones known.
","[{'version': 'v1', 'created': 'Wed, 2 May 2007 11:23:52 GMT'}, {'version': 'v2', 'created': 'Thu, 3 May 2007 09:00:23 GMT'}]",2007-07-13,"[['Golin', 'Mordecai', ''], ['Jian', 'Li', '']]","['Prefix-Free Codes', 'Source-Coding', 'Redundancy', 'Entropy']"
18682,1312.2121,Djamel Benmerzoug,"Djamel Benmerzoug, Salim Djaaboub, and Hani Mahmoudi","Engineering Cooperative JADE Agents with the AMCIS Methodology: The
  Transportation Management Case Study","12 pages, 8 figures, CIIA'06 Conference",,,,cs.SE cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper discusses in detail important analysis and design issues emerged
during the development of an agent-based transportation e-market. This
discussion is based on concepts coming from the AMCIS methodology and the JADE
framework. The AMCIS methodology is specifically tailored to the analysis and
design of cooperative information agent-based systems, while it supports both
the levels of the individual agent structure and the agent society in the
Multi-Agents Systems (MAS) development process. According to AMCIS, MAS are
viewed as being composed of a number of autonomous cooperative agents that live
in an organized society, in which each agent plays one or more specific roles,
while their plans and interaction protocols are well defined. On the other hand
JADE is a FIPA specifications compliant agent development environment that
gives several facilities for an easy and fast implementation. Our aim is to
reveal the mapping that may exists between the basic concepts proposed by AMCIS
for agents specification and agents interactions and those provided by JADE for
agents implementation, and therefore to propose a kind of roadmap for agents
developers.
","[{'version': 'v1', 'created': 'Sat, 7 Dec 2013 18:04:28 GMT'}]",2013-12-10,"[['Benmerzoug', 'Djamel', ''], ['Djaaboub', 'Salim', ''], ['Mahmoudi', 'Hani', '']]","['agent-oriented software engineering', 'e-commerce', 'AMCIS', 'JADE']"
18683,1206.5584,Debajyoti Mukhopadhyay Prof.,"Sukanta Sinha, Rana Duttagupta, Debajyoti Mukhopadhyay","Web-page Prediction for Domain Specific Web-search using Boolean Bit
  Mask","10 pages, 3 figures","Advances in Computer Science, Eng. & Appl., AISC 167, pp. 211-220,
  Springerlink, 2012",,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Search Engine is a Web-page retrieval tool. Nowadays Web searchers utilize
their time using an efficient search engine. To improve the performance of the
search engine, we are introducing a unique mechanism which will give Web
searchers more prominent search results. In this paper, we are going to discuss
a domain specific Web search prototype which will generate the predicted
Web-page list for user given search string using Boolean bit mask.
","[{'version': 'v1', 'created': 'Mon, 25 Jun 2012 06:07:20 GMT'}]",2012-06-26,"[['Sinha', 'Sukanta', ''], ['Duttagupta', 'Rana', ''], ['Mukhopadhyay', 'Debajyoti', '']]","['Search engine', 'Ontology', 'Ontology Based Search', 'Relevance Value', 'Domain Specific Search', 'Boolean algebra', 'Web-page Prediction', 'Index Based Acyclic Graph']"
18684,1511.01123,Maximilian Jaroschek,"Maximilian Jaroschek, Pablo Federico Dobal, Pascal Fontaine","Adapting Real Quantifier Elimination Methods for Conflict Set
  Computation",,"Frontiers of Combining Systems, 151--166, isbn 978-3-319-24245-3,
  2015",,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The satisfiability problem in real closed fields is decidable. In the context
of satisfiability modulo theories, the problem restricted to conjunctive sets
of literals, that is, sets of polynomial constraints, is of particular
importance. One of the central problems is the computation of good explanations
of the unsatisfiability of such sets, i.e.\ obtaining a small subset of the
input constraints whose conjunction is already unsatisfiable. We adapt two
commonly used real quantifier elimination methods, cylindrical algebraic
decomposition and virtual substitution, to provide such conflict sets and
demonstrate the performance of our method in practice.
","[{'version': 'v1', 'created': 'Tue, 3 Nov 2015 21:28:30 GMT'}]",2015-11-05,"[['Jaroschek', 'Maximilian', ''], ['Dobal', 'Pablo Federico', ''], ['Fontaine', 'Pascal', '']]","['SMT', 'real quantifier elimination', 'cylindrical algebraic decomposition', 'virtual substitution', 'conflict set']"
18685,1609.05317,Xingyi Zhou,"Xingyi Zhou, Xiao Sun, Wei Zhang, Shuang Liang, Yichen Wei",Deep Kinematic Pose Regression,"ECCV Workshop on Geometry Meets Deep Learning, 2016",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning articulated object pose is inherently difficult because the pose is
high dimensional but has many structural constraints. Most existing work do not
model such constraints and does not guarantee the geometric validity of their
pose estimation, therefore requiring a post-processing to recover the correct
geometry if desired, which is cumbersome and sub-optimal. In this work, we
propose to directly embed a kinematic object model into the deep neutral
network learning for general articulated object pose estimation. The kinematic
function is defined on the appropriately parameterized object motion variables.
It is differentiable and can be used in the gradient descent based optimization
in network training. The prior knowledge on the object geometric model is fully
exploited and the structure is guaranteed to be valid. We show convincing
experiment results on a toy example and the 3D human pose estimation problem.
For the latter we achieve state-of-the-art result on Human3.6M dataset.
","[{'version': 'v1', 'created': 'Sat, 17 Sep 2016 11:22:11 GMT'}]",2016-09-20,"[['Zhou', 'Xingyi', ''], ['Sun', 'Xiao', ''], ['Zhang', 'Wei', ''], ['Liang', 'Shuang', ''], ['Wei', 'Yichen', '']]","['Kinematic model', 'Human pose estimation', 'Deep learning']"
18686,1603.06531,Otkrist Gupta,"Otkrist Gupta, Dan Raviv, Ramesh Raskar",Deep video gesture recognition using illumination invariants,,,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present architectures based on deep neural nets for gesture
recognition in videos, which are invariant to local scaling. We amalgamate
autoencoder and predictor architectures using an adaptive weighting scheme
coping with a reduced size labeled dataset, while enriching our models from
enormous unlabeled sets. We further improve robustness to lighting conditions
by introducing a new adaptive filer based on temporal local scale
normalization. We provide superior results over known methods, including recent
reported approaches based on neural nets.
","[{'version': 'v1', 'created': 'Mon, 21 Mar 2016 18:33:29 GMT'}]",2016-03-22,"[['Gupta', 'Otkrist', ''], ['Raviv', 'Dan', ''], ['Raskar', 'Ramesh', '']]","['deep learning', 'gesture recognition', 'video classification', 'neural nets', 'machine learning']"
18687,1407.0927,Dominique Mery,"Dominique M\'ery (LORIA), Neeraj Kumar Singh (McMaster University)",Modelling an Aircraft Landing System in Event-B (Full Report),,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The failure of hardware or software in a critical system can lead to loss of
lives. The design errors can be main source of the failures that can be
introduced during system development process. Formal techniques are an
alternative approach to verify the correctness of critical systems, overcoming
limitations of the traditional validation techniques such as simulation and
testing. The increasing complexity and failure rate brings new challenges in
the area of verification and validation of avionic systems. Since the
reliability of the software cannot be quantified, the \textit{correct by
construction} approach can implement a reliable system. Refinement plays a
major role to build a large system incrementally from an abstract specification
to a concrete system. This paper contributes as a stepwise formal development
of the landing system of an aircraft. The formal models include the complex
behaviour, temporal behaviour and sequence of operations of the landing gear
system. The models are formalized in Event-B modelling language, which supports
stepwise refinement. This case study is considered as a benchmark for
techniques and tools dedicated to the verification of behavioural properties of
systems. The report is the full version of a paper published for the ABZ 2014
Case Study. is
","[{'version': 'v1', 'created': 'Thu, 3 Jul 2014 14:08:57 GMT'}]",2014-07-04,"[['Méry', 'Dominique', '', 'LORIA'], ['Singh', 'Neeraj Kumar', '', 'McMaster University']]","['Abstract model', 'Event-B', 'Event-driven approach', 'Proof-based development', 'Refinement', 'Landing Gear System']"
18688,1109.2430,Prasenjit Chanak,"Indrajit Banerjee, Prasenjit Chanak, Hafizur Rahaman","CCABC: Cyclic Cellular Automata Based Clustering For Energy Conservation
  in Sensor Networks",,,,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Sensor network has been recognized as the most significant technology for
next century. Despites of its potential application, wireless sensor network
encounters resource restriction such as low power, reduced bandwidth and
specially limited power sources. This work proposes an efficient technique for
the conservation of energy in a wireless sensor network (WSN) by forming an
effective cluster of the network nodes distributed over a wide range of
geographical area. The clustering scheme is developed around a specified class
of cellular automata (CA) referred to as the modified cyclic cellular automata
(mCCA). It sets a number of nodes in stand-by mode at an instance of time
without compromising the area of network coverage and thereby conserves the
battery power. The proposed scheme also determines an effective cluster size
where the inter-cluster and intra-cluster communication cost is minimum. The
simulation results establish that the cyclic cellular automata based clustering
for energy conservation in sensor networks (CCABC) is more reliable than the
existing schemes where clustering and CA based energy saving technique is used.
","[{'version': 'v1', 'created': 'Mon, 12 Sep 2011 11:05:21 GMT'}]",2011-09-13,"[['Banerjee', 'Indrajit', ''], ['Chanak', 'Prasenjit', ''], ['Rahaman', 'Hafizur', '']]","['Modified cyclic cellular automata (mCCA)', 'clustering', 'wireless sensor network (WSN)', 'base station (BS)    I']"
18689,1406.4162,Ahmed Alaa,Ahmed M. Alaa,Band-Sweeping M-ary PSK (BS-M-PSK) Modulation and Transceiver Design,To appear in IEEE Potentials Magazine,,,,cs.NI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Channel Estimation is a major problem encountered by receiver designers for
wireless communications systems. The fading channels encountered by the system
are usually time variant for a mobile receiver. Besides, the frequency response
of the channel is frequency selective for urban environments where the delay
spread is quite large compared to the symbol duration. Estimating the channel
is essential for equalizing the received data and removing the Inter-Symbol
Interference (ISI) resulting from the dispersive channel. Hence, conventional
transceivers insert pilot symbols of known values and detect the changes in it
in order to deduce the channel response. Because these pilots carry no
information, the throughput of the system is reduced. A Novel modulation scheme
is presented in this work. The technique depends on using a carrier signal that
has no fixed frequency, the carrier tone sweeps the band dedicated for
transmission and detects the transfer function gain within the band. A carrier
signal that is Frequency Modulated (FM) by a periodic ramp signal becomes
Amplitude Modulated (AM) by the channel transfer function, and thus, the
receiver obtains an estimate for the channel response without using pilots that
decrease the systems throughput or data rate. The carrier signal itself acts as
a dynamic frequency domain pilot. The technique only works for constant energy
systems, and thus it is applied to PSK transceivers. Mathematical formulation,
transceiver design and performance analysis of the proposed modulation
technique are presented.
","[{'version': 'v1', 'created': 'Thu, 30 Jan 2014 14:35:44 GMT'}]",2014-06-18,"[['Alaa', 'Ahmed M.', '']]","['Channel Estimation', 'Digital Modulation', 'Fading Channels', 'Frequency Modulation (FM)', 'Amplitude Modulation (AM)']"
18690,1707.09899,Ashwinkumar Ganesan,"Prutha Date, Ashwinkumar Ganesan, Tim Oates",Fashioning with Networks: Neural Style Transfer to Design Clothes,ML4Fashion 2017,,,,cs.CV cs.AI cs.IR cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convolutional Neural Networks have been highly successful in performing a
host of computer vision tasks such as object recognition, object detection,
image segmentation and texture synthesis. In 2015, Gatys et. al [7] show how
the style of a painter can be extracted from an image of the painting and
applied to another normal photograph, thus recreating the photo in the style of
the painter. The method has been successfully applied to a wide range of images
and has since spawned multiple applications and mobile apps. In this paper, the
neural style transfer algorithm is applied to fashion so as to synthesize new
custom clothes. We construct an approach to personalize and generate new custom
clothes based on a users preference and by learning the users fashion choices
from a limited set of clothes from their closet. The approach is evaluated by
analyzing the generated images of clothes and how well they align with the
users fashion style.
","[{'version': 'v1', 'created': 'Mon, 31 Jul 2017 14:54:11 GMT'}]",2017-08-01,"[['Date', 'Prutha', ''], ['Ganesan', 'Ashwinkumar', ''], ['Oates', 'Tim', '']]","['Convolutional Neural Networks', 'Personalization', 'Fashion', 'Neural Networks', 'Style Transfer', 'Texture Synthesis']"
18691,1108.1331,Masaaki Miki,Masaaki Miki,"Three-term Method and Dual Estimate on Static Problems of Continuum
  Bodies","This work explains the method to generate the animations uploaded
  to:http://www.flickr.com/photos/mikity/sets/72157623397071718/ and
  http://www.flickr.com/photos/mikity/sets/72157625847736003/",,,,cs.CE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work aims to provide standard formulations for direct minimization
approaches on various types of static problems of continuum mechanics.
Particularly, form-finding problems of tension structures are discussed in the
first half and the large deformation problems of continuum bodies are discussed
in the last half. In the first half, as the standards of iterative direct
minimization strategies, two types of simple recursive methods are presented,
namely the two-term method and the three-term method. The dual estimate is also
introduced as a powerful means of involving equally constraint conditions into
minimization problems. As examples of direct minimization approaches on usual
engineering issues, some form finding problems of tension structures which can
be solved by the presented strategies are illustrated. Additionally, it is
pointed out that while the two-term method sometimes becomes useless, the
three-term method always provides remarkable rate of global convergence
efficiency. Then, to show the potential ability of the three-term method, in
the last part of this work, some principle of virtual works which usually
appear in the continuum mechanics are approximated and discretized in a common
manner, which are suitable to be solved by the three-term method. Finally, some
large deformation analyses of continuum bodies which can be solved by the
three-term method are presented.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2011 18:35:12 GMT'}, {'version': 'v2', 'created': 'Sat, 13 Aug 2011 04:44:39 GMT'}]",2015-03-19,"[['Miki', 'Masaaki', '']]","['Two-term method', 'Three-term method', 'Multiplier method', 'Dual Estimate', 'Principle of virtual work', 'DirectMinimization']"
18692,1009.3462,Manuel Mazzara,Manuel Mazzara and Anirban Bhattacharyya,"On Modelling and Analysis of Dynamic Reconfiguration of Dependable
  Real-Time Systems",Presented and published at DEPEND 2010,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper motivates the need for a formalism for the modelling and analysis
of dynamic reconfiguration of dependable real-time systems. We present
requirements that the formalism must meet, and use these to evaluate well
established formalisms and two process algebras that we have been developing,
namely, Webpi and CCSdp. A simple case study is developed to illustrate the
modelling power of these two formalisms. The paper shows how Webpi and CCSdp
represent a significant step forward in modelling adaptive and dependable
real-time systems.
","[{'version': 'v1', 'created': 'Fri, 17 Sep 2010 16:09:29 GMT'}]",2010-09-20,"[['Mazzara', 'Manuel', ''], ['Bhattacharyya', 'Anirban', '']]","['Requirements', 'dynamicreconfiguration', 'modelling', 'analysis', 'verification']"
18693,1701.08665,Xiaodong Pan,"Xiaodong Pan, Yang Xu","Redefinition of the concept of fuzzy set based on vague partition from
  the perspective of axiomatization","25 pages. arXiv admin note: substantial text overlap with
  arXiv:1506.07821",,,,cs.AI,http://creativecommons.org/licenses/by-sa/4.0/,"  Based on the in-depth analysis of the essence and features of vague
phenomena, this paper focuses on establishing the axiomatical foundation of
membership degree theory for vague phenomena, presents an axiomatic system to
govern membership degrees and their interconnections. On this basis, the
concept of vague partition is introduced, further, the concept of fuzzy set
introduced by Zadeh in 1965 is redefined based on vague partition from the
perspective of axiomatization. The thesis defended in this paper is that the
relationship among vague attribute values should be the starting point to
recognize and model vague phenomena from a quantitative view.
","[{'version': 'v1', 'created': 'Fri, 27 Jan 2017 11:27:45 GMT'}]",2017-02-06,"[['Pan', 'Xiaodong', ''], ['Xu', 'Yang', '']]","['Vagueness', 'Axiom', 'Vague membership space', 'Vague partition', 'Fuzzy set']"
18694,0807.0462,Chinh Hoang,Chinh T. Hoang,On the complexity of finding a sun in a graph,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The sun is the graph obtained from a cycle of length even and at least six by
adding edges to make the even-indexed vertices pairwise adjacent. Suns play an
important role in the study of strongly chordal graphs. A graph is chordal if
it does not contain an induced cycle of length at least four. A graph is
strongly chordal if it is chordal and every even cycle has a chord joining
vertices whose distance on the cycle is odd. Farber proved that a graph is
strongly chordal if and only if it is chordal and contains no induced suns.
There are well known polynomial-time algorithms for recognizing a sun in a
chordal graph. Recently, polynomial-time algorithms for finding a sun for a
larger class of graphs, the so-called HHD-free graphs, have been discovered. In
this paper, we prove the problem of deciding whether an arbitrary graph
contains a sun in NP-complete.
","[{'version': 'v1', 'created': 'Thu, 3 Jul 2008 16:49:19 GMT'}]",2008-07-04,"[['Hoang', 'Chinh T.', '']]","['chordal graph', 'strongly chordal graph', 'sun']"
18695,1212.6817,Anish Acharya,"Anish Acharya, Debatri Mitra, Kaushik Halder",Stability Analysis Of Delayed System Using Bodes Integral,"5 pages, 5 figures, 2013 International Conference on Computer
  Communication and Informatics (ICCCI-2013), Jan 2013, Coimbatore, INDIA",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The PID controller parameters can be adjusted in such a manner that it gives
the desired frequency response and the results are found using the Bodes
integral formula in order to adjust the slope of the nyquist curve in a desired
manner. The same idea is applied for plants with time delay . The same has also
been done in a new approach . The delay term is approximated as a transfer
function using Pade approximation and then the Bode integral is used to
determine the controller parameters. Both the methodologies are demonstrated
with MATLAB simulation of representative plants and accompanying PID
controllers. A proper comparison of the two methodologies is also done. The PID
controller parameters are also tuned using a real coded Genetic Algorithm (GA)
and a proper comparison is done between the three methods.
","[{'version': 'v1', 'created': 'Mon, 31 Dec 2012 04:38:05 GMT'}]",2013-01-01,"[['Acharya', 'Anish', ''], ['Mitra', 'Debatri', ''], ['Halder', 'Kaushik', '']]","['PID controller', 'Ziegler-Nichols method', 'auto-tuning', 'Padé approximation', 'Bode’s integral']"
18696,1111.5472,Ian Kash,"Yiling Chen, Stephen Chong, Ian A. Kash, Tal Moran, Salil Vadhan",Truthful Mechanisms for Agents that Value Privacy,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent work has constructed economic mechanisms that are both truthful and
differentially private. In these mechanisms, privacy is treated separately from
the truthfulness; it is not incorporated in players' utility functions (and
doing so has been shown to lead to non-truthfulness in some cases). In this
work, we propose a new, general way of modelling privacy in players' utility
functions. Specifically, we only assume that if an outcome $o$ has the property
that any report of player $i$ would have led to $o$ with approximately the same
probability, then $o$ has small privacy cost to player $i$. We give three
mechanisms that are truthful with respect to our modelling of privacy: for an
election between two candidates, for a discrete version of the facility
location problem, and for a general social choice problem with discrete
utilities (via a VCG-like mechanism). As the number $n$ of players increases,
the social welfare achieved by our mechanisms approaches optimal (as a fraction
of $n$).
","[{'version': 'v1', 'created': 'Wed, 23 Nov 2011 12:12:32 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Nov 2012 16:17:50 GMT'}]",2012-11-14,"[['Chen', 'Yiling', ''], ['Chong', 'Stephen', ''], ['Kash', 'Ian A.', ''], ['Moran', 'Tal', ''], ['Vadhan', 'Salil', '']]","['differential privacy', 'mechanism design', 'truthfulness', 'elections', 'VCG']"
18697,1712.03246,Zhuo Chen,Zhuo Chen and Diana Marculescu,"Priority-Aware Near-Optimal Scheduling for Heterogeneous Multi-Core
  Systems with Specialized Accelerators","heterogeneous systems, performance modeling, queueing theory, optimal
  scheduling",,,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To deliver high performance in power limited systems, architects have turned
to using heterogeneous systems, either CPU+GPU or mixed CPU-hardware systems.
However, in systems with different processor types and task affinities,
scheduling tasks becomes more challenging than in homogeneous multi-core
systems or systems without task affinities. The problem is even more complex
when specialized accelerators and task priorities are included. In this paper,
we provide a formal proof for the optimal scheduling policy for heterogeneous
systems with arbitrary number of resource types, including specialized
accelerators, independent of the task arrival rate, task size distribution, and
resource processing order. We transform the optimal scheduling policy to a
nonlinear integer optimization problem and propose a fast, near-optimal
algorithm. An additional heuristic is proposed for the case of priority-aware
scheduling. Our experimental results demonstrate that the proposed algorithm is
only 0.3% from the optimal and superior to conventional scheduling policies.
","[{'version': 'v1', 'created': 'Fri, 8 Dec 2017 19:02:48 GMT'}]",2017-12-12,"[['Chen', 'Zhuo', ''], ['Marculescu', 'Diana', '']]","['Heterogeneous systems', 'performance modeling', 'queueing theory', 'optimal scheduling  1']"
18698,1609.02067,Gennady Pekhimenko,Gennady Pekhimenko,Practical Data Compression for Modern Memory Hierarchies,PhD Thesis,,,CMU-CS-16-116,cs.AR cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this thesis, we describe a new, practical approach to integrating
hardware-based data compression within the memory hierarchy, including on-chip
caches, main memory, and both on-chip and off-chip interconnects. This new
approach is fast, simple, and effective in saving storage space. A key insight
in our approach is that access time (including decompression latency) is
critical in modern memory hierarchies. By combining inexpensive hardware
support with modest OS support, our holistic approach to compression achieves
substantial improvements in performance and energy efficiency across the memory
hierarchy. Using this new approach, we make several major contributions in this
thesis. First, we propose a new compression algorithm, Base-Delta-Immediate
Compression (BDI), that achieves high compression ratio with very low
compression/decompression latency. BDI exploits the existing low dynamic range
of values present in many cache lines to compress them to smaller sizes using
Base+Delta encoding. Second, we observe that the compressed size of a cache
block can be indicative of its reuse. We use this observation to develop a new
cache insertion policy for compressed caches, the Size-based Insertion Policy
(SIP), which uses the size of a compressed block as one of the metrics to
predict its potential future reuse. Third, we propose a new main memory
compression framework, Linearly Compressed Pages (LCP), that significantly
reduces the complexity and power cost of supporting main memory compression. We
demonstrate that any compression algorithm can be adapted to fit the
requirements of LCP, and that LCP can be efficiently integrated with the
existing cache compression designs, avoiding extra compression/decompression.
","[{'version': 'v1', 'created': 'Wed, 7 Sep 2016 16:53:40 GMT'}]",2016-09-08,"[['Pekhimenko', 'Gennady', '']]","['Data Compression', 'Memory Hierarchy', 'Cache Compression', 'MemoryCompression', 'Bandwidth Compression', 'DRAM', 'Main Memory', 'Memory Subsystem']"
18699,0801.4845,Shailesh Vaya,Carlos Brito and Shailesh Vaya,Improved lower bound for deterministic broadcasting in radio networks,13 pages,,,,cs.DM cs.DC,,"  We consider the problem of deterministic broadcasting in radio networks when
the nodes have limited knowledge about the topology of the network. We show
that for every deterministic broadcasting protocol there exists a network, of
radius 2, for which the protocol takes at least $\Omega(\sqrt{n}) rounds for
completing the broadcast. Our argument can be extended to prove a lower bound
of Omega(\sqrt{nD}) rounds for broadcasting in radio networks of radius D. This
resolves one of the open problems posed in [29], where in the authors proved a
lower bound of $\Omega(n^{1/4}) rounds for broadcasting in constant diameter
networks.
  We prove the new lower $\Omega(\sqrt{n})$ bound for a special family of
radius 2 networks. Each network of this family consists of O(\sqrt{n})
components which are connected to each other via only the source node. At the
heart of the proof is a novel simulation argument, which essentially says that
any arbitrarily complicated strategy of the source node can be simulated by the
nodes of the networks, if the source node just transmits partial topological
knowledge about some component instead of arbitrary complicated messages. To
the best of our knowledge this type of simulation argument is novel and may be
useful in further improving the lower bound or may find use in other
applications.
  Keywords: radio networks, deterministic broadcast, lower bound, advice
string, simulation, selective families, limited topological knowledge.
","[{'version': 'v1', 'created': 'Thu, 31 Jan 2008 10:27:10 GMT'}]",2008-02-01,"[['Brito', 'Carlos', ''], ['Vaya', 'Shailesh', '']]","['radio networks', 'deterministic broadcast', 'lower bound', 'advice string', 'simulation', 'selective families', 'limited topological knowledge']"
18700,1510.05828,Prateek Dewan,Prateek Dewan and Ponnurangam Kumaraguru,Hiding in Plain Sight: The Anatomy of Malicious Facebook Pages,"11 pages, 9 figures, 6 tables",,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Facebook is the world's largest Online Social Network, having more than 1
billion users. Like most other social networks, Facebook is home to various
categories of hostile entities who abuse the platform by posting malicious
content. In this paper, we identify and characterize Facebook pages that engage
in spreading URLs pointing to malicious domains. We used the Web of Trust API
to determine domain reputations of URLs published by pages, and identified 627
pages publishing untrustworthy information, misleading content, adult and child
unsafe content, scams, etc. which are deemed as ""Page Spam"" by Facebook, and do
not comply with Facebook's community standards. Our findings revealed dominant
presence of politically polarized entities engaging in spreading content from
untrustworthy web domains. Anger and religion were the most prominent topics in
the textual content published by these pages. We found that at least 8% of all
malicious pages were dedicated to promote a single malicious domain. Studying
the temporal posting activity of pages revealed that malicious pages were more
active than benign pages. We further identified collusive behavior within a set
of malicious pages spreading adult and pornographic content. We believe our
findings will enable technologists to devise efficient automated solutions to
identify and curb the spread of malicious content through such pages. To the
best of our knowledge, this is the first attempt in literature, focused
exclusively on characterizing malicious Facebook pages.
","[{'version': 'v1', 'created': 'Tue, 20 Oct 2015 10:42:48 GMT'}]",2015-10-21,"[['Dewan', 'Prateek', ''], ['Kumaraguru', 'Ponnurangam', '']]","['Facebook', 'Online Social Networks', 'Malicious URLs']"
18701,1310.0919,Takeyuki Tamura,"Tatsuya Akutsu, Takeyuki Tamura, Atsuhiro Takasu","On the Parameterized Complexity of Associative and Commutative
  Unification",,,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies the unification problem with associative, commutative, and
associative-commutative functions mainly from a viewpoint of the parameterized
complexity on the number of variables. It is shown that both associative and
associative-commutative unification problems are $W[1]$-hard. A fixed-parameter
algorithm and a polynomial-time algorithm are presented for special cases of
commutative unification in which one input term is variable-free and the number
of variables is bounded by a constant, respectively. Related results including
those on the string and tree edit distance problems with variables are shown
too.
","[{'version': 'v1', 'created': 'Thu, 3 Oct 2013 08:00:43 GMT'}]",2013-10-04,"[['Akutsu', 'Tatsuya', ''], ['Tamura', 'Takeyuki', ''], ['Takasu', 'Atsuhiro', '']]","['unification', 'parameterized algorithms', 'dynamic programming', 'tree edit distance']"
18702,1505.06262,Kenza Guenda,"Nabil Bennenni, Kenza Guenda and T. Aaron Gulliver",Greedy Construction of DNA Codes and New Bounds,,,,,cs.IT math.IT,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper, we construct linear codes over $\mathbb{Z}_4$ with bounded
$GC$-content. The codes are obtained using a greedy algorithm over
$\mathbb{Z}_4$. Further, upper and lower bounds are derived for the maximum
size of DNA codes of length $n$ with constant $GC$-content $w$ and edit
distance $d$.
","[{'version': 'v1', 'created': 'Sat, 23 May 2015 02:13:58 GMT'}]",2015-05-26,"[['Bennenni', 'Nabil', ''], ['Guenda', 'Kenza', ''], ['Gulliver', 'T. Aaron', '']]","['DNA codes', 'GC-content', 'edit distance', 'upper and lowerbounds']"
18703,1606.04287,Adrian Mos,"Adrian Mos, Mario Cortes-Cornax","Business Matter Experts do Matter: A Model-Driven Approach for Domain
  Specific Process Design and Monitoring","camera-ready author version for the BPM conference full paper in the
  Forum track",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Business process design and monitoring are essential elements of Business
Process Management (BPM), often relying on Service Oriented Architectures
(SOA). However the current BPM approaches and standards have not sufficiently
reduced the Business-IT gap. Today's solutions are mostly domain-independent
and platform-dependent, which limits the ability of business matter experts to
express business intent and enact process change. In contrast, the approach
presented in this paper focuses on BPM and SOA environments in a
domain-dependent and platform-independent way. We propose to add a domain
specific-layer on top of current solutions so business stakeholders can design
and understand their processes in a more intuitive way. We rely on previously
proposed technical solutions and integrate them in an end-to-end methodology
(from design to monitoring and back). The appropriateness and the feasibility
of the approach is justified through a use case and a complete prototype
implementation.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2016 10:05:17 GMT'}]",2016-06-15,"[['Mos', 'Adrian', ''], ['Cortes-Cornax', 'Mario', '']]","['Model-driven methodology', 'process monitoring', 'DSL', 'BPM', 'SOA']"
18704,1710.05711,Sanping Zhou,"Sanping Zhou, Jinjun Wang, Deyu Meng, Xiaomeng Xin, Yubing Li, Yihong
  Gong, Nanning Zheng",Deep Self-Paced Learning for Person Re-Identification,Accepted by Pattern Recognition,,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Person re-identification (Re-ID) usually suffers from noisy samples with
background clutter and mutual occlusion, which makes it extremely difficult to
distinguish different individuals across the disjoint camera views. In this
paper, we propose a novel deep self-paced learning (DSPL) algorithm to
alleviate this problem, in which we apply a self-paced constraint and symmetric
regularization to help the relative distance metric training the deep neural
network, so as to learn the stable and discriminative features for person
Re-ID. Firstly, we propose a soft polynomial regularizer term which can derive
the adaptive weights to samples based on both the training loss and model age.
As a result, the high-confidence fidelity samples will be emphasized and the
low-confidence noisy samples will be suppressed at early stage of the whole
training process. Such a learning regime is naturally implemented under a
self-paced learning (SPL) framework, in which samples weights are adaptively
updated based on both model age and sample loss using an alternative
optimization method. Secondly, we introduce a symmetric regularizer term to
revise the asymmetric gradient back-propagation derived by the relative
distance metric, so as to simultaneously minimize the intra-class distance and
maximize the inter-class distance in each triplet unit. Finally, we build a
part-based deep neural network, in which the features of different body parts
are first discriminately learned in the lower convolutional layers and then
fused in the higher fully connected layers. Experiments on several benchmark
datasets have demonstrated the superior performance of our method as compared
with the state-of-the-art approaches.
","[{'version': 'v1', 'created': 'Sat, 7 Oct 2017 01:32:38 GMT'}]",2017-10-17,"[['Zhou', 'Sanping', ''], ['Wang', 'Jinjun', ''], ['Meng', 'Deyu', ''], ['Xin', 'Xiaomeng', ''], ['Li', 'Yubing', ''], ['Gong', 'Yihong', ''], ['Zheng', 'Nanning', '']]","['Person Re-identification', 'Deep Convolutional Neural Network', 'Self-Paced Learning', 'Metric Learning']"
18705,1506.03509,Furong Huang,"Furong Huang, Animashree Anandkumar",Convolutional Dictionary Learning through Tensor Factorization,,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Tensor methods have emerged as a powerful paradigm for consistent learning of
many latent variable models such as topic models, independent component
analysis and dictionary learning. Model parameters are estimated via CP
decomposition of the observed higher order input moments. However, in many
domains, additional invariances such as shift invariances exist, enforced via
models such as convolutional dictionary learning. In this paper, we develop
novel tensor decomposition algorithms for parameter estimation of convolutional
models. Our algorithm is based on the popular alternating least squares method,
but with efficient projections onto the space of stacked circulant matrices.
Our method is embarrassingly parallel and consists of simple operations such as
fast Fourier transforms and matrix multiplications. Our algorithm converges to
the dictionary much faster and more accurately compared to the alternating
minimization over filters and activation maps.
","[{'version': 'v1', 'created': 'Wed, 10 Jun 2015 23:48:18 GMT'}, {'version': 'v2', 'created': 'Fri, 12 Jun 2015 22:46:18 GMT'}, {'version': 'v3', 'created': 'Thu, 18 Jun 2015 21:04:28 GMT'}]",2015-06-22,"[['Huang', 'Furong', ''], ['Anandkumar', 'Animashree', '']]","['Tensor CP decomposition', 'convolutional dictionary learning', 'convolutional ICA', 'blind deconvolution']"
18706,1701.05913,Hui Liu Mr,Hui Liu and Zhangxin Chen,"Scalable linear solvers for sparse linear systems from large-scale
  numerical simulations",arXiv admin note: substantial text overlap with arXiv:1602.05901,,,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents our work on designing scalable linear solvers for
large-scale reservoir simulations. The main objective is to support
implementation of parallel reservoir simulators on distributed-memory parallel
systems, where MPI (Message Passing Interface) is employed for communications
among computation nodes. Distributed matrix and vector modules are designed,
which are the base of our parallel linear systems. Commonly-used Krylov
subspace linear solvers are implemented, including the restarted GMRES method,
the LGMRES method, and the BiCGSTAB method. It also has an interface to a
parallel algebraic multigrid solver, BoomerAMG from HYPRE. Parallel
general-purpose preconditioners and special preconditioners for reservoir
simulations are also developed. The numerical experiments show that our linear
solvers have excellent scalability using thousands of CPU cores.
","[{'version': 'v1', 'created': 'Fri, 20 Jan 2017 19:37:44 GMT'}]",2017-01-24,"[['Liu', 'Hui', ''], ['Chen', 'Zhangxin', '']]","['linear solver', 'preconditioner', 'reservoir simulation', 'parallel computing', 'data structure']"
18707,1610.03450,Chairi Kiourt,Chairi Kiourt and Dimitris Kalles,"A Distributed Multi Agents Based Platform for High Performance Computing
  Infrastructures","12 pages,4 figures, Conference: Workshop Parallel and Distributed
  Computing for Knowledge Discovery in Data Bases, a workshop of the European
  Conference on Machine Learning and Principles and Practice of Knowledge
  Discovery, At Porto, Portugal, 2015",,,,cs.DC cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work introduces a novel, modular, layered web based platform for
managing machine learning experiments on grid-based High Performance Computing
infrastructures. The coupling of the communication services offered by the
grid, with an administration layer and conventional web server programming, via
a data synchronization utility, leads to the straightforward development of a
web-based user interface that allows the monitoring and managing of diverse
online distributed computing applications. It also introduces an experiment
generation and monitoring tool particularly suitable for investigating machine
learning in game playing. The platform is demonstrated with experiments for two
different games.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2016 18:07:38 GMT'}]",2016-10-12,"[['Kiourt', 'Chairi', ''], ['Kalles', 'Dimitris', '']]","['Distributed Computing', 'MABS platform', 'MAS', 'Machine Learning']"
18708,1607.00267,Gustavo Carneiro,"Gustavo Carneiro and Luke Oakden-Rayner and Andrew P. Bradley and
  Jacinto Nascimento and Lyle Palmer","Automated 5-year Mortality Prediction using Deep Learning and Radiomics
  Features from Chest Computed Tomography",9 pages,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose new methods for the prediction of 5-year mortality in elderly
individuals using chest computed tomography (CT). The methods consist of a
classifier that performs this prediction using a set of features extracted from
the CT image and segmentation maps of multiple anatomic structures. We explore
two approaches: 1) a unified framework based on deep learning, where features
and classifier are automatically learned in a single optimisation process; and
2) a multi-stage framework based on the design and selection/extraction of
hand-crafted radiomics features, followed by the classifier learning process.
Experimental results, based on a dataset of 48 annotated chest CTs, show that
the deep learning model produces a mean 5-year mortality prediction accuracy of
68.5%, while radiomics produces a mean accuracy that varies between 56% to 66%
(depending on the feature selection/extraction method and classifier). The
successful development of the proposed models has the potential to make a
profound impact in preventive and personalised healthcare.
","[{'version': 'v1', 'created': 'Fri, 1 Jul 2016 14:44:37 GMT'}]",2016-10-04,"[['Carneiro', 'Gustavo', ''], ['Oakden-Rayner', 'Luke', ''], ['Bradley', 'Andrew P.', ''], ['Nascimento', 'Jacinto', ''], ['Palmer', 'Lyle', '']]","['deep learning', 'radiomics', 'feature learning', 'hand-designedfeatures', 'computed tomography', 'five-year mortality']"
18709,1304.2676,Jean Souviron,Jean Souviron,"Convex hull: Incremental variations on the Akl-Toussaint heuristics
  Simple, optimal and space-saving convex hull algorithms","15 pages, 11 figures",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convex hulls are a fundamental geometric tool used in a number of algorithms.
A famous paper by Akl and Toussaint in 1978 described a way to reduce the
number of points involved in the computation, which is since known as the
Akl-Toussaint heuristics. This paper first studies what this heurstics really
represents in terms of reduction of points and demonstrates that the optimum
selection is reached using an octogon as the remaining number of points is in
O(sqrt(N)) rather than the usual O(N). Then it focuses on optimising the
overall computational efficiency in a convex hull computation. Although the
heuristics is usually used as a first step in computations one can obtain the
convex hull directly from the heuristics's basis. First a simple incremental
implementation is described, and if the number of characteristic points of the
Akl-Toussaint heuristics p is taken as a parametre the convex hull is then
computed in a O(N(p+h/p)) average complexity or O(Nh) asymptotic complexity.
Given the relative constant factor of 1/p however experimental results show
that this algorithm should be considered linear in average. Worst-case
complexity is in O(N^2) and space complexity is O(h) but could be O(1) if the
required output is the array of convex vertices's indexes. Then a remark on why
the basic incremental method should be preferred for average cases is made.
Finally an optimal linear algorithm both in average and worst-case and using a
minimal space complexity in O(sqrt(N)) in average (or O(1) if in-place
computation is allowed) is presented.
","[{'version': 'v1', 'created': 'Tue, 9 Apr 2013 17:41:27 GMT'}]",2013-04-10,"[['Souviron', 'Jean', '']]","['Convex hull', 'Akl-Toussaint heuristics', 'incremental method', 'run-time efficiency', 'space efficiency']"
18710,1206.3038,Manish Gupta,Manish. K. Gupta and C. Durairajan,On the Covering Radius of Some Modular Codes,revised,,,,cs.IT math.IT math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper gives lower and upper bounds on the covering radius of codes over
$\Z_{2^s}$ with respect to homogenous distance. We also determine the covering
radius of various Repetition codes, Simplex codes (Type $\alpha$ and Type
$\beta$) and their dual and give bounds on the covering radii for MacDonald
codes of both types over $\Z_4$.
","[{'version': 'v1', 'created': 'Thu, 14 Jun 2012 09:05:16 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Jun 2012 08:26:18 GMT'}]",2012-06-26,"[['Gupta', 'Manish. K.', ''], ['Durairajan', 'C.', '']]","['Covering radius', 'codes over rings', 'Simplex codes', 'Hamming codes']"
18711,1312.2581,Amor Lazzez Dr.,"Amor Lazzez, Thabet Slimani",Deployment of VoIP Technology: QoS Concerns,"8 pages, 3 figures","International Journal of Advanced Research in Computer and
  Communication Engineering (IJARCCE), Vol. 2, Issue 9, September 2013",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Voice over IP (VoIP) is an emerging communication service allowing voice
transmission over a private or a public IP network. VoIP allows significant
benefits for customers and service providers including cost savings, phone and
service portability, mobility, and the integration with other applications.
Nevertheless, the deployment of the VoIP technology encounters many challenges
such as interoperability issues, security issues, and QoS concerns. Among these
disadvantages, QoS issues are considered the most serious due to the QoS
problems that may arise on IP networks, and the stringent QoS requirements of
voice traffic. The aim of this paper is carry out a deep analysis of the QoS
concerns of the VoIP technology. Firstly, we present a brief overview about the
VoIP technology. Then, we discuss the QoS issues related to the use of the IP
networking technology for voice traffic transmission. After that, we present
the QoS concerns related voice clarity. Finally, we present the QoS mechanisms
proposed to make the IP technology able to support voice traffic QoS
requirements in terms of voice clarity, voice packet delay, packet delay
variation, and packet loss.
","[{'version': 'v1', 'created': 'Sun, 8 Dec 2013 15:47:35 GMT'}]",2013-12-11,"[['Lazzez', 'Amor', ''], ['Slimani', 'Thabet', '']]","['VoIP', 'QoS', 'Bandwidth', 'Packet Delay', 'Packet Delay Variation', 'Packet Loss']"
18712,1610.00031,Marcos Zampieri,"Cyril Goutte, Serge L\'eger, Shervin Malmasi, Marcos Zampieri",Discriminating Similar Languages: Evaluations and Explorations,Proceedings of Language Resources and Evaluation (LREC),"Proceedings of Language Resources and Evaluation (LREC). Portoroz,
  Slovenia. pp 1800-1807 (2016)",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an analysis of the performance of machine learning classifiers on
discriminating between similar languages and language varieties. We carried out
a number of experiments using the results of the two editions of the
Discriminating between Similar Languages (DSL) shared task. We investigate the
progress made between the two tasks, estimate an upper bound on possible
performance using ensemble and oracle combination, and provide learning curves
to help us understand which languages are more challenging. A number of
difficult sentences are identified and investigated further with human
annotation.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2016 20:57:52 GMT'}]",2016-10-04,"[['Goutte', 'Cyril', ''], ['Léger', 'Serge', ''], ['Malmasi', 'Shervin', ''], ['Zampieri', 'Marcos', '']]","['language identification', 'language varieties', 'evaluation']"
18713,1606.02753,Michael McCann,Michael T. McCann and Matthew Fickus and Jelena Kovacevic,"Rotation Invariant Angular Descriptor Via A Bandlimited Gaussian-like
  Kernel",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new smooth, Gaussian-like kernel that allows the kernel density
estimate for an angular distribution to be exactly represented by a finite
number of its Fourier series coefficients. Distributions of angular quantities,
such as gradients, are a central part of several state-of-the-art image
processing algorithms, but these distributions are usually described via
histograms and therefore lack rotation invariance due to binning artifacts.
Replacing histograming with kernel density estimation removes these binning
artifacts and can provide a finite-dimensional descriptor of the distribution,
provided that the kernel is selected to be bandlimited. In this paper, we
present a new band-limited kernel that has the added advantage of being
Gaussian-like in the angular domain. We then show that it compares favorably to
gradient histograms for patch matching, person detection, and texture
segmentation.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2016 20:51:23 GMT'}]",2016-06-10,"[['McCann', 'Michael T.', ''], ['Fickus', 'Matthew', ''], ['Kovacevic', 'Jelena', '']]","['kernel density estimation', 'angular distribution', 'patch descriptor', 'person detection', 'segmentation']"
18714,1111.6431,Aryeh Kontorovich,Aryeh Kontorovich and Ari Trachtenberg,Unique decodability of bigram counts by finite automata,12 pages,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We revisit the problem of deciding whether a given string is uniquely
decodable from its bigram counts by means of a finite automaton. An efficient
algorithm for constructing a polynomial-size nondeterministic finite automaton
that decides unique decodability is given. Conversely, we show that the minimum
deterministic finite automaton for deciding unique decodability has at least
exponentially many states in alphabet size.
","[{'version': 'v1', 'created': 'Mon, 28 Nov 2011 12:46:03 GMT'}]",2011-11-29,"[['Kontorovich', 'Aryeh', ''], ['Trachtenberg', 'Ari', '']]","['uniqueness', 'sequence reconstruction', 'Eulerian graph', 'finite-state automata']"
18715,1505.05240,Siddharth Srivastava,"Siddharth Srivastava, Prerana Mukherjee, Brejesh Lall",Benchmarking KAZE and MCM for Multiclass Classification,,,,v01.0,cs.CV cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel approach for feature generation by
appropriately fusing KAZE and SIFT features. We then use this feature set along
with Minimal Complexity Machine(MCM) for object classification. We show that
KAZE and SIFT features are complementary. Experimental results indicate that an
elementary integration of these techniques can outperform the state-of-the-art
approaches.
","[{'version': 'v1', 'created': 'Wed, 20 May 2015 04:09:47 GMT'}]",2015-05-21,"[['Srivastava', 'Siddharth', ''], ['Mukherjee', 'Prerana', ''], ['Lall', 'Brejesh', '']]","['Object Classification', 'KAZE', 'SIFT', 'Minimum ComplexityMachine']"
18716,1412.5697,Zahed Rahmati,"Zahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides",Kinetic $k$-Semi-Yao Graph and its Applications,"arXiv admin note: text overlap with arXiv:1307.2700, arXiv:1406.5554",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a new proximity graph, called the $k$-Semi-Yao graph
($k$-SYG), on a set $P$ of points in $\mathbb{R}^d$, which is a supergraph of
the $k$-nearest neighbor graph ($k$-NNG) of $P$. We provide a kinetic data
structure (KDS) to maintain the $k$-SYG on moving points, where the trajectory
of each point is a polynomial function whose degree is bounded by some
constant. Our technique gives the first KDS for the theta graph (\ie, $1$-SYG)
in $\mathbb{R}^d$. It generalizes and improves on previous work on maintaining
the theta graph in $\mathbb{R}^2$.
  As an application, we use the kinetic $k$-SYG to provide the first KDS for
maintenance of all the $k$-nearest neighbors in $\mathbb{R}^d$, for any $k\geq
1$. Previous works considered the $k=1$ case only. Our KDS for all the
$1$-nearest neighbors is deterministic. The best previous KDS for all the
$1$-nearest neighbors in $ \mathbb{R}^d$ is randomized. Our structure and
analysis are simpler and improve on this work for the $k=1$ case. We also
provide a KDS for all the $(1+\epsilon)$-nearest neighbors, which in fact gives
better performance than previous KDS's for maintenance of all the exact
$1$-nearest neighbors.
  As another application, we present the first KDS for answering reverse
$k$-nearest neighbor queries on moving points in $ \mathbb{R}^d$, for any
$k\geq 1$.
","[{'version': 'v1', 'created': 'Thu, 18 Dec 2014 01:34:32 GMT'}]",2014-12-19,"[['Rahmati', 'Zahed', ''], ['Abam', 'Mohammad Ali', ''], ['King', 'Valerie', ''], ['Whitesides', 'Sue', '']]","['k-nearest neighbors', 'reverse k-nearest neighbor queries', 'kinetic datastructure', 'continuous monitoring', 'continuous queries']"
18717,1003.3985,Raja Giryes,"Raja Giryes, Michael Elad, Yonina C Eldar","The Projected GSURE for Automatic Parameter Tuning in Iterative
  Shrinkage Methods","20 pages, 14 figures",,,,cs.CV stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linear inverse problems are very common in signal and image processing. Many
algorithms that aim at solving such problems include unknown parameters that
need tuning. In this work we focus on optimally selecting such parameters in
iterative shrinkage methods for image deblurring and image zooming. Our work
uses the projected Generalized Stein Unbiased Risk Estimator (GSURE) for
determining the threshold value lambda and the iterations number K in these
algorithms. The proposed parameter selection is shown to handle any degradation
operator, including ill-posed and even rectangular ones. This is achieved by
using GSURE on the projected expected error. We further propose an efficient
greedy parameter setting scheme, that tunes the parameter while iterating
without impairing the resulting deblurring performance. Finally, we provide
extensive comparisons to conventional methods for parameter selection, showing
the superiority of the use of the projected GSURE.
","[{'version': 'v1', 'created': 'Sun, 21 Mar 2010 08:43:52 GMT'}]",2010-03-23,"[['Giryes', 'Raja', ''], ['Elad', 'Michael', ''], ['Eldar', 'Yonina C', '']]","['Iterated Shrinkage', 'Stein Unbiased Risk Estimator', 'Separable Surrogate Function', 'Inverse problems']"
18718,1407.3342,Srinivasa Rao Satti,"Amr Elmasry and Daniel Dahl Juhl and Jyrki Katajainen and Srinivasa
  Rao Satti",Selection from read-only memory with limited workspace,"16 pages, 1 figure, Preliminary version appeared in COCOON-2013",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given an unordered array of $N$ elements drawn from a totally ordered set and
an integer $k$ in the range from $1$ to $N$, in the classic selection problem
the task is to find the $k$-th smallest element in the array. We study the
complexity of this problem in the space-restricted random-access model: The
input array is stored on read-only memory, and the algorithm has access to a
limited amount of workspace. We prove that the linear-time prune-and-search
algorithm---presented in most textbooks on algorithms---can be modified to use
$\Theta(N)$ bits instead of $\Theta(N)$ words of extra space. Prior to our
work, the best known algorithm by Frederickson could perform the task with
$\Theta(N)$ bits of extra space in $O(N \lg^{*} N)$ time. Our result separates
the space-restricted random-access model and the multi-pass streaming model,
since we can surpass the $\Omega(N \lg^{*} N)$ lower bound known for the latter
model. We also generalize our algorithm for the case when the size of the
workspace is $\Theta(S)$ bits, where $\lg^3{N} \leq S \leq N$. The running time
of our generalized algorithm is $O(N \lg^{*}(N/S) + N (\lg N) / \lg{} S)$,
slightly improving over the $O(N \lg^{*}(N (\lg N)/S) + N (\lg N) / \lg{} S)$
bound of Frederickson's algorithm. To obtain the improvements mentioned above,
we developed a new data structure, called the wavelet stack, that we use for
repeated pruning. We expect the wavelet stack to be a useful tool in other
applications as well.
","[{'version': 'v1', 'created': 'Sat, 12 Jul 2014 04:35:37 GMT'}]",2014-07-15,"[['Elmasry', 'Amr', ''], ['Juhl', 'Daniel Dahl', ''], ['Katajainen', 'Jyrki', ''], ['Satti', 'Srinivasa Rao', '']]","['Selection algorithm', 'read-only memory', 'random-access machine', 'multi-pass streaming', 'bit vector', 'wavelet stack']"
18719,1401.6697,Yuli Ye,"Allan Borodin, Dai Tri Man Le and Yuli Ye",Weakly Submodular Functions,,,,,cs.DM cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Submodular functions are well-studied in combinatorial optimization, game
theory and economics. The natural diminishing returns property makes them
suitable for many applications. We study an extension of monotone submodular
functions, which we call {\em weakly submodular functions}. Our extension
includes some (mildly) supermodular functions. We show that several natural
functions belong to this class and relate our class to some other recent
submodular function extensions.
  We consider the optimization problem of maximizing a weakly submodular
function subject to uniform and general matroid constraints. For a uniform
matroid constraint, the ""standard greedy algorithm"" achieves a constant
approximation ratio where the constant (experimentally) converges to 5.95 as
the cardinality constraint increases. For a general matroid constraint, a
simple local search algorithm achieves a constant approximation ratio where the
constant (analytically) converges to 10.22 as the rank of the matroid
increases.
","[{'version': 'v1', 'created': 'Sun, 26 Jan 2014 21:48:39 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Apr 2014 03:11:01 GMT'}, {'version': 'v3', 'created': 'Mon, 21 Jul 2014 03:22:36 GMT'}, {'version': 'v4', 'created': 'Wed, 30 Jul 2014 16:26:22 GMT'}, {'version': 'v5', 'created': 'Sun, 16 Nov 2014 23:46:08 GMT'}]",2014-11-18,"[['Borodin', 'Allan', ''], ['Le', 'Dai Tri Man', ''], ['Ye', 'Yuli', '']]","['submodular functions', 'max-sum dispersion', 'greedy algorithms', 'local search']"
18720,1602.08230,Matthias Mnich,Matthias Mnich and Ildik\'o Schlotter,"Stable Marriage with Covering Constraints: A Complete Computational
  Trichotomy","40 pages, 10 figures",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider Stable Marriage with Covering Constraints (SMC): in this variant
of Stable Marriage, we distinguish a subset of women as well as a subset of
men, and we seek a matching with fewest number of blocking pairs that matches
all of the distinguished people. We investigate how a set of natural
parameters, namely the maximum length of preference lists for men and women,
the number of distinguished men and women, and the number of blocking pairs
allowed determine the computational tractability of this problem. Our main
result is a complete complexity trichotomy that, for each choice of the studied
parameters, classifies SMC as polynomial-time solvable, NP-hard and
fixed-parameter tractable, or NP-hard and W[1]-hard. We also classify all cases
of one-sided constraints where only women may be distinguished.
","[{'version': 'v1', 'created': 'Fri, 26 Feb 2016 08:07:11 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Mar 2017 16:22:36 GMT'}, {'version': 'v3', 'created': 'Sat, 5 Oct 2019 16:34:29 GMT'}]",2019-10-08,"[['Mnich', 'Matthias', ''], ['Schlotter', 'Ildikó', '']]","['Stable marriage', 'lower quotas', 'fixed-parameter algorithms']"
18721,0907.2121,Sergio Rodriguez,Sergio R. Rodriguez,Topology Discovery Using Cisco Discovery Protocol,,,,TR-200903-013,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we address the problem of discovering network topology in
proprietary networks. Namely, we investigate topology discovery in Cisco-based
networks. Cisco devices run Cisco Discovery Protocol (CDP) which holds
information about these devices. We first compare properties of topologies that
can be obtained from networks deploying CDP versus Spanning Tree Protocol (STP)
and Management Information Base (MIB) Forwarding Database (FDB). Then we
describe a method of discovering topology of CDP-based networks. Our
experiments show that the physical topology of the network including links that
are in Forwarding Block state can be discovered.
","[{'version': 'v1', 'created': 'Mon, 13 Jul 2009 09:56:16 GMT'}]",2009-07-14,"[['Rodriguez', 'Sergio R.', '']]","['Cisco Discovery Protocol', 'Spanning Tree Protocol', 'MIB FDB', 'Network Management', 'Topology Discovery']"
18722,1609.03893,Yu Jin,"Yu Jin, Joseph F. JaJa, Rong Chen, Edward H. Herskovits","Scalable Algorithms for Generating and Analyzing Structural Brain
  Networks with a Varying Number of Nodes",,,,,cs.CE q-bio.NC stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Diffusion Magnetic Resonance Imaging (MRI) exploits the anisotropic diffusion
of water molecules in the brain to enable the estimation of the brain's
anatomical fiber tracts at a relatively high resolution. In particular,
tractographic methods can be used to generate whole-brain anatomical
connectivity matrix where each element provides an estimate of the connectivity
strength between the corresponding voxels. Structural brain networks are built
using the connectivity information and a predefined brain parcellation, where
the nodes of the network represent the brain regions and the edge weights
capture the connectivity strengths between the corresponding brain regions.
This paper introduces a number of novel scalable methods to generate and
analyze structural brain networks with a varying number of nodes. In
particular, we introduce a new parallel algorithm to quickly generate large
scale connectivity-based parcellations for which voxels in a region possess
highly similar connectivity patterns to the rest of the regions. We show that
the corresponding regional structural consistency is always superior to
randomly generated parcellations over a wide range of parcellation sizes.
Corresponding brain networks with a varying number of nodes are analyzed using
standard graph-theorectic measures, as well as, new measures derived from
spectral graph theory. Our results indicate increasingly more statistical power
of brain networks with larger numbers of nodes and the relatively unique shape
of the spectral profile of large brain networks relative to other well-known
networks.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2016 15:17:58 GMT'}]",2016-09-14,"[['Jin', 'Yu', ''], ['JaJa', 'Joseph F.', ''], ['Chen', 'Rong', ''], ['Herskovits', 'Edward H.', '']]","['Connectivity-based brain parcellation', 'Structural brain network', 'Spectral clustering', 'Network analysis', 'Spectral analysis']"
18723,1701.03186,Guodong Shi,Bo Li and Guodong Shi,Feedback Capacity over Networks,,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate the fundamental limitations of feedback
mechanism in dealing with uncertainties for network systems. The study of
maximum capability of feedback control was pioneered in Xie and Guo (2000) for
scalar systems with nonparametric nonlinear uncertainty. In a network setting,
nodes with unknown and nonlinear dynamics are interconnected through a directed
interaction graph. Nodes can design feedback controls based on all available
information, where the objective is to stabilize the network state. Using
information structure and decision pattern as criteria, we specify three
categories of network feedback laws, namely the
global-knowledge/global-decision, network-flow/local-decision, and
local-flow/local-decision feedback. We establish a series of network capacity
characterizations for these three fundamental types of network control laws.
First of all, we prove that for global-knowledge/global-decision and
network-flow/local-decision control where nodes know the information flow
across the entire network, there exists a critical number
$\big(3/2+\sqrt{2}\big)/\|A_{\mathrm{G}}\|_\infty$, where $3/2+\sqrt{2}$ is as
known as the Xie-Guo constant and $A_{\mathrm{G}}$ is the network adjacency
matrix, defining exactly how much uncertainty in the node dynamics can be
overcome by feedback. Interestingly enough, the same feedback capacity can be
achieved under max-consensus enhanced local flows where nodes only observe
information flows from neighbors as well as extreme (max and min) states in the
network. Next, for local-flow/local-decision control, we prove that there
exists a structure-determined value being a lower bound of the network feedback
capacity. These results reveal the important connection between network
structure and fundamental capabilities of in-network feedback control.
","[{'version': 'v1', 'created': 'Wed, 11 Jan 2017 23:00:06 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Jan 2018 16:17:50 GMT'}]",2018-01-11,"[['Li', 'Bo', ''], ['Shi', 'Guodong', '']]","['adaptive control', 'nonlinear systems', 'feedback mechanism', 'network systems']"
18724,1610.02228,Wanita Sherchan,"Wanita Sherchan, Shaila Pervin, Christopher J. Butler, Jennifer C. Lai",Project ACT: Social Media Analytics in Disaster Response,,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In large-scale emergencies social media has become a key source of
information for public awareness, government authorities and relief agencies.
However, the sheer volume of data and the low signal-to- noise ratio limit the
effectiveness and the efficiency of using social media as an intelligence
resource. We describe Australian Crisis Tracker (ACT), a tool designed for
agencies responding to large- scale emergency events, to facilitate the
understanding of critical information in Twitter. ACT was piloted by the
Australian Red Cross (ARC) during the 2013-2014 Australian bushfires season.
  Video is available at: https://www.youtube.com/watch?v=Y-1rtNFqQbE
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2016 11:27:16 GMT'}]",2016-10-10,"[['Sherchan', 'Wanita', ''], ['Pervin', 'Shaila', ''], ['Butler', 'Christopher J.', ''], ['Lai', 'Jennifer C.', '']]","['associated with natural disasters', 'such as flood', 'fire', 'bushfire', 'hurricane', 'ambulance', 'etc']"
18725,1512.02791,Yves Bertot,"Sophie Bernard (MARELLE), Yves Bertot (MARELLE), Laurence Rideau
  (MARELLE), Pierre-Yves Strub","Formal Proofs of Transcendence for e and $\pi$ as an Application of
  Multivariate and Symmetric Polynomials","in Jeremy Avigad and Adam Chlipala. Certified Programs and Proofs,
  Jan 2016, St Petersburg, Florida, United States. ACM Press, pp.12, 2016",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe the formalisation in Coq of a proof that the numbers e and $\pi$
are transcendental. This proof lies at the interface of two domains of
mathematics that are often considered separately: calculus (real and elementary
complex analysis) and algebra. For the work on calculus, we rely on the
Coquelicot library and for the work on algebra, we rely on the Mathematical
Components library. Moreover, some of the elements of our formalized proof
originate in the more ancient library for real numbers included in the Coq
distribution. The case of $\pi$ relies extensively on properties of
multivariate polynomials and this experiment was also an occasion to put to
test a newly developed library for these multivariate polynomials.
","[{'version': 'v1', 'created': 'Wed, 9 Dec 2015 08:53:42 GMT'}]",2015-12-10,"[['Bernard', 'Sophie', '', 'MARELLE'], ['Bertot', 'Yves', '', 'MARELLE'], ['Rideau', 'Laurence', '', 'MARELLE'], ['Strub', 'Pierre-Yves', '']]","['Coq', 'Proof Assistant', 'Formal Mathematics', 'Transcendence', 'Multivariate Polynomials']"
18726,1702.01280,Travis Gagie,"Lu\'is Cunha, Simone Dantas, Travis Gagie, Roland Wittler, Luis Kowada
  and Jens Stoye",Fast and Simple Jumbled Indexing for Binary RLE Strings,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Important papers have appeared recently on the problem of indexing binary
strings for jumbled pattern matching, and further lowering the time bounds in
terms of the input size would now be a breakthrough with broad implications. We
can still make progress on the problem, however, by considering other natural
parameters. Badkobeh et al.\ (IPL, 2013) and Amir et al.\ (TCS, 2016) gave
algorithms that index a binary string in $O (n + \rho^2 \log \rho)$ time, where
$n$ is the length and $\rho$ is the number of runs, and Giaquinta and Grabowski
(IPL, 2013) gave one that runs in $O (n + \rho^2)$ time. In this paper we
propose a new and very simple algorithm that also runs in $O(n + \rho^2)$ time
and can be extended either so that the index returns the position of a match
(if there is one), or so that the algorithm uses only $O (n)$ bits of space.
","[{'version': 'v1', 'created': 'Sat, 4 Feb 2017 12:15:06 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Feb 2017 12:24:33 GMT'}]",2017-02-15,"[['Cunha', 'Luís', ''], ['Dantas', 'Simone', ''], ['Gagie', 'Travis', ''], ['Wittler', 'Roland', ''], ['Kowada', 'Luis', ''], ['Stoye', 'Jens', '']]","['string algorithms', 'indexing', 'jumbled pattern matching', 'run-length enconding']"
18727,1306.1861,Elli Zavou,"Antonio Fern\'andez Anta and Chryssis Georgiou and Dariusz R. Kowalski
  and Elli Zavou","Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for
  Energy",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consider a system in which tasks of different execution times arrive
continuously and have to be executed by a set of processors that are prone to
crashes and restarts. In this paper we model and study the impact of
parallelism and failures on the competitiveness of such an online system. In a
fault-free environment, a simple Longest-in-System scheduling policy, enhanced
by a redundancy-avoidance mechanism, guarantees optimality in a long-term
execution. In the presence of failures though, scheduling becomes a much more
challenging task. In particular, no parallel deterministic algorithm can be
competitive against an offline optimal solution, even with one single processor
and tasks of only two different execution times. We find that when additional
energy is provided to the system in the form of processor speedup, the
situation changes. Specifically, we identify thresholds on the speedup under
which such competitiveness cannot be achieved by any deterministic algorithm,
and above which competitive algorithms exist. Finally, we propose algorithms
that achieve small bounded competitive ratios when the speedup is over the
threshold.
","[{'version': 'v1', 'created': 'Sat, 8 Jun 2013 00:34:57 GMT'}]",2013-06-11,"[['Anta', 'Antonio Fernández', ''], ['Georgiou', 'Chryssis', ''], ['Kowalski', 'Dariusz R.', ''], ['Zavou', 'Elli', '']]","['Scheduling', 'Non-uniform Tasks', 'Failures', 'Competitiveness', 'Online Algorithms', 'Energy Efficiency']"
18728,1603.00060,Adrian Dumitrescu,"Kevin Balas, Adrian Dumitrescu, and Csaba D. T\'oth",Anchored Rectangle and Square Packings,"33 pages, 20 figures",,,,cs.CG math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For points $p_1,\ldots , p_n$ in the unit square $[0,1]^2$, an \emph{anchored
rectangle packing} consists of interior-disjoint axis-aligned empty rectangles
$r_1,\ldots , r_n\subseteq [0,1]^2$ such that point $p_i$ is a corner of the
rectangle $r_i$ (that is, $r_i$ is \emph{anchored} at $p_i$) for $i=1,\ldots,
n$. We show that for every set of $n$ points in $[0,1]^2$, there is an anchored
rectangle packing of area at least $7/12-O(1/n)$, and for every $n\in
\mathbf{N}$, there are point sets for which the area of every anchored
rectangle packing is at most $2/3$. The maximum area of an anchored
\emph{square} packing is always at least $5/32$ and sometimes at most $7/27$.
  The above constructive lower bounds immediately yield constant-factor
approximations, of $7/12 -\varepsilon$ for rectangles and $5/32$ for squares,
for computing anchored packings of maximum area in $O(n\log n)$ time. We prove
that a simple greedy strategy achieves a $9/47$-approximation for anchored
square packings, and $1/3$ for lower-left anchored square packings. Reductions
to maximum weight independent set (MWIS) yield a QPTAS and a PTAS for anchored
rectangle and square packings in $n^{O(1/\varepsilon)}$ and $\exp({\rm
poly}(\log (n/\varepsilon)))$ time, respectively.
","[{'version': 'v1', 'created': 'Mon, 29 Feb 2016 21:44:01 GMT'}]",2016-03-02,"[['Balas', 'Kevin', ''], ['Dumitrescu', 'Adrian', ''], ['Tóth', 'Csaba D.', '']]","['Rectangle packing', 'anchored rectangle', 'greedy algorithm', 'charging scheme', 'approximation algorithm']"
18729,1502.05100,Shouhuai Xu Shouhuai Xu,Shouhuai Xu,Cybersecurity Dynamics,2 pages,HotSoS'2014,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore the emerging field of {\em Cybersecurity Dynamics}, a candidate
foundation for the Science of Cybersecurity.
","[{'version': 'v1', 'created': 'Wed, 18 Feb 2015 01:59:08 GMT'}]",2015-02-19,"[['Xu', 'Shouhuai', '']]","['Cybersecurity dynamics', 'security model', 'security analysis']"
18730,1304.7282,Urmila Shrawankar Ms,"Priti Saktel, Urmila Shrawankar",An Improved Approach for Word Ambiguity Removal,"Pages:12 Tables: 07 Figures: 14, International Journal of Human
  Computer Interaction (IJHCI), Volume (3): Issue (3): 2012",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Word ambiguity removal is a task of removing ambiguity from a word, i.e.
correct sense of word is identified from ambiguous sentences. This paper
describes a model that uses Part of Speech tagger and three categories for word
sense disambiguation (WSD). Human Computer Interaction is very needful to
improve interactions between users and computers. For this, the Supervised and
Unsupervised methods are combined. The WSD algorithm is used to find the
efficient and accurate sense of a word based on domain information. The
accuracy of this work is evaluated with the aim of finding best suitable domain
of word.
","[{'version': 'v1', 'created': 'Thu, 25 Apr 2013 10:25:41 GMT'}]",2013-04-30,"[['Saktel', 'Priti', ''], ['Shrawankar', 'Urmila', '']]","['Human Computer Interaction', 'Supervised Training', 'Unsupervised Learning', 'Word Ambiguity', 'Word sense disambiguation']"
18731,1710.03383,Cheng-Bin Jin,"Cheng-Bin Jin, Shengzhe Li, and Hakil Kim","Real-Time Action Detection in Video Surveillance using Sub-Action
  Descriptor with Multi-CNN","29 pages, 16 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When we say a person is texting, can you tell the person is walking or
sitting? Emphatically, no. In order to solve this incomplete representation
problem, this paper presents a sub-action descriptor for detailed action
detection. The sub-action descriptor consists of three levels: the posture, the
locomotion, and the gesture level. The three levels give three sub-action
categories for one action to address the representation problem. The proposed
action detection model simultaneously localizes and recognizes the actions of
multiple individuals in video surveillance using appearance-based temporal
features with multi-CNN. The proposed approach achieved a mean average
precision (mAP) of 76.6% at the frame-based and 83.5% at the video-based
measurement on the new large-scale ICVL video surveillance dataset that the
authors introduce and make available to the community with this paper.
Extensive experiments on the benchmark KTH dataset demonstrate that the
proposed approach achieved better performance, which in turn boosts the action
recognition performance over the state-of-the-art. The action detection model
can run at around 25 fps on the ICVL and more than 80 fps on the KTH dataset,
which is suitable for real-time surveillance applications.
","[{'version': 'v1', 'created': 'Tue, 10 Oct 2017 02:50:37 GMT'}]",2017-10-11,"[['Jin', 'Cheng-Bin', ''], ['Li', 'Shengzhe', ''], ['Kim', 'Hakil', '']]","['sub-action descriptor', 'action detection', 'video surveillance', 'convolutional neural network', 'multi-CNN']"
18732,1606.07161,Hongxi Tong,Hongxi Tong and Xiaoqing Wang,New MDS Euclidean and Hermitian self-dual codes over finite fields,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we construct MDS Euclidean self-dual codes which are extended
cyclic duadic codes.
  And we obtain many new MDS Euclidean self-dual codes. We also construct MDS
Hermitian self-dual codes from generalized Reed-Solomon codes and constacyclic
codes. And we give some results on Hermitian self-dual codes, which are the
extended cyclic duadic codes.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2016 02:01:18 GMT'}]",2016-06-24,"[['Tong', 'Hongxi', ''], ['Wang', 'Xiaoqing', '']]","['MDS Euclidean self-dual codes', 'MDS Hermitian self-dual codes', 'constacyclic codes', 'cyclic duadic codes', 'generalized Reed-Solomon codes']"
18733,1306.0090,Imen Ayachi,"I. Ayachi (1),(2), R. Kammarti (2), M. Ksouri (2), P. Borne (1) (1)
  Lagis Ecole Centrale de Lille (2) Lacs Ecole Nationale des Ingenieurs de
  Tunis",Harmony search algorithm for the container storage problem,"7 pages, 8th International Conference of Modeling and Simulation -
  MOSIM 10 - May 10-12, 2010 - Hammamet - Tunisia. arXiv admin note: text
  overlap with arXiv:1305.7254",,,,cs.NE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Recently a new metaheuristic called harmony search was developed. It mimics
the behaviors of musicians improvising to find the better state harmony. In
this paper, this algorithm is described and applied to solve the container
storage problem in the harbor. The objective of this problem is to determine a
valid containers arrangement, which meets customers delivery deadlines, reduces
the number of container rehandlings and minimizes the ship idle time. In this
paper, an adaptation of the harmony search algorithm to the container storage
problem is detailed and some experimental results are presented and discussed.
The proposed approach was compared to a genetic algorithm previously applied to
the same problem and recorded a good results.
","[{'version': 'v1', 'created': 'Sat, 1 Jun 2013 09:44:01 GMT'}]",2013-06-04,"[['Ayachi', 'I.', ''], ['Kammarti', 'R.', ''], ['Ksouri', 'M.', ''], ['Borne', 'P.', ''], ['de Lille', 'Lagis Ecole Centrale', ''], ['de Tunis', 'Lacs Ecole Nationale des Ingenieurs', '']]","['Harmony search', 'transport scheduling', 'metaheuristic', 'optimization', 'container storage']"
18734,0705.1209,Tshilidzi Marwala,"E. Habtemariam, T. Marwala and M. Lagazio",Artificial Intelligence for Conflict Management,20 pages,,,,cs.AI,,"  Militarised conflict is one of the risks that have a significant impact on
society. Militarised Interstate Dispute (MID) is defined as an outcome of
interstate interactions, which result on either peace or conflict. Effective
prediction of the possibility of conflict between states is an important
decision support tool for policy makers. In a previous research, neural
networks (NNs) have been implemented to predict the MID. Support Vector
Machines (SVMs) have proven to be very good prediction techniques and are
introduced for the prediction of MIDs in this study and compared to neural
networks. The results show that SVMs predict MID better than NNs while NNs give
more consistent and easy to interpret sensitivity analysis than SVMs.
","[{'version': 'v1', 'created': 'Wed, 9 May 2007 05:53:30 GMT'}]",2007-05-23,"[['Habtemariam', 'E.', ''], ['Marwala', 'T.', ''], ['Lagazio', 'M.', '']]","['Militarised Interstate Disputes', 'Support vector machines', 'Artificial Neural Networks']"
18735,1710.01516,Stefano Leucci,"Davide Bil\`o, Feliciano Colella, Luciano Gual\`a, Stefano Leucci,
  Guido Proietti","An Improved Algorithm for Computing All the Best Swap Edges of a Tree
  Spanner","17 pages, 4 figures, ISAAC 2017",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A tree $\sigma$-spanner of a positively real-weighted $n$-vertex and $m$-edge
undirected graph $G$ is a spanning tree $T$ of $G$ which approximately
preserves (i.e., up to a multiplicative stretch factor $\sigma$) distances in
$G$. Tree spanners with provably good stretch factors find applications in
communication networks, distributed systems, and network design. However,
finding an optimal or even a good tree spanner is a very hard computational
task. Thus, if one has to face a transient edge failure in $T$, the overall
effort that has to be afforded to rebuild a new tree spanner (i.e.,
computational costs, set-up of new links, updating of the routing tables, etc.)
can be rather prohibitive. To circumvent this drawback, an effective
alternative is that of associating with each tree edge a best possible (in
terms of resulting stretch) swap edge -- a well-established approach in the
literature for several other tree topologies. Correspondingly, the problem of
computing all the best swap edges of a tree spanner is a challenging
algorithmic problem, since solving it efficiently means to exploit the
structure of shortest paths not only in $G$, but also in all the scenarios in
which an edge of $T$ has failed. For this problem we provide a very efficient
solution, running in $O(n^2 \log^4 n)$ time, which drastically improves (almost
by a quadratic factor in $n$ in dense graphs!) on the previous known best
result.
","[{'version': 'v1', 'created': 'Wed, 4 Oct 2017 09:30:06 GMT'}]",2017-10-05,"[['Bilò', 'Davide', ''], ['Colella', 'Feliciano', ''], ['Gualà', 'Luciano', ''], ['Leucci', 'Stefano', ''], ['Proietti', 'Guido', '']]","['Transient edge failure', 'Swap algorithm', 'Tree spanner']"
18736,1002.1179,Vishal Goyal,"Kamran Ahsan, Hanifa Shah, Paul Kingston",RFID Applications: An Introductory and Exploratory Study,"International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 3, January 2010,
  http://ijcsi.org/articles/RFID-Applications-An-Introductory-and-Exploratory-Study.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 3, January 2010,
  http://ijcsi.org/articles/RFID-Applications-An-Introductory-and-Exploratory-Study.php",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  RFID is not a new technology and has passed through many decades of use in
military, airline, library, security, healthcare, sports, animal farms and
other areas. Industries use RFID for various applications such as
personal/vehicle access control, departmental store security, equipment
tracking, baggage, fast food establishments, logistics, etc. The enhancement in
RFID technology has brought advantages that are related to resource
optimization, increased efficiency within business processes, and enhanced
customer care, overall improvements in business operations and healthcare. Our
research is part of a big project; its aim is to produce a model for mobile
technology implementation of hospital patients' movement process. However, the
focus of this paper is to explore the main RFID components, i.e. the tag,
antenna and reader. The results of the investigations conducted on the three
RFID components will be used to develop our research model.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 10:18:14 GMT'}]",2010-02-08,"[['Ahsan', 'Kamran', ''], ['Shah', 'Hanifa', ''], ['Kingston', 'Paul', '']]","['RFID technology', 'RFID discovery', 'RFID components', 'RFID applications', 'RFID in healthcare']"
18737,1208.4147,Yingzhen Li,Yingzhen Li and Ye Zhang,"Generating ordered list of Recommended Items: a Hybrid Recommender
  System of Microblog",7 pages,,,,cs.IR cs.LG cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Precise recommendation of followers helps in improving the user experience
and maintaining the prosperity of twitter and microblog platforms. In this
paper, we design a hybrid recommender system of microblog as a solution of KDD
Cup 2012, track 1 task, which requires predicting users a user might follow in
Tencent Microblog. We describe the background of the problem and present the
algorithm consisting of keyword analysis, user taxonomy, (potential)interests
extraction and item recommendation. Experimental result shows the high
performance of our algorithm. Some possible improvements are discussed, which
leads to further study.
","[{'version': 'v1', 'created': 'Tue, 21 Aug 2012 00:28:32 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Sep 2012 06:37:49 GMT'}, {'version': 'v3', 'created': 'Fri, 27 Nov 2015 22:55:51 GMT'}]",2015-12-01,"[['Li', 'Yingzhen', ''], ['Zhang', 'Ye', '']]","['KDD Cup', 'keyword analysis', 'hybrid recommender system']"
18738,0712.0616,Jinshan Zhang,Jinshan Zhang,Upper Bounds for the Number of Hamiltonian Cycles,8 pages,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An upper bound for the number of Hamiltonian cycles of symmetric diagraphs is
established first in this paper, which is tighter than the famous Minc's bound
and the Br$\acute{e}$gman's bound. A transformation on graphs is proposed, so
that counting the number of Hamiltonian cycles of an undirected graph can be
done by counting the number of Hamiltonian cycles of its corresponding
symmetric directed graph. In this way, an upper bound for the number of
Hamiltonian cycles of undirected graphs is also obtained.
","[{'version': 'v1', 'created': 'Tue, 4 Dec 2007 21:16:11 GMT'}, {'version': 'v2', 'created': 'Sun, 20 Jan 2008 19:29:44 GMT'}, {'version': 'v3', 'created': 'Tue, 22 Jan 2008 11:17:29 GMT'}, {'version': 'v4', 'created': 'Fri, 25 Jan 2008 05:37:57 GMT'}, {'version': 'v5', 'created': 'Sat, 6 Dec 2008 02:23:55 GMT'}]",2008-12-06,"[['Zhang', 'Jinshan', '']]","['Hamiltonian cycle', 'NP-complete', 'counting', '#P-complete']"
18739,1707.09813,Shubham Jain,"Jay Patravali, Shubham Jain and Sasank Chilamkurthy",2D-3D Fully Convolutional Neural Networks for Cardiac MR Segmentation,Accepted in STACOM '17,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we develop a 2D and 3D segmentation pipelines for fully
automated cardiac MR image segmentation using Deep Convolutional Neural
Networks (CNN). Our models are trained end-to-end from scratch using the ACD
Challenge 2017 dataset comprising of 100 studies, each containing Cardiac MR
images in End Diastole and End Systole phase. We show that both our
segmentation models achieve near state-of-the-art performance scores in terms
of distance metrics and have convincing accuracy in terms of clinical
parameters. A comparative analysis is provided by introducing a novel dice loss
function and its combination with cross entropy loss. By exploring different
network structures and comprehensive experiments, we discuss several key
insights to obtain optimal model performance, which also is central to the
theme of this challenge.
","[{'version': 'v1', 'created': 'Mon, 31 Jul 2017 12:17:23 GMT'}]",2017-08-01,"[['Patravali', 'Jay', ''], ['Jain', 'Shubham', ''], ['Chilamkurthy', 'Sasank', '']]","['Deep Learning', 'Medical Image Analysis', 'Computer Vision', 'MR Segmentation']"
18740,1206.0142,Hicham Elasri,"Hicham Elasri, Neknane Mehdi, Aatab Jamila and Ganoun Karima",Open source based cadastral information system : ANCFCC-MOROCCO,"International conference of GIS users, May 23-24, 2012, Fez (Morocco)",,,,cs.OH,http://creativecommons.org/licenses/by/3.0/,"  This present project is developing a geographic information system to support
the cadastral business. This system based on open source solutions which
developed within the National Agency of Land Registry, Cadastre and Cartography
(ANCFCC) enabling monitoring and analysis of cadastral procedures as well as
offering consumable services by other information systems: consultation and
querying spatial data. The project will also assist the various user profiles
in the completion of production tasks and the possibility to eliminate the
deficiencies identified to ensure an optimum level of productivity
","[{'version': 'v1', 'created': 'Fri, 1 Jun 2012 10:42:20 GMT'}]",2012-06-13,"[['Elasri', 'Hicham', ''], ['Mehdi', 'Neknane', ''], ['Jamila', 'Aatab', ''], ['Karima', 'Ganoun', '']]","['GIS', 'gvSIG', 'Cadastre']"
18741,1701.03670,Luc Dartois,Luc Dartois and Emmanuel Filiot and Nathan Lhote,Logics for Word Transductions with Synthesis,10 pages + appendix,,,,cs.FL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a logic, called LT, to express properties of transductions, i.e.
binary relations from input to output (finite) words. In LT, the input/output
dependencies are modelled via an origin function which associates to any
position of the output word, the input position from which it originates. LT is
well-suited to express relations (which are not necessarily functional), and
can express all regular functional transductions, i.e. transductions definable
for instance by deterministic two-way transducers. Despite its high expressive
power, LT has decidable satisfiability and equivalence problems, with tight
non-elementary and elementary complexities, depending on specific
representation of LT-formulas. Our main contribution is a synthesis result:
from any transduction R defined in LT , it is possible to synthesise a regular
functional transduction f such that for all input words u in the domain of R, f
is defined and (u,f(u)) belongs to R. As a consequence, we obtain that any
functional transduction is regular iff it is LT-definable. We also investigate
the algorithmic and expressiveness properties of several extensions of LT, and
explicit a correspondence between transductions and data words. As a
side-result, we obtain a new decidable logic for data words.
","[{'version': 'v1', 'created': 'Fri, 13 Jan 2017 13:57:07 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Feb 2017 12:32:45 GMT'}, {'version': 'v3', 'created': 'Tue, 26 Sep 2017 11:43:43 GMT'}, {'version': 'v4', 'created': 'Wed, 30 May 2018 11:35:47 GMT'}]",2018-05-31,"[['Dartois', 'Luc', ''], ['Filiot', 'Emmanuel', ''], ['Lhote', 'Nathan', '']]","['Transductions', 'Origin', 'Logic', 'Synthesis', 'Data words']"
18742,1708.01162,Alex Olieman,"Alex Olieman, Kaspar Beelen, Milan van Lange, Jaap Kamps, and Maarten
  Marx","Good Applications for Crummy Entity Linkers? The Case of Corpus
  Selection in Digital Humanities",Accepted for presentation at SEMANTiCS '17,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the last decade we have made great progress in entity linking (EL)
systems, but performance may vary depending on the context and, arguably, there
are even principled limitations preventing a ""perfect"" EL system. This also
suggests that there may be applications for which current ""imperfect"" EL is
already very useful, and makes finding the ""right"" application as important as
building the ""right"" EL system. We investigate the Digital Humanities use case,
where scholars spend a considerable amount of time selecting relevant source
texts. We developed WideNet; a semantically-enhanced search tool which
leverages the strengths of (imperfect) EL without getting in the way of its
expert users. We evaluate this tool in two historical case-studies aiming to
collect a set of references to historical periods in parliamentary debates from
the last two decades; the first targeted the Dutch Golden Age, and the second
World War II. The case-studies conclude with a critical reflection on the
utility of WideNet for this kind of research, after which we outline how such a
real-world application can help to improve EL technology in general.
","[{'version': 'v1', 'created': 'Thu, 3 Aug 2017 14:35:53 GMT'}]",2017-08-04,"[['Olieman', 'Alex', ''], ['Beelen', 'Kaspar', ''], ['van Lange', 'Milan', ''], ['Kamps', 'Jaap', ''], ['Marx', 'Maarten', '']]","['Entity Linking Evaluation', 'Real-World Applications', 'Semantically-Enhanced Search', 'Interactive Information Retrieval', 'Corpus Selection', 'Digital Humanities']"
18743,1511.06063,Nirav Bhatt,"P Satya Jayadev, Aravind Rajeswaran, Nirav P Bhatt, Ramkrishna
  Pasumarthy","A Novel Approach for Phase Identification in Smart Grids Using Graph
  Theory and Principal Component Analysis",Accepted for the presentation at ACC 16,,,,cs.LG stat.AP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consumers with low demand, like households, are generally supplied
single-phase power by connecting their service mains to one of the phases of a
distribution transformer. The distribution companies face the problem of
keeping a record of consumer connectivity to a phase due to uninformed changes
that happen. The exact phase connectivity information is important for the
efficient operation and control of distribution system. We propose a new data
driven approach to the problem based on Principal Component Analysis (PCA) and
its Graph Theoretic interpretations, using energy measurements in equally timed
short intervals, generated from smart meters. We propose an algorithm for
inferring phase connectivity from noisy measurements. The algorithm is
demonstrated using simulated data for phase connectivities in distribution
networks.
","[{'version': 'v1', 'created': 'Thu, 19 Nov 2015 05:39:16 GMT'}, {'version': 'v2', 'created': 'Tue, 7 Jun 2016 14:31:29 GMT'}]",2016-06-08,"[['Jayadev', 'P Satya', ''], ['Rajeswaran', 'Aravind', ''], ['Bhatt', 'Nirav P', ''], ['Pasumarthy', 'Ramkrishna', '']]","['Power Distribution Networks', 'Smart Meters', 'Phase Identification', 'Principle Component Analysis']"
18744,1802.06816,Nilaksh Das,"Nilaksh Das, Madhuri Shanbhogue, Shang-Tse Chen, Fred Hohman, Siwei
  Li, Li Chen, Michael E. Kounavis, Duen Horng Chau","Shield: Fast, Practical Defense and Vaccination for Deep Learning using
  JPEG Compression",under review at KDD'18,,,,cs.CV cs.AI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rapidly growing body of research in adversarial machine learning has
demonstrated that deep neural networks (DNNs) are highly vulnerable to
adversarially generated images. This underscores the urgent need for practical
defense that can be readily deployed to combat attacks in real-time. Observing
that many attack strategies aim to perturb image pixels in ways that are
visually imperceptible, we place JPEG compression at the core of our proposed
Shield defense framework, utilizing its capability to effectively ""compress
away"" such pixel manipulation. To immunize a DNN model from artifacts
introduced by compression, Shield ""vaccinates"" a model by re-training it with
compressed images, where different compression levels are applied to generate
multiple vaccinated models that are ultimately used together in an ensemble
defense. On top of that, Shield adds an additional layer of protection by
employing randomization at test time that compresses different regions of an
image using random compression levels, making it harder for an adversary to
estimate the transformation performed. This novel combination of vaccination,
ensembling, and randomization makes Shield a fortified multi-pronged
protection. We conducted extensive, large-scale experiments using the ImageNet
dataset, and show that our approaches eliminate up to 94% of black-box attacks
and 98% of gray-box attacks delivered by the recent, strongest attacks, such as
Carlini-Wagner's L2 and DeepFool. Our approaches are fast and work without
requiring knowledge about the model.
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 19:13:42 GMT'}]",2018-02-21,"[['Das', 'Nilaksh', ''], ['Shanbhogue', 'Madhuri', ''], ['Chen', 'Shang-Tse', ''], ['Hohman', 'Fred', ''], ['Li', 'Siwei', ''], ['Chen', 'Li', ''], ['Kounavis', 'Michael E.', ''], ['Chau', 'Duen Horng', '']]","['Adversarial machine learning', 'JPEG compression', 'stochastic ensemble defense', 'deep learning']"
18745,0909.4369,Bernard Mans,"Paola Flocchini, Bernard Mans and Nicola Santoro",Exploration of Periodically Varying Graphs,"22 pages. Shorter paper (10 pages) accepted at ISAAC 2009. ISAAC'09,
  The 20th International Symposium on Algorithms and Computation, December
  16-18, 2008, Hawaii, USA. Exploration of Periodically Varying Graphs, P.
  Flocchini, B. Mans and N. Santoro, Springer-LNCS vol. 5878, accepted Aug.
  2009, Y. Dong, D.-Z. Du, and O. Ibarra (Eds), to appear",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the computability and complexity of the exploration problem in a
class of highly dynamic graphs: periodically varying (PV) graphs, where the
edges exist only at some (unknown) times defined by the periodic movements of
carriers. These graphs naturally model highly dynamic infrastructure-less
networks such as public transports with fixed timetables, low earth orbiting
(LEO) satellite systems, security guards' tours, etc. We establish necessary
conditions for the problem to be solved. We also derive lower bounds on the
amount of time required in general, as well as for the PV graphs defined by
restricted classes of carriers movements: simple routes, and circular routes.
We then prove that the limitations on computability and complexity we have
established are indeed tight. In fact we prove that all necessary conditions
are also sufficient and all lower bounds on costs are tight. We do so
constructively presenting two worst case optimal solution algorithms, one for
anonymous systems, and one for those with distinct nodes ids. An added benefit
is that the algorithms are rather simple.
","[{'version': 'v1', 'created': 'Thu, 24 Sep 2009 06:01:25 GMT'}]",2009-09-25,"[['Flocchini', 'Paola', ''], ['Mans', 'Bernard', ''], ['Santoro', 'Nicola', '']]","['time-varying graphs', 'exploration', 'dynamic networks', 'evolving graphs', 'traversal', 'mobile networks']"
18746,1501.04925,Sayan Mitra Sayan Mitra,Zhenqi Huang and Yu Wang and Sayan Mitra and Geir Dullerud,Controller Synthesis for Linear Time-varying Systems with Adversaries,10 pages 4 figures; under submission for review,,,,cs.SY cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a controller synthesis algorithm for a discrete time reach-avoid
problem in the presence of adversaries. Our model of the adversary captures
typical malicious attacks envisioned on cyber-physical systems such as sensor
spoofing, controller corruption, and actuator intrusion. After formulating the
problem in a general setting, we present a sound and complete algorithm for the
case with linear dynamics and an adversary with a budget on the total L2-norm
of its actions. The algorithm relies on a result from linear control theory
that enables us to decompose and precisely compute the reachable states of the
system in terms of a symbolic simulation of the adversary-free dynamics and the
total uncertainty induced by the adversary. With this decomposition, the
synthesis problem eliminates the universal quantifier on the adversary's
choices and the symbolic controller actions can be effectively solved using an
SMT solver. The constraints induced by the adversary are computed by solving
second-order cone programmings. The algorithm is later extended to synthesize
state-dependent controller and to generate attacks for the adversary. We
present preliminary experimental results that show the effectiveness of this
approach on several example problems.
","[{'version': 'v1', 'created': 'Sun, 18 Jan 2015 21:47:11 GMT'}]",2015-01-21,"[['Huang', 'Zhenqi', ''], ['Wang', 'Yu', ''], ['Mitra', 'Sayan', ''], ['Dullerud', 'Geir', '']]","['Cyber-physical security', 'constraint-based synthesis', 'controllersynthesis']"
18747,0804.1187,Marianne Viallet,"Marianne Viallet (LTDS), G\'erald Poum\'erol, Olivier Dessombz (LTDS),
  Louis Jezequel (LTDS)",M\'ethode de calcul du rayonnement acoustique de structures complexes,,"Dans Actes du huiti\`eme colloque national en Calcul des
  structures - GIENS 2007 - Huiti\`eme colloque national en Calcul des
  structures, Giens : France (2007)",,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the automotive industry, predicting noise during design cycle is a
necessary step. Well-known methods exist to answer this issue in low frequency
domain. Among these, Finite Element Methods, adapted to closed domains, are
quite easy to implement whereas Boundary Element Methods are more adapted to
infinite domains, but may induce singularity problems. In this article, the
described method, the SDM, allows to use both methods in their best application
domain. A new method is also presented to solve the SDM exterior problem.
Instead of using Boundary Element Methods, an original use of Finite Elements
is made. Efficiency of this new version of the Substructure Deletion Method is
discussed.
","[{'version': 'v1', 'created': 'Tue, 8 Apr 2008 06:24:49 GMT'}]",2008-12-18,"[['Viallet', 'Marianne', '', 'LTDS'], ['Poumérol', 'Gérald', '', 'LTDS'], ['Dessombz', 'Olivier', '', 'LTDS'], ['Jezequel', 'Louis', '', 'LTDS']]","['SDM', 'FEM', 'BEM', 'acoustic radiation', 'geometrically complex structures', 'cloning algorithm', 'infinite substructuring']"
18748,1209.5388,Mohammad Rahman,Atsuko Miyaji and Mohammad Shahriar Rahman,KIMAP: Key-Insulated Mutual Authentication Protocol for RFID,"23 pages. arXiv admin note: substantial text overlap with
  arXiv:1209.5066, arXiv:1209.5076","International Journal of Automated Identification Technology
  (IJAIT), Vol 3, No 2, pp. 61-74, 2011",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  RFID tags are heavily constrained in computational and storage capabilities,
and raise numerous privacy concerns in everyday life due to their vulnerability
to different attacks. Both forward security and backward security are required
to maintain the privacy of a tag i.e., exposure of a tag's secret key should
not reveal the past or future secret keys of the tag. We envisage the need for
a formal model for backward security for RFID protocol designs in shared key
settings, since the RFID tags are too resource-constrained to support public
key settings. However, there has not been much research on backward security
for shared key environment since Serge Vaudenay in his Asiacrypt 2007 paper
showed that perfect backward security is impossible to achieve without public
key settings. We propose a Key-Insulated Mutual Authentication Protocol for
shared key environment, KIMAP, which minimizes the damage caused by secret key
exposure using insulated keys. Even if a tag's secret key is exposed during an
authentication session, forward security and `restricted' backward security of
the tag are preserved under our assumptions. The notion of `restricted'
backward security is that the adversary misses the protocol transcripts which
are needed to update the compromised secret key. Although our definition does
not capture perfect backward security, it is still suitable for effective
implementation as the tags are highly mobile in practice. We also provide a
formal security model of KIMAP. Our scheme is more efficient than previous
proposals from the viewpoint of computational requirements.
","[{'version': 'v1', 'created': 'Sun, 23 Sep 2012 15:07:04 GMT'}]",2012-09-26,"[['Miyaji', 'Atsuko', ''], ['Rahman', 'Mohammad Shahriar', '']]","['Mutual Authentication', 'Privacy', 'Restricted Backward Security', 'Indistinguishability', 'Forward Security']"
18749,1303.6512,Ruchika Thukral Ms,Ruchika Thukral and Anita Goel,Web Service Interface for Data Collection,"6 pages, 3 figures, International Journal in computer Science and
  issues","IJCSI International Journal of Computer Science Issues, Vol. 9,
  Issue 3, No 3, May 2012, IJCSI-9-3-3-525-530",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data collection is a key component of an information system. The widespread
penetration of ICT tools in organizations and institutions has resulted in a
shift in the way the data is collected. Data may be collected in printed-form,
by e-mails, on a compact disk, or, by direct upload on the management
information system. Since web services are platform-independent, it can access
data stored in the XML format from any platform. In this paper, we present an
interface which uses web services for data collection. It requires interaction
between a web service deployed for the purposes of data collection, and the web
address where the data is stored. Our interface requires that the web service
has pre-knowledge of the address from where the data is to be collected. Also,
the data to be accessed must be stored in XML format. Since our interface uses
computer-supported interaction on both sides, it eases the task of regular and
ongoing data collection. We apply our framework to the Education Management
Information System, which collects data from schools spread across the country.
","[{'version': 'v1', 'created': 'Tue, 26 Mar 2013 14:42:13 GMT'}]",2013-03-27,"[['Thukral', 'Ruchika', ''], ['Goel', 'Anita', '']]","['Education Management Information System', 'Web Services', 'XML']"
18750,1306.4090,Chang Liu,"Chang Liu, Fei Song, Huan Yan, Sidong Zhang",Modeling of Multipath Transport,"10 pages, 11 figures","International Journal of Computer Science Issues, Volume 10, Issue
  1, January 2013",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a model for evaluating the transmission performance
of multipath transport. Previous researches focused exclusively on single pair
users in simple scenarios. The distinct perspective in this paper is to build
models for analyzing the performance when multipath transport is used in the
entire network scope. We illustrate the influences on the transmission
performance caused by the variation of network topologies, the services'
arrival rate, the services' size and other parameters. We demonstrate through
simulation that multipath transport could conditionally increase the throughput
than single-path transport. And it has the capability to support higher
services' arrival rate in various network topologies. And higher multi-parent
probability will be beneficial for multipath transport to take its advantages.
","[{'version': 'v1', 'created': 'Tue, 18 Jun 2013 07:34:52 GMT'}]",2013-06-19,"[['Liu', 'Chang', ''], ['Song', 'Fei', ''], ['Yan', 'Huan', ''], ['Zhang', 'Sidong', '']]","['multipath transport', 'service model', 'load balance', 'throughput gain']"
18751,1511.03780,Yong Zheng,Yong Zheng,A User's Guide to CARSKit,,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context-aware recommender systems extend traditional recommenders by adapting
their suggestions to users' contextual situations. CARSKit is a Java-based
open-source library specifically designed for the context-aware recommendation,
where the state-of-the-art context-aware recommendation algorithms have been
implemented. This report provides the basic user's guide to CARSKit, including
how to prepare the data set, how to configure the experimental settings, and
how to evaluate the algorithms, as well as interpreting the outputs. The
instructions in this guide are applicable for CARSKit v0.3.5 and above.
","[{'version': 'v1', 'created': 'Thu, 12 Nov 2015 05:24:35 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Feb 2019 23:46:26 GMT'}]",2019-02-20,"[['Zheng', 'Yong', '']]","['context', 'context-aware recommendation', 'CARSKit', 'user guide']"
18752,1704.06903,Takuto Sakamoto,Hiroki Takikawa and Takuto Sakamoto,"Moral Foundations of Political Discourse: Comparative Analysis of the
  Speech Records of the US Congress and the Japanese Diet","Originally submitted to the 3rd International Conference on
  Computational Social Science (IC2S2), July 10-13, 2017; 4 pages",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There has been a growing body of study on the relationship between
public/political discourse and its moral-emotional foundations. Most of the
studies, however, have been confined to a single country's context, lacking
cross-cultural perspectives. Taking a comparative perspective, we examined the
emotional and moral structures of political and public discussion observed in
the U.S. and Japan by employing extensive text data that cover these two
countries. Specifically, we conducted dictionary-based sentiment and moral
analyses of floor debate in the U.S. Congress and the Japanese Diet over a long
period of time. The analyses revealed intriguing cross-national patterns in the
moral-emotional framework employed in parliamentary deliberations, which cast
doubt on some of the dominant arguments in the field, including, among others,
J. Haidt's moral foundation hypothesis.
","[{'version': 'v1', 'created': 'Sun, 23 Apr 2017 09:44:25 GMT'}]",2017-04-25,"[['Takikawa', 'Hiroki', ''], ['Sakamoto', 'Takuto', '']]","['moral psychology', 'moral foundation theory', 'sentiment analysis', 'natural language processing', 'comparative analysis']"
18753,1701.04537,Xiang Yin,"Zhaojian Li, Tianshu Chu, Ilya V. Kolmanovsky, Xiang Yin, Xunyuan Yin",Cloud Resource Allocation for Cloud-Based Automotive Applications,,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a rapidly growing interest in the use of cloud computing for
automotive vehicles to facilitate computation and data intensive tasks.
Efficient utilization of on-demand cloud resources holds a significant
potential to improve future vehicle safety, comfort, and fuel economy. In the
meanwhile, issues like cyber security and resource allocation pose great
challenges. In this paper, we treat the resource allocation problem for
cloud-based automotive systems. Both private and public cloud paradigms are
considered where a private cloud provides an internal, company-owned internet
service dedicated to its own vehicles while a public cloud serves all
subscribed vehicles. This paper establishes comprehensive models of cloud
resource provisioning for both private and public cloud- based automotive
systems. Complications such as stochastic communication delays and task
deadlines are explicitly considered. In particular, a centralized resource
provisioning model is developed for private cloud and chance constrained
optimization is exploited to utilize the cloud resources for best Quality of
Services. On the other hand, a decentralized auction-based model is developed
for public cloud and reinforcement learning is employed to obtain an optimal
bidding policy for a ""selfish"" agent. Numerical examples are presented to
illustrate the effectiveness of the developed techniques.
","[{'version': 'v1', 'created': 'Tue, 17 Jan 2017 05:48:56 GMT'}]",2017-01-18,"[['Li', 'Zhaojian', ''], ['Chu', 'Tianshu', ''], ['Kolmanovsky', 'Ilya V.', ''], ['Yin', 'Xiang', ''], ['Yin', 'Xunyuan', '']]","['Resource Allocation', 'Vehicle-to-Cloud', 'Chance Constrained Optimization', 'Communication Delays', 'DeepDeterministic Policy Gradient', 'Reinforcement Learning']"
18754,1504.04090,Stephen Tierney,"Stephen Tierney, Yi Guo, Junbin Gao",Segmentation of Subspaces in Sequential Data,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose Ordered Subspace Clustering (OSC) to segment data drawn from a
sequentially ordered union of subspaces. Similar to Sparse Subspace Clustering
(SSC) we formulate the problem as one of finding a sparse representation but
include an additional penalty term to take care of sequential data. We test our
method on data drawn from infrared hyper spectral, video and motion capture
data. Experiments show that our method, OSC, outperforms the state of the art
methods: Spatial Subspace Clustering (SpatSC), Low-Rank Representation (LRR)
and SSC.
","[{'version': 'v1', 'created': 'Thu, 16 Apr 2015 03:18:28 GMT'}]",2015-04-17,"[['Tierney', 'Stephen', ''], ['Guo', 'Yi', ''], ['Gao', 'Junbin', '']]","['sparse', 'subspace', 'clustering', 'sequential', 'ordered']"
18755,1702.03246,Christos Mousas,Christos Mousas,"Towards Developing an Easy-To-Use Scripting Environment for Animating
  Virtual Characters",,,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the three scripting commands and main functionalities of
a novel character animation environment called CHASE. CHASE was developed for
enabling inexperienced programmers, animators, artists, and students to animate
in meaningful ways virtual reality characters. This is achieved by scripting
simple commands within CHASE. The commands identified, which are associated
with simple parameters, are responsible for generating a number of predefined
motions and actions of a character. Hence, the virtual character is able to
animate within a virtual environment and to interact with tasks located within
it. An additional functionality of CHASE is supplied. It provides the ability
to generate multiple tasks of a character, such as providing the user the
ability to generate scenario-related animated sequences. However, since
multiple characters may require simultaneous animation, the ability to script
actions of different characters at the same time is also provided.
","[{'version': 'v1', 'created': 'Fri, 10 Feb 2017 16:37:55 GMT'}]",2017-02-13,"[['Mousas', 'Christos', '']]","['character animation', 'scripting language', 'scriptingactions', 'interactive narrative']"
18756,1401.1488,Zeeshan Bhatti,"Zeeshan Bhatti, Asadullah Shah, Farruh Shahidi, Mostafa Karbasi",Forward and Inverse Kinematics Seamless Matching Using Jacobian,,"Sindh University Research Journal (SURJ) Volume 45 (2), 8/2013,
  pp:387-392, Sindh University Press",,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper the problem of matching Forward Kinematics (FK) motion of a 3
Dimensional (3D) joint chain to the Inverse Kinematics (IK) movement and vice
versa has been addressed. The problem lies at the heart of animating a 3D
character having controller and manipulator based rig for animation within any
3D modeling and animation software. The seamless matching has been achieved
through the use of pseudo-inverse of Jacobian Matrix. The Jacobian Matrix is
used to determine the rotation values of each joint of character body part such
as arms, between the inverse kinematics and forward kinematics motion. Then
moving the corresponding kinematic joint system to the desired place,
automatically eliminating the jumping or popping effect which would reduce the
complexity of the system.
","[{'version': 'v1', 'created': 'Tue, 7 Jan 2014 20:14:55 GMT'}]",2014-01-08,"[['Bhatti', 'Zeeshan', ''], ['Shah', 'Asadullah', ''], ['Shahidi', 'Farruh', ''], ['Karbasi', 'Mostafa', '']]","['Inverse Kinematics', 'Forward Kinematics', 'Jacobian Matrix', 'Animation']"
18757,1501.01178,Benjamin Negrevergne,Benjamin Negrevergne and Tias Guns,Constraint-based sequence mining using constraint programming,"In Integration of AI and OR Techniques in Constraint Programming
  (CPAIOR), 2015",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The goal of constraint-based sequence mining is to find sequences of symbols
that are included in a large number of input sequences and that satisfy some
constraints specified by the user. Many constraints have been proposed in the
literature, but a general framework is still missing. We investigate the use of
constraint programming as general framework for this task. We first identify
four categories of constraints that are applicable to sequence mining. We then
propose two constraint programming formulations. The first formulation
introduces a new global constraint called exists-embedding. This formulation is
the most efficient but does not support one type of constraint. To support such
constraints, we develop a second formulation that is more general but incurs
more overhead. Both formulations can use the projected database technique used
in specialised algorithms. Experiments demonstrate the flexibility towards
constraint-based settings and compare the approach to existing methods.
","[{'version': 'v1', 'created': 'Tue, 6 Jan 2015 13:47:24 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Jan 2015 13:50:53 GMT'}, {'version': 'v3', 'created': 'Wed, 25 Feb 2015 16:31:27 GMT'}]",2015-02-26,"[['Negrevergne', 'Benjamin', ''], ['Guns', 'Tias', '']]","['sequential pattern mining', 'sequence mining', 'episode mining', 'constrained pattern mining', 'constraint programming', 'declarative programming']"
18758,1407.5166,Catalin Dima,C\u{a}t\u{a}lin Dima and Bastien Maubert and Sophie Pinchinat,The Expressive Power of Epistemic $\mu$-Calculus,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While the $\mu$-calculus notoriously subsumes Alternating-time Temporal Logic
(ATL), we show that the epistemic $\mu$-calculus does not subsume ATL with
imperfect information (ATL$_i$) for the synchronous perfect-recall semantics.
To prove this we first establish that jumping parity tree automata (JTA), a
recently introduced extension of alternating parity tree automata, are
expressively equivalent to the epistemic $\mu$-calculus, and this for any
knowledge semantics. Using this result we also show that, for bounded-memory
semantics, the epistemic $\mu$-calculus is not more expressive than the
standard $\mu$-calculus, and that its satisfiability problem is
EXPTIME-complete.
","[{'version': 'v1', 'created': 'Sat, 19 Jul 2014 09:32:49 GMT'}]",2014-07-22,"[['Dima', 'Cătălin', ''], ['Maubert', 'Bastien', ''], ['Pinchinat', 'Sophie', '']]","['Epistemic µ-calculus', 'ATL with imperfect information', 'jumping treeautomata', 'expressiveness']"
18759,1205.6162,Moath Husni,"Faudziah Ahmad, Fauziah Baharom and Moath Husni","Current Web Application Development and Measurement Practices for Small
  Software Firms","5 pages, 2 figures an 9 tables; IJCSI 2012",,,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper discusses issues on current development and measurement practices
that were identified from a pilot study conducted on Jordanian small software
firms. The study was to investigate whether developers follow development and
measurement best practices in web applications development. The analysis was
conducted in two stages: first, grouping the development and measurement
practices using variable clustering, and second, identifying the acceptance
degree. Mean interval was used to determine the degree of acceptance.
Hierarchal clustering was used to group the development and measurement
practices. The actual findings of this survey will be used for building a new
methodology for developing web applications in small software firms.
","[{'version': 'v1', 'created': 'Mon, 28 May 2012 17:05:39 GMT'}]",2012-05-29,"[['Ahmad', 'Faudziah', ''], ['Baharom', 'Fauziah', ''], ['Husni', 'Moath', '']]","['Hierarchal Clustering', 'Measurement', 'Small']"
18760,1401.3148,Rodrigo de Lamare,"S. Xu, R. C. de Lamare and H. V. Poor",Dynamic Topology Adaptation and Distributed Estimation for Smart Grids,"4 figures, 1 table",,,,cs.IT cs.LG math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents new dynamic topology adaptation strategies for
distributed estimation in smart grids systems. We propose a dynamic exhaustive
search--based topology adaptation algorithm and a dynamic sparsity--inspired
topology adaptation algorithm, which can exploit the topology of smart grids
with poor--quality links and obtain performance gains. We incorporate an
optimized combining rule, named Hastings rule into our proposed dynamic
topology adaptation algorithms. Compared with the existing works in the
literature on distributed estimation, the proposed algorithms have a better
convergence rate and significantly improve the system performance. The
performance of the proposed algorithms is compared with that of existing
algorithms in the IEEE 14--bus system.
","[{'version': 'v1', 'created': 'Tue, 14 Jan 2014 11:35:19 GMT'}]",2014-01-16,"[['Xu', 'S.', ''], ['de Lamare', 'R. C.', ''], ['Poor', 'H. V.', '']]","['Dynamic topology adaptation', 'distributed estimation', 'smart grids']"
18761,1502.04341,Nicolai Vorobjov,Nicolai Vorobjov and Andrei Gabrielov,On topological lower bounds for algebraic computation trees,"10 pages, minor editorial corrections",,,,cs.CC math.AT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove that the height of any algebraic computation tree for deciding
membership in a semialgebraic set is bounded from below (up to a multiplicative
constant) by the logarithm of m-th Betti number (with respect to singular
homology) of the set, divided by m+1. This result complements the well known
lower bound by Yao for locally closed semialgebraic sets in terms of the total
Borel-Moore Betti number. We also prove that the height is bounded from below
by the logarithm of m-th Betti number of a projection of the set onto a
coordinate subspace, divided by (m+1)^2. We illustrate these general results by
examples of lower complexity bounds for some specific computational problems.
","[{'version': 'v1', 'created': 'Sun, 15 Feb 2015 18:03:11 GMT'}, {'version': 'v2', 'created': 'Sun, 16 Aug 2015 16:35:06 GMT'}]",2015-08-18,"[['Vorobjov', 'Nicolai', ''], ['Gabrielov', 'Andrei', '']]","['Complexity lower bounds', 'algebraic computation trees', 'semialgebraic sets']"
18762,1406.6298,Konrad Dabrowski,"Konrad K. Dabrowski and Shenwei Huang and Dani\""el Paulusma",Bounding Clique-Width via Perfect Graphs,"22 Pages, 2 figures, An extended abstract of this paper will appear
  in the proceedings of LATA 2015 (LNCS vol. 8977)",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given two graphs $H_1$ and $H_2$, a graph $G$ is $(H_1,H_2)$-free if it
contains no subgraph isomorphic to $H_1$ or $H_2$. We continue a recent study
into the clique-width of $(H_1,H_2)$-free graphs and present three new classes
of $(H_1,H_2)$-free graphs of bounded clique-width and one of unbounded
clique-width. The four new graph classes have in common that one of their two
forbidden induced subgraphs is the diamond (the graph obtained from a clique on
four vertices by deleting one edge). To prove boundedness of clique-width for
the first three cases we develop a technique based on bounding clique covering
number in combination with reduction to subclasses of perfect graphs. We extend
our proof of unboundedness for the fourth case to show that Graph Isomorphism
is Graph Isomorphism-complete on the same graph class. We also show the
implications of our results for the computational complexity of the Colouring
problem restricted to $(H_1,H_2)$-free graphs.
","[{'version': 'v1', 'created': 'Tue, 24 Jun 2014 16:39:56 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Jan 2015 14:38:49 GMT'}]",2015-01-14,"[['Dabrowski', 'Konrad K.', ''], ['Huang', 'Shenwei', ''], ['Paulusma', 'Daniël', '']]","['clique-width', 'forbidden induced subgraphs', 'graph class']"
18763,1306.2906,Yasmine Kawthar Zergat,"Kawthar Yasmine Zergat, Abderrahmane Amrouche",Robust Support Vector Machines for Speaker Verification Task,"5 pages,5 figures",,,,cs.LG cs.SD stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An important step in speaker verification is extracting features that best
characterize the speaker voice. This paper investigates a front-end processing
that aims at improving the performance of speaker verification based on the
SVMs classifier, in text independent mode. This approach combines features
based on conventional Mel-cepstral Coefficients (MFCCs) and Line Spectral
Frequencies (LSFs) to constitute robust multivariate feature vectors. To reduce
the high dimensionality required for training these feature vectors, we use a
dimension reduction method called principal component analysis (PCA). In order
to evaluate the robustness of these systems, different noisy environments have
been used. The obtained results using TIMIT database showed that, using the
paradigm that combines these spectral cues leads to a significant improvement
in verification accuracy, especially with PCA reduction for low signal-to-noise
ratio noisy environment.
","[{'version': 'v1', 'created': 'Wed, 12 Jun 2013 17:32:02 GMT'}]",2013-06-13,"[['Zergat', 'Kawthar Yasmine', ''], ['Amrouche', 'Abderrahmane', '']]","['SVM', 'Noisy environment', 'LSF', 'MFCC', 'PCA']"
18764,1110.3078,Hiroyuki Miyata,"David Avis, Hiroyuki Miyata, Sonoko Moriyama",Families of polytopal digraphs that do not satisfy the shelling property,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A polytopal digraph $G(P)$ is an orientation of the skeleton of a convex
polytope $P$. The possible non-degenerate pivot operations of the simplex
method in solving a linear program over $P$ can be represented as a special
polytopal digraph known as an LP digraph. Presently there is no general
characterization of which polytopal digraphs are LP digraphs, although four
necessary properties are known: acyclicity, unique sink orientation(USO), the
Holt-Klee property and the shelling property. The shelling property was
introduced by Avis and Moriyama (2009), where two examples are given in $d=4$
dimensions of polytopal digraphs satisfying the first three properties but not
the shelling property. The smaller of these examples has $n=7$ vertices. Avis,
Miyata and Moriyama(2009) constructed for each $d \ge 4$ and $n \ge d+2$, a
$d$-polytope $P$ with $n$ vertices which has a polytopal digraph which is an
acyclic USO that satisfies the Holt-Klee property, but does not satisfy the
shelling property. The construction was based on a minimal such example, which
has $d=4$ and $n=6$. In this paper we explore the shelling condition further.
First we give an apparently stronger definition of the shelling property, which
we then prove is equivalent to the original definition. Using this stronger
condition we are able to give a more general construction of such families. In
particular, we show that given any 4-dimensional polytope $P$ with $n_0$
vertices whose unique sink is simple, we can extend $P$ for any $d \ge 4$ and
$n \ge n_0 + d-4$ to a $d$-polytope with these properties that has $n$
vertices. Finally we investigate the strength of the shelling condition for
$d$-crosspolytopes, for which Develin (2004) has given a complete
characterization of LP orientations.
","[{'version': 'v1', 'created': 'Thu, 13 Oct 2011 21:52:18 GMT'}, {'version': 'v2', 'created': 'Sat, 29 Sep 2012 05:18:17 GMT'}]",2012-10-02,"[['Avis', 'David', ''], ['Miyata', 'Hiroyuki', ''], ['Moriyama', 'Sonoko', '']]","['polytopal digraphs', 'simplex method', 'shellability', 'polytopes']"
18765,1004.2968,Jian Li,Jian Li and Ke Yi and Qin Zhang,Clustering with diversity,"Extended abstract accepted in ICALP 2010. Keywords: Approximation
  algorithm, k-center, k-anonymity, l-diversity",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the {\em clustering with diversity} problem: given a set of
colored points in a metric space, partition them into clusters such that each
cluster has at least $\ell$ points, all of which have distinct colors.
  We give a 2-approximation to this problem for any $\ell$ when the objective
is to minimize the maximum radius of any cluster. We show that the
approximation ratio is optimal unless $\mathbf{P=NP}$, by providing a matching
lower bound. Several extensions to our algorithm have also been developed for
handling outliers. This problem is mainly motivated by applications in
privacy-preserving data publication.
","[{'version': 'v1', 'created': 'Sat, 17 Apr 2010 16:30:08 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Apr 2010 13:37:54 GMT'}]",2010-04-22,"[['Li', 'Jian', ''], ['Yi', 'Ke', ''], ['Zhang', 'Qin', '']]","['Approximation algorithm', 'k-center', 'k-anonymity', 'l-diversity']"
18766,1107.4065,Wojciech Mazurczyk,"Wojciech Fraczek, Wojciech Mazurczyk, Krzysztof Szczypiorski",How Hidden Can Be Even More Hidden?,"5 pages, 8 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents Deep Hiding Techniques (DHTs) that define general
techniques that can be applied to every network steganography method to improve
its undetectability and make steganogram extraction harder to perform. We
define five groups of techniques that can make steganogram less susceptible to
detection and extraction. For each of the presented group, examples of the
usage are provided based on existing network steganography methods. To authors'
best knowledge presented approach is the first attempt in the state of the art
to systematically describe general solutions that can make steganographic
communication more hidden and steganogram extraction harder to perform.
","[{'version': 'v1', 'created': 'Wed, 20 Jul 2011 18:52:56 GMT'}]",2011-07-21,"[['Fraczek', 'Wojciech', ''], ['Mazurczyk', 'Wojciech', ''], ['Szczypiorski', 'Krzysztof', '']]","['deep hiding techniques', 'information hiding', 'network steganography', 'multi-level steganography', 'inter-protocol steganography']"
18767,1212.3090,Xiao-Shan Gao,"Wei Li, Chun-Ming Yuan, Xiao-Shan Gao",Sparse Difference Resultant,43 pages. arXiv admin note: text overlap with arXiv:1111.1084,,,,cs.SC math.AG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the concept of sparse difference resultant for a Laurent
transformally essential system of difference polynomials is introduced and a
simple criterion for the existence of sparse difference resultant is given. The
concept of transformally homogenous polynomial is introduced and the sparse
difference resultant is shown to be transformally homogenous. It is shown that
the vanishing of the sparse difference resultant gives a necessary condition
for the corresponding difference polynomial system to have non-zero solutions.
The order and degree bounds for sparse difference resultant are given. Based on
these bounds, an algorithm to compute the sparse difference resultant is
proposed, which is single exponential in terms of the number of variables, the
Jacobi number, and the size of the Laurent transformally essential system.
Furthermore, the precise order and degree, a determinant representation, and a
Poisson-type product formula for the difference resultant are given.
","[{'version': 'v1', 'created': 'Thu, 13 Dec 2012 09:02:32 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Sep 2013 09:51:04 GMT'}]",2013-09-25,"[['Li', 'Wei', ''], ['Yuan', 'Chun-Ming', ''], ['Gao', 'Xiao-Shan', '']]","['Sparse difference resultant', 'difference resultant', 'Laurent transformally essential system', 'Jacobi number', 'single exponential algorithm']"
18768,1511.02299,Bo Zhang,"Bo Zhang, Yunlong Wu, Xiaodong Yi, Xuejun Yang","Joint Communication-Motion Planning in Wireless-Connected Robotic
  Networks: Overview and Design Guidelines","This draft has been submitted for publication in International
  Conference on Communications ICC'2016",,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent years have witnessed the prosperity of robots and in order to support
consensus and cooperation for multi-robot system, wireless communications and
networking among robots and the infrastructure have become indispensable. In
this technical note, we first provide an overview of the research contributions
on communication-aware motion planning (CAMP) in designing wireless-connected
robotic networks (WCRNs), where the degree-of-freedom (DoF) provided by motion
and communication capabilities embraced by the robots have not been fully
exploited. Therefore, we propose the framework of joint communication-motion
planning (JCMP) as well as the architecture for incorporating JCMP in WCRNs.
The proposed architecture is motivated by the observe-orient-decision-action
(OODA) model commonly adopted in robotic motion control and cognitive radio.
Then, we provide an overview of the orient module that quantify the
connectivity assessment. Afterwards, we highlight the JCMP module and compare
it with the conventional communication-planning, where the necessity of the
JCMP is validated via both theoretical analysis and simulation results of an
illustrative example. Finally, a series of open problems are discussed, which
picture the gap between the state-of-the-art and a practical WCRN.
","[{'version': 'v1', 'created': 'Sat, 7 Nov 2015 04:24:38 GMT'}]",2015-11-10,"[['Zhang', 'Bo', ''], ['Wu', 'Yunlong', ''], ['Yi', 'Xiaodong', ''], ['Yang', 'Xuejun', '']]","['Joint communication-motion planning', 'roboticsnetworks', 'learning (artificial intelligence)', 'fading channels', 'dynamic programming']"
18769,1606.04450,Massimo Camplani,"Massimo Camplani, Adeline Paiement, Majid Mirmehdi, Dima Damen, Sion
  Hannuna, Tilo Burghardt, Lili Tao",Multiple Human Tracking in RGB-D Data: A Survey,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multiple human tracking (MHT) is a fundamental task in many computer vision
applications. Appearance-based approaches, primarily formulated on RGB data,
are constrained and affected by problems arising from occlusions and/or
illumination variations. In recent years, the arrival of cheap RGB-Depth
(RGB-D) devices has {led} to many new approaches to MHT, and many of these
integrate color and depth cues to improve each and every stage of the process.
In this survey, we present the common processing pipeline of these methods and
review their methodology based (a) on how they implement this pipeline and (b)
on what role depth plays within each stage of it. We identify and introduce
existing, publicly available, benchmark datasets and software resources that
fuse color and depth data for MHT. Finally, we present a brief comparative
evaluation of the performance of those works that have applied their methods to
these datasets.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2016 16:41:55 GMT'}]",2016-06-15,"[['Camplani', 'Massimo', ''], ['Paiement', 'Adeline', ''], ['Mirmehdi', 'Majid', ''], ['Damen', 'Dima', ''], ['Hannuna', 'Sion', ''], ['Burghardt', 'Tilo', ''], ['Tao', 'Lili', '']]","['Human tracking', 'active and passive sensors', 'fusion of color and depth']"
18770,1304.8020,Daniele Calandriello,"Daniele Calandriello, Gang Niu, Masashi Sugiyama",Semi-Supervised Information-Maximization Clustering,"Slightly change metadata. arXiv admin note: text overlap with
  arXiv:1112.0611",,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semi-supervised clustering aims to introduce prior knowledge in the decision
process of a clustering algorithm. In this paper, we propose a novel
semi-supervised clustering algorithm based on the information-maximization
principle. The proposed method is an extension of a previous unsupervised
information-maximization clustering algorithm based on squared-loss mutual
information to effectively incorporate must-links and cannot-links. The
proposed method is computationally efficient because the clustering solution
can be obtained analytically via eigendecomposition. Furthermore, the proposed
method allows systematic optimization of tuning parameters such as the kernel
width, given the degree of belief in the must-links and cannot-links. The
usefulness of the proposed method is demonstrated through experiments.
","[{'version': 'v1', 'created': 'Tue, 30 Apr 2013 14:59:49 GMT'}, {'version': 'v2', 'created': 'Wed, 1 May 2013 11:53:05 GMT'}]",2013-05-02,"[['Calandriello', 'Daniele', ''], ['Niu', 'Gang', ''], ['Sugiyama', 'Masashi', '']]","['Clustering', 'Information Maximization', 'Squared-Loss Mutual Information', 'Semi-supervised']"
18771,1305.1372,Fan Min,Fan Min and William Zhu,Cold-start recommendation through granular association rules,Submitted to Joint Rough Sets 2013,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender systems are popular in e-commerce as they suggest items of
interest to users. Researchers have addressed the cold-start problem where
either the user or the item is new. However, the situation with both new user
and new item has seldom been considered. In this paper, we propose a cold-start
recommendation approach to this situation based on granular association rules.
Specifically, we provide a means for describing users and items through
information granules, a means for generating association rules between users
and items, and a means for recommending items to users using these rules.
Experiments are undertaken on a publicly available dataset MovieLens. Results
indicate that rule sets perform similarly on the training and the testing sets,
and the appropriate setting of granule is essential to the application of
granular association rules.
","[{'version': 'v1', 'created': 'Tue, 7 May 2013 01:08:27 GMT'}]",2013-05-08,"[['Min', 'Fan', ''], ['Zhu', 'William', '']]","['Granular computing', 'granule', 'recommendation', 'associationrule']"
18772,0707.0763,Richard McClatchey,"Ashiq Anjum, Peter Bloodsworth, Andrew Branson, Tamas Hauer, Richard
  McClatchey, Kamran Munir, Dmitry Rogulin, Jetendr Shamdasani","The Requirements for Ontologies in Medical Data Integration: A Case
  Study","6 pages, 1 figure. Presented at the 11th International Database
  Engineering & Applications Symposium (Ideas2007). Banff, Canada September
  2007",,,,cs.DB,,"  Evidence-based medicine is critically dependent on three sources of
information: a medical knowledge base, the patients medical record and
knowledge of available resources, including where appropriate, clinical
protocols. Patient data is often scattered in a variety of databases and may,
in a distributed model, be held across several disparate repositories.
Consequently addressing the needs of an evidence-based medicine community
presents issues of biomedical data integration, clinical interpretation and
knowledge management. This paper outlines how the Health-e-Child project has
approached the challenge of requirements specification for (bio-) medical data
integration, from the level of cellular data, through disease to that of
patient and population. The approach is illuminated through the requirements
elicitation and analysis of Juvenile Idiopathic Arthritis (JIA), one of three
diseases being studied in the EC-funded Health-e-Child project.
","[{'version': 'v1', 'created': 'Thu, 5 Jul 2007 11:21:39 GMT'}]",2007-07-06,"[['Anjum', 'Ashiq', ''], ['Bloodsworth', 'Peter', ''], ['Branson', 'Andrew', ''], ['Hauer', 'Tamas', ''], ['McClatchey', 'Richard', ''], ['Munir', 'Kamran', ''], ['Rogulin', 'Dmitry', ''], ['Shamdasani', 'Jetendr', '']]","['Biomedical application', 'user requirements', 'data modelling', 'ontologies']"
18773,1604.06583,Ildik\'o Pil\'an,"Elena Volodina and Ildik\'o Pil\'an and Ingegerd Enstr\""om and Lorena
  Llozhi and Peter Lundkvist and Gunl\""og Sundberg and Monica Sandell","SweLL on the rise: Swedish Learner Language corpus for European
  Reference Level studies",,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new resource for Swedish, SweLL, a corpus of Swedish Learner
essays linked to learners' performance according to the Common European
Framework of Reference (CEFR). SweLL consists of three subcorpora - SpIn,
SW1203 and Tisus, collected from three different educational establishments.
The common metadata for all subcorpora includes age, gender, native languages,
time of residence in Sweden, type of written task. Depending on the subcorpus,
learner texts may contain additional information, such as text genres, topics,
grades. Five of the six CEFR levels are represented in the corpus: A1, A2, B1,
B2 and C1 comprising in total 339 essays. C2 level is not included since
courses at C2 level are not offered. The work flow consists of collection of
essays and permits, essay digitization and registration, meta-data annotation,
automatic linguistic annotation. Inter-rater agreement is presented on the
basis of SW1203 subcorpus. The work on SweLL is still ongoing with more than
100 essays waiting in the pipeline. This article both describes the resource
and the ""how-to"" behind the compilation of SweLL.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2016 09:19:07 GMT'}]",2016-04-25,"[['Volodina', 'Elena', ''], ['Pilán', 'Ildikó', ''], ['Enström', 'Ingegerd', ''], ['Llozhi', 'Lorena', ''], ['Lundkvist', 'Peter', ''], ['Sundberg', 'Gunlög', ''], ['Sandell', 'Monica', '']]","['CEFR levels', 'learner corpus', 'digital resources for second language research']"
18774,1401.3607,Larry Bull,Larry Bull,A Brief History of Learning Classifier Systems: From CS-1 to XCS,"37 pages, 9 figures",,,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern Learning Classifier Systems can be characterized by their use of rule
accuracy as the utility metric for the search algorithm(s) discovering useful
rules. Such searching typically takes place within the restricted space of
co-active rules for efficiency. This paper gives an historical overview of the
evolution of such systems up to XCS, and then some of the subsequent
developments of XCS to different types of learning.
","[{'version': 'v1', 'created': 'Wed, 15 Jan 2014 14:37:48 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Feb 2014 11:55:12 GMT'}]",2014-02-10,"[['Bull', 'Larry', '']]","['anticipation', 'clustering', 'function approximation', 'genetic algorithm', 'memory', 'Q-learning']"
18775,1702.05744,Daniel M\'endez Fern\'andez,"Marco Torchiano and Daniel M\'endez Fern\'andez and Guilherme Horta
  Travassos and Rafael Maiani de Mello",Lessons Learnt in Conducting Survey Research,Final CR version,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Context: Surveys constitute an valuable tool to capture a large-scale
snapshot of the state of the practice. Apparently trivial to adopt, surveys
hide, however, several pitfalls that might hinder rendering the result valid
and, thus, useful. Goal: We aim at providing an overview of main pitfalls in
software engineering surveys and report on practical ways to deal with them.
Method: We build on the experiences we collected in conducting many studies and
distill the main lessons learnt. Results: The eight lessons learnt we report
cover different aspects of the survey process ranging from the design of
initial research objectives to the design of a questionnaire. Conclusions: Our
hope is that by sharing our lessons learnt, combined with a disciplined
application of the general survey theory, we contribute to improving the
quality of the research results achievable by employing software engineering
surveys.
","[{'version': 'v1', 'created': 'Sun, 19 Feb 2017 12:39:14 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Feb 2017 13:24:20 GMT'}, {'version': 'v3', 'created': 'Fri, 24 Feb 2017 15:57:52 GMT'}]",2017-02-27,"[['Torchiano', 'Marco', ''], ['Fernández', 'Daniel Méndez', ''], ['Travassos', 'Guilherme Horta', ''], ['de Mello', 'Rafael Maiani', '']]","['survey', 'software engineering', 'lessons learned']"
18776,1307.1215,Laurent Tapie,"Laurent Tapie, Bernardin Mawussi, Walter Rubio, Beno\^it Furet
  (IRCCyN)",Machining of complex-shaped parts with guidance curves,,"International Journal of Advanced Manufacturing Technology (2013)
  1-11",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, high-speed machining is usually used for production of hardened
material parts with complex shapes such as dies and molds. In such parts, tool
paths generated for bottom machining feature with the conventional parallel
plane strategy induced many feed rate reductions, especially when boundaries of
the feature have a lot of curvatures and are not parallel. Several machining
experiments on hardened material lead to the conclusion that a tool path
implying stable cutting conditions might guarantee a better part surface
integrity. To ensure this stability, the shape machined must be decomposed when
conventional strategies are not suitable. In this paper, an experimental
approach based on high-speed performance simulation is conducted on a master
bottom machining feature in order to highlight the influence of the curvatures
towards a suitable decomposition of machining area. The decomposition is
achieved through the construction of intermediate curves between the closed
boundaries of the feature. These intermediate curves are used as guidance curve
for the tool paths generation with an alternative machining strategy called
""guidance curve strategy"". For the construction of intermediate curves, key
parameters reflecting the influence of their proximity with each closed
boundary and the influence of the curvatures of this latter are introduced.
Based on the results, a method for defining guidance curves in four steps is
proposed.
","[{'version': 'v1', 'created': 'Thu, 4 Jul 2013 06:19:13 GMT'}]",2013-07-05,"[['Tapie', 'Laurent', '', 'IRCCyN'], ['Mawussi', 'Bernardin', '', 'IRCCyN'], ['Rubio', 'Walter', '', 'IRCCyN'], ['Furet', 'Benoît', '', 'IRCCyN']]","['CAM', 'machining strategies', 'guidance curves', 'complex shaped parts']"
18777,1208.6106,Musard Balliu,Musard Balliu and Mads Dam and Gurvan Le Guernic,Epistemic Temporal Logic for Information Flow Security,Published in PLAS 2011,,,,cs.CR cs.LO cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Temporal epistemic logic is a well-established framework for expressing
agents knowledge and how it evolves over time. Within language-based security
these are central issues, for instance in the context of declassification. We
propose to bring these two areas together. The paper presents a computational
model and an epistemic temporal logic used to reason about knowledge acquired
by observing program outputs. This approach is shown to elegantly capture
standard notions of noninterference and declassification in the literature as
well as information flow properties where sensitive and public data intermingle
in delicate ways.
","[{'version': 'v1', 'created': 'Thu, 30 Aug 2012 08:13:28 GMT'}]",2012-09-03,"[['Balliu', 'Musard', ''], ['Dam', 'Mads', ''], ['Guernic', 'Gurvan Le', '']]","['Information Flow', 'Epistemic Logic', 'Noninterference', 'Declassification']"
18778,1010.3233,Joshua White,"Joshua White, Adam Pilbeam",A Survey of Virtualization Technologies With Performance Testing,"6 Pages, 2 Tables, 4 Plots",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Virtualization has rapidly become a go-to technology for increasing
efficiency in the data center. With virtualization technologies providing
tremendous flexibility, even disparate architectures may be deployed on a
single machine without interference. Awareness of limitations and requirements
of physical hosts to be used for virtualization is important. This paper
reviews the present virtualization methods, virtual computing software, and
provides a brief analysis of the performance issues inherent to each. In the
end we present testing results of KVM-QEMU on two current Multi-Core CPU
Architectures and System Configurations.
","[{'version': 'v1', 'created': 'Fri, 15 Oct 2010 17:51:50 GMT'}]",2010-10-18,"[['White', 'Joshua', ''], ['Pilbeam', 'Adam', '']]","['Virtual Computing', 'Isolation', 'Security']"
18779,1412.2105,Arthur Ramos BSCS,"Arthur Ramos, Ruy J. G. B. de Queiroz, Anjolina G. de Oliveira",Sequences of Rewrites: A Categorical Interpretation,"13 pages, submitted to a scientific conference (WoLLIC 2015);
  corrected typos; Moved part of Section 2.4 to the appendix; corrected small
  issues in Section 3 (typos and some compositions order), results unchanged",,,,cs.LO math.CT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Martin-L\""of's Intensional Type Theory, identity type is a heavily used
and studied concept. The reason for that is the fact that it's responsible for
the recently discovered connection between Type Theory and Homotopy Theory. The
main problem with identity types, as originally formulated, is that they are
complex to understand and use. Using that fact as motivation, a much simpler
formulation for the identity type was proposed by Queiroz & Gabbay (1994) and
further developed by de Queiroz & de Oliveira (2013). In this formulation, an
element of an identity type is seen as a sequence of rewrites (or computational
paths). Together with the logical rules of this new entity, there exists a
system of reduction rules between sequence of rewrites called LND_{EQS}-RWS.
This system is constructed using the labelled natural deduction (i.e. Prawitz'
Natural Deduction plus derivations-as-terms) and is responsible for
establishing how a sequence of rewrites can be rewritten, resulting in a new
sequence of rewrites. In this context, we propose a categorical interpretation
for this new entity, using the types as objects and the rules of rewrites as
morphisms. Moreover, we show that our interpretation is in accordance with some
known results, like that types have a groupoidal structure. We also interpret
more complicated structures, like the one formed by a rewrite of a sequence of
rewrites.
","[{'version': 'v1', 'created': 'Fri, 5 Dec 2014 19:25:32 GMT'}, {'version': 'v2', 'created': 'Sun, 15 Feb 2015 14:06:28 GMT'}]",2015-02-17,"[['Ramos', 'Arthur', ''], ['de Queiroz', 'Ruy J. G. B.', ''], ['de Oliveira', 'Anjolina G.', '']]","['Sequence of rewrites', 'homotopy type theory', 'category theory', 'identity type', 'denotational semantics']"
18780,1208.6231,Beyza Ermis Ms,Beyza Ermi\c{s} and Evrim Acar and A. Taylan Cemgil,Link Prediction via Generalized Coupled Tensor Factorisation,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study deals with the missing link prediction problem: the problem of
predicting the existence of missing connections between entities of interest.
We address link prediction using coupled analysis of relational datasets
represented as heterogeneous data, i.e., datasets in the form of matrices and
higher-order tensors. We propose to use an approach based on probabilistic
interpretation of tensor factorisation models, i.e., Generalised Coupled Tensor
Factorisation, which can simultaneously fit a large class of tensor models to
higher-order tensors/matrices with com- mon latent factors using different loss
functions. Numerical experiments demonstrate that joint analysis of data from
multiple sources via coupled factorisation improves the link prediction
performance and the selection of right loss function and tensor model is
crucial for accurately predicting missing links.
","[{'version': 'v1', 'created': 'Thu, 30 Aug 2012 16:48:05 GMT'}]",2012-08-31,"[['Ermiş', 'Beyza', ''], ['Acar', 'Evrim', ''], ['Cemgil', 'A. Taylan', '']]","['Coupled tensor factorisation', 'link prediction', 'missing data']"
18781,1406.4941,Tapalina Bhattasali,"Tapalina Bhattasali, Rituparna Chaki, Nabendu Chaki","Study of Security Issues in Pervasive Environment of Next Generation
  Internet of Things","12 pages, CISIM 2013",,,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet of Things is a novel concept that semantically implies a world-wide
network of uniquely addressable interconnected smart objects. It is aimed at
establishing any paradigm in computing. This environment is one where the
boundary between virtual and physical world is eliminated. As the network gets
loaded with hitherto unknown applications, security threats also become
rampant. Current security solutions fail as new threats appear to de-struct the
reliability of information. The network has to be transformed to IPv6 enabled
network to address huge number of smart objects. Thus new addressing schemes
come up with new attacks. Real time analysis of information from the
heterogeneous smart objects needs use of cloud services. This can fall prey to
cloud specific security threats. Therefore need arises for a review of security
threats for a new area having huge demand. Here a study of security issues in
this domain is briefly presented.
","[{'version': 'v1', 'created': 'Thu, 19 Jun 2014 04:05:12 GMT'}]",2014-06-20,"[['Bhattasali', 'Tapalina', ''], ['Chaki', 'Rituparna', ''], ['Chaki', 'Nabendu', '']]","['Internet of Things', 'Any Paradigm', 'Smart Objects', 'Security Issues', 'IPv6', 'Cloud Services']"
18782,1402.5047,Lucas Paletta,"Stefano Piana, Alessandra Staglian\`o, Francesca Odone, Alessandro
  Verri, Antonio Camurri",Real-time Automatic Emotion Recognition from Body Gestures,,,,IDGEI/2014/02,cs.HC cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although psychological research indicates that bodily expressions convey
important affective information, to date research in emotion recognition
focused mainly on facial expression or voice analysis. In this paper we propose
an approach to realtime automatic emotion recognition from body movements. A
set of postural, kinematic, and geometrical features are extracted from
sequences 3D skeletons and fed to a multi-class SVM classifier. The proposed
method has been assessed on data acquired through two different systems: a
professionalgrade optical motion capture system, and Microsoft Kinect. The
system has been assessed on a ""six emotions"" recognition problem, and using a
leave-one-subject-out cross validation strategy, reached an overall recognition
rate of 61.3% which is very close to the recognition rate of 61.9% obtained by
human observers. To provide further testing of the system, two games were
developed, where one or two users have to interact to understand and express
emotions with their body.
","[{'version': 'v1', 'created': 'Thu, 20 Feb 2014 15:42:32 GMT'}]",2014-02-21,"[['Piana', 'Stefano', ''], ['Staglianò', 'Alessandra', ''], ['Odone', 'Francesca', ''], ['Verri', 'Alessandro', ''], ['Camurri', 'Antonio', '']]","['Body gesture analysis', 'motion features', 'motion capturesystems', 'RGB-D cameras', 'machine learning', 'serious games']"
18783,1704.07023,Zhiyuan Zha,"Zhiyuan Zha, Xinggan Zhang, Qiong Wang, Lan Tang, Xin Liu","Group-based Sparse Representation for Image Compressive Sensing
  Reconstruction with Non-Convex Regularization",,,,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Patch-based sparse representation modeling has shown great potential in image
compressive sensing (CS) reconstruction. However, this model usually suffers
from some limits, such as dictionary learning with great computational
complexity, neglecting the relationship among similar patches. In this paper, a
group-based sparse representation method with non-convex regularization
(GSR-NCR) for image CS reconstruction is proposed. In GSR-NCR, the local
sparsity and nonlocal self-similarity of images is simultaneously considered in
a unified framework. Different from the previous methods based on
sparsity-promoting convex regularization, we extend the non-convex weighted Lp
(0 < p < 1) penalty function on group sparse coefficients of the data matrix,
rather than conventional L1-based regularization. To reduce the computational
complexity, instead of learning the dictionary with a high computational
complexity from natural images, we learn the principle component analysis (PCA)
based dictionary for each group. Moreover, to make the proposed scheme
tractable and robust, we have developed an efficient iterative
shrinkage/thresholding algorithm to solve the non-convex optimization problem.
Experimental results demonstrate that the proposed method outperforms many
state-of-the-art techniques for image CS reconstruction.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 03:17:20 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Aug 2017 03:58:42 GMT'}]",2017-08-18,"[['Zha', 'Zhiyuan', ''], ['Zhang', 'Xinggan', ''], ['Wang', 'Qiong', ''], ['Tang', 'Lan', ''], ['Liu', 'Xin', '']]","['Image CS reconstruction', 'group sparse representation', 'nonlocal']"
18784,1304.3804,Emilio Coppa,"Emilio Coppa, Camil Demetrescu, Irene Finocchi and Romolo Marotta",Multithreaded Input-Sensitive Profiling,,,,,cs.PF cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Input-sensitive profiling is a recent performance analysis technique that
makes it possible to estimate the empirical cost function of individual
routines of a program, helping developers understand how performance scales to
larger inputs and pinpoint asymptotic bottlenecks in the code. A current
limitation of input-sensitive profilers is that they specifically target
sequential computations, ignoring any communication between threads. In this
paper we show how to overcome this limitation, extending the range of
applicability of the original approach to multithreaded applications and to
applications that operate on I/O streams. We develop new metrics for
automatically estimating the size of the input given to each routine
activation, addressing input produced by non-deterministic memory stores
performed by other threads as well as by the OS kernel (e.g., in response to
I/O or network operations). We provide real case studies, showing that our
extension allows it to characterize the behavior of complex applications more
precisely than previous approaches. An extensive experimental investigation on
a variety of benchmark suites (including the SPEC OMP2012 and the PARSEC
benchmarks) shows that our Valgrind-based input-sensitive profiler incurs an
overhead comparable to other prominent heavyweight analysis tools, while
collecting significantly more performance points from each profiling session
and correctly characterizing both thread-induced and external input.
","[{'version': 'v1', 'created': 'Sat, 13 Apr 2013 12:39:34 GMT'}]",2013-04-16,"[['Coppa', 'Emilio', ''], ['Demetrescu', 'Camil', ''], ['Finocchi', 'Irene', ''], ['Marotta', 'Romolo', '']]","['Asymptotic analysis', 'dynamic program analysis', 'instrumentation', 'I/O streams', 'multithreading', 'performance profiling', 'Valgrind', 'workload characterization']"
18785,1409.4253,Javier Luis Canovas Izquierdo,Valerio Cosentino and Javier Luis Canovas Izquierdo and Jordi Cabot,Three Metrics to Explore the Openness of GitHub projects,"4 pages, 4 figures, sent to Mining Challenge track at MSR'14,
  rejected",,,,cs.SE,http://creativecommons.org/licenses/by/3.0/,"  Open source software projects evolve thanks to a group of volunteers that
help in their development. Thus, the success of these projects depends on their
ability to attract (and keep) developers. We believe the openness of a project,
i.e., how easy is for a new user to actively contribute to it, can help to make
a project more attractive. To explore the openness of a software project, we
propose three metrics focused on: (1) the distribution of the project
community, (2) the rate of acceptance of external contributions and (3) the
time it takes to become an official collaborator of the project. We have
adapted and applied these metrics to a subset of GitHub projects, thus giving
some practical findings on their openness.
","[{'version': 'v1', 'created': 'Mon, 15 Sep 2014 13:38:41 GMT'}]",2014-09-16,"[['Cosentino', 'Valerio', ''], ['Izquierdo', 'Javier Luis Canovas', ''], ['Cabot', 'Jordi', '']]","['Openness', 'Open Source Software', 'GitHub']"
18786,1301.2466,Oleg Sychev,"Oleg Sychev, Dmitry Mamontov","Determining token sequence mistakes in responses to questions with open
  text answer",7 pages,,,,cs.CL cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When learning grammar of the new language, a teacher should routinely check
student's exercises for grammatical correctness. The paper describes a method
of automatically detecting and reporting grammar mistakes, regarding an order
of tokens in the response. It could report extra tokens, missing tokens and
misplaced tokens. The method is useful when teaching language, where order of
tokens is important, which includes most formal languages and some natural ones
(like English). The method was implemented in a question type plug-in
CorrectWriting for the widely used learning manage system Moodle.
","[{'version': 'v1', 'created': 'Fri, 11 Jan 2013 12:02:23 GMT'}]",2013-01-14,"[['Sychev', 'Oleg', ''], ['Mamontov', 'Dmitry', '']]","['question with open answer', 'automatic error reporting', 'grammar']"
18787,0907.0255,Hazer Inaltekin,"Hazer Inaltekin, Mung Chiang, H. Vincent Poor","A Cut-off Phenomenon in Location Based Random Access Games with
  Imperfect Information",Presented in the Fourth International Wireless Internet Conference,,,,cs.IT cs.GT math.IT math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper analyzes the behavior of selfish transmitters under imperfect
location information. The scenario considered is that of a wireless network
consisting of selfish nodes that are randomly distributed over the network
domain according to a known probability distribution, and that are interested
in communicating with a common sink node using common radio resources. In this
scenario, the wireless nodes do not know the exact locations of their
competitors but rather have belief distributions about these locations.
Firstly, properties of the packet success probability curve as a function of
the node-sink separation are obtained for such networks. Secondly, a
monotonicity property for the best-response strategies of selfish nodes is
identified. That is, for any given strategies of competitors of a node, there
exists a critical node-sink separation for this node such that its
best-response is to transmit when its distance to the sink node is smaller than
this critical threshold, and to back off otherwise. Finally, necessary and
sufficient conditions for a given strategy profile to be a Nash equilibrium are
provided.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2009 22:46:03 GMT'}]",2009-07-03,"[['Inaltekin', 'Hazer', ''], ['Chiang', 'Mung', ''], ['Poor', 'H. Vincent', '']]","['Random access', 'imperfect information', 'selfish transmitters', 'Nash equilibrium']"
18788,1501.05561,Vojtech Forejt,Vojt\v{e}ch Forejt and Jan Kr\v{c}\'al,On Frequency LTL in Probabilistic Systems,"A paper presented at CONCUR 2015, with appendix",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study frequency linear-time temporal logic (fLTL) which extends the
linear-time temporal logic (LTL) with a path operator $G^p$ expressing that on
a path, certain formula holds with at least a given frequency p, thus relaxing
the semantics of the usual G operator of LTL. Such logic is particularly useful
in probabilistic systems, where some undesirable events such as random failures
may occur and are acceptable if they are rare enough.
  Frequency-related extensions of LTL have been previously studied by several
authors, where mostly the logic is equipped with an extended ""until"" and
""globally"" operator, leading to undecidability of most interesting problems.
  For the variant we study, we are able to establish fundamental decidability
results. We show that for Markov chains, the problem of computing the
probability with which a given fLTL formula holds has the same complexity as
the analogous problem for LTL. We also show that for Markov decision processes
the problem becomes more delicate, but when restricting the frequency bound $p$
to be 1 and negations not to be outside any $G^p$ operator, we can compute the
maximum probability of satisfying the fLTL formula. This can be again performed
with the same time complexity as for the ordinary LTL formulas.
","[{'version': 'v1', 'created': 'Thu, 22 Jan 2015 16:30:43 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Jun 2015 16:26:58 GMT'}]",2015-06-29,"[['Forejt', 'Vojtěch', ''], ['Krčál', 'Jan', '']]","['Markov chains', 'Markov decision processes', 'LTL', 'controller synthesis']"
18789,1602.08423,Muhammad Imran,"Muhammad Imran, Patrick Meier, Carlos Castillo, Andre Lesa, Manuel
  Garcia Herranz",Enabling Digital Health by Automatic Classification of Short Messages,"Accepted at the ACM Digital Health Conference, 5 figures",,,,cs.CY cs.HC cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In response to the growing HIV/AIDS and other health-related issues, UNICEF
through their U-Report platform receives thousands of messages (SMS) every day
to provide prevention strategies, health case advice, and counsel- ing support
to vulnerable population. Due to a rapid increase in U-Report usage (up to 300%
in last 3 years), plus approximately 1,000 new registrations each day, the
volume of messages has thus continued to increase, which made it impossible for
the team at UNICEF to process them in a timely manner. In this paper, we
present a platform designed to perform automatic classification of short
messages (SMS) in real-time to help UNICEF categorize and prioritize
health-related messages as they arrive. We employ a hybrid approach, which
combines human and machine intelligence that seeks to resolve the information
overload issue by introducing processing of large-scale data at high-speed
while maintaining a high classification accuracy. The system has recently been
tested in conjunction with UNICEF in Zambia to classify short messages received
via the U-Report platform on various health related issues. The system is
designed to enable UNICEF make sense of a large volume of short messages in a
timely manner. In terms of evaluation, we report design choices, challenges,
and performance of the system observed during the deployment to validate its
effectiveness.
","[{'version': 'v1', 'created': 'Fri, 26 Feb 2016 18:25:39 GMT'}]",2016-02-29,"[['Imran', 'Muhammad', ''], ['Meier', 'Patrick', ''], ['Castillo', 'Carlos', ''], ['Lesa', 'Andre', ''], ['Herranz', 'Manuel Garcia', '']]","['short text classification', 'hybrid system', 'stream processing', 'supervised machine learning']"
18790,1802.07851,Ajaykrishnan Nageswaran,Ajaykrishnan Nageswaran and Prakash Narayan,Data Privacy for a $\rho$-Recoverable Function,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A user's data is represented by a finite-valued random variable. Given a
function of the data, a querier is required to recover, with at least a
prescribed probability, the value of the function based on a query response
provided by the user. The user devises the query response, subject to the
recoverability requirement, so as to maximize privacy of the data from the
querier. Privacy is measured by the probability of error incurred by the
querier in estimating the data from the query response. We analyze single and
multiple independent query responses, with each response satisfying the
recoverability requirement, that provide maximum privacy to the user. In the
former setting, we also consider privacy for a predicate of the user's data.
Achievability schemes with explicit randomization mechanisms for query
responses are given and their privacy compared with converse upper bounds.
","[{'version': 'v1', 'created': 'Wed, 21 Feb 2018 23:51:33 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Sep 2018 22:22:45 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Jan 2019 23:20:32 GMT'}]",2019-01-14,"[['Nageswaran', 'Ajaykrishnan', ''], ['Narayan', 'Prakash', '']]","['−Chernoff radius', 'function computation', 'predicate privacy', 'privacy', 'recoverability']"
18791,1607.04441,Andr\'e Mateus,"Andre Mateus, David Ribeiro, Pedro Miraldo, and Jacinto C. Nascimento","Efficient and Robust Pedestrian Detection using Deep Learning for
  Human-Aware Navigation",Accepted in Robotics and Autonomous Systems,,,,cs.RO cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the problem of Human-Aware Navigation (HAN), using multi
camera sensors to implement a vision-based person tracking system. The main
contributions of this paper are as follows: a novel and efficient Deep Learning
person detection and a standardization of human-aware constraints. In the first
stage of the approach, we propose to cascade the Aggregate Channel Features
(ACF) detector with a deep Convolutional Neural Network (CNN) to achieve fast
and accurate Pedestrian Detection (PD). Regarding the human awareness (that can
be defined as constraints associated with the robot's motion), we use a mixture
of asymmetric Gaussian functions, to define the cost functions associated to
each constraint. Both methods proposed herein are evaluated individually to
measure the impact of each of the components. The final solution (including
both the proposed pedestrian detection and the human-aware constraints) is
tested in a typical domestic indoor scenario, in four distinct experiments. The
results show that the robot is able to cope with human-aware constraints,
defined after common proxemics and social rules.
","[{'version': 'v1', 'created': 'Fri, 15 Jul 2016 10:16:45 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Sep 2017 13:21:54 GMT'}, {'version': 'v3', 'created': 'Thu, 13 Dec 2018 11:43:14 GMT'}]",2018-12-14,"[['Mateus', 'Andre', ''], ['Ribeiro', 'David', ''], ['Miraldo', 'Pedro', ''], ['Nascimento', 'Jacinto C.', '']]","['Pedestrian Detection', 'Convolutional Neural Network', 'Human-Aware Navigation']"
18792,1402.1635,Wasantha Samarathunga,"Wasantha Samarathunga, Masatoshi Seki, Hidenobu Saito, Ken Ichiryu,
  Yasuhiro Ohyama",Product Evaluation In Elliptical Helical Pipe Bending,,"International Journal of Computer Trends and Technology, volume 4
  Issue 10 Oct 2013",,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This research proposes a computation approach to address the evaluation of
end product machining accuracy in elliptical surfaced helical pipe bending
using 6dof parallel manipulator as a pipe bender. The target end product is
wearable metal muscle supporters used in build-to-order welfare product
manufacturing. This paper proposes a product testing model that mainly corrects
the surface direction estimation errors of existing least squares ellipse
fittings, followed by arc length and central angle evaluations. This
post-machining modelling requires combination of reverse rotations and
translations to a specific location before accuracy evaluation takes place,
i.e. the reverse comparing to pre-machining product modelling. This specific
location not only allows us to compute surface direction but also the amount of
excessive surface twisting as a rotation angle about a specified axis, i.e.
quantification of surface torsion. At first we experimented three ellipse
fitting methods such as, two least-squares fitting methods with Bookstein
constraint and Trace constraint, and one non- linear least squares method using
Gauss-Newton algorithm. From fitting results, we found that using Trace
constraint is more reliable and designed a correction filter for surface
torsion observation. Finally we apply 2D total least squares line fitting
method with a rectification filter for surface direction detection.
","[{'version': 'v1', 'created': 'Fri, 7 Feb 2014 13:38:20 GMT'}]",2014-02-10,"[['Samarathunga', 'Wasantha', ''], ['Seki', 'Masatoshi', ''], ['Saito', 'Hidenobu', ''], ['Ichiryu', 'Ken', ''], ['Ohyama', 'Yasuhiro', '']]","['6DOF Parallel Manipulator', 'Elliptical Helical Bending', 'Least-Squares Fitting', 'Surface Torsion Observation', 'Surface Direction Detection']"
18793,1506.01943,Sakyoud Zakaria,"Sakyoud Zakaria, Ga\""etan Rey, Eladnani Mohamed, St\'ephane Lavirotte,
  El Fazziki Abdelaziz, Jean-Yves Tigli","Smart Geographic object: Toward a new understanding of GIS Technology in
  Ubiquitous Computing",,"IJCSI International Journal of Computer Science Issues, Volume 12,
  Issue 2, March 2015",,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the fundamental aspects of ubiquitous computing is the instrumentation
of the real world by smart devices. This instrumentation constitutes an
opportunity to rethink the interactions between human beings and their
environment on the one hand, and between the components of this environment on
the other. In this paper we discuss what this understanding of ubiquitous
computing can bring to geographic science and particularly to GIS technology.
Our main idea is the instrumentation of the geographic environment through the
instrumentation of geographic objects composing it. And then investigate how
this instrumentation can meet the current limitations of GIS technology, and
offers a new stage of rapprochement between the earth and its abstraction. As
result, the current research work proposes a new concept we named Smart
Geographic Object SGO. The latter is a convergence point between the smart
objects and geographic objects, two concepts appertaining respectively to t
","[{'version': 'v1', 'created': 'Fri, 5 Jun 2015 15:45:50 GMT'}]",2015-06-08,"[['Zakaria', 'Sakyoud', ''], ['Rey', 'Gaëtan', ''], ['Mohamed', 'Eladnani', ''], ['Lavirotte', 'Stéphane', ''], ['Abdelaziz', 'El Fazziki', ''], ['Tigli', 'Jean-Yves', '']]","['GIS', 'Ubiquitous Computing', 'Geographic object', 'Smart object']"
18794,1407.5891,Dominik Renzel,"Alexander Nussbaumer (1), Milos Kravcik (2), Dominik Renzel (2), Ralf
  Klamma (2), Marcel Berthold (3), Dietrich Albert (1 and 3) ((1) Knowledge
  Technologies Institute, Graz University of Technology, Austria, (2) ACIS
  Group, Informatik 5, RWTH Aachen University, Germany, (3) Department of
  Psychology, University of Graz, Austria)","A Framework for Facilitating Self-Regulation in Responsive Open Learning
  Environments",,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Studies have shown that the application of Self-Regulated Learning (SRL)
increases the effectiveness of education. However, this is quite challenging to
be facilitated with learning technologies like Learning Management Systems
(LMS) that lack an individualised approach as well as a right balance between
the learner's freedom and guidance. Personalisation and adaptive technologies
have a high potential to support SRL in Personal Learning Environments (PLE),
which enable customisation and guidance of various strengths and at various
levels with SRL widgets. The main contribution of our paper is a framework that
integrates guidance and reflection support for SRL in PLEs. Therefore, we have
elaborated an operational SRL model. On that basis we have implemented a system
with a learner model, SRL widgets, monitoring and analytic tools, as well as
recommendation functionalities. We present concrete examples from both informal
and formal learning settings. Moreover, we present analytic results from our
SRL system - lab experiments and a public installation. With such a complex
setting we are coming close to the realisation of Responsive Open Learning
Environments (ROLE).
","[{'version': 'v1', 'created': 'Tue, 22 Jul 2014 14:49:19 GMT'}]",2014-07-23,"[['Nussbaumer', 'Alexander', '', '1 and 3'], ['Kravcik', 'Milos', '', '1 and 3'], ['Renzel', 'Dominik', '', '1 and 3'], ['Klamma', 'Ralf', '', '1 and 3'], ['Berthold', 'Marcel', '', '1 and 3'], ['Albert', 'Dietrich', '', '1 and 3']]","['self-regulated learning', 'learning process', 'personalised learning environments', 'adaptive recommendations', 'learner model', 'learning ontology']"
18795,0909.1460,Damien Chablat,"Anatoly Pashkevich (IRCCyN), Alexandr Klimchik (IRCCyN), Damien
  Chablat (IRCCyN), Philippe Wenger (IRCCyN)",Accuracy Improvement for Stiffness Modeling of Parallel Manipulators,,"42\`eme CIRP Conference on Manufacturing Systems, Grenoble :
  France (2009)",,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper focuses on the accuracy improvement of stiffness models for
parallel manipulators, which are employed in high-speed precision machining. It
is based on the integrated methodology that combines analytical and numerical
techniques and deals with multidimensional lumped-parameter models of the
links. The latter replace the link flexibility by localized 6-dof virtual
springs describing both translational/rotational compliance and the coupling
between them. There is presented detailed accuracy analysis of the stiffness
identification procedures employed in the commercial CAD systems (including
statistical analysis of round-off errors, evaluating the confidence intervals
for stiffness matrices). The efficiency of the developed technique is confirmed
by application examples, which deal with stiffness analysis of translational
parallel manipulators.
","[{'version': 'v1', 'created': 'Tue, 8 Sep 2009 11:22:09 GMT'}]",2009-09-09,"[['Pashkevich', 'Anatoly', '', 'IRCCyN'], ['Klimchik', 'Alexandr', '', 'IRCCyN'], ['Chablat', 'Damien', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN']]","['Design of manufacturing systems', 'Parallel mechanisms', 'Stiffness modeling', 'Translational parallel manipulators']"
18796,1412.7760,Waqas Nawaz,"Waqas Nawaz, Kifayat Ullah Khan, Young-Koo Lee",Shortest Path Analysis in Social Graphs,"4 pages, Accepted in The 3rd International Conference on Convergence
  and its Application (ICCA 2014), Seoul, Korea",,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The shortest path problem is among the most fundamental combinatorial
optimization problems to answer reachability queries. It is hard to deter-mine
which vertices or edges are visited during shortest path traversals. In this
paper, we provide an empirical analysis on how traversal algorithms behave on
social networks. First, we compute the shortest paths between set of vertices.
Each shortest path is considered as one transaction. Second, we utilize the
pat-tern mining approach to identify the frequency of occurrence of the
vertices. We evaluate the results in terms of network properties, i.e. degree
distribution, clustering coefficient.
","[{'version': 'v1', 'created': 'Wed, 24 Dec 2014 21:22:25 GMT'}]",2014-12-30,"[['Nawaz', 'Waqas', ''], ['Khan', 'Kifayat Ullah', ''], ['Lee', 'Young-Koo', '']]","['Shortest paths', 'Dijkstra', 'Pattern Mining', 'Social Network']"
18797,1412.3262,Tamir Bendory,Tamir Bendory and Shai Dekel and Arie Feuer,Robust Recovery of Stream of Pulses using Convex Optimization,Small modifications,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the problem of recovering the delays and amplitudes of a
weighted superposition of pulses. This problem is motivated by a variety of
applications such as ultrasound and radar. We show that for univariate and
bivariate stream of pulses, one can recover the delays and weights to any
desired accuracy by solving a tractable convex optimization problem, provided
that a pulse-dependent separation condition is satisfied. The main result of
this paper states that the recovery is robust to additive noise or model
mismatch.
","[{'version': 'v1', 'created': 'Wed, 10 Dec 2014 11:25:31 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Sep 2015 13:35:13 GMT'}, {'version': 'v3', 'created': 'Thu, 4 Feb 2016 19:22:56 GMT'}, {'version': 'v4', 'created': 'Sat, 2 Apr 2016 12:41:58 GMT'}, {'version': 'v5', 'created': 'Wed, 27 Apr 2016 13:22:15 GMT'}]",2016-04-28,"[['Bendory', 'Tamir', ''], ['Dekel', 'Shai', ''], ['Feuer', 'Arie', '']]","['stream of pulses', 'convex optimization', 'dual certificate', 'deconvolution', 'interpolating kernel']"
18798,1303.5874,Oscar Mora,Oscar Mora and Jes\'us Bisbal,BIMS: Biomedical Information Management System,5 pages,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present BIMS (Biomedical Information Management System).
BIMS is a software architecture designed to provide a flexible computational
framework to manage the information needs of a wide range of biomedical
research projects. The main goal is to facilitate the clinicians' job in data
entry, and researcher's tasks in data management, in high data quality
biomedical research projects. The BIMS architecture has been designed following
the two-level modeling paradigm, a promising methodology to model rich and
dynamic information environments. In addition, a functional implementation of
BIMS architecture has been developed as a web-based application. The result is
a highly flexible web application which allows modeling and managing large
amounts of heterogeneous biomedical data sets, both textual as well as visual
(medical images) information.
","[{'version': 'v1', 'created': 'Sat, 23 Mar 2013 18:54:02 GMT'}]",2013-03-26,"[['Mora', 'Oscar', ''], ['Bisbal', 'Jesús', '']]","['biomedical information', 'data management', 'data quality', 'two-level modeling', 'software architecture']"
18799,1410.4019,Subhadip Basu,"Dipak Kumar Kole, Subhadip Basu","An Automated Group Key Authentication System Using Secret Image Sharing
  Scheme",,"Proceedings of the International Conference on Recent trends in
  Information Systems (IRIS-06), pp. 98-106, Kovilpatti, Tamil Nadu, India,
  2006",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In an open network environment, privacy of group communication and integrity
of the communication data are the two major issues related to secured
information exchange. The required level of security may be achieved by
authenticating a group key in the communication channel, where contribution
from each group member becomes a part of the overall group key. In the current
work, we have developed an authentication system through Central Administrative
Server (CAS) for automatic integration and validation of the group key. For
secured group communication, the CAS generates a secret alphanumeric group key
image. Using secret image sharing scheme, this group key image shares are
distributed among all the participating group members in the open network. Some
or all the secret shares may be merged to reconstruct the group key image at
CAS. A k-nearest neighbor classifier with 48 features to represent the images,
is used to validate the reconstructed image with the one stored in the CAS. 48
topological features are used to represent the reconstructed group key image.
We have achieved 99.1% classification accuracy for 26 printed English uppercase
characters and 10 numeric digits.
","[{'version': 'v1', 'created': 'Wed, 15 Oct 2014 11:38:21 GMT'}]",2014-10-16,"[['Kole', 'Dipak Kumar', ''], ['Basu', 'Subhadip', '']]","['Visual Cryptography', 'Secret Image Sharing', 'Group Key', 'Automatic Authentication', 'Pattern Classification']"
18800,1401.1294,Hossein Shokri Ghadikolaei,Hossein Shokri-Ghadikolaei and Carlo Fischione,"Analysis and Optimization of Random Sensing Order in Cognitive Radio
  Networks","16 pages, 12 figures, 7 tables, accepted in Journal of Selected Areas
  in Communications (J-SAC) CR series and will be published in Apr'15",,,,cs.IT cs.PF math.IT math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Developing an efficient spectrum access policy enables cognitive radios to
dramatically increase spectrum utilization while ensuring predetermined quality
of service levels for primary users. In this paper, modeling, performance
analysis, and optimization of a distributed secondary network with random
sensing order policy are studied. Specifically, the secondary users create a
random order of available channels upon primary users return, and then find
optimal transmission and handoff opportunities in a distributed manner. By a
Markov chain analysis, the average throughputs of the secondary users and
average interference level among the secondary and primary users are
investigated. A maximization of the secondary network performance in terms of
the throughput while keeping under control the average interference is
proposed. It is shown that despite of traditional view, non-zero false alarm in
the channel sensing can increase channel utilization, especially in a dense
secondary network where the contention is too high. Then, two simple and
practical adaptive algorithms are established to optimize the network. The
second algorithm follows the variations of the wireless channels in
non-stationary conditions and outperforms even static brute force optimization,
while demanding few computations. The convergence of the distributed algorithms
are theoretically investigated based on the analytical performance indicators
established by the Markov chain analysis. Finally, numerical results validate
the analytical derivations and demonstrate the efficiency of the proposed
schemes. It is concluded that fully distributed sensing order algorithms can
lead to substantial performance improvements in cognitive radio networks
without the need of centralized management or message passing among the users.
","[{'version': 'v1', 'created': 'Tue, 7 Jan 2014 07:32:51 GMT'}, {'version': 'v2', 'created': 'Sun, 18 May 2014 21:28:10 GMT'}, {'version': 'v3', 'created': 'Wed, 3 Sep 2014 07:08:27 GMT'}]",2014-09-04,"[['Shokri-Ghadikolaei', 'Hossein', ''], ['Fischione', 'Carlo', '']]","['Cognitive radio networks', 'sequential channel sensing', 'Markov chain analysis', 'dense and ultra dense networks', 'distributedoptimization']"
18801,1504.02357,Thomas Britz,Thomas Britz and Keisuke Shiromoto,On the covering dimension of a linear code,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The critical exponent of a matroid is one of the important parameters in
matroid theory and is related to the Rota and Crapo's Critical Problem. This
paper introduces the covering dimension of a linear code over a finite field,
which is analogous to the critical exponent of a representable matroid. An
upper bound on the covering dimension is conjectured and nearly proven,
improving a classical bound for the critical exponent. Finally, a construction
is given of linear codes that attain equality in the covering dimension bound.
","[{'version': 'v1', 'created': 'Thu, 9 Apr 2015 15:49:33 GMT'}]",2015-04-10,"[['Britz', 'Thomas', ''], ['Shiromoto', 'Keisuke', '']]","['Linear code over a finite field', 'Critical Problem', 'covering dimension', 'support weight distribution', 'characteristic polynomial']"
18802,1306.5091,Eno Tonisson,Eno Tonisson,"Students' Comparison of Their Trigonometric Answers with the Answers of
  a Computer Algebra System","14 pages, Conferences on Intelligent Computer Mathematics CICM 2013
  8.-12. July 2013 Bath, UK",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Comparison of answers offered by a computer algebra system (CAS) with answers
derived by a student without a CAS is relevant, for instance, in the context of
computer-aided assessment (CAA). The issues of identity, equivalence and
correctness emerge in different ways and are important for CAA. These issues
are also interesting if a student is charged with the task of comparing the
answers. What will happen when students themselves are encouraged to analyse
differences, equivalence and correctness of their own answers and CAS answers?
What differences do they notice foremost? Would they recognise
equivalence/non-equivalence? How do they explain equivalence/non-equivalence?
The paper discusses these questions on the basis of lessons where the students
solved trigonometric equations. Ten equations were chosen with the aim to
ensure that the expected school answer and the CAS answer would differ in
various ways. Three of them are discussed more thoroughly in this paper.
","[{'version': 'v1', 'created': 'Fri, 21 Jun 2013 10:25:28 GMT'}]",2013-06-24,"[['Tonisson', 'Eno', '']]","['Computer Algebra Systems', 'Teaching and Learning Mathematics', 'Equivalence', 'Trigonometric Equations']"
18803,1407.6185,Stefano Martin Mr.,Olav Geil and Stefano Martin,Relative generalized Hamming weights of q-ary Reed-Muller codes,"41 pages. A discussion has been added on how to use secret sharing
  schemes from q-ary Reed-Muller codes in connection with distributed storage",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Coset constructions of $q$-ary Reed-Muller codes can be used to store secrets
on a distributed storage system in such a way that only parties with access to
a large part of the system can obtain information while still allowing for
local error-correction. In this paper we determine the relative generalized
Hamming weights of these codes which can be translated into a detailed
description of the information leakage [2, 24, 21, 11].
","[{'version': 'v1', 'created': 'Wed, 23 Jul 2014 12:00:38 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Aug 2014 08:45:23 GMT'}, {'version': 'v3', 'created': 'Wed, 1 Apr 2015 14:11:19 GMT'}, {'version': 'v4', 'created': 'Tue, 3 Nov 2015 09:03:36 GMT'}]",2015-11-04,"[['Geil', 'Olav', ''], ['Martin', 'Stefano', '']]","['Distributed storage', 'q-ary Reed-Muller code', 'relative generalized Hamming weight', 'secret sharing']"
18804,1304.2354,Stephen I. Gallant,Stephen I. Gallant,Bayesian Assessment of a Connectionist Model for Fault Detection,"Appears in Proceedings of the Fourth Conference on Uncertainty in
  Artificial Intelligence (UAI1988)",,,UAI-P-1988-PG-127-135,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A previous paper [2] showed how to generate a linear discriminant network
(LDN) that computes likely faults for a noisy fault detection problem by using
a modification of the perceptron learning algorithm called the pocket
algorithm. Here we compare the performance of this connectionist model with
performance of the optimal Bayesian decision rule for the example that was
previously described. We find that for this particular problem the
connectionist model performs about 97% as well as the optimal Bayesian
procedure. We then define a more general class of noisy single-pattern boolean
(NSB) fault detection problems where each fault corresponds to a single
:pattern of boolean instrument readings and instruments are independently
noisy. This is equivalent to specifying that instrument readings are
probabilistic but conditionally independent given any particular fault. We
prove:
  1. The optimal Bayesian decision rule for every NSB fault detection problem
is representable by an LDN containing no intermediate nodes. (This slightly
extends a result first published by Minsky & Selfridge.) 2. Given an NSB fault
detection problem, then with arbitrarily high probability after sufficient
iterations the pocket algorithm will generate an LDN that computes an optimal
Bayesian decision rule for that problem. In practice we find that a reasonable
number of iterations of the pocket algorithm produces a network with good, but
not optimal, performance.
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2013 19:43:01 GMT'}]",2013-04-10,"[['Gallant', 'Stephen I.', '']]","['pocket algorithm', 'connectionist model', 'Bayesian model', 'fault de\xad']"
18805,1603.08252,Ajay Saini,"Ajay Saini, Natasha Markuzon","Predictive Modeling of Opinion and Connectivity Dynamics in Social
  Networks",19 pages,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent years saw an increased interest in modeling and understanding the
mechanisms of opinion and innovation spread through human networks. Using
analysis of real-world social data, researchers are able to gain a better
understanding of the dynamics of social networks and subsequently model the
changes in such networks over time. We developed a social network model that
both utilizes an agent-based approach with a dynamic update of opinions and
connections between agents and reflects opinion propagation and structural
changes over time as observed in real-world data. We validate the model using
data from the Social Evolution dataset of the MIT Human Dynamics Lab describing
changes in friendships and health self-perception in a targeted student
population over a nine-month period. We demonstrate the effectiveness of the
approach by predicting changes in both opinion spread and connectivity of the
network. We also use the model to evaluate how the network parameters, such as
the level of `openness' and willingness to incorporate opinions of neighboring
agents, affect the outcome. The model not only provides insight into the
dynamics of ever changing social networks, but also presents a tool with which
one can investigate opinion propagation strategies for networks of various
structures and opinion distributions.
","[{'version': 'v1', 'created': 'Sun, 27 Mar 2016 19:53:21 GMT'}]",2016-03-29,"[['Saini', 'Ajay', ''], ['Markuzon', 'Natasha', '']]","['Agent-based', 'social network', 'opinion dynamics', 'connectivity dynamics', 'data']"
18806,1301.1218,Matteo Riondato,Matteo Riondato and Fabio Vandin,Finding the True Frequent Itemsets,"13 pages, Extended version of work appeared in SIAM International
  Conference on Data Mining, 2014",,,,cs.LG cs.DB cs.DS stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Frequent Itemsets (FIs) mining is a fundamental primitive in data mining. It
requires to identify all itemsets appearing in at least a fraction $\theta$ of
a transactional dataset $\mathcal{D}$. Often though, the ultimate goal of
mining $\mathcal{D}$ is not an analysis of the dataset \emph{per se}, but the
understanding of the underlying process that generated it. Specifically, in
many applications $\mathcal{D}$ is a collection of samples obtained from an
unknown probability distribution $\pi$ on transactions, and by extracting the
FIs in $\mathcal{D}$ one attempts to infer itemsets that are frequently (i.e.,
with probability at least $\theta$) generated by $\pi$, which we call the True
Frequent Itemsets (TFIs). Due to the inherently stochastic nature of the
generative process, the set of FIs is only a rough approximation of the set of
TFIs, as it often contains a huge number of \emph{false positives}, i.e.,
spurious itemsets that are not among the TFIs. In this work we design and
analyze an algorithm to identify a threshold $\hat{\theta}$ such that the
collection of itemsets with frequency at least $\hat{\theta}$ in $\mathcal{D}$
contains only TFIs with probability at least $1-\delta$, for some
user-specified $\delta$. Our method uses results from statistical learning
theory involving the (empirical) VC-dimension of the problem at hand. This
allows us to identify almost all the TFIs without including any false positive.
We also experimentally compare our method with the direct mining of
$\mathcal{D}$ at frequency $\theta$ and with techniques based on widely-used
standard bounds (i.e., the Chernoff bounds) of the binomial distribution, and
show that our algorithm outperforms these methods and achieves even better
results than what is guaranteed by the theoretical analysis.
","[{'version': 'v1', 'created': 'Mon, 7 Jan 2013 15:04:43 GMT'}, {'version': 'v2', 'created': 'Tue, 30 Apr 2013 12:54:12 GMT'}, {'version': 'v3', 'created': 'Wed, 22 Jan 2014 16:38:44 GMT'}]",2014-01-23,"[['Riondato', 'Matteo', ''], ['Vandin', 'Fabio', '']]","['Frequent itemsets', 'VC-dimension', 'False positives', 'Distribution-free methods', 'Frequencythreshold identification']"
18807,0806.4210,Jan Arpe,Jan Arpe and Elchanan Mossel,Agnostically Learning Juntas from Random Walks,12 pages,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove that the class of functions g:{-1,+1}^n -> {-1,+1} that only depend
on an unknown subset of k<<n variables (so-called k-juntas) is agnostically
learnable from a random walk in time polynomial in n, 2^{k^2}, epsilon^{-k},
and log(1/delta). In other words, there is an algorithm with the claimed
running time that, given epsilon, delta > 0 and access to a random walk on
{-1,+1}^n labeled by an arbitrary function f:{-1,+1}^n -> {-1,+1}, finds with
probability at least 1-delta a k-junta that is (opt(f)+epsilon)-close to f,
where opt(f) denotes the distance of a closest k-junta to f.
","[{'version': 'v1', 'created': 'Wed, 25 Jun 2008 23:18:44 GMT'}]",2008-06-27,"[['Arpe', 'Jan', ''], ['Mossel', 'Elchanan', '']]","['agnostic learning', 'random walks', 'juntas']"
18808,1206.6099,Shafqat Shad Mr,"Shafqat Ali Shad, Enhong Chen",Precise Location Acquisition of Mobility Data Using Cell-id,,"International Journal of Computer Science Issues, vol. 9, no. 3,
  pp. 222-231, 2012",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper has been withdrawn by the authors. Cellular network data has
become a hot source of study for extraction of user-mobility and
spatio-temporal trends. Location binding in mobility data can be done through
different methods like GPS, service provider assisted faux-GPS and Cell Global
Identity (CGI). Among these Cell Global Identity is most inexpensive method and
readily available solution for mobility extraction; however exact spatial
extraction is somehow a problem in it. This paper presents the spatial
extraction technique of mobile phone user raw data which carries the
information like location information, proximity location and activity of
subjects. This work mainly focuses on the data pre-processing methodology and
technique to interpret the low level mobility data into high level mobility
information using the designed clustering methodology and publically available
Cell-IDs databases. Work proposed the semi- supervised strategy to derive the
missing locations thorough the usage of semantic tag information and removal of
spatial outliers for precise mobility profile building.
","[{'version': 'v1', 'created': 'Mon, 25 Jun 2012 06:56:13 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Aug 2012 18:33:13 GMT'}, {'version': 'v3', 'created': 'Fri, 21 Sep 2012 02:23:47 GMT'}]",2012-09-24,"[['Shad', 'Shafqat Ali', ''], ['Chen', 'Enhong', '']]","['Mobility data', 'Spatial extraction', 'Trajectory mining', 'GSM network']"
18809,1412.3908,Valmi Dufour-Lussier,"Valmi Dufour-Lussier (INRIA Nancy - Grand Est / LORIA), Alice Hermann
  (INRIA Nancy - Grand Est / LORIA), Florence Le Ber (ICube), Jean Lieber
  (INRIA Nancy - Grand Est / LORIA)",Belief revision in the propositional closure of a qualitative algebra,,"14th International Conference on Principles of Knowledge
  Representation and Reasoning, Jul 2014, Vienne, Austria. AAAI Press, pp.4",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Belief revision is an operation that aims at modifying old be-liefs so that
they become consistent with new ones. The issue of belief revision has been
studied in various formalisms, in particular, in qualitative algebras (QAs) in
which the result is a disjunction of belief bases that is not necessarily
repre-sentable in a QA. This motivates the study of belief revision in
formalisms extending QAs, namely, their propositional clo-sures: in such a
closure, the result of belief revision belongs to the formalism. Moreover, this
makes it possible to define a contraction operator thanks to the Harper
identity. Belief revision in the propositional closure of QAs is studied, an
al-gorithm for a family of revision operators is designed, and an open-source
implementation is made freely available on the web.
","[{'version': 'v1', 'created': 'Fri, 12 Dec 2014 07:52:28 GMT'}]",2014-12-15,"[['Dufour-Lussier', 'Valmi', '', 'INRIA Nancy - Grand Est / LORIA'], ['Hermann', 'Alice', '', 'INRIA Nancy - Grand Est / LORIA'], ['Ber', 'Florence Le', '', 'ICube'], ['Lieber', 'Jean', '', 'INRIA Nancy - Grand Est / LORIA']]","['qualitative algebras', 'belief revision', 'belief contraction', 'propositional closure']"
18810,1511.05802,Dirk Lewandowski,"Nadine Hoechstoetter, Dirk Lewandowski",What Users See - Structures in Search Engine Results Pages,"Search engines, evaluation, search engine results pages, search
  shortcuts",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates the composition of search engine results pages. We
define what elements the most popular web search engines use on their results
pages (e.g., organic results, advertisements, shortcuts) and to which degree
they are used for popular vs. rare queries. Therefore, we send 500 queries of
both types to the major search engines Google, Yahoo, Live.com and Ask. We
count how often the different elements are used by the individual engines. In
total, our study is based on 42,758 elements. Findings include that search
engines use quite different approaches to results pages composition and
therefore, the user gets to see quite different results sets depending on the
search engine and search query used. Organic results still play the major role
in the results pages, but different shortcuts are of some importance, too.
Regarding the frequency of certain host within the results sets, we find that
all search engines show Wikipedia results quite often, while other hosts shown
depend on the search engine used. Both Google and Yahoo prefer results from
their own offerings (such as YouTube or Yahoo Answers). Since we used the .com
interfaces of the search engines, results may not be valid for other
country-specific interfaces.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2015 14:33:27 GMT'}]",2015-11-19,"[['Hoechstoetter', 'Nadine', ''], ['Lewandowski', 'Dirk', '']]","['Search engines', 'evaluation', 'search engine results pages', 'search shortcuts']"
18811,1307.3766,Zuzana Priscakova,Zuzana Priscakova and Ivana Rabova,Model of solutions for data security in Cloud Computing,,"International Journal of Computer Science, Engineering and
  Information Technology. 2013. Volume 3, p. 11-21. ISSN 2231-3605",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of this paper is to develop a model to ensure data stored in the
cloud. Model based on situations that arise in a business environment. The
model also includes individual participants and their data operations.
Implementation of the model is transferred using UML. The model is divided into
7 modules. Each module is apparent from the terms of data security and
described specific situations when working with data. Based on this model it is
possible to convert the implementation of cloud into enterprise environments
with respect to data security in the firm.
","[{'version': 'v1', 'created': 'Sun, 14 Jul 2013 18:57:57 GMT'}]",2013-07-16,"[['Priscakova', 'Zuzana', ''], ['Rabova', 'Ivana', '']]","['Cloud Computing', 'Security', 'UML', 'Data Integrity']"
18812,1205.1737,Rourab Paul,"Rourab Paul, Sangeet Saha, Jkm Sadique Uz Zaman, Suman Das, Amlan
  Chakrabarti and Ranjan Ghosh","A simple 1-byte 1-clock RC4 design and its efficient implementation in
  FPGA coprocessor for secured ethernet communication","Proceedings of National Workshop on Cryptology 2012 Organized by
  CRSI(http://crsind.com/),INDIA Held at VIT,INDIA (06.08.12 - 08.08.12)",,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the field of cryptography till date the 1-byte in 1-clock is the best
known RC4 hardware design [1], while the 1-byte in 3clocks is the best known
implementation [2,3]. The design algorithm in [1] considers two consecutive
bytes together and processes them in 2 clocks. The design of 1-byte in 3-clocks
is too much modular and clock hungry. In this paper considering the RC4
algorithm, as it is, a simpler RC4 hardware design providing higher throughput
is proposed in which 1-byte is processed in 1-clock. In the design two
sequential tasks are executed as two independent events during rising and
falling edges of the same clock and the swapping is directly executed using a
MUX-DEMUX combination. The power consumed in behavioral and structural designs
of RC4 are estimated and a power optimization technique is proposed. The NIST
statistical test suite is run on RC4 key streams in order to know its
randomness property. The encryption and decryption designs are respectively
embedded on two FPGA boards with RC4 in a custom coprocessor followed by
Ethernet communication.
","[{'version': 'v1', 'created': 'Tue, 8 May 2012 16:30:40 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Jul 2012 15:15:34 GMT'}]",2012-07-30,"[['Paul', 'Rourab', ''], ['Saha', 'Sangeet', ''], ['Zaman', 'Jkm Sadique Uz', ''], ['Das', 'Suman', ''], ['Chakrabarti', 'Amlan', ''], ['Ghosh', 'Ranjan', '']]","['Cryptography', 'RC4', 'Stream Cipher', 'Hardware Design', 'FPGA', 'Coprocessor', 'X-power']"
18813,1407.6384,Gamal Abd El-Nasser A. Said,"Gamal Abd El-Nasser A. Said, Abeer M. Mahmoud and El-Sayed M.
  El-Horbaty",Solving container terminals problems using computer-based modeling,"11 pages, 6 figures. arXiv admin note: substantial text overlap with
  arXiv:1407.6257","International Journal of Computer Science and Engineering(IJCSE),
  Vol.3, Issue 3,2014, pp.91-100",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the applications of different techniques for solving
container terminals problems. We have built a simulation model that can be used
to analyze the performance of container terminal operations. The proposed
approach is intended to be applied for a real case study in Alexandria
Container Terminal (ACT) at Alexandria port. The implementation of our approach
shows that a proposed model increases the efficiency of Alexandria container
terminal at Alexandria port.
","[{'version': 'v1', 'created': 'Tue, 22 Jul 2014 02:16:04 GMT'}]",2015-04-14,"[['Said', 'Gamal Abd El-Nasser A.', ''], ['Mahmoud', 'Abeer M.', ''], ['El-Horbaty', 'El-Sayed M.', '']]","['Container terminal', 'discrete event simulation', 'Optimization', 'NP-hard problems']"
18814,1406.5761,Abm Moniruzzaman,A B M Moniruzzaman and Syed Akther Hossain,"A Low Cost Two-Tier Architecture Model For High Availability Clusters
  Application Load Balancing","Load balancing, high availability cluster, web server clusters",,,,cs.NI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article proposes a design and implementation of a low cost two-tier
architecture model for high availability cluster combined with load-balancing
and shared storage technology to achieve desired scale of three-tier
architecture for application load balancing e.g. web servers. The research work
proposes a design that physically omits Network File System (NFS) server nodes
and implements NFS server functionalities within the cluster nodes, through Red
Hat Cluster Suite (RHCS) with High Availability (HA) proxy load balancing
technologies. In order to achieve a low-cost implementation in terms of
investment in hardware and computing solutions, the proposed architecture will
be beneficial. This system intends to provide steady service despite any system
components fails due to uncertainly such as network system, storage and
applications.
","[{'version': 'v1', 'created': 'Sun, 22 Jun 2014 20:46:57 GMT'}]",2014-06-24,"[['Moniruzzaman', 'A B M', ''], ['Hossain', 'Syed Akther', '']]","['Load balancing', 'high availability cluster', 'web']"
18815,1609.03750,Lars Ailo Bongo,"Inge Alexander Raknes, Bj{\o}rn Fjukstad, Lars Ailo Bongo","nsroot: Minimalist Process Isolation Tool Implemented With Linux
  Namespaces",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data analyses in the life sciences are moving from tools run on a personal
computer to services run on large computing platforms. This creates a need to
package tools and dependencies for easy installation, configuration and
deployment on distributed platforms. In addition, for secure execution there is
a need for process isolation on a shared platform. Existing virtual machine and
container technologies are often more complex than traditional Unix utilities,
like chroot, and often require root privileges in order to set up or use. This
is especially challenging on HPC systems where users typically do not have root
access. We therefore present nsroot, a lightweight Linux namespaces based
process isolation tool. It allows restricting the runtime environment of data
analysis tools that may not have been designed with security as a top priority,
in order to reduce the risk and consequences of security breaches, without
requiring any special privileges. The codebase of nsroot is small, and it
provides a command line interface similar to chroot. It can be used on all
Linux kernels that implement user namespaces. In addition, we propose combining
nsroot with the AppImage format for secure execution of packaged applications.
nsroot is open sourced and available at: https://github.com/uit-no/nsroot
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2016 10:12:05 GMT'}]",2017-12-27,"[['Raknes', 'Inge Alexander', ''], ['Fjukstad', 'Bjørn', ''], ['Bongo', 'Lars Ailo', '']]","['containers', 'process isolation', 'namespaces', 'data analysis', 'genomics data']"
18816,1707.01341,Ahmad Siddiqui Dr,"Ahmad Tasnim Siddiqui, Mohd. Muntjir","A Modern Approach to Integrate Database Queries for Searching E-Commerce
  Product",,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  E commerce refers to the utilization of electronic data transmission for
enhancing business processes and implementing business strategies. Explicit
components of e commerce include providing after sales services, promoting
services or products to services, processing payment, engaging in transaction
processes, identifying customer needs, processing payment and creating services
or products. In recent times, the use of e commerce has become too common among
the people. However, the growing demand of e commerce sites have made essential
for the databases to support direct querying of the Web page. This research
aims to explore and evaluate the integration of database queries and their uses
in searching of electronic commerce products. It has been analyzed that e
commerce is one of the most outstanding trends, which have been emerged in the
commerce world, for the last decades. Therefore, this study was undertaken to
examine the benefits of integrating database queries with e commerce product
searches. The findings of this study suggested that database queries are
extremely valuable for e commerce sites as they make product searches simpler
and accurate. In this context, the approach of integrating database queries is
found to be the most suitable and satisfactory, as it simplifies the searching
of e commerce products.
","[{'version': 'v1', 'created': 'Sat, 1 Jul 2017 18:46:00 GMT'}]",2017-07-06,"[['Siddiqui', 'Ahmad Tasnim', ''], ['Muntjir', 'Mohd.', '']]","['E-commerce product search', 'e-commerce', 'query optimization', 'business processes', 'Query integration']"
18817,1406.5480,Carl Barton,"Carl Barton, Costas S. Iliopoulos, and Solon P. Pissis",Average-Case Optimal Approximate Circular String Matching,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Approximate string matching is the problem of finding all factors of a text t
of length n that are at a distance at most k from a pattern x of length m.
Approximate circular string matching is the problem of finding all factors of t
that are at a distance at most k from x or from any of its rotations. In this
article, we present a new algorithm for approximate circular string matching
under the edit distance model with optimal average-case search time O(n(k + log
m)/m). Optimal average-case search time can also be achieved by the algorithms
for multiple approximate string matching (Fredriksson and Navarro, 2004) using
x and its rotations as the set of multiple patterns. Here we reduce the
preprocessing time and space requirements compared to that approach.
","[{'version': 'v1', 'created': 'Fri, 20 Jun 2014 18:37:14 GMT'}, {'version': 'v2', 'created': 'Mon, 25 Apr 2016 18:04:19 GMT'}]",2016-04-26,"[['Barton', 'Carl', ''], ['Iliopoulos', 'Costas S.', ''], ['Pissis', 'Solon P.', '']]","['algorithms on automata and words', 'average-case complexity', 'average-case optimal', 'approximate string matching']"
18818,1402.3891,Vinodhini G,Vinodhini G Chandrasekaran RM,"Performance Evaluation of Machine Learning Classifiers in Sentiment
  Mining","4 pages 2 tables, International Journal of Computer Trends and
  Technology, volume 4, Issue 6, june 2013",,,,cs.LG cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, the use of machine learning classifiers is of great value in
solving a variety of problems in text classification. Sentiment mining is a
kind of text classification in which, messages are classified according to
sentiment orientation such as positive or negative. This paper extends the idea
of evaluating the performance of various classifiers to show their
effectiveness in sentiment mining of online product reviews. The product
reviews are collected from Amazon reviews. To evaluate the performance of
classifiers various evaluation methods like random sampling, linear sampling
and bootstrap sampling are used. Our results shows that support vector machine
with bootstrap sampling method outperforms others classifiers and sampling
methods in terms of misclassification rate.
","[{'version': 'v1', 'created': 'Mon, 17 Feb 2014 05:24:42 GMT'}]",2014-02-18,"[['RM', 'Vinodhini G Chandrasekaran', '']]","['sentiment', 'mining', 'classification', 'machine learning', 'support vector']"
18819,1708.00239,Oleksii Ignatenko,"Oleksii Ignatenko, Oleksandr Synetskyi",Evolutionary game of N competing AIMD connections,"International Conference on Information and Communication
  Technologies in Education, Research, and Industrial Applications. Springer,
  Cham, 2014",,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with modeling of network's dynamic using evolutionary games
approach. Today there are many different protocols for data transmission
through the Internet, providing users with better or worse service. The process
of choosing better protocol could be considered as a dynamic game with players
(users), trying to maximize their payoffs (eg throughput). In this work we
presented the model of network's dynamic using differential equations with
discontinuous right side and proved existence and uniqueness of the solution,
formulated payoff matrix for a network game and found conditions of equilibrium
existence depending on loss sensitivity parameter. The results are illustrated
by simulations
","[{'version': 'v1', 'created': 'Tue, 1 Aug 2017 10:48:39 GMT'}]",2017-08-02,"[['Ignatenko', 'Oleksii', ''], ['Synetskyi', 'Oleksandr', '']]","['computer networks', 'evolutionary games', 'game theory', 'congestion control']"
18820,1704.02340,Ke Li Kl,"Mengyuan Wu, Ke Li, Sam Kwong, Qingfu Zhang","Evolutionary Many-Objective Optimization Based on Adversarial
  Decomposition","24 pages, 5 figures",,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The decomposition-based method has been recognized as a major approach for
multi-objective optimization. It decomposes a multi-objective optimization
problem into several single-objective optimization subproblems, each of which
is usually defined as a scalarizing function using a weight vector. Due to the
characteristics of the contour line of a particular scalarizing function, the
performance of the decomposition-based method strongly depends on the Pareto
front's shape by merely using a single scalarizing function, especially when
facing a large number of objectives. To improve the flexibility of the
decomposition-based method, this paper develops an adversarial decomposition
method that leverages the complementary characteristics of two different
scalarizing functions within a single paradigm. More specifically, we maintain
two co-evolving populations simultaneously by using different scalarizing
functions. In order to avoid allocating redundant computational resources to
the same region of the Pareto front, we stably match these two co-evolving
populations into one-one solution pairs according to their working regions of
the Pareto front. Then, each solution pair can at most contribute one mating
parent during the mating selection process. Comparing with nine
state-of-the-art many-objective optimizers, we have witnessed the competitive
performance of our proposed algorithm on 130 many-objective test instances with
various characteristics and Pareto front's shapes.
","[{'version': 'v1', 'created': 'Fri, 7 Apr 2017 18:28:19 GMT'}]",2017-04-11,"[['Wu', 'Mengyuan', ''], ['Li', 'Ke', ''], ['Kwong', 'Sam', ''], ['Zhang', 'Qingfu', '']]","['Many-objective optimization', 'evolutionary algorithm', 'stable matching theory', 'decompositionbased method']"
18821,1304.1075,Michel Grabisch,"Michel Grabisch (CES, EEP-PSE)",The core of games on ordered structures and graphs,,Annals of Operations Research (2013) 33-64,,,cs.GT cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In cooperative games, the core is the most popular solution concept, and its
properties are well known. In the classical setting of cooperative games, it is
generally assumed that all coalitions can form, i.e., they are all feasible. In
many situations, this assumption is too strong and one has to deal with some
unfeasible coalitions. Defining a game on a subcollection of the power set of
the set of players has many implications on the mathematical structure of the
core, depending on the precise structure of the subcollection of feasible
coalitions. Many authors have contributed to this topic, and we give a unified
view of these different results.
","[{'version': 'v1', 'created': 'Thu, 21 Mar 2013 15:37:17 GMT'}]",2013-04-04,"[['Grabisch', 'Michel', '', 'CES, EEP-PSE']]","['TU-game', 'solution concept', 'core', 'feasible coalition', 'communication graph', 'partially ordered set']"
18822,1802.08055,Azam Moosavi,"Azam Moosavi, Vishwas Rao, Adrian Sandu","A Learning Based Approach for Uncertainty Analysis in Numerical Weather
  Prediction Models","23 pages, 5 figures, 4 tables",,,CSL-2018-2,cs.NA physics.ao-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Complex numerical weather prediction models incorporate a variety of physical
processes, each described by multiple alternative physical schemes with
specific parameters. The selection of the physical schemes and the choice of
the corresponding physical parameters during model configuration can
significantly impact the accuracy of model forecasts. There is no combination
of physical schemes that works best for all times, at all locations, and under
all conditions. It is therefore of considerable interest to understand the
interplay between the choice of physics and the accuracy of the resulting
forecasts under different conditions. This paper demonstrates the use of
machine learning techniques to study the uncertainty in numerical weather
prediction models due to the interaction of multiple physical processes. The
first problem addressed herein is the estimation of systematic model errors in
output quantities of interest at future times, and the use of this information
to improve the model forecasts. The second problem considered is the
identification of those specific physical processes that contribute most to the
forecast uncertainty in the quantity of interest under specified meteorological
conditions.
  The discrepancies between model results and observations at past times are
used to learn the relationships between the choice of physical processes and
the resulting forecast errors. Numerical experiments are carried out with the
Weather Research and Forecasting (WRF) model. The output quantity of interest
is the model precipitation, a variable that is both extremely important and
very challenging to forecast. The physical processes under consideration
include various micro-physics schemes, cumulus parameterizations, short wave,
and long wave radiation schemes. The experiments demonstrate the strong
potential of machine learning approaches to aid the study of model errors.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 09:11:30 GMT'}]",2018-02-23,"[['Moosavi', 'Azam', ''], ['Rao', 'Vishwas', ''], ['Sandu', 'Adrian', '']]","['Numerical weather prediction model', 'precipitation prediction', 'physicalprocesses', 'machine learning']"
18823,1712.02962,Daizhan Cheng Dr,"Yaqi Hao, Daizhan Cheng",On Skew-Symmetric Games,"31 pages,9 tables",,,,cs.GT math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  By resorting to the vector space structure of finite games, skew-symmetric
games (SSGs) are proposed and investigated as a natural subspace of finite
games. First of all, for two player games, it is shown that the skew-symmetric
games form an orthogonal complement of the symmetric games. Then for a general
SSG its linear representation is given, which can be used to verify whether a
finite game is skew-symmetric. Furthermore, some properties of SSGs are also
obtained in the light of its vector subspace structure. Finally, a
symmetry-based decomposition of finite games is proposed, which consists of
three mutually orthogonal subspaces: symmetric subspace, skew-symmetric
subspace and asymmetric subspace. An illustrative example is presented to
demonstrate this decomposition.
","[{'version': 'v1', 'created': 'Fri, 8 Dec 2017 06:42:05 GMT'}]",2017-12-11,"[['Hao', 'Yaqi', ''], ['Cheng', 'Daizhan', '']]","['Symmetric game', 'skew-symmetric game', 'linear representation', 'symmetric group', 'decomposition', 'semi-tensor product of matrices']"
18824,1511.05865,Jeff Jones Dr,"Jeff Jones, James G.H. Whiting, Andrew Adamatzky","Quantitative Transformation for Implementation of Adder Circuits in
  Physical Systems",,"Quantitative Transformation for Implementation of Adder Circuits
  in Physical Systems, Biosystems, 134, p. 16-23 (2015)",,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computing devices are composed of spatial arrangements of simple funda-
mental logic gates. These gates may be combined to form more complex adding
circuits and, ultimately, complete computer systems. Implementing classical
adding circuits using unconventional, or even living substrates such as slime
mould Physarum polycephalum, is made difficult and often impracti- cal by the
challenges of branching fan-out of inputs and regions where circuit lines must
cross without interference. In this report we explore whether it is possible to
avoid spatial propagation, branching and crossing completely in the design of
adding circuits. We analyse the input and output patterns of a single-bit full
adder circuit. A simple quantitative transformation of the input patterns which
considers the total number of bits in the input string allows us to map the
respective input combinations to the correct outputs patterns of the full adder
circuit, reducing the circuit combinations from a 2:1 mapping to a 1:1 mapping.
The mapping of inputs to outputs also shows an incremental linear progression,
suggesting its implementation in a range of physical systems. We demonstrate an
example implementation, first in simulation, inspired by self-oscillatory
dynamics of the acellular slime mould Physarum polycephalum. We then assess the
potential implementation using plasmodium of slime mould itself. This simple
transformation may enrich the potential for using unconventional computing
substrates to implement digital circuits.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2015 16:30:01 GMT'}]",2015-11-19,"[['Jones', 'Jeff', ''], ['Whiting', 'James G. H.', ''], ['Adamatzky', 'Andrew', '']]","['Full Adder', 'Logic gate', 'Frequency', 'Physarum polycephalum', 'Oscillatory Dynamics']"
18825,0906.4750,Gregory Kucherov,"Roman Kolpakov, Gregory Kucherov, Pascal Ochem",On maximal repetitions of arbitrary exponent,"8 pages, 1 figure",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The first two authors have shown [KK99,KK00] that the sum the exponent (and
thus the number) of maximal repetitions of exponent at least 2 (also called
runs) is linear in the length of the word. The exponent 2 in the definition of
a run may seem arbitrary. In this paper, we consider maximal repetitions of
exponent strictly greater than 1.
","[{'version': 'v1', 'created': 'Thu, 25 Jun 2009 16:59:17 GMT'}]",2009-06-26,"[['Kolpakov', 'Roman', ''], ['Kucherov', 'Gregory', ''], ['Ochem', 'Pascal', '']]","['theory of computation', 'combinatorial problems', 'repetitions', 'periodicities']"
18826,1610.08885,Xudong Chen,Xudong Chen and M.-A. Belabbas,Optimal actuator placement for minimizing the worst-case control energy,,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the actuator placement problem for linear systems. Specifically,
we aim to identify an actuator which requires the least amount of control
energy to drive the system from an arbitrary initial condition to the origin in
the worst case. Said otherwise, we investigate the minimax problem of
minimizing the control energy over the worst possible initial conditions.
Recall that the least amount of control energy needed to drive a linear
controllable system from any initial condition on the unit sphere to the origin
is upper-bounded by the inverse of the smallest eigenvalue of the associated
controllability Gramian, and moreover, the upper-bound is sharp. The minimax
problem can be thus viewed as the optimization problem of minimizing the
upper-bound via the placement of an actuator. In spite of its simple and
natural formulation, this problem is difficult to solve. In fact, properties
such as the stability of the system matrix, which are not related to
controllability, now play important roles. We focus in this paper on the
special case where the system matrix is positive definite. Under this
assumption, we are able to provide a complete solution to the optimal actuator
placement problem and highlight the difficulty in solving the general problem.
","[{'version': 'v1', 'created': 'Thu, 27 Oct 2016 17:07:33 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Jul 2017 22:55:36 GMT'}]",2017-07-24,"[['Chen', 'Xudong', ''], ['Belabbas', 'M. -A.', '']]","['Linear control system', 'Optimal actuator design', 'Minimax problem', 'Matrix analysis']"
18827,1401.6499,Sanjay Vishwakarma,Sanjay Vishwakarma and A. Chockalingam,"Transmitter Optimization in MISO Broadcast Channel with Common and
  Secret Messages",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider transmitter optimization in multiple-input
single-output (MISO) broadcast channel with common and secret messages. The
secret message is intended for $K$ users and it is transmitted with perfect
secrecy with respect to $J$ eavesdroppers which are also assumed to be
legitimate users in the network. The common message is transmitted at a fixed
rate $R_{0}$ and it is intended for all $K$ users and $J$ eavesdroppers. The
source operates under a total power constraint. It also injects artificial
noise to improve the secrecy rate. We obtain the optimum covariance matrices
associated with the common message, secret message, and artificial noise, which
maximize the achievable secrecy rate and simultaneously meet the fixed rate
$R_{0}$ for the common message.
","[{'version': 'v1', 'created': 'Sat, 25 Jan 2014 05:24:12 GMT'}]",2014-01-28,"[['Vishwakarma', 'Sanjay', ''], ['Chockalingam', 'A.', '']]","['Physical layer security', 'MISO', 'common and secret messages', 'secrecy rate', 'artificial noise', 'multiple eavesdroppers']"
18828,1710.02804,Germ\'an Vidal,"Naoki Nishida, Adri\'an Palacios and Germ\'an Vidal",Reversible Computation in Term Rewriting,"To appear in the Journal of Logical and Algebraic Methods in
  Programming",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Essentially, in a reversible programming language, for each forward
computation from state $S$ to state $S'$, there exists a constructive method to
go backwards from state $S'$ to state $S$. Besides its theoretical interest,
reversible computation is a fundamental concept which is relevant in many
different areas like cellular automata, bidirectional program transformation,
or quantum computing, to name a few.
  In this work, we focus on term rewriting, a computation model that underlies
most rule-based programming languages. In general, term rewriting is not
reversible, even for injective functions; namely, given a rewrite step $t_1
\rightarrow t_2$, we do not always have a decidable method to get $t_1$ from
$t_2$. Here, we introduce a conservative extension of term rewriting that
becomes reversible. Furthermore, we also define two transformations,
injectivization and inversion, to make a rewrite system reversible using
standard term rewriting. We illustrate the usefulness of our transformations in
the context of bidirectional program transformation.
","[{'version': 'v1', 'created': 'Sun, 8 Oct 2017 08:31:49 GMT'}]",2017-10-10,"[['Nishida', 'Naoki', ''], ['Palacios', 'Adrián', ''], ['Vidal', 'Germán', '']]","['term rewriting', 'reversible computation', 'programtransformation']"
18829,1707.08386,Abdul Kawsar Tushar,"Akm Ashiquzzaman, Abdul Kawsar Tushar, Md. Rashedul Islam, Jong-Myon
  Kim","Reduction of Overfitting in Diabetes Prediction Using Deep Learning
  Neural Network","8 pages, 3 Figures, 3 Tables; Conference - 7th iCatse International
  Conference on IT Convergence and Security, 2017
  (http://icatse.org/icitcs2017/) (accepted)",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Augmented accuracy in prediction of diabetes will open up new frontiers in
health prognostics. Data overfitting is a performance-degrading issue in
diabetes prognosis. In this study, a prediction system for the disease of
diabetes is pre-sented where the issue of overfitting is minimized by using the
dropout method. Deep learning neural network is used where both fully connected
layers are fol-lowed by dropout layers. The output performance of the proposed
neural network is shown to have outperformed other state-of-art methods and it
is recorded as by far the best performance for the Pima Indians Diabetes Data
Set.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 11:44:55 GMT'}]",2017-07-27,"[['Ashiquzzaman', 'Akm', ''], ['Tushar', 'Abdul Kawsar', ''], ['Islam', 'Md. Rashedul', ''], ['Kim', 'Jong-Myon', '']]","['Dropout', 'Healthcare', 'Data Overfitting', 'Diabetes Prediction', 'Neural Network', 'Deep Learning']"
18830,0705.0454,Jerome Darmont,"J\'er\^ome Darmont (LIMOS), Amar Attoui (LIMOS), Michel Gourgand
  (LIMOS)","Performance Evaluation for Clustering Algorithms in Object-Oriented
  Database Systems",,"LNCS, Vol. 978 (09/1995) 187-196",,,cs.DB,,"  It is widely acknowledged that good object clustering is critical to the
performance of object-oriented databases. However, object clustering always
involves some kind of overhead for the system. The aim of this paper is to
propose a modelling methodology in order to evaluate the performances of
different clustering policies. This methodology has been used to compare the
performances of three clustering algorithms found in the literature (Cactis, CK
and ORION) that we considered representative of the current research in the
field of object clustering. The actual performance evaluation was performed
using simulation. Simulation experiments we performed showed that the Cactis
algorithm is better than the ORION algorithm and that the CK algorithm totally
outperforms both other algorithms in terms of response time and clustering
overhead.
","[{'version': 'v1', 'created': 'Thu, 3 May 2007 13:02:06 GMT'}]",2007-05-23,"[['Darmont', 'Jérôme', '', 'LIMOS'], ['Attoui', 'Amar', '', 'LIMOS'], ['Gourgand', 'Michel', '', 'LIMOS']]","['Clustering', 'Computer systems performance evaluation methodology', 'Object-oriented databases', 'Simulation']"
18831,1110.1602,P Vijayakumar,"P.Vijayakumar, S.Bose, A.Kannan","Error Detection and Correction for Distributed Group Key Agreement
  Protocol",Extended version of the conference ACITY-2011,,,,cs.CR,http://creativecommons.org/licenses/by/3.0/,"  Integrating an efficient Error detection and correction scheme with less
encoding and decoding complexity to support the distribution of keying material
in a secure group communication is an important issue, since the amount of
information carried out in the wireless channel is high which produces more
errors due to noise available in the communication channel. Moreover, the key
must be sent securely to the group members. In this paper, we propose a new
efficient group key computation protocol that provides more security and also
integrates an encoding method in sender side and decoding method in the
receiver side. To achieve security in key computation process, we propose
Euler's totient function based Diffie-hellman key distribution protocol. To
provide efficient error detection and correction method while distributing the
Keying and re-keying information, we introduce tanner graph based encoding
stopping set construction algorithm in sender and receiver side of the group
communication. Two major operations in this scheme are joining and leaving
operations for managing group memberships. The encoding and decoding complexity
of this approach is computed in this paper and it is proved that this proposed
approach takes less decoding time complexity.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2011 18:19:12 GMT'}]",2011-10-10,"[['Vijayakumar', 'P.', ''], ['Bose', 'S.', ''], ['Kannan', 'A.', '']]","['Group Communication', 'Key Computation', 'Euler’s Totient Function', 'Tanner Graph', 'Pseudo tree', 'Encoding Stopping set']"
18832,1304.5634,Dacheng Tao,"Chang Xu, Dacheng Tao, Chao Xu",A Survey on Multi-view Learning,,,,,cs.LG,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In recent years, a great many methods of learning from multi-view data by
considering the diversity of different views have been proposed. These views
may be obtained from multiple sources or different feature subsets. In trying
to organize and highlight similarities and differences between the variety of
multi-view learning approaches, we review a number of representative multi-view
learning algorithms in different areas and classify them into three groups: 1)
co-training, 2) multiple kernel learning, and 3) subspace learning. Notably,
co-training style algorithms train alternately to maximize the mutual agreement
on two distinct views of the data; multiple kernel learning algorithms exploit
kernels that naturally correspond to different views and combine kernels either
linearly or non-linearly to improve learning performance; and subspace learning
algorithms aim to obtain a latent subspace shared by multiple views by assuming
that the input views are generated from this latent subspace. Though there is
significant variance in the approaches to integrating multiple views to improve
learning performance, they mainly exploit either the consensus principle or the
complementary principle to ensure the success of multi-view learning. Since
accessing multiple views is the fundament of multi-view learning, with the
exception of study on learning a model from multiple views, it is also valuable
to study how to construct multiple views and how to evaluate these views.
Overall, by exploring the consistency and complementary properties of different
views, multi-view learning is rendered more effective, more promising, and has
better generalization ability than single-view learning.
","[{'version': 'v1', 'created': 'Sat, 20 Apr 2013 14:43:35 GMT'}]",2013-04-23,"[['Xu', 'Chang', ''], ['Tao', 'Dacheng', ''], ['Xu', 'Chao', '']]","['Multi-view Learning', 'Survey', 'Machine Learning']"
18833,1305.1520,Ney Renau-Ferrer,"Ney Renau-Ferrer (LAMIA), C\'eline Remi (LAMIA)","A Method for Visuo-Spatial Classification of Freehand Shapes Freely
  Sketched","IPCV'10 - 14th International Conference on Image Processing, Computer
  Vision, \& Pattern Recognition, \'Etats-Unis (2010)",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the principle and the main steps of a new method for the
visuo-spatial analysis of geometrical sketches recorded online. Visuo-spatial
analysis is a necessary step for multi-level analysis. Multi-level analysis
simultaneously allows classification, comparison or clustering of the
constituent parts of a pattern according to their visuo-spatial properties,
their procedural strategies, their structural or temporal parameters, or any
combination of two or more of those parameters. The first results provided by
this method concern the comparison of sketches to some perfect patterns of
simple geometrical figures and the measure of dissimilarity between real
sketches. The mean rates of good decision higher than 95% obtained are
promising in both cases.
","[{'version': 'v1', 'created': 'Tue, 7 May 2013 14:02:46 GMT'}]",2013-05-08,"[['Renau-Ferrer', 'Ney', '', 'LAMIA'], ['Remi', 'Céline', '', 'LAMIA']]","['freehand sketches', 'multi-level analysis', 'local descriptor', 'dissimilarity measure', 'classification']"
18834,1605.00414,Nikolai Dokuchaev,Nikolai Dokuchaev,"On sampling theorem with sparse decimated samples: exploring branching
  spectrum degeneracy",arXiv admin note: text overlap with arXiv:1603.04174,,,,cs.IT math.IT math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper investigates possibility of recovery of sequences from their
decimated subsequences. It is shown that this recoverability is associated with
certain spectrum degeneracy of a new kind, and that a sequences of a general
kind can be approximated by sequences featuring this degeneracy. This is
applied to sparse sampling of continuous time band-limited functions. The paper
shows that these functions allow an arbitrarily close approximation by
functions that can be recovered from sparse equidistant samples with sampling
distance larger than the distance defined by the critical Nyquist rate for the
underlying function. This allows to bypass, in a certain sense, the restriction
on the sampling rate defined by the Nyquist rate.
","[{'version': 'v1', 'created': 'Mon, 2 May 2016 10:03:00 GMT'}, {'version': 'v10', 'created': 'Mon, 6 Feb 2017 11:21:55 GMT'}, {'version': 'v11', 'created': 'Wed, 8 Feb 2017 16:00:51 GMT'}, {'version': 'v12', 'created': 'Tue, 28 Feb 2017 15:01:32 GMT'}, {'version': 'v13', 'created': 'Mon, 30 Oct 2017 06:56:22 GMT'}, {'version': 'v2', 'created': 'Tue, 3 May 2016 07:33:23 GMT'}, {'version': 'v3', 'created': 'Fri, 3 Jun 2016 09:15:19 GMT'}, {'version': 'v4', 'created': 'Wed, 8 Jun 2016 13:39:59 GMT'}, {'version': 'v5', 'created': 'Thu, 9 Jun 2016 07:05:21 GMT'}, {'version': 'v6', 'created': 'Mon, 13 Jun 2016 08:10:21 GMT'}, {'version': 'v7', 'created': 'Sun, 20 Nov 2016 12:34:58 GMT'}, {'version': 'v8', 'created': 'Mon, 2 Jan 2017 13:53:17 GMT'}, {'version': 'v9', 'created': 'Tue, 3 Jan 2017 14:24:56 GMT'}]",2017-10-31,"[['Dokuchaev', 'Nikolai', '']]","['sparse sampling', 'data compression', 'spectrum degeneracy']"
18835,1701.08734,Chrisantha Fernando Dr,"Chrisantha Fernando, Dylan Banarse, Charles Blundell, Yori Zwols,
  David Ha, Andrei A. Rusu, Alexander Pritzel, Daan Wierstra",PathNet: Evolution Channels Gradient Descent in Super Neural Networks,,,,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For artificial general intelligence (AGI) it would be efficient if multiple
users trained the same giant neural network, permitting parameter reuse,
without catastrophic forgetting. PathNet is a first step in this direction. It
is a neural network algorithm that uses agents embedded in the neural network
whose task is to discover which parts of the network to re-use for new tasks.
Agents are pathways (views) through the network which determine the subset of
parameters that are used and updated by the forwards and backwards passes of
the backpropogation algorithm. During learning, a tournament selection genetic
algorithm is used to select pathways through the neural network for replication
and mutation. Pathway fitness is the performance of that pathway measured
according to a cost function. We demonstrate successful transfer learning;
fixing the parameters along a path learned on task A and re-evolving a new
population of paths for task B, allows task B to be learned faster than it
could be learned from scratch or after fine-tuning. Paths evolved on task B
re-use parts of the optimal path evolved on task A. Positive transfer was
demonstrated for binary MNIST, CIFAR, and SVHN supervised learning
classification tasks, and a set of Atari and Labyrinth reinforcement learning
tasks, suggesting PathNets have general applicability for neural network
training. Finally, PathNet also significantly improves the robustness to
hyperparameter choices of a parallel asynchronous reinforcement learning
algorithm (A3C).
","[{'version': 'v1', 'created': 'Mon, 30 Jan 2017 18:06:07 GMT'}]",2017-01-31,"[['Fernando', 'Chrisantha', ''], ['Banarse', 'Dylan', ''], ['Blundell', 'Charles', ''], ['Zwols', 'Yori', ''], ['Ha', 'David', ''], ['Rusu', 'Andrei A.', ''], ['Pritzel', 'Alexander', ''], ['Wierstra', 'Daan', '']]","['Giant networks', 'Path evolution algorithm', 'Evolution andLearning', 'Continual Learning', 'Transfer Learning', 'MultiTaskLearning', 'Basal Ganglia']"
18836,1504.04311,Lucius Meredith,"Mike Stay, Lucius Gregory Meredith",Higher category models of the pi-calculus,,,,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  We present an approach to modeling computational calculi using higher
category theory. Specifically we present a fully abstract semantics for the
pi-calculus. The interpretation is consistent with Curry-Howard, interpreting
terms as typed morphisms, while simultaneously providing an explicit
interpretation of the rewrite rules of standard operational presentations as
2-morphisms. One of the key contributions, inspired by catalysis in chemical
reactions, is a method of restricting the application of 2-morphisms
interpreting rewrites to specific contexts.
","[{'version': 'v1', 'created': 'Thu, 16 Apr 2015 17:14:52 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Aug 2015 19:13:12 GMT'}, {'version': 'v3', 'created': 'Mon, 7 Sep 2015 14:32:35 GMT'}, {'version': 'v4', 'created': 'Tue, 22 Sep 2015 12:29:59 GMT'}]",2015-09-23,"[['Stay', 'Mike', ''], ['Meredith', 'Lucius Gregory', '']]","['higher category theory', 'concurrency', 'message-passing', 'types', 'Curry-Howard']"
18837,1704.05973,Lin Wu,"Tong Chen, Lin Wu, Xue Li, Jun Zhang, Hongzhi Yin, Yang Wang","Call Attention to Rumors: Deep Attention Based Recurrent Neural Networks
  for Early Rumor Detection",9 pages,,,,cs.CL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The proliferation of social media in communication and information
dissemination has made it an ideal platform for spreading rumors. Automatically
debunking rumors at their stage of diffusion is known as \textit{early rumor
detection}, which refers to dealing with sequential posts regarding disputed
factual claims with certain variations and highly textual duplication over
time. Thus, identifying trending rumors demands an efficient yet flexible model
that is able to capture long-range dependencies among postings and produce
distinct representations for the accurate early detection. However, it is a
challenging task to apply conventional classification algorithms to rumor
detection in earliness since they rely on hand-crafted features which require
intensive manual efforts in the case of large amount of posts. This paper
presents a deep attention model on the basis of recurrent neural networks (RNN)
to learn \textit{selectively} temporal hidden representations of sequential
posts for identifying rumors. The proposed model delves soft-attention into the
recurrence to simultaneously pool out distinct features with particular focus
and produce hidden representations that capture contextual variations of
relevant posts over time. Extensive experiments on real datasets collected from
social media websites demonstrate that (1) the deep attention based RNN model
outperforms state-of-the-arts that rely on hand-crafted features; (2) the
introduction of soft attention mechanism can effectively distill relevant parts
to rumors from original posts in advance; (3) the proposed method detects
rumors more quickly and accurately than competitors.
","[{'version': 'v1', 'created': 'Thu, 20 Apr 2017 01:22:57 GMT'}]",2017-04-21,"[['Chen', 'Tong', ''], ['Wu', 'Lin', ''], ['Li', 'Xue', ''], ['Zhang', 'Jun', ''], ['Yin', 'Hongzhi', ''], ['Wang', 'Yang', '']]","['Early rumor detection', 'Recurrent neural networks', 'Deep atentionmodels']"
18838,1009.5158,Rajesh Ramachandran,"R Rajesh, Vinod Sharma and Pramod Viswanath",Information Capacity of Energy Harvesting Sensor Nodes,"6 Pages, Submitted to ISIT-2011",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sensor nodes with energy harvesting sources are gaining popularity due to
their ability to improve the network life time and are becoming a preferred
choice supporting `green communication'. We study such a sensor node with an
energy harvesting source and compare various architectures by which the
harvested energy is used. We find its Shannon capacity when it is transmitting
its observations over an AWGN channel and show that the capacity achieving
energy management policies are related to the throughput optimal policies. We
also obtain the capacity when energy conserving sleep-wake modes are supported
and an achievable rate for the system with inefficiencies in energy storage.
","[{'version': 'v1', 'created': 'Mon, 27 Sep 2010 04:46:20 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Dec 2010 14:48:07 GMT'}, {'version': 'v3', 'created': 'Sun, 20 Feb 2011 11:21:44 GMT'}]",2011-02-22,"[['Rajesh', 'R', ''], ['Sharma', 'Vinod', ''], ['Viswanath', 'Pramod', '']]","['Optimal energy management policies', 'energy harvesting', 'sensor networks', 'energy buffer', 'network life time']"
18839,1610.07119,Yi Tay,"Minh C. Phan, Yi Tay, Tuan-Anh Nguyen Pham","Cross Device Matching for Online Advertising with Neural Feature
  Ensembles : First Place Solution at CIKM Cup 2016",4 pages Competition Report for CIKM Cup,,,,cs.LG cs.IR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe the 1st place winning approach for the CIKM Cup 2016 Challenge.
In this paper, we provide an approach to reasonably identify same users across
multiple devices based on browsing logs. Our approach regards a candidate
ranking problem as pairwise classification and utilizes an unsupervised neural
feature ensemble approach to learn latent features of users. Combined with
traditional hand crafted features, each user pair feature is fed into a
supervised classifier in order to perform pairwise classification. Lastly, we
propose supervised and unsupervised inference techniques.
","[{'version': 'v1', 'created': 'Sun, 23 Oct 2016 03:25:05 GMT'}, {'version': 'v2', 'created': 'Sun, 19 Feb 2017 03:33:03 GMT'}]",2017-02-21,"[['Phan', 'Minh C.', ''], ['Tay', 'Yi', ''], ['Pham', 'Tuan-Anh Nguyen', '']]","['Entity Linking', 'Cross Device', 'User Matching', 'ClickstreamMining', 'Online Advertising']"
18840,1208.0712,Bojan Marinkovi\'c,"Bojan Marinkovi\'c, Paola Glavan, Zoran Ognjanovi\'c",Description of the Chord Protocol using ASMs Formalism,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the overlay protocol Chord using the formalism of
Abstract State Machines. The formalization concerns Chord actions that maintain
ring topology and manipulate distributed keys. We define a class of runs and
prove the correctness of our formalization with respect to it.
","[{'version': 'v1', 'created': 'Fri, 3 Aug 2012 11:17:57 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Sep 2013 13:23:08 GMT'}]",2013-09-24,"[['Marinković', 'Bojan', ''], ['Glavan', 'Paola', ''], ['Ognjanović', 'Zoran', '']]","['Peer-to-peer', 'Chord', 'DHT-based Overlay Networks', 'AbstractState Machines', 'Formalization']"
18841,0905.4923,James Currie,James D. Currie,"Lexicographically least words in the orbit closure of the Rudin-Shapiro
  word",9 pages,,,,cs.FL math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give an effective characterization of the lexicographically least word in
the orbit closure of the Rudin-Shapiro word w having a specified prefix. In
particular, the lexicographically least word in the orbit closure of the
Rudin-Shapiro word is 0w. This answers a question Allouche et al.
","[{'version': 'v1', 'created': 'Fri, 29 May 2009 17:14:46 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Jun 2009 15:13:42 GMT'}, {'version': 'v3', 'created': 'Mon, 4 Oct 2010 20:12:31 GMT'}]",2010-10-06,"[['Currie', 'James D.', '']]","['Combinatorics on words', 'Rudin-Shapiro word', 'morphicwords', 'automatic words']"
18842,1412.4626,Daniel Augot,"Daniel Augot (LIX, INRIA Saclay - Ile de France), Matthieu Finiasz","Direct Construction of Recursive MDS Diffusion Layers using Shortened
  BCH Codes","Best paper award; Carlos Cid and Christian Rechberger. 21st
  International Workshop on Fast Software Encryption, FSE 2014, Mar 2014,
  London, United Kingdom. springer",,,,cs.CR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  MDS matrices allow to build optimal linear diffusion layers in block ciphers.
However, MDS matrices cannot be sparse and usually have a large description,
inducing costly software/hardware implementations. Recursive MDS matrices allow
to solve this problem by focusing on MDS matrices that can be computed as a
power of a simple companion matrix, thus having a compact description suitable
even for constrained environ- ments. However, up to now, finding recursive MDS
matrices required to perform an exhaustive search on families of companion
matrices, thus limiting the size of MDS matrices one could look for. In this
article we propose a new direct construction based on shortened BCH codes, al-
lowing to efficiently construct such matrices for whatever parameters.
Unfortunately, not all recursive MDS matrices can be obtained from BCH codes,
and our algorithm is not always guaranteed to find the best matrices for a
given set of parameters.
","[{'version': 'v1', 'created': 'Mon, 15 Dec 2014 15:00:50 GMT'}]",2014-12-16,"[['Augot', 'Daniel', '', 'LIX, INRIA Saclay - Ile de France'], ['Finiasz', 'Matthieu', '']]","['Linear diffusion', 'recursive MDS matrices', 'BCH codes']"
18843,1702.01661,Lisa Posch,"Lisa Posch, Arnim Bleier, Clemens Lechner, Daniel Danner, Fabian
  Fl\""ock, Markus Strohmaier","Measuring Motivations of Crowdworkers: The Multidimensional Crowdworker
  Motivation Scale",33 pages; added section; additional validation; corrected typos,,,,cs.SI cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crowd employment is a new form of short-term and flexible employment which
has emerged during the past decade. In order to understand this new form of
employment, it is crucial to illuminate the underlying motivations of the
workforce involved in it. This paper introduces the Multidimensional
Crowdworker Motivation Scale (MCMS), a scale for measuring the motivation of
crowdworkers on micro-task platforms. The MCMS is theoretically grounded in
self-determination theory and tailored specifically to the context of paid
crowdsourced micro-labor. The scale measures the motivation of crowdworkers
along six motivational dimensions, ranging from amotivation to intrinsic
motivation. We validated the MCMS on data collected in ten countries and three
income groups. Factor analyses demonstrated that the MCMS's six dimensions
showed good model fit, validity, and reliability. Furthermore, our measurement
invariance tests showed that motivations measured with the MCMS are comparable
across countries and income groups, and we present a first cross-country
comparison of crowdworker motivations. This work constitutes an important first
step towards understanding the motivations of the international crowd
workforce.
","[{'version': 'v1', 'created': 'Mon, 6 Feb 2017 15:41:07 GMT'}, {'version': 'v2', 'created': 'Mon, 22 May 2017 16:07:20 GMT'}, {'version': 'v3', 'created': 'Fri, 15 Mar 2019 15:13:22 GMT'}]",2019-03-18,"[['Posch', 'Lisa', ''], ['Bleier', 'Arnim', ''], ['Lechner', 'Clemens', ''], ['Danner', 'Daniel', ''], ['Flöck', 'Fabian', ''], ['Strohmaier', 'Markus', '']]","['crowdsourcing', 'crowdworkers', 'motivation', 'self-determination theory', 'scale', 'validation', 'invariance']"
18844,1707.09299,Tatjana Chavdarova,"Tatjana Chavdarova, Pierre Baqu\'e, St\'ephane Bouquet, Andrii Maksai,
  Cijo Jose, Louis Lettry, Pascal Fua, Luc Van Gool and Fran\c{c}ois Fleuret",The WILDTRACK Multi-Camera Person Dataset,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  People detection methods are highly sensitive to the perpetual occlusions
among the targets. As multi-camera set-ups become more frequently encountered,
joint exploitation of the across views information would allow for improved
detection performances. We provide a large-scale HD dataset named WILDTRACK
which finally makes advanced deep learning methods applicable to this problem.
The seven-static-camera set-up captures realistic and challenging scenarios of
walking people.
  Notably, its camera calibration with jointly high-precision projection widens
the range of algorithms which may make use of this dataset. In aim to help
accelerate the research on automatic camera calibration, such annotations also
accompany this dataset.
  Furthermore, the rich-in-appearance visual context of the pedestrian class
makes this dataset attractive for monocular pedestrian detection as well,
since: the HD cameras are placed relatively close to the people, and the size
of the dataset further increases seven-fold.
  In summary, we overview existing multi-camera datasets and detection methods,
enumerate details of our dataset, and we benchmark multi-camera state of the
art detectors on this new dataset.
","[{'version': 'v1', 'created': 'Fri, 28 Jul 2017 16:05:06 GMT'}]",2017-07-31,"[['Chavdarova', 'Tatjana', ''], ['Baqué', 'Pierre', ''], ['Bouquet', 'Stéphane', ''], ['Maksai', 'Andrii', ''], ['Jose', 'Cijo', ''], ['Lettry', 'Louis', ''], ['Fua', 'Pascal', ''], ['Van Gool', 'Luc', ''], ['Fleuret', 'François', '']]","['Dataset', 'Multi Camera', 'Multi View', 'Large Scale', 'Pedestrian']"
18845,1606.08406,Yue Shi,"Yue Shi, Erheng Zhong, Suju Rajan, Liang Dong, Hao-wei Tseng, Beitao
  Li",The Apps You Use Bring The Blogs to Follow,,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We tackle the blog recommendation problem in Tumblr for mobile users in this
paper. Blog recommendation is challenging since most mobile users would suffer
from the cold start when there are only a limited number of blogs followed by
the user. Specifically to address this problem in the mobile domain, we take
into account mobile apps, which typically provide rich information from the
users. Based on the assumption that the user interests can be reflected from
their app usage patterns, we propose to exploit the app usage data for
improving blog recommendation. Building on the state-of-the-art recommendation
framework, Factorization Machines (FM), we implement app-based FM that
integrates app usage data with the user-blog follow relations. In this approach
the blog recommendation is generated not only based on the blogs that the user
followed before, but also the apps that the user has often used. We demonstrate
in a series of experiments that app-based FM can outperform other alternative
approaches to a significant extent. Our experimental results also show that
exploiting app usage information is particularly effective for improving blog
recommendation quality for cold start users.
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2016 18:45:56 GMT'}]",2016-06-28,"[['Shi', 'Yue', ''], ['Zhong', 'Erheng', ''], ['Rajan', 'Suju', ''], ['Dong', 'Liang', ''], ['Tseng', 'Hao-wei', ''], ['Li', 'Beitao', '']]","['Collaborative Filtering', 'Recommender Systems', 'Cross-domain Recommendation', 'Social Networks', 'Factorization Machines']"
18846,1110.6267,Scott Hazelhurst,Scott Hazelhurst and Yestin Johnson and Ian Sanders,"An empirical analysis of the relationship between web usage and academic
  performance in undergraduate students",,"Proceedings of the Annual Conference of the South African Computer
  Lecturer's Association, Ballito, South Africa, July 2011, pp. 29-37",,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of the internet, and in particular web browsing, offers many
potential advantages for educational institutions as students have access to a
wide range of information previously not available. However, there are
potential negative effects due to factors such as time-wasting and asocial
behaviour.
  In this study, we conducted an empirical investigation of the academic
performance and the web-usage pattern of 2153 undergraduate students. Data from
university proxy logs allows us to examine usage patterns and we compared this
data to the students' academic performance.
  The results show that there is a small but significant (both statistically
and educationally) association between heavier web browsing and poorer academic
results (lower average mark, higher failure rates). In addition, among good
students, the proportion of students who are relatively light users of the
internet is significantly greater than would be expected by chance.
","[{'version': 'v1', 'created': 'Fri, 28 Oct 2011 07:18:49 GMT'}]",2011-10-31,"[['Hazelhurst', 'Scott', ''], ['Johnson', 'Yestin', ''], ['Sanders', 'Ian', '']]","['internet usage', 'academic performance', 'study skills']"
18847,1205.1358,Abhisekh Sankaran,"Abhisekh Sankaran, Bharat Adsul, Vivek Madan, Pritish Kamath, Supratik
  Chakraborty",Preservation under Substructures modulo Bounded Cores,"From v2 to v3: Corrected typos, edited sentences for better
  readability; Conjecture 1 of v2 is now resolved so it is now Theorem 4, its
  proof is included in a new section (Section 7), Thm i in v2 is now Thm i+1
  for i >= 4; everything else remains the same. From v1 to v2: Thm i is now Thm
  i-1 for i >= 7, Corrected the proof of Theorem 10 (now Theorem 9) for B > 2
  (statement is still correct)",,,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate a model-theoretic property that generalizes the classical
notion of ""preservation under substructures"". We call this property
\emph{preservation under substructures modulo bounded cores}, and present a
syntactic characterization via $\Sigma_2^0$ sentences for properties of
arbitrary structures definable by FO sentences. As a sharper characterization,
we further show that the count of existential quantifiers in the $\Sigma_2^0$
sentence equals the size of the smallest bounded core. We also present our
results on the sharper characterization for special fragments of FO and also
over special classes of structures. We present a (not FO-definable) class of
finite structures for which the sharper characterization fails, but for which
the classical {\L}o\'s-Tarski preservation theorem holds. As a fallout of our
studies, we obtain combinatorial proofs of the {\L}o\'s-Tarski theorem for some
of the aforementioned cases.
","[{'version': 'v1', 'created': 'Mon, 7 May 2012 12:21:22 GMT'}, {'version': 'v2', 'created': 'Sat, 12 May 2012 09:01:21 GMT'}, {'version': 'v3', 'created': 'Thu, 12 Jul 2012 17:01:38 GMT'}]",2012-07-13,"[['Sankaran', 'Abhisekh', ''], ['Adsul', 'Bharat', ''], ['Madan', 'Vivek', ''], ['Kamath', 'Pritish', ''], ['Chakraborty', 'Supratik', '']]","['Model theory', 'First Order logic', 'Ło´s-Tarski preservation theorem']"
18848,1410.3227,Matthias Keil,"Matthias Keil, Peter Thiemann",Symbolic Solving of Extended Regular Expression Inequalities,Technical Report,,,,cs.FL,http://creativecommons.org/licenses/by/3.0/,"  This paper presents a new solution to the containment problem for extended
regular expressions that extends basic regular expressions with intersection
and complement operators and consider regular expressions on infinite alphabets
based on potentially infinite character sets. Standard approaches deciding the
containment do not take extended operators or character sets into account. The
algorithm avoids the translation to an expression-equivalent automaton and
provides a purely symbolic term rewriting systems for solving regular
expressions inequalities.
  We give a new symbolic decision procedure for the containment problem based
on Brzozowski's regular expression derivatives and Antimirov's rewriting
approach to check containment. We generalize Brzozowski's syntactic derivative
operator to two derivative operators that work with respect to (potentially
infinite) representable character sets.
","[{'version': 'v1', 'created': 'Mon, 13 Oct 2014 08:52:11 GMT'}]",2014-10-14,"[['Keil', 'Matthias', ''], ['Thiemann', 'Peter', '']]","['Extended Regular Expressions', 'Containment', 'Infinite Alphabtes', 'InfiniteCharacter Sets']"
18849,1605.01207,Stanislav Kikot,"Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir Podolskii
  and Michael Zakharyaschev","Ontology-Mediated Queries: Combined Complexity and Succinctness of
  Rewritings via Circuit Complexity",,,,,cs.DB cs.AI cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give solutions to two fundamental computational problems in ontology-based
data access with the W3C standard ontology language OWL 2 QL: the succinctness
problem for first-order rewritings of ontology-mediated queries (OMQs), and the
complexity problem for OMQ answering. We classify OMQs according to the shape
of their conjunctive queries (treewidth, the number of leaves) and the
existential depth of their ontologies. For each of these classes, we determine
the combined complexity of OMQ answering, and whether all OMQs in the class
have polynomial-size first-order, positive existential, and nonrecursive
datalog rewritings. We obtain the succinctness results using hypergraph
programs, a new computational model for Boolean functions, which makes it
possible to connect the size of OMQ rewritings and circuit complexity.
","[{'version': 'v1', 'created': 'Wed, 4 May 2016 10:10:37 GMT'}]",2016-05-05,"[['Bienvenu', 'Meghyn', ''], ['Kikot', 'Stanislav', ''], ['Kontchakov', 'Roman', ''], ['Podolskii', 'Vladimir', ''], ['Zakharyaschev', 'Michael', '']]","['Ontology-Based Data Access', 'Description Logic', 'Ontology-Mediated Query', 'QueryRewriting', 'Succinctness', 'Computational Complexity', 'Circuit Complexity']"
18850,1412.3949,Gundram Leifert,"Tobias Strau{\ss}, Tobias Gr\""uning, Gundram Leifert, Roger Labahn
  (for the University of Rostock - CITlab)",CITlab ARGUS for historical handwritten documents,,,,,cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe CITlab's recognition system for the HTRtS competition attached to
the 14. International Conference on Frontiers in Handwriting Recognition, ICFHR
2014. The task comprises the recognition of historical handwritten documents.
The core algorithms of our system are based on multi-dimensional recurrent
neural networks (MDRNN) and connectionist temporal classification (CTC). The
software modules behind that as well as the basic utility technologies are
essentially powered by PLANET's ARGUS framework for intelligent text
recognition and image processing.
","[{'version': 'v1', 'created': 'Fri, 12 Dec 2014 11:11:30 GMT'}]",2019-08-14,"[['Strauß', 'Tobias', '', 'for the University of Rostock - CITlab'], ['Grüning', 'Tobias', '', 'for the University of Rostock - CITlab'], ['Leifert', 'Gundram', '', 'for the University of Rostock - CITlab'], ['Labahn', 'Roger', '', 'for the University of Rostock - CITlab']]","['MDRNN', 'LSTM', 'CTC', 'handwriting recognition', 'neural network']"
18851,1008.3760,Ishanu Chattopadhyay,Ishanu Chattopadhyay and Anthony Cascone and Asok Ray,"Formal-language-theoretic Optimal Path Planning For Accommodation of
  Amortized Uncertainties and Dynamic Effects","Submitted for review for possible publication elsewhere; journal
  reference will be added when available",,,,cs.RO cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We report a globally-optimal approach to robotic path planning under
uncertainty, based on the theory of quantitative measures of formal languages.
A significant generalization to the language-measure-theoretic path planning
algorithm $\nustar$ is presented that explicitly accounts for average dynamic
uncertainties and estimation errors in plan execution. The notion of the
navigation automaton is generalized to include probabilistic uncontrollable
transitions, which account for uncertainties by modeling and planning for
probabilistic deviations from the computed policy in the course of execution.
The planning problem is solved by casting it in the form of a performance
maximization problem for probabilistic finite state automata. In essence we
solve the following optimization problem: Compute the navigation policy which
maximizes the probability of reaching the goal, while simultaneously minimizing
the probability of hitting an obstacle. Key novelties of the proposed approach
include the modeling of uncertainties using the concept of uncontrollable
transitions, and the solution of the ensuing optimization problem using a
highly efficient search-free combinatorial approach to maximize quantitative
measures of probabilistic regular languages. Applicability of the algorithm in
various models of robot navigation has been shown with experimental validation
on a two-wheeled mobile robotic platform (SEGWAY RMP 200) in a laboratory
environment.
","[{'version': 'v1', 'created': 'Mon, 23 Aug 2010 07:16:51 GMT'}]",2010-08-24,"[['Chattopadhyay', 'Ishanu', ''], ['Cascone', 'Anthony', ''], ['Ray', 'Asok', '']]","['Language Measure', 'Probabilistic Finite State Machines', 'Robotics', 'Path Planning', 'Supervisory Control']"
18852,1702.05624,Roberto Santana,Roberto Santana,"Reproducing and learning new algebraic operations on word embeddings
  using genetic programming","17 pages, 7 tables, 8 figures. Python code available from
  https://github.com/rsantana-isg/GP_word2vec",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Word-vector representations associate a high dimensional real-vector to every
word from a corpus. Recently, neural-network based methods have been proposed
for learning this representation from large corpora. This type of
word-to-vector embedding is able to keep, in the learned vector space, some of
the syntactic and semantic relationships present in the original word corpus.
This, in turn, serves to address different types of language classification
tasks by doing algebraic operations defined on the vectors. The general
practice is to assume that the semantic relationships between the words can be
inferred by the application of a-priori specified algebraic operations. Our
general goal in this paper is to show that it is possible to learn methods for
word composition in semantic spaces. Instead of expressing the compositional
method as an algebraic operation, we will encode it as a program, which can be
linear, nonlinear, or involve more intricate expressions. More remarkably, this
program will be evolved from a set of initial random programs by means of
genetic programming (GP). We show that our method is able to reproduce the same
behavior as human-designed algebraic operators. Using a word analogy task as
benchmark, we also show that GP-generated programs are able to obtain accuracy
values above those produced by the commonly used human-designed rule for
algebraic manipulation of word vectors. Finally, we show the robustness of our
approach by executing the evolved programs on the word2vec GoogleNews vectors,
learned over 3 billion running words, and assessing their accuracy in the same
word analogy task.
","[{'version': 'v1', 'created': 'Sat, 18 Feb 2017 15:29:01 GMT'}]",2017-02-21,"[['Santana', 'Roberto', '']]","['semantic spaces', 'compositional methods', 'word2vec', 'genetic programming', 'word vectors']"
18853,0802.0834,Jaap-Henk Hoepman,Jaap-Henk Hoepman,The Ephemeral Pairing Problem,,"In 8th Int. Conf. Financial Cryptography, LNCS 3110, pages
  212-226, Key West, FL, USA, February 9-12 2004. Springer",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In wireless ad-hoc broadcast networks the pairing problem consists of
establishing a (long-term) connection between two specific physical nodes in
the network that do not yet know each other. We focus on the ephemeral version
of this problem. Ephemeral pairings occur, for example, when electronic
business cards are exchanged between two people that meet, or when one pays at
a check-out using a wireless wallet.
  This problem can, in more abstract terms, be phrased as an ephemeral key
exchange problem: given a low bandwidth authentic (or private) communication
channel between two nodes, and a high bandwidth broadcast channel, can we
establish a high-entropy shared secret session key between the two nodes
without relying on any a priori shared secret information.
  Apart from introducing this new problem, we present several ephemeral key
exchange protocols, both for the case of authentic channels as well as for the
case of private channels.
","[{'version': 'v1', 'created': 'Wed, 6 Feb 2008 16:14:11 GMT'}]",2016-09-08,"[['Hoepman', 'Jaap-Henk', '']]","['Authentication', 'identification', 'pairing', 'key exchange']"
18854,0707.3534,Damien Chablat,"Damien Chablat (IRCCyN), St\'ephane Caro (IRCCyN)",The Kinetostatic Optimization of a Novel Prismatic Drive,,"Dans 12th World Congress in Mechanism and Machine Science - 12th
  World Congress in Mechanism and Machine Science, Besan\c{c}on : France
  (06/2007)",,,cs.RO,,"  The design of a mechanical transmission taking into account the transmitted
forces is reported in this paper. This transmission is based on Slide-o-Cam, a
cam mechanism with multiple rollers mounted on a common translating follower.
The design of Slide-o-Cam, a transmission intended to produce a sliding motion
from a turning drive, or vice versa, was reported elsewhere. This transmission
provides pure-rolling motion, thereby reducing the friction of rack-and-pinions
and linear drives. The pressure angle is a suitable performance index for this
transmission because it determines the amount of force transmitted to the load
vs. that transmitted to the machine frame. To assess the transmission
capability of the mechanism, the Hertz formula is introduced to calculate the
stresses on the rollers and on the cams. The final transmission is intended to
replace the current ball-screws in the Orthoglide, a three-DOF parallel robot
for the production of translational motions, currently under development for
machining applications at Ecole Centrale de Nantes.
","[{'version': 'v1', 'created': 'Tue, 24 Jul 2007 12:18:05 GMT'}]",2007-07-25,"[['Chablat', 'Damien', '', 'IRCCyN'], ['Caro', 'Stéphane', '', 'IRCCyN']]","['Optimal design', 'Slide-o-Cam', 'Pressure angles', 'Hertz’sformula']"
18855,1704.03524,Nhien-An Le-Khac,"Nhien-An Le-Khac, Mark Roeloffs and M-Tahar Kechadi",Forensic Analysis of TomTom Navigation Application,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the forensic field of digital technology, there has been a great deal of
investigation into the decoding of navigation systems of the brand TomTom. As
TomTom is the market leader in navigation systems, a large number of these
devices are investigated. These devices can hold an abundance of significant
location information. Currently, it is possible with the use of multiple
methods to make physical copies of mobile devices running Android. The next
great forensic problem is all the various programs that can be installed on
these devices. There is now an application available from the company TomTom in
the Google Play Store. This application mimics a navigation system on your
Android mobile device. Indeed, the TomTom application on Android can hold a
great deal of information. In this paper, we present a process of forensic
acquisition and analysis of the TomTom Android application. We focus on the
following questions: Is there a possibility to find previously driven routes or
GPS coordinates with timestamps in the memory of the mobile device? To
investigate what is stored in these files, driving tests were performed. During
these driving tests a copy was made of the most important file using a
self-written program. The significant files were found and the data in these
files was decoded. We show and analyse our results with Samsung mobile devices.
We compare also these results with forensic acquisition from TomTom GPS
devices.
","[{'version': 'v1', 'created': 'Tue, 11 Apr 2017 20:24:55 GMT'}]",2017-04-13,"[['Le-Khac', 'Nhien-An', ''], ['Roeloffs', 'Mark', ''], ['Kechadi', 'M-Tahar', '']]","['forensic acquisition', 'TomTom Android Application', 'TomTom Portable Navigation']"
18856,1212.1131,Lior Rokach,"Gilad Katz, Guy Shani, Bracha Shapira, Lior Rokach",Using Wikipedia to Boost SVD Recommender Systems,,,,,cs.LG cs.IR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Singular Value Decomposition (SVD) has been used successfully in recent years
in the area of recommender systems. In this paper we present how this model can
be extended to consider both user ratings and information from Wikipedia. By
mapping items to Wikipedia pages and quantifying their similarity, we are able
to use this information in order to improve recommendation accuracy, especially
when the sparsity is high. Another advantage of the proposed approach is the
fact that it can be easily integrated into any other SVD implementation,
regardless of additional parameters that may have been added to it. Preliminary
experimental results on the MovieLens dataset are encouraging.
","[{'version': 'v1', 'created': 'Wed, 5 Dec 2012 19:03:39 GMT'}]",2012-12-06,"[['Katz', 'Gilad', ''], ['Shani', 'Guy', ''], ['Shapira', 'Bracha', ''], ['Rokach', 'Lior', '']]","['Recommender Systems', 'Wikipedia', 'SVD', 'Cold Start Problem']"
18857,1609.03032,Haichuan Song,"Hai-Chuan Song, Nicolas Ray, Dmitry Sokolov, Sylvain Lefebvre",Anti-aliasing for fused filament deposition,"14 pages, 22 figures",,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Layered manufacturing inherently suffers from staircase defects along
surfaces that are gently slopped with respect to the build direction. Reducing
the slice thickness improves the situation but never resolves it completely as
flat layers remain a poor approximation of the true surface in these regions.
In addition, reducing the slice thickness largely increases the print time. In
this work we focus on a simple yet effective technique to improve the print
accuracy for layered manufacturing by filament deposition. Our method works
with standard three-axis 3D filament printers (e.g. the typical, widely
available 3D printers), using standard extrusion nozzles. It better reproduces
the geometry of sloped surfaces without increasing the print time. Our key idea
is to perform a local anti-aliasing, working at a sub-layer accuracy to produce
slightly curved deposition paths and reduce approximation errors. This is
inspired by Computer Graphics anti-aliasing techniques which consider sub-pixel
precision to treat aliasing effects. We show that the necessary deviation in
height compared to standard slicing is bounded by half the layer thickness.
Therefore, the height changes remain small and plastic deposition remains
reliable. We further split and order paths to minimize defects due to the
extruder nozzle shape, avoiding any change to the existing hardware. We apply
and analyze our approach on 3D printed examples, showing that our technique
greatly improves surface accuracy and silhouette quality while keeping the
print time nearly identical.
","[{'version': 'v1', 'created': 'Sat, 10 Sep 2016 11:46:08 GMT'}, {'version': 'v2', 'created': 'Mon, 10 Apr 2017 15:58:58 GMT'}]",2017-04-11,"[['Song', 'Hai-Chuan', ''], ['Ray', 'Nicolas', ''], ['Sokolov', 'Dmitry', ''], ['Lefebvre', 'Sylvain', '']]","['Fused filament fabrication', 'staircase', 'anti-aliasing', 'sub-layer', 'curved layers']"
18858,1701.06120,Zhongnan Zhang,"Tingxi Wen, Zhongnan Zhang","Effective and Extensible Feature Extraction Method Using Genetic
  Algorithm-Based Frequency-Domain Feature Search for Epileptic EEG
  Multi-classification","17 pages, 9 figures",,,,cs.LG cs.IT math.IT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a genetic algorithm-based frequency-domain feature search
(GAFDS) method is proposed for the electroencephalogram (EEG) analysis of
epilepsy. In this method, frequency-domain features are first searched and then
combined with nonlinear features. Subsequently, these features are selected and
optimized to classify EEG signals. The extracted features are analyzed
experimentally. The features extracted by GAFDS show remarkable independence,
and they are superior to the nonlinear features in terms of the ratio of
inter-class distance and intra-class distance. Moreover, the proposed feature
search method can additionally search for features of instantaneous frequency
in a signal after Hilbert transformation. The classification results achieved
using these features are reasonable, thus, GAFDS exhibits good extensibility.
Multiple classic classifiers (i.e., $k$-nearest neighbor, linear discriminant
analysis, decision tree, AdaBoost, multilayer perceptron, and Na\""ive Bayes)
achieve good results by using the features generated by GAFDS method and the
optimized selection. Specifically, the accuracies for the two-classification
and three-classification problems may reach up to 99% and 97%, respectively.
Results of several cross-validation experiments illustrate that GAFDS is
effective in feature extraction for EEG classification. Therefore, the proposed
feature selection and optimization model can improve classification accuracy.
","[{'version': 'v1', 'created': 'Sun, 22 Jan 2017 04:20:52 GMT'}]",2017-01-24,"[['Wen', 'Tingxi', ''], ['Zhang', 'Zhongnan', '']]","['Epilepsy', 'EEG Classification', 'GAFDS', 'nonlinear features']"
18859,1209.5494,Nafiza Saidin,"Nafiza Saidin, Harsa Amylia Mat Sakim, Umi Kalthum Ngah and Ibrahim
  Lutfi Shuaib",Segmentation of Breast Regions in Mammogram Based on Density: A Review,"9 pages, 2 figures,IJCSI International Journal of Computer Science
  Issues, Vol. 9, Issue 4, No 2, July 2012","IJCSI International Journal of Computer Science Issues, Vol. 9,
  Issue 4, No 2, July 2012",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The focus of this paper is to review approaches for segmentation of breast
regions in mammograms according to breast density. Studies based on density
have been undertaken because of the relationship between breast cancer and
density. Breast cancer usually occurs in the fibroglandular area of breast
tissue, which appears bright on mammograms and is described as breast density.
Most of the studies are focused on the classification methods for glandular
tissue detection. Others highlighted on the segmentation methods for
fibroglandular tissue, while few researchers performed segmentation of the
breast anatomical regions based on density. There have also been works on the
segmentation of other specific parts of breast regions such as either detection
of nipple position, skin-air interface or pectoral muscles. The problems on the
evaluation performance of the segmentation results in relation to ground truth
are also discussed in this paper.
","[{'version': 'v1', 'created': 'Tue, 25 Sep 2012 04:58:55 GMT'}]",2012-09-26,"[['Saidin', 'Nafiza', ''], ['Sakim', 'Harsa Amylia Mat', ''], ['Ngah', 'Umi Kalthum', ''], ['Shuaib', 'Ibrahim Lutfi', '']]","['Image segmentation', 'breast density', 'mammogram', 'medical image processing', 'medical imaging']"
18860,1406.2930,Abhishek Samvedi,"Abhishek Samvedi, Sparsh Owlak, Vijay Kumar Chaurasia",Improved Secure Address Resolution Protocol,"10 pages, 15 figures, paper selected in fifth international
  conference of communications security and information assurance 2014",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, an improved secure address resolution protocol is presented
where ARP spoofing attack is prevented. The proposed methodology is a
centralised methodology for preventing ARP spoofing attack. In the proposed
model there is a central server on a network or subnet which prevents ARP
spoofing attack.
","[{'version': 'v1', 'created': 'Wed, 11 Jun 2014 15:15:25 GMT'}]",2014-06-12,"[['Samvedi', 'Abhishek', ''], ['Owlak', 'Sparsh', ''], ['Chaurasia', 'Vijay Kumar', '']]","['ARP', 'ARP poisoning', 'Central Server', 'DHCP server']"
18861,1307.7129,Naoyuki Nide,"Megumi Fujita, Yuki Goto, Naoyuki Nide, Ken Satoh, Hiroshi Hosobe","An Architecture for Autonomously Controlling Robot with Embodiment in
  Real World",Submission for proc. of KRR-ICLP2013 (resubmitted using LLNCS style),,,,cs.RO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the real world, robots with embodiment face various issues such as dynamic
continuous changes of the environment and input/output disturbances. The key to
solving these issues can be found in daily life; people `do actions associated
with sensing' and `dynamically change their plans when necessary'. We propose
the use of a new concept, enabling robots to do these two things, for
autonomously controlling mobile robots. We implemented our concept to make two
experiments under static/dynamic environments. The results of these experiments
show that our idea provides a way to adapt to dynamic changes of the
environment in the real world.
","[{'version': 'v1', 'created': 'Fri, 26 Jul 2013 19:25:58 GMT'}]",2013-07-29,"[['Fujita', 'Megumi', ''], ['Goto', 'Yuki', ''], ['Nide', 'Naoyuki', ''], ['Satoh', 'Ken', ''], ['Hosobe', 'Hiroshi', '']]","['Autonomous Control', 'Dynamic environment', 'Motion planning']"
18862,1212.1633,Andrei Bulatov,Cong Wang and Andrei A. Bulatov,"Inferring Attitude in Online Social Networks Based On Quadratic
  Correlation","18 pages, 3 figures",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The structure of an online social network in most cases cannot be described
just by links between its members. We study online social networks, in which
members may have certain attitude, positive or negative toward each other, and
so the network consists of a mixture of both positive and negative
relationships. Our goal is to predict the sign of a given relationship based on
the evidences provided in the current snapshot of the network. More precisely,
using machine learning techniques we develop a model that after being trained
on a particular network predicts the sign of an unknown or hidden link. The
model uses relationships and influences from peers as evidences for the guess,
however, the set of peers used is not predefined but rather learned during the
training process. We use quadratic correlation between peer members to train
the predictor. The model is tested on popular online datasets such as Epinions,
Slashdot, and Wikipedia. In many cases it shows almost perfect prediction
accuracy. Moreover, our model can also be efficiently updated as the
underlaying social network evolves.
","[{'version': 'v1', 'created': 'Fri, 7 Dec 2012 15:45:35 GMT'}]",2012-12-10,"[['Wang', 'Cong', ''], ['Bulatov', 'Andrei A.', '']]","['Signed Networks', 'positive link', 'negative link', 'machine learning', 'quadratic optimization']"
18863,1312.4874,Fabrizio Maria Maggi,"Fabrizio Maria Maggi, Chiara Di Francescomarino, Marlon Dumas, Chiara
  Ghidini",Predictive Monitoring of Business Processes,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern information systems that support complex business processes generally
maintain significant amounts of process execution data, particularly records of
events corresponding to the execution of activities (event logs). In this
paper, we present an approach to analyze such event logs in order to
predictively monitor business goals during business process execution. At any
point during an execution of a process, the user can define business goals in
the form of linear temporal logic rules. When an activity is being executed,
the framework identifies input data values that are more (or less) likely to
lead to the achievement of each business goal. Unlike reactive compliance
monitoring approaches that detect violations only after they have occurred, our
predictive monitoring approach provides early advice so that users can steer
ongoing process executions towards the achievement of business goals. In other
words, violations are predicted (and potentially prevented) rather than merely
detected. The approach has been implemented in the ProM process mining toolset
and validated on a real-life log pertaining to the treatment of cancer patients
in a large hospital.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2013 17:38:09 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Dec 2013 19:34:45 GMT'}]",2013-12-20,"[['Maggi', 'Fabrizio Maria', ''], ['Di Francescomarino', 'Chiara', ''], ['Dumas', 'Marlon', ''], ['Ghidini', 'Chiara', '']]","['Predictive Process Monitoring', 'Recommendations', 'BusinessGoals', 'Linear Temporal Logic']"
18864,1402.5878,Lucas Paletta,"Alexandra Cetto, Michael Netter, G\""unther Pernul, Christian
  Richthammer, Moritz Riesner, Christian Roth, Johannes S\""anger","Friend Inspector: A Serious Game to Enhance Privacy Awareness in Social
  Networks",,,,IDGEI/2014/01,cs.CY cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Currently, many users of Social Network Sites are insufficiently aware of who
can see their shared personal items. Nonetheless, most approaches focus on
enhancing privacy in Social Networks through improved privacy settings,
neglecting the fact that privacy awareness is a prerequisite for privacy
control. Social Network users first need to know about privacy issues before
being able to make adjustments. In this paper, we introduce Friend Inspector, a
serious game that allows its users to playfully increase their privacy
awareness on Facebook. Since its launch, Friend Inspector has attracted a
significant number of visitors, emphasising the need for better tools to
understand privacy settings on Social Networks.
","[{'version': 'v1', 'created': 'Thu, 20 Feb 2014 15:26:15 GMT'}]",2014-02-25,"[['Cetto', 'Alexandra', ''], ['Netter', 'Michael', ''], ['Pernul', 'Günther', ''], ['Richthammer', 'Christian', ''], ['Riesner', 'Moritz', ''], ['Roth', 'Christian', ''], ['Sänger', 'Johannes', '']]","['Serious Games', 'Privacy Awareness', 'Social Network Sites']"
18865,1002.1691,Rdv Ijcsis,"Sumon Kumar Debnath, Foez Ahmed, Nayeema Islam","Performance Evaluation of Unicast and Broadcast Mobile Ad hoc Network
  Routing Protocols","7 Pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS January 2010, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 7, No. 1, pp. 40-46, January 2010, USA",,Computer Science Volume 7 ISSN 19475500,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Efficient routing mechanism is a challenging issue for group oriented
computing in Mobile Ad Hoc Networks (MANETs). The ability of MANETs to support
adequate Quality of Service (QoS) for group communication is limited by the
ability of the underlying ad-hoc routing protocols to provide consistent
behavior despite the dynamic properties of mobile computing devices. In MANET
QoS requirements can be quantified in terms of Packet Delivery Ratio (PDR),
Data Latency, Packet Loss Probability, Routing Overhead, Medium Access Control
(MAC) Overhead and Data Throughput etc. This paper presents an in depth study
of one to many and many to many communications in MANETs and provides a
comparative performance evaluation of unicast and broadcast routing protocols.
Dynamic Source Routing protocol (DSR) is used as unicast protocol and BCAST is
used to represent broadcast protocol. The performance differentials are
analyzed using ns2 network simulator varying multicast group size (number of
data senders and data receivers). Both protocols are simulated with identical
traffic loads and mobility models. Simulation result shows that BCAST performs
better than DSR in most cases.
","[{'version': 'v1', 'created': 'Mon, 8 Feb 2010 19:12:53 GMT'}]",2010-02-09,"[['Debnath', 'Sumon Kumar', ''], ['Ahmed', 'Foez', ''], ['Islam', 'Nayeema', '']]","['MANETs', 'DSR', 'BCAST', 'Unicast', 'Broadcast', 'Random way point model']"
18866,1704.07400,Hung La,"Hung M. La, Nenad Gucunski, Kristin Dana and Seong-Hoon Kee",Development of An Autonomous Bridge Deck Inspection Robotic System,,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The threat to safety of aging bridges has been recognized as a critical
concern to the general public due to the poor condition of many bridges in the
U.S. Currently, the bridge inspection is conducted manually, and it is not
efficient to identify bridge condition deterioration in order to facilitate
implementation of appropriate maintenance or rehabilitation procedures. In this
paper, we report a new development of the autonomous mobile robotic system for
bridge deck inspection and evaluation. The robot is integrated with several
nondestructive evaluation (NDE) sensors and a navigation control algorithm to
allow it to accurately and autonomously maneuver on the bridge deck to collect
visual images and conduct NDE measurements. The developed robotic system can
reduce the cost and time of the bridge deck data collection and inspection. For
efficient bridge deck monitoring, the crack detection algorithm to build the
deck crack map is presented in detail. The impact-echo (IE), ultrasonic surface
waves (USW) and electrical resistivity (ER) data collected by the robot are
analyzed to generate the delamination, concrete elastic modulus, corrosion maps
of the bridge deck, respectively. The presented robotic system has been
successfully deployed to inspect numerous bridges in more than ten different
states in the U.S.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 18:07:13 GMT'}]",2017-04-26,"[['La', 'Hung M.', ''], ['Gucunski', 'Nenad', ''], ['Dana', 'Kristin', ''], ['Kee', 'Seong-Hoon', '']]","['Mobile robotic systems', 'Localization', 'Navigation', 'Bridge deck inspection', 'Crack Detection', 'NDE Analysis']"
18867,1610.01508,Nikhil Krishnaswamy,James Pustejovsky and Nikhil Krishnaswamy,VoxML: A Visualization Modeling Language,"8 pages, 9 figures, proceedings of LREC 2016",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the specification for a modeling language, VoxML, which encodes
semantic knowledge of real-world objects represented as three-dimensional
models, and of events and attributes related to and enacted over these objects.
VoxML is intended to overcome the limitations of existing 3D visual markup
languages by allowing for the encoding of a broad range of semantic knowledge
that can be exploited by a variety of systems and platforms, leading to
multimodal simulations of real-world scenarios using conceptual objects that
represent their semantic values.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2016 16:27:48 GMT'}]",2016-10-06,"[['Pustejovsky', 'James', ''], ['Krishnaswamy', 'Nikhil', '']]","['Semantics', 'Cognitive Methods', 'Simulation', 'Lexical Semantics', 'Visualization']"
18868,1304.7868,Gobithaasan Rudrusamy,"Rozaimi Zakaria, Abd. Fatah Wahab, R.U. Gobithaasan",Normal type-2 Fuzzy Rational B-Spline Curve,,"2013 Int. Journal of Math. Analysis, 7(16), Pg.789-806",,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we proposed a new form of type-2 fuzzy data points(T2FDPs)
that is normal type-2 data points(NT2FDPs). These brand-new forms of data were
defined by using the definition of normal type-2 triangular fuzzy
number(NT2TFN). Then, we applied fuzzification(alpha-cut) and type-reduction
processes towards NT2FDPs after they had been redefined based on the situation
of NT2FDPs. Furthermore, we redefine the defuzzification definition along with
the new definitions of fuzzification process and type-reduction method to
obtain crisp type-2 fuzzy solution data points. For all these processes from
the defining the NT2FDPs to defuzzification of NT2FDPs, we demonstrate through
curve representation by using the rational B-spline curve function as the
example form modeling these NT2FDPs.
","[{'version': 'v1', 'created': 'Tue, 30 Apr 2013 04:27:35 GMT'}]",2013-05-01,"[['Zakaria', 'Rozaimi', ''], ['Wahab', 'Abd. Fatah', ''], ['Gobithaasan', 'R. U.', '']]","['Type-2 fuzzy set', 'type-2 fuzzy data points', 'alpha-cut', 'type-reduction', 'defuzzification']"
18869,0704.3500,Jerome Darmont,"Zhen He, J\'er\^ome Darmont (ERIC)","Une plate-forme dynamique pour l'\'evaluation des performances des bases
  de donn\'ees \`a objets",20 pages,"19\`emes Journ\'ees de Bases de Donn\'ees Avanc\'ees (BDA 03),
  Lyon (20/10/2003) 423-442",,,cs.DB,,"  In object-oriented or object-relational databases such as multimedia
databases or most XML databases, access patterns are not static, i.e.,
applications do not always access the same objects in the same order
repeatedly. However, this has been the way these databases and associated
optimisation techniques such as clustering have been evaluated up to now. This
paper opens up research regarding this issue by proposing a dynamic object
evaluation framework (DOEF). DOEF accomplishes access pattern change by
defining configurable styles of change. It is a preliminary prototype that has
been designed to be open and fully extensible. Though originally designed for
the object-oriented model, it can also be used within the object-relational
model with few adaptations. Furthermore, new access pattern change models can
be added too. To illustrate the capabilities of DOEF, we conducted two
different sets of experiments. In the first set of experiments, we used DOEF to
compare the performances of four state of the art dynamic clustering
algorithms. The results show that DOEF is effective at determining the
adaptability of each dynamic clustering algorithm to changes in access pattern.
They also led us to conclude that dynamic clustering algorithms can cope with
moderate levels of access pattern change, but that performance rapidly degrades
to be worse than no clustering when vigorous styles of access pattern change
are applied. In the second set of experiments, we used DOEF to compare the
performance of two different object stores: Platypus and SHORE. The use of DOEF
exposed the poor swapping performance of Platypus.
","[{'version': 'v1', 'created': 'Thu, 26 Apr 2007 09:10:41 GMT'}]",2007-05-23,"[['He', 'Zhen', '', 'ERIC'], ['Darmont', 'Jérôme', '', 'ERIC']]","['Object-oriented and object-relational databases', 'Benchmarks', 'Performance evaluation', 'Clustering']"
18870,1402.0024,Oliver Schaudt,Van Bang Le and Andrea Oversberg and Oliver Schaudt,"Polynomial time recognition of squares of ptolemaic graphs and
  3-sun-free split graphs",,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The square of a graph $G$, denoted $G^2$, is obtained from $G$ by putting an
edge between two distinct vertices whenever their distance is two. Then $G$ is
called a square root of $G^2$. Deciding whether a given graph has a square root
is known to be NP-complete, even if the root is required to be a chordal graph
or even a split graph.
  We present a polynomial time algorithm that decides whether a given graph has
a ptolemaic square root. If such a root exists, our algorithm computes one with
a minimum number of edges.
  In the second part of our paper, we give a characterization of the graphs
that admit a 3-sun-free split square root. This characterization yields a
polynomial time algorithm to decide whether a given graph has such a root, and
if so, to compute one.
","[{'version': 'v1', 'created': 'Fri, 31 Jan 2014 22:40:31 GMT'}]",2014-02-04,"[['Le', 'Van Bang', ''], ['Oversberg', 'Andrea', ''], ['Schaudt', 'Oliver', '']]","['Square of graphs', 'square of ptolemaic graphs', 'squares of splitgraphs', 'recognition algorithm']"
18871,1702.07735,Mitch Rees-Jones,"Mitch Rees-Jones, Matthew Martin, Tim Menzies",Better Predictors for Issue Lifetime,"9 pages, 3 figures, 5 tables",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Predicting issue lifetime can help software developers, managers, and
stakeholders effectively prioritize work, allocate development resources, and
better understand project timelines. Progress had been made on this prediction
problem, but prior work has reported low precision and high false alarms. The
latest results also use complex models such as random forests that detract from
their readability.
  We solve both issues by using small, readable decision trees (under 20 lines
long) and correlation feature selection to predict issue lifetime, achieving
high precision and low false alarms (medians of 71% and 13% respectively). We
also address the problem of high class imbalance within issue datasets - when
local data fails to train a good model, we show that cross-project data can be
used in place of the local data. In fact, cross-project data works so well that
we argue it should be the default approach for learning predictors for issue
lifetime.
","[{'version': 'v1', 'created': 'Fri, 24 Feb 2017 19:15:31 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Apr 2017 13:37:03 GMT'}]",2017-04-05,"[['Rees-Jones', 'Mitch', ''], ['Martin', 'Matthew', ''], ['Menzies', 'Tim', '']]","['Issue lifetime prediction', 'issue tracking', 'effortestimation', 'prediction']"
18872,1712.03254,David Carrera,"Nicola Cadenelli, Jorda Polo, David Carrera",Accelerating K-mer Frequency Counting with GPU and Non-Volatile Memory,"Submitted to the 19th IEEE International Conference on high
  Performance Computing and Communication (HPC 2017). Partially funded by
  European Research Council (ERC) under the European Union's Horizon 2020
  research and innovation programme (grant agreement No 639595) - HiEST Project",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The emergence of Next Generation Sequencing (NGS) platforms has increased the
throughput of genomic sequencing and in turn the amount of data that needs to
be processed, requiring highly efficient computation for its analysis. In this
context, modern architectures including accelerators and non-volatile memory
are essential to enable the mass exploitation of these bioinformatics
workloads. This paper presents a redesign of the main component of a
state-of-the-art reference-free method for variant calling, SMUFIN, which has
been adapted to make the most of GPUs and NVM devices. SMUFIN relies on
counting the frequency of \textit{k-mers} (substrings of length $k$) in DNA
sequences, which also constitutes a well-known problem for many bioinformatics
workloads, such as genome assembly. We propose techniques to improve the
efficiency of k-mer counting and to scale-up workloads like \sm that used to
require 16 nodes of \mn to a single machine with a GPU and NVM drives. Results
show that although the single machine is not able to improve the time to
solution of 16 nodes, its CPU time is 7.5x shorter than the aggregate CPU time
of the 16 nodes, with a reduction in energy consumption of 5.5x.
","[{'version': 'v1', 'created': 'Tue, 21 Nov 2017 15:49:40 GMT'}]",2017-12-12,"[['Cadenelli', 'Nicola', ''], ['Polo', 'Jorda', ''], ['Carrera', 'David', '']]","['Scale-up', 'Acceleration', 'GPU', 'Non-Volatile Memory', 'NVM', 'Genomics', 'K-mer']"
18873,1409.2433,Antonina Kolokolova,"Antonina Kolokolova, Renesa Nizamee","Approximating solution structure of the Weighted Sentence Alignment
  problem",,,,,cs.CL cs.CC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the complexity of approximating solution structure of the bijective
weighted sentence alignment problem of DeNero and Klein (2008). In particular,
we consider the complexity of finding an alignment that has a significant
overlap with an optimal alignment. We discuss ways of representing the solution
for the general weighted sentence alignment as well as phrases-to-words
alignment problem, and show that computing a string which agrees with the
optimal sentence partition on more than half (plus an arbitrarily small
polynomial fraction) positions for the phrases-to-words alignment is NP-hard.
For the general weighted sentence alignment we obtain such bound from the
agreement on a little over 2/3 of the bits. Additionally, we generalize the
Hamming distance approximation of a solution structure to approximating it with
respect to the edit distance metric, obtaining similar lower bounds.
","[{'version': 'v1', 'created': 'Mon, 8 Sep 2014 17:19:11 GMT'}]",2014-09-09,"[['Kolokolova', 'Antonina', ''], ['Nizamee', 'Renesa', '']]","['Phrase alignment', 'approximation', 'Hamming distance', 'edit distance', 'lower bounds']"
18874,1303.6837,Burak Demirel Burak Demirel,Burak Demirel and Corentin Briat and Mikael Johansson,"Deterministic and Stochastic Approaches to Supervisory Control Design
  for Networked Systems with Time-Varying Communication Delays",,,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a supervisory control structure for networked systems
with time-varying delays. The control structure, in which a supervisor triggers
the most appropriate controller from a multi-controller unit, aims at improving
the closed-loop performance relative to what can be obtained using a single
robust controller. Our analysis considers average dwell-time switching and is
based on a novel multiple Lyapunov-Krasovskii functional. We develop stability
conditions that can be verified by semi-definite programming, and show that the
associated state feedback synthesis problem also can be solved using convex
optimization tools. Extensions of the analysis and synthesis procedures to the
case when the evolution of the delay mode is described by a Markov chain are
also developed. Simulations on small and large-scale networked control systems
are used to illustrate the effectiveness of our approach.
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2013 14:20:00 GMT'}]",2013-03-28,"[['Demirel', 'Burak', ''], ['Briat', 'Corentin', ''], ['Johansson', 'Mikael', '']]","['switched systems', 'time-delay systems', 'stochastic switched systems', 'linear matrix inequality']"
18875,1602.06516,Debarghya Ghoshdastidar,"Debarghya Ghoshdastidar, Ambedkar Dukkipati","Uniform Hypergraph Partitioning: Provable Tensor Methods and Sampling
  Techniques",To appear in Journal of Machine Learning Research (vol 18),,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a series of recent works, we have generalised the consistency results in
the stochastic block model literature to the case of uniform and non-uniform
hypergraphs. The present paper continues the same line of study, where we focus
on partitioning weighted uniform hypergraphs---a problem often encountered in
computer vision. This work is motivated by two issues that arise when a
hypergraph partitioning approach is used to tackle computer vision problems:
(i) The uniform hypergraphs constructed for higher-order learning contain all
edges, but most have negligible weights. Thus, the adjacency tensor is nearly
sparse, and yet, not binary. (ii) A more serious concern is that standard
partitioning algorithms need to compute all edge weights, which is
computationally expensive for hypergraphs. This is usually resolved in practice
by merging the clustering algorithm with a tensor sampling strategy---an
approach that is yet to be analysed rigorously. We build on our earlier work on
partitioning dense unweighted uniform hypergraphs (Ghoshdastidar and Dukkipati,
ICML, 2015), and address the aforementioned issues by proposing provable and
efficient partitioning algorithms. Our analysis justifies the empirical success
of practical sampling techniques. We also complement our theoretical findings
by elaborate empirical comparison of various hypergraph partitioning schemes.
","[{'version': 'v1', 'created': 'Sun, 21 Feb 2016 10:52:42 GMT'}, {'version': 'v2', 'created': 'Sun, 6 Mar 2016 09:10:27 GMT'}, {'version': 'v3', 'created': 'Thu, 1 Dec 2016 17:49:56 GMT'}, {'version': 'v4', 'created': 'Wed, 17 May 2017 07:26:18 GMT'}]",2017-05-18,"[['Ghoshdastidar', 'Debarghya', ''], ['Dukkipati', 'Ambedkar', '']]","['Hypergraph partitioning', 'planted model', 'spectral method', 'tensors', 'sampling', 'subspace clustering']"
18876,1312.6098,Razvan Pascanu,Razvan Pascanu and Guido Montufar and Yoshua Bengio,"On the number of response regions of deep feed forward networks with
  piece-wise linear activations","17 pages, 9 figures",,,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper explores the complexity of deep feedforward networks with linear
pre-synaptic couplings and rectified linear activations. This is a contribution
to the growing body of work contrasting the representational power of deep and
shallow network architectures. In particular, we offer a framework for
comparing deep and shallow models that belong to the family of piecewise linear
functions based on computational geometry. We look at a deep rectifier
multi-layer perceptron (MLP) with linear outputs units and compare it with a
single layer version of the model. In the asymptotic regime, when the number of
inputs stays constant, if the shallow model has $kn$ hidden units and $n_0$
inputs, then the number of linear regions is $O(k^{n_0}n^{n_0})$. For a $k$
layer model with $n$ hidden units on each layer it is $\Omega(\left\lfloor
{n}/{n_0}\right\rfloor^{k-1}n^{n_0})$. The number
$\left\lfloor{n}/{n_0}\right\rfloor^{k-1}$ grows faster than $k^{n_0}$ when $n$
tends to infinity or when $k$ tends to infinity and $n \geq 2n_0$.
Additionally, even when $k$ is small, if we restrict $n$ to be $2n_0$, we can
show that a deep model has considerably more linear regions that a shallow one.
We consider this as a first step towards understanding the complexity of these
models and specifically towards providing suitable mathematical tools for
future analysis.
","[{'version': 'v1', 'created': 'Fri, 20 Dec 2013 20:22:31 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Jan 2014 19:53:34 GMT'}, {'version': 'v3', 'created': 'Mon, 27 Jan 2014 22:13:09 GMT'}, {'version': 'v4', 'created': 'Mon, 10 Feb 2014 17:24:12 GMT'}, {'version': 'v5', 'created': 'Fri, 14 Feb 2014 17:52:12 GMT'}]",2014-02-17,"[['Pascanu', 'Razvan', ''], ['Montufar', 'Guido', ''], ['Bengio', 'Yoshua', '']]","['Deep learning', 'artificial neural network', 'rectifier unit', 'hyperplane arrangement', 'representational power']"
18877,1307.3626,Sadegh Aliakbary,"Sadegh Aliakbary, Sadegh Motallebi, Jafar Habibi, Ali Movaghar","Learning an Integrated Distance Metric for Comparing Structure of
  Complex Networks",,,,,cs.SI cs.AI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph comparison plays a major role in many network applications. We often
need a similarity metric for comparing networks according to their structural
properties. Various network features - such as degree distribution and
clustering coefficient - provide measurements for comparing networks from
different points of view, but a global and integrated distance metric is still
missing. In this paper, we employ distance metric learning algorithms in order
to construct an integrated distance metric for comparing structural properties
of complex networks. According to natural witnesses of network similarities
(such as network categories) the distance metric is learned by the means of a
dataset of some labeled real networks. For evaluating our proposed method which
is called NetDistance, we applied it as the distance metric in
K-nearest-neighbors classification. Empirical results show that NetDistance
outperforms previous methods, at least 20 percent, with respect to precision.
","[{'version': 'v1', 'created': 'Sat, 13 Jul 2013 07:53:19 GMT'}]",2013-07-16,"[['Aliakbary', 'Sadegh', ''], ['Motallebi', 'Sadegh', ''], ['Habibi', 'Jafar', ''], ['Movaghar', 'Ali', '']]","['Complex Networks', 'Distance Metric Learning', 'Similarity Metric', 'Social Network', 'Nearest Neighbor Classification']"
18878,1607.00318,Larry Bull,Larry Bull,The Evolution of Sex through the Baldwin Effect,,,,,cs.NE q-bio.PE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper suggests that the fundamental haploid-diploid cycle of eukaryotic
sex exploits a rudimentary form of the Baldwin effect. With this explanation
for the basic cycle, the other associated phenomena can be explained as
evolution tuning the amount and frequency of learning experienced by an
organism. Using the well-known NK model of fitness landscapes it is shown that
varying landscape ruggedness varies the benefit of the haploid-diploid cycle,
whether based upon endomitosis or syngamy. The utility of pre-meiotic doubling
and recombination during the cycle are also shown to vary with landscape
ruggedness. This view is suggested as underpinning, rather than contradicting,
many existing explanations for sex.
","[{'version': 'v1', 'created': 'Fri, 1 Jul 2016 17:02:16 GMT'}, {'version': 'v10', 'created': 'Fri, 25 Nov 2016 12:31:28 GMT'}, {'version': 'v11', 'created': 'Tue, 7 Feb 2017 18:22:53 GMT'}, {'version': 'v12', 'created': 'Thu, 9 Feb 2017 18:16:48 GMT'}, {'version': 'v13', 'created': 'Fri, 24 Feb 2017 17:11:59 GMT'}, {'version': 'v14', 'created': 'Wed, 22 Mar 2017 10:47:01 GMT'}, {'version': 'v15', 'created': 'Wed, 31 May 2017 12:21:54 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Jul 2016 10:12:41 GMT'}, {'version': 'v3', 'created': 'Fri, 8 Jul 2016 10:29:17 GMT'}, {'version': 'v4', 'created': 'Thu, 28 Jul 2016 13:04:28 GMT'}, {'version': 'v5', 'created': 'Tue, 2 Aug 2016 11:25:48 GMT'}, {'version': 'v6', 'created': 'Wed, 3 Aug 2016 10:22:13 GMT'}, {'version': 'v7', 'created': 'Fri, 5 Aug 2016 09:29:32 GMT'}, {'version': 'v8', 'created': 'Mon, 8 Aug 2016 08:00:49 GMT'}, {'version': 'v9', 'created': 'Mon, 22 Aug 2016 10:11:24 GMT'}]",2017-06-01,"[['Bull', 'Larry', '']]","['Endomitosis', 'Haploid-diploid cycle', 'Meiosis', 'NK model', 'Recombination']"
18879,1702.05334,Sebastian Muskalla,"Wojciech Czerwi\'nski and S{\l}awomir Lasota and Roland Meyer and
  Sebastian Muskalla and K Narayan Kumar and Prakash Saivasan",Regular Separability of Well Structured Transition Systems,,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the languages recognized by well-structured transition systems
(WSTS) with upward and downward compatibility. Our first result shows that,
under very mild assumptions, every two disjoint WSTS languages are regular
separable: There is a regular language containing one of them and being
disjoint from the other. As a consequence, if a language as well as its
complement are both recognized by WSTS, then they are necessarily regular. In
particular, no subclass of WSTS languages beyond the regular languages is
closed under complement. Our second result shows that for Petri nets, the
complexity of the backwards coverability algorithm yields a bound on the size
of the regular separator. We complement it by a lower bound construction.
","[{'version': 'v1', 'created': 'Fri, 17 Feb 2017 13:21:45 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Dec 2017 09:08:03 GMT'}, {'version': 'v3', 'created': 'Tue, 27 Feb 2018 21:40:36 GMT'}, {'version': 'v4', 'created': 'Thu, 5 Jul 2018 15:33:54 GMT'}]",2018-07-06,"[['Czerwiński', 'Wojciech', ''], ['Lasota', 'Sławomir', ''], ['Meyer', 'Roland', ''], ['Muskalla', 'Sebastian', ''], ['Kumar', 'K Narayan', ''], ['Saivasan', 'Prakash', '']]","['regular separability', 'wsts', 'coverability languages', 'Petri nets']"
18880,1507.01777,Suman Sau,"Swagata Mandal, Suman Sau, Amlan Chakrabarti, Jogendra Saini, Sushanta
  Kumar Pal and Subhasish Chattopadhyay",FPGA based Novel High Speed DAQ System Design with Error Correction,"ISVLSI 2015. arXiv admin note: substantial text overlap with
  arXiv:1505.04569, arXiv:1503.08819",,,01A,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Present state of the art applications in the area of high energy physics
experiments (HEP), radar communication, satellite communication and bio medical
instrumentation require fault resilient data acquisition (DAQ) system with the
data rate in the order of Gbps. In order to keep the high speed DAQ system
functional in such radiation environment where direct intervention of human is
not possible, a robust and error free communication system is necessary. In
this work we present an efficient DAQ design and its implementation on field
programmable gate array (FPGA). The proposed DAQ system supports high speed
data communication (~4.8 Gbps) and achieves multi-bit error correction
capabilities. BCH code (named after Raj Bose and D. K. RayChaudhuri) has been
used for multi-bit error correction. The design has been implemented on Xilinx
Kintex-7 board and is tested for board to board communication as well as for
board to PC using PCIe (Peripheral Component Interconnect express) interface.
To the best of our knowledge, the proposed FPGA based high speed DAQ system
utilizing optical link and multi-bit error resiliency can be considered first
of its kind. Performance estimation of the implemented DAQ system is done based
on resource utilization, critical path delay, efficiency and bit error rate
(BER).
","[{'version': 'v1', 'created': 'Tue, 7 Jul 2015 12:24:25 GMT'}]",2015-07-08,"[['Mandal', 'Swagata', ''], ['Sau', 'Suman', ''], ['Chakrabarti', 'Amlan', ''], ['Saini', 'Jogendra', ''], ['Pal', 'Sushanta Kumar', ''], ['Chattopadhyay', 'Subhasish', '']]","['DAQ', 'FPGA', 'SEU', 'Error correction', 'PCIe', 'SGDMA']"
18881,1505.08155,Qun Zhang,Qun Zhang and Abdou Youssef,Performance Evaluation and Optimization of Math-Similarity Search,"15 pages, 8 figures",,,,cs.IR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Similarity search in math is to find mathematical expressions that are
similar to a user's query. We conceptualized the similarity factors between
mathematical expressions, and proposed an approach to math similarity search
(MSS) by defining metrics based on those similarity factors [11]. Our
preliminary implementation indicated the advantage of MSS compared to
non-similarity based search. In order to more effectively and efficiently
search similar math expressions, MSS is further optimized. This paper focuses
on performance evaluation and optimization of MSS. Our results show that the
proposed optimization process significantly improved the performance of MSS
with respect to both relevance ranking and recall.
","[{'version': 'v1', 'created': 'Fri, 29 May 2015 19:17:03 GMT'}]",2015-06-01,"[['Zhang', 'Qun', ''], ['Youssef', 'Abdou', '']]","['optimization', 'performance evaluation', 'math similarity search', 'relevance ranking', 'recall']"
18882,1109.0337,Jianqin Zhou,Jianqin Zhou,On discrete cosine transform,,,,,cs.IT math.IT,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The discrete cosine transform (DCT), introduced by Ahmed, Natarajan and Rao,
has been used in many applications of digital signal processing, data
compression and information hiding. There are four types of the discrete cosine
transform. In simulating the discrete cosine transform, we propose a
generalized discrete cosine transform with three parameters, and prove its
orthogonality for some new cases. A new type of discrete cosine transform is
proposed and its orthogonality is proved. Finally, we propose a generalized
discrete W transform with three parameters, and prove its orthogonality for
some new cases.
","[{'version': 'v1', 'created': 'Fri, 2 Sep 2011 01:10:34 GMT'}]",2011-09-05,"[['Zhou', 'Jianqin', '']]","['Discrete Fourier transform', 'discrete sine transform', 'discrete cosine transform', 'discrete W transform']"
18883,1710.02092,George Barmpalias Dr,George Barmpalias and Andrew Lewis-Pye,Compression of data streams down to their information content,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  According to Kolmogorov complexity, every finite binary string is
compressible to a shortest code -- its information content -- from which it is
effectively recoverable. We investigate the extent to which this holds for
infinite binary sequences (streams). We devise a new coding method which
uniformly codes every stream $X$ into an algorithmically random stream $Y$, in
such a way that the first $n$ bits of $X$ are recoverable from the first
$I(X\upharpoonright_n)$ bits of $Y$, where $I$ is any partial computable
information content measure which is defined on all prefixes of $X$, and where
$X\upharpoonright_n$ is the initial segment of $X$ of length $n$. As a
consequence, if $g$ is any computable upper bound on the initial segment
prefix-free complexity of $X$, then $X$ is computable from an algorithmically
random $Y$ with oracle-use at most $g$. Alternatively (making no use of such a
computable bound $g$) one can achieve an oracle-use bounded above by
$K(X\upharpoonright_n)+\log n$. This provides a strong analogue of Shannon's
source coding theorem for algorithmic information theory.
","[{'version': 'v1', 'created': 'Thu, 5 Oct 2017 16:15:07 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Oct 2017 05:23:05 GMT'}, {'version': 'v3', 'created': 'Tue, 20 Nov 2018 10:28:23 GMT'}, {'version': 'v4', 'created': 'Tue, 22 Jan 2019 15:11:10 GMT'}]",2019-01-23,"[['Barmpalias', 'George', ''], ['Lewis-Pye', 'Andrew', '']]","['Source coding', 'Algorithmic Information theory', 'Compression', 'Kolmogorov complexity', 'Prefixfree codes; Layered Kraft-Chaitin theorem']"
18884,1303.7122,Fabi\'an Riquelme,Andreas Polym\'eris and Fabi\'an Riquelme,"On the Complexity of the Decisive Problem in Simple, Regular and
  Weighted Games",12 pages,,,,cs.GT cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the computational complexity of an important property of simple,
regular and weighted games, which is decisiveness. We show that this concept
can naturally be represented in the context of hypergraph theory, and that
decisiveness can be decided for simple games in quasi-polynomial time, and for
regular and weighted games in polynomial time. The strongness condition poses
the main difficulties, while properness reduces the complexity of the problem,
especially if it is amplified by regularity. On the other hand, regularity also
allows to specify the problem instances much more economically, implying a
reconsideration of the corresponding complexity measure that, as we prove, has
important structural as well as algorithmic consequences.
","[{'version': 'v1', 'created': 'Thu, 28 Mar 2013 13:51:25 GMT'}, {'version': 'v2', 'created': 'Tue, 9 Jul 2013 11:44:39 GMT'}]",2013-07-10,"[['Polyméris', 'Andreas', ''], ['Riquelme', 'Fabián', '']]","['Simple Game', 'Regular Game', 'Weighted Game', 'Hypergraph', 'Strongness', 'Decisiveness', 'Complexity']"
18885,1704.01603,Christina Lioma Assoc. Prof,Christina Lioma and Birger Larsen and Peter Ingwersen,"Preliminary Experiments using Subjective Logic for the
  Polyrepresentation of Information Needs",,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  According to the principle of polyrepresentation, retrieval accuracy may
improve through the combination of multiple and diverse information object
representations about e.g. the context of the user, the information sought, or
the retrieval system. Recently, the principle of polyrepresentation was
mathematically expressed using subjective logic, where the potential
suitability of each representation for improving retrieval performance was
formalised through degrees of belief and uncertainty. No experimental evidence
or practical application has so far validated this model. We extend the work of
Lioma et al. (2010), by providing a practical application and analysis of the
model. We show how to map the abstract notions of belief and uncertainty to
real-life evidence drawn from a retrieval dataset. We also show how to estimate
two different types of polyrepresentation assuming either (a) independence or
(b) dependence between the information objects that are combined. We focus on
the polyrepresentation of different types of context relating to user
information needs (i.e. work task, user background knowledge, ideal answer) and
show that the subjective logic model can predict their optimal combination
prior and independently to the retrieval process.
","[{'version': 'v1', 'created': 'Wed, 5 Apr 2017 18:45:31 GMT'}]",2017-04-07,"[['Lioma', 'Christina', ''], ['Larsen', 'Birger', ''], ['Ingwersen', 'Peter', '']]","['Polyrepresentation', 'Subjective Logic', 'Opinion Fusion']"
18886,1506.04384,Khalid Khan,Khalid Khan and D.K. Lobiyal,"Performance evaluation of different optimization techniques for coverage
  and connectivity control in backbone based wireless networks","15 pages, 16 figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, performance evaluation of Newton-Raphson and Conjugate
Gradient method has been studied in comparison to Steepest Decent method for
coverage and connectivity control in backbone based wireless networks. In order
to design such wireless networks, the main challenge is to ensure network
requirements such as network coverage and connectivity. To optimize coverage
and connectivity, backbone nodes will be repositioned by the use of mobility
control based on above mentioned methods. Thus the network get self organized
which autonomously achieve energy minimizing configuration. Furthermore by
simulation using MATLAB R2010a, methods are compared on the basis of optimized
cost, number of iterations and elapsed time i.e. total time taken to execute
the algorithm.
","[{'version': 'v1', 'created': 'Sun, 14 Jun 2015 12:09:26 GMT'}]",2015-06-16,"[['Khan', 'Khalid', ''], ['Lobiyal', 'D. K.', '']]","['Coverage', 'Connectivity; Steepest descent, Newton-Raphson', 'Conjugate']"
18887,0806.3629,Chau Yuen,"Chau Yuen, Woon Hau Chin, Yong Liang Guan, Wenhua Chen, Taoyi Tee","Bi-Directional Multi-Antenna Relay Communications with Wireless Network
  Coding",,VTC Spring 2008,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider a two-way or bidirectional communications system
with a relay equipped with multiple antennas. We show that when the downlink
channel state information is not known at the relay, the benefit of having
additional antennas at the relay can only be obtained by using decode and
forward (DF) but not amplify and forward (AF). The gain becomes significant
when we employ transmit diversity together with wireless network coding. We
also demonstrate how the performance of such system can be improved by
performing antenna selection at the relay. Our results show that if downlink
channel state information is known at the relay, network coding may not provide
additional gain than simple antenna selection scheme.
","[{'version': 'v1', 'created': 'Mon, 23 Jun 2008 07:52:35 GMT'}]",2008-06-24,"[['Yuen', 'Chau', ''], ['Chin', 'Woon Hau', ''], ['Guan', 'Yong Liang', ''], ['Chen', 'Wenhua', ''], ['Tee', 'Taoyi', '']]","['wireless network coding', 'two-way or bidirectional communications', 'multi-antenna relay', 'transmit diversity']"
18888,1704.07114,Ilkka Norros,"Hannu Reittu, F\""ul\""op Bazs\'o, Ilkka Norros","Regular Decomposition: an information and graph theoretic approach to
  stochastic block models","Simulation example added. Poisson block model code length estimates
  changed",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A method for compression of large graphs and non-negative matrices to a block
structure is proposed. Szemer\'edi's regularity lemma is used as heuristic
motivation of the significance of stochastic block models. Another ingredient
of the method is Rissanen's minimum description length principle (MDL). We
propose practical algorithms and provide theoretical results on the accuracy of
the method.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 09:51:49 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Jun 2017 11:35:48 GMT'}, {'version': 'v3', 'created': 'Tue, 20 Jun 2017 11:21:32 GMT'}, {'version': 'v4', 'created': 'Tue, 23 Oct 2018 07:22:57 GMT'}, {'version': 'v5', 'created': 'Mon, 12 Aug 2019 18:22:30 GMT'}]",2019-08-14,"[['Reittu', 'Hannu', ''], ['Bazsó', 'Fülöp', ''], ['Norros', 'Ilkka', '']]","['Szemer´edi’s Regularity Lemma', 'Minimum Description LengthPrinciple', 'stochastic block model', 'big data']"
18889,1701.02896,Mohammed Alsaedi Dr,Mohammed Alsaedi,"Colored Image Encryption and Decryption Using Chaotic Lorenz System and
  DCT2","22 pages, 15 Figures, IJCSIS",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a scheme for the encryption and decryption of colored images
by using the Lorenz system and the discrete cosine transform in two dimensions
(DCT2) is proposed. Although chaos is random, it has deterministic features
that can be used for encryption; further, the same sequences can be produced at
the transmitter and receiver under the same initial conditions. Another
property of DCT2 is that the energy is concentrated in some elements of the
coefficients. These two properties are used to efficiently encrypt and recover
the image at the receiver by using three different keys with three different
predefined number of shifts for each instance of key usage. Simulation results
and statistical analysis show that the scheme high performance in weakening the
correlation between the pixels of the image that resulted from the inverse of
highest energy values of DCT2 that form 99.9 % of the energy as well as those
of the difference image.
","[{'version': 'v1', 'created': 'Wed, 11 Jan 2017 09:11:57 GMT'}]",2017-01-12,"[['Alsaedi', 'Mohammed', '']]","['Encryption', 'Decryption', 'Lorenz', 'Discrete cosine transform in two dimension (DCT2)', 'Chaos']"
18890,1109.6314,Marco Liuni Mr.,"M. Liuni, A. R\""obel, M. Romito, X. Rodet",An Entropy Based Method for Local Time-Adaptation of the Spectrogram,,"CMMR 2010, LNCS 6684, pp. 60-75, 2011",,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a method for automatic local time-adaptation of the spectrogram of
audio signals: it is based on the decomposition of a signal within a Gabor
multi-frame through the STFT operator. The sparsity of the analysis in every
individual frame of the multi-frame is evaluated through the R\'enyi entropy
measures: the best local resolution is determined minimizing the entropy
values. The overall spectrogram of the signal we obtain thus provides local
optimal resolution adaptively evolving over time. We give examples of the
performance of our algorithm with an instrumental sound and a synthetic one,
showing the improvement in spectrogram displaying obtained with an automatic
adaptation of the resolution. The analysis operator is invertible, thus leading
to a perfect reconstruction of the original signal through the analysis
coefficients.
","[{'version': 'v1', 'created': 'Tue, 27 Sep 2011 08:32:50 GMT'}]",2011-09-29,"[['Liuni', 'M.', ''], ['Röbel', 'A.', ''], ['Romito', 'M.', ''], ['Rodet', 'X.', '']]","['adaptive spectrogram', 'sound representation', 'sound analysis', 'sound synthesis', 'R´enyi entropy', 'sparsity measures', 'frame theory']"
18891,0704.3316,Ciro Cattuto,"Ciro Cattuto, Andrea Baldassarri, Vito D. P. Servedio, Vittorio Loreto",Vocabulary growth in collaborative tagging systems,"6 pages, 7 figures",,,,cs.IR cond-mat.stat-mech cs.CY physics.data-an,,"  We analyze a large-scale snapshot of del.icio.us and investigate how the
number of different tags in the system grows as a function of a suitably
defined notion of time. We study the temporal evolution of the global
vocabulary size, i.e. the number of distinct tags in the entire system, as well
as the evolution of local vocabularies, that is the growth of the number of
distinct tags used in the context of a given resource or user. In both cases,
we find power-law behaviors with exponents smaller than one. Surprisingly, the
observed growth behaviors are remarkably regular throughout the entire history
of the system and across very different resources being bookmarked. Similar
sub-linear laws of growth have been observed in written text, and this
qualitative universality calls for an explanation and points in the direction
of non-trivial cognitive processes in the complex interaction patterns
characterizing collaborative tagging.
","[{'version': 'v1', 'created': 'Wed, 25 Apr 2007 07:47:40 GMT'}]",2007-05-23,"[['Cattuto', 'Ciro', ''], ['Baldassarri', 'Andrea', ''], ['Servedio', 'Vito D. P.', ''], ['Loreto', 'Vittorio', '']]","['folksonomies', 'collaborative tagging', 'statistical analysis', 'growth processes', 'tag vocabulary', 'social software', 'research']"
18892,1111.6825,Mohammad Assarian,"Alireza Amirshahi, Mahmood Fathi, Morteza Romoozi and Mohammad
  Assarian",A Fuzzy Realistic Mobility Model For Ad hoc Networks,,"International journal of computer science Issues,Vol. 8,Issue 5,No
  3, 2011, 42-50",,,cs.AI cs.NI,http://creativecommons.org/licenses/by/3.0/,"  Realistic mobility models can demonstrate more precise evaluation results
because their parameters are closer to the reality. In this paper a realistic
Fuzzy Mobility Model has been proposed. This model has rules which is
changeable depending on nodes and environment conditions. This model is more
complete and precise than the other mobility models and this is the advantage
of this model. After simulation, it was found out that not only considering
nodes movement as being imprecise (fuzzy) has a positive effects on most of ad
hoc network parameters, but also, more importantly as they are closer to the
real world condition, they can have a more positive effect on the
implementation of ad hoc network protocols.
","[{'version': 'v1', 'created': 'Tue, 29 Nov 2011 14:36:40 GMT'}]",2011-11-30,"[['Amirshahi', 'Alireza', ''], ['Fathi', 'Mahmood', ''], ['Romoozi', 'Morteza', ''], ['Assarian', 'Mohammad', '']]","['Mobility Model', 'Ad hoc Networks', 'Realistic Mobility Model', 'Fuzzy Systems', 'Nodes Signal']"
18893,1712.06563,Joel Lehman,"Joel Lehman, Jay Chen, Jeff Clune, Kenneth O. Stanley","Safe Mutations for Deep and Recurrent Neural Networks through Output
  Gradients",,,,,cs.NE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While neuroevolution (evolving neural networks) has a successful track record
across a variety of domains from reinforcement learning to artificial life, it
is rarely applied to large, deep neural networks. A central reason is that
while random mutation generally works in low dimensions, a random perturbation
of thousands or millions of weights is likely to break existing functionality,
providing no learning signal even if some individual weight changes were
beneficial. This paper proposes a solution by introducing a family of safe
mutation (SM) operators that aim within the mutation operator itself to find a
degree of change that does not alter network behavior too much, but still
facilitates exploration. Importantly, these SM operators do not require any
additional interactions with the environment. The most effective SM variant
capitalizes on the intriguing opportunity to scale the degree of mutation of
each individual weight according to the sensitivity of the network's outputs to
that weight, which requires computing the gradient of outputs with respect to
the weights (instead of the gradient of error, as in conventional deep
learning). This safe mutation through gradients (SM-G) operator dramatically
increases the ability of a simple genetic algorithm-based neuroevolution method
to find solutions in high-dimensional domains that require deep and/or
recurrent neural networks (which tend to be particularly brittle to mutation),
including domains that require processing raw pixels. By improving our ability
to evolve deep neural networks, this new safer approach to mutation expands the
scope of domains amenable to neuroevolution.
","[{'version': 'v1', 'created': 'Mon, 18 Dec 2017 18:16:51 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Jan 2018 18:45:26 GMT'}, {'version': 'v3', 'created': 'Tue, 1 May 2018 20:18:32 GMT'}]",2018-05-03,"[['Lehman', 'Joel', ''], ['Chen', 'Jay', ''], ['Clune', 'Jeff', ''], ['Stanley', 'Kenneth O.', '']]","['Neuroevolution', 'mutation', 'deep learning', 'recurrent networks']"
18894,1007.3926,Dakshina Ranjan Kisku,"Dakshina Ranjan Kisku, Phalguni Gupta, Jamuna Kanta Sing","Ear Identification by Fusion of Segmented Slice Regions using Invariant
  Features: An Experimental Manifold with Dual Fusion Approach","12 pages, 3 figures",,,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper proposes a robust ear identification system which is developed by
fusing SIFT features of color segmented slice regions of an ear. The proposed
ear identification method makes use of Gaussian mixture model (GMM) to build
ear model with mixture of Gaussian using vector quantization algorithm and K-L
divergence is applied to the GMM framework for recording the color similarity
in the specified ranges by comparing color similarity between a pair of
reference ear and probe ear. SIFT features are then detected and extracted from
each color slice region as a part of invariant feature extraction. The
extracted keypoints are then fused separately by the two fusion approaches,
namely concatenation and the Dempster-Shafer theory. Finally, the fusion
approaches generate two independent augmented feature vectors which are used
for identification of individuals separately. The proposed identification
technique is tested on IIT Kanpur ear database of 400 individuals and is found
to achieve 98.25% accuracy for identification while top 5 matched criteria is
set for each subject.
","[{'version': 'v1', 'created': 'Wed, 21 Jul 2010 14:09:33 GMT'}]",2010-07-23,"[['Kisku', 'Dakshina Ranjan', ''], ['Gupta', 'Phalguni', ''], ['Sing', 'Jamuna Kanta', '']]","['Ear biometrics', 'SIFT features', 'Color Model', 'Gaussian Mixture Model', 'K-L divergence', 'Fusion', 'DempsterShafer Theory']"
18895,1406.5596,Binu V.P,"V P Binu, A Sreekumar",An Epitome of Multi Secret Sharing Schemes for General Access Structure,,"International Journal of Information Processing, 8(2), 13-28, 2014
  ISSN : 0973-8215",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Secret sharing schemes are widely used now a days in various applications,
which need more security, trust and reliability. In secret sharing scheme, the
secret is divided among the participants and only authorized set of
participants can recover the secret by combining their shares. The authorized
set of participants are called access structure of the scheme. In Multi-Secret
Sharing Scheme (MSSS), k different secrets are distributed among the
participants, each one according to an access structure. Multi-secret sharing
schemes have been studied extensively by the cryptographic community. Number of
schemes are proposed for the threshold multi-secret sharing and multi-secret
sharing according to generalized access structure with various features. In
this survey we explore the important constructions of multi-secret sharing for
the generalized access structure with their merits and demerits. The features
like whether shares can be reused, participants can be enrolled or dis-enrolled
efficiently, whether shares have to modified in the renewal phase etc., are
considered for the evaluation.
","[{'version': 'v1', 'created': 'Sat, 21 Jun 2014 10:35:30 GMT'}]",2014-06-24,"[['Binu', 'V P', ''], ['Sreekumar', 'A', '']]","['Cheater Identification', 'General Access Structure', 'Multi-secret Sharing', 'Secret Sharing', 'Verifiability']"
18896,1504.06876,Dmitry Zakablukov,Dmitry V. Zakablukov,"On Asymptotic Gate Complexity and Depth of Reversible Circuits Without
  Additional Memory","In English, 18 pages, 4 figures",,,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reversible computation is one of the most promising emerging technologies of
the future. The usage of reversible circuits in computing devices can lead to a
significantly lower power consumption. In this paper we study reversible logic
circuits consisting of NOT, CNOT and 2-CNOT gates. We introduce a set $F(n,q)$
of all transformations $\mathbb Z_2^n \to \mathbb Z_2^n$ that can be
implemented by reversible circuits with $(n+q)$ inputs. We define the Shannon
gate complexity function $L(n,q)$ and the depth function $D(n,q)$ as functions
of $n$ and the number of additional inputs $q$. First, we prove general lower
bounds for functions $L(n,q)$ and $D(n,q)$. Second, we introduce a new group
theory based synthesis algorithm, which can produce a circuit $\mathfrak S$
without additional inputs and with the gate complexity $L(\mathfrak S) \leq 3n
2^{n+4}(1+o(1)) \mathop / \log_2 n$. Using these bounds, we state that almost
every reversible circuit with no additional inputs, consisting of NOT, CNOT and
2-CNOT gates, implements a transformation from $F(n,0)$ with the gate
complexity $L(n,0) \asymp n 2^n \mathop / \log_2 n$ and with the depth $D(n,0)
\geq 2^n(1-o(1)) \mathop / (3\log_2 n)$.
","[{'version': 'v1', 'created': 'Sun, 26 Apr 2015 20:04:24 GMT'}, {'version': 'v2', 'created': 'Thu, 28 May 2015 21:24:07 GMT'}, {'version': 'v3', 'created': 'Sun, 14 Feb 2016 06:02:36 GMT'}]",2016-02-16,"[['Zakablukov', 'Dmitry V.', '']]","['reversible logic', 'gate complexity', 'circuit depth', 'asymptoticbounds']"
18897,1109.3150,Abhishek  Sinha,"Abhishek Sinha, Swagatam Das, Athanasios V. Vasilakos","On Periodic Node Deployment in Wireless Sensor Networks: A Statistical
  Analysis",Submitted for review in Journal of Network and Systems Management,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rapid progress made in the field of sensor technology, wireless
communication, and computer networks in recent past, led to the development of
wireless Ad-hoc sensor networks, consisting of small, low-cost sensors, which
can monitor wide and remote areas with precision and liveliness unseen to the
date without the intervention of a human operator. This work comes up with a
stochastic model for periodic sensor-deployment (in face of their limited
amount of battery-life) to maintain a minimal node-connectivity in wireless
sensor networks. The node deployment cannot be modeled by using results from
conventional continuous birth-death process, since new nodes are added to the
network in bursts, i.e. the birth process is not continuous in practical
situations. We analyze the periodic node deployment process using discrete
birth-continuous death process and obtain two important statistical measures of
the existing number of nodes in the network, namely the mean and variance. We
show that the above mentioned sequences of mean and variances always converge
to finite steady state values, thus ensuring the stability of the system. We
also develop a cost function for the process of periodic deployment of sensor
nodes and minimize it to find the optimal time ({\tau}) and optimum number of
re-deployment (q) for maintaining minimum connectivity in the network.
","[{'version': 'v1', 'created': 'Wed, 14 Sep 2011 17:51:36 GMT'}]",2011-09-15,"[['Sinha', 'Abhishek', ''], ['Das', 'Swagatam', ''], ['Vasilakos', 'Athanasios V.', '']]","['Wireless Sensor Networks (WSN)', 'Ad-hoc', 'birth-death process', 'stochastic model', 'stability', 'node']"
18898,1009.2476,Nikolai Stoianov,Nikolai Stoianov,One software tool for testing square s-boxes,"Acknowledgment-The work presented in this paper has been performed in
  the framework of the EU Project INDECT--grant agreement number: 218086. 12th
  International Conference on Research in Telecommunication Technologies RTT
  2010 (September 8 - 10), Ostrava, Czech Republic",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An encryption technique is widely used to keep data confidential. Most of the
block symmetric algorithms use substitution functions. Often this functions use
so called S-BOX matrix. In this paper author presents one software tool for
testing and measuring square s-boxes. Based of information theory functions for
testing static and dynamic criteria are presented. These criteria are
mathematically defined for square s-boxes. Two new criteria ""private criteria""
a proposed and pseudo codes for they creation and testing are presented.
","[{'version': 'v1', 'created': 'Mon, 13 Sep 2010 19:01:11 GMT'}]",2010-09-14,"[['Stoianov', 'Nikolai', '']]","['cryptography', 's-box', 'cryptanalysis', 'software tool', 'AES']"
18899,1212.0975,Arya Iranmehr,"Hamed Masnadi-Shirazi, Nuno Vasconcelos and Arya Iranmehr",Cost-Sensitive Support Vector Machines,"32 pages, 4 figures",,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new procedure for learning cost-sensitive SVM(CS-SVM) classifiers is
proposed. The SVM hinge loss is extended to the cost sensitive setting, and the
CS-SVM is derived as the minimizer of the associated risk. The extension of the
hinge loss draws on recent connections between risk minimization and
probability elicitation. These connections are generalized to cost-sensitive
classification, in a manner that guarantees consistency with the cost-sensitive
Bayes risk, and associated Bayes decision rule. This ensures that optimal
decision rules, under the new hinge loss, implement the Bayes-optimal
cost-sensitive classification boundary. Minimization of the new hinge loss is
shown to be a generalization of the classic SVM optimization problem, and can
be solved by identical procedures. The dual problem of CS-SVM is carefully
scrutinized by means of regularization theory and sensitivity analysis and the
CS-SVM algorithm is substantiated. The proposed algorithm is also extended to
cost-sensitive learning with example dependent costs. The minimum cost
sensitive risk is proposed as the performance measure and is connected to ROC
analysis through vector optimization. The resulting algorithm avoids the
shortcomings of previous approaches to cost-sensitive SVM design, and is shown
to have superior experimental performance on a large number of cost sensitive
and imbalanced datasets.
","[{'version': 'v1', 'created': 'Wed, 5 Dec 2012 09:24:11 GMT'}, {'version': 'v2', 'created': 'Sun, 15 Feb 2015 11:17:57 GMT'}]",2015-02-17,"[['Masnadi-Shirazi', 'Hamed', ''], ['Vasconcelos', 'Nuno', ''], ['Iranmehr', 'Arya', '']]","['Cost Sensitive Learning', 'SVM', 'probability elicitation', 'Bayes consistent loss']"
18900,1307.4264,Rong Zheng,Huy Nguyen and Rong Zheng,A Data-driven Study of Influences in Twitter Communities,11 pages,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a quantitative study of Twitter, one of the most popular
micro-blogging services, from the perspective of user influence. We crawl
several datasets from the most active communities on Twitter and obtain 20.5
million user profiles, along with 420.2 million directed relations and 105
million tweets among the users. User influence scores are obtained from
influence measurement services, Klout and PeerIndex. Our analysis reveals
interesting findings, including non-power-law influence distribution, strong
reciprocity among users in a community, the existence of homophily and
hierarchical relationships in social influences. Most importantly, we observe
that whether a user retweets a message is strongly influenced by the first of
his followees who posted that message. To capture such an effect, we propose
the first influencer (FI) information diffusion model and show through
extensive evaluation that compared to the widely adopted independent cascade
model, the FI model is more stable and more accurate in predicting influence
spreads in Twitter communities.
","[{'version': 'v1', 'created': 'Tue, 16 Jul 2013 13:07:24 GMT'}]",2013-07-17,"[['Nguyen', 'Huy', ''], ['Zheng', 'Rong', '']]","['Influence', 'Online social networks', 'First-influencer model', 'Twitter']"
18901,1410.3970,Haythem Ghazouani,Haythem Ghazouani,Shape and Color Object Tracking for Real-Time Robotic Navigation,in French,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a real-time approach for single-colored ball detection
and tracking. The approach consists of two main phases. In a first offline
calibration phase, the intrinsic parameters of the camera and the radial
distortion are estimated, and a classification of colors is learned from a
sample image of colored balls. The second phase consists of four main steps:
(1) color segmentation of the input image into several regions based on the
offline classification, (2) robust estimation of the circle parameters (3)
refinement of the circle parameters, and (4) ball tracking. The experimental
results showed that the approach presents a good compromise between suitability
for real-time navigation and robustness to occlusions, background congestion
and colors interference in the scene.
","[{'version': 'v1', 'created': 'Wed, 15 Oct 2014 08:42:25 GMT'}]",2014-10-16,"[['Ghazouani', 'Haythem', '']]","['Color segmentation', 'Object detection', 'Object tracking', 'Visual navigation']"
18902,1610.03056,Md Saifur Rahman,Sridhar Rajagopal and Md. Saifur Rahman,Multi-User MIMO with flexible numerology for 5G,"6 pages, 10 figures",,,,cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Flexible numerologies are being considered as part of designs for 5G systems
to support vertical services with diverse requirements such as enhanced mobile
broadband, ultra-reliable low-latency communications, and massive machine type
communication. Different vertical services can be multiplexed in either
frequency domain, time domain, or both. In this paper, we investigate the use
of spatial multiplexing of services using MU-MIMO where the numerologies for
different users may be different. The users are grouped according to the chosen
numerology and a separate pre-coder and FFT size is used per numerology at the
transmitter. The pre-coded signals for the multiple numerologies are added in
the time domain before transmission. We analyze the performance gains of this
approach using capacity analysis and link level simulations using conjugate
beamforming and signal-to-leakage noise ratio maximization techniques. We show
that the MU interference between users with different numerologies can be
suppressed efficiently with reasonable number of antennas at the base-station.
This feature enables MU-MIMO techniques to be applied for 5G across different
numerologies.
","[{'version': 'v1', 'created': 'Sun, 9 Oct 2016 02:59:27 GMT'}]",2016-10-12,"[['Rajagopal', 'Sridhar', ''], ['Rahman', 'Md. Saifur', '']]","['5G', 'numerology', 'MU MIMO']"
18903,1603.09712,Nihar Athreyas,"Nihar Athreyas, Zhiguo Lai, Jai Gupta and Dev Gupta",Analog Signal Processing Approach for Coarse and Fine Depth Estimation,"appears in Signal & Image Processing : An International Journal
  (SIPIJ) Vol.5, No.6, December 2014. arXiv admin note: substantial text
  overlap with arXiv:1411.3929",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Imaging and Image sensors is a field that is continuously evolving. There are
new products coming into the market every day. Some of these have very severe
Size, Weight and Power constraints whereas other devices have to handle very
high computational loads. Some require both these conditions to be met
simultaneously. Current imaging architectures and digital image processing
solutions will not be able to meet these ever increasing demands. There is a
need to develop novel imaging architectures and image processing solutions to
address these requirements. In this work we propose analog signal processing as
a solution to this problem. The analog processor is not suggested as a
replacement to a digital processor but it will be used as an augmentation
device which works in parallel with the digital processor, making the system
faster and more efficient. In order to show the merits of analog processing two
stereo correspondence algorithms are implemented. We propose novel
modifications to the algorithms and new imaging architectures which,
significantly reduces the computation time.
","[{'version': 'v1', 'created': 'Tue, 6 Jan 2015 15:07:41 GMT'}]",2016-04-01,"[['Athreyas', 'Nihar', ''], ['Lai', 'Zhiguo', ''], ['Gupta', 'Jai', ''], ['Gupta', 'Dev', '']]","['Analog Signal Processing', 'Parallel Architecture', 'Image Alignment & Stereo Correspondence']"
18904,1511.04893,Simon Halfon,"Dmitry Chistikov, Christoph Haase, Simon Halfon",Context-Free Commutative Grammars with Integer Counters and Resets,33 pages,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the computational complexity of reachability, coverability and
inclusion for extensions of context-free commutative grammars with integer
counters and reset operations on them. Those grammars can alternatively be
viewed as an extension of communication-free Petri nets. Our main results are
that reachability and coverability are inter-reducible and both NP-complete. In
particular, this class of commutative grammars enjoys semi-linear reachability
sets. We also show that the inclusion problem is, in general, coNEXP-complete
and already $\Pi_2^\text{P}$-complete for grammars with only one non-terminal
symbol. Showing the lower bound for the latter result requires us to develop a
novel $\Pi_2^\text{P}$-complete variant of the classic subset sum problem.
","[{'version': 'v1', 'created': 'Mon, 16 Nov 2015 10:15:40 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Jun 2016 08:50:37 GMT'}]",2016-06-27,"[['Chistikov', 'Dmitry', ''], ['Haase', 'Christoph', ''], ['Halfon', 'Simon', '']]","['context-free commutative grammars', 'communication-free Petrinets', 'reset nets', 'vector addition systems with states', 'Presburger arithmetic', 'subset sum']"
18905,1502.05676,Loet Leydesdorff,"Loet Leydesdorff, Gaston Heimeriks, and Daniele Rotolo","Journal Portfolio Analysis for Countries, Cities, and Organizations:
  Maps and Comparisons","accepted for publication by the Journal of the Association for
  Information Science and Technology (March 2015)",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using Web-of-Science data, portfolio analysis in terms of journal coverage
can be projected on a base map for units of analysis such as countries, cities,
universities, and firms. The units of analysis under study can be compared
statistically across the 10,000+ journals. The interdisciplinarity of the
portfolios is measured using Rao-Stirling diversity or Zhang et al.'s (in
press) improved measure 2D3. At the country level we find regional
differentiation (e.g., Latin-American or Asian countries), but also a major
divide between advanced and less-developed countries. Israel and Israeli cities
outperform other nations and cities in terms of diversity. Universities appear
to be specifically related to firms when a number of these units are
exploratively compared. The instrument is relatively simple and
straightforward, and one can generalize the application to any document set
retrieved from WoS. Further instruction is provided online at
http://www.leydesdorff.net/portfolio .
","[{'version': 'v1', 'created': 'Thu, 19 Feb 2015 19:41:11 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Mar 2015 12:42:19 GMT'}, {'version': 'v3', 'created': 'Fri, 24 Apr 2015 13:05:46 GMT'}]",2015-04-27,"[['Leydesdorff', 'Loet', ''], ['Heimeriks', 'Gaston', ''], ['Rotolo', 'Daniele', '']]","['map', 'journal', 'portfolio', 'firm', 'university', 'city', 'country']"
18906,1705.05756,Witold Rudnicki,Krzysztof Mnich and Witold R. Rudnicki,"All-relevant feature selection using multidimensional filters with
  exhaustive search","27 pages, 11 figures, 3 tables",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a method for identification of the informative variables
in the information system with discrete decision variables. It is targeted
specifically towards discovery of the variables that are non-informative when
considered alone, but are informative when the synergistic interactions between
multiple variables are considered. To this end, the mutual entropy of all
possible k-tuples of variables with decision variable is computed. Then, for
each variable the maximal information gain due to interactions with other
variables is obtained. For non-informative variables this quantity conforms to
the well known statistical distributions. This allows for discerning truly
informative variables from non-informative ones. For demonstration of the
approach, the method is applied to several synthetic datasets that involve
complex multidimensional interactions between variables. It is capable of
identifying most important informative variables, even in the case when the
dimensionality of the analysis is smaller than the true dimensionality of the
problem. What is more, the high sensitivity of the algorithm allows for
detection of the influence of nuisance variables on the response variable.
","[{'version': 'v1', 'created': 'Tue, 16 May 2017 15:11:10 GMT'}]",2017-05-17,"[['Mnich', 'Krzysztof', ''], ['Rudnicki', 'Witold R.', '']]","['All-relevant feature selection', 'mutual information', 'multi-dimensional filters']"
18907,1507.00093,Prasad H L,H. L. Prasad and Shalabh Bhatnagar,A Study of Gradient Descent Schemes for General-Sum Stochastic Games,,,,,cs.LG cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Zero-sum stochastic games are easy to solve as they can be cast as simple
Markov decision processes. This is however not the case with general-sum
stochastic games. A fairly general optimization problem formulation is
available for general-sum stochastic games by Filar and Vrieze [2004]. However,
the optimization problem there has a non-linear objective and non-linear
constraints with special structure. Since gradients of both the objective as
well as constraints of this optimization problem are well defined, gradient
based schemes seem to be a natural choice. We discuss a gradient scheme tuned
for two-player stochastic games. We show in simulations that this scheme indeed
converges to a Nash equilibrium, for a simple terrain exploration problem
modelled as a general-sum stochastic game. However, it turns out that only
global minima of the optimization problem correspond to Nash equilibria of the
underlying general-sum stochastic game, while gradient schemes only guarantee
convergence to local minima. We then provide important necessary conditions for
gradient schemes to converge to Nash equilibria in general-sum stochastic
games.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2015 02:37:33 GMT'}]",2015-07-02,"[['Prasad', 'H. L.', ''], ['Bhatnagar', 'Shalabh', '']]","['Game theory', 'Nonlinear programming', 'Non-convex constrained problems', 'Discounted cost criteria', 'General-sum stochastic games', 'Nash equilibrium']"
18908,1409.6831,Shang Shang,"Shang Shang, Tiance Wang, Paul Cuff, Sanjeev Kulkarni","The Application of Differential Privacy for Rank Aggregation: Privacy
  and Accuracy",Fusion 2014,,,,cs.AI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The potential risk of privacy leakage prevents users from sharing their
honest opinions on social platforms. This paper addresses the problem of
privacy preservation if the query returns the histogram of rankings. The
framework of differential privacy is applied to rank aggregation. The error
probability of the aggregated ranking is analyzed as a result of noise added in
order to achieve differential privacy. Upper bounds on the error rates for any
positional ranking rule are derived under the assumption that profiles are
uniformly distributed. Simulation results are provided to validate the
probabilistic analysis.
","[{'version': 'v1', 'created': 'Wed, 24 Sep 2014 05:19:32 GMT'}]",2014-09-25,"[['Shang', 'Shang', ''], ['Wang', 'Tiance', ''], ['Cuff', 'Paul', ''], ['Kulkarni', 'Sanjeev', '']]","['Rank Aggregation', 'Privacy', 'Accuracy']"
18909,1401.1043,Ibrahim A,"A. Ibrahim, Shivakumar Sastry and P.S. Sastry",Discovering Compressing Serial Episodes from Event Sequences,27 pages 3 figure,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most pattern mining methods output a very large number of frequent patterns
and isolating a small but relevant subset is a challenging problem of current
interest in frequent pattern mining. In this paper we consider discovery of a
small set of relevant frequent episodes from data sequences. We make use of the
Minimum Description Length principle to formulate the problem of selecting a
subset of episodes. Using an interesting class of serial episodes with
inter-event constraints and a novel encoding scheme for data using such
episodes, we present algorithms for discovering small set of episodes that
achieve good data compression. Using an example of the data streams obtained
from distributed sensors in a composable coupled conveyor system, we show that
our method is very effective in unearthing highly relevant episodes and that
our scheme also achieves good data compression.
","[{'version': 'v1', 'created': 'Mon, 6 Jan 2014 11:16:01 GMT'}, {'version': 'v2', 'created': 'Sat, 11 Oct 2014 10:47:52 GMT'}]",2014-10-14,"[['Ibrahim', 'A.', ''], ['Sastry', 'Shivakumar', ''], ['Sastry', 'P. S.', '']]","['Frequent Episodes', 'Serial Episodes', 'Mining Event Sequences', 'DiscoveringCompressing Patterns', 'MDL', 'Inter-Event-Time constraints']"
18910,1606.07150,Annamalai Narayanan,"Annamalai Narayanan, Liu Yang, Lihui Chen and Liu Jinliang",Adaptive and Scalable Android Malware Detection through Online Learning,,,,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is well-known that malware constantly evolves so as to evade detection and
this causes the entire malware population to be non-stationary. Contrary to
this fact, prior works on machine learning based Android malware detection have
assumed that the distribution of the observed malware characteristics (i.e.,
features) do not change over time. In this work, we address the problem of
malware population drift and propose a novel online machine learning based
framework, named DroidOL to handle it and effectively detect malware. In order
to perform accurate detection, security-sensitive behaviors are captured from
apps in the form of inter-procedural control-flow sub-graph features using a
state-of-the-art graph kernel. In order to perform scalable detection and to
adapt to the drift and evolution in malware population, an online
passive-aggressive classifier is used.
  In a large-scale comparative analysis with more than 87,000 apps, DroidOL
achieves 84.29% accuracy outperforming two state-of-the-art malware techniques
by more than 20% in their typical batch learning setting and more than 3% when
they are continuously re-trained. Our experimental findings strongly indicate
that online learning based approaches are highly suitable for real-world
malware detection.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2016 01:08:10 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Sep 2016 10:07:11 GMT'}]",2016-09-27,"[['Narayanan', 'Annamalai', ''], ['Yang', 'Liu', ''], ['Chen', 'Lihui', ''], ['Jinliang', 'Liu', '']]","['Online Learning', 'Graph Kernels', 'MalwareDetection']"
18911,1511.08865,Khan Muhammad,Khan Muhammad,Steganography: A Secure way for Transmission in Wireless Sensor Networks,,,,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Addressing the security concerns in wireless sensor networks (WSN) is a
challenging task, which has attracted the attention of many researchers from
the last few decades. Researchers have presented various schemes in WSN,
addressing the problems of processing, bandwidth, load balancing, and efficient
routing. However, little work has been done on security aspects of WSN. In a
typical WSN network, the tiny nodes installed on different locations sense the
surrounding environment, send the collected data to their neighbors, which in
turn is forwarded to a sink node. The sink node aggregate the data received
from different sensors and send it to the base station for further processing
and necessary actions. In highly critical sensor networks such as military and
law enforcement agencies networks, the transmission of such aggregated data via
the public network Internet is very sensitive and vulnerable to various attacks
and risks. Therefore, this paper provides a solution for addressing these
security issues based on steganography, where the aggregated data can be
embedded as a secret message inside an innocent-looking cover image. The stego
image containing the embedded data can be then sent to fusion center using
Internet. At the fusion center, the hidden data is extracted from the image,
the required processing is performed and decision is taken accordingly.
Experimentally, the proposed method is evaluated by objective analysis using
peak signal-to-noise ratio (PSNR), mean square error (MSE), normalized cross
correlation (NCC), and structural similarity index metric (SSIM), providing
promising results in terms of security and image quality, thus validating its
superiority.
","[{'version': 'v1', 'created': 'Sat, 28 Nov 2015 04:00:05 GMT'}]",2015-12-01,"[['Muhammad', 'Khan', '']]","['Wireless Sensor Networks', 'Distributed Image Transmission', 'Steganography', 'Image']"
18912,1407.1873,Antoine Genitrini,"Olivier Bodini, Antoine Genitrini and Fr\'ed\'eric Peschanski",A Quantitative Study of Pure Parallel Processes,,"Electronic Journal of Combinatorics, 23, 1, (2016), P1.11",,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the interleaving -- or pure merge -- operator that
most often characterizes parallelism in concurrency theory. This operator is a
principal cause of the so-called combinatorial explosion that makes very hard -
at least from the point of view of computational complexity - the analysis of
process behaviours e.g. by model-checking. The originality of our approach is
to study this combinatorial explosion phenomenon on average, relying on
advanced analytic combinatorics techniques. We study various measures that
contribute to a better understanding of the process behaviours represented as
plane rooted trees: the number of runs (corresponding to the width of the
trees), the expected total size of the trees as well as their overall shape.
Two practical outcomes of our quantitative study are also presented: (1) a
linear-time algorithm to compute the probability of a concurrent run prefix,
and (2) an efficient algorithm for uniform random sampling of concurrent runs.
These provide interesting responses to the combinatorial explosion problem.
","[{'version': 'v1', 'created': 'Fri, 4 Jul 2014 19:43:55 GMT'}]",2016-05-05,"[['Bodini', 'Olivier', ''], ['Genitrini', 'Antoine', ''], ['Peschanski', 'Frédéric', '']]","['Pure Merge', 'Interleaving Semantics', 'Concurrency Theory', 'Analytic Combinatorics', 'Increasing Trees', 'Holonomic Functions', 'Random Generation']"
18913,1603.00182,Maurizio Naldi,Maurizio Naldi and Giuseppe D'Acquisto,"Protecting suppliers' private information: the case of stock levels and
  the impact of correlated items","13 pages, 5 figures. arXiv admin note: substantial text overlap with
  arXiv:1509.06524",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A marketplace is defined where the private data of suppliers (e.g.,
prosumers) are protected, so that neither their identity nor their level of
stock is made known to end customers, while they can sell their products at a
reduced price. A broker acts as an intermediary, which takes care of providing
the items missing to meet the customers' demand and allows end customers to
take advantages of reduced prices through the subscription of option contracts.
Formulas are provided for the option price under three different probability
models for the availability of items. Option pricing allows the broker to
partially transfer its risk on end customers.
","[{'version': 'v1', 'created': 'Tue, 1 Mar 2016 08:28:55 GMT'}]",2016-03-02,"[['Naldi', 'Maurizio', ''], [""D'Acquisto"", 'Giuseppe', '']]","['privacy', 'statistical databases', 'supply chain']"
18914,1409.3741,John Fearnley,"Argyrios Deligkas, John Fearnley, Rahul Savani, Paul Spirakis",Computing Approximate Nash Equilibria in Polymatrix Games,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In an $\epsilon$-Nash equilibrium, a player can gain at most $\epsilon$ by
unilaterally changing his behaviour. For two-player (bimatrix) games with
payoffs in $[0,1]$, the best-known$\epsilon$ achievable in polynomial time is
0.3393. In general, for $n$-player games an $\epsilon$-Nash equilibrium can be
computed in polynomial time for an $\epsilon$ that is an increasing function of
$n$ but does not depend on the number of strategies of the players. For
three-player and four-player games the corresponding values of $\epsilon$ are
0.6022 and 0.7153, respectively. Polymatrix games are a restriction of general
$n$-player games where a player's payoff is the sum of payoffs from a number of
bimatrix games. There exists a very small but constant $\epsilon$ such that
computing an $\epsilon$-Nash equilibrium of a polymatrix game is \PPAD-hard.
Our main result is that a $(0.5+\delta)$-Nash equilibrium of an $n$-player
polymatrix game can be computed in time polynomial in the input size and
$\frac{1}{\delta}$. Inspired by the algorithm of Tsaknakis and Spirakis, our
algorithm uses gradient descent on the maximum regret of the players. We also
show that this algorithm can be applied to efficiently find a
$(0.5+\delta)$-Nash equilibrium in a two-player Bayesian game.
","[{'version': 'v1', 'created': 'Fri, 12 Sep 2014 14:04:29 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Oct 2014 10:17:48 GMT'}]",2014-10-02,"[['Deligkas', 'Argyrios', ''], ['Fearnley', 'John', ''], ['Savani', 'Rahul', ''], ['Spirakis', 'Paul', '']]","['Approximate Nash equilibria', 'gradient descent', 'polymatrixgames', 'Bayesian games']"
18915,1305.5675,Rachit Agarwal,"Rachit Agarwal and Vincent Gauthier and Monique Becker and Thouraya
  Toukabri and Hossam Afifi","Large Scale Model for Information Dissemination with Device to Device
  Communication using Call Details Records",Accepted in Computer Communications journal,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a network of devices in close proximity such as Device to Device ($D2D$)
communication, we study the dissemination of public safety information at
country scale level. In order to provide a realistic model for the information
dissemination, we extract a spatial distribution of the population of Ivory
Coast from census data and determine migration pattern from the Call Detail
Records ($CDR$) obtained during the Data for Development ($D4D$) challenge. We
later apply epidemic model towards the information dissemination process based
on the spatial properties of the user mobility extracted from the provided
$CDR$. We then propose enhancements by adding latent states to the epidemic
model in order to model more realistic user dynamics. Finally, we study
dynamics of the evolution of the information spreading through the population.
","[{'version': 'v1', 'created': 'Fri, 24 May 2013 10:00:18 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Jun 2014 12:24:19 GMT'}, {'version': 'v3', 'created': 'Mon, 30 Jun 2014 08:41:24 GMT'}, {'version': 'v4', 'created': 'Wed, 9 Jul 2014 09:19:35 GMT'}, {'version': 'v5', 'created': 'Tue, 30 Dec 2014 11:56:26 GMT'}]",2014-12-31,"[['Agarwal', 'Rachit', ''], ['Gauthier', 'Vincent', ''], ['Becker', 'Monique', ''], ['Toukabri', 'Thouraya', ''], ['Afifi', 'Hossam', '']]","['Device to Device communication', 'Human Mobility', 'Information']"
18916,0710.5382,Stergos Afantenos,Stergos D. Afantenos,"Some Reflections on the Task of Content Determination in the Context of
  Multi-Document Summarization of Evolving Events","5 pages, 2 figures","Edited by Galia Angelova, Kalina Bontcheva, Ruslan Mitkov, Nicolas
  Nicolov, and Nikolai Nikolov, Recent Advances in Natural Language Processing
  (RANLP 2007). Borovets, Bulgaria: INCOMA, 12-16",,,cs.CL,,"  Despite its importance, the task of summarizing evolving events has received
small attention by researchers in the field of multi-document summariztion. In
a previous paper (Afantenos et al. 2007) we have presented a methodology for
the automatic summarization of documents, emitted by multiple sources, which
describe the evolution of an event. At the heart of this methodology lies the
identification of similarities and differences between the various documents,
in two axes: the synchronic and the diachronic. This is achieved by the
introduction of the notion of Synchronic and Diachronic Relations. Those
relations connect the messages that are found in the documents, resulting thus
in a graph which we call grid. Although the creation of the grid completes the
Document Planning phase of a typical NLG architecture, it can be the case that
the number of messages contained in a grid is very large, exceeding thus the
required compression rate. In this paper we provide some initial thoughts on a
probabilistic model which can be applied at the Content Determination stage,
and which tries to alleviate this problem.
","[{'version': 'v1', 'created': 'Mon, 29 Oct 2007 10:48:48 GMT'}]",2007-10-30,"[['Afantenos', 'Stergos D.', '']]","['summarization of evolving events', 'multidocument summarization', 'natural language generation']"
18917,1410.5524,Jie Feng,"Jie Feng, Wei Liu, Yan Wang",Learning to Rank Binary Codes,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Binary codes have been widely used in vision problems as a compact feature
representation to achieve both space and time advantages. Various methods have
been proposed to learn data-dependent hash functions which map a feature vector
to a binary code. However, considerable data information is inevitably lost
during the binarization step which also causes ambiguity in measuring sample
similarity using Hamming distance. Besides, the learned hash functions cannot
be changed after training, which makes them incapable of adapting to new data
outside the training data set. To address both issues, in this paper we propose
a flexible bitwise weight learning framework based on the binary codes obtained
by state-of-the-art hashing methods, and incorporate the learned weights into
the weighted Hamming distance computation. We then formulate the proposed
framework as a ranking problem and leverage the Ranking SVM model to offline
tackle the weight learning. The framework is further extended to an online mode
which updates the weights at each time new data comes, thereby making it
scalable to large and dynamic data sets. Extensive experimental results
demonstrate significant performance gains of using binary codes with bitwise
weighting in image retrieval tasks. It is appealing that the online weight
learning leads to comparable accuracy with its offline counterpart, which thus
makes our approach practical for realistic applications.
","[{'version': 'v1', 'created': 'Tue, 21 Oct 2014 03:09:17 GMT'}]",2014-10-22,"[['Feng', 'Jie', ''], ['Liu', 'Wei', ''], ['Wang', 'Yan', '']]","['binary codes', 'hashing', 'learning to rank', 'image retrieval']"
18918,1209.5663,Valmi Dufour-Lussier,"Valmi Dufour-Lussier (INRIA Lorraine - LORIA), Florence Le Ber (INRIA
  Lorraine - LORIA, LHyGeS), Jean Lieber (INRIA Lorraine - LORIA), Thomas
  Meilender (INRIA Lorraine - LORIA), Emmanuel Nauer (INRIA Lorraine - LORIA)","Semi-automatic annotation process for procedural texts: An application
  on cooking recipes",,Cooking with Computers workshop (ECAI 2012) (2012),,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Taaable is a case-based reasoning system that adapts cooking recipes to user
constraints. Within it, the preparation part of recipes is formalised as a
graph. This graph is a semantic representation of the sequence of instructions
composing the cooking process and is used to compute the procedure adaptation,
conjointly with the textual adaptation. It is composed of cooking actions and
ingredients, among others, represented as vertices, and semantic relations
between those, shown as arcs, and is built automatically thanks to natural
language processing. The results of the automatic annotation process is often a
disconnected graph, representing an incomplete annotation, or may contain
errors. Therefore, a validating and correcting step is required. In this paper,
we present an existing graphic tool named \kcatos, conceived for representing
and editing decision trees, and show how it has been adapted and integrated in
WikiTaaable, the semantic wiki in which the knowledge used by Taaable is
stored. This interface provides the wiki users with a way to correct the case
representation of the cooking process, improving at the same time the quality
of the knowledge about cooking procedures stored in WikiTaaable.
","[{'version': 'v1', 'created': 'Tue, 25 Sep 2012 16:13:14 GMT'}]",2012-09-26,"[['Dufour-Lussier', 'Valmi', '', 'INRIA Lorraine - LORIA'], ['Ber', 'Florence Le', '', 'INRIA\n  Lorraine - LORIA, LHyGeS'], ['Lieber', 'Jean', '', 'INRIA Lorraine - LORIA'], ['Meilender', 'Thomas', '', 'INRIA Lorraine - LORIA'], ['Nauer', 'Emmanuel', '', 'INRIA Lorraine - LORIA']]","['cooking', 'natural language processing', 'procedural texts', 'semantic annotation', 'semantic wiki']"
18919,1009.6052,Sankar Sharmila,Sharmila Sankar and Dr. V. Sankaranarayanan,"A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism
  for Dense MANETs",Probabilistic Route Discover Algorithm for DENSE MANETs,"International Journal of Ad hoc, Sensor & Ubiquitous Computing,
  Vol 1, No.3,Sep 2010",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A crucial issue for a mobile ad hoc network is the handling of a large number
of nodes. As more nodes join the mobile ad hoc network, contention and
congestion are more likely. The on demand routing protocols which broadcasts
control packets to discover routes to the destination nodes, generate a high
number of broadcast packets in a larger networks causing contention and
collision. We propose an efficient route discovery protocol, which reduces the
number of broadcast packet, using controlled flooding technique. The simulation
results show that the proposed probabilistic flooding decreases the number of
control packets floating in the network during route discovery phase, without
lowering the success ratio of path discoveries. Furthermore, the proposed
method adapts to the normal network conditions. The results show that up to 70%
of control packet traffic is saved in route discovery phase when the network is
denser.
","[{'version': 'v1', 'created': 'Thu, 30 Sep 2010 07:24:41 GMT'}]",2010-10-01,"[['Sankar', 'Sharmila', ''], ['Sankaranarayanan', 'Dr. V.', '']]","['Broadcast Storm', 'Reachability Parameter', 'Probabilistic Routing', 'Saved Rebroadcast']"
18920,1306.4345,Vishakha Metre VAM,Vishakha Metre and Jayshree Ghorpade,An Overview of the Research on Texture Based Plant Leaf Classification,"12 pages,5 figures and 3 tables",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Plant classification has a broad application prospective in agriculture and
medicine, and is especially significant to the biology diversity research. As
plants are vitally important for environmental protection, it is more important
to identify and classify them accurately. Plant leaf classification is a
technique where leaf is classified based on its different morphological
features. The goal of this paper is to provide an overview of different aspects
of texture based plant leaf classification and related things. At last we will
be concluding about the efficient method i.e. the method that gives better
performance compared to the other methods.
","[{'version': 'v1', 'created': 'Tue, 18 Jun 2013 20:38:07 GMT'}]",2013-06-20,"[['Metre', 'Vishakha', ''], ['Ghorpade', 'Jayshree', '']]","['Plant Leaf extraction', 'Plant leaf classification', 'Combined Classifier', 'GLCM', 'SGD']"
18921,1603.09046,Andrew Shin,"Andrew Shin, Masataka Yamaguchi, Katsunori Ohnishi and Tatsuya Harada","Dense Image Representation with Spatial Pyramid VLAD Coding of CNN for
  Locally Robust Captioning",submitted to ECCV2016,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The workflow of extracting features from images using convolutional neural
networks (CNN) and generating captions with recurrent neural networks (RNN) has
become a de-facto standard for image captioning task. However, since CNN
features are originally designed for classification task, it is mostly
concerned with the main conspicuous element of the image, and often fails to
correctly convey information on local, secondary elements. We propose to
incorporate coding with vector of locally aggregated descriptors (VLAD) on
spatial pyramid for CNN features of sub-regions in order to generate image
representations that better reflect the local information of the images. Our
results show that our method of compact VLAD coding can match CNN features with
as little as 3% of dimensionality and, when combined with spatial pyramid, it
results in image captions that more accurately take local elements into
account.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2016 05:48:05 GMT'}]",2016-03-31,"[['Shin', 'Andrew', ''], ['Yamaguchi', 'Masataka', ''], ['Ohnishi', 'Katsunori', ''], ['Harada', 'Tatsuya', '']]","['CNN', 'VLAD', 'Spatial Pyramid', 'LSTM', 'Selective Search']"
18922,1606.06897,Sanjay Sahay,Ashu Sharma and Sanjay K. Sahay,"An effective approach for classification of advanced malware with high
  accuracy","15 Pages, 14 figures","International Journal of Security and Its Applications, Vol. 10,
  No. 4, pp.249-266, 2016",,,cs.CR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Combating malware is very important for software/systems security, but to
prevent the software/systems from the advanced malware, viz. metamorphic
malware is a challenging task, as it changes the structure/code after each
infection. Therefore in this paper, we present a novel approach to detect the
advanced malware with high accuracy by analyzing the occurrence of opcodes
(features) by grouping the executables. These groups are made on the basis of
our earlier studies [1] that the difference between the sizes of any two
malware generated by popular advanced malware kits viz. PS-MPC, G2 and NGVCK
are within 5 KB. On the basis of obtained promising features, we studied the
performance of thirteen classifiers using N-fold cross-validation available in
machine learning tool WEKA. Among these thirteen classifiers we studied
in-depth top five classifiers (Random forest, LMT, NBT, J48 and FT) and obtain
more than 96.28% accuracy for the detection of unknown malware, which is better
than the maximum detection accuracy (95.9%) reported by Santos et al (2013). In
these top five classifiers, our approach obtained a detection accuracy of
97.95% by the Random forest.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2016 11:00:48 GMT'}]",2018-09-18,"[['Sharma', 'Ashu', ''], ['Sahay', 'Sanjay K.', '']]","['Anti-Malware', 'Static Analysis', 'WEKA', 'Machine Learning', 'Decision Tree']"
18923,1401.7909,Fred Morstatter,"Fred Morstatter, J\""urgen Pfeffer, Huan Liu","When is it Biased? Assessing the Representativeness of Twitter's
  Streaming API",,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Twitter has captured the interest of the scientific community not only for
its massive user base and content, but also for its openness in sharing its
data. Twitter shares a free 1% sample of its tweets through the ""Streaming
API"", a service that returns a sample of tweets according to a set of
parameters set by the researcher. Recently, research has pointed to evidence of
bias in the data returned through the Streaming API, raising concern in the
integrity of this data service for use in research scenarios. While these
results are important, the methodologies proposed in previous work rely on the
restrictive and expensive Firehose to find the bias in the Streaming API data.
In this work we tackle the problem of finding sample bias without the need for
""gold standard"" Firehose data. Namely, we focus on finding time periods in the
Streaming API data where the trend of a hashtag is significantly different from
its trend in the true activity on Twitter. We propose a solution that focuses
on using an open data source to find bias in the Streaming API. Finally, we
assess the utility of the data source in sparse data situations and for users
issuing the same query from different regions.
","[{'version': 'v1', 'created': 'Thu, 30 Jan 2014 16:27:14 GMT'}]",2014-01-31,"[['Morstatter', 'Fred', ''], ['Pfeffer', 'Jürgen', ''], ['Liu', 'Huan', '']]","['Data Sampling', 'Sampling Bias', 'Twitter Analysis', 'Big Data']"
18924,1304.2735,Stephen I. Gallant,Stephen I. Gallant,"Automated Generation of Connectionist Expert Systems for Problems
  Involving Noise and Redundancy","Appears in Proceedings of the Third Conference on Uncertainty in
  Artificial Intelligence (UAI1987)",,,UAI-P-1987-PG-212-221,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When creating an expert system, the most difficult and expensive task is
constructing a knowledge base. This is particularly true if the problem
involves noisy data and redundant measurements. This paper shows how to modify
the MACIE process for generating connectionist expert systems from training
examples so that it can accommodate noisy and redundant data. The basic idea is
to dynamically generate appropriate training examples by constructing both a
'deep' model and a noise model for the underlying problem. The use of
winner-take-all groups of variables is also discussed. These techniques are
illustrated with a small example that would be very difficult for standard
expert system approaches.
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2013 19:48:14 GMT'}]",2013-04-11,"[['Gallant', 'Stephen I.', '']]","['Machine Learning', 'Connectionist Models', 'Knowledge acquisition', 'Expert Systems', 'MACIE']"
18925,1208.0805,Jorge Arpasi,Jorge P. Arpasi,"On the control of abelian group codes with information group of prime
  order","12 pages, 2 figures",,,,cs.IT math.GR math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finite State Machine (FSM) model is widely used in the construction of binary
convolutional codes. If Z_2={0,1} is the binary mod-2 addition group and
(Z_2)^n is the n-times direct product of Z_2, then a binary convolutional
encoder, with rate (k/n)< 1 and memory m, is a FSM with (Z_2)^k as inputs
group, (Z_2)^n as outputs group and (Z_2)^m as states group. The next state
mapping nu:[(Z_2)^k x (Z_2)^m] --> (Z_2)^m is a surjective group homomorphism.
The encoding mapping omega:[(Z_2)^k x (Z_2)^m] --> (Z_2)^n is a homomorphism
adequately restricted by the trellis graph produced by nu. The binary
convolutional code is the family of bi-infinite sequences produced by the
binary convolutional encoder. Thus, a convolutional code can be considered as a
dynamical system and it is known that well behaved dynamical systems must be
necessarily controllable. The generalization of binary convolutional encoders
over arbitrary finite groups is made by using the extension of groups, instead
of direct product. In this way, given finite groups U,S and Y, a wide-sense
homomorphic encoder (WSHE) is a FSM with U as inputs group, S as states group,
and Y as outputs group. By denoting (U x S) as the extension of U by S, the
next state homomorphism nu:(U x S) --> S needs to be surjective and the
encoding homomorphism omega:(U x S) --> Y has restrictions given by the trellis
graph produced by nu. The code produced by a WSHE is known as group code. In
this work we will study the case when the extension (U x S) is abelian with U
being Z_p, p a positive prime number. We will show that this class of WSHEs
will produce controllable codes only if the states group S is isomorphic with
(Z_p)^j, for some positive integer j.
","[{'version': 'v1', 'created': 'Fri, 3 Aug 2012 17:57:03 GMT'}]",2012-08-06,"[['Arpasi', 'Jorge P.', '']]","['Finite State Machine', 'Group Code', 'Dynamical System', 'Control']"
18926,1409.7232,Bernhard Rumpe,"Cornel Klein, Christian Prehofer, Bernhard Rumpe",Feature Specification and Refinement with State Transition Diagrams,"15 pages, 7 figures","Fourth IEEE Workshop on Feature Interactions in Telecommunications
  Networks and Distributed Systems, P. Dini, IOS-Press. 1997",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce a graphic specification technique, called state
transition diagrams (STD), and show the application to the feature interaction
problem. Using a stream-based formal semantics, we provide refinement rules for
STDs. Refinements define an implementation relation on STD specifications. We
view features as particular refinements which add previously unspecified
behavior to a given STD specification. The refinement relation is then used to
add features, and to define the notion of conflicting features. Our techniques
are demonstrated by a systematic development of an example given in [25].
","[{'version': 'v1', 'created': 'Thu, 25 Sep 2014 12:41:40 GMT'}]",2014-09-26,"[['Klein', 'Cornel', ''], ['Prehofer', 'Christian', ''], ['Rumpe', 'Bernhard', '']]","['state transition diagrams', 'specification', 'refinements', 'feature interaction', 'formalmethods', 'automata']"
18927,0705.1521,Frank Gurski,Frank Gurski,A note on module-composed graphs,10 pages,,,,cs.DS,,"  In this paper we consider module-composed graphs, i.e. graphs which can be
defined by a sequence of one-vertex insertions v_1,...,v_n, such that the
neighbourhood of vertex v_i, 2<= i<= n, forms a module (a homogeneous set) of
the graph defined by vertices v_1,..., v_{i-1}.
  We show that module-composed graphs are HHDS-free and thus homogeneously
orderable, weakly chordal, and perfect. Every bipartite distance hereditary
graph, every (co-2C_4,P_4)-free graph and thus every trivially perfect graph is
module-composed. We give an O(|V_G|(|V_G|+|E_G|)) time algorithm to decide
whether a given graph G is module-composed and construct a corresponding
module-sequence.
  For the case of bipartite graphs, module-composed graphs are exactly distance
hereditary graphs, which implies simple linear time algorithms for their
recognition and construction of a corresponding module-sequence.
","[{'version': 'v1', 'created': 'Thu, 10 May 2007 18:08:22 GMT'}, {'version': 'v2', 'created': 'Sun, 22 Jul 2007 16:30:53 GMT'}]",2007-07-23,"[['Gurski', 'Frank', '']]","['graph algorithms', 'homogeneous sets', 'HHD-free graphs', 'distance hereditarygraphs', 'bipartite graphs']"
18928,1609.01371,Dimitrios Tzionas,Dimitrios Tzionas and Juergen Gall,Reconstructing Articulated Rigged Models from RGB-D Videos,"Accepted for publication - European Conference on Computer Vision
  Workshops 2016 (ECCVW'16) - Workshop on Recovering 6D Object Pose (R6D'16)",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although commercial and open-source software exist to reconstruct a static
object from a sequence recorded with an RGB-D sensor, there is a lack of tools
that build rigged models of articulated objects that deform realistically and
can be used for tracking or animation. In this work, we fill this gap and
propose a method that creates a fully rigged model of an articulated object
from depth data of a single sensor. To this end, we combine deformable mesh
tracking, motion segmentation based on spectral clustering and skeletonization
based on mean curvature flow. The fully rigged model then consists of a
watertight mesh, embedded skeleton, and skinning weights.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2016 02:10:21 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Sep 2016 15:20:38 GMT'}]",2016-09-12,"[['Tzionas', 'Dimitrios', ''], ['Gall', 'Juergen', '']]","['Kinematic Model Learning', 'Skeletonization', 'Rigged ModelAcquisition', 'Deformable Tracking', 'Spectral Clustering', 'Mean CurvatureFlow']"
18929,1609.01100,Yariv Aizenbud,Yariv Aizenbud and Yoel Shkolnisky,A max-cut approach to heterogeneity in cryo-electron microscopy,,,,,cs.CV math.OC q-bio.BM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The field of cryo-electron microscopy has made astounding advancements in the
past few years, mainly due to advancements in electron detectors' technology.
Yet, one of the key open challenges of the field remains the processing of
heterogeneous data sets, produced from samples containing particles at several
different conformational states. For such data sets, the algorithms must
include some classification procedure to identify homogeneous groups within the
data, so that the images in each group correspond to the same underlying
structure. The fundamental importance of the heterogeneity problem in
cryo-electron microscopy has drawn many research efforts, and resulted in
significant progress in classification algorithms for heterogeneous data sets.
While these algorithms are extremely useful and effective in practice, they
lack rigorous mathematical analysis and performance guarantees.
  In this paper, we attempt to make the first steps towards rigorous
mathematical analysis of the heterogeneity problem in cryo-electron microscopy.
To that end, we present an algorithm for processing heterogeneous data sets,
and prove accuracy and stability bounds for it. We also suggest an extension of
this algorithm that combines the classification and reconstruction steps. We
demonstrate it on simulated data, and compare its performance to the
state-of-the-art algorithm in RELION.
","[{'version': 'v1', 'created': 'Mon, 5 Sep 2016 11:08:34 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Oct 2019 14:48:05 GMT'}]",2019-10-04,"[['Aizenbud', 'Yariv', ''], ['Shkolnisky', 'Yoel', '']]","['cryo-electron microscopy', 'single particle', 'three-dimensional reconstruction', 'heterogeneity', 'classification', 'max-cut', 'graph partitioning']"
18930,1010.3674,Alban Ponse,"Jan A. Bergstra, A. Ponse, D.J.C. Staudt",Short-circuit logic,"59 pages, 7 tables, 3 figures; Daan Staudt is added as an extra
  author; normal forms for FSCL are defined and completeness of its
  axiomatization is proved",,,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Short-circuit evaluation denotes the semantics of propositional connectives
in which the second argument is evaluated only if the first argument does not
suffice to determine the value of the expression. In programming, short-circuit
evaluation is widely used, with sequential conjunction and disjunction as
primitive connectives.
  A short-circuit logic is a variant of propositional logic (PL) that can be
defined with help of Hoare's conditional, a ternary connective comparable to
if-then-else, and that implies all identities that follow from four basic
axioms for the conditional and can be expressed in PL (e.g., axioms for
associativity of conjunction and double negation shift). In the absence of side
effects, short-circuit evaluation characterizes PL. However, short-circuit
evaluation admits the possibility to model side effects and gives rise to
various different short-circuit logics. The first extreme case is FSCL (free
short-circuit logic), which characterizes the setting in which evaluation of
each atom (propositional variable) can yield a side effect. The other extreme
case is MSCL (memorizing short-circuit logic), the most identifying variant we
distinguish below PL. In MSCL, only a very restricted type of side effects can
be modelled, while sequential conjunction is non-commutative. We provide
axiomatizations for FSCL and MSCL.
  Extending MSCL with one simple axiom yields SSCL (static short-circuit logic,
or sequential PL), for which we also provide a completeness result. We briefly
discuss two variants in between FSCL and MSCL, among which a logic that admits
contraction of atoms and of their negations.
","[{'version': 'v1', 'created': 'Mon, 18 Oct 2010 18:42:04 GMT'}, {'version': 'v2', 'created': 'Mon, 29 Nov 2010 07:28:49 GMT'}, {'version': 'v3', 'created': 'Mon, 27 Jun 2011 13:14:59 GMT'}, {'version': 'v4', 'created': 'Tue, 12 Mar 2013 15:03:14 GMT'}]",2013-03-13,"[['Bergstra', 'Jan A.', ''], ['Ponse', 'A.', ''], ['Staudt', 'D. J. C.', '']]","['Non-commutative conjunction', 'conditional composition', 'reactive valuation', 'sequential connective', 'short-circuit evaluation', 'side effect']"
18931,1707.08627,Bashir Sadiq Mr,B.O Sadiq,"A Feasibility Study of Using Light Fidelity With Multiple Unmanned
  Aerial Vehicles For Indoor Collaborative And Cooperative Networking",8 pages,,,,cs.NI,http://creativecommons.org/licenses/by-sa/4.0/,"  This paper evaluates the feasibility of using light fidelity with multiple
Unmanned Aerial Vehicles (UAVs) for indoor collaborative and cooperative
networking. A number of works have presentedchallenges for wireless networking
with multiple UAVs such as bandwidth efficiency, security and environment
amongst others. Due to this fact, there is a need to secure information and
data in UAV ad hoc network (FANETs) using a secure transmission medium that
guarantees bandwidth efficiency such as the light fidelity (Li-Fi). Li-Fi
enables data transmission using visible light through a light emitting diode
(LED) and is chosen as against wireless fidelity (Wi- Fi) because it is more
ideal for high density wireless data coverage in confined areas, better at
addressing radio interference related issues and provides better bandwidth,
efficiency, availability and security. Thus, using Light Fidelity as a means of
communication necessitates the need to develop a Link Velocity Based
Connectivity Algorithm (LVCA) that governs communication between the UAVs and
the Li-Fi transmitter and receiver circuits for collaborative and cooperative
networking.
","[{'version': 'v1', 'created': 'Sun, 16 Jul 2017 19:29:28 GMT'}]",2017-07-28,"[['Sadiq', 'B. O', '']]","['Multiple-UAVs', 'Light-Fidelity (Li-Fi)', 'Communication protocol']"
18932,1306.1653,Eckhard Hitzer,Eckhard Hitzer,"Non-constant bounded holomorphic functions of hyperbolic numbers -
  Candidates for hyperbolic activation functions","6 pages, 2 figures","in Y. Kuroe, T. Nitta (eds.), Proceedings of the First SICE
  Symposium on Computational Intelligence [Concentrating on Clifford Neural
  Computing], 30 Sep. 2011, KIT, Kyoto, Japan, catalogue no. 11PG0009, pp. 23 -
  28, 2011",,,cs.NE cs.CV math.RA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Liouville theorem states that bounded holomorphic complex functions are
necessarily constant. Holomorphic functions fulfill the socalled Cauchy-Riemann
(CR) conditions. The CR conditions mean that a complex $z$-derivative is
independent of the direction. Holomorphic functions are ideal for activation
functions of complex neural networks, but the Liouville theorem makes them
useless. Yet recently the use of hyperbolic numbers, lead to the construction
of hyperbolic number neural networks. We will describe the Cauchy-Riemann
conditions for hyperbolic numbers and show that there exists a new interesting
type of bounded holomorphic functions of hyperbolic numbers, which are not
constant. We give examples of such functions. They therefore substantially
expand the available candidates for holomorphic activation functions for
hyperbolic number neural networks.
  Keywords: Hyperbolic numbers, Liouville theorem, Cauchy-Riemann conditions,
bounded holomorphic functions
","[{'version': 'v1', 'created': 'Fri, 7 Jun 2013 08:43:11 GMT'}]",2013-06-10,"[['Hitzer', 'Eckhard', '']]","['Hyperbolic numbers', 'Liouville theorem', 'Cauchy-Riemann conditions', 'bounded holomorphic functions']"
18933,1203.1717,Ivan Jureta,Ivan Jureta,"Requirements Engineering Methods: A Classification Framework and
  Research Challenges","10 pages, 1 figure",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Requirements Engineering Methods (REMs) support Requirements Engineering (RE)
tasks, from elicitation, through modeling and analysis, to validation and
evolution of requirements. Despite the growing interest to design, validate and
teach REMs, it remains unclear what components REMs should have. A
classification framework for REMs is proposed. It distinguishes REMs based on
the domain-independent properties of their components. The classification
framework is intended to facilitate (i) analysis, teaching and extension of
existing REMs, (ii) engineering and validation of new REMs, and (iii)
identifying research challenges in REM design. The framework should help
clarify further the relations between REM and other concepts of interest in and
to RE, including Requirements Problem and Solution, Requirements Modeling
Language, and Formal Method.
","[{'version': 'v1', 'created': 'Thu, 8 Mar 2012 09:30:58 GMT'}]",2012-03-09,"[['Jureta', 'Ivan', '']]","['Requirements Engineering Method', 'Classificationframework', 'Requirements Modeling Language', 'RequirementsProblem and Solution', 'Formal Method']"
18934,1412.7682,Roshan Ragel,"Hasindu Gamaarachchi, Roshan Ragel, and Darshana Jayasinghe",Accelerating Correlation Power Analysis Using Graphics Processing Units,"The 7th International Conference on Information and Automation for
  Sustainability (ICIAfS) 2014",,,,cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Correlation Power Analysis (CPA) is a type of power analysis based side
channel attack that can be used to derive the secret key of encryption
algorithms including DES (Data Encryption Standard) and AES (Advanced
Encryption Standard). A typical CPA attack on unprotected AES is performed by
analysing a few thousand power traces that requires about an hour of
computational time on a general purpose CPU. Due to the severity of this
situation, a large number of researchers work on countermeasures to such
attacks. Verifying that a proposed countermeasure works well requires
performing the CPA attack on about 1.5 million power traces. Such processing,
even for a single attempt of verification on commodity hardware would run for
several days making the verification process infeasible. Modern Graphics
Processing Units (GPUs) have support for thousands of light weight threads,
making them ideal for parallelizable algorithms like CPA. While the cost of a
GPU being lesser than a high performance multicore server, still the GPU
performance for this algorithm is many folds better than that of a multicore
server. We present an algorithm and its implementation on GPU for CPA on
128-bit AES that is capable of executing 1300x faster than that on a single
threaded CPU and more than 60x faster than that on a 32 threaded multicore
server. We show that an attack that would take hours on the multicore server
would take even less than a minute on a much cost effective GPU.
","[{'version': 'v1', 'created': 'Wed, 24 Dec 2014 15:10:03 GMT'}]",2014-12-25,"[['Gamaarachchi', 'Hasindu', ''], ['Ragel', 'Roshan', ''], ['Jayasinghe', 'Darshana', '']]","['Correlated Power Analysis (CPA)', 'Compute Unified Device Architecture (CUDA)', 'Graphics Processing Units (GPU)', 'parallel processing']"
18935,1611.00617,Carlos Lopez,"C.F. Lopez, C.-X. Wang and R. Feng",A novel 2D non-stationary wideband massive MIMO channel model,"6 pages, 5 figures, conference","IEEE International Workshop on Computer Aided Modelling and Design
  of Communication Links and Networks (CAMAD), Toronto, Canada, Oct. 2016",,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a novel two-dimensional (2D) non-stationary wideband
geometry-based stochastic model (GBSM) for massive multiple-input
multiple-output (MIMO) communication systems is proposed. Key characteristics
of massive MIMO channels such as near field effects and cluster evolution along
the array are addressed in this model. Near field effects are modelled by a
second-order approximation to spherical wavefronts, i.e., parabolic wavefronts,
leading to linear drifts of the angles of multipath components (MPCs) and
non-stationarity along the array. Cluster evolution along the array involving
cluster (dis)appearance and smooth average power variations is considered.
Cluster (dis)appearance is modeled by a two-state Markov process and smooth
average power variations are modelled by a spatial lognormal process.
Statistical properties of the channel model such as time autocorrelation
function (ACF), spatial cross-correlation function (CCF), and cluster average
power and Rician factor variations over the array are derived. Finally,
simulation results are presented and analyzed, demonstrating that parabolic
wavefronts and cluster soft evolution are good candidates to model important
massive MIMO channel characteristics.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2016 14:03:28 GMT'}]",2016-11-03,"[['Lopez', 'C. F.', ''], ['Wang', 'C. -X.', ''], ['Feng', 'R.', '']]","['Massive MIMO channel model', 'parabolic wavefront', 'non-stationarity', 'spatial lognormal process', 'cluster shadowing']"
18936,1209.5257,Hiba Hachichi,"Hiba Hachichi and Ilham Kitouni and Kenza Bouaroudj and Djamel-Eddine
  Saidouni","A Graphical Tool for Testing Timed Systems based on Meta- Modeling and
  Graph Grammars","The International Journal of Computer Science Issues - IJCSI, Vol 9,
  Issue 4, No 1, July 2012",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The test is one of the approaches commonly used for validating systems to
ensure qualitative and quantitative implementation requirements. In this paper,
we interest in formal testing using graph transformation, thus we propose an
approach for translating a Durational Actions Timed Automata model (DATA*) with
a high number of states into a timed refusals region graph (TRRG) for creating
a canonical tester and generating test cases using graph transformation.
Though, our approach allows to generate automatically a visual modeling tool
for DATA*, TRRG and the canonical tester. The cost of building a visual
modeling tool from scratch is prohibitive. Meta- modeling approach is useful to
deal with this problem since it allows the modeling of the formalisms
themselves, by means of graph grammars. The meta-modeling tool AToM3 is used.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2012 13:17:25 GMT'}]",2012-09-25,"[['Hachichi', 'Hiba', ''], ['Kitouni', 'Ilham', ''], ['Bouaroudj', 'Kenza', ''], ['Saidouni', 'Djamel-Eddine', '']]","['Formal testing', 'Graph transformation', 'Graph Grammars', 'AToM3', 'DATA*']"
18937,1402.5039,Lucas Paletta,"Hazael Jones, Nicolas Sabouret, Ionut Damian, Tobias Baur, Elisabeth
  Andr\'e, Ka\'ska Porayska-Pomsta and Paola Rizzo","Interpreting social cues to generate credible affective reactions of
  virtual job interviewers",,,,IDGEI/2014/06,cs.AI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we describe a mechanism of generating credible affective
reactions in a virtual recruiter during an interaction with a user. This is
done using communicative performance computation based on the behaviours of the
user as detected by a recognition module. The proposed software pipeline is
part of the TARDIS system which aims to aid young job seekers in acquiring job
interview related social skills. In this context, our system enables the
virtual recruiter to realistically adapt and react to the user in real-time.
","[{'version': 'v1', 'created': 'Thu, 20 Feb 2014 15:38:43 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Feb 2014 11:04:53 GMT'}]",2014-02-26,"[['Jones', 'Haza\x7fel', ''], ['Sabouret', 'Nicolas', ''], ['Damian', 'Ionut', ''], ['Baur', 'Tobias', ''], ['André', 'Elisabeth', ''], ['Porayska-Pomsta', 'Kaśka', ''], ['Rizzo', 'Paola', '']]","['Perceptions', 'Social cues', 'Communicative performance', 'Affective model', 'Job interview']"
18938,1609.06862,Gewu Bu,"Gewu Bu (LIP6, NPA), Maria Potop-Butucaru (LIP6, NPA)",Total Order Reliable Convergecast in WBAN,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is the first extensive work on total order reliable convergecast
in multi-hop Wireless Body Area Networks (WBAN). Convergecast is a many-to-one
cooperative scheme where each node of the network transmits data towards the
same sink. Our contribution is threefold. First, we stress existing WBAN
convergecast strategies with respect to their capacity to be reliable and to
ensure the total order delivery at sink. That is, packets sent in a specific
order should be received in the same order by the sink. When stressed with
transmission rates up to 500 packets per second the performances of these
strategies decrease dramatically (more than 90% of packets lost). Secondly, we
propose a new posture-centric model for WBAN. This model offers a good
characterization of the path availability which is further used to fine tune
the retransmission rate thresholds. Third, based on our model we propose a new
mechanism for reliability and a new converge-cast strategy that outperforms
WBAN dedicated strategies but also strategies adapted from DTN and WSN areas.
Our extensive performance evaluations use essential parameters for WBAN: packet
lost, total order reliability (messages sent in a specific order should be
delivered in that specific order) and various human body postures. In
particular, our strategy ensures zero packet order inversions for various
transmission rates and mobility postures. Interestingly, our strategy respects
this property without the need of additional energy-guzzler mechanisms.
","[{'version': 'v1', 'created': 'Thu, 22 Sep 2016 08:23:46 GMT'}]",2016-09-23,"[['Bu', 'Gewu', '', 'LIP6, NPA'], ['Potop-Butucaru', 'Maria', '', 'LIP6, NPA']]","['Wireless Body Area Networks', 'Total Order Reliable Convergecast', 'Networks Modelization']"
18939,1107.2021,Sivan Sabato,Sivan Sabato and Naftali Tishby,Multi-Instance Learning with Any Hypothesis Class,Fixed typos and added some explanations,"Journal of Machine Learning Research 13(Oct):1999-3039, 2012",,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the supervised learning setting termed Multiple-Instance Learning (MIL),
the examples are bags of instances, and the bag label is a function of the
labels of its instances. Typically, this function is the Boolean OR. The
learner observes a sample of bags and the bag labels, but not the instance
labels that determine the bag labels. The learner is then required to emit a
classification rule for bags based on the sample. MIL has numerous
applications, and many heuristic algorithms have been used successfully on this
problem, each adapted to specific settings or applications. In this work we
provide a unified theoretical analysis for MIL, which holds for any underlying
hypothesis class, regardless of a specific application or problem domain. We
show that the sample complexity of MIL is only poly-logarithmically dependent
on the size of the bag, for any underlying hypothesis class. In addition, we
introduce a new PAC-learning algorithm for MIL, which uses a regular supervised
learning algorithm as an oracle. We prove that efficient PAC-learning for MIL
can be generated from any efficient non-MIL supervised learning algorithm that
handles one-sided error. The computational complexity of the resulting
algorithm is only polynomially dependent on the bag size.
","[{'version': 'v1', 'created': 'Mon, 11 Jul 2011 13:30:58 GMT'}, {'version': 'v2', 'created': 'Tue, 29 May 2012 05:42:03 GMT'}, {'version': 'v3', 'created': 'Mon, 13 Aug 2012 16:38:44 GMT'}]",2015-03-19,"[['Sabato', 'Sivan', ''], ['Tishby', 'Naftali', '']]","['Multiple-instance learning', 'learning theory', 'sample complexity', 'PAC learning', 'supervised classification']"
18940,1301.1704,Qi Hu,"Qi Hu, Nail A. Gumerov, Ramani Duraiswami","Parallel Algorithms for Constructing Data Structures for Fast Multipole
  Methods",,,,,cs.MS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present efficient algorithms to build data structures and the lists needed
for fast multipole methods. The algorithms are capable of being efficiently
implemented on both serial, data parallel GPU and on distributed architectures.
With these algorithms it is possible to map the FMM efficiently on to the GPU
or distributed heterogeneous CPU-GPU systems. Further, in dynamic problems, as
the distribution of the particles change, the reduced cost of building the data
structures improves performance. Using these algorithms, we demonstrate example
high fidelity simulations with large problem sizes by using FMM on both single
and multiple heterogeneous computing facilities equipped with multi-core CPU
and many-core GPUs.
","[{'version': 'v1', 'created': 'Tue, 8 Jan 2013 21:57:20 GMT'}]",2013-01-10,"[['Hu', 'Qi', ''], ['Gumerov', 'Nail A.', ''], ['Duraiswami', 'Ramani', '']]","['fast multipole methods', 'data structure', 'parallel computing', 'heterogeneous system', 'GPU']"
18941,0704.0865,Mohamed Kaaniche,"Ana-Elena Rugina (LAAS), Karama Kanoun (LAAS), Mohamed Kaaniche (LAAS)",An architecture-based dependability modeling framework using AADL,,"Proc. 10th IASTED International Conference on Software Engineering
  and Applications (SEA'2006), Dallas (USA), 13-15 November2006 (13/11/2006)
  222-227",,,cs.PF cs.SE,,"  For efficiency reasons, the software system designers' will is to use an
integrated set of methods and tools to describe specifications and designs, and
also to perform analyses such as dependability, schedulability and performance.
AADL (Architecture Analysis and Design Language) has proved to be efficient for
software architecture modeling. In addition, AADL was designed to accommodate
several types of analyses. This paper presents an iterative dependency-driven
approach for dependability modeling using AADL. It is illustrated on a small
example. This approach is part of a complete framework that allows the
generation of dependability analysis and evaluation models from AADL models to
support the analysis of software and system architectures, in critical
application domains.
","[{'version': 'v1', 'created': 'Fri, 6 Apr 2007 09:33:06 GMT'}]",2007-05-23,"[['Rugina', 'Ana-Elena', '', 'LAAS'], ['Kanoun', 'Karama', '', 'LAAS'], ['Kaaniche', 'Mohamed', '', 'LAAS']]","['Dependability modeling', 'AADL', 'evaluation', 'architecture']"
18942,1504.02975,F. Ozgur Catak,"Ferhat \""Ozg\""ur \c{C}atak","Classification with Extreme Learning Machine and Ensemble Algorithms
  Over Randomly Partitioned Data","In Turkish, SIU",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this age of Big Data, machine learning based data mining methods are
extensively used to inspect large scale data sets. Deriving applicable
predictive modeling from these type of data sets is a challenging obstacle
because of their high complexity. Opportunity with high data availability
levels, automated classification of data sets has become a critical and
complicated function. In this paper, the power of applying MapReduce based
Distributed AdaBoosting of Extreme Learning Machine (ELM) are explored to build
reliable predictive bag of classification models. Thus, (i) dataset ensembles
are build; (ii) ELM algorithm is used to build weak classification models; and
(iii) build a strong classification model from a set of weak classification
models. This training model is applied to the publicly available knowledge
discovery and data mining datasets.
","[{'version': 'v1', 'created': 'Sun, 12 Apr 2015 14:03:25 GMT'}]",2015-04-14,"[['Çatak', 'Ferhat Özgür', '']]","['Extreme Learning Machine', 'AdaBoost', 'Big Data', 'Ensemble Methods', 'MapReduce']"
18943,1708.01938,Ori Ganoni,"Ori Ganoni, Ramakrishnan Mukundan","A Framework for Visually Realistic Multi-robot Simulation in Natural
  Environment",WSCG 2017 conference,,,,cs.RO cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a generalized framework for the simulation of multiple
robots and drones in highly realistic models of natural environments. The
proposed simulation architecture uses the Unreal Engine4 for generating both
optical and depth sensor outputs from any position and orientation within the
environment and provides several key domain specific simulation capabilities.
Various components and functionalities of the system have been discussed in
detail. The simulation engine also allows users to test and validate a wide
range of computer vision algorithms involving different drone configurations
under many types of environmental effects such as wind gusts. The paper
demonstrates the effectiveness of the system by giving experimental results for
a test scenario where one drone tracks the simulated motion of another in a
complex natural environment.
","[{'version': 'v1', 'created': 'Sun, 6 Aug 2017 21:41:42 GMT'}]",2017-08-08,"[['Ganoni', 'Ori', ''], ['Mukundan', 'Ramakrishnan', '']]","['Robot simulation', 'Drone simulation', 'Natural environment models', 'Natural feature tracking', 'Unreal Engine 4(UE4)']"
18944,1004.0604,Secretary Aircc Journal,"Sugam Sharma(1), Hari Cohly(2), Tzusheng Pei(2),((1)Iowa State
  University, USA, (2) Jackson State University, USA)",On Generation of Firewall Log Status Reporter (SRr) Using Perl,10Pages,"International Journal of Network Security & Its Applications 1.2
  (2009) 90-99",,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Computer System Administration and Network Administration are few such areas
where Practical Extraction Reporting Language (Perl) has robust utilization
these days apart from Bioinformatics. The key role of a System/Network
Administrator is to monitor log files. Log file are updated every day. To scan
the summary of large log files and to quickly determine if there is anything
wrong with the server or network we develop a Firewall Log Status Reporter
(SRr). SRr helps to generate the reports based on the parameters of interest.
SRr provides the facility to admin to generate the individual firewall report
or all reports in one go. By scrutinizing the results of the reports admin can
trace how many times a particular request has been made from which source to
which destination and can track the errors easily. Perl scripts can be seen as
the UNIX script replacement in future arena and SRr is one development with the
same hope that we can believe in. SRr is a generalized and customizable utility
completely written in Perl and may be used for text mining and data mining
application in Bioinformatics research and development too.
","[{'version': 'v1', 'created': 'Mon, 5 Apr 2010 09:52:05 GMT'}]",2010-07-15,"[['Sharma', 'Sugam', ''], ['Cohly', 'Hari', ''], ['Pei', 'Tzusheng', '']]","['Perl', 'Sub', 'Html', 'Regexpr', 'File handler']"
18945,1301.3524,Indre Zliobaite,Indre Zliobaite,"How good is the Electricity benchmark for evaluating concept drift
  adaptation","2 pages of content, 1 appendix, 2 figures",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this correspondence, we will point out a problem with testing adaptive
classifiers on autocorrelated data. In such a case random change alarms may
boost the accuracy figures. Hence, we cannot be sure if the adaptation is
working well.
","[{'version': 'v1', 'created': 'Tue, 15 Jan 2013 22:51:40 GMT'}]",2013-01-17,"[['Zliobaite', 'Indre', '']]","['data streams', 'concept drift', 'evaluation', 'autocorrelated labels']"
18946,1610.00505,Manuel Lafond,"Manuel Lafond, C\'eline Scornavacca",On the Weighted Quartet Consensus problem,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In phylogenetics, the consensus problem consists in summarizing a set of
phylogenetic trees that all classify the same set of species into a single
tree. Several definitions of consensus exist in the literature; in this paper
we focus on the Weighted Quartet Consensus problem, a problem with unknown
complexity status so far. Here we prove that the Weighted Quartet Consensus
problem is NP-hard and we give a 1/2-factor approximation for this problem.
During the process, we propose a derandomization procedure of a previously
known randomized 1/3-factor approximation. We also investigate the
fixed-parameter tractability of this problem.
","[{'version': 'v1', 'created': 'Mon, 3 Oct 2016 11:51:21 GMT'}, {'version': 'v2', 'created': 'Wed, 10 May 2017 18:21:42 GMT'}]",2017-05-12,"[['Lafond', 'Manuel', ''], ['Scornavacca', 'Céline', '']]","['Phylogenetic tree', 'consensus tree', 'quartets', 'complexity', 'fixed-parametertractability', 'approximability']"
18947,1402.2097,Avivit Levy,Gary Benson and Avivit Levy and Riva Shalom,Longest Common Subsequence in k-length substrings,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we define a new problem, motivated by computational biology,
$LCSk$ aiming at finding the maximal number of $k$ length $substrings$,
matching in both input strings while preserving their order of appearance. The
traditional LCS definition is a special case of our problem, where $k = 1$. We
provide an algorithm, solving the general case in $O(n^2)$ time, where $n$ is
the length of the input strings, equaling the time required for the special
case of $k=1$. The space requirement of the algorithm is $O(kn)$. %, however,
in order to enable %backtracking of the solution, $O(n^2)$ space is needed.
  We also define a complementary $EDk$ distance measure and show that
$EDk(A,B)$ can be computed in $O(nm)$ time and $O(km)$ space, where $m$, $n$
are the lengths of the input sequences $A$ and $B$ respectively.
","[{'version': 'v1', 'created': 'Mon, 10 Feb 2014 10:54:52 GMT'}]",2014-02-11,"[['Benson', 'Gary', ''], ['Levy', 'Avivit', ''], ['Shalom', 'Riva', '']]","['Longest common subsequence', 'Similarity of strings', 'Edit distance', 'Dynamic programming']"
18948,1407.7083,Masaaki Nagahara,"Masaaki Nagahara, Hampei Sasahara, Kazunori Hayashi, and Yutaka
  Yamamoto","Sampled-Data H-infinity Design of Coupling Wave Cancelers in
  Single-Frequency Full-Duplex Relay Stations","SICE Annual Conference 2014 (6 pages, 12 figures)",,,,cs.SY cs.IT math.IT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, we propose sampled-data H-infinity design of digital filters
that cancel the continuous-time effect of coupling waves in a single-frequency
full-duplex relay station. In this study, we model a relay station as a
continuous-time system while conventional researches treat it as a
discrete-time system. For a continuous-time model, we propose digital
feedforward and feedback cancelers based on the sampled-data control theory to
cancel coupling waves taking intersample behavior into account. Simulation
results are shown to illustrate the effectiveness of the proposed method.
","[{'version': 'v1', 'created': 'Sat, 26 Jul 2014 02:48:15 GMT'}]",2014-07-29,"[['Nagahara', 'Masaaki', ''], ['Sasahara', 'Hampei', ''], ['Hayashi', 'Kazunori', ''], ['Yamamoto', 'Yutaka', '']]","['wireless communication', 'coupling wave cancelation', 'sampled-data control', 'H∞ optimization']"
18949,1407.2357,Minal Lopes,"Minal Lopes, Nisha Sarwade",Cryptography from Quantum mechanical viewpoint,"International Journal on Cryptography and Information Security
  (IJCIS), Vol. 4, No. 2, June 2014",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cryptography is an art and science of secure communication. Here the sender
and receiver are guaranteed the security through encryption of their data, with
the help of a common key. Both the parties should agree on this key prior to
communication. The cryptographic systems which perform these tasks are designed
to keep the key secret while assuming that the algorithm used for encryption
and decryption is public. Thus key exchange is a very sensitive issue. In
modern cryptographic algorithms this security is based on the mathematical
complexity of the algorithm. But quantum computation is expected to
revolutionize computing paradigm in near future. This presents a challenge
amongst the researchers to develop new cryptographic techniques that can
survive the quantum computing era. This paper reviews the radical use of
quantum mechanics for cryptography.
","[{'version': 'v1', 'created': 'Wed, 9 Jul 2014 05:21:14 GMT'}]",2014-07-10,"[['Lopes', 'Minal', ''], ['Sarwade', 'Nisha', '']]","['Quantum cryptography (QC)', 'Quantum key Distribution (QKD)', 'Quantum Mechanics', 'Bell’s Theorem']"
18950,1412.6455,Stefano Turchetta,Paul W. Goldberg and Stefano Turchetta,Query Complexity of Approximate Equilibria in Anonymous Games,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the computation of equilibria of anonymous games, via algorithms
that may proceed via a sequence of adaptive queries to the game's payoff
function, assumed to be unknown initially. The general topic we consider is
\emph{query complexity}, that is, how many queries are necessary or sufficient
to compute an exact or approximate Nash equilibrium.
  We show that exact equilibria cannot be found via query-efficient algorithms.
We also give an example of a 2-strategy, 3-player anonymous game that does not
have any exact Nash equilibrium in rational numbers. However, more positive
query-complexity bounds are attainable if either further symmetries of the
utility functions are assumed or we focus on approximate equilibria. We
investigate four sub-classes of anonymous games previously considered by
\cite{bfh09, dp14}.
  Our main result is a new randomized query-efficient algorithm that finds a
$O(n^{-1/4})$-approximate Nash equilibrium querying $\tilde{O}(n^{3/2})$
payoffs and runs in time $\tilde{O}(n^{3/2})$. This improves on the running
time of pre-existing algorithms for approximate equilibria of anonymous games,
and is the first one to obtain an inverse polynomial approximation in
poly-time. We also show how this can be utilized as an efficient
polynomial-time approximation scheme (PTAS). Furthermore, we prove that
$\Omega(n \log{n})$ payoffs must be queried in order to find any
$\epsilon$-well-supported Nash equilibrium, even by randomized algorithms.
","[{'version': 'v1', 'created': 'Fri, 19 Dec 2014 17:45:12 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Apr 2015 18:02:38 GMT'}, {'version': 'v3', 'created': 'Thu, 5 May 2016 17:44:50 GMT'}]",2016-05-06,"[['Goldberg', 'Paul W.', ''], ['Turchetta', 'Stefano', '']]","['Algorithms', 'Computational complexity', 'Game theory']"
18951,1504.07218,Yuxin Chen,"Yuxin Chen, Changho Suh",Spectral MLE: Top-$K$ Rank Aggregation from Pairwise Comparisons,"accepted to International Conference on Machine Learning (ICML), 2015",,,,cs.LG cs.DS cs.IT math.IT math.ST stat.ML stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper explores the preference-based top-$K$ rank aggregation problem.
Suppose that a collection of items is repeatedly compared in pairs, and one
wishes to recover a consistent ordering that emphasizes the top-$K$ ranked
items, based on partially revealed preferences. We focus on the
Bradley-Terry-Luce (BTL) model that postulates a set of latent preference
scores underlying all items, where the odds of paired comparisons depend only
on the relative scores of the items involved.
  We characterize the minimax limits on identifiability of top-$K$ ranked
items, in the presence of random and non-adaptive sampling. Our results
highlight a separation measure that quantifies the gap of preference scores
between the $K^{\text{th}}$ and $(K+1)^{\text{th}}$ ranked items. The minimum
sample complexity required for reliable top-$K$ ranking scales inversely with
the separation measure irrespective of other preference distribution metrics.
To approach this minimax limit, we propose a nearly linear-time ranking scheme,
called \emph{Spectral MLE}, that returns the indices of the top-$K$ items in
accordance to a careful score estimate. In a nutshell, Spectral MLE starts with
an initial score estimate with minimal squared loss (obtained via a spectral
method), and then successively refines each component with the assistance of
coordinate-wise MLEs. Encouragingly, Spectral MLE allows perfect top-$K$ item
identification under minimal sample complexity. The practical applicability of
Spectral MLE is further corroborated by numerical experiments.
","[{'version': 'v1', 'created': 'Mon, 27 Apr 2015 19:30:01 GMT'}, {'version': 'v2', 'created': 'Thu, 28 May 2015 06:04:15 GMT'}]",2015-05-29,"[['Chen', 'Yuxin', ''], ['Suh', 'Changho', '']]","['Bradley-Terry-Luce model', 'top-K ranking', 'linear-time algorithm', 'minimaxlimits', 'coordinate-wise MLE']"
18952,1307.5377,Ahmet Husainov A.,Ahmet A. Husainov,"Homology and Bisimulation of Asynchronous Transition Systems and Petri
  Nets",21 pages,,,,cs.LO math.AT,http://creativecommons.org/licenses/by/3.0/,"  Homology groups of labelled asynchronous transition systems and Petri nets
are introduced. Examples of computing the homology groups are given. It is
proved that if labelled asynchronous transition systems are bisimulation
equivalent, then they have isomorphic homology groups. A method of constructing
a Petri net with given homology groups is found.
","[{'version': 'v1', 'created': 'Sat, 20 Jul 2013 06:34:50 GMT'}]",2013-07-23,"[['Husainov', 'Ahmet A.', '']]","['bisimulation', 'homology groups', 'simplicial complex', 'trace monoid', 'partial action', 'asynchronous system', 'Petri net']"
18953,1702.03594,Andr\'es Herrera-Poyatos,Andr\'es Herrera-Poyatos and Francisco Herrera,"Genetic and Memetic Algorithm with Diversity Equilibrium based on Greedy
  Diversification","27 pages, 5 figures, 11 tables",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The lack of diversity in a genetic algorithm's population may lead to a bad
performance of the genetic operators since there is not an equilibrium between
exploration and exploitation. In those cases, genetic algorithms present a fast
and unsuitable convergence.
  In this paper we develop a novel hybrid genetic algorithm which attempts to
obtain a balance between exploration and exploitation. It confronts the
diversity problem using the named greedy diversification operator. Furthermore,
the proposed algorithm applies a competition between parent and children so as
to exploit the high quality visited solutions. These operators are complemented
by a simple selection mechanism designed to preserve and take advantage of the
population diversity.
  Additionally, we extend our proposal to the field of memetic algorithms,
obtaining an improved model with outstanding results in practice.
  The experimental study shows the validity of the approach as well as how
important is taking into account the exploration and exploitation concepts when
designing an evolutionary algorithm.
","[{'version': 'v1', 'created': 'Sun, 12 Feb 2017 23:23:17 GMT'}]",2017-02-14,"[['Herrera-Poyatos', 'Andrés', ''], ['Herrera', 'Francisco', '']]","['genetic algorithms', 'memetic algorithms', 'exploration vs exploitation', 'population diversity', 'hybridization']"
18954,1107.3863,Anupam Das,Anupam Das and Nikita Borisov,Securing Tor Tunnels under the Selective-DoS Attack,,,,,cs.CR cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Anonymous communication systems are subject to selective denial-of-service
(DoS) attacks. Selective DoS attacks lower anonymity as they force paths to be
rebuilt multiple times to ensure delivery which increases the opportunity for
more attack. In this paper we present a detection algorithm that filters out
compromised communication channels for one of the most widely used anonymity
networks, Tor. Our detection algorithm uses two levels of probing to filter out
potentially compromised tunnels. We perform probabilistic analysis and
extensive simulation to show the robustness of our detection algorithm. We also
analyze the overhead of our detection algorithm and show that we can achieve
satisfactory security guarantee for reasonable communication overhead (5% of
the total available Tor bandwidth in the worst case). Real world experiments
reveal that our detection algorithm provides good defense against selective DoS
attack.
","[{'version': 'v1', 'created': 'Tue, 19 Jul 2011 23:35:05 GMT'}, {'version': 'v2', 'created': 'Sat, 5 May 2012 01:09:10 GMT'}, {'version': 'v3', 'created': 'Tue, 18 Dec 2012 21:07:41 GMT'}]",2015-03-19,"[['Das', 'Anupam', ''], ['Borisov', 'Nikita', '']]","['Anonymity', 'Tor network', 'denial of service (DoS) attack']"
18955,1401.0504,Phuong Huynh Thi Xuan,Chien Huynh and Phuong Huynh,"Student-based Collaborative Network for Delivering Information of
  Natural Disasters and Climate Adaptation","4 pages, 5 figures",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The student generation nowadays is considered as the Net Generation who grow
up in the age of Internet and mobile technology and prefer bringing
technological application into their life. The Learning Resource Center, an
academic information center, takes the initiative in developing a collaborative
network with the participation of students for delivering information of
natural disasters and climate adaptation to the people who live in the
vulnerable areas of Thua Thien Hue province. The network is aimed at helping
local people mitigating vulnerabilities and adapting to the globally climate
change for a better life.
","[{'version': 'v1', 'created': 'Sat, 28 Dec 2013 08:32:41 GMT'}]",2014-01-03,"[['Huynh', 'Chien', ''], ['Huynh', 'Phuong', '']]","['collaborative network', 'student-based network', 'youthful participation', 'information delivery', 'natural disasters', 'climate adaptation']"
18956,1704.06012,Megumi Kaneko,"Megumi Kaneko, Gene Cheung, Weng-tai Su and Chia-Wen Lin","Graph-based Joint Signal / Power Restoration for Energy Harvesting
  Wireless Sensor Networks",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The design of energy and spectrally efficient Wireless Sensor Networks (WSN)
is crucial to support the upcoming expansion of IoT/M2M mobile data traffic. In
this work, we consider an energy harvesting WSN where sensor data are
periodically reported to a Fusion Center (FC) by a sparse set of active
sensors. Unlike most existing works, the transmit power levels of each sensor
are assumed to be unknown at the FC in this distributed setting. We address the
inverse problem of joint signal / power restoration at the FC- a challenging
under-determined separation problem. To regularize the ill-posed problem, we
assume both a graph-signal smoothness prior (signal is smooth with respect to a
graph modeling spatial correlation among sensors) and a sparsity power prior
for the two unknown variables. We design an efficient algorithm by alternately
fixing one variable and solving for the other until convergence. Specifically,
when the signal is fixed, we solve for the power vector using Simplex pivoting
in linear programming (LP) to iteratively identify sparse feasible solutions,
locally minimizing an objective. Simulation results show that our proposal can
achieve very low reconstruction errors and outperform conventional schemes
under reasonable assumptions
","[{'version': 'v1', 'created': 'Thu, 20 Apr 2017 04:51:11 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Apr 2017 02:08:53 GMT'}, {'version': 'v3', 'created': 'Fri, 23 Jun 2017 02:23:00 GMT'}]",2017-06-26,"[['Kaneko', 'Megumi', ''], ['Cheung', 'Gene', ''], ['Su', 'Weng-tai', ''], ['Lin', 'Chia-Wen', '']]","['Wireless Sensor Networks', 'Graph Signal Processing', 'Compressed Sensing', 'Energy Harvesting']"
18957,0802.2317,Christophe Prieur,"Christophe Prieur (LIAFA), Dominique Cardon, Jean-Samuel Beuscart,
  Nicolas Pissard, Pascal Pons (LIAFA)",The Stength of Weak cooperation: A Case Study on Flickr,,,,,cs.CY,,"  Web 2.0 works with the principle of weak cooperation, where a huge amount of
individual contributions build solid and structured sources of data. In this
paper, we detail the main properties of this weak cooperation by illustrating
them on the photo publication website Flickr, showing the variety of uses
producing a rich content and the various procedures devised by Flickr users
themselves to select quality. We underlined the interaction between small and
heavy users as a specific form of collective production in large social
networks communities. We also give the main statistics on the (5M-users,
150M-photos) data basis we worked on for this study, collected from Flickr
website using the public API.
","[{'version': 'v1', 'created': 'Sat, 16 Feb 2008 05:54:08 GMT'}]",2008-02-19,"[['Prieur', 'Christophe', '', 'LIAFA'], ['Cardon', 'Dominique', '', 'LIAFA'], ['Beuscart', 'Jean-Samuel', '', 'LIAFA'], ['Pissard', 'Nicolas', '', 'LIAFA'], ['Pons', 'Pascal', '', 'LIAFA']]","['web2.0', 'social media', 'flickr', 'folksonomies', 'self-organization', 'social networks']"
18958,1403.6518,Edouard Bonnet,"Edouard Bonnet, Florian Jamain and Abdallah Saffidine",Havannah and TwixT are PSPACE-complete,"13 pages, 7 figures. Accepted in CG'13",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Numerous popular abstract strategy games ranging from Hex and Havannah to
Lines of Action belong to the class of connection games. Still, very few
complexity results on such games have been obtained since Hex was proved
PSPACE-complete in the early eighties. We study the complexity of two
connection games among the most widely played. Namely, we prove that Havannah
and TwixT are PSPACE-complete. The proof for Havannah involves a reduction from
Generalized Geography and is based solely on ring-threats to represent the
input graph. On the other hand, the reduction for TwixT builds up on previous
work as it is a straightforward encoding of Hex.
","[{'version': 'v1', 'created': 'Tue, 25 Mar 2014 21:55:25 GMT'}]",2014-03-27,"[['Bonnet', 'Edouard', ''], ['Jamain', 'Florian', ''], ['Saffidine', 'Abdallah', '']]","['Complexity', 'Connection game', 'Havannah', 'TwixT', 'Generalized Geography', 'Hex', 'pspace']"
18959,1402.7063,Spyros Sioutas SS,"Nikolaos Nodarakis, Spyros Sioutas, Dimitrios Tsoumakos, Giannis
  Tzimas and Evaggelia Pitoura","Rapid AkNN Query Processing for Fast Classification of Multidimensional
  Data in the Cloud","12 pages, 14 figures, 4 tables (it will be submitted to DEXA 2014)",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A $k$-nearest neighbor ($k$NN) query determines the $k$ nearest points, using
distance metrics, from a specific location. An all $k$-nearest neighbor
(A$k$NN) query constitutes a variation of a $k$NN query and retrieves the $k$
nearest points for each point inside a database. Their main usage resonates in
spatial databases and they consist the backbone of many location-based
applications and not only (i.e. $k$NN joins in databases, classification in
data mining). So, it is very crucial to develop methods that answer them
efficiently. In this work, we propose a novel method for classifying
multidimensional data using an A$k$NN algorithm in the MapReduce framework. Our
approach exploits space decomposition techniques for processing the
classification procedure in a parallel and distributed manner. To our
knowledge, we are the first to study the classification of multidimensional
objects under this perspective. Through an extensive experimental evaluation we
prove that our solution is efficient and scalable in processing the given
queries. We investigate many different perspectives that can affect the total
computational cost, such as different dataset distributions, number of
dimensions, growth of $k$ value and granularity of space decomposition and
prove that our system is efficient, robust and scalable.
","[{'version': 'v1', 'created': 'Thu, 27 Feb 2014 20:46:09 GMT'}]",2014-02-28,"[['Nodarakis', 'Nikolaos', ''], ['Sioutas', 'Spyros', ''], ['Tsoumakos', 'Dimitrios', ''], ['Tzimas', 'Giannis', ''], ['Pitoura', 'Evaggelia', '']]","['classification', 'nearest neighbor', 'MapReduce', 'Hadoop', 'multidimensional data', 'query processing']"
18960,1802.08780,Chaitanya Manapragada,"Chaitanya Manapragada, Geoff Webb, Mahsa Salehi",Extremely Fast Decision Tree,Submitted to KDD'2018,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a novel incremental decision tree learning algorithm, Hoeffding
Anytime Tree, that is statistically more efficient than the current
state-of-the-art, Hoeffding Tree. We demonstrate that an implementation of
Hoeffding Anytime Tree---""Extremely Fast Decision Tree"", a minor modification
to the MOA implementation of Hoeffding Tree---obtains significantly superior
prequential accuracy on most of the largest classification datasets from the
UCI repository. Hoeffding Anytime Tree produces the asymptotic batch tree in
the limit, is naturally resilient to concept drift, and can be used as a higher
accuracy replacement for Hoeffding Tree in most scenarios, at a small
additional computational cost.
","[{'version': 'v1', 'created': 'Sat, 24 Feb 2018 01:44:47 GMT'}]",2018-02-27,"[['Manapragada', 'Chaitanya', ''], ['Webb', 'Geoff', ''], ['Salehi', 'Mahsa', '']]","['Incremental Learning', 'Decision Trees', 'Classification']"
18961,1710.05185,Ali Gholami Rudi,Ali Gholami Rudi,Approximate Hotspots of Orthogonal Trajectories,The approximation ratio was improved,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we study the problem of finding hotspots, i.e. regions in which
a moving entity has spent a significant amount of time, for polygonal
trajectories. The fastest optimal algorithm, due to Gudmundsson, van Kreveld,
and Staals (2013) finds an axis-parallel square hotspot of fixed side length in
$O(n^2)$. Limiting ourselves to the case in which the entity moves in a
direction parallel either to the $x$ or the $y$-axis, We present an
approximation algorithm with the time complexity $O(n \log^3 n)$ and
approximation factor $1/2$.
","[{'version': 'v1', 'created': 'Sat, 14 Oct 2017 13:34:40 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Oct 2017 12:56:08 GMT'}, {'version': 'v3', 'created': 'Fri, 9 Feb 2018 13:03:09 GMT'}, {'version': 'v4', 'created': 'Wed, 12 Jun 2019 06:28:43 GMT'}]",2019-06-13,"[['Rudi', 'Ali Gholami', '']]","['Trajectory', 'Hotspot', 'Kinetic tournament', 'Geometric algorithms']"
18962,1604.06697,Armin Wei{\ss},Stefan Edelkamp and Armin Wei{\ss},BlockQuicksort: How Branch Mispredictions don't affect Quicksort,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since the work of Kaligosi and Sanders (2006), it is well-known that
Quicksort -- which is commonly considered as one of the fastest in-place
sorting algorithms -- suffers in an essential way from branch mispredictions.
We present a novel approach to address this problem by partially decoupling
control from data flow: in order to perform the partitioning, we split the
input in blocks of constant size (we propose 128 data elements); then, all
elements in one block are compared with the pivot and the outcomes of the
comparisons are stored in a buffer. In a second pass, the respective elements
are rearranged. By doing so, we avoid conditional branches based on outcomes of
comparisons at all (except for the final Insertionsort). Moreover, we prove
that for a static branch predictor the average total number of branch
mispredictions is at most $\epsilon n \log n + O(n)$ for some small $\epsilon$
depending on the block size when sorting $n$ elements.
  Our experimental results are promising: when sorting random integer data, we
achieve an increase in speed of 80% over the GCC implementation of C++
std::sort. Also for many other types of data and non-random inputs, there is
still a significant speedup over std::sort. Only in few special cases like
sorted or almost sorted inputs, std::sort can beat out implementation.
Moreover, even on random input permutations, our implementation is even
slightly faster than an implementation of the highly tuned Super Scalar Sample
Sort, which uses a linear amount of additional space.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2016 15:07:03 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Jun 2016 20:04:03 GMT'}]",2016-06-27,"[['Edelkamp', 'Stefan', ''], ['Weiß', 'Armin', '']]","['in-place sorting', 'Quicksort', 'branch mispredictions', 'lean programs']"
18963,1712.05577,George Philipp,"George Philipp, Dawn Song, Jaime G. Carbonell","The exploding gradient problem demystified - definition, prevalence,
  impact, origin, tradeoffs, and solutions","An earlier version of this paper was named ""Gradients explode - Deep
  Networks are shallow - ResNet explained"" and presented at the ICLR 2018
  workshop (https://openreview.net/forum?id=rJjcdFkPM)",,,,cs.LG cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Whereas it is believed that techniques such as Adam, batch normalization and,
more recently, SeLU nonlinearities ""solve"" the exploding gradient problem, we
show that this is not the case in general and that in a range of popular MLP
architectures, exploding gradients exist and that they limit the depth to which
networks can be effectively trained, both in theory and in practice. We explain
why exploding gradients occur and highlight the *collapsing domain problem*,
which can arise in architectures that avoid exploding gradients.
  ResNets have significantly lower gradients and thus can circumvent the
exploding gradient problem, enabling the effective training of much deeper
networks. We show this is a direct consequence of the Pythagorean equation. By
noticing that *any neural network is a residual network*, we devise the
*residual trick*, which reveals that introducing skip connections simplifies
the network mathematically, and that this simplicity may be the major cause for
their success.
","[{'version': 'v1', 'created': 'Fri, 15 Dec 2017 08:25:51 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Dec 2017 15:36:32 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Mar 2018 17:12:48 GMT'}, {'version': 'v4', 'created': 'Fri, 6 Apr 2018 21:32:29 GMT'}]",2018-04-10,"[['Philipp', 'George', ''], ['Song', 'Dawn', ''], ['Carbonell', 'Jaime G.', '']]","['deep learning', 'neural networks', 'residual networks', 'exploding gradients', 'vanishing gradients']"
18964,1206.2038,Tien Tuan Anh Dinh,"Dinh Tien Tuan Anh, Quach Vinh Thanh, Anwitaman Datta",CloudMine: Multi-Party Privacy-Preserving Data Analytics Service,,,,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An increasing number of businesses are replacing their data storage and
computation infrastructure with cloud services. Likewise, there is an increased
emphasis on performing analytics based on multiple datasets obtained from
different data sources. While ensuring security of data and computation
outsourced to a third party cloud is in itself challenging, supporting
analytics using data distributed across multiple, independent clouds is even
further from trivial. In this paper we present CloudMine, a cloud-based service
which allows multiple data owners to perform privacy-preserved computation over
the joint data using their clouds as delegates. CloudMine protects data privacy
with respect to semi-honest data owners and semi-honest clouds. It furthermore
ensures the privacy of the computation outputs from the curious clouds. It
allows data owners to reliably detect if their cloud delegates have been lazy
when carrying out the delegated computation. CloudMine can run as a centralized
service on a single cloud, or as a distributed service over multiple,
independent clouds. CloudMine supports a set of basic computations that can be
used to construct a variety of highly complex, distributed privacy-preserving
data analytics. We demonstrate how a simple instance of CloudMine (secure sum
service) is used to implement three classical data mining tasks
(classification, association rule mining and clustering) in a cloud
environment. We experiment with a prototype of the service, the results of
which suggest its practicality for supporting privacy-preserving data analytics
as a (multi) cloud-based service.
","[{'version': 'v1', 'created': 'Sun, 10 Jun 2012 16:27:48 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Oct 2013 05:14:19 GMT'}]",2013-10-02,"[['Anh', 'Dinh Tien Tuan', ''], ['Thanh', 'Quach Vinh', ''], ['Datta', 'Anwitaman', '']]","['delegated multiparty computation', 'privacy-preserving data analytics', 'multi-cloud', 'cloud service']"
18965,1106.3369,Bimal Kumar Mr,Bimal Aklesh Kumar,Evaluation of Fiji National University Campus Information Systems,vol. 2 no. 3 2011,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fiji National University (FNU) has been encountering many difficulties with
its current campus administrative systems. These difficulties include
accessibility, scalability, performance, flexibility and integration. In order
to address these difficulties, we developed a thin client web based campus
information system. The newly designed system allows the students, academic and
administration staff of the university to handle their day to day affairs with
the university online. In this paper we describe three types of evaluation
carried out to determine the suitability of newly developed system for FNU
environment. User interface evaluation was carried out to assess user interface
on a set of usability principles, usability evaluation to see the ease at which
users can use the system and finally performance evaluation to verify and
validate user response time required to complete various tasks. The result of
each of these evaluations were analysed and the system was rectified as part of
iterative design process.
","[{'version': 'v1', 'created': 'Thu, 16 Jun 2011 23:05:50 GMT'}]",2011-06-20,"[['Kumar', 'Bimal Aklesh', '']]","['software evaluation', 'heuristics', 'usability', 'performance evaluation']"
18966,0705.0761,Tshilidzi Marwala,Tshilidzi Marwala and Bodie Crossingham,Bayesian Approach to Neuro-Rough Models,"24 pages, 5 figures, 1 table",,,,cs.AI,,"  This paper proposes a neuro-rough model based on multi-layered perceptron and
rough set. The neuro-rough model is then tested on modelling the risk of HIV
from demographic data. The model is formulated using Bayesian framework and
trained using Monte Carlo method and Metropolis criterion. When the model was
tested to estimate the risk of HIV infection given the demographic data it was
found to give the accuracy of 62%. The proposed model is able to combine the
accuracy of the Bayesian MLP model and the transparency of Bayesian rough set
model.
","[{'version': 'v1', 'created': 'Sun, 6 May 2007 22:55:58 GMT'}, {'version': 'v2', 'created': 'Wed, 9 May 2007 04:13:04 GMT'}, {'version': 'v3', 'created': 'Tue, 28 Aug 2007 09:24:46 GMT'}]",2007-08-28,"[['Marwala', 'Tshilidzi', ''], ['Crossingham', 'Bodie', '']]","['Neuro-rough model', 'multi-layered perceptron', 'Bayesian', 'HIV modelling']"
18967,1603.02252,Wenbin Li,Wenbin Li and Darren Cosker and Matthew Brown,Drift Robust Non-rigid Optical Flow Enhancement for Long Sequences,"Preprint version of our paper accepted by Journal of Intelligent and
  Fuzzy Systems",,,,cs.CV,http://creativecommons.org/publicdomain/zero/1.0/,"  It is hard to densely track a nonrigid object in long term, which is a
fundamental research issue in the computer vision community. This task often
relies on estimating pairwise correspondences between images over time where
the error is accumulated and leads to a drift issue. In this paper, we
introduce a novel optimization framework with an Anchor Patch constraint. It is
supposed to significantly reduce overall errors given long sequences containing
non-rigidly deformable objects. Our framework can be applied to any dense
tracking algorithm, e.g. optical flow. We demonstrate the success of our
approach by showing significant error reduction on 6 popular optical flow
algorithms applied to a range of real-world nonrigid benchmarks. We also
provide quantitative analysis of our approach given synthetic occlusions and
image noise.
","[{'version': 'v1', 'created': 'Mon, 7 Mar 2016 20:51:15 GMT'}]",2016-03-08,"[['Li', 'Wenbin', ''], ['Cosker', 'Darren', ''], ['Brown', 'Matthew', '']]","['Computer Vision', 'Dense Tracking', 'Anchor Patch', 'Optical Flow', 'Drift', 'Long Sequence']"
18968,1504.06103,Tomas Vojir,"Tomas Vojir, Jiri Matas, Jana Noskova",Online Adaptive Hidden Markov Model for Multi-Tracker Fusion,"27 pages, 9 figures, submitted to CVIU journal",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel method for visual object tracking called
HMMTxD. The method fuses observations from complementary out-of-the box
trackers and a detector by utilizing a hidden Markov model whose latent states
correspond to a binary vector expressing the failure of individual trackers.
The Markov model is trained in an unsupervised way, relying on an online
learned detector to provide a source of tracker-independent information for a
modified Baum- Welch algorithm that updates the model w.r.t. the partially
annotated data.
  We show the effectiveness of the proposed method on combination of two and
three tracking algorithms. The performance of HMMTxD is evaluated on two
standard benchmarks (CVPR2013 and VOT) and on a rich collection of 77 publicly
available sequences. The HMMTxD outperforms the state-of-the-art, often
significantly, on all datasets in almost all criteria.
","[{'version': 'v1', 'created': 'Thu, 23 Apr 2015 09:34:59 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Mar 2016 14:52:18 GMT'}]",2016-03-07,"[['Vojir', 'Tomas', ''], ['Matas', 'Jiri', ''], ['Noskova', 'Jana', '']]","['visual tracking', 'on-line learning', 'hidden markov model', 'object detection']"
18969,0804.3103,Vassilis Kostakos,"Vassilis Kostakos, Eamonn O'Neill","Size matters: performance declines if your pixels are too big or too
  small","10 pages, 13 figures, 7 tables",,,,cs.GR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a conceptual model that describes the effect of pixel size on
target acquisition. We demonstrate the use of our conceptual model by applying
it to predict and explain the results of an experiment to evaluate users'
performance in a target acquisition task involving three distinct display
sizes: standard desktop, small and large displays. The results indicate that
users are fastest on standard desktop displays, undershoots are the most common
error on small displays and overshoots are the most common error on large
displays. We propose heuristics to maintain usability when changing displays.
Finally, we contribute to the growing body of evidence that amplitude does
affect performance in a display-based pointing task.
","[{'version': 'v1', 'created': 'Fri, 18 Apr 2008 21:02:19 GMT'}]",2008-04-22,"[['Kostakos', 'Vassilis', ''], [""O'Neill"", 'Eamonn', '']]","['Fitts’ law', 'Control-Display ratio', 'Motor SpaceDisplay Space ratio', 'pixel size', 'display', 'screen size', 'pervasive computing', 'ubiquitous computing']"
18970,0804.3237,Chantal Enguehard,"Chantal Enguehard (LINA), Jean-Didier Graton",Electronic Voting: the Devil is in the Details,9 pages,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Observing electronic voting from an international point of view gives some
perspective about its genesis and evolution. An analysis of the voting process
through its cultural, ontological, legal and political dimensions explains the
difficulty to normalize this process. It appears that international
organizations are not capable to properly defend the fundamental rights of the
citizens. The approach that was taken when DRE voting computers appeared seems
to have reoccured with VVAT voting computers and the european e-poll project.
","[{'version': 'v1', 'created': 'Mon, 21 Apr 2008 06:01:54 GMT'}]",2008-12-18,"[['Enguehard', 'Chantal', '', 'LINA'], ['Graton', 'Jean-Didier', '']]","['VVAT', 'DRE', 'voting computers', 'e-voting', 'electronic voting', 'e-poll', 'electronic voting systems']"
18971,1212.5815,Jean-Francois Stumper,"Jean-Francois Stumper, Alexander D\""otlinger and Ralph Kennel","Classical Model Predictive Control of a Permanent Magnet Synchronous
  Motor","Preprint of: European Power Electronics and Drives Journal (EPE J.),
  Vol. 22, No. 3, pages 24 - 31, 2012. Invited paper",,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A model predictive control (MPC) scheme for a permanent-magnet synchronous
motor (PMSM) is presented. The torque controller optimizes a quadratic cost
consisting of control error and machine losses repeatedly, accounting the
voltage and current limitations. The scheme extensively relies on optimization,
to meet the runtime limitation, a suboptimal algorithm based on differential
flatness, continuous parameterization and linear programming is introduced.
  The multivariable controller exploits cross-coupling effects in the
long-range constrained predictive control strategy. The optimization results in
fast and smooth torque dynamics while inherently using field-weakening to
improve the power efficiency and the current dynamics in high speed operation.
As distinctive MPC feature, constraint handling is improved, instead of just
saturating the control input, field weakening is applied dynamically to bypass
the voltage limitation. The performance of the scheme is demonstrated by
experimental and numerical results.
","[{'version': 'v1', 'created': 'Sun, 23 Dec 2012 16:39:27 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Dec 2012 14:05:06 GMT'}]",2013-01-01,"[['Stumper', 'Jean-Francois', ''], ['Dötlinger', 'Alexander', ''], ['Kennel', 'Ralph', '']]","['Optimal Control', 'Control of Drive', 'Synchronous Motor']"
18972,1604.00036,Jos\'e Oramas,"Jose Oramas, Tinne Tuytelaars",Modeling Visual Compatibility through Hierarchical Mid-level Elements,"29 pages, 19 Figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a hierarchical method to discover mid-level elements
with the objective of modeling visual compatibility between objects. At the
base-level, our method identifies patterns of CNN activations with the aim of
modeling different variations/styles in which objects of the classes of
interest may occur. At the top-level, the proposed method discovers patterns of
co-occurring activations of base-level elements that define visual
compatibility between pairs of object classes. Experiments on the massive
Amazon dataset show the strength of our method at describing object classes and
the characteristics that drive the compatibility between them.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2016 20:18:16 GMT'}]",2016-04-04,"[['Oramas', 'Jose', ''], ['Tuytelaars', 'Tinne', '']]","['compatibility modeling', 'mid-level representations', 'retrieval']"
18973,1401.5292,Etienne Payet,"\'Etienne Payet, Fred Mesnard, Fausto Spoto",Non-Termination Analysis of Java Bytecode,"17 pages, technical report written in May 2012",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a fully automated static analysis that takes a sequential Java
bytecode program P as input and attempts to prove that there exists an infinite
execution of P. The technique consists in compiling P into a constraint logic
program P_CLP and in proving non-termination of P_CLP; when P consists of
instructions that are exactly compiled into constraints, the non-termination of
P_CLP entails that of P. Our approach can handle method calls; to the best of
our knowledge, it is the first static approach for Java bytecode able to prove
the existence of infinite recursions. We have implemented our technique inside
the Julia analyser. We have compared the results of Julia on a set of 113
programs with those provided by AProVE and Invel, the only freely usable
non-termination analysers comparable to ours that we are aware of. Only Julia
could detect non-termination due to infinite recursion.
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2014 12:35:09 GMT'}]",2014-01-22,"[['Payet', 'Étienne', ''], ['Mesnard', 'Fred', ''], ['Spoto', 'Fausto', '']]","['Non-termination analysis', 'Java', 'Java bytecode']"
18974,0802.1002,Xavier Bry,Xavier Bry (I3M),New Estimation Procedures for PLS Path Modelling,,,,,cs.LG,,"  Given R groups of numerical variables X1, ... XR, we assume that each group
is the result of one underlying latent variable, and that all latent variables
are bound together through a linear equation system. Moreover, we assume that
some explanatory latent variables may interact pairwise in one or more
equations. We basically consider PLS Path Modelling's algorithm to estimate
both latent variables and the model's coefficients. New ""external"" estimation
schemes are proposed that draw latent variables towards strong group structures
in a more flexible way. New ""internal"" estimation schemes are proposed to
enable PLSPM to make good use of variable group complementarity and to deal
with interactions. Application examples are given.
","[{'version': 'v1', 'created': 'Thu, 7 Feb 2008 15:18:27 GMT'}]",2008-02-08,"[['Bry', 'Xavier', '', 'I3M']]","['Interaction effects', 'Latent Variables', 'PLS Path Modelling', 'PLS Regression', 'Thematic Components']"
18975,1301.4783,Christophe Cruz,"Helmi Ben Hmida (i3mainz), Christophe Cruz (Le2i), Frank Boochs
  (i3mainz), Christophe Nicolle (Le2i)","From 3D Point Clouds To Semantic Objects An Ontology-Based Detection
  Approach",,"International Conference on Knowledge Engineering and Ontology
  Development, Paris : France (2011)",,,cs.CG cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a knowledge-based detection of objects approach using the
OWL ontology language, the Semantic Web Rule Language, and 3D processing
built-ins aiming at combining geometrical analysis of 3D point clouds and
specialist's knowledge. This combination allows the detection and the
annotation of objects contained in point clouds. The context of the study is
the detection of railway objects such as signals, technical cupboards, electric
poles, etc. Thus, the resulting enriched and populated ontology, that contains
the annotations of objects in the point clouds, is used to feed a GIS systems
or an IFC file for architecture purposes.
","[{'version': 'v1', 'created': 'Mon, 21 Jan 2013 08:16:53 GMT'}]",2013-01-22,"[['Hmida', 'Helmi Ben', '', 'i3mainz'], ['Cruz', 'Christophe', '', 'Le2i'], ['Boochs', 'Frank', '', 'i3mainz'], ['Nicolle', 'Christophe', '', 'Le2i']]","['Geometric analysis', 'topologic analysis', '3D processing algorithm', 'semantic web', 'knowledge modelling', 'ontology', '3D scene reconstruction', 'object identification']"
18976,1701.03004,Massimo Cafaro,"Massimo Cafaro, Marco Pulimeno and Italo Epicoco",Parallel mining of time-faded heavy hitters,arXiv admin note: text overlap with arXiv:1601.03892,,,,cs.DS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present PFDCMSS, a novel message-passing based parallel algorithm for
mining time-faded heavy hitters. The algorithm is a parallel version of the
recently published FDCMSS sequential algorithm. We formally prove its
correctness by showing that the underlying data structure, a sketch augmented
with a Space Saving stream summary holding exactly two counters, is mergeable.
Whilst mergeability of traditional sketches derives immediately from theory, we
show that merging our augmented sketch is non trivial. Nonetheless, the
resulting parallel algorithm is fast and simple to implement. To the best of
our knowledge, PFDCMSS is the first parallel algorithm solving the problem of
mining time-faded heavy hitters on message-passing parallel architectures.
Extensive experimental results confirm that PFDCMSS retains the extreme
accuracy and error bound provided by FDCMSS whilst providing excellent parallel
scalability.
","[{'version': 'v1', 'created': 'Wed, 11 Jan 2017 15:07:38 GMT'}]",2017-01-12,"[['Cafaro', 'Massimo', ''], ['Pulimeno', 'Marco', ''], ['Epicoco', 'Italo', '']]","['message–passing', 'heavy hitters', 'time fading model', 'sketches']"
18977,1611.00260,Vanessa Volz M.Sc.,"Vanessa Volz, G\""unter Rudolph, Boris Naujoks",Surrogate-Assisted Partial Order-based Evolutionary Optimisation,,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel approach (SAPEO) to support the survival
selection process in multi-objective evolutionary algorithms with surrogate
models - it dynamically chooses individuals to evaluate exactly based on the
model uncertainty and the distinctness of the population. We introduce variants
that differ in terms of the risk they allow when doing survival selection.
Here, the anytime performance of different SAPEO variants is evaluated in
conjunction with an SMS-EMOA using the BBOB bi-objective benchmark. We compare
the obtained results with the performance of the regular SMS-EMOA, as well as
another surrogate-assisted approach. The results open up general questions
about the applicability and required conditions for surrogate-assisted
multi-objective evolutionary algorithms to be tackled in the future.
","[{'version': 'v1', 'created': 'Tue, 1 Nov 2016 15:00:52 GMT'}]",2016-11-02,"[['Volz', 'Vanessa', ''], ['Rudolph', 'Günter', ''], ['Naujoks', 'Boris', '']]","['partial order', 'multi-objective', 'surrogates', 'evolutionary algorithms', 'bbob']"
18978,1705.07279,Filip Paveti\'c,"Filip Paveti\'c, Ivan Katani\'c, Gustav Matula, Goran \v{Z}u\v{z}i\'c
  and Mile \v{S}iki\'c",Fast and simple algorithms for computing both $LCS_{k}$ and $LCS_{k+}$,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Longest Common Subsequence ($LCS$) deals with the problem of measuring
similarity of two strings. While this problem has been analyzed for decades,
the recent interest stems from a practical observation that considering single
characters is often too simplistic. Therefore, recent works introduce the
variants of $LCS$ based on shared substrings of length exactly or at least $k$
($LCS_k$ and $LCS_{k+}$ respectively). The main drawback of the
state-of-the-art algorithms for computing $LCS_k$ and $LCS_{k+}$ is that they
work well only in a limited setting: they either solve the average case well
while being suboptimal in the pathological situations or they achieve a good
worst-case performance, but fail to exploit the input data properties to speed
up the computation. Furthermore, these algorithms are based on non-trivial data
structures which is not ideal from a practitioner's point of view. We present a
single algorithm to compute both $LCS_k$ and $LCS_{k+}$ which outperforms the
state-of-the art algorithms in terms of runtime complexity and requires only
basic data structures. In addition, we implement an algorithm to reconstruct
the solution which offers significant improvement in terms of memory
consumption. Our empirical validation shows that we save several orders of
magnitude of memory on human genome data. The C++ implementation of our
algorithms is made available at: https://github.com/google/fast-simple-lcsk
","[{'version': 'v1', 'created': 'Sat, 20 May 2017 08:32:12 GMT'}, {'version': 'v2', 'created': 'Tue, 22 May 2018 20:36:54 GMT'}, {'version': 'v3', 'created': 'Thu, 24 May 2018 06:10:07 GMT'}]",2018-05-25,"[['Pavetić', 'Filip', ''], ['Katanić', 'Ivan', ''], ['Matula', 'Gustav', ''], ['Žužić', 'Goran', ''], ['Šikić', 'Mile', '']]","['longest common subsequence', 'string similarity', 'efficient dynamic programming', 'bioinformatics', 'memory optimization']"
18979,1402.5511,Masoud Abbaszadeh,Masoud Abbaszadeh,"A Generalized Robust Filtering Framework for Nonlinear
  Differential-Algebraic Systems","26 pages, 5 figures",,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A generalized dynamical robust nonlinear filtering framework is established
for a class of Lipschitz differential algebraic systems, in which the
nonlinearities appear both in the state and measured output equations. The
system is assumed to be affected by norm-bounded disturbance and to have both
norm-bounded uncertainties in the realization matrices as well as nonlinear
model uncertainties. We synthesize a robust H_infty filter through semidefinite
programming and strict linear matrix inequalities (LMIs). The admissible
Lipschitz constants of the nonlinear functions are maximized through LMI
optimization. The resulting H_infty filter guarantees asymptotic stability of
the estimation error dynamics with prespecified disturbance attenuation level
and is robust against time-varying parametric uncertainties as well as
Lipschitz nonlinear additive uncertainty. Explicit bound on the tolerable
nonlinear uncertainty is derived based on a norm-wise robustness analysis.
","[{'version': 'v1', 'created': 'Sat, 22 Feb 2014 13:21:24 GMT'}]",2014-02-25,"[['Abbaszadeh', 'Masoud', '']]","['Robust Filtering', 'Nonlinear H∞', 'Differential Algebraic Equations', 'Descriptor Systems', 'Semidefinite Programming']"
18980,1505.04406,Stephen Bach,"Stephen H. Bach, Matthias Broecheler, Bert Huang, Lise Getoor",Hinge-Loss Markov Random Fields and Probabilistic Soft Logic,,"Journal of Machine Learning Research (JMLR), 18(109):1-67, 2017",,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A fundamental challenge in developing high-impact machine learning
technologies is balancing the need to model rich, structured domains with the
ability to scale to big data. Many important problem areas are both richly
structured and large scale, from social and biological networks, to knowledge
graphs and the Web, to images, video, and natural language. In this paper, we
introduce two new formalisms for modeling structured data, and show that they
can both capture rich structure and scale to big data. The first, hinge-loss
Markov random fields (HL-MRFs), is a new kind of probabilistic graphical model
that generalizes different approaches to convex inference. We unite three
approaches from the randomized algorithms, probabilistic graphical models, and
fuzzy logic communities, showing that all three lead to the same inference
objective. We then define HL-MRFs by generalizing this unified objective. The
second new formalism, probabilistic soft logic (PSL), is a probabilistic
programming language that makes HL-MRFs easy to define using a syntax based on
first-order logic. We introduce an algorithm for inferring most-probable
variable assignments (MAP inference) that is much more scalable than
general-purpose convex optimization methods, because it uses message passing to
take advantage of sparse dependency structures. We then show how to learn the
parameters of HL-MRFs. The learned HL-MRFs are as accurate as analogous
discrete models, but much more scalable. Together, these algorithms enable
HL-MRFs and PSL to model rich, structured data at scales not previously
possible.
","[{'version': 'v1', 'created': 'Sun, 17 May 2015 15:19:09 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Dec 2015 04:32:24 GMT'}, {'version': 'v3', 'created': 'Fri, 17 Nov 2017 00:10:03 GMT'}]",2017-11-20,"[['Bach', 'Stephen H.', ''], ['Broecheler', 'Matthias', ''], ['Huang', 'Bert', ''], ['Getoor', 'Lise', '']]","['Probabilistic graphical models', 'statistical relational learning', 'structuredprediction']"
18981,1610.03715,Yangbo Song,"Yangbo Song, Mofei Zhao",Dynamic R&D Competition under Uncertainty and Strategic Disclosure,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study a model of dynamic two-stage R&D competition where the competing
firms are uncertain about the difficulty of the first stage. Staying in the
competition is costly and a firm can also choose whether and when to quit. When
a firm solves the first stage, it can choose whether and when to disclose the
solution. We find that there exists a unique symmetric equilibrium, in which
each firm will disclose the solution of the first stage if it arrives early,
withhold the solution if it arrives neither too soon nor too late, and exit the
competition if it has not arrived after a sufficiently long time. From a social
welfare perspective, a competition is surprisingly not always optimal: in
certain scenarios, it is socially more desirable to assign the R&D project to a
single firm.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2016 13:57:51 GMT'}]",2016-10-13,"[['Song', 'Yangbo', ''], ['Zhao', 'Mofei', '']]","['R&D competition', 'Uncertainty', 'Social Welfare']"
18982,1003.0367,Shu-Tao Xia,"Yong Jiang, Shu-Tao Xia, and Fang-Wei Fu",Stopping Set Distributions of Some Linear Codes,"33 pages, submitted to IEEE Trans. Inform. Theory, Feb. 2010",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Stopping sets and stopping set distribution of an low-density parity-check
code are used to determine the performance of this code under iterative
decoding over a binary erasure channel (BEC). Let $C$ be a binary $[n,k]$
linear code with parity-check matrix $H$, where the rows of $H$ may be
dependent. A stopping set $S$ of $C$ with parity-check matrix $H$ is a subset
of column indices of $H$ such that the restriction of $H$ to $S$ does not
contain a row of weight one. The stopping set distribution $\{T_i(H)\}_{i=0}^n$
enumerates the number of stopping sets with size $i$ of $C$ with parity-check
matrix $H$. Note that stopping sets and stopping set distribution are related
to the parity-check matrix $H$ of $C$. Let $H^{*}$ be the parity-check matrix
of $C$ which is formed by all the non-zero codewords of its dual code
$C^{\perp}$. A parity-check matrix $H$ is called BEC-optimal if
$T_i(H)=T_i(H^*), i=0,1,..., n$ and $H$ has the smallest number of rows. On the
BEC, iterative decoder of $C$ with BEC-optimal parity-check matrix is an
optimal decoder with much lower decoding complexity than the exhaustive
decoder. In this paper, we study stopping sets, stopping set distributions and
BEC-optimal parity-check matrices of binary linear codes. Using finite geometry
in combinatorics, we obtain BEC-optimal parity-check matrices and then
determine the stopping set distributions for the Simplex codes, the Hamming
codes, the first order Reed-Muller codes and the extended Hamming codes.
","[{'version': 'v1', 'created': 'Mon, 1 Mar 2010 15:03:13 GMT'}]",2010-03-02,"[['Jiang', 'Yong', ''], ['Xia', 'Shu-Tao', ''], ['Fu', 'Fang-Wei', '']]","['Low-density parity-check (LDPC) codes', 'binary erasurechannel', 'iterative decoding', 'stopping sets', 'stopping set distribution', 'finitegeometry']"
18983,1402.5617,V Karthikeyan VKK,V.Karthikeyan V. J. Vijayalakshmi,"Control Loop Feedback Mechanism for Generic Array Logic Chip
  Multiprocessor",4 pages and 8 figures,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Control Loop Feedback Mechanism for Generic Array Logic Chip Multiprocessor
is presented. The approach is based on control-loop feedback mechanism to
maximize the efficiency on exploiting available resources such as CPU time,
operating frequency, etc. Each Processing Element (PE) in the architecture is
equipped with a frequency scaling module responsible for tuning the frequency
of processors at run-time according to the application requirements. We show
that generic array logic Chip Multiprocessors with large inter-processor First
In First Outputs (First In First Outs) buffers can inherently hide much of the
Generic Array Logic performance penalty while executing applications that have
been mapped with few communication loops. In fact, the penalty can be driven to
zero with sufficiently large First In First Outs and the removal of
multiple-loop communication links. We present an example mesh-connected Generic
Array Logic chip multiprocessor and show it has a less than 1% performance
(throughput) reduction on average compared to the corresponding synchronous
system for many DSP workloads. Furthermore, adaptive clock and voltage scaling
for each processor provides an approximately 40% power savings without any
performance reduction.
","[{'version': 'v1', 'created': 'Sun, 23 Feb 2014 15:17:09 GMT'}]",2014-02-25,"[['Vijayalakshmi', 'V. Karthikeyan V. J.', '']]","['First-Inputs First Outputs (FIFO)', 'Processing Element (PE)', 'Chip Multiprocessors (CMPs)', 'Multiple-Loop Communication Links (MLCL)   1']"
18984,1610.04309,Maicon Alves,Maicon Melo Alves and L\'ucia Maria de Assump\c{c}\~ao Drummond,"A Quantitative Model for Predicting Cross-application Interference in
  Virtual Environments","14 pages, 6 figures, 6 tables",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cross-application interference can affect drastically performance of HPC
applications when running in clouds. This problem is caused by concurrent
access performed by co-located applications to shared and non-sliceable
resources such as cache and memory. In order to address this issue, some works
adopted a qualitative approach that does not take into account the amount of
access to shared resources. In addition, a few works, even considering the
amount of access, evaluated just the SLLC access contention as the root of this
problem. However, our experiments revealed that interference is intrinsically
related to the amount of simultaneous access to shared resources, besides
showing that another shared resources, apart from SLLC, can also influence the
interference suffered by co-located applications. In this paper, we present a
quantitative model for predicting cross-application interference in virtual
environments. Our proposed model takes into account the amount of simultaneous
access to SLLC, DRAM and virtual network, and the similarity of application's
access burden to predict the level of interference suffered by applications
when co-located in a same physical machine. Experiments considering a real
petroleum reservoir simulator and applications from HPCC benchmark showed that
our model reached an average and maximum prediction errors around 4\% and 12\%,
besides achieving an error less than 10\% in approximately 96\% of all tested
cases.
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2016 01:25:59 GMT'}]",2016-10-17,"[['Alves', 'Maicon Melo', ''], ['Drummond', 'Lúcia Maria de Assumpção', '']]","['cross-application interference', 'virtual machine placement', 'cloud computing', 'high performance computing']"
18985,1410.3122,Soumendu Chakraborty,"Soumendu Chakraborty, Anand Singh Jalal and Charul Bhatnagar","Secret Image Sharing Using Grayscale Payload Decomposition and
  Irreversible Image Steganography",,J. of Info. Sec. and Appl. 18(4)(2013) 180-192,,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To provide an added security level most of the existing reversible as well as
irreversible image steganography schemes emphasize on encrypting the secret
image (payload) before embedding it to the cover image. The complexity of
encryption for a large payload where the embedding algorithm itself is complex
may adversely affect the steganographic system. Schemes that can induce same
level of distortion, as any standard encryption technique with lower
computational complexity, can improve the performance of stego systems. In this
paper we propose a secure secret image sharing scheme, which bears minimal
computational complexity. The proposed scheme, as a replacement for encryption,
diversifies the payload into different matrices which are embedded into carrier
image (cover image) using bit X-OR operation. A payload is a grayscale image
which is divided into frequency matrix, error matrix, and sign matrix. The
frequency matrix is scaled down using a mapping algorithm to produce Down
Scaled Frequency (DSF) matrix. The DSF matrix, error matrix, and sign matrix
are then embedded in different cover images using bit X-OR operation between
the bit planes of the matrices and respective cover images. Analysis of the
proposed scheme shows that it effectively camouflages the payload with minimum
computation time.
","[{'version': 'v1', 'created': 'Sun, 12 Oct 2014 17:35:37 GMT'}]",2014-10-14,"[['Chakraborty', 'Soumendu', ''], ['Jalal', 'Anand Singh', ''], ['Bhatnagar', 'Charul', '']]","['DSF matrix', 'error matrix', 'sign matrix', 'bit plane']"
18986,0903.2265,Rolf Harren,"Rolf Harren, Rob van Stee",An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing,,,,,cs.DS cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of packing rectangles into bins that are unit
squares, where the goal is to minimize the number of bins used. All rectangles
have to be packed non-overlapping and orthogonal, i.e., axis-parallel. We
present an algorithm for this problem with an absolute worst-case ratio of 2,
which is optimal provided P != NP.
","[{'version': 'v1', 'created': 'Fri, 13 Mar 2009 11:39:14 GMT'}]",2009-03-16,"[['Harren', 'Rolf', ''], ['van Stee', 'Rob', '']]","['bin packing', 'rectangle packing', 'approximation algorithm', 'absolute worst-case ratio']"
18987,1511.08414,Kimio Kuramitsu,"Tetsuro Matsumura, Kimio Kuramitsu","A declarative extension of parsing expression grammars for recognizing
  most programming languages","To appear in Journal of Information Processing, 24(2), 2016",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parsing Expression Grammars are a popular foundation for describing syntax.
Unfortunately, several syntax of programming languages are still hard to
recognize with pure PEGs. Notorious cases appears: typedef-defined names in
C/C++, indentation-based code layout in Python, and HERE document in many
scripting languages. To recognize such PEG-hard syntax, we have addressed a
declarative extension to PEGs. The ""declarative"" extension means no programmed
semantic actions, which are traditionally used to realize the extended parsing
behavior. Nez is our extended PEG language, including symbol tables and
conditional parsing. This paper demonstrates that the use of Nez Extensions can
realize many practical programming languages, such as C, C\#, Ruby, and Python,
which involve PEG-hard syntax.
","[{'version': 'v1', 'created': 'Thu, 26 Nov 2015 15:15:47 GMT'}]",2015-11-30,"[['Matsumura', 'Tetsuro', ''], ['Kuramitsu', 'Kimio', '']]","['Parsing expression grammars', 'semantic actions', 'context-sensitive syntax', 'case studies on programming languages']"
18988,1007.1233,Dimple Juneja Dr.,"Samir Kumar Bandyopadhyay, Indra Kanta Maitra",An Alternative Approach of Steganography using Reference Image,"http://ijict.org/index.php/ijoat/article/view/approach-of-stegnagraphy .
  arXiv admin note: text overlap with
  http://dx.doi.org/10.1016/j.sigpro.2009.08.010 by other authors without
  attribution","International Journal of Advancements in Technology, Vol 1, No 1
  (2010)",,,cs.MM,http://creativecommons.org/licenses/by/3.0/,"  This paper is to create a practical steganographic implementation for 4-bit
images.The proposed technique converts 4 bit image into 4 shaded Gray Scale
image. This image will be act as reference image to hide the text. Using this
grey scale reference image any text can be hidden. Single character of a text
can be represented by 8-bit. The 8-bit character can be split into 4X2 bit
information. If the reference image and the data file are transmitted through
network separately, we can achieve the effect of Steganography. Here the image
is not at all distorted because said image is only used for referencing. Any
huge mount of text material can be hidden using a very small image. Decipher
the text is not possible intercepting the image or data file separately. So, it
is more secure.
","[{'version': 'v1', 'created': 'Thu, 1 Jul 2010 09:40:40 GMT'}]",2014-08-17,"[['Bandyopadhyay', 'Samir Kumar', ''], ['Maitra', 'Indra Kanta', '']]","['Steganography', 'Bitmap Image', 'Reference Image', 'Bit Depth']"
18989,0904.0034,Luis Menasch\'e Schechter,Mario R. F. Benevides and L. Menasch\'e Schechter,CCS-Based Dynamic Logics for Communicating Concurrent Programs,28 pages,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work presents three increasingly expressive Dynamic Logics in which the
programs are CCS processes (sCCS-PDL, CCS-PDL and XCCS-PDL). Their goal is to
reason about properties of concurrent programs and systems described using CCS.
In order to accomplish that, CCS's operators and constructions are added to a
basic modal logic in order to create dynamic logics that are suitable for the
description and verification of properties of communicating, concurrent and
non-deterministic programs and systems, in a similar way as PDL is used for the
sequential case. We provide complete axiomatizations for the three logics.
Unlike Peleg's Concurrent PDL with Channels, our logics have a simple Kripke
semantics, complete axiomatizations and the finite model property.
","[{'version': 'v1', 'created': 'Wed, 1 Apr 2009 02:07:44 GMT'}]",2009-04-02,"[['Benevides', 'Mario R. F.', ''], ['Schechter', 'L. Menasché', '']]","['Dynamic Logic', 'Concurrency', 'Kripke Semantics', 'Axiomatization', 'Completeness']"
18990,1110.1502,A S N Chakravarthy ASN CHAKRAVARTHY,"Penmetsa V. Krishna Raja, A. S. N. Chakravarthy, P. S. Avadhani",Hilbert Matrix Based Cryptosystem using a Session Key,five pages,"International Journal of Engineering Research and Applications
  (IJERA) Vol. 1, Issue 3, 2011, pp.711-715",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cryptography protects users by providing functionality for the encryption of
data and authentication of other users. This technology lets the receiver of an
electronic message verify the sender, ensures that a message can be read only
by the intended person, and assures the recipient that a message has not be
altered in transit. Classical cryptanalysis involves an interesting combination
of analytical reasoning, application of mathematical tools and pattern finding.
The objectives of the proposed work are to propose a new cryptographic method
based on the special matrix called the Hilbert matrix for authentication and
confidentiality and to propose a model for confidentiality and authentication
using shared key cryptosystems with the concept of digital enveloping using a
session key. In the present work various algorithms are presented for
encryption and authentication based on Hilbert matrix using a session key.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2011 12:04:05 GMT'}]",2011-10-10,"[['Raja', 'Penmetsa V. Krishna', ''], ['Chakravarthy', 'A. S. N.', ''], ['Avadhani', 'P. S.', '']]","['Crypto System', 'Hilbert Matrix', 'Session Key', 'Encryption', 'Decryption']"
18991,1304.7001,Urmila Shrawankar Ms,"Deepika Bhatia, Urmila Shrawankar",Network Control Systems RTAI framework A Review,Pages: 4 Figures : 1,"International Journal of Computer Science and Information
  Technologies (IJCSIT),Vol. 2(5) , 2011, 2380-2383",,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the advancement in the automation industry, to perform complex remote
operations is required. Advancements in the networking technology has led to
the development of different architectures to implement control from a large
distance. In various control applications of the modern industry, the agents,
such as sensors, actuators, and controllers are basically geographically
distributed. For efficient working of a control application, all of the agents
have to exchange information through a communication media. At present, an
increasing number of distributed control systems are based on platforms made up
of conventional PCs running open-source real-time operating systems. Often,
these systems needed to have networked devices supporting synchronized
operations with respect to each node. A framework is studied that relies on
standard software and protocol as RTAI, EtherCAT, RTnet and IEEE 1588. RTAI and
its various protocols are studied in network control systems environment.
","[{'version': 'v1', 'created': 'Thu, 25 Apr 2013 11:10:38 GMT'}]",2013-04-29,"[['Bhatia', 'Deepika', ''], ['Shrawankar', 'Urmila', '']]","['Real time systems', 'RTAI', 'EtherCAT', 'Ethernet', 'RTOS']"
18992,1203.0631,Dmitry Chistikov,Dmitry V. Chistikov,Checking Tests for Read-Once Functions over Arbitrary Bases,"Accepted to the 7th International Computer Science Symposium in
  Russia (CSR 2012), revised version",,,,cs.DM cs.CC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Boolean function is called read-once over a basis B if it can be expressed
by a formula over B where no variable appears more than once. A checking test
for a read-once function f over B depending on all its variables is a set of
input vectors distinguishing f from all other read-once functions of the same
variables. We show that every read-once function f over B has a checking test
containing O(n^l) vectors, where n is the number of relevant variables of f and
l is the largest arity of functions in B. For some functions, this bound cannot
be improved by more than a constant factor. The employed technique involves
reconstructing f from its l-variable projections and provides a stronger form
of Kuznetsov's classic theorem on read-once representations.
","[{'version': 'v1', 'created': 'Sat, 3 Mar 2012 09:02:40 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Mar 2012 18:36:01 GMT'}, {'version': 'v3', 'created': 'Mon, 28 May 2012 18:16:35 GMT'}]",2012-05-29,"[['Chistikov', 'Dmitry V.', '']]","['read-once Boolean function', 'checking test', 'complexity', 'teaching dimension', 'equivalence query', 'membership query']"
18993,1209.6490,M\'arton Trencs\'eni,"Istv\'an Csabai, M\'arton Trencs\'eni, G\'eza Herczegh, L\'aszl\'o
  Dobos, P\'eter J\'ozsa, Norbert Purger, Tam\'as Budav\'ari, Alexander Szalay",Spatial Indexing of Large Multidimensional Databases,"12 pages, 16 figures; CIDR 2007",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Scientific endeavors such as large astronomical surveys generate databases on
the terabyte scale. These, usually multidimensional databases must be
visualized and mined in order to find interesting objects or to extract
meaningful and qualitatively new relationships. Many statistical algorithms
required for these tasks run reasonably fast when operating on small sets of
in-memory data, but take noticeable performance hits when operating on large
databases that do not fit into memory. We utilize new software technologies to
develop and evaluate fast multidimensional indexing schemes that inherently
follow the underlying, highly non-uniform distribution of the data: they are
layered uniform grid indices, hierarchical binary space partitioning, and
sampled flat Voronoi tessellation of the data. Our working database is the
5-dimensional magnitude space of the Sloan Digital Sky Survey with more than
270 million data points, where we show that these techniques can dramatically
speed up data mining operations such as finding similar objects by example,
classifying objects or comparing extensive simulation sets with observations.
We are also developing tools to interact with the multidimensional database and
visualize the data at multiple resolutions in an adaptive manner.
","[{'version': 'v1', 'created': 'Fri, 28 Sep 2012 11:47:00 GMT'}]",2012-10-01,"[['Csabai', 'István', ''], ['Trencséni', 'Márton', ''], ['Herczegh', 'Géza', ''], ['Dobos', 'László', ''], ['Józsa', 'Péter', ''], ['Purger', 'Norbert', ''], ['Budavári', 'Tamás', ''], ['Szalay', 'Alexander', '']]","['Multidimensional spatial databases', 'large databases', 'spatial indexing', 'data mining', 'visualization', 'kd-tree', 'Voronoi']"
18994,1108.4250,Ndaohialy Manda-Vy Ravonimanantsoa,"Ndaohialy Manda-Vy Ravonimanantsoa (LISTA), Paul Auguste Rpa
  Randriamitantsoa (LISTA)",Comparison Of The Consumption Of Resources Between HTTP And SIP,4pages,Advanced Engineering Forum 1 (2011) 330,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Currently, the development of research around VoIP experience a tremendous
growth. In the community of open source Asterisk represents a reliable
alternative for a lower cost solution. In this same community as the SIP
protocol is a supplement to the more asterisk PBX. to share the benefits
claimed by proponents of free software co-existence with other Asterisk server
is not yet proven. In this context this paper we show a comparison of the use
of simplified resource material for the apache server using the HTTP protocol
and server that uses the asterisk SIP.
","[{'version': 'v1', 'created': 'Mon, 22 Aug 2011 08:11:35 GMT'}]",2011-08-25,"[['Ravonimanantsoa', 'Ndaohialy Manda-Vy', '', 'LISTA'], ['Randriamitantsoa', 'Paul Auguste Rpa', '', 'LISTA']]","['voip', 'sip', 'asterisk', 'http', 'apache']"
18995,1702.04415,Feng Mao,"Feng Mao, Edgar Blanco, Mingang Fu, Rohit Jain, Anurag Gupta,
  Sebastien Mancel, Rong Yuan, Stephen Guo, Sai Kumar, Yayang Tian","Small Boxes Big Data: A Deep Learning Approach to Optimize Variable
  Sized Bin Packing","The Third IEEE International Conference on Big Data Computing Service
  and Applications, 2017",,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bin Packing problems have been widely studied because of their broad
applications in different domains. Known as a set of NP-hard problems, they
have different vari- ations and many heuristics have been proposed for
obtaining approximate solutions. Specifically, for the 1D variable sized bin
packing problem, the two key sets of optimization heuristics are the bin
assignment and the bin allocation. Usually the performance of a single static
optimization heuristic can not beat that of a dynamic one which is tailored for
each bin packing instance. Building such an adaptive system requires modeling
the relationship between bin features and packing perform profiles. The primary
drawbacks of traditional AI machine learnings for this task are the natural
limitations of feature engineering, such as the curse of dimensionality and
feature selection quality. We introduce a deep learning approach to overcome
the drawbacks by applying a large training data set, auto feature selection and
fast, accurate labeling. We show in this paper how to build such a system by
both theoretical formulation and engineering practices. Our prediction system
achieves up to 89% training accuracy and 72% validation accuracy to select the
best heuristic that can generate a better quality bin packing solution.
","[{'version': 'v1', 'created': 'Tue, 14 Feb 2017 22:59:32 GMT'}]",2017-02-16,"[['Mao', 'Feng', ''], ['Blanco', 'Edgar', ''], ['Fu', 'Mingang', ''], ['Jain', 'Rohit', ''], ['Gupta', 'Anurag', ''], ['Mancel', 'Sebastien', ''], ['Yuan', 'Rong', ''], ['Guo', 'Stephen', ''], ['Kumar', 'Sai', ''], ['Tian', 'Yayang', '']]","['1D bin packing', 'deep learning', 'big data andoptimization']"
18996,1511.05514,Corinna Gottschalk,Corinna Gottschalk and Jens Vygen,Better $s$-$t$-Tours by Gao Trees,,,,,cs.DM cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the $s$-$t$-path TSP: given a finite metric space with two
elements $s$ and $t$, we look for a path from $s$ to $t$ that contains all the
elements and has minimum total distance. We improve the approximation ratio for
this problem from 1.599 to 1.566. Like previous algorithms, we solve the
natural LP relaxation and represent an optimum solution $x^*$ as a convex
combination of spanning trees. Gao showed that there exists a spanning tree in
the support of $x^*$ that has only one edge in each narrow cut (i.e., each cut
$C$ with $x^*(C)<2$). Our main theorem says that the spanning trees in the
convex combination can be chosen such that many of them are such ""Gao trees''.
","[{'version': 'v1', 'created': 'Tue, 17 Nov 2015 19:19:37 GMT'}]",2015-11-18,"[['Gottschalk', 'Corinna', ''], ['Vygen', 'Jens', '']]","['traveling salesman problem', 's-t-path TSP', 'approximation algorithm', 'spanningtree']"
18997,1607.02020,Merim Dzaferagic,"Merim Dzaferagic, Nicholas Kaminski, Neal McBride, Irene Macaluso,
  Nicola Marchetti","A Functional Complexity Framework for the Analysis of Telecommunication
  Networks",,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The rapid evolution of network services demands new paradigms for studying
and designing networks. In order to understand the underlying mechanisms that
provide network functions, we propose a framework which enables the functional
analysis of telecommunication networks. This framework allows us to isolate and
analyse a network function as a complex system. We propose functional
topologies to visualise the relationships between system entities and enable
the systematic study of interactions between them. We also define a complexity
metric $C_F$ (functional complexity) which quantifies the variety of structural
patterns and roles of nodes in the topology. This complexity metric provides a
wholly new approach to study the operation of telecommunication networks. We
study the relationship between $C_F$ and different graph structures by
analysing graph theory metrics in order to recognize complex organisations.
$C_F$ is equal to zero for both a full mesh topology and a disconnected
topology. We show that complexity is very high for a dense structure that shows
high integration (shorter average path length and high average clustering
coefficient). We make a connection between functional complexity, robustness
and response to changes that may appear in the system configuration. We also
make a connection between the implementation and the outcome of a network
function which correlates the characteristics of the outcome with the complex
relationships that underpin the functional structure.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2016 12:00:42 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Oct 2017 10:45:13 GMT'}]",2017-10-09,"[['Dzaferagic', 'Merim', ''], ['Kaminski', 'Nicholas', ''], ['McBride', 'Neal', ''], ['Macaluso', 'Irene', ''], ['Marchetti', 'Nicola', '']]","['Complex system science', 'functional complexity framework', 'telecommunication networks', 'structural complexity', 'frequency allocation']"
18998,2006.04520,Liang Zhao,"Yifei Zhao, Yu-Hang Zhou, Mingdong Ou, Huan Xu, Nan Li","Maximizing Cumulative User Engagement in Sequential Recommendation: An
  Online Optimization Perspective",,,,,cs.IR cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To maximize cumulative user engagement (e.g. cumulative clicks) in sequential
recommendation, it is often needed to tradeoff two potentially conflicting
objectives, that is, pursuing higher immediate user engagement (e.g.,
click-through rate) and encouraging user browsing (i.e., more items exposured).
Existing works often study these two tasks separately, thus tend to result in
sub-optimal results. In this paper, we study this problem from an online
optimization perspective, and propose a flexible and practical framework to
explicitly tradeoff longer user browsing length and high immediate user
engagement. Specifically, by considering items as actions, user's requests as
states and user leaving as an absorbing state, we formulate each user's
behavior as a personalized Markov decision process (MDP), and the problem of
maximizing cumulative user engagement is reduced to a stochastic shortest path
(SSP) problem. Meanwhile, with immediate user engagement and quit probability
estimation, it is shown that the SSP problem can be efficiently solved via
dynamic programming. Experiments on real-world datasets demonstrate the
effectiveness of the proposed approach. Moreover, this approach is deployed at
a large E-commerce platform, achieved over 7% improvement of cumulative clicks.
","[{'version': 'v1', 'created': 'Tue, 2 Jun 2020 09:02:51 GMT'}]",2020-06-09,"[['Zhao', 'Yifei', ''], ['Zhou', 'Yu-Hang', ''], ['Ou', 'Mingdong', ''], ['Xu', 'Huan', ''], ['Li', 'Nan', '']]","['Sequential Recommendation', 'Cumulative User Engagement', 'Stochastic Shortest Path', 'Markov Decision Process']"
18999,1701.04185,Rohit M Thanki,"Rohit M. Thanki, Ved Vyas Dwivedi and Komal R. Borisagar","A Watermarking Technique Using Discrete Curvelet Transform for Security
  of Multiple Biometric Features",,"International Journal of Information Processing,volume 10, issue
  1, pp. 103 - 114 (2016)",,,cs.MM cs.CR cs.CV,http://creativecommons.org/licenses/by/4.0/,"  The robustness and security of the biometric watermarking approach can be
improved by using a multiple watermarking. This multiple watermarking proposed
for improving security of biometric features and data. When the imposter tries
to create the spoofed biometric feature, the invisible biometric watermark
features can provide appropriate protection to multimedia data. In this paper,
a biometric watermarking technique with multiple biometric watermarks are
proposed in which biometric features of fingerprint, face, iris and signature
is embedded in the image. Before embedding, fingerprint, iris, face and
signature features are extracted using Shen-Castan edge detection and Principal
Component Analysis. These all biometric watermark features are embedded into
various mid band frequency curvelet coefficients of host image. All four
fingerprint features, iris features, facial features and signature features are
the biometric characteristics of the individual and they are used for cross
verification and copyright protection if any manipulation occurs. The proposed
technique is fragile enough; features cannot be extracted from the watermarked
image when an imposter tries to remove watermark features illegally. It can use
for multiple copyright authentication and verification.
","[{'version': 'v1', 'created': 'Mon, 16 Jan 2017 06:41:21 GMT'}]",2017-01-17,"[['Thanki', 'Rohit M.', ''], ['Dwivedi', 'Ved Vyas', ''], ['Borisagar', 'Komal R.', '']]","['Biometric Features', 'Discrete Curvelet Transform', 'Multiple']"
19000,1209.4778,Rehena Sulthana,"M. Rehenasulthana, P. T. V. Bhuvaneswari, N. Rama",Enhanced Location Based Routing Protocol for 6LoWPAN,,"International Journal of Computer Networks & Communications
  (IJCNC) Vol.4, No.3, 2012, 93-108",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  6LoWPAN (IPv6 over IEEE 802.15.4) standardized by IEEE 802.15.4 provides IP
communication capability for nodes in WSN. An adaptation layer is introduced
above the MAC layer to achieve header compression, fragmentation and reassembly
of IP packets. The location-based information is used to simplify the routing
policy. This paper proposes an efficient location-based routing protocol,
considering link quality and distance between nodes as the routing metric. The
proposed Enhanced Location-based routing protocol (ELBRP) was simulated in NS2
version 2.32 and performance were analysed in terms of packet delivery ratio,
throughput and average end-to-end delay. From the results obtained, it is found
that the proposed ELBRP outperforms existing LOAD protocol.
","[{'version': 'v1', 'created': 'Fri, 21 Sep 2012 10:41:51 GMT'}]",2012-09-24,"[['Rehenasulthana', 'M.', ''], ['Bhuvaneswari', 'P. T. V.', ''], ['Rama', 'N.', '']]","['6LoWPAN', 'Routing', 'Location', 'LQI', 'distance']"
19001,1506.04220,Drona Pratap Chandu,Drona Pratap Chandu,Improved Greedy Algorithm for Set Covering Problem,4 pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a greedy algorithm named as Big step greedy set cover
algorithm to compute approximate minimum set cover. The Big step greedy
algorithm, in each step selects p sets such that the union of selected p sets
contains greatest number of uncovered elements and adds the selected p sets to
partial set cover. The process of adding p sets is repeated until all the
elements are covered. When p=1 it behaves like the classical greedy algorithm.
","[{'version': 'v1', 'created': 'Sat, 13 Jun 2015 03:59:24 GMT'}]",2015-06-16,"[['Chandu', 'Drona Pratap', '']]","['Set cover', 'greedy', 'big step', 'algorithm', 'approximation', 'experimental algorithm']"
19002,1409.7307,YuGei Gan,"Yufei Gan, Tong Zhuo, Chu He","Image Classification with A Deep Network Model based on Compressive
  Sensing",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To simplify the parameter of the deep learning network, a cascaded
compressive sensing model ""CSNet"" is implemented for image classification.
Firstly, we use cascaded compressive sensing network to learn feature from the
data. Secondly, CSNet generates the feature by binary hashing and block-wise
histograms. Finally, a linear SVM classifier is used to classify these
features. The experiments on the MNIST dataset indicate that higher
classification accuracy can be obtained by this algorithm.
","[{'version': 'v1', 'created': 'Thu, 25 Sep 2014 15:52:05 GMT'}]",2014-09-26,"[['Gan', 'Yufei', ''], ['Zhuo', 'Tong', ''], ['He', 'Chu', '']]","['Deep Learning', 'Compressive Sensing', 'HandwrittenDigit Recognition']"
19003,1304.4661,Takuya Akiba,"Takuya Akiba, Yoichi Iwata, and Yuichi Yoshida","Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned
  Landmark Labeling",To appear in SIGMOD 2013,,,,cs.DS cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new exact method for shortest-path distance queries on
large-scale networks. Our method precomputes distance labels for vertices by
performing a breadth-first search from every vertex. Seemingly too obvious and
too inefficient at first glance, the key ingredient introduced here is pruning
during breadth-first searches. While we can still answer the correct distance
for any pair of vertices from the labels, it surprisingly reduces the search
space and sizes of labels. Moreover, we show that we can perform 32 or 64
breadth-first searches simultaneously exploiting bitwise operations. We
experimentally demonstrate that the combination of these two techniques is
efficient and robust on various kinds of large-scale real-world networks. In
particular, our method can handle social networks and web graphs with hundreds
of millions of edges, which are two orders of magnitude larger than the limits
of previous exact methods, with comparable query time to those of previous
methods.
","[{'version': 'v1', 'created': 'Wed, 17 Apr 2013 01:11:12 GMT'}]",2013-04-18,"[['Akiba', 'Takuya', ''], ['Iwata', 'Yoichi', ''], ['Yoshida', 'Yuichi', '']]","['Graphs', 'shortest paths', 'query processing']"
19004,1605.02626,Maxence Reberol,"Maxence Reberol (ALICE), Bruno L\'evy (ALICE)","Low-order continuous finite element spaces on hybrid non-conforming
  hexahedral-tetrahedral meshes",,,,,cs.CG cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article deals with solving partial differential equations with the
finite element method on hybrid non-conforming hexahedral-tetrahedral meshes.
By non-conforming, we mean that a quadrangular face of a hexahedron can be
connected to two triangular faces of tetrahedra. We introduce a set of
low-order continuous (C0) finite element spaces defined on these meshes. They
are built from standard tri-linear and quadratic Lagrange finite elements with
an extra set of constraints at non-conforming hexahedra-tetrahedra junctions to
recover continuity. We consider both the continuity of the geometry and the
continuity of the function basis as follows: the continuity of the geometry is
achieved by using quadratic mappings for tetrahedra connected to tri-affine
hexahedra and the continuity of interpolating functions is enforced in a
similar manner by using quadratic Lagrange basis on tetrahedra with constraints
at non-conforming junctions to match tri-linear hexahedra. The so-defined
function spaces are validated numerically on simple Poisson and linear
elasticity problems for which an analytical solution is known. We observe that
using a hybrid mesh with the proposed function spaces results in an accuracy
significantly better than when using linear tetrahedra and slightly worse than
when solely using tri-linear hexahedra. As a consequence, the proposed function
spaces may be a promising alternative for complex geometries that are out of
reach of existing full hexahedral meshing methods.
","[{'version': 'v1', 'created': 'Mon, 9 May 2016 15:42:30 GMT'}]",2016-05-10,"[['Reberol', 'Maxence', '', 'ALICE'], ['Lévy', 'Bruno', '', 'ALICE']]","['finite element method', 'hex-dominant mesh', 'hybrid mesh', 'continuous function space', 'hexahedral-tetrahedral mesh']"
19005,1602.07399,Zhenhao Ge,"Qian Huang, Yuanzhi Zhang, Zhenhao Ge, Chao Lu","Refining Wi-Fi Based Indoor Localization with Li-Fi Assisted Model
  Calibration in Smart Buildings","International Conference on Computing in Civil and Building
  Engineering (ICCCBE) 2016",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, there has been an increasing number of information
technologies utilized in buildings to advance the idea of ""smart buildings"".
Among various potential techniques, the use of Wi-Fi based indoor positioning
allows to locate and track smartphone users inside a building, therefore,
location-aware intelligent solutions can be applied to control and of building
operations. These location-aware indoor services (e.g., path finding, internet
of things, location based advertising) demand real-time accurate indoor
localization, which is a key issue to guarantee high quality of service in
smart buildings. This paper presents a new Wi-Fi based indoor localization
technique that achieves significantly improvement of indoor positioning
accuracy with the help of Li-Fi assisted coefficient calibration. The proposed
technique leverages indoor existing Li-Fi lighting and Wi-Fi infrastructure,
and results in a cost-effective and user-convenient indoor accurate
localization framework. In this work, experimental study and measurements are
conducted to verify the performance of the proposed idea. The results
substantiate the concept of refining Wi-Fi based indoor localization with Li-Fi
assisted computation calibration.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2016 04:55:35 GMT'}]",2016-02-25,"[['Huang', 'Qian', ''], ['Zhang', 'Yuanzhi', ''], ['Ge', 'Zhenhao', ''], ['Lu', 'Chao', '']]","['Li-Fi', 'Wi-Fi', 'indoor positioning or localization', 'smart buildings   1']"
19006,1005.4774,Shrisha Rao,Sumanth Sudeendra and Megha Saini and Shrisha Rao,Fairness in Combinatorial Auctions,22 pages; extended version of arXiv:0809.2168,,,,cs.GT cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The market economy deals with many interacting agents such as buyers and
sellers who are autonomous intelligent agents pursuing their own interests. One
such multi-agent system (MAS) that plays an important role in auctions is the
combinatorial auctioning system (CAS). We use this framework to define our
concept of fairness in terms of what we call as ""basic fairness"" and ""extended
fairness"". The assumptions of quasilinear preferences and dominant strategies
are taken into consideration while explaining fairness. We give an algorithm to
ensure fairness in a CAS using a Generalized Vickrey Auction (GVA). We use an
algorithm of Sandholm to achieve optimality. Basic and extended fairness are
then analyzed according to the dominant strategy solution concept.
","[{'version': 'v1', 'created': 'Wed, 26 May 2010 10:02:28 GMT'}]",2010-05-30,"[['Sudeendra', 'Sumanth', ''], ['Saini', 'Megha', ''], ['Rao', 'Shrisha', '']]","['fairness', 'optimality', 'multi-agent systems', 'combinatorial auctions', 'mechanism design']"
19007,1409.5491,Rolando Flores-Carapia,"V. M. Silva-Garc\'ia, R. Flores-Carapia, C. Renter\'ia-M\'aarquez, B.
  Luna-Benoso, C. A. Jim\'enez V\'azquez",Images encryption using AES and variable permutations,13 pages,,,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This work proposes a different procedure to encrypt images of 256 grey levels
and colour, using the symmetric system Advanced Encryption Standard with a
variable permutation in the first round, after the x-or operation. Variable
permutation means using a different one for each input block of 128 bits. In
this vein, an algorithm is constructed that defines a Bijective function
between sets Nm = {n in N, 0 <= n < fac(m)} with n >= 2 and Pm = {pi, pi is a
permutation of 0, 1, ..., m-1}. This algorithm calculates permutations on 128
positions with 127 known constants. The transcendental numbers are used to
select the 127 constants in a pseudo-random way. The proposed encryption
quality is evaluated by the following criteria: Correlation; horizontal,
vertical and diagonal, Entropy and Discrete Fourier Transform. The latter uses
the NIST standard 800-22. Also, a sensitivity analysis was performed in
encrypted figures. Furthermore, an additional test is proposed which considers
the distribution of 256 shades of the three colours; red, green and blue for
colour images. On the other hand, it is important to mention that the images
are encrypted without loss of information because many banking companies and
some safety area countries do not allow the figures to go through a compression
process with information loss. i.e., it is forbidden to use formats such as
JPEG.
","[{'version': 'v1', 'created': 'Thu, 18 Sep 2014 23:54:50 GMT'}]",2014-09-22,"[['Silva-García', 'V. M.', ''], ['Flores-Carapia', 'R.', ''], ['Rentería-Máarquez', 'C.', ''], ['Luna-Benoso', 'B.', ''], ['Vázquez', 'C. A. Jiménez', '']]","['AES', 'Entropy', 'Bijective', 'Encryption Images', 'Permutations', 'Transcendent Numbers', 'Chi-Square', 'Correlation']"
19008,1705.06319,Kanthi Sarpatwar,"Kanthi K. Sarpatwar, Baruch Schieber and Hadas Shachnai",Constrained Submodular Maximization via Greedy Local Search,"Title changed from ""Interleaved Algorithms for Constrained Submodular
  Function Maximization""",,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a simple combinatorial $\frac{1 -e^{-2}}{2}$-approximation
algorithm for maximizing a monotone submodular function subject to a knapsack
and a matroid constraint.
  This classic problem is known to be hard to approximate within factor better
than $1 - 1/e$. We show that the algorithm can be extended to yield a ratio of
$\frac{1 - e^{-(k+1)}}{k+1}$ for the problem with a single knapsack and the
intersection of $k$ matroid constraints, for any fixed $k > 1$.
  Our algorithms, which combine the greedy algorithm of [Khuller, Moss and
Naor, 1999] and [Sviridenko, 2004] with local search, show the power of this
natural framework in submodular maximization with combined constraints.
","[{'version': 'v1', 'created': 'Wed, 17 May 2017 19:21:03 GMT'}, {'version': 'v2', 'created': 'Sun, 27 Aug 2017 01:09:21 GMT'}, {'version': 'v3', 'created': 'Mon, 15 Jan 2018 01:37:51 GMT'}]",2018-01-16,"[['Sarpatwar', 'Kanthi K.', ''], ['Schieber', 'Baruch', ''], ['Shachnai', 'Hadas', '']]","['Submodular Maximization', 'Knapsack and Matroid Constraints', 'GreedyAlgorithms', 'Local Search', 'Approximation Algorithms']"
19009,1702.06803,Jos\'e Su\'arez-Varela,"Jos\'e Su\'arez-Varela, Pere Barlet-Ros",Reinventing NetFlow for OpenFlow Software-Defined Networks,"20 pages, 12 figures, 1 table",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Obtaining flow-level measurements, similar to those provided by
Netflow/IPFIX, with OpenFlow is challenging as it requires the installation of
an entry per flow in the flow tables. This approach does not scale well with
the number of concurrent flows in the traffic as the number of entries in the
flow tables is limited and small. Flow monitoring rules may also interfere with
forwarding or other rules already present in the switches, which are often
defined at different granularities than the flow level. In this paper, we
present a transparent and scalable flow-based monitoring solution that is fully
compatible with current off-the-shelf OpenFlow switches. As in NetFlow/IPFIX,
we aggregate packets into flows directly in the switches and asynchronously
send traffic reports to an external collector. In order to reduce the overhead,
we implement three different traffic sampling methods depending on the OpenFlow
features available in the switch. We developed our complete flow monitoring
solution within OpenDaylight and evaluated its accuracy in a testbed with Open
vSwitch. Our experimental results using real-world traffic traces show that the
proposed sampling methods are accurate and can effectively reduce the resource
requirements of flow measurements in OpenFlow.
","[{'version': 'v1', 'created': 'Wed, 22 Feb 2017 14:04:05 GMT'}]",2017-02-23,"[['Suárez-Varela', 'José', ''], ['Barlet-Ros', 'Pere', '']]","['SDN Monitoring', 'flow sampling', 'OpenFlow']"
19010,1707.09816,Natalia Loukachevitch,Natalia Loukachevitch and Michael Nokel and Kirill Ivanov,Combining Thesaurus Knowledge and Probabilistic Topic Models,"Accepted to AIST-2017 conference (http://aistconf.ru/). The final
  publication will be available at link.springer.com",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present the approach of introducing thesaurus knowledge into
probabilistic topic models. The main idea of the approach is based on the
assumption that the frequencies of semantically related words and phrases,
which are met in the same texts, should be enhanced: this action leads to their
larger contribution into topics found in these texts. We have conducted
experiments with several thesauri and found that for improving topic models, it
is useful to utilize domain-specific knowledge. If a general thesaurus, such as
WordNet, is used, the thesaurus-based improvement of topic models can be
achieved with excluding hyponymy relations in combined topic models.
","[{'version': 'v1', 'created': 'Mon, 31 Jul 2017 12:32:16 GMT'}]",2017-08-01,"[['Loukachevitch', 'Natalia', ''], ['Nokel', 'Michael', ''], ['Ivanov', 'Kirill', '']]","['thesaurus', 'multiword expression', 'probabilistic topic models']"
19011,1602.07851,Sophie Lemaitre,"Sophie Lemaitre and Vladimir Salnikov and Daniel Choi and Philippe
  Karamian-Surville","Influence of morphological parameters in 3D composite materials on their
  effective thermal properties and comparison with effective mechanical
  properties","27 pages, 14 figures",,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we study the effective thermal behaviour of 3D representative
volume elements (RVEs) of two-phased composite materials constituted by a
matrix with cylindrical and spherical inclusions distributed randomly, with
periodic boundaries. Variations around the shape of inclusions have been taken
into account, by corrugating shapes, excavating and/or by removing pieces of
inclusions. The effective behaviour is computed with the help of homogenization
process based on an accelerated FFT-scheme giving the thermal conductivity
tensor. Several morphological parameters are also taken into account for
instance the number and the volume fraction of each type of inclusions,... in
order to analyse the behaviour of the composite for a large number of
geometries. We compare the results obtained for RVEs with and without
variations, and then with the mechanical results of such composite studied in
our previous paper.
","[{'version': 'v1', 'created': 'Thu, 25 Feb 2016 09:07:19 GMT'}]",2016-02-26,"[['Lemaitre', 'Sophie', ''], ['Salnikov', 'Vladimir', ''], ['Choi', 'Daniel', ''], ['Karamian-Surville', 'Philippe', '']]","['Composite material / Cylindrical', 'spherical reinforcements / Mechanical', 'thermal']"
19012,1309.7391,Chris Johnson,Chris Johnson,Madeup: A Mobile Development Environment for Programming 3-D Models,"2 pages, 3 figures, PROMOTO 2013, 1309.5500",,,PrMoTo/2013/05,cs.CY,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Constructionism is a learning theory that states that we learn more when we
construct tangible objects. In the process of building and presenting our work,
we make concrete the abstract mental models we've formed, see where they
breakdown through the feedback we receive, and revise the models accordingly.
Computer programming has long been taught under a constructionist approach
using sensory-rich contexts like robots, media, and Logo-style environments.
Now, with affordable 3-D printers in the hands of consumers, we have a new
medium in which learners may realize their computational ideas. In this
demonstration, we share a mobile development environment named Madeup, which
empowers its users to navigate 3-D space using a Logo-like imperative and
functional language. Every stop in space becomes a vertex in a 3-D model. The
generated models may be exported or uploaded to a 3-D printing service.
","[{'version': 'v1', 'created': 'Fri, 27 Sep 2013 23:50:57 GMT'}]",2013-10-01,"[['Johnson', 'Chris', '']]","['constructionism', '3-D modeling', 'learning IDEs']"
19013,1407.5456,Manju Kaushik,Manju Kaushik,Research of Load Testing and Result Based on Loadrunner,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we made the plan of a load testing, and got results by means
of the LoadRunner which is an automatic load testing tool.We combined with the
characteristics of electronic commerce system and did the load testing and
analysis the result of load test by means of the LoadRunner. We fully described
the characteristics of the electronic commerce application, designed the
reasonable test cases,and simulated the practical scenario. In the process of
running Load Runner, we arranged the appropriate transactions and rendezvous,
and designed the truthful test network environment. The plan was applied to the
load testing phase of the telecommunication equipment sales system of special
products. We analyzed the load testing results, proposed the improving
measures, and realized the optimization of the telecommunication equipment
sales system and also found the defect of the system when the massive users
access the system and guided the system improvement using the test result.
","[{'version': 'v1', 'created': 'Mon, 21 Jul 2014 11:09:21 GMT'}]",2014-07-22,"[['Kaushik', 'Manju', '']]","['load testing', 'automatic testing tool', 'transaction', 'test script', 'telecommunication']"
19014,1306.1490,Philippe Martin,Philippe A. Martin,Managing Knowledge to Enhance Learning,"17 pages, 4 figures, 2 tables, journal",KM&EL 2 (2009) 103-119,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The article first summarizes reasons why current approaches supporting Open
Learning and Distance Education need to be complemented by tools permitting
lecturers, researchers and students to cooperatively organize the semantic
content of Learning related materials (courses, discussions, etc.) into a
fine-grained shared semantic network. This first part of the article also
quickly describes the approach adopted to permit such a collaborative work.
Then, examples of such semantic networks are presented. Finally, an evaluation
of the approach by students is provided and analyzed.
","[{'version': 'v1', 'created': 'Thu, 30 May 2013 18:21:33 GMT'}]",2013-06-07,"[['Martin', 'Philippe A.', '']]","['Capacity management', 'capacity constraint', 'inventory level', 'service level', 'production management', 'bottleneck']"
19015,1704.08676,Daniele Ramazzotti,"Stefano Beretta and Mauro Castelli and Ivo Goncalves and Roberto
  Henriques and Daniele Ramazzotti","Learning the structure of Bayesian Networks: A quantitative assessment
  of the effect of different algorithmic schemes",,,,,cs.LG cs.AI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the most challenging tasks when adopting Bayesian Networks (BNs) is
the one of learning their structure from data. This task is complicated by the
huge search space of possible solutions, and by the fact that the problem is
NP-hard. Hence, full enumeration of all the possible solutions is not always
feasible and approximations are often required. However, to the best of our
knowledge, a quantitative analysis of the performance and characteristics of
the different heuristics to solve this problem has never been done before.
  For this reason, in this work, we provide a detailed comparison of many
different state-of-the-arts methods for structural learning on simulated data
considering both BNs with discrete and continuous variables, and with different
rates of noise in the data. In particular, we investigate the performance of
different widespread scores and algorithmic approaches proposed for the
inference and the statistical pitfalls within them.
","[{'version': 'v1', 'created': 'Thu, 27 Apr 2017 17:40:22 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Aug 2018 20:16:37 GMT'}]",2018-08-07,"[['Beretta', 'Stefano', ''], ['Castelli', 'Mauro', ''], ['Goncalves', 'Ivo', ''], ['Henriques', 'Roberto', ''], ['Ramazzotti', 'Daniele', '']]","['Bayesian Networks', 'Structure Learning', 'Heuristic Search', 'Evolutionary Computation', 'Genetic Algorithms']"
19016,1306.1366,Giovanna Rosone,"Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino",Sorting suffixes of a text via its Lyndon Factorization,Submitted to the Prague Stringology Conference 2013 (PSC 2013),,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The process of sorting the suffixes of a text plays a fundamental role in
Text Algorithms. They are used for instance in the constructions of the
Burrows-Wheeler transform and the suffix array, widely used in several fields
of Computer Science. For this reason, several recent researches have been
devoted to finding new strategies to obtain effective methods for such a
sorting. In this paper we introduce a new methodology in which an important
role is played by the Lyndon factorization, so that the local suffixes inside
factors detected by this factorization keep their mutual order when extended to
the suffixes of the whole word. This property suggests a versatile technique
that easily can be adapted to different implementative scenarios.
","[{'version': 'v1', 'created': 'Thu, 6 Jun 2013 10:27:22 GMT'}]",2013-06-07,"[['Mantaci', 'Sabrina', ''], ['Restivo', 'Antonio', ''], ['Rosone', 'Giovanna', ''], ['Sciortino', 'Marinella', '']]","['Sorting Suffixes', 'BWT', 'Suffix Array', 'Lyndon Words', 'Lyndon Factorization']"
19017,1312.3847,Qi Qi,"Qi Qi, Yufei Cao",Cloud Service-Aware Location Update in Mobile Cloud Computing,"11 pages, 11 figures, journal",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile devices are becoming the primary platforms for many users who always
roam around when accessing the cloud computing services. From this, the cloud
computing is integrated into the mobile environment by introducing a new
paradigm, mobile cloud computing. In the context of mobile computing, the
battery life of mobile device is limited, and it is important to balance the
mobility performance and energy consumption. Fortunately, cloud services
provide both opportunities and challenges for mobility management. Taking the
activities of cloud services accessing into consideration, we propose a
service-aware location update mechanism, which can detect the presence and
location of the mobile device without traditional periodic registration update.
Analytic model and simulation are developed to investigate the new mechanism.
The results demonstrate that the service-aware location update management can
reduce the location update times and handoff signaling, which can efficiently
save power consumption for mobile devices.
","[{'version': 'v1', 'created': 'Fri, 13 Dec 2013 15:53:34 GMT'}]",2013-12-16,"[['Qi', 'Qi', ''], ['Cao', 'Yufei', '']]","['mobile cloud computing', 'location update', 'power consumption', 'cloud service-aware']"
19018,1310.0607,Valery Ugrinovskii,Dabo Xu and Valery Ugrinovskii,"Decentralized Measurement Feedback Stabilization of Large-scale Systems
  via Control Vector Lyapunov Functions","Accepted for publication in the Systems and Control Letters. A
  preliminary version of this paper was presented at the 2011 Australian
  Control Conference",,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies the problem of decentralized measurement feedback
stabilization of nonlinear interconnected systems. As a natural extension of
the recent development on control vector Lyapunov functions, the notion of
output control vector Lyapunov function (OCVLF) is introduced for investigating
decentralized measurement feedback stabilization problems. Sufficient
conditions on (local) stabilizability are discussed which are based on the
proposed notion of OCVLF. It is shown that a decentralized controller for a
nonlinear interconnected system can be constructed using these conditions under
an additional vector dissipation-like condition. To illustrate the proposed
method, two examples are given.
","[{'version': 'v1', 'created': 'Wed, 2 Oct 2013 07:32:40 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Oct 2013 04:32:26 GMT'}]",2013-10-29,"[['Xu', 'Dabo', ''], ['Ugrinovskii', 'Valery', '']]","['Decentralized control', 'control Lyapunov function', 'vector dissipativity']"
19019,0805.4107,Nicolas Bonnel,"Nicolas Bonnel (VALORIA), Gilbas M\'enier (VALORIA),
  Pierre-Fran\c{c}ois Marteau (VALORIA)","Spiral Walk on Triangular Meshes : Adaptive Replication in Data P2P
  Networks",,,,,cs.NI cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a decentralized replication strategy for peer-to-peer file
exchange based on exhaustive exploration of the neighborhood of any node in the
network. The replication scheme lets the replicas evenly populate the network
mesh, while regulating the total number of replicas at the same time. This is
achieved by self adaptation to entering or leaving of nodes. Exhaustive
exploration is achieved by a spiral walk algorithm that generates a number of
messages linearly proportional to the number of visited nodes. It requires a
dedicated topology (a triangular mesh on a closed surface). We introduce
protocols for node connection and departure that maintain the triangular mesh
at low computational and bandwidth cost. Search efficiency is increased using a
mechanism based on dynamically allocated super peers. We conclude with a
discussion on experimental validation results.
","[{'version': 'v1', 'created': 'Tue, 27 May 2008 12:49:55 GMT'}]",2008-12-18,"[['Bonnel', 'Nicolas', '', 'VALORIA'], ['Ménier', 'Gilbas', '', 'VALORIA'], ['Marteau', 'Pierre-François', '', 'VALORIA']]","['peer-to-peer', 'replication', 'organization']"
19020,0706.0903,Georgy Karev,"Faina Berezovskaya, Artem Novozhilov, Georgy Karev","Families of traveling impulses and fronts in some models with
  cross-diffusion","20 pages, 9 figures; submitted to Journal of Nonlinear Analysis: Real
  World Applications",,,,cs.NA,,"  An analysis of traveling wave solutions of partial differential equation
(PDE) systems with cross-diffusion is presented. The systems under study fall
in a general class of the classical Keller-Segel models to describe chemotaxis.
The analysis is conducted using the theory of the phase plane analysis of the
corresponding wave systems without a priory restrictions on the boundary
conditions of the initial PDE. Special attention is paid to families of
traveling wave solutions. Conditions for existence of front-impulse,
impulse-front, and front-front traveling wave solutions are formulated. In
particular, the simplest mathematical model is presented that has an
impulse-impulse solution; we also show that a non-isolated singular point in
the ordinary differential equation (ODE) wave system implies existence of
free-boundary fronts. The results can be used for construction and analysis of
different mathematical models describing systems with chemotaxis.
","[{'version': 'v1', 'created': 'Wed, 6 Jun 2007 20:19:20 GMT'}]",2007-06-08,"[['Berezovskaya', 'Faina', ''], ['Novozhilov', 'Artem', ''], ['Karev', 'Georgy', '']]","['Keller-Segel model', 'traveling wave solutions', 'cross-diffusion']"
19021,1704.03934,Soumen Kanrar,Soumen Kanrar,i Vector used in Speaker Identification by Dimension Compactness,"6 pages,7 figures",,,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The automatic speaker identification procedure is used to extract features
that help to identify the components of the acoustic signal by discarding all
the other stuff like background noise, emotion, hesitation, etc. The acoustic
signal is generated by a human that is filtered by the shape of the vocal
tract, including tongue, teeth, etc. The shape of the vocal tract determines
and produced, what signal comes out in real time. The analytically develops
shape of the vocal tract, which exhibits envelop for the short time power
spectrum. The ASR needs efficient way of extracting features from the acoustic
signal that is used effectively to makes the shape of the individual vocal
tract. To identify any acoustic signal in the large collection of acoustic
signal i.e. corpora, it needs dimension compactness of total variability space
by using the GMM mean super vector. This work presents the efficient way to
implement dimension compactness in total variability space and using cosine
distance scoring to predict a fast output score for small size utterance.
","[{'version': 'v1', 'created': 'Wed, 12 Apr 2017 21:12:34 GMT'}]",2017-04-14,"[['Kanrar', 'Soumen', '']]","['Dimension Compactness', 'Feature Vector', 'Spectral Analysis', 'Supervector', 'Cepstral coefficient', 'Cosine scoring']"
19022,1402.7198,Venugopal K r,"T Shiva Prakash, K B Raja, K R Venugopal, S S Iyengar, L M Patnaik","Two-Hop Routing with Traffic-Differentiation for QoS Guarantee in
  Wireless Sensor Networks",13 pages,"International Journal of Information Processing, 7(3), 100-112,
  2013",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a Traffic-Differentiated Two-Hop Routing protocol for
Quality of Service (QoS) in Wireless Sensor Networks (WSNs). It targets WSN
applications having different types of data traffic with several priorities.
The protocol achieves to increase Packet Reception Ratio (PRR) and reduce
end-to-end delay while considering multi-queue priority policy, two-hop
neighborhood information, link reliability and power efficiency. The protocol
is modular and utilizes effective methods for estimating the link metrics.
Numerical results show that the proposed protocol is a feasible solution to
addresses QoS service differenti- ation for traffic with different priorities.
","[{'version': 'v1', 'created': 'Fri, 28 Feb 2014 10:45:59 GMT'}]",2014-03-03,"[['Prakash', 'T Shiva', ''], ['Raja', 'K B', ''], ['Venugopal', 'K R', ''], ['Iyengar', 'S S', ''], ['Patnaik', 'L M', '']]","['Wireless Sensor Networks (WSNs)', 'quality-of-service (QoS)', 'two-hop neighbors', 'trafficdifferentiation', 'Packet Reception Ratio (PRR)', 'end-to-end delay']"
19023,1206.5430,Selma Arbaoui,"Selma Arbaoui (Prisme), N. Cislo, N. Smith-Guerin",Home Healthcare Process: Challenges and Open Issues,,"Conference on Operational Research Applied to Health Service,
  ORAHS'2007, saint etienne : France (2007)",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Home healthcare is part of the most critical research and development
healthcare areas. The objective is to decentralize healthcare, leading to a
shift from in-hospital care to more advanced home healthcare, while improving
efficiency, individualisation, equity and quality of healthcare delivery and
limiting financial resources. In this paper, we adopt a process approach to
tackle the home healthcare domain in order to highlight the importance of
organisational aspects in the success of an ICT-home healthcare project. Such
projects should be supported by an automated system, called in this paper, Home
Healthcare support system. We examine HH processes from two selected
perspectives (complexity and dynamics) to illustrate the requirements of a HH
support system. We advocate that satisfying these requirements is part of the
most important challenges in the home healthcare research domain and we propose
first track of solutions by attempting to benefit from past experiences in 3
process research communities.
","[{'version': 'v1', 'created': 'Sat, 23 Jun 2012 19:16:20 GMT'}]",2012-06-26,"[['Arbaoui', 'Selma', '', 'Prisme'], ['Cislo', 'N.', ''], ['Smith-Guerin', 'N.', '']]","['Home healthcare process', 'ICT-Home healthcare project', 'process modelling', 'process complexity', 'process dynamics']"
19024,1205.5662,Roberto Gonz\'alez,"Roberto Gonzalez, Ruben Cuevas, Reza Motamedi, Reza Rejaie and Angel
  Cuevas","Google+ or Google-?: Dissecting the Evolution of the New OSN in its
  First Year",WWW 2013,,,,cs.SI cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the era when Facebook and Twitter dominate the market for social media,
Google has introduced Google+ (G+) and reported a significant growth in its
size while others called it a ghost town. This begs the question that ""whether
G+ can really attract a significant number of connected and active users
despite the dominance of Facebook and Twitter?"".
  This paper tackles the above question by presenting a detailed
characterization of G+ based on large scale measurements. We identify the main
components of G+ structure, characterize the key features of their users and
their evolution over time. We then conduct detailed analysis on the evolution
of connectivity and activity among users in the largest connected component
(LCC) of G+ structure, and compare their characteristics with other major OSNs.
We show that despite the dramatic growth in the size of G+, the relative size
of LCC has been decreasing and its connectivity has become less clustered.
While the aggregate user activity has gradually increased, only a very small
fraction of users exhibit any type of activity. To our knowledge, our study
offers the most comprehensive characterization of G+ based on the largest
collected data sets.
","[{'version': 'v1', 'created': 'Fri, 25 May 2012 11:21:20 GMT'}, {'version': 'v2', 'created': 'Mon, 28 May 2012 09:28:38 GMT'}, {'version': 'v3', 'created': 'Tue, 26 Mar 2013 13:00:18 GMT'}]",2013-03-27,"[['Gonzalez', 'Roberto', ''], ['Cuevas', 'Ruben', ''], ['Motamedi', 'Reza', ''], ['Rejaie', 'Reza', ''], ['Cuevas', 'Angel', '']]","['OSNs', 'Google+', 'Measurements', 'Characterization', 'Evolution']"
19025,1402.5187,Nordin Zakaria,"Chan-Yet Lai, Nordin Zakaria",Towards an Intelligent Framework for Pressure-based 3D Curve Drawing,"This paper was rejected from GI 2014. Comment from the chief
  reviewer:All reviewers noted that the ideas behind this paper were promising,
  but felt that research was not quite sufficiently developed...Although all
  agreed that this idea is insightful and has the potential to lead to a
  valuable contribution,... the idea is not yet sufficiently developed to
  warrant publication",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pen pressure is an input channel typically available in tablet pen device. To
date, little attention has been paid to the use of pressure in the domain of
graphical interaction, its usage largely limited to drawing and painting
program, typically for varying brush characteristic such as stroke width,
opacity and color. In this paper, we explore the use of pressure in 3D curve
drawing. The act of controlling pressure using pen, pencil and brush in real
life appears effortless, but to mimic this natural ability to control pressure
using a pressure sensitive pen in the realm of electronic medium is difficult.
Previous pressure based interaction work have proposed various signal
processing techniques to improve the accuracy in pressure control, but a
one-for-all signal processing solution tend not to work for different curve
types. We propose instead a framework which applies signal processing
techniques tuned to individual curve type. A neural network classifier is used
as a curve classifier. Based on the classification, a custom combination of
signal processing techniques is then applied. Results obtained point to the
feasibility and advantage of the approach.
","[{'version': 'v1', 'created': 'Fri, 21 Feb 2014 02:09:32 GMT'}]",2014-02-24,"[['Lai', 'Chan-Yet', ''], ['Zakaria', 'Nordin', '']]","['3D curve drawing', 'pressure based interaction', 'sketch based interface']"
19026,1506.00001,Zhigang Lu,Zhigang Lu and Hong Shen,"A Security-assured Accuracy-maximised Privacy Preserving Collaborative
  Filtering Recommendation Algorithm",arXiv admin note: text overlap with arXiv:1505.07897,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The neighbourhood-based Collaborative Filtering is a widely used method in
recommender systems. However, the risks of revealing customers' privacy during
the process of filtering have attracted noticeable public concern recently.
Specifically, $k$NN attack discloses the target user's sensitive information by
creating $k$ fake nearest neighbours by non-sensitive information. Among the
current solutions against $k$NN attack, the probabilistic methods showed a
powerful privacy preserving effect. However, the existing probabilistic methods
neither guarantee enough prediction accuracy due to the global randomness, nor
provide assured security enforcement against $k$NN attack. To overcome the
problems of current probabilistic methods, we propose a novel approach,
Partitioned Probabilistic Neighbour Selection, to ensure a required security
guarantee while achieving the optimal prediction accuracy against $k$NN attack.
In this paper, we define the sum of $k$ neighbours' similarity as the accuracy
metric $\alpha$, the number of user partitions, across which we select the $k$
neighbours, as the security metric $\beta$. Differing from the present methods
that globally selected neighbours, our method selects neighbours from each
group with exponential differential privacy to decrease the magnitude of noise.
Theoretical and experimental analysis show that to achieve the same security
guarantee against $k$NN attack, our approach ensures the optimal prediction
accuracy.
","[{'version': 'v1', 'created': 'Fri, 29 May 2015 01:20:42 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Jun 2015 01:00:31 GMT'}]",2015-06-05,"[['Lu', 'Zhigang', ''], ['Shen', 'Hong', '']]","['Privacy Preserving', 'Differential Privacy', 'Neighbourhood-based Collaborative']"
19027,1307.3822,Bang Ye Wu,Bang Ye Wu,A simple approximation algorithm for the internal Steiner minimum tree,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For a metric graph $G=(V,E)$ and $R\subset V$, the internal Steiner minimum
tree problem asks for a minimum weight Steiner tree spanning $R$ such that
every vertex in $R$ is not a leaf. This note shows a simple polynomial-time
$2\rho$-approximation algorithm, in which $\rho$ is the approximation ratio for
the Steiner minimum tree problem. The result improves the previous best
approximation ratio $2\rho+1$ for the problem. The ratio is not currently best
but the algorithm is very simple.
","[{'version': 'v1', 'created': 'Mon, 15 Jul 2013 05:56:54 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Jul 2013 08:12:23 GMT'}]",2013-07-18,"[['Wu', 'Bang Ye', '']]","['approximation algorithm', 'NP-hard', 'Steiner minimum tree', 'graph']"
19028,1701.03874,Shengyao Chen,"Shengyao Chen, Feng Xi, Zhong Liu","A General Sequential Delay-Doppler Estimation Scheme for Sub-Nyquist
  Pulse-Doppler Radar","23 pages, 8 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sequential estimation of the delay and Doppler parameters for sub-Nyquist
radars by analog-to-information conversion (AIC) systems has received wide
attention recently. However, the estimation methods reported are AIC-dependent
and have poor performance for off-grid targets. This paper develops a general
estimation scheme in the sense that it is applicable to all AICs regardless
whether the targets are on or off the grids. The proposed scheme estimates the
delay and Doppler parameters sequentially, in which the delay estimation is
formulated into a beamspace direction-of- arrival problem and the Doppler
estimation is translated into a line spectrum estimation problem. Then the
well-known spatial and temporal spectrum estimation techniques are used to
provide efficient and high-resolution estimates of the delay and Doppler
parameters. In addition, sufficient conditions on the AIC to guarantee the
successful estimation of off-grid targets are provided, while the existing
conditions are mostly related to the on-grid targets. Theoretical analyses and
numerical experiments show the effectiveness and the correctness of the
proposed scheme.
","[{'version': 'v1', 'created': 'Sat, 14 Jan 2017 02:55:43 GMT'}]",2017-01-17,"[['Chen', 'Shengyao', ''], ['Xi', 'Feng', ''], ['Liu', 'Zhong', '']]","['Compressive sampling', 'Delay-Doppler Estimation', 'Off-grid']"
19029,1603.04788,Henning Meyerhenke,Roland Glantz and Henning Meyerhenke,"Many-to-many Correspondences between Partitions: Introducing a Cut-based
  Approach",Accepted by SIAM International Conference on Data Mining 2018,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $\mathcal{P}$ and $\mathcal{P}'$ be finite partitions of the set $V$.
Finding good correspondences between the parts of $\mathcal{P}$ and those of
$\mathcal{P}'$ is helpful in classification, pattern recognition, and network
analysis. Unlike common similarity measures for partitions that yield only a
single value, we provide specifics on how $\mathcal{P}$ and $\mathcal{P'}$
correspond to each other.
  To this end, we first define natural collections of best correspondences
under three constraints \cone, \ctwo, and \cthree. In case of \cone, the best
correspondences form a minimum cut basis of a certain bipartite graph, whereas
the other two lead to minimum cut bases of $\mathcal{P}$ \wrt $\mathcal{P}'$.
We also introduce a constraint, \cfour, which tightens \cthree; both are useful
for finding consensus partitions. We then develop branch-and-bound algorithms
for finding minimum $P_s$-$P_t$ cuts of $\mathcal{P}$ and thus $\vert
\mathcal{P} \vert -1$ best correspondences under \ctwo, \cthree, and \cfour,
respectively.
  In a case study, we use the correspondences to gain insight into a community
detection algorithm. The results suggest, among others, that only very minor
losses in the quality of the correspondences occur if the branch-and-bound
algorithm is restricted to its greedy core. Thus, even for graphs with more
than half a million nodes and hundreds of communities, we can find hundreds of
best or almost best correspondences in less than a minute.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2016 18:01:13 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Jan 2018 14:08:39 GMT'}]",2018-01-18,"[['Glantz', 'Roland', ''], ['Meyerhenke', 'Henning', '']]","['Many-to-many correspondences', 'similaritiesof partitions', 'minimum cut basis', '(graph) clustering']"
19030,1610.04572,Mansaf Alam Dr,Mansaf Alam and Kashish Ara Shakil,Big Data Analytics in Cloud environment using Hadoop,conference paper ICMPAS-2016,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Big Data management is a problem right now. The Big Data growth is very
high. It is very difficult to manage due to various characteristics. This
manuscript focuses on Big Data analytics in cloud environment using Hadoop. We
have classified the Big Data according to its characteristics like Volume,
Value, Variety and Velocity. We have made various nodes to process the data
based on their volume, velocity, value and variety. In this work we have
classify the input data and routed to various processing node. At the last
after processing from each node, we can combine the output of all nodes to get
the final result. We have used Hadoop to partition the data as well as process
it.
","[{'version': 'v1', 'created': 'Thu, 15 Sep 2016 15:12:10 GMT'}]",2016-10-17,"[['Alam', 'Mansaf', ''], ['Shakil', 'Kashish Ara', '']]","['Big Data', 'Cloud', 'Processing', 'Hadoop', 'Hbase']"
19031,1403.7426,Ilche Georgievski,Ilche Georgievski and Marco Aiello,An Overview of Hierarchical Task Network Planning,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hierarchies are the most common structure used to understand the world
better. In galaxies, for instance, multiple-star systems are organised in a
hierarchical system. Then, governmental and company organisations are
structured using a hierarchy, while the Internet, which is used on a daily
basis, has a space of domain names arranged hierarchically. Since Artificial
Intelligence (AI) planning portrays information about the world and reasons to
solve some of world's problems, Hierarchical Task Network (HTN) planning has
been introduced almost 40 years ago to represent and deal with hierarchies. Its
requirement for rich domain knowledge to characterise the world enables HTN
planning to be very useful, but also to perform well. However, the history of
almost 40 years obfuscates the current understanding of HTN planning in terms
of accomplishments, planning models, similarities and differences among
hierarchical planners, and its current and objective image. On top of these
issues, attention attracts the ability of hierarchical planning to truly cope
with the requirements of applications from the real world. We propose a
framework-based approach to remedy this situation. First, we provide a basis
for defining different formal models of hierarchical planning, and define two
models that comprise a large portion of HTN planners. Second, we provide a set
of concepts that helps to interpret HTN planners from the aspect of their
search space. Then, we analyse and compare the planners based on a variety of
properties organised in five segments, namely domain authoring, expressiveness,
competence, performance and applicability. Furthermore, we select Web service
composition as a real-world and current application, and classify and compare
the approaches that employ HTN planning to solve the problem of service
composition. Finally, we conclude with our findings and present directions for
future work.
","[{'version': 'v1', 'created': 'Fri, 28 Mar 2014 16:01:51 GMT'}]",2014-03-31,"[['Georgievski', 'Ilche', ''], ['Aiello', 'Marco', '']]","['AI planning', 'Hierarchical Task Networks', 'Web Service Composition']"
19032,1603.08155,Justin Johnson,"Justin Johnson, Alexandre Alahi, Li Fei-Fei",Perceptual Losses for Real-Time Style Transfer and Super-Resolution,,,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider image transformation problems, where an input image is
transformed into an output image. Recent methods for such problems typically
train feed-forward convolutional neural networks using a \emph{per-pixel} loss
between the output and ground-truth images. Parallel work has shown that
high-quality images can be generated by defining and optimizing
\emph{perceptual} loss functions based on high-level features extracted from
pretrained networks. We combine the benefits of both approaches, and propose
the use of perceptual loss functions for training feed-forward networks for
image transformation tasks. We show results on image style transfer, where a
feed-forward network is trained to solve the optimization problem proposed by
Gatys et al in real-time. Compared to the optimization-based method, our
network gives similar qualitative results but is three orders of magnitude
faster. We also experiment with single-image super-resolution, where replacing
a per-pixel loss with a perceptual loss gives visually pleasing results.
","[{'version': 'v1', 'created': 'Sun, 27 Mar 2016 01:04:27 GMT'}]",2016-03-29,"[['Johnson', 'Justin', ''], ['Alahi', 'Alexandre', ''], ['Fei-Fei', 'Li', '']]","['Style transfer', 'super-resolution', 'deep learning']"
19033,1204.5447,Dara Shayda,Dara O. Shayda,"Kolmogorov Complexity, Causality And Spin","Higher resolution images available, plus the Mathematica code that
  generated them",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel topological and computational method for 'motion' is described.
Motion is constrained by inequalities in terms of Kolmogorov Complexity.
Causality is obtained as the output of a high-pass filter, passing through only
high values of Kolmogorov Complexity. Motion under the electromagnetic field
described with immediate relationship with Subscript[G, 2] Holonomy group and
its corresponding dense free 2-subgroup. Similar to Causality, Spin emerges as
an immediate and inevitable consequence of high values of Kolmogorov
Complexity. Consequently, the physical laws are nothing but a low-pass filter
for small values of Kolmogorov Complexity.
","[{'version': 'v1', 'created': 'Tue, 24 Apr 2012 17:50:58 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Apr 2012 04:13:52 GMT'}]",2012-04-26,"[['Shayda', 'Dara O.', '']]","['Kolmogorov Complexity', 'G2 holonomy group and dense free 2-subgroup', 'Brownian motion', 'Causality', 'Spin', 'Octonions', 'Self-Similarity']"
19034,1110.3225,Anton Dries,Anton Dries and Siegfried Nijssen,Mining Patterns in Networks using Homomorphism,,,,,cs.DS cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years many algorithms have been developed for finding patterns in
graphs and networks. A disadvantage of these algorithms is that they use
subgraph isomorphism to determine the support of a graph pattern; subgraph
isomorphism is a well-known NP complete problem. In this paper, we propose an
alternative approach which mines tree patterns in networks by using subgraph
homomorphism. The advantage of homomorphism is that it can be computed in
polynomial time, which allows us to develop an algorithm that mines tree
patterns in arbitrary graphs in incremental polynomial time. Homomorphism
however entails two problems not found when using isomorphism: (1) two patterns
of different size can be equivalent; (2) patterns of unbounded size can be
frequent. In this paper we formalize these problems and study solutions that
easily fit within our algorithm.
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2011 14:47:18 GMT'}]",2015-03-19,"[['Dries', 'Anton', ''], ['Nijssen', 'Siegfried', '']]","['of papers', 'Directed edges indicate the authors', 'keywordsof a paper']"
19035,1402.6366,Mustafa Abdul Salam,"Osman Hegazy, Omar S. Soliman and Mustafa Abdul Salam",LSSVM-ABC Algorithm for Stock Price prediction,"12 pages. International Journal of Computer Trends and Technology
  (IJCTT)2014",,,,cs.CE cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, Artificial Bee Colony (ABC) algorithm which inspired from the
behavior of honey bees swarm is presented. ABC is a stochastic population-based
evolutionary algorithm for problem solving. ABC algorithm, which is considered
one of the most recently swarm intelligent techniques, is proposed to optimize
least square support vector machine (LSSVM) to predict the daily stock prices.
The proposed model is based on the study of stocks historical data, technical
indicators and optimizing LSSVM with ABC algorithm. ABC selects best free
parameters combination for LSSVM to avoid over-fitting and local minima
problems and improve prediction accuracy. LSSVM optimized by Particle swarm
optimization (PSO) algorithm, LSSVM, and ANN techniques are used for comparison
with proposed model. Proposed model tested with twenty datasets representing
different sectors in S&P 500 stock market. Results presented in this paper show
that the proposed model has fast convergence speed, and it also achieves better
accuracy than compared techniques in most cases.
","[{'version': 'v1', 'created': 'Tue, 25 Feb 2014 23:02:08 GMT'}]",2014-02-28,"[['Hegazy', 'Osman', ''], ['Soliman', 'Omar S.', ''], ['Salam', 'Mustafa Abdul', '']]","['Least square support vector machine', 'Artificial Bee Colony', 'technical indicators', 'stock price prediction']"
19036,1410.5473,Chang Liu,Chang Liu and Yi Xu,Feature Selection Based on Confidence Machine,10 pages,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In machine learning and pattern recognition, feature selection has been a hot
topic in the literature. Unsupervised feature selection is challenging due to
the loss of labels which would supply the related information.How to define an
appropriate metric is the key for feature selection. We propose a filter method
for unsupervised feature selection which is based on the Confidence Machine.
Confidence Machine offers an estimation of confidence on a feature'reliability.
In this paper, we provide the math model of Confidence Machine in the context
of feature selection, which maximizes the relevance and minimizes the
redundancy of the selected feature. We compare our method against classic
feature selection methods Laplacian Score, Pearson Correlation and Principal
Component Analysis on benchmark data sets. The experimental results demonstrate
the efficiency and effectiveness of our method.
","[{'version': 'v1', 'created': 'Mon, 20 Oct 2014 21:32:05 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Jan 2015 16:58:03 GMT'}]",2015-01-14,"[['Liu', 'Chang', ''], ['Xu', 'Yi', '']]","['Feature selection', 'Confidence machine', 'Unsupervised learning', 'Maximal dependency', 'machine learning']"
19037,1002.1151,Vishal Goyal,"Manju Sharma, Lalit Awasthi","Realistic Approach towards Quantitative Analysis and Simulation of
  EEHC-Based Routing for Wireless Sensor Networks","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 1, January 2010,
  http://ijcsi.org/articles/Realistic-Approach-towards-Quantitative-Analysis-and-Simulation-of-EEHC-Based-Routing-for-Wireless-Sensor-Networks.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 1, January 2010,
  http://ijcsi.org/articles/Realistic-Approach-towards-Quantitative-Analysis-and-Simulation-of-EEHC-Based-Routing-for-Wireless-Sensor-Networks.php",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the realistic approach towards the quantitative analysis
and simulation of Energy Efficient Hierarchical Cluster (EEHC)-based routing
for wireless sensor networks. Here the efforts have been done to combine
analytical hardware model with the modified EEHC-based routing model. The
dependence of various performance metrics like: optimum number of clusters,
Energy Consumption, and Energy consumed per round etc. based on analytical
hardware sensor model and EEHC model has been presented.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 08:46:03 GMT'}]",2010-02-08,"[['Sharma', 'Manju', ''], ['Awasthi', 'Lalit', '']]","['EEHC', 'LEACH', 'Wireless Sensor Networks', 'Energy Consumption']"
19038,1111.0583,Andrea Clementi,"Andrea Clementi, Riccardo Silvestri, and Luca Trevisan",Information Spreading in Dynamic Graphs,,,,,cs.DM cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a general approach to study the flooding time (a measure of how
fast information spreads) in dynamic graphs (graphs whose topology changes with
time according to a random process).
  We consider arbitrary converging Markovian dynamic graph process, that is,
processes in which the topology of the graph at time $t$ depends only on its
topology at time $t-1$ and which have a unique stationary distribution. The
most well studied models of dynamic graphs are all Markovian and converging.
  Under general conditions, we bound the flooding time in terms of the mixing
time of the dynamic graph process. We recover, as special cases of our result,
bounds on the flooding time for the \emph{random trip} model and the
\emph{random path} models; previous analysis techniques provided bounds only in
restricted settings for such models. Our result also provides the first bound
for the \emph{random waypoint} model (which is tight for certain ranges of
parameters) whose analysis had been an important open question.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2011 17:53:30 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Feb 2012 17:16:05 GMT'}]",2015-03-19,"[['Clementi', 'Andrea', ''], ['Silvestri', 'Riccardo', ''], ['Trevisan', 'Luca', '']]","['Dynamic Graphs', 'Flooding Protocols', 'Markov Chains', 'Mobility Models']"
19039,1606.03547,Gregg Martin,"Gregg Martin, Hritik Gupta, Stephen Wingreen and Annette Mills",An Analysis of Personal Information Privacy Concerns Using Q-Methodology,"ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
  Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/232,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Information privacy has gained increased attention in recent years. This
paper focuses on a particular aspect of privacy, i.e., personal information
privacy. In this paper a conceptual framework is developed based Westin's
theory of Personal Information Privacy (PIP). Concourse theory and
Q-methodology was used alongside the literature and the New Zealand Privacy Act
1993 to develop a Q-sort questionnaire. The resulting 29 statements were then
sorted by 12 students (majoring in IS Security). The results indicate that for
some, privacy priorities may be stable across contexts, and for others this
differs, suggesting that current views of privacy (e.g. Westin's theory) may
need revising for the modern digital age. The Q-sort methodology also
identified three types, each representing distinct collective perspectives on
personal information privacy. These types are discussed along with implications
and suggestions for future research.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 03:56:33 GMT'}]",2016-06-14,"[['Martin', 'Gregg', ''], ['Gupta', 'Hritik', ''], ['Wingreen', 'Stephen', ''], ['Mills', 'Annette', '']]","['Personal Information Privacy', 'Q-Sort', 'Westin’s Privacy Indexes']"
19040,1301.1757,Loet Leydesdorff,"Bal\'azs Lengyel, Tam\'as Sebesty\'en, and Loet Leydesdorff","Challenges for regional innovation policies in CEE countries: Spatial
  concentration and foreign control of US patenting",Science and Public Policy (forthcoming),,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using techniques of data collection and mapping as overlays to Google
Maps--on the basis of patent information available online at the U.S. Patent
and Trademark Office (USPTO)--we point at two major and interconnected
challenges that policy-makers face in Central and Eastern Europe (CEE) when
combating the lagging innovation performance. First, we address the spatial
concentration by using a distribution analysis at the city level. The results
suggest that patenting is concentrated in post-socialist territories more than
in western nations and regions. However, there is not a single outstanding hub
in CEE when one compares USPTO patents normalized for the respective population
sizes. Secondly, we argue that dominance of foreign control over USPTO patents
is mostly embodied in international co-operations at the individual level, and
only rarely spilled-over to MNE subsidiaries. In our opinion, catching-up of
CEE in terms of patenting is unlikely, unless innovation policy measures focus
on growing hubs and target both domestic inventors and international relations
of companies.
","[{'version': 'v1', 'created': 'Wed, 9 Jan 2013 06:32:40 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Jul 2013 07:15:09 GMT'}, {'version': 'v3', 'created': 'Fri, 2 Aug 2013 11:09:59 GMT'}]",2013-08-05,"[['Lengyel', 'Balázs', ''], ['Sebestyén', 'Tamás', ''], ['Leydesdorff', 'Loet', '']]","['patents', 'map', 'Central and Eastern Europe', 'Germany', 'post-socialism']"
19041,1802.07523,Dan McGinn,"D. McGinn, D McIlwraith and Y.Guo",Toward Open Data Blockchain Analytics: A Bitcoin Perspective,"17 pages, 9 Figures",,,,cs.CR cs.CY,http://creativecommons.org/licenses/by/4.0/,"  Bitcoin is the first implementation of what has become known as a 'public
permissionless' blockchain. Guaranteeing security and protocol conformity
through its elegant combination of cryptographic assurances and game theoretic
economic incentives, it permits censorship resistant public read-write access
to its append-only blockchain database without the need for any mediating
central authority. Not until its advent has such a trusted, transparent,
comprehensive and granular data set of digital economic behaviours been
available for public network analysis. In this article, by translating the
cumbersome binary data structure of the Bitcoin blockchain into a high fidelity
graph model, we demonstrate through various analyses the often overlooked
social and econometric benefits of employing such a novel open data
architecture. Specifically we show (a) how repeated patterns of transaction
behaviours can be revealed to link user activity across the blockchain; (b) how
newly mined bitcoin can be associated to demonstrate individual accumulations
of wealth; (c) through application of the naive quantity theory of money that
Bitcoin's disinflationary properties can be revealed and measured; and (d) how
the user community can develop coordinated defences against repeated denial of
service attacks on the network. All of the aforementioned being exemplary
benefits that would be lost with the closed data models of the 'private
permissioned' distributed ledger architectures that are dominating enterprise
level development due to existing blockchain issues of governance, scalability
and confidentiality.
","[{'version': 'v1', 'created': 'Wed, 21 Feb 2018 11:33:01 GMT'}]",2018-02-23,"[['McGinn', 'D.', ''], ['McIlwraith', 'D', ''], ['Guo', 'Y.', '']]","['Bitcoin', 'Blockchain', 'Open Data', 'Graph Database', 'Data Mining', 'Knowledge Discovery']"
19042,1106.2312,Rathipriya R,"R.Rathipriya, Dr. K.Thangavel and J.Bagyamani",Evolutionary Biclustering of Clickstream Data,,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Biclustering is a two way clustering approach involving simultaneous
clustering along two dimensions of the data matrix. Finding biclusters of web
objects (i.e. web users and web pages) is an emerging topic in the context of
web usage mining. It overcomes the problem associated with traditional
clustering methods by allowing automatic discovery of browsing pattern based on
a subset of attributes. A coherent bicluster of clickstream data is a local
browsing pattern such that users in bicluster exhibit correlated browsing
pattern through a subset of pages of a web site. This paper proposed a new
application of biclustering to web data using a combination of heuristics and
meta-heuristics such as K-means, Greedy Search Procedure and Genetic Algorithms
to identify the coherent browsing pattern. Experiment is conducted on the
benchmark clickstream msnbc dataset from UCI repository. Results demonstrate
the efficiency and beneficial outcome of the proposed method by correlating the
users and pages of a web site in high degree.This approach shows excellent
performance at finding high degree of overlapped coherent biclusters from web
data.
","[{'version': 'v1', 'created': 'Sun, 12 Jun 2011 14:34:16 GMT'}]",2011-06-14,"[['Rathipriya', 'R.', ''], ['Thangavel', 'Dr. K.', ''], ['Bagyamani', 'J.', '']]","['Biclustering', 'Clickstream data', 'Coherent Bicluster', 'Genetic Algorithm', 'Greedy Search Procedure', 'Web Mining']"
19043,1510.00295,Nicolas Bousquet,Nicolas Bousquet and Yang Cai and Adrian Vetta,"Welfare and Rationality Guarantees for the Simultaneous Multiple-Round
  Ascending Auction",,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The simultaneous multiple-round auction (SMRA) and the combinatorial clock
auction (CCA) are the two primary mechanisms used to sell bandwidth. Under
truthful bidding, the SMRA is known to output a Walrasian equilibrium that
maximizes social welfare provided the bidder valuation functions satisfy the
gross substitutes property. Recently, it was shown that the combinatorial clock
auction (CCA) provides good welfare guarantees for general classes of valuation
functions. This motivates the question of whether similar welfare guarantees
hold for the SMRA in the case of general valuation functions.
  We show the answer is no. But we prove that good welfare guarantees still
arise if the degree of complementarities in the bidder valuations are bounded.
In particular, if bidder valuations functions are $\alpha$-near-submodular
then, under truthful bidding, the SMRA has a welfare ratio (the worst case
ratio between the social welfare of the optimal allocation and the auction
allocation) of at most $(1+\alpha)$. The special case of submodular valuations,
namely $\alpha=1$, and produces individually rational solutions. However, for
$\alpha>1$, this is a bicriteria guarantee, to obtain good welfare under
truthful bidding requires relaxing individual rationality.
  Finally, we examine what strategies are required to ensure individual
rationality in the SMRA with general valuation functions. First, we provide a
weak characterization, namely \emph{secure bidding}, for individual
rationality. We then show that if the bidders use a profit-maximizing secure
bidding strategy the welfare ratio is at most $1+\alpha$. Consequently, by
bidding securely, it is possible to obtain the same welfare guarantees as
truthful bidding without the loss of individual rationality.
","[{'version': 'v1', 'created': 'Thu, 1 Oct 2015 16:09:39 GMT'}]",2015-10-02,"[['Bousquet', 'Nicolas', ''], ['Cai', 'Yang', ''], ['Vetta', 'Adrian', '']]","['ascending auctions', 'SMRA', 'welfare guarantee', 'individual rationality', 'near-submodular']"
19044,1710.05091,Gourab Mitra,"Gourab Mitra, Shashidhar Sundareisan and Bikash Kanti Sarkar",A simple data discretizer,,,,,cs.LG cs.DB stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data discretization is an important step in the process of machine learning,
since it is easier for classifiers to deal with discrete attributes rather than
continuous attributes. Over the years, several methods of performing
discretization such as Boolean Reasoning, Equal Frequency Binning, Entropy have
been proposed, explored, and implemented. In this article, a simple supervised
discretization approach is introduced. The prime goal of MIL is to maximize
classification accuracy of classifier, minimizing loss of information while
discretization of continuous attributes. The performance of the suggested
approach is compared with the supervised discretization algorithm Minimum
Information Loss (MIL), using the state-of-the-art rule inductive algorithms-
J48 (Java implementation of C4.5 classifier). The presented approach is,
indeed, the modified version of MIL. The empirical results show that the
modified approach performs better in several cases in comparison to the
original MIL algorithm and Minimum Description Length Principle (MDLP) .
","[{'version': 'v1', 'created': 'Fri, 13 Oct 2017 22:45:11 GMT'}]",2017-10-17,"[['Mitra', 'Gourab', ''], ['Sundareisan', 'Shashidhar', ''], ['Sarkar', 'Bikash Kanti', '']]","['Data   mining', 'Discretization', 'Classifier', 'Accuracy', 'Information  Loss             Nomenclature']"
19045,1005.2731,Wei Hou Mr.,"Wei Hou, Lin Zhang, Lei Yang, Heather Zheng, Xiuming Shan","Cross-Band Interference Considered Harmful in OFDM Based Distributed
  Spectrum Sharing",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the past few years we have witnessed the paradigm shift from static
spectrum allocation to dynamic spectrum access/sharing. Orthogonal
Frequency-Division Multiple Access (OFDMA) is a promising mechanism to
implement the agile spectrum access. However, in wireless distributed networks
where tight synchronization is infeasible, OFDMA faces the problem of
cross-band interference. Subcarriers used by different users are no longer
orthogonal, and transmissions operating on non-overlapping subcarriers can
interfere with each other. In this paper, we explore the cause of cross-band
interference and analytically quantify its strength and impact on packet
transmissions. Our analysis captures three key practical artifacts: inter-link
frequency offset, temporal sampling mismatch and power heterogeneity. To our
best knowledge, this work is the first to systematically analyze the cause and
impact of cross-band interference. Using insights from our analysis, we then
build and compared three mitigating methods to combat cross-band interference.
Analytical and simulation results show that placing frequency guardband at link
boundaries is the most effective solution in distributed spectrum sharing,
while the other two frequency-domain methods are sensitive to either temporal
sampling mismatch or inter-link frequency offset. We find that the proper
guardband size depends heavily on power heterogeneity. Consequently, protocol
designs for dynamic spectrum access should carefully take into account the
cross-band interference when configuring spectrum usage.
","[{'version': 'v1', 'created': 'Sun, 16 May 2010 09:06:54 GMT'}]",2015-03-17,"[['Hou', 'Wei', ''], ['Zhang', 'Lin', ''], ['Yang', 'Lei', ''], ['Zheng', 'Heather', ''], ['Shan', 'Xiuming', '']]","['OFDMA', 'Cross-band Interference', 'Distributed Network', 'Dynamic Spectrum Access']"
19046,1609.06954,Vaishak Belle,"Vaishak Belle, Luc De Raedt","Semiring Programming: A Declarative Framework for Generalized Sum
  Product Problems","In AAAI Workshop: Statistical Relational Artificial Intelligence,
  2020",,,,cs.AI cs.LG cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To solve hard problems, AI relies on a variety of disciplines such as logic,
probabilistic reasoning, machine learning and mathematical programming.
Although it is widely accepted that solving real-world problems requires an
integration amongst these, contemporary representation methodologies offer
little support for this.
  In an attempt to alleviate this situation, we introduce a new declarative
programming framework that provides abstractions of well-known problems such as
SAT, Bayesian inference, generative models, and convex optimization. The
semantics of programs is defined in terms of first-order structures with
semiring labels, which allows us to freely combine and integrate problems from
different AI disciplines.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2016 08:17:40 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Jan 2020 13:55:44 GMT'}]",2020-01-14,"[['Belle', 'Vaishak', ''], ['De Raedt', 'Luc', '']]","['Weighted model counting', 'Declarative Languages', 'Semantic abstractions', 'Semiring frameworks']"
19047,1304.4711,Ankit Chaudhary,"Ankit Chaudhary, Ankur Gupta","Automated Switching System for Skin Pixel Segmentation in Varied
  Lighting",6 pages,"19th IEEE International Conference on Mechatronics and Machine
  Vision in Practice, Auckland, New Zealand, 28-30 Nov, 2012, pp. 26-31",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Computer Vision, colour-based spatial techniquesoften assume a static skin
colour model. However, skin colour perceived by a camera can change when
lighting changes. In common real environment multiple light sources impinge on
the skin. Moreover, detection techniques may vary when the image under study is
taken under different lighting condition than the one that was earlier under
consideration. Therefore, for robust skin pixel detection, a dynamic skin
colour model that can cope with the changes must be employed. This paper shows
that skin pixel detection in a digital colour image can be significantly
improved by employing automated colour space switching methods. In the root of
the switching technique which is employed in this study, lies the statistical
mean of value of the skin pixels in the image which in turn has been derived
from the Value, measures as a third component of the HSV. The study is based on
experimentations on a set of images where capture time conditions varying from
highly illuminated to almost dark.
","[{'version': 'v1', 'created': 'Wed, 17 Apr 2013 07:07:52 GMT'}]",2013-04-18,"[['Chaudhary', 'Ankit', ''], ['Gupta', 'Ankur', '']]","['Skin Detection', 'Robust Segmentation', 'Colour Space Switching', 'Image Processing', 'Automated Skin Detection   1']"
19048,1704.04278,Joona Karjalainen,"Joona Karjalainen and Lasse Leskel\""a","Moment-based parameter estimation in binomial random intersection graph
  models","15 pages, 6 figures",,,,cs.SI math.PR math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Binomial random intersection graphs can be used as parsimonious statistical
models of large and sparse networks, with one parameter for the average degree
and another for transitivity, the tendency of neighbours of a node to be
connected. This paper discusses the estimation of these parameters from a
single observed instance of the graph, using moment estimators based on
observed degrees and frequencies of 2-stars and triangles. The observed data
set is assumed to be a subgraph induced by a set of $n_0$ nodes sampled from
the full set of $n$ nodes. We prove the consistency of the proposed estimators
by showing that the relative estimation error is small with high probability
for $n_0 \gg n^{2/3} \gg 1$. As a byproduct, our analysis confirms that the
empirical transitivity coefficient of the graph is with high probability close
to the theoretical clustering coefficient of the model.
","[{'version': 'v1', 'created': 'Thu, 13 Apr 2017 20:42:52 GMT'}, {'version': 'v2', 'created': 'Sun, 24 Jun 2018 19:37:37 GMT'}]",2018-06-26,"[['Karjalainen', 'Joona', ''], ['Leskelä', 'Lasse', '']]","['statistical network model', 'network motif', 'model fitting', 'momentestimator', 'sparse graph', 'two-mode network', 'overlapping communities']"
19049,1312.5420,Olivier Hermant,"M\'elanie Boudard (PRISM), Olivier Hermant (CRI)",Polarizing Double Negation Translations,,LPAR 8312 (2013) 182-197,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Double-negation translations are used to encode and decode classical proofs
in intuitionistic logic. We show that, in the cut-free fragment, we can
simplify the translations and introduce fewer negations. To achieve this, we
consider the polarization of the formul{\ae}{} and adapt those translation to
the different connectives and quantifiers. We show that the embedding results
still hold, using a customized version of the focused classical sequent
calculus. We also prove the latter equivalent to more usual versions of the
sequent calculus. This polarization process allows lighter embeddings, and
sheds some light on the relationship between intuitionistic and classical
connectives.
","[{'version': 'v1', 'created': 'Thu, 19 Dec 2013 06:54:17 GMT'}]",2013-12-20,"[['Boudard', 'Mélanie', '', 'PRISM'], ['Hermant', 'Olivier', '', 'CRI']]","['classical logic', 'intuitionnistic logic', 'double-negation translation', 'focusing']"
19050,1702.04694,Liqi Wang,"Reza Sobhani, Zhonghua Sun, Liqi Wang, Shixin Zhu","A note on complete classification of $(\delta+\alpha u^2)$-constacyclic
  codes of length $p^k$ over $\F_{p^m}+u\F_{p^m}+u^2\F_{p^m}$",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For units $\delta$ and $\alpha$ in $\F_{p^m}$, the structure of
$(\delta+\alpha u^2)$-constacyclic codes of length $p^k$ over
$\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+u^2\mathbb{F}_{p^m}$ is studied and
self-dual $(\delta+\alpha u^2)$-constacyclic codes are analyzed.
","[{'version': 'v1', 'created': 'Wed, 15 Feb 2017 17:46:48 GMT'}]",2017-02-16,"[['Sobhani', 'Reza', ''], ['Sun', 'Zhonghua', ''], ['Wang', 'Liqi', ''], ['Zhu', 'Shixin', '']]","['Constacyclic codes', 'Self-dual codes', 'Torsion codes']"
19051,1704.08716,Brian Ruttenberg,"Avi Pfeffer, Brian Ruttenberg, Lee Kellogg, Michael Howard, Catherine
  Call, Alison O'Connor, Glenn Takata, Scott Neal Reilly, Terry Patten, Jason
  Taylor, Robert Hall, Arun Lakhotia, Craig Miles, Dan Scofield, Jared Frank",Artificial Intelligence Based Malware Analysis,,,,,cs.CR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Artificial intelligence methods have often been applied to perform specific
functions or tasks in the cyber-defense realm. However, as adversary methods
become more complex and difficult to divine, piecemeal efforts to understand
cyber-attacks, and malware-based attacks in particular, are not providing
sufficient means for malware analysts to understand the past, present and
future characteristics of malware.
  In this paper, we present the Malware Analysis and Attributed using Genetic
Information (MAAGI) system. The underlying idea behind the MAAGI system is that
there are strong similarities between malware behavior and biological organism
behavior, and applying biologically inspired methods to corpora of malware can
help analysts better understand the ecosystem of malware attacks. Due to the
sophistication of the malware and the analysis, the MAAGI system relies heavily
on artificial intelligence techniques to provide this capability. It has
already yielded promising results over its development life, and will hopefully
inspire more integration between the artificial intelligence and cyber--defense
communities.
","[{'version': 'v1', 'created': 'Thu, 27 Apr 2017 18:53:37 GMT'}]",2017-05-01,"[['Pfeffer', 'Avi', ''], ['Ruttenberg', 'Brian', ''], ['Kellogg', 'Lee', ''], ['Howard', 'Michael', ''], ['Call', 'Catherine', ''], [""O'Connor"", 'Alison', ''], ['Takata', 'Glenn', ''], ['Reilly', 'Scott Neal', ''], ['Patten', 'Terry', ''], ['Taylor', 'Jason', ''], ['Hall', 'Robert', ''], ['Lakhotia', 'Arun', ''], ['Miles', 'Craig', ''], ['Scofield', 'Dan', ''], ['Frank', 'Jared', '']]","['cyber–defense', 'malware', 'probabilistic models', 'hierarchical clustering', 'prediction']"
19052,1707.09349,Fr\'ed\'eric Havet,"Joergen Bang-Jensen and St\'ephane Bessy and Fr\'ed\'eric Havet and
  Anders Yeo",Out-degree reducing partitions of digraphs,"11 pages, 1 figure",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $k$ be a fixed integer. We determine the complexity of finding a
$p$-partition $(V_1, \dots, V_p)$ of the vertex set of a given digraph such
that the maximum out-degree of each of the digraphs induced by $V_i$, ($1\leq
i\leq p$) is at least $k$ smaller than the maximum out-degree of $D$. We show
that this problem is polynomial-time solvable when $p\geq 2k$ and ${\cal
NP}$-complete otherwise. The result for $k=1$ and $p=2$ answers a question
posed in \cite{bangTCS636}. We also determine, for all fixed non-negative
integers $k_1,k_2,p$, the complexity of deciding whether a given digraph of
maximum out-degree $p$ has a $2$-partition $(V_1,V_2)$ such that the digraph
induced by $V_i$ has maximum out-degree at most $k_i$ for $i\in [2]$. It
follows from this characterization that the problem of deciding whether a
digraph has a 2-partition $(V_1,V_2)$ such that each vertex $v\in V_i$ has at
least as many neighbours in the set $V_{3-i}$ as in $V_i$, for $i=1,2$ is
${\cal NP}$-complete. This solves a problem from \cite{kreutzerEJC24} on
majority colourings.
","[{'version': 'v1', 'created': 'Fri, 28 Jul 2017 17:45:33 GMT'}]",2017-07-31,"[['Bang-Jensen', 'Joergen', ''], ['Bessy', 'Stéphane', ''], ['Havet', 'Frédéric', ''], ['Yeo', 'Anders', '']]","['2-partition', 'maximum out-degree reducing partition', 'NP-complete', 'polynomial algorithm']"
19053,1202.6669,Koorosh Firouzbakht,"Koorosh Firouzbakht, Guevara Noubir and Masoud Salehi","On the Capacity of Rate-Adaptive Packetized Wireless Communication Links
  under Jamming",,,,,cs.IT cs.GT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We formulate the interaction between the communicating nodes and an adversary
within a game-theoretic context. We show that earlier information-theoretic
capacity results for a jammed channel correspond to a pure Nash Equilibrium
(NE). However, when both players are allowed to randomize their actions (i.e.,
coding rate and jamming power) new mixed Nash equilibria appear with surprising
properties. We show the existence of a threshold ($J_{TH}$) such that if the
jammer average power exceeds $J_{TH}$, the channel capacity at the NE is the
same as if the jammer was using its maximum allowable power, $J_{Max}$, all the
time. This indicates that randomization significantly advantages powerful
jammers. We also show how the NE strategies can be derived, and we provide very
simple (e.g., semi-uniform) approximations to the optimal communication and
jamming strategies. Such strategies are very simple to implement in current
hardware and software.
","[{'version': 'v1', 'created': 'Wed, 29 Feb 2012 20:10:29 GMT'}, {'version': 'v2', 'created': 'Tue, 10 Apr 2012 21:04:14 GMT'}]",2012-04-12,"[['Firouzbakht', 'Koorosh', ''], ['Noubir', 'Guevara', ''], ['Salehi', 'Masoud', '']]","['Jamming', 'rate adaptation', 'capacity', 'game-theory']"
19054,0803.3746,Leonid Litinskii,Leonid B. Litinskii,Cluster Approach to the Domains Formation,"11 pages, 5 figures, PDF-file","Optical Memory & Neural Networks (Information Optics), 2007,
  v.16(3) pp.144-153",,,cs.NE cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As a rule, a quadratic functional depending on a great number of binary
variables has a lot of local minima. One of approaches allowing one to find in
averaged deeper local minima is aggregation of binary variables into larger
blocks/domains. To minimize the functional one has to change the states of
aggregated variables (domains). In the present publication we discuss methods
of domains formation. It is shown that the best results are obtained when
domains are formed by variables that are strongly connected with each other.
","[{'version': 'v1', 'created': 'Wed, 26 Mar 2008 15:14:33 GMT'}]",2008-03-27,"[['Litinskii', 'Leonid B.', '']]","['neural networks', 'minimization problems', 'dynamical systems']"
19055,1312.2889,Ignasi Sau,Julien Baste and Ignasi Sau,"The role of planarity in connectivity problems parameterized by
  treewidth",23 pages,,,,cs.DS cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For some years it was believed that for ""connectivity"" problems such as
Hamiltonian Cycle, algorithms running in time 2^{O(tw)}n^{O(1)} -called
single-exponential- existed only on planar and other sparse graph classes,
where tw stands for the treewidth of the n-vertex input graph. This was
recently disproved by Cygan et al. [FOCS 2011], Bodlaender et al. [ICALP 2013],
and Fomin et al. [SODA 2014], who provided single-exponential algorithms on
general graphs for essentially all connectivity problems that were known to be
solvable in single-exponential time on sparse graphs. In this article we
further investigate the role of planarity in connectivity problems
parameterized by treewidth, and convey that several problems can indeed be
distinguished according to their behavior on planar graphs. Known results from
the literature imply that there exist problems, like Cycle Packing, that cannot
be solved in time 2^{o(tw logtw)}n^{O(1)} on general graphs but that can be
solved in time 2^{O(tw)}n^{O(1)} when restricted to planar graphs. Our main
contribution is to show that there exist problems that can be solved in time
2^{O(tw logtw)}n^{O(1)} on general graphs but that cannot be solved in time
2^{o(tw logtw)}n^{O(1)} even when restricted to planar graphs. Furthermore, we
prove that Planar Cycle Packing and Planar Disjoint Paths cannot be solved in
time 2^{o(tw)}n^{O(1)}. The mentioned negative results hold unless the ETH
fails. We feel that our results constitute a first step in a subject that can
be further exploited.
","[{'version': 'v1', 'created': 'Tue, 10 Dec 2013 17:27:12 GMT'}]",2013-12-11,"[['Baste', 'Julien', ''], ['Sau', 'Ignasi', '']]","['parameterized complexity', 'treewidth', 'connectivity problems', 'singleexponential algorithms', 'planar graphs', 'dynamic programming']"
19056,1710.03645,Shun Ogata Mr.,"Shun Ogata, Koji Ishibashi, and Giuseppe Abreu","Optimized Frameless ALOHA for Cooperative Base Stations with Overlapped
  Coverage Areas","Accepted for publication in the IEEE Transactions on Wireless
  Communications",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Herein, we consider the problem of cooperative multi-access in the presence
of overlapped coverage areas. Assuming a frameless ALOHA transmission scheme,
we derive exact analytical throughput expressions for throughput in the
aforementioned scenarios as a function of the frame length of the system and
for arbitrary average numbers of users transmitting in each slot (target
degree). After obtaining these original expressions, we then formulate a
utility function whose maximization (obtained, e.g., through genetic
algorithms) yields unequal and optimum target degrees to be employed by users
in each group in order to maximize the peak throughput of the whole system,
while satisfying a given prescribed outage. A comparison of the resulting
cooperative multiple base station (BS) multi-access scheme against optimized
single-BS frameless ALOHA systems - which presume the perfect isolation of
users at each BS and an equal optimum target degree for all users - indicates a
significant gain in overall throughput, thereby revealing that a multi-access
diversity gain can be reaped by allowing groups of users from different BSs to
overlap.
","[{'version': 'v1', 'created': 'Tue, 10 Oct 2017 15:11:29 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Mar 2018 07:40:16 GMT'}, {'version': 'v3', 'created': 'Sun, 19 Aug 2018 16:54:07 GMT'}]",2018-08-21,"[['Ogata', 'Shun', ''], ['Ishibashi', 'Koji', ''], ['Abreu', 'Giuseppe', '']]","['Frameless ALOHA', 'successive interference cancellation', 'multiple base station cooperation']"
19057,1002.1201,Vishal Goyal,"S. S. Phulari, S. D. Khamitkar, N. K. Deshmukh, P. U. Bhalchandra, S.
  N. Lokhande, A. R. Shinde","Understanding Formulation of Social Capital in Online Social Network
  Sites (SNS)","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 3, January 2010, http://ijcsi.org/issues.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 3, January 2010, http://ijcsi.org/issues.php",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online communities are the gatherings of like-minded people, brought together
in cyberspace by shared interests. The shared interest has hidden social
capital aspects and can be of bridging or bonding type. Creating such
communities is not a big challenge but sustaining member's participation is.
This study examines the formation and maintenance of social capital in social
network sites. In addition to assessing bonding and bridging social capital, we
explore a dimension of social capital that assesses one's ability to stay
connected with members of a previously inhabited community, which we call
maintained social capital. Such dimension is enacted here in terms of
Hypothesis.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 11:10:25 GMT'}]",2010-02-08,"[['Phulari', 'S. S.', ''], ['Khamitkar', 'S. D.', ''], ['Deshmukh', 'N. K.', ''], ['Bhalchandra', 'P. U.', ''], ['Lokhande', 'S. N.', ''], ['Shinde', 'A. R.', '']]","['Social Area Networks', 'Social Capital', 'Analysis']"
19058,1712.04564,Lin Yang,"Avrim Blum, Vladimir Braverman, Ananya Kumar, Harry Lang, Lin F. Yang",Approximate Convex Hull of Data Streams,,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a finite set of points $P \subseteq \mathbb{R}^d$, we would like to
find a small subset $S \subseteq P$ such that the convex hull of $S$
approximately contains $P$. More formally, every point in $P$ is within
distance $\epsilon$ from the convex hull of $S$. Such a subset $S$ is called an
$\epsilon$-hull. Computing an $\epsilon$-hull is an important problem in
computational geometry, machine learning, and approximation algorithms.
  In many real world applications, the set $P$ is too large to fit in memory.
We consider the streaming model where the algorithm receives the points of $P$
sequentially and strives to use a minimal amount of memory. Existing streaming
algorithms for computing an $\epsilon$-hull require $O(\epsilon^{-(d-1)/2})$
space, which is optimal for a worst-case input. However, this ignores the
structure of the data. The minimal size of an $\epsilon$-hull of $P$, which we
denote by $\text{OPT}$, can be much smaller. A natural question is whether a
streaming algorithm can compute an $\epsilon$-hull using only $O(\text{OPT})$
space.
  We begin with lower bounds that show that it is not possible to have a
single-pass streaming algorithm that computes an $\epsilon$-hull with
$O(\text{OPT})$ space. We instead propose three relaxations of the problem for
which we can compute $\epsilon$-hulls using space near-linear to the optimal
size. Our first algorithm for points in $\mathbb{R}^2$ that arrive in
random-order uses $O(\log n\cdot \text{OPT})$ space. Our second algorithm for
points in $\mathbb{R}^2$ makes $O(\log(\frac{1}{\epsilon}))$ passes before
outputting the $\epsilon$-hull and requires $O(\text{OPT})$ space. Our third
algorithm for points in $\mathbb{R}^d$ for any fixed dimension $d$ outputs an
$\epsilon$-hull for all but $\delta$-fraction of directions and requires
$O(\text{OPT} \cdot \log \text{OPT})$ space.
","[{'version': 'v1', 'created': 'Tue, 12 Dec 2017 23:05:32 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Dec 2017 05:18:23 GMT'}]",2017-12-15,"[['Blum', 'Avrim', ''], ['Braverman', 'Vladimir', ''], ['Kumar', 'Ananya', ''], ['Lang', 'Harry', ''], ['Yang', 'Lin F.', '']]","['Convex Hulls', 'Streaming Algorithms', 'Epsilon Kernels', 'Sparse Coding']"
19059,1403.7766,Tejal Shah,"Tejal Shah, Fethi Rabhi, Pradeep Ray and Kerry Taylor","Enhancing Automated Decision Support across Medical and Oral Health
  Domains with Semantic Web Technologies","The paper has been published at the 24th Australasian Conference on
  Information Systems, 4-6 Dec 2013, Melbourne. The paper can be found at:
  http://mo.bf.rmit.edu.au/acis2013/382.pdf",,,,cs.AI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Research has shown that the general health and oral health of an individual
are closely related. Accordingly, current practice of isolating the information
base of medical and oral health domains can be dangerous and detrimental to the
health of the individual. However, technical issues such as heterogeneous data
collection and storage formats, limited sharing of patient information and lack
of decision support over the shared information are the principal reasons for
the current state of affairs. To address these issues, the following research
investigates the development and application of a cross-domain ontology and
rules to build an evidence-based and reusable knowledge base consisting of the
inter-dependent conditions from the two domains. Through example implementation
of the knowledge base in Protege, we demonstrate the effectiveness of our
approach in reasoning over and providing decision support for cross-domain
patient information.
","[{'version': 'v1', 'created': 'Sun, 30 Mar 2014 14:20:22 GMT'}]",2014-04-01,"[['Shah', 'Tejal', ''], ['Rabhi', 'Fethi', ''], ['Ray', 'Pradeep', ''], ['Taylor', 'Kerry', '']]","['OWL', 'SWRL', 'decision support', 'rules', 'ontologies']"
19060,1407.3128,Agnieszka Kulacka PhD,Agnieszka Kulacka,A tableau for set-satisfiability for extended fuzzy logic BL,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a tableau calculus for finding a model for a
set-satisfiable finite set of formulas of an extended fuzzy logic BL, a fuzzy
logic BL with additional Baaz connective and the involutive negation, if such a
model exists. The calculus is a generalisation of a tableau calculus for BL,
which is based on the decomposition theorem for a continuous t-norm. The
aforementioned tableau calculus for BL is used to prove that a formula A of the
extended BL is valid with respect to all continuous t-norms or to find a
continuous t-norm * and assignment V of propositional atoms to [0,1] such that
*-evaluation V*(A)<1. The tableau calculus presented in this paper enables for
a finite set of formulas F of the extended BL and a subset K of [0,1] to find a
continuous t-norm * and assignment V of propositional atoms to [0,1] such that
*-evaluation V*(A) belongs to K for all formulas A that belong to F, or
alternatively to show that such a model does not exist.
","[{'version': 'v1', 'created': 'Fri, 11 Jul 2014 12:12:40 GMT'}]",2014-07-14,"[['Kulacka', 'Agnieszka', '']]","['tableaux', 'continuous t-norm', 'fuzzy logic', 'set-satisfiability', 'weak', 'strongpoint-satisfiability']"
19061,0710.4813,EDA Publishing Association,"I. Papaefstathiou, T. Orphanoudakis, G. Kornaros, C. Kachris, I.
  Mavroidis, A. Nikologiannis",Queue Management in Network Processors,Submitted on behalf of EDAA (http://www.edaa.com/),"Dans Design, Automation and Test in Europe | Designers'Forum -
  DATE'05, Munich : Allemagne (2005)",,,cs.AR,,"  One of the main bottlenecks when designing a network processing system is
very often its memory subsystem. This is mainly due to the state-of-the-art
network links operating at very high speeds and to the fact that in order to
support advanced Quality of Service (QoS), a large number of independent queues
is desirable. In this paper we analyze the performance bottlenecks of various
data memory managers integrated in typical Network Processing Units (NPUs). We
expose the performance limitations of software implementations utilizing the
RISC processing cores typically found in most NPU architectures and we identify
the requirements for hardware assisted memory management in order to achieve
wire-speed operation at gigabit per second rates. Furthermore, we describe the
architecture and performance of a hardware memory manager that fulfills those
requirements. This memory manager, although it is implemented in a
reconfigurable technology, it can provide up to 6.2Gbps of aggregate
throughput, while handling 32K independent queues.
","[{'version': 'v1', 'created': 'Thu, 25 Oct 2007 12:00:48 GMT'}]",2011-11-09,"[['Papaefstathiou', 'I.', ''], ['Orphanoudakis', 'T.', ''], ['Kornaros', 'G.', ''], ['Kachris', 'C.', ''], ['Mavroidis', 'I.', ''], ['Nikologiannis', 'A.', '']]","['Network processor', 'memory management', 'queue management']"
19062,1511.09250,Daniel Ritter,Daniel Ritter and Stefanie Rinderle-Ma,Toward A Collection of Cloud Integration Patterns,"38 pages; keywords: Cloud integration, device integration, enterprise
  application integration, enterprise integration patterns, hybrid integration",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing is one of the most exciting IT trends nowadays. It poses
several challenges on application integration with respect to, for example,
security. In this work we collect and categorize several new integration
patterns and pattern solutions with a focus on cloud integration requirements.
Their evidence and examples are based on extensive literature and system
reviews.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2015 11:37:24 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Dec 2015 10:04:29 GMT'}, {'version': 'v3', 'created': 'Tue, 22 Mar 2016 11:30:34 GMT'}, {'version': 'v4', 'created': 'Sat, 11 Mar 2017 12:05:27 GMT'}]",2017-03-14,"[['Ritter', 'Daniel', ''], ['Rinderle-Ma', 'Stefanie', '']]","['Cloud integration', 'device integration', 'enterprise applicationintegration', 'enterprise integration patterns', 'hybrid integration']"
19063,1003.5865,Dakshina Ranjan Kisku,"Dakshina Ranjan Kisku, Phalguni Gupta, Jamuna Kanta Sing","Offline Signature Identification by Fusion of Multiple Classifiers using
  Statistical Learning Theory","11 pages, 3 figures, IJSIA 2010",,,,cs.CV cs.LG,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper uses Support Vector Machines (SVM) to fuse multiple classifiers
for an offline signature system. From the signature images, global and local
features are extracted and the signatures are verified with the help of
Gaussian empirical rule, Euclidean and Mahalanobis distance based classifiers.
SVM is used to fuse matching scores of these matchers. Finally, recognition of
query signatures is done by comparing it with all signatures of the database.
The proposed system is tested on a signature database contains 5400 offline
signatures of 600 individuals and the results are found to be promising.
","[{'version': 'v1', 'created': 'Tue, 30 Mar 2010 16:36:36 GMT'}]",2010-03-31,"[['Kisku', 'Dakshina Ranjan', ''], ['Gupta', 'Phalguni', ''], ['Sing', 'Jamuna Kanta', '']]","['Offline Signature Identification', 'Multi-Classifiers', 'Global and Local Features', 'Distance Metrics', 'Support Vector Machines.   1']"
19064,1604.08448,Shunji Umetani,Shunji Umetani,"Exploiting variable associations to configure efficient local search
  algorithms in large-scale binary integer programs",,,,,cs.DS cs.AI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a data mining approach for reducing the search space of local
search algorithms in a class of binary integer programs including the set
covering and partitioning problems. The quality of locally optimal solutions
typically improves if a larger neighborhood is used, while the computation time
of searching the neighborhood increases exponentially. To overcome this, we
extract variable associations from the instance to be solved in order to
identify promising pairs of flipping variables in the neighborhood search.
Based on this, we develop a 4-flip neighborhood local search algorithm that
incorporates an efficient incremental evaluation of solutions and an adaptive
control of penalty weights. Computational results show that the proposed method
improves the performance of the local search algorithm for large-scale set
covering and partitioning problems.
","[{'version': 'v1', 'created': 'Thu, 28 Apr 2016 15:04:08 GMT'}, {'version': 'v2', 'created': 'Fri, 12 May 2017 15:34:54 GMT'}]",2017-05-15,"[['Umetani', 'Shunji', '']]","['combinatorial optimization', 'heuristics', 'set covering problem', 'setpartitioning problem', 'local search']"
19065,0903.3622,Mugurel Ionut Andreica,"Mugurel Ionut Andreica, Sorin Briciu, Madalina Ecaterina Andreica","Algorithmic Solutions to Some Transportation Optimization Problems with
  Applications in the Metallurgical Industry",,"Metalurgia International, vol. 14, special issue no. 5, pp. 46-53,
  2009. (ISSN: 1582-2214) ; http://www.metalurgia.ro/metalurgia_int.html",,,cs.DS cs.CG cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we address several constrained transportation optimization
problems (e.g. vehicle routing, shortest Hamiltonian path), for which we
present novel algorithmic solutions and extensions, considering several
optimization objectives, like minimizing costs and resource usage. All the
considered problems are motivated by practical situations arising, for
instance, in the mining and metallurgical industry or in data communication. We
restrict our attention to transportation networks with path, tree or geometric
structures, for which the developed polynomial-time algorithms are optimal or
nearly optimal.
","[{'version': 'v1', 'created': 'Fri, 20 Mar 2009 22:21:30 GMT'}]",2009-03-24,"[['Andreica', 'Mugurel Ionut', ''], ['Briciu', 'Sorin', ''], ['Andreica', 'Madalina Ecaterina', '']]","['Transportation Optimization', 'Algorithmic Techniques', 'Tree Networks', 'Geometric Networks', 'Metallurgical Industry']"
19066,0711.1669,James Cusick,James Cusick,"Applying Software Defect Estimations: Using a Risk Matrix for Tuning
  Test Effort",,,,,cs.SE cs.OH,,"  Applying software defect esimation techniques and presenting this information
in a compact and impactful decision table can clearly illustrate to
collaborative groups how critical this position is in the overall development
cycle. The Test Risk Matrix described here has proven to be a valuable addition
to the management tools and approaches used in developing large scale software
on several releases. Use of this matrix in development planning meetings can
clarify the attendant risks and possible consequences of carrying out or
bypassing specific test activities.
","[{'version': 'v1', 'created': 'Sun, 11 Nov 2007 18:56:53 GMT'}]",2007-11-13,"[['Cusick', 'James', '']]","['Quality Assurance', 'Software Testing', 'System Testing', 'Defect Prediction', 'Risk Management', 'Process Tuning']"
19067,1708.00329,Arindam Pal,Arindam Pal and Sushmita Ruj,"A Graph Analytics Framework for Ranking Authors, Papers and Venues","International Workshop on Mining and Learning with Graphs, ACM KDD
  2016. arXiv admin note: text overlap with arXiv:1501.04894",,,,cs.DL cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A lot of scientific works are published in different areas of science,
technology, engineering and mathematics. It is not easy, even for experts, to
judge the quality of authors, papers and venues (conferences and journals). An
objective measure to assign scores to these entities and to rank them is very
useful. Although, several metrics and indexes have been proposed earlier, they
suffer from various problems. In this paper, we propose a graph-based analytics
framework to assign scores and to rank authors, papers and venues. Our
algorithm considers only the link structures of the underlying graphs. It does
not take into account other aspects, such as the associated texts and the
reputation of these entities. In the limit of large number of iterations, the
solution of the iterative equations gives the unique entity scores. This
framework can be easily extended to other interdependent networks.
","[{'version': 'v1', 'created': 'Sun, 30 Jul 2017 16:32:39 GMT'}]",2017-08-04,"[['Pal', 'Arindam', ''], ['Ruj', 'Sushmita', '']]","['Citation Index', 'Graph Analytics', 'Interdependent Networks', 'Iterative Algorithms', 'Ranking Objects']"
19068,0803.1360,Nadja Kutz,Nadja Kutz,On the need for a global academic internet platform,"22 pages, no figures",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The article collects arguments for the necessity of a global academic
internet platform, which is organized as a kind of ``global scientific
parliament''. With such a constitution educational and research institutions
will have direct means for communicating scientific results, as well as a
platform for representing academia and scientific life in the public.
","[{'version': 'v1', 'created': 'Mon, 10 Mar 2008 08:42:43 GMT'}]",2008-03-11,"[['Kutz', 'Nadja', '']]","['science', 'communication', 'economics', 'global', 'computer-supported collaborative work', 'transborder data flow', 'ethics']"
19069,1305.0261,Chantal Cherifi,"Chantal Cherifi1, Vincent Labatut, Jean-Fran\c{c}ois Santucci",Web Services Dependency Networks Analysis,arXiv admin note: substantial text overlap with arXiv:1305.0191,"International Conference of New Media and Interactivity (NMI), pp.
  115-120 (2010)",,,cs.IR cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Along with a continuously growing number of publicly available Web services
(WS), we are witnessing a rapid development in semantic-related web
technologies, which lead to the apparition of semantically described WS. In
this work, we perform a comparative analysis of the syntactic and semantic
approaches used to describe WS, from a complex network perspective. First, we
extract syntactic and semantic WS dependency networks from a collection of
publicly available WS descriptions. Then, we take advantage of tools from the
complex network field to analyze them and determine their topological
properties. We show WS dependency networks exhibit some of the typical
characteristics observed in real-world networks, such as small world and scale
free properties, as well as community structure. By comparing syntactic and
semantic networks through their topological properties, we show the
introduction of semantics in WS description allows modeling more accurately the
dependencies between parameters, which in turn could lead to improved
composition mining methods.
","[{'version': 'v1', 'created': 'Wed, 1 May 2013 15:18:20 GMT'}]",2013-05-03,"[['Cherifi1', 'Chantal', ''], ['Labatut', 'Vincent', ''], ['Santucci', 'Jean-François', '']]","['Dependency Networks', 'Semantic Web Services', 'Complex Networks']"
19070,0802.3074,EDA Publishing Association,"G.-J. Wang, K.-H. Ho, C.-C. Hsueh","Biodegradable Polylactic Acid (PLA) Microstructures for Scaffold
  Applications","Submitted on behalf of EDA Publishing Association
  (http://irevues.inist.fr/EDA-Publishing)","Dans Symposium on Design, Test, Integration and Packaging of
  MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)",,,cs.OH,,"  In this research, we present a simple and cost effective soft lithographic
process to fabricate PLA scaffolds for tissue engineering. In which, the
negative photoresist JSR THB-120N was spun on a glass subtract followed by
conventional UV lithographic processes to fabricate the master to cast the PDMS
elastomeric mold. A thin poly(vinyl alcohol) (PVA) layer was used as a mode
release such that the PLA scaffold can be easily peeled off. The PLA precursor
solution was then cast onto the PDMS mold to form the PLA microstructures.
After evaporating the solvent, the PLA microstructures can be easily peeled off
from the PDMS mold. Experimental results show that the desired microvessels
scaffold can be successfully transferred to the biodegradable polymer PLA.
","[{'version': 'v1', 'created': 'Thu, 21 Feb 2008 13:32:51 GMT'}]",2008-02-22,"[['Wang', 'G. -J.', ''], ['Ho', 'K. -H.', ''], ['Hsueh', 'C. -C.', '']]","['Biodegradable polymer PLA', 'Soft lithography', 'Scaffold fabrication']"
19071,1306.5547,Ji Won Yoon Ph.D.,Chae Chang Lee and Ji Won yoon,"A data mining approach using transaction patterns for card fraud
  detection",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Credit and debit cards, rather than actual money, have become the universal
payment means. With these cards, it has become possible to buy expensive items
easily without an additional complex authentication procedure being conducted.
However, card transaction features are targeted by criminals seeking to use a
lost or stolen card and looking for a chance to replicate it. Accidents,
whether caused by the negligence of users or not, that lead to a transaction
being performed by a criminal rather than the authorized card user should be
prevented. Therefore, card companies are providing their clients with a variety
of policies and standards to cover this eventuality. Card companies must
therefore be able to distinguish between the rightful user and illegal users
according to these standards in order to minimize damage resulting from
unauthorized transactions.
  However, there is a limit to applying the same fixed standards to all card
users, since the transaction patterns of people differ and even individuals'
transaction patterns may change frequently due to changes income and
consumption preference. Therefore, when only a specific threshold is applied,
it is difficult to distinguish a fraudulent card transaction from a legitimate
one.
  In this paper, we present methods for learning the individual patterns of a
card user's transaction amount and the region in which he or she uses the card,
for a given period, and for determining whether the specified transaction is
allowable in accordance with these learned user transaction patterns. Then, we
classify legitimate transactions and fraudulent transactions by setting
thresholds based on the learned individual patterns.
","[{'version': 'v1', 'created': 'Mon, 24 Jun 2013 09:21:23 GMT'}]",2013-06-25,"[['Lee', 'Chae Chang', ''], ['yoon', 'Ji Won', '']]","['Pattern mining', 'Fraud detection', 'Autoregressive', 'Gaussian Processes', 'Association rule']"
19072,0706.1141,Matthias Brust R.,"Adrian Andronache, Matthias R. Brust, Steffen Rothkugel","Multimedia Content Distribution in Hybrid Wireless Networks using
  Weighted Clustering","2nd ACM Workshop on Wireless Multimedia Networking and Performance
  Modeling 2006 (ISBN 1-59593-485)",,,,cs.MM cs.NI,,"  Fixed infrastructured networks naturally support centralized approaches for
group management and information provisioning. Contrary to infrastructured
networks, in multi-hop ad-hoc networks each node acts as a router as well as
sender and receiver. Some applications, however, requires hierarchical
arrangements that-for practical reasons-has to be done locally and
self-organized. An additional challenge is to deal with mobility that causes
permanent network partitioning and re-organizations. Technically, these
problems can be tackled by providing additional uplinks to a backbone network,
which can be used to access resources in the Internet as well as to inter-link
multiple ad-hoc network partitions, creating a hybrid wireless network. In this
paper, we present a prototypically implemented hybrid wireless network system
optimized for multimedia content distribution. To efficiently manage the ad-hoc
communicating devices a weighted clustering algorithm is introduced. The
proposed localized algorithm deals with mobility, but does not require
geographical information or distances.
","[{'version': 'v1', 'created': 'Fri, 8 Jun 2007 09:31:46 GMT'}]",2012-01-16,"[['Andronache', 'Adrian', ''], ['Brust', 'Matthias R.', ''], ['Rothkugel', 'Steffen', '']]","['Clustering', 'Ad-hoc Network', 'Hybrid Network']"
19073,1701.08306,Zohreh Shams,"Zohreh Shams, Marina De Vos, Julian Padget and Wamberto W. Vasconcelos","Practical Reasoning with Norms for Autonomous Software Agents (Full
  Edition)",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autonomous software agents operating in dynamic environments need to
constantly reason about actions in pursuit of their goals, while taking into
consideration norms which might be imposed on those actions. Normative
practical reasoning supports agents making decisions about what is best for
them to (not) do in a given situation. What makes practical reasoning
challenging is the interplay between goals that agents are pursuing and the
norms that the agents are trying to uphold. We offer a formalisation to allow
agents to plan for multiple goals and norms in the presence of durative actions
that can be executed concurrently. We compare plans based on decision-theoretic
notions (i.e. utility) such that the utility gain of goals and utility loss of
norm violations are the basis for this comparison. The set of optimal plans
consists of plans that maximise the overall utility, each of which can be
chosen by the agent to execute. We provide an implementation of our proposal in
Answer Set Programming, thus allowing us to state the original problem in terms
of a logic program that can be queried for solutions with specific properties.
The implementation is proven to be sound and complete.
","[{'version': 'v1', 'created': 'Sat, 28 Jan 2017 17:55:04 GMT'}]",2017-01-31,"[['Shams', 'Zohreh', ''], ['De Vos', 'Marina', ''], ['Padget', 'Julian', ''], ['Vasconcelos', 'Wamberto W.', '']]","['Intelligent Agents', 'Practical Reasoning', 'Norms', 'Goals']"
19074,1111.1497,Rishiraj Saha Roy,"Rishiraj Saha Roy, Niloy Ganguly, Monojit Choudhury and Srivatsan
  Laxman",An IR-based Evaluation Framework for Web Search Query Segmentation,,,,,cs.IR,http://creativecommons.org/licenses/by/3.0/,"  This paper presents the first evaluation framework for Web search query
segmentation based directly on IR performance. In the past, segmentation
strategies were mainly validated against manual annotations. Our work shows
that the goodness of a segmentation algorithm as judged through evaluation
against a handful of human annotated segmentations hardly reflects its
effectiveness in an IR-based setup. In fact, state-of the-art algorithms are
shown to perform as good as, and sometimes even better than human annotations
-- a fact masked by previous validations. The proposed framework also provides
us an objective understanding of the gap between the present best and the best
possible segmentation algorithm. We draw these conclusions based on an
extensive evaluation of six segmentation strategies, including three most
recent algorithms, vis-a-vis segmentations from three human annotators. The
evaluation framework also gives insights about which segments should be
necessarily detected by an algorithm for achieving the best retrieval results.
The meticulously constructed dataset used in our experiments has been made
public for use by the research community.
","[{'version': 'v1', 'created': 'Mon, 7 Nov 2011 07:26:27 GMT'}, {'version': 'v2', 'created': 'Sun, 18 Dec 2011 17:33:28 GMT'}, {'version': 'v3', 'created': 'Tue, 20 Dec 2011 11:22:38 GMT'}, {'version': 'v4', 'created': 'Tue, 18 Sep 2012 03:26:22 GMT'}]",2015-03-19,"[['Roy', 'Rishiraj Saha', ''], ['Ganguly', 'Niloy', ''], ['Choudhury', 'Monojit', ''], ['Laxman', 'Srivatsan', '']]","['Query segmentation', 'IR evaluation', 'Evaluation framework', 'Test collections', 'Manual annotation']"
19075,1701.07723,Georgia Kougka,"Georgia Kougka, Anastasios Gounaris and Alkis Simitsis",The Many Faces of Data-centric Workflow Optimization: A Survey,"21 pages, 8 figures",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Workflow technology is rapidly evolving and, rather than being limited to
modeling the control flow in business processes, is becoming a key mechanism to
perform advanced data management, such as big data analytics. This survey
focuses on data-centric workflows (or workflows for data analytics or data
flows), where a key aspect is data passing through and getting manipulated by a
sequence of steps. The large volume and variety of data, the complexity of
operations performed, and the long time such workflows take to compute give
rise to the need for optimization. In general, data-centric workflow
optimization is a technology in evolution. This survey focuses on techniques
applicable to workflows comprising arbitrary types of data manipulation steps
and semantic inter-dependencies between such steps. Further, it serves a
twofold purpose. Firstly, to present the main dimensions of the relevant
optimization problems and the types of optimizations that occur before flow
execution. Secondly, to provide a concise overview of the existing approaches
with a view to highlighting key observations and areas deserving more attention
from the community.
","[{'version': 'v1', 'created': 'Thu, 26 Jan 2017 14:45:28 GMT'}]",2017-01-27,"[['Kougka', 'Georgia', ''], ['Gounaris', 'Anastasios', ''], ['Simitsis', 'Alkis', '']]","['data analytics', 'data flows', 'workflow optimization', 'survey']"
19076,1110.3961,Neeraj Kumar Sharma,"Vibha Gaur, Neeraj Kumar Sharma",A Dynamic Framework of Reputation Systems for an Agent Mediated e-market,"19 Pages; International Journal of Computer Science Issues
  (IJCSI),Vol 8, Issue 4, July 2011, ISSN(online): 1694-0814",,,,cs.MA cs.AI cs.IT cs.SI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The success of an agent mediated e-market system lies in the underlying
reputation management system to improve the quality of services in an
information asymmetric e-market. Reputation provides an operatable metric for
establishing trustworthiness between mutually unknown online entities.
Reputation systems encourage honest behaviour and discourage malicious
behaviour of participating agents in the e-market. A dynamic reputation model
would provide virtually instantaneous knowledge about the changing e-market
environment and would utilise Internets' capacity for continuous interactivity
for reputation computation. This paper proposes a dynamic reputation framework
using reinforcement learning and fuzzy set theory that ensures judicious use of
information sharing for inter-agent cooperation. This framework is sensitive to
the changing parameters of e-market like the value of transaction and the
varying experience of agents with the purpose of improving inbuilt defense
mechanism of the reputation system against various attacks so that e-market
reaches an equilibrium state and dishonest agents are weeded out of the market.
","[{'version': 'v1', 'created': 'Tue, 18 Oct 2011 12:50:26 GMT'}]",2011-10-19,"[['Gaur', 'Vibha', ''], ['Sharma', 'Neeraj Kumar', '']]","['Reputation', 'Reinforcement Learning', 'Fuzzy']"
19077,1003.0929,Ciamac Moallemi,Ciamac Moallemi and Devavrat Shah,On the Flow-level Dynamics of a Packet-switched Network,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The packet is the fundamental unit of transportation in modern communication
networks such as the Internet. Physical layer scheduling decisions are made at
the level of packets, and packet-level models with exogenous arrival processes
have long been employed to study network performance, as well as design
scheduling policies that more efficiently utilize network resources. On the
other hand, a user of the network is more concerned with end-to-end bandwidth,
which is allocated through congestion control policies such as TCP.
Utility-based flow-level models have played an important role in understanding
congestion control protocols. In summary, these two classes of models have
provided separate insights for flow-level and packet-level dynamics of a
network.
","[{'version': 'v1', 'created': 'Wed, 3 Mar 2010 23:20:13 GMT'}]",2010-03-05,"[['Moallemi', 'Ciamac', ''], ['Shah', 'Devavrat', '']]","['Flow-level model', 'Packet-level model', 'Congestion control', 'Scheduling', 'Utility maximization', 'Back-pressure maximum weight']"
19078,1111.5288,Elmir Badr,"Elmir Badr, Bounabat Bouchaib","A Novel Approach for Periodic Assessment of Business Process
  Interoperability","9 pages, 8 figures","IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 4, No 1, July 2011. ISSN (Online): 1694-0814, www.IJCSI.org",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Business collaboration networks provide collaborative organizations a
favorable context for automated business process interoperability. This paper
aims to present a novel approach for assessing interoperability of process
driven services by considering the three main aspects of interoperation:
potentiality, compatibility and operational performance. It presents also a
software tool that supports the proposed assessment method. In addition to its
capacity to track and control the evolution of interoperation degree in time,
the proposed tool measures the required effort to reach a planned degree of
interoperability. Public accounting of financial authority is given as an
illustrative case study of interoperability monitoring in public collaboration
network.
","[{'version': 'v1', 'created': 'Fri, 11 Nov 2011 20:01:33 GMT'}]",2011-11-23,"[['Badr', 'Elmir', ''], ['Bouchaib', 'Bounabat', '']]","['Process driven Services', 'Business collaboration Network', 'Interoperability Assessment', 'Periodic Monitoring']"
19079,1212.1464,Manuel Gomez Rodriguez,"Manuel Gomez Rodriguez, Jure Leskovec, Bernhard Sch\""olkopf",Structure and Dynamics of Information Pathways in Online Media,"To Appear at the 6th International Conference on Web Search and Data
  Mining (WSDM '13)",,,,cs.SI cs.DS cs.IR physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Diffusion of information, spread of rumors and infectious diseases are all
instances of stochastic processes that occur over the edges of an underlying
network. Many times networks over which contagions spread are unobserved, and
such networks are often dynamic and change over time. In this paper, we
investigate the problem of inferring dynamic networks based on information
diffusion data. We assume there is an unobserved dynamic network that changes
over time, while we observe the results of a dynamic process spreading over the
edges of the network. The task then is to infer the edges and the dynamics of
the underlying network.
  We develop an on-line algorithm that relies on stochastic convex optimization
to efficiently solve the dynamic network inference problem. We apply our
algorithm to information diffusion among 3.3 million mainstream media and blog
sites and experiment with more than 179 million different pieces of information
spreading over the network in a one year period. We study the evolution of
information pathways in the online media space and find interesting insights.
Information pathways for general recurrent topics are more stable across time
than for on-going news events. Clusters of news media sites and blogs often
emerge and vanish in matter of days for on-going news events. Major social
movements and events involving civil population, such as the Libyan's civil war
or Syria's uprise, lead to an increased amount of information pathways among
blogs as well as in the overall increase in the network centrality of blogs and
social media sites.
","[{'version': 'v1', 'created': 'Thu, 6 Dec 2012 21:01:07 GMT'}]",2012-12-10,"[['Rodriguez', 'Manuel Gomez', ''], ['Leskovec', 'Jure', ''], ['Schölkopf', 'Bernhard', '']]","['Networks of diffusion', 'Information cascades', 'Blogs', 'News media', 'Meme-tracking', 'Social networks']"
19080,1310.1553,Andrey Gritsenko,Andrey Gritsenko,"A Workflow-Forecast Approach To The Task Scheduling Problem In
  Distributed Computing Systems","7 pages, 5 tables, 7 figures","International Journal of Advanced Studies in Computer Science and
  Engineering, Volume 2, Special Issue 2, pp. 1-7. September 2013",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of this paper is to provide a description of deep-learning-based
scheduling approach for academic-purpose high-performance computing systems.
The share of academic-purpose distributed computing systems (DCS) reaches 17.4
percents amongst TOP500 supercomputer sites (15.6 percents in performance
scale) that makes them a valuable object of research. The core of this approach
is to predict the future workflow of the system depending on the previously
submitted tasks using deep learning algorithm. Information on predicted tasks
is used by the resource management system (RMS) to perform efficient schedule.
","[{'version': 'v1', 'created': 'Sun, 6 Oct 2013 07:40:58 GMT'}]",2013-10-08,"[['Gritsenko', 'Andrey', '']]","['task scheduling', 'deep learning', 'workflow prediction', 'resource management systems']"
19081,1802.09301,Ya-Ping Hsieh,Ya-Ping Hsieh and Volkan Cevher,Dimension-free Information Concentration via Exp-Concavity,,,,,cs.LG cs.IT math.IT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information concentration of probability measures have important implications
in learning theory. Recently, it is discovered that the information content of
a log-concave distribution concentrates around their differential entropy,
albeit with an unpleasant dependence on the ambient dimension. In this work, we
prove that if the potentials of the log-concave distribution are exp-concave,
which is a central notion for fast rates in online and statistical learning,
then the concentration of information can be further improved to depend only on
the exp-concavity parameter, and hence, it can be dimension independent.
Central to our proof is a novel yet simple application of the variance
Brascamp-Lieb inequality. In the context of learning theory, our
concentration-of-information result immediately implies high-probability
results to many of the previous bounds that only hold in expectation.
","[{'version': 'v1', 'created': 'Mon, 26 Feb 2018 13:59:25 GMT'}]",2018-02-27,"[['Hsieh', 'Ya-Ping', ''], ['Cevher', 'Volkan', '']]","['Dimension-Free Concentration', 'Log-Concave Measures', 'Exp-Concavity', 'Variance Brascamp-Lieb Inequality', 'Differential Entropy']"
19082,1110.3844,Wazir Zada Khan,"Wazir Zada Khan, Mohammed Y. Aalsalem and Yang Xiang",A Graphical Password Based System for Small Mobile Devices,"10 Pages, 7 figures, 1 Table","IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 5, No 2, 2011, 145-154",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Passwords provide security mechanism for authentication and protection
services against unwanted access to resources. A graphical based password is
one promising alternatives of textual passwords. According to human psychology,
humans are able to remember pictures easily. In this paper, we have proposed a
new hybrid graphical password based system, which is a combination of
recognition and recall based techniques that offers many advantages over the
existing systems and may be more convenient for the user. Our scheme is
resistant to shoulder surfing attack and many other attacks on graphical
passwords. This scheme is proposed for smart mobile devices (like smart phones
i.e. ipod, iphone, PDAs etc) which are more handy and convenient to use than
traditional desktop computer systems.
","[{'version': 'v1', 'created': 'Mon, 17 Oct 2011 22:56:08 GMT'}]",2011-10-19,"[['Khan', 'Wazir Zada', ''], ['Aalsalem', 'Mohammed Y.', ''], ['Xiang', 'Yang', '']]","['Smart Phones', 'Graphical Passwords', 'Authentication', 'Network Security']"
19083,1304.4731,Javier Martin Hernandez,"J. Martin-Hernandez, H. Wang, P. Van Mieghem, G. D'Agostino",On Synchronization of Interdependent Networks,"27 pages, 7 figures",,,,cs.SY math.OC nlin.AO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is well-known that the synchronization of diffusively-coupled systems on
networks strongly depends on the network topology. In particular, the so-called
algebraic connectivity $\mu_{N-1}$, or the smallest non-zero eigenvalue of the
discrete Laplacian operator plays a crucial role on synchronization, graph
partitioning, and network robustness. In our study, synchronization is placed
in the general context of networks-of-networks, where single network models are
replaced by a more realistic hierarchy of interdependent networks. The present
work shows, analytically and numerically, how the algebraic connectivity
experiences sharp transitions after the addition of sufficient links among
interdependent networks.
","[{'version': 'v1', 'created': 'Wed, 17 Apr 2013 08:45:45 GMT'}]",2013-04-19,"[['Martin-Hernandez', 'J.', ''], ['Wang', 'H.', ''], ['Van Mieghem', 'P.', ''], [""D'Agostino"", 'G.', '']]","['Network of Networks', 'Synchronization', 'Laplacian', 'Spectral Properties', 'System of Systems']"
19084,1307.0076,Joshua I. James,"Joshua I. James, Yunsik Jake Jang",An Assessment Model for Cybercrime Investigation Capacity,"1 figure, World Crime Forum 1st Asian Regional Conference -
  Information Society and Cybercrime: Challenges for Criminology and Criminal
  Justice",,,,cs.CY,http://creativecommons.org/licenses/by/3.0/,"  Digital technologies are constantly changing, and with it criminals are
finding new ways to abuse these technologies. Cybercrime investigators, then,
must also keep their skills and knowledge up to date. This work proposes a
holistic training development model - specifically focused on cybercrime
investigation - that is based on improving investigator capability while also
considering the capacity of the investigator or unit. Along with a training
development model, a cybercrime investigation capacity assessment framework is
given for attempting to measure capacity throughout the education process.
First, a training development model is proposed that focuses on the expansion
of investigation capability as well as capacity of investigators and units.
Next, a capacity assessment model is given to evaluate the effectiveness of the
training program. A description of how the proposed model is being applied to
the development of training programs for cybercrime investigators in developing
countries will then be given, as well as already observed challenges. Finally,
concluding remarks as well as proposed future work is discussed.
","[{'version': 'v1', 'created': 'Sat, 29 Jun 2013 08:39:36 GMT'}]",2013-07-02,"[['James', 'Joshua I.', ''], ['Jang', 'Yunsik Jake', '']]","['Cybercrime Investigation Capacity Assessment', 'Cybercrime investigation capability', 'Training Development', 'Education', 'Law Enforcement']"
19085,1205.5190,Haya Shulman,Amir Herzberg and Haya Shulman,Security of Patched DNS,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In spite of the availability of DNSSEC, which protects against cache
poisoning even by MitM attackers, many caching DNS resolvers still rely for
their security against poisoning on merely validating that DNS responses
contain some 'unpredictable' values, copied from the re- quest. These values
include the 16 bit identifier field, and other fields, randomised and validated
by different 'patches' to DNS. We investigate the prominent patches, and show
how attackers can circumvent all of them, namely: - We show how attackers can
circumvent source port randomisation, in the (common) case where the resolver
connects to the Internet via different NAT devices. - We show how attackers can
circumvent IP address randomisation, using some (standard-conforming)
resolvers. - We show how attackers can circumvent query randomisation,
including both randomisation by prepending a random nonce and case
randomisation (0x20 encoding). We present countermeasures preventing our
attacks; however, we believe that our attacks provide additional motivation for
adoption of DNSSEC (or other MitM-secure defenses).
","[{'version': 'v1', 'created': 'Wed, 23 May 2012 14:52:40 GMT'}]",2015-03-20,"[['Herzberg', 'Amir', ''], ['Shulman', 'Haya', '']]","['DNS security', 'DNS poisoning', 'Network Address Translator', 'NAT', 'DNS server selection', 'network security', 'Internet security']"
19086,1406.3583,Aaron D. Jaggard,"Aaron D. Jaggard, Aaron Johnson, Paul Syverson, and Joan Feigenbaum","Representing Network Trust and Using It to Improve Anonymous
  Communication",24 pages; talk to be presented at HotPETs 2014,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by the effectiveness of correlation attacks against Tor, the
censorship arms race, and observations of malicious relays in Tor, we propose
that Tor users capture their trust in network elements using probability
distributions over the sets of elements observed by network adversaries. We
present a modular system that allows users to efficiently and conveniently
create such distributions and use them to improve their security. The major
components of this system are (i) an ontology of network-element types that
represents the main threats to and vulnerabilities of anonymous communication
over Tor, (ii) a formal language that allows users to naturally express trust
beliefs about network elements, and (iii) a conversion procedure that takes the
ontology, public information about the network, and user beliefs written in the
trust language and produce a Bayesian Belief Network that represents the
probability distribution in a way that is concise and easily sampleable. We
also present preliminary experimental results that show the distribution
produced by our system can improve security when employed by users; further
improvement is seen when the system is employed by both users and services.
","[{'version': 'v1', 'created': 'Fri, 13 Jun 2014 16:23:12 GMT'}]",2014-06-16,"[['Jaggard', 'Aaron D.', ''], ['Johnson', 'Aaron', ''], ['Syverson', 'Paul', ''], ['Feigenbaum', 'Joan', '']]","['Tor', 'Trust', 'Bayesian Belief Network']"
19087,1108.4618,Tshilidzi Marwala,LJ Mpanza and T. Marwala,"Artificial Neural Network and Rough Set for HV Bushings Condition
  Monitoring",IEEE INES 2011,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most transformer failures are attributed to bushings failures. Hence it is
necessary to monitor the condition of bushings. In this paper three methods are
developed to monitor the condition of oil filled bushing. Multi-layer
perceptron (MLP), Radial basis function (RBF) and Rough Set (RS) models are
developed and combined through majority voting to form a committee. The MLP
performs better that the RBF and the RS is terms of classification accuracy.
The RBF is the fasted to train. The committee performs better than the
individual models. The diversity of models is measured to evaluate their
similarity when used in the committee.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2011 14:44:44 GMT'}]",2011-08-24,"[['Mpanza', 'LJ', ''], ['Marwala', 'T.', '']]","['Ripper', 'principal component analysis', 'automatic relevance determination', 'artificial neural network', 'missing data']"
19088,1209.5922,Satrajit Ghosh,"D. B. Keator, K. Helmer, J. Steffener, J. A. Turner, T. G. M. Van Erp,
  S. Gadde, N. Ashish, G. A. Burns, B. N. Nichols, S. S. Ghosh","Towards structured sharing of raw and derived neuroimaging data across
  existing resources",,,,,cs.DB q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data sharing efforts increasingly contribute to the acceleration of
scientific discovery. Neuroimaging data is accumulating in distributed
domain-specific databases and there is currently no integrated access mechanism
nor an accepted format for the critically important meta-data that is necessary
for making use of the combined, available neuroimaging data. In this
manuscript, we present work from the Derived Data Working Group, an open-access
group sponsored by the Biomedical Informatics Research Network (BIRN) and the
International Neuroimaging Coordinating Facility (INCF) focused on practical
tools for distributed access to neuroimaging data. The working group develops
models and tools facilitating the structured interchange of neuroimaging
meta-data and is making progress towards a unified set of tools for such data
and meta-data exchange. We report on the key components required for integrated
access to raw and derived neuroimaging data as well as associated meta-data and
provenance across neuroimaging resources. The components include (1) a
structured terminology that provides semantic context to data, (2) a formal
data model for neuroimaging with robust tracking of data provenance, (3) a web
service-based application programming interface (API) that provides a
consistent mechanism to access and query the data model, and (4) a provenance
library that can be used for the extraction of provenance data by image
analysts and imaging software developers. We believe that the framework and set
of tools outlined in this manuscript have great potential for solving many of
the issues the neuroimaging community faces when sharing raw and derived
neuroimaging data across the various existing database systems for the purpose
of accelerating scientific discovery.
","[{'version': 'v1', 'created': 'Wed, 26 Sep 2012 13:12:49 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Jan 2013 01:15:36 GMT'}, {'version': 'v3', 'created': 'Thu, 7 Mar 2013 01:56:51 GMT'}]",2013-03-08,"[['Keator', 'D. B.', ''], ['Helmer', 'K.', ''], ['Steffener', 'J.', ''], ['Turner', 'J. A.', ''], ['Van Erp', 'T. G. M.', ''], ['Gadde', 'S.', ''], ['Ashish', 'N.', ''], ['Burns', 'G. A.', ''], ['Nichols', 'B. N.', ''], ['Ghosh', 'S. S.', '']]","['XCEDE', 'provenance', 'data model', 'neuroimaging', 'database', 'webservices']"
19089,1002.2769,Loet Leydesdorff,"Tobias Opthof, Loet Leydesdorff","Caveats for the journal and field normalizations in the CWTS (""Leiden"")
  evaluations of research performance",,,,,cs.DL physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Center for Science and Technology Studies at Leiden University advocates
the use of specific normalizations for assessing research performance with
reference to a world average. The Journal Citation Score (JCS) and Field
Citation Score (FCS) are averaged for the research group or individual
researcher under study, and then these values are used as denominators of the
(mean) Citations per publication (CPP). Thus, this normalization is based on
dividing two averages. This procedure only generates a legitimate indicator in
the case of underlying normal distributions. Given the skewed distributions
under study, one should average the observed versus expected values which are
to be divided first for each publication. We show the effects of the Leiden
normalization for a recent evaluation where we happened to have access to the
underlying data.
","[{'version': 'v1', 'created': 'Sun, 14 Feb 2010 12:07:43 GMT'}]",2010-03-11,"[['Opthof', 'Tobias', ''], ['Leydesdorff', 'Loet', '']]","['research performance', 'evaluation', 'citation', 'normalization']"
19090,1606.09135,Tamas Linder,"Richard G. Wood, Tam\'as Linder, and Serdar Y\""uksel","Optimal Zero Delay Coding of Markov Sources: Stationary and Finite
  Memory Codes",27 pages,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The optimal zero delay coding of a finite state Markov source is considered.
The existence and structure of optimal codes are studied using a stochastic
control formulation. Prior results in the literature established the optimality
of deterministic Markov (Walrand-Varaiya type) coding policies for finite time
horizon problem, and the optimality of both deterministic nonstationary and
randomized stationary policies for the infinite time horizon problem. Our main
result here shows that for any irreducible and aperiodic Markov source with a
finite alphabet, \emph{deterministic and stationary} Markov coding policies are
optimal for the infinite horizon problem. In addition, the finite blocklength
(time horizon) performance on an optimal (stationary and Markov) coding policy
is shown to approach the infinite time horizon optimum at a rate $O(1/T)$. The
results are extended to systems where zero delay communication takes place
across a noisy channel with noiseless feedback.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2016 14:54:23 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Apr 2017 18:56:59 GMT'}]",2017-04-07,"[['Wood', 'Richard G.', ''], ['Linder', 'Tamás', ''], ['Yüksel', 'Serdar', '']]","['Zero delay source coding', 'real time coding', 'causal coding', 'quantization', 'stochastic']"
19091,1105.1325,Arnab Bhattacharyya,"Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf
  Shapira",Testing Odd-Cycle-Freeness in Boolean Functions,18 pages,,,,cs.DS cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Call a function f : F_2^n -> {0,1} odd-cycle-free if there are no x_1, ...,
x_k in F_2^n with k an odd integer such that f(x_1) = ... = f(x_k) = 1 and x_1
+ ... + x_k = 0. We show that one can distinguish odd-cycle-free functions from
those eps-far from being odd-cycle-free by making poly(1/eps) queries to an
evaluation oracle. To obtain this result, we use connections between basic
Fourier analysis and spectral graph theory to show that one can reduce testing
odd-cycle-freeness of Boolean functions to testing bipartiteness of dense
graphs. Our work forms part of a recent sequence of works that shows
connections between testability of properties of Boolean functions and of graph
properties. We also prove that there is a canonical tester for
odd-cycle-freeness making poly(1/eps) queries, meaning that the testing
algorithm operates by picking a random linear subspace of dimension O(log
1/eps) and then checking if the restriction of the function to the subspace is
odd-cycle-free or not. The test is analyzed by studying the effect of random
subspace restriction on the Fourier coefficients of a function. Our work
implies that testing odd-cycle-freeness using a canonical tester instead of an
arbitrary tester incurs no more than a polynomial blowup in the query
complexity. The question of whether a canonical tester with polynomial blowup
exists for all linear-invariant properties remains an open problem.
","[{'version': 'v1', 'created': 'Fri, 6 May 2011 16:48:34 GMT'}]",2012-07-16,"[['Bhattacharyya', 'Arnab', ''], ['Grigorescu', 'Elena', ''], ['Raghavendra', 'Prasad', ''], ['Shapira', 'Asaf', '']]","['property testing', 'Boolean functions', 'Fourier analysis', 'Cayley graphs', 'eigenvalues']"
19092,1206.5986,Joel Andersson Mr.,"Joel Andersson and Jan-Olov Str\""omberg",On the Theorem of Uniform Recovery of Random Sampling Matrices,,,,,cs.IT cs.NA math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider two theorems from the theory of compressive sensing. Mainly a
theorem concerning uniform recovery of random sampling matrices, where the
number of samples needed in order to recover an $s$-sparse signal from linear
measurements (with high probability) is known to be $m\gtrsim s(\ln s)^3\ln N$.
We present new and improved constants together with what we consider to be a
more explicit proof. A proof that also allows for a slightly larger class of
$m\times N$-matrices, by considering what we call \emph{low entropy}. We also
present an improved condition on the so-called restricted isometry constants,
$\delta_s$, ensuring sparse recovery via $\ell^1$-minimization. We show that
$\delta_{2s}<4/\sqrt{41}$ is sufficient and that this can be improved further
to almost allow for a sufficient condition of the type $\delta_{2s}<2/3$.
","[{'version': 'v1', 'created': 'Tue, 26 Jun 2012 13:37:49 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Jan 2013 10:56:28 GMT'}, {'version': 'v3', 'created': 'Tue, 4 Jun 2013 10:34:25 GMT'}]",2013-06-05,"[['Andersson', 'Joel', ''], ['Strömberg', 'Jan-Olov', '']]","['compressive sensing', 'ℓ1-minimization', 'random sampling matrices', 'bounded orthogonal systems', 'restricted isometry property']"
19093,1712.02896,Eric Chu,Eric Chu and Deb Roy,Audio-Visual Sentiment Analysis for Learning Emotional Arcs in Movies,"Data Mining (ICDM), 2017 IEEE 17th International Conference on",,,,cs.CV cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Stories can have tremendous power -- not only useful for entertainment, they
can activate our interests and mobilize our actions. The degree to which a
story resonates with its audience may be in part reflected in the emotional
journey it takes the audience upon. In this paper, we use machine learning
methods to construct emotional arcs in movies, calculate families of arcs, and
demonstrate the ability for certain arcs to predict audience engagement. The
system is applied to Hollywood films and high quality shorts found on the web.
We begin by using deep convolutional neural networks for audio and visual
sentiment analysis. These models are trained on both new and existing
large-scale datasets, after which they can be used to compute separate audio
and visual emotional arcs. We then crowdsource annotations for 30-second video
clips extracted from highs and lows in the arcs in order to assess the
micro-level precision of the system, with precision measured in terms of
agreement in polarity between the system's predictions and annotators' ratings.
These annotations are also used to combine the audio and visual predictions.
Next, we look at macro-level characterizations of movies by investigating
whether there exist `universal shapes' of emotional arcs. In particular, we
develop a clustering approach to discover distinct classes of emotional arcs.
Finally, we show on a sample corpus of short web videos that certain emotional
arcs are statistically significant predictors of the number of comments a video
receives. These results suggest that the emotional arcs learned by our approach
successfully represent macroscopic aspects of a video story that drive audience
engagement. Such machine understanding could be used to predict audience
reactions to video stories, ultimately improving our ability as storytellers to
communicate with each other.
","[{'version': 'v1', 'created': 'Fri, 8 Dec 2017 00:27:08 GMT'}]",2017-12-11,"[['Chu', 'Eric', ''], ['Roy', 'Deb', '']]","['visual sentiment analysis', 'audio sentiment analysis', 'multimodal', 'emotions', 'emotional arcs', 'stories', 'video']"
19094,1603.03968,S. Morteza Safdarnejad,"S. Morteza Safdarnejad, Yousef Atoum, Xiaoming Liu","Temporally Robust Global Motion Compensation by Keypoint-based
  Congealing",14 Pages,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Global motion compensation (GMC) removes the impact of camera motion and
creates a video in which the background appears static over the progression of
time. Various vision problems, such as human activity recognition, background
reconstruction, and multi-object tracking can benefit from GMC. Existing GMC
algorithms rely on sequentially processing consecutive frames, by estimating
the transformation mapping the two frames, and obtaining a composite
transformation to a global motion compensated coordinate. Sequential GMC
suffers from temporal drift of frames from the accurate global coordinate, due
to either error accumulation or sporadic failures of motion estimation at a few
frames. We propose a temporally robust global motion compensation (TRGMC)
algorithm which performs accurate and stable GMC, despite complicated and
long-term camera motion. TRGMC densely connects pairs of frames, by matching
local keypoints of each frame. A joint alignment of these frames is formulated
as a novel keypoint-based congealing problem, where the transformation of each
frame is updated iteratively, such that the spatial coordinates for the start
and end points of matched keypoints are identical. Experimental results
demonstrate that TRGMC has superior performance in a wide range of scenarios.
","[{'version': 'v1', 'created': 'Sat, 12 Mar 2016 21:42:18 GMT'}]",2016-03-15,"[['Safdarnejad', 'S. Morteza', ''], ['Atoum', 'Yousef', ''], ['Liu', 'Xiaoming', '']]","['Global motion compensation', 'Congealing', 'Motion panorama']"
19095,1209.5520,Hamza Jeljeli,Hamza Jeljeli (INRIA Nancy - Grand Est / LORIA),Accelerating Iterative SpMV for Discrete Logarithm Problem Using GPUs,"International Workshop on the Arithmetic of Finite Fields WAIFI 2014,
  Sep 2014, Gebze, Turkey. \&lt;http://waifi.org/\&gt;",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the context of cryptanalysis, computing discrete logarithms in large
cyclic groups using index-calculus-based methods, such as the number field
sieve or the function field sieve, requires solving large sparse systems of
linear equations modulo the group order. Most of the fast algorithms used to
solve such systems --- e.g., the conjugate gradient or the Lanczos and
Wiedemann algorithms --- iterate a product of the corresponding sparse matrix
with a vector (SpMV). This central operation can be accelerated on GPUs using
specific computing models and addressing patterns, which increase the
arithmetic intensity while reducing irregular memory accesses. In this work, we
investigate the implementation of SpMV kernels on NVIDIA GPUs, for several
representations of the sparse matrix in memory. We explore the use of Residue
Number System (RNS) arithmetic to accelerate modular operations. We target
linear systems arising when attacking the discrete logarithm problem on groups
of size 100 to 1000 bits, which includes the relevant range for current
cryptanalytic computations. The proposed SpMV implementation contributed to
solving the discrete logarithm problem in GF($2^{619}$) and GF($2^{809}$) using
the FFS algorithm.
","[{'version': 'v1', 'created': 'Tue, 25 Sep 2012 07:37:11 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Oct 2012 12:38:02 GMT'}, {'version': 'v3', 'created': 'Mon, 23 Sep 2013 11:45:02 GMT'}, {'version': 'v4', 'created': 'Thu, 4 Dec 2014 19:23:53 GMT'}]",2014-12-05,"[['Jeljeli', 'Hamza', '', 'INRIA Nancy - Grand Est / LORIA']]","['Discrete Logarithm Problem', 'Sparse-Matrix–Vector product', 'Modular Arithmetic', 'Residue Number System', 'GPUs']"
19096,1005.3185,Isabel Rodet,"Jean-Loup Florens (ACROE), Alina Voda (LAG), Daniela Urma (ICA)",Dynamical issues in interactive representation of physical objects,,"EuroHaptics 2006, Paris : France (2006)",,,cs.GR cs.HC cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The quality of a simulator equipped with a haptic interface is given by the
dynamical properties of its components: haptic interface, simulator and control
system. Some application areas of such kind of simulator like musical
synthesis, animation or more general, instrumental art have specific
requirements as for the ""haptic rendering"" of small movements that go beyond
the usual haptic interfaces allow. Object properties variability and different
situations of object combination represent important aspects of such type of
application which makes that the user can be interested as much in the
restitution of certain global properties of an entire object domain as in the
restitution of properties that are specific to an isolate object. In the
traditional approaches, the usual criteria are founded on the paradigm of
transparency and are related to the impedance error introduced by the technical
aspects of the system. As a general aim, rather than to minimize these effects,
we look to characterize them by physical metaphors conferring to haptic medium
the role of a tool. This positioning leads to firstly analyze the natural human
object interaction as a simplified evolutive system and then considers its
synthesis in the case of the interactive physical simulation. By means of a
frequential method, this approach is presented for some elementary
configurations of the simulator
","[{'version': 'v1', 'created': 'Tue, 18 May 2010 13:08:00 GMT'}]",2010-05-20,"[['Florens', 'Jean-Loup', '', 'ACROE'], ['Voda', 'Alina', '', 'LAG'], ['Urma', 'Daniela', '', 'ICA']]","['transparency', 'haptic interface', 'sampled system', 'physical modeling', 'metaphor']"
19097,1603.09570,Dibyayan Chakraborty,"Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen",On local structures of cubicity 2 graphs,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A 2-stab unit interval graph (2SUIG) is an axes-parallel unit square
intersection graph where the unit squares intersect either of the two fixed
lines parallel to the $X$-axis, distance $1 + \epsilon$ ($0 < \epsilon < 1$)
apart. This family of graphs allow us to study local structures of unit square
intersection graphs, that is, graphs with cubicity 2. The complexity of
determining whether a tree has cubicity 2 is unknown while the graph
recognition problem for unit square intersection graph is known to be NP-hard.
We present a polynomial time algorithm for recognizing trees that admit a 2SUIG
representation.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2016 13:07:25 GMT'}]",2016-04-01,"[['Bhore', 'Sujoy Kumar', ''], ['Chakraborty', 'Dibyayan', ''], ['Das', 'Sandip', ''], ['Sen', 'Sagnik', '']]","['cubicity', 'geometric intersection graph', 'unit square intersection graph', '2-stabunit interval graph']"
19098,0908.2222,Gerald Krafft,"Gerald Krafft, Vladimir Getov",Transaction-Oriented Simulation In Ad Hoc Grids: Design and Experience,"7 pages, 6 figures, 1 tables, Proceedings of the 2008 High
  Performance Computing and Simulation Conference (HPCS 2008), 3 - 6 June 2008,
  Nicosia, Cyprus. pp. 38-44; http://westminsterresearch.wmin.ac.uk/5341/",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we analyse the requirements of performing parallel
transaction-oriented simulations within loosely coupled systems like ad hoc
grids. We focus especially on the space-parallel approach to parallel
simulation and on discrete event synchronisation algorithms that are suitable
for transaction-oriented simulation and the target environment of ad hoc grids.
To demonstrate our findings, a Java-based parallel simulator for the
transaction-oriented language GPSS/H is implemented on the basis of the most
promising shock-resistant Time Warp (SRTW) synchronisation algorithm and using
the grid framework ProActive. The analysis of our parallel simulator, based on
experiments using the Grid5000 platform, shows that the SRTW algorithm can
successfully reduce the number of rolled back transaction moves but it also
reveals circumstances in which the SRTW algorithm can be outperformed by the
normal Time Warp algorithm. Finally, possible improvements to the SRTW
algorithm are proposed in order to avoid such problems.
","[{'version': 'v1', 'created': 'Sun, 16 Aug 2009 08:30:48 GMT'}]",2009-08-18,"[['Krafft', 'Gerald', ''], ['Getov', 'Vladimir', '']]","['Distributed simulation', 'transaction-oriented simulation', 'grid and cluster computing', 'shock-resistant Time Warp']"
19099,1504.04884,Ramon Ferrer i Cancho,"R. Ferrer-i-Cancho, C. Bentz and C. Seguin",Compression and the origins of Zipf's law of abbreviation,"New results for optimal non-singular coding have been added; some
  sections have been reorganized",,,,cs.IT cs.CL cs.SI math.IT physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Languages across the world exhibit Zipf's law of abbreviation, namely more
frequent words tend to be shorter. The generalized version of the law - an
inverse relationship between the frequency of a unit and its magnitude - holds
also for the behaviours of other species and the genetic code. The apparent
universality of this pattern in human language and its ubiquity in other
domains calls for a theoretical understanding of its origins. To this end, we
generalize the information theoretic concept of mean code length as a mean
energetic cost function over the probability and the magnitude of the types of
the repertoire. We show that the minimization of that cost function and a
negative correlation between probability and the magnitude of types are
intimately related.
","[{'version': 'v1', 'created': 'Sun, 19 Apr 2015 20:57:11 GMT'}, {'version': 'v2', 'created': 'Sat, 3 Oct 2015 07:33:50 GMT'}, {'version': 'v3', 'created': 'Wed, 4 May 2016 15:56:03 GMT'}]",2016-05-05,"[['Ferrer-i-Cancho', 'R.', ''], ['Bentz', 'C.', ''], ['Seguin', 'C.', '']]","['Zipf’s law of abbreviation', 'compression', 'information theory', 'language', 'animal behaviour']"
19100,1108.4551,Tshilidzi Marwala,"Mlungisi Duma, Bhekisipho Twala, Tshilidzi Marwala","Improving the performance of the ripper in insurance risk classification
  : A comparitive study using feature selection","ICINCO 2011: 8th International Conference on Informatics in Control,
  Automation and Robotics",,,,cs.LG cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Ripper algorithm is designed to generate rule sets for large datasets
with many features. However, it was shown that the algorithm struggles with
classification performance in the presence of missing data. The algorithm
struggles to classify instances when the quality of the data deteriorates as a
result of increasing missing data. In this paper, a feature selection technique
is used to help improve the classification performance of the Ripper model.
Principal component analysis and evidence automatic relevance determination
techniques are used to improve the performance. A comparison is done to see
which technique helps the algorithm improve the most. Training datasets with
completely observable data were used to construct the model and testing
datasets with missing values were used for measuring accuracy. The results
showed that principal component analysis is a better feature selection for the
Ripper in improving the classification performance.
","[{'version': 'v1', 'created': 'Tue, 23 Aug 2011 10:52:18 GMT'}]",2011-08-24,"[['Duma', 'Mlungisi', ''], ['Twala', 'Bhekisipho', ''], ['Marwala', 'Tshilidzi', '']]","['Ripper', 'principal component analysis', 'automatic relevance determination', 'artificial neural network', 'missing data']"
19101,1410.2388,Asghar Asgharian Sardroud,Asghar Asgharian Sardroud and Alireza Bagheri,Unit-length embedding of cycles and paths on grid graphs,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although there are very algorithms for embedding graphs on unbounded grids,
only few results on embedding or drawing graphs on restricted grids has been
published. In this work, we consider the problem of embedding paths and cycles
on grid graphs. We give the necessary and sufficient conditions for the
existence of cycles of given length $k$ and paths of given length $k$ between
two given vertices in $n$-vertex rectangular grid graphs and introduce two
algorithms with running times O$(k)$ and O$(k^2)$ for finding respectively such
cycles and paths. Also, we extend our results to $m\times n\times o$ 3D grids.
Our method for finding cycle of length $k$ in rectangular grid graphs also
introduces a linear-time algorithm for finding cycles of a given length $k$ in
hamiltonian solid grid graphs.
","[{'version': 'v1', 'created': 'Thu, 9 Oct 2014 08:52:23 GMT'}]",2014-10-10,"[['Sardroud', 'Asghar Asgharian', ''], ['Bagheri', 'Alireza', '']]","['Grid graphs', 'Rectangular grid graphs', '3D grids', 'Hamiltonian path', 'Hamiltonian cycle', 'Longest Path']"
19102,2007.05181,Yongseok Choi,"Yunho Jeon, Yongseok Choi, Jaesun Park, Subin Yi, Dongyeon Cho, Jiwon
  Kim","Sample-based Regularization: A Transfer Learning Strategy Toward Better
  Generalization",,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Training a deep neural network with a small amount of data is a challenging
problem as it is vulnerable to overfitting. However, one of the practical
difficulties that we often face is to collect many samples. Transfer learning
is a cost-effective solution to this problem. By using the source model trained
with a large-scale dataset, the target model can alleviate the overfitting
originated from the lack of training data. Resorting to the ability of
generalization of the source model, several methods proposed to use the source
knowledge during the whole training procedure. However, this is likely to
restrict the potential of the target model and some transferred knowledge from
the source can interfere with the training procedure. For improving the
generalization performance of the target model with a few training samples, we
proposed a regularization method called sample-based regularization (SBR),
which does not rely on the source's knowledge during training. With SBR, we
suggested a new training framework for transfer learning. Experimental results
showed that our framework outperformed existing methods in various
configurations.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 06:02:05 GMT'}]",2020-07-13,"[['Jeon', 'Yunho', ''], ['Choi', 'Yongseok', ''], ['Park', 'Jaesun', ''], ['Yi', 'Subin', ''], ['Cho', 'Dongyeon', ''], ['Kim', 'Jiwon', '']]","['transfer learning', 'small dataset', 'sample-based regularization', 'pairwise similarity']"
19103,1107.4077,Wojciech Mazurczyk,Wojciech Mazurczyk and Krzysztof Szczypiorski,Is Cloud Computing Steganography-proof?,"2 pages, 1 figure",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper focuses on characterisation of information hiding possibilities in
Cloud Computing. After general introduction to cloud computing and its security
we move to brief description of steganography. In particular we introduce
classification of steganographic communication scenarios in cloud computing
which is based on location of the steganograms receiver. These scenarios as
well as the threats that steganographic methods can cause must be taken into
account when designing secure cloud computing services.
","[{'version': 'v1', 'created': 'Wed, 20 Jul 2011 19:18:36 GMT'}]",2011-07-21,"[['Mazurczyk', 'Wojciech', ''], ['Szczypiorski', 'Krzysztof', '']]","['network security', 'steganography', 'cloud computing']"
19104,1602.06648,Sung-Ha Hwang,"Sung-Ha Hwang, Luc Rey-Bellet","Strategic Decompositions of Normal Form Games: Zero-sum Games and
  Potential Games",,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study new classes of games, called zero-sum equivalent games and zero-sum
equivalent potential games, and prove decomposition theorems involving these
classes of games. We say that two games are ""strategically equivalent"" if, for
every player, the payoff differences between two strategies (holding other
players' strategies fixed) are identical. A zero-sum equivalent game is a game
that is strategically equivalent to a zero-sum game; a zero-sum equivalent
potential game is a zero-sum equivalent game that is strategically equivalent
to a common interest game. We also call a game ""normalized"" if the sum of one
player's payoffs, given the other players' strategies, is always zero. We show
that any normal form game can be uniquely decomposed into either (i) a zero-sum
equivalent game and a normalized common interest game, or (ii) a zero-sum
equivalent potential game, a normalized zero-sum game, and a normalized common
interest game, each with distinctive equilibrium properties. For example, we
show that two-player zero-sum equivalent games with finite strategy sets
generically have a unique Nash equilibrium and that two-player zero-sum
equivalent potential games with finite strategy sets generically have a
strictly dominant Nash equilibrium.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2016 05:07:23 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Jan 2017 21:27:54 GMT'}, {'version': 'v3', 'created': 'Tue, 19 May 2020 03:36:51 GMT'}]",2020-05-20,"[['Hwang', 'Sung-Ha', ''], ['Rey-Bellet', 'Luc', '']]","['decomposition', 'zero-sum games', 'potential games']"
19105,1702.04300,Gabriel Haeser,"Gabriel Haeser, Hongcheng Liu, Yinyu Ye","Optimality condition and complexity analysis for linearly-constrained
  optimization without differentiability on the boundary",,,,,cs.CC math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider the minimization of a continuous function that is
potentially not differentiable or not twice differentiable on the boundary of
the feasible region. By exploiting an interior point technique, we present
first- and second-order optimality conditions for this problem that reduces to
classical ones when the derivative on the boundary is available. For this type
of problems, existing necessary conditions often rely on the notion of
subdifferential or become non-trivially weaker than the KKT condition in the
(twice-)differentiable counterpart problems. In contrast, this paper presents a
new set of first- and second-order necessary conditions that are derived
without the use of subdifferential and reduces to exactly the KKT condition
when (twice-)differentiability holds. As a result, these conditions are
stronger than some existing ones considered for the discussed minimization
problem when only non-negativity constraints are present. To solve for these
optimality conditions in the special but important case of linearly constrained
problems, we present two novel interior trust-region point algorithms and show
that their worst-case computational efficiency in achieving the potentially
stronger optimality conditions match the best known complexity bounds. Since
this work considers a more general problem than the literature, our results
also indicate that best known complexity bounds hold for a wider class of
nonlinear programming problems.
","[{'version': 'v1', 'created': 'Tue, 14 Feb 2017 17:23:31 GMT'}]",2017-02-15,"[['Haeser', 'Gabriel', ''], ['Liu', 'Hongcheng', ''], ['Ye', 'Yinyu', '']]","['Constrained optimization', 'Nonconvex programming', 'Interior point method', 'First order algorithm', 'Nonsmooth problems']"
19106,1501.02967,Thanh Bui,Thanh Bui,Analysis of Docker Security,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the last few years, the use of virtualization technologies has increased
dramatically. This makes the demand for efficient and secure virtualization
solutions become more obvious. Container-based virtualization and
hypervisor-based virtualization are two main types of virtualization
technologies that have emerged to the market. Of these two classes,
container-based virtualization is able to provide a more lightweight and
efficient virtual environment, but not without security concerns. In this
paper, we analyze the security level of Docker, a well-known representative of
container-based approaches. The analysis considers two areas: (1) the internal
security of Docker, and (2) how Docker interacts with the security features of
the Linux kernel, such as SELinux and AppArmor, in order to harden the host
system. Furthermore, the paper also discusses and identifies what could be done
when using Docker to increase its level of security.
","[{'version': 'v1', 'created': 'Tue, 13 Jan 2015 11:44:02 GMT'}]",2015-01-14,"[['Bui', 'Thanh', '']]","['Containers', 'Docker', 'Security']"
19107,1505.07054,Paolo Galeazzi,"Paolo Galeazzi, Michael Franke",Smart Transformations: The Evolution of Choice Principles,,,,,cs.GT,http://creativecommons.org/licenses/by/3.0/,"  Evolutionary game theory classically investigates which behavioral patterns
are evolutionarily successful in a single game. More recently, a number of
contributions have studied the evolution of preferences instead: which
subjective conceptualizations of a game's payoffs give rise to evolutionarily
successful behavior in a single game. Here, we want to extend this existing
approach even further by asking: which general patterns of subjective
conceptualizations of payoff functions are evolutionarily successful across a
class of games. In other words, we will look at evolutionary competition of
payoff transformations in ""meta-games"", obtained from averaging over payoffs of
single games. Focusing for a start on the class of 2x2 symmetric games, we show
that regret minimization can outperform payoff maximization if agents resort to
a security strategy in case of radical uncertainty.
","[{'version': 'v1', 'created': 'Thu, 30 Apr 2015 14:59:02 GMT'}]",2015-05-27,"[['Galeazzi', 'Paolo', ''], ['Franke', 'Michael', '']]","['evolution of preferences', 'evolutionary game theory', 'rationality norms', 'ecologicalrationality', 'meta-games', 'evolutionary dynamics']"
19108,1506.02833,Albert Saa-Garriga,Albert Sa\`a-Garriga and David Castells-Rufas and Jordi Carrabina,"OMP2HMPP: Compiler Framework for Energy Performance Trade-off Analysis
  of Automatically Generated Codes",,"IJCSI International Journal of Computer Science Issues, Volume 12,
  Issue 2, March 2015",,,cs.DC cs.PF cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present OMP2HMPP, a tool that, in a first step, automatically translates
OpenMP code into various possible transformations of HMPP. In a second step
OMP2HMPP executes all variants to obtain the performance and power consumption
of each transformation. The resulting trade-off can be used to choose the more
convenient version. After running the tool on a set of codes from the Polybench
benchmark we show that the best automatic transformation is equivalent to a
manual one done by an expert. Compared with original OpenMP code running in 2
quad-core processors we obtain an average speed-up of 31x and 5.86x factor in
operations per watt.
","[{'version': 'v1', 'created': 'Tue, 9 Jun 2015 09:24:38 GMT'}]",2015-06-10,"[['Saà-Garriga', 'Albert', ''], ['Castells-Rufas', 'David', ''], ['Carrabina', 'Jordi', '']]","['Source to source compiler', 'GPGPU', 'HMPP', 'parallel computing', 'program understanding', 'compiler optimization']"
19109,1511.05263,Ivens Portugal,"Ivens Portugal, Paulo Alencar, Donald Cowan","The Use of Machine Learning Algorithms in Recommender Systems: A
  Systematic Review",,,,,cs.SE cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender systems use algorithms to provide users with product or service
recommendations. Recently, these systems have been using machine learning
algorithms from the field of artificial intelligence. However, choosing a
suitable machine learning algorithm for a recommender system is difficult
because of the number of algorithms described in the literature. Researchers
and practitioners developing recommender systems are left with little
information about the current approaches in algorithm usage. Moreover, the
development of a recommender system using a machine learning algorithm often
has problems and open questions that must be evaluated, so software engineers
know where to focus research efforts. This paper presents a systematic review
of the literature that analyzes the use of machine learning algorithms in
recommender systems and identifies research opportunities for software
engineering research. The study concludes that Bayesian and decision tree
algorithms are widely used in recommender systems because of their relative
simplicity, and that requirement and design phases of recommender system
development appear to offer opportunities for further research.
","[{'version': 'v1', 'created': 'Tue, 17 Nov 2015 03:14:46 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Dec 2015 14:38:22 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Jan 2016 15:36:32 GMT'}, {'version': 'v4', 'created': 'Wed, 24 Feb 2016 18:58:32 GMT'}]",2016-02-25,"[['Portugal', 'Ivens', ''], ['Alencar', 'Paulo', ''], ['Cowan', 'Donald', '']]","['recommender system', 'machine learning', 'systematic review']"
19110,1202.6291,Antonio Fern\'andez Anta,Jordi Arjona Aroca and Antonio Fern\'andez Anta,"Bisection (Band)Width of Product Networks with Application to Data
  Centers",,,,,cs.NI cs.DC cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The bisection width of interconnection networks has always been important in
parallel computing, since it bounds the amount of information that can be moved
from one side of a network to another, i.e., the bisection bandwidth. Finding
its exact value has proven to be challenging for some network families. For
instance, the problem of finding the exact bisection width of the
multidimensional torus was posed by Leighton and has remained open for almost
20 years. In this paper we provide the exact value of the bisection width of
the torus, as well as of several d-dimensional classical parallel topologies
that can be obtained by the application of the Cartesian product of graphs. To
do so, we first provide two general results that allow to obtain upper and
lower bounds on the bisection width of a product graph as a function of some
properties of its factor graphs. We also apply these results to obtain bounds
for the bisection bandwidth of a d-dimensional BCube network, a recently
proposed topology for data centers.
","[{'version': 'v1', 'created': 'Tue, 28 Feb 2012 17:19:56 GMT'}]",2012-02-29,"[['Aroca', 'Jordi Arjona', ''], ['Anta', 'Antonio Fernández', '']]","['Bisection bandwidth', 'bisection width', 'torus', 'BCube', 'product graphs', 'complete binary trees', 'extended trees', 'mesh-connected trees']"
19111,1506.02850,Giuseppe De Nittis,"Nicola Basilico, Giuseppe De Nittis, Nicola Gatti",Adversarial patrolling with spatially uncertain alarm signals,,,,,cs.AI cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When securing complex infrastructures or large environments, constant
surveillance of every area is not affordable. To cope with this issue, a common
countermeasure is the usage of cheap but wide-ranged sensors, able to detect
suspicious events that occur in large areas, supporting patrollers to improve
the effectiveness of their strategies. However, such sensors are commonly
affected by uncertainty. In the present paper, we focus on spatially uncertain
alarm signals. That is, the alarm system is able to detect an attack but it is
uncertain on the exact position where the attack is taking place. This is
common when the area to be secured is wide such as in border patrolling and
fair site surveillance. We propose, to the best of our knowledge, the first
Patrolling Security Game model where a Defender is supported by a spatially
uncertain alarm system which non-deterministically generates signals once a
target is under attack. We show that finding the optimal strategy in arbitrary
graphs is APX-hard even in zero-sum games and we provide two (exponential time)
exact algorithms and two (polynomial time) approximation algorithms.
Furthermore, we analyse what happens in environments with special topologies,
showing that in linear and cycle graphs the optimal patrolling strategy can be
found in polynomial time, de facto allowing our algorithms to be used in
real-life scenarios, while in trees the problem is NP-hard. Finally, we show
that without false positives and missed detections, the best patrolling
strategy reduces to stay in a place, wait for a signal, and respond to it at
best. This strategy is optimal even with non-negligible missed detection rates,
which, unfortunately, affect every commercial alarm system. We evaluate our
methods in simulation, assessing both quantitative and qualitative aspects.
","[{'version': 'v1', 'created': 'Tue, 9 Jun 2015 10:22:43 GMT'}]",2015-06-10,"[['Basilico', 'Nicola', ''], ['De Nittis', 'Giuseppe', ''], ['Gatti', 'Nicola', '']]","['Security Games', 'Adversarial Patrolling', 'Algorithmic Game Theory']"
19112,1008.2841,S. Mehta,S. Mehta and K.S. Kwak,"Comparison of different Broadcast Schemes for Multi-Hop Wireless Sensor
  Networks",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present the performance of different broadcast schemes for
multihop sensor networks based on mathematical modeling. In near future many
applications will demand multicast (Broadcast) communication feature from the
sensor networks. This broadcast feature does not use virtual carrier sensing
but relies on physical carrier sensing to reduce collision. For this paper, we
analyze the different broadcast schemes for multihop wireless sensor networks
and also calculated the achievable throughput.
","[{'version': 'v1', 'created': 'Tue, 17 Aug 2010 07:50:55 GMT'}]",2010-08-18,"[['Mehta', 'S.', ''], ['Kwak', 'K. S.', '']]","['Wireless Sensor networks', 'Broadcast', 'MAC protocol', 'Multi-hop communication']"
19113,1412.2106,Wojciech Kot{\l}owski,Wojciech Kot{\l}owski,Consistent optimization of AMS by logistic loss minimization,"9 pages, HEPML workshop at NIPS 2014",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we theoretically justify an approach popular among
participants of the Higgs Boson Machine Learning Challenge to optimize
approximate median significance (AMS). The approach is based on the following
two-stage procedure. First, a real-valued function is learned by minimizing a
surrogate loss for binary classification, such as logistic loss, on the
training sample. Then, a threshold is tuned on a separate validation sample, by
direct optimization of AMS. We show that the regret of the resulting
(thresholded) classifier measured with respect to the squared AMS, is
upperbounded by the regret of the underlying real-valued function measured with
respect to the logistic loss. Hence, we prove that minimizing logistic
surrogate is a consistent method of optimizing AMS.
","[{'version': 'v1', 'created': 'Fri, 5 Dec 2014 19:28:15 GMT'}]",2014-12-08,"[['Kotłowski', 'Wojciech', '']]","['Approximate median significance (AMS)', 'Higgs Boson Machine LearningChallenge', 'Kaggle', 'logistic loss', 'regret bound', 'statistical consistency']"
19114,1610.00845,Yun Fan,"Yun Fan, Liang Zhang",Isometrically Self-dual Cyclic Codes,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  General isometries of cyclic codes, including multipliers and translations,
are introduced; and isometrically self-dual cyclic codes are defined. In terms
of Type-I duadic splittings given by multipliers and translations, a necessary
and sufficient condition for the existence of isometrically self-dual cyclic
codes is obtained. A program to construct isometrically self-dual cyclic codes
is provided, and illustrated by several examples. In particular, a class of
isometrically self-dual MDS cyclic codes, which are alternant codes from a
class of generalized Reed-Solomon codes, is presented.
","[{'version': 'v1', 'created': 'Tue, 4 Oct 2016 05:08:56 GMT'}]",2016-10-05,"[['Fan', 'Yun', ''], ['Zhang', 'Liang', '']]","['cyclic code', 'isometry', 'isometrically self-dual', 'MDS cycliccodes']"
19115,1607.03238,Vishwesh Jatala,"Vishwesh Jatala, Jayvant Anantpur, Amey Karkare",Scratchpad Sharing in GPUs,,,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  GPGPU applications exploit on-chip scratchpad memory available in the
Graphics Processing Units (GPUs) to improve performance. The amount of thread
level parallelism present in the GPU is limited by the number of resident
threads, which in turn depends on the availability of scratchpad memory in its
streaming multiprocessor (SM). Since the scratchpad memory is allocated at
thread block granularity, part of the memory may remain unutilized. In this
paper, we propose architectural and compiler optimizations to improve the
scratchpad utilization. Our approach, Scratchpad Sharing, addresses scratchpad
under-utilization by launching additional thread blocks in each SM. These
thread blocks use unutilized scratchpad and also share scratchpad with other
resident blocks. To improve the performance of scratchpad sharing, we propose
Owner Warp First (OWF) scheduling that schedules warps from the additional
thread blocks effectively. The performance of this approach, however, is
limited by the availability of the shared part of scratchpad.
  We propose compiler optimizations to improve the availability of shared
scratchpad. We describe a scratchpad allocation scheme that helps in allocating
scratchpad variables such that shared scratchpad is accessed for short
duration. We introduce a new instruction, relssp, that when executed, releases
the shared scratchpad. Finally, we describe an analysis for optimal placement
of relssp instructions such that shared scratchpad is released as early as
possible.
  We implemented the hardware changes using the GPGPU-Sim simulator and
implemented the compiler optimizations in Ocelot framework. We evaluated the
effectiveness of our approach on 19 kernels from 3 benchmarks suites: CUDA-SDK,
GPGPU-Sim, and Rodinia. The kernels that underutilize scratchpad memory show an
average improvement of 19% and maximum improvement of 92.17% compared to the
baseline approach.
","[{'version': 'v1', 'created': 'Tue, 12 Jul 2016 06:45:08 GMT'}, {'version': 'v2', 'created': 'Thu, 21 Jul 2016 05:58:07 GMT'}, {'version': 'v3', 'created': 'Sat, 15 Oct 2016 08:05:51 GMT'}, {'version': 'v4', 'created': 'Sat, 17 Dec 2016 13:55:19 GMT'}, {'version': 'v5', 'created': 'Sun, 12 Feb 2017 06:50:55 GMT'}]",2017-02-14,"[['Jatala', 'Vishwesh', ''], ['Anantpur', 'Jayvant', ''], ['Karkare', 'Amey', '']]","['Scratchpad Sharing', 'Thread Level Parallelism', 'Control Flow Graph', 'Code Motion']"
19116,1401.6404,Ankit Sharma,"Ankit Sharma, Jaideep Srivastava and Abhishek Chandra",Predicting Multi-actor collaborations using Hypergraphs,,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social networks are now ubiquitous and most of them contain interactions
involving multiple actors (groups) like author collaborations, teams or emails
in an organizations, etc. Hypergraphs are natural structures to effectively
capture multi-actor interactions which conventional dyadic graphs fail to
capture. In this work the problem of predicting collaborations is addressed
while modeling the collaboration network as a hypergraph network. The problem
of predicting future multi-actor collaboration is mapped to hyperedge
prediction problem. Given that the higher order edge prediction is an
inherently hard problem, in this work we restrict to the task of predicting
edges (collaborations) that have already been observed in past. In this work,
we propose a novel use of hyperincidence temporal tensors to capture time
varying hypergraphs and provides a tensor decomposition based prediction
algorithm. We quantitatively compare the performance of the hypergraphs based
approach with the conventional dyadic graph based approach. Our hypothesis that
hypergraphs preserve the information that simple graphs destroy is corroborated
by experiments using author collaboration network from the DBLP dataset. Our
results demonstrate the strength of hypergraph based approach to predict higher
order collaborations (size>4) which is very difficult using dyadic graph based
approach. Moreover, while predicting collaborations of size>2 hypergraphs in
most cases provide better results with an average increase of approx. 45% in
F-Score for different sizes = {3,4,5,6,7}.
","[{'version': 'v1', 'created': 'Fri, 24 Jan 2014 17:10:16 GMT'}]",2014-01-27,"[['Sharma', 'Ankit', ''], ['Srivastava', 'Jaideep', ''], ['Chandra', 'Abhishek', '']]","['Collaboration networks', 'social networks', 'link prediction', 'tensors', 'hypergraphs', 'team formation']"
19117,0909.1147,Prabhulla Chandran Pillai,B Prabhulla Chandran Pillai,"Empowering OLAC Extension using Anusaaraka and Effective text processing
  using Double Byte coding","5 Pages, 4 figures",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper reviews the hurdles while trying to implement the OLAC extension
for Dravidian / Indian languages. The paper further explores the possibilities
which could minimise or solve these problems. In this context, the Chinese
system of text processing and the anusaaraka system are scrutinised.
","[{'version': 'v1', 'created': 'Mon, 7 Sep 2009 06:29:51 GMT'}]",2009-09-08,"[['Pillai', 'B Prabhulla Chandran', '']]","['Indian language', 'OLAC', 'Text Processing', 'Machine Translation', 'Anusaaraka']"
19118,1802.06299,Martin Christiansen,"Martin Peter Christiansen, Peter Gorm Larsen, Rasmus Nyholm
  J{\o}rgensen",Robotic design choice overview using co-simulation,"5 pages, 4 figures, conference",,,"Agromek and NJF joint seminar (2014), 41-45",cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rapid robotic system development sets a demand for multi-disciplinary methods
and tools to explore and compare design alternatives. In this paper, we present
collaborative modeling that combines discrete-event models of controller
software with continuous-time models of physical robot components. The
presented co-modeling method utilized VDM for discrete-event and 20-sim for
continuous-time modeling. The collaborative modeling method is illustrated with
a concrete example of collaborative model development of a mobile robot animal
feeding system. Simulations are used to evaluate the robot model output
response in relation to operational demands. The result of the simulations
provides the developers with an overview of the impacts of each solution
instance in the chosen design space. Based on the solution overview the
developers can select candidates that are deemed viable to be deployed and
tested on an actual physical robot.
","[{'version': 'v1', 'created': 'Sat, 17 Feb 2018 21:36:41 GMT'}]",2018-02-20,"[['Christiansen', 'Martin Peter', ''], ['Larsen', 'Peter Gorm', ''], ['Jørgensen', 'Rasmus Nyholm', '']]","['Co-simulation', 'discrete event', 'continuous time', 'precision agriculture']"
19119,1402.2562,Nathalie Chaignaud,"Nathalie Chaignaud (LITIS), Val\'erie Delavigne (LiDiFra), Maryvonne
  Holzem (LiDiFra), Jean-Philippe Kotowicz (LITIS), Alain Loisel (LITIS)","\'Etude cognitive des processus de construction d'une requ\^ete dans un
  syst\`eme de gestion de connaissances m\'edicales",29 pages,Revue Revue Technique et Science Informatiques 29 (2010) 991-1021,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents the Cogni-CISMeF project, which aims at improving
medical information search in the CISMeF system (Catalog and Index of
French-language health resources) by including a conversational agent to
interact with the user in natural language. To study the cognitive processes
involved during the information search, a bottom-up methodology was adopted.
Experimentation has been set up to obtain human dialogs between a user (playing
the role of patient) dealing with medical information search and a CISMeF
expert refining the request. The analysis of these dialogs underlined the use
of discursive evidence: vocabulary, reformulation, implicit or explicit
expression of user intentions, conversational sequences, etc. A model of
artificial agent is proposed. It leads the user in its information search by
proposing to him examples, assistance and choices. This model was implemented
and integrated in the CISMeF system. ---- Cet article d\'ecrit le projet
Cogni-CISMeF qui propose un module de dialogue Homme-Machine \`a int\'egrer
dans le syst\`eme d'indexation de connaissances m\'edicales CISMeF (Catalogue
et Index des Sites M\'edicaux Francophones). Nous avons adopt\'e une d\'emarche
de mod\'elisation cognitive en proc\'edant \`a un recueil de corpus de
dialogues entre un utilisateur (jouant le r\^ole d'un patient) d\'esirant une
information m\'edicale et un expert CISMeF af inant cette demande pour
construire la requ\^ete. Nous avons analys\'e la structure des dialogues ainsi
obtenus et avons \'etudi\'e un certain nombre d'indices discursifs :
vocabulaire employ\'e, marques de reformulation, commentaires m\'eta et
\'epilinguistiques, expression implicite ou explicite des intentions de
l'utilisateur, encha\^inement conversationnel, etc. De cette analyse, nous
avons construit un mod\`ele d'agent artificiel dot\'e de capacit\'es cognitives
capables d'aider l'utilisateur dans sa t\^ache de recherche d'information. Ce
mod\`ele a \'et\'e impl\'ement\'e et int\'egr\'e dans le syst\`eme CISMeF.
","[{'version': 'v1', 'created': 'Mon, 10 Feb 2014 20:46:24 GMT'}]",2014-02-12,"[['Chaignaud', 'Nathalie', '', 'LITIS'], ['Delavigne', 'Valérie', '', 'LiDiFra'], ['Holzem', 'Maryvonne', '', 'LiDiFra'], ['Kotowicz', 'Jean-Philippe', '', 'LITIS'], ['Loisel', 'Alain', '', 'LITIS']]","['Interaction', 'human-computer dialog', 'cognitive modeling', 'corpus analysis']"
19120,1002.1195,Vishal Goyal,"T. R. GopalaKrishnan Nair, M. Dakshayini","Stochastic Model Based Proxy Servers Architecture for VoD to Achieve
  Reduced Client Waiting Time","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 3, January 2010,
  http://ijcsi.org/articles/Stochastic-Model-Based-Proxy-Servers-Architecture-for-VoD-to-Achieve-Reduced-Client-Waiting-Time.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 3, January 2010,
  http://ijcsi.org/articles/Stochastic-Model-Based-Proxy-Servers-Architecture-for-VoD-to-Achieve-Reduced-Client-Waiting-Time.php",,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a video on demand system, the main video repository may be far away from
the user and generally has limited streaming capacities. Since a high quality
video's size is huge, it requires high bandwidth for streaming over the
internet. In order to achieve a higher video hit ratio, reduced client waiting
time, distributed server's architecture can be used, in which multiple local
servers are placed close to clients and, based on their regional demands video
contents are cached dynamically from the main server. As the cost of proxy
server is decreasing and demand for reduced waiting time is increasing day by
day, newer architectures are explored, innovative schemes are arrived at. In
this paper we present novel 3 layer architecture, includes main multimedia
server, a Tracker and Proxy servers. This architecture targets to optimize the
client waiting time. We also propose an efficient prefix caching and load
sharing algorithm at the proxy server to allocate the cache according to
regional popularity of the video. The simulation results demonstrate that it
achieves significantly lower client's waiting time, when compared to the other
existing algorithms.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 10:54:05 GMT'}]",2010-02-08,"[['Nair', 'T. R. GopalaKrishnan', ''], ['Dakshayini', 'M.', '']]","['Video Streaming', 'Proxy prefix caching', 'video distribution', 'Load sharing', 'client waiting time']"
19121,1401.0200,Manjish  Pal,"Nabajyoti Medhi, Manjish Pal",Sixsoid: A new paradigm for $k$-coverage in 3D Wireless Sensor Networks,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Coverage in 3D wireless sensor network (WSN) is always a very critical issue
to deal with. Coming up with good coverage models implies more energy efficient
networks. $K$-coverage is one model that ensures that every point in a given 3D
Field of Interest (FoI) is guaranteed to be covered by $k$ sensors. When it
comes to 3D, coming up with a deployment of sensors that gurantees $k$-coverage
becomes much more complicated than in 2D. The basic idea is to come up with a
geometrical shape that is guaranteed to be $k$-covered by taking a specific
arrangement of sensors, and then fill the FoI will non-overlapping copies of
this shape. In this work, we propose a new shape for the 3D scenario which we
call a \textbf{Devilsoid}. Prior to this work, the shape which was proposed for
coverage in 3D was the so called \textbf{Reuleaux Tetrahedron}. Our
construction is motivated from a construction that can be applied to the 2D
version of the problem \cite{MS} in which it imples better guarantees over the
\textbf{Reuleaux Triangle}. Our contribution in this paper is twofold, firstly
we show how Devilsoid gurantees more coverage volume over Reuleaux Tetrahedron,
secondly we show how Devilsoid also guarantees simpler and more pragmatic
deployment strategy for 3D wireless sensor networks. In this paper, we show the
constuction of Devilsoid, calculate its volume and discuss its effect on the
$k$-coverage in WSN.
","[{'version': 'v1', 'created': 'Tue, 31 Dec 2013 18:15:28 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Feb 2014 06:09:40 GMT'}, {'version': 'v3', 'created': 'Wed, 3 Sep 2014 05:58:04 GMT'}]",2014-09-04,"[['Medhi', 'Nabajyoti', ''], ['Pal', 'Manjish', '']]","['Wireless Sensor Networks', 'k-coverage', 'ReuleauxTetrahedron', 'Sixsoid']"
19122,1504.06240,Hector Zenil,Fernando Soler-Toscano and Hector Zenil,"A Computable Measure of Algorithmic Probability by Finite Approximations
  with an Application to Integer Sequences",As accepted by the journal Complexity (Wiley/Hindawi),,,,cs.IT cs.CC cs.FL math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given the widespread use of lossless compression algorithms to approximate
algorithmic (Kolmogorov-Chaitin) complexity, and that lossless compression
algorithms fall short at characterizing patterns other than statistical ones
not different to entropy estimations, here we explore an alternative and
complementary approach. We study formal properties of a Levin-inspired measure
$m$ calculated from the output distribution of small Turing machines. We
introduce and justify finite approximations $m_k$ that have been used in some
applications as an alternative to lossless compression algorithms for
approximating algorithmic (Kolmogorov-Chaitin) complexity. We provide proofs of
the relevant properties of both $m$ and $m_k$ and compare them to Levin's
Universal Distribution. We provide error estimations of $m_k$ with respect to
$m$. Finally, we present an application to integer sequences from the Online
Encyclopedia of Integer Sequences which suggests that our AP-based measures may
characterize non-statistical patterns, and we report interesting correlations
with textual, function and program description lengths of the said sequences.
","[{'version': 'v1', 'created': 'Thu, 23 Apr 2015 16:20:58 GMT'}, {'version': 'v2', 'created': 'Sat, 24 Jun 2017 19:28:55 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Aug 2017 14:14:45 GMT'}]",2017-08-15,"[['Soler-Toscano', 'Fernando', ''], ['Zenil', 'Hector', '']]","['Kolmogorov-Chaitin complexity', 'algorithmic probability', 'algorithmic Coding Theorem', 'Turing machines', 'integer sequences']"
19123,0804.4075,Wan Ahmad Tajuddin Wan Abdullah,"Saratha Sathasivam (USM), Wan Ahmad Tajuddin Wan Abdullah (Univ
  Malaya)",Logic Learning in Hopfield Networks,To appear in Mod. Appl. Sci,,,,cs.LO cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Synaptic weights for neurons in logic programming can be calculated either by
using Hebbian learning or by Wan Abdullah's method. In other words, Hebbian
learning for governing events corresponding to some respective program clauses
is equivalent with learning using Wan Abdullah's method for the same respective
program clauses. In this paper we will evaluate experimentally the equivalence
between these two types of learning through computer simulations.
","[{'version': 'v1', 'created': 'Fri, 25 Apr 2008 09:46:46 GMT'}]",2008-04-28,"[['Sathasivam', 'Saratha', '', 'USM'], ['Abdullah', 'Wan Ahmad Tajuddin Wan', '', 'Univ\n  Malaya']]","['logic programming', 'Hebbian learning', 'Wan Abdullah’s method', 'program clauses']"
19124,1407.5764,Truyen Tran,"Tran The Truyen, Dinh Q. Phung and Svetha Venkatesh",Preference Networks: Probabilistic Models for Recommendation Systems,"In Proc. of 6th Australasian Data Mining Conference (AusDM), Gold
  Coast, Australia, pages 195--202, 2007",,,,cs.IR cs.SI stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender systems are important to help users select relevant and
personalised information over massive amounts of data available. We propose an
unified framework called Preference Network (PN) that jointly models various
types of domain knowledge for the task of recommendation. The PN is a
probabilistic model that systematically combines both content-based filtering
and collaborative filtering into a single conditional Markov random field. Once
estimated, it serves as a probabilistic database that supports various useful
queries such as rating prediction and top-$N$ recommendation. To handle the
challenging problem of learning large networks of users and items, we employ a
simple but effective pseudo-likelihood with regularisation. Experiments on the
movie rating data demonstrate the merits of the PN.
","[{'version': 'v1', 'created': 'Tue, 22 Jul 2014 07:17:48 GMT'}]",2014-07-23,"[['Truyen', 'Tran The', ''], ['Phung', 'Dinh Q.', ''], ['Venkatesh', 'Svetha', '']]","['Hybrid Recommender Systems', 'Collaborative Filtering', 'Preference Networks', 'Conditional Markov Networks', 'Movie Rating']"
19125,1107.3656,Mohamed Amnai,"Mohamed Amnai, Youssef Fakhri, Jaafar Abouchabaka","QoS Routing and Performance Evaluation for Mobile Ad Hoc Networks using
  OLSR Protocol",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile Ad-Hoc network is a collection of mobile nodes in communication
without using infrastructure. As the real-time applications used in today's
wireless network grow, we need some schemes to provide more suitable service
for them. We know that most of actual schemes do not perform well on traffic
which is not strictly CBR. Therefore, in this paper we have studied the impact,
respectively, of mobility models and the density of nodes on the performances
(End-to-End Delay, Throughput and Packet Delivery ratio) of routing protocol
(Optimized Link State Routing) OLSR by using in the first a real-time VBR
(MPEG-4) and secondly the Constant Bit Rate (CBR) traffic. Finally we compare
the performance on both cases. Experimentally, we considered the three mobility
models as follows Random Waypoint, Random Direction and Mobgen Steady State.
The experimental results illustrate that the behavior of OLSR change according
to the model and the used traffics.
","[{'version': 'v1', 'created': 'Tue, 19 Jul 2011 09:22:02 GMT'}]",2011-07-20,"[['Amnai', 'Mohamed', ''], ['Fakhri', 'Youssef', ''], ['Abouchabaka', 'Jaafar', '']]","['Mobility Models', 'OLSR', 'VBR', 'CBR', 'QoS', 'MANET']"
19126,1402.1757,Ron Rouhani,"Tao Mao, Laura Ray","Frequency-Based Patrolling with Heterogeneous Agents and Limited
  Communication",,,,,cs.MA cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates multi-agent frequencybased patrolling of
intersecting, circle graphs under conditions where graph nodes have non-uniform
visitation requirements and agents have limited ability to communicate. The
task is modeled as a partially observable Markov decision process, and a
reinforcement learning solution is developed. Each agent generates its own
policy from Markov chains, and policies are exchanged only when agents occupy
the same or adjacent nodes. This constraint on policy exchange models sparse
communication conditions over large, unstructured environments. Empirical
results provide perspectives on convergence properties, agent cooperation, and
generalization of learned patrolling policies to new instances of the task. The
emergent behavior indicates learned coordination strategies between
heterogeneous agents for patrolling large, unstructured regions as well as the
ability to generalize to dynamic variation in node visitation requirements.
","[{'version': 'v1', 'created': 'Fri, 7 Feb 2014 20:51:00 GMT'}]",2014-02-10,"[['Mao', 'Tao', ''], ['Ray', 'Laura', '']]","['Frequency-based patrolling', 'multi-agent systems', 'decentralized reinforcement learning']"
19127,1802.08726,Chi Nhan Duong,"Chi Nhan Duong, Khoa Luu, Kha Gia Quach, Tien D. Bui",Longitudinal Face Aging in the Wild - Recent Deep Learning Approaches,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Face Aging has raised considerable attentions and interest from the computer
vision community in recent years. Numerous approaches ranging from purely image
processing techniques to deep learning structures have been proposed in
literature. In this paper, we aim to give a review of recent developments of
modern deep learning based approaches, i.e. Deep Generative Models, for Face
Aging task. Their structures, formulation, learning algorithms as well as
synthesized results are also provided with systematic discussions. Moreover,
the aging databases used in most methods to learn the aging process are also
reviewed.
","[{'version': 'v1', 'created': 'Fri, 23 Feb 2018 20:29:50 GMT'}]",2018-02-27,"[['Duong', 'Chi Nhan', ''], ['Luu', 'Khoa', ''], ['Quach', 'Kha Gia', ''], ['Bui', 'Tien D.', '']]","['Face Aging', 'Face Age Progression', 'Deep Generative Models']"
19128,1511.01538,Grigore Stamatescu,Grigore Stamatescu,"Achieving Sensor Fusion for Collaborative Multi-level Monitoring of
  Pipeline Infrastructures","12 pages, 6 figures",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Large scale monitoring systems enable efficient field level data collection
at high temporal and spatial resolutions. One example is the deployment of such
systems in pipeline infrastructure applications which have to be monitored for
leaks and protected from unauthorized access, with the potential of causing
significant environmental and economic damage. The paper discusses a
multi-level system architecture for data collection and processing based on the
collaborative integration of wireless sensor networks and unmanned aerial
vehicles. Three sensor fusion methods: Kalman filtering, Fuzzy Sensor
Validation and Fusion (FUSVAF) and Consensus-based processing, are considered
for intelligent data reduction and situational awareness while alleviating
communication bottlenecks across the multi-level network. Simulation and
experimental results are presented.
","[{'version': 'v1', 'created': 'Wed, 4 Nov 2015 22:27:30 GMT'}]",2015-11-06,"[['Stamatescu', 'Grigore', '']]","['wireless sensor networks', 'unmanned aerial vehicles', 'collaborative monitoring', 'sensor integration', 'sensor fusion']"
19129,1407.7319,Xilun  Chen,Xilun Chen and Chenxia Wu,Price of Anarchy of Innovation Diffusion in Social Networks,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There have been great efforts in studying the cascading behavior in social
networks such as the innovation diffusion, etc. Game theoretically, in a social
network where individuals choose from two strategies: A (the innovation) and B
(the status quo) and get payoff from their neighbors for coordination, it has
long been known that the Price of Anarchy (PoA) of this game is not 1, since
the Nash equilibrium (NE) where all players take B (B Nash) is inferior to the
one all players taking A (A Nash). However, no quantitative analysis has been
performed to give an accurate upper bound of PoA in this game.
  In this paper, we adopt a widely used networked coordination game setting [3]
to study how bad a Nash equilibrium can be and give a tight upper bound of the
PoA of such games. We show that there is an NE that is slightly worse than the
B Nash. On the other hand, the PoA is bounded and the worst NE cannot be much
worse than the B Nash. In addition, we discuss how the PoA upper bound would
change when compatibility between A and B is introduced, and show an intuitive
result that the upper bound strictly decreases as the compatibility is
increased.
","[{'version': 'v1', 'created': 'Mon, 28 Jul 2014 04:40:45 GMT'}]",2014-07-29,"[['Chen', 'Xilun', ''], ['Wu', 'Chenxia', '']]","['Price of Anarchy', 'Social Cascading Behavior', 'InnovationDiffusion', 'Networked Coordination Game']"
19130,1606.03506,Dubravka Cecez-Kecmanovic,Dubravka Cecez-Kecmanovic and Olivera Marjanovic,"Ethical Implications of IT-enabled Information Flows Conceived as
  Intermediaries or Mediators","ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
  Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/195,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This paper contributes to a better understanding of ethical concerns
regarding the deployment of complex public sector IT systems and the
information flows they instigate. The paper aims to reveal how different views
on IT and IT-enabled information flows allow us to see differently their social
implications and to construe different ethical questions. This is achieved by
i) defining two opposing views on IT-enabled information flows as
'intermediaries' and 'mediators'; ii) by analysing the controversial case of My
School - a web portal that provides performance data of 9,500 Australian
schools - that introduces new information flows in the education sector; and
iii) by revealing and explaining how some unintended negative social
implications emerge and how the articulation of ethical concerns depends on the
view on My School-enabled information flows. The paper concludes with
theoretical and practical implications, with particular emphasis on
responsibilities of all involved, setting up foundations for an important area
of future IS research.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 00:08:22 GMT'}]",2016-06-14,"[['Cecez-Kecmanovic', 'Dubravka', ''], ['Marjanovic', 'Olivera', '']]","['Ethics', 'Public sector IT systems', 'Information flows as intermediaries', 'Information flows as mediators', 'Negative social effects']"
19131,0906.0857,Michael Weiss,"Enrico Formenti, Alberto Dennunzio and Michael Weiss",2D cellular automata: dynamics and undecidability,"24 pages, 12 figures. paper submitted to an international conference",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we introduce the notion of quasi-expansivity for 2D CA and we
show that it shares many properties with expansivity (that holds only for 1D
CA). Similarly, we introduce the notions of quasi-sensitivity and prove that
the classical dichotomy theorem holds in this new setting. Moreover, we show a
tight relation between closingness and openness for 2D CA. Finally, the
undecidability of closingness property for 2D CA is proved.
","[{'version': 'v1', 'created': 'Thu, 4 Jun 2009 10:14:01 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Sep 2009 15:58:08 GMT'}]",2009-09-29,"[['Formenti', 'Enrico', ''], ['Dennunzio', 'Alberto', ''], ['Weiss', 'Michael', '']]","['cellular automata', 'symbolic dynamics', '(un-)decidability', 'tilings']"
19132,1710.04203,Giannis Haralabopoulos,Giannis Haralabopoulos and Elena Simperl,"Crowdsourcing for Beyond Polarity Sentiment Analysis A Pure Emotion
  Lexicon","Keywords: Beyond Polarity, Pure Sentiment, Crowdsourcing, Sentiment
  Analysis, Lexicon Acquisition, Reddit, Twitter, Brexit [19 pages, 6 figures,
  4 tables]",,,,cs.CL cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sentiment analysis aims to uncover emotions conveyed through information. In
its simplest form, it is performed on a polarity basis, where the goal is to
classify information with positive or negative emotion. Recent research has
explored more nuanced ways to capture emotions that go beyond polarity. For
these methods to work, they require a critical resource: a lexicon that is
appropriate for the task at hand, in terms of the range of emotions it captures
diversity. In the past, sentiment analysis lexicons have been created by
experts, such as linguists and behavioural scientists, with strict rules.
Lexicon evaluation was also performed by experts or gold standards. In our
paper, we propose a crowdsourcing method for lexicon acquisition, which is
scalable, cost-effective, and doesn't require experts or gold standards. We
also compare crowd and expert evaluations of the lexicon, to assess the overall
lexicon quality, and the evaluation capabilities of the crowd.
","[{'version': 'v1', 'created': 'Wed, 4 Oct 2017 21:38:48 GMT'}]",2017-10-12,"[['Haralabopoulos', 'Giannis', ''], ['Simperl', 'Elena', '']]","['Beyond Polarity', 'Pure Sentiment', 'Crowdsourcing', 'SentimentAnalysis', 'Lexicon Acquisition', 'Reddit', 'Twitter', 'Brexit']"
19133,0801.3199,Ngoc-Diep Ho,"Ngoc-Diep Ho (1), Paul Van Dooren (1) and Vincent D. Blondel (1) ((1)
  Universit\'e catholique de Louvain, Belgium)",Descent methods for Nonnegative Matrix Factorization,"47 pages. New convergence proof using damped version of RRI. To
  appear in Numerical Linear Algebra in Signals, Systems and Control. Accepted.
  Illustrating Matlab code is included in the source bundle",,,2007.057,cs.NA cs.IR math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present several descent methods that can be applied to
nonnegative matrix factorization and we analyze a recently developped fast
block coordinate method called Rank-one Residue Iteration (RRI). We also give a
comparison of these different methods and show that the new block coordinate
method has better properties in terms of approximation error and complexity. By
interpreting this method as a rank-one approximation of the residue matrix, we
prove that it \emph{converges} and also extend it to the nonnegative tensor
factorization and introduce some variants of the method by imposing some
additional controllable constraints such as: sparsity, discreteness and
smoothness.
","[{'version': 'v1', 'created': 'Mon, 21 Jan 2008 15:46:43 GMT'}, {'version': 'v2', 'created': 'Wed, 20 Feb 2008 21:20:12 GMT'}, {'version': 'v3', 'created': 'Mon, 24 Aug 2009 22:32:24 GMT'}]",2009-08-25,"[['Ho', 'Ngoc-Diep', ''], ['Van Dooren', 'Paul', ''], ['Blondel', 'Vincent D.', '']]","['Algorithm', 'Nonnegative matrix', 'Factorization']"
19134,1701.08879,Zhenyi He,"Zhenyi He, Fengyuan Zhu, Aaron Gaudette, Ken Perlin",Robotic Haptic Proxies for Collaborative Virtual Reality,"7 page, 6 figures",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new approach for interaction in Virtual Reality (VR) using
mobile robots as proxies for haptic feedback. This approach allows VR users to
have the experience of sharing and manipulating tangible physical objects with
remote collaborators. Because participants do not directly observe the robotic
proxies, the mapping between them and the virtual objects is not required to be
direct. In this paper, we describe our implementation, various scenarios for
interaction, and a preliminary user study.
","[{'version': 'v1', 'created': 'Tue, 31 Jan 2017 00:24:10 GMT'}]",2017-02-01,"[['He', 'Zhenyi', ''], ['Zhu', 'Fengyuan', ''], ['Gaudette', 'Aaron', ''], ['Perlin', 'Ken', '']]","['H.5.1.Multimedia Information Systems Artificial', 'augmented', 'virtual realities; H.5']"
19135,1702.00477,Miqing Li,"Miqing Li, Xin Yao","Dominance Move: A Measure of Comparing Solution Sets in Multiobjective
  Optimization","23 pages, 10 figures",,,,cs.NE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the most common approaches for multiobjective optimization is to
generate a solution set that well approximates the whole Pareto-optimal
frontier to facilitate the later decision-making process. However, how to
evaluate and compare the quality of different solution sets remains
challenging. Existing measures typically require additional problem knowledge
and information, such as a reference point or a substituted set of the
Pareto-optimal frontier. In this paper, we propose a quality measure, called
dominance move (DoM), to compare solution sets generated by multiobjective
optimizers. Given two solution sets, DoM measures the minimum sum of move
distances for one set to weakly Pareto dominate the other set. DoM can be seen
as a natural reflection of the difference between two solutions, capturing all
aspects of solution sets' quality, being compliant with Pareto dominance, and
does not need any additional problem knowledge and parameters. We present an
exact method to calculate the DoM in the biobjective case. We show the
necessary condition of constructing the optimal partition for a solution set's
minimum move, and accordingly propose an efficient algorithm to recursively
calculate the DoM. Finally, DoM is evaluated on several groups of artificial
and real test cases as well as by a comparison with two well-established
quality measures.
","[{'version': 'v1', 'created': 'Wed, 1 Feb 2017 22:14:15 GMT'}]",2017-02-03,"[['Li', 'Miqing', ''], ['Yao', 'Xin', '']]","['multiple criteria', 'quality measure', 'metaheuristics']"
19136,1410.4377,Biju Issac,"B. Issac, K. Hamid and C.E. Tan","Hybrid Mobility Prediction of 802.11 Infrastructure Nodes by Location
  Tracking and Data Mining","16 pages, appears in Journal of Information Technology in Asia
  (JITA), 3(1). arXiv admin note: text overlap with arXiv:1410.4180",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In an IEEE 802.11 Infrastructure network, as the mobile node is moving from
one access point to another, the resource allocation and smooth hand off may be
a problem. If some reliable prediction is done on mobile nodes next move, then
resources can be allocated optimally as the mobile node moves around. This
would increase the performance throughput of wireless network. We plan to
investigate on a hybrid mobility prediction scheme that uses location tracking
and data mining to predict the future path of the mobile node. We also propose
a secure version of the same scheme. Through simulation and analysis, we
present the prediction accuracy of our proposal.
","[{'version': 'v1', 'created': 'Thu, 16 Oct 2014 11:37:41 GMT'}]",2014-10-17,"[['Issac', 'B.', ''], ['Hamid', 'K.', ''], ['Tan', 'C. E.', '']]","['Mobility prediction', 'mobility management', 'mobility patterns', 'location tracking', 'data mining']"
19137,1208.5281,Brendan Farrell,Holger Boche and Brendan Farrell and Michel Ledoux and Moritz Wiese,Expected Supremum of a Random Linear Combination of Shifted Kernels,To appear in the Journal of Fourier Analysis and Applications,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the expected supremum of a linear combination of shifts of the
sinc kernel with random coefficients. When the coefficients are Gaussian, the
expected supremum is of order \sqrt{\log n}, where n is the number of shifts.
When the coefficients are uniformly bounded, the expected supremum is of order
\log\log n. This is a noteworthy difference to orthonormal functions on the
unit interval, where the expected supremum is of order \sqrt{n\log n} for all
reasonable coefficient statistics.
","[{'version': 'v1', 'created': 'Mon, 27 Aug 2012 02:44:27 GMT'}]",2012-08-28,"[['Boche', 'Holger', ''], ['Farrell', 'Brendan', ''], ['Ledoux', 'Michel', ''], ['Wiese', 'Moritz', '']]","['Supremum', 'Sinc Kernel', 'Gaussian', 'Bernoulli Coefficients']"
19138,1710.04135,Safeeullah Soomro,"Mashooque Ahmed Memon, Safeeullah Soomro, Awais Khan Jumani and Muneer
  Ahmed Kartio",Big Data Analytics and Its Applications,45-54,"Annals of Emerging Technologies in Computing (AETiC), Volume 1,
  issue 1, 2017",,,cs.CY,http://creativecommons.org/licenses/by/4.0/,"  The term, Big Data, has been authored to refer to the extensive heave of data
that can't be managed by traditional data handling methods or techniques. The
field of Big Data plays an indispensable role in various fields, such as
agriculture, banking, data mining, education, chemistry, finance, cloud
computing, marketing, health care stocks. Big data analytics is the method for
looking at big data to reveal hidden patterns, incomprehensible relationship
and other important data that can be utilize to resolve on enhanced decisions.
There has been a perpetually expanding interest for big data because of its
fast development and since it covers different areas of applications. Apache
Hadoop open source technology created in Java and keeps running on Linux
working framework was used. The primary commitment of this exploration is to
display an effective and free solution for big data application in a
distributed environment, with its advantages and indicating its easy use. Later
on, there emerge to be a required for an analytical review of new developments
in the big data technology. Healthcare is one of the best concerns of the
world. Big data in healthcare imply to electronic health data sets that are
identified with patient healthcare and prosperity. Data in the healthcare area
is developing past managing limit of the healthcare associations and is relied
upon to increment fundamentally in the coming years.
","[{'version': 'v1', 'created': 'Mon, 9 Oct 2017 09:40:08 GMT'}]",2017-10-12,"[['Memon', 'Mashooque Ahmed', ''], ['Soomro', 'Safeeullah', ''], ['Jumani', 'Awais Khan', ''], ['Kartio', 'Muneer Ahmed', '']]","['Big Data; Big Data Analytics; Big Data Applications; Tools', 'Techniques; Challenges', 'Issues']"
19139,1107.3695,Abderrahim Bourouis,"Abderrahim Bourouis, Mohamed Feham and Abdelhamid Bouchachia",Ubiquitous Mobile Health Monitoring System for Elderly (UMHMSE),"9 pages,5 figures","International Journal of Computer Science & Information Technology
  (IJCSIT), Vol 3, No 3, June 2011",,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  Recent research in ubiquitous computing uses technologies of Body Area
Networks (BANs) to monitor the person's kinematics and physiological
parameters. In this paper we propose a real time mobile health system for
monitoring elderly patients from indoor or outdoor environments. The system
uses a bio- signal sensor worn by the patient and a Smartphone as a central
node. The sensor data is collected and transmitted to the intelligent server
through GPRS/UMTS to be analyzed. The prototype (UMHMSE) monitors the elderly
mobility, location and vital signs such as Sp02 and Heart Rate. Remote users
(family and medical personnel) might have a real time access to the collected
information through a web application.
","[{'version': 'v1', 'created': 'Tue, 19 Jul 2011 12:10:23 GMT'}]",2011-07-20,"[['Bourouis', 'Abderrahim', ''], ['Feham', 'Mohamed', ''], ['Bouchachia', 'Abdelhamid', '']]","['Ubiquitous health monitoring', 'Mobile Health Monitoring', 'Smartphone. Intelligent central sever', 'Location']"
19140,1704.06127,Nikolaos K Tselios,Anastasia Revythi and Nikolaos Tselios,"Extension of Technology Acceptance Model by using System Usability Scale
  to assess behavioral intention to use e-learning",5 pages,,,,cs.HC cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This study examines the acceptance of technology and behavioral intention to
use learning management systems (LMS). In specific, the aim of this research is
to examine whether students ultimately accept and use educational learning
systems such as e-class and the impact of behavioral intention on their
decision to use them. An extended version of technology acceptance model has
been proposed and used by employing the System Usability Scale to measure
perceived ease of use. 345 university students participated in the study and
the data analysis was based on partial least squares method. The results were
confirmed in most of the research hypotheses. In particular, social norm,
system access and self-efficacy significantly affect behavioral intention to
use. As a result, it is suggested that e-learning developers and stakeholders
should focus on these factors to increase acceptance and effectiveness of
learning management systems.
","[{'version': 'v1', 'created': 'Thu, 20 Apr 2017 13:18:08 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Aug 2017 13:29:13 GMT'}, {'version': 'v3', 'created': 'Tue, 6 Feb 2018 13:07:25 GMT'}, {'version': 'v4', 'created': 'Mon, 7 May 2018 22:23:13 GMT'}, {'version': 'v5', 'created': 'Fri, 1 Jun 2018 14:50:03 GMT'}]",2018-06-04,"[['Revythi', 'Anastasia', ''], ['Tselios', 'Nikolaos', '']]","['learning management system', 'behavioral intention to use', 'technology acceptance model', 'system usability scale', 'partial least squares']"
19141,1610.09231,Lican Huang,Lican Huang,"Integration Checker of JAVA P2P distributed System with Auto Source Code
  Composition","8 pages, 3 figures, ICNDC2016 Conference",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an integrity checker of JAVA P2P distributed system with
auto source code composition. JAVA distributed system must guarantee the
integrity of program itself and the system components of JAVA virtual machine
against attackers, hackers, spies, cheaters, conspirators, etc. There are lots
of trusted computing methods to guarantee the integrity of the system. We here
present a novel method using just-in-time auto source code composition to
generate autocheck class for integrity measure and encrypt of integrity
reporting.
  By companies' effort, we have implemented and use it in DSCloud platform.
","[{'version': 'v1', 'created': 'Fri, 28 Oct 2016 14:16:47 GMT'}]",2016-10-31,"[['Huang', 'Lican', '']]","['Trusted Computing', 'Distributed System', 'Integrity Checker', 'Auto Source Code Composition', 'Cybercrime']"
19142,1105.0791,Sandor P. Fekete,"Erin Wolf Chambers, S\'andor P. Fekete, Hella-Franziska Hoffmann,
  Dimitri Marinakis, Joseph S.B. Mitchell, Venkatesh Srinivasan, Ulrike Stege,
  Sue Whitesides",Connecting a Set of Circles with Minimum Sum of Radii,"21 pages, 15 figures, full version of extended abstract that appeared
  in Proceedings of the 12th Algorithms and Data Structures Symposium (WADS
  2011)",,,,cs.CG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of assigning radii to a given set of points in the
plane, such that the resulting set of circles is connected, and the sum of
radii is minimized. We show that the problem is polynomially solvable if a
connectivity tree is given. If the connectivity tree is unknown, the problem is
NP-hard if there are upper bounds on the radii and open otherwise. We give
approximation guarantees for a variety of polynomial-time algorithms, describe
upper and lower bounds (which are matching in some of the cases), provide
polynomial-time approximation schemes, and conclude with experimental results
and open problems.
","[{'version': 'v1', 'created': 'Wed, 4 May 2011 11:13:46 GMT'}, {'version': 'v2', 'created': 'Sat, 31 Dec 2016 18:31:20 GMT'}]",2017-01-03,"[['Chambers', 'Erin Wolf', ''], ['Fekete', 'Sándor P.', ''], ['Hoffmann', 'Hella-Franziska', ''], ['Marinakis', 'Dimitri', ''], ['Mitchell', 'Joseph S. B.', ''], ['Srinivasan', 'Venkatesh', ''], ['Stege', 'Ulrike', ''], ['Whitesides', 'Sue', '']]","['Intersection graphs', 'connectivity problems', 'NP-hardness problems', 'approximation', 'upper andlower bounds']"
19143,1704.05754,Federico Magliani,"Federico Magliani, Navid Mahmoudian Bidgoli, Andrea Prati",A location-aware embedding technique for accurate landmark recognition,"6 pages, 5 figures, ICDSC 2017",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The current state of the research in landmark recognition highlights the good
accuracy which can be achieved by embedding techniques, such as Fisher vector
and VLAD. All these techniques do not exploit spatial information, i.e.
consider all the features and the corresponding descriptors without embedding
their location in the image. This paper presents a new variant of the
well-known VLAD (Vector of Locally Aggregated Descriptors) embedding technique
which accounts, at a certain degree, for the location of features. The driving
motivation comes from the observation that, usually, the most interesting part
of an image (e.g., the landmark to be recognized) is almost at the center of
the image, while the features at the borders are irrelevant features which do
no depend on the landmark. The proposed variant, called locVLAD (location-aware
VLAD), computes the mean of the two global descriptors: the VLAD executed on
the entire original image, and the one computed on a cropped image which
removes a certain percentage of the image borders. This simple variant shows an
accuracy greater than the existing state-of-the-art approach. Experiments are
conducted on two public datasets (ZuBuD and Holidays) which are used both for
training and testing. Morever a more balanced version of ZuBuD is proposed.
","[{'version': 'v1', 'created': 'Wed, 19 Apr 2017 14:45:23 GMT'}]",2017-04-20,"[['Magliani', 'Federico', ''], ['Bidgoli', 'Navid Mahmoudian', ''], ['Prati', 'Andrea', '']]","['Automatic Landmark Recognition', 'Image Retrieval', 'EmbeddingTechniques']"
19144,1510.08555,Scott Ruoti,"Scott Ruoti, Jeff Andersen, Daniel Zappala, Kent Seamons","Why Johnny Still, Still Can't Encrypt: Evaluating the Usability of a
  Modern PGP Client","This is the Mailvelope study discussed in the CHI 2016 paper
  arXiv:1510.08554 ""We're on the Same Page"": A Usability Study of Secure Email
  Using Pairs of Novice Users""",,,,cs.CR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the results of a laboratory study involving Mailvelope, a
modern PGP client that integrates tightly with existing webmail providers. In
our study, we brought in pairs of participants and had them attempt to use
Mailvelope to communicate with each other. Our results shown that more than a
decade and a half after \textit{Why Johnny Can't Encrypt}, modern PGP tools are
still unusable for the masses. We finish with a discussion of pain points
encountered using Mailvelope, and discuss what might be done to address them in
future PGP systems.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2015 03:23:55 GMT'}, {'version': 'v2', 'created': 'Wed, 13 Jan 2016 21:51:39 GMT'}]",2016-01-15,"[['Ruoti', 'Scott', ''], ['Andersen', 'Jeff', ''], ['Zappala', 'Daniel', ''], ['Seamons', 'Kent', '']]","['Security', 'usability', 'secure email', 'PGP']"
19145,0704.1925,Yuanning Yu,"Yuanning Yu, Athina P. Petropulu and H. Vincent Poor","Blind Identification of Distributed Antenna Systems with Multiple
  Carrier Frequency Offsets","To appear in the Proceedings of the 8th IEEE International Workshop
  on Signal Processing Advances in Wireless Communications (SPAWC), Helsinki,
  Finland, June 17-20, 2007",,,,cs.IT math.IT,,"  In spatially distributed multiuser antenna systems, the received signal
contains multiple carrier-frequency offsets (CFOs) arising from mismatch
between the oscillators of transmitters and receivers. This results in a
time-varying rotation of the data constellation, which needs to be compensated
at the receiver before symbol recovery. In this paper, a new approach for blind
CFO estimation and symbol recovery is proposed. The received base-band signal
is over-sampled, and its polyphase components are used to formulate a virtual
Multiple-Input Multiple-Output (MIMO) problem. By applying blind MIMO system
estimation techniques, the system response can be estimated and decoupled
versions of the user symbols can be recovered, each one of which contains a
distinct CFO. By applying a decision feedback Phase Lock Loop (PLL), the CFO
can be mitigated and the transmitted symbols can be recovered. The estimated
MIMO system response provides information about the CFOs that can be used to
initialize the PLL, speed up its convergence, and avoid ambiguities usually
linked with PLL.
","[{'version': 'v1', 'created': 'Sun, 15 Apr 2007 23:58:08 GMT'}]",2007-07-13,"[['Yu', 'Yuanning', ''], ['Petropulu', 'Athina P.', ''], ['Poor', 'H. Vincent', '']]","['Multi-user Systems', 'Distributed Antenna Systems', 'Carrier Frequency Offset', 'Blind MIMO System Identification']"
19146,1605.01987,Luke Hsiao,"Kevin Miller, Luke W. Hsiao",TCPTuner: Congestion Control Your Way,"6 pages, 9 figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  TCPTuner is a TCP (transmission control protocol) congestion control kernel
module and GUI (graphical user interface) for Linux that allows real-time
modification of the congestion control parameters of TCP CUBIC, the current
default algorithm in Linux. Specifically, the tool provides access to alpha,
the rate at which a sender's congestion window grows; beta, the multiplicative
factor to decrease the congestion window on a loss event; as well as CUBIC's
fast convergence and tcp friendliness parameters. Additionally, the interface
provides access to ip-route parameters for the minimum retransmission time and
initial congestion window size. In this paper, we describe the implementation
of TCPTuner and show experimental data of the effects of adjusting congestion
control parameters.
","[{'version': 'v1', 'created': 'Fri, 6 May 2016 16:07:08 GMT'}]",2016-05-09,"[['Miller', 'Kevin', ''], ['Hsiao', 'Luke W.', '']]","['TCP', 'congestion control', 'interface', 'CUBIC', 'GUI']"
19147,1610.02050,Ali Kharrazi,Ali Kharrazi,"Artificial Neural Network Based Power System Stabilizer on a Single
  Machine Infinite Bus Modelled in Digsilent Powerfactory and MATLAB","11 pages, 16 figures, Electrical Engineering: An International
  Journal (EEIJ), Vol. 2, No. 2/3/4, December 2015",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper the use of artificial neural network in power system stability
is studied. A predictive controller based on two neural networks is designed
and tested on a single machine infinite bus system which is used to replace
conventional power system stabilizers. They have been used for decades in power
system to dampen small amplitude low frequency oscillation in power systems.
The increases in size and complexity of power systems have cast a shadow on
efficiency of conventional method. New control strategies have been proposed in
many researches. Artificial Neural Networks have been studied in many
publications but lack of assurance of their functionality has hindered the
practical usage of them in utilities. The proposed control structure is
modelled using a novel data exchange established between MATLAB and
","[{'version': 'v1', 'created': 'Wed, 13 Jan 2016 06:27:05 GMT'}]",2016-10-10,"[['Kharrazi', 'Ali', '']]","['MATLAB', 'DIgSILENT PowerFactory', 'Power System Stabilizer', 'Artificial Neural Network']"
19148,0711.0325,Aleksandar Lazarevic,"Ioannis Liabotis, Ognjen Prnjat, Tope Olukemi, Adrian Li Mow Ching,
  Aleksandar Lazarevic, Lionel Sacks, Mike Fisher, Paul McKee",Self-Organising management of Grid environments,,International Symposium on Telecommunications 2003,,,cs.DC,,"  This paper presents basic concepts, architectural principles and algorithms
for efficient resource and security management in cluster computing
environments and the Grid. The work presented in this paper is funded by
BTExacT and the EPSRC project SO-GRM (GR/S21939).
","[{'version': 'v1', 'created': 'Fri, 2 Nov 2007 15:26:48 GMT'}]",2007-11-05,"[['Liabotis', 'Ioannis', ''], ['Prnjat', 'Ognjen', ''], ['Olukemi', 'Tope', ''], ['Ching', 'Adrian Li Mow', ''], ['Lazarevic', 'Aleksandar', ''], ['Sacks', 'Lionel', ''], ['Fisher', 'Mike', ''], ['McKee', 'Paul', '']]","['Grid', 'cluster computing', 'policy', 'SLA', 'resource discovery', 'intrusion detection']"
19149,1607.00354,Roberto Capobianco,"Francesco Riccio, Roberto Capobianco, Marc Hanheide and Daniele Nardi",STAM: A Framework for Spatio-Temporal Affordance Maps,,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Affordances have been introduced in literature as action opportunities that
objects offer, and used in robotics to semantically represent their
interconnection. However, when considering an environment instead of an object,
the problem becomes more complex due to the dynamism of its state. To tackle
this issue, we introduce the concept of Spatio-Temporal Affordances (STA) and
Spatio-Temporal Affordance Map (STAM). Using this formalism, we encode action
semantics related to the environment to improve task execution capabilities of
an autonomous robot. We experimentally validate our approach to support the
execution of robot tasks by showing that affordances encode accurate semantics
of the environment.
","[{'version': 'v1', 'created': 'Fri, 1 Jul 2016 18:57:48 GMT'}]",2016-07-04,"[['Riccio', 'Francesco', ''], ['Capobianco', 'Roberto', ''], ['Hanheide', 'Marc', ''], ['Nardi', 'Daniele', '']]","['Spatial Knowledge', 'Affordances', 'Semantic Agents']"
19150,1110.1165,Petros Petrosyan,"Petros A. Petrosyan, Hrant H. Khachatrian, Liana E. Yepremyan,
  Hovhannes G. Tananyan",Interval edge-colorings of graph products,4 pages,"Proceedings of the CSIT Conference, Yerevan, 2011, pp. 89-92",,,cs.DM math.CO,http://creativecommons.org/licenses/by/3.0/,"  An interval t-coloring of a graph G is a proper edge-coloring of G with
colors 1,2,...,t such that at least one edge of G is colored by i, i=1,2,...,t,
and the edges incident to each vertex v\in V(G) are colored by d_{G}(v)
consecutive colors, where d_{G}(v) is the degree of the vertex v in G. In this
paper interval edge-colorings of various graph products are investigated.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2011 07:18:31 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Feb 2012 04:45:44 GMT'}]",2012-02-02,"[['Petrosyan', 'Petros A.', ''], ['Khachatrian', 'Hrant H.', ''], ['Yepremyan', 'Liana E.', ''], ['Tananyan', 'Hovhannes G.', '']]","['Edge-coloring', 'interval coloring', 'products of graphs', 'regular graph  1']"
19151,0705.4138,Michael Vielhaber,Michael Vielhaber and Monica del Pilar Canales,The Asymptotic Normalized Linear Complexity of Multisequences,"19 pages, 2 figures, submitted to J. Complexity",,,,cs.IT cs.CC cs.CR math.IT,,"  We show that the asymptotic linear complexity of a multisequence a in
F_q^\infty that is I := liminf L_a(n)/n and S := limsup L_a(n)/n satisfy the
inequalities M/(M+1) <= S <= 1 and M(1-S) <= I <= 1-S/M, if all M sequences
have nonzero discrepancy infinitely often, and all pairs (I,S) satisfying these
conditions are met by 2^{\aleph_0} multisequences a.
  This answers an Open Problem by Dai, Imamura, and Yang.
  Keywords: Linear complexity, multisequence, Battery Discharge Model,
isometry.
","[{'version': 'v1', 'created': 'Tue, 29 May 2007 03:41:21 GMT'}]",2007-07-13,"[['Vielhaber', 'Michael', ''], ['Canales', 'Monica del Pilar', '']]","['Linear complexity', 'multisequence', 'Battery DischargeModel', 'isometry']"
19152,1704.05122,Omar Al-Kadi,Omar S. Al-Kadi,"A Gabor Filter Texture Analysis Approach for Histopathological Brain
  Tumor Subtype Discrimination","14 pages,4 figures, 2 tables","ISESCO Journal of Science and Technology, vol. 12, no. 22, 2017",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Meningioma brain tumour discrimination is challenging as many histological
patterns are mixed between the different subtypes. In clinical practice,
dominant patterns are investigated for signs of specific meningioma pathology;
however the simple observation could result in inter- and intra-observer
variation due to the complexity of the histopathological patterns. Also
employing a computerised feature extraction approach applied at a single
resolution scale might not suffice in accurately delineating the mixture of
histopathological patterns. In this work we propose a novel multiresolution
feature extraction approach for characterising the textural properties of the
different pathological patterns (i.e. mainly cell nuclei shape, orientation and
spatial arrangement within the cytoplasm). The pattern textural properties are
characterised at various scales and orientations for an improved separability
between the different extracted features. The Gabor filter energy output of
each magnitude response was combined with four other fixed-resolution texture
signatures (2 model-based and 2 statistical-based) with and without cell nuclei
segmentation. The highest classification accuracy of 95% was reported when
combining the Gabor filters energy and the meningioma subimage fractal
signature as a feature vector without performing any prior cell nuceli
segmentation. This indicates that characterising the cell-nuclei
self-similarity properties via Gabor filters can assists in achieving an
improved meningioma subtype classification, which can assist in overcoming
variations in reported diagnosis.
","[{'version': 'v1', 'created': 'Mon, 17 Apr 2017 21:06:09 GMT'}]",2017-04-19,"[['Al-Kadi', 'Omar S.', '']]","['texture analysis', 'Gabor filter', 'fractal dimension', 'meningioma']"
19153,1712.04495,Blesson Varghese,"Carlos Reano, Federico Silla, Dimitrios S. Nikolopoulos and Blesson
  Varghese",Intra-node Memory Safe GPU Co-Scheduling,"Accepted on 12 Dec 2017, IEEE Transactions on Parallel and
  Distributed Systems",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  GPUs in High-Performance Computing systems remain under-utilised due to the
unavailability of schedulers that can safely schedule multiple applications to
share the same GPU. The research reported in this paper is motivated to improve
the utilisation of GPUs by proposing a framework, we refer to as schedGPU, to
facilitate intra-node GPU co-scheduling such that a GPU can be safely shared
among multiple applications by taking memory constraints into account. Two
approaches, namely a client-server and a shared memory approach are explored.
However, the shared memory approach is more suitable due to lower overheads
when compared to the former approach.
  Four policies are proposed in schedGPU to handle applications that are
waiting to access the GPU, two of which account for priorities. The feasibility
of schedGPU is validated on three real-world applications. The key observation
is that a performance gain is achieved.
  For single applications, a gain of over 10 times, as measured by GPU
utilisation and GPU memory utilisation, is obtained. For workloads comprising
multiple applications, a speed-up of up to 5x in the total execution time is
noted. Moreover, the average GPU utilisation and average GPU memory utilisation
is increased by 5 and 12 times, respectively.
","[{'version': 'v1', 'created': 'Tue, 12 Dec 2017 20:15:16 GMT'}]",2017-12-14,"[['Reano', 'Carlos', ''], ['Silla', 'Federico', ''], ['Nikolopoulos', 'Dimitrios S.', ''], ['Varghese', 'Blesson', '']]","['GPU Co-scheduling', 'access synchronisation', 'memory safe', 'accelerator', 'under-utilisation', 'schedGPU']"
19154,0709.3384,Mariano Zelke,Mariano Zelke,Weighted Matching in the Semi-Streaming Model,"12 pages, 2 figures","Proceedings of the 25th Annual Symposium on the Theoretical
  Aspects of Computer Science - STACS 2008, Bordeaux : France (2008)",,,cs.DM cs.DS,,"  We reduce the best known approximation ratio for finding a weighted matching
of a graph using a one-pass semi-streaming algorithm from 5.828 to 5.585. The
semi-streaming model forbids random access to the input and restricts the
memory to O(n*polylog(n)) bits. It was introduced by Muthukrishnan in 2003 and
is appropriate when dealing with massive graphs.
","[{'version': 'v1', 'created': 'Fri, 21 Sep 2007 09:34:19 GMT'}]",2008-02-25,"[['Zelke', 'Mariano', '']]","['semi-streaming algorithm', 'approximation algorithm', 'matching', 'graph algorithm']"
19155,1412.3695,Felipe Ortega,"Maria Sefidari, Felipe Ortega","Evaluating arbitration and conflict resolution mechanisms in the Spanish
  Wikipedia","4 pages, 4 tables",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In open collaborative projects like Wikipedia, interactions among users can
produce tension and misunderstandings. Complex disputes require more
sophisticated mechanisms of conflict resolution. In this paper, we examine the
case of the Spanish Wikipedia and its Arbitration Committee, known as CRC, over
its two years of activity. We postulate that the high percentage of rejections
of cases presented by non-administrators, the lack of diversity inside the
committee (composed only by administrators), and the high number of cases
involving administrators played a central role in its eventual downfall. We
conclude that mechanisms that fail to acknowledge the ecosystem they are part
of cannot succceed. Therefore, further research is needed to determine if
granting more decision-making power to non-administrators may lead to more
effective conflict resolution mechanisms.
","[{'version': 'v1', 'created': 'Wed, 10 Dec 2014 16:08:07 GMT'}]",2014-12-12,"[['Sefidari', 'Maria', ''], ['Ortega', 'Felipe', '']]","['Wikipedia', 'Arbitration', 'Conflict resolution', 'CRC', 'Arbcom']"
19156,1403.7152,Litis Litis,"Mansoriya Hamidou (LITIS), Dominique Fournier (LITIS), Eric Sanlaville
  (LITIS), Fr\'ed\'eric Serin (LITIS)",Management of dangerous goods in container terminal with MAS model,"8 pages. The 15th International Conference on Harbor, Maritime \&
  Multimodal Logistics, Ath\`enes : Greece (2013)",,,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a container terminal, many operations occur within the storage area:
containers import, containers export and containers shifting. All these
operations require the respect of many rules and even laws in order to
guarantee the port safety and to prevent risks, especially when hazardous
material is concerned. In this paper, we propose a hybrid architecture, using a
Cellular Automaton and a Multi-Agent System to handle the dangerous container
storage problem. It is an optimization problem since the aim is to improve the
container terminal configuration, that is, the way hazardous containers are
dispatched through the terminal to improve its security. In our model, we
consider containers as agents, in order to use a Multi-Agent System for the
decision aid software, and a Cellular Automaton for modelling the terminal
itself. To validate our approach many tests have been performed and the results
show the relevance of our model.
","[{'version': 'v1', 'created': 'Thu, 27 Mar 2014 18:01:32 GMT'}]",2014-03-28,"[['Hamidou', 'Mansoriya', '', 'LITIS'], ['Fournier', 'Dominique', '', 'LITIS'], ['Sanlaville', 'Eric', '', 'LITIS'], ['Serin', 'Frédéric', '', 'LITIS']]","['container terminal', 'dangerous container', 'multi-agents system', 'security']"
19157,1312.7355,Md. Selim Al Mamun,"Md. Selim Al Mamun, Pronab Kumar Mondal, Uzzal Kumar Prodhan",A Novel Approach for Designing Online Testable Reversible Circuits,,"International Journal of Engineering Research and Development,
  Volume 5, Issue 2, PP. 39-44 Year 2012",,,cs.ET cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reversible logic is gaining interest of many researchers due to its low power
dissipating characteristic. In this paper we proposed a new approach for
designing online testable reversible circuits. The resultant testable
reversible circuit can detect any single bit error whiles it is operating.
Appropriate theorems and lemmas are presented to clarify the proposed design.
The experimental results show that our design approach is superior in terms of
number of number of gates, garbage outputs and quantum cost.
","[{'version': 'v1', 'created': 'Sun, 22 Dec 2013 15:59:43 GMT'}]",2013-12-31,"[['Mamun', 'Md. Selim Al', ''], ['Mondal', 'Pronab Kumar', ''], ['Prodhan', 'Uzzal Kumar', '']]","['Benchmark Functions', 'Garbage Outputs', 'Online Testability', 'Reversible Logic', 'Quantum Cost']"
19158,1606.04835,Qi Li,"Qi Li, Tianshi Li, Baobao Chang",Learning Word Sense Embeddings from Word Sense Definitions,To appear at NLPCC-ICCPOL 2016,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Word embeddings play a significant role in many modern NLP systems. Since
learning one representation per word is problematic for polysemous words and
homonymous words, researchers propose to use one embedding per word sense.
Their approaches mainly train word sense embeddings on a corpus. In this paper,
we propose to use word sense definitions to learn one embedding per word sense.
Experimental results on word similarity tasks and a word sense disambiguation
task show that word sense embeddings produced by our approach are of high
quality.
","[{'version': 'v1', 'created': 'Wed, 15 Jun 2016 16:14:09 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Jun 2016 14:59:47 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Jul 2016 13:03:12 GMT'}, {'version': 'v4', 'created': 'Mon, 24 Oct 2016 00:56:54 GMT'}]",2016-10-25,"[['Li', 'Qi', ''], ['Li', 'Tianshi', ''], ['Chang', 'Baobao', '']]","['Word sense embedding', 'RNN', 'WordNet']"
19159,1307.5840,Masoumeh Vali,Masoumeh Vali,"Sub- Diving Labeling Method for Optimization Problem by Genetic
  Algorithm","arXiv admin note: substantial text overlap with arXiv:1307.5667,
  arXiv:1307.5679, arXiv:1307.5838",,,,cs.NE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many global Optimization Problems, it is required to evaluate a global
point (min or max) in large space that calculation effort is very high. In this
paper is presented new approach for optimization problem with subdivision
labeling method (SLM) but in this method for higher dimensional has high
computational. SLM Genetic Algorithm (SLMGA) in optimization problems is one of
the solutions of this problem. In proposed algorithm the initial population is
crossing points and subdividing in each step is according to mutation. RSLMGA
is compared with other well known algorithms: DE, PGA, Grefensstette and
Eshelman and numerical results show that RSLMGA achieve global optimal point
with more decision by smaller generations.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2013 12:27:23 GMT'}]",2013-07-24,"[['Vali', 'Masoumeh', '']]","['genetic algorithm (GA)', 'Subdivision labeling method (SLM)', 'crossing point']"
19160,1504.06700,Kedian Mu,Kedian Mu and Kewen Wang and Lian Wen,Preferential Multi-Context Systems,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multi-context systems (MCS) presented by Brewka and Eiter can be considered
as a promising way to interlink decentralized and heterogeneous knowledge
contexts. In this paper, we propose preferential multi-context systems (PMCS),
which provide a framework for incorporating a total preorder relation over
contexts in a multi-context system. In a given PMCS, its contexts are divided
into several parts according to the total preorder relation over them,
moreover, only information flows from a context to ones of the same part or
less preferred parts are allowed to occur. As such, the first $l$ preferred
parts of an PMCS always fully capture the information exchange between contexts
of these parts, and then compose another meaningful PMCS, termed the
$l$-section of that PMCS. We generalize the equilibrium semantics for an MCS to
the (maximal) $l_{\leq}$-equilibrium which represents belief states at least
acceptable for the $l$-section of an PMCS. We also investigate inconsistency
analysis in PMCS and related computational complexity issues.
","[{'version': 'v1', 'created': 'Sat, 25 Apr 2015 08:20:37 GMT'}]",2015-04-28,"[['Mu', 'Kedian', ''], ['Wang', 'Kewen', ''], ['Wen', 'Lian', '']]","['Preferential multi-context systems', 'equilibrium', 'inconsistencydiagnosis', 'inconsistency explanation', 'maximal consistent section']"
19161,1609.04757,Deepti Ghadiyaram,Deepti Ghadiyaram and Alan C. Bovik,"Perceptual Quality Prediction on Authentically Distorted Images Using a
  Bag of Features Approach",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current top-performing blind perceptual image quality prediction models are
generally trained on legacy databases of human quality opinion scores on
synthetically distorted images. Therefore they learn image features that
effectively predict human visual quality judgments of inauthentic, and usually
isolated (single) distortions. However, real-world images usually contain
complex, composite mixtures of multiple distortions. We study the perceptually
relevant natural scene statistics of such authentically distorted images, in
different color spaces and transform domains. We propose a bag of feature-maps
approach which avoids assumptions about the type of distortion(s) contained in
an image, focusing instead on capturing consistencies, or departures therefrom,
of the statistics of real world images. Using a large database of authentically
distorted images, human opinions of them, and bags of features computed on
them, we train a regressor to conduct image quality prediction. We demonstrate
the competence of the features towards improving automatic perceptual quality
prediction by testing a learned algorithm using them on a benchmark legacy
database as well as on a newly introduced distortion-realistic resource called
the LIVE In the Wild Image Quality Challenge Database. We extensively evaluate
the perceptual quality prediction model and algorithm and show that it is able
to achieve good quality prediction power that is better than other leading
models.
","[{'version': 'v1', 'created': 'Thu, 15 Sep 2016 18:06:21 GMT'}]",2016-09-16,"[['Ghadiyaram', 'Deepti', ''], ['Bovik', 'Alan C.', '']]","['Perceptual image quality', 'natural scene statistics', 'blind image quality assessment', 'color image quality']"
19162,1304.4677,Gobithaasan Rudrusamy,"Gobithasan, R., Norziah, O., Jamaludin, M.A",Developing a General algorithm for Ball Curve with GC2,,"2005 Proceedings of the 2nd International Conference on Research
  and Education in Mathematics (ICREM 2), May 25th- 26th 2005, Serdang,
  Malaysia, Pg. 526-531",,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper dwells in developing a general algorithm for constructing a
piecewise Ball Curve with curvature continuity (GC2). The proposed algorithm
requires GC2 data in which the designer must define unit tangent vectors and
signed curvatures at each interpolating points. As a numerical example, a vase
is constructed using GC2 piecewise Ball Curve
","[{'version': 'v1', 'created': 'Wed, 17 Apr 2013 03:50:57 GMT'}]",2013-04-18,"[['Gobithasan', '', ''], ['R.', '', ''], ['Norziah', '', ''], ['O.', '', ''], ['Jamaludin', '', ''], ['A', 'M.', '']]","['Ball Curve', 'geometric continuity degree of 2 (GC2)', 'curvature continuity', 'CAD', 'CAGD']"
19163,1506.01077,Saullo Haniell Galv\~ao De Oliveira,"Saullo Haniell Galv\~ao de Oliveira, Rosana Veroneze, Fernando Jos\'e
  Von Zuben",On bicluster aggregation and its benefits for enumerative solutions,"15 pages, will be published by Springer Verlag in the LNAI Series in
  the book Advances in Data Mining",,,,cs.LG,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Biclustering involves the simultaneous clustering of objects and their
attributes, thus defining local two-way clustering models. Recently, efficient
algorithms were conceived to enumerate all biclusters in real-valued datasets.
In this case, the solution composes a complete set of maximal and non-redundant
biclusters. However, the ability to enumerate biclusters revealed a challenging
scenario: in noisy datasets, each true bicluster may become highly fragmented
and with a high degree of overlapping. It prevents a direct analysis of the
obtained results. To revert the fragmentation, we propose here two approaches
for properly aggregating the whole set of enumerated biclusters: one based on
single linkage and the other directly exploring the rate of overlapping. Both
proposals were compared with each other and with the actual state-of-the-art in
several experiments, and they not only significantly reduced the number of
biclusters but also consistently increased the quality of the solution.
","[{'version': 'v1', 'created': 'Tue, 2 Jun 2015 22:26:42 GMT'}]",2015-06-04,"[['de Oliveira', 'Saullo Haniell Galvão', ''], ['Veroneze', 'Rosana', ''], ['Von Zuben', 'Fernando José', '']]","['Biclustering', 'bicluster enumeration', 'bicluster aggregation', 'outlier removal', 'metrics for biclusters']"
19164,1704.07216,Helen Treharne,"Jorden Whitefield and Liqun Chen and Frank Kargl and Andrew Paverd and
  Steve Schneider and Helen Treharne and Stephan Wesemeyer",Formal Analysis of V2X Revocation Protocols,"16 pages, 4 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Research on vehicular networking (V2X) security has produced a range of
security mechanisms and protocols tailored for this domain, addressing both
security and privacy. Typically, the security analysis of these proposals has
largely been informal. However, formal analysis can be used to expose flaws and
ultimately provide a higher level of assurance in the protocols.
  This paper focusses on the formal analysis of a particular element of
security mechanisms for V2X found in many proposals: the revocation of
malicious or misbehaving vehicles from the V2X system by invalidating their
credentials. This revocation needs to be performed in an unlinkable way for
vehicle privacy even in the context of vehicles regularly changing their
pseudonyms. The REWIRE scheme by Forster et al. and its subschemes BASIC and
RTOKEN aim to solve this challenge by means of cryptographic solutions and
trusted hardware.
  Formal analysis using the TAMARIN prover identifies two flaws with some of
the functional correctness and authentication properties in these schemes. We
then propose Obscure Token (OTOKEN), an extension of REWIRE to enable
revocation in a privacy preserving manner. Our approach addresses the
functional and authentication properties by introducing an additional key-pair,
which offers a stronger and verifiable guarantee of successful revocation of
vehicles without resolving the long-term identity. Moreover OTOKEN is the first
V2X revocation protocol to be co-designed with a formal model.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 13:34:39 GMT'}, {'version': 'v2', 'created': 'Sun, 6 Aug 2017 12:46:40 GMT'}]",2017-08-08,"[['Whitefield', 'Jorden', ''], ['Chen', 'Liqun', ''], ['Kargl', 'Frank', ''], ['Paverd', 'Andrew', ''], ['Schneider', 'Steve', ''], ['Treharne', 'Helen', ''], ['Wesemeyer', 'Stephan', '']]","['ad hoc networks', 'authentication', 'security verification', 'V2X']"
19165,1507.01708,Carlo Sartiani,"Dario Colazzo, Carlo Sartiani",Typing Regular Path Query Languages for Data Graphs,,,,,cs.DB cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Regular path query languages for data graphs are essentially \emph{untyped}.
The lack of type information greatly limits the optimization opportunities for
query engines and makes application development more complex. In this paper we
discuss a simple, yet expressive, schema language for edge-labelled data
graphs. This schema language is, then, used to define a query type inference
approach with good precision properties.
","[{'version': 'v1', 'created': 'Tue, 7 Jul 2015 08:43:59 GMT'}]",2015-07-08,"[['Colazzo', 'Dario', ''], ['Sartiani', 'Carlo', '']]","['RPQs', 'type inference', 'data graphs']"
19166,2007.05742,Zhao Kang,Zhao Kang and Xiao Lu and Jian Liang and Kun Bai and Zenglin Xu,Relation-Guided Representation Learning,Appear in Neural Networks,,,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep auto-encoders (DAEs) have achieved great success in learning data
representations via the powerful representability of neural networks. But most
DAEs only focus on the most dominant structures which are able to reconstruct
the data from a latent space and neglect rich latent structural information. In
this work, we propose a new representation learning method that explicitly
models and leverages sample relations, which in turn is used as supervision to
guide the representation learning. Different from previous work, our framework
well preserves the relations between samples. Since the prediction of pairwise
relations themselves is a fundamental problem, our model adaptively learns them
from data. This provides much flexibility to encode real data manifold. The
important role of relation and representation learning is evaluated on the
clustering task. Extensive experiments on benchmark data sets demonstrate the
superiority of our approach. By seeking to embed samples into subspace, we
further show that our method can address the large-scale and out-of-sample
problem.
","[{'version': 'v1', 'created': 'Sat, 11 Jul 2020 10:57:45 GMT'}]",2020-07-14,"[['Kang', 'Zhao', ''], ['Lu', 'Xiao', ''], ['Liang', 'Jian', ''], ['Bai', 'Kun', ''], ['Xu', 'Zenglin', '']]","['deep auto-encoder', 'unsupervised representation learning', 'subspace clustering', 'pairwise relation']"
19167,1212.2150,Shuanghong Yang,Shuang-Hong Yang,"Collaborative Competitive filtering II: Optimal Recommendation and
  Collaborative Games","10 pages, 5 figures; Recommender system, Collaborative filtering",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender systems have emerged as a new weapon to help online firms to
realize many of their strategic goals (e.g., to improve sales, revenue,
customer experience etc.). However, many existing techniques commonly approach
these goals by seeking to recover preference (e.g., estimating ratings) in a
matrix completion framework. This paper aims to bridge this significant gap
between the clearly-defined strategic objectives and the not-so-well-justified
proxy.
  We show it is advantageous to think of a recommender system as an analogy to
a monopoly economic market with the system as the sole seller, users as the
buyers and items as the goods. This new perspective motivates a game-theoretic
formulation for recommendation that enables us to identify the optimal
recommendation policy by explicit optimizing certain strategic goals. In this
paper, we revisit and extend our prior work, the Collaborative-Competitive
Filtering preference model, towards a game-theoretic framework. The proposed
framework consists of two components. First, a conditional preference model
that characterizes how a user would respond to a recommendation action; Second,
knowing in advance how the user would respond, how a recommender system should
act (i.e., recommend) strategically to maximize its goals. We show how
objectives such as click-through rate, sales revenue and consumption diversity
can be optimized explicitly in this framework. Experiments are conducted on a
commercial recommender system and demonstrate promising results.
","[{'version': 'v1', 'created': 'Mon, 10 Dec 2012 17:57:07 GMT'}]",2012-12-11,"[['Yang', 'Shuang-Hong', '']]","['Recommendation optimization', 'Collaborativegames', 'Econometric model', 'Expected utility theory']"
19168,1603.07998,Hang Zhang,"Hang Zhang, Kristin Dana and Ko Nishino","Friction from Reflectance: Deep Reflectance Codes for Predicting
  Physical Surface Properties from One-Shot In-Field Reflectance",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Images are the standard input for vision algorithms, but one-shot infield
reflectance measurements are creating new opportunities for recognition and
scene understanding. In this work, we address the question of what reflectance
can reveal about materials in an efficient manner. We go beyond the question of
recognition and labeling and ask the question: What intrinsic physical
properties of the surface can be estimated using reflectance? We introduce a
framework that enables prediction of actual friction values for surfaces using
one-shot reflectance measurements. This work is a first of its kind
vision-based friction estimation. We develop a novel representation for
reflectance disks that capture partial BRDF measurements instantaneously. Our
method of deep reflectance codes combines CNN features and fisher vector
pooling with optimal binary embedding to create codes that have sufficient
discriminatory power and have important properties of illumination and spatial
invariance. The experimental results demonstrate that reflectance can play a
new role in deciphering the underlying physical properties of real-world
scenes.
","[{'version': 'v1', 'created': 'Fri, 25 Mar 2016 19:57:03 GMT'}, {'version': 'v2', 'created': 'Sun, 10 Jul 2016 20:36:37 GMT'}]",2016-07-12,"[['Zhang', 'Hang', ''], ['Dana', 'Kristin', ''], ['Nishino', 'Ko', '']]","['Surface Friction', 'Reflectance', 'Material Recognition', 'Binary Embedding']"
19169,1702.02799,Sheng Wang,"Anh Dinh, Ji Wang, Sheng Wang, Gang Chen, Wei-Ngan Chin, Qian Lin,
  Beng Chin Ooi, Pingcheng Ruan, Kian-Lee Tan, Zhongle Xie, Hao Zhang, and
  Meihui Zhang",UStore: A Distributed Storage With Rich Semantics,21 pages,,,,cs.DB cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today's storage systems expose abstractions which are either too low-level
(e.g., key-value store, raw-block store) that they require developers to
re-invent the wheels, or too high-level (e.g., relational databases, Git) that
they lack generality to support many classes of applications. In this work, we
propose and implement a general distributed data storage system, called UStore,
which has rich semantics. UStore delivers three key properties, namely
immutability, sharing and security, which unify and add values to many classes
of today's applications, and which also open the door for new applications. By
keeping the core properties within the storage, UStore helps reduce application
development efforts while offering high performance at hand. The storage
embraces current hardware trends as key enablers. It is built around a
data-structure similar to that of Git, a popular source code versioning system,
but it also synthesizes many designs from distributed systems and databases.
Our current implementation of UStore has better performance than general
in-memory key-value storage systems, especially for version scan operations. We
port and evaluate four applications on top of UStore: a Git-like application, a
collaborative data science application, a transaction management application,
and a blockchain application. We demonstrate that UStore enables faster
development and the UStore-backed applications can have better performance than
the existing implementations.
","[{'version': 'v1', 'created': 'Thu, 9 Feb 2017 12:06:37 GMT'}]",2017-02-10,"[['Dinh', 'Anh', ''], ['Wang', 'Ji', ''], ['Wang', 'Sheng', ''], ['Chen', 'Gang', ''], ['Chin', 'Wei-Ngan', ''], ['Lin', 'Qian', ''], ['Ooi', 'Beng Chin', ''], ['Ruan', 'Pingcheng', ''], ['Tan', 'Kian-Lee', ''], ['Xie', 'Zhongle', ''], ['Zhang', 'Hao', ''], ['Zhang', 'Meihui', '']]","['Versioning', 'Branching', 'Collaborative Analytics', 'Blockchain']"
19170,1105.0417,Kevin Ross,"Kevin Ross, Nicholas Bambos, and George Michailidis",Cone Schedules for Processing Systems in Fluctuating Environments,"25 pages, 5 figures",,,,cs.NI cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a generalized processing system having several queues, where the
available service rate combinations are fluctuating over time due to
reliability and availability variations. The objective is to allocate the
available resources, and corresponding service rates, in response to both
workload and service capacity considerations, in order to maintain the long
term stability of the system. The service configurations are completely
arbitrary, including negative service rates which represent forwarding and
service-induced cross traffic. We employ a trace-based trajectory asymptotic
technique, which requires minimal assumptions about the arrival dynamics of the
system.
  We prove that cone schedules, which leverage the geometry of the queueing
dynamics, maximize the system throughput for a broad class of processing
systems, even under adversarial arrival processes. We study the impact of
fluctuating service availability, where resources are available only some of
the time, and the schedule must dynamically respond to the changing available
service rates, establishing both the capacity of such systems and the class of
schedules which will stabilize the system at full capacity. The rich geometry
of the system dynamics leads to important insights for stability, performance
and scalability, and substantially generalizes previous findings.
  The processing system studied here models a broad variety of computer,
communication and service networks, including varying channel conditions and
cross-traffic in wireless networking, and call centers with fluctuating
capacity. The findings have implications for bandwidth and processor allocation
in communication networks and workforce scheduling in congested call centers.
","[{'version': 'v1', 'created': 'Mon, 2 May 2011 19:33:33 GMT'}]",2011-05-04,"[['Ross', 'Kevin', ''], ['Bambos', 'Nicholas', ''], ['Michailidis', 'George', '']]","['random environment', 'stability', 'adversarial queueing theory', 'dynamic scheduling', 'throughput maximization']"
19171,1704.08713,Barun Gorain,Barun Gorain and Andrzej Pelc,Finding the Size and the Diameter of a Radio Network Using Short Labels,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The number of nodes of a network, called its size, and the largest distance
between nodes of a network, called its diameter, are among the most important
network parameters. Knowing the size and/or diameter is a prerequisite of many
distributed network algorithms. A radio network is a collection of nodes, with
wireless transmission and receiving capabilities. It is modeled as a simple
undirected graph whose nodes communicate in synchronous rounds. In each round,
a node can either transmit a message to all its neighbors, or stay silent and
listen. At the receiving end, a node $v$ hears a message from a neighbor $w$ in
a round $i$, if $v$ listens in round $i$, and if $w$ is its only neighbor that
transmits in round $i$. If $v$ listens in a round, and multiple neighbors of
$v$ transmit in this round, a collision occurs at $v$. If $v$ transmits in a
round, it does not hear anything. If listening nodes can distinguish collision
from silence, we say that the network has collision detection capability,
otherwise there is no collision detection. We consider the tasks of size
discovery and diameter discovery: finding the size (resp. the diameter) of an
unknown radio network with collision detection. All nodes have to output the
size (resp. the diameter) of the network, using a deterministic algorithm.
Nodes have labels which are binary strings. The length of a labeling scheme is
the largest length of a label. We concentrate on the following problems:
  1. What is the shortest labeling scheme that permits size discovery in all
radio networks of maximum degree $\Delta$? 2. What is the shortest labeling
scheme that permits diameter discovery in all radio networks?
  We show that the minimum length of a labeling scheme that permits size
discovery is $\Theta(\log\log \Delta)$. By contrast, we show that diameter
discovery can be done using a labeling scheme of constant length.
","[{'version': 'v1', 'created': 'Thu, 27 Apr 2017 18:46:18 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Nov 2020 17:05:32 GMT'}]",2020-11-12,"[['Gorain', 'Barun', ''], ['Pelc', 'Andrzej', '']]","['radio network', 'collision detection', 'network size', 'network diameter', 'labelingscheme']"
19172,1506.08603,Paris Carbone,"Paris Carbone, Gyula F\'ora, Stephan Ewen, Seif Haridi, Kostas Tzoumas",Lightweight Asynchronous Snapshots for Distributed Dataflows,"8 pages, 7 figures",,,ISBN 978-91-7595-651-0,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Distributed stateful stream processing enables the deployment and execution
of large scale continuous computations in the cloud, targeting both low latency
and high throughput. One of the most fundamental challenges of this paradigm is
providing processing guarantees under potential failures. Existing approaches
rely on periodic global state snapshots that can be used for failure recovery.
Those approaches suffer from two main drawbacks. First, they often stall the
overall computation which impacts ingestion. Second, they eagerly persist all
records in transit along with the operation states which results in larger
snapshots than required. In this work we propose Asynchronous Barrier
Snapshotting (ABS), a lightweight algorithm suited for modern dataflow
execution engines that minimises space requirements. ABS persists only operator
states on acyclic execution topologies while keeping a minimal record log on
cyclic dataflows. We implemented ABS on Apache Flink, a distributed analytics
engine that supports stateful stream processing. Our evaluation shows that our
algorithm does not have a heavy impact on the execution, maintaining linear
scalability and performing well with frequent snapshots.
","[{'version': 'v1', 'created': 'Mon, 29 Jun 2015 12:33:49 GMT'}]",2015-06-30,"[['Carbone', 'Paris', ''], ['Fóra', 'Gyula', ''], ['Ewen', 'Stephan', ''], ['Haridi', 'Seif', ''], ['Tzoumas', 'Kostas', '']]","['fault tolerance', 'distributed computing', 'streamprocessing', 'dataflow', 'cloud computing', 'state management']"
19173,0705.4110,Ian Kash,"Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern","Optimizing Scrip Systems: Efficiency, Crashes, Hoarders, and Altruists",,,,,cs.GT,,"  We discuss the design of efficient scrip systems and develop tools for
empirically analyzing them. For those interested in the empirical study of
scrip systems, we demonstrate how characteristics of agents in a system can be
inferred from the equilibrium distribution of money. From the perspective of a
system designer, we examine the effect of the money supply on social welfare
and show that social welfare is maximized by increasing the money supply up to
the point that the system experiences a ``monetary crash,'' where money is
sufficiently devalued that no agent is willing to perform a service. We also
examine the implications of the presence of altruists and hoarders on the
performance of the system. While a small number of altruists may improve social
welfare, too many can also cause the system to experience a monetary crash,
which may be bad for social welfare. Hoarders generally decrease social welfare
but, surprisingly, they also promote system stability by helping prevent
monetary crashes. In addition, we provide new technical tools for analyzing and
computing equilibria by showing that our model exhibits strategic
complementarities, which implies that there exist equilibria in pure strategies
that can be computed efficiently.
","[{'version': 'v1', 'created': 'Mon, 28 May 2007 21:14:04 GMT'}]",2007-05-30,"[['Kash', 'Ian A.', ''], ['Friedman', 'Eric J.', ''], ['Halpern', 'Joseph Y.', '']]","['Game Theory', 'P2P Networks', 'Scrip Systems']"
19174,1505.05958,Zhenyu Shen,"Jingyu Hua, Zhenyu Shen, Sheng Zhong","We Can Track You If You Take the Metro: Tracking Metro Riders Using
  Accelerometers on Smartphones",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motion sensors (e.g., accelerometers) on smartphones have been demonstrated
to be a powerful side channel for attackers to spy on users' inputs on
touchscreen. In this paper, we reveal another motion accelerometer-based attack
which is particularly serious: when a person takes the metro, a malicious
application on her smartphone can easily use accelerator readings to trace her.
We first propose a basic attack that can automatically extract metro-related
data from a large amount of mixed accelerator readings, and then use an
ensemble interval classier built from supervised learning to infer the riding
intervals of the user. While this attack is very effective, the supervised
learning part requires the attacker to collect labeled training data for each
station interval, which is a significant amount of effort. To improve the
efficiency of our attack, we further propose a semi-supervised learning
approach, which only requires the attacker to collect labeled data for a very
small number of station intervals with obvious characteristics. We conduct real
experiments on a metro line in a major city. The results show that the
inferring accuracy could reach 89\% and 92\% if the user takes the metro for 4
and 6 stations, respectively.
","[{'version': 'v1', 'created': 'Fri, 22 May 2015 05:59:55 GMT'}]",2015-05-25,"[['Hua', 'Jingyu', ''], ['Shen', 'Zhenyu', ''], ['Zhong', 'Sheng', '']]","['Accelerometers', 'Location Privacy', 'Metro']"
19175,0804.1921,Michel Grabisch,"Michel Grabisch (LIP6), Christophe Labreuche (TRT), Jean-Claude
  Vansnick","On the Extension of Pseudo-Boolean Functions for the Aggregation of
  Interacting Criteria",,European Journal of Operational Research (2003) 28-47,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents an analysis on the use of integrals defined for
non-additive measures (or capacities) as the Choquet and the \Sipos{} integral,
and the multilinear model, all seen as extensions of pseudo-Boolean functions,
and used as a means to model interaction between criteria in a multicriteria
decision making problem. The emphasis is put on the use, besides classical
comparative information, of information about difference of attractiveness
between acts, and on the existence, for each point of view, of a ``neutral
level'', allowing to introduce the absolute notion of attractive or repulsive
act. It is shown that in this case, the Sipos integral is a suitable solution,
although not unique. Properties of the Sipos integral as a new way of
aggregating criteria are shown, with emphasis on the interaction among
criteria.
","[{'version': 'v1', 'created': 'Fri, 11 Apr 2008 15:49:45 GMT'}]",2008-12-18,"[['Grabisch', 'Michel', '', 'LIP6'], ['Labreuche', 'Christophe', '', 'TRT'], ['Vansnick', 'Jean-Claude', '']]","['multicriteria decision making', 'Choquet integral', 'capacity', 'interactive criteria', 'negative scores']"
19176,0711.2116,Frederic Vignat,"Fr\'ed\'eric Vignat (LGS), Fran\c{c}ois Villeneuve (LGS)",A numerical approach for 3D manufacturing tolerances synthesis,,"Dans Proceedings of the 10th CIRP International Seminar on
  Computer Aided Tolerancing - 10th CIRP International Seminar on Computer
  Aided Tolerancing, Erlangen : Allemagne (2007)",,,cs.CE,,"  Making a product conform to the functional requirements indicated by the
customer suppose to be able to manage the manufacturing process chosen to
realise the parts. A simulation step is generally performed to verify that the
expected generated deviations fit with these requirements. It is then necessary
to assess the actual deviations of the process in progress. This is usually
done by the verification of the conformity of the workpiece to manufacturing
tolerances at the end of each set-up. It is thus necessary to determine these
manufacturing tolerances. This step is called ""manufacturing tolerance
synthesis"". In this paper, a numerical method is proposed to perform 3D
manufacturing tolerances synthesis. This method uses the result of the
numerical analysis of tolerances to determine influent mall displacement of
surfaces. These displacements are described by small displacements torsors. An
algorithm is then proposed to determine suitable ISO manufacturing tolerances.
","[{'version': 'v1', 'created': 'Wed, 14 Nov 2007 06:21:17 GMT'}]",2007-11-15,"[['Vignat', 'Frédéric', '', 'LGS'], ['Villeneuve', 'François', '', 'LGS']]","['Manufacturing', 'process', 'tolerance', 'synthesis']"
19177,1501.02431,Rashmi Paithankar Ms,Rashmi Paithankar and Bharat Tidke,"A H-K Clustering Algorithm For High Dimensional Data Using Ensemble
  Learning","9 pages, 1 table, 2 figures, International Journal of Information
  Technology Convergence and Services (IJITCS) Vol.4, No.5/6, December 2014",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advances made to the traditional clustering algorithms solves the various
problems such as curse of dimensionality and sparsity of data for multiple
attributes. The traditional H-K clustering algorithm can solve the randomness
and apriority of the initial centers of K-means clustering algorithm. But when
we apply it to high dimensional data it causes the dimensional disaster problem
due to high computational complexity. All the advanced clustering algorithms
like subspace and ensemble clustering algorithms improve the performance for
clustering high dimension dataset from different aspects in different extent.
Still these algorithms will improve the performance form a single perspective.
The objective of the proposed model is to improve the performance of
traditional H-K clustering and overcome the limitations such as high
computational complexity and poor accuracy for high dimensional data by
combining the three different approaches of clustering algorithm as subspace
clustering algorithm and ensemble clustering algorithm with H-K clustering
algorithm.
","[{'version': 'v1', 'created': 'Sun, 11 Jan 2015 08:30:15 GMT'}]",2015-01-13,"[['Paithankar', 'Rashmi', ''], ['Tidke', 'Bharat', '']]","['H-K clustering', 'ensemble', 'subspace']"
19178,1307.5612,Jatin Agarwal,"Jatin Agarwal, Nadeem Moidu, Kishore Kothapalli and Kannan Srinathan",Efficient Range Reporting of Convex Hull,"This work was previously submitted to IWOCA 2013 and was rejected.
  The work with better results will appear in proceedings of CCCG 2013",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of reporting convex hull points in an orthogonal
range query in two dimensions. Formally, let $P$ be a set of $n$ points in
$\mathbb{R}^{2}$. A point lies on the convex hull of a point set $S$ if it lies
on the boundary of the minimum convex polygon formed by $S$. In this paper, we
are interested in finding the points that lie on the boundary of the convex
hull of the points in $P$ that also fall with in an orthogonal
range$[x_{lt},x_{rt}]\times{}[y_b, y_t]$. We propose a $O(n \log^{2} n) $ space
data structure that can support reporting points on a convex hull inside an
orthogonal range query, in time $O(\log^{3} n + h)$. Here $h$ is the size of
the output. This work improves the result of (Brass et al. 2013) \cite{brass}
that builds a data structure that uses $O(n \log^{2} n)$ space and has a
$O(\log^{5} n + h)$ query time. Additionally, we show that our data structure
can be modified slightly to solve other related problems. For instance, for
counting the number of points on the convex hull in an orthogonal query
rectangle, we propose an $O(n \log^{2}n)$ space data structure that can be
queried upon in $O(\log^{3} n)$ time. We also propose a $O(n \log^{2} n) $
space data structure that can compute the $area$ and $perimeter$ of the convex
hull inside an orthogonal range query in $O(\log^{3} n$) time.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2013 07:49:57 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Jul 2013 05:01:26 GMT'}]",2013-07-24,"[['Agarwal', 'Jatin', ''], ['Moidu', 'Nadeem', ''], ['Kothapalli', 'Kishore', ''], ['Srinathan', 'Kannan', '']]","['Convex Hull', 'Plane', 'Orthogonal range', 'Reporting', 'Counting', 'Area', 'Prerimeter']"
19179,1504.02590,Hassan Ismkhan,"Hassan Ismkhan, Kamran Zamanifar","Study of Some Recent Crossovers Effects on Speed and Accuracy of Genetic
  Algorithm, Using Symmetric Travelling Salesman Problem",arXiv admin note: text overlap with arXiv:1209.5339,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Travelling Salesman Problem (TSP) is one of the most famous optimization
problems. The Genetic Algorithm (GA) is one of metaheuristics that have been
applied to TSP. The Crossover and mutation operators are two important elements
of GA. There are many TSP solver crossover operators. In this paper, we state
implementation of some recent TSP solver crossovers at first and then we use
each of them in GA to solve some Symmetric TSP (STSP) instances and finally
compare their effects on speed and accuracy of presented GA.
","[{'version': 'v1', 'created': 'Fri, 10 Apr 2015 08:53:03 GMT'}]",2015-04-13,"[['Ismkhan', 'Hassan', ''], ['Zamanifar', 'Kamran', '']]","['Symmetric Traveling Salesman Problem', 'STSP', 'Crossover', 'Genetic Algorithm', 'GA']"
19180,0804.1762,Michel Grabisch,"Christophe Labreuche (TRT), Michel Grabisch (LIP6)","The Choquet integral for the aggregation of interval scales in
  multicriteria decision making",,Fuzzy Sets and Systems 137 (2003) 11-26,,,cs.DM cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the question of which models fit with information
concerning the preferences of the decision maker over each attribute, and his
preferences about aggregation of criteria (interacting criteria). We show that
the conditions induced by these information plus some intuitive conditions lead
to a unique possible aggregation operator: the Choquet integral.
","[{'version': 'v1', 'created': 'Thu, 10 Apr 2008 17:01:11 GMT'}]",2008-12-18,"[['Labreuche', 'Christophe', '', 'TRT'], ['Grabisch', 'Michel', '', 'LIP6']]","['multicriteria decision making', 'Choquet integral', 'axiomatic approach']"
19181,1701.07689,Marc Hellmuth,Marc Hellmuth,"Biologically Feasible Gene Trees, Reconciliation Maps and Informative
  Triples",,,,,cs.DM q-bio.PE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The history of gene families - which are equivalent to \emph{event-labeled}
gene trees - can be reconstructed from empirically estimated evolutionary
event-relations containing pairs of orthologous, paralogous or xenologous
genes. The question then arises as whether inferred event-labeled gene trees
are \emph{biologically feasible}, that is, if there is a possible true history
that would explain a given gene tree. In practice, this problem is boiled down
to finding a reconciliation map - also known as DTL-scenario - between the
event-labeled gene trees and a (possibly unknown) species tree.
  In this contribution, we first characterize whether there is a valid
reconciliation map for binary event-labeled gene trees $T$ that contain
speciation, duplication and horizontal gene transfer events and some unknown
species tree $S$ in terms of ""informative"" triples that are displayed in $T$
and provide information of the topology of $S$. These informative triples are
used to infer the unknown species tree $S$ for $T$. We obtain a similar result
for non-binary gene trees. To this end, however, the reconciliation map needs
to be further restricted. We provide a polynomial-time algorithm to decide
whether there is a species tree for a given event-labeled gene tree, and in the
positive case, to construct the species tree and the respective (restricted)
reconciliation map.
  However, informative triples as well as DTL-scenarios have its limitations
when they are used to explain the biological feasibility of gene trees. While
reconciliation maps imply biological feasibility, we show that the converse is
not true in general. Moreover, we show that informative triples do neither
provide enough information to characterize ""relaxed"" DTL-scenarios nor
non-restricted reconciliation maps for non-binary biologically feasible gene
trees.
","[{'version': 'v1', 'created': 'Thu, 26 Jan 2017 13:28:01 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Jan 2017 07:25:52 GMT'}, {'version': 'v3', 'created': 'Thu, 8 Jun 2017 12:57:58 GMT'}, {'version': 'v4', 'created': 'Sat, 10 Jun 2017 15:19:26 GMT'}]",2017-06-13,"[['Hellmuth', 'Marc', '']]","['DTL-scenario', 'Reconciliation', 'Horizontal gene transfer', 'Phylogenetic tree', 'Triples', 'Event-label']"
19182,1603.05609,Milica Bogicevic,"Milica Bogicevic, Milan Merkle",ABCDepth: efficient algorithm for Tukey depth,,,,,cs.CG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new algorithm for Tukey (halfspace) depth level sets and its
implementation. Given $d$-dimensional data set for any $d\geq 2$, the algorithm
is based on representation of level sets as intersections of balls in $R^d$,
and can be easily adapted to related depths (Type D, Zuo and Serfling (Ann.
Stat. {\bf 28} (2000), 461--482)). The algorithm complexity is $O(dn^2 +
n^2\log{n})$ where $n$ is the data set size. Examples with real and synthetic
data show that the algorithm is much faster than other implemented algorithms
and that it can accept thousands of multidimensional observations, while other
algorithms are tested with two-dimensional data or with a couple of hundreds
multidimensional observations.
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2016 18:47:30 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Nov 2016 15:43:27 GMT'}]",2016-11-16,"[['Bogicevic', 'Milica', ''], ['Merkle', 'Milan', '']]","['Big data', 'multivariate medians', 'depth functions', 'computing Tukey’s depth']"
19183,1609.03734,Michel Dubois,Michel Dubois and Eric Filiol,Hacking of the AES with Boolean Functions,"Submitted to FORmal methods for Security Engineering - ForSE 2017 25
  pages",,,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  One of the major issues of cryptography is the cryptanalysis of cipher
algorithms. Cryptanalysis is the study of methods for obtaining the meaning of
encrypted information, without access to the secret information that is
normally required. Some mechanisms for breaking codes include differential
cryptanalysis, advanced statistics and brute-force.
  Recent works also attempt to use algebraic tools to reduce the cryptanalysis
of a block cipher algorithm to the resolution of a system of quadratic
equations describing the ciphering structure.
  In our study, we will also use algebraic tools but in a new way: by using
Boolean functions and their properties. A Boolean function is a function from
$F_2^n\to F_2$ with $n>1$, characterized by its truth table. The arguments of
Boolean functions are binary words of length $n$. Any Boolean function can be
represented, uniquely, by its algebraic normal form which is an equation which
only contains additions modulo 2 - the XOR function - and multiplications
modulo 2 - the AND function.
  Our aim is to describe the AES algorithm as a set of Boolean functions then
calculate their algebraic normal forms by using the M\""obius transforms. After,
we use a specific representation for these equations to facilitate their
analysis and particularly to try a combinatorial analysis. Through this
approach we obtain a new kind of equations system. This equations system is
more easily implementable and could open new ways to cryptanalysis.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2016 09:12:33 GMT'}]",2016-09-14,"[['Dubois', 'Michel', ''], ['Filiol', 'Eric', '']]","['Block cipher', 'Boolean function', 'Cryptanalysis', 'AES']"
19184,1409.7612,Rushdi Shams Mr,Rushdi Shams,Semi-supervised Classification for Natural Language Processing,,,,,cs.CL cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semi-supervised classification is an interesting idea where classification
models are learned from both labeled and unlabeled data. It has several
advantages over supervised classification in natural language processing
domain. For instance, supervised classification exploits only labeled data that
are expensive, often difficult to get, inadequate in quantity, and require
human experts for annotation. On the other hand, unlabeled data are inexpensive
and abundant. Despite the fact that many factors limit the wide-spread use of
semi-supervised classification, it has become popular since its level of
performance is empirically as good as supervised classification. This study
explores the possibilities and achievements as well as complexity and
limitations of semi-supervised classification for several natural langue
processing tasks like parsing, biomedical information processing, text
classification, and summarization.
","[{'version': 'v1', 'created': 'Thu, 25 Sep 2014 15:18:44 GMT'}]",2014-09-29,"[['Shams', 'Rushdi', '']]","['Semi-supervised learning', 'classification', 'naturallanguage processing', 'data mining']"
19185,1712.05264,David Broman,David Broman,A Brief Overview of the KTA WCET Tool,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  KTA (KTH's timing analyzer) is a research tool for performing timing analysis
of program code. The currently available toolchain can perform two different
kinds of analyses: i) exhaustive fine-grained timing analysis, where timing
information can be provided between arbitrary timing program points within a
function, and ii) abstract search-based timing analysis, where the tool can
perform optimal worst-case execution time (WCET) analysis. The latter is based
on a technique that combines divide-and-conquer search and abstract
interpretation. The tool is under development and currently supports a subset
of the MIPS instruction set architecture.
","[{'version': 'v1', 'created': 'Thu, 14 Dec 2017 14:57:54 GMT'}]",2017-12-15,"[['Broman', 'David', '']]","['WCET Analysis', 'Abstract Interpretation', 'Continuous-Passing Style']"
19186,1205.1648,Manu Valiyakallingal Thankappan,Manu V T and Philomina Simon,"A novel statistical fusion rule for image fusion and its comparison in
  non subsampled contourlet transform domain and wavelet domain",19 pages,,,,cs.CV math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image fusion produces a single fused image from a set of input images. A new
method for image fusion is proposed based on Weighted Average Merging Method
(WAMM) in the NonSubsampled Contourlet Transform (NSCT) domain. A performance
analysis on various statistical fusion rules are also analysed both in NSCT and
Wavelet domain. Analysis has been made on medical images, remote sensing images
and multi focus images. Experimental results shows that the proposed method,
WAMM obtained better results in NSCT domain than the wavelet domain as it
preserves more edges and keeps the visual quality intact in the fused image.
","[{'version': 'v1', 'created': 'Tue, 8 May 2012 09:52:46 GMT'}]",2012-05-09,"[['T', 'Manu V', ''], ['Simon', 'Philomina', '']]","['Non Subsampled Contourlet Transform', 'Weighted Average Merging Method', 'Statistical Fusion Rule', 'Wavelet', 'Piella Metric']"
19187,1109.3954,Travis Gagie,"Travis Gagie and Pawe{\l} Gawrychowski and Juha K\""arkk\""ainen and
  Yakov Nekrich and Simon J. Puglisi",A Faster Grammar-Based Self-Index,journal version of LATA '12 paper,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To store and search genomic databases efficiently, researchers have recently
started building compressed self-indexes based on grammars. In this paper we
show how, given a straight-line program with $r$ rules for a string (S [1..n])
whose LZ77 parse consists of $z$ phrases, we can store a self-index for $S$ in
$\Oh{r + z \log \log n}$ space such that, given a pattern (P [1..m]), we can
list the $\occ$ occurrences of $P$ in $S$ in $\Oh{m^2 + \occ \log \log n}$
time. If the straight-line program is balanced and we accept a small
probability of building a faulty index, then we can reduce the $\Oh{m^2}$ term
to $\Oh{m \log m}$. All previous self-indexes are larger or slower in the worst
case.
","[{'version': 'v1', 'created': 'Mon, 19 Sep 2011 07:10:06 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Oct 2011 07:04:30 GMT'}, {'version': 'v3', 'created': 'Thu, 15 Dec 2011 05:49:32 GMT'}, {'version': 'v4', 'created': 'Sun, 17 Jun 2012 09:11:52 GMT'}, {'version': 'v5', 'created': 'Sun, 9 Sep 2012 08:10:34 GMT'}, {'version': 'v6', 'created': 'Wed, 26 Sep 2012 20:34:19 GMT'}]",2012-09-28,"[['Gagie', 'Travis', ''], ['Gawrychowski', 'Paweł', ''], ['Kärkkäinen', 'Juha', ''], ['Nekrich', 'Yakov', ''], ['Puglisi', 'Simon J.', '']]","['compressed self-indexes', 'grammar-based compression', 'Lempel-Ziv']"
19188,1702.03590,Hamid Ghourchian,"Hamid Ghourchian, Gholamali Aminian, Amin Gohari, Mahtab Mirmohseni,
  Masoumeh Nasiri-Kenari",On the Capacity of a Class of Signal-Dependent Noise Channels,"34 pages, 3 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In some applications, the variance of additive measurement noise depends on
the signal that we aim to measure. For instance, additive Gaussian
signal-dependent noise (AGSDN) channel models are used in molecular and optical
communication. Herein we provide lower and upper bounds on the capacity of
additive signal-dependent noise (ASDN) channels. The idea of the first lower
bound is the extension of the majorization inequality, and for the second one,
it uses some calculations based on the fact that $h(Y) > h (Y|Z)$. Both of them
are valid for all additive signal-dependent noise (ASDN) channels defined in
the paper. The upper bound is based on a previous idea of the authors
(""symmetric relative entropy"") and is used for the additive Gaussian
signal-dependent noise (AGSDN) channels. These bounds indicate that in ASDN
channels (unlike the classical AWGN channels), the capacity does not
necessarily become larger by making the variance function of the noise smaller.
We also provide sufficient conditions under which the capacity becomes
infinity. This is complemented by a number of conditions that imply capacity is
finite and a unique capacity achieving measure exists (in the sense of the
output measure).
","[{'version': 'v1', 'created': 'Sun, 12 Feb 2017 23:04:26 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Jun 2017 14:29:26 GMT'}]",2017-06-05,"[['Ghourchian', 'Hamid', ''], ['Aminian', 'Gholamali', ''], ['Gohari', 'Amin', ''], ['Mirmohseni', 'Mahtab', ''], ['Nasiri-Kenari', 'Masoumeh', '']]","['Signal-dependent noise channels', 'molecular communication', 'channels with infinite capacity', 'existence of capacity-achieving distribution']"
19189,0708.4214,B.Sundar Rajan,J. Harshan and B. Sundar Rajan,"High Rate Single-Symbol Decodable Precoded DSTBCs for Cooperative
  Networks","A technical report of DRDO-IISc Programme on Advanced Research in
  Mathematical Engineering",,,TR-PME-2007-08,cs.IT math.IT,,"  Distributed Orthogonal Space-Time Block Codes (DOSTBCs) achieving full
diversity order and single-symbol ML decodability have been introduced recently
for cooperative networks and an upper-bound on the maximal rate of such codes
along with code constructions has been presented. In this report, we introduce
a new class of Distributed STBCs called Semi-orthogonal Precoded Distributed
Single-Symbol Decodable STBCs (S-PDSSDC) wherein, the source performs
co-ordinate interleaving of information symbols appropriately before
transmitting it to all the relays. It is shown that DOSTBCs are a special case
of S-PDSSDCs. A special class of S-PDSSDCs having diagonal covariance matrix at
the destination is studied and an upper bound on the maximal rate of such codes
is derived. The bounds obtained are approximately twice larger than that of the
DOSTBCs. A systematic construction of S-PDSSDCs is presented when the number of
relays $K \geq 4$. The constructed codes are shown to achieve the upper-bound
on the rate when $K$ is of the form 0 modulo 4 or 3 modulo 4. For the rest of
the values of $K$, the constructed codes are shown to have rates higher than
that of DOSTBCs. It is also shown that S-PDSSDCs cannot be constructed with any
form of linear processing at the relays when the source doesn't perform
co-ordinate interleaving of the information symbols.
","[{'version': 'v1', 'created': 'Thu, 30 Aug 2007 18:15:57 GMT'}]",2007-08-31,"[['Harshan', 'J.', ''], ['Rajan', 'B. Sundar', '']]","['Cooperative diversity', 'single-symbol ML decoding', 'distributed space-time coding', 'precoding']"
19190,1702.02047,Ziyuan Gao,"Ziyuan Gao, Christoph Ries, Hans Ulrich Simon and Sandra Zilles",Preference-based Teaching,35 pages,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a new model of teaching named ""preference-based teaching"" and a
corresponding complexity parameter---the preference-based teaching dimension
(PBTD)---representing the worst-case number of examples needed to teach any
concept in a given concept class. Although the PBTD coincides with the
well-known recursive teaching dimension (RTD) on finite classes, it is
radically different on infinite ones: the RTD becomes infinite already for
trivial infinite classes (such as half-intervals) whereas the PBTD evaluates to
reasonably small values for a wide collection of infinite classes including
classes consisting of so-called closed sets w.r.t. a given closure operator,
including various classes related to linear sets over $\mathbb{N}_0$ (whose RTD
had been studied quite recently) and including the class of Euclidean
half-spaces. On top of presenting these concrete results, we provide the reader
with a theoretical framework (of a combinatorial flavor) which helps to derive
bounds on the PBTD.
","[{'version': 'v1', 'created': 'Mon, 6 Feb 2017 18:40:32 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Feb 2017 11:37:57 GMT'}]",2017-02-09,"[['Gao', 'Ziyuan', ''], ['Ries', 'Christoph', ''], ['Simon', 'Hans Ulrich', ''], ['Zilles', 'Sandra', '']]","['teaching dimension', 'preference relation', 'recursive teaching dimension', 'learning halfspaces', 'linear sets']"
19191,1304.4041,Humayun Irshad,"H. Irshad, A. Gouaillard, L. Roux, D. Racoceanu","Multispectral Spatial Characterization: Application to Mitosis Detection
  in Breast Cancer Histopathology",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate detection of mitosis plays a critical role in breast cancer
histopathology. Manual detection and counting of mitosis is tedious and subject
to considerable inter- and intra-reader variations. Multispectral imaging is a
recent medical imaging technology, proven successful in increasing the
segmentation accuracy in other fields. This study aims at improving the
accuracy of mitosis detection by developing a specific solution using
multispectral and multifocal imaging of breast cancer histopathological data.
We propose to enable clinical routine-compliant quality of mitosis
discrimination from other objects. The proposed framework includes
comprehensive analysis of spectral bands and z-stack focus planes, detection of
expected mitotic regions (candidates) in selected focus planes and spectral
bands, computation of multispectral spatial features for each candidate,
selection of multispectral spatial features and a study of different
state-of-the-art classification methods for candidates classification as
mitotic or non mitotic figures. This framework has been evaluated on MITOS
multispectral medical dataset and achieved 60% detection rate and 57%
F-Measure. Our results indicate that multispectral spatial features have more
information for mitosis classification in comparison with white spectral band
features, being therefore a very promising exploration area to improve the
quality of the diagnosis assistance in histopathology.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2013 10:11:34 GMT'}]",2013-04-16,"[['Irshad', 'H.', ''], ['Gouaillard', 'A.', ''], ['Roux', 'L.', ''], ['Racoceanu', 'D.', '']]","['histopathology', 'breast cancer', 'multispectral images', 'multifocal', 'texture characterization', 'classification']"
19192,1212.6531,Hadjtayeb Sabria hts,Sabria Hadj Tayeb and Myriam Noureddine,Domain ontology and multi-criteria analysis for enterprise modeling,"Paper published in IJCSI International Journal of Computer Science
  Issues, Vol. 9, Issue 2, No 2, March 2012 ISSN (Online): 1694-0814",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowing that an enterprise is a complex reality, it is necessary to develop a
modeling framework allowing the description of system structure and dynamics
that alter the structure. The concept of enterprise modeling addresses this
need and many techniques have emerged. Our goal is to provide leaders of
Algerian enterprise an overview of modeling techniques. Thus these managers may
elect, in collaboration with the University, the modeling technique best suited
to their requirements. TWe believe that this could be a step towards an
effective reorganization of the enterprise leading. TThis article proposes a
domain ontology and multi-criteria analysis in the frame of modeling
enterprise. Our approach is based on two stages using the Prot\'eg\'e tool for
the technique representation and the PROMETHEE method for their evaluation. The
result is a ranking between the different techniques, which allows selecting
the most appropriate methodology according to the criteria for a given
Tenterprise.
","[{'version': 'v1', 'created': 'Fri, 28 Dec 2012 16:14:03 GMT'}]",2013-01-01,"[['Tayeb', 'Sabria Hadj', ''], ['Noureddine', 'Myriam', '']]","['T TTEnterprise', 'modeling', 'technique', 'ontology', 'Protégé', 'PROMETHEE', 'ranking', 'decision']"
19193,1403.7022,Hengjun Zhao,Jiang Liu and Naijun Zhan and Hengjun Zhao and Liang Zou,Abstraction of Elementary Hybrid Systems by Variable Transformation,,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Elementary hybrid systems (EHSs) are those hybrid systems (HSs) containing
elementary functions such as exp, ln, sin, cos, etc. EHSs are very common in
practice, especially in safety-critical domains. Due to the non-polynomial
expressions which lead to undecidable arithmetic, verification of EHSs is very
hard. Existing approaches based on partition of state space or
over-approximation of reachable sets suffer from state explosion or inflation
of numerical errors. In this paper, we propose a symbolic abstraction approach
that reduces EHSs to polynomial hybrid systems (PHSs), by replacing all
non-polynomial terms with newly introduced variables. Thus the verification of
EHSs is reduced to the one of PHSs, enabling us to apply all the
well-established verification techniques and tools for PHSs to EHSs. In this
way, it is possible to avoid the limitations of many existing methods. We
illustrate the abstraction approach and its application in safety verification
of EHSs by several real world examples.
","[{'version': 'v1', 'created': 'Thu, 27 Mar 2014 13:38:12 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Oct 2014 11:43:22 GMT'}, {'version': 'v3', 'created': 'Tue, 13 Jan 2015 09:09:07 GMT'}, {'version': 'v4', 'created': 'Wed, 14 Jan 2015 06:33:56 GMT'}]",2015-01-15,"[['Liu', 'Jiang', ''], ['Zhan', 'Naijun', ''], ['Zhao', 'Hengjun', ''], ['Zou', 'Liang', '']]","['hybrid system', 'abstraction', 'elementary function', 'variable transformation', 'verification', 'invariant']"
19194,1704.04766,He Jiang,"Jifeng Xuan, Yan Hu, He Jiang",Debt-Prone Bugs: Technical Debt in Software Maintenance,"9 pages, 4 figures, International Journal of Advancements in
  Computing Technology, 2012",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fixing bugs is an important phase in software development and maintenance. In
practice, the process of bug fixing may conflict with the release schedule.
Such confliction leads to a trade-off between software quality and release
schedule, which is known as the technical debt metaphor. In this article, we
propose the concept of debt-prone bugs to model the technical debt in software
maintenance. We identify three types of debt-prone bugs, namely tag bugs,
reopened bugs, and duplicate bugs. A case study on Mozilla is conducted to
examine the impact of debt-prone bugs in software products. We investigate the
correlation between debt-prone bugs and the product quality. For a product
under development, we build prediction models based on historical products to
predict the time cost of fixing bugs. The result shows that identifying
debt-prone bugs can assist in monitoring and improving software quality.
","[{'version': 'v1', 'created': 'Sun, 16 Apr 2017 12:47:38 GMT'}]",2017-04-18,"[['Xuan', 'Jifeng', ''], ['Hu', 'Yan', ''], ['Jiang', 'He', '']]","['Technical Debt', 'Software Maintenance', 'Open Source Software', 'Software Quality']"
19195,1212.4915,Yifeng Zhong,"Ke Xu, Yifeng Zhong, Huan He","Can P2P Technology Benefit Eyeball ISPs? A Cooperative Profit
  Distribution Answer",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Peer-to-Peer (P2P) technology has been regarded as a promising way to help
Content Providers (CPs) cost-effectively distribute content. However, under the
traditional Internet pricing mechanism, the fact that most P2P traffic flows
among peers can dramatically decrease the profit of ISPs, who may take actions
against P2P and impede the progress of P2P technology. In this paper, we
develop a mathematical framework to analyze such economic issues. Inspired by
the idea from cooperative game theory, we propose a cooperative
profit-distribution model based on Nash Bargaining Solution (NBS), in which
eyeball ISPs and Peer-assisted CPs (PCPs) form two coalitions respectively and
then compute a fair Pareto point to determine profit distribution. Moreover, we
design a fair and feasible mechanism for profit distribution within each
coalition. We show that such a cooperative method not only guarantees the fair
profit distribution among network participators, but also helps to improve the
economic efficiency of the overall network system. To our knowledge, this is
the first work that systematically studies solutions for P2P caused unbalanced
profit distribution and gives a feasible cooperative method to increase and
fairly share profit.
","[{'version': 'v1', 'created': 'Thu, 20 Dec 2012 03:58:43 GMT'}]",2012-12-24,"[['Xu', 'Ke', ''], ['Zhong', 'Yifeng', ''], ['He', 'Huan', '']]","['P2P', 'Internet Service Providers', 'Content Providers', 'Profit Distribution', 'Nash Bargaining Solution']"
19196,1506.00249,Vadim E. Levit,"Adi Jarden, Vadim E. Levit and Eugen Mandrescu","Monotonic Properties of Collections of Maximum Independent Sets of a
  Graph","15 pages, 7 figures",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let G be a simple graph with vertex set V(G). A subset S of V(G) is
independent if no two vertices from S are adjacent. The graph G is known to be
a Konig-Egervary if alpha(G) + mu(G)= |V(G)|, where alpha(G) denotes the size
of a maximum independent set and mu(G) is the cardinality of a maximum
matching. Let Omega(G) denote the family of all maximum independent sets, and f
be the function from the set of subcollections Gamma of Omega(G) such that
f(Gamma) = (the cardinality of the union of elements of Gamma) + (the
cardinality of the intersection of elements of Gamma). Our main finding claims
that f is ""<<""-increasing, where the preorder {Gamma1} << {Gamma2} means that
the union of all elements of {Gamma1} is a subset of the union of all elements
of {Gamma2}, while the intersection of all elements of {Gamma2} is a subset of
the intersection of all elements of {Gamma1}. Let us say that a family {Gamma}
is a Konig-Egervary collection if f(Gamma) = 2*alpha(G). We conclude with the
observation that for every graph G each subcollection of a Konig-Egervary
collection is Konig-Egervary as well.
","[{'version': 'v1', 'created': 'Sun, 31 May 2015 16:09:17 GMT'}]",2015-06-02,"[['Jarden', 'Adi', ''], ['Levit', 'Vadim E.', ''], ['Mandrescu', 'Eugen', '']]","['maximum independent set', 'critical set', 'ker', 'core', 'corona', 'diadem', 'maximum matching', 'K¨onig-Egerv´ary graph']"
19197,1702.04680,Dmitry Kislyuk,"Andrew Zhai, Dmitry Kislyuk, Yushi Jing, Michael Feng, Eric Tzeng,
  Jeff Donahue, Yue Li Du, Trevor Darrell",Visual Discovery at Pinterest,,,,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  Over the past three years Pinterest has experimented with several visual
search and recommendation services, including Related Pins (2014), Similar
Looks (2015), Flashlight (2016) and Lens (2017). This paper presents an
overview of our visual discovery engine powering these services, and shares the
rationales behind our technical and product decisions such as the use of object
detection and interactive user interfaces. We conclude that this visual
discovery engine significantly improves engagement in both search and
recommendation tasks.
","[{'version': 'v1', 'created': 'Wed, 15 Feb 2017 16:52:52 GMT'}, {'version': 'v2', 'created': 'Sat, 25 Mar 2017 18:31:39 GMT'}]",2017-03-28,"[['Zhai', 'Andrew', ''], ['Kislyuk', 'Dmitry', ''], ['Jing', 'Yushi', ''], ['Feng', 'Michael', ''], ['Tzeng', 'Eric', ''], ['Donahue', 'Jeff', ''], ['Du', 'Yue Li', ''], ['Darrell', 'Trevor', '']]","['visual search', 'recommendation systems', 'convnets', 'object detection']"
19198,1007.0880,Vadim E. Levit,Vadim E. Levit and Eugen Mandrescu,On the independence polynomial of an antiregular graph,"11 pages, 5 figures",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A graph with at most two vertices of the same degree is called antiregular
(Merris 2003), maximally nonregular (Zykov 1990) or quasiperfect (Behzad,
Chartrand 1967). If s_{k} is the number of independent sets of cardinality k in
a graph G, then I(G;x) = s_{0} + s_{1}x + ... + s_{alpha}x^{alpha} is the
independence polynomial of G (Gutman, Harary 1983), where alpha = alpha(G) is
the size of a maximum independent set. In this paper we derive closed formulae
for the independence polynomials of antiregular graphs. In particular, we
deduce that every antiregular graph A is uniquely defined by its independence
polynomial I(A;x), within the family of threshold graphs. Moreover, I(A;x) is
logconcave with at most two real roots, and I(A;-1) belongs to {-1,0}.
","[{'version': 'v1', 'created': 'Tue, 6 Jul 2010 12:55:07 GMT'}]",2010-07-07,"[['Levit', 'Vadim E.', ''], ['Mandrescu', 'Eugen', '']]","['independent set', 'independence polynomial', 'antiregular graph', 'thresholdgraph']"
19199,1306.4595,Abdoulaye Diop,"Abdoulaye Diop, Yue Qi, Qin Wang and Shariq Hussain","An Advanced Survey on Secure Energy-Efficient Hierarchical Routing
  Protocols in Wireless Sensor Networks","11 pages, 7 tables, 4 figures,30 refences. arXiv admin note: text
  overlap with arXiv:1011.1529, arXiv:1301.5065 by other authors","IJCSI , Volume 10, Issue 1, January 2013",,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Wireless Sensor Networks (WSNs) are often deployed in hostile environments,
which make such networks highly vulnerable and increase the risk of attacks
against this type of network. WSN comprise of large number of sensor nodes with
different hardware abilities and functions. Due to the limited memory resources
and energy constraints, complex security algorithms cannot be used in sensor
networks. Therefore, it is necessary to balance between the security level and
the associated energy consumption overhead to mitigate the security risks.
Hierarchical routing protocol is more energy-efficient than other routing
protocols in WSNs. Many secure cluster-based routing protocols have been
proposed in the literature to overcome these constraints. In this paper, we
discuss Secure Energy-Efficient Hierarchical Routing Protocols in WSNs and
compare them in terms of security, performance and efficiency. Security issues
for WSNs and their solutions are also discussed.
","[{'version': 'v1', 'created': 'Wed, 19 Jun 2013 16:10:39 GMT'}]",2013-06-20,"[['Diop', 'Abdoulaye', ''], ['Qi', 'Yue', ''], ['Wang', 'Qin', ''], ['Hussain', 'Shariq', '']]","['Wireless sensor network', 'Hierarchical routing protocol', 'Security']"
19200,0909.0611,Katsutoshi Yoshida,"Katsutoshi Yoshida, Atsushi Higeta and Shinichi Watanabe",Effects of Mechanical Coupling on the Dynamics of Balancing Tasks,"18 pages, 16 figures","International Journal of Innovative Computing, Information and
  Control, Vol.7, No.4, April 2011, pp.1661-1674",,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Coupled human balancing tasks are investigated based on both pseudo-neural
controllers characterized by time-delayed feedback with random gain and natural
human balancing tasks. It is shown numerically that, compared to single
balancing tasks, balancing tasks coupled by mechanical structures exhibit
enhanced stability against balancing errors in terms of both amplitude and
velocity and also improve the tracking ability of the controllers. We then
perform an experiment in which numerical pseudo-neural controllers are replaced
with natural human balancing tasks carried out using computer mice. The results
reveal that the coupling structure generates asymmetric tracking abilities in
subjects whose tracking abilities are nearly symmetric in their single
balancing tasks.
","[{'version': 'v1', 'created': 'Thu, 3 Sep 2009 09:38:18 GMT'}, {'version': 'v2', 'created': 'Mon, 5 Jul 2010 00:02:40 GMT'}]",2011-03-14,"[['Yoshida', 'Katsutoshi', ''], ['Higeta', 'Atsushi', ''], ['Watanabe', 'Shinichi', '']]","['Neural Controller', 'Mechanical Coupling', 'Visuomotor Tracking', 'Stability', 'Sensitivity']"
19201,1004.1461,Mohamed Ali Kaafar,"Pere Manils, Chaabane Abdelberri, Stevens Le Blond, Mohamed Ali
  Kaafar, Claude Castelluccia, Arnaud Legout, Walid Dabbous (All - INRIA Sophia
  Antipolis / INRIA Rh\^one-Alpes)",Compromising Tor Anonymity Exploiting P2P Information Leakage,,,,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Privacy of users in P2P networks goes far beyond their current usage and is a
fundamental requirement to the adoption of P2P protocols for legal usage. In a
climate of cold war between these users and anti-piracy groups, more and more
users are moving to anonymizing networks in an attempt to hide their identity.
However, when not designed to protect users information, a P2P protocol would
leak information that may compromise the identity of its users. In this paper,
we first present three attacks targeting BitTorrent users on top of Tor that
reveal their real IP addresses. In a second step, we analyze the Tor usage by
BitTorrent users and compare it to its usage outside of Tor. Finally, we depict
the risks induced by this de-anonymization and show that users' privacy
violation goes beyond BitTorrent traffic and contaminates other protocols such
as HTTP.
","[{'version': 'v1', 'created': 'Fri, 9 Apr 2010 06:08:08 GMT'}]",2010-04-12,"[['Manils', 'Pere', '', 'All - INRIA Sophia\n  Antipolis / INRIA Rhône-Alpes'], ['Abdelberri', 'Chaabane', '', 'All - INRIA Sophia\n  Antipolis / INRIA Rhône-Alpes'], ['Blond', 'Stevens Le', '', 'All - INRIA Sophia\n  Antipolis / INRIA Rhône-Alpes'], ['Kaafar', 'Mohamed Ali', '', 'All - INRIA Sophia\n  Antipolis / INRIA Rhône-Alpes'], ['Castelluccia', 'Claude', '', 'All - INRIA Sophia\n  Antipolis / INRIA Rhône-Alpes'], ['Legout', 'Arnaud', '', 'All - INRIA Sophia\n  Antipolis / INRIA Rhône-Alpes'], ['Dabbous', 'Walid', '', 'All - INRIA Sophia\n  Antipolis / INRIA Rhône-Alpes']]","['Anonymizing Networks', 'Privacy', 'Tor', 'BitTorrent']"
19202,0707.3449,Jean Mairesse,"Thu-Ha Dao-Thi (LIAFA), Jean Mairesse (LIAFA)",Zero-automatic queues and product form,,"Advances in Applied Probability 39, 2 (2007) 429-461",,,cs.DM,,"  We introduce and study a new model: 0-automatic queues. Roughly, 0-automatic
queues are characterized by a special buffering mechanism evolving like a
random walk on some infinite group or monoid. The salient result is that all
stable 0-automatic queues have a product form stationary distribution and a
Poisson output process. When considering the two simplest and extremal cases of
0-automatic queues, we recover the simple M/M/1 queue, and Gelenbe's G-queue
with positive and negative customers.
","[{'version': 'v1', 'created': 'Mon, 23 Jul 2007 20:41:43 GMT'}]",2007-07-25,"[['Dao-Thi', 'Thu-Ha', '', 'LIAFA'], ['Mairesse', 'Jean', '', 'LIAFA']]","['Queueing theory', 'M/M/1 queue', 'G-queue', 'quasi-reversibility', 'product form', 'QuasiBirth-and-Death process']"
19203,1506.00527,Gianluigi Ciocca,"Simone Bianco, Gianluigi Ciocca","User Preferences Modeling and Learning for Pleasing Photo Collage
  Generation","To be published in ACM Transactions on Multimedia Computing,
  Communications, and Applications (TOMM)",,,,cs.MM cs.CV cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider how to automatically create pleasing photo collages
created by placing a set of images on a limited canvas area. The task is
formulated as an optimization problem. Differently from existing
state-of-the-art approaches, we here exploit subjective experiments to model
and learn pleasantness from user preferences. To this end, we design an
experimental framework for the identification of the criteria that need to be
taken into account to generate a pleasing photo collage. Five different
thematic photo datasets are used to create collages using state-of-the-art
criteria. A first subjective experiment where several subjects evaluated the
collages, emphasizes that different criteria are involved in the subjective
definition of pleasantness. We then identify new global and local criteria and
design algorithms to quantify them. The relative importance of these criteria
are automatically learned by exploiting the user preferences, and new collages
are generated. To validate our framework, we performed several psycho-visual
experiments involving different users. The results shows that the proposed
framework allows to learn a novel computational model which effectively encodes
an inter-user definition of pleasantness. The learned definition of
pleasantness generalizes well to new photo datasets of different themes and
sizes not used in the learning. Moreover, compared with two state of the art
approaches, the collages created using our framework are preferred by the
majority of the users.
","[{'version': 'v1', 'created': 'Mon, 1 Jun 2015 15:20:29 GMT'}]",2015-06-02,"[['Bianco', 'Simone', ''], ['Ciocca', 'Gianluigi', '']]","['Image Processing', 'Computer Vision, Mathematics of Computing, Optimization', 'Learning, Artificial Intelligence,Image Processing', 'Computer Vision, Applications']"
19204,1510.03354,Julian Araoz PhD,Juli\'an Ar\'aoz and Cristina Zoltan,Parallel Triangles Counting Using Pipelining,,,,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  The generalized method to have a parallel solution to a computational
problem, is to find a way to use Divide & Conquer paradigm in order to have
processors acting on its own data and therefore all can be scheduled in
parallel. MapReduce is an example of this approach: Input data is transformed
by the mappers, in order to feed the reducers that can run in parallel. In
general this schema gives efficient problem solutions, but it stops being true
when the replication factor grows. We present another program schema that is
useful for describing problem solutions, that can exploit dynamic pipeline
parallelism without having to deal with replica- tion factors. We present the
schema in an example: counting triangles in graphs, in particular when the
graph do not fit in memory. We describe the solution in NiMo, a graphical
programming language that implements the implicitly functional parallel data ow
model of computation. The solution obtained using NiMo, is architecture
agnostic and can be deployed in any parallel/distributed architecture adapting
dynamically the processor usage to input characteristics.
","[{'version': 'v1', 'created': 'Mon, 12 Oct 2015 16:21:21 GMT'}]",2015-10-13,"[['Aráoz', 'Julián', ''], ['Zoltan', 'Cristina', '']]","['Pipelining', 'triangle-counting', 'parallel algorithms']"
19205,1409.3276,Yingtao Jiang,"Bill Jason Tomas, Yingtao Jiang and Mei Yang",Co-Emulation of Scan-Chain Based Designs Utilizing SCE-MI Infrastructure,,,,,cs.OH,http://creativecommons.org/licenses/publicdomain/,"  As the complexity of the scan algorithm is dependent on the number of design
registers, large SoC scan designs can no longer be verified in RTL simulation
unless partitioned into smaller sub-blocks. This paper proposes a methodology
to decrease scan-chain verification time utilizing SCE-MI, a widely used
communication protocol for emulation, and an FPGA-based emulation platform. A
high-level (SystemC) testbench and FPGA synthesizable hardware transactor
models are developed for the scan-chain ISCAS89 S400 benchmark circuit for
high-speed communication between the host CPU workstation and the FPGA
emulator. The emulation results are compared to other verification
methodologies (RTL Simulation, Simulation Acceleration, and Transaction-based
emulation), and found to be 82% faster than regular RTL simulation. In
addition, the emulation runs in the MHz speed range, allowing the incorporation
of software applications, drivers, and operating systems, as opposed to the Hz
range in RTL simulation or sub-megahertz range as accomplished in
transaction-based emulation. In addition, the integration of scan testing and
acceleration/emulation platforms allows more complex DFT methods to be
developed and tested on a large scale system, decreasing the time to market for
products.
","[{'version': 'v1', 'created': 'Wed, 10 Sep 2014 23:25:57 GMT'}]",2014-09-12,"[['Tomas', 'Bill Jason', ''], ['Jiang', 'Yingtao', ''], ['Yang', 'Mei', '']]","['Design verification', 'emulation', 'SoC', 'scan-chain', 'SCE-MI', 'FPGA']"
19206,1106.4247,Devorah Kletenik,Lisa Hellerstein and Devorah Kletenik,On the gap between ess(f) and cnf_size(f),,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a Boolean function f, the quantity ess(f) denotes the largest set of
assignments that falsify f, no two of which falsify a common implicate of f.
Although ess(f)$ is clearly a lower bound on cnf_size(f) (the minimum number of
clauses in a CNF formula for f), Cepek et al. showed that it is not, in
general, a tight lower bound. They gave examples of functions f for which there
is a small gap between ess(f) and cnf_size(f). We demonstrate significantly
larger gaps. We show that the gap can be exponential in n for arbitrary Boolean
functions, and Theta(sqrt{n}) for Horn functions, where n is the number of
variables of f. We also introduce a natural extension of the quantity ess(f),
which we call ess_k(f), which is the largest set of assignments, no k of which
falsify a common implicate of f.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2011 16:02:37 GMT'}]",2011-06-22,"[['Hellerstein', 'Lisa', ''], ['Kletenik', 'Devorah', '']]","['DNF', 'CNF', 'ess(f)', 'Horn functions', 'formula size']"
19207,1402.6764,Hazlina Haron,"Hazlina Haron, Abdul Azim Abd. Ghani","A method to identify potential ambiguous Malay words through Ambiguity
  Attributes mapping: An exploratory Study","Paper was presented at The Fourth International Conference of
  Computer Science and Information Technology (CCSIT2014)in Sydney, Australia
  on Feb 22, 2014",,,,cs.SE cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe here a methodology to identify a list of ambiguous Malay words
that are commonly being used in Malay documentations such as Requirement
Specification. We compiled several relevant and appropriate requirement quality
attributes and sentence rules from previous literatures and adopt it to come
out with a set of ambiguity attributes that most suit Malay words. The
extracted Malay ambiguous words (potential) are then being mapped onto the
constructed ambiguity attributes to confirm their vagueness. The list is then
verified by Malay linguist experts. This paper aims to identify a list of
potential ambiguous words in Malay as an attempt to assist writers to avoid
using the vague words while documenting Malay Requirement Specification as well
as to any other related Malay documentation. The result of this study is a list
of 120 potential ambiguous Malay words that could act as guidelines in writing
Malay sentences
","[{'version': 'v1', 'created': 'Thu, 27 Feb 2014 01:47:46 GMT'}]",2014-02-28,"[['Haron', 'Hazlina', ''], ['Ghani', 'Abdul Azim Abd.', '']]","['Vagueness', 'Requirement Quality Attributes', 'Natural Language Processing', 'Malay Ambiguity', 'Ambiguity']"
19208,1402.2404,Sneha Jm,"J.M. Sneha, G.S.Nagaraja",Virtual Learning Environments-A Survey,"5 pages, IJCTT Journal",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is based on the study of existing literature, highlights the
current state of the work proposed to implement technically enhanced learning.
  Technology developments and network infrastructure improvements, specifically
the world wide web) are providing exciting opportunities for the use of
computers in all areas. These developments have fit together with an evolving
role for education as more students wish to study at a distance, part time, or
wish to integrate their education with their professional career. With the
market becoming increasingly mature, e learning has almost become a major plank
in both national and institutional strategies.
  At the same time, virtual learning system is also gaining its popularity
among its users. It has brought in a great revolution in itself. In the
advanced learning strategy, virtual learning systems depends on level and
sector of working, usage of functions, purpose of usage, required online
resources to perform computationally intensive operations such as information
sharing and collaborative work. Often the institutions prefer the latest and
the best technology which is cost effective and provide the best features which
meet up all requirements. Virtual learning environment enables operator
professional to bring together in one place a variety of prevailing resources,
suchlike tasks and formative feedback, and links to law reports, statutes and
journal articles, all intended at summing up value to student learning managing
learning experience without the burden of communication and providing
successful delivery of education and training with flexibility.
  In spite of the hype achieved by organizations in technically enhanced
learning, the growth of the virtual learning systems users is still below
expectations due to the risks associated with the implementation strategy and
provision of technical support.
","[{'version': 'v1', 'created': 'Tue, 11 Feb 2014 09:02:58 GMT'}]",2014-02-12,"[['Sneha', 'J. M.', ''], ['Nagaraja', 'G. S.', '']]","['collaborative learning', 'lms', 'cms', 'web portals', 'software consortia', 'e-learning']"
19209,1506.02812,Xuechong Guan,Xuechong Guan,A study on central soft sets: Definitions and basic operations,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a new kind of soft sets related with some common decision
making problems in real life called central soft sets is introduced. Properties
of some basic operations on central soft sets are shown. It is investigated
that some classic operations between soft sets can be obtained by central soft
sets with selecting different central sets. We initiate the concepts of an
evaluation system for a parameters set and its optional solutions. An algorithm
is presented to solve such decision making problems.
","[{'version': 'v1', 'created': 'Tue, 9 Jun 2015 07:54:03 GMT'}]",2015-06-10,"[['Guan', 'Xuechong', '']]","['central soft set', 'soft set', 'intersection', 'union', 'evaluation system']"
19210,1710.01801,Mohammad Shojafar,"Paola G. Vinueza Naranjo, Zahra Pooranian, Mohammad Shojafar, Mauro
  Conti, Rajkumar Buyya","FOCAN: A Fog-supported Smart City Network Architecture for Management of
  Applications in the Internet of Everything Environments","Sapienza University of Rome, 3 Oct. 2017, in review, 16 pages, 6
  figures",,,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smart city vision brings emerging heterogeneous communication technologies
such as Fog Computing (FC) together to substantially reduce the latency and
energy consumption of Internet of Everything (IoE) devices running various
applications. The key feature that distinguishes the FC paradigm for smart
cities is that it spreads communication and computing resources over the
wired/wireless access network (e.g., proximate access points and base stations)
to provide resource augmentation (e.g., cyberforaging) for resource and
energy-limited wired/wireless (possibly mobile) things. Moreover, smart city
applications are developed with the goal of improving the management of urban
flows and allowing real-time responses to challenges that can arise in users'
transactional relationships. This article presents a Fog-supported smart city
network architecture called Fog Computing Architecture Network (FOCAN), a
multi-tier structure in which the applications running on things jointly
compute, route, and communicate with one another through the smart city
environment to decrease latency and improve energy provisioning and the
efficiency of services among things with different capabilities. An important
concern that arises with the introduction of FOCAN is the need to avoid
transferring data to/from distant things and instead to cover the nearest
region for an IoT application. We define three types of communications between
FOCAN devices (e.g., interprimary, primary, and secondary communication) to
manage applications in a way that meets the quality of service standards for
the IoE. One of the main advantages of FOCAN is that the devices can provide
the services with low energy usage and in an efficient manner. Simulation
results for a selected case study demonstrate the tremendous impact of the
FOCAN energy-efficient solution on the communication performance of various
types of things in smart cities.
","[{'version': 'v1', 'created': 'Wed, 4 Oct 2017 20:55:39 GMT'}]",2017-10-06,"[['Naranjo', 'Paola G. Vinueza', ''], ['Pooranian', 'Zahra', ''], ['Shojafar', 'Mohammad', ''], ['Conti', 'Mauro', ''], ['Buyya', 'Rajkumar', '']]","['Smart City', 'Internet of Everything (IoE)', 'Fog Computing', 'RoutingAlgorithm', 'Computing and Communication']"
19211,1004.1748,Rdv Ijcsis,"P.S. Revenkar, Anisa Anjum, W. Z. Gandhare",Secure Iris Authentication Using Visual Cryptography,"IEEE Publication format, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","IJCSIS, Vol. 7 No. 3, March 2010, 217-221",,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Biometrics deal with automated methods of identifying a person or verifying
the identity of a person based on physiological or behavioral characteristics.
Visual cryptography is a secret sharing scheme where a secret image is
encrypted into the shares which independently disclose no information about the
original secret image. As biometric template are stored in the centralized
database, due to security threats biometric template may be modified by
attacker. If biometric template is altered authorized user will not be allowed
to access the resource. To deal this issue visual cryptography schemes can be
applied to secure the iris template. Visual cryptography provides great means
for helping such security needs as well as extra layer of authentication.
","[{'version': 'v1', 'created': 'Sat, 10 Apr 2010 22:33:24 GMT'}]",2010-04-13,"[['Revenkar', 'P. S.', ''], ['Anjum', 'Anisa', ''], ['Gandhare', 'W. Z.', '']]","['component; Biometrics', 'Visual cryptography', 'Iris', 'Authentication']"
19212,1501.04473,Mansaf Alam Dr,"Shuchi Sethi, Kashish Ara Shakil and Mansaf Alam",Seeking Black Lining In Cloud,,,,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work is focused on attacks on confidentiality that require time
synchronization. This manuscript proposes a detection framework for covert
channel perspective in cloud security. This problem is interpreted as a binary
classification problem and the algorithm proposed is based on certain features
that emerged after data analysis of Google cluster trace that forms base for
analyzing attack free data. This approach can be generalized to study the flow
of other systems and fault detection. The detection framework proposed does not
make assumptions pertaining to data distribution as a whole making it suitable
to meet cloud dynamism.
","[{'version': 'v1', 'created': 'Mon, 19 Jan 2015 12:33:55 GMT'}]",2015-01-20,"[['Sethi', 'Shuchi', ''], ['Shakil', 'Kashish Ara', ''], ['Alam', 'Mansaf', '']]","['Covert channel', 'cloud security', 'virtual machines', 'bus contention']"
19213,1412.8079,Ayoub Bagheri,"Ayoub Bagheri, Mohamad Saraee","Persian Sentiment Analyzer: A Framework based on a Novel Feature
  Selection Method",,"International Journal of Artificial Intelligence 12.2 (2014):
  115-129",,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the recent decade, with the enormous growth of digital content in internet
and databases, sentiment analysis has received more and more attention between
information retrieval and natural language processing researchers. Sentiment
analysis aims to use automated tools to detect subjective information from
reviews. One of the main challenges in sentiment analysis is feature selection.
Feature selection is widely used as the first stage of analysis and
classification tasks to reduce the dimension of problem, and improve speed by
the elimination of irrelevant and redundant features. Up to now as there are
few researches conducted on feature selection in sentiment analysis, there are
very rare works for Persian sentiment analysis. This paper considers the
problem of sentiment classification using different feature selection methods
for online customer reviews in Persian language. Three of the challenges of
Persian text are using of a wide variety of declensional suffixes, different
word spacing and many informal or colloquial words. In this paper we study
these challenges by proposing a model for sentiment classification of Persian
review documents. The proposed model is based on lemmatization and feature
selection and is employed Naive Bayes algorithm for classification. We evaluate
the performance of the model on a manually gathered collection of cellphone
reviews, where the results show the effectiveness of the proposed approaches.
","[{'version': 'v1', 'created': 'Sat, 27 Dec 2014 21:00:24 GMT'}]",2014-12-30,"[['Bagheri', 'Ayoub', ''], ['Saraee', 'Mohamad', '']]","['Natural language processing', 'sentiment analysis', 'sentiment classification', 'feature selection', 'Persian language', 'Naive Bayes algorithm']"
19214,1506.04767,Christopher Quinn,Christopher J. Quinn and Ali Pinar and Negar Kiyavash,Bounded Degree Approximations of Stochastic Networks,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose algorithms to approximate directed information graphs. Directed
information graphs are probabilistic graphical models that depict causal
dependencies between stochastic processes in a network. The proposed algorithms
identify optimal and near-optimal approximations in terms of Kullback-Leibler
divergence. The user-chosen sparsity trades off the quality of the
approximation against visual conciseness and computational tractability. One
class of approximations contains graphs with specified in-degrees. Another
class additionally requires that the graph is connected. For both classes, we
propose algorithms to identify the optimal approximations and also near-optimal
approximations, using a novel relaxation of submodularity. We also propose
algorithms to identify the r-best approximations among these classes, enabling
robust decision making.
","[{'version': 'v1', 'created': 'Mon, 15 Jun 2015 20:26:51 GMT'}]",2015-06-17,"[['Quinn', 'Christopher J.', ''], ['Pinar', 'Ali', ''], ['Kiyavash', 'Negar', '']]","['probabilistic graphical models', 'network inference', 'causality', 'submodularity', 'approximation algorithms']"
19215,1802.09317,Eric Sanchis,Eric Sanchis,A Model of Free Will for Artificial Entities,"10th International Conference on Advanced Cognitive Technologies and
  Applications, (COGNITIVE 2018), February 18-22, Barcelona, Spain",,,,cs.MA cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The impression of free will is the feeling according to which our choices are
neither imposed from our inside nor from outside. It is the sense we are the
ultimate cause of our acts. In direct opposition with the universal
determinism, the existence of free will continues to be discussed. In this
paper, free will is linked to a decisional mechanism: an agent is provided with
free will if having performed a predictable choice Cp, it can immediately
perform another choice Cr in a random way. The intangible feeling of free will
is replaced by a decision-making process including a predictable
decision-making process immediately followed by an unpredictable decisional
one.
","[{'version': 'v1', 'created': 'Mon, 26 Feb 2018 14:29:03 GMT'}]",2018-02-27,"[['Sanchis', 'Eric', '']]","['free will', 'artificial entities', 'agent', 'three-step decisionnal process', 'synthetic property']"
19216,1607.02278,"Lasse Leskel\""a","Mindaugas Bloznelis and Lasse Leskel\""a",Diclique clustering in a directed random graph,"12 pages, 2 figures",,,,cs.SI math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We discuss a notion of clustering for directed graphs, which describes how
likely two followers of a node are to follow a common target. The associated
network motifs, called dicliques or bi-fans, have been found to be key
structural components in various real-world networks. We introduce a two-mode
statistical network model consisting of actors and auxiliary attributes, where
an actor i decides to follow an actor j whenever i demands an attribute
supplied by j. We show that the digraph admits nontrivial clustering properties
of the aforementioned type, as well as power-law indegree and outdegree
distributions.
","[{'version': 'v1', 'created': 'Fri, 8 Jul 2016 09:07:52 GMT'}]",2016-07-11,"[['Bloznelis', 'Mindaugas', ''], ['Leskelä', 'Lasse', '']]","['intersection graph', 'two-mode network', 'affiliation network', 'digraph', 'diclique', 'bi-fan', 'complex network']"
19217,1202.5447,Zhongkui Li,"Zhongkui Li, Xiangdong Liu, Mengyin Fu, Lihua Xie","Global $H_\infty$ Consensus of Multi-Agent Systems with Lipschitz
  Nonlinear Dynamics","15 pages, 6 figures",,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the global consensus problems of a class of nonlinear
multi-agent systems with Lipschitz nonlinearity and directed communication
graphs, by using a distributed consensus protocol based on the relative states
of neighboring agents. A two-step algorithm is presented to construct a
protocol, under which a Lipschitz multi-agent system without disturbances can
reach global consensus for a strongly connected directed communication graph.
Another algorithm is then given to design a protocol which can achieve global
consensus with a guaranteed $H_\infty$ performance for a Lipschitz multiagent
system subject to external disturbances. The case with a leader-follower
communication graph is also discussed. Finally, the effectiveness of the
theoretical results is demonstrated through a network of single-link
manipulators.
","[{'version': 'v1', 'created': 'Fri, 24 Feb 2012 13:24:38 GMT'}]",2012-02-27,"[['Li', 'Zhongkui', ''], ['Liu', 'Xiangdong', ''], ['Fu', 'Mengyin', ''], ['Xie', 'Lihua', '']]","['Multi-agent system', 'global consensus', 'Lipschitz nonlinearity', 'H∞ control']"
19218,1704.01785,Johannes Rauh,Guido Montufar and Johannes Rauh,Geometry of Policy Improvement,8 pages,,,,cs.AI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the geometry of optimal memoryless time independent decision
making in relation to the amount of information that the acting agent has about
the state of the system. We show that the expected long term reward, discounted
or per time step, is maximized by policies that randomize among at most $k$
actions whenever at most $k$ world states are consistent with the agent's
observation. Moreover, we show that the expected reward per time step can be
studied in terms of the expected discounted reward. Our main tool is a
geometric version of the policy improvement lemma, which identifies a
polyhedral cone of policy changes in which the state value function increases
for all states.
","[{'version': 'v1', 'created': 'Thu, 6 Apr 2017 11:17:54 GMT'}]",2017-04-07,"[['Montufar', 'Guido', ''], ['Rauh', 'Johannes', '']]","['Partially Observable Markov Decision Process', 'Reinforcement Learning', 'memoryless stochastic policy', 'policy gradient theorem']"
19219,1312.2096,Rui Guo Mr.,"Rui Guo, Hongzhi Wang, Lucheng Zhong, Jianzhong Li, and Hong Gao","Harbinger: An Analyzing and Predicting System for Online Social Network
  Users' Behavior",submitted to DASFAA demo,,,,cs.SI physics.soc-ph,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Online Social Network (OSN) is one of the hottest innovations in the past
years, and the active users are more than a billion. For OSN, users' behavior
is one of the important factors to study. This demonstration proposal presents
Harbinger, an analyzing and predicting system for OSN users' behavior. In
Harbinger, we focus on tweets' timestamps (when users post or share messages),
visualize users' post behavior as well as message retweet number and build
adjustable models to predict users' behavior. Predictions of users' behavior
can be performed with the discovered behavior models and the results can be
applied to many applications such as tweet crawler and advertisement.
","[{'version': 'v1', 'created': 'Sat, 7 Dec 2013 14:09:20 GMT'}]",2013-12-10,"[['Guo', 'Rui', ''], ['Wang', 'Hongzhi', ''], ['Zhong', 'Lucheng', ''], ['Li', 'Jianzhong', ''], ['Gao', 'Hong', '']]","['Social Network', 'User Behavior', 'Message Timestamp']"
19220,1502.05786,Arpan Mukhopadhyay,"Arpan Mukhopadhyay, A. Karthik, Ravi R. Mazumdar","Randomized Assignment of Jobs to Servers in Heterogeneous Clusters of
  Shared Servers for Low Delay",,,,,cs.DC cs.PF cs.SY math.PR stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the job assignment problem in a multi-server system consisting of
$N$ parallel processor sharing servers, categorized into $M$ ($\ll N$)
different types according to their processing capacity or speed. Jobs of random
sizes arrive at the system according to a Poisson process with rate $N
\lambda$. Upon each arrival, a small number of servers from each type is
sampled uniformly at random. The job is then assigned to one of the sampled
servers based on a selection rule. We propose two schemes, each corresponding
to a specific selection rule that aims at reducing the mean sojourn time of
jobs in the system.
  We first show that both methods achieve the maximal stability region. We then
analyze the system operating under the proposed schemes as $N \to \infty$ which
corresponds to the mean field. Our results show that asymptotic independence
among servers holds even when $M$ is finite and exchangeability holds only
within servers of the same type. We further establish the existence and
uniqueness of stationary solution of the mean field and show that the tail
distribution of server occupancy decays doubly exponentially for each server
type. When the estimates of arrival rates are not available, the proposed
schemes offer simpler alternatives to achieving lower mean sojourn time of
jobs, as shown by our numerical studies.
","[{'version': 'v1', 'created': 'Fri, 20 Feb 2015 06:51:01 GMT'}]",2015-02-23,"[['Mukhopadhyay', 'Arpan', ''], ['Karthik', 'A.', ''], ['Mazumdar', 'Ravi R.', '']]","['Processor sharing', 'power-of-two', 'mean field', 'asymptotic independence', 'stability', 'propagation of chaos']"
19221,1802.06993,Xiaoqi Li,"Xiaoqi Li, Peng Jiang, Ting Chen, Xiapu Luo, Qiaoyan Wen",A Survey on the Security of Blockchain Systems,Published in Journal: Future Generation Computer Systems (2020),,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since its inception, the blockchain technology has shown promising
application prospects. From the initial cryptocurrency to the current smart
contract, blockchain has been applied to many fields. Although there are some
studies on the security and privacy issues of blockchain, there lacks a
systematic examination on the security of blockchain systems. In this paper, we
conduct a systematic study on the security threats to blockchain and survey the
corresponding real attacks by examining popular blockchain systems. We also
review the security enhancement solutions for blockchain, which could be used
in the development of various blockchain systems, and suggest some future
directions to stir research efforts into this area.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 07:27:13 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Mar 2018 09:44:40 GMT'}, {'version': 'v3', 'created': 'Wed, 4 Nov 2020 16:41:46 GMT'}]",2020-11-05,"[['Li', 'Xiaoqi', ''], ['Jiang', 'Peng', ''], ['Chen', 'Ting', ''], ['Luo', 'Xiapu', ''], ['Wen', 'Qiaoyan', '']]","['blockchain', 'security', 'cryptocurrency', 'smart contract']"
19222,1505.02027,Maha Alodeh,"Maha Alodeh, Symeon Chatzinotas, Bjorn Ottersten","Joint Channel Estimation and Pilot Allocation in Underlay Cognitive MISO
  Networks","6 pages, 2 figures, invited paper to IWCMC 2014",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cognitive radios have been proposed as agile technologies to boost the
spectrum utilization. This paper tackles the problem of channel estimation and
its impact on downlink transmissions in an underlay cognitive radio scenario.
We consider primary and cognitive base stations, each equipped with multiple
antennas and serving multiple users. Primary networks often suffer from the
cognitive interference, which can be mitigated by deploying beamforming at the
cognitive systems to spatially direct the transmissions away from the primary
receivers. The accuracy of the estimated channel state information (CSI) plays
an important role in designing accurate beamformers that can regulate the
amount of interference. However, channel estimate is affected by interference.
Therefore, we propose different channel estimation and pilot allocation
techniques to deal with the channel estimation at the cognitive systems, and to
reduce the impact of contamination at the primary and cognitive systems. In an
effort to tackle the contamination problem in primary and cognitive systems, we
exploit the information embedded in the covariance matrices to successfully
separate the channel estimate from other users' channels in correlated
cognitive single input multiple input (SIMO) channels. A minimum mean square
error (MMSE) framework is proposed by utilizing the second order statistics to
separate the overlapping spatial paths that create the interference. We
validate our algorithms by simulation and compare them to the state of the art
techniques.
","[{'version': 'v1', 'created': 'Fri, 8 May 2015 13:12:44 GMT'}]",2015-05-11,"[['Alodeh', 'Maha', ''], ['Chatzinotas', 'Symeon', ''], ['Ottersten', 'Bjorn', '']]","['Pilot contamination', 'pilot allocation', 'cognitiveradio', 'channel estimation']"
19223,1004.3568,Vishal Goyal,"Vikram Singh, Sapna Nagpal",Integrating User's Domain Knowledge with Association Rule Mining,"International Journal of Computer Science Issues online at
  http://ijcsi.org/articles/Integrating-Users-Domain-Knowledge-with-Association-Rule-Mining.php","IJCSI, Volume 7, Issue 2, March 2010",,,cs.DB cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a variation of Apriori algorithm that includes the role
of domain expert to guide and speed up the overall knowledge discovery task.
Usually, the user is interested in finding relationships between certain
attributes instead of the whole dataset. Moreover, he can help the mining
algorithm to select the target database which in turn takes less time to find
the desired association rules. Variants of the standard Apriori and Interactive
Apriori algorithms have been run on artificial datasets. The results show that
incorporating user's preference in selection of target attribute helps to
search the association rules efficiently both in terms of space and time.
","[{'version': 'v1', 'created': 'Tue, 20 Apr 2010 20:37:32 GMT'}]",2010-04-22,"[['Singh', 'Vikram', ''], ['Nagpal', 'Sapna', '']]","['Domain', 'association rule', 'data mining', 'Apriori', 'interactive Apriori']"
19224,1506.01762,Daisuke Ishii,"Daisuke Ishii, Naoki Yonezaki, Alexandre Goldsztejn",Monitoring Bounded LTL Properties Using Interval Analysis,Appeared in NSV'15,,,,cs.LO cs.NA cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Verification of temporal logic properties plays a crucial role in proving the
desired behaviors of hybrid systems. In this paper, we propose an interval
method for verifying the properties described by a bounded linear temporal
logic. We relax the problem to allow outputting an inconclusive result when
verification process cannot succeed with a prescribed precision, and present an
efficient and rigorous monitoring algorithm that demonstrates that the problem
is decidable. This algorithm performs a forward simulation of a hybrid
automaton, detects a set of time intervals in which the atomic propositions
hold, and validates the property by propagating the time intervals. A
continuous state at a certain time computed in each step is enclosed by an
interval vector that is proven to contain a unique solution. In the
experiments, we show that the proposed method provides a useful tool for formal
analysis of nonlinear and complex hybrid systems.
","[{'version': 'v1', 'created': 'Fri, 5 Jun 2015 01:19:18 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Jul 2015 14:38:49 GMT'}]",2015-07-15,"[['Ishii', 'Daisuke', ''], ['Yonezaki', 'Naoki', ''], ['Goldsztejn', 'Alexandre', '']]","['Hybrid systems', 'interval analysis', 'linear temporal logic', 'bounded model checking']"
19225,1002.1919,Rdv Ijcsis,"Somnuk Sinthupoun, Ohm Sornil",Thai Rhetorical Structure Analysis,"IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS January 2010, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 7, No. 1, pp. 95-105, January 2010, USA",,"Journal of Computer Science, ISSN 1947 5500",cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rhetorical structure analysis (RSA) explores discourse relations among
elementary discourse units (EDUs) in a text. It is very useful in many text
processing tasks employing relationships among EDUs such as text understanding,
summarization, and question-answering. Thai language with its distinctive
linguistic characteristics requires a unique technique. This article proposes
an approach for Thai rhetorical structure analysis. First, EDUs are segmented
by two hidden Markov models derived from syntactic rules. A rhetorical
structure tree is constructed from a clustering technique with its similarity
measure derived from Thai semantic rules. Then, a decision tree whose features
derived from the semantic rules is used to determine discourse relations.
","[{'version': 'v1', 'created': 'Tue, 9 Feb 2010 20:01:06 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Mar 2010 05:04:16 GMT'}]",2010-03-17,"[['Sinthupoun', 'Somnuk', ''], ['Sornil', 'Ohm', '']]","['Thai Language', 'Rhetorical Structure Analysis', 'Elementary Discourse Unit', 'Rhetorical Structure Tree', 'Discourse Relation']"
19226,1702.07343,Hamid Shahdoosti,Hamid Reza Shahdoosti,Improving high-pass fusion method using wavelets,"7 pages, in Persian",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In an appropriate image fusion method, spatial information of the
panchromatic image is injected into the multispectral images such that the
spectral information is not distorted. The high-pass modulation method is a
successful method in image fusion. However, the main drawback of this method is
that this technique uses the boxcar filter to extract the high frequency
information of the panchromatic image. Using the boxcar filter introduces the
ringing effect into the fused image. To cope with this problem, we use the
wavelet transform instead of boxcar filters. Then, the results of the proposed
method and those of other methods such as, Brovey, IHS, and PCA ones are
compared. Experiments show the superiority of the proposed method in terms of
correlation coefficient and mutual information.
","[{'version': 'v1', 'created': 'Thu, 23 Feb 2017 21:09:46 GMT'}]",2017-02-27,"[['Shahdoosti', 'Hamid Reza', '']]","['Image fusion', 'high-pass modulation', 'wavelet', 'multispectral image']"
19227,1512.02317,Siddhartha Sahi,"Pradeep Dubey, Siddhartha Sahi and Martin Shubik",Money as Minimal Complexity,"34 pages, v2, fixed typos/references",,,,cs.GT math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider mechanisms that provide traders the opportunity to exchange
commodity $i$ for commodity $j$, for certain ordered pairs $ij$. Given any
connected graph $G$ of opportunities, we show that there is a unique mechanism
$M_{G}$ that satisfies some natural conditions of ""fairness"" and ""convenience"".
Let $\mathfrak{M}(m)$ denote the class of mechanisms $M_{G}$ obtained by
varying $G$ on the commodity set $\left\{1,\ldots,m\right\} $. We define the
complexity of a mechanism $M$ in $\mathfrak{M(m)}$ to be a certain pair of
integers $\tau(M),\pi(M)$ which represent the time required to exchange $i$ for
$j$ and the information needed to determine the exchange ratio (each in the
worst case scenario, across all $i\neq j$). This induces a quasiorder $\preceq$
on $\mathfrak{M}(m)$ by the rule \[ M\preceq
M^{\prime}\text{if}\tau(M)\leq\tau(M^{\prime})\text{and}\pi(M)\leq\pi(M^{\prime}).
\] We show that, for $m>3$, there are precisely three $\preceq$-minimal
mechanisms $M_{G}$ in $\mathfrak{M}(m)$, where $G$ corresponds to the star,
cycle and complete graphs. The star mechanism has a distinguished commodity --
the money -- that serves as the sole medium of exchange and mediates trade
between decentralized markets for the other commodities.
  Our main result is that, for any weights $\lambda,\mu>0,$ the star mechanism
is the unique minimizer of $\lambda\tau(M)+\mu\pi(M)$ on $\mathfrak{M}(m)$ for
large enough $m$.
","[{'version': 'v1', 'created': 'Tue, 8 Dec 2015 04:22:19 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Dec 2015 13:42:46 GMT'}]",2015-12-17,"[['Dubey', 'Pradeep', ''], ['Sahi', 'Siddhartha', ''], ['Shubik', 'Martin', '']]","['exchange mechanism', 'minimal complexity', 'money']"
19228,0909.3976,Vadim Madgazin,Vadim R. Madgazin,The Information Theory of Emotions of Musical Chords,"18 pages, 2 figures, in English, and copy in Russian",,,,cs.SD q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper offers a solution to the centuries-old puzzle - why the major
chords are perceived as happy and the minor chords as sad - based on the
information theory of emotions. A theory and a formula of musical emotions were
created. They define the sign and the amplitude of the utilitarian emotional
coloration of separate major and minor chords through relative pitches of
constituent sounds. Keywords: chord, major, minor, the formula of musical
emotions, the information theory of emotions.
","[{'version': 'v1', 'created': 'Tue, 22 Sep 2009 12:24:19 GMT'}, {'version': 'v2', 'created': 'Sat, 10 Sep 2011 12:02:21 GMT'}]",2011-09-13,"[['Madgazin', 'Vadim R.', '']]","['chord', 'major', 'minor', 'the  formula  of  musical  emotions', 'the  information  theory  of emotions']"
19229,1310.0524,Reshad Patuck,Reshad Patuck and Julio Hernandez-Castro,"Steganography using the Extensible Messaging and Presence Protocol
  (XMPP)","13 pages, 3 figures, 2 tables",,,,cs.MM cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present here the first work to propose different mechanisms for hiding
data in the Extensible Messaging and Presence Protocol (XMPP). This is a very
popular instant messaging protocol used by many messaging platforms such as
Google Talk, Cisco, LiveJournal and many others. Our paper describes how to
send a secret message from one XMPP client to another, without raising the
suspicion of any intermediaries. The methods described primarily focus on using
the underlying protocol as a means for steganography, unlike other related
works that try to hide data in the content of instant messages. In doing so, we
provide a more robust means of data hiding and additionally offer some
preliminary analysis of its general security, in particular against
entropic-based steganalysis.
","[{'version': 'v1', 'created': 'Fri, 27 Sep 2013 12:00:29 GMT'}]",2013-10-03,"[['Patuck', 'Reshad', ''], ['Hernandez-Castro', 'Julio', '']]","['Steganography', 'Steganalysis', 'Covert Channel', 'Data hiding', 'XMPP', 'Instant Messaging', 'Protocol']"
19230,0801.3669,Mohammad Mahmoody,"Boaz Barak, Mohammad Mahmoody","Merkle's Key Agreement Protocol is Optimal: An $O(n^2)$ Attack on any
  Key Agreement from Random Oracles","This version fixes a bug in the proof of the previous version of this
  paper, see ""Correction of Error"" paragraph and Appendix A",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove that every key agreement protocol in the random oracle model in
which the honest users make at most $n$ queries to the oracle can be broken by
an adversary who makes $O(n^2)$ queries to the oracle. This improves on the
previous $\widetilde{\Omega}(n^6)$ query attack given by Impagliazzo and Rudich
(STOC '89) and resolves an open question posed by them.
  Our bound is optimal up to a constant factor since Merkle proposed a key
agreement protocol in 1974 that can be easily implemented with $n$ queries to a
random oracle and cannot be broken by any adversary who asks $o(n^2)$ queries.
","[{'version': 'v1', 'created': 'Wed, 23 Jan 2008 21:01:37 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Jan 2008 01:41:04 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Jul 2008 14:14:45 GMT'}, {'version': 'v4', 'created': 'Sun, 31 Mar 2019 00:51:20 GMT'}]",2019-04-02,"[['Barak', 'Boaz', ''], ['Mahmoody', 'Mohammad', '']]","['Key Agreement', 'Random Oracle', 'Merkle Puzzles']"
19231,1312.3379,Yong Hsia,"Yong Hsia, Ruey-Lin Sheu","On RIC bounds of Compressed Sensing Matrices for Approximating Sparse
  Solutions Using $\ell_q$ Quasi Norms",16pages,,,,cs.IT math.IT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper follows the recent discussion on the sparse solution recovery with
quasi-norms $\ell_q,~q\in(0,1)$ when the sensing matrix possesses a Restricted
Isometry Constant $\delta_{2k}$ (RIC). Our key tool is an improvement on a
version of ""the converse of a generalized Cauchy-Schwarz inequality"" extended
to the setting of quasi-norm. We show that, if $\delta_{2k}\le 1/2$, any
minimizer of the $l_q$ minimization, at least for those $q\in(0,0.9181]$, is
the sparse solution of the corresponding underdetermined linear system.
Moreover, if $\delta_{2k}\le0.4931$, the sparse solution can be recovered by
any $l_q, q\in(0,1)$ minimization. The values $0.9181$ and $0.4931$ improves
those reported previously in the literature.
","[{'version': 'v1', 'created': 'Thu, 12 Dec 2013 01:16:40 GMT'}]",2013-12-13,"[['Hsia', 'Yong', ''], ['Sheu', 'Ruey-Lin', '']]","['compressed sensing', 'restricted isometry constant', 'lq minimization', 'quasi norm']"
19232,1504.08321,Alban Ponse,Jan A. Bergstra and Alban Ponse,Evaluation trees for proposition algebra,"34 pages, 1 table; main differences with v2: some proofs are
  corrected and/or simplified in S.3-6",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Proposition algebra is based on Hoare's conditional connective, which is a
ternary connective comparable to if-then-else and used in the setting of
propositional logic. Conditional statements are provided with a simple
semantics that is based on evaluation trees and that characterizes so-called
free valuation congruence: two conditional statements are free valuation
congruent if, and only if, they have equal evaluation trees. Free valuation
congruence is axiomatized by the four basic equational axioms of proposition
algebra that define the conditional connective. Valuation congruences that
identify more conditional statements than free valuation congruence are
repetition-proof, contractive, memorizing, and static valuation congruence.
Each of these valuation congruences is characterized using a transformation on
evaluation trees: two conditional statements are C-valuation congruent if, and
only if, their C-transformed evaluation trees are equal. These transformations
are simple and natural, and only for static valuation congruence a slightly
more complex transformation is used. Also, each of these valuation congruences
is axiomatized in proposition algebra. A spin-off of our approach can be called
""normalization functions for proposition algebra"": for each valuation
congruence C considered, two conditional statements are C-valuation congruent
if, and only if, the C-normalization function returns equal images.
","[{'version': 'v1', 'created': 'Thu, 30 Apr 2015 18:03:35 GMT'}, {'version': 'v2', 'created': 'Tue, 19 May 2015 12:37:31 GMT'}, {'version': 'v3', 'created': 'Mon, 28 Aug 2017 12:18:24 GMT'}]",2017-08-29,"[['Bergstra', 'Jan A.', ''], ['Ponse', 'Alban', '']]","['Conditional composition', 'evaluation tree', 'proposition algebra', 'short-circuit evaluation', 'short-circuit logic', 'side effect']"
19233,1110.4978,W{\l}odzimierz Drabent,W{\l}odzimierz Drabent,Logic + control: On program construction and verification,"29 pages. Version 3 substantially reworked, in particular all
  informal reasoning replaced by proofs, part of the content moved to 1412.8739
  and 1411.3015. Versions 4, 5 and this one -- various modifications and
  extensions. Under consideration in Theory and Practice of Logic Programming
  (TPLP)",,,,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an example of formal reasoning about the semantics of a
Prolog program of practical importance (the SAT solver of Howe and King). The
program is treated as a definite clause logic program with added control. The
logic program is constructed by means of stepwise refinement, hand in hand with
its correctness and completeness proofs. The proofs are declarative - they do
not refer to any operational semantics. Each step of the logic program
construction follows a systematic approach to constructing programs which are
provably correct and complete. We also prove that correctness and completeness
of the logic program is preserved in the final Prolog program. Additionally, we
prove termination, occur-check freedom and non-floundering.
  Our example shows how dealing with ""logic"" and with ""control"" can be
separated. Most of the proofs can be done at the ""logic"" level, abstracting
from any operational semantics.
  The example employs approximate specifications; they are crucial in
simplifying reasoning about logic programs. It also shows that the paradigm of
semantics-preserving program transformations may be not sufficient. We suggest
considering transformations which preserve correctness and completeness with
respect to an approximate specification.
","[{'version': 'v1', 'created': 'Sat, 22 Oct 2011 15:29:28 GMT'}, {'version': 'v2', 'created': 'Sat, 26 May 2012 15:19:39 GMT'}, {'version': 'v3', 'created': 'Wed, 30 Dec 2015 23:16:26 GMT'}, {'version': 'v4', 'created': 'Wed, 28 Dec 2016 21:36:40 GMT'}, {'version': 'v5', 'created': 'Fri, 13 Jan 2017 14:04:45 GMT'}, {'version': 'v6', 'created': 'Fri, 12 May 2017 16:54:29 GMT'}]",2017-05-15,"[['Drabent', 'Włodzimierz', '']]","['logic programming', 'declarative programming', 'program completeness', 'program correctness', 'specification', 'program transformation', 'floundering', 'occur-check']"
19234,0801.4079,Elena Dubrova,Elena Dubrova (Royal Institute of Technology),"An equivalence preserving transformation from the Fibonacci to the
  Galois NLFSRs","14 pages, 4 figures, one reference added, example 4 corrected",,,,cs.CR,,"  Conventional Non-Linear Feedback Shift Registers (NLFSRs) use the Fibonacci
configuration in which the value of the first bit is updated according to some
non-linear feedback function of previous values of other bits, and each
remaining bit repeats the value of its previous bit. We show how to transform
the feedback function of a Fibonacci NLFSR into several smaller feedback
functions of individual bits. Such a transformation reduces the propagation
time, thus increasing the speed of pseudo-random sequence generation. The
practical significance of the presented technique is that is makes possible
increasing the keystream generation speed of any Fibonacci NLFSR-based stream
cipher with no penalty in area.
","[{'version': 'v1', 'created': 'Mon, 28 Jan 2008 20:07:40 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Jan 2008 15:26:54 GMT'}]",2008-01-30,"[['Dubrova', 'Elena', '', 'Royal Institute of Technology']]","['Fibonacci NLFSR', 'Galois NLFSR', 'pseudo-random sequence', 'keystream', 'stream cipher']"
19235,1004.0393,Irina Kogan A,Joseph M. Burdis and Irina A. Kogan,Object-image correspondence for curves under finite and affine cameras,"19 pages, 2 figures. This version considers the case of rational
  algebraic curves",,,,cs.CV math.AG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide criteria for deciding whether a given planar curve is an image of
a given spatial curve, obtained by a central or a parallel projection with
unknown parameters. These criteria reduce the projection problem to a certain
modification of the equivalence problem of planar curves under affine and
projective transformations. The latter problem can be addressed using Cartan's
moving frame method. This leads to a novel algorithmic solution of the
projection problem for curves. The computational advantage of the algorithms
presented here, in comparison to algorithms based on a straightforward
solution, lies in a significant reduction of a number of real parameters that
has to be eliminated in order to establish existence or non-existence of a
projection that maps a given spatial curve to a given planar curve. The same
approach can be used to decide whether a given finite set of ordered points on
a plane is an image of a given finite set of ordered points in R^3. The
motivation comes from the problem of establishing a correspondence between an
object and an image, taken by a camera with unknown position and parameters.
","[{'version': 'v1', 'created': 'Fri, 2 Apr 2010 21:52:07 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Feb 2011 20:02:42 GMT'}]",2015-03-14,"[['Burdis', 'Joseph M.', ''], ['Kogan', 'Irina A.', '']]","['Curve matching', 'central and parallel projections', 'finite projective and affinecameras', 'geometric invariants']"
19236,1604.08814,Chung-Hyok Jang,"Pak Myong-Suk, Jo Hyon-Chol, Jang Chung-Hyok","Improved IKE Key Exchange Protocol Combined with Computer Security USB
  Key Device","5 pages, 1 table",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  : In this paper we suggest improved IKE key exchange protocol combined with
the Computer Security USB Key device to solve the problems in using IKE and IKE
v2 protocol.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2016 13:01:06 GMT'}]",2016-05-02,"[['Myong-Suk', 'Pak', ''], ['Hyon-Chol', 'Jo', ''], ['Chung-Hyok', 'Jang', '']]","['IPsec', 'IKE', 'IKEv2', 'SA', 'Computer Security USB key device']"
19237,1704.04599,Arkan Al-Hamodi,"Arkan A. G. Al-Hamodi, Songfeng Lu","A novel approach for fast mining frequent itemsets use N-list structure
  based on MapReduce","11 pages, 10 figures",,,,cs.DC cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Frequent Pattern Mining is a one field of the most significant topics in data
mining. In recent years, many algorithms have been proposed for mining frequent
itemsets. A new algorithm has been presented for mining frequent itemsets based
on N-list data structure called Prepost algorithm. The Prepost algorithm is
enhanced by implementing compact PPC-tree with the general tree. Prepost
algorithm can only find a frequent itemsets with required (pre-order and
post-order) for each node. In this chapter, we improved prepost algorithm based
on Hadoop platform (HPrepost), proposed using the Mapreduce programming model.
The main goals of proposed method are efficient mining frequent itemsets
requiring less running time and memory usage. We have conduct experiments for
the proposed scheme to compare with another algorithms. With dense datasets,
which have a large average length of transactions, HPrepost is more effective
than frequent itemsets algorithms in terms of execution time and memory usage
for all min-sup. Generally, our algorithm outperforms algorithms in terms of
runtime and memory usage with small thresholds and large datasets.
","[{'version': 'v1', 'created': 'Sat, 15 Apr 2017 07:23:40 GMT'}]",2017-05-23,"[['Al-Hamodi', 'Arkan A. G.', ''], ['Lu', 'Songfeng', '']]","['Data mining', 'Frequent itemsets', 'N-list', 'MapReduce']"
19238,1502.05591,David Coufal Dr.,David Coufal,Radial Fuzzy Systems,,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The class of radial fuzzy systems is introduced. The fuzzy systems in this
class use radial functions to implement membership functions of fuzzy sets and
exhibit a shape preservation property in antecedents of their rules. The
property is called the radial property. It enables the radial fuzzy systems to
have their computational model mathematically tractable under both conjunctive
and implicative representations of their rule bases. Coherence of radial
implicative fuzzy systems is discussed and a sufficient condition for coherence
is stated.
","[{'version': 'v1', 'created': 'Thu, 19 Feb 2015 15:09:16 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Feb 2016 14:48:11 GMT'}]",2016-02-18,"[['Coufal', 'David', '']]","['fuzzy systems', 'radial functions', 'coherence']"
19239,0907.4296,Pascal Caron,Pascal Caron and Marianne Flouret,Algorithms for Glushkov K-graphs,"31 pages, 20 figures, 1 table",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The automata arising from the well known conversion of regular expression to
non deterministic automata have rather particular transition graphs. We refer
to them as the Glushkov graphs, to honour his nice expression-to-automaton
algorithmic short cut (On a synthesis algorithm for abstract automata, Ukr.
Matem. Zhurnal, 12(2):147-156, 1960, In Russian). The Glushkov graphs have been
characterized (P. Caron and D. Ziadi, Characterization of Glushkov automata.
Theoret. Comput. Sci., 233(1-2):75-90, 2000) in terms of simple graph
theoretical properties and certain reduction rules. We show how to carry, under
certain restrictions, this characterization over to the weighted Glushkov
graphs. With the weights in a semiring K, they are defined as the transition
Glushkov K-graphs of the Weighted Finite Automata (WFA) obtained by the
generalized Glushkov construction (P. Caron and M. Flouret, Glushkov
construction for series: the non commutative case, Internat. J. Comput. Math.,
80(4):457-472, 2003) from the K-expressions. It works provided that the
semiring K is factorial and the K-expressions are in the so called star normal
form (SNF) of Bruggeman-Klein (Regular expressions into finite automata,
Theoret. Comput. Sci., 120(2):197-213, 1993) The restriction to the factorial
semiring ensures to obtain algorithms. The restriction to the SNF would not be
necessary if every K-expressions were equivalent to some with the same litteral
length, as it is the case for the boolean semiring B but remains an open
question for a general K.
","[{'version': 'v1', 'created': 'Fri, 24 Jul 2009 15:22:46 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Nov 2011 14:22:53 GMT'}]",2011-11-22,"[['Caron', 'Pascal', ''], ['Flouret', 'Marianne', '']]","['Formal languages', 'weighted automata', 'K-expressions']"
19240,1003.0480,Nicolas Brener,Nicolas Brener,A definable number which cannot be approximated algorithmically,,,,,cs.CC cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Turing machine (TM) and the Church thesis have formalized the concept of
computable number, this allowed to display non-computable numbers. This paper
defines the concept of number ""approachable"" by a TM and shows that some (if
not all) known non-computable numbers are approachable by TMs. Then an example
of a number not approachable by a TM is given.
","[{'version': 'v1', 'created': 'Mon, 1 Mar 2010 23:11:22 GMT'}]",2010-03-03,"[['Brener', 'Nicolas', '']]","['computable', 'algorithm', 'definable', 'Turing machine', 'Chaitin’s constant']"
19241,1702.03085,Pierre Lescanne,Pierre Lescanne (LIP),Quantitative aspects of linear and affine closed lambda terms,,,,,cs.DM cs.LO cs.PL math.CO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Affine $\lambda$-terms are $\lambda$-terms in which each bound variable
occurs at most once and linear $\lambda$-terms are $\lambda$-terms in which
each bound variables occurs once. and only once. In this paper we count the
number of closed affine $\lambda$-terms of size $n$, closed linear
$\lambda$-terms of size $n$, affine $\beta$-normal forms of size $n$ and linear
$\beta$-normal forms of ise $n$, for different ways of measuring the size of
$\lambda$-terms. From these formulas, we show how we can derive programs for
generating all the terms of size $n$ for each class. For this we use a specific
data structure, which are contexts taking into account all the holes at levels
of abstractions.
","[{'version': 'v1', 'created': 'Fri, 10 Feb 2017 07:32:08 GMT'}, {'version': 'v2', 'created': 'Thu, 16 Feb 2017 14:46:00 GMT'}, {'version': 'v3', 'created': 'Mon, 27 Feb 2017 14:02:40 GMT'}, {'version': 'v4', 'created': 'Mon, 3 Apr 2017 15:21:15 GMT'}, {'version': 'v5', 'created': 'Tue, 23 May 2017 06:10:51 GMT'}]",2017-05-24,"[['Lescanne', 'Pierre', '', 'LIP']]","['Lambda calculus', 'combinatorics', 'functional programming']"
19242,0906.1437,Antonios Varvitsiotis,"Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios Varvitsiotis",Algebraic methods for counting Euclidean embeddings of rigid graphs,"8 pages, 7 figures, 2 tables. To appear in Graph Drawing 2009",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The study of (minimally) rigid graphs is motivated by numerous applications,
mostly in robotics and bioinformatics. A major open problem concerns the number
of embeddings of such graphs, up to rigid motions, in Euclidean space. We
capture embeddability by polynomial systems with suitable structure, so that
their mixed volume, which bounds the number of common roots, to yield
interesting upper bounds on the number of embeddings. We focus on $\RR^2$ and
$\RR^3$, where Laman graphs and 1-skeleta of convex simplicial polyhedra,
respectively, admit inductive Henneberg constructions. We establish the first
lower bound in $\RR^3$ of about $2.52^n$, where $n$ denotes the number of
vertices. Moreover, our implementation yields upper bounds for $n \le 10$ in
$\RR^2$ and $\RR^3$, which reduce the existing gaps, and tight bounds up to
$n=7$ in $\RR^3$.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2009 08:39:14 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Aug 2009 10:55:53 GMT'}]",2009-08-27,"[['Emiris', 'Ioannis Z.', ''], ['Tsigaridas', 'Elias P.', ''], ['Varvitsiotis', 'Antonios', '']]","['rigid graph', 'Euclidean embedding', 'Henneberg construction', 'polynomial system', 'lower bound', 'root bound', 'cyclohexane caterpillar']"
19243,1301.0167,Karthik  S,"H. R. Mamatha, S. Karthik, Murthy K. Srikanta",Classifier Fusion Method to Recognize Handwritten Kannada Numerals,"6 pages having 3 tables and 9 figures. Published in ICECT 2012
  conference",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optical Character Recognition (OCR) is one of the important fields in image
processing and pattern recognition domain. Handwritten character recognition
has always been a challenging task. Only a little work can be traced towards
the recognition of handwritten characters for the south Indian languages.
Kannada is one such south Indian language which is also one of the official
language of India. Accurate recognition of Kannada characters is a challenging
task because of the high degree of similarity between the characters. Hence,
good quality features are to be extracted and better classifiers are needed to
improve the accuracy of the OCR for Kannada characters. This paper explores the
effectiveness of feature extraction method like run length count (RLC) and
directional chain code (DCC) for the recognition of handwritten Kannada
numerals. In this paper, a classifier fusion method is implemented to improve
the recognition rate. For the classifier fusion, we have considered K-nearest
neighbour (KNN) and Linear classifier (LC). The novelty of this method is to
achieve better accuracy with few features using classifier fusion approach.
Proposed method achieves an average recognition rate of 96%.
","[{'version': 'v1', 'created': 'Wed, 2 Jan 2013 04:45:44 GMT'}]",2013-01-03,"[['Mamatha', 'H. R.', ''], ['Karthik', 'S.', ''], ['Srikanta', 'Murthy K.', '']]","['OCR', 'handwritten Kannada numeral', 'directional']"
19244,1210.0460,Maciej Kurant,"Maciej Kurant, Carter T. Butts, Athina Markopoulou",Graph Size Estimation,,,,,cs.SI cs.CY physics.soc-ph stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many online networks are not fully known and are often studied via sampling.
Random Walk (RW) based techniques are the current state-of-the-art for
estimating nodal attributes and local graph properties, but estimating global
properties remains a challenge. In this paper, we are interested in a
fundamental property of this type - the graph size N, i.e., the number of its
nodes. Existing methods for estimating N are (i) inefficient and (ii) cannot be
easily used with RW sampling due to dependence between successive samples. In
this paper, we address both problems. First, we propose IE (Induced Edges), an
efficient technique for estimating N from an independence sample of graph's
nodes. IE exploits the edges induced on the sampled nodes. Second, we introduce
SafetyMargin, a method that corrects estimators for dependence in RW samples.
Finally, we combine these two stand-alone techniques to obtain a RW-based graph
size estimator. We evaluate our approach in simulations on a wide range of
real-life topologies, and on several samples of Facebook. IE with SafetyMargin
typically requires at least 10 times fewer samples than the state-of-the-art
techniques (over 100 times in the case of Facebook) for the same estimation
error.
","[{'version': 'v1', 'created': 'Mon, 1 Oct 2012 16:34:58 GMT'}]",2012-10-02,"[['Kurant', 'Maciej', ''], ['Butts', 'Carter T.', ''], ['Markopoulou', 'Athina', '']]","['graph size estimation', 'network sampling', 'random walk', 'online social networks', 'measurement']"
19245,0903.1450,R Ravi,"I. Hafalir, R. Ravi, A. Sayedi",Multi-unit Auctions with Budget Constraints,,,,,cs.GT,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Motivated by sponsored search auctions, we study multi-unit auctions with
budget constraints. In the mechanism we propose, Sort-Cut, understating budgets
or values is weakly dominated. Since Sort-Cut's revenue is increasing in
budgets and values, all kinds of equilibrium deviations from true valuations
turn out to be beneficial to the auctioneer. We show that the revenue of
Sort-Cut can be an order of magnitude greater than that of the natural Market
Clearing Price mechanism, and we discuss the efficiency properties of its
ex-post Nash equilibrium.
","[{'version': 'v1', 'created': 'Sun, 8 Mar 2009 20:17:40 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Mar 2011 10:22:12 GMT'}]",2011-03-03,"[['Hafalir', 'I.', ''], ['Ravi', 'R.', ''], ['Sayedi', 'A.', '']]","['Multi-Unit Auctions', 'Budget Constraints', 'Sponsored Search']"
19246,1606.03546,Ming Hock Yew,Ming Hock Yew and Jenson Goh,"An SME's Adoption of a Cloud Based Integrated Management System (IMS)
  When Certifying Against Management System Standards (MSS)","ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
  Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/231,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  This case study introduces a four step approach used by a Singapore small and
medium enterprise (SME) in implementing a cloud computing based integrated
management system (IMS) to meet the ISO 9001, ISO 14001, and OHSAS 18001
certification requirements. The objectives of this case study are to study: (1)
the challenges encountered by an SME during the IMS integration process at each
of the four levels of integration (2) the extent which Frugal IT Innovation and
Technology Acceptance Model (TAM3) concepts apply to our four step approach.
The four step approach was assessed against a framework of four integration
levels of the management systems (MS), and also the applicability of two IS
theories (Frugal IT Innovation and TAM3). Data was collected via: (1) direct
observations (2) participant observations; (3) interviews with key personnel
involved in the project; and (4) analysis of documents pertaining to the
project. This case study provides an exemplary model on using IS theories and
public cloud technologies to develop an effective IMS that other SMEs can learn
from.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 03:52:45 GMT'}]",2016-06-14,"[['Yew', 'Ming Hock', ''], ['Goh', 'Jenson', '']]","['cloud computing', 'management systems', 'integrated management system', 'IMS', 'SME']"
19247,1406.6425,Prasad Sudhakar,"Prasad Sudhakar, Laurent Jacques, Xavier Dubois, Philippe Antoine, Luc
  Joannes",Compressive Imaging and Characterization of Sparse Light Deflection Maps,"35 pages, 17 figures. Accepted for publication in SIAM Journal on
  Imaging Sciences",,,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Light rays incident on a transparent object of uniform refractive index
undergo deflections, which uniquely characterize the surface geometry of the
object. Associated with each point on the surface is a deflection map (or
spectrum) which describes the pattern of deflections in various directions.
This article presents a novel method to efficiently acquire and reconstruct
sparse deflection spectra induced by smooth object surfaces. To this end, we
leverage the framework of Compressed Sensing (CS) in a particular
implementation of a schlieren deflectometer, i.e., an optical system providing
linear measurements of deflection spectra with programmable spatial light
modulation patterns. We design those modulation patterns on the principle of
spread spectrum CS for reducing the number of observations. The ability of our
device to simultaneously observe the deflection spectra on a dense
discretization of the object surface is related to a Multiple Measurement
Vector (MMV) model. This scheme allows us to estimate both the noise power and
the instrumental point spread function.
  We formulate the spectrum reconstruction task as the solving of a linear
inverse problem regularized by an analysis sparsity prior using a translation
invariant wavelet frame. Our results demonstrate the capability and advantages
of using a CS based approach for deflectometric imaging both on simulated data
and experimental deflectometric data.
  Finally, the paper presents an extension of our method showing how we can
extract the main deflection direction in each point of the object surface from
a few compressive measurements, without needing any costly reconstruction
procedures. This compressive characterization is then confirmed with
experimental results on simple plano-convex and multifocal intra-ocular lenses
studying the evolution of the main deflection as a function of the object point
location.
","[{'version': 'v1', 'created': 'Wed, 25 Jun 2014 00:46:10 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Jul 2015 18:17:21 GMT'}]",2015-07-15,"[['Sudhakar', 'Prasad', ''], ['Jacques', 'Laurent', ''], ['Dubois', 'Xavier', ''], ['Antoine', 'Philippe', ''], ['Joannes', 'Luc', '']]","['deflectometry', 'compressive imaging', 'compressed sensing', 'optical metrology', 'proximalmethods', 'Chambolle-Pock']"
19248,1507.01158,Troy Baker,"Troy Baker, Meera Sitharam, Menghan Wang, Joel Willoughby","Optimal Decomposition and Recombination of Isostatic Geometric
  Constraint Systems for Designing Layered Materials",,,,,cs.CG,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Optimal recursive decomposition (or DR-planning) is crucial for analyzing,
designing, solving or finding realizations of geometric constraint sytems.
While the optimal DR-planning problem is NP-hard even for general 2D bar-joint
constraint systems, we describe an O(n^3) algorithm for a broad class of
constraint systems that are isostatic or underconstrained. The algorithm
achieves optimality by using the new notion of a canonical DR-plan that also
meets various desirable, previously studied criteria. In addition, we leverage
recent results on Cayley configuration spaces to show that the indecomposable
systems---that are solved at the nodes of the optimal DR-plan by recombining
solutions to child systems---can be minimally modified to become decomposable
and have a small DR-plan, leading to efficient realization algorithms. We show
formal connections to well-known problems such as completion of
underconstrained systems. Well suited to these methods are classes of
constraint systems that can be used to efficiently model, design and analyze
quasi-uniform (aperiodic) and self-similar, layered material structures. We
formally illustrate by modeling silica bilayers as body-hyperpin systems and
cross-linking microfibrils as pinned line-incidence systems. A software
implementation of our algorithms and videos demonstrating the software are
publicly available online (visit http://cise.ufl.edu/~tbaker/drp/index.html.)
","[{'version': 'v1', 'created': 'Sun, 5 Jul 2015 02:05:17 GMT'}]",2015-07-07,"[['Baker', 'Troy', ''], ['Sitharam', 'Meera', ''], ['Wang', 'Menghan', ''], ['Willoughby', 'Joel', '']]","['rigidity', 'geometric constraint solving', 'configuration spaces', 'self-similar structures', 'layeredmaterials']"
19249,1401.4512,Rahul Jain,"Rahul Jain, Troy Lee, Nisheeth K. Vishnoi","A quadratically tight partition bound for classical communication
  complexity and query complexity","8 pages, version 1",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we introduce, both for classical communication complexity and
query complexity, a modification of the 'partition bound' introduced by Jain
and Klauck [2010]. We call it the 'public-coin partition bound'. We show that
(the logarithm to the base two of) its communication complexity and query
complexity versions form, for all relations, a quadratically tight lower bound
on the public-coin randomized communication complexity and randomized query
complexity respectively.
","[{'version': 'v1', 'created': 'Sat, 18 Jan 2014 02:39:29 GMT'}]",2014-01-21,"[['Jain', 'Rahul', ''], ['Lee', 'Troy', ''], ['Vishnoi', 'Nisheeth K.', '']]","['Partition bound', 'communication complexity', 'lower bounds', 'linear programs']"
19250,0909.1639,Bela Genge,Genge Bela and Haller Piroska,Extending WS-Security to Implement Security Protocols for Web Services,,"Acta Universitatis Sapientiae - Electrical and Mechanical
  Engineering, Vol. 1, pp. 105-112, 2009 (ISSN 2065-5916)",,,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web services use tokens provided by the WS-Security standard to implement
security protocols. We propose several extensions to the WS-Security standard,
including name types, key and random number extensions. The extensions are used
to implement existing protocols such as ISO9798, Kerberos or BAN-Lowe. The
advantages of using these implementations rather than the existing, binary
ones, are inherited from the advantages of using Web service technologies, such
as extensibility and end-to-end security across multiple environments that do
not support a connection-based communication.
","[{'version': 'v1', 'created': 'Wed, 9 Sep 2009 07:17:01 GMT'}]",2009-09-10,"[['Bela', 'Genge', ''], ['Piroska', 'Haller', '']]","['Security protocols', 'Web services', 'WS-Security']"
19251,1702.01999,Roy Rudolf Huizen,"Roy Rudolf Huizen, Jazi Eko Istiyanto, Agfianto Eko Putra","Identification of Voice Utterance with Aging Factor Using the Method of
  MFCC Multichannel",6 Pages,"Huizen, R.R., Istiyanto, J.E. and Putra, A.E., 2017, International
  Journal of Advanced Studies in Computer Science and Engineering (IJASCSE),
  Volume 6 Issue 01",,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This research was conducted to develop a method to identify voice utterance.
For voice utterance that encounters change caused by aging factor, with the
interval of 10 to 25 years. The change of voice utterance influenced by aging
factor might be extracted by MFCC (Mel Frequency Cepstrum Coefficient).
However, the level of the compatibility of the feature may be dropped down to
55%. While the ones which do not encounter it may reach 95%. To improve the
compatibility of the changing voice feature influenced by aging factor, then
the method of the more specific feature extraction is developed: which is by
separating the voice into several channels, suggested as MFCC multichannel,
consisting of multichannel 5 filterbank (M5FB), multichannel 2 filterbank
(M2FB) and multichannel 1 filterbank (M1FB). The result of the test shows that
for model M5FB and M2FB have the highest score in the level of compatibility
with 85% and 82% with 25 years interval. While model M5FB gets the highest
score of 86% for 10 years time interval.
","[{'version': 'v1', 'created': 'Tue, 7 Feb 2017 13:19:08 GMT'}]",2017-02-08,"[['Huizen', 'Roy Rudolf', ''], ['Istiyanto', 'Jazi Eko', ''], ['Putra', 'Agfianto Eko', '']]","['; Multichannel', 'MFCC', 'filterbank', 'aging factor']"
19252,1609.02947,Nhien-An Le-Khac,"Andree Linke, Nhien-An Le-Khac",Control Flow Change in Assembly as a Classifier in Malware Analysis,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As currently classical malware detection methods based on signatures fail to
detect new malware, they are not always efficient with new obfuscation
techniques. Besides, new malware is easily created and old malware can be
recoded to produce new one. Therefore, classical Antivirus becomes consistently
less effective in dealing with those new threats. Also malware gets hand
tailored to bypass network security and Antivirus. But as analysts do not have
enough time to dissect suspected malware by hand, automated approaches have
been developed. To cope with the mass of new malware, statistical and machine
learning methods proved to be a good approach classifying programs, especially
when using multiple approaches together to provide a likelihood of software
being malicious. In normal approach, some steps have been taken, mostly by
analyzing the opcodes or mnemonics of disassembly and their distribution. In
this paper, we focus on the control flow change (CFC) itself and finding out if
it is significant to detect malware. In the scope of this work, only relative
control flow changes are contemplated, as these are easier to extract from the
first chosen disassembler library and are within a range of 256 addresses.
These features are analyzed as a raw feature, as n-grams of length 2, 4 and 6
and the even more abstract feature of the occurrences of the n-grams is used.
Statistical methods were used as well as the Naive-Bayes algorithm to find out
if there is significant data in CFC. We also test our approach with real-world
datasets.
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2016 21:21:14 GMT'}]",2016-09-13,"[['Linke', 'Andree', ''], ['Le-Khac', 'Nhien-An', '']]","['Malware analysis', 'Control flow change', 'Naïve']"
19253,0906.0872,Boris Yangel,Boris Yangel,Fast Weak Learner Based on Genetic Algorithm,"4 pages, acmsiggraph latex style packed with the latex source in the
  single archive",,,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An approach to the acceleration of parametric weak classifier boosting is
proposed. Weak classifier is called parametric if it has fixed number of
parameters and, so, can be represented as a point into multidimensional space.
Genetic algorithm is used instead of exhaustive search to learn parameters of
such classifier. Proposed approach also takes cases when effective algorithm
for learning some of the classifier parameters exists into account. Experiments
confirm that such an approach can dramatically decrease classifier training
time while keeping both training and test errors small.
","[{'version': 'v1', 'created': 'Thu, 4 Jun 2009 10:25:08 GMT'}]",2009-06-05,"[['Yangel', 'Boris', '']]","['boosting', 'genetic algorithm', 'classification', 'haar feature']"
19254,1307.1900,Arindam Chaudhuri AC,"Arindam Chaudhuri, Kajal De","Fuzzy Integer Linear Programming Mathematical Models for Examination
  Timetable Problem","International Journal of Innovative Computing, Information and
  Control (Special Issue), Volume 7, Number 5, 2011",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  ETP is NP Hard combinatorial optimization problem. It has received tremendous
research attention during the past few years given its wide use in
universities. In this Paper, we develop three mathematical models for NSOU,
Kolkata, India using FILP technique. To deal with impreciseness and vagueness
we model various allocation variables through fuzzy numbers. The solution to
the problem is obtained using Fuzzy number ranking method. Each feasible
solution has fuzzy number obtained by Fuzzy objective function. The different
FILP technique performance are demonstrated by experimental data generated
through extensive simulation from NSOU, Kolkata, India in terms of its
execution times. The proposed FILP models are compared with commonly used
heuristic viz. ILP approach on experimental data which gives an idea about
quality of heuristic. The techniques are also compared with different
Artificial Intelligence based heuristics for ETP with respect to best and mean
cost as well as execution time measures on Carter benchmark datasets to
illustrate its effectiveness. FILP takes an appreciable amount of time to
generate satisfactory solution in comparison to other heuristics. The
formulation thus serves as good benchmark for other heuristics. The
experimental study presented here focuses on producing a methodology that
generalizes well over spectrum of techniques that generates significant results
for one or more datasets. The performance of FILP model is finally compared to
the best results cited in literature for Carter benchmarks to assess its
potential. The problem can be further reduced by formulating with lesser number
of allocation variables it without affecting optimality of solution obtained.
FLIP model for ETP can also be adapted to solve other ETP as well as
combinatorial optimization problems.
","[{'version': 'v1', 'created': 'Sun, 7 Jul 2013 19:09:03 GMT'}]",2013-07-09,"[['Chaudhuri', 'Arindam', ''], ['De', 'Kajal', '']]","['Examination Timetable Problem', 'Fuzzy Integer Linear Programming', 'Heuristics', 'Hard Constraints', 'Soft Constraints', 'Carter Datasets']"
19255,1412.2693,Hanie Sedghi,Hanie Sedghi and Anima Anandkumar,Provable Methods for Training Neural Networks with Sparse Connectivity,"Accepted for presentation at Neural Information Processing
  Systems(NIPS) 2014 Deep Learning workshop and Accepted as a workshop
  contribution at ICLR 2015",,,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide novel guaranteed approaches for training feedforward neural
networks with sparse connectivity. We leverage on the techniques developed
previously for learning linear networks and show that they can also be
effectively adopted to learn non-linear networks. We operate on the moments
involving label and the score function of the input, and show that their
factorization provably yields the weight matrix of the first layer of a deep
network under mild conditions. In practice, the output of our method can be
employed as effective initializers for gradient descent.
","[{'version': 'v1', 'created': 'Mon, 8 Dec 2014 18:45:22 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Dec 2014 20:40:26 GMT'}, {'version': 'v3', 'created': 'Thu, 23 Apr 2015 11:38:16 GMT'}, {'version': 'v4', 'created': 'Tue, 28 Apr 2015 11:23:38 GMT'}]",2015-04-29,"[['Sedghi', 'Hanie', ''], ['Anandkumar', 'Anima', '']]","['Deep feedforward networks', 'sparse connectivity', 'ℓ1-optimization', 'Stein’s lemma']"
19256,1603.07992,Saeed-Ul Hassan,"Saeed-Ul Hassan, Uzair Ahmed Gillani","Altmetrics of ""altmetrics"" using Google Scholar, Twitter, Mendeley,
  Facebook, Google-plus, CiteULike, Blogs and Wiki","19 pages, 6 figures, 4 tables",,,,cs.SI cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We measure the impact of ""altmetrics"" field by deploying altmetrics
indicators using the data from Google Scholar, Twitter, Mendeley, Facebook,
Google-plus, CiteULike, Blogs and Wiki during 2010- 2014. To capture the social
impact of scientific publications, we propose an index called alt-index,
analogues to h-index. Across the deployed indices, our results have shown high
correlation among the indicators that capture social impact. While we observe
medium Pearson's correlation (\r{ho}= .247) among the alt-index and h-index, a
relatively high correlation is observed between social citations and scholarly
citations (\r{ho}= .646). Interestingly, we find high turnover of social
citations in the field compared with the traditional scholarly citations, i.e.
social citations are 42.2 % more than traditional citations. The social mediums
such as Twitter and Mendeley appear to be the most effective channels of social
impact followed by Facebook and Google-plus. Overall, altmetrics appears to be
working well in the field of ""altmetrics"".
","[{'version': 'v1', 'created': 'Fri, 25 Mar 2016 19:42:31 GMT'}]",2016-03-28,"[['Hassan', 'Saeed-Ul', ''], ['Gillani', 'Uzair Ahmed', '']]","['Altmetrics', 'Social Media', 'Usage Indicators', 'Alt-index']"
19257,1206.5882,John Wright,"Daniel A. Spielman, Huan Wang, John Wright",Exact Recovery of Sparsely-Used Dictionaries,,,,,cs.LG cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of learning sparsely used dictionaries with an
arbitrary square dictionary and a random, sparse coefficient matrix. We prove
that $O (n \log n)$ samples are sufficient to uniquely determine the
coefficient matrix. Based on this proof, we design a polynomial-time algorithm,
called Exact Recovery of Sparsely-Used Dictionaries (ER-SpUD), and prove that
it probably recovers the dictionary and coefficient matrix when the coefficient
matrix is sufficiently sparse. Simulation results show that ER-SpUD reveals the
true dictionary as well as the coefficients with probability higher than many
state-of-the-art algorithms.
","[{'version': 'v1', 'created': 'Tue, 26 Jun 2012 05:10:36 GMT'}]",2012-06-27,"[['Spielman', 'Daniel A.', ''], ['Wang', 'Huan', ''], ['Wright', 'John', '']]","['Dictionary learning', 'matrix decomposition', 'matrix sparsification']"
19258,1705.08507,Mokhtar Ben,Mokhtar Ben Henda (MICA),Teaching computer code at school,in French,"Chaire Unesco-ITEN. Actes de la 5e rencontre annuelle d'ORBICOM,
  Les \'editions de l'immat\'eriel, 2017",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In today's education systems, there is a deep concern about the importance of
teaching code and computer programming in schools. Moving digital learning from
a simple use of tools to understanding the processes of the internal
functioning of these tools is an old / new debate originated with the digital
laboratories of the 1960. Today, it is emerging again under impulse of the
large - scale public sphere digitalization and the new constructivist education
theories. Teachers and educators discuss not only the viability of code
teaching in the classroom, but also the intellectual and cognitive advantages
for students. The debate thus takes several orientations and is resourced in
the entanglement of arguments and interpretations of any order, technical,
educational, cultural, cognitive and psychological. However, that phenomenon
which undoubtedly augurs for a profound transformation in the future models of
learning and teaching , is predicting a new and almost congenital digital
humanism
","[{'version': 'v1', 'created': 'Wed, 3 May 2017 09:08:17 GMT'}]",2017-05-25,"[['Henda', 'Mokhtar Ben', '', 'MICA']]","['Computer code', 'learning', 'pedagogy', 'digital natives', 'digital humanism']"
19259,1406.2817,Juergen Zechner,"J\""urgen Zechner and Benjamin Marussig and Gernot Beer and
  Thomas-Peter Fries",Isogeometric Boundary Element Method with Hierarchical Matrices,"10 pages, 5 figures",,,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we address the complexity problem of the isogeometric Boundary
Element Method by proposing a collocation scheme for practical problems in
linear elasticity and the application of hierarchical matrices. For mixed
boundary value problems, a block system of matrices similar to Galerkin
formulations is constructed allowing an effective application of that matrix
format. We introduce a strategy for the geometric bisection of surfaces based
on NURBS patches. The approximation of system matrices is carried out by means
of kernel interpolation. Numerical results are shown that prove the success of
the formulation.
","[{'version': 'v1', 'created': 'Wed, 11 Jun 2014 08:21:55 GMT'}]",2014-06-12,"[['Zechner', 'Jürgen', ''], ['Marussig', 'Benjamin', ''], ['Beer', 'Gernot', ''], ['Fries', 'Thomas-Peter', '']]","['isogeometric analysis', 'boundary element method', 'hierarchical matrices', 'elasticity', 'NURBS']"
19260,1212.5253,Harry Boyer,"Ali Hamada Fakra (PIMENT), Fr\'ed\'eric Miranville (PIMENT), Harry
  Boyer (PIMENT), St\'ephane Guichard (PIMENT)","Development of a new model to predict indoor daylighting: Integration in
  CODYRUN software and validation",,"Energy Conversion and Management 52, 7 (2011) 2724-2734",,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many models exist in the scientific literature for determining indoor
daylighting values. They are classified in three categories: numerical,
simplified and empirical models. Nevertheless, each of these categories of
models are not convenient for every application. Indeed, the numerical model
requires high calculation time; conditions of use of the simplified models are
limited, and experimental models need not only important financial resources
but also a perfect control of experimental devices (e.g. scale model), as well
as climatic characteristics of the location (e.g. in situ experiment). In this
article, a new model based on a combination of multiple simplified models is
established. The objective is to improve this category of model. The
originality of our paper relies on the coupling of several simplified models of
indoor daylighting calculations. The accuracy of the simulation code,
introduced into CODYRUN software to simulate correctly indoor illuminance, is
then verified. Besides, the software consists of a numerical building
simulation code, developed in the Physics and Mathematical Engineering
Laboratory for Energy and Environment (P.I.M.E.N.T) at the University of
Reunion. Initially dedicated to the thermal, airflow and hydrous phenomena in
the buildings, the software has been completed for the calculation of indoor
daylighting. New models and algorithms - which rely on a semi-detailed approach
- will be presented in this paper. In order to validate the accuracy of the
integrated models, many test cases have been considered as analytical,
inter-software comparisons and experimental comparisons. In order to prove the
accuracy of the new model - which can properly simulate the illuminance - a
confrontation between the results obtained from the software (developed in this
research paper) and the major made at a given place is described in details. A
new statistical indicator to appreciate the margins of errors - named RSD
(Reliability of Software Degrees) - is also be defined.
","[{'version': 'v1', 'created': 'Tue, 18 Dec 2012 07:37:07 GMT'}]",2012-12-26,"[['Fakra', 'Ali Hamada', '', 'PIMENT'], ['Miranville', 'Frédéric', '', 'PIMENT'], ['Boyer', 'Harry', '', 'PIMENT'], ['Guichard', 'Stéphane', '', 'PIMENT']]","['Indoor daylighting', 'building simulation software', 'experimental validation', 'CODYRUN']"
19261,1306.5109,Imen Messaoudi,"Imen Messaoudi, Afef Elloumi Oueslati and Zied Lachiri","Complex Morlet Wavelet Analysis of the DNA Frequency Chaos Game Signal
  and Revealing Specific Motifs of Introns in C.elegans",Conference,,,,cs.SY q-bio.GN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, studying introns is becoming a very promising field in the
genomics. Even though they play a role in the dynamic regulation of gene and in
the organism's evolution, introns have not attracted enough attention like
exons did; especially of digital signal processing researchers. Thus, we focus
on analysis of the C.elegans introns. In this paper, we propose the complex
Morlet wavelet analysis to investigate introns' characterization in the
C.elegans genes. However, catching the change in frequency response with
respect to time of the gene sequences is hindered by their presence in the form
of strings of characters. This can only be counteracted by assigning numerical
values to each of the DNA characters. This operation defines the so called ""DNA
coding approach"". In this context, we propose a new coding technique based on
the Frequency Chaos Game Representation (FCGR) that we name the ""Frequency
Chaos Game Signal"" (FCGS). Results of the complex Morlet wavelet Analysis
applied to the Celegans FCGS are showing a very distinguished texture. The
visual interpretation of the colour scalograms is proved to be an efficient
tool for revealing significant information about intronic sequences.
","[{'version': 'v1', 'created': 'Fri, 21 Jun 2013 11:47:32 GMT'}]",2013-06-24,"[['Messaoudi', 'Imen', ''], ['Oueslati', 'Afef Elloumi', ''], ['Lachiri', 'Zied', '']]","['Complex Morlet wavelet Transform', 'Frequency Chaos Game Signal', 'Introns', 'motifs', 'Caenorhabditis elegans']"
19262,1606.05784,Anton Eremeev,Anton Eremeev,"Hitting times of local and global optima in genetic algorithms with very
  high selection pressure","Submitted to Yugoslav Journal of Operations Research. arXiv admin
  note: text overlap with arXiv:1512.02047",,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper is devoted to upper bounds on the expected first hitting times of
the sets of local or global optima for non-elitist genetic algorithms with very
high selection pressure. The results of this paper extend the range of
situations where the upper bounds on the expected runtime are known for genetic
algorithms and apply, in particular, to the Canonical Genetic Algorithm. The
obtained bounds do not require the probability of fitness-decreasing mutation
to be bounded by a constant less than one.
","[{'version': 'v1', 'created': 'Sat, 18 Jun 2016 17:36:28 GMT'}, {'version': 'v2', 'created': 'Thu, 30 Jun 2016 17:29:55 GMT'}]",2016-07-01,"[['Eremeev', 'Anton', '']]","['Combinatorial optimization', 'evolutionary algorithms', 'runtime analysis', 'fitness level', 'local search']"
19263,1412.5207,Anish Acharya,Anish Acharya,"Are We Ready for Driver-less Vehicles? Security vs. Privacy- A Social
  Perspective","17 Pages, 5 Figures",,,,cs.CY cs.AI cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  At this moment Autonomous cars are probably the biggest and most talked about
technology in the Robotics Research Community. In spite of great technological
advances over past few years a full edged autonomous car is still far from
reality. This article talks about the existing system and discusses the
possibility of a Computer Vision enabled driving being superior than the LiDar
based system. A detailed overview of privacy violations that might arise from
autonomous driving has been discussed in detail both from a technical as well
as legal perspective. It has been proved through evidence and arguments that
efficient and accurate estimation and efficient solution of the constraint
satisfaction problem addressed in the case of autonomous cars are negatively
correlated with the preserving the privacy of the user. It is a very difficult
trade-off since both are very important aspects and has to be taken into
account. The fact that one cannot compromise with the safety issues of the car
makes it inevitable to run into serious privacy concerns that might have
adverse social and political effects.
","[{'version': 'v1', 'created': 'Tue, 16 Dec 2014 21:48:53 GMT'}]",2019-03-25,"[['Acharya', 'Anish', '']]","['Autonomous Driving', 'LiDar', 'Vision enabled Driving', 'Privacy', 'Surveillance']"
19264,1106.3409,Ido Nevat Ido Nevat,"Gareth W. Peters, Ido Nevat, Jinhong Yuan and Ian B. Collings",System Identification in Wireless Relay Networks via Gaussian Process,"28 pages, 9 figures, one table",,,,cs.IT math.IT stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a flexible stochastic model for a class of cooperative wireless
relay networks, in which the relay processing functionality is not known at the
destination. In addressing this problem we develop efficient algorithms to
perform relay identification in a wireless relay network. We first construct a
statistical model based on a representation of the system using Gaussian
Processes in a non-standard manner due to the way we treat the imperfect
channel state information. We then formulate the estimation problem to perform
system identification, taking into account complexity and computational
efficiency. Next we develop a set of three algorithms to solve the
identification problem each of decreasing complexity, trading-off the
estimation bias for computational efficiency. The joint optimisation problem is
tackled via a Bayesian framework using the Iterated Conditioning on the Modes
methodology. We develop a lower bound and several sub-optimal computationally
efficient solutions to the identification problem, for comparison. We
illustrate the estimation performance of our methodology for a range of widely
used relay functionalities. The relative total error attained by our algorithm
when compared to the lower bound is found to be at worst 9% for low SNR values
under all functions considered. The effect of the relay functional estimation
error is also studied via BER simulations and is shown to be less than 2dB
worse than the lower bound.
","[{'version': 'v1', 'created': 'Fri, 17 Jun 2011 08:13:03 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Sep 2011 01:17:44 GMT'}, {'version': 'v3', 'created': 'Tue, 17 Jan 2012 06:41:45 GMT'}]",2015-03-19,"[['Peters', 'Gareth W.', ''], ['Nevat', 'Ido', ''], ['Yuan', 'Jinhong', ''], ['Collings', 'Ian B.', '']]","['System identification', 'Gaussian processes', 'Kernel methods', 'Iterated conditioning on the']"
19265,1510.04931,Jan Leike,Jan Leike and Marcus Hutter,Bad Universal Priors and Notions of Optimality,COLT 2015,,,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A big open question of algorithmic information theory is the choice of the
universal Turing machine (UTM). For Kolmogorov complexity and Solomonoff
induction we have invariance theorems: the choice of the UTM changes bounds
only by a constant. For the universally intelligent agent AIXI (Hutter, 2005)
no invariance theorem is known. Our results are entirely negative: we discuss
cases in which unlucky or adversarial choices of the UTM cause AIXI to
misbehave drastically. We show that Legg-Hutter intelligence and thus balanced
Pareto optimality is entirely subjective, and that every policy is Pareto
optimal in the class of all computable environments. This undermines all
existing optimality properties for AIXI. While it may still serve as a gold
standard for AI, our results imply that AIXI is a relative theory, dependent on
the choice of the UTM.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2015 16:22:23 GMT'}]",2015-10-20,"[['Leike', 'Jan', ''], ['Hutter', 'Marcus', '']]","['AIXI', 'general reinforcement learning', 'universal Turing machine', 'Legg-Hutter intelligence', 'balanced Pareto optimality', 'asymptotic optimality']"
19266,1110.1161,Petros Petrosyan,Petros A. Petrosyan,Interval edge-colorings of cubic graphs,3 pages,"Proceedings of the CSIT Conference, Yerevan, 2011, pp. 86-88",,,cs.DM math.CO,http://creativecommons.org/licenses/by/3.0/,"  An edge-coloring of a multigraph G with colors 1,2,...,t is called an
interval t-coloring if all colors are used, and the colors of edges incident to
any vertex of G are distinct and form an interval of integers. In this paper we
prove that if G is a connected cubic multigraph (a connected cubic graph) that
admits an interval t-coloring, then t\leq |V(G)| +1 (t\leq |V(G)|), where V(G)
is the set of vertices of G. Moreover, if G is a connected cubic graph, G\neq
K_{4}, and G has an interval t-coloring, then t\leq |V(G)| -1. We also show
that these upper bounds are sharp. Finally, we prove that if G is a bipartite
subcubic multigraph, then G has an interval edge-coloring with no more than
four colors.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2011 07:08:00 GMT'}]",2011-10-07,"[['Petrosyan', 'Petros A.', '']]","['Edge-coloring', 'interval edge-coloring', 'cubic graph', 'cubic multigraph', 'bipartite graph']"
19267,1506.08663,Giuseppe Vitiello,Massimo Piattelli-Palmarini and Giuseppe Vitiello,Linguistics and some aspects of its underlying dynamics,17 pages,,,,cs.CL quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, central components of a new approach to linguistics, the
Minimalist Program (MP) have come closer to physics. Features of the Minimalist
Program, such as the unconstrained nature of recursive Merge, the operation of
the Labeling Algorithm that only operates at the interface of Narrow Syntax
with the Conceptual-Intentional and the Sensory-Motor interfaces, the
difference between pronounced and un-pronounced copies of elements in a
sentence and the build-up of the Fibonacci sequence in the syntactic derivation
of sentence structures, are directly accessible to representation in terms of
algebraic formalism. Although in our scheme linguistic structures are classical
ones, we find that an interesting and productive isomorphism can be established
between the MP structure, algebraic structures and many-body field theory
opening new avenues of inquiry on the dynamics underlying some central aspects
of linguistics.
","[{'version': 'v1', 'created': 'Sun, 14 Jun 2015 12:09:01 GMT'}]",2015-06-30,"[['Piattelli-Palmarini', 'Massimo', ''], ['Vitiello', 'Giuseppe', '']]","['syntax', 'minimalist program', 'Labeling Algorithm', 'algebraic methods', 'coherent states', 'self-similarity', 'Fibonacci progression', 'deformed Hopf algebra']"
19268,1412.8118,Lanbo Zhang,Lanbo Zhang and Yi Zhang,"Hierarchical Bayesian Models with Factorization for Content-Based
  Recommendation",,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most existing content-based filtering approaches learn user profiles
independently without capturing the similarity among users. Bayesian
hierarchical models \cite{Zhang:Efficient} learn user profiles jointly and have
the advantage of being able to borrow discriminative information from other
users through a Bayesian prior. However, the standard Bayesian hierarchical
models assume all user profiles are generated from the same prior. Considering
the diversity of user interests, this assumption could be improved by
introducing more flexibility. Besides, most existing content-based filtering
approaches implicitly assume that each user profile corresponds to exactly one
user interest and fail to capture a user's multiple interests (information
needs).
  In this paper, we present a flexible Bayesian hierarchical modeling approach
to model both commonality and diversity among users as well as individual
users' multiple interests. We propose two models each with different
assumptions, and the proposed models are called Discriminative Factored Prior
Models (DFPM). In our models, each user profile is modeled as a discriminative
classifier with a factored model as its prior, and different factors contribute
in different levels to each user profile. Compared with existing content-based
filtering models, DFPM are interesting because they can 1) borrow
discriminative criteria of other users while learning a particular user profile
through the factored prior; 2) trade off well between diversity and commonality
among users; and 3) handle the challenging classification situation where each
class contains multiple concepts. The experimental results on a dataset
collected from real users on digg.com show that our models significantly
outperform the baseline models of L-2 regularized logistic regression and
traditional Bayesian hierarchical model with logistic regression.
","[{'version': 'v1', 'created': 'Sun, 28 Dec 2014 06:07:48 GMT'}]",2014-12-30,"[['Zhang', 'Lanbo', ''], ['Zhang', 'Yi', '']]","['Recommender System', 'Personalized Recommendation', 'Information Filtering', 'Content-based Filtering', 'Bayesian Hierarchical Model', 'Factorization']"
19269,1206.2187,Lluis Pamies-Juarez,"Lluis Pamies-Juarez, Fr\'ed\'erique Oggier, Anwitaman Datta","An Empirical Study of the Repair Performance of Novel Coding Schemes for
  Networked Distributed Storage Systems",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Erasure coding techniques are getting integrated in networked distributed
storage systems as a way to provide fault-tolerance at the cost of less storage
overhead than traditional replication. Redundancy is maintained over time
through repair mechanisms, which may entail large network resource overheads.
In recent years, several novel codes tailor-made for distributed storage have
been proposed to optimize storage overhead and repair, such as Regenerating
Codes that minimize the per repair traffic, or Self-Repairing Codes which
minimize the number of nodes contacted per repair. Existing studies of these
coding techniques are however predominantly theoretical, under the simplifying
assumption that only one object is stored. They ignore many practical issues
that real systems must address, such as data placement, de/correlation of
multiple stored objects, or the competition for limited network resources when
multiple objects are repaired simultaneously. This paper empirically studies
the repair performance of these novel storage centric codes with respect to
classical erasure codes by simulating realistic scenarios and exploring the
interplay of code parameters, failure characteristics and data placement with
respect to the trade-offs of bandwidth usage and speed of repairs.
","[{'version': 'v1', 'created': 'Mon, 11 Jun 2012 12:55:53 GMT'}]",2012-06-12,"[['Pamies-Juarez', 'Lluis', ''], ['Oggier', 'Frédérique', ''], ['Datta', 'Anwitaman', '']]","['networked distributed storage systems', 'erasure codes', 'repairability']"
19270,1306.6125,Sourangsu Banerji,Sourangsu Banerji,"Design and Implementation of an Unmanned Vehicle using a GSM Network
  with Microcontrollers","8 pages, 6 figures, 4 tables. A different version of the paper at
  arXiv:1306.5296","International Journal of Science, Engineering and Technology
  Research (IJSETR), Volume 2, Issue 2, February 2013",,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Now-a-days, a lot of research is being carried out in the development of USVs
(Unmanned surface vehicles), UAVs (Unmanned Aerial Vehicles) etc. Now in case
of USVs generally, we have seen that wireless controlled vehicles use RF
circuits which suffer from many drawbacks such as limited working range,
limited frequency range and limited control. Moreover shooting infrared
outdoors on a bright sunny day is often problematic, since sunlight can
interfere with the infrared signal. Use of a GSM network (in the form of a
mobile phone, a cordless phone) for robotic control can overcome these
limitations. It provides the advantages of robust control, working range as
large as the coverage area of the service provider in comparison with that of
an IR system, no interference with other controllers. This paper presents a
Global System for Mobile Telecommunication (GSM) network based system which can
be used to remotely send streams of 4 bit data for control of USVs.
Furthermore, this paper describes the usage of the Dual Tone Multi-Frequency
(DTMF) function of the phone, and builds a microcontroller based circuit to
control the vehicle to demonstrate wireless data communication. Practical
result obtained showed an appreciable degree of accuracy of the system and
friendliness through the use of a microcontroller.
","[{'version': 'v1', 'created': 'Wed, 26 Jun 2013 04:34:36 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Jun 2013 17:24:47 GMT'}, {'version': 'v3', 'created': 'Sun, 21 Jul 2013 12:00:44 GMT'}, {'version': 'v4', 'created': 'Tue, 30 Jul 2013 03:49:01 GMT'}, {'version': 'v5', 'created': 'Sun, 4 Aug 2013 09:45:48 GMT'}, {'version': 'v6', 'created': 'Sun, 2 Mar 2014 12:52:55 GMT'}, {'version': 'v7', 'created': 'Wed, 12 Mar 2014 06:46:28 GMT'}]",2014-03-13,"[['Banerji', 'Sourangsu', '']]","['DTMF decoder', 'GSM network', 'Microcontroller', 'Motor driver', 'Unmanned Surface Vehicles (USVs)']"
19271,1402.1001,Tiago Guerreiro,"Hugo Nicolau, Jo\~ao Guerreiro, Tiago Guerreiro",Stressing the Boundaries of Mobile Accessibility,"3 pages, two figures, ACM CHI 2013 Mobile Accessibility Workshop",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile devices gather the communication capabilities as no other gadget.
Plus, they now comprise a wider set of applications while still maintaining
reduced size and weight. They have started to include accessibility features
that enable the inclusion of disabled people. However, these inclusive efforts
still fall short considering the possibilities of such devices. This is mainly
due to the lack of interoperability and extensibility of current mobile
operating systems (OS). In this paper, we present a case study of a
multi-impaired person where access to basic mobile applications was provided in
an applicational basis. We outline the main flaws in current mobile OS and
suggest how these could further empower developers to provide accessibility
components. These could then be compounded to provide system-wide inclusion to
a wider range of (multi)-impairments.
","[{'version': 'v1', 'created': 'Wed, 5 Feb 2014 10:30:52 GMT'}]",2014-02-06,"[['Nicolau', 'Hugo', ''], ['Guerreiro', 'João', ''], ['Guerreiro', 'Tiago', '']]","['Mobile', 'Accessibility', 'Assistive Technologies', 'Adaptation', 'MultiImpairment']"
19272,1206.5795,Shafqat Shad Mr,"Shafqat Ali Shad, Enhong Chen, Tengfei Bao",Cell Oscillation Resolution in Mobility Profile Building,,"International Journal of Computer Science Issues, vol. 9, no. 3,
  pp. 205-213, 2012",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper has been withdrawn by the authors. Mobility profile building
became extensively examined area in Location based services (LBS) through
extraction of significant locations. Mobility traces are recorded under three
reference positioning systems that are Satellite based i.e. GPS, Network based
i.e. GSM and Local positioning i.e. WLAN, RFID, IrDA. Satellite based and local
positioning due to of high power consumption, additional resource installation,
low accuracy and space limitation are less encouraging. So network based
positioning i.e. GSM is only viable solution for mobility tracing through Cell
global identity (CGI). CGI presents the Cell-ids to extract the significant
locations from mobility history. However CGI faces cell oscillation problem,
where user is assigned multiple Cell-Ids even at a stationary state for load
balancing and GSM cells overlapping. In this paper we proposed two
semi-supervised methodology for cell oscillation resolution i.e. semantic
tagging and overlapped area clustering, the proposed methodologies are equally
useful for the identification of significant places too.
","[{'version': 'v1', 'created': 'Mon, 25 Jun 2012 06:51:40 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Aug 2012 18:33:30 GMT'}, {'version': 'v3', 'created': 'Fri, 21 Sep 2012 02:13:35 GMT'}, {'version': 'v4', 'created': 'Thu, 24 Oct 2013 20:08:13 GMT'}]",2013-10-28,"[['Shad', 'Shafqat Ali', ''], ['Chen', 'Enhong', ''], ['Bao', 'Tengfei', '']]","['GSM Cell Oscillation', 'Mobility profile mining', 'Spatial extraction', 'Trajectory mining']"
19273,1710.01244,Xuemei Xie,"Xuemei Xie, Yuxiang Wang, Guangming Shi, Chenye Wang, Jiang Du, and
  Zhifu Zhao",Adaptive Measurement Network for CS Image Reconstruction,"11pages,8figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Conventional compressive sensing (CS) reconstruction is very slow for its
characteristic of solving an optimization problem. Convolu- tional neural
network can realize fast processing while achieving compa- rable results. While
CS image recovery with high quality not only de- pends on good reconstruction
algorithms, but also good measurements. In this paper, we propose an adaptive
measurement network in which measurement is obtained by learning. The new
network consists of a fully-connected layer and ReconNet. The fully-connected
layer which has low-dimension output acts as measurement. We train the
fully-connected layer and ReconNet simultaneously and obtain adaptive
measurement. Because the adaptive measurement fits dataset better, in contrast
with random Gaussian measurement matrix, under the same measuremen- t rate, it
can extract the information of scene more efficiently and get better
reconstruction results. Experiments show that the new network outperforms the
original one.
","[{'version': 'v1', 'created': 'Sat, 23 Sep 2017 15:11:19 GMT'}]",2017-10-04,"[['Xie', 'Xuemei', ''], ['Wang', 'Yuxiang', ''], ['Shi', 'Guangming', ''], ['Wang', 'Chenye', ''], ['Du', 'Jiang', ''], ['Zhao', 'Zhifu', '']]","['Compressive sensing', 'Image reconstruction', 'Deep learning', 'Adaptive measurement']"
19274,1402.5360,Chanabasayya Vastrad M,"Doreswamy, Chanabasayya M. Vastrad","Important Molecular Descriptors Selection Using Self Tuned Reweighted
  Sampling Method for Prediction of Antituberculosis Activity",published 2013,,,,cs.LG stat.AP stat.ML,http://creativecommons.org/licenses/by/3.0/,"  In this paper, a new descriptor selection method for selecting an optimal
combination of important descriptors of sulfonamide derivatives data, named
self tuned reweighted sampling (STRS), is developed. descriptors are defined as
the descriptors with large absolute coefficients in a multivariate linear
regression model such as partial least squares(PLS). In this study, the
absolute values of regression coefficients of PLS model are used as an index
for evaluating the importance of each descriptor Then, based on the importance
level of each descriptor, STRS sequentially selects N subsets of descriptors
from N Monte Carlo (MC) sampling runs in an iterative and competitive manner.
In each sampling run, a fixed ratio (e.g. 80%) of samples is first randomly
selected to establish a regresson model. Next, based on the regression
coefficients, a two-step procedure including rapidly decreasing function (RDF)
based enforced descriptor selection and self tuned sampling (STS) based
competitive descriptor selection is adopted to select the important
descriptorss. After running the loops, a number of subsets of descriptors are
obtained and root mean squared error of cross validation (RMSECV) of PLS models
established with subsets of descriptors is computed. The subset of descriptors
with the lowest RMSECV is considered as the optimal descriptor subset. The
performance of the proposed algorithm is evaluated by sulfanomide derivative
dataset. The results reveal an good characteristic of STRS that it can usually
locate an optimal combination of some important descriptors which are
interpretable to the biologically of interest. Additionally, our study shows
that better prediction is obtained by STRS when compared to full descriptor set
PLS modeling, Monte Carlo uninformative variable elimination (MC-UVE).
","[{'version': 'v1', 'created': 'Fri, 21 Feb 2014 17:24:53 GMT'}]",2014-02-24,"[['Doreswamy', '', ''], ['Vastrad', 'Chanabasayya M.', '']]","['MC-UVE', 'PLS', 'RDF', 'TRS', 'Number of']"
19275,1704.06016,Erkan Bostanci,Hamide Ozlem Dalgic and Erkan Bostanci and Mehmet Serdar Guzel,Genetic Algorithm Based Floor Planning System,,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Genetic Algorithms are widely used in many different optimization problems
including layout design. The layout of the shelves play an important role in
the total sales metrics for superstores since this affects the customers'
shopping behaviour. This paper employed a genetic algorithm based approach to
design shelf layout of superstores. The layout design problem was tackled by
using a novel chromosome representation which takes many different parameters
to prevent dead-ends and improve shelf visibility into consideration. Results
show that the approach can produce reasonably good layout designs in very short
amounts of time.
","[{'version': 'v1', 'created': 'Thu, 20 Apr 2017 05:09:39 GMT'}]",2017-04-21,"[['Dalgic', 'Hamide Ozlem', ''], ['Bostanci', 'Erkan', ''], ['Guzel', 'Mehmet Serdar', '']]","['market shelves layout', 'genetic algorithm', 'DEAP']"
19276,2007.05557,Yingyu Liang,Yingyu Liang and Hui Yuan,"Learning Entangled Single-Sample Gaussians in the Subset-of-Signals
  Model","Appear in COLT'2020. Updates: corrected comments on existing works;
  added comparison to median estimator",,,,cs.LG cs.DS stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the setting of entangled single-sample distributions, the goal is to
estimate some common parameter shared by a family of $n$ distributions, given
one single sample from each distribution. This paper studies mean estimation
for entangled single-sample Gaussians that have a common mean but different
unknown variances. We propose the subset-of-signals model where an unknown
subset of $m$ variances are bounded by 1 while there are no assumptions on the
other variances. In this model, we analyze a simple and natural method based on
iteratively averaging the truncated samples, and show that the method achieves
error $O \left(\frac{\sqrt{n\ln n}}{m}\right)$ with high probability when
$m=\Omega(\sqrt{n\ln n})$, matching existing bounds for this range of $m$. We
further prove lower bounds, showing that the error is
$\Omega\left(\left(\frac{n}{m^4}\right)^{1/2}\right)$ when $m$ is between
$\Omega(\ln n)$ and $O(n^{1/4})$, and the error is
$\Omega\left(\left(\frac{n}{m^4}\right)^{1/6}\right)$ when $m$ is between
$\Omega(n^{1/4})$ and $O(n^{1 - \epsilon})$ for an arbitrarily small
$\epsilon>0$, improving existing lower bounds and extending to a wider range of
$m$.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 18:25:38 GMT'}]",2020-07-14,"[['Liang', 'Yingyu', ''], ['Yuan', 'Hui', '']]","['Entangled Gaussians', 'Mean Estimation', 'Subset-of-Signals']"
19277,0710.2782,Leonardo Emmendorfer,Leonardo Emmendorfer and Aurora Pozo,Effective linkage learning using low-order statistics and clustering,Submitted to IEEE Transactions on Evolutionary Computation,,,,cs.NE cs.AI,,"  The adoption of probabilistic models for the best individuals found so far is
a powerful approach for evolutionary computation. Increasingly more complex
models have been used by estimation of distribution algorithms (EDAs), which
often result better effectiveness on finding the global optima for hard
optimization problems. Supervised and unsupervised learning of Bayesian
networks are very effective options, since those models are able to capture
interactions of high order among the variables of a problem. Diversity
preservation, through niching techniques, has also shown to be very important
to allow the identification of the problem structure as much as for keeping
several global optima. Recently, clustering was evaluated as an effective
niching technique for EDAs, but the performance of simpler low-order EDAs was
not shown to be much improved by clustering, except for some simple multimodal
problems. This work proposes and evaluates a combination operator guided by a
measure from information theory which allows a clustered low-order EDA to
effectively solve a comprehensive range of benchmark optimization problems.
","[{'version': 'v1', 'created': 'Mon, 15 Oct 2007 15:28:47 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Oct 2007 13:27:03 GMT'}]",2007-10-16,"[['Emmendorfer', 'Leonardo', ''], ['Pozo', 'Aurora', '']]","['clustering', 'evolutionary computation', 'linkage learning', 'niching']"
19278,1802.06430,Arjun Nitin Bhagoji,"Chawin Sitawarin, Arjun Nitin Bhagoji, Arsalan Mosenia, Mung Chiang,
  and Prateek Mittal",DARTS: Deceiving Autonomous Cars with Toxic Signs,"Submitted to ACM CCS 2018; Extended version of [1801.02780] Rogue
  Signs: Deceiving Traffic Sign Recognition with Malicious Ads and Logos",,,,cs.CR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sign recognition is an integral part of autonomous cars. Any
misclassification of traffic signs can potentially lead to a multitude of
disastrous consequences, ranging from a life-threatening accident to even a
large-scale interruption of transportation services relying on autonomous cars.
In this paper, we propose and examine security attacks against sign recognition
systems for Deceiving Autonomous caRs with Toxic Signs (we call the proposed
attacks DARTS). In particular, we introduce two novel methods to create these
toxic signs. First, we propose Out-of-Distribution attacks, which expand the
scope of adversarial examples by enabling the adversary to generate these
starting from an arbitrary point in the image space compared to prior attacks
which are restricted to existing training/test data (In-Distribution). Second,
we present the Lenticular Printing attack, which relies on an optical
phenomenon to deceive the traffic sign recognition system. We extensively
evaluate the effectiveness of the proposed attacks in both virtual and
real-world settings and consider both white-box and black-box threat models.
Our results demonstrate that the proposed attacks are successful under both
settings and threat models. We further show that Out-of-Distribution attacks
can outperform In-Distribution attacks on classifiers defended using the
adversarial training defense, exposing a new attack vector for these defenses.
","[{'version': 'v1', 'created': 'Sun, 18 Feb 2018 19:39:28 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Feb 2018 02:50:49 GMT'}, {'version': 'v3', 'created': 'Thu, 31 May 2018 20:05:27 GMT'}]",2018-06-04,"[['Sitawarin', 'Chawin', ''], ['Bhagoji', 'Arjun Nitin', ''], ['Mosenia', 'Arsalan', ''], ['Chiang', 'Mung', ''], ['Mittal', 'Prateek', '']]","['Adversarial examples', 'Autonomous cars', 'Lenticular printing', 'Security', 'Sign recognition', 'Toxic signs', 'Traffic signs']"
19279,1105.4379,Labib   Francis Gergis Francis,Labib Francis Gergis,Performance of MC-MC CDMA Systems with Nonlinear Models of HPA,11 Pages,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new wireless communication system denoted as Multi-Code Multi-Carrier CDMA
(MC-MC CDMA), which is the combination of Multi-Code CDMA and Multi-Carrier
CDMA, is analyzed in this paper. This system can satisfy multi-rate services
using multi-code schemes and muti-carrier services used for high rate
transmission. The system is evaluated using Traveling Wave Tube Amplifier
(TWTA). This type of amplifiers continue to offer the best microwave high power
amplifiers (HPA) performance in terms of power efficiency, size and cost, but
lag behind Solid State Power Amplifiers (SSPA's) in linearity. This paper
presents a technique for improving TWTA linearity. The use of predistorter (PD)
linearization technique is described to provide TWTA performance comparable or
superior to conventional SSPA's. The characteristics of the PD scheme is
derived based on the extension of Saleh's model for HPA.
","[{'version': 'v1', 'created': 'Sun, 22 May 2011 23:22:41 GMT'}]",2011-05-24,"[['Gergis', 'Labib Francis', '']]","['Multi-Carrier CDMA', 'Multi-Code CDMA', 'MC-MC CDMA', 'TWTA', 'HPA', 'AM/AM', 'AM/PM', 'Saleh Model']"
19280,1610.09514,Maximilian Speicher,"Maximilian Speicher, Andreas Both, Martin Gaedke","REFOCUS: Current & Future Search Interface Requirements for
  German-speaking Users","Originally published by IADIS in the Proceedings of the 15th
  International Conference on WWW/Internet (ICWI '16). The final publication is
  available at
  http://iadisportal.org/digital-library/refocus-current-future-search-interface-requirements-for-german-speaking-users",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While smartphones are widely used for web browsing, also other novel devices
like Smart TVs become increasingly popular. Yet, current interfaces do not
cater for the newly available devices beyond touch and small screens, if at all
for the latter. Particularly search engines -- today's entry points of the WWW
-- must ensure their interfaces are easy to use on any web-enabled device. We
report on a survey that investigated (1) users' perception and usage of current
search interfaces, and (2) their expectations towards current and future search
interfaces. Users are mostly satisfied with desktop and mobile search, but seem
to be skeptical towards web search with novel devices and input modalities.
Hence, we derive REFOCUS -- a novel set of requirements for current and future
search interfaces, which shall address the demand for improvement of novel web
search and has been validated by 12 dedicated experts.
","[{'version': 'v1', 'created': 'Sat, 29 Oct 2016 14:19:19 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Aug 2022 12:51:02 GMT'}]",2022-08-11,"[['Speicher', 'Maximilian', ''], ['Both', 'Andreas', ''], ['Gaedke', 'Martin', '']]","['Empirical Study', 'Interfaces', 'Novel Devices', 'Requirements', 'Search Engines', 'User Research']"
19281,1701.06254,Hui Liu Mr,"Hui Liu, Lihua Shen, Yan Chen, Kun Wang, Bo Yang, Zhangxin Chen","A Parallel Simulator for Massive Reservoir Models Utilizing
  Distributed-Memory Parallel Systems",arXiv admin note: substantial text overlap with arXiv:1606.00556,,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents our work on developing parallel computational methods for
two-phase flow on modern parallel computers, where techniques for linear
solvers and nonlinear methods are studied and the standard and inexact Newton
methods are investigated. A multi-stage preconditioner for two-phase flow is
applied and advanced matrix processing strategies are studied. A local
reordering method is developed to speed the solution of linear systems.
Numerical experiments show that these computational methods are effective and
scalable, and are capable of computing large-scale reservoir simulation
problems using thousands of CPU cores on parallel computers. The nonlinear
techniques, preconditioner and matrix processing strategies can also be applied
to three-phase black oil, compositional and thermal models.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2017 02:35:21 GMT'}]",2017-01-24,"[['Liu', 'Hui', ''], ['Shen', 'Lihua', ''], ['Chen', 'Yan', ''], ['Wang', 'Kun', ''], ['Yang', 'Bo', ''], ['Chen', 'Zhangxin', '']]","['Multi-phase flow', 'oil-water', 'porous media', 'simulation', 'parallel computer']"
19282,1305.0196,Chantal Cherifi,"Chantal Cherifi, Vincent Labatut, Jean-Fran\c{c}ois Santucci",Topological Properties of Web Services Similarity Networks,,"In Strategic Advantage of Computing Information Systems in
  Enterprise Management, ATINER, pp. 105-117, (2010)",,,cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The number of publicly available Web services (WS) is continuously growing.
To perform efficient WS discovery, it is desirable to organize the WS space.
Works in this direction propose to group WS according to certain shared
properties. Such groups commonly called communities are based either on
similarity or on interaction between WS. In this paper we focus on the former,
and propose a new network-based approach to extract communities from a WS
collection. This process is three-stepped: first we define several similarity
functions able to compare WS operations, second we use them to build so-called
similarity networks, and third we identify communities under the form of
specific structures in these networks. We apply our method on a collection of
real-world WS and comment the resulting communities. Finally, we additionally
provide an analysis and an interpretation of our similarity networks with a
complex networks perspective.
","[{'version': 'v1', 'created': 'Wed, 1 May 2013 15:16:04 GMT'}]",2013-05-02,"[['Cherifi', 'Chantal', ''], ['Labatut', 'Vincent', ''], ['Santucci', 'Jean-François', '']]","['Web Services', 'Web services Similarity', 'Complex Networks', 'Semantic Web']"
19283,1501.04006,Ha Bui,"P. Rajeev, Ha H. Bui, N. Sivakugan","Seismic Earth Pressure Development in Sheet Pile Retaining Walls: A
  Numerical Study",,,,,cs.CE physics.geo-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The design of retaining walls requires the complete knowledge of the earth
pressure distribution behind the wall. Due to the complex soil-structure
effect, the estimation of earth pressure is not an easy task; even in the
static case. The problem becomes even more complex for the dynamic (i.e.,
seismic) analysis and design of retaining walls. Several earth pressure models
have been developed over the years to integrate the dynamic earth pressure with
the static earth pressure and to improve the design of retaining wall in
seismic regions. Among all the models, MononobeOkabe (M-O) method is commonly
used to estimate the magnitude of seismic earth pressures in retaining walls
and is adopted in design practices around the world (e.g., EuroCode and
Australian Standards). However, the M-O method has several drawbacks and does
not provide reliable estimate of the earth pressure in many instances. This
study investigates the accuracy of the M-O method to predict the dynamic earth
pressure in sheet pile wall. A 2D plane strain finite element model of the
wall-soil system was developed in DIANA. The backfill soil was modelled with
Mohr-Coulomb failure criterion while the wall was assumed behave elastically.
The numerically predicted dynamic earth pressure was compared with the M-O
model prediction. Further, the point of application of total dynamic force was
determined and compared with the static case. Finally, the applicability of M-O
methods to compute the seismic earth pressure was discussed.
","[{'version': 'v1', 'created': 'Fri, 16 Jan 2015 15:03:20 GMT'}]",2015-01-19,"[['Rajeev', 'P.', ''], ['Bui', 'Ha H.', ''], ['Sivakugan', 'N.', '']]","['Seismic earth pressure', 'retaining wall', 'elasto-plastic', 'Mohr-Coulomb', 'Mononobe-Okabe']"
19284,1304.5197,Daniele Cono D'Elia,"Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi",Ball-Larus Path Profiling Across Multiple Loop iterations,"13 pages, 14 figures",,,,cs.PL cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Identifying the hottest paths in the control flow graph of a routine can
direct optimizations to portions of the code where most resources are consumed.
This powerful methodology, called path profiling, was introduced by Ball and
Larus in the mid 90s and has received considerable attention in the last 15
years for its practical relevance. A shortcoming of Ball-Larus path profiling
was the inability to profile cyclic paths, making it difficult to mine
interesting execution patterns that span multiple loop iterations. Previous
results, based on rather complex algorithms, have attempted to circumvent this
limitation at the price of significant performance losses already for a small
number of iterations. In this paper, we present a new approach to multiple
iterations path profiling, based on data structures built on top of the
original Ball-Larus numbering technique. Our approach allows it to profile all
executed paths obtained as a concatenation of up to k Ball-Larus acyclic paths,
where k is a user-defined parameter. An extensive experimental investigation on
a large variety of Java benchmarks on the Jikes RVM shows that, surprisingly,
our approach can be even faster than Ball-Larus due to fewer operations on
smaller hash tables, producing compact representations of cyclic paths even for
large values of k.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2013 17:34:38 GMT'}]",2013-04-30,"[[""D'Elia"", 'Daniele Cono', ''], ['Demetrescu', 'Camil', ''], ['Finocchi', 'Irene', '']]","['Profiling', 'dynamic program analysis', 'instrumentation']"
19285,1606.03701,Mohammed Salim Benqatla,"Mohammed Salim Benqatla, Dikra Chikhaoui, Bouchaib Bounabat","IT Governance in Actor-Network Mode of Collaboration : Cost Management
  Process Based on Game Theory",,,,,cs.CY cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  IT governance, like global governance of projects, requires cooperation
between several actors. In general, such cooperation builds a collaboration
network between entities. Many works in the literature interested in
collaboration network, but no one of them were focused directly on how to build
a network in an IT governance perspective. In this paper, we investigate how
game theory can be exploited to provide a formal implementation of Cost
Management Process, while highlighting Actor-Network as a framework of
collaboration and its incentive stage as a key step for network construction.
Our objective is to propose an approach of network establishment, by inciting
actors through cost savings. For that, we use Shapley Value to answer the
question: For the sake of IT governance, which coalitions are likely to form in
order to ensure best cost-saving objectives in ANT mode of collaboration? A
graphical tool is developed also to visualize and simulate networks evolution.
","[{'version': 'v1', 'created': 'Sun, 12 Jun 2016 12:35:12 GMT'}]",2016-06-14,"[['Benqatla', 'Mohammed Salim', ''], ['Chikhaoui', 'Dikra', ''], ['Bounabat', 'Bouchaib', '']]","['Collaboration Network', 'Actor Network Theory', 'Cost-Sharing', 'Cooperative Game theory', 'Shapley Value', 'COBIT 5', 'IT System Governance']"
19286,1110.0631,Fabrizio Riguzzi PhD,Fabrizio Riguzzi and Terrance Swift,"Well-Definedness and Efficient Inference for Probabilistic Logic
  Programming under the Distribution Semantics","31 pages, 8 figures",,,,cs.AI cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The distribution semantics is one of the most prominent approaches for the
combination of logic programming and probability theory. Many languages follow
this semantics, such as Independent Choice Logic, PRISM, pD, Logic Programs
with Annotated Disjunctions (LPADs) and ProbLog. When a program contains
functions symbols, the distribution semantics is well-defined only if the set
of explanations for a query is finite and so is each explanation.
Well-definedness is usually either explicitly imposed or is achieved by
severely limiting the class of allowed programs. In this paper we identify a
larger class of programs for which the semantics is well-defined together with
an efficient procedure for computing the probability of queries. Since LPADs
offer the most general syntax, we present our results for them, but our results
are applicable to all languages under the distribution semantics. We present
the algorithm ""Probabilistic Inference with Tabling and Answer subsumption""
(PITA) that computes the probability of queries by transforming a probabilistic
program into a normal program and then applying SLG resolution with answer
subsumption. PITA has been implemented in XSB and tested on six domains: two
with function symbols and four without. The execution times are compared with
those of ProbLog, cplint and CVE, PITA was almost always able to solve larger
problems in a shorter time, on domains with and without function symbols.
","[{'version': 'v1', 'created': 'Tue, 4 Oct 2011 10:29:32 GMT'}]",2011-10-05,"[['Riguzzi', 'Fabrizio', ''], ['Swift', 'Terrance', '']]","['Probabilistic Logic Programming', 'Tabling', 'Answer Subsumption', 'LogicPrograms with Annotated Disjunction', 'Program Transformation']"
19287,1610.01986,Mehdi Khamassi,"Mehdi Khamassi, Costas Tzafestas",Active exploration in parameterized reinforcement learning,Submitted to EWRL2016,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Online model-free reinforcement learning (RL) methods with continuous actions
are playing a prominent role when dealing with real-world applications such as
Robotics. However, when confronted to non-stationary environments, these
methods crucially rely on an exploration-exploitation trade-off which is rarely
dynamically and automatically adjusted to changes in the environment. Here we
propose an active exploration algorithm for RL in structured (parameterized)
continuous action space. This framework deals with a set of discrete actions,
each of which is parameterized with continuous variables. Discrete exploration
is controlled through a Boltzmann softmax function with an inverse temperature
$\beta$ parameter. In parallel, a Gaussian exploration is applied to the
continuous action parameters. We apply a meta-learning algorithm based on the
comparison between variations of short-term and long-term reward running
averages to simultaneously tune $\beta$ and the width of the Gaussian
distribution from which continuous action parameters are drawn. When applied to
a simple virtual human-robot interaction task, we show that this algorithm
outperforms continuous parameterized RL both without active exploration and
with active exploration based on uncertainty variations measured by a
Kalman-Q-learning algorithm.
","[{'version': 'v1', 'created': 'Thu, 6 Oct 2016 18:34:04 GMT'}]",2016-10-07,"[['Khamassi', 'Mehdi', ''], ['Tzafestas', 'Costas', '']]","['Reinforcement Learning', 'Exploration/Exploitation', 'Multi-Armed Bandits', 'Meta-Learning', 'Active Exploration', 'Parameterized/Structured Reinforcement Learning']"
19288,1108.6175,Serge Kernbach,"Eugen Meister, Sergej Stepanenko, Serge Kernbach",Adaptive Locomotion of Multibody Snake-like Robot,"Multibody Dynamics 2011, ECCOMAS Thematic Conference, J.C. Samin, P.
  Fisette (eds.) Brussels, Belgium, 4-7 July, 2011",,,,cs.RO cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper represents an adaptive rhythmic control for a snake-like robot
with 25 degrees of freedom. The adaptive gait control is implemented in
algorithmic way in simulation and on a real robot. We investigated behavioral
and energetic properties of this control and a dynamics of different body
segments. It turned out that despite using homogeneous generators, physical
constraints have an inhomogeneous impact on neighbor body segments. By
analytical modeling of such dynamics, it may result in heterogeneous coupling
of oscillators for a rhythmic control and impact scalability and
synchronization effects of gait pattern generators.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2011 09:44:08 GMT'}]",2011-09-01,"[['Meister', 'Eugen', ''], ['Stepanenko', 'Sergej', ''], ['Kernbach', 'Serge', '']]","['Snake Locomotion', 'Adaptive behaviour', 'Rhythmic control', 'Gait pattern generators', 'Constrains']"
19289,1603.08305,Shouhuai Xu,Gaofeng Da and Maochao Xu and Shouhuai Xu,A New Approach to Modeling and Analyzing Security of Networked Systems,"Proceedings of the 2014 Symposium on the Science of Security
  (HotSoS'14)",,,,cs.CR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modeling and analyzing security of networked systems is an important problem
in the emerging Science of Security and has been under active investigation. In
this paper, we propose a new approach towards tackling the problem. Our
approach is inspired by the {\em shock model} and {\em random environment}
techniques in the Theory of Reliability, while accommodating security
ingredients. To the best of our knowledge, our model is the first that can
accommodate a certain degree of {\em adaptiveness of attacks}, which
substantially weakens the often-made independence and exponential attack
inter-arrival time assumptions. The approach leads to a stochastic process
model with two security metrics, and we attain some analytic results in terms
of the security metrics.
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2016 04:41:12 GMT'}]",2016-03-29,"[['Da', 'Gaofeng', ''], ['Xu', 'Maochao', ''], ['Xu', 'Shouhuai', '']]","['Security modeling', 'security analysis', 'security metrics']"
19290,1005.4292,Chriss Romy,"Mrigank Rajya, Sonal Rewri, Swati Sheoran",Application Of Fuzzy System In Segmentation Of MRI Brain Tumor,"IEEE Publication format, International Journal of Computer Science
  and Information Security, IJCSIS, Vol. 8 No. 1, April 2010, USA. ISSN 1947
  5500, http://sites.google.com/site/ijcsis/",,,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Segmentation of images holds an important position in the area of image
processing. It becomes more important whi le typically dealing with medical
images where presurgery and post surgery decisions are required for the purpose
of initiating and speeding up the recovery process. Segmentation of 3-D tumor
structures from magnetic resonance images (MRI) is a very challenging problem
due to the variability of tumor geometry and intensity patterns. Level set
evolution combining global smoothness with the flexibility of topology changes
offers significant advantages over the conventional statistical classification
followed by mathematical morphology. Level set evolution with constant
propagation needs to be initialized either completely inside or outside the
tumor and can leak through weak or missing boundary parts. Replacing the
constant propagation term by a statistical force overcomes these limitations
and results in a convergence to a stable solution. Using MR images presenting
tumors, probabilities for background and tumor regions are calculated from a
pre- and post-contrast difference image and mixture modeling fit of the
histogram. The whole image is used for initialization of the level set
evolution to segment the tumor boundaries.
","[{'version': 'v1', 'created': 'Mon, 24 May 2010 09:59:08 GMT'}]",2010-05-25,"[['Rajya', 'Mrigank', ''], ['Rewri', 'Sonal', ''], ['Sheoran', 'Swati', '']]","['Level set evaluation', 'medical imageprocessing', 'MRI', 'tumor segmentation']"
19291,1702.05308,Shubham Dokania,"Shubham Dokania, Ayush Chopra, Feroz Ahmad, Anil Singh Parihar","Hierarchy Influenced Differential Evolution: A Motor Operation Inspired
  Approach","8 pages, accepted at IJCCI 2017",,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Operational maturity of biological control systems have fuelled the
inspiration for a large number of mathematical and logical models for control,
automation and optimisation. The human brain represents the most sophisticated
control architecture known to us and is a central motivation for several
research attempts across various domains. In the present work, we introduce an
algorithm for mathematical optimisation that derives its intuition from the
hierarchical and distributed operations of the human motor system. The system
comprises global leaders, local leaders and an effector population that adapt
dynamically to attain global optimisation via a feedback mechanism coupled with
the structural hierarchy. The hierarchical system operation is distributed into
local control for movement and global controllers that facilitate gross motion
and decision making. We present our algorithm as a variant of the classical
Differential Evolution algorithm, introducing a hierarchical crossover
operation. The discussed approach is tested exhaustively on standard test
functions as well as the CEC 2017 benchmark. Our algorithm significantly
outperforms various standard algorithms as well as their popular variants as
discussed in the results.
","[{'version': 'v1', 'created': 'Fri, 17 Feb 2017 11:47:50 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Sep 2017 11:46:59 GMT'}]",2017-09-13,"[['Dokania', 'Shubham', ''], ['Chopra', 'Ayush', ''], ['Ahmad', 'Feroz', ''], ['Parihar', 'Anil Singh', '']]","['Differential Evolution', 'Metaheuristics', 'Continuous Optimization', 'Hierarchical Influence']"
19292,1002.3997,William Jackson,"V. Grosu, E. Hlaciuc, E. Iancu, R. Petris, M. Socoliuc",The Role of the XBRL Standard in Optimizing the Financial Reporting,,"Journal of Computing, Volume 2, Issue 2, February 2010,
  https://sites.google.com/site/journalofcomputing/",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When the financial information is difficult to produce, interpret, compare
and analyze, we are put in the situation to face inconvenient consequences with
negative repercussions, such as: the investor can give up the investment (with
negative consequences on the risk equity market), the banks may not give loans,
an auditor may not consider the financial statements as being credible etc.
These facts allow the introduction of this paper's main objective, the
eXtensible Business Reporting Language (XBRL) which is an open standard,
independent and international for the treatments, opportunity, correctness,
efficiency and minor costs of the financial and economical information. The
XBRL will be analyzed in the second part of the paper, the history of this
electronic communication language will be described, as there will also be
described the promoting organizations, the base technology (the WEB and XML
architecture which will be the next stage of the internet programming), and the
role it has within the chain of reporting between the XBRL consortium and the
international accounting organizations IASB-CI. This taxonomy serves clearly
every accounting and extra- accounting information made by the company. This
information which is treated in present by resorting to various formats or
structures (most times incompatible between them and the owners) will be
standardized with the XBRL.
","[{'version': 'v1', 'created': 'Sun, 21 Feb 2010 19:26:13 GMT'}]",2010-03-25,"[['Grosu', 'V.', ''], ['Hlaciuc', 'E.', ''], ['Iancu', 'E.', ''], ['Petris', 'R.', ''], ['Socoliuc', 'M.', '']]","['eXtensible Business Reporting Language', 'XML', 'economical-financial communication standard']"
19293,1307.0687,Gokce Gorbil,"Erol Gelenbe, Gokce Gorbil, Dimitrios Tzovaras, Steffen Liebergeld,
  David Garcia, Madalina Baltatu and George Lyberopoulos",Security for Smart Mobile Networks: The NEMESYS Approach,"Accepted for publication in PRISMS'13; 8 pages. arXiv admin note:
  text overlap with arXiv:1305.5483",,,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The growing popularity of smart mobile devices such as smartphones and
tablets has made them an attractive target for cyber-criminals, resulting in a
rapidly growing and evolving mobile threat as attackers experiment with new
business models by targeting mobile users. With the emergence of the first
large-scale mobile botnets, the core network has also become vulnerable to
distributed denial-of-service attacks such as the signaling attack.
Furthermore, complementary access methods such as Wi-Fi and femtocells
introduce additional vulnerabilities for the mobile users as well as the core
network. In this paper, we present the NEMESYS approach to smart mobile network
security. The goal of the NEMESYS project is to develop novel security
technologies for seamless service provisioning in the smart mobile ecosystem,
and to improve mobile network security through a better understanding of the
threat landscape. To this purpose, NEMESYS will collect and analyze information
about the nature of cyber-attacks targeting smart mobile devices and the core
network so that appropriate counter-measures can be taken. We are developing a
data collection infrastructure that incorporates virtualized mobile honeypots
and honeyclients in order to gather, detect and provide early warning of mobile
attacks and understand the modus operandi of cyber-criminals that target mobile
devices. By correlating the extracted information with known attack patterns
from wireline networks, we plan to reveal and identify the possible shift in
the way that cyber-criminals launch attacks against smart mobile devices.
","[{'version': 'v1', 'created': 'Tue, 2 Jul 2013 11:27:39 GMT'}]",2013-07-03,"[['Gelenbe', 'Erol', ''], ['Gorbil', 'Gokce', ''], ['Tzovaras', 'Dimitrios', ''], ['Liebergeld', 'Steffen', ''], ['Garcia', 'David', ''], ['Baltatu', 'Madalina', ''], ['Lyberopoulos', 'George', '']]","['Mobile network security', 'femtocell security', 'anomalydetection', 'visual analytics', 'virtual mobile client honeypot']"
19294,1702.01731,Mohammadreza Babaee,"Mohammadreza Babaee, Duc Tung Dinh, Gerhard Rigoll",A Deep Convolutional Neural Network for Background Subtraction,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we present a novel background subtraction system that uses a
deep Convolutional Neural Network (CNN) to perform the segmentation. With this
approach, feature engineering and parameter tuning become unnecessary since the
network parameters can be learned from data by training a single CNN that can
handle various video scenes. Additionally, we propose a new approach to
estimate background model from video. For the training of the CNN, we employed
randomly 5 percent video frames and their ground truth segmentations taken from
the Change Detection challenge 2014(CDnet 2014). We also utilized
spatial-median filtering as the post-processing of the network outputs. Our
method is evaluated with different data-sets, and the network outperforms the
existing algorithms with respect to the average ranking over different
evaluation metrics. Furthermore, due to the network architecture, our CNN is
capable of real time processing.
","[{'version': 'v1', 'created': 'Mon, 6 Feb 2017 18:24:04 GMT'}]",2017-02-07,"[['Babaee', 'Mohammadreza', ''], ['Dinh', 'Duc Tung', ''], ['Rigoll', 'Gerhard', '']]","['Background subtraction', 'change detection', 'deep learning']"
19295,1606.07722,Kai-Chun Hsu,"Kai-Chun Hsu, Szu-Yu Chou, Yi-Hsuan Yang, Tai-Shih Chi",Neural Network Based Next-Song Recommendation,"5 pages, 3 figures, the 1st Workshop on Deep Learning for Recommender
  Systems (DLRS 2016)",,,,cs.IR cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, the next-item/basket recommendation system, which considers the
sequential relation between bought items, has drawn attention of researchers.
The utilization of sequential patterns has boosted performance on several kinds
of recommendation tasks. Inspired by natural language processing (NLP)
techniques, we propose a novel neural network (NN) based next-song recommender,
CNN-rec, in this paper. Then, we compare the proposed system with several NN
based and classic recommendation systems on the next-song recommendation task.
Verification results indicate the proposed system outperforms classic systems
and has comparable performance with the state-of-the-art system.
","[{'version': 'v1', 'created': 'Fri, 24 Jun 2016 15:25:55 GMT'}]",2016-06-27,"[['Hsu', 'Kai-Chun', ''], ['Chou', 'Szu-Yu', ''], ['Yang', 'Yi-Hsuan', ''], ['Chi', 'Tai-Shih', '']]","['Next-song recommendation', 'music recommendation', 'neural network', 'sequential recommender', 'word embedding']"
19296,1704.06985,Laurent Bako,"J\'er\'emie Kreiss, Laurent Bako, Eric Blanco","Optimal control of discrete-time switched linear systems via continuous
  parameterization","6 pages, 2 figures, 2 tables; To appear in the Proceedings of IFAC
  World Congress, 2017",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper presents a novel method for designing an optimal controller for
discrete-time switched linear systems. The problem is formulated as one of
computing the discrete mode sequence and the continuous input sequence that
jointly minimize a quadratic performance index. State-of-art methods for
solving such a control problem suffer in general from a high computational
requirement due to the fact that an exponential number of switching sequences
must be explored. The method of this paper addresses the challenge of the
switching law design by introducing auxiliary continuous input variables and
then solving a non-smooth block-sparsity inducing optimization problem.
","[{'version': 'v1', 'created': 'Sun, 23 Apr 2017 21:28:53 GMT'}]",2017-04-25,"[['Kreiss', 'Jérémie', ''], ['Bako', 'Laurent', ''], ['Blanco', 'Eric', '']]","['optimal control', 'switched linear systems', 'quadratic control', 'dynamic programming']"
19297,1406.6087,Maxim Lvov,Maxim Lvov and Haim H. Permuter,Initialization Algorithms For Convolutional Network Coding,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present algorithms for initializing a convolutional network coding scheme
in networks that may contain cycles. An initialization process is needed if the
network is unknown or if local encoding kernels are chosen randomly. During the
initialization process every source node transmits basis vectors and every sink
node measures the impulse response of the network. The impulse response is then
used to find a relationship between the transmitted and the received symbols,
which is needed for a decoding algorithm and to find the set of all achievable
rates. Unlike acyclic networks, for which it is enough to transmit basis
vectors one after another, the initialization of cyclic networks is more
involved, as pilot symbols interfere with each other and the impulse response
is of infinite duration.
","[{'version': 'v1', 'created': 'Mon, 23 Jun 2014 20:50:08 GMT'}]",2014-06-25,"[['Lvov', 'Maxim', ''], ['Permuter', 'Haim H.', '']]","['Cayley-Hamilton Theorem', 'Convolutional network coding', 'Cyclic net']"
19298,1004.3809,Khaled Khalil,"Khaled M. Khalil, M. Abdel-Aziz, Taymour T. Nazmy, Abdel-Badeeh M.
  Salem","Artificial Immune Systems Metaphor for Agent Based Modeling of Crisis
  Response Operations","12 pages, 5 figures, and 5 tables. Submitted to MATES2010: Eighth
  German Conference on Multi-Agents System Technologies, September 21,
  2010-September 23, 2010 in Karlsruhe, Germany.",,,,cs.MA cs.AI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Crisis response requires information intensive efforts utilized for reducing
uncertainty, calculating and comparing costs and benefits, and managing
resources in a fashion beyond those regularly available to handle routine
problems. This paper presents an Artificial Immune Systems (AIS) metaphor for
agent based modeling of crisis response operations. The presented model
proposes integration of hybrid set of aspects (multi-agent systems, built-in
defensive model of AIS, situation management, and intensity-based learning) for
crisis response operations. In addition, the proposed response model is applied
on the spread of pandemic influenza in Egypt as a case study.
","[{'version': 'v1', 'created': 'Wed, 21 Apr 2010 21:33:32 GMT'}]",2010-04-23,"[['Khalil', 'Khaled M.', ''], ['Abdel-Aziz', 'M.', ''], ['Nazmy', 'Taymour T.', ''], ['Salem', 'Abdel-Badeeh M.', '']]","['Crisis Response', 'Multi-agent Systems', 'Agent-Based Modeling', 'Artificial Immune Systems', 'Process Model']"
19299,1303.6976,Monica Patriche,Monica Patriche,The reduction of qualitative games,21 pages,,,,cs.GT math.OC,http://creativecommons.org/licenses/by/3.0/,"  We extend the study of the iterated elimination of strictly dominated
strategies (IESDS) from Nash strategic games to a class of qualitative games.
Also in this case, the IESDS process leads us to a kind of 'rationalizable'
result. We define several types of dominance relation and game reduction and
establish conditions under which a unique and nonempty maximal reduction
exists. We generalize, in this way, some results due to Dufwenberg and Stegeman
(2002) and Apt (2007).
","[{'version': 'v1', 'created': 'Wed, 27 Mar 2013 20:48:10 GMT'}]",2013-03-29,"[['Patriche', 'Monica', '']]","['dominance relation', 'iterated elimination of strictly dominatedstrategies', 'maximal reduction of a game', 'qualitative games']"
19300,1304.5313,Anirban Sarkar,"Somesh Kumar Prajapati, Suvamoy Changder, Anirban Sarkar",Trust Management Model for Cloud Computing Environment,"5 Pages, 2 Figures, Conference","Somesh Kumar Prajapati, Suvamoy Changder, Anirban Sarkar, ""Trust
  Management Model for Cloud Computing Environment"", International Conference
  on Computing Communication and Advanced Network, India, PP 1-5, March 15-17,
  2013",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software as a service or (SaaS) is a new software development and deployment
paradigm over the cloud and offers Information Technology services dynamically
as ""on-demand"" basis over the internet. Trust is one of the fundamental
security concepts on storing and delivering such services. In general, trust
factors are integrated into such existent security frameworks in order to add a
security level to entities collaborations through the trust relationship.
However, deploying trust factor in the secured cloud environment are more
complex engineering task due to the existence of heterogeneous types of service
providers and consumers. In this paper, a formal trust management model has
been introduced to manage the trust and its properties for SaaS in cloud
computing environment. The model is capable to represent the direct trust,
recommended trust, reputation etc. formally. For the analysis of the trust
properties in the cloud environment, the proposed approach estimates the trust
value and uncertainty of each peer by computing decay function, number of
positive interactions, reputation factor and satisfaction level for the
collected information.
","[{'version': 'v1', 'created': 'Fri, 19 Apr 2013 05:38:13 GMT'}]",2013-04-22,"[['Prajapati', 'Somesh Kumar', ''], ['Changder', 'Suvamoy', ''], ['Sarkar', 'Anirban', '']]","['Cloud Computing', 'SaaS', 'Cloud Security', 'Trust Model', 'Security', 'Recommendation', 'Reputation']"
19301,0907.1728,Tao Zhou,Linyuan Lu and Tao Zhou,Role of Weak Ties in Link Prediction of Complex Networks,"4 pages, 1 figure and 2 tables. Accepted by CIKM workshop, see
  http://www.dcs.bbk.ac.uk/~dell/cnikm09/#programme",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Plenty of algorithms for link prediction have been proposed and were applied
to various real networks. Among these works, the weights of links are rarely
taken into account. In this paper, we use local similarity indices to estimate
the likelihood of the existence of links in weighted networks, including Common
Neighbor, Adamic-Adar Index, Resource Allocation Index, and their weighted
versions. In both the unweighted and weighted cases, the resource allocation
index performs the best. To our surprise, the weighted indices perform worse,
which reminds us of the well-known Weak Tie Theory. Further extensive
experimental study shows that the weak ties play a significant role in the link
prediction problem, and to emphasize the contribution of weak ties can
remarkably enhance the predicting accuracy.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2009 19:25:20 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Aug 2009 17:38:16 GMT'}]",2009-08-14,"[['Lu', 'Linyuan', ''], ['Zhou', 'Tao', '']]","['Link prediction', 'Weak ties theory', 'Complex networks']"
19302,1406.6201,Reiner Lenz,Reiner Lenz,Saccadic Eye Movements and the Generalized Pareto Distribution,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a statistical analysis of the eye tracker measurements in a
database with 15 observers viewing 1003 images under free-viewing conditions.
In contrast to the common approach of investigating the properties of the
fixation points we analyze the properties of the transition phases between
fixations. We introduce hyperbolic geometry as a tool to measure the step
length between consecutive eye positions. We show that the step lengths,
measured in hyperbolic and euclidean geometry, follow a generalized Pareto
distribution. The results based on the hyperbolic distance are more robust than
those based on euclidean geometry. We show how the structure of the space of
generalized Pareto distributions can be used to characterize and identify
individual observers.
","[{'version': 'v1', 'created': 'Tue, 24 Jun 2014 10:57:50 GMT'}]",2014-06-25,"[['Lenz', 'Reiner', '']]","['Eye tracking', 'generalized pareto distribution', 'hyperbolic geometry', 'distributionfitting', 'classification']"
19303,0804.3817,Jan Arpe,Jan Arpe and Elchanan Mossel,Multiple Random Oracles Are Better Than One,17 pages,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of learning k-juntas given access to examples drawn from
a number of different product distributions. Thus we wish to learn a function f
: {-1,1}^n -> {-1,1} that depends on k (unknown) coordinates. While the best
known algorithms for the general problem of learning a k-junta require running
time of n^k * poly(n,2^k), we show that given access to k different product
distributions with biases separated by \gamma>0, the functions may be learned
in time poly(n,2^k,\gamma^{-k}). More generally, given access to t <= k
different product distributions, the functions may be learned in time n^{k/t} *
poly(n,2^k,\gamma^{-k}). Our techniques involve novel results in Fourier
analysis relating Fourier expansions with respect to different biases and a
generalization of Russo's formula.
","[{'version': 'v1', 'created': 'Wed, 23 Apr 2008 23:18:00 GMT'}]",2008-04-25,"[['Arpe', 'Jan', ''], ['Mossel', 'Elchanan', '']]","['learning juntas', 'PAC learning', 'biased product distributions', 'Fourier analysis of Boolean functions', 'Russo’s formula']"
19304,1506.01171,Ahmed Salama Sayed,"Ahmed G. M. ElSayed, Ahmed S. Salama and Alaa El-Din M. El-Ghazali","A Hybrid Model for Enhancing Lexical Statistical Machine Translation
  (SMT)","9 pages, 10 figures","International Journal of Computer Science Issues Volume 12, Issue
  2, March 2015",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The interest in statistical machine translation systems increases currently
due to political and social events in the world. A proposed Statistical Machine
Translation (SMT) based model that can be used to translate a sentence from the
source Language (English) to the target language (Arabic) automatically through
efficiently incorporating different statistical and Natural Language Processing
(NLP) models such as language model, alignment model, phrase based model,
reordering model, and translation model. These models are combined to enhance
the performance of statistical machine translation (SMT). Many implementation
tools have been used in this work such as Moses, Gizaa++, IRSTLM, KenLM, and
BLEU. Based on the implementation, evaluation of this model, and comparing the
generated translation with other implemented machine translation systems like
Google Translate, it was proved that this proposed model has enhanced the
results of the statistical machine translation, and forms a reliable and
efficient model in this field of research.
","[{'version': 'v1', 'created': 'Wed, 3 Jun 2015 09:18:05 GMT'}]",2015-06-04,"[['ElSayed', 'Ahmed G. M.', ''], ['Salama', 'Ahmed S.', ''], ['El-Ghazali', 'Alaa El-Din M.', '']]","['Machine Learning', 'Statistical Machine Translation', 'Lexical Machine Translation', 'Linguistics']"
19305,1407.7626,Deepak Nayak Ranjan,"Deepak Ranjan Nayak, Prashanta Kumar Patra, Amitav Mahapatra","A Survey on Two Dimensional Cellular Automata and Its Application in
  Image Processing","10 pages, 10 figures, 4 tables",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Parallel algorithms for solving any image processing task is a highly
demanded approach in the modern world. Cellular Automata (CA) are the most
common and simple models of parallel computation. So, CA has been successfully
used in the domain of image processing for the last couple of years. This paper
provides a survey of available literatures of some methodologies employed by
different researchers to utilize the cellular automata for solving some
important problems of image processing. The survey includes some important
image processing tasks such as rotation, zooming, translation, segmentation,
edge detection, compression and noise reduction of images. Finally, the
experimental results of some methodologies are presented.
","[{'version': 'v1', 'created': 'Tue, 29 Jul 2014 04:09:09 GMT'}]",2014-07-30,"[['Nayak', 'Deepak Ranjan', ''], ['Patra', 'Prashanta Kumar', ''], ['Mahapatra', 'Amitav', '']]","['Cellular Automata', 'Linear Rule', 'Edge detection', 'Noise Reduction', 'Zooming', 'Rotation', 'Translation']"
19306,1701.01539,K. Alex Mills,"K. Alex Mills, R. Chandrasekaran, Neeraj Mittal","Algorithms for Optimal Replica Placement Under Correlated Failure in
  Hierarchical Failure Domains","64 pages, 9 figures. Preprint submission to Theoretical Computer
  Science",,,,cs.DS cs.DC cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In data centers, data replication is the primary method used to ensure
availability of customer data. To avoid correlated failure, cloud storage
infrastructure providers model hierarchical failure domains using a tree, and
avoid placing a large number of data replicas within the same failure domain
(i.e. on the same branch of the tree). Typical best practices ensure that
replicas are distributed across failure domains, but relatively little is known
concerning optimization algorithms for distributing data replicas. Using a
hierarchical model, we answer how to distribute replicas across failure domains
optimally. We formulate a novel optimization problem for replica placement in
data centers. As part of our problem, we formalize and explain a new criterion
for optimizing a replica placement. Our overall goal is to choose placements in
which correlated failures disable as few replicas as possible. We provide two
optimization algorithms for dependency models represented by trees. We first
present an $O(n + \rho \log \rho)$ time dynamic programming algorithm for
placing $\rho$ replicas of a single file on the leaves (representing servers)
of a tree with $n$ vertices. We next consider the problem of placing replicas
of $m$ blocks of data, where each block may have different replication factors.
For this problem, we give an exact algorithm which runs in polynomial time when
the skew, the difference in the number of replicas between the largest and
smallest blocks of data, is constant.
","[{'version': 'v1', 'created': 'Fri, 6 Jan 2017 04:05:09 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Mar 2017 18:43:01 GMT'}, {'version': 'v3', 'created': 'Tue, 4 Apr 2017 19:40:37 GMT'}, {'version': 'v4', 'created': 'Thu, 20 Apr 2017 00:30:50 GMT'}]",2017-04-21,"[['Mills', 'K. Alex', ''], ['Chandrasekaran', 'R.', ''], ['Mittal', 'Neeraj', '']]","['Replica Placement', 'Correlated Failure', 'CombinatorialOptimization', 'Fault-tolerant Storage', 'Data Center Management']"
19307,1306.4886,Luis Marujo,"Luis Marujo, Anatole Gershman, Jaime Carbonell, Robert Frederking,
  Jo\~ao P. Neto","Supervised Topical Key Phrase Extraction of News Stories using
  Crowdsourcing, Light Filtering and Co-reference Normalization","In 8th International Conference on Language Resources and Evaluation
  (LREC 2012)",,,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fast and effective automated indexing is critical for search and personalized
services. Key phrases that consist of one or more words and represent the main
concepts of the document are often used for the purpose of indexing. In this
paper, we investigate the use of additional semantic features and
pre-processing steps to improve automatic key phrase extraction. These features
include the use of signal words and freebase categories. Some of these features
lead to significant improvements in the accuracy of the results. We also
experimented with 2 forms of document pre-processing that we call light
filtering and co-reference normalization. Light filtering removes sentences
from the document, which are judged peripheral to its main content.
Co-reference normalization unifies several written forms of the same named
entity into a unique form. We also needed a ""Gold Standard"" - a set of labeled
documents for training and evaluation. While the subjective nature of key
phrase selection precludes a true ""Gold Standard"", we used Amazon's Mechanical
Turk service to obtain a useful approximation. Our data indicates that the
biggest improvements in performance were due to shallow semantic features, news
categories, and rhetorical signals (nDCG 78.47% vs. 68.93%). The inclusion of
deeper semantic features such as Freebase sub-categories was not beneficial by
itself, but in combination with pre-processing, did cause slight improvements
in the nDCG scores.
","[{'version': 'v1', 'created': 'Thu, 20 Jun 2013 14:22:00 GMT'}]",2013-06-21,"[['Marujo', 'Luis', ''], ['Gershman', 'Anatole', ''], ['Carbonell', 'Jaime', ''], ['Frederking', 'Robert', ''], ['Neto', 'João P.', '']]","['Automatic Key Phrase Extraction', 'Semantic Features', 'Pre-Processing']"
19308,1207.4600,Ghada Elkabbany ghada elkabbany,Ghada F. ElKabbany and Heba K. Aslan,"Efficient Design for the Implementation of Wong-Lam Multicast
  Authentication Protocol Using Two-Levels of Parallelism","International Journal of Computer Science Issues (IJCSI), Volume 9,
  Issue 3, No. 1, May 2012",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Group communication can benefit from Internet Protocol (IP) multicast
protocol to achieve efficient exchange of messages. However, IP multicast does
not provide any mechanisms for authentication. In literature, many solutions to
solve this problem were presented. It has been shown that Wong and Lam protocol
is the only protocol that can resist both packet loss and pollution attacks. In
contrast, it has high computation and communication overheads. In the present
paper, an efficient design for the implementation of Wong and Lam multicast
authentication protocol is proposed. In order to solve the computation overhead
problem, we use two-levels of parallelism. To reduce the communication
overhead, we use Universal Message Authentication Codes (UMAC) instead of hash
functions. The design is analyzed for both NTRU and elliptic curve cryptography
signature algorithms. The analysis shows that the proposed design decreases
significantly the execution time of Wong-Lam protocol which makes it suitable
for real-time applications.
","[{'version': 'v1', 'created': 'Thu, 19 Jul 2012 10:06:28 GMT'}]",2012-07-20,"[['ElKabbany', 'Ghada F.', ''], ['Aslan', 'Heba K.', '']]","['Group Communication', 'Multicast Authentication', 'Parallel Processing', 'Clustering', 'Message Passing Systems']"
19309,1403.6602,Sebastian Wild,"Markus E. Nebel, Sebastian Wild",Pivot Sampling in Dual-Pivot Quicksort,presented at AofA 2014 (http://www.aofa14.upmc.fr/),,,,cs.DS math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The new dual-pivot Quicksort by Vladimir Yaroslavskiy - used in Oracle's Java
runtime library since version 7 - features intriguing asymmetries in its
behavior. They were shown to cause a basic variant of this algorithm to use
less comparisons than classic single-pivot Quicksort implementations. In this
paper, we extend the analysis to the case where the two pivots are chosen as
fixed order statistics of a random sample and give the precise leading term of
the average number of comparisons, swaps and executed Java Bytecode
instructions. It turns out that - unlike for classic Quicksort, where it is
optimal to choose the pivot as median of the sample - the asymmetries in
Yaroslavskiy's algorithm render pivots with a systematic skew more efficient
than the symmetric choice. Moreover, the optimal skew heavily depends on the
employed cost measure; most strikingly, abstract costs like the number of swaps
and comparisons yield a very different result than counting Java Bytecode
instructions, which can be assumed most closely related to actual running time.
","[{'version': 'v1', 'created': 'Wed, 26 Mar 2014 09:37:30 GMT'}, {'version': 'v2', 'created': 'Fri, 13 Jun 2014 08:44:20 GMT'}]",2014-06-16,"[['Nebel', 'Markus E.', ''], ['Wild', 'Sebastian', '']]","['Quicksort', 'dual-pivot', 'Yaroslavskiy’s partitioning method', 'median of three', 'average case analysis']"
19310,1609.03432,Christian Sternagel,Christian Sternagel,The Generalized Subterm Criterion in TTT2,"In Proceedings of 15th International Workshop on Termination (WST
  2016)",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an SMT encoding of a generalized version of the subterm criterion
and evaluate its implementation in TTT2.
","[{'version': 'v1', 'created': 'Mon, 12 Sep 2016 15:02:27 GMT'}]",2016-09-13,"[['Sternagel', 'Christian', '']]","['termination', 'subterm criterion', 'SMT encodings']"
19311,1710.05429,Amir Yazdavar,"Amir Hossein Yazdavar, Hussein S. Al-Olimat, Monireh Ebrahimi,
  Goonmeet Bajaj, Tanvi Banerjee, Krishnaprasad Thirunarayan, Jyotishman
  Pathak, Amit Sheth","Semi-Supervised Approach to Monitoring Clinical Depressive Symptoms in
  Social Media","8 pages, Advances in Social Networks Analysis and Mining (ASONAM),
  2017 IEEE/ACM International Conference",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rise of social media, millions of people are routinely expressing
their moods, feelings, and daily struggles with mental health issues on social
media platforms like Twitter. Unlike traditional observational cohort studies
conducted through questionnaires and self-reported surveys, we explore the
reliable detection of clinical depression from tweets obtained unobtrusively.
Based on the analysis of tweets crawled from users with self-reported
depressive symptoms in their Twitter profiles, we demonstrate the potential for
detecting clinical depression symptoms which emulate the PHQ-9 questionnaire
clinicians use today. Our study uses a semi-supervised statistical model to
evaluate how the duration of these symptoms and their expression on Twitter (in
terms of word usage patterns and topical preferences) align with the medical
findings reported via the PHQ-9. Our proactive and automatic screening tool is
able to identify clinical depressive symptoms with an accuracy of 68% and
precision of 72%.
","[{'version': 'v1', 'created': 'Mon, 16 Oct 2017 00:52:32 GMT'}]",2017-10-17,"[['Yazdavar', 'Amir Hossein', ''], ['Al-Olimat', 'Hussein S.', ''], ['Ebrahimi', 'Monireh', ''], ['Bajaj', 'Goonmeet', ''], ['Banerjee', 'Tanvi', ''], ['Thirunarayan', 'Krishnaprasad', ''], ['Pathak', 'Jyotishman', ''], ['Sheth', 'Amit', '']]","['Semi-supervised Machine Learning', 'Natural Language Processing', 'Social Media', 'Mental Health']"
19312,1605.00817,Peter Thiemann,Peter Thiemann,Derivatives for Enhanced Regular Expressions,To appear in CIAA 2016,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Regular languages are closed under a wealth of formal language operators.
Incorporating such operators in regular expressions leads to concise language
specifications, but the transformation of such enhanced regular expressions to
finite automata becomes more involved.
  We present an approach that enables the direct construction of finite
automata from regular expressions enhanced with further operators that preserve
regularity. Our construction is based on an extension of the theory of
derivatives for regular expressions. To retain the standard results about
derivatives, we develop a derivability criterion for the compatibility of the
extra operators with derivatives.
  Some derivable operators do not preserve regularity. Derivatives provide a
decision procedure for the word problem of regular expressions enhanced with
such operators.
","[{'version': 'v1', 'created': 'Tue, 3 May 2016 09:50:24 GMT'}]",2016-05-04,"[['Thiemann', 'Peter', '']]","['automata and logic', 'regular languages', 'derivatives']"
19313,1010.3862,Addepalli Krishna v.n,"A.V.N.Krishna (Indur Institute of Engg. & Tech., India), A.Vinaya Babu
  (J.N.T.U.H, Hyderabad)","A New Non Linear, Time Stamped & Feed Back Model Based Encryption
  Mechanism with Acknowledgement Support",6 pages,"IJoAT Vol 1, No 2 (October 2010)",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work a model is going to be used which develops data distributed over
a identified value which is used as nonce (IV). The model considers an
equilibrium equation which is a function of non linear relationships, time
variant and nonce variant values and takes the feed back of earlier round as
input to the present round. The process is repeated for different timings which
are used as time stamps in the encryption mechanism. Thus this model generates
a distributed sequence which is used as sub key. This model supports very
important parameters in symmetric data encryption schemes like non linear
relationships between different values used in the model, variable key length,
timeliness of encryption mechanism and also acknowledgement between the
participating parties. It also supports feed back mode which provides necessary
strength against crypto analysis.
","[{'version': 'v1', 'created': 'Tue, 19 Oct 2010 11:33:09 GMT'}]",2010-10-20,"[['Krishna', 'A. V. N.', '', 'Indur Institute of Engg. & Tech., India'], ['Babu', 'A. Vinaya', '', 'J.N.T.U.H, Hyderabad']]","['Equilibrium equation', 'non linearity', 'Feed back mode', 'Encryption Decryption Mechanism', 'Key & Sub key generation', 'Time stamp and Nonce']"
19314,1605.01220,Maciej Drwal,Maciej Drwal,"Optimal Design of Robust Combinatorial Mechanisms for Substitutable
  Goods",,,,,cs.GT cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider multidimensional mechanism design problem for
selling discrete substitutable items to a group of buyers. Previous work on
this problem mostly focus on stochastic description of valuations used by the
seller. However, in certain applications, no prior information regarding
buyers' preferences is known. To address this issue, we consider uncertain
valuations and formulate the problem in a robust optimization framework: the
objective is to minimize the maximum regret. For a special case of
revenue-maximizing pricing problem we present a solution method based on
mixed-integer linear programming formulation.
","[{'version': 'v1', 'created': 'Wed, 4 May 2016 10:56:59 GMT'}, {'version': 'v2', 'created': 'Wed, 18 May 2016 15:03:14 GMT'}, {'version': 'v3', 'created': 'Wed, 14 Dec 2016 17:41:05 GMT'}, {'version': 'v4', 'created': 'Wed, 4 Jan 2017 16:25:28 GMT'}]",2017-01-05,"[['Drwal', 'Maciej', '']]","['algorithmic game theory', 'min-max regret', 'pricing', 'mathematicaleconomics']"
19315,1710.04333,Henning Koehler,Henning Koehler,"Modular decomposition of transitive graphs and transitively orienting
  their complements","12 pages, submitted to Discrete Mathematics and Theoretical Computer
  Science",,,,cs.DM math.CO,http://creativecommons.org/licenses/by/4.0/,"  The modular decomposition of a graph is a canonical representation of its
modules. Algorithms for computing the modular decomposition of directed and
undirected graphs differ significantly, with the undirected case being simpler,
and algorithms for directed graphs often work by reducing the problem to
decomposing undirected graphs. In this paper we show that transitive acyclic
digraphs have the same strong modules as their undirected versions. This
simplifies reduction for transitive digraphs, requiring only the computation of
strongly connected components. Furthermore, we are interested in permutation
graphs, where both the graph and its complement are transitively orientable.
Such graphs may be represented indirectly, as the transitive closure of a given
graph. For non-transitive graphs we present a linear-time algorithm which
allows us to identify prime-free modules w.r.t their transitive closure, which
speeds up both modular decomposition and transitive orientation for sparse
graphs. Finally, we show that any transitive orientation of a digraph's
complement also transitively orients the complement of the digraph's transitive
closure, allowing us to find such orientations in (near-)linear time.
","[{'version': 'v1', 'created': 'Thu, 12 Oct 2017 00:29:41 GMT'}]",2017-10-13,"[['Koehler', 'Henning', '']]","['modular decomposition', 'transitive orientation', 'permutation graph']"
19316,1301.4552,Ahmed Rhif,"Ahmed Rhif, Zohra Kardous, Naceur BenHadj Braiek","Sliding Mode Control for Torque Evolution of a Double Feed Asynchronous
  Generator","This paper has been withdrawn by the author because it may be
  reviewed",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a robust control of doublefed induction generator of wind
turbine to optimize its production: that means the energy quality and
efficiency. The proposed control reposes in the sliding mode control using a
multimodel approach which contributes on the minimization of the static error
and the chattering phenomenon. This new approach is called sliding mode
multimodel control (SMMC). Simulation results show good performances of this
control.
","[{'version': 'v1', 'created': 'Sat, 19 Jan 2013 09:56:10 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Feb 2013 15:16:31 GMT'}, {'version': 'v3', 'created': 'Tue, 2 Apr 2013 23:23:15 GMT'}, {'version': 'v4', 'created': 'Sun, 3 Jan 2016 08:47:33 GMT'}]",2016-01-05,"[['Rhif', 'Ahmed', ''], ['Kardous', 'Zohra', ''], ['Braiek', 'Naceur BenHadj', '']]","['Sliding mode control', 'Multimodel approach', 'Chattering phenomenon', 'Stabilization.   1']"
19317,1309.7912,Ricardo Fabbri,"Mauro de Amorim, Ricardo Fabbri, Lucia Maria dos Santos Pinto and
  Francisco Duarte Moura Neto",An Image-Based Fluid Surface Pattern Model,"a reduced version in Portuguese appears in proceedings of the XVI EMC
  - Computational Modeling Meeting (Encontro de Modelagem Computacional), 2013",,,,cs.CV,http://creativecommons.org/licenses/by/3.0/,"  This work aims at generating a model of the ocean surface and its dynamics
from one or more video cameras. The idea is to model wave patterns from video
as a first step towards a larger system of photogrammetric monitoring of marine
conditions for use in offshore oil drilling platforms. The first part of the
proposed approach consists in reducing the dimensionality of sensor data made
up of the many pixels of each frame of the input video streams. This enables
finding a concise number of most relevant parameters to model the temporal
dataset, yielding an efficient data-driven model of the evolution of the
observed surface. The second part proposes stochastic modeling to better
capture the patterns embedded in the data. One can then draw samples from the
final model, which are expected to simulate the behavior of previously observed
flow, in order to determine conditions that match new observations. In this
paper we focus on proposing and discussing the overall approach and on
comparing two different techniques for dimensionality reduction in the first
stage: principal component analysis and diffusion maps. Work is underway on the
second stage of constructing better stochastic models of fluid surface dynamics
as proposed here.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2013 16:39:21 GMT'}]",2013-10-01,"[['de Amorim', 'Mauro', ''], ['Fabbri', 'Ricardo', ''], ['Pinto', 'Lucia Maria dos Santos', ''], ['Neto', 'Francisco Duarte Moura', '']]","['Inverse problems', 'fluid motion', 'nonrigid 3D reconstruction', 'dimensionality reduction', 'diffusion maps', 'pattern theory']"
19318,1106.6342,Sebastian Deorowicz,Sebastian Deorowicz,Quadratic-time Algorithm for the String Constrained LCS Problem,6 pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of finding a longest common subsequence of two main sequences
with some constraint that must be a substring of the result (STR-IC-LCS) was
formulated recently. It is a variant of the constrained longest common
subsequence problem. As the known algorithms for the STR-IC-LCS problem are
cubic-time, the presented quadratic-time algorithm is significantly faster.
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2011 19:04:18 GMT'}]",2011-07-01,"[['Deorowicz', 'Sebastian', '']]","['sequence similarity', 'longest common subsequence', 'constrained longest common subsequence']"
19319,1702.01424,Dirk Oliver Theis,"Kaveh Khoshkhah, Dirk Oliver Theis","On the Combinatorial Lower Bound for the Extension Complexity of the
  Spanning Tree Polytope",9p,,,,cs.DM math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the study of extensions of polytopes of combinatorial optimization
problems, a notorious open question is that for the size of the smallest
extended formulation of the Minimum Spanning Tree problem on a complete graph
with $n$ nodes. The best known lower bound is the trival (dimension) bound,
$\Omega(n^2)$, the best known upper bound is the extended formulation by Wong
(1980) of size $O(n^3)$ (also Martin, 1991).
  In this note we give a nondeterministic communication protocol with cost
$\log_2(n^2\log n)+O(1)$ for the support of the spanning tree slack matrix.
  This means that the combinatorial lower bounds can improve the trivial lower
bound only by a factor of (at most) $O(\log n)$.
","[{'version': 'v1', 'created': 'Sun, 5 Feb 2017 16:22:19 GMT'}]",2017-02-07,"[['Khoshkhah', 'Kaveh', ''], ['Theis', 'Dirk Oliver', '']]","['Polyhedral Combinatorial Optimization', 'Extension Complexity', 'Communication Complexity; Spanning Tree polytope']"
19320,1306.6397,Ankit Mundra,"Ankit Mundra, Nitin Rakesh, Vipin Tyagi",Query Centric CPS (QCPS) Approach for Multiple Heterogeneous Systems,"5 pages, 5 Figures. In International Journal of Computer Science And
  Technology 2013",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In modern scenario we need to have mechanisms which can provide better
interaction with physical world by an efficient and more effective
communication and computation approach for multiple heterogeneous sensor
networks. Previous work provides efficient communication approach between
sensor nodes and a query centric approach for multiple collaborative
heterogeneous sensor networks. Even there is energy issues involved in wireless
sensor network operation. In this paper we have proposed Query centric Cyber
Physical System (QCPS)model to implement query centric user request using Cyber
Physical System (CPS). CPS takes both communication and computation in parallel
to provide better interaction with physical world. This feature of CPS reduces
system cost and makes it more energy efficient. This paper provides an
efficient query processing approach for multiple heterogeneous sensor networks
using cyber physical system.This approach results in reduction of communication
and computation cost as sensor network communicates using centroid of
respective grids which reduces cost of communication while involvement of CPS
reduces the computation cost.
","[{'version': 'v1', 'created': 'Thu, 27 Jun 2013 03:13:09 GMT'}]",2013-06-28,"[['Mundra', 'Ankit', ''], ['Rakesh', 'Nitin', ''], ['Tyagi', 'Vipin', '']]","['Cyber Physical System', 'Query Centric Approach', 'Sensor Network', 'Cloud Computing', 'Cloud Database']"
19321,1510.04249,Mikayel Samvelyan,"Svetlana Avetisyan, Mikayel Samvelyan, Martun Karapetyan","Random Irregular Block-hierarchical Networks: Algorithms for Computation
  of Main Properties",The original is in Russian,"Proceedings of the IX Annual Scientific Conference in
  Russian-Armenian University (2015) 48-60",,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the class of random irregular block-hierarchical networks is
defined and algorithms for generation and calculation of network properties are
described. The algorithms presented for this class of networks are more
efficient than known algorithms both in computation time and memory usage and
can be used to analyze topological properties of such networks. The algorithms
are implemented in the system created by the authors for the study of
topological and statistical properties of random networks.
","[{'version': 'v1', 'created': 'Wed, 14 Oct 2015 19:35:53 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Dec 2015 17:55:12 GMT'}, {'version': 'v3', 'created': 'Sat, 9 Jan 2016 18:30:44 GMT'}, {'version': 'v4', 'created': 'Wed, 3 Aug 2016 15:46:41 GMT'}, {'version': 'v5', 'created': 'Thu, 15 Dec 2016 12:41:28 GMT'}, {'version': 'v6', 'created': 'Thu, 3 May 2018 14:52:11 GMT'}]",2018-05-04,"[['Avetisyan', 'Svetlana', ''], ['Samvelyan', 'Mikayel', ''], ['Karapetyan', 'Martun', '']]","['random networks', 'statistical properties', 'algorithms']"
19322,1704.03664,Francesco Quinzan,Ankit Chauhan and Tobias Friedrich and Francesco Quinzan,Approximating Optimization Problems using EAs on Scale-Free Networks,,,,,cs.DS cs.NE cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It has been observed that many complex real-world networks have certain
properties, such as a high clustering coefficient, a low diameter, and a
power-law degree distribution. A network with a power-law degree distribution
is known as scale-free network. In order to study these networks, various
random graph models have been proposed, e.g. Preferential Attachment, Chung-Lu,
or Hyperbolic.
  We look at the interplay between the power-law degree distribution and the
run time of optimization techniques for well known combinatorial problems. We
observe that on scale-free networks, simple evolutionary algorithms (EAs)
quickly reach a constant-factor approximation ratio on common covering problems
  We prove that the single-objective (1+1)EA reaches a constant-factor
approximation ratio on the Minimum Dominating Set problem, the Minimum Vertex
Cover problem, the Minimum Connected Dominating Set problem, and the Maximum
Independent Set problem in expected polynomial number of calls to the fitness
function.
  Furthermore, we prove that the multi-objective GSEMO algorithm reaches a
better approximation ratio than the (1+1)EA on those problems, within
polynomial fitness evaluations.
","[{'version': 'v1', 'created': 'Wed, 12 Apr 2017 09:06:06 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Jun 2017 14:08:52 GMT'}, {'version': 'v3', 'created': 'Mon, 26 Nov 2018 13:15:28 GMT'}]",2018-11-27,"[['Chauhan', 'Ankit', ''], ['Friedrich', 'Tobias', ''], ['Quinzan', 'Francesco', '']]","['Evolutionary algorithms', 'covering problems', 'power-law bounded networks']"
19323,0805.0888,EDA Publishing Association,"M. Shamshirsaz, M. Maroufi, M.B. Asgari","Geometrical Variation Analysis of an Electrothermally Driven Polysilicon
  Microactuator","Submitted on behalf of EDA Publishing Association
  (http://irevues.inist.fr/handle/2042/16838)","Dans Symposium on Design, Test, Integration and Packaging of
  MEMS/MOEMS - DTIP 2008, Nice : France (2008)",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The analytical models that predict thermal and mechanical responses of
microactuator have been developed. These models are based on electro thermal
and thermo mechanical analysis of the microbeam. Also, Finite Element Analysis
(FEA) is used to evaluate microactuator tip deflection. Analytical and Finite
Element results are compared with experimental results in literature and show
good agreement in low input voltages. A dimensional variation of beam lengths,
beam lengths ratios and gap are introduced in analytical and FEA models to
explore microactuator performance. An electrothermally driven polysilicon
microactuator similar to Pan's actuator architecture has been studied in this
paper. This microactuator generates deflection through asymmetric heating of
the hot and cold polysilicon arms with different lengths. For this
microactuator architecture, an optimal beam length ratio equal to 0.46 has been
obtained to achieve maximum tip deflection. . As it was expected, the results
show decreasing air gap increase microactuator tip deflection. It is also found
that for microactuators with longer hot arms, microactuator tip deflections are
more sensitive to beam length ratios and air gap.
","[{'version': 'v1', 'created': 'Wed, 7 May 2008 09:12:18 GMT'}]",2008-12-18,"[['Shamshirsaz', 'M.', ''], ['Maroufi', 'M.', ''], ['Asgari', 'M. B.', '']]","['(Electrothermal microactuator', 'Analytical model', 'Geometrical variations', 'Finite element model)']"
19324,1401.3675,Timo Mennle,Timo Mennle and Sven Seuken,"Partial Strategyproofness: Relaxing Strategyproofness for the Random
  Assignment Problem",Working Paper,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present partial strategyproofness, a new, relaxed notion of
strategyproofness for studying the incentive properties of non-strategyproof
assignment mechanisms. Informally, a mechanism is partially strategyproof if it
makes truthful reporting a dominant strategy for those agents whose preference
intensities differ sufficiently between any two objects. We demonstrate that
partial strategyproofness is axiomatically motivated and yields a parametric
measure for ""how strategyproof"" an assignment mechanism is. We apply this new
concept to derive novel insights about the incentive properties of the
probabilistic serial mechanism and different variants of the Boston mechanism.
","[{'version': 'v1', 'created': 'Wed, 15 Jan 2014 17:08:44 GMT'}, {'version': 'v2', 'created': 'Thu, 13 Feb 2014 17:41:13 GMT'}, {'version': 'v3', 'created': 'Tue, 27 May 2014 17:30:08 GMT'}, {'version': 'v4', 'created': 'Tue, 10 Jan 2017 17:11:06 GMT'}, {'version': 'v5', 'created': 'Mon, 10 Jul 2017 16:23:37 GMT'}, {'version': 'v6', 'created': 'Sun, 2 Aug 2020 11:41:42 GMT'}]",2020-08-04,"[['Mennle', 'Timo', ''], ['Seuken', 'Sven', '']]","['Mechanism Design', 'Ordinal Mechanisms', 'Random Assignment', 'Matching', 'Strategyproofness', 'Stochastic Dominance', 'Probabilistic Serial', 'Boston Mechanism']"
19325,1210.0074,Aiping  Huang,"Aiping Huang, William Zhu","Topological characterizations to three types of covering approximation
  operators",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Covering-based rough set theory is a useful tool to deal with inexact,
uncertain or vague knowledge in information systems. Topology, one of the most
important subjects in mathematics, provides mathematical tools and interesting
topics in studying information systems and rough sets. In this paper, we
present the topological characterizations to three types of covering
approximation operators. First, we study the properties of topology induced by
the sixth type of covering lower approximation operator. Second, some
topological characterizations to the covering lower approximation operator to
be an interior operator are established. We find that the topologies induced by
this operator and by the sixth type of covering lower approximation operator
are the same. Third, we study the conditions which make the first type of
covering upper approximation operator be a closure operator, and find that the
topology induced by the operator is the same as the topology induced by the
fifth type of covering upper approximation operator. Forth, the conditions of
the second type of covering upper approximation operator to be a closure
operator and the properties of topology induced by it are established. Finally,
these three topologies space are compared. In a word, topology provides a
useful method to study the covering-based rough sets.
","[{'version': 'v1', 'created': 'Sat, 29 Sep 2012 03:16:49 GMT'}]",2012-10-02,"[['Huang', 'Aiping', ''], ['Zhu', 'William', '']]","['Rough sets', 'Covering', 'Topology', 'Approximation operators', 'Closureoperator']"
19326,2006.04387,Laura Giordano,Laura Giordano and Daniele Theseider Dupr\'e,"An ASP approach for reasoning in a concept-aware multipreferential
  lightweight DL","Paper presented at the 36th International Conference on Logic
  Programming (ICLP 2020), University Of Calabria, Rende (CS), Italy, September
  2020",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we develop a concept aware multi-preferential semantics for
dealing with typicality in description logics, where preferences are associated
with concepts, starting from a collection of ranked TBoxes containing
defeasible concept inclusions. Preferences are combined to define a
preferential interpretation in which defeasible inclusions can be evaluated.
The construction of the concept-aware multipreference semantics is related to
Brewka's framework for qualitative preferences. We exploit Answer Set
Programming (in particular, asprin) to achieve defeasible reasoning under the
multipreference approach for the lightweight description logic EL+bot.
  The paper is under consideration for acceptance in TPLP.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2020 07:15:38 GMT'}, {'version': 'v2', 'created': 'Sat, 8 Aug 2020 07:53:44 GMT'}]",2020-08-11,"[['Giordano', 'Laura', ''], ['Dupré', 'Daniele Theseider', '']]","['Nonmonotonic Reasoning', 'Description Logics', 'Preferences', 'ASP']"
19327,1209.3916,Tom Kelsey,"Thomas W. Kelsey, Lars Kotthoff, Christoffer A. Jefferson, Stephen A.
  Linton, Ian Miguel, Peter Nightingale, Ian P. Gent","Qualitative Modelling via Constraint Programming: Past, Present and
  Future",15 pages plus references,,,,cs.CE cs.AI math.DS q-bio.CB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Qualitative modelling is a technique integrating the fields of theoretical
computer science, artificial intelligence and the physical and biological
sciences. The aim is to be able to model the behaviour of systems without
estimating parameter values and fixing the exact quantitative dynamics.
Traditional applications are the study of the dynamics of physical and
biological systems at a higher level of abstraction than that obtained by
estimation of numerical parameter values for a fixed quantitative model.
Qualitative modelling has been studied and implemented to varying degrees of
sophistication in Petri nets, process calculi and constraint programming. In
this paper we reflect on the strengths and weaknesses of existing frameworks,
we demonstrate how recent advances in constraint programming can be leveraged
to produce high quality qualitative models, and we describe the advances in
theory and technology that would be needed to make constraint programming the
best option for scientific investigation in the broadest sense.
","[{'version': 'v1', 'created': 'Tue, 18 Sep 2012 11:57:44 GMT'}]",2012-09-19,"[['Kelsey', 'Thomas W.', ''], ['Kotthoff', 'Lars', ''], ['Jefferson', 'Christoffer A.', ''], ['Linton', 'Stephen A.', ''], ['Miguel', 'Ian', ''], ['Nightingale', 'Peter', ''], ['Gent', 'Ian P.', '']]","['Constraint Programming', 'Qualitative Models', 'Compartmental Models', 'Dynamical Systems']"
19328,1403.0192,Guan Gui Dr.,"Guan Gui, Li Xu, Lin Shan, and Fumiyuki Adachi","Compressive sensing based Bayesian sparse channel estimation for OFDM
  communication systems: high performance and low complexity","24 pages,16 figures, submitted for a journal",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In orthogonal frequency division modulation (OFDM) communication systems,
channel state information (CSI) is required at receiver due to the fact that
frequency-selective fading channel leads to disgusting inter-symbol
interference (ISI) over data transmission. Broadband channel model is often
described by very few dominant channel taps and they can be probed by
compressive sensing based sparse channel estimation (SCE) methods, e.g.,
orthogonal matching pursuit algorithm, which can take the advantage of sparse
structure effectively in the channel as for prior information. However, these
developed methods are vulnerable to both noise interference and column
coherence of training signal matrix. In other words, the primary objective of
these conventional methods is to catch the dominant channel taps without a
report of posterior channel uncertainty. To improve the estimation performance,
we proposed a compressive sensing based Bayesian sparse channel estimation
(BSCE) method which can not only exploit the channel sparsity but also mitigate
the unexpected channel uncertainty without scarifying any computational
complexity. The propose method can reveal potential ambiguity among multiple
channel estimators that are ambiguous due to observation noise or correlation
interference among columns in the training matrix. Computer simulations show
that propose method can improve the estimation performance when comparing with
conventional SCE methods.
","[{'version': 'v1', 'created': 'Sun, 2 Mar 2014 11:01:30 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Apr 2015 03:03:59 GMT'}]",2015-04-22,"[['Gui', 'Guan', ''], ['Xu', 'Li', ''], ['Shan', 'Lin', ''], ['Adachi', 'Fumiyuki', '']]","['Bayesian sparse channel estimation', 'compressive sensing', 'minimum mean square error']"
19329,1403.7698,Ramani Duraiswami,Nail A. Gumerov and Ramani Duraiswami,"Recursive computation of spherical harmonic rotation coefficients of
  large degree",,,,"University of Maryland Institute for Advanced Computer Studies,
  UMIACS-TR-2014-4; Department of Computer Science CS-TR-5037",cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computation of the spherical harmonic rotation coefficients or elements of
Wigner's d-matrix is important in a number of quantum mechanics and
mathematical physics applications. Particularly, this is important for the Fast
Multipole Methods in three dimensions for the Helmholtz, Laplace and related
equations, if rotation-based decomposition of translation operators are used.
In these and related problems related to representation of functions on a
sphere via spherical harmonic expansions computation of the rotation
coefficients of large degree $n$ (of the order of thousands and more) may be
necessary. Existing algorithms for their computation, based on recursions, are
usually unstable, and do not extend to $n$. We develop a new recursion and
study its behavior for large degrees, via computational and asymptotic
analyses. Stability of this recursion was studied based on a novel application
of the Courant-Friedrichs-Lewy condition and the von Neumann method for
stability of finite-difference schemes for solution of PDEs. A recursive
algorithm of minimal complexity $O\left(n^{2}\right)$ for degree $n$ and
FFT-based algorithms of complexity $O\left(n^{2}\log n\right) $ suitable for
computation of rotation coefficients of large degrees are proposed, studied
numerically, and cross-validated. It is shown that the latter algorithm can be
used for $n\lesssim 10^{3}$ in double precision, while the former algorithm was
tested for large $n$ (up to $10^{4}$ in our experiments) and demonstrated
better performance and accuracy compared to the FFT-based algorithm.
","[{'version': 'v1', 'created': 'Sun, 30 Mar 2014 04:13:46 GMT'}]",2014-04-01,"[['Gumerov', 'Nail A.', ''], ['Duraiswami', 'Ramani', '']]","['SO(3)', 'spherical harmonics', 'recursions', 'Wigner d-matrix', 'rotation']"
19330,1005.2267,Guan Gui Mr,"Guan Gui, Wei Peng, Qun Wan, and Fumiyuki Adachi","A Fast Compressive Channel Estimation with Modified Smoothed L0
  Algorithm","4 pages, 4 figures, ICCACS2010",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Broadband wireless channel is a time dispersive and becomes strongly
frequency selective. In most cases, the channel is composed of a few dominant
coefficients and a large part of coefficients is approximately zero or zero. To
exploit the sparsity of multi-path channel (MPC), there are various methods
have been proposed. They are, namely, greedy algorithms, iterative algorithms,
and convex program. The former two algorithms are easy to be implemented but
not stable; on the other hand, the last method is stable but difficult to be
implemented as practical channel estimation problems because of computational
complexity. In this paper, we proposed a novel channel estimation strategy by
using modified smoothed (MSL0) algorithm which combines stable and low
complexity. Computer simulations confirm the effectiveness of the introduced
algorithm comparisons with the existing methods. We also give
","[{'version': 'v1', 'created': 'Thu, 13 May 2010 08:18:26 GMT'}]",2010-05-14,"[['Gui', 'Guan', ''], ['Peng', 'Wei', ''], ['Wan', 'Qun', ''], ['Adachi', 'Fumiyuki', '']]","['Smooth L0 Algorithm', 'Phase Transition', 'Sparse Channel Estimation', 'Compressive Sensing']"
19331,0710.2227,M Sabu THAMPI,"Sabu M. Thampi, K. Chandra Sekaran","A System for Predicting Subcellular Localization of Yeast Genome Using
  Neural Network",,,,,cs.NE cs.AI,,"  The subcellular location of a protein can provide valuable information about
its function. With the rapid increase of sequenced genomic data, the need for
an automated and accurate tool to predict subcellular localization becomes
increasingly important. Many efforts have been made to predict protein
subcellular localization. This paper aims to merge the artificial neural
networks and bioinformatics to predict the location of protein in yeast genome.
We introduce a new subcellular prediction method based on a backpropagation
neural network. The results show that the prediction within an error limit of 5
to 10 percentage can be achieved with the system.
","[{'version': 'v1', 'created': 'Thu, 11 Oct 2007 12:09:33 GMT'}]",2007-10-12,"[['Thampi', 'Sabu M.', ''], ['Sekaran', 'K. Chandra', '']]","['Neural \xa0 networks', 'Backpropagation', 'Protein', 'SubcellularLocalization']"
19332,1010.4533,Puri Arenas,"Elvira Albert, Puri Arenas, Germ\'an Puebla, Manuel Hermenegildo",Certificate size reduction in Abstraction-Carrying Code,"35 pages, 1 figure, 2 tables",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Carrying Code (ACC) has recently been proposed as a framework for mobile code
safety in which the code supplier provides a program together with an
abstraction (or abstract model of the program) whose validity entails
compliance with a predefined safety policy. The advantage of providing a
(fixpoint) abstraction to the code consumer is that its validity is checked in
a single pass (i.e., one iteration) of an abstract interpretation-based
checker. A main challenge to make ACC useful in practice is to reduce the size
of certificates as much as possible while at the same time not increasing
checking time. The intuitive idea is to only include in the certificate
information that the checker is unable to reproduce without iterating. We
introduce the notion of reduced certificate which characterizes the subset of
the abstraction which a checker needs in order to validate (and re-construct)
the full certificate in a single pass. Based on this notion, we instrument a
generic analysis algorithm with the necessary extensions in order to identify
the information relevant to the checker. Interestingly, the fact that the
reduced certificate omits (parts of) the abstraction has implications in the
design of the checker. We provide the sufficient conditions which allow us to
ensure that 1) if the checker succeeds in validating the certificate, then the
certificate is valid for the program (correctness) and 2) the checker will
succeed for any reduced certificate which is valid (completeness). Our approach
has been implemented and benchmarked within the ciaopp system. The experimental
results show that our proposal is able to greatly reduce the size of
certificates in practice.To appear in Theory and Practice of Logic Programming
(TPLP).
","[{'version': 'v1', 'created': 'Wed, 13 Oct 2010 10:46:13 GMT'}]",2010-10-22,"[['Albert', 'Elvira', ''], ['Arenas', 'Puri', ''], ['Puebla', 'Germán', ''], ['Hermenegildo', 'Manuel', '']]","['Proof-Carrying Code', 'Abstraction-Carrying Code', 'Static Analysis', 'Reduced Certificates']"
19333,1412.6482,Anastasios Tsourtis,"Anastasios Tsourtis, Yannis Pantazis, Markos A. Katsoulakis, Vagelis
  Harmandaris","Parametric Sensitivity Analysis for Stochastic Molecular Systems using
  Information Theoretic Metrics","18 pages, Relative Entropy, Sensitivity Analysis, Fisher Information
  Matrix, Langevin dynamics, Methane Molecular Dynamics",,,,cs.IT math.IT physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we extend the parametric sensitivity analysis (SA) methodology
proposed in Ref. [Y. Pantazis and M. A. Katsoulakis, J. Chem. Phys. 138, 054115
(2013)] to continuous time and continuous space Markov processes represented by
stochastic differential equations and, particularly, stochastic molecular
dynamics as described by the Langevin equation. The utilized SA method is based
on the computation of the information-theoretic (and thermodynamic) quantity of
relative entropy rate (RER) and the associated Fisher information matrix (FIM)
between path distributions. A major advantage of the pathwise SA method is that
both RER and pathwise FIM depend only on averages of the force field therefore
they are tractable and computable as ergodic averages from a single run of the
molecular dynamics simulation both in equilibrium and in non-equilibrium steady
state regimes. We validate the performance of the extended SA method to two
different molecular stochastic systems, a standard Lennard-Jones fluid and an
all-atom methane liquid and compare the obtained parameter sensitivities with
parameter sensitivities on three popular and well-studied observable functions,
namely, the radial distribution function, the mean squared displacement and the
pressure. Results show that the RER-based sensitivities are highly correlated
with the observable-based sensitivities.
","[{'version': 'v1', 'created': 'Fri, 19 Dec 2014 18:49:00 GMT'}]",2014-12-22,"[['Tsourtis', 'Anastasios', ''], ['Pantazis', 'Yannis', ''], ['Katsoulakis', 'Markos A.', ''], ['Harmandaris', 'Vagelis', '']]","['Relative Entropy', 'Sensitivity Analysis', 'Fisher Information Matrix', 'Langevin dynamics', 'MethaneMolecular Dynamics']"
19334,1209.6476,Reena Philips Mrs,"K. S. Rashmi, V. Suma, M. Vaidehi",Factors Influencing Job Rejections in Cloud Environment,"6 Pages, 5 Figures, 8 Tables",,,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The IT organizations invests heavy capital by consuming large scale
infrastructure and advanced operating platforms. The advances in technology has
resulted in emergence of cloud computing, which is promising technology to
achieve the aforementioned objective. At the peak hours, the jobs arriving to
the cloud system are normally high demanding efficient execution and dispatch.
An observation that has been carried out in this paper by capturing a job
arriving pattern from a monitoring system explains that most of the jobs get
rejected because of lack of efficient technology. The job rejections can be
controlled by certain factors such as job scheduling and load balancing.
Therefore, in this paper the efficiency of Round Robin (RR) scheduling strategy
used for job scheduling and Shortest Job First Scheduling (SJFS) technique used
for load balancing in reducing the job rejections are analyzed. Further, a
proposal for an effective load balancing approach to avoid deadlocks has been
discussed.
","[{'version': 'v1', 'created': 'Fri, 28 Sep 2012 10:39:04 GMT'}]",2012-10-01,"[['Rashmi', 'K. S.', ''], ['Suma', 'V.', ''], ['Vaidehi', 'M.', '']]","['Round Robin Scheduling technique', 'Deadlock Avoidance', 'Migration', 'Load Balancing', 'Task scheduling', 'Shortest Job First Scheduling', 'Cloud Computing']"
19335,1602.06460,Garima Agrawal,Garima Agrawal and Kamalakar Karlapalem,Wheeled Robots playing Chain Catch: Strategies and Evaluation,,,,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robots playing games that humans are adept in is a challenge. We studied
robotic agents playing Chain Catch game as a Multi-Agent System (MAS). Our game
starts with a traditional Catch game similar to Pursuit evasion, and further
extends it to form a growing chain of predator agents to chase remaining preys.
Hence Chain Catch is a combination of two challenges - pursuit domain and
robotic chain formation. These are games that require team of robotic agents to
cooperate among themselves and to compete with other group of agents through
quick decision making. In this paper, we present a Chain Catch simulator that
allows us to incorporate game rules, design strategies and simulate the game
play. We developed cost model driven strategies for each of Escapee, Catcher
and Chain. Our results show that Sliding slope strategy is the best strategy
for Escapees whereas Tagging method is the best method for chain s movement in
Chain Catch. We also use production quality robots to implement the game play
in a physical environment and analyze game strategies on real robots. Our real
robots implementation in different scenarios shows that game strategies work as
expected and a complete chain formation takes place successfully in each game.
","[{'version': 'v1', 'created': 'Sat, 20 Feb 2016 21:07:03 GMT'}]",2016-02-23,"[['Agrawal', 'Garima', ''], ['Karlapalem', 'Kamalakar', '']]","['Strategies', 'Multi-agent games', 'Simulation', 'Robots', 'Heuristics']"
19336,1710.02255,Long Sha,"Long Sha, Patrick Lucey, Stephan Zheng, Taehwan Kim, Yisong Yue, and
  Sridha Sridharan","Fine-Grained Retrieval of Sports Plays using Tree-Based Alignment of
  Trajectories",,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a novel method for effective retrieval of multi-agent
spatiotemporal tracking data. Retrieval of spatiotemporal tracking data offers
several unique challenges compared to conventional text-based retrieval
settings. Most notably, the data is fine-grained meaning that the specific
location of agents is important in describing behavior. Additionally, the data
often contains tracks of multiple agents (e.g., multiple players in a sports
game), which generally leads to a permutational alignment problem when
performing relevance estimation. Due to the frequent position swap of agents,
it is difficult to maintain the correspondence of agents, and such issues make
the pairwise comparison problematic for multi-agent spatiotemporal data. To
address this issue, we propose a tree-based method to estimate the relevance
between multi-agent spatiotemporal tracks. It uses a hierarchical structure to
perform multi-agent data alignment and partitioning in a coarse-to-fine
fashion. We validate our approach via user studies with domain experts. Our
results show that our method boosts performance in retrieving similar sports
plays -- especially in interactive situations where the user selects a subset
of trajectories compared to current state-of-the-art methods.
","[{'version': 'v1', 'created': 'Fri, 6 Oct 2017 01:53:01 GMT'}]",2017-10-09,"[['Sha', 'Long', ''], ['Lucey', 'Patrick', ''], ['Zheng', 'Stephan', ''], ['Kim', 'Taehwan', ''], ['Yue', 'Yisong', ''], ['Sridharan', 'Sridha', '']]","['Retrieval and ranking', 'Multi-Agent Spatiotemporal Data', 'DataAlignment']"
19337,1007.5476,Prerana Laddha,Prerana Laddha,Degree of Separation in Social Networks,"9 pages, 7 figures",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  According to the small-world concept, the entire world is connected through
short chains of acquaintances. In popular imagination this is captured in the
phrase six degrees of separation, implying that any two individuals are, at
most, six handshakes away. Social network analysis is the understanding of
concepts and information on relationships among interacting units in an
ecological system. In this analysis the properties of the actors are explained
in terms of the structures of links amongst them. In general, the relational
links between the actors are primary and the properties of the actors are
secondary. This paper presents two methods to calculate the average degree of
separation between the actors or nodes in a graph. We apply this approach to
other random graphs depicting social networks and then compare the
characteristics of these graphs with the average degree of separation.
","[{'version': 'v1', 'created': 'Fri, 30 Jul 2010 15:36:37 GMT'}]",2010-08-20,"[['Laddha', 'Prerana', '']]","['Nodes', 'Links', 'Degree of separation', 'Probability of connectivity']"
19338,1603.09062,Cansu Sen,"Cansu Sen, Soner Yesil, Ertugrul Kolagasioglu","FPGA Impementation of Erasure-Only Reed Solomon Decoders for Hybrid-ARQ
  Systems",in Turkish,,,,cs.AR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the usage of the Reed Solomon Codes as the Forward Error
Correction (FEC) unit of the Hybrid Automatic Repeat Request (ARQ) methods.
Parametric and flexible FPGA implementation details of such Erasure-Only RS
decoders with high symbol lengths (e.g. GF(2^32)) have been presented. The
design is based on the GF(2m) multiplier logic core operating at a single clock
cycle, where the resource utilization and throughput are both directly
proportional to the number of these cores. For a fixed implementation, the
throughput inversely decreases with the number of erasures to be corrected.
Implementation in Zynq7020 SoC device of an example GF(2^32)-RS Decoder capable
of correcting 64-erasures with a single multiplier resulted in 1641-LUTs and
188-FFs achieving 15Mbps, whereas the design with 8 multipliers resulted in
6128-LUTs and 628-FFs achieving 100Mbps.
","[{'version': 'v1', 'created': 'Wed, 30 Mar 2016 07:44:23 GMT'}]",2016-03-31,"[['Sen', 'Cansu', ''], ['Yesil', 'Soner', ''], ['Kolagasioglu', 'Ertugrul', '']]","['forward error correction(FEC)', 'erasure only reed solomon decoder', 'FPGA', 'hybrid ARQ']"
19339,1304.5550,Adrian Groza,"Adrian Groza, Gabriel Barbur, Bogdan Blaga","OntoRich - A Support Tool for Semi-Automatic Ontology Enrichment and
  Evaluation",ACAM 2011,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the OntoRich framework, a support tool for semi-automatic
ontology enrichment and evaluation. The WordNet is used to extract candidates
for dynamic ontology enrichment from RSS streams. With the integration of
OpenNLP the system gains access to syntactic analysis of the RSS news. The
enriched ontologies are evaluated against several qualitative metrics.
","[{'version': 'v1', 'created': 'Fri, 19 Apr 2013 21:17:19 GMT'}]",2013-04-23,"[['Groza', 'Adrian', ''], ['Barbur', 'Gabriel', ''], ['Blaga', 'Bogdan', '']]","['ontology enrichment', 'ontology evaluation', 'streamprocessing', 'WordNet', 'natural language processing']"
19340,1610.09256,Amir H Jafari,"Amir H. Jafari, Ming Ding, David Lopez-Perez, Jie Zhang","Performance Impact of LOS and NLOS Transmissions in Dense Cellular
  Networks under Rician Fading","24 pages, 3 figures. Submitted to IEEE Transactions on Wireless
  Communications",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we analyse the performance of dense small cell network (SCNs).
We derive analytical expressions for both their coverage probability and their
area spectral efficiency (ASE) using a path loss model that considers both
line-of-sight (LOS) and non-LOS (NLOS) components. Due to the close proximity
of small cell base stations (BSs) and user equipments (UEs) in such dense SCNs,
we also consider Rician fading as the multi-path fading channel model for both
the LOS and NLOS fading transmissions. The Rayleigh fading used in most of
existing works analysing dense SCNs is not accurate enough. Then, we compare
the performance impact of LOS and NLOS transmissions in dense SCNs under Rician
fading with that based on Rayleigh fading. The analysis and the simulation
results show that in dense SCNs where LOS transmissions dominate the
performance, the impact of Rician fading on the overall system performance is
minor, and does not help to address the performance losses brought by the
transition of many interfering signals from NLOS to LOS.
","[{'version': 'v1', 'created': 'Fri, 28 Oct 2016 15:07:21 GMT'}]",2016-10-31,"[['Jafari', 'Amir H.', ''], ['Ding', 'Ming', ''], ['Lopez-Perez', 'David', ''], ['Zhang', 'Jie', '']]","['stochastic geometry', 'homogeneous Poisson point process (HPPP)', 'Line-of-sight (LOS)', 'Non']"
19341,1306.6428,Meenakshi S P,S.P. Meenakshi and S.V. Raghavan,"Internet Control Plane Event Identification using Model Based Change
  Point Detection Techniques","19 pages, 8 figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the raise of many global organizations deploying their data centers and
content services in India, the prefix reachability performance study from
global destinations garners our attention. The events such as failures and
attacks occurring in the Internet topology have impact on Autonomous System
(AS) paths announced in the control plane and reachability of prefixes from
spatially distributed ASes. As a consequence the customer reachability to the
services in terms of increased latency and outages for a short or long time are
experienced. The challenge in control plane event detection is when the data
plane traffic is able to reach the intended destinations correctly. However
detection of such events are crucial for the operations of content and data
center industries. By monitoring the spatially distributed routing table
features like AS path length distributions, spatial prefix reachability
distribution and covering to overlap route ratio, we can detect the control
plane events. In our work, we study prefix AS paths from the publicly available
route-view data and analyze the global reachability as well as reachability to
Indian AS topology. To capture the spatial events in a single temporal pattern,
we propose a counting based measure using prefixes announced by x % of spatial
peers. Employing statistical characteristics change point detection and
temporal aberration algorithm on the time series of the proposed measure, we
identify the occurrence of long and stochastic control plane events. The impact
and duration of the events are also quantified. We validate the mechanisms over
the proposed measure using the SEA-Me-We4 cable cut event manifestations in the
control plane of Indian AS topology. The cable cut events occurred on 6th June
2012 (long term event) and 17th April 2012 (stochastic event) are considered
for validation.
","[{'version': 'v1', 'created': 'Thu, 27 Jun 2013 07:58:17 GMT'}]",2013-06-28,"[['Meenakshi', 'S. P.', ''], ['Raghavan', 'S. V.', '']]","['Control Plane Events', 'ARIMA Models', 'Change Point Detection', 'Spatio Temporal Analysis', 'Temporal Aberration']"
19342,1605.01752,Stefan Hoffmann,Stefan Hoffmann and Egon Wanke,"Minimum Power Range Assignment for Symmetric Connectivity in Sensor
  Networks with two Power Levels",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper examines the problem of assigning a transmission power to every
node of a wireless sensor network. The goal is to minimize the total power
consumption while ensuring that the resulting communication graph is connected.
We focus on a restricted version of this Range Assignment (RA) problem in which
there are two different power levels. We only consider symmetrical transmission
links to allow easy integration with low level wireless protocols that
typically require bidirectional communication between two neighboring nodes. We
introduce a parameterized polynomial time approximation algorithm with a
performance ratio arbitrarily close to $\pi^2/6$. Additionally, we give an
almost linear time approximation algorithm with a tight quality bound of $7/4$.
","[{'version': 'v1', 'created': 'Thu, 5 May 2016 20:48:14 GMT'}]",2016-05-09,"[['Hoffmann', 'Stefan', ''], ['Wanke', 'Egon', '']]","['range assignment', 'power consumption', 'radio network', 'sensor network', 'wireless ad hoc network', 'approximation algorithm']"
19343,1306.4063,Shariq Hussain Mr.,"Shariq Hussain, Zhaoshun Wang, Ibrahima Kalil Toure and Abdoulaye Diop",Web Service Testing Tools: A Comparative Study,"7 pages, 4 tables, 3 figures","IJCSI International Journal of Computer Science Issues, vol.10,
  no.1-3, 2013, pp.641-647",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quality of Service (QoS) has gained more importance with the increase in
usage and adoption of web services. In recent years, various tools and
techniques developed for measurement and evaluation of QoS of web services.
There are commercial as well as open-source tools available today which are
being used for monitoring and testing QoS for web services. These tools
facilitate in QoS measurement and analysis and are helpful in evaluation of
service performance in real-time network. In this paper, we describe three
popular open-source tools and compare them in terms of features, usability,
performance, and software requirements. Results of the comparison will help in
adoption and usage of these tools, and also promote development and usage of
open-source web service testing tools.
","[{'version': 'v1', 'created': 'Tue, 18 Jun 2013 03:15:22 GMT'}]",2013-06-19,"[['Hussain', 'Shariq', ''], ['Wang', 'Zhaoshun', ''], ['Toure', 'Ibrahima Kalil', ''], ['Diop', 'Abdoulaye', '']]","['Web Services', 'Performance', 'Software Testing', 'Testing Tools', 'Open-source Software']"
19344,1412.3919,Alexandre Abraham,"Alexandre Abraham (NEUROSPIN, INRIA Saclay - Ile de France), Fabian
  Pedregosa (INRIA Saclay - Ile de France), Michael Eickenberg (LNAO, INRIA
  Saclay - Ile de France), Philippe Gervais (NEUROSPIN, INRIA Saclay - Ile de
  France, LNAO), Andreas Muller, Jean Kossaifi, Alexandre Gramfort (NEUROSPIN,
  LTCI), Bertrand Thirion (NEUROSPIN, INRIA Saclay - Ile de France), G\""ael
  Varoquaux (NEUROSPIN, INRIA Saclay - Ile de France, LNAO)",Machine Learning for Neuroimaging with Scikit-Learn,"Frontiers in neuroscience, Frontiers Research Foundation, 2013, pp.15",,,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Statistical machine learning methods are increasingly used for neuroimaging
data analysis. Their main virtue is their ability to model high-dimensional
datasets, e.g. multivariate analysis of activation images or resting-state time
series. Supervised learning is typically used in decoding or encoding settings
to relate brain images to behavioral or clinical observations, while
unsupervised learning can uncover hidden structures in sets of images (e.g.
resting state functional MRI) or find sub-populations in large cohorts. By
considering different functional neuroimaging applications, we illustrate how
scikit-learn, a Python machine learning library, can be used to perform some
key analysis steps. Scikit-learn contains a very large set of statistical
learning algorithms, both supervised and unsupervised, and its application to
neuroimaging data provides a versatile tool to study the brain.
","[{'version': 'v1', 'created': 'Fri, 12 Dec 2014 08:38:35 GMT'}]",2014-12-15,"[['Abraham', 'Alexandre', '', 'NEUROSPIN, INRIA Saclay - Ile de France'], ['Pedregosa', 'Fabian', '', 'INRIA Saclay - Ile de France'], ['Eickenberg', 'Michael', '', 'LNAO, INRIA\n  Saclay - Ile de France'], ['Gervais', 'Philippe', '', 'NEUROSPIN, INRIA Saclay - Ile de\n  France, LNAO'], ['Muller', 'Andreas', '', 'NEUROSPIN,\n  LTCI'], ['Kossaifi', 'Jean', '', 'NEUROSPIN,\n  LTCI'], ['Gramfort', 'Alexandre', '', 'NEUROSPIN,\n  LTCI'], ['Thirion', 'Bertrand', '', 'NEUROSPIN, INRIA Saclay - Ile de France'], ['Varoquaux', 'Gäel', '', 'NEUROSPIN, INRIA Saclay - Ile de France, LNAO']]","['machine learning', 'statistical learning', 'neuroimaging', 'scikit-learn', 'Python']"
19345,1604.07166,Liang Li,"Jun Wan, Yu Xia, Liang Li, Thomas Moscibroda",Information Cascades on Arbitrary Topologies,,,,,cs.SI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study information cascades on graphs. In this setting, each
node in the graph represents a person. One after another, each person has to
take a decision based on a private signal as well as the decisions made by
earlier neighboring nodes. Such information cascades commonly occur in practice
and have been studied in complete graphs where everyone can overhear the
decisions of every other player. It is known that information cascades can be
fragile and based on very little information, and that they have a high
likelihood of being wrong.
  Generalizing the problem to arbitrary graphs reveals interesting insights. In
particular, we show that in a random graph $G(n,q)$, for the right value of
$q$, the number of nodes making a wrong decision is logarithmic in $n$. That
is, in the limit for large $n$, the fraction of players that make a wrong
decision tends to zero. This is intriguing because it contrasts to the two
natural corner cases: empty graph (everyone decides independently based on his
private signal) and complete graph (all decisions are heard by all nodes). In
both of these cases a constant fraction of nodes make a wrong decision in
expectation. Thus, our result shows that while both too little and too much
information sharing causes nodes to take wrong decisions, for exactly the right
amount of information sharing, asymptotically everyone can be right. We further
show that this result in random graphs is asymptotically optimal for any
topology, even if nodes follow a globally optimal algorithmic strategy. Based
on the analysis of random graphs, we explore how topology impacts global
performance and construct an optimal deterministic topology among layer graphs.
","[{'version': 'v1', 'created': 'Mon, 25 Apr 2016 08:52:37 GMT'}, {'version': 'v2', 'created': 'Sun, 1 May 2016 03:07:55 GMT'}]",2016-05-03,"[['Wan', 'Jun', ''], ['Xia', 'Yu', ''], ['Li', 'Liang', ''], ['Moscibroda', 'Thomas', '']]","['Information Cascades', 'Herding Effect', 'Random Graphs']"
19346,1603.05625,Andreas Krebs,"Andreas Krebs, Kamal Lodaya, Paritosh Pandya, Howard Straubing",Two-variable Logic with a Between Predicate,,,,,cs.LO,http://creativecommons.org/licenses/by/4.0/,"  We study an extension of FO^2[<], first-order logic interpreted in finite
words, in which formulas are restricted to use only two variables. We adjoin to
this language two-variable atomic formulas that say, `the letter a appears
between positions x and y'. This is, in a sense, the simplest property that is
not expressible using only two variables.
  We present several logics, both first-order and temporal, that have the same
expressive power, and find matching lower and upper bounds for the complexity
of satisfiability for each of these formulations. We also give an effective
necessary condition, in terms of the syntactic monoid of a regular language,
for a property to be expressible in this logic. We show that this condition is
also sufficient for words over a two-letter alphabet. This algebraic analysis
allows us us to prove, among other things, that our new logic has strictly less
expressive power than full first-order logic FO[<].
","[{'version': 'v1', 'created': 'Thu, 17 Mar 2016 19:17:10 GMT'}]",2016-03-18,"[['Krebs', 'Andreas', ''], ['Lodaya', 'Kamal', ''], ['Pandya', 'Paritosh', ''], ['Straubing', 'Howard', '']]","['automata theory', 'algebra', 'finite model theory', 'modal and temporal logics', 'computational complexity', 'verification']"
19347,1603.04408,Alisher Abdulkhaev,Alisher Abdulkhaev and Ozgur Yilmaz,U-CATCH: Using Color ATtribute of image patCHes in binary descriptors,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, we propose a simple yet very effective method for extracting
color information through binary feature description framework. Our method
expands the dimension of binary comparisons into RGB and YCbCr spaces, showing
more than 100% matching improve ment compared to non-color binary descriptors
for a wide range of hard-to-match cases. The proposed method is general and can
be applied to any binary descriptor to make it color sensitive. It is faster
than classical binary descriptors for RGB sampling due to the abandonment of
grayscale conversion and has almost identical complexity (insignificant
compared to smoothing operation) for YCbCr sampling.
","[{'version': 'v1', 'created': 'Mon, 14 Mar 2016 19:32:57 GMT'}, {'version': 'v2', 'created': 'Sun, 27 Mar 2016 17:59:20 GMT'}, {'version': 'v3', 'created': 'Thu, 22 Aug 2019 05:17:34 GMT'}]",2019-08-23,"[['Abdulkhaev', 'Alisher', ''], ['Yilmaz', 'Ozgur', '']]","['Binary Feature Descriptor', 'Color', 'BRIEF', 'LATCH', 'RGB', 'YCbCr']"
19348,1111.5892,Gene Sher,Gene I. Sher,"Evolving Chart Pattern Sensitive Neural Network Based Forex Trading
  Agents",,,,,cs.NE cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Though machine learning has been applied to the foreign exchange market for
algorithmic trading for quiet some time now, and neural networks(NN) have been
shown to yield positive results, in most modern approaches the NN systems are
optimized through traditional methods like the backpropagation algorithm for
example, and their input signals are price lists, and lists composed of other
technical indicator elements. The aim of this paper is twofold: the
presentation and testing of the application of topology and weight evolving
artificial neural network (TWEANN) systems to automated currency trading, and
to demonstrate the performance when using Forex chart images as input to
geometrical regularity aware indirectly encoded neural network systems,
enabling them to use the patterns & trends within, when trading. This paper
presents the benchmark results of NN based automated currency trading systems
evolved using TWEANNs, and compares the performance and generalization
capabilities of these direct encoded NNs which use the standard sliding-window
based price vector inputs, and the indirect (substrate) encoded NNs which use
charts as input. The TWEANN algorithm I will use in this paper to evolve these
currency trading agents is the memetic algorithm based TWEANN system called
Deus Ex Neural Network (DXNN) platform.
","[{'version': 'v1', 'created': 'Fri, 25 Nov 2011 05:11:14 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Jan 2012 19:48:31 GMT'}]",2012-01-31,"[['Sher', 'Gene I.', '']]","['Neural Network', 'TWEANN', 'Evolutionary Computation', 'Neuroevolution', 'Memetic Algorithm', 'Artificial Life', 'Financial Analysis', 'Forex']"
19349,1606.06877,Waqar  Ahmed,"Waqar Ahmed, Osman Hasan and Sofiene Tahar",Formal Dependability Modeling and Analysis: A Survey,,,,,cs.SE cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dependability is an umbrella concept that subsumes many key properties about
a system, including reliability, maintainability, safety, availability,
confidentiality, and integrity. Various dependability modeling techniques have
been developed to effectively capture the failure characteristics of systems
over time. Traditionally, dependability models are analyzed using
paper-and-pencil proof methods and computer based simulation tools but their
results cannot be trusted due to their inherent inaccuracy limitations. The
recent developments in probabilistic analysis support using formal methods have
enabled the possibility of accurate and rigorous dependability analysis. Thus,
the usage of formal methods for dependability analysis is widely advocated for
safety-critical domains, such as transportation, aerospace and health. Given
the complementary strengths of mainstream formal methods, like theorem proving
and model checking, and the variety of dependability models judging the most
suitable formal technique for a given dependability model is not a
straightforward task. In this paper, we present a comprehensive review of
existing formal dependability analysis techniques along with their pros and
cons for handling a particular dependability model.
","[{'version': 'v1', 'created': 'Wed, 22 Jun 2016 10:19:06 GMT'}]",2016-06-23,"[['Ahmed', 'Waqar', ''], ['Hasan', 'Osman', ''], ['Tahar', 'Sofiene', '']]","['Reliability Block Diagrams', 'Fault Tree', 'Markov Chain', 'PetriNets', 'Model Checking', 'Higher-order Logic', 'Theorem Proving']"
19350,0907.5155,Ching-an Hsiao,C. A. Hsiao,On Classification from Outlier View,"Conclusion renewed; IAENG International Journal of Computer Science,
  Volume 37, Issue 4, Nov, 2010",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Classification is the basis of cognition. Unlike other solutions, this study
approaches it from the view of outliers. We present an expanding algorithm to
detect outliers in univariate datasets, together with the underlying
foundation. The expanding algorithm runs in a holistic way, making it a rather
robust solution. Synthetic and real data experiments show its power.
Furthermore, an application for multi-class problems leads to the introduction
of the oscillator algorithm. The corresponding result implies the potential
wide use of the expanding algorithm.
","[{'version': 'v1', 'created': 'Wed, 29 Jul 2009 15:47:33 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Jul 2009 14:17:30 GMT'}, {'version': 'v3', 'created': 'Fri, 24 Jun 2011 13:53:49 GMT'}, {'version': 'v4', 'created': 'Mon, 2 Jan 2012 15:19:41 GMT'}]",2012-01-04,"[['Hsiao', 'C. A.', '']]","['Classification', 'outlier', 'expanding algorithm', 'sensitivity']"
19351,1206.1678,Magesh George,G. Mageshwari and E. Grace Mary Kanaga,A Distributed Optimized Patient Scheduling using Partial Information,"11 pages, 8 figures",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A software agent may be a member of a Multi-Agent System (MAS) which is
collectively performing a range of complex and intelligent tasks. In the
hospital, scheduling decisions are finding difficult to schedule because of the
dynamic changes and distribution. In order to face this problem with dynamic
changes in the hospital, a new method, Distributed Optimized Patient Scheduling
with Grouping (DOPSG) has been proposed. The goal of this method is that there
is no necessity for knowing patient agents information globally. With minimal
information this method works effectively. Scheduling problem can be solved for
multiple departments in the hospital. Patient agents have been scheduled to the
resource agent based on the patient priority to reduce the waiting time of
patient agent and to reduce idle time of resources.
","[{'version': 'v1', 'created': 'Fri, 8 Jun 2012 07:02:06 GMT'}]",2012-06-11,"[['Mageshwari', 'G.', ''], ['Kanaga', 'E. Grace Mary', '']]","['Patient Scheduling', 'Multi-Agent System', 'Software Agent', 'Distributed Computing.  1']"
19352,1008.0451,Yibei Ling,"Yibei Ling, Shigang Chen, and Cho-Yu Jason Chiang",On Optimal Deadlock Detection Scheduling,,"IEEE Transactions on Computers, 55(9), 1178-1187 (2006)",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deadlock detection scheduling is an important, yet often overlooked problem
that can significantly affect the overall performance of deadlock handling.
Excessive initiation of deadlock detection increases overall message usage,
resulting in degraded system performance in the absence of deadlocks; while
insufficient initiation of deadlock detection increases the deadlock
persistence time, resulting in an increased deadlock resolution cost in the
presence of deadlocks. The investigation of this performance tradeoff, however,
is missing in the literature. This paper studies the impact of deadlock
detection scheduling on the overall performance of deadlock handling. In
particular, we show that there exists an optimal deadlock detection frequency
that yields the minimum long-run mean average cost, which is determined by the
message complexities of the deadlock detection and resolution algorithms being
used, as well as the rate of deadlock formation, denoted as $\lambda$. For the
best known deadlock detection and resolution algorithms, we show that the
asymptotically optimal frequency of deadlock detection scheduling that
minimizes the overall message overhead is ${\cal O}((\lambda n)^{1/3})$, when
the total number $n$ of processes is sufficiently large. Furthermore, we show
that in general fully distributed (uncoordinated) deadlock detection scheduling
cannot be performed as efficiently as centralized (coordinated) deadlock
detection scheduling.
","[{'version': 'v1', 'created': 'Tue, 3 Aug 2010 03:46:56 GMT'}]",2010-08-04,"[['Ling', 'Yibei', ''], ['Chen', 'Shigang', ''], ['Chiang', 'Cho-Yu Jason', '']]","['/Index Terms Deadlock detection scheduling', 'Deadlock formation rate', 'Deadlockpersistence time']"
19353,1409.6041,Muhammad Ghifary,Muhammad Ghifary and W. Bastiaan Kleijn and Mengjie Zhang,Domain Adaptive Neural Networks for Object Recognition,,,,,cs.CV cs.AI cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a simple neural network model to deal with the domain adaptation
problem in object recognition. Our model incorporates the Maximum Mean
Discrepancy (MMD) measure as a regularization in the supervised learning to
reduce the distribution mismatch between the source and target domains in the
latent space. From experiments, we demonstrate that the MMD regularization is
an effective tool to provide good domain adaptation models on both SURF
features and raw image pixels of a particular image data set. We also show that
our proposed model, preceded by the denoising auto-encoder pretraining,
achieves better performance than recent benchmark models on the same data sets.
This work represents the first study of MMD measure in the context of neural
networks.
","[{'version': 'v1', 'created': 'Sun, 21 Sep 2014 20:42:00 GMT'}]",2016-07-28,"[['Ghifary', 'Muhammad', ''], ['Kleijn', 'W. Bastiaan', ''], ['Zhang', 'Mengjie', '']]","['Domain Adaptation', 'Neural Networks', 'Representation Learning', 'Transfer Learning', 'Maximum Mean Discrepancy']"
19354,1702.05214,Xiaojing Shen,"Zhiguo Wang, Xiaojing Shen, and Yunmin Zhu","Set-Membership Information Fusion for Multisensor Nonlinear Dynamic
  Systems","29 pages, 4 figures, submitted",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The set-membership information fusion problem is investigated for general
multisensor nonlinear dynamic systems. Compared with linear dynamic systems and
point estimation fusion in mean squared error sense, it is a more challenging
nonconvex optimization problem. Usually, to solve this problem, people try to
find an efficient or heuristic fusion algorithm. It is no doubt that an
analytical fusion formula should be much significant for rasing accuracy and
reducing computational burden. However, since it is a more complicated than the
convex quadratic optimization problem for linear point estimation fusion, it is
not easy to get the analytical fusion formula. In order to overcome the
difficulty of this problem, two popular fusion architectures are considered:
centralized and distributed set-membership information fusion. Firstly, both of
them can be converted into a semidefinite programming problem which can be
efficiently computed, respectively. Secondly, their analytical solutions can be
derived surprisingly by using decoupling technique. It is very interesting that
they are quite similar in form to the classic information filter. In the two
analytical fusion formulae, the information of each sensor can be clearly
characterized, and the knowledge of the correlation among measurement noises
across sensors are not required. Finally, multi-algorithm fusion is used to
minimize the size of the state bounding ellipsoid by complementary advantages
of multiple parallel algorithms. A typical numerical example in target tracking
demonstrates the effectiveness of the centralized, distributed, and
multi-algorithm set-membership fusion algorithms. In particular, it shows that
multi-algorithm fusion performs better than the centralized and distributed
fusion.
","[{'version': 'v1', 'created': 'Fri, 17 Feb 2017 03:47:20 GMT'}]",2017-02-20,"[['Wang', 'Zhiguo', ''], ['Shen', 'Xiaojing', ''], ['Zhu', 'Yunmin', '']]","['Nonlinear dynamic systems', 'multisensor fusion', 'target tracking', 'unknown but bounded noise', 'set-membership filter']"
19355,1004.3272,Vishal Goyal,"Nattapon Pannurat, Nittaya Kerdprasop, Kittisak Kerdprasop",Database Reverse Engineering based on Association Rule Mining,"International Journal of Computer Science Issues online at
  http://ijcsi.org/articles/Database-Reverse-Engineering-based-on-Association-Rule-Mining.php","IJCSI, Volume 7, Issue 2, March 2010",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Maintaining a legacy database is a difficult task especially when system
documentation is poor written or even missing. Database reverse engineering is
an attempt to recover high-level conceptual design from the existing database
instances. In this paper, we propose a technique to discover conceptual schema
using the association mining technique. The discovered schema corresponds to
the normalization at the third normal form, which is a common practice in many
business organizations. Our algorithm also includes the rule filtering
heuristic to solve the problem of exponential growth of discovered rules
inherited with the association mining technique.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2010 18:18:43 GMT'}]",2010-04-20,"[['Pannurat', 'Nattapon', ''], ['Kerdprasop', 'Nittaya', ''], ['Kerdprasop', 'Kittisak', '']]","['Legacy Databases', 'Reverse Engineering', 'Database Design', 'Database Normalization', 'Association Mining']"
19356,1205.5615,Md. Monzur Morshed,"Md. Monzur Morshed, Md. Arifur Rahman, Salah Uddin Ahmed","A Literature Review of Code Clone Analysis to Improve Software
  Maintenance Process","This is a research collaboration of American International
  University-Bangladesh, Carleton University-Canada, SCICON &
  TigerHATS-Bangladesh",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software systems are getting more complex as the system grows where
maintaining such system is a primary concern for the industry. Code clone is
one of the factors making software maintenance more difficult. It is a process
of replicating code blocks by copy-and-paste that is common in software
development. In the beginning stage of the project, developers find it easy and
time consuming though it has crucial drawbacks in the long run. There are two
types of researchers where some researchers think clones lead to additional
changes during maintenance phase, in later stage increase the overall
maintenance effort. On the other hand, some researchers think that cloned codes
are more stable than non cloned codes. In this study, we discussed Code Clones
and different ideas, methods, clone detection tools, related research on code
clone, case study.
","[{'version': 'v1', 'created': 'Fri, 25 May 2012 05:28:29 GMT'}]",2012-05-28,"[['Morshed', 'Md. Monzur', ''], ['Rahman', 'Md. Arifur', ''], ['Ahmed', 'Salah Uddin', '']]","['Code Clone', 'Software Maintenance', 'Clode Detection', 'Clone Evolution']"
19357,1603.03349,Marcos Baez,"Marcos Baez, Chiara Dalpiaz, Fatbardha Hoxha, Alessia Tovo, Valentina
  Caforio, Fabio Casati",Personalized Persuasion for Social Interactions in Nursing Homes,,,,,cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents our preliminary investigation and approach towards a
mixed physical-virtual technology for stimulating social interactions among and
with older adults in nursing homes. We report on set of surveys, apps and focus
groups aiming at understanding the different motivations and obstacles in
promoting social interactions in institutionalised care. We then present our
approach to address some of the key themes found, e.g., the technological
disparity, lack of conversation topics and opportunities to interact
","[{'version': 'v1', 'created': 'Wed, 9 Mar 2016 10:38:09 GMT'}]",2016-03-11,"[['Baez', 'Marcos', ''], ['Dalpiaz', 'Chiara', ''], ['Hoxha', 'Fatbardha', ''], ['Tovo', 'Alessia', ''], ['Caforio', 'Valentina', ''], ['Casati', 'Fabio', '']]","['social interactions', 'older adults', 'nursing homes', 'persuasionstrategies']"
19358,1501.00569,Marc  Zeitoun,Thomas Place and Marc Zeitoun,A Transfer Theorem for the Separation Problem,,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate two problems for a class C of regular word languages. The
C-membership problem asks for an algorithm to decide whether an input language
belongs to C. The C-separation problem asks for an algorithm that, given as
input two regular languages, decides whether there exists a third language in C
containing the first language, while being disjoint from the second. These
problems are considered as means to obtain a deep understanding of the class C.
  It is usual for such classes to be defined by logical formalisms. Logics are
often built on top of each other, by adding new predicates. A natural
construction is to enrich a logic with the successor relation. In this paper,
we obtain simple self-contained proofs of two transfer results: we show that
for suitable logically defined classes, the membership, resp. the separation
problem for a class enriched with the successor relation reduces to the same
problem for the original class.
  Our reductions work both for languages of finite words and infinite words.
The proofs are mostly self-contained, and only require a basic background on
regular languages. This paper therefore gives new, simple proofs of results
that were considered as difficult, such as the decid- ability of the membership
problem for the levels 1, 3/2, 2 and 5/2 of the dot-depth hierarchy.
","[{'version': 'v1', 'created': 'Sat, 3 Jan 2015 15:05:29 GMT'}]",2015-01-06,"[['Place', 'Thomas', ''], ['Zeitoun', 'Marc', '']]","['Separation Problem', 'Regular Word Languages', 'Logics', 'Decidable Characterizations', 'Semidirect Product']"
19359,1606.03530,Melinda D'Cruz,"Melinda D'Cruz, Greg Timbrell and Jason Watson",Strategy in a Digital World,"ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
  Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/211,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Organizations are increasingly adopting digital strategies and investing
heavily in digital technologies and initiatives. However, to date, there does
not appear to be a clear understanding of digital strategies and their purpose,
which forms the motivation for this research. This research-in-progress study
aims to address this research gap by exploring 1) the various conceptions of
digital strategy, and 2) the way in which digital strategies differ from
conventional strategies, through interviews with three senior executives. We
employed thematic analysis to analyse the interview data, which resulted in the
identification of ten themes that were grouped under three theoretical
constructs. We then explored the applicability of the six dimensions of
strategy proposed by Hax (1990) in the digital context and proposed two
additional dimensions. The contribution of this study is to provide a deeper
understanding of digital strategy to support further academic research and
provide guidance to practitioners.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 02:56:14 GMT'}]",2016-06-14,"[[""D'Cruz"", 'Melinda', ''], ['Timbrell', 'Greg', ''], ['Watson', 'Jason', '']]","['Digital Strategy', 'Digital', 'Strategy']"
19360,0803.2495,Gabriel Istrate,"Gabriel Istrate, Madhav V. Marathe and S.S.Ravi","Adversarial Scheduling Analysis of Game Theoretic Models of Norm
  Diffusion",,,,,cs.GT cs.DM math.CO math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In (Istrate, Marathe, Ravi SODA 2001) we advocated the investigation of
robustness of results in the theory of learning in games under adversarial
scheduling models. We provide evidence that such an analysis is feasible and
can lead to nontrivial results by investigating, in an adversarial scheduling
setting, Peyton Young's model of diffusion of norms. In particular, our main
result incorporates into Peyton Young's model.
","[{'version': 'v1', 'created': 'Mon, 17 Mar 2008 17:42:28 GMT'}]",2008-11-04,"[['Istrate', 'Gabriel', ''], ['Marathe', 'Madhav V.', ''], ['Ravi', 'S. S.', '']]","['evolutionary games', 'adversarial scheduling', 'discrete Markov chains']"
19361,1205.3803,Steffen Lewitzka,Steffen Lewitzka,Necessity as justified truth,"36 pages; corrected typos from the first version; content and results
  remain completely unchanged",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a logic for the reasoning about necessity and justifications which
is independent from relational semantics. We choose the concept of
justification -- coming from a class of ""Justification Logics"" (Artemov 2008,
Fitting 2009) -- as the primitive notion on which the concept of necessity is
based. Our axiomatization extends Suszko's non-Fregean logic SCI (Brown, Suszko
1972) by basic axioms from Justification Logic, axioms for quantification over
propositions and over justifications, and some further principles. The core
axiom is: $\varphi$ is necessarily true iff there is a justification for
$\varphi$. That is, necessity is first-order definable by means of
justifications. Instead of defining purely algebraic models in the style of
(Brown, Suszko 1972) we extend the semantics investigated in (Lewitzka 2012) by
some algebraic structure for dealing with justifications and prove soundness
and completeness of our deductive system. Moreover, we are able to restore the
modal logic principle of Necessitation if we add the axiom schema
$\square\varphi \to \square\square\varphi$ and a rule of Axiom Necessitation to
our system. As a main result, we show that the modal logics S4 and S5 can be
captured by our semantics if we impose the corresponding modal logic principles
as additional semantic constraints. This will follow from proof-theoretic
considerations and from our completeness theorems. For the system S4 we present
also a purely model-theoretic proof.
","[{'version': 'v1', 'created': 'Wed, 16 May 2012 20:37:34 GMT'}, {'version': 'v2', 'created': 'Sun, 3 Jun 2012 21:22:57 GMT'}]",2015-03-20,"[['Lewitzka', 'Steffen', '']]","['Non-Fregean Logic', 'Justification Logic', 'Modal Logic', 'propositional self-reference']"
19362,1106.3586,Pabitra Pal Choudhury,"Sk. S. Hassan, A. Roy, P. Pal Choudhury, B.K. Nayak",One Dimensional p-adic Integral Value Transformations,"The mathematics of Integral Value Transformations have been
  deciphered",,,,cs.DM,http://creativecommons.org/licenses/by/3.0/,"  In this paper, a set of transformations T^(p,k) is defined on N_0^K to N_0.
Some basic and na\""ive mathematical structure of T^(p,1) are adumbrated and
introduced the concept of discrete dynamical systems through IVTs. Latterly,
some further research scope of IVTs is highlighted.
","[{'version': 'v1', 'created': 'Fri, 6 May 2011 04:29:20 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Jun 2011 12:24:33 GMT'}]",2011-06-22,"[['Hassan', 'Sk. S.', ''], ['Roy', 'A.', ''], ['Choudhury', 'P. Pal', ''], ['Nayak', 'B. K.', '']]","['Integral Value Transformations', 'Dynamical Systems', 'Topological Dynamics']"
19363,1005.0188,Nishant Mehta,Nishant A. Mehta and Alexander G. Gray,Generative and Latent Mean Map Kernels,"16 pages, 1 figure, 1 table",,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce two kernels that extend the mean map, which embeds probability
measures in Hilbert spaces. The generative mean map kernel (GMMK) is a smooth
similarity measure between probabilistic models. The latent mean map kernel
(LMMK) generalizes the non-iid formulation of Hilbert space embeddings of
empirical distributions in order to incorporate latent variable models. When
comparing certain classes of distributions, the GMMK exhibits beneficial
regularization and generalization properties not shown for previous generative
kernels. We present experiments comparing support vector machine performance
using the GMMK and LMMK between hidden Markov models to the performance of
other methods on discrete and continuous observation sequence data. The results
suggest that, in many cases, the GMMK has generalization error competitive with
or better than other methods.
","[{'version': 'v1', 'created': 'Mon, 3 May 2010 05:59:41 GMT'}]",2010-05-04,"[['Mehta', 'Nishant A.', ''], ['Gray', 'Alexander G.', '']]","['Kernel methods', 'graphical models', 'complexity']"
19364,1603.04595,Olivier Mor\`ere,"Olivier Mor\`ere, Jie Lin, Antoine Veillard, Vijay Chandrasekhar,
  Tomaso Poggio",Nested Invariance Pooling and RBM Hashing for Image Instance Retrieval,"Image Instance Retrieval, CNN, Invariant Representation, Hashing,
  Unsupervised Learning, Regularization. arXiv admin note: text overlap with
  arXiv:1601.02093",,,,cs.CV cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The goal of this work is the computation of very compact binary hashes for
image instance retrieval. Our approach has two novel contributions. The first
one is Nested Invariance Pooling (NIP), a method inspired from i-theory, a
mathematical theory for computing group invariant transformations with
feed-forward neural networks. NIP is able to produce compact and
well-performing descriptors with visual representations extracted from
convolutional neural networks. We specifically incorporate scale, translation
and rotation invariances but the scheme can be extended to any arbitrary sets
of transformations. We also show that using moments of increasing order
throughout nesting is important. The NIP descriptors are then hashed to the
target code size (32-256 bits) with a Restricted Boltzmann Machine with a novel
batch-level regularization scheme specifically designed for the purpose of
hashing (RBMH). A thorough empirical evaluation with state-of-the-art shows
that the results obtained both with the NIP descriptors and the NIP+RBMH hashes
are consistently outstanding across a wide range of datasets.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2016 08:56:33 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Apr 2016 14:11:18 GMT'}]",2016-04-15,"[['Morère', 'Olivier', ''], ['Lin', 'Jie', ''], ['Veillard', 'Antoine', ''], ['Chandrasekhar', 'Vijay', ''], ['Poggio', 'Tomaso', '']]","['Image Instance Retrieval', 'CNN', 'Invariant Representation', 'Hashing', 'Unsupervised Learning', 'Regularization']"
19365,1702.06614,Ross M. McConnell,"Peter Hamburger and Ross M. McConnell and Attila P\'or and Jeremy P.
  Spinrad",Double Threshold Digraphs,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A semiorder is a model of preference relations where each element $x$ is
associated with a utility value $\alpha(x)$, and there is a threshold $t$ such
that $y$ is preferred to $x$ iff $\alpha(y) > \alpha(x)+t$. These are motivated
by the notion that there is some uncertainty in the utility values we assign an
object or that a subject may be unable to distinguish a preference between
objects whose values are close. However, they fail to model the well-known
phenomenon that preferences are not always transitive. Also, if we are
uncertain of the utility values, it is not logical that preference is
determined absolutely by a comparison of them with an exact threshold. We
propose a new model in which there are two thresholds, $t_1$ and $t_2$; if the
difference $\alpha(y) - \alpha(x)$ less than $t_1$, then $y$ is not preferred
to $x$; if the difference is greater than $t_2$ then $y$ is preferred to $x$;
if it is between $t_1$ and $t_2$, then then $y$ may or may not be preferred to
$x$. We call such a relation a double-threshold semiorder, and the
corresponding directed graph $G = (V,E)$ a double threshold digraph. Every
directed acyclic graph is a double threshold graph; bounds on $t_2/t_1$ give a
nested hierarchy of subclasses of the directed acyclic graphs. In this paper we
characterize the subclasses in terms of forbidden subgraphs, and give
algorithms for finding an assignment of of utility values that explains the
relation in terms of a given $(t_1,t_2)$ or else produces a forbidden subgraph,
and finding the minimum value $\lambda$ of $t_2/t_1$ that is satisfiable for a
given directed acyclic graph. We show that $\lambda$ gives a measure of the
complexity of a directed acyclic graph with respect to several optimization
problems that are NP-hard on arbitrary directed acyclic graphs.
","[{'version': 'v1', 'created': 'Tue, 21 Feb 2017 23:02:59 GMT'}, {'version': 'v2', 'created': 'Tue, 26 Jun 2018 17:03:13 GMT'}]",2018-06-27,"[['Hamburger', 'Peter', ''], ['McConnell', 'Ross M.', ''], ['Pór', 'Attila', ''], ['Spinrad', 'Jeremy P.', '']]","['posets', 'preference relations', 'approximation algorithms']"
19366,1701.07382,Maged Eljazzar,"Maged M. Eljazzar, Mostafa Abdulhamid, Mahmoud Mouneer, and Ayman
  Salama",Hadith Web Browser Verification Extension,6 pages,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet users are more likely to ignore Internet content verification and
more likely to share the content. When it comes to Islamic content, it is
crucial to share and spread fake or inaccurate content. Even if the
verification process of Islamic content is becoming easier every day, the
Internet users generally ignore the verification step and jump into sharing the
content. How many clicks away from users results? , this is the common question
that is considered as a rule in modern website design. Internet users prefer
the results to come to their page rather than to navigate it on their own. This
paper presents a simple method of bringing hadith verification to the user web
browser using web browser plugin.
","[{'version': 'v1', 'created': 'Sun, 22 Jan 2017 23:51:39 GMT'}]",2017-01-26,"[['Eljazzar', 'Maged M.', ''], ['Abdulhamid', 'Mostafa', ''], ['Mouneer', 'Mahmoud', ''], ['Salama', 'Ayman', '']]","['Hadith Verification', 'Web browser Extension', 'Islamic Internet Content']"
19367,0806.0526,Pradorn Sureephong,"Pradorn Sureephong (LIESP, CAMT), Nopasit Chakpitak (CAMT), Yacine
  Ouzrout (LIESP), Abdelaziz Bouras (LIESP)",An Ontology-based Knowledge Management System for Industry Clusters,,"Dans Proceeding of International Conference on Advanced Design and
  Manufacture - International Conference on Advanced Design and Manufacture
  (ICADAM 2008), Sanya : Chine (2008)",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge-based economy forces companies in the nation to group together as a
cluster in order to maintain their competitiveness in the world market. The
cluster development relies on two key success factors which are knowledge
sharing and collaboration between the actors in the cluster. Thus, our study
tries to propose knowledge management system to support knowledge management
activities within the cluster. To achieve the objectives of this study,
ontology takes a very important role in knowledge management process in various
ways; such as building reusable and faster knowledge-bases, better way for
representing the knowledge explicitly. However, creating and representing
ontology create difficulties to organization due to the ambiguity and
unstructured of source of knowledge. Therefore, the objectives of this paper
are to propose the methodology to create and represent ontology for the
organization development by using knowledge engineering approach. The
handicraft cluster in Thailand is used as a case study to illustrate our
proposed methodology.
","[{'version': 'v1', 'created': 'Tue, 3 Jun 2008 12:38:50 GMT'}]",2008-12-18,"[['Sureephong', 'Pradorn', '', 'LIESP, CAMT'], ['Chakpitak', 'Nopasit', '', 'CAMT'], ['Ouzrout', 'Yacine', '', 'LIESP'], ['Bouras', 'Abdelaziz', '', 'LIESP']]","['Ontology', 'Semantic', 'Knowledge Management System', 'Industry Cluster']"
19368,1409.6241,Christian Lorenz Staudt,Elisabetta Bergamini and Henning Meyerhenke and Christian L. Staudt,Approximating Betweenness Centrality in Large Evolving Networks,17 pages,,,,cs.SI cs.DS physics.soc-ph,http://creativecommons.org/licenses/by/3.0/,"  Betweenness centrality ranks the importance of nodes by their participation
in all shortest paths of the network. Therefore computing exact betweenness
values is impractical in large networks. For static networks, approximation
based on randomly sampled paths has been shown to be significantly faster in
practice. However, for dynamic networks, no approximation algorithm for
betweenness centrality is known that improves on static recomputation. We
address this deficit by proposing two incremental approximation algorithms (for
weighted and unweighted connected graphs) which provide a provable guarantee on
the absolute approximation error. Processing batches of edge insertions, our
algorithms yield significant speedups up to a factor of $10^4$ compared to
restarting the approximation. This is enabled by investing memory to store and
efficiently update shortest paths. As a building block, we also propose an
asymptotically faster algorithm for updating the SSSP problem in unweighted
graphs. Our experimental study shows that our algorithms are the first to make
in-memory computation of a betweenness ranking practical for million-edge
semi-dynamic networks. Moreover, our results show that the accuracy is even
better than the theoretical guarantees in terms of absolutes errors and the
rank of nodes is well preserved, in particular for those with high betweenness.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 16:51:41 GMT'}]",2014-09-23,"[['Bergamini', 'Elisabetta', ''], ['Meyerhenke', 'Henning', ''], ['Staudt', 'Christian L.', '']]","['betweenness centrality', 'algorithmic network analysis', 'graph algorithms', 'approximation algorithms', 'shortest paths']"
19369,1510.04862,Dima Damen,"Dima Damen, Teesid Leelasawassuk, Walterio Mayol-Cuevas","You-Do, I-Learn: Unsupervised Multi-User egocentric Approach Towards
  Video-Based Guidance",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an unsupervised approach towards automatically extracting
video-based guidance on object usage, from egocentric video and wearable gaze
tracking, collected from multiple users while performing tasks. The approach i)
discovers task relevant objects, ii) builds a model for each, iii)
distinguishes different ways in which each discovered object has been used and
iv) discovers the dependencies between object interactions. The work
investigates using appearance, position, motion and attention, and presents
results using each and a combination of relevant features. Moreover, an online
scalable approach is presented and is compared to offline results. The paper
proposes a method for selecting a suitable video guide to be displayed to a
novice user indicating how to use an object, purely triggered by the user's
gaze. The potential assistive mode can also recommend an object to be used next
based on the learnt sequence of object interactions. The approach was tested on
a variety of daily tasks such as initialising a printer, preparing a coffee and
setting up a gym machine.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2015 12:32:26 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Mar 2016 17:44:58 GMT'}]",2016-03-22,"[['Damen', 'Dima', ''], ['Leelasawassuk', 'Teesid', ''], ['Mayol-Cuevas', 'Walterio', '']]","['Video Guidance', 'Real-time Computer Vision', 'Assistive Computing', 'Object Discovery', 'Object Usage']"
19370,1207.6371,Arindam Khan,"Arindam Khan, Prasad Raghavendra, Prasad Tetali and L\'aszl\'o A.
  V\'egh",On Mimicking Networks Representing Minimum Terminal Cuts,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a capacitated undirected graph $G=(V,E)$ with a set of terminals $K
\subset V$, a mimicking network is a smaller graph $H=(V_H,E_H)$ that exactly
preserves all the minimum cuts between the terminals. Specifically, the vertex
set of the sparsifier $V_H$ contains the set of terminals $K$ and for every
bipartition $U, K-U $ of the terminals $K$, the size of the minimum cut
separating $U$ from $K-U$ in $G$ is exactly equal to the size of the minimum
cut separating $U$ from $K-U$ in $H$.
  This notion of a mimicking network was introduced by Hagerup, Katajainen,
Nishimura and Ragde (1995) who also exhibited a mimicking network of size
$2^{2^{k}}$ for every graph with $k$ terminals. The best known lower bound on
the size of a mimicking network is linear in the number of terminals. More
precisely, the best known lower bound is $k+1$ for graphs with $k$ terminals
(Chaudhuri et al. 2000).
  In this work, we improve both the upper and lower bounds reducing the
doubly-exponential gap between them to a single-exponential gap. Specifically,
we obtain the following upper and lower bounds on mimicking networks: 1) Given
a graph $G$, we exhibit a construction of mimicking network with at most
$(|K|-1)$'th Dedekind number ($\approx 2^{{(k-1)} \choose {\lfloor {{(k-1)}/2}
\rfloor}}$) of vertices (independent of size of $V$). Furthermore, we show that
the construction is optimal among all {\it restricted mimicking networks} -- a
natural class of mimicking networks that are obtained by clustering vertices
together. 2) There exists graphs with $k$ terminals that have no mimicking
network of size smaller than $2^{\frac{k-1}{2}}$.
  We also exhibit improved constructions of mimicking networks for trees and
graphs of bounded tree-width.
","[{'version': 'v1', 'created': 'Thu, 26 Jul 2012 19:03:25 GMT'}]",2012-07-27,"[['Khan', 'Arindam', ''], ['Raghavendra', 'Prasad', ''], ['Tetali', 'Prasad', ''], ['Végh', 'László A.', '']]","['Approximation algorithms', 'Graph algorithms', 'Vertex sparsification', 'Cut sparsifier', 'Mimicking networks', 'Terminal cuts', 'Realizable external flow', 'Network flow']"
19371,0903.3900,Osman Ugus,"Osman Ugus, Dirk Westhoff, Ralf Laue, Abdulhadi Shoufan, and Sorin A.
  Huss","Optimized Implementation of Elliptic Curve Based Additive Homomorphic
  Encryption for Wireless Sensor Networks",,,,,cs.CR cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When deploying wireless sensor networks (WSNs) in public environments it may
become necessary to secure their data storage and transmission against possible
attacks such as node-compromise and eavesdropping. The nodes feature only small
computational and energy resources, thus requiring efficient algorithms. As a
solution for this problem the TinyPEDS approach was proposed in [7], which
utilizes the Elliptic Curve ElGamal (EC-ElGamal) cryptosystem for additive
homomorphic encryption allowing concealed data aggregation. This work presents
an optimized implementation of EC-ElGamal on a MicaZ mote, which is a typical
sensor node platform with 8-bit processor for WSNs. Compared to the best
previous result, our implementation is at least 44% faster for fixed-point
multiplication. Because most parts of the algorithm are similar to standard
Elliptic Curve algorithms, the results may be reused in other realizations on
constrained devices as well.
","[{'version': 'v1', 'created': 'Mon, 23 Mar 2009 16:43:01 GMT'}]",2009-03-24,"[['Ugus', 'Osman', ''], ['Westhoff', 'Dirk', ''], ['Laue', 'Ralf', ''], ['Shoufan', 'Abdulhadi', ''], ['Huss', 'Sorin A.', '']]","['Elliptic Curve Cryptography', 'Resource Constrained Devices', 'Wireless Sensor Networks']"
19372,0802.2306,Gareth Baxter,"G. J. Baxter, M. R. Frean",Software graphs and programmer awareness,"9 pages, 8 figures",,,,cs.SE cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dependencies between types in object-oriented software can be viewed as
directed graphs, with types as nodes and dependencies as edges. The in-degree
and out-degree distributions of such graphs have quite different forms, with
the former resembling a power-law distribution and the latter an exponential
distribution. This effect appears to be independent of application or type
relationship. A simple generative model is proposed to explore the proposition
that the difference arises because the programmer is aware of the out-degree of
a type but not of its in-degree. The model reproduces the two distributions,
and compares reasonably well to those observed in 14 different type
relationships across 12 different Java applications.
","[{'version': 'v1', 'created': 'Sat, 16 Feb 2008 03:38:03 GMT'}]",2008-02-19,"[['Baxter', 'G. J.', ''], ['Frean', 'M. R.', '']]","['networks', 'object-oriented programming', 'stochastic processes']"
19373,1209.0864,Chang-Hun Lee,"Chang-Hun Lee, Min-Guk Seo, Min-Jea Tahk, Jin-Ik Lee, and Byung-Eul
  Jun","Missile Acceleration Controller Design using PI and Time-Delay Adaptive
  Feedback Linearization Methodology","A condensed version of this draft has been submitted to European
  Control Conference (ECC) 2014",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A straight forward application of feedback linearization to the missile
autopilot design for acceleration control may be limited due to the nonminimum
characteristics and the model uncertainties. As a remedy, this paper presents a
cascade structure of an acceleration controller based on approximate feedback
linearization methodology with a time-delay adaptation scheme. The inner loop
controller is constructed by applying feedback linearization to the approximate
system which is a minimum phase system and provides the desired acceleration
signal caused by the angle-of-attack. This controller is augmented by the
time-delay adaptive law and the outer loop PI (proportional-integral)
controller in order to adaptively compensate for feedback linearization error
because of model uncertainty and in order to track the desired acceleration
signal. The performance of the proposed method is examined through numerical
simulations. Moreover, the proposed controller is tested by using an intercept
scenario in 6DOF nonlinear simulations.
","[{'version': 'v1', 'created': 'Wed, 5 Sep 2012 05:55:54 GMT'}, {'version': 'v2', 'created': 'Thu, 17 Oct 2013 12:02:37 GMT'}]",2013-10-18,"[['Lee', 'Chang-Hun', ''], ['Seo', 'Min-Guk', ''], ['Tahk', 'Min-Jea', ''], ['Lee', 'Jin-Ik', ''], ['Jun', 'Byung-Eul', '']]","['Missile autopilot', 'nonminimum phase', 'approximate feedback linearization', 'PI control', 'time-delay adaptive law']"
19374,1610.06511,James Wilson,"James D. Wilson, John Palowitch, Shankar Bhamidi, Andrew B. Nobel","Community extraction in multilayer networks with heterogeneous community
  structure","46 pages. Accepted at the Journal of Machine Learning Research
  (11/17)",,,,cs.SI physics.soc-ph stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multilayer networks are a useful way to capture and model multiple, binary or
weighted relationships among a fixed group of objects. While community
detection has proven to be a useful exploratory technique for the analysis of
single-layer networks, the development of community detection methods for
multilayer networks is still in its infancy. We propose and investigate a
procedure, called Multilayer Extraction, that identifies densely connected
vertex-layer sets in multilayer networks. Multilayer Extraction makes use of a
significance based score that quantifies the connectivity of an observed
vertex-layer set through comparison with a fixed degree random graph model.
Multilayer Extraction directly handles networks with heterogeneous layers where
community structure may be different from layer to layer. The procedure can
capture overlapping communities, as well as background vertex-layer pairs that
do not belong to any community. We establish consistency of the vertex-layer
set optimizer of our proposed multilayer score under the multilayer stochastic
block model. We investigate the performance of Multilayer Extraction on three
applications and a test bed of simulations. Our theoretical and numerical
evaluations suggest that Multilayer Extraction is an effective exploratory tool
for analyzing complex multilayer networks. Publicly available R software for
Multilayer Extraction is available at
https://github.com/jdwilson4/MultilayerExtraction.
","[{'version': 'v1', 'created': 'Thu, 20 Oct 2016 17:35:42 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Dec 2016 20:04:51 GMT'}, {'version': 'v3', 'created': 'Tue, 7 Nov 2017 22:09:34 GMT'}]",2017-11-09,"[['Wilson', 'James D.', ''], ['Palowitch', 'John', ''], ['Bhamidi', 'Shankar', ''], ['Nobel', 'Andrew B.', '']]","['community detection', 'clustering', 'multiplex networks', 'score based methods', 'modularity']"
19375,1501.05606,Reginald Smith,Reginald D. Smith,"A rapid algorithm to calculate joint probability matrices for joint
  entropies of arbitrary order",4 pages 1 figure,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is no closed form analytical equation or quick method to calculate
probabilities based only on the entropy of a signal or process. Except in the
cases where there are constraints on the state probabilities, one must
typically derive the underlying probabilities through search algorithms. These
become more computationally expensive as entropies of higher orders are
investigated. In this paper, a method to calculate a joint probability matrix
based on the entropy for any order is elaborated. With this method, only first
order entropies need to be successfully calculated while the others are derived
via multiplicative cascades.
","[{'version': 'v1', 'created': 'Sun, 30 Nov 2014 20:59:32 GMT'}]",2015-01-23,"[['Smith', 'Reginald D.', '']]","['joint entropy', 'multiplicative cascade', 'conditional entropy']"
19376,1108.1482,Nikolaos Triantafyllou,"Nikolaos Triantafyllou, Katerina Ksystra, Petros Stefaneas and
  Panayiotis Frangos",Applying Algebraic Specifications on Digital Right Management Systems,6 pages,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Digital Right Management (DRM) Systems have been created to meet the need for
digital content protection and distribution. In this paper we present some of
the directions of our ongoing research to apply algebraic specification
techniques on mobile DRM systems.
","[{'version': 'v1', 'created': 'Sat, 6 Aug 2011 13:54:17 GMT'}]",2011-08-09,"[['Triantafyllou', 'Nikolaos', ''], ['Ksystra', 'Katerina', ''], ['Stefaneas', 'Petros', ''], ['Frangos', 'Panayiotis', '']]","['DRM', 'Right Expression Languages', 'CafeOBJ', 'Institutions']"
19377,1602.06568,Martin Berger,"Martin Berger, Laurence Tratt, Christian Urban",Modelling homogeneous generative meta-programming,"ECOOP 2017, to appear",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Homogeneous generative meta-programming (HGMP) enables the generation of
program fragments at compile-time or run-time. We present the first
foundational calculus which can model powerful HGMP languages such as Template
Haskell. The calculus is designed such that we can gradually enhance it with
the features needed to model many of the advanced features of real languages.
As a demonstration of the flexibility of our approach, we also provide a simple
type system for the calculus.
","[{'version': 'v1', 'created': 'Sun, 21 Feb 2016 19:18:58 GMT'}, {'version': 'v2', 'created': 'Sun, 23 Apr 2017 18:35:46 GMT'}]",2017-04-25,"[['Berger', 'Martin', ''], ['Tratt', 'Laurence', ''], ['Urban', 'Christian', '']]","['Formal Methods', 'Meta-Programming', 'Operational Semantics', 'Types', 'Quasi-Quotes', 'Abstract Syntax Trees']"
19378,0711.3205,Caleb Lo,"Caleb K. Lo, Sriram Vishwanath and Robert W. Heath Jr","Relay Subset Selection in Wireless Networks Using Partial
  Decode-and-Forward Transmission","27 pages, 5 figures, submitted to the IEEE Transactions on Vehicular
  Technology, revised May 2008",,,,cs.IT math.IT,,"  This paper considers the problem of selecting a subset of nodes in a two-hop
wireless network to act as relays in aiding the communication between the
source-destination pair. Optimal relay subset selection with the objective of
maximizing the overall throughput is a difficult problem that depends on
multiple factors including node locations, queue lengths and power consumption.
A partial decode-and-forward strategy is applied in this paper to improve the
tractability of the relay selection problem and performance of the overall
network.
  Note that the number of relays selected ultimately determines the performance
of the network. This paper benchmarks this performance by determining the net
diversity achieved using the relays selected and the partial decode-and-forward
strategy. This framework is subsequently used to further transform relay
selection into a simpler relay placement problem, and two proximity-based
approximation algorithms are developed to determine the appropriate set of
relays to be selected in the network. Other selection strategies such as random
relay selection and a greedy algorithm that relies on channel state information
are also presented. This paper concludes by showing that the proposed
proximity-based relay selection strategies yield near-optimal expected rates
for a small number of selected relays.
","[{'version': 'v1', 'created': 'Tue, 20 Nov 2007 20:40:20 GMT'}, {'version': 'v2', 'created': 'Thu, 22 May 2008 21:53:27 GMT'}]",2008-05-23,"[['Lo', 'Caleb K.', ''], ['Vishwanath', 'Sriram', ''], ['Heath', 'Robert W.', 'Jr']]","['Greedy algorithms', 'partial decode-and-forward', 'superposition coding', 'relays']"
19379,1212.2654,Ozan Tonguz,"M. Kas, S. Appala, C. Wang, C. Carley, L. R. Carley, O. K. Tonguz","What if Routers Were Social? Analyzing Wireless Mesh Networks from a
  Social Networks Perspective","IEEE Wireless Communications, vol. 19, no. 6, December 2012",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless Mesh Networks (WMNs) consist of radio nodes organized in a mesh
topology for serving wireless mesh clients to communicate with one another or
to connect to the Internet. Nodes in a mesh network can communicate with each
other either directly or through one or more intermediate nodes, similar to
social networks. WMNs share many common properties with social networks. We
first identify the differences and similarities between social networks and
WMNs and then use metrics that are typically used for social network analysis
(SNA) to assess real WMNs. Analyzing real WMN data collected from the UCSB
MeshNet and MIT Roofnet testbeds reveals that using SNA metrics are helpful in
designing WMNs with better performance. We demonstrate the validity of our
conclusions and this new approach by focusing on two sample applications of
social networks: network reliability assessment and channel access scheduling.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2012 21:33:13 GMT'}]",2012-12-13,"[['Kas', 'M.', ''], ['Appala', 'S.', ''], ['Wang', 'C.', ''], ['Carley', 'C.', ''], ['Carley', 'L. R.', ''], ['Tonguz', 'O. K.', '']]","['Wireless Mesh Networks', 'Social Networks', 'Centrality Concept', 'Network Reliability', 'TDMA', 'Channel Access Scheduling']"
19380,0806.0130,Feng Xia,"Feng Xia, Youxian Sun, Yu-Chu Tian",Feedback Scheduling of Priority-Driven Control Networks,"To appear in Computer Standards and Interfaces;
  doi:10.1016/j.csi.2008.03.020",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With traditional open-loop scheduling of network resources, the
quality-of-control (QoC) of networked control systems (NCSs) may degrade
significantly in the presence of limited bandwidth and variable workload. The
goal of this work is to maximize the overall QoC of NCSs through dynamically
allocating available network bandwidth. Based on codesign of control and
scheduling, an integrated feedback scheduler is developed to enable flexible
QoC management in dynamic environments. It encompasses a cascaded feedback
scheduling module for sampling period adjustment and a direct feedback
scheduling module for priority modification. The inherent characteristics of
priority-driven control networks make it feasible to implement the proposed
feedback scheduler in real-world systems. Extensive simulations show that the
proposed approach leads to significant QoC improvement over the traditional
open-loop scheduling scheme under both underloaded and overloaded network
conditions.
","[{'version': 'v1', 'created': 'Sun, 1 Jun 2008 08:03:02 GMT'}]",2008-12-18,"[['Xia', 'Feng', ''], ['Sun', 'Youxian', ''], ['Tian', 'Yu-Chu', '']]","['Networked control systems', 'control networks', 'feedback scheduling', 'dynamic bandwidth allocation']"
19381,1701.04028,Boris Ryabko,"Boris Ryabko, Andrey Guskov, Irina Selivanova","Using data-compressors for statistical analysis of problems on
  homogeneity testing and classification",,,,,cs.IT math.IT math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays data compressors are applied to many problems of text analysis, but
many such applications are developed outside of the framework of mathematical
statistics. In this paper we overcome this obstacle and show how several
methods of classical mathematical statistics can be developed based on
applications of the data compressors.
","[{'version': 'v1', 'created': 'Sun, 15 Jan 2017 11:51:46 GMT'}]",2017-01-17,"[['Ryabko', 'Boris', ''], ['Guskov', 'Andrey', ''], ['Selivanova', 'Irina', '']]","['data compression', 'hypothesis testing', 'homogeneity test', 'classification', 'universal code']"
19382,1207.6474,Michael Kerber,"Herbert Edelsbrunner and Carl-Philipp Heisenberg and Michael Kerber
  and Gabriel Krens",The Medusa of Spatial Sorting: Topological Construction,,,,,cs.CG math.AT q-bio.CB q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the simultaneous movement of finitely many colored points in
space, calling it a spatial sorting process. The name suggests a purpose that
drives the collection to a configuration of increased or decreased order.
Mapping such a process to a subset of space-time, we use persistent homology
measurements of the time function to characterize the process topologically.
","[{'version': 'v1', 'created': 'Fri, 27 Jul 2012 07:33:28 GMT'}]",2012-07-30,"[['Edelsbrunner', 'Herbert', ''], ['Heisenberg', 'Carl-Philipp', ''], ['Kerber', 'Michael', ''], ['Krens', 'Gabriel', '']]","['Computational topology', 'persistent homology', 'alphacomplexes', 'spatial sorting', 'cell segregation']"
19383,1406.3117,Anh Nguyen,"Anh Nguyen, Amy Banic",Low-cost Augmented Reality prototype for controlling network devices,,,,,cs.HC cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the evolution of mobile devices, and smart-phones in particular, comes
the ability to create new experiences that enhance the way we see, interact,
and manipulate objects, within the world that surrounds us. It is now possible
to blend data from our senses and our devices in numerous ways that simply were
not possible before using Augmented Reality technology. In a near future, when
all of the office devices as well as your personal electronic gadgets are on a
common wireless network, operating them using a universal remote controller
would be possible. This paper presents an off-the-shelf, low-cost prototype
that leverages the Augmented Reality technology to deliver a novel and
interactive way of operating office network devices around using a mobile
device. We believe this type of system may provide benefits to controlling
multiple integrated devices and visualizing interconnectivity or utilizing
visual elements to pass information from one device to another, or may be
especially beneficial to control devices when interacting with them physically
may be difficult or pose danger or harm.
","[{'version': 'v1', 'created': 'Thu, 12 Jun 2014 04:46:32 GMT'}]",2014-06-13,"[['Nguyen', 'Anh', ''], ['Banic', 'Amy', '']]","['Augmented Reality', 'network device', 'mobile device']"
19384,1109.1583,Trong Duong Quoc,"Trong Duong Quoc, Heiko Perkuhn, Daniel Catrein, Uwe Naumann and Toni
  Anwar","Optimization and Evaluation of a Multimedia Streaming Service on Hybrid
  Telco cloud","20 pages; International Journal on Cloud Computing: Services and
  Architecture (IJCCSA), 2011",,,,cs.DC cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With recent developments in cloud computing, a paradigm shift from rather
static deployment of resources to more dynamic, on-demand practices means more
flexibility and better utilization of resources. This demands new ways to
efficiently configure networks.
  In this paper, we will characterize a class of competitive cloud services
that telecom operators could provide based on the characteristics of telecom
infrastructure through an applicable streaming service architecture. Then, we
will model this architecture as a cost-based mathematic model. This model
provides a tool to evaluate and compare the cost of software services for
different telecom network topologies and deployment strategies. Additionally,
with each topology it acts as a means to characterize the deployment solution
that yields the lowest resource usage over the entire network. These
applications are illustrated through numerical analysis. Finally, a
proof-of-concept prototype is deployed to shows dynamic properties of the
service in the architecture and the model above.
","[{'version': 'v1', 'created': 'Wed, 7 Sep 2011 21:34:26 GMT'}]",2011-09-09,"[['Quoc', 'Trong Duong', ''], ['Perkuhn', 'Heiko', ''], ['Catrein', 'Daniel', ''], ['Naumann', 'Uwe', ''], ['Anwar', 'Toni', '']]","['Telco Cloud', 'Hybrid Cloud', 'Multimedia Streaming', 'Dynamic Scaling', 'Content Distribution', 'Optimization']"
19385,1305.6862,Loet Leydesdorff,Loet Leydesdorff and Ping Zhou,"Measuring the Knowledge-Based Economy of China in terms of Synergy among
  Technological, Organizational, and Geographic Attributes of Firms","accepted for publication in Scientometrics (October, 2013)",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using the possible synergy among geographic, size, and technological
distributions of firms in the Orbis database, we find the greatest reduction of
uncertainty at the level of the 31 provinces of China, and an additional 18.0%
at the national level. Some of the coastal provinces stand out as expected, but
the metropolitan areas of Beijing and Shanghai are (with Tianjan and Chonqing)
most pronounced at the next-lower administrative level of (339) prefectures,
since these four metropoles are administratively defined at both levels.
Focusing on high- and medium-tech manufacturing, a shift toward Beijing and
Shanghai is indicated, and the synergy is on average enhanced (as expected; but
not for all provinces). Unfortunately, the Orbis data is incomplete since it
was collected for commercial and not for administrative or governmental
purposes. However, we show a methodology that can be used by others who may
have access to higher-quality statistical data for the measurement.
","[{'version': 'v1', 'created': 'Mon, 27 May 2013 13:48:14 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Sep 2013 09:48:55 GMT'}, {'version': 'v3', 'created': 'Tue, 29 Oct 2013 14:11:57 GMT'}]",2013-10-30,"[['Leydesdorff', 'Loet', ''], ['Zhou', 'Ping', '']]","['China', 'knowledge base', 'triple helix', 'synergy', 'entropy']"
19386,1010.4952,Mikael Fernandus Simalango,"Mikael Fernandus Simalango, Mun-Young Kang and Sangyoon Oh","Towards Constraint-based High Performance Cloud System in the Process of
  Cloud Computing Adoption in an Organization","11 pages, 5 figures; Proceedings of 1st KIITA Conference on Smart
  Enterprise, Seoul, South Korea, October 21st, 2010, pp. 45-55",,,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Cloud computing is penetrating into various domains and environments, from
theoretical computer science to economy, from marketing hype to educational
curriculum and from R&D lab to enterprise IT infrastructure. Yet, the currently
developing state of cloud computing leaves several issues to address and also
affects cloud computing adoption by organizations. In this paper, we explain
how the transition into the cloud can occur in an organization and describe the
mechanism for transforming legacy infrastructure into a virtual
infrastructure-based cloud. We describe the state of the art of infrastructural
cloud, which is essential in the decision making on cloud adoption, and
highlight the challenges that can limit the scale and speed of the adoption. We
then suggest a strategic framework for designing a high performance cloud
system. This framework is applicable when transformation cloudbased deployment
model collides with some constraints. We give an example of the implementation
of the framework in a design of a budget-constrained high availability cloud
system.
","[{'version': 'v1', 'created': 'Sun, 24 Oct 2010 12:08:12 GMT'}]",2010-10-26,"[['Simalango', 'Mikael Fernandus', ''], ['Kang', 'Mun-Young', ''], ['Oh', 'Sangyoon', '']]","['cloud computing', 'IT infrastructure transformation', 'high performance', 'high availability']"
19387,1307.4127,Atta ur Rehman Khan,"Atta ur Rehman Khan, Shahzad Ali, Saad Mustafa, Mazliza Othman","Impact of mobility models on clustering based routing protocols in
  mobile WSNs",,,,,cs.NI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents comparison of different hierarchical (position and
non-position based) protocols with respect to different mobility models.
Previous work mainly focuses on static networks or at most a single mobility
model. Using only one mobility model may not predict the behavior of routing
protocol accurately. Simulation results show that mobility has large impact on
the behavior of WSN routing protocols. Also, position based routing protocols
performs better in terms of packet delivery compared to non position based
routing protocols.
","[{'version': 'v1', 'created': 'Mon, 15 Jul 2013 22:56:25 GMT'}]",2013-07-17,"[['Khan', 'Atta ur Rehman', ''], ['Ali', 'Shahzad', ''], ['Mustafa', 'Saad', ''], ['Othman', 'Mazliza', '']]","['Mobile wireless sensor networks', 'clustering', 'mobility models', 'WSN routing protocols']"
19388,1210.0260,Saket Saurabh,"Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh and
  Ond\v{r}ej Such\'y",Parameterized Complexity of Directed Steiner Tree on Sparse Graphs,28,,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the parameterized complexity of the directed variant of the
classical {\sc Steiner Tree} problem on various classes of directed sparse
graphs. While the parameterized complexity of {\sc Steiner Tree} parameterized
by the number of terminals is well understood, not much is known about the
parameterization by the number of non-terminals in the solution tree. All that
is known for this parameterization is that both the directed and the undirected
versions are W[2]-hard on general graphs, and hence unlikely to be fixed
parameter tractable FPT. The undirected {\sc Steiner Tree} problem becomes FPT
when restricted to sparse classes of graphs such as planar graphs, but the
techniques used to show this result break down on directed planar graphs.
  In this article we precisely chart the tractability border for {\sc Directed
Steiner Tree} (DST) on sparse graphs parameterized by the number of
non-terminals in the solution tree. Specifically, we show that the problem is
fixed parameter tractable on graphs excluding a topological minor, but becomes
W[2]-hard on graphs of degeneracy 2. On the other hand we show that if the
subgraph induced by the terminals is required to be acyclic then the problem
becomes FPT on graphs of bounded degeneracy.
  We further show that our algorithm achieves the best possible running time
dependence on the solution size and degeneracy of the input graph, under
standard complexity theoretic assumptions. Using the ideas developed for DST,
we also obtain improved algorithms for {\sc Dominating Set} on sparse
undirected graphs. These algorithms are asymptotically optimal.
","[{'version': 'v1', 'created': 'Mon, 1 Oct 2012 00:04:55 GMT'}]",2012-10-02,"[['Jones', 'Mark', ''], ['Lokshtanov', 'Daniel', ''], ['Ramanujan', 'M. S.', ''], ['Saurabh', 'Saket', ''], ['Suchý', 'Ondřej', '']]","['Algorithms and data structures', 'Graph Algorithms', 'Parameterized Algorithms', 'Steiner Tree problem', 'Sparse Graph classes']"
19389,1710.05627,Wei Gao,"Wei Gao and David Hsu and Wee Sun Lee and Shengmei Shen and Karthikk
  Subramanian","Intention-Net: Integrating Planning and Deep Learning for Goal-Directed
  Autonomous Navigation",Published in 1st Annual Conference on Robot Learning (CoRL 2017),,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  How can a delivery robot navigate reliably to a destination in a new office
building, with minimal prior information? To tackle this challenge, this paper
introduces a two-level hierarchical approach, which integrates model-free deep
learning and model-based path planning. At the low level, a neural-network
motion controller, called the intention-net, is trained end-to-end to provide
robust local navigation. The intention-net maps images from a single monocular
camera and ""intentions"" directly to robot controls. At the high level, a path
planner uses a crude map, e.g., a 2-D floor plan, to compute a path from the
robot's current location to the goal. The planned path provides intentions to
the intention-net. Preliminary experiments suggest that the learned motion
controller is robust against perceptual uncertainty and by integrating with a
path planner, it generalizes effectively to new environments and goals.
","[{'version': 'v1', 'created': 'Mon, 16 Oct 2017 11:22:32 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Oct 2017 02:24:06 GMT'}]",2017-10-18,"[['Gao', 'Wei', ''], ['Hsu', 'David', ''], ['Lee', 'Wee Sun', ''], ['Shen', 'Shengmei', ''], ['Subramanian', 'Karthikk', '']]","['Visual navigation', 'deep Learning', 'imitation learning', 'path planning']"
19390,0907.5141,Haipeng Zheng,"Haipeng Zheng, Sanjeev R. Kulkarni, H. Vincent Poor","Cooperative Training for Attribute-Distributed Data: Trade-off Between
  Data Transmission and Performance",,Proceedings of IEEE Fusion 2009,,,cs.DC cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a modeling framework for distributed regression with
agents/experts observing attribute-distributed data (heterogeneous data). Under
this model, a new algorithm, the iterative covariance optimization algorithm
(ICOA), is designed to reshape the covariance matrix of the training residuals
of individual agents so that the linear combination of the individual
estimators minimizes the ensemble training error. Moreover, a scheme (Minimax
Protection) is designed to provide a trade-off between the number of data
instances transmitted among the agents and the performance of the ensemble
estimator without undermining the convergence of the algorithm. This scheme
also provides an upper bound (with high probability) on the test error of the
ensemble estimator. The efficacy of ICOA combined with Minimax Protection and
the comparison between the upper bound and actual performance are both
demonstrated by simulations.
","[{'version': 'v1', 'created': 'Wed, 29 Jul 2009 14:20:08 GMT'}]",2009-07-30,"[['Zheng', 'Haipeng', ''], ['Kulkarni', 'Sanjeev R.', ''], ['Poor', 'H. Vincent', '']]","['Distributed learning', 'heterogeneous data', 'cooperative training']"
19391,1206.0447,Sugata Sanyal,"K. Ganesh, M. Thrivikraman, Joy Kuri, Haresh Dagale, G. Sudhakar,
  Sugata Sanyal",Implementation of a Real Time Passenger Information System,"14 pages, 11 figures, 2 tables",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intelligent Transportation Systems (ITS) are gaining recognition in
developing countries like India. This paper describes the various components of
our prototype implementation of a Real-time Passenger Information System
(RTPIS) for a public transport system like a fleet of buses. Vehicle-mounted
units, bus station units and a server located at the transport company premises
comprise the system. The vehicle unit reports the current position of the
vehicle to a central server periodically via General Packet Radio Service
(GPRS). An Estimated Time of Arrival (ETA) algorithm running on the server
predicts the arrival times of buses at their stops based on real-time
observations of the buses' current Global Positioning System (GPS) coordinates.
This information is displayed and announced to passengers at stops using
station units, which periodically fetch the required ETA from the server via
GPRS. Novel features of our prototype include: (a) a route creator utility
which automatically creates new routes from scratch when a bus is driven along
the new route, and (b) voice tagging of stops and points of interest along any
route. Besides, the prototype provides: (i) web-based applications for
passengers, providing useful information like a snapshot of present bus
locations on the streets, and (ii) web-based analysis tools for the transport
authority, providing information useful for fleet management, like number of
trips undertaken by a specific bus. The prototype has been demonstrated in a
campus environment, with four-wheelers and two-wheelers emulating buses. The
automatic real-time passenger information system has the potential of making
the public transport system an attractive alternative for city-dwellers,
thereby contributing to fewer private vehicles on the road, leading to lower
congestion levels and less pollution.
","[{'version': 'v1', 'created': 'Sun, 3 Jun 2012 13:55:10 GMT'}]",2012-06-05,"[['Ganesh', 'K.', ''], ['Thrivikraman', 'M.', ''], ['Kuri', 'Joy', ''], ['Dagale', 'Haresh', ''], ['Sudhakar', 'G.', ''], ['Sanyal', 'Sugata', '']]","['Passenger Information Systems', 'Estimated Time of Arrival (ETA)', 'General Packet Radio Service']"
19392,1602.07566,Andrea Burattin,"Mirko Polato, Alessandro Sperduti, Andrea Burattin, Massimiliano de
  Leoni",Time and Activity Sequence Prediction of Business Process Instances,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ability to know in advance the trend of running process instances, with
respect to different features, such as the expected completion time, would
allow business managers to timely counteract to undesired situations, in order
to prevent losses. Therefore, the ability to accurately predict future features
of running business process instances would be a very helpful aid when managing
processes, especially under service level agreement constraints. However,
making such accurate forecasts is not easy: many factors may influence the
predicted features.
  Many approaches have been proposed to cope with this problem but all of them
assume that the underling process is stationary. However, in real cases this
assumption is not always true. In this work we present new methods for
predicting the remaining time of running cases. In particular we propose a
method, assuming process stationarity, which outperforms the state-of-the-art
and two other methods which are able to make predictions even with
non-stationary processes. We also describe an approach able to predict the full
sequence of activities that a running case is going to take. All these methods
are extensively evaluated on two real case studies.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2016 15:42:06 GMT'}]",2016-02-25,"[['Polato', 'Mirko', ''], ['Sperduti', 'Alessandro', ''], ['Burattin', 'Andrea', ''], ['de Leoni', 'Massimiliano', '']]","['process mining', 'prediction', 'remaining time', 'machine learning']"
19393,1406.5917,Mohamed Salah  Gouider Dr,"Abdelwaheb Ferchichi, Mohamed Salah Gouider","BSTree: an Incremental Indexing Structure for Similarity Search and Real
  Time Monitoring of Data Streams",,"Future Information Technology Lecture Notes in Electrical
  Engineering Volume 276, 2014, pp 185-190",,,cs.DB,http://creativecommons.org/licenses/by/3.0/,"  In this work, a new indexing technique of data streams called BSTree is
proposed. This technique uses the method of data discretization, SAX [4], to
reduce online the dimensionality of data streams. It draws on Btree to build
the index and finally uses an LRV (least Recently visited) pruning technique to
rid the index structure from data whose last visit time exceeds a threshold
value and thus minimizes response time for similarity search queries.
","[{'version': 'v1', 'created': 'Mon, 23 Jun 2014 14:21:13 GMT'}]",2014-06-24,"[['Ferchichi', 'Abdelwaheb', ''], ['Gouider', 'Mohamed Salah', '']]","['incremental indexing', 'mining data streams', 'similarity search', 'dimensionality reduction', 'symbolic representation']"
19394,1707.09324,Sylwia Polberg,Sylwia Polberg and Anthony Hunter,"Empirical Evaluation of Abstract Argumentation: Supporting the Need for
  Bipolar and Probabilistic Approaches",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In dialogical argumentation it is often assumed that the involved parties
always correctly identify the intended statements posited by each other,
realize all of the associated relations, conform to the three acceptability
states (accepted, rejected, undecided), adjust their views when new and correct
information comes in, and that a framework handling only attack relations is
sufficient to represent their opinions. Although it is natural to make these
assumptions as a starting point for further research, removing them or even
acknowledging that such removal should happen is more challenging for some of
these concepts than for others. Probabilistic argumentation is one of the
approaches that can be harnessed for more accurate user modelling. The
epistemic approach allows us to represent how much a given argument is believed
by a given person, offering us the possibility to express more than just three
agreement states. It is equipped with a wide range of postulates, including
those that do not make any restrictions concerning how initial arguments should
be viewed, thus potentially being more adequate for handling beliefs of the
people that have not fully disclosed their opinions in comparison to Dung's
semantics. The constellation approach can be used to represent the views of
different people concerning the structure of the framework we are dealing with,
including cases in which not all relations are acknowledged or when they are
seen differently than intended. Finally, bipolar argumentation frameworks can
be used to express both positive and negative relations between arguments. In
this paper we describe the results of an experiment in which participants
judged dialogues in terms of agreement and structure. We compare our findings
with the aforementioned assumptions as well as with the constellation and
epistemic approaches to probabilistic argumentation and bipolar argumentation.
","[{'version': 'v1', 'created': 'Fri, 28 Jul 2017 16:51:00 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Dec 2017 14:38:56 GMT'}]",2017-12-11,"[['Polberg', 'Sylwia', ''], ['Hunter', 'Anthony', '']]","['Dialogical argumentation', 'probabilistic argumentation', 'abstract argumentation']"
19395,1209.5208,Martin Beck,"Martin Beck, Florian Kerschbaum","Approximate Two-Party Privacy-Preserving String Matching with Linear
  Complexity","6 pages, 4 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consider two parties who want to compare their strings, e.g., genomes, but do
not want to reveal them to each other. We present a system for
privacy-preserving matching of strings, which differs from existing systems by
providing a deterministic approximation instead of an exact distance. It is
efficient (linear complexity), non-interactive and does not involve a third
party which makes it particularly suitable for cloud computing. We extend our
protocol, such that it mitigates iterated differential attacks proposed by
Goodrich. Further an implementation of the system is evaluated and compared
against current privacy-preserving string matching algorithms.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2012 09:35:50 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Feb 2013 11:01:00 GMT'}]",2013-02-13,"[['Beck', 'Martin', ''], ['Kerschbaum', 'Florian', '']]","['privacy-preserving string comparison', 'approximate string matching', 'homomorphic encryption', 'variable length grams', 'linear complexity']"
19396,1708.01141,Jelmer Wolterink,"Jelmer M. Wolterink and Tim Leiner and Max A. Viergever and Ivana
  Isgum","Automatic Segmentation and Disease Classification Using Cardiac Cine MR
  Images",Accepted in STACOM Automated Cardiac Diagnosis Challenge 2017,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Segmentation of the heart in cardiac cine MR is clinically used to quantify
cardiac function. We propose a fully automatic method for segmentation and
disease classification using cardiac cine MR images. A convolutional neural
network (CNN) was designed to simultaneously segment the left ventricle (LV),
right ventricle (RV) and myocardium in end-diastole (ED) and end-systole (ES)
images. Features derived from the obtained segmentations were used in a Random
Forest classifier to label patients as suffering from dilated cardiomyopathy,
hypertrophic cardiomyopathy, heart failure following myocardial infarction,
right ventricular abnormality, or no cardiac disease. The method was developed
and evaluated using a balanced dataset containing images of 100 patients, which
was provided in the MICCAI 2017 automated cardiac diagnosis challenge (ACDC).
The segmentation and classification pipeline were evaluated in a four-fold
stratified cross-validation. Average Dice scores between reference and
automatically obtained segmentations were 0.94, 0.88 and 0.87 for the LV, RV
and myocardium. The classifier assigned 91% of patients to the correct disease
category. Segmentation and disease classification took 5 s per patient. The
results of our study suggest that image-based diagnosis using cine MR cardiac
scans can be performed automatically with high accuracy.
","[{'version': 'v1', 'created': 'Thu, 3 Aug 2017 13:55:24 GMT'}]",2017-08-04,"[['Wolterink', 'Jelmer M.', ''], ['Leiner', 'Tim', ''], ['Viergever', 'Max A.', ''], ['Isgum', 'Ivana', '']]","['Deep learning', 'Random Forest', 'Convolutional neural networks', 'Cardiac MR', 'Automatic diagnosis']"
19397,1710.01934,Anselm Haak,"Arnaud Durand, Anselm Haak, Heribert Vollmer","Model-Theoretic Characterizations of Boolean and Arithmetic Circuit
  Classes of Small Depth",,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we give a characterization of both Boolean and arithmetic
circuit classes of logarithmic depth in the vein of descriptive complexity
theory, i.e., the Boolean classes $\textrm{NC}^1$, $\textrm{SAC}^1$ and
$\textrm{AC}^1$ as well as their arithmetic counterparts $\#\textrm{NC}^1$,
$\#\textrm{SAC}^1$ and $\#\textrm{AC}^1$. We build on Immerman's
characterization of constant-depth polynomial-size circuits by formulas of
first-order logic, i.e., $\textrm{AC}^0 = \textrm{FO}$, and augment the logical
language with an operator for defining relations in an inductive way.
Considering slight variations of the new operator, we obtain uniform
characterizations of the three just mentioned Boolean classes. The arithmetic
classes can then be characterized by functions counting winning strategies in
semantic games for formulas characterizing languages in the corresponding
Boolean class.
","[{'version': 'v1', 'created': 'Thu, 5 Oct 2017 09:23:29 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Oct 2017 06:01:41 GMT'}]",2017-10-09,"[['Durand', 'Arnaud', ''], ['Haak', 'Anselm', ''], ['Vollmer', 'Heribert', '']]","['finite model theory', 'descriptive complexity', 'arithmetic circuits', 'countingclasses']"
19398,1506.03681,Fatema Akhter,Fatema Akhter,A Novel Approach for Image Steganography in Spatial Domain,,"Global Journal of Computer Science and Technology, Volume 13,
  Issue 7, pp. 1-6 Year 2013",,,cs.MM cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new approach for hiding information in digital image in
spatial domain. In this approach three bits of message is embedded in a pixel
using Lucas number system but only one bit plane is allowed for alternation.
The experimental results show that the proposed method has the larger capacity
of embedding data, high peak signal to noise ratio compared to existing methods
and is hardly detectable for steganolysis algorithm.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2015 14:05:45 GMT'}]",2015-06-12,"[['Akhter', 'Fatema', '']]","['steganography', 'steganolysis', 'cover image', 'stego image', 'lucas number']"
19399,1412.7994,Noah Stephens-Davidowitz,"Divesh Aggarwal and Daniel Dadush and Oded Regev and Noah
  Stephens-Davidowitz","Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian
  Sampling",,STOC 2015,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give a randomized $2^{n+o(n)}$-time and space algorithm for solving the
Shortest Vector Problem (SVP) on n-dimensional Euclidean lattices. This
improves on the previous fastest algorithm: the deterministic
$\widetilde{O}(4^n)$-time and $\widetilde{O}(2^n)$-space algorithm of
Micciancio and Voulgaris (STOC 2010, SIAM J. Comp. 2013).
  In fact, we give a conceptually simple algorithm that solves the (in our
opinion, even more interesting) problem of discrete Gaussian sampling (DGS).
More specifically, we show how to sample $2^{n/2}$ vectors from the discrete
Gaussian distribution at any parameter in $2^{n+o(n)}$ time and space. (Prior
work only solved DGS for very large parameters.) Our SVP result then follows
from a natural reduction from SVP to DGS. We also show that our DGS algorithm
implies a $2^{n + o(n)}$-time algorithm that approximates the Closest Vector
Problem to within a factor of $1.97$.
  In addition, we give a more refined algorithm for DGS above the so-called
smoothing parameter of the lattice, which can generate $2^{n/2}$ discrete
Gaussian samples in just $2^{n/2+o(n)}$ time and space. Among other things,
this implies a $2^{n/2+o(n)}$-time and space algorithm for $1.93$-approximate
decision SVP.
","[{'version': 'v1', 'created': 'Fri, 26 Dec 2014 21:36:03 GMT'}, {'version': 'v2', 'created': 'Wed, 31 Dec 2014 07:44:03 GMT'}, {'version': 'v3', 'created': 'Sat, 9 May 2015 14:46:21 GMT'}, {'version': 'v4', 'created': 'Wed, 20 May 2015 01:33:50 GMT'}, {'version': 'v5', 'created': 'Tue, 15 Sep 2015 17:47:49 GMT'}]",2019-01-28,"[['Aggarwal', 'Divesh', ''], ['Dadush', 'Daniel', ''], ['Regev', 'Oded', ''], ['Stephens-Davidowitz', 'Noah', '']]","['Discrete Gaussian', 'Shortest Vector Problem', 'Lattice Problems']"
19400,0903.0520,Francesco Pasquale,"Andrea E.F. Clementi, Francesco Pasquale, and Riccardo Silvestri",MANETS: High mobility can make up for low transmission power,18 pages,,,,cs.DM cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a Mobile Ad-hoc NETworks (MANET) formed by ""n"" nodes that move
independently at random over a finite square region of the plane. Nodes
exchange data if they are at distance at most ""r"" within each other, where r>0
is the node transmission radius. The ""flooding time"" is the number of time
steps required to broadcast a message from a source node to every node of the
network. Flooding time is an important measure of the speed of information
spreading in dynamic networks.
  We derive a nearly-tight upper bound on the flooding time which is a
decreasing function of the maximal ""velocity"" of the nodes. It turns out that,
when the node velocity is sufficiently high, even if the node transmission
radius ""r"" is far below the ""connectivity threshold"", the flooding time does
not asymptotically depend on ""r"". This implies that flooding can be very fast
even though every ""snapshot"" (i.e. the static random geometric graph at any
fixed time) of the MANET is fully disconnected. Data reach all nodes quickly
despite these ones use very low transmission power.
  Our result is the first analytical evidence of the fact that high, random
node mobility strongly speed-up information spreading and, at the same time,
let nodes save energy.
","[{'version': 'v1', 'created': 'Tue, 3 Mar 2009 12:50:27 GMT'}]",2009-03-04,"[['Clementi', 'Andrea E. F.', ''], ['Pasquale', 'Francesco', ''], ['Silvestri', 'Riccardo', '']]","['Mobile Ad-Hoc Networks', 'Evolving Graphs', 'Random Processes', 'Flooding']"
19401,1606.04275,Michiel Stock,"Michiel Stock and Tapio Pahikkala and Antti Airola and Bernard De
  Baets and Willem Waegeman","Efficient Pairwise Learning Using Kernel Ridge Regression: an Exact
  Two-Step Method",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pairwise learning or dyadic prediction concerns the prediction of properties
for pairs of objects. It can be seen as an umbrella covering various machine
learning problems such as matrix completion, collaborative filtering,
multi-task learning, transfer learning, network prediction and zero-shot
learning. In this work we analyze kernel-based methods for pairwise learning,
with a particular focus on a recently-suggested two-step method. We show that
this method offers an appealing alternative for commonly-applied
Kronecker-based methods that model dyads by means of pairwise feature
representations and pairwise kernels. In a series of theoretical results, we
establish correspondences between the two types of methods in terms of linear
algebra and spectral filtering, and we analyze their statistical consistency.
In addition, the two-step method allows us to establish novel algorithmic
shortcuts for efficient training and validation on very large datasets. Putting
those properties together, we believe that this simple, yet powerful method can
become a standard tool for many problems. Extensive experimental results for a
range of practical settings are reported.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2016 09:38:18 GMT'}]",2016-06-15,"[['Stock', 'Michiel', ''], ['Pahikkala', 'Tapio', ''], ['Airola', 'Antti', ''], ['De Baets', 'Bernard', ''], ['Waegeman', 'Willem', '']]","['dyadic prediction', 'pairwise learning', 'transfer learning', 'kernel ridge regression', 'kernel methods', 'zero-shot learning']"
19402,1412.6953,Benjamin Mate Gyori,"Benjamin M. Gyori, Bing Liu, Soumya Paul, R. Ramanathan, P.S.
  Thiagarajan",Approximate probabilistic verification of hybrid systems,,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hybrid systems whose mode dynamics are governed by non-linear ordinary
differential equations (ODEs) are often a natural model for biological
processes. However such models are difficult to analyze. To address this, we
develop a probabilistic analysis method by approximating the mode transitions
as stochastic events. We assume that the probability of making a mode
transition is proportional to the measure of the set of pairs of time points
and value states at which the mode transition is enabled. To ensure a sound
mathematical basis, we impose a natural continuity property on the non-linear
ODEs. We also assume that the states of the system are observed at discrete
time points but that the mode transitions may take place at any time between
two successive discrete time points. This leads to a discrete time Markov chain
as a probabilistic approximation of the hybrid system. We then show that for
BLTL (bounded linear time temporal logic) specifications the hybrid system
meets a specification iff its Markov chain approximation meets the same
specification with probability $1$. Based on this, we formulate a sequential
hypothesis testing procedure for verifying -approximately- that the Markov
chain meets a BLTL specification with high probability. Our case studies on
cardiac cell dynamics and the circadian rhythm indicate that our scheme can be
applied in a number of realistic settings.
","[{'version': 'v1', 'created': 'Mon, 22 Dec 2014 12:27:17 GMT'}, {'version': 'v2', 'created': 'Sat, 20 Jun 2015 03:56:27 GMT'}]",2015-06-23,"[['Gyori', 'Benjamin M.', ''], ['Liu', 'Bing', ''], ['Paul', 'Soumya', ''], ['Ramanathan', 'R.', ''], ['Thiagarajan', 'P. S.', '']]","['hybrid systems', 'Markov chains', 'dynamical systems', 'statistical modelchecking']"
19403,1506.08988,Francisco Igual,"Sandra Catal\'an, Francisco D. Igual, Rafael Mayo, Rafael
  Rodr\'iguez-S\'anchez and Enrique S. Quintana-Ort\'i","Architecture-Aware Configuration and Scheduling of Matrix Multiplication
  on Asymmetric Multicore Processors",,,,,cs.PF cs.DC cs.MS cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Asymmetric multicore processors (AMPs) have recently emerged as an appealing
technology for severely energy-constrained environments, especially in mobile
appliances where heterogeneity in applications is mainstream. In addition,
given the growing interest for low-power high performance computing, this type
of architectures is also being investigated as a means to improve the
throughput-per-Watt of complex scientific applications.
  In this paper, we design and embed several architecture-aware optimizations
into a multi-threaded general matrix multiplication (gemm), a key operation of
the BLAS, in order to obtain a high performance implementation for ARM
big.LITTLE AMPs. Our solution is based on the reference implementation of gemm
in the BLIS library, and integrates a cache-aware configuration as well as
asymmetric--static and dynamic scheduling strategies that carefully tune and
distribute the operation's micro-kernels among the big and LITTLE cores of the
target processor. The experimental results on a Samsung Exynos 5422, a
system-on-chip with ARM Cortex-A15 and Cortex-A7 clusters that implements the
big.LITTLE model, expose that our cache-aware versions of gemm with asymmetric
scheduling attain important gains in performance with respect to its
architecture-oblivious counterparts while exploiting all the resources of the
AMP to deliver considerable energy efficiency.
","[{'version': 'v1', 'created': 'Tue, 30 Jun 2015 08:35:15 GMT'}]",2015-07-01,"[['Catalán', 'Sandra', ''], ['Igual', 'Francisco D.', ''], ['Mayo', 'Rafael', ''], ['Rodríguez-Sánchez', 'Rafael', ''], ['Quintana-Ortí', 'Enrique S.', '']]","['Matrix multiplication', 'asymmetric multicore processors', 'memory hierarchy', 'scheduling', 'multi-threading', 'high performancecomputing']"
19404,1712.05914,Thai Hoang Dinh DTH,"Khoi Khac Nguyen, Dinh Thai Hoang, Dusit Niyato, Ping Wang, Diep
  Nguyen, and Eryk Dutkiewicz","Cyberattack Detection in Mobile Cloud Computing: A Deep Learning
  Approach","6 pages, 3 figures, 1 table, WCNC 2018 conference",,,,cs.CR cs.DC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rapid growth of mobile applications and cloud computing, mobile
cloud computing has attracted great interest from both academia and industry.
However, mobile cloud applications are facing security issues such as data
integrity, users' confidentiality, and service availability. A preventive
approach to such problems is to detect and isolate cyber threats before they
can cause serious impacts to the mobile cloud computing system. In this paper,
we propose a novel framework that leverages a deep learning approach to detect
cyberattacks in mobile cloud environment. Through experimental results, we show
that our proposed framework not only recognizes diverse cyberattacks, but also
achieves a high accuracy (up to 97.11%) in detecting the attacks. Furthermore,
we present the comparisons with current machine learning-based approaches to
demonstrate the effectiveness of our proposed solution.
","[{'version': 'v1', 'created': 'Sat, 16 Dec 2017 07:24:55 GMT'}]",2017-12-19,"[['Nguyen', 'Khoi Khac', ''], ['Hoang', 'Dinh Thai', ''], ['Niyato', 'Dusit', ''], ['Wang', 'Ping', ''], ['Nguyen', 'Diep', ''], ['Dutkiewicz', 'Eryk', '']]","['Cybersecurity', 'cyberattack', 'intrusion detection', 'mobile cloud', 'deep learning']"
19405,1610.01687,Zifan Li,"Zifan Li, Ambuj Tewari",Sampled Fictitious Play is Hannan Consistent,,,,,cs.GT cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fictitious play is a simple and widely studied adaptive heuristic for playing
repeated games. It is well known that fictitious play fails to be Hannan
consistent. Several variants of fictitious play including regret matching,
generalized regret matching and smooth fictitious play, are known to be Hannan
consistent. In this note, we consider sampled fictitious play: at each round,
the player samples past times and plays the best response to previous moves of
other players at the sampled time points. We show that sampled fictitious play,
using Bernoulli sampling, is Hannan consistent. Unlike several existing Hannan
consistency proofs that rely on concentration of measure results, ours instead
uses anti-concentration results from Littlewood-Offord theory.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2016 23:41:23 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Apr 2017 15:52:46 GMT'}]",2017-04-12,"[['Li', 'Zifan', ''], ['Tewari', 'Ambuj', '']]","['adaptive heuristics', 'learning', 'repeated games', 'Hannan consistency', 'fictitious play']"
19406,1507.00182,Mehdi Bennis,"Syed Tamoor-ul-Hassan and Mehdi Bennis and Pedro H. J. Nardelli and
  Matti Latva-Aho",Modeling and Analysis of Content Caching in Wireless Small Cell Networks,"accepted for publication, IEEE ISWCS 2015",,,,cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network densification with small cell base stations is a promising solution
to satisfy future data traffic demands. However, increasing small cell base
station density alone does not ensure better users quality-of-experience and
incurs high operational expenditures. Therefore, content caching on different
network elements has been proposed as a mean of offloading he backhaul by
caching strategic contents at the network edge, thereby reducing latency. In
this paper, we investigate cache-enabled small cells in which we model and
characterize the outage probability, defined as the probability of not
satisfying users requests over a given coverage area. We analytically derive a
closed form expression of the outage probability as a function of
signal-to-interference ratio, cache size, small cell base station density and
threshold distance. By assuming the distribution of base stations as a Poisson
point process, we derive the probability of finding a specific content within a
threshold distance and the optimal small cell base station density that
achieves a given target cache hit probability. Furthermore, simulation results
are performed to validate the analytical model.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2015 11:01:08 GMT'}]",2015-07-02,"[['Tamoor-ul-Hassan', 'Syed', ''], ['Bennis', 'Mehdi', ''], ['Nardelli', 'Pedro H. J.', ''], ['Latva-Aho', 'Matti', '']]","['Caching', 'Small Cell Networks', 'Stochastic Geometry']"
19407,1701.08312,Ronald Rivest,Ronald L. Rivest,ClipAudit: A Simple Risk-Limiting Post-Election Audit,13 pages,,,,cs.CR stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a simple risk-limiting audit for elections, ClipAudit. To
determine whether candidate A (the reported winner) actually beat candidate B
in a plurality election, ClipAudit draws ballots at random, without
replacement, until either all cast ballots have been drawn, or until \[ a - b
\ge \beta \sqrt{a+b}
  \] where $a$ is the number of ballots in the sample for the reported winner
A, and $b$ is the number of ballots in the sample for opponent B, and where
$\beta$ is a constant determined a priori as a function of the number $n$ of
ballots cast and the risk-limit $\alpha$. ClipAudit doesn't depend on the
unofficial margin (as does Bravo). We show how to extend ClipAudit to contests
with multiple winners or losers, or to multiple contests.
","[{'version': 'v1', 'created': 'Sat, 28 Jan 2017 18:51:10 GMT'}]",2017-01-31,"[['Rivest', 'Ronald L.', '']]","['elections', 'auditing', 'post-election audits', 'risk-limiting audit']"
19408,1401.2768,Hanumantha Raju MC,M. C. Hanumantharaju and M. T. Gopalakrishna,"Design of novel architectures and field programmable gate arrays
  implementation of two dimensional gaussian surround function","10 Pages, 14 figures (including authors photo), International
  Conference on Image & Signal Processing (ICIP2013)","International Journal of Information Processing, ISSN : 0973-8215,
  7(4), 66-75, 2013",,,cs.AR,http://creativecommons.org/licenses/by/3.0/,"  A new design and novel architecture suitable for FPGA/ASIC implementation of
a 2D Gaussian surround function for image processing application is presented
in this paper. The proposed scheme results in enormous savings of memory
normally required for 2D Gaussian function implementation. In the present work,
the Gaussian symmetric characteristics which quickly falls off toward
plus/minus infinity has been used in order to save the memory. The 2D Gaussian
function implementation is presented for use in applications such as image
enhancement, smoothing, edge detection and filtering etc. The FPGA
implementation of the proposed 2D Gaussian function is capable of processing
(blurring, smoothing, and convolution) high resolution color pictures of size
up to $1600\times1200$ pixels at the real time video rate of 30 frames/sec. The
Gaussian design exploited here has been used in the core part of retinex based
color image enhancement. Therefore, the design presented produces Gaussian
output with three different scales, namely, 16, 64 and 128. The design was
coded in Verilog, a popular hardware design language used in industries,
conforming to RTL coding guidelines and fits onto a single chip with a gate
count utilization of 89,213 gates. Experimental results presented confirms that
the proposed method offers a new approach for development of large sized
Gaussian pyramid while reducing the on-chip memory utilization.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2014 09:52:08 GMT'}]",2014-01-14,"[['Hanumantharaju', 'M. C.', ''], ['Gopalakrishna', 'M. T.', '']]","['Gaussian Surround Function', 'Hardware Architecture', 'FPGA', 'Verilog']"
19409,1107.3225,Luis Antonio Santa-Eulalia,"Luis Antonio de Santa-Eulalia, Sophie D'Amours and Jean-Marc Frayret","An Agent-based Strategy for Deploying Analysis Models into Specification
  and Design for Distributed APS Systems","In: International Journal of Computer Science Issues, Volume 8, Issue
  3, May 2011, p.7-18, ISSN 1694-0814",,,,cs.MA,http://creativecommons.org/licenses/by/3.0/,"  Despite the extensive use of the agent technology in the Supply Chain
Management field, its integration with Advanced Planning and Scheduling (APS)
tools still represents a promising field with several open research questions.
Specifically, the literature falls short in providing an integrated framework
to analyze, specify, design and implement simulation experiments covering the
whole simulation cycle. Thus, this paper proposes an agent-based strategy to
convert the 'analysis' models into 'specification' and 'design' models
combining two existing methodologies proposed in the literature. The first one
is a recent and unique approach dedicated to the 'analysis' of agent-based APS
systems. The second one is a well-established methodological framework to
'specify' and 'design' agent-based supply chain systems. The proposed
conversion strategy is original and is the first one allowing simulation
analysts to integrate the whole simulation development process in the domain of
distributed APS.
","[{'version': 'v1', 'created': 'Sat, 16 Jul 2011 12:47:54 GMT'}]",2011-07-19,"[['de Santa-Eulalia', 'Luis Antonio', ''], [""D'Amours"", 'Sophie', ''], ['Frayret', 'Jean-Marc', '']]","['Advanced Planning and Scheduling (APS)', 'AgentBased Simulation', 'Methodological Framework', 'Analysis', 'Specification and Design', 'FAMASS']"
19410,1511.00628,Mohamad Dolatshah,"Mohamad Dolatshah, Ali Hadian and Behrouz Minaei-Bidgoli","Ball*-tree: Efficient spatial indexing for constrained nearest-neighbor
  search in metric spaces","15 pages, 7 figures",,,,cs.DB cs.CG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Emerging location-based systems and data analysis frameworks requires
efficient management of spatial data for approximate and exact search. Exact
similarity search can be done using space partitioning data structures, such as
Kd-tree, R*-tree, and Ball-tree. In this paper, we focus on Ball-tree, an
efficient search tree that is specific for spatial queries which use euclidean
distance. Each node of a Ball-tree defines a ball, i.e. a hypersphere that
contains a subset of the points to be searched.
  In this paper, we propose Ball*-tree, an improved Ball-tree that is more
efficient for spatial queries. Ball*-tree enjoys a modified space partitioning
algorithm that considers the distribution of the data points in order to find
an efficient splitting hyperplane. Also, we propose a new algorithm for KNN
queries with restricted range using Ball*-tree, which performs better than both
KNN and range search for such queries. Results show that Ball*-tree performs
39%-57% faster than the original Ball-tree algorithm.
","[{'version': 'v1', 'created': 'Mon, 2 Nov 2015 18:54:49 GMT'}]",2015-11-03,"[['Dolatshah', 'Mohamad', ''], ['Hadian', 'Ali', ''], ['Minaei-Bidgoli', 'Behrouz', '']]","['Ball-tree', 'Constrained NN', 'Spatial indexing', 'Eigenvector analysis', 'Range search']"
19411,1602.07613,Alireza Aghasi,Alireza Aghasi and Justin Romberg,Learning Shapes by Convex Composition,,,,,cs.CV math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a mathematical and algorithmic scheme for learning the principal
geometric elements in an image or 3D object. We build on recent work that
convexifies the basic problem of finding a combination of a small number shapes
that overlap and occlude one another in such a way that they ""match"" a given
scene as closely as possible. This paper derives general sufficient conditions
under which this convex shape composition identifies a target composition. From
a computational standpoint, we present two different methods for solving the
associated optimization programs. The first method simply recasts the problem
as a linear program, while the second uses the alternating direction method of
multipliers with a series of easily computed proximal operators.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2016 08:01:58 GMT'}, {'version': 'v2', 'created': 'Mon, 4 Jul 2016 08:37:00 GMT'}]",2016-07-05,"[['Aghasi', 'Alireza', ''], ['Romberg', 'Justin', '']]","['Shape Composition', 'Object Learning', 'Nonlinear Sparse Recovery', 'Geometric Packing Problem']"
19412,1109.6126,Lianlin Li Dr,Lianlin Li,"The Statistical Coherence-based Theory of Robust Recovery of Sparsest
  Overcomplete Representation",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The recovery of sparsest overcomplete representation has recently attracted
intensive research activities owe to its important potential in the many
applied fields such as signal processing, medical imaging, communication, and
so on. This problem can be stated in the following, i.e., to seek for the
sparse coefficient vector of the given noisy observation over a redundant
dictionary such that, where is the corrupted error. Elad et al. made the
worst-case result, which shows the condition of stable recovery of sparest
overcomplete representation over is where . Although it's of easy operation for
any given matrix, this result can't provide us realistic guide in many cases.
On the other hand, most of popular analysis on the sparse reconstruction relies
heavily on the so-called RIP (Restricted Isometric Property) for matrices
developed by Candes et al., which is usually very difficult or impossible to be
justified for a given measurement matrix. In this article, we introduced a
simple and efficient way of determining the ability of given D used to recover
the sparse signal based on the statistical analysis of coherence coefficients,
where is the coherence coefficients between any two different columns of given
measurement matrix . The key mechanism behind proposed paradigm is the analysis
of statistical distribution (the mean and covariance) of . We proved that if
the resulting mean of are zero, and their covariance are as small as possible,
one can faithfully recover approximately sparse signals from a minimal number
of noisy measurements with overwhelming probability. The resulting theory is
not only suitable for almost all models - e.g. Gaussian, frequency
measurements-discussed in the literature of compressed sampling, but also
provides a framework for new measurement strategies as well.
","[{'version': 'v1', 'created': 'Wed, 28 Sep 2011 08:52:49 GMT'}]",2011-09-29,"[['Li', 'Lianlin', '']]","['Compressed sampling', 'sparse signal representation', 'RIP analysis', 'signal']"
19413,0711.3149,Marie-Jean Meurs,Marie-Jean Meurs,Approche polyedrale pour le probleme du separateur (VSP),"21 pages, 4 figures",,,,cs.DM,,"  In an undirected connected graph G=(V,E), the vertex separator problem (VSP)
asks for a partition of V into nonempty subsets A, B, C such that |C| is
minimized such that there is no edge between A and B, and sizes of A and B are
similar. This paper presents a polyhedral approach of the (VSP), introducing
new efficient valid inequalities and providing computational tests and results.
","[{'version': 'v1', 'created': 'Tue, 20 Nov 2007 14:55:20 GMT'}]",2007-11-21,"[['Meurs', 'Marie-Jean', '']]","['VSP', 'graph', 'vertex separator', 'polyhedron']"
19414,1301.0159,Charith Perera,"Arkady Zaslavsky, Charith Perera, Dimitrios Georgakopoulos",Sensing as a Service and Big Data,"Proceedings of the International Conference on Advances in Cloud
  Computing (ACC), Bangalore, India, July, 2012","Proceedings of the International Conference on Advances in Cloud
  Computing (ACC), Bangalore, India, July, 2012",,ISSN/ISBN: 9788173717789,cs.CY cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Internet of Things (IoT) will comprise billions of devices that can sense,
communicate, compute and potentially actuate. Data streams coming from these
devices will challenge the traditional approaches to data management and
contribute to the emerging paradigm of big data. This paper discusses emerging
Internet of Things (IoT) architecture, large scale sensor network applications,
federating sensor networks, sensor data and related context capturing
techniques, challenges in cloud-based management, storing, archiving and
processing of sensor data.
","[{'version': 'v1', 'created': 'Wed, 2 Jan 2013 03:04:12 GMT'}]",2013-01-29,"[['Zaslavsky', 'Arkady', ''], ['Perera', 'Charith', ''], ['Georgakopoulos', 'Dimitrios', '']]","['Big Data', 'Sensing as a Service', 'Internet of Things', 'Large Scale Sensor Networks', 'Cloud Computing', 'Data Management']"
19415,1710.03881,Babajide Ayinde,Babajide O. Ayinde and Sami El-Ferik,"Artificial Bee Colony-based Adaptive Position Control of
  Electrohydraulic Servo Systems with Parameter Uncertainty",,,,,cs.SY math.OC,http://creativecommons.org/licenses/by/4.0/,"  In this paper, a robust adaptive backstepping-based controller is developed
for positioning the spool valve of Electro-Hydraulic Servo System (EHSS) with
parameter fluctuations. Artificial Bee Colony (ABC) algorithm is utilized to
drive the parameters of the proposed controller to a good neighbourhood of the
solution space. The optimization problem is formulated such that both the
tracking error and control signal are minimized concurrently. The results show
that the proposed controller guarantees the uniform ultimate boundedness of the
tracking error and control signal. Moreover, illustrative simulations validate
the potentials and robustness of the proposed schemes in the presence of
uncertainties. The proposed controller is also compared with sliding mode
control.
","[{'version': 'v1', 'created': 'Sun, 8 Oct 2017 23:18:24 GMT'}]",2017-10-12,"[['Ayinde', 'Babajide O.', ''], ['El-Ferik', 'Sami', '']]","['Electro-hydraulic systems', 'backstepping control', 'nonlinear systems', 'adaptive control', 'artificial bee colony']"
19416,1702.00153,"Buket \""Ozkaya","Cem G\""uneri, Ferruh \""Ozbudak, Buket \""Ozkaya, Elif
  Sa\c{c}{\i}kara, Zahra Sepasdar, Patrick Sol\'e",Structure and Performance of Generalized Quasi-Cyclic Codes,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generalized quasi-cyclic (GQC) codes form a natural generalization of
quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a
family of ring alphabets. Decomposing these rings into local rings by the
Chinese Remainder Theorem yields a decomposition of GQC codes into a sum of
concatenated codes. This decomposition leads to a trace formula, a minimum
distance bound, and to a criteria for the GQC code to be self-dual or to be
linear complementary dual (LCD). Explicit long GQC codes that are LCD, but not
QC, are exhibited.
","[{'version': 'v1', 'created': 'Wed, 1 Feb 2017 08:01:41 GMT'}]",2017-02-02,"[['G\x7füneri', 'Cem', ''], ['\x7fÖzbudak', 'Ferruh', ''], ['\x7fÖzkaya', 'Buket', ''], ['Saçıkara', 'Elif', ''], ['Sepasdar', 'Zahra', ''], ['Solé', 'Patrick', '']]","['GQC codes', 'QC codes', 'LCD codes', 'self-dual codes']"
19417,1511.05806,Dirk Lewandowski,Dirk Lewandowski,Ranking library materials,"Conceptual paper, OPAC, search engines, ranking, results presentation",,,,cs.DL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose: This paper discusses ranking factors suitable for library materials
and shows that ranking in general is a complex process and that ranking for
library materials requires a variety of techniques.
Design/methodology/approach: The relevant literature is reviewed to provide a
systematic overview of suitable ranking factors. The discussion is based on an
overview of ranking factors used in Web search engines. Findings: While there
are a wide variety of ranking factors applicable to library materials, todays
library systems use only some of them. When designing a ranking component for
the library catalogue, an individual weighting of applicable factors is
necessary. Research limitations/applications: While this article discusses
different factors, no particular ranking formula is given. However, this
article presents the argument that such a formula must always be individual to
a certain use case. Practical implications: The factors presented can be
considered when designing a ranking component for a librarys search system or
when discussing such a project with an ILS vendor. Originality/value: This
paper is original in that it is the first to systematically discuss ranking of
library materials based on the main factors used by Web search engines.
","[{'version': 'v1', 'created': 'Wed, 18 Nov 2015 14:36:20 GMT'}]",2015-11-19,"[['Lewandowski', 'Dirk', '']]","['OPAC', 'search engines', 'ranking', 'results presentation']"
19418,1511.09389,Manuel Sorge,"Ren\'e van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf
  Niedermeier, and Manuel Sorge",The role of twins in computing planar supports of hypergraphs,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A support or realization of a hypergraph $H$ is a graph $G$ on the same
vertex as $H$ such that for each hyperedge of $H$ it holds that its vertices
induce a connected subgraph of $G$. The NP-hard problem of finding a planar
support has applications in hypergraph drawing and network design. Previous
algorithms for the problem assume that twins -- pairs of vertices that are in
precisely the same hyperedges -- can safely be removed from the input
hypergraph. We prove that this assumption is generally wrong, yet that the
number of twins necessary for a hypergraph to have a planar support only
depends on its number of hyperedges. We give an explicit upper bound on the
number of twins necessary for a hypergraph with $m$ hyperedges to have an
$r$-outerplanar support, which depends only on $r$ and $m$. Since all
additional twins can be safely removed, we obtain a linear-time algorithm for
computing $r$-outerplanar supports for hypergraphs with $m$ hyperedges if $m$
and $r$ are constant; in other words, the problem is fixed-parameter
linear-time solvable with respect to the parameters $m$ and $r$.
","[{'version': 'v1', 'created': 'Sun, 15 Nov 2015 22:59:27 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Dec 2015 20:03:46 GMT'}, {'version': 'v3', 'created': 'Wed, 24 Aug 2016 14:34:33 GMT'}, {'version': 'v4', 'created': 'Fri, 26 Aug 2016 16:57:18 GMT'}, {'version': 'v5', 'created': 'Fri, 2 Oct 2020 02:43:11 GMT'}, {'version': 'v6', 'created': 'Mon, 1 Aug 2022 10:26:32 GMT'}]",2022-08-02,"[['van Bevern', 'René', ''], ['Kanj', 'Iyad A.', ''], ['Komusiewicz', 'Christian', ''], ['Niedermeier', 'Rolf', ''], ['Sorge', 'Manuel', '']]","['Subdivision drawings', 'NP-hard problem', 'r-outerplanar graphs', 'sphere-cut branch decomposition']"
19419,1607.00036,"\c{C}a\u{g}lar G\""ul\c{c}ehre","Caglar Gulcehre, Sarath Chandar, Kyunghyun Cho, Yoshua Bengio",Dynamic Neural Turing Machine with Soft and Hard Addressing Schemes,"13 pages, 3 figures",,,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We extend neural Turing machine (NTM) model into a dynamic neural Turing
machine (D-NTM) by introducing a trainable memory addressing scheme. This
addressing scheme maintains for each memory cell two separate vectors, content
and address vectors. This allows the D-NTM to learn a wide variety of
location-based addressing strategies including both linear and nonlinear ones.
We implement the D-NTM with both continuous, differentiable and discrete,
non-differentiable read/write mechanisms. We investigate the mechanisms and
effects of learning to read and write into a memory through experiments on
Facebook bAbI tasks using both a feedforward and GRUcontroller. The D-NTM is
evaluated on a set of Facebook bAbI tasks and shown to outperform NTM and LSTM
baselines. We have done extensive analysis of our model and different
variations of NTM on bAbI task. We also provide further experimental results on
sequential pMNIST, Stanford Natural Language Inference, associative recall and
copy tasks.
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2016 20:45:12 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Mar 2017 05:56:48 GMT'}]",2017-03-20,"[['Gulcehre', 'Caglar', ''], ['Chandar', 'Sarath', ''], ['Cho', 'Kyunghyun', ''], ['Bengio', 'Yoshua', '']]","['neural networks', 'memory', 'neural Turing machines', 'natural languageprocessing']"
19420,1505.02973,Konstantinos Tserpes,"Evangelos Psomakelis, Konstantinos Tserpes, Dimosthenis
  Anagnostopoulos, Theodora Varvarigou",Comparing methods for Twitter Sentiment Analysis,"5 pages, 1 figure, 6th Conference on Knowledge Discovery and
  Information Retrieval 2014, Rome, Italy",,,,cs.CL cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work extends the set of works which deal with the popular problem of
sentiment analysis in Twitter. It investigates the most popular document
(""tweet"") representation methods which feed sentiment evaluation mechanisms. In
particular, we study the bag-of-words, n-grams and n-gram graphs approaches and
for each of them we evaluate the performance of a lexicon-based and 7
learning-based classification algorithms (namely SVM, Na\""ive Bayesian
Networks, Logistic Regression, Multilayer Perceptrons, Best-First Trees,
Functional Trees and C4.5) as well as their combinations, using a set of 4451
manually annotated tweets. The results demonstrate the superiority of
learning-based methods and in particular of n-gram graphs approaches for
predicting the sentiment of tweets. They also show that the combinatory
approach has impressive effects on n-grams, raising the confidence up to 83.15%
on the 5-Grams, using majority vote and a balanced dataset (equal number of
positive, negative and neutral tweets for training). In the n-gram graph cases
the improvement was small to none, reaching 94.52% on the 4-gram graphs, using
Orthodromic distance and a threshold of 0.001.
","[{'version': 'v1', 'created': 'Tue, 12 May 2015 12:05:19 GMT'}]",2015-05-14,"[['Psomakelis', 'Evangelos', ''], ['Tserpes', 'Konstantinos', ''], ['Anagnostopoulos', 'Dimosthenis', ''], ['Varvarigou', 'Theodora', '']]","['Sentiment Analysis', 'document polarity classification', 'Lexicon-& Learning-based', 'bag of words', 'ngrams', 'ngram graphs']"
19421,1712.02872,Yassmeen Elderhalli,"Yassmeen Elderhalli, Osman Hasan, Waqar Ahmad, Sofiene Tahar","Dynamic Fault Trees Analysis using an Integration of Theorem Proving and
  Model Checking",,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dynamic fault trees (DFTs) have emerged as an important tool for capturing
the dynamic behavior of system failure. These DFTs are then analyzed
qualitatively and quantitatively using stochastic or algebraic methods to judge
the failure characteristics of the given system in terms of the failures of its
sub-components. Model checking has been recently proposed to conduct the
failure analysis of systems using DFTs with the motivation to provide a
rigorous failure analysis of safety-critical systems. However, model checking
has not been used for the DFT qualitative analysis and the reduction algorithms
used in model checking are usually not formally verified. Moreover, the
analysis time grows exponentially with the increase of the number of states.
These issues limit the usefulness of model checking for analyzing complex
systems used in safety-critical domains, where the accuracy and completeness of
analysis matters the most. To overcome these limitations, we propose a
comprehensive methodology to perform the qualitative and quantitative analysis
of DFTs using an integration of theorem proving and model checking based
approaches. For this purpose, we formalized all the basic dynamic fault tree
gates using higher-order logic based on the algebraic approach and formally
verified some of the simplification properties. This formalization allows us to
formally verify the equivalence between the original and reduced DFTs using a
theorem prover, and conduct the qualitative analysis. We then use model
checking to perform the quantitative analysis of the formally verified reduced
DFT. We applied our methodology to five benchmarks and the results show that
the formally verified reduced DFT was analyzed using model checking with up to
six times less states and up to 133000 times faster.
","[{'version': 'v1', 'created': 'Thu, 7 Dec 2017 21:49:40 GMT'}]",2017-12-11,"[['Elderhalli', 'Yassmeen', ''], ['Hasan', 'Osman', ''], ['Ahmad', 'Waqar', ''], ['Tahar', 'Sofiene', '']]","['Dynamic Fault Trees', 'Theorem Proving', 'Model Checking', 'HOL4', 'STORM']"
19422,1110.6384,Serge Gaspers,Serge Gaspers and Stefan Szeider,Backdoors to Acyclic SAT,,,,,cs.DS cs.AI cs.CC math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Backdoor sets, a notion introduced by Williams et al. in 2003, are certain
sets of key variables of a CNF formula F that make it easy to solve the
formula; by assigning truth values to the variables in a backdoor set, the
formula gets reduced to one or several polynomial-time solvable formulas. More
specifically, a weak backdoor set of F is a set X of variables such that there
exits a truth assignment t to X that reduces F to a satisfiable formula F[t]
that belongs to a polynomial-time decidable base class C. A strong backdoor set
is a set X of variables such that for all assignments t to X, the reduced
formula F[t] belongs to C.
  We study the problem of finding backdoor sets of size at most k with respect
to the base class of CNF formulas with acyclic incidence graphs, taking k as
the parameter. We show that
  1. the detection of weak backdoor sets is W[2]-hard in general but
fixed-parameter tractable for r-CNF formulas, for any fixed r>=3, and
  2. the detection of strong backdoor sets is fixed-parameter approximable.
  Result 1 is the the first positive one for a base class that does not have a
characterization with obstructions of bounded size. Result 2 is the first
positive one for a base class for which strong backdoor sets are more powerful
than deletion backdoor sets.
  Not only SAT, but also #SAT can be solved in polynomial time for CNF formulas
with acyclic incidence graphs. Hence Result 2 establishes a new structural
parameter that makes #SAT fixed-parameter tractable and that is incomparable
with known parameters such as treewidth and clique-width.
  We obtain the algorithms by a combination of an algorithmic version of the
Erd\""os-P\'osa Theorem, Courcelle's model checking for monadic second order
logic, and new combinatorial results on how disjoint cycles can interact with
the backdoor set.
","[{'version': 'v1', 'created': 'Fri, 28 Oct 2011 16:10:32 GMT'}, {'version': 'v2', 'created': 'Mon, 31 Oct 2011 15:09:42 GMT'}, {'version': 'v3', 'created': 'Tue, 21 Feb 2012 17:15:41 GMT'}]",2012-02-22,"[['Gaspers', 'Serge', ''], ['Szeider', 'Stefan', '']]","['SAT', 'model counting', 'Erd˝os-P´osa Theorem', 'monadic second-order logic', 'cycle cutsets', 'parameterized complexity']"
19423,0904.0525,Fang-Wei Fu,Zhi-Han Gao and Fang-Wei Fu,"The Minimal Polynomial over F_q of Linear Recurring Sequence over
  F_{q^m}",Submitted to the journal Finite Fields and Their Applications,,,,cs.IT cs.CR math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, motivated by the study of vectorized stream cipher systems, the
joint linear complexity and joint minimal polynomial of multisequences have
been investigated. Let S be a linear recurring sequence over finite field
F_{q^m} with minimal polynomial h(x) over F_{q^m}. Since F_{q^m} and F_{q}^m
are isomorphic vector spaces over the finite field F_q, S is identified with an
m-fold multisequence S^{(m)} over the finite field F_q. The joint minimal
polynomial and joint linear complexity of the m-fold multisequence S^{(m)} are
the minimal polynomial and linear complexity over F_q of S respectively. In
this paper, we study the minimal polynomial and linear complexity over F_q of a
linear recurring sequence S over F_{q^m} with minimal polynomial h(x) over
F_{q^m}. If the canonical factorization of h(x) in F_{q^m}[x] is known, we
determine the minimal polynomial and linear complexity over F_q of the linear
recurring sequence S over F_{q^m}.
","[{'version': 'v1', 'created': 'Fri, 3 Apr 2009 07:49:57 GMT'}]",2009-04-06,"[['Gao', 'Zhi-Han', ''], ['Fu', 'Fang-Wei', '']]","['Linear recurring sequences', 'minimal polynomial', 'linear complexity', 'multisequences', 'joint minimal polynomial', 'joint linear complexity']"
19424,1802.07098,Ehsan Kazemi,Moran Feldman and Amin Karbasi and Ehsan Kazemi,"Do Less, Get More: Streaming Submodular Maximization with Subsampling",,,,,cs.LG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we develop the first one-pass streaming algorithm for
submodular maximization that does not evaluate the entire stream even once. By
carefully subsampling each element of data stream, our algorithm enjoys the
tightest approximation guarantees in various settings while having the smallest
memory footprint and requiring the lowest number of function evaluations. More
specifically, for a monotone submodular function and a $p$-matchoid constraint,
our randomized algorithm achieves a $4p$ approximation ratio (in expectation)
with $O(k)$ memory and $O(km/p)$ queries per element ($k$ is the size of the
largest feasible solution and $m$ is the number of matroids used to define the
constraint). For the non-monotone case, our approximation ratio increases only
slightly to $4p+2-o(1)$. To the best or our knowledge, our algorithm is the
first that combines the benefits of streaming and subsampling in a novel way in
order to truly scale submodular maximization to massive machine learning
problems. To showcase its practicality, we empirically evaluated the
performance of our algorithm on a video summarization application and observed
that it outperforms the state-of-the-art algorithm by up to fifty fold, while
maintaining practically the same utility.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 13:11:48 GMT'}]",2018-02-21,"[['Feldman', 'Moran', ''], ['Karbasi', 'Amin', ''], ['Kazemi', 'Ehsan', '']]","['Submodular maximization', 'streaming', 'subsampling', 'data summarization', 'pmatchoids']"
19425,1309.7266,Ahmed Abbasi,"Ahmed Abbasi, Siddharth Kaza and F. Mariam Zahedi",Evaluating Link-Based Techniques for Detecting Fake Pharmacy Websites,"Abbasi, A., Kaza, S., and Zahedi, F. M. ""Evaluating Link-Based
  Techniques for Detecting Fake Pharmacy Websites,"" In Proceedings of the 19th
  Annual Workshop on Information Technologies and Systems, Phoenix, Arizona,
  December 14-15, 2009",,,,cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fake online pharmacies have become increasingly pervasive, constituting over
90% of online pharmacy websites. There is a need for fake website detection
techniques capable of identifying fake online pharmacy websites with a high
degree of accuracy. In this study, we compared several well-known link-based
detection techniques on a large-scale test bed with the hyperlink graph
encompassing over 80 million links between 15.5 million web pages, including
1.2 million known legitimate and fake pharmacy pages. We found that the QoC and
QoL class propagation algorithms achieved an accuracy of over 90% on our
dataset. The results revealed that algorithms that incorporate dual class
propagation as well as inlink and outlink information, on page-level or
site-level graphs, are better suited for detecting fake pharmacy websites. In
addition, site-level analysis yielded significantly better results than
page-level analysis for most algorithms evaluated.
","[{'version': 'v1', 'created': 'Fri, 27 Sep 2013 15:09:24 GMT'}]",2013-09-30,"[['Abbasi', 'Ahmed', ''], ['Kaza', 'Siddharth', ''], ['Zahedi', 'F. Mariam', '']]","['Fake website detection', 'pharmacy websites', 'graph-based models']"
19426,1312.7430,Prashanth L.A.,"L.A. Prashanth, H.L. Prasad, Nirmit Desai, Shalabh Bhatnagar and Gargi
  Dasgupta","Simultaneous Perturbation Methods for Adaptive Labor Staffing in Service
  Systems",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Service systems are labor intensive due to the large variation in the tasks
required to address service requests from multiple customers. Aligning the
staffing levels to the forecasted workloads adaptively in such systems is
nontrivial because of a large number of parameters and operational variations
leading to a huge search space. A challenging problem here is to optimize the
staffing while maintaining the system in steady-state and compliant to
aggregate service level agreement (SLA) constraints. Further, because these
parameters change on a weekly basis, the optimization should not take longer
than a few hours. We formulate this problem as a constrained Markov cost
process parameterized by the (discrete) staffing levels. We propose novel
simultaneous perturbation stochastic approximation (SPSA) based SASOC (Staff
Allocation using Stochastic Optimization with Constraints) algorithms for
solving the above problem. The algorithms include both first order as well as
second order methods and incorporate SPSA based gradient estimates in the
primal, with dual ascent for the Lagrange multipliers. Both the algorithms that
we propose are online, incremental and easy to implement. Further, they involve
a certain generalized smooth projection operator, which is essential to project
the continuous-valued worker parameter tuned by SASOC algorithms onto the
discrete set. We validated our algorithms on five real-life service systems and
compared them with a state-of-the-art optimization tool-kit OptQuest. Being 25
times faster than OptQuest, our algorithms are particularly suitable for
adaptive labor staffing. Also, we observe that our algorithms guarantee
convergence and find better solutions than OptQuest in many cases.
","[{'version': 'v1', 'created': 'Sat, 28 Dec 2013 13:38:07 GMT'}]",2013-12-31,"[['Prashanth', 'L. A.', ''], ['Prasad', 'H. L.', ''], ['Desai', 'Nirmit', ''], ['Bhatnagar', 'Shalabh', ''], ['Dasgupta', 'Gargi', '']]","['Service systems', 'labor optimization', 'Adaptive labor staffing', 'Simultaneous perturbationstochastic approximation']"
19427,1704.06767,Han Bao,"Han Bao, Tomoya Sakai, Issei Sato, Masashi Sugiyama","Convex Formulation of Multiple Instance Learning from Positive and
  Unlabeled Bags",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multiple instance learning (MIL) is a variation of traditional supervised
learning problems where data (referred to as bags) are composed of sub-elements
(referred to as instances) and only bag labels are available. MIL has a variety
of applications such as content-based image retrieval, text categorization and
medical diagnosis. Most of the previous work for MIL assume that the training
bags are fully labeled. However, it is often difficult to obtain an enough
number of labeled bags in practical situations, while many unlabeled bags are
available. A learning framework called PU learning (positive and unlabeled
learning) can address this problem. In this paper, we propose a convex PU
learning method to solve an MIL problem. We experimentally show that the
proposed method achieves better performance with significantly lower
computational costs than an existing method for PU-MIL.
","[{'version': 'v1', 'created': 'Sat, 22 Apr 2017 08:50:19 GMT'}, {'version': 'v2', 'created': 'Fri, 16 Feb 2018 03:04:53 GMT'}, {'version': 'v3', 'created': 'Tue, 1 May 2018 12:16:34 GMT'}]",2018-05-02,"[['Bao', 'Han', ''], ['Sakai', 'Tomoya', ''], ['Sato', 'Issei', ''], ['Sugiyama', 'Masashi', '']]","['multiple instance learning', 'positive-unlabeled classification', 'weakly-supervised classification']"
19428,0704.3662,Tian-Jian Jiang,"Mike Tian-Jian Jiang, James Zhan, Jaimie Lin, Jerry Lin, Wen-Lien Hsu",An Automated Evaluation Metric for Chinese Text Entry,8 pages,"Jiang, Mike Tian-Jian, et al. ""Robustness analysis of adaptive
  chinese input methods."" Advances in Text Input Methods (WTIM 2011) (2011): 53",,,cs.HC cs.CL,,"  In this paper, we propose an automated evaluation metric for text entry. We
also consider possible improvements to existing text entry evaluation metrics,
such as the minimum string distance error rate, keystrokes per character, cost
per correction, and a unified approach proposed by MacKenzie, so they can
accommodate the special characteristics of Chinese text. Current methods lack
an integrated concern about both typing speed and accuracy for Chinese text
entry evaluation. Our goal is to remove the bias that arises due to human
factors. First, we propose a new metric, called the correction penalty (P),
based on Fitts' law and Hick's law. Next, we transform it into the approximate
amortized cost (AAC) of information theory. An analysis of the AAC of Chinese
text input methods with different context lengths is also presented.
","[{'version': 'v1', 'created': 'Fri, 27 Apr 2007 05:34:10 GMT'}]",2013-10-29,"[['Jiang', 'Mike Tian-Jian', ''], ['Zhan', 'James', ''], ['Lin', 'Jaimie', ''], ['Lin', 'Jerry', ''], ['Hsu', 'Wen-Lien', '']]","['Text entry', 'automated evaluation', 'context length', 'error rates']"
19429,1506.00462,Ulrich Pferschy,Andreas Darmann and Ulrich Pferschy and Joachim Schauer,On the shortest path game: extended version,"Extended version contains the full description of the dynamic
  programming arrays in Section 4",,,,cs.DM cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we address a game theoretic variant of the shortest path
problem, in which two decision makers (players) move together along the edges
of a graph from a given starting vertex to a given destination. The two players
take turns in deciding in each vertex which edge to traverse next. The decider
in each vertex also has to pay the cost of the chosen edge. We want to
determine the path where each player minimizes its costs taking into account
that also the other player acts in a selfish and rational way. Such a solution
is a subgame perfect equilibrium and can be determined by backward induction in
the game tree of the associated finite game in extensive form.
  We show that the decision problem associated with such a path is
PSPACE-complete even for bipartite graphs both for the directed and the
undirected version. The latter result is a surprising deviation from the
complexity status of the closely related game Geography.
  On the other hand, we can give polynomial time algorithms for directed
acyclic graphs and for cactus graphs even in the undirected case. The latter is
based on a decomposition of the graph into components and their resolution by a
number of fairly involved dynamic programming arrays. Finally, we give some
arguments about closing the gap of the complexity status for graphs of bounded
treewidth.
","[{'version': 'v1', 'created': 'Mon, 1 Jun 2015 12:08:12 GMT'}]",2015-06-02,"[['Darmann', 'Andreas', ''], ['Pferschy', 'Ulrich', ''], ['Schauer', 'Joachim', '']]","['shortest path problem', 'game theory', 'computational complexity', 'cactus graph']"
19430,1401.5306,Anthony Marcus Ph.D.,"Anthony Marcus, Ionut Cardei, Borko Furht, Osman Salem and Ahmed
  Mehaoua","A Mobile Device Prototype Application for the Detection and Prediction
  of Node Faults in Wireless Sensor Networks",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Various implementations of wireless sensor networks (i.e. personal area-,
wireless body area- networks) are prone to node and network failures by such
characteristics as limited node energy resources and hardware damage incurred
from their surrounding environment (i.e. flooding, forest fires, a patient
falling). This may jeopardize their reliability to act as early warning
systems, monitoring systems for patients and athletes, and industrial and
environmental observation networks. Following the current trend and widespread
use of hand held, mobile communication devices, we outline an application
architecture designed to detect and predict faulty nodes in wireless sensor
networks. Furthermore, we implement our design as a proof of concept prototype
for Android-based smartphones, which may be extended to develop other
applications used for monitoring networked wireless personal area and body
sensors used in other capacities. We have conducted several preliminary
experiments to demonstrate the use of our design, which is capable of
monitoring networks of wireless sensor devices and predicting node faults based
on several localized metrics. As attributes of such networks may change over
time, any models generated when the application is initialized must be updated
periodically such that the applied machine learning algorithm maintains high
levels of both accuracy and precision. The application is designed to discover
node faults and, once identified, alert the user so that appropriate action may
be taken.
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2014 13:10:22 GMT'}]",2014-01-22,"[['Marcus', 'Anthony', ''], ['Cardei', 'Ionut', ''], ['Furht', 'Borko', ''], ['Salem', 'Osman', ''], ['Mehaoua', 'Ahmed', '']]","['wireless sensor networks', 'data mining and machine learning', 'smartphone;']"
19431,1209.1402,Ansuman Adhikary Ansuman Adhikary,"Ansuman Adhikary, Junyoung Nam, Jae-Young Ahn, and Giuseppe Caire",Joint Spatial Division and Multiplexing,10 figures,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose Joint Spatial Division and Multiplexing (JSDM), an approach to
multiuser MIMO downlink that exploits the structure of the correlation of the
channel vectors in order to allow for a large number of antennas at the base
station while requiring reduced-dimensional Channel State Information at the
Transmitter (CSIT). This allows for significant savings both in the downlink
training and in the CSIT feedback from the user terminals to the base station,
thus making the use of a large number of base station antennas potentially
suitable also for Frequency Division Duplexing (FDD) systems, for which
uplink/downlink channel reciprocity cannot be exploited. JSDM forms the
multiuser MIMO downlink precoder by concatenating a pre-beamforming matrix,
which depends only on the channel second-order statistics, with a classical
multiuser precoder, based on the instantaneous knowledge of the resulting
reduced dimensional effective channels. We prove a simple condition under which
JSDM incurs no loss of optimality with respect to the full CSIT case. For
linear uniformly spaced arrays, we show that such condition is closely
approached when the number of antennas is large. For this case, we use Szego
asymptotic theory of large Toeplitz matrices to design a DFT-based
pre-beamforming scheme requiring only coarse information about the users angles
of arrival and angular spread. Finally, we extend these ideas to the case of a
two-dimensional base station antenna array, with 3-dimensional beamforming,
including multiple beams in the elevation angle direction. We provide
guidelines for the pre-beamforming optimization and calculate the system
spectral efficiency under proportional fairness and maxmin fairness criteria,
showing extremely attractive performance. Our numerical results are obtained
via an asymptotic random matrix theory tool known as deterministic equivalent
approximation.
","[{'version': 'v1', 'created': 'Thu, 6 Sep 2012 20:27:12 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Jan 2013 19:40:15 GMT'}]",2013-01-29,"[['Adhikary', 'Ansuman', ''], ['Nam', 'Junyoung', ''], ['Ahn', 'Jae-Young', ''], ['Caire', 'Giuseppe', '']]","['Multiuser MIMO Downlink', 'Antenna Correlation', '3D Beamforming', 'Deterministic Equivalents']"
19432,1510.00661,Mark Scanlon,"Jason Farina, Mark Scanlon, Stephen Kohlmann, Nhien-An Le Khac and
  M-Tahar Kechadi",HTML5 Zero Configuration Covert Channels: Security Risks and Challenges,"15 pages; Proc. of Tenth ADFSL Conference on Digital Forensics,
  Security and Law (CDFSL 2015)",,,,cs.CR cs.CY cs.NI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In recent months there has been an increase in the popularity and public
awareness of secure, cloudless file transfer systems. The aim of these services
is to facilitate the secure transfer of files in a peer-to- peer (P2P) fashion
over the Internet without the need for centralised authentication or storage.
These services can take the form of client installed applications or entirely
web browser based interfaces. Due to their P2P nature, there is generally no
limit to the file sizes involved or to the volume of data transmitted - and
where these limitations do exist they will be purely reliant on the capacities
of the systems at either end of the transfer. By default, many of these
services provide seamless, end-to-end encryption to their users. The
cybersecurity and cyberforensic consequences of the potential criminal use of
such services are significant. The ability to easily transfer encrypted data
over the Internet opens up a range of opportunities for illegal use to
cybercriminals requiring minimal technical know-how. This paper explores a
number of these services and provides an analysis of the risks they pose to
corporate and governmental security. A number of methods for the forensic
investigation of such transfers are discussed.
","[{'version': 'v1', 'created': 'Fri, 2 Oct 2015 17:49:06 GMT'}]",2015-10-05,"[['Farina', 'Jason', ''], ['Scanlon', 'Mark', ''], ['Kohlmann', 'Stephen', ''], ['Khac', 'Nhien-An Le', ''], ['Kechadi', 'M-Tahar', '']]","['Covert Transfers', 'Encrypted Data Transmission', 'Counter-forensics']"
19433,0710.1481,Stasinos Konstantopoulos,Stasinos Konstantopoulos,What's in a Name?,"Presented at the Computational Phonology Workshop, 6th Intl. Conf.
  Recent Advances in NLP, Borovets, Bulgaria, September 2007",,,,cs.CL cs.AI,,"  This paper describes experiments on identifying the language of a single name
in isolation or in a document written in a different language. A new corpus has
been compiled and made available, matching names against languages. This corpus
is used in a series of experiments measuring the performance of general
language models and names-only language models on the language identification
task. Conclusions are drawn from the comparison between using general language
models and names-only language models and between identifying the language of
isolated names and the language of very short document fragments. Future
research directions are outlined.
","[{'version': 'v1', 'created': 'Mon, 8 Oct 2007 08:36:32 GMT'}]",2007-10-09,"[['Konstantopoulos', 'Stasinos', '']]","['Language identification', 'language guessing', 'morphophonology', 'graphotactics']"
19434,1510.07188,Yinglei Song,Yinglei Song,On the Dominating Set Problem in Random Graphs,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the {\sc Dominating Set} problem in random graphs. In
a random graph, each pair of vertices are joined by an edge with a probability
of $p$, where $p$ is a positive constant less than $1$. We show that, given a
random graph in $n$ vertices, a minimum dominating set in the graph can be
computed in expected $2^{O(\log_{2}^{2}{n})}$ time. For the parameterized
dominating set problem, we show that it cannot be solved in expected
$O(f(k)n^{c})$ time unless the minimum dominating set problem can be
approximated within a ratio of $o(\log_{2}n)$ in expected polynomial time,
where $f(k)$ is a function of the parameter $k$ and $c$ is a constant
independent of $n$ and $k$. In addition, we show that the parameterized
dominating set problem can be solved in expected $O(f(k)n^{c})$ time when the
probability $p$ depends on $n$ and equals to $\frac{1}{g(n)}$, where $g(n)< n$
is a monotonously increasing function of $n$ and its value approaches infinity
when $n$ approaches infinity.
","[{'version': 'v1', 'created': 'Sat, 24 Oct 2015 22:43:25 GMT'}]",2015-10-27,"[['Song', 'Yinglei', '']]","['dominating set', 'random graphs', 'expected computation time', 'parameterized computation']"
19435,1004.3268,Vishal Goyal,"Amir Mollanejad, Leili Mohammad Khanli, Mohammad Zeynali","DBSR: Dynamic base station Repositioning using Genetic algorithm in
  wireless sensor network","International Journal of Computer Science Issues online at
  http://ijcsi.org/articles/DBSR-Dynamic-base-station-Repositioning-using-Genetic-algorithm-in-wireless-sensor-network.php","IJCSI, Volume 7, Issue 2, March 2010",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless sensor networks (WSNs) are commonly used in various ubiquitous and
pervasive applications. Due to limited power resources, the optimal dynamic
base station (BS) replacement could be Prolong the sensor network lifetime. In
this paper we'll present a dynamic optimum method for base station replacement
so that can save energy in sensors and increases network lifetime. Because
positioning problem is a NPhard problem [1], therefore we'll use genetic
algorithm to solve positioning problem. We've considered energy and distance
parameters for finding BS optimized position. In our represented algorithm base
station position is fixed just during each round and its positioning is done at
the start of next round then it'll be placed in optimized position. Evaluating
our proposed algorithm, we'll execute DBSR algorithm on LEACH & HEED Protocols.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2010 18:10:13 GMT'}]",2010-04-20,"[['Mollanejad', 'Amir', ''], ['Khanli', 'Leili Mohammad', ''], ['Zeynali', 'Mohammad', '']]","['Wireless sensor networks', 'base station', 'genetic algorithm']"
19436,1212.6046,Seifedine Kadry Seifedine Kadry,"Seifedine Kadry, Chibli Joumaa",Green WSUS,"International Journal of Applied Science and Technology, 2012",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The new era of information and communication technology (ICT) calls for a
greater understanding of the environmental impacts of recent technology. With
increasing energy cost and growing environmental concerns, green IT is
receiving more and more attention. Network and system design play a crucial
role in both computing and telecommunication systems. Significant part of this
energy cost goes to system update by downloading regularly patches and bug
fixes to solve security problems and to assure that the operating system and
other systems function properly. This paper describes a new design of Windows
Server Update Services (WSUS), system responsible of downloads of the mentioned
patches and updates from Microsoft Update website and then distributes them to
computers on a network. The general idea behind our proposed design is simple.
Instead of the periodical check done by the WSUS servers to ensure update form
Microsoft main servers, we rather propose to reverse the scenario in order to
reduce energy consumption. In the proposed design, the Microsoft main server(s)
sends signal to all WSUS servers to inform them about new updates. Once the
signal received, WSUS can contact the main server to start downloading.
","[{'version': 'v1', 'created': 'Tue, 25 Dec 2012 13:20:25 GMT'}]",2012-12-27,"[['Kadry', 'Seifedine', ''], ['Joumaa', 'Chibli', '']]","['Green IT', 'Green Network', 'windows update', 'WSUS']"
19437,1306.0428,Arthur Carvalho,Arthur Carvalho and Kate Larson,Sharing a Reward Based on Peer Evaluations,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study a problem where a group of agents has to decide how some fixed value
should be shared among them. We are interested in settings where the share that
each agent receives is based on how that agent is evaluated by other members of
the group, where highly regarded agents receive a greater share compared to
agents that are not well regarded. We introduce two mechanisms for determining
agents' shares: the peer-evaluation mechanism, where each agent gives a direct
evaluation for every other member of the group, and the peer-prediction
mechanism, where each agent is asked to report how they believe group members
will evaluate a particular agent. The sharing is based on the provided
information. While both mechanisms are individually rational, the first
mechanism is strategy-proof and budget-balanced, but it can be collusion-prone.
Further, the second mechanism is collusion-resistant and incentive-compatible.
","[{'version': 'v1', 'created': 'Mon, 3 Jun 2013 14:22:00 GMT'}]",2013-06-04,"[['Carvalho', 'Arthur', ''], ['Larson', 'Kate', '']]","['Peer Evaluations', 'Sharing Schemes', 'Mechanism Design']"
19438,1609.03675,Hanjun Dai,"Hanjun Dai, Yichen Wang, Rakshit Trivedi, Le Song","Deep Coevolutionary Network: Embedding User and Item Features for
  Recommendation","Recsys Workshop on Deep Learning for Recommendation Systems (DLRS
  '16)",,,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender systems often use latent features to explain the behaviors of
users and capture the properties of items. As users interact with different
items over time, user and item features can influence each other, evolve and
co-evolve over time. The compatibility of user and item's feature further
influence the future interaction between users and items. Recently, point
process based models have been proposed in the literature aiming to capture the
temporally evolving nature of these latent features. However, these models
often make strong parametric assumptions about the evolution process of the
user and item latent features, which may not reflect the reality, and has
limited power in expressing the complex and nonlinear dynamics underlying these
processes. To address these limitations, we propose a novel deep coevolutionary
network model (DeepCoevolve), for learning user and item features based on
their interaction graph. DeepCoevolve use recurrent neural network (RNN) over
evolving networks to define the intensity function in point processes, which
allows the model to capture complex mutual influence between users and items,
and the feature evolution over time. We also develop an efficient procedure for
training the model parameters, and show that the learned models lead to
significant improvements in recommendation and activity prediction compared to
previous state-of-the-arts parametric models.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2016 04:39:33 GMT'}, {'version': 'v2', 'created': 'Sat, 5 Nov 2016 00:25:39 GMT'}, {'version': 'v3', 'created': 'Wed, 9 Nov 2016 04:12:13 GMT'}, {'version': 'v4', 'created': 'Tue, 28 Feb 2017 05:37:37 GMT'}]",2017-03-01,"[['Dai', 'Hanjun', ''], ['Wang', 'Yichen', ''], ['Trivedi', 'Rakshit', ''], ['Song', 'Le', '']]","['Deep coevolutionary networks', 'Point processes', 'Time-sensitiverecommendation']"
19439,1011.1735,Tshilidzi Marwala,"George Anderson, Tshilidzi Marwala, and Fulufhelo V. Nelwamondo",Use of Data Mining in Scheduler Optimization,10 pages,,,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The operating system's role in a computer system is to manage the various
resources. One of these resources is the Central Processing Unit. It is managed
by a component of the operating system called the CPU scheduler. Schedulers are
optimized for typical workloads expected to run on the platform. However, a
single scheduler may not be appropriate for all workloads. That is, a scheduler
may schedule a workload such that the completion time is minimized, but when
another type of workload is run on the platform, scheduling and therefore
completion time will not be optimal; a different scheduling algorithm, or a
different set of parameters, may work better. Several approaches to solving
this problem have been proposed. The objective of this survey is to summarize
the approaches based on data mining, which are available in the literature. In
addition to solutions that can be directly utilized for solving this problem,
we are interested in data mining research in related areas that have potential
for use in operating system scheduling. We also explain general technical
issues involved in scheduling in modern computers, including parallel
scheduling issues related to multi-core CPUs. We propose a taxonomy that
classifies the scheduling approaches we discuss into different categories.
","[{'version': 'v1', 'created': 'Mon, 8 Nov 2010 09:07:54 GMT'}]",2010-11-09,"[['Anderson', 'George', ''], ['Marwala', 'Tshilidzi', ''], ['Nelwamondo', 'Fulufhelo V.', '']]","['Scheduling', 'Data Mining', 'Operating Systems']"
19440,1701.05334,S.M. Riazul Islam PhD,"Farman Ali, D. Kwak, Pervez Khan, S.M. Riazul Islam, K.H. Kim, and
  K.S. Kwak","Fuzzy Ontology-Based Sentiment Analysis of Transportation and City
  Feature Reviews for Safe Traveling","24 pages, 7 figures, Transportation Research Part C",,,,cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traffic congestion is rapidly increasing in urban areas, particularly in mega
cities. To date, there exist a few sensor network based systems to address this
problem. However, these techniques are not suitable enough in terms of
monitoring an entire transportation system and delivering emergency services
when needed. These techniques require real-time data and intelligent ways to
quickly determine traffic activity from useful information. In addition, these
existing systems and websites on city transportation and travel rely on rating
scores for different factors (e.g., safety, low crime rate, cleanliness, etc.).
These rating scores are not efficient enough to deliver precise information,
whereas reviews or tweets are significant, because they help travelers and
transportation administrators to know about each aspect of the city. However,
it is difficult for travelers to read, and for transportation systems to
process, all reviews and tweets to obtain expressive sentiments regarding the
needs of the city. The optimum solution for this kind of problem is analyzing
the information available on social network platforms and performing sentiment
analysis. On the other hand, crisp ontology-based frameworks cannot extract
blurred information from tweets and reviews; therefore, they produce inadequate
results. In this regard, this paper proposes fuzzy ontology-based sentiment
analysis and SWRL rule-based decision-making to monitor transportation
activities and to make a city- feature polarity map for travelers. This system
retrieves reviews and tweets related to city features and transportation
activities. The feature opinions are extracted from these retrieved data, and
then fuzzy ontology is used to determine the transportation and city-feature
polarity. A fuzzy ontology and an intelligent system prototype are developed by
using Prot\'eg\'e OWL and Java, respectively.
","[{'version': 'v1', 'created': 'Thu, 19 Jan 2017 08:50:37 GMT'}]",2017-01-20,"[['Ali', 'Farman', ''], ['Kwak', 'D.', ''], ['Khan', 'Pervez', ''], ['Islam', 'S. M. Riazul', ''], ['Kim', 'K. H.', ''], ['Kwak', 'K. S.', '']]","['intelligent transportation system', 'safe traveling', 'transportation activities', 'city-feature polarity', 'fuzzy ontology']"
19441,1702.02285,Zhenhao Ge,"Zhenhao Ge, Ananth N. Iyer, Srinath Cheluvaraja, Aravind Ganapathiraju","Speaker Change Detection Using Features through A Neural Network Speaker
  Classifier","Intelligent System Conference 2017, Sep. 7-8, 2017, London, UK. arXiv
  admin note: text overlap with arXiv:1702.02289",,,,cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The mechanism proposed here is for real-time speaker change detection in
conversations, which firstly trains a neural network text-independent speaker
classifier using in-domain speaker data. Through the network, features of
conversational speech from out-of-domain speakers are then converted into
likelihood vectors, i.e. similarity scores comparing to the in-domain speakers.
These transformed features demonstrate very distinctive patterns, which
facilitates differentiating speakers and enable speaker change detection with
some straight-forward distance metrics. The speaker classifier and the speaker
change detector are trained/tested using speech of the first 200 (in-domain)
and the remaining 126 (out-of-domain) male speakers in TIMIT respectively. For
the speaker classification, 100% accuracy at a 200 speaker size is achieved on
any testing file, given the speech duration is at least 0.97 seconds. For the
speaker change detection using speaker classification outputs, performance
based on 0.5, 1, and 2 seconds of inspection intervals were evaluated in terms
of error rate and F1 score, using synthesized data by concatenating speech from
various speakers. It captures close to 97% of the changes by comparing the
current second of speech with the previous second, which is very competitive
among literature using other methods.
","[{'version': 'v1', 'created': 'Wed, 8 Feb 2017 04:37:40 GMT'}]",2017-03-20,"[['Ge', 'Zhenhao', ''], ['Iyer', 'Ananth N.', ''], ['Cheluvaraja', 'Srinath', ''], ['Ganapathiraju', 'Aravind', '']]","['Speaker Change Detection', 'Speaker Classification', 'Neural Network']"
19442,1401.4539,S.M. Ferdous,"S.M. Ferdous, M. Sohel Rahman","Solving the Minimum Common String Partition Problem with the Help of
  Ants",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider the problem of finding a minimum common partition
of two strings. The problem has its application in genome comparison. As it is
an NP-hard, discrete combinatorial optimization problem, we employ a
metaheuristic technique, namely, MAX-MIN ant system to solve this problem. To
achieve better efficiency we first map the problem instance into a special kind
of graph. Subsequently, we employ a MAX-MIN ant system to achieve high quality
solutions for the problem. Experimental results show the superiority of our
algorithm in comparison with the state of art algorithm in the literature. The
improvement achieved is also justified by standard statistical test.
","[{'version': 'v1', 'created': 'Sat, 18 Jan 2014 13:15:30 GMT'}, {'version': 'v2', 'created': 'Wed, 21 May 2014 06:35:41 GMT'}]",2015-06-22,"[['Ferdous', 'S. M.', ''], ['Rahman', 'M. Sohel', '']]","['Ant Colony Optimization', 'Stringology', 'Genome sequencing', 'Combinatorial Optimization', 'Swarm Intelligence', 'String partitioning']"
19443,1704.08625,Bart{\l}omiej B{\l}aszczyszyn,Jocelyne Elias and Bart{\l}omiej B{\l}aszczyszyn,"Optimal Geographic Caching in Cellular Networks with Linear Content
  Coding","6 pages, 3 figures. In Proc. of WIOPT/CCDWN 2017",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We state and solve a problem of the optimal geographic caching of content in
cellular networks, where linear combinations of contents are stored in the
caches of base stations. We consider a general content popularity distribution
and a general distribution of the number of stations covering the typical
location in the network. We are looking for a policy of content caching
maximizing the probability of serving the typical content request from the
caches of covering stations. The problem has a special form of monotone
sub-modular set function maximization. Using dynamic programming, we find a
deterministic policy solving the problem. We also consider two natural greedy
caching policies. We evaluate our policies considering two popular stochastic
geometric coverage models: the Boolean one and the
Signal-to-Interference-and-Noise-Ratio one, assuming Zipf popularity
distribution. Our numerical results show that the proposed deterministic
policies are in general not worse than some randomized policy considered in the
literature and can further improve the total hit probability in the moderately
high coverage regime.
","[{'version': 'v1', 'created': 'Thu, 27 Apr 2017 15:45:36 GMT'}]",2017-04-28,"[['Elias', 'Jocelyne', ''], ['Błaszczyszyn', 'Bartłomiej', '']]","['Cellular caching', 'Network coding', 'Hit probability', 'Coverage model', 'Optimization', 'Stochastic Geometry']"
19444,1511.06996,Fulvio Forni,"Fulvio Forni, Alexandre Mauroy, Rodolphe Sepulchre","Differential positivity characterizes one-dimensional normally
  hyperbolic attractors",,,,,cs.SY math.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper shows that normally hyperbolic one-dimensional compact attractors
of smooth dynamical systems are characterized by differential positivity, that
is, the pointwise infinitesimal contraction of a smooth cone field. The result
is analog to the characterization of zero-dimensional hyperbolic attractors by
differential stability, which is the pointwise infinitesimal contraction of a
Riemannian metric.
","[{'version': 'v1', 'created': 'Sun, 22 Nov 2015 11:29:22 GMT'}]",2015-11-24,"[['Forni', 'Fulvio', ''], ['Mauroy', 'Alexandre', ''], ['Sepulchre', 'Rodolphe', '']]","['differential positivity', 'normal hyperbolicity', 'converse theorems']"
19445,1005.4035,Debotosh Bhattacharjee,"Mrinal Kanti Bhowmik, Debotosh Bhattacharjee, Mita Nasipuri, Dipak
  Kumar Basu and Mahantapas Kundu","Classification of Polar-Thermal Eigenfaces using Multilayer Perceptron
  for Human Face Recognition",,ICIIS 2008,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel approach to handle the challenges of face
recognition. In this work thermal face images are considered, which minimizes
the affect of illumination changes and occlusion due to moustache, beards,
adornments etc. The proposed approach registers the training and testing
thermal face images in polar coordinate, which is capable to handle
complicacies introduced by scaling and rotation. Polar images are projected
into eigenspace and finally classified using a multi-layer perceptron. In the
experiments we have used Object Tracking and Classification Beyond Visible
Spectrum (OTCBVS) database benchmark thermal face images. Experimental results
show that the proposed approach significantly improves the verification and
identification performance and the success rate is 97.05%.
","[{'version': 'v1', 'created': 'Fri, 21 May 2010 18:07:42 GMT'}]",2010-07-01,"[['Bhowmik', 'Mrinal Kanti', ''], ['Bhattacharjee', 'Debotosh', ''], ['Nasipuri', 'Mita', ''], ['Basu', 'Dipak Kumar', ''], ['Kundu', 'Mahantapas', '']]","['Thermal infrared images', 'Polar conversion', 'Eigenspace projection', 'Multilayer Perceptron', 'Backpropagation learning', 'Face recognition', 'Classification']"
19446,0801.3117,Yongzhi Cao,Yongzhi Cao,"A hierarchy of behavioral equivalences in the $\pi$-calculus with noisy
  channels","30 pages, 2 figures","Comput. J., vol. 53, no. 1, pp. 3-20, 2010",,,cs.LO,,"  The $\pi$-calculus is a process algebra where agents interact by sending
communication links to each other via noiseless communication channels. Taking
into account the reality of noisy channels, an extension of the $\pi$-calculus,
called the $\pi_N$-calculus, has been introduced recently. In this paper, we
present an early transitional semantics of the $\pi_N$-calculus, which is not a
directly translated version of the late semantics of $\pi_N$, and then extend
six kinds of behavioral equivalences consisting of reduction bisimilarity,
barbed bisimilarity, barbed equivalence, barbed congruence, bisimilarity, and
full bisimilarity into the $\pi_N$-calculus. Such behavioral equivalences are
cast in a hierarchy, which is helpful to verify behavioral equivalence of two
agents. In particular, we show that due to the noisy nature of channels, the
coincidence of bisimilarity and barbed equivalence, as well as the coincidence
of full bisimilarity and barbed congruence, in the $\pi$-calculus does not hold
in $\pi_N$.
","[{'version': 'v1', 'created': 'Mon, 21 Jan 2008 00:42:52 GMT'}]",2011-10-04,"[['Cao', 'Yongzhi', '']]","['π-calculus', 'π-calculus with noisy channels', 'barbed equivalence', 'barbed congruence', 'bisimilarity']"
19447,1611.00119,Fernando Gama,"Fernando Gama, Antonio G. Marques, Gonzalo Mateos, Alejandro Ribeiro",Rethinking Sketching as Sampling: A Graph Signal Processing Approach,Submitted to Elsevier Signal Processing,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sampling of signals belonging to a low-dimensional subspace has
well-documented merits for dimensionality reduction, limited memory storage,
and online processing of streaming network data. When the subspace is known,
these signals can be modeled as bandlimited graph signals. Most existing
sampling methods are designed to minimize the error incurred when
reconstructing the original signal from its samples. Oftentimes these
parsimonious signals serve as inputs to computationally-intensive linear
operators. Hence, interest shifts from reconstructing the signal itself towards
approximating the output of the prescribed linear operator efficiently. In this
context, we propose a novel sampling scheme that leverages graph signal
processing, exploiting the low-dimensional (bandlimited) structure of the input
as well as the transformation whose output we wish to approximate. We formulate
problems to jointly optimize sample selection and a sketch of the target linear
transformation, so when the latter is applied to the sampled input signal the
result is close to the desired output. Similar sketching as sampling ideas are
also shown effective in the context of linear inverse problems. Because these
designs are carried out off line, the resulting sampling plus
reduced-complexity processing pipeline is particularly useful for data that are
acquired or processed in a sequential fashion, where the linear operator has to
be applied fast and repeatedly to successive inputs or response signals.
Numerical tests showing the effectiveness of the proposed algorithms include
classification of handwritten digits from as few as 20 out of 784 pixels in the
input images and selection of sensors from a network deployed to carry out a
distributed parameter estimation task.
","[{'version': 'v1', 'created': 'Tue, 1 Nov 2016 03:57:55 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Sep 2018 23:54:42 GMT'}, {'version': 'v3', 'created': 'Mon, 25 Nov 2019 17:08:35 GMT'}]",2019-11-26,"[['Gama', 'Fernando', ''], ['Marques', 'Antonio G.', ''], ['Mateos', 'Gonzalo', ''], ['Ribeiro', 'Alejandro', '']]","['Sketching', 'sampling', 'streaming', 'linear transforms', 'linear inverseproblems', 'graph signal processing']"
19448,1412.4311,Leopoldo Bertossi,Babak Salimi and Leopoldo Bertossi,"From Causes for Database Queries to Repairs and Model-Based Diagnosis
  and Back",Extended version of paper to appear in Proceedings of ICDT 2015,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we establish and investigate connections between causality for
query answers in databases, database repairs wrt. denial constraints, and
consistency-based diagnosis. The first two are relatively new problems in
databases, and the third one is an established subject in knowledge
representation. We show how to obtain database repairs from causes and the
other way around. Causality problems are formulated as diagnosis problems, and
the diagnoses provide causes and their responsibilities. The vast body of
research on database repairs can be applied to the newer problem of determining
actual causes for query answers and their responsibilities. These connections,
which are interesting per se, allow us, after a transition -inspired by
consistency-based diagnosis- to computational problems on hitting sets and
vertex covers in hypergraphs, to obtain several new algorithmic and complexity
results for causality in databases.
","[{'version': 'v1', 'created': 'Sun, 14 Dec 2014 04:27:14 GMT'}]",2014-12-16,"[['Salimi', 'Babak', ''], ['Bertossi', 'Leopoldo', '']]","['causality', 'diagnosis', 'repairs', 'consistent query answering', 'integrity constraints']"
19449,1004.2316,Sumio Watanabe,Sumio Watanabe,"Asymptotic Equivalence of Bayes Cross Validation and Widely Applicable
  Information Criterion in Singular Learning Theory",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In regular statistical models, the leave-one-out cross-validation is
asymptotically equivalent to the Akaike information criterion. However, since
many learning machines are singular statistical models, the asymptotic behavior
of the cross-validation remains unknown. In previous studies, we established
the singular learning theory and proposed a widely applicable information
criterion, the expectation value of which is asymptotically equal to the
average Bayes generalization loss. In the present paper, we theoretically
compare the Bayes cross-validation loss and the widely applicable information
criterion and prove two theorems. First, the Bayes cross-validation loss is
asymptotically equivalent to the widely applicable information criterion as a
random variable. Therefore, model selection and hyperparameter optimization
using these two values are asymptotically equivalent. Second, the sum of the
Bayes generalization error and the Bayes cross-validation error is
asymptotically equal to $2\lambda/n$, where $\lambda$ is the real log canonical
threshold and $n$ is the number of training samples. Therefore the relation
between the cross-validation error and the generalization error is determined
by the algebraic geometrical structure of a learning machine. We also clarify
that the deviance information criteria are different from the Bayes
cross-validation and the widely applicable information criterion.
","[{'version': 'v1', 'created': 'Wed, 14 Apr 2010 05:08:48 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Oct 2010 01:55:02 GMT'}]",2010-10-15,"[['Watanabe', 'Sumio', '']]","['Cross-validation', 'Information Criterion', 'Singular Learning Machine', 'Birational Invariant']"
19450,0907.3986,Aleksandrs Slivkins,Aleksandrs Slivkins,Contextual Bandits with Similarity Information,"This is the full version of a conference paper in COLT 2011, to
  appear in JMLR in 2014. A preliminary version of this manuscript (with all
  the results) has been posted to arXiv in February 2011. An earlier version on
  arXiv, which does not include the results in Section 6, dates back to July
  2009. The present revision addresses various presentation issues pointed out
  by journal referees",,,,cs.DS cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a multi-armed bandit (MAB) problem, an online algorithm makes a sequence
of choices. In each round it chooses from a time-invariant set of alternatives
and receives the payoff associated with this alternative. While the case of
small strategy sets is by now well-understood, a lot of recent work has focused
on MAB problems with exponentially or infinitely large strategy sets, where one
needs to assume extra structure in order to make the problem tractable. In
particular, recent literature considered information on similarity between
arms.
  We consider similarity information in the setting of ""contextual bandits"", a
natural extension of the basic MAB problem where before each round an algorithm
is given the ""context"" -- a hint about the payoffs in this round. Contextual
bandits are directly motivated by placing advertisements on webpages, one of
the crucial problems in sponsored search. A particularly simple way to
represent similarity information in the contextual bandit setting is via a
""similarity distance"" between the context-arm pairs which gives an upper bound
on the difference between the respective expected payoffs.
  Prior work on contextual bandits with similarity uses ""uniform"" partitions of
the similarity space, which is potentially wasteful. We design more efficient
algorithms that are based on adaptive partitions adjusted to ""popular"" context
and ""high-payoff"" arms.
","[{'version': 'v1', 'created': 'Thu, 23 Jul 2009 06:41:33 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Feb 2011 00:49:41 GMT'}, {'version': 'v3', 'created': 'Thu, 2 Jun 2011 17:32:29 GMT'}, {'version': 'v4', 'created': 'Mon, 13 Jan 2014 17:30:07 GMT'}, {'version': 'v5', 'created': 'Tue, 20 May 2014 03:52:46 GMT'}]",2014-05-21,"[['Slivkins', 'Aleksandrs', '']]","['online learning', 'multi-armed bandits', 'contextual bandits', 'regret minimization', 'metric spaces']"
19451,1501.00503,Sebasti\'an Basterrech,Sebasti\'an Basterrech,An Empirical Study of the L2-Boost technique with Echo State Networks,"To appear in Journal of Network and Innovative Computing, Volume 2,
  Issue 1, pp. 120 - 127, 2014",,,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A particular case of Recurrent Neural Network (RNN) was introduced at the
beginning of the 2000s under the name of Echo State Networks (ESNs). The ESN
model overcomes the limitations during the training of the RNNs while
introducing no significant disadvantages. Although the model presents some
well-identified drawbacks when the parameters are not well initialised. The
performance of an ESN is highly dependent on its internal parameters and
pattern of connectivity of the hidden-hidden weights Often, the tuning of the
network parameters can be hard and can impact in the accuracy of the models.
  In this work, we investigate the performance of a specific boosting technique
(called L2-Boost) with ESNs as single predictors. The L2-Boost technique has
been shown to be an effective tool to combine ""weak"" predictors in regression
problems. In this study, we use an ensemble of random initialized ESNs (without
control their parameters) as ""weak"" predictors of the boosting procedure. We
evaluate our approach on five well-know time-series benchmark problems.
Additionally, we compare this technique with a baseline approach that consists
of averaging the prediction of an ensemble of ESNs.
","[{'version': 'v1', 'created': 'Fri, 2 Jan 2015 21:15:00 GMT'}]",2015-01-06,"[['Basterrech', 'Sebastián', '']]","['L2-boosting', 'Echo State Network', 'Time-series modeling', 'Reservoir Computing', 'Ensemble Methods']"
19452,1108.3405,Ali Karimodini,"A. Karimoddini, H. Lin, B. M. Chen, T. H. Lee",Hybrid 3-D Formation Control for Unmanned Helicopters,Submitted for publication,,,NUS-ACT-11-005,cs.SY cs.MA cs.RO math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Teams of Unmanned Aerial Vehicles (UAVs) form typical networked
cyber-physical systems that involve the interaction of discrete logic and
continuous dynamics. This paper presents a hybrid supervisory control framework
for the three-dimensional leader follower formation control of unmanned
helicopters. The proposed hybrid control framework captures internal
interactions between the decision making unit and the path planner continuous
dynamics of the system, and hence improves the system's overall reliability. To
design such a hybrid controller, a spherical abstraction of the state space is
proposed as a new method of abstraction. Utilizing the properties of
multi-affine functions over the partitioned space leads to a finite state
Discrete Event System (DES) model, which is shown to be bisimilar to the
original continuous-variable dynamical system. Then, in the discrete domain, a
logic supervisor is modularly designed for the abstracted model. Due to the
bisimilarity between the abstracted DES model and the original UAV dynamics,
the designed logic supervisor can be implemented as a hybrid controller through
an interface layer. This supervisor drives the UAV dynamics to satisfy the
design requirements. In other words, the hybrid controller is able to bring the
UAVs to the desired formation starting from any initial state inside the
control horizon and then, maintain the formation. Moreover, a collision
avoidance mechanism is embedded in the designed supervisor. Finally, the
algorithm has been verified by a hardware-in-the-loop simulation platform,
which is developed for unmanned helicopters. The presented results show the
effectiveness of the algorithm.
","[{'version': 'v1', 'created': 'Wed, 17 Aug 2011 06:46:50 GMT'}]",2015-03-19,"[['Karimoddini', 'A.', ''], ['Lin', 'H.', ''], ['Chen', 'B. M.', ''], ['Lee', 'T. H.', '']]","['Formation control', 'unmanned aerial vehicles', 'hybrid supervisory control']"
19453,1511.04428,Reza Arablouei,"Reza Arablouei, Kutluy{\i}l Do\u{g}an\c{c}ay, Stefan Werner, and
  Yih-Fang Huang","On the Asymptotic Bias of the Diffusion-Based Distributed Pareto
  Optimization",,,,,cs.DC cs.GT cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We revisit the asymptotic bias analysis of the distributed Pareto
optimization algorithm developed based on the diffusion strategies. We propose
an alternative way to analyze the asymptotic bias of this algorithm at small
step-sizes and show that the asymptotic bias descends to zero with a linear
dependence on the largest step-size parameter when this parameter is
sufficiently small. In addition, through the proposed analytic approach, we
provide an expression for the small-step-size asymptotic bias when a condition
assumed jointly on the combination matrices and the step-sizes does not
strictly hold. This is a likely scenario in practice, which has not been
considered in the original paper that introduced the algorithm. Our methodology
provides new insights into the inner workings of the diffusion Pareto
optimization algorithm while being considerably less involved than the
small-step-size asymptotic bias analysis presented in the original work. This
is because we take advantage of the special eigenstructure of the composite
combination matrix used in the algorithm without calling for any eigenspace
decomposition or matrix inversion.
","[{'version': 'v1', 'created': 'Fri, 13 Nov 2015 20:37:59 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Jan 2016 01:43:48 GMT'}, {'version': 'v3', 'created': 'Sat, 4 Jun 2016 08:41:19 GMT'}]",2016-06-07,"[['Arablouei', 'Reza', ''], ['Doğançay', 'Kutluyıl', ''], ['Werner', 'Stefan', ''], ['Huang', 'Yih-Fang', '']]","['Asymptotic bias', 'diffusion strategies', 'distributed optimization', 'Pareto optimization', 'performance']"
19454,1008.0757,Zhineng Chen,"Zhineng Chen, Juan Cao, Yicheng Song, Yongdong Zhang, Jintao Li","Web Video Categorization based on Wikipedia Categories and
  Content-Duplicated Open Resources","4 pages, 3 figures, 2 tables",,,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a novel approach for web video categorization by
leveraging Wikipedia categories (WikiCs) and open resources describing the same
content as the video, i.e., content-duplicated open resources (CDORs). Note
that current approaches only col-lect CDORs within one or a few media forms and
ignore CDORs of other forms. We explore all these resources by utilizing WikiCs
and commercial search engines. Given a web video, its discrimin-ative Wikipedia
concepts are first identified and classified. Then a textual query is
constructed and from which CDORs are collected. Based on these CDORs, we
propose to categorize web videos in the space spanned by WikiCs rather than
that spanned by raw tags. Experimental results demonstrate the effectiveness of
both the proposed CDOR collection method and the WikiC voting catego-rization
algorithm. In addition, the categorization model built based on both WikiCs and
CDORs achieves better performance compared with the models built based on only
one of them as well as state-of-the-art approach.
","[{'version': 'v1', 'created': 'Wed, 4 Aug 2010 12:01:39 GMT'}]",2010-08-05,"[['Chen', 'Zhineng', ''], ['Cao', 'Juan', ''], ['Song', 'Yicheng', ''], ['Zhang', 'Yongdong', ''], ['Li', 'Jintao', '']]","['Wikipedia categories', 'open resource', 'web video categorization']"
19455,1702.05240,Gregor Jer\v{s}e,Gregor Jer\v{s}e and Matija Lokar,"Student's opinions about System for automatic assessment of programming
  tasks Projekt Tomo",,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a previous paper a web service called Projekt Tomo intended to ease the
process of learning programming for teachers and students has been described.
Since the service received a very warm welcome from teachers and students alike
we decided to collect additional information on the students' view of the
service in order to improve it even further.
  In the paper we briefly present our web service and a detailed analysis of
the questionnaire handed out to the students of the highschool level
programming course in Python.
","[{'version': 'v1', 'created': 'Fri, 17 Feb 2017 07:12:02 GMT'}]",2017-02-20,"[['Jerše', 'Gregor', ''], ['Lokar', 'Matija', '']]","['programming', 'teaching', 'web service']"
19456,0705.1400,Damien Chablat,"Philippe Wenger (IRCCyN), Maher Baili (IRCCyN), Damien Chablat
  (IRCCyN)",A Workspace based Classification of 3R Orthogonal Manipulators,,"9th International Symposium on Advances in Robot Kinematics (2004)
  1-10",,,cs.RO,,"  A classification of a family of 3-revolute (3R) positioning manipulators is
established. This classification is based on the topology of their workspace.
The workspace is characterized in a half-cross section by the singular curves
of the manipulator. The workspace topology is defined by the number of cusps
and nodes that appear on these singular curves. The design parameters space is
shown to be partitioned into nine subspaces of distinct workspace topologies.
Each separating surface is given as an explicit expression in the
DH-parameters.
","[{'version': 'v1', 'created': 'Thu, 10 May 2007 07:05:37 GMT'}]",2007-05-23,"[['Wenger', 'Philippe', '', 'IRCCyN'], ['Baili', 'Maher', '', 'IRCCyN'], ['Chablat', 'Damien', '', 'IRCCyN']]","['Classification', 'Workspace', 'Singularity', 'Cusp', 'node', 'orthogonal manipulator']"
19457,1107.4810,Ronald Caplan,Ronald M. Caplan and Ricardo Carretero-Gonz\'alez,"Numerical Stability of Explicit Runge-Kutta Finite-Difference Schemes
  for the Nonlinear Schr\""odinger Equation","21 pages, 6 figures",,,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linearized numerical stability bounds for solving the nonlinear
time-dependent Schr\""odinger equation (NLSE) using explicit finite-differencing
are shown. The bounds are computed for the fourth-order Runge-Kutta scheme in
time and both second-order and fourth-order central differencing in space.
Results are given for Dirichlet, modulus-squared Dirichlet, Laplacian-zero, and
periodic boundary conditions for one, two, and three dimensions. Our approach
is to use standard Runge-Kutta linear stability theory, treating the
nonlinearity of the NLSE as a constant. The required bounds on the eigenvalues
of the scheme matrices are found analytically when possible, and otherwise
estimated using the Gershgorin circle theorem.
","[{'version': 'v1', 'created': 'Sun, 24 Jul 2011 22:08:52 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Aug 2011 19:12:54 GMT'}, {'version': 'v3', 'created': 'Sun, 1 Jul 2012 20:58:31 GMT'}, {'version': 'v4', 'created': 'Tue, 1 Jan 2013 07:52:08 GMT'}]",2013-01-03,"[['Caplan', 'Ronald M.', ''], ['Carretero-González', 'Ricardo', '']]","['Numerical stability', 'Explicit finite difference schemes', 'Nonlinear Schr¨odinger equation']"
19458,1606.05047,Anant Shah,"Anant Shah, Romain Fontunge, Christos Papadopoulos",Towards Characterizing International Routing Detours,,,,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  There are currently no requirements (technical or otherwise) that BGP paths
must be contained within national boundaries. Indeed, some paths experience
international detours, i.e., originate in one country, cross international
boundaries and return to the same country. In most cases these are sensible
traffic engineering or peering decisions at ISPs that serve multiple countries.
In some cases such detours may be suspicious. Characterizing international
detours is useful to a number of players: (a) network engineers trying to
diagnose persistent problems, (b) policy makers aiming at adhering to certain
national communication policies, (c) entrepreneurs looking for opportunities to
deploy new networks, or (d) privacy-conscious states trying to minimize the
amount of internal communication traversing different jurisdictions. In this
paper we characterize international detours in the Internet during the month of
January 2016. To detect detours we sample BGP RIBs every 8 hours from 461
RouteViews and RIPE RIS peers spanning 30 countries. Then geolocate visible
ASes by geolocating each BGP prefix announced by each AS, mapping its presence
at IXPs and geolocation infrastructure IPs. Finally, analyze each global BGP
RIB entry looking for detours. Our analysis shows more than 5K unique BGP
prefixes experienced a detour. A few ASes cause most detours and a small
fraction of prefixes were affected the most. We observe about 544K detours.
Detours either last for a few days or persist the entire month. Out of all the
detours, more than 90% were transient detours that lasted for 72 hours or less.
We also show different countries experience different characteristics of
detours.
","[{'version': 'v1', 'created': 'Thu, 16 Jun 2016 04:22:53 GMT'}]",2016-06-17,"[['Shah', 'Anant', ''], ['Fontunge', 'Romain', ''], ['Papadopoulos', 'Christos', '']]","['AS Geolocation', 'Routing Detours', 'MITM']"
19459,1205.5024,A.K. Mishra Dr.,A.K. Mishra and H. Chandrasekharan,Analytical Study of Hexapod miRNAs using Phylogenetic Methods,,,,,cs.CE q-bio.GN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  MicroRNAs (miRNAs) are a class of non-coding RNAs that regulate gene
expression. Identification of total number of miRNAs even in completely
sequenced organisms is still an open problem. However, researchers have been
using techniques that can predict limited number of miRNA in an organism. In
this paper, we have used homology based approach for comparative analysis of
miRNA of hexapoda group .We have used Apis mellifera, Bombyx mori, Anopholes
gambiae and Drosophila melanogaster miRNA datasets from miRBase repository. We
have done pair wise as well as multiple alignments for the available miRNAs in
the repository to identify and analyse conserved regions among related species.
Unfortunately, to the best of our knowledge, miRNA related literature does not
provide in depth analysis of hexapods. We have made an attempt to derive the
commonality among the miRNAs and to identify the conserved regions which are
still not available in miRNA repositories. The results are good approximation
with a small number of mismatches. However, they are encouraging and may
facilitate miRNA biogenesis for
","[{'version': 'v1', 'created': 'Tue, 22 May 2012 10:28:29 GMT'}]",2012-05-24,"[['Mishra', 'A. K.', ''], ['Chandrasekharan', 'H.', '']]","['miRNA', 'homology', 'alignment', 'conservation', 'sequences']"
19460,1305.7185,Philippe Martin,Philippe A. Martin,Collaborative ontology sharing and editing,"12 pages, 2 figures, journal",IJCSIS 6 (2011) 14-29,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article first lists reasons why - in the long term or when creating a
new knowledge base (KB) for general knowledge sharing purposes -
collaboratively building a well-organized KB does/can provide more
possibilities, with on the whole no more costs, than the mainstream approach
where knowledge creation and re-use involves searching, merging and creating
(semi-)independent (relatively small) ontologies or semi-formal documents. The
article lists elements required to achieve this and describes the main one: a
KB editing protocol that keeps the KB free of automatically/manually detected
inconsistencies while not forcing them to discuss or agree on terminology and
beliefs nor requiring a selection committee.
","[{'version': 'v1', 'created': 'Thu, 30 May 2013 18:06:05 GMT'}]",2013-05-31,"[['Martin', 'Philippe A.', '']]","['Knowledge sharing', 'integration', 'retrieval and evaluation']"
19461,1604.07427,Razieh Abdollahi,"Zahra Razaghi-Moghadam, Razieh Abdollahi, Sama Goliaei, and Morteza
  Ebrahimi","NRSSPrioritize: Associating Protein Complex and Disease Similarity
  Information to Prioritize Disease Candidate Genes",13 pages,,,,cs.CE q-bio.GN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The identification of disease-associated genes has recently gathered much
attention for uncovering disease complex mechanisms that could lead to new
insights into the treatment of diseases. For exploring disease-susceptible
genes, not only experimental approaches such as genome-wide association studies
(GWAS) have been used, but also computational methods. Since experimental
approaches are both time-consuming and expensive, numerous studies have
utilized computational techniques to explore disease genes. These methods use
various biological data sources and known disease genes to prioritize disease
candidate genes. In this paper, we propose a gene prioritization method
(NRSSPrioritize), which benefits from both local and global measures of a
protein-protein interaction (PPI) network and also from disease similarity
knowledge to suggest candidate genes for colorectal cancer (CRC)
susceptibility. Network Propagation, Random Walk with Restart, and Shortest
Paths are three network analysis tools that are applied to a PPI network for
the purpose of scoring candidate genes. Also, by looking through diseases with
similar symptoms to CRC and obtaining their causing genes, candidate genes are
scored in a different way. Finally, to integrate these four different scoring
schemes, Technique for Order Preference by Similarity to Ideal Solution
(TOPSIS) and Analytic Network Process (ANP) methods are applied to obtain
appropriate weights for the above four quantified measures and the weighted
summation of these measures are used to calculate the final score of each
candidate gene. NRSSPrioritize was validated by cross-validation analysis and
its results were compared with other prioritization tools, which gave the best
performance when using our proposed method.
","[{'version': 'v1', 'created': 'Mon, 25 Apr 2016 20:13:30 GMT'}]",2016-04-27,"[['Razaghi-Moghadam', 'Zahra', ''], ['Abdollahi', 'Razieh', ''], ['Goliaei', 'Sama', ''], ['Ebrahimi', 'Morteza', '']]","['Gene prioritization', 'Protein-protein interaction network', 'Symptoms', 'Colorectal cancer']"
19462,1511.07249,Louisa Harutyunyan,Louisa Harutyunyan,"On the total $(k,r)$-domination number of random graphs",,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A subset $S$ of a vertex set of a graph $G$ is a total $(k,r)$-dominating set
if every vertex $u \in V(G)$ is within distance $k$ of at least $r$ vertices in
$S$. The minimum cardinality among all total $(k,r)$-dominating sets of $G$ is
called the total $(k,r)$-domination number of $G$, denoted by
$\gamma^{t}_{(k,r)}(G)$. We previously gave an upper bound on
$\gamma^{t}_{(2,r)}(G(n,p))$ in random graphs with non-fixed $p \in (0,1)$. In
this paper we generalize this result to give an upper bound on
$\gamma^{t}_{(k,r)}(G(n,p))$ in random graphs with non-fixed $p \in (0,1)$ for
$k\geq 3$ as well as present an upper bound on $\gamma^{t}_{(k,r)}(G)$ in
graphs with large girth.
","[{'version': 'v1', 'created': 'Mon, 23 Nov 2015 14:52:10 GMT'}]",2015-11-24,"[['Harutyunyan', 'Louisa', '']]","['random graphs', 'total (k', 'r)-domination']"
19463,1707.07899,Andrzej Jaszkiewicz,Andrzej Jaszkiewicz,Many-Objective Pareto Local Search,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a new Pareto Local Search Algorithm for the many-objective
combinatorial optimization. Pareto Local Search proved to be a very effective
tool in the case of the bi-objective combinatorial optimization and it was used
in a number of the state-of-the-art algorithms for problems of this kind. On
the other hand, the standard Pareto Local Search algorithm becomes very
inefficient for problems with more than two objectives. We build an effective
Many-Objective Pareto Local Search algorithm using three new mechanisms: the
efficient update of large Pareto archives with ND-Tree data structure, a new
mechanism for the selection of the promising solutions for the neighborhood
exploration, and a partial exploration of the neighborhoods. We apply the
proposed algorithm to the instances of two different problems, i.e. the
traveling salesperson problem and the traveling salesperson problem with
profits with up to 5 objectives showing high effectiveness of the proposed
algorithm.
","[{'version': 'v1', 'created': 'Tue, 25 Jul 2017 10:29:04 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Dec 2017 14:00:25 GMT'}]",2017-12-15,"[['Jaszkiewicz', 'Andrzej', '']]","['Metaheuristics', 'Multiobjective optimization', 'Combinatorialoptimization', 'Pareto Local Search']"
19464,1702.06475,Arnaud Bannier,Arnaud Bannier and Eric Filiol,"Mathematical Backdoors in Symmetric Encryption Systems - Proposal for a
  Backdoored AES-like Block Cipher","This work has been presented at the FORmal Methods for Security
  Engineering (ForSE) conference 2017",,,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Recent years have shown that more than ever governments and intelligence
agencies try to control and bypass the cryptographic means used for the
protection of data. Backdooring encryption algorithms is considered as the best
way to enforce cryptographic control. Until now, only implementation backdoors
(at the protocol/implementation/management level) are generally considered. In
this paper we propose to address the most critical issue of backdoors:
mathematical backdoors or by-design backdoors, which are put directly at the
mathematical design of the encryption algorithm. While the algorithm may be
totally public, proving that there is a backdoor, identifying it and exploiting
it, may be an intractable problem. We intend to explain that it is probably
possible to design and put such backdoors. Considering a particular family
(among all the possible ones), we present BEA-1, a block cipher algorithm which
is similar to the AES and which contains a mathematical backdoor enabling an
operational and effective cryptanalysis. The BEA-1 algorithm (80-bit block
size, 120-bit key, 11 rounds) is designed to resist to linear and differential
cryptanalyses. A challenge will be proposed to the cryptography community soon.
Its aim is to assess whether our backdoor is easily detectable and exploitable
or not.
","[{'version': 'v1', 'created': 'Tue, 21 Feb 2017 17:11:37 GMT'}]",2017-02-22,"[['Bannier', 'Arnaud', ''], ['Filiol', 'Eric', '']]","['Cryptography', 'Encryption Algorithms', 'Backdoor', 'Trapdoor', 'Cryptanalysis', 'BlockCipher', 'AES']"
19465,1712.03903,Dan Liu,"Dan Liu, Ching Yee Suen, Olga Ormandjieva",A Novel Way of Identifying Cyber Predators,6 pages,,,,cs.CL cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recurrent Neural Networks with Long Short-Term Memory cell (LSTM-RNN) have
impressive ability in sequence data processing, particularly for language model
building and text classification. This research proposes the combination of
sentiment analysis, new approach of sentence vectors and LSTM-RNN as a novel
way for Sexual Predator Identification (SPI). LSTM-RNN language model is
applied to generate sentence vectors which are the last hidden states in the
language model. Sentence vectors are fed into another LSTM-RNN classifier, so
as to capture suspicious conversations. Hidden state enables to generate
vectors for sentences never seen before. Fasttext is used to filter the
contents of conversations and generate a sentiment score so as to identify
potential predators. The experiment achieves a record-breaking accuracy and
precision of 100% with recall of 81.10%, exceeding the top-ranked result in the
SPI competition.
","[{'version': 'v1', 'created': 'Mon, 11 Dec 2017 17:24:13 GMT'}]",2017-12-12,"[['Liu', 'Dan', ''], ['Suen', 'Ching Yee', ''], ['Ormandjieva', 'Olga', '']]","['Sentence vectors', 'RNN', 'LSTM', 'Sentiment Analysis']"
19466,1307.4007,Bruno Bauwens,Bruno Bauwens,"Asymmetry of the Kolmogorov complexity of online predicting odd and even
  bits","20 pages, 7 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Symmetry of information states that $C(x) + C(y|x) = C(x,y) + O(\log C(x))$.
We show that a similar relation for online Kolmogorov complexity does not hold.
Let the even (online Kolmogorov) complexity of an n-bitstring $x_1x_2... x_n$
be the length of a shortest program that computes $x_2$ on input $x_1$,
computes $x_4$ on input $x_1x_2x_3$, etc; and similar for odd complexity. We
show that for all n there exist an n-bit x such that both odd and even
complexity are almost as large as the Kolmogorov complexity of the whole
string. Moreover, flipping odd and even bits to obtain a sequence
$x_2x_1x_4x_3\ldots$, decreases the sum of odd and even complexity to $C(x)$.
","[{'version': 'v1', 'created': 'Mon, 15 Jul 2013 16:22:29 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Jul 2013 20:21:48 GMT'}, {'version': 'v3', 'created': 'Wed, 8 Jan 2014 16:21:15 GMT'}]",2014-01-09,"[['Bauwens', 'Bruno', '']]","['(On-line) Kolmogorov complexity', '(On-line) Algorithmic Probability', 'Philosophy of Causality', 'Information Transfer']"
19467,1401.2663,Cem Rifki Aydin M.Sc.,"Cem R{\i}fk{\i} Ayd{\i}n, Ali Erkan, Tunga G\""ung\""or, and Hidayet
  Tak\c{c}{\i}",Dictionary-Based Concept Mining: An Application for Turkish,"12 pages with 3 figures, to be published in ""International Conference
  on Foundations of Computer Science & Technology (CST 2014), Zurich,
  Switzerland - January 2014 Proceedings, AIRCC""",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, a dictionary-based method is used to extract expressive
concepts from documents. So far, there have been many studies concerning
concept mining in English, but this area of study for Turkish, an agglutinative
language, is still immature. We used dictionary instead of WordNet, a lexical
database grouping words into synsets that is widely used for concept
extraction. The dictionaries are rarely used in the domain of concept mining,
but taking into account that dictionary entries have synonyms, hypernyms,
hyponyms and other relationships in their meaning texts, the success rate has
been high for determining concepts. This concept extraction method is
implemented on documents, that are collected from different corpora.
","[{'version': 'v1', 'created': 'Sun, 12 Jan 2014 19:52:49 GMT'}]",2014-01-14,"[['Aydın', 'Cem Rıfkı', ''], ['Erkan', 'Ali', ''], ['Güngör', 'Tunga', ''], ['Takçı', 'Hidayet', '']]","['Concept mining', 'Morphological analysis', 'Morphological disambiguation']"
19468,0705.1939,Hamed Haddadi MSc MIEE,"Richard G. Clegg, Hamed Haddadi, Raul Landa, Miguel Rio",Towards Informative Statistical Flow Inversion,,,,,cs.NI cs.PF,,"  A problem which has recently attracted research attention is that of
estimating the distribution of flow sizes in internet traffic. On high traffic
links it is sometimes impossible to record every packet. Researchers have
approached the problem of estimating flow lengths from sampled packet data in
two separate ways. Firstly, different sampling methodologies can be tried to
more accurately measure the desired system parameters. One such method is the
sample-and-hold method where, if a packet is sampled, all subsequent packets in
that flow are sampled. Secondly, statistical methods can be used to ``invert''
the sampled data and produce an estimate of flow lengths from a sample.
  In this paper we propose, implement and test two variants on the
sample-and-hold method. In addition we show how the sample-and-hold method can
be inverted to get an estimation of the genuine distribution of flow sizes.
Experiments are carried out on real network traces to compare standard packet
sampling with three variants of sample-and-hold. The methods are compared for
their ability to reconstruct the genuine distribution of flow sizes in the
traffic.
","[{'version': 'v1', 'created': 'Mon, 14 May 2007 13:14:33 GMT'}]",2007-05-23,"[['Clegg', 'Richard G.', ''], ['Haddadi', 'Hamed', ''], ['Landa', 'Raul', ''], ['Rio', 'Miguel', '']]","['Sampling', 'Inference', 'Inversion']"
19469,0710.4999,Willemien Visser,Willemien Visser (INRIA Rocquencourt),L'analyse de l'expertise du point de vue de l'ergonomie cognitive,,"Dans Les expertises sensorielles : Nature et acquisition (2006)
  1-12",,,cs.HC,,"  This paper presents a review of methods for collecting and analysing data on
complex activities. Starting with methods developed for design, we examine the
possibility to transpose them to other complex activities, especially
activities referring to sensorial expertise. R\'esum\'e Ce texte pr\'esente une
revue de m\'ethodes pour recueillir et analyser des donn\'ees sur des
actvit\'es complexes. A partir de m\'ethodes d\'evelopp\'ees pour des
actvit\'es de conception, nous examinons la possibilit\'e de les transposer \`a
d'autres actvit\'es complexes, notamment des actvit\'es faisant \`a appel \`a
des expertises sensorielles.
","[{'version': 'v1', 'created': 'Fri, 26 Oct 2007 06:32:22 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Nov 2007 08:56:00 GMT'}]",2007-11-08,"[['Visser', 'Willemien', '', 'INRIA Rocquencourt']]","['Expertise', 'Data collection and analysis', 'Activity', 'Knowledge representation structures', 'Design', 'Cognitive design studies']"
19470,1505.02905,Kim-Kwang Raymond Choo,"Abdullah Azfar, Kim-Kwang Raymond Choo, Lin Liu",Forensic Taxonomy of Popular Android mHealth Apps,"Proceedings of 21st Americas Conference on Information Systems (AMCIS
  2015)",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile health applications (or mHealth apps, as they are commonly known) are
increasingly popular with both individual end users and user groups such as
physicians. Due to their ability to access, store and transmit personally
identifiable and sensitive information (e.g. geolocation information and
personal details), they are potentially an important source of evidentiary
materials in digital investigations. In this paper, we examine 40 popular
Android mHealth apps. Based on our findings, we propose a taxonomy
incorporating artefacts of forensic interest to facilitate the timely
collection and analysis of evidentiary materials from mobile devices involving
the use of such apps. Artefacts of forensic interest recovered include user
details and email addresses, chronology of user locations and food habits. We
are also able to recover user credentials (e.g. user password and four-digit
app login PIN number), locate user profile pictures and identify timestamp
associated with the location of a user.
","[{'version': 'v1', 'created': 'Tue, 12 May 2015 08:38:34 GMT'}]",2015-05-13,"[['Azfar', 'Abdullah', ''], ['Choo', 'Kim-Kwang Raymond', ''], ['Liu', 'Lin', '']]","['Android forensics', 'Digital forensics', 'Health app', 'Calorie Counter-MyFitnessPal app', 'Period calendar app', 'RunKeeper app', 'Mobile health app taxonomy']"
19471,1406.7093,Yinglong Ma,Yinglong Ma and Moyi Shi,"Using multi-categorization semantic analysis and personalization for
  semantic search",15 pages,,,SCCE-002,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Semantic search technology has received more attention in the last years.
Compared with the keyword based search, semantic search is used to excavate the
latent semantics information and help users find the information items that
they want indeed. In this paper, we present a novel approach for semantic
search which combines Multi-Categorization Semantic Analysis with
personalization technology. The MCSA approach can classify documents into
multiple categories, which is distinct from the existing approaches of
classifying documents into a single category. Then, the search history and
personal information for users are significantly considered in analysing and
matching the original search result by Term Vector DataBase. A series of
personalization algorithms are proposed to match personal information and
search history. At last, the related experiments are made to validate the
effectiveness and efficiency of our method. The experimental results show that
our method based on MCSA and personalization outperforms some existing methods
with the higher search accuracy and the lower extra time cost.
","[{'version': 'v1', 'created': 'Fri, 27 Jun 2014 07:43:38 GMT'}]",2014-06-30,"[['Ma', 'Yinglong', ''], ['Shi', 'Moyi', '']]","['Semantic search', 'Multi-categorization method', 'Semantic analysis', 'Personalization  Categories H.3.3', 'H.3.1', 'H.2']"
19472,0711.2155,Stijn Heymans,"Stijn Heymans, Jos de Bruijn, Livia Predoiu, Cristina Feier, Davy Van
  Nieuwenborgh",Guarded Hybrid Knowledge Bases,18 pages,,,,cs.LO,,"  Recently, there has been a lot of interest in the integration of Description
Logics and rules on the Semantic Web.We define guarded hybrid knowledge bases
(or g-hybrid knowledge bases) as knowledge bases that consist of a Description
Logic knowledge base and a guarded logic program, similar to the DL+log
knowledge bases from (Rosati 2006). G-hybrid knowledge bases enable an
integration of Description Logics and Logic Programming where, unlike in other
approaches, variables in the rules of a guarded program do not need to appear
in positive non-DL atoms of the body, i.e. DL atoms can act as guards as well.
Decidability of satisfiability checking of g-hybrid knowledge bases is shown
for the particular DL DLRO, which is close to OWL DL, by a reduction to guarded
programs under the open answer set semantics. Moreover, we show
2-EXPTIME-completeness for satisfiability checking of such g-hybrid knowledge
bases. Finally, we discuss advantages and disadvantages of our approach
compared with DL+log knowledge bases.
","[{'version': 'v1', 'created': 'Wed, 14 Nov 2007 10:49:56 GMT'}]",2007-11-15,"[['Heymans', 'Stijn', ''], ['de Bruijn', 'Jos', ''], ['Predoiu', 'Livia', ''], ['Feier', 'Cristina', ''], ['Van Nieuwenborgh', 'Davy', '']]","['g-hybrid knowledge bases', 'open answer set programming', 'guarded logic programs', 'description logics']"
19473,1209.4169,Doreswamy,"Doreswamy, Hemanth K. S","Hybrid Data Mining Technique for Knowledge Discovery from Engineering
  Materials' Data sets","12 pages, 8 figures; International Journal of Database Management
  Systems (IJDMS), Vol.3, No.1, February 2011. arXiv admin note: text overlap
  with arXiv:1206.3078 by other authors",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Studying materials informatics from a data mining perspective can be
beneficial for manufacturing and other industrial engineering applications.
Predictive data mining technique and machine learning algorithm are combined to
design a knowledge discovery system for the selection of engineering materials
that meet the design specifications. Predictive method-Naive Bayesian
classifier and Machine learning Algorithm - Pearson correlation coefficient
method were implemented respectively for materials classification and
selection. The knowledge extracted from the engineering materials data sets is
proposed for effective decision making in advanced engineering materials design
applications.
","[{'version': 'v1', 'created': 'Wed, 19 Sep 2012 07:23:02 GMT'}]",2012-09-20,"[['Doreswamy', '', ''], ['S', 'Hemanth K.', '']]","['Naive Bayesian Classifier', 'Person Correlation Analysis', 'Knowledge Discovery', 'Materials informatics']"
19474,1304.2888,Nicolas Bredeche,"Nicolas Bredeche, Jean-Marc Montanier, Berend Weel, Evert Haasdijk",Roborobo! a Fast Robot Simulator for Swarm and Collective Robotics,"2 pages, 1 figure",,,,cs.RO cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Roborobo! is a multi-platform, highly portable, robot simulator for
large-scale collective robotics experiments. Roborobo! is coded in C++, and
follows the KISS guideline (""Keep it simple""). Therefore, its external
dependency is solely limited to the widely available SDL library for fast 2D
Graphics. Roborobo! is based on a Khepera/ePuck model. It is targeted for fast
single and multi-robots simulation, and has already been used in more than a
dozen published research mainly concerned with evolutionary swarm robotics,
including environment-driven self-adaptation and distributed evolutionary
optimization, as well as online onboard embodied evolution and embodied
morphogenesis.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2013 09:44:52 GMT'}]",2013-04-11,"[['Bredeche', 'Nicolas', ''], ['Montanier', 'Jean-Marc', ''], ['Weel', 'Berend', ''], ['Haasdijk', 'Evert', '']]","['robot simulator', 'evolutionary robotics', 'swarm robotics', 'collective adaptive systems', 'C++', 'SDL graphics library']"
19475,1007.3836,Oleksiy Kurganskyy,Oleksiy Kurgansky,"A state of a dynamic computational structure distributed in an
  environment: a model and its corollaries","11 pages, 5 figures",,,,cs.FL cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Currently there is great interest in computational models consisting of
underlying regular computational environments, and built on them distributed
computational structures. Examples of such models are cellular automata,
spatial computation and space-time crystallography. For any computational model
it is natural to define a functional equivalence of different but related
computational structures. In the finite automata theory an example of such
equivalence is automata homomorphism and, in particular, automata isomorphism.
If we continue to stick to the finite automata theory, a fundamental question
arise, what a state of a distributed computational structure is. This work is
devoted to particular solution of the issue.
","[{'version': 'v1', 'created': 'Thu, 22 Jul 2010 09:38:57 GMT'}]",2010-07-23,"[['Kurgansky', 'Oleksiy', '']]","['Collective of automata', 'cellular automata', 'finite automata theory', 'special relativitytheory']"
19476,1409.3903,Hindayati Mustafidah,Hindayati Mustafidah and Suwarsito,"Analysis of Competence Level and the Attendance of the Lecturer in Its
  Effects on Students Grade Using Fuzzy Quantification Theory","5 pages, 1 figure, 5 tables, 4 equations, published with
  International Journal of Computer Science Issues (IJCSI)","IJCSI, 11(4):75-79, July 2014",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It known that teachers as educators should have competence that shows its
quality so that the lecture material provided can be absorbed by the student.
The competencies in this term include the pedagogic, professional, personality,
and social. The competence that owned by lecturer can be obtained from the
results of the assessment conducted by the student through the filling of the
questionnaire. This study conducted an analysis of the level of the lecturer
competence of the relationship between the present of lecturer in classroom
with a percentage of the value of passing students in courses using fuzzy
quantification theory. Based on the results of the four competencies acquired
professional competence that contributes most of 79.45% in contributed the
attendance of lecturer will it affect the percentage of passing students in
courses that are shown with a percentage of the graduation minimum B.
","[{'version': 'v1', 'created': 'Sat, 13 Sep 2014 02:53:24 GMT'}]",2014-09-16,"[['Mustafidah', 'Hindayati', ''], ['Suwarsito', '', '']]","['Lecturer competence', 'students assessment', 'grade', 'fuzzy quantification theory']"
19477,1502.05777,James Henderson,"James A. Henderson, TingTing A. Gibson, Janet Wiles",Spike Event Based Learning in Neural Networks,Figure 4 can be viewed as a movie in a separate file,,,,cs.NE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A scheme is derived for learning connectivity in spiking neural networks. The
scheme learns instantaneous firing rates that are conditional on the activity
in other parts of the network. The scheme is independent of the choice of
neuron dynamics or activation function, and network architecture. It involves
two simple, online, local learning rules that are applied only in response to
occurrences of spike events. This scheme provides a direct method for
transferring ideas between the fields of deep learning and computational
neuroscience. This learning scheme is demonstrated using a layered feedforward
spiking neural network trained self-supervised on a prediction and
classification task for moving MNIST images collected using a Dynamic Vision
Sensor.
","[{'version': 'v1', 'created': 'Fri, 20 Feb 2015 05:26:09 GMT'}]",2015-02-23,"[['Henderson', 'James A.', ''], ['Gibson', 'TingTing A.', ''], ['Wiles', 'Janet', '']]","['Spiking Neural Networks', 'Learning', 'Vision', 'Prediction']"
19478,1704.03986,Ju Yong Chang,Ju Yong Chang and Kyoung Mu Lee,"2D-3D Pose Consistency-based Conditional Random Fields for 3D Human Pose
  Estimation",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study considers the 3D human pose estimation problem in a single RGB
image by proposing a conditional random field (CRF) model over 2D poses, in
which the 3D pose is obtained as a byproduct of the inference process. The
unary term of the proposed CRF model is defined based on a powerful heat-map
regression network, which has been proposed for 2D human pose estimation. This
study also presents a regression network for lifting the 2D pose to 3D pose and
proposes the prior term based on the consistency between the estimated 3D pose
and the 2D pose. To obtain the approximate solution of the proposed CRF model,
the N-best strategy is adopted. The proposed inference algorithm can be viewed
as sequential processes of bottom-up generation of 2D and 3D pose proposals
from the input 2D image based on deep networks and top-down verification of
such proposals by checking their consistencies. To evaluate the proposed
method, we use two large-scale datasets: Human3.6M and HumanEva. Experimental
results show that the proposed method achieves the state-of-the-art 3D human
pose estimation performance.
","[{'version': 'v1', 'created': 'Thu, 13 Apr 2017 03:46:57 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Dec 2017 05:31:47 GMT'}]",2017-12-29,"[['Chang', 'Ju Yong', ''], ['Lee', 'Kyoung Mu', '']]","['human pose estimation', 'conditional random fields', 'deep learning']"
19479,1009.4791,Masayuki Karasuyama,"Masayuki Karasuyama, Naoyuki Harada, Masashi Sugiyama, Ichiro Takeuchi","Multi-parametric Solution-path Algorithm for Instance-weighted Support
  Vector Machines",Submitted to Journal of Machine Learning Research,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An instance-weighted variant of the support vector machine (SVM) has
attracted considerable attention recently since they are useful in various
machine learning tasks such as non-stationary data analysis, heteroscedastic
data modeling, transfer learning, learning to rank, and transduction. An
important challenge in these scenarios is to overcome the computational
bottleneck---instance weights often change dynamically or adaptively, and thus
the weighted SVM solutions must be repeatedly computed. In this paper, we
develop an algorithm that can efficiently and exactly update the weighted SVM
solutions for arbitrary change of instance weights. Technically, this
contribution can be regarded as an extension of the conventional solution-path
algorithm for a single regularization parameter to multiple instance-weight
parameters. However, this extension gives rise to a significant problem that
breakpoints (at which the solution path turns) have to be identified in
high-dimensional space. To facilitate this, we introduce a parametric
representation of instance weights. We also provide a geometric interpretation
in weight space using a notion of critical region: a polyhedron in which the
current affine solution remains to be optimal. Then we find breakpoints at
intersections of the solution path and boundaries of polyhedrons. Through
extensive experiments on various practical applications, we demonstrate the
usefulness of the proposed algorithm.
","[{'version': 'v1', 'created': 'Fri, 24 Sep 2010 09:53:32 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Nov 2010 13:23:49 GMT'}]",2010-11-02,"[['Karasuyama', 'Masayuki', ''], ['Harada', 'Naoyuki', ''], ['Sugiyama', 'Masashi', ''], ['Takeuchi', 'Ichiro', '']]","['Parametric programming', 'solution path', 'weighted support vector machines']"
19480,1701.02401,Jiang Liu,Chengling Fang and Jiang Liu,A Linear Algebra Formulation for Boolean Satisfiability Testing,Two algorithms for SAT,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the article \The State of SAT"", the authors asked whether a procedure
dramatically different from DPLL can be found for handling unsatisfiable
instances. This study proposes a new linear programming approach to address
this issue efficiently. Our experiments showed that the new method works for
many unsatisfiable instances. However, we must concede that this method should
be incomplete; otherwise, it will imply P=co-NP.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2017 01:16:14 GMT'}, {'version': 'v2', 'created': 'Fri, 17 Aug 2018 03:23:22 GMT'}]",2018-08-20,"[['Fang', 'Chengling', ''], ['Liu', 'Jiang', '']]","['UNSAT', 'co-NP-complete', 'Integral Linear Programming', 'BooleanFunction', 'Boolean Solution']"
19481,1607.04347,Higor Amario de Souza,"Higor A. de Souza, Marcos L. Chaim, Fabio Kon","Spectrum-based Software Fault Localization: A Survey of Techniques,
  Advances, and Challenges","Submitted to Software Testing, Verification and Reliability",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite being one of the most basic tasks in software development, debugging
is still performed in a mostly manual way, leading to high cost and low
performance. To address this problem, researchers have studied promising
approaches, such as Spectrum-based Fault Localization (SFL) techniques, which
pinpoint program elements more likely to contain faults. This survey discusses
the state-of-the-art of SFL, including the different techniques that have been
proposed, the type and number of faults they address, the types of spectra they
use, the programs they utilize in their validation, the testing data that
support them, and their use at industrial settings. Notwithstanding the
advances, there are still challenges for the industry to adopt these
techniques, which we analyze in this paper. SFL techniques should propose new
ways to generate reduced sets of suspicious entities, combine different spectra
to fine-tune the fault localization ability, use strategies to collect
fine-grained coverage levels from suspicious coarser levels for balancing
execution costs and output precision, and propose new techniques to cope with
multiple-fault programs. Moreover, additional user studies are needed to
understand better how SFL techniques can be used in practice. We conclude by
presenting a concept map about topics and challenges for future research in
SFL.
","[{'version': 'v1', 'created': 'Fri, 15 Jul 2016 00:20:37 GMT'}, {'version': 'v2', 'created': 'Sun, 26 Nov 2017 17:43:49 GMT'}]",2017-11-28,"[['de Souza', 'Higor A.', ''], ['Chaim', 'Marcos L.', ''], ['Kon', 'Fabio', '']]","['Fault localization', 'spectrum-based', 'coverage-based', 'debugging', 'survey']"
19482,1607.01794,Zhenyang Li,"Zhenyang Li, Efstratios Gavves, Mihir Jain, Cees G. M. Snoek","VideoLSTM Convolves, Attends and Flows for Action Recognition",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new architecture for end-to-end sequence learning of actions in
video, we call VideoLSTM. Rather than adapting the video to the peculiarities
of established recurrent or convolutional architectures, we adapt the
architecture to fit the requirements of the video medium. Starting from the
soft-Attention LSTM, VideoLSTM makes three novel contributions. First, video
has a spatial layout. To exploit the spatial correlation we hardwire
convolutions in the soft-Attention LSTM architecture. Second, motion not only
informs us about the action content, but also guides better the attention
towards the relevant spatio-temporal locations. We introduce motion-based
attention. And finally, we demonstrate how the attention from VideoLSTM can be
used for action localization by relying on just the action class label.
Experiments and comparisons on challenging datasets for action classification
and localization support our claims.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2016 20:00:20 GMT'}]",2016-07-08,"[['Li', 'Zhenyang', ''], ['Gavves', 'Efstratios', ''], ['Jain', 'Mihir', ''], ['Snoek', 'Cees G. M.', '']]","['Action recognition', 'video representation', 'attention', 'LSTM']"
19483,1208.3942,Heiko Vogler,"Manfred Droste, Heiko Vogler","The Chomsky-Sch\""utzenberger Theorem for Quantitative Context-Free
  Languages","This new version combines a conference and a journal paper of the
  authors on the same topic, see references [15,16], and supplements them by a
  few additional examples and more detailed proofs. It also corrects a mistake
  in Theorem 7.7 of the first arxiv version (the property sequential was
  missing)",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Weighted automata model quantitative aspects of systems like the consumption
of resources during executions. Traditionally, the weights are assumed to form
the algebraic structure of a semiring, but recently also other weight
computations like average have been considered. Here, we investigate
quantitative context-free languages over very general weight structures
incorporating all semirings, average computations, lattices, and more. In our
main result, we derive the fundamental Chomsky-Sch\""utzenberger theorem for
such quantitative context-free languages, showing that each arises as the image
of a Dyck language and a regular language under a suitable morphism. Moreover,
we show that quantitative context-free language are expressively equivalent to
a model of weighted pushdown automata. This generalizes results previously
known only for semirings. We also investigate when quantitative context-free
languages assume only finitely many values.
","[{'version': 'v1', 'created': 'Mon, 20 Aug 2012 08:47:56 GMT'}, {'version': 'v2', 'created': 'Thu, 3 Mar 2016 13:05:06 GMT'}]",2016-03-04,"[['Droste', 'Manfred', ''], ['Vogler', 'Heiko', '']]","['weighted context-free grammars', 'weighted pushdown automata', 'valuation monoids', 'context-free step functions']"
19484,1110.0999,Alberto Pettorossi,"Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni",Generalization Strategies for the Verification of Infinite State Systems,"24 pages, 2 figures, 5 tables",,,,cs.LO cs.AI cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a method for the automated verification of temporal properties of
infinite state systems. Our verification method is based on the specialization
of constraint logic programs (CLP) and works in two phases: (1) in the first
phase, a CLP specification of an infinite state system is specialized with
respect to the initial state of the system and the temporal property to be
verified, and (2) in the second phase, the specialized program is evaluated by
using a bottom-up strategy. The effectiveness of the method strongly depends on
the generalization strategy which is applied during the program specialization
phase. We consider several generalization strategies obtained by combining
techniques already known in the field of program analysis and program
transformation, and we also introduce some new strategies. Then, through many
verification experiments, we evaluate the effectiveness of the generalization
strategies we have considered. Finally, we compare the implementation of our
specialization-based verification method to other constraint-based model
checking tools. The experimental results show that our method is competitive
with the methods used by those other tools. To appear in Theory and Practice of
Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2011 14:27:07 GMT'}]",2015-03-19,"[['Fioravanti', 'Fabio', ''], ['Pettorossi', 'Alberto', ''], ['Proietti', 'Maurizio', ''], ['Senni', 'Valerio', '']]","['Computational tree logic', 'constraint logic programs', 'generalization strategies', 'infinite state systems', 'program specialization', 'program verification']"
19485,1603.03564,Lu Lu,"Lu Lu, Haiquan Zhao, Badong Chen",KLMAT: A Kernel Least Mean Absolute Third Algorithm,"submitted to the journal in March, 17th, 2015",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a kernel least mean absolute third (KLMAT) algorithm is
developed for adaptive prediction. Combining the benefits of the kernel method
and the least mean absolute third (LMAT) algorithm, the proposed KLMAT
algorithm performs robustly against noise with different probability densities.
To further enhance the convergence rate of the KLMAT algorithm, a variable
step-size version (VSS-KLMAT algorithm) is proposed based on a Lorentzian
function. Moreover, the stability and convergence property of the proposed
algorithms are analyzed. Simulation results in the context of time series
prediction demonstrate that the effectiveness of proposed algorithms.
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2016 08:46:13 GMT'}, {'version': 'v2', 'created': 'Thu, 22 Dec 2016 10:51:45 GMT'}, {'version': 'v3', 'created': 'Sat, 12 Aug 2017 19:12:00 GMT'}]",2017-08-15,"[['Lu', 'Lu', ''], ['Zhao', 'Haiquan', ''], ['Chen', 'Badong', '']]","['Kernel adaptive filter', 'Least mean absolute third algorithm', 'Variable step size (VSS)', 'Exponential stability']"
19486,1303.5768,Henning Thielemann,Henning Thielemann,Live music programming in Haskell,"10 pages, 2 figures, Linux Audio Conference 2013. This is a
  translation and update of the ATPS-2012 paper",,,,cs.PL cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We aim for composing algorithmic music in an interactive way with multiple
participants. To this end we have developed an interpreter for a sub-language
of the non-strict functional programming language Haskell that allows the
modification of a program during its execution. Our system can be used both for
musical live-coding and for demonstration and education of functional
programming.
","[{'version': 'v1', 'created': 'Fri, 22 Mar 2013 20:02:38 GMT'}]",2013-03-26,"[['Thielemann', 'Henning', '']]","['Live coding', 'MIDI', 'Functionalprogramming', 'Haskell']"
19487,1603.01369,Evangelos Karapanos,Evangelos Karapanos,Designing for Different Stages in Behavior Change,"In Proceedings of the workshop ""Personalization in Persuasive
  Technology"", Persuasive Technology 2016, Salzburg, Austria",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The behavior change process is a dynamic journey with different informational
and motivational needs across its different stages; yet current technologies
for behavior change are static. In our recent deployment of Habito, an activity
tracking mobile app, we found individuals ""readiness"" to behavior change (or
the stage of behavior change they were in) to be a strong predictor of
adoption. Individuals in the contemplation and preparation stages had an
adoption rate of 56%, whereas individuals in precontemplation, action or
maintenance stages had an adoption rate of only 20%. In this position paper we
argue for behavior change technologies that are tailored to the different
stages of behavior change.
","[{'version': 'v1', 'created': 'Fri, 4 Mar 2016 07:45:13 GMT'}]",2016-03-07,"[['Karapanos', 'Evangelos', '']]","['Persuasive technologies', 'stages of behavior change', 'user engagement']"
19488,0906.4615,Melda Yuksel,Melda Yuksel and Elza Erkip,"Diversity-Multiplexing Tradeoff for the Multiple-Antenna Wire-tap
  Channel","10 pages, 4 figures, to appear in IEEE Transactions on Wireless
  Communications",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper the fading multiple antenna (MIMO) wire-tap channel is
investigated under short term power constraints. The secret diversity gain and
the secret multiplexing gain are defined. Using these definitions, the secret
diversitymultiplexing tradeoff (DMT) is calculated analytically for no
transmitter side channel state information (CSI) and for full CSI. When there
is no CSI at the transmitter, under the assumption of Gaussian codebooks, it is
shown that the eavesdropper steals both transmitter and receiver antennas, and
the secret DMT depends on the remaining degrees of freedom. When CSI is
available at the transmitter (CSIT), the eavesdropper steals only transmitter
antennas. This dependence on the availability of CSI is unlike the DMT results
without secrecy constraints, where the DMT remains the same for no CSI and full
CSI at the transmitter under short term power constraints. A zero-forcing type
scheme is shown to achieve the secret DMT when CSIT is available.
","[{'version': 'v1', 'created': 'Thu, 25 Jun 2009 06:44:05 GMT'}, {'version': 'v2', 'created': 'Fri, 10 Dec 2010 10:07:13 GMT'}]",2015-03-13,"[['Yuksel', 'Melda', ''], ['Erkip', 'Elza', '']]","['Diversity-multiplexing tradeoff', 'MIMO', 'secrecy', 'wire-tap channel']"
19489,1108.1933,Mostafa Monemizadeh,"Mostafa Monemizadeh, Ghosheh Abed Hodtani, and Hamed Fehri","An Achievable Rate Region for Cognitive Radio Channel With Common
  Message","5 pages, 2 figures, accepted for publication and presentation at
  ISWCS 2011, Aachen, Germany, 6th - 9th November, 2011",,,,cs.IT math.IT,http://creativecommons.org/licenses/by/3.0/,"  The cognitive radio channel with common message (CRCC) is considered. In this
channel, similar to the cognitive radio channel (CRC), we have a cognitive user
which has full non-causal knowledge of the primary message, and like the
interference channel with common message (ICC), the information sources at the
two transmitters are statistically dependent and the senders need to transmit
not only the private message but also certain common message to their
corresponding receivers. By using a specific combination of superposition
coding, binning scheme and simultaneous decoding, we propose a unified
achievable rate region for the CRCC which subsumes the several existing results
for the CRC, ICC, interference channel without common message (IC), strong
interference channel and compound multiple access channel with common
information (SICC and CMACC).
","[{'version': 'v1', 'created': 'Tue, 9 Aug 2011 14:16:52 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Aug 2011 20:07:00 GMT'}]",2011-08-12,"[['Monemizadeh', 'Mostafa', ''], ['Hodtani', 'Ghosheh Abed', ''], ['Fehri', 'Hamed', '']]","['Achievable rate region', 'common message', 'cognitive']"
19490,1708.00710,Sangheum Hwang,"Sangheum Hwang, Sunggyun Park","Accurate Lung Segmentation via Network-Wise Training of Convolutional
  Networks","Accepted to the 3rd Workshop on Deep Learning in Medical Image
  Analysis (DLMIA 2017), MICCAI 2017",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce an accurate lung segmentation model for chest radiographs based
on deep convolutional neural networks. Our model is based on atrous
convolutional layers to increase the field-of-view of filters efficiently. To
improve segmentation performances further, we also propose a multi-stage
training strategy, network-wise training, which the current stage network is
fed with both input images and the outputs from pre-stage network. It is shown
that this strategy has an ability to reduce falsely predicted labels and
produce smooth boundaries of lung fields. We evaluate the proposed model on a
common benchmark dataset, JSRT, and achieve the state-of-the-art segmentation
performances with much fewer model parameters.
","[{'version': 'v1', 'created': 'Wed, 2 Aug 2017 11:47:01 GMT'}]",2017-08-03,"[['Hwang', 'Sangheum', ''], ['Park', 'Sunggyun', '']]","['Lung segmentation', 'Network-wise trainnig', 'Atrous convolution']"
19491,1702.05042,Bhaskar Mitra,"Bhaskar Mitra, Fernando Diaz and Nick Craswell",Luandri: a Clean Lua Interface to the Indri Search Engine,Under review for SIGIR'17,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, the information retrieval (IR) community has witnessed the
first successful applications of deep neural network models to short-text
matching and ad-hoc retrieval. It is exciting to see the research on deep
neural networks and IR converge on these tasks of shared interest. However, the
two communities have less in common when it comes to the choice of programming
languages. Indri, an indexing framework popularly used by the IR community, is
written in C++, while Torch, a popular machine learning library for deep
learning, is written in the light-weight scripting language Lua. To bridge this
gap, we introduce Luandri (pronounced ""laundry""), a simple interface for
exposing the search capabilities of Indri to Torch models implemented in Lua.
","[{'version': 'v1', 'created': 'Thu, 16 Feb 2017 16:30:06 GMT'}]",2017-02-17,"[['Mitra', 'Bhaskar', ''], ['Diaz', 'Fernando', ''], ['Craswell', 'Nick', '']]","['Information retrieval', 'application programming interface', 'neuralnetworks']"
19492,1409.8593,Roberto M\'inguez,Roberto M\'inguez and V\'ictor Casero-Alonso,"Robust solutions of uncertain mixed-integer linear programs using
  decomposition techniques","26 pages, 2 figures",,,,cs.NA cs.CE math.NA math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robust optimization is a framework for modeling optimization problems
involving data uncertainty and during the last decades has been an area of
active research. If we focus on linear programming (LP) problems with i)
uncertain data, ii) binary decisions and iii) hard constraints within an
ellipsoidal uncertainty set, this paper provides a different interpretation of
their robust counterpart (RC) inspired from decomposition techniques. This new
interpretation allows the proposal of an ad-hoc decomposition technique to
solve the RC problem with the following advantages: i) it improves
tractability, specially for large-scale problems, and ii) it provides the exact
probability of constraint violation in case the probability distribution of
uncertain parameters are completely defined by using first and second-order
probability moments. An attractive aspect of our method is that it decomposes
the second-order cone programming problem, associated with the robust
counterpart, into a linear master problem and different quadratically
constrained problems (QCP) of considerable lower size. The optimal solution is
achieved through the solution of these master and subproblems within an
iterative scheme based on cutting plane approximations of the second-order cone
constraints. In addition, proof of convergence of the iterative method is
given.
","[{'version': 'v1', 'created': 'Tue, 30 Sep 2014 15:24:24 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Jan 2016 22:04:43 GMT'}, {'version': 'v3', 'created': 'Tue, 9 Feb 2016 12:22:34 GMT'}, {'version': 'v4', 'created': 'Tue, 14 Feb 2017 07:55:08 GMT'}]",2017-02-15,"[['Mínguez', 'Roberto', ''], ['Casero-Alonso', 'Víctor', '']]","['Stochastic programming', 'Conic programming and interiorpoint methods', 'Decision analysis under uncertainty', 'Reliability analysis', 'Robust optimization']"
19493,1407.7390,Jos\'e Ram\'on Padilla-L\'opez,"Jos\'e Ram\'on Padilla-L\'opez and Alexandros Andr\'e Chaaraoui and
  Francisco Fl\'orez-Revuelta","A discussion on the validation tests employed to compare human action
  recognition methods using the MSR Action3D dataset",16 pages and 7 tables,,,hdl:10045/39889,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper aims to determine which is the best human action recognition
method based on features extracted from RGB-D devices, such as the Microsoft
Kinect. A review of all the papers that make reference to MSR Action3D, the
most used dataset that includes depth information acquired from a RGB-D device,
has been performed. We found that the validation method used by each work
differs from the others. So, a direct comparison among works cannot be made.
However, almost all the works present their results comparing them without
taking into account this issue. Therefore, we present different rankings
according to the methodology used for the validation in orden to clarify the
existing confusion.
","[{'version': 'v1', 'created': 'Mon, 28 Jul 2014 11:59:30 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Jan 2015 11:30:40 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Jun 2015 19:57:45 GMT'}]",2015-06-17,"[['Padilla-López', 'José Ramón', ''], ['Chaaraoui', 'Alexandros André', ''], ['Flórez-Revuelta', 'Francisco', '']]","['human action recognition', 'RGB-D devices', 'MSR Action3D', 'validation', 'Kinect', 'depth sensors']"
19494,0908.0122,R Doomun,"Kalpana Sharma, M.K. Ghose, Kuldeep",Complete Security Framework for Wireless Sensor Networks,"7 pages, International Journal of Computer Science and Information
  Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423","International Journal of Computer Science and Information
  Security, IJCSIS July 2009, Vol. 3 No. 1, USA",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security concern for a Sensor Networks and level of security desired may
differ according to application specific needs where the sensor networks are
deployed. Till now, most of the security solutions proposed for sensor networks
are layer wise i.e a particular solution is applicable to single layer itself.
So, to integrate them all is a new research challenge. In this paper we took up
the challenge and have proposed an integrated comprehensive security framework
that will provide security services for all services of sensor network. We have
added one extra component i.e. Intelligent Security Agent (ISA) to assess level
of security and cross layer interactions. This framework has many components
like Intrusion Detection System, Trust Framework, Key Management scheme and
Link layer communication protocol. We have also tested it on three different
application scenarios in Castalia and Omnet++ simulator.
","[{'version': 'v1', 'created': 'Sun, 2 Aug 2009 10:58:51 GMT'}]",2009-08-04,"[['Sharma', 'Kalpana', ''], ['Ghose', 'M. K.', ''], ['Kuldeep', '', '']]","['Security', 'sensor networks', 'key management; application specific security']"
19495,1505.00136,Johannes Schiffer,"Johannes Schiffer, Daniele Zonetti, Romeo Ortega, Aleksandar
  Stankovic, Tevfik Sezi, Joerg Raisch","A survey on modeling of microgrids - from fundamental physics to phasors
  and voltage sources",,,,,cs.SY math.DS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Microgrids have been identified as key components of modern electrical
systems to facilitate the integration of renewable distributed generation
units. Their analysis and controller design requires the development of
advanced (typically model-based) techniques naturally posing an interesting
challenge to the control community. Although there are widely accepted reduced
order models to describe the dynamic behavior of microgrids, they are typically
presented without details about the reduction procedure---hampering the
understanding of the physical phenomena behind them. Preceded by an
introduction to basic notions and definitions in power systems, the present
survey reviews key characteristics and main components of a microgrid. We
introduce the reader to the basic functionality of DC/AC inverters, as well as
to standard operating modes and control schemes of inverter-interfaced power
sources in microgrid applications. Based on this exposition and starting from
fundamental physics, we present detailed dynamical models of the main microgrid
components. Furthermore, we clearly state the underlying assumptions which lead
to the standard reduced model with inverters represented by controllable
voltage sources, as well as static network and load representations, hence,
providing a complete modular model derivation of a three-phase inverter-based
microgrid.
","[{'version': 'v1', 'created': 'Fri, 1 May 2015 09:51:30 GMT'}, {'version': 'v2', 'created': 'Tue, 17 May 2016 16:19:42 GMT'}]",2016-05-18,"[['Schiffer', 'Johannes', ''], ['Zonetti', 'Daniele', ''], ['Ortega', 'Romeo', ''], ['Stankovic', 'Aleksandar', ''], ['Sezi', 'Tevfik', ''], ['Raisch', 'Joerg', '']]","['Microgrid modeling', 'microgrid analysis', 'smart grid applications', 'inverters']"
19496,1305.1426,Urmila Shrawankar Ms,"Urmila Shrawankar, V. M. Thakare",Speech Enhancement Modeling Towards Robust Speech Recognition System,"Pages: 04; Conference Proceedings International Conference on Advance
  Computing (ICAC-2008), India",,,,cs.SD cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Form about four decades human beings have been dreaming of an intelligent
machine which can master the natural speech. In its simplest form, this machine
should consist of two subsystems, namely automatic speech recognition (ASR) and
speech understanding (SU). The goal of ASR is to transcribe natural speech
while SU is to understand the meaning of the transcription. Recognizing and
understanding a spoken sentence is obviously a knowledge-intensive process,
which must take into account all variable information about the speech
communication process, from acoustics to semantics and pragmatics. While
developing an Automatic Speech Recognition System, it is observed that some
adverse conditions degrade the performance of the Speech Recognition System. In
this contribution, speech enhancement system is introduced for enhancing speech
signals corrupted by additive noise and improving the performance of Automatic
Speech Recognizers in noisy conditions. Automatic speech recognition
experiments show that replacing noisy speech signals by the corresponding
enhanced speech signals leads to an improvement in the recognition accuracies.
The amount of improvement varies with the type of the corrupting noise.
","[{'version': 'v1', 'created': 'Tue, 7 May 2013 07:21:06 GMT'}]",2013-05-08,"[['Shrawankar', 'Urmila', ''], ['Thakare', 'V. M.', '']]","['speech enhancement', 'Human Factors', 'Noise', 'Speech User Interface (SUI)']"
19497,1007.0917,Bela Genge,"Gyula Farkas, Bela Genge, Piroska Haller",A Platform for Implementing Secure Wireless Ad Hoc Networks,"Proceedings of the 2nd conference on Recent Achievements in
  Mechatronics, Automation, Computer Science and Robotics, 2010",,,,cs.CR cs.NI,http://creativecommons.org/licenses/publicdomain/,"  We propose a new platform for implementing secure wireless ad hoc networks.
Our proposal is based on a modular architecture, with the software stack
constructed directly on the Ethernet layer. Within our platform we use a new
security protocol that we designed to ensure mutual authentication between
nodes and a secure key exchange. The correctness of the proposed security
protocol is ensured by Guttman's authentication tests.
","[{'version': 'v1', 'created': 'Tue, 6 Jul 2010 15:11:44 GMT'}]",2010-07-07,"[['Farkas', 'Gyula', ''], ['Genge', 'Bela', ''], ['Haller', 'Piroska', '']]","['Wireless', 'ad hoc', 'security protocols']"
19498,1208.1004,Georgios Pitsilis,"Georgios Pitsilis, Svein J. Knapskog","Social Trust as a solution to address sparsity-inherent problems of
  Recommender systems","ACM RecSys 2009, Workshop on Recommender Systems & The Social Web,
  Oct. 2009, ISSN:1613-0073, New York, USA",,,,cs.SI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Trust has been explored by many researchers in the past as a successful
solution for assisting recommender systems. Even though the approach of using a
web-of-trust scheme for assisting the recommendation production is well
adopted, issues like the sparsity problem have not been explored adequately so
far with regard to this. In this work we are proposing and testing a scheme
that uses the existing ratings of users to calculate the hypothetical trust
that might exist between them. The purpose is to demonstrate how some basic
social networking when applied to an existing system can help in alleviating
problems of traditional recommender system schemes. Interestingly, such schemes
are also alleviating the cold start problem from which mainly new users are
suffering. In order to show how good the system is in that respect, we measure
the performance at various times as the system evolves and we also contrast the
solution with existing approaches. Finally, we present the results which
justify that such schemes undoubtedly work better than a system that makes no
use of trust at all.
","[{'version': 'v1', 'created': 'Sun, 5 Aug 2012 12:32:21 GMT'}]",2012-08-07,"[['Pitsilis', 'Georgios', ''], ['Knapskog', 'Svein J.', '']]","['Recommender Systems', 'Trust Modeling', 'data sparsity problem Cold-Start problem', 'Social network']"
19499,0906.1429,Benjamin Chevallereau,"Benjamin Chevallereau (IRCCyN), Alain Bernard (IRCCyN), Pierre
  M\'evellec (LEMNA)","Am\'eliorer les performances de l'industrie logicielle par une meilleure
  compr\'ehension des besoins",,"Conf\'erence Internationale de G\'enie Industriel, Bagn\`eres de
  Bigorre : France (2009)",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Actual organization are structured and act with the help of their information
systems. In spite of considerable progresses made by computer technology, we
note that actors are very often critical on their information systems.
Difficulties to product specifications enough detailed for functional profile
and interpretable by information system expert is one of reason of this gap
between hopes and reality. Our proposition wants to get over this obstacle by
organizing user requirements in a common language of operational profile and
technical expert.-- Les organisations actuelles se structurent et agissent en
s'appuyant sur leurs syst\`emes d'information. Malgr\'e les progr\`es
consid\'erables r\'ealis\'es par la technologie informatique, on constate que
les acteurs restent tr\`es souvent critiques par rapport \`a leur syst\`emes
d'information. Une des causes de cet \'ecart entre les espoirs et la
r\'ealit\'e trouve sa source dans la difficult\'e \`a produire un cahier des
charges suffisamment d\'etaill\'e pour les op\'erationnels et interpr\'etable
par les sp\'ecialistes des syst\`emes d'information. Notre proposition vise \`a
surmonter cet obstacle en organisant l'expression des besoins dans un langage
commun aux op\'erationnels et aux experts techniques. Pour cela, le langage
propos\'e pour exprimer les besoins est bas\'e sur la notion de but.
L'ing\'enierie dirig\'ee par les mod\`eles est pr\'esente \`a toute les
\'etapes, c'est-\`a-dire au moment de la capture et de l'interpr\'etation.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2009 08:03:23 GMT'}]",2009-06-09,"[['Chevallereau', 'Benjamin', '', 'IRCCyN'], ['Bernard', 'Alain', '', 'IRCCyN'], ['Mévellec', 'Pierre', '', 'LEMNA']]","['requirements engineering', 'goal', 'model']"
19500,0711.3691,Eric Laporte,"Olivier Blanc (IGM-LabInfo), Matthieu Constant (IGM-LabInfo), Eric
  Laporte (IGM-LabInfo)","Outilex, plate-forme logicielle de traitement de textes \'ecrits",,"Dans Verbum ex machina. Proceedings of TALN - Outilex, plate-forme
  logicielle de traitement de textes \'ecrits, Louvain : Belgique (2006)",,,cs.CL,,"  The Outilex software platform, which will be made available to research,
development and industry, comprises software components implementing all the
fundamental operations of written text processing: processing without lexicons,
exploitation of lexicons and grammars, language resource management. All data
are structured in XML formats, and also in more compact formats, either
readable or binary, whenever necessary; the required format converters are
included in the platform; the grammar formats allow for combining statistical
approaches with resource-based approaches. Manually constructed lexicons for
French and English, originating from the LADL, and of substantial coverage,
will be distributed with the platform under LGPL-LR license.
","[{'version': 'v1', 'created': 'Fri, 23 Nov 2007 09:45:13 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Nov 2007 10:22:14 GMT'}]",2007-11-27,"[['Blanc', 'Olivier', '', 'IGM-LabInfo'], ['Constant', 'Matthieu', '', 'IGM-LabInfo'], ['Laporte', 'Eric', '', 'IGM-LabInfo']]","['Syntactic parsing', 'lexico-syntactic patterns', 'lexical analysis', 'language resources', 'exchange formats', 'finite-state automata', 'recursive transition networks']"
19501,1309.7803,Mojtba Nouri Bygi Mr.,"Mojtaba Nouri Bygi, Mohammad Ghodsi",Near Optimal Line Segment Weak Visibility Queries in Simple Polygons,,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the problem of computing the weak visibility polygon
(WVP) of any query line segment pq (or WVP(pq)) inside a given simple polygon
P. We present an algorithm that preprocesses P and creates a data structure
from which WVP(pq) is efficiently reported in an output sensitive manner.
  Our algorithm needs O(n^2 log n) time and O(n^2) space in the preprocessing
phase to report WVP(pq) of any query line segment pq in time O(log^2 n +
|WVP(pq)|). We improve the preprocessing time and space of current results for
this problem at the expense of more query time.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2013 11:44:53 GMT'}]",2013-10-01,"[['Bygi', 'Mojtaba Nouri', ''], ['Ghodsi', 'Mohammad', '']]","['Computational Geometry', 'Visibility', 'Line Segment Visibility']"
19502,1209.6012,Walter Quattrociocchi,"Sara Brunetti, Gennaro Cordasco, Luisa Gargano, Elena Lodi, Walter
  Quattrociocchi",Minimum Weight Dynamo and Fast Opinion Spreading,"Multicolored Dynamic Monopolies, Opinion Dynamics, Target Set
  Selection, information spreading",,,,cs.SI cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the following multi--level opinion spreading model on networks.
Initially, each node gets a weight from the set [0..k-1], where such a weight
stands for the individuals conviction of a new idea or product. Then, by
proceeding to rounds, each node updates its weight according to the weights of
its neighbors. We are interested in the initial assignments of weights leading
each node to get the value k-1 --e.g. unanimous maximum level acceptance--
within a given number of rounds. We determine lower bounds on the sum of the
initial weights of the nodes under the irreversible simple majority rules,
where a node increases its weight if and only if the majority of its neighbors
have a weight that is higher than its own one. Moreover, we provide
constructive tight upper bounds for some class of regular topologies: rings,
tori, and cliques.
","[{'version': 'v1', 'created': 'Wed, 26 Sep 2012 17:21:44 GMT'}]",2012-09-27,"[['Brunetti', 'Sara', ''], ['Cordasco', 'Gennaro', ''], ['Gargano', 'Luisa', ''], ['Lodi', 'Elena', ''], ['Quattrociocchi', 'Walter', '']]","['multicolored dynamos', 'information spreading', 'linear thresholdmodels']"
19503,1204.6453,Oktay Arslan Oktay Arslan,Oktay Arslan and Panagiotis Tsiotras,"The Role of Vertex Consistency in Sampling-based Algorithms for Optimal
  Motion Planning",26 pages,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motion planning problems have been studied by both the robotics and the
controls research communities for a long time, and many algorithms have been
developed for their solution. Among them, incremental sampling-based motion
planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), and the
Probabilistic Road Maps (PRMs) have become very popular recently, owing to
their implementation simplicity and their advantages in handling
high-dimensional problems. Although these algorithms work very well in
practice, the quality of the computed solution is often not good, i.e., the
solution can be far from the optimal one. A recent variation of RRT, namely the
RRT* algorithm, bypasses this drawback of the traditional RRT algorithm, by
ensuring asymptotic optimality as the number of samples tends to infinity.
Nonetheless, the convergence rate to the optimal solution may still be slow.
This paper presents a new incremental sampling-based motion planning algorithm
based on Rapidly-exploring Random Graphs (RRG), denoted RRT# (RRT ""sharp"")
which also guarantees asymptotic optimality but, in addition, it also ensures
that the constructed spanning tree of the geometric graph is consistent after
each iteration. In consistent trees, the vertices which have the potential to
be part of the optimal solution have the minimum cost-come-value. This implies
that the best possible solution is readily computed if there are some vertices
in the current graph that are already in the goal region. Numerical results
compare with the RRT* algorithm.
","[{'version': 'v1', 'created': 'Sun, 29 Apr 2012 04:24:44 GMT'}]",2012-05-01,"[['Arslan', 'Oktay', ''], ['Tsiotras', 'Panagiotis', '']]","['optimal motion planning', 'RRT', 'RRG', 'RRT∗', 'RRT#', 'vertex consistency', 'consistent tree']"
19504,1802.09070,Dimitris Kastaniotis,"Dimitris Kastaniotis, Ioanna Ntinou, Dimitrios Tsourounis, George
  Economou and Spiros Fotopoulos",Attention-Aware Generative Adversarial Networks (ATA-GANs),,,,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  In this work, we present a novel approach for training Generative Adversarial
Networks (GANs). Using the attention maps produced by a Teacher- Network we are
able to improve the quality of the generated images as well as perform weakly
object localization on the generated images. To this end, we generate images of
HEp-2 cells captured with Indirect Imunofluoresence (IIF) and study the ability
of our network to perform a weakly localization of the cell. Firstly, we
demonstrate that whilst GANs can learn the mapping between the input domain and
the target distribution efficiently, the discriminator network is not able to
detect the regions of interest. Secondly, we present a novel attention transfer
mechanism which allows us to enforce the discriminator to put emphasis on the
regions of interest via transfer learning. Thirdly, we show that this leads to
more realistic images, as the discriminator learns to put emphasis on the area
of interest. Fourthly, the proposed method allows one to generate both images
as well as attention maps which can be useful for data annotation e.g in object
detection.
","[{'version': 'v1', 'created': 'Sun, 25 Feb 2018 19:40:30 GMT'}]",2018-10-09,"[['Kastaniotis', 'Dimitris', ''], ['Ntinou', 'Ioanna', ''], ['Tsourounis', 'Dimitrios', ''], ['Economou', 'George', ''], ['Fotopoulos', 'Spiros', '']]","['Generative Adversarial Networks', 'AttentionMaps', 'HEp-2 cells']"
19505,1506.00930,Tiago Guerreiro,"Diogo Marques, Lu\'is Carri\c{c}o, Tiago Guerreiro",Assessing Inconspicuous Smartphone Authentication for Blind People,"4 pages, 1 figure",,,,cs.HC cs.CR,http://creativecommons.org/licenses/by/3.0/,"  As people store more personal data in their smartphones, the consequences of
having it stolen or lost become an increasing concern. A typical
counter-measure to avoid this risk is to set up a secret code that has to be
entered to unlock the device after a period of inactivity. However, for blind
users, PINs and passwords are inadequate, since entry 1) consumes a non-trivial
amount of time, e.g. using screen readers, 2) is susceptible to observation,
where nearby people can see or hear the secret code, and 3) might collide with
social norms, e.g. disrupting personal interactions. Tap-based authentication
methods have been presented and allow unlocking to be performed in a short time
and support naturally occurring inconspicuous behavior (e.g. concealing the
device inside a jacket) by being usable with a single hand. This paper presents
a study with blind users (N = 16) where an authentication method based on tap
phrases is evaluated. Results showed the method to be usable and to support the
desired inconspicuity.
","[{'version': 'v1', 'created': 'Tue, 2 Jun 2015 15:40:32 GMT'}]",2015-06-03,"[['Marques', 'Diogo', ''], ['Carriço', 'Luís', ''], ['Guerreiro', 'Tiago', '']]","['Tapping', 'inconspicuous interaction', 'smartphones', 'usable security', 'blind users']"
19506,1305.1476,Bernhard Haslhofer,"Bernhard Haslhofer, Simeon Warner, Carl Lagoze, Martin Klein, Robert
  Sanderson, Michael L. Nelson, Herbert van de Sompel",ResourceSync: Leveraging Sitemaps for Resource Synchronization,"3 pages, WWW 2013 developer track",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many applications need up-to-date copies of collections of changing Web
resources. Such synchronization is currently achieved using ad-hoc or
proprietary solutions. We propose ResourceSync, a general Web resource
synchronization protocol that leverages XML Sitemaps. It provides a set of
capabilities that can be combined in a modular manner to meet local or
community requirements. We report on work to implement this protocol for
arXiv.org and also provide an experimental prototype for the English Wikipedia
as well as a client API.
","[{'version': 'v1', 'created': 'Tue, 7 May 2013 11:42:52 GMT'}]",2013-05-08,"[['Haslhofer', 'Bernhard', ''], ['Warner', 'Simeon', ''], ['Lagoze', 'Carl', ''], ['Klein', 'Martin', ''], ['Sanderson', 'Robert', ''], ['Nelson', 'Michael L.', ''], ['van de Sompel', 'Herbert', '']]","['Web', 'Resource Synchronization', 'ResourceSync']"
19507,1401.8131,Ankit Mundra,"Bhagvan Krishna Gupta, Ankit Mundra, Nitin Rakesh","Failure Detection and Recovery in Hierarchical Network Using FTN
  Approach","8 pages, 7 figure. International Journal of Computer Science Issues,
  2013",,,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In current scenario several commercial and social organizations are using
computer networks for their business and management purposes. In order to meet
the business requirements networks are also grow. The growth of network also
promotes the handling capability of large networks because it counter raises
the possibilities of various faults in the network. A fault in network degrades
its performance by affecting parameters like throughput, delay, latency,
reliability etc. In hierarchical network models any possibility of fault may
collapse entire network. If a fault occurrence disables a device in
hierarchical network then it may distresses all the devices underneath. Thus it
affects entire networks performance. In this paper we propose Fault Tolerable
hierarchical Network (FTN) approach as a solution to the problems of
hierarchical networks. The proposed approach firstly detects possibilities of
fault in the network and accordingly provides specific recovery mechanism. We
have evaluated the performance of FTN approach in terms of delay and throughput
of network.
","[{'version': 'v1', 'created': 'Fri, 31 Jan 2014 11:06:41 GMT'}]",2014-02-03,"[['Gupta', 'Bhagvan Krishna', ''], ['Mundra', 'Ankit', ''], ['Rakesh', 'Nitin', '']]","['Hierarchical Network', 'Fault Detection', 'Fault Recovery', 'Query Message', 'Report Message']"
19508,1005.3873,Yipeng Liu Dr.,"Ruiming Yang, Qun Wan, Yipeng Liu and Wanlin Yang","Improved OMP Approach to Sparse Multi-path Channel Estimation via
  Adaptive Inter-atom Interference Mitigation","5 pages, 4 figures, accepted by VTC2010-SPRING",,,,cs.IT math.IT,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Since most components of sparse multi-path channel (SMPC) are zero, impulse
response of SMPC can be recovered from a short training sequence. Though the
ordinary orthogonal matching pursuit (OMP) algorithm provides a very fast
implementation of SMPC estimation, it suffers from inter-atom interference
(IAI), especially in the case of SMPC with a large delay spread and short
training sequence. In this paper, an adaptive IAI mitigation method is proposed
to improve the performance of SMPC estimation based on a general OMP algorithm.
Unlike the ordinary OMP algorithm, a sensing dictionary is designed adaptively
and posterior information is utilized efficiently to prevent false atoms from
being selected due to serious IAI. Numeral experiments illustrate that the
proposed general OMP algorithm based on adaptive IAI mitigation outperform both
the ordinary OMP algorithm and the general OMP algorithm based on non-adaptive
IAI mitigation.
","[{'version': 'v1', 'created': 'Fri, 21 May 2010 01:59:46 GMT'}]",2010-05-24,"[['Yang', 'Ruiming', ''], ['Wan', 'Qun', ''], ['Liu', 'Yipeng', ''], ['Yang', 'Wanlin', '']]","['sparse multi-path channel (SMPC)', 'general orthogonal matching pursuit (OMP)', 'inter-atom interference (IAI)']"
19509,1205.0668,Loet Leydesdorff,"Loet Leydesdorff, Ping Zhou, and Lutz Bornmann","How Can Journal Impact Factors be Normalized across Fields of Science?
  An Assessment in terms of Percentile Ranks and Fractional Counts","Journal of the American Society for Information Science and
  Technology (in press)",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using the CD-ROM version of the Science Citation Index 2010 (N = 3,705
journals), we study the (combined) effects of (i) fractional counting on the
impact factor (IF) and (ii) transformation of the skewed citation distributions
into a distribution of 100 percentiles and six percentile rank classes (top-1%,
top-5%, etc.). Do these approaches lead to field-normalized impact measures for
journals? In addition to the two-year IF (IF2), we consider the five-year IF
(IF5), the respective numerators of these IFs, and the number of Total Cites,
counted both as integers and fractionally. These various indicators are tested
against the hypothesis that the classification of journals into 11 broad fields
by PatentBoard/National Science Foundation provides statistically significant
between-field effects. Using fractional counting the between-field variance is
reduced by 91.7% in the case of IF5, and by 79.2% in the case of IF2. However,
the differences in citation counts are not significantly affected by fractional
counting. These results accord with previous studies, but the longer citation
window of a fractionally counted IF5 can lead to significant improvement in the
normalization across fields.
","[{'version': 'v1', 'created': 'Thu, 3 May 2012 10:12:57 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Jun 2012 18:02:06 GMT'}]",2012-06-19,"[['Leydesdorff', 'Loet', ''], ['Zhou', 'Ping', ''], ['Bornmann', 'Lutz', '']]","['journal', 'impact', 'citation', 'normalization', 'percentiles', 'fractional counting']"
19510,1603.08314,Shouhuai Xu,Ren Zheng and Wenlian Lu and Shouhuai Xu,Active Cyber Defense Dynamics Exhibiting Rich Phenomena,Proceedings of 2015 Symposium on the Science of Security (HotSoS'15),,,,cs.CR cs.SI cs.SY math.DS physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Internet is a man-made complex system under constant attacks (e.g.,
Advanced Persistent Threats and malwares). It is therefore important to
understand the phenomena that can be induced by the interaction between cyber
attacks and cyber defenses. In this paper, we explore the rich phenomena that
can be exhibited when the defender employs active defense to combat cyber
attacks. To the best of our knowledge, this is the first study that shows that
{\em active cyber defense dynamics} (or more generally, {\em cybersecurity
dynamics}) can exhibit the bifurcation and chaos phenomena. This has profound
implications for cyber security measurement and prediction: (i) it is
infeasible (or even impossible) to accurately measure and predict cyber
security under certain circumstances; (ii) the defender must manipulate the
dynamics to avoid such {\em unmanageable situations} in real-life defense
operations.
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2016 05:35:35 GMT'}]",2016-03-29,"[['Zheng', 'Ren', ''], ['Lu', 'Wenlian', ''], ['Xu', 'Shouhuai', '']]","['Active cyber defense', 'active cyber defense dynamics', 'cyber attackdefense dynamics', 'cybersecurity dynamics', 'cyber security models']"
19511,1409.4613,Evgeniy Vodolazskiy,"M.I. Schlesinger, E.V. Vodolazskiy, V.M. Yakovenko",Similarity of closed polygonal curves in Frechet metric,"15 pages, 9 figures",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The article analyzes similarity of closed polygonal curves in Frechet metric,
which is stronger than the well-known Hausdorff metric and therefore is more
appropriate in some applications. An algorithm that determines whether the
Frechet distance between two closed polygonal curves with m and n vertices is
less than a given number is described. The described algorithm takes O(mn) time
whereas the previously known algorithms take O(mn log(mn)) time.
","[{'version': 'v1', 'created': 'Tue, 16 Sep 2014 12:46:46 GMT'}]",2014-09-17,"[['Schlesinger', 'M. I.', ''], ['Vodolazskiy', 'E. V.', ''], ['Yakovenko', 'V. M.', '']]","['computational geometry', 'Frechet distance', 'computational complexity']"
19512,1008.0143,Xiaomeng Shi,"Xiaomeng Shi, Muriel Medard, Daniel Lucani","When Both Transmitting and Receiving Energies Matter: An Application of
  Network Coding in Wireless Body Area Networks","10 pages, 7 figures, submitted to the NC-Pro Workshop at IFIP
  Networking Conference 2011, and to appear in the conference proceedings,
  published by Springer-Verlag, in the Lecture Notes in Computer Science (LNCS)
  series",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A network coding scheme for practical implementations of wireless body area
networks is presented, with the objective of providing reliability under
low-energy constraints. We propose a simple network layer protocol for star
networks, adapting redundancy based on both transmission and reception energies
for data and control packets, as well as channel conditions. Our numerical
results show that even for small networks, the amount of energy reduction
achievable can range from 29% to 87%, as the receiving energy per control
packet increases from equal to much larger than the transmitting energy per
data packet. The achievable gains increase as a) more nodes are added to the
network, and/or b) the channels seen by different sensor nodes become more
asymmetric.
","[{'version': 'v1', 'created': 'Sun, 1 Aug 2010 02:33:41 GMT'}, {'version': 'v2', 'created': 'Fri, 25 Feb 2011 21:04:51 GMT'}]",2011-03-01,"[['Shi', 'Xiaomeng', ''], ['Medard', 'Muriel', ''], ['Lucani', 'Daniel', '']]","['wireless body area networks', 'network coding', 'medium access control', 'energy efficiency']"
19513,1406.2889,Jonathan Tapson,"Jonathan Tapson, Philip de Chazal and Andr\'e van Schaik",Explicit Computation of Input Weights in Extreme Learning Machines,In submission for the ELM 2014 Conference,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a closed form expression for initializing the input weights in a
multi-layer perceptron, which can be used as the first step in synthesis of an
Extreme Learning Ma-chine. The expression is based on the standard function for
a separating hyperplane as computed in multilayer perceptrons and linear
Support Vector Machines; that is, as a linear combination of input data
samples. In the absence of supervised training for the input weights, random
linear combinations of training data samples are used to project the input data
to a higher dimensional hidden layer. The hidden layer weights are solved in
the standard ELM fashion by computing the pseudoinverse of the hidden layer
outputs and multiplying by the desired output values. All weights for this
method can be computed in a single pass, and the resulting networks are more
accurate and more consistent on some standard problems than regular ELM
networks of the same size.
","[{'version': 'v1', 'created': 'Wed, 11 Jun 2014 12:39:10 GMT'}]",2014-06-12,"[['Tapson', 'Jonathan', ''], ['de Chazal', 'Philip', ''], ['van Schaik', 'André', '']]","['Extreme learning machine', 'machine learning', 'computed input weights']"
19514,1610.08727,Alejandro Sanchez Gomez,"Alejandro Sanchez-Gomez, Jesus Diaz, David Arroyo","Combining Usability and Privacy Protection in Free-Access Public Cloud
  Storage Servers: Review of the Main Threats and Challenges",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The 21st century belongs to the world of computing, specially as a result of
the so-called cloud computing. This technology enables ubiquitous information
management and thus people can access all their data from any place and at any
time. In this landscape, the emergence of cloud storage has had an important
role in the last five years. Nowadays, several free-access public cloud storage
services make it possible for users to have a free backup of their assets and
to manage and share them, representing a low-cost opportunity for Small and
Medium Companies (SME). However, the adoption of cloud storage involves data
outsourcing, so a user does not have the guarantee about the way her data will
be processed and protected. Therefore, it seems necessary to endow public cloud
storage with a set of means to protect users' confidentiality and privacy, to
assess data integrity and to guarantee a proper backup of information assets.
Along this paper we discuss the main challenges to achieve such a goal,
underlining the set of functionalities already implemented in the most popular
public cloud storage services.
","[{'version': 'v1', 'created': 'Thu, 27 Oct 2016 11:59:17 GMT'}]",2016-10-28,"[['Sanchez-Gomez', 'Alejandro', ''], ['Diaz', 'Jesus', ''], ['Arroyo', 'David', '']]","['Security and Privacy in cloud storage', 'Secure software developmentmethodology', 'Security requirements verification', 'Serverless architectures']"
19515,1009.3665,Amitabh Chaudhary,"Tanu Malik, Xiaodan Wang, Philip Little, Amitabh Chaudhary, and Ani
  Thakar","A Dynamic Data Middleware Cache for Rapidly-growing Scientific
  Repositories",,,,,cs.DC cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modern scientific repositories are growing rapidly in size. Scientists are
increasingly interested in viewing the latest data as part of query results.
Current scientific middleware cache systems, however, assume repositories are
static. Thus, they cannot answer scientific queries with the latest data. The
queries, instead, are routed to the repository until data at the cache is
refreshed. In data-intensive scientific disciplines, such as astronomy,
indiscriminate query routing or data refreshing often results in runaway
network costs. This severely affects the performance and scalability of the
repositories and makes poor use of the cache system. We present Delta, a
dynamic data middleware cache system for rapidly-growing scientific
repositories. Delta's key component is a decision framework that adaptively
decouples data objects---choosing to keep some data object at the cache, when
they are heavily queried, and keeping some data objects at the repository, when
they are heavily updated. Our algorithm profiles incoming workload to search
for optimal data decoupling that reduces network costs. It leverages formal
concepts from the network flow problem, and is robust to evolving scientific
workloads. We evaluate the efficacy of Delta, through a prototype
implementation, by running query traces collected from a real astronomy survey.
","[{'version': 'v1', 'created': 'Sun, 19 Sep 2010 22:26:23 GMT'}]",2010-09-21,"[['Malik', 'Tanu', ''], ['Wang', 'Xiaodan', ''], ['Little', 'Philip', ''], ['Chaudhary', 'Amitabh', ''], ['Thakar', 'Ani', '']]","['dynamic data', 'middleware cache', 'network traffic', 'vertex cover', 'robust algorithms']"
19516,1610.05712,Mariano Tepper,Mariano Tepper and Guillermo Sapiro,Fast L1-NMF for Multiple Parametric Model Estimation,,,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we introduce a comprehensive algorithmic pipeline for multiple
parametric model estimation. The proposed approach analyzes the information
produced by a random sampling algorithm (e.g., RANSAC) from a machine
learning/optimization perspective, using a \textit{parameterless} biclustering
algorithm based on L1 nonnegative matrix factorization (L1-NMF). The proposed
framework exploits consistent patterns that naturally arise during the RANSAC
execution, while explicitly avoiding spurious inconsistencies. Contrarily to
the main trends in the literature, the proposed technique does not impose
non-intersecting parametric models. A new accelerated algorithm to compute
L1-NMFs allows to handle medium-sized problems faster while also extending the
usability of the algorithm to much larger datasets. This accelerated algorithm
has applications in any other context where an L1-NMF is needed, beyond the
biclustering approach to parameter estimation here addressed. We accompany the
algorithmic presentation with theoretical foundations and numerous and diverse
examples.
","[{'version': 'v1', 'created': 'Tue, 18 Oct 2016 17:20:38 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Nov 2016 15:54:14 GMT'}]",2016-11-14,"[['Tepper', 'Mariano', ''], ['Sapiro', 'Guillermo', '']]","['Multiple parametric model estimation', 'robust fitting', 'RANSAC', 'nonnegativematrix factorization', 'biclustering', 'L1 optimization']"
19517,1004.3263,Vishal Goyal,"Aissam Berrahou, Mourad Rafi, Mohsine Eleuldj",DRMS Co-design by F4MS,"International Journal of Computer Science Issues online at
  http://ijcsi.org/articles/DRMS-Co-design-by-F4MS.php","IJCSI, Volume 7, Issue 2, March 2010",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present Digital Rights Management systems (DRMS) which are
becoming more and more complex due to technology revolution in relation with
telecommunication networks, multimedia applications and the reading equipments
(Mobile Phone, IPhone, PDA, DVD Player,..). The complexity of the DRMS,
involves the use of new tools and methodologies that support software
components and hardware components coupled design. The traditional systems
design approach has been somewhat hardware first in that the software
components are designed after the hardware has been designed and prototyped.
This leaves little flexibility in evaluating different design options and
hardware-software mappings. The key of codesign is to avoid isolation between
hardware and software designs to proceed in parallel, with feedback and
interaction between the two as the design progresses, in order to achieve high
quality designs with a reduced design time. In this paper, we present the F4MS
(Framework for Mixed Systems) which is a unified framework for software and
hardware design environment, simulation and aided execution of mixed systems.
To illustrate this work we propose an implementation of DRMS business model
based on F4MS framework.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2010 18:01:45 GMT'}]",2010-04-20,"[['Berrahou', 'Aissam', ''], ['Rafi', 'Mourad', ''], ['Eleuldj', 'Mohsine', '']]","['DRMS', 'software components', 'hardware components', 'DRMS business model', 'co-design', 'F4MS framework']"
19518,1702.07011,Carlene Lebeuf Carlene Lebeuf,"Carlene Lebeuf, Margaret-Anne Storey, Alexey Zagalsky",How Software Developers Mitigate Collaboration Friction with Chatbots,"6 pages, accepted to the Talking with Conversational Agents in
  Collaborative Action Workshop at the 20th ACM conference on
  Computer-Supported Cooperative Work and Social Computing (CSCW '17)
  https://talkingwithagents.wordpress.com/position-papers/",,,,cs.HC cs.SE,http://creativecommons.org/licenses/by/4.0/,"  Modern software developers rely on an extensive set of social media tools and
communication channels. The adoption of team communication platforms has led to
the emergence of conversation-based tools and integrations, many of which are
chatbots. Understanding how software developers manage their complex
constellation of collaborators in conjunction with the practices and tools they
use can bring valuable insights into socio-technical collaborative work in
software development and other knowledge work domains.
  In this paper, we explore how chatbots can help reduce the friction points
software developers face when working collaboratively. Using a socio-technical
model for collaborative work, we identify three main areas for conflict:
friction stemming from team interactions with each other, an individual's
interactions with technology, and team interactions with technology. Finally,
we provide a set of open questions for discussion within the research
community.
","[{'version': 'v1', 'created': 'Wed, 22 Feb 2017 21:28:07 GMT'}]",2017-02-24,"[['Lebeuf', 'Carlene', ''], ['Storey', 'Margaret-Anne', ''], ['Zagalsky', 'Alexey', '']]","['Software Development', 'Collaboration', 'Chatbots', 'Bots', 'Conversational Interfaces', 'HCI', 'Socio-Technical Systems']"
19519,1307.4174,Farheen Siddiqui,"Farheen Siddiqui, M. Afshar Alam",Ontology Based Feature Driven Development Life Cycle,"6 papers, IJCSI International Journal of Computer Science Issues,
  Vol. 9, Issue 1, No 2, January 2012",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The upcoming technology support for semantic web promises fresh directions
for Software Engineering community. Also semantic web has its roots in
knowledge engineering that provoke software engineers to look for application
of ontology applications throughout the Software Engineering life cycle. The
internal components of a semantic web are light weight and may be of less
quality standards than the externally visible modules. In fact the internal
components are generated from external (ontological) component. That is the
reason agile development approaches such as feature driven development are
suitable for applications internal component development. As yet there is no
particular procedure that describes the role of ontology in the processes.
Therefore we propose an ontology based feature driven development for semantic
web application that can be used form application model development to feature
design and implementation. Features are precisely defined in the OWL-based
domain model. Transition from OWL based domain model to feature list is
directly defined in transformation rules. On the other hand the ontology based
overall model can be easily validated through automated tools. Advantages of
ontology-based feature Driven development are also discussed.
","[{'version': 'v1', 'created': 'Tue, 16 Jul 2013 06:33:36 GMT'}]",2013-07-17,"[['Siddiqui', 'Farheen', ''], ['Alam', 'M. Afshar', '']]","['Semantic Web', 'Feature Driven Development', 'Agile Development']"
19520,1309.7611,Bal\'azs Hidasi,"Bal\'azs Hidasi, Domonkos Tikk","Context-aware recommendations from implicit data via scalable tensor
  factorization","Extended version of the ECML/PKDD 2012 paper of B. Hidasi & D. Tikk:
  Fast ALS-based tensor factorization for context-aware recommendation from
  implicit feedback [arXiv:1204.1259]",,,,cs.LG cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Albeit the implicit feedback based recommendation problem - when only the
user history is available but there are no ratings - is the most typical
setting in real-world applications, it is much less researched than the
explicit feedback case. State-of-the-art algorithms that are efficient on the
explicit case cannot be automatically transformed to the implicit case if
scalability should be maintained. There are few implicit feedback benchmark
data sets, therefore new ideas are usually experimented on explicit benchmarks.
In this paper, we propose a generic context-aware implicit feedback recommender
algorithm, coined iTALS. iTALS applies a fast, ALS-based tensor factorization
learning method that scales linearly with the number of non-zero elements in
the tensor. We also present two approximate and faster variants of iTALS using
coordinate descent and conjugate gradient methods at learning. The method also
allows us to incorporate various contextual information into the model while
maintaining its computational efficiency. We present two context-aware variants
of iTALS incorporating seasonality and item purchase sequentiality into the
model to distinguish user behavior at different time intervals, and product
types with different repetitiveness. Experiments run on six data sets shows
that iTALS clearly outperforms context-unaware models and context aware
baselines, while it is on par with factorization machines (beats 7 times out of
12 cases) both in terms of recall and MAP.
","[{'version': 'v1', 'created': 'Sun, 29 Sep 2013 15:50:45 GMT'}]",2013-10-01,"[['Hidasi', 'Balázs', ''], ['Tikk', 'Domonkos', '']]","['recommender systems', 'tensor factorization', 'context awareness', 'implicit feedback']"
19521,1107.3360,Harmunish Taneja,Dr. Pushpa R. Suri and Harmunish Taneja,Object Oriented Information Computing over WWW,"4 pages, 1 table, IJCSI International Journal of Computer Science
  Issues, Vol. 7, Issue 3, No 7, May 2010",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional search engines on World Wide Web (WWW) focus essentially on
relevance ranking at the page level. But this lead to missing innumerable
structured information about real-world objects embedded in static Web pages
and online Web databases. Page-level information retrieval (IR) can
unfortunately lead to highly inaccurate relevance ranking in answering
object-oriented queries. On the other hand, Object Oriented Information
Computing (OOIC) is promising and greatly reduces the complexity of the system
while improving reusability and manageability. The most distinguishing
requirement of today's complex heterogeneous systems is the need of the
computing system to instantly adapt to vigorously changing conditions. OOIC
allows reflecting the dynamic characteristics of the applications by
instantiating objects dynamically. In this paper, major challenges of OOIC as
well as its rudiments are recapped. The review includes the insight to PopRank
Model and comparison analysis of conventional page rank based IR with OOIC
","[{'version': 'v1', 'created': 'Mon, 18 Jul 2011 06:05:12 GMT'}]",2011-07-19,"[['Suri', 'Dr. Pushpa R.', ''], ['Taneja', 'Harmunish', '']]","['Information Retrieval (IR)', 'Object Oriented Information Computing (OOIC)', 'popularity propagation factor (PPF)', 'World Wide Web (WWW)']"
19522,1710.03600,Zheng-Chu Guo,Zheng-Chu Guo and Lei Shi,Fast and Strong Convergence of Online Learning Algorithms,,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the online learning algorithm without explicit
regularization terms. This algorithm is essentially a stochastic gradient
descent scheme in a reproducing kernel Hilbert space (RKHS). The polynomially
decaying step size in each iteration can play a role of regularization to
ensure the generalization ability of online learning algorithm. We develop a
novel capacity dependent analysis on the performance of the last iterate of
online learning algorithm. The contribution of this paper is two-fold. First,
our nice analysis can lead to the convergence rate in the standard mean square
distance which is the best so far. Second, we establish, for the first time,
the strong convergence of the last iterate with polynomially decaying step
sizes in the RKHS norm. We demonstrate that the theoretical analysis
established in this paper fully exploits the fine structure of the underlying
RKHS, and thus can lead to sharp error estimates of online learning algorithm.
","[{'version': 'v1', 'created': 'Tue, 10 Oct 2017 13:53:45 GMT'}]",2017-10-11,"[['Guo', 'Zheng-Chu', ''], ['Shi', 'Lei', '']]","['Learning theory', 'Online learning', 'Convergence analysis', 'Reproducing kernel Hilbert space']"
19523,1005.4853,Yuval Kochman,Yuval Kochman and Ram Zamir,Analog Matching of Colored Sources to Colored Channels,"Submitted to IEEE Trans. Info. theory, July 2008. Revised May 2010",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Analog (uncoded) transmission provides a simple and robust scheme for
communicating a Gaussian source over a Gaussian channel under the mean squared
error (MSE) distortion measure. Unfortunately, its performance is usually
inferior to the all-digital, separation-based source-channel coding solution,
which requires exact knowledge of the channel at the encoder. The loss comes
from the fact that except for very special cases, e.g. white source and channel
of matching bandwidth (BW), it is impossible to achieve perfect matching of
source to channel and channel to source by linear means. We show that by
combining prediction and modulo-lattice operations, it is possible to match any
colored Gaussian source to any colored Gaussian noise channel (of possibly
different BW), hence achieve Shannon's optimum attainable performance $R(D)=C$.
Furthermore, when the source and channel BWs are equal (but otherwise their
spectra are arbitrary), this scheme is asymptotically robust in the sense that
for high signal-to-noise ratio a single encoder (independent of the noise
variance) achieves the optimum performance. The derivation is based upon a
recent modulo-lattice modulation scheme for transmitting a Wyner-Ziv source
over a dirty-paper channel.
","[{'version': 'v1', 'created': 'Wed, 26 May 2010 15:49:57 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Jun 2010 15:52:12 GMT'}]",2010-06-03,"[['Kochman', 'Yuval', ''], ['Zamir', 'Ram', '']]","['joint source/channel coding', 'analog transmission', 'Wyner-Ziv problem', 'writing on dirty']"
19524,1402.1141,Carlos Pedro dos Santos Gon\c{c}alves,Carlos Pedro Gon\c{c}alves,"Quantum Cybernetics and Complex Quantum Systems Science - A Quantum
  Connectionist Exploration",,,,,cs.NE cond-mat.dis-nn quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quantum cybernetics and its connections to complex quantum systems science is
addressed from the perspective of complex quantum computing systems. In this
way, the notion of an autonomous quantum computing system is introduced in
regards to quantum artificial intelligence, and applied to quantum artificial
neural networks, considered as autonomous quantum computing systems, which
leads to a quantum connectionist framework within quantum cybernetics for
complex quantum computing systems. Several examples of quantum feedforward
neural networks are addressed in regards to Boolean functions' computation,
multilayer quantum computation dynamics, entanglement and quantum
complementarity. The examples provide a framework for a reflection on the role
of quantum artificial neural networks as a general framework for addressing
complex quantum systems that perform network-based quantum computation,
possible consequences are drawn regarding quantum technologies, as well as
fundamental research in complex quantum systems science and quantum biology.
","[{'version': 'v1', 'created': 'Wed, 5 Feb 2014 19:48:24 GMT'}]",2014-02-06,"[['Gonçalves', 'Carlos Pedro', '']]","['Quantum cybernetics', 'complex quantum systems science', 'complexquantum computing systems', 'quantum connectionism', 'quantum artificial neuralnetworks']"
19525,1307.1380,Uwe Aickelin,"Ian Dent, Uwe Aickelin, Tom Rodden","The Application of a Data Mining Framework to Energy Usage Profiling in
  Domestic Residences using UK data","Buildings Do Not Use Energy, People Do Research Student Conference,
  Bath, UK, 2011. arXiv admin note: text overlap with arXiv:1307.1079",,,,cs.CE cs.LG stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a method for defining representative load profiles for
domestic electricity users in the UK. It considers bottom up and clustering
methods and then details the research plans for implementing and improving
existing framework approaches based on the overall usage profile. The work
focuses on adapting and applying analysis framework approaches to UK energy
data in order to determine the effectiveness of creating a few (single figures)
archetypical users with the intention of improving on the current methods of
determining usage profiles. The work is currently in progress and the paper
details initial results using data collected in Milton Keynes around 1990.
Various possible enhancements to the work are considered including a split
based on temperature to reflect the varying UK weather conditions.
","[{'version': 'v1', 'created': 'Thu, 4 Jul 2013 15:45:09 GMT'}]",2013-07-05,"[['Dent', 'Ian', ''], ['Aickelin', 'Uwe', ''], ['Rodden', 'Tom', '']]","['Load profiles', 'clustering', 'data mining', 'electricity markets', 'demand-side']"
19526,1603.05047,Jakob Gruber,"Jakob Gruber, Jesper Larsson Tr\""aff, Martin Wimmer","Benchmarking Concurrent Priority Queues: Performance of k-LSM and
  Related Data Structures",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A number of concurrent, relaxed priority queues have recently been proposed
and implemented. Results are commonly reported for a throughput benchmark that
uses a uniform distribution of keys drawn from a large integer range, and
mostly for single systems. We have conducted more extensive benchmarking of
three recent, relaxed priority queues on four different types of systems with
different key ranges and distributions. While we can show superior throughput
and scalability for our own k-LSM priority queue for the uniform key
distribution, the picture changes drastically for other distributions, both
with respect to achieved throughput and relative merit of the priority queues.
The throughput benchmark alone is thus not sufficient to characterize the
performance of concurrent priority queues. Our benchmark code and k-LSM
priority queue are publicly available to foster future comparison.
","[{'version': 'v1', 'created': 'Wed, 16 Mar 2016 11:46:06 GMT'}]",2016-03-17,"[['Gruber', 'Jakob', ''], ['Träff', 'Jesper Larsson', ''], ['Wimmer', 'Martin', '']]","['Priority Queues', 'Concurrency', 'Relaxation', 'Benchmarking']"
19527,1402.1661,Jan Plato\v{s},"Milos Kudelka, Sarka Zehnalova and Jan Platos",Network Sampling Based on NN Representatives,,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The amount of large-scale real data around us increase in size very quickly
and so does the necessity to reduce its size by obtaining a representative
sample. Such sample allows us to use a great variety of analytical methods,
whose direct application on original data would be infeasible. There are many
methods used for different purposes and with different results. In this paper
we outline a simple and straightforward approach based on analyzing the nearest
neighbors (NN) that is generally applicable. This feature is illustrated on
experiments with weighted networks and vector data. The properties of the
representative sample show that the presented approach maintains very well
internal data structures (e.g. clusters and density). Key technical parameters
of the approach is low complexity and high scalability. This allows the
application of this approach to the area of big data.
","[{'version': 'v1', 'created': 'Fri, 7 Feb 2014 15:09:18 GMT'}]",2014-02-10,"[['Kudelka', 'Milos', ''], ['Zehnalova', 'Sarka', ''], ['Platos', 'Jan', '']]","['sampling', 'complex networks', 'graphs', 'data mining']"
19528,0706.1290,Sylviane Schwer,Sylviane R. Schwer (LIPN),Temporal Reasoning without Transitive Tables,rapport interne,,,,cs.AI,,"  Representing and reasoning about qualitative temporal information is an
essential part of many artificial intelligence tasks. Lots of models have been
proposed in the litterature for representing such temporal information. All
derive from a point-based or an interval-based framework. One fundamental
reasoning task that arises in applications of these frameworks is given by the
following scheme: given possibly indefinite and incomplete knowledge of the
binary relationships between some temporal objects, find the consistent
scenarii between all these objects. All these models require transitive tables
-- or similarly inference rules-- for solving such tasks. We have defined an
alternative model, S-languages - to represent qualitative temporal information,
based on the only two relations of \emph{precedence} and \emph{simultaneity}.
In this paper, we show how this model enables to avoid transitive tables or
inference rules to handle this kind of problem.
","[{'version': 'v1', 'created': 'Sat, 9 Jun 2007 06:57:05 GMT'}]",2007-06-12,"[['Schwer', 'Sylviane R.', '', 'LIPN']]","['Temporal reasoning', 'formal languages', 'constraints satisfaction']"
19529,1511.01865,Seyed Mostafa Kia,"Nastaran Mohammadian Rad, Andrea Bizzego, Seyed Mostafa Kia, Giuseppe
  Jurman, Paola Venuti, Cesare Furlanello","Convolutional Neural Network for Stereotypical Motor Movement Detection
  in Autism","Presented at 5th NIPS Workshop on Machine Learning and Interpretation
  in Neuroimaging (MLINI), 2015, (http://arxiv.org/html/1605.04435), Report-no:
  MLINI/2015/13",,,MLINI/2015/13,cs.NE cs.CV cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autism Spectrum Disorders (ASDs) are often associated with specific atypical
postural or motor behaviors, of which Stereotypical Motor Movements (SMMs) have
a specific visibility. While the identification and the quantification of SMM
patterns remain complex, its automation would provide support to accurate
tuning of the intervention in the therapy of autism. Therefore, it is essential
to develop automatic SMM detection systems in a real world setting, taking care
of strong inter-subject and intra-subject variability. Wireless accelerometer
sensing technology can provide a valid infrastructure for real-time SMM
detection, however such variability remains a problem also for machine learning
methods, in particular whenever handcrafted features extracted from
accelerometer signal are considered. Here, we propose to employ the deep
learning paradigm in order to learn discriminating features from multi-sensor
accelerometer signals. Our results provide preliminary evidence that feature
learning and transfer learning embedded in the deep architecture achieve higher
accurate SMM detectors in longitudinal scenarios.
","[{'version': 'v1', 'created': 'Thu, 5 Nov 2015 19:36:33 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Jan 2016 21:02:02 GMT'}, {'version': 'v3', 'created': 'Tue, 7 Jun 2016 19:11:34 GMT'}]",2016-06-08,"[['Rad', 'Nastaran Mohammadian', ''], ['Bizzego', 'Andrea', ''], ['Kia', 'Seyed Mostafa', ''], ['Jurman', 'Giuseppe', ''], ['Venuti', 'Paola', ''], ['Furlanello', 'Cesare', '']]","['Autism', 'SMM', 'Deep learning', 'Wireless inertial sensors']"
19530,1005.3158,Ruhollah Tavakoli,Ruhollah Tavakoli,"Improvement Cache Efficiency of Explicit Finite Element Procedure and
  its Application to Parallel Casting Solidification Simulation",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A simple method for improving cache efficiency of serial and parallel
explicit finite procedure with application to casting solidification simulation
over three-dimensional complex geometries is presented. The method is based on
division of the global data to smaller blocks and treating each block
independently from others at each time step. A novel parallel finite element
algorithm for non-overlapped element-base decomposed domain is presented for
implementation of serial and parallel version of the presented method. Effect
of mesh reordering on the efficiency is also investigated. A simple algorithm
is presented for high quality decomposition of decoupled global mesh. Our
result shows 10-20 \% performance improvement by mesh reordering and 1.2-2.2
speedup with application of the presented cache efficient algorithm (for serial
and parallel versions). Also the presented parallel solver (without
cache-efficient feature) shows nearly linear speedup on the traditional
Ethernet networked Linux cluster.
","[{'version': 'v1', 'created': 'Tue, 18 May 2010 11:17:34 GMT'}]",2010-05-19,"[['Tavakoli', 'Ruhollah', '']]","['cache', 'casting simulation', 'data locality', 'domain decomposition', 'finiteelement', 'parallel', 'solidification']"
19531,1705.06738,Andrei Nemytykh,"Alexei P. Lisitsa, Andrei P. Nemytykh",Verifying Programs via Intermediate Interpretation,"Fifth International Workshop on Verification and Program
  Transformation (VPT-2017), April 29th, 2017, Uppsala, Sweden, 37 pages",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore an approach to verification of programs via program transformation
applied to an interpreter of a programming language. A specialization technique
known as Turchin's supercompilation is used to specialize some interpreters
with respect to the program models. We show that several safety properties of
functional programs modeling a class of cache coherence protocols can be proved
by a supercompiler and compare the results with our earlier work on direct
verification via supercompilation not using intermediate interpretation.
  Our approach was in part inspired by an earlier work by De E. Angelis et al.
(2014-2015) where verification via program transformation and intermediate
interpretation was studied in the context of specialization of constraint logic
programs.
","[{'version': 'v1', 'created': 'Thu, 18 May 2017 11:20:30 GMT'}]",2017-05-22,"[['Lisitsa', 'Alexei P.', ''], ['Nemytykh', 'Andrei P.', '']]","['program specialization', 'supercompilation', 'program analysis', 'program transformation', 'safety verification', 'cache coherence protocols']"
19532,1610.09991,Edoardo Di Napoli,"Julian Lichtenstein (1), Jan Winkelmann (1), David S\'anchez de la
  Pe\~na (1), Toni Vidovi\'c (2), Edoardo Di Napoli (3 and 4) ((1) RWTH Aachen
  University, (2) University of Zagreb, (3) JARA-HPC, (4) Forschungszentrum
  J\""ulich)","Parallel adaptive integration in high-performance functional
  Renormalization Group computations","14 pages, 4 figures, accepted for publication in the proceedings of
  the JHPCS'16",,,,cs.CE cond-mat.str-el physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The conceptual framework provided by the functional Renormalization Group
(fRG) has become a formidable tool to study correlated electron systems on
lattices which, in turn, provided great insights to our understanding of
complex many-body phenomena, such as high- temperature superconductivity or
topological states of matter. In this work we present one of the latest
realizations of fRG which makes use of an adaptive numerical quadrature scheme
specifically tailored to the described fRG scheme. The final result is an
increase in performance thanks to improved parallelism and scalability.
","[{'version': 'v1', 'created': 'Mon, 31 Oct 2016 16:05:23 GMT'}]",2016-11-02,"[['Lichtenstein', 'Julian', '', '3 and 4'], ['Winkelmann', 'Jan', '', '3 and 4'], ['de la Peña', 'David Sánchez', '', '3 and 4'], ['Vidović', 'Toni', '', '3 and 4'], ['Di Napoli', 'Edoardo', '', '3 and 4']]","['adaptive quadrature', 'functional Renormalization Group', 'interacting fermions', 'hybrid parallelization', 'shared memory parallelism']"
19533,1208.3205,Manas Gaur,Manas Gaur,"Software Security analysis, static and dynamic testing in java and C
  environment, a comparative study",the research paper consists of 11 figures and 7 tabular comparison,,,,cs.CR cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The main stretch in the paper is buffer overflow anomaly occurring in major
source codes, designed in various programming language. It describes the
various as to how to improve your code and increase its strength to withstand
security theft occurring at vulnerable areas in the code. The main language
used is JAVA, regarded as one of the most object oriented language still create
lot of error like stack overflow, illegal/inappropriate method overriding. I
used tools confined to JAVA to test as how weak points in the code can be
rectified before compiled. The byte code theft is difficult to be conquered, so
it's a better to get rid of it in the plain java code itself. The tools used in
the research are PMD(Programming mistake detector), it helps to detect line of
code that make pop out error in near future like defect in hashcode(memory
maps) overriding due to which the java code will not function correctly.
Another tool is FindBUGS which provide the tester of the code to analyze the
weak points in the code like infinite loop, unsynchronized wait, deadlock
situation, null referring and dereferencing. Another tool which provides the
base to above tools is JaCoCo code coverage analysis used to detect unreachable
part and unused conditions of the code which improves the space complexity and
helps in easy clarification of errors.
  Through this paper, we design an algorithm to prevent the loss of data. The
main audience is the white box tester who might leave out essential line of
code like, index variables, infinite loop, and inappropriate hashcode in the
major source program. This algorithm serves to reduce the damage in case of
buffer overflow
","[{'version': 'v1', 'created': 'Wed, 15 Aug 2012 20:08:59 GMT'}]",2012-08-17,"[['Gaur', 'Manas', '']]","['stack overflow', 'buffer overflow', 'code performance', 'hascode analysis', 'statement coverage']"
19534,1008.4268,Vijay Kumar Mago Dr,"Kawal Jeet, Vijay Kumar Mago, Bhanu Prasad and Rajinder Singh Minhas","An Influence Diagram-Based Approach for Estimating Staff Training in
  Software Industry","16 Pages, 7 Figures, 2 Tables","Journal of Intelligent Systems, Vol 18 (4). 2009. pp 267-283",,,cs.SE cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The successful completion of a software development process depends on the
analytical capability and foresightedness of the project manager. For the
project manager, the main intriguing task is to manage the risk factors as they
adversely influence the completion deadline. One such key risk factor is staff
training. The risk of this factor can be avoided by pre-judging the amount of
training required by the staff. So, a procedure is required to help the project
manager make this decision. This paper presents a system that uses influence
diagrams to implement the risk model to aid decision making. The system also
considers the cost of conducting the training, based on various risk factors
such as, (i) Lack of experience with project software; (ii) Newly appointed
staff; (iii) Staff not well versed with the required quality standards; and
(iv) Lack of experience with project environment. The system provides estimated
requirement details for staff training at the beginning of a software
development project.
","[{'version': 'v1', 'created': 'Wed, 25 Aug 2010 13:10:30 GMT'}]",2010-08-26,"[['Jeet', 'Kawal', ''], ['Mago', 'Vijay Kumar', ''], ['Prasad', 'Bhanu', ''], ['Minhas', 'Rajinder Singh', '']]","['risk management', 'staff training', 'influence diagram']"
19535,1106.5302,Florin Pop Mr.,"Dacian Tudor, Florin Pop, Valentin Cristea, Vladimir Cretu",Towards an IO intensive Grid application instrumentation in MedioGRID,,"Proceedings of the 16th International Conference on Control
  Systems and Computer Science (CSCS16'07), pp. 130-135, May 22-25, Bucharest,
  Romania, 2007",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Obtaining high performance in IO intensive applications requires systems that
support reliable fast transfer, data replication, and caching. In this paper we
present an architecture designed for supporting IO intensive applications in
MedioGRID, a system for real-time processing of satellite images, operating in
a Grid environment. The solution ensures that applications which are processing
geographical data have uniform access to data and is based on continuous
monitoring of the data transfers using MonALISA and its extensions. The
MedioGRID architecture is also built on Globus, Condor and PBS and based on
this middleware we aim to extract information about the running systems. The
results obtained in testing MedioGRID system for large data transfers show that
monitoring system provides a very good view of system evolution.
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2011 06:03:28 GMT'}]",2011-06-28,"[['Tudor', 'Dacian', ''], ['Pop', 'Florin', ''], ['Cristea', 'Valentin', ''], ['Cretu', 'Vladimir', '']]","['Grid Computing', 'IO intensive applications', 'Monitoring', 'Data replication', 'Data scheduling']"
19536,1207.6448,Debajyoti Mukhopadhyay Prof.,"Debajyoti Mukhopadhyay, Dhaval Chandarana, Rutvi Dave, Sharyu Page,
  Shikha Gupta",Query Optimization Over Web Services Using A Mixed Approach,"10 pages, 1 figure","Advances in Computing & Inf. Technology, AISC 178, pp.381-389,
  2012",,,cs.DB cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Web Service Management System (WSMS) can be well-thought-out as a
consistent and a secure way of managing the web services. Web Service has
become a quintessential part of the web world, managing and sharing the
resources of the business it is associated with. In this paper, we focus on the
query optimization aspect of handling the ""natural language"" query, queried to
the WSMS. The map-select-composite operations are piloted to select specific
web services. The main aftermath of our research is ensued in an algorithm
which uses cost-based as well as heuristic based approach for query
optimization. Query plan is formed after cost-based evaluation and using Greedy
algorithm. The heuristic based approach further optimizes the evaluation plan.
This scheme not only guarantees an optimal solution, which has a minimum
diversion from the ideal solution, but also saves time which is otherwise
utilized in generating various query plans using many mathematical models and
then evaluating each one.
","[{'version': 'v1', 'created': 'Fri, 27 Jul 2012 04:55:07 GMT'}]",2012-07-30,"[['Mukhopadhyay', 'Debajyoti', ''], ['Chandarana', 'Dhaval', ''], ['Dave', 'Rutvi', ''], ['Page', 'Sharyu', ''], ['Gupta', 'Shikha', '']]","['Query optimization', 'Cost-based approach', 'Heuristic-based approach', 'Precedence constraints', 'Greedy algorithm']"
19537,1705.05688,Olivier Cur\'e,Xiangnan Ren and Olivier Cur\'e,Strider: A Hybrid Adaptive Distributed RDF Stream Processing Engine,"16 pages, 9 figures",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real-time processing of data streams emanating from sensors is becoming a
common task in Internet of Things scenarios. The key implementation goal
consists in efficiently handling massive incoming data streams and supporting
advanced data analytics services like anomaly detection. In an on-going,
industrial project, we found out that a 24/7 available stream processing engine
usually faces dynamically changing data and workload characteristics. These
changes impact the engine's performance and reliability. We propose Strider, a
hybrid adaptive distributed RDF Stream Processing engine that optimizes logical
query plan according to the state of data streams. Strider has been designed to
guarantee important industrial properties such as scalability, high
availability, fault-tolerant, high throughput and acceptable latency. These
guarantees are obtained by designing the engine's architecture with
state-of-the-art Apache components such as Spark and Kafka. We highlight the
efficiency (e.g., on a single machine machine, up to 60x gain on throughput
compared to state-of-the-art systems, a throughput of 3.1 million
triples/second on a 9 machines cluster, a major breakthrough in this system's
category) of Strider on real-world and synthetic data sets.
","[{'version': 'v1', 'created': 'Tue, 16 May 2017 12:54:23 GMT'}]",2017-05-17,"[['Ren', 'Xiangnan', ''], ['Curé', 'Olivier', '']]","['RDF Stream Processing', 'SPARQL', 'Adaptive Query Processing', 'Distributed Computing', 'Apache Spark']"
19538,1712.06933,Renato Fabbri,Renato Fabbri,"An anthropological account of the Vim text editor: features and tweaks
  after 10 years of usage","Scripts and other files are in this repository:
  https://github.com/ttm/vim",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Vim text editor is very rich in capabilities and thus complex. This
article is a description of Vim and a set of considerations about its usage and
design. It results from more than ten years of experience in using Vim for
writing and editing various types of documents, e.g. Python, C++, JavaScript,
ChucK programs; \LaTeX, Markdown, HTML, RDF, Make and other markup files; % TTM
binary files. It is commonplace, in the Vim users and developers communities,
to say that it takes about ten years to master (or start mastering) this text
editor, and I find that other experienced users have a different view of Vim
and that they use a different set of features. Therefore, this document exposes
my understandings in order to confront my usage with that of other Vim users.
Another goal is to make available a reference document with which new users can
grasp a sound overview by reading it and the discussions that it might
generate. Also, it should be useful for users of any degree of experience,
including me, as a compendium of commands, namespaces and tweaks. Upon
feedback, and maturing of my Vim usage, this document might be enhanced and
expanded.
","[{'version': 'v1', 'created': 'Mon, 18 Dec 2017 14:14:21 GMT'}]",2021-08-23,"[['Fabbri', 'Renato', '']]","['Vim', 'Text editor', 'Anthropological computer science', 'HCI', 'Tutorial']"
19539,1402.5953,Richard McClatchey,"Andrew Branson, Jetendr Shamdasani, Richard McClatchey",A Description Driven Approach for Flexible Metadata Tracking,"10 pages and 3 figures. arXiv admin note: text overlap with
  arXiv:1402.5753, arXiv:1402.5764","7th ESA International Conference on Ensuring Long-Term
  Preservation and Adding Value to Scientific and Technical Data (PV 2013)
  4--6th November 2013. Frascati, Italy",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evolving user requirements presents a considerable software engineering
challenge, all the more so in an environment where data will be stored for a
very long time, and must remain usable as the system specification evolves
around it. Capturing the description of the system addresses this issue since a
description-driven approach enables new versions of data structures and
processes to be created alongside the old, thereby providing a history of
changes to the underlying data models and enabling the capture of provenance
data. This description-driven approach is advocated in this paper in which a
system called CRISTAL is presented. CRISTAL is based on description-driven
principles; it can use previous versions of stored descriptions to define
various versions of data which can be stored in various forms. To demonstrate
the efficacy of this approach the history of the project at CERN is presented
where CRISTAL was used to track data and process definitions and their
associated provenance data in the construction of the CMS ECAL detector, how it
was applied to handle analysis tracking and data index provenance in the
neuGRID and N4U projects, and how it will be matured further in the CRISTAL-ISE
project. We believe that the CRISTAL approach could be invaluable in handling
the evolution, indexing and tracking of large datasets, and are keen to apply
it further in this direction.
","[{'version': 'v1', 'created': 'Mon, 24 Feb 2014 10:09:30 GMT'}]",2014-02-26,"[['Branson', 'Andrew', ''], ['Shamdasani', 'Jetendr', ''], ['McClatchey', 'Richard', '']]","['CMS', 'Metadata', 'Schema Evolution', 'Computer Science', 'Provenance', 'Semantics']"
19540,1407.6178,Raed Jaberi,Raed Jaberi,Computing the $2$-blocks of directed graphs,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $G$ be a directed graph. A \textit{$2$-directed block} in $G$ is a
maximal vertex set $C^{2d}\subseteq V$ with $|C^{2d}|\geq 2$ such that for each
pair of distinct vertices $x,y \in C^{2d}$, there exist two vertex-disjoint
paths from $x$ to $y$ and two vertex-disjoint paths from $y$ to $x$ in $G$. In
contrast to the $2$-vertex-connected components of $G$, the subgraphs induced
by the $2$-directed blocks may consist of few or no edges. In this paper we
present two algorithms for computing the $2$-directed blocks of $G$ in
$O(\min\lbrace m,(t_{sap}+t_{sb})n\rbrace n)$ time, where $t_{sap}$ is the
number of the strong articulation points of $G$ and $t_{sb}$ is the number of
the strong bridges of $G$. Furthermore, we study two related concepts: the
$2$-strong blocks and the $2$-edge blocks of $G$. We give two algorithms for
computing the $2$-strong blocks of $G$ in $O( \min \lbrace m,t_{sap} n\rbrace
n)$ time and we show that the $2$-edge blocks of $G$ can be computed in $O(\min
\lbrace m, t_{sb} n \rbrace n)$ time. In this paper we also study some
optimization problems related to the strong articulation points and the
$2$-blocks of a directed graph. Given a strongly connected graph $G=(V,E)$,
find a minimum cardinality set $E^{*}\subseteq E$ such that $G^{*}=(V,E^{*})$
is strongly connected and the strong articulation points of $G$ coincide with
the strong articulation points of $G^{*}$. This problem is called minimum
strongly connected spanning subgraph with the same strong articulation points.
We show that there is a linear time $17/3$ approximation algorithm for this
NP-hard problem. We also consider the problem of finding a minimum strongly
connected spanning subgraph with the same $2$-blocks in a strongly connected
graph $G$. We present approximation algorithms for three versions of this
problem, depending on the type of $2$-blocks.
","[{'version': 'v1', 'created': 'Wed, 23 Jul 2014 11:20:24 GMT'}]",2014-07-24,"[['Jaberi', 'Raed', '']]","['Directed graphs', 'Strong articulation points', 'Strong bridges', '2-blocks', 'Graph algorithms', 'Approximation algorithms']"
19541,1501.03058,Arbaaz Singh Sidhu,Arbaaz Singh Sidhu,"An Adaptive Neuro-Fuzzy Inference System Modeling for Grid-Adaptive
  Interpolation over Depth Images","8 pages, 6 figures, International conference on Signal, Image
  Processing and Management (SPM) 2014",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A suitable interpolation method is essential to keep the noise level minimum
along with the time-delay. In recent years, many different interpolation
filters have been developed for instance H.264-6 tap filter, and AVS- 4 tap
filter. The present work uses Adaptive Neuro-Fuzzy Inference System (ANFIS)
technique to model and investigate the effects of a four-tap low-pass tap
filter (Grid-adaptive filter) on a hole-filled depth image. The work
demonstrates the general form of uniform interpolations for both integer and
sub-pixel locations in terms of the sampling interval and filter length of
depth-images via diverse finite impulse response filtering schemes. The
demonstrated model combined modelling function of fuzzy inference with the
learning ability of artificial neural network.
","[{'version': 'v1', 'created': 'Tue, 13 Jan 2015 16:02:16 GMT'}]",2015-01-14,"[['Sidhu', 'Arbaaz Singh', '']]","['ANFIS', 'Depth Images', 'Hole filling', 'Interpolation', 'Interpolation filter']"
19542,1410.0741,Brett Israelsen,"Brett W. Israelsen, Dale A. Smith","Generalized Laguerre Reduction of the Volterra Kernel for Practical
  Identification of Nonlinear Dynamic Systems",16 pages,"AIChE Spring Meeting 2014, Paper 349438",,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Volterra series can be used to model a large subset of nonlinear, dynamic
systems. A major drawback is the number of coefficients required model such
systems. In order to reduce the number of required coefficients, Laguerre
polynomials are used to estimate the Volterra kernels. Existing literature
proposes algorithms for a fixed number of Volterra kernels, and Laguerre
series. This paper presents a novel algorithm for generalized calculation of
the finite order Volterra-Laguerre (VL) series for a MIMO system. An example
addresses the utility of the algorithm in practical application.
","[{'version': 'v1', 'created': 'Fri, 3 Oct 2014 01:59:25 GMT'}]",2014-10-06,"[['Israelsen', 'Brett W.', ''], ['Smith', 'Dale A.', '']]","['Laguerre', 'model reduction', 'system identification', 'statistical learning', 'Volterra']"
19543,0909.2517,Sk Sarif Hassan s,"Pabitra Pal Choudhury, Sk. Sarif Hassan, Sudhakar Sahoo, Soubhik
  Chakraborty",On the Interesting World of Fractals and Their Applications to Music,This paper tell about music fractals. It is delivered at FRMS-2009,,,,cs.OH,http://creativecommons.org/licenses/publicdomain/,"  In this paper we have defined one function that has been used to construct
different fractals having fractal dimensions between 1.58 and 2. Also, we tried
to calculate the amount of increment of fractal dimension in accordance with
the base of the number systems. Further, interestingly enough, these very
fractals could be a frame of lyrics for the musicians, as we know that the
fractal dimension of music is around 1.65 and varies between a high of 1.68 and
a low of 1.60. Further, at the end we conjecture that the switching from one
music fractal to another is nothing but enhancing a constant amount fractal
dimension which might be equivalent to a kind of different sets of musical
notes in various orientations.
","[{'version': 'v1', 'created': 'Mon, 14 Sep 2009 11:07:50 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Oct 2009 06:34:25 GMT'}]",2009-10-06,"[['Choudhury', 'Pabitra Pal', ''], ['Hassan', 'Sk. Sarif', ''], ['Sahoo', 'Sudhakar', ''], ['Chakraborty', 'Soubhik', '']]","['Carry Value Transformation', 'Fractals', 'Fractal Dimension', 'Spectral Density', 'Music']"
19544,1502.06297,Anacleto Correia,Anacleto Correia,Elements of style of BPMN language,"103 pages, 82 figures",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several BPMN graphical tools support, at least partly, the OMG's BPMN
specification. The BPMN standard is an essential guide for tools' makers when
implementing the rules regarding depiction of BPMN diagrammatic constructs.
Process modelers should also know how to rigorously use BPMN constructs when
depicting business processes either for business or IT purposes. Several
already published OMG's standards include the formal specification of
well-formedness rules concern-ing the metamodels they address. However, the
BPMN standard does not. Instead, the rules regarding BPMN elements are only
informally specified in natural language throughout the overall BPMN
documentation. Without strict rules concerning the correct usage of BPMN
elements, no wonder that plenty of available BPMN tools fail to enforce BPMN
process models' correctness. To mitigate this problem, and therefore contribute
for achieving BPMN models' correctness, we propose to supplement the BPMN
metamodel with well-formedness rules expressed by OCL invariants. So, this
document contributes to bring together a set of requirements that tools' makers
must comply with, in order to claim a broader BPMN 2 compliance. For the
regular process modeler, this report provides an extensive and pragmatic
catalog of BPMN elements' usage, to be followed in order to attain correct BPMN
process models.
","[{'version': 'v1', 'created': 'Mon, 23 Feb 2015 00:58:45 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Jan 2016 14:57:36 GMT'}]",2016-01-18,"[['Correia', 'Anacleto', '']]","['business process', 'business process modeling', 'BPMN', 'metamodel', 'OCL', 'model checking']"
19545,1005.5114,Anon Plangprasopchok,"Anon Plangprasopchok, Kristina Lerman, Lise Getoor","Growing a Tree in the Forest: Constructing Folksonomies by Integrating
  Structured Metadata","10 pages, To appear in the Proceedings of ACM SIGKDD Conference on
  Knowledge Discovery and Data Mining(KDD) 2010",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many social Web sites allow users to annotate the content with descriptive
metadata, such as tags, and more recently to organize content hierarchically.
These types of structured metadata provide valuable evidence for learning how a
community organizes knowledge. For instance, we can aggregate many personal
hierarchies into a common taxonomy, also known as a folksonomy, that will aid
users in visualizing and browsing social content, and also to help them in
organizing their own content. However, learning from social metadata presents
several challenges, since it is sparse, shallow, ambiguous, noisy, and
inconsistent. We describe an approach to folksonomy learning based on
relational clustering, which exploits structured metadata contained in personal
hierarchies. Our approach clusters similar hierarchies using their structure
and tag statistics, then incrementally weaves them into a deeper, bushier tree.
We study folksonomy learning using social metadata extracted from the
photo-sharing site Flickr, and demonstrate that the proposed approach addresses
the challenges. Moreover, comparing to previous work, the approach produces
larger, more accurate folksonomies, and in addition, scales better.
","[{'version': 'v1', 'created': 'Thu, 27 May 2010 16:46:04 GMT'}]",2010-05-28,"[['Plangprasopchok', 'Anon', ''], ['Lerman', 'Kristina', ''], ['Getoor', 'Lise', '']]","['Folksonomies', 'Taxonomies', 'Collective Knowledge', 'Social Information Processing', 'Data Mining', 'Social Metadata', 'Relational Clustering']"
19546,1802.06565,Andrew Collins Mr,"Andrew Collins, Dominika Tkaczyk, Akiko Aizawa, Joeran Beel",A Study of Position Bias in Digital Library Recommender Systems,,,,,cs.DL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  ""Position bias"" describes the tendency of users to interact with items on top
of a list with higher probability than with items at a lower position in the
list, regardless of the items' actual relevance. In the domain of recommender
systems, particularly recommender systems in digital libraries, position bias
has received little attention. We conduct a study in a real-world recommender
system that delivered ten million related-article recommendations to the users
of the digital library Sowiport, and the reference manager JabRef.
Recommendations were randomly chosen to be shuffled or non-shuffled, and we
compared click-through rate (CTR) for each rank of the recommendations.
According to our analysis, the CTR for the highest rank in the case of Sowiport
is 53% higher than expected in a hypothetical non-biased situation (0.189% vs.
0.123%). Similarly, in the case of Jabref the highest rank received a CTR of
1.276%, which is 87% higher than expected (0.683%). A chi-squared test confirms
the strong relationship between the rank of the recommendation shown to the
user and whether the user decided to click it (p < 0.01 for both Jabref and
Sowiport). Our study confirms the findings from other domains, that
recommendations in the top positions are more often clicked, regardless of
their actual relevance.
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 09:40:49 GMT'}]",2018-02-20,"[['Collins', 'Andrew', ''], ['Tkaczyk', 'Dominika', ''], ['Aizawa', 'Akiko', ''], ['Beel', 'Joeran', '']]","['recommender systems', 'position bias', 'click-through rate']"
19547,1506.03626,Han Xiao Bookman,"Han Xiao, Xiaoyan Zhu",Margin-Based Feed-Forward Neural Network Classifiers,"This paper has been published in ICANN 2015: International Conference
  on Artificial Neural Networks, Amsterdam, The Netherlands, (May 14-15, 2015)",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Margin-Based Principle has been proposed for a long time, it has been proved
that this principle could reduce the structural risk and improve the
performance in both theoretical and practical aspects. Meanwhile, feed-forward
neural network is a traditional classifier, which is very hot at present with a
deeper architecture. However, the training algorithm of feed-forward neural
network is developed and generated from Widrow-Hoff Principle that means to
minimize the squared error. In this paper, we propose a new training algorithm
for feed-forward neural networks based on Margin-Based Principle, which could
effectively promote the accuracy and generalization ability of neural network
classifiers with less labelled samples and flexible network. We have conducted
experiments on four UCI open datasets and achieved good results as expected. In
conclusion, our model could handle more sparse labelled and more high-dimension
dataset in a high accuracy while modification from old ANN method to our method
is easy and almost free of work.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2015 11:10:25 GMT'}]",2015-06-12,"[['Xiao', 'Han', ''], ['Zhu', 'Xiaoyan', '']]","['Max-Margin Principle', 'Feed-Forward Neural Network', 'Classifier']"
19548,0803.1621,Uwe Aickelin,"Peer-Olaf Siebers, Uwe Aickelin, Helen Celia and Christopher Clegg",An Agent-Based Simulation of In-Store Customer Experiences,,"Operational Research Society 4th Simulation Workshop (SW08), in
  print, pp, Worcestershire, UK 2008",,,cs.NE cs.CE cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Agent-based modelling and simulation offers a new and exciting way of
understanding the world of work. In this paper we describe the development of
an agent-based simulation model, designed to help to understand the
relationship between human resource management practices and retail
productivity. We report on the current development of our simulation model
which includes new features concerning the evolution of customers over time. To
test some of these features we have conducted a series of experiments dealing
with customer pool sizes, standard and noise reduction modes, and the spread of
the word of mouth. Our multi-disciplinary research team draws upon expertise
from work psychologists and computer scientists. Despite the fact we are
working within a relatively novel and complex domain, it is clear that
intelligent agents offer potential for fostering sustainable organisational
capabilities in the future.
","[{'version': 'v1', 'created': 'Tue, 11 Mar 2008 16:11:34 GMT'}]",2010-07-05,"[['Siebers', 'Peer-Olaf', ''], ['Aickelin', 'Uwe', ''], ['Celia', 'Helen', ''], ['Clegg', 'Christopher', '']]","['agent-based modelling', 'agent-based simulation', 'retail productivity', 'management practices', 'customer behaviour']"
19549,1610.04377,Diptesh Kanojia,"Diptesh Kanojia, Vishwajeet Kumar, and Krithi Ramamritham",Civique: Using Social Media to Detect Urban Emergencies,"This paper was presented at Workshop on Social Data Analytics and
  Management (SoDAM 2016), at Very Large Databases (VLDB 2016), in September
  2016",,,,cs.CL cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the Civique system for emergency detection in urban areas by
monitoring micro blogs like Tweets. The system detects emergency related
events, and classifies them into appropriate categories like ""fire"",
""accident"", ""earthquake"", etc. We demonstrate our ideas by classifying Twitter
posts in real time, visualizing the ongoing event on a map interface and
alerting users with options to contact relevant authorities, both online and
offline. We evaluate our classifiers for both the steps, i.e., emergency
detection and categorization, and obtain F-scores exceeding 70% and 90%,
respectively. We demonstrate Civique using a web interface and on an Android
application, in realtime, and show its use for both tweet detection and
visualization.
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2016 09:06:36 GMT'}]",2016-10-17,"[['Kanojia', 'Diptesh', ''], ['Kumar', 'Vishwajeet', ''], ['Ramamritham', 'Krithi', '']]","['Social Media', 'Event Detection', 'Data Analysis', 'EmergencyDetection', 'Urban Emergency', 'Twitter']"
19550,1603.07054,Dangwei Li,"Dangwei Li, Zhang Zhang, Xiaotang Chen, Haibin Ling, Kaiqi Huang",A Richly Annotated Dataset for Pedestrian Attribute Recognition,"16 pages, 8 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we aim to improve the dataset foundation for pedestrian
attribute recognition in real surveillance scenarios. Recognition of human
attributes, such as gender, and clothes types, has great prospects in real
applications. However, the development of suitable benchmark datasets for
attribute recognition remains lagged behind. Existing human attribute datasets
are collected from various sources or an integration of pedestrian
re-identification datasets. Such heterogeneous collection poses a big challenge
on developing high quality fine-grained attribute recognition algorithms.
Furthermore, human attribute recognition are generally severely affected by
environmental or contextual factors, such as viewpoints, occlusions and body
parts, while existing attribute datasets barely care about them. To tackle
these problems, we build a Richly Annotated Pedestrian (RAP) dataset from real
multi-camera surveillance scenarios with long term collection, where data
samples are annotated with not only fine-grained human attributes but also
environmental and contextual factors. RAP has in total 41,585 pedestrian
samples, each of which is annotated with 72 attributes as well as viewpoints,
occlusions, body parts information. To our knowledge, the RAP dataset is the
largest pedestrian attribute dataset, which is expected to greatly promote the
study of large-scale attribute recognition systems. Furthermore, we empirically
analyze the effects of different environmental and contextual factors on
pedestrian attribute recognition. Experimental results demonstrate that
viewpoints, occlusions and body parts information could assist attribute
recognition a lot in real applications.
","[{'version': 'v1', 'created': 'Wed, 23 Mar 2016 02:41:59 GMT'}, {'version': 'v2', 'created': 'Thu, 24 Mar 2016 02:54:02 GMT'}, {'version': 'v3', 'created': 'Wed, 27 Apr 2016 06:42:25 GMT'}]",2016-04-28,"[['Li', 'Dangwei', ''], ['Zhang', 'Zhang', ''], ['Chen', 'Xiaotang', ''], ['Ling', 'Haibin', ''], ['Huang', 'Kaiqi', '']]","['Pedestrian analysis', 'attribute recognition', 'multi-label learning']"
19551,1209.0550,Fawaz Bokhari,Fawaz Bokhari and Gergely Zaruba,On the Use of Smart Ants for Efficient Routing in Wireless Mesh Networks,"18 pages, 6 figures","International Journal of Wireless & Mobile Networks (IJWMN). Vol.
  4, No. 2, pp. 117-134, 2012",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Routing in wireless mesh networks (WMNs) has been an active area of research
for the last several years. In this paper, we address the problem of packet
routing for efficient data forwarding in wireless mesh networks (WMNs) with the
help of smart ants acting as intelligent agents. The aim of this paper is to
study the use of such biologically inspired agents to effectively route the
packets in WMNs. In particular, we propose AntMesh, a distributed
interference-aware data forwarding algorithm which enables the use of smart
ants to probabilistically and concurrently perform the routing and data
forwarding in order to stochastically solve a dynamic network routing problem.
AntMesh belongs to the class of routing algorithms inspired by the behaviour of
real ants which are known to find a shortest path between their nest and a food
source. In addition, AntMesh has the capability to effectively utilize the
space/channel diversity typically common in multi radio WMNs and to discover
high throughput paths with less inter-flow and intra-flow interference while
conventional wireless network routing protocols fail to do so. We implement our
smart ant-based routing algorithm in ns-2 and carry out extensive evaluation.
We demonstrate the stability of AntMesh in terms of how quickly it adapts
itself to the changing dynamics or load on the network. We tune the parameters
of AntMesh algorithm to study the effect on its performance in terms of the
routing load and end-to-end delay and have tested its performance under various
network scenarios particularly fixed nodes mesh networks and also on mobile WMN
scenarios. The results obtained show AntMesh's advantages that make it a
valuable candidate to operate in mesh networks.
","[{'version': 'v1', 'created': 'Tue, 4 Sep 2012 07:35:23 GMT'}]",2012-09-05,"[['Bokhari', 'Fawaz', ''], ['Zaruba', 'Gergely', '']]","['Wireless mesh networks', 'link interference', 'ant colony optimization', 'routing', 'meta-heuristic']"
19552,1105.3239,William Lorimer,William R. Lorimer,"Double Blind Comparisons: A New Approach to the Database Aggregation
  Problem",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Data Aggregation Problem occurs when a large collection of data takes on
a higher security level than any of its individual component records.
Traditional approaches of breaking up the data and restricting access on a
""need to know"" basis take away one of the great advantages of collecting the
data in the first place. This paper introduces a new cryptographic primitive,
Double Blind Comparisons, which allows two co-operating users, who each have an
encrypted secret, to determine the equality or inequality of those two secrets,
even though neither user can discover any information about what the secret is.
This paper also introduces a new problem in bilinear groups, conjectured to be
a hard problem. Assuming this conjecture, it is shown that neither user can
discover any information about whether the secrets are equal, without the other
user's co-operation. We then look at how Double Blind Comparisons can be used
to mitigate the Data Aggregation Problem. Finally, the paper concludes with
some suggested possibilities for future research and some other potential uses
for Double Blind Comparisons.
","[{'version': 'v1', 'created': 'Mon, 16 May 2011 22:41:22 GMT'}]",2011-05-18,"[['Lorimer', 'William R.', '']]","['Database aggregation', 'inference', 'private record linkage', 'privacy-preserving secure joins', 'Secure Multi-Party Computation']"
19553,1412.2863,Majid Janzamin,"Majid Janzamin, Hanie Sedghi, Anima Anandkumar","Score Function Features for Discriminative Learning: Matrix and Tensor
  Framework",29 pages,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Feature learning forms the cornerstone for tackling challenging learning
problems in domains such as speech, computer vision and natural language
processing. In this paper, we consider a novel class of matrix and
tensor-valued features, which can be pre-trained using unlabeled samples. We
present efficient algorithms for extracting discriminative information, given
these pre-trained features and labeled samples for any related task. Our class
of features are based on higher-order score functions, which capture local
variations in the probability density function of the input. We establish a
theoretical framework to characterize the nature of discriminative information
that can be extracted from score-function features, when used in conjunction
with labeled samples. We employ efficient spectral decomposition algorithms (on
matrices and tensors) for extracting discriminative components. The advantage
of employing tensor-valued features is that we can extract richer
discriminative information in the form of an overcomplete representations.
Thus, we present a novel framework for employing generative models of the input
for discriminative learning.
","[{'version': 'v1', 'created': 'Tue, 9 Dec 2014 06:22:19 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Dec 2014 19:12:31 GMT'}]",2014-12-12,"[['Janzamin', 'Majid', ''], ['Sedghi', 'Hanie', ''], ['Anandkumar', 'Anima', '']]","['Feature learning', 'pre-training', 'score function', 'spectral decomposition methods', 'tensor methods']"
19554,1002.2189,Rdv Ijcsis,"Foez Ahmed, Sateesh Kumar Pradhan, Nayeema Islam, Sumon Kumar Debnath",Performance Evaluation of TCP over Mobile Ad hoc Networks,"IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS January 2010, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 7, No. 1, pp. 140-146, January 2010, USA",,"Journal of Computer Science, ISSN 19475500",cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the proliferation of mobile computing devices, the demand for continuous
network connectivity regardless of physical location has spurred interest in
the use of mobile ad hoc networks. Since Transmission Control Protocol (TCP) is
the standard network protocol for communication in the internet, any wireless
network with Internet service need to be compatible with TCP. TCP is tuned to
perform well in traditional wired networks, where packet losses occur mostly
because of congestion. However, TCP connections in Ad-hoc mobile networks are
plagued by problems such as high bit error rates, frequent route changes,
multipath routing and temporary network partitions. The throughput of TCP over
such connection is not satisfactory, because TCP misinterprets the packet loss
or delay as congestion and invokes congestion control and avoidance algorithm.
In this research, the performance of TCP in Adhoc mobile network with high Bit
Error rate (BER) and mobility is studied and investigated. Simulation model is
implemented and experiments are performed using the Network Simulatior 2 (NS2).
","[{'version': 'v1', 'created': 'Wed, 10 Feb 2010 19:42:53 GMT'}]",2010-02-11,"[['Ahmed', 'Foez', ''], ['Pradhan', 'Sateesh Kumar', ''], ['Islam', 'Nayeema', ''], ['Debnath', 'Sumon Kumar', '']]","['Ad Hoc Network', 'TCP', 'High Bit Error Rate', 'Route re-computation']"
19555,1202.6562,Deyu Meng,"Deyu Meng, Yee Leung, Qian Zhao, Zongben Xu",Dictionary learning under global sparsity constraint,"27 pages, 9 figures, 1 table",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new method is proposed in this paper to learn overcomplete dictionary from
training data samples. Differing from the current methods that enforce similar
sparsity constraint on each of the input samples, the proposed method attempts
to impose global sparsity constraint on the entire data set. This enables the
proposed method to fittingly assign the atoms of the dictionary to represent
various samples and optimally adapt to the complicated structures underlying
the entire data set. By virtue of the sparse coding and sparse PCA techniques,
a simple algorithm is designed for the implementation of the method. The
efficiency and the convergence of the proposed algorithm are also theoretically
analyzed. Based on the experimental results implemented on a series of signal
and image data sets, it is apparent that our method performs better than the
current dictionary learning methods in original dictionary recovering, input
data reconstructing, and salient data structure revealing.
","[{'version': 'v1', 'created': 'Wed, 29 Feb 2012 14:56:57 GMT'}, {'version': 'v2', 'created': 'Sat, 11 May 2013 11:22:35 GMT'}]",2013-05-14,"[['Meng', 'Deyu', ''], ['Leung', 'Yee', ''], ['Zhao', 'Qian', ''], ['Xu', 'Zongben', '']]","['Dictionary learning', 'signal reconstruction', 'sparse principle']"
19556,1203.1006,Loet Leydesdorff,"Loet Leydesdorff, Daniele Rotolo, and Ismael Rafols","Bibliometric Perspectives on Medical Innovation using the Medical
  Subject Headings (MeSH) of PubMed","forthcoming in the Journal of the American Society for Information
  Science and Technology",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multiple perspectives on the nonlinear processes of medical innovations can
be distinguished and combined using the Medical Subject Headings (MeSH) of the
Medline database. Focusing on three main branches-""diseases,"" ""drugs and
chemicals,"" and ""techniques and equipment""-we use base maps and overlay
techniques to investigate the translations and interactions and thus to gain a
bibliometric perspective on the dynamics of medical innovations. To this end,
we first analyze the Medline database, the MeSH index tree, and the various
options for a static mapping from different perspectives and at different
levels of aggregation. Following a specific innovation (RNA interference) over
time, the notion of a trajectory which leaves a signature in the database is
elaborated. Can the detailed index terms describing the dynamics of research be
used to predict the diffusion dynamics of research results? Possibilities are
specified for further integration between the Medline database, on the one
hand, and the Science Citation Index and Scopus (containing citation
information), on the other.
","[{'version': 'v1', 'created': 'Mon, 5 Mar 2012 18:58:41 GMT'}, {'version': 'v2', 'created': 'Sat, 7 Apr 2012 12:58:48 GMT'}]",2012-04-10,"[['Leydesdorff', 'Loet', ''], ['Rotolo', 'Daniele', ''], ['Rafols', 'Ismael', '']]","['map', 'innovation', 'drugs', 'equipment', 'disease', 'PubMed', 'Medline']"
19557,1407.7399,Farshad Merrikh Bayat,F. Merrikh-Bayat,A Numerical Optimization Algorithm Inspired by the Strawberry Plant,,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a new numerical optimization algorithm inspired by the
strawberry plant for solving complicated engineering problems. Plants like
strawberry develop both runners and roots for propagation and search for water
resources and minerals. In these plants, runners and roots can be thought of as
tools for global and local searches, respectively. The proposed algorithm has
three main differences with the trivial nature-inspired optimization
algorithms: duplication-elimination of the computational agents at all
iterations, subjecting all agents to both small and large movements from the
beginning to end, and the lack of communication (information exchange) between
agents. Moreover, it has the advantage of using only three parameters to be
tuned by user. This algorithm is applied to standard test functions and the
results are compared with GA and PSO. The proposed algorithm is also used to
solve an open problem in the field of robust control theory. These simulations
show that the proposed algorithm can very effectively solve complicated
optimization problems.
","[{'version': 'v1', 'created': 'Mon, 28 Jul 2014 12:58:41 GMT'}]",2014-07-29,"[['Merrikh-Bayat', 'F.', '']]","['meta-heuristic optimization', 'nature inspired', 'numerical', 'strawberry', 'robust control']"
19558,1306.5160,Uwe Aickelin,"Galina Sherman, David Menachof, Peer-Olaf Siebers, Uwe Aickelin","Towards modelling cost and risks of infrequent events in the cargo
  screening process","UK OR Society Simulation Workshop 2010 (SW10), 23-24 March,
  Worcestershire, UK, 2010",,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a simulation model of the port of Calais with a focus on the
operation of immigration controls. Our aim is to compare the cost and benefits
of different screening policies. Methodologically, we are trying to understand
the limits of discrete event simulation of rare events. When will they become
'too rare' for simulation to give meaningful results?
","[{'version': 'v1', 'created': 'Fri, 21 Jun 2013 14:49:29 GMT'}]",2013-06-24,"[['Sherman', 'Galina', ''], ['Menachof', 'David', ''], ['Siebers', 'Peer-Olaf', ''], ['Aickelin', 'Uwe', '']]","['modelling and simulation', 'cost benefit analysis (CBA)', 'cargo screening']"
19559,1004.3504,Arpita Patra,Arpita Patra and C. Pandu Rangan,Communication and Round Efficient Information Checking Protocol,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a very important primitive called Information
Checking Protocol (ICP) which plays an important role in constructing
statistical Verifiable Secret Sharing (VSS) and Weak Secret Sharing (WSS)
protocols. Informally, ICP is a tool for authenticating messages in the
presence of computationally unbounded corrupted parties. Here we extend the
basic bare-bone definition of ICP, introduced by Rabin et al. and then present
an ICP that attains the best communication complexity and round complexity
among all the existing ICPs in the literature. We also show that our ICP
satisfies several interesting properties such as linearity property which is an
important requirement in many applications of ICP. Though not presented in this
paper, we can design communication and round efficient statistical (i.e
involves negligible error probability in computation) VSS and Multiparty
Computation (MPC) protocol using our new ICP.
","[{'version': 'v1', 'created': 'Tue, 20 Apr 2010 17:00:03 GMT'}]",2015-03-14,"[['Patra', 'Arpita', ''], ['Rangan', 'C. Pandu', '']]","['ICP', 'Information Theoretic Security', 'Statistical', 'Error Probability']"
19560,1708.00812,Minkyu Choi,Minkyu Choi and Jun Tani,"Predictive Coding for Dynamic Visual Processing: Development of
  Functional Hierarchy in a Multiple Spatio-Temporal Scales RNN Model",Accepted in Neural Computation (MIT press),,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The current paper proposes a novel predictive coding type neural network
model, the predictive multiple spatio-temporal scales recurrent neural network
(P-MSTRNN). The P-MSTRNN learns to predict visually perceived human whole-body
cyclic movement patterns by exploiting multiscale spatio-temporal constraints
imposed on network dynamics by using differently sized receptive fields as well
as different time constant values for each layer. After learning, the network
becomes able to proactively imitate target movement patterns by inferring or
recognizing corresponding intentions by means of the regression of prediction
error. Results show that the network can develop a functional hierarchy by
developing a different type of dynamic structure at each layer. The paper
examines how model performance during pattern generation as well as predictive
imitation varies depending on the stage of learning. The number of limit cycle
attractors corresponding to target movement patterns increases as learning
proceeds. And, transient dynamics developing early in the learning process
successfully perform pattern generation and predictive imitation tasks. The
paper concludes that exploitation of transient dynamics facilitates successful
task performance during early learning periods.
","[{'version': 'v1', 'created': 'Wed, 2 Aug 2017 16:17:32 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Sep 2017 04:04:04 GMT'}]",2017-09-07,"[['Choi', 'Minkyu', ''], ['Tani', 'Jun', '']]","['Machine-learning', 'Predictive-coding', 'Deep-learning']"
19561,1610.02237,Hilde Kuehne,"Hilde Kuehne, Alexander Richard, Juergen Gall",Weakly supervised learning of actions from transcripts,"33 pages, 9 figures, to appear in CVIU",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an approach for weakly supervised learning of human actions from
video transcriptions. Our system is based on the idea that, given a sequence of
input data and a transcript, i.e. a list of the order the actions occur in the
video, it is possible to infer the actions within the video stream, and thus,
learn the related action models without the need for any frame-based
annotation. Starting from the transcript information at hand, we split the
given data sequences uniformly based on the number of expected actions. We then
learn action models for each class by maximizing the probability that the
training video sequences are generated by the action models given the sequence
order as defined by the transcripts. The learned model can be used to
temporally segment an unseen video with or without transcript. We evaluate our
approach on four distinct activity datasets, namely Hollywood Extended, MPII
Cooking, Breakfast and CRIM13. We show that our system is able to align the
scripted actions with the video data and that the learned models localize and
classify actions competitively in comparison to models trained with full
supervision, i.e. with frame level annotations, and that they outperform any
current state-of-the-art approach for aligning transcripts with video data.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2016 12:00:08 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Jun 2017 09:25:13 GMT'}]",2017-06-20,"[['Kuehne', 'Hilde', ''], ['Richard', 'Alexander', ''], ['Gall', 'Juergen', '']]","['Weak learning', 'Action recognition', 'Action classification', 'Temporal']"
19562,1004.1257,Rdv Ijcsis,"V.Chitraa, Dr. Antony Selvdoss Davamani",A Survey on Preprocessing Methods for Web Usage Data,"IEEE Publication format, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","IJCSIS, Vol. 7 No. 3, March 2010",,,cs.IR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  World Wide Web is a huge repository of web pages and links. It provides
abundance of information for the Internet users. The growth of web is
tremendous as approximately one million pages are added daily. Users' accesses
are recorded in web logs. Because of the tremendous usage of web, the web log
files are growing at a faster rate and the size is becoming huge. Web data
mining is the application of data mining techniques in web data. Web Usage
Mining applies mining techniques in log data to extract the behavior of users
which is used in various applications like personalized services, adaptive web
sites, customer profiling, prefetching, creating attractive web sites etc., Web
usage mining consists of three phases preprocessing, pattern discovery and
pattern analysis. Web log data is usually noisy and ambiguous and preprocessing
is an important process before mining. For discovering patterns sessions are to
be constructed efficiently. This paper reviews existing work done in the
preprocessing stage. A brief overview of various data mining techniques for
discovering patterns, and pattern analysis are discussed. Finally a glimpse of
various applications of web usage mining is also presented.
","[{'version': 'v1', 'created': 'Thu, 8 Apr 2010 07:07:16 GMT'}]",2010-04-09,"[['Chitraa', 'V.', ''], ['Davamani', 'Dr. Antony Selvdoss', '']]","['Data Cleaning', 'Path Completion', 'Session Identification', 'User Identification', 'Web Log Mining']"
19563,0905.2297,Rajesh Ramachandran,R Rajesh and Vinod Sharma,"On Optimal Distributed Joint Source-Channel Coding for Correlated
  Gaussian Sources over Gaussian Channels","24 pages, 9 figures submitted to IEEE Trans Wireless commn",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of distributed joint source-channel coding of
correlated Gaussian sources over a Gaussian Multiple Access Channel (GMAC).
There may be side information at the decoder and/or at the encoders. First we
specialize a general result (for transmission of correlated sources over a MAC
with side information) to obtain sufficient conditions for reliable
transmission over a Gaussian MAC. This system does not satisfy the
source-channel separation. We study and compare three joint source-channel
coding schemes available in literature. We show that each of these schemes is
optimal under different scenarios. One of the schemes, Amplify and Forward (AF)
which simplifies the design of encoders and the decoder, is optimal at low SNR
but not at high SNR. Another scheme is asymptotically optimal at high SNR. The
third coding scheme is optimal for orthogonal Gaussian channels. We also show
that AF is close to the optimal scheme for orthogonal channels even at high
SNR.
","[{'version': 'v1', 'created': 'Thu, 14 May 2009 10:02:47 GMT'}]",2009-05-15,"[['Rajesh', 'R', ''], ['Sharma', 'Vinod', '']]","['Gaussian multiple access channel', 'side information', 'separation-based transmission', 'amplify and']"
19564,1603.08103,Wenbin Li,Gang Ren and Wenbin Li and Eamonn O'Neill,"Towards the Design of Effective Freehand Gestural Interaction for
  Interactive TV","Preprint version of our paper accepted by Journal of Intelligent and
  Fuzzy Systems",,,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  As interactive devices become pervasive, people are beginning to looking for
more advanced interaction with televisions in the living room. Interactive
television has the potential to offer a very engaging experience. But most
common user tasks are still challenging with such systems, such as menu
selection or text input. And little work has been done on understanding and
sup-porting the effective design of freehand interaction with an TV in the
living room. In this paper, we perform two studies investi-gating freehand
gestural interaction with a consumer level sensor, which is suitable for TV
scenarios. In the first study, we inves-tigate a range of design factors for
tiled layout menu selection, including wearable feedback, push gesture depth,
target size and position in motor space. The results show that tactile and
audio feedback have no significant effect on performance and prefer-ence, and
these results inform potential designs for high selection performance. In the
second study, we investigate a common TV user task of text input using freehand
gesture. We design and evaluate two virtual keyboard layouts and three freehand
selec-tion methods. Results show that ease of use and error tolerance can be
both achieved using a text entry method utilizing a dual circle layout and an
expanding target selection technique. Finally, we propose design guidelines for
effective, usable and com-fortable freehand gestural interaction for
interactive TV based on the findings.
","[{'version': 'v1', 'created': 'Sat, 26 Mar 2016 12:59:07 GMT'}]",2016-03-29,"[['Ren', 'Gang', ''], ['Li', 'Wenbin', ''], [""O'Neill"", 'Eamonn', '']]","['Freehand gesture selection', 'Wearable feedback', 'Tile layout']"
19565,1802.09594,Ali Karami,"Nasrin Mazaheri Soudani, Ali Karami",All nearest neighbor calculation based on Delaunay graphs,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When we have two data sets and want to find the nearest neighbour of each
point in the first dataset among points in the second one, we need the all
nearest neighbour operator. This is an operator in spatial databases that has
many application in different fields such as GIS and VLSI circuit design.
Existing algorithms for calculating this operator assume that there is no pre
computation on these data sets. These algorithms has o(n*m*d) time complexity
where n and m are the number of points in two data sets and d is the dimension
of data points. With assumption of some pre computation on data sets algorithms
with lower time complexity can be obtained. One of the most common pre
computation on spatial data is Delaunay graphs. In the Delaunay graph of a data
set each point is linked to its nearest neighbours. In this paper, we introduce
an algorithm for computing the all nearest neighbour operator on spatial data
sets based on their Delaunay graphs. The performance of this algorithm is
compared with one of the best existing algorithms for computing ANN operator in
terms of CPU time and the number of IOs. The experimental results show that
this algorithm has better performance than the other.
","[{'version': 'v1', 'created': 'Mon, 26 Feb 2018 20:32:05 GMT'}]",2018-02-28,"[['Soudani', 'Nasrin Mazaheri', ''], ['Karami', 'Ali', '']]","['all nearest neighbour', 'nearest neighbour join', 'delaunay graph', 'multidimensional data']"
19566,1704.02676,Ian Manchester,Ian R. Manchester and Jean-Jacques E. Slotine,"On Existence of Separable Contraction Metrics for Monotone Nonlinear
  Systems",Accepted to IFAC World Congress 2017,,,,cs.SY math.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finding separable certificates of stability is important for tractability of
analysis methods for large-scale networked systems. In this paper we consider
the question of when a nonlinear system which is contracting, i.e. all
solutions are exponentially stable, can have that property verified by a
separable metric. Making use of recent results in the theory of positive linear
systems and separable Lyapunov functions, we prove several new results showing
when this is possible, and discuss the application of to nonlinear distributed
control design via convex optimization.
","[{'version': 'v1', 'created': 'Mon, 10 Apr 2017 00:36:21 GMT'}]",2017-04-11,"[['Manchester', 'Ian R.', ''], ['Slotine', 'Jean-Jacques E.', '']]","['Distributed control', 'Nonlinear systems', 'Convex optimization']"
19567,1603.03149,Prashant Sharma Mr.,"Prashant Sharma, Shaju K. Albert, S. Rajeswari","Real time error detection in metal arc welding process using Artificial
  Neural Netwroks",,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Quality assurance in production line demands reliable weld joints. Human made
errors is a major cause of faulty production. Promptly Identifying errors in
the weld while welding is in progress will decrease the post inspection cost
spent on the welding process. Electrical parameters generated during welding,
could able to characterize the process efficiently. Parameter values are
collected using high speed data acquisition system. Time series analysis tasks
such as filtering, pattern recognition etc. are performed over the collected
data. Filtering removes the unwanted noisy signal components and pattern
recognition task segregate error patterns in the time series based upon
similarity, which is performed by Self Organized mapping clustering algorithm.
Welder quality is thus compared by detecting and counting number of error
patterns appeared in his parametric time series. Moreover, Self Organized
mapping algorithm provides the database in which patterns are segregated into
two classes either desirable or undesirable. Database thus generated is used to
train the classification algorithms, and thereby automating the real time error
detection task. Multi Layer Perceptron and Radial basis function are the two
classification algorithms used, and their performance has been compared based
on metrics such as specificity, sensitivity, accuracy and time required in
training.
","[{'version': 'v1', 'created': 'Thu, 10 Mar 2016 05:00:26 GMT'}]",2016-03-11,"[['Sharma', 'Prashant', ''], ['Albert', 'Shaju K.', ''], ['Rajeswari', 'S.', '']]","['Manual Metal Arc welding Process', 'Neural networks', 'Self Organized Mapping', 'Multi Layer Perceptron', 'Radial Basis Functions']"
19568,1403.6918,Mayanka Katyal Miss,Mayanka Katyal and Atul Mishra,"A Comparative Study of Load Balancing Algorithms in Cloud Computing
  Environment","14 pages,International Journal of Distributed and Cloud
  Computing,PublishingIndia.com,
  http://www.publishingindia.com/IJDCC/68/a-comparative-study-of-load-balancing-algorithms-in-cloud-computing-environment/277/2041/","International Journal of Distributed and Cloud Computing, Volume 1
  Issue 2 December 2013",,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud Computing is a new trend emerging in IT environment with huge
requirements of infrastructure and resources. Load Balancing is an important
aspect of cloud computing environment. Efficient load balancing scheme ensures
efficient resource utilization by provisioning of resources to cloud users on
demand basis in pay as you say manner. Load Balancing may even support
prioritizing users by applying appropriate scheduling criteria. This paper
presents various load balancing schemes in different cloud environment based on
requirements specified in Service Level Agreement (SLA).
","[{'version': 'v1', 'created': 'Thu, 27 Mar 2014 05:07:28 GMT'}]",2014-03-28,"[['Katyal', 'Mayanka', ''], ['Mishra', 'Atul', '']]","['Cloud Computing', 'Load Balancing', 'Resource Provisioning', 'Resource Scheduling', 'Service Level Agreement (SLA)']"
19569,1705.08275,J Federico Medrano,J. Federico Medrano,"Calidad en repositorios digitales en Argentina, estudio comparativo y
  cualitativo","BIREDIAL-ISTEC 2017, in Spanish",,,,cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Numerous institutions and organizations need not only to preserve the
material and publications they produce, but also have as their task (although
it would be desirable it was an obligation) to publish, disseminate and make
publicly available all the results of the research and any other
scientific/academic material. The Open Archives Initiative (OAI) and the
introduction of Open Archives Initiative Protocol for Metadata Harvesting
(OAI-PMH), make this task much easier. The main objective of this work is to
make a comparative and qualitative study of the data -metadata specifically-
contained in the whole set of Argentine repositories listed in the ROAR portal,
focusing on the functional perspective of the quality of this metadata. Another
objective is to offer an overview of the status of these repositories, in an
attempt to detect common failures and errors institutions incur when storing
the metadata of the resources contained in these repositories, and thus be able
to suggest measures to be able to improve the load and further retrieval
processes. It was found that the eight most used Dublin Core fields are:
identifier, type, title, date, subject, creator, language and description. Not
all repositories fill all the fields, and the lack of normalization, or the
excessive use of fields like language, type, format and subject is somewhat
striking, and in some cases even alarming
","[{'version': 'v1', 'created': 'Tue, 23 May 2017 14:00:24 GMT'}]",2017-05-24,"[['Medrano', 'J. Federico', '']]","['Digital repositories', 'Open Access', 'OAI-PMH', 'Metadata', 'Harvesting', 'Metadata Quality', 'Metadata standardization']"
19570,1110.5832,Ringo Baumann,Ringo Baumann and Heinrich Herre,The Axiomatic Foundation of Space in GFO,"36 pages, 18 figures, submitted to ""Applied Ontology""",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Space and time are basic categories of any top-level ontology. They are
fundamental assumptions for the mode of existence of those individuals which
are said to be in space and time. In the present paper the ontology of space in
the General Formal Ontology (GFO) is expounded. This ontology is represented as
a theory BT (Brentano Theory), which is specified by a set of axioms formalized
in first-order logic. This theory uses four primitive relations: SReg(x) (x is
space region), spart(x, y) (x is spatial part of y), sb(x, y) (x is spatial
boundary of y), and scoinc(x, y) (x and y spatially coincide). This ontology is
inspired by ideas of Franz Brentano. The investigation and exploration of Franz
Brentano's ideas on space and time began about twenty years ago by work of R.M.
Chisholm, B. Smith and A. Varzi. The present paper takes up this line of
research and makes a further step in establishing an ontology of space which is
based on rigorous logical methods and on principles of the new philosophical
approach of integrative realism.
","[{'version': 'v1', 'created': 'Fri, 23 Sep 2011 07:22:16 GMT'}]",2011-10-27,"[['Baumann', 'Ringo', ''], ['Herre', 'Heinrich', '']]","['space', 'top-level ontology', 'axiomatic method']"
19571,1301.0179,Doreswamy,"Doreswamy, K. S. Hemanth","A Novel Design Specification Distance(DSD) Based K-Mean Clustering
  Performace Evluation on Engineering Materials Database","International Journal of Computer Applications Vol.55(15), pp.26-33,
  October 2012. Published by Foundation of Computer Science, New York, USA",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Organizing data into semantically more meaningful is one of the fundamental
modes of understanding and learning. Cluster analysis is a formal study of
methods for understanding and algorithm for learning. K-mean clustering
algorithm is one of the most fundamental and simple clustering algorithms. When
there is no prior knowledge about the distribution of data sets, K-mean is the
first choice for clustering with an initial number of clusters. In this paper a
novel distance metric called Design Specification (DS) distance measure
function is integrated with K-mean clustering algorithm to improve cluster
accuracy. The K-means algorithm with proposed distance measure maximizes the
cluster accuracy to 99.98% at P = 1.525, which is determined through the
iterative procedure. The performance of Design Specification (DS) distance
measure function with K - mean algorithm is compared with the performances of
other standard distance functions such as Euclidian, squared Euclidean, City
Block, and Chebshew similarity measures deployed with K-mean algorithm.The
proposed method is evaluated on the engineering materials database. The
experiments on cluster analysis and the outlier profiling show that these is an
excellent improvement in the performance of the proposed method.
","[{'version': 'v1', 'created': 'Wed, 2 Jan 2013 07:13:19 GMT'}]",2013-01-03,"[['Doreswamy', '', ''], ['Hemanth', 'K. S.', '']]","['K-means clustering', 'engineering materials dataset', 'Knowledge discovery system', 'novel Design Specification (DS) distance measure']"
19572,1606.03229,Manuel Mazzara,"Michael W. Bridges, Salvatore Distefano, Manuel Mazzara, Marat
  Minlebaev, Max Talanov, Jordi Vallverd\'u",Towards Anthropo-inspired Computational Systems: the $P^3$ Model,,"In proceedings of the 9th International KES Conference on AGENTS
  AND MULTI-AGENT SYSTEMS: TECHNOLOGIES AND APPLICATIONS, 2015",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a model which aim is providing a more coherent framework
for agents design. We identify three closely related anthropo-centered domains
working on separate functional levels. Abstracting from human physiology,
psychology, and philosophy we create the $P^3$ model to be used as a multi-tier
approach to deal with complex class of problems. The three layers identified in
this model have been named PhysioComputing, MindComputing, and MetaComputing.
Several instantiations of this model are finally presented related to different
IT areas such as artificial intelligence, distributed computing, software and
service engineering.
","[{'version': 'v1', 'created': 'Fri, 10 Jun 2016 08:39:22 GMT'}]",2016-06-13,"[['Bridges', 'Michael W.', ''], ['Distefano', 'Salvatore', ''], ['Mazzara', 'Manuel', ''], ['Minlebaev', 'Marat', ''], ['Talanov', 'Max', ''], ['Vallverdú', 'Jordi', '']]","['Physiology', 'Psychology', 'Philosophy', 'Neuroscience', 'Layered Model']"
19573,1510.04390,Manolis Tsakiris,Manolis C. Tsakiris and Rene Vidal,Dual Principal Component Pursuit,fixed two typos in section 7.3,Journal of Machine Learning Research 19 (2018) 1-49,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of learning a linear subspace from data corrupted by
outliers. Classical approaches are typically designed for the case in which the
subspace dimension is small relative to the ambient dimension. Our approach
works with a dual representation of the subspace and hence aims to find its
orthogonal complement; as such, it is particularly suitable for subspaces whose
dimension is close to the ambient dimension (subspaces of high relative
dimension). We pose the problem of computing normal vectors to the inlier
subspace as a non-convex $\ell_1$ minimization problem on the sphere, which we
call Dual Principal Component Pursuit (DPCP) problem. We provide theoretical
guarantees under which every global solution to DPCP is a vector in the
orthogonal complement of the inlier subspace. Moreover, we relax the non-convex
DPCP problem to a recursion of linear programs whose solutions are shown to
converge in a finite number of steps to a vector orthogonal to the subspace. In
particular, when the inlier subspace is a hyperplane, the solutions to the
recursion of linear programs converge to the global minimum of the non-convex
DPCP problem in a finite number of steps. We also propose algorithms based on
alternating minimization and iteratively re-weighted least squares, which are
suitable for dealing with large-scale data. Experiments on synthetic data show
that the proposed methods are able to handle more outliers and higher relative
dimensions than current state-of-the-art methods, while experiments in the
context of the three-view geometry problem in computer vision suggest that the
proposed methods can be a useful or even superior alternative to traditional
RANSAC-based approaches for computer vision and other applications.
","[{'version': 'v1', 'created': 'Thu, 15 Oct 2015 03:50:01 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Jun 2017 21:42:05 GMT'}, {'version': 'v3', 'created': 'Sat, 22 Jul 2017 16:24:27 GMT'}, {'version': 'v4', 'created': 'Sat, 4 Aug 2018 18:53:49 GMT'}, {'version': 'v5', 'created': 'Thu, 7 Nov 2019 11:11:23 GMT'}]",2019-11-11,"[['Tsakiris', 'Manolis C.', ''], ['Vidal', 'Rene', '']]","['Outliers', 'Robust Principal Component Analysis', 'High Relative Dimension', 'ℓ1 Minimization', 'Non-Convex Optimization', 'Linear Programming', 'Trifocal Tensor']"
19574,1606.07735,Claude Samson,Tarek Hamel and Claude Samson,"Riccati observers for position and velocity bias estimation from either
  direction or range measurements",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper revisits the problems of estimating the position of an object
moving in $n$ ($\geq 2$)-dimensional Euclidean space using velocity
measurements and either direction or range measurements of one or multiple
source points. The proposed solutions exploit the Continuous Riccati Equation
(CRE) to calculate observer gains yielding global exponential stability of zero
estimation errors, even in the case where the measured velocity is biased by an
unknown constant perturbation. These results are obtained under persistent
excitation (p.e.) conditions depending on the number of source points and body
motion that ensure both uniform observability and good conditioning of the CRE
solutions. With respect to prior contributions on these subjects some of the
proposed solutions are entirely novel while others are adapted from existing
ones with the preoccupation of stating simpler and more explicit conditions
under which uniform exponential stability is achieved. A complementary
contribution, related to the delicate tuning of the observers gains, is the
derivation of a lower-bound of the exponential rate of convergence specified as
a function of the amount of persistent excitation. Simulation results
illustrate the performance of the proposed observers.
","[{'version': 'v1', 'created': 'Fri, 24 Jun 2016 15:58:59 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Jul 2016 13:31:22 GMT'}]",2016-07-28,"[['Hamel', 'Tarek', ''], ['Samson', 'Claude', '']]","['position estimation', 'Riccati observers', 'lineartime-varying systems', 'persistent excitation', 'observability']"
19575,1207.6732,Tomasz Jurdzinski,"Tomasz Jurdzinski and Dariusz R.Kowalski and Tomasz Maciejewski and
  Grzegorz Stachowiak",Distributed Broadcasting in Wireless Networks under the SINR Model,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the advent of large-scale multi-hop wireless technologies, such as MANET,
VANET, iThings, it is of utmost importance to devise efficient distributed
protocols to maintain network architecture and provide basic communication
tools. One of such fundamental communication tasks is broadcast, also known as
a 1-to-all communication. We propose several new efficient distributed
algorithms and evaluate their time performance both theoretically and by
simulations. First randomized algorithm accomplishes broadcast in O(D+log(1/d))
rounds with probability at least 1-d on any uniform-power network of n nodes
and diameter D, when equipped with local estimate of network density.
Additionally, we evaluate average performance of this protocols by simulations
on two classes of generated networks - uniform and social - and compare the
results with performance of exponential backoff heuristic. Ours is the first
provably efficient and well-scalable distributed solution for the (global)
broadcast task. The second randomized protocol developed in this paper does not
rely on the estimate of local density, and achieves only slightly higher time
performance O((D+log(1/d))log n). Finally, we provide a deterministic algorithm
achieving similar time O(D log^2 n), supported by theoretical analysis.
","[{'version': 'v1', 'created': 'Sat, 28 Jul 2012 21:21:21 GMT'}, {'version': 'v2', 'created': 'Sun, 17 Feb 2013 11:36:26 GMT'}]",2013-02-19,"[['Jurdzinski', 'Tomasz', ''], ['Kowalski', 'Dariusz R.', ''], ['Maciejewski', 'Tomasz', ''], ['Stachowiak', 'Grzegorz', '']]","['Ad Hoc wireless networks', 'Signal-to-Interference-and-Noise-Ratio (SINR) model', 'Broadcast', 'Distributed algorithms']"
19576,1106.5465,Ilango Sriram,"Ilango Leonardo Sriram, Dave Cliff","SPECI-2: An open-source framework for predictive simulation of
  cloud-scale data-centres","To appear in Proceedings of SIMULTECH 2011, see also speci.org",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce Version 2 of SPECI, a system for predictive simulation modeling
of large-scale data-centres, i.e. warehouse-sized facilities containing
hundreds of thousands of servers, as used to provide cloud services.
","[{'version': 'v1', 'created': 'Mon, 27 Jun 2011 18:01:03 GMT'}]",2011-06-28,"[['Sriram', 'Ilango Leonardo', ''], ['Cliff', 'Dave', '']]","['Data Centre', 'Cloud Computing', 'Middleware', 'Normal Failure', 'Discrete Event Simulation']"
19577,1610.06703,Marcelo Mendoza Mr.,Marcelo Mendoza and Mat\'ias Estrada,Revisiting Link Prediction: Evolving Models and Real Data Findings,"17 pages, 2 figures. arXiv admin note: text overlap with
  arXiv:1408.2871",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The explosive growth of Web 2.0, which was characterized by the creation of
online social networks, has reignited the study of factors that could help us
understand the growth and dynamism of these networks. Various generative
network models have been proposed, including the Barabasi-Albert and
Watts-Strogatz models. In this study, we revisit the problem from a perspective
that seeks to compare results obtained from these generative models with those
from real networks. To this end, we consider the dating network Skout Inc. An
analysis is performed on the topological characteristics of the network that
could explain the creation of new network links. Afterwards, the results are
contrasted with those obtained from the Barabasi-Albert and Watts-Strogatz
generative models. We conclude that a key factor that could explain the
creation of links originates in its cluster structure, where link
recommendations are more precise in Watts-Strogatz segmented networks than in
Barabasi-Albert hierarchical networks. This result reinforces the need to
establish more and better network segmentation algorithms that are capable of
clustering large networks precisely and efficiently.
","[{'version': 'v1', 'created': 'Fri, 21 Oct 2016 08:47:38 GMT'}]",2016-10-24,"[['Mendoza', 'Marcelo', ''], ['Estrada', 'Matías', '']]","['Link Prediction', 'Network Evolving Models', 'Discrete Dynamics in']"
19578,1705.05472,Roger Moore,"Roger K. Moore, Ben Mitchinson",A Biomimetic Vocalisation System for MiRo,"12 pages; accepted for publication at Living Machines 2017, Stanford,
  USA; 25-28 July 2017; http://livingmachinesconference.eu/2017/",,,,cs.SD cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is increasing interest in the use of animal-like robots in applications
such as companionship and pet therapy. However, in the majority of cases it is
only the robot's physical appearance that mimics a given animal. In contrast,
MiRo is the first commercial biomimetic robot to be based on a hardware and
software architecture that is modelled on the biological brain. This paper
describes how MiRo's vocalisation system was designed, not using pre-recorded
animal sounds, but based on the implementation of a real-time parametric
general-purpose mammalian vocal synthesiser tailored to the specific physical
characteristics of the robot. The novel outcome has been the creation of an
'appropriate' voice for MiRo that is perfectly aligned to the physical and
behavioural affordances of the robot, thereby avoiding the 'uncanny valley'
effect and contributing strongly to the effectiveness of MiRo as an interactive
device.
","[{'version': 'v1', 'created': 'Mon, 15 May 2017 22:20:22 GMT'}]",2017-05-17,"[['Moore', 'Roger K.', ''], ['Mitchinson', 'Ben', '']]","['biomimetic robot', 'MiRo', 'mammalian vocalisation', 'vocalsynthesis']"
19579,1002.3449,Bike Xie,"Bike Xie, Mihaela van der Schaar, Richard D. Wesel","Minimizing weighted sum download time for one-to-many file transfer in
  peer-to-peer networks","67 pages, 21 figures",,,,cs.IT cs.NI math.IT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the problem of transferring a file from one source node
to multiple receivers in a peer-to-peer (P2P) network. The objective is to
minimize the weighted sum download time (WSDT) for the one-to-many file
transfer. Previous work has shown that, given an order at which the receivers
finish downloading, the minimum WSD can be solved in polynomial time by convex
optimization, and can be achieved by linear network coding, assuming that node
uplinks are the only bottleneck in the network. This paper, however, considers
heterogeneous peers with both uplink and downlink bandwidth constraints
specified. The static scenario is a file-transfer scheme in which the network
resource allocation remains static until all receivers finish downloading. This
paper first shows that the static scenario may be optimized in polynomial time
by convex optimization, and the associated optimal static WSD can be achieved
by linear network coding. This paper then presented a lower bound to the
minimum WSDT that is easily computed and turns out to be tight across a wide
range of parameterizations of the problem. This paper also proposes a static
routing-based scheme and a static rateless-coding-based scheme which have
almost-optimal empirical performances. The dynamic scenario is a file-transfer
scheme which can re-allocate the network resource during the file transfer.
This paper proposes a dynamic rateless-coding-based scheme, which provides
significantly smaller WSDT than the optimal static scenario does.
","[{'version': 'v1', 'created': 'Thu, 18 Feb 2010 08:08:50 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Jul 2011 08:58:48 GMT'}]",2011-07-07,"[['Xie', 'Bike', ''], ['van der Schaar', 'Mihaela', ''], ['Wesel', 'Richard D.', '']]","['P2P network', 'network coding', 'rateless code', 'routing', 'extended mutualcast']"
19580,0906.1182,Paolo Mancarella,"P. Mancarella, G. Terreni, F. Sadri, F. Toni, U. Endriss","The CIFF Proof Procedure for Abductive Logic Programming with
  Constraints: Theory, Implementation and Experiments",,,,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the CIFF proof procedure for abductive logic programming with
constraints, and we prove its correctness. CIFF is an extension of the IFF
proof procedure for abductive logic programming, relaxing the original
restrictions over variable quantification (allowedness conditions) and
incorporating a constraint solver to deal with numerical constraints as in
constraint logic programming. Finally, we describe the CIFF system, comparing
it with state of the art abductive systems and answer set solvers and showing
how to use it to program some applications. (To appear in Theory and Practice
of Logic Programming - TPLP).
","[{'version': 'v1', 'created': 'Fri, 5 Jun 2009 16:13:23 GMT'}]",2009-06-08,"[['Mancarella', 'P.', ''], ['Terreni', 'G.', ''], ['Sadri', 'F.', ''], ['Toni', 'F.', ''], ['Endriss', 'U.', '']]","['Abduction', 'Constraints', 'Proof procedures']"
19581,1306.2935,Andrew Adamatzky,Andrew Adamatzky,Slimy hairs: Hair sensors made with slime mould,,,,,cs.ET physics.bio-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Slime mould Physarum polycephalum is a large single cell visible by unaided
eye. We design a slime mould implementation of a tactile hair, where the slime
mould responds to repeated deflection of hair by an immediate high-amplitude
spike and a prolonged increase in amplitude and width of its oscillation
impulses. We demonstrate that signal-to-noise ratio of the Physarum tactile
hair sensor averages near six for the immediate response and two for the
prolonged response.
","[{'version': 'v1', 'created': 'Wed, 12 Jun 2013 19:52:01 GMT'}]",2013-06-13,"[['Adamatzky', 'Andrew', '']]","['slime mould', 'bionic', 'bioengineering', 'sensor']"
19582,0909.0206,Somantika Datta,"Somantika Datta, Stephen Howard, Douglas Cochran",Geometry of the Welch Bounds,"changes from previous version include: correction of typos,
  additional references added, new Example 3.3",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A geometric perspective involving Grammian and frame operators is used to
derive the entire family of Welch bounds. This perspective unifies a number of
observations that have been made regarding tightness of the bounds and their
connections to symmetric k-tensors, tight frames, homogeneous polynomials, and
t-designs. In particular. a connection has been drawn between sampling of
homogeneous polynomials and frames of symmetric k-tensors. It is also shown
that tightness of the bounds requires tight frames. The lack of tight frames in
symmetric k-tensors in many cases, however, leads to consideration of sets that
come as close as possible to attaining the bounds. The geometric derivation is
then extended in the setting of generalized or continuous frames. The Welch
bounds for finite sets and countably infinite sets become special cases of this
general setting.
","[{'version': 'v1', 'created': 'Tue, 1 Sep 2009 15:30:31 GMT'}, {'version': 'v2', 'created': 'Wed, 30 May 2012 01:13:11 GMT'}]",2012-05-31,"[['Datta', 'Somantika', ''], ['Howard', 'Stephen', ''], ['Cochran', 'Douglas', '']]","['Frames', 'Grammian', 'Homogeneous polynomials', 'Symmetric ten']"
19583,1407.1120,Mehrtash Harandi,Mehrtash T. Harandi and Mathieu Salzmann and Richard Hartley,"From Manifold to Manifold: Geometry-Aware Dimensionality Reduction for
  SPD Matrices",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Representing images and videos with Symmetric Positive Definite (SPD)
matrices and considering the Riemannian geometry of the resulting space has
proven beneficial for many recognition tasks. Unfortunately, computation on the
Riemannian manifold of SPD matrices --especially of high-dimensional ones--
comes at a high cost that limits the applicability of existing techniques. In
this paper we introduce an approach that lets us handle high-dimensional SPD
matrices by constructing a lower-dimensional, more discriminative SPD manifold.
To this end, we model the mapping from the high-dimensional SPD manifold to the
low-dimensional one with an orthonormal projection. In particular, we search
for a projection that yields a low-dimensional manifold with maximum
discriminative power encoded via an affinity-weighted similarity measure based
on metrics on the manifold. Learning can then be expressed as an optimization
problem on a Grassmann manifold. Our evaluation on several classification tasks
shows that our approach leads to a significant accuracy gain over
state-of-the-art methods.
","[{'version': 'v1', 'created': 'Fri, 4 Jul 2014 05:10:43 GMT'}, {'version': 'v2', 'created': 'Mon, 17 Nov 2014 00:01:38 GMT'}]",2014-11-18,"[['Harandi', 'Mehrtash T.', ''], ['Salzmann', 'Mathieu', ''], ['Hartley', 'Richard', '']]","['Riemannian geometry', 'SPD manifold', 'Grassmann manifold', 'dimensionality reduction', 'visual recognition']"
19584,1511.03897,Tarcisio Mendes de Farias,"Tarcisio Mendes de Farias (Le2i), Ana Roxin (Le2i), Christophe Nicolle
  (Le2i)","IfcWoD, Semantically Adapting IFC Model Relations into OWL Properties","In proceedings of the 32nd CIB W78 Conference on Information
  Technology in Construction, Oct 2015, Eindhoven, Netherlands",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the context of Building Information Modelling, ontologies have been
identified as interesting in achieving information interoperability. Regarding
the construction and facility management domains, several IFC (Industry
Foundation Classes) based ontologies have been developed, such as IfcOWL. In
the context of ontology modelling, the constraint of optimizing the size of IFC
STEP-based files can be leveraged. In this paper, we propose an adaptation of
the IFC model into OWL which leverages from all modelling constraints required
by the object-oriented structure of IFC schema. Therefore, we do not only
present a syntactic but also a semantic adaptation of the IFC model. Our model
takes into consideration the meaning of entities, relationships, properties and
attributes defined by the IFC standard. Our approach presents several
advantages compared to other initiatives such as the optimization of query
execution time. Every advantage is defended by means of practical examples and
benchmarks.
","[{'version': 'v1', 'created': 'Thu, 12 Nov 2015 13:49:06 GMT'}]",2015-11-13,"[['de Farias', 'Tarcisio Mendes', '', 'Le2i'], ['Roxin', 'Ana', '', 'Le2i'], ['Nicolle', 'Christophe', '', 'Le2i']]","['IFC', 'Linked Data', 'OWL', 'Ontology', 'Building Information Modelling (BIM)']"
19585,1004.0259,Lennart Nacke Ph.D.,"Lennart E. Nacke, Sophie Stellmach, Dennis Sasse, Craig A. Lindley",Gameplay experience in a gaze interaction game,"pages 49-54, The 5th Conference on Communication by Gaze Interaction
  - COGAIN 2009: Gaze Interaction For Those Who Want It Most, ISBN:
  978-87-643-0475-6",,,,cs.HC cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Assessing gameplay experience for gaze interaction games is a challenging
task. For this study, a gaze interaction Half-Life 2 game modification was
created that allowed eye tracking control. The mod was deployed during an
experiment at Dreamhack 2007, where participants had to play with gaze
navigation and afterwards rate their gameplay experience. The results show low
tension and negative affects scores on the gameplay experience questionnaire as
well as high positive challenge, immersion and flow ratings. The correlation
between spatial presence and immersion for gaze interaction was high and yields
further investigation. It is concluded that gameplay experience can be
correctly assessed with the methodology presented in this paper.
","[{'version': 'v1', 'created': 'Thu, 1 Apr 2010 23:52:50 GMT'}]",2010-04-05,"[['Nacke', 'Lennart E.', ''], ['Stellmach', 'Sophie', ''], ['Sasse', 'Dennis', ''], ['Lindley', 'Craig A.', '']]","['Game experience', 'flow', 'immersion', 'gaming with gaze', 'human-computer interaction']"
19586,1007.0295,Ajay Prasad,"Ajay Prasad, Saurabh Singh Verma, Ashok Kumar Sharma","Certification Authority Monitored Multilevel and Stateful Policy Based
  Authorization in Services Oriented Grids",,"Certification Authority Monitored Multilevel and Stateful Policy
  Based Authorization in Services Oriented Grids, International Journal of
  Security, (IJS), Volume (3) : Issue(4):48-64, 2009",,,cs.DC cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Services oriented grids will be more prominent among other kinds of grids in
the present distributed environments. With the advent of online government
services the governmental grids will come up in huge numbers. Apart from common
security issues as in other grids, the authorization in service oriented grids
faces certain shortcomings and needs to be looked upon differently. The CMMS
model presented here overcomes all these shortcomings and adds to the
simplicity of implementation because of its tight similarities with certain
government services and their functioning. The model is used to prototype a
State Police Information Grid (SPIG). Small technological restructuring is
required in PKIX and X.509 certificates.
","[{'version': 'v1', 'created': 'Fri, 2 Jul 2010 05:09:51 GMT'}]",2010-07-05,"[['Prasad', 'Ajay', ''], ['Verma', 'Saurabh Singh', ''], ['Sharma', 'Ashok Kumar', '']]","['Grid security', 'Authorization', 'Virtual Organization', 'Policy based authorization', 'Policy mappings']"
19587,1301.2086,Georges Gouriten,"Georges Gouriten, Pierre Senellart",API Blender: A Uniform Interface to Social Platform APIs,"Presented in WWW 2012 Developer Track, April 18-20, 2012, Lyon,
  France and published in WWW no companion proceedings (url:
  http://www2012.org/proceedings/nocompanion/DevTrack_039.pdf)",,,,cs.SE cs.SI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  With the growing success of the social Web, most Web developers have to
interact with at least one social Web platform, which implies studying the
related API specifications. These are often only informally described, may
contain errors, lack harmonization, and generally speaking make the developer's
work difficult. Most attempts to solve this problem, proposing formal
description languages for Web service APIs, have had limited success outside of
B2B applications; we believe it is due to their top-down nature. In addition, a
programmer dealing with one or several of these APIs has to deal with a number
of related tasks such as data integration, requests chaining, or policy
management, that are cumbersome to implement. Inspired by the SPORE project, we
present API Blender, an open-source solution to describe, interact with, and
integrate the most common social Web APIs. In this perspective, we first
introduce two new lightweight description formats for requests and services and
demonstrate their relevance with respect to current platform APIs. We present
our Python implementation of API Blender and its features regarding
authentication, policy management and multi-platform data integration.
","[{'version': 'v1', 'created': 'Thu, 10 Jan 2013 11:19:25 GMT'}]",2013-01-11,"[['Gouriten', 'Georges', ''], ['Senellart', 'Pierre', '']]","['social Web', 'API', 'REST', 'data integration']"
19588,1603.08393,Dimitris Sakavalas,"Sushanta Karmakar, Paraschos Koutris, Aris Pagourtzis, Dimitris
  Sakavalas",$k$-shot Broadcasting in Ad Hoc Radio Networks,"21 pages, 2 figures, preliminary version presented in CATS 2011:
  161-168",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study distributed broadcasting protocols with few transmissions (`shots')
in radio networks where the topology is unknown. In particular, we examine the
case in which a bound $k$ is given and a node may transmit at most $k$ times
during the broadcasting protocol. Initially, we focus on oblivious algorithms
for $k$-shot broadcasting, that is, algorithms where each node decides whether
to transmit or not with no consideration of the transmission history. Our main
contributions are (a) a lower bound of $\Omega(n^2/k)$ on the broadcasting time
of any oblivious $k$-shot broadcasting algorithm and (b) an oblivious
broadcasting protocol that achieves a matching upper bound, namely $O(n^2/k)$,
for every $k \le \sqrt{n}$ and an upper bound of $O(n^{3/2})$ for every $k >
\sqrt{n}$. We also study the general case of adaptive broadcasting protocols
where nodes decide whether to transmit based on all the available information,
namely the transmission history known by each. We prove a lower bound of
$\Omega\left(n^{\frac{1+k}{k}}\right)$ on the broadcasting time of any protocol
by introducing the \emph{transmission tree} construction which generalizes
previous approaches.
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2016 14:55:10 GMT'}]",2016-03-29,"[['Karmakar', 'Sushanta', ''], ['Koutris', 'Paraschos', ''], ['Pagourtzis', 'Aris', ''], ['Sakavalas', 'Dimitris', '']]","['distributed algorithm', 'broadcasting', 'k-shot', 'oblivious', 'radio network']"
19589,1511.03984,Run Wang,"Run Wang, Qiaoli Mo, Qian Zhang, Fudi Chen and Dazuo Yang","Prediction of the Yield of Enzymatic Synthesis of Betulinic Acid Ester
  Using Artificial Neural Networks and Support Vector Machine","32 pages, 11 figures, 1 table",,,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  3\b{eta}-O-phthalic ester of betulinic acid is of great importance in
anticancer studies. However, the optimization of its reaction conditions
requires a large number of experimental works. To simplify the number of times
of optimization in experimental works, here, we use artificial neural network
(ANN) and support vector machine (SVM) models for the prediction of yields of
3\b{eta}-O-phthalic ester of betulinic acid synthesized by betulinic acid and
phthalic anhydride using lipase as biocatalyst. General regression neural
network (GRNN), multilayer feed-forward neural network (MLFN) and the SVM
models were trained based on experimental data. Four indicators were set as
independent variables, including time (h), temperature (C), amount of enzyme
(mg) and molar ratio, while the yield of the 3\b{eta}-O-phthalic ester of
betulinic acid was set as the dependent variable. Results show that the GRNN
and SVM models have the best prediction results during the testing process,
with comparatively low RMS errors (4.01 and 4.23respectively) and short
training times (both 1s). The prediction accuracy of the GRNN and SVM are both
100% in testing process, under the tolerance of 30%.
","[{'version': 'v1', 'created': 'Thu, 12 Nov 2015 17:40:42 GMT'}]",2015-11-13,"[['Wang', 'Run', ''], ['Mo', 'Qiaoli', ''], ['Zhang', 'Qian', ''], ['Chen', 'Fudi', ''], ['Yang', 'Dazuo', '']]","['Artificial neural network', 'betulinic acid ester', 'biocatalyst', 'support vector']"
19590,1707.08208,Thakshila Wimalajeewa,Thakshila Wimalajeewa and Pramod K. Varshney,"Robust Detection of Random Events with Spatially Correlated Data in
  Wireless Sensor Networks via Distributed Compressive Sensing",,,,,cs.IT math.IT stat.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we exploit the theory of compressive sensing to perform
detection of a random source in a dense sensor network. When the sensors are
densely deployed, observations at adjacent sensors are highly correlated while
those corresponding to distant sensors are less correlated. Thus, the
covariance matrix of the concatenated observation vector of all the sensors at
any given time can be sparse where the sparse structure depends on the network
topology and the correlation model. Exploiting the sparsity structure of the
covariance matrix, we develop a robust nonparametric detector to detect the
presence of the random event using a compressed version of the data collected
at the distributed nodes. We employ the multiple access channel (MAC) model
with distributed random projections for sensors to transmit observations so
that a compressed version of the observations is available at the fusion
center. Detection is performed by constructing a decision statistic based on
the covariance information of uncompressed data which is estimated using
compressed data. The proposed approach does not require any knowledge of the
noise parameter to set the threshold, and is also robust when the distributed
random projection matrices become sparse.
","[{'version': 'v1', 'created': 'Fri, 7 Jul 2017 02:26:10 GMT'}]",2017-07-27,"[['Wimalajeewa', 'Thakshila', ''], ['Varshney', 'Pramod K.', '']]","['Compressive sensing', 'random events', 'detection theory', 'statistical dependence', 'wireless sensor networks']"
19591,0806.3031,Thibaud Monteiro,"Thibaud Monteiro (LGIPM, INRIA Lorraine), Daniel Roy (LGIPM, INRIA
  Lorraine), Didier Anciaux (LGIPM, INRIA Lorraine)",Multi Site Coordination using a Multi-Agent System,,"Computers in Industry 58, 4 (2007) pp. 367-377",,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new approach of coordination of decisions in a multi site system is
proposed. It is based this approach on a multi-agent concept and on the
principle of distributed network of enterprises. For this purpose, each
enterprise is defined as autonomous and performs simultaneously at the local
and global levels. The basic component of our approach is a so-called Virtual
Enterprise Node (VEN), where the enterprise network is represented as a set of
tiers (like in a product breakdown structure). Within the network, each partner
constitutes a VEN, which is in contact with several customers and suppliers.
Exchanges between the VENs ensure the autonomy of decision, and guarantiee the
consistency of information and material flows. Only two complementary VEN
agents are necessary: one for external interactions, the Negotiator Agent (NA)
and one for the planning of internal decisions, the Planner Agent (PA). If
supply problems occur in the network, two other agents are defined: the Tier
Negotiator Agent (TNA) working at the tier level only and the Supply Chain
Mediator Agent (SCMA) working at the level of the enterprise network. These two
agents are only active when the perturbation occurs. Otherwise, the VENs
process the flow of information alone. With this new approach, managing
enterprise network becomes much more transparent and looks like managing a
simple enterprise in the network. The use of a Multi-Agent System (MAS) allows
physical distribution of the decisional system, and procures a heterarchical
organization structure with a decentralized control that guaranties the
autonomy of each entity and the flexibility of the network.
","[{'version': 'v1', 'created': 'Wed, 18 Jun 2008 15:46:10 GMT'}]",2008-12-18,"[['Monteiro', 'Thibaud', '', 'LGIPM, INRIA Lorraine'], ['Roy', 'Daniel', '', 'LGIPM, INRIA\n  Lorraine'], ['Anciaux', 'Didier', '', 'LGIPM, INRIA Lorraine']]","['Multi-agent systems', 'decision support systems', 'coordination', 'negotiation', 'distributed control', 'supply chain']"
19592,1704.06109,Yashar Deldjoo,"Yashar Deldjoo, Massimo Quadrana, Mehdi Elahi, Paolo Cremonesi","Using Mise-En-Sc\`ene Visual Features based on MPEG-7 and Deep Learning
  for Movie Recommendation","8 pages, 3 figures",,,,cs.IR cs.CV cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Item features play an important role in movie recommender systems, where
recommendations can be generated by using explicit or implicit preferences of
users on traditional features (attributes) such as tag, genre, and cast.
Typically, movie features are human-generated, either editorially (e.g., genre
and cast) or by leveraging the wisdom of the crowd (e.g., tag), and as such,
they are prone to noise and are expensive to collect. Moreover, these features
are often rare or absent for new items, making it difficult or even impossible
to provide good quality recommendations.
  In this paper, we show that user's preferences on movies can be better
described in terms of the mise-en-sc\`ene features, i.e., the visual aspects of
a movie that characterize design, aesthetics and style (e.g., colors,
textures). We use both MPEG-7 visual descriptors and Deep Learning hidden
layers as example of mise-en-sc\`ene features that can visually describe
movies. Interestingly, mise-en-sc\`ene features can be computed automatically
from video files or even from trailers, offering more flexibility in handling
new items, avoiding the need for costly and error-prone human-based tagging,
and providing good scalability.
  We have conducted a set of experiments on a large catalogue of 4K movies.
Results show that recommendations based on mise-en-sc\`ene features
consistently provide the best performance with respect to richer sets of more
traditional features, such as genre and tag.
","[{'version': 'v1', 'created': 'Thu, 20 Apr 2017 12:33:48 GMT'}]",2017-04-21,"[['Deldjoo', 'Yashar', ''], ['Quadrana', 'Massimo', ''], ['Elahi', 'Mehdi', ''], ['Cremonesi', 'Paolo', '']]","['mpeg-7 features', 'movie recommendation', 'visual', 'deep learning']"
19593,1607.00064,Yongming Shen,"Yongming Shen, Michael Ferdman, and Peter Milder",Maximizing CNN Accelerator Efficiency Through Resource Partitioning,,,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convolutional neural networks (CNNs) are revolutionizing machine learning,
but they present significant computational challenges. Recently, many
FPGA-based accelerators have been proposed to improve the performance and
efficiency of CNNs. Current approaches construct a single processor that
computes the CNN layers one at a time; the processor is optimized to maximize
the throughput at which the collection of layers is computed. However, this
approach leads to inefficient designs because the same processor structure is
used to compute CNN layers of radically varying dimensions.
  We present a new CNN accelerator paradigm and an accompanying automated
design methodology that partitions the available FPGA resources into multiple
processors, each of which is tailored for a different subset of the CNN
convolutional layers. Using the same FPGA resources as a single large
processor, multiple smaller specialized processors increase computational
efficiency and lead to a higher overall throughput. Our design methodology
achieves 3.8x higher throughput than the state-of-the-art approach on
evaluating the popular AlexNet CNN on a Xilinx Virtex-7 FPGA. For the more
recent SqueezeNet and GoogLeNet, the speedups are 2.2x and 2.0x.
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2016 22:10:13 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Apr 2018 05:36:34 GMT'}]",2018-04-13,"[['Shen', 'Yongming', ''], ['Ferdman', 'Michael', ''], ['Milder', 'Peter', '']]","['Convolutional Neural Network', 'FPGA', 'Accelerator']"
19594,1307.6544,Mohammed El-Dosuky,M. A. El-Dosuky,"Veni Vidi Vici, A Three-Phase Scenario For Parameter Space Analysis in
  Image Analysis and Visualization",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic analysis of the enormous sets of images is a critical task in life
sciences. This faces many challenges such as: algorithms are highly
parameterized, significant human input is intertwined, and lacking a standard
meta-visualization approach. This paper proposes an alternative iterative
approach for optimizing input parameters, saving time by minimizing the user
involvement, and allowing for understanding the workflow of algorithms and
discovering new ones. The main focus is on developing an interactive
visualization technique that enables users to analyze the relationships between
sampled input parameters and corresponding output. This technique is
implemented as a prototype called Veni Vidi Vici, or ""I came, I saw, I
conquered."" This strategy is inspired by the mathematical formulas of numbering
computable functions and is developed atop ImageJ, a scientific image
processing program. A case study is presented to investigate the proposed
framework. Finally, the paper explores some potential future issues in the
application of the proposed approach in parameter space analysis in
visualization.
","[{'version': 'v1', 'created': 'Wed, 17 Jul 2013 04:49:24 GMT'}]",2013-07-25,"[['El-Dosuky', 'M. A.', '']]","['Parameter Space Analysis', 'Analysis', 'Segmentation', 'Visualization', 'Veni VidiVici', 'ImageJ']"
19595,1708.00774,Anton Eremeev,"Pavel Borisovsky, Anton Eremeev, Sergei Hrushev, Vadim Teplyakov,
  Mikhail Vorozhtsov","Approximate solution of length-bounded maximum multicommodity flow with
  unit edge-lengths","17-th Baikal International Triannual School-Seminar ""Methods of
  Optimization and Their Applications""",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An improved fully polynomial-time approximation scheme and a greedy heuristic
for the fractional length-bounded maximum multicommodity flow problem with unit
edge-lengths are proposed. Computational experiments are carried out on
benchmark graphs and on graphs that model software defined satellite networks
to compare the proposed algorithms and an exact linear programming solver. The
results of experiments demonstrate a trade-off between the computing time and
the precision of algorithms under consideration.
","[{'version': 'v1', 'created': 'Wed, 2 Aug 2017 14:42:36 GMT'}]",2017-08-03,"[['Borisovsky', 'Pavel', ''], ['Eremeev', 'Anton', ''], ['Hrushev', 'Sergei', ''], ['Teplyakov', 'Vadim', ''], ['Vorozhtsov', 'Mikhail', '']]","['Fully Polynomial-Time Approximation Scheme', 'Quality of Service', 'Software Defined Satellite Network']"
19596,1106.2673,Joseph Y. Halpern,"Danny Dolev, Dror G. Feitelson, Joseph Y. Halpern, Raz Kupferman, and
  Nati Linial",No justified complaints: On fair sharing of multiple resources,,,,,cs.DC cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fair allocation has been studied intensively in both economics and computer
science, and fair sharing of resources has aroused renewed interest with the
advent of virtualization and cloud computing. Prior work has typically focused
on mechanisms for fair sharing of a single resource. We provide a new
definition for the simultaneous fair allocation of multiple
continuously-divisible resources. Roughly speaking, we define fairness as the
situation where every user either gets all the resources he wishes for, or else
gets at least his entitlement on some bottleneck resource, and therefore cannot
complain about not getting more. This definition has the same desirable
properties as the recently suggested dominant resource fairness, and also
handles the case of multiple bottlenecks. We then prove that a fair allocation
according to this definition is guaranteed to exist for any combination of user
requests and entitlements (where a user's relative use of the different
resources is fixed). The proof, which uses tools from the theory of ordinary
differential equations, is constructive and provides a method to compute the
allocations numerically.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2011 11:20:26 GMT'}]",2011-06-15,"[['Dolev', 'Danny', ''], ['Feitelson', 'Dror G.', ''], ['Halpern', 'Joseph Y.', ''], ['Kupferman', 'Raz', ''], ['Linial', 'Nati', '']]","['Resource allocation', 'fair share', 'bottlenecks']"
19597,1402.2327,Zbigniew Lipi\'nski,Z. Lipi\'nski,"On the role of symmetry in solving maximum lifetime problem in
  two-dimensional sensor networks","14 pages, 4 figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze a continuous and discrete symmetries of the maximum lifetime
problem in two dimensional sensor networks. We show, how a symmetry of the
network and invariance of the problem under a given transformation group $G$
can be utilized to simplify its solution. We prove, that for a $G$-invariant
maximum lifetime problem there exists a $G$-invariant solution. Constrains
which follow from the $G$-invariance allow to reduce the problem and its
solution to a subset, an optimal fundamental region of the sensor network. We
analyze in detail solutions of the maximum lifetime problem invariant under a
group of isometry transformations of a two dimensional Euclidean plane.
","[{'version': 'v1', 'created': 'Mon, 10 Feb 2014 23:17:34 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Jul 2014 10:02:22 GMT'}]",2014-07-17,"[['Lipiński', 'Z.', '']]","['wireless sensor networks', 'energy efficiency', 'symmetry group']"
19598,1212.3220,Mohammed El-Dosuky,"M. A. El-Dosuky, M. Z. Rashad, T. T. Hamza and A.H. EL-Bassiouny","New SpiroPlanck Heuristics for High Energy Physics Networking and Future
  Internet Testbeds",,,,,cs.NI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The need for data intensive Grids, and advanced networks with high
performance that support our science has made the High Energy Physics community
a leading and a key co-developer of leading edge wide area networks. This paper
gives an overview of the status for the world's research networks and major
international links used by the high energy physics and other scientific
communities, showing some Future Internet testbed architectures, scalability,
geographic scope, and extension between networks. The resemblance between
wireless sensor network and future internet network, especially in scale
consideration as density and network coverage, inspires us to adopt the models
of the former to the later. Then we test this assumption to see that this
provides a concise working model. This paper collects some heuristics that we
call them SpiroPlanck and employs them to model the coverage of dense networks.
In this paper, we propose a framework for the operation of FI testbeds
containing a test scenario, new representation and visualization techniques,
and possible performance measures. Investigations show that it is very
promising and could be seen as a good optimization
","[{'version': 'v1', 'created': 'Fri, 7 Dec 2012 17:55:25 GMT'}]",2012-12-14,"[['El-Dosuky', 'M. A.', ''], ['Rashad', 'M. Z.', ''], ['Hamza', 'T. T.', ''], ['EL-Bassiouny', 'A. H.', '']]","['SpiroPlanck', 'Future Internet testbed', 'High Energy Physics', 'wireless sensor network', 'Coverage', 'Density']"
19599,1005.4030,William Jackson,"Monika Sharma, Ashwani Mehra, Haresh Jola, Anand Kumar, Madhvendra
  Misra and Vijayshri Tiwari",Scope of cloud computing for SMEs in India,http://www.journalofcomputing.org,"Journal of Computing, Volume 2, Issue 5, May 2010",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing is a set of services that provide infrastructure resources
using internet media and data storage on a third party server. SMEs are said to
be the lifeblood of any vibrant economy. They are known to be the silent
drivers of a nation's economy. SMEs of India are one of the most aggressive
adopters of ERP Packages. Most of the Indian SMEs have adopted the traditional
ERP Systems and have incurred a heavy cost while implementing these systems.
This paper presents the cost savings and reduction in the level of difficulty
in adopting a cloud computing Service (CCS) enabled ERP system. For the study,
IT people from 30 North Indian SMEs were interviewed. In the cloud computing
environment the SMEs will not have to own the infrastructure so they can
abstain from any capital expenditure and instead they can utilize the resources
as a service and pay as per their usage. We consider the results of the paper
to be supportive to our proposed research concept.
","[{'version': 'v1', 'created': 'Fri, 21 May 2010 17:50:28 GMT'}]",2010-05-24,"[['Sharma', 'Monika', ''], ['Mehra', 'Ashwani', ''], ['Jola', 'Haresh', ''], ['Kumar', 'Anand', ''], ['Misra', 'Madhvendra', ''], ['Tiwari', 'Vijayshri', '']]","['Cloud Computing', 'SME', 'ERP', 'Cost scenario', 'India']"
19600,1606.04929,Koushik Sinha,"Koushik Sinha, Geetha Manjunath, Bidyut Gupta and Shahram Rahimi","Designing a Human-Machine Hybrid Computing System for Unstructured Data
  Analytics","conference pre-print version in Proc. 31st Intl. Conf. on Computers
  and Their Applications (CATA), Las Vegas, USA, April 4-6, 2016",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Current machine algorithms for analysis of unstructured data typically show
low accuracies due to the need for human-like intelligence. Conversely, though
humans are much better than machine algorithms on analyzing unstructured data,
they are unpredictable, slower and can be erroneous or even malicious as
computing agents. Therefore, a hybrid platform that can intelligently
orchestrate machine and human computing resources would potentially be capable
of providing significantly better benefits compared to either type of computing
agent in isolation. In this paper, we propose a new hybrid human-machine
computing platform with integrated service level objectives (SLO) management
for complex tasks that can be decomposed into a dependency graph where nodes
represent subtasks. Initial experimental results are highly encouraging. To the
best of our knowledge, ours is the first work that attempts to design such a
hybrid human-machine computing platform with support for addressing the three
SLO parameters of accuracy, budget and completion time.
","[{'version': 'v1', 'created': 'Wed, 15 Jun 2016 19:38:12 GMT'}]",2016-06-16,"[['Sinha', 'Koushik', ''], ['Manjunath', 'Geetha', ''], ['Gupta', 'Bidyut', ''], ['Rahimi', 'Shahram', '']]","['Crowdsourcing', 'task scheduling', 'human augmentedcomputing', 'service level objectives', 'microtask', 'data analytics']"
19601,0710.2970,An-Ping Li,An-Ping Li,A generic attack to ciphers,4 pages,,,,cs.CR,,"  In this paper, we present a generic attack for ciphers, which is in essence a
collision attack on the secret keys of ciphers .
","[{'version': 'v1', 'created': 'Tue, 16 Oct 2007 07:45:58 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Oct 2007 10:34:37 GMT'}]",2009-03-21,"[['Li', 'An-Ping', '']]","['ciphers', 'secret keys', 'collision attack', 'ciphertext', 'dictionary']"
19602,1305.5827,Monica Shekhar,Monica Shekhar and Saravanaguru RA. K,Semantic Web Search based on Ontology Modeling using Protege Reasoner,,,,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Semantic Web works on the existing Web which presents the meaning of
information as well-defined vocabularies understood by the people. Semantic
Search, at the same time, works on improving the accuracy if a search by
understanding the intent of the search and providing contextually relevant
results. This paper describes a semantic approach toward web search through a
PHP application. The goal was to parse through a user's browsing history and
return semantically relevant web pages for the search query provided.
","[{'version': 'v1', 'created': 'Fri, 24 May 2013 19:02:59 GMT'}]",2013-05-27,"[['Shekhar', 'Monica', ''], ['K', 'Saravanaguru RA.', '']]","['protégé', 'python', 'Semantic Web', 'Semantic Search', 'ontology', 'RDF', 'RDFS', 'OWL']"
19603,1108.5140,Michael Tchaikovsky,"Michael M. Tchaikovsky, Alexander P. Kurdyukov, Victor N. Timin",A convex formulation of strict anisotropic norm bounded real lemma,"16 pages, 1 fugure, 5 tables",,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is aimed at extending the H-infinity Bounded Real Lemma to
stochastic systems under random disturbances with imprecisely known probability
distributions. The statistical uncertainty is measured in entropy theoretic
terms using the mean anisotropy functional. The disturbance attenuation
capabilities of the system are quantified by the anisotropic norm which is a
stochastic counterpart of the H-infinity norm. A state-space sufficient
criterion for the anisotropic norm of a linear discrete time invariant system
to be bounded by a given threshold value is derived. The resulting Strict
Anisotropic Norm Bounded Real Lemma involves an inequality on the determinant
of a positive definite matrix and a linear matrix inequality. It is shown that
slight reformulation of these conditions allows the anisotropic norm of a
system to be efficiently computed via convex optimization.
","[{'version': 'v1', 'created': 'Thu, 25 Aug 2011 17:45:17 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Sep 2011 11:22:21 GMT'}, {'version': 'v3', 'created': 'Fri, 2 Sep 2011 10:30:35 GMT'}, {'version': 'v4', 'created': 'Tue, 25 Oct 2011 16:21:26 GMT'}, {'version': 'v5', 'created': 'Sat, 5 Nov 2011 21:55:33 GMT'}]",2015-03-19,"[['Tchaikovsky', 'Michael M.', ''], ['Kurdyukov', 'Alexander P.', ''], ['Timin', 'Victor N.', '']]","['linear systems', 'random input', 'uncertainty', 'norms', 'anisotropy', 'convex optimization']"
19604,1609.02795,Haris Aziz,Haris Aziz and Ronald de Haan and Baharak Rastegari,Pareto Optimal Allocation under Uncertain Preferences,Preliminary Draft; new results & new authors,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The assignment problem is one of the most well-studied settings in social
choice, matching, and discrete allocation. We consider the problem with the
additional feature that agents' preferences involve uncertainty. The setting
with uncertainty leads to a number of interesting questions including the
following ones. How to compute an assignment with the highest probability of
being Pareto optimal? What is the complexity of computing the probability that
a given assignment is Pareto optimal? Does there exist an assignment that is
Pareto optimal with probability one? We consider these problems under two
natural uncertainty models: (1) the lottery model in which each agent has an
independent probability distribution over linear orders and (2) the joint
probability model that involves a joint probability distribution over
preference profiles. For both of the models, we present a number of algorithmic
and complexity results.
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2016 13:53:58 GMT'}, {'version': 'v2', 'created': 'Sat, 8 Oct 2016 21:14:57 GMT'}]",2016-10-11,"[['Aziz', 'Haris', ''], ['de Haan', 'Ronald', ''], ['Rastegari', 'Baharak', '']]","['Assignment Problem', 'Resource allocation', 'Pareto optimality', 'Uncertain Preferences']"
19605,1707.07863,Beatriz Remeseiro,"Pedro Herruzo, Laura Portell, Alberto Soto and Beatriz Remeseiro","Analyzing First-Person Stories Based on Socializing, Eating and
  Sedentary Patterns","Accepted at First International Workshop on Social Signal Processing
  and Beyond, 19th International Conference on Image Analysis and Processing
  (ICIAP), September 2017",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  First-person stories can be analyzed by means of egocentric pictures acquired
throughout the whole active day with wearable cameras. This manuscript presents
an egocentric dataset with more than 45,000 pictures from four people in
different environments such as working or studying. All the images were
manually labeled to identify three patterns of interest regarding people's
lifestyle: socializing, eating and sedentary. Additionally, two different
approaches are proposed to classify egocentric images into one of the 12 target
categories defined to characterize these three patterns. The approaches are
based on machine learning and deep learning techniques, including traditional
classifiers and state-of-art convolutional neural networks. The experimental
results obtained when applying these methods to the egocentric dataset
demonstrated their adequacy for the problem at hand.
","[{'version': 'v1', 'created': 'Tue, 25 Jul 2017 09:15:44 GMT'}]",2017-07-26,"[['Herruzo', 'Pedro', ''], ['Portell', 'Laura', ''], ['Soto', 'Alberto', ''], ['Remeseiro', 'Beatriz', '']]","['first-person stories', 'wearable cameras', 'egocentric lifelogging', 'annotation tool', 'deep learning', 'machine learning']"
19606,1301.3347,Michalis Smyrnakis,Michalis Smyrnakis,Multi-agent learning using Fictitious Play and Extended Kalman Filter,,,,,cs.MA cs.LG math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Decentralised optimisation tasks are important components of multi-agent
systems. These tasks can be interpreted as n-player potential games: therefore
game-theoretic learning algorithms can be used to solve decentralised
optimisation tasks. Fictitious play is the canonical example of these
algorithms. Nevertheless fictitious play implicitly assumes that players have
stationary strategies. We present a novel variant of fictitious play where
players predict their opponents' strategies using Extended Kalman filters and
use their predictions to update their strategies.
  We show that in 2 by 2 games with at least one pure Nash equilibrium and in
potential games where players have two available actions, the proposed
algorithm converges to the pure Nash equilibrium. The performance of the
proposed algorithm was empirically tested, in two strategic form games and an
ad-hoc sensor network surveillance problem. The proposed algorithm performs
better than the classic fictitious play algorithm in these games and therefore
improves the performance of game-theoretical learning in decentralised
optimisation.
","[{'version': 'v1', 'created': 'Tue, 15 Jan 2013 14:00:55 GMT'}]",2013-01-16,"[['Smyrnakis', 'Michalis', '']]","['Multi-agent learning', 'game theory', 'fictitious play', 'decentralised optimisation', 'learning in games', 'Extended Kalman filter']"
19607,0908.0390,Zohir Bouzid,"Zohir Bouzid (LIP6), Maria Potop-Butucaru (LIP6, INRIA Rocquencourt),
  S\'ebastien Tixeuil (LIP6)",Byzantine Convergence in Robots Networks: The Price of Asynchrony,,,,,cs.DC cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the convergence problem in fully asynchronous, uni-dimensional robot
networks that are prone to Byzantine (i.e. malicious) failures. In these
settings, oblivious anonymous robots with arbitrary initial positions are
required to eventually converge to an a apriori unknown position despite a
subset of them exhibiting Byzantine behavior. Our contribution is twofold. We
propose a deterministic algorithm that solves the problem in the most generic
settings: fully asynchronous robots that operate in the non-atomic CORDA model.
Our algorithm provides convergence in 5f+1-sized networks where f is the upper
bound on the number of Byzantine robots. Additionally, we prove that 5f+1 is a
lower bound whenever robot scheduling is fully asynchronous. This constrasts
with previous results in partially synchronous robots networks, where 3f+1
robots are necessary and sufficient.
","[{'version': 'v1', 'created': 'Tue, 4 Aug 2009 06:15:33 GMT'}]",2009-08-05,"[['Bouzid', 'Zohir', '', 'LIP6'], ['Potop-Butucaru', 'Maria', '', 'LIP6, INRIA Rocquencourt'], ['Tixeuil', 'Sébastien', '', 'LIP6']]","['Robots networks', 'Byzantine tolerance', 'Asynchronous systems', 'Convergence']"
19608,1507.00184,Jonathan Laporte,"Jonathan Laporte, Antoine Chaillet and Yacine Chitour","Global stabilization of classes of linear control systems with bounds on
  the feedback and its successive derivatives",arXiv admin note: substantial text overlap with arXiv:1503.06364,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we address the problem of globally stabilizing a linear
time-invariant (LTI) system by means of a static feedback law whose amplitude
and successive time derivatives, up to a prescribed order $p$, are bounded by
arbitrary prescribed values. We solve this problem for two classes of LTI
systems, namely integrator chains and skew-symmetric systems with single input.
For the integrator chains, the solution we propose is based on the nested
saturations introduced by A.R. Teel. We show that this construction fails for
skew-symmetric systems and propose an alternative feedback law. We illustrate
these findings by the stabilization of the third order integrator with
prescribed bounds on the feedback and its first two derivatives, and similarly
for the harmonic oscillator with prescribed bounds on the feedback and its
first derivative.
","[{'version': 'v1', 'created': 'Wed, 1 Jul 2015 11:04:15 GMT'}]",2015-07-02,"[['Laporte', 'Jonathan', ''], ['Chaillet', 'Antoine', ''], ['Chitour', 'Yacine', '']]","['Global stabilization', 'Bounded controls', 'Rate saturation', 'Multipleintegrators', 'Oscillators']"
19609,1610.05463,Steve Chang,"Teng Lee, James Johnson, Steve Cheng",An Interactive Machine Learning Framework,,,,,cs.HC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Machine learning (ML) is believed to be an effective and efficient tool to
build reliable prediction model or extract useful structure from an avalanche
of data. However, ML is also criticized by its difficulty in interpretation and
complicated parameter tuning. In contrast, visualization is able to well
organize and visually encode the entangled information in data and guild
audiences to simpler perceptual inferences and analytic thinking. But large
scale and high dimensional data will usually lead to the failure of many
visualization methods. In this paper, we close a loop between ML and
visualization via interaction between ML algorithm and users, so machine
intelligence and human intelligence can cooperate and improve each other in a
mutually rewarding way. In particular, we propose ""transparent boosting tree
(TBT)"", which visualizes both the model structure and prediction statistics of
each step in the learning process of gradient boosting tree to user, and
involves user's feedback operations to trees into the learning process. In TBT,
ML is in charge of updating weights in learning model and filtering information
shown to user from the big data, while visualization is in charge of providing
a visual understanding of ML model to facilitate user exploration. It combines
the advantages of both ML in big data statistics and human in decision making
based on domain knowledge. We develop a user friendly interface for this novel
learning method, and apply it to two datasets collected from real applications.
Our study shows that making ML transparent by using interactive visualization
can significantly improve the exploration of ML algorithms, give rise to novel
insights of ML models, and integrates both machine and human intelligence.
","[{'version': 'v1', 'created': 'Tue, 18 Oct 2016 07:46:11 GMT'}]",2016-10-19,"[['Lee', 'Teng', ''], ['Johnson', 'James', ''], ['Cheng', 'Steve', '']]","['Ensemble boosting tree', 'decision tree', 'interactive visualization', 'interpretable machine learning', 'transparent machine learning']"
19610,1702.02489,Christophe Guyeux,Jacques M. Bahi and Christophe Guyeux,Hash functions using chaotic iterations,"Published in Journal of Algorithms and Computational Technology.
  arXiv admin note: substantial text overlap with arXiv:1511.00117,
  arXiv:0810.4711, arXiv:1608.05920, arXiv:0810.4702, arXiv:0810.3154",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a novel formulation of discrete chaotic iterations in the
field of dynamical systems is given. Their topological properties are studied:
it is mathematically proved that, under some conditions, these iterations have
a chaotic behavior in the meaning of Devaney. This chaotic behavior allows us
to propose a way to generate new hash functions. An illustration example is
detailed in order to show how to use our theoretical study in practice.
","[{'version': 'v1', 'created': 'Wed, 8 Feb 2017 16:09:26 GMT'}]",2017-02-09,"[['Bahi', 'Jacques M.', ''], ['Guyeux', 'Christophe', '']]","['Discrete dynamical systems', 'Chaotic iterations', 'Devaney’schaos', 'Hash functions']"
19611,1209.1424,Ehsan Nekouei,"Ehsan Nekouei, Hazer Inaltekin and Subhrakanti Dey","Multiuser Diversity for the Cognitive Uplink with Generalized Fading and
  Reduced Primary's Cooperation",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In cognitive multiple access networks, feedback is an important mechanism to
convey secondary transmitter primary base station (STPB) channel gains from the
primary base station (PBS) to the secondary base station (SBS). This paper
investigates the optimal sum-rate capacity scaling laws for cognitive multiple
access networks in feedback limited communication scenarios. First, an
efficient feedback protocol called $K$-smallest channel gains ($K$-SCGs)
feedback protocol is proposed in which the PBS feeds back the $\K$ smallest out
of $N$ STPB channel gains to the SBS. Second, the sum-rate performance of the
$K$-SCG feedback protocol is studied for three network types when transmission
powers of secondary users (SUs) are optimally allocated. The network types
considered are total-power-and-interference-limited (TPIL),
interference-limited (IL) and individual-power-and-interference-limited (IPIL)
networks. For each network type studied, we provide a sufficient condition on
$\K$ such that the $K$-SCG feedback protocol is {\em asymptotically} optimal in
the sense that the secondary network sum-rate scaling behavior under the
$K$-SCG feedback protocol is the same with that under the full-feedback
protocol. We allow distributions of
secondary-transmitter-secondary-base-station (STSB), and STPB channel power
gains to belong to a fairly general class of distributions called class
$\mathcal{C}$-distributions that includes commonly used fading models.
","[{'version': 'v1', 'created': 'Thu, 6 Sep 2012 23:10:48 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Apr 2013 23:05:39 GMT'}, {'version': 'v3', 'created': 'Wed, 9 Sep 2015 23:59:13 GMT'}, {'version': 'v4', 'created': 'Mon, 21 Sep 2015 00:49:45 GMT'}]",2015-09-22,"[['Nekouei', 'Ehsan', ''], ['Inaltekin', 'Hazer', ''], ['Dey', 'Subhrakanti', '']]","['Cognitive radio', 'Multiple-access fading channels', 'Multiuser diversity', 'Throughput scaling', 'Channel state']"
19612,1207.4096,Spyros Chatzivasileiadis,"Spyros Chatzivasileiadis, Damien Ernst, G\""oran Andersson",The Global Grid,Manuscript,,,,cs.SY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper puts forward the vision that a natural future stage of the
electricity network could be a grid spanning the whole planet and connecting
most of the large power plants in the world: this is the ""Global Grid"". The
main driving force behind the Global Grid will be the harvesting of remote
renewable sources, and its key infrastructure element will be the high capacity
long transmission lines. Wind farms and solar power plants will supply load
centers with green power over long distances.
  This paper focuses on the introduction of the concept, showing that a
globally interconnected network can be technologically feasible and
economically competitive. We further highlight the multiple opportunities
emerging from a global electricity network such as smoothing the renewable
energy supply and electricity demand, reducing the need for bulk storage, and
reducing the volatility of the energy prices. We also discuss possible
investment mechanisms and operating schemes. Among others, we envision in such
a system a global power market and the establishment of two new coordinating
bodies, the ""Global Regulator"" and the ""Global System Operator"".
","[{'version': 'v1', 'created': 'Tue, 17 Jul 2012 19:23:10 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Nov 2012 14:52:27 GMT'}, {'version': 'v3', 'created': 'Wed, 19 Dec 2012 23:09:01 GMT'}, {'version': 'v4', 'created': 'Wed, 9 Jan 2013 15:34:39 GMT'}]",2013-01-10,"[['Chatzivasileiadis', 'Spyros', ''], ['Ernst', 'Damien', ''], ['Andersson', 'Göran', '']]","['global electricity grid', 'electricity transmission network', 'global electrical network', 'renewable energy', 'wind power', 'solar power']"
19613,0707.1904,Joseph Y. Halpern,Leandro C. Rego and Joseph Y. Halpern,Generalized Solution Concepts in Games with Possibly Unaware Players,,,,,cs.GT,,"  Most work in game theory assumes that players are perfect reasoners and have
common knowledge of all significant aspects of the game. In earlier work, we
proposed a framework for representing and analyzing games with possibly unaware
players, and suggested a generalization of Nash equilibrium appropriate for
games with unaware players that we called generalized Nash equilibrium. Here,
we use this framework to analyze other solution concepts that have been
considered in the game-theory literature, with a focus on sequential
equilibrium. We also provide some insight into the notion of generalized Nash
equilibrium by proving that it is closely related to the notion of
rationalizability when we restrict the analysis to games in normal form and no
unawareness is involved.
","[{'version': 'v1', 'created': 'Thu, 12 Jul 2007 23:21:16 GMT'}]",2007-07-17,"[['Rego', 'Leandro C.', ''], ['Halpern', 'Joseph Y.', '']]","['Economic Theory', 'Foundations of Game Theory', 'Awareness', 'Sequential Equilibrium', 'Rationalizability']"
19614,0712.3617,Erhan Bayraktar,"Erhan Bayraktar, Bo Yang",A Unified Framework for Pricing Credit and Equity Derivatives,"Keywords: Credit Default Swap, Defaultable Bond, Defaultable Stock,
  Equity Options, Stochastic Interest Rate, Implied Volatility, Multiscale
  Perturbation Method",,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a model which can be jointly calibrated to the corporate bond term
structure and equity option volatility surface of the same company. Our purpose
is to obtain explicit bond and equity option pricing formulas that can be
calibrated to find a risk neutral model that matches a set of observed market
prices. This risk neutral model can then be used to price more exotic, illiquid
or over-the-counter derivatives. We observe that the model implied credit
default swap (CDS) spread matches the market CDS spread and that our model
produces a very desirable CDS spread term structure. This is observation is
worth noticing since without calibrating any parameter to the CDS spread data,
it is matched by the CDS spread that our model generates using the available
information from the equity options and corporate bond markets. We also observe
that our model matches the equity option implied volatility surface well since
we properly account for the default risk premium in the implied volatility
surface. We demonstrate the importance of accounting for the default risk and
stochastic interest rate in equity option pricing by comparing our results to
Fouque, Papanicolaou, Sircar and Solna (2003), which only accounts for
stochastic volatility.
","[{'version': 'v1', 'created': 'Fri, 21 Dec 2007 02:53:38 GMT'}, {'version': 'v2', 'created': 'Sat, 20 Sep 2008 21:44:00 GMT'}]",2008-09-21,"[['Bayraktar', 'Erhan', ''], ['Yang', 'Bo', '']]","['Credit Default Swap', 'Defaultable Bond', 'Defaultable Stock', 'Equity Options', 'Stochastic Interest Rate', 'Implied Volatility', 'Multiscale Perturbation Method']"
19615,1008.3672,Michael Kapralov,Michael Kapralov and Rina Panigrahy,Prediction strategies without loss,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consider a sequence of bits where we are trying to predict the next bit from
the previous bits. Assume we are allowed to say 'predict 0' or 'predict 1', and
our payoff is +1 if the prediction is correct and -1 otherwise. We will say
that at each point in time the loss of an algorithm is the number of wrong
predictions minus the number of right predictions so far. In this paper we are
interested in algorithms that have essentially zero (expected) loss over any
string at any point in time and yet have small regret with respect to always
predicting 0 or always predicting 1. For a sequence of length $T$ our algorithm
has regret $14\epsilon T $ and loss $2\sqrt{T}e^{-\epsilon^2 T} $ in
expectation for all strings. We show that the tradeoff between loss and regret
is optimal up to constant factors.
  Our techniques extend to the general setting of $N$ experts, where the
related problem of trading off regret to the best expert for regret to the
`special' expert has been studied by Even-Dar et al. (COLT'07). We obtain
essentially zero loss with respect to the special expert and optimal
loss/regret tradeoff, improving upon the results of Even-Dar et al and settling
the main question left open in their paper.
  The strong loss bounds of the algorithm have some surprising consequences. A
simple iterative application of our algorithm gives essentially optimal regret
bounds at multiple time scales, bounds with respect to $k$-shifting optima as
well as regret bounds with respect to higher norms of the input sequence.
","[{'version': 'v1', 'created': 'Sun, 22 Aug 2010 01:09:56 GMT'}, {'version': 'v2', 'created': 'Tue, 24 Aug 2010 17:41:52 GMT'}, {'version': 'v3', 'created': 'Tue, 16 Nov 2010 02:12:05 GMT'}, {'version': 'v4', 'created': 'Sat, 6 Oct 2012 22:39:51 GMT'}, {'version': 'v5', 'created': 'Wed, 10 Oct 2012 18:16:48 GMT'}]",2012-10-11,"[['Kapralov', 'Michael', ''], ['Panigrahy', 'Rina', '']]","['multi-armed bandits', 'lossless prediction', 'regret/loss tradeoff', 'k-shifting optima', 'multiscaleregret bounds']"
19616,1603.00489,Archith Bency,"Archith J. Bency, Heesung Kwon, Hyungtae Lee, S. Karthikeyan and B. S.
  Manjunath",Weakly Supervised Localization using Deep Feature Maps,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Object localization is an important computer vision problem with a variety of
applications. The lack of large scale object-level annotations and the relative
abundance of image-level labels makes a compelling case for weak supervision in
the object localization task. Deep Convolutional Neural Networks are a class of
state-of-the-art methods for the related problem of object recognition. In this
paper, we describe a novel object localization algorithm which uses
classification networks trained on only image labels. This weakly supervised
method leverages local spatial and semantic patterns captured in the
convolutional layers of classification networks. We propose an efficient beam
search based approach to detect and localize multiple objects in images. The
proposed method significantly outperforms the state-of-the-art in standard
object localization data-sets with a 8 point increase in mAP scores.
","[{'version': 'v1', 'created': 'Tue, 1 Mar 2016 21:07:09 GMT'}, {'version': 'v2', 'created': 'Tue, 29 Mar 2016 01:10:00 GMT'}]",2016-03-30,"[['Bency', 'Archith J.', ''], ['Kwon', 'Heesung', ''], ['Lee', 'Hyungtae', ''], ['Karthikeyan', 'S.', ''], ['Manjunath', 'B. S.', '']]","['Weakly Supervised methods', 'Object localization', 'Deep Convolutional Networks']"
19617,1802.06361,Jimmy Wu,"Moses Charikar, Yonatan Naamad, Jimmy Wu",On Finding Dense Common Subgraphs,,,,,cs.DS cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the recently introduced problem of finding dense common subgraphs:
Given a sequence of graphs that share the same vertex set, the goal is to find
a subset of vertices $S$ that maximizes some aggregate measure of the density
of the subgraphs induced by $S$ in each of the given graphs. Different choices
for the aggregation function give rise to variants of the problem that were
studied recently. We settle many of the questions left open by previous works,
showing NP-hardness, hardness of approximation, non-trivial approximation
algorithms, and an integrality gap for a natural relaxation.
","[{'version': 'v1', 'created': 'Sun, 18 Feb 2018 10:52:52 GMT'}]",2018-02-20,"[['Charikar', 'Moses', ''], ['Naamad', 'Yonatan', ''], ['Wu', 'Jimmy', '']]","['densest subgraph', 'approximation algorithms', 'hardness of approximation', 'graph sequences', 'integrality gap']"
19618,1704.03963,Stephen Tierney,"Stephen Tierney, Junbin Gao, Yi Guo, Zheng Zhang",Tractable Clustering of Data on the Curve Manifold,arXiv admin note: substantial text overlap with arXiv:1601.00732,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In machine learning it is common to interpret each data point as a vector in
Euclidean space. However the data may actually be functional i.e.\ each data
point is a function of some variable such as time and the function is
discretely sampled. The naive treatment of functional data as traditional
multivariate data can lead to poor performance since the algorithms are
ignoring the correlation in the curvature of each function. In this paper we
propose a tractable method to cluster functional data or curves by adapting the
Euclidean Low-Rank Representation (LRR) to the curve manifold. Experimental
evaluation on synthetic and real data reveals that this method massively
outperforms prior clustering methods in both speed and accuracy when clustering
functional data.
","[{'version': 'v1', 'created': 'Thu, 13 Apr 2017 01:18:41 GMT'}]",2017-04-14,"[['Tierney', 'Stephen', ''], ['Gao', 'Junbin', ''], ['Guo', 'Yi', ''], ['Zhang', 'Zheng', '']]","['Functional Data', 'Curves', 'Manifold', 'Clustering']"
19619,1609.01212,Davide Schipani,"Michele Elia, Davide Schipani","Involutions, Trace Maps, and Pseudorandom Numbers",minor changes,,,,cs.IT math.IT math.NT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interesting properties of the partitions of a finite field $\mathbb F_q$
induced by the combination of involutions and trace maps are studied. The
special features of involutions of the form $\frac{u}{z}$, $u$ being a fixed
element of $\mathbb F_q$, are exploited to generate pseudorandom numbers, the
randomness resting on the uniform distribution of the images of zero-trace
elements among the sets of non-zero trace elements of $\mathbb F_q$.
","[{'version': 'v1', 'created': 'Mon, 5 Sep 2016 16:33:23 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Sep 2016 15:35:23 GMT'}]",2016-09-28,"[['Elia', 'Michele', ''], ['Schipani', 'Davide', '']]","['Random numbers', 'Kloosterman sums', 'Indicator functions']"
19620,1609.02251,Renyuan Zhang,Kai Cai and Renyuan Zhang and W.M. Wonham,"Characterizations and Effective Computation of Supremal Relatively
  Observable Sublanguages",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently we proposed relative observability for supervisory control of
discrete-event systems under partial observation. Relative observability is
closed under set unions and hence there exists the supremal relatively
observable sublanguage of a given language. In this paper we present a new
characterization of relative observability, based on which an operator on
languages is proposed whose largest fixpoint is the supremal relatively
observable sublanguage. Iteratively applying this operator yields a monotone
sequence of languages; exploiting the linguistic concept of support based on
Nerode equivalence, we prove for regular languages that the sequence converges
finitely to the supremal relatively observable sublanguage, and the operator is
effectively computable. Moreover, for the purpose of control, we propose a
second operator that in the regular case computes the supremal relatively
observable and controllable sublanguage. The computational effectiveness of the
operator is demonstrated on a case study.
","[{'version': 'v1', 'created': 'Thu, 8 Sep 2016 03:19:30 GMT'}]",2016-09-09,"[['Cai', 'Kai', ''], ['Zhang', 'Renyuan', ''], ['Wonham', 'W. M.', '']]","['Supervisory control', 'partial-observation', 'relative observability', 'regular language', 'Nerode equivalence']"
19621,1202.6601,Xin Shuai,Xin Shuai and Ying Ding and Jerome Busemeyer,Multiple spreaders affect the indirect influence on Twitter,"2 pages, 2 figures; www2012 poster",www2012,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most studies on social influence have focused on direct influence, while
another interesting question can be raised as whether indirect influence exists
between two users who're not directly connected in the network and what affects
such influence. In addition, the theory of \emph{complex contagion} tells us
that more spreaders will enhance the indirect influence between two users. Our
observation of intensity of indirect influence, propagated by $n$ parallel
spreaders and quantified by retweeting probability on Twitter, shows that
complex contagion is validated globally but is violated locally. In other
words, the retweeting probability increases non-monotonically with some local
drops.
","[{'version': 'v1', 'created': 'Wed, 29 Feb 2012 16:55:07 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Mar 2012 21:34:53 GMT'}]",2012-03-13,"[['Shuai', 'Xin', ''], ['Ding', 'Ying', ''], ['Busemeyer', 'Jerome', '']]","['Twitter', 'social influence', 'complex contagion']"
19622,1802.08040,Jan Vorel,Jan Vorel and Petr Kabele,"Inverse analysis of traction-separation relationship based on
  sequentially linear approach",,,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traction-separation relationship is an important material characteristic
describing the fracture behaviour of quasi-brittle solids. A new numerical
scheme for identification of the traction-separation relation by inverse
analysis of data obtained from various types of fracture tests is proposed. Due
to employing the concept of sequentially linear analysis, the method exhibits a
superior numerical stability and versatility. The applicability and
effectiveness of the proposed method is demonstrated on examples involving
identification of the traction-separation relationship using experimental data
from various test configurations.
","[{'version': 'v1', 'created': 'Thu, 22 Feb 2018 13:47:46 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Aug 2018 22:02:25 GMT'}]",2018-08-07,"[['Vorel', 'Jan', ''], ['Kabele', 'Petr', '']]","['Inverse analysis', 'Sequentially linear analysis', 'Traction-separationrelationship', 'Fracture', 'Cohesive crack']"
19623,1710.05980,Meng Wang,"Fang Gong, Meng Wang, Haofen Wang, Sen Wang, Mengyue Liu",SMR: Medical Knowledge Graph Embedding for Safe Medicine Recommendation,"8 pages, 3 figures, 5 tables",,,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most of the existing medicine recommendation systems that are mainly based on
electronic medical records (EMRs) are significantly assisting doctors to make
better clinical decisions benefiting both patients and caregivers. Even though
the growth of EMRs is at a lighting fast speed in the era of big data, content
limitations in EMRs restrain the existed recommendation systems to reflect
relevant medical facts, such as drug-drug interactions. Many medical knowledge
graphs that contain drug-related information, such as DrugBank, may give hope
for the recommendation systems. However, the direct use of these knowledge
graphs in the systems suffers from robustness caused by the incompleteness of
the graphs. To address these challenges, we stand on recent advances in graph
embedding learning techniques and propose a novel framework, called Safe
Medicine Recommendation (SMR), in this paper. Specifically, SMR first
constructs a high-quality heterogeneous graph by bridging EMRs (MIMIC-III) and
medical knowledge graphs (ICD-9 ontology and DrugBank). Then, SMR jointly
embeds diseases, medicines, patients, and their corresponding relations into a
shared lower dimensional space. Finally, SMR uses the embeddings to decompose
the medicine recommendation into a link prediction process while considering
the patient's diagnoses and adverse drug reactions. To our best knowledge, SMR
is the first to learn embeddings of a patient-disease-medicine graph for
medicine recommendation in the world. Extensive experiments on real datasets
are conducted to evaluate the effectiveness of proposed framework.
","[{'version': 'v1', 'created': 'Mon, 16 Oct 2017 20:06:13 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Oct 2017 08:02:44 GMT'}, {'version': 'v3', 'created': 'Sun, 29 Nov 2020 05:51:23 GMT'}]",2020-12-01,"[['Gong', 'Fang', ''], ['Wang', 'Meng', ''], ['Wang', 'Haofen', ''], ['Wang', 'Sen', ''], ['Liu', 'Mengyue', '']]","['Knowledge Graph', 'Embeddings', 'Recommendation System', 'Drug Safety']"
19624,1403.8003,Fabian Rathke,"Fabian Rathke, Stefan Schmidt, Christoph Schn\""orr","Probabilistic Intra-Retinal Layer Segmentation in 3-D OCT Images Using
  Global Shape Regularization","Accepted for publication in Medical Image Analysis (MIA), Elsevier",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the introduction of spectral-domain optical coherence tomography (OCT),
resulting in a significant increase in acquisition speed, the fast and accurate
segmentation of 3-D OCT scans has become evermore important. This paper
presents a novel probabilistic approach, that models the appearance of retinal
layers as well as the global shape variations of layer boundaries. Given an OCT
scan, the full posterior distribution over segmentations is approximately
inferred using a variational method enabling efficient probabilistic inference
in terms of computationally tractable model components: Segmenting a full 3-D
volume takes around a minute. Accurate segmentations demonstrate the benefit of
using global shape regularization: We segmented 35 fovea-centered 3-D volumes
with an average unsigned error of 2.46 $\pm$ 0.22 {\mu}m as well as 80 normal
and 66 glaucomatous 2-D circular scans with errors of 2.92 $\pm$ 0.53 {\mu}m
and 4.09 $\pm$ 0.98 {\mu}m respectively. Furthermore, we utilized the inferred
posterior distribution to rate the quality of the segmentation, point out
potentially erroneous regions and discriminate normal from pathological scans.
No pre- or postprocessing was required and we used the same set of parameters
for all data sets, underlining the robustness and out-of-the-box nature of our
approach.
","[{'version': 'v1', 'created': 'Mon, 31 Mar 2014 14:10:03 GMT'}]",2014-04-01,"[['Rathke', 'Fabian', ''], ['Schmidt', 'Stefan', ''], ['Schnörr', 'Christoph', '']]","['Statistical shape model', 'Retinal layer segmentation', 'Pathologydetection', 'Optical coherence tomography']"
19625,1710.02013,Guillaume Bagan,"Guillaume Bagan and Fairouz Beggas and Mohammed Haddad and Hamamache
  Kheddouci",Complexity of Edge Monitoring on Some Graph Classes,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study the complexity of the edge monitoring problem. A
vertex $v$ monitors an edge $e$ if both extremities together with $v$ form a
triangle in the graph. Given a graph $G=(V,E)$ and a weight function on edges
$c$ where $c(e)$ is the number of monitors that needs the edge $e$, the problem
is to seek a minimum subset of monitors $S$ such that every edge $e$ in the
graph is monitored by at least $c(e)$ vertices in $S$. In this paper, we study
the edge monitoring problem on several graph classes such as complete graphs,
block graphs, cographs, split graphs, interval graphs and planar graphs. We
also generalize the problem by adding weights on vertices.
","[{'version': 'v1', 'created': 'Thu, 5 Oct 2017 13:36:01 GMT'}]",2017-10-06,"[['Bagan', 'Guillaume', ''], ['Beggas', 'Fairouz', ''], ['Haddad', 'Mohammed', ''], ['Kheddouci', 'Hamamache', '']]","['Edge monitoring', 'weighted edge monitoring', 'domination', 'complexity', 'algorithms', 'parameterized', 'approximation']"
19626,1310.0569,Sukhdilpreet Kaur,Sukhdilpreet Kaur and Amandeep Verma,Design of Generic Framework for Botnet Detection in Network Forensics,,"(IJCSIS) International Journal of Computer Science and Information
  Security volume 11 number 9 (2013) 38-45",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the raise in practice of Internet, in social, personal, commercial and
other aspects of life, the cybercrime is as well escalating at an alarming
rate. Such usage of Internet in diversified areas also augmented the illegal
activities, which in turn, bids many network attacks and threats. Network
forensics is used to detect the network attacks. This can be viewed as the
extension of network security. It is the technology, which detects and also
suggests prevention of the various network attacks. Botnet is one of the most
common attacks and is regarded as a network of hacked computers. It captures
the network packet, store it and then analyze and correlate to find the source
of attack. Various methods based on this approach for botnet detection are in
literature, but a generalized method is lacking. So, there is a requirement to
design a generic framework that can be used by any botnet detection. This
framework is of use for researchers, in the development of their own method of
botnet detection, by means of providing methodology and guidelines. In this
paper, various prevalent methods of botnet detection are studied, commonalities
among them are established and then a generalized model for the detection of
botnet is proposed. The proposed framework is described as UML diagrams.
","[{'version': 'v1', 'created': 'Wed, 2 Oct 2013 05:18:03 GMT'}]",2013-11-15,"[['Kaur', 'Sukhdilpreet', ''], ['Verma', 'Amandeep', '']]","['Network forensics', 'Botnets', 'Botnet detection methods', 'class diagrams', 'activity diagram']"
19627,0802.3328,Manas Patra,Manas K Patra and Yan Zhang,An Algebraic Characterization of Security of Cryptographic Protocols,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several of the basic cryptographic constructs have associated algebraic
structures. Formal models proposed by Dolev and Yao to study the
(unconditional) security of public key protocols form a group. The security of
some types of protocols can be neatly formulated in this algebraic setting. We
investigate classes of two-party protocols. We then consider extension of the
formal algebraic framework to private-key protocols. We also discuss concrete
realization of the formal models. In this case, we propose a definition in
terms of pseudo-free groups.
","[{'version': 'v1', 'created': 'Fri, 22 Feb 2008 14:40:27 GMT'}]",2008-02-25,"[['Patra', 'Manas K', ''], ['Zhang', 'Yan', '']]","['/Topics security', 'public key cryptosystem', 'free', 'pseudo-freegroups', 'monoids']"
19628,1510.01041,Gil Shapira,"Gil Shapira, Tal Hassner","GPU-Based Computation of 2D Least Median of Squares with Applications to
  Fast and Robust Line Detection",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The 2D Least Median of Squares (LMS) is a popular tool in robust regression
because of its high breakdown point: up to half of the input data can be
contaminated with outliers without affecting the accuracy of the LMS estimator.
The complexity of 2D LMS estimation has been shown to be $\Omega(n^2)$ where
$n$ is the total number of points. This high theoretical complexity along with
the availability of graphics processing units (GPU) motivates the development
of a fast, parallel, GPU-based algorithm for LMS computation. We present a CUDA
based algorithm for LMS computation and show it to be much faster than the
optimal state of the art single threaded CPU algorithm. We begin by describing
the proposed method and analyzing its performance. We then demonstrate how it
can be used to modify the well-known Hough Transform (HT) in order to
efficiently detect image lines in noisy images. Our method is compared with
standard HT-based line detection methods and shown to overcome their
shortcomings in terms of both efficiency and accuracy.
","[{'version': 'v1', 'created': 'Mon, 5 Oct 2015 06:38:03 GMT'}]",2015-10-06,"[['Shapira', 'Gil', ''], ['Hassner', 'Tal', '']]","['Robust Regression', 'LMS', 'GPGPU', 'Line Detection', 'Image']"
19629,1204.6070,Pavel Klav\'ik,"James Abello, Pavel Klav\'ik, Jan Kratochv\'il, Tom\'a\v{s}
  Vysko\v{c}il",MSOL Restricted Contractibility to Planar Graphs,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the computational complexity of graph planarization via edge
contraction. The problem CONTRACT asks whether there exists a set $S$ of at
most $k$ edges that when contracted produces a planar graph. We work with a
more general problem called $P$-RESTRICTEDCONTRACT in which $S$, in addition,
is required to satisfy a fixed MSOL formula $P(S,G)$. We give an FPT algorithm
in time $O(n^2 f(k))$ which solves $P$-RESTRICTEDCONTRACT, where $P(S,G)$ is
(i) inclusion-closed and (ii) inert contraction-closed (where inert edges are
the edges non-incident to any inclusion minimal solution $S$).
  As a specific example, we can solve the $\ell$-subgraph contractibility
problem in which the edges of a set $S$ are required to form disjoint connected
subgraphs of size at most $\ell$. This problem can be solved in time $O(n^2
f'(k,\ell))$ using the general algorithm. We also show that for $\ell \ge 2$
the problem is NP-complete.
","[{'version': 'v1', 'created': 'Thu, 26 Apr 2012 22:46:55 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Jun 2015 15:08:42 GMT'}, {'version': 'v3', 'created': 'Fri, 5 May 2017 09:21:14 GMT'}]",2017-05-08,"[['Abello', 'James', ''], ['Klavík', 'Pavel', ''], ['Kratochvíl', 'Jan', ''], ['Vyskočil', 'Tomáš', '']]","['planar graph', 'contraction', 'MSOL formula', 'FPT algorithm']"
19630,1702.02721,Genqiang Wu,Genqiang Wu and Xianyao Xia and Yeping He,Analytic Theory to Differential Privacy,,,,,cs.CR cs.DB math.GM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this paper is to develop a mathematical analysis theory to
solve differential privacy problems. The heart of our approaches is to use
analytic tools to characterize the correlations among the outputs of different
datasets, which makes it feasible to represent a differentially private
mechanism with minimal number of parameters. These results are then used to
construct differentially private mechanisms analytically. Furthermore, our
approaches are universal to almost all query functions. We believe that the
approaches and results of this paper are indispensable complements to the
current studies of differential privacy that are ruled by the ad hoc and
algorithmic approaches.
","[{'version': 'v1', 'created': 'Thu, 9 Feb 2017 06:34:19 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Apr 2017 13:41:08 GMT'}, {'version': 'v3', 'created': 'Mon, 29 Jan 2018 18:12:37 GMT'}]",2018-01-30,"[['Wu', 'Genqiang', ''], ['Xia', 'Xianyao', ''], ['He', 'Yeping', '']]","['differential privacy', 'analytic theory', 'universal mechanism', 'optimalmechanism']"
19631,1406.5760,Abm Moniruzzaman,"A B M Moniruzzaman, Kawser Wazed Nafi, Syed Akther Hossain","Virtual Memory Streaming Technique for Virtual Machines (VMs) for Rapid
  Scaling and High Performance in Cloud Environment","Keywords Virtual memory, Memory Streaming, Virtual machine, Virtual
  memory scaling, VM live migration, VM Cloning",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the impact of Virtual Memory Streaming (VMS) technique
in provisioning virtual machines (VMs) in cloud environment. VMS is a scaling
virtualization technology that allows different virtual machines rapid scale,
high performance, and increase hardware utilization. Traditional hypervisors do
not support true no-downtime live migration, and its lack of memory
oversubscription can hurt the economics of a private cloud deployment by
limiting the number of VMs on each host. VMS brings together several advanced
hypervisor memory management techniques including granular page sharing,
dynamic memory footprint management, live migration, read caching, and a unique
virtual machine cloning capability. An architecture model is described,
together with a proof-of-concept implementation, that VMS dynamically scaling
of virtualized infrastructure with true live migration and cloning of VMs. This
paper argues that VMS for Cloud allows requiring significantly reduced server
memory and reducing the time for virtualized resource scaling by instantly
adding more virtual machines.
","[{'version': 'v1', 'created': 'Sun, 22 Jun 2014 20:44:10 GMT'}]",2014-06-24,"[['Moniruzzaman', 'A B M', ''], ['Nafi', 'Kawser Wazed', ''], ['Hossain', 'Syed Akther', '']]","['Virtual memory', 'Memory Streaming', 'Virtual']"
19632,1603.03251,Tayeb Lemlouma,"Zaineb Liouane (ENIM - MONASTIR), Tayeb Lemlouma (IRISA-D2), Philippe
  Roose, Fr\'ed\'eric Weis (TACOMA), Messaoud Hassani (ENIM - MONASTIR)",A Markovian-based Approach for Daily Living Activities Recognition,"The International Conference on Sensor Networks (SENSORNETS'16), Feb
  2016, rome, Italy. Proceedings of theInternational Conference on Sensor
  Networks (SENSORNETS 2016), 2016",,,,cs.HC cs.AI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recognizing the activities of daily living plays an important role in
healthcare. It is necessary to use an adapted model to simulate the human
behavior in a domestic space to monitor the patient harmonically and to
intervene in the necessary time. In this paper, we tackle this problem using
the hierarchical hidden Markov model for representing and recognizing complex
indoor activities. We propose a new grammar, called ""Home By Room Activities
Language"", to facilitate the complexity of human scenarios and consider the
abnormal activities.
","[{'version': 'v1', 'created': 'Thu, 10 Mar 2016 13:09:57 GMT'}]",2016-03-11,"[['Liouane', 'Zaineb', '', 'ENIM - MONASTIR'], ['Lemlouma', 'Tayeb', '', 'IRISA-D2'], ['Roose', 'Philippe', '', 'TACOMA'], ['Weis', 'Frédéric', '', 'TACOMA'], ['Hassani', 'Messaoud', '', 'ENIM - MONASTIR']]","['Smart Home', 'Elderly Person', 'Home By Room Activities Language', 'Hierarchical and Hidden Markov Model', 'Activities', 'Scenarios', 'Prediction']"
19633,1002.1184,Vishal Goyal,"R. Shivakumar, R. Lakshmipathi","Implementation of an Innovative Bio Inspired GA and PSO Algorithm for
  Controller design considering Steam GT Dynamics","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 3, January 2010,
  http://ijcsi.org/articles/Implementation-of-an-Innovative-Bio-Inspired-GA-and-PSO-Algorithm-for-Controller-design-considering-Steam-GT-Dynamics.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 3, January 2010,
  http://ijcsi.org/articles/Implementation-of-an-Innovative-Bio-Inspired-GA-and-PSO-Algorithm-for-Controller-design-considering-Steam-GT-Dynamics.php",,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Application of Bio Inspired Algorithms to complicated Power System
Stability Problems has recently attracted the researchers in the field of
Artificial Intelligence. Low frequency oscillations after a disturbance in a
Power system, if not sufficiently damped, can drive the system unstable. This
paper provides a systematic procedure to damp the low frequency oscillations
based on Bio Inspired Genetic (GA) and Particle Swarm Optimization (PSO)
algorithms. The proposed controller design is based on formulating a System
Damping ratio enhancement based Optimization criterion to compute the optimal
controller parameters for better stability. The Novel and contrasting feature
of this work is the mathematical modeling and simulation of the Synchronous
generator model including the Steam Governor Turbine (GT) dynamics. To show the
robustness of the proposed controller, Non linear Time domain simulations have
been carried out under various system operating conditions. Also, a detailed
Comparative study has been done to show the superiority of the Bio inspired
algorithm based controllers over the Conventional Lead lag controller.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 10:27:13 GMT'}]",2010-02-08,"[['Shivakumar', 'R.', ''], ['Lakshmipathi', 'R.', '']]","['BioInspired Algorithms', 'Power System Optimization', 'Genetic Algorithm', 'Low frequency Oscillations', 'Particle Swarm Optimization']"
19634,1206.6177,Xiaolin Qin,"Xiaolin Qin, Wenyuan Wu, Yong Feng and Greg Reid",Structural analysis of high-index DAE for process simulation,13 pages,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with the structural analysis problem of dynamic lumped
process high-index DAE models. We consider two methods for index reduction of
such models by differentiation: Pryce's method and the symbolic differential
elimination algorithm rifsimp. Discussion and comparison of these methods are
given via a class of fundamental process simulation examples. In particular,
the efficiency of the Pryce method is illustrated as a function of the number
of tanks in process design.
","[{'version': 'v1', 'created': 'Wed, 27 Jun 2012 05:28:03 GMT'}]",2012-06-28,"[['Qin', 'Xiaolin', ''], ['Wu', 'Wenyuan', ''], ['Feng', 'Yong', ''], ['Reid', 'Greg', '']]","['differential algebraic equations', 'structural analysis', 'symbolic differential elimination', 'fast prolongation', 'linear programming problem']"
19635,1305.6211,Nisheeth Joshi,"Snigdha Paul, Nisheeth Joshi, Iti Mathur",Development of a Hindi Lemmatizer,"International Journal of Computational Linguistics and Natural
  Language Processing, Vol 2, Issue 5, 2013","International Journal of Computational Linguistics and Natural
  Language Processing, Vol 2, Issue 5, 2013",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We live in a translingual society, in order to communicate with people from
different parts of the world we need to have an expertise in their respective
languages. Learning all these languages is not at all possible; therefore we
need a mechanism which can do this task for us. Machine translators have
emerged as a tool which can perform this task. In order to develop a machine
translator we need to develop several different rules. The very first module
that comes in machine translation pipeline is morphological analysis. Stemming
and lemmatization comes under morphological analysis. In this paper we have
created a lemmatizer which generates rules for removing the affixes along with
the addition of rules for creating a proper root word.
","[{'version': 'v1', 'created': 'Fri, 24 May 2013 18:01:34 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Jul 2013 16:02:42 GMT'}]",2013-07-16,"[['Paul', 'Snigdha', ''], ['Joshi', 'Nisheeth', ''], ['Mathur', 'Iti', '']]","['lemmatizer', 'lemmatization', 'inflectional', 'derivational']"
19636,0906.1399,Alexander A. Sherstov,Alexander A. Sherstov,On Quantum-Classical Equivalence for Composed Communication Problems,Journal version,"Quantum Information & Computation, 10(5-6):435-455, 2010",,,cs.CC quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An open problem in communication complexity proposed by several authors is to
prove that for every Boolean function f, the task of computing f(x AND y) has
polynomially related classical and quantum bounded-error complexities. We solve
a variant of this question. For every f, we prove that the task of computing,
on input x and y, both of the quantities f(x AND y) and f(x OR y) has
polynomially related classical and quantum bounded-error complexities. We
further show that the quantum bounded-error complexity is polynomially related
to the classical deterministic complexity and the block sensitivity of f. This
result holds regardless of prior entanglement.
","[{'version': 'v1', 'created': 'Mon, 8 Jun 2009 01:00:23 GMT'}, {'version': 'v2', 'created': 'Sat, 22 Aug 2009 01:58:29 GMT'}, {'version': 'v3', 'created': 'Wed, 3 Feb 2010 14:15:33 GMT'}]",2010-02-03,"[['Sherstov', 'Alexander A.', '']]","['Quantum communication complexity', 'lower bounds', 'quantum-classicalequivalence', 'pattern matrix method', 'block sensitivity']"
19637,1609.04029,Zhi-Zhong Chen,"Zhi-Zhong Chen, Eita Machida, Lusheng Wang",A Cubic-Time 2-Approximation Algorithm for rSPR Distance,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Due to hybridization events in evolution, studying two different genes of a
set of species may yield two related but different phylogenetic trees for the
set of species. In this case, we want to measure the dissimilarity of the two
trees. The rooted subtree prune and regraft (rSPR) distance of the two trees
has been used for this purpose. The problem of computing the rSPR distance of
two given trees has many applications but is unfortunately NP-hard. The
previously best approximation algorithm for rSPR distance achieves a ratio of
2.5 and it was open whether a better approximation algorithm for rSPR distance
exists. In this paper, we answer this question in the affirmative by presenting
a cubic-time approximation algorithm for rSPR distance that achieves a ratio of
2. Our algorithm is based on the new notion of key and a number of new
structural lemmas. The algorithm is fairly simple and the proof of its
correctness is intuitively understandable albeit complicated.
","[{'version': 'v1', 'created': 'Tue, 13 Sep 2016 20:10:00 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Sep 2016 14:23:42 GMT'}, {'version': 'v3', 'created': 'Sat, 4 Mar 2017 09:33:45 GMT'}, {'version': 'v4', 'created': 'Sun, 2 Apr 2017 09:03:55 GMT'}, {'version': 'v5', 'created': 'Sun, 2 Jul 2017 07:35:17 GMT'}, {'version': 'v6', 'created': 'Thu, 27 Jul 2017 01:46:06 GMT'}]",2017-07-28,"[['Chen', 'Zhi-Zhong', ''], ['Machida', 'Eita', ''], ['Wang', 'Lusheng', '']]","['Phylogenetic tree', 'rSPR distance', 'approximation algorithm']"
19638,1712.06768,Shudong Liu,Shudong Liu,"User modeling for point-of-interest recommendations in location-based
  social networks: the state-of-the-art",,,,,cs.SI,http://creativecommons.org/publicdomain/zero/1.0/,"  The rapid growth of location-based services(LBSs)has greatly enriched
people's urban lives and attracted millions of users in recent years.
Location-based social networks(LBSNs)allow users to check-in at a physical
location and share daily tips on points-of-interest (POIs) with their friends
anytime and anywhere. Such check-in behavior can make daily real-life
experiences spread quickly through the Internet. Moreover, such check-in data
in LBSNs can be fully exploited to understand the basic laws of human daily
movement and mobility. This paper focuses on reviewing the taxonomy of user
modeling for POI recommendations through the data analysis of LBSNs. First, we
briefly introduce the structure and data characteristics of LBSNs,then we
present a formalization of user modeling for POI recommendations in LBSNs.
Depending on which type of LBSNs data was fully utilized in user modeling
approaches for POI recommendations, we divide user modeling algorithms into
four categories: pure check-in data-based user modeling, geographical
information-based user modeling, spatio-temporal information-based user
modeling, and geo-social information-based user modeling. Finally,summarizing
the existing works, we point out the future challenges and new directions in
five possible aspects
","[{'version': 'v1', 'created': 'Tue, 19 Dec 2017 03:43:44 GMT'}]",2017-12-27,"[['Liu', 'Shudong', '']]","['social networks', 'location-based services', 'point of interest', 'recommendation system', 'user profile', 'collaborative filtering', 'matrix factorization']"
19639,1212.2529,Francis Cabarle,"Francis George C. Cabarle, Kelvin C. Bu\~no, Henry N. Adorna",On The Delays In Spiking Neural P Systems,"Presented at the 6th Symposium on the Mathematical Aspects of
  Computer Science (SMACS2012), Boracay, Philippines. 6 figures, 6 pages, 2
  columns",,,,cs.NE cs.DC cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we extend and improve the results done in a previous work on
simulating Spiking Neural P systems (SNP systems in short) with delays using
SNP systems without delays. We simulate the former with the latter over
sequential, iteration, join, and split routing. Our results provide
constructions so that both systems halt at exactly the same time, start with
only one spike, and produce the same number of spikes to the environment after
halting.
","[{'version': 'v1', 'created': 'Tue, 11 Dec 2012 16:40:45 GMT'}]",2012-12-12,"[['Cabarle', 'Francis George C.', ''], ['Buño', 'Kelvin C.', ''], ['Adorna', 'Henry N.', '']]","['Membrane Computing', 'Spiking Neural P systems', 'delays', 'simulation', 'routing']"
19640,1701.03091,Besat Kassaie,Besat Kassaie,SPARQL over GraphX,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ability of the RDF data model to link data from heterogeneous domains has
led to an explosive growth of RDF data. So, evaluating SPARQL queries over
large RDF data has been crucial for the semantic web community. However, due to
the graph nature of RDF data, evaluating SPARQL queries in relational databases
and common data-parallel systems needs a lot of joins and is inefficient. On
the other hand, the enormity of datasets that are graph in nature such as
social network data, has led the database community to develop graph-parallel
processing systems to support iterative graph computations efficiently. In this
work we take advantage of the graph representation of RDF data and exploit
GraphX, a new graph processing system based on Spark. We propose a subgraph
matching algorithm, compatible with the GraphX programming model to evaluate
SPARQL queries. Some experiments are performed to show the system scalability
to handle large datasets.
","[{'version': 'v1', 'created': 'Wed, 11 Jan 2017 18:38:16 GMT'}]",2017-01-12,"[['Kassaie', 'Besat', '']]","['SPARQL', 'GraphX', 'Subgraph Matching']"
19641,1602.07264,Giancarlo Crocetti,"Giancarlo Crocetti, Michael Coakley, Phil Dressner, Wanda Kellum,
  Tamba Lamin",A Multivariate Biomarker for Parkinson's Disease,"5 pages, 4 figures, 3 tables, published at the Research Day at Pace
  University, New York. Proceedings of 12th Annual Research Day, 2014 - Pace
  University",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this study, we executed a genomic analysis with the objective of selecting
a set of genes (possibly small) that would help in the detection and
classification of samples from patients affected by Parkinson Disease. We
performed a complete data analysis and during the exploratory phase, we
selected a list of differentially expressed genes. Despite their association
with the diseased state, we could not use them as a biomarker tool. Therefore,
our research was extended to include a multivariate analysis approach resulting
in the identification and selection of a group of 20 genes that showed a clear
potential in detecting and correctly classify Parkinson Disease samples even in
the presence of other neurodegenerative disorders.
","[{'version': 'v1', 'created': 'Fri, 15 May 2015 00:55:17 GMT'}]",2016-02-24,"[['Crocetti', 'Giancarlo', ''], ['Coakley', 'Michael', ''], ['Dressner', 'Phil', ''], ['Kellum', 'Wanda', ''], ['Lamin', 'Tamba', '']]","['Genes', 'machine learning', 'data mining', 'multivariate']"
19642,1604.08693,Nurassyl Kerimbayev,"N. Kerimbayev, J. Kultan, S. Abdykarimova and A. Akramova","LMS Moodle: Distance international education in cooperation of higher
  education institutions of different countries","9 pages, 9 figures",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The development of international cooperation requires cooperation in the
sphere of education. An enhanced sharing of experience in the sphere of
practical teaching activities implies the increase of the quality of teaching
process and of scientific cooperation. Sharing of experience in educational
activities implies understanding among representatives of different nations
anywhere in the world. It means that through LSM teaching the principle of
social constructivism is realized, when participants together create a narrow
culture of common objects and senses. The article presents an example of
practical application of electronic media to the process of a real lesson. The
article describes the process of teaching students from different countries
using the system of LMS MOODLE, beginning with preparing study materials,
giving lectures by foreign lecturers, practical tasks and ending with passing
an examination. Training has included some full-time students from the Slovak
Republic, the Republic of Dagestan and the Republic of Kazakhstan, and has been
realized by applying the method of distance learning (LMS).
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2016 05:32:44 GMT'}]",2016-05-02,"[['Kerimbayev', 'N.', ''], ['Kultan', 'J.', ''], ['Abdykarimova', 'S.', ''], ['Akramova', 'A.', '']]","['international distance learning', 'LMS Moodle', 'exam remote method', 'international cooperation in training', 'virtual learning environment.  1']"
19643,1511.08605,Bruno Courcelle,Bruno Courcelle (LaBRI),Fly-automata for checking MSO 2 graph properties,Submitted for publication in December 2015,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A more descriptive but too long title would be : Constructing fly-automata to
check properties of graphs of bounded tree-width expressed by monadic
second-order formulas written with edge quantifications. Such properties are
called MSO2 in short. Fly-automata (FA) run bottom-up on terms denoting graphs
and compute ""on the fly"" the necessary states and transitions instead of
looking into huge, actually unimplementable tables. In previous works, we have
constructed FA that process terms denoting graphs of bounded clique-width, in
order to check their monadic second-order (MSO) properties (expressed by
formulas without edge quan-tifications). Here, we adapt these FA to incidence
graphs, so that they can check MSO2 properties of graphs of bounded tree-width.
This is possible because: (1) an MSO2 property of a graph is nothing but an MSO
property of its incidence graph and (2) the clique-width of the incidence graph
of a graph is linearly bounded in terms of its tree-width. Our constructions
are actually implementable and usable. We detail concrete constructions of
automata in this perspective.
","[{'version': 'v1', 'created': 'Fri, 27 Nov 2015 10:19:43 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Dec 2015 09:13:45 GMT'}]",2015-12-23,"[['Courcelle', 'Bruno', '', 'LaBRI']]","['monadic second-order logic', 'edge quantification', 'tree-width', 'clique-width', 'algorithmic meta-theorem', 'fly-automaton']"
19644,0705.1450,Damien Chablat,"Mazen Zein (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)","An Algorithm for Computing Cusp Points in the Joint Space of 3-RPR
  Parallel Manipulators",,European Conference on Mechanism Sciences (21/02/2006) 1-12,,,cs.RO,,"  This paper presents an algorithm for detecting and computing the cusp points
in the joint space of 3-RPR planar parallel manipulators. In manipulator
kinematics, cusp points are special points, which appear on the singular curves
of the manipulators. The nonsingular change of assembly mode of 3-RPR parallel
manipulators was shown to be associated with the existence of cusp points. At
each of these points, three direct kinematic solutions coincide. In the
literature, a condition for the existence of three coincident direct kinematic
solutions was established, but has never been exploited, because the algebra
involved was too complicated to be solved. The algorithm presented in this
paper solves this equation and detects all the cusp points in the joint space
of these manipulators.
","[{'version': 'v1', 'created': 'Thu, 10 May 2007 12:10:12 GMT'}]",2007-05-23,"[['Zein', 'Mazen', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN'], ['Chablat', 'Damien', '', 'IRCCyN']]","['Cusp points', '3-RPR parallel manipulator', 'singularity', 'joint space', 'assembly mode']"
19645,1312.6146,Michael Fink,"Canan G\""uni\c{c}en, Esra Erdem and H\""usn\""u Yenig\""un",Generating Shortest Synchronizing Sequences using Answer Set Programming,"Proceedings of Answer Set Programming and Other Computing Paradigms
  (ASPOCP 2013), 6th International Workshop, August 25, 2013, Istanbul, Turkey",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For a finite state automaton, a synchronizing sequence is an input sequence
that takes all the states to the same state. Checking the existence of a
synchronizing sequence and finding a synchronizing sequence, if one exists, can
be performed in polynomial time. However, the problem of finding a shortest
synchronizing sequence is known to be NP-hard. In this work, the usefulness of
Answer Set Programming to solve this optimization problem is investigated, in
comparison with brute-force algorithms and SAT-based approaches.
  Keywords: finite automata, shortest synchronizing sequence, ASP
","[{'version': 'v1', 'created': 'Fri, 20 Dec 2013 21:30:10 GMT'}]",2013-12-24,"[['Güniçen', 'Canan', ''], ['Erdem', 'Esra', ''], ['Yenigün', 'Hüsnü', '']]","['finite automata', 'shortest synchronizing sequence', 'ASP']"
19646,0708.0846,Amir Leshem,Amir Leshem and Ephi Zehavi,Cooperative game theory and the Gaussian interference channel,,,,,cs.IT cs.GT math.IT,,"  In this paper we discuss the use of cooperative game theory for analyzing
interference channels. We extend our previous work, to games with N players as
well as frequency selective channels and joint TDM/FDM strategies.
  We show that the Nash bargaining solution can be computed using convex
optimization techniques. We also show that the same results are applicable to
interference channels where only statistical knowledge of the channel is
available. Moreover, for the special case of two players $2\times K$ frequency
selective channel (with K frequency bins) we provide an $O(K \log_2 K)$
complexity algorithm for computing the Nash bargaining solution under mask
constraint and using joint FDM/TDM strategies. Simulation results are also
provided.
","[{'version': 'v1', 'created': 'Mon, 6 Aug 2007 21:47:10 GMT'}]",2007-08-08,"[['Leshem', 'Amir', ''], ['Zehavi', 'Ephi', '']]","['Spectrum optimization', 'distributed coordination', 'game theory', 'Nash bargaining solution', 'interference']"
19647,1610.04421,"Frank D\""urr","Frank D\""urr and Thomas Kohler and Jonas Grunert and Andre Kutzleb","ZeroSDN: A Message Bus for Flexible and Light-weight Network Control
  Distribution in SDN",,,,TR-2016-06,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent years have seen an evolution of SDN control plane architectures,
starting from simple monolithic controllers, over modular monolithic
controllers, to distributed controllers. We observe, however, that today's
distributed controllers still exhibit inflexibility with respect to the
distribution of control logic. Therefore, we propose a novel architecture of a
distributed SDN controller in this paper, providing maximum flexibility with
respect to distribution.
  Our architecture splits control logic into light-weight control modules,
called controllets, based on a micro-kernel approach, reducing common
controllet functionality to a bare minimum and factoring out all higher-level
functionality. Light-weight controllets also allow for pushing control logic
onto switches to minimize latency and communication overhead. Controllets are
interconnected through a message bus supporting the publish/subscribe
communication paradigm with specific extensions for content-based OpenFlow
message filtering. Publish/subscribe allows for complete decoupling of
controllets to further facilitate control plane distribution.
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2016 12:00:13 GMT'}]",2016-10-17,"[['Dürr', 'Frank', ''], ['Kohler', 'Thomas', ''], ['Grunert', 'Jonas', ''], ['Kutzleb', 'Andre', '']]","['software-defined networking', 'control plane', 'distribution', 'message bus', 'architecture', 'publish/subscribe']"
19648,1502.06221,Yi Lu,Yi Lu,Sampling with Walsh Transforms,in preparation for submission,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the advent of massive data outputs at a regular rate, admittedly, signal
processing technology plays an increasingly key role. Nowadays, signals are not
merely restricted to physical sources, they have been extended to digital
sources as well.
  Under the general assumption of discrete statistical signal sources, we
propose a practical problem of sampling incomplete noisy signals for which we
do not know a priori and the sample size is bounded. We approach this sampling
problem by Shannon's channel coding theorem. We use an extremal binary channel
with high probability of transmission error, which is rare in communication
theory. Our main result demonstrates that it is the large Walsh coefficient(s)
that characterize(s) discrete statistical signals, regardless of the signal
sources. Note that this is a known fact in specific application domains such as
images. By the connection of Shannon's theorem, we establish the necessary and
sufficient condition for our generic sampling problem for the first time.
Finally, we discuss the cryptographic significance of sparse Walsh transform.
","[{'version': 'v1', 'created': 'Sun, 22 Feb 2015 13:38:37 GMT'}, {'version': 'v2', 'created': 'Wed, 17 Jun 2015 09:29:03 GMT'}, {'version': 'v3', 'created': 'Sun, 26 Jul 2015 15:30:24 GMT'}]",2015-07-28,"[['Lu', 'Yi', '']]","['Walsh transform', 'Shannon’s channel coding theorem', 'channel capacity', 'extremal binary channel', 'generic sampling']"
19649,1705.09064,Dongyu Meng,"Dongyu Meng, Hao Chen",MagNet: a Two-Pronged Defense against Adversarial Examples,"Accepted at the ACM Conference on Computer and Communications
  Security (CCS), 2017",,,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep learning has shown promising results on hard perceptual problems in
recent years. However, deep learning systems are found to be vulnerable to
small adversarial perturbations that are nearly imperceptible to human. Such
specially crafted perturbations cause deep learning systems to output incorrect
decisions, with potentially disastrous consequences. These vulnerabilities
hinder the deployment of deep learning systems where safety or security is
important. Attempts to secure deep learning systems either target specific
attacks or have been shown to be ineffective.
  In this paper, we propose MagNet, a framework for defending neural network
classifiers against adversarial examples. MagNet does not modify the protected
classifier or know the process for generating adversarial examples. MagNet
includes one or more separate detector networks and a reformer network.
Different from previous work, MagNet learns to differentiate between normal and
adversarial examples by approximating the manifold of normal examples. Since it
does not rely on any process for generating adversarial examples, it has
substantial generalization power. Moreover, MagNet reconstructs adversarial
examples by moving them towards the manifold, which is effective for helping
classify adversarial examples with small perturbation correctly. We discuss the
intrinsic difficulty in defending against whitebox attack and propose a
mechanism to defend against graybox attack. Inspired by the use of randomness
in cryptography, we propose to use diversity to strengthen MagNet. We show
empirically that MagNet is effective against most advanced state-of-the-art
attacks in blackbox and graybox scenarios while keeping false positive rate on
normal examples very low.
","[{'version': 'v1', 'created': 'Thu, 25 May 2017 06:49:57 GMT'}, {'version': 'v2', 'created': 'Mon, 11 Sep 2017 02:41:15 GMT'}]",2017-09-12,"[['Meng', 'Dongyu', ''], ['Chen', 'Hao', '']]","['adversarial example', 'neural network', 'autoencoder']"
19650,1106.2695,Duc Phu Chau,"Duc Phu Chau (INRIA Sophia Antipolis), Fran\c{c}ois Bremond (INRIA
  Sophia Antipolis), Monique Thonnat (INRIA Sophia Antipolis), Etienne Corvee
  (INRIA Sophia Antipolis)","Robust Mobile Object Tracking Based on Multiple Feature Similarity and
  Trajectory Filtering",,"The International Conference on Computer Vision Theory and
  Applications (VISAPP) (2011)",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new algorithm to track mobile objects in different
scene conditions. The main idea of the proposed tracker includes estimation,
multi-features similarity measures and trajectory filtering. A feature set
(distance, area, shape ratio, color histogram) is defined for each tracked
object to search for the best matching object. Its best matching object and its
state estimated by the Kalman filter are combined to update position and size
of the tracked object. However, the mobile object trajectories are usually
fragmented because of occlusions and misdetections. Therefore, we also propose
a trajectory filtering, named global tracker, aims at removing the noisy
trajectories and fusing the fragmented trajectories belonging to a same mobile
object. The method has been tested with five videos of different scene
conditions. Three of them are provided by the ETISEO benchmarking project
(http://www-sop.inria.fr/orion/ETISEO) in which the proposed tracker
performance has been compared with other seven tracking algorithms. The
advantages of our approach over the existing state of the art ones are: (i) no
prior knowledge information is required (e.g. no calibration and no contextual
models are needed), (ii) the tracker is more reliable by combining multiple
feature similarities, (iii) the tracker can perform in different scene
conditions: single/several mobile objects, weak/strong illumination,
indoor/outdoor scenes, (iv) a trajectory filtering is defined and applied to
improve the tracker performance, (v) the tracker performance outperforms many
algorithms of the state of the art.
","[{'version': 'v1', 'created': 'Tue, 14 Jun 2011 12:45:05 GMT'}]",2011-06-15,"[['Chau', 'Duc Phu', '', 'INRIA Sophia Antipolis'], ['Bremond', 'François', '', 'INRIA\n  Sophia Antipolis'], ['Thonnat', 'Monique', '', 'INRIA Sophia Antipolis'], ['Corvee', 'Etienne', '', 'INRIA Sophia Antipolis']]","['Tracking algorithm', 'trajectory filter', 'global tracker', 'tracking evaluation']"
19651,1406.7483,Alicia Gonz\'alez Mart\'inez,"Alicia Gonzalez Martinez, Susana Lopez Hervas, Doaa Samy, Carlos G.
  Arques, Antonio Moreno Sandoval","Jabalin: a Comprehensive Computational Model of Modern Standard Arabic
  Verbal Morphology Based on Traditional Arabic Prosody","Jabalin implementation is available at
  http://sourceforge.net/projects/jabalin/","Systems and Frameworks for Computational Morphology, Springer
  Berlin Heidelberg, (2013) pp. 35-52",,,cs.CL,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The computational handling of Modern Standard Arabic is a challenge in the
field of natural language processing due to its highly rich morphology.
However, several authors have pointed out that the Arabic morphological system
is in fact extremely regular. The existing Arabic morphological analyzers have
exploited this regularity to variable extent, yet we believe there is still
some scope for improvement. Taking inspiration in traditional Arabic prosody,
we have designed and implemented a compact and simple morphological system
which in our opinion takes further advantage of the regularities encountered in
the Arabic morphological system. The output of the system is a large-scale
lexicon of inflected forms that has subsequently been used to create an Online
Interface for a morphological analyzer of Arabic verbs. The Jabalin Online
Interface is available at http://elvira.lllf.uam.es/jabalin/, hosted at the
LLI-UAM lab. The generation system is also available under a GNU GPL 3 license.
","[{'version': 'v1', 'created': 'Sun, 29 Jun 2014 10:08:54 GMT'}]",2014-07-01,"[['Martinez', 'Alicia Gonzalez', ''], ['Hervas', 'Susana Lopez', ''], ['Samy', 'Doaa', ''], ['Arques', 'Carlos G.', ''], ['Sandoval', 'Antonio Moreno', '']]","['Computational morphology', 'Arabic', 'Arabic morphological system', 'Modern Standard Arabic', 'traditionalArabic prosody']"
19652,1306.5507,Pallab  Dutta Mr,Pallab Dutta,Java Card for PayTv Application,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smart cards are widely used along with PayTV receivers to store secret user
keys and to perform security functions to prevent any unauthorized viewing of
PayTV channels. Java Card technology enables programs written in the Java
programming language to run on smart cards. Smart cards represent one of the
smallest computing platforms in use today. The memory configuration of a smart
card are of the order of 4K of RAM, 72K of EEPROM, and 24K of ROM. Using Java
card provides advantages to the industry in terms of ease of coding, faster
time to market and faster upgrades as compared to plain smart cards . Also
different applications like payTV, e-commerce, health-card can easily be
implemented in a single java card as multiple applets corresponding to each
application can coexists in a single java card. But there are security concerns
in java cards and also the performance issues. In this paper, we analyse the
suitability of using Java card for PayTV applications as part of conditional
access system in place of plain smart cards.
","[{'version': 'v1', 'created': 'Mon, 24 Jun 2013 04:01:52 GMT'}]",2013-06-25,"[['Dutta', 'Pallab', '']]","['Smart Card', 'Java Card', 'PayTV', 'Conditional Access']"
19653,1712.05090,Yunkai Liu,"Zhao-Hui Du, Zhiwei Ying, Zhenke Ma, Yufei Mai, Phoebe Wang, Jesse Liu
  and Jesse Fang",Secure Encrypted Virtualization is Unsecure,"10 pages, 16 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Virtualization has become more important since cloud computing is getting
more and more popular than before. There is an increasing demand for security
among the cloud customers. AMD plans to provide Secure Encrypted Virtualization
(SEV) technology in its latest processor EPYC to protect virtual machines by
encrypting its memory but without integrity protection. In this paper, we
analyzed the weakness in the SEV design due to lack of integrity protection
thus it is not so secure. Using different design flaw in physical address-based
tweak algorithm to protect against ciphertext block move attacks, we found a
realistic attack against SEV which could obtain the root privilege of an
encrypted virtual machine protected by SEV. A demo to simulate the attack
against a virtual machine protected by SEV is done in a Ryzen machine which
supports Secure Memory Encryption (SME) technology since SEV enabled machine is
still not available in market.
","[{'version': 'v1', 'created': 'Thu, 14 Dec 2017 04:16:56 GMT'}]",2017-12-15,"[['Du', 'Zhao-Hui', ''], ['Ying', 'Zhiwei', ''], ['Ma', 'Zhenke', ''], ['Mai', 'Yufei', ''], ['Wang', 'Phoebe', ''], ['Liu', 'Jesse', ''], ['Fang', 'Jesse', '']]","['\u200bHypervisor', 'SEV', 'Nested Page Table', 'Guest Page']"
19654,1407.7314,Wu-Chen Su,Wu-Chen Su,"A Preliminary Survey of Knowledge Discovery on Smartphone Applications
  (apps): Principles, Techniques and Research Directions for E-health","6 pages, 2 figures, 2 tables, 2014 ICME International Conference on
  Complex Medical Engineering",,,,cs.CY cs.HC cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  People usually seek out varied information to deal with their health
problems. However, the large volume of information available may present
challenges for the public to distinguish good from suboptimal advice. How to
ensure the right information for the right person at the right time and place
has always been a challenge. For example, smart phone application vendor
markets provide a varied selection of health applications for users. However,
there is a lack of substantive reference information for consumers to base
well-informed decisions about whether or not to adopt the applications they
review and to ascertain the validity of the information provided by these
e-health solutions. Thus, this study aims to review the existing relevant
research about smart phone applications and identify pertinent research
questions in the field of knowledge discovery for health applications that can
be addressed in future research. Therefore, this study can be seen as an
important step for researchers to explore this domain and extend our work for
the well-being of public.
","[{'version': 'v1', 'created': 'Mon, 28 Jul 2014 03:49:34 GMT'}]",2014-07-29,"[['Su', 'Wu-Chen', '']]","['selected were “review“', '“apps”', '“health”', '(“Android” or “Apple”)']"
19655,1304.5336,Thomas Dover,Thomas P. Dover,Legacy Forensics: An Emerging Challenge,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the passage of time and as new types of storage devices are introduced
into the marketplace, contemporary devices will slowly lose their compatibility
with current operating systems and PC hardware. As a result, such legacy
devices will pose an analytical challenge to the field of digital forensics.
Dated technology, while still fully functional, is becoming increasingly
incompatible with most contemporary computing hardware and software and thus
cannot be properly examined in present-day digital forensic environments. This
fact will not be lost on those who utilize legacy hardware to commit criminal
acts. This paper describes the technical challenge of accessing legacy devices
by describing an effort to resuscitate a Bernoulli Drive, a portable storage
device manufactured in 1983 by Iomega Corporation. A number of lessons-learned
are provided and the implication of legacy devices to digital forensic science
is discussed.
","[{'version': 'v1', 'created': 'Fri, 19 Apr 2013 08:26:01 GMT'}]",2013-04-22,"[['Dover', 'Thomas P.', '']]","['Computer Forensics', 'Digital Forensics', 'Legacy Forensics', 'Iomega', 'Bernoulli Drive']"
19656,1205.2200,Murphy Choy,Murphy Choy and Michelle Cheong,A Greedy Double Swap Heuristic for Nurse Scheduling,,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the key challenges of nurse scheduling problem (NSP) is the number of
constraints placed on preparing the timetable, both from the regulatory
requirements as well as the patients' demand for the appropriate nursing care
specialists. In addition, the preferences of the nursing staffs related to
their work schedules add another dimension of complexity. Most solutions
proposed for solving nurse scheduling involve the use of mathematical
programming and generally considers only the hard constraints. However, the
psychological needs of the nurses are ignored and this resulted in subsequent
interventions by the nursing staffs to remedy any deficiency and often results
in last minute changes to the schedule. In this paper, we present a staff
preference optimization framework which is solved with a greedy double swap
heuristic. The heuristic yields good performance in speed at solving the
problem. The heuristic is simple and we will demonstrate its performance by
implementing it on open source spreadsheet software.
","[{'version': 'v1', 'created': 'Thu, 10 May 2012 08:54:57 GMT'}]",2012-06-18,"[['Choy', 'Murphy', ''], ['Cheong', 'Michelle', '']]","['Nursing Scheduling', 'Mathematical Programming', 'Swapping Algorithm', 'Optimization Framework']"
19657,1306.1572,Louis Theran,"James Farre, Helena Kleinschmidt, Jessica Sidman, Audrey Lee-St.John,
  Stephanie Stark, Louis Theran, and Xilin Yu",Algorithms for detecting dependencies and rigid subsystems for CAD,"37 pages, 14 figures (v2 is an expanded version of an AGD'14 abstract
  based on v1)",,,,cs.CG math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Geometric constraint systems underly popular Computer Aided Design soft-
ware. Automated approaches for detecting dependencies in a design are critical
for developing robust solvers and providing informative user feedback, and we
provide algorithms for two types of dependencies. First, we give a pebble game
algorithm for detecting generic dependencies. Then, we focus on identifying the
""special positions"" of a design in which generically independent constraints
become dependent. We present combinatorial algorithms for identifying subgraphs
associated to factors of a particular polynomial, whose vanishing indicates a
special position and resulting dependency. Further factoring in the Grassmann-
Cayley algebra may allow a geometric interpretation giving conditions (e.g.,
""these two lines being parallel cause a dependency"") determining the special
position.
","[{'version': 'v1', 'created': 'Thu, 6 Jun 2013 23:15:06 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Oct 2015 22:03:58 GMT'}]",2015-10-05,"[['Farre', 'James', ''], ['Kleinschmidt', 'Helena', ''], ['Sidman', 'Jessica', ''], ['John', 'Audrey Lee-St.', ''], ['Stark', 'Stephanie', ''], ['Theran', 'Louis', ''], ['Yu', 'Xilin', '']]","['sparsity matroid', 'pebble game algorithm', 'cad constraints']"
19658,0806.1361,Mariano Rico,"Mariano Rico, David Camacho, and Oscar Corcho","VPOET: Using a Distributed Collaborative Platform for Semantic Web
  Applications","accepted for the 2nd International Symposium on Intelligent
  Distributed Computing - IDC'2008. September 18-20, 2008, Catania, Italy",,,,cs.SE cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a distributed collaborative wiki-based platform that has
been designed to facilitate the development of Semantic Web applications. The
applications designed using this platform are able to build semantic data
through the cooperation of different developers and to exploit that semantic
data. The paper shows a practical case study on the application VPOET, and how
an application based on Google Gadgets has been designed to test VPOET and let
human users exploit the semantic data created. This practical example can be
used to show how different Semantic Web technologies can be integrated into a
particular Web application, and how the knowledge can be cooperatively
improved.
","[{'version': 'v1', 'created': 'Mon, 9 Jun 2008 00:39:08 GMT'}]",2008-06-10,"[['Rico', 'Mariano', ''], ['Camacho', 'David', ''], ['Corcho', 'Oscar', '']]","['Distributed collaborative systems', 'Semantic Web', 'Wiki architectures']"
19659,1505.05226,M. Tarek Ibn Ziad Eng.,"M. Tarek Ibn Ziad, Amr Alanwar, Yousra Alkabani, M. Watheq El-Kharashi
  and Hassan Bedour",Homomorphic Data Isolation for Hardware Trojan Protection,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The interest in homomorphic encryption/decryption is increasing due to its
excellent security properties and operating facilities. It allows operating on
data without revealing its content. In this work, we suggest using homomorphism
for Hardware Trojan protection. We implement two partial homomorphic designs
based on ElGamal encryption/decryption scheme. The first design is a
multiplicative homomorphic, whereas the second one is an additive homomorphic.
We implement the proposed designs on a low-cost Xilinx Spartan-6 FPGA. Area
utilization, delay, and power consumption are reported for both designs.
Furthermore, we introduce a dual-circuit design that combines the two earlier
designs using resource sharing in order to have minimum area cost. Experimental
results show that our dual-circuit design saves 35% of the logic resources
compared to a regular design without resource sharing. The saving in power
consumption is 20%, whereas the number of cycles needed remains almost the same
","[{'version': 'v1', 'created': 'Wed, 20 May 2015 02:25:51 GMT'}, {'version': 'v2', 'created': 'Thu, 21 May 2015 02:18:58 GMT'}]",2015-05-22,"[['Ziad', 'M. Tarek Ibn', ''], ['Alanwar', 'Amr', ''], ['Alkabani', 'Yousra', ''], ['El-Kharashi', 'M. Watheq', ''], ['Bedour', 'Hassan', '']]","['ElGamalEncryption', 'HardwareTrojan', 'Homomorphism', 'Security']"
19660,1504.05158,Piotr Szwed PhD,Piotr Szwed and Wojciech Chmiel,"Multi-swarm PSO algorithm for the Quadratic Assignment Problem: a
  massive parallel implementation on the OpenCL platform",2 tables 6 figures,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a multi-swarm PSO algorithm for the Quadratic Assignment
Problem (QAP) implemented on OpenCL platform. Our work was motivated by results
of time efficiency tests performed for single-swarm algorithm implementation
that showed clearly that the benefits of a parallel execution platform can be
fully exploited, if the processed population is large. The described algorithm
can be executed in two modes: with independent swarms or with migration. We
discuss the algorithm construction, as well as we report results of tests
performed on several problem instances from the QAPLIB library. During the
experiments the algorithm was configured to process large populations. This
allowed us to collect statistical data related to values of goal function
reached by individual particles. We use them to demonstrate on two test cases
that although single particles seem to behave chaotically during the
optimization process, when the whole population is analyzed, the probability
that a particle will select a near-optimal solution grows.
","[{'version': 'v1', 'created': 'Mon, 20 Apr 2015 18:58:08 GMT'}]",2015-04-21,"[['Szwed', 'Piotr', ''], ['Chmiel', 'Wojciech', '']]","['QAP', 'PSO', 'OpenCL', 'GPU calculation', 'particle swarmoptimization', 'mulit-swarm', 'discrete optimization']"
19661,1309.7261,Ahmed Abbasi,Ahmed Abbasi and Hsinchun Chen,"Detecting Fake Escrow Websites using Rich Fraud Cues and Kernel Based
  Methods",,"Abbasi, A. and Chen, H. ""Detecting Fake Escrow Websites using Rich
  Fraud Cues and Kernel Based Methods,"" In Proceedings of the 17th Annual
  Workshop on Information Technologies and Systems, Montreal, Canada, December
  8-9, 2007, pp. 55-60",,,cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The ability to automatically detect fraudulent escrow websites is important
in order to alleviate online auction fraud. Despite research on related topics,
fake escrow website categorization has received little attention. In this study
we evaluated the effectiveness of various features and techniques for detecting
fake escrow websites. Our analysis included a rich set of features extracted
from web page text, image, and link information. We also proposed a composite
kernel tailored to represent the properties of fake websites, including content
duplication and structural attributes. Experiments were conducted to assess the
proposed features, techniques, and kernels on a test bed encompassing nearly
90,000 web pages derived from 410 legitimate and fake escrow sites. The
combination of an extended feature set and the composite kernel attained over
98% accuracy when differentiating fake sites from real ones, using the support
vector machines algorithm. The results suggest that automated web-based
information systems for detecting fake escrow sites could be feasible and may
be utilized as authentication mechanisms.
","[{'version': 'v1', 'created': 'Fri, 27 Sep 2013 15:04:05 GMT'}]",2013-09-30,"[['Abbasi', 'Ahmed', ''], ['Chen', 'Hsinchun', '']]","['Online escrow services', 'internet fraud', 'website classification', 'kernel-based methods']"
19662,1610.09679,Carlo Comin,"Carlo Comin, Romeo Rizzi",Linear-Time Safe-Alternating DFS and SCCs,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An alternating graph is a directed graph whose vertex set is partitioned into
two classes, existential and universal. This forms the basic arena for a
plethora of infinite duration two-player games where Player~$\square$
and~$\ocircle$ alternate in a turn-based sliding of a pebble along the arcs
they control. We study alternating strongly-connectedness as a generalization
of strongly-connectedness in directed graphs, aiming at providing a linear time
decomposition and a sound structural graph characterization. For this a refined
notion of alternating reachability is introduced: Player~$\square$ attempts to
reach vertices without leaving a prescribed subset of the vertices, while
Player~$\ocircle$ works against. This is named \emph{safe alternating
reachability}. It is shown that every arena uniquely decomposes into safe
alternating strongly-connected components where Player~$\square$ can visit each
vertex within a given component infinitely often, without having to ever leave
out the component itself. Our main result is a linear time algorithm for
computing this alternating graph decomposition. Both the underlying graph
structures and the algorithm generalize the classical decomposition of a
directed graph into strongly-connected components. The algorithm builds on a
linear time generalization of the depth-first search on alternation, taking
inspiration from Tarjan 1972 machinery. Our theory has direct applications in
solving well-known infinite duration pebble games faster. Dinneen and
Khoussainov showed in 1999 that deciding a given Update Game costs $O(mn)$
time, where $n$ is the number of vertices and $m$ is that of arcs. We solve the
task in $\Theta(m+n)$ linear~time. The complexity of Explicit
McNaughton-M\""uller Games also improves from cubic to quadratic.
","[{'version': 'v1', 'created': 'Sun, 30 Oct 2016 17:22:00 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Nov 2016 20:23:11 GMT'}, {'version': 'v3', 'created': 'Tue, 22 Nov 2016 13:07:27 GMT'}, {'version': 'v4', 'created': 'Mon, 28 Nov 2016 11:01:58 GMT'}, {'version': 'v5', 'created': 'Sun, 9 Jun 2019 10:18:10 GMT'}, {'version': 'v6', 'created': 'Fri, 5 Jun 2020 21:19:02 GMT'}, {'version': 'v7', 'created': 'Wed, 10 Jun 2020 16:46:03 GMT'}, {'version': 'v8', 'created': 'Sat, 5 Dec 2020 16:40:48 GMT'}, {'version': 'v9', 'created': 'Sun, 13 Feb 2022 17:07:15 GMT'}]",2022-02-15,"[['Comin', 'Carlo', ''], ['Rizzi', 'Romeo', '']]","['Alternation', 'Infinite Games', 'Linear-Time Algorithm', 'McNaughton-M¨uller Games', 'DepthFirst Search', 'Strongly-Connected Components', 'Update Games', 'Update Networks']"
19663,1009.0451,Fabien Tence,"Fabien Tenc\'e (LISYC), C\'edric Buche (LISYC), Pierre De Loor
  (LISYC), Olivier Marc (LISYC)","The Challenge of Believability in Video Games: Definitions, Agents
  Models and Imitation Learning",,"GAMEON-ASIA'2010, France (2010)",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we address the problem of creating believable agents (virtual
characters) in video games. We consider only one meaning of believability,
``giving the feeling of being controlled by a player'', and outline the problem
of its evaluation. We present several models for agents in games which can
produce believable behaviours, both from industry and research. For high level
of believability, learning and especially imitation learning seems to be the
way to go. We make a quick overview of different approaches to make video
games' agents learn from players. To conclude we propose a two-step method to
develop new models for believable agents. First we must find the criteria for
believability for our application and define an evaluation method. Then the
model and the learning algorithm can be designed.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2010 15:25:06 GMT'}]",2010-09-03,"[['Tencé', 'Fabien', '', 'LISYC'], ['Buche', 'Cédric', '', 'LISYC'], ['De Loor', 'Pierre', '', 'LISYC'], ['Marc', 'Olivier', '', 'LISYC']]","['Adaptive decision making', 'believability', 'human-like', 'evaluation', 'imitation learning', 'video games']"
19664,1401.6988,Marcos Portnoi,Marcos Portnoi,Criptografia com Curvas El\'ipticas,"Portuguese, 14 pages",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an overview of the use of elliptic curves in
cryptography. The security of this cryptosystem is based on the discrete
logarithm problem, which appears to be much harder compared to the discrete
logarithm problem in other cryptosystems. An overview of common cryptosystems
is given, such as Diffie-Hellman and RSA, and an elliptic curve cryptography
scheme is discussed.
  --------
  Este trabalho apresenta o uso das curvas el\'ipticas em criptografia. Sua
seguran\c{c}a est\'a baseada no problema do logaritmo discreto. Este problema
aparentemente \'e significativamente mais dif\'icil de resolver, comparado com
o problema do logaritmo discreto usado por outros sistemas de criptografia. \'E
dada uma vis\~ao geral de sistemas de criptografia comuns, como Diffie-Hellman
e RSA, e discute-se um esquema de criptografia usando curvas el\'ipticas.
","[{'version': 'v1', 'created': 'Mon, 27 Jan 2014 20:15:17 GMT'}]",2014-01-28,"[['Portnoi', 'Marcos', '']]","['Elliptic curves', 'cryptography', 'cryptosystem', 'discrete logarithm problem', 'Diffie-Hellman', 'RSA']"
19665,1606.05092,Bernhard Rumpe,"Katrin H\""olldobler and Pedram Mir Seyed Nazari and Bernhard Rumpe","Adaptable Symbol Table Management by Meta Modeling and Generation of
  Symbol Table Infrastructures","8 pages, 9 figures, Domain-Specific Modeling Workshop 2015 (DSM 2015)",Domain-Specific Modeling Workshop 2015 (DSM 2015),,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many textual software languages share common concepts such as defining and
referencing elements, hierarchical structures constraining the visibility of
names, and allowing for identical names for different element kinds. Symbol
tables are useful to handle those reference and visibility concepts. However,
developing a symbol table can be a tedious task that leads to an additional
effort for the language engineer. This paper presents a symbol table meta model
usable to define languagespecific symbol tables. Furthermore, we integrate this
symbol table meta model with a meta model of a grammar-based language
definition. This enables the language engineer to switch between the model
structure and the symbol table as needed. Finally, based on a grammarannotation
mechanism, our approach is able to generate a symbol table infrastructure that
can be used as is or serve as a basis for custom symbol tables.
","[{'version': 'v1', 'created': 'Thu, 16 Jun 2016 08:36:10 GMT'}]",2016-06-17,"[['Hölldobler', 'Katrin', ''], ['Nazari', 'Pedram Mir Seyed', ''], ['Rumpe', 'Bernhard', '']]","['Meta model', 'symbol table', 'code generation']"
19666,1705.06712,Andre Mastmeyer,"Andre Mastmeyer, Guillaume Pernelle, Lauren Barber, Steve Pieper, Dirk
  Fortmeier, Sandy Wells, Heinz Handels, Tina Kapur",Model-based Catheter Segmentation in MRI-images,MICCAI 2015,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Accurate and reliable segmentation of catheters in MR-guided interventions
remains a challenge, and a step of critical importance in clinical workflows.
In this work, under reasonable assumptions, mechanical model based heuristics
guide the segmentation process allows correct catheter identification rates
greater than 98% (error 2.88 mm), and reduction in outliers to one-fourth
compared to the state of the art. Given distal tips, searching towards the
proximal ends of the catheters is guided by mechanical models that are
estimated on a per-catheter basis. Their bending characteristics are used to
constrain the image feature based candidate points. The final catheter
trajectories are hybrid sequences of individual points, each derived from model
and image features. We evaluate the method on a database of 10 patient MRI
scans including 101 manually segmented catheters. The mean errors were 1.40 mm
and the median errors were 1.05 mm. The number of outliers deviating more than
2 mm from the gold standard is 7, and the number of outliers deviating more
than 3 mm from the gold standard is just 2.
","[{'version': 'v1', 'created': 'Thu, 18 May 2017 17:28:53 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Dec 2020 07:55:13 GMT'}]",2020-12-11,"[['Mastmeyer', 'Andre', ''], ['Pernelle', 'Guillaume', ''], ['Barber', 'Lauren', ''], ['Pieper', 'Steve', ''], ['Fortmeier', 'Dirk', ''], ['Wells', 'Sandy', ''], ['Handels', 'Heinz', ''], ['Kapur', 'Tina', '']]","['segmentation', 'identification', 'catheter', 'MRI', 'validation']"
19667,1002.1447,Mahmoud Ferdosizade Naeiny,"Mahmoud Ferdosizadeh Naeiny, Farokh Marvasti","PAPR reduction of space-time and space-frequency coded OFDM systems
  using active constellation extension",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Active Constellation Extension (ACE) is one of techniques introduced for Peak
to Average Power Ratio (PAPR) reduction for OFDM systems. In this technique,
the constellation points are extended such that the PAPR is minimized but the
minimum distance of the constellation points does not decrease. In this paper,
an iterative ACE method is extended to spatially encoded OFDM systems. The
proposed methods are such that the PAPR is reduced simultaneously at all
antennas, while the spatial encoding relationships still hold. It will be shown
that the original ACE method can be employed before Space Time Block Coding
(STBC). But in case of Space Frequency Block Coding (SFBC), two modified
techniques have been proposed. In the first method, the OFDM frame is separated
by several subframes and the ACE method is applied to these subframes
independently to reduce their corresponding PAPRs. Then the low PAPR subframes
are recombined based on SFBC relationships to yield the transmitted signals
from different antennas. In the second method, for each iteration, the ACE is
applied to the antenna with the maximum PAPR, and the signals of the other
antennas are generated from that of this antenna. Simulation results show that
both algorithms converge, but the second method outperforms the first one when
the number of antennas is increased.
","[{'version': 'v1', 'created': 'Sun, 7 Feb 2010 13:01:18 GMT'}]",2010-02-09,"[['Naeiny', 'Mahmoud Ferdosizadeh', ''], ['Marvasti', 'Farokh', '']]","['ACE', 'OFDM', 'PAPR', 'POCS', 'STBC', 'SFBC']"
19668,1205.6373,Gerard Burnside,"Gerard Burnside, Dohy Hong, Son Nguyen-Kim and Liang Liu",Publication Induced Research Analysis (PIRA) - Experiments on Real Data,,,,,cs.DL cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the first results obtained by implementing a novel
approach to rank vertices in a heterogeneous graph, based on the PageRank
family of algorithms and applied here to the bipartite graph of papers and
authors as a first evaluation of its relevance on real data samples. With this
approach to evaluate research activities, the ranking of a paper/author depends
on that of the papers/authors citing it/him or her. We compare the results
against existing ranking methods (including methods which simply apply PageRank
to the graph of papers or the graph of authors) through the analysis of simple
scenarios based on a real dataset built from DBLP and CiteseerX. The results
show that in all examined cases the obtained result is most pertinent with our
method which allows to orient our future work to optimizing the execution of
this algorithm.
","[{'version': 'v1', 'created': 'Tue, 29 May 2012 14:28:10 GMT'}]",2012-05-30,"[['Burnside', 'Gerard', ''], ['Hong', 'Dohy', ''], ['Nguyen-Kim', 'Son', ''], ['Liu', 'Liang', '']]","['publication', 'citation', 'ranking', 'graph', 'dataset']"
19669,1502.06103,Ana Miletic,"Ana Miletic, Nemanja Ivanovic",Compressive sensing based velocity estimation in video data,"4 pages, 5 figures",,,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the use of compressive sensing based algorithms for
velocity estimation of moving vehicles. The procedure is based on sparse
reconstruction algorithms combined with time-frequency analysis applied to
video data. This algorithm provides an accurate estimation of object's velocity
even in the case of a very reduced number of available video frames. The
influence of crucial parameters is analysed for different types of moving
vehicles.
","[{'version': 'v1', 'created': 'Sat, 21 Feb 2015 13:19:34 GMT'}]",2015-02-24,"[['Miletic', 'Ana', ''], ['Ivanovic', 'Nemanja', '']]","['Compressive sensing', 'signal reconstruction', 'video frames', 'velocity estimation']"
19670,1702.06934,Olegs Verhodubs,Olegs Verhodubs,Realization of Ontology Web Search Engine,,,,,cs.AI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes the realization of the Ontology Web Search Engine. The
Ontology Web Search Engine is realizable as independent project and as a part
of other projects. The main purpose of this paper is to present the Ontology
Web Search Engine realization details as the part of the Semantic Web Expert
System and to present the results of the Ontology Web Search Engine
functioning. It is expected that the Semantic Web Expert System will be able to
process ontologies from the Web, generate rules from these ontologies and
develop its knowledge base.
","[{'version': 'v1', 'created': 'Wed, 22 Feb 2017 18:35:43 GMT'}]",2017-02-23,"[['Verhodubs', 'Olegs', '']]","['Ontology Web Search Engine', 'Search Engine', 'Crawler', 'Indexer', 'Semantic Web']"
19671,0705.1218,Damien Chablat,"Anatoly Pashkevich (ROBOTIC Laboratory), Roman Gomolitsky (ROBOTIC
  Laboratory), Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)",Calibration of quasi-isotropic parallel kinematic Machines: Orthoglide,,"Fourth International Conference on Informatics in Control,
  Automation and Robotics (09/05/2007) 1-8",,,cs.RO,,"  The paper proposes a novel approach for the geometrical model calibration of
quasi-isotropic parallel kinematic mechanisms of the Orthoglide family. It is
based on the observations of the manipulator leg parallelism during motions
between the specific test postures and employs a low-cost measuring system
composed of standard comparator indicators attached to the universal magnetic
stands. They are sequentially used for measuring the deviation of the relevant
leg location while the manipulator moves the TCP along the Cartesian axes.
Using the measured differences, the developed algorithm estimates the joint
offsets and the leg lengths that are treated as the most essential parameters.
Validity of the proposed calibration technique is confirmed by the experimental
results.
","[{'version': 'v1', 'created': 'Wed, 9 May 2007 07:30:48 GMT'}]",2007-05-23,"[['Pashkevich', 'Anatoly', '', 'ROBOTIC Laboratory'], ['Gomolitsky', 'Roman', '', 'ROBOTIC\n  Laboratory'], ['Wenger', 'Philippe', '', 'IRCCyN'], ['Chablat', 'Damien', '', 'IRCCyN']]","['Parallel robots', 'calibration', 'parameter identification', 'error compensation']"
19672,1702.07815,Sergio Cabello,Sergio Cabello,"Subquadratic Algorithms for the Diameter and the Sum of Pairwise
  Distances in Planar Graphs",Preliminary version at SODA 2017,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show how to compute for $n$-vertex planar graphs in $O(n^{11/6}{\rm
polylog}(n))$ expected time the diameter and the sum of the pairwise distances.
The algorithms work for directed graphs with real weights and no negative
cycles. In $O(n^{15/8}{\rm polylog}(n))$ expected time we can also compute the
number of pairs of vertices at distance smaller than a given threshold. These
are the first algorithms for these problems using time $O(n^c)$ for some
constant $c<2$, even when restricted to undirected, unweighted planar graphs.
","[{'version': 'v1', 'created': 'Sat, 25 Feb 2017 01:24:03 GMT'}, {'version': 'v2', 'created': 'Fri, 11 May 2018 07:56:53 GMT'}]",2018-05-14,"[['Cabello', 'Sergio', '']]","['planar graph', 'diameter', 'Wiener index', 'distances in graphs', 'distance counting', 'Voronoi diagram']"
19673,1412.6850,Francisco Pe\~nu\~nuri,"O. Mendoza-Trejo, Carlos A. Cruz-Villar, R. Pe\'on-Escalante, M. A.
  Zambrano-Arjona, F. Penunuri","Synthesis Method for the Spherical 4R Mechanism with Minimum Center of
  Mass Acceleration","6 figures, 2 tables",,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the mechanisms area, minimization of the magnitude of the acceleration of
the center of mass (ACoM) implies shaking force balancing. For a mechanism
operating in cycles, the case when the ACoM is zero implies that the
gravitational potential energy (GPE) is constant. This article shows an
efficient and effective optimum synthesis method for minimum acceleration of
the center of mass of a spherical 4R mechanism by using dual functions and the
counterweights balancing method. Once the dual function for ACoM has been
written, one can minimize the shaking forces from a kinematic point of view. We
present the synthesis of a spherical 4R mechanism for the case of a path
generation task. The synthesis process involves the optimization of two
objective functions, this multiobjective problem is solved by using the
weighted sum method implemented in the evolutionary algorithm known as
Differential Evolution.
","[{'version': 'v1', 'created': 'Mon, 22 Dec 2014 00:55:39 GMT'}, {'version': 'v2', 'created': 'Sun, 5 Apr 2015 22:59:50 GMT'}]",2015-04-07,"[['Mendoza-Trejo', 'O.', ''], ['Cruz-Villar', 'Carlos A.', ''], ['Peón-Escalante', 'R.', ''], ['Zambrano-Arjona', 'M. A.', ''], ['Penunuri', 'F.', '']]","['Center of Mass Acceleration', 'Shaking Force', 'Spherical 4R Mechanism', 'DualNumbers', 'Differential Evolution']"
19674,0906.0885,Yongxin Tong,"Yongxin Tong, Li Zhao, Dan Yu, Shilong Ma, Ke Xu",Mining Compressed Repetitive Gapped Sequential Patterns Efficiently,"19 pages, 7 figures","The 5th International Conference on Advanced Data Mining and
  Applications (ADMA2009)",,,cs.DB cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mining frequent sequential patterns from sequence databases has been a
central research topic in data mining and various efficient mining sequential
patterns algorithms have been proposed and studied. Recently, in many problem
domains (e.g, program execution traces), a novel sequential pattern mining
research, called mining repetitive gapped sequential patterns, has attracted
the attention of many researchers, considering not only the repetition of
sequential pattern in different sequences but also the repetition within a
sequence is more meaningful than the general sequential pattern mining which
only captures occurrences in different sequences. However, the number of
repetitive gapped sequential patterns generated by even these closed mining
algorithms may be too large to understand for users, especially when support
threshold is low. In this paper, we propose and study the problem of
compressing repetitive gapped sequential patterns. Inspired by the ideas of
summarizing frequent itemsets, RPglobal, we develop an algorithm, CRGSgrow
(Compressing Repetitive Gapped Sequential pattern grow), including an efficient
pruning strategy, SyncScan, and an efficient representative pattern checking
scheme, -dominate sequential pattern checking. The CRGSgrow is a two-step
approach: in the first step, we obtain all closed repetitive sequential
patterns as the candidate set of representative repetitive sequential patterns,
and at the same time get the most of representative repetitive sequential
patterns; in the second step, we only spend a little time in finding the
remaining the representative patterns from the candidate set. An empirical
study with both real and synthetic data sets clearly shows that the CRGSgrow
has good performance.
","[{'version': 'v1', 'created': 'Thu, 4 Jun 2009 11:17:34 GMT'}]",2009-06-05,"[['Tong', 'Yongxin', ''], ['Zhao', 'Li', ''], ['Yu', 'Dan', ''], ['Ma', 'Shilong', ''], ['Xu', 'Ke', '']]","['Mining sequential patterns', 'Repetitive gapped sequential pattern', 'Mining compressed frequent pattern']"
19675,1305.5800,Ilya Mirsky,"Dave Dice, Danny Hendler and Ilya Mirsky","Lightweight Contention Management for Efficient Compare-and-Swap
  Operations","25 pages, to be published in Euro-Par 2013 proceedings",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many concurrent data-structure implementations use the well-known
compare-and-swap (CAS) operation, supported in hardware by most modern
multiprocessor architectures for inter-thread synchronization. A key weakness
of the CAS operation is the degradation in its performance in the presence of
memory contention.
  In this work we study the following question: can software-based contention
management improve the efficiency of hardware-provided CAS operations? Our
performance evaluation establishes that lightweight contention management
support can greatly improve performance under medium and high contention levels
while typically incurring only small overhead when contention is low.
","[{'version': 'v1', 'created': 'Fri, 24 May 2013 17:05:51 GMT'}]",2013-05-27,"[['Dice', 'Dave', ''], ['Hendler', 'Danny', ''], ['Mirsky', 'Ilya', '']]","['Compare-and-swap', 'contention management', 'concurrentalgorithms']"
19676,1305.0219,Tamal Das,"Tamal Das, Marek Drogon, Admela Jukan, and Marco Hoffmann","Study of Network Migration to New Technologies using Agent-based
  Modeling Techniques",Submitted to Springer Journal of Network and Systems Management,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Conventionally, network migration models study competition between emerging
and incumbent technologies by considering the resulting increase in revenue and
associated cost of migration. We propose to advance the science in the existing
network migration models by considering additional critical factors, including
(i) synergistic relationships across multiple technologies, (ii) reduction in
operational expenditures (OpEx) as a reason to migrate, and, (iii) implications
of local network effects on migration decisions. To this end, we propose a
novel agent-based migration model considering these factors. Based on the
model, we analyze the case study of network migration to two emerging
networking paradigms, i.e., IETF Path Computation Element (PCE) and
Software-Defined Networking (SDN). We validate our model using extensive
simulations. Our results demonstrate the synergistic effects of migration to
multiple complementary technologies, and show that a technology migration may
be eased by the joint migration to multiple technologies. In particular, we
find that migration to SDN can be eased by joint migration to PCE, and that the
benefits derived from SDN are best exploited in combination with PCE, than by
itself.
","[{'version': 'v1', 'created': 'Wed, 1 May 2013 16:24:05 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Jan 2014 13:28:03 GMT'}]",2014-01-10,"[['Das', 'Tamal', ''], ['Drogon', 'Marek', ''], ['Jukan', 'Admela', ''], ['Hoffmann', 'Marco', '']]","['network economics', 'agent-based models', 'path computationelement', 'software defined networking', 'local network effects']"
19677,1510.04420,Paramjot Kaur Sarao,"Paramjot Kaur Sarao, Puneet Mittal, Rupinder Kaur",Narrative Science Systems: A Review,,"International Journal of Research in Computer Science, 5(1), 2015,
  pp 9-14",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic narration of events and entities is the need of the hour,
especially when live reporting is critical and volume of information to be
narrated is huge. This paper discusses the challenges in this context, along
with the algorithms used to build such systems. From a systematic study, we can
infer that most of the work done in this area is related to statistical data.
It was also found that subjective evaluation or contribution of experts is also
limited for narration context.
","[{'version': 'v1', 'created': 'Thu, 15 Oct 2015 07:06:39 GMT'}]",2015-10-16,"[['Sarao', 'Paramjot Kaur', ''], ['Mittal', 'Puneet', ''], ['Kaur', 'Rupinder', '']]","['computational narration', 'automatic story generation', 'automatic narration', 'content creation', 'natural language processing']"
19678,1007.0381,Rene Ndoundam,"Ren\'e Ndoundam, Maurice Tchuente, Claude Tadonki (INRIA - IRISA,
  INRIA - IRISA)",Parallel Chip Firing Game associated with n-cube orientations,,"International Conference on Computational Science 2004, ICCS 2004,
  Krakov : Poland (2004)",,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the cycles generated by the chip firing game associated with n-cube
orientations. We show the existence of the cycles generated by parallel
evolutions of even lengths from 2 to $2^n$ on $H_n$ (n >= 1), and of odd
lengths different from 3 and ranging from 1 to $2^{n-1}-1$ on $H_n$ (n >= 4).
","[{'version': 'v1', 'created': 'Thu, 1 Jul 2010 06:46:50 GMT'}]",2010-07-05,"[['Ndoundam', 'René', '', 'INRIA - IRISA,\n  INRIA - IRISA'], ['Tchuente', 'Maurice', '', 'INRIA - IRISA,\n  INRIA - IRISA'], ['Tadonki', 'Claude', '', 'INRIA - IRISA,\n  INRIA - IRISA']]","['Graph', 'chip firing game', 'parallel evolution', 'cycle', 'transient', 'n-cube']"
19679,1209.5507,Neha Rani,"Neha Rani, Preeti Sharma, Pankaj Sharma (A.B.E.S. Engineering college)","Performance comparison of various routing protocols in different
  mobility models","13 pages,13 figures, 1 Table","IJASUC (International journal of Ad-hoc, Sensor and Ubiquitous
  computing)Volume 3, Number 4, August 2012",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile Ad hoc Network (MANET) is a infrastructure less network in which two
or more devices have wireless communication which can communicate with each
other and exchange information without need of any centralized administrator.
Each node in the ad hoc network acts as a router, forwarding data packets for
other nodes. The main issue is to compare the existing routing protocol and
finding the best one. The scope of this study is to test routing performance of
three different routing protocols (AODV, OLSR and DSDV) with respect to various
mobility models using NS2 simulator. In this paper the parameters used for
comparison are packet delivery fraction (PDF), average end to end delay (AEED),
normalized routing load (NRL) and throughput.
","[{'version': 'v1', 'created': 'Tue, 25 Sep 2012 06:27:07 GMT'}]",2012-09-26,"[['Rani', 'Neha', '', 'A.B.E.S. Engineering college'], ['Sharma', 'Preeti', '', 'A.B.E.S. Engineering college'], ['Sharma', 'Pankaj', '', 'A.B.E.S. Engineering college']]","['NS-2 simulator', 'Performance parameters', 'AODV', 'OLSR', 'DSDV', 'RPGM', 'RWPM']"
19680,1106.6242,Sandeep Katta,Sandeep Katta,Visual Secret Sharing Scheme using Grayscale Images,"6 pages, 2 figures",,,,cs.CR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pixel expansion and the quality of the reconstructed secret image has been a
major issue of visual secret sharing (VSS) schemes. A number of probabilistic
VSS schemes with minimum pixel expansion have been proposed for black and white
(binary) secret images. This paper presents a probabilistic (2, 3)-VSS scheme
for gray scale images. Its pixel expansion is larger in size but the quality of
the image is perfect when it's reconstructed. The construction of the shadow
images (transparent shares) is based on the binary OR operation.
","[{'version': 'v1', 'created': 'Thu, 30 Jun 2011 14:25:46 GMT'}]",2011-07-01,"[['Katta', 'Sandeep', '']]","['visual secret sharing', '2-out-of-3 secret sharing', 'grayscale cryptography']"
19681,1704.06679,Pablo Antolin,"John-Eric Dufour, Pablo Antolin, Giancarlo Sangalli, Ferdinando
  Auricchio, Alessandro Reali","A cost-effective isogeometric approach for composite plates based on a
  stress recovery procedure",,,,,cs.CE math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a cost-effective strategy to simulate the behavior of
laminated plates by means of isogeometric 3D solid elements. Exploiting the
high continuity of spline functions and their properties, a proper out-of-plane
stress state is recovered from a coarse displacement solution using a
post-processing step based on the enforcement of equilibrium in strong form.
Appealing results are obtained and the method is shown to be particularly
Peffective on slender composite stacks with a large number of layers.
","[{'version': 'v1', 'created': 'Fri, 21 Apr 2017 18:44:55 GMT'}]",2017-04-27,"[['Dufour', 'John-Eric', ''], ['Antolin', 'Pablo', ''], ['Sangalli', 'Giancarlo', ''], ['Auricchio', 'Ferdinando', ''], ['Reali', 'Alessandro', '']]","['Isogeometric analysis', 'Laminated composite plate', 'Stress']"
19682,1705.07185,Ida Momennejad,"Ida Momennejad, Ajua Duker, Alin Coman","The Ties that Bind Networks: Weak Ties Facilitate the Emergence of
  Collective Memories",,,,,cs.SI,http://creativecommons.org/licenses/by-sa/4.0/,"  From families to nations, what binds individuals in social groups is the
degree to which they share beliefs, norms, and memories. While local clusters
of communicating individuals can sustain shared memories and norms, communities
characterized by isolated cliques are susceptible to information fragmentation
and polarization dynamics. We employ experimental manipulations in lab-created
communities to investigate how the temporal dynamics of conversational
interactions can shape the formation of collective memories. We show that when
individuals that bridge cliques (i.e., weak ties) communicate early on in a
series of networked interactions, the community reaches higher mnemonic
convergence compared to when individuals first interact within cliques (i.e.,
strong ties). This, we find, is due to the tradeoffs between information
diversity and accumulated overlap over time. By using data calibrated models,
we extend these findings to a larger and more complex network structure. Our
approach offers a framework to analyze and design interventions in
communication networks that optimize shared remembering and diminish the
likelihood of information bubbles and polarization.
","[{'version': 'v1', 'created': 'Fri, 19 May 2017 21:00:19 GMT'}]",2017-05-23,"[['Momennejad', 'Ida', ''], ['Duker', 'Ajua', ''], ['Coman', 'Alin', '']]","['collective memories; temporal networks; complex networks', 'weak ties  Correspondence idam@princeton.edu', 'acoman@princeton']"
19683,1605.00914,Martin Romauch,"Martin Romauch, Richard F. Hartl",Capacity Planning for Cluster Tools in the Semiconductor Industry,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a new model for Cluster-tools with two load locks.
Cluster-tools are widely used to automate single wafer processing in
semiconductor industry. The load locks are the entry points into the vacuum of
the Cluster-tool's mainframe. Usually there are two of them available. Each lot
being processed, is dedicated to a single load-lock. Therefore at most two
different lots (with possibly different processing times and qualification) can
be processed simultaneously. This restriction is one of the major potential
bottlenecks.
  Capacity planning is one of the possible applications for the proposed model
and the paper demonstrates the integration into a more general framework that
considers different tool types and different operational modes.
  The paper also generalizes an earlier model that is limited to three
processing chambers. The proposed modeling approach is based on makespan
reductions by parallel processing. It turns out that the performance of the new
approach is similar, when compared to the generalized model for three chambers,
but the new approach outperforms the generalized model for four and more
chambers.
","[{'version': 'v1', 'created': 'Tue, 3 May 2016 14:07:32 GMT'}]",2016-05-04,"[['Romauch', 'Martin', ''], ['Hartl', 'Richard F.', '']]","['Cluster-Tool', 'Capacity Planning', 'Semiconductor Industry', 'LinearProgramming', 'Duality']"
19684,1610.05514,Carlos Hernandez Corbato,"Carlos Hernandez, Mukunda Bharatheesha, Wilson Ko, Hans Gaiser, Jethro
  Tan, Kanter van Deurzen, Maarten de Vries, Bas Van Mil, Jeff van Egmond,
  Ruben Burger, Mihai Morariu, Jihong Ju, Xander Gerrmann, Ronald Ensing, Jan
  Van Frankenhuyzen, and Martijn Wisse",Team Delft's Robot Winner of the Amazon Picking Challenge 2016,,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes Team Delft's robot, which won the Amazon Picking
Challenge 2016, including both the Picking and the Stowing competitions. The
goal of the challenge is to automate pick and place operations in unstructured
environments, specifically the shelves in an Amazon warehouse. Team Delft's
robot is based on an industrial robot arm, 3D cameras and a customized gripper.
The robot's software uses ROS to integrate off-the-shelf components and modules
developed specifically for the competition, implementing Deep Learning and
other AI techniques for object recognition and pose estimation, grasp planning
and motion planning. This paper describes the main components in the system,
and discusses its performance and results at the Amazon Picking Challenge 2016
finals.
","[{'version': 'v1', 'created': 'Tue, 18 Oct 2016 09:58:08 GMT'}]",2016-10-19,"[['Hernandez', 'Carlos', ''], ['Bharatheesha', 'Mukunda', ''], ['Ko', 'Wilson', ''], ['Gaiser', 'Hans', ''], ['Tan', 'Jethro', ''], ['van Deurzen', 'Kanter', ''], ['de Vries', 'Maarten', ''], ['Van Mil', 'Bas', ''], ['van Egmond', 'Jeff', ''], ['Burger', 'Ruben', ''], ['Morariu', 'Mihai', ''], ['Ju', 'Jihong', ''], ['Gerrmann', 'Xander', ''], ['Ensing', 'Ronald', ''], ['Van Frankenhuyzen', 'Jan', ''], ['Wisse', 'Martijn', '']]","['robotic system', 'warehouse automation', 'motion planning', 'grasping', 'deep learning']"
19685,0906.2027,Sewoong Oh,"Raghunandan H. Keshavan, Andrea Montanari and Sewoong Oh",Matrix Completion from Noisy Entries,"22 pages, 3 figures",,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a matrix M of low-rank, we consider the problem of reconstructing it
from noisy observations of a small, random subset of its entries. The problem
arises in a variety of applications, from collaborative filtering (the `Netflix
problem') to structure-from-motion and positioning. We study a low complexity
algorithm introduced by Keshavan et al.(2009), based on a combination of
spectral techniques and manifold optimization, that we call here OptSpace. We
prove performance guarantees that are order-optimal in a number of
circumstances.
","[{'version': 'v1', 'created': 'Thu, 11 Jun 2009 00:22:58 GMT'}, {'version': 'v2', 'created': 'Mon, 9 Apr 2012 17:37:45 GMT'}]",2012-04-10,"[['Keshavan', 'Raghunandan H.', ''], ['Montanari', 'Andrea', ''], ['Oh', 'Sewoong', '']]","['matrix completion', 'low-rank matrices', 'spectral methods', 'manifold optimization']"
19686,1506.04118,Vinay Vaishampayan,Antonio Campello and Vinay A. Vaishampayan,"A Generalization of Montucla's Rectangle-to-Rectangle Dissection to
  Higher Dimensions",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dissections of polytopes are a well-studied subject by geometers as well as
recreational mathematicians. A recent application in coding theory arises from
the problem of parameterizing binary vectors of constant Hamming weight which
has been shown previously to be equivalent to the problem of dissecting a
tetrahedron to a brick. Applications of dissections also arise in problems
related to the construction of analog codes.
  Here we consider the rectangle-to-rectangle dissection due to Montucla.
Montucla's dissection is first reinterpreted in terms of the Two Tile Theorem.
Based on this, a cube-to-brick dissection is developed in $\mathbb{R}^n$. We
present a linear time algorithm (in $n$) that computes the dissection, i.e.
determines a point in the cube given a point in a specific realization of the
brick. An application of this algorithm to a previously reported analog coding
scheme is also discussed.
","[{'version': 'v1', 'created': 'Fri, 12 Jun 2015 19:01:17 GMT'}]",2015-06-15,"[['Campello', 'Antonio', ''], ['Vaishampayan', 'Vinay A.', '']]","['Dissections', 'Tilings', 'Lattices', 'Encoding', 'Parameterization']"
19687,1412.2689,Afdel Karim,"Ali Aajli, Karim Afdel",A New Approach of Learning Hierarchy Construction Based on Fuzzy Logic,58-66,"Journal of Engineering Research and Applications,ISSN : 2248-9622,
  Vol. 4, Issue 10( Part - 3), October 2014, pp.58-66",,,cs.CY cs.AI cs.LG,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In recent years, adaptive learning systems rely increasingly on learning
hierarchy to customize the educational logic developed in their courses. Most
approaches do not consider that the relationships of prerequisites between the
skills are fuzzy relationships. In this article, we describe a new approach of
a practical application of fuzzy logic techniques to the construction of
learning hierarchies. For this, we use a learning hierarchy predefined by one
or more experts of a specific field. However, the relationships of
prerequisites between the skills in the learning hierarchy are not definitive
and they are fuzzy relationships. Indeed, we measure relevance degree of all
relationships existing in this learning hierarchy and we try to answer to the
following question: Is the relationships of prerequisites predefined in initial
learning hierarchy are correctly established or not?
","[{'version': 'v1', 'created': 'Mon, 8 Dec 2014 18:34:07 GMT'}]",2014-12-30,"[['Aajli', 'Ali', ''], ['Afdel', 'Karim', '']]","['Learning hierarchy', 'Fuzzy Sets Theory', 'Fuzzy relationships', 'Data mining']"
19688,1610.02857,Evanthia Dimara,"Evanthia Dimara (AVIZ), Pierre Dragicevic (AVIZ), Anastasia Bezerianos
  (LRI, ILDA)",Accounting for Availability Biases in Information Visualization,"IEEE VIS 2014, 2014, Paris, France. 2014",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The availability heuristic is a strategy that people use to make quick
decisions but often lead to systematic errors. We propose three ways that
visualization could facilitate unbiased decision-making. First, visualizations
can alter the way our memory stores the events for later recall, so as to
improve users' long-term intuitions. Second, the known biases could lead to new
visualization guidelines. Third, we suggest the design of decision-making tools
that are inspired by heuristics, e.g. suggesting intuitive approximations,
rather than target to present exhaustive comparisons of all possible outcomes,
or automated solutions for choosing decisions.
","[{'version': 'v1', 'created': 'Mon, 10 Oct 2016 11:44:30 GMT'}]",2016-10-11,"[['Dimara', 'Evanthia', '', 'AVIZ'], ['Dragicevic', 'Pierre', '', 'AVIZ'], ['Bezerianos', 'Anastasia', '', 'LRI, ILDA']]","['Availability Heuristic', 'Cognitive Bias', 'Visualizations', 'DecisionMaking']"
19689,1407.2694,Pooja Gupta,"Pooja Gupta, Nisheeth Joshi, Iti Mathur",Quality Estimation Of Machine Translation Outputs Through Stemming,,"International Journal on Computational Sciences & Applications
  (IJCSA) Vol.4, No.3, June 2014",,,cs.CL,http://creativecommons.org/licenses/by/3.0/,"  Machine Translation is the challenging problem for Indian languages. Every
day we can see some machine translators being developed, but getting a high
quality automatic translation is still a very distant dream . The correct
translated sentence for Hindi language is rarely found. In this paper, we are
emphasizing on English-Hindi language pair, so in order to preserve the correct
MT output we present a ranking system, which employs some machine learning
techniques and morphological features. In ranking no human intervention is
required. We have also validated our results by comparing it with human
ranking.
","[{'version': 'v1', 'created': 'Thu, 10 Jul 2014 05:26:14 GMT'}]",2014-07-11,"[['Gupta', 'Pooja', ''], ['Joshi', 'Nisheeth', ''], ['Mathur', 'Iti', '']]","['Machine Translation', 'Stemming', 'Machine learning', 'Language Model']"
19690,1304.5893,Sabah Al-Fedaghi Dr.,Sabah Al-Fedaghi,"Conceptual Understanding of Computer Program Execution: Application to
  C++","11 pages, 18 figures","International Journal of Computer Science Issues, Volume 10, Issue
  2, March 2013",,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A visual programming language uses pictorial tools such as diagrams to
represent its structural units and control stream. It is useful for enhancing
understanding, maintenance, verification, testing, and parallelism. This paper
proposes a diagrammatic methodology that produces a conceptual representation
of instructions for programming source codes. Without loss of generality in the
potential for using the methodology in a wider range of applications, this
paper focuses on using these diagrams in teaching of C++ programming. C++
programming constructs are represented in the proposed method in order to show
that it can provide a foundation for understanding the behavior of running
programs. Applying the method to actual C++ classes demonstrates that it
improves understanding of the activities in the computer system corresponding
to a C++ program.
","[{'version': 'v1', 'created': 'Mon, 22 Apr 2013 09:41:42 GMT'}]",2013-04-23,"[['Al-Fedaghi', 'Sabah', '']]","['conceptual model', 'understanding', 'computer']"
19691,1502.06081,Radu Arsinte,Radu Arsinte,"Study of a Robust Algorithm Applied in the Optimal Position Tuning for
  the Camera Lens in Automated Visual Inspection Systems","5 pages, 2 figures","Proceedings of Fifth International Conference on Pattern
  Recognition and Information Processing - PRIP'99 - May 18-20, 1999 Minsk,
  Belarus - pag.237-242 - ISBN 83-87362-16-6",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper present the mathematical fundaments and experimental study of an
algorithm used to find the optimal position for the camera lens to obtain a
maximum of details. This information can be further applied to a appropriate
system to automatically correct this position. The algorithm is based on the
evaluation of a so called resolution function who calculates the maximum of
gradient in a certain zone of the image. The paper also presents alternative
forms of the function, results of measurements and set up a set of practical
rules for the right application of the algorithm.
","[{'version': 'v1', 'created': 'Sat, 21 Feb 2015 07:40:18 GMT'}]",2015-02-24,"[['Arsinte', 'Radu', '']]","['image acquisition', 'visual inspection', 'resolution estimation']"
19692,0806.4920,Tuyet-Tram Dang-Ngoc,"Tuyet-Tram Dang-Ngoc (PRISM), Georges Gardarin (PRISM)","Conception et Evaluation de XQuery dans une architecture de m\'ediation
  ""Tout-XML""",,"Revue ISI (Integration de syst\`emes d'information) : Num\'ero
  sp\'ecial sur les Bases de Donn\'ees Semi-structur\'ees 8, 5-6 (2003) 11-25",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  XML has emerged as the leading language for representing and exchanging data
not only on the Web, but also in general in the enterprise. XQuery is emerging
as the standard query language for XML. Thus, tools are required to mediate
between XML queries and heterogeneous data sources to integrate data in XML.
This paper presents the XMedia mediator, a unique tool for integrating and
querying disparate heterogeneous information as unified XML views. It describes
the mediator architecture and focuses on the unique distributed query
processing technology implemented in this component. Query evaluation is based
on an original XML algebra simply extending classical operators to process
tuples of tree elements. Further, we present a set of performance evaluation on
a relational benchmark, which leads to discuss possible performance
enhancements.
","[{'version': 'v1', 'created': 'Mon, 30 Jun 2008 15:23:20 GMT'}]",2008-12-18,"[['Dang-Ngoc', 'Tuyet-Tram', '', 'PRISM'], ['Gardarin', 'Georges', '', 'PRISM']]","['XML', 'Mediation Architecture', 'XML Algebra', 'Xquery']"
19693,0907.5162,Anya Tafliovich,Anya Tafliovich and Eric C. R. Hehner,Programming with Quantum Communication,,,,,cs.PL cs.LO quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work develops a formal framework for specifying, implementing, and
analysing quantum communication protocols. We provide tools for developing
simple proofs and analysing programs which involve communication, both via
quantum channels and exhibiting the LOCC (local operations, classical
communication) paradigm.
","[{'version': 'v1', 'created': 'Wed, 29 Jul 2009 15:38:02 GMT'}]",2009-07-30,"[['Tafliovich', 'Anya', ''], ['Hehner', 'Eric C. R.', '']]","['Quantum Computing', 'Quantum Communication Protocol', 'Formal Verification', 'FormalMethods of Program Design']"
19694,1511.06436,Gwen Spencer PhD,Gwen Spencer and David Rolnick,"On the robust hardness of Gr\""obner basis computation",19 pages,,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The computation of Gr\""obner bases is an established hard problem. By
contrast with many other problems, however, there has been little investigation
of whether this hardness is robust. In this paper, we frame and present results
on the problem of approximate computation of Gr\""obner bases. We show that it
is NP-hard to construct a Gr\""obner basis of the ideal generated by a set of
polynomials, even when the algorithm is allowed to discard a $(1 - \epsilon)$
fraction of the generators, and likewise when the algorithm is allowed to
discard variables (and the generators containing them). Our results shows that
computation of Gr\""obner bases is robustly hard even for simple polynomial
systems (e.g. maximum degree 2, with at most 3 variables per generator). We
conclude by greatly strengthening results for the Strong $c$-Partial Gr\""obner
problem posed by De Loera et al. Our proofs also establish interesting
connections between the robust hardness of Gr\""obner bases and that of SAT
variants and graph-coloring.
","[{'version': 'v1', 'created': 'Thu, 19 Nov 2015 22:54:21 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Oct 2017 18:01:52 GMT'}, {'version': 'v3', 'created': 'Mon, 16 Jul 2018 20:00:14 GMT'}]",2018-07-18,"[['Spencer', 'Gwen', ''], ['Rolnick', 'David', '']]","['Gr¨obner Basis', 'Polynomial System', 'Complexity', 'Approximation', 'Hardness', 'Combinatorial Optimization', 'Satisfiability']"
19695,1407.0165,Beatriz Garcia-Jimenez,Beatriz Garc\'ia-Jim\'enez and Mark D. Wilkinson,"Automatic annotation of bioinformatics workflows with biomedical
  ontologies","6th International Symposium on Leveraging Applications (ISoLA 2014
  conference), 15 pages, 4 figures",,,,cs.IR q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Legacy scientific workflows, and the services within them, often present
scarce and unstructured (i.e. textual) descriptions. This makes it difficult to
find, share and reuse them, thus dramatically reducing their value to the
community. This paper presents an approach to annotating workflows and their
subcomponents with ontology terms, in an attempt to describe these artifacts in
a structured way. Despite a dearth of even textual descriptions, we
automatically annotated 530 myExperiment bioinformatics-related workflows,
including more than 2600 workflow-associated services, with relevant
ontological terms. Quantitative evaluation of the Information Content of these
terms suggests that, in cases where annotation was possible at all, the
annotation quality was comparable to manually curated bioinformatics resources.
","[{'version': 'v1', 'created': 'Tue, 1 Jul 2014 09:53:07 GMT'}]",2014-07-02,"[['García-Jiménez', 'Beatriz', ''], ['Wilkinson', 'Mark D.', '']]","['scientific workflows', 'web services', 'bioinformatics', 'semanticannotation', 'text mining', 'ontologies', 'tags', 'term extraction']"
19696,1506.01256,Ndoundam Rene,"Rene Ndoundam, Stephane Gael Raymond Ekodeck",PDF Steganography based on Chinese Remainder Theorem,"29pages, 5 figures",,,,cs.CR,http://creativecommons.org/licenses/by/3.0/,"  We propose different approaches of PDF files based steganography, essentially
based on the Chinese Remainder Theorem. Here, after a cover PDF document has
been released from unnecessary A0, a secret message is hidden in it using one
of the proposed approaches, making it invisible to common PDF readers, and the
file is then transmitted through a non-secure communication channel. Where each
of our methods, ensure the condition that the number of inserted A0 is less
than the number of characters of the secret message s.
","[{'version': 'v1', 'created': 'Wed, 3 Jun 2015 14:29:07 GMT'}]",2015-06-04,"[['Ndoundam', 'Rene', ''], ['Ekodeck', 'Stephane Gael Raymond', '']]","['Steganography', 'PDF files and readers', 'Chinese Remainder Theorem']"
19697,1109.3737,Misha Denil,"Misha Denil, Loris Bazzani, Hugo Larochelle and Nando de Freitas",Learning where to Attend with Deep Architectures for Image Tracking,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We discuss an attentional model for simultaneous object tracking and
recognition that is driven by gaze data. Motivated by theories of perception,
the model consists of two interacting pathways: identity and control, intended
to mirror the what and where pathways in neuroscience models. The identity
pathway models object appearance and performs classification using deep
(factored)-Restricted Boltzmann Machines. At each point in time the
observations consist of foveated images, with decaying resolution toward the
periphery of the gaze. The control pathway models the location, orientation,
scale and speed of the attended object. The posterior distribution of these
states is estimated with particle filtering. Deeper in the control pathway, we
encounter an attentional mechanism that learns to select gazes so as to
minimize tracking uncertainty. Unlike in our previous work, we introduce gaze
selection strategies which operate in the presence of partial information and
on a continuous action space. We show that a straightforward extension of the
existing approach to the partial information setting results in poor
performance, and we propose an alternative method based on modeling the reward
surface as a Gaussian Process. This approach gives good performance in the
presence of partial information and allows us to expand the action space from a
small, discrete set of fixation points to a continuous domain.
","[{'version': 'v1', 'created': 'Fri, 16 Sep 2011 22:32:51 GMT'}]",2011-09-20,"[['Denil', 'Misha', ''], ['Bazzani', 'Loris', ''], ['Larochelle', 'Hugo', ''], ['de Freitas', 'Nando', '']]","['Restricted Boltzmann machines', 'Bayesian optimization', 'bandits', 'atten']"
19698,1511.03039,Ehab Salahat Mr,"Ehab Salahat, Murad Qasaimeh","Unified Analytical Modeling of the Error Rates and the Ergodic Channel
  Capacity in ${\eta}$-${\mu}$ Generalized Fading Channels with Integer ${\mu}$
  and Maximal Ratio Combining Receiver",,"18th International Conf. on Industrial Technology (ICIT), Toronto,
  Canada, 22-25 March, 2017",,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we introduce a novel performance analysis of the
${\eta}$-${\mu}$ generalized radio fading channels with integer value of the
${\mu}$ fading parameter, i.e. with even number of multipath clusters. This
fading model includes other fading models as special cases such as the
Nakagami-m, the Hoyt, and the Rayleigh. We obtain novel unified and generic
simple closed-form expressions for the average bit error rates and ergodic
channel capacity in the additive white generalized Gaussian noise (AWGGN),
which includes the additive Gaussian, the gamma, the Laplacian, and the
impulsive noise as special cases. The receiver is assumed to be an L-branch
maximal ratio combiner where we study the effect of having more deployed
receiver antenna. Numerical evaluation as well as results from technical
wireless literature validate the generality and the accuracy of the derived
unified expressions under the studied test cases.
","[{'version': 'v1', 'created': 'Tue, 10 Nov 2015 09:50:26 GMT'}, {'version': 'v2', 'created': 'Sat, 11 Mar 2017 03:04:24 GMT'}]",2017-03-14,"[['Salahat', 'Ehab', ''], ['Qasaimeh', 'Murad', '']]","['η−μ fading', 'ABER', 'ACC', 'Generalized Gaussian']"
19699,1610.05045,Luisa Cutillo,Annamaria Carissimo and Luisa Cutillo and Italia Defeis,Validation of community robustness,"arXiv admin note: text overlap with arXiv:0908.1062,
  arXiv:cond-mat/0610077 by other authors",,,,cs.SI cs.DS physics.soc-ph stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The large amount of work on community detection and its applications leaves
unaddressed one important question: the statistical validation of the results.
In this paper we present a methodology able to clearly detect if the community
structure found by some algorithms is statistically significant or is a result
of chance, merely due to edge positions in the network. Given a community
detection method and a network of interest, our proposal examines the stability
of the partition recovered against random perturbations of the original graph
structure. To address this issue, we specify a perturbation strategy and a null
model to build a set of procedures based on a special measure of clustering
distance, namely Variation of Information, using tools set up for functional
data analysis. The procedures determine whether the obtained clustering departs
significantly from the null model. This strongly supports the robustness
against perturbation of the algorithm used to identify the community structure.
We show the results obtained with the proposed technique on simulated and real
datasets.
","[{'version': 'v1', 'created': 'Mon, 17 Oct 2016 11:16:18 GMT'}]",2016-10-18,"[['Carissimo', 'Annamaria', ''], ['Cutillo', 'Luisa', ''], ['Defeis', 'Italia', '']]","['community detection', 'networks', 'variation of information', 'multiple testing']"
19700,1609.02375,Julius Mboli Sechang,Julius Sechang Mboli,"Feasibility Study on Disaster Management with Hybrid Network of LTE and
  Satellite Links",This is a summary of my MSc Dissertation. It has 8 pages,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We are highly vulnerable to either natural or artificial catastrophes and
therefore, Public Protection and Disaster Relief (PPDR) operators need reliable
wireless communications for successful operations especially in critical rescue
missions. PPDR dedicated or commercial terrestrial networks have always been
used which at most times lead to unsuccessful operations. This is due to the
fact these networks are all infrastructure-based which can be destroyed, fail
to deliver the required service or the networks are not able to support and
sustain the sudden traffic surge. Long-Term Evolution (LTE) is earmarked as the
future candidate technology for PPDR purpose and so much have been put into it
in terms of research, perhaps suitable architecture that will meet
mission-critical requirements can be developed. This can only work if
terrestrial networks will always be available. Unfortunately, in worst case
scenarios, infrastructures might get damaged totally or might be destroyed by
subsequent disasters. As a result, adequate guarantees can only be possible in
the hypothesis of very high financial involvement. Fortunately, considering
availability, coverage ubiquity and reliability, satellite technologies have
lately proven good. So, to maximize the high channel performance of terrestrial
networks and the availability and reliability of non-terrestrial networks, the
solution lies in a hybrid system. It is on this ground that this work deals
with the integration of LTE and satellite networks in both infrastructure-based
and infrastructure-less topologies for PPDR purpose. It is aim at providing
people trapped in disaster and field operators with a transparent accessibility
and guaranteed coverage even when infrastructures are damaged. The requirements
are defined and the model simulated. The network is able to provide network
coverage, enhanced capacity and promised greater resilience.
","[{'version': 'v1', 'created': 'Thu, 8 Sep 2016 11:21:27 GMT'}]",2016-09-09,"[['Mboli', 'Julius Sechang', '']]","['; Emergency network', 'service requirements', 'user requirements', 'TETRA', 'TETRAPOL', 'PPDR dedicated networks', 'Satellites Communications']"
19701,1106.2402,Savitha Vijay Savitha Vijay,"K.Savitha, DR.C.Chandrasekar","Network Selection Using TOPSIS in Vertical Handover Decision Schemes for
  Heterogeneous Wireless Networks",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  ""Handover"" is one of the techniques used to achieve the service continuity in
Fourth generation wireless networks (FGWNs). Seamless continuity is the main
goal in fourth generation Wireless networks (FGWNs), when a mobile terminal
(MT) is in overlapping area for service continuity Handover mechanism are
mainly used While moving in the heterogeneous wireless networks continual
connection is the main challenge. Vertical handover is used as a technique to
minimize the processing delay in heterogeneous wireless networks this paper,
Vertical handover decision schemes are compared and Technique of order
preference by similarity to ideal solution (TOPSIS) in a distributed manner.
TOPSIS is used to choose the best network from the available Visitor networks
(VTs) for the continuous connection by the mobile terminal. In our work we
mainly concentrated to the handover decision Phase and to reduce the processing
delay in the period of handover
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2011 08:54:20 GMT'}]",2011-06-14,"[['Savitha', 'K.', ''], ['Chandrasekar', 'DR. C.', '']]","['Handover', 'Vertical handover', 'Heterogeneous wireless networks', 'Vertical handoff decision schemes', 'MADM', 'TOPSIS']"
19702,1410.4398,Biju Issac,B. Issac,Secure ARP and Secure DHCP Protocols to Mitigate Security Attacks,"12 pages. available in Issac, B. (2009). Secure ARP and Secure DHCP
  Protocols to Mitigate Security Attacks, International Journal of Network
  Security (IJNS), ISSN 1816-353X (print), ISSN 1816-3548 (online), 8(1),
  102-113",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For network computers to communicate to one another, they need to know one
another's IP address and MAC address. Address Resolution Protocol (ARP) is
developed to find the Ethernet address that map to a specific IP address. The
source computer broadcasts the request for Ethernet address and eventually the
target computer replies. The IP to Ethernet address mapping would later be
stored in an ARP Cache for some time duration, after which the process is
repeated. Since ARP is susceptible to ARP poisoning attacks, we propose to make
it unicast, centralized and secure, along with a secure design of DHCP protocol
to mitigate MAC spoofing. The secure protocol designs are explained in detail.
Lastly we also discuss some performance issues to show how the proposed
protocols work.
","[{'version': 'v1', 'created': 'Thu, 16 Oct 2014 12:43:21 GMT'}]",2014-10-17,"[['Issac', 'B.', '']]","['Address Resolution Protocol', 'DHCP', 'MAC address', 'network security']"
19703,1401.0396,Marek Piotr\'ow,Marek Piotr\'ow,Faster 3-Periodic Merging Networks,,,,,cs.DS cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of merging two sorted sequences on a comparator
network that is used repeatedly, that is, if the output is not sorted, the
network is applied again using the output as input. The challenging task is to
construct such networks of small depth. The first constructions of merging
networks with a constant period were given by Kuty{\l}owski, Lory\'s and
Oesterdikhoff. They have given $3$-periodic network that merges two sorted
sequences of $N$ numbers in time $12\log N$ and a similar network of period $4$
that works in $5.67\log N$. We present a new family of such networks that are
based on Canfield and Williamson periodic sorter. Our $3$-periodic merging
networks work in time upper-bounded by $6\log N$. The construction can be
easily generalized to larger constant periods with decreasing running time, for
example, to $4$-periodic ones that work in time upper-bounded by $4\log N$.
Moreover, to obtain the facts we have introduced a new proof technique.
","[{'version': 'v1', 'created': 'Thu, 2 Jan 2014 09:24:17 GMT'}]",2014-01-03,"[['Piotrów', 'Marek', '']]","['parallel merging', 'comparison networks', 'merging networks', 'periodic networks', 'comparators', 'oblivious merging']"
19704,1010.2604,Enrico Tassi,"Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tassi","Regular Expressions, au point",,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a new technique for constructing a finite state deterministic
automaton from a regular expression, based on the idea of marking a suitable
set of positions inside the expression, intuitively representing the possible
points reached after the processing of an initial prefix of the input string.
Pointed regular expressions join the elegance and the symbolic appealingness of
Brzozowski's derivatives, with the effectiveness of McNaughton and Yamada's
labelling technique, essentially combining the best of the two approaches.
","[{'version': 'v1', 'created': 'Wed, 13 Oct 2010 09:07:13 GMT'}]",2010-10-14,"[['Asperti', 'Andrea', ''], ['Coen', 'Claudio Sacerdoti', ''], ['Tassi', 'Enrico', '']]","['Regular expressions', 'Finite States Automata', 'Derivatives']"
19705,0803.3670,Mathew Francis,"L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan",On the cubicity of AT-free graphs and circular-arc graphs,"9 pages, 0 figures",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A unit cube in $k$ dimensions ($k$-cube) is defined as the the Cartesian
product $R_1\times R_2\times...\times R_k$ where $R_i$(for $1\leq i\leq k$) is
a closed interval of the form $[a_i,a_i+1]$ on the real line. A graph $G$ on
$n$ nodes is said to be representable as the intersection of $k$-cubes (cube
representation in $k$ dimensions) if each vertex of $G$ can be mapped to a
$k$-cube such that two vertices are adjacent in $G$ if and only if their
corresponding $k$-cubes have a non-empty intersection. The \emph{cubicity} of
$G$ denoted as $\cubi(G)$ is the minimum $k$ for which $G$ can be represented
as the intersection of $k$-cubes.
  We give an $O(bw\cdot n)$ algorithm to compute the cube representation of a
general graph $G$ in $bw+1$ dimensions given a bandwidth ordering of the
vertices of $G$, where $bw$ is the \emph{bandwidth} of $G$. As a consequence,
we get $O(\Delta)$ upper bounds on the cubicity of many well-known graph
classes such as AT-free graphs, circular-arc graphs and co-comparability graphs
which have $O(\Delta)$ bandwidth. Thus we have: 1) $\cubi(G)\leq 3\Delta-1$, if
$G$ is an AT-free graph. 2) $\cubi(G)\leq 2\Delta+1$, if $G$ is a circular-arc
graph. 3) $\cubi(G)\leq 2\Delta$, if $G$ is a co-comparability graph. Also for
these graph classes, there are constant factor approximation algorithms for
bandwidth computation that generate orderings of vertices with $O(\Delta)$
width. We can thus generate the cube representation of such graphs in
$O(\Delta)$ dimensions in polynomial time.
","[{'version': 'v1', 'created': 'Wed, 26 Mar 2008 07:11:20 GMT'}]",2008-03-27,"[['Chandran', 'L. Sunil', ''], ['Francis', 'Mathew C.', ''], ['Sivadasan', 'Naveen', '']]","['Cubicity', 'bandwidth', 'intersection graphs', 'AT-free graphs', 'circular-arc graphs', 'co-comparability graphs']"
19706,0908.4413,Laurent Romary,"Patrice Lopez (IDSL), Laurent Romary (IDSL, INRIA Saclay - Ile de
  France)",Multiple Retrieval Models and Regression Models for Prior Art Search,,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the system called PATATRAS (PATent and Article Tracking,
Retrieval and AnalysiS) realized for the IP track of CLEF 2009. Our approach
presents three main characteristics: 1. The usage of multiple retrieval models
(KL, Okapi) and term index definitions (lemma, phrase, concept) for the three
languages considered in the present track (English, French, German) producing
ten different sets of ranked results. 2. The merging of the different results
based on multiple regression models using an additional validation set created
from the patent collection. 3. The exploitation of patent metadata and of the
citation structures for creating restricted initial working sets of patents and
for producing a final re-ranking regression model. As we exploit specific
metadata of the patent documents and the citation relations only at the
creation of initial working sets and during the final post ranking step, our
architecture remains generic and easy to extend.
","[{'version': 'v1', 'created': 'Sun, 30 Aug 2009 18:50:19 GMT'}]",2009-09-01,"[['Lopez', 'Patrice', '', 'IDSL'], ['Romary', 'Laurent', '', 'IDSL, INRIA Saclay - Ile de\n  France']]","['Patent', 'Prior Art Search', 'Multilinguality', 'Regression models', 'Re-ranking']"
19707,1702.04650,Julia Padberg,Julia Padberg,Towards M-Adhesive Categories based on Coalgebras and Comma Categories,,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this contribution we investigate several extensions of the powerset that
comprise arbitrarily nested subsets, and call them superpower set. This allows
the definition of graphs with possibly infinitely nested nodes. additionally we
define edges that are incident to edges. Since we use coalgebraic constructions
we refer to these graphs as corecursive graphs. The superpower set functors are
examined and then used for the definition of $\mathcal{M}$-adhesive categories
which are the basic categories for $\mathcal{M}$-adhesive transformation
systems. So, we additionally show that coalgebras $\mathbf{Sets}_F$ are
$\mathcal{M}$-adhesive categories provided the functor $F:\mathbf{Sets}_F \to
\mathbf{Sets}_F$ preserves pullbacks along monomorphisms.
","[{'version': 'v1', 'created': 'Wed, 15 Feb 2017 15:22:39 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Mar 2017 14:29:54 GMT'}, {'version': 'v3', 'created': 'Sat, 15 Jul 2017 06:37:37 GMT'}]",2017-07-18,"[['Padberg', 'Julia', '']]","['graph', 'hierarchy', 'coalgebra', 'M-adhesive transformation system']"
19708,1505.05334,Waldemar Koczkodaj Prof.,"W.W. Koczkodaj, M.W. Herman, M. Orlowski",Managing Null Entries in Pairwise Comparisons,5 pages,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper shows how to manage null entries in pairwise comparisons matrices.
Although assessments can be imprecise, since subjective criteria are involved,
the classical pairwise comparisons theory expects all of them to be available.
In practice, some experts may not be able (or available) to provide all
assessments. Therefore managing null entries is a necessary extension of the
pairwise comparisons method. It is shown that certain null entries can be
recovered on the basis of the transitivity property which each pairwise
comparisons matrix is expected to satisfy.
","[{'version': 'v1', 'created': 'Wed, 20 May 2015 11:58:22 GMT'}]",2015-05-21,"[['Koczkodaj', 'W. W.', ''], ['Herman', 'M. W.', ''], ['Orlowski', 'M.', '']]","['uncertainty', 'incomplete information', 'pairwise comparisons', 'consistency-driven approach', 'comparative assessments']"
19709,1507.00695,Daryl DeFord,Daryl R. DeFord and Scott D. Pauls,A new framework for dynamical models on multiplex networks,"30 pages, 7 figures, 4 tables. Revised and expanded from previous
  version",,,,cs.SI cs.MA physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many complex systems have natural representations as multi-layer networks.
While these formulations retain more information than standard single-layer
network models, there is not yet a fully developed theory for computing network
metrics and statistics on these objects. We introduce a family of models of
multiplex processes motivated by dynamical applications and investigate the
properties of their spectra both theoretically and computationally. We study
special cases of multiplex diffusion and Markov dynamics, using the spectral
results to compute their rates of convergence. We use our framework to define a
version of multiplex eigenvector centrality, which generalizes some existing
notions in the literature. Last, we compare our operator to
structurally-derived models on synthetic and real-world networks, helping
delineate the contexts in which the different frameworks are appropriate.
","[{'version': 'v1', 'created': 'Thu, 2 Jul 2015 18:52:31 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Mar 2017 19:19:49 GMT'}]",2017-03-17,"[['DeFord', 'Daryl R.', ''], ['Pauls', 'Scott D.', '']]","['Multiplex Network', 'Diffusion', 'Random Walks', 'Social Networks']"
19710,1008.0775,Armen Bagdasaryan,Armen Bagdasaryan,"Systems Theoretic Techniques for Modeling, Control, and Decision Support
  in Complex Dynamic Systems","58 pages, 24 figures, 1 table; a book chapter published by Bentham
  Science",,,,cs.SY cs.AI cs.MA math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We discuss the problems of modeling, control, and decision support in complex
dynamic systems from a general system theoretic point of view. The main
characteristics of complex systems and of system approach to complex system
study are considered. We provide an overview and analysis of known existing
paradigms and methods of mathematical modeling and simulation of complex
systems, which support the processes of control and decision making. Then we
continue with the general dynamic modeling and simulation technique for complex
hierarchical systems functioning in control loop. Architectural and structural
models of computer information system intended for simulation and decision
support in complex systems are presented.
","[{'version': 'v1', 'created': 'Wed, 4 Aug 2010 13:29:57 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Dec 2013 15:31:39 GMT'}]",2013-12-30,"[['Bagdasaryan', 'Armen', '']]","['Modeling', 'control', 'decision', 'complex dynamic systems', 'complex hierarchical systems']"
19711,1609.09642,Aaron Jackson,"Aaron Jackson, Michel Valstar, Georgios Tzimiropoulos",A CNN Cascade for Landmark Guided Semantic Part Segmentation,accepted to Geometry Meets Deep Learning ECCV 2016 Workshop,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a CNN cascade for semantic part segmentation guided by
pose-specific information encoded in terms of a set of landmarks (or
keypoints). There is large amount of prior work on each of these tasks
separately, yet, to the best of our knowledge, this is the first time in
literature that the interplay between pose estimation and semantic part
segmentation is investigated. To address this limitation of prior work, in this
paper, we propose a CNN cascade of tasks that firstly performs landmark
localisation and then uses this information as input for guiding semantic part
segmentation. We applied our architecture to the problem of facial part
segmentation and report large performance improvement over the standard
unguided network on the most challenging face datasets. Testing code and models
will be published online at http://cs.nott.ac.uk/~psxasj/.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2016 09:11:13 GMT'}]",2016-10-03,"[['Jackson', 'Aaron', ''], ['Valstar', 'Michel', ''], ['Tzimiropoulos', 'Georgios', '']]","['pose estimation', 'landmark localisation', 'semantic part segmentation', 'faces']"
19712,1303.7012,Abedelaziz  Mohaisen,Abedelaziz Mohaisen and Omar Alrawi,Unveiling Zeus,"Accepted to SIMPLEX 2013 (a workshop held in conjunction with WWW
  2013)",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Malware family classification is an age old problem that many Anti-Virus (AV)
companies have tackled. There are two common techniques used for
classification, signature based and behavior based. Signature based
classification uses a common sequence of bytes that appears in the binary code
to identify and detect a family of malware. Behavior based classification uses
artifacts created by malware during execution for identification. In this paper
we report on a unique dataset we obtained from our operations and classified
using several machine learning techniques using the behavior-based approach.
Our main class of malware we are interested in classifying is the popular Zeus
malware. For its classification we identify 65 features that are unique and
robust for identifying malware families. We show that artifacts like file
system, registry, and network features can be used to identify distinct malware
families with high accuracy---in some cases as high as 95%.
","[{'version': 'v1', 'created': 'Thu, 28 Mar 2013 00:11:54 GMT'}]",2013-03-29,"[['Mohaisen', 'Abedelaziz', ''], ['Alrawi', 'Omar', '']]","['Malware', 'Classification', 'Automatic Analysis']"
19713,1303.6094,Anna Zygmunt,"Jaros{\l}aw Ko\'zlak, Anna Zygmunt, Edward Nawarecki","Modelling and analysing relations between entities using the
  multi-agents and social network approaches",,IEEE 2012,,,cs.SI cs.MA physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, the concept of a system for analysing social relations between
entities using the social network analysis and multi-agent system approaches is
presented. The following problems especially appear within the domain of our
interests: identification of the most influential individuals in a given
society, identification of roles played by the given individuals in that
society and the recognition of groups of individuals strongly connected with
one another. For the analysis of these problems, two application domains are
selected: an analysis of data regarding phone calls and analysis of Internet
Weblogs.
","[{'version': 'v1', 'created': 'Mon, 25 Mar 2013 11:32:08 GMT'}]",2013-03-26,"[['Koźlak', 'Jarosław', ''], ['Zygmunt', 'Anna', ''], ['Nawarecki', 'Edward', '']]","['Social Network Analysis', 'Multi-agent systems', 'groups', 'blogosphere', 'phone calls']"
19714,0712.3830,Tom Schrijvers,"Tom Schrijvers, Bart Demoen, David S. Warren",TCHR: a framework for tabled CLP,Accepted for publication in Theory and Practice of Logic Programming,,,,cs.PL,,"  Tabled Constraint Logic Programming is a powerful execution mechanism for
dealing with Constraint Logic Programming without worrying about fixpoint
computation. Various applications, e.g in the fields of program analysis and
model checking, have been proposed. Unfortunately, a high-level system for
developing new applications is lacking, and programmers are forced to resort to
complicated ad hoc solutions.
  This papers presents TCHR, a high-level framework for tabled Constraint Logic
Programming. It integrates in a light-weight manner Constraint Handling Rules
(CHR), a high-level language for constraint solvers, with tabled Logic
Programming. The framework is easily instantiated with new application-specific
constraint domains. Various high-level operations can be instantiated to
control performance. In particular, we propose a novel, generalized technique
for compacting answer sets.
","[{'version': 'v1', 'created': 'Wed, 26 Dec 2007 15:28:16 GMT'}]",2007-12-27,"[['Schrijvers', 'Tom', ''], ['Demoen', 'Bart', ''], ['Warren', 'David S.', '']]","['Constraint Logic Programming', 'Constraint Handling Rules', 'tabled execution']"
19715,1802.06950,Tirthankar Ghosal,"Tirthankar Ghosal, Amitra Salam, Swati Tiwari, Asif Ekbal, Pushpak
  Bhattacharyya",TAP-DLND 1.0 : A Corpus for Document Level Novelty Detection,"Accepted for publication in Language Resources and Evaluation
  Conference (LREC) 2018",,,,cs.CL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Detecting novelty of an entire document is an Artificial Intelligence (AI)
frontier problem that has widespread NLP applications, such as extractive
document summarization, tracking development of news events, predicting impact
of scholarly articles, etc. Important though the problem is, we are unaware of
any benchmark document level data that correctly addresses the evaluation of
automatic novelty detection techniques in a classification framework. To bridge
this gap, we present here a resource for benchmarking the techniques for
document level novelty detection. We create the resource via event-specific
crawling of news documents across several domains in a periodic manner. We
release the annotated corpus with necessary statistics and show its use with a
developed system for the problem in concern.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 03:42:11 GMT'}]",2018-02-21,"[['Ghosal', 'Tirthankar', ''], ['Salam', 'Amitra', ''], ['Tiwari', 'Swati', ''], ['Ekbal', 'Asif', ''], ['Bhattacharyya', 'Pushpak', '']]","['document novelty', 'web crawling', 'dataset']"
19716,1403.0667,James Voss,"James Voss, Mikhail Belkin, Luis Rademacher",The Hidden Convexity of Spectral Clustering,22 pages,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, spectral clustering has become a standard method for data
analysis used in a broad range of applications. In this paper we propose a new
class of algorithms for multiway spectral clustering based on optimization of a
certain ""contrast function"" over the unit sphere. These algorithms, partly
inspired by certain Independent Component Analysis techniques, are simple, easy
to implement and efficient.
  Geometrically, the proposed algorithms can be interpreted as hidden basis
recovery by means of function optimization. We give a complete characterization
of the contrast functions admissible for provable basis recovery. We show how
these conditions can be interpreted as a ""hidden convexity"" of our optimization
problem on the sphere; interestingly, we use efficient convex maximization
rather than the more common convex minimization. We also show encouraging
experimental results on real and simulated data.
","[{'version': 'v1', 'created': 'Tue, 4 Mar 2014 02:48:20 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Oct 2015 21:59:05 GMT'}, {'version': 'v3', 'created': 'Wed, 4 May 2016 18:10:13 GMT'}]",2016-05-05,"[['Voss', 'James', ''], ['Belkin', 'Mikhail', ''], ['Rademacher', 'Luis', '']]","['spectral clustering', 'convex maximization', 'basis recovery']"
19717,1607.02665,Anurag Kumar,"Anurag Kumar, Bhiksha Raj",Classifier Risk Estimation under Limited Labeling Resources,PAKDD 2018,,,,cs.LG stat.AP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose strategies for estimating performance of a
classifier when labels cannot be obtained for the whole test set. The number of
test instances which can be labeled is very small compared to the whole test
data size. The goal then is to obtain a precise estimate of classifier
performance using as little labeling resource as possible. Specifically, we try
to answer, how to select a subset of the large test set for labeling such that
the performance of a classifier estimated on this subset is as close as
possible to the one on the whole test set. We propose strategies based on
stratified sampling for selecting this subset. We show that these strategies
can reduce the variance in estimation of classifier accuracy by a significant
amount compared to simple random sampling (over 65% in several cases). Hence,
our proposed methods are much more precise compared to random sampling for
accuracy estimation under restricted labeling resources. The reduction in
number of samples required (compared to random sampling) to estimate the
classifier accuracy with only 1% error is high as 60% in some cases.
","[{'version': 'v1', 'created': 'Sat, 9 Jul 2016 21:18:23 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Feb 2018 20:18:35 GMT'}]",2018-02-21,"[['Kumar', 'Anurag', ''], ['Raj', 'Bhiksha', '']]","['Classifier Evaluation', 'Labeling Test Data', 'Stratified Sampling', 'Optimal Allocation']"
19718,1504.05469,Yury Kashnitsky,Yury Kashnitsky,Visual analytics in FCA-based clustering,"11 pages, 3 figures, 2 algorithms, 3rd International Conference on
  Analysis of Images, Social Networks and Texts (AIST'2014). in Supplementary
  Proceedings of the 3rd International Conference on Analysis of Images, Social
  Networks and Texts (AIST 2014), Vol. 1197, CEUR-WS.org, 2014",,,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Visual analytics is a subdomain of data analysis which combines both human
and machine analytical abilities and is applied mostly in decision-making and
data mining tasks. Triclustering, based on Formal Concept Analysis (FCA), was
developed to detect groups of objects with similar properties under similar
conditions. It is used in Social Network Analysis (SNA) and is a basis for
certain types of recommender systems. The problem of triclustering algorithms
is that they do not always produce meaningful clusters. This article describes
a specific triclustering algorithm and a prototype of a visual analytics
platform for working with obtained clusters. This tool is designed as a testing
frameworkis and is intended to help an analyst to grasp the results of
triclustering and recommender algorithms, and to make decisions on
meaningfulness of certain triclusters and recommendations.
","[{'version': 'v1', 'created': 'Tue, 21 Apr 2015 15:28:23 GMT'}]",2015-04-22,"[['Kashnitsky', 'Yury', '']]","['visual analytics', 'formal concept analysis', 'triclustering', 'socialnetwork analysis']"
19719,1602.06654,Chunhua Shen,"Guosheng Lin, Fayao Liu, Chunhua Shen, Jianxin Wu, Heng Tao Shen",Structured Learning of Binary Codes with Column Generation,20 pages,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hashing methods aim to learn a set of hash functions which map the original
features to compact binary codes with similarity preserving in the Hamming
space. Hashing has proven a valuable tool for large-scale information
retrieval. We propose a column generation based binary code learning framework
for data-dependent hash function learning. Given a set of triplets that encode
the pairwise similarity comparison information, our column generation based
method learns hash functions that preserve the relative comparison relations
within the large-margin learning framework. Our method iteratively learns the
best hash functions during the column generation procedure. Existing hashing
methods optimize over simple objectives such as the reconstruction error or
graph Laplacian related loss functions, instead of the performance evaluation
criteria of interest---multivariate performance measures such as the AUC and
NDCG. Our column generation based method can be further generalized from the
triplet loss to a general structured learning based framework that allows one
to directly optimize multivariate performance measures. For optimizing general
ranking measures, the resulting optimization problem can involve exponentially
or infinitely many variables and constraints, which is more challenging than
standard structured output learning. We use a combination of column generation
and cutting-plane techniques to solve the optimization problem. To speed-up the
training we further explore stage-wise training and propose to use a simplified
NDCG loss for efficient inference. We demonstrate the generality of our method
by applying it to ranking prediction and image retrieval, and show that it
outperforms a few state-of-the-art hashing methods.
","[{'version': 'v1', 'created': 'Mon, 22 Feb 2016 06:02:25 GMT'}]",2016-02-23,"[['Lin', 'Guosheng', ''], ['Liu', 'Fayao', ''], ['Shen', 'Chunhua', ''], ['Wu', 'Jianxin', ''], ['Shen', 'Heng Tao', '']]","['Binary code', 'Hashing', 'Nearest neighbor search', 'Ranking', 'Structured learning']"
19720,1401.7741,Mevlut Bulut Dr,Mevlut Bulut,"ReducedCBT and SuperCBT, Two New and Improved Complete Binary Tree
  Structures","12 pages research paper, contains 6 figures and a table",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Between the leaves and the nodes of a complete binary tree, a separate
parent-child-sister hierarchy is employed independent of the
parent-child-sister hierarchy used for the rest of the tree. Two different
versions of such a local hierarchy are introduced. The result of the first
proposed hierarchy is a faster and smaller footprint, while the second one
provides the size variation functionality without a significant computational
overhead. This novel approach brings considerable memory gains and performance
boosts to the complete binary tree based algorithms.
","[{'version': 'v1', 'created': 'Thu, 30 Jan 2014 05:16:01 GMT'}]",2014-01-31,"[['Bulut', 'Mevlut', '']]","['complete binary tree', 'CBT', 'ReducedCBT', 'SuperCBT', 'priority queue', 'pending event set', 'data structure', 'event driven simulation']"
19721,1004.0243,Lennart Nacke,"Anders Drachen, Lennart E. Nacke, Georgios Yannakakis, Anja Lee
  Pedersen",Psychophysiological Correlations with Gameplay Experience Dimensions,"CHI 2010 Workshop: Brain, Body, and Bytes",,,,cs.HC cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we report a case study using two easy-to-deploy
psychophysiological measures - electrodermal activity (EDA) and heart rate (HR)
- and correlating them with a gameplay experience questionnaire (GEQ) in an
attempt to establish this mixed-methods approach for rapid application in a
commercial game development context. Results indicate that there is a
statistically significant correlation (p < 0.01) between measures of
psychophysiological arousal (HR, EDA) and self-reported UX in games (GEQ), with
some variation between the EDA and HR measures. Results are consistent across
three major commercial First-Person Shooter (FPS) games.
","[{'version': 'v1', 'created': 'Thu, 1 Apr 2010 21:52:36 GMT'}]",2010-04-05,"[['Drachen', 'Anders', ''], ['Nacke', 'Lennart E.', ''], ['Yannakakis', 'Georgios', ''], ['Pedersen', 'Anja Lee', '']]","['User experience (UX)', 'digital games', 'psychophysiology', 'affective gaming', 'empirical methods (quantitative)']"
19722,1511.07915,Richard Mayne Mr.,"James G. H. Whiting, Richard Mayne, Nadine Moody, Ben de Lacy
  Costello, Andrew Adamatzky",Practical circuits with Physarum Wires,,,,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Purpose: Protoplasmic tubes of Physarum polycephalum, also know as Physarum
Wires (PW), have been previously suggested as novel bio- electronic components.
Until recently, practical examples of electronic circuits using PWs have been
limited. These PWs have been shown to be self repairing, offering significant
advantage over traditional electronic components. This article documents work
performed to produce practical circuits using PWs. Method: We have demonstrated
through manufacture and testing of hybrid circuits that PWs can be used to
produce a variety of practical electronic circuits. A purality of different
applications of PWs have been tested to show the universality of PWs in
analogue and digital electronics. Results: Voltage dividers can be produced
using a pair of PWs in series with an output voltage accurate to within 12%.
PWs can also transmit analogue and digital data with a frequency of up to 19
kHz, which with the addition of a buffer, can drive high current circuits. We
have demonstrated that PWs can last approximately two months, a 4 fold increase
on previous literature. Protoplasmic tubes can be modified with the addition of
conductive or magnetic nano-particles to provide changes in functionality.
Conclusion This work has documented novel macro-scale data transmission through
biological material; it has advanced the field of bio-electronics by providing
a cheap and easy to grow conducting bio-material which may be used in future
hybrid electronic technology.
","[{'version': 'v1', 'created': 'Tue, 24 Nov 2015 23:19:18 GMT'}]",2015-11-26,"[['Whiting', 'James G. H.', ''], ['Mayne', 'Richard', ''], ['Moody', 'Nadine', ''], ['Costello', 'Ben de Lacy', ''], ['Adamatzky', 'Andrew', '']]","['Slime Mould', 'Protoplasmic tubes', 'Bioelectronics', 'Hybridcircuits']"
19723,1207.7241,Anissa Lamani,"Sayaka Kamei, Anissa Lamani (MIS), Fukuhito Ooshita, S\'ebastien
  Tixeuil","Gathering an even number of robots in an odd ring without global
  multiplicity detection",arXiv admin note: text overlap with arXiv:1104.5660,,,,cs.DC cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a gathering protocol for an even number of robots in a ring-shaped
network that allows symmetric but not periodic configurations as initial
configurations, yet uses only local weak multiplicity detection. Robots are
assumed to be anonymous and oblivious, and the execution model is the non-
atomic CORDA model with asynchronous fair scheduling. In our scheme, the number
of robots k must be greater than 8, the number of nodes n on a network must be
odd and greater than k+3. The running time of our protocol is O(n2)
asynchronous rounds.
","[{'version': 'v1', 'created': 'Sun, 17 Jun 2012 20:05:09 GMT'}]",2012-08-01,"[['Kamei', 'Sayaka', '', 'MIS'], ['Lamani', 'Anissa', '', 'MIS'], ['Ooshita', 'Fukuhito', ''], ['Tixeuil', 'Sébastien', '']]","['Asynchronous Gathering', 'Local Weak Multiplicity Detection', 'Robots']"
19724,1802.06515,Marcelo Cicconet,"M. Cicconet, H. Elliott, D.L. Richmond, D. Wainstock, M. Walsh","Image Forensics: Detecting duplication of scientific images with
  manipulation-invariant image similarity","12 pages; 6 figures; keywords: siamese network, similarity metric,
  image forensics, image manipulation",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Manipulation and re-use of images in scientific publications is a concerning
problem that currently lacks a scalable solution. Current tools for detecting
image duplication are mostly manual or semi-automated, despite the availability
of an overwhelming target dataset for a learning-based approach. This paper
addresses the problem of determining if, given two images, one is a manipulated
version of the other by means of copy, rotation, translation, scale,
perspective transform, histogram adjustment, or partial erasing. We propose a
data-driven solution based on a 3-branch Siamese Convolutional Neural Network.
The ConvNet model is trained to map images into a 128-dimensional space, where
the Euclidean distance between duplicate images is smaller than or equal to 1,
and the distance between unique images is greater than 1. Our results suggest
that such an approach has the potential to improve surveillance of the
published and in-peer-review literature for image manipulation.
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 04:41:24 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Aug 2018 17:34:29 GMT'}, {'version': 'v3', 'created': 'Tue, 17 Mar 2020 16:27:48 GMT'}]",2020-03-18,"[['Cicconet', 'M.', ''], ['Elliott', 'H.', ''], ['Richmond', 'D. L.', ''], ['Wainstock', 'D.', ''], ['Walsh', 'M.', '']]","['siamese network', 'similarity metric', 'image forensics', 'image manipulation']"
19725,1606.07188,Ju Yang,"Ju Yang, Jiancong Tong, Rebecca J. Stones, Zhaohua Zhang, Benjun Ye,
  Gang Wang, Xiaoguang Liu",Selective Term Proximity Scoring Via BP-ANN,,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When two terms occur together in a document, the probability of a close
relationship between them and the document itself is greater if they are in
nearby positions. However, ranking functions including term proximity (TP)
require larger indexes than traditional document-level indexing, which slows
down query processing. Previous studies also show that this technique is not
effective for all types of queries. Here we propose a document ranking model
which decides for which queries it would be beneficial to use a proximity-based
ranking, based on a collection of features of the query. We use a machine
learning approach in determining whether utilizing TP will be beneficial.
Experiments show that the proposed model returns improved rankings while also
reducing the overhead incurred as a result of using TP statistics.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2016 05:02:24 GMT'}]",2016-06-24,"[['Yang', 'Ju', ''], ['Tong', 'Jiancong', ''], ['Stones', 'Rebecca J.', ''], ['Zhang', 'Zhaohua', ''], ['Ye', 'Benjun', ''], ['Wang', 'Gang', ''], ['Liu', 'Xiaoguang', '']]","['Information retrieval', 'Term proximity', 'Query EffectivenessPrediction']"
19726,1605.00448,Sihyun Jeong,"Sihyun Jeong, Giseop Noh, Hayoung Oh, Chong-kwon Kim",Follow Spam Detection based on Cascaded Social Information,"34 pages,10 figures, Preprint submitted to Elsevier Information
  Sciences",,,,cs.SI cs.IR,http://creativecommons.org/licenses/by/4.0/,"  In the last decade we have witnessed the explosive growth of online social
networking services (SNSs) such as Facebook, Twitter, RenRen and LinkedIn.
While SNSs provide diverse benefits for example, forstering interpersonal
relationships, community formations and news propagation, they also attracted
uninvited nuiance. Spammers abuse SNSs as vehicles to spread spams rapidly and
widely. Spams, unsolicited or inappropriate messages, significantly impair the
credibility and reliability of services. Therefore, detecting spammers has
become an urgent and critical issue in SNSs. This paper deals with Follow spam
in Twitter. Instead of spreading annoying messages to the public, a spammer
follows (subscribes to) legitimate users, and followed a legitimate user. Based
on the assumption that the online relationships of spammers are different from
those of legitimate users, we proposed classification schemes that detect
follow spammers. Particularly, we focused on cascaded social relations and
devised two schemes, TSP-Filtering and SS-Filtering, each of which utilizes
Triad Significance Profile (TSP) and Social status (SS) in a two-hop subnetwork
centered at each other. We also propose an emsemble technique,
Cascaded-Filtering, that combine both TSP and SS properties. Our experiments on
real Twitter datasets demonstrated that the proposed three approaches are very
practical. The proposed schemes are scalable because instead of analyzing the
whole network, they inspect user-centered two hop social networks. Our
performance study showed that proposed methods yield significantly better
performance than prior scheme in terms of true positives and false positives.
","[{'version': 'v1', 'created': 'Mon, 2 May 2016 11:58:51 GMT'}]",2016-05-04,"[['Jeong', 'Sihyun', ''], ['Noh', 'Giseop', ''], ['Oh', 'Hayoung', ''], ['Kim', 'Chong-kwon', '']]","['Online Social Network', 'Security', 'Twitter', 'Follow Spam', 'Triad', 'Status theory']"
19727,1701.03633,Riccardo Satta,"Riccardo Satta, Stefano Cavallari, Eraldo Pomponi, Daniele Grasselli,
  Davide Picheo, Carlo Annis","A dissimilarity-based approach to predictive maintenance with
  application to HVAC systems","keywords: predictive maintenance, condition-based maintenance,
  prognosis, machine learning, dissimilarity-based representation, HVAC. 15
  pages",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The goal of predictive maintenance is to forecast the occurrence of faults of
an appliance, in order to proactively take the necessary actions to ensure its
availability. In many application scenarios, predictive maintenance is applied
to a set of homogeneous appliances. In this paper, we firstly review taxonomies
and main methodologies currently used for condition-based maintenance;
secondly, we argue that the mutual dissimilarities of the behaviours of all
appliances of this set (the ""cohort"") can be exploited to detect upcoming
faults. Specifically, inspired by dissimilarity-based representations, we
propose a novel machine learning approach based on the analysis of concurrent
mutual differences of the measurements coming from the cohort. We evaluate our
method over one year of historical data from a cohort of 17 HVAC (Heating,
Ventilation and Air Conditioning) systems installed in an Italian hospital. We
show that certain kinds of faults can be foreseen with an accuracy, measured in
terms of area under the ROC curve, as high as 0.96.
","[{'version': 'v1', 'created': 'Fri, 13 Jan 2017 11:31:35 GMT'}]",2017-01-16,"[['Satta', 'Riccardo', ''], ['Cavallari', 'Stefano', ''], ['Pomponi', 'Eraldo', ''], ['Grasselli', 'Daniele', ''], ['Picheo', 'Davide', ''], ['Annis', 'Carlo', '']]","['\u200b \u200bpredictive maintenance', 'condition-based maintenance', 'prognosis', 'machine learning', 'dissimilarity-based representation', 'HVAC']"
19728,1307.2018,Christos Tryfonopoulos Dr.,"Jenny Rompa, Giorgos Lepouras, Costas Vassilakis, Christos
  Tryfonopoulos",OntoFM: A Personal Ontology-based File Manager for the Desktop,ISWC 2011 Demo,,,ISWC 2011 Demo,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Personal ontologies have been proposed as a means to support the semantic
management of user information. Assuming that a personal ontology system is in
use, new tools have to be developed at user interface level to exploit the
enhanced capabilities offered by the system. In this work, we present an
ontology-based file manager that allows semantic searching on the user's
personal information space. The file manager exploits the ontology relations to
present files associated with specific concepts, proposes new related concepts
to users, and helps them explore the information space and locate the required
file.
","[{'version': 'v1', 'created': 'Mon, 8 Jul 2013 10:16:00 GMT'}]",2013-08-22,"[['Rompa', 'Jenny', ''], ['Lepouras', 'Giorgos', ''], ['Vassilakis', 'Costas', ''], ['Tryfonopoulos', 'Christos', '']]","['ontology', 'file manager', 'personal information management']"
19729,1506.00935,Hastagiri Prakash Vanchinathan,"Hastagiri P. Vanchinathan, Andreas Marfurt, Charles-Antoine Robelin,
  Donald Kossmann, Andreas Krause",Discovering Valuable Items from Massive Data,,,,,cs.LG cs.AI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Suppose there is a large collection of items, each with an associated cost
and an inherent utility that is revealed only once we commit to selecting it.
Given a budget on the cumulative cost of the selected items, how can we pick a
subset of maximal value? This task generalizes several important problems such
as multi-arm bandits, active search and the knapsack problem. We present an
algorithm, GP-Select, which utilizes prior knowledge about similarity be- tween
items, expressed as a kernel function. GP-Select uses Gaussian process
prediction to balance exploration (estimating the unknown value of items) and
exploitation (selecting items of high value). We extend GP-Select to be able to
discover sets that simultaneously have high utility and are diverse. Our
preference for diversity can be specified as an arbitrary monotone submodular
function that quantifies the diminishing returns obtained when selecting
similar items. Furthermore, we exploit the structure of the model updates to
achieve an order of magnitude (up to 40X) speedup in our experiments without
resorting to approximations. We provide strong guarantees on the performance of
GP-Select and apply it to three real-world case studies of industrial
relevance: (1) Refreshing a repository of prices in a Global Distribution
System for the travel industry, (2) Identifying diverse, binding-affine
peptides in a vaccine de- sign task and (3) Maximizing clicks in a web-scale
recommender system by recommending items to users.
","[{'version': 'v1', 'created': 'Tue, 2 Jun 2015 16:01:46 GMT'}]",2015-06-08,"[['Vanchinathan', 'Hastagiri P.', ''], ['Marfurt', 'Andreas', ''], ['Robelin', 'Charles-Antoine', ''], ['Kossmann', 'Donald', ''], ['Krause', 'Andreas', '']]","['Design of experiments', 'Active search', 'Active learning', 'Kernel methods', 'Recommender systems']"
19730,1705.06609,Edgar Martinez-Moro,"M. Borges-Quintana, and M.A. Borges-Trenard and E. Martinez-Moro",On the weak order ideal associated to linear codes,arXiv admin note: substantial text overlap with arXiv:1411.7493,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we study a weak order ideal associated with the coset leaders of
a non-binary linear code. This set allows the incrementally computation of the
coset leaders and the definitions of the set of leader codewords. This set of
codewords has some nice properties related to the monotonicity of the weight
compatible order on the generalized support of a vector in $\mathbb F_q^n$
which allow us to describe a test set, a trial set and the set of zero
neighbours of a linear code in terms of the leader codewords.
","[{'version': 'v1', 'created': 'Wed, 17 May 2017 17:34:35 GMT'}]",2017-05-19,"[['Borges-Quintana', 'M.', ''], ['Borges-Trenard', 'M. A.', ''], ['Martinez-Moro', 'E.', '']]","['Linear codes', 'order ideals', 'test set', 'trial set', 'zero neighbours', 'correctable errors']"
19731,1704.05476,Nilanjan De Dr.,Nilanjan De,"Computing Reformulated First Zagreb Index of Some Chemical Graphs as an
  Application of Generalized Hierarchical Product of Graphs",12 pages,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The generalized hierarchical product of graphs was introduced by L.
Barri\'ere et al in 2009. In this paper, reformulated first Zagreb index of
generalized hierarchical product of two connected graphs and hence as a special
case cluster product of graphs are obtained. Finally using the derived results
the reformulated first Zagreb index of some chemically important graphs such as
square comb lattice, hexagonal chain, molecular graph of truncated cube, dimer
fullerene, zig-zag polyhex nanotube and dicentric dendrimers are computed.
","[{'version': 'v1', 'created': 'Tue, 18 Apr 2017 18:02:39 GMT'}]",2017-04-20,"[['De', 'Nilanjan', '']]","['Topological Index', 'Zagreb Index', 'Reformulated Zagreb Index', 'Graph Operations', 'Composite graphs', 'Generalised Hierarchical Product']"
19732,1108.0574,Xihui Chen,"Xihui Chen, Gabriele Lenzini, Sjouke Mauw, Jun Pang",A Group Signature Based Electronic Toll Pricing System,,,,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the prevalence and development of GNSS technologies, location-based
vehicle services (LBVS) have experienced a rapid growth in recent years.
However, location is a sensitive and private piece of information, so the
design and development of such services just take the clients' privacy concerns
into account. In this paper, we propose a new electronic toll pricing system
based on group signatures, which provides a strong guarantee for the clients'
anonymity within groups. Our system achieves a balance between privacy and the
communication overhead imposed upon the users.
","[{'version': 'v1', 'created': 'Tue, 2 Aug 2011 13:58:52 GMT'}, {'version': 'v2', 'created': 'Sat, 3 Sep 2011 23:04:22 GMT'}]",2011-09-06,"[['Chen', 'Xihui', ''], ['Lenzini', 'Gabriele', ''], ['Mauw', 'Sjouke', ''], ['Pang', 'Jun', '']]","['electronic toll pricing systems', 'security protocols', 'privacy']"
19733,1701.08059,Mohamad Jaafar Ali,"Mohamad Jaafar Ali, Hassine Moungla, Mohamed Younis, Ahmed Mehaoua","Efficient Medium Access Arbitration Among Interfering WBANs Using Latin
  Rectangles",2017 Ad Hoc Networks - ELSEVIER,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The overlap of transmission ranges among multiple Wireless Body Area Networks
(WBANs) is referred to as coexistence. The interference is most likely to
affect the communication links and degrade the performance when sensors of
different WBANs simultaneously transmit using the same channel. In this paper,
we propose a distributed approach that adapts to the size of the network, i.e.,
the number of coexisting WBANs, and to the density of sensors forming each
individual WBAN in order to minimize the impact of co-channel interference
through dynamic channel hopping based on Latin rectangles. Furthermore, the
proposed approach opts to reduce the overhead resulting from channel hopping,
and lowers the transmission delay, and saves the power resource at both sensor-
and WBAN-levels. Specifically, we propose two schemes for channel allocation
and medium access scheduling to diminish the probability of inter-WBAN
interference. The first scheme, namely, Distributed Interference Avoidance
using Latin rectangles (DAIL), assigns channel and time-slot combination that
reduces the probability of medium access collision. DAIL suits crowded areas,
e.g., high density of coexisting WBANs, and involves overhead due to frequent
channel hopping at the WBAN coordinator and sensors. The second scheme, namely,
CHIM, takes advantage of the relatively lower density of collocated WBANs to
save power by hopping among channels only when interference is detected at the
level of the individual nodes. We present an analytical model that derives the
collision probability and network throughput. The performance of DAIL and CHIM
is further validated through simulations.
","[{'version': 'v1', 'created': 'Fri, 27 Jan 2017 14:19:49 GMT'}]",2017-01-30,"[['Ali', 'Mohamad Jaafar', ''], ['Moungla', 'Hassine', ''], ['Younis', 'Mohamed', ''], ['Mehaoua', 'Ahmed', '']]","['WBAN', 'Interference', 'Channel Hopping', 'TDMA', 'Latin Square']"
19734,1410.4156,Manas Joglekar,"Foto Afrati, Manas Joglekar, Christopher R\'e, Semih Salihoglu,
  Jeffrey D. Ullman",GYM: A Multiround Join Algorithm In MapReduce,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multiround algorithms are now commonly used in distributed data processing
systems, yet the extent to which algorithms can benefit from running more
rounds is not well understood. This paper answers this question for a spectrum
of rounds for the problem of computing the equijoin of $n$ relations.
Specifically, given any query $Q$ with width $\w$, {\em intersection width}
$\iw$, input size $\mathrm{IN}$, output size $\mathrm{OUT}$, and a cluster of
machines with $M$ memory available per machine, we show that:
  (1) $Q$ can be computed in $O(n)$ rounds with $O(n\frac{(\mathrm{IN}^{\w} +
\mathrm{OUT})^2}{M})$ communication cost.
  (2) $Q$ can be computed in $O(\log(n))$ rounds with
$O(n\frac{(\mathrm{IN}^{\max(\w, 3\iw)} + \mathrm{OUT})^2}{M})$ communication
cost. \end{itemize} Intersection width is a new notion of queries and
generalized hypertree decompositions (GHDs) of queries we introduce to capture
how connected the adjacent cyclic components of the GHDs are.
  We achieve our first result by introducing a distributed and generalized
version of Yannakakis's algorithm, called GYM. GYM takes as input any GHD of
$Q$ with width $\w$ and depth $d$, and computes $Q$ in $O(d + \log(n))$ rounds
and $O(n\frac{(\mathrm{IN}^{\w} + \mathrm{OUT})^2}{M})$ communication cost. We
achieve our second result by showing how to construct GHDs of $Q$ with width
$\max(\w, 3\iw)$ and depth $O(\log(n))$. We describe another technique to
construct GHDs with longer widths and shorter depths, demonstrating a spectrum
of tradeoffs one can make between communication and the number of rounds.
","[{'version': 'v1', 'created': 'Wed, 15 Oct 2014 18:25:22 GMT'}, {'version': 'v2', 'created': 'Sun, 1 Feb 2015 07:37:45 GMT'}, {'version': 'v3', 'created': 'Sun, 25 Oct 2015 21:02:33 GMT'}, {'version': 'v4', 'created': 'Sun, 6 Dec 2015 22:46:12 GMT'}, {'version': 'v5', 'created': 'Sat, 30 Jul 2016 04:48:02 GMT'}, {'version': 'v6', 'created': 'Wed, 3 Aug 2016 03:35:45 GMT'}, {'version': 'v7', 'created': 'Sat, 21 Jan 2017 04:39:07 GMT'}, {'version': 'v8', 'created': 'Thu, 26 Jan 2017 04:51:19 GMT'}]",2017-01-27,"[['Afrati', 'Foto', ''], ['Joglekar', 'Manas', ''], ['Ré', 'Christopher', ''], ['Salihoglu', 'Semih', ''], ['Ullman', 'Jeffrey D.', '']]","['Joins', 'Yannakakis', 'Bulk Synchronous Processing', 'GHDs']"
19735,1111.0228,Philippe Gaborit,"Carlos Aguilar-Melchor, Philippe Gaborit, Jon-Lark Kim, Lin Sok and
  Patrick Sol\'e","Classification of extremal and $s$-extremal binary self-dual codes of
  length 38","revised version - paper submitted (4/4/2011) to IEEE trans.
  Information and accepted 20/10/2011",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we classify all extremal and $s$-extremal binary self-dual
codes of length 38. There are exactly 2744 extremal $[38,19,8]$ self-dual
codes, two $s$-extremal $[38,19,6]$ codes, and 1730 $s$-extremal $[38,19,8]$
codes. We obtain our results from the use of a recursive algorithm used in the
recent classification of all extremal self-dual codes of length 36, and from a
generalization of this recursive algorithm for the shadow. The classification
of $s$-extremal $[38,19,6]$ codes permits to achieve the classification of all
$s$-extremal codes with d=6.
","[{'version': 'v1', 'created': 'Tue, 1 Nov 2011 15:59:01 GMT'}]",2011-11-02,"[['Aguilar-Melchor', 'Carlos', ''], ['Gaborit', 'Philippe', ''], ['Kim', 'Jon-Lark', ''], ['Sok', 'Lin', ''], ['Solé', 'Patrick', '']]","['Classification', 'recursive construction', 'extremal', 'self-dual codes', 's-extremal', 'shadow']"
19736,1002.4820,Yann Desalle,"Yann Desalle (CLLE, Lordat), Bruno Gaume (CLLE), Karine Duvignau
  (CLLE, Erss)",SLAM : Solutions lexicales automatique pour m\'etaphores,30 pages,"Traitement Automatique des Langues 50, 1 (2009) 145--175",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents SLAM, an Automatic Solver for Lexical Metaphors like
?d\'eshabiller* une pomme? (to undress* an apple). SLAM calculates a
conventional solution for these productions. To carry on it, SLAM has to
intersect the paradigmatic axis of the metaphorical verb ?d\'eshabiller*?,
where ?peler? (?to peel?) comes closer, with a syntagmatic axis that comes from
a corpus where ?peler une pomme? (to peel an apple) is semantically and
syntactically regular. We test this model on DicoSyn, which is a ?small world?
network of synonyms, to compute the paradigmatic axis and on Frantext.20, a
French corpus, to compute the syntagmatic axis. Further, we evaluate the model
with a sample of an experimental corpus of the database of Flexsem
","[{'version': 'v1', 'created': 'Thu, 25 Feb 2010 16:27:36 GMT'}]",2010-02-26,"[['Desalle', 'Yann', '', 'CLLE, Lordat'], ['Gaume', 'Bruno', '', 'CLLE'], ['Duvignau', 'Karine', '', 'CLLE, Erss']]","['metaphor', 'synonym', 'proxsem', 'gaph', 'Small world', 'prox', 'flexsem', 'syntex']"
19737,1603.08102,Mansaf Alam Dr,"Shweta Malhotra, Mohammad Najmud Doja, Bashir Alam, Mansaf Alam","GENMR: Generalized Query Processing through Map Reduce In Cloud Database
  Management System",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Big Data, Cloud computing, Cloud Database Management techniques, Data Science
and many more are the fantasizing words which are the future of IT industry.
For all the new techniques one common thing is that they deal with Data, not
just Data but the Big Data. Users store their various kinds of data on cloud
repositories. Cloud Database Management System deals with such large sets of
data. For processing such gigantic amount of data, traditional approaches are
not suitable because these approaches are not able to handle such size of data.
To handle these, various solutions have been developed such as Hadoop, Map
Reduce Programming codes, HIVE, PIG etc. Map Reduce codes provides both
scalability and reliability. But till date, users are habitual of SQL, Oracle
kind of codes for dealing with data and they are not aware of Map Reduce codes.
In this paper, a generalized model GENMR has been implemented, which takes
queries written in various RDBMS forms like SQL, ORACLE, DB2, MYSQL and convert
into Map Reduce codes. A comparison has been done to evaluate the performance
of GENMR with latest techniques like HIVE and PIG and it has been concluded
that GENMR shows much better performance as compare to both the techniques. We
also introduce an optimization technique for mapper placement problems to
enhance the effect of parallelism which improves the performance of such
Amalgam approach.
","[{'version': 'v1', 'created': 'Sat, 26 Mar 2016 11:43:41 GMT'}]",2016-03-29,"[['Malhotra', 'Shweta', ''], ['Doja', 'Mohammad Najmud', ''], ['Alam', 'Bashir', ''], ['Alam', 'Mansaf', '']]","['Map Reduce', 'Cloud Database Management System CDBMS', 'CDBMS Layers', 'Conceptual Middleware Layer', 'Map Reduce Compiler', 'GENMR']"
19738,1004.0772,Secretary Aircc Journal,"Jean-Francois Lalande, David Rodriguez and Christian Toinard (Ensi de
  Bourges, France)",Security properties in an open peer-to-peer network,17Pages,"International Journal of Network Security & Its Applications 1.3
  (2009) 73-89",,,cs.CR cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper proposes to address new requirements of confidentiality, integrity
and availability properties fitting to peer-to-peer domains of resources. The
enforcement of security properties in an open peer-topeer network remains an
open problem as the literature have mainly proposed contribution on
availability of resources and anonymity of users. That paper proposes a novel
architecture that eases the administration of a peer-to-peer network. It
considers a network of safe peer-to-peer clients in the sense that it is a
commune client software that is shared by all the participants to cope with the
sharing of various resources associated with different security requirements.
However, our proposal deals with possible malicious peers that attempt to
compromise the requested security properties. Despite the safety of an open
peer-to-peer network cannot be formally guaranteed, since a end user has
privileges on the target host, our solution provides several advanced security
enforcement. First, it enables to formally define the requested security
properties of the various shared resources. Second, it evaluates the trust and
the reputation of the requesting peer by sending challenges that test the
fairness of its peer-to-peer security policy. Moreover, it proposes an advanced
Mandatory Access Control that enforces the required peer-to-peer security
properties through an automatic projection of the requested properties onto
SELinux policies. Thus, the SELinux system of the requesting peer is
automatically configured with respect to the required peer-to-peer security
properties.
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2010 04:49:49 GMT'}]",2010-07-15,"[['Lalande', 'Jean-Francois', '', 'Ensi de\n  Bourges, France'], ['Rodriguez', 'David', '', 'Ensi de\n  Bourges, France'], ['Toinard', 'Christian', '', 'Ensi de\n  Bourges, France']]","['Peer-to-peer', 'security properties', 'SELinux']"
19739,1607.02052,Jonathan Lambrechts,Jean-Fran\c{c}ois Remacle and Jonathan Lambrechts,"Fast and robust mesh generation on the sphere Application to coastal
  domains",Submitted to the 25th international meshing round table,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a fast an robust mesh generation procedure that is able
to generate meshes of the earth system (ocean and continent) in matters of
seconds. Our algorithm takes as input a standard shape-file i.e. geospatial
vector data format for geographic information system (GIS) software. The input
is initially coarsened in order to automatically remove unwanted channels that
are under a desired resolution. A valid non-overlapping 1D mesh is then created
on the sphere using the Euclidian coordinates system $x,y,z$. A modified
Delaunay kernel is then proposed that enables to generate meshes on the sphere
in a straightforward manner without parametrization. One of the main difficulty
in dealing with geographical data is the over-sampled nature of coastline
representations. We propose here an algorithm that automatically unrefines
coastline data. Small features are automatically removed while always keeping a
valid (non-overlapping) geometrical representation of the domain. A Delaunay
refinement procedure is subsequently applied to the domain. The refinement
scheme is also multi-threaded at a fine grain level, allowing to generate about
a million points per second on 8 threads. Examples of meshes of the Baltic sea
as well as of the global ocean are presented.
","[{'version': 'v1', 'created': 'Thu, 7 Jul 2016 15:40:29 GMT'}]",2016-07-08,"[['Remacle', 'Jean-François', ''], ['Lambrechts', 'Jonathan', '']]","['Delaunay triangulation on the sphere', 'Geophysical flows', 'Parallel meshing']"
19740,1409.4762,Hasan Tavakoli,Hassan Tavakoli,"Source and Channel Optimal Rate LDPC Code Design for one Sender in
  BE-MAC with Source Correlation","This Paper is a draft of final paper which represented in 7th
  International Symposium on Telecommunications (IST'2014)",,,,cs.IT math.IT,http://creativecommons.org/licenses/by/3.0/,"  In this paper, we present an extension of the semidefinite programming
formulation of the optimal rate code design in single link Binary Erasure
Channel (BEC) proposed by the authors to the Binary Erasure Multiple Access
Channel (BE-MAC) with two sources correlation. This new way can be easily
extended to the multiple access senders. Simulation results show the efficiency
and effectiveness of the new approach in practice.
","[{'version': 'v1', 'created': 'Tue, 16 Sep 2014 18:21:01 GMT'}]",2014-09-18,"[['Tavakoli', 'Hassan', '']]","['component; Binary Erasure Channel', 'Binary Erasure Multiple Access Channel', 'Linear Programming', 'Nonlinear Programming', 'Semidefinite Programming']"
19741,1712.04393,Nayuta Yanagisawa,"Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Nayuta
  Yanagisawa","A characterization of colorless anonymous $t$-resilient task
  computability",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A task is a distributed problem for $n$ processes, in which each process
starts with a private input value, communicates with other processes, and
eventually decides an output value. A task is colorless if each process can
adopt the input or output value of another process. Colorless tasks are well
studied in the non-anonymous shared-memory model where each process has a
distinct identifier that can be used to access a single-writer/multi-reader
shared register. In the anonymous case, where processes have no identifiers and
communicate through multi-writer/multi-reader registers, there is a recent
topological characterization of the colorless tasks that are solvable when any
number of asynchronous processes may crash.
  In this paper we study the case where at most $t$ processes may crash, where
$1 \le t < n$. We prove that a colorless task is $t$-resilient solvable
non-anonymously if and only if it is $t$-resilient solvable anonymously. This
implies a complete characterization of colorless anonymous t-resilient
asynchronous task computability.
","[{'version': 'v1', 'created': 'Tue, 12 Dec 2017 17:02:08 GMT'}]",2017-12-13,"[['Delporte-Gallet', 'Carole', ''], ['Fauconnier', 'Hugues', ''], ['Rajsbaum', 'Sergio', ''], ['Yanagisawa', 'Nayuta', '']]","['Distributed problems', 'Formal specifications', 'Tasks', 'Sequential specifications', 'Linearizability', 'Long-livedobjects']"
19742,1702.05695,Emilio Ferrara,"Anna Sapienza, Alessandro Bessi, Emilio Ferrara","Non-negative Tensor Factorization for Human Behavioral Pattern Mining in
  Online Games","9 pages, 6 figures, submitted to KDD'17",,,,cs.LG cs.HC cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multiplayer online battle arena has become a popular game genre. It also
received increasing attention from our research community because they provide
a wealth of information about human interactions and behaviors. A major problem
is extracting meaningful patterns of activity from this type of data, in a way
that is also easy to interpret. Here, we propose to exploit tensor
decomposition techniques, and in particular Non-negative Tensor Factorization,
to discover hidden correlated behavioral patterns of play in a popular game:
League of Legends. We first collect the entire gaming history of a group of
about one thousand players, totaling roughly $100K$ matches. By applying our
methodological framework, we then separate players into groups that exhibit
similar features and playing strategies, as well as similar temporal
trajectories, i.e., behavioral progressions over the course of their gaming
history: this will allow us to investigate how players learn and improve their
skills.
","[{'version': 'v1', 'created': 'Sun, 19 Feb 2017 03:19:50 GMT'}]",2017-02-21,"[['Sapienza', 'Anna', ''], ['Bessi', 'Alessandro', ''], ['Ferrara', 'Emilio', '']]","['Non-negative tensor factorization', 'temporal and topological paternmining', 'human behavior', 'multiplayer online game']"
19743,1603.08367,Markus Thom,"Markus Thom and G\""unther Palm",Sparse Activity and Sparse Connectivity in Supervised Learning,"See http://jmlr.org/papers/v14/thom13a.html for the authoritative
  version","Journal of Machine Learning Research, vol. 14, pp. 1091-1143, 2013",,,cs.LG cs.CG cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sparseness is a useful regularizer for learning in a wide range of
applications, in particular in neural networks. This paper proposes a model
targeted at classification tasks, where sparse activity and sparse connectivity
are used to enhance classification capabilities. The tool for achieving this is
a sparseness-enforcing projection operator which finds the closest vector with
a pre-defined sparseness for any given vector. In the theoretical part of this
paper, a comprehensive theory for such a projection is developed. In
conclusion, it is shown that the projection is differentiable almost everywhere
and can thus be implemented as a smooth neuronal transfer function. The entire
model can hence be tuned end-to-end using gradient-based methods. Experiments
on the MNIST database of handwritten digits show that classification
performance can be boosted by sparse activity or sparse connectivity. With a
combination of both, performance can be significantly better compared to
classical non-sparse approaches.
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2016 12:06:49 GMT'}]",2016-04-19,"[['Thom', 'Markus', ''], ['Palm', 'Günther', '']]","['supervised learning', 'sparseness projection', 'sparse activity', 'sparse connectivity']"
19744,1108.5766,Alexandre Miguel Pinto,Alexandre Miguel Pinto and Lu\'s Moniz Pereira,Each normal logic program has a 2-valued Minimal Hypotheses semantics,"15 pages Proceedings of the 19th International Conference on
  Applications of Declarative Programming and Knowledge Management (INAP 2011)",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we explore a unifying approach --- that of hypotheses
assumption --- as a means to provide a semantics for all Normal Logic Programs
(NLPs), the Minimal Hypotheses (MH) semantics. This semantics takes a positive
hypotheses assumption approach as a means to guarantee the desirable properties
of model existence, relevance and cumulativity, and of generalizing the Stable
Models in the process. To do so we first introduce the fundamental semantic
concept of minimality of assumed positive hypotheses, define the MH semantics,
and analyze the semantics' properties and applicability. Indeed, abductive
Logic Programming can be conceptually captured by a strategy centered on the
assumption of abducibles (or hypotheses). Likewise, the Argumentation
perspective of Logic Programs also lends itself to an arguments (or hypotheses)
assumption approach. Previous works on Abduction have depicted the atoms of
default negated literals in NLPs as abducibles, i.e., assumable hypotheses. We
take a complementary and more general view than these works to NLP semantics by
employing positive hypotheses instead.
","[{'version': 'v1', 'created': 'Mon, 29 Aug 2011 21:46:07 GMT'}]",2011-08-31,"[['Pinto', 'Alexandre Miguel', ''], ['Pereira', 'Luś Moniz', '']]","['Hypotheses', 'Semantics', 'NLPs', 'Abduction', 'Argumentation']"
19745,1111.2111,Song Liu Mr,"Song Liu, Peter Flach, Nello Cristianini","Generic Multiplicative Methods for Implementing Machine Learning
  Algorithms on MapReduce",,,,,cs.DS cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we introduce a generic model for multiplicative algorithms
which is suitable for the MapReduce parallel programming paradigm. We implement
three typical machine learning algorithms to demonstrate how similarity
comparison, gradient descent, power method and other classic learning
techniques fit this model well. Two versions of large-scale matrix
multiplication are discussed in this paper, and different methods are developed
for both cases with regard to their unique computational characteristics and
problem settings. In contrast to earlier research, we focus on fundamental
linear algebra techniques that establish a generic approach for a range of
algorithms, rather than specific ways of scaling up algorithms one at a time.
Experiments show promising results when evaluated on both speedup and accuracy.
Compared with a standard implementation with computational complexity $O(m^3)$
in the worst case, the large-scale matrix multiplication experiments prove our
design is considerably more efficient and maintains a good speedup as the
number of cores increases. Algorithm-specific experiments also produce
encouraging results on runtime performance.
","[{'version': 'v1', 'created': 'Wed, 9 Nov 2011 06:39:17 GMT'}, {'version': 'v2', 'created': 'Fri, 2 Dec 2011 02:08:47 GMT'}]",2011-12-05,"[['Liu', 'Song', ''], ['Flach', 'Peter', ''], ['Cristianini', 'Nello', '']]","['Multiplicative Model', 'Machine Learning', 'MapReduce']"
19746,1305.1979,Irit Dinur,Irit Dinur and David Steurer,Analytical Approach to Parallel Repetition,"Improved presentation, expanded and rewrote sections about expanding
  and general games",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an analytical framework for studying parallel repetition, a basic
product operation for one-round two-player games. In this framework, we
consider a relaxation of the value of a game, $\mathrm{val}_+$, and prove that
for projection games, it is both multiplicative (under parallel repetition) and
a good approximation for the true value.
  These two properties imply a parallel repetition bound as $$
\mathrm{val}(G^{\otimes k}) \approx \mathrm{val}_+(G^{\otimes k}) =
\mathrm{val}_+(G)^{k} \approx \mathrm{val}(G)^{k}. $$
  Using this framework, we can also give a short proof for the NP-hardness of
Label-Cover$(1,\delta)$ for all $\delta>0$, starting from the basic PCP
theorem.
  We prove the following new results:
  - A parallel repetition bound for projection games with small soundness.
Previously, it was not known whether parallel repetition decreases the value of
such games. This result implies stronger inapproximability bounds for Set-Cover
and Label-Cover.
  - An improved bound for few parallel repetitions of projection games, showing
that Raz's counterexample is tight even for a small number of repetitions.
  Our techniques also allow us to bound the value of the direct product of
multiple games, namely, a bound on $\mathrm{val}(G_1\otimes ...\otimes G_k)$
for different projection games $G_1,...,G_k$.
","[{'version': 'v1', 'created': 'Thu, 9 May 2013 00:22:17 GMT'}, {'version': 'v2', 'created': 'Wed, 15 May 2013 02:07:42 GMT'}, {'version': 'v3', 'created': 'Mon, 7 Jul 2014 07:25:40 GMT'}]",2014-07-08,"[['Dinur', 'Irit', ''], ['Steurer', 'David', '']]","['parallel repetition', 'one-round two-player games', 'label cover', 'set cover', 'hardness ofapproximation', 'copositive programming', 'operator norms']"
19747,1009.4318,S. M. Masud Karim Mr.,"Mst. Farhana Rahman, S. M. Masud Karim, Kazi Shah Nawaz Ripon and Md.
  Iqbal Hossain Suvo","Performance Analysis of Estimation of Distribution Algorithm and Genetic
  Algorithm in Zone Routing Protocol","5 pages, 5 figures, International Journal of Computer Science and
  Information Security (IJCSIS), ISSN: 1947-5500, Vol. 8, No. 5, pp. 203-207,
  August 2010, Pittsburgh, USA",,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, Estimation of Distribution Algorithm (EDA) is used for Zone
Routing Protocol (ZRP) in Mobile Ad-hoc Network (MANET) instead of Genetic
Algorithm (GA). It is an evolutionary approach, and used when the network size
grows and the search space increases. When the destination is outside the zone,
EDA is applied to find the route with minimum cost and time. The implementation
of proposed method is compared with Genetic ZRP, i.e., GZRP and the result
demonstrates better performance for the proposed method. Since the method
provides a set of paths to the destination, it results in load balance to the
network. As both EDA and GA use random search method to reach the optimal
point, the searching cost reduced significantly, especially when the number of
data is large.
","[{'version': 'v1', 'created': 'Wed, 22 Sep 2010 10:14:31 GMT'}]",2010-09-23,"[['Rahman', 'Mst. Farhana', ''], ['Karim', 'S. M. Masud', ''], ['Ripon', 'Kazi Shah Nawaz', ''], ['Suvo', 'Md. Iqbal Hossain', '']]","['Mobile Ad-hoc Network', 'Zone Routing Protocol', 'Estimation of Distribution Algorithm', 'Genetic Algorithm']"
19748,1702.05793,Mark Dredze,Ann Irvine and Mark Dredze,"Harmonic Grammar, Optimality Theory, and Syntax Learnability: An
  Empirical Exploration of Czech Word Order",,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work presents a systematic theoretical and empirical comparison of the
major algorithms that have been proposed for learning Harmonic and Optimality
Theory grammars (HG and OT, respectively). By comparing learning algorithms, we
are also able to compare the closely related OT and HG frameworks themselves.
Experimental results show that the additional expressivity of the HG framework
over OT affords performance gains in the task of predicting the surface word
order of Czech sentences. We compare the perceptron with the classic Gradual
Learning Algorithm (GLA), which learns OT grammars, as well as the popular
Maximum Entropy model. In addition to showing that the perceptron is
theoretically appealing, our work shows that the performance of the HG model it
learns approaches that of the upper bound in prediction accuracy on a held out
test set and that it is capable of accurately modeling observed variation.
","[{'version': 'v1', 'created': 'Sun, 19 Feb 2017 20:37:40 GMT'}]",2017-02-21,"[['Irvine', 'Ann', ''], ['Dredze', 'Mark', '']]","['Optimality Theory', 'Harmonic Grammar', 'Learnability', 'Czech']"
19749,1701.01963,Cong Luong Nguyen,"Nguyen Cong Luong, Ping Wang, Dusit Niyato, Wen Yonggang, and Zhu Han","Resource Management in Cloud Networking Using Economic Analysis and
  Pricing Models: A Survey","IEEE Communications Surveys and Tutorials, 2017",,,,cs.GT cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a comprehensive literature review on applications of
economic and pricing models for resource management in cloud networking. To
achieve sustainable profit advantage, cost reduction, and flexibility in
provisioning of cloud resources, resource management in cloud networking
requires adaptive and robust designs to address many issues, e.g., resource
allocation, bandwidth reservation, request allocation, and workload allocation.
Economic and pricing models have received a lot of attention as they can lead
to desirable performance in terms of social welfare, fairness, truthfulness,
profit, user satisfaction, and resource utilization. This paper reviews
applications of the economic and pricing models to develop adaptive algorithms
and protocols for resource management in cloud networking. Besides, we survey a
variety of incentive mechanisms using the pricing strategies in sharing
resources in edge computing. In addition, we consider using pricing models in
cloud-based Software Defined Wireless Networking (cloud-based SDWN). Finally,
we highlight important challenges, open issues and future research directions
of applying economic and pricing models to cloud networking
","[{'version': 'v1', 'created': 'Sun, 8 Jan 2017 14:32:54 GMT'}]",2017-01-10,"[['Luong', 'Nguyen Cong', ''], ['Wang', 'Ping', ''], ['Niyato', 'Dusit', ''], ['Yonggang', 'Wen', ''], ['Han', 'Zhu', '']]","['Cloud networking', 'resource management', 'pricingmodels', 'economic models']"
19750,1701.02298,Pivithuru Wijegunawardana,"Pivithuru Wijegunawardana, Vatsal Ojha, Ralucca Gera, Sucheta
  Soundarajan",Sampling a Network to Find Nodes of Interest,,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The focus of the current research is to identify people of interest in social
networks. We are especially interested in studying dark networks, which
represent illegal or covert activity. In such networks, people are unlikely to
disclose accurate information when queried. We present REDLEARN, an algorithm
for sampling dark networks with the goal of identifying as many nodes of
interest as possible. We consider two realistic lying scenarios, which describe
how individuals in a dark network may attempt to conceal their connections. We
test and present our results on several real-world multilayered networks, and
show that REDLEARN achieves up to a 340% improvement over the next best
strategy.
","[{'version': 'v1', 'created': 'Mon, 9 Jan 2017 18:45:47 GMT'}]",2017-01-10,"[['Wijegunawardana', 'Pivithuru', ''], ['Ojha', 'Vatsal', ''], ['Gera', 'Ralucca', ''], ['Soundarajan', 'Sucheta', '']]","['multilayered networks', 'sampling methods', 'lying scenarios', 'nodes ofinterest']"
19751,1406.4057,Aarne Ranta,Aarne Ranta,Embedded Controlled Languages,"7 pages, extended abstract, preprint for CNL 2014 in Galway",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Inspired by embedded programming languages, an embedded CNL (controlled
natural language) is a proper fragment of an entire natural language (its host
language), but it has a parser that recognizes the entire host language. This
makes it possible to process out-of-CNL input and give useful feedback to
users, instead of just reporting syntax errors. This extended abstract explains
the main concepts of embedded CNL implementation in GF (Grammatical Framework),
with examples from machine translation and some other ongoing work.
","[{'version': 'v1', 'created': 'Mon, 16 Jun 2014 16:11:32 GMT'}]",2014-06-17,"[['Ranta', 'Aarne', '']]","['controlled language', 'domain-specific language', 'embedded language', 'Grammatical Framework', 'machine translation']"
19752,1507.01906,Ashkan Norouzi-Fard,Abbas Bazzi and Ashkan Norouzi-Fard,Towards Tight Lower Bounds for Scheduling Problems,"25 pages, 3 figures, To appear in the Proceedings of the 23rd Annual
  European Symposium on Algorithms 2015",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show a close connection between structural hardness for $k$-partite graphs
and tight inapproximability results for scheduling problems with precedence
constraints. Assuming a natural but nontrivial generalisation of the bipartite
structural hardness result of Bansal and Khot, we obtain a hardness of
$2-\epsilon$ for the problem of minimising the makespan for scheduling
precedence-constrained jobs with preemption on identical parallel machines.
This matches the best approximation guarantee for this problem. Assuming the
same hypothesis, we also obtain a super constant inapproximability result for
the problem of scheduling precedence-constrained jobs on related parallel
machines, making progress towards settling an open question in both lists of
ten open questions by Williamson and Shmoys, and by Schuurman and Woeginger.
  The study of structural hardness of $k$-partite graphs is of independent
interest, as it captures the intrinsic hardness for a large family of
scheduling problems. Other than the ones already mentioned, this generalisation
also implies tight inapproximability to the problem of minimising the weighted
completion time for precedence-constrained jobs on a single machine, and the
problem of minimising the makespan of precedence-constrained jobs on identical
parallel machine, and hence unifying the results of Bansal and Khot, and
Svensson, respectively.
","[{'version': 'v1', 'created': 'Tue, 7 Jul 2015 18:04:24 GMT'}]",2015-07-08,"[['Bazzi', 'Abbas', ''], ['Norouzi-Fard', 'Ashkan', '']]","['hardness of approximation', 'scheduling problems', 'unique game conjecture']"
19753,1009.3822,Sergio Giro,Sergio Giro,"An algorithmic approximation of the infimum reachability probability for
  Probabilistic Finite Automata","7 pages, 2 figures",,,,cs.LO cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a Probabilistic Finite Automata (PFA), a set of states S, and an error
threshold e > 0, our algorithm approximates the infimum probability
(quantifying over all infinite words) that the automata reaches S. Our result
contrasts with the known result that the approximation problem is undecidable
if we consider the supremum instead of the infimum. Since we study the
probability of reaching a set of states, instead of the probability of ending
in an accepting state, our work is more related to model checking than to
formal languages.
","[{'version': 'v1', 'created': 'Mon, 20 Sep 2010 14:02:21 GMT'}]",2010-09-21,"[['Giro', 'Sergio', '']]","['probabilistic finite automata', 'reachability', 'automatic verification']"
19754,1403.7920,Elisa Gorla,Michele Elia and Elisa Gorla,"Computing the dimension of ideals in group algebras, with an application
  to coding theory","13 pages, submitted",,,,cs.IT math.IT math.RA,http://creativecommons.org/licenses/by/4.0/,"  The problem of computing the dimension of a left/right ideal in a group
algebra F[G] of a finite group G over a field F is considered. The ideal
dimension is related to the rank of a matrix originating from a regular
left/right representation of G; in particular, when F[G] is semisimple, the
dimension of a principal ideal is equal to the rank of the matrix representing
a generator. From this observation, a bound and an efficient algorithm to
compute the dimension of an ideal in a group ring are established. Since group
codes are ideals in finite group rings, the algorithm allows efficient
computation of their dimension.
","[{'version': 'v1', 'created': 'Mon, 31 Mar 2014 09:09:29 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Sep 2019 15:47:46 GMT'}]",2019-09-09,"[['Elia', 'Michele', ''], ['Gorla', 'Elisa', '']]","['Group algebra', 'ideal', 'group code', 'representation', 'rank', 'characteristic polynomial']"
19755,0705.0564,Caleb Lo,"Caleb K. Lo, Sriram Vishwanath and Robert W. Heath Jr",Rate Bounds for MIMO Relay Channels,"25 pages, 6 figures, submitted to Journal on Communications and
  Networks in December 2007, revised in April 2008",,,,cs.IT math.IT,,"  This paper considers the multi-input multi-output (MIMO) relay channel where
multiple antennas are employed by each terminal. Compared to single-input
single-output (SISO) relay channels, MIMO relay channels introduce additional
degrees of freedom, making the design and analysis of optimal cooperative
strategies more complex. In this paper, a partial cooperation strategy that
combines transmit-side message splitting and block-Markov encoding is
presented. Lower bounds on capacity that improve on a previously proposed
non-cooperative lower bound are derived for Gaussian MIMO relay channels.
","[{'version': 'v1', 'created': 'Fri, 4 May 2007 06:43:42 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Dec 2007 17:39:33 GMT'}, {'version': 'v3', 'created': 'Thu, 10 Apr 2008 15:52:35 GMT'}, {'version': 'v4', 'created': 'Fri, 2 May 2008 21:33:42 GMT'}]",2008-05-03,"[['Lo', 'Caleb K.', ''], ['Vishwanath', 'Sriram', ''], ['Heath', 'Robert W.', 'Jr']]","['Relay channels', 'MIMO systems', 'superposition coding', 'dirty-paper coding']"
19756,1501.02795,Luis Quesada,"Luis Quesada, Fernando Berzal, Francisco J. Cortijo","Scanning and Parsing Languages with Ambiguities and Constraints: The
  Lamb and Fence Algorithms","arXiv admin note: text overlap with arXiv:1111.3970, arXiv:1110.1470",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional language processing tools constrain language designers to
specific kinds of grammars. In contrast, model-based language processing tools
decouple language design from language processing. These tools allow the
occurrence of lexical and syntactic ambiguities in language specifications and
the declarative specification of constraints for resolving them. As a result,
these techniques require scanners and parsers able to parse context-free
grammars, handle ambiguities, and enforce constraints for disambiguation. In
this paper, we present Lamb and Fence. Lamb is a scanning algorithm that
supports ambiguous token definitions and the specification of custom pattern
matchers and constraints. Fence is a chart parsing algorithm that supports
ambiguous context-free grammars and the definition of constraints on
associativity, composition, and precedence, as well as custom constraints. Lamb
and Fence, in conjunction, enable the implementation of the ModelCC model-based
language processing tool.
","[{'version': 'v1', 'created': 'Sun, 11 Jan 2015 15:11:15 GMT'}]",2015-01-14,"[['Quesada', 'Luis', ''], ['Berzal', 'Fernando', ''], ['Cortijo', 'Francisco J.', '']]","['Scanners', 'parsers', 'context-free grammars', 'ambiguities', 'constraints']"
19757,1705.08055,Ziling Heng,Ziling Heng,Nearly optimal codebooks based on generalized Jacobi sums,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Codebooks with small inner-product correlation are applied in many practical
applications including direct spread code division multiple access (CDMA)
communications, space-time codes and compressed sensing. It is extremely
difficult to construct codebooks achieving the Welch bound or the Levenshtein
bound. Constructing nearly optimal codebooks such that the ratio of its maximum
cross-correlation amplitude to the corresponding bound approaches 1 is also an
interesting research topic. In this paper, we firstly study a family of
interesting character sums called generalized Jacobi sums over finite fields.
Then we apply the generalized Jacobi sums and their related character sums to
obtain two infinite classes of nearly optimal codebooks with respect to the
Welch or Levenshtein bound. The codebooks can be viewed as generalizations of
some known ones and contain new ones with very flexible parameters.
","[{'version': 'v1', 'created': 'Tue, 23 May 2017 01:52:53 GMT'}, {'version': 'v2', 'created': 'Fri, 11 May 2018 10:26:26 GMT'}]",2018-05-14,"[['Heng', 'Ziling', '']]","['Code division multiple access', 'codebooks', 'signal sets', 'compressed sensing', 'Welchbound', 'Levenshtein bound']"
19758,1705.05464,Leopoldo Armesto,Leopoldo Armesto,"Dise\~na, Fabrica y Programa Tu Propio Robot","21 pages, in Spanish, 10 figures",,,,cs.RO,http://creativecommons.org/licenses/by-sa/4.0/,"  In this document we present DYOR, an educational robot that you can make at
home or at class. The robot has been created by students at the Universitat
Polit\'ecnica de Val\`encia and me through their projects and masther thesis
and it has been used in my subjects at the University so my students dessign,
make and program their own robot with low-cost materials.
","[{'version': 'v1', 'created': 'Mon, 15 May 2017 21:56:00 GMT'}]",2017-05-17,"[['Armesto', 'Leopoldo', '']]","['Robot', 'Arduino', 'Impresi´on 3D', 'Fabricaci´on Digital', 'Electr´onica', 'STEM', 'Programaci´on por Bloques']"
19759,1603.03809,Matthieu Vergne,Matthieu Vergne,Gold Standard for Expert Ranking: A Survey on the XWiki Dataset,"Technical report, 21 pages",,,,cs.SE cs.CY,http://creativecommons.org/publicdomain/zero/1.0/,"  We are designing an automated technique to find and recommend experts for
helping in Requirements Engineering tasks, which can be done by ranking the
available people by level of expertise. For evaluating the correctness of the
rankings produced by the automated technique, we want to compare them to a gold
standard. In this work, we ask external people to look at a set of discussions
and to rank their participants, before to evaluate the reliability of these
rankings to serve as a gold standard. We describe the setting and running of
this survey, the method used to build the gold standard from the rankings of
the subjects, and the analysis of the results to obtain and validate this gold
standard. Through the analysis of the results, we conclude that we obtained a
reasonable gold standard although we lack evidences to support its total
correctness. We also made the interesting observation that the most reliable
subjects build the least ordered rankings (i.e. has few ranks with several
people per rank), which goes against the usual assumptions of Information
Retrieval measures.
","[{'version': 'v1', 'created': 'Fri, 11 Mar 2016 22:26:03 GMT'}]",2016-03-15,"[['Vergne', 'Matthieu', '']]","['Expert Finding', 'Requirements Engineering', 'Gold Standard', 'Survey']"
19760,1304.7468,Aleksandrs Slivkins,"David Kempe, Jon Kleinberg, Sigal Oren and Aleksandrs Slivkins",Selection and Influence in Cultural Dynamics,A one-page abstract of this work has appeared in ACM EC 2013,,,,cs.GT cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the fundamental principles driving diversity or homogeneity in domains
such as cultural differentiation, political affiliation, and product adoption
is the tension between two forces: influence (the tendency of people to become
similar to others they interact with) and selection (the tendency to be
affected most by the behavior of others who are already similar). Influence
tends to promote homogeneity within a society, while selection frequently
causes fragmentation. When both forces act simultaneously, it becomes an
interesting question to analyze which societal outcomes should be expected.
  To study this issue more formally, we analyze a natural stylized model built
upon active lines of work in political opinion formation, cultural diversity,
and language evolution. We assume that the population is partitioned into
""types"" according to some traits (such as language spoken or political
affiliation). While all types of people interact with one another, only people
with sufficiently similar types can possibly influence one another. The
""similarity"" is captured by a graph on types in which individuals of the same
or adjacent types can influence one another. We achieve an essentially complete
characterization of (stable) equilibrium outcomes and prove convergence from
all starting states. We also consider generalizations of this model.
","[{'version': 'v1', 'created': 'Sun, 28 Apr 2013 14:04:56 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Jul 2015 20:10:05 GMT'}, {'version': 'v3', 'created': 'Tue, 27 Oct 2015 17:59:39 GMT'}]",2015-10-28,"[['Kempe', 'David', ''], ['Kleinberg', 'Jon', ''], ['Oren', 'Sigal', ''], ['Slivkins', 'Aleksandrs', '']]","['social networks', 'selection', 'influence', 'opinion formation']"
19761,1301.0785,Dilip Aldar,Dilip S Aldar,Adaptive Intelligent Cooperative Spectrum Sensing In Cognitive Radio,,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Radio Spectrum is most precious and scarce resource and must be utilized
efficiently and effectively. Cognitive radio is the promising solutions for the
optimum utilization of the scared natural resource. The spectrum owned by the
primary user should be shared among the secondary user, but primary user should
not be interfered by the secondary user. In order to utilize the primary user
spectrum, secondary user must detect accurately, the existence of primary in
the band of interest. In cooperative spectrum sensing, the channel between the
secondary users and the cognitive radio base station is non stationary and
causes interference in the decision in decision fusion and in information in
information due to multipath fading. In this paper neural network based
cooperative spectrum sensing method is proposed, the performance of proposed
method is evaluated and observed that, the neural network based scheme
performance improve significantly over the AND,OR and Majority rule
","[{'version': 'v1', 'created': 'Fri, 4 Jan 2013 18:08:30 GMT'}]",2013-01-07,"[['Aldar', 'Dilip S', '']]","['Cognitive radio', 'Cooperative spectrum sensing', 'neural network', 'Secondary Users', 'fusion center']"
19762,1009.4974,S. M. Kamruzzaman,"S. M. Kamruzzaman, Firoz Ahmed Siddiqi, Md. Saiful Islam, Md. Emdadul
  Haque, and Mohammad Shamsul Alam","Rotation Invariant Face Detection Using Wavelet, PCA and Radial Basis
  Function Networks","5 Pages, International Conference","12th International Conference on Human Computer Interaction,
  Beijing, China, Vol. 18, Jul. 2007",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a novel method for human face detection with its
orientation by using wavelet, principle component analysis (PCA) and redial
basis networks. The input image is analyzed by two-dimensional wavelet and a
two-dimensional stationary wavelet. The common goals concern are the image
clearance and simplification, which are parts of de-noising or compression. We
applied an effective procedure to reduce the dimension of the input vectors
using PCA. Radial Basis Function (RBF) neural network is then used as a
function approximation network to detect where either the input image is
contained a face or not and if there is a face exists then tell about its
orientation. We will show how RBF can perform well then back-propagation
algorithm and give some solution for better regularization of the RBF (GRNN)
network. Compared with traditional RBF networks, the proposed network
demonstrates better capability of approximation to underlying functions, faster
learning speed, better size of network, and high robustness to outliers.
","[{'version': 'v1', 'created': 'Sat, 25 Sep 2010 05:46:31 GMT'}]",2010-09-28,"[['Kamruzzaman', 'S. M.', ''], ['Siddiqi', 'Firoz Ahmed', ''], ['Islam', 'Md. Saiful', ''], ['Haque', 'Md. Emdadul', ''], ['Alam', 'Mohammad Shamsul', '']]","['Face detection', '2D wavelet', 'PCA', 'RBF network', 'function approximation', 'image orientation', 'back-propagation network']"
19763,1702.01793,Renato J Cintra,"R. M. Campello de Souza, H. M. de Oliveira, R. J. Cintra",Multiuser Communication Based on the DFT Eigenstructure,"5 pages, 2 figures, 3 tables",,,,cs.IT math.IT stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The eigenstructure of the discrete Fourier transform (DFT) is examined and
new systematic procedures to generate eigenvectors of the unitary DFT are
proposed. DFT eigenvectors are suggested as user signatures for data
communication over the real adder channel (RAC). The proposed multiuser
communication system over the 2-user RAC is detailed.
","[{'version': 'v1', 'created': 'Mon, 6 Feb 2017 21:10:43 GMT'}]",2017-02-08,"[['de Souza', 'R. M. Campello', ''], ['de Oliveira', 'H. M.', ''], ['Cintra', 'R. J.', '']]","['DFT', 'Eigenvectors', 'Real adder channels']"
19764,1510.08892,Meirav Zehavi,Meirav Zehavi,A Randomized Algorithm for Long Directed Cycle,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a directed graph $G$ and a parameter $k$, the {\sc Long Directed Cycle
(LDC)} problem asks whether $G$ contains a simple cycle on at least $k$
vertices, while the {\sc $k$-Path} problems asks whether $G$ contains a simple
path on exactly $k$ vertices. Given a deterministic (randomized) algorithm for
{\sc $k$-Path} as a black box, which runs in time $t(G,k)$, we prove that {\sc
LDC} can be solved in deterministic time $O^*(\max\{t(G,2k),4^{k+o(k)}\})$
(randomized time $O^*(\max\{t(G,2k),4^k\})$). In particular, we get that {\sc
LDC} can be solved in randomized time $O^*(4^k)$.
","[{'version': 'v1', 'created': 'Thu, 29 Oct 2015 20:33:08 GMT'}]",2015-11-02,"[['Zehavi', 'Meirav', '']]","['algorithms', 'parameterized complexity', 'long directed cycle', 'k-path']"
19765,1206.2346,Eduardo Lopez Sandoval,"E. Lopez-Sandoval, A. Mello, J. J. Godina Nava","Power Series Solution to Non-Linear Partial Differential equations of
  Mathematical Physics","17 pages, 0 Figures",,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Power Series Solution method has been used traditionally for to solve Linear
Differential Equations, in Ordinary and Partial form. But this method has been
limited to this kind of problems. We present the solution of problems of Non
Linear Partial Differential equations of Physical Mathematical using power
series.
","[{'version': 'v1', 'created': 'Mon, 11 Jun 2012 00:58:53 GMT'}, {'version': 'v2', 'created': 'Thu, 5 Jul 2012 17:48:01 GMT'}, {'version': 'v3', 'created': 'Mon, 10 Sep 2012 14:10:47 GMT'}, {'version': 'v4', 'created': 'Thu, 1 Nov 2012 16:10:43 GMT'}, {'version': 'v5', 'created': 'Mon, 23 Mar 2015 20:11:59 GMT'}]",2015-03-25,"[['Lopez-Sandoval', 'E.', ''], ['Mello', 'A.', ''], ['Nava', 'J. J. Godina', '']]","['Power series', 'Non Linear Partial Differential Equations', 'Symbolic Computation']"
19766,1312.6782,Avinash Bhute,"Avinash N Bhute, B. B. Meshram","IVSS Integration of Color Feature Extraction Techniques for Intelligent
  Video Search Systems","5 pages, 9 figures. 2012 4th International Conference on Electronics
  Computer Technology - ICECT 2012",,,,cs.CV cs.IR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As large amount of visual Information is available on web in form of images,
graphics, animations and videos, so it is important in internet era to have an
effective video search system. As there are number of video search engine
(blinkx, Videosurf, Google, YouTube, etc.) which search for relevant videos
based on user keyword or term, But very less commercial video search engine are
available which search videos based on visual image/clip/video. In this paper
we are recommending a system that will search for relevant video using color
feature of video in response of user Query.
","[{'version': 'v1', 'created': 'Tue, 24 Dec 2013 09:28:08 GMT'}]",2014-01-03,"[['Bhute', 'Avinash N', ''], ['Meshram', 'B. B.', '']]","['CBVR', 'Video Segmentation', 'Key Feature']"
19767,1312.3779,Ashwin Pananjady,"Sounaka Mishra, Ashwin Pananjady, N Safina Devi","On the Complexity of Making a Distinguished Vertex Minimum or Maximum
  Degree by Vertex Deletion","16 pages, 4 figures, submitted to Elsevier's Journal of Discrete
  Algorithms",,,,cs.DS cs.DM math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate the approximability of two node deletion
problems. Given a vertex weighted graph $G=(V,E)$ and a specified, or
""distinguished"" vertex $p \in V$, MDD(min) is the problem of finding a minimum
weight vertex set $S \subseteq V\setminus \{p\}$ such that $p$ becomes the
minimum degree vertex in $G[V \setminus S]$; and MDD(max) is the problem of
finding a minimum weight vertex set $S \subseteq V\setminus \{p\}$ such that
$p$ becomes the maximum degree vertex in $G[V \setminus S]$. These are known
$NP$-complete problems and have been studied from the parameterized complexity
point of view in previous work. Here, we prove that for any $\epsilon > 0$,
both the problems cannot be approximated within a factor $(1 - \epsilon)\log
n$, unless $NP \subseteq DTIME(n^{\log\log n})$. We also show that for any
$\epsilon > 0$, MDD(min) cannot be approximated within a factor $(1
-\epsilon)\log n$ on bipartite graphs, unless $NP \subseteq DTIME(n^{\log\log
n})$, and that for any $\epsilon > 0$, MDD(max) cannot be approximated within a
factor $(1/2 - \epsilon)\log n$ on bipartite graphs, unless $NP \subseteq
DTIME(n^{\log\log n})$. We give an $O(\log n)$ factor approximation algorithm
for MDD(max) on general graphs, provided the degree of $p$ is $O(\log n)$. We
then show that if the degree of $p$ is $n-O(\log n)$, a similar result holds
for MDD(min). We prove that MDD(max) is $APX$-complete on 3-regular unweighted
graphs and provide an approximation algorithm with ratio $1.583$ when $G$ is a
3-regular unweighted graph. In addition, we show that MDD(min) can be solved in
polynomial time when $G$ is a regular graph of constant degree.
","[{'version': 'v1', 'created': 'Fri, 13 Dec 2013 11:42:19 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Dec 2013 18:34:11 GMT'}, {'version': 'v3', 'created': 'Tue, 14 Jan 2014 12:58:44 GMT'}]",2014-01-15,"[['Mishra', 'Sounaka', ''], ['Pananjady', 'Ashwin', ''], ['Devi', 'N Safina', '']]","['node deletion problems', 'approximation algorithm', 'hardness ofapproximation']"
19768,1310.0441,Hadi Razzaghi Kouchaksaraei,"Hadi Razzaghi Kouchaksaraei, Alexander G. Chefranov","Countering Wrapping Attack on XML Signature in SOAP Message for Cloud
  Computing","6 pages, 10 figures","International Journal of Computer Science and Information Security
  Publication SEPTEMBER 2013, Volume 11 No. 9",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is known that the exchange of information between web applications is done
by means of the SOAP protocol. Securing this protocol is obviously a vital
issue for any computer network. However, when it comes to cloud computing
systems, the sensitivity of this issue rises, as the clients of system, release
their data to the cloud. XML signature is employed to secure SOAP messages.
However, there are also some weak points that have been identified, named as
XML signature wrapping attacks, which have been categorized into four major
groups; Simple Ancestry Context Attack, Optional element context attacks,
Sibling Value Context Attack, Sibling Order Context. In this paper, two
existing methods, for referencing the signed part of SOAP Message, named as ID
referencing and XPath method, are analyzed and examined. In addition, a new
method is proposed and tested, to secure the SOAP message. In the new method,
the XML any signature wrapping attack is prevented by employing the concept of
XML digital signature on the SOAP message. The results of conducted experiments
show that the proposed method is approximately three times faster than the
XPath method and even a little faster than ID.
","[{'version': 'v1', 'created': 'Tue, 1 Oct 2013 19:27:31 GMT'}]",2018-01-31,"[['Kouchaksaraei', 'Hadi Razzaghi', ''], ['Chefranov', 'Alexander G.', '']]","['Cloud Computing', 'SOAP message', 'XML digital']"
19769,1009.4520,S. M. Kamruzzaman,S. M. Kamruzzaman,"An Energy Efficient Multichannel MAC Protocol for Cognitive Radio Ad Hoc
  Networks","8 Pages, International Journal","International Journal of Communication Networks and Information
  Security (IJCNIS), Vol. 2, No. 2, pp. 112-119, Aug. 2010",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a TDMA based energy efficient cognitive radio
multichannel medium access control (MAC) protocol called ECR-MAC for wireless
Ad Hoc Networks. ECR-MAC requires only a single half-duplex radio transceiver
on each node that integrates the spectrum sensing at physical (PHY) layer and
the packet scheduling at MAC layer. In addition to explicit frequency
negotiation which is adopted by conventional multichannel MAC protocols,
ECR-MAC introduces lightweight explicit time negotiation. This two-dimensional
negotiation enables ECR-MAC to exploit the advantage of both multiple channels
and TDMA, and achieve aggressive power savings by allowing nodes that are not
involved in communication to go into doze mode. The IEEE 802.11 standard allows
for the use of multiple channels available at the PHY layer, but its MAC
protocol is designed only for a single channel. A single channel MAC protocol
does not work well in a multichannel environment, because of the multichannel
hidden terminal problem. The proposed energy efficient ECR-MAC protocol allows
SUs to identify and use the unused frequency spectrum in a way that constrains
the level of interference to the primary users (PUs). Extensive simulation
results show that our proposed ECR-MAC protocol successfully exploits multiple
channels and significantly improves network performance by using the licensed
spectrum band opportunistically and protects QoS provisioning over cognitive
radio ad hoc networks.
","[{'version': 'v1', 'created': 'Thu, 23 Sep 2010 05:27:44 GMT'}]",2010-09-28,"[['Kamruzzaman', 'S. M.', '']]","['Cognitive radio', 'multichannel MAC', 'ad hoc networks', 'frequency spectrum', 'TDMA', 'channel sensing', 'QoS']"
19770,1704.08876,Muhammad Ali Awan,"Muhammad Ali Awan and Konstantinos Bletsas and Pedro F. Souto and
  Benny Akesson and Eduardo Tovar",Mixed-criticality Scheduling with Dynamic Redistribution of Shared Cache,"ECRTS 2017, 26 pages",,,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The design of mixed-criticality systems often involvespainful tradeoffs
between safety guarantees and performance.However, the use of more detailed
architectural modelsin the design and analysis of scheduling arrangements for
mixedcriticalitysystems can provide greater confidence in the analysis,but also
opportunities for better performance. Motivated by thisview, we propose an
extension of Vestal 19s model for mixedcriticalitymulticore systems that (i)
accounts for the per-taskpartitioning of the last-level cache and (ii) supports
the dynamicreassignment, for better schedulability, of cache portions
initiallyreserved for lower-criticality tasks to the higher-criticalitytasks,
when the system switches to high-criticality mode. Tothis model, we apply
partitioned EDF scheduling with Ekbergand Yi 19s deadline-scaling technique.
Our schedulability analysisand scalefactor calculation is cognisant of the
cache resourcesassigned to each task, by using WCET estimates that take
intoaccount these resources. It is hence able to leverage the
dynamicreconfiguration of the cache partitioning, at mode change, forbetter
performance, in terms of provable schedulability. We alsopropose heuristics for
partitioning the cache in low- and highcriticalitymode, that promote
schedulability. Our experimentswith synthetic task sets, indicate tangible
improvements inschedulability compared to a baseline cache-aware
arrangementwhere there is no redistribution of cache resources from low-
tohigh-criticality tasks in the event of a mode change.
","[{'version': 'v1', 'created': 'Fri, 28 Apr 2017 11:17:51 GMT'}]",2017-05-01,"[['Awan', 'Muhammad Ali', ''], ['Bletsas', 'Konstantinos', ''], ['Souto', 'Pedro F.', ''], ['Akesson', 'Benny', ''], ['Tovar', 'Eduardo', '']]","['Mixed Criticality Scheduling', 'Vestal Model', 'Dynamic Redistribution ofShared Cache', 'Shared Last-level Cache Analysis', 'Cache-aware Scheduling']"
19771,0806.1377,Vandani Verma,Sunder Lal and Vandani Verma,"An Identity Based Strong Bi-Designated Verifier (t, n) Threshold Proxy
  Signature Scheme","5 Pages, 0 Figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Proxy signature schemes have been invented to delegate signing rights. The
paper proposes a new concept of Identify Based Strong Bi-Designated Verifier
threshold proxy signature (ID-SBDVTPS) schemes. Such scheme enables an original
signer to delegate the signature authority to a group of 'n' proxy signers with
the condition that 't' or more proxy signers can cooperatively sign messages on
behalf of the original signer and the signatures can only be verified by any
two designated verifiers and that they cannot convince anyone else of this
fact.
","[{'version': 'v1', 'created': 'Mon, 9 Jun 2008 06:56:19 GMT'}]",2008-06-10,"[['Lal', 'Sunder', ''], ['Verma', 'Vandani', '']]","['ID Based Cryptography', 'Proxy Signatures', 'Threshold Proxy Signatures', 'Bilinear Pairing', 'Designated Verifiers']"
19772,1009.5098,Avik Chakraborty,Avik Chakraborty,Testing of Bridging Faults in AND-EXOR based Reversible Logic Circuits,"6 pages, 8 figures",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reversible circuits find applications in many areas of Computer Science
including Quantum Computation. This paper examines the testability of an
important subclass of reversible logic circuits that are composed of k-wire
controlled NOT (k-CNOT with k >/- 1) gates. A reversible k-CNOT gate can be
implemented using an irreversible k-input AND gate and an EXOR gate. A
reversible k-CNOT circuit where each k-CNOT gate is realized using irreversible
k-input AND and EXOR gate, has been considered. One of the most commonly used
Single Bridging Fault model (both wired-AND and wired-OR) has been assumed to
be type of fault for such circuits. It has been shown that an (n+p)-input
AND-EXOR based reversible logic circuit with p observable outputs, can be
tested for single bridging faults (SBF) using (3n + \lefthalfcap log2p
\righthalfcap + 2) tests.
","[{'version': 'v1', 'created': 'Sun, 26 Sep 2010 14:31:24 GMT'}]",2010-09-28,"[['Chakraborty', 'Avik', '']]","['Reversible', 'k-CNOT', 'Irreversible gate', 'Bridging']"
19773,1609.06668,Ziyue Xu,"Mario Buty, Ziyue Xu, Mingchen Gao, Ulas Bagci, Aaron Wu, and Daniel
  J. Mollura","Characterization of Lung Nodule Malignancy using Hybrid Shape and
  Appearance Features",Accepted to MICCAI 2016,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computed tomography imaging is a standard modality for detecting and
assessing lung cancer. In order to evaluate the malignancy of lung nodules,
clinical practice often involves expert qualitative ratings on several criteria
describing a nodule's appearance and shape. Translating these features for
computer-aided diagnostics is challenging due to their subjective nature and
the difficulties in gaining a complete description. In this paper, we propose a
computerized approach to quantitatively evaluate both appearance distinctions
and 3D surface variations. Nodule shape was modeled and parameterized using
spherical harmonics, and appearance features were extracted using deep
convolutional neural networks. Both sets of features were combined to estimate
the nodule malignancy using a random forest classifier. The proposed algorithm
was tested on the publicly available Lung Image Database Consortium dataset,
achieving high accuracy. By providing lung nodule characterization, this method
can provide a robust alternative reference opinion for lung cancer diagnosis.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2016 18:33:56 GMT'}]",2016-09-22,"[['Buty', 'Mario', ''], ['Xu', 'Ziyue', ''], ['Gao', 'Mingchen', ''], ['Bagci', 'Ulas', ''], ['Wu', 'Aaron', ''], ['Mollura', 'Daniel J.', '']]","['Nodule Characterization', 'Conformal Mapping', 'Spherical Harmonics', 'Deep Convolutional Neural Network', 'Random Forest']"
19774,1307.5693,Lucas Paletta,"Yasin Kavak, Erkut Erdem and Aykut Erdem","Visual saliency estimation by integrating features using multiple kernel
  learning",,,,ISACS/2013/03,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last few decades, significant achievements have been attained in
predicting where humans look at images through different computational models.
However, how to determine contributions of different visual features to overall
saliency still remains an open problem. To overcome this issue, a recent class
of models formulates saliency estimation as a supervised learning problem and
accordingly apply machine learning techniques. In this paper, we also address
this challenging problem and propose to use multiple kernel learning (MKL) to
combine information coming from different feature dimensions and to perform
integration at an intermediate level. Besides, we suggest to use responses of a
recently proposed filterbank of object detectors, known as Object-Bank, as
additional semantic high-level features. Here we show that our MKL-based
framework together with the proposed object-specific features provide
state-of-the-art performance as compared to SVM or AdaBoost-based saliency
models.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2013 13:09:12 GMT'}]",2013-07-23,"[['Kavak', 'Yasin', ''], ['Erdem', 'Erkut', ''], ['Erdem', 'Aykut', '']]","['visual saliency', 'multiple kernel learning', 'feature integration', 'objectbased attention']"
19775,1304.3208,Denis Berthier Pr.,Denis Berthier,"From Constraints to Resolution Rules, Part I: Conceptual Framework","International Joint Conferences on Computer, Information, Systems
  Sciences and Engineering (CISSE 08), December 5-13, 2008, Springer. Also a
  chapter of the book ""Advanced Techniques in Computing Sciences and Software
  Engineering"", Khaled Elleithy Editor, pp. 165-170, Springer, 2010, ISBN
  9789094136599",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many real world problems naturally appear as constraints satisfaction
problems (CSP), for which very efficient algorithms are known. Most of these
involve the combination of two techniques: some direct propagation of
constraints between variables (with the goal of reducing their sets of possible
values) and some kind of structured search (depth-first, breadth-first,...).
But when such blind search is not possible or not allowed or when one wants a
'constructive' or a 'pattern-based' solution, one must devise more complex
propagation rules instead. In this case, one can introduce the notion of a
candidate (a 'still possible' value for a variable). Here, we give this
intuitive notion a well defined logical status, from which we can define the
concepts of a resolution rule and a resolution theory. In order to keep our
analysis as concrete as possible, we illustrate each definition with the well
known Sudoku example. Part I proposes a general conceptual framework based on
first order logic; with the introduction of chains and braids, Part II will
give much deeper results.
","[{'version': 'v1', 'created': 'Thu, 11 Apr 2013 06:37:20 GMT'}]",2013-04-12,"[['Berthier', 'Denis', '']]","['constraint satisfaction problem', 'knowledge engineering', 'production system', 'resolution rule', 'strategy', 'Sudoku solving']"
19776,1105.3459,Rob Sanderson,"Robert Sanderson, Mark Phillips, Herbert Van de Sompel",Analyzing the Persistence of Referenced Web Resources with Memento,"4 pages, 5 figures. Accepted to Open Repositories 2011 Conference",,,,cs.DL,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this paper we present the results of a study into the persistence and
availability of web resources referenced from papers in scholarly repositories.
Two repositories with different characteristics, arXiv and the UNT digital
library, are studied to determine if the nature of the repository, or of its
content, has a bearing on the availability of the web resources cited by that
content. Memento makes it possible to automate discovery of archived resources
and to consider the time between the publication of the research and the
archiving of the referenced URLs. This automation allows us to process more
than 160000 URLs, the largest known such study, and the repository metadata
allows consideration of the results by discipline. The results are startling:
45% (66096) of the URLs referenced from arXiv still exist, but are not
preserved for future generations, and 28% of resources referenced by UNT papers
have been lost. Moving forwards, we provide some initial recommendations,
including that repositories should publish URL lists extracted from papers that
could be used as seeds for web archiving systems.
","[{'version': 'v1', 'created': 'Tue, 17 May 2011 19:21:46 GMT'}]",2011-05-18,"[['Sanderson', 'Robert', ''], ['Phillips', 'Mark', ''], ['Van de Sompel', 'Herbert', '']]","['Digital Preservation', 'Repositories', 'Web Persistence']"
19777,1403.6090,Mohammad Gholami,"Mohammad Gholami, Ghaffar Raeisi",Column Weight Two and Three LDPC Codes with High Rates and Large Girths,"6 pages, 6 figures, 1 table",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, the concept of the {\it broken diagonal pair} in the
chess-like square board is used to define some well-structured block designs
whose incidence matrices can be considered as the parity-check matrices of some
high rate cycle codes with girth 12. The structure of the proposed parity-check
matrices significantly reduces the complexity of encoding and decoding.
Interestingly, the constructed regular cycle codes with row-weights $t$, $3\leq
t \leq 20$, $t\neq 7, 15, 16$, have the best lengths among the known regular
girth-12 cycle codes. In addition, the proposed cycle codes can be easily
extended to some high rate column weight-3 LDPC codes with girth 6. Simulation
results show that the constructed codes achieve excellent performances,
specially the constructed column weight 3 LDPC codes outperform LDPC codes
based on Steiner triple systems (STS).
","[{'version': 'v1', 'created': 'Mon, 24 Mar 2014 19:15:45 GMT'}]",2014-03-25,"[['Gholami', 'Mohammad', ''], ['Raeisi', 'Ghaffar', '']]","['LDPC Code', 'Tannar Graph', 'Girth']"
19778,1501.03933,Thomas Bosch,"Thomas Bosch, Andreas Nolle, Erman Acar, Kai Eckert",RDF Validation Requirements - Evaluation and Logical Underpinning,arXiv admin note: text overlap with arXiv:1504.04479,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are many case studies for which the formulation of RDF constraints and
the validation of RDF data conforming to these constraint is very important. As
a part of the collaboration with the W3C and the DCMI working groups on RDF
validation, we identified major RDF validation requirements and initiated an
RDF validation requirements database which is available to contribute at
http://purl.org/net/rdf-validation. The purpose of this database is to
collaboratively collect case studies, use cases, requirements, and solutions
regarding RDF validation. Although, there are multiple constraint languages
which can be used to formulate RDF constraints (associated with these
requirements), there is no standard way to formulate them. This paper serves to
evaluate to which extend each requirement is satisfied by each of these
constraint languages. We take reasoning into account as an important
pre-validation step and therefore map constraints to DL in order to show that
each constraint can be mapped to an ontology describing RDF constraints
generically.
","[{'version': 'v1', 'created': 'Fri, 16 Jan 2015 10:16:08 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Jun 2015 11:14:50 GMT'}, {'version': 'v3', 'created': 'Fri, 17 Jul 2015 10:32:18 GMT'}]",2015-07-20,"[['Bosch', 'Thomas', ''], ['Nolle', 'Andreas', ''], ['Acar', 'Erman', ''], ['Eckert', 'Kai', '']]","['RDF Validation', 'RDF Validation Requirements', 'RDF Constraints', 'Constraint Languages', 'Evaluation', 'Linked Data', 'Semantic Web']"
19779,1610.05562,Yiran Sheng,"Patrick Ng, Drew Plant, Yiran Sheng",Do Price Ranges Increase Click-throughs?,,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An important goal of online comparison shopping services is to ""convert"" a
viewer from general product category pages (for example product groups such as
""smartphones"" or ""air-conditioners"") to detailed product pages and ultimately
to order pages. Comparison shopping websites provide a familiar web interface
as well as a chance for consumers to purchase items at competitive prices. In
return for providing access to a large market of potential consumers, the
comparison shopping service usually receives financial compensation for product
clicks and orders. This study looked at 2.5 million product listing visits at
price.com.hk to determine whether a modification in the way prices are
displayed on general category pages resulted in more ""conversions"" to product
detail pages. We found a statistically significant improvement over-all as a
result of the new price display resulting in 3.6% more product clicks over all
categories. Additional analysis showed that the effect is heterogeneous among
different categories, and in a few cases there may be some categories
negatively affected by the display modification.
","[{'version': 'v1', 'created': 'Sun, 15 May 2016 03:58:06 GMT'}]",2016-10-19,"[['Ng', 'Patrick', ''], ['Plant', 'Drew', ''], ['Sheng', 'Yiran', '']]","['e-commerce', 'web conversions', 'AB testing', 'comparison shopping websites', 'pricecomparison', 'online shopping']"
19780,1610.09201,Maciej Wielgosz,Matej Mertik and Maciej Wielgosz and Andrzej Skocze\'n,"A Conceptual Development of Quench Prediction App build on LSTM and ELQA
  framework",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article presents a development of web application for quench prediction
in \gls{te-mpe-ee} at CERN. The authors describe an ELectrical Quality
Assurance (ELQA) framework, a platform which was designed for rapid development
of web integrated data analysis applications for different analysis needed
during the hardware commissioning of the Large Hadron Collider (LHC). In second
part the article describes a research carried out with the data collected from
Quench Detection System by means of using an LSTM recurrent neural network. The
article discusses and presents a conceptual work of implementing quench
prediction application for \gls{te-mpe-ee} based on the ELQA and quench
prediction algorithm.
","[{'version': 'v1', 'created': 'Tue, 25 Oct 2016 20:19:35 GMT'}]",2016-10-31,"[['Mertik', 'Matej', ''], ['Wielgosz', 'Maciej', ''], ['Skoczeń', 'Andrzej', '']]","['Software development', 'Data analysis', 'Web applications', 'ElectricalQuality Assurance (ELQA)', 'Large Hadron Collider', 'Deep Learning', 'Recurrent neuralnetworks']"
19781,1609.02072,Etienne Ferrier,Etienne Ferrier,Sampling BSSRDFs with non-perpendicular incidence,"Supervised by Prof. Wenzel Jakob (EPFL). Contains 9 pages, 13
  figures, 4 tables, 3 algorithms",,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sub-surface scattering is key to our perception of translucent materials.
Models based on diffusion theory are used to render such materials in a
realistic manner by evaluating an approximation of the material BSSRDF at any
two points of the surface. Under the assumption of perpendicular incidence,
this BSSRDF approximation can be tabulated over 2 dimensions to provide fast
evaluation and importance sampling. However, accounting for non-perpendicular
incidence with the same approach would require to tabulate over 4 dimensions,
making the model too large for practical applications. In this report, we
present a method to efficiently evaluate and importance sample the
multi-scattering component of diffusion based BSSRDFs for non-perpendicular
incidence. Our approach is based on tabulating a compressed angular model of
Photon Beam Diffusion. We explain how to generate, evaluate and sample our
model. We show that 1 MiB is enough to store a model of the multi-scattering
BSSRDF that is within $0.5\%$ relative error of Photon Beam Diffusion. Finally,
we present a method to use our model in a Monte Carlo particle tracer and show
results of our implementation in PBRT.
","[{'version': 'v1', 'created': 'Wed, 7 Sep 2016 17:03:19 GMT'}]",2016-09-08,"[['Ferrier', 'Etienne', '']]","['light transport', 'sub-surface scattering', 'importancesampling']"
19782,1009.1117,Elsa Tolone,"Elsa Tolone (LIGM), Stavroula Voyatzi (LIGM), Christian Lecl\`ere
  (LIGM)",Constructions d\'efinitoires des tables du Lexique-Grammaire,,"29\`eme Colloque international sur le Lexique et la Grammaire
  (LGC'10), Belgrade : Serbie (2010)",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lexicon-Grammar tables are a very rich syntactic lexicon for the French
language. This linguistic database is nevertheless not directly suitable for
use by computer programs, as it is incomplete and lacks consistency. Tables are
defined on the basis of features which are not explicitly recorded in the
lexicon. These features are only described in literature. Our aim is to define
for each tables these essential properties to make them usable in various
Natural Language Processing (NLP) applications, such as parsing.
","[{'version': 'v1', 'created': 'Mon, 6 Sep 2010 18:35:08 GMT'}, {'version': 'v2', 'created': 'Fri, 24 Sep 2010 06:37:16 GMT'}]",2010-09-27,"[['Tolone', 'Elsa', '', 'LIGM'], ['Voyatzi', 'Stavroula', '', 'LIGM'], ['Leclère', 'Christian', '', 'LIGM']]","['Natural Language Processing', 'syntactic lexicon', 'Lexicon-Grammar']"
19783,1004.0762,Secretary Aircc Journal,"Mohamed Abid, Songbo Song, Hassnaa Moustafa and Hossam Afifi
  (SudParis, Evry, France)",Integrating identity-based cryptography in IMS service authentication,13Pages,"International Journal of Network Security & Its Applications 1.3
  (2009) 1-13",,,cs.CR cs.MM,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Nowadays, the IP Multimedia Subsystem (IMS) is a promising research field.
Many ongoing works related to the security and the performances of its
employment are presented to the research community. Although, the security and
data privacy aspects are very important in the IMS global objectives, they
observe little attention so far. Secure access to multimedia services is based
on SIP and HTTP digest on top of IMS architecture. The standard deploys AKA-MD5
for the terminal authentication. The third Generation Partnership Project
(3GPP) provided Generic Bootstrapping Architecture (GBA) to authenticate the
subscriber before accessing multimedia services over HTTP. In this paper, we
propose a new IMS Service Authentication scheme using Identity Based
cryptography (IBC). This new scheme will lead to better performances when there
are simultaneous authentication requests using Identity-based Batch
Verification. We analyzed the security of our new protocol and we presented a
performance evaluation of its cryptographic operations
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2010 03:38:59 GMT'}]",2010-07-15,"[['Abid', 'Mohamed', '', 'SudParis, Evry, France'], ['Song', 'Songbo', '', 'SudParis, Evry, France'], ['Moustafa', 'Hassnaa', '', 'SudParis, Evry, France'], ['Afifi', 'Hossam', '', 'SudParis, Evry, France']]","['IP Multimedia Subsystem (IMS)', 'Identity Based Cryptography (IBC)', 'Service Authentication', 'Batch']"
19784,1504.06378,James Supancic III,"James Steven Supancic III, Gregory Rogez, Yi Yang, Jamie Shotton, Deva
  Ramanan","Depth-based hand pose estimation: methods, data, and challenges",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hand pose estimation has matured rapidly in recent years. The introduction of
commodity depth sensors and a multitude of practical applications have spurred
new advances. We provide an extensive analysis of the state-of-the-art,
focusing on hand pose estimation from a single depth frame. To do so, we have
implemented a considerable number of systems, and will release all software and
evaluation code. We summarize important conclusions here: (1) Pose estimation
appears roughly solved for scenes with isolated hands. However, methods still
struggle to analyze cluttered scenes where hands may be interacting with nearby
objects and surfaces. To spur further progress we introduce a challenging new
dataset with diverse, cluttered scenes. (2) Many methods evaluate themselves
with disparate criteria, making comparisons difficult. We define a consistent
evaluation criteria, rigorously motivated by human experiments. (3) We
introduce a simple nearest-neighbor baseline that outperforms most existing
systems. This implies that most systems do not generalize beyond their training
sets. This also reinforces the under-appreciated point that training data is as
important as the model itself. We conclude with directions for future progress.
","[{'version': 'v1', 'created': 'Fri, 24 Apr 2015 02:37:37 GMT'}, {'version': 'v2', 'created': 'Wed, 6 May 2015 20:31:57 GMT'}]",2015-05-08,"[['Supancic', 'James Steven', 'III'], ['Rogez', 'Gregory', ''], ['Yang', 'Yi', ''], ['Shotton', 'Jamie', ''], ['Ramanan', 'Deva', '']]","['hand pose', 'RGB-D sensor', 'datasets', 'benchmarking']"
19785,1705.05455,Saad Bin Ahmed,"Saad Bin Ahmed, Saeeda Naz, Salahuddin Swati, Muhammad Imran Razzak","Handwritten Urdu Character Recognition using 1-Dimensional BLSTM
  Classifier","10 pages, Accepted in NCA for publication",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The recognition of cursive script is regarded as a subtle task in optical
character recognition due to its varied representation. Every cursive script
has different nature and associated challenges. As Urdu is one of cursive
language that is derived from Arabic script, thats why it nearly shares the
same challenges and difficulties even more harder. We can categorized Urdu and
Arabic language on basis of its script they use. Urdu is mostly written in
Nastaliq style whereas, Arabic follows Naskh style of writing. This paper
presents new and comprehensive Urdu handwritten offline database name
Urdu-Nastaliq Handwritten Dataset (UNHD). Currently, there is no standard and
comprehensive Urdu handwritten dataset available publicly for researchers. The
acquired dataset covers commonly used ligatures that were written by 500
writers with their natural handwriting on A4 size paper. We performed
experiments using recurrent neural networks and reported a significant accuracy
for handwritten Urdu character recognition.
","[{'version': 'v1', 'created': 'Mon, 15 May 2017 21:13:08 GMT'}]",2017-05-17,"[['Ahmed', 'Saad Bin', ''], ['Naz', 'Saeeda', ''], ['Swati', 'Salahuddin', ''], ['Razzak', 'Muhammad Imran', '']]","['Recurrent neural networks', 'optical character recognition', 'cursive offline handwriting']"
19786,1505.04633,Matthew Knepley,Michael Lange and Matthew G. Knepley and Gerard J. Gorman,"Flexible, Scalable Mesh and Data Management using PETSc DMPlex","6 pages, 6 figures, to appear in EASC 2015",,,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Designing a scientific software stack to meet the needs of the
next-generation of mesh-based simulation demands, not only scalable and
efficient mesh and data management on a wide range of platforms, but also an
abstraction layer that makes it useful for a wide range of application codes.
Common utility tasks, such as file I/O, mesh distribution, and work
partitioning, should be delegated to external libraries in order to promote
code re-use, extensibility and software interoperability. In this paper we
demonstrate the use of PETSc's DMPlex data management API to perform mesh input
and domain partitioning in Fluidity, a large scale CFD application. We
demonstrate that raising the level of abstraction adds new functionality to the
application code, such as support for additional mesh file formats and mesh re-
ordering, while improving simulation startup cost through more efficient mesh
distribution. Moreover, the separation of concerns accomplished through this
interface shifts critical performance and interoperability issues, such as
scalable I/O and file format support, to a widely used and supported open
source community library, improving the sustainability, performance, and
functionality of Fluidity.
","[{'version': 'v1', 'created': 'Mon, 18 May 2015 13:35:50 GMT'}]",2015-05-19,"[['Lange', 'Michael', ''], ['Knepley', 'Matthew G.', ''], ['Gorman', 'Gerard J.', '']]","['Mesh', 'topology', 'partitioning', 'renumbering', 'Fluidity', 'PETSc']"
19787,1205.1366,"Max H\""ugel","Max H\""ugel, Holger Rauhut and Thomas Strohmer",Remote sensing via $\ell_1$ minimization,,,,,cs.IT math.IT math.NA math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of detecting the locations of targets in the far
field by sending probing signals from an antenna array and recording the
reflected echoes. Drawing on key concepts from the area of compressive sensing,
we use an $\ell_1$-based regularization approach to solve this, in general
ill-posed, inverse scattering problem. As common in compressed sensing, we
exploit randomness, which in this context comes from choosing the antenna
locations at random. With $n$ antennas we obtain $n^2$ measurements of a vector
$x \in \C^{N}$ representing the target locations and reflectivities on a
discretized grid. It is common to assume that the scene $x$ is sparse due to a
limited number of targets. Under a natural condition on the mesh size of the
grid, we show that an $s$-sparse scene can be recovered via
$\ell_1$-minimization with high probability if $n^2 \geq C s \log^2(N)$. The
reconstruction is stable under noise and under passing from sparse to
approximately sparse vectors. Our theoretical findings are confirmed by
numerical simulations.
","[{'version': 'v1', 'created': 'Mon, 7 May 2012 12:53:39 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Jan 2013 11:15:13 GMT'}, {'version': 'v3', 'created': 'Wed, 24 Apr 2013 12:41:54 GMT'}]",2013-04-25,"[['Hügel', 'Max', ''], ['Rauhut', 'Holger', ''], ['Strohmer', 'Thomas', '']]","['Compressive sensing', 'sparsity', 'ℓ1-minimization', 'inverse scattering', 'regularization']"
19788,1504.06779,Emerson Machado,"Emerson Lopes Machado, Cristiano Jacques Miosso, Ricardo von Borries,
  Murilo Coutinho, Pedro de Azevedo Berger, Thiago Marques, Ricardo Pezzuol
  Jacobi",Computational Cost Reduction in Learned Transform Classifications,,,,,cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a theoretical analysis and empirical evaluations of a novel set of
techniques for computational cost reduction of classifiers that are based on
learned transform and soft-threshold. By modifying optimization procedures for
dictionary and classifier training, as well as the resulting dictionary
entries, our techniques allow to reduce the bit precision and to replace each
floating-point multiplication by a single integer bit shift. We also show how
the optimization algorithms in some dictionary training methods can be modified
to penalize higher-energy dictionaries. We applied our techniques with the
classifier Learning Algorithm for Soft-Thresholding, testing on the datasets
used in its original paper. Our results indicate it is feasible to use solely
sums and bit shifts of integers to classify at test time with a limited
reduction of the classification accuracy. These low power operations are a
valuable trade off in FPGA implementations as they increase the classification
throughput while decrease both energy consumption and manufacturing cost.
","[{'version': 'v1', 'created': 'Sun, 26 Apr 2015 01:16:44 GMT'}, {'version': 'v2', 'created': 'Sat, 30 Apr 2016 15:03:29 GMT'}]",2016-05-03,"[['Machado', 'Emerson Lopes', ''], ['Miosso', 'Cristiano Jacques', ''], ['von Borries', 'Ricardo', ''], ['Coutinho', 'Murilo', ''], ['Berger', 'Pedro de Azevedo', ''], ['Marques', 'Thiago', ''], ['Jacobi', 'Ricardo Pezzuol', '']]","['Image classification', 'Dictionary learning', 'Reduce computationalcost', 'FPGA']"
19789,1802.07361,Prashanta Saha,Prashanta Saha and Upulee Kanewala,"Fault Detection Effectiveness of Source Test Case Generation Strategies
  for Metamorphic Testing",8 pages,,,,cs.SE,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Metamorphic testing is a well known approach to tackle the oracle problem in
software testing. This technique requires the use of source test cases that
serve as seeds for the generation of follow-up test cases. Systematic design of
test cases is crucial for the test quality. Thus, source test case generation
strategy can make a big impact on the fault detection effectiveness of
metamorphic testing. Most of the previous studies on metamorphic testing have
used either random test data or existing test cases as source test cases. There
has been limited research done on systematic source test case generation for
metamorphic testing. This paper provides a comprehensive evaluation on the
impact of source test case generation techniques on the fault finding
effectiveness of metamorphic testing. We evaluated the effectiveness of line
coverage, branch coverage, weak mutation and random test generation strategies
for source test case generation. The experiments are conducted with 77 methods
from 4 open source code repositories. Our results show that by systematically
creating source test cases, we can significantly increase the fault finding
effectiveness of metamorphic testing. Further, in this paper we introduce a
simple metamorphic testing tool called ""METtester"" that we use to conduct
metamorphic testing on these methods.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 22:28:35 GMT'}]",2018-02-22,"[['Saha', 'Prashanta', ''], ['Kanewala', 'Upulee', '']]","['Metamorphic testing', 'Random testing', 'Source test case generation', 'Weak mutation', 'Branch coverage', 'Line coverage']"
19790,1510.05524,Daniel Severin Dr.,"Graciela Nasini, Daniel Severin, Pablo Torres",On the Packing Chromatic Number on Hamming Graphs and General Graphs,"Accepted in Simp\'osio Brasileiro de Pesquisa Operacional XLVII (SBPO
  2015) Web page: http://cdsid.org.br/sbpo2015",,,,cs.DM,http://creativecommons.org/licenses/by/4.0/,"  The packing chromatic number $\chi_\rho(G)$ of a graph $G$ is the smallest
integer $k$ needed to proper color the vertices of $G$ in such a way the
distance between any two vertices having color $i$ be at least $i+1$. We obtain
$\chi_\rho(H_{q,m})$ for $m=3$, where $H_{q,m}$ is the Hamming graph of words
of length $m$ and alphabet with $q$ symbols, and tabulate bounds of them for $m
\geq 4$ up to 10000 vertices. We also give a polynomial reduction from the
problem of finding $\chi_\rho(G)$ to the Maximum Stable Set problem.
","[{'version': 'v1', 'created': 'Mon, 19 Oct 2015 15:15:18 GMT'}]",2015-10-20,"[['Nasini', 'Graciela', ''], ['Severin', 'Daniel', ''], ['Torres', 'Pablo', '']]","['Packing Chromatic Number', 'Hamming Graph', 'Stable Set Problem']"
19791,1307.1561,Vimina E R,"E. R. Vimina, K. Poulose Jacob","A Sub-block Based Image Retrieval Using Modified Integrated Region
  Matching",7 pages,"International Journal of Computer Science Issues, Vol.10, Issue
  1,No 2, January 2013, pp. 686-692",,,cs.IR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a content based image retrieval (CBIR) system using the
local colour and texture features of selected image sub-blocks and global
colour and shape features of the image. The image sub-blocks are roughly
identified by segmenting the image into partitions of different configuration,
finding the edge density in each partition using edge thresholding followed by
morphological dilation. The colour and texture features of the identified
regions are computed from the histograms of the quantized HSV colour space and
Gray Level Co- occurrence Matrix (GLCM) respectively. The colour and texture
feature vectors is computed for each region. The shape features are computed
from the Edge Histogram Descriptor (EHD). A modified Integrated Region Matching
(IRM) algorithm is used for finding the minimum distance between the sub-blocks
of the query and target image. Experimental results show that the proposed
method provides better retrieving result than retrieval using some of the
existing methods.
","[{'version': 'v1', 'created': 'Fri, 5 Jul 2013 09:29:46 GMT'}]",2013-07-08,"[['Vimina', 'E. R.', ''], ['Jacob', 'K. Poulose', '']]","['CBIR', 'Colour histogram', 'Edge histogram descriptor', 'Euclidean distance', 'GLCM', 'IRM similarity']"
19792,1206.1935,Nengkun Yu,Nengkun Yu and Mingsheng Ying,Reachability and Termination Analysis of Concurrent Quantum Programs,Accepted by Concur'12. Comments are welcome,,,,cs.LO quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a Markov chain model of concurrent quantum programs. This model
is a quantum generalization of Hart, Sharir and Pnueli's probabilistic
concurrent programs. Some characterizations of the reachable space, uniformly
repeatedly reachable space and termination of a concurrent quantum program are
derived by the analysis of their mathematical structures. Based on these
characterizations, algorithms for computing the reachable space and uniformly
repeatedly reachable space and for deciding the termination are given.
","[{'version': 'v1', 'created': 'Sat, 9 Jun 2012 12:43:59 GMT'}]",2012-06-12,"[['Yu', 'Nengkun', ''], ['Ying', 'Mingsheng', '']]","['Quantum computation', 'concurrent programs', 'reachability', 'termination']"
19793,1106.5568,Lin Zhong,"Ardalan Amiri Sani, Wolfgang Richter, Xuan Bao, Trevor Narayan,
  Mahadev Satyanarayanan, Lin Zhong, Romit Roy Choudhury",Opportunistic Content Search of Smartphone Photos,,,,"Technical Report TR0627-2011, Rice University",cs.IR cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Photos taken by smartphone users can accidentally contain content that is
timely and valuable to others, often in real-time. We report the system design
and evaluation of a distributed search system, Theia, for crowd-sourced
real-time content search of smartphone photos. Because smartphones are
resource-constrained, Theia incorporates two key innovations to control search
cost and improve search efficiency. Incremental Search expands search scope
incrementally and exploits user feedback. Partitioned Search leverages the
cloud to reduce the energy consumption of search in smartphones. Through user
studies, measurement studies, and field studies, we show that Theia reduces the
cost per relevant photo by an average of 59%. It reduces the energy consumption
of search by up to 55% and 81% compared to alternative strategies of executing
entirely locally or entirely in the cloud. Search results from smartphones are
obtained in seconds. Our experiments also suggest approaches to further improve
these results.
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2011 05:36:11 GMT'}]",2011-06-29,"[['Sani', 'Ardalan Amiri', ''], ['Richter', 'Wolfgang', ''], ['Bao', 'Xuan', ''], ['Narayan', 'Trevor', ''], ['Satyanarayanan', 'Mahadev', ''], ['Zhong', 'Lin', ''], ['Choudhury', 'Romit Roy', '']]","['Crowd-sourced photos', 'mobile systems', 'energy efficiency']"
19794,1304.0980,Dr. Nadeem Javaid,"S. Ahmed, N. Javaid, S. H. Bouk, A. Javaid, M. A. Khan, Z. A. Khan","Quantum Cryptography Using Various Reversible Quantum Logic Gates in
  WSNs","Journal of Basic and Applied Scientific Research (JBASR), 2013",,,,cs.CR cs.NI quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As sensor nodes are deployed anywhere in a wireless sensor network, hence
their communication can be easily monitored. In these networks, message
protection and node identification are very issues. Hence, security of large
scale such networks requires efficient key distribution and management
mechanisms. Quantum cryptography and particularly quantum key distribution is
such a technique that allocates secure keys only for short distances. While not
completely secure, it offers huge advantages over traditional methods by the
use of entanglement swapping and quantum teleportation. Reversible logic gates
like CNOT, Toffoli, Fredkin etc. are of basic importance in Quantum Computing.
In our research, we adopted a EPR-pair allocation scheme in terms of these
quantum gates to overcome the susceptibility caused by malicious nodes. As the
qubits stored in a sensor node can be used only once and cannot be duplicated,
hence risk of information leakage reduced even if the node are compromised.
","[{'version': 'v1', 'created': 'Wed, 3 Apr 2013 15:18:33 GMT'}]",2013-04-04,"[['Ahmed', 'S.', ''], ['Javaid', 'N.', ''], ['Bouk', 'S. H.', ''], ['Javaid', 'A.', ''], ['Khan', 'M. A.', ''], ['Khan', 'Z. A.', '']]","['Quantum Cryptography', 'teleportation', 'EPR-pair', 'qubits', 'sensor networks']"
19795,1205.1733,Guodong Shi,Guodong Shi and Karl Henrik Johansson,"Finite-time and Asymptotic Convergence of Distributed Averaging and
  Maximizing Algorithms",,,,,cs.DC math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we formulate and investigate a generalized consensus algorithm
which makes an attempt to unify distributed averaging and maximizing algorithms
considered in the literature. Each node iteratively updates its state as a
time-varying weighted average of its own state, the minimal state, and the
maximal state of its neighbors. We prove that finite-time consensus is almost
impossible for averaging under this uniform model. Both time-dependent and
state-dependent graphs are considered, and various necessary and/or sufficient
conditions are presented on the consensus convergence. For time-dependent
graphs, we show that quasi-strong connectivity is critical for averaging, as is
strong connectivity for maximizing. For state-dependent graphs defined by a
$\mu$-nearest-neighbor rule, where each node interacts with its $\mu$ nearest
smaller neighbors and the $\mu$ nearest larger neighbors, we show that $\mu+1$
is a critical threshold on the total number of nodes for the transit from
finite-time to asymptotic convergence for averaging, in the absence of node
self-confidence. The threshold is $2\mu$ if each node chooses to connect only
to neighbors with unique values. Numerical examples illustrate the tightness of
the conditions. The results characterize some fundamental similarities and
differences between distributed averaging and maximizing algorithms.
","[{'version': 'v1', 'created': 'Tue, 8 May 2012 15:59:06 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Sep 2012 14:31:10 GMT'}]",2012-09-06,"[['Shi', 'Guodong', ''], ['Johansson', 'Karl Henrik', '']]","['Averaging algorithms', 'Max-consensus', 'Finite-time convergence', 'State-dependent']"
19796,1301.0763,Lorenzo Pasquini,Lorenzo Pasquini,Improved QFT algorithm for power-of-two FFT,,,,,cs.DS cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper shows that it is possible to improve the computational cost, the
memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm
for power-of-two FFT (Fast Fourier Transform) just introducing a slight
modification in this algorithm. The new algorithm requires the same number of
additions and multiplications of split-radix 3add/3mul, one of the most
appreciated FFT algorithms appeared in the literature, but employing only half
of the trigonometric constants. These results can elevate the QFT approach to
the level of most used FFT procedures. A new quite general way to describe FFT
algorithms, based on signal types and on a particular notation, is also
proposed and used, highligting its advantages.
","[{'version': 'v1', 'created': 'Fri, 4 Jan 2013 16:25:56 GMT'}]",2013-01-07,"[['Pasquini', 'Lorenzo', '']]","['FFT', 'split-radix', 'Quick Fourier Transform', 'convolution']"
19797,1007.3631,Satish N. Srirama,Satish Narayana Srirama and Matthias Jarke and Wolfgang Prinz,Mobile Web Service Discovery in Peer to Peer Networks,"5th International Workshop on Ubiquitous Mobile Information and
  Collaboration Systems (UMICS 2007) @ 19th International Conference on
  Advanced Information Systems Engineering (CAiSE'07), June 11-12, 2007",,,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The advanced features of today's smart phones and hand held devices, like the
increased memory and processing capabilities, allowed them to act even as
information providers. Thus a smart phone hosting web services is not a fancy
anymore. But the relevant discovery of these services provided by the smart
phones has became quite complex, because of the volume of services possible
with each Mobile Host providing some services. Centralized registries have
severe drawbacks in such a scenario and alternate means of service discovery
are to be addressed. P2P domain with it resource sharing capabilities comes
quite handy and here in this paper we provide an alternate approach to UDDI
registry for discovering mobile web services. The services are published into
the P2P network as JXTA modules and the discovery issues of these module
advertisements are addressed. The approach also provides alternate means of
identifying the Mobile Host.
","[{'version': 'v1', 'created': 'Wed, 21 Jul 2010 12:32:43 GMT'}]",2010-07-22,"[['Srirama', 'Satish Narayana', ''], ['Jarke', 'Matthias', ''], ['Prinz', 'Wolfgang', '']]","['Mobile web service provisioning', 'peer to peer', 'JXTA and service discovery']"
19798,1604.07545,Somaiyeh Mahmoud.Zadeh,"Somaiyeh Mahmoud.Zadeh, David M.W Powers, Karl Sammut, Amir Mehdi
  Yazdani, Adham Atyabi","An Efficient Hybrid Route-Path Planning Model For Dynamic Task
  Allocation and Safe Maneuvering of an Underwater Vehicle in a Realistic
  Environment",,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a hybrid route-path planning model for an Autonomous
Underwater Vehicle's task assignment and management while the AUV is operating
through the variable littoral waters. Several prioritized tasks distributed in
a large scale terrain is defined first; then, considering the limitations over
the mission time, vehicle's battery, uncertainty and variability of the
underlying operating field, appropriate mission timing and energy management is
undertaken. The proposed objective is fulfilled by incorporating a
route-planner that is in charge of prioritizing the list of available tasks
according to available battery and a path-planer that acts in a smaller scale
to provide vehicle's safe deployment against environmental sudden changes. The
synchronous process of the task assign-route and path planning is simulated
using a specific composition of Differential Evolution and Firefly Optimization
(DEFO) Algorithms. The simulation results indicate that the proposed hybrid
model offers efficient performance in terms of completion of maximum number of
assigned tasks while perfectly expending the minimum energy, provided by using
the favorable current flow, and controlling the associated mission time. The
Monte-Carlo test is also performed for further analysis. The corresponding
results show the significant robustness of the model against uncertainties of
the operating field and variations of mission conditions.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2016 06:48:29 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Jun 2016 23:17:23 GMT'}, {'version': 'v3', 'created': 'Mon, 20 Nov 2017 00:34:25 GMT'}]",2017-11-21,"[['Zadeh', 'Somaiyeh Mahmoud.', ''], ['Powers', 'David M. W', ''], ['Sammut', 'Karl', ''], ['Yazdani', 'Amir Mehdi', ''], ['Atyabi', 'Adham', '']]","['autonomous underwater vehicle', 'path planning', 'autonomous mission', 'task allocation', 'mission timing', 'mission management']"
19799,0909.1933,Liva Ralaivola,"Liva Ralaivola (LIF), Marie Szafranski (IBISC), Guillaume Stempfel
  (LIF)","Chromatic PAC-Bayes Bounds for Non-IID Data: Applications to Ranking and
  Stationary $\beta$-Mixing Processes","Long version of the AISTATS 09 paper:
  http://jmlr.csail.mit.edu/proceedings/papers/v5/ralaivola09a/ralaivola09a.pdf",,,,cs.LG math.ST stat.ML stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pac-Bayes bounds are among the most accurate generalization bounds for
classifiers learned from independently and identically distributed (IID) data,
and it is particularly so for margin classifiers: there have been recent
contributions showing how practical these bounds can be either to perform model
selection (Ambroladze et al., 2007) or even to directly guide the learning of
linear classifiers (Germain et al., 2009). However, there are many practical
situations where the training data show some dependencies and where the
traditional IID assumption does not hold. Stating generalization bounds for
such frameworks is therefore of the utmost interest, both from theoretical and
practical standpoints. In this work, we propose the first - to the best of our
knowledge - Pac-Bayes generalization bounds for classifiers trained on data
exhibiting interdependencies. The approach undertaken to establish our results
is based on the decomposition of a so-called dependency graph that encodes the
dependencies within the data, in sets of independent data, thanks to graph
fractional covers. Our bounds are very general, since being able to find an
upper bound on the fractional chromatic number of the dependency graph is
sufficient to get new Pac-Bayes bounds for specific settings. We show how our
results can be used to derive bounds for ranking statistics (such as Auc) and
classifiers trained on data distributed according to a stationary {\ss}-mixing
process. In the way, we show how our approach seemlessly allows us to deal with
U-processes. As a side note, we also provide a Pac-Bayes generalization bound
for classifiers learned on data from stationary $\varphi$-mixing distributions.
","[{'version': 'v1', 'created': 'Thu, 10 Sep 2009 11:51:10 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Jun 2010 08:43:38 GMT'}]",2010-06-09,"[['Ralaivola', 'Liva', '', 'LIF'], ['Szafranski', 'Marie', '', 'IBISC'], ['Stempfel', 'Guillaume', '', 'LIF']]","['Pac-Bayes bounds', 'non IID data', 'ranking', 'U-statistics', 'mixing processes']"
19800,1505.00005,Mohammad Iftekharul Hoque,"Masoud Bozorgi, Rohan Nayak, Arslan Zaffar, Mohammad Iftekharul Hoque,
  Saad Anwer Ghouri, Harmeet Singh, Parminder Singh Kalshan",A Case Study on Quality Attribute Measurement using MARF and GIPSY,"50 pages, 58 figures",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This literature focuses on doing a comparative analysis between Modular Audio
Recognition Framework (MARF) and the General Intentional Programming System
(GIPSY) with the help of different software metrics. At first, we understand
the general principles, architecture and working of MARF and GIPSY by looking
at their frameworks and running them in the Eclipse environment. Then, we study
some of the important metrics including a few state of the art metrics and rank
them in terms of their usefulness and their influence on the different quality
attributes of a software. The quality attributes are viewed and computed with
the help of the Logiscope and McCabe IQ tools. These tools perform a
comprehensive analysis on the case studies and generate a quality report at the
factor level, criteria level and metrics level. In next step, we identify the
worst code at each of these levels, extract the worst code and provide
recommendations to improve the quality. We implement and test some of the
metrics which are ranked as the most useful metrics with a set of test cases in
JDeodorant. Finally, we perform an analysis on both MARF and GIPSY by doing a
fuzzy code scan using MARFCAT to find the list of weak and vulnerable classes.
","[{'version': 'v1', 'created': 'Thu, 30 Apr 2015 00:42:18 GMT'}]",2015-05-04,"[['Bozorgi', 'Masoud', ''], ['Nayak', 'Rohan', ''], ['Zaffar', 'Arslan', ''], ['Hoque', 'Mohammad Iftekharul', ''], ['Ghouri', 'Saad Anwer', ''], ['Singh', 'Harmeet', ''], ['Kalshan', 'Parminder Singh', '']]","['Modular Audio Recognition Framework (MARF)', 'Generic Intentional Programming Language (GIPSY)', 'Quality Attributes', 'Logiscope', 'McCabe', 'JDeodorant', 'MARFCAT']"
19801,1106.0305,Andrew Adamatzky,Andrew Adamatzky,Slime mould computes planar shapes,,"International Journal of Bio-Inspired Computation 2012 - Vol. 4,
  No.3 pp. 149 - 154",,,cs.ET nlin.PS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computing a polygon defining a set of planar points is a classical problem of
modern computational geometry. In laboratory experiments we demonstrate that a
concave hull, a connected alpha-shape without holes, of a finite planar set is
approximated by slime mould Physarum polycephalum. We represent planar points
with sources of long-distance attractants and short-distance repellents and
inoculate a piece of plasmodium outside the data set. The plasmodium moves
towards the data and envelops it by pronounced protoplasmic tubes.
","[{'version': 'v1', 'created': 'Wed, 1 Jun 2011 20:01:34 GMT'}]",2012-06-26,"[['Adamatzky', 'Andrew', '']]","['Unconventional computing', 'Physarum polycephalum', 'Concave hull', 'Concavehull', 'Alpha shape']"
19802,1004.0570,Secretary Aircc Journal,"Natarajan Meghanathan, Sumanth Reddy Allam and Loretta A. Moore
  (Jackson State University)",Tools and techniques for Network Forensics,12Pages,"International Journal of Network Security & Its Applications 1.1
  (2009) 14-25",,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Network forensics deals with the capture, recording and analysis of network
events in order to discover evidential information about the source of security
attacks in a court of law. This paper discusses the different tools and
techniques available to conduct network forensics. Some of the tools discussed
include: eMailTrackerPro to identify the physical location of an email sender;
Web Historian to find the duration of each visit and the files uploaded and
downloaded from the visited website; packet sniffers like Etherea to capture
and analyze the data exchanged among the different computers in the network.
The second half of the paper presents a survey of different IP traceback
techniques like packet marking that help a forensic investigator to identify
the true sources of the attacking IP packets. We also discuss the use of
Honeypots and Honeynets that gather intelligence about the enemy and the tools
and tactics of network intruders.
","[{'version': 'v1', 'created': 'Mon, 5 Apr 2010 06:38:22 GMT'}]",2010-07-15,"[['Meghanathan', 'Natarajan', '', 'Jackson State University'], ['Allam', 'Sumanth Reddy', '', 'Jackson State University'], ['Moore', 'Loretta A.', '', 'Jackson State University']]","['Network Forensics', 'IP Traceback', 'Honeypots', 'Packet Sniffers', 'Legal Aspects']"
19803,1708.01730,Mark Scanlon,"Xiaoyu Du, Nhien-An Le-Khac, Mark Scanlon","Evaluation of Digital Forensic Process Models with Respect to Digital
  Forensics as a Service",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Digital forensic science is very much still in its infancy, but is becoming
increasingly invaluable to investigators. A popular area for research is
seeking a standard methodology to make the digital forensic process accurate,
robust, and efficient. The first digital forensic process model proposed
contains four steps: Acquisition, Identification, Evaluation and Admission.
Since then, numerous process models have been proposed to explain the steps of
identifying, acquiring, analysing, storage, and reporting on the evidence
obtained from various digital devices. In recent years, an increasing number of
more sophisticated process models have been proposed. These models attempt to
speed up the entire investigative process or solve various of problems commonly
encountered in the forensic investigation. In the last decade, cloud computing
has emerged as a disruptive technological concept, and most leading enterprises
such as IBM, Amazon, Google, and Microsoft have set up their own cloud-based
services. In the field of digital forensic investigation, moving to a
cloud-based evidence processing model would be extremely beneficial and
preliminary attempts have been made in its implementation. Moving towards a
Digital Forensics as a Service model would not only expedite the investigative
process, but can also result in significant cost savings - freeing up digital
forensic experts and law enforcement personnel to progress their caseload. This
paper aims to evaluate the applicability of existing digital forensic process
models and analyse how each of these might apply to a cloud-based evidence
processing paradigm.
","[{'version': 'v1', 'created': 'Sat, 5 Aug 2017 08:15:52 GMT'}]",2017-08-08,"[['Du', 'Xiaoyu', ''], ['Le-Khac', 'Nhien-An', ''], ['Scanlon', 'Mark', '']]","['Digital Forensics as a Service', 'Digital Forensics', 'Process Models', 'Cloud Computing']"
19804,1607.01590,Ulrich Neumerkel,Ulrich Neumerkel and Stefan Kral,Indexing dif/2,,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many Prolog programs are unnecessarily impure because of inadequate means to
express syntactic inequality. While the frequently provided built-in `dif/2` is
able to correctly describe expected answers, its direct use in programs often
leads to overly complex and inefficient definitions --- mainly due to the lack
of adequate indexing mechanisms. We propose to overcome these problems by using
a new predicate that subsumes both equality and inequality via reification.
Code complexity is reduced with a monotonic, higher-order if-then-else
construct based on `call/N`. For comparable correct uses of impure definitions,
our approach is as determinate and similarly efficient as its impure
counterparts.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2016 12:27:45 GMT'}]",2016-07-07,"[['Neumerkel', 'Ulrich', ''], ['Kral', 'Stefan', '']]","['Prolog', 'monotonicity', 'inequality', 'reification']"
19805,1206.4582,Mehdi Khalili,Mehdi Khalili,"A Comparison between Digital Image Watermarking in Tow Different Color
  Spaces Using DWT2","5 pages, 4 Figures, 6 Tables. arXiv admin note: text overlap with
  arXiv:1007.5136 by other authors","Computer Science and Information Technologies, 28 September - 2
  October, 2009, Yerevan, Armenia",,,cs.CR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel digital watermarking for ownership verification and image
authentication applications using discrete wavelet transform (DWT) is proposed
in this paper. Most previous proposed watermarking algorithms embed sequences
of random numbers as watermarks. Here binary images are taken as watermark for
embedding. In the proposed approach, the host image is converted into the YCbCr
color space and then its Y channel decomposed into wavelet coefficients. The
selected approximation coefficients are quantized and then their four least
significant bits of the quantized coefficients are replaced by the watermark
using LSB insertion technique. At last, the watermarked image is synthesized
from the changed and unchanged DWT coefficients. The experiments show that the
proposed approach provides extra imperceptibility and robustness against
wavelet compression compared to the traditional embedding methods in RGB color
space. Moreover, the proposed approach has no need of the original image to
extract watermarks.
","[{'version': 'v1', 'created': 'Wed, 20 Jun 2012 19:11:10 GMT'}]",2012-06-21,"[['Khalili', 'Mehdi', '']]","['Digital watermarking', 'discrete wavelet transform', 'YCbCr color space', 'LSB insertion technique', 'imperceptibility', 'wavelet compression.  1']"
19806,1009.3502,Krishnam Raju Jampani,Krishnam Raju Jampani and Anna Lubiw,Simultaneous Interval Graphs,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a recent paper, we introduced the simultaneous representation problem
(defined for any graph class C) and studied the problem for chordal,
comparability and permutation graphs. For interval graphs, the problem is
defined as follows. Two interval graphs G_1 and G_2, sharing some vertices I
(and the corresponding induced edges), are said to be `simultaneous interval
graphs' if there exist interval representations R_1 and R_2 of G_1 and G_2,
such that any vertex of I is mapped to the same interval in both R_1 and R_2.
Equivalently, G_1 and G_2 are simultaneous interval graphs if there exist edges
E' between G_1-I and G_2-I such that G_1 \cup G_2 \cup E' is an interval graph.
  Simultaneous representation problems are related to simultaneous planar
embeddings, and have applications in any situation where it is desirable to
consistently represent two related graphs, for example: interval graphs
capturing overlaps of DNA fragments of two similar organisms; or graphs
connected in time, where one is an updated version of the other.
  In this paper we give an O(n^2*logn) time algorithm for recognizing
simultaneous interval graphs,where n = |G_1 \cup G_2|. This result complements
the polynomial time algorithms for recognizing probe interval graphs and
provides an efficient algorithm for the interval graph sandwich problem for the
special case where the set of optional edges induce a complete bipartite graph.
","[{'version': 'v1', 'created': 'Fri, 17 Sep 2010 20:25:56 GMT'}]",2010-09-21,"[['Jampani', 'Krishnam Raju', ''], ['Lubiw', 'Anna', '']]","['Simultaneous Graphs', 'Interval Graphs', 'Graph Sandwich Problem', 'Probe Graphs', 'PQ-trees']"
19807,1606.05002,Tanmay Gupta,"Tanmay Gupta, Daeyun Shin, Naren Sivagnanadasan, Derek Hoiem","3DFS: Deformable Dense Depth Fusion and Segmentation for Object
  Reconstruction from a Handheld Camera",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an approach for 3D reconstruction and segmentation of a single
object placed on a flat surface from an input video. Our approach is to perform
dense depth map estimation for multiple views using a proposed objective
function that preserves detail. The resulting depth maps are then fused using a
proposed implicit surface function that is robust to estimation error,
producing a smooth surface reconstruction of the entire scene. Finally, the
object is segmented from the remaining scene using a proposed 2D-3D
segmentation that incorporates image and depth cues with priors and
regularization over the 3D volume and 2D segmentations. We evaluate 3D
reconstructions qualitatively on our Object-Videos dataset, comparing to
fusion, multiview stereo, and segmentation baselines. We also quantitatively
evaluate the dense depth estimation using the RGBD Scenes V2 dataset [Henry et
al. 2013] and the segmentation using keyframe annotations of the Object-Videos
dataset.
","[{'version': 'v1', 'created': 'Wed, 15 Jun 2016 23:23:08 GMT'}, {'version': 'v2', 'created': 'Wed, 27 Jul 2016 20:38:19 GMT'}]",2016-07-29,"[['Gupta', 'Tanmay', ''], ['Shin', 'Daeyun', ''], ['Sivagnanadasan', 'Naren', ''], ['Hoiem', 'Derek', '']]","['3D Reconstruction', 'Dense-Depth Estimation', 'Volumetric Fusion', 'Joint 2D-3D Segmentation']"
19808,1304.5220,Marco Mondelli,"Marco Mondelli, S. Hamed Hassani, R\""udiger Urbanke",Scaling Exponent of List Decoders with Applications to Polar Codes,"14 pages, submitted to IEEE Trans. Inform. Theory and presented in
  part to ITW'13",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Motivated by the significant performance gains which polar codes experience
under successive cancellation list decoding, their scaling exponent is studied
as a function of the list size. In particular, the error probability is fixed
and the trade-off between block length and back-off from capacity is analyzed.
A lower bound is provided on the error probability under $\rm MAP$ decoding
with list size $L$ for any binary-input memoryless output-symmetric channel and
for any class of linear codes such that their minimum distance is unbounded as
the block length grows large. Then, it is shown that under $\rm MAP$ decoding,
although the introduction of a list can significantly improve the involved
constants, the scaling exponent itself, i.e., the speed at which capacity is
approached, stays unaffected for any finite list size. In particular, this
result applies to polar codes, since their minimum distance tends to infinity
as the block length increases. A similar result is proved for genie-aided
successive cancellation decoding when transmission takes place over the binary
erasure channel, namely, the scaling exponent remains constant for any fixed
number of helps from the genie. Note that since genie-aided successive
cancellation decoding might be strictly worse than successive cancellation list
decoding, the problem of establishing the scaling exponent of the latter
remains open.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2013 18:47:39 GMT'}, {'version': 'v2', 'created': 'Sun, 21 Apr 2013 18:05:46 GMT'}, {'version': 'v3', 'created': 'Fri, 26 Jul 2013 18:33:23 GMT'}, {'version': 'v4', 'created': 'Mon, 22 Sep 2014 08:40:00 GMT'}]",2014-09-23,"[['Mondelli', 'Marco', ''], ['Hassani', 'S. Hamed', ''], ['Urbanke', 'Rüdiger', '']]","['Scaling exponent', 'list decoding', 'polar codes', 'MAPdecoding', 'genie-aided decoding']"
19809,1301.6787,Fran\c{c}ois M\'eriaux,"Mariem Mhiri, Karim Cheikhrouhou, Abdelaziz Samet, Fran\c{c}ois
  M\'eriaux, Samson Lasaulce","Energy-Efficient Spectrum Sharing in Relay-Assisted Cognitive Radio
  Systems","IEEE Proc. of the International Conference on Network Games, Control
  and Optimization (NetGCooP), Nov. 2012, Avignon, France",,,,cs.IT cs.GT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work characterizes an important solution concept of a relevant spectrum
game. Two energy-efficient sources communicating with their respective
destination compete for an extra channel brought by a relay charging the used
bandwidth through a pricing mechanism. This game is shown to possess a unique
Nash bargaining solution, exploiting a time-sharing argument. This
Pareto-efficient solution can be implemented by using a distributed
optimization algorithm for which each transmitter uses a simple gradient-type
algorithm and alternately updates its spectrum sharing policy. Typical
numerical results show to what extent spectral efficiency can be improved in a
system involving selfish energy-efficient sources.
","[{'version': 'v1', 'created': 'Mon, 28 Jan 2013 21:50:08 GMT'}]",2013-01-30,"[['Mhiri', 'Mariem', ''], ['Cheikhrouhou', 'Karim', ''], ['Samet', 'Abdelaziz', ''], ['Mériaux', 'François', ''], ['Lasaulce', 'Samson', '']]","['resource allocation', 'cognitive radio', 'cooperativetransmission', 'Nash bargaining solution']"
19810,1606.03233,Astrid Pieterse,Bart M.P. Jansen and Astrid Pieterse,Optimal Sparsification for Some Binary CSPs Using Low-degree Polynomials,"Updated the cross-composition in lemma 18 (minor update), since the
  previous version did NOT satisfy requirement 4 of lemma 18 (the proof of
  Claim 20 was incorrect)",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper analyzes to what extent it is possible to efficiently reduce the
number of clauses in NP-hard satisfiability problems, without changing the
answer. Upper and lower bounds are established using the concept of
kernelization. Existing results show that if NP is not contained in coNP/poly,
no efficient preprocessing algorithm can reduce n-variable instances of CNF-SAT
with d literals per clause, to equivalent instances with $O(n^{d-e})$ bits for
any e > 0. For the Not-All-Equal SAT problem, a compression to size
$\~O(n^{d-1})$ exists. We put these results in a common framework by analyzing
the compressibility of binary CSPs. We characterize constraint types based on
the minimum degree of multivariate polynomials whose roots correspond to the
satisfying assignments, obtaining (nearly) matching upper and lower bounds in
several settings. Our lower bounds show that not just the number of
constraints, but also the encoding size of individual constraints plays an
important role. For example, for Exact Satisfiability with unbounded clause
length it is possible to efficiently reduce the number of constraints to n+1,
yet no polynomial-time algorithm can reduce to an equivalent instance with
$O(n^{2-e})$ bits for any e > 0, unless NP is a subset of coNP/poly.
","[{'version': 'v1', 'created': 'Fri, 10 Jun 2016 08:54:12 GMT'}, {'version': 'v2', 'created': 'Tue, 1 May 2018 09:07:02 GMT'}, {'version': 'v3', 'created': 'Fri, 28 Jun 2019 13:10:53 GMT'}]",2019-07-01,"[['Jansen', 'Bart M. P.', ''], ['Pieterse', 'Astrid', '']]","['constraint satisfaction problem', 'kernelization', 'satisfiability', 'sparsification']"
19811,1009.1412,Grenville Croll,Patrick O'Beirne,Spreadsheet Refactoring,14 Pages,"Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2010 24-32
  ISBN 978-1-905404-50-6",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Refactoring is a change made to the internal structure of software to make it
easier to understand and cheaper to modify without changing its observable
behaviour. A database refactoring is a small change to the database schema
which improves its design without changing its semantics. This paper presents
example 'spreadsheet refactorings', derived from the above and taking into
account the unique characteristics of spreadsheet formulas and VBA code. The
techniques are constrained by the tightly coupled data and code in
spreadsheets.
","[{'version': 'v1', 'created': 'Tue, 7 Sep 2010 21:35:50 GMT'}]",2010-09-09,"[[""O'Beirne"", 'Patrick', '']]","['spreadsheets', 'spreadsheet errors', 'quality', 'end-user computing', 'software development', 'agile']"
19812,1609.05374,Holakou Rahmanian,"Holakou Rahmanian, David P. Helmbold, S.V.N. Vishwanathan",Online Learning of Combinatorial Objects via Extended Formulation,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The standard techniques for online learning of combinatorial objects perform
multiplicative updates followed by projections into the convex hull of all the
objects. However, this methodology can be expensive if the convex hull contains
many facets. For example, the convex hull of $n$-symbol Huffman trees is known
to have exponentially many facets (Maurras et al., 2010). We get around this
difficulty by exploiting extended formulations (Kaibel, 2011), which encode the
polytope of combinatorial objects in a higher dimensional ""extended"" space with
only polynomially many facets. We develop a general framework for converting
extended formulations into efficient online algorithms with good relative loss
bounds. We present applications of our framework to online learning of Huffman
trees and permutations. The regret bounds of the resulting algorithms are
within a factor of $O(\sqrt{\log(n)})$ of the state-of-the-art specialized
algorithms for permutations, and depending on the loss regimes, improve on or
match the state-of-the-art for Huffman trees. Our method is general and can be
applied to other combinatorial objects.
","[{'version': 'v1', 'created': 'Sat, 17 Sep 2016 18:38:46 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Feb 2017 19:51:28 GMT'}, {'version': 'v3', 'created': 'Thu, 6 Apr 2017 16:28:45 GMT'}, {'version': 'v4', 'created': 'Thu, 8 Jun 2017 01:49:06 GMT'}, {'version': 'v5', 'created': 'Mon, 30 Oct 2017 20:33:11 GMT'}]",2017-11-01,"[['Rahmanian', 'Holakou', ''], ['Helmbold', 'David P.', ''], ['Vishwanathan', 'S. V. N.', '']]","['online learning', 'extended formulation', 'combinatorial object', 'hedge']"
19813,1207.5208,Francis Maes,Francis Maes and Damien Ernst and Louis Wehenkel,"Meta-Learning of Exploration/Exploitation Strategies: The Multi-Armed
  Bandit Case","16 pages, Springer Selection of papers of ICAART'12",,,,cs.AI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The exploration/exploitation (E/E) dilemma arises naturally in many subfields
of Science. Multi-armed bandit problems formalize this dilemma in its canonical
form. Most current research in this field focuses on generic solutions that can
be applied to a wide range of problems. However, in practice, it is often the
case that a form of prior information is available about the specific class of
target problems. Prior knowledge is rarely used in current solutions due to the
lack of a systematic approach to incorporate it into the E/E strategy.
  To address a specific class of E/E problems, we propose to proceed in three
steps: (i) model prior knowledge in the form of a probability distribution over
the target class of E/E problems; (ii) choose a large hypothesis space of
candidate E/E strategies; and (iii), solve an optimization problem to find a
candidate E/E strategy of maximal average performance over a sample of problems
drawn from the prior distribution.
  We illustrate this meta-learning approach with two different hypothesis
spaces: one where E/E strategies are numerically parameterized and another
where E/E strategies are represented as small symbolic formulas. We propose
appropriate optimization algorithms for both cases. Our experiments, with
two-armed Bernoulli bandit problems and various playing budgets, show that the
meta-learnt E/E strategies outperform generic strategies of the literature
(UCB1, UCB1-Tuned, UCB-v, KL-UCB and epsilon greedy); they also evaluate the
robustness of the learnt E/E strategies, by tests carried out on arms whose
rewards follow a truncated Gaussian distribution.
","[{'version': 'v1', 'created': 'Sun, 22 Jul 2012 09:34:49 GMT'}]",2012-07-24,"[['Maes', 'Francis', ''], ['Ernst', 'Damien', ''], ['Wehenkel', 'Louis', '']]","['exploration-exploitation dilemma', 'prior knowledge', 'multiarmed bandit problems', 'reinforcement learning']"
19814,1105.2899,Hossein Hosseini,"Hossein Hosseini, Farokh Marvasti","Fast restoration of natural images corrupted by high-density impulse
  noise",,,,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we suggest a general model for the fixed-valued impulse noise
and propose a two-stage method for high density noise suppression while
preserving the image details. In the first stage, we apply an iterative impulse
detector, exploiting the image entropy, to identify the corrupted pixels and
then employ an Adaptive Iterative Mean filter to restore them. The filter is
adaptive in terms of the number of iterations, which is different for each
noisy pixel, according to the Euclidean distance from the nearest uncorrupted
pixel. Experimental results show that the proposed filter is fast and
outperforms the best existing techniques in both objective and subjective
performance measures.
","[{'version': 'v1', 'created': 'Sat, 14 May 2011 13:57:35 GMT'}, {'version': 'v2', 'created': 'Thu, 23 Jan 2014 13:33:06 GMT'}]",2014-01-24,"[['Hosseini', 'Hossein', ''], ['Marvasti', 'Farokh', '']]","['Image denoising', 'Salt-and-pepper noise', 'General fixed-valued impulse noise', 'Image entropy', 'Adaptiveiterative mean filter']"
19815,1704.04259,Piek Vossen,Piek Vossen and Agata Cybulska,Identity and Granularity of Events in Text,Invited keynote speech by Piek Vossen at Cicling 2016,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we describe a method to detect event descrip- tions in
different news articles and to model the semantics of events and their
components using RDF representations. We compare these descriptions to solve a
cross-document event coreference task. Our com- ponent approach to event
semantics defines identity and granularity of events at different levels. It
performs close to state-of-the-art approaches on the cross-document event
coreference task, while outperforming other works when assuming similar quality
of event detection. We demonstrate how granularity and identity are
interconnected and we discuss how se- mantic anomaly could be used to define
differences between coreference, subevent and topical relations.
","[{'version': 'v1', 'created': 'Thu, 13 Apr 2017 19:23:43 GMT'}]",2017-04-17,"[['Vossen', 'Piek', ''], ['Cybulska', 'Agata', '']]","['Event coreference', 'event identity', 'event relations']"
19816,1306.2268,Mi-Young  Park,Keehang Kwon and Mi-Young Park,Accomplishable Tasks in Knowledge Representation,arXiv admin note: substantial text overlap with arXiv:1305.2004,,,,cs.AI cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Knowledge Representation (KR) is traditionally based on the logic of facts,
expressed in boolean logic. However, facts about an agent can also be seen as a
set of accomplished tasks by the agent. This paper proposes a new approach to
KR: the notion of task logical KR based on Computability Logic. This notion
allows the user to represent both accomplished tasks and accomplishable tasks
by the agent. This notion allows us to build sophisticated KRs about many
interesting agents, which have not been supported by previous logical
languages.
","[{'version': 'v1', 'created': 'Fri, 7 Jun 2013 04:42:02 GMT'}]",2013-06-11,"[['Kwon', 'Keehang', ''], ['Park', 'Mi-Young', '']]","['tasks', 'knowledge representation', 'agents', 'computabilitylogic']"
19817,1710.03788,Zhiwei Zhao,"Weifeng Gao, Zhiwei Zhao, Geyong Min, Yue Cao, Hancong Duan, Lu Liu,
  Yimiao Long, Guangqiang Yin","Link Quality Aware Channel Allocation for Multichannel Body Sensor
  Networks",PMC,,,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Body Sensor Network (BSN) is a typical Internet-of-Things (IoT) application
for personalized health care. It consists of economically powered, wireless and
implanted medical monitoring sensor nodes, which are designed to continually
collect the medical information of the target patients. Multichannel is often
used in BSNs to reduce the spectrum competition of the tremendous sensor nodes
and the problem of channel assignment has attracted much research attention.
The health sensing data in BSNs is often required to be delivered to a sink
node (or server) before a certain deadline for real time monitoring or health
emergency alarm. Therefore, deadline is of significant importance for
multichannel allocation and scheduling. The existing works, though designed to
meet the deadline, often overlook the impact of the unreliable wireless links.
As a result, the health sensing data can still be overdue because of the
scheduled lossy links. Besides, potential collisions in the schedules also
incur considerable delay in delivering the sensing data. In this paper, we
propose a novel deadline- driven Link quality Aware Channel Assignment scheme
(LACA), where link quality, deadlines and collisions are jointly considered.
LACA prioritizes links with urgent deadlines and heavy collisions. Besides,
LACA allows the exploition of the spare slots for retransmissions on lossy
links, which can further reduce the retransmission delay. Extensive simulation
experiments show that compared to the existing approaches, LACA can better
utilize the wireless spectrum and achieve higher packet delivery ratio before
the deadline.
","[{'version': 'v1', 'created': 'Tue, 10 Oct 2017 19:09:52 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Oct 2017 16:57:56 GMT'}]",2017-10-30,"[['Gao', 'Weifeng', ''], ['Zhao', 'Zhiwei', ''], ['Min', 'Geyong', ''], ['Cao', 'Yue', ''], ['Duan', 'Hancong', ''], ['Liu', 'Lu', ''], ['Long', 'Yimiao', ''], ['Yin', 'Guangqiang', '']]","['channel assignment', 'multichannel', 'body sensor network', 'link quality aware', 'deadline driven']"
19818,1511.06728,Natalia Neverova,"Natalia Neverova, Christian Wolf, Florian Nebout, Graham Taylor","Hand Pose Estimation through Semi-Supervised and Weakly-Supervised
  Learning","13 pages, 10 figures, 4 tables",,,,cs.CV cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a method for hand pose estimation based on a deep regressor
trained on two different kinds of input. Raw depth data is fused with an
intermediate representation in the form of a segmentation of the hand into
parts. This intermediate representation contains important topological
information and provides useful cues for reasoning about joint locations. The
mapping from raw depth to segmentation maps is learned in a
semi/weakly-supervised way from two different datasets: (i) a synthetic dataset
created through a rendering pipeline including densely labeled ground truth
(pixelwise segmentations); and (ii) a dataset with real images for which ground
truth joint positions are available, but not dense segmentations. Loss for
training on real images is generated from a patch-wise restoration process,
which aligns tentative segmentation maps with a large dictionary of synthetic
poses. The underlying premise is that the domain shift between synthetic and
real data is smaller in the intermediate representation, where labels carry
geometric and topological meaning, than in the raw input domain. Experiments on
the NYU dataset show that the proposed training method decreases error on
joints over direct regression of joints from depth data by 15.7%.
","[{'version': 'v1', 'created': 'Fri, 20 Nov 2015 19:19:00 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Jun 2016 13:31:05 GMT'}, {'version': 'v3', 'created': 'Thu, 9 Jun 2016 06:08:54 GMT'}, {'version': 'v4', 'created': 'Fri, 15 Sep 2017 09:24:57 GMT'}]",2017-09-18,"[['Neverova', 'Natalia', ''], ['Wolf', 'Christian', ''], ['Nebout', 'Florian', ''], ['Taylor', 'Graham', '']]","['Hand pose estimation', 'Deep learning', 'Semantic segmentation']"
19819,1704.04189,Alexandr Naumchev,"Alexandr Naumchev, Bertrand Meyer",Seamless Requirements,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Popular notations for functional requirements specifications frequently
ignore developers' needs, target specific development models, or require
translation of requirements into tests for verification; the results can give
out-of-sync or downright incompatible artifacts. Seamless Requirements, a new
approach to specifying functional requirements, contributes to developers'
understanding of requirements and to software quality regardless of the
process, while the process itself becomes lighter due to the absence of tests
in the presence of formal verification. A development case illustrates these
benefits, and a discussion compares seamless requirements to other approaches.
","[{'version': 'v1', 'created': 'Thu, 13 Apr 2017 15:58:52 GMT'}]",2017-04-14,"[['Naumchev', 'Alexandr', ''], ['Meyer', 'Bertrand', '']]","['seamless requirements', 'specification drivers', 'AutoProof', 'Eiffel', 'Design byContract', 'formal verification']"
19820,1505.06561,Mingzhe Wang,"Mingzhe Wang, Bo Wang, Qiu He, Xiuxiu Liu, Kunshuai Zhu",Analysis of GPU Parallel Computing based on Matlab,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Matlab is very widely used in scientific computing, but Matlab computational
efficiency is lower than C language program. In order to improve the computing
speed, some toolbox can use GPU to accelerate the computation. This paper
describes GPU working principle, our experiments and results analysis of
parallel computing by using GPU based on Matlab. Experimental results show that
for parallel operations, GPU computing speed is faster than CPU, for the
logical instructions, GPU computing speed is slower than CPU.
","[{'version': 'v1', 'created': 'Mon, 25 May 2015 08:23:31 GMT'}]",2015-05-26,"[['Wang', 'Mingzhe', ''], ['Wang', 'Bo', ''], ['He', 'Qiu', ''], ['Liu', 'Xiuxiu', ''], ['Zhu', 'Kunshuai', '']]","['GPU', 'Parallel computing', 'Matlab', 'Speedup ratio']"
19821,1610.01153,Valery Tabakov,Valery Tabakov,"Integration of higher IT education in Ukraine in the global
  IT-educational space",7 pages,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The article presents the results of a study of the current state of higher IT
education system in Ukraine. The problems of reforming higher IT education
system of Ukraine in accordance with the commitments made by Ukraine in
connection with the ratification of the EU-Ukraine Agreement Law of Ukraine N
1678-VII of September 16, 2014. An indicator of the presence or absence of a
real reform of the system of higher IT education in Ukraine is detected. A
comparative analysis of lists of IT-specialties of higher education in Ukraine
in 2005 and 2015 with similar lists adopted by the international system of
higher IT education is made. A discrepancy between the list of IT-specialties
in Ukraine and international list of IT specialties are identified. The
conclusion about the need for immediate correction of the list of higher
education in Ukraine IT-specialties in order to bring it into line with
international standards. It recommended a series of actions that will lead to
the solution of the problem.
","[{'version': 'v1', 'created': 'Tue, 4 Oct 2016 16:07:53 GMT'}]",2016-10-06,"[['Tabakov', 'Valery', '']]","['IT-education', 'EU-Ukraine Agreement', 'reforming', 'international']"
19822,1409.2819,Nasser Ghadiri,"Bagher Saberi, Nasser Ghadiri","A Sample-Based Approach to Data Quality Assessment in Spatial Databases
  with Application to Mobile Trajectory Nearest-Neighbor Search",,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spatial data is playing an emerging role in new technologies such as web and
mobile mapping and Geographic Information Systems (GIS). Important decisions in
political, social and many other aspects of modern human life are being made
using location data. Decision makers in many countries are exploiting spatial
databases for collecting information, analyzing them and planning for the
future. In fact, not every spatial database is suitable for this type of
application. Inaccuracy, imprecision and other deficiencies are present in
location data just as any other type of data and may have a negative impact on
credibility of any action taken based on unrefined information. So we need a
method for evaluating the quality of spatial data and separating usable data
from misleading data which leads to weak decisions. On the other hand, spatial
databases are usually huge in size and therefore working with this type of data
has a negative impact on efficiency. To improve the efficiency of working with
spatial big data, we need a method for shrinking the volume of data. Sampling
is one of these methods, but its negative effects on the quality of data are
inevitable. In this paper we are trying to show and assess this change in
quality of spatial data that is a consequence of sampling. We used this
approach for evaluating the quality of sampled spatial data related to mobile
user trajectories in China which are available in a well-known spatial
database. The results show that sample-based control of data quality will
increase the query performance significantly, without losing too much accuracy.
Based on this results some future improvements are pointed out which will help
to process location-based queries faster than before and to make more accurate
location-based decisions in limited times.
","[{'version': 'v1', 'created': 'Tue, 9 Sep 2014 17:10:11 GMT'}, {'version': 'v2', 'created': 'Sat, 14 May 2016 08:11:26 GMT'}]",2016-05-17,"[['Saberi', 'Bagher', ''], ['Ghadiri', 'Nasser', '']]","['Algebraic Operations', 'Data Integration', 'Quality Metrics', 'Spatial Big Data', 'Location Data']"
19823,1705.07008,Leandro dos Santos,"Leandro B. dos Santos, Magali S. Duran, Nathan S. Hartmann, Arnaldo
  Candido Jr., Gustavo H. Paetzold, Sandra M. Aluisio","A Lightweight Regression Method to Infer Psycholinguistic Properties for
  Brazilian Portuguese",Paper accepted for TSD2017,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Psycholinguistic properties of words have been used in various approaches to
Natural Language Processing tasks, such as text simplification and readability
assessment. Most of these properties are subjective, involving costly and
time-consuming surveys to be gathered. Recent approaches use the limited
datasets of psycholinguistic properties to extend them automatically to large
lexicons. However, some of the resources used by such approaches are not
available to most languages. This study presents a method to infer
psycholinguistic properties for Brazilian Portuguese (BP) using regressors
built with a light set of features usually available for less resourced
languages: word length, frequency lists, lexical databases composed of school
dictionaries and word embedding models. The correlations between the properties
inferred are close to those obtained by related works. The resulting resource
contains 26,874 words in BP annotated with concreteness, age of acquisition,
imageability and subjective frequency.
","[{'version': 'v1', 'created': 'Fri, 19 May 2017 14:17:31 GMT'}]",2017-05-22,"[['Santos', 'Leandro B. dos', ''], ['Duran', 'Magali S.', ''], ['Hartmann', 'Nathan S.', ''], ['Candido', 'Arnaldo', 'Jr.'], ['Paetzold', 'Gustavo H.', ''], ['Aluisio', 'Sandra M.', '']]","['Psycholinguistic properties', 'Brazilian Portuguese', 'Lexical resources']"
19824,0904.0228,Genady Grabarnik,"Genady Grabarnik, Aaron Kershenbaum (IBM TJ Watson Research)",Safe Reasoning Over Ontologies,,,,,cs.AI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As ontologies proliferate and automatic reasoners become more powerful, the
problem of protecting sensitive information becomes more serious. In
particular, as facts can be inferred from other facts, it becomes increasingly
likely that information included in an ontology, while not itself deemed
sensitive, may be able to be used to infer other sensitive information.
  We first consider the problem of testing an ontology for safeness defined as
its not being able to be used to derive any sensitive facts using a given
collection of inference rules. We then consider the problem of optimizing an
ontology based on the criterion of making as much useful information as
possible available without revealing any sensitive facts.
","[{'version': 'v1', 'created': 'Wed, 1 Apr 2009 18:46:04 GMT'}]",2009-04-02,"[['Grabarnik', 'Genady', '', 'IBM TJ Watson Research'], ['Kershenbaum', 'Aaron', '', 'IBM TJ Watson Research']]","['Ontology', 'safe reasoning', 'reasoning over ontology', 'OWL']"
19825,1702.06341,Gergely Neu,Gergely Neu and Vicen\c{c} G\'omez,"Fast rates for online learning in Linearly Solvable Markov Decision
  Processes",,,,,cs.LG math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of online learning in a class of Markov decision
processes known as linearly solvable MDPs. In the stationary version of this
problem, a learner interacts with its environment by directly controlling the
state transitions, attempting to balance a fixed state-dependent cost and a
certain smooth cost penalizing extreme control inputs. In the current paper, we
consider an online setting where the state costs may change arbitrarily between
consecutive rounds, and the learner only observes the costs at the end of each
respective round. We are interested in constructing algorithms for the learner
that guarantee small regret against the best stationary control policy chosen
in full knowledge of the cost sequence. Our main result is showing that the
smoothness of the control cost enables the simple algorithm of following the
leader to achieve a regret of order $\log^2 T$ after $T$ rounds, vastly
improving on the best known regret bound of order $T^{3/4}$ for this setting.
","[{'version': 'v1', 'created': 'Tue, 21 Feb 2017 11:56:33 GMT'}, {'version': 'v2', 'created': 'Tue, 6 Jun 2017 11:01:30 GMT'}]",2017-06-07,"[['Neu', 'Gergely', ''], ['Gómez', 'Vicenç', '']]","['Online learning', 'fast rates', 'Markov decision processes', 'optimal control']"
19826,1009.4987,S. M. Kamruzzaman,"S. M. Kamruzzaman, Farhana Haider, and Ahmed Ryadh Hasan",Text Classification using Data Mining,"19 Pages, International Conference","Proc. International Conference on Information and Communication
  Technology in Management (ICTM-2005), Multimedia University, Malaysia, May
  2005",,,cs.IR cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Text classification is the process of classifying documents into predefined
categories based on their content. It is the automated assignment of natural
language texts to predefined categories. Text classification is the primary
requirement of text retrieval systems, which retrieve texts in response to a
user query, and text understanding systems, which transform text in some way
such as producing summaries, answering questions or extracting data. Existing
supervised learning algorithms to automatically classify text need sufficient
documents to learn accurately. This paper presents a new algorithm for text
classification using data mining that requires fewer documents for training.
Instead of using words, word relation i.e. association rules from these words
is used to derive feature set from pre-classified text documents. The concept
of Naive Bayes classifier is then used on derived features and finally only a
single concept of Genetic Algorithm has been added for final classification. A
system based on the proposed algorithm has been implemented and tested. The
experimental results show that the proposed system works as a successful text
classifier.
","[{'version': 'v1', 'created': 'Sat, 25 Sep 2010 07:27:46 GMT'}]",2010-09-28,"[['Kamruzzaman', 'S. M.', ''], ['Haider', 'Farhana', ''], ['Hasan', 'Ahmed Ryadh', '']]","['Text classification', 'association rule', 'Apriori algorithm', 'confidence', 'support', 'Naïve Bayes classifier', 'genetic algorithm.  1']"
19827,1609.01188,Fahad Al-Obaidli,"Fahad Al-Obaidli, Stephen Cox, Preslav Nakov","Bi-Text Alignment of Movie Subtitles for Spoken English-Arabic
  Statistical Machine Translation",,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe efforts towards getting better resources for English-Arabic
machine translation of spoken text. In particular, we look at movie subtitles
as a unique, rich resource, as subtitles in one language often get translated
into other languages. Movie subtitles are not new as a resource and have been
explored in previous research; however, here we create a much larger bi-text
(the biggest to date), and we further generate better quality alignment for it.
Given the subtitles for the same movie in different languages, a key problem is
how to align them at the fragment level. Typically, this is done using
length-based alignment, but for movie subtitles, there is also time
information. Here we exploit this information to develop an original algorithm
that outperforms the current best subtitle alignment tool, subalign. The
evaluation results show that adding our bi-text to the IWSLT training bi-text
yields an improvement of over two BLEU points absolute.
","[{'version': 'v1', 'created': 'Mon, 5 Sep 2016 14:55:31 GMT'}]",2016-09-06,"[['Al-Obaidli', 'Fahad', ''], ['Cox', 'Stephen', ''], ['Nakov', 'Preslav', '']]","['Machine Translation', 'bi-text alignment', 'movie subtitles']"
19828,1604.07044,Xianming Liu,"Xianming Liu, Min-Hsuan Tsai, Thomas Huang",Analyzing User Preference for Social Image Recommendation,,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the incredibly growing amount of multimedia data shared on the social
media platforms, recommender systems have become an important necessity to ease
users' burden on the information overload. In such a scenario, extensive amount
of heterogeneous information such as tags, image content, in addition to the
user-to-item preferences, is extremely valuable for making effective
recommendations. In this paper, we explore a novel hybrid algorithm termed {\em
STM}, for image recommendation. STM jointly considers the problem of image
content analysis with the users' preferences on the basis of sparse
representation. STM is able to tackle the challenges of highly sparse user
feedbacks and cold-start problmes in the social network scenario. In addition,
our model is based on the classical probabilistic matrix factorization and can
be easily extended to incorporate other useful information such as the social
relationships. We evaluate our approach with a newly collected 0.3 million
social image data set from Flickr. The experimental results demonstrate that
sparse topic modeling of the image content leads to more effective
recommendations, , with a significant performance gain over the
state-of-the-art alternatives.
","[{'version': 'v1', 'created': 'Sun, 24 Apr 2016 15:54:02 GMT'}]",2016-04-26,"[['Liu', 'Xianming', ''], ['Tsai', 'Min-Hsuan', ''], ['Huang', 'Thomas', '']]","['Collaborative Filtering', 'Content Analysis', 'Image recommendation', 'Social media', 'Sparse Representation']"
19829,1512.01043,Harsh Thakkar,"Harsh Thakkar, Dhiren Patel",Approaches for Sentiment Analysis on Twitter: A State-of-Art study,,,,,cs.SI cs.CL cs.IR,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Microbloging is an extremely prevalent broadcast medium amidst the Internet
fraternity these days. People share their opinions and sentiments about variety
of subjects like products, news, institutions, etc., every day on microbloging
websites. Sentiment analysis plays a key role in prediction systems, opinion
mining systems, etc. Twitter, one of the microbloging platforms allows a limit
of 140 characters to its users. This restriction stimulates users to be very
concise about their opinion and twitter an ocean of sentiments to analyze.
Twitter also provides developer friendly streaming API for data retrieval
purpose allowing the analyst to search real time tweets from various users. In
this paper, we discuss the state-of-art of the works which are focused on
Twitter, the online social network platform, for sentiment analysis. We survey
various lexical, machine learning and hybrid approaches for sentiment analysis
on Twitter.
","[{'version': 'v1', 'created': 'Thu, 3 Dec 2015 11:29:36 GMT'}]",2015-12-04,"[['Thakkar', 'Harsh', ''], ['Patel', 'Dhiren', '']]","['Microbloging', 'Sentiment Analysis', 'Online Social Network', 'Opinion Mining']"
19830,1009.4973,S. M. Kamruzzaman,S. M. Kamruzzaman and Md. Anisur Rahman,Performance Analysis of Pulse Shaping Technique for OFDM PAPR Reduction,"5 Pages, International Conference","Proc. 12th International Conference on Human Computer Interaction,
  Beijing, China, Vol. 18, Jul. 2007",,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Orthogonal Frequency Division Multiplexing (OFDM) is an attractive modulation
and multiple access techniques for channels with a nonflat frequency response,
as it saves the need for complex equalizers. It can offer high quality
performance in terms of bandwidth efficiency, robustness against multipath
fading and cost-effective implementation. However, its main disadvantage is the
high peak-to-average power ratio (PAPR) of the output signal. As a result, a
linear behavior of the system over a large dynamic range is needed and
therefore the efficiency of the output amplifier is reduced. In this paper, we
investigate the effect of some of these sets of time waveforms on the OFDM
system performance in terms of Bit Error Rate (BER). We evaluate the system
performance in AWGN channels. The obtained results indicate that the reduction
in PAPR of the investigated methods is associated with considerable improvement
in BER performance of the system, in multipath channels, as compared to
conventional OFDM. These promising results indicate that pulse shaping with
reduced PAPR is an attractive solution for an OFDM system.
","[{'version': 'v1', 'created': 'Sat, 25 Sep 2010 05:39:42 GMT'}]",2010-09-28,"[['Kamruzzaman', 'S. M.', ''], ['Rahman', 'Md. Anisur', '']]","['OFDM', 'PAPR', 'sub-carriers', 'pulse shaping', 'multipath channels', 'AWGN channels', 'BER']"
19831,1802.07942,Fredrik Johansson,Fredrik Johansson,Numerical integration in arbitrary-precision ball arithmetic,"8 pages, 1 figure",,,,cs.MS cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present an implementation of arbitrary-precision numerical integration
with rigorous error bounds in the Arb library. Rapid convergence is ensured for
piecewise complex analytic integrals by use of the Petras algorithm, which
combines adaptive bisection with adaptive Gaussian quadrature where error
bounds are determined via complex magnitudes without evaluating derivatives.
The code is general, easy to use, and efficient, often outperforming existing
non-rigorous software.
","[{'version': 'v1', 'created': 'Thu, 22 Feb 2018 08:46:14 GMT'}]",2018-02-23,"[['Johansson', 'Fredrik', '']]","['Numerical integration', 'interval arithmetic', 'special functions']"
19832,1412.5796,Vasile Patrascu,Vasile Patrascu,Image Enhancement Using a Generalization of Homographic Function,"The IEEE International Conference COMMUNICATIONS 2002, pp. 429-434,
  December 5-7, 2002, Bucharest, Romania",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new method of gray level image enhancement, based on
point transforms. In order to define the transform function, it was used a
generalization of the homographic function.
","[{'version': 'v1', 'created': 'Thu, 18 Dec 2014 10:32:57 GMT'}]",2014-12-19,"[['Patrascu', 'Vasile', '']]","['image enhancement', 'homographic function', 'histogram equalization']"
19833,1506.04333,Nikos Bikakis,"Nikos Bikakis, John Liagouris, Maria Krommyda, George Papastefanatos,
  Timos Sellis",Towards Scalable Visual Exploration of Very Large RDF Graphs,12th Extended Semantic Web Conference (ESWC 2015),,,,cs.HC cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we outline our work on developing a disk-based infrastructure
for efficient visualization and graph exploration operations over very large
graphs. The proposed platform, called graphVizdb, is based on a novel technique
for indexing and storing the graph. Particularly, the graph layout is indexed
with a spatial data structure, i.e., an R-tree, and stored in a database. In
runtime, user operations are translated into efficient spatial operations
(i.e., window queries) in the backend.
","[{'version': 'v1', 'created': 'Sat, 13 Jun 2015 23:23:21 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Jun 2015 21:32:30 GMT'}]",2015-06-18,"[['Bikakis', 'Nikos', ''], ['Liagouris', 'John', ''], ['Krommyda', 'Maria', ''], ['Papastefanatos', 'George', ''], ['Sellis', 'Timos', '']]","['graphVizdb', 'graph data', 'disk based visualization tool', 'RDF graphvisualization', 'spatial', 'visualizing linked data', 'partition based graph layout']"
19834,1701.06805,M{\aa}ns Larsson,"M{\aa}ns Larsson, Anurag Arnab, Fredrik Kahl, Shuai Zheng, Philip Torr","A Projected Gradient Descent Method for CRF Inference allowing
  End-To-End Training of Arbitrary Pairwise Potentials",Presented at EMMCVPR 2017 conference,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Are we using the right potential functions in the Conditional Random Field
models that are popular in the Vision community? Semantic segmentation and
other pixel-level labelling tasks have made significant progress recently due
to the deep learning paradigm. However, most state-of-the-art structured
prediction methods also include a random field model with a hand-crafted
Gaussian potential to model spatial priors, label consistencies and
feature-based image conditioning.
  In this paper, we challenge this view by developing a new inference and
learning framework which can learn pairwise CRF potentials restricted only by
their dependence on the image pixel values and the size of the support. Both
standard spatial and high-dimensional bilateral kernels are considered. Our
framework is based on the observation that CRF inference can be achieved via
projected gradient descent and consequently, can easily be integrated in deep
neural networks to allow for end-to-end training. It is empirically
demonstrated that such learned potentials can improve segmentation accuracy and
that certain label class interactions are indeed better modelled by a
non-Gaussian potential. In addition, we compare our inference method to the
commonly used mean-field algorithm. Our framework is evaluated on several
public benchmarks for semantic segmentation with improved performance compared
to previous state-of-the-art CNN+CRF models.
","[{'version': 'v1', 'created': 'Tue, 24 Jan 2017 10:45:32 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Mar 2017 13:51:02 GMT'}, {'version': 'v3', 'created': 'Tue, 2 Jan 2018 10:31:27 GMT'}]",2018-01-03,"[['Larsson', 'Måns', ''], ['Arnab', 'Anurag', ''], ['Kahl', 'Fredrik', ''], ['Zheng', 'Shuai', ''], ['Torr', 'Philip', '']]","['Conditional Random Fields', 'Segmentation', 'Convolutional NeuralNetworks']"
19835,1002.1773,Philippe Wenger,Philippe Wenger (IRCCyN),Cuspidal and Noncuspidal Robot Manipulators,,"Robotica 25, 6 (2007) 717-724",,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article synthezises the most important results on the kinematics of
cuspidal manipulators i.e. nonredundant manipulators that can change posture
without meeting a singularity. The characteristic surfaces, the uniqueness
domains and the regions of feasible paths in the workspace are defined. Then,
several sufficient geometric conditions for a manipulator to be noncuspidal are
enumerated and a general necessary and sufficient condition for a manipulator
to be cuspidal is provided. An explicit DH-parameter-based condition for an
orthogonal manipulator to be cuspidal is derived. The full classification of 3R
orthogonal manipulators is provided and all types of cuspidal and noncuspidal
orthogonal manipulators are enumerated. Finally, some facts about cuspidal and
noncuspidal 6R manipulators are reported.
","[{'version': 'v1', 'created': 'Tue, 9 Feb 2010 04:44:26 GMT'}]",2010-02-10,"[['Wenger', 'Philippe', '', 'IRCCyN']]","['Cuspidal manipulator', 'Singularity', 'Posture', 'Workspace', 'Cusp Point', 'Classification']"
19836,1105.3416,Lu Lu,"Lu Lu, Taotao Wang, Soung Chang Liew, and Shengli Zhang",Implementation of Physical-layer Network Coding,,,,,cs.NI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the first implementation of a two-way relay network based
on the principle of physical-layer network coding. To date, only a simplified
version of physical-layer network coding (PNC) method, called analog network
coding (ANC), has been successfully implemented. The advantage of ANC is that
it is simple to implement; the disadvantage, on the other hand, is that the
relay amplifies the noise along with the signal before forwarding the signal.
PNC systems in which the relay performs XOR or other denoising PNC mappings of
the received signal have the potential for significantly better performance.
However, the implementation of such PNC systems poses many challenges. For
example, the relay must be able to deal with symbol and carrier-phase
asynchronies of the simultaneous signals received from the two end nodes, and
the relay must perform channel estimation before detecting the signals. We
investigate a PNC implementation in the frequency domain, referred to as FPNC,
to tackle these challenges. FPNC is based on OFDM. In FPNC, XOR mapping is
performed on the OFDM samples in each subcarrier rather than on the samples in
the time domain. We implement FPNC on the universal soft radio peripheral
(USRP) platform. Our implementation requires only moderate modifications of the
packet preamble design of 802.11a/g OFDM PHY. With the help of the cyclic
prefix (CP) in OFDM, symbol asynchrony and the multi-path fading effects can be
dealt with in a similar fashion. Our experimental results show that
symbol-synchronous and symbol-asynchronous FPNC have essentially the same BER
performance, for both channel-coded and unchannel-coded FPNC.
","[{'version': 'v1', 'created': 'Tue, 17 May 2011 15:41:05 GMT'}]",2015-03-19,"[['Lu', 'Lu', ''], ['Wang', 'Taotao', ''], ['Liew', 'Soung Chang', ''], ['Zhang', 'Shengli', '']]","['physical-layer network coding', 'network coding implementation', 'software radio']"
19837,1502.05102,Shouhuai Xu Shouhuai Xu,Shouhuai Xu,Emergent Behavior in Cybersecurity,"2 pages, HotSoS'2014 (2014 Symposium and Bootcamp on the Science of
  Security)",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We argue that emergent behavior is inherent to cybersecurity.
","[{'version': 'v1', 'created': 'Wed, 18 Feb 2015 02:05:02 GMT'}]",2015-02-19,"[['Xu', 'Shouhuai', '']]","['Emergent behavior', 'cybersecurity', 'security properties']"
19838,1109.1454,Anis Ismail,"Anis Ismail, Abd El Salam AL Hajjar and Mohammad Hajjar","A Prototype System for Controlling a Computer by Head Movements and
  Voice Commands","11 pages, 4 figures",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a new prototype system for controlling a PC by head
movements and also with voice commands. Our system is a multimodal interface
concerned with controlling the computer. The selected modes of interaction are
speech and gestures. We are seeing the revolutionary of computers and
information technologies into daily practice. Healthy people use keyboard,
mouse, trackball, or touchpad for controlling the PC. However these peripheries
are usually not suitable for handicapped people. They may have problems using
these standard peripheries, for example when they suffer from myopathy, or
cannot move their hands after an injury. Our system has been developed to
provide computer access for people with severe disabilities. This system tracks
the computer user's Head movements with a video camera and translates them into
the movements of the mouse pointer on the screen and the voice as button
presses. Therefore we are coming with a proposal system that can be used with
handicapped people to control the PC.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2011 10:26:17 GMT'}]",2011-09-27,"[['Ismail', 'Anis', ''], ['Hajjar', 'Abd El Salam AL', ''], ['Hajjar', 'Mohammad', '']]","['IHM', 'Gesture', 'Speech', 'multimodal interface', 'handicapped people']"
19839,1802.08888,Sami Abu-El-Haija,"Sami Abu-El-Haija, Amol Kapoor, Bryan Perozzi, Joonseok Lee","N-GCN: Multi-scale Graph Convolution for Semi-supervised Node
  Classification",,,,,cs.LG cs.SI stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph Convolutional Networks (GCNs) have shown significant improvements in
semi-supervised learning on graph-structured data. Concurrently, unsupervised
learning of graph embeddings has benefited from the information contained in
random walks. In this paper, we propose a model: Network of GCNs (N-GCN), which
marries these two lines of work. At its core, N-GCN trains multiple instances
of GCNs over node pairs discovered at different distances in random walks, and
learns a combination of the instance outputs which optimizes the classification
objective. Our experiments show that our proposed N-GCN model improves
state-of-the-art baselines on all of the challenging node classification tasks
we consider: Cora, Citeseer, Pubmed, and PPI. In addition, our proposed method
has other desirable properties, including generalization to recently proposed
semi-supervised learning methods such as GraphSAGE, allowing us to propose
N-SAGE, and resilience to adversarial input perturbations.
","[{'version': 'v1', 'created': 'Sat, 24 Feb 2018 18:30:30 GMT'}]",2018-02-27,"[['Abu-El-Haija', 'Sami', ''], ['Kapoor', 'Amol', ''], ['Perozzi', 'Bryan', ''], ['Lee', 'Joonseok', '']]","['Graph', 'Convolution', 'Spectral', 'Semi-Supervised Learning', 'DeepLearning']"
19840,1609.06071,Engin Zeydan,"Omer Narmanlioglu, Engin Zeydan","Software-Defined Networking Based Network Virtualization for Mobile
  Operators","accepted for publication in Computers & Electrical Engineering
  Journal (Elsevier) Special Issue on Software-Defined Control for Next
  Generation Wireless Systems",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software-Defined Networking (SDN) paradigm provides many features including
hardware abstraction, programmable networking and centralized policy control.
One of the main benefits used along with these features is core/backhaul
network virtualization which ensures sharing of mobile core and backhaul
networks among Mobile Operators (MOs). In this paper, we propose a virtualized
SDN-based Evolved Packet System (EPS) cellular network architecture including
design of network virtualization controller. After virtualization of
core/backhaul network elements, eNodeBs associated with MOs become a part of
resource allocation problem for Backhaul Transport Providers (BTPs). We
investigate the performance of our proposed architecture where eNodeBs are
assigned to the MOs using quality-of-service (QoS)-aware and QoS-unaware
scheduling algorithms under the consideration of time-varying numbers and
locations of user equipments (UEs) through Monte-Carlo simulations. The
performances are compared with traditional EPS in Long Term Evolution (LTE)
architecture and the results reveal that our proposed architecture outperforms
the traditional cellular network architecture.
","[{'version': 'v1', 'created': 'Tue, 20 Sep 2016 09:43:29 GMT'}, {'version': 'v2', 'created': 'Sat, 24 Sep 2016 05:58:52 GMT'}]",2016-09-27,"[['Narmanlioglu', 'Omer', ''], ['Zeydan', 'Engin', '']]","['Software-Defined Networking', 'Network Virtualization', 'Virtualization Controller', 'Schedulers', 'Long Term Evolution']"
19841,1501.04412,Krishna Chaitanya A,"Krishna Chaitanya A, Utpal Muherji, Vinod Sharma","Power Allocation Games on Interference Channels with Complete and
  Partial Information",arXiv admin note: text overlap with arXiv:1409.7551,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a wireless channel shared by multiple transmitter-receiver pairs.
Their transmissions interfere with each other. Each transmitter-receiver pair
aims to maximize its long-term average transmission rate subject to an average
power constraint. This scenario is modeled as a stochastic game under different
assumptions. We first assume that each transmitter and receiver has knowledge
of all direct and cross link channel gains. We later relax the assumption to
the knowledge of incident channel gains and then further relax to the knowledge
of the direct link channel gains only. In all the cases, we formulate the
problem of finding the Nash equilibrium as a variational inequality (VI)
problem and present an algorithm to solve the VI.
","[{'version': 'v1', 'created': 'Mon, 19 Jan 2015 07:20:43 GMT'}]",2015-01-20,"[['A', 'Krishna Chaitanya', ''], ['Muherji', 'Utpal', ''], ['Sharma', 'Vinod', '']]","['Interference channel', 'stochastic game', 'Nash equilibrium', 'distributed algorithms', 'variational inequality']"
19842,1702.00278,Hayati Mamur Asst. Prof.,"Hayati Mamur, Ismail Atacak, Fatih Korkmaz, M. R. Amin Bhuiyan","A level training set with both a computer-based control and a compact
  controller","16 Pages, 7 Figures, EMSA2017 DUBAI, 28-29 January 2017",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In engineering education, the combination with theoretical education and
practical education is an essential problem.
","[{'version': 'v1', 'created': 'Wed, 1 Feb 2017 14:34:41 GMT'}]",2017-02-02,"[['Mamur', 'Hayati', ''], ['Atacak', 'Ismail', ''], ['Korkmaz', 'Fatih', ''], ['Bhuiyan', 'M. R. Amin', '']]","['Computer aided engineering', 'Computer-based control', 'DSP-based control', 'Engineering education', 'Process control']"
19843,1704.08950,Amit Kumar,"Amit Kumar, Rahul Dutta, Harbhajan Rai",Intelligent Personal Assistant with Knowledge Navigation,Converted O(N3) solution to viable O(N) solution,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An Intelligent Personal Agent (IPA) is an agent that has the purpose of
helping the user to gain information through reliable resources with the help
of knowledge navigation techniques and saving time to search the best content.
The agent is also responsible for responding to the chat-based queries with the
help of Conversation Corpus. We will be testing different methods for optimal
query generation. To felicitate the ease of usage of the application, the agent
will be able to accept the input through Text (Keyboard), Voice (Speech
Recognition) and Server (Facebook) and output responses using the same method.
Existing chat bots reply by making changes in the input, but we will give
responses based on multiple SRT files. The model will learn using the human
dialogs dataset and will be able respond human-like. Responses to queries about
famous things (places, people, and words) can be provided using web scraping
which will enable the bot to have knowledge navigation features. The agent will
even learn from its past experiences supporting semi-supervised learning.
","[{'version': 'v1', 'created': 'Fri, 28 Apr 2017 14:26:12 GMT'}]",2017-05-01,"[['Kumar', 'Amit', ''], ['Dutta', 'Rahul', ''], ['Rai', 'Harbhajan', '']]","['NLTK', 'Turing Test', 'Lemmatization', 'Levenstein Distance', 'Conversation Semantics', 'Semi-Supervised Learning']"
19844,1110.1490,A S N Chakravarthy ASN CHAKRAVARTHY,"A. S. N. Chakravarthy, Penmetsa V. Krishna Raja, P. S Avadhani","A Novel Approach for Pass Word Authentication using Brain -State -In -A
  Box (BSB) Model",five pages,"International Journal of Computer Science and Information
  Technologies (IJCSIT), Volume 2 Issue 5 2011,2127-2131",,,cs.CR cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Authentication is the act of confirming the truth of an attribute of a datum
or entity. This might involve confirming the identity of a person, tracing the
origins of an artefact, ensuring that a product is what it's packaging and
labelling claims to be, or assuring that a computer program is a trusted one.
The authentication of information can pose special problems (especially
man-in-the-middle attacks), and is often wrapped up with authenticating
identity. Password authentication using Brain-State -In-A Box is presented in
this paper. Here in this paper we discuss Brain-State -In-A Box Scheme for
Textual and graphical passwords which will be converted in to probabilistic
values Password. We observe how to get password authentication Probabilistic
values for Text and Graphical image. This study proposes the use of a
Brain-State -In-A Box technique for password authentication. In comparison to
existing layered neural network techniques, the proposed method provides better
accuracy and quicker response time to registration and password changes.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2011 11:47:03 GMT'}]",2011-10-10,"[['Chakravarthy', 'A. S. N.', ''], ['Raja', 'Penmetsa V. Krishna', ''], ['Avadhani', 'P. S', '']]","['Authentication', 'Auto-associative model', 'Brain-State-InA-Box', 'Dynamic Associative Memories (DAM)']"
19845,0804.0946,Shripad Thite,Shripad Thite,Efficient Spacetime Meshing with Nonlocal Cone Constraints,"In Proceedings of the 13th International Meshing Roundtable (IMR),
  pages 47--58, September 19--22, 2004 (Williamsburg, VA)",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spacetime Discontinuous Galerkin (DG) methods are used to solve hyperbolic
PDEs describing wavelike physical phenomena. When the PDEs are nonlinear, the
speed of propagation of the phenomena, called the wavespeed, at any point in
the spacetime domain is computed as part of the solution. We give an advancing
front algorithm to construct a simplicial mesh of the spacetime domain suitable
for DG solutions. Given a simplicial mesh of a bounded linear or planar space
domain M, we incrementally construct a mesh of the spacetime domain M x
[0,infinity) such that the solution can be computed in constant time per
element. We add a patch of spacetime elements to the mesh at every step. The
boundary of every patch is causal which means that the elements in the patch
can be solved immediately and that the patches in the mesh are partially
ordered by dependence. The elements in a single patch are coupled because they
share implicit faces; however, the number of elements in each patch is bounded.
The main contribution of this paper is sufficient constraints on the progress
in time made by the algorithm at each step which guarantee that a new patch
with causal boundary can be added to the mesh at every step even when the
wavespeed is increasing discontinuously. Our algorithm adapts to the local
gradation of the space mesh as well as the wavespeed that most constrains
progress at each step. Previous algorithms have been restricted at each step by
the maximum wavespeed throughout the entire spacetime domain.
","[{'version': 'v1', 'created': 'Mon, 7 Apr 2008 01:26:39 GMT'}]",2008-04-08,"[['Thite', 'Shripad', '']]","['mesh generation', 'unstructured meshes', 'advancing front', 'partial differential equations', 'discontinuous Galerkin', 'nonlinear hyperbolic PDE']"
19846,1010.1834,Leo Liberti,"Leo Liberti, Benoit Masson, Jon Lee, Carlile Lavor, Antonio Mucherino","On the number of solutions of the discretizable molecular distance
  geometry problem","14 pages, 5 figures",,,,cs.DM cs.CG q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Generalized Discretizable Molecular Distance Geometry Problem is a
distance geometry problems that can be solved by a combinatorial algorithm
called ``Branch-and-Prune''. It was observed empirically that the number of
solutions of YES instances is always a power of two. We give a proof that this
event happens with probability one.
","[{'version': 'v1', 'created': 'Sat, 9 Oct 2010 10:53:07 GMT'}]",2010-10-12,"[['Liberti', 'Leo', ''], ['Masson', 'Benoit', ''], ['Lee', 'Jon', ''], ['Lavor', 'Carlile', ''], ['Mucherino', 'Antonio', '']]","['distance geometry', 'symmetry', 'Branch-andPrune', 'power of two']"
19847,1406.7438,Engin Bozdag,"Engin Bozdag, Qi Gao, Geert-Jan Houben, Martijn Warnier","Does Offline Political Segregation Affect the Filter Bubble? An
  Empirical Analysis of Information Diversity for Dutch and Turkish Twitter
  Users","Computers in Human Behavior, 2014",,,,cs.SI cs.CY physics.soc-ph,http://creativecommons.org/licenses/by/3.0/,"  From a liberal perspective, pluralism and viewpoint diversity are seen as a
necessary condition for a well-functioning democracy. Recently, there have been
claims that viewpoint diversity is diminishing in online social networks,
putting users in a ""bubble"", where they receive political information which
they agree with. The contributions from our investigations are fivefold: (1) we
introduce different dimensions of the highly complex value viewpoint diversity
using political theory; (2) we provide an overview of the metrics used in the
literature of viewpoint diversity analysis; (3) we operationalize new metrics
using the theory and provide a framework to analyze viewpoint diversity in
Twitter for different political cultures; (4) we share our results for a case
study on minorities we performed for Turkish and Dutch Twitter users; (5) we
show that minority users cannot reach a large percentage of Turkish Twitter
users. With the last of these contributions, using theory from communication
scholars and philosophers, we show how minority access is missing from the
typical dimensions of viewpoint diversity studied by computer scientists and
the impact it has on viewpoint diversity analysis.
","[{'version': 'v1', 'created': 'Sat, 28 Jun 2014 20:23:26 GMT'}]",2014-07-01,"[['Bozdag', 'Engin', ''], ['Gao', 'Qi', ''], ['Houben', 'Geert-Jan', ''], ['Warnier', 'Martijn', '']]","['Twitter', 'diversity', 'polarization', 'politics', 'Turkey', 'Netherlands']"
19848,1506.01060,Nan Zhou,"Nan Zhou, Yangyang Xu, Hong Cheng, Jun Fang, Witold Pedrycz","Global and Local Structure Preserving Sparse Subspace Learning: An
  Iterative Approach to Unsupervised Feature Selection","32 page, 6 figures and 60 references",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As we aim at alleviating the curse of high-dimensionality, subspace learning
is becoming more popular. Existing approaches use either information about
global or local structure of the data, and few studies simultaneously focus on
global and local structures as the both of them contain important information.
In this paper, we propose a global and local structure preserving sparse
subspace learning (GLoSS) model for unsupervised feature selection. The model
can simultaneously realize feature selection and subspace learning. In
addition, we develop a greedy algorithm to establish a generic combinatorial
model, and an iterative strategy based on an accelerated block coordinate
descent is used to solve the GLoSS problem. We also provide whole iterate
sequence convergence analysis of the proposed iterative algorithm. Extensive
experiments are conducted on real-world datasets to show the superiority of the
proposed approach over several state-of-the-art unsupervised feature selection
approaches.
","[{'version': 'v1', 'created': 'Tue, 2 Jun 2015 21:02:16 GMT'}, {'version': 'v2', 'created': 'Mon, 19 Oct 2015 18:13:24 GMT'}]",2015-10-20,"[['Zhou', 'Nan', ''], ['Xu', 'Yangyang', ''], ['Cheng', 'Hong', ''], ['Fang', 'Jun', ''], ['Pedrycz', 'Witold', '']]","['Machine learning', 'Feature selection', 'Subspace learning', 'Unsupervised learning']"
19849,1205.1670,Deepak Rajendraprasad,L. Sunil Chandran and Deepak Rajendraprasad,Rainbow Colouring of Split and Threshold Graphs,"15 pages, 3 figures, accepted for presentation at the 18th Annual
  International Computing and Combinatorics Conference (COCOON 2012)",,,,cs.DM cs.CC cs.DS math.CO,http://creativecommons.org/licenses/by/3.0/,"  A rainbow colouring of a connected graph is a colouring of the edges of the
graph, such that every pair of vertices is connected by at least one path in
which no two edges are coloured the same. Such a colouring using minimum
possible number of colours is called an optimal rainbow colouring, and the
minimum number of colours required is called the rainbow connection number of
the graph. In this article, we show the following:
  1. The problem of deciding whether a graph can be rainbow coloured using 3
colours remains NP-complete even when restricted to the class of split graphs.
However, any split graph can be rainbow coloured in linear time using at most
one more colour than the optimum.
  2. For every integer k larger than 2, the problem of deciding whether a graph
can be rainbow coloured using k colours remains NP-complete even when
restricted to the class of chordal graphs.
  3. For every positive integer k, threshold graphs with rainbow connection
number k can be characterised based on their degree sequence alone. Further, we
can optimally rainbow colour a threshold graph in linear time.
","[{'version': 'v1', 'created': 'Tue, 8 May 2012 12:25:19 GMT'}]",2012-05-09,"[['Chandran', 'L. Sunil', ''], ['Rajendraprasad', 'Deepak', '']]","['rainbow connectivity', 'rainbow colouring', 'threshold graphs', 'split graphs', 'chordal graphs', 'degree sequence', 'approximation', 'complexity']"
19850,1504.01771,Andrey Gushchin,"Andrey Gushchin, Anwar Walid, Ao Tang",Scalable Routing in SDN-enabled Networks with Consolidated Middleboxes,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Middleboxes are special network devices that perform various functions such
as enabling security and efficiency. SDN-based routing approaches in networks
with middleboxes need to address resource constraints, such as memory in the
switches and processing power of middleboxes, and traversal constraint where a
flow must visit the required middleboxes in a specific order. In this work we
propose a solution based on MultiPoint-To-Point Trees (MPTPT) for routing
traffic in SDN-enabled networks with consolidated middleboxes. We show both
theoretically and via simulations that our solution significantly reduces the
number of routing rules in the switches, while guaranteeing optimum throughput
and meeting processing requirements. Additionally, the underlying algorithm has
low complexity making it suitable in dynamic network environment.
","[{'version': 'v1', 'created': 'Tue, 7 Apr 2015 22:39:45 GMT'}]",2015-04-09,"[['Gushchin', 'Andrey', ''], ['Walid', 'Anwar', ''], ['Tang', 'Ao', '']]","['Software-Defined Networking', 'Middlebox', 'Multipointto-Point Tree', 'Traffic Engineering']"
19851,0712.2577,Maurice Margenstern,Margenstern Maurice,"Is the injectivity of the global function of a cellular automaton in the
  hyperbolic plane undecidable?","16 pages, 8 figures. A few words were missing in the initial version",,,,cs.DM cs.LO,,"  In this paper, we look at the following question. We consider cellular
automata in the hyperbolic plane and we consider the global function defined on
all possible configurations. Is the injectivity of this function undecidable?
The problem was answered positively in the case of the Euclidean plane by
Jarkko Kari, in 1994. In the present paper, we give a partial answer: when the
configurations are restricted to a certain condition, the problem is
undecidable.
","[{'version': 'v1', 'created': 'Sun, 16 Dec 2007 15:12:45 GMT'}, {'version': 'v2', 'created': 'Thu, 20 Dec 2007 08:33:17 GMT'}]",2007-12-20,"[['Maurice', 'Margenstern', '']]","['cellular automata', 'hyperbolic plane', 'tessellations']"
19852,1505.02642,Hamid Ebadi,"Hamid Ebadi, David Sands",Featherweight PINQ,,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Differentially private mechanisms enjoy a variety of composition properties.
Leveraging these, McSherry introduced PINQ (SIGMOD 2009), a system empowering
non-experts to construct new differentially private analyses. PINQ is an
LINQ-like API which provides automatic privacy guarantees for all programs
which use it to mediate sensitive data manipulation. In this work we introduce
featherweight PINQ, a formal model capturing the essence of PINQ. We prove that
any program interacting with featherweight PINQ's API is differentially
private.
","[{'version': 'v1', 'created': 'Mon, 11 May 2015 14:40:29 GMT'}]",2015-05-12,"[['Ebadi', 'Hamid', ''], ['Sands', 'David', '']]","['Differential privacy', 'dynamic database', 'PINQ', 'Formalization']"
19853,0707.0745,Richard McClatchey,"K. Munir, M. Odeh, R. McClatchey, S. Khan, I. Habib","Semantic Information Retrieval from Distributed Heterogeneous Data
  Sources","6 pages, 3 figures. Presented at the 4th International Workshop on
  Frontiers of Information Technology -- FIT 2006. Islamabad, Pakistan December
  2006",,,,cs.DB,,"  Information retrieval from distributed heterogeneous data sources remains a
challenging issue. As the number of data sources increases more intelligent
retrieval techniques, focusing on information content and semantics, are
required. Currently ontologies are being widely used for managing semantic
knowledge, especially in the field of bioinformatics. In this paper we describe
an ontology assisted system that allows users to query distributed
heterogeneous data sources by hiding details like location, information
structure, access pattern and semantic structure of the data. Our goal is to
provide an integrated view on biomedical information sources for the
Health-e-Child project with the aim to overcome the lack of sufficient
semantic-based reformulation techniques for querying distributed data sources.
In particular, this paper examines the problem of query reformulation across
biomedical data sources, based on merged ontologies and the underlying
heterogeneous descriptions of the respective data sources.
","[{'version': 'v1', 'created': 'Thu, 5 Jul 2007 09:40:19 GMT'}]",2007-07-06,"[['Munir', 'K.', ''], ['Odeh', 'M.', ''], ['McClatchey', 'R.', ''], ['Khan', 'S.', ''], ['Habib', 'I.', '']]","['Information Retrieval', 'Semantic Knowledge', 'Ontology', 'Query Reformulation']"
19854,1208.5569,Mohammad Doomun,"M. Razvi Doomun, K.M. Sunjiv Soyjaudah","Route Extrapolation for Source and Destination Camouflage in Wireless Ad
  Hoc Networks","7 pages, 19th International Conference on Computer Communications and
  Networks (ICCCN 2010), Zurich",,,,cs.NI cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In wireless ad hoc networks, protecting source and destination nodes location
privacy is a challenging task due to malicious traffic analysis and privacy
attacks. Existing solutions, such as incorporating fake source destination
pairs in the network, provide some privacy of real source and destination nodes
against attackers. Moreover, ad hoc networks need stronger privacy protection
against powerful global attacker which has knowledge of overall network
topology and, that can also eavesdrop and visualize network wide data
transmissions. In this paper, we present a novel privacy technique, (EXTROUT)
Route Extrapolation to camouflage the real source and destination nodes along
an extended path in an ad hoc network. We demonstrate that the privacy level
achieved with EXTROUT is higher and more effective against a global attacker,
when compared to fake source destination nodes privacy scheme.
","[{'version': 'v1', 'created': 'Tue, 28 Aug 2012 07:04:10 GMT'}]",2012-08-29,"[['Doomun', 'M. Razvi', ''], ['Soyjaudah', 'K. M. Sunjiv', '']]","['Privacy', 'anonymity', 'wireless ad hoc network', 'global attacker; route extrapolation']"
19855,1307.5691,Lucas Paletta,"Nicolas Riche, Matthieu Duvinage, Matei Mancas, Bernard Gosselin and
  Thierry Dutoit",A study of parameters affecting visual saliency assessment,,,,ISACS/2013/02,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since the early 2000s, computational visual saliency has been a very active
research area. Each year, more and more new models are published in the main
computer vision conferences. Nowadays, one of the big challenges is to find a
way to fairly evaluate all of these models. In this paper, a new framework is
proposed to assess models of visual saliency. This evaluation is divided into
three experiments leading to the proposition of a new evaluation framework.
Each experiment is based on a basic question: 1) there are two ground truths
for saliency evaluation: what are the differences between eye fixations and
manually segmented salient regions?, 2) the properties of the salient regions:
for example, do large, medium and small salient regions present different
difficulties for saliency models? and 3) the metrics used to assess saliency
models: what advantages would there be to mix them with PCA? Statistical
analysis is used here to answer each of these three questions.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2013 13:01:36 GMT'}]",2013-07-23,"[['Riche', 'Nicolas', ''], ['Duvinage', 'Matthieu', ''], ['Mancas', 'Matei', ''], ['Gosselin', 'Bernard', ''], ['Dutoit', 'Thierry', '']]","['Assessment', 'Fixation Ground Truth', 'Labelled Region GroundTruth', 'Saliency Map', 'Statistical Analysis', 'Visual Attention']"
19856,1712.02517,Simyung Chang,"Simyung Chang, John Yang, Seonguk Park, Nojun Kwak",Broadcasting Convolutional Network for Visual Relational Reasoning,Accepted paper at ECCV 2018. 24 pages,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose the Broadcasting Convolutional Network (BCN) that
extracts key object features from the global field of an entire input image and
recognizes their relationship with local features. BCN is a simple network
module that collects effective spatial features, embeds location information
and broadcasts them to the entire feature maps. We further introduce the
Multi-Relational Network (multiRN) that improves the existing Relation Network
(RN) by utilizing the BCN module. In pixel-based relation reasoning problems,
with the help of BCN, multiRN extends the concept of `pairwise relations' in
conventional RNs to `multiwise relations' by relating each object with multiple
objects at once. This yields in O(n) complexity for n objects, which is a vast
computational gain from RNs that take O(n^2). Through experiments, multiRN has
achieved a state-of-the-art performance on CLEVR dataset, which proves the
usability of BCN on relation reasoning problems.
","[{'version': 'v1', 'created': 'Thu, 7 Dec 2017 07:21:04 GMT'}, {'version': 'v2', 'created': 'Fri, 23 Mar 2018 07:36:48 GMT'}, {'version': 'v3', 'created': 'Fri, 24 Aug 2018 08:31:11 GMT'}]",2018-08-27,"[['Chang', 'Simyung', ''], ['Yang', 'John', ''], ['Park', 'Seonguk', ''], ['Kwak', 'Nojun', '']]","['Visual Relational Reasoning', 'BCN', 'Broadcast', 'CLEVR', 'Multi-RN', 'Visuo-spatial features']"
19857,1702.04211,Rosario Scatamacchia,"Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia","Dynamic programming algorithms, efficient solution of the LP-relaxation
  and approximation schemes for the Penalized Knapsack Problem",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the 0-1 Penalized Knapsack Problem (PKP). Each item has a profit,
a weight and a penalty and the goal is to maximize the sum of the profits minus
the greatest penalty value of the items included in a solution. We propose an
exact approach relying on a procedure which narrows the relevant range of
penalties, on the identification of a core problem and on dynamic programming.
The proposed approach turns out to be very effective in solving hard instances
of PKP and compares favorably both to commercial solver CPLEX 12.5 applied to
the ILP formulation of the problem and to the best available exact algorithm in
the literature. Then we present a general inapproximability result and
investigate several relevant special cases which permit fully polynomial time
approximation schemes (FPTASs).
","[{'version': 'v1', 'created': 'Tue, 14 Feb 2017 14:00:01 GMT'}]",2017-02-15,"[['Della Croce', 'Federico', ''], ['Pferschy', 'Ulrich', ''], ['Scatamacchia', 'Rosario', '']]","['Penalized Knapsack problem', 'Exact algorithm', 'DynamicProgramming', 'Approximation Schemes']"
19858,1701.06715,Xiaohao Cai,"Juheon Lee, David Coomes, Carola-Bibiane Schonlieb, Xiaohao Cai, Jan
  Lellmann, Michele Dalponte, Yadvinder Malhi, Nathalie Butt, Mike Morecroft","A graph cut approach to 3D tree delineation, using integrated airborne
  LiDAR and hyperspectral imagery",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recognising individual trees within remotely sensed imagery has important
applications in forest ecology and management. Several algorithms for tree
delineation have been suggested, mostly based on locating local maxima or
inverted basins in raster canopy height models (CHMs) derived from Light
Detection And Ranging (LiDAR) data or photographs. However, these algorithms
often lead to inaccurate estimates of forest stand characteristics due to the
limited information content of raster CHMs. Here we develop a 3D tree
delineation method which uses graph cut to delineate trees from the full 3D
LiDAR point cloud, and also makes use of any optical imagery available
(hyperspectral imagery in our case). First, conventional methods are used to
locate local maxima in the CHM and generate an initial map of trees. Second, a
graph is built from the LiDAR point cloud, fused with the hyperspectral data.
For computational efficiency, the feature space of hyperspectral imagery is
reduced using robust PCA. Third, a multi-class normalised cut is applied to the
graph, using the initial map of trees to constrain the number of clusters and
their locations. Finally, recursive normalised cut is used to subdivide, if
necessary, each of the clusters identified by the initial analysis. We call
this approach Multiclass Cut followed by Recursive Cut (MCRC). The
effectiveness of MCRC was tested using three datasets: i) NewFor, ii) a
coniferous forest in the Italian Alps, and iii) a deciduous woodland in the UK.
The performance of MCRC was usually superior to that of other delineation
methods, and was further improved by including high-resolution optical imagery.
Since MCRC delineates the entire LiDAR point cloud in 3D, it allows individual
crown characteristics to be measured. By making full use of the data available,
graph cut has the potential to considerably improve the accuracy of tree
delineation.
","[{'version': 'v1', 'created': 'Tue, 24 Jan 2017 02:41:30 GMT'}]",2017-01-25,"[['Lee', 'Juheon', ''], ['Coomes', 'David', ''], ['Schonlieb', 'Carola-Bibiane', ''], ['Cai', 'Xiaohao', ''], ['Lellmann', 'Jan', ''], ['Dalponte', 'Michele', ''], ['Malhi', 'Yadvinder', ''], ['Butt', 'Nathalie', ''], ['Morecroft', 'Mike', '']]","['Tree segmentation', 'remote sensing', 'LiDAR', 'hyperspectral image', 'optical imagery', 'normalised Cut']"
19859,1605.00863,Iain Stewart,Iain A. Stewart,On the Mathematics of Data Centre Network Topologies,35 pages,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The theory of combinatorial designs has recently been used in order to build
switch-centric data centre networks incorporating a large number of servers, in
comparison with the popular Fat-Tree data centre network. The construction
employed, called the 3-step method, revolves around an appropriately chosen
(but relatively small) bipartite graph and a transversal design. In this paper,
we clarify and extend these recent results. In particular, we prove the
following path diversity results: in a one-to-one context, we prove that in
these data centre networks there are pairwise link-disjoint paths joining all
the servers adjacent to some switch with all the servers adjacent to any other
switch so that we retain control of the path lengths (these results are optimal
in terms of the numbers of paths constructed and we prove that we have a wide
choice of bipartite graph and transversal design to which we can apply the
3-step method); and in a one-to-many context, we prove that there are pairwise
link-disjoint paths from all the servers adjacent to some switch to any
identically-sized collection of target servers where these target servers need
not be adjacent to the same switch (again, we keep control of the path
lengths). Our constructions and analysis are undertaken on bipartite graphs
with the applications to data centre networks being easily derived. Our results
strengthen the overall competitiveness of data centre networks constructed
using the 3-step method, in comparison with Fat-Tree data centre networks, and,
more generally, show the potential of results and methodologies from
combinatorics to data centre network design.
","[{'version': 'v1', 'created': 'Tue, 3 May 2016 12:21:07 GMT'}]",2016-05-04,"[['Stewart', 'Iain A.', '']]","['data centre networks', 'switch-centric data centre networks', 'Fat-Trees', 'combinatorial designs', 'bipartite graphs', 'path diversity']"
19860,1702.04249,Eduardo Soares,"Eduardo Soares, Pedro Brand\~ao, Rui Prior, Ana Aguiar",Experimentation with MANETs of Smartphones,"6 pages, 7 figures, 1 table",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile AdHoc NETworks (MANETs) have been identified as a key emerging
technology for scenarios in which IEEE 802.11 or cellular communications are
either infeasible, inefficient, or cost-ineffective. Smartphones are the most
adequate network nodes in many of these scenarios, but it is not
straightforward to build a network with them. We extensively survey existing
possibilities to build applications on top of ad-hoc smartphone networks for
experimentation purposes, and introduce a taxonomy to classify them. We present
AdHocDroid, an Android package that creates an IP-level MANET of (rooted)
Android smartphones, and make it publicly available to the community.
AdHocDroid supports standard TCP/IP applications, providing real smartphone
IEEE 802.11 MANET and the capability to easily change the routing protocol. We
tested our framework on several smartphones and a laptop. We validate the MANET
running off-the-shelf applications, and reporting on experimental performance
evaluation, including network metrics and battery discharge rate.
","[{'version': 'v1', 'created': 'Tue, 14 Feb 2017 14:59:09 GMT'}]",2017-02-15,"[['Soares', 'Eduardo', ''], ['Brandão', 'Pedro', ''], ['Prior', 'Rui', ''], ['Aguiar', 'Ana', '']]","['Ad-hoc networks', 'MANET', 'mesh networks', 'Android']"
19861,1109.6401,Frederic Dambreville,Frederic Dambreville (ENSIETA),"An Interpretation of Belief Functions by means of a Probabilistic
  Multi-modal Logic",,,,,cs.LO cs.AI math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While belief functions may be seen formally as a generalization of
probabilistic distributions, the question of the interactions between belief
functions and probability is still an issue in practice. This question is
difficult, since the contexts of use of these theory are notably different and
the semantics behind these theories are not exactly the same. A prominent issue
is increasingly regarded by the community, that is the management of the
conflicting information. Recent works have introduced new rules for handling
the conflict redistribution while combining belief functions. The notion of
conflict, or its cancellation by an hypothesis of open world, seems by itself
to prevent a direct interpretation of belief function in a probabilistic
framework. This paper addresses the question of a probabilistic interpretation
of belief functions. It first introduces and implements a theoretically
grounded rule, which is in essence an adaptive conjunctive rule. It is shown,
how this rule is derived from a logical interpretation of the belief functions
by means of a probabilistic multimodal logic; in addition, a concept of source
independence is introduced, based on a principle of entropy maximization.
","[{'version': 'v1', 'created': 'Thu, 29 Sep 2011 05:24:51 GMT'}]",2011-10-03,"[['Dambreville', 'Frederic', '', 'ENSIETA']]","['Belief Functions', 'Modal Logic', 'Probability', 'Entropy maximization']"
19862,1401.3357,Jean Gregoire,"Jean Gregoire and Emilio Frazzoli and Arnaud de La Fortelle and
  Tichakorn Wongpiromsarn",Back-pressure traffic signal control with unknown routing rates,"accepted for presentation at IFAC 2014, 6 pages. arXiv admin note:
  text overlap with arXiv:1309.6484",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The control of a network of signalized intersections is considered. Previous
works proposed a feedback control belonging to the family of the so-called
back-pressure controls that ensures provably maximum stability given
pre-specified routing probabilities. However, this optimal back-pressure
controller (BP*) requires routing rates and a measure of the number of vehicles
queuing at a node for each possible routing decision. It is an idealistic
assumption for our application since vehicles (going straight, turning
left/right) are all gathered in the same lane apart from the proximity of the
intersection and cameras can only give estimations of the aggregated queue
length. In this paper, we present a back-pressure traffic signal controller
(BP) that does not require routing rates, it requires only aggregated queue
lengths estimation (without direction information) and loop detectors at the
stop line for each possible direction. A theoretical result on the Lyapunov
drift in heavy load conditions under BP control is provided and tends to
indicate that BP should have good stability properties. Simulations confirm
this and show that BP stabilizes the queuing network in a significant part of
the capacity region.
","[{'version': 'v1', 'created': 'Mon, 9 Dec 2013 10:41:10 GMT'}, {'version': 'v2', 'created': 'Mon, 31 Mar 2014 13:48:02 GMT'}]",2014-04-01,"[['Gregoire', 'Jean', ''], ['Frazzoli', 'Emilio', ''], ['de La Fortelle', 'Arnaud', ''], ['Wongpiromsarn', 'Tichakorn', '']]","['road traffic', 'traffic lights', 'traffic control', 'transportation control', 'queuing theory', 'back-pressure', 'network control']"
19863,1004.0767,Secretary Aircc Journal,"Mohammed Aijaz Ahmed(1), D. Rajya Lakshmi(1), Sayed Abdul Sattar(2)
  ((1)GITAM University, Vishakapatnam,(2)J.N.T. University, Hyderabad)","Cryptanalysis of a more efficient and secure dynamic id-based remote
  user authentication scheme",6Pages,"International Journal of Network Security & Its Applications 1.3
  (2009) 32-37",,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In 2004, Das, Saxena and Gulati proposed a dynamic ID-based remote user
authentication scheme which has many advantage such as no verifier table, user
freedom to choose and change password and so on. However the subsequent papers
have shown that this scheme is completely insecure and vulnerable to many
attacks. Since then many schemes with improvements to Das et al's scheme has
been proposed but each has its pros and cons. Recently Yan-yan Wang et al. have
proposed a scheme to overcome security weaknesses of Das et al.'s scheme.
However this scheme too is vulnerable to various security attacks such as
password guessing attack, masquerading attack, denial of service attack.
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2010 03:58:42 GMT'}]",2010-07-15,"[['Ahmed', 'Mohammed Aijaz', '', 'GITAM University, Vishakapatnam'], ['Lakshmi', 'D. Rajya', '', 'GITAM University, Vishakapatnam'], ['Sattar', 'Sayed Abdul', '', 'J.N.T. University, Hyderabad']]","['Password', 'Authentication', 'Smartcard', 'Remote User', 'Masquerade Attack']"
19864,1410.5128,Abdul Razaque,"Abeer Alabass, Khaled Elleithy, and Abdul Razaque","Dynamic Cluster Head Node Election (DCHNE) Model over Wireless Sensor
  Networks (WSNs)","5 pages, 2 figures, In proceedings of 29th International Conference
  on Computers and Their Applications (CATA 2014), Las Vegas, Nevada, USA,24-26
  March 2014",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  WSNs are becoming an appealing research area due to their several application
domains. The performance of WSNs depends on the topology of sensors and their
ability to adapt to changes in the network. Sensor nodes are often resource
constrained by their limited power, less communication distance capacity, and
restricted sensing capability. Therefore, they need to cooperate with each
other to accomplish a specific task. Thus, clustering enables sensor nodes to
communicate through the cluster head node for continuous communication process.
In this paper, we introduce a dynamic cluster head election mechanism. Each
node in the cluster calculates its residual energy value to determine its
candidacy to become the Cluster Head Node (CHN). With this mechanism, each
sensor node compares its residual energy level to other nodes in the same
cluster. Depending on the residual energy level the sensor node acts as the
next cluster head. Evaluation of the dynamic CHN election mechanism is
conducted using network simulator-2 (ns2). The simulation results demonstrate
that the proposed approach prolongs the network lifetime and balancing the
energy
","[{'version': 'v1', 'created': 'Tue, 14 Oct 2014 03:43:24 GMT'}]",2014-10-21,"[['Alabass', 'Abeer', ''], ['Elleithy', 'Khaled', ''], ['Razaque', 'Abdul', '']]","['WSNs', 'Cluster head node', 'energy']"
19865,1206.0122,Jeremy Buisson,"Jean-Eudes M\'ehus (CREC), Thais Batista (DIMAP), J\'er\'emy Buisson
  (CREC, IRISA, UEB)","ACME vs PDDL: support for dynamic reconfiguration of software
  architectures","6\`eme \'edition de la Conf\'erence Francophone sur les Architectures
  Logicielles (CAL 2012), Montpellier : France (2012)",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  On the one hand, ACME is a language designed in the late 90s as an
interchange format for software architectures. The need for recon guration at
runtime has led to extend the language with speci c support in Plastik. On the
other hand, PDDL is a predicative language for the description of planning
problems. It has been designed in the AI community for the International
Planning Competition of the ICAPS conferences. Several related works have
already proposed to encode software architectures into PDDL. Existing planning
algorithms can then be used in order to generate automatically a plan that
updates an architecture to another one, i.e., the program of a recon guration.
In this paper, we improve the encoding in PDDL. Noticeably we propose how to
encode ADL types and constraints in the PDDL representation. That way, we can
statically check our design and express PDDL constraints in order to ensure
that the generated plan never goes through any bad or inconsistent
architecture, not even temporarily.
","[{'version': 'v1', 'created': 'Fri, 1 Jun 2012 08:19:16 GMT'}]",2012-06-04,"[['Méhus', 'Jean-Eudes', '', 'CREC'], ['Batista', 'Thais', '', 'DIMAP'], ['Buisson', 'Jérémy', '', 'CREC, IRISA, UEB']]","['dynamic reconfiguration', 'ACME', 'PDDL', 'planning', 'softwarearchitecture']"
19866,1007.1717,Petros Petrosyan,"R.R. Kamalian, P.A. Petrosyan",A note on interval edge-colorings of graphs,"4 pages, minor changes",,,,cs.DM,http://creativecommons.org/licenses/by/3.0/,"  An edge-coloring of a graph $G$ with colors $1,2,\ldots,t$ is called an
interval $t$-coloring if for each $i\in \{1,2,\ldots,t\}$ there is at least one
edge of $G$ colored by $i$, and the colors of edges incident to any vertex of
$G$ are distinct and form an interval of integers. In this paper we prove that
if a connected graph $G$ with $n$ vertices admits an interval $t$-coloring,
then $t\leq 2n-3$. We also show that if $G$ is a connected $r$-regular graph
with $n$ vertices has an interval $t$-coloring and $n\geq 2r+2$, then this
upper bound can be improved to $2n-5$.
","[{'version': 'v1', 'created': 'Sat, 10 Jul 2010 12:25:17 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Aug 2010 06:25:51 GMT'}]",2010-08-13,"[['Kamalian', 'R. R.', ''], ['Petrosyan', 'P. A.', '']]","['edge-coloring', 'interval coloring', 'bipartite graph', 'regular graph']"
19867,1511.05300,Shengli Li,"Shengli Li, Xichuan Zhou","Research of the Correlation between the H1N1 Morbidity Data and Google
  Trends in Egypt",,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The search engine based on influenza monitoring system has been widely
applied in many European and American countries. However, there are not any
correlative researches reported for African developing countries. Especially,
the countries Egypt has not designed an influenza monitoring system on the
basis of the Internet search data. This study aims at analyzing the correlation
between the Google search data and the H1N1 morbidity data of Egypt, and
examining the feasibility of Google Flu Model in predicting the H1N1 influenza
trend.
","[{'version': 'v1', 'created': 'Tue, 17 Nov 2015 07:55:35 GMT'}]",2015-11-18,"[['Li', 'Shengli', ''], ['Zhou', 'Xichuan', '']]","['Goolge Trends', 'Goolge Flu', 'H1N1 in Egypt', 'Correlation']"
19868,1504.08100,Matthias Keil,"Matthias Keil, Sankha Narayan Guria, Andreas Schlegel, Manuel Geffken,
  and Peter Thiemann",Transparent Object Proxies for JavaScript,Technical Report,,,,cs.PL,http://creativecommons.org/licenses/by/3.0/,"  Proxies are the swiss army knives of object adaptation. They introduce a
level of indirection to intercept select operations on a target object and
divert them as method calls to a handler. Proxies have many uses like
implementing access control, enforcing contracts, virtualizing resources.
  One important question in the design of a proxy API is whether a proxy object
should inherit the identity of its target. Apparently proxies should have their
own identity for security-related applications whereas other applications, in
particular contract systems, require transparent proxies that compare equal to
their target objects.
  We examine the issue with transparency in various use cases for proxies,
discuss different approaches to obtain transparency, and propose two designs
that require modest modifications in the JavaScript engine and cannot be
bypassed by the programmer.
  We implement our designs in the SpiderMonkey JavaScript interpreter and
bytecode compiler. Our evaluation shows that these modifications of have no
statistically significant impact on the benchmark performance of the JavaScript
engine. Furthermore, we demonstrate that contract systems based on wrappers
require transparent proxies to avoid interference with program execution in
realistic settings.
","[{'version': 'v1', 'created': 'Thu, 30 Apr 2015 07:20:13 GMT'}]",2015-05-01,"[['Keil', 'Matthias', ''], ['Guria', 'Sankha Narayan', ''], ['Schlegel', 'Andreas', ''], ['Geffken', 'Manuel', ''], ['Thiemann', 'Peter', '']]","['JavaScript', 'Proxies', 'Equality', 'Contracts']"
19869,1110.6143,Louis D'Alotto,Louis D'Alotto,Cellular Automata Using Infinite Computations,"Paper Accepted for Publication in Applied Mathematics and
  Computation, Elsevier",,,,cs.DM math.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an application of the Infinite Unit Axiom, introduced by
Yaroslav Sergeyev, (see [11] - [14]) to the development of one-dimensional
cellular automata. This application allows the establishment of a new and more
precise metric on the space of definition for one-dimensional cellular
automata, whereby accuracy of computations is increased. Using this new metric,
open disks are defined and the number of points in each disk is computed. The
forward dynamics of a cellular automaton map are also studied via defined
equivalence classes. Using the Infinite Unit Axiom, the number of
configurations that stay close to a given configuration under the shift
automaton map can now be computed.
","[{'version': 'v1', 'created': 'Thu, 27 Oct 2011 17:37:32 GMT'}]",2011-10-28,"[[""D'Alotto"", 'Louis', '']]","['cellular automata', 'Infinite Unit Axiom', 'grossone', 'metric', 'nonarchimedean metric']"
19870,1606.09002,Cong Yao,"Cong Yao, Xiang Bai, Nong Sang, Xinyu Zhou, Shuchang Zhou and Zhimin
  Cao","Scene Text Detection via Holistic, Multi-Channel Prediction","10 pages, 9 figures, 5 tables",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, scene text detection has become an active research topic in
computer vision and document analysis, because of its great importance and
significant challenge. However, vast majority of the existing methods detect
text within local regions, typically through extracting character, word or line
level candidates followed by candidate aggregation and false positive
elimination, which potentially exclude the effect of wide-scope and long-range
contextual cues in the scene. To take full advantage of the rich information
available in the whole natural image, we propose to localize text in a holistic
manner, by casting scene text detection as a semantic segmentation problem. The
proposed algorithm directly runs on full images and produces global, pixel-wise
prediction maps, in which detections are subsequently formed. To better make
use of the properties of text, three types of information regarding text
region, individual characters and their relationship are estimated, with a
single Fully Convolutional Network (FCN) model. With such predictions of text
properties, the proposed algorithm can simultaneously handle horizontal,
multi-oriented and curved text in real-world natural images. The experiments on
standard benchmarks, including ICDAR 2013, ICDAR 2015 and MSRA-TD500,
demonstrate that the proposed algorithm substantially outperforms previous
state-of-the-art approaches. Moreover, we report the first baseline result on
the recently-released, large-scale dataset COCO-Text.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2016 08:45:17 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Jul 2016 11:22:49 GMT'}]",2016-07-06,"[['Yao', 'Cong', ''], ['Bai', 'Xiang', ''], ['Sang', 'Nong', ''], ['Zhou', 'Xinyu', ''], ['Zhou', 'Shuchang', ''], ['Cao', 'Zhimin', '']]","['Scene text detection', 'fully convolutional network', 'holistic prediction', 'natural images']"
19871,1111.0337,Adrian Yanes,Adrian Yanes,OpenWeather: a peer-to-peer weather data transmission protocol,Available as well: http://lib.tkk.fi/Final_project/2011/urn100502.pdf,,,,cs.NI,http://creativecommons.org/licenses/publicdomain/,"  The study of the weather is performed using instruments termed weather
stations. These weather stations are distributed around the world, collecting
the data from the different phenomena. Several weather organizations have been
deploying thousands of these instruments, creating big networks to collect
weather data. These instruments are collecting the weather data and delivering
it for later processing in the collections points. Nevertheless, all the
methodologies used to transmit the weather data are based in protocols non
adapted for this purpose. Thus, the weather stations are limited by the data
formats and protocols used in them, not taking advantage of the real-time data
available on them. We research the weather instruments, their technology and
their network capabilities, in order to provide a solution for the mentioned
problem. OpenWeather is the protocol proposed to provide a more optimum and
reliable way to transmit the weather data. We evaluate the environmental
factors, such as location or bandwidth availability, in order to design a
protocol adapted to the requirements established by the automatic weather
stations. A peer to peer architecture is proposed, providing a functional
implementation of OpenWeather protocol. The evaluation of the protocol is
executed in a real scenario, providing the hints to adapt the protocol to a
common automatic weather station.
","[{'version': 'v1', 'created': 'Tue, 1 Nov 2011 23:02:45 GMT'}]",2011-11-03,"[['Yanes', 'Adrian', '']]","['P2P', 'peer to peer', 'weather stations', 'real-time', 'protocol standardization', 'embedded system', 'IETF', 'RFC']"
19872,1712.05727,Mark Scanlon,"Erwin van de Wiel, Mark Scanlon and Nhien-An Le-Khac","Network Intell: Enabling the Non-Expert Analysis of Large Volumes of
  Intercepted Network Traffic",,,,,cs.CR cs.NI,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  In criminal investigations, telecommunication wiretaps have become a common
technique used by law enforcement. While phone-based wiretapping is well
documented and the procedure for their execution are well known, the same
cannot be said for Internet taps. Lawfully intercepted network traffic often
contains a lot of encrypted traffic making it increasingly difficult to find
useful information inside the traffic captured. The advent of
Internet-of-Things further complicates the process for non-technical
investigators. The current level of complexity of intercepted network traffic
is close to a point where data cannot be analysed without supervision of a
digital investigator with advanced network knowledge. Current investigations
focus on analysing all traffic in a chronological manner and are predominately
conducted on the data contents of the intercepted traffic. This approach often
becomes overly arduous when the amount of data to be analysed becomes very
large. In this paper, we propose a novel approach to analyse large amounts of
intercepted network traffic based on network metadata. Our approach
significantly reduces the duration of the analysis and also produces an insight
view of analysing results for the non-technical investigator. We also test our
approach with a large sample of network traffic data.
","[{'version': 'v1', 'created': 'Fri, 15 Dec 2017 16:15:56 GMT'}, {'version': 'v2', 'created': 'Sat, 27 Jan 2018 09:53:19 GMT'}]",2018-01-30,"[['van de Wiel', 'Erwin', ''], ['Scanlon', 'Mark', ''], ['Le-Khac', 'Nhien-An', '']]","['Network Investigation', 'Big Data Forensics', 'Intercepted Network Traffic', 'Internet tap', 'Network Metadata Analysis', 'Non-Technical Investigator']"
19873,1304.3978,Manan Shah,"Manan D. Shah, Harshad B. Prajapati",Reallocation and Allocation of Virtual Machines in Cloud Computing,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing has given the new face to the distributed field. Two main
issues are discussed in this paper, (I) the process of finding the efficient
virtual machine by using the concept of load balancing algorithm. (II)
Reallocation of the Virtual Machines i.e. migration of the Virtual Machines
when cloud provider is not available with the required Virtual Machines. We
have discussed about the different load balancing algorithms which are used for
deciding the efficient Virtual Machine for the allocation to the client on
demand. While in the second issue is concern we have discuss about different
modules available for the migration of Virtual Machines from one source machine
to the other target machine. At last discussion about the different simulators
available for the cloud are carried out in this paper.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2013 05:02:16 GMT'}]",2013-04-16,"[['Shah', 'Manan D.', ''], ['Prajapati', 'Harshad B.', '']]","['CloudSim', 'Efficient VMs Allocation', 'Load Balancing Algorithm.      1']"
19874,1606.08968,Charith Perera,"Charith Perera, Athanasios V. Vasilakos",A Knowledge-Based Resource Discovery for Internet of Things,"Knowledge-Based Systems Journal 2016. arXiv admin note: substantial
  text overlap with arXiv:1309.1515, arXiv:1309.1811",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the sensing as a service paradigm, Internet of Things (IoT) Middleware
platforms allow data consumers to retrieve the data they want without knowing
the underlying technical details of IoT resources (i.e. sensors and data
processing components). However, configuring an IoT middleware platform and
retrieving data is a significant challenge for data consumers as it requires
both technical knowledge and domain expertise. In this paper, we propose a
knowledge driven approach called Context Aware Sensor Configuration Model
(CASCOM) to simplify the process of configuring IoT middleware platforms, so
the data consumers, specifically non-technical personnel, can easily retrieve
the data they required. In this paper, we demonstrate how IoT resources can be
described using semantics in such away that they can later be used to compose
service work-flows. Such automated semantic-knowledge based IoT resource
composition approach advances the current research. We demonstrate the
feasibility and the usability of our approach through a prototype
implementation based on an IoT middleware called Global Sensor Networks (GSN),
though our model can be generalized to any other middleware platform.
","[{'version': 'v1', 'created': 'Wed, 29 Jun 2016 06:27:33 GMT'}]",2016-06-30,"[['Perera', 'Charith', ''], ['Vasilakos', 'Athanasios V.', '']]","['Internet of Things', 'Middleware', 'Semantic Knowledge', 'IoT Resource Composition']"
19875,1707.08817,Mel Vecerik,"Mel Vecerik, Todd Hester, Jonathan Scholz, Fumin Wang, Olivier
  Pietquin, Bilal Piot, Nicolas Heess, Thomas Roth\""orl, Thomas Lampe, Martin
  Riedmiller","Leveraging Demonstrations for Deep Reinforcement Learning on Robotics
  Problems with Sparse Rewards",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a general and model-free approach for Reinforcement Learning (RL)
on real robotics with sparse rewards. We build upon the Deep Deterministic
Policy Gradient (DDPG) algorithm to use demonstrations. Both demonstrations and
actual interactions are used to fill a replay buffer and the sampling ratio
between demonstrations and transitions is automatically tuned via a prioritized
replay mechanism. Typically, carefully engineered shaping rewards are required
to enable the agents to efficiently explore on high dimensional control
problems such as robotics. They are also required for model-based acceleration
methods relying on local solvers such as iLQG (e.g. Guided Policy Search and
Normalized Advantage Function). The demonstrations replace the need for
carefully engineered rewards, and reduce the exploration problem encountered by
classical RL approaches in these domains. Demonstrations are collected by a
robot kinesthetically force-controlled by a human demonstrator. Results on four
simulated insertion tasks show that DDPG from demonstrations out-performs DDPG,
and does not require engineered rewards. Finally, we demonstrate the method on
a real robotics task consisting of inserting a clip (flexible object) into a
rigid object.
","[{'version': 'v1', 'created': 'Thu, 27 Jul 2017 11:16:53 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Oct 2018 13:38:52 GMT'}]",2018-10-09,"[['Vecerik', 'Mel', ''], ['Hester', 'Todd', ''], ['Scholz', 'Jonathan', ''], ['Wang', 'Fumin', ''], ['Pietquin', 'Olivier', ''], ['Piot', 'Bilal', ''], ['Heess', 'Nicolas', ''], ['Rothörl', 'Thomas', ''], ['Lampe', 'Thomas', ''], ['Riedmiller', 'Martin', '']]","['Demonstrations', 'Robot', 'Learning', 'Apprenticeship']"
19876,1610.04493,Kamal Hakimzadeh,"Shelan Perera, Ashansa Perera, Kamal Hakimzadeh","Reproducible Experiments for Comparing Apache Flink and Apache Spark on
  Public Clouds",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Big data processing is a hot topic in today's computer science world. There
is a significant demand for analysing big data to satisfy many requirements of
many industries. Emergence of the Kappa architecture created a strong
requirement for a highly capable and efficient data processing engine.
Therefore data processing engines such as Apache Flink and Apache Spark emerged
in open source world to fulfil that efficient and high performing data
processing requirement. There are many available benchmarks to evaluate those
two data processing engines. But complex deployment patterns and dependencies
make those benchmarks very difficult to reproduce by our own. This project has
two main goals. They are making few of community accepted benchmarks easily
reproducible on cloud and validate the performance claimed by those studies.
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2016 15:07:24 GMT'}]",2016-10-17,"[['Perera', 'Shelan', ''], ['Perera', 'Ashansa', ''], ['Hakimzadeh', 'Kamal', '']]","['Data Processing', 'Apache Flink', 'ApacheSpark', 'Batch processing', 'Stream processing', 'Reproducibleexperiments', 'Cloud']"
19877,1206.1187,Gleb Beliakov,"Gleb Beliakov, Michael Johnstone, Doug Creighton, Tim Wilkin",Parallel random variates generator for GPUs based on normal numbers,"preprint, 18 pages",,,,cs.MS cs.DC cs.NA math.NA math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pseudorandom number generators are required for many computational tasks,
such as stochastic modelling and simulation. This paper investigates the serial
CPU and parallel GPU implementation of a Linear Congruential Generator based on
the binary representation of the normal number $\alpha_{2,3}$. We adapted two
methods of modular reduction which allowed us to perform most operations in
64-bit integer arithmetic, improving on the original implementation based on
106-bit double-double operations. We found that our implementation is faster
than existing methods in literature, and our generation rate is close to the
limiting rate imposed by the efficiency of writing to a GPU's global memory.
","[{'version': 'v1', 'created': 'Wed, 6 Jun 2012 11:30:42 GMT'}, {'version': 'v2', 'created': 'Fri, 22 Jun 2012 04:42:05 GMT'}]",2012-06-25,"[['Beliakov', 'Gleb', ''], ['Johnstone', 'Michael', ''], ['Creighton', 'Doug', ''], ['Wilkin', 'Tim', '']]","['GPU', 'random number generation', 'normal numbers']"
19878,1002.3814,Michel Grabisch,Michel Grabisch (CES),The lattice of embedded subsets,,Discrete Applied Mathematics 158 (2010) 479-488,,,cs.DM cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In cooperative game theory, games in partition function form are real-valued
function on the set of so-called embedded coalitions, that is, pairs $(S,\pi)$
where $S$ is a subset (coalition) of the set $N$ of players, and $\pi$ is a
partition of $N$ containing $S$. Despite the fact that many studies have been
devoted to such games, surprisingly nobody clearly defined a structure (i.e.,
an order) on embedded coalitions, resulting in scattered and divergent works,
lacking unification and proper analysis. The aim of the paper is to fill this
gap, thus to study the structure of embedded coalitions (called here embedded
subsets), and the properties of games in partition function form.
","[{'version': 'v1', 'created': 'Fri, 19 Feb 2010 19:25:05 GMT'}]",2010-02-22,"[['Grabisch', 'Michel', '', 'CES']]","['partition', 'embedded subset', 'game', 'valuation', 'k-monotonicity']"
19879,1301.6011,D P Acharjya Ph.D,"B.K.Tripathy, D.P.Acharjya and V.Cynthya","A Framework for Intelligent Medical Diagnosis using Rough Set with
  Formal Concept Analysis",22 pages,"International Journal of Artificial Intelligence & Applications
  (IJAIA), Vol.2, No.2, April 2011",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Medical diagnosis process vary in the degree to which they attempt to deal
with different complicating aspects of diagnosis such as relative importance of
symptoms, varied symptom pattern and the relation between diseases them selves.
Based on decision theory, in the past many mathematical models such as crisp
set, probability distribution, fuzzy set, intuitionistic fuzzy set were
developed to deal with complicating aspects of diagnosis. But, many such models
are failed to include important aspects of the expert decisions. Therefore, an
effort has been made to process inconsistencies in data being considered by
Pawlak with the introduction of rough set theory. Though rough set has major
advantages over the other methods, but it generates too many rules that create
many difficulties while taking decisions. Therefore, it is essential to
minimize the decision rules. In this paper, we use two processes such as pre
process and post process to mine suitable rules and to explore the relationship
among the attributes. In pre process we use rough set theory to mine suitable
rules, whereas in post process we use formal concept analysis from these
suitable rules to explore better knowledge and most important factors affecting
the decision making.
","[{'version': 'v1', 'created': 'Fri, 25 Jan 2013 11:24:05 GMT'}]",2013-01-28,"[['Tripathy', 'B. K.', ''], ['Acharjya', 'D. P.', ''], ['Cynthya', 'V.', '']]","['Rough Sets', 'Formal Concept Analysis (FCA)', 'Information Table', 'Indiscernibility & Decision Rules']"
19880,1707.01342,Claudia Blaiotta,"Claudia Blaiotta, Patrick Freund, M. Jorge Cardoso, John Ashburner","Generative diffeomorphic atlas construction from brain and spinal cord
  MRI data",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we will focus on the potential and on the challenges associated
with the development of an integrated brain and spinal cord modelling framework
for processing MR neuroimaging data. The aim of the work is to explore how a
hierarchical generative model of imaging data, which captures simultaneously
the distribution of signal intensities and the variability of anatomical shapes
across a large population of subjects, can serve to quantitatively investigate,
in vivo, the morphology of the central nervous system (CNS). In fact, the
generality of the proposed Bayesian approach, which extends the hierarchical
structure of the segmentation method implemented in the SPM software, allows
processing simultaneously information relative to different compartments of the
CNS, namely the brain and the spinal cord, without having to resort to organ
specific solutions (e.g. tools optimised only for the brain, or only for the
spinal cord), which are inevitably harder to integrate and generalise.
","[{'version': 'v1', 'created': 'Wed, 5 Jul 2017 12:10:44 GMT'}]",2017-07-06,"[['Blaiotta', 'Claudia', ''], ['Freund', 'Patrick', ''], ['Cardoso', 'M. Jorge', ''], ['Ashburner', 'John', '']]","['Brain', 'Spinal cord', 'MRI', 'Atlas', 'Generative models', 'Segmentation']"
19881,1604.08878,Alexander Shibakov,Motoya Machida and Alexander Shibakov,Stack and register complexity of radix conversions,,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the question of computational resources (such as stacks and
counters) necessary to perform radix conversions. To this end it is shown that
no PDA can compute the significand of the best $n$-digit floating point
approximation of a power of an incommensurable radix. This extends the results
of W.~Clinger. We also prove that a two counter machine with input is capable
of such conversions. On the other hand we note a curious asymmetry with respect
to the order in which the digits are input by showing that a two counter
machine can decode its input online if the digits are presented in the
most-to-least significant order while no such machine can decode its input in
this manner if the digits are presented in the least-to-most significant order.
Some structural results about two counter machines (with input) are also
established.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2016 15:33:23 GMT'}]",2016-05-02,"[['Machida', 'Motoya', ''], ['Shibakov', 'Alexander', '']]","['floating point arithmetic', 'radix conversions', 'push-down automata', 'two counter machines']"
19882,1402.1811,"Martin F\""urer","Martin F\""urer",How Fast Can We Multiply Large Integers on an Actual Computer?,To appear in the proceedings of Latin 2014. Springer LNCS 8392,,,,cs.CC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We provide two complexity measures that can be used to measure the running
time of algorithms to compute multiplications of long integers. The random
access machine with unit or logarithmic cost is not adequate for measuring the
complexity of a task like multiplication of long integers. The Turing machine
is more useful here, but fails to take into account the multiplication
instruction for short integers, which is available on physical computing
devices. An interesting outcome is that the proposed refined complexity
measures do not rank the well known multiplication algorithms the same way as
the Turing machine model.
","[{'version': 'v1', 'created': 'Sat, 8 Feb 2014 02:47:25 GMT'}]",2014-02-11,"[['Fürer', 'Martin', '']]","['Integer multiplication', 'RAM models', 'FFT']"
19883,1702.07893,Facundo Memoli,"Patrizio Frosini, Claudia Landi, Facundo Memoli",The Persistent Homotopy Type Distance,"version 2: Extended dHT to vector-valued functions and reworked
  Section 5",,,,cs.CG math.AT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce the persistent homotopy type distance dHT to compare real valued
functions defined on possibly different homotopy equivalent topological spaces.
The underlying idea in the definition of dHT is to measure the minimal shift
that is necessary to apply to one of the two functions in order that the
sublevel sets of the two functions become homotopically equivalent. This
distance is interesting in connection with persistent homology. Indeed, our
main result states that dHT still provides an upper bound for the bottleneck
distance between the persistence diagrams of the intervening functions.
Moreover, because homotopy equivalences are weaker than homeomorphisms, this
implies a lifting of the standard stability results provided by the L-infty
distance and the natural pseudo-distance dNP. From a different standpoint, we
prove that dHT extends the L-infty distance and dNP in two ways. First, we show
that, appropriately restricting the category of objects to which dHT applies,
it can be made to coincide with the other two distances. Finally, we show that
dHT has an interpretation in terms of interleavings that naturally places it in
the family of distances used in persistence theory.
","[{'version': 'v1', 'created': 'Sat, 25 Feb 2017 13:55:53 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Mar 2018 16:15:19 GMT'}]",2018-03-06,"[['Frosini', 'Patrizio', ''], ['Landi', 'Claudia', ''], ['Memoli', 'Facundo', '']]","['bottleneck distance between persistence diagrams', 'natural pseudo-distance', 'interleaving distance', 'stability', 'merge trees']"
19884,1305.0203,Alon Schclar,Arik Nemtsov and Amir Averbuch and Alon Schclar,"Matrix Compression using the Nystro\""om Method","31 pages, 3 figures, submitted to Linear Algebra and its Applications",,,,cs.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Nystr\""{o}m method is routinely used for out-of-sample extension of
kernel matrices. We describe how this method can be applied to find the
singular value decomposition (SVD) of general matrices and the eigenvalue
decomposition (EVD) of square matrices. We take as an input a matrix $M\in
\mathbb{R}^{m\times n}$, a user defined integer $s\leq min(m,n)$ and $A_M \in
\mathbb{R}^{s\times s}$, a matrix sampled from the columns and rows of $M$.
These are used to construct an approximate rank-$s$ SVD of $M$ in
$O\left(s^2\left(m+n\right)\right)$ operations. If $M$ is square, the rank-$s$
EVD can be similarly constructed in $O\left(s^2 n\right)$ operations. Thus, the
matrix $A_M$ is a compressed version of $M$. We discuss the choice of $A_M$ and
propose an algorithm that selects a good initial sample for a pivoted version
of $M$. The proposed algorithm performs well for general matrices and kernel
matrices whose spectra exhibit fast decay.
","[{'version': 'v1', 'created': 'Wed, 1 May 2013 15:24:26 GMT'}]",2013-05-02,"[['Nemtsov', 'Arik', ''], ['Averbuch', 'Amir', ''], ['Schclar', 'Alon', '']]","['{Compression', 'SVD', 'EVD', 'Nystr¨om', 'out-of-sample extension}']"
19885,1206.2129,Davide Zordan,"Davide Zordan, Borja Martinez, Ignasi Vilajosana, Michele Rossi","To Compress or Not To Compress: Processing vs Transmission Tradeoffs for
  Energy Constrained Sensor Networking",,,,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the past few years, lossy compression has been widely applied in the field
of wireless sensor networks (WSN), where energy efficiency is a crucial concern
due to the constrained nature of the transmission devices. Often, the common
thinking among researchers and implementers is that compression is always a
good choice, because the major source of energy consumption in a sensor node
comes from the transmission of the data. Lossy compression is deemed a viable
solution as the imperfect reconstruction of the signal is often acceptable in
WSN. In this paper, we thoroughly review a number of lossy compression methods
from the literature, and analyze their performance in terms of compression
efficiency, computational complexity and energy consumption. We consider two
different scenarios, namely, wireless and underwater communications, and show
that signal compression may or may not help in the reduction of the overall
energy consumption, depending on factors such as the compression algorithm, the
signal statistics and the hardware characteristics, i.e., micro-controller and
transmission technology. The lesson that we have learned, is that signal
compression may in fact provide some energy savings. However, its usage should
be carefully evaluated, as in quite a few cases processing and transmission
costs are of the same order of magnitude, whereas, in some other cases, the
former may even dominate the latter. In this paper, we show quantitative
comparisons to assess these tradeoffs in the above mentioned scenarios.
Finally, we provide formulas, obtained through numerical fittings, to gauge
computational complexity, overall energy consumption and signal representation
accuracy for the best performing algorithms as a function of the most relevant
system parameters.
","[{'version': 'v1', 'created': 'Mon, 11 Jun 2012 08:41:47 GMT'}]",2012-06-12,"[['Zordan', 'Davide', ''], ['Martinez', 'Borja', ''], ['Vilajosana', 'Ignasi', ''], ['Rossi', 'Michele', '']]","['Wireless Sensor Networks', 'Underwater Sensor Networks', 'Lossy Data Compression', 'Temporal Data Compression', 'Computational Complexity', 'Performance Evaluation']"
19886,1005.2534,Jesus Martinez-Mateo,"Jes\'us Mart\'inez-Mateo, Susana Munoz-Hernandez and David P\'erez-Rey",A Discussion of Thin Client Technology for Computer Labs,,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer literacy is not negotiable for any professional in an increasingly
computerised environment. Educational institutions should be equipped to
provide this new basic training for modern life. Accordingly, computer labs are
an essential medium for education in almost any field. Computer labs are one of
the most popular IT infrastructures for technical training in primary and
secondary schools, universities and other educational institutions all over the
world. Unfortunately, a computer lab is expensive, in terms of both initial
purchase and annual maintenance costs, and especially when we want to run the
latest software. Hence, research efforts addressing computer lab efficiency,
performance or cost reduction would have a worldwide repercussion. In response
to this concern, this paper presents a survey on thin client technology for
computer labs in educational environments. Besides setting out the advantages
and drawbacks of this technology, we aim to refute false prejudices against
thin clients, identifying a set of educational scenarios where thin clients are
a better choice and others requiring traditional solutions.
","[{'version': 'v1', 'created': 'Fri, 14 May 2010 14:15:51 GMT'}]",2015-03-17,"[['Martínez-Mateo', 'Jesús', ''], ['Munoz-Hernandez', 'Susana', ''], ['Pérez-Rey', 'David', '']]","['thin client', 'e-learning', 'computer lab']"
19887,1603.06459,Nguyen Thi Thanh Dang,"Nguyen Thi Thanh Dang, Patrick De Causmaecker","Characterization of neighborhood behaviours in a multi-neighborhood
  local search algorithm",13 pages,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a multi-neighborhood local search algorithm with a large number
of possible neighborhoods. Each neighborhood is accompanied by a weight value
which represents the probability of being chosen at each iteration. These
weights are fixed before the algorithm runs, and are considered as parameters
of the algorithm. Given a set of instances, off-line tuning of the algorithm's
parameters can be done by automated algorithm configuration tools (e.g., SMAC).
However, the large number of neighborhoods can make the tuning expensive and
difficult even when the number of parameters has been reduced by some
intuition. In this work, we propose a systematic method to characterize each
neighborhood's behaviours, representing them as a feature vector, and using
cluster analysis to form similar groups of neighborhoods. The novelty of our
characterization method is the ability of reflecting changes of behaviours
according to hardness of different solution quality regions. We show that using
neighborhood clusters instead of individual neighborhoods helps to reduce the
parameter configuration space without misleading the search of the tuning
procedure. Moreover, this method is problem-independent and potentially can be
applied in similar contexts.
","[{'version': 'v1', 'created': 'Sat, 12 Mar 2016 12:38:32 GMT'}]",2016-03-22,"[['Dang', 'Nguyen Thi Thanh', ''], ['De Causmaecker', 'Patrick', '']]","['algorithm configuration', 'clustering', 'multi-neighborhood local search']"
19888,1007.3229,Pradeepa  BK,Pradeepa BK and Joy Kuri,"Aggregate Download Throughput for TCP-controlled long file transfers in
  a WLAN with multiple STA-AP association rates","Double columns, 3 pages, 3 figures, typos updated",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider several WLAN stations associated at rates r1, r2, ..., rk with an
Access Point. Each station is downloading a long file from a local server,
located on the LAN to which the AP is attached. We model these simultaneous
TCP-controlled transfers using a Markov Chain. Our analytical approach leads to
a procedure to compute aggregate download throughput numerically, and the
results match simulations very well.
","[{'version': 'v1', 'created': 'Mon, 19 Jul 2010 18:13:56 GMT'}, {'version': 'v2', 'created': 'Mon, 21 Feb 2011 03:32:08 GMT'}]",2011-02-22,"[['BK', 'Pradeepa', ''], ['Kuri', 'Joy', '']]","['WLAN', 'Association', 'Access Points', 'Infrastructure Mode']"
19889,1704.01687,Nathan Chadder,"Nathan Chadder, Antoine Deza",Computational determination of the largest lattice polytope diameter,,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A lattice (d, k)-polytope is the convex hull of a set of points in dimension
d whose coordinates are integers between 0 and k. Let {\delta}(d, k) be the
largest diameter over all lattice (d, k)-polytopes. We develop a computational
framework to determine {\delta}(d, k) for small instances. We show that
{\delta}(3, 4) = 7 and {\delta}(3, 5) = 9; that is, we verify for (d, k) = (3,
4) and (3, 5) the conjecture whereby {\delta}(d, k) is at most (k + 1)d/2 and
is achieved, up to translation, by a Minkowski sum of lattice vectors.
","[{'version': 'v1', 'created': 'Thu, 6 Apr 2017 02:02:25 GMT'}]",2017-04-07,"[['Chadder', 'Nathan', ''], ['Deza', 'Antoine', '']]","['Lattice polytopes', 'edge-graph diameter', 'enumeration algorithm']"
19890,0711.0694,Bruno Scherrer,Bruno Scherrer (INRIA Lorraine - LORIA),"Performance Bounds for Lambda Policy Iteration and Application to the
  Game of Tetris",No. RR-6348 (2011),,,,cs.AI cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the discrete-time infinite-horizon optimal control problem
formalized by Markov Decision Processes. We revisit the work of Bertsekas and
Ioffe, that introduced $\lambda$ Policy Iteration, a family of algorithms
parameterized by $\lambda$ that generalizes the standard algorithms Value
Iteration and Policy Iteration, and has some deep connections with the Temporal
Differences algorithm TD($\lambda$) described by Sutton and Barto. We deepen
the original theory developped by the authors by providing convergence rate
bounds which generalize standard bounds for Value Iteration described for
instance by Puterman. Then, the main contribution of this paper is to develop
the theory of this algorithm when it is used in an approximate form and show
that this is sound. Doing so, we extend and unify the separate analyses
developped by Munos for Approximate Value Iteration and Approximate Policy
Iteration. Eventually, we revisit the use of this algorithm in the training of
a Tetris playing controller as originally done by Bertsekas and Ioffe. We
provide an original performance bound that can be applied to such an
undiscounted control problem. Our empirical results are different from those of
Bertsekas and Ioffe (which were originally qualified as ""paradoxical"" and
""intriguing""), and much more conform to what one would expect from a learning
experiment. We discuss the possible reason for such a difference.
","[{'version': 'v1', 'created': 'Mon, 5 Nov 2007 17:07:22 GMT'}, {'version': 'v2', 'created': 'Fri, 9 Nov 2007 15:46:43 GMT'}, {'version': 'v3', 'created': 'Tue, 13 Nov 2007 12:34:37 GMT'}, {'version': 'v4', 'created': 'Mon, 3 Oct 2011 11:58:38 GMT'}, {'version': 'v5', 'created': 'Tue, 11 Oct 2011 12:42:24 GMT'}]",2015-03-13,"[['Scherrer', 'Bruno', '', 'INRIA Lorraine - LORIA']]","['Stochastic Optimal Control', 'Reinforcement Learning', 'Markov Decision Processes', 'Analysis of Algorithms', 'Performance Bounds']"
19891,1704.07895,Navid Akar,"Navid Akar, Hossein Lotfizadeh","A New Integrated FQFD Approach for Improving Quality and Reliability of
  Solar Drying Systems",,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Saffron is the most expensive spice and is significantly valuable in non-oil
export. Drying process of saffron is considered as a critical control point
with major effects on quality and safety parameters. A suitable drying method
covering standards and market requirements while it is costlty benefitial and
saves energy is desirable. Solar drying could be introduced as an appropriate
procedure in rural and collecting sites of saffron since major micorobial and
chemical factors of saffron can be preserved and achieved by using a renewable
energy source. So, a precise system taking advantage of management, engineering
and food technology sciences could be developed. Since there was no published
record of integrated methods of Analytical Hierarchy Process (AHP) and Fuzzy
Quality Function Deployment (FQFD) applied to solar energy drying systems, in
this paper, Fuzzy Quality Function Deployment as a quality management tool by
emphasizing technical and customer requirements has been implemented in order
to improve quality parameters, optimizing technological expenses and market
expansion strategy. Subsequently, Analytical Hierarchy Process based on survey
from customers and logical pair-wise comparison are employed to decrease costs
and increase the efficiency and the effectiveness of economic indicators. Using
the integrated approach of AHP and FQFD in solar drying systems in saffron
industry will result in cost benefit, quality improvement, the customer
satisfaction enhancement, and the increase in saffron exports.
","[{'version': 'v1', 'created': 'Fri, 21 Apr 2017 07:44:05 GMT'}]",2017-04-27,"[['Akar', 'Navid', ''], ['Lotfizadeh', 'Hossein', '']]","['Solar Energy Drying System', 'Saffron', 'Analytical Hierarchy Process (AHP)', 'Fuzzy Quality Function Deployment (FQFD)   Introduction']"
19892,1306.6198,Augusto Santos J. A.,"Augusto Santos, Jos\'e M. F. Moura, and Jo\~ao Xavier",Emergent Behavior in Multipartite Large Networks: Multi-virus Epidemics,"27 pages, submitted to IEEE Transactions on Information Theory",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Epidemics in large complete networks is well established. In contrast, we
consider epidemics in non-complete networks. We establish the fluid limit
macroscopic dynamics of a multi-virus spread over a multipartite network as the
number of nodes at each partite or island grows large. The virus spread follows
a peer-to-peer random rule of infection in line with the Harris contact
process. The model conforms to an SIS (susceptible-infected-susceptible) type,
where a node is either infected or it is healthy and prone to be infected. The
local (at node level) random infection model induces the emergence of
structured dynamics at the macroscale. Namely, we prove that, as the
multipartite network grows large, the normalized Markov jump vector process
$\left(\bar{\mathbf{Y}}^\mathbf{N}(t)\right) =
\left(\bar{Y}_1^\mathbf{N}(t),\ldots, \bar{Y}_M^\mathbf{N}(t)\right)$
collecting the fraction of infected nodes at each island $i=1,\ldots,M$,
converges weakly (with respect to the Skorokhod topology on the space of
\emph{c\`{a}dl\`{a}g} sample paths) to the solution of an $M$-dimensional
vector nonlinear coupled ordinary differential equation. In the case of
multi-virus diffusion with $K\in\mathbb{N}$ distinct strains of virus, the
Markov jurmp matrix process $\left(\bar{\mathbf{Y}}^\mathbf{N}(t)\right)$,
stacking the fraction of nodes infected with virus type $j$, $j=1,\ldots,K$, at
each island $i=1,\ldots,M$, converges weakly as well to the solution of a
$\left(K\times M\right)$-dimensional vector differential equation that is also
characterized.
","[{'version': 'v1', 'created': 'Wed, 26 Jun 2013 10:56:51 GMT'}]",2013-06-27,"[['Santos', 'Augusto', ''], ['Moura', 'José M. F.', ''], ['Xavier', 'João', '']]","['Emergent behavior', 'Epidemics', 'Multipartite interacting agents', 'Exact mean field']"
19893,0908.0981,R Doomun,"Syed S. Rizvi, and Khaled M. Elleithy","A New Scheme for Minimizing Malicious Behavior of Mobile Nodes in Mobile
  Ad Hoc Networks","10 pages IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS July 2009, ISSN 1947 5500, Impact Factor 0.423","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 3, No. 1, July 2009, USA",,ISSN 1947 5500,cs.CR cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The performance of Mobile Ad hoc networks (MANET) depends on the cooperation
of all active nodes. However, supporting a MANET is a cost-intensive activity
for a mobile node. From a single mobile node perspective, the detection of
routes as well as forwarding packets consume local CPU time, memory,
network-bandwidth, and last but not least energy. We believe that this is one
of the main factors that strongly motivate a mobile node to deny packet
forwarding for others, while at the same time use their services to deliver its
own data. This behavior of an independent mobile node is commonly known as
misbehaving or selfishness. A vast amount of research has already been done for
minimizing malicious behavior of mobile nodes. However, most of them focused on
the methods/techniques/algorithms to remove such nodes from the MANET. We
believe that the frequent elimination of such miss-behaving nodes never allowed
a free and faster growth of MANET. This paper provides a critical analysis of
the recent research wok and its impact on the overall performance of a MANET.
In this paper, we clarify some of the misconceptions in the understating of
selfishness and miss-behavior of nodes. Moreover, we propose a mathematical
model that based on the time division technique to minimize the malicious
behavior of mobile nodes by avoiding unnecessary elimination of bad nodes. Our
proposed approach not only improves the resource sharing but also creates a
consistent trust and cooperation (CTC) environment among the mobile nodes. The
simulation results demonstrate the success of the proposed approach that
significantly minimizes the malicious nodes and consequently maximizes the
overall throughput of MANET than other well known schemes.
","[{'version': 'v1', 'created': 'Fri, 7 Aug 2009 04:33:50 GMT'}, {'version': 'v2', 'created': 'Sun, 9 Aug 2009 07:01:54 GMT'}]",2009-08-10,"[['Rizvi', 'Syed S.', ''], ['Elleithy', 'Khaled M.', '']]","['channel capacity', 'mobile nodes', 'MANET', 'throughput analysis']"
19894,1507.01162,Haibo Hong,"Haibo Hong, Licheng Wang, Haseeb Ahmad, Jing Li, Yixian Yang",Minimal Logarithmic Signatures for Sporadic Groups,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As a special type of factorization of finite groups, logarithmic signature
(LS) is used as the main component of cryptographic keys for secret key
cryptosystems such as PGM and public key cryptosystems like MST1, MST2 and
MST3. An LS with the shortest length is called a minimal logarithmic signature
(MLS) and is even desirable for cryptographic constructions. The MLS conjecture
states that every finite simple group has an MLS. Until now, the MLS conjecture
has been proved true for some families of simple groups. In this paper, we will
prove the existence of minimal logarithmic signatures for some sporadic groups.
","[{'version': 'v1', 'created': 'Sun, 5 Jul 2015 02:32:14 GMT'}]",2015-07-07,"[['Hong', 'Haibo', ''], ['Wang', 'Licheng', ''], ['Ahmad', 'Haseeb', ''], ['Li', 'Jing', ''], ['Yang', 'Yixian', '']]","['Sporadic groups', '(Minimal) logarithmic signature', 'Stabilizer', 'Solvable groups']"
19895,1403.7625,Haris Aziz,Haris Aziz,Testing Top Monotonicity,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Top monotonicity is a relaxation of various well-known domain restrictions
such as single-peaked and single-crossing for which negative impossibility
results are circumvented and for which the median-voter theorem still holds. We
examine the problem of testing top monotonicity and present a characterization
of top monotonicity with respect to non-betweenness constraints. We then extend
the definition of top monotonicity to partial orders and show that testing top
monotonicity of partial orders is NP-complete.
","[{'version': 'v1', 'created': 'Sat, 29 Mar 2014 11:51:07 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Apr 2014 17:38:24 GMT'}, {'version': 'v3', 'created': 'Tue, 22 Apr 2014 00:54:25 GMT'}, {'version': 'v4', 'created': 'Sun, 27 Apr 2014 10:49:17 GMT'}, {'version': 'v5', 'created': 'Sun, 1 Jun 2014 01:46:35 GMT'}]",2014-06-03,"[['Aziz', 'Haris', '']]","['Social choice theory', 'domain restrictions', 'top monotonicity', 'singlepeaked', 'single crossing', 'computational complexity']"
19896,1407.3193,Awais Mansoor,"Awais Mansoor, Ulas Bagci, Daniel J. Mollura",Optimally Stabilized PET Image Denoising Using Trilateral Filtering,"8 pages, 3 figures; to appear in the Lecture Notes in Computer
  Science (MICCAI 2014)",,,,cs.CV,http://creativecommons.org/licenses/publicdomain/,"  Low-resolution and signal-dependent noise distribution in positron emission
tomography (PET) images makes denoising process an inevitable step prior to
qualitative and quantitative image analysis tasks. Conventional PET denoising
methods either over-smooth small-sized structures due to resolution limitation
or make incorrect assumptions about the noise characteristics. Therefore,
clinically important quantitative information may be corrupted. To address
these challenges, we introduced a novel approach to remove signal-dependent
noise in the PET images where the noise distribution was considered as
Poisson-Gaussian mixed. Meanwhile, the generalized Anscombe's transformation
(GAT) was used to stabilize varying nature of the PET noise. Other than noise
stabilization, it is also desirable for the noise removal filter to preserve
the boundaries of the structures while smoothing the noisy regions. Indeed, it
is important to avoid significant loss of quantitative information such as
standard uptake value (SUV)-based metrics as well as metabolic lesion volume.
To satisfy all these properties, we extended bilateral filtering method into
trilateral filtering through multiscaling and optimal Gaussianization process.
The proposed method was tested on more than 50 PET-CT images from various
patients having different cancers and achieved the superior performance
compared to the widely used denoising techniques in the literature.
","[{'version': 'v1', 'created': 'Fri, 11 Jul 2014 15:08:18 GMT'}]",2014-07-14,"[['Mansoor', 'Awais', ''], ['Bagci', 'Ulas', ''], ['Mollura', 'Daniel J.', '']]","['Positron emission tomography', 'trilateral filtering', 'generalized variance stabilizing transformation', 'denoising']"
19897,1510.08505,Guanghua Chi,"Guanghua Chi, Yu Liu, Zhengwei Wu, Haishan Wu",Ghost Cities Analysis Based on Positioning Data in China,"added references for Case Study; corrected typos; revised argument in
  Introduction; added a sentence to explain the second-tier and third tier
  cities in Result; added two sentences to introduce the background of the
  study in Conclusion; added two people in the Acknowledgements; added a
  coauthor for his contribution in designing the algorithms of home-work
  detection and migration calculation",,,,cs.SI cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real estate projects are developed excessively in China in this decade. Many
new housing districts are built, but they far exceed the actual demand in some
cities. These cities with a high housing vacancy rate are called ghost cities.
The real situation of vacant housing areas in China has not been studied in
previous research. This study, using Baidu positioning data, presents the
spatial distribution of the vacant housing areas in China and classifies cities
with a large vacant housing area as cities or tourism sites. To the best of our
knowledge, it is the first time that we detected and analyzed the ghost cities
in China at such fine scale. To understand the human dynamic in ghost cities,
we select one city and one tourism sites as cases to analyze the features of
human dynamics. This study illustrates the capability of big data in sensing
our cities objectively and comprehensively.
","[{'version': 'v1', 'created': 'Wed, 28 Oct 2015 21:51:51 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Nov 2015 03:23:41 GMT'}]",2015-11-29,"[['Chi', 'Guanghua', ''], ['Liu', 'Yu', ''], ['Wu', 'Zhengwei', ''], ['Wu', 'Haishan', '']]","['Ghost\t c \xa0City', 'Real\t c \xa0Estate', 'Big\t c \xa0Data', 'Vacant\t c \xa0Housing\t c \xa0Area\t c \xa0\t c \xa0Introduction']"
19898,1205.3336,Antonio J. Tall\'on-Ballesteros,"A.J. Tall\'on-Ballesteros, P.A. Guti\'errez-Pe\~na, C.
  Herv\'as-Mart\'inez","Distribution of the search of evolutionary product unit neural networks
  for classification","8 pages, 2 figures, in Proc. IADIS International Conference Applied
  Computing 2007 (AC 2007), ISBN 978-972-8924-30-0, pp. 266-273, Spain. Note:
  ""This is a reprint from a paper published in the Proceedings of the IADIS
  International Conference Applied Comupting 2007, http://www.iadis.org""",,,,cs.NE cs.AI cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with the distributed processing in the search for an optimum
classification model using evolutionary product unit neural networks. For this
distributed search we used a cluster of computers. Our objective is to obtain a
more efficient design than those net architectures which do not use a
distributed process and which thus result in simpler designs. In order to get
the best classification models we use evolutionary algorithms to train and
design neural networks, which require a very time consuming computation. The
reasons behind the need for this distribution are various. It is complicated to
train this type of nets because of the difficulty entailed in determining their
architecture due to the complex error surface. On the other hand, the use of
evolutionary algorithms involves running a great number of tests with different
seeds and parameters, thus resulting in a high computational cost
","[{'version': 'v1', 'created': 'Tue, 15 May 2012 11:51:02 GMT'}]",2012-05-16,"[['Tallón-Ballesteros', 'A. J.', ''], ['Gutiérrez-Peña', 'P. A.', ''], ['Hervás-Martínez', 'C.', '']]","['Neural networks', 'product units', 'classification', 'distributed processing', 'evolutionary algorithms']"
19899,1505.04142,Andr\'es Burgos,"Andres C. Burgos, Daniel Polani","An informational study of the evolution of codes and of emerging
  concepts in populations of agents",Accepted in Artificial Life Journal,,,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the problem of the evolution of a code within a structured
population of agents. The agents try to maximise their information about their
environment by acquiring information from the outputs of other agents in the
population. A naive use of information-theoretic methods would assume that
every agent knows how to ""interpret"" the information offered by other agents.
However, this assumes that one ""knows"" which other agents one observes, and
thus which code they use. In our model, however, we wish to preclude that: it
is not clear which other agents an agent is observing, and the resulting usable
information is therefore influenced by the universality of the code used and by
which agents an agent is ""listening"" to. We further investigate whether an
agent who does not directly perceive the environment can distinguish states by
observing other agents' outputs. For this purpose, we consider a population of
different types of agents ""talking"" about different concepts, and try to
extract new ones by considering their outputs only.
","[{'version': 'v1', 'created': 'Fri, 15 May 2015 18:03:53 GMT'}]",2015-05-18,"[['Burgos', 'Andres C.', ''], ['Polani', 'Daniel', '']]","['information theory', 'code evolution', 'semantics', 'emerging concepts']"
19900,1401.2411,L. Thorne McCarty,L. Thorne McCarty,"Clustering, Coding, and the Concept of Similarity","Revised and expanded in response to referee reports. Current version:
  65 pages, 18 figures",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper develops a theory of clustering and coding which combines a
geometric model with a probabilistic model in a principled way. The geometric
model is a Riemannian manifold with a Riemannian metric, ${g}_{ij}({\bf x})$,
which we interpret as a measure of dissimilarity. The probabilistic model
consists of a stochastic process with an invariant probability measure which
matches the density of the sample input data. The link between the two models
is a potential function, $U({\bf x})$, and its gradient, $\nabla U({\bf x})$.
We use the gradient to define the dissimilarity metric, which guarantees that
our measure of dissimilarity will depend on the probability measure. Finally,
we use the dissimilarity metric to define a coordinate system on the embedded
Riemannian manifold, which gives us a low-dimensional encoding of our original
data.
","[{'version': 'v1', 'created': 'Fri, 10 Jan 2014 17:36:23 GMT'}, {'version': 'v2', 'created': 'Wed, 16 May 2018 13:16:05 GMT'}]",2018-05-17,"[['McCarty', 'L. Thorne', '']]","['clustering', 'prototype coding', 'manifoldlearning', 'dimensionality reduction', 'dissimilarity metric']"
19901,1306.0195,Prateek Dewan,"Prateek Dewan, Niharika Sachdeva, Mayank Gupta, Ponnurangam Kumaraguru","ChaMAILeon: Exploring the Usability of a Privacy Preserving Email
  Sharing System",12 pages without references and appendices,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While passwords, by definition, are meant to be secret, recent trends have
witnessed an increasing number of people sharing their email passwords with
friends, colleagues, and significant others. However, leading websites like
Google advise their users not to share their passwords with anyone, to avoid
security and privacy breaches. To understand users' general password sharing
behavior and practices, we conducted an online survey with 209 Indian
participants and found that 64.35% of the participants felt a need to share
their email passwords. Further, about 77% of the participants said that they
would want to use a system which could provide them access control features, to
maintain their privacy while sharing emails. To address the privacy concerns of
users who need to share emails, we propose ChaMAILeon, a system which enables
users to share their email passwords while maintaining their privacy.
ChaMAILeon allows users to create multiple passwords for their email account.
Each such password corresponds to a different set of access control rules, and
gives a different view of the same email account. We conducted a controlled
experiment with 30 participants to evaluate the usability of the system. Each
participant was required to perform 5 tasks. Each task corresponded to
different access control rules, which the participant was required to set, for
a dummy email account. We found that, with a reasonable number of multiple
attempts, all 30 participants were able to perform all 5 tasks given to them.
The system usability score was found out to be 75.42. Moreover, 56.6% of the
participants said that they would like to use ChaMAILeon frequently.
","[{'version': 'v1', 'created': 'Sun, 2 Jun 2013 11:23:27 GMT'}]",2013-06-04,"[['Dewan', 'Prateek', ''], ['Sachdeva', 'Niharika', ''], ['Gupta', 'Mayank', ''], ['Kumaraguru', 'Ponnurangam', '']]","['Email', 'usable security', 'password']"
19902,0711.3290,EDA Publishing Association,"O. Fran\c{c}ais, M.-C. Jullien (SATIE), L. Rousseau (ESYCOM-Esiee), P.
  Poulichet (ESYCOM-Esiee), S. Desportes (PPSM), A. Chouai (PPSM), J.-P.
  Lefevre (PPSM), J. Delaire (PPSM)","An Active Chaotic Micromixer Integrating Thermal Actuation Associating
  PDMS and Silicon Microtechnology","Submitted on behalf of TIMA Editions
  (http://irevues.inist.fr/tima-editions)","Dans Symposium on Design, Test, Integration and Packaging of
  MEMS/MOEMS - DTIP 2006, Stresa, Lago Maggiore : Italie (2006)",,,cs.OH,,"  Due to scaling laws, in microfluidic, flows are laminar. Consequently, mixing
between two liquids is mainly obtained by natural diffusion which may take a
long time or equivalently requires centimetre length channels. To reduce time
and length for mixing, it is possible to generate chaotic-like flows either by
modifying the channel geometry or by creating an external perturbation of the
flow. In this paper, an active micromixer is presented consisting on thermal
actuation with heating resistors. In order to disturb the liquid flow, an
oscillating transverse flow is generated by heating the liquid. Depending on
the value of boiling point, either bubble expansion or volumetric dilation
controlled the transverse flow amplitude. A chaotic like mixing is then induced
under particular conditions depending on volume expansion, liquid velocity,
frequency of actuation... This solution presents the advantage to achieve
mixing in a very short time (1s) and along a short channel distance (channel
width). It can also be integrated in a more complex device due to actuator
integration with microfluidics.
","[{'version': 'v1', 'created': 'Wed, 21 Nov 2007 09:34:28 GMT'}]",2007-11-29,"[['Français', 'O.', '', 'SATIE'], ['Jullien', 'M. -C.', '', 'SATIE'], ['Rousseau', 'L.', '', 'ESYCOM-Esiee'], ['Poulichet', 'P.', '', 'ESYCOM-Esiee'], ['Desportes', 'S.', '', 'PPSM'], ['Chouai', 'A.', '', 'PPSM'], ['Lefevre', 'J. -P.', '', 'PPSM'], ['Delaire', 'J.', '', 'PPSM']]","['Active micromixer', 'PDMS', 'Microheater', 'Chaotic effects', 'Microfluidic']"
19903,1507.01631,Christos Pelekis,Christos Pelekis,A generalised isodiametric problem,"15 pages, 1 figure, Minor typos corrected",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fix positive integers $a$ and $b$ such that $a> b\geq 2$ and a positive real
$\delta>0$. Let $S$ be a planar set of diameter $\delta$ having the following
property: for every $a$ points in $S$, at least $b$ of them have pairwise
distances that are all less than or equal to $2$. What is the maximum Lebesgue
measure of $S$? In this paper we investigate this problem. We discuss the,
devious, motivation that leads to its formulation and provide upper bounds on
the Lebesgue measure of $S$. Our main result is based on a generalisation of a
theorem that is due to Heinrich Jung. In certain instances we are able to find
the extremal set but the general case seems elusive.
","[{'version': 'v1', 'created': 'Mon, 6 Jul 2015 22:06:35 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Aug 2015 14:14:55 GMT'}]",2015-08-05,"[['Pelekis', 'Christos', '']]","['Isodiametric problem', 'Jung’s theorem', 'diameter']"
19904,1501.01901,Subil Abraham,"Subil Abraham, Suku Nair","Predictive Cyber-security Analytics Framework: A non-homogenous Markov
  model for Security Quantification","16 pages, 6 Figures in International Conference of Security, Privacy
  and Trust Management 2014",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Numerous security metrics have been proposed in the past for protecting
computer networks. However we still lack effective techniques to accurately
measure the predictive security risk of an enterprise taking into account the
dynamic attributes associated with vulnerabilities that can change over time.
In this paper we present a stochastic security framework for obtaining
quantitative measures of security using attack graphs. Our model is novel as
existing research in attack graph analysis do not consider the temporal aspects
associated with the vulnerabilities, such as the availability of exploits and
patches which can affect the overall network security based on how the
vulnerabilities are interconnected and leveraged to compromise the system.
Gaining a better understanding of the relationship between vulnerabilities and
their lifecycle events can provide security practitioners a better
understanding of their state of security. In order to have a more realistic
representation of how the security state of the network would vary over time, a
nonhomogeneous model is developed which incorporates a time dependent
covariate, namely the vulnerability age. The daily transition-probability
matrices are estimated using Frei's Vulnerability Lifecycle model. We also
leverage the trusted CVSS metric domain to analyze how the total exploitability
and impact measures evolve over a time period for a given network.
","[{'version': 'v1', 'created': 'Thu, 8 Jan 2015 16:56:03 GMT'}]",2015-01-09,"[['Abraham', 'Subil', ''], ['Nair', 'Suku', '']]","['Attack Graph', 'Non-homogeneous Markov Model', 'Markov Reward Models', 'CVSS', 'Security Evaluation', 'Cyber Situational Awareness']"
19905,1002.0580,Joachim Spoerhase,Joachim Spoerhase,An Optimal Algorithm for the Indirect Covering Subtree Problem,"10 pages, 1 figure",,,,cs.DS cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the indirect covering subtree problem (Kim et al., 1996). The
input is an edge weighted tree graph along with customers located at the nodes.
Each customer is associated with a radius and a penalty. The goal is to locate
a tree-shaped facility such that the sum of setup and penalty cost is
minimized. The setup cost equals the sum of edge lengths taken by the facility
and the penalty cost is the sum of penalties of all customers whose distance to
the facility exceeds their radius. The indirect covering subtree problem
generalizes the single maximum coverage location problem on trees where the
facility is a node rather than a subtree. Indirect covering subtree can be
solved in $O(n\log^2 n)$ time (Kim et al., 1996). A slightly faster algorithm
for single maximum coverage location with a running time of
$O(n\log^2n/\log\log n)$ has been provided (Spoerhase and Wirth, 2009). We
achieve time $O(n\log n)$ for indirect covering subtree thereby providing the
fastest known algorithm for both problems. Our result implies also faster
algorithms for competitive location problems such as $(1,X)$-medianoid and
$(1,p)$-centroid on trees. We complement our result by a lower bound of
$\Omega(n\log n)$ for single maximum coverage location and $(1,X)$-medianoid on
a real-number RAM model showing that our algorithm is optimal in running time.
","[{'version': 'v1', 'created': 'Tue, 2 Feb 2010 20:15:56 GMT'}]",2010-02-03,"[['Spoerhase', 'Joachim', '']]","['Graph algorithm', 'coverage', 'medianoid', 'tree', 'efficient algorithm']"
19906,1402.5845,Priyanka Sharma,Priyanka Sharma and Garimella Rama Murthy,"Mathematical Modelling of Energy Wastage in Absence of Levelling and
  Sectoring in Wireless Sensor Networks",,,,,cs.IT cs.NI math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we quantitatively (mathematically) reason the energy savings
achieved by the Leveling and Sectoring protocol. Due to the energy constraints
on the sensor nodes (in terms of supply of energy) energy awareness has become
crucial in networking protocol stack. The understanding of routing protocols
along with energy awareness in a network would help in energy opti-mization
with efficient routing .We provide analytical modelling of the energy wastage
in the absence of Leveling and Sectoring protocol by considering the network in
the form of binary tree, nested tree and Q-ary tree. The simulation results
reflect the energy wastage in the absence of Levelling and Sectoring based
hybrid protocol.
","[{'version': 'v1', 'created': 'Mon, 24 Feb 2014 14:56:17 GMT'}]",2014-02-25,"[['Sharma', 'Priyanka', ''], ['Murthy', 'Garimella Rama', '']]","['Wireless Sensor Networks', 'Pure Flooding', 'Controlled Flooding', 'Routing', 'Energy Efficiency']"
19907,1511.07727,Atilim Gunes Baydin,"Atilim Gunes Baydin, Barak A. Pearlmutter, Jeffrey Mark Siskind",DiffSharp: Automatic Differentiation Library,"5 pages, 1 figure, minor fixes, added coauthor",,,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we introduce DiffSharp, an automatic differentiation (AD)
library designed with machine learning in mind. AD is a family of techniques
that evaluate derivatives at machine precision with only a small constant
factor of overhead, by systematically applying the chain rule of calculus at
the elementary operator level. DiffSharp aims to make an extensive array of AD
techniques available, in convenient form, to the machine learning community.
These including arbitrary nesting of forward/reverse AD operations, AD with
linear algebra primitives, and a functional API that emphasizes the use of
higher-order functions and composition. The library exposes this functionality
through an API that provides gradients, Hessians, Jacobians, directional
derivatives, and matrix-free Hessian- and Jacobian-vector products. Bearing the
performance requirements of the latest machine learning techniques in mind, the
underlying computations are run through a high-performance BLAS/LAPACK backend,
using OpenBLAS by default. GPU support is currently being implemented.
","[{'version': 'v1', 'created': 'Tue, 24 Nov 2015 14:28:13 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Nov 2015 16:32:40 GMT'}]",2015-11-30,"[['Baydin', 'Atilim Gunes', ''], ['Pearlmutter', 'Barak A.', ''], ['Siskind', 'Jeffrey Mark', '']]","['automatic differentiation', 'backpropagation', 'optimization', 'gradient methods']"
19908,1511.07349,Hosny Abbas,"Hosny Abbas, Samir Shaheen",MOS-2: A Two-Dimension Space for Positioning MAS Organizational Models,"15 pages, 12 figures in International Journal of Engineering Research
  and General Science (ISSN 2091-2730)",,,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The increased complexity and dynamism of present and future Multi-Agent
Systems (MAS) enforce the need for considering both of their static
(design-time) and the dynamic (run-time) aspects. A type of balance between the
two aspects can definitely give better results related to system stability and
adaptivity. MAS organization is the research area that is concerned with these
issues and it is currently a very active and interesting research area.
Designing a MAS with an initial organization and giving it the ability to
dynamically reorganize to adapt the dynamic changes of its unpredictable and
uncertain environment, is the feasible way to survive and to run effectively.
Normally, MAS organization is tackled by what is called, MAS organizational
models, which are concerned with the description (formally or informally) of
the structural and dynamical aspects of agent organizations. This paper
proposes a two-dimension space, called MOS-2, for positioning and assessing MAS
organizational models based on two dimensions: their adopted engineering
viewpoint (agent-centered or organization-centered) as the vertical dimension
and the agents awareness/unawareness of the existence of the organizational
level as the horizontal dimension. The MOS-2 space is applied for positioning a
number of familiar organizational models. Its future trends and possible
improvements are highlighted. They include the following, (1) adding Time as a
dimension, (2) increasing the considered dimensions, (3) providing a
quantitative approach for positioning MAS organizational models.
","[{'version': 'v1', 'created': 'Mon, 23 Nov 2015 18:17:05 GMT'}]",2015-11-24,"[['Abbas', 'Hosny', ''], ['Shaheen', 'Samir', '']]","['multi-agent systems (MAS)', 'MAS organization', 'dynamic reorganization', 'organizational models', 'stability', 'adaptivity']"
19909,1206.2010,Michele Filannino,Michele Filannino,Temporal expression normalisation in natural language texts,"7 pages, 1 figure, 5 tables",,,,cs.CL cs.IR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Automatic annotation of temporal expressions is a research challenge of great
interest in the field of information extraction. In this report, I describe a
novel rule-based architecture, built on top of a pre-existing system, which is
able to normalise temporal expressions detected in English texts. Gold standard
temporally-annotated resources are limited in size and this makes research
difficult. The proposed system outperforms the state-of-the-art systems with
respect to TempEval-2 Shared Task (value attribute) and achieves substantially
better results with respect to the pre-existing system on top of which it has
been developed. I will also introduce a new free corpus consisting of 2822
unique annotated temporal expressions. Both the corpus and the system are
freely available on-line.
","[{'version': 'v1', 'created': 'Sun, 10 Jun 2012 09:32:07 GMT'}]",2012-06-12,"[['Filannino', 'Michele', '']]","['information extraction', 'temporal expression', 'text mining', 'natural language processing']"
19910,1108.0353,Velimir Ilic,"Velimir M. Ilic, Miroslav D. Ciric, Miomir S. Stankovic",Cross-moments computation for stochastic context-free grammars,,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider the problem of efficient computation of
cross-moments of a vector random variable represented by a stochastic
context-free grammar. Two types of cross-moments are discussed. The sample
space for the first one is the set of all derivations of the context-free
grammar, and the sample space for the second one is the set of all derivations
which generate a string belonging to the language of the grammar. In the past,
this problem was widely studied, but mainly for the cross-moments of scalar
variables and up to the second order. This paper presents new algorithms for
computing the cross-moments of an arbitrary order, and the previously developed
ones are derived as special cases.
","[{'version': 'v1', 'created': 'Mon, 1 Aug 2011 16:20:50 GMT'}, {'version': 'v2', 'created': 'Sun, 13 Oct 2013 02:15:51 GMT'}]",2013-10-15,"[['Ilic', 'Velimir M.', ''], ['Ciric', 'Miroslav D.', ''], ['Stankovic', 'Miomir S.', '']]","['stochastic context-free grammar', 'cross-moments', 'semiring', 'moment-generating function', 'partition function', 'inside-outside algorithm']"
19911,1206.1943,Rajiv Ranjan Dr.,"Dimitrios Georgakopoulos, Rajiv Ranjan, Karan Mitra, Xiangmin Zhou",MediaWise - Designing a Smart Media Cloud,"This paper appears as the invited keynote paper in the proceedings of
  the International Conference on Advances in Cloud Computing (ACC-2012), July
  26-28, 2012, Bangalore, India",,,,cs.DC cs.MM cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The MediaWise project aims to expand the scope of existing media delivery
systems with novel cloud, personalization and collaboration capabilities that
can serve the needs of more users, communities, and businesses. The project
develops a MediaWise Cloud platform that supports do-it-yourself creation,
search, management, and consumption of multimedia content. The MediaWise Cloud
supports pay-as-you-go models and elasticity that are similar to those offered
by commercially available cloud services. However, unlike existing commercial
CDN services providers such as Limelight Networks and Akamai the MediaWise
Cloud require no ownerships of computing infrastructure and instead rely on the
public Internet and public cloud services (e.g., commercial cloud storage to
store its content). In addition to integrating such public cloud services into
a public cloud-based Content Delivery Network, the MediaWise Cloud also
provides advanced Quality of Service (QoS) management as required for the
delivery of streamed and interactive high resolution multimedia content. In
this paper, we give a brief overview of MediaWise Cloud architecture and
present a comprehensive discussion on research objectives related to its
service components. Finally, we also compare the features supported by the
existing CDN services against the envisioned objectives of MediaWise Cloud.
","[{'version': 'v1', 'created': 'Sat, 9 Jun 2012 14:07:47 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Jun 2012 03:12:37 GMT'}]",2012-06-19,"[['Georgakopoulos', 'Dimitrios', ''], ['Ranjan', 'Rajiv', ''], ['Mitra', 'Karan', ''], ['Zhou', 'Xiangmin', '']]","['Content Delivery Network', 'Cloud Computing', 'Media Management', 'Media Delivery', 'Media Consumption', 'Personalization', 'Quality of Service']"
19912,1506.01965,Frederic Le Mouel,"Marie-Ange Lebre (CITI, VALEO), Fr\'ed\'eric Le Mou\""el (CITI), Eric
  M\'enard (VALEO), Alexandre Garnault (VALEO), Benazouz Brada\""i (VALEO),
  Vanessa Picron (VALEO)","Real scenario and simulations on GLOSA traffic light system for reduced
  CO2 emissions, waiting time and travel time","in 22nd ITS World Congress, Oct 2015, Bordeaux, France. 2015",,,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cooperative ITS is enabling vehicles to communicate with the infrastructure
to provide improvements in traffic control. A promising approach consists in
anticipating the road profile and the upcoming dynamic events like traffic
lights. This topic has been addressed in the French public project Co-Drive
through functions developed by Valeo named Green Light Optimal Speed Advisor
(GLOSA). The system advises the optimal speed to pass the next traffic light
without stopping. This paper presents results of its performance in different
scenarios through simulations and real driving measurements. A scaling is done
in an urban area, with different penetration rates in vehicle and
infrastructure equipment for vehicular communication. Our simulation results
indicate that GLOSA can reduce CO2 emissions, waiting time and travel time,
both in experimental conditions and in real traffic conditions.
","[{'version': 'v1', 'created': 'Thu, 4 Jun 2015 14:12:03 GMT'}]",2015-06-08,"[['Lebre', 'Marie-Ange', '', 'CITI, VALEO'], ['Mouël', 'Frédéric Le', '', 'CITI'], ['Ménard', 'Eric', '', 'VALEO'], ['Garnault', 'Alexandre', '', 'VALEO'], ['Bradaï', 'Benazouz', '', 'VALEO'], ['Picron', 'Vanessa', '', 'VALEO']]","['GLOSA', 'V2X', 'Co-Drive']"
19913,1710.03501,Laurent Besacier,"P. Godard, G. Adda, M. Adda-Decker, J. Benjumea, L. Besacier, J.
  Cooper-Leavitt, G-N. Kouarata, L. Lamel, H. Maynard, M. Mueller, A. Rialland,
  S. Stueker, F. Yvon, M. Zanon-Boito","A Very Low Resource Language Speech Corpus for Computational Language
  Documentation Experiments",accepted to LREC 2018,,,,cs.CL,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Most speech and language technologies are trained with massive amounts of
speech and text information. However, most of the world languages do not have
such resources or stable orthography. Systems constructed under these almost
zero resource conditions are not only promising for speech technology but also
for computational language documentation. The goal of computational language
documentation is to help field linguists to (semi-)automatically analyze and
annotate audio recordings of endangered and unwritten languages. Example tasks
are automatic phoneme discovery or lexicon discovery from the speech signal.
This paper presents a speech corpus collected during a realistic language
documentation process. It is made up of 5k speech utterances in Mboshi (Bantu
C25) aligned to French text translations. Speech transcriptions are also made
available: they correspond to a non-standard graphemic form close to the
language phonology. We present how the data was collected, cleaned and
processed and we illustrate its use through a zero-resource task: spoken term
discovery. The dataset is made available to the community for reproducible
computational language documentation experiments and their evaluation.
","[{'version': 'v1', 'created': 'Tue, 10 Oct 2017 10:39:20 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Oct 2017 08:27:29 GMT'}, {'version': 'v3', 'created': 'Thu, 15 Feb 2018 06:32:01 GMT'}]",2018-02-16,"[['Godard', 'P.', ''], ['Adda', 'G.', ''], ['Adda-Decker', 'M.', ''], ['Benjumea', 'J.', ''], ['Besacier', 'L.', ''], ['Cooper-Leavitt', 'J.', ''], ['Kouarata', 'G-N.', ''], ['Lamel', 'L.', ''], ['Maynard', 'H.', ''], ['Mueller', 'M.', ''], ['Rialland', 'A.', ''], ['Stueker', 'S.', ''], ['Yvon', 'F.', ''], ['Zanon-Boito', 'M.', '']]","['language documentation', 'field linguistics', 'spoken term discovery', 'word segmentation', 'zero resource technologies', 'unwritten languages']"
19914,1504.04588,James-A. Goulet,James-A. Goulet,"The Nataf-Beta Random Field Classifier: An Extension of the Beta
  Conjugate Prior to Classification Problems","17 pages, 4 figures, Submitted for publication in the Journal of
  Machine Learning Research",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the Nataf-Beta Random Field Classifier, a discriminative
approach that extends the applicability of the Beta conjugate prior to
classification problems. The approach's key feature is to model the probability
of a class conditional on attribute values as a random field whose marginals
are Beta distributed, and where the parameters of marginals are themselves
described by random fields. Although the classification accuracy of the
approach proposed does not statistically outperform the best accuracies
reported in the literature, it ranks among the top tier for the six benchmark
datasets tested. The Nataf-Beta Random Field Classifier is suited as a general
purpose classification approach for real-continuous and real-integer attribute
value problems.
","[{'version': 'v1', 'created': 'Fri, 17 Apr 2015 17:32:00 GMT'}]",2015-04-20,"[['Goulet', 'James-A.', '']]","['Classification', 'Beta distribution', 'Nataf distribution', 'Random field', 'Conjugate prior', 'Gaussian process']"
19915,1511.02586,Cong Xie,"Cong Xie, Wu-Jun Li and Zhihua Zhang","S-PowerGraph: Streaming Graph Partitioning for Natural Graphs by
  Vertex-Cut",,,,,cs.SI cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One standard solution for analyzing large natural graphs is to adopt
distributed computation on clusters. In distributed computation, graph
partitioning (GP) methods assign the vertices or edges of a graph to different
machines in a balanced way so that some distributed algorithms can be adapted
for. Most of traditional GP methods are offline, which means that the whole
graph has been observed before partitioning. However, the offline methods often
incur high computation cost. Hence, streaming graph partitioning (SGP) methods,
which can partition graphs in an online way, have recently attracted great
attention in distributed computation. There exist two typical GP strategies:
edge-cut and vertex-cut. Most SGP methods adopt edge-cut, but few vertex-cut
methods have been proposed for SGP. However, the vertex-cut strategy would be a
better choice than the edge-cut strategy because the degree of a natural graph
in general follows a highly skewed power-law distribution. Thus, we propose a
novel method, called S-PowerGraph, for SGP of natural graphs by vertex-cut. Our
S-PowerGraph method is simple but effective. Experiments on several large
natural graphs and synthetic graphs show that our S-PowerGraph can outperform
the state-of-the-art baselines.
","[{'version': 'v1', 'created': 'Mon, 9 Nov 2015 07:28:33 GMT'}]",2015-11-10,"[['Xie', 'Cong', ''], ['Li', 'Wu-Jun', ''], ['Zhang', 'Zhihua', '']]","['Graph Partitioning', 'Streaming', 'Vertex-Cut']"
19916,1702.07461,Benjamin Susman,Yuliya Lierler and Benjamin Susman,"On Relation between Constraint Answer Set Programming and Satisfiability
  Modulo Theories","Under consideration in Theory and Practice of Logic Programming
  (TPLP)",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Constraint answer set programming is a promising research direction that
integrates answer set programming with constraint processing. It is often
informally related to the field of satisfiability modulo theories. Yet, the
exact formal link is obscured as the terminology and concepts used in these two
research areas differ. In this paper, we connect these two research areas by
uncovering the precise formal relation between them. We believe that this work
will booster the cross-fertilization of the theoretical foundations and the
existing solving methods in both areas. As a step in this direction we provide
a translation from constraint answer set programs with integer linear
constraints to satisfiability modulo linear integer arithmetic that paves the
way to utilizing modern satisfiability modulo theories solvers for computing
answer sets of constraint answer set programs.
","[{'version': 'v1', 'created': 'Fri, 24 Feb 2017 04:15:03 GMT'}]",2017-02-27,"[['Lierler', 'Yuliya', ''], ['Susman', 'Benjamin', '']]","['constraint answer set programming', 'constraint satisfaction processing', 'satisfiabilitymodulo theories']"
19917,1802.07966,Arindam Mitra,Arindam Mitra and Chitta Baral,"Incremental and Iterative Learning of Answer Set Programs from Mutually
  Distinct Examples",,,,,cs.AI cs.LG cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the years the Artificial Intelligence (AI) community has produced
several datasets which have given the machine learning algorithms the
opportunity to learn various skills across various domains. However, a subclass
of these machine learning algorithms that aimed at learning logic programs,
namely the Inductive Logic Programming algorithms, have often failed at the
task due to the vastness of these datasets. This has impacted the usability of
knowledge representation and reasoning techniques in the development of AI
systems. In this research, we try to address this scalability issue for the
algorithms that learn answer set programs. We present a sound and complete
algorithm which takes the input in a slightly different manner and performs an
efficient and more user controlled search for a solution. We show via
experiments that our algorithm can learn from two popular datasets from machine
learning community, namely bAbl (a question answering dataset) and MNIST (a
dataset for handwritten digit recognition), which to the best of our knowledge
was not previously possible. The system is publicly available at
https://goo.gl/KdWAcV. This paper is under consideration for acceptance in
TPLP.
","[{'version': 'v1', 'created': 'Thu, 22 Feb 2018 10:22:58 GMT'}, {'version': 'v2', 'created': 'Tue, 1 May 2018 14:42:15 GMT'}]",2018-05-02,"[['Mitra', 'Arindam', ''], ['Baral', 'Chitta', '']]","['Inductive Logic Programming', 'Answer Set Programming', 'Question Answering', 'HandwrittenDigit Recognition', 'Context Dependent Learning']"
19918,0711.2811,Annie Bouyer,"Gilles Halin (CRAI), Sylvain Kubicki (CRAI)","Une approche par les mod\`eles pour le suivi de l'activit\'e de
  construction d'un b\^atiment. Bat'iViews : une interface multi-vues
  orient\'ee gestion de chantier",,,,,cs.HC,,"  Cooperation between actors in design and construction activities in
architecture is an essential stake nowadays. In professional practices the
actors involved in construction projects use numerous tools. The project is
unique but the ""views"" that actors manipulate are various and sometimes
fundamentally different. Their common characteristic is that they partially
represent the cooperation context through a specific point of view.
""Bat'iViews"" suggests to the actors a multi-view interface of the context and
enables to navigate through the different views. This proposition is based on a
model-driven approach. We distinguish between ""context modelling"" and modelling
of concepts represented in each ""businessview"". A model integrative
infrastructure allows us to develop the prototype and to manage user
interaction through the definition of models' transformations.
","[{'version': 'v1', 'created': 'Sun, 18 Nov 2007 19:10:18 GMT'}]",2007-11-20,"[['Halin', 'Gilles', '', 'CRAI'], ['Kubicki', 'Sylvain', '', 'CRAI']]","['Building construction', 'Cooperation', 'Multi-visualization interface', 'Model-Driven Engineering (MDE)', 'Human-Computer Interface (HCI)', 'Cooperative Engineering']"
19919,1407.5488,Madhumangal Pal Dr.,"Satyabrata Paul, Madhumangal Pal, Anita Pal","L(2,1)-labelling of Circular-arc Graph",12 pages,"Annals of Pure and Applied Mathematics, 5(2) (2014)208-219",,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An L(2,1)-labelling of a graph $G=(V, E)$ is $\lambda_{2,1}(G)$ a function
$f$ from the vertex set V (G) to the set of non-negative integers such that
adjacent vertices get numbers at least two apart, and vertices at distance two
get distinct numbers. The L(2,1)-labelling number denoted by $\lambda_{2,1}(G)$
of $G$ is the minimum range of labels over all such labelling. In this article,
it is shown that, for a circular-arc graph $G$, the upper bound of
$\lambda_{2,1}(G)$ is $\Delta+3\omega$, where $\Delta$ and $\omega$ represents
the maximum degree of the vertices and size of maximum clique respectively.
","[{'version': 'v1', 'created': 'Mon, 21 Jul 2014 13:26:54 GMT'}]",2014-07-22,"[['Paul', 'Satyabrata', ''], ['Pal', 'Madhumangal', ''], ['Pal', 'Anita', '']]","['Frequency assignment', 'L(2', '1)-labelling', 'interval graph', 'circular-arc graph']"
19920,1707.09603,Menandro Roxas,"Menandro Roxas, Tomoki Hori, Taiki Fukiage, Yasuhide Okamoto, Takeshi
  Oishi","Occlusion Handling using Semantic Segmentation and Visibility-Based
  Rendering for Mixed Reality",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Real-time occlusion handling is a major problem in outdoor mixed reality
system because it requires great computational cost mainly due to the
complexity of the scene. Using only segmentation, it is difficult to accurately
render a virtual object occluded by complex objects such as trees, bushes etc.
In this paper, we propose a novel occlusion handling method for real-time,
outdoor, and omni-directional mixed reality system using only the information
from a monocular image sequence. We first present a semantic segmentation
scheme for predicting the amount of visibility for different type of objects in
the scene. We also simultaneously calculate a foreground probability map using
depth estimation derived from optical flow. Finally, we combine the
segmentation result and the probability map to render the computer generated
object and the real scene using a visibility-based rendering method. Our
results show great improvement in handling occlusions compared to existing
blending based methods.
","[{'version': 'v1', 'created': 'Sun, 30 Jul 2017 10:01:57 GMT'}]",2017-08-01,"[['Roxas', 'Menandro', ''], ['Hori', 'Tomoki', ''], ['Fukiage', 'Taiki', ''], ['Okamoto', 'Yasuhide', ''], ['Oishi', 'Takeshi', '']]","['Outdoor Mixed Reality', 'Semantic Segmentation', 'Visibility-basedRendering']"
19921,1312.3766,Matteo Cesana,"Nicola Basilico, Nicola Gatti, Luca Goffredi, Matteo Cesana","Beaconing-Aware Optimal Policies for Two-Hop Routing in Multi-Class
  Delay Tolerant Networks",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In Delay Tolerant Networks (DTNs), two-hop routing compromises energy versus
delay more conveniently than epidemic routing. Literature provides
comprehensive results on optimal routing policies for mobile nodes with
homogeneous mobility, often neglecting signaling costs. Routing policies are
customarily computed by means of fluid approximation techniques, which assure
solutions to be optimal only when the number of nodes is infinite, while they
provide a coarse approximation otherwise. This work addresses heterogeneous
mobility patterns and multiple wireless transmission technologies; moreover, we
explicitly consider the beaconing/signaling costs to support routing and the
possibility for nodes to discard packets after a local time. We theoretically
characterize the optimal policies by deriving their formal properties. Such
analysis is leveraged to define two algorithmic approaches which allow to trade
off optimality with computational efficiency. Theoretical bounds on the
approximation guarantees of the proposed algorithms are derived. We then
experimentally evaluated them in realistic scenarios of multi-class DTNs.
","[{'version': 'v1', 'created': 'Fri, 13 Dec 2013 10:50:10 GMT'}]",2013-12-16,"[['Basilico', 'Nicola', ''], ['Gatti', 'Nicola', ''], ['Goffredi', 'Luca', ''], ['Cesana', 'Matteo', '']]","['Delay Tolerant Networks', '2-Hop Optimal Routing', 'Approximation Algorithms']"
19922,1205.5838,Linh Anh Nguyen D.Sc.,Linh Anh Nguyen,"ExpTime Tableaux for the Description Logic SHIQ Based on Global State
  Caching and Integer Linear Feasibility Checking",,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give the first ExpTime (complexity-optimal) tableau decision procedure for
checking satisfiability of a knowledge base in the description logic SHIQ when
numbers are coded in unary. Our procedure is based on global state caching and
integer linear feasibility checking.
","[{'version': 'v1', 'created': 'Fri, 25 May 2012 23:58:40 GMT'}, {'version': 'v2', 'created': 'Sun, 11 Nov 2012 19:08:17 GMT'}, {'version': 'v3', 'created': 'Wed, 20 Feb 2013 19:41:42 GMT'}, {'version': 'v4', 'created': 'Tue, 31 Dec 2013 16:03:58 GMT'}]",2014-01-03,"[['Nguyen', 'Linh Anh', '']]","['automated reasoning', 'description logics', 'global state caching', 'integer linear feasibility']"
19923,1306.3772,Sarel Cohen,"Sarel Cohen, Amos Fiat, Moshik Hershcovitch, Haim Kaplan",Minimal Indices for Successor Search,"28 pages, full version, extended abstract submitted to MFCS 2013",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give a new successor data structure which improves upon the index size of
the P\v{a}tra\c{s}cu-Thorup data structures, reducing the index size from $O(n
w^{4/5})$ bits to $O(n \log w)$ bits, with optimal probe complexity.
Alternatively, our new data structure can be viewed as matching the space
complexity of the (probe-suboptimal) $z$-fast trie of Belazzougui et al. Thus,
we get the best of both approaches with respect to both probe count and index
size. The penalty we pay is an extra $O(\log w)$ inter-register operations. Our
data structure can also be used to solve the weak prefix search problem, the
index size of $O(n \log w)$ bits is known to be optimal for any such data
structure.
  The technical contributions include highly efficient single word indices,
with out-degree $w/\log w$ (compared to the $w^{1/5}$ out-degree of fusion tree
based indices). To construct such high efficiency single word indices we device
highly efficient bit selectors which, we believe, are of independent interest.
","[{'version': 'v1', 'created': 'Mon, 17 Jun 2013 08:47:05 GMT'}]",2013-06-18,"[['Cohen', 'Sarel', ''], ['Fiat', 'Amos', ''], ['Hershcovitch', 'Moshik', ''], ['Kaplan', 'Haim', '']]","['Predecessor Search', 'Succinct Data Structures', 'Cell ProbeModel', 'Fusion Trees', 'Tries', 'Word RAM model']"
19924,1506.04444,Shuai Zhang,"Shuai Zhang, Penghang Yin, Jack Xin","Transformed Schatten-1 Iterative Thresholding Algorithms for Low Rank
  Matrix Completion",,,,,cs.IT math.IT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study a non-convex low-rank promoting penalty function, the transformed
Schatten-1 (TS1), and its applications in matrix completion. The TS1 penalty,
as a matrix quasi-norm defined on its singular values, interpolates the rank
and the nuclear norm through a nonnegative parameter a. We consider the
unconstrained TS1 regularized low-rank matrix recovery problem and develop a
fixed point representation for its global minimizer. The TS1 thresholding
functions are in closed analytical form for all parameter values. The TS1
threshold values differ in subcritical (supercritical) parameter regime where
the TS1 threshold functions are continuous (discontinuous). We propose TS1
iterative thresholding algorithms and compare them with some state-of-the-art
algorithms on matrix completion test problems. For problems with known rank, a
fully adaptive TS1 iterative thresholding algorithm consistently performs the
best under different conditions with ground truth matrix being multivariate
Gaussian at varying covariance. For problems with unknown rank, TS1 algorithms
with an additional rank estimation procedure approach the level of IRucL-q
which is an iterative reweighted algorithm, non-convex in nature and best in
performance.
","[{'version': 'v1', 'created': 'Sun, 14 Jun 2015 22:00:02 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Oct 2016 17:59:39 GMT'}]",2016-10-19,"[['Zhang', 'Shuai', ''], ['Yin', 'Penghang', ''], ['Xin', 'Jack', '']]","['Transformed Schatten-1 penalty', 'fixed point representation', 'closed form thresholdingfunction', 'iterative thresholding algorithms', 'matrix completion']"
19925,1412.4846,Chunhua Bian,"Ruokuang Lin, Qianli D.Y. Ma and Chunhua Bian","Scaling laws in human speech, decreasing emergence of new words and a
  generalized model",,,,,cs.CL physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human language, as a typical complex system, its organization and evolution
is an attractive topic for both physical and cultural researchers. In this
paper, we present the first exhaustive analysis of the text organization of
human speech. Two important results are that: (i) the construction and
organization of spoken language can be characterized as Zipf's law and Heaps'
law, as observed in written texts; (ii) word frequency vs. rank distribution
and the growth of distinct words with the increase of text length shows
significant differences between book and speech. In speech word frequency
distribution are more concentrated on higher frequency words, and the emergence
of new words decreases much rapidly when the content length grows. Based on
these observations, a new generalized model is proposed to explain these
complex dynamical behaviors and the differences between speech and book.
","[{'version': 'v1', 'created': 'Tue, 16 Dec 2014 00:34:37 GMT'}, {'version': 'v2', 'created': 'Wed, 7 Jan 2015 16:16:51 GMT'}]",2015-01-08,"[['Lin', 'Ruokuang', ''], ['Ma', 'Qianli D. Y.', ''], ['Bian', 'Chunhua', '']]","['Speech transcription', 'Zipf’s law', 'Heaps’ law', 'preferential attachment', 'complex system']"
19926,1712.02557,Nicolas Ruiz,Nicolas Ruiz,A general cipher for individual data anonymization,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Over the years, the literature on individual data anonymization has burgeoned
in many directions. Borrowing from several areas of other sciences, the current
diversity of concepts, models and tools available contributes to understanding
and fostering individual data dissemination in a privacy-preserving way, as
well as unleashing new sources of information for the benefits of society at
large. However, such diversity doesn't come without some difficulties.
Currently, the task of selecting the optimal analytical environment to conduct
anonymization is complicated by the multitude of available choices. Based on
recent contributions from the literature and inspired by cryptography, this
paper proposes the first cipher for data anonymization. The functioning of this
cipher shows that, in fact, every anonymization method can be viewed as a
general form of rank swapping with unconstrained permutation structures. Beyond
all the currently existing methods that it can mimic, this cipher offers a new
way to practice data anonymization, notably by performing anonymization in an
ex ante way, instead of being engaged in several ex post evaluations and
iterations to reach the protection and information properties sought after.
Moreover, the properties of this cipher point to some previously unknown
general insights into the task of data anonymization considered at a general
level of functioning. Finally, and to make the cipher operational, this paper
proposes the introduction of permutation menus in data anonymization, where
recently developed universal measures of disclosure risk and information loss
are used ex ante for the calibration of permutation keys. To justify the
relevance of their uses, a theoretical characterization of these measures is
also proposed.
","[{'version': 'v1', 'created': 'Thu, 7 Dec 2017 10:29:03 GMT'}]",2017-12-08,"[['Ruiz', 'Nicolas', '']]","['privacy-preserving data publishing', 'statistical disclosure control', 'permutation paradigm', 'permutation matrices', 'rank swapping', 'power means', 'cipher   1']"
19927,1412.7789,Roshan Ragel,"Vajira Thambawita, Roshan Ragel and Dhammika Elkaduwe","To Use or Not to Use: Graphics Processing Units for Pattern Matching
  Algorithms","appears in The 7th International Conference on Information and
  Automation for Sustainability (ICIAfS) 2014",,,,cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  String matching is an important part in today's computer applications and
Aho-Corasick algorithm is one of the main string matching algorithms used to
accomplish this. This paper discusses that when can the GPUs be used for string
matching applications using the Aho-Corasick algorithm as a benchmark. We have
to identify the best unit to run our string matching algorithm according to the
performance of our devices and the applications. Sometimes CPU gives better
performance than GPU and sometimes GPU gives better performance than CPU.
Therefore, identifying this critical point is significant task for researchers
who are using GPUs to improve the performance of their string matching
applications based on string matching algorithms.
","[{'version': 'v1', 'created': 'Thu, 25 Dec 2014 05:27:49 GMT'}]",2014-12-30,"[['Thambawita', 'Vajira', ''], ['Ragel', 'Roshan', ''], ['Elkaduwe', 'Dhammika', '']]","['GPU', 'CUDA', 'CPU', 'Aho-Corasick algorithm', 'String matching']"
19928,1406.3110,Lior Rokach,"Yuval Elovici, Lior Rokach",Reaction to New Security Threat Class,,,,,cs.DL cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Each new identified security threat class triggers new research and
development efforts by the scientific and professional communities. In this
study, we investigate the rate at which the scientific and professional
communities react to new identified threat classes as it is reflected in the
number of patents, scientific articles and professional publications over a
long period of time. The following threat classes were studied: Phishing; SQL
Injection; BotNet; Distributed Denial of Service; and Advanced Persistent
Threat. Our findings suggest that in most cases it takes a year for the
scientific community and more than two years for industry to react to a new
threat class with patents. Since new products follow patents, it is reasonable
to expect that there will be a window of approximately two to three years in
which no effective product is available to cope with the new threat class.
","[{'version': 'v1', 'created': 'Thu, 12 Jun 2014 03:36:38 GMT'}]",2014-06-13,"[['Elovici', 'Yuval', ''], ['Rokach', 'Lior', '']]","['Cyber Security', 'Information Security', 'Bibliometric Analysis']"
19929,1708.00884,Saksham Gupta,"Saksham Gupta, Sukhad Anand, Atul Rai",Fingerprint Extraction Using Smartphone Camera,11 pages,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the previous decade, there has been a considerable rise in the usage of
smartphones.Due to exorbitant advancement in technology, computational speed
and quality of image capturing has increased considerably. With an increase in
the need for remote fingerprint verification, smartphones can be used as a
powerful alternative for fingerprint authentication instead of conventional
optical sensors. In this research, wepropose a technique to capture
finger-images from the smartphones and pre-process them in such a way that it
can be easily matched with the optical sensor images.Effective finger-image
capturing, image enhancement, fingerprint pattern extraction, core point
detection and image alignment techniques have been discussed. The proposed
approach has been validated on FVC 2004 DB1 & DB2 dataset and the results show
the efficacy of the methodology proposed. The method can be deployed for
real-time commercial usage.
","[{'version': 'v1', 'created': 'Wed, 2 Aug 2017 18:33:53 GMT'}]",2017-08-04,"[['Gupta', 'Saksham', ''], ['Anand', 'Sukhad', ''], ['Rai', 'Atul', '']]","['Finger-image', 'Gabor Filter', 'Core point', 'Histogram', 'RemoteVerification', 'FVC']"
19930,1312.2094,Rui Guo Mr.,"Rui Guo, Hongzhi Wang, Mengwen Chen, Jianzhong Li, Hong Gao","Parallelization in Extracting Fresh Information from Online Social
  Network",submitted to Knowledge-Based System,,,,cs.SI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Online Social Network (OSN) is one of the most hottest services in the past
years. It preserves the life of users and provides great potential for
journalists, sociologists and business analysts. Crawling data from social
network is a basic step for social network information analysis and processing.
As the network becomes huge and information on the network updates faster than
web pages, crawling is more difficult because of the limitations of band-width,
politeness etiquette and computation power. To extract fresh information from
social network efficiently and effectively, this paper presents a novel
crawling method and discusses parallelization architecture of social network.
To discover the feature of social network, we gather data from real social
network, analyze them and build a model to describe the discipline of users'
behavior. With the modeled behavior, we propose methods to predict users'
behavior. According to the prediction, we schedule our crawler more reasonably
and extract more fresh information with parallelization technologies.
Experimental results demonstrate that our strategies could obtain information
from OSN efficiently and effectively.
","[{'version': 'v1', 'created': 'Sat, 7 Dec 2013 13:32:39 GMT'}]",2013-12-10,"[['Guo', 'Rui', ''], ['Wang', 'Hongzhi', ''], ['Chen', 'Mengwen', ''], ['Li', 'Jianzhong', ''], ['Gao', 'Hong', '']]","['Online Social Network', 'Crawler', 'Freshness']"
19931,1609.01479,Alan Gray,Alan Gray and Kevin Stratford,A Lightweight Approach to Performance Portability with targetDP,"11 pages, 5 figures, accepted to the International Journal of High
  Performance Computing Applications (IJHPCA), acceptance date 27th October
  2016",,,,cs.DC hep-lat,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Leading HPC systems achieve their status through use of highly parallel
devices such as NVIDIA GPUs or Intel Xeon Phi many-core CPUs. The concept of
performance portability across such architectures, as well as traditional CPUs,
is vital for the application programmer. In this paper we describe targetDP, a
lightweight abstraction layer which allows grid-based applications to target
data parallel hardware in a platform agnostic manner. We demonstrate the
effectiveness of our pragmatic approach by presenting performance results for a
complex fluid application (with which the model was co-designed), plus a
separate lattice QCD particle physics code. For each application, a single
source code base is seen to achieve portable performance, as assessed within
the context of the Roofline model. TargetDP can be combined with MPI to allow
use on systems containing multiple nodes: we demonstrate this through provision
of scaling results on traditional and GPU-accelerated large scale
supercomputers.
","[{'version': 'v1', 'created': 'Tue, 6 Sep 2016 10:38:02 GMT'}, {'version': 'v2', 'created': 'Wed, 9 Nov 2016 20:28:04 GMT'}]",2016-11-10,"[['Gray', 'Alan', ''], ['Stratford', 'Kevin', '']]","['Performance Portability', 'Programming Models', 'HPC', 'GPU', 'Manycore', 'Computational Physics']"
19932,1606.06707,Amin Ghafouri,"Amin Ghafouri, Waseem Abbas, Aron Laszka, Yevgeniy Vorobeychik, and
  Xenofon Koutsoukos","Optimal Thresholds for Anomaly-Based Intrusion Detection in Dynamical
  Environments","Decision and Game Theory for Security: 7th International Conference,
  GameSec 2016, New York, NY, USA",,,,cs.GT cs.CR cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In cyber-physical systems, malicious and resourceful attackers could
penetrate the system through cyber means and cause significant physical damage.
Consequently, detection of such attacks becomes integral towards making these
systems resilient to attacks. To achieve this objective, intrusion detection
systems (IDS) that are able to detect malicious behavior can be deployed.
However, practical IDS are imperfect and sometimes they may produce false
alarms for a normal system behavior. Since alarms need to be investigated for
any potential damage, a large number of false alarms may increase the
operational costs significantly. Thus, IDS need to be configured properly, as
oversensitive IDS could detect attacks early but at the cost of a higher number
of false alarms. Similarly, IDS with low sensitivity could reduce the false
alarms while increasing the time to detect the attacks. The configuration of
IDS to strike the right balance between time to detecting attacks and the rate
of false positives is a challenging task, especially in dynamic environments,
in which the damage incurred by a successful attack is time-varying.
  In this paper, we study the problem of finding optimal detection thresholds
for anomaly-based detectors implemented in dynamical systems in the face of
strategic attacks. We formulate the problem as an attacker-defender security
game, and determine thresholds for the detector to achieve an optimal trade-off
between the detection delay and the false positive rates. In this direction,
first, we provide an algorithm that computes optimal fixed threshold that
remains fixed throughout. Second, we allow detector's threshold to change with
time to further minimize the defender's loss and provide an algorithm to
compute time-varying thresholds, which we call adaptive thresholds. Finally, we
numerically evaluate our results using a water distribution network as a
case-study.
","[{'version': 'v1', 'created': 'Tue, 21 Jun 2016 18:59:55 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Feb 2017 22:04:20 GMT'}]",2017-02-10,"[['Ghafouri', 'Amin', ''], ['Abbas', 'Waseem', ''], ['Laszka', 'Aron', ''], ['Vorobeychik', 'Yevgeniy', ''], ['Koutsoukos', 'Xenofon', '']]","['cyber-physical systems', 'security', 'game theory', 'intrusion detection system']"
19933,1409.5414,Jalaj Upadhyay,Jalaj Upadhyay,Differentially Private Linear Algebra in the Streaming Model,This paper is subsumed by https://arxiv.org/abs/1604.01429,,,,cs.DS cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Numerical linear algebra plays an important role in computer science. In this
paper, we initiate the study of performing linear algebraic tasks while
preserving privacy when the data is streamed online. Our main focus is the
space requirement of the privacy-preserving data-structures. We give the first
{\em sketch-based} algorithm for differential privacy. We give optimal, up to
logarithmic factor, space data-structures that can compute low rank
approximation, linear regression, and matrix multiplication, while preserving
differential privacy with better additive error bounds compared to the known
results. Notably, we match the best known space bound in the non-private
setting by Kane and Nelson (J. ACM, 61(1):4).
  Our mechanism for differentially private low-rank approximation {\em reuses}
the random Gaussian matrix in a specific way to provide a single-pass
mechanism. We prove that the resulting distribution also preserve differential
privacy. This can be of independent interest. We do not make any assumptions,
like singular value separation or normalized row assumption, as made in the
earlier works. The mechanisms for matrix multiplication and linear regression
can be seen as the private analogues of the known non-private algorithms. All
our mechanisms, in the form presented, can also be computed in the distributed
setting.
","[{'version': 'v1', 'created': 'Thu, 18 Sep 2014 19:08:58 GMT'}, {'version': 'v2', 'created': 'Thu, 9 Oct 2014 13:46:35 GMT'}, {'version': 'v3', 'created': 'Wed, 5 Nov 2014 16:01:33 GMT'}, {'version': 'v4', 'created': 'Sun, 19 Apr 2015 01:17:18 GMT'}, {'version': 'v5', 'created': 'Wed, 25 Oct 2017 12:48:42 GMT'}]",2017-10-26,"[['Upadhyay', 'Jalaj', '']]","['Differential Privacy', 'Linear Algebra', 'Random Projection']"
19934,0908.1159,Norbert B\'atfai,Norbert B\'atfai,On the Running Time of the Shortest Programs,"24 pages, 15 figures; added new values to the table ""The increasing
  of running time of the shortest programs""",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Kolmogorov complexity of the word w is equal to the length of the
shortest concatenation of program Z and its input x with which the word w is
computed by the universal turing machine U. The question introduced in this
paper is the following: How long do the shortest programs run for?
","[{'version': 'v1', 'created': 'Mon, 10 Aug 2009 14:07:47 GMT'}, {'version': 'v2', 'created': 'Mon, 7 Sep 2009 10:46:14 GMT'}]",2009-09-07,"[['Bátfai', 'Norbert', '']]","['Kolmogorov complexity', 'Busy Beaver', 'Placid Platypus']"
19935,1605.00998,Paul Knysh,"Paul Knysh, Yannis Korkolis","Blackbox: A procedure for parallel optimization of expensive black-box
  functions","8 pages, 3 figures",,,,cs.MS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This note provides a description of a procedure that is designed to
efficiently optimize expensive black-box functions. It uses the response
surface methodology by incorporating radial basis functions as the response
model. A simple method based on a Latin hypercube is used for initial sampling.
A modified version of CORS algorithm with space rescaling is used for the
subsequent sampling. The procedure is able to scale on multicore processors by
performing multiple function evaluations in parallel. The source code of the
procedure is written in Python.
","[{'version': 'v1', 'created': 'Tue, 3 May 2016 17:49:27 GMT'}]",2016-05-04,"[['Knysh', 'Paul', ''], ['Korkolis', 'Yannis', '']]","['optimization', 'black-box function', 'Latin hypercube', 'responsesurface', 'parallel computing']"
19936,0807.2269,Michel Rueher,"Alexandre Goldsztejn (LINA), Claude Michel (I3S, Laboratoire I3S),
  Michel Rueher (I3S, Laboratoire I3S)","An Efficient Algorithm for a Sharp Approximation of Universally
  Quantified Inequalities","ACM symposium on Applied computing, Fortaleza, Ceara : Br\'esil
  (2008)",,,,cs.NA cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a new algorithm for solving a sub-class of quantified
constraint satisfaction problems (QCSP) where existential quantifiers precede
universally quantified inequalities on continuous domains. This class of QCSPs
has numerous applications in engineering and design. We propose here a new
generic branch and prune algorithm for solving such continuous QCSPs. Standard
pruning operators and solution identification operators are specialized for
universally quantified inequalities. Special rules are also proposed for
handling the parameters of the constraints. First experimentation show that our
algorithm outperforms the state of the art methods.
","[{'version': 'v1', 'created': 'Tue, 15 Jul 2008 14:45:38 GMT'}]",2008-07-16,"[['Goldsztejn', 'Alexandre', '', 'LINA'], ['Michel', 'Claude', '', 'I3S, Laboratoire I3S'], ['Rueher', 'Michel', '', 'I3S, Laboratoire I3S']]","['Quantified constraints', 'continuous domains', 'interval arithmetic']"
19937,1412.3898,Lu Yu,Lu Yu and Junming Huang and Chuang Liu and Zike Zhang,ILCR: Item-based Latent Factors for Sparse Collaborative Retrieval,"10 pages, conference",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interactions between search and recommendation have recently attracted
significant attention, and several studies have shown that many potential
applications involve with a joint problem of producing recommendations to users
with respect to a given query, termed $Collaborative$ $Retrieval$ (CR).
Successful algorithms designed for CR should be potentially flexible at dealing
with the sparsity challenges since the setup of collaborative retrieval
associates with a given $query$ $\times$ $user$ $\times$ $item$ tensor instead
of traditional $user$ $\times$ $item$ matrix. Recently, several works are
proposed to study CR task from users' perspective. In this paper, we aim to
sufficiently explore the sophisticated relationship of each $query$ $\times$
$user$ $\times$ $item$ triple from items' perspective. By integrating
item-based collaborative information for this joint task, we present an
alternative factorized model that could better evaluate the ranks of those
items with sparse information for the given query-user pair. In addition, we
suggest to employ a recently proposed scalable ranking learning algorithm,
namely BPR, to optimize the state-of-the-art approach, $Latent$ $Collaborative$
$Retrieval$ model, instead of the original learning algorithm. The experimental
results on two real-world datasets, (i.e. \emph{Last.fm}, \emph{Yelp}),
demonstrate the efficiency and effectiveness of our proposed approach.
","[{'version': 'v1', 'created': 'Fri, 12 Dec 2014 06:32:47 GMT'}]",2014-12-15,"[['Yu', 'Lu', ''], ['Huang', 'Junming', ''], ['Liu', 'Chuang', ''], ['Zhang', 'Zike', '']]","['collaborative filtering', 'information retrieval', 'matrix factorization', 'recommender systems']"
19938,1209.4965,Yuan Li,Yuan Li,Structure theorem of square complex orthogonal design,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Square COD (complex orthogonal design) with size $[n, n, k]$ is an $n \times
n$ matrix $\mathcal{O}_z$, where each entry is a complex linear combination of
$z_i$ and their conjugations $z_i^*$, $i=1,\ldots, k$, such that
$\mathcal{O}_z^H \mathcal{O}_z = (|z_1|^2 + \ldots + |z_k|^2)I_n$. Closely
following the work of Hottinen and Tirkkonen, which proved an upper bound of
$k/n$ by making a crucial observation between square COD and group
representation, we prove the structure theorem of square COD.
","[{'version': 'v1', 'created': 'Sat, 22 Sep 2012 07:01:29 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Sep 2012 00:27:16 GMT'}, {'version': 'v3', 'created': 'Wed, 27 Feb 2013 02:27:48 GMT'}, {'version': 'v4', 'created': 'Mon, 4 Mar 2013 05:39:27 GMT'}, {'version': 'v5', 'created': 'Sun, 17 Mar 2013 01:09:58 GMT'}]",2013-03-19,"[['Li', 'Yuan', '']]","['square complex orthogonal design', 'complex orthogonaldesign', 'space-time block codes', 'representation theory']"
19939,1504.02833,Alireza Goudarzi,"Jens B\""urger, Alireza Goudarzi, Darko Stefanovic, Christof Teuscher",Hierarchical Composition of Memristive Networks for Real-Time Computing,,,,,cs.ET cond-mat.dis-nn cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Advances in materials science have led to physical instantiations of
self-assembled networks of memristive devices and demonstrations of their
computational capability through reservoir computing. Reservoir computing is an
approach that takes advantage of collective system dynamics for real-time
computing. A dynamical system, called a reservoir, is excited with a
time-varying signal and observations of its states are used to reconstruct a
desired output signal. However, such a monolithic assembly limits the
computational power due to signal interdependency and the resulting correlated
readouts. Here, we introduce an approach that hierarchically composes a set of
interconnected memristive networks into a larger reservoir. We use signal
amplification and restoration to reduce reservoir state correlation, which
improves the feature extraction from the input signals. Using the same number
of output signals, such a hierarchical composition of heterogeneous small
networks outperforms monolithic memristive networks by at least 20% on waveform
generation tasks. On the NARMA-10 task, we reduce the error by up to a factor
of 2 compared to homogeneous reservoirs with sigmoidal neurons, whereas single
memristive networks are unable to produce the correct result. Hierarchical
composition is key for solving more complex tasks with such novel nano-scale
hardware.
","[{'version': 'v1', 'created': 'Sat, 11 Apr 2015 04:24:07 GMT'}, {'version': 'v2', 'created': 'Sun, 26 Apr 2015 00:34:12 GMT'}]",2015-04-28,"[['Bürger', 'Jens', ''], ['Goudarzi', 'Alireza', ''], ['Stefanovic', 'Darko', ''], ['Teuscher', 'Christof', '']]","['Memristive devices', 'Memristive networks', 'Timeseries processing', 'Reservoir computing']"
19940,1305.1146,DaoShun Wang,"Daoshun Wang, Ziwei Ye, Xiaobo Li",How to Collaborate between Threshold Schemes,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Threshold schemes have been used to protect secrets by distributing shares to
participants. To protect two secrets, we can use two separate traditional
schemes, say, a (t1, n1) scheme and a (t2, n2) scheme. If there are u
(<=min(t1, t2)) participants involved in both schemes, each of these u
participants must keep two different shares. This paper proposes a method that
allows each common participant to keep only one share. Our method constructs
two polynomials with u common crossover points. We give theoretical details and
two demonstrative examples. This algorithm can also handle the collaboration
between more than two schemes.
","[{'version': 'v1', 'created': 'Mon, 6 May 2013 10:42:38 GMT'}]",2013-05-07,"[['Wang', 'Daoshun', ''], ['Ye', 'Ziwei', ''], ['Li', 'Xiaobo', '']]","['key management', 'secret sharing', 'threshold scheme', 'polynomial', 'interpolation', 'crossover']"
19941,1305.7376,Jean-Florent Raymond,"Jean-Florent Raymond, Dimitrios M. Thilikos",Polynomial Gap Extensions of the Erd\H{o}s-P\'osa Theorem,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a graph $H$, we denote by ${\cal M}(H)$ all graphs that can be
contracted to $H$. The following extension of the Erd\H{o}s-P\'osa Theorem
holds: for every $h$-vertex planar graph $H$, there exists a function $f_{H}$
such that every graph $G$, either contains $k$ disjoint copies of graphs in
${\cal M}(H)$, or contains a set of $f_{H}(k)$ vertices meeting every subgraph
of $G$ that belongs in ${\cal M}(H)$. In this paper we prove that this is the
case for every graph $H$ of pathwidth at most 2 and, in particular, that
$f_{H}(k) = 2^{O(h^2)}\cdot k^{2}\cdot \log k$. As a main ingredient of the
proof of our result, we show that for every graph $H$ on $h$ vertices and
pathwidth at most 2, either $G$ contains $k$ disjoint copies of $H$ as a minor
or the treewidth of $G$ is upper-bounded by $2^{O(h^2)}\cdot k^{2}\cdot \log
k$. We finally prove that the exponential dependence on $h$ in these bounds can
be avoided if $H=K_{2,r}$. In particular, we show that $f_{K_{2,r}}=O(r^2\cdot
k^2)$
","[{'version': 'v1', 'created': 'Fri, 31 May 2013 12:29:13 GMT'}, {'version': 'v2', 'created': 'Sat, 8 Jun 2013 16:51:52 GMT'}]",2013-06-11,"[['Raymond', 'Jean-Florent', ''], ['Thilikos', 'Dimitrios M.', '']]","['Treewidth', 'Graph Minors', 'Erd˝os–P´osa Theorem']"
19942,0805.1696,Manuel Cebrian,"Manuel Cebrian, Manuel Alfonseca and Alfonso Ortega",Grammatical Evolution with Restarts for Fast Fractal Generation,"26 pages, 13 figures, Extended version of the paper presented at
  ANNIE'04",,,,cs.NE cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a previous work, the authors proposed a Grammatical Evolution algorithm to
automatically generate Lindenmayer Systems which represent fractal curves with
a pre-determined fractal dimension. This paper gives strong statistical
evidence that the probability distributions of the execution time of that
algorithm exhibits a heavy tail with an hyperbolic probability decay for long
executions, which explains the erratic performance of different executions of
the algorithm. Three different restart strategies have been incorporated in the
algorithm to mitigate the problems associated to heavy tail distributions: the
first assumes full knowledge of the execution time probability distribution,
the second and third assume no knowledge. These strategies exploit the fact
that the probability of finding a solution in short executions is
non-negligible and yield a severe reduction, both in the expected execution
time (up to one order of magnitude) and in its variance, which is reduced from
an infinite to a finite value.
","[{'version': 'v1', 'created': 'Mon, 12 May 2008 17:55:59 GMT'}, {'version': 'v2', 'created': 'Fri, 15 Oct 2010 15:30:53 GMT'}]",2010-10-18,"[['Cebrian', 'Manuel', ''], ['Alfonseca', 'Manuel', ''], ['Ortega', 'Alfonso', '']]","['Fractal Generation', 'Grammatical Evolution', 'Randomized Algorithm', 'Heavy Tail Distribution', 'Restart Strategy']"
19943,1712.04196,Deena P. Francis,Deena P. Francis and Kumudha Raimond,"Empirical Evaluation of Kernel PCA Approximation Methods in
  Classification Tasks",,,,,cs.LG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Kernel Principal Component Analysis (KPCA) is a popular dimensionality
reduction technique with a wide range of applications. However, it suffers from
the problem of poor scalability. Various approximation methods have been
proposed in the past to overcome this problem. The Nystr\""om method, Randomized
Nonlinear Component Analysis (RNCA) and Streaming Kernel Principal Component
Analysis (SKPCA) were proposed to deal with the scalability issue of KPCA.
Despite having theoretical guarantees, their performance in real world learning
tasks have not been explored previously. In this work the evaluation of SKPCA,
RNCA and Nystr\""om method for the task of classification is done for several
real world datasets. The results obtained indicate that SKPCA based features
gave much better classification accuracy when compared to the other methods for
a very large dataset.
","[{'version': 'v1', 'created': 'Tue, 12 Dec 2017 10:02:08 GMT'}]",2017-12-13,"[['Francis', 'Deena P.', ''], ['Raimond', 'Kumudha', '']]","['Dimensionality reduction', 'Kernel Principal Component Analysis', 'Streaming Kernel PCA', 'Randomized Non-linear Component Analysis', 'Nystr¨om method', 'Classification']"
19944,1212.4589,Deepali Virmani,Deepali Virmani and Stabir Jain,"Clustering Based Topology Control Protocol for Data Delivery in Wireless
  Sensor Networks","12 pages, 4 figures; International Journal of Computer Science and
  Issues. January 2013",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The issue of optimizing the limited and often non-renewable energy of sensor
nodes due to its direct impact on network lifetime dominates every aspect of
wireless sensor networks. Existing techniques for optimizing energy consumption
are based on exploiting node redundancy, adaptive radio transmission power and
topology control. Topology control protocols have a significant impact on
network lifetime, available energy and connectivity. In this paper we classify
sensor nodes as strong and weak nodes based on their residual energy as well as
operational lifetime and propose a Clustering based topology control protocol
(CTCP) which extends network lifetime while guarantying the minimum
connectivity. Extensive simulations in Java-Simulator (J-Sim) show that our
proposed protocol outperforms the existing protocols in terms of various
performance metrics life network lifetime, average delay and minimizes energy
utilization.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2012 07:47:27 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Jan 2013 05:30:19 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Jan 2013 04:44:51 GMT'}]",2013-01-24,"[['Virmani', 'Deepali', ''], ['Jain', 'Stabir', '']]","['Clustering', 'Operational lifetime', 'Strong & weak nodes', 'Topology control']"
19945,1306.3084,Doriane Ibarra,"Jorge Hernandez (CMM), Beatriz Marcotegui (CMM)","Segmentation et Interpr\'etation de Nuages de Points pour la
  Mod\'elisation d'Environnements Urbains",,"Revue fran\c{c}aise de photogrammetrie et de t\'el\'edection 191
  (2008) 28-35",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dans cet article, nous pr\'esentons une m\'ethode pour la d\'etection et la
classification d'artefacts au niveau du sol, comme phase de filtrage
pr\'ealable \`a la mod\'elisation d'environnements urbains. La m\'ethode de
d\'etection est r\'ealis\'ee sur l'image profondeur, une projection de nuage de
points sur un plan image o\`u la valeur du pixel correspond \`a la distance du
point au plan. En faisant l'hypoth\`ese que les artefacts sont situ\'es au sol,
ils sont d\'etect\'es par une transformation de chapeau haut de forme par
remplissage de trous sur l'image de profondeur. Les composantes connexes ainsi
obtenues, sont ensuite caract\'eris\'ees et une analyse des variables est
utilis\'ee pour la s\'election des caract\'eristiques les plus discriminantes.
Les composantes connexes sont donc classifi\'ees en quatre cat\'egories
(lampadaires, pi\'etons, voitures et ""Reste"") \`a l'aide d'un algorithme
d'apprentissage supervis\'e. La m\'ethode a \'et\'e test\'ee sur des nuages de
points de la ville de Paris, en montrant de bons r\'esultats de d\'etection et
de classification dans l'ensemble de donn\'ees.---In this article, we present a
method for detection and classification of artifacts at the street level, in
order to filter cloud point, facilitating the urban modeling process. Our
approach exploits 3D information by using range image, a projection of 3D
points onto an image plane where the pixel intensity is a function of the
measured distance between 3D points and the plane. By assuming that the
artifacts are on the ground, they are detected using a Top-Hat of the hole
filling algorithm of range images. Then, several features are extracted from
the detected connected components and a stepwise forward variable/model
selection by using the Wilk's Lambda criterion is performed. Afterward, CCs are
classified in four categories (lampposts, pedestrians, cars and others) by
using a supervised machine learning method. The proposed method was tested on
cloud points of Paris, and have shown satisfactory results on the whole
dataset.
","[{'version': 'v1', 'created': 'Thu, 13 Jun 2013 11:27:58 GMT'}]",2013-06-14,"[['Hernandez', 'Jorge', '', 'CMM'], ['Marcotegui', 'Beatriz', '', 'CMM']]","['Urban scene modeling', 'Segmentation', 'Morphology Mathematical morphology', 'Artifact detection', 'Classification']"
19946,1303.5938,Paul Ralph,Paul Ralph,The Two Paradigms of Software Design,"38 pages, 3 tables, 4 figures. A previous version of this paper was
  published at the 2010 Mediterranean Conference on Information Systems",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The dominant view of design in information systems and software engineering,
the Rational Design Paradigm, views software development as a methodical,
plan-centered, approximately rational process of optimizing a design candidate
for known constraints and objectives. This paper synthesizes an Alternative
Design Paradigm, which views software development as an amethodical,
improvisational, emotional process of simultaneously framing the problem and
building artifacts to address it. These conflicting paradigms are
manifestations of a deeper philosophical conflict between rationalism and
empiricism. The paper clarifies the nature, components and assumptions of each
paradigm and explores the implications of the paradigmatic conflict for
research, practice and education.
","[{'version': 'v1', 'created': 'Sun, 24 Mar 2013 11:21:16 GMT'}]",2013-03-26,"[['Ralph', 'Paul', '']]","['Information Systems Development', 'Software Engineering', 'Rationalism', 'Empiricism']"
19947,1606.04000,Douglas Summers Stay,"Douglas Summers-Stay, Clare Voss and Taylor Cassidy","Using a Distributional Semantic Vector Space with a Knowledge Base for
  Reasoning in Uncertain Conditions",,"Biologically Inspired Cognitive Architectures (2016), pp. 34-44",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The inherent inflexibility and incompleteness of commonsense knowledge bases
(KB) has limited their usefulness. We describe a system called Displacer for
performing KB queries extended with the analogical capabilities of the word2vec
distributional semantic vector space (DSVS). This allows the system to answer
queries with information which was not contained in the original KB in any
form. By performing analogous queries on semantically related terms and mapping
their answers back into the context of the original query using displacement
vectors, we are able to give approximate answers to many questions which, if
posed to the KB alone, would return no results.
  We also show how the hand-curated knowledge in a KB can be used to increase
the accuracy of a DSVS in solving analogy problems. In these ways, a KB and a
DSVS can make up for each other's weaknesses.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2016 15:45:00 GMT'}]",2016-06-14,"[['Summers-Stay', 'Douglas', ''], ['Voss', 'Clare', ''], ['Cassidy', 'Taylor', '']]","['semantic vector space', 'knowledge base', 'analogy']"
19948,1009.4219,Tarek Rabbani,"Laurent El Ghaoui, Vivian Viallon, Tarek Rabbani","Safe Feature Elimination for the LASSO and Sparse Supervised Learning
  Problems",Submitted to JMLR in April 2011,,,,cs.LG cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a fast method to eliminate features (variables) in l1 -penalized
least-square regression (or LASSO) problems. The elimination of features leads
to a potentially substantial reduction in running time, specially for large
values of the penalty parameter. Our method is not heuristic: it only
eliminates features that are guaranteed to be absent after solving the LASSO
problem. The feature elimination step is easy to parallelize and can test each
feature for elimination independently. Moreover, the computational effort of
our method is negligible compared to that of solving the LASSO problem -
roughly it is the same as single gradient step. Our method extends the scope of
existing LASSO algorithms to treat larger data sets, previously out of their
reach. We show how our method can be extended to general l1 -penalized convex
problems and present preliminary results for the Sparse Support Vector Machine
and Logistic Regression problems.
","[{'version': 'v1', 'created': 'Tue, 21 Sep 2010 21:13:15 GMT'}, {'version': 'v2', 'created': 'Wed, 18 May 2011 16:38:10 GMT'}]",2011-05-19,"[['Ghaoui', 'Laurent El', ''], ['Viallon', 'Vivian', ''], ['Rabbani', 'Tarek', '']]","['Sparse Regression', 'LASSO', 'Feature Elimination', 'SVM', 'Logistic Regression']"
19949,1011.0604,Supriya Kapoor,Tim A. Majchrzak,Improving the Technical Aspects of Software Testing in Enterprises,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many software developments projects fail due to quality problems. Software
testing enables the creation of high quality software products. Since it is a
cumbersome and expensive task, and often hard to manage, both its technical
background and its organizational implementation have to be well founded. We
worked with regional companies that develop software in order to learn about
their distinct weaknesses and strengths with regard to testing. Analyzing and
comparing the strengths, we derived best practices. In this paper we explain
the project's background and sketch the design science research methodology
used. We then introduce a graphical categorization framework that helps
companies in judging the applicability of recommendations. Eventually, we
present details on five recommendations for tech-nical aspects of testing. For
each recommendation we give im-plementation advice based on the categorization
framework.
","[{'version': 'v1', 'created': 'Tue, 2 Nov 2010 12:54:18 GMT'}]",2015-03-17,"[['Majchrzak', 'Tim A.', '']]","['Software testing', 'testing', 'software quality', 'design science', 'IT alignment', 'process optimization', 'technical aspects']"
19950,1412.6125,Mahdi Barzegar Khalilsarai,"Mohsen Joneidi, Mahdi Barzegar Khalilsarai, Alireza Zaeemzadeh,
  Nazanin Rahnavard",Matrix Coherency Graph: A Tool for Improving Sparse Coding Performance,"5 pages, 8 figures, going to be submitted to SampTA 2015",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Exact recovery of a sparse solution for an underdetermined system of linear
equations implies full search among all possible subsets of the dictionary,
which is computationally intractable, while l1 minimization will do the job
when a Restricted Isometry Property holds for the dictionary. Yet, practical
sparse recovery algorithms may fail to recover the vector of coefficients even
when the dictionary deviates from the RIP only slightly. To enjoy l1
minimization guarantees in a wider sense, a method based on a combination of
full-search and l1 minimization is presented. The idea is based on partitioning
the dictionary into atoms which are in some sense well-conditioned and those
which are ill-conditioned. Inspired by that, a matrix coherency graph is
introduced which is a tool extracted by the structure of the dictionary. This
tool can be used for decreasing the greediness of sparse coding algorithms so
that recovery will be more reliable. We have modified the IRLS algorithm by
applying the proposed method on it and simulation results show that the
modified version performs quite better than the original algorithm.
","[{'version': 'v1', 'created': 'Sun, 30 Nov 2014 08:04:09 GMT'}]",2014-12-22,"[['Joneidi', 'Mohsen', ''], ['Khalilsarai', 'Mahdi Barzegar', ''], ['Zaeemzadeh', 'Alireza', ''], ['Rahnavard', 'Nazanin', '']]","['l1minimization', 'RestrictedIsometryProperty', 'matrix coherency graph', 'IRLS']"
19951,1702.07831,Bocong Chen,"Bocong Chen, Hongwei Liu",New constructions of MDS codes with complementary duals,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linear complementary-dual (LCD for short) codes are linear codes that
intersect with their duals trivially. LCD codes have been used in certain
communication systems. It is recently found that LCD codes can be applied in
cryptography. This application of LCD codes renewed the interest in the
construction of LCD codes having a large minimum distance. MDS codes are
optimal in the sense that the minimum distance cannot be improved for given
length and code size. Constructing LCD MDS codes is thus of significance in
theory and practice. Recently, Jin (\cite{Jin}, IEEE Trans. Inf. Theory, 2016)
constructed several classes of LCD MDS codes through generalized Reed-Solomon
codes. In this paper, a different approach is proposed to obtain new LCD MDS
codes from generalized Reed-Solomon codes. Consequently, new code constructions
are provided and certain previously known results in \cite{Jin} are extended.
","[{'version': 'v1', 'created': 'Sat, 25 Feb 2017 03:48:40 GMT'}]",2017-02-28,"[['Chen', 'Bocong', ''], ['Liu', 'Hongwei', '']]","['Linear complementary dual', 'generalized Reed-Solomon code', 'MDS code']"
19952,0802.3626,Sudhakar Sahoo,"Birendra Kumar Nayak, Sudhakar Sahoo, Sushant Kumar Rout","Color Graphs: An Efficient Model For Two-Dimensional Cellular Automata
  Linear Rules","14 pages, presented at Orissa Mathematical Society Conference, 2008",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two-dimensional nine neighbor hood rectangular Cellular Automata rules can be
modeled using many different techniques like Rule matrices, State Transition
Diagrams, Boolean functions, Algebraic Normal Form etc. In this paper, a new
model is introduced using color graphs to model all the 512 linear rules. The
graph theoretic properties therefore studied in this paper simplifies the
analysis of all linear rules in comparison with other ways of its study.
","[{'version': 'v1', 'created': 'Mon, 25 Feb 2008 13:54:50 GMT'}]",2008-02-28,"[['Nayak', 'Birendra Kumar', ''], ['Sahoo', 'Sudhakar', ''], ['Rout', 'Sushant Kumar', '']]","['Cellular Automata', 'Boolean functions', 'Graphs', 'Linear rules', 'Adjacency matrix']"
19953,0709.0099,Avraham Trahtman N,A. N. Trahtman,The road coloring problem,"9 pages, correct typos",,,,cs.DM,,"  The synchronizing word of deterministic automaton is a word in the alphabet
of colors (considered as letters) of its edges that maps the automaton to a
single state. A coloring of edges of a directed graph is synchronizing if the
coloring turns the graph into deterministic finite automaton possessing a
synchronizing word.
  The road coloring problem is a problem of synchronizing coloring of directed
finite strongly connected graph with constant outdegree of all its vertices if
the greatest common divisor of lengths of all its cycles is one. The problem
was posed by Adler, Goodwyn and Weiss over 30 years ago and evoked a noticeable
interest among the specialists in theory of graphs, deterministic automata and
symbolic dynamics. The problem is described even in ""Wikipedia"" - the popular
Internet Encyclopedia. The positive solution of the road coloring problem is
presented.
","[{'version': 'v1', 'created': 'Sun, 2 Sep 2007 10:08:46 GMT'}, {'version': 'v2', 'created': 'Sun, 16 Sep 2007 16:15:52 GMT'}, {'version': 'v3', 'created': 'Wed, 24 Oct 2007 16:52:54 GMT'}, {'version': 'v4', 'created': 'Fri, 21 Dec 2007 08:07:18 GMT'}]",2011-11-10,"[['Trahtman', 'A. N.', '']]","['road coloring problem', 'graph', 'deterministic finite automaton', 'synchronization']"
19954,1206.3320,Zi-Ke Zhang Mr.,"Jinhu Liu, Chengcheng Yang, Zi-Ke Zhang",A two-step Recommendation Algorithm via Iterative Local Least Squares,,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recommender systems can change our life a lot and help us select suitable and
favorite items much more conveniently and easily. As a consequence, various
kinds of algorithms have been proposed in last few years to improve the
performance. However, all of them face one critical problem: data sparsity. In
this paper, we proposed a two-step recommendation algorithm via iterative local
least squares (ILLS). Firstly, we obtain the ratings matrix which is
constructed via users' behavioral records, and it is normally very sparse.
Secondly, we preprocess the ""ratings"" matrix through ProbS which can convert
the sparse data to a dense one. Then we use ILLS to estimate those missing
values. Finally, the recommendation list is generated. Experimental results on
the three datasets: MovieLens, Netflix, RYM, suggest that the proposed method
can enhance the algorithmic accuracy of AUC. Especially, it performs much
better in dense datasets. Furthermore, since this methods can improve those
missing value more accurately via iteration which might show light in
discovering those inactive users' purchasing intention and eventually solving
cold-start problem.
","[{'version': 'v1', 'created': 'Thu, 14 Jun 2012 20:23:24 GMT'}]",2012-06-18,"[['Liu', 'Jinhu', ''], ['Yang', 'Chengcheng', ''], ['Zhang', 'Zi-Ke', '']]","['Probabilistic Spreading', 'Iterative Local Least Squares', 'Recommendation; Data Sparsity']"
19955,1305.0936,Boumahdi Fatima Mme,Boumahdi Fatima,Endow a service-oriented architecture by a decisional aspect,,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Service oriented architecture is more and more used in the companies, The
importance of the service orientation and its advantages with the information
system of the company, confront us to a new challenge. It is primarily to
ensure the decision aspect of the information system of company by adopting
Services Orientated Architecture like support architecture. This engineering
must ensure on the one hand the flexibility of the information system and on
the oth-er hand, avoids the redevelopment of the system by the decisions
request. In the actual position, several obstacles force the installation of
the SOA within the company. It is basically a question of the lack of method to
be implemented to define the services architecture within the information
system of the company which takes account the decisional aspect. Moreover,
there's no existing works which treat this challenge. On the basis of these
notes, we are interested, in this paper, on the develop-ment of a
three-dimensional new architecture for the integration of the deci-sional
aspect in SOA architectures, so that they are used perfectly. The proposal
takes support, mainly, on the use of a coupling MAS-SOA. To demonstrate the
application of our proposition, we use two study cases: project management and
Evapo-transpiration.
","[{'version': 'v1', 'created': 'Sat, 4 May 2013 16:49:51 GMT'}]",2013-05-07,"[['Fatima', 'Boumahdi', '']]","['SOA (Service Oriented Architecture)', 'MAS (Multi Agents System)', 'Decision Support System', 'Project Management', 'Evapo-transpiration']"
19956,1802.08250,Lu\'is Alexandre,Abel S. Zacarias and Lu\'is A. Alexandre,"SeNA-CNN: Overcoming Catastrophic Forgetting in Convolutional Neural
  Networks by Selective Network Augmentation",,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Lifelong learning aims to develop machine learning systems that can learn new
tasks while preserving the performance on previous learned tasks. In this paper
we present a method to overcome catastrophic forgetting on convolutional neural
networks, that learns new tasks and preserves the performance on old tasks
without accessing the data of the original model, by selective network
augmentation. The experiment results showed that SeNA-CNN, in some scenarios,
outperforms the state-of-art Learning without Forgetting algorithm. Results
also showed that in some situations it is better to use SeNA-CNN instead of
training a neural network using isolated learning.
","[{'version': 'v1', 'created': 'Thu, 22 Feb 2018 10:23:36 GMT'}, {'version': 'v2', 'created': 'Wed, 9 May 2018 08:59:04 GMT'}]",2018-05-10,"[['Zacarias', 'Abel S.', ''], ['Alexandre', 'Luís A.', '']]","['Lifelong Learning', 'Catastrophic Forgetting', 'ConvolutionalNeural Networks', 'Supervised Learning']"
19957,1704.05393,Michela Fazzolari,"Michela Fazzolari, Marinella Petrocchi, Alessandro Tommasi, Cesare
  Zavattari","Mining Worse and Better Opinions. Unsupervised and Agnostic Aggregation
  of Online Reviews",,,,,cs.SI cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel approach for aggregating online reviews,
according to the opinions they express. Our methodology is unsupervised - due
to the fact that it does not rely on pre-labeled reviews - and it is agnostic -
since it does not make any assumption about the domain or the language of the
review content. We measure the adherence of a review content to the domain
terminology extracted from a review set. First, we demonstrate the
informativeness of the adherence metric with respect to the score associated
with a review. Then, we exploit the metric values to group reviews, according
to the opinions they express. Our experimental campaign has been carried out on
two large datasets collected from Booking and Amazon, respectively.
","[{'version': 'v1', 'created': 'Tue, 18 Apr 2017 15:20:25 GMT'}]",2017-04-19,"[['Fazzolari', 'Michela', ''], ['Petrocchi', 'Marinella', ''], ['Tommasi', 'Alessandro', ''], ['Zavattari', 'Cesare', '']]","['Social Web mining', 'Online reviews aggregation', 'Adherencemetric', 'Domain terminology', 'Contrastive approach']"
19958,1802.06653,Emmanuel Hainry,"Emmanuel Hainry (CARTE), Romain P\'echoux (CARTE)",A Type-Based Complexity Analysis of Object Oriented Programs,"Information and Computation, Elsevier, A Para\^itre, pp.60",,,,cs.PL cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A type system is introduced for a generic Object Oriented programming
language in order to infer resource upper bounds. A sound andcomplete
characterization of the set of polynomial time computable functions is
obtained. As a consequence, the heap-space and thestack-space requirements of
typed programs are also bounded polynomially. This type system is inspired by
previous works on ImplicitComputational Complexity, using tiering and
non-interference techniques. The presented methodology has several advantages.
First, itprovides explicit big $O$ polynomial upper bounds to the programmer,
hence its use could allow the programmer to avoid memory errors.Second, type
checking is decidable in polynomial time. Last, it has a good expressivity
since it analyzes most object oriented featureslike inheritance, overload,
override and recursion. Moreover it can deal with loops guarded by objects and
can also be extended tostatements that alter the control flow like break or
return.
","[{'version': 'v1', 'created': 'Mon, 19 Feb 2018 14:46:36 GMT'}]",2018-02-20,"[['Hainry', 'Emmanuel', '', 'CARTE'], ['Péchoux', 'Romain', '', 'CARTE']]","['Object Oriented Program', 'Type system', 'complexity', 'polynomialtime']"
19959,1208.6516,Joseph  Salmon,Joseph Salmon and Rebecca Willett and Ery Arias-Castro,A two-stage denoising filter: the preprocessed Yaroslavsky filter,,,,,cs.CV math.ST stat.TH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a simple image noise removal method which combines a
preprocessing step with the Yaroslavsky filter for strong numerical, visual,
and theoretical performance on a broad class of images. The framework developed
is a two-stage approach. In the first stage the image is filtered with a
classical denoising method (e.g., wavelet or curvelet thresholding). In the
second stage a modification of the Yaroslavsky filter is performed on the
original noisy image, where the weights of the filters are governed by pixel
similarities in the denoised image from the first stage. Similar prefiltering
ideas have proved effective previously in the literature, and this paper
provides theoretical guarantees and important insight into why prefiltering can
be effective. Empirically, this simple approach achieves very good performance
for cartoon images, and can be computed much more quickly than current
patch-based denoising algorithms.
","[{'version': 'v1', 'created': 'Fri, 31 Aug 2012 15:08:22 GMT'}]",2015-03-20,"[['Salmon', 'Joseph', ''], ['Willett', 'Rebecca', ''], ['Arias-Castro', 'Ery', '']]","['Image denoising', 'Yaroslavsky filter', 'Wavelets', 'Curvelets', 'Nonlocal Means']"
19960,1802.09442,Valentina Gliozzi,Valentina Gliozzi and Kim Plunkett,"Self-organizing maps and generalization: an algorithmic description of
  Numerosity and Variability Effects","24 pages, 3 figures",,,,cs.AI q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Category, or property generalization is a central function in the human
cognition. It plays a crucial role in a variety of domains, such as learning,
everyday reasoning, specialized reasoning, and decision making. Judging the
content of a dish as edible, a hormone level as healthy, a building as
belonging to the same architectural style as previously seen buildings, are
examples of category generalization. In this paper, we propose self-organizing
maps as candidates to explain the psychological mechanisms underlying category
generalization. Self-organizing maps are psychologically and biologically
plausible neural network models that learn after limited exposure to positive
category examples, without any need of contrastive information. Just like
humans. They reproduce human behavior in category generalization, in particular
for what concerns the well-known Numerosity and Variability effects, which are
usually explained with Bayesian tools. Where category generalization is
concerned, self-organizing maps are good candidates to bridge the gap between
the computational level of analysis in Marr's hierarchy (where Bayesian models
are situated) and the algorithmic level of aanalysis in Marr's hierarchy (where
Bayesian models are situated) and the algorithmic level of analysis in which
plausible mechanisms are described.
","[{'version': 'v1', 'created': 'Mon, 26 Feb 2018 16:38:42 GMT'}]",2018-02-27,"[['Gliozzi', 'Valentina', ''], ['Plunkett', 'Kim', '']]","['category generalization', 'self-organizing maps', 'connectionist']"
19961,1312.3347,Ousmane Thiare OT,"M. Naimi, O. Thiare",A Distributed Deadlock Free Quorum Based Algorithm for Mutual Exclusion,"7 pages, 9 figures","(IJCSIS) International Journal of Computer Science and Information
  Security, Vol. 11, No. 8, August 2013",,,cs.DC,http://creativecommons.org/licenses/by/3.0/,"  Quorum based mutual exclusion algorithms enjoy many advantages such as low
message complexity and high failure resiliency. The use of quorums is a well
known approach to achieving mutual exclusion in distributed environments.
Several distributed based quorum mutual exclusion was presented.
","[{'version': 'v1', 'created': 'Wed, 11 Dec 2013 21:14:44 GMT'}]",2013-12-13,"[['Naimi', 'M.', ''], ['Thiare', 'O.', '']]","['component; Distributed Mutual Exclusion', 'Quroum', 'Logical ring', 'free deadlock;']"
19962,1307.3144,Biswapratapsingh Sahoo,Biswapratapsingh Sahoo,"Performance Comparison of Packet Scheduling Algorithms for Video Traffic
  in LTE Cellular Network",,"International Journal of Mobile Network Communications &
  Telematics ( IJMNCT) Vol. 3, No.3, PP 09-18, June 2013",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we have studied downlink packet scheduling algorithms proposed
for LTE cellular networks. The study emphasize on three most promising
scheduling algorithms such as: FLS, EXP rule and LOG rule. The performance of
these three algorithms is conducted over video traffic in a vehicular
environment using LTE-Sim simulator. The simulation was setup with varying
number of users from 10 - 60 in fixed bounded regions of 1 km radius. The main
goal this study is to provide results that will help in the design process of
packet scheduler for LTE cellular networks, aiming to get better overall
performance users. Simulation results show that, the FLS scheme outperforms in
terms of average system throughput, average packet delay, PLR; and with a
satisfactory level of fairness index.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2013 15:41:25 GMT'}]",2014-08-27,"[['Sahoo', 'Biswapratapsingh', '']]","['Cellular Networks', 'Long Term Evolution (LTE)', 'Packet Scheduling', 'Performance  Evaluation']"
19963,1002.2222,Rdv Ijcsis,"Mosleh M. Abu Alhaj, M. Halaiyqah, Muhannad A. Abu Hashem, Adnan A.
  Hnaif, O. Abouabdalla, and Ahmed M. Manasrah","An innovative platform to improve the performance of exact string
  matching algorithms","IEEE format, International Journal of Computer Science and
  Information Security, IJCSIS January 2010, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 7, No. 1, pp. 280-283, January 2010, USA",,"Journal of Computer Science, ISSN 1947 5500",cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Exact String Matching is an essential issue in many computer science
applications. Unfortunately, the performance of Exact String Matching
algorithms, namely, executing time, does not address the needs of these
applications. This paper proposes a general platform for improving the existing
Exact String Matching algorithms executing time, called the PXSMAlg platform.
The function of this platform is to parallelize the Exact String Matching
algorithms using the MPI model over the Master or Slaves paradigms. The PXSMAlg
platform parallelization process is done by dividing the Text into several
parts and working on these parts simultaneously. This improves the executing
time of the Exact String Matching algorithms. We have simulated the PXSMAlg
platform in order to show its competence, through applying the Quick Search
algorithm on the PXSMAlg platform. The simulation result showed significant
improvement in the Quick Search executing time, and therefore extreme
competence in the PXSMAlg platform.
","[{'version': 'v1', 'created': 'Thu, 11 Feb 2010 20:31:03 GMT'}]",2010-02-12,"[['Alhaj', 'Mosleh M. Abu', ''], ['Halaiyqah', 'M.', ''], ['Hashem', 'Muhannad A. Abu', ''], ['Hnaif', 'Adnan A.', ''], ['Abouabdalla', 'O.', ''], ['Manasrah', 'Ahmed M.', '']]","['String matching', 'Parallel', 'Quick search']"
19964,1409.6182,Josep Silva,Juli\'an Alarte and Josep Silva,A Benchmark Suite for Template Detection and Content Extraction,"13 pages, 3 tables",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Template detection and content extraction are two of the main areas of
information retrieval applied to the Web. They perform different analyses over
the structure and content of webpages to extract some part of the document.
However, their objective is different. While template detection identifies the
template of a webpage (usually comparing with other webpages of the same
website), content extraction identifies the main content of the webpage
discarding the other part. Therefore, they are somehow complementary, because
the main content is not part of the template. It has been measured that
templates represent between 40% and 50% of data on the Web. Therefore,
identifying templates is essential for indexing tasks because templates usually
contain irrelevant information such as advertisements, menus and banners.
Processing and storing this information is likely to lead to a waste of
resources (storage space, bandwidth, etc.). Similarly, identifying the main
content is essential for many information retrieval tasks. In this paper, we
present a benchmark suite to test different approaches for template detection
and content extraction. The suite is public, and it contains real heterogeneous
webpages that have been labelled so that different techniques can be suitable
(and automatically) compared.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 14:21:33 GMT'}, {'version': 'v2', 'created': 'Tue, 23 Sep 2014 23:05:29 GMT'}, {'version': 'v3', 'created': 'Tue, 14 Aug 2018 14:33:01 GMT'}, {'version': 'v4', 'created': 'Mon, 30 Nov 2020 23:19:23 GMT'}, {'version': 'v5', 'created': 'Sun, 17 Jul 2022 01:22:34 GMT'}]",2022-07-19,"[['Alarte', 'Julián', ''], ['Silva', 'Josep', '']]","['Template Detection', 'Content Extraction', 'Benchmark Suite', 'Information Retrieval']"
19965,1412.6392,Leonardo Tizzei,Kiran Mantripragada and Alecio Binotto and Leonardo P. Tizzei,"A Self-adaptive Auto-scaling Method for Scientific Applications on HPC
  Environments and Clouds","Part of ADAPT Workshop proceedings, 2015 (arXiv:1412.2347)",,,ADAPT/2015/01,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  High intensive computation applications can usually take days to months to
finish an execution. During this time, it is common to have variations of the
available resources when considering that such hardware is usually shared among
a plurality of researchers/departments within an organization. On the other
hand, High Performance Clusters can take advantage of Cloud Computing bursting
techniques for the execution of applications together with the on-premise
resources. In order to meet deadlines, high intensive computational
applications can use the Cloud to boost their performance when they are data
and task parallel. This article presents an ongoing work towards the use of
extended resources of an HPC execution platform together with Cloud. We propose
an unified view of such heterogeneous environments and a method that monitors,
predicts the application execution time, and dynamically shifts part of the
domain -- previously running in local HPC hardware -- to be computed on the
Cloud, meeting then a specific deadline. The method is exemplified along with a
seismic application that, at runtime, adapts itself to move part of the
processing to the Cloud (in a movement called bursting) and also auto-scales
(the moved part) over cloud nodes. Our preliminary results show that there is
an expected overhead for performing this movement and for synchronizing
results, but our outcomes demonstrate it is an important feature for meeting
deadlines in the case an on-premise cluster is overloaded or cannot provide the
capacity needed for a particular project.
","[{'version': 'v1', 'created': 'Fri, 19 Dec 2014 15:48:42 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Jan 2015 18:15:46 GMT'}, {'version': 'v3', 'created': 'Mon, 26 Jan 2015 18:09:33 GMT'}]",2015-01-27,"[['Mantripragada', 'Kiran', ''], ['Binotto', 'Alecio', ''], ['Tizzei', 'Leonardo P.', '']]","['Cloud computing', 'Self-adaptation', 'Load-balancing', 'Cloud']"
19966,1406.5675,Shusen Wang,"Shusen Wang, Luo Luo, Zhihua Zhang","SPSD Matrix Approximation vis Column Selection: Theories, Algorithms,
  and Extensions","Journal of Machine Learning Research, 2016",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Symmetric positive semidefinite (SPSD) matrix approximation is an important
problem with applications in kernel methods. However, existing SPSD matrix
approximation methods such as the Nystr\""om method only have weak error bounds.
In this paper we conduct in-depth studies of an SPSD matrix approximation model
and establish strong relative-error bounds. We call it the prototype model for
it has more efficient and effective extensions, and some of its extensions have
high scalability. Though the prototype model itself is not suitable for
large-scale data, it is still useful to study its properties, on which the
analysis of its extensions relies.
  This paper offers novel theoretical analysis, efficient algorithms, and a
highly accurate extension. First, we establish a lower error bound for the
prototype model and improve the error bound of an existing column selection
algorithm to match the lower bound. In this way, we obtain the first optimal
column selection algorithm for the prototype model. We also prove that the
prototype model is exact under certain conditions. Second, we develop a simple
column selection algorithm with a provable error bound. Third, we propose a
so-called spectral shifting model to make the approximation more accurate when
the eigenvalues of the matrix decay slowly, and the improvement is
theoretically quantified. The spectral shifting method can also be applied to
improve other SPSD matrix approximation models.
","[{'version': 'v1', 'created': 'Sun, 22 Jun 2014 05:02:06 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Jan 2015 10:05:36 GMT'}, {'version': 'v3', 'created': 'Sat, 28 Mar 2015 07:43:49 GMT'}, {'version': 'v4', 'created': 'Sun, 11 Oct 2015 08:49:11 GMT'}, {'version': 'v5', 'created': 'Sun, 20 Dec 2015 09:47:37 GMT'}, {'version': 'v6', 'created': 'Fri, 20 May 2016 06:32:12 GMT'}]",2016-05-23,"[['Wang', 'Shusen', ''], ['Luo', 'Luo', ''], ['Zhang', 'Zhihua', '']]","['Matrix approximation', 'matrix factorization', 'kernel methods', 'the Nystr¨ommethod', 'spectral shifting']"
19967,1007.3157,Gregory  Karagiorgos,"John Alexandris, Gregory Karagiorgos 'and' Ioannis Stavrakakis",Enhanced Random Walk with Choice: An Empirical Study,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The random walk with choice is a well known variation to the random walk that
first selects a subset of $d$ neighbours nodes and then decides to move to the
node which maximizes the value of a certain metric; this metric captures the
number of (past) visits of the walk to the node. In this paper we propose an
enhancement to the random walk with choice by considering a new metric that
captures not only the actual visits to a given node, but also the intensity of
the visits to the neighbourhood of the node. We compare the random walk with
choice with its enhanced counterpart. Simulation results show a significant
improvement in cover time, maximum node load and load balancing, mainly in
random geometric graphs.
","[{'version': 'v1', 'created': 'Mon, 19 Jul 2010 14:35:50 GMT'}]",2010-07-20,"[['Alexandris', 'John', ''], ['Stavrakakis', ""Gregory Karagiorgos 'and' Ioannis"", '']]","['Random Walk', 'Power of Choice', 'Cover Time', 'Load Balancing', 'Wireless networks']"
19968,1702.01638,Xinyu Li,"Xinyu Li, Yanyi Zhang, Jianyu Zhang, Shuhong Chen, Ivan Marsic,
  Richard A. Farneth, Randall S. Burd",Concurrent Activity Recognition with Multimodal CNN-LSTM Structure,"14 pages, 12 figures, under review",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a system that recognizes concurrent activities from real-world
data captured by multiple sensors of different types. The recognition is
achieved in two steps. First, we extract spatial and temporal features from the
multimodal data. We feed each datatype into a convolutional neural network that
extracts spatial features, followed by a long-short term memory network that
extracts temporal information in the sensory data. The extracted features are
then fused for decision making in the second step. Second, we achieve
concurrent activity recognition with a single classifier that encodes a binary
output vector in which elements indicate whether the corresponding activity
types are currently in progress. We tested our system with three datasets from
different domains recorded using different sensors and achieved performance
comparable to existing systems designed specifically for those domains. Our
system is the first to address the concurrent activity recognition with
multisensory data using a single model, which is scalable, simple to train and
easy to deploy.
","[{'version': 'v1', 'created': 'Mon, 6 Feb 2017 15:01:45 GMT'}]",2017-02-07,"[['Li', 'Xinyu', ''], ['Zhang', 'Yanyi', ''], ['Zhang', 'Jianyu', ''], ['Chen', 'Shuhong', ''], ['Marsic', 'Ivan', ''], ['Farneth', 'Richard A.', ''], ['Burd', 'Randall S.', '']]","['Activity Recognition', 'Sensor Network', 'Multimodal', 'Deep Learning', 'Convolutional Neural Network', 'LSTM']"
19969,1504.04306,Sugata Sanyal,"Uday Kumar, Tuhin Borgohain, Sugata Sanyal",Comparative Analysis of Cryptography Library in IoT,"5 pages, 14 tables",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper aims to do a survey along with a comparative analysis of the
various cryptography libraries that are applicable in the field of Internet of
Things (IoT). The first half of the paper briefly introduces the various
cryptography libraries available in the field of cryptography along with a list
of all the algorithms contained within the libraries. The second half of the
paper deals with cryptography libraries specifically aimed for application in
the field of Internet of Things. The various libraries and their performance
analysis listed down in this paper are consolidated from various sources with
the aim of providing a single comprehensive repository for reference to the
various cryptography libraries and the comparative analysis of their features
in IoT.
","[{'version': 'v1', 'created': 'Thu, 16 Apr 2015 17:05:52 GMT'}]",2015-04-17,"[['Kumar', 'Uday', ''], ['Borgohain', 'Tuhin', ''], ['Sanyal', 'Sugata', '']]","['ECC', 'wolfSSL', 'RELIC', 'AvrCryptoLib', 'TinyECC', 'WiseLib']"
19970,1511.04348,Linnan Wang,"Linnan Wang, Wei Wu, Jianxiong Xiao, Yang Yi",Large Scale Artificial Neural Network Training Using Multi-GPUs,SC 15 Poster,,,,cs.DC cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a method for accelerating large scale Artificial Neural
Networks (ANN) training using multi-GPUs by reducing the forward and backward
passes to matrix multiplication. We propose an out-of-core multi-GPU matrix
multiplication and integrate the algorithm with the ANN training. The
experiments demonstrate that our matrix multiplication algorithm achieves
linear speedup on multiple inhomogeneous GPUs. The full paper of this project
can be found at [1].
","[{'version': 'v1', 'created': 'Fri, 13 Nov 2015 16:36:05 GMT'}]",2015-11-16,"[['Wang', 'Linnan', ''], ['Wu', 'Wei', ''], ['Xiao', 'Jianxiong', ''], ['Yi', 'Yang', '']]","['Artificial Neural Network', 'Matrix Multiplication', 'Multi-GPUs']"
19971,1303.7075,Debajyoti Mukhopadhyay Prof.,"Debajyoti Mukhopadhyay, Gitesh Sonawane, Parth Sarthi Gupta, Sagar
  Bhavsar, Vibha Mittal",Enhanced Security for Cloud Storage using File Encryption,"6 pages, 4 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cloud computing is a term coined to a network that offers incredible
processing power, a wide array of storage space and unbelievable speed of
computation. Social media channels, corporate structures and individual
consumers are all switching to the magnificent world of cloud computing. The
flip side to this coin is that with cloud storage emerges the security issues
of confidentiality, data integrity and data availability. Since the cloud is a
mere collection of tangible super computers spread across the world,
authentication and authorization for data access is more than a necessity. Our
work attempts to overcome these security threats. The proposed methodology
suggests the encryption of the files to be uploaded on the cloud. The integrity
and confidentiality of the data uploaded by the user is ensured doubly by not
only encrypting it but also providing access to the data only on successful
authentication.
","[{'version': 'v1', 'created': 'Thu, 28 Mar 2013 09:20:54 GMT'}]",2013-03-29,"[['Mukhopadhyay', 'Debajyoti', ''], ['Sonawane', 'Gitesh', ''], ['Gupta', 'Parth Sarthi', ''], ['Bhavsar', 'Sagar', ''], ['Mittal', 'Vibha', '']]","['Cloud computing', 'security', 'encryption', 'password based AES algorithm']"
19972,1511.03383,Weimin Wang,"Xue Dong, Kun Wang, Chong Xu, Weimin Wang","Information Rate Decomposition for Feedback Systems with Output
  Disturbance","5 pages, technical note",,,,cs.IT cs.SY math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This technical note considers the problem of resource allocation in linear
feedback control system with output disturbance. By decomposing the information
rate in the feedback communication channel, the channel resource allocation is
thoroughly analyzed. The results show that certain amount of resource is used
to transmit the output disturbance and this resource allocation is independent
from feedback controller design.
","[{'version': 'v1', 'created': 'Wed, 11 Nov 2015 04:22:21 GMT'}]",2015-11-12,"[['Dong', 'Xue', ''], ['Wang', 'Kun', ''], ['Xu', 'Chong', ''], ['Wang', 'Weimin', '']]","['linear system', 'information rate', 'directed information']"
19973,1207.5745,Swathi Rajasurya,"Swathi Rajasurya, Tamizhamudhu Muralidharan, Sandhiya Devi, S.
  Swamynathan",Semantic Information Retrieval Using Ontology In University Domain,,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today's conventional search engines hardly do provide the essential content
relevant to the user's search query. This is because the context and semantics
of the request made by the user is not analyzed to the full extent. So here the
need for a semantic web search arises. SWS is upcoming in the area of web
search which combines Natural Language Processing and Artificial Intelligence.
The objective of the work done here is to design, develop and implement a
semantic search engine- SIEU(Semantic Information Extraction in University
Domain) confined to the university domain. SIEU uses ontology as a knowledge
base for the information retrieval process. It is not just a mere keyword
search. It is one layer above what Google or any other search engines retrieve
by analyzing just the keywords. Here the query is analyzed both syntactically
and semantically. The developed system retrieves the web results more relevant
to the user query through keyword expansion. The results obtained here will be
accurate enough to satisfy the request made by the user. The level of accuracy
will be enhanced since the query is analyzed semantically. The system will be
of great use to the developers and researchers who work on web. The Google
results are re-ranked and optimized for providing the relevant links. For
ranking an algorithm has been applied which fetches more apt results for the
user query.
","[{'version': 'v1', 'created': 'Tue, 24 Jul 2012 16:51:43 GMT'}]",2012-07-25,"[['Rajasurya', 'Swathi', ''], ['Muralidharan', 'Tamizhamudhu', ''], ['Devi', 'Sandhiya', ''], ['Swamynathan', 'S.', '']]","['Natural Language Processing', 'Semantic Analysis', 'Ontology', 'Web Filtering']"
19974,1412.5150,Christos Antonopouos,"Vassilis Vassiliadis, Konstantinos Parasyris, Charalambos Chalios,
  Christos D. Antonopoulos, Spyros Lalis, Nikolaos Bellas, Hans Vandierendonck,
  Dimitrios S. Nikolopoulos","A Programming Model and Runtime System for Significance-Aware
  Energy-Efficient Computing",,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reducing energy consumption is one of the key challenges in computing
technology. One factor that contributes to high energy consumption is that all
parts of the program are considered equally significant for the accuracy of the
end-result. However, in many cases, parts of computations can be performed in
an approximate way, or even dropped, without affecting the quality of the final
output to a significant degree.
  In this paper, we introduce a task-based programming model and runtime system
that exploit this observation to trade off the quality of program outputs for
increased energy-efficiency. This is done in a structured and flexible way,
allowing for easy exploitation of different execution points in the
quality/energy space, without code modifications and without adversely
affecting application performance. The programmer specifies the significance of
tasks, and optionally provides approximations for them. Moreover, she provides
hints to the runtime on the percentage of tasks that should be executed
accurately in order to reach the target quality of results. The runtime system
can apply a number of different policies to decide whether it will execute each
individual less-significant task in its accurate form, or in its approximate
version. Policies differ in terms of their runtime overhead but also the degree
to which they manage to execute tasks according to the programmer's
specification.
  The results from experiments performed on top of an Intel-based
multicore/multiprocessor platform show that, depending on the runtime policy
used, our system can achieve an energy reduction of up to 83% compared with a
fully accurate execution and up to 35% compared with an approximate version
employing loop perforation. At the same time, our approach always results in
graceful quality degradation.
","[{'version': 'v1', 'created': 'Mon, 15 Dec 2014 17:46:42 GMT'}]",2014-12-17,"[['Vassiliadis', 'Vassilis', ''], ['Parasyris', 'Konstantinos', ''], ['Chalios', 'Charalambos', ''], ['Antonopoulos', 'Christos D.', ''], ['Lalis', 'Spyros', ''], ['Bellas', 'Nikolaos', ''], ['Vandierendonck', 'Hans', ''], ['Nikolopoulos', 'Dimitrios S.', '']]","['Energy Saving', 'Approximate Computing', 'ControlledQuality Degradation', 'Programming Model', 'Runtime System Evaluation']"
19975,1610.09988,Petra Surynkova,Petra Surynkova,Selecting the Best Quadrilateral Mesh for Given Planar Shape,13 pages,,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of mesh matching is addressed in this work. For a given n-sided
planar region bounded by one loop of n polylines we are selecting optimal
quadrilateral mesh from existing catalogue of meshes. The formulation of
matching between planar shape and quadrilateral mesh from the catalogue is
based on the problem of finding longest common subsequence (LCS). Theoretical
foundation of mesh matching method is provided. Suggested method represents a
viable technique for selecting best mesh for planar region and stepping stone
for further parametrization of the region.
","[{'version': 'v1', 'created': 'Mon, 31 Oct 2016 15:56:30 GMT'}]",2016-11-01,"[['Surynkova', 'Petra', '']]","['quadrilaterals', 'quadrilateral mesh', 'optimal mesh', 'longestcommon subsequence', 'n-sided planar region']"
19976,1106.0851,Wajeb Gharibi,"Wajeb Gharibi, Yong Xia","A Dual Approach for Solving Nonlinear Infinite-Norm Minimization
  Problems with Applications in Separable Cases",10 pages,"Numer. Math. J. Chinese Univ. (English Ser.), Issue 3, Vol. 16,
  pp. 265-270, 2007",,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we focus on nonlinear infinite-norm minimization problems that
have many applications, especially in computer science and operations research.
We set a reliable Lagrangian dual aproach for solving this kind of problems in
general, and based on this method, we propose an algorithm for the mixed linear
and nonlinear infinite-norm minimization cases with numerical results.
","[{'version': 'v1', 'created': 'Sat, 4 Jun 2011 19:17:30 GMT'}]",2011-06-07,"[['Gharibi', 'Wajeb', ''], ['Xia', 'Yong', '']]","['Infinite-norm minimization problem', 'Lagrangian dual', 'linear']"
19977,1410.0289,Virgilio  Sison,Virgilio Sison,"Bases of the Galois Ring $GR(p^r,m)$ over the Integer Ring $Z_{p^r}$",11 pages,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Galois ring $GR(p^r,m)$ of characteristic $p^r$ and cardinality $p^{rm}$,
where $p$ is a prime and $r,m \ge 1$ are integers, is a Galois extension of the
residue class ring $Z_{p^r}$ by a root $\omega$ of a monic basic irreducible
polynomial of degree $m$ over $Z_{p^r}$. Every element of $GR(p^r,m)$ can be
expressed uniquely as a polynomial in $\omega$ with coefficients in $Z_{p^r}$
and degree less than or equal to $m-1$, thus $GR(p^r,m)$ is a free module of
rank $m$ over $Z_{p^r}$ with basis $\{1,\omega, \omega^2,..., \omega^{m-1} \}$.
The ring $Z_{p^r}$ satisfies the invariant dimension property, hence any other
basis of $GR(p^r,m)$, if it exists, will have cardinality $m$.
  This paper was motivated by the code-theoretic problem of finding the
homogeneous bound on the $p^r$-image of a linear block code over $GR(p^r,m)$
with respect to any basis. It would be interesting to consider the dual and
normal bases of $GR(p^r,m)$.
  By using a Vandermonde matrix over $GR(p^r,m)$ in terms of the generalized
Frobenius automorphism, a constructive proof that every basis of $GR(p^r,m)$
has a unique dual basis is given. The notion of normal bases was also
generalized from the classic case for Galois fields.
","[{'version': 'v1', 'created': 'Wed, 1 Oct 2014 16:58:52 GMT'}]",2014-10-02,"[['Sison', 'Virgilio', '']]","['Galois rings', 'trace function', 'Frobenius automorphism', 'Vandermonde matrix', 'dual basis', 'normal basis']"
19978,1407.4668,Albrecht Zimmermann,Albrecht Zimmermann,"A feature construction framework based on outlier detection and
  discriminative pattern mining",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  No matter the expressive power and sophistication of supervised learning
algorithms, their effectiveness is restricted by the features describing the
data. This is not a new insight in ML and many methods for feature selection,
transformation, and construction have been developed. But while this is
on-going for general techniques for feature selection and transformation, i.e.
dimensionality reduction, work on feature construction, i.e. enriching the
data, is by now mainly the domain of image, particularly character,
recognition, and NLP.
  In this work, we propose a new general framework for feature construction.
The need for feature construction in a data set is indicated by class outliers
and discriminative pattern mining used to derive features on their
k-neighborhoods. We instantiate the framework with LOF and C4.5-Rules, and
evaluate the usefulness of the derived features on a diverse collection of UCI
data sets. The derived features are more often useful than ones derived by
DC-Fringe, and our approach is much less likely to overfit. But while a weak
learner, Naive Bayes, benefits strongly from the feature construction, the
effect is less pronounced for C4.5, and almost vanishes for an SVM leaner.
  Keywords: feature construction, classification, outlier detection
","[{'version': 'v1', 'created': 'Thu, 17 Jul 2014 13:51:55 GMT'}]",2014-07-18,"[['Zimmermann', 'Albrecht', '']]","['feature construction', 'classification', 'outlier detection']"
19979,1502.05040,Tarek Sobh,"Tamer M. Abo Neama, Ismail A. Ismail, Tarek S. Sobh, M. Zaki",Design of a Framework to Facilitate Decisions Using Information Fusion,"17 pages, 5 figures, Journal of Al Azhar University Engineering
  Sector, Vol. 8, No. 28, July 2013, 1237-1250. arXiv admin note: text overlap
  with arXiv:cs/0409007 by other authors","Journal of Al Azhar University Engineering Sector, Vol. 8, No. 28,
  July 2013, 1237-1250",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information fusion is an advanced research area which can assist decision
makers in enhancing their decisions. This paper aims at designing a new
multi-layer framework that can support the process of performing decisions from
the obtained beliefs using information fusion. Since it is not an easy task to
cross the gap between computed beliefs of certain hypothesis and decisions, the
proposed framework consists of the following layers in order to provide a
suitable architecture (ordered bottom up): 1. A layer for combination of basic
belief assignments using an information fusion approach. Such approach exploits
Dezert-Smarandache Theory, DSmT, and proportional conflict redistribution to
provide more realistic final beliefs. 2. A layer for computation of pignistic
probability of the underlying propositions from the corresponding final
beliefs. 3. A layer for performing probabilistic reasoning using a Bayesian
network that can obtain the probable reason of a proposition from its pignistic
probability. 4. Ranking the system decisions is ultimately used to support
decision making. A case study has been accomplished at various operational
conditions in order to prove the concept, in addition it pointed out that: 1.
The use of DSmT for information fusion yields not only more realistic beliefs
but also reliable pignistic probabilities for the underlying propositions. 2.
Exploiting the pignistic probability for the integration of the information
fusion with the Bayesian network provides probabilistic inference and enable
decision making on the basis of both belief based probabilities for the
underlying propositions and Bayesian based probabilities for the corresponding
reasons. A comparative study of the proposed framework with respect to other
information fusion systems confirms its superiority to support decision making.
","[{'version': 'v1', 'created': 'Tue, 17 Feb 2015 12:24:58 GMT'}, {'version': 'v2', 'created': 'Sat, 21 Feb 2015 13:12:25 GMT'}]",2015-02-24,"[['Neama', 'Tamer M. Abo', ''], ['Ismail', 'Ismail A.', ''], ['Sobh', 'Tarek S.', ''], ['Zaki', 'M.', '']]","['Information Fusion', 'Bayesian networks', 'Belief combination', 'Pignistic Probability', 'Decision Making']"
19980,0708.3022,Elisa Gorla,"Jamshid Shokrollahi, Elisa Gorla, Christoph Puttmann",Efficient FPGA-based multipliers for F_{3^97} and F_{3^{6*97}},"6 pages, 3 figures, to appear in the proceedings of FPL07",,,,cs.CR,,"  In this work we present a new structure for multiplication in finite fields.
This structure is based on a digit-level LFSR (Linear Feedback Shift Register)
multiplier in which the area of digit-multipliers are reduced using the
Karatsuba method. We compare our results with the other works in the literature
for F_{3^97}. We also propose new formulas for multiplication in F_{3^{6*97}}.
These new formulas reduce the number of F_{3^97}-multiplications from 18 to 15.
The fields F_{3^{97}} and F_{3^{6*97}} are relevant in the context of
pairing-based cryptography.
","[{'version': 'v1', 'created': 'Wed, 22 Aug 2007 14:17:08 GMT'}]",2007-08-23,"[['Shokrollahi', 'Jamshid', ''], ['Gorla', 'Elisa', ''], ['Puttmann', 'Christoph', '']]","['finite field multiplication', 'FPGA', 'pairingbased cryptography']"
19981,0704.3395,Marko A. Rodriguez,Marko A. Rodriguez,General-Purpose Computing on a Semantic Network Substrate,,"Emergent Web Intelligence: Advanced Semantic Technologies,
  Advanced Information and Knowledge Processing series, Springer-Verlag, pages
  57-104, ISBN:978-1-84996-076-2, June 2010",,LA-UR-07-2885,cs.AI cs.PL,http://creativecommons.org/licenses/publicdomain/,"  This article presents a model of general-purpose computing on a semantic
network substrate. The concepts presented are applicable to any semantic
network representation. However, due to the standards and technological
infrastructure devoted to the Semantic Web effort, this article is presented
from this point of view. In the proposed model of computing, the application
programming interface, the run-time program, and the state of the computing
virtual machine are all represented in the Resource Description Framework
(RDF). The implementation of the concepts presented provides a practical
computing paradigm that leverages the highly-distributed and standardized
representational-layer of the Semantic Web.
","[{'version': 'v1', 'created': 'Wed, 25 Apr 2007 15:37:52 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Oct 2007 20:08:21 GMT'}, {'version': 'v3', 'created': 'Sun, 7 Oct 2007 21:44:01 GMT'}, {'version': 'v4', 'created': 'Sun, 6 Jun 2010 05:29:22 GMT'}]",2010-06-08,"[['Rodriguez', 'Marko A.', '']]","['Resource Description Framework', 'Web Ontology Language', 'Virtual Machines', 'Object-Oriented Programming', 'Semantic Web Computing']"
19982,1410.3334,Nick Bassiliades,"Kalliopi Kravari, Nick Bassiliades","DISARM: A Social Distributed Agent Reputation Model based on Defeasible
  Logic","Paper under review. Keywords: Semantic Web, Intelligent Multi-agent
  Systems, Agent Reputation, Defeasible Reasoning",,,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Intelligent Agents act in open and thus risky environments, hence making the
appropriate decision about who to trust in order to interact with, could be a
challenging process. As intelligent agents are gradually enriched with Semantic
Web technology, acting on behalf of their users with limited or no human
intervention, their ability to perform assigned tasks is scrutinized. Hence,
trust and reputation models, based on interaction trust or witness reputation,
have been proposed, yet they often presuppose the use of a centralized
authority. Although such mechanisms are more popular, they are usually faced
with skepticism, since users may question the trustworthiness and the
robustness of a central authority. Distributed models, on the other hand, are
more complex but they provide personalized estimations based on each agent's
interests and preferences. To this end, this article proposes DISARM, a novel
distributed reputation model. DISARM deals MASs as social networks, enabling
agents to establish and maintain relationships, limiting the disadvantages of
the common distributed approaches. Additionally, it is based on defeasible
logic, modeling the way intelligent agents, like humans, draw reasonable
conclusions from incomplete and possibly conflicting (thus inconclusive)
information. Finally, we provide an evaluation that illustrates the usability
of the proposed model.
","[{'version': 'v1', 'created': 'Mon, 13 Oct 2014 14:56:03 GMT'}]",2014-10-14,"[['Kravari', 'Kalliopi', ''], ['Bassiliades', 'Nick', '']]","['Semantic Web', 'Intelligent Multi-agent Systems', 'Agent Reputation', 'Defeasible']"
19983,1401.5808,Zahra Pourbahman,Zahra Pourbahman and Ali Hamzeh,"Reducing the Computational Cost in Multi-objective Evolutionary
  Algorithms by Filtering Worthless Individuals",,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The large number of exact fitness function evaluations makes evolutionary
algorithms to have computational cost. In some real-world problems, reducing
number of these evaluations is much more valuable even by increasing
computational complexity and spending more time. To fulfill this target, we
introduce an effective factor, in spite of applied factor in Adaptive Fuzzy
Fitness Granulation with Non-dominated Sorting Genetic Algorithm-II, to filter
out worthless individuals more precisely. Our proposed approach is compared
with respect to Adaptive Fuzzy Fitness Granulation with Non-dominated Sorting
Genetic Algorithm-II, using the Hyper volume and the Inverted Generational
Distance performance measures. The proposed method is applied to 1 traditional
and 1 state-of-the-art benchmarks with considering 3 different dimensions. From
an average performance view, the results indicate that although decreasing the
number of fitness evaluations leads to have performance reduction but it is not
tangible compared to what we gain.
","[{'version': 'v1', 'created': 'Thu, 2 Jan 2014 10:28:53 GMT'}]",2014-01-24,"[['Pourbahman', 'Zahra', ''], ['Hamzeh', 'Ali', '']]","['Multi objective evolutionary algorithm optimization', 'Fitness approximation', 'Information granulation', 'Pareto optimal solutions']"
19984,1707.07922,Giuseppe Attardi,Andrea Madotto and Giuseppe Attardi,Question Dependent Recurrent Entity Network for Question Answering,14 pages,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Question Answering is a task which requires building models capable of
providing answers to questions expressed in human language. Full question
answering involves some form of reasoning ability. We introduce a neural
network architecture for this task, which is a form of $Memory\ Network$, that
recognizes entities and their relations to answers through a focus attention
mechanism. Our model is named $Question\ Dependent\ Recurrent\ Entity\ Network$
and extends $Recurrent\ Entity\ Network$ by exploiting aspects of the question
during the memorization process. We validate the model on both synthetic and
real datasets: the $bAbI$ question answering dataset and the $CNN\ \&\ Daily\
News$ $reading\ comprehension$ dataset. In our experiments, the models achieved
a State-of-The-Art in the former and competitive results in the latter.
","[{'version': 'v1', 'created': 'Tue, 25 Jul 2017 11:34:14 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Oct 2017 00:25:10 GMT'}]",2017-10-09,"[['Madotto', 'Andrea', ''], ['Attardi', 'Giuseppe', '']]","['Question Answering', 'Deep Learning', 'Memory Networks', 'Recurrent Neural Network']"
19985,1710.05421,Sanjay Krishnan,"Sanjay Krishnan, Roy Fox, Ion Stoica, Ken Goldberg","DDCO: Discovery of Deep Continuous Options for Robot Learning from
  Demonstrations",Published at CoRL 2017,1st Conference on Robot Learning (CoRL 2017),,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An option is a short-term skill consisting of a control policy for a
specified region of the state space, and a termination condition recognizing
leaving that region. In prior work, we proposed an algorithm called Deep
Discovery of Options (DDO) to discover options to accelerate reinforcement
learning in Atari games. This paper studies an extension to robot imitation
learning, called Discovery of Deep Continuous Options (DDCO), where low-level
continuous control skills parametrized by deep neural networks are learned from
demonstrations. We extend DDO with: (1) a hybrid categorical-continuous
distribution model to parametrize high-level policies that can invoke discrete
options as well continuous control actions, and (2) a cross-validation method
that relaxes DDO's requirement that users specify the number of options to be
discovered. We evaluate DDCO in simulation of a 3-link robot in the vertical
plane pushing a block with friction and gravity, and in two physical
experiments on the da Vinci surgical robot, needle insertion where a needle is
grasped and inserted into a silicone tissue phantom, and needle bin picking
where needles and pins are grasped from a pile and categorized into bins. In
the 3-link arm simulation, results suggest that DDCO can take 3x fewer
demonstrations to achieve the same reward compared to a baseline imitation
learning approach. In the needle insertion task, DDCO was successful 8/10 times
compared to the next most accurate imitation learning baseline 6/10. In the
surgical bin picking task, the learned policy successfully grasps a single
object in 66 out of 99 attempted grasps, and in all but one case successfully
recovered from failed grasps by retrying a second time.
","[{'version': 'v1', 'created': 'Sun, 15 Oct 2017 23:51:37 GMT'}, {'version': 'v2', 'created': 'Tue, 31 Oct 2017 19:47:02 GMT'}]",2018-02-01,"[['Krishnan', 'Sanjay', ''], ['Fox', 'Roy', ''], ['Stoica', 'Ion', ''], ['Goldberg', 'Ken', '']]","['Robotics', 'Imitation', 'Hierarchy']"
19986,1702.05536,Zifan Li,"Zifan Li, Ambuj Tewari","Beyond the Hazard Rate: More Perturbation Algorithms for Adversarial
  Multi-armed Bandits",,,,,cs.LG cs.GT stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent work on follow the perturbed leader (FTPL) algorithms for the
adversarial multi-armed bandit problem has highlighted the role of the hazard
rate of the distribution generating the perturbations. Assuming that the hazard
rate is bounded, it is possible to provide regret analyses for a variety of
FTPL algorithms for the multi-armed bandit problem. This paper pushes the
inquiry into regret bounds for FTPL algorithms beyond the bounded hazard rate
condition. There are good reasons to do so: natural distributions such as the
uniform and Gaussian violate the condition. We give regret bounds for both
bounded support and unbounded support distributions without assuming the hazard
rate condition. We also disprove a conjecture that the Gaussian distribution
cannot lead to a low-regret algorithm. In fact, it turns out that it leads to
near optimal regret, up to logarithmic factors. A key ingredient in our
approach is the introduction of a new notion called the generalized hazard
rate.
","[{'version': 'v1', 'created': 'Fri, 17 Feb 2017 22:39:37 GMT'}, {'version': 'v2', 'created': 'Fri, 5 Jan 2018 19:31:42 GMT'}]",2018-01-09,"[['Li', 'Zifan', ''], ['Tewari', 'Ambuj', '']]","['online learning', 'regret', 'multi-armed bandits', 'follow the perturbed leader', 'gradient based algorithms']"
19987,1604.07973,Andr\'es Silva,Andr\'es Silva,Reference and Structure of Software Engineering Theories,"Position paper, 4 pages",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper tries to contribute towards the solution of an important question
raised in the SE literature: What is a Software Engineering (SE) specific
theory? Which are the main features of a theory that is endemic to SE? In this
paper we will use 'theory' as the term is used in traditional sciences. Other
uses of the term 'theory' are discussed. Finally, we propose to focus on the
reference class and on the structuring of SE theories as a basis for further
progress.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2016 08:35:46 GMT'}]",2016-04-28,"[['Silva', 'Andrés', '']]","['Philosophy of Science', 'Semantics', 'Scientific Theories']"
19988,1610.06809,Walter Quattrociocchi,"Michela Del Vicario, Fabiana Zollo, Guido Caldarelli, Antonio Scala,
  Walter Quattrociocchi",The Anatomy of Brexit Debate on Facebook,,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays users get informed and shape their opinion through social media.
However, the disintermediated access to contents does not guarantee quality of
information. Selective exposure and confirmation bias, indeed, have been shown
to play a pivotal role in content consumption and information spreading. Users
tend to select information adhering (and reinforcing) their worldview and to
ignore dissenting information. This pattern elicits the formation of polarized
groups -- i.e., echo chambers -- where the interaction with like-minded people
might even reinforce polarization. In this work we address news consumption
around Brexit in UK on Facebook. In particular, we perform a massive analysis
on more than 1 Million users interacting with Brexit related posts from the
main news providers between January and July 2016. We show that consumption
patterns elicit the emergence of two distinct communities of news outlets.
Furthermore, to better characterize inner group dynamics, we introduce a new
technique which combines automatic topic extraction and sentiment analysis. We
compare how the same topics are presented on posts and the related emotional
response on comments finding significant differences in both echo chambers and
that polarization influences the perception of topics. Our results provide
important insights about the determinants of polarization and evolution of core
narratives on online debating.
","[{'version': 'v1', 'created': 'Fri, 21 Oct 2016 14:46:28 GMT'}]",2016-10-24,"[['Del Vicario', 'Michela', ''], ['Zollo', 'Fabiana', ''], ['Caldarelli', 'Guido', ''], ['Scala', 'Antonio', ''], ['Quattrociocchi', 'Walter', '']]","['Collective Debates', 'Polarization', 'Online Social Networks']"
19989,1802.06949,Amith Rajith Mamidala,Amith R Mamidala,"Efficient Embedding of MPI Collectives in MXNET DAGs for scaling Deep
  Learning",,,,,cs.DC cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Availability of high performance computing infrastructures such as clusters
of GPUs and CPUs have fueled the growth of distributed learning systems. Deep
Learning frameworks express neural nets as DAGs and execute these DAGs on
computation resources such as GPUs. In this paper, we propose efficient designs
of embedding MPI collective operations into data parallel DAGs. Incorrect
designs can easily lead to deadlocks or program crashes. In particular, we
demonstrate three designs: Funneled, Concurrent communication and Dependency
chaining of using MPI collectives with DAGs. These designs automatically enable
overlap of computation with communication by allowing for concurrent execution
with the other tasks. We directly implement these designs into the KVStore API
of the MXNET. This allows us to directly leverage the rest of the
infrastructure. Using ImageNet and CIFAR data sets, we show the potential of
our designs. In particular, our designs scale to 256 GPUs with as low as 50
seconds of epoch times for ImageNet 1K datasets.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 03:36:20 GMT'}]",2018-02-21,"[['Mamidala', 'Amith R', '']]","['Deep Learning', 'Parameter Server', 'MPI', 'SGD', 'Scaling']"
19990,1604.08088,Xirong Li,Xirong Li and Yujia Huo and Jieping Xu and Qin Jin,Detecting Violence in Video using Subclasses,,,,,cs.MM cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper attacks the challenging problem of violence detection in videos.
Different from existing works focusing on combining multi-modal features, we go
one step further by adding and exploiting subclasses visually related to
violence. We enrich the MediaEval 2015 violence dataset by \emph{manually}
labeling violence videos with respect to the subclasses. Such fine-grained
annotations not only help understand what have impeded previous efforts on
learning to fuse the multi-modal features, but also enhance the generalization
ability of the learned fusion to novel test data. The new subclass based
solution, with AP of 0.303 and P100 of 0.55 on the MediaEval 2015 test set,
outperforms several state-of-the-art alternatives. Notice that our solution
does not require fine-grained annotations on the test set, so it can be
directly applied on novel and fully unlabeled videos. Interestingly, our study
shows that motion related features, though being essential part in previous
systems, are dispensable.
","[{'version': 'v1', 'created': 'Wed, 27 Apr 2016 14:32:16 GMT'}]",2016-04-28,"[['Li', 'Xirong', ''], ['Huo', 'Yujia', ''], ['Xu', 'Jieping', ''], ['Jin', 'Qin', '']]","['Video violence detection', 'subclass annotation', 'fusion']"
19991,1702.00533,Mohammad Farshi,Davood Bakhshesh and Mohammad Farshi and Mahdieh Hasheminezhad,"Complexity results for $k$-domination and $\alpha$-domination problems
  and their variants",,,,,cs.CC math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Let $G=(V, E)$ be a simple and undirected graph. For some integer $k\geq 1$,
a set $D\subseteq V$ is said to be a k-dominating set in $G$ if every vertex
$v$ of $G$ outside $D$ has at least $k$ neighbors in $D$. Furthermore, for some
real number $\alpha$ with $0<\alpha\leq1$, a set $D\subseteq V$ is called an
$\alpha$-dominating set in $G$ if every vertex $v$ of $G$ outside $D$ has at
least $\alpha\times d_v$ neighbors in $D$, where $d_v$ is the degree of $v$ in
$G$. The cardinality of a minimum $k$-dominating set and a minimum
$\alpha$-dominating set in $G$ is said to be the $k$-domination number and the
$\alpha$-domination number of $G$, respectively. In this paper, we present some
approximability and inapproximability results on the problem of finding
$k$-domination number and $\alpha$-domination number of some classes of graphs.
Moreover, we introduce a generalization of $\alpha$-dominating set which we
call an $f$-dominating set. Given a function $f:\mathbb{N}\rightarrow
\mathbb{R}$, where $\mathbb{N}=\{1, 2, 3, \ldots\}$, a set $D\subseteq V$ is
said to be an $f$-dominating set in $G$ if every vertex $v$ of $G$ outside $D$
has at least $f(d_v)$ neighbors in $D$. We prove NP-hardness of the problem of
finding a minimum $f$-dominating set in $G$, for a large family of functions
$f$.
","[{'version': 'v1', 'created': 'Thu, 2 Feb 2017 03:23:39 GMT'}]",2017-02-03,"[['Bakhshesh', 'Davood', ''], ['Farshi', 'Mohammad', ''], ['Hasheminezhad', 'Mahdieh', '']]","['f-Domination', 'α-domination', 'k-domination', 'approximation']"
19992,1603.08119,Liang Wang,"Mennan Selimi, Llorenc Cerda-Alabern, Liang Wang, Arjuna Sathiaseelan,
  Luis Veiga, Felix Freitag",Bandwidth-aware Service Placement in Community Network Clouds,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Seamless computing and service sharing in community networks have been
gaining momentum due to the emerging technology of community network
micro-clouds (CNMCs). However, running services in CNMCs can face enormous
challenges such as the dynamic nature of micro-clouds, limited capacity of
nodes and links, asymmetric quality of wireless links for services, deployment
mod- els based on geographic singularities rather than network QoS, and etc.
CNMCs have been increasingly used by network-intensive services that exchange
significant amounts of data between the nodes on which they run, therefore the
performance heavily relies on the available bandwidth resource in a network.
This paper proposes a novel bandwidth-aware service placement algorithm which
out- performs the current random placement adopted by Guifi.net. Our
preliminary results show that the proposed algorithm consistently outperforms
the current random placement adopted in Guifi.net by 35% regarding its
bandwidth gain. More importantly, as the number of services increases, the gain
tends to increase accordingly.
","[{'version': 'v1', 'created': 'Sat, 26 Mar 2016 15:56:00 GMT'}]",2016-03-29,"[['Selimi', 'Mennan', ''], ['Cerda-Alabern', 'Llorenc', ''], ['Wang', 'Liang', ''], ['Sathiaseelan', 'Arjuna', ''], ['Veiga', 'Luis', ''], ['Freitag', 'Felix', '']]","['Community networks', 'community clouds', 'service placement']"
19993,1407.7011,Hamidreza Arjmandi,"Hamidreza Arjmandi, Farshad Lahouti","A Key Pre-Distribution Scheme based on Multiple Block Codes for Wireless
  Sensor Networks",,,,,cs.CR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A key pre-distribution scheme (KPS) based on multiple codewords of block
codes is presented for wireless sensor networks. The connectivity and security
of the proposed KPS, quantified in terms of probabilities of sharing common
keys for communications of pairs of nodes and their resilience against
colluding nodes, are analytically assessed. The analysis is applicable to both
linear and nonlinear codes and is simplified in the case of maximum distance
separable codes. It is shown that the multiplicity of codes significantly
enhances the security and connectivity of KPS at the cost of a modest increase
of the nodes storage. Numerical and simulation results are provided, which
sheds light on the effect of system parameters of the proposed KPS on its
complexity and performance. Specifically, it is shown that the probability of
resilience of secure pairs against collusion of other nodes only reduces slowly
as the number of colluding nodes increase.
","[{'version': 'v1', 'created': 'Fri, 25 Jul 2014 19:22:36 GMT'}]",2014-07-28,"[['Arjmandi', 'Hamidreza', ''], ['Lahouti', 'Farshad', '']]","['Wireless Sensor Network', 'Security', 'Key Pre']"
19994,1412.7011,Guodong Shi,"Guodong Shi, Alexandre Proutiere, Karl Henrik Johansson",Network Synchronization with Convexity,"Based on our previous manuscript arXiv:1210.6685. SIAM Journal on
  Control and Optimization, in press 2016",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we establish a few new synchronization conditions for complex
networks with nonlinear and nonidentical self-dynamics with switching directed
communication graphs. In light of the recent works on distributed sub-gradient
methods, we impose integral convexity for the nonlinear node self-dynamics in
the sense that the self-dynamics of a given node is the gradient of some
concave function corresponding to that node. The node couplings are assumed to
be linear but with switching directed communication graphs. Several sufficient
and/or necessary conditions are established for exact or approximate
synchronization over the considered complex networks. These results show when
and how nonlinear node self-dynamics may cooperate with the linear diffusive
coupling, which eventually leads to network synchronization conditions under
relaxed connectivity requirements.
","[{'version': 'v1', 'created': 'Mon, 22 Dec 2014 14:58:02 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Jun 2015 04:10:54 GMT'}, {'version': 'v3', 'created': 'Fri, 16 Oct 2015 04:54:53 GMT'}]",2015-10-19,"[['Shi', 'Guodong', ''], ['Proutiere', 'Alexandre', ''], ['Johansson', 'Karl Henrik', '']]","['Coupled oscillator', 'Complex networks', 'Synchronization', 'Switching graphs']"
19995,1409.3867,Vishwakarma Singh,Vishwakarma Singh and Ambuj K. Singh,Nearest Keyword Set Search in Multi-dimensional Datasets,"Accepted as Full Research Paper to ICDE 2014, Chicago, IL, USA",,,,cs.DB cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Keyword-based search in text-rich multi-dimensional datasets facilitates many
novel applications and tools. In this paper, we consider objects that are
tagged with keywords and are embedded in a vector space. For these datasets, we
study queries that ask for the tightest groups of points satisfying a given set
of keywords. We propose a novel method called ProMiSH (Projection and Multi
Scale Hashing) that uses random projection and hash-based index structures, and
achieves high scalability and speedup. We present an exact and an approximate
version of the algorithm. Our empirical studies, both on real and synthetic
datasets, show that ProMiSH has a speedup of more than four orders over
state-of-the-art tree-based techniques. Our scalability tests on datasets of
sizes up to 10 million and dimensions up to 100 for queries having up to 9
keywords show that ProMiSH scales linearly with the dataset size, the dataset
dimension, the query size, and the result size.
","[{'version': 'v1', 'created': 'Fri, 12 Sep 2014 21:12:16 GMT'}]",2014-09-16,"[['Singh', 'Vishwakarma', ''], ['Singh', 'Ambuj K.', '']]","['provided bya user. Set A ⊆ D is a possible result', 'called a candidate', 'of Q if it contains points for all the query keywords', 'i.e']"
19996,1306.5501,Hu Li,"Hu Li, Yuan`an Liu, Dongming Yuan, Hefei Hu",A Wrapper of PCI Express with FIFO Interfaces based on FPGA,"5 pages, 8 figures","Proceedings of the 2012 International Conference on Industrial
  Control and Electronics Engineering, ICICEE 2012",,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a PCI Express (PCIE) Wrapper core named PWrapper with
FIFO interfaces. Compared with other PCIE solutions, PWrapper has several
advantages such as flexibility, isolation of clock domain, etc. PWrapper is
implemented and verified on Vertex -5-FX70T which is a development board
provided by Xilinx Inc. Architecture of PWrapper and design of two key modules
are illustrated, which timing optimization methods have been adopted. Then we
explained the advantages and challenges of on-chip interfaces technology based
on FIFOs. The verification results show that PWrapper can achieve the speed of
1.8Gbps (Giga bits per second).
","[{'version': 'v1', 'created': 'Mon, 24 Jun 2013 02:50:32 GMT'}]",2013-06-25,"[['Li', 'Hu', ''], ['Liu', 'Yuan`an', ''], ['Yuan', 'Dongming', ''], ['Hu', 'Hefei', '']]","['PCI Express', 'FPGA', 'FIFO based interface']"
19997,1312.2047,Triki Slim,"Taher Mekki, Slim Triki, Anas Kamoun",Diagnosis of Switching Systems using Hybrid Bond Graph,8 pages,"International Journal of Computer Science Issues - IJCSI Volume
  10, Issue 1, January 2013",,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hybrid Bond Graph (HBG) is a Bond Graph-based modelling approach which
provides an effective tool not only for dynamic modeling but also for fault
detection and isolation (FDI) of switching systems. Bond graph (BG) has been
proven useful for FDI for continuous systems. In addition, BG provides the
causal relations between systems variables which allow FDI algorithms to be
developed systematically from the graph. There are many methods that exploit
structural relations and functional redundancy in the system model to find
efficient solutions for the residual generation and residual evaluation steps
in FDI of switching systems. This paper describes two different techniques,
quantitative and qualitative, based on common modelling approach that employs
HBG. In quantitative approach, global analytical redundancy relationships
(GARRs) are derived from the HBG model with a specified causality assignment
procedure. GARRs describe the system behaviour at all of its operating modes.
In qualitative approach, functional redundancy can be captured by a Temporal
Causal Graph (TCG), a directed graph that may include temporal information
","[{'version': 'v1', 'created': 'Sat, 7 Dec 2013 01:20:58 GMT'}]",2013-12-10,"[['Mekki', 'Taher', ''], ['Triki', 'Slim', ''], ['Kamoun', 'Anas', '']]","['Hybrid Bond Graph (HBG)', 'Global Analytical Redundancy Relation (GARR)', 'Temporal Causal Graph (TCG)']"
19998,1511.03524,Buddhadeb Sau,B. Sau and S. Mukhopadhyaya and K. Mukhopadhyaya,MAINT: Localization of Mobile Sensors with Energy Control,,,,,cs.DC cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Localization is an important issue for Wireless Sensor Networks (WSN). A
mobile sensor may change its position rapidly and thus require localization
calls frequently. A localization may require network wide information and
increase traffic over the network. It dissipates valuable energy for message
communication. Thus localization is very costly. The control of the number of
localization calls may save energy consumption, as it is rather expensive. To
reduce the frequency of localization calls for a mobile sensor, we propose a
technique that involves \textit{Mobility Aware Interpolation} (MAINT) for
position estimation. It controls the number of localizations which gives much
better result than the existing localization control schemes using mobility
aware extrapolation. The proposed method involves very low arithmetic
computation overheads. We find analytical expressions for the expected error in
position estimation. A parameter, the time interval, has been introduced to
externally control the energy dissipation. Simulation studies are carried out
to compare the performances of the proposed method with some existing
localization control schemes as well as the theoretical results. The simulation
results shows that the expected error at any point of time may be computed from
this expression. We have seen that constant error limit can be maintained
increasing the time period of localization proportional to rate of change of
direction of its motion. Increasing time period, the energy may be saved with a
stable error limit.
","[{'version': 'v1', 'created': 'Tue, 10 Nov 2015 07:22:10 GMT'}]",2015-11-12,"[['Sau', 'B.', ''], ['Mukhopadhyaya', 'S.', ''], ['Mukhopadhyaya', 'K.', '']]","['Wireless sensor networks', 'localization', 'tracking mobile sensors', 'localization control', 'target tracking']"
19999,1602.07407,Fatemeh Keshavarz-Kohjerdi,Fatemeh Keshavarz-Kohjerdi and Alireza Bagheri,Hamiltonian Paths in C-shaped Grid Graphs,"28 pages, 31 figures, and 20 references",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the Hamiltonian path problem in C-shaped grid graphs, and present
the necessary and sufficient conditions for the existence of a Hamiltonian path
between two given vertices in these graphs. We also give a linear-time
algorithm for finding a Hamiltonian path between two given vertices of a
C-shaped grid graph, if it exists.
","[{'version': 'v1', 'created': 'Wed, 24 Feb 2016 06:05:53 GMT'}]",2016-02-25,"[['Keshavarz-Kohjerdi', 'Fatemeh', ''], ['Bagheri', 'Alireza', '']]","['Grid graph', 'Hamiltonian path', 'C−shaped grid graph', 'NP-complete']"
20000,1412.5111,Usman Khan,Mohammadreza Doostmohammadian and Usman A. Khan,"Measurement partitioning and observational equivalence in state
  estimation",,,,,cs.IT math.IT math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This letter studies measurement partitioning and equivalence in state
estimation based on graph-theoretic principles. We show that a set of critical
measurements (required to ensure LTI state-space observability) can be further
partitioned into two types:~$\alpha$ and~$\beta$. This partitioning is driven
by different graphical (or algebraic) methods used to define the corresponding
measurements. Subsequently, we describe observational equivalence, i.e. given
an~$\alpha$ (or~$\beta$) measurement, say~$y_i$, what is the set of
measurements equivalent to~$y_i$, such that only one measurement in this set is
required to ensure observability? Since~$\alpha$ and~$\beta$ measurements are
cast using different algebraic and graphical characteristics, their equivalence
sets are also derived using different algebraic and graph-theoretic principles.
We illustrate the related concepts on an appropriate system digraph.
","[{'version': 'v1', 'created': 'Tue, 16 Dec 2014 18:29:51 GMT'}]",2014-12-17,"[['Doostmohammadian', 'Mohammadreza', ''], ['Khan', 'Usman A.', '']]","['Observability', 'Structured systems theory', 'Dulmage-Mendelsohn decomposition', 'Observational equiv']"
20001,1708.00497,Chiara Boldrini,"Chiara Boldrini, Raffaele Bruno and Haitam Laarabi",Car sharing through the data analysis lens,"Accepted for KNOWMe: 1st International Workshop on Knowledge
  Discovery from Mobility and Transportation Systems (colocated with PKDD 2017)",,,,cs.CY cs.DB cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Car sharing is one the pillars of a smart transportation infrastructure, as
it is expected to reduce traffic congestion, parking demands and pollution in
our cities. From the point of view of demand modelling, car sharing is a weak
signal in the city landscape: only a small percentage of the population uses
it, and thus it is difficult to study reliably with traditional techniques such
as households travel diaries. In this work, we depart from these traditional
approaches and we rely on web-based, digital records about vehicle availability
in 10 European cities for one of the major active car sharing operators. We
discuss how vehicles are used, what are the main characteristics of car sharing
trips, whether events happening in certain areas are predictable or not, and
how the spatio-temporal information about vehicle availability can be used to
infer how different zones in a city are used by customers. We conclude the
paper by presenting a direct application of the analysis of the dataset, aimed
at identifying where to locate maintenance facilities within the car sharing
operational area.
","[{'version': 'v1', 'created': 'Tue, 25 Jul 2017 13:07:47 GMT'}]",2017-08-03,"[['Boldrini', 'Chiara', ''], ['Bruno', 'Raffaele', ''], ['Laarabi', 'Haitam', '']]","['car sharing', 'smart transportation', 'urban computing', 'datamining']"
20002,1603.08312,Shouhuai Xu,Wenlian Lu and Shouhuai Xu and Xinlei Yi,Optimizing Active Cyber Defense,,"Proceedings of the 4th Conference on Decision and Game Theory for
  Security (GameSec'2013), pp 206-225",,,cs.CR cs.SI cs.SY math.DS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Active cyber defense is one important defensive method for combating cyber
attacks. Unlike traditional defensive methods such as firewall-based filtering
and anti-malware tools, active cyber defense is based on spreading ""white"" or
""benign"" worms to combat against the attackers' malwares (i.e., malicious
worms) that also spread over the network. In this paper, we initiate the study
of {\em optimal} active cyber defense in the setting of strategic attackers
and/or strategic defenders. Specifically, we investigate infinite-time horizon
optimal control and fast optimal control for strategic defenders (who want to
minimize their cost) against non-strategic attackers (who do not consider the
issue of cost). We also investigate the Nash equilibria for strategic defenders
and attackers. We discuss the cyber security meanings/implications of the
theoretic results. Our study brings interesting open problems for future
research.
","[{'version': 'v1', 'created': 'Mon, 28 Mar 2016 05:22:33 GMT'}]",2016-03-29,"[['Lu', 'Wenlian', ''], ['Xu', 'Shouhuai', ''], ['Yi', 'Xinlei', '']]","['cyber security model', 'active cyber defense', 'optimization', 'epidemic model']"
20003,1403.1073,Kieran Greer Dr,Kieran Greer,Artificial Neuron Modelling Based on Wave Shape,Published,"BRAIN. Broad Research in Artificial Intelligence and Neuroscience,
  Volume 4, Issues 1-4, October 2013, pp. 20 - 25, ISSN 2067-3957 (online),
  ISSN 2068 - 0473 (print)",,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a new model for an artificial neural network processing
unit or neuron. It is slightly different to a traditional feedforward network
by the fact that it favours a mechanism of trying to match the wave-like
'shape' of the input with the shape of the output against specific value error
corrections. The expectation is then that a best fit shape can be transposed
into the desired output values more easily. This allows for notions of
reinforcement through resonance and also the construction of synapses.
","[{'version': 'v1', 'created': 'Wed, 5 Mar 2014 11:05:16 GMT'}]",2014-03-06,"[['Greer', 'Kieran', '']]","['Neural network', 'wave shape', 'resonance', 'new algorithm']"
20004,0712.3113,Wim Vanhoof,"Andr\'as Gyorgy B\'ek\'es, P\'eter Szeredi",Optimizing Queries in a Logic-based Information Integration System,"Paper presented at the 17th Workshop on Logic-based Methods in
  Programming Environments (WLPE2007)",,,,cs.PL cs.SE,,"  The SINTAGMA information integration system is an infrastructure for
accessing several different information sources together. Besides providing a
uniform interface to the information sources (databases, web services, web
sites, RDF resources, XML files), semantic integration is also needed. Semantic
integration is carried out by providing a high-level model and the mappings to
the models of the sources. When executing a query of the high level model, a
query is transformed to a low-level query plan, which is a piece of Prolog code
that answers the high-level query. This transformation is done in two phases.
First, the Query Planner produces a plan as a logic formula expressing the
low-level query. Next, the Query Optimizer transforms this formula to
executable Prolog code and optimizes it according to structural and statistical
information about the information sources.
  This article discusses the main ideas of the optimization algorithm and its
implementation.
","[{'version': 'v1', 'created': 'Wed, 19 Dec 2007 08:07:30 GMT'}]",2007-12-20,"[['Békés', 'András Gyorgy', ''], ['Szeredi', 'Péter', '']]","['information integration', 'query planning and optimizing', 'Prolog']"
20005,1501.01386,Rafiullah Khan,"Misbah Daud, Rafiullah Khan, Mohibullah and Aitazaz Daud",Roman Urdu Opinion Mining System (RUOMiS),"8 pages, 2 figures, 4 tables, Computer Science & Engineering: An
  International Journal (CSEIJ)",,,,cs.CL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convincing a customer is always considered as a challenging task in every
business. But when it comes to online business, this task becomes even more
difficult. Online retailers try everything possible to gain the trust of the
customer. One of the solutions is to provide an area for existing users to
leave their comments. This service can effectively develop the trust of the
customer however normally the customer comments about the product in their
native language using Roman script. If there are hundreds of comments this
makes difficulty even for the native customers to make a buying decision. This
research proposes a system which extracts the comments posted in Roman Urdu,
translate them, find their polarity and then gives us the rating of the
product. This rating will help the native and non-native customers to make
buying decision efficiently from the comments posted in Roman Urdu.
","[{'version': 'v1', 'created': 'Wed, 7 Jan 2015 08:04:32 GMT'}]",2015-01-08,"[['Daud', 'Misbah', ''], ['Khan', 'Rafiullah', ''], ['Mohibullah', '', ''], ['Daud', 'Aitazaz', '']]","['Roman Urdu; Comment mining', 'Artificial Intelligence', 'POS']"
20006,1501.00125,Hao Wu,Hao Wu,Maximum Margin Clustering for State Decomposition of Metastable Systems,,,,,cs.LG cs.NA cs.SY math.NA physics.data-an,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When studying a metastable dynamical system, a prime concern is how to
decompose the phase space into a set of metastable states. Unfortunately, the
metastable state decomposition based on simulation or experimental data is
still a challenge. The most popular and simplest approach is geometric
clustering which is developed based on the classical clustering technique.
However, the prerequisites of this approach are: (1) data are obtained from
simulations or experiments which are in global equilibrium and (2) the
coordinate system is appropriately selected. Recently, the kinetic clustering
approach based on phase space discretization and transition probability
estimation has drawn much attention due to its applicability to more general
cases, but the choice of discretization policy is a difficult task. In this
paper, a new decomposition method designated as maximum margin metastable
clustering is proposed, which converts the problem of metastable state
decomposition to a semi-supervised learning problem so that the large margin
technique can be utilized to search for the optimal decomposition without phase
space discretization. Moreover, several simulation examples are given to
illustrate the effectiveness of the proposed method.
","[{'version': 'v1', 'created': 'Wed, 31 Dec 2014 12:50:08 GMT'}]",2015-01-05,"[['Wu', 'Hao', '']]","['metastable states', 'large margin methods', 'clustering analysis', 'semi-supervised learning']"
20007,1609.04203,Florentin Rochet,Florentin Rochet and Olivier Pereira,Waterfiling: Balancing the Tor network with maximum diversity,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the Waterfilling circuit selection method, which we designed in
order to mitigate the risks of a successful end-to-end traffic correlation
attack. Waterfilling proceeds by balancing the Tor network load as evenly as
possible on endpoints of user paths. We simulate the use of Waterfilling thanks
to the TorPS and Shadow tools. Applying several security metrics, we show that
the adoption of Waterfilling considerably increases the number of nodes that an
adversary needs to control in order to be able to mount a successful attack,
while somewhat decreasing the minimum amount of bandwidth required to do so.
Moreover, we evaluate Waterfilling into Shadow and show that it does not impact
significantly the performance of the network. Furthermore, Waterfilling reduces
the benefits that an attacker could obtain by hacking into a top bandwidth Tor
relay, hence limiting the risks raised by such relays.
","[{'version': 'v1', 'created': 'Wed, 14 Sep 2016 10:18:34 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Nov 2016 16:18:57 GMT'}]",2016-12-01,"[['Rochet', 'Florentin', ''], ['Pereira', 'Olivier', '']]","['Tor', 'Path selection algorithm', 'anonymity', 'traffic correlation']"
20008,0908.0764,Gene Golovchinsky,Madhu Reddy and Bernard J. Jansen,"Learning about Potential Users of Collaborative Information Retrieval
  Systems","Presented at 1st Intl Workshop on Collaborative Information Seeking,
  2008 (arXiv:0908.0583)",,,JCDL2008CIRWS/2008/redjan,cs.IR cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the key components of designing usable and useful collaborative
information retrieval systems is to understand the needs of the users of these
systems. Our research team has been exploring collaborative information
behavior in a variety of organizational settings. Our research goals have been
two-fold: First, to develop a conceptual understanding of collaborative
information behavior and second, gather requirements for the design of
collaborative information retrieval systems. In this paper, we present a brief
overview of our fieldwork in a three different organizational settings, discuss
our methodology for collecting data on collaborative information behavior, and
highlight some lessons that we are learning about potential users of
collaborative information retrieval systems in these domains.
","[{'version': 'v1', 'created': 'Wed, 5 Aug 2009 21:54:21 GMT'}]",2009-08-07,"[['Reddy', 'Madhu', ''], ['Jansen', 'Bernard J.', '']]","['Collaborative information retrieval', 'collaborative information behavior', 'users', 'collaborative information retrieval systems']"
20009,1301.6039,Jonathan Heras,J\'onathan Heras and Ekaterina Komendantskaya,Recycling Proof Patterns in Coq: Case Studies,,,,,cs.AI cs.LG cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Development of Interactive Theorem Provers has led to the creation of big
libraries and varied infrastructures for formal proofs. However, despite (or
perhaps due to) their sophistication, the re-use of libraries by non-experts or
across domains is a challenge. In this paper, we provide detailed case studies
and evaluate the machine-learning tool ML4PG built to interactively data-mine
the electronic libraries of proofs, and to provide user guidance on the basis
of proof patterns found in the existing libraries.
","[{'version': 'v1', 'created': 'Fri, 25 Jan 2013 13:29:29 GMT'}, {'version': 'v2', 'created': 'Wed, 6 Nov 2013 14:04:45 GMT'}, {'version': 'v3', 'created': 'Mon, 3 Feb 2014 10:39:54 GMT'}, {'version': 'v4', 'created': 'Fri, 7 Mar 2014 12:30:49 GMT'}]",2014-03-10,"[['Heras', 'Jónathan', ''], ['Komendantskaya', 'Ekaterina', '']]","['Interactive Theorem Proving', 'Coq', 'SSReflect', 'Machine Learning', 'Clustering']"
20010,1604.06996,"Thomas Westerb\""ack","Thomas Westerb\""ack","Parity check systems of nonlinear codes over finite commutative
  Frobenius rings",Submitted for publication,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The concept of parity check matrices of linear binary codes has been extended
by Heden [9] to parity check systems of nonlinear binary codes. In the present
paper we extend this concept to parity check systems of nonlinear codes over
finite commutative Frobenius rings. Using parity check systems, results on how
to get some fundamental properties of the codes are given. Moreover, parity
check systems and its connection to characters is investigated and a
MacWilliams type theorem on the distance distribution is given.
","[{'version': 'v1', 'created': 'Sun, 24 Apr 2016 08:45:08 GMT'}]",2016-04-26,"[['Westerbäck', 'Thomas', '']]","['nonlinear codes', 'finite commutative Frobenius rings', 'parity check systems', 'characters', 'discrete Fourier analysis']"
20011,1008.1902,Stefan Sommer,"Stefan Sommer, Fran\c{c}ois Lauze, Mads Nielsen",Optimization over Geodesics for Exact Principal Geodesic Analysis,"Revised version to be published in Advances in Computational
  Mathematics",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In fields ranging from computer vision to signal processing and statistics,
increasing computational power allows a move from classical linear models to
models that incorporate non-linear phenomena. This shift has created interest
in computational aspects of differential geometry, and solving optimization
problems that incorporate non-linear geometry constitutes an important
computational task. In this paper, we develop methods for numerically solving
optimization problems over spaces of geodesics using numerical integration of
Jacobi fields and second order derivatives of geodesic families. As an
important application of this optimization strategy, we compute exact Principal
Geodesic Analysis (PGA), a non-linear version of the PCA dimensionality
reduction procedure. By applying the exact PGA algorithm to synthetic data, we
exemplify the differences between the linearized and exact algorithms caused by
the non-linear geometry. In addition, we use the numerically integrated Jacobi
fields to determine sectional curvatures and provide upper bounds for
injectivity radii.
","[{'version': 'v1', 'created': 'Wed, 11 Aug 2010 12:59:30 GMT'}, {'version': 'v2', 'created': 'Sat, 11 Sep 2010 11:05:02 GMT'}, {'version': 'v3', 'created': 'Thu, 7 Oct 2010 08:39:42 GMT'}, {'version': 'v4', 'created': 'Thu, 2 May 2013 11:48:35 GMT'}]",2013-05-03,"[['Sommer', 'Stefan', ''], ['Lauze', 'François', ''], ['Nielsen', 'Mads', '']]","['geometric optimization', 'principal geodesic analysis', 'manifoldstatistics', 'differential geometry', 'Riemannian metrics']"
20012,1402.0170,Shu Kong,"Shu Kong, Zhuolin Jiang, Qiang Yang",Collaborative Receptive Field Learning,"16 pages, 8 figures",,,,cs.CV cs.LG cs.MM stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The challenge of object categorization in images is largely due to arbitrary
translations and scales of the foreground objects. To attack this difficulty,
we propose a new approach called collaborative receptive field learning to
extract specific receptive fields (RF's) or regions from multiple images, and
the selected RF's are supposed to focus on the foreground objects of a common
category. To this end, we solve the problem by maximizing a submodular function
over a similarity graph constructed by a pool of RF candidates. However,
measuring pairwise distance of RF's for building the similarity graph is a
nontrivial problem. Hence, we introduce a similarity metric called
pyramid-error distance (PED) to measure their pairwise distances through
summing up pyramid-like matching errors over a set of low-level features.
Besides, in consistent with the proposed PED, we construct a simple
nonparametric classifier for classification. Experimental results show that our
method effectively discovers the foreground objects in images, and improves
classification performance.
","[{'version': 'v1', 'created': 'Sun, 2 Feb 2014 10:11:57 GMT'}]",2014-02-04,"[['Kong', 'Shu', ''], ['Jiang', 'Zhuolin', ''], ['Yang', 'Qiang', '']]","['in our framework', 'receptive fieldlearning', 'submodular function', 'similarity metric']"
20013,1208.3840,Pallavali Radha Krishna Reddy,"MD Sirajul Huque, C Surekha, A Kishore Kumar, Sri Latha",Modelling Dead Rocking In Online Multiplayer Games,Published,"CSC V01 1002, August 2012",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This is the web based application, here we analysis the network traffic which
occurs when the player plays an online game. Here we are going to trace the
current position of the player to rectify the traffic while playing the game.
There are different types of measures for different applications, those can be
normalized and compared with one another but my application can resolve the
inconsistency by knowing the positions quickly and focus on quality of network
(QON) which affects a player to leave the game in middle because of poor
quality of service (QOS). The existing model leads to leave the game because of
network loss from both sides. The proposed model can resolve this problem by
applying the replacement of TCP along with the dejitter buffer (DB) it can
reduce the network loss and by applying the DEAD RECKONING (DR) vector we can
recover the network access because it can view the current position of the
player through this we can rectify why the player leaving the game and checks
the network conditions and try to reactive the game by using mobile devices
automatically or else they receive the message according to the network
conditions.
","[{'version': 'v1', 'created': 'Sun, 19 Aug 2012 14:51:34 GMT'}]",2012-08-21,"[['Huque', 'MD Sirajul', ''], ['Surekha', 'C', ''], ['Kumar', 'A Kishore', ''], ['Latha', 'Sri', '']]","['QOS', 'QON', 'TCP', 'DR vector', 'De-Jitter Buffer']"
20014,1005.4270,Chriss Romy,"V.Kavitha, M. Punithavalli",Clustering Time Series Data Stream - A Literature Survey,"IEEE Publication format, International Journal of Computer Science
  and Information Security, IJCSIS, Vol. 8 No. 1, April 2010, USA. ISSN 1947
  5500, http://sites.google.com/site/ijcsis/",,,,cs.IR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Mining Time Series data has a tremendous growth of interest in today's world.
To provide an indication various implementations are studied and summarized to
identify the different problems in existing applications. Clustering time
series is a trouble that has applications in an extensive assortment of fields
and has recently attracted a large amount of research. Time series data are
frequently large and may contain outliers. In addition, time series are a
special type of data set where elements have a temporal ordering. Therefore
clustering of such data stream is an important issue in the data mining
process. Numerous techniques and clustering algorithms have been proposed
earlier to assist clustering of time series data streams. The clustering
algorithms and its effectiveness on various applications are compared to
develop a new method to solve the existing problem. This paper presents a
survey on various clustering algorithms available for time series datasets.
Moreover, the distinctiveness and restriction of previous research are
discussed and several achievable topics for future study are recognized.
Furthermore the areas that utilize time series clustering are also summarized.
","[{'version': 'v1', 'created': 'Mon, 24 May 2010 07:41:29 GMT'}]",2010-05-25,"[['Kavitha', 'V.', ''], ['Punithavalli', 'M.', '']]","['Data Mining', 'Data Streams', 'Clustering', 'Time Series', 'Machine Learning', 'Unsupervised Learning', 'Feature Extraction', 'Feature Selection']"
20015,1605.02954,Sarbajit Manna,"Sarbajit Manna, Saurabh Dutta",Proposing A Ciphering Protocol,,,,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  This paper describes a novel bit level stream cipher based symmetric key
cryptographic technique. At first, sender and receiver agree upon a symmetric
key. Then the symmetric key is formed using Greatest Common Divisor (G.C.D) of
sum of even or odd bit positional weightth even or odd number and a symmetric
key value is derived from the symmetric by the sender. The symmetric key value
is XORed with the ASCII value of the plain text character to get the cipher
text character. This is repeated for the entire plain text file. The symmetric
key and the entire cipher text file is sent by the sender to the receiver. From
the symmetric key, the receiver calculates the symmetric key value. The
symmetric key value is XORed with the cipher text character to get back the
plain text character. When this process is repeated for every cipher text
character, then entire plain text file is formed by the decryption process.
This technique has several advantages like formation of symmetric key
dynamically, more emphasis on symmetric key value rather than the symmetric
key, security and equal applicability for encryption and decryption of a large
number of files of almost any type or extension.
","[{'version': 'v1', 'created': 'Tue, 10 May 2016 11:45:34 GMT'}]",2016-05-11,"[['Manna', 'Sarbajit', ''], ['Dutta', 'Saurabh', '']]","['Even Number', 'Odd Number', 'Greatest Common Divisor (G.C.D)', 'Stream Cipher', 'Symmetric Key', 'Plain Text', 'Cipher Text']"
20016,1307.2440,Firouz AL-Wassai,"Firouz Abdullah Al-Wassai, N.V. Kalyankar",Image Fusion Technologies In Commercial Remote Sensing Packages,"Keywords: Commercial Processing Systems, Image Fusion, quality
  evaluation","Journal of Global Research in Computer Science, 4 (5), May 2013,
  44-50",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several remote sensing software packages are used to the explicit purpose of
analyzing and visualizing remotely sensed data, with the developing of remote
sensing sensor technologies from last ten years. Accord-ing to literature, the
remote sensing is still the lack of software tools for effective information
extraction from remote sensing data. So, this paper provides a state-of-art of
multi-sensor image fusion technologies as well as review on the quality
evaluation of the single image or fused images in the commercial remote sensing
pack-ages. It also introduces program (ALwassaiProcess) developed for image
fusion and classification.
","[{'version': 'v1', 'created': 'Tue, 9 Jul 2013 13:14:11 GMT'}]",2013-07-10,"[['Al-Wassai', 'Firouz Abdullah', ''], ['Kalyankar', 'N. V.', '']]","['Commercial Processing Systems', 'Image Fusion', 'quality evaluation']"
20017,1704.08657,David Barina,David Barina and Michal Kula and Michal Matysek and Pavel Zemcik,Accelerating Discrete Wavelet Transforms on Parallel Architectures,submitted on WSCG 2017,,,,cs.PF cs.GR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The 2-D discrete wavelet transform (DWT) can be found in the heart of many
image-processing algorithms. Until recently, several studies have compared the
performance of such transform on various shared-memory parallel architectures,
especially on graphics processing units (GPUs). All these studies, however,
considered only separable calculation schemes. We show that corresponding
separable parts can be merged into non-separable units, which halves the number
of steps. In addition, we introduce an optional optimization approach leading
to a reduction in the number of arithmetic operations. The discussed schemes
were adapted on the OpenCL framework and pixel shaders, and then evaluated
using GPUs of two biggest vendors. We demonstrate the performance of the
proposed non-separable methods by comparison with existing separable schemes.
The non-separable schemes outperform their separable counterparts on numerous
setups, especially considering the pixel shaders.
","[{'version': 'v1', 'created': 'Thu, 27 Apr 2017 17:01:07 GMT'}, {'version': 'v2', 'created': 'Mon, 29 May 2017 17:39:27 GMT'}]",2017-05-30,"[['Barina', 'David', ''], ['Kula', 'Michal', ''], ['Matysek', 'Michal', ''], ['Zemcik', 'Pavel', '']]","['Discrete wavelet transform', 'Image processing', 'Synchronization', 'Graphics processors']"
20018,1304.7397,Fenix Huang,Fenix W.D. Huang and Markus E. Nebel and Christian M. Reidys,Uniform generation of RNA pseudoknot structures with genus filtration,"11 figures, 25 pages",,,,cs.CE math.CO q-bio.BM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a sampling framework for RNA structures of fixed
topological genus. We introduce a novel, linear time, uniform sampling
algorithm for RNA structures of fixed topological genus $g$, for arbitrary
$g>0$. Furthermore we develop a linear time sampling algorithm for RNA
structures of fixed topological genus $g$ that are weighted by a simplified,
loop-based energy functional. For this process the partition function of the
energy functional has to be computed once, which has $O(n^2)$ time complexity.
","[{'version': 'v1', 'created': 'Sat, 27 Apr 2013 18:34:22 GMT'}]",2013-04-30,"[['Huang', 'Fenix W. D.', ''], ['Nebel', 'Markus E.', ''], ['Reidys', 'Christian M.', '']]","['RNA secondary structure', 'RNA pseudoknot structure', 'diagram', 'topological surface', 'genus', 'partition function', 'sampling']"
20019,1610.04286,Andrei Rusu,"Andrei A. Rusu, Mel Vecerik, Thomas Roth\""orl, Nicolas Heess, Razvan
  Pascanu, Raia Hadsell",Sim-to-Real Robot Learning from Pixels with Progressive Nets,,,,,cs.RO cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Applying end-to-end learning to solve complex, interactive, pixel-driven
control tasks on a robot is an unsolved problem. Deep Reinforcement Learning
algorithms are too slow to achieve performance on a real robot, but their
potential has been demonstrated in simulated environments. We propose using
progressive networks to bridge the reality gap and transfer learned policies
from simulation to the real world. The progressive net approach is a general
framework that enables reuse of everything from low-level visual features to
high-level policies for transfer to new tasks, enabling a compositional, yet
simple, approach to building complex skills. We present an early demonstration
of this approach with a number of experiments in the domain of robot
manipulation that focus on bridging the reality gap. Unlike other proposed
approaches, our real-world experiments demonstrate successful task learning
from raw visual input on a fully actuated robot manipulator. Moreover, rather
than relying on model-based trajectory optimisation, the task learning is
accomplished using only deep reinforcement learning and sparse rewards.
","[{'version': 'v1', 'created': 'Thu, 13 Oct 2016 22:42:10 GMT'}, {'version': 'v2', 'created': 'Tue, 22 May 2018 08:56:59 GMT'}]",2018-05-23,"[['Rusu', 'Andrei A.', ''], ['Vecerik', 'Mel', ''], ['Rothörl', 'Thomas', ''], ['Heess', 'Nicolas', ''], ['Pascanu', 'Razvan', ''], ['Hadsell', 'Raia', '']]","['Robot learning', 'transfer', 'progressive networks', 'sim-to-real', 'CoRL']"
20020,1109.6199,Wazir Zada Khan,"Wazir Zada Khan, Mohammed Y. Aalsalem and Quratul Ain Arshad",The Aware Cricket Ground,"5 pages, 5 figure","IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 4, No 2, July 2011",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The most profound technologies are those that disappear. They weave
themselves into fabrics of everyday life until they are indistinguishable from
it [1]. This research work is a mere effort for automated decision making
during sports of most common interest leveraging ubiquitous computing.
Primarily cricket has been selected for the first implementation of the idea. A
positioning system is used for locating the objects moving in the field. Main
objectives of the research are to help achieve the following goals. 1) Make
Decisions where human eye can make error due to human limitations. 2) Simulate
the Match activity during and after the game in a 3D computerized Graphics
system. 3) Make various types of game and performance analysis of a certain
team or a player.
","[{'version': 'v1', 'created': 'Wed, 28 Sep 2011 13:25:52 GMT'}]",2011-09-29,"[['Khan', 'Wazir Zada', ''], ['Aalsalem', 'Mohammed Y.', ''], ['Arshad', 'Quratul Ain', '']]","['Ubiquitous Computing', 'Decision making', 'Context Awareness', 'Sports']"
20021,1606.03897,Joong Chae Na,"Joong Chae Na, Hyunjoon Kim, Seunghwan Min, Heejin Park, Thierry
  Lecroq, Martine Leonard, Laurent Mouchardd, Kunsoo Park",FM-index of Alignment with Gaps,15pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, a compressed index for similar strings, called the FM-index of
alignment (FMA), has been proposed with the functionalities of pattern search
and random access. The FMA is quite efficient in space requirement and pattern
search time, but it is applicable only for an alignment of similar strings
without gaps. In this paper we propose the FM-index of alignment with gaps, a
realistic index for similar strings, which allows gaps in their alignment. For
this, we design a new version of the suffix array of alignment by using
alignment transformation and a new definition of the alignment-suffix. The new
suffix array of alignment enables us to support the LF-mapping and backward
search, the key functionalities of the FM-index, regardless of gap existence in
the alignment. We experimentally compared our index with RLCSA due to Makinen
et al. on 100 genome sequences from the 1000 Genomes Project. The index size of
our index is less than one third of that of RLCSA.
","[{'version': 'v1', 'created': 'Mon, 13 Jun 2016 11:23:45 GMT'}]",2016-06-14,"[['Na', 'Joong Chae', ''], ['Kim', 'Hyunjoon', ''], ['Min', 'Seunghwan', ''], ['Park', 'Heejin', ''], ['Lecroq', 'Thierry', ''], ['Leonard', 'Martine', ''], ['Mouchardd', 'Laurent', ''], ['Park', 'Kunsoo', '']]","['Indexes for similar strings', 'FM-indexes', 'Suffix arrays', 'Alignments', 'Backward search']"
20022,1406.4286,Sudip Mittal,"Sudip Mittal, Ponnurangam Kumaraguru","Broker Bots: Analyzing automated activity during High Impact Events on
  Twitter",,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Twitter is now an established and a widely popular news medium. Be it normal
banter or a discussion on high impact events like Boston marathon blasts,
February 2014 US Icestorm, etc., people use Twitter to get updates. Twitter
bots have today become very common and acceptable. People are using them to get
updates about emergencies like natural disasters, terrorist strikes, etc.
Twitter bots provide these users a means to perform certain tasks on Twitter
that are both simple and structurally repetitive. During high impact events
these Twitter bots tend to provide time critical and comprehensive information.
We present how bots participate in discussions and augment them during high
impact events. We identify bots in high impact events for 2013: Boston blasts,
February 2014 US Icestorm, Washington Navy Yard Shooting, Oklahoma tornado, and
Cyclone Phailin. We identify bots among top tweeters by getting all such
accounts manually annotated. We then study their activity and present many
important insights. We determine the impact bots have on information diffusion
during these events and how they tend to aggregate and broker information from
various sources to different users. We also analyzed their tweets, list down
important differentiating features between bots and non bots (normal or human
accounts) during high impact events. We also show how bots are slowly moving
away from traditional API based posts towards web automation platforms like
IFTTT, dlvr.it, etc. Using standard machine learning, we proposed a methodology
to identify bots/non bots in real time during high impact events. This study
also looks into how the bot scenario has changed by comparing data from high
impact events from 2013 with data from similar type of events from 2011.
Lastly, we also go through an in-depth analysis of Twitter bots who were active
during 2013 Boston Marathon Blast.
","[{'version': 'v1', 'created': 'Tue, 17 Jun 2014 09:23:20 GMT'}]",2014-06-18,"[['Mittal', 'Sudip', ''], ['Kumaraguru', 'Ponnurangam', '']]","['Social Engineering', 'Automated Activity', 'Bots', 'high impact events', 'Privacy andSecurity', 'Online Social Networks', 'Twitter']"
20023,1710.02627,Saurabh Hukerikar,Saurabh Hukerikar and Christian Engelmann,Pattern-based Modeling of High-Performance Computing Resilience,"International European Conference on Parallel and Distributed
  Computing (Euro-Par) 2017 Workshops",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the growing scale and complexity of high-performance computing (HPC)
systems, resilience solutions that ensure continuity of service despite
frequent errors and component failures must be methodically designed to balance
the reliability requirements with the overheads to performance and power.
Design patterns enable a structured approach to the development of resilience
solutions, providing hardware and software designers with the building block
elements for the rapid development of novel solutions and for adapting existing
technologies for emerging, extreme-scale HPC environments. In this paper, we
develop analytical models that enable designers to evaluate the reliability and
performance characteristics of the design patterns. These models are
particularly useful in building a unified framework that analyzes and compares
various resilience solutions built using a combination of patterns.
","[{'version': 'v1', 'created': 'Sat, 7 Oct 2017 03:13:20 GMT'}]",2017-10-10,"[['Hukerikar', 'Saurabh', ''], ['Engelmann', 'Christian', '']]","['high-performance computing', 'resilience', 'patterns', 'performance', 'reliability', 'modeling']"
20024,1307.3356,A B M Moniruzzaman Mr.,A B M Moniruzzaman and Dr Syed Akhter Hossain,Comparative Study on Agile software development methodologies,"25 pages, 25 images, 86 references used, with authors biographies","Global Journal of Computer Science and Technology (c) Volume 13
  Issue 7 Version I",,,cs.SE,http://creativecommons.org/licenses/by/3.0/,"  Today-s business environment is very much dynamic, and organisations are
constantly changing their software requirements to adjust with new environment.
They also demand for fast delivery of software products as well as for
accepting changing requirements. In this aspect, traditional plan-driven
developments fail to meet up these requirements. Though traditional software
development methodologies, such as life cycle-based structured and object
oriented approaches, continue to dominate the systems development few decades
and much research has done in traditional methodologies, Agile software
development brings its own set of novel challenges that must be addressed to
satisfy the customer through early and continuous delivery of the valuable
software. It is a set of software development methods based on iterative and
incremental development process, where requirements and development evolve
through collaboration between self-organizing, cross-functional teams that
allows rapid delivery of high quality software to meet customer needs and also
accommodate changes in the requirements. In this paper, we significantly
identify and describe the major factors, that Agile development approach
improves software development process to meet the rapid changing business
environments. We also provide a brief comparison of agile development
methodologies with traditional systems development methodologies, and discuss
current state of adopting agile methodologies. We speculate that from the need
to satisfy the customer through early and continuous delivery of the valuable
software, Agile software development is emerged as an alternative to
traditional plan-based software development methods. The purpose of this paper,
is to provide an in-depth understanding, the major benefits of agile
development approach to software development industry, as well as provide a
comparison study report of ASDM over TSDM.
","[{'version': 'v1', 'created': 'Fri, 12 Jul 2013 07:52:39 GMT'}]",2013-07-15,"[['Moniruzzaman', 'A B M', ''], ['Hossain', 'Dr Syed Akhter', '']]","['agile', 'traditional methods', 'Agile Adoption', 'SCRUM', 'XP']"
20025,1105.0479,Shailesh Vaya,Shailesh Vaya,Faster Gossiping in Bidirectional Radio Networks with Large Labels,,,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider unknown ad-hoc radio networks, when the underlying network is
bidirectional and nodes can have polynomially large labels. For this model, we
present a deterministic protocol for gossiping which takes $O(n \lg^2 n \lg \lg
n)$ rounds. This improves upon the previous best result for deterministic
gossiping for this model by [Gasienec, Potapov, Pagourtizis, Deterministic
Gossiping in Radio Networks with Large labels, ESA (2002)], who present a
protocol of round complexity $O(n \lg^3 n \lg \lg n)$ for this problem. This
resolves open problem posed in [Gasienec, Efficient gossiping in radio
networks, SIROCCO (2009)], who cite bridging gap between lower and upper bounds
for this problem as an important objective. We emphasize that a salient feature
of our protocol is its simplicity, especially with respect to the previous best
known protocol for this problem.
","[{'version': 'v1', 'created': 'Tue, 3 May 2011 06:06:15 GMT'}]",2011-05-04,"[['Vaya', 'Shailesh', '']]","['Deterministic gossiping', 'Unknown radio networks', 'Gossiping', 'Polynomially large labels', 'Bidirectional networks']"
20026,1609.02960,Nizar Habash,"Salam Khalifa, Nizar Habash, Dana Abdulrahim, Sara Hassan",A Large Scale Corpus of Gulf Arabic,Language Resources and Evaluation Conference 2016,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most Arabic natural language processing tools and resources are developed to
serve Modern Standard Arabic (MSA), which is the official written language in
the Arab World. Some Dialectal Arabic varieties, notably Egyptian Arabic, have
received some attention lately and have a growing collection of resources that
include annotated corpora and morphological analyzers and taggers. Gulf Arabic,
however, lags behind in that respect. In this paper, we present the Gumar
Corpus, a large-scale corpus of Gulf Arabic consisting of 110 million words
from 1,200 forum novels. We annotate the corpus for sub-dialect information at
the document level. We also present results of a preliminary study in the
morphological annotation of Gulf Arabic which includes developing guidelines
for a conventional orthography. The text of the corpus is publicly browsable
through a web interface we developed for it.
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2016 22:22:53 GMT'}]",2016-09-13,"[['Khalifa', 'Salam', ''], ['Habash', 'Nizar', ''], ['Abdulrahim', 'Dana', ''], ['Hassan', 'Sara', '']]","['Arabic Dialects', 'Corpus', 'Large-Scale', 'Gulf Arabic']"
20027,1304.5378,Prasanth G Narasimha-Shenoi,"R. Ram Kumar, Kannan Balakrishnan, Prasanth G. Narasimha-Shenoi",Fair Sets of Some Class of Graphs,"14 pages, 4 figures",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a non empty set $S$ of vertices of a graph, the partiality of a vertex
with respect to $S$ is the difference between maximum and minimum of the
distances of the vertex to the vertices of $S$. The vertices with minimum
partiality constitute the fair center of the set. Any vertex set which is the
fair center of some set of vertices is called a fair set. In this paper we
prove that the induced subgraph of any fair set is connected in the case of
trees and characterise block graphs as the class of chordal graphs for which
the induced subgraph of all fair sets are connected. The fair sets of $K_{n}$,
$K_{m,n}$, $K_{n}-e$, wheel graphs, odd cycles and symmetric even graphs are
identified. The fair sets of the Cartesian product graphs are also discussed.
","[{'version': 'v1', 'created': 'Fri, 19 Apr 2013 11:32:42 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Apr 2013 14:02:18 GMT'}]",2013-04-25,"[['Kumar', 'R. Ram', ''], ['Balakrishnan', 'Kannan', ''], ['Narasimha-Shenoi', 'Prasanth G.', '']]","['Partiality', 'Fair Center', 'Fair Set', 'Block Graphs', 'Chordal Graphs', 'Symmetric EvenGraphs']"
20028,1603.04771,Ayan Chakrabarti,Ayan Chakrabarti,A Neural Approach to Blind Motion Deblurring,ECCV 2016. Project page at http://www.ttic.edu/chakrabarti/ndeblur,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new method for blind motion deblurring that uses a neural
network trained to compute estimates of sharp image patches from observations
that are blurred by an unknown motion kernel. Instead of regressing directly to
patch intensities, this network learns to predict the complex Fourier
coefficients of a deconvolution filter to be applied to the input patch for
restoration. For inference, we apply the network independently to all
overlapping patches in the observed image, and average its outputs to form an
initial estimate of the sharp image. We then explicitly estimate a single
global blur kernel by relating this estimate to the observed image, and finally
perform non-blind deconvolution with this kernel. Our method exhibits accuracy
and robustness close to state-of-the-art iterative methods, while being much
faster when parallelized on GPU hardware.
","[{'version': 'v1', 'created': 'Tue, 15 Mar 2016 17:35:26 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Aug 2016 18:53:00 GMT'}]",2016-08-02,"[['Chakrabarti', 'Ayan', '']]","['Blind deconvolution', 'motion deblurring', 'deep learning']"
20029,1610.09455,Arjun Chaudhuri,Arjun Chaudhuri,Selective De-noising of Sparse-Coloured Images,"4 pages, 5 figures, International Journal of Computer Science and
  Information Technologies, ISSN: 0975-9646, March-April, 2016, Website:
  http://www.ijcsit.com/",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Since time immemorial, noise has been a constant source of disturbance to the
various entities known to mankind. Noise models of different kinds have been
developed to study noise in more detailed fashion over the years. Image
processing, particularly, has extensively implemented several algorithms to
reduce noise in photographs and pictorial documents to alleviate the effect of
noise. Images with sparse colours-lesser number of distinct colours in them-are
common nowadays, especially in astronomy and astrophysics where black and white
colours form the main components. Additive noise of Gaussian type is the most
common form of noise to be studied and analysed in majority of communication
channels, namely-satellite links, mobile base station to local cellular tower
communication channel,et. al. Most of the time, we encounter images from
astronomical sources being distorted with noise maximally as they travel long
distance from telescopes in outer space to Earth. Considering Additive White
Gaussian Noise(AWGN) to be the common noise in these long distance channels,
this paper provides an insight and an algorithmic approach to pixel-specific
de-noising of sparse-coloured images affected by AWGN. The paper concludes with
some essential future avenues and applications of this de-noising method in
industry and academia.
","[{'version': 'v1', 'created': 'Sat, 29 Oct 2016 04:59:24 GMT'}]",2016-11-01,"[['Chaudhuri', 'Arjun', '']]","['De-noising', 'Gaussian', 'Redistribution', 'Selective']"
20030,1501.01242,Eric Heim,"Eric Heim (1), Matthew Berger (2), Lee M. Seversky (2), and Milos
  Hauskrecht (1) ((1) University of Pittsburgh, (2) Air Force Research
  Laboratory, Information Directorate)",Efficient Online Relative Comparison Kernel Learning,"Extended version of the paper appearing in The Proceedings of the
  2015 SIAM International Conference on Data Mining (SDM15)",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning a kernel matrix from relative comparison human feedback is an
important problem with applications in collaborative filtering, object
retrieval, and search. For learning a kernel over a large number of objects,
existing methods face significant scalability issues inhibiting the application
of these methods to settings where a kernel is learned in an online and timely
fashion. In this paper we propose a novel framework called Efficient online
Relative comparison Kernel LEarning (ERKLE), for efficiently learning the
similarity of a large set of objects in an online manner. We learn a kernel
from relative comparisons via stochastic gradient descent, one query response
at a time, by taking advantage of the sparse and low-rank properties of the
gradient to efficiently restrict the kernel to lie in the space of positive
semidefinite matrices. In addition, we derive a passive-aggressive online
update for minimally satisfying new relative comparisons as to not disrupt the
influence of previously obtained comparisons. Experimentally, we demonstrate a
considerable improvement in speed while obtaining improved or comparable
accuracy compared to current methods in the online learning setting.
","[{'version': 'v1', 'created': 'Tue, 6 Jan 2015 17:19:06 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Jan 2015 14:10:03 GMT'}]",2015-01-13,"[['Heim', 'Eric', ''], ['Berger', 'Matthew', ''], ['Seversky', 'Lee M.', ''], ['Hauskrecht', 'Milos', '']]","['Online Learning', 'Kernel Learning', 'Relative Comparisons']"
20031,0712.1609,Soummya Kar,Soummya Kar and Jose M.F.Moura,"Distributed Consensus Algorithms in Sensor Networks: Quantized Data and
  Random Link Failures","31 pages, 2 figures. Original version submitted Nov, 2007. Revised on
  Aug, 2008. Re-revised on Sept. 2009. Accepted fpr piblication in the IEEE
  Transactions on Signal Processing with mandatory revisions",,,,cs.MA cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper studies the problem of distributed average consensus in sensor
networks with quantized data and random link failures. To achieve consensus,
dither (small noise) is added to the sensor states before quantization. When
the quantizer range is unbounded (countable number of quantizer levels),
stochastic approximation shows that consensus is asymptotically achieved with
probability one and in mean square to a finite random variable. We show that
the meansquared error (m.s.e.) can be made arbitrarily small by tuning the link
weight sequence, at a cost of the convergence rate of the algorithm. To study
dithered consensus with random links when the range of the quantizer is
bounded, we establish uniform boundedness of the sample paths of the unbounded
quantizer. This requires characterization of the statistical properties of the
supremum taken over the sample paths of the state of the quantizer. This is
accomplished by splitting the state vector of the quantizer in two components:
one along the consensus subspace and the other along the subspace orthogonal to
the consensus subspace. The proofs use maximal inequalities for submartingale
and supermartingale sequences. From these, we derive probability bounds on the
excursions of the two subsequences, from which probability bounds on the
excursions of the quantizer state vector follow. The paper shows how to use
these probability bounds to design the quantizer parameters and to explore
tradeoffs among the number of quantizer levels, the size of the quantization
steps, the desired probability of saturation, and the desired level of accuracy
$\epsilon$ away from consensus. Finally, the paper illustrates the quantizer
design with a numerical study.
","[{'version': 'v1', 'created': 'Mon, 10 Dec 2007 21:38:42 GMT'}, {'version': 'v2', 'created': 'Mon, 30 Mar 2009 20:11:13 GMT'}, {'version': 'v3', 'created': 'Mon, 28 Sep 2009 18:49:42 GMT'}]",2009-09-28,"[['Kar', 'Soummya', ''], ['Moura', 'Jose M. F.', '']]","['Consensus', 'quantized', 'random link failures', 'stochastic approximation', 'convergence', 'bounded quan']"
20032,1406.7525,Wenqi Huang,"Wenqi Huang, Xiaojin Gong",Fusion Based Holistic Road Scene Understanding,"14 pages,11 figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the problem of holistic road scene understanding based
on the integration of visual and range data. To achieve the grand goal, we
propose an approach that jointly tackles object-level image segmentation and
semantic region labeling within a conditional random field (CRF) framework.
Specifically, we first generate semantic object hypotheses by clustering 3D
points, learning their prior appearance models, and using a deep learning
method for reasoning their semantic categories. The learned priors, together
with spatial and geometric contexts, are incorporated in CRF. With this
formulation, visual and range data are fused thoroughly, and moreover, the
coupled segmentation and semantic labeling problem can be inferred via Graph
Cuts. Our approach is validated on the challenging KITTI dataset that contains
diverse complicated road scenarios. Both quantitative and qualitative
evaluations demonstrate its effectiveness.
","[{'version': 'v1', 'created': 'Sun, 29 Jun 2014 17:11:25 GMT'}]",2014-07-01,"[['Huang', 'Wenqi', ''], ['Gong', 'Xiaojin', '']]","['Road scene understanding', 'Object-level image segmentation', 'Semantic region labeling', 'Data fusion', 'Jointoptimization']"
20033,1710.04778,Donghuan Lu,"Donghuan Lu, Morgan Heisler, Sieun Lee, Gavin Ding, Marinko V. Sarunic
  and Mirza Faisal Beg","Retinal Fluid Segmentation and Detection in Optical Coherence Tomography
  Images using Fully Convolutional Neural Network","9 pages, 5 figures, MICCAI Retinal OCT Fluid Challenge 2017",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  As a non-invasive imaging modality, optical coherence tomography (OCT) can
provide micrometer-resolution 3D images of retinal structures. Therefore it is
commonly used in the diagnosis of retinal diseases associated with edema in and
under the retinal layers. In this paper, a new framework is proposed for the
task of fluid segmentation and detection in retinal OCT images. Based on the
raw images and layers segmented by a graph-cut algorithm, a fully convolutional
neural network was trained to recognize and label the fluid pixels. Random
forest classification was performed on the segmented fluid regions to detect
and reject the falsely labeled fluid regions. The leave-one-out cross
validation experiments on the RETOUCH database show that our method performs
well in both segmentation (mean Dice: 0.7317) and detection (mean AUC: 0.985)
tasks.
","[{'version': 'v1', 'created': 'Fri, 13 Oct 2017 01:51:01 GMT'}]",2017-10-16,"[['Lu', 'Donghuan', ''], ['Heisler', 'Morgan', ''], ['Lee', 'Sieun', ''], ['Ding', 'Gavin', ''], ['Sarunic', 'Marinko V.', ''], ['Beg', 'Mirza Faisal', '']]","['Retinal fluid', 'OCT', 'Fully convolutional network', 'Randomforest']"
20034,0706.1860,Jordi Cucurull,"Jordi Cucurull, Ramon Marti, Sergi Robles, Joan Borrell, Guillermo
  Navarro",FIPA-based Interoperable Agent Mobility Proposal,"10 pages, agent migration architecture proposal",,,,cs.MA cs.NI,,"  This paper presents a proposal for a flexible agent mobility architecture
based on IEEE-FIPA standards and intended to be one of them. This proposal is a
first step towards interoperable mobility mechanisms, which are needed for
future agent migration between different kinds of platforms. Our proposal is
presented as a flexible and robust architecture that has been successfully
implemented in the JADE and AgentScape platforms. It is based on an open set of
protocols, allowing new protocols and future improvements to be accommodated in
the architecture. With this proposal we demonstrate that a standard
architecture for agent mobility capable of supporting several agent platforms
can be defined and implemented.
","[{'version': 'v1', 'created': 'Wed, 13 Jun 2007 14:37:58 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Aug 2007 10:57:01 GMT'}]",2011-11-10,"[['Cucurull', 'Jordi', ''], ['Marti', 'Ramon', ''], ['Robles', 'Sergi', ''], ['Borrell', 'Joan', ''], ['Navarro', 'Guillermo', '']]","['Mobile Agents', 'interoperability', 'FIPA', 'mobility', 'migration architecture']"
20035,1511.07847,Ulrich Pferschy,Andreas Darmann and Ulrich Pferschy and Joachim Schauer,The Shortest Connection Game,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce Shortest Connection Game, a two-player game played on a directed
graph with edge costs. Given two designated vertices in which they start, the
players take turns in choosing edges emanating from the vertex they are
currently located at. In this way, each of the players forms a path that
origins from its respective starting vertex. The game ends as soon as the two
paths meet, i.e., a connection between the players is established. Each player
has to carry the cost of its chosen edges and thus aims at minimizing its own
total cost.
  In this work we analyze the computational complexity of Shortest Connection
Game. On the negative side, the game turns out to be computationally hard even
on restricted graph classes such as bipartite, acyclic and cactus graphs. On
the positive side, we can give a polynomial time algorithm for cactus graphs
when the game is restricted to simple paths.
","[{'version': 'v1', 'created': 'Tue, 24 Nov 2015 19:55:50 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Nov 2015 15:13:06 GMT'}]",2015-11-26,"[['Darmann', 'Andreas', ''], ['Pferschy', 'Ulrich', ''], ['Schauer', 'Joachim', '']]","['shortest path problem', 'game theory', 'computational complexity', 'cactus graph']"
20036,1701.02472,Mikhail Batsyn,"Ilya Bychkov, Mikhail Batsyn","An efficient exact model for the cell formation problem with a variable
  number of production cells","12 pages, 2 figures, 9 tables",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Cell Formation Problem has been studied as an optimization problem in
manufacturing for more than 90 years. It consists of grouping machines and
parts into manufacturing cells in order to maximize loading of cells and
minimize movement of parts from one cell to another. Many heuristic algorithms
have been proposed which are doing well even for large-sized instances.
However, only a few authors have aimed to develop exact methods and most of
these methods have some major restrictions such as a fixed number of production
cells for example. In this paper we suggest a new mixed-integer linear
programming model for solving the cell formation problem with a variable number
of manufacturing cells. The popular grouping efficacy measure is used as an
objective function. To deal with its fractional nature we apply the Dinkelbach
approach. Our computational experiments are performed on two testsets: the
first consists of 35 well-known instances from the literature and the second
contains 32 instances less popular. We solve these instances using CPLEX
software. Optimal solutions have been found for 63 of the 67 considered problem
instances and several new solutions unknown before have been obtained. The
computational times are greatly decreased comparing to the state-of-art
approaches.
","[{'version': 'v1', 'created': 'Tue, 10 Jan 2017 08:35:34 GMT'}, {'version': 'v2', 'created': 'Sun, 27 Aug 2017 19:15:18 GMT'}]",2017-08-29,"[['Bychkov', 'Ilya', ''], ['Batsyn', 'Mikhail', '']]","['cell formation problem', 'cellular manufacturing', 'fractional objective', 'two-index model', 'grouping efficacy']"
20037,1609.01088,Evgeny Burnaev,"Mikhail Belyaev, Evgeny Burnaev, Ermek Kapushev, Maxim Panov, Pavel
  Prikhodko, Dmitry Vetrov, Dmitry Yarotsky",GTApprox: surrogate modeling for industrial design,"31 pages, 11 figures",,,,cs.MS cs.CE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe GTApprox - a new tool for medium-scale surrogate modeling in
industrial design. Compared to existing software, GTApprox brings several
innovations: a few novel approximation algorithms, several advanced methods of
automated model selection, novel options in the form of hints. We demonstrate
the efficiency of GTApprox on a large collection of test problems. In addition,
we describe several applications of GTApprox to real engineering problems.
","[{'version': 'v1', 'created': 'Mon, 5 Sep 2016 10:41:14 GMT'}]",2016-09-06,"[['Belyaev', 'Mikhail', ''], ['Burnaev', 'Evgeny', ''], ['Kapushev', 'Ermek', ''], ['Panov', 'Maxim', ''], ['Prikhodko', 'Pavel', ''], ['Vetrov', 'Dmitry', ''], ['Yarotsky', 'Dmitry', '']]","['approximation', 'surrogate model', 'surrogate-based optimization']"
20038,1401.5287,Antonios Kalampakas,Antonios Kalampakas,k-Colorability is Graph Automaton Recognizable,,,,,cs.FL cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automata operating on general graphs have been introduced by virtue of
graphoids. In this paper we construct a graph automaton that recognizes
$k$-colorable graphs.
","[{'version': 'v1', 'created': 'Tue, 21 Jan 2014 12:17:53 GMT'}]",2014-01-22,"[['Kalampakas', 'Antonios', '']]","['formal languages', 'automata theory', 'graph colorability']"
20039,1511.02956,Maxime Chevalier-Boisvert,Maxime Chevalier-Boisvert and Marc Feeley,"Interprocedural Type Specialization of JavaScript Programs Without Type
  Analysis","10 pages, 10 figures, submitted to CGO 2016",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dynamically typed programming languages such as Python and JavaScript defer
type checking to run time. VM implementations can improve performance by
eliminating redundant dynamic type checks. However, type inference analyses are
often costly and involve tradeoffs between compilation time and resulting
precision. This has lead to the creation of increasingly complex multi-tiered
VM architectures.
  Lazy basic block versioning is a simple JIT compilation technique which
effectively removes redundant type checks from critical code paths. This novel
approach lazily generates type-specialized versions of basic blocks on-the-fly
while propagating context-dependent type information. This approach does not
require the use of costly program analyses, is not restricted by the precision
limitations of traditional type analyses.
  This paper extends lazy basic block versioning to propagate type information
interprocedurally, across function call boundaries. Our implementation in a
JavaScript JIT compiler shows that across 26 benchmarks, interprocedural basic
block versioning eliminates more type tag tests on average than what is
achievable with static type analysis without resorting to code transformations.
On average, 94.3% of type tag tests are eliminated, yielding speedups of up to
56%. We also show that our implementation is able to outperform Truffle/JS on
several benchmarks, both in terms of execution time and compilation time.
","[{'version': 'v1', 'created': 'Tue, 10 Nov 2015 01:29:01 GMT'}]",2015-11-11,"[['Chevalier-Boisvert', 'Maxime', ''], ['Feeley', 'Marc', '']]","['Just-In-Time Compilation', 'Dynamic Language', 'Optimization', 'Object Oriented', 'JavaScript']"
20040,1609.06678,J\'eferson Campos Nobre,J\'eferson Campos Nobre and Lisandro Zambenedetti Granville,"Consistency Maintenance of State of Management Data in P2P-based
  Autonomic Network Management",25 pages,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Complex Dynamic Networks can be exploited in solving problems where
traditional solutions may not be sufficient. The increasing complexity of
computer networks imposes problems to the current network management solutions.
In this context, network management is an example of a research area that could
benefit from the use of CDNs. However, the consistency of state of management
data among the elements that build management CDNs (management nodes) is an
important challenge. Traditional mechanisms to maintain consistency of these
states are supported by some centralization which wastes some desirable
properties of CDNs (e.g., robustness). In contrast to these mechanisms, we
propose a distributed, scalable and robust mechanism to maintain the
consistency of state of management data in management CDNs. Our mechanism
introduces multi-agent truth maintenance features and communication strategies
based on dynamic process to provide consistency maintenance of state of
management data. We developed a model of a management CDN on Peersim simulator
to perform experiments. Besides, 2 case studies are presented. The result
obtained supports our scalability and robustness claims.
","[{'version': 'v1', 'created': 'Wed, 21 Sep 2016 18:45:32 GMT'}]",2016-09-22,"[['Nobre', 'Jéferson Campos', ''], ['Granville', 'Lisandro Zambenedetti', '']]","['Network/service operations and management', 'DTMS', 'MAS']"
20041,1704.01599,Christina Lioma Assoc. Prof,Christina Lioma and Birger Larsen and Wei Lu,Rhetorical relations for information retrieval,,,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Typically, every part in most coherent text has some plausible reason for its
presence, some function that it performs to the overall semantics of the text.
Rhetorical relations, e.g. contrast, cause, explanation, describe how the parts
of a text are linked to each other. Knowledge about this socalled discourse
structure has been applied successfully to several natural language processing
tasks. This work studies the use of rhetorical relations for Information
Retrieval (IR): Is there a correlation between certain rhetorical relations and
retrieval performance? Can knowledge about a document's rhetorical relations be
useful to IR? We present a language model modification that considers
rhetorical relations when estimating the relevance of a document to a query.
Empirical evaluation of different versions of our model on TREC settings shows
that certain rhetorical relations can benefit retrieval effectiveness notably
(> 10% in mean average precision over a state-of-the-art baseline).
","[{'version': 'v1', 'created': 'Wed, 5 Apr 2017 18:21:39 GMT'}]",2017-04-07,"[['Lioma', 'Christina', ''], ['Larsen', 'Birger', ''], ['Lu', 'Wei', '']]","['Rhetorical relations', 'discourse structure', 'retrieval model', 'probabilistic retrieval']"
20042,1609.05942,Christian Ikenmeyer,Christian Ikenmeyer and Stefan Mengel,"On the relative power of reduction notions in arithmetic circuit
  complexity",,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We show that the two main reduction notions in arithmetic circuit complexity,
p-projections and c-reductions, differ in power. We do so by showing
unconditionally that there are polynomials that are VNP-complete under
c-reductions but not under p-projections. We also show that the question of
which polynomials are VNP-complete under which type of reductions depends on
the underlying field.
","[{'version': 'v1', 'created': 'Mon, 19 Sep 2016 21:18:41 GMT'}]",2016-09-21,"[['Ikenmeyer', 'Christian', ''], ['Mengel', 'Stefan', '']]","['arithmetic circuits', 'reductions', 'p-projection', 'c-reduction', 'Hamiltonian cycle polynomial']"
20043,1008.3561,Marinela Miladinova,"Rana Naim, Mohammad Fahim Nizam, Sheetal Hanamasagar, Jalal
  Noureddine, Marinela Miladinova","Comparative Studies of 10 Programming Languages within 10 Diverse
  Criteria - a Team 10 COMP6411-S10 Term Report",126 pages,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This is a survey on the programming languages: C++, JavaScript, AspectJ, C#,
Haskell, Java, PHP, Scala, Scheme, and BPEL. Our survey work involves a
comparative study of these ten programming languages with respect to the
following criteria: secure programming practices, web application development,
web service composition, OOP-based abstractions, reflection, aspect
orientation, functional programming, declarative programming, batch scripting,
and UI prototyping. We study these languages in the context of the above
mentioned criteria and the level of support they provide for each one of them.
","[{'version': 'v1', 'created': 'Fri, 20 Aug 2010 19:50:52 GMT'}]",2010-08-23,"[['Naim', 'Rana', ''], ['Nizam', 'Mohammad Fahim', ''], ['Hanamasagar', 'Sheetal', ''], ['Noureddine', 'Jalal', ''], ['Miladinova', 'Marinela', '']]","['programming languages', 'programming paradigms', 'language features', 'language design', 'implementation']"
20044,1004.1086,Emily King,Emily J. King,Grassmannian Fusion Frames,13 pages,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Transmitted data may be corrupted by both noise and data loss. Grassmannian
frames are in some sense optimal representations of data transmitted over a
noisy channel that may lose some of the transmitted coefficients. Fusion frame
(or frame of subspaces) theory is a new area that has potential to be applied
to problems in such fields as distributed sensing and parallel processing.
Grassmannian fusion frames combine elements from both theories. A simple, novel
construction of Grassmannian fusion frames with an extension to Grassmannian
fusion frames with local frames shall be presented. Some connections to sparse
representations shall also be discussed.
","[{'version': 'v1', 'created': 'Mon, 5 Apr 2010 20:08:06 GMT'}, {'version': 'v2', 'created': 'Tue, 22 Jan 2013 15:43:16 GMT'}]",2013-01-23,"[['King', 'Emily J.', '']]","['fusion frame', 'Grassmannian packing', 'Walsh sequences', 'Hadamardmatrices', 'Grassmannian fusion frame', 'robustness']"
20045,1401.7594,Ching-Chi Lin,Ching-Chi Lin and Hai-Lun Tu,"Linear-Time Algorithms for the Paired-Domination Problem in Interval
  Graphs and Circular-Arc Graphs",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a graph $G$, a vertex subset $S\subseteq V(G)$ is said to be a dominating
set of $G$ if every vertex not in $S$ is adjacent to a vertex in $S$. A
dominating set $S$ of a graph $G$ is called a paired-dominating set if the
induced subgraph $G[S]$ contains a perfect matching. The paired-domination
problem involves finding a smallest paired-dominating set of $G$. Given an
intersection model of an interval graph $G$ with sorted endpoints, Cheng et al.
designed an $O(m+n)$-time algorithm for interval graphs and an $O(m(m+n))$-time
algorithm for circular-arc graphs. In this paper, to solve the
paired-domination problem in interval graphs, we propose an $O(n)$-time
algorithm that searches for a minimum paired-dominating set of $G$
incrementally in a greedy manner. Then, we extend the results to design an
algorithm for circular-arc graphs that also runs in $O(n)$ time.
","[{'version': 'v1', 'created': 'Wed, 29 Jan 2014 17:23:13 GMT'}]",2014-01-30,"[['Lin', 'Ching-Chi', ''], ['Tu', 'Hai-Lun', '']]","['paired-domination problem', 'perfect matching', 'interval graph', 'circular-arcgraph']"
20046,1506.02796,Alain-J\'er\^ome Foug\`eres,"Beno\^it Beroule, Alain-J\'er\^ome Foug\`eres, Egon Ostrosi",Agent-Based Product Configuration: towards Generalized Consensus Seeking,"8 pages, 8 figures, 5 tables","IJCSI Volume 11, Issue 6, November 2014",,,cs.MA cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper will present an evolution of a fuzzy agent based platform which
performed products configuration. As a first step, we used the notion of
consensus to establish robust results at the end of the configuration process.
We implemented the concept of generalized consensus which implied the
consideration of consensuses from the beginning, in this way robust data are
treated during the entire process and the final result enables the designer to
distinguish the robust components and flexible ones in a set of configurations.
","[{'version': 'v1', 'created': 'Tue, 9 Jun 2015 06:42:06 GMT'}]",2015-06-10,"[['Beroule', 'Benoît', ''], ['Fougères', 'Alain-Jérôme', ''], ['Ostrosi', 'Egon', '']]","['Fuzzy Agents', 'Consensus', 'Consensus Seeking', 'AgentBased Design', 'Collaborative', 'Distributive Design']"
20047,1605.00690,David Ward,David Ward and Nuno C. Martins,"Optimal Remote Estimation Over Use-Dependent Packet-Drop Channels -
  Extended Version",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consider a discrete-time remote estimation system formed by an encoder, a
transmission policy, a channel, and a remote estimator. The encoder assesses a
random process that the remote estimator seeks to estimate based on information
sent to it by the encoder via the channel. The channel is affected by Bernoulli
drops. The instantaneous probability of a drop is governed by a finite state
machine (FSM). The state of the FSM is denoted as the channel state. At each
time step, the encoder decides whether to attempt a transmission through the
packet-drop link. The sequence of encoder decisions is the input to the FSM.
This paper seeks to design an encoder, transmission policy and remote estimator
that minimize a finite-horizon mean squared error cost. We present two
structural results. The first result in which we assume that the process to be
estimated is white and Gaussian, we show that there is an optimal transmission
policy governed by a threshold on the estimation error. The second result
characterizes optimal symmetric transmission policies for the case when the
measured process is the state of a scalar linear time-invariant plant driven by
white Gaussian noise. Use-dependent packet-drop channels can be used to
quantify the effect of transmission on channel quality when the encoder is
powered by energy harvesting. An application to a mixed initiative system in
which a human operator performs visual search tasks is also presented.
","[{'version': 'v1', 'created': 'Mon, 2 May 2016 21:08:49 GMT'}]",2016-05-04,"[['Ward', 'David', ''], ['Martins', 'Nuno C.', '']]","['State Estimation', 'Optimal Estimation', 'Dynamic Channel Assignment', 'Communication Channel', 'Energy Management Systems', 'Channels with Memory']"
20048,1303.6682,Gosta Grahne,"Gosta Grahne, Adrian Onet",Anatomy of the chase,"18 pages, 2 figures",,,,cs.DB,http://creativecommons.org/licenses/by/3.0/,"  A lot of research activity has recently taken place around the chase
procedure, due to its usefulness in data integration, data exchange, query
optimization, peer data exchange and data correspondence, to mention a few. As
the chase has been investigated and further developed by a number of research
groups and authors, many variants of the chase have emerged and associated
results obtained. Due to the heterogeneous nature of the area it is frequently
difficult to verify the scope of each result. In this paper we take closer look
at recent developments, and provide additional results. Our analysis allows us
create a taxonomy of the chase variations and the properties they satisfy.
  Two of the most central problems regarding the chase is termination, and
discovery of restricted classes of sets of dependencies that guarantee
termination of the chase. The search for the restricted classes has been
motivated by a fairly recent result that shows that it is undecidable to
determine whether the chase with a given dependency set will terminate on a
given instance. There is a small dissonance here, since the quest has been for
classes of sets of dependencies guaranteeing termination of the chase on all
instances, even though the latter problem was not known to be undecidable. We
resolve the dissonance in this paper by showing that determining whether the
chase with a given set of dependencies terminates on all instances is
coRE-complete. Our reduction also gives us the aforementioned
instance-dependent RE-completeness result as a byproduct. For one of the
restricted classes, the stratified sets dependencies, we provide new complexity
results for the problem of testing whether a given set of dependencies belongs
to it. These results rectify some previous claims that have occurred in the
literature.
","[{'version': 'v1', 'created': 'Tue, 26 Mar 2013 22:10:15 GMT'}]",2013-03-28,"[['Grahne', 'Gosta', ''], ['Onet', 'Adrian', '']]","['Chase', 'Date Exchange', 'Data Repair', 'Incomplete databases', 'Undecidability Complexity']"
20049,1410.2988,Jayakrushna Sahoo,"Jayakrushna Sahoo, Ashok Kumar Das, A. Goswami",An Algorithm for Mining High Utility Closed Itemsets and Generators,,,,,cs.DB,http://creativecommons.org/licenses/by/3.0/,"  Traditional association rule mining based on the support-confidence framework
provides the objective measure of the rules that are of interest to users.
However, it does not reflect the utility of the rules. To extract non-redundant
association rules in support-confidence framework frequent closed itemsets and
their generators play an important role. To extract non-redundant association
rules among high utility itemsets, high utility closed itemsets (HUCI) and
their generators should be extracted in order to apply traditional
support-confidence framework. However, no efficient method exists at present
for mining HUCIs with their generators. This paper addresses this issue. A
post-processing algorithm, called the HUCI-Miner, is proposed to mine HUCIs
with their generators. The proposed algorithm is implemented using both
synthetic and real datasets.
","[{'version': 'v1', 'created': 'Sat, 11 Oct 2014 11:30:14 GMT'}]",2014-10-14,"[['Sahoo', 'Jayakrushna', ''], ['Das', 'Ashok Kumar', ''], ['Goswami', 'A.', '']]","['Data mining', 'High utility itemset mining', 'Association rule mining', 'Condensed representations', 'non-redundant association rule']"
20050,1206.1567,Rourab Paul,"Rourab Paul, Suman Sau, Amlan Chakrabarti","Architecture for real time continuous sorting on large width data volume
  for fpga based applications","5 pages,RASTM,2011 INDORE",,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In engineering applications sorting is an important and widely studied
problem where execution speed and resources used for computation are of extreme
importance, especially if we think about real time data processing. Most of the
traditional sorting techniques compute the process after receiving all of the
data and hence the process needs large amount of resources for data storage.
So, suitable design strategy needs to be adopted if we wish to sort a large
amount of data in real time, which essential means higher speed of process
execution and utilization of fewer resources in most of the cases. This paper
proposes a single chip scalable architecture based on Field Programmable Gate
Array(FPGA), for a modified counting sort algorithm where data acquisition and
sorting is being done in real time scenario. Our design promises to work
efficiently, where data can be accepted in the run time scenario without any
need of prior storage of data and also the execution speed of our algorithm is
invariant to the length of the data stream. The proposed design is implemented
and verified on Spartan 3E(XC3S500E-FG320) FPGA system. The results prove that
our design is better in terms of some of the design parameters compared to the
existing research works.
","[{'version': 'v1', 'created': 'Thu, 7 Jun 2012 18:17:32 GMT'}]",2012-06-08,"[['Paul', 'Rourab', ''], ['Sau', 'Suman', ''], ['Chakrabarti', 'Amlan', '']]","['Reconfigurable architecture', 'Continuous data sorting', 'FPGA', 'Real Time', 'Xilinx Spartan 3E']"
20051,1206.2322,Yipeng Liu Dr.,"Rong Fan, Qun Wan, Xiao Zhang, Hui Chen, Yipeng Liu",A Fast HRRP Synthesis Algorithm with Sensing Dictionary in GTD Model,"16 pages, 8 figures, 2 tables",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To achieve high range resolution profile (HRRP), the geometric theory of
diffraction (GTD) parametric model is widely used in stepped-frequency radar
system. In the paper, a fast synthetic range profile algorithm, called
orthogonal matching pursuit with sensing dictionary (OMP-SD), is proposed. It
formulates the traditional HRRP synthetic to be a sparse approximation problem
over redundant dictionary. As it employs a priori information that targets are
sparsely distributed in the range space, the synthetic range profile (SRP) can
be accomplished even in presence of data lost. Besides, the computational
complexity is reduced by introducing sensing dictionary (SD) and it mitigates
the model mismatch at the same time. The computation complexity decreases from
O(MNDK) flops for OMP to O(M(N +D)K) flops for OMP-SD. Simulation experiments
illustrate its advantages both in additive white Gaussian noise (AWGN) and
noiseless situation, respectively.
","[{'version': 'v1', 'created': 'Mon, 11 Jun 2012 19:11:32 GMT'}]",2012-06-12,"[['Fan', 'Rong', ''], ['Wan', 'Qun', ''], ['Zhang', 'Xiao', ''], ['Chen', 'Hui', ''], ['Liu', 'Yipeng', '']]","['HRRP', 'GTD-based model', 'Sensing Dictionary', 'Orthogonal Matching Pursuit']"
20052,1410.3385,Henning Kerstan,"Paolo Baldan, Filippo Bonchi, Henning Kerstan and Barbara K\""onig",Behavioral Metrics via Functor Lifting,to be published in: Proceedings of FSTTCS 2014,,,,cs.LO,http://creativecommons.org/licenses/by/3.0/,"  We study behavioral metrics in an abstract coalgebraic setting. Given a
coalgebra alpha: X -> FX in Set, where the functor F specifies the branching
type, we define a framework for deriving pseudometrics on X which measure the
behavioral distance of states.
  A first crucial step is the lifting of the functor F on Set to a functor in
the category PMet of pseudometric spaces. We present two different approaches
which can be viewed as generalizations of the Kantorovich and Wasserstein
pseudometrics for probability measures. We show that the pseudometrics provided
by the two approaches coincide on several natural examples, but in general they
differ.
  Then a final coalgebra for F in Set can be endowed with a behavioral distance
resulting as the smallest solution of a fixed-point equation, yielding the
final coalgebra in PMet. The same technique, applied to an arbitrary coalgebra
alpha: X -> FX in Set, provides the behavioral distance on X. Under some
constraints we can prove that two states are at distance 0 if and only if they
are behaviorally equivalent.
","[{'version': 'v1', 'created': 'Mon, 13 Oct 2014 16:36:01 GMT'}]",2014-10-14,"[['Baldan', 'Paolo', ''], ['Bonchi', 'Filippo', ''], ['Kerstan', 'Henning', ''], ['König', 'Barbara', '']]","['behavioral metric', 'functor lifting', 'pseudometric', 'coalgebra']"
20053,1111.2651,Gerard Briscoe Dr,Irene Ng and Gerard Briscoe,"Value, Variety and Viability: Designing For Co-creation in a Complex
  System of Direct and Indirect (goods) Service Value Proposition","26 pages, 3 figures, 1 table, conference",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While service-dominant logic proposes that all ""Goods are a distribution
mechanism for service provision"" (FP3), there is a need to understand when and
why a firm would utilise direct or indirect (goods) service provision, and the
interactions between them, to co-create value with the customer. Three
longitudinal case studies in B2B equipment-based 'complex service' systems were
analysed to gain an understanding of customers' co-creation activities to
achieve outcomes. We found the nature of value, degree of contextual variety
and the firm's legacy viability to be viability threats. To counter this, the
firm uses (a) Direct Service Provision for Scalability and Replicability, (b)
Indirect Service Provision for variety absorption and co-creating emotional
value and customer experience and (c) designing direct and indirect provision
for Scalability and Absorptive Resources of the customer. The co-creation of
complex multidimensional value could be delivered through different value
propositions of the firm. The research proposes a value-centric way of
understanding the interactions between direct and indirect service provision in
the design of the firm's value proposition and proposes a viable systems
approach towards reorganising the firm. The study provides a way for managers
to understand the effectiveness (rather than efficiency) of the firm in
co-creating value as a major issue in the design of complex socio-technical
systems. Goods are often designed within the domain of engineering and product
design, often placing human activity as a supporting role to the equipment.
Through an SDLogic lens, this study considers the design of both equipment and
human activity on an equal footing for value co-creation with the customer, and
it yielded interesting results on when direct provisioning (goods) should be
redesigned, considering all activities equally.
","[{'version': 'v1', 'created': 'Fri, 11 Nov 2011 02:56:16 GMT'}]",2011-11-14,"[['Ng', 'Irene', ''], ['Briscoe', 'Gerard', '']]","['Complex\t c \xa0Service\t c \xa0Systems', 'Service\t c \xa0Dominant\t c \xa0Logic', 'Customer\t c \xa0Experience', 'Design', 'Value\t c \xa0Co-\xad‐creation']"
20054,1301.5585,Janusz Brzozowski,"Janusz Brzozowski, Hellis Tamm",Minimal Nondeterministic Finite Automata and Atoms of Regular Languages,"15 pages, 29 tables",,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We examine the NFA minimization problem in terms of atomic NFA's, that is,
NFA's in which the right language of every state is a union of atoms, where the
atoms of a regular language are non-empty intersections of complemented and
uncomplemented left quotients of the language. We characterize all reduced
atomic NFA's of a given language, that is, those NFA's that have no equivalent
states. Using atomic NFA's, we formalize Sengoku's approach to NFA minimization
and prove that his method fails to find all minimal NFA's. We also formulate
the Kameda-Weiner NFA minimization in terms of quotients and atoms.
","[{'version': 'v1', 'created': 'Wed, 23 Jan 2013 17:51:05 GMT'}]",2013-01-24,"[['Brzozowski', 'Janusz', ''], ['Tamm', 'Hellis', '']]","['regular language', 'quotient', 'atom', 'atomic NFA', 'minimalNFA']"
20055,1204.6250,Abdul Ghani Abro,"Abdul Ghani Abro, Junita Mohamad Saleh","Feature Selection for Generator Excitation Neurocontroller Development
  Using Filter Technique","10-Pages, 10-Figures, 8-Tables, International Journal of Computer
  Science Issues, Vol. 8, Issue 5, No 3, September 2011","International Journal of Computer Science Issues,PP. 108-117, Vol.
  8, Issue 5, No 3, September 2011",,,cs.SY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Essentially, motive behind using control system is to generate suitable
control signal for yielding desired response of a physical process. Control of
synchronous generator has always remained very critical in power system
operation and control. For certain well known reasons power generators are
normally operated well below their steady state stability limit. This raises
demand for efficient and fast controllers. Artificial intelligence has been
reported to give revolutionary outcomes in the field of control engineering.
Artificial Neural Network (ANN), a branch of artificial intelligence has been
used for nonlinear and adaptive control, utilizing its inherent observability.
The overall performance of neurocontroller is dependent upon input features
too. Selecting optimum features to train a neurocontroller optimally is very
critical. Both quality and size of data are of equal importance for better
performance. In this work filter technique is employed to select independent
factors for ANN training.
","[{'version': 'v1', 'created': 'Tue, 29 Nov 2011 04:52:31 GMT'}]",2012-04-30,"[['Abro', 'Abdul Ghani', ''], ['Saleh', 'Junita Mohamad', '']]","['neural network', 'mlp', 'feature selection', 'regression analysis', 'generator excitation']"
20056,1506.01071,Aleksey Buzmakov,Aleksey Buzmakov and Sergei O. Kuznetsov and Amedeo Napoli,Fast Generation of Best Interval Patterns for Nonmonotonic Constraints,"18 pages; 2 figures; 2 tables; 1 algorithm; PKDD 2015 Conference
  Scientific Track",,,,cs.AI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In pattern mining, the main challenge is the exponential explosion of the set
of patterns. Typically, to solve this problem, a constraint for pattern
selection is introduced. One of the first constraints proposed in pattern
mining is support (frequency) of a pattern in a dataset. Frequency is an
anti-monotonic function, i.e., given an infrequent pattern, all its
superpatterns are not frequent. However, many other constraints for pattern
selection are not (anti-)monotonic, which makes it difficult to generate
patterns satisfying these constraints. In this paper we introduce the notion of
projection-antimonotonicity and $\theta$-$\Sigma\o\phi\iota\alpha$ algorithm
that allows efficient generation of the best patterns for some nonmonotonic
constraints. In this paper we consider stability and $\Delta$-measure, which
are nonmonotonic constraints, and apply them to interval tuple datasets. In the
experiments, we compute best interval tuple patterns w.r.t. these measures and
show the advantage of our approach over postfiltering approaches.
  KEYWORDS: Pattern mining, nonmonotonic constraints, interval tuple data
","[{'version': 'v1', 'created': 'Tue, 2 Jun 2015 21:32:14 GMT'}, {'version': 'v2', 'created': 'Tue, 16 Jun 2015 15:31:19 GMT'}]",2015-06-17,"[['Buzmakov', 'Aleksey', ''], ['Kuznetsov', 'Sergei O.', ''], ['Napoli', 'Amedeo', '']]","['Pattern mining', 'nonmonotonic constraints', 'interval tuple data']"
20057,1407.0637,Stefano Leucci,"Davide Bil\`o and Luciano Gual\`a and Stefano Leucci and Guido
  Proietti",Fault-Tolerant Approximate Shortest-Path Trees,"20 pages, 4 figures",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The resiliency of a network is its ability to remain \emph{effectively}
functioning also when any of its nodes or links fails. However, to reduce
operational and set-up costs, a network should be small in size, and this
conflicts with the requirement of being resilient. In this paper we address
this trade-off for the prominent case of the {\em broadcasting} routing scheme,
and we build efficient (i.e., sparse and fast) \emph{fault-tolerant approximate
shortest-path trees}, for both the edge and vertex \emph{single-failure} case.
In particular, for an $n$-vertex non-negatively weighted graph, and for any
constant $\varepsilon >0$, we design two structures of size $O(\frac{n \log
n}{\varepsilon^2})$ which guarantee $(1+\varepsilon)$-stretched paths from the
selected source also in the presence of an edge/vertex failure. This favorably
compares with the currently best known solutions, which are for the
edge-failure case of size $O(n)$ and stretch factor 3, and for the
vertex-failure case of size $O(n \log n)$ and stretch factor 3. Moreover, we
also focus on the unweighted case, and we prove that an ordinary
$(\alpha,\beta)$-spanner can be slightly augmented in order to build efficient
fault-tolerant approximate \emph{breadth-first-search trees}.
","[{'version': 'v1', 'created': 'Wed, 2 Jul 2014 16:30:58 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Nov 2016 10:53:20 GMT'}]",2016-11-07,"[['Bilò', 'Davide', ''], ['Gualà', 'Luciano', ''], ['Leucci', 'Stefano', ''], ['Proietti', 'Guido', '']]","['Shortest-path Trees', 'Fault-tolerant Structures', 'Approximate Distances']"
20058,1402.6942,Jakub Nalepa,Jakub Nalepa and Zbigniew J. Czech,"A Parallel Memetic Algorithm to Solve the Vehicle Routing Problem with
  Time Windows",15 pages,"Studia Informatica 33 (1), pp 91-106 (2012)",,,cs.DC cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a parallel memetic algorithm for solving the vehicle
routing problem with time windows (VRPTW). The VRPTW is a well-known NP-hard
discrete optimization problem with two objectives. The main objective is to
minimize the number of vehicles serving customers scattered on the map, and the
second one is to minimize the total distance traveled by the vehicles. Here,
the fleet size is minimized in the first phase of the proposed method using the
parallel heuristic algorithm (PHA), and the traveled distance is minimized in
the second phase by the parallel memetic algorithm (PMA). In both parallel
algorithms, the parallel components co-operate periodically in order to
exchange the best solutions found so far. An extensive experimental study
performed on the Gehring and Homberger's benchmark proves the high convergence
capabilities and robustness of both PHA and PMA. Also, we present the speedup
analysis of the PMA.
","[{'version': 'v1', 'created': 'Thu, 27 Feb 2014 15:41:05 GMT'}]",2014-02-28,"[['Nalepa', 'Jakub', ''], ['Czech', 'Zbigniew J.', '']]","['parallel memetic algorithm', 'hybrid genetic algorithm', 'local search', 'vehicle routing problem with time windows']"
20059,1208.1956,Kai Yang Kai Yang,Kai Yang and Xi Zhou,"MIDI-LAB, a Powerful Visual Basic Program for Creating MIDI Music","12 pages, 10 figures, 2 tables,
  http://www.airccse.org/journal/ijsea/ijsea.html; International Journal of
  Software Engineering & Applications (IJSEA), Vol.3, No.4, July 2012",,,,cs.SE cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Creating MIDI music can be a practical challenge. In the past, working with
it was difficult and frustrating to all but the most accomplished and
determined. Now, however, we are offering a powerful Visual Basic program
called MIDI-LAB, that is easy to learn, and instantly rewarding to even the
newest users. MIDI-LAB has been developed to give users the ability to quickly
create music with a limitless variety of tunes, tempos, speeds, volumes,
instruments, rhythms and major scales. This program has a simple, intuitive,
and user-friendly interface, which provides a straightforward way to enter
musical data with Numbered Musical Notation (NMN) and immediately create MIDI
music. The key feature of this program is the digitalization of music input. It
vastly simplifies creating, editing, and saving MIDI music. MIDI-LAB can be
used virtually anywhere to write music for entertainment, teaching, computer
games, and mobile phone ringtones.
","[{'version': 'v1', 'created': 'Thu, 9 Aug 2012 15:43:58 GMT'}]",2015-03-13,"[['Yang', 'Kai', ''], ['Zhou', 'Xi', '']]","['Visual Basic', 'program', 'MIDI', 'music', 'MIDI-LAB', 'NMN']"
20060,0804.3650,Sossio Vergara,Sossio Vergara,On generic frequency decomposition. Part 1: vectorial decomposition,"15 pages, no figures","Digital Signal Processing Journal, Vol. 17 March 2007",,,cs.NA math.FA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The famous Fourier theorem states that, under some restrictions, any periodic
function (or real world signal) can be obtained as a sum of sinusoids, and
hence, a technique exists for decomposing a signal into its sinusoidal
components. From this theory an entire branch of research has flourished: from
the Short-Time or Windowed Fourier Transform to the Wavelets, the Frames, and
lately the Generic Frequency Analysis. The aim of this paper is to take the
Frequency Analysis a step further. It will be shown that keeping the same
reconstruction algorithm as the Fourier Theorem but changing to a new computing
method for the analysis phase allows the generalization of the Fourier Theorem
to a large class of nonorthogonal bases. New methods and algorithms can be
employed in function decomposition on such generic bases. It will be shown that
these algorithms are a generalization of the Fourier analysis, i.e. they are
reduced to the familiar Fourier tools when using orthogonal bases. The
differences between this tool and the wavelets and frames theories will be
discussed. Examples of analysis and reconstruction of functions using the given
algorithms and nonorthogonal bases will be given. In this first part the focus
will be on vectorial decomposition, while the second part will be on phased
decomposition. The phased decomposition thanks to a single function basis has
many interesting consequences and applications.
","[{'version': 'v1', 'created': 'Wed, 23 Apr 2008 07:30:38 GMT'}]",2008-04-24,"[['Vergara', 'Sossio', '']]","['Fourier theorem', 'functional analysis', 'wavelets', 'frames', 'nonorthogonal basis']"
20061,1212.0750,Michael  Gr. Voskoglou Prof. Dr.,"Michael Gr. Voskoglou, Sheryl Buckley",Problem Solving and Computational Thinking in a Learning Environment,"19 pages, 2 figures","Egyptian Computer Science Journal, Vol. 36 (4), 28-46, 2012",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computational thinking is a new problem soling method named for its extensive
use of computer science techniques. It synthesizes critical thinking and
existing knowledge and applies them in solving complex technological problems.
The term was coined by J. Wing, but the relationship between computational and
critical thinking, the two modes of thiking in solving problems, has not been
yet learly established. This paper aims at shedding some light into this
relationship. We also present two classroom experiments performed recently at
the Graduate Technological Educational Institute of Patras in Greece. The
results of these experiments give a strong indication that the use of computers
as a tool for problem solving enchances the students' abilities in solving real
world problems involving mathematical modelling. This is also crossed by
earlier findings of other researchers for the problem solving process in
general (not only for mathematical problems).
","[{'version': 'v1', 'created': 'Sun, 2 Dec 2012 17:34:36 GMT'}]",2012-12-05,"[['Voskoglou', 'Michael Gr.', ''], ['Buckley', 'Sheryl', '']]","['Computational thinking', 'critical thinking', 'problem solving', 'learning', 'knowledge creation']"
20062,1707.09400,Fr\'ed\'eric Havet,"J{\o}rgen Bang-Jensen and St\'ephane Bessy and Fr\'ed\'eric Havet and
  Anders Yeo",Bipartite spanning sub(di)graphs induced by 2-partitions,"17 pages, 4 figures",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For a given $2$-partition $(V_1,V_2)$ of the vertices of a (di)graph $G$, we
study properties of the spanning bipartite subdigraph $B_G(V_1,V_2)$ of $G$
induced by those arcs/edges that have one end in each $V_i$. We determine, for
all pairs of non-negative integers $k_1,k_2$, the complexity of deciding
whether $G$ has a 2-partition $(V_1,V_2)$ such that each vertex in $V_i$ has at
least $k_i$ (out-)neighbours in $V_{3-i}$. We prove that it is ${\cal
NP}$-complete to decide whether a digraph $D$ has a 2-partition $(V_1,V_2)$
such that each vertex in $V_1$ has an out-neighbour in $V_2$ and each vertex in
$V_2$ has an in-neighbour in $V_1$. The problem becomes polynomially solvable
if we require $D$ to be strongly connected. We give a characterisation, based
on the so-called strong component digraph of a non-strong digraph of the
structure of ${\cal NP}$-complete instances in terms of their strong component
digraph. When we want higher in-degree or out-degree to/from the other set the
problem becomes ${\cal NP}$-complete even for strong digraphs. A further result
is that it is ${\cal NP}$-complete to decide whether a given digraph $D$ has a
$2$-partition $(V_1,V_2)$ such that $B_D(V_1,V_2)$ is strongly connected. This
holds even if we require the input to be a highly connected eulerian digraph.
","[{'version': 'v1', 'created': 'Fri, 28 Jul 2017 20:12:02 GMT'}]",2017-08-01,"[['Bang-Jensen', 'Jørgen', ''], ['Bessy', 'Stéphane', ''], ['Havet', 'Frédéric', ''], ['Yeo', 'Anders', '']]","['2-partition', 'minimum out-degree', 'spanning bipartite subdigraph', 'eulerian', 'strongspanning subdigraph']"
20063,1610.06089,Othman Esoul,Othman Esoul and Neil Walkinshaw,"Finding Clustering Configurations to Accurately Infer Packet Structures
  from Network Data","14 pages, 3 figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering is often used for reverse engineering network protocols from
captured network traces. The performance of clustering techniques is often
contingent upon the selection of various parameters, which can have a severe
impact on clustering quality. In this paper we experimentally investigate the
effect of four different parameters with respect to network traces. We also
determining the optimal parameter configuration with respect to traces from
four different network protocols. Our results indicate that the choice of
distance measure and the length of the message has the most substantial impact
on cluster accuracy. Depending on the type of protocol, the $n$-gram length can
also have a substantial impact.
","[{'version': 'v1', 'created': 'Wed, 19 Oct 2016 16:14:39 GMT'}]",2016-10-20,"[['Esoul', 'Othman', ''], ['Walkinshaw', 'Neil', '']]","['Network Security', 'Protocol Inference', 'Clustering', 'Effect Size']"
20064,1504.06864,Rafal Scherer,"Patryk Najgebauer, Janusz Rygal, Tomasz Nowak, Jakub Romanowski,
  Leszek Rutkowski, Sviatoslav Voloshynovskiy, Rafal Scherer",Fast Dictionary Matching for Content-based Image Retrieval,"Accepted for the 14th International Conference on Artificial
  Intelligence and Soft Computing, ICAISC, June 14-18, 2015, Zakopane, Poland,
  http://www.icaisc.eu/",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a method for searching for common sets of descriptors
between collections of images. The presented method operates on local interest
keypoints, which are generated using the SURF algorithm. The use of a
dictionary of descriptors allowed achieving good performance of the
content-based image retrieval. The method can be used to initially determine a
set of similar pairs of keypoints between images. For this purpose, we use a
certain level of tolerance between values of descriptors, as values of feature
descriptors are almost never equal but similar between different images. After
that, the method compares the structure of rotation and location of interest
points in one image with the point structure in other images. Thus, we were
able to find similar areas in images and determine the level of similarity
between them, even when images contain different scenes.
","[{'version': 'v1', 'created': 'Sun, 26 Apr 2015 18:41:51 GMT'}]",2015-04-28,"[['Najgebauer', 'Patryk', ''], ['Rygal', 'Janusz', ''], ['Nowak', 'Tomasz', ''], ['Romanowski', 'Jakub', ''], ['Rutkowski', 'Leszek', ''], ['Voloshynovskiy', 'Sviatoslav', ''], ['Scherer', 'Rafal', '']]","['content-based image retrieval', 'local interest points', 'imagematching']"
20065,1610.00279,Andrey Makarenko,A.V. Makarenko,"Deep Learning Algorithms for Signal Recognition in Long Perimeter
  Monitoring Distributed Fiber Optic Sensors","11 pages, 7 figures, 2 tables. Slightly extended preprint of paper
  accepted for IEEE MLSP 2016",,,,cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we show an approach to build deep learning algorithms for
recognizing signals in distributed fiber optic monitoring and security systems
for long perimeters. Synthesizing such detection algorithms poses a non-trivial
research and development challenge, because these systems face stringent error
(type I and II) requirements and operate in difficult signal-jamming
environments, with intensive signal-like jamming and a variety of changing
possible signal portraits of possible recognized events. To address these
issues, we have developed a twolevel event detection architecture, where the
primary classifier is based on an ensemble of deep convolutional networks, can
recognize 7 classes of signals and receives time-space data frames as input.
Using real-life data, we have shown that the applied methods result in
efficient and robust multiclass detection algorithms that have a high degree of
adaptability.
","[{'version': 'v1', 'created': 'Sun, 2 Oct 2016 13:46:47 GMT'}]",2016-10-04,"[['Makarenko', 'A. V.', '']]","['deep learning', 'fiber optic vibration sensors', 'signal recognition', 'events classification', 't-SNE visualization']"
20066,1402.1881,Bo Chen,"Shuyu Zhou, Xiandong Zhang, Bo Chen, Steef van de Velde",Tactical Fixed Job Scheduling with Spread-Time Constraints,,,,,cs.DS cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the tactical fixed job scheduling problem with spread-time
constraints. In such a problem, there are a fixed number of classes of machines
and a fixed number of groups of jobs. Jobs of the same group can only be
processed by machines of a given set of classes. All jobs have their fixed
start and end times. Each machine is associated with a cost according to its
machine class. Machines have spread-time constraints, with which each machine
is only available for $L$ consecutive time units from the start time of the
earliest job assigned to it. The objective is to minimize the total cost of the
machines used to process all the jobs. For this strongly NP-hard problem, we
develop a branch-and-price algorithm, which solves instances with up to $300$
jobs, as compared with CPLEX, which cannot solve instances of $100$ jobs. We
further investigate the influence of machine flexibility by computational
experiments. Our results show that limited machine flexibility is sufficient in
most situations.
","[{'version': 'v1', 'created': 'Sat, 8 Feb 2014 19:30:16 GMT'}]",2014-02-12,"[['Zhou', 'Shuyu', ''], ['Zhang', 'Xiandong', ''], ['Chen', 'Bo', ''], ['van de Velde', 'Steef', '']]","['machine scheduling', 'spread-time constraint', 'flexiblemanufacturing', 'branch and price', 'neighborhood search']"
20067,1402.7143,Ashwin Rajadesingan,Ashwin Rajadesingan and Huan Liu,Identifying Users with Opposing Opinions in Twitter Debates,"Corrected typos in Section 4, under ""Visibly Opinionated Users"". The
  numbers did not add up. Results remain unchanged","Lecture Notes in Computer Science, Vol. 8393, 2014",,,cs.SI cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent times, social media sites such as Twitter have been extensively
used for debating politics and public policies. These debates span millions of
tweets and numerous topics of public importance. Thus, it is imperative that
this vast trove of data is tapped in order to gain insights into public opinion
especially on hotly contested issues such as abortion, gun reforms etc. Thus,
in our work, we aim to gauge users' stance on such topics in Twitter. We
propose ReLP, a semi-supervised framework using a retweet-based label
propagation algorithm coupled with a supervised classifier to identify users
with differing opinions. In particular, our framework is designed such that it
can be easily adopted to different domains with little human supervision while
still producing excellent accuracy
","[{'version': 'v1', 'created': 'Fri, 28 Feb 2014 06:12:27 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Apr 2014 16:12:35 GMT'}]",2014-04-11,"[['Rajadesingan', 'Ashwin', ''], ['Liu', 'Huan', '']]","['label propagation', 'semi-supervised', 'opinion mining', 'polarity detection']"
20068,1109.3700,Arnaud Martin,"Florentin Smarandache (UNM), Arnaud Martin (IRISA), Christophe Osswald
  (E3I2)","Contradiction measures and specificity degrees of basic belief
  assignments",,"International Conference on Information Fusion, Chicago : United
  States (2011)",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the theory of belief functions, many measures of uncertainty have been
introduced. However, it is not always easy to understand what these measures
really try to represent. In this paper, we re-interpret some measures of
uncertainty in the theory of belief functions. We present some interests and
drawbacks of the existing measures. On these observations, we introduce a
measure of contradiction. Therefore, we present some degrees of non-specificity
and Bayesianity of a mass. We propose a degree of specificity based on the
distance between a mass and its most specific associated mass. We also show how
to use the degree of specificity to measure the specificity of a fusion rule.
Illustrations on simple examples are given.
","[{'version': 'v1', 'created': 'Fri, 16 Sep 2011 19:34:47 GMT'}]",2011-09-19,"[['Smarandache', 'Florentin', '', 'UNM'], ['Martin', 'Arnaud', '', 'IRISA'], ['Osswald', 'Christophe', '', 'E3I2']]","['Belief function', 'uncertainty measures', 'specificity', 'conflict']"
20069,1212.6056,Seifedine Kadry Seifedine Kadry,"Ayman Abdallah, Seifedine Kadry, and Chibli Joumaa","Design and Performance Study of Smart Antenna Systems for WIMAX
  Applications","Informatics in Control, Automation and Robotics, Volume 2, LNEE 133,
  Springer-Verlag Berlin Heidelberg 2011",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we propose an approach that uses homodyne receivers to design
smart antenna systems. The receivers functions are to detect angles of arrivals
of seven incoming RF signals using MUSIC or ESPRIT algorithms. The
characteristics of each algorithm are critical for the systems precision as
well as receivers types. Results are deduced from the simulation of each
system, using the Advanced Design System (ADS) and MATLAB. These are compared
to results deduced from real systems in the WIMAX (3.5GHz) domains.
","[{'version': 'v1', 'created': 'Tue, 25 Dec 2012 14:21:01 GMT'}]",2012-12-27,"[['Abdallah', 'Ayman', ''], ['Kadry', 'Seifedine', ''], ['Joumaa', 'Chibli', '']]","['Smart Antennas', 'DOA', 'Spatial Smoothing', 'ESPRIT', 'MUSIC', 'Adaptive Antennas']"
20070,1210.0203,Jinshan Zhang,"Ning Chen, Xiaotie Deng, Paul.W.Goldberg, Jinshan Zhang",On Revenue Maximization with Sharp Multi-Unit Demands,page23,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider markets consisting of a set of indivisible items, and buyers that
have {\em sharp} multi-unit demand. This means that each buyer $i$ wants a
specific number $d_i$ of items; a bundle of size less than $d_i$ has no value,
while a bundle of size greater than $d_i$ is worth no more than the most valued
$d_i$ items (valuations being additive). We consider the objective of setting
prices and allocations in order to maximize the total revenue of the market
maker. The pricing problem with sharp multi-unit demand buyers has a number of
properties that the unit-demand model does not possess, and is an important
question in algorithmic pricing. We consider the problem of computing a revenue
maximizing solution for two solution concepts: competitive equilibrium and
envy-free pricing.
  For unrestricted valuations, these problems are NP-complete; we focus on a
realistic special case of ""correlated values"" where each buyer $i$ has a
valuation $v_i\qual_j$ for item $j$, where $v_i$ and $\qual_j$ are positive
quantities associated with buyer $i$ and item $j$ respectively. We present a
polynomial time algorithm to solve the revenue-maximizing competitive
equilibrium problem. For envy-free pricing, if the demand of each buyer is
bounded by a constant, a revenue maximizing solution can be found efficiently;
the general demand case is shown to be NP-hard.
","[{'version': 'v1', 'created': 'Sun, 30 Sep 2012 14:02:31 GMT'}, {'version': 'v2', 'created': 'Thu, 25 Oct 2012 13:36:44 GMT'}, {'version': 'v3', 'created': 'Mon, 14 Jan 2013 18:08:04 GMT'}, {'version': 'v4', 'created': 'Sat, 19 Jan 2013 01:42:11 GMT'}, {'version': 'v5', 'created': 'Tue, 30 Dec 2014 15:19:17 GMT'}]",2015-03-13,"[['Chen', 'Ning', ''], ['Deng', 'Xiaotie', ''], ['Goldberg', 'Paul. W.', ''], ['Zhang', 'Jinshan', '']]","['Position Auction', 'Revenue Maximization', 'Envy-free', 'Competitive Equilibrium', 'SharpDemand']"
20071,1505.05788,Weinan Zhang,"Weinan Zhang, Ye Pan, Tianxiong Zhou, Jun Wang",An Empirical Study on Display Ad Impression Viewability Measurements,,,,,cs.HC cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Display advertising normally charges advertisers for every single ad
impression. Specifically, if an ad in a webpage has been loaded in the browser,
an ad impression is counted. However, due to the position and size of the ad
slot, lots of ads are actually not viewed but still measured as impressions and
charged. These fraud ad impressions indeed undermine the efficacy of display
advertising. A perfect ad impression viewability measurement should match what
the user has really viewed with a short memory. In this paper, we conduct
extensive investigations on display ad impression viewability measurements on
dimensions of ad creative displayed pixel percentage and exposure time to find
which measurement provides the most accurate ad impression counting. The
empirical results show that the most accurate measurement counts one ad
impression if more than 75% of the ad creative pixels have been exposed for at
least 2 continuous seconds.
","[{'version': 'v1', 'created': 'Thu, 21 May 2015 17:00:23 GMT'}]",2015-05-22,"[['Zhang', 'Weinan', ''], ['Pan', 'Ye', ''], ['Zhou', 'Tianxiong', ''], ['Wang', 'Jun', '']]","['Display Advertising', 'Impression Measuring', 'Ad Tracking']"
20072,1106.1583,Osama Sohaib,"Walayat Hussain, Osama Sohaib and Arif Ali",Improving Web Page Readability by Plain Language,"pages 315- 319, http://www.IJCSI.org","IJCSI International Journal of Computer Science Issues, Vol. 8,
  Issue 3, No. 1, May 2011, 315-319",,ISSN (Online): 1694-0814,cs.HC cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In today's world anybody who wants to access any information the first choice
is to use the web because it is the only source to provide easy and instant
access to information. However web readers face many hurdles from web which
includes load of web pages, text size, finding related information, spelling
and grammar etc. However understanding of web pages written in English language
creates great problems for non native readers who have basic knowledge of
English. In this paper, we propose a plain language for a local language (Urdu)
using English alphabets for web pages in Pakistan. For this purpose we
developed two websites, one with a normal English fonts and other in a local
language text scheme using English alphabets. We also conducted a questionnaire
from 40 different users with a different level of English language fluency in
Pakistan to gain the evidence of the practicality of our approach. The result
shows that the proposed plain language text scheme using English alphabets
improved the reading comprehension for non native English speakers in Pakistan.
","[{'version': 'v1', 'created': 'Wed, 8 Jun 2011 15:25:40 GMT'}]",2011-06-09,"[['Hussain', 'Walayat', ''], ['Sohaib', 'Osama', ''], ['Ali', 'Arif', '']]","['Web readability', 'readability enhancement', 'text readability', 'lower literate people', 'typography', 'content usability', 'web accessibility']"
20073,1603.04190,Wojciech Kot{\l}owski,"Wojciech Kot{\l}owski, Wouter M. Koolen, Alan Malek",Online Isotonic Regression,25 pages,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the online version of the isotonic regression problem. Given a
set of linearly ordered points (e.g., on the real line), the learner must
predict labels sequentially at adversarially chosen positions and is evaluated
by her total squared loss compared against the best isotonic (non-decreasing)
function in hindsight. We survey several standard online learning algorithms
and show that none of them achieve the optimal regret exponent; in fact, most
of them (including Online Gradient Descent, Follow the Leader and Exponential
Weights) incur linear regret. We then prove that the Exponential Weights
algorithm played over a covering net of isotonic functions has a regret bounded
by $O\big(T^{1/3} \log^{2/3}(T)\big)$ and present a matching $\Omega(T^{1/3})$
lower bound on regret. We provide a computationally efficient version of this
algorithm. We also analyze the noise-free case, in which the revealed labels
are isotonic, and show that the bound can be improved to $O(\log T)$ or even to
$O(1)$ (when the labels are revealed in isotonic order). Finally, we extend the
analysis beyond squared loss and give bounds for entropic loss and absolute
loss.
","[{'version': 'v1', 'created': 'Mon, 14 Mar 2016 10:26:23 GMT'}, {'version': 'v2', 'created': 'Fri, 7 Oct 2016 15:52:29 GMT'}]",2016-10-10,"[['Kotłowski', 'Wojciech', ''], ['Koolen', 'Wouter M.', ''], ['Malek', 'Alan', '']]","['online learning', 'isotonic regression', 'isotonic function', 'monotonic', 'nonparametric regression', 'exp-concave loss']"
20074,1410.3712,Fabrizio Montesi,Fabrizio Montesi,Process-aware web programming with Jolie,IMADA-preprint-cs,,,,cs.DC cs.NI cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We extend the Jolie programming language to capture the native modelling of
process-aware web information systems, i.e., web information systems based upon
the execution of business processes. Our main contribution is to offer a
unifying approach for the programming of distributed architectures on the web,
which can capture web servers, stateful process execution, and the composition
of services via mediation. We discuss applications of this approach through a
series of examples that cover, e.g., static content serving, multiparty
sessions, and the evolution of web systems. Finally, we present a performance
evaluation that includes a comparison of Jolie-based web systems to other
frameworks and a measurement of its scalability.
","[{'version': 'v1', 'created': 'Tue, 14 Oct 2014 14:45:52 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Oct 2014 07:32:03 GMT'}, {'version': 'v3', 'created': 'Thu, 21 Apr 2016 07:18:00 GMT'}]",2016-04-22,"[['Montesi', 'Fabrizio', '']]","['Business Processes', 'Programming Languages', 'Sessions', 'Web Services']"
20075,1004.2426,Zoltan Esik,"Zoltan Esik, Andreas Maletti",Simulation vs. Equivalence,,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For several semirings S, two weighted finite automata with multiplicities in
S are equivalent if and only if they can be connected by a chain of
simulations. Such a semiring S is called ""proper"". It is known that the Boolean
semiring, the semiring of natural numbers, the ring of integers, all finite
commutative positively ordered semirings and all fields are proper. The
semiring S is Noetherian if every subsemimodule of a finitely generated
S-semimodule is finitely generated. First, it is shown that all Noetherian
semirings and thus all commutative rings and all finite semirings are proper.
Second, the tropical semiring is shown not to be proper. So far there has not
been any example of a semiring that is not proper.
","[{'version': 'v1', 'created': 'Wed, 14 Apr 2010 15:50:47 GMT'}]",2015-03-14,"[['Esik', 'Zoltan', ''], ['Maletti', 'Andreas', '']]","['Weighted automaton', 'semiring', 'rational series', 'simulation', 'equivalence']"
20076,1506.00925,Catarina Runa Miranda M.D.,"Catarina Runa Miranda, Pedro Mendes, Pedro Coelho, Xenxo Alvarez,
  Jo\~ao Freitas, Miguel Sales Dias, Ver\'onica Costa Orvalho","Facial Expressions Tracking and Recognition: Database Protocols for
  Systems Validation and Evaluation","10 pages, 6 images, Computers & Graphics",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Each human face is unique. It has its own shape, topology, and distinguishing
features. As such, developing and testing facial tracking systems are
challenging tasks. The existing face recognition and tracking algorithms in
Computer Vision mainly specify concrete situations according to particular
goals and applications, requiring validation methodologies with data that fits
their purposes. However, a database that covers all possible variations of
external and factors does not exist, increasing researchers' work in acquiring
their own data or compiling groups of databases.
  To address this shortcoming, we propose a methodology for facial data
acquisition through definition of fundamental variables, such as subject
characteristics, acquisition hardware, and performance parameters. Following
this methodology, we also propose two protocols that allow the capturing of
facial behaviors under uncontrolled and real-life situations. As validation, we
executed both protocols which lead to creation of two sample databases: FdMiee
(Facial database with Multi input, expressions, and environments) and FACIA
(Facial Multimodal database driven by emotional induced acting).
  Using different types of hardware, FdMiee captures facial information under
environmental and facial behaviors variations. FACIA is an extension of FdMiee
introducing a pipeline to acquire additional facial behaviors and speech using
an emotion-acting method. Therefore, this work eases the creation of adaptable
database according to algorithm's requirements and applications, leading to
simplified validation and testing processes.
","[{'version': 'v1', 'created': 'Tue, 2 Jun 2015 15:33:10 GMT'}]",2015-06-03,"[['Miranda', 'Catarina Runa', ''], ['Mendes', 'Pedro', ''], ['Coelho', 'Pedro', ''], ['Alvarez', 'Xenxo', ''], ['Freitas', 'João', ''], ['Dias', 'Miguel Sales', ''], ['Orvalho', 'Verónica Costa', '']]","['Computer Vision', 'Human-Computer Interaction', 'Performance', 'Database', 'Algorithms Validation', 'Database Protocols']"
20077,1708.01130,Thierry Lecroq,"Jacqueline W. Daykin and Richard Groult and Yannick Guesnet and
  Thierry Lecroq and Arnaud Lefebvre and Martine L\'eonard and Laurent Mouchard
  and \'Elise Prieur-Gaston and Bruce Watson","Efficient pattern matching in degenerate strings with the
  Burrows-Wheeler transform","7 pages, 1 figure",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A degenerate or indeterminate string on an alphabet $\Sigma$ is a sequence of
non-empty subsets of $\Sigma$. Given a degenerate string $t$ of length $n$, we
present a new method based on the Burrows--Wheeler transform for searching for
a degenerate pattern of length $m$ in $t$ running in $O(mn)$ time on a constant
size alphabet $\Sigma$. Furthermore, it is a hybrid pattern-matching technique
that works on both regular and degenerate strings. A degenerate string is said
to be conservative if its number of non-solid letters is upper-bounded by a
fixed positive constant $q$; in this case we show that the search complexity
time is $O(qm^2)$. Experimental results show that our method performs well in
practice.
","[{'version': 'v1', 'created': 'Thu, 3 Aug 2017 13:30:41 GMT'}]",2017-08-04,"[['Daykin', 'Jacqueline W.', ''], ['Groult', 'Richard', ''], ['Guesnet', 'Yannick', ''], ['Lecroq', 'Thierry', ''], ['Lefebvre', 'Arnaud', ''], ['Léonard', 'Martine', ''], ['Mouchard', 'Laurent', ''], ['Prieur-Gaston', 'Élise', ''], ['Watson', 'Bruce', '']]","['algorithm', 'Burrows–Wheeler transform', 'degenerate', 'pattern matching', 'string']"
20078,1003.3830,Lucas Cordeiro Carvalho,Lucas Cordeiro and Bernd Fischer,Bounded Model Checking of Multi-threaded Software using SMT solvers,,,,,cs.LO cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The transition from single-core to multi-core processors has made
multi-threaded software an important subject in computer aided verification.
Here, we describe and evaluate an extension of the ESBMC model checker to
support the verification of multi-threaded software with shared variables and
locks using bounded model checking (BMC) based on Satisfiability Modulo
Theories (SMT). We describe three approaches to model check multi-threaded
software and our modelling of the synchronization primitives of the Pthread
library. In the lazy approach, we generate all possible interleavings and call
the BMC procedure on each of them individually, until we either find a bug, or
have systematically explored all interleavings. In the schedule recording
approach, we encode all possible interleavings into one single formula and then
exploit the high speed of the SMT solvers. In the underapproximation-widening
approach, we reduce the state space by abstracting the number of state
variables and interleavings from the proofs of unsatisfiability generated by
the SMT solvers. In all three approaches, we use partial-order reduction (POR)
techniques to reduce the number of interleavings explored. Experiments show
that our approaches can analyze larger problems and substantially reduce the
verification time compared to state-of-the-art techniques that combine classic
POR methods with symbolic algorithms and others that implement the
Counter-Example Guided Abstraction Refinement technique.
","[{'version': 'v1', 'created': 'Fri, 19 Mar 2010 16:23:11 GMT'}]",2010-03-22,"[['Cordeiro', 'Lucas', ''], ['Fischer', 'Bernd', '']]","['Formal Software Verification', 'SAT Modulo Theories', 'Multicore systems']"
20079,1603.03281,UshaRani Yelipe,"Yelipe UshaRani, P. Sammulal","An Innovative Imputation and Classification Approach for Accurate
  Disease Prediction","Special Issue of Journal IJCSIS indexed in Web of Science and Thomson
  Reuters ISI. https://sites.google.com/site/ijcsis/vol-14-s1-feb-2016",,,,cs.DB cs.IR cs.LG,http://creativecommons.org/licenses/by/4.0/,"  Imputation of missing attribute values in medical datasets for extracting
hidden knowledge from medical datasets is an interesting research topic of
interest which is very challenging. One cannot eliminate missing values in
medical records. The reason may be because some tests may not been conducted as
they are cost effective, values missed when conducting clinical trials, values
may not have been recorded to name some of the reasons. Data mining researchers
have been proposing various approaches to find and impute missing values to
increase classification accuracies so that disease may be predicted accurately.
In this paper, we propose a novel imputation approach for imputation of missing
values and performing classification after fixing missing values. The approach
is based on clustering concept and aims at dimensionality reduction of the
records. The case study discussed shows that missing values can be fixed and
imputed efficiently by achieving dimensionality reduction. The importance of
proposed approach for classification is visible in the case study which assigns
single class label in contrary to multi-label assignment if dimensionality
reduction is not performed.
","[{'version': 'v1', 'created': 'Thu, 10 Mar 2016 14:31:33 GMT'}]",2016-03-11,"[['UshaRani', 'Yelipe', ''], ['Sammulal', 'P.', '']]","['imputation; missing values; prediction; nearest neighbor', 'cluster', 'medical records', 'dimensionality reduction']"
20080,1611.00586,Bernardo Hernandez,"Bernardo Hernandez, Pablo Baldivieso and Paul Trodden","Distributed MPC: Guaranteeing Global Stabilizability from Locally
  Designed Tubes",Submitted to the IFAC World Congress 2017 (Toulouse),,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies a fundamental relation that exists between stabilizability
assumptions usually employed in distributed model predictive control
implementations, and the corresponding notions of invariance implicit in such
controllers. The relation is made explicit in the form of a theorem that
presents sufficient conditions for global stabilizability. It is shown that
constraint admissibility of local robust controllers is sufficient for the
global closed-loop system to be stable, and how these controllers are related
to more complex forms of control such as tube-based distributed model
predictive control implementations.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2016 13:15:42 GMT'}]",2016-11-03,"[['Hernandez', 'Bernardo', ''], ['Baldivieso', 'Pablo', ''], ['Trodden', 'Paul', '']]","['Predictive control', 'Invariant systems', 'Decentralized control', 'Stability analysis', 'Invariance']"
20081,1111.0567,Sivakumar Rathinam,Jungyun Bae and Sivakumar Rathinam,A Primal Dual Algorithm for a Heterogeneous Traveling Salesman Problem,,,,,cs.DM cs.DS cs.RO math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Surveillance applications require a collection of heterogeneous vehicles to
visit a set of targets. In this article, we consider a fundamental routing
problem that arises in these applications involving two vehicles. Specifically,
we consider a routing problem where there are two heterogeneous vehicles that
start from distinct initial locations, and a set of targets. The objective is
to find a tour for each vehicle such that each of the targets is visited at
least once by a vehicle and the sum of the distances traveled by the vehicles
is a minimum. We present a primal-dual algorithm for a variant of this routing
problem that provides an approximation ratio of 2.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2011 17:25:02 GMT'}, {'version': 'v2', 'created': 'Thu, 4 Apr 2013 06:06:32 GMT'}]",2015-03-19,"[['Bae', 'Jungyun', ''], ['Rathinam', 'Sivakumar', '']]","['Approximation algorithms', 'Primal-Dual method', 'Traveling Salesman Problem', 'Heterogeneous vehicles', 'Prize collecting TSP']"
20082,1402.3198,Martin Kroll,Martin Kroll,A graph theoretic linkage attack on microdata in a metric space,"24 pages, 15 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Certain methods of analysis require the knowledge of the spatial distances
between entities whose data are stored in a microdata table. For instance, such
knowledge is necessary and sufficient to perform data mining tasks such as
nearest neighbour searches or clustering. However, when inter-record distances
are published in addition to the microdata for research purposes, the risk of
identity disclosure has to be taken into consideration again. In order to
tackle this problem, we introduce a flexible graph model for microdata in a
metric space and propose a linkage attack based on realistic assumptions of a
data snooper's background knowledge. This attack is based on the idea of
finding a maximum approximate common subgraph of two vertex-labelled and
edge-weighted graphs. By adapting a standard argument from algorithmic graph
theory to our setup, this task is transformed to the maximum clique detection
problem in a corresponding product graph. Using a toy example and experimental
results on simulated data show that publishing even approximate distances could
increase the risk of identity disclosure unreasonably.
","[{'version': 'v1', 'created': 'Thu, 13 Feb 2014 16:20:50 GMT'}]",2014-02-14,"[['Kroll', 'Martin', '']]","['Anonymity', 'identity disclosure', 'linkage attack', 'maximum approximate common subgraph problem']"
20083,1511.01293,Leonardo Parisi,"Andrea Cavagna, Chiara Creato, Lorenzo Del Castello, Stefania Melillo,
  Leonardo Parisi, Massimiliano Viale","Towards a tracking algorithm based on the clustering of spatio-temporal
  clouds of points",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The interest in 3D dynamical tracking is growing in fields such as robotics,
biology and fluid dynamics. Recently, a major source of progress in 3D tracking
has been the study of collective behaviour in biological systems, where the
trajectories of individual animals moving within large and dense groups need to
be reconstructed to understand the behavioural interaction rules. Experimental
data in this field are generally noisy and at low spatial resolution, so that
individuals appear as small featureless objects and trajectories must be
retrieved by making use of epipolar information only. Moreover, optical
occlusions often occur: in a multi-camera system one or more objects become
indistinguishable in one view, potentially jeopardizing the conservation of
identity over long-time trajectories. The most advanced 3D tracking algorithms
overcome optical occlusions making use of set-cover techniques, which however
have to solve NP-hard optimization problems. Moreover, current methods are not
able to cope with occlusions arising from actual physical proximity of objects
in 3D space. Here, we present a new method designed to work directly in 3D
space and time, creating (3D+1) clouds of points representing the full
spatio-temporal evolution of the moving targets. We can then use a simple
connected components labeling routine, which is linear in time, to solve
optical occlusions, hence lowering from NP to P the complexity of the problem.
Finally, we use normalized cut spectral clustering to tackle 3D physical
proximity.
","[{'version': 'v1', 'created': 'Wed, 4 Nov 2015 11:20:51 GMT'}]",2015-11-05,"[['Cavagna', 'Andrea', ''], ['Creato', 'Chiara', ''], ['Del Castello', 'Lorenzo', ''], ['Melillo', 'Stefania', ''], ['Parisi', 'Leonardo', ''], ['Viale', 'Massimiliano', '']]","['3D Tracking', 'Spectral Clustering', 'Computer Vision']"
20084,1407.6056,Ahmed Bouchboua,"Ahmed Bouchboua and Rabah Ouremchi and Fay\c{c}al Messaoudi and
  Mohammed El Ghazi","Generation of pedagogical content based on the learning style of
  learners in a dynamic adaptive hypermedia environment",,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several researches in psychology and science of education affirm the impact
of learning style on the learning process and encourage its taking into account
in the teaching strategies in order to facilitate the task for learners and
improve their results. This article deals with the relationship between the
characteristics of the learner, the teaching materials and the context in which
takes place the learning in order to allow a better adaptivity. The latter is
ensured thanks to the most important element of our system, which is the
generator of course, the latter allows you to offer a hypermedia virtual,
therefore the pages and the links will be built dynamically, taking into
account the learning style and the cognitive status of the learner. As well and
after having completed a first filter on the fragments, in order to select
those corresponding to the course, there will be applied a second filter to
select the fragments corresponding to the learning style of the learner to
retain only those in accordance with responsive to the level of knowledge
required.
","[{'version': 'v1', 'created': 'Tue, 22 Jul 2014 21:56:13 GMT'}]",2014-07-24,"[['Bouchboua', 'Ahmed', ''], ['Ouremchi', 'Rabah', ''], ['Messaoudi', 'Fayçal', ''], ['Ghazi', 'Mohammed El', '']]","['component; Hypermedia', 'learning style', 'fragment', 'generator of course']"
20085,0909.1771,Ken Smith,"Ken Smith (MITRE), Michael Morse (MITRE), Peter Mork (MITRE), Maya Li
  (MITRE), Arnon Rosenthal, David Allen, Len Seligman, Chris Wolf (MITRE)",The Role of Schema Matching in Large Enterprises,CIDR 2009,,,,cs.DB,http://creativecommons.org/licenses/by/3.0/,"  To date, the principal use case for schema matching research has been as a
precursor for code generation, i.e., constructing mappings between schema
elements with the end goal of data transfer. In this paper, we argue that
schema matching plays valuable roles independent of mapping construction,
especially as schemata grow to industrial scales. Specifically, in large
enterprises human decision makers and planners are often the immediate consumer
of information derived from schema matchers, instead of schema mapping tools.
We list a set of real application areas illustrating this role for schema
matching, and then present our experiences tackling a customer problem in one
of these areas. We describe the matcher used, where the tool was effective,
where it fell short, and our lessons learned about how well current schema
matching technology is suited for use in large enterprises. Finally, we suggest
a new agenda for schema matching research based on these experiences.
","[{'version': 'v1', 'created': 'Wed, 9 Sep 2009 18:09:48 GMT'}]",2009-09-15,"[['Smith', 'Ken', '', 'MITRE'], ['Morse', 'Michael', '', 'MITRE'], ['Mork', 'Peter', '', 'MITRE'], ['Li', 'Maya', '', 'MITRE'], ['Rosenthal', 'Arnon', '', 'MITRE'], ['Allen', 'David', '', 'MITRE'], ['Seligman', 'Len', '', 'MITRE'], ['Wolf', 'Chris', '', 'MITRE']]","['Schema Matching', 'Industrial-Scale', 'Experience', 'Decision Makers']"
20086,1401.0870,Laurence Aroquiaraj,I. Laurence Aroquiaraj and K. Thangavel,"Pectoral Muscles Suppression in Digital Mammograms using Hybridization
  of Soft Computing Methods","8 pages, 6 figures",,,,cs.CV cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Breast region segmentation is an essential prerequisite in computerized
analysis of mammograms. It aims at separating the breast tissue from the
background of the mammogram and it includes two independent segmentations. The
first segments the background region which usually contains annotations, labels
and frames from the whole breast region, while the second removes the pectoral
muscle portion (present in Medio Lateral Oblique (MLO) views) from the rest of
the breast tissue. In this paper we propose hybridization of Connected
Component Labeling (CCL), Fuzzy, and Straight line methods. Our proposed
methods worked good for separating pectoral region. After removal pectoral
muscle from the mammogram, further processing is confined to the breast region
alone. To demonstrate the validity of our segmentation algorithm, it is
extensively tested using over 322 mammographic images from the Mammographic
Image Analysis Society (MIAS) database. The segmentation results were evaluated
using a Mean Absolute Error (MAE), Hausdroff Distance (HD), Probabilistic Rand
Index (PRI), Local Consistency Error (LCE) and Tanimoto Coefficient (TC). The
hybridization of fuzzy with straight line method is given more than 96% of the
curve segmentations to be adequate or better. In addition a comparison with
similar approaches from the state of the art has been given, obtaining slightly
improved results. Experimental results demonstrate the effectiveness of the
proposed approach.
","[{'version': 'v1', 'created': 'Sun, 5 Jan 2014 08:14:43 GMT'}]",2014-01-07,"[['Aroquiaraj', 'I. Laurence', ''], ['Thangavel', 'K.', '']]","['X-ray Mammography', 'CCL', 'Fuzzy', 'Straight line']"
20087,1505.02510,Zai Yang,Zai Yang and Lihua Xie and Petre Stoica,"Vandermonde Decomposition of Multilevel Toeplitz Matrices with
  Application to Multidimensional Super-Resolution","17 pages, double column, 5 figures, to appear in IEEE Transactions on
  Information Theory",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Vandermonde decomposition of Toeplitz matrices, discovered by
Carath\'{e}odory and Fej\'{e}r in the 1910s and rediscovered by Pisarenko in
the 1970s, forms the basis of modern subspace methods for 1D frequency
estimation. Many related numerical tools have also been developed for
multidimensional (MD), especially 2D, frequency estimation; however, a
fundamental question has remained unresolved as to whether an analog of the
Vandermonde decomposition holds for multilevel Toeplitz matrices in the MD
case. In this paper, an affirmative answer to this question and a constructive
method for finding the decomposition are provided when the matrix rank is lower
than the dimension of each Toeplitz block. A numerical method for searching for
a decomposition is also proposed when the matrix rank is higher. The new
results are applied to studying MD frequency estimation within the recent
super-resolution framework. A precise formulation of the atomic $\ell_0$ norm
is derived using the Vandermonde decomposition. Practical algorithms for
frequency estimation are proposed based on relaxation techniques. Extensive
numerical simulations are provided to demonstrate the effectiveness of these
algorithms compared to the existing atomic norm and subspace methods.
","[{'version': 'v1', 'created': 'Mon, 11 May 2015 07:43:19 GMT'}, {'version': 'v2', 'created': 'Fri, 20 Nov 2015 05:08:08 GMT'}, {'version': 'v3', 'created': 'Wed, 23 Mar 2016 14:51:54 GMT'}]",2016-03-24,"[['Yang', 'Zai', ''], ['Xie', 'Lihua', ''], ['Stoica', 'Petre', '']]","['The Vandermonde decomposition', 'multilevelToeplitz matrix', 'multidimensional frequency estimation', 'superresolution', 'atomic norm']"
20088,0803.1926,Juan J. Merelo Pr.,"Pablo Garcia-Sanchez, J. L. J. Laredo, J. P. Sevilla, Pedro Castillo,
  J. J. Merelo",Improved evolutionary generation of XSLT stylesheets,Accepted as poster at the GECCO-2008 conference,,,,cs.NE cs.AI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper introduces a procedure based on genetic programming to evolve XSLT
programs (usually called stylesheets or logicsheets). XSLT is a general
purpose, document-oriented functional language, generally used to transform XML
documents (or, in general, solve any problem that can be coded as an XML
document). The proposed solution uses a tree representation for the stylesheets
as well as diverse specific operators in order to obtain, in the studied cases
and a reasonable time, a XSLT stylesheet that performs the transformation.
Several types of representation have been compared, resulting in different
performance and degree of success.
","[{'version': 'v1', 'created': 'Thu, 13 Mar 2008 11:43:25 GMT'}]",2008-03-14,"[['Garcia-Sanchez', 'Pablo', ''], ['Laredo', 'J. L. J.', ''], ['Sevilla', 'J. P.', ''], ['Castillo', 'Pedro', ''], ['Merelo', 'J. J.', '']]","['genetic programming', 'XML', 'XSLT', 'JEO', 'DREAM', 'constrained evolutionary computation', 'document transformation']"
20089,1512.02758,Erkan Bostanci,Erkan Bostanci,"Motion model transitions in GPS-IMU sensor fusion for user tracking in
  augmented reality","8 pages, journal",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finding the position of the user is an important processing step for
augmented reality (AR) applications. This paper investigates the use of
different motion models in order to choose the most suitable one, and
eventually reduce the Kalman filter errors in sensor fusion for such
applications where the accuracy of user tracking is crucial. A Deterministic
Finite Automaton (DFA) was employed using the innovation parameters of the
filter. Results show that the approach presented here reduces the filter error
compared to a static model and prevents filter divergence. The approach was
tested on a simple AR game in order to justify the accuracy and performance of
the algorithm.
","[{'version': 'v1', 'created': 'Wed, 9 Dec 2015 05:51:11 GMT'}]",2015-12-10,"[['Bostanci', 'Erkan', '']]","['Deterministic Finite Automaton (DFA)', 'sensor fusion', 'GPS', 'IMU', 'model selection', 'augmented reality']"
20090,1511.09074,Mrigank Sharad,"Sohail Ahasan, Saurav Maji, Kauhsik Roy, Mrigank Sharad","Digital LDO with Time-Interleaved Comparators for Fast Response and Low
  Ripple",,,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  On-chip voltage regulation using distributed Digital Low Drop Out (LDO)
voltage regulators has been identified as a promising technique for efficient
power-management for emerging multi-core processors. Digital LDOs (DLDO) can
offer low voltage operation, faster transient response, and higher current
efficiency. Response time as well as output voltage ripple can be reduced by
increasing the speed of the dynamic comparators. However, the comparator offset
steeply increases for high clock frequencies, thereby leading to enhanced
variations in output voltage. In this work we explore the design of digital
LDOs with multiple dynamic comparators that can overcome this bottleneck. In
the proposed topology, we apply time-interleaved comparators with the same
voltage threshold and uniform current step in order to accomplish the
aforementioned features. Simulation based analysis shows that the DLDO with
time-interleaved comparators can achieve better overall performance in terms of
current efficiency, ripple and settling time. For a load step of 50mA, a DLDO
with 8 time-interleaved comparators could achieve an output ripple of less than
5mV, while achieving a settling time of less than 0.5us. Load current dependant
dynamic adjustment of clock frequency is proposed to maintain high current
efficiency of ~97%.
","[{'version': 'v1', 'created': 'Sun, 29 Nov 2015 19:42:09 GMT'}]",2015-12-01,"[['Ahasan', 'Sohail', ''], ['Maji', 'Saurav', ''], ['Roy', 'Kauhsik', ''], ['Sharad', 'Mrigank', '']]","['low power', 'voltage regulation', 'VLSI', 'digital', 'circuit']"
20091,1110.0336,Gerald Kembellec,"G\'erald Kembellec, Imad Saleh, Catherine Sauvaget (LIASD)","OntologyNavigator: WEB 2.0 scalable ontology based CLIR portal to IT
  scientific corpus for researchers","International Journal of Design Sciences and Technology 16, 2 (2009)
  http://europia.org/IJDST/vol16/IJDST_V16N2_2009_paper%203.pdf",,,,cs.IR cs.DL cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work presents the architecture used in the ongoing OntologyNavigator
project. It is a research tool to help advanced learners to find adapted IT
papers to create scientific bibliographies. The purpose is the use of an IT
representation as educational research software for researchers. We use an
ontology based on the ACM's Computing Classification System in order to find
scientific papers directly related to the new researcher's domain without any
formal request. An ontology translation in French is automatically proposed and
can be based on Web 2.0 enhanced by a community of users. A visualization and
navigation model is proposed to make it more accessible and examples are given
to show the interface of the tool. This model offers the possibility of cross
language query. Users deeply interact with the translation by providing
alternative translation of the node label. Customers also enrich the ontology
node labels with implicit descriptors.
","[{'version': 'v1', 'created': 'Mon, 3 Oct 2011 12:10:38 GMT'}]",2012-02-07,"[['Kembellec', 'Gérald', '', 'LIASD'], ['Saleh', 'Imad', '', 'LIASD'], ['Sauvaget', 'Catherine', '', 'LIASD']]","['Digital Library', 'Domain Ontology', 'KBS', 'Metadata', 'Cross Language Information Retrieval']"
20092,0707.1954,Alessandro Nordio,"A. Nordio, C.-F. Chiasserini, E. Viterbo",Bandlimited Field Reconstruction for Wireless Sensor Networks,,,,,cs.OH,,"  Wireless sensor networks are often used for environmental monitoring
applications. In this context sampling and reconstruction of a physical field
is one of the most important problems to solve. We focus on a bandlimited field
and find under which conditions on the network topology the reconstruction of
the field is successful, with a given probability. We review irregular sampling
theory, and analyze the problem using random matrix theory. We show that even a
very irregular spatial distribution of sensors may lead to a successful signal
reconstruction, provided that the number of collected samples is large enough
with respect to the field bandwidth. Furthermore, we give the basis to
analytically determine the probability of successful field reconstruction.
","[{'version': 'v1', 'created': 'Fri, 13 Jul 2007 09:54:54 GMT'}]",2007-07-16,"[['Nordio', 'A.', ''], ['Chiasserini', 'C. -F.', ''], ['Viterbo', 'E.', '']]","['Irregular sampling', 'random matrices', 'Toeplitz matrix', 'eigenvalue distribution']"
20093,1105.2017,Stefano Buzzi,"Stefano Buzzi, Alessio Zappone","Potential Games for Energy-Efficient Resource Allocation in
  Multipoint-to-Multipoint CDMA Wireless Data Networks","Submitted to Physical Communication, ELSEVIER",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of noncooperative resource allocation in a
multipoint-to-multipoint cellular network is considered in this paper. The
considered scenario is general enough to represent several key instances of
modern wireless networks such as a multicellular network, a peer-to-peer
network (interference channel), and a wireless network equipped with
femtocells. In particular, the problem of joint transmit waveforms adaptation,
linear receiver design, and transmit power control is examined. Several utility
functions to be maximized are considered, and, among them, we cite the received
SINR, and the transmitter energy efficiency, which is measured in bit/Joule,
and represents the number of successfully delivered bits for each energy unit
used for transmission. Resorting to the theory of potential games,
noncooperative games admitting Nash equilibria in multipoint-to-multipoint
cellular networks regardless of the channel coefficient realizations are
designed. Computer simulations confirm that the considered games are
convergent, and show the huge benefits that resource allocation schemes can
bring to the performance of wireless data networks.
","[{'version': 'v1', 'created': 'Tue, 10 May 2011 18:51:04 GMT'}]",2011-05-11,"[['Buzzi', 'Stefano', ''], ['Zappone', 'Alessio', '']]","['Multicell networks', 'peer-to-peer networks', 'interference channel', 'femtocells', 'potential games', 'energy efficiency', 'waveform adaptation', 'power control']"
20094,1511.03028,Chang Tang,"Chang Tang, Pichao Wang, Wanqing Li","Online Action Recognition based on Incremental Learning of Weighted
  Covariance Descriptors",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Different from traditional action recognition based on video segments, online
action recognition aims to recognize actions from unsegmented streams of data
in a continuous manner. One way for online recognition is based on the evidence
accumulation over time to make predictions from stream videos. This paper
presents a fast yet effective method to recognize actions from stream of noisy
skeleton data, and a novel weighted covariance descriptor is adopted to
accumulate evidence. In particular, a fast incremental updating method for the
weighted covariance descriptor is developed for accumulation of temporal
information and online prediction. The weighted covariance descriptor takes the
following principles into consideration: past frames have less contribution for
recognition and recent and informative frames such as key frames contribute
more to the recognition. The online recognition is achieved using a simple
nearest neighbor search against a set of offline trained action models.
Experimental results on MSC-12 Kinect Gesture dataset and our newly constructed
online action recognition dataset have demonstrated the efficacy of the
proposed method.
","[{'version': 'v1', 'created': 'Tue, 10 Nov 2015 09:18:30 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Apr 2017 02:04:51 GMT'}, {'version': 'v3', 'created': 'Wed, 5 Apr 2017 06:45:02 GMT'}, {'version': 'v4', 'created': 'Thu, 6 Jul 2017 11:22:38 GMT'}]",2017-07-07,"[['Tang', 'Chang', ''], ['Wang', 'Pichao', ''], ['Li', 'Wanqing', '']]","['Online Action Recognition', 'Weighted Covariance', 'IncrementalLearning', 'Skeleton', 'Online RGB-D Dataset']"
20095,0705.2835,Binhai Zhu,"Sergey Bereg, Marina Gavrilova and Binhai Zhu","Voronoi Diagram of Polygonal Chains under the Discrete Fr\'echet
  Distance","13 pages, 2 figures",,,,cs.CG cs.CC,,"  Polygonal chains are fundamental objects in many applications like pattern
recognition and protein structure alignment. A well-known measure to
characterize the similarity of two polygonal chains is the famous Fr\`{e}chet
distance. In this paper, for the first time, we consider the Voronoi diagram of
polygonal chains in $d$-dimension ($d=2,3$) under the discrete Fr\`{e}chet
distance. Given $n$ polygonal chains ${\cal C}$ in $d$-dimension ($d=2,3$),
each with at most $k$ vertices, we prove fundamental properties of such a
Voronoi diagram {\em VD}$_F({\cal C})$ by presenting the first known upper and
lower bounds for {\em VD}$_F({\cal C})$.
","[{'version': 'v1', 'created': 'Sat, 19 May 2007 18:35:18 GMT'}]",2007-05-23,"[['Bereg', 'Sergey', ''], ['Gavrilova', 'Marina', ''], ['Zhu', 'Binhai', '']]","['Voronoi diagram', 'Fr´echet distance', 'discrete Fr´echet distance', 'combinatorial complex']"
20096,1705.00086,Jihua Zhu,"Minmin Xu, Siyu Xu, Jihua Zhu, Yaochen Li, Jun Wang, Huimin Lu","Effective scaling registration approach by imposing the emphasis on the
  scale factor","22 pages, 4 figures, 2 tables",,,,cs.CV,http://creativecommons.org/publicdomain/zero/1.0/,"  This paper proposes an effective approach for the scaling registration of
$m$-D point sets. Different from the rigid transformation, the scaling
registration can not be formulated into the common least square function due to
the ill-posed problem caused by the scale factor. Therefore, this paper designs
a novel objective function for the scaling registration problem. The appearance
of this objective function is a rational fraction, where the numerator item is
the least square error and the denominator item is the square of the scale
factor. By imposing the emphasis on scale factor, the ill-posed problem can be
avoided in the scaling registration. Subsequently, the new objective function
can be solved by the proposed scaling iterative closest point (ICP) algorithm,
which can obtain the optimal scaling transformation. For the practical
applications, the scaling ICP algorithm is further extended to align partially
overlapping point sets. Finally, the proposed approach is tested on public data
sets and applied to merging grid maps of different resolutions. Experimental
results demonstrate its superiority over previous approaches on efficiency and
robustness.
","[{'version': 'v1', 'created': 'Fri, 28 Apr 2017 22:21:47 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Mar 2019 12:02:24 GMT'}]",2019-03-11,"[['Xu', 'Minmin', ''], ['Xu', 'Siyu', ''], ['Zhu', 'Jihua', ''], ['Li', 'Yaochen', ''], ['Wang', 'Jun', ''], ['Lu', 'Huimin', '']]","['Scaling registration', 'Scale factor', 'Point set', 'Overlapping']"
20097,1504.05651,Kun Zhang,"Kun Zhang, Jiji Zhang, Bernhard Sch\""olkopf",Distinguishing Cause from Effect Based on Exogeneity,"11 pages, 4 figures, published in Proceedings of the 15th conference
  on Theoretical Aspects of Rationality and Knowledge (TARK'15)",,,,cs.AI stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent developments in structural equation modeling have produced several
methods that can usually distinguish cause from effect in the two-variable
case. For that purpose, however, one has to impose substantial structural
constraints or smoothness assumptions on the functional causal models. In this
paper, we consider the problem of determining the causal direction from a
related but different point of view, and propose a new framework for causal
direction determination. We show that it is possible to perform causal
inference based on the condition that the cause is ""exogenous"" for the
parameters involved in the generating process from the cause to the effect. In
this way, we avoid the structural constraints required by the SEM-based
approaches. In particular, we exploit nonparametric methods to estimate
marginal and conditional distributions, and propose a bootstrap-based approach
to test for the exogeneity condition; the testing results indicate the causal
direction between two variables. The proposed method is validated on both
synthetic and real data.
","[{'version': 'v1', 'created': 'Wed, 22 Apr 2015 04:35:33 GMT'}]",2015-04-23,"[['Zhang', 'Kun', ''], ['Zhang', 'Jiji', ''], ['Schölkopf', 'Bernhard', '']]","['Causal discovery', 'causal direction', 'exogeneity', 'statistical independence', 'bootstrap']"
20098,1504.06374,Vijay Saraswat,Cristina Cornelio and Andrea Loreggia and Vijay Saraswat,Logical Conditional Preference Theories,"15 pages, 1 figure, submitted to CP 2015",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  CP-nets represent the dominant existing framework for expressing qualitative
conditional preferences between alternatives, and are used in a variety of
areas including constraint solving. Over the last fifteen years, a significant
literature has developed exploring semantics, algorithms, implementation and
use of CP-nets. This paper introduces a comprehensive new framework for
conditional preferences: logical conditional preference theories (LCP
theories). To express preferences, the user specifies arbitrary (constraint)
Datalog programs over a binary ordering relation on outcomes. We show how LCP
theories unify and generalize existing conditional preference proposals, and
leverage the rich semantic, algorithmic and implementation frameworks of
Datalog.
","[{'version': 'v1', 'created': 'Fri, 24 Apr 2015 02:07:36 GMT'}]",2015-04-27,"[['Cornelio', 'Cristina', ''], ['Loreggia', 'Andrea', ''], ['Saraswat', 'Vijay', '']]","['CP-nets', 'preferences', 'datalog', 'constraint logic programming']"
20099,1401.5086,Olivier  Ruatta,"Olivier Ruatta, Mark Sciabica, Agnes Szanto",Over-constrained Weierstrass iteration and the nearest consistent system,,,,,cs.SC math.OC,http://creativecommons.org/licenses/publicdomain/,"  We propose a generalization of the Weierstrass iteration for over-constrained
systems of equations and we prove that the proposed method is the Gauss-Newton
iteration to find the nearest system which has at least $k$ common roots and
which is obtained via a perturbation of prescribed structure. In the univariate
case we show the connection of our method to the optimization problem
formulated by Karmarkar and Lakshman for the nearest GCD. In the multivariate
case we generalize the expressions of Karmarkar and Lakshman, and give
explicitly several iteration functions to compute the optimum.
  The arithmetic complexity of the iterations is detailed.
","[{'version': 'v1', 'created': 'Mon, 20 Jan 2014 21:07:54 GMT'}]",2014-01-22,"[['Ruatta', 'Olivier', ''], ['Sciabica', 'Mark', ''], ['Szanto', 'Agnes', '']]","['Overdetermined systems', 'nearest consistent system', 'Weierstrass Durand Kernermethod']"
20100,1802.07116,Ana Paula Appel,"Ana Paula Appel, Vagner F. de Santana, Luis G. Moyano, Marcia Ito,
  Claudio Santos Pinhanez","A Social Network Analysis Framework for Modeling Health Insurance Claims
  Data","8 pages, 5 figures",,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Health insurance companies in Brazil have their data about claims organized
having the view only for providers. In this way, they loose the physician view
and how they share patients. Partnership between physicians can view as a
fruitful work in most of the cases but sometimes this could be a problem for
health insurance companies and patients, for example a recommendation to visit
another physician only because they work in same clinic. The focus of the work
is to better understand physicians activities and how these activities are
represented in the data. Our approach considers three aspects: the
relationships among physicians, the relationships between physicians and
patients, and the relationships between physicians and health providers. We
present the results of an analysis of a claims database (detailing 18 months of
activity) from a large health insurance company in Brazil. The main
contribution presented in this paper is a set of models to represent: mutual
referral between physicians, patient retention, and physician centrality in the
health insurance network. Our results show the proposed models based on social
network frameworks, extracted surprising insights about physicians from real
health insurance claims data.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 14:05:30 GMT'}]",2018-02-21,"[['Appel', 'Ana Paula', ''], ['de Santana', 'Vagner F.', ''], ['Moyano', 'Luis G.', ''], ['Ito', 'Marcia', ''], ['Pinhanez', 'Claudio Santos', '']]","['Social Network Analysis', 'Graph Mining', 'Healthcare', 'Claims']"
20101,0802.3087,EDA Publishing Association,"G.-J. Wang, W.-Z. Chen, K.J. Chang",A Two-Step Etching Method to Fabricate Nanopores in Silicon,"Submitted on behalf of EDA Publishing Association
  (http://irevues.inist.fr/EDA-Publishing)","Dans Symposium on Design, Test, Integration and Packaging of
  MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007)",,,cs.OH,,"  A cost effectively method to fabricate nanopores in silicon by only using the
conventional wet-etching technique is developed in this research. The main
concept of the proposed method is a two-step etching process, including a
premier double-sided wet etching and a succeeding track-etching. A special
fixture is designed to hold the pre-etched silicon wafer inside it such that
the track-etching can be effectively carried out. An electrochemical system is
employed to detect and record the ion diffusion current once the pre-etched
cavities are etched into a through nanopore. Experimental results indicate that
the proposed method can cost effectively fabricate nanopores in silicon.
","[{'version': 'v1', 'created': 'Thu, 21 Feb 2008 13:40:46 GMT'}]",2008-02-22,"[['Wang', 'G. -J.', ''], ['Chen', 'W. -Z.', ''], ['Chang', 'K. J.', '']]","['Nanopore fabrication', 'wet etching', 'track etching']"
20102,1511.07578,Emre Erturk,"Emre Erturk, Howard Robert Edward Iles","Case Study on Cloud Based Library Software as a Service: Evaluating
  EZproxy",,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a growing relationship between academic libraries and cloud
computing. Therefore, understanding the beginnings and the current use of cloud
base services in libraries is important. This will help understand the factors
that libraries should consider in the future. The purpose of this paper is to
better understand the future implementation of the cloud based software in
academic settings. Using cloud based, web based, and other remote services may
bring both advantages and disadvantages, some of which this paper will bring
out. First, a brief literature review of the academic literature, and a review
of available general-purpose cloud-based library products are conducted. Next,
a real-life scenario for a mid-sized New Zealand institution of higher
education is evaluated. This case involves moving from a locally hosted version
of EZproxy to a cloud based version with support from the vendor. As this
information system decision is an important one, this paper makes a
contribution to the available literature and can be informative for librarians.
In conclusion, academic libraries will gradually involve more pervasive use of
cloud based systems. The examples of important factors to be considered in
future decisions include timing and staffing.
","[{'version': 'v1', 'created': 'Tue, 24 Nov 2015 06:05:13 GMT'}]",2015-11-25,"[['Erturk', 'Emre', ''], ['Iles', 'Howard Robert Edward', '']]","['Cloud Computing', 'SaaS', 'Library Systems   1']"
20103,1312.3116,Robert V. Mayer,R. V. Mayer,"Various models of process of the learning, based on the numerical
  solution of the differential equations","8 pages, 5 figures, on russian; Modern scientific researches and
  innovations 2013 oktober 10",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The principles on which can be based computer model of process of training
are formulated. Are considered: 1) the unicomponent model, which is recognizing
that educational information consists of equal elements; 2) the multicomponent
model, which is considering that knowledge is assimilate with a various
strength, and on lesson weak knowledge becomes strong; 3) the generalized
multicomponent model which considers change of working capacity of the pupil
and various complexity of studied elements of a training material. Typical
results of imitating modeling of learning process are presented in article.
","[{'version': 'v1', 'created': 'Wed, 11 Dec 2013 11:13:13 GMT'}]",2013-12-12,"[['Mayer', 'R. V.', '']]","['didactics', 'mathematical learning theory', 'model of training', 'programming', 'simulation']"
20104,1704.08615,"Matthias K\""ummerer","Matthias K\""ummerer, Thomas S. A. Wallis, Matthias Bethge","Saliency Benchmarking Made Easy: Separating Models, Maps and Metrics",published at ECCV 2018,,,,cs.CV stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dozens of new models on fixation prediction are published every year and
compared on open benchmarks such as MIT300 and LSUN. However, progress in the
field can be difficult to judge because models are compared using a variety of
inconsistent metrics. Here we show that no single saliency map can perform well
under all metrics. Instead, we propose a principled approach to solve the
benchmarking problem by separating the notions of saliency models, maps and
metrics. Inspired by Bayesian decision theory, we define a saliency model to be
a probabilistic model of fixation density prediction and a saliency map to be a
metric-specific prediction derived from the model density which maximizes the
expected performance on that metric given the model density. We derive these
optimal saliency maps for the most commonly used saliency metrics (AUC, sAUC,
NSS, CC, SIM, KL-Div) and show that they can be computed analytically or
approximated with high precision. We show that this leads to consistent
rankings in all metrics and avoids the penalties of using one saliency map for
all metrics. Our method allows researchers to have their model compete on many
different metrics with state-of-the-art in those metrics: ""good"" models will
perform well in all metrics.
","[{'version': 'v1', 'created': 'Thu, 27 Apr 2017 15:07:42 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Jul 2018 13:31:14 GMT'}]",2018-07-26,"[['Kümmerer', 'Matthias', ''], ['Wallis', 'Thomas S. A.', ''], ['Bethge', 'Matthias', '']]","['saliency', 'benchmarking', 'metrics', 'fixations', 'Bayesian decision theory', 'model comparison']"
20105,1610.02374,Igor Polkovnikov,Igor Polkovnikov,"Unified Control and Data Flow Diagrams Applied to Software Engineering
  and other Systems","23 pages, 22 figures",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  More often than not, there is a need to understand the structure of complex
computer code: what functions and in what order they are called, how
information travels around static, input, and output variables, what depends on
what. As a rule, executable code and data are scattered among multiple files
and even multiple modules. Information is transmitted among variables which
often change names. These tangled relations greatly complicate the development,
maintenance, and redevelopment of code, its analysis for complexity and its
robustness. As of now, there is no tool which is capable of presenting the
real-life, useful diagram of actual code. Conventional flowcharts fail.
Proposed is the method which overcomes these difficulties. The main idea is
that functionality of software can be described through flows of control, which
is essentially flows of time, and flows of data. These are inseparable. The
second idea is to follow very strict system boundaries and distinctions with
respect to modules, functions, blocks, and operators, as well as data holders,
showing them all as subsystems, in other words, by clearly expressing the
system structure when every piece of executable code and every variable may
have its own graphical representation. The third is defining timelines as the
entities clearly separated from the connected blocks of code. Timelines allow
presentation of nesting of the control flow as deep as necessary. As a proof of
concept, the same methods successfully describe production systems. Keywords:
flowchart, UML, software diagram, visual programming, extreme programming,
extreme modeling, control flow, data flow.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2016 19:00:04 GMT'}]",2016-10-10,"[['Polkovnikov', 'Igor', '']]","['flowchart', 'UML', 'software diagram', 'visual programming', 'extreme programming', 'extreme modeling', 'control flow', 'data flow']"
20106,1611.01063,Petr Novotn\'y,"Krishnendu Chatterjee, Petr Novotn\'y, {\DJ}or{\dj}e \v{Z}ikeli\'c",Stochastic Invariants for Probabilistic Termination,Full version of a paper published at POPL 2017. 20 pages,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Termination is one of the basic liveness properties, and we study the
termination problem for probabilistic programs with real-valued variables.
Previous works focused on the qualitative problem that asks whether an input
program terminates with probability~1 (almost-sure termination). A powerful
approach for this qualitative problem is the notion of ranking supermartingales
with respect to a given set of invariants. The quantitative problem
(probabilistic termination) asks for bounds on the termination probability. A
fundamental and conceptual drawback of the existing approaches to address
probabilistic termination is that even though the supermartingales consider the
probabilistic behavior of the programs, the invariants are obtained completely
ignoring the probabilistic aspect.
  In this work we address the probabilistic termination problem for
linear-arithmetic probabilistic programs with nondeterminism. We define the
notion of {\em stochastic invariants}, which are constraints along with a
probability bound that the constraints hold. We introduce a concept of {\em
repulsing supermartingales}. First, we show that repulsing supermartingales can
be used to obtain bounds on the probability of the stochastic invariants.
Second, we show the effectiveness of repulsing supermartingales in the
following three ways: (1)~With a combination of ranking and repulsing
supermartingales we can compute lower bounds on the probability of termination;
(2)~repulsing supermartingales provide witnesses for refutation of almost-sure
termination; and (3)~with a combination of ranking and repulsing
supermartingales we can establish persistence properties of probabilistic
programs.
  We also present results on related computational problems and an experimental
evaluation of our approach on academic examples.
","[{'version': 'v1', 'created': 'Thu, 3 Nov 2016 15:28:36 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Nov 2016 14:20:04 GMT'}]",2016-11-17,"[['Chatterjee', 'Krishnendu', ''], ['Novotný', 'Petr', ''], ['Žikelić', 'Đorđe', '']]","['ProbabilisticPrograms', 'Termination', 'Martingales', 'Concentration']"
20107,1404.0158,Oluwagbenga Ogunduyile O,"O.O. Ogunduyile, O.O. Olugbara, M. Lall","Development of Wearable Systems for Ubiquitous Healthcare Service
  Provisioning","6 pages, 3 figures, APCBEE Procedia 7, 2013. arXiv admin note:
  substantial text overlap with arXiv:1309.1542",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper reports on the development of a wearable system using wireless
biomedical sensors for ubiquitous healthcare service provisioning. The
prototype system is developed to address current healthcare challenges such as
increasing cost of services, inability to access diverse services, low quality
services and increasing population of elderly as experienced globally. The
biomedical sensors proactively collect physiological data of remote patients to
recommend diagnostic services. The prototype system is designed to monitor
oxygen saturation level (SpO2), Heart Rate (HR), activity and location of the
elderly. Physiological data collected are uploaded to a Health Server (HS) via
GPRS/Internet for analysis.
","[{'version': 'v1', 'created': 'Tue, 1 Apr 2014 08:18:09 GMT'}]",2014-04-02,"[['Ogunduyile', 'O. O.', ''], ['Olugbara', 'O. O.', ''], ['Lall', 'M.', '']]","['Biomedical sensors', 'Ubiquitous Healthcare', 'Wearable system', 'Web Application Server (WAS)']"
20108,1004.2526,Nicholas Pippenger,A. H. Hunter and Nicholas Pippenger,Local versus Global Search in Channel Graphs,"i+13 pages, 2 figures",,,,cs.CC math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Previous studies of search in channel graphs has assumed that the search is
global; that is, that the status of any link can be probed by the search
algorithm at any time. We consider for the first time local search, for which
only links to which an idle path from the source has already been established
may be probed. We show that some well known channel graphs may require
exponentially more probes, on the average, when search must be local than when
it may be global.
","[{'version': 'v1', 'created': 'Thu, 15 Apr 2010 00:12:47 GMT'}]",2010-04-16,"[['Hunter', 'A. H.', ''], ['Pippenger', 'Nicholas', '']]","['Circuit switching', 'path search', 'search algorithms', 'decision trees']"
20109,1003.4905,Abbas Dideban,"Abbas Dideban, Hassane Alla (GIPSA-lab)",Feedback control logic synthesis for non safe Petri nets,,"Conf\'erence INCOM 2009, Moscou : Russian Federation (2009)",,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the problem of forbidden states of non safe Petri Net
(PN) modelling discrete events systems. To prevent the forbidden states, it is
possible to use conditions or predicates associated with transitions.
Generally, there are many forbidden states, thus many complex conditions are
associated with the transitions. A new idea for computing predicates in non
safe Petri nets will be presented. Using this method, we can construct a
maximally permissive controller if it exists.
","[{'version': 'v1', 'created': 'Thu, 25 Mar 2010 14:21:46 GMT'}]",2010-04-26,"[['Dideban', 'Abbas', '', 'GIPSA-lab'], ['Alla', 'Hassane', '', 'GIPSA-lab']]","['Controller Synthesis', 'Discrete event system', 'Forbidden states', 'Petri Nets']"
20110,1002.1782,Matthew Faulkner,"Daniel Golovin, Matthew Faulkner and Andreas Krause",Online Distributed Sensor Selection,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A key problem in sensor networks is to decide which sensors to query when, in
order to obtain the most useful information (e.g., for performing accurate
prediction), subject to constraints (e.g., on power and bandwidth). In many
applications the utility function is not known a priori, must be learned from
data, and can even change over time. Furthermore for large sensor networks
solving a centralized optimization problem to select sensors is not feasible,
and thus we seek a fully distributed solution. In this paper, we present
Distributed Online Greedy (DOG), an efficient, distributed algorithm for
repeatedly selecting sensors online, only receiving feedback about the utility
of the selected sensors. We prove very strong theoretical no-regret guarantees
that apply whenever the (unknown) utility function satisfies a natural
diminishing returns property called submodularity. Our algorithm has extremely
low communication requirements, and scales well to large sensor deployments. We
extend DOG to allow observation-dependent sensor selection. We empirically
demonstrate the effectiveness of our algorithm on several real-world sensing
tasks.
","[{'version': 'v1', 'created': 'Tue, 9 Feb 2010 07:32:59 GMT'}, {'version': 'v2', 'created': 'Wed, 10 Feb 2010 02:34:38 GMT'}, {'version': 'v3', 'created': 'Thu, 13 May 2010 03:32:05 GMT'}]",2010-05-14,"[['Golovin', 'Daniel', ''], ['Faulkner', 'Matthew', ''], ['Krause', 'Andreas', '']]","['Sensor networks', 'approximation algorithms', 'distributed multiarmed bandit algorithms', 'submodular optimization']"
20111,1105.1564,Gerard Briscoe Dr,Gerard Briscoe,Complex Adaptive Digital EcoSystems,"8 pages, 12 figures, conference",,,,cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate an abstract conceptualisation of DigitalEcosystems from a
computer science perspective. We then provide a conceptual framework for the
cross pollination of ideas, concepts and understanding between different
classes of ecosystems through the universally applicable principles of Complex
Adaptive Systems (CAS) modelling. A framework to assist the cross-disciplinary
collaboration of research into Digital Ecosystems, including Digital
BusinessEcosystems (DBEs) and Digital Knowledge Ecosystems (DKEs). So, we have
defined the key steps towards a theoretical framework for Digital Ecosystems,
that is compatible with the diverse theoretical views prevalent. Therefore, a
theoretical edifice that can unify the diverse efforts within Digital
Ecosystems research.
","[{'version': 'v1', 'created': 'Mon, 9 May 2011 01:00:04 GMT'}]",2011-05-10,"[['Briscoe', 'Gerard', '']]","['Complex Adaptive Systemss', 'Multi-Agent Systems', 'Business Ecosystems', 'Knowledge Ecosystems']"
20112,1510.02866,Yilun Wang,"Liangtian He, Yilun Wang","Wavelet Frame Based Image Restoration Using Sparsity, Nonlocal and
  Support Prior of Frame Coefficients",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The wavelet frame systems have been widely investigated and applied for image
restoration and many other image processing problems over the past decades,
attributing to their good capability of sparsely approximating piece-wise
smooth functions such as images. Most wavelet frame based models exploit the
$l_1$ norm of frame coefficients for a sparsity constraint in the past. The
authors in \cite{ZhangY2013, Dong2013} proposed an $l_0$ minimization model,
where the $l_0$ norm of wavelet frame coefficients is penalized instead, and
have demonstrated that significant improvements can be achieved compared to the
commonly used $l_1$ minimization model. Very recently, the authors in
\cite{Chen2015} proposed $l_0$-$l_2$ minimization model, where the nonlocal
prior of frame coefficients is incorporated. This model proved to outperform
the single $l_0$ minimization based model in terms of better recovered image
quality. In this paper, we propose a truncated $l_0$-$l_2$ minimization model
which combines sparsity, nonlocal and support prior of the frame coefficients.
The extensive experiments have shown that the recovery results from the
proposed regularization method performs better than existing state-of-the-art
wavelet frame based methods, in terms of edge enhancement and texture
preserving performance.
","[{'version': 'v1', 'created': 'Sat, 10 Oct 2015 02:52:48 GMT'}]",2015-10-13,"[['He', 'Liangtian', ''], ['Wang', 'Yilun', '']]","['image restoration', 'wavelet frame', 'truncated l0 minimization', 'l0 minimization', 'nonlocal', 'iterative support detection']"
20113,1209.5364,Steffen Lewitzka,Steffen Lewitzka,On some many-valued abstract logics and their Epsilon-T-style extensions,42 pages,,,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Logical systems with classical negation and means for sentential or
propositional self-reference involve, in some way, paradoxical statements such
as the liar. However, the paradox disappears if one replaces classical by an
appropriate non-classical negation such as a paraconsistent one (no paradox
arises if the liar is both true and false). We consider a non-Fregean logic
which is a revised and extended version (Lewitzka 2012) of Epsilon-T-Logic
originally introduced by (Straeter 1992) as a logic with a total truth
predicate and propositional quantifiers. Self-reference is achieved by means of
equations between formulas which are interpreted over a model-theoretic
universe of propositions. Paradoxical statements, such as the liar, can be
asserted only by unsatisfiable equations and do not correlate with
propositions. In this paper, we generalize Epsilon-T-Logic to a four-valued
logic related to Dunn/Belnap logic B_4. We also define three-valued versions
related to Kleene's logic K_3 and Priest's Logic of Paradox P_3, respectively.
In this many-valued setting, models may contain liars and other ""paradoxical""
propositions which are ruled out by the more restrictive classical semantics.
We introduce these many-valued non-Fregean logics as extensions of abstract
parameter logics such that parameter logic and extension are of the same
logical type. For this purpose, we define and study abstract logics of type
B_4, K_3 and P_3. Using semantic methods we show compactness of the consequence
relation of abstract logics of type B_4, give a representation as minimally
generated logics and establish a connection to the approach of (Font 1997).
Finally, we present a complete sequent calculus for the Epsilon-T-style
extension of classical abstract logics simplifying constructions originally
developed by (Straeter 1992, Zeitz 2000, Lewitzka 1998).
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2012 18:49:03 GMT'}]",2012-09-25,"[['Lewitzka', 'Steffen', '']]","['truth theory', 'non-Fregean logic', 'abstract logics', 'Dunn/Belnap Logic', 'Kleene Logic', 'Logic of Paradox', 'De Morgan lattice']"
20114,1205.6229,Md. Selim Reza,"Md. Selim Reza, Mohammed Shafiul Alam Khan, Md. Golam Robiul Alam and
  Serajul Islam","An Approach of Digital Image Copyright Protection by Using Watermarking
  Technology","7 pages, 6 figures. arXiv admin note: text overlap with
  arXiv:1103.3802 by other authors","International Journal of Computer Science Issues, Vol. 9, Issue 2,
  No 2, 2012, pp:280-286",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Digital watermarking system is a paramount for safeguarding valuable
resources and information. Digital watermarks are generally imperceptible to
the human eye and ear. Digital watermark can be used in video, audio and
digital images for a wide variety of applications such as copy prevention right
management, authentication and filtering of internet content. The proposed
system is able to protect copyright or owner identification of digital media,
such as audio, image, video, or text. The system permutated the watermark and
embed the permutated watermark into the wavelet coefficients of the original
image by using a key. The key is randomly generated and used to select the
locations in the wavelet domain in which to embed the permutated watermark.
Finally, the system combines the concept of cryptography and digital
watermarking techniques to implement a more secure digital watermarking system.
","[{'version': 'v1', 'created': 'Mon, 28 May 2012 22:43:22 GMT'}]",2012-05-30,"[['Reza', 'Md. Selim', ''], ['Khan', 'Mohammed Shafiul Alam', ''], ['Alam', 'Md. Golam Robiul', ''], ['Islam', 'Serajul', '']]","['Copyright Protection', 'Digital Watermarking', 'Discrete Wavelet Transform', 'Watermark Extraction']"
20115,1510.03918,Kristina Sojakova,Kristina Sojakova,"The equivalence of the torus and the product of two circles in homotopy
  type theory",,,,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Homotopy type theory is a new branch of mathematics which merges insights
from abstract homotopy theory and higher category theory with those of logic
and type theory. It allows us to represent a variety of mathematical objects as
basic type-theoretic constructions, higher inductive types. We present a proof
that in homotopy type theory, the torus is equivalent to the product of two
circles. This result indicates that the synthetic definition of torus as a
higher inductive type is indeed correct.
","[{'version': 'v1', 'created': 'Tue, 13 Oct 2015 22:38:45 GMT'}]",2015-10-15,"[['Sojakova', 'Kristina', '']]","['homotopy type theory', 'torus', 'unit circle', 'higher inductive type']"
20116,1009.0386,Hussein Al-Bahadili Dr.,Hussein Al-Bahadili and Khalid Kaabneh,Analyzing the performance of probabilistic algorithm in noisy manets,"13 Pages, 13 Figures, Journal","International Journal of Wireless & Mobile Networks (IJWMN),
  Vol.2, No.3, August 2010",,,cs.NI cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Probabilistic broadcast has been widely used as a flooding optimization
mechanism to alleviate the effect of broadcast storm problem (BSP) in mobile ad
hoc networks (MANETs). Many research studies have been carried-out to develop
and evaluate the performance of this mechanism in an error-free (noiseless)
environment. In reality, wireless communication channels in MANETs are an
error-prone and suffer from high packet-loss due to presence of noise, i.e.,
noisy environment. In this paper, we propose a simulation model that can be
used to evaluate the performance of probabilistic broadcast for flooding in
noisy environment. In the proposed model, the noise-level is represented by a
generic name, probability of reception (pc) (0<=pc<=1), where pc=1 for
noiseless and <1 for noisy environment. The effect of noise is determined
randomly by generating a random number \zeta (0<=\zeta<1); if \zeta<=pc means
the packet is successfully delivered to the receiving node, otherwise,
unsuccessful delivery occurs. The proposed model is implemented on a MANET
simulator, namely, MANSim. The effect of noise on the performance of
probabilistic algorithm was investigated in four scenarios. The main
conclusions of these scenarios are: the performance of probabilistic algorithm
suffers in presence of noise. However, this suffering is less in high density
networks, or if the nodes characterized by high retransmission probability or
large radio transmission range. The nodes' speed has no or insignificant effect
on the performance.
","[{'version': 'v1', 'created': 'Thu, 2 Sep 2010 10:51:33 GMT'}]",2010-09-03,"[['Al-Bahadili', 'Hussein', ''], ['Kaabneh', 'Khalid', '']]","['MANETs', 'routing protocols', 'flooding broadcast', 'flooding optimization techniques', 'probabilistic broadcast']"
20117,1410.3735,Adam Petcher,Adam Petcher and Greg Morrisett,The Foundational Cryptography Framework,,,,,cs.PL cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present the Foundational Cryptography Framework (FCF) for developing and
checking complete proofs of security for cryptographic schemes within a proof
assistant. This is a general-purpose framework that is capable of modeling and
reasoning about a wide range of cryptographic schemes, security definitions,
and assumptions. Security is proven in the computational model, and the proof
provides concrete bounds as well as asymptotic conclusions. FCF provides a
language for probabilistic programs, a theory that is used to reason about
programs, and a library of tactics and definitions that are useful in proofs
about cryptography. The framework is designed to leverage fully the existing
theory and capabilities of the Coq proof assistant in order to reduce the
effort required to develop proofs.
","[{'version': 'v1', 'created': 'Tue, 14 Oct 2014 15:34:39 GMT'}]",2014-10-15,"[['Petcher', 'Adam', ''], ['Morrisett', 'Greg', '']]","['Cryptography', 'Proof Assistant', 'Mechanized Proof', 'Coq']"
20118,1401.0247,Yingyu Liang,"Maria-Florina Balcan, Yingyu Liang, Pramod Gupta",Robust Hierarchical Clustering,37 pages,,,,cs.LG cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the most widely used techniques for data clustering is agglomerative
clustering. Such algorithms have been long used across many different fields
ranging from computational biology to social sciences to computer vision in
part because their output is easy to interpret. Unfortunately, it is well
known, however, that many of the classic agglomerative clustering algorithms
are not robust to noise. In this paper we propose and analyze a new robust
algorithm for bottom-up agglomerative clustering. We show that our algorithm
can be used to cluster accurately in cases where the data satisfies a number of
natural properties and where the traditional agglomerative algorithms fail. We
also show how to adapt our algorithm to the inductive setting where our given
data is only a small random sample of the entire data set. Experimental
evaluations on synthetic and real world data sets show that our algorithm
achieves better performance than other hierarchical algorithms in the presence
of noise.
","[{'version': 'v1', 'created': 'Wed, 1 Jan 2014 04:16:21 GMT'}, {'version': 'v2', 'created': 'Sun, 13 Jul 2014 01:51:05 GMT'}]",2014-07-15,"[['Balcan', 'Maria-Florina', ''], ['Liang', 'Yingyu', ''], ['Gupta', 'Pramod', '']]","['Unsupervised Learning', 'Clustering', 'Agglomerative Algorithms', 'Robustness']"
20119,1406.4737,Sanjay Chakraborty,Sanjay Chakraborty and N.K. Nagwani,Performance Evaluation of Incremental K-means Clustering Algorithm,,,,,cs.IR cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The incremental K-means clustering algorithm has already been proposed and
analysed in paper [Chakraborty and Nagwani, 2011]. It is a very innovative
approach which is applicable in periodically incremental environment and
dealing with a bulk of updates. In this paper the performance evaluation is
done for this incremental K-means clustering algorithm using air pollution
database. This paper also describes the comparison on the performance
evaluations between existing K-means clustering and incremental K-means
clustering using that particular database. It also evaluates that the
particular point of change in the database upto which incremental K-means
clustering performs much better than the existing K-means clustering. That
particular point of change in the database is known as ""Threshold value"" or ""%
delta change in the database"". This paper also defines the basic methodology
for the incremental K-means clustering algorithm.
","[{'version': 'v1', 'created': 'Wed, 18 Jun 2014 14:34:18 GMT'}]",2014-06-19,"[['Chakraborty', 'Sanjay', ''], ['Nagwani', 'N. K.', '']]","['Air-pollution', 'Clustering', 'Incremental', 'Kmeans', 'Threshold']"
20120,1603.03475,Robert Kent,Robert E. Kent,Information Flow in Logical Environments,This paper was completed in 2008,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes information flow within logical environments. The theory
of information flow, the logic of distributed systems, was first defined by
Barwise and Seligman (Information Flow: The Logic of Distributed Systems.
1997). Logical environments are a semantic-oriented version of institutions.
The theory of institutions, which was initiated by Goguen and Burstall
(Institutions: Abstract Model Theory for Specification and Programming. 1992),
is abstract model theory. Information flow is the flow of information in
channels over distributed systems. The semantic integration of distributed
systems, be they ontologies, databases or other information resources, can be
defined in terms of the channel theory of information flow. As originally
defined, the theory of information flow uses only a specific logical
environment in order to discuss information flow. This paper shows how
information flow can be defined in an arbitrary logical environment.
","[{'version': 'v1', 'created': 'Thu, 10 Mar 2016 22:12:34 GMT'}]",2016-03-14,"[['Kent', 'Robert E.', '']]","['information flow', 'logical environment', 'distributed systems', 'channel', 'core', 'information integration', 'structure', 'theory and logic']"
20121,1402.4388,Mohammed  Javed,"Mohammed Javed, P. Nagabhushan, B.B. Chaudhuri","Automatic Detection of Font Size Straight from Run Length Compressed
  Text Documents",8 Pages,"(IJCSIT) International Journal of Computer Science and Information
  Technologies, Vol. 5 (1) , 2014, 818-825",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Automatic detection of font size finds many applications in the area of
intelligent OCRing and document image analysis, which has been traditionally
practiced over uncompressed documents, although in real life the documents
exist in compressed form for efficient storage and transmission. It would be
novel and intelligent if the task of font size detection could be carried out
directly from the compressed data of these documents without decompressing,
which would result in saving of considerable amount of processing time and
space. Therefore, in this paper we present a novel idea of learning and
detecting font size directly from run-length compressed text documents at line
level using simple line height features, which paves the way for intelligent
OCRing and document analysis directly from compressed documents. In the
proposed model, the given mixed-case text documents of different font size are
segmented into compressed text lines and the features extracted such as line
height and ascender height are used to capture the pattern of font size in the
form of a regression line, using which the automatic detection of font size is
done during the recognition stage. The method is experimented with a dataset of
50 compressed documents consisting of 780 text lines of single font size and
375 text lines of mixed font size resulting in an overall accuracy of 99.67%.
","[{'version': 'v1', 'created': 'Tue, 18 Feb 2014 16:30:59 GMT'}]",2014-02-19,"[['Javed', 'Mohammed', ''], ['Nagabhushan', 'P.', ''], ['Chaudhuri', 'B. B.', '']]","['Compressed Document Segmentation', 'Text Line Feature Extraction', 'Text Line Font Size Detection', 'Compressed Document OCR', 'Compressed Data Processing']"
20122,1401.3127,Marco Mondelli,"Marco Mondelli, S. Hamed Hassani, and R\""udiger Urbanke","From Polar to Reed-Muller Codes: a Technique to Improve the
  Finite-Length Performance","8 pages, 7 figures, in IEEE Transactions on Communications, 2014 and
  in ISIT'14",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We explore the relationship between polar and RM codes and we describe a
coding scheme which improves upon the performance of the standard polar code at
practical block lengths. Our starting point is the experimental observation
that RM codes have a smaller error probability than polar codes under MAP
decoding. This motivates us to introduce a family of codes that ""interpolates""
between RM and polar codes, call this family ${\mathcal C}_{\rm inter} =
\{C_{\alpha} : \alpha \in [0, 1]\}$, where $C_{\alpha} \big |_{\alpha = 1}$ is
the original polar code, and $C_{\alpha} \big |_{\alpha = 0}$ is an RM code.
Based on numerical observations, we remark that the error probability under MAP
decoding is an increasing function of $\alpha$. MAP decoding has in general
exponential complexity, but empirically the performance of polar codes at
finite block lengths is boosted by moving along the family ${\mathcal C}_{\rm
inter}$ even under low-complexity decoding schemes such as, for instance,
belief propagation or successive cancellation list decoder. We demonstrate the
performance gain via numerical simulations for transmission over the erasure
channel as well as the Gaussian channel.
","[{'version': 'v1', 'created': 'Tue, 14 Jan 2014 10:29:44 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Apr 2014 15:00:54 GMT'}, {'version': 'v3', 'created': 'Wed, 3 Sep 2014 18:57:01 GMT'}]",2014-09-04,"[['Mondelli', 'Marco', ''], ['Hassani', 'S. Hamed', ''], ['Urbanke', 'Rüdiger', '']]","['Polar codes', 'RM codes', 'MAP decoding', 'SC decoding', 'list decoding']"
20123,1209.4576,Antoine Girard,Antoine Girard,"Low-Complexity Quantized Switching Controllers using Approximate
  Bisimulation",,,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we consider the problem of synthesizing low-complexity
controllers for incrementally stable switched systems. For that purpose, we
establish a new approximation result for the computation of symbolic models
that are approximately bisimilar to a given switched system. The main advantage
over existing results is that it allows us to design naturally quantized
switching controllers for safety or reachability specifications; these can be
pre-computed offline and therefore the online execution time is reduced. Then,
we present a technique to reduce the memory needed to store the control law by
borrowing ideas from algebraic decision diagrams for compact function
representation and by exploiting the non-determinism of the synthesized
controllers. We show the merits of our approach by applying it to a simple
model of temperature regulation in a building.
","[{'version': 'v1', 'created': 'Thu, 20 Sep 2012 16:11:28 GMT'}, {'version': 'v2', 'created': 'Sat, 9 Feb 2013 14:07:48 GMT'}]",2013-02-12,"[['Girard', 'Antoine', '']]","['Switched systems', 'Symbolic models', 'Approximate bisimulation', 'Controller synthesis']"
20124,1212.1037,Tushar Rao Mr.,Tushar Rao (NSIT-Delhi) and Saket Srivastava (IIIT-Delhi),"Modeling Movements in Oil, Gold, Forex and Market Indices using Search
  Volume Index and Twitter Sentiments","10 pages, 4 figures, 9 Tables",,,IIITD-TR-2012-005,cs.CE cs.SI q-fin.GN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Study of the forecasting models using large scale microblog discussions and
the search behavior data can provide a good insight for better understanding
the market movements. In this work we collected a dataset of 2 million tweets
and search volume index (SVI from Google) for a period of June 2010 to
September 2011. We perform a study over a set of comprehensive causative
relationships and developed a unified approach to a model for various market
securities like equity (Dow Jones Industrial Average-DJIA and NASDAQ-100),
commodity markets (oil and gold) and Euro Forex rates. We also investigate the
lagged and statistically causative relations of Twitter sentiments developed
during active trading days and market inactive days in combination with the
search behavior of public before any change in the prices/ indices. Our results
show extent of lagged significance with high correlation value upto 0.82
between search volumes and gold price in USD. We find weekly accuracy in
direction (up and down prediction) uptil 94.3% for DJIA and 90% for NASDAQ-100
with significant reduction in mean average percentage error for all the
forecasting models.
","[{'version': 'v1', 'created': 'Wed, 5 Dec 2012 14:28:40 GMT'}]",2012-12-06,"[['Rao', 'Tushar', '', 'NSIT-Delhi'], ['Srivastava', 'Saket', '', 'IIIT-Delhi']]","['Stock market', 'sentiment analysis', 'Twitter', 'microblogging', 'social network analysis', 'oil', 'gold', 'Forex']"
20125,1307.1385,Uwe Aickelin,"Ian Dent, Christian Wagner, Uwe Aickelin, Tom Rodden","Creating Personalised Energy Plans. From Groups to Individuals using
  Fuzzy C Means Clustering","Digital Engagement 11, Newcastle, November 2011",,,,cs.CE cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Changes in the UK electricity market mean that domestic users will be
required to modify their usage behaviour in order that supplies can be
maintained. Clustering allows usage profiles collected at the household level
to be clustered into groups and assigned a stereotypical profile which can be
used to target marketing campaigns. Fuzzy C Means clustering extends this by
allowing each household to be a member of many groups and hence provides the
opportunity to make personalised offers to the household dependent on their
degree of membership of each group. In addition, feedback can be provided on
how user's changing behaviour is moving them towards more ""green"" or cost
effective stereotypical usage.
","[{'version': 'v1', 'created': 'Thu, 4 Jul 2013 15:55:33 GMT'}]",2013-07-05,"[['Dent', 'Ian', ''], ['Wagner', 'Christian', ''], ['Aickelin', 'Uwe', ''], ['Rodden', 'Tom', '']]","['Electricity load profiles', 'Clustering', 'Fuzzy C Means', 'DemandSide Management']"
20126,1401.0494,Minyar Sassi,"Ines Benali-Sougui, Minyar Sassi-Hidri, Amel Grissa-Touzi",Flexible SQLf query based on fuzzy linguistic summaries,,"International Conference on Control, Engineering & Information
  Technology (CEIT), Proceedings Engineering & Technology, Vol. 1, pp. 175-180,
  2013",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data is often partially known, vague or ambiguous in many real world
applications. To deal with such imprecise information, fuzziness is introduced
in the classical model. SQLf is one of the practical language to deal with
flexible fuzzy querying in Fuzzy DataBases (FDB). However, with a huge amount
of fuzzy data, the necessity to work with synthetic views became a challenge
for many DB community researchers. The present work deals with Flexible SQLf
query based on fuzzy linguistic summaries. We use the fuzzy summaries produced
by our Fuzzy-SaintEtiq approach. It provides a description of objects depending
on the fuzzy linguistic labels specified as selection criteria.
","[{'version': 'v1', 'created': 'Thu, 2 Jan 2014 18:14:33 GMT'}]",2014-01-03,"[['Benali-Sougui', 'Ines', ''], ['Sassi-Hidri', 'Minyar', ''], ['Grissa-Touzi', 'Amel', '']]","['Fuzzy relational databases', 'Flexible querying', 'Datasummarization', 'SQLf', 'Top k query', 'Fuzzy FCA']"
20127,0803.1520,Wenbing Zhao,Wenbing Zhao,"Integrity-Enhancing Replica Coordination for Byzantine Fault Tolerant
  Systems",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Strong replica consistency is often achieved by writing deterministic
applications, or by using a variety of mechanisms to render replicas
deterministic. There exists a large body of work on how to render replicas
deterministic under the benign fault model. However, when replicas can be
subject to malicious faults, most of the previous work is no longer effective.
Furthermore, the determinism of the replicas is often considered harmful from
the security perspective and for many applications, their integrity strongly
depends on the randomness of some of their internal operations. This calls for
new approaches towards achieving replica consistency while preserving the
replica randomness. In this paper, we present two such approaches. One is based
on Byzantine agreement and the other on threshold coin-tossing. Each approach
has its strength and weaknesses. We compare the performance of the two
approaches and outline their respective best use scenarios.
","[{'version': 'v1', 'created': 'Tue, 11 Mar 2008 04:20:06 GMT'}]",2008-03-12,"[['Zhao', 'Wenbing', '']]","['Replica Consistency', 'Byzantine Fault Tolerance', 'Middleware', 'Threshold Signature', 'Coin-Tossing']"
20128,1109.0077,Sheikh Shanawaz Mostafa,"Sheikh Shanawaz Mostafa, Md. Mahbub Hossian, Khondker Jahid Reza and
  Gazi Maniur Rashid","A Radio Based Intelligent Railway Grade Crossing System to Avoid
  Collision","5 pages,4 figures, International Journal of Computer Science Issues,
  Vol. 7, Issue 6, November 2010",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Railway grade crossing is become the major headache for the transportation
system. This paper describes an intelligent railway crossing control system for
multiple tracks that features a controller which receives messages from
incoming and outgoing trains by sensors. These messages contain detail
information including the direction and identity of a train. Depending on those
messages the controller device decides whenever the railroad crossing gate will
close or open.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2011 03:18:32 GMT'}]",2011-09-02,"[['Mostafa', 'Sheikh Shanawaz', ''], ['Hossian', 'Md. Mahbub', ''], ['Reza', 'Khondker Jahid', ''], ['Rashid', 'Gazi Maniur', '']]","['Grade crossing', 'intelligent system', 'messages', 'multiple tracks', 'sensors']"
20129,0711.2115,Michel Grabisch,"Michel Grabisch (CES), Christophe Labreuche (TRT)","Derivative of functions over lattices as a basis for the notion of
  interaction between attributes",,"Annals of Mathematics and Artificial Intelligence 49 (2007)
  151-170",,,cs.DM cs.GT,,"  The paper proposes a general notion of interaction between attributes, which
can be applied to many fields in decision making and data analysis. It
generalizes the notion of interaction defined for criteria modelled by
capacities, by considering functions defined on lattices. For a given problem,
the lattice contains for each attribute the partially ordered set of remarkable
points or levels. The interaction is based on the notion of derivative of a
function defined on a lattice, and appears as a generalization of the Shapley
value or other probabilistic values.
","[{'version': 'v1', 'created': 'Wed, 14 Nov 2007 06:15:49 GMT'}]",2007-11-15,"[['Grabisch', 'Michel', '', 'CES'], ['Labreuche', 'Christophe', '', 'TRT']]","['interaction index', 'Shapley value', 'capacity', 'game', 'lattice', 'discrete derivative']"
20130,0707.4304,Alejandro Vaisman Prof.,"Leticia Gomez, Sofie Haesevoets, Bart Kuijpers and Alejandro Vaisman",Spatial Aggregation: Data Model and Implementation,"56 pages, 28 figures",,,,cs.DB,,"  Data aggregation in Geographic Information Systems (GIS) is only marginally
present in commercial systems nowadays, mostly through ad-hoc solutions. In
this paper, we first present a formal model for representing spatial data. This
model integrates geographic data and information contained in data warehouses
external to the GIS. We define the notion of geometric aggregation, a general
framework for aggregate queries in a GIS setting. We also identify the class of
summable queries, which can be efficiently evaluated by precomputing the
overlay of two or more of the thematic layers involved in the query. We also
sketch a language, denoted GISOLAP-QL, for expressing queries that involve GIS
and OLAP features. In addition, we introduce Piet, an implementation of our
proposal, that makes use of overlay precomputation for answering spatial
queries (aggregate or not). Our experimental evaluation showed that for a
certain class of geometric queries with or without aggregation, overlay
precomputation outperforms R-tree-based techniques. Finally, as a particular
application of our proposal, we study topological queries.
","[{'version': 'v1', 'created': 'Sun, 29 Jul 2007 21:46:50 GMT'}]",2007-07-31,"[['Gomez', 'Leticia', ''], ['Haesevoets', 'Sofie', ''], ['Kuijpers', 'Bart', ''], ['Vaisman', 'Alejandro', '']]","['OLAP', 'GIS', 'Aggregation']"
20131,1710.02939,Faxian Cao,"Faxian Cao, Zhijing Yang, Jinchang Ren, Mengying Jiang, Wing-Kuen Ling","Does Normalization Methods Play a Role for Hyperspectral Image
  Classification?","6 pages. 1 figure, 4 tables",,,,cs.CV,http://creativecommons.org/licenses/by/4.0/,"  For Hyperspectral image (HSI) datasets, each class have their salient feature
and classifiers classify HSI datasets according to the class's saliency
features, however, there will be different salient features when use different
normalization method. In this letter, we report the effect on classifiers by
different normalization methods and recommend the best normalization methods
for classifier after analyzing the impact of different normalization methods on
classifiers. Pavia University datasets, Indian Pines datasets and Kennedy Space
Center datasets will apply to several typical classifiers in order to evaluate
and analysis the impact of different normalization methods on typical
classifiers.
","[{'version': 'v1', 'created': 'Mon, 9 Oct 2017 05:08:32 GMT'}]",2017-10-10,"[['Cao', 'Faxian', ''], ['Yang', 'Zhijing', ''], ['Ren', 'Jinchang', ''], ['Jiang', 'Mengying', ''], ['Ling', 'Wing-Kuen', '']]","['Hyperspectral Image (HIS)', 'normalization', 'classifiers', 'impact']"
20132,0709.2635,Greg Kohring,G.A. Kohring and L. Lo Iacono,Non-Blocking Signature of very large SOAP Messages,"13 pages, 5 figures","in H.-G. Hegering, A. Lehmann, H.J. Ohlbach and C. Scheideler,
  eds., INFORMATIK 2008, Beherrschbare Systeme - dank Informatik (Koellen Druck
  & Verlag GmbH, Bonn, 2008).",,,cs.DC,,"  Data transfer and staging services are common components in Grid-based, or
more generally, in service-oriented applications. Security mechanisms play a
central role in such services, especially when they are deployed in sensitive
application fields like e-health. The adoption of WS-Security and related
standards to SOAP-based transfer services is, however, problematic as a
straightforward adoption of SOAP with MTOM introduces considerable
inefficiencies in the signature generation process when large data sets are
involved. This paper proposes a non-blocking, signature generation approach
enabling a stream-like processing with considerable performance enhancements.
","[{'version': 'v1', 'created': 'Mon, 17 Sep 2007 13:50:42 GMT'}]",2009-04-01,"[['Kohring', 'G. A.', ''], ['Iacono', 'L. Lo', '']]","['SOAP', 'WS-Security', 'MTOM', 'Digital Signature']"
20133,1307.0642,Firas Ajil Jassim,Firas A. Jassim,"A Novel Steganography Algorithm for Hiding Text in Image using Five
  Modulus Method",,"International Journal of Computer Applications, Vol.72, No.17, pp.
  39-44, June 2013",,,cs.MM cs.CR,http://creativecommons.org/licenses/by/3.0/,"  The needs for steganographic techniques for hiding secret message inside
images have been arise. This paper is to create a practical steganographic
implementation to hide text inside grey scale images. The secret message is
hidden inside the cover image using Five Modulus Method. The novel algorithm is
called (ST-FMM. FMM which consists of transforming all the pixels within the
5X5 window size into its corresponding multiples of 5. After that, the secret
message is hidden inside the 5X5 window as a non-multiples of 5. Since the
modulus of non-multiples of 5 are 1,2,3 and 4, therefore; if the reminder is
one of these, then this pixel represents a secret character. The secret key
that has to be sent is the window size. The main advantage of this novel
algorithm is to keep the size of the cover image constant while the secret
message increased in size. Peak signal-to-noise ratio is captured for each of
the images tested. Based on the PSNR value of each images, the stego image has
high PSNR value. Hence this new steganography algorithm is very efficient to
hide the data inside the image.
","[{'version': 'v1', 'created': 'Tue, 2 Jul 2013 09:33:43 GMT'}]",2013-07-03,"[['Jassim', 'Firas A.', '']]","['Image processing', 'steganography', 'information hiding', 'five modulus method']"
20134,1307.5710,Lucas Paletta,"Jan T\""unnermann, Dieter Enns, and B\""arbel Mertsching","Saliency-Guided Perceptual Grouping Using Motion Cues in Region-Based
  Artificial Visual Attention",,,,ISACS/2013/05,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Region-based artificial attention constitutes a framework for bio-inspired
attentional processes on an intermediate abstraction level for the use in
computer vision and mobile robotics. Segmentation algorithms produce regions of
coherently colored pixels. These serve as proto-objects on which the
attentional processes determine image portions of relevance. A single
region---which not necessarily represents a full object---constitutes the focus
of attention. For many post-attentional tasks, however, such as identifying or
tracking objects, single segments are not sufficient. Here, we present a
saliency-guided approach that groups regions that potentially belong to the
same object based on proximity and similarity of motion. We compare our results
to object selection by thresholding saliency maps and a further
attention-guided strategy.
","[{'version': 'v1', 'created': 'Mon, 22 Jul 2013 13:48:13 GMT'}]",2013-07-23,"[['T\x7fünnermann', 'Jan', ''], ['Enns', 'Dieter', ''], ['Mertsching', 'B\x7färbel', '']]","['Artificial attention', 'region-based saliency', 'motion saliency', 'proto-objects']"
20135,1402.2376,Reena Philips Mrs,"Sangita Gupta, Suma V","Prediction of Human Performance Capability during Software Development
  using Classification","7 Pages, 1 Figure",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The quality of human capital is crucial for software companies to maintain
competitive advantages in knowledge economy era. Software companies recognize
superior talent as a business advantage. They increasingly recognize the
critical linkage between effective talent and business success. However,
software companies suffering from high turnover rates often find it hard to
recruit the right talents. There is an urgent need to develop a personnel
selection mechanism to find the talents who are the most suitable for their
software projects. Data mining techniques assures exploring the information
from the historical projects depending on which the project manager can make
decisions for producing high quality software. This study aims to fill the gap
by developing a data mining framework based on decision tree and association
rules to refocus on criteria for personnel selection. An empirical study was
conducted in a software company to support their hiring decision for project
members. The results demonstrated that there is a need to refocus on selection
criteria for quality objectives. Better selection criteria was identified by
patterns obtained from data mining models by integrating knowledge from
software project database and authors research techniques.
","[{'version': 'v1', 'created': 'Tue, 11 Feb 2014 05:30:26 GMT'}]",2014-02-12,"[['Gupta', 'Sangita', ''], ['V', 'Suma', '']]","['software projects', 'data mining', 'selection criteria', 'performance']"
20136,1409.7047,Tiance Wang,"Tiance Wang, Pan Hui, Sanjeev Kulkarni, Paul Cuff","Cooperative Caching based on File Popularity Ranking in Delay Tolerant
  Networks","6 pages, 2 figures, ExtremeCom 2012",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Increasing storage sizes and WiFi/Bluetooth capabilities of mobile devices
have made them a good platform for opportunistic content sharing. In this work
we propose a network model to study this in a setting with two characteristics:
1. delay tolerant; 2. lack of infrastructure. Mobile users generate requests
and opportunistically download from other users they meet, via Bluetooth or
WiFi. The difference in popularity of different web content induces a
non-uniform request distribution, which is usually a Zipf's law distribution.
We evaluate the performance of different caching schemes and derive the optimal
scheme using convex optimization techniques. The optimal solution is found
efficiently using a binary search method. It is shown that as the network
mobility increases, the performance of the optimal scheme far exceeds the
traditional caching scheme. To the best of our knowledge, our work is the first
to consider popularity ranking in performance evaluation.
","[{'version': 'v1', 'created': 'Wed, 24 Sep 2014 19:36:43 GMT'}]",2014-09-25,"[['Wang', 'Tiance', ''], ['Hui', 'Pan', ''], ['Kulkarni', 'Sanjeev', ''], ['Cuff', 'Paul', '']]","['Cooperative Caching', 'Delay Tolerant Networks', 'Ranking', 'Mobile data offloading']"
20137,1410.3673,Chengwen  Xing,"Chengwen Xing, Zesong Fei, Yiqing Zhou, Zhengang Pan, Hualei Wang","Transceiver designs with matrix-version water-filling architecture under
  mixed power constraints","13 Pages, 6 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we investigate the multiple-input multiple-output (MIMO)
transceiver design under an interesting power model named mixed power
constraints. In the considered power model, several antenna subsets are
constrained by sum power constraints while the other antennas are subject to
per-antenna power constraints. This kind of transceiver designs includes both
the transceiver designs under sum power constraint and per-antenna power
constraint as its special cases. This kind of designs is of critical importance
for distributed antenna systems (DASs) with heterogeneous remote radio heads
(RRHs) such as cloud radio access networks (C-RANs). In our work, we try to
solve the optimization problem in an analytical way instead of using some
famous software packages e.g., CVX or SeDuMi. In our work, to strike tradeoffs
between performance and complexity, both iterative and non-iterative solutions
are proposed. Interestingly the non-iterative solution can be interpreted as a
matrix version water-filling solution extended from the well-known and
extensively studied vector version. Finally, simulation results demonstrate the
accuracy of our theoretical results.
","[{'version': 'v1', 'created': 'Tue, 14 Oct 2014 12:44:39 GMT'}, {'version': 'v2', 'created': 'Fri, 21 Nov 2014 13:19:55 GMT'}, {'version': 'v3', 'created': 'Thu, 4 Dec 2014 15:47:31 GMT'}, {'version': 'v4', 'created': 'Sun, 23 Aug 2015 03:22:12 GMT'}]",2015-08-25,"[['Xing', 'Chengwen', ''], ['Fei', 'Zesong', ''], ['Zhou', 'Yiqing', ''], ['Pan', 'Zhengang', ''], ['Wang', 'Hualei', '']]","['Convex optimization', 'MIMO', 'matrix-version water-filling', 'transceiver designs', 'mix power constraints']"
20138,1705.08539,Daniel Gerbner,"D\'aniel Gerbner, M\'at\'e Vizer","Conscious and controlling elements in combinatorial group testing
  problems with more defectives",,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In combinatorial group testing problems Questioner needs to find a defective
element $x\in [n]$ by testing subsets of $[n]$. In [18] the authors introduced
a new model, where each element knows the answer for those queries that contain
it and each element should be able to identify the defective one. In this
article we continue to investigate this kind of models with more defective
elements. We also consider related models inspired by secret sharing models,
where the elements should share information among them to find out the
defectives. Finally the adaptive versions of the different models are also
investigated.
","[{'version': 'v1', 'created': 'Tue, 23 May 2017 21:20:45 GMT'}]",2017-05-25,"[['Gerbner', 'Dániel', ''], ['Vizer', 'Máté', '']]","['Combinatorial Group Testing', 'defectives', 'cancellative']"
20139,1109.1420,Paul Bone,"Paul Bone, Zoltan Somogyi and Peter Schachte","Estimating the overlap between dependent computations for automatic
  parallelization",,"Theory and Practice of Logic Programming, 27th Int'l. Conference
  on Logic Programming (ICLP'11) Special Issue, volume 11, issue 4-5, pages
  575-587. July 2011",,,cs.PL cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Researchers working on the automatic parallelization of programs have long
known that too much parallelism can be even worse for performance than too
little, because spawning a task to be run on another CPU incurs overheads.
Autoparallelizing compilers have therefore long tried to use granularity
analysis to ensure that they only spawn off computations whose cost will
probably exceed the spawn-off cost by a comfortable margin. However, this is
not enough to yield good results, because data dependencies may \emph{also}
limit the usefulness of running computations in parallel. If one computation
blocks almost immediately and can resume only after another has completed its
work, then the cost of parallelization again exceeds the benefit.
  We present a set of algorithms for recognizing places in a program where it
is worthwhile to execute two or more computations in parallel that pay
attention to the second of these issues as well as the first. Our system uses
profiling information to compute the times at which a procedure call consumes
the values of its input arguments and the times at which it produces the values
of its output arguments. Given two calls that may be executed in parallel, our
system uses the times of production and consumption of the variables they share
to determine how much their executions would overlap if they were run in
parallel, and therefore whether executing them in parallel is a good idea or
not.
  We have implemented this technique for Mercury in the form of a tool that
uses profiling data to generate recommendations about what to parallelize, for
the Mercury compiler to apply on the next compilation of the program. We
present preliminary results that show that this technique can yield useful
parallelization speedups, while requiring nothing more from the programmer than
representative input data for the profiling run.
","[{'version': 'v1', 'created': 'Wed, 7 Sep 2011 11:19:55 GMT'}]",2011-09-08,"[['Bone', 'Paul', ''], ['Somogyi', 'Zoltan', ''], ['Schachte', 'Peter', '']]","['automatic parallelism', 'program analysis', 'program optimization', 'Mercury']"
20140,1403.0879,Juan Pablo Carbajal,"Harold Roberto Martinez Salazar and Juan Pablo Carbajal and Yuri P.
  Ivanenko","Robustness: a new SLIP model based criterion for gait transitions in
  bipedal locomotion","unpublished, in preparation",,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bipedal locomotion is a phenomenon that still eludes a fundamental and
concise mathematical understanding. Conceptual models that capture some
relevant aspects of the process exist but their full explanatory power is not
yet exhausted. In the current study, we introduce the robustness criterion
which defines the conditions for stable locomotion when steps are taken with
imprecise angle of attack. Intuitively, the necessity of a higher precision
indicates the difficulty to continue moving with a given gait. We show that the
spring-loaded inverted pendulum model, under the robustness criterion, is
consistent with previously reported findings on attentional demand during human
locomotion. This criterion allows transitions between running and walking, many
of which conserve forward speed. Simulations of transitions predict Froude
numbers below the ones observed in humans, nevertheless the model
satisfactorily reproduces several biomechanical indicators such as hip
excursion, gait duty factor and vertical ground reaction force profiles.
Furthermore, we identify reversible robust walk-run transitions, which allow
the system to execute a robust version of the hopping gait. These findings
foster the spring-loaded inverted pendulum model as the unifying framework for
the understanding of bipedal locomotion.
","[{'version': 'v1', 'created': 'Tue, 4 Mar 2014 18:26:02 GMT'}]",2014-03-05,"[['Salazar', 'Harold Roberto Martinez', ''], ['Carbajal', 'Juan Pablo', ''], ['Ivanenko', 'Yuri P.', '']]","['SLIP model', 'gait transitions', 'bipedal locomotion', 'human loco']"
20141,1603.06732,Xiaowang Zhang,"Zhenyu Song and Zhiyong Feng and Xiaowang Zhang and Xin Wang and
  Guozheng Rao",Efficient Approximation of Well-Designed SPARQL Queries,6 pages,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Query response time often influences user experience in the real world.
However, it possibly takes more time to answer a query with its all exact
solutions, especially when it contains the OPT operations since the OPT
operation is the least conventional operator in SPARQL. So it becomes essential
to make a trade-off between the query response time and the accuracy of their
solutions. In this paper, based on the depth of the OPT operation occurring in
a query, we propose an approach to obtain its all approximate queries with less
depth of the OPT operation. This paper mainly discusses those queries with
well-designed patterns since the OPT operation in a well-designed pattern is
really ""optional"". Firstly, we transform a well-designed pattern in OPT normal
form into a well-designed tree, whose inner nodes are labeled by OPT operation
and leaf nodes are labeled by patterns containing other operations such as the
AND operation and the FILTER operation. Secondly, based on this well-designed
tree, we remove ""optional"" well-designed subtrees with less depth of the OPT
operation and then obtain approximate queries with different depths of the OPT
operation. Finally, we evaluate the approximate query efficiency with the
degree of approximation.
","[{'version': 'v1', 'created': 'Tue, 22 Mar 2016 10:51:01 GMT'}]",2016-03-23,"[['Song', 'Zhenyu', ''], ['Feng', 'Zhiyong', ''], ['Zhang', 'Xiaowang', ''], ['Wang', 'Xin', ''], ['Rao', 'Guozheng', '']]","['Semantic Web', 'RDF', 'SPARQL', 'Well-designed patterns', 'Approximate queries']"
20142,1008.3863,Carlos A. Romero-Diaz,Mario Rodr\'iguez-Artalejo and Carlos A. Romero-D\'iaz,A Generic Scheme for Qualified Logic Programming,"23 pages, extended version with full proofs of Quantitative Logic
  Programming Revisited, in J. Garrigue and M. Hermenegildo (Eds.), FLOPS 2008,
  LNCS 4989, pp. 272-288, 2008. Springer-Verlag Berlin Heidelberg 2008",,,SIC-1-08,cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Uncertainty in Logic Programming has been investigated since about 25 years,
publishing papers dealing with various approaches to semantics and different
applications. This report is intended as a first step towards the investigation
of qualified computations in Constraint Functional Logic Programming, including
uncertain computations as a particular case. We revise an early proposal,
namely van Emden's Quantitative Logic Programming, and we improve it in two
ways. Firstly, we generalize van Emden's QLP to a generic scheme QLP(D)
parameterized by any given Qualification Domain D, which must be a lattice
satisfying certain natural axioms. We present several interesting instances for
D, one of which corresponds to van Emden's QLP. Secondly, we generalize van
Emden's results by providing stronger ones, concerning both semantics and goal
solving. We present Qualified SLD Resolution over D, a sound and strongly
complete goal solving procedure for QLP(D), which is applicable to open goals
and can be efficiently implemented using CLP technology over any constraint
domain CD able to deal with qualification constraints over D. We have developed
a prototype implementation of some instances of the QLP(D) scheme (including
van Emden's QLP) on top of the CFLP system TOY.
","[{'version': 'v1', 'created': 'Mon, 23 Aug 2010 17:19:52 GMT'}]",2010-08-24,"[['Rodríguez-Artalejo', 'Mario', ''], ['Romero-Díaz', 'Carlos A.', '']]","['Quantitative Logic Programming', 'Qualification Domains', 'Qualification Constraints']"
20143,1604.08799,Chung-Hyok Jang,"Pak Song-Ho, Pak Myong-Suk, Jang Chung-Hyok","A method to Implement the Kerberos User Authentication and the secured
  Internet Service",7 pages,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a PKINIT_AS Kerberos V5 authentication system to use
public key cryptography and a method to implement the gssapi_krb authentication
method and secured Internet service using it in IPSec VPN
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2016 12:37:48 GMT'}]",2016-05-02,"[['Song-Ho', 'Pak', ''], ['Myong-Suk', 'Pak', ''], ['Chung-Hyok', 'Jang', '']]","['IPSec', 'VPN', 'Kerberos', 'Squid', 'GSSAPI']"
20144,1701.07114,Nayyar Zaidi,"Nayyar A. Zaidi, Yang Du, Geoffrey I. Webb","On the Effectiveness of Discretizing Quantitative Attributes in Linear
  Classifiers",,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning algorithms that learn linear models often have high representation
bias on real-world problems. In this paper, we show that this representation
bias can be greatly reduced by discretization. Discretization is a common
procedure in machine learning that is used to convert a quantitative attribute
into a qualitative one. It is often motivated by the limitation of some
learners to qualitative data. Discretization loses information, as fewer
distinctions between instances are possible using discretized data relative to
undiscretized data. In consequence, where discretization is not essential, it
might appear desirable to avoid it. However, it has been shown that
discretization often substantially reduces the error of the linear generative
Bayesian classifier naive Bayes. This motivates a systematic study of the
effectiveness of discretizing quantitative attributes for other linear
classifiers. In this work, we study the effect of discretization on the
performance of linear classifiers optimizing three distinct discriminative
objective functions --- logistic regression (optimizing negative
log-likelihood), support vector classifiers (optimizing hinge loss) and a
zero-hidden layer artificial neural network (optimizing mean-square-error). We
show that discretization can greatly increase the accuracy of these linear
discriminative learners by reducing their representation bias, especially on
big datasets. We substantiate our claims with an empirical study on $42$
benchmark datasets.
","[{'version': 'v1', 'created': 'Tue, 24 Jan 2017 23:57:32 GMT'}]",2017-01-26,"[['Zaidi', 'Nayyar A.', ''], ['Du', 'Yang', ''], ['Webb', 'Geoffrey I.', '']]","['discretization', 'classification', 'logistic regression', 'support vector classifier', 'bigdatasets', 'bias-variance analysis']"
20145,1401.3768,Wei   Jiang,"Bharath K. Samanthula, Wei Jiang, Elisa Bertino","Lightweight and Secure Two-Party Range Queries over Outsourced Encrypted
  Databases","25 pages, 1 figure",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the many benefits of cloud computing, an entity may want to outsource
its data and their related analytics tasks to a cloud. When data are sensitive,
it is in the interest of the entity to outsource encrypted data to the cloud;
however, this limits the types of operations that can be performed on the cloud
side. Especially, evaluating queries over the encrypted data stored on the
cloud without the entity performing any computation and without ever decrypting
the data become a very challenging problem. In this paper, we propose solutions
to conduct range queries over outsourced encrypted data. The existing methods
leak valuable information to the cloud which can violate the security guarantee
of the underlying encryption schemes. In general, the main security primitive
used to evaluate range queries is secure comparison (SC) of encrypted integers.
However, we observe that the existing SC protocols are not very efficient. To
this end, we first propose a novel SC scheme that takes encrypted integers and
outputs encrypted comparison result. We empirically show its practical
advantage over the current state-of-the-art. We then utilize the proposed SC
scheme to construct two new secure range query protocols. Our protocols protect
data confidentiality, privacy of user's query, and also preserve the semantic
security of the encrypted data; therefore, they are more secure than the
existing protocols. Furthermore, our second protocol is lightweight at the user
end, and it can allow an authorized user to use any device with limited storage
and computing capability to perform the range queries over outsourced encrypted
data.
","[{'version': 'v1', 'created': 'Wed, 15 Jan 2014 21:50:01 GMT'}]",2014-01-17,"[['Samanthula', 'Bharath K.', ''], ['Jiang', 'Wei', ''], ['Bertino', 'Elisa', '']]","['Secure Comparison', 'Range Query', 'Encryption', 'Cloud Computing']"
20146,1306.6929,Fabi\'an Riquelme,Xavier Molinero and Fabi\'an Riquelme and Maria Serna,"Power indices of influence games and new centrality measures for social
  networks","14 pages, 6 figures, 3 tables",,,,cs.GT cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In social network analysis, there is a common perception that influence is
relevant to determine the global behavior of the society and thus it can be
used to enforce cooperation by targeting an adequate initial set of individuals
or to analyze global choice processes. Here we propose centrality measures that
can be used to analyze the relevance of the actors in process related to spread
of influence. In [39] it was considered a multiagent system in which the agents
are eager to perform a collective task depending on the perception of the
willingness to perform the task of other individuals. The setting is modeled
using a notion of simple games called influence games. Those games are defined
on graphs were the nodes are labeled by their influence threshold and the
spread of influence between its nodes is used to determine whether a coalition
is winning or not. Influence games provide tools to measure the importance of
the actors of a social network by means of classic power indices and provide a
framework to consider new centrality criteria. In this paper we consider two of
the most classical power indices, i.e., Banzhaf and Shapley-Shubik indices, as
centrality measures for social networks in influence games. Although there is
some work related to specific scenarios of game-theoretic networks, here we use
such indices as centrality measures in any social network where the spread of
influence phenomenon can be applied. Further, we define new centrality measures
such as satisfaction and effort that, as far as we know, have not been
considered so far. We also perform a comparison of the proposed measures with
other three classic centrality measures, degree, closeness and betweenness,
considering three social networks. We show that in some cases our measurements
provide centrality hierarchies similar to those of other measures, while in
other cases provide different hierarchies.
","[{'version': 'v1', 'created': 'Fri, 28 Jun 2013 18:58:54 GMT'}]",2013-07-01,"[['Molinero', 'Xavier', ''], ['Riquelme', 'Fabián', ''], ['Serna', 'Maria', '']]","['Social Network', 'Centrality', 'Power index', 'Spread of Influence', 'Influence game', 'Simplegame']"
20147,0802.4131,Sudhakar Sahoo,"Birendra Kumar Nayak (1), Sudhakar Sahoo (2)",Language of Boolean functions its Grammar and Machine,"5 pages, two tables, presented in Orissa Mathematical Society
  Conference, January, 2008",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper an algorithm is designed which generates in-equivalent Boolean
functions of any number of variables from the four Boolean functions of single
variable. The grammar for such set of Boolean function is provided. The Turing
Machine that accepts such set is constructed.
","[{'version': 'v1', 'created': 'Thu, 28 Feb 2008 06:21:49 GMT'}]",2008-02-29,"[['Nayak', 'Birendra Kumar', ''], ['Sahoo', 'Sudhakar', '']]","['Boolean functions', 'language', 'Grammar', 'Turing Machine']"
20148,0904.0585,Hassane Alla,"Abbas Dideban, M. Zareiee, Hassane Alla (GIPSA-lab)",Controller synthesis with very simplified linear constraints in PN model,"Dependable Control of discrete Systems, Bari : Italie (2009)",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper addresses the problem of forbidden states for safe Petri net
modeling discrete event systems. We present an efficient method to construct a
controller. A set of linear constraints allow forbidding the reachability of
specific states. The number of these so-called forbidden states and
consequently the number of constraints are large and lead to a large number of
control places. A systematic method for constructing very simplified controller
is offered. By using a method based on Petri nets partial invariants, maximal
permissive controllers are determined.
","[{'version': 'v1', 'created': 'Fri, 3 Apr 2009 14:33:06 GMT'}]",2009-04-06,"[['Dideban', 'Abbas', '', 'GIPSA-lab'], ['Zareiee', 'M.', '', 'GIPSA-lab'], ['Alla', 'Hassane', '', 'GIPSA-lab']]","['Discrete Event Systems (DES)', 'Petri Nets', 'Supervisory control', 'Controller synthesis', 'Forbidden states']"
20149,1304.5051,Arnab Bhattacharya,"Shubhadip Mitra, Partha Dutta, Arnab Bhattacharya",Constraint Satisfaction over Generalized Staircase Constraints,,,,,cs.AI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the key research interests in the area of Constraint Satisfaction
Problem (CSP) is to identify tractable classes of constraints and develop
efficient solutions for them. In this paper, we introduce generalized staircase
(GS) constraints which is an important generalization of one such tractable
class found in the literature, namely, staircase constraints. GS constraints
are of two kinds, down staircase (DS) and up staircase (US). We first examine
several properties of GS constraints, and then show that arc consistency is
sufficient to determine a solution to a CSP over DS constraints. Further, we
propose an optimal O(cd) time and space algorithm to compute arc consistency
for GS constraints where c is the number of constraints and d is the size of
the largest domain. Next, observing that arc consistency is not necessary for
solving a DSCSP, we propose a more efficient algorithm for solving it. With
regard to US constraints, arc consistency is not known to be sufficient to
determine a solution, and therefore, methods such as path consistency or
variable elimination are required. Since arc consistency acts as a subroutine
for these existing methods, replacing it by our optimal O(cd) arc consistency
algorithm produces a more efficient method for solving a USCSP.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2013 08:42:22 GMT'}]",2013-04-19,"[['Mitra', 'Shubhadip', ''], ['Dutta', 'Partha', ''], ['Bhattacharya', 'Arnab', '']]","['Constraint Satisfaction Problem (CSP)', 'Staircase Constraint', 'Monotone Constraint', 'CRC Constraint', 'Generalized Staircase Constraint']"
20150,1707.08385,Abdul Kawsar Tushar,"Abdul Kawsar Tushar, Akm Ashiquzzaman, Afia Afrin, Md. Rashedul Islam","A Novel Transfer Learning Approach upon Hindi, Arabic, and Bangla
  Numerals using Convolutional Neural Networks","10 pages; 2 figures, 4 tables; conference - International Conference
  On Computational Vision and Bio Inspired Computing 2017 (http://iccvbic.com/)
  (accepted)",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Increased accuracy in predictive models for handwritten character recognition
will open up new frontiers for optical character recognition. Major drawbacks
of predictive machine learning models are headed by the elongated training time
taken by some models, and the requirement that training and test data be in the
same feature space and consist of the same distribution. In this study, these
obstacles are minimized by presenting a model for transferring knowledge from
one task to another. This model is presented for the recognition of handwritten
numerals in Indic languages. The model utilizes convolutional neural networks
with backpropagation for error reduction and dropout for data overfitting. The
output performance of the proposed neural network is shown to have closely
matched other state-of-the-art methods using only a fraction of time used by
the state-of-the-arts.
","[{'version': 'v1', 'created': 'Wed, 26 Jul 2017 11:40:13 GMT'}]",2017-07-27,"[['Tushar', 'Abdul Kawsar', ''], ['Ashiquzzaman', 'Akm', ''], ['Afrin', 'Afia', ''], ['Islam', 'Md. Rashedul', '']]","['Transfer Learning', 'Indic Numerals', 'Numeral Recognition', 'Convolutional Neural Networks', 'Optical Character Recognition']"
20151,0710.4817,EDA Publishing Association,"Daniel Thull, Roberto Sannino",Performance Considerations for an Embedded Implementation of OMA DRM 2,Submitted on behalf of EDAA (http://www.edaa.com/),"Dans Design, Automation and Test in Europe | Designers'Forum -
  DATE'05, Munich : Allemagne (2005)",,,cs.CR,,"  As digital content services gain importance in the mobile world, Digital
Rights Management (DRM) applications will become a key component of mobile
terminals. This paper examines the effect dedicated hardware macros for
specific cryptographic functions have on the performance of a mobile terminal
that supports version 2 of the open standard for Digital Rights Management
defined by the Open Mobile Alliance (OMA). Following a general description of
the standard, the paper contains a detailed analysis of the cryptographic
operations that have to be carried out before protected content can be
accessed. The combination of this analysis with data on execution times for
specific algorithms realized in hardware and software has made it possible to
build a model which has allowed us to assert that hardware acceleration for
specific cryptographic algorithms can significantly reduce the impact DRM has
on a mobile terminal's processing performance and battery life.
","[{'version': 'v1', 'created': 'Thu, 25 Oct 2007 12:02:24 GMT'}]",2011-11-09,"[['Thull', 'Daniel', ''], ['Sannino', 'Roberto', '']]","['DRM', 'Security', 'Mobile Terminal', 'Cryptography']"
20152,1704.04982,Utku Kose,"Aslihan Tufekci, Yahya Balaman, Utku Kose","Designing a Web-based interactive audio library automation system for
  visually-impaired people and evaluation of its usability","22 pages, 9 figures, 7 tables","Journal of Multidisciplinary Developments, 1(1), 2016, 38-59",,,cs.CY cs.DL cs.SE,http://creativecommons.org/licenses/by-sa/4.0/,"  The aim of this study is to introduce an application that enables information
sharing and communication between visually-impaired individuals and
able-bodied. For the purposes of the study, web-based audio library automation
was designed and the usability of the system was analyzed regarding the
volunteers who record audio books and the visually-impaired individuals. The
visually-impaired individuals who took part in the test procedures in order to
make a general evaluation of the system reported that the system was
theoretically necessary and successful. As for the usability aspect, positive
comments were received regarding the automation system developed. The authors
believe that the current study is likely to be an alternative reference source
for the related literature and further research studies to be conducted in the
field.
","[{'version': 'v1', 'created': 'Tue, 4 Apr 2017 18:14:19 GMT'}]",2017-04-18,"[['Tufekci', 'Aslihan', ''], ['Balaman', 'Yahya', ''], ['Kose', 'Utku', '']]","['audio library', 'visually-impaired people', 'automation system', 'web-based system', 'usability test    1']"
20153,1511.03629,John Stuart Haberl Baxter,"John S.H. Baxter, Jonathan McLeod, and Terry M. Peters",A Continuous Max-Flow Approach to Cyclic Field Reconstruction,"8 pages, 1 figure",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reconstruction of an image from noisy data using Markov Random Field theory
has been explored by both the graph-cuts and continuous max-flow community in
the form of the Potts and Ishikawa models. However, neither model takes into
account the particular cyclic topology of specific intensity types such as the
hue in natural colour images, or the phase in complex valued MRI. This paper
presents \textit{cyclic continuous max-flow} image reconstruction which models
the intensity being reconstructed as having a fundamentally cyclic topology.
This model complements the Ishikawa model in that it is designed with image
reconstruction in mind, having the topology of the intensity space inherent in
the model while being readily extendable to an arbitrary intensity resolution.
","[{'version': 'v1', 'created': 'Wed, 11 Nov 2015 19:55:05 GMT'}]",2015-11-12,"[['Baxter', 'John S. H.', ''], ['McLeod', 'Jonathan', ''], ['Peters', 'Terry M.', '']]","['Max-flow image reconstruction', 'optimal reconstruction', 'phase reconstruction', 'hue reconstruction']"
20154,1505.07079,Jose Rodrigues Jr,"Jose Rodrigues-Jr, Luciana Zaina, Maria Oliveira, Bruno Brandoli, and
  Agma Traina","A survey on Information Visualization in light of Vision and Cognitive
  sciences","29 pages, Elsevier Journal preprint",,,,cs.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Information Visualization techniques are built on a context with many factors
related to both vision and cognition, making it difficult to draw a clear
picture of how data visually turns into comprehension. In the intent of
promoting a better picture, here, we survey concepts on vision, cognition, and
Information Visualization organized in a theorization named Visual Expression
Process. Our theorization organizes the basis of visualization techniques with
a reduced level of complexity; still, it is complete enough to foster
discussions related to design and analytical tasks. Our work introduces the
following contributions: (1) a Theoretical compilation of vision, cognition,
and Information Visualization; (2) Discussions supported by vast literature;
and (3) Reflections on visual-cognitive aspects concerning use and design. We
expect our contributions will provide further clarification about how users and
designers think about InfoVis, leveraging the potential of systems and
techniques.
","[{'version': 'v1', 'created': 'Tue, 26 May 2015 19:03:54 GMT'}, {'version': 'v2', 'created': 'Fri, 13 May 2016 12:25:30 GMT'}]",2016-05-16,"[['Rodrigues-Jr', 'Jose', ''], ['Zaina', 'Luciana', ''], ['Oliveira', 'Maria', ''], ['Brandoli', 'Bruno', ''], ['Traina', 'Agma', '']]","['Information Visualization', 'InfoVis', 'Vision Science', 'Cognitive Science']"
20155,0802.2112,Manik Lal Das,Manik Lal Das,"On the Security of ``an efficient and complete remote user
  authentication scheme''",,,,,cs.CR,,"  Recently, Liaw et al. proposed a remote user authentication scheme using
smart cards. Their scheme has claimed a number of features e.g. mutual
authentication, no clock synchronization, no verifier table, flexible user
password change, etc. We show that Liaw et al.'s scheme is completely insecure.
By intercepting a valid login message in Liaw et al.'s scheme, any unregistered
user or adversary can easily login to the remote system and establish a session
key.
","[{'version': 'v1', 'created': 'Thu, 14 Feb 2008 22:28:37 GMT'}]",2008-02-18,"[['Das', 'Manik Lal', '']]","['Password', 'Authentication', 'Smart cards', 'Remote system']"
20156,0905.4684,Yan Xin,Yan Xin and Honghai Zhang,A Simple Sequential Spectrum Sensing Scheme for Cognitive Radio,"29 pages, 3 figures, submitted to IEEE Transactions on Signal
  Processing",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cognitive radio that supports a secondary and opportunistic access to
licensed spectrum shows great potential to dramatically improve spectrum
utilization. Spectrum sensing performed by secondary users to detect unoccupied
spectrum bands, is a key enabling technique for cognitive radio. This paper
proposes a truncated sequential spectrum sensing scheme, namely the sequential
shifted chi-square test (SSCT). The SSCT has a simple test statistic and does
not rely on any deterministic knowledge about primary signals. As figures of
merit, the exact false-alarm probability is derived, and the miss-detection
probability as well as the average sample number (ASN) are evaluated by using a
numerical integration algorithm. Corroborating numerical examples show that, in
comparison with fixed-sample size detection schemes such as energy detection,
the SSCT delivers considerable reduction on the ASN while maintaining a
comparable detection performance.
","[{'version': 'v1', 'created': 'Thu, 28 May 2009 15:47:09 GMT'}]",2009-05-29,"[['Xin', 'Yan', ''], ['Zhang', 'Honghai', '']]","['Cognitive radio', 'energy detection', 'hypothesis testing', 'spectrum sensing', 'sequential detection']"
20157,1704.08798,Saif M. Mohammad Dr.,Saif M. Mohammad,Word Affect Intensities,"Proceedings of the Eleventh International Conference on Language
  Resources and Evaluation (LREC 2018). https://aclanthology.org/L18-1027/",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Words often convey affect -- emotions, feelings, and attitudes. Further,
different words can convey affect to various degrees (intensities). However,
existing manually created lexicons for basic emotions (such as anger and fear)
indicate only coarse categories of affect association (for example, associated
with anger or not associated with anger). Automatic lexicons of affect provide
fine degrees of association, but they tend not to be accurate as human-created
lexicons. Here, for the first time, we present a manually created affect
intensity lexicon with real-valued scores of intensity for four basic emotions:
anger, fear, joy, and sadness. (We will subsequently add entries for more
emotions such as disgust, anticipation, trust, and surprise.) We refer to this
dataset as the NRC Affect Intensity Lexicon, or AIL for short. AIL has entries
for close to 6,000 English words. We used a technique called best-worst scaling
(BWS) to create the lexicon. BWS improves annotation consistency and obtains
reliable fine-grained scores (split-half reliability > 0.91). We also compare
the entries in AIL with the entries in the NRC VAD Lexicon, which has valence,
arousal, and dominance (VAD) scores for 20K English words. We find that anger,
fear, and sadness words, on average, have very similar VAD scores. However,
sadness words tend to have slightly lower dominance scores than fear and anger
words. The Affect Intensity Lexicon has applications in automatic emotion
analysis in a number of domains such as commerce, education, intelligence, and
public health. AIL is also useful in the building of natural language
generation systems.
","[{'version': 'v1', 'created': 'Fri, 28 Apr 2017 03:33:16 GMT'}, {'version': 'v2', 'created': 'Sun, 16 Oct 2022 02:33:25 GMT'}]",2022-10-18,"[['Mohammad', 'Saif M.', '']]","['emotion intensity', 'emotion lexicon', 'emotion analysis', 'crowdsourcing', 'best–worst scaling', 'sentiment analysis']"
20158,1712.02944,Tevfik Kosar,"Asif Imran, Md S Q Zulkar Nine, Kemal Guner, Tevfik Kosar","OneDataShare: A Vision for Cloud-hosted Data Transfer Scheduling and
  Optimization as a Service",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fast, reliable, and efficient data transmission across wide-area networks is
a predominant bottleneck for data-intensive cloud applications. This paper
introduces OneDataShare, which is designed to eliminate the issues plaguing
effective cloud-based data transfers of varying file sizes and across
incompatible transfer end-points. The vision of OneDataShare is to achieve
high-speed data communication, interoperability between multiple transfer
protocols, and accurate estimation of delivery time for advance planning,
thereby maximizing user-profit through improved and faster data analysis for
business intelligence. The paper elaborates on the desirable features of
OneDataShare as a cloud-hosted data transfer scheduling and optimization
service, and how it is aligned with the vision of harnessing the power of the
cloud and distributed computing. Experimental evaluation and comparison with
existing real-life file transfer services show that the transfer throughout
achieved by OneDataShare is 6.5 times greater.
","[{'version': 'v1', 'created': 'Fri, 8 Dec 2017 05:24:56 GMT'}]",2017-12-11,"[['Imran', 'Asif', ''], ['Nine', 'Md S Q Zulkar', ''], ['Guner', 'Kemal', ''], ['Kosar', 'Tevfik', '']]","['Managed file transfer', 'cloud computing', 'throughput optimization', 'protocol translation', 'data management']"
20159,1204.5576,YuQian Zhou,YuQian Zhou,"Efficient programs of NPC problems should be length upper-bounded, and a
  thought experiment to search for them by machine enumeration","6 pages, 2 figures",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a thought experiment to search for efficient bounded
algorithms of NPC problems by machine enumeration. The key contributions are:
  -- On Universal Turing Machines, a program's time complexity should be
characterized as: execution time(n) = loading time(n) + running time(n).
  -- Introduces the concept of bounded algorithms; proposes a comparison based
criterion to decide if a bounded algorithm is inefficient; and establishes the
length upper bound of efficient bounded programs.
  -- Introduces the growth rate characteristic function to evaluate program
complexity, which is more easily machine checkable based on observations.
  -- Raises the theoretical question: if there exists any bounded algorithm
with polynomial execution time for NPC problems.
","[{'version': 'v1', 'created': 'Wed, 25 Apr 2012 07:20:41 GMT'}, {'version': 'v2', 'created': 'Sat, 6 Oct 2012 19:40:09 GMT'}]",2012-10-09,"[['Zhou', 'YuQian', '']]","['P ?= NP', 'program complexity', 'UTM']"
20160,1501.03545,Moritz von Looz-Corswarem,"Moritz von Looz and Christian L. Staudt and Henning Meyerhenke and
  Roman Prutkin",Fast generation of complex networks with underlying hyperbolic geometry,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Complex networks have become increasingly popular for modeling various
real-world phenomena. Realistic generative network models are important in this
context as they avoid privacy concerns of real data and simplify complex
network research regarding data sharing, reproducibility, and scalability
studies. \emph{Random hyperbolic graphs} are a well-analyzed family of
geometric graphs. Previous work provided empirical and theoretical evidence
that this generative graph model creates networks with non-vanishing clustering
and other realistic features. However, the investigated networks in previous
applied work were small, possibly due to the quadratic running time of a
previous generator.
  In this work we provide the first generation algorithm for these networks
with subquadratic running time. We prove a time complexity of $O((n^{3/2}+m)
\log n)$ with high probability for the generation process. This running time is
confirmed by experimental data with our implementation. The acceleration stems
primarily from the reduction of pairwise distance computations through a polar
quadtree, which we adapt to hyperbolic space for this purpose. In practice we
improve the running time of a previous implementation by at least two orders of
magnitude this way. Networks with billions of edges can now be generated in a
few minutes.
  Finally, we evaluate the largest networks of this model published so far. Our
empirical analysis shows that important features are retained over different
graph densities and degree distributions.
","[{'version': 'v1', 'created': 'Thu, 15 Jan 2015 00:52:44 GMT'}, {'version': 'v2', 'created': 'Wed, 11 Feb 2015 18:28:26 GMT'}, {'version': 'v3', 'created': 'Thu, 23 Apr 2015 10:01:00 GMT'}]",2015-04-24,"[['von Looz', 'Moritz', ''], ['Staudt', 'Christian L.', ''], ['Meyerhenke', 'Henning', ''], ['Prutkin', 'Roman', '']]","['complex networks', 'hyperbolic geometry', 'generative graphmodel', 'polar quadtree', 'network analysis']"
20161,1609.02016,Marco Filetti,Marco Filetti and Jari Torniainen,"A short review and primer on multimodal psychophysiological applications
  in work-related human computer interaction",,,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The application of psychophysiology in human-computer interaction is a
growing field with significant potential for future smart personalised systems.
Working in this emerging field requires comprehension of an array of
physiological signals and analysis techniques. This paper focuses on the
aggregation of multiple physiological measurements, obtained from one or more
sensors. This approach requires the classification of relatively large samples
of multidimensional data, which must be associated to specific cognitive or
affective states. Researchers generally attempt to solve this problem by
utilising machine learning techniques. We present a short review to serve as a
primer for the novice, enabling rapid familiarisation with the latest core
concepts. We put special emphasis on work-related human-computer interface
applications to distinguish from the more common clinical or sports uses of
psychophysiology.
  This paper is an extract from a comprehensive review of the entire field of
ambulatory psychophysiology, including 12 similar chapters, plus application
guidelines and systematic review. Thus any citation should be made using the
following reference:
  B. Cowley, M. Filetti, K. Lukander, J. Torniainen, A. Henelius, L. Ahonen, O.
Barral, I. Kosunen, T. Valtonen, M. Huotilainen, N. Ravaja, G. Jacucci. The
Psychophysiology Primer: a guide to methods and a broad review with a focus on
human-computer interaction. Foundations and Trends in Human-Computer
Interaction, vol. 9, no. 3-4, pp. 150--307, 2016.
","[{'version': 'v1', 'created': 'Wed, 7 Sep 2016 15:16:26 GMT'}]",2016-09-08,"[['Filetti', 'Marco', ''], ['Torniainen', 'Jari', '']]","['multimodal', 'psychophysiology', 'human-computer interaction', 'primer', 'review']"
20162,1501.02473,Harish V,"Harish Vangala, Emanuele Viterbo, and Yi Hong",A Comparative Study of Polar Code Constructions for the AWGN Channel,"9 pages, submitted, under revision of an IEEE journal",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a comparative study of the performance of various polar code
constructions in an additive white Gaussian noise (AWGN) channel. A polar code
construction is any algorithm that selects $K$ best among $N$ possible polar
bit-channels at the design signal-to-noise-ratio (design-SNR) in terms of bit
error rate (BER). Optimal polar code construction is hard and therefore many
suboptimal polar code constructions have been proposed at different
computational complexities. Polar codes are also non-universal meaning the code
changes significantly with the design-SNR. However, it is not known which
construction algorithm at what design-SNR constructs the best polar codes. We
first present a comprehensive survey of all the well-known polar code
constructions along with their full implementations. We then propose a
heuristic algorithm to find the best design-SNR for constructing best possible
polar codes from a given construction algorithm. The proposed algorithm
involves a search among several possible design-SNRs. We finally use our
algorithm to perform a comparison of different construction algorithms using
extensive simulations. We find that all polar code construction algorithms
generate equally good polar codes in an AWGN channel, if the design-SNR is
optimized.
","[{'version': 'v1', 'created': 'Sun, 11 Jan 2015 17:20:48 GMT'}]",2015-01-13,"[['Vangala', 'Harish', ''], ['Viterbo', 'Emanuele', ''], ['Hong', 'Yi', '']]","['Bhattacharyya bounds', 'bit-channels', 'Gaussian approximation', 'polar codes']"
20163,1603.00082,Michael Kompatscher,"Michael Kompatscher, Trung Van Pham",A complexity dichotomy for poset constraint satisfaction,29 pages,,,,cs.CC math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we determine the complexity of a broad class of problems that
extends the temporal constraint satisfaction problems. To be more precise we
study the problems Poset-SAT($\Phi$), where $\Phi$ is a given set of
quantifier-free $\leq$-formulas. An instance of Poset-SAT($\Phi$) consists of
finitely many variables $x_1,\ldots,x_n$ and formulas
$\phi_i(x_{i_1},\ldots,x_{i_k})$ with $\phi_i \in \Phi$; the question is
whether this input is satisfied by any partial order on $x_1,\ldots,x_n$ or
not. We show that every such problem is NP-complete or can be solved in
polynomial time, depending on $\Phi$. All Poset-SAT problems can be formalized
as constraint satisfaction problems on reducts of the random partial order. We
use model-theoretic concepts and techniques from universal algebra to study
these reducts. In the course of this analysis we establish a dichotomy that we
believe is of independent interest in universal algebra and model theory.
","[{'version': 'v1', 'created': 'Mon, 29 Feb 2016 22:45:49 GMT'}, {'version': 'v2', 'created': 'Wed, 2 Mar 2016 16:57:52 GMT'}, {'version': 'v3', 'created': 'Sun, 25 Sep 2016 07:41:47 GMT'}]",2016-09-27,"[['Kompatscher', 'Michael', ''], ['Van Pham', 'Trung', '']]","['Constraint Satisfaction', 'Random Partial Order', 'Computational Complexity', 'Universal Algebra', 'Ramsey Theory']"
20164,1008.2579,Keyvan Yahya,"Keyvan Yahya, Jafar Biazar, Hossein Azari, Pouyan Rafiei Fard",Homotopy Perturbation Method for Image Restoration and Denoising,"submitted for publication in ICCESSE 2010 : ""International Conference
  on Computer, Electrical, Systems, Science and Engineering"", Amsterdam, The
  Netherlands",,,,cs.CV cs.NA math.AP math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The famous Perona-Malik (P-M) equation which was at first introduced for
image restoration has been solved via various numerical methods. In this paper
we will solve it for the first time via applying a new numerical method called
Homotopy Perturbation Method (HMP) and the correspondent approximated solutions
will be obtained for the P-M equation with regards to relevant error analysis.
Through implementation of our algorithm we will access some effective results
which are deserved to be considered as worthy as the other solutions issued by
the other methods.
","[{'version': 'v1', 'created': 'Mon, 16 Aug 2010 06:27:29 GMT'}]",2010-08-17,"[['Yahya', 'Keyvan', ''], ['Biazar', 'Jafar', ''], ['Azari', 'Hossein', ''], ['Fard', 'Pouyan Rafiei', '']]","['Homotopy Perturbation Method', 'Image Restoration', 'Perona-Malik Equation']"
20165,1401.1024,Marius Lindauer,Holger Hoos and Roland Kaminski and Marius Lindauer and Torsten Schaub,Solver Scheduling via Answer Set Programming,To appear in Theory and Practice of Logic Programming (TPLP),,,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although Boolean Constraint Technology has made tremendous progress over the
last decade, the efficacy of state-of-the-art solvers is known to vary
considerably across different types of problem instances and is known to depend
strongly on algorithm parameters. This problem was addressed by means of a
simple, yet effective approach using handmade, uniform and unordered schedules
of multiple solvers in ppfolio, which showed very impressive performance in the
2011 SAT Competition. Inspired by this, we take advantage of the modeling and
solving capacities of Answer Set Programming (ASP) to automatically determine
more refined, that is, non-uniform and ordered solver schedules from existing
benchmarking data. We begin by formulating the determination of such schedules
as multi-criteria optimization problems and provide corresponding ASP
encodings. The resulting encodings are easily customizable for different
settings and the computation of optimum schedules can mostly be done in the
blink of an eye, even when dealing with large runtime data sets stemming from
many solvers on hundreds to thousands of instances. Also, the fact that our
approach can be customized easily enabled us to swiftly adapt it to generate
parallel schedules for multi-processor machines.
","[{'version': 'v1', 'created': 'Mon, 6 Jan 2014 09:58:02 GMT'}]",2014-01-07,"[['Hoos', 'Holger', ''], ['Kaminski', 'Roland', ''], ['Lindauer', 'Marius', ''], ['Schaub', 'Torsten', '']]","['Algorithm Schedules', 'Answer Set Programming', 'Portfolio-Based Solving']"
20166,0805.3518,Gianluca Caminiti,Francesco Buccafurri and Gianluca Caminiti,Logic programming with social features,"49 pages, 0 figures, to appear in Theory and Practice of Logic
  Programming (TPLP)",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In everyday life it happens that a person has to reason about what other
people think and how they behave, in order to achieve his goals. In other
words, an individual may be required to adapt his behaviour by reasoning about
the others' mental state. In this paper we focus on a knowledge representation
language derived from logic programming which both supports the representation
of mental states of individual communities and provides each with the
capability of reasoning about others' mental states and acting accordingly. The
proposed semantics is shown to be translatable into stable model semantics of
logic programs with aggregates.
","[{'version': 'v1', 'created': 'Thu, 22 May 2008 18:17:58 GMT'}]",2008-12-18,"[['Buccafurri', 'Francesco', ''], ['Caminiti', 'Gianluca', '']]","['logic programming', 'stable model semantics', 'knowledge representation']"
20167,1312.4036,Apoorv Narang,Apoorv Narang and Srikanta Bedathur,"Mind Your Language: Effects of Spoken Query Formulation on Retrieval
  Effectiveness",,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Voice search is becoming a popular mode for interacting with search engines.
As a result, research has gone into building better voice transcription
engines, interfaces, and search engines that better handle inherent verbosity
of queries. However, when one considers its use by non- native speakers of
English, another aspect that becomes important is the formulation of the query
by users. In this paper, we present the results of a preliminary study that we
conducted with non-native English speakers who formulate queries for given
retrieval tasks. Our results show that the current search engines are sensitive
in their rankings to the query formulation, and thus highlights the need for
developing more robust ranking methods.
","[{'version': 'v1', 'created': 'Sat, 14 Dec 2013 12:13:58 GMT'}]",2013-12-17,"[['Narang', 'Apoorv', ''], ['Bedathur', 'Srikanta', '']]","['Voice Search', 'Query Formulation', 'Evaluation']"
20168,1002.1168,Vishal Goyal,"F. Benboubker, F. Abdi, A. Ahaitouf",Shape-Adaptive Motion Estimation Algorithm for MPEG-4 Video Coding,"International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 2, January 2010,
  http://ijcsi.org/articles/Shape-Adaptive-Motion-Estimation-Algorithm-for-MPEG-4-Video-Coding.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 2, January 2010,
  http://ijcsi.org/articles/Shape-Adaptive-Motion-Estimation-Algorithm-for-MPEG-4-Video-Coding.php",,,cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a gradient based motion estimation algorithm based on
shape-motion prediction, which takes advantage of the correlation between
neighboring Binary Alpha Blocks (BABs), to match with the Mpeg-4 shape coding
case and speed up the estimation process. The PSNR and computation time
achieved by the proposed algorithm seem to be better than those obtained by
most popular motion estimation techniques.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 09:31:58 GMT'}]",2010-02-08,"[['Benboubker', 'F.', ''], ['Abdi', 'F.', ''], ['Ahaitouf', 'A.', '']]","['Motion Estimation algorithm', 'BAB', 'Shape Coding', 'MPEG4']"
20169,1607.03516,Muhammad Ghifary,"Muhammad Ghifary and W. Bastiaan Kleijn and Mengjie Zhang and David
  Balduzzi and Wen Li","Deep Reconstruction-Classification Networks for Unsupervised Domain
  Adaptation",to appear in European Conference on Computer Vision (ECCV) 2016,,,,cs.CV cs.AI cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a novel unsupervised domain adaptation algorithm
based on deep learning for visual object recognition. Specifically, we design a
new model called Deep Reconstruction-Classification Network (DRCN), which
jointly learns a shared encoding representation for two tasks: i) supervised
classification of labeled source data, and ii) unsupervised reconstruction of
unlabeled target data.In this way, the learnt representation not only preserves
discriminability, but also encodes useful information from the target domain.
Our new DRCN model can be optimized by using backpropagation similarly as the
standard neural networks.
  We evaluate the performance of DRCN on a series of cross-domain object
recognition tasks, where DRCN provides a considerable improvement (up to ~8% in
accuracy) over the prior state-of-the-art algorithms. Interestingly, we also
observe that the reconstruction pipeline of DRCN transforms images from the
source domain into images whose appearance resembles the target dataset. This
suggests that DRCN's performance is due to constructing a single composite
representation that encodes information about both the structure of target
images and the classification of source images. Finally, we provide a formal
analysis to justify the algorithm's objective in domain adaptation context.
","[{'version': 'v1', 'created': 'Tue, 12 Jul 2016 20:48:58 GMT'}, {'version': 'v2', 'created': 'Mon, 1 Aug 2016 09:58:13 GMT'}]",2016-08-03,"[['Ghifary', 'Muhammad', ''], ['Kleijn', 'W. Bastiaan', ''], ['Zhang', 'Mengjie', ''], ['Balduzzi', 'David', ''], ['Li', 'Wen', '']]","['domain adaptation', 'object recognition', 'deep learning', 'convolutional networks', 'transfer learning']"
20170,0706.3565,Anatoly Plotnikov,Anatoly D. Plotnikov,Experimental Algorithm for the Maximum Independent Set Problem,"From author's book ""Discrete mathematics"",3-th ed., Moscow,New
  knowledge,2007, 18 pages, 8 figures","Cybernetics and Systems Analysis: Volume 48, Issue 5 (2012), Page
  673-680",,,cs.DS,,"  We develop an experimental algorithm for the exact solving of the maximum
independent set problem. The algorithm consecutively finds the maximal
independent sets of vertices in an arbitrary undirected graph such that the
next such set contains more elements than the preceding one. For this purpose,
we use a technique, developed by Ford and Fulkerson for the finite partially
ordered sets, in particular, their method for partition of a poset into the
minimum number of chains with finding the maximum antichain. In the process of
solving, a special digraph is constructed, and a conjecture is formulated
concerning properties of such digraph. This allows to offer of the solution
algorithm. Its theoretical estimation of running time equals to is $O(n^{8})$,
where $n$ is the number of graph vertices. The offered algorithm was tested by
a program on random graphs. The testing the confirms correctness of the
algorithm.
","[{'version': 'v1', 'created': 'Mon, 25 Jun 2007 06:45:49 GMT'}, {'version': 'v2', 'created': 'Mon, 2 Jul 2007 02:16:12 GMT'}]",2016-03-02,"[['Plotnikov', 'Anatoly D.', '']]","['the maximum independent set', 'a clique', 'NP-hard', 'NPcomplete', 'the class NP', 'a polynomial-time algorithm', 'the partially ordered set']"
20171,1704.04969,Paulina Paraponiari,Paulina Paraponiari and George Rahonis,"Weighted propositional configuration logics: A specification language
  for architectures with quantitative features","25 pages, 5 figures",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce and investigate a weighted propositional configuration logic
over commutative semirings. Our logic is intended to serve as a specification
language for software architectures with quantitative features. We prove an
efficient construction of full normal forms and decidability of equivalence of
formulas in this logic. We illustrate the motivation of this work by describing
well-known architectures equipped with quantitative characteristics using
formulas in our logic.
","[{'version': 'v1', 'created': 'Mon, 17 Apr 2017 14:04:31 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Apr 2017 08:09:32 GMT'}, {'version': 'v3', 'created': 'Fri, 26 May 2017 19:47:09 GMT'}, {'version': 'v4', 'created': 'Mon, 24 Jul 2017 22:28:39 GMT'}, {'version': 'v5', 'created': 'Sun, 6 May 2018 10:59:38 GMT'}, {'version': 'v6', 'created': 'Fri, 17 Jan 2020 12:08:03 GMT'}]",2020-01-20,"[['Paraponiari', 'Paulina', ''], ['Rahonis', 'George', '']]","['Software architectures', 'Propositional configuration logic', 'Weighted propositional configuration logic']"
20172,1011.2304,Cedric Bernier,"Samuel Nowakowski (LORIA), C\'edric Bernier (LORIA), Anne Boyer
  (LORIA)","Target tracking in the recommender space: Toward a new recommender
  system based on Kalman filtering",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a new approach for recommender systems based on
target tracking by Kalman filtering. We assume that users and their seen
resources are vectors in the multidimensional space of the categories of the
resources. Knowing this space, we propose an algorithm based on a Kalman filter
to track users and to predict the best prediction of their future position in
the recommendation space.
","[{'version': 'v1', 'created': 'Wed, 10 Nov 2010 08:26:56 GMT'}]",2010-11-11,"[['Nowakowski', 'Samuel', '', 'LORIA'], ['Bernier', 'Cédric', '', 'LORIA'], ['Boyer', 'Anne', '', 'LORIA']]","['Kalman filtering', 'target tracking', 'recommender systems']"
20173,1410.4441,Ariyan Zarei,Ariyan Zarei,Improve CAPTCHA's Security Using Gaussian Blur Filter,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Providing security for webservers against unwanted and automated
registrations has become a big concern. To prevent these kinds of false
registrations many websites use CAPTCHAs. Among all kinds of CAPTCHAs OCR-Based
or visual CAPTCHAs are very common. Actually visual CAPTCHA is an image
containing a sequence of characters. So far most of visual CAPTCHAs, in order
to resist against OCR programs, use some common implementations such as
wrapping the characters, random placement and rotations of characters, etc. In
this paper we applied Gaussian Blur filter, which is an image transformation,
to visual CAPTCHAs to reduce their readability by OCR programs. We concluded
that this technique made CAPTCHAs almost unreadable for OCR programs but, their
readability by human users still remained high.
","[{'version': 'v1', 'created': 'Thu, 16 Oct 2014 14:17:21 GMT'}]",2014-10-17,"[['Zarei', 'Ariyan', '']]","['CAPTCHA', 'Gaussian Blur', 'Image Transformations', 'Optical Character Recognition (OCR)', 'Internet Security']"
20174,1306.1619,Ji Won Yoon Ph.D.,Ji Won Yoon,"Statistical Denoising for single molecule fluorescence microscopic
  images",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Single molecule fluorescence microscopy is a powerful technique for
uncovering detailed information about biological systems, both in vitro and in
vivo. In such experiments, the inherently low signal to noise ratios mean that
accurate algorithms to separate true signal and background noise are essential
to generate meaningful results. To this end, we have developed a new and robust
method to reduce noise in single molecule fluorescence images by using a
Gaussian Markov Random Field (GMRF) prior in a Bayesian framework. Two
different strategies are proposed to build the prior - an intrinsic GMRF, with
a stationary relationship between pixels and a heterogeneous intrinsic GMRF,
with a differently weighted relationship between pixels classified as molecules
and background. Testing with synthetic and real experimental fluorescence
images demonstrates that the heterogeneous intrinsic GMRF is superior to other
conventional de-noising approaches.
","[{'version': 'v1', 'created': 'Fri, 7 Jun 2013 05:39:48 GMT'}]",2013-06-10,"[['Yoon', 'Ji Won', '']]","['De-noising', 'Bayesian', 'Adaptive Prior']"
20175,1307.2348,Narine Davtyan,N.N. Davtyan,On the $\mu$-parameters of the Petersen graph,"arXiv admin note: substantial text overlap with arXiv:1307.1389; and
  substantial text overlap with arXiv:1205.0125, arXiv:1307.1389 by other
  authors",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For an undirected, simple, finite, connected graph $G$, we denote by $V(G)$
and $E(G)$ the sets of its vertices and edges, respectively. A function
$\varphi:E(G)\rightarrow \{1,...,t\}$ is called a proper edge $t$-coloring of a
graph $G$, if adjacent edges are colored differently and each of $t$ colors is
used. The least value of $t$ for which there exists a proper edge $t$-coloring
of a graph $G$ is denoted by $\chi'(G)$. For any graph $G$, and for any integer
$t$ satisfying the inequality $\chi'(G)\leq t\leq |E(G)|$, we denote by
$\alpha(G,t)$ the set of all proper edge $t$-colorings of $G$. Let us also
define a set $\alpha(G)$ of all proper edge colorings of a graph $G$: $$
\alpha(G)\equiv\bigcup_{t=\chi'(G)}^{|E(G)|}\alpha(G,t). $$
  An arbitrary nonempty finite subset of consecutive integers is called an
interval. If $\varphi\in\alpha(G)$ and $x\in V(G)$, then the set of colors of
edges of $G$ which are incident with $x$ is denoted by $S_G(x,\varphi)$ and is
called a spectrum of the vertex $x$ of the graph $G$ at the proper edge
coloring $\varphi$. If $G$ is a graph and $\varphi\in\alpha(G)$, then define
$f_G(\varphi)\equiv|\{x\in V(G)/S_G(x,\varphi) \textrm{is an interval}\}|$.
  For a graph $G$ and any integer $t$, satisfying the inequality $\chi'(G)\leq
t\leq |E(G)|$, we define: $$
\mu_1(G,t)\equiv\min_{\varphi\in\alpha(G,t)}f_G(\varphi),\qquad
\mu_2(G,t)\equiv\max_{\varphi\in\alpha(G,t)}f_G(\varphi). $$
  For any graph $G$, we set: $$ \mu_{11}(G)\equiv\min_{\chi'(G)\leq
t\leq|E(G)|}\mu_1(G,t),\qquad \mu_{12}(G)\equiv\max_{\chi'(G)\leq
t\leq|E(G)|}\mu_1(G,t), $$ $$ \mu_{21}(G)\equiv\min_{\chi'(G)\leq
t\leq|E(G)|}\mu_2(G,t),\qquad \mu_{22}(G)\equiv\max_{\chi'(G)\leq
t\leq|E(G)|}\mu_2(G,t). $$
  For the Petersen graph, the exact values of the parameters $\mu_{11}$,
$\mu_{12}$, $\mu_{21}$ and $\mu_{22}$ are found.
","[{'version': 'v1', 'created': 'Tue, 9 Jul 2013 07:01:59 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Jul 2013 07:34:49 GMT'}]",2013-07-16,"[['Davtyan', 'N. N.', '']]","['the Petersen graph', 'proper edge coloring', 'interval spectrum', 'game.Math']"
20176,1702.05153,Alexander Zhdanov,Alexander Zhdanov,"Convolutional encoding of 60,64,68,72-bit self-dual codes",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we obtain the [60,30,12], [64,32,12], [68,34,12], [72,36,12]
self-dual codes as tailbitting convolutional codes with the smallest constraint
length K=9. In this construction one information bit is modulo two added to the
one of the encoder outputs and the first row in the quasi-cyclic generator
matrix is replaced by the obtained row. The pure quasi-cyclic construction with
K=10 is also available for [68,34,12] and [72,36,12] codes. The new [72,36,12]
singly even self-dual code with parameters Beta=483 Gamma=0 was obtained.
","[{'version': 'v1', 'created': 'Thu, 16 Feb 2017 21:07:18 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Apr 2017 16:11:22 GMT'}]",2017-04-06,"[['Zhdanov', 'Alexander', '']]","['convolutional encoding', 'quasi-cyclic codes', 'double']"
20177,1705.08855,Rafal Kapelko,Rafal Kapelko,"On the expected moments between two identical random processes with
  application to sensor network",,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give a closed analytical formula for expected distance to the power $a$
between two identical general random processes, when $a$ is an even positive
number.
  As an application to sensor network we prove that the optimal transportation
cost to the power $b>0$ of the maximal random bicolored matching with edges
$\{X_k,Y_k\}$ is in $\frac{\Theta\left(n^{\frac{b}{2}+1}\right)}{{\lambda}^b}$
when $b \ge 2,$ and in $\frac{O\left(n^{\frac{b}{2}+1}\right)}{{\lambda}^b}$
when $0< b < 2.$
","[{'version': 'v1', 'created': 'Wed, 24 May 2017 16:43:19 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Jun 2017 07:45:52 GMT'}, {'version': 'v3', 'created': 'Fri, 2 Jun 2017 15:40:45 GMT'}, {'version': 'v4', 'created': 'Wed, 7 Feb 2018 10:13:03 GMT'}]",2018-02-08,"[['Kapelko', 'Rafal', '']]","['Random process', 'Moment distance', 'Sensor movement', 'Matching']"
20178,1610.04988,Atle Rygg,"Atle Rygg, Marta Molinas, Chen Zhang and Xu Cai","Coupled and decoupled impedance models compared in power electronics
  systems","8 pages, 8 figures",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper provides a comparative analysis of impedance models for power
electronic converters and systems for the purpose of stability investigations.
Such models can be divided into either decoupled models or matrix models. A
decoupled impedance model is highly appealing since the
Single-Input-Single-Output (SISO) structure makes the analysis and result
interpretation very simple. On the other hand, matrix impedance models are more
accurate, and in some cases necessary. Previous works have applied various
approximations to obtain decoupled models, and both the dq- and sequence
domains have been used. This paper introduces the terms decoupled and
semi-decoupled impedance models in order to have a clear classification of the
available approximations.
  The accuracy of 4 decoupled impedance models are discussed based on the
concept of Mirror Frequency Coupling (MFC). By definition the decoupled models
based on sequence domain impedances will be exact for systems without MFC. In
the general case, they are expected to be more accurate than the decoupled
dq-impedance models. The paper defines a norm $\epsilon$ to measure the degree
of coupling in the impedance matrices. This norm equals the error in the
eigenvalue loci between the matrix and semi-decoupled models. This can also be
viewed as the error in the semi-decoupled Nyquist plot.
  An example case study consisting of a grid-connected VSC with current
controller and PLL is used to compare the different methods. It is found that
decoupled and semi-decoupled models in the dq-domain are only applicable in
grids with very low X/R-ratio. Furthermore, it is concluded that the decoupled
model in the sequence domain gives close to equal results as the semi-decoupled
model.
","[{'version': 'v1', 'created': 'Mon, 17 Oct 2016 07:15:50 GMT'}]",2016-10-18,"[['Rygg', 'Atle', ''], ['Molinas', 'Marta', ''], ['Zhang', 'Chen', ''], ['Cai', 'Xu', '']]","['dq-domain', 'Matrix Impedance', 'Power Electronic Systems', 'Sequence Domain', 'Stability Analysis']"
20179,1207.5419,Andreas Cord-Landwehr,"Andreas Cord-Landwehr and Martina H\""ullmann and Peter Kling and
  Alexander Setzer",Basic Network Creation Games with Communication Interests,"An extended abstract of this paper has been accepted for publication
  in the proceedings of the 5th International Symposium on Algorithmic Game
  Theory (SAGT)",,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network creation games model the creation and usage costs of networks formed
by a set of selfish peers. Each peer has the ability to change the network in a
limited way, e.g., by creating or deleting incident links. In doing so, a peer
can reduce its individual communication cost. Typically, these costs are
modeled by the maximum or average distance in the network. We introduce a
generalized version of the basic network creation game (BNCG). In the BNCG (by
Alon et al., SPAA 2010), each peer may replace one of its incident links by a
link to an arbitrary peer. This is done in a selfish way in order to minimize
either the maximum or average distance to all other peers. That is, each peer
works towards a network structure that allows himself to communicate
efficiently with all other peers. However, participants of large networks are
seldom interested in all peers. Rather, they want to communicate efficiently
only with a small subset of peers. Our model incorporates these (communication)
interests explicitly. In the MAX-version, each node tries to minimize its
maximum distance to nodes it is interested in.
  Given peers with interests and a communication network forming a tree, we
prove several results on the structure and quality of equilibria in our model.
For the MAX-version, we give an upper worst case bound of O(\sqrt{n}) for the
private costs in an equilibrium of n peers. Moreover, we give an equilibrium
for a circular interest graph where a node has private cost \Omega(\sqrt{n}),
showing that our bound is tight. This example can be extended such that we get
a tight bound of \Theta(\sqrt{n}) for the price of anarchy. For the case of
general communication networks we show the price of anarchy to be \Theta(n).
Additionally, we prove an interesting connection between a maximum independent
set in the interest graph and the private costs of the peers.
","[{'version': 'v1', 'created': 'Mon, 23 Jul 2012 15:01:11 GMT'}]",2015-03-20,"[['Cord-Landwehr', 'Andreas', ''], ['Hüllmann', 'Martina', ''], ['Kling', 'Peter', ''], ['Setzer', 'Alexander', '']]","['network design', 'routing', 'communication interests', 'price of anarchy', 'equilibrium']"
20180,1401.4691,Ronald Hochreiter,Stefan Hochrainer and Ronald Hochreiter and Georg Pflug,"An algorithm for calculating steady state probabilities of $M|E_r|c|K$
  queueing systems",,Central European Journal of Operations Research 13(1): 1-13. 2005,,,cs.SY cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a method for calculating steady state probabilities of
$M|E_r|c|K$ queueing systems. The infinitesimal generator matrix is used to
define all possible states in the system and their transition probabilities.
While this matrix can be written down immediately for many other $M|PH|c|K$
queueing systems with phase-type service times (e.g. Coxian, Hypoexponential,
\ldots), it requires a more careful analysis for systems with Erlangian service
times. The constructed matrix may then be used to calculate steady state
probabilities using an iterative algorithm. The resulting steady state
probabilities can be used to calculate various performance measures, e.g. the
average queue length. Additionally, computational issues of the implementation
are discussed and an example from the field of telecommunication call-center
queue length will be outlined to substantiate the applicability of these
efforts. In the appendix, tables of the average queueing length given a
specific number of service channels, traffic density, and system size are
presented.
","[{'version': 'v1', 'created': 'Sun, 19 Jan 2014 16:25:38 GMT'}]",2014-01-21,"[['Hochrainer', 'Stefan', ''], ['Hochreiter', 'Ronald', ''], ['Pflug', 'Georg', '']]","['Phase-type distributions', 'Erlang queueing systems', 'steadystate probabilities', 'generator matrix–performance measures']"
20181,1510.00773,Junjie Ye,Junjie Ye,A Note on Finding Dual Feedback Vertex Set,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For an edge-bicolored graph $G$ where each edge is colored either red or
blue, a vertex set $S$ is a dual feedback vertex set if $S$ hits all blue
cycles and red cycles of $G$. In this paper, we show that a dual feedback
vertex set of size at most $k$ can be found in time $O^*(c_1^k)$ and all
minimal dual feedback vertex set of size at most $k$ can be enumerated in time
$O^*(c_2^{k^2 + k})$ by compact representations for constants $c_1$ and $c_2$.
","[{'version': 'v1', 'created': 'Sat, 3 Oct 2015 03:58:48 GMT'}]",2015-10-06,"[['Ye', 'Junjie', '']]","['edge-bicolored graph', 'dual feedback vertex set', 'parameterized complexity']"
20182,1402.1819,Sahaya Rose Vigita,"Sahaya Rose Vigita, Golden Julie","Reliable Link-Based Routing Protocol for Highly Dynamic Mobile Adhoc
  Networks","7 pages, 8 figures, Published with International Journal of
  Engineering Trends and Technology (IJETT)","International Journal of Engineering Trends and Technology
  (IJETT)-Volume 4 Issue 5/ May 2013, Pages 1636 - 1642",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Traditional topology-based MANET routing protocols use stateful routing which
increases the processing,communication and memory overheads. The high mobility
of nodes in MANETs makes it difficult to maintain a deterministic route. To
overcome this, stateless geographic routing protocols which ensure reliable
data delivery have been proposed. It is found that link instability can be a
major factor for unreliable data delivery. Driven by this issue, Link and
Position based Opportunistic Routing (L-POR) protocol which chooses a forwarder
based on the reception power of a node has been proposed. A back-up scheme is
also proposed to handle communication holes. Simulation results show that the
proposed protocol achieves excellent performance even under high node mobility.
","[{'version': 'v1', 'created': 'Sat, 8 Feb 2014 04:31:18 GMT'}]",2014-02-11,"[['Vigita', 'Sahaya Rose', ''], ['Julie', 'Golden', '']]","['Mobile Adhoc Networks', 'reliability', 'opportunistic routing', 'mobility', 'link stability']"
20183,1312.2061,Krishna A N,"Krishna A N, B G Prasad","Region and Location Based Indexing and Retrieval of MR-T2 Brain Tumor
  Images",10 pages,"International Journal of Information Processing, 7(3):16-25, 2013",,,cs.CV cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, region based and location based retrieval systems have been
implemented for retrieval of MR-T2 axial 2-D brain images. This is done by
extracting and characterizing the tumor portion of 2-D brain slices by use of a
suitable threshold computed over the entire image. Indexing and retrieval is
then performed by computing texture features based on gray-tone
spatial-dependence matrix of segmented regions. A Hash structure is used to
index all images. A combined index is adopted to point to all similar images in
terms of the texture features. At query time, only those images that are in the
same hash bucket as those of the queried image are compared for similarity,
thus reducing the search space and time.
","[{'version': 'v1', 'created': 'Sat, 7 Dec 2013 05:40:59 GMT'}]",2013-12-10,"[['N', 'Krishna A', ''], ['Prasad', 'B G', '']]","['Content Based Retrieval', 'Indexing', 'Segmentation', 'Texture']"
20184,1212.4989,Sander Wozniak,"Sander Wozniak, Michael Rossberg, Guenter Schaefer","Towards Trustworthy Mobile Social Networking Services for Disaster
  Response",,,,,cs.SI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Situational awareness is crucial for effective disaster management. However,
obtaining information about the actual situation is usually difficult and
time-consuming. While there has been some effort in terms of incorporating the
affected population as a source of information, the issue of obtaining
trustworthy information has not yet received much attention. Therefore, we
introduce the concept of witness-based report verification, which enables users
from the affected population to evaluate reports issued by other users. We
present an extensive overview of the objectives to be fulfilled by such a
scheme and provide a first approach considering security and privacy. Finally,
we evaluate the performance of our approach in a simulation study. Our results
highlight synergetic effects of group mobility patterns that are likely in
disaster situations.
","[{'version': 'v1', 'created': 'Thu, 20 Dec 2012 11:38:52 GMT'}, {'version': 'v2', 'created': 'Thu, 10 Jan 2013 16:07:29 GMT'}]",2013-01-11,"[['Wozniak', 'Sander', ''], ['Rossberg', 'Michael', ''], ['Schaefer', 'Guenter', '']]","['Security and Privacy Protection', 'Mobile communication systems', 'Multicast']"
20185,1605.01778,Mani A,A. Mani,Combinatorial Aspects of the Distribution of Rough Objects,"17 Pages, 5 Figures, Preprint This version has since been
  substantially revised. Please wait for new version to appear",,,,cs.AI cs.IT math.CO math.IT math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The inverse problem of general rough sets, considered by the present author
in some of her earlier papers, in one of its manifestations is essentially the
question of when an agent's view about crisp and non crisp objects over a set
of objects has a rough evolution. In this research the nature of the problem is
examined from number-theoretic and combinatorial perspectives under very few
assumptions about the nature of data and some necessary conditions are proved.
","[{'version': 'v1', 'created': 'Thu, 5 May 2016 22:20:00 GMT'}, {'version': 'v2', 'created': 'Tue, 31 Jan 2017 17:29:41 GMT'}]",2017-02-01,"[['Mani', 'A.', '']]","['Rough Objects', 'Finite Rough Sets', 'Granular operator Spaces', 'Antichains', 'Granular Rough Semantics', 'Combinatorial Rough Sets']"
20186,1710.03006,Gregor Wiedemann,Gregor Wiedemann and Gerhard Heyer,"Page Stream Segmentation with Convolutional Neural Nets Combining
  Textual and Visual Features","Full paper version: 6 pages, 3 figures, 2 tables","Proceedings of the 11th International Conference on Language
  Resources and Evaluation (LREC 2018)",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In recent years, (retro-)digitizing paper-based files became a major
undertaking for private and public archives as well as an important task in
electronic mailroom applications. As a first step, the workflow involves
scanning and Optical Character Recognition (OCR) of documents. Preservation of
document contexts of single page scans is a major requirement in this context.
To facilitate workflows involving very large amounts of paper scans, page
stream segmentation (PSS) is the task to automatically separate a stream of
scanned images into multi-page documents. In a digitization project together
with a German federal archive, we developed a novel approach based on
convolutional neural networks (CNN) combining image and text features to
achieve optimal document separation results. Evaluation shows that our PSS
architecture achieves an accuracy up to 93 % which can be regarded as a new
state-of-the-art for this task.
","[{'version': 'v1', 'created': 'Mon, 9 Oct 2017 09:29:55 GMT'}, {'version': 'v2', 'created': 'Thu, 8 Feb 2018 16:58:00 GMT'}, {'version': 'v3', 'created': 'Mon, 25 Mar 2019 13:57:32 GMT'}]",2019-03-26,"[['Wiedemann', 'Gregor', ''], ['Heyer', 'Gerhard', '']]","['page stream segmentation', 'convolutional neural nets', 'document image classification', 'document management', 'textclassification']"
20187,1306.5381,Romin Parekh,"Sumita Nainan, Romin Parekh and Tanvi Shah",RFID Technology Based Attendance Management System,"6 pages, 8 figures, 2 tables","International Journal of Computer Science Issues bearing paper ID
  'IJCSI-2013-10-1-4801' was published in IJCSI Volume 10, Issue 1, January
  2013",,,cs.ET,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  RFID is a nascent technology, deeply rooted by its early developments in
using radar1 as a harbinger of adversary planes during World War II. A plethora
of industries have leveraged the benefits of RFID technology for enhancements
in sectors like military, sports, security, airline, animal farms, healthcare
and other areas. Industry specific key applications of this technology include
vehicle tracking, automated inventory management, animal monitoring, secure
store checkouts, supply chain management, automatic payment, sport timing
technologies, etc. This paper introduces the distinctive components of RFID
technology and focuses on its core competencies: scalability and security. It
will be then supplemented by a detailed synopsis of an investigation conducted
to test the feasibility and practicality of RFID technology.
","[{'version': 'v1', 'created': 'Sun, 23 Jun 2013 07:14:33 GMT'}]",2013-06-25,"[['Nainan', 'Sumita', ''], ['Parekh', 'Romin', ''], ['Shah', 'Tanvi', '']]","['RFID technology', 'RFID detection', 'RFID applications', 'RFID in management', 'RFID components']"
20188,1707.09062,Rika Antonova,"Rika Antonova, Akshara Rai, Christopher G. Atkeson",Deep Kernels for Optimizing Locomotion Controllers,(Rika Antonova and Akshara Rai contributed equally),PMLR 78:47-56 (2017),,,cs.RO cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sample efficiency is important when optimizing parameters of locomotion
controllers, since hardware experiments are time consuming and expensive.
Bayesian Optimization, a sample-efficient optimization framework, has recently
been widely applied to address this problem, but further improvements in sample
efficiency are needed for practical applicability to real-world robots and
high-dimensional controllers. To address this, prior work has proposed using
domain expertise for constructing custom distance metrics for locomotion. In
this work we show how to learn such a distance metric automatically. We use a
neural network to learn an informed distance metric from data obtained in
high-fidelity simulations. We conduct experiments on two different controllers
and robot architectures. First, we demonstrate improvement in sample efficiency
when optimizing a 5-dimensional controller on the ATRIAS robot hardware. We
then conduct simulation experiments to optimize a 16-dimensional controller for
a 7-link robot model and obtain significant improvements even when optimizing
in perturbed environments. This demonstrates that our approach is able to
enhance sample efficiency for two different controllers, hence is a fitting
candidate for further experiments on hardware in the future.
","[{'version': 'v1', 'created': 'Thu, 27 Jul 2017 22:30:35 GMT'}, {'version': 'v2', 'created': 'Wed, 8 Nov 2017 17:43:07 GMT'}]",2018-10-11,"[['Antonova', 'Rika', ''], ['Rai', 'Akshara', ''], ['Atkeson', 'Christopher G.', '']]","['Bayesian Optimization', 'Simulator-to-Robot Transfer', 'Bipedal Locomotion']"
20189,1610.01030,Muhammad Imran,"Dat Tien Nguyen, Shafiq Joty, Muhammad Imran, Hassan Sajjad, Prasenjit
  Mitra","Applications of Online Deep Learning for Crisis Response Using Social
  Media Information","Accepted at SWDM co-located with CIKM 2016. 6 pages, 2 figures. arXiv
  admin note: text overlap with arXiv:1608.03902",,,,cs.CL cs.CY cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During natural or man-made disasters, humanitarian response organizations
look for useful information to support their decision-making processes. Social
media platforms such as Twitter have been considered as a vital source of
useful information for disaster response and management. Despite advances in
natural language processing techniques, processing short and informal Twitter
messages is a challenging task. In this paper, we propose to use Deep Neural
Network (DNN) to address two types of information needs of response
organizations: 1) identifying informative tweets and 2) classifying them into
topical classes. DNNs use distributed representation of words and learn the
representation as well as higher level features automatically for the
classification task. We propose a new online algorithm based on stochastic
gradient descent to train DNNs in an online fashion during disaster situations.
We test our models using a crisis-related real-world Twitter dataset.
","[{'version': 'v1', 'created': 'Tue, 4 Oct 2016 14:53:51 GMT'}, {'version': 'v2', 'created': 'Wed, 5 Oct 2016 09:50:15 GMT'}]",2016-10-06,"[['Nguyen', 'Dat Tien', ''], ['Joty', 'Shafiq', ''], ['Imran', 'Muhammad', ''], ['Sajjad', 'Hassan', ''], ['Mitra', 'Prasenjit', '']]","['deep learning', 'supervised classification', 'twitter', 'text classification', 'crisis response']"
20190,1403.1430,Zhenfang Hu,"Zhenfang Hu, Gang Pan, Yueming Wang, and Zhaohui Wu",Sparse Principal Component Analysis via Rotation and Truncation,,,,,cs.LG cs.CV stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sparse principal component analysis (sparse PCA) aims at finding a sparse
basis to improve the interpretability over the dense basis of PCA, meanwhile
the sparse basis should cover the data subspace as much as possible. In
contrast to most of existing work which deal with the problem by adding some
sparsity penalties on various objectives of PCA, in this paper, we propose a
new method SPCArt, whose motivation is to find a rotation matrix and a sparse
basis such that the sparse basis approximates the basis of PCA after the
rotation. The algorithm of SPCArt consists of three alternating steps: rotate
PCA basis, truncate small entries, and update the rotation matrix. Its
performance bounds are also given. SPCArt is efficient, with each iteration
scaling linearly with the data dimension. It is easy to choose parameters in
SPCArt, due to its explicit physical explanations. Besides, we give a unified
view to several existing sparse PCA methods and discuss the connection with
SPCArt. Some ideas in SPCArt are extended to GPower, a popular sparse PCA
algorithm, to overcome its drawback. Experimental results demonstrate that
SPCArt achieves the state-of-the-art performance. It also achieves a good
tradeoff among various criteria, including sparsity, explained variance,
orthogonality, balance of sparsity among loadings, and computational speed.
","[{'version': 'v1', 'created': 'Thu, 6 Mar 2014 12:37:49 GMT'}, {'version': 'v2', 'created': 'Thu, 1 May 2014 04:05:18 GMT'}]",2014-05-02,"[['Hu', 'Zhenfang', ''], ['Pan', 'Gang', ''], ['Wang', 'Yueming', ''], ['Wu', 'Zhaohui', '']]","['sparse', 'principal component analysis', 'rotation', 'truncation']"
20191,1406.6266,Jonni Virtema,"Lauri Hella, Kerkko Luosto, Katsuhiko Sano and Jonni Virtema",The Expressive Power of Modal Dependence Logic,19 pages,,,,cs.LO math.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the expressive power of various modal logics with team semantics. We
show that exactly the properties of teams that are downward closed and closed
under team k-bisimulation, for some finite k, are definable in modal logic
extended with intuitionistic disjunction. Furthermore, we show that the
expressive power of modal logic with intuitionistic disjunction and extended
modal dependence logic coincide. Finally we establish that any translation from
extended modal dependence logic into modal logic with intuitionistic
disjunction increases the size of some formulas exponentially.
","[{'version': 'v1', 'created': 'Tue, 24 Jun 2014 14:52:46 GMT'}]",2014-06-25,"[['Hella', 'Lauri', ''], ['Luosto', 'Kerkko', ''], ['Sano', 'Katsuhiko', ''], ['Virtema', 'Jonni', '']]","['Modal dependence logic', 'team semantics', 'bisimulation', 'expressive power']"
20192,0801.3790,Khaled Elbassioni,"Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Hans Raj Tiwary","Characterization of the Vertices and Extreme Directions of the Negative
  Cycles Polyhedron and Hardness of Generating Vertices of 0/1-Polyhedra",Title typo fixed,,,,cs.CC cs.DM,,"  Given a graph $G=(V,E)$ and a weight function on the edges $w:E\mapsto\RR$,
we consider the polyhedron $P(G,w)$ of negative-weight flows on $G$, and get a
complete characterization of the vertices and extreme directions of $P(G,w)$.
As a corollary, we show that, unless $P=NP$, there is no output polynomial-time
algorithm to generate all the vertices of a 0/1-polyhedron. This strengthens
the NP-hardness result of Khachiyan et al. (2006) for non 0/1-polyhedra, and
comes in contrast with the polynomiality of vertex enumeration for
0/1-polytopes \cite{BL98} [Bussieck and L\""ubbecke (1998)].
","[{'version': 'v1', 'created': 'Thu, 24 Jan 2008 16:16:45 GMT'}, {'version': 'v2', 'created': 'Mon, 28 Apr 2008 17:26:09 GMT'}]",2008-04-28,"[['Boros', 'Endre', ''], ['Elbassioni', 'Khaled', ''], ['Gurvich', 'Vladimir', ''], ['Tiwary', 'Hans Raj', '']]","['Flow polytope', '0/1-polyhedron', 'vertex', 'extreme direction', 'enumeration problem', 'negative cycles', 'directed graph']"
20193,1111.1328,Qichun Wang,Xueying Duan and Qichun Wang,Two Classes of Crooked Multinomials Inequivalent to Power Functions,,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is known that crooked functions can be used to construct many interesting
combinatorial objects, and a quadratic function is crooked if and only if it is
almost perfect nonlinear (APN). In this paper, we introduce two infinite
classes of quadratic crooked multinomials on fields of order $2^{2m}$. One
class of APN functions constructed in [7] is a particular case of the one we
construct in Theorem 1. Moreover, we prove that the two classes of crooked
functions constructed in this paper are EA inequivalent to power functions and
conjecture that CCZ inequivalence between them also holds.
","[{'version': 'v1', 'created': 'Sat, 5 Nov 2011 16:46:19 GMT'}]",2011-11-08,"[['Duan', 'Xueying', ''], ['Wang', 'Qichun', '']]","['Crooked functions', 'almost perfect nonlinear', 'Bent functions', 'EA equivalence', 'CCZ inequivalence']"
20194,1407.2101,Michel A Westenberg,"Kasper Dinkla, Mohammed El-Kebir, Cristina-Iulia Bucur, Marco
  Siderius, Martine J. Smit, Michel A. Westenberg and Gunnar W. Klau",eXamine: Exploring annotated modules in networks,BioVis 2014 conference,,,,cs.CE cs.SI q-bio.QM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Background: Biological networks have a growing importance for the
interpretation of high-throughput omics data. Integrative network analysis
makes use of statistical and combinatorial methods to extract smaller
subnetwork modules, and performs enrichment analysis to annotate the modules
with ontology terms or other available knowledge. This process results in an
annotated module, which retains the original network structure and includes
enrichment information as a set system. A major bottleneck is a lack of tools
that allow exploring both network structure of extracted modules and its
annotations. Results:
Thispaperpresentsavisualanalysisapproachthattargetssmallmoduleswithmanyset-based
annotations, and which displays the annotations as contours on top of a
node-link diagram. We introduce an extension of self-organizing maps to lay out
nodes, links, and contours in a unified way. An implementation of this approach
is freely available as the Cytoscape app eXamine. Conclusions: eXamine
accurately conveys small and annotated modules consisting of several dozens of
proteins and annotations. We demonstrate that eXamine facilitates the
interpretation of integrative network analysis results in a guided case study.
This study has resulted in a novel biological insight regarding the
virally-encoded G-protein coupled receptor US28.
","[{'version': 'v1', 'created': 'Tue, 8 Jul 2014 14:21:23 GMT'}]",2014-07-23,"[['Dinkla', 'Kasper', ''], ['El-Kebir', 'Mohammed', ''], ['Bucur', 'Cristina-Iulia', ''], ['Siderius', 'Marco', ''], ['Smit', 'Martine J.', ''], ['Westenberg', 'Michel A.', ''], ['Klau', 'Gunnar W.', '']]","['Network analysis', 'Module', 'Set-based annotation', 'Visualization', 'Cytoscape']"
20195,1610.04660,Alexander Semenov,"Artem Mazeev, Alexander Semenov, Alexey Simonov",A Distributed Parallel Algorithm for Minimum Spanning Tree Problem,"11 pages, 5 figures, 2 tables",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present and evaluate a parallel algorithm for solving a
minimum spanning tree (MST) problem for supercomputers with distributed memory.
The algorithm relies on the relaxation of the message processing order
requirement for one specific message type compared to the original GHS
(Gallager, Humblet, Spira) algorithm. Our algorithm adopts hashing and message
compression optimization techniques as well. To the best of our knowledge, this
is the first parallel implementation of the GHS algorithm that linearly scales
to more than 32 nodes (256 cores) of Infiniband cluster.
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2016 22:09:13 GMT'}]",2016-10-18,"[['Mazeev', 'Artem', ''], ['Semenov', 'Alexander', ''], ['Simonov', 'Alexey', '']]","['large graphs', 'MST', 'GHS', 'supercomputers', 'MPI']"
20196,1209.1558,Nilanjan  Dey,"Nilanjan Dey, Pradipti Nandi, Nilanjana Barman, Debolina Das,
  Subhabrata Chakraborty","A Comparative Study between Moravec and Harris Corner Detection of Noisy
  Images Using Adaptive Wavelet Thresholding Technique","8 pages, 13 figures","International Journal of Engineering Research and Applications
  (IJERA) Vol. 2, Issue 1, Jan-Feb 2012, pp.599-606",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper a comparative study between Moravec and Harris Corner Detection
has been done for obtaining features required to track and recognize objects
within a noisy image. Corner detection of noisy images is a challenging task in
image processing. Natural images often get corrupted by noise during
acquisition and transmission. As Corner detection of these noisy images does
not provide desired results, hence de-noising is required. Adaptive wavelet
thresholding approach is applied for the same.
","[{'version': 'v1', 'created': 'Fri, 7 Sep 2012 14:52:02 GMT'}]",2012-09-10,"[['Dey', 'Nilanjan', ''], ['Nandi', 'Pradipti', ''], ['Barman', 'Nilanjana', ''], ['Das', 'Debolina', ''], ['Chakraborty', 'Subhabrata', '']]","['Wavelet', 'De-noising', 'Moravec Corner Detection', 'Harris Corner Detection', 'Bayes Soft threshold  I']"
20197,1401.2051,Agunbiade Olusanya  yinka,"Olusanya Y. Agunbiade, Tranos Zuva, Awosejo O. Johnson and Keneilwe
  Zuva","Enhancement performance of road recognition system of autonomous robots
  in shadow scenario","Signal & Image Processing : An International Journal (SIPIJ) Vol.4,
  No.6, December 2013",,,,cs.RO cs.CV,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Road region recognition is a main feature that is gaining increasing
attention from intellectuals because it helps autonomous vehicle to achieve a
successful navigation without accident. However, different techniques based on
camera sensor have been used by various researchers and outstanding results
have been achieved. Despite their success, environmental noise like shadow
leads to inaccurate recognition of road region which eventually leads to
accident for autonomous vehicle. In this research, we conducted an
investigation on shadow and its effects, optimized the road region recognition
system of autonomous vehicle by introducing an algorithm capable of detecting
and eliminating the effects of shadow. The experimental performance of our
system was tested and compared using the following schemes: Total Positive Rate
(TPR), False Negative Rate (FNR), Total Negative Rate (TNR), Error Rate (ERR)
and False Positive Rate (FPR). The performance result of the system improved on
road recognition in shadow scenario and this advancement has added tremendously
to successful navigation approaches for autonomous vehicle.
","[{'version': 'v1', 'created': 'Thu, 9 Jan 2014 16:09:57 GMT'}]",2014-01-10,"[['Agunbiade', 'Olusanya Y.', ''], ['Zuva', 'Tranos', ''], ['Johnson', 'Awosejo O.', ''], ['Zuva', 'Keneilwe', '']]","['Autonomous vehicle', 'Navigation', 'Shadow', 'Road region recognition', 'Environmental noise & Filtering algorithm']"
20198,0909.3127,Adrian Dumitrescu,Adrian Dumitrescu and Minghui Jiang,On the largest empty axis-parallel box amidst $n$ points,"19 pages, 2 figures",,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We give the first nontrivial upper and lower bounds on the maximum volume of
an empty axis-parallel box inside an axis-parallel unit hypercube in $\RR^d$
containing $n$ points. For a fixed $d$, we show that the maximum volume is of
the order $\Theta(\frac{1}{n})$. We then use the fact that the maximum volume
is $\Omega(\frac{1}{n})$ in our design of the first efficient
$(1-\eps)$-approximation algorithm for the following problem: Given an
axis-parallel $d$-dimensional box $R$ in $\RR^d$ containing $n$ points, compute
a maximum-volume empty axis-parallel $d$-dimensional box contained in $R$. The
running time of our algorithm is nearly linear in $n$, for small $d$, and
increases only by an $O(\log{n})$ factor when one goes up one dimension. No
previous efficient exact or approximation algorithms were known for this
problem for $d \geq 4$. As the problem has been recently shown to be NP-hard in
arbitrary high dimensions (i.e., when $d$ is part of the input), the existence
of efficient exact algorithms is unlikely.
  We also obtain tight estimates on the maximum volume of an empty
axis-parallel hypercube inside an axis-parallel unit hypercube in $\RR^d$
containing $n$ points. For a fixed $d$, this maximum volume is of the same
order order $\Theta(\frac{1}{n})$. A faster $(1-\eps)$-approximation algorithm,
with a milder dependence on $d$ in the running time, is obtained in this case.
","[{'version': 'v1', 'created': 'Wed, 16 Sep 2009 23:37:56 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Nov 2009 20:42:35 GMT'}]",2009-11-23,"[['Dumitrescu', 'Adrian', ''], ['Jiang', 'Minghui', '']]","['Largest empty box', 'largest empty hypercube', 'approximation algorithm']"
20199,1110.4723,Xinran He,"Xinran He, Guojie Song, Wei Chen, Qingye Jiang","Influence Blocking Maximization in Social Networks under the Competitive
  Linear Threshold Model Technical Report","Full version technical report of Paper ""Influence Blocking
  Maximization in Social Networks under the Competitive Linear Threshold Model""
  which has been submitted to SDM2012. 14 pages",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many real-world situations, different and often opposite opinions,
innovations, or products are competing with one another for their social
influence in a networked society. In this paper, we study competitive influence
propagation in social networks under the competitive linear threshold (CLT)
model, an extension to the classic linear threshold model. Under the CLT model,
we focus on the problem that one entity tries to block the influence
propagation of its competing entity as much as possible by strategically
selecting a number of seed nodes that could initiate its own influence
propagation. We call this problem the influence blocking maximization (IBM)
problem. We prove that the objective function of IBM in the CLT model is
submodular, and thus a greedy algorithm could achieve 1-1/e approximation
ratio. However, the greedy algorithm requires Monte-Carlo simulations of
competitive influence propagation, which makes the algorithm not efficient. We
design an efficient algorithm CLDAG, which utilizes the properties of the CLT
model, to address this issue. We conduct extensive simulations of CLDAG, the
greedy algorithm, and other baseline algorithms on real-world and synthetic
datasets. Our results show that CLDAG is able to provide best accuracy in par
with the greedy algorithm and often better than other algorithms, while it is
two orders of magnitude faster than the greedy algorithm.
","[{'version': 'v1', 'created': 'Fri, 21 Oct 2011 07:59:37 GMT'}]",2011-10-24,"[['He', 'Xinran', ''], ['Song', 'Guojie', ''], ['Chen', 'Wei', ''], ['Jiang', 'Qingye', '']]","['influence blocking maximization', 'competitive linearthreshold model', 'social networks']"
20200,1802.09647,Jiangjun Tang,"Jiangjun Tang, Eleni Petraki, and Hussein Abbass","Shaping Influence and Influencing Shaping: A Computational Red Teaming
  Trust-based Swarm Intelligence Model",,,,,cs.AI cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sociotechnical systems are complex systems, where nonlinear interaction among
different players can obscure causal relationships. The absence of mechanisms
to help us understand how to create a change in the system makes it hard to
manage these systems.
  Influencing and shaping are social operators acting on sociotechnical systems
to design a change. However, the two operators are usually discussed in an
ad-hoc manner, without proper guiding models and metrics which assist in
adopting these models successfully. Moreover, both social operators rely on
accurate understanding of the concept of trust. Without such understanding,
neither of these operators can create the required level to create a change in
a desirable direction.
  In this paper, we define these concepts in a concise manner suitable for
modelling the concepts and understanding their dynamics. We then introduce a
model for influencing and shaping and use Computational Red Teaming principles
to design and demonstrate how this model operates. We validate the results
computationally through a simulation environment to show social influencing and
shaping in an artificial society.
","[{'version': 'v1', 'created': 'Mon, 26 Feb 2018 23:53:40 GMT'}]",2018-02-28,"[['Tang', 'Jiangjun', ''], ['Petraki', 'Eleni', ''], ['Abbass', 'Hussein', '']]","['Influence', 'Shaping', 'Trust', 'Boids']"
20201,1010.0371,Anolan Milanes,"Anolan Milan\'es, Noemi Rodriguez, Roberto Ierusalimschy","Reflection-based language support for the heterogeneous capture and
  restoration of running computations","26 pages, 3 figures. Submitted to Computer Languages, Systems &
  Structures",,,,cs.PL cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work is devoted to the study of the problem of user-level capture and
restoration of running computations in heterogeneous environments. Support for
those operations has traditionally been offered through ready-made solutions
for specific applications, which are difficult to tailor or adapt to different
needs. We believe that a more promising approach would be to build specific
solutions as needed, over a more general framework for capture and restoration.
In this work, in order to explore the basic mechanisms a language should
provide to support the implementation of different policies, we extend the Lua
programming language with an API that allows the programmer to reify the
internal structures of execution into fine-grained language values.
","[{'version': 'v1', 'created': 'Sun, 3 Oct 2010 00:06:41 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Oct 2010 17:44:37 GMT'}]",2015-03-17,"[['Milanés', 'Anolan', ''], ['Rodriguez', 'Noemi', ''], ['Ierusalimschy', 'Roberto', '']]","['migration', 'persistence', 'computations', 'language support', 'reflexion', 'Lua']"
20202,1712.02982,Bob D. de Vos,"Bob D. de Vos, Nikolas Lessmann, Pim A. de Jong, Max A. Viergever,
  Ivana Isgum",Direct and Real-Time Cardiovascular Risk Prediction,Scientific paper at RSNA 2017,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Coronary artery calcium (CAC) burden quantified in low-dose chest CT is a
predictor of cardiovascular events. We propose an automatic method for CAC
quantification, circumventing intermediate segmentation of CAC. The method
determines a bounding box around the heart using a ConvNet for localization.
Subsequently, a dedicated ConvNet analyzes axial slices within the bounding
boxes to determine CAC quantity by regression. A dataset of 1,546 baseline CT
scans was used from the National Lung Screening Trial with manually identified
CAC. The method achieved an ICC of 0.98 between manual reference and
automatically obtained Agatston scores. Stratification of subjects into five
cardiovascular risk categories resulted in an accuracy of 85\% and Cohen's
linearly weighted $\kappa$ of 0.90. The results demonstrate that real-time
quantification of CAC burden in chest CT without the need for segmentation of
CAC is possible.
","[{'version': 'v1', 'created': 'Fri, 8 Dec 2017 08:53:09 GMT'}]",2017-12-11,"[['de Vos', 'Bob D.', ''], ['Lessmann', 'Nikolas', ''], ['de Jong', 'Pim A.', ''], ['Viergever', 'Max A.', ''], ['Isgum', 'Ivana', '']]","['cardiovascular risk', 'prediction', 'convolutional neural network', 'regression', 'low-dose chest CT']"
20203,0908.0175,Alex  Stewart,Alex A. Stewart and Marta F. Antoszkiewicz,BGP Route Analysis and Management Systems,"IEEE Proceedings of 5th International Conference on Information
  Technology",,,ITNG'08,cs.NI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Border Gateway Protocol (BGP) is an important component in today's IP
network infrastructure. As the main routing protocol of the Internet, clear
understanding of its dynamics is crucial for configuring, diagnosing and
debugging Internet routing problems. Despite the increase in the services that
BGP provide such as MPLS VPNs, there is no much progress achieved in automating
the BGP management tasks. In this paper we discuss some of the problems
encountered by network engineers when managing BGP networks. We also describe
some of the open source tools and methods that attempt to resolve these issues.
Then we present some of the features that, if implemented, will ease BGP
management related tasks.
","[{'version': 'v1', 'created': 'Mon, 3 Aug 2009 01:53:06 GMT'}]",2009-08-04,"[['Stewart', 'Alex A.', ''], ['Antoszkiewicz', 'Marta F.', '']]","['BGP', 'Internet Routing', 'Next Generation Internet Management', 'Open Source BGP Tools']"
20204,1610.03045,Jialei Wang,"Jialei Wang, Jason D. Lee, Mehrdad Mahdavi, Mladen Kolar, Nathan
  Srebro","Sketching Meets Random Projection in the Dual: A Provable Recovery
  Algorithm for Big and High-dimensional Data",,,,,cs.LG math.OC stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sketching techniques have become popular for scaling up machine learning
algorithms by reducing the sample size or dimensionality of massive data sets,
while still maintaining the statistical power of big data. In this paper, we
study sketching from an optimization point of view: we first show that the
iterative Hessian sketch is an optimization process with preconditioning, and
develop accelerated iterative Hessian sketch via the searching the conjugate
direction; we then establish primal-dual connections between the Hessian sketch
and dual random projection, and apply the preconditioned conjugate gradient
approach on the dual problem, which leads to the accelerated iterative dual
random projection methods. Finally to tackle the challenges from both large
sample size and high-dimensionality, we propose the primal-dual sketch, which
iteratively sketches the primal and dual formulations. We show that using a
logarithmic number of calls to solvers of small scale problem, primal-dual
sketch is able to recover the optimum of the original problem up to arbitrary
precision. The proposed algorithms are validated via extensive experiments on
synthetic and real data sets which complements our theoretical results.
","[{'version': 'v1', 'created': 'Mon, 10 Oct 2016 19:48:34 GMT'}]",2016-10-11,"[['Wang', 'Jialei', ''], ['Lee', 'Jason D.', ''], ['Mahdavi', 'Mehrdad', ''], ['Kolar', 'Mladen', ''], ['Srebro', 'Nathan', '']]","['Iterative Hessian Sketch', 'Dual Random Projection', 'Preconditioning', 'Primal-DualConversion', 'Acceleration', 'Conjugate Gradient', 'Primal-Dual Sketch']"
20205,1802.09296,Sherzod Hakimov,"Sherzod Hakimov, Soufian Jebbara, Philipp Cimiano","AMUSE: Multilingual Semantic Parsing for Question Answering over Linked
  Data","International Semantic Web Conference, 2017",,,,cs.AI cs.CL,http://creativecommons.org/publicdomain/zero/1.0/,"  The task of answering natural language questions over RDF data has received
wide interest in recent years, in particular in the context of the series of
QALD benchmarks. The task consists of mapping a natural language question to an
executable form, e.g. SPARQL, so that answers from a given KB can be extracted.
So far, most systems proposed are i) monolingual and ii) rely on a set of
hard-coded rules to interpret questions and map them into a SPARQL query. We
present the first multilingual QALD pipeline that induces a model from training
data for mapping a natural language question into logical form as probabilistic
inference. In particular, our approach learns to map universal syntactic
dependency representations to a language-independent logical form based on
DUDES (Dependency-based Underspecified Discourse Representation Structures)
that are then mapped to a SPARQL query as a deterministic second step. Our
model builds on factor graphs that rely on features extracted from the
dependency graph and corresponding semantic representations. We rely on
approximate inference techniques, Markov Chain Monte Carlo methods in
particular, as well as Sample Rank to update parameters using a ranking
objective. Our focus lies on developing methods that overcome the lexical gap
and present a novel combination of machine translation and word embedding
approaches for this purpose. As a proof of concept for our approach, we
evaluate our approach on the QALD-6 datasets for English, German & Spanish.
","[{'version': 'v1', 'created': 'Mon, 26 Feb 2018 13:50:14 GMT'}]",2018-02-27,"[['Hakimov', 'Sherzod', ''], ['Jebbara', 'Soufian', ''], ['Cimiano', 'Philipp', '']]","['question answering', 'multilinguality', 'QALD', 'probabilistic graphicalmodels', 'factor graphs']"
20206,1606.05477,Seyed Hossein Ahmadpanah,"Seyed Hossein Ahmadpanah, Abdullah Jafari Chashmi, Majidreza Yadollahi",4G Mobile Communication Systems: Key Technology and Evolution,"3rd National Conference on Computer Engineering and IT Management ,
  Tehran , June 02,2016",,,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  With the worldwide third-generation mobile communication system gradually
implemented, the future development of mobile communications has become a hot
topic and evolution of the problem. This paper introduces the fourth generation
mobile communication system and its performance and network structure and OFDM,
software defined radio, smart antennas, IPv6 and other key technologies, and
analyzes the relationship between 4G mobile communication system for mobile
communications and 3G, and the evolution of communication systems do Prospect.
","[{'version': 'v1', 'created': 'Fri, 17 Jun 2016 11:08:27 GMT'}]",2016-06-20,"[['Ahmadpanah', 'Seyed Hossein', ''], ['Chashmi', 'Abdullah Jafari', ''], ['Yadollahi', 'Majidreza', '']]","['component; 4G', '3G', 'OFDM', 'IPv6', 'Mobile Data', 'Smart Antenna']"
20207,1501.00067,Xiaoming Liu,"Xiaoming Liu, Yadong Zhou, Xiaohong Guan","A Feasible Graph Partition Framework for Random Walks Implemented by
  Parallel Computing in Big Graph",,,,,cs.SI cs.DC physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Graph partition is a fundamental problem of parallel computing for big graph
data. Many graph partition algorithms have been proposed to solve the problem
in various applications, such as matrix computations and PageRank, etc., but
none has pay attention to random walks. Random walks is a widely used method to
explore graph structure in lots of fields. The challenges of graph partition
for random walks include the large number of times of communication between
partitions, lots of replications of the vertices, unbalanced partition, etc. In
this paper, we propose a feasible graph partition framework for random walks
implemented by parallel computing in big graph. The framework is based on two
optimization functions to reduce the bandwidth, memory and storage cost in the
condition that the load balance is guaranteed. In this framework, several
greedy graph partition algorithms are proposed. We also propose five metrics
from different perspectives to evaluate the performance of these algorithms. By
running the algorithms on the big graph data set of real world, the
experimental results show that these algorithms in the framework are capable of
solving the problem of graph partition for random walks for different needs,
e.g. the best result is improved more than 70 times in reducing the times of
communication.
","[{'version': 'v1', 'created': 'Wed, 31 Dec 2014 03:02:56 GMT'}]",2015-01-05,"[['Liu', 'Xiaoming', ''], ['Zhou', 'Yadong', ''], ['Guan', 'Xiaohong', '']]","['Graph partition', 'parallel graph computing', 'big graph', 'random walks', 'optimization functions', 'metrics']"
20208,1004.1793,Rdv Ijcsis,"S.K. Nayak, S.B.Thorat, N.V. Kalyankar","GIS: Geographic Information System An application for socio-economical
  data collection for rural area","IEEE Publication format, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","IJCSIS, Vol. 7 No. 3, March 2010, 290-293",,,cs.CY,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The country India follows the planning through planning commission. This is
on the basis of information collected by traditional, tedious and manual method
which is too slow to sustain. Now we are in the age of 21th century. We have
seen in last few decades that the progress of information technology with leaps
and bounds, which have completely changed the way of life in the developed
nations. While internet has changed the established working practice and opened
new vistas and provided a platform to connect, this gives the opportunity for
collaborative work space that goes beyond the global boundary. We are living in
the global economy and India leading towards Liberalize Market Oriented Economy
(LMOE). Considering this things, focusing on GIS, we proposed a system for
collection of socio economic data and water resource management information of
rural area via internet.
","[{'version': 'v1', 'created': 'Sun, 11 Apr 2010 11:15:38 GMT'}]",2010-04-13,"[['Nayak', 'S. K.', ''], ['Thorat', 'S. B.', ''], ['Kalyankar', 'N. V.', '']]","['Cartography', 'photogrammetry', 'digital-divide', 'data capture']"
20209,1412.7782,Roshan Ragel,"MAC Jiffriya, MAC Akmal Jahan, and Roshan G. Ragel","Plagiarism Detection on Electronic Text based Assignments using Vector
  Space Model (ICIAfS14)","appears in The 7th International Conference on Information and
  Automation for Sustainability (ICIAfS) 2014",,,,cs.IR cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Plagiarism is known as illegal use of others' part of work or whole work as
one's own in any field such as art, poetry, literature, cinema, research and
other creative forms of study. Plagiarism is one of the important issues in
academic and research fields and giving more concern in academic systems. The
situation is even worse with the availability of ample resources on the web.
This paper focuses on an effective plagiarism detection tool on identifying
suitable intra-corpal plagiarism detection for text based assignments by
comparing unigram, bigram, trigram of vector space model with cosine similarity
measure. Manually evaluated, labelled dataset was tested using unigram, bigram
and trigram vector. Even though trigram vector consumes comparatively more
time, it shows better results with the labelled data. In addition, the selected
trigram vector space model with cosine similarity measure is compared with
tri-gram sequence matching technique with Jaccard measure. In the results,
cosine similarity score shows slightly higher values than the other. Because,
it focuses on giving more weight for terms that do not frequently exist in the
dataset and cosine similarity measure using trigram technique is more
preferable than the other. Therefore, we present our new tool and it could be
used as an effective tool to evaluate text based electronic assignments and
minimize the plagiarism among students.
","[{'version': 'v1', 'created': 'Thu, 25 Dec 2014 03:54:01 GMT'}]",2014-12-30,"[['Jiffriya', 'MAC', ''], ['Jahan', 'MAC Akmal', ''], ['Ragel', 'Roshan G.', '']]","['Jaccard similarity', 'plagiarism', 'vector space model']"
20210,1506.08473,Majid Janzamin,Majid Janzamin and Hanie Sedghi and Anima Anandkumar,"Beating the Perils of Non-Convexity: Guaranteed Training of Neural
  Networks using Tensor Methods","The tensor decomposition analysis is expanded, and the analysis of
  ridge regression is added for recovering the parameters of last layer of
  neural network",,,,cs.LG cs.NE stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Training neural networks is a challenging non-convex optimization problem,
and backpropagation or gradient descent can get stuck in spurious local optima.
We propose a novel algorithm based on tensor decomposition for guaranteed
training of two-layer neural networks. We provide risk bounds for our proposed
method, with a polynomial sample complexity in the relevant parameters, such as
input dimension and number of neurons. While learning arbitrary target
functions is NP-hard, we provide transparent conditions on the function and the
input for learnability. Our training method is based on tensor decomposition,
which provably converges to the global optimum, under a set of mild
non-degeneracy conditions. It consists of simple embarrassingly parallel linear
and multi-linear operations, and is competitive with standard stochastic
gradient descent (SGD), in terms of computational complexity. Thus, we propose
a computationally efficient method with guaranteed risk bounds for training
neural networks with one hidden layer.
","[{'version': 'v1', 'created': 'Sun, 28 Jun 2015 23:19:49 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Aug 2015 19:31:24 GMT'}, {'version': 'v3', 'created': 'Tue, 12 Jan 2016 03:19:42 GMT'}]",2016-01-13,"[['Janzamin', 'Majid', ''], ['Sedghi', 'Hanie', ''], ['Anandkumar', 'Anima', '']]","['neural networks', 'risk bound', 'method-of-moments', 'tensor decomposition']"
20211,1304.4303,Azza Abouzied,"Azza Abouzied and Dana Angluin and Christos Papadimitriou and Joseph
  M. Hellerstein and Avi Silberschatz",Learning and Verifying Quantified Boolean Queries by Example,Extended Version of PODS 2013 paper,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To help a user specify and verify quantified queries --- a class of database
queries known to be very challenging for all but the most expert users --- one
can question the user on whether certain data objects are answers or
non-answers to her intended query. In this paper, we analyze the number of
questions needed to learn or verify qhorn queries, a special class of Boolean
quantified queries whose underlying form is conjunctions of quantified Horn
expressions. We provide optimal polynomial-question and polynomial-time
learning and verification algorithms for two subclasses of the class qhorn with
upper constant limits on a query's causal density.
","[{'version': 'v1', 'created': 'Tue, 16 Apr 2013 00:21:25 GMT'}]",2013-04-17,"[['Abouzied', 'Azza', ''], ['Angluin', 'Dana', ''], ['Papadimitriou', 'Christos', ''], ['Hellerstein', 'Joseph M.', ''], ['Silberschatz', 'Avi', '']]","['quantified boolean queries', 'qhorn', 'query learning', 'query verification', 'example-driven synthesis']"
20212,1802.07187,Sajad Mousavi,"Sajad Mousavi, Fatemeh Afghah, Jonathan D. Ashdown and Kurt Turck","Leader-follower based Coalition Formation in Large-scale UAV Networks, A
  Quantum Evolutionary Approach",,,,,cs.MA cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of decentralized multiple Point of Interests (PoIs) detection and
associated task completion in an unknown environment with multiple
resource-constrained and self-interested Unmanned Aerial Vehicles (UAVs) is
studied. The UAVs form several coalitions to efficiently complete the compound
tasks which are impossible to be performed individually. The objectives of such
coalition formation are to firstly minimize resource consumption in completing
the encountered tasks on time, secondly to enhance the reliability of the
coalitions, and lastly in segregating the most trusted UAVs amid the self
interested of them. As many previous publications have merely focused on
minimizing costs, this study considers a multi-objective optimization coalition
formation problem that considers the three aforementioned objectives. In doing
so, a leader-follower- inspired coalition formation algorithm amalgamating the
three objectives to address the problem of the computational complexity of
coalition formation in large-scale UAV networks is proposed. This algorithm
attempts to form the coalitions with minimally exceeding the required resources
for the encountered tasks while maximizing the number of completed tasks. The
proposed algorithm is based on Quantum Evolutionary Algorithms(QEA) which are a
combination of quantum computing and evolutionary algorithms. Results from
simulations show that the proposed algorithm significantly outperforms the
existing coalition formation algorithms such as merge-and-split and a famous
multi-objective genetic algorithm called NSGA-II.
","[{'version': 'v1', 'created': 'Sun, 18 Feb 2018 04:05:41 GMT'}]",2018-02-21,"[['Mousavi', 'Sajad', ''], ['Afghah', 'Fatemeh', ''], ['Ashdown', 'Jonathan D.', ''], ['Turck', 'Kurt', '']]","['Unmanned aerial vehicles', 'coalition formation', 'mission completion', 'evolutionary algorithms']"
20213,1604.07138,Kenya Murase,Kenya Murase,"An integral-transform approach to the bioheat transfer problems in
  magnetic hyperthermia",,,,,cs.CE physics.med-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our purpose in this study was to present an integral-transform approach to
the analytical solutions of the Pennes's bioheat transfer equation and to apply
it to the calculation of temperature distribution in tissues in hyperthermia
with magnetic nanoparticles (magnetic hyperthermia). The validity of our method
was investigated by comparison with the analytical solutions obtained by the
Green's function method for point and shell heat sources and the numerical
solutions obtained by the finite-difference method for Gaussin-distributed and
step-function sources. There was good agreement between the radial profiles of
temperature calculated by our method and those obtained by the Green's function
method. There was also good agreement between our method and the
finite-difference method except for the central temperature for a step-function
source that had approximately a 0.3% difference. We also found that the
equations describing the steady-state solutions for point and shell sources
obtained by our method agreed with those obtained by the Green's function
method. These results appear to indicate the validity of our method. In
conclusion, we presented an integral-transform approach to the bioheat transfer
problems in magnetic hyperthermia, and this study demonstrated the validity of
our method. The analytical solutions presented in this study will be useful for
gaining some insight into the heat diffusion process during magnetic
hyperthermia, for testing numerical codes and/or more complcated approaches,
and for performing sensitivity analysis and optimization of the parameters that
affect the thermal diffusion process in magnetic hyperthermia.
","[{'version': 'v1', 'created': 'Mon, 25 Apr 2016 06:22:36 GMT'}, {'version': 'v2', 'created': 'Tue, 4 Feb 2020 09:49:31 GMT'}, {'version': 'v3', 'created': 'Wed, 5 Feb 2020 01:44:29 GMT'}, {'version': 'v4', 'created': 'Fri, 7 Feb 2020 02:26:24 GMT'}]",2020-02-10,"[['Murase', 'Kenya', '']]","['Magnetic hyperthermia', 'magnetic nanoparticle', ""Pennes' bioheat transfer""]"
20214,1610.04362,Peng Guan,"Peng Guan, Xi Zhang, Guangmei Ren, Tingjian Tian, Anass Benjebbour,
  Yuya Saito, Yoshihisa Kishiyama",Ultra-Low Latency for 5G - A Lab Trial,"5 pages, 9 figures, accepted in 27th IEEE International Symposium on
  Personal, Indoor and Mobile Radio Communications (PIMRC'16)",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we introduce a lab trial that is conducted to study the
feasibility of ultra-low latency for 5G. Using a novel frame structure and
signaling procedure, a stabilized 1.5 ms hybrid automatic repeat request (HARQ)
round trip time (RTT) is observed in lab trial as predicted in theory. The
achieved round trip time is around 5 times shorter compared with what is
supported by LTE-Advanced standard.
","[{'version': 'v1', 'created': 'Fri, 14 Oct 2016 08:19:14 GMT'}]",2016-10-17,"[['Guan', 'Peng', ''], ['Zhang', 'Xi', ''], ['Ren', 'Guangmei', ''], ['Tian', 'Tingjian', ''], ['Benjebbour', 'Anass', ''], ['Saito', 'Yuya', ''], ['Kishiyama', 'Yoshihisa', '']]","['5G', 'lab trial', 'low lateny', 'frame strucuture']"
20215,1505.06537,Manish Joshi,Manish R. Joshi and Varsha M. Pathak,A survey of SMS based Information Systems,17 pages 3 Figures 5 Tables,,,,cs.AI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Short Message Service (SMS) based Information Systems (SMSbIS) provide an
excellent alternative to a traditional approach of obtaining specific
information by direct (through phone) or indirect (IVRS, Web, Email) probing.
Information and communication technology and far reaching mobile penetration
has opened this new research trend Number of key players in Search industry
including Microsoft and Google are attracted by the expected increase in volume
of use of such applications. The wide range of applications and their public
acceptance has motivated researchers to work in this research domain. Several
applications such as SMS based information access using database management
services, SMS based information retrieval through internet (search engine), SMS
based information extraction, question answering, image retrieval etc. have
been emerged. With the aim to understand the functionality involved in these
systems, an extensive review of a few of these SMSbISs has been planned and
executed by us. These systems are classified into four categories based on the
objectives and domains of the applications. As a result of this study a well
structured functional model is presented here. The model is evaluated in
different dimensions, which is presented in this paper. In addition to this a
chronological progress with respect to research and development in this
upcoming field is compiled in this paper. Such an extensive review presented in
this paper would definitely help the researchers and developers to understand
the technical aspects of this field. The functional framework presented here
would be useful to the system designers to design and develop an SMS based
Information System of any specific domain.
","[{'version': 'v1', 'created': 'Fri, 22 May 2015 10:08:19 GMT'}]",2015-05-26,"[['Joshi', 'Manish R.', ''], ['Pathak', 'Varsha M.', '']]","['component -SMS based Information System', 'Information Retrieval', 'Functional Model', 'Function Point', 'M-Goveranance', 'Research Prototype', 'Research Models']"
20216,1312.3478,Ebrahim Nasrabadi,"Dimitris Bertsimas, Ebrahim Nasrabadi, James B.Orlin",On the power of randomization in network interdiction,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Network interdiction can be viewed as a game between two players, an
""interdictor"" and a ""flow player"". The flow player wishes to send as much
material as possible through a network, while the interdictor attempts to
minimize the amount of transported material by removing a certain number of
arcs, say $\Gamma$ arcs. We introduce the randomized network interdiction
problem that allows the interdictor to use randomness to select arcs to be
removed. We model the problem in two different ways: arc-based and path-based
formulations, depending on whether flows are defined on arcs or paths,
respectively. We present insights into the modeling power, complexity, and
approximability of both formulations. In particular, we prove that
$Z_{\text{NI}}/Z_{\text{RNI}}\leq \Gamma+1$,
$Z_{\text{NI}}/Z_{\text{RNI}}^{\text{Path}}\leq \Gamma+1$,
$Z_{\text{RNI}}/Z_{\text{RNI}}^{\text{Path}}\leq \Gamma$, where
$Z_{\text{NI}}$, $Z_{\text{RNI}}$, and $Z_{\text{RNI}}^{\text{Path}}$ are the
optimal values of the network interdiction problem and its randomized versions
in arc-based and path-based formulations, respectively. We also show that these
bounds are tight. We show that it is NP-hard to compute the values
$Z_{\text{RNI}}$ and $Z_{\text{RNI}}^{\text{Path}}$ for a general $\Gamma$, but
they are computable in polynomial time when $\Gamma=1$. Further, we provide a
$(\Gamma+1)$-approximation for $Z_{\text{NI}}$, a $\Gamma$-approximation for
$Z_{\text{RNI}}$, and a $\big(1+\lfloor \Gamma/2\rfloor \cdot \lceil
\Gamma/2\rceil/(\Gamma+1)\big)$-approximation for
$Z_{\text{RNI}}^{\text{Path}}$.
","[{'version': 'v1', 'created': 'Thu, 12 Dec 2013 13:38:00 GMT'}]",2013-12-13,"[['Bertsimas', 'Dimitris', ''], ['Nasrabadi', 'Ebrahim', ''], ['Orlin', 'James B.', '']]","['network flows', 'interdiction', 'game theory', 'approximation']"
20217,1510.07565,Andreas Pavlogiannis,"Krishnendu Chatterjee and Amir Kafshdar Goharshady and Rasmus
  Ibsen-Jensen and Andreas Pavlogiannis","Algorithms for Algebraic Path Properties in Concurrent Systems of
  Constant Treewidth Components",,,,,cs.PL cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study algorithmic questions for concurrent systems where the transitions
are labeled from a complete, closed semiring, and path properties are algebraic
with semiring operations. The algebraic path properties can model dataflow
analysis problems, the shortest path problem, and many other natural problems
that arise in program analysis. We consider that each component of the
concurrent system is a graph with constant treewidth, a property satisfied by
the controlflow graphs of most programs. We allow for multiple possible
queries, which arise naturally in demand driven dataflow analysis. The study of
multiple queries allows us to consider the tradeoff between the resource usage
of the one-time preprocessing and for each individual query. The traditional
approach constructs the product graph of all components and applies the
best-known graph algorithm on the product. In this approach, even the answer to
a single query requires the transitive closure, which provides no room for
tradeoff between preprocessing and query time.
  Our main contributions are algorithms that significantly improve the
worst-case running time of the traditional approach, and provide various
tradeoffs depending on the number of queries. For example, in a concurrent
system of two components, the traditional approach requires hexic time in the
worst case for answering one query as well as computing the transitive closure,
whereas we show that with one-time preprocessing in almost cubic time, each
subsequent query can be answered in at most linear time, and even the
transitive closure can be computed in almost quartic time. Furthermore, we
establish conditional optimality results showing that the worst-case running
time of our algorithms cannot be improved without achieving major breakthroughs
in graph algorithms.
","[{'version': 'v1', 'created': 'Mon, 26 Oct 2015 17:50:00 GMT'}]",2015-11-27,"[['Chatterjee', 'Krishnendu', ''], ['Goharshady', 'Amir Kafshdar', ''], ['Ibsen-Jensen', 'Rasmus', ''], ['Pavlogiannis', 'Andreas', '']]","['Concurrent systems', 'Constant-treewidth graphs', 'Algebraic path properties', 'Shortest path']"
20218,1412.2824,Yu Zhang,"Vignesh Narayanan, Yu Zhang, Nathaniel Mendoza and Subbarao
  Kambhampati",Plan or not: Remote Human-robot Teaming with Incomplete Task Information,,,,,cs.AI cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Human-robot interaction can be divided into two categories based on the
physical distance between the human and robot: remote and proximal. In proximal
interaction, the human and robot often engage in close coordination; in remote
interaction, the human and robot are less coupled due to communication
constraints. As a result, providing automation for the robot in remote
interaction becomes more important. Thus far, human factor studies on
automation in remote human-robot interaction have been restricted to various
forms of supervision, in which the robot is essentially being used as a smart
mobile manipulation platform with sensing capabilities. In this paper, we
investigate the incorporation of general planning capability into the robot to
facilitate peer-to-peer human-robot teaming, in which the human and robot are
viewed as teammates that are physically separated. The human and robot share
the same global goal and collaborate to achieve it. Note that humans may feel
uncomfortable at such robot autonomy, which can potentially reduce teaming
performance. One important difference between peer-to-peer teaming and
supervised teaming is that an autonomous robot in peer-to-peer teaming can
achieve the goal alone when the task information is completely specified.
However, incompleteness often exists, which implies information asymmetry.
While information asymmetry can be desirable sometimes, it may also lead to the
robot choosing improper actions that negatively influence the teaming
performance. We aim to investigate the various trade-offs, e.g., mental
workload and situation awareness, between these two types of remote human-robot
teaming.
","[{'version': 'v1', 'created': 'Tue, 9 Dec 2014 01:05:59 GMT'}]",2014-12-10,"[['Narayanan', 'Vignesh', ''], ['Zhang', 'Yu', ''], ['Mendoza', 'Nathaniel', ''], ['Kambhampati', 'Subbarao', '']]","['Robot design principles', 'Autonomous robot capabilities', 'Userstudy/Evaluation']"
20219,1610.01247,Nikhil Krishnaswamy,"Tuan Do, Nikhil Krishnaswamy, James Pustejovsky",ECAT: Event Capture Annotation Tool,"4 pages, 4 figures, ISA workshop 2015",,,,cs.CL cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces the Event Capture Annotation Tool (ECAT), a
user-friendly, open-source interface tool for annotating events and their
participants in video, capable of extracting the 3D positions and orientations
of objects in video captured by Microsoft's Kinect(R) hardware. The modeling
language VoxML (Pustejovsky and Krishnaswamy, 2016) underlies ECAT's object,
program, and attribute representations, although ECAT uses its own spec for
explicit labeling of motion instances. The demonstration will show the tool's
workflow and the options available for capturing event-participant relations
and browsing visual data. Mapping ECAT's output to VoxML will also be
addressed.
","[{'version': 'v1', 'created': 'Wed, 5 Oct 2016 01:24:42 GMT'}]",2016-10-06,"[['Do', 'Tuan', ''], ['Krishnaswamy', 'Nikhil', ''], ['Pustejovsky', 'James', '']]","['event capture', 'event annotation', 'motion capture']"
20220,1704.08035,Adriana Fernandez Lopez,Adriana Fernandez-Lopez and Federico M. Sukno,"Automatic Viseme Vocabulary Construction to Enhance Continuous
  Lip-reading","International Conference on Computer Vision Theory and Applications
  (VISAPP 2017)",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Speech is the most common communication method between humans and involves
the perception of both auditory and visual channels. Automatic speech
recognition focuses on interpreting the audio signals, but it has been
demonstrated that video can provide information that is complementary to the
audio. Thus, the study of automatic lip-reading is important and is still an
open problem. One of the key challenges is the definition of the visual
elementary units (the visemes) and their vocabulary. Many researchers have
analyzed the importance of the phoneme to viseme mapping and have proposed
viseme vocabularies with lengths between 11 and 15 visemes. These viseme
vocabularies have usually been manually defined by their linguistic properties
and in some cases using decision trees or clustering techniques. In this work,
we focus on the automatic construction of an optimal viseme vocabulary based on
the association of phonemes with similar appearance. To this end, we construct
an automatic system that uses local appearance descriptors to extract the main
characteristics of the mouth region and HMMs to model the statistic relations
of both viseme and phoneme sequences. To compare the performance of the system
different descriptors (PCA, DCT and SIFT) are analyzed. We test our system in a
Spanish corpus of continuous speech. Our results indicate that we are able to
recognize approximately 58% of the visemes, 47% of the phonemes and 23% of the
words in a continuous speech scenario and that the optimal viseme vocabulary
for Spanish is composed by 20 visemes.
","[{'version': 'v1', 'created': 'Wed, 26 Apr 2017 09:34:59 GMT'}]",2017-04-27,"[['Fernandez-Lopez', 'Adriana', ''], ['Sukno', 'Federico M.', '']]","['Lip-reading', 'Speech Recognition', 'Visemes', 'Confusion Matrix']"
20221,1212.0823,Loet Leydesdorff,Loet Leydesdorff and Robert L. Goldstone,"Interdisciplinarity at the Journal and Specialty Level: The changing
  knowledge bases of the journal Cognitive Science","Journal of the American Society for Information Science and
  Technology (JASIST), in press",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Using the referencing patterns in articles in Cognitive Science over three
decades, we analyze the knowledge base of this literature in terms of its
changing disciplinary composition. Three periods are distinguished: (1)
construction of the interdisciplinary space in the 1980s; (2) development of an
interdisciplinary orientation in the 1990s; (3) reintegration into ""cognitive
psychology"" in the 2000s. The fluidity and fuzziness of the interdisciplinary
delineations in the different visualizations can be reduced and clarified using
factor analysis. We also explore newly available routines (""CorText"") to
analyze this development in terms of ""tubes"" using an alluvial map, and compare
the results with an animation (using ""visone""). The historical specificity of
this development can be compared with the development of ""artificial
intelligence"" into an integrated specialty during this same period.
""Interdisciplinarity"" should be defined differently at the level of journals
and of specialties.
","[{'version': 'v1', 'created': 'Tue, 4 Dec 2012 19:02:40 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Dec 2012 08:32:51 GMT'}, {'version': 'v3', 'created': 'Sat, 16 Feb 2013 15:34:00 GMT'}]",2013-02-19,"[['Leydesdorff', 'Loet', ''], ['Goldstone', 'Robert L.', '']]","['journal', 'interdisciplinarity', 'evolution', 'specialty', 'cognitive science', 'CorText']"
20222,1004.3274,Vishal Goyal,"Kamal Sarkar, Mita Nasipuri, Suranjan Ghose",A New Approach to Keyphrase Extraction Using Neural Networks,"International Journal of Computer Science Issues online at
  http://ijcsi.org/articles/A-New-Approach-to-Keyphrase-Extraction-Using-Neural-Networks.php","IJCSI, Volume 7, Issue 2, March 2010",,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Keyphrases provide a simple way of describing a document, giving the reader
some clues about its contents. Keyphrases can be useful in a various
applications such as retrieval engines, browsing interfaces, thesaurus
construction, text mining etc.. There are also other tasks for which keyphrases
are useful, as we discuss in this paper. This paper describes a neural network
based approach to keyphrase extraction from scientific articles. Our results
show that the proposed method performs better than some state-of-the art
keyphrase extraction approaches.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2010 18:24:02 GMT'}]",2010-04-20,"[['Sarkar', 'Kamal', ''], ['Nasipuri', 'Mita', ''], ['Ghose', 'Suranjan', '']]","['Keyphrase Extraction', 'Neural Networks', 'Text Mining']"
20223,1705.09451,Biswa Sengupta,Y Qian and P Giaccone and M Sasdelli and E Vasquez and B Sengupta,"Algorithmic clothing: hybrid recommendation, from street-style-to-shop",KDD 2017 Workshop on ML meets Fashion,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we detail Cortexica's (https://www.cortexica.com)
recommendation framework -- particularly, we describe how a hybrid visual
recommender system can be created by combining conditional random fields for
segmentation and deep neural networks for object localisation and feature
representation. The recommendation system that is built after localisation,
segmentation and classification has two properties -- first, it is knowledge
based in the sense that it learns pairwise preference/occurrence matrix by
utilising knowledge from experts (images from fashion blogs) and second, it is
content-based as it utilises a deep learning based framework for learning
feature representation. Such a construct is especially useful when there is a
scarcity of user preference data, that forms the foundation of many
collaborative recommendation algorithms.
","[{'version': 'v1', 'created': 'Fri, 26 May 2017 06:43:47 GMT'}, {'version': 'v2', 'created': 'Sun, 12 Nov 2017 09:45:36 GMT'}]",2017-11-15,"[['Qian', 'Y', ''], ['Giaccone', 'P', ''], ['Sasdelli', 'M', ''], ['Vasquez', 'E', ''], ['Sengupta', 'B', '']]","['computer vision', 'deep learning', 'GPU', 'recommendation system']"
20224,1505.06865,Maria Potop-Butucaru,"Silvia Bonomi (MIDLAB), Antonella Del Pozzo (MIDLAB, NPA), Maria
  Potop-Butucaru (NPA)",Tight Mobile Byzantine Tolerant Atomic Storage,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes the first implementation of an atomic storage tolerant to
mobile Byzantine agents. Our implementation is designed for the round-based
synchronous model where the set of Byzantine nodes changes from round to round.
In this model we explore the feasibility of multi-writer multi-reader atomic
register prone to various mobile Byzantine behaviors. We prove upper and lower
bounds for solving the atomic storage in all the explored models. Our results,
significantly different from the static case, advocate for a deeper study of
the main building blocks of distributed computing while the system is prone to
mobile Byzantine failures.
","[{'version': 'v1', 'created': 'Tue, 26 May 2015 09:15:31 GMT'}]",2015-05-27,"[['Bonomi', 'Silvia', '', 'MIDLAB'], ['Del Pozzo', 'Antonella', '', 'MIDLAB, NPA'], ['Potop-Butucaru', 'Maria', '', 'NPA']]","['Atomic Storage', 'Byzantine mobile agents', 'Round-based Computation']"
20225,1402.7118,Michael Clear,Michael Clear and Constantinos Patsakis and Paul Laird,"Lightweight Self-Bootstrapping Multiparty Computations of Time-Series
  Data with Custom Collusion Tolerance","preprint, 14 pages",,,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In this work we compare two recent multiparty computation (MPC) protocols for
private summation in terms of performance. Both protocols allow multiple rounds
of aggregation from the same set of public keys generated by parties in an
initial stage. We instantiate the protocols with a fast elliptic curve and
provide an experimental comparison of their performance for different phases of
the protocol. Furthermore, we introduce a technique that allows the
computational load of both protocols to be reduced at the expense of protection
against collusion tolerance. We prove that both protocols remain secure with
this technique, and evaluate its impact on collusion tolerance and the number
of rounds supported.
","[{'version': 'v1', 'created': 'Fri, 28 Feb 2014 01:37:33 GMT'}]",2014-03-03,"[['Clear', 'Michael', ''], ['Patsakis', 'Constantinos', ''], ['Laird', 'Paul', '']]","['multiparty computation', 'private summation', 'custom collusion tolerance', 'private aggregation']"
20226,1609.02031,Nhien-An Le-Khac,"Nhien-An Le-Khac, Sammer Markos, Michael O'Neill, Anthony Brabazon and
  Tahar Kechadi","An efficient Search Tool for an Anti-Money Laundering Application of an
  Multi-national Bank's Dataset",,,,,cs.DB cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Today, money laundering (ML) poses a serious threat not only to financial
institutions but also to the nations. This criminal activity is becoming more
and more sophisticated and seems to have moved from the clichy of drug
trafficking to financing terrorism and surely not forgetting personal gain.
Most of the financial institutions internationally have been implementing
anti-money laundering solutions (AML) to fight investment fraud activities. In
AML, the customer identification is an important task which helps AML experts
to monitor customer habits: some being customer domicile, transactions that
they are involved in etc. However, simple query tools provided by current DBMS
as well as naive approaches in customer searching may produce incorrect and
ambiguous results and their processing time is also very high due to the
complexity of the database system architecture. In this paper, we present a new
approach for identifying customers registered in an investment bank. This
approach is developed as a tool that allows AML experts to quickly identify
customers who are managed independently across separate databases. It is tested
on real-world datasets, which are real and large financial datasets. Some
preliminary experimental results show that this new approach is efficient and
effective.
","[{'version': 'v1', 'created': 'Sun, 4 Sep 2016 20:17:45 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Mar 2017 21:30:08 GMT'}]",2017-03-30,"[['Le-Khac', 'Nhien-An', ''], ['Markos', 'Sammer', ''], [""O'Neill"", 'Michael', ''], ['Brabazon', 'Anthony', ''], ['Kechadi', 'Tahar', '']]","['Anti-Money laundering', 'customer identification', 'search algorithms', 'tree topology', 'inverted list']"
20227,1206.5157,Vini Katyal,"Vini Katyal, Aviral","Leaf vein segmentation using Odd Gabor filters and morphological
  operations","International Journal of Advanced Research in Computer Science Volume
  3, No. 3, May-June 2012",,,,cs.CV cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Leaf vein forms the basis of leaf characterization and classification.
Different species have different leaf vein patterns. It is seen that leaf vein
segmentation will help in maintaining a record of all the leaves according to
their specific pattern of veins thus provide an effective way to retrieve and
store information regarding various plant species in database as well as
provide an effective means to characterize plants on the basis of leaf vein
structure which is unique for every species. The algorithm proposes a new way
of segmentation of leaf veins with the use of Odd Gabor filters and the use of
morphological operations for producing a better output. The Odd Gabor filter
gives an efficient output and is robust and scalable as compared with the
existing techniques as it detects the fine fiber like veins present in leaves
much more efficiently.
","[{'version': 'v1', 'created': 'Fri, 22 Jun 2012 14:22:16 GMT'}]",2012-06-25,"[['Katyal', 'Vini', ''], ['Aviral', '', '']]","['Leaf vein detection', 'Gabor filter', 'Morphology']"
20228,1305.6123,Murali Kalyan mr,S.M.M.M Kalyan kumar and Dr S C Pradhan,Building Internal Cloud at NIC : A Preview,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The most of computing environments in the IT support organization like NIC
are designed to run in centralized datacentre. The centralized infrastructure
of various development projects are used to deploy their services on it and
connecting remotely to that datacentre from all the stations of organization.
Currently these servers are mostly underutilized due to the static and
conventional approaches used for accessing and utilizing of these resources.
The cloud patterns is much needful for optimizing resource utilization and
reducing the investments on unnecessary costs. So, we build up and prototyped a
private cloud system called nIC(NIC Internal Cloud) to leverage the benefits of
cloud environment. For this system we adopted the combination of various
techniques from open source software community. The user-base of nIC consists
developers, web and database admins, service providers and desktop users from
various projects in NIC. We can optimize the resource usage by customizing the
user based template services on these virtualized infrastructure. It will also
increases the flexibility of the managing and maintenance of the operations
like archiving, disaster recovery and scaling of resources. The open-source
approach is further decreases the enterprise costs. In this paper, we describe
the design and analysis of implementing issues on internal cloud environments
in NIC and similar organizations.
","[{'version': 'v1', 'created': 'Mon, 27 May 2013 06:35:01 GMT'}]",2013-05-28,"[['kumar', 'S. M. M. M Kalyan', ''], ['Pradhan', 'Dr S C', '']]","['Open Source', 'Private Cloud', 'Virtualization', 'Authentication']"
20229,0806.1156,Cnrs : Umr 6057 Laboratoire Parole Et Langage,"Irina Nesterenko (LPL), St\'ephane Rauzy (LPL)","Utilisation des grammaires probabilistes dans les t\^aches de
  segmentation et d'annotation prosodique",,"Journ\'ees d'Etudes sur la Parole, Avignon : France (2008)",,3267,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nous pr\'esentons dans cette contribution une approche \`a la fois symbolique
et probabiliste permettant d'extraire l'information sur la segmentation du
signal de parole \`a partir d'information prosodique. Nous utilisons pour ce
faire des grammaires probabilistes poss\'edant une structure hi\'erarchique
minimale. La phase de construction des grammaires ainsi que leur pouvoir de
pr\'ediction sont \'evalu\'es qualitativement ainsi que quantitativement.
  -----
  Methodologically oriented, the present work sketches an approach for prosodic
information retrieval and speech segmentation, based on both symbolic and
probabilistic information. We have recourse to probabilistic grammars, within
which we implement a minimal hierarchical structure. Both the stages of
probabilistic grammar building and its testing in prediction are explored and
quantitatively and qualitatively evaluated.
","[{'version': 'v1', 'created': 'Fri, 6 Jun 2008 13:33:31 GMT'}]",2008-12-18,"[['Nesterenko', 'Irina', '', 'LPL'], ['Rauzy', 'Stéphane', '', 'LPL']]","['speech segmentation', 'probabilistic grammars', 'patterns model', 'hierarchical structure']"
20230,1205.7041,Stefan Kiefer,Stefan Kiefer,BPA Bisimilarity is EXPTIME-hard,"technical report for a an article that is to appear in Information
  Processing Letters. The present version takes into account improvements
  prompted by the journal's reviewers",,,,cs.FL cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a basic process algebra (BPA) and two stack symbols, the BPA
bisimilarity problem asks whether the two stack symbols are bisimilar. We show
that this problem is EXPTIME-hard.
","[{'version': 'v1', 'created': 'Thu, 31 May 2012 16:43:21 GMT'}, {'version': 'v2', 'created': 'Mon, 3 Dec 2012 14:42:40 GMT'}]",2012-12-04,"[['Kiefer', 'Stefan', '']]","['basic process algebra', 'bisimilarity', 'computational complexity']"
20231,1312.4986,Michael Smith,Michael R. Smith and Tony Martinez,"A Comparative Evaluation of Curriculum Learning with Filtering and
  Boosting","19 pages, 2 figures, 6 tables",,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Not all instances in a data set are equally beneficial for inferring a model
of the data. Some instances (such as outliers) are detrimental to inferring a
model of the data. Several machine learning techniques treat instances in a
data set differently during training such as curriculum learning, filtering,
and boosting. However, an automated method for determining how beneficial an
instance is for inferring a model of the data does not exist. In this paper, we
present an automated method that orders the instances in a data set by
complexity based on the their likelihood of being misclassified (instance
hardness). The underlying assumption of this method is that instances with a
high likelihood of being misclassified represent more complex concepts in a
data set. Ordering the instances in a data set allows a learning algorithm to
focus on the most beneficial instances and ignore the detrimental ones. We
compare ordering the instances in a data set in curriculum learning, filtering
and boosting. We find that ordering the instances significantly increases
classification accuracy and that filtering has the largest impact on
classification accuracy. On a set of 52 data sets, ordering the instances
increases the average accuracy from 81% to 84%.
","[{'version': 'v1', 'created': 'Tue, 17 Dec 2013 22:12:52 GMT'}]",2013-12-19,"[['Smith', 'Michael R.', ''], ['Martinez', 'Tony', '']]","['curriculum learning', 'instance hardness', 'outlier filtering', 'boosting']"
20232,1702.01018,Joydeep Banerjee,"Joydeep Banerjee, Chenyang Zhou, and Arunabha Sen",On Robustness in Multilayer Interdependent Network,CRITIS 2015,,,,cs.NI cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Critical Infrastructures like power and communication networks are highly
interdependent on each other for their full functionality. Many significant
research have been pursued to model the interdependency and failure analysis of
these interdependent networks. However, most of these models fail to capture
the complex interdependencies that might actually exist between the
infrastructures. The \emph{Implicative Interdependency Model} that utilizes
Boolean Logic to capture complex interdependencies was recently proposed which
overcome the limitations of the existing models. A number of problems were
studies based on this model. In this paper we study the \textit{Robustness}
problem in Interdependent Power and Communication Network. The robustness is
defined with respect to two parameters $K \in I^{+} \cup \{0\}$ and $\rho \in
(0,1]$. We utilized the \emph{Implicative Interdependency Model} model to
capture the complex interdependency between the two networks. The model
classifies the interdependency relations into four cases. Computational
complexity of the problem is analyzed for each of these cases. A polynomial
time algorithm is designed for the first case that outputs the optimal
solution. All the other cases are proved to be NP-complete. An
in-approximability bound is provided for the third case. For the general case
we formulate an Integer Linear Program to get the optimal solution and a
polynomial time heuristic. The applicability of the heuristic is evaluated
using power and communication network data of Maricopa County, Arizona. The
experimental results showed that the heuristic almost always produced near
optimal value of parameter $K$ for $\rho < 0.42$.
","[{'version': 'v1', 'created': 'Tue, 24 Jan 2017 23:01:34 GMT'}]",2017-02-06,"[['Banerjee', 'Joydeep', ''], ['Zhou', 'Chenyang', ''], ['Sen', 'Arunabha', '']]","['Implicative Interdependency Model', 'Interdependent Networks', 'Robustness']"
20233,1602.06136,Mazen Alsarem,"Mazen Alsarem (DRIM), Pierre-Edouard Portier (DRIM), Sylvie Calabretto
  (DRIM), Harald Kosch","Ordonnancement d'entit\'es pour la rencontre du web des documents et du
  web des donn\'ees","in French, Revue des Sciences et Technologies de l'Information -
  S{\'e}rie Document Num\'erique, Lavoisier, 2015, Nouvelles approches en
  recherche d'information, 18 (2-3/2015 ), pp.123-154",,,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The advances of the Linked Open Data (LOD) initiative are giving rise to a
more structured web of data. Indeed, a few datasets act as hubs (e.g., DBpedia)
connecting many other datasets. They also made possible new web services for
entity detection inside plain text (e.g., DBpedia Spotlight), thus allowing for
new applications that will benefit from a combination of the web of documents
and the web of data. To ease the emergence of these new use-cases, we propose a
query-biased algorithm for the ranking of entities detected inside a web page.
Our algorithm combine link analysis with dimensionality reduction. We use
crowdsourcing for building a publicly available and reusable dataset on which
we compare our algorithm to the state of the art. Finally, we use this
algorithm for the construction of semantic snippets for which we evaluate the
usability and the usefulness with a crowdsourcing-based approach.
","[{'version': 'v1', 'created': 'Fri, 19 Feb 2016 13:05:42 GMT'}]",2016-02-22,"[['Alsarem', 'Mazen', '', 'DRIM'], ['Portier', 'Pierre-Edouard', '', 'DRIM'], ['Calabretto', 'Sylvie', '', 'DRIM'], ['Kosch', 'Harald', '']]","['web of data', 'entity ranking', 'semantic snippets']"
20234,1412.5334,Vasile Patrascu,"Vasile Patrascu, Vasile Buzuloiu","The Affine Transforms for Image Enhancement in the Context of
  Logarithmic Models","International Conference on Computer Vision and Graphics, ICCVG2002,
  25-29 September, 2002, Zakopane, Poland",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The logarithmic model offers new tools for image processing. An efficient
method for image enhancement is to use an affine transformation with the
logarithmic operations: addition and scalar multiplication. We define some
criteria for automatically determining the parameters of the processing and
this is done via mean and variance computed by logarithmic operations.
","[{'version': 'v1', 'created': 'Wed, 17 Dec 2014 10:58:46 GMT'}]",2014-12-18,"[['Patrascu', 'Vasile', ''], ['Buzuloiu', 'Vasile', '']]","['logarithmic image processing', 'image enhancement', 'affine transforms']"
20235,1704.07244,Jieqing Jiao Jieqing Jiao,Jieqing Jiao and Sebastien Ourselin,"Fast PET reconstruction using Multi-scale Fully Convolutional Neural
  Networks",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Reconstruction of PET images is an ill-posed inverse problem and often
requires iterative algorithms to achieve good image quality for reliable
clinical use in practice, at huge computational costs. In this paper, we
consider the PET reconstruction a dense prediction problem where the large
scale contextual information is essential, and propose a novel architecture of
multi-scale fully convolutional neural networks (msfCNN) for fast PET image
reconstruction. The proposed msfCNN gains large receptive fields with both
memory and computational efficiency, by using a downscaling-upscaling structure
and dilated convolutions. Instead of pooling and deconvolution, we propose to
use the periodic shuffling operation from sub-pixel convolution and its inverse
to scale the size of feature maps without losing resolution. Residual
connections were added to improve training. We trained the proposed msfCNN
model with simulated data, and applied it to clinical PET data acquired on a
Siemens mMR scanner. The results from real oncological and neurodegenerative
cases show that the proposed msfCNN-based reconstruction outperforms the
iterative approaches in terms of computational time while achieving comparable
image quality for quantification. The proposed msfCNN model can be applied to
other dense prediction tasks, and fast msfCNN-based PET reconstruction could
facilitate the potential use of molecular imaging in interventional/surgical
procedures, where cancer surgery can particularly benefit.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 14:09:22 GMT'}]",2017-04-25,"[['Jiao', 'Jieqing', ''], ['Ourselin', 'Sebastien', '']]","['Image reconstruction', 'fully convolutional neural networks', 'periodic shuffling', 'dilated convolution', 'residual network', 'PET']"
20236,1106.3876,Amandine Bellenger,"Amandine Bellenger (LITIS), Sylvain Gatepaille","Uncertainty in Ontologies: Dempster-Shafer Theory for Data Fusion
  Applications","Workshop on Theory of Belief Functions, Brest: France (2010)",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays ontologies present a growing interest in Data Fusion applications.
As a matter of fact, the ontologies are seen as a semantic tool for describing
and reasoning about sensor data, objects, relations and general domain
theories. In addition, uncertainty is perhaps one of the most important
characteristics of the data and information handled by Data Fusion. However,
the fundamental nature of ontologies implies that ontologies describe only
asserted and veracious facts of the world. Different probabilistic, fuzzy and
evidential approaches already exist to fill this gap; this paper recaps the
most popular tools. However none of the tools meets exactly our purposes.
Therefore, we constructed a Dempster-Shafer ontology that can be imported into
any specific domain ontology and that enables us to instantiate it in an
uncertain manner. We also developed a Java application that enables reasoning
about these uncertain ontological instances.
","[{'version': 'v1', 'created': 'Mon, 20 Jun 2011 12:05:20 GMT'}]",2011-06-21,"[['Bellenger', 'Amandine', '', 'LITIS'], ['Gatepaille', 'Sylvain', '']]","['ontologies', 'uncertainty', 'belief functions', 'data fusion']"
20237,1403.7987,Sergey Nikolaev,Sergei Nikolaev,"Implementation of interaction between soft tissues and foreign bodies
  using modified voxel model","5 pages, 9 figures",Journal Computer Tools in Education. 3 (2013) 28-32,,,cs.CG cs.GR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Interactive bodies collision detection and elimination is one of the most
popular task nowadays. Collisions can be detected in different ways. Collision
search using space voxelization is one of the most fast. This paper describes
improved voxel model that covers only area of collision interest and quickly
eliminates collisions. This new method can be useful in real time collision
processing of different rigid and soft bodies grids.
","[{'version': 'v1', 'created': 'Mon, 31 Mar 2014 13:20:53 GMT'}]",2014-04-01,"[['Nikolaev', 'Sergei', '']]","['voxel model', 'soft tissue deformations', 'collision detection', 'elimination']"
20238,1802.08577,Stefan Lendl,Ante \'Custi\'c and Stefan Lendl,"On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on
  Interval Graphs and Falling Platforms in Video Games",,,,,cs.DS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a simplified model for platform game levels with falling
platforms based on interval graphs and show that solvability of such levels
corresponds to finding Steiner cycles or Steiner paths in the corresponding
graphs. Linear time algorithms are obtained for both of these problems. We also
study these algorithms as streaming algorithms and analyze the necessary memory
with respect to the maximum number of intervals contained in another interval.
This corresponds to understanding which parts of a level have to be visible at
each point to allow the player to make optimal deterministic decisions.
","[{'version': 'v1', 'created': 'Fri, 23 Feb 2018 15:03:19 GMT'}]",2018-02-26,"[['Ćustić', 'Ante', ''], ['Lendl', 'Stefan', '']]","['interval graphs', 'Steiner cycle', 'hamiltonian cycle', 'streaming algorithms', 'video games']"
20239,1009.5853,Sandor P. Fekete,"Tobias Baumgartner, Sandor P. Fekete, Winfried Hellmann, Alexander
  Kroeller",Simultaneous Event Execution in Heterogeneous Wireless Sensor Networks,"6 pages, 5 figures, 3 tables, to appear in Journal of Networks",,,,cs.DC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a synchronization algorithm to let nodes in a sensor network
simultaneously execute a task at a given point in time. In contrast to other
time synchronization algorithms we do not provide a global time basis that is
shared on all nodes. Instead, any node in the network can spontaneously
initiate a process that allows the simultaneous execution of arbitrary tasks.
We show that our approach is beneficial in scenarios where a global time is not
needed, as it requires little communication compared with other time
synchronization algorithms. We also show that our algorithm works in
heterogeneous systems where the hardware provides highly varying clock
accuracy. Moreover, heterogeneity does not only affect the hardware, but also
the communication channels. We deal with different connection types---from
highly unreliable and fluctuating wireless channels to reliable and fast wired
connections.
","[{'version': 'v1', 'created': 'Wed, 29 Sep 2010 11:52:14 GMT'}]",2010-09-30,"[['Baumgartner', 'Tobias', ''], ['Fekete', 'Sandor P.', ''], ['Hellmann', 'Winfried', ''], ['Kroeller', 'Alexander', '']]","['Sensor Networks', 'Time Synchronization', 'Simulatenous Events', 'Clock Drift', 'Heterogeneity']"
20240,1107.4588,Bernardo Huberman,"Mao Ye, Chunyan Wang, Christina Aperjis, Bernardo A. Huberman and
  Thomas Sandholm",Collective Attention and the Dynamics of Group Deals,,,,,cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a study of the group purchasing behavior of daily deals in Groupon
and LivingSocial and introduce a predictive dynamic model of collective
attention for group buying behavior. In our model, the aggregate number of
purchases at a given time comprises two types of processes: random discovery
and social propagation. We find that these processes are very clearly separated
by an inflection point. Using large data sets from both Groupon and
LivingSocial we show how the model is able to predict the success of group
deals as a function of time. We find that Groupon deals are easier to predict
accurately earlier in the deal lifecycle than LivingSocial deals due to the
final number of deal purchases saturating quicker. One possible explanation for
this is that the incentive to socially propagate a deal is based on an
individual threshold in LivingSocial, whereas in Groupon it is based on a
collective threshold, which is reached very early. Furthermore, the personal
benefit of propagating a deal is also greater in LivingSocial.
","[{'version': 'v1', 'created': 'Fri, 22 Jul 2011 18:14:21 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Oct 2011 21:56:59 GMT'}, {'version': 'v3', 'created': 'Thu, 27 Oct 2011 00:18:49 GMT'}, {'version': 'v4', 'created': 'Wed, 2 Nov 2011 00:09:07 GMT'}, {'version': 'v5', 'created': 'Tue, 29 Nov 2011 04:44:55 GMT'}]",2011-11-30,"[['Ye', 'Mao', ''], ['Wang', 'Chunyan', ''], ['Aperjis', 'Christina', ''], ['Huberman', 'Bernardo A.', ''], ['Sandholm', 'Thomas', '']]","['group deals', 'collective attention', 'purchase dynamics']"
20241,1604.06826,Lorenza Giupponi,"Lorenza Giupponi, Thomas Henderson, Biljana Bojovic, Marco Miozzo",Simulating LTE and Wi-Fi Coexistence in Unlicensed Spectrum with ns-3,"8 pages, pre-print",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The use of unlicensed spectrum for future LTE systems raises concerns about
its impact on co-located Wi-Fi networks. We report herein on extensions to a
popular network simulator, known as ns-3, to model such coexistence. To our
knowledge, this simulator is novel in two important ways. First, it is
presently the only freely available simulator for coexistence studies, and as
open source software, it offers new opportunities for reproducible research and
collaborative model development. Second, we are not aware of other simulators
with similar wireless models that allow full system studies to be conducted,
such as performance evaluation of upper-layer protocols in a coexistence
environment. We illustrate the value of a system simulator by describing a
simulation campaign for the indoor scenario designed by 3GPP RAN1 using new
ns-3 models for Release 13 LTE Listen Before Talk (LBT) techniques, intended
for fair coexistence with Wi-Fi. LBT models have been widely simulated at the
link and physical layer by many companies in 3GPP RAN1. We first show that we
are able to tune the scenario to reproduce similar performance metrics to those
reported in the literature. We then extend the simulations by adding TCP to the
file transfers and explore the different behaviour observed. Our initial study
reveals that there remain many open questions about how LBT should be
implemented to achieve good coexistence properties, and that a broader scope of
implementation issues, traffic models, and fuller system models should be
studied further before drawing final conclusions on the LBT coexistence
performance.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2016 21:54:27 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Jul 2016 09:19:52 GMT'}]",2016-07-04,"[['Giupponi', 'Lorenza', ''], ['Henderson', 'Thomas', ''], ['Bojovic', 'Biljana', ''], ['Miozzo', 'Marco', '']]","['LAA', 'LBT', 'network simulation', 'ns-3']"
20242,1401.3582,Xiaomin Bao,Xiaomin Bao,The equivalent identities of the MacWilliams identity for linear codes,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We use derivatives to prove the equivalences between MacWilliams identity and
its four equivalent forms, and present new interpretations for the four
equivalent forms. Our results explicitly give out the relationships between
MacWilliams identity and its four equivalent forms.
","[{'version': 'v1', 'created': 'Mon, 23 Dec 2013 13:19:42 GMT'}, {'version': 'v2', 'created': 'Sat, 8 Feb 2014 07:47:47 GMT'}]",2014-02-11,"[['Bao', 'Xiaomin', '']]","['Linear code', 'MacWilliams identity', 'equivalent', 'derivative']"
20243,1609.01010,Lingchuan Meng,Lingchuan Meng,Automatic Library Generation for Modular Polynomial Multiplication,"15 pages, 3 figures, based on the thesis work of Lingchuan Meng",,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Polynomial multiplication is a key algorithm underlying computer algebra
systems (CAS) and its efficient implementation is crucial for the performance
of CAS. In this paper we design and implement algorithms for polynomial
multiplication using approaches based the fast Fourier transform (FFT) and the
truncated Fourier transform (TFT). We improve on the state-of-the-art in both
theoretical and practical performance. The {\SPIRAL} library generation system
is extended and used to automatically generate and tune the performance of a
polynomial multiplication library that is optimized for memory hierarchy,
vectorization and multi-threading, using new and existing algorithms. The
performance tuning has been aided by the use of automation where many code
choices are generated and intelligent search is utilized to find the ""best""
implementation on a given architecture. The performance of autotuned
implementations is comparable to, and in some cases better than, the best
hand-tuned code.
","[{'version': 'v1', 'created': 'Mon, 5 Sep 2016 01:11:45 GMT'}]",2016-09-06,"[['Meng', 'Lingchuan', '']]","['polynomial arithmetic', 'convolution', 'fast Fourier transform', 'truncated Fourier transform', 'code generation', 'optimization']"
20244,1710.03189,Muaz Niazi,"Waseem Akram, Muaz A. Niazi, Laszlo Barna Iantovics","Towards Agent-Based Model Specification in Smart Grid: A Cognitive
  Agent-based Computing Approach","14 pages, 23 figures",,,,cs.MA cs.AI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A smart grid can be considered as a complex network where each node
represents a generation unit or a consumer. Whereas links can be used to
represent transmission lines. One way to study complex systems is by using the
agent-based modeling (ABM) paradigm. An ABM is a way of representing a complex
system of autonomous agents interacting with each other. Previously, a number
of studies have been presented in the smart grid domain making use of the ABM
paradigm. However, to the best of our knowledge, none of these studies have
focused on the specification aspect of ABM. An ABM specification is important
not only for understanding but also for replication of the model. In this
study, we focus on development as well as specification of ABM for smart grid.
We propose an ABM by using a combination of agent-based and complex
network-based approaches. For ABM specification, we use ODD and DREAM
specification approaches. We analyze these two specification approaches
qualitatively as well as quantitatively. Extensive experiments demonstrate that
DREAM is a most useful approach as compared with ODD for modeling as well as
for replication of models for smart grid.
","[{'version': 'v1', 'created': 'Sun, 1 Oct 2017 02:44:02 GMT'}, {'version': 'v2', 'created': 'Sat, 18 Nov 2017 18:37:59 GMT'}]",2017-11-21,"[['Akram', 'Waseem', ''], ['Niazi', 'Muaz A.', ''], ['Iantovics', 'Laszlo Barna', '']]","['Agent-based modeling', 'Complex networks', 'Smart Grid']"
20245,1407.2221,Valerie Gouranton,"Laurent Simon (LIMSI), Florian Nouviale (INSA Rennes, INRIA - IRISA),
  Ronan Gaugne (UR1), Val\'erie Gouranton (INSA Rennes, INRIA - IRISA)",Sonic interaction with a virtual orchestra of factory machinery,"Sonic Interaction for Virtual Environments, Minneapolis : United
  States (2014)",,,,cs.MM cs.SD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an immersive application where users receive sound and
visual feedbacks on their interactions with a virtual environment. In this
application, the users play the part of conductors of an orchestra of factory
machines since each of their actions on interaction devices triggers a pair of
visual and audio responses. Audio stimuli were spatialized around the listener.
The application was exhibited during the 2013 Science and Music day and
designed to be used in a large immersive system with head tracking, shutter
glasses and a 10.2 loudspeaker configuration.
","[{'version': 'v1', 'created': 'Sun, 6 Jul 2014 06:29:34 GMT'}]",2014-07-09,"[['Simon', 'Laurent', '', 'LIMSI'], ['Nouviale', 'Florian', '', 'INSA Rennes, INRIA - IRISA'], ['Gaugne', 'Ronan', '', 'UR1'], ['Gouranton', 'Valérie', '', 'INSA Rennes, INRIA - IRISA']]","['Sound spatialization', 'audio-visual interaction', 'virtual environments']"
20246,1407.5442,Swapnil Dhamal,"Swapnil Dhamal, Akanksha Meghlan and Y. Narahari",Cooperative Game Theoretic Solution Concepts for top-$k$ Problems,"This is a work in progress. If you have any comments, suggestions, or
  doubts, please send an email to the first author. The first two authors have
  contributed equally",,,,cs.SI cs.GT physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem of finding the $k$ most critical nodes, referred to as the
$top\text{-}k$ problem, is a very important one in several contexts such as
information diffusion and preference aggregation in social networks, clustering
of data points, etc. It has been observed in the literature that the value
allotted to a node by most of the popular cooperative game theoretic solution
concepts, acts as a good measure of appropriateness of that node (or a data
point) to be included in the $top\text{-}k$ set, by itself. However, in
general, nodes having the highest $k$ values are not the desirable
$top\text{-}k$ nodes, because the appropriateness of a node to be a part of the
$top\text{-}k$ set depends on other nodes in the set. As this is not explicitly
captured by cooperative game theoretic solution concepts, it is necessary to
post-process the obtained values in order to output the suitable $top\text{-}k$
nodes. In this paper, we propose several such post-processing methods and give
reasoning behind each of them, and also propose a standalone algorithm that
combines cooperative game theoretic solution concepts with the popular greedy
hill-climbing algorithm.
","[{'version': 'v1', 'created': 'Mon, 21 Jul 2014 10:11:54 GMT'}, {'version': 'v2', 'created': 'Mon, 6 Feb 2017 23:33:49 GMT'}]",2017-02-08,"[['Dhamal', 'Swapnil', ''], ['Meghlan', 'Akanksha', ''], ['Narahari', 'Y.', '']]","['cooperative game theory', 'social networks', 'information diffusion', 'influencemaximization', 'preference aggregation', 'clustering', 'greedy hill-climbing']"
20247,0801.1514,Grenville Croll,"David Chadwick, Rodney E. Sue","Teaching spreadsheet development using peer audit and self-audit methods
  for reducing error","9 Pages, includes references","European Spreadsheet Risks Int. Grp. 2001 95-105 ISBN:1 86166 179
  7",,,cs.CY,,"  Recent research has highlighted the high incidence of errors in spreadsheet
models used in industry. In an attempt to reduce the incidence of such errors,
a teaching approach has been devised which aids students to reduce their
likelihood of making common errors during development. The approach comprises
of spreadsheet checking methods based on the commonly accepted educational
paradigms of peer assessment and self-assessment. However, these paradigms are
here based upon practical techniques commonly used by the internal audit
function such as peer audit and control and risk self-assessment. The result of
this symbiosis between educational assessment and professional audit is a
method that educates students in a set of structured, transferable skills for
spreadsheet error-checking which are useful for increasing error-awareness in
the classroom and for reducing business risk in the workplace.
","[{'version': 'v1', 'created': 'Wed, 9 Jan 2008 21:58:45 GMT'}]",2008-03-13,"[['Chadwick', 'David', ''], ['Sue', 'Rodney E.', '']]","['spreadsheets', 'errors', 'audit', 'risk-management', 'teaching']"
20248,1603.09678,Samir Omerovi\'c,"Samir Omerovi\'c, Thomas-Peter Fries","Conformal higher-order remeshing schemes for implicitly defined
  interface problems",,,,,cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new higher-order accurate method is proposed that combines the advantages
of the classical $p$-version of the FEM on body-fitted meshes with embedded
domain methods. A background mesh composed by higher-order Lagrange elements is
used. Boundaries and interfaces are described implicitly by the level set
method and are within elements. In the elements cut by the boundaries or
interfaces, an automatic decomposition into higher-order accurate sub-elements
is realized. Therefore, the zero level sets are detected and meshed in a first
step which is called reconstruction. Then, based on the topological situation
in the cut element, higher-order sub-elements are mapped to the two sides of
the boundary or interface. The quality of the reconstruction and the mapping
largely determines the properties of the resulting, automatically generated
conforming mesh. It is found that optimal convergence rates are possible
although the resulting sub-elements are not always well-shaped.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2016 16:57:23 GMT'}, {'version': 'v2', 'created': 'Fri, 1 Apr 2016 09:03:57 GMT'}]",2016-04-04,"[['Omerović', 'Samir', ''], ['Fries', 'Thomas-Peter', '']]","['p-FEM', 'higher-order element', 'level-set method', 'fictitious domain method', 'embedded domain method', 'XFEM', 'interface problem']"
20249,1304.5109,Perrot K\'evin,Kevin Perrot and Eric R\'emila,Kadanoff Sand Pile Model. Avalanche Structure and Wave Shape,"30 pages. arXiv admin note: text overlap with arXiv:1106.2670,
  arXiv:1101.5940","Theoretical Computer Science, ISSN 0304-3975,
  10.1016/j.tcs.2013.01.033",,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sand pile models are dynamical systems describing the evolution from $N$
stacked grains to a stable configuration. It uses local rules to depict grain
moves and iterate it until reaching a fixed configuration from which no rule
can be applied. Physicists L. Kadanoff {\em et al} inspire KSPM, extending the
well known {\em Sand Pile Model} (SPM). In KSPM($D$), we start from a pile of
$N$ stacked grains and apply the rule: $D\!-\!1$ grains can fall from column
$i$ onto columns $i+1,i+2,\dots,i+D\!-\!1$ if the difference of height between
columns $i$ and $i\!+\!1$ is greater or equal to $D$. Toward the study of fixed
points (stable configurations on which no grain can move) obtained from $N$
stacked grains, we propose an iterative study of KSPM evolution consisting in
the repeated addition of one grain on a heap of sand, triggering an avalanche
at each iteration. We develop a formal background for the study of avalanches,
resumed in a finite state word transducer, and explain how this transducer may
be used to predict the form of fixed points. Further precise developments
provide a plain formula for fixed points of KSPM(3), showing the emergence of a
wavy shape.
","[{'version': 'v1', 'created': 'Thu, 18 Apr 2013 12:43:01 GMT'}]",2013-04-19,"[['Perrot', 'Kevin', ''], ['Rémila', 'Eric', '']]","['Discrete Dynamical System', 'Self-Organized Criticality', 'Sand Pile Model', 'Fixedpoint', 'Transducer']"
20250,0903.3131,Emmanuel Candes,"Emmanuel J. Candes, Yaniv Plan",Matrix Completion With Noise,"11 pages, 4 figures, 1 table",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  On the heels of compressed sensing, a remarkable new field has very recently
emerged. This field addresses a broad range of problems of significant
practical interest, namely, the recovery of a data matrix from what appears to
be incomplete, and perhaps even corrupted, information. In its simplest form,
the problem is to recover a matrix from a small sample of its entries, and
comes up in many areas of science and engineering including collaborative
filtering, machine learning, control, remote sensing, and computer vision to
name a few.
  This paper surveys the novel literature on matrix completion, which shows
that under some suitable conditions, one can recover an unknown low-rank matrix
from a nearly minimal set of entries by solving a simple convex optimization
problem, namely, nuclear-norm minimization subject to data constraints.
Further, this paper introduces novel results showing that matrix completion is
provably accurate even when the few observed entries are corrupted with a small
amount of noise. A typical result is that one can recover an unknown n x n
matrix of low rank r from just about nr log^2 n noisy samples with an error
which is proportional to the noise level. We present numerical results which
complement our quantitative analysis and show that, in practice, nuclear norm
minimization accurately fills in the many missing entries of large low-rank
matrices from just a few noisy samples. Some analogies between matrix
completion and compressed sensing are discussed throughout.
","[{'version': 'v1', 'created': 'Wed, 18 Mar 2009 10:59:52 GMT'}]",2009-03-19,"[['Candes', 'Emmanuel J.', ''], ['Plan', 'Yaniv', '']]","['Matrix completion', 'low-rank matrices', 'semidefiniteprogramming', 'dualityinoptimization', 'nuclear-norm minimization', 'oracle inequalities', 'compressed sensing']"
20251,1610.04725,Takoua Kefi,"Takoua Kefi, Riadh Ksantini, M.Becha Kaaniche and Adel Bouhoula",Incremental One-Class Models for Data Classification,"4 pages, accepted in PhD Forum Session of the ECML-PKDD 2016",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we outline a PhD research plan. This research contributes to
the field of one-class incremental learning and classification in case of
non-stationary environments. The goal of this PhD is to define a new
classification framework able to deal with very small learning dataset at the
beginning of the process and with abilities to adjust itself according to the
variability of the incoming data which create large scale datasets. As a
preliminary work, incremental Covariance-guided One-Class Support Vector
Machine is proposed to deal with sequentially obtained data. It is inspired
from COSVM which put more emphasis on the low variance directions while keeping
the basic formulation of incremental One-Class Support Vector Machine
untouched. The incremental procedure is introduced by controlling the possible
changes of support vectors after the addition of new data points, thanks to the
Karush-Kuhn-Tucker conditions, that have to be maintained on all previously
acquired data. Comparative experimental results with contemporary incremental
and non-incremental one-class classifiers on numerous artificial and real data
sets show that our method results in significantly better classification
performance.
","[{'version': 'v1', 'created': 'Sat, 15 Oct 2016 12:06:12 GMT'}]",2016-10-18,"[['Kefi', 'Takoua', ''], ['Ksantini', 'Riadh', ''], ['Kaaniche', 'M. Becha', ''], ['Bouhoula', 'Adel', '']]","['One-Class Classification', 'Incremental Learning', 'Support Vector Machine', 'Covariance']"
20252,1609.05944,Seyedroohollah Hosseini,Seyedroohollah Hosseini,On the Convex Geometry of Weighted Nuclear Norm Minimization,"10 pages, no figure, no table",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Low-rank matrix approximation, which aims to construct a low-rank matrix from
an observation, has received much attention recently. An efficient method to
solve this problem is to convert the problem of rank minimization into a
nuclear norm minimization problem. However, soft-thresholding of singular
values leads to the elimination of important information about the sensed
matrix. Weighted nuclear norm minimization (WNNM) has been proposed, where the
singular values are assigned different weights, in order to treat singular
values differently. In this paper the solution for WNNM is analyzed under a
particular weighting condition using the connection between convex geometry and
compressed sensing algorithms. It is shown that the WNNM is convex where the
weights are in non-descending order and there is a unique global minimizer for
the minimization problem.
","[{'version': 'v1', 'created': 'Mon, 19 Sep 2016 21:22:13 GMT'}]",2016-09-21,"[['Hosseini', 'Seyedroohollah', '']]","['Weighted nuclear norm minimization', 'Convex geometry', 'Low-rank matrix approximation', 'Linear inverse problem', 'Phase Transition']"
20253,1505.08067,Mohamed Amine Bergach,"Mohamed Amine Bergach and Emilien Kofman and Robert de Simone and
  Serge Tissot and Michel Syska","Efficient FFT mapping on GPU for radar processing application: modeling
  and implementation",,,,,cs.MS cs.DC cs.PF,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  General-purpose multiprocessors (as, in our case, Intel IvyBridge and Intel
Haswell) increasingly add GPU computing power to the former multicore
architectures. When used for embedded applications (for us, Synthetic aperture
radar) with intensive signal processing requirements, they must constantly
compute convolution algorithms, such as the famous Fast Fourier Transform. Due
to its ""fractal"" nature (the typical butterfly shape, with larger FFTs defined
as combination of smaller ones with auxiliary data array transpose functions),
one can hope to compute analytically the size of the largest FFT that can be
performed locally on an elementary GPU compute block. Then, the full
application must be organized around this given building block size. Now, due
to phenomena involved in the data transfers between various memory levels
across CPUs and GPUs, the optimality of such a scheme is only loosely
predictable (as communications tend to overcome in time the complexity of
computations). Therefore a mix of (theoretical) analytic approach and
(practical) runtime validation is here needed. As we shall illustrate, this
occurs at both stage, first at the level of deciding on a given elementary FFT
block size, then at the full application level.
","[{'version': 'v1', 'created': 'Fri, 29 May 2015 14:45:03 GMT'}]",2015-06-01,"[['Bergach', 'Mohamed Amine', ''], ['Kofman', 'Emilien', ''], ['de Simone', 'Robert', ''], ['Tissot', 'Serge', ''], ['Syska', 'Michel', '']]","['OpenCL', 'GPGPU', 'FFT', 'synthetic aperture radar', 'SIMD', 'SIMT', 'Mapping', 'Algorithm Adaptation']"
20254,1206.1004,Zhanghua Fu,"Zhanghua Fu, Wenqi Huang, Zhipeng Lv",Iterated tabu search for the circular open dimension problem,"29 pages, 2 figures",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper mainly investigates the circular open dimension problem (CODP),
which consists of packing a set of circles of known radii into a strip of fixed
width and unlimited length without overlapping. The objective is to minimize
the length of the strip. An iterated tabu search approach, named ITS, is
proposed. ITS starts from a randomly generated solution and attempts to gain
improvements by a tabu search procedure. After that, if the obtained solution
is not feasible, a perturbation operator is subsequently employed to
reconstruct the incumbent solution and an acceptance criterion is implemented
to determine whether or not accept the perturbed solution. This process is
repeated until a feasible solution has been found or the allowed computation
time has been elapsed. Computational experiments based on well-known benchmark
instances show that ITS produces quite competitive results with respect to the
best known results. For 18 representative CODP instances taken from the
literature, ITS succeeds in improving 13 best known results within reasonable
time. In addition, for another challenging related variant: the problem of
packing arbitrary sized circles into a circular container, ITS also succeeds in
improving many best known results. Supplementary experiments are also provided
to analyze the influence of the perturbation operator, as well as the
acceptance criterion.
","[{'version': 'v1', 'created': 'Wed, 14 Mar 2012 11:23:36 GMT'}]",2012-06-06,"[['Fu', 'Zhanghua', ''], ['Huang', 'Wenqi', ''], ['Lv', 'Zhipeng', '']]","['Packing', 'Cutting', 'Tabu search', 'Perturbation operator', 'Acceptance criterion']"
20255,1704.05592,Alexey Vasyukov,"Alexey Ermakov, Alexey Vasyukov",Testing Docker Performance for HPC Applications,"10 pages, 12 figures, 13 references",,,,cs.PF cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The main goal for this article is to compare performance penalties when using
KVM virtualization and Docker containers for creating isolated environments for
HPC applications. The article provides both data obtained using commonly
accepted synthetic tests (High Performance Linpack) and real life applications
(OpenFOAM). The article highlights the influence on resulting application
performance of major infrastructure configuration options: CPU type presented
to VM, networking connection type used.
","[{'version': 'v1', 'created': 'Wed, 19 Apr 2017 02:48:49 GMT'}]",2017-04-20,"[['Ermakov', 'Alexey', ''], ['Vasyukov', 'Alexey', '']]","['Docker', 'KVM', 'MPI', 'HPL', 'OpenFOAM', 'benchmark']"
20256,1603.08907,Punarjay Chakravarty,Punarjay Chakravarty and Tinne Tuytelaars,Cross-modal Supervision for Learning Active Speaker Detection in Video,16 pages,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we show how to use audio to supervise the learning of active
speaker detection in video. Voice Activity Detection (VAD) guides the learning
of the vision-based classifier in a weakly supervised manner. The classifier
uses spatio-temporal features to encode upper body motion - facial expressions
and gesticulations associated with speaking. We further improve a generic model
for active speaker detection by learning person specific models. Finally, we
demonstrate the online adaptation of generic models learnt on one dataset, to
previously unseen people in a new dataset, again using audio (VAD) for weak
supervision. The use of temporal continuity overcomes the lack of clean
training data. We are the first to present an active speaker detection system
that learns on one audio-visual dataset and automatically adapts to speakers in
a new dataset. This work can be seen as an example of how the availability of
multi-modal data allows us to learn a model without the need for supervision,
by transferring knowledge from one modality to another.
","[{'version': 'v1', 'created': 'Tue, 29 Mar 2016 19:47:46 GMT'}]",2016-03-30,"[['Chakravarty', 'Punarjay', ''], ['Tuytelaars', 'Tinne', '']]","['active speaker detection', 'cross-modal supervision', 'weaklysupervised learning', 'online learning']"
20257,0908.3361,Gene Golovchinsky,"Laurent Denoue, Scott Carter, John Adcock, Gene Golovchinsky, and
  Andreas Girgensohn",WebNC: efficient sharing of web applications,"Presented at WWW 2009, Madrid, Spain",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  WebNC is a system for efficiently sharing, retrieving and viewing web
applications. Unlike existing screencasting and screensharing tools, WebNC is
optimized to work with web pages where a lot of scrolling happens. WebNC uses a
tile-based encoding to capture, transmit and deliver web applications, and
relies only on dynamic HTML and JavaScript. The resulting webcasts require very
little bandwidth and are viewable on any modern web browser including Firefox
and Internet Explorer as well as browsers on the iPhone and Android platforms.
","[{'version': 'v1', 'created': 'Mon, 24 Aug 2009 05:34:57 GMT'}]",2009-08-25,"[['Denoue', 'Laurent', ''], ['Carter', 'Scott', ''], ['Adcock', 'John', ''], ['Golovchinsky', 'Gene', ''], ['Girgensohn', 'Andreas', '']]","['Webcasting', 'screencasting', 'browser plugin', 'real-time sharing']"
20258,1108.1377,Vijay Arya,Vijay Arya and Darryl Veitch,"Sparsity without the Complexity: Loss Localisation using Tree
  Measurements",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study network loss tomography based on observing average loss rates over a
set of paths forming a tree -- a severely underdetermined linear problem for
the unknown link loss probabilities. We examine in detail the role of sparsity
as a regularising principle, pointing out that the problem is technically
distinct from others in the compressed sensing literature. While sparsity has
been applied in the context of tomography, key questions regarding uniqueness
and recovery remain unanswered. Our work exploits the tree structure of path
measurements to derive sufficient conditions for sparse solutions to be unique
and the condition that $\ell_1$ minimization recovers the true underlying
solution. We present a fast single-pass linear algorithm for $\ell_1$
minimization and prove that a minimum $\ell_1$ solution is both unique and
sparsest for tree topologies. By considering the placement of lossy links
within trees, we show that sparse solutions remain unique more often than is
commonly supposed. We prove similar results for a noisy version of the problem.
","[{'version': 'v1', 'created': 'Fri, 5 Aug 2011 18:10:29 GMT'}, {'version': 'v2', 'created': 'Sat, 3 Mar 2012 07:17:38 GMT'}]",2015-03-19,"[['Arya', 'Vijay', ''], ['Veitch', 'Darryl', '']]","['network tomography', 'loss inference', 'tree topology', 'sparsity', 'ℓ1 regularization', 'compressed sensing']"
20259,1506.00481,Weilin Huang,Weilin Huang and Hujun Yin,Robust Face Recognition with Structural Binary Gradient Patterns,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a computationally efficient yet powerful binary framework
for robust facial representation based on image gradients. It is termed as
structural binary gradient patterns (SBGP). To discover underlying local
structures in the gradient domain, we compute image gradients from multiple
directions and simplify them into a set of binary strings. The SBGP is derived
from certain types of these binary strings that have meaningful local
structures and are capable of resembling fundamental textural information. They
detect micro orientational edges and possess strong orientation and locality
capabilities, thus enabling great discrimination. The SBGP also benefits from
the advantages of the gradient domain and exhibits profound robustness against
illumination variations. The binary strategy realized by pixel correlations in
a small neighborhood substantially simplifies the computational complexity and
achieves extremely efficient processing with only 0.0032s in Matlab for a
typical face image. Furthermore, the discrimination power of the SBGP can be
enhanced on a set of defined orientational image gradient magnitudes, further
enforcing locality and orientation. Results of extensive experiments on various
benchmark databases illustrate significant improvements of the SBGP based
representations over the existing state-of-the-art local descriptors in the
terms of discrimination, robustness and complexity. Codes for the SBGP methods
will be available at
http://www.eee.manchester.ac.uk/research/groups/sisp/software/.
","[{'version': 'v1', 'created': 'Mon, 1 Jun 2015 12:57:07 GMT'}]",2015-06-02,"[['Huang', 'Weilin', ''], ['Yin', 'Hujun', '']]","['Face representation', 'gradient domain', 'spatial locality', 'orientation']"
20260,1410.3710,Jisun An,Haewoon Kwak and Jisun An,"Understanding News Geography and Major Determinants of Global News
  Coverage of Disasters",Presented at Computation+Jounalism Symposium (C+J Symposium) 2014,,,,cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we reveal the structure of global news coverage of disasters
and its determinants by using a large-scale news coverage dataset collected by
the GDELT (Global Data on Events, Location, and Tone) project that monitors
news media in over 100 languages from the whole world. Significant variables in
our hierarchical (mixed-effect) regression model, such as the number of
population, the political stability, the damage, and more, are well aligned
with a series of previous research. Yet, strong regionalism we found in news
geography highlights the necessity of the comprehensive dataset for the study
of global news coverage.
","[{'version': 'v1', 'created': 'Tue, 14 Oct 2014 14:36:29 GMT'}]",2014-10-15,"[['Kwak', 'Haewoon', ''], ['An', 'Jisun', '']]","['GDELT', 'foreign news', 'news geography', 'international news agency', 'regionalism', 'theory of newsworthiness', 'disasters']"
20261,1410.4967,Dimitrios Kallergis,"Dimitrios Kallergis, Konstantinos Chimos, Vizikidis Stefanos,
  Theodoros Karvounidis, Christos Douligeris","Pirus: A Web-based File Hosting Service with Object Oriented Logic in
  Cloud Computing","6 pages, 3rd International Conference on Internet and Cloud Computing
  Technology (ICICCT2013), November 6-7 2013, Singapore","International Journal of Information Technology & Computer Science
  (IJITCS) 12 (3) (2013) 38-43",,,cs.SE cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper a new Web-based File Hosting Service with Object Oriented Logic
in Cloud Computing called Pirus was developed. The service will be used by the
academic community of the University of Piraeus giving users the ability to
remotely store and access their personal files with no security compromises. It
also offers the administrators the ability to manage users and roles. The
objective was to deliver a fully operational service, using state-of-the-art
programming techniques to enable scalability and future development of the
existing functionality. The use of technologies such as .NET Framework, C#
programming language, CSS and jQuery, MSSQL for database hosting and the
support of Virtualization and Cloud Computing will contribute significantly in
compatibility, code reuse, reliability and reduce of maintenance costs and
resources. The service was installed and tested in a controlled environment to
ascertain the required functionality and the offered reliability and safety
with complete success.
  The technologies used and supported, allow future work in upgrading and
extending the service. Changes and improvements, in hardware and software, in
order to convert the service to a SaaS (Software as a Service) Cloud
application is a logical step in order to efficiently offer the service to a
wider community. Improved and added functionality offered by further
development will leverage the user experience.
","[{'version': 'v1', 'created': 'Sat, 18 Oct 2014 14:59:59 GMT'}]",2017-06-16,"[['Kallergis', 'Dimitrios', ''], ['Chimos', 'Konstantinos', ''], ['Stefanos', 'Vizikidis', ''], ['Karvounidis', 'Theodoros', ''], ['Douligeris', 'Christos', '']]","['Pirus', 'file hosting service', 'cloud computing']"
20262,1710.03855,James Wilson,"James D. Wilson, David T. Uminsky",The power of A/B testing under interference,14 pages,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we address the fundamental statistical question: how can you
assess the power of an A/B test when the units in the study are exposed to
interference? This question is germane to many scientific and industrial
practitioners that rely on A/B testing in environments where control over
interference is limited. We begin by proving that interference has a measurable
effect on its sensitivity, or power. We quantify the power of an A/B test of
equality of means as a function of the number of exposed individuals under any
interference mechanism. We further derive a central limit theorem for the
number of exposed individuals under a simple Bernoulli switching interference
mechanism. Based on these results, we develop a strategy to estimate the power
of an A/B test when actors experience interference according to an observed
network model. We demonstrate how to leverage this theory to estimate the power
of an A/B test on units sharing any network relationship, and highlight the
utility of our method on two applications - a Facebook friendship network as
well as a large Twitter follower network. These results yield, for the first
time, the capacity to understand how to design an A/B test to detect, with a
specified confidence, a fixed measurable treatment effect when the A/B test is
conducted under interference driven by networks.
","[{'version': 'v1', 'created': 'Tue, 10 Oct 2017 23:24:22 GMT'}]",2017-10-12,"[['Wilson', 'James D.', ''], ['Uminsky', 'David T.', '']]","['causal inference', 'experimental design', 'network interference', 'power calculations', 'social networkanalysis']"
20263,1511.07540,Waldemar Koczkodaj Prof.,W.W. Koczkodaj,Pairwise Comparisons Rating Scale Paradox,"12 pages, 3 figure, 1 table, progress report, (practically) ready for
  submission, call for cooperation, call for corrections of formerly published
  results (especially related to AHP) which may go into tens of thousands",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study demonstrates that incorrect data are entered into a pairwise
comparisons matrix for processing into weights for the data collected by a
rating scale. Unprocessed rating scale data lead to a paradox. A solution to
it, based on normalization, is proposed. This is an essential correction for
virtually all pairwise comparisons methods using rating scales. The
illustration of the relative error currently, taking place, is discussed.
","[{'version': 'v1', 'created': 'Tue, 24 Nov 2015 02:13:12 GMT'}, {'version': 'v2', 'created': 'Tue, 1 Dec 2015 17:09:36 GMT'}]",2015-12-02,"[['Koczkodaj', 'W. W.', '']]","['pairwise comparison', 'rating scale', 'normalization', 'inconsistency', 'paradox']"
20264,1610.08407,Palash Dey,Palash Dey and Neeldhara Misra,"On the Exact Amount of Missing Information that makes Finding Possible
  Winners Hard",Under Review,,,,cs.GT cs.DS cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider election scenarios with incomplete information, a situation that
arises often in practice. There are several models of incomplete information
and accordingly, different notions of outcomes of such elections. In one
well-studied model of incompleteness, the votes are given by partial orders
over the candidates. In this context we can frame the problem of finding a
possible winner, which involves determining whether a given candidate wins in
at least one completion of a given set of partial votes for a specific voting
rule.
  The possible winner problem is well-known to be NP-complete in general, and
it is in fact known to be NP-complete for several voting rules where the number
of undetermined pairs in every vote is bounded only by some constant. In this
paper, we address the question of determining precisely the smallest number of
undetermined pairs for which the possible winner problem remains NP-complete.
In particular, we find the exact values of $t$ for which the possible winner
problem transitions to being NP-complete from being in P, where $t$ is the
maximum number of undetermined pairs in every vote. We demonstrate tight
results for a broad subclass of scoring rules which includes all the commonly
used scoring rules (such as plurality, veto, Borda, $k$-approval, and so on),
Copeland$^\alpha$ for every $\alpha\in[0,1]$, maximin, and Bucklin voting
rules. A somewhat surprising aspect of our results is that for many of these
rules, the possible winner problem turns out to be hard even if every vote has
at most one undetermined pair of candidates.
","[{'version': 'v1', 'created': 'Wed, 26 Oct 2016 16:37:17 GMT'}]",2016-10-27,"[['Dey', 'Palash', ''], ['Misra', 'Neeldhara', '']]","['Computational Social Choice', 'Dichotomy', 'NP-completeness', 'Maxflow', 'Voting']"
20265,1108.1925,Eric Peukert,"Eric Peukert, Julian Eberius, Erhard Rahm",Rule-based Construction of Matching Processes,10 Pages,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mapping complex metadata structures is crucial in a number of domains such as
data integration, ontology alignment or model management. To speed up that
process automatic matching systems were developed to compute mapping
suggestions that can be corrected by a user. However, constructing and tuning
match strategies still requires a high manual effort by matching experts as
well as correct mappings to evaluate generated mappings. We therefore propose a
self-configuring schema matching system that is able to automatically adapt to
the given mapping problem at hand. Our approach is based on analyzing the input
schemas as well as intermediate matching results. A variety of matching rules
use the analysis results to automatically construct and adapt an underlying
matching process for a given match task. We comprehensively evaluate our
approach on different mapping problems from the schema, ontology and model
management domains. The evaluation shows that our system is able to robustly
return good quality mappings across different mapping problems and domains.
","[{'version': 'v1', 'created': 'Tue, 9 Aug 2011 13:40:29 GMT'}]",2011-08-10,"[['Peukert', 'Eric', ''], ['Eberius', 'Julian', ''], ['Rahm', 'Erhard', '']]","['Matching system', 'rewrite rules', 'features']"
20266,1610.07004,Ali Nahm,"Alison Nahm, Alex Pentland and Peter Krafft",Inferring Population Preferences via Mixtures of Spatial Voting Models,"To be published in the 8th International Conference on Social
  Informatics (SocInfo) 2016",,,,cs.CY cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding political phenomena requires measuring the political
preferences of society. We introduce a model based on mixtures of spatial
voting models that infers the underlying distribution of political preferences
of voters with only voting records of the population and political positions of
candidates in an election. Beyond offering a cost-effective alternative to
surveys, this method projects the political preferences of voters and
candidates into a shared latent preference space. This projection allows us to
directly compare the preferences of the two groups, which is desirable for
political science but difficult with traditional survey methods. After
validating the aggregated-level inferences of this model against results of
related work and on simple prediction tasks, we apply the model to better
understand the phenomenon of political polarization in the Texas, New York, and
Ohio electorates. Taken at face value, inferences drawn from our model indicate
that the electorates in these states may be less bimodal than the distribution
of candidates, but that the electorates are comparatively more extreme in their
variance. We conclude with a discussion of limitations of our method and
potential future directions for research.
","[{'version': 'v1', 'created': 'Sat, 22 Oct 2016 06:52:28 GMT'}, {'version': 'v2', 'created': 'Wed, 26 Oct 2016 05:39:21 GMT'}]",2016-10-27,"[['Nahm', 'Alison', ''], ['Pentland', 'Alex', ''], ['Krafft', 'Peter', '']]","['probabilistic generative models', 'political polarization', 'demographic inference', 'ideal point models', 'computational social science']"
20267,1606.07479,Seyed Hossein Ahmadpanah,"Seyed Hossein Ahmadpanah, Abdullah Jafari Chashmi, Vahid Jahan",Wireless Application Protocol Architecture Overview,"Submitted : 3rd National Conference on Computer Engineering and IT
  Management , Tehran",,,,cs.NI,http://creativecommons.org/licenses/by/4.0/,"  WAP protocol is a set of communication protocols application environment and
wireless devices. WAP model more than a WAP gateway. Suitable for wireless
communication environment.
","[{'version': 'v1', 'created': 'Thu, 23 Jun 2016 21:16:23 GMT'}]",2016-06-27,"[['Ahmadpanah', 'Seyed Hossein', ''], ['Chashmi', 'Abdullah Jafari', ''], ['Jahan', 'Vahid', '']]","['component; Wireless communications', 'WAP', 'WAP gateway', 'WML']"
20268,1109.5679,Anis Ismail,"Anis Ismail, Mohamed Quafafou, Nicolas Durand, Gilles Nachouki and
  Mohammad Hajjar",Queries mining for efficient routing in P2P communities,"20 pages, 9 figures. arXiv admin note: substantial text overlap with
  arXiv:1108.1378",,,,cs.PF cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Peer-to-peer (P2P) computing is currently attracting enormous attention. In
P2P systems a very large number of autonomous computing nodes (the peers) pool
together their resources and rely on each other for data and services.
Peer-to-peer (P2P) Data-sharing systems now generate a significant portion of
Internet traffic. Examples include P2P systems for network storage, web
caching, searching and indexing of relevant documents and distributed
network-threat analysis. Requirements for widely distributed information
systems supporting virtual organizations have given rise to a new category of
P2P systems called schema-based. In such systems each peer exposes its own
schema and the main objective is the efficient search across the P2P network by
processing each incoming query without overly consuming bandwidth. The
usability of these systems depends on effective techniques to find and retrieve
data; however, efficient and effective routing of content-based queries is a
challenging problem in P2P networks. This work was attended as an attempt to
motivate the use of mining algorithms and hypergraphs context to develop two
different methods that improve significantly the efficiency of P2P
communications. The proposed query routing methods direct the query to a set of
relevant peers in such way as to avoid network traffic and bandwidth
consumption. We compare the performance of the two proposed methods with the
baseline one and our experimental results prove that our proposed methods
generate impressive levels of performance and scalability.
","[{'version': 'v1', 'created': 'Mon, 26 Sep 2011 19:27:21 GMT'}]",2011-10-04,"[['Ismail', 'Anis', ''], ['Quafafou', 'Mohamed', ''], ['Durand', 'Nicolas', ''], ['Nachouki', 'Gilles', ''], ['Hajjar', 'Mohammad', '']]","['Peer-to-peer systems', 'Data mining', 'hypergraphs', 'Query routing']"
20269,1704.08617,Victor Mayoral Vilches,"Irati Zamalloa, Risto Kojcev, Alejandro Hern\'andez, I\~nigo Muguruza,
  Lander Usategui, Asier Bilbao and V\'ictor Mayoral",Dissecting Robotics - historical overview and future perspectives,,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robotics is called to be the next technological revolution and estimations
indicate that it will trigger the fourth industrial revolution. This article
presents a review of some of the most relevant milestones that occurred in
robotics over the last few decades and future perspectives. Despite the fact
that, nowadays, robotics is an emerging field, the challenges in many
technological aspects and more importantly bringing innovative solutions to the
market still remain open. The need of reducing the integration time, costs and
a common hardware infrastructure are discussed and further analysed in this
work. We conclude with a discussion of the future perspectives of robotics as
an engineering discipline and with suggestions for future research directions.
","[{'version': 'v1', 'created': 'Thu, 27 Apr 2017 15:11:18 GMT'}]",2017-04-28,"[['Zamalloa', 'Irati', ''], ['Kojcev', 'Risto', ''], ['Hernández', 'Alejandro', ''], ['Muguruza', 'Iñigo', ''], ['Usategui', 'Lander', ''], ['Bilbao', 'Asier', ''], ['Mayoral', 'Víctor', '']]","['robotics', 'review', 'hardware', 'H-ROS', 'artificial intelligence']"
20270,1510.05182,Fereydoun Farrahi Moghaddam,Fereydoun Farrahi Moghaddam and Mohamed Cheriet,Sustainability-Aware Cloud Computing Using Virtual Carbon Tax,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, a solution for sustainable cloud system is proposed and then
implemented on a real testbed. The solution composes of optimization of a
profit model and introduction of virtual carbon tax to limit environmental
footprint of the cloud. The proposed multi-criteria optimizer of the cloud
system suggests new optimum CPU frequencies for CPU-cores when the local grid
energy mix or the cloud workload changes. The cloud system is implemented on a
blade system, and proper middlewares are developed to interact with the blades.
The experimental results show that it is possible to significantly decrease the
targeted environmental footprint of the system and keep it profitable.
","[{'version': 'v1', 'created': 'Sat, 17 Oct 2015 23:33:20 GMT'}, {'version': 'v2', 'created': 'Wed, 1 Nov 2017 12:55:42 GMT'}]",2017-11-02,"[['Moghaddam', 'Fereydoun Farrahi', ''], ['Cheriet', 'Mohamed', '']]","['Sustainable Cloud System', 'Virtual Carbon Tax', 'Profit Optimization']"
20271,0711.2998,Benjamin Leveque,"Yannick Frein (LGS), Benjamin L\'ev\^eque (LGS), Andras Sebo (LGS)",Optimizing diversity,,,,,cs.DM,,"  We consider the problem of minimizing the size of a family of sets G such
that every subset of 1,...,n can be written as a disjoint union of at most k
members of G, where k and n are given numbers. This problem originates in a
real-world application aiming at the diversity of industrial production. At the
same time, the minimum of G so that every subset of 1,...,n is the union of two
sets in G has been asked by Erdos and studied recently by Furedi and Katona
without requiring the disjointness of the sets. A simple construction providing
a feasible solution is conjectured to be optimal for this problem for all
values of n and k and regardless of the disjointness requirement; we prove this
conjecture in special cases including all (n,k) for which n <= 3k holds, and
some individual values of n and k.
","[{'version': 'v1', 'created': 'Mon, 19 Nov 2007 18:58:06 GMT'}]",2007-11-20,"[['Frein', 'Yannick', '', 'LGS'], ['Lévêque', 'Benjamin', '', 'LGS'], ['Sebo', 'Andras', '', 'LGS']]","['Tur´an type problems', 'extremal problems in graphs andhypergraphs', 'diversity', 'semi-finished products']"
20272,1310.0721,Marco Baldi,"Marco Baldi, Marco Bianchi, Franco Chiaraluce, Roberto Garello, Nicola
  Maturo, Ignacio Aguilar Sanchez, Stefano Cioni",Advanced coding schemes against jamming in telecommand links,"7 pages, 9 figures, accepted for presentation at Milcom 2013, San
  Diego, CA, Nov. 2013",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The aim of this paper is to study the performance of some coding schemes
recently proposed for updating the TC channel coding standard for space
applications, in the presence of jamming. Besides low-density parity-check
codes, that appear as the most eligible candidates, we also consider other
solutions based on parallel turbo codes and extended BCH codes. We show that
all these schemes offer very good performance, which approaches the theoretical
limits achievable.
","[{'version': 'v1', 'created': 'Wed, 2 Oct 2013 14:49:21 GMT'}]",2013-10-03,"[['Baldi', 'Marco', ''], ['Bianchi', 'Marco', ''], ['Chiaraluce', 'Franco', ''], ['Garello', 'Roberto', ''], ['Maturo', 'Nicola', ''], ['Sanchez', 'Ignacio Aguilar', ''], ['Cioni', 'Stefano', '']]","['Error correcting codes', 'jamming', 'telecommands']"
20273,1111.1321,Oleg Varlamov Oleg,Oleg O. Varlamov,"MIVAR: Transition from Productions to Bipartite Graphs MIVAR Nets and
  Practical Realization of Automated Constructor of Algorithms Handling More
  than Three Million Production Rules","23 pages, 21 figures",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The theoretical transition from the graphs of production systems to the
bipartite graphs of the MIVAR nets is shown. Examples of the implementation of
the MIVAR nets in the formalisms of matrixes and graphs are given. The linear
computational complexity of algorithms for automated building of objects and
rules of the MIVAR nets is theoretically proved. On the basis of the MIVAR nets
the UDAV software complex is developed, handling more than 1.17 million objects
and more than 3.5 million rules on ordinary computers. The results of
experiments that confirm a linear computational complexity of the MIVAR method
of information processing are given.
  Keywords: MIVAR, MIVAR net, logical inference, computational complexity,
artificial intelligence, intelligent systems, expert systems, General Problem
Solver.
","[{'version': 'v1', 'created': 'Sat, 5 Nov 2011 15:26:15 GMT'}]",2011-11-08,"[['Varlamov', 'Oleg O.', '']]","['MIVAR', 'MIVAR net', 'logical inference', 'computational complexity', 'artificial']"
20274,1111.3393,James P. Crutchfield,Nicholas F. Travers and James P. Crutchfield,Infinite Excess Entropy Processes with Countable-State Generators,"13 pages, 3 figures;
  http://csc.ucdavis.edu/~cmg/compmech/pubs/ieepcsg.htm",,,,cs.IT cond-mat.stat-mech math.IT math.PR nlin.CD,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present two examples of finite-alphabet, infinite excess entropy processes
generated by invariant hidden Markov models (HMMs) with countable state sets.
The first, simpler example is not ergodic, but the second is. It appears these
are the first constructions of processes of this type. Previous examples of
infinite excess entropy processes over finite alphabets admit only invariant
HMM presentations with uncountable state sets.
","[{'version': 'v1', 'created': 'Mon, 14 Nov 2011 23:38:27 GMT'}]",2011-11-16,"[['Travers', 'Nicholas F.', ''], ['Crutchfield', 'James P.', '']]","['stationary stochastic process', 'hidden Markov model', 'epsilon-machine', 'ergodicity', 'entropy rate', 'excess entropy', 'mutual information']"
20275,1511.07922,Yi Zhang,Yi Zhang,Contraction of Ore Ideals with Applications,,,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ore operators form a common algebraic abstraction of linear ordinary
differential and recurrence equations. Given an Ore operator $L$ with
polynomial coefficients in $x$, it generates a left ideal $I$ in the Ore
algebra over the field $\mathbf{k}(x)$ of rational functions. We present an
algorithm for computing a basis of the contraction ideal of $I$ in the Ore
algebra over the ring $R[x]$ of polynomials, where $R$ may be either
$\mathbf{k}$ or a domain with $\mathbf{k}$ as its fraction field. This
algorithm is based on recent work on desingularization for Ore operators by
Chen, Jaroschek, Kauers and Singer. Using a basis of the contraction ideal, we
compute a completely desingularized operator for $L$ whose leading coefficient
not only has minimal degree in $x$ but also has minimal content. Completely
desingularized operators have interesting applications such as certifying
integer sequences and checking special cases of a conjecture of Krattenthaler.
","[{'version': 'v1', 'created': 'Wed, 25 Nov 2015 00:15:50 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Nov 2015 21:08:36 GMT'}, {'version': 'v3', 'created': 'Wed, 16 Dec 2015 06:54:48 GMT'}, {'version': 'v4', 'created': 'Thu, 17 Dec 2015 08:54:06 GMT'}, {'version': 'v5', 'created': 'Wed, 23 Dec 2015 12:07:20 GMT'}, {'version': 'v6', 'created': 'Sun, 3 Jan 2016 02:38:59 GMT'}, {'version': 'v7', 'created': 'Thu, 28 Jan 2016 02:47:23 GMT'}, {'version': 'v8', 'created': 'Fri, 29 Jan 2016 03:02:20 GMT'}]",2016-02-01,"[['Zhang', 'Yi', '']]","['Ore Algebra', 'Desingularization', 'Contraction', 'Syzygy']"
20276,1802.09462,Xin Zhao,"Xin Zhao, Philipp Haller",Observable atomic consistency for CvRDTs,,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The development of distributed systems requires developers to balance the
need for consistency, availability, and partition tolerance. Conflict-free
replicated data types (CRDTs) are widely used in eventually consistent systems
to reduce concurrency control. However, due to the lack of consistent
non-monotonic operations, the usage of CRDTs can be difficult. In this paper,
we propose a new consistency protocol, the observable atomic consistency
protocol (OACP). OACP enables a principled relax- ation of strong consistency
to improve performance in specific scenarios. OACP combines the advantages of
mergeable data types, specifically, convergent replicated data types, and
reliable total order broadcast to provide on-demand strong consistency. By
providing observable atomic consistency, OACP avoids the anomalies of related
protocols. We provide a distributed, cluster-enabled implementation of OACP
based on Akka, a widely-used actor-based middleware. Our experimental
evaluation shows that OACP can reduce the coordination between replicas
compared to other protocols providing atomic consistency in several bench-
marks. Our results also suggest that OACP gains availability through mergeable
data types and provides acceptable latency for achieving strong consistency.
","[{'version': 'v1', 'created': 'Mon, 26 Feb 2018 17:15:31 GMT'}, {'version': 'v2', 'created': 'Mon, 18 Jun 2018 11:09:03 GMT'}]",2018-06-19,"[['Zhao', 'Xin', ''], ['Haller', 'Philipp', '']]","['atomic consistency', 'eventual consistency', 'actor model', 'distributed programming', 'programming language']"
20277,1603.03014,Christina Kraus,Christina Kraus,"Plagiarism Detection - State-of-the-art systems (2016) and evaluation
  methods",,,,,cs.IR cs.CY cs.DL,http://creativecommons.org/licenses/by/4.0/,"  Plagiarism detection systems comprise various approaches that aim to create a
fair environment for academic publications and appropriately acknowledge the
authors' works. While the need for a reliable and performant plagiarism
detection system increases with an increasing amount of publications, current
systems still have shortcomings. Particularly intelligent research plagiarism
detection still leaves room for improvement. An important factor for progress
in research is a suitable evaluation framework. In this paper, we give an
overview on the evaluation of plagiarism detection. We then use a taxonomy
provided in former research, to classify recent approaches of plagiarism
detection. Based on this, we asses the current research situation in the field
of plagiarism detection and derive further research questions and approaches to
be tackled in the future.
","[{'version': 'v1', 'created': 'Tue, 8 Mar 2016 18:31:13 GMT'}]",2016-03-10,"[['Kraus', 'Christina', '']]","['Plagiarism Detection', 'Evaluation', 'Extrinsic Plagiarism', 'Citation-based plagiarism']"
20278,1502.04827,Saurabh Bora,"Saurabh Bora, Aparajita Ojha (PDPM Indian Institute of Information
  Technology, Design and Manufacturing Jabalpur)","Corrigendum to ""Random grid-based visual secret sharing with abilities
  of OR and XOR decryptions""[Journal of Visual Communication and Image
  Representation. 24(2013) 48-62]","16 pages, 1 table, Appendix showing computations",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It has been observed that the contrast values for (2, 3) VSS scheme, (2, 4)
VSS scheme, (3, 5) VSS scheme and (4, 5) VSS scheme claimed by Wu and Sun
(2013) are found to be incorrect. Since the same values are cited and compared
by many other researchers in their works, we have calculated and presented the
correct values of contrast in this note.
","[{'version': 'v1', 'created': 'Tue, 17 Feb 2015 08:59:41 GMT'}]",2015-02-18,"[['Bora', 'Saurabh', '', 'PDPM Indian Institute of Information\n  Technology, Design and Manufacturing Jabalpur'], ['Ojha', 'Aparajita', '', 'PDPM Indian Institute of Information\n  Technology, Design and Manufacturing Jabalpur']]","['Visual Secret Sharing', 'Random Grid', 'Threshold', 'VisualCryptography', 'OR', 'XOR', 'Contrast', 'Shares']"
20279,1108.0388,Fei Li,Fei Li,A Comprehensive Study of an Online Packet Scheduling Algorithm,8 pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the \emph{bounded-delay model} for Qualify-of-Service buffer
management. Time is discrete. There is a buffer. Unit-length jobs (also called
\emph{packets}) arrive at the buffer over time. Each packet has an integer
release time, an integer deadline, and a positive real value. A packet's
characteristics are not known to an online algorithm until the packet actually
arrives. In each time step, at most one packet can be sent out of the buffer.
The objective is to maximize the total value of the packets sent by their
respective deadlines in an online manner. An online algorithm's performance is
usually measured in terms of \emph{competitive ratio}, when this online
algorithm is compared with a clairvoyant algorithm achieving the best total
value. In this paper, we study a simple and intuitive online algorithm. We
analyze its performance in terms of competitive ratio for the general model and
a few important variants.
","[{'version': 'v1', 'created': 'Mon, 1 Aug 2011 18:49:37 GMT'}]",2011-08-02,"[['Li', 'Fei', '']]","['online algorithm', 'competitive analysis', 'buffer management', 'packet scheduling']"
20280,1610.09164,Felipe Eltermann,"Felipe Eltermann, Alan Godoy, Fernando J. Von Zuben",Effects of Social Ties in Knowledge Diffusion: case study on PLOS ONE,,,,,cs.SI cs.DL physics.soc-ph,http://creativecommons.org/licenses/by/4.0/,"  In order to capture the effects of social ties in knowledge diffusion, this
paper examines the publication network that emerges from the collaboration of
researchers, using citation information as means to estimate knowledge flow.
For this purpose, we analyzed the papers published in the PLOS ONE journal
finding strong evidence to support that the closer two authors are in the
co-authorship network, the larger the probability that knowledge flow will
occur between them. Moreover, we also found that when it comes to knowledge
diffusion, strong co-authorship proximity is more determinant than geographic
proximity.
","[{'version': 'v1', 'created': 'Fri, 28 Oct 2016 10:53:53 GMT'}]",2016-10-31,"[['Eltermann', 'Felipe', ''], ['Godoy', 'Alan', ''], ['Von Zuben', 'Fernando J.', '']]","['knowledge diffusion', 'co-authorship network', 'multiplex network']"
20281,0806.0132,Feng Xia,"Feng Xia, Yu-Chu Tian, Youxian Sun, Jinxiang Dong",Control-theoretic dynamic voltage scaling for embedded controllers,"Accepted for publication in IET Computers and Digital Techniques.
  doi:10.1049/iet-cdt:20070112",,,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For microprocessors used in real-time embedded systems, minimizing power
consumption is difficult due to the timing constraints. Dynamic voltage scaling
(DVS) has been incorporated into modern microprocessors as a promising
technique for exploring the trade-off between energy consumption and system
performance. However, it remains a challenge to realize the potential of DVS in
unpredictable environments where the system workload cannot be accurately
known. Addressing system-level power-aware design for DVS-enabled embedded
controllers, this paper establishes an analytical model for the DVS system that
encompasses multiple real-time control tasks. From this model, a feedback
control based approach to power management is developed to reduce dynamic power
consumption while achieving good application performance. With this approach,
the unpredictability and variability of task execution times can be attacked.
Thanks to the use of feedback control theory, predictable performance of the
DVS system is achieved, which is favorable to real-time applications. Extensive
simulations are conducted to evaluate the performance of the proposed approach.
","[{'version': 'v1', 'created': 'Sun, 1 Jun 2008 08:30:10 GMT'}]",2008-12-18,"[['Xia', 'Feng', ''], ['Tian', 'Yu-Chu', ''], ['Sun', 'Youxian', ''], ['Dong', 'Jinxiang', '']]","['Dynamic voltage scaling', 'power management', 'feedback scheduling', 'embedded control systems']"
20282,1701.05478,Kim-Anh Tran,"Anton Weber, Kim-Anh Tran, Stefanos Kaxiras and Alexandra Jimborean",Decoupled Access-Execute on ARM big.LITTLE,"Presented at HIP3ES, 2017",,,HIP3ES/2017/4,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Energy-efficiency plays a significant role given the battery lifetime
constraints in embedded systems and hand-held devices. In this work we target
the ARM big.LITTLE, a heterogeneous platform that is dominant in the mobile and
embedded market, which allows code to run transparently on different
microarchitectures with individual energy and performance characteristics. It
allows to se more energy efficient cores to conserve power during simple tasks
and idle times and switch over to faster, more power hungry cores when
performance is needed. This proposal explores the power-savings and the
performance gains that can be achieved by utilizing the ARM big.LITTLE core in
combination with Decoupled Access-Execute (DAE). DAE is a compiler technique
that splits code regions into two distinct phases: a memory-bound Access phase
and a compute-bound Execute phase. By scheduling the memory-bound phase on the
LITTLE core, and the compute-bound phase on the big core, we conserve energy
while caching data from main memory and perform computations at maximum
performance. Our preliminary findings show that applying DAE on ARM big.LITTLE
has potential. By prefetching data in Access we can achieve an IPC improvement
of up to 37% in the Execute phase, and manage to shift more than half of the
program runtime to the LITTLE core. We also provide insight into advantages and
disadvantages of our approach, present preliminary results and discuss
potential solutions to overcome locking overhead.
","[{'version': 'v1', 'created': 'Fri, 13 Jan 2017 22:14:52 GMT'}]",2017-01-20,"[['Weber', 'Anton', ''], ['Tran', 'Kim-Anh', ''], ['Kaxiras', 'Stefanos', ''], ['Jimborean', 'Alexandra', '']]","['Decoupled Access-Execute', 'Energy Efficiency', 'Compiler', 'Embedded Systems', 'Heterogeneous Architectures', 'ARMbig']"
20283,1310.1285,S\'ebastien Harispe,"S\'ebastien Harispe, Sylvie Ranwez, Stefan Janaqi, Jacky Montmain","Semantic Measures for the Comparison of Units of Language, Concepts or
  Instances from Text and Knowledge Base Analysis",survey,,,,cs.CL,http://creativecommons.org/licenses/by/4.0/,"  Semantic measures are widely used today to estimate the strength of the
semantic relationship between elements of various types: units of language
(e.g., words, sentences, documents), concepts or even instances semantically
characterized (e.g., diseases, genes, geographical locations). Semantic
measures play an important role to compare such elements according to semantic
proxies: texts and knowledge representations, which support their meaning or
describe their nature. Semantic measures are therefore essential for designing
intelligent agents which will for example take advantage of semantic analysis
to mimic human ability to compare abstract or concrete objects. This paper
proposes a comprehensive survey of the broad notion of semantic measure for the
comparison of units of language, concepts or instances based on semantic proxy
analyses. Semantic measures generalize the well-known notions of semantic
similarity, semantic relatedness and semantic distance, which have been
extensively studied by various communities over the last decades (e.g.,
Cognitive Sciences, Linguistics, and Artificial Intelligence to mention a few).
","[{'version': 'v1', 'created': 'Fri, 4 Oct 2013 14:21:42 GMT'}, {'version': 'v2', 'created': 'Fri, 6 Dec 2013 17:28:29 GMT'}, {'version': 'v3', 'created': 'Mon, 24 Oct 2016 13:59:35 GMT'}]",2016-10-25,"[['Harispe', 'Sébastien', ''], ['Ranwez', 'Sylvie', ''], ['Janaqi', 'Stefan', ''], ['Montmain', 'Jacky', '']]","['semantic measures', 'semantic similarity', 'semantic relatedness', 'semantic distance', 'word simi']"
20284,1511.06702,Maxim Tatarchenko,"Maxim Tatarchenko, Alexey Dosovitskiy, Thomas Brox",Multi-view 3D Models from Single Images with a Convolutional Network,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a convolutional network capable of inferring a 3D representation
of a previously unseen object given a single image of this object. Concretely,
the network can predict an RGB image and a depth map of the object as seen from
an arbitrary view. Several of these depth maps fused together give a full point
cloud of the object. The point cloud can in turn be transformed into a surface
mesh. The network is trained on renderings of synthetic 3D models of cars and
chairs. It successfully deals with objects on cluttered background and
generates reasonable predictions for real images of cars.
","[{'version': 'v1', 'created': 'Fri, 20 Nov 2015 17:34:17 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Aug 2016 10:14:07 GMT'}]",2016-08-03,"[['Tatarchenko', 'Maxim', ''], ['Dosovitskiy', 'Alexey', ''], ['Brox', 'Thomas', '']]","['3D from single image', 'deep learning', 'convolutional networks']"
20285,0803.1626,Uwe Aickelin,"Amanda Whitbrook, Uwe Aickelin and Jonathan Garibaldi","Genetic-Algorithm Seeding Of Idiotypic Networks For Mobile-Robot
  Navigation",,"Proceedings of the International Conference on Informatics in
  Control, Automation and Robotics (ICINCO 2008), in print, pp, Funchal,
  Portugal, 2008",,,cs.NE cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Robot-control designers have begun to exploit the properties of the human
immune system in order to produce dynamic systems that can adapt to complex,
varying, real-world tasks. Jernes idiotypic-network theory has proved the most
popular artificial-immune-system (AIS) method for incorporation into
behaviour-based robotics, since idiotypic selection produces highly adaptive
responses. However, previous efforts have mostly focused on evolving the
network connections and have often worked with a single, pre-engineered set of
behaviours, limiting variability. This paper describes a method for encoding
behaviours as a variable set of attributes, and shows that when the encoding is
used with a genetic algorithm (GA), multiple sets of diverse behaviours can
develop naturally and rapidly, providing much greater scope for flexible
behaviour-selection. The algorithm is tested extensively with a simulated
e-puck robot that navigates around a maze by tracking colour. Results show that
highly successful behaviour sets can be generated within about 25 minutes, and
that much greater diversity can be obtained when multiple autonomous
populations are used, rather than a single one.
","[{'version': 'v1', 'created': 'Tue, 11 Mar 2008 16:26:47 GMT'}]",2010-07-05,"[['Whitbrook', 'Amanda', ''], ['Aickelin', 'Uwe', ''], ['Garibaldi', 'Jonathan', '']]","['Mobile-robot navigation', 'genetic algorithm', 'artificial immune system', 'idiotypic network']"
20286,1610.01971,Alessio Iovine,"Alessio Iovine, Francesco Valentini, Elena De Santis, Maria Domenica
  Di Benedetto, Marco Pratesi",Safe Human-Inspired Mesoscopic Hybrid Automaton for Autonomous Vehicles,"To appear in IFAC Nonlinear Analysis: Hybrid Systems. arXiv admin
  note: text overlap with arXiv:1507.07751",,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper a mesoscopic hybrid model, i.e. a microscopic hybrid model that
takes into account macroscopic parameters, is introduced for designing a
human-inspired Adaptive Cruise Control. A control law is proposed with the
design goal of replacing and imitating the behaviour of a human driver in a
car-following situation where lane changes are possible. First, a microscopic
hybrid automaton model is presented, based on human psycho-physical behavior,
for both longitudinal and lateral vehicle control. Then a rule for changing
time headway on the basis of macroscopic quantities is used to describe the
interaction among next vehicles and their impact on driver performance.
Simulation results show the advantages of the mesoscopic model. A feasibility
analysis of the needed communication network is also presented.
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2016 15:09:30 GMT'}]",2016-10-07,"[['Iovine', 'Alessio', ''], ['Valentini', 'Francesco', ''], ['De Santis', 'Elena', ''], ['Di Benedetto', 'Maria Domenica', ''], ['Pratesi', 'Marco', '']]","['hybrid systems', 'mesoscopic model', 'adaptive cruise control (ACC)', 'vehicle control', 'vehicular networks']"
20287,1402.6508,Antonio Andrea Gentile,"Cristian Bisconti, Angelo Corallo, Laura Fortunato, Antonio A. Gentile",Considerations about multistep community detection,12 pages,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The problem and implications of community detection in networks have raised a
huge attention, for its important applications in both natural and social
sciences. A number of algorithms has been developed to solve this problem,
addressing either speed optimization or the quality of the partitions
calculated. In this paper we propose a multi-step procedure bridging the
fastest, but less accurate algorithms (coarse clustering), with the slowest,
most effective ones (refinement). By adopting heuristic ranking of the nodes,
and classifying a fraction of them as `critical', a refinement step can be
restricted to this subset of the network, thus saving computational time.
Preliminary numerical results are discussed, showing improvement of the final
partition.
","[{'version': 'v1', 'created': 'Wed, 26 Feb 2014 12:10:33 GMT'}, {'version': 'v2', 'created': 'Thu, 27 Feb 2014 16:17:51 GMT'}]",2014-02-28,"[['Bisconti', 'Cristian', ''], ['Corallo', 'Angelo', ''], ['Fortunato', 'Laura', ''], ['Gentile', 'Antonio A.', '']]","['clustering', 'community detection', 'graph partitioning']"
20288,0903.4898,Predrag Jelenkovic,Predrag R. Jelenkovic and Ana Radovanovic,"Asymptotic Optimality of the Static Frequency Caching in the Presence of
  Correlated Requests",,,,,cs.PF cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is well known that the static caching algorithm that keeps the most
frequently requested documents in the cache is optimal in case when documents
are of the same size and requests are independent and equally distributed.
However, it is hard to develop explicit and provably optimal caching algorithms
when requests are statistically correlated. In this paper, we show that keeping
the most frequently requested documents in the cache is still optimal for large
cache sizes even if the requests are strongly correlated.
","[{'version': 'v1', 'created': 'Fri, 27 Mar 2009 20:05:17 GMT'}]",2009-03-31,"[['Jelenkovic', 'Predrag R.', ''], ['Radovanovic', 'Ana', '']]","['Web caching', 'cache fault probability', 'average-case analysis', 'least-frequently-used caching', 'least-recentlyused caching', 'long-range dependence']"
20289,1606.05975,Marcin Wrochna,"Archontia C. Giannopoulou, Micha{\l} Pilipczuk, Jean-Florent Raymond,
  Dimitrios M. Thilikos, Marcin Wrochna",Cutwidth: obstructions and algorithmic aspects,,,,,cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Cutwidth is one of the classic layout parameters for graphs. It measures how
well one can order the vertices of a graph in a linear manner, so that the
maximum number of edges between any prefix and its complement suffix is
minimized. As graphs of cutwidth at most $k$ are closed under taking
immersions, the results of Robertson and Seymour imply that there is a finite
list of minimal immersion obstructions for admitting a cut layout of width at
most $k$. We prove that every minimal immersion obstruction for cutwidth at
most $k$ has size at most $2^{O(k^3\log k)}$.
  As an interesting algorithmic byproduct, we design a new fixed-parameter
algorithm for computing the cutwidth of a graph that runs in time $2^{O(k^2\log
k)}\cdot n$, where $k$ is the optimum width and $n$ is the number of vertices.
While being slower by a $\log k$-factor in the exponent than the fastest known
algorithm, given by Thilikos, Bodlaender, and Serna in [Cutwidth I: A linear
time fixed parameter algorithm, J. Algorithms, 56(1):1--24, 2005] and [Cutwidth
II: Algorithms for partial $w$-trees of bounded degree, J. Algorithms,
56(1):25--49, 2005], our algorithm has the advantage of being simpler and
self-contained; arguably, it explains better the combinatorics of optimum-width
layouts.
","[{'version': 'v1', 'created': 'Mon, 20 Jun 2016 05:31:39 GMT'}, {'version': 'v2', 'created': 'Wed, 15 Feb 2017 13:07:23 GMT'}]",2017-02-16,"[['Giannopoulou', 'Archontia C.', ''], ['Pilipczuk', 'Michał', ''], ['Raymond', 'Jean-Florent', ''], ['Thilikos', 'Dimitrios M.', ''], ['Wrochna', 'Marcin', '']]","['cutwidth', 'obstructions', 'immersions', 'fixed-parameter tractability']"
20290,1603.07763,Hao Jiang,"Hao Jiang, Kristen Grauman",Seeing Invisible Poses: Estimating 3D Body Pose from Egocentric Video,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Understanding the camera wearer's activity is central to egocentric vision,
yet one key facet of that activity is inherently invisible to the camera--the
wearer's body pose. Prior work focuses on estimating the pose of hands and arms
when they come into view, but this 1) gives an incomplete view of the full body
posture, and 2) prevents any pose estimate at all in many frames, since the
hands are only visible in a fraction of daily life activities. We propose to
infer the ""invisible pose"" of a person behind the egocentric camera. Given a
single video, our efficient learning-based approach returns the full body 3D
joint positions for each frame. Our method exploits cues from the dynamic
motion signatures of the surrounding scene--which changes predictably as a
function of body pose--as well as static scene structures that reveal the
viewpoint (e.g., sitting vs. standing). We further introduce a novel energy
minimization scheme to infer the pose sequence. It uses soft predictions of the
poses per time instant together with a non-parametric model of human pose
dynamics over longer windows. Our method outperforms an array of possible
alternatives, including deep learning approaches for direct pose regression
from images.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2016 21:46:49 GMT'}]",2016-03-28,"[['Jiang', 'Hao', ''], ['Grauman', 'Kristen', '']]","['Egocentric video', 'human pose prediction', 'discrete optimization']"
20291,1206.0911,Luca Ferrucci,"Luca Ferrucci, Dino Mandrioli, Angelo Morzenti, Matteo Rossi",Non-null Infinitesimal Micro-steps: a Metric Temporal Logic Approach,"20 pages, 2 figures, submitted to the conference ""FORMATS: Formal
  Modelling and Analysis of Timed Systems"" 2012",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many systems include components interacting with each other that evolve with
possibly very different speeds. To deal with this situation many formal models
adopt the abstraction of ""zero-time transitions"", which do not consume time.
These however have several drawbacks in terms of naturalness and logic
consistency, as a system is modeled to be in different states at the same time.
We propose a novel approach that exploits concepts from non-standard analysis
to introduce a notion of micro- and macro-steps in an extension of the TRIO
metric temporal logic, called X-TRIO. We use X-TRIO to provide a formal
semantics and an automated verification technique to Stateflow-like notations
used in the design of flexible manufacturing systems.
","[{'version': 'v1', 'created': 'Tue, 5 Jun 2012 12:48:13 GMT'}]",2012-06-06,"[['Ferrucci', 'Luca', ''], ['Mandrioli', 'Dino', ''], ['Morzenti', 'Angelo', ''], ['Rossi', 'Matteo', '']]","['metric temporal logic', 'formal verification', 'flexible manufacturing systems', 'micro-and macro-steps', 'non-standard analysis']"
20292,1705.06668,Ahmad H. A. Eid,Ahmad Hosny Eid,"Introducing Geometric Algebra to Geometric Computing Software
  Developers: A Computational Thinking Approach","Tutorial, 43 pages, 3 figures",,,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Designing software systems for Geometric Computing applications can be a
challenging task. Software engineers typically use software abstractions to
hide and manage the high complexity of such systems. Without the presence of a
unifying algebraic system to describe geometric models, the use of software
abstractions alone can result in many design and maintenance problems.
Geometric Algebra (GA) can be a universal abstract algebraic language for
software engineering geometric computing applications. Few sources, however,
provide enough information about GA-based software implementations targeting
the software engineering community. In particular, successfully introducing GA
to software engineers requires quite different approaches from introducing GA
to mathematicians or physicists. This article provides a high-level
introduction to the abstract concepts and algebraic representations behind the
elegant GA mathematical structure. The article focuses on the conceptual and
representational abstraction levels behind GA mathematics with sufficient
references for more details. In addition, the article strongly recommends
applying the methods of Computational Thinking in both introducing GA to
software engineers, and in using GA as a mathematical language for developing
Geometric Computing software systems.
","[{'version': 'v1', 'created': 'Thu, 18 May 2017 16:05:54 GMT'}]",2017-05-19,"[['Eid', 'Ahmad Hosny', '']]","['Computational Thinking', 'Geometric Algebra', 'Geometric Computing', 'Software Engineering']"
20293,1607.00861,Marcin Zawada,"Przemys{\l}aw B{\l}a\'skiewicz, Jacek Cicho\'n, Jakub Lemiesz,
  Miros{\l}aw Kuty{\l}owski, Marcin Zawada, Szymon Stefa\'nski, Krzysztof
  Chrobak",$\lambda$-persistant CSMA: a radio-channel access protocol,,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an algorithm that improves channel-access statistics for
wireless medium. The proposed modification of the standard CSMA algorithm is
analytically shown to yield better results and simulation results are given to
support this claim.
","[{'version': 'v1', 'created': 'Mon, 4 Jul 2016 12:46:18 GMT'}]",2016-08-05,"[['Błaśkiewicz', 'Przemysław', ''], ['Cichoń', 'Jacek', ''], ['Lemiesz', 'Jakub', ''], ['Kutyłowski', 'Mirosław', ''], ['Zawada', 'Marcin', ''], ['Stefański', 'Szymon', ''], ['Chrobak', 'Krzysztof', '']]","['channel access', 'CSMA', 'wireless network']"
20294,0907.0542,Christine Michel,"Christine Michel (LIESP, ICTT), Marc-Eric Bobillier-Chaumon (ICTT),
  V\'eronique Cohen-Montandreau (ICTT), Franck Tarpin-Bernard (LIESP, ICTT)","D\'emarche d'\'evaluation de l'usage et des r\'epercussions
  psychosociales d'un environnement STIC sur une population de personnes
  \^ag\'ees en r\'esidence m\'edicalis\'ee",,"17 \`eme conf\'erence francophone sur l'Interaction Homme-Machine,
  Toulouse : France (2005)",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The MNESIS Project aims to see whether the use of computerized environment by
elderly people in medicalized residences stimulates their cognitive capacities
and contributes to a better integration, recognition or acceptance within their
social environment (friends, family, medical staff). In this paper we present
the protocol of evaluation that is defined to check this assumption. This
protocol is between users' centred traditional protocols (built on
investigations and indirect observation) and studies of Web Usage Mining (where
knowledge databases about the uses are built from traces of use). It allows
collecting direct and indirect information on a large scale and over long
periods.
","[{'version': 'v1', 'created': 'Fri, 3 Jul 2009 06:44:42 GMT'}]",2009-07-06,"[['Michel', 'Christine', '', 'LIESP, ICTT'], ['Bobillier-Chaumon', 'Marc-Eric', '', 'ICTT'], ['Cohen-Montandreau', 'Véronique', '', 'ICTT'], ['Tarpin-Bernard', 'Franck', '', 'LIESP, ICTT']]","['evaluation', 'interface', 'use', 'social integration', 'modeling']"
20295,1107.1072,Aniket Kate,"Michael Backes, Ian Goldberg, Aniket Kate, and Tomas Toft",Adding Query Privacy to Robust DHTs,To appear at ACM ASIACCS 2012,,,,cs.CR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Interest in anonymous communication over distributed hash tables (DHTs) has
increased in recent years. However, almost all known solutions solely aim at
achieving sender or requestor anonymity in DHT queries. In many application
scenarios, it is crucial that the queried key remains secret from intermediate
peers that (help to) route the queries towards their destinations. In this
paper, we satisfy this requirement by presenting an approach for providing
privacy for the keys in DHT queries.
  We use the concept of oblivious transfer (OT) in communication over DHTs to
preserve query privacy without compromising spam resistance. Although our
OT-based approach can work over any DHT, we concentrate on communication over
robust DHTs that can tolerate Byzantine faults and resist spam. We choose the
best-known robust DHT construction, and employ an efficient OT protocol
well-suited for achieving our goal of obtaining query privacy over robust DHTs.
Finally, we compare the performance of our privacy-preserving protocols with
their more privacy-invasive counterparts. We observe that there is no increase
in the message complexity and only a small overhead in the computational
complexity.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2011 09:40:37 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Apr 2012 08:45:22 GMT'}]",2015-03-19,"[['Backes', 'Michael', ''], ['Goldberg', 'Ian', ''], ['Kate', 'Aniket', ''], ['Toft', 'Tomas', '']]","['Distributed hash tables', 'Query privacy', 'Spam resistance', 'Oblivious transfer']"
20296,1505.03736,Ruzanna Chitchyan,"Ruzanna Chitchyan, Joost Noppen and Iris Groher","Sustainability in Software Product Lines: Report on Discussion Panel at
  SPLC 2014","4 pages, notes on panel held at Software Product Lines Conference -
  SPLC 2014",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sustainability (defined as 'the capacity to keep up') encompasses a wide set
of aims: ranging from energy efficient software products (environmental
sustainability), reduction of software development and maintenance costs
(economic sustainability), to employee and end-user wellbeing (social
sustainability). In this report we explore the role that sustainability plays
in software product line engineering (SPL). The report is based on the
'Sustainability in Software Product Lines' panel held at SPLC 2014.
","[{'version': 'v1', 'created': 'Thu, 14 May 2015 14:29:27 GMT'}]",2015-05-15,"[['Chitchyan', 'Ruzanna', ''], ['Noppen', 'Joost', ''], ['Groher', 'Iris', '']]","['software product lines', 'sustainability', 'sustainability design']"
20297,1406.4944,Leon Abdillah,Leon Andretti Abdillah,"IT based social media impacts on Indonesian general legislative
  elections 2014",14 pages,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The information technology applications in cyberspace (the internet) are
currently dominated by social media. The author investigates and explores the
advantages of social media implementation of any political party in Indonesian
general legislative elections 2014. There are twelve national political parties
participating in the election as contestants plus three local political parties
in Aceh. In this research, author focus on national political parties only. The
author visited, analyzed, and learnt the social media used by the contestants.
Those social media are : 1) Facebook, 2) Twitter, and 3) YouTube. Author also
compares the popularity of political parties on social media with the results
of a real count. Then Author can discuss : 1) the impact of social media on
political parties, 2) social media as a brand of political parties, 3) social
media as political presentation, and 4) social media as virtual society. The
results of this study indicate that Facebook is still a social media
application that received high attention by the voters on a campaign of
political parties. Indonesian's legislative elections won by parties that are
using social media as part of their campaigns.
","[{'version': 'v1', 'created': 'Thu, 19 Jun 2014 04:30:29 GMT'}]",2015-08-25,"[['Abdillah', 'Leon Andretti', '']]","['Social media', 'political campaigns', 'Indonesian legislative elections']"
20298,1401.2018,Shoubin Kong,"Shoubin Kong, Qiaozhu Mei, Ling Feng, Zhe Zhao, Fei Ye",On the Real-time Prediction Problems of Bursting Hashtags in Twitter,,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Hundreds of thousands of hashtags are generated every day on Twitter. Only a
few become bursting topics. Among the few, only some can be predicted in
real-time. In this paper, we take the initiative to conduct a systematic study
of a series of challenging real-time prediction problems of bursting hashtags.
Which hashtags will become bursting? If they do, when will the burst happen?
How long will they remain active? And how soon will they fade away? Based on
empirical analysis of real data from Twitter, we provide insightful statistics
to answer these questions, which span over the entire lifecycles of hashtags.
","[{'version': 'v1', 'created': 'Thu, 9 Jan 2014 14:35:18 GMT'}, {'version': 'v2', 'created': 'Tue, 3 Jun 2014 13:38:33 GMT'}]",2014-06-04,"[['Kong', 'Shoubin', ''], ['Mei', 'Qiaozhu', ''], ['Feng', 'Ling', ''], ['Zhao', 'Zhe', ''], ['Ye', 'Fei', '']]","['hashtag', 'burstiness', 'real-time prediction']"
20299,1305.7103,Prasenjit Chanak,"Prasenjit Chanak, Tuhina Samanta, Indrajit Banerjee","Fault-tolerant multipath routing scheme for energy efficient wireless
  sensor networks",,"International Journal of Wireless & Mobile Networks (IJWMN) Vol.
  5, No. 2, April 2013",,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  The main challenge in wireless sensor network is to improve the fault
tolerance of each node and also provide an energy efficient fast data routing
service. In this paper we propose an energy efficient node fault diagnosis and
recovery for wireless sensor networks referred as fault tolerant multipath
routing scheme for energy efficient wireless sensor network (FTMRS).The FTMRS
is based on multipath data routing scheme. One shortest path is use for main
data routing in FTMRS technique and other two backup paths are used as
alternative path for faulty network and to handle the overloaded traffic on
main channel. Shortest path data routing ensures energy efficient data routing.
The performance analysis of FTMRS shows better results compared to other
popular fault tolerant techniques in wireless sensor networks.
","[{'version': 'v1', 'created': 'Thu, 30 May 2013 13:34:53 GMT'}]",2013-05-31,"[['Chanak', 'Prasenjit', ''], ['Samanta', 'Tuhina', ''], ['Banerjee', 'Indrajit', '']]","['Wireless sensor network (WSN)', 'fault tolerance (FT)', 'load balance', 'multipath routing']"
20300,1004.1886,Dakshina Ranjan Kisku,"Dakshina Ranjan Kisku, Phalguni Gupta, Jamuna Kanta Sing","Feature Level Fusion of Face and Palmprint Biometrics by Isomorphic
  Graph-based Improved K-Medoids Partitioning","13 pages, 4 figures",ISA 2010,,,cs.CV,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper presents a feature level fusion approach which uses the improved
K-medoids clustering algorithm and isomorphic graph for face and palmprint
biometrics. Partitioning around medoids (PAM) algorithm is used to partition
the set of n invariant feature points of the face and palmprint images into k
clusters. By partitioning the face and palmprint images with scale invariant
features SIFT points, a number of clusters is formed on both the images. Then
on each cluster, an isomorphic graph is drawn. In the next step, the most
probable pair of graphs is searched using iterative relaxation algorithm from
all possible isomorphic graphs for a pair of corresponding face and palmprint
images. Finally, graphs are fused by pairing the isomorphic graphs into
augmented groups in terms of addition of invariant SIFT points and in terms of
combining pair of keypoint descriptors by concatenation rule. Experimental
results obtained from the extensive evaluation show that the proposed feature
level fusion with the improved K-medoids partitioning algorithm increases the
performance of the system with utmost level of accuracy.
","[{'version': 'v1', 'created': 'Mon, 12 Apr 2010 07:34:39 GMT'}]",2010-04-13,"[['Kisku', 'Dakshina Ranjan', ''], ['Gupta', 'Phalguni', ''], ['Sing', 'Jamuna Kanta', '']]","['Biometrics', 'Feature Level Fusion', 'Face', 'Palmprint', 'Isomorphic Graph', 'K-Medoids Partitioning Algorithm']"
20301,0707.3552,Damien Chablat,"Maher Baili (IRCCyN), Damien Chablat (IRCCyN), Philippe Wenger
  (IRCCyN)",Analyse Comparative des Manipulateurs 3R \`a Axes Orthogonaux,,"Dans Congr\`es international Conception et Mod\'elisation des
  Syst\`emes M\'ecaniques - Congr\`es international Conception et
  Mod\'elisation des Syst\`emes M\'ecaniques, Hammamet : Tunisie (03/2005)",,,cs.RO,,"  A family of 3R orthogonal manipulators without offset on the third body can
be divided into exactly nine workspace topologies. The workspace is
characterized in a half-cross section by the singular curves. The workspace
topology is defined by the number of cusps and nodes that appear on these
singular curves. Based on this classification, we evaluate theses manipulators
by the condition number related to the joint space and the proportion of the
region with four inverse kinematic solutions compared to a sphere containing
all the workspace. This second performance number is in relation with the
workspace. We determine finally le topology of workspace to which belong
manipulators having the best performance number values.
","[{'version': 'v1', 'created': 'Tue, 24 Jul 2007 13:46:22 GMT'}]",2007-07-25,"[['Baili', 'Maher', '', 'IRCCyN'], ['Chablat', 'Damien', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN']]","['orthogonal manipulator', 'classification', 'singularity', 'cusp', 'node', 'workspace topology', 'condition number']"
20302,1407.3211,Faruk Karaaslan,Faruk Karaaslan,"Possibility neutrosophic soft sets with applications in decision making
  and similarity measure",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, concept of possibility neutrosophic soft set and its
operations are defined, and their properties are studied. An application of
this theory in decision making is investigated. Also a similarity measure of
two possibility neutrosophic soft sets is introduced and discussed. Finally an
application of this similarity measure is given to select suitable person for
position in a firm.
","[{'version': 'v1', 'created': 'Wed, 9 Jul 2014 22:36:56 GMT'}]",2014-07-14,"[['Karaaslan', 'Faruk', '']]","['Soft set', 'neutrosophic soft set', 'possibility neutrosophic soft set', 'similarity measure', 'decision making']"
20303,1705.08858,Galina Lavrentyeva,"Galina Lavrentyeva, Sergey Novoselov, Egor Malykh, Alexander Kozlov,
  Oleg Kudashev and Vadim Shchemelinin",Audio-replay attack detection countermeasures,"11 pages, 3 figures, accepted for Specom 2017",,,,cs.SD cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents the Speech Technology Center (STC) replay attack
detection systems proposed for Automatic Speaker Verification Spoofing and
Countermeasures Challenge 2017. In this study we focused on comparison of
different spoofing detection approaches. These were GMM based methods, high
level features extraction with simple classifier and deep learning frameworks.
Experiments performed on the development and evaluation parts of the challenge
dataset demonstrated stable efficiency of deep learning approaches in case of
changing acoustic conditions. At the same time SVM classifier with high level
features provided a substantial input in the efficiency of the resulting STC
systems according to the fusion systems results.
","[{'version': 'v1', 'created': 'Wed, 24 May 2017 16:48:03 GMT'}]",2017-05-25,"[['Lavrentyeva', 'Galina', ''], ['Novoselov', 'Sergey', ''], ['Malykh', 'Egor', ''], ['Kozlov', 'Alexander', ''], ['Kudashev', 'Oleg', ''], ['Shchemelinin', 'Vadim', '']]","['spoofing', 'anti-spoofing', 'speaker recognition', 'replay attackdetection', 'ASVspoof']"
20304,1604.06600,Sukanta Das Dr.,Raju Hazari and Sukanta Das,On Number Conservation of Non-uniform Cellular Automata,,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies the number conservation property of 1-dimensional
non-uniform cellular automata (CAs). In a non-uniform cellular automaton (CA),
different cells may follow different rules. The present work considers that the
cells follow Wolfram's CAs rules. A characterization tool, named Reachability
tree is used to discover the number conservation property of non-uniform CAs.
Then a decision algorithm is reported to conclude whether a given non-uniform
CA with $n$ cells is number conserving or not. Finally, a synthesis scheme is
developed to get an $n$-cell number conserving non-uniform CA.
","[{'version': 'v1', 'created': 'Fri, 22 Apr 2016 10:34:46 GMT'}]",2016-04-25,"[['Hazari', 'Raju', ''], ['Das', 'Sukanta', '']]","['Number conserving cellular automata (NCCAs)', 'non-uniform CAs', 'Rule Min Term (RMT)', 'reachabilitytree']"
20305,1203.1897,Ibrahim Alkore Alsalabi Ibrahim Alkore Alsalabi,"Ibrahim Alkore Alshalabi, Khaled Elleithy","Effective M-learning design Strategies for computer science and
  Engineering courses",,"International Journal of Mobile Network Communications &
  Telematics (IJMNCT) Vol.2, No.1, February 2012",,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile learning (M-learning) is receiving more attention as a method of
delivering to learners study materials anytime and anywhere. It is a necessity
for educators to come up with a layout for learning that can be accessed
through mobile devices. These learning materials should consist of good quality
learning theories and accurate instructional layout in order to maintain the
learning as effective as possible. It is important to follow certain strategies
that can help the developers for M-learning applications. In this paper we
proposed a set of strategies that are useful for creating mobile prototype for
Computer Science and Engineering courses or M-learning application for course
content.
","[{'version': 'v1', 'created': 'Thu, 8 Mar 2012 19:42:39 GMT'}]",2012-03-12,"[['Alshalabi', 'Ibrahim Alkore', ''], ['Elleithy', 'Khaled', '']]","['M-learning', 'mobile devices Strategies', 'system environment', 'course content', 'Interaction']"
20306,1410.5215,Artem Revenko,Sergei O. Kuznetsov and Artem Revenko,Interactive Error Correction in Implicative Theories,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Errors in implicative theories coming from binary data are studied. First,
two classes of errors that may affect implicative theories are singled out. Two
approaches for finding errors of these classes are proposed, both of them based
on methods of Formal Concept Analysis. The first approach uses the cardinality
minimal (canonical or Duquenne-Guigues) implication base. The construction of
such a base is computationally intractable. Using an alternative approach one
checks possible errors on the fly in polynomial time via computing closures of
subsets of attributes. Both approaches are interactive, based on questions
about the validity of certain implications. Results of computer experiments are
presented and discussed.
","[{'version': 'v1', 'created': 'Mon, 20 Oct 2014 10:04:39 GMT'}]",2014-10-21,"[['Kuznetsov', 'Sergei O.', ''], ['Revenko', 'Artem', '']]","['implicative theory', 'error correction', 'closure system', 'formalconcept analysis']"
20307,1304.2983,Hyung-Chan An,"Hyung-Chan An, Aditya Bhaskara, Ola Svensson",Centrality of Trees for Capacitated k-Center,"21 pages, 2 figures",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a large discrepancy in our understanding of uncapacitated and
capacitated versions of network location problems. This is perhaps best
illustrated by the classical k-center problem: there is a simple tight
2-approximation algorithm for the uncapacitated version whereas the first
constant factor approximation algorithm for the general version with capacities
was only recently obtained by using an intricate rounding algorithm that
achieves an approximation guarantee in the hundreds.
  Our paper aims to bridge this discrepancy. For the capacitated k-center
problem, we give a simple algorithm with a clean analysis that allows us to
prove an approximation guarantee of 9. It uses the standard LP relaxation and
comes close to settling the integrality gap (after necessary preprocessing),
which is narrowed down to either 7, 8 or 9. The algorithm proceeds by first
reducing to special tree instances, and then solves such instances optimally.
Our concept of tree instances is quite versatile, and applies to natural
variants of the capacitated k-center problem for which we also obtain improved
algorithms. Finally, we give evidence to show that more powerful preprocessing
could lead to better algorithms, by giving an approximation algorithm that
beats the integrality gap for instances where all non-zero capacities are
uniform.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2013 14:50:12 GMT'}]",2013-04-11,"[['An', 'Hyung-Chan', ''], ['Bhaskara', 'Aditya', ''], ['Svensson', 'Ola', '']]","['approximation algorithms', 'capacitated network location problems', 'capacitatedk-center problem', 'LP-rounding algorithms']"
20308,0708.1579,Vicen\c{c} G\'omez Cerd\`a,"Andreas Kaltenbrunner, Vicen\c{c} G\'omez, Ayman Moghnieh, Rodrigo
  Meza, Josep Blat, Vicente L\'opez","Homogeneous temporal activity patterns in a large online communication
  space","17 pages, 10 figures, to be published in International Journal on
  WWW/Internet",,,,cs.NI,,"  The many-to-many social communication activity on the popular technology-news
website Slashdot has been studied. We have concentrated on the dynamics of
message production without considering semantic relations and have found
regular temporal patterns in the reaction time of the community to a news-post
as well as in single user behavior. The statistics of these activities follow
log-normal distributions. Daily and weekly oscillatory cycles, which cause
slight variations of this simple behavior, are identified. A superposition of
two log-normal distributions can account for these variations. The findings are
remarkable since the distribution of the number of comments per users, which is
also analyzed, indicates a great amount of heterogeneity in the community. The
reader may find surprising that only a few parameters allow a detailed
description, or even prediction, of social many-to-many information exchange in
this kind of popular public spaces.
","[{'version': 'v1', 'created': 'Sun, 12 Aug 2007 00:29:03 GMT'}]",2007-08-14,"[['Kaltenbrunner', 'Andreas', ''], ['Gómez', 'Vicenç', ''], ['Moghnieh', 'Ayman', ''], ['Meza', 'Rodrigo', ''], ['Blat', 'Josep', ''], ['López', 'Vicente', '']]","['Social interaction', 'information diffusion', 'log-normal activity', 'heavy tails', 'Slashdot']"
20309,1409.2264,Sarfraz Nawaz,"Sarfraz Nawaz, Cecilia Mascolo",Mining Users' Significant Driving Routes with Low-power Sensors,ACM Conference on Embedded Networked Sensor Systems (SenSys 2014),,,,cs.CY cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  While there is significant work on sensing and recognition of significant
places for users, little attention has been given to users' significant routes.
Recognizing these routine journeys, opens doors to the development of novel
applications, like personalized travel alerts, and enhancement of user's travel
experience. However, the high energy consumption of traditional location
sensing technologies, such as GPS or WiFi based localization, is a barrier to
passive and ubiquitous route sensing through smartphones.
  In this paper, we present a passive route sensing framework that continuously
monitors a vehicle user solely through a phone's gyroscope and accelerometer.
This approach can differentiate and recognize various routes taken by the user
by time warping angular speeds experienced by the phone while in transit and is
independent of phone orientation and location within the vehicle, small detours
and traffic conditions. We compare the route learning and recognition
capabilities of this approach with GPS trajectory analysis and show that it
achieves similar performance. Moreover, with an embedded co-processor, common
to most new generation phones, it achieves energy savings of an order of
magnitude over the GPS sensor.
","[{'version': 'v1', 'created': 'Mon, 8 Sep 2014 10:16:48 GMT'}]",2014-09-09,"[['Nawaz', 'Sarfraz', ''], ['Mascolo', 'Cecilia', '']]","['Mobile Sensing', 'Significant Journeys', 'Route Sensing']"
20310,1704.02673,Zheng Wang,Zheng Wang and Cong Ling,"Lattice Gaussian Sampling by Markov Chain Monte Carlo: Bounded Distance
  Decoding and Trapdoor Sampling",submitted to Transaction on Information Theory,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sampling from the lattice Gaussian distribution plays an important role in
various research fields. In this paper, the Markov chain Monte Carlo
(MCMC)-based sampling technique is advanced in several fronts. Firstly, the
spectral gap for the independent Metropolis-Hastings-Klein (MHK) algorithm is
derived, which is then extended to Peikert's algorithm and rejection sampling;
we show that independent MHK exhibits faster convergence. Then, the performance
of bounded distance decoding using MCMC is analyzed, revealing a flexible
trade-off between the decoding radius and complexity. MCMC is further applied
to trapdoor sampling, again offering a trade-off between security and
complexity. Finally, the independent multiple-try Metropolis-Klein (MTMK)
algorithm is proposed to enhance the convergence rate. The proposed algorithms
allow parallel implementation, which is beneficial for practical applications.
","[{'version': 'v1', 'created': 'Sun, 9 Apr 2017 23:42:33 GMT'}, {'version': 'v2', 'created': 'Sat, 28 Jul 2018 12:20:04 GMT'}]",2018-07-31,"[['Wang', 'Zheng', ''], ['Ling', 'Cong', '']]","['Lattice decoding', 'lattice Gaussian sampling', 'Markov chain Monte Carlo', 'bounded distance decoding', 'largescale MIMO detection', 'trapdoor sampling']"
20311,1401.2727,Rourab Paul,"Rourab Paul, Amlan Chakrabarti, Ranjan Ghosh",Hardware Implementation of four byte per clock RC4 algorithm,This is an unpublished draft version,,,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the field of cryptography till date the 2-byte in 1-clock is the best
known RC4 hardware design [1], while 1-byte in 1-clock [2], and the 1-byte in 3
clocks [3][4] are the best known implementation. The design algorithm in[2]
considers two consecutive bytes together and processes them in 2 clocks. The
design [1] is a pipelining architecture of [2]. The design of 1-byte in
3-clocks is too much modular and clock hungry. In this paper considering the
RC4 algorithm, as it is, a simpler RC4 hardware design providing higher
throughput is proposed in which 6 different architecture has been proposed. In
design 1, 1-byte is processed in 1-clock, design 2 is a dynamic KSA-PRGA
architecture of Design 1. Design 3 can process 2 byte in a single clock, where
as Design 4 is Dynamic KSA-PRGA architecture of Design 3. Design 5 and Design 6
are parallelization architecture design 2 and design 4 which can compute 4 byte
in a single clock. The maturity in terms of throughput, power consumption and
resource usage, has been achieved from design 1 to design 6. The RC4 encryption
and decryption designs are respectively embedded on two FPGA boards as
co-processor hardware, the communication between the two boards performed using
Ethernet.
","[{'version': 'v1', 'created': 'Mon, 13 Jan 2014 06:57:21 GMT'}]",2014-01-14,"[['Paul', 'Rourab', ''], ['Chakrabarti', 'Amlan', ''], ['Ghosh', 'Ranjan', '']]","['Computer Society', 'IEEEtran', 'journal', 'LATEX', 'paper', 'template']"
20312,1602.06223,Shawn Jones,Shawn M. Jones and Harihar Shankar,Rules of Acquisition for Mementos and Their Content,"16 pages, 6 figures, 13 listings",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Text extraction from web pages has many applications, including web crawling
optimization and document clustering. Though much has been written about the
acquisition of content from live web pages, content acquisition of archived web
pages, known as mementos, remains a relatively new enterprise. In the course of
conducting a study with almost 700,000 web pages, we encountered issues
acquiring mementos and extracting text from them. The acquisition of memento
content via HTTP is expected to be a relatively painless exercise, but we have
found cases to the contrary. We also find that the parsing of HTML, already
known to be problematic, can be more complex when one attempts to extract the
text of mementos across many web archives, due to issues involving different
memento presentation behaviors, as well as the age of the HTML in their
mementos. For the benefit of others acquiring mementos across many web
archives, we document those experiences here.
","[{'version': 'v1', 'created': 'Fri, 19 Feb 2016 17:07:24 GMT'}, {'version': 'v2', 'created': 'Mon, 22 Feb 2016 23:27:58 GMT'}]",2016-02-24,"[['Jones', 'Shawn M.', ''], ['Shankar', 'Harihar', '']]","['Digital Preservation', 'HTTP', 'Resource Versioning', 'Web Archiving', 'HTML']"
20313,1301.3632,Wojciech Mazurczyk,"Wojciech Mazurczyk, Maciej Karas, Krzysztof Szczypiorski",SkyDe: a Skype-based Steganographic Method,"7 pages, 6 figures, 1 table. The paper is submitted to 1st ACM
  Information Hiding and Multimedia Security Workshop (IH and ACM MMSec
  conferences merged into a single event), June 17-19, 2013, Montpellier,
  France","International Journal of Computers, Communications & Control
  (IJCCC), ISSN: 1841- 9836, 8(3), June 2013, pp. 389-400",,,cs.CR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces SkyDe (Skype Hide), a new steganographic method that
utilizes Skype encrypted packets with silence to provide the means for
clandestine communication. It is possible to reuse packets that do not carry
voice signals for steganographic purposes because Skype does not use any
silence suppression mechanism. The method's proof-of-concept implementation and
first experimental results are presented. They prove that the method is
feasible and offers steganographic bandwidth as high as 2.8 kbps.
","[{'version': 'v1', 'created': 'Wed, 16 Jan 2013 09:21:11 GMT'}]",2013-06-12,"[['Mazurczyk', 'Wojciech', ''], ['Karas', 'Maciej', ''], ['Szczypiorski', 'Krzysztof', '']]","['Information hiding', 'network steganography', 'Skype']"
20314,1111.0307,Bernardo Huberman,"Zeinab Abbassi, Christina Aperjis, Bernardo A. Huberman",Swayed by Friends or by the Crowd?,,,,,cs.SI cs.CY physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We have conducted three empirical studies of the effects of friend
recommendations and general ratings on how online users make choices. These two
components of social influence were investigated through user studies on
Mechanical Turk. We find that for a user deciding between two choices an
additional rating star has a much larger effect than an additional friend's
recommendation on the probability of selecting an item. Equally important,
negative opinions from friends are more influential than positive opinions, and
people exhibit more random behavior in their choices when the decision involves
less cost and risk. Our results can be generalized across different
demographics, implying that individuals trade off recommendations from friends
and ratings in a similar fashion.
","[{'version': 'v1', 'created': 'Tue, 1 Nov 2011 20:12:09 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Nov 2011 16:59:49 GMT'}]",2011-11-10,"[['Abbassi', 'Zeinab', ''], ['Aperjis', 'Christina', ''], ['Huberman', 'Bernardo A.', '']]","['Social Influence', 'Friends', 'Ratings', 'Choice', 'Dynamics of Market Share']"
20315,1611.00598,Junseok Park,"Junseok Park, Gwangmin Kim, Dongjin Jang, Sungji Choo, Sunghwa Bae,
  Doheon Lee","A bioinformatics system for searching Co-Occurrence based on
  Co-Operational Formation with Advanced Method (COCOFAM)","5 pages, 4 figures",,,,cs.IR cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Literature analysis is a key step in obtaining background information in
biomedical research. However, it is difficult for researchers to obtain
knowledge of their interests in an efficient manner because of the massive
amount of the published biomedical literature. Therefore, efficient and
systematic search strategies are required, which allow ready access to the
substantial amount of literature. In this paper, we propose a novel search
system, named Co-Occurrence based on Co-Operational Formation with Advanced
Method(COCOFAM) which is suitable for the large-scale literature analysis.
COCOFAM is based on integrating both Spark for local clusters and a global job
scheduler to gather crowdsourced co-occurrence data on global clusters. It will
allow users to obtain information of their interests from the substantial
amount of literature.
","[{'version': 'v1', 'created': 'Wed, 2 Nov 2016 13:34:42 GMT'}]",2016-11-03,"[['Park', 'Junseok', ''], ['Kim', 'Gwangmin', ''], ['Jang', 'Dongjin', ''], ['Choo', 'Sungji', ''], ['Bae', 'Sunghwa', ''], ['Lee', 'Doheon', '']]","['Co-occurrence', 'bioinformatics', 'text-mining', 'Hadoop', 'Spark', 'jobscheduler', 'crowdsourcing']"
20316,1701.06351,Yichao Yan,"Yichao Yan, Bingbing Ni, Zhichao Song, Chao Ma, Yan Yan and Xiaokang
  Yang",Person Re-Identification via Recurrent Feature Aggregation,"14 pages, 4 figures, in ECCV 2016",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the person re-identification problem by effectively exploiting a
globally discriminative feature representation from a sequence of tracked human
regions/patches. This is in contrast to previous person re-id works, which rely
on either single frame based person to person patch matching, or graph based
sequence to sequence matching. We show that a progressive/sequential fusion
framework based on long short term memory (LSTM) network aggregates the
frame-wise human region representation at each time stamp and yields a sequence
level human feature representation. Since LSTM nodes can remember and propagate
previously accumulated good features and forget newly input inferior ones, even
with simple hand-crafted features, the proposed recurrent feature aggregation
network (RFA-Net) is effective in generating highly discriminative sequence
level human representations. Extensive experimental results on two person
re-identification benchmarks demonstrate that the proposed method performs
favorably against state-of-the-art person re-identification methods.
","[{'version': 'v1', 'created': 'Mon, 23 Jan 2017 12:05:16 GMT'}]",2017-01-24,"[['Yan', 'Yichao', ''], ['Ni', 'Bingbing', ''], ['Song', 'Zhichao', ''], ['Ma', 'Chao', ''], ['Yan', 'Yan', ''], ['Yang', 'Xiaokang', '']]","['person re-identification', 'feature fusion', 'long short term memory networks']"
20317,1305.0638,Deqing Wang,"Deqing Wang, Hui Zhang, Rui Liu, Weifeng Lv","Feature Selection Based on Term Frequency and T-Test for Text
  Categorization",5pages 9 figures CIKM2012 paper,,,,cs.LG cs.IR stat.ML,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Much work has been done on feature selection. Existing methods are based on
document frequency, such as Chi-Square Statistic, Information Gain etc.
However, these methods have two shortcomings: one is that they are not reliable
for low-frequency terms, and the other is that they only count whether one term
occurs in a document and ignore the term frequency. Actually, high-frequency
terms within a specific category are often regards as discriminators.
  This paper focuses on how to construct the feature selection function based
on term frequency, and proposes a new approach based on $t$-test, which is used
to measure the diversity of the distributions of a term between the specific
category and the entire corpus. Extensive comparative experiments on two text
corpora using three classifiers show that our new approach is comparable to or
or slightly better than the state-of-the-art feature selection methods (i.e.,
$\chi^2$, and IG) in terms of macro-$F_1$ and micro-$F_1$.
","[{'version': 'v1', 'created': 'Fri, 3 May 2013 08:26:05 GMT'}]",2013-05-06,"[['Wang', 'Deqing', ''], ['Zhang', 'Hui', ''], ['Liu', 'Rui', ''], ['Lv', 'Weifeng', '']]","['feature selection', 'term frequency', 't-test', 'text classification']"
20318,1401.1465,David Balduzzi,David Balduzzi,Cortical prediction markets,"To appear, AAMAS 2014",,,,cs.AI cs.GT cs.LG cs.MA q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate cortical learning from the perspective of mechanism design.
First, we show that discretizing standard models of neurons and synaptic
plasticity leads to rational agents maximizing simple scoring rules. Second,
our main result is that the scoring rules are proper, implying that neurons
faithfully encode expected utilities in their synaptic weights and encode
high-scoring outcomes in their spikes. Third, with this foundation in hand, we
propose a biologically plausible mechanism whereby neurons backpropagate
incentives which allows them to optimize their usefulness to the rest of
cortex. Finally, experiments show that networks that backpropagate incentives
can learn simple tasks.
","[{'version': 'v1', 'created': 'Tue, 7 Jan 2014 18:28:20 GMT'}]",2014-01-08,"[['Balduzzi', 'David', '']]","['incentives for cooperation', 'multiagent learning', 'biologically-inspired approaches', 'prediction markets']"
20319,1511.00971,Diego Marron,"Diego Marr\'on (dmarron@ac.upc.edu) and Jesse Read
  (jesse.read@aalto.fi) and Albert Bifet (albert.bifet@telecom-paristech.fr)
  and Nacho Navarro (nacho@ac.upc.edu)","Data Stream Classification using Random Feature Functions and Novel
  Method Combinations","20 pages, journal",,,,cs.LG cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Big Data streams are being generated in a faster, bigger, and more
commonplace. In this scenario, Hoeffding Trees are an established method for
classification. Several extensions exist, including high-performing ensemble
setups such as online and leveraging bagging. Also, $k$-nearest neighbors is a
popular choice, with most extensions dealing with the inherent performance
limitations over a potentially-infinite stream.
  At the same time, gradient descent methods are becoming increasingly popular,
owing in part to the successes of deep learning. Although deep neural networks
can learn incrementally, they have so far proved too sensitive to
hyper-parameter options and initial conditions to be considered an effective
`off-the-shelf' data-streams solution.
  In this work, we look at combinations of Hoeffding-trees, nearest neighbour,
and gradient descent methods with a streaming preprocessing approach in the
form of a random feature functions filter for additional predictive power.
  We further extend the investigation to implementing methods on GPUs, which we
test on some large real-world datasets, and show the benefits of using GPUs for
data-stream learning due to their high scalability.
  Our empirical evaluation yields positive results for the novel approaches
that we experiment with, highlighting important issues, and shed light on
promising future directions in approaches to data-stream classification.
","[{'version': 'v1', 'created': 'Tue, 3 Nov 2015 16:29:57 GMT'}]",2015-11-04,"[['Marrón', 'Diego', '', 'dmarron@ac.upc.edu'], ['Read', 'Jesse', '', 'jesse.read@aalto.fi'], ['Bifet', 'Albert', '', 'albert.bifet@telecom-paristech.fr'], ['Navarro', 'Nacho', '', 'nacho@ac.upc.edu']]","['Data Stream Mining', 'Big Data', 'Classification', 'GPUs']"
20320,1504.03711,Kristopher Micinski,"Kristopher Micinski, Jonathan Fetter-Degges, Jinseong Jeon, Jeffrey S.
  Foster, Michael R. Clarkson","Checking Interaction-Based Declassification Policies for Android Using
  Symbolic Execution","This research was supported in part by NSF grants CNS-1064997 and
  1421373, AFOSR grants FA9550-12-1-0334 and FA9550-14-1-0334, a partnership
  between UMIACS and the Laboratory for Telecommunication Sciences, and the
  National Security Agency",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Mobile apps can access a wide variety of secure information, such as contacts
and location. However, current mobile platforms include only coarse access
control mechanisms to protect such data. In this paper, we introduce
interaction-based declassification policies, in which the user's interactions
with the app constrain the release of sensitive information. Our policies are
defined extensionally, so as to be independent of the app's implementation,
based on sequences of security-relevant events that occur in app runs. Policies
use LTL formulae to precisely specify which secret inputs, read at which times,
may be released. We formalize a semantic security condition, interaction-based
noninterference, to define our policies precisely. Finally, we describe a
prototype tool that uses symbolic execution to check interaction-based
declassification policies for Android, and we show that it enforces policies
correctly on a set of apps.
","[{'version': 'v1', 'created': 'Tue, 14 Apr 2015 20:33:46 GMT'}, {'version': 'v2', 'created': 'Wed, 29 Jul 2015 14:14:24 GMT'}]",2015-07-30,"[['Micinski', 'Kristopher', ''], ['Fetter-Degges', 'Jonathan', ''], ['Jeon', 'Jinseong', ''], ['Foster', 'Jeffrey S.', ''], ['Clarkson', 'Michael R.', '']]","['Information flow', 'program analysis', 'symbolic execution']"
20321,1208.1672,Josphineleela Ramakrishnan,"Josphineleela Ramakrishnan, M. Ramakrishnan","An Efficient Automatic Attendance System Using Fingerprint
  Reconstruction Technique","6pages,5figures",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Biometric time and attendance system is one of the most successful
applications of biometric technology. One of the main advantage of a biometric
time and attendance system is it avoids ""buddy-punching"". Buddy punching was a
major loophole which will be exploiting in the traditional time attendance
systems. Fingerprint recognition is an established field today, but still
identifying individual from a set of enrolled fingerprints is a time taking
process. Most fingerprint-based biometric systems store the minutiae template
of a user in the database. It has been traditionally assumed that the minutiae
template of a user does not reveal any information about the original
fingerprint. This belief has now been shown to be false; several algorithms
have been proposed that can reconstruct fingerprint images from minutiae
templates. In this paper, a novel fingerprint reconstruction algorithm is
proposed to reconstruct the phase image, which is then converted into the
grayscale image. The proposed reconstruction algorithm reconstructs the phase
image from minutiae. The proposed reconstruction algorithm is used to automate
the whole process of taking attendance, manually which is a laborious and
troublesome work and waste a lot of time, with its managing and maintaining the
records for a period of time is also a burdensome task. The proposed
reconstruction algorithm has been evaluated with respect to the success rates
of type-I attack (match the reconstructed fingerprint against the original
fingerprint) and type-II attack (match the reconstructed fingerprint against
different impressions of the original fingerprint) using a commercial
fingerprint recognition system. Given the reconstructed image from our
algorithm, we show that both types of attacks can be effectively launched
against a fingerprint recognition system.
","[{'version': 'v1', 'created': 'Wed, 8 Aug 2012 14:23:50 GMT'}]",2012-08-09,"[['Ramakrishnan', 'Josphineleela', ''], ['Ramakrishnan', 'M.', '']]","['Fingerprint Reconstruction', 'attendance management system', 'Minutiae Extraction']"
20322,1205.0312,Weimao Ke Weimao Ke,Weimao Ke,Least Information Modeling for Information Retrieval,"10 pages, 3 figures",,,,cs.IR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We proposed a Least Information theory (LIT) to quantify meaning of
information in probability distribution changes, from which a new information
retrieval model was developed. We observed several important characteristics of
the proposed theory and derived two quantities in the IR context for document
representation. Given probability distributions in a collection as prior
knowledge, LI Binary (LIB) quantifies least information due to the binary
occurrence of a term in a document whereas LI Frequency (LIF) measures least
information based on the probability of drawing a term from a bag of words.
Three fusion methods were also developed to combine LIB and LIF quantities for
term weighting and document ranking. Experiments on four benchmark TREC
collections for ad hoc retrieval showed that LIT-based methods demonstrated
very strong performances compared to classic TF*IDF and BM25, especially for
verbose queries and hard search topics. The least information theory offers a
new approach to measuring semantic quantities of information and provides
valuable insight into the development of new IR models.
","[{'version': 'v1', 'created': 'Wed, 2 May 2012 03:02:21 GMT'}]",2012-05-03,"[['Ke', 'Weimao', '']]","['information measure', 'probability distribution', 'entropy', 'termweighting', 'ranking', 'retrieval model', 'effectiveness']"
20323,1603.00091,Dimitri Van Assche,"Toon Calders, Dimitri Van Assche",PROMETHEE is Not Quadratic: An O(qn log(n)) Algorithm,"16 pages, 2 figures",,,,cs.DS cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is generally believed that the preference ranking method PROMETHEE has a
quadratic time complexity. In this paper, however, we present an exact
algorithm that computes PROMETHEE's net flow scores in time O(qn log(n)), where
q represents the number of criteria and n the number of alternatives. The
method is based on first sorting the alternatives after which the unicriterion
flow scores of all alternatives can be computed in one scan over the sorted
list of alternatives while maintaining a sliding window. This method works with
the linear and level criterion preference functions. The algorithm we present
is exact and, due to the sub-quadratic time complexity, vastly extends the
applicability of the PROMETHEE method. Experiments show that with the new
algorithm, PROMETHEE can scale up to millions of tuples.
","[{'version': 'v1', 'created': 'Mon, 29 Feb 2016 23:25:51 GMT'}]",2016-03-02,"[['Calders', 'Toon', ''], ['Van Assche', 'Dimitri', '']]","['Decision Support Systems', 'PROMETHEE', 'Multicriteria', 'Incremental Computing', 'Multicriteria Decision Analysis']"
20324,1507.01067,Jaderick Pabico,"Marie Yvette B. de Robles, Zenith O. Arnejo, Jaderick P. Pabico",On Web-grid Implementation Using Single System Image,"10 pages, 6 figures, appeared in H.N. Adorna and A.L. Sioson (eds.)
  Proceedings of the 6th National Symposium on Mathematical Aspects of Computer
  Science (SMACS 2012), La Carmela de Boracay Convention Center, Boracay
  Island, Malay, Aklan, Philippines, 04-08 December 2012, pp. 135-143",,,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  With the latest innovations and trend towards personalizing users' web
browsing experience, the web has been increasingly dominated by dynamic
contents. However, delivering dynamic content remains a challenge due to the
many dependencies involved in compiling the content, specifically personalized
ones. This paper presents the use of Single System Image (SSI) clustering
systems for a cheap, off-the-shelf, local lightweight distributed web-grid
composed of desktop PCs. The three clustering systems considered in the study
are Kerrighed, OpenSSI and openMosix. Through an online simulation technique,
the performance savings achieved by the clustering systems were measured.
Results showed that Kerrighed has the least number of missed requests while the
response time is comparable with the rest.
","[{'version': 'v1', 'created': 'Sat, 4 Jul 2015 05:20:52 GMT'}]",2015-07-07,"[['de Robles', 'Marie Yvette B.', ''], ['Arnejo', 'Zenith O.', ''], ['Pabico', 'Jaderick P.', '']]","['Web servers', 'request redirection', 'local area networks', 'web-grid', 'desktop PCs', 'performance evaluation']"
20325,1109.6726,Rathipriya R,"R.Rathipriya, K.Thangavel",A Fuzzy Co-Clustering approach for Clickstream Data Pattern,,,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Web Usage mining is a very important tool to extract the hidden business
intelligence data from large databases. The extracted information provides the
organizations with the ability to produce results more effectively to improve
their businesses and increasing of sales. Co-clustering is a powerful
bipartition technique which identifies group of users associated to group of
web pages. These associations are quantified to reveal the users' interest in
the different web pages' clusters. In this paper, Fuzzy Co-Clustering algorithm
is proposed for clickstream data to identify the subset of users of similar
navigational behavior /interest over a subset of web pages of a website.
Targeting the users group for various promotional activities is an important
aspect of marketing practices. Experiments are conducted on real dataset to
prove the efficiency of proposed algorithm. The results and findings of this
algorithm could be used to enhance the marketing strategy for directing
marketing, advertisements for web based businesses and so on.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2011 06:45:41 GMT'}]",2011-10-03,"[['Rathipriya', 'R.', ''], ['Thangavel', 'K.', '']]","['Web usage mining', 'Fuzzy Co-Clustering', 'Target marketing', 'Clickstream data']"
20326,1408.0407,Bei Yu,Bei Yu and Subhendu Roy and Jhih-Rong Gao and David Z. Pan,"Triple Patterning Lithography (TPL) Layout Decomposition using
  End-Cutting (JM3 Special Session)","J. Micro/Nanolith. MEMS MOEMS 14(1) XXXXXX (Jan-Mar 2015). arXiv
  admin note: text overlap with arXiv:1402.2425",,,,cs.OH,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Triple patterning lithography (TPL) is one of the most promising techniques
in the 14nm logic node and beyond. Conventional LELELE type TPL technology
suffers from native conflict and overlapping problems. Recently, as an
alternative process, triple patterning lithography with end cutting (LELE-EC)
was proposed to overcome the limitations of LELELE manufacturing. In LELE-EC
process the first two masks are LELE type double patterning, while the third
mask is used to generate the end-cuts. Although the layout decomposition
problem for LELELE has been well-studied in the literature, only few attempts
have been made to address the LELE-EC layout decomposition problem. In this
paper we propose the comprehensive study for LELE-EC layout decomposition.
Conflict graph and end-cut graph are constructed to extract all the geometrical
relationships of both input layout and end-cut candidates. Based on these
graphs, integer linear programming (ILP) is formulated to minimize the conflict
number and the stitch number. The experimental results demonstrate the
effectiveness of the proposed algorithms.
","[{'version': 'v1', 'created': 'Sat, 2 Aug 2014 19:19:36 GMT'}]",2014-08-05,"[['Yu', 'Bei', ''], ['Roy', 'Subhendu', ''], ['Gao', 'Jhih-Rong', ''], ['Pan', 'David Z.', '']]","['triple/multiple patterning', 'end-cutting', 'layout decomposition', 'integer linear programming']"
20327,1412.6286,"Wendelin B\""ohmer","Wendelin B\""ohmer and Klaus Obermayer",Regression with Linear Factored Functions,Under review as conference paper at ECML/PKDD 2015,,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many applications that use empirically estimated functions face a curse of
dimensionality, because the integrals over most function classes must be
approximated by sampling. This paper introduces a novel regression-algorithm
that learns linear factored functions (LFF). This class of functions has
structural properties that allow to analytically solve certain integrals and to
calculate point-wise products. Applications like belief propagation and
reinforcement learning can exploit these properties to break the curse and
speed up computation. We derive a regularized greedy optimization scheme, that
learns factored basis functions during training. The novel regression algorithm
performs competitively to Gaussian processes on benchmark tasks, and the
learned LFF functions are with 4-9 factored basis functions on average very
compact.
","[{'version': 'v1', 'created': 'Fri, 19 Dec 2014 11:01:21 GMT'}, {'version': 'v2', 'created': 'Fri, 27 Feb 2015 14:53:35 GMT'}, {'version': 'v3', 'created': 'Mon, 30 Mar 2015 15:14:20 GMT'}]",2015-03-31,"[['Böhmer', 'Wendelin', ''], ['Obermayer', 'Klaus', '']]","['regression', 'factored functions', 'curse of dimensionality']"
20328,1502.04382,George Mertzios,"George B. Mertzios, Othon Michail, Paul G. Spirakis",Temporal Network Optimization Subject to Connectivity Constraints,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we consider \emph{temporal networks}, i.e. networks defined by a
\emph{labeling} $\lambda$ assigning to each edge of an \emph{underlying graph}
$G$ a set of \emph{discrete} time-labels. The labels of an edge, which are
natural numbers, indicate the discrete time moments at which the edge is
available. We focus on \emph{path problems} of temporal networks. In
particular, we consider \emph{time-respecting} paths, i.e. paths whose edges
are assigned by $\lambda$ a strictly increasing sequence of labels. We begin by
giving two efficient algorithms for computing shortest time-respecting paths on
a temporal network. We then prove that there is a \emph{natural analogue of
Menger's theorem} holding for arbitrary temporal networks. Finally, we propose
two \emph{cost minimization parameters} for temporal network design. One is the
\emph{temporality} of $G$, in which the goal is to minimize the maximum number
of labels of an edge, and the other is the \emph{temporal cost} of $G$, in
which the goal is to minimize the total number of labels used. Optimization of
these parameters is performed subject to some \emph{connectivity constraint}.
We prove several lower and upper bounds for the temporality and the temporal
cost of some very basic graph families such as rings, directed acyclic graphs,
and trees.
","[{'version': 'v1', 'created': 'Sun, 15 Feb 2015 23:23:27 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Jun 2018 21:39:02 GMT'}]",2018-07-02,"[['Mertzios', 'George B.', ''], ['Michail', 'Othon', ''], ['Spirakis', 'Paul G.', '']]","['Temporal network', 'graph labeling', 'Menger’s theorem', 'optimization', 'temporal connectivity', 'hardness of approximation']"
20329,1403.0052,Laurent Romary,"Laurent Romary (IDSL, INRIA Saclay - Ile de France, CMB)","TBX goes TEI -- Implementing a TBX basic extension for the Text Encoding
  Initiative guidelines",,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents an attempt to customise the TEI (Text Encoding
Initiative) guidelines in order to offer the possibility to incorporate TBX
(TermBase eXchange) based terminological entries within any kind of TEI
documents. After presenting the general historical, conceptual and technical
contexts, we describe the various design choices we had to take while creating
this customisation, which in turn have led to make various changes in the
actual TBX serialisation. Keeping in mind the objective to provide the TEI
guidelines with, again, an onomasiological model, we try to identify the best
comprise in maintaining both the isomorphism with the existing TBX Basic
standard and the characteristics of the TEI framework.
","[{'version': 'v1', 'created': 'Sat, 1 Mar 2014 06:46:11 GMT'}]",2014-03-04,"[['Romary', 'Laurent', '', 'IDSL, INRIA Saclay - Ile de France, CMB']]","['Terminology', 'XML', 'TBX', 'TEI']"
20330,0907.4128,Stefan Woltran,"Miroslaw Truszczy\'nski, Stefan Woltran",Relativized hyperequivalence of logic programs for modular programming,,,,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A recent framework of relativized hyperequivalence of programs offers a
unifying generalization of strong and uniform equivalence. It seems to be
especially well suited for applications in program optimization and modular
programming due to its flexibility that allows us to restrict, independently of
each other, the head and body alphabets in context programs. We study
relativized hyperequivalence for the three semantics of logic programs given by
stable, supported and supported minimal models. For each semantics, we identify
four types of contexts, depending on whether the head and body alphabets are
given directly or as the complement of a given set. Hyperequivalence relative
to contexts where the head and body alphabets are specified directly has been
studied before. In this paper, we establish the complexity of deciding
relativized hyperequivalence with respect to the three other types of context
programs.
  To appear in Theory and Practice of Logic Programming (TPLP).
","[{'version': 'v1', 'created': 'Thu, 23 Jul 2009 17:31:45 GMT'}]",2009-07-24,"[['Truszczyński', 'Miroslaw', ''], ['Woltran', 'Stefan', '']]","['answer-set programming', 'strong equivalence', 'uniform equivalence', 'relativized equivalence', 'stable models', 'supported models', 'minimal models', 'complexity']"
20331,1505.08023,Meng Wu,"Meng Wu, Can Yang, Taoran Xiang, Daning Cheng","The Research and Optimization of Parallel Finite Element Algorithm based
  on MiniFE",,,,,cs.DC cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Finite element method (FEM) is one of the most important numerical methods in
modern engineering design and analysis. Since traditional serial FEM is
difficult to solve large FE problems efficiently and accurately,
high-performance parallel FEM has become one of the essential way to solve
practical engineering problems. Based on MiniFE program, which is released by
National Energy Research Scientific Computing Center(NERSC), this work analyzes
concrete steps, key computing pattern and parallel mechanism of parallel FEM.
According to experimental results, this work analyzes the proportion of
calculation amount of each module and concludes the main performance bottleneck
of the program. Based on that, we optimize the MiniFE program on a server
platform. The optimization focuses on the bottleneck of the program - SpMV
kernel, and uses an efficient storage format named BCRS. Moreover, an improving
plan of hybrid MPI+OpenMP programming is provided. Experimental results show
that the optimized program performs better in both SpMV kernel and
synchronization. It can increase the performance of the program, on average, by
8.31%. Keywords : finite element, parallel, MiniFE, SpMV, performance
optimization
","[{'version': 'v1', 'created': 'Fri, 29 May 2015 12:44:04 GMT'}]",2015-06-01,"[['Wu', 'Meng', ''], ['Yang', 'Can', ''], ['Xiang', 'Taoran', ''], ['Cheng', 'Daning', '']]","['finite element', 'parallel', 'MiniFE', 'SpMV', 'performance optimization']"
20332,0707.0397,Shijun Xiang jack-xiang,Shijun Xiang and Jiwu Huang,Robust Audio Watermarking Against the D/A and A/D conversions,Pages 29,,,,cs.CR cs.MM,,"  Audio watermarking has played an important role in multimedia security. In
many applications using audio watermarking, D/A and A/D conversions (denoted by
DA/AD in this paper) are often involved. In previous works, however, the
robustness issue of audio watermarking against the DA/AD conversions has not
drawn sufficient attention yet. In our extensive investigation, it has been
found that the degradation of a watermarked audio signal caused by the DA/AD
conversions manifests itself mainly in terms of wave magnitude distortion and
linear temporal scaling, making the watermark extraction failed. Accordingly, a
DWT-based audio watermarking algorithm robust against the DA/AD conversions is
proposed in this paper. To resist the magnitude distortion, the relative energy
relationships among different groups of the DWT coefficients in the
low-frequency sub-band are utilized in watermark embedding by adaptively
controlling the embedding strength. Furthermore, the resynchronization is
designed to cope with the linear temporal scaling. The time-frequency
localization characteristics of DWT are exploited to save the computational
load in the resynchronization. Consequently, the proposed audio watermarking
algorithm is robust against the DA/AD conversions, other common audio
processing manipulations, and the attacks in StirMark Benchmark for Audio,
which has been verified by experiments.
","[{'version': 'v1', 'created': 'Tue, 3 Jul 2007 11:49:03 GMT'}]",2007-07-04,"[['Xiang', 'Shijun', ''], ['Huang', 'Jiwu', '']]","['Audio Watermarking', 'D/A and A/D Conversions', 'Resynchronization', 'Wave']"
20333,1712.06778,Saptarshi Pal,Saptarshi Pal and Soumya K Ghosh,"Learning Representations from Road Network for End-to-End Urban Growth
  Simulation",,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  From our experiences in the past, we have seen that the growth of cities is
very much dependent on the transportation networks. In mega cities,
transportation networks determine to a significant extent as to where the
people will move and houses will be built. Hence, transportation network data
is crucial to an urban growth prediction system. Existing works have used
manually derived distance based features based on the road networks to build
models on urban growth. But due to the non-generic and laborious nature of the
manual feature engineering process, we can shift to End-to-End systems which do
not rely on manual feature engineering. In this paper, we propose a method to
integrate road network data to an existing Rule based End-to-End framework
without manual feature engineering. Our method employs recurrent neural
networks to represent road networks in a structured way such that it can be
plugged into the previously proposed End-to-End framework. The proposed
approach enhances the performance in terms of Figure of Merit, Producer's
accuracy, User's accuracy and Overall accuracy of the existing Rule based
End-to-End framework.
","[{'version': 'v1', 'created': 'Tue, 19 Dec 2017 04:36:24 GMT'}, {'version': 'v2', 'created': 'Wed, 24 Jan 2018 12:06:49 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Feb 2018 05:25:11 GMT'}]",2018-02-08,"[['Pal', 'Saptarshi', ''], ['Ghosh', 'Soumya K', '']]","['Recurrent Neural Networks', 'Representation learning', 'Spatial Data Mining', 'End-to-End learning', 'Urban Growth']"
20334,1701.04293,Gabriele Lospoto,"Roberto di Lallo, Federico Griscioli, Gabriele Lospoto, Habib
  Mostafaei, Maurizio Pizzonia and Massimo Rimondini","Leveraging SDN to Monitor Critical Infrastricture Networks in a Smarter
  Way",,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In critical infrastructures, communication networks are used to exchange
vital data among elements of Industrial Control Systems (ICSes). Due to the
criticality of such systems and the increase of the cybersecurity risks in
these contexts, best practices recommend the adoption of Intrusion Detection
Systems (IDSes) as monitoring facilities. The choice of the positions of IDSes
is crucial to monitor as many streams of data traffic as possible. This is
especially true for the traffic patterns of ICS networks, mostly confined in
many subnetworks, which are geographically distributed and largely autonomous.
We introduce a methodology and a software architecture that allow an ICS
operator to use the spare bandwidth that might be available in over-provisioned
networks to forward replicas of traffic streams towards a single IDS placed at
an arbitrary location. We leverage certain characteristics of ICS networks,
like stability of topology and bandwidth needs predictability, and make use of
the Software-Defined Networking (SDN) paradigm. We fulfill strict requirements
about packet loss, for both functional and security aspects. Finally, we
evaluate our approach on network topologies derived from real networks.
","[{'version': 'v1', 'created': 'Mon, 16 Jan 2017 14:09:05 GMT'}]",2017-01-17,"[['di Lallo', 'Roberto', ''], ['Griscioli', 'Federico', ''], ['Lospoto', 'Gabriele', ''], ['Mostafaei', 'Habib', ''], ['Pizzonia', 'Maurizio', ''], ['Rimondini', 'Massimo', '']]","['Critical infrastructure (CI)', 'Software Defined Network (SDN)', 'Industrial Control Systems (ICSes)', 'Intrusion Detection System (IDS)']"
20335,1312.7243,Gautam K. Das,"Ramesh K. Jallu, Prajwal R. Prasad and Gautam K. Das",Minimum Dominating Set for a Point Set in $\IR^2$,"14 pages, 8 figures",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this article, we consider the problem of computing minimum dominating set
for a given set $S$ of $n$ points in $\IR^2$. Here the objective is to find a
minimum cardinality subset $S'$ of $S$ such that the union of the unit radius
disks centered at the points in $S'$ covers all the points in $S$. We first
propose a simple 4-factor and 3-factor approximation algorithms in $O(n^6 \log
n)$ and $O(n^{11} \log n)$ time respectively improving time complexities by a
factor of $O(n^2)$ and $O(n^4)$ respectively over the best known result
available in the literature [M. De, G.K. Das, P. Carmi and S.C. Nandy, {\it
Approximation algorithms for a variant of discrete piercing set problem for
unit disk}, Int. J. of Comp. Geom. and Appl., to appear]. Finally, we propose a
very important shifting lemma, which is of independent interest and using this
lemma we propose a $\frac{5}{2}$-factor approximation algorithm and a PTAS for
the minimum dominating set problem.
","[{'version': 'v1', 'created': 'Fri, 27 Dec 2013 11:09:37 GMT'}, {'version': 'v2', 'created': 'Sun, 5 Jan 2014 13:29:55 GMT'}]",2014-01-07,"[['Jallu', 'Ramesh K.', ''], ['Prasad', 'Prajwal R.', ''], ['Das', 'Gautam K.', '']]","['minimum dominating set', 'unit disk graph', 'approximation algorithm']"
20336,1105.3232,Sokol Kosta,"Sokol Kosta, Andrius Aucinas, Pan Hui, Richard Mortier, Xinwen Zhang",Unleashing the Power of Mobile Cloud Computing using ThinkAir,17 pages,,,,cs.DC cs.NI cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Smartphones have exploded in popularity in recent years, becoming ever more
sophisticated and capable. As a result, developers worldwide are building
increasingly complex applications that require ever increasing amounts of
computational power and energy. In this paper we propose ThinkAir, a framework
that makes it simple for developers to migrate their smartphone applications to
the cloud. ThinkAir exploits the concept of smartphone virtualization in the
cloud and provides method level computation offloading. Advancing on previous
works, it focuses on the elasticity and scalability of the server side and
enhances the power of mobile cloud computing by parallelizing method execution
using multiple Virtual Machine (VM) images. We evaluate the system using a
range of benchmarks starting from simple micro-benchmarks to more complex
applications. First, we show that the execution time and energy consumption
decrease two orders of magnitude for the N-queens puzzle and one order of
magnitude for a face detection and a virus scan application, using cloud
offloading. We then show that if a task is parallelizable, the user can request
more than one VM to execute it, and these VMs will be provided dynamically. In
fact, by exploiting parallelization, we achieve a greater reduction on the
execution time and energy consumption for the previous applications. Finally,
we use a memory-hungry image combiner tool to demonstrate that applications can
dynamically request VMs with more computational power in order to meet their
computational requirements.
","[{'version': 'v1', 'created': 'Mon, 16 May 2011 21:45:54 GMT'}]",2015-03-19,"[['Kosta', 'Sokol', ''], ['Aucinas', 'Andrius', ''], ['Hui', 'Pan', ''], ['Mortier', 'Richard', ''], ['Zhang', 'Xinwen', '']]","['Mobile Cloud Computing', 'Smartphone', 'Virtual Machine', 'Power Consumption', 'Code Offloading']"
20337,1410.0309,Maria Saumell,"Tom\'a\v{s} Kaiser, Maria Saumell, Nico Van Cleemput",10-Gabriel graphs are Hamiltonian,,,,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a set $S$ of points in the plane, the $k$-Gabriel graph of $S$ is the
geometric graph with vertex set $S$, where $p_i,p_j\in S$ are connected by an
edge if and only if the closed disk having segment $\bar{p_ip_j}$ as diameter
contains at most $k$ points of $S \setminus \{p_i,p_j\}$. We consider the
following question: What is the minimum value of $k$ such that the $k$-Gabriel
graph of every point set $S$ contains a Hamiltonian cycle? For this value, we
give an upper bound of 10 and a lower bound of 2. The best previously known
values were 15 and 1, respectively.
","[{'version': 'v1', 'created': 'Wed, 1 Oct 2014 17:58:13 GMT'}, {'version': 'v2', 'created': 'Fri, 19 Dec 2014 11:31:42 GMT'}, {'version': 'v3', 'created': 'Wed, 11 Feb 2015 16:42:53 GMT'}, {'version': 'v4', 'created': 'Sat, 6 Jun 2015 07:02:34 GMT'}]",2015-06-09,"[['Kaiser', 'Tomáš', ''], ['Saumell', 'Maria', ''], ['Van Cleemput', 'Nico', '']]","['Computational geometry', 'Proximity graphs', 'Gabriel graphs', 'Hamiltonian cycles']"
20338,1307.0539,Guodong Shi,"Guodong Shi, Alexandre Proutiere, Mikael Johansson, John S. Baras,
  Karl H. Johansson",The Evolution of Beliefs over Signed Social Networks,,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the evolution of opinions (or beliefs) over a social network modeled
as a signed graph. The sign attached to an edge in this graph characterizes
whether the corresponding individuals or end nodes are friends (positive links)
or enemies (negative links). Pairs of nodes are randomly selected to interact
over time, and when two nodes interact, each of them updates its opinion based
on the opinion of the other node and the sign of the corresponding link. This
model generalizes DeGroot model to account for negative links: when two enemies
interact, their opinions go in opposite directions. We provide conditions for
convergence and divergence in expectation, in mean-square, and in almost sure
sense, and exhibit phase transition phenomena for these notions of convergence
depending on the parameters of the opinion update model and on the structure of
the underlying graph. We establish a {\it no-survivor} theorem, stating that
the difference in opinions of any two nodes diverges whenever opinions in the
network diverge as a whole. We also prove a {\it live-or-die} lemma, indicating
that almost surely, the opinions either converge to an agreement or diverge.
Finally, we extend our analysis to cases where opinions have hard lower and
upper limits. In these cases, we study when and how opinions may become
asymptotically clustered to the belief boundaries, and highlight the crucial
influence of (strong or weak) structural balance of the underlying network on
this clustering phenomenon.
","[{'version': 'v1', 'created': 'Mon, 1 Jul 2013 21:21:59 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Nov 2014 10:15:02 GMT'}, {'version': 'v3', 'created': 'Fri, 14 Aug 2015 07:58:11 GMT'}]",2015-08-17,"[['Shi', 'Guodong', ''], ['Proutiere', 'Alexandre', ''], ['Johansson', 'Mikael', ''], ['Baras', 'John S.', ''], ['Johansson', 'Karl H.', '']]","['opinion dynamics', 'signed graph', 'social networks', 'opinion clustering']"
20339,1705.07687,Aitor Garcia Pablos,"Aitor Garc\'ia-Pablos, Montse Cuadros, German Rigau",W2VLDA: Almost Unsupervised System for Aspect Based Sentiment Analysis,,,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the increase of online customer opinions in specialised websites and
social networks, the necessity of automatic systems to help to organise and
classify customer reviews by domain-specific aspect/categories and sentiment
polarity is more important than ever. Supervised approaches to Aspect Based
Sentiment Analysis obtain good results for the domain/language their are
trained on, but having manually labelled data for training supervised systems
for all domains and languages are usually very costly and time consuming. In
this work we describe W2VLDA, an almost unsupervised system based on topic
modelling, that combined with some other unsupervised methods and a minimal
configuration, performs aspect/category classifiation,
aspect-terms/opinion-words separation and sentiment polarity classification for
any given domain and language. We evaluate the performance of the aspect and
sentiment classification in the multilingual SemEval 2016 task 5 (ABSA)
dataset. We show competitive results for several languages (English, Spanish,
French and Dutch) and domains (hotels, restaurants, electronic-devices).
","[{'version': 'v1', 'created': 'Mon, 22 May 2017 12:01:10 GMT'}, {'version': 'v2', 'created': 'Tue, 18 Jul 2017 07:36:48 GMT'}]",2017-07-19,"[['García-Pablos', 'Aitor', ''], ['Cuadros', 'Montse', ''], ['Rigau', 'German', '']]","['Sentiment Analysis', 'Almost Unsupervised', 'Multilingual', 'Multidomain']"
20340,1610.03706,Ge Wang,"Yang Liu, Fengrong Ou, Yan Deng, Bo Wu, Ruxi Liu, Hui Hua, Yuyuan
  Guan, Rentong Chen, Lars Gjesteby, Jiansheng Yang, Michael Vannier, Ge Wang",Bibliometric Index for Academic Leadership,"25 pages, 4 figures, 4 tables, 33 references",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Academic leadership is essential for research innovation and impact. Until
now, there has been no dedicated measure of leadership by bibliometrics.
Popular bibliometric indices are mainly based on academic output, such as the
journal impact factor and the number of citations. Here we develop an academic
leadership index based on readily available bibliometric data that is sensitive
to not only academic output but also research efficiency. Our leadership index
was tested in two studies on peer-reviewed journal papers by
extramurally-funded principal investigators in the field of life sciences from
China and the USA, respectively. The leadership performance of these principal
investigators was quantified and compared relative to university rank and other
factors. As a validation measure, we show that the highest average leadership
index was achieved by principal investigators at top national universities in
both countries. More interestingly, our results also indicate that on an
individual basis, strong leadership and high efficiency are not necessarily
associated with those at top-tier universities nor with the most funding. This
leadership index may become the basis of a comprehensive merit system,
facilitating academic evaluation and resource management.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2016 13:29:55 GMT'}]",2016-10-13,"[['Liu', 'Yang', ''], ['Ou', 'Fengrong', ''], ['Deng', 'Yan', ''], ['Wu', 'Bo', ''], ['Liu', 'Ruxi', ''], ['Hua', 'Hui', ''], ['Guan', 'Yuyuan', ''], ['Chen', 'Rentong', ''], ['Gjesteby', 'Lars', ''], ['Yang', 'Jiansheng', ''], ['Vannier', 'Michael', ''], ['Wang', 'Ge', '']]","['Bibliometrics', 'academic output', 'research efficiency', 'leadership index', 'A-index']"
20341,0712.1400,An-Ping Li,An-Ping Li,Birthday attack to discrete logarithm,4 pages,,,,cs.CR,,"  The discrete logarithm in a finite group of large order has been widely
applied in public key cryptosystem. In this paper, we will present a
probabilistic algorithm for discrete logarithm.
","[{'version': 'v1', 'created': 'Mon, 10 Dec 2007 06:15:49 GMT'}, {'version': 'v2', 'created': 'Tue, 11 Dec 2007 01:57:48 GMT'}]",2009-03-21,"[['Li', 'An-Ping', '']]","['discrete logarithm', 'collisions', 'probability', 'birthday paradox', 'linear system']"
20342,0905.2004,Yi-Dong Shen,"Yi-Dong Shen, Danny De Schreye, Dean Voets",Termination Prediction for General Logic Programs,"28 pages, 12 figures. to appear in Theory and Practice of Logic
  Programming (TPLP)",,,,cs.PL cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a heuristic framework for attacking the undecidable termination
problem of logic programs, as an alternative to current
termination/non-termination proof approaches. We introduce an idea of
termination prediction, which predicts termination of a logic program in case
that neither a termination nor a non-termination proof is applicable. We
establish a necessary and sufficient characterization of infinite (generalized)
SLDNF-derivations with arbitrary (concrete or moded) queries, and develop an
algorithm that predicts termination of general logic programs with arbitrary
non-floundering queries. We have implemented a termination prediction tool and
obtained quite satisfactory experimental results. Except for five programs
which break the experiment time limit, our prediction is 100% correct for all
296 benchmark programs of the Termination Competition 2007, of which eighteen
programs cannot be proved by any of the existing state-of-the-art analyzers
like AProVE07, NTI, Polytool and TALP.
","[{'version': 'v1', 'created': 'Wed, 13 May 2009 02:47:06 GMT'}]",2009-05-14,"[['Shen', 'Yi-Dong', ''], ['De Schreye', 'Danny', ''], ['Voets', 'Dean', '']]","['Logic programming', 'termination analysis', 'loop checking', 'moded queries', 'terminationprediction']"
20343,1401.4273,Anders Hansson,Michel Verhaegen and Anders Hansson,Nuclear Norm Subspace Identification (N2SID) for short data batches,Submitted to 2014 IFAC World Congress,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Subspace identification is revisited in the scope of nuclear norm
minimization methods. It is shown that essential structural knowledge about the
unknown data matrices in the data equation that relates Hankel matrices
constructed from input and output data can be used in the first step of the
numerical solution presented. The structural knowledge comprises the low rank
property of a matrix that is the product of the extended observability matrix
and the state sequence and the Toeplitz structure of the matrix of Markov
parameters (of the system in innovation form). The new subspace identification
method is referred to as the N2SID (twice the N of Nuclear Norm and SID for
Subspace IDentification) method. In addition to include key structural
knowledge in the solution it integrates the subspace calculation with
minimization of a classical prediction error cost function. The nuclear norm
relaxation enables us to perform such integration while preserving convexity.
The advantages of N2SID are demonstrated in a numerical open- and closed-loop
simulation study. Here a comparison is made with another widely used SID
method, i.e. N4SID. The comparison focusses on the identification with short
data batches, i.e. where the number of measurements is a small multiple of the
system order.
","[{'version': 'v1', 'created': 'Fri, 17 Jan 2014 08:54:45 GMT'}]",2014-01-20,"[['Verhaegen', 'Michel', ''], ['Hansson', 'Anders', '']]","['Subspace system identification', 'Nuclear norm optimization', 'Rank constraint', 'Shortdata batches']"
20344,1004.1774,Rdv Ijcsis,"K.Valarmathi, N. Malmurugan","Joint Design of Congestion Control Routing With Distributed Multi
  Channel Assignment in Wireless Mesh Networks","IEEE Publication format, ISSN 1947 5500,
  http://sites.google.com/site/ijcsis/","IJCSIS, Vol. 7 No. 3, March 2010, 261-266",,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  In Wireless Mesh Networks (WMN), a channel assignment has to balance the
objectives of maintaining connectivity and increasing the aggregate bandwidth.
The main aim of the channel assignment algorithm is to assign the channels to
the network interfaces, from the given expected load on each virtual link. From
the existing work done so far, we can examine that there is no combined
solution of multi-channel assignment with routing and congestion control. In
this paper, we propose a congestion control routing protocol along with
multi-channel assignment. We use a traffic aware metric in this protocol in
order to provide quality of service. The proposed protocol can improve the
throughput and channel utilization to very high extent because it provides
solution for multi-channel assignment and congestion control. The proposed
algorithm assigns the channels in a way that, congestion is avoided and
co-channel interference levels among links with same channel are reduced. By
our simulation results in NS2, we show that the proposed protocol attains high
throughput and channel utilization along with reduced latency.
","[{'version': 'v1', 'created': 'Sun, 11 Apr 2010 08:23:46 GMT'}]",2010-04-13,"[['Valarmathi', 'K.', ''], ['Malmurugan', 'N.', '']]","['Wireless Mesh Networks (WMN)', 'channel assignment algorithm', 'multi-channel assignment', 'routing', 'congestion control']"
20345,1412.7968,Martin Homola,"Martin Ringsquandl, Steffen Lamparter, and Raffaello Lepratti",Context-Aware Analytics in MOM Applications,"ARCOE-Logic 2014 Workshop Notes, pp. 44-49",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Manufacturing Operations Management (MOM) systems are complex in the sense
that they integrate data from heterogeneous systems inside the automation
pyramid. The need for context-aware analytics arises from the dynamics of these
systems that influence data generation and hamper comparability of analytics,
especially predictive models (e.g. predictive maintenance), where concept drift
affects application of these models in the future. Recently, an increasing
amount of research has been directed towards data integration using semantic
context models. Manual construction of such context models is an elaborate and
error-prone task. Therefore, we pose the challenge to apply combinations of
knowledge extraction techniques in the domain of analytics in MOM, which
comprises the scope of data integration within Product Life-cycle Management
(PLM), Enterprise Resource Planning (ERP), and Manufacturing Execution Systems
(MES). We describe motivations, technological challenges and show benefits of
context-aware analytics, which leverage from and regard the interconnectedness
of semantic context data. Our example scenario shows the need for distribution
and effective change tracking of context information.
","[{'version': 'v1', 'created': 'Fri, 26 Dec 2014 18:32:58 GMT'}]",2014-12-30,"[['Ringsquandl', 'Martin', ''], ['Lamparter', 'Steffen', ''], ['Lepratti', 'Raffaello', '']]","['Semantic Context', 'Context-aware Analytics', 'Manufacturing Operations Management']"
20346,1109.6714,Nan Zhao,Nan Zhao,"A Novel Two-stage Entropy-based Robust Cooperative Spectrum Sensing
  Scheme with Two-bit Decision in Cognitive Radio",,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Spectrum sensing is a key problem in cognitive radio. However, traditional
detectors become ineffective when noise uncertainty is severe. It is shown that
the entropy of Gauss white noise is constant in the frequency domain, and a
robust detector based on the entropy of spectrum amplitude was proposed. In
this paper a novel detector is proposed based on the entropy of spectrum power
density, and its performance is better than the previous scheme with less
computational complexity. Furthermore, to improve the reliability of the
detection, a two-stage entropy-based cooperative spectrum sensing scheme using
two-bit decision is proposed, and simulation results show its superior
performance with relatively low computational complexity.
","[{'version': 'v1', 'created': 'Fri, 30 Sep 2011 04:48:37 GMT'}]",2011-10-03,"[['Zhao', 'Nan', '']]","['Cognitive radio', 'cooperative spectrum sensing', 'information entropy', 'two-stage detection', 'noise uncertainty']"
20347,1410.4838,Chayanika Sharma,"Chayanika Sharma, Sangeeta Sabharwal, Ritu Sibal","Applying Genetic Algorithm for Prioritization of Test Case Scenarios
  Derived from UML Diagrams",12 pages,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software testing involves identifying the test cases whichdiscover errors in
the program. However, exhaustive testing ofsoftware is very time consuming. In
this paper, a technique isproposed to prioritize test case scenarios by
identifying the critical path clusters using genetic algorithm. The test case
scenarios are derived from the UML activity diagram and state chart diagram.
The testing efficiency is optimized by applying the genetic algorithm on the
test data. The information flow metric is adopted in this work for calculating
the information flow complexity associated with each node of the activity
diagram and state chart diagram.
","[{'version': 'v1', 'created': 'Fri, 17 Oct 2014 09:27:46 GMT'}]",2014-10-21,"[['Sharma', 'Chayanika', ''], ['Sabharwal', 'Sangeeta', ''], ['Sibal', 'Ritu', '']]","['software testing', 'genetic algorithm', 'activity diagram', 'state chart diagram', 'CFG', 'SDG', 'test case']"
20348,1111.1896,Bruno Gon\c{c}alves,"Janette Lehmann, Bruno Gon\c{c}alves, Jos\'e J. Ramasco, Ciro Cattuto",Dynamical Classes of Collective Attention in Twitter,"10 pages, 5 figures, 2 tables - To Appear in WWW'12","WWW'12, 251 (2012)",,,cs.SI cs.CY cs.HC physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Micro-blogging systems such as Twitter expose digital traces of social
discourse with an unprecedented degree of resolution of individual behaviors.
They offer an opportunity to investigate how a large-scale social system
responds to exogenous or endogenous stimuli, and to disentangle the temporal,
spatial and topical aspects of users' activity. Here we focus on spikes of
collective attention in Twitter, and specifically on peaks in the popularity of
hashtags. Users employ hashtags as a form of social annotation, to define a
shared context for a specific event, topic, or meme. We analyze a large-scale
record of Twitter activity and find that the evolution of hastag popularity
over time defines discrete classes of hashtags. We link these dynamical classes
to the events the hashtags represent and use text mining techniques to provide
a semantic characterization of the hastag classes. Moreover, we track the
propagation of hashtags in the Twitter social network and find that epidemic
spreading plays a minor role in hastag popularity, which is mostly driven by
exogenous factors.
","[{'version': 'v1', 'created': 'Tue, 8 Nov 2011 13:06:22 GMT'}, {'version': 'v2', 'created': 'Thu, 1 Mar 2012 17:45:52 GMT'}]",2012-04-24,"[['Lehmann', 'Janette', ''], ['Gonçalves', 'Bruno', ''], ['Ramasco', 'José J.', ''], ['Cattuto', 'Ciro', '']]","['online social networks', 'micro-blogging', 'content analysis']"
20349,1202.6109,Maia Fraser,Maia Fraser,Local Routing in Graphs Embedded on Surfaces of Arbitrary Genus,"18 pages, 3 figures",,,,cs.CG math.AT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a local routing algorithm which guarantees delivery in all
connected graphs embedded on a known surface of genus $g$. The algorithm
transports $O(g\log n)$ memory and finishes in time $O(g^2n^2)$, where $n$ is
the size of the graph. It requires access to a homology basis for the surface.
This algorithm, GFR, may be viewed as a suitable generalization of Face Routing
(FR), the well-known algorithm for plane graphs, which we previously showed
does {\it not} guarantee delivery in graphs embedded on positive genus
surfaces. The problem for such surfaces is the potential presence of
homologically non-trivial closed walks which may be traversed by the right-hand
rule. We use an interesting mathematical property of homology bases (proven in
Lemma \ref{lem:connectFaceBdr}) to show that such walks will not impede GFR. FR
is at the base of most routing algorithms used in modern (2D) ad hoc networks:
these algorithms all involve additional local techniques to deal with
edge-crossings so FR may be applied. GFR should be viewed in the same light, as
a base algorithm which could for example be tailored to sensor networks on
surfaces in 3D. Currently there are no known efficient local, logarithmic
memory algorithms for 3D ad hoc networks. From a theoretical point of view our
work suggests that the efficiency advantages from which FR benefits are related
to the codimension one nature of an embedded graph in a surface rather than the
flatness of that surface (planarity).
","[{'version': 'v1', 'created': 'Tue, 28 Feb 2012 03:30:22 GMT'}]",2012-02-29,"[['Fraser', 'Maia', '']]","['sensor networks', 'local routing', 'topological graph', 'homology basis', 'Face Routing']"
20350,1005.0218,Olivier Teste,"Faiza Ghozzi (IRIT), Franck Ravat (IRIT), Olivier Teste (IRIT), Gilles
  Zurfluh (IRIT)",Contraintes pour mod\`ele et langage multidimensionnels,,"Bases de donn\'ees avanc\'ees 2003, Lyon : France (2003)",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper defines a constraint-based model dedicated to multidimensional
databases. The model we define represents data through a constellation of facts
(subjects of analyse) associated to dimensions (axis of analyse), which are
possibly shared. Each dimension is organised according to several hierarchies
(views of analyse) integrating several levels of data granularity. In order to
insure data consistency, we introduce 5 semantic constraints (exclusion,
inclusion, partition, simultaneity, totality) which can be intra-dimension or
inter-dimensions; the intra-dimension constraints allow the expression of
constraints between hierarchies within a same dimension whereas the
inter-dimensions constraints focus on hierarchies of distinct dimensions. We
also study repercussions of these constraints on multidimensional manipulations
and we provide extensions of the multidimensional operators.
","[{'version': 'v1', 'created': 'Mon, 3 May 2010 07:47:56 GMT'}]",2010-05-20,"[['Ghozzi', 'Faiza', '', 'IRIT'], ['Ravat', 'Franck', '', 'IRIT'], ['Teste', 'Olivier', '', 'IRIT'], ['Zurfluh', 'Gilles', '', 'IRIT']]","['Multidimensional databases', 'constraints', 'operator']"
20351,1704.05016,Dongdong Bai,"Dongdong Bai, Chaoqun Wang, Bo Zhang, Xiaodong Yi, Xuejun Yang",CNN Feature boosted SeqSLAM for Real-Time Loop Closure Detection,,,,,cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Loop closure detection (LCD) is an indispensable part of simultaneous
localization and mapping systems (SLAM); it enables robots to produce a
consistent map by recognizing previously visited places. When robots operate
over extended periods, robustness to viewpoint and condition changes as well as
satisfactory real-time performance become essential requirements for a
practical LCD system.
  This paper presents an approach to directly utilize the outputs at the
intermediate layer of a pre-trained convolutional neural network (CNN) as image
descriptors. The matching location is determined by matching the image
sequences through a method called SeqCNNSLAM. The utility of SeqCNNSLAM is
comprehensively evaluated in terms of viewpoint and condition invariance.
Experiments show that SeqCNNSLAM outperforms state-of-the-art LCD systems, such
as SeqSLAM and Change Removal, in most cases. To allow for the real-time
performance of SeqCNNSLAM, an acceleration method, A-SeqCNNSLAM, is
established. This method exploits the location relationship between the
matching images of adjacent images to reduce the matching range of the current
image. Results demonstrate that acceleration of 4-6 is achieved with minimal
accuracy degradation, and the method's runtime satisfies the real-time demand.
To extend the applicability of A-SeqCNNSLAM to new environments, a method
called O-SeqCNNSLAM is established for the online adjustment of the parameters
of A-SeqCNNSLAM.
","[{'version': 'v1', 'created': 'Mon, 17 Apr 2017 16:23:55 GMT'}]",2017-04-18,"[['Bai', 'Dongdong', ''], ['Wang', 'Chaoqun', ''], ['Zhang', 'Bo', ''], ['Yi', 'Xiaodong', ''], ['Yang', 'Xuejun', '']]","['Loop closure detection', 'CNN', 'SeqCNNSLAM', 'A-SeqCNNSLAM', 'O-SeqCNNSLAM']"
20352,1003.4539,Heide Gluesing-Luerssen,Heide Gluesing-Luerssen and Elizabeth Weaver,"Linear tail-biting trellises: Characteristic generators and the
  BCJR-construction",28 pages,"updated version in IEEE Trans. Inf. Theory, 2011, vol. 57, 738-751",,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the constructions of tail-biting trellises for linear block
codes introduced by Koetter/Vardy (2003) and Nori/Shankar (2006). For a given
code we will define the sets of characteristic generators more generally than
by Koetter/Vardy and we will investigate how the choice of characteristic
generators affects the set of resulting product trellises, called KV-trellises.
Furthermore, we will show that each KV-trellis is a BCJR-trellis, defined in a
slightly stronger sense than by Nori/Shankar, and that the latter are always
non-mergeable. Finally, we will address a duality conjecture of Koetter/Vardy
by making use of a dualization technique of BCJR-trellises and prove the
conjecture for minimal trellises.
","[{'version': 'v1', 'created': 'Tue, 23 Mar 2010 21:38:00 GMT'}]",2011-01-24,"[['Gluesing-Luerssen', 'Heide', ''], ['Weaver', 'Elizabeth', '']]","['linear block codes', 'tail-biting trellises', 'characteristic generators', 'tail-bitingBCJR-trellises', 'minimal trellises']"
20353,1002.2294,Jean-Marc Seigneur,"Jean-Marc Seigneur, Xavier Titi",Reputation-based Telecommunication Network Selection,"Published in the Proceedings of the 2009 IADIS e-Society
  International Conference",,,,cs.NI cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, mobile users can switch between different available networks, for
example, nearby WiFi networks or their standard mobile operator network. Soon
it will be extended to other operators. However, unless telecommunication
operators can directly benefit from allowing a user to switch to another
operator, operators have an incentive to keep their network quality of service
confidential to avoid that their users decide to switch to another network. In
contrast, in a user-centric way, the users should be allowed to share their
observations regarding the networks that they have used. In this paper, we
present our work in progress towards attack-resistant sharing of quality of
service information and network provider reputation among mobile users.
","[{'version': 'v1', 'created': 'Thu, 11 Feb 2010 08:26:47 GMT'}]",2010-02-12,"[['Seigneur', 'Jean-Marc', ''], ['Titi', 'Xavier', '']]","['Reputation', 'trust', 'quality of service', 'telecommunication network provider']"
20354,1607.02282,Michael Holzhauser,"Michael Holzhauser, Sven O. Krumke, Clemens Thielen","On the Complexity and Approximability of Budget-Constrained Minimum Cost
  Flows",,,,,cs.DS math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the complexity and approximability of the budget-constrained
minimum cost flow problem, which is an extension of the traditional minimum
cost flow problem by a second kind of costs associated with each edge, whose
total value in a feasible flow is constrained by a given budget B. This problem
can, e.g., be seen as the application of the {\epsilon}-constraint method to
the bicriteria minimum cost flow problem. We show that we can solve the problem
exactly in weakly polynomial time $O(\log M \cdot MCF(m,n,C,U))$, where C, U,
and M are upper bounds on the largest absolute cost, largest capacity, and
largest absolute value of any number occuring in the input, respectively, and
MCF(m,n,C,U) denotes the complexity of finding a traditional minimum cost flow.
Moreover, we present two fully polynomial-time approximation schemes for the
problem on general graphs and one with an improved running-time for the problem
on acyclic graphs.
","[{'version': 'v1', 'created': 'Fri, 8 Jul 2016 09:22:47 GMT'}]",2016-07-11,"[['Holzhauser', 'Michael', ''], ['Krumke', 'Sven O.', ''], ['Thielen', 'Clemens', '']]","['algorithms', 'complexity', 'minimum cost flow', 'approximation']"
20355,1506.08592,Joan Boyar,Joan Boyar and Christian Kudahl,Adding Isolated Vertices Makes some Online Algorithms Optimal,"A footnote in the .tex file didn't show up in the last version. This
  was fixed",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An unexpected difference between online and offline algorithms is observed.
The natural greedy algorithms are shown to be worst case online optimal for
Online Independent Set and Online Vertex Cover on graphs with 'enough' isolated
vertices, Freckle Graphs. For Online Dominating Set, the greedy algorithm is
shown to be worst case online optimal on graphs with at least one isolated
vertex. These algorithms are not online optimal in general. The online
optimality results for these greedy algorithms imply optimality according to
various worst case performance measures, such as the competitive ratio. It is
also shown that, despite this worst case optimality, there are Freckle graphs
where the greedy independent set algorithm is objectively less good than
another algorithm. It is shown that it is NP-hard to determine any of the
following for a given graph: the online independence number, the online vertex
cover number, and the online domination number.
","[{'version': 'v1', 'created': 'Mon, 29 Jun 2015 11:49:29 GMT'}, {'version': 'v2', 'created': 'Fri, 8 Jul 2016 13:03:11 GMT'}, {'version': 'v3', 'created': 'Thu, 2 Mar 2017 07:24:20 GMT'}, {'version': 'v4', 'created': 'Fri, 3 Mar 2017 07:20:51 GMT'}]",2017-03-06,"[['Boyar', 'Joan', ''], ['Kudahl', 'Christian', '']]","['online algorithms', 'greedy algorithm', 'isolated vertices', 'onlineindependence number']"
20356,1504.07662,Dragomir Yankov,"Dragomir Yankov, Pavel Berkhin, Lihong Li",Evaluation of Explore-Exploit Policies in Multi-result Ranking Systems,,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We analyze the problem of using Explore-Exploit techniques to improve
precision in multi-result ranking systems such as web search, query
autocompletion and news recommendation. Adopting an exploration policy directly
online, without understanding its impact on the production system, may have
unwanted consequences - the system may sustain large losses, create user
dissatisfaction, or collect exploration data which does not help improve
ranking quality. An offline framework is thus necessary to let us decide what
policy and how we should apply in a production environment to ensure positive
outcome. Here, we describe such an offline framework.
  Using the framework, we study a popular exploration policy - Thompson
sampling. We show that there are different ways of implementing it in
multi-result ranking systems, each having different semantic interpretation and
leading to different results in terms of sustained click-through-rate (CTR)
loss and expected model improvement. In particular, we demonstrate that
Thompson sampling can act as an online learner optimizing CTR, which in some
cases can lead to an interesting outcome: lift in CTR during exploration. The
observation is important for production systems as it suggests that one can get
both valuable exploration data to improve ranking performance on the long run,
and at the same time increase CTR while exploration lasts.
","[{'version': 'v1', 'created': 'Tue, 28 Apr 2015 21:16:07 GMT'}]",2015-04-30,"[['Yankov', 'Dragomir', ''], ['Berkhin', 'Pavel', ''], ['Li', 'Lihong', '']]","['explore-exploit', 'ranking', 'evaluation', 'thompson sampling']"
20357,1403.2170,Baris Baykant Alagoz,B. Baykant Alagoz,On the Harmonic Oscillation of High-order Linear Time Invariant Systems,8 Figures 12 pages,,,,cs.DM cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Linear time invariant (LTI) systems are widely used for modeling system
dynamics in science and engineering problems. Harmonic oscillation of LTI
systems are widely used for modeling and analyses of periodic physical
phenomenon. This study investigates sufficient conditions to obtain harmonic
oscillation for high-order LTI systems. The paper presents a design procedure
for controlling harmonic oscillation of singleinput single-output high-order
LTI systems. LTI system coefficients are calculated by the solution of linear
equation set, which imposes a stable sinusoidal oscillation solution for the
characteristic polynomials of LTI systems. An example design is demonstrated
for fourth-order LTI systems and the control of harmonic oscillations are
discussed by illustrating Hilbert transform and spectrogram of oscillation
signals.
","[{'version': 'v1', 'created': 'Mon, 10 Mar 2014 08:56:02 GMT'}, {'version': 'v2', 'created': 'Fri, 14 Mar 2014 06:11:30 GMT'}]",2014-03-17,"[['Alagoz', 'B. Baykant', '']]","['Harmonic oscillation', 'system theory', 'high-order linear system', 'system modeling', 'root locus analysis', 'system design']"
20358,1108.1983,Rajeev Raman,J. Ian Munro and Rajeev Raman and Venkatesh Raman and S. Srinivasa Rao,Succinct Representations of Permutations and Functions,"Preliminary versions of these results have appeared in the
  Proceedings of ICALP 2003 and 2004. However, all results in this version are
  improved over the earlier conference version",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We investigate the problem of succinctly representing an arbitrary
permutation, \pi, on {0,...,n-1} so that \pi^k(i) can be computed quickly for
any i and any (positive or negative) integer power k. A representation taking
(1+\epsilon) n lg n + O(1) bits suffices to compute arbitrary powers in
constant time, for any positive constant \epsilon <= 1. A representation taking
the optimal \ceil{\lg n!} + o(n) bits can be used to compute arbitrary powers
in O(lg n / lg lg n) time.
  We then consider the more general problem of succinctly representing an
arbitrary function, f: [n] \rightarrow [n] so that f^k(i) can be computed
quickly for any i and any integer power k. We give a representation that takes
(1+\epsilon) n lg n + O(1) bits, for any positive constant \epsilon <= 1, and
computes arbitrary positive powers in constant time. It can also be used to
compute f^k(i), for any negative integer k, in optimal O(1+|f^k(i)|) time.
  We place emphasis on the redundancy, or the space beyond the
information-theoretic lower bound that the data structure uses in order to
support operations efficiently. A number of lower bounds have recently been
shown on the redundancy of data structures. These lower bounds confirm the
space-time optimality of some of our solutions. Furthermore, the redundancy of
one of our structures ""surpasses"" a recent lower bound by Golynski [Golynski,
SODA 2009], thus demonstrating the limitations of this lower bound.
","[{'version': 'v1', 'created': 'Tue, 9 Aug 2011 17:01:12 GMT'}]",2011-08-10,"[['Munro', 'J. Ian', ''], ['Raman', 'Rajeev', ''], ['Raman', 'Venkatesh', ''], ['Rao', 'S. Srinivasa', '']]","['Succinct data structures', 'Space redundancy', 'Permutations', 'Functions', 'Benes network', 'Succinct tree representations', 'Level ancestor queries']"
20359,1712.05302,Damla Kizilay,"Damla Kizilay, Deniz T. Eliiyi, Pascal Van Hentenryck","Constraint and Mathematical Programming Models for Integrated Port
  Container Terminal Operations",,,,,cs.AI math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers the integrated problem of quay crane assignment, quay
crane scheduling, yard location assignment, and vehicle dispatching operations
at a container terminal. The main objective is to minimize vessel turnover
times and maximize the terminal throughput, which are key economic drivers in
terminal operations. Due to their computational complexities, these problems
are not optimized jointly in existing work. This paper revisits this limitation
and proposes Mixed Integer Programming (MIP) and Constraint Programming (CP)
models for the integrated problem, under some realistic assumptions.
Experimental results show that the MIP formulation can only solve small
instances, while the CP model finds optimal solutions in reasonable times for
realistic instances derived from actual container terminal operations.
","[{'version': 'v1', 'created': 'Thu, 14 Dec 2017 15:56:46 GMT'}]",2017-12-15,"[['Kizilay', 'Damla', ''], ['Eliiyi', 'Deniz T.', ''], ['Van Hentenryck', 'Pascal', '']]","['Container Terminal Operations', 'Mixed Integer Programming', 'Constraint Programming']"
20360,0908.4431,Prabhulla Chandran Pillai,B Prabhulla Chandran Pillai,An OLAC Extension for Dravidian Languages,"4 Pages, 2 figures",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  OLAC was founded in 2000 for creating online databases of language resources.
This paper intends to review the bottom-up distributed character of the project
and proposes an extension of the architecture for Dravidian languages. An
ontological structure is considered for effective natural language processing
(NLP) and its advantages over statistical methods are reviewed
","[{'version': 'v1', 'created': 'Sun, 30 Aug 2009 23:20:41 GMT'}]",2009-09-01,"[['Pillai', 'B Prabhulla Chandran', '']]","['Dravidian language', 'Natural language processing', 'Ontology', 'Semantics']"
20361,1504.07553,Mark Bun,Mark Bun and Kobbi Nissim and Uri Stemmer and Salil Vadhan,Differentially Private Release and Learning of Threshold Functions,43 pages,,,,cs.CR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We prove new upper and lower bounds on the sample complexity of $(\epsilon,
\delta)$ differentially private algorithms for releasing approximate answers to
threshold functions. A threshold function $c_x$ over a totally ordered domain
$X$ evaluates to $c_x(y) = 1$ if $y \le x$, and evaluates to $0$ otherwise. We
give the first nontrivial lower bound for releasing thresholds with
$(\epsilon,\delta)$ differential privacy, showing that the task is impossible
over an infinite domain $X$, and moreover requires sample complexity $n \ge
\Omega(\log^*|X|)$, which grows with the size of the domain. Inspired by the
techniques used to prove this lower bound, we give an algorithm for releasing
thresholds with $n \le 2^{(1+ o(1))\log^*|X|}$ samples. This improves the
previous best upper bound of $8^{(1 + o(1))\log^*|X|}$ (Beimel et al., RANDOM
'13).
  Our sample complexity upper and lower bounds also apply to the tasks of
learning distributions with respect to Kolmogorov distance and of properly PAC
learning thresholds with differential privacy. The lower bound gives the first
separation between the sample complexity of properly learning a concept class
with $(\epsilon,\delta)$ differential privacy and learning without privacy. For
properly learning thresholds in $\ell$ dimensions, this lower bound extends to
$n \ge \Omega(\ell \cdot \log^*|X|)$.
  To obtain our results, we give reductions in both directions from releasing
and properly learning thresholds and the simpler interior point problem. Given
a database $D$ of elements from $X$, the interior point problem asks for an
element between the smallest and largest elements in $D$. We introduce new
recursive constructions for bounding the sample complexity of the interior
point problem, as well as further reductions and techniques for proving
impossibility results for other basic problems in differential privacy.
","[{'version': 'v1', 'created': 'Tue, 28 Apr 2015 16:15:01 GMT'}]",2015-04-29,"[['Bun', 'Mark', ''], ['Nissim', 'Kobbi', ''], ['Stemmer', 'Uri', ''], ['Vadhan', 'Salil', '']]","['differential privacy', 'PAC learning', 'lower bounds', 'threshold functions', 'fingerprintingcodes']"
20362,1606.05689,Dimitrios Thilikos,"Fedor V. Fomin and Daniel Lokshtanov and Saket Saurabh and Dimitrios
  M. Thilikos",Bidimensionality and Kernels,"An an earlier version of this paper appeared in SODA 2010. That paper
  contained preliminary versions of some of the results of this paper",,,,cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bidimensionality Theory was introduced by [E.D. Demaine, F.V. Fomin,
M.Hajiaghayi, and D.M. Thilikos. Subexponential parameterized algorithms on
graphs of bounded genus and H-minor-free graphs, J. ACM, 52 (2005),
pp.866--893] as a tool to obtain sub-exponential time parameterized algorithms
on H-minor-free graphs. In [E.D. Demaine and M.Hajiaghayi, Bidimensionality:
new connections between FPT algorithms and PTASs, in Proceedings of the 16th
Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, 2005,
pp.590--601] this theory was extended in order to obtain polynomial time
approximation schemes (PTASs) for bidimensional problems. In this work, we
establish a third meta-algorithmic direction for bidimensionality theory by
relating it to the existence of linear kernels for parameterized problems. In
particular, we prove that every minor (respectively contraction) bidimensional
problem that satisfies a separation property and is expressible in Countable
Monadic Second Order Logic (CMSO), admits a linear kernel for classes of graphs
that exclude a fixed graph (respectively an apex graph) H as a minor. Our
results imply that a multitude of bidimensional problems g graph classes. For
most of these problems no polynomial kernels on H-minor-free graphs were known
prior to our work.
","[{'version': 'v1', 'created': 'Fri, 17 Jun 2016 22:17:21 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Feb 2019 10:11:15 GMT'}, {'version': 'v3', 'created': 'Tue, 1 Sep 2020 10:00:14 GMT'}]",2020-09-02,"[['Fomin', 'Fedor V.', ''], ['Lokshtanov', 'Daniel', ''], ['Saurabh', 'Saket', ''], ['Thilikos', 'Dimitrios M.', '']]","['Kernelization', 'Parameterized algorithms', 'Treewidth', 'Bidimensionality']"
20363,0905.2257,Kees Middelburg,"J. A. Bergstra, C. A. Middelburg",A protocol for instruction stream processing,15pages,,,PRG0905,cs.PL cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The behaviour produced by an instruction sequence under execution is a
behaviour to be controlled by some execution environment: each step performed
actuates the processing of an instruction by the execution environment and a
reply returned at completion of the processing determines how the behaviour
proceeds. In this paper, we are concerned with the case where the processing
takes place remotely. We describe a protocol to deal with the case where the
behaviour produced by an instruction sequence under execution leads to the
generation of a stream of instructions to be processed and a remote execution
unit handles the processing of that stream of instructions.
","[{'version': 'v1', 'created': 'Thu, 14 May 2009 06:23:18 GMT'}]",2009-05-15,"[['Bergstra', 'J. A.', ''], ['Middelburg', 'C. A.', '']]","['instruction stream processing', 'thread algebra', 'process algebra']"
20364,1505.05962,Sriniwas Pandey,"Pankaj Kumar Yadav, Sriniwas Pandey, Sraban Kumar Mohanty",Nearest Neighbor based Clustering Algorithm for Large Data Sets,10 pages,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering is an unsupervised learning technique in which data or objects are
grouped into sets based on some similarity measure. Most of the clustering
algorithms assume that the main memory is infinite and can accommodate the set
of patterns. In reality many applications give rise to a large set of patterns
which does not fit in the main memory. When the data set is too large, much of
the data is stored in the secondary memory. Input/Outputs (I/O) from the disk
are the major bottleneck in designing efficient clustering algorithms for large
data sets. Different designing techniques have been used to design clustering
algorithms for large data sets. External memory algorithms are one class of
algorithms which can be used for large data sets. These algorithms exploit the
hierarchical memory structure of the computers by incorporating locality of
reference directly in the algorithm. This paper makes some contribution towards
designing clustering algorithms in the external memory model (Proposed by
Aggarwal and Vitter 1988) to make the algorithms scalable. In this paper, it is
shown that the Shared near neighbors algorithm is not very I/O efficient since
the computational complexity is same as the I/O complexity. The algorithm is
designed in the external memory model and I/O complexity is reduced. The
computational complexity remains same. We substantiate the theoretical analysis
by showing the performance of the algorithms with their traditional counterpart
by implementing in STXXL library.
","[{'version': 'v1', 'created': 'Fri, 22 May 2015 06:29:38 GMT'}]",2015-05-25,"[['Yadav', 'Pankaj Kumar', ''], ['Pandey', 'Sriniwas', ''], ['Mohanty', 'Sraban Kumar', '']]","['Clustering of Large data sets', 'Nearest Neighbor clustering', 'Shared Near Neighbors clustering', 'External memory clustering algorithms']"
20365,1609.03211,Charles Weko,"Yunpeng Zhao, Charles Weko",Network Inference from Grouped Data,"26 pages, 7 figures, 7 tables",,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In medical research, economics, and the social sciences data frequently
appear as subsets of a set of objects. Over the past century a number of
descriptive statistics have been developed to construct network structure from
such data. However, these measures lack a generating mechanism that links the
inferred network structure to the observed groups. To address this issue, we
propose a model-based approach called the Hub Model which assumes that every
observed group has a leader and that the leader has brought together the other
members of the group. The performance of Hub Models is demonstrated by
simulation studies. We apply this model to infer the relationships among
Senators serving in the 110th United States Congress, the characters in a
famous 18th century Chinese novel, and the distribution of flora in North
America.
","[{'version': 'v1', 'created': 'Sun, 11 Sep 2016 20:18:17 GMT'}]",2016-09-13,"[['Zhao', 'Yunpeng', ''], ['Weko', 'Charles', '']]","['Social network analysis', 'affiliation network', 'expectation-maximization algorithm', 'halfweight index', 'Dream of the Red Chamber']"
20366,1403.0093,Masoud Abbaszadeh,"Masoud Abbaszadeh, Horacio J. Marquez","Robust Nonlinear L2 Filtering of Uncertain Lipschitz Systems via Pareto
  Optimization","21 pages, 5 figures. arXiv admin note: text overlap with
  arXiv:1010.0696",,,,cs.SY math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new approach for robust Hinfty filtering for a class of Lipschitz nonlinear
systems with time-varying uncertainties both in the linear and nonlinear parts
of the system is proposed in an LMI framework. The admissible Lipschitz
constant of the system and the disturbance attenuation level are maximized
simultaneously through convex multiobjective optimization. The resulting Hinfty
filter guarantees asymptotic stability of the estimation error dynamics with
exponential convergence and is robust against nonlinear additive uncertainty
and time-varying parametric uncertainties. Explicit bounds on the nonlinear
uncertainty are derived based on norm-wise and element-wise robustness
analysis.
","[{'version': 'v1', 'created': 'Sat, 1 Mar 2014 15:08:19 GMT'}]",2014-03-04,"[['Abbaszadeh', 'Masoud', ''], ['Marquez', 'Horacio J.', '']]","['Nonlinear Uncertain Systems', 'Robust Observers', 'Nonlinear H∞ Filtering', 'Con']"
20367,1407.7313,Himanshu Raghuvanshi,"Pawan Patidar, Himanshu Raghuvanshi, Sayan Sarcar",Quickpie: An Interface for Fast and Accurate Eye Gazed based Text Entry,"This 6 page paper has been accepted as a student design contest paper
  at India HCI 2013 Conference, held at Bangalore, India during 24th to 27th
  September,2013",,,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Pie menus are suggested as powerful tool for eye gaze based text entry among
various interfaces developed so far. If pie menus are used with multiple depth
layers then multiple saccades are required per selection of item, which is
inefficient because it consumes more time. Also dwell time selection method is
limited in performance because higher dwell time suffers from inefficiency
while lower one from inaccuracy. To overcome problems with multiple depth
layers and dwell time, we designed Quickpie, an interface for eye gaze based
text entry with only one depth layer of pie menu and selection border as
selection method instead of dwell time. We investigated various parameters like
number of slices in pie menu, width characters and safe region, enlarged angle
of slice and selection methods to achieve better performance. Our experiment
results indicates that six number of slices with width of characters area 120
px performs better as compared to other designs.
","[{'version': 'v1', 'created': 'Mon, 28 Jul 2014 03:49:09 GMT'}]",2014-07-29,"[['Patidar', 'Pawan', ''], ['Raghuvanshi', 'Himanshu', ''], ['Sarcar', 'Sayan', '']]","['Eye gaze-based text entry mechanism', 'user interface design and evaluation', 'pie menus']"
20368,1505.04019,Fatima Vayani,"Ljiljana Brankovic and Costas S. Iliopoulos and Ritu Kundu and Manal
  Mohamed and Solon P. Pissis and Fatima Vayani",Linear-Time Superbubble Identification Algorithm for Genome Assembly,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  DNA sequencing is the process of determining the exact order of the
nucleotide bases of an individual's genome in order to catalogue sequence
variation and understand its biological implications. Whole-genome sequencing
techniques produce masses of data in the form of short sequences known as
reads. Assembling these reads into a whole genome constitutes a major
algorithmic challenge. Most assembly algorithms utilize de Bruijn graphs
constructed from reads for this purpose. A critical step of these algorithms is
to detect typical motif structures in the graph caused by sequencing errors and
genome repeats, and filter them out; one such complex subgraph class is a
so-called superbubble. In this paper, we propose an O(n+m)-time algorithm to
detect all superbubbles in a directed acyclic graph with n nodes and m
(directed) edges, improving the best-known O(m log m)-time algorithm by Sung et
al.
","[{'version': 'v1', 'created': 'Fri, 15 May 2015 10:52:50 GMT'}, {'version': 'v2', 'created': 'Mon, 25 May 2015 12:06:38 GMT'}, {'version': 'v3', 'created': 'Wed, 3 Jun 2015 09:38:20 GMT'}, {'version': 'v4', 'created': 'Tue, 1 Sep 2015 17:31:31 GMT'}, {'version': 'v5', 'created': 'Thu, 3 Sep 2015 11:35:36 GMT'}, {'version': 'v6', 'created': 'Thu, 17 Sep 2015 18:09:38 GMT'}]",2015-09-18,"[['Brankovic', 'Ljiljana', ''], ['Iliopoulos', 'Costas S.', ''], ['Kundu', 'Ritu', ''], ['Mohamed', 'Manal', ''], ['Pissis', 'Solon P.', ''], ['Vayani', 'Fatima', '']]","['genome assembly', 'de Bruijn graphs', 'superbubble']"
20369,1502.04240,Hanna Furmanczyk,"H. Furma\'nczyk, M. Kubale","Scheduling of unit-length jobs with cubic incompatibility graphs on
  three uniform machines",,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the paper we consider the problem of scheduling $n$ identical jobs on 3
uniform machines with speeds $s_1, s_2,$ and $s_3$ to minimize the schedule
length. We assume that jobs are subjected to some kind of mutual exclusion
constraints, modeled by a cubic incompatibility graph. We show that if the
graph is 2-chromatic then the problem can be solved in $O(n^2)$ time. If the
graph is 3-chromatic, the problem becomes NP-hard even if $s_1>s_2=s_3$.
However, in this case there exists a $4/3$-approximation algorithm running in
$O(n^3)$ time. Moreover, this algorithm solves the problem almost surely to
optimality if $3s_1/4 \leq s_2 = s_3$.
","[{'version': 'v1', 'created': 'Sat, 14 Feb 2015 20:26:38 GMT'}, {'version': 'v2', 'created': 'Mon, 15 Jun 2015 20:47:17 GMT'}]",2015-06-17,"[['Furmańczyk', 'H.', ''], ['Kubale', 'M.', '']]","['cubic graph', 'equitable coloring', 'NP-hardness', 'polynomial algorithm', 'scheduling', 'uniform machine']"
20370,1107.3823,Nicolas Le Roux,"Nicolas Heess (Informatics), Nicolas Le Roux (INRIA Paris -
  Rocquencourt), John Winn","Weakly Supervised Learning of Foreground-Background Segmentation using
  Masked RBMs",,International Conference on Artificial Neural Networks (2011),,,cs.LG cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose an extension of the Restricted Boltzmann Machine (RBM) that allows
the joint shape and appearance of foreground objects in cluttered images to be
modeled independently of the background. We present a learning scheme that
learns this representation directly from cluttered images with only very weak
supervision. The model generates plausible samples and performs
foreground-background segmentation. We demonstrate that representing foreground
objects independently of the background can be beneficial in recognition tasks.
","[{'version': 'v1', 'created': 'Tue, 19 Jul 2011 19:43:10 GMT'}]",2011-07-20,"[['Heess', 'Nicolas', '', 'Informatics'], ['Roux', 'Nicolas Le', '', 'INRIA Paris -\n  Rocquencourt'], ['Winn', 'John', '']]","['RBM', 'segmentation', 'weakly supervised learning']"
20371,1501.04894,Arindam Pal,Arindam Pal and Sushmita Ruj,"CITEX: A new citation index to measure the relative importance of
  authors and papers in scientific publications","Accepted for publication in IEEE International Conference on
  Communications (ICC) 2015",,,,cs.DL cs.DM cs.IR cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evaluating the performance of researchers and measuring the impact of papers
written by scientists is the main objective of citation analysis. Various
indices and metrics have been proposed for this. In this paper, we propose a
new citation index CITEX, which gives normalized scores to authors and papers
to determine their rankings. To the best of our knowledge, this is the first
citation index which simultaneously assigns scores to both authors and papers.
Using these scores, we can get an objective measure of the reputation of an
author and the impact of a paper.
  We model this problem as an iterative computation on a publication graph,
whose vertices are authors and papers, and whose edges indicate which author
has written which paper. We prove that this iterative computation converges in
the limit, by using a powerful theorem from linear algebra. We run this
algorithm on several examples, and find that the author and paper scores match
closely with what is suggested by our intuition. The algorithm is theoretically
sound and runs very fast in practice. We compare this index with several
existing metrics and find that CITEX gives far more accurate scores compared to
the traditional metrics.
","[{'version': 'v1', 'created': 'Tue, 20 Jan 2015 17:44:59 GMT'}]",2015-02-19,"[['Pal', 'Arindam', ''], ['Ruj', 'Sushmita', '']]","['CITATION ANALYSIS', 'GRAPH ALGORITHMS', 'MATRIX COMPUTATIONS', 'EIGENVALUES AND EIGENVECTORS', 'INFORMATION RETRIEVAL']"
20372,1402.6045,Ashraf Shahin,Ashraf A. Shahin,"Multi-Dimensional Customization Modelling Based On Metagraph For Saas
  Multi-Tenant Applications","10 pages, 8 figures",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Software as a Service (SaaS) is a new software delivery model in which
pre-built applications are delivered to customers as a service. SaaS providers
aim to attract a large number of tenants (users) with minimal system
modifications to meet economics of scale. To achieve this aim, SaaS
applications have to be customizable to meet requirements of each tenant.
However, due to the rapid growing of the SaaS, SaaS applications could have
thousands of tenants with a huge number of ways to customize applications.
Modularizing such customizations still is a highly complex task. Additionally,
due to the big variation of requirements for tenants, no single customization
model is appropriate for all tenants. In this paper, we propose a
multi-dimensional customization model based on metagraph. The proposed mode
addresses the modelling variability among tenants, describes customizations and
their relationships, and guarantees the correctness of SaaS customizations made
by tenants.
","[{'version': 'v1', 'created': 'Tue, 25 Feb 2014 03:44:09 GMT'}]",2014-02-26,"[['Shahin', 'Ashraf A.', '']]","['Cloud Computing', 'Software as a Service (SaaS)', 'Multi-tenancy', 'Customization Modelling', 'Metagraph']"
20373,0903.4856,Martin Jaggi,"Bernd G\""artner, Joachim Giesen, Martin Jaggi and Torsten Welsch",A Combinatorial Algorithm to Compute Regularization Paths,"7 Pages, 1 Figure",,,,cs.LG cs.AI cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For a wide variety of regularization methods, algorithms computing the entire
solution path have been developed recently. Solution path algorithms do not
only compute the solution for one particular value of the regularization
parameter but the entire path of solutions, making the selection of an optimal
parameter much easier. Most of the currently used algorithms are not robust in
the sense that they cannot deal with general or degenerate input. Here we
present a new robust, generic method for parametric quadratic programming. Our
algorithm directly applies to nearly all machine learning applications, where
so far every application required its own different algorithm.
  We illustrate the usefulness of our method by applying it to a very low rank
problem which could not be solved by existing path tracking methods, namely to
compute part-worth values in choice based conjoint analysis, a popular
technique from market research to estimate consumers preferences on a class of
parameterized options.
","[{'version': 'v1', 'created': 'Fri, 27 Mar 2009 18:16:04 GMT'}]",2009-03-30,"[['Gärtner', 'Bernd', ''], ['Giesen', 'Joachim', ''], ['Jaggi', 'Martin', ''], ['Welsch', 'Torsten', '']]","['Regularization Paths', 'Solution Paths', 'Parameterized Optimization', 'Support Vector Machines', 'Kernel Methods', 'Conjoint Analysis']"
20374,1511.07654,Jeff Jones Dr,Jeff Jones,"Automated Guidance of Collective Movement in a Multi-Agent Model of
  Physarum polycephalum","2015 - Automated Guidance of Collective Movement in a Multi-Agent
  Model of Physarum polycephalum, Multi-Agent Models on Swarm Behaviour, Swarm
  2015, 28-30 October, Kyoto, Japan",,,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Collective movement occurs in living systems where the simple movements of
individual members of a pop- ulation are combined to generate movement of the
collective as a whole, displaying complex dynamics which cannot be found in the
component parts themselves. The plasmodium stage of slime mould Physarum
polycephalum displays complex amoeboid movement during its foraging and hazard
avoidance and its movement can be influenced by the spatial placement of
attractant and repellent stimuli. Slime mould is attractive to robotics due to
its simple component parts and the distributed nature of its control and
locomotion mechanisms. We investigate methods of automated guidance of a
multi-agent swarm collective along a pre-defined path to a goal location. We
demonstrate a closed-loop feedback mechanism using attractant and repellent
stimuli. We find that guidance by repellent stimuli (a light illumination mask)
provides faster and more accurate guidance than attractant sources, which
exhibit overshooting phenomena at path turns. The method allows traversal of
convoluted arenas with challenging obstacles and provides an insight into how
unconven- tional computing substrates may be hybridised with classical
computing methods to take advantage of the benefits of both approaches.
","[{'version': 'v1', 'created': 'Tue, 24 Nov 2015 11:22:48 GMT'}]",2015-11-25,"[['Jones', 'Jeff', '']]","['swarm intelligence', 'collective movement', 'Physarum polycephalum', 'multi-agent', 'soft robotics']"
20375,1605.01602,Hokky Situngkir,Hokky Situngkir,"Agent-Based Model for River-Side Land-living: Portrait of Bandung
  Indonesian Cikapundung Park Case Study",,BFI Working Paper Series WP-3-2016,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A city park has been built from the organic urban settlement in the
Cikapundung River, Bandung, Indonesia. While the aim for the development is the
revitalization of the river for being unhealthy from the waste coming from the
settlement. A study on how Indonesian people, in general, treating water
source, like river, lake, and ocean is revisited. Throwing waste into the river
has actually become paradox with the collective mental understanding about
water among Indonesians. Two scenarios of agent-based simulation is presented,
to see the dynamics of organic settlement and life of the city park after being
opened for public. The simulation is delivered upon the imagery of landscape
taken from the satellite and drone. While experience for presented problems
gives insights, the computational social laboratory also awaits for further
theoretical explorations and endeavors to sharpen good policymaking.
","[{'version': 'v1', 'created': 'Tue, 3 May 2016 14:05:57 GMT'}]",2016-05-06,"[['Situngkir', 'Hokky', '']]","['agent-based model', 'computational social science', 'settlement', 'slum', 'river', 'water', 'waste management', 'indonesia']"
20376,1512.02568,Tarun Kathuria,"Tarun Kathuria, S. Sudarshan",Efficient and Provable Multi-Query Optimization,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Complex queries for massive data analysis jobs have become increasingly
commonplace. Many such queries contain com- mon subexpressions, either within a
single query or among multiple queries submitted as a batch. Conventional query
optimizers do not exploit these subexpressions and produce sub-optimal plans.
The problem of multi-query optimization (MQO) is to generate an optimal
combined evaluation plan by computing common subexpressions once and reusing
them. Exhaustive algorithms for MQO explore an O(n^n) search space. Thus, this
problem has primarily been tackled using various heuristic algorithms, without
providing any theoretical guarantees on the quality of their solution. In this
paper, instead of the conventional cost minimization problem, we treat the
problem as maximizing a linear transformation of the cost function. We propose
a greedy algorithm for this transformed formulation of the problem, which under
weak, intuitive assumptions, provides an approximation factor guarantee for
this formulation. We go on to show that this factor is optimal, unless P = NP.
Another noteworthy point about our algorithm is that it can be easily
incorporated into existing transformation-based optimizers. We finally propose
optimizations which can be used to improve the efficiency of our algorithm.
","[{'version': 'v1', 'created': 'Tue, 8 Dec 2015 17:56:26 GMT'}, {'version': 'v2', 'created': 'Thu, 19 Jan 2017 18:18:08 GMT'}]",2017-01-20,"[['Kathuria', 'Tarun', ''], ['Sudarshan', 'S.', '']]","['Multi-query optimization', 'greedy algorithms', 'approximation algorithms']"
20377,0705.2765,Rustem Takhanov,Rustem Takhanov,On the monotonization of the training set,10 pages,,,,cs.LG cs.AI,,"  We consider the problem of minimal correction of the training set to make it
consistent with monotonic constraints. This problem arises during analysis of
data sets via techniques that require monotone data. We show that this problem
is NP-hard in general and is equivalent to finding a maximal independent set in
special orgraphs. Practically important cases of that problem considered in
detail. These are the cases when a partial order given on the replies set is a
total order or has a dimension 2. We show that the second case can be reduced
to maximization of a quadratic convex function on a convex set. For this case
we construct an approximate polynomial algorithm based on convex optimization.
","[{'version': 'v1', 'created': 'Fri, 18 May 2007 19:44:19 GMT'}]",2007-05-23,"[['Takhanov', 'Rustem', '']]","['machine learning', 'supervised learning', 'monotonic constraints']"
20378,0806.1372,Lan Zhang,"Lan Zhang, Ying-Chang Liang, Yan Xin, H. Vincent Poor",Robust Cognitive Beamforming With Partial Channel State Information,"30 pages, 7 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper considers a spectrum sharing based cognitive radio (CR)
communication system, which consists of a secondary user (SU) having multiple
transmit antennas and a single receive antenna and a primary user (PU) having a
single receive antenna. The channel state information (CSI) on the link of the
SU is assumed to be perfectly known at the SU transmitter (SU-Tx). However, due
to loose cooperation between the SU and the PU, only partial CSI of the link
between the SU-Tx and the PU is available at the SU-Tx. With the partial CSI
and a prescribed transmit power constraint, our design objective is to
determine the transmit signal covariance matrix that maximizes the rate of the
SU while keeping the interference power to the PU below a threshold for all the
possible channel realization within an uncertainty set. This problem, termed
the robust cognitive beamforming problem, can be naturally formulated as a
semi-infinite programming (SIP) problem with infinitely many constraints. This
problem is first transformed into the second order cone programming (SOCP)
problem and then solved via a standard interior point algorithm. Then, an
analytical solution with much reduced complexity is developed from a geometric
perspective. It is shown that both algorithms obtain the same optimal solution.
Simulation examples are presented to validate the effectiveness of the proposed
algorithms.
","[{'version': 'v1', 'created': 'Mon, 9 Jun 2008 05:30:09 GMT'}, {'version': 'v2', 'created': 'Sun, 4 Jan 2009 12:06:48 GMT'}]",2009-01-04,"[['Zhang', 'Lan', ''], ['Liang', 'Ying-Chang', ''], ['Xin', 'Yan', ''], ['Poor', 'H. Vincent', '']]","['Cognitive radio', 'interference constraint', 'multiple-input single-output (MISO)', 'partial channel state']"
20379,1204.6291,Michael Elberfeld,"Michael Elberfeld, Martin Grohe, Till Tantau",Where First-Order and Monadic Second-Order Logic Coincide,,,,,cs.LO cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study on which classes of graphs first-order logic (FO) and monadic
second-order logic (MSO) have the same expressive power. We show that for all
classes C of graphs that are closed under taking subgraphs, FO and MSO have the
same expressive power on C if, and only if, C has bounded tree depth. Tree
depth is a graph invariant that measures the similarity of a graph to a star in
a similar way that tree width measures the similarity of a graph to a tree. For
classes just closed under taking induced subgraphs, we show an analogous result
for guarded second-order logic (GSO), the variant of MSO that not only allows
quantification over vertex sets but also over edge sets. A key tool in our
proof is a Feferman-Vaught-type theorem that is constructive and still works
for unbounded partitions.
","[{'version': 'v1', 'created': 'Fri, 27 Apr 2012 18:52:15 GMT'}]",2015-03-20,"[['Elberfeld', 'Michael', ''], ['Grohe', 'Martin', ''], ['Tantau', 'Till', '']]","['first-order logic', 'monadic second-order logic', 'guarded second-order logic', 'tree depth', 'graph classes']"
20380,0904.0534,Sk Sarif Hassan s,"Pabitra Pal Choudhury, Sudhakar Sahoo, Birendra Kumar Nayak, and Sk.
  Sarif Hassan","Theory of Carry Value Transformation (CVT) and its Application in
  Fractal formation","13 pages, 14 figures, it would be interesting those who are really
  interested in fractal experimentally",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper the theory of Carry Value Transformation (CVT) is designed and
developed on a pair of n-bit strings and is used to produce many interesting
patterns. One of them is found to be a self-similar fractal whose dimension is
same as the dimension of the Sierpinski triangle. Different construction
procedures like L-system, Cellular Automata rule, Tilling for this fractal are
obtained which signifies that like other tools CVT can also be used for the
formation of self-similar fractals. It is shown that CVT can be used for the
production of periodic as well as chaotic patterns. Also, the analytical and
algebraic properties of CVT are discussed. The definition of CVT in
two-dimension is slightly modified and its mathematical properties are
highlighted. Finally, the extension of CVT and modified CVT (MCVT) are done in
higher dimensions.
","[{'version': 'v1', 'created': 'Fri, 3 Apr 2009 09:10:29 GMT'}]",2009-04-06,"[['Choudhury', 'Pabitra Pal', ''], ['Sahoo', 'Sudhakar', ''], ['Nayak', 'Birendra Kumar', ''], ['Hassan', 'Sk. Sarif', '']]","['Carry Value Transformation', 'Fractals', 'L-System', 'Cellular Automata and Tilling', 'Discrete Dynamical System']"
20381,1611.00938,Johann Paratte,Johan Paratte and Lionel Martin,Fast Eigenspace Approximation using Random Signals,,,,,cs.DS cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We focus in this work on the estimation of the first $k$ eigenvectors of any
graph Laplacian using filtering of Gaussian random signals. We prove that we
only need $k$ such signals to be able to exactly recover as many of the
smallest eigenvectors, regardless of the number of nodes in the graph. In
addition, we address key issues in implementing the theoretical concepts in
practice using accurate approximated methods. We also propose fast algorithms
both for eigenspace approximation and for the determination of the $k$th
smallest eigenvalue $\lambda_k$. The latter proves to be extremely efficient
under the assumption of locally uniform distribution of the eigenvalue over the
spectrum. Finally, we present experiments which show the validity of our method
in practice and compare it to state-of-the-art methods for clustering and
visualization both on synthetic small-scale datasets and larger real-world
problems of millions of nodes. We show that our method allows a better scaling
with the number of nodes than all previous methods while achieving an almost
perfect reconstruction of the eigenspace formed by the first $k$ eigenvectors.
","[{'version': 'v1', 'created': 'Thu, 3 Nov 2016 10:08:22 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Nov 2016 09:25:41 GMT'}]",2016-11-07,"[['Paratte', 'Johan', ''], ['Martin', 'Lionel', '']]","['Graph signal processing', 'low-rank reconstruction', 'partitionning', 'spectral graphtheory', 'spectrum analysis', 'subspace approximation', 'visualization']"
20382,1605.01362,Colin Gordon,"Esben Andreasen, Colin S. Gordon, Satish Chandra, Manu Sridharan,
  Frank Tip, Koushik Sen","Trace Typing: An Approach for Evaluating Retrofitted Type Systems
  (Extended Version)",Samsung Research America Technical Report,,,SRA-CSIC-2016-001,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent years have seen growing interest in the retrofitting of type systems
onto dynamically-typed programming languages, in order to improve type safety,
programmer productivity, or performance. In such cases, type system developers
must strike a delicate balance between disallowing certain coding patterns to
keep the type system simple, or including them at the expense of additional
complexity and effort. Thus far, the process for designing retrofitted type
systems has been largely ad hoc, because evaluating multiple variations of a
type system on large bodies of existing code is a significant undertaking.
  We present trace typing: a framework for automatically and quantitatively
evaluating variations of a retrofitted type system on large code bases. The
trace typing approach involves gathering traces of program executions,
inferring types for instances of variables and expressions occurring in a
trace, and merging types according to merge strategies that reflect specific
(combinations of) choices in the source-level type system design space.
  We evaluated trace typing through several experiments. We compared several
variations of type systems retrofitted onto JavaScript, measuring the number of
program locations with type errors in each case on a suite of over fifty
thousand lines of JavaScript code. We also used trace typing to validate and
guide the design of a new retrofitted type system that enforces fixed object
layout for JavaScript objects. Finally, we leveraged the types computed by
trace typing to automatically identify tag tests --- dynamic checks that refine
a type --- and examined the variety of tests identified.
","[{'version': 'v1', 'created': 'Wed, 4 May 2016 17:59:58 GMT'}]",2016-05-05,"[['Andreasen', 'Esben', ''], ['Gordon', 'Colin S.', ''], ['Chandra', 'Satish', ''], ['Sridharan', 'Manu', ''], ['Tip', 'Frank', ''], ['Sen', 'Koushik', '']]","['Retrofitted type systems', 'Type system design', 'trace typing']"
20383,1208.5340,Cm Pintea,"Camelia-M. Pintea, Camelia Chira, D. Dumitrescu",New results of ant algorithms for the Linear Ordering Problem,"5 pages, 5 figures Zbl:06048718","An. Univ. Vest Timis., Ser. Mat.-Inform. 48, No. 3, 139-150 (2010)",,,cs.AI cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ant-based algorithms are successful tools for solving complex problems. One
of these problems is the Linear Ordering Problem (LOP). The paper shows new
results on some LOP instances, using Ant Colony System (ACS) and the Step-Back
Sensitive Ant Model (SB-SAM).
","[{'version': 'v1', 'created': 'Mon, 27 Aug 2012 08:58:46 GMT'}]",2012-08-28,"[['Pintea', 'Camelia-M.', ''], ['Chira', 'Camelia', ''], ['Dumitrescu', 'D.', '']]","['metaheuristics', 'graph algorithms', 'ants behaviour']"
20384,0802.3137,Wolfgang Faber,"Wolfgang Faber, Gerald Pfeifer, Nicola Leone, Tina Dell'Armi, Giuseppe
  Ielpa",Design and Implementation of Aggregate Functions in the DLV System,"34 pages, 7 figures. This article has been accepted for publication
  in Theory and Practice of Logic Programming, Cambridge University Press",,,,cs.AI cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows
for expressing every property of finite structures that is decidable in the
complexity class SigmaP2 (= NP^NP). Despite this high expressiveness, there are
some simple properties, often arising in real-world applications, which cannot
be encoded in a simple and natural manner. Especially properties that require
the use of arithmetic operators (like sum, times, or count) on a set or
multiset of elements, which satisfy some conditions, cannot be naturally
expressed in classic DLP.
  To overcome this deficiency, we extend DLP by aggregate functions in a
conservative way. In particular, we avoid the introduction of constructs with
disputed semantics, by requiring aggregates to be stratified. We formally
define the semantics of the extended language (called DLP^A), and illustrate
how it can be profitably used for representing knowledge. Furthermore, we
analyze the computational complexity of DLP^A, showing that the addition of
aggregates does not bring a higher cost in that respect. Finally, we provide an
implementation of DLP^A in DLV -- a state-of-the-art DLP system -- and report
on experiments which confirm the usefulness of the proposed extension also for
the efficiency of computation.
","[{'version': 'v1', 'created': 'Thu, 21 Feb 2008 15:44:09 GMT'}]",2008-02-22,"[['Faber', 'Wolfgang', ''], ['Pfeifer', 'Gerald', ''], ['Leone', 'Nicola', ''], [""Dell'Armi"", 'Tina', ''], ['Ielpa', 'Giuseppe', '']]","['Disjunctive Logic Programming', 'Answer Set Programming', 'Aggregates', 'KnowledgeRepresentation', 'Implementation']"
20385,1107.3217,Dimple Juneja Dr.,Harjit Singh Lamba and Gurdev Singh,Cloud Computing Future Framework for e-management of NGO's,"Eight pages,Three figures",,,,cs.OH,http://creativecommons.org/licenses/by/3.0/,"  Cloud computing is an emerging new computing paradigm for delivering
computing services. This computing approach relies on a number of existing
technologies, e.g., the Internet, virtualization, grid computing, Web services,
etc. Cloud Computing aims to provide scalable and inexpensive on-demand
computing infrastructures with good quality of service levels. It represents a
shift away from computing as a product that is purchased, to computing as a
service that is delivered to consumers from the cloud. It helps an organization
in saving costs and creating new business opportunities.This paper provides a
framework, Education Cloud for the e- management of NGO's. The Education Cloud
can transform a nonprofit, or an entire sector of nonprofits, achieves its
mission and creates lasting impact in its communities. This paper also presents
the case study of Kalgidhar trust, Baru Sahib, Himachal Pradesh, NGO which is
using the education as the tool to solve the social issues.
","[{'version': 'v1', 'created': 'Sat, 16 Jul 2011 10:16:36 GMT'}]",2011-07-19,"[['Lamba', 'Harjit Singh', ''], ['Singh', 'Gurdev', '']]","['Cloud Computing', 'SaaS', 'NGO', 'ERP']"
20386,1312.4190,Jakub Konecny,Jakub Kone\v{c}n\'y and Michal Hagara,One-Shot-Learning Gesture Recognition using HOG-HOF Features,"20 pages, 10 figures, 2 tables To appear in Journal of Machine
  Learning Research subject to minor revision",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The purpose of this paper is to describe one-shot-learning gesture
recognition systems developed on the \textit{ChaLearn Gesture Dataset}. We use
RGB and depth images and combine appearance (Histograms of Oriented Gradients)
and motion descriptors (Histogram of Optical Flow) for parallel temporal
segmentation and recognition. The Quadratic-Chi distance family is used to
measure differences between histograms to capture cross-bin relationships. We
also propose a new algorithm for trimming videos --- to remove all the
unimportant frames from videos. We present two methods that use combination of
HOG-HOF descriptors together with variants of Dynamic Time Warping technique.
Both methods outperform other published methods and help narrow down the gap
between human performance and algorithms on this task. The code has been made
publicly available in the MLOSS repository.
","[{'version': 'v1', 'created': 'Sun, 15 Dec 2013 20:58:21 GMT'}, {'version': 'v2', 'created': 'Sat, 15 Feb 2014 17:47:11 GMT'}]",2014-02-18,"[['Konečný', 'Jakub', ''], ['Hagara', 'Michal', '']]","['ChaLearn', 'Histogram of Oriented Gradients', 'Histogram of Optical Flow', 'Dynamic Time Warping']"
20387,1505.00111,Bin Guo,"Bin Guo, Chao Chen, Daqing Zhang, Zhiwen Yu, Alvin Chin","Mobile Crowd Sensing and Computing: When Participatory Sensing Meets
  Participatory Social Media",,,,,cs.HC cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the development of mobile sensing and mobile social networking
techniques, Mobile Crowd Sensing and Computing (MCSC), which leverages
heterogeneous crowdsourced data for large-scale sensing, has become a leading
paradigm. Built on top of the participatory sensing vision, MCSC has two
characterizing features: (1) it leverages heterogeneous crowdsourced data from
two data sources: participatory sensing and participatory social media; and (2)
it presents the fusion of human and machine intelligence (HMI) in both the
sensing and computing process. This paper characterizes the unique features and
challenges of MCSC. We further present early efforts on MCSC to demonstrate the
benefits of aggregating heterogeneous crowdsourced data.
","[{'version': 'v1', 'created': 'Fri, 1 May 2015 07:46:53 GMT'}]",2015-05-04,"[['Guo', 'Bin', ''], ['Chen', 'Chao', ''], ['Zhang', 'Daqing', ''], ['Yu', 'Zhiwen', ''], ['Chin', 'Alvin', '']]","['participatory sensing', 'mobile social networks', 'mobile crowd sensing', 'human']"
20388,1606.03542,Sanjib Tiwari,"Sanjib Tiwari, Michael Lane and Khorshed Alam","Does Broadband Connectivity and Social networking sites build and
  maintain social capital in rural communities?","ISBN# 978-0-646-95337-3 Presented at the Australasian Conference on
  Information Systems 2015 (arXiv:1605.01032)",,,ACIS/2015/224,cs.CY,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Broadband internet access is a major enabling technology for building social
capital (SC) by better connecting rural and regional communities which are
often geographically dispersed both locally nationally and internationally. The
main objectives of this paper were determine to what extent Social Networking
Sites (SNS) can build SC for households in a rural and regional context of
rural household adoption and use of broadband internet. A large scale survey of
households was used to collect empirical data regarding household adoption and
use of Broadband internet services including SNSs and their contribution to
building SC in rural communities. The results of this study confirmed that SNSs
would appear to build SC two high level dimensions bonding and bridging for
households in rural communities such as Western Downs Region. Moreover SNS
users would appear to have significantly higher levels of SC than Non-SNS users
in rural communities.
","[{'version': 'v1', 'created': 'Sat, 11 Jun 2016 03:34:05 GMT'}]",2016-06-14,"[['Tiwari', 'Sanjib', ''], ['Lane', 'Michael', ''], ['Alam', 'Khorshed', '']]","['Social Networking Sites', 'Social Capital', 'rural communities']"
20389,1212.3544,Han Wang,"Habib Ammari, Thomas Boulier, Josselin Garnier, Hyeonbae Kang, Han
  Wang",Tracking of a Mobile Target Using Generalized Polarization Tensors,,,,,cs.NA cs.CE math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we apply an extended Kalman filter to track both the location
and the orientation of a mobile target from multistatic response measurements.
We also analyze the effect of the limited-view aspect on the stability and the
efficiency of our tracking approach. Our algorithm is based on the use of the
generalized polarization tensors, which can be reconstructed from the
multistatic response measurements by solving a linear system. The system has
the remarkable property that low order generalized polarization tensors are not
affected by the error caused by the instability of higher orders in the
presence of measurement noise.
","[{'version': 'v1', 'created': 'Fri, 14 Dec 2012 17:50:01 GMT'}]",2012-12-17,"[['Ammari', 'Habib', ''], ['Boulier', 'Thomas', ''], ['Garnier', 'Josselin', ''], ['Kang', 'Hyeonbae', ''], ['Wang', 'Han', '']]","['generalized polarization tensors', 'target tracking', 'extended Kalman filter', 'position and orientation']"
20390,1705.07065,Matthew Smith,"Matthew Smith, Daniel Moser, Martin Strohmeier, Vincent Lenders, Ivan
  Martinovic","Analyzing Privacy Breaches in the Aircraft Communications Addressing and
  Reporting System (ACARS)",16 pages,,,,cs.CR cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The manner in which Aircraft Communications, Addressing and Reporting System
(ACARS) is being used has significantly changed over time. Whilst originally
used by commercial airliners to track their flights and provide automated
timekeeping on crew, today it serves as a multi-purpose air-ground data link
for many aviation stakeholders including private jet owners, state actors and
military. Since ACARS messages are still mostly sent in the clear over a
wireless channel, any sensitive information sent with ACARS can potentially
lead to a privacy breach for users. Naturally, different stakeholders consider
different types of data sensitive. In this paper we propose a privacy framework
matching aviation stakeholders to a range of sensitive information types and
assess the impact for each. Based on more than one million ACARS messages,
collected over several months, we then demonstrate that current ACARS usage
systematically breaches privacy for all stakeholder groups. We further support
our findings with a number of cases of significant privacy issues for each
group and analyze the impact of such leaks. While it is well-known that ACARS
messages are susceptible to eavesdropping attacks, this work is the first to
quantify the extent and impact of privacy leakage in the real world for the
relevant aviation stakeholders.
","[{'version': 'v1', 'created': 'Fri, 19 May 2017 15:54:47 GMT'}]",2017-05-22,"[['Smith', 'Matthew', ''], ['Moser', 'Daniel', ''], ['Strohmeier', 'Martin', ''], ['Lenders', 'Vincent', ''], ['Martinovic', 'Ivan', '']]","['aviation', 'security', 'privacy', 'ACARS', 'avionicsystems']"
20391,1209.3944,Eya Ben Ahmed,Wafa Tebourski Wahiba Ben Abdessalem Karaa,Cyclic Association Rules Mining under Constraints,8,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Several researchers have explored the temporal aspect of association rules
mining. In this paper, we focus on the cyclic association rules, in order to
discover correlations among items characterized by regular cyclic variation
overtime. The overview of the state of the art has revealed the drawbacks of
proposed algorithm literatures, namely the excessive number of generated rules
which are not meeting the expert's expectations. To overcome these
restrictions, we have introduced our approach dedicated to generate the cyclic
association rules under constraints through a new method called
Constraint-Based Cyclic Association Rules CBCAR. The carried out experiments
underline the usefulness and the performance of our new approach.
","[{'version': 'v1', 'created': 'Tue, 18 Sep 2012 13:09:24 GMT'}]",2012-09-19,"[['Karaa', 'Wafa Tebourski Wahiba Ben Abdessalem', '']]","['Temporal association rule', 'cyclic association rule', 'cycle', 'length of cycle', 'constraint-based association rule', 'constraint.  1']"
20392,1305.7316,Minh-Quoc Nghiem,"Minh-Quoc Nghiem, Giovanni Yoko Kristianto, Goran Topic, Akiko Aizawa","A hybrid approach for semantic enrichment of MathML mathematical
  expressions",,,,,cs.DL cs.IR,http://creativecommons.org/licenses/by/3.0/,"  In this paper, we present a new approach to the semantic enrichment of
mathematical expression problem. Our approach is a combination of statistical
machine translation and disambiguation which makes use of surrounding text of
the mathematical expressions. We first use Support Vector Machine classifier to
disambiguate mathematical terms using both their presentation form and
surrounding text. We then use the disambiguation result to enhance the semantic
enrichment of a statistical-machine-translation-based system. Experimental
results show that our system archives improvements over prior systems.
","[{'version': 'v1', 'created': 'Fri, 31 May 2013 07:34:07 GMT'}]",2013-06-03,"[['Nghiem', 'Minh-Quoc', ''], ['Kristianto', 'Giovanni Yoko', ''], ['Topic', 'Goran', ''], ['Aizawa', 'Akiko', '']]","['MathML', 'Semantic Enrichment', 'Disambiguation', 'Statistical Machine Translation']"
20393,1109.0038,Hourieh Khodkari Mrs,"Abbas Asosheh, Nafiseh Karimi, Hourieh Khodkari",Provide a Model for Handover Technology in Wireless Networks,"15 pages, 7 figures, 9 tables, journal published IJWMN August 2011;
  a8rcc.org; AIRCC August 2011",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Fast Handovers for the MIPv6 (FMIPv6) has been proposed to reduce the
Handover latency, in the IETF. It could not find the acceptable reduction, so
led to more efforts to improve it and however the creation of multiple Handover
methods in the literature. A stable connection is very important in mobile
services so the mobility of device would not cause any interruption in network
services and thus mobility management plays a very important role. Mobile IPv6
has become a general solution for supporting mobility between different
networks on the internet which a flawless connection needs to be managed
properly. In order to select the appropriate method, in this paper, all the
proposed methods have been classified according to the identified performance
metrics. Call blocking probability, Handover blocking probability, Probability
of an unnecessary handover, Duration of interruption and delay, as the most
important Handover algorithm performance metrics are introduced. The AHP method
will be deployed to weight the metrics in a sample topology according to the
selected sound application. Then the TOPSIS method will be employed to find the
appropriate Handover algorithm.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2011 21:05:56 GMT'}]",2011-09-02,"[['Asosheh', 'Abbas', ''], ['Karimi', 'Nafiseh', ''], ['Khodkari', 'Hourieh', '']]","['Handover', 'Handover Performance Metrics', 'FMIPv6', 'AHP Method', 'TOPSIS Method']"
20394,1504.06454,Mattia Gastaldello,"Tiziana Calamoneri, Blerina Sinaimeri, Mattia Gastaldello",On Pairwise Compatibility of Some Graph (Super)Classes,"9 pages, 2 figures",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A graph G=(V,E) is a pairwise compatibility graph (PCG) if there exists an
edge-weighted tree T and two non-negative real numbers `d' and `D' such that
each leaf `u' of T is a node of V and the edge `(u,v) belongs to E' iff `d <=
d_T(u, v) <= D' where d_T(u, v) is the sum of weights of the edges on the
unique path from `u' to `v' in T. The main issue on these graphs consists in
characterizing them.
  In this note we prove the inclusion in the PCG class of threshold tolerance
graphs and the non-inclusion of a number of intersection graphs, such as disk
and grid intersection graphs, circular arc and tolerance graphs. The
non-inclusion of some superclasses (trapezoid, permutation and rectangle
intersection graphs) follows.
","[{'version': 'v1', 'created': 'Fri, 24 Apr 2015 10:04:02 GMT'}]",2015-04-27,"[['Calamoneri', 'Tiziana', ''], ['Sinaimeri', 'Blerina', ''], ['Gastaldello', 'Mattia', '']]","['combinatorial problems', 'intersection graphs', 'pairwise compatibilitygraphs', 'threshold tolerance graphs']"
20395,1409.6498,Moo K. Chung,"Moo K. Chung, Anqi Qiu, Seongho Seo, Houri K. Vorperian","Unified Heat Kernel Regression for Diffusion, Kernel Smoothing and
  Wavelets on Manifolds and Its Application to Mandible Growth Modeling in CT
  Images",Accepted in Medical Image Analysis,Medical Image Analysis 2015 22:63-76,,,cs.CV stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a novel kernel regression framework for smoothing scalar surface
data using the Laplace-Beltrami eigenfunctions. Starting with the heat kernel
constructed from the eigenfunctions, we formulate a new bivariate kernel
regression framework as a weighted eigenfunction expansion with the heat kernel
as the weights. The new kernel regression is mathematically equivalent to
isotropic heat diffusion, kernel smoothing and recently popular diffusion
wavelets. Unlike many previous partial differential equation based approaches
involving diffusion, our approach represents the solution of diffusion
analytically, reducing numerical inaccuracy and slow convergence. The numerical
implementation is validated on a unit sphere using spherical harmonics. As an
illustration, we have applied the method in characterizing the localized growth
pattern of mandible surfaces obtained in CT images from subjects between ages 0
and 20 years by regressing the length of displacement vectors with respect to
the template surface.
","[{'version': 'v1', 'created': 'Tue, 23 Sep 2014 11:45:19 GMT'}, {'version': 'v2', 'created': 'Tue, 17 Feb 2015 11:21:50 GMT'}]",2016-06-30,"[['Chung', 'Moo K.', ''], ['Qiu', 'Anqi', ''], ['Seo', 'Seongho', ''], ['Vorperian', 'Houri K.', '']]","['Heat kernel regression', 'Laplace-Beltrami eigenfunctions', 'Diffusion wavelets', 'Surface-based morphometry', 'Mandible growth']"
20396,0909.1784,Stavros Harizopoulos,"Stavros Harizopoulos (HP Labs), Mehul Shah, Justin Meza (UCLA),
  Parthasarathy Ranganathan (HP Labs)","Energy Efficiency: The New Holy Grail of Data Management Systems
  Research",CIDR 2009,,,,cs.DB cs.PF,http://creativecommons.org/licenses/by/3.0/,"  Energy costs are quickly rising in large-scale data centers and are soon
projected to overtake the cost of hardware. As a result, data center operators
have recently started turning into using more energy-friendly hardware. Despite
the growing body of research in power management techniques, there has been
little work to date on energy efficiency from a data management software
perspective.
  In this paper, we argue that hardware-only approaches are only part of the
solution, and that data management software will be key in optimizing for
energy efficiency. We discuss the problems arising from growing energy use in
data centers and the trends that point to an increasing set of opportunities
for software-level optimizations. Using two simple experiments, we illustrate
the potential of such optimizations, and, motivated by these examples, we
discuss general approaches for reducing energy waste. Lastly, we point out
existing places within database systems that are promising for
energy-efficiency optimizations and urge the data management systems community
to shift focus from performance-oriented research to energy-efficient
computing.
","[{'version': 'v1', 'created': 'Wed, 9 Sep 2009 18:10:39 GMT'}]",2009-09-15,"[['Harizopoulos', 'Stavros', '', 'HP Labs'], ['Shah', 'Mehul', '', 'UCLA'], ['Meza', 'Justin', '', 'UCLA'], ['Ranganathan', 'Parthasarathy', '', 'HP Labs']]","['Data management systems', 'database systems', 'energy efficiency', 'power management']"
20397,1501.03209,Milad Kharratzadeh,Milad Kharratzadeh and Thomas R. Shultz,Neural Implementation of Probabilistic Models of Cognition,,"Cognitive Systems Research, 40, (2016) 99-113",,,cs.NE q-bio.NC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Bayesian models of cognition hypothesize that human brains make sense of data
by representing probability distributions and applying Bayes' rule to find the
best explanation for available data. Understanding the neural mechanisms
underlying probabilistic models remains important because Bayesian models
provide a computational framework, rather than specifying mechanistic
processes. Here, we propose a deterministic neural-network model which
estimates and represents probability distributions from observable events --- a
phenomenon related to the concept of probability matching. Our model learns to
represent probabilities without receiving any representation of them from the
external world, but rather by experiencing the occurrence patterns of
individual events. Our neural implementation of probability matching is paired
with a neural module applying Bayes' rule, forming a comprehensive neural
scheme to simulate human Bayesian learning and inference. Our model also
provides novel explanations of base-rate neglect, a notable deviation from
Bayes.
","[{'version': 'v1', 'created': 'Tue, 13 Jan 2015 23:46:05 GMT'}, {'version': 'v2', 'created': 'Thu, 14 Apr 2016 15:54:11 GMT'}]",2021-07-02,"[['Kharratzadeh', 'Milad', ''], ['Shultz', 'Thomas R.', '']]","['Neural Networks', 'Probability Matching', 'Bayesian Models', 'Base-rate Neglect']"
20398,1609.02453,Francisco  Couto,Diogo Goncalves and Miguel Costa and Francisco M. Couto,A Large-Scale Characterization of User Behaviour in Cable TV,"in 3rd Workshop on Recommendation Systems for Television and online
  Video (RecSysTV), At Boston, MA, USA, 2016",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, Cable TV operators provide their users multiple ways to watch TV
content, such as Live TV and Video on Demand (VOD) services. In the last years,
Catch-up TV has been introduced, allowing users to watch recent broadcast
content whenever they want to. Understanding how the users interact with such
services is important to develop solutions that may increase user satisfaction
, user engagement and user consumption. In this paper, we characterize, for the
first time, how users interact with a large European Cable TV operator that
provides Live TV, Catch-up TV and VOD services. We analyzed many
characteristics, such as the service usage, user engagement, program type,
program genres and time periods. This characterization will help us to have a
deeper understanding on how users interact with these different services, that
may be used to enhance the recommendation systems of Cable TV providers.
","[{'version': 'v1', 'created': 'Thu, 8 Sep 2016 14:59:49 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Sep 2016 10:16:10 GMT'}]",2016-09-14,"[['Goncalves', 'Diogo', ''], ['Costa', 'Miguel', ''], ['Couto', 'Francisco M.', '']]","['Live TV', 'Catch-up TV', 'VOD', 'Dataset Evaluation', 'User Behavior']"
20399,1610.06492,Tomasz Kornuta,Tomasz Kornuta and Kamil Rocki,"Utilization of Deep Reinforcement Learning for saccadic-based object
  visual search","Paper submitted to special session on Machine Intelligence organized
  during 23rd International AUTOMATION Conference",,,,cs.CV cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper focuses on the problem of learning saccades enabling visual object
search. The developed system combines reinforcement learning with a neural
network for learning to predict the possible outcomes of its actions. We
validated the solution in three types of environment consisting of
(pseudo)-randomly generated matrices of digits. The experimental verification
is followed by the discussion regarding elements required by systems mimicking
the fovea movement and possible further research directions.
","[{'version': 'v1', 'created': 'Thu, 20 Oct 2016 16:34:08 GMT'}]",2016-10-21,"[['Kornuta', 'Tomasz', ''], ['Rocki', 'Kamil', '']]","['visual search', 'saccades', 'q-learning', 'neural networks']"
20400,1702.05650,Zizhao Zhang,"Zizhao Zhang, Fuyong Xing, Hanzi Wang, Yan Yan, Ying Huang, Xiaoshuang
  Shi, Lin Yang",Revisiting Graph Construction for Fast Image Segmentation,To appear in PR,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose a simple but effective method for fast image
segmentation. We re-examine the locality-preserving character of spectral
clustering by constructing a graph over image regions with both global and
local connections. Our novel approach to build graph connections relies on two
key observations: 1) local region pairs that co-occur frequently will have a
high probability to reside on a common object; 2) spatially distant regions in
a common object often exhibit similar visual saliency, which implies their
neighborship in a manifold. We present a novel energy function to efficiently
conduct graph partitioning. Based on multiple high quality partitions, we show
that the generated eigenvector histogram based representation can automatically
drive effective unary potentials for a hierarchical random field model to
produce multi-class segmentation. Sufficient experiments, on the BSDS500
benchmark, large-scale PASCAL VOC and COCO datasets, demonstrate the
competitive segmentation accuracy and significantly improved efficiency of our
proposed method compared with other state of the arts.
","[{'version': 'v1', 'created': 'Sat, 18 Feb 2017 20:37:42 GMT'}, {'version': 'v2', 'created': 'Sat, 2 Dec 2017 22:40:39 GMT'}]",2017-12-05,"[['Zhang', 'Zizhao', ''], ['Xing', 'Fuyong', ''], ['Wang', 'Hanzi', ''], ['Yan', 'Yan', ''], ['Huang', 'Ying', ''], ['Shi', 'Xiaoshuang', ''], ['Yang', 'Lin', '']]","['Image segmentation', 'Graph partition', 'Manifold']"
20401,1310.0395,Wajeb Gharibi,"Wajeb Gharibi, Marwah Mohammed Bakri",Protein Threading Based on Nonlinear Integer Programming,"5 pages. arXiv admin note: substantial text overlap with
  arXiv:1204.4562",,,,cs.DS cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Protein threading is a method of computational protein structure prediction
used for protein sequences which have the same fold as proteins of known
structures but do not have homologous proteins with known structure. The most
popular algorithm is based on linear integer programming. In this paper, we
consider methods based on nonlinear integer programming. Actually, the existing
linear integer programming is directly linearized from the original quadratic
integer programming. We then develop corresponding efficient algorithms.
","[{'version': 'v1', 'created': 'Tue, 1 Oct 2013 17:03:06 GMT'}]",2013-10-17,"[['Gharibi', 'Wajeb', ''], ['Bakri', 'Marwah Mohammed', '']]","['Protein Threading', 'Protein Structure Alignment', 'Integer Programming', 'Relaxation']"
20402,1007.5421,Matthieu Petit,"Henning Christiansen, Christian Theil Have, Ole Torp Lassen and
  Matthieu Petit",Inference with Constrained Hidden Markov Models in PRISM,,"TPLP 2010, 10 (4-6) 449-464",,,cs.AI cs.LO cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Hidden Markov Model (HMM) is a common statistical model which is widely
used for analysis of biological sequence data and other sequential phenomena.
In the present paper we show how HMMs can be extended with side-constraints and
present constraint solving techniques for efficient inference. Defining HMMs
with side-constraints in Constraint Logic Programming have advantages in terms
of more compact expression and pruning opportunities during inference.
  We present a PRISM-based framework for extending HMMs with side-constraints
and show how well-known constraints such as cardinality and all different are
integrated. We experimentally validate our approach on the biologically
motivated problem of global pairwise alignment.
","[{'version': 'v1', 'created': 'Fri, 30 Jul 2010 11:55:05 GMT'}]",2010-08-02,"[['Christiansen', 'Henning', ''], ['Have', 'Christian Theil', ''], ['Lassen', 'Ole Torp', ''], ['Petit', 'Matthieu', '']]","['Hidden Markov Model with side-constraints', 'Inference', 'PRogramming InStatistical Modeling']"
20403,1603.01524,Ilan Nehama,Ilan Nehama,"Analyzing Games with Ambiguous Player Types using the ${\rm MINthenMAX}$
  Decision Model",,,,,cs.GT cs.AI cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many common interactive scenarios, participants lack information about
other participants, and specifically about the preferences of other
participants. In this work, we model an extreme case of incomplete information,
which we term games with type ambiguity, where a participant lacks even
information enabling him to form a belief on the preferences of others. Under
type ambiguity, one cannot analyze the scenario using the commonly used
Bayesian framework, and therefore he needs to model the participants using a
different decision model.
  In this work, we present the ${\rm MINthenMAX}$ decision model under
ambiguity. This model is a refinement of Wald's MiniMax principle, which we
show to be too coarse for games with type ambiguity. We characterize ${\rm
MINthenMAX}$ as the finest refinement of the MiniMax principle that satisfies
three properties we claim are necessary for games with type ambiguity. This
prior-less approach we present her also follows the common practice in computer
science of worst-case analysis.
  Finally, we define and analyze the corresponding equilibrium concept assuming
all players follow ${\rm MINthenMAX}$. We demonstrate this equilibrium by
applying it to two common economic scenarios: coordination games and bilateral
trade. We show that in both scenarios, an equilibrium in pure strategies always
exists and we analyze the equilibria.
","[{'version': 'v1', 'created': 'Fri, 4 Mar 2016 16:29:02 GMT'}, {'version': 'v2', 'created': 'Wed, 30 Mar 2016 19:00:58 GMT'}, {'version': 'v3', 'created': 'Thu, 3 Nov 2016 18:51:47 GMT'}]",2016-11-04,"[['Nehama', 'Ilan', '']]","['Decision making under ambiguity', 'Games with ambiguity', 'Wald’s MiniMaxprinciple', 'MINthenMAX decision model', 'MINthenMAX equilibrium']"
20404,1610.00130,Travis Gagie,"Leo Ferres, Jos\'e Fuentes, Travis Gagie, Meng He and Gonzalo Navarro",Fast and Compact Planar Embeddings,"This research has received funding from the European Union's Horizon
  2020 research and innovation programme under the Marie Sklodowska-Curie
  Actions H2020-MSCA-RISE-2015 BIRDS GA No. 690941. Conference version
  presented at WADS 2017",,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are many representations of planar graphs, but few are as elegant as
Tur\'an's (1984): it is simple and practical, uses only 4 bits per edge, can
handle self-loops and multi-edges, and can store any specified embedding. Its
main disadvantage has been that ""it does not allow efficient searching""
(Jacobson, 1989). In this paper we show how to add a sublinear number of bits
to Tur\'an's representation such that it supports fast navigation while
retaining simplicity. As a consequence of the inherited simplicity, we offer
the first efficient parallel construction of a compact encoding of a planar
graph embedding. Our experimental results show that the resulting
representation uses about 6 bits per edge in practice, supports basic
navigation operations within a few microseconds, and can be built sequentially
at a rate below 1 microsecond per edge, featuring a linear speedup with a
parallel efficiency around 50\% for large datasets.
","[{'version': 'v1', 'created': 'Sat, 1 Oct 2016 12:57:47 GMT'}, {'version': 'v2', 'created': 'Tue, 14 Feb 2017 02:37:46 GMT'}, {'version': 'v3', 'created': 'Sun, 19 Feb 2017 11:35:04 GMT'}, {'version': 'v4', 'created': 'Tue, 2 May 2017 11:40:27 GMT'}, {'version': 'v5', 'created': 'Thu, 31 Aug 2017 15:18:13 GMT'}, {'version': 'v6', 'created': 'Thu, 21 Sep 2017 21:12:40 GMT'}, {'version': 'v7', 'created': 'Sun, 18 Feb 2018 23:47:33 GMT'}]",2018-02-20,"[['Ferres', 'Leo', ''], ['Fuentes', 'José', ''], ['Gagie', 'Travis', ''], ['He', 'Meng', ''], ['Navarro', 'Gonzalo', '']]","['Planar embedding', 'Compact data structures', 'Parallel construction']"
20405,1203.0240,Tapalina Bhattasali,"Tapalina Bhattasali, Rituparna Chaki","A Survey of Recent Intrusion Detection Systems for Wireless Sensor
  Network","10 pages,5 figures,proceedings of CNSA 2011 conference held in
  Chennai","Advances in Network Security and Applications: Conference
  Proceedings of Fourth International Conference on Network Security and
  Applications (CNSA 2011), Chennai, July 15-17, 2011, pp. 268-280, ISBN:
  978-3-642-22539-0",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Security of Wireless sensor network (WSN) becomes a very important issue with
the rapid development of WSN that is vulnerable to a wide range of attacks due
to deployment in the hostile environment and having limited resources.
Intrusion detection system is one of the major and efficient defensive methods
against attacks in WSN. A particularly devastating attack is the sleep
deprivation attack, where a malicious node forces legitimate nodes to waste
their energy by resisting the sensor nodes from going into low power sleep
mode. The goal of this attack is to maximize the power consumption of the
target node, thereby decreasing its battery life. Existing works on sleep
deprivation attack have mainly focused on mitigation using MAC based protocols,
such as S-MAC, T-MAC, B-MAC, etc. In this article, a brief review of some of
the recent intrusion detection systems in wireless sensor network environment
is presented. Finally, we propose a framework of cluster based layered
countermeasure that can efficiently mitigate sleep deprivation attack in WSN.
Simulation results on MATLAB exhibit the effectiveness of the proposed model in
detecting sleep-deprivation attacks.
","[{'version': 'v1', 'created': 'Thu, 1 Mar 2012 16:36:26 GMT'}]",2012-03-02,"[['Bhattasali', 'Tapalina', ''], ['Chaki', 'Rituparna', '']]","['WSN', 'Sleep Deprivation Attack', 'Cluster', 'IDS', 'Insomnia']"
20406,1402.3939,Suqi Cheng,"Suqi Cheng, Hua-Wei Shen, Junming Huang, Wei Chen, Xue-Qi Cheng",IMRank: Influence Maximization via Finding Self-Consistent Ranking,"10 pages, 8 figures, this paper has been submitted to SIGIR2014",,,,cs.SI cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Influence maximization, fundamental for word-of-mouth marketing and viral
marketing, aims to find a set of seed nodes maximizing influence spread on
social network. Early methods mainly fall into two paradigms with certain
benefits and drawbacks: (1)Greedy algorithms, selecting seed nodes one by one,
give a guaranteed accuracy relying on the accurate approximation of influence
spread with high computational cost; (2)Heuristic algorithms, estimating
influence spread using efficient heuristics, have low computational cost but
unstable accuracy.
  We first point out that greedy algorithms are essentially finding a
self-consistent ranking, where nodes' ranks are consistent with their
ranking-based marginal influence spread. This insight motivates us to develop
an iterative ranking framework, i.e., IMRank, to efficiently solve influence
maximization problem under independent cascade model. Starting from an initial
ranking, e.g., one obtained from efficient heuristic algorithm, IMRank finds a
self-consistent ranking by reordering nodes iteratively in terms of their
ranking-based marginal influence spread computed according to current ranking.
We also prove that IMRank definitely converges to a self-consistent ranking
starting from any initial ranking. Furthermore, within this framework, a
last-to-first allocating strategy and a generalization of this strategy are
proposed to improve the efficiency of estimating ranking-based marginal
influence spread for a given ranking. In this way, IMRank achieves both
remarkable efficiency and high accuracy by leveraging simultaneously the
benefits of greedy algorithms and heuristic algorithms. As demonstrated by
extensive experiments on large scale real-world social networks, IMRank always
achieves high accuracy comparable to greedy algorithms, with computational cost
reduced dramatically, even about $10-100$ times faster than other scalable
heuristics.
","[{'version': 'v1', 'created': 'Mon, 17 Feb 2014 09:33:15 GMT'}]",2014-02-18,"[['Cheng', 'Suqi', ''], ['Shen', 'Hua-Wei', ''], ['Huang', 'Junming', ''], ['Chen', 'Wei', ''], ['Cheng', 'Xue-Qi', '']]","['influence maximization', 'social network analysis', 'viral marketing', 'iterative method']"
20407,1704.07899,James Brusey,"James Brusey, Diana Hintea, Elena Gaura, Neil Beloe",Reinforcement Learning-based Thermal Comfort Control for Vehicle Cabins,,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Vehicle climate control systems aim to keep passengers thermally comfortable.
However, current systems control temperature rather than thermal comfort and
tend to be energy hungry, which is of particular concern when considering
electric vehicles. This paper poses energy-efficient vehicle comfort control as
a Markov Decision Process, which is then solved numerically using
Sarsa({\lambda}) and an empirically validated, single-zone, 1D thermal model of
the cabin. The resulting controller was tested in simulation using 200 randomly
selected scenarios and found to exceed the performance of bang-bang,
proportional, simple fuzzy logic, and commercial controllers with 23%, 43%,
40%, 56% increase, respectively. Compared to the next best performing
controller, energy consumption is reduced by 13% while the proportion of time
spent thermally comfortable is increased by 23%. These results indicate that
this is a viable approach that promises to translate into substantial comfort
and energy improvements in the car.
","[{'version': 'v1', 'created': 'Tue, 25 Apr 2017 20:24:17 GMT'}, {'version': 'v2', 'created': 'Tue, 5 Sep 2017 11:02:03 GMT'}]",2017-09-06,"[['Brusey', 'James', ''], ['Hintea', 'Diana', ''], ['Gaura', 'Elena', ''], ['Beloe', 'Neil', '']]","['Thermal Comfort', 'Reinforcement Learning', 'EquivalentTemperature', 'Comfort Model', 'Energy Consumption']"
20408,0910.0674,Gerard Briscoe Dr,G. Briscoe and P. De Wilde,Computing of Applied Digital Ecosystems,"8 pages, 10 figures, ACM Management of Emergent Digital EcoSystems
  (MEDES) 2009",,,,cs.NE cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A primary motivation for our research in digital ecosystems is the desire to
exploit the self-organising properties of biological ecosystems. Ecosystems are
thought to be robust, scalable architectures that can automatically solve
complex, dynamic problems. However, the computing technologies that contribute
to these properties have not been made explicit in digital ecosystems research.
Here, we discuss how different computing technologies can contribute to
providing the necessary self-organising features, including Multi-Agent
Systems, Service-Oriented Architectures, and distributed evolutionary
computing. The potential for exploiting these properties in digital ecosystems
is considered, suggesting how several key features of biological ecosystems can
be exploited in Digital Ecosystems, and discussing how mimicking these features
may assist in developing robust, scalable self-organising architectures. An
example architecture, the Digital Ecosystem, is considered in detail. The
Digital Ecosystem is then measured experimentally through simulations,
considering the self-organised diversity of its evolving agent populations
relative to the user request behaviour.
","[{'version': 'v1', 'created': 'Mon, 5 Oct 2009 04:29:29 GMT'}]",2009-10-06,"[['Briscoe', 'G.', ''], ['De Wilde', 'P.', '']]","['Service-OrientedArchitectures', 'Multi-AgentSystems', 'Ecosystem-Oriented Architectures', 'Distributed Evolutionary Computing']"
20409,1802.09104,Shuai Xu,"Ning Xie, Shuai Xu, Yekun Xu",A New Algorithm for Finding Closest Pair of Vectors,,,,,cs.DS cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given $n$ vectors $x_0, x_1, \ldots, x_{n-1}$ in $\{0,1\}^{m}$, how to find
two vectors whose pairwise Hamming distance is minimum? This problem is known
as the \emph{Closest Pair Problem}. If these vectors are generated uniformly at
random except two of them are correlated with Pearson-correlation coefficient
$\rho$, then the problem is called the \emph{Light Bulb Problem}. In this work,
we propose a novel coding-based scheme for the Closest Pair Problem. We design
both randomized and deterministic algorithms, which achieve the best-known
running time when the length of input vectors $m$ is small and the minimum
distance is very small compared to $m$. Specifically, the running time of our
randomized algorithm is $O(n\log^{2}n\cdot 2^{c m} \cdot \mathrm{poly}(m))$ and
the running time of our deterministic algorithm is $O(n\log{n}\cdot 2^{c' m}
\cdot \mathrm{poly}(m))$, where $c$ and $c'$ are constants depending only on
the (relative) distance of the closest pair. When applied to the Light Bulb
Problem, our result yields state-of-the-art deterministic running time when the
Pearson-correlation coefficient $\rho$ is very large. Specifically, when $\rho
\geq 0.9933$, our deterministic algorithm runs faster than the previously best
deterministic algorithm (Alman, SOSA 2019).
","[{'version': 'v1', 'created': 'Sun, 25 Feb 2018 23:10:19 GMT'}, {'version': 'v2', 'created': 'Tue, 27 Feb 2018 23:44:52 GMT'}, {'version': 'v3', 'created': 'Fri, 8 Mar 2019 23:15:34 GMT'}]",2019-03-12,"[['Xie', 'Ning', ''], ['Xu', 'Shuai', ''], ['Xu', 'Yekun', '']]","['Closest Pair Problem', 'Light Bulb Problem', 'Error Correcting Codes']"
20410,1802.07133,Hugo Jair  Escalante,"Lino Rodriguez-Coayahuitl, Alicia Morales-Reyes, Hugo Jair Escalante",Towards Deep Representation Learning with Genetic Programming,EuroGP preprint,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Genetic Programming (GP) is an evolutionary algorithm commonly used for
machine learning tasks. In this paper we present a method that allows GP to
transform the representation of a large-scale machine learning dataset into a
more compact representation, by means of processing features from the original
representation at individual level. We develop as a proof of concept of this
method an autoencoder. We tested a preliminary version of our approach in a
variety of well-known machine learning image datasets. We speculate that this
method, used in an iterative manner, can produce results competitive with
state-of-art deep neural networks.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 14:42:35 GMT'}]",2018-02-21,"[['Rodriguez-Coayahuitl', 'Lino', ''], ['Morales-Reyes', 'Alicia', ''], ['Escalante', 'Hugo Jair', '']]","['representation learning', 'deep learning', 'feature extraction', 'geneticprogramming', 'evolutionary machine learning']"
20411,1510.02163,Vahid Noormofidi,"Vahid Noormofidi, Susan R. Atlas, Huaiyu Duan","Performance Analysis of an Astrophysical Simulation Code on the Intel
  Xeon Phi Architecture",,,,CARC-2015-174,cs.DC cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We have developed the astrophysical simulation code XFLAT to study neutrino
oscillations in supernovae. XFLAT is designed to utilize multiple levels of
parallelism through MPI, OpenMP, and SIMD instructions (vectorization). It can
run on both CPU and Xeon Phi co-processors based on the Intel Many Integrated
Core Architecture (MIC). We analyze the performance of XFLAT on configurations
with CPU only, Xeon Phi only and both CPU and Xeon Phi. We also investigate the
impact of I/O and the multi-node performance of XFLAT on the Xeon Phi-equipped
Stampede supercomputer at the Texas Advanced Computing Center (TACC).
","[{'version': 'v1', 'created': 'Wed, 7 Oct 2015 23:02:00 GMT'}]",2015-10-12,"[['Noormofidi', 'Vahid', ''], ['Atlas', 'Susan R.', ''], ['Duan', 'Huaiyu', '']]","['Performance analysis', 'Xeon Phi', 'MIC', 'parallel programming', 'neutrino oscillations', 'supernova']"
20412,1301.1332,Daniel Ritter,Daniel Ritter,A Logic Programming Approach to Integration Network Inference,"15 pages, The 26th Workshop on Logic Programming (WLP), Bonn, 2012",,,,cs.DB cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The discovery, representation and reconstruction of (technical) integration
networks from Network Mining (NM) raw data is a difficult problem for
enterprises. This is due to large and complex IT landscapes within and across
enterprise boundaries, heterogeneous technology stacks, and fragmented data. To
remain competitive, visibility into the enterprise and partner IT networks on
different, interrelated abstraction levels is desirable.
  We present an approach to represent and reconstruct the integration networks
from NM raw data using logic programming based on first-order logic. The raw
data expressed as integration network model is represented as facts, on which
rules are applied to reconstruct the network. We have built a system that is
used to apply this approach to real-world enterprise landscapes and we report
on our experience with this system.
","[{'version': 'v1', 'created': 'Mon, 7 Jan 2013 20:52:40 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Jan 2013 16:24:10 GMT'}]",2013-01-09,"[['Ritter', 'Daniel', '']]","['Datalog', 'Integration Networks', 'Knowledge Representation', 'Logic Programming', 'Network Inference', 'Network Mining']"
20413,1401.8192,Anna Kad{\l}ubowska MSc,"Michal Klos, Karol Wawrzyniak, Marcin Jakubek, Grzegorz Orynczak","The Scheme of a Novel Methodology for Zonal Division Based on Power
  Transfer Distribution Factors",7 pages,,,,cs.CE cs.CY cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  One of the methodologies that carry out the division of the electrical grid
into zones is based on the aggregation of nodes characterized by similar Power
Transfer Distribution Factors (PTDFs). Here, we point out that satisfactory
clustering algorithm should take into account two aspects. First, nodes of
similar impact on cross-border lines should be grouped together. Second,
cross-border power flows should be relatively insensitive to differences
between real and assumed Generation Shift Key matrices. We introduce a
theoretical basis of a novel clustering algorithm (BubbleClust) that fulfills
these requirements and we perform a case study to illustrate social welfare
consequences of the division.
","[{'version': 'v1', 'created': 'Fri, 31 Jan 2014 15:28:12 GMT'}, {'version': 'v2', 'created': 'Fri, 18 Jul 2014 09:59:22 GMT'}, {'version': 'v3', 'created': 'Wed, 6 Aug 2014 09:45:46 GMT'}]",2014-08-07,"[['Klos', 'Michal', ''], ['Wawrzyniak', 'Karol', ''], ['Jakubek', 'Marcin', ''], ['Orynczak', 'Grzegorz', '']]","['Power system economics; Energy markets', 'regulation; Modelling', 'simulation']"
20414,1307.5393,Mahima Sharma,Miral Patel and Prem Balani,Clustering Algorithm for Gujarati Language,,"International Journal for Scientific Research & Development Vol 1,
  Issue 3, 2013",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Natural language processing area is still under research. But now a day it is
on platform for worldwide researchers. Natural language processing includes
analyzing the language based on its structure and then tagging of each word
appropriately with its grammar base. Here we have 50,000 tagged words set and
we try to cluster those Gujarati words based on proposed algorithm, we have
defined our own algorithm for processing. Many clustering techniques are
available Ex. Single linkage, complete, linkage,average linkage, Hear no of
clusters to be formed are not known, so it is all depends on the type of data
set provided . Clustering is preprocess for stemming . Stemming is the process
where root is extracted from its word. Ex. cats= cat+S, meaning. Cat: Noun and
plural form.
","[{'version': 'v1', 'created': 'Sat, 20 Jul 2013 09:05:15 GMT'}]",2013-07-23,"[['Patel', 'Miral', ''], ['Balani', 'Prem', '']]","['Stemmer', 'Gujarati Stemmer', 'Stemming', 'POS', 'Gujarati cluster', 'clustering of Gujarati words']"
20415,1505.07647,Yushi Jing,"Yushi Jing and David Liu and Dmitry Kislyuk and Andrew Zhai and
  Jiajing Xu and Jeff Donahue and Sarah Tavel",Visual Search at Pinterest,"in Proceedings of the 21th ACM SIGKDD International Conference on
  Knowledge and Discovery and Data Mining, 2015",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We demonstrate that, with the availability of distributed computation
platforms such as Amazon Web Services and open-source tools, it is possible for
a small engineering team to build, launch and maintain a cost-effective,
large-scale visual search system with widely available tools. We also
demonstrate, through a comprehensive set of live experiments at Pinterest, that
content recommendation powered by visual search improve user engagement. By
sharing our implementation details and the experiences learned from launching a
commercial visual search engines from scratch, we hope visual search are more
widely incorporated into today's commercial applications.
","[{'version': 'v1', 'created': 'Thu, 28 May 2015 11:17:39 GMT'}, {'version': 'v2', 'created': 'Tue, 13 Oct 2015 23:17:40 GMT'}, {'version': 'v3', 'created': 'Wed, 8 Mar 2017 05:02:00 GMT'}]",2017-03-09,"[['Jing', 'Yushi', ''], ['Liu', 'David', ''], ['Kislyuk', 'Dmitry', ''], ['Zhai', 'Andrew', ''], ['Xu', 'Jiajing', ''], ['Donahue', 'Jeff', ''], ['Tavel', 'Sarah', '']]","['visual search', 'visual shopping', 'open source']"
20416,1610.06669,Chris Mattmann,Chris Mattmann and Madhav Sharan,Scalable Pooled Time Series of Big Video Data from the Deep Web,"7 pages, 5 figures",,,,cs.CV,http://creativecommons.org/publicdomain/zero/1.0/,"  We contribute a scalable implementation of Ryoo et al's Pooled Time Series
algorithm from CVPR 2015. The updated algorithm has been evaluated on a large
and diverse dataset of approximately 6800 videos collected from a crawl of the
deep web related to human trafficking on DARPA's MEMEX effort. We describe the
properties of Pooled Time Series and the motivation for using it to relate
videos collected from the deep web. We highlight issues that we found while
running Pooled Time Series on larger datasets and discuss solutions for those
issues. Our solution centers are re-imagining Pooled Time Series as a
Hadoop-based algorithm in which we compute portions of the eventual solution in
parallel on large commodity clusters. We demonstrate that our new Hadoop-based
algorithm works well on the 6800 video dataset and shares all of the properties
described in the CVPR 2015 paper. We suggest avenues of future work in the
project.
","[{'version': 'v1', 'created': 'Fri, 21 Oct 2016 04:43:52 GMT'}]",2016-10-24,"[['Mattmann', 'Chris', ''], ['Sharan', 'Madhav', '']]","['pooled time series', 'hadoop', 'darpa', 'memex', 'video', 'analysis', 'multimedia']"
20417,1206.2484,Puneet  Singh,"Puneet Singh, Ashutosh Kapoor, Vishal Kaushik and Hima Bindu
  Maringanti","Architecture for Automated Tagging and Clustering of Song Files
  According to Mood",7 pages,"IJCSI Volume 7, Issue 4, No 2, pp 11-17, July 2010",,,cs.IR cs.MM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Music is one of the basic human needs for recreation and entertainment. As
song files are digitalized now a days, and digital libraries are expanding
continuously, which makes it difficult to recall a song. Thus need of a new
classification system other than genre is very obvious and mood based
classification system serves the purpose very well. In this paper we will
present a well-defined architecture to classify songs into different mood-based
categories, using audio content analysis, affective value of song lyrics to map
a song onto a psychological-based emotion space and information from online
sources. In audio content analysis we will use music features such as
intensity, timbre and rhythm including their subfeatures to map music in a
2-Dimensional emotional space. In lyric based classification 1-Dimensional
emotional space is used. Both the results are merged onto a 2-Dimensional
emotional space, which will classify song into a particular mood category.
Finally clusters of mood based song files are formed and arranged according to
data acquired from various Internet sources.
","[{'version': 'v1', 'created': 'Tue, 12 Jun 2012 10:28:11 GMT'}]",2012-06-13,"[['Singh', 'Puneet', ''], ['Kapoor', 'Ashutosh', ''], ['Kaushik', 'Vishal', ''], ['Maringanti', 'Hima Bindu', '']]","['Music i nformation ret rieval', 'mood detection from music', 'song classification', 'mood models', 'music features', 'lyric processing']"
20418,1407.0380,Imen Trabelsi,Imen Trabelsi and Dorra Ben Ayed,"A Multi Level Data Fusion Approach for Speaker Identification on
  Telephone Speech","10 pages, 4 figures, International Journal of Signal Processing,
  Image Processing and Pattern Recognition Vol. 6, No. 2, April, 2013",,,,cs.SD cs.LG,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Several speaker identification systems are giving good performance with clean
speech but are affected by the degradations introduced by noisy audio
conditions. To deal with this problem, we investigate the use of complementary
information at different levels for computing a combined match score for the
unknown speaker. In this work, we observe the effect of two supervised machine
learning approaches including support vectors machines (SVM) and na\""ive bayes
(NB). We define two feature vector sets based on mel frequency cepstral
coefficients (MFCC) and relative spectral perceptual linear predictive
coefficients (RASTA-PLP). Each feature is modeled using the Gaussian Mixture
Model (GMM). Several ways of combining these information sources give
significant improvements in a text-independent speaker identification task
using a very large telephone degraded NTIMIT database.
","[{'version': 'v1', 'created': 'Fri, 27 Jun 2014 20:34:05 GMT'}]",2014-07-03,"[['Trabelsi', 'Imen', ''], ['Ayed', 'Dorra Ben', '']]","['Fusion', 'GMM', 'SVM', 'Naïve Bayes', 'MFCC', 'RASTA-PLP']"
20419,1212.6810,Kristin Glass,Kristin Glass and Richard Colbaugh,Web Analytics for Security Informatics,,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An enormous volume of security-relevant information is present on the Web,
for instance in the content produced each day by millions of bloggers
worldwide, but discovering and making sense of these data is very challenging.
This paper considers the problem of exploring and analyzing the Web to realize
three fundamental objectives: 1.) security relevant information discovery; 2.)
target situational awareness, typically by making (near) real-time inferences
concerning events and activities from available observations; and 3.)
predictive analysis, to include providing early warning for crises and forming
predictions regarding likely outcomes of emerging issues and contemplated
interventions. The proposed approach involves collecting and integrating three
types of Web data, textual, relational, and temporal, to perform assessments
and generate insights that would be difficult or impossible to obtain using
standard methods. We demonstrate the efficacy of the framework by summarizing a
number of successful real-world deployments of the methodology.
","[{'version': 'v1', 'created': 'Mon, 31 Dec 2012 02:40:49 GMT'}]",2013-01-01,"[['Glass', 'Kristin', ''], ['Colbaugh', 'Richard', '']]","['Web analysis', 'security informatics', 'network analysis', 'text analysis', 'supervised/unsupervised learning', 'predictive analysis']"
20420,1610.04936,Zongliang Zhang,"Zongliang Zhang, Jonathan Li, Yulan Guo, Yangbin Lin, Ming Cheng,
  Cheng Wang",Partial Procedural Geometric Model Fitting for Point Clouds,,,,,cs.GR cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Geometric model fitting is a fundamental task in computer graphics and
computer vision. However, most geometric model fitting methods are unable to
fit an arbitrary geometric model (e.g. a surface with holes) to incomplete
data, due to that the similarity metrics used in these methods are unable to
measure the rigid partial similarity between arbitrary models. This paper hence
proposes a novel rigid geometric similarity metric, which is able to measure
both the full similarity and the partial similarity between arbitrary geometric
models. The proposed metric enables us to perform partial procedural geometric
model fitting (PPGMF). The task of PPGMF is to search a procedural geometric
model space for the model rigidly similar to a query of non-complete point set.
Models in the procedural model space are generated according to a set of
parametric modeling rules. A typical query is a point cloud. PPGMF is very
useful as it can be used to fit arbitrary geometric models to non-complete
(incomplete, over-complete or hybrid-complete) point cloud data. For example,
most laser scanning data is non-complete due to occlusion. Our PPGMF method
uses Markov chain Monte Carlo technique to optimize the proposed similarity
metric over the model space. To accelerate the optimization process, the method
also employs a novel coarse-to-fine model dividing strategy to reject
dissimilar models in advance. Our method has been demonstrated on a variety of
geometric models and non-complete data. Experimental results show that the
PPGMF method based on the proposed metric is able to fit non-complete data,
while the method based on other metrics is unable. It is also shown that our
method can be accelerated by several times via early rejection.
","[{'version': 'v1', 'created': 'Mon, 17 Oct 2016 00:47:36 GMT'}]",2016-10-18,"[['Zhang', 'Zongliang', ''], ['Li', 'Jonathan', ''], ['Guo', 'Yulan', ''], ['Lin', 'Yangbin', ''], ['Cheng', 'Ming', ''], ['Wang', 'Cheng', '']]","['inverse procedural modeling', 'partial shape fitting', 'rigid geometric similarity', 'incomplete point cloud reconstruction', 'mean measure']"
20421,0707.3979,Refugio Vallejo,Isidro B. Nieto and J. Refugio Vallejo,"Clifford Algebra of the Vector Space of Conics for decision boundary
  Hyperplanes in m-Euclidean Space","12 pages, 2 figures, 1 table",,,,cs.NE cs.CG,,"  In this paper we embed $m$-dimensional Euclidean space in the geometric
algebra $Cl_m $ to extend the operators of incidence in ${R^m}$ to operators of
incidence in the geometric algebra to generalize the notion of separator to a
decision boundary hyperconic in the Clifford algebra of hyperconic sections
denoted as ${Cl}({Co}_{2})$. This allows us to extend the concept of a linear
perceptron or the spherical perceptron in conformal geometry and introduce the
more general conic perceptron, namely the {elliptical perceptron}. Using
Clifford duality a vector orthogonal to the decision boundary hyperplane is
determined. Experimental results are shown in 2-dimensional Euclidean space
where we separate data that are naturally separated by some typical plane conic
separators by this procedure. This procedure is more general in the sense that
it is independent of the dimension of the input data and hence we can speak of
the hyperconic elliptic perceptron.
","[{'version': 'v1', 'created': 'Thu, 26 Jul 2007 18:03:23 GMT'}]",2007-07-27,"[['Nieto', 'Isidro B.', ''], ['Vallejo', 'J. Refugio', '']]","['Computational Geometry', 'Geometric Algebra', 'Neural Networks', 'Projective Geometry ofHyperconics', 'Elliptical Perceptrons']"
20422,1501.03992,"Ilkka T\""orm\""a","Eric Goles, Pedro Montealegre, Ville Salo, Ilkka T\""orm\""a",PSPACE-Completeness of Majority Automata Networks,"14 pages, 8 figures",,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the dynamics of majority automata networks when the vertices are
updated according to a block sequential updating scheme. In particular, we show
that the complexity of the problem of predicting an eventual state change in
some vertex, given an initial configuration, is PSPACE-complete.
","[{'version': 'v1', 'created': 'Fri, 16 Jan 2015 14:42:49 GMT'}]",2015-01-19,"[['Goles', 'Eric', ''], ['Montealegre', 'Pedro', ''], ['Salo', 'Ville', ''], ['Törmä', 'Ilkka', '']]","['Boolean network', 'majority network', 'prediction problem', 'PSPACE']"
20423,1109.0129,Sheng-Gwo Chen,"Sheng-Gwo Chen, Jyh-Yang Wu",Discrete Conservation Law on Curved Surfaces,"18 pages, 9 figures",,,,cs.CG math.NA physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we shall introduce a simple, effective numerical method for
finding differential operators for scalar and vector-valued functions on
surfaces. The key idea of our algorithm is to develop an intrinsic and unified
way to compute directly the partial derivatives of functions defined on
triangular meshes which are the discretization of regular surfaces under
consideration. Most importantly, the divergence theorem and conservation laws
on triangular meshes are fulfilled.
","[{'version': 'v1', 'created': 'Thu, 1 Sep 2011 08:57:31 GMT'}]",2011-09-02,"[['Chen', 'Sheng-Gwo', ''], ['Wu', 'Jyh-Yang', '']]","['Gradient', 'Divergence', 'Laplace-Beltrami operators', 'LTL method', 'Conservation law']"
20424,1705.07879,Julio Albinati,"Julio Albinati, Wagner Meira Jr., Gisele L. Pappa, Mauro Teixeira,
  Cecilia Marques-Toledo","Enhancement of Epidemiological Models for Dengue Fever Based on Twitter
  Data",ACM Digital Health 2017,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Epidemiological early warning systems for dengue fever rely on up-to-date
epidemiological data to forecast future incidence. However, epidemiological
data typically requires time to be available, due to the application of
time-consuming laboratorial tests. This implies that epidemiological models
need to issue predictions with larger antecedence, making their task even more
difficult. On the other hand, online platforms, such as Twitter or Google,
allow us to obtain samples of users' interaction in near real-time and can be
used as sensors to monitor current incidence. In this work, we propose a
framework to exploit online data sources to mitigate the lack of up-to-date
epidemiological data by obtaining estimates of current incidence, which are
then explored by traditional epidemiological models. We show that the proposed
framework obtains more accurate predictions than alternative approaches, with
statistically better results for delays greater or equal to 4 weeks.
","[{'version': 'v1', 'created': 'Mon, 22 May 2017 17:45:51 GMT'}]",2017-05-23,"[['Albinati', 'Julio', ''], ['Meira', 'Wagner', 'Jr.'], ['Pappa', 'Gisele L.', ''], ['Teixeira', 'Mauro', ''], ['Marques-Toledo', 'Cecilia', '']]","['dengue fever', 'Twiter', 'Gaussian processes']"
20425,1710.04749,Vijay Manikandan Janakiraman,Vijay Manikandan Janakiraman,"Explaining Aviation Safety Incidents Using Deep Temporal Multiple
  Instance Learning",,,,,cs.CV cs.AI stat.AP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although aviation accidents are rare, safety incidents occur more frequently
and require a careful analysis to detect and mitigate risks in a timely manner.
Analyzing safety incidents using operational data and producing event-based
explanations is invaluable to airline companies as well as to governing
organizations such as the Federal Aviation Administration (FAA) in the United
States. However, this task is challenging because of the complexity involved in
mining multi-dimensional heterogeneous time series data, the lack of
time-step-wise annotation of events in a flight, and the lack of scalable tools
to perform analysis over a large number of events. In this work, we propose a
precursor mining algorithm that identifies events in the multidimensional time
series that are correlated with the safety incident. Precursors are valuable to
systems health and safety monitoring and in explaining and forecasting safety
incidents. Current methods suffer from poor scalability to high dimensional
time series data and are inefficient in capturing temporal behavior. We propose
an approach by combining multiple-instance learning (MIL) and deep recurrent
neural networks (DRNN) to take advantage of MIL's ability to learn using weakly
supervised data and DRNN's ability to model temporal behavior. We describe the
algorithm, the data, the intuition behind taking a MIL approach, and a
comparative analysis of the proposed algorithm with baseline models. We also
discuss the application to a real-world aviation safety problem using data from
a commercial airline company and discuss the model's abilities and
shortcomings, with some final remarks about possible deployment directions.
","[{'version': 'v1', 'created': 'Thu, 12 Oct 2017 23:42:00 GMT'}, {'version': 'v2', 'created': 'Mon, 12 Feb 2018 05:16:08 GMT'}]",2018-02-13,"[['Janakiraman', 'Vijay Manikandan', '']]","['Multiple Instance Learning', 'Deep Learning', 'Time Series', 'AviationSafety', 'Systems Health Management', 'Precursor']"
20426,1702.02133,Lalla Mouatadid,"Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr",A New Graph Parameter To Measure Linearity,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Consider a sequence of LexBFS vertex orderings {\sigma}1, {\sigma}2, . . .
where each ordering {\sigma}i is used to break ties for {\sigma}i+1. Since the
total number of vertex orderings of a finite graph is finite, this sequence
must end in a cycle of vertex orderings. The possible length of this cycle is
the main subject of this work. Intuitively, we prove for graphs with a known
notion of linearity (e.g., interval graphs with their interval representation
on the real line), this cycle cannot be too big, no matter which vertex
ordering we start with. More precisely, it was conjectured in [9] that for
cocomparability graphs, the size of this cycle is always 2, independent of the
starting order. Furthermore [27] asked whether for arbitrary graphs, the size
of such a cycle is always bounded by the asteroidal number of the graph. In
this work, while we answer this latter question negatively, we provide support
for the conjecture on cocomparability graphs by proving it for the subclass of
domino-free cocomparability graphs. This subclass contains cographs, proper
interval, interval, and cobipartite graphs. We also provide simpler independent
proofs for each of these cases which lead to stronger results on this
subclasses.
","[{'version': 'v1', 'created': 'Tue, 7 Feb 2017 18:46:02 GMT'}, {'version': 'v2', 'created': 'Sun, 16 Jul 2017 03:47:09 GMT'}, {'version': 'v3', 'created': 'Thu, 20 Jul 2017 01:47:10 GMT'}, {'version': 'v4', 'created': 'Sat, 9 Jan 2021 23:22:32 GMT'}, {'version': 'v5', 'created': 'Mon, 17 Oct 2022 23:59:46 GMT'}]",2022-10-19,"[['Charbit', 'Pierre', ''], ['Habib', 'Michel', ''], ['Mouatadid', 'Lalla', ''], ['Naserasr', 'Reza', '']]","['Graph search', 'LexBFS', 'multisweep algorithms', 'asteroidalnumber', 'cocomparability graphs', 'interval graphs']"
20427,0908.1220,R Doomun,"Maher Ben Jemaa, Maryam Kallel Zouari, Bachar Zouari","A new approach to services differentiation between mobile terminals of a
  wireless LAN","8 Pages, IEEE Format, International Journal of Computer Science and
  Information Security, IJCSIS 2009, ISSN 1947 5500, Impact Factor 0.423","International Journal of Computer Science and Information
  Security, IJCSIS, Vol. 3, No. 1, July 2009, USA",,ISSN 1947 5500,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This study aims to identify the advantages and disadvantages of several
mechanisms for service differentiation in mobile terminals of a wireless LAN to
establish a more better and more optimal. At the end of the analysis of
available approaches for the quality of service of the IEEE 802.11 standard,
the objective of this paper is to suggest a new method named DF-DCF
Differentiated Frame DCF. The performance of the suggested method in a Network
Simulator (NS) environment allowed its validation through a set of testing and
simulation scenarios. Simulation results have shown that the DF-DCF method is
better suited for mobile nodes in a wireless communication network.
","[{'version': 'v1', 'created': 'Sun, 9 Aug 2009 10:22:09 GMT'}]",2009-08-11,"[['Jemaa', 'Maher Ben', ''], ['Zouari', 'Maryam Kallel', ''], ['Zouari', 'Bachar', '']]","['Service Differentiation', 'Wireless LAN', 'mobility', 'DCF', 'DF-DCF', 'NS']"
20428,1410.1653,S\'andor Kisfaludi-Bak,"Zolt\'an Kir\'aly, S\'andor Kisfaludi-Bak",Notes on dual-critical graphs,"10 pages, conference",,,,cs.DS cs.CC math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We define dual-critical graphs as graphs having an acyclic orientation, where
the indegrees are odd except for the unique source. We have very limited
knowledge about the complexity of dual-criticality testing. By the definition
the problem is in NP, and a result of Bal\'azs and Christian Szegedy provides a
randomized polynomial algorithm, which relies on formal matrix rank computing.
It is unknown whether dual-criticality test can be done in deterministic
polynomial time. Moreover, the question of being in co-NP is also open.
  We give equivalent descriptions for dual-critical graphs in the general case,
and further equivalent descriptions in the special cases of planar graphs and
3-regular graphs. These descriptions provide polynomial algorithms for these
special classes. We also give an FPT algorithm for a relaxed version of
dual-criticality called $k$-dual-criticality.
","[{'version': 'v1', 'created': 'Tue, 7 Oct 2014 09:44:06 GMT'}]",2014-10-08,"[['Király', 'Zoltán', ''], ['Kisfaludi-Bak', 'Sándor', '']]","['dual-critical', 'factor-critical', 'ear decomposition', 'FPT algorithm']"
20429,1005.4264,Chriss Romy,"Najme Zehra, Mansi Sharma, Somya Ahuja, Shubha Bansal",Bio-Authentication based Secure Transmission System using Steganography,"IEEE Publication format, International Journal of Computer Science
  and Information Security, IJCSIS, Vol. 8 No. 1, April 2010, USA. ISSN 1947
  5500, http://sites.google.com/site/ijcsis/",,,,cs.CR,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Biometrics deals with identity verification of an individual by using certain
physiological or behavioral features associated with a person. Biometric
identification systems using fingerprints patterns are called AFIS (Automatic
Fingerprint Identification System). In this paper a composite method for
Fingerprint recognition is considered using a combination of Fast Fourier
Transform (FFT) and Sobel Filters for improvement of a poor quality fingerprint
image. Steganography hides messages inside other messages in such a way that an
""adversary"" would not even know a secret message were present. The objective of
our paper is to make a bio-secure system. In this paper bio-authentication has
been implemented in terms of finger print recognition and the second part of
the paper is an interactive steganographic system hides the user's data by two
options- creating a songs list or hiding the data in an image.
","[{'version': 'v1', 'created': 'Mon, 24 May 2010 07:13:07 GMT'}]",2010-05-25,"[['Zehra', 'Najme', ''], ['Sharma', 'Mansi', ''], ['Ahuja', 'Somya', ''], ['Bansal', 'Shubha', '']]","['Fingerprint', 'minutiae', 'Listega', 'steganography', 'LSB   I']"
20430,0711.0326,Aleksandar Lazarevic,"Aleksandar Lazarevic, Lionel Sacks, Ognjen Prnjat",Enabling Adaptive Grid Scheduling and Resource Management,,International Symposium on Integrated Network Management 2005,,,cs.DC,,"  Wider adoption of the Grid concept has led to an increasing amount of
federated computational, storage and visualisation resources being available to
scientists and researchers. Distributed and heterogeneous nature of these
resources renders most of the legacy cluster monitoring and management
approaches inappropriate, and poses new challenges in workflow scheduling on
such systems. Effective resource utilisation monitoring and highly granular yet
adaptive measurements are prerequisites for a more efficient Grid scheduler. We
present a suite of measurement applications able to monitor per-process
resource utilisation, and a customisable tool for emulating observed
utilisation models. We also outline our future work on a predictive and
probabilistic Grid scheduler. The research is undertaken as part of UK
e-Science EPSRC sponsored project SO-GRM (Self-Organising Grid Resource
Management) in cooperation with BT.
","[{'version': 'v1', 'created': 'Fri, 2 Nov 2007 15:30:53 GMT'}]",2007-11-05,"[['Lazarevic', 'Aleksandar', ''], ['Sacks', 'Lionel', ''], ['Prnjat', 'Ognjen', '']]","['Grid', 'scheduling', 'resource monitoring', 'resource management', 'self-organising management']"
20431,1710.05703,Noman Islam Dr.,"Noman Islam, Zeeshan Islam, Nazia Noor",A Survey on Optical Character Recognition System,,,,,cs.CV cs.AI cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Optical Character Recognition (OCR) has been a topic of interest for many
years. It is defined as the process of digitizing a document image into its
constituent characters. Despite decades of intense research, developing OCR
with capabilities comparable to that of human still remains an open challenge.
Due to this challenging nature, researchers from industry and academic circles
have directed their attentions towards Optical Character Recognition. Over the
last few years, the number of academic laboratories and companies involved in
research on Character Recognition has increased dramatically. This research
aims at summarizing the research so far done in the field of OCR. It provides
an overview of different aspects of OCR and discusses corresponding proposals
aimed at resolving issues of OCR.
","[{'version': 'v1', 'created': 'Tue, 3 Oct 2017 15:08:49 GMT'}]",2017-10-17,"[['Islam', 'Noman', ''], ['Islam', 'Zeeshan', ''], ['Noor', 'Nazia', '']]","['character recognition', 'document image analysis', 'OCR', 'OCR survey', 'classification']"
20432,1410.5088,Matt Lewis,Cristina David and Daniel Kroening and Matt Lewis,"Propositional Reasoning about Safety and Termination of
  Heap-Manipulating Programs",,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper shows that it is possible to reason about the safety and
termination of programs handling potentially cyclic, singly-linked lists using
propositional reasoning even when the safety invariants and termination
arguments depend on constraints over the lengths of lists. For this purpose, we
propose the theory SLH of singly-linked lists with length, which is able to
capture non-trivial interactions between shape and arithmetic. When using the
theory of bit-vector arithmetic as a background, SLH is efficiently decidable
via a reduction to SAT. We show the utility of SLH for software verification by
using it to express safety invariants and termination arguments for programs
manipulating potentially cyclic, singly-linked lists with unrestricted,
unspecified sharing. We also provide an implementation of the decision
procedure and use it to check safety and termination proofs for several
heap-manipulating programs.
","[{'version': 'v1', 'created': 'Sun, 19 Oct 2014 16:29:27 GMT'}]",2014-10-21,"[['David', 'Cristina', ''], ['Kroening', 'Daniel', ''], ['Lewis', 'Matt', '']]","['Heap', 'SAT', 'safety', 'termination']"
20433,1704.07468,Yanjun  Qi Dr.,"Ritambhara Singh, Arshdeep Sekhon, Kamran Kowsari, Jack Lanchantin,
  Beilun Wang and Yanjun Qi",GaKCo: a Fast GApped k-mer string Kernel using COunting,@ECML 2017,,,,cs.LG cs.AI cs.CC cs.CL cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  String Kernel (SK) techniques, especially those using gapped $k$-mers as
features (gk), have obtained great success in classifying sequences like DNA,
protein, and text. However, the state-of-the-art gk-SK runs extremely slow when
we increase the dictionary size ($\Sigma$) or allow more mismatches ($M$). This
is because current gk-SK uses a trie-based algorithm to calculate co-occurrence
of mismatched substrings resulting in a time cost proportional to
$O(\Sigma^{M})$. We propose a \textbf{fast} algorithm for calculating
\underline{Ga}pped $k$-mer \underline{K}ernel using \underline{Co}unting
(GaKCo). GaKCo uses associative arrays to calculate the co-occurrence of
substrings using cumulative counting. This algorithm is fast, scalable to
larger $\Sigma$ and $M$, and naturally parallelizable. We provide a rigorous
asymptotic analysis that compares GaKCo with the state-of-the-art gk-SK.
Theoretically, the time cost of GaKCo is independent of the $\Sigma^{M}$ term
that slows down the trie-based approach. Experimentally, we observe that GaKCo
achieves the same accuracy as the state-of-the-art and outperforms its speed by
factors of 2, 100, and 4, on classifying sequences of DNA (5 datasets), protein
(12 datasets), and character-based English text (2 datasets), respectively.
  GaKCo is shared as an open source tool at
\url{https://github.com/QData/GaKCo-SVM}
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 21:43:21 GMT'}, {'version': 'v2', 'created': 'Sun, 30 Apr 2017 20:12:01 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Sep 2017 17:25:17 GMT'}]",2017-09-19,"[['Singh', 'Ritambhara', ''], ['Sekhon', 'Arshdeep', ''], ['Kowsari', 'Kamran', ''], ['Lanchantin', 'Jack', ''], ['Wang', 'Beilun', ''], ['Qi', 'Yanjun', '']]","['Fast Learning', 'String Kernels', 'Sequence Classification', 'Gapped k-mer String Kernel', 'Counting Statistics']"
20434,1506.08915,Jue Wang,Jue Wang,Optimal Sequential Multi-class Diagnosis,"68 pages, 22 figures, 10 tables",,,,cs.IT math.IT stat.ME,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sequential multi-class diagnosis, also known as multi-hypothesis testing, is
a classical sequential decision problem with broad applications. However, the
optimal solution remains, in general, unknown as the dynamic program suffers
from the curse of dimensionality in the posterior belief space. We consider a
class of practical problems in which the observation distributions associated
with different classes are related through exponential tilting, and show that
the reachable beliefs could be restricted on, or near, a set of
low-dimensional, time-dependent manifolds with closed-form expressions. This
sparsity is driven by the low dimensionality of the observation distributions
(which is intuitive) as well as by specific structural interrelations among
them (which is less intuitive). We use a matrix factorization approach to
uncover the potential low dimensionality hidden in high-dimensional beliefs and
reconstruct the beliefs using a diagnostic statistic in lower dimension. For
common univariate distributions, e.g., normal, binomial, and Poisson, the
belief reconstruction is exact, and the optimal policies can be efficiently
computed for a large number of classes. We also characterize the structure of
the optimal policy in the reduced dimension. For multivariate distributions, we
propose a low-rank matrix approximation scheme that works well when the beliefs
are near the low-dimensional manifolds. The optimal policy significantly
outperforms the state-of-the-art heuristic policy in quick diagnosis with noisy
data. (forthcoming in Operations Research)
","[{'version': 'v1', 'created': 'Tue, 30 Jun 2015 01:55:30 GMT'}, {'version': 'v2', 'created': 'Thu, 26 Jan 2017 16:10:14 GMT'}, {'version': 'v3', 'created': 'Mon, 23 Dec 2019 15:10:18 GMT'}, {'version': 'v4', 'created': 'Thu, 3 Dec 2020 19:13:35 GMT'}]",2020-12-07,"[['Wang', 'Jue', '']]","['classification', 'optimalpolicy', 'partiallyobservableMarkovdecisionprocess']"
20435,1510.03057,Mauricio Toro,Mauricio Toro,"Towards non-threaded Concurrent Constraint Programming for implementing
  multimedia interaction systems",55 pages,,,,cs.MM cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work we explain the implementation of event-driven real-time
interpreters for the Concurrent Constraint Programming (CCP) and
Non-deterministic Timed Concurrent Constraint (NTCC) for- malisms. The CCP
interpreter was tested with a program to find, concurrently, paths in a graph
and it will be used in the future to find musical sequences in the music
improvisation software Omax, developed by the French Acoustics/Music Research
Institute (IRCAM). In the other hand, the NTCC interpreter was tested with a
music improvisation system based on NTCC (CCFOMI), developed by the AVISPA
research group and IRCAM. Additionally, we present GECOL 2, a wrapper for the
Generic Constraints Development Environment (GECODE) to Common LISP, de-
veloped to port the interpreters to Common LISP in the future. We concluded
that using GECODE for the concurrency control avoids the need of having threads
and synchronizing them, leading to a simple and efficient implementation of CCP
and NTCC. We also noticed that the time units in NTCC interpreter do not
represent discrete time units, because when we simulate the NTCC specifications
in the interpreter, the time units have different durations. In the future, we
propose forcing the duration of each time unit to a fix time, that way we would
be able to reason about NTCC time units as we do with discrete time units.
","[{'version': 'v1', 'created': 'Sun, 11 Oct 2015 14:15:47 GMT'}]",2015-10-13,"[['Toro', 'Mauricio', '']]","['NTCC', 'CCP', 'interpreter', 'real-time', 'GECODE', 'GECOL']"
20436,1304.3145,Yongjie Yang,Yongjie Yang and Jiong Guo,Exact Algorithms for Weighted and Unweighted Borda Manipulation Problems,"9 pages, 3 figures, a short version appears in AAMAS 2013",,,,cs.DS cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Both weighted and unweighted Borda manipulation problems have been proved
$\mathcal{NP}$-hard. However, there is no exact combinatorial algorithm known
for these problems. In this paper, we initiate the study of exact combinatorial
algorithms for both weighted and unweighted Borda manipulation problems. More
precisely, we propose $O^*((m\cdot 2^m)^{t+1})$time and
$O^*(t^{2m})$time\footnote{$O^*()$ is the $O()$ notation with suppressed
factors polynomial in the size of the input.} combinatorial algorithms for
weighted and unweighted Borda manipulation problems, respectively, where $t$ is
the number of manipulators and $m$ is the number of candidates. Thus, for $t=2$
we solve one of the open problems posted by Betzler et al. [IJCAI 2011]. As a
byproduct of our results, we show that the {{unweighted Borda manipulation}}
problem admits an algorithm of running time $O^*(2^{9m^2\log{m}})$, based on an
integer linear programming technique. Finally, we study the {{unweighted Borda
manipulation}} problem under single-peaked elections and present
polynomial-time algorithms for the problem in the case of two manipulators, in
contrast to the $\mathcal{NP}$-hardness of this case in general settings.
","[{'version': 'v1', 'created': 'Wed, 10 Apr 2013 21:05:08 GMT'}]",2013-04-12,"[['Yang', 'Yongjie', ''], ['Guo', 'Jiong', '']]","['voting systems', 'Borda manipulation', 'exact combinatorial algorithm', 'single-peaked election']"
20437,1409.8239,Tanmay Agrawal,"Tanmay Agrawal, Ashay Shirwadkar, Pratik Gaikar, Kushagra Verma",MetaCache: Efficient Metadata Caching in Linux file system,"4 pages, 8 figures",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, Linux file systems have to manage millions of tiny files for
different applications, and face with higher metadata operations. So how to
provide such high metadata performance with such enormous number of files and
large scale directories is a big challenge for Linux file system. We viewed
that metadata lookup operations dominate metadata workload and incur low
metadata performance. In this paper, we present a metadata cache to accelerate
metadata access for Linux file system. Through this optimization, the Linux
file system (such as EXT2, EXT4, BTRFS, etc.) can gain improvement in read
rates as well as write rates.
","[{'version': 'v1', 'created': 'Mon, 29 Sep 2014 19:10:47 GMT'}]",2014-09-30,"[['Agrawal', 'Tanmay', ''], ['Shirwadkar', 'Ashay', ''], ['Gaikar', 'Pratik', ''], ['Verma', 'Kushagra', '']]","['Metadata', 'NoSQL', 'Kernel', 'Castle', 'LSM tree']"
20438,0706.0280,Tshilidzi Marwala,Evan Hurwitz and Tshilidzi Marwala,Multi-Agent Modeling Using Intelligent Agents in the Game of Lerpa,32 pages,,,,cs.MA cs.GT,,"  Game theory has many limitations implicit in its application. By utilizing
multiagent modeling, it is possible to solve a number of problems that are
unsolvable using traditional game theory. In this paper reinforcement learning
is applied to neural networks to create intelligent agents
","[{'version': 'v1', 'created': 'Sat, 2 Jun 2007 17:20:21 GMT'}]",2007-06-05,"[['Hurwitz', 'Evan', ''], ['Marwala', 'Tshilidzi', '']]","['Neural Networks', 'Reinforcement Learning', 'Game Theory', 'Temporal Difference', 'Multi Agent', 'Lerpa']"
20439,1407.6128,Truyen Tran,Truyen Tran and Svetha Venkatesh,Permutation Models for Collaborative Ranking,,,,,cs.IR cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the problem of collaborative filtering where ranking information is
available. Focusing on the core of the collaborative ranking process, the user
and their community, we propose new models for representation of the underlying
permutations and prediction of ranks. The first approach is based on the
assumption that the user makes successive choice of items in a stage-wise
manner. In particular, we extend the Plackett-Luce model in two ways -
introducing parameter factoring to account for user-specific contribution, and
modelling the latent community in a generative setting. The second approach
relies on log-linear parameterisation, which relaxes the discrete-choice
assumption, but makes learning and inference much more involved. We propose
MCMC-based learning and inference methods and derive linear-time prediction
algorithms.
","[{'version': 'v1', 'created': 'Wed, 23 Jul 2014 08:20:09 GMT'}]",2014-07-24,"[['Tran', 'Truyen', ''], ['Venkatesh', 'Svetha', '']]","['permutation', 'ranking', 'collaborative filtering']"
20440,1602.08563,Marcin Bienkowski,"Marcin Bienkowski, Jan Marcinkowski, Maciej Pacut, Stefan Schmid,
  Aleksandra Spyra",Online Tree Caching,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We initiate the study of a natural and practically relevant new variant of
online caching where the to-be-cached items can have dependencies. We assume
that the universe is a tree T and items are tree nodes; we require that if a
node v is cached then the whole subtree T(v) rooted at v is cached as well.
This theoretical problem finds an immediate application in the context of
forwarding table optimization in IP routing and software-defined networks.
  We present an elegant online deterministic algorithm TC for this problem, and
rigorously prove that its competitive ratio is O(height(T) *
k_ALG/(k_ALG-k_OPT+1)), where k_ALG and k_OPT denote the cache sizes of an
online and the optimal offline algorithm, respectively. The result is optimal
up to a factor of O(height(T)).
","[{'version': 'v1', 'created': 'Sat, 27 Feb 2016 07:35:49 GMT'}, {'version': 'v2', 'created': 'Sun, 14 May 2017 23:17:40 GMT'}]",2017-05-16,"[['Bienkowski', 'Marcin', ''], ['Marcinkowski', 'Jan', ''], ['Pacut', 'Maciej', ''], ['Schmid', 'Stefan', ''], ['Spyra', 'Aleksandra', '']]","['online algorithms', 'competitive analysis', 'caching', 'routers', 'softwaredefined networking', 'forwarding information base']"
20441,1004.3271,Vishal Goyal,"Antonio Cimino, Francesco Longo, Giovanni Mirabelli","A General Simulation Framework for Supply Chain Modeling: State of the
  Art and Case Study","International Journal of Computer Science Issues online at
  http://ijcsi.org/articles/A-General-Simulation-Framework-for-Supply-Chain-Modeling-State-of-the-Art-and-Case-Study.php","IJCSI, Volume 7, Issue 2, March 2010",,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays there is a large availability of discrete event simulation software
that can be easily used in different domains: from industry to supply chain,
from healthcare to business management, from training to complex systems
design. Simulation engines of commercial discrete event simulation software use
specific rules and logics for simulation time and events management.
Difficulties and limitations come up when commercial discrete event simulation
software are used for modeling complex real world-systems (i.e. supply chains,
industrial plants). The objective of this paper is twofold: first a state of
the art on commercial discrete event simulation software and an overview on
discrete event simulation models development by using general purpose
programming languages are presented; then a Supply Chain Order Performance
Simulator (SCOPS, developed in C++) for investigating the inventory management
problem along the supply chain under different supply chain scenarios is
proposed to readers.
","[{'version': 'v1', 'created': 'Mon, 19 Apr 2010 18:16:13 GMT'}]",2010-04-20,"[['Cimino', 'Antonio', ''], ['Longo', 'Francesco', ''], ['Mirabelli', 'Giovanni', '']]","['Discrete Event Simulation', 'Simulation languages', 'Supply Chain', 'Inventory Management']"
20442,1304.2467,M.M.A. Hashem,"S.M. Ashik Eftekhar, Sk. Mahbub Habib and M.M.A. Hashem",Evolutionary Design of Digital Circuits Using Genetic Programming,,"Procs. of the 3rd International Conference on Electrical,
  Electronics and Computer Engineering (ICEECE 2003), pp. 231-236, Dhaka,
  Bangladesh, December 22-24, (2003)",,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For simple digital circuits, conventional method of designing circuits can
easily be applied. But for complex digital circuits, the conventional method of
designing circuits is not fruitfully applicable because it is time-consuming.
On the contrary, Genetic Programming is used mostly for automatic program
generation. The modern approach for designing Arithmetic circuits, commonly
digital circuits, is based on Graphs. This graph-based evolutionary design of
arithmetic circuits is a method of optimized designing of arithmetic circuits.
In this paper, a new technique for evolutionary design of digital circuits is
proposed using Genetic Programming (GP) with Subtree Mutation in place of
Graph-based design. The results obtained using this technique demonstrates the
potential capability of genetic programming in digital circuit design with
limited computer algorithms. The proposed technique, helps to simplify and
speed up the process of designing digital circuits, discovers a variation in
the field of digital circuit design where optimized digital circuits can be
successfully and effectively designed.
","[{'version': 'v1', 'created': 'Tue, 9 Apr 2013 06:40:59 GMT'}]",2013-04-10,"[['Eftekhar', 'S. M. Ashik', ''], ['Habib', 'Sk. Mahbub', ''], ['Hashem', 'M. M. A.', '']]","['Evolutionary Algorithm', 'Digital circuits', 'Parse-Tree', 'Automatic        Programming', 'Electronic Design Automation', 'Tree Mutation']"
20443,1505.04785,Emanuel Diamant,Emanuel Diamant,"Advances in Bioinformatics and Computational Biology: Don't take them
  too seriously anyway","The paper was submitted to the BIOCOMP'15 conference (Las Vegas,
  Nevada, USA, July 27-30, 2015) and was accepted as a poster presentation.
  arXiv admin note: text overlap with arXiv:1505.04578",,,,cs.CE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the last few decades or so, we witness a paradigm shift in our nature
studies - from a data-processing based computational approach to an
information-processing based cognitive approach. The process is restricted and
often misguided by the lack of a clear understanding about what information is
and how it should be treated in research applications (in general) and in
biological studies (in particular). The paper intend to provide some remedies
for this bizarre situation.
","[{'version': 'v1', 'created': 'Mon, 18 May 2015 10:18:20 GMT'}]",2015-05-20,"[['Diamant', 'Emanuel', '']]","['Information', 'Physical information', 'Semantic information', 'Bioinformatics']"
20444,1505.04918,Jasine Babu,"Abhijin Adiga, Jasine Babu, L. Sunil Chandran",Sublinear Approximation Algorithms for Boxicity and Related Problems,arXiv admin note: substantial text overlap with arXiv:1201.5958,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Boxicity of a graph G(V, E) is the minimum integer k such that G can be
represented as the intersection graph of axis parallel boxes in $\mathbb{R}^k$.
Cubicity is a variant of boxicity, where the axis parallel boxes in the
intersection representation are restricted to be of unit length sides. Deciding
whether boxicity (resp. cubicity) of a graph is at most k is NP-hard, even for
k=2 or 3. Computing these parameters is inapproximable within $O(n^{1 -
\epsilon})$-factor, for any $\epsilon >0$ in polynomial time unless NP=ZPP,
even for many simple graph classes.
  In this paper, we give a polynomial time $\kappa(n)$ factor approximation
algorithm for computing boxicity and a $\kappa(n)\lceil \log \log n\rceil$
factor approximation algorithm for computing the cubicity, where $\kappa(n)
=2\left\lceil\frac{n\sqrt{\log \log n}}{\sqrt{\log n}}\right\rceil$. These o(n)
factor approximation algorithms also produce the corresponding box (resp. cube)
representations. As a special case, this resolves the question paused by
Spinrad about polynomial time construction of o(n) dimensional box
representations for boxicity 2 graphs. Other consequences of our approximation
algorithm include $O(\kappa(n))$ factor approximation algorithms for computing
the following parameters: the partial order dimension of finite posets, the
interval dimension of finite posets, minimum chain cover of bipartite graphs,
threshold dimension of split graphs and Ferrer's dimension of digraphs. Each of
these parameters is inapproximable within an $O(n^{1 - \epsilon})$-factor, for
any $\epsilon >0$ in polynomial time unless NP=ZPP and the algorithms we derive
seem to be the first o(n) factor approximation algorithms known for all these
problems.
","[{'version': 'v1', 'created': 'Tue, 19 May 2015 09:19:39 GMT'}, {'version': 'v2', 'created': 'Sun, 7 Jun 2015 12:33:02 GMT'}]",2015-06-09,"[['Adiga', 'Abhijin', ''], ['Babu', 'Jasine', ''], ['Chandran', 'L. Sunil', '']]","['Boxicity', 'Approximation algorithm', 'Partial order dimension', 'Threshold dimension']"
20445,1111.4545,Sugata Sanyal,"Sugata Sanyal, Rangarajan A. Vasudevan, Ajith Abraham, Marcin
  Paprzycki",Grid Security and Integration with Minimal Performance Degradation,"8 Pages, 1 Figure","Journal of Digital Information Management, Vol. 2, Issue 2,
  September, 2004",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computational grids are believed to be the ultimate framework to meet the
growing computational needs of the scientific community. Here, the processing
power of geographically distributed resources working under different
ownerships, having their own access policy, cost structure and the likes, is
logically coupled to make them perform as a unified resource. The continuous
increase of availability of high-bandwidth communication as well as powerful
computers built of low-cost components further enhance chances of computational
grids becoming a reality. However, the question of grid security remains one of
the important open research issues. Here, we present some novel ideas about how
to implement grid security, without appreciable performance degradation in
grids. A suitable alternative to the computationally expensive encryption is
suggested, which uses a key for message authentication. Methods of secure
transfer and exchange of the required key(s) are also discussed.
","[{'version': 'v1', 'created': 'Sat, 19 Nov 2011 09:40:04 GMT'}]",2011-11-22,"[['Sanyal', 'Sugata', ''], ['Vasudevan', 'Rangarajan A.', ''], ['Abraham', 'Ajith', ''], ['Paprzycki', 'Marcin', '']]","['Grid computing', 'Security', 'Temporal distribution', 'Spatial distribution']"
20446,1501.04002,Darren Engwirda,"Darren Engwirda, David Ivers",Size-optimal Steiner points for Delaunay-refinement on curved surfaces,"Submitted to Computer-Aided Design (23rd International Meshing
  Roundtable special issue). A short version appears in the proceedings of the
  23rd International Meshing Roundtable. (v2 - revisions to description of
  point-placement scheme, figures.) (v3 - updated to final pre-print version.)",,,,cs.CG cs.NA math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An extension of the restricted Delaunay-refinement algorithm for surface mesh
generation is described, where a new point-placement scheme is introduced to
improve element quality in the presence of mesh size constraints. Specifically,
it is shown that the use of off-centre Steiner points, positioned on the faces
of the associated Voronoi diagram, typically leads to significant improvements
in the shape- and size-quality of the resulting surface tessellations. The new
algorithm can be viewed as a Frontal-Delaunay approach -- a hybridisation of
conventional Delaunay-refinement and advancing-front techniques in which new
vertices are positioned to satisfy both element size and shape constraints. The
performance of the new scheme is investigated experimentally via a series of
comparative studies that contrast its performance with that of a typical
Delaunay-refinement technique. It is shown that the new method inherits many of
the best features of classical Delaunay-refinement and advancing-front type
methods, leading to the construction of smooth, high quality surface
triangulations with bounded radius-edge ratios and convergence guarantees.
Experiments are conducted using a range of complex benchmarks, verifying the
robustness and practical performance of the proposed scheme.
","[{'version': 'v1', 'created': 'Fri, 16 Jan 2015 14:55:49 GMT'}, {'version': 'v2', 'created': 'Mon, 26 Jan 2015 18:21:36 GMT'}, {'version': 'v3', 'created': 'Mon, 27 Jun 2016 14:28:02 GMT'}]",2016-06-28,"[['Engwirda', 'Darren', ''], ['Ivers', 'David', '']]","['Surface mesh generation', 'Delaunay-refinement', 'Advancing-front', 'Frontal-Delaunay', 'Off-centre Steinerpoints', 'Element quality']"
20447,1605.02783,Leandro Abraham Eng.,Leandro Abraham and Facundo Bromberg and Raymundo Forradellas,Estimacion de carga muscular mediante imagenes,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Un problema de gran interes en disciplinas como la ocupacional, ergonomica y
deportiva, es la medicion de variables biomecanicas involucradas en el
movimiento humano (como las fuerzas musculares internas y torque de
articulaciones). Actualmente este problema se resuelve en un proceso de dos
pasos. Primero capturando datos con dispositivos poco pr\'acticos, intrusivos y
costosos. Luego estos datos son usados como entrada en modelos complejos para
obtener las variables biomecanicas como salida. El presente trabajo representa
una alternativa automatizada, no intrusiva y economica al primer paso,
proponiendo la captura de estos datos a traves de imagenes. En trabajos futuros
la idea es automatizar todo el proceso de calculo de esas variables. En este
trabajo elegimos un caso particular de medicion de variables biomecanicas: el
problema de estimar el nivel discreto de carga muscular que estan ejerciendo
los musculos de un brazo. Para estimar a partir de imagenes estaticas del brazo
ejerciendo la fuerza de sostener la carga, el nivel de la misma, realizamos un
proceso de clasificacion. Nuestro enfoque utiliza Support Vector Machines para
clasificacion, combinada con una etapa de pre-procesamiento que extrae
caracter{\i}sticas visuales utilizando variadas tecnicas (Bag of Keypoints,
Local Binary Patterns, Histogramas de Color, Momentos de Contornos) En los
mejores casos (Local Binary Patterns y Momentos de Contornos) obtenemos medidas
de performance en la clasificacion (Precision, Recall, F-Measure y Accuracy)
superiores al 90 %.
","[{'version': 'v1', 'created': 'Mon, 9 May 2016 21:06:30 GMT'}, {'version': 'v2', 'created': 'Thu, 2 Jun 2016 14:13:28 GMT'}]",2016-06-03,"[['Abraham', 'Leandro', ''], ['Bromberg', 'Facundo', ''], ['Forradellas', 'Raymundo', '']]","['biomechanical variables', 'muscle arm load', 'support vector machine', 'localbinary patterns', 'bag of key points', 'contour moments', 'color histograms']"
20448,1402.3470,Thomas Bosch,"Thomas Bosch, Andias Wira-Alam and Brigitte Mathiak",Designing an Ontology for the Data Documentation Initiative,,,,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An ontology of the DDI 3 data model will be designed by following the
ontology engineering methodology to be evolved based on state-of-the-art
methodologies. Hence DDI 3 data and metadata can be represented in form of a
standard web interchange format RDF and processed by highly available RDF
tools. As a consequence the DDI community has the possibility to publish and
link LOD data sets to become part of the LOD cloud.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2014 14:12:17 GMT'}]",2014-02-17,"[['Bosch', 'Thomas', ''], ['Wira-Alam', 'Andias', ''], ['Mathiak', 'Brigitte', '']]","['Semantic Web', 'LOD', 'Ontology Design', 'Ontology Engineering Methodology', 'OWL', 'RDF', 'DDI']"
20449,1005.0952,Rdv Ijcsis,"S. Vijay Bhanu, RM.Chandrasekaran, V. Balakrishnan",Effective Bandwidth Utilization in IEEE802.11 for VOIP,"IEEE Publication format, International Journal of Computer Science
  and Information Security, IJCSIS, Vol. 8 No. 1, April 2010, USA. ISSN 1947
  5500, http://sites.google.com/site/ijcsis/",,,,cs.NI,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Voice over Internet protocol (VoIP) is one of the most important applications
for the IEEE 802.11 wireless local area networks (WLANs). For network planners
who are deploying VoIP over WLANs, one of the important issues is the VoIP
capacity. VoIP bandwidth consumption over a WAN is one of the most important
factors to consider when building a VoIP infrastructure. Failure to account for
VoIP bandwidth requirements will severely limit the reliability of a VoIP
system and place a huge burden on the WAN infrastructure. Less bandwidth
utilization is the key reasons for reduced number of channel accesses in VOIP.
But in the QoS point of view the free bandwidth of atleast 1-5% will improve
the voice quality. This proposal utilizes the maximum bandwidth by leaving 1-5%
free bandwidth. A Bandwidth Data rate Moderation (BDM) algorithm has been
proposed which correlates the data rate specified in IEEE802.11b with the free
bandwidth. At each time BDM will calculate the bandwidth utilization before
sending the packet to improve performance and voice quality of VoIP. The
bandwidth calculation in BDM can be done by using Erlang and VOIP bandwidth
calculator. Finally, ns2 experimental study shows the relationship between
bandwidth utilization, free bandwidth and data rate. The paper concludes that
marginal VoIP call rate has been increased by BDM algorithm.
","[{'version': 'v1', 'created': 'Thu, 6 May 2010 09:47:45 GMT'}]",2010-05-07,"[['Bhanu', 'S. Vijay', ''], ['Chandrasekaran', 'RM.', ''], ['Balakrishnan', 'V.', '']]","['WLAN', 'VOIP', 'MAC Layer', 'Call Capacity', 'Wireless']"
20450,1707.08725,Cristian Frasinaru,"Cristian Frasinaru, Madalina Raschip","An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting
  Network Problem",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper a new method for checking the subsumption relation for the
optimal-size sorting network problem is described. The new approach is based on
creating a bipartite graph and modelling the subsumption test as the problem of
enumerating all perfect matchings in this graph. Experiments showed significant
improvements over the previous approaches when considering the number of
subsumption checks and the time needed to find optimal-size sorting networks.
We were able to generate all the complete sets of filters for comparator
networks with 9 channels, confirming that the 25-comparators sorting network is
optimal. The running time was reduced more than 10 times, compared to the
state-of-the-art results.
","[{'version': 'v1', 'created': 'Thu, 27 Jul 2017 07:05:21 GMT'}]",2017-07-28,"[['Frasinaru', 'Cristian', ''], ['Raschip', 'Madalina', '']]","['Comparator networks', 'Optimal-size sorting networks', 'Subsumption']"
20451,1511.09230,Robin Adams,Robin Adams and Bart Jacobs,A Type Theory for Probabilistic and Bayesian Reasoning,38 pages,,,,cs.LO math.LO math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper introduces a novel type theory and logic for probabilistic
reasoning. Its logic is quantitative, with fuzzy predicates. It includes
normalisation and conditioning of states. This conditioning uses a key aspect
that distinguishes our probabilistic type theory from quantum type theory,
namely the bijective correspondence between predicates and side-effect free
actions (called instrument, or assert, maps). The paper shows how suitable
computation rules can be derived from this predicate-action correspondence, and
uses these rules for calculating conditional probabilities in two well-known
examples of Bayesian reasoning in (graphical) models. Our type theory may thus
form the basis for a mechanisation of Bayesian inference.
","[{'version': 'v1', 'created': 'Mon, 30 Nov 2015 10:28:55 GMT'}]",2015-12-01,"[['Adams', 'Robin', ''], ['Jacobs', 'Bart', '']]","['Probability theory', 'type theory', 'effect module', 'Bayesian reasoning']"
20452,1504.03719,Andr\'e van Delft,Andre van Delft,Some New Directions for ACP Research,"8 pages, 2 figures",,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper lists some new directions for research related to the Algebra of
Communicating Processes (ACP). Most of these directions have been inspired by
work on SubScript, an ACP based extension to the programming language Scala.
SubScript applies several new ideas that build on ACP, but currently these lack
formal treatment. Some of these new ideas are rather fundamental. E.g. it
appears that the theory of ACP may well apply to structures of any kind of
items, rather than to just processes. The aim of this list is to raise
awareness of the research community about these new ideas; this could help both
the research area and the programming language SubScript.
","[{'version': 'v1', 'created': 'Tue, 14 Apr 2015 20:50:47 GMT'}, {'version': 'v2', 'created': 'Mon, 20 Apr 2015 22:20:58 GMT'}, {'version': 'v3', 'created': 'Mon, 6 Jul 2015 22:10:13 GMT'}]",2015-07-08,"[['van Delft', 'Andre', '']]","['Algebra of Communicating Processes', 'ACP', 'data flow', 'concurrency', 'non-determinism']"
20453,1312.3184,Matthias Keil,"Matthias Keil, Peter Thiemann",Efficient Dynamic Access Analysis Using JavaScript Proxies,Technical Report,,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  JSConTest introduced the notions of effect monitoring and dynamic effect
inference for JavaScript. It enables the description of effects with path
specifications resembling regular expressions. It is implemented by an offline
source code transformation.
  To overcome the limitations of the JSConTest implementation, we redesigned
and reimplemented effect monitoring by taking advantange of JavaScript proxies.
Our new design avoids all drawbacks of the prior implementation. It guarantees
full interposition; it is not restricted to a subset of JavaScript; it is
self-maintaining; and its scalability to large programs is significantly better
than with JSConTest.
  The improved scalability has two sources. First, the reimplementation is
significantly faster than the original, transformation-based implementation.
Second, the reimplementation relies on the fly-weight pattern and on trace
reduction to conserve memory. Only the combination of these techniques enables
monitoring and inference for large programs.
","[{'version': 'v1', 'created': 'Wed, 11 Dec 2013 14:24:53 GMT'}]",2013-12-12,"[['Keil', 'Matthias', ''], ['Thiemann', 'Peter', '']]","['Access Permission Contracts', 'JavaScript', 'Proxies']"
20454,0903.0041,Vit Niennattrakul,Vit Niennattrakul and Chotirat Ann Ratanamahatana,Learning DTW Global Constraint for Time Series Classification,"The first runner up of Workshop and Challenge on Time Series
  Classification held in conjunction with SIGKDD 2007. 8 pages, 5 figures",,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  1-Nearest Neighbor with the Dynamic Time Warping (DTW) distance is one of the
most effective classifiers on time series domain. Since the global constraint
has been introduced in speech community, many global constraint models have
been proposed including Sakoe-Chiba (S-C) band, Itakura Parallelogram, and
Ratanamahatana-Keogh (R-K) band. The R-K band is a general global constraint
model that can represent any global constraints with arbitrary shape and size
effectively. However, we need a good learning algorithm to discover the most
suitable set of R-K bands, and the current R-K band learning algorithm still
suffers from an 'overfitting' phenomenon. In this paper, we propose two new
learning algorithms, i.e., band boundary extraction algorithm and iterative
learning algorithm. The band boundary extraction is calculated from the bound
of all possible warping paths in each class, and the iterative learning is
adjusted from the original R-K band learning. We also use a Silhouette index, a
well-known clustering validation technique, as a heuristic function, and the
lower bound function, LB_Keogh, to enhance the prediction speed. Twenty
datasets, from the Workshop and Challenge on Time Series Classification, held
in conjunction of the SIGKDD 2007, are used to evaluate our approach.
","[{'version': 'v1', 'created': 'Sat, 28 Feb 2009 05:46:31 GMT'}]",2009-03-03,"[['Niennattrakul', 'Vit', ''], ['Ratanamahatana', 'Chotirat Ann', '']]","['Time Series', 'Classification', 'Dynamic Time Warping']"
20455,1206.1557,Jay Gholap,"Jay Gholap, Anurag Ingole, Jayesh Gohil, Shailesh Gargade and Vahida
  Attar","Soil Data Analysis Using Classification Techniques and Soil Attribute
  Prediction","4 pages, published in International Journal of Computer Science
  Issues, Volume 9, Issue 3",,,,cs.AI stat.AP stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Agricultural research has been profited by technical advances such as
automation, data mining. Today, data mining is used in a vast areas and many
off-the-shelf data mining system products and domain specific data mining
application soft wares are available, but data mining in agricultural soil
datasets is a relatively a young research field. The large amounts of data that
are nowadays virtually harvested along with the crops have to be analyzed and
should be used to their full extent. This research aims at analysis of soil
dataset using data mining techniques. It focuses on classification of soil
using various algorithms available. Another important purpose is to predict
untested attributes using regression technique, and implementation of automated
soil sample classification.
","[{'version': 'v1', 'created': 'Thu, 7 Jun 2012 17:28:20 GMT'}]",2012-06-08,"[['Gholap', 'Jay', ''], ['Ingole', 'Anurag', ''], ['Gohil', 'Jayesh', ''], ['Gargade', 'Shailesh', ''], ['Attar', 'Vahida', '']]","['data mining', 'classification', 'regression', 'soil testing', 'agriculture']"
20456,0907.1256,Jonathan Voris,Nitesh Saxena and Jonathan Voris,"We Can Remember It for You Wholesale: Implications of Data Remanence on
  the Use of RAM for True Random Number Generation on RFID Tags (RFIDSec 2009)","Presented at the 5th Workshop on RFID Security held from June 30 -
  July 2 in Leuven, Belgium. Paper is 13 pages with 4 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Random number generation is a fundamental security primitive for RFID
devices. However, even this relatively simple requirement is beyond the
capacity of today's average RFID tag. A recently proposed solution, Fingerprint
Extraction and Random Number Generation in SRAM (FERNS) [14, 15], involves the
use of onboard RAM as the source of ""true"" randomness. Unfortunately, practical
considerations prevent this approach from reaching its full potential. First,
this method must compete with other system functionalities for use of memory.
Thus, the amount of uninitialized RAM available for utilization as a randomness
generator may be severely restricted. Second, RAM is subject to data remanence;
there is a time period after losing power during which stored data remains
intact in memory. This means that after a portion of memory has been used for
entropy collection once it will require a relatively extended period of time
without power before it can be reused. In a usable RFID based security
application, which requires multiple or long random numbers, this may lead to
unacceptably high delays.
  In this paper, we show that data remanence negatively affects RAM based
random number generation. We demonstrate the practical considerations that must
be taken into account when using RAM as an entropy source. We also discuss the
implementation of a true random number generator on Intel's WISP RFID tag,
which is the first such implementation to the authors' best knowledge. By
relating this to the requirements of some popular RFID authentication
protocols, we assess the (im)practicality of utilizing memory based randomness
techniques on resource constrained devices.
","[{'version': 'v1', 'created': 'Tue, 7 Jul 2009 16:51:40 GMT'}]",2009-07-08,"[['Saxena', 'Nitesh', ''], ['Voris', 'Jonathan', '']]","['RFID', 'True Random Number Generation', 'Power-up SRAM', 'Authentication Protocols']"
20457,1702.03083,GyongIl Ryang,"UnSun Pak, YongChol Sin, ChungJin Kwak, GyongIl Ryang",An Approach to Controller Design Based on the Generalized Cloud Model,"13 pages, 9 figures",,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, an approach to controller design based on the cloud models,
without using the analog plant model is presented.
","[{'version': 'v1', 'created': 'Fri, 10 Feb 2017 07:25:28 GMT'}]",2017-02-13,"[['Pak', 'UnSun', ''], ['Sin', 'YongChol', ''], ['Kwak', 'ChungJin', ''], ['Ryang', 'GyongIl', '']]","['Cloud', 'Controller Design', 'Stability Analysis']"
20458,1003.3880,Ali Khajeh-Hosseini,"David Greenwood, Ali Khajeh-Hosseini, Ian Sommerville","Lessons from the Failure and Subsequent Success of a Complex Healthcare
  Sector IT Project",,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper argues that IT failures diagnosed as errors at the technical or
project management level are often mistakenly pointing to symptoms of failure
rather than a project's underlying socio-complexity (complexity resulting from
the interactions of people and groups) which is usually the actual source of
failure. We propose a novel method, Stakeholder Impact Analysis, that can be
used to identify risks associated with socio-complexity as it is grounded in
insights from the social sciences, psychology and management science. This
paper demonstrates the effectiveness of Stakeholder Impact Analysis by using
the 1992 London Ambulance Service Computer Aided Dispatch project as a case
study, and shows that had our method been used to identify the risks and had
they been mitigated, it would have reduced the risk of project failure. This
paper's original contribution comprises expanding upon existing accounts of
failure by examining failures at a level of granularity not seen elsewhere that
enables the underlying socio-complexity sources of risk to be identified.
","[{'version': 'v1', 'created': 'Fri, 19 Mar 2010 20:09:53 GMT'}, {'version': 'v2', 'created': 'Fri, 14 May 2010 14:39:17 GMT'}]",2010-05-17,"[['Greenwood', 'David', ''], ['Khajeh-Hosseini', 'Ali', ''], ['Sommerville', 'Ian', '']]","['IT Failure', 'Socio-Technical Systems Engineering', 'Stakeholder Impact Analysis', 'Organisational Analysis', 'Socio-complexity']"
20459,1401.3659,Hadi Ahmadi,Hadi Ahmadi and Reihaneh Safavi-Naini,Multipath Private Communication: An Information Theoretic Approach,,,,,cs.CR cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Sending private messages over communication environments under surveillance
is an important challenge in communication security and has attracted
attentions of cryptographers through time. We believe that resources other than
cryptographic keys can be used for communication privacy. We consider private
message transmission (PMT) in an abstract multipath communication model between
two communicants, Alice and Bob, in the presence of an eavesdropper, Eve. Alice
and Bob have pre-shared keys and Eve is computationally unbounded. There are a
total of $n$ paths and the three parties can have simultaneous access to at
most $t_a$, $t_b$, and $t_e$ paths. The parties can switch their paths after
every $\lambda$ bits of communication. We study perfect (P)-PMT versus
asymptotically-perfect (AP)-PMT protocols. The former has zero tolerance of
transmission error and leakage, whereas the latter allows for positive error
and leakage that tend to zero as the message length increases. We derive the
necessary and sufficient conditions under which P-PMT and AP-PMT are possible.
We also introduce explicit P-PMT and AP-PMT constructions. Our results show
AP-PMT protocols attain much higher information rates than P-PMT ones.
Interestingly, AP-PMT is possible even in poorest condition where $t_a=t_b=1$
and $t_e=n-1$. It remains however an open question whether the derived rates
can be improved by more sophisticated AP-PMT protocols.
  We study applications of our results to private communication over the
real-life scenarios of multiple-frequency links and multiple-route networks. We
show practical examples of such scenarios that can be abstracted by the
multipath setting: Our results prove the possibility of keyless
information-theoretic private message transmission at rates $17\%$ and $20\%$
for the two example scenarios, respectively. We discuss open problems and
future work at the end.
","[{'version': 'v1', 'created': 'Wed, 15 Jan 2014 16:48:08 GMT'}]",2014-01-16,"[['Ahmadi', 'Hadi', ''], ['Safavi-Naini', 'Reihaneh', '']]","['Secure message transmission', 'information-theoretic security', 'multipath routing', 'frequency hopping']"
20460,1307.1408,Uwe Aickelin,"Naisan Benatar, Uwe Aickelin, Jonathan M. Garibaldi","An investigation into the relationship between type-2 FOU size and
  environmental uncertainty in robotic control","2012 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), pp
  1-8, 2012",,,,cs.RO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It has been suggested that, when faced with large amounts of uncertainty in
situations of automated control, type-2 fuzzy logic based controllers will
out-perform the simpler type-1 varieties due to the latter lacking the
flexibility to adapt accordingly. This paper aims to investigate this problem
in detail in order to analyse when a type-2 controller will improve upon type-1
performance. A robotic sailing boat is subjected to several experiments in
which the uncertainty and difficulty of the sailing problem is increased in
order to observe the effects on measured performance. Improved performance is
observed but not in every case. The size of the FOU is shown to be have a large
effect on performance with potentially severe performance penalties for
incorrectly sized footprints.
","[{'version': 'v1', 'created': 'Thu, 4 Jul 2013 16:57:37 GMT'}, {'version': 'v2', 'created': 'Mon, 8 Jul 2013 13:44:11 GMT'}]",2013-07-09,"[['Benatar', 'Naisan', ''], ['Aickelin', 'Uwe', ''], ['Garibaldi', 'Jonathan M.', '']]","['Interval Type-2 Fuzzy', 'Robot Boat control', 'FuzzyControl', 'Uncertainty']"
20461,1712.04138,Shuang Liu,"Shuang Liu, Mete Ozay, Takayuki Okatani, Hongli Xu, Kai Sun and Yang
  Lin",A vision based system for underwater docking,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Autonomous underwater vehicles (AUVs) have been deployed for underwater
exploration. However, its potential is confined by its limited on-board battery
energy and data storage capacity. This problem has been addressed using docking
systems by underwater recharging and data transfer for AUVs. In this work, we
propose a vision based framework for underwater docking following these
systems. The proposed framework comprises two modules; (i) a detection module
which provides location information on underwater docking stations in 2D images
captured by an on-board camera, and (ii) a pose estimation module which
recovers the relative 3D position and orientation between docking stations and
AUVs from the 2D images. For robust and credible detection of docking stations,
we propose a convolutional neural network called Docking Neural Network (DoNN).
For accurate pose estimation, a perspective-n-point algorithm is integrated
into our framework. In order to examine our framework in underwater docking
tasks, we collected a dataset of 2D images, named Underwater Docking Images
Dataset (UDID), in an experimental water pool. To the best of our knowledge,
UDID is the first publicly available underwater docking dataset. In the
experiments, we first evaluate performance of the proposed detection module on
UDID and its deformed variations. Next, we assess the accuracy of the pose
estimation module by ground experiments, since it is not feasible to obtain
true relative position and orientation between docking stations and AUVs under
water. Then, we examine the pose estimation module by underwater experiments in
our experimental water pool. Experimental results show that the proposed
framework can be used to detect docking stations and estimate their relative
pose efficiently and successfully, compared to the state-of-the-art baseline
systems.
","[{'version': 'v1', 'created': 'Tue, 12 Dec 2017 05:59:49 GMT'}]",2017-12-13,"[['Liu', 'Shuang', ''], ['Ozay', 'Mete', ''], ['Okatani', 'Takayuki', ''], ['Xu', 'Hongli', ''], ['Sun', 'Kai', ''], ['Lin', 'Yang', '']]","['Underwater docking', 'AUVs', 'detection', 'pose estimation', 'marine robotics', 'learning and adaptive systems', 'recognition']"
20462,1312.7076,Jinyun Yan,"Stratis Ioannidis, S. Muthukrishnan, Jinyun Yan",A Consensus-Focused Group Recommender System,,,,,cs.HC cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In many cases, recommendations are consumed by groups of users rather than
individuals. In this paper, we present a system which recommends social events
to groups. The system helps groups to organize a joint activity and
collectively select which activity to perform among several possible options.
We also facilitate the consensus making, following the principle of group
consensus decision making. Our system allows users to asynchronously vote, add
and comment on alternatives. We observe social influence within groups through
post-recommendation feedback during the group decision making process. We
propose a decision cascading model and estimate such social influence, which
can be used to improve the performance of group recommendation. We conduct
experiments to measure the prediction performance of our model. The result
shows that the model achieves better results than that of independent decision
making model.
","[{'version': 'v1', 'created': 'Thu, 26 Dec 2013 09:35:50 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Mar 2014 19:42:54 GMT'}]",2014-03-26,"[['Ioannidis', 'Stratis', ''], ['Muthukrishnan', 'S.', ''], ['Yan', 'Jinyun', '']]","['Group Recommendation', 'Group Consensus Decision Making', 'Social Influence']"
20463,1002.1150,Vishal Goyal,"Mahdi Esmaeili, Fazekas Gabor",Finding Sequential Patterns from Large Sequence Data,"International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 1, January 2010,
  http://ijcsi.org/articles/Finding-Sequential-Patterns-from-Large-Sequence-Data.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 1, January 2010,
  http://ijcsi.org/articles/Finding-Sequential-Patterns-from-Large-Sequence-Data.php",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Data mining is the task of discovering interesting patterns from large
amounts of data. There are many data mining tasks, such as classification,
clustering, association rule mining, and sequential pattern mining. Sequential
pattern mining finds sets of data items that occur together frequently in some
sequences. Sequential pattern mining, which extracts frequent subsequences from
a sequence database, has attracted a great deal of interest during the recent
data mining research because it is the basis of many applications, such as: web
user analysis, stock trend prediction, DNA sequence analysis, finding language
or linguistic patterns from natural language texts, and using the history of
symptoms to predict certain kind of disease. The diversity of the applications
may not be possible to apply a single sequential pattern model to all these
problems. Each application may require a unique model and solution. A number of
research projects were established in recent years to develop meaningful
sequential pattern models and efficient algorithms for mining these patterns.
In this paper, we theoretically provided a brief overview three types of
sequential patterns model.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 08:43:45 GMT'}]",2010-02-08,"[['Esmaeili', 'Mahdi', ''], ['Gabor', 'Fazekas', '']]","['Sequential Pattern Mining', 'Periodic Pattern', 'Approximate Pattern', 'Data Mining']"
20464,1306.6413,Meenakshi S P,S. P. Meenakshi and S. V. Raghavan,"Forecasting and Event Detection in Internet Resource Dynamics using Time
  Series Models","22 pages, 15 figures",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  At present Internet has emerged as a country's predominant and viable data
communication infrastructure. The Autonomous System (AS) resources which are
building blocks of the Internet are AS numbers, IPv4 and IPv6 Prefixes. AS
number growth is one of Internet infrastructure development indicators. Hence
understanding on long term trend and stochastic variation behaviour are
essential to detect significant events during the growth. In this work, time
series based approximation is considered for mathematical modelling and
forecast the yearly AS growth. The AS data of five countries namely India,
China, Japan, South Korea and Taiwan are extracted from APNIC archive. ARIMA
models with different Auto Regressive and Moving Average parameters are
identified for forecasting. Model validation, parameter estimation, point
forecast and prediction intervals with 95 % confidence levels for the five
countries are reported in the paper. The significant level change in
variations, positive growth percentage in Inter Annual Absolute Variations
(IAAV) and higher percentage of advertised ASes when compared to other
countries indicate India's fast growth and wider global reachability of
Internet infrastructure from 2007 onwards. The correlation between IAAV change
point and GDP growth period indicates that service sector industry growth is
the driving force behind significant yearly changes.
","[{'version': 'v1', 'created': 'Thu, 27 Jun 2013 06:21:21 GMT'}]",2013-06-28,"[['Meenakshi', 'S. P.', ''], ['Raghavan', 'S. V.', '']]","['AS Topology', 'Statistical Analysis', 'AS Growth Forecasting', 'Long Term Trend', 'Inter AnnualAbsolute Variation']"
20465,1307.5534,Masoumeh Vali,Masoumeh Vali,"A New Optimization Approach Based on Rotational Mutation and Crossover
  Operator",,,,,cs.NE math.OC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Evaluating a global optimal point in many global optimization problems in
large space is required to more calculations. In this paper, there is presented
a new approach for the continuous functions optimization with rotational
mutation and crossover operator. This proposed method (RMC) starts from the
point which has best fitness value by elitism mechanism and after that
rotational mutation and crossover operator are used to reach optimal point. RMC
method is implemented by GA (Briefly RMCGA) and is compared with other
wellknown algorithms such as: DE, PGA, Grefensstette and Eshelman[15,16] and
numerical and simulating results show that RMCGA achieve global optimal point
with more decision by smaller generations.
","[{'version': 'v1', 'created': 'Sun, 21 Jul 2013 15:34:24 GMT'}]",2013-07-23,"[['Vali', 'Masoumeh', '']]","['genetic algorithm (GA)', 'rotational mutation', 'crossover operator', 'optimal point']"
20466,1010.5290,Andri Mirzal,Andri Mirzal,Converged Algorithms for Orthogonal Nonnegative Matrix Factorizations,"55 pages, 11 figures",,,,cs.LG cs.NA,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper proposes uni-orthogonal and bi-orthogonal nonnegative matrix
factorization algorithms with robust convergence proofs. We design the
algorithms based on the work of Lee and Seung [1], and derive the converged
versions by utilizing ideas from the work of Lin [2]. The experimental results
confirm the theoretical guarantees of the convergences.
","[{'version': 'v1', 'created': 'Tue, 26 Oct 2010 00:28:36 GMT'}, {'version': 'v2', 'created': 'Wed, 16 Mar 2011 05:53:38 GMT'}]",2011-03-17,"[['Mirzal', 'Andri', '']]","['orthogonal nonnegative matrix factorizations', 'converged algorithms', 'clustering methods']"
20467,1005.0198,Olivier Teste,"Houssem Jerbi (IRIT), Genevi\`eve Pujolle (IRIT), Franck Ravat (IRIT),
  Olivier Teste (IRIT)",Personnalisation de Syst\`emes OLAP Annot\'es,,"XXVIII\`eme Congr\`es Informatique des Organisations et Syst\`emes
  d'Information et de D\'ecision - INFORSID'10, Marseille : France (2010)",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper deals with personalization of annotated OLAP systems. Data
constellation is extended to support annotations and user preferences.
Annotations reflect the decision-maker experience whereas user preferences
enable users to focus on the most interesting data. User preferences allow
annotated contextual recommendations helping the decision-maker during his/her
multidimensional navigations.
","[{'version': 'v1', 'created': 'Mon, 3 May 2010 06:36:10 GMT'}]",2010-05-20,"[['Jerbi', 'Houssem', '', 'IRIT'], ['Pujolle', 'Geneviève', '', 'IRIT'], ['Ravat', 'Franck', '', 'IRIT'], ['Teste', 'Olivier', '', 'IRIT']]","['Decision-support system', 'Multidimensional databases', 'Personalization']"
20468,1203.1295,David Stoutemyer,David R. Stoutemyer,"Subtotal ordering -- a pedagogically advantageous algorithm for
  computing total degree reverse lexicographic order","12 pages, 2 Algorithms, 1 Table",,,,cs.SC cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Total degree reverse lexicographic order is currently generally regarded as
most often fastest for computing Groebner bases. This article describes an
alternate less mysterious algorithm for computing this order using exponent
subtotals and describes why it should be very nearly the same speed the
traditional algorithm, all other things being equal. However, experimental
evidence suggests that subtotal order is actually slightly faster for the
Mathematica Groebner basis implementation more often than not. This is probably
because the weight vectors associated with the natural subtotal weight matrix
and with the usual total degree reverse lexicographic weight matrix are
different, and Mathematica also uses those the corresponding weight vectors to
help select successive S polynomials and divisor polynomials: Those selection
heuristics appear to work slightly better more often with subtotal weight
vectors.
  However, the most important advantage of exponent subtotals is pedagogical.
It is easier to understand than the total degree reverse lexicographic
algorithm, and it is more evident why the resulting order is often the fastest
known order for computing Groebner bases.
  Keywords: Term order, Total degree reverse lexicographic, tdeg, grevlex,
Groebner basis
","[{'version': 'v1', 'created': 'Tue, 6 Mar 2012 19:51:48 GMT'}]",2012-03-07,"[['Stoutemyer', 'David R.', '']]","['Term order', 'Total degree reverse lexicographic', 'tdeg', 'grevlex', 'Gröbner basis']"
20469,1312.6935,Branko Malesevic,"Branko Malesevic, Ratko Obradovic, Bojan Banjac, Ivana Jovovic, Milica
  Makragic","Application of polynomial texture mapping in process of digitalization
  of cultural heritage",,,,,cs.GR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present modern texture mapping techniques and several
applications of polynomial texture mapping in cultural heritage programs. We
also consider some well-known and some new methods for mathematical procedure
that is involved in generation of polynomial texture maps.
","[{'version': 'v1', 'created': 'Wed, 25 Dec 2013 06:56:35 GMT'}]",2013-12-30,"[['Malesevic', 'Branko', ''], ['Obradovic', 'Ratko', ''], ['Banjac', 'Bojan', ''], ['Jovovic', 'Ivana', ''], ['Makragic', 'Milica', '']]","['polynomial\xa0texture\xa0mapping', 'texture\xa0mapping', 'computer\xa0generated\xa0image', 'cultural\xa0heritage\xa0digitalization', 'three\xa0dimensional\xa0digitalization\xa0\xa01']"
20470,1605.02720,Ilya Loshchilov,Ilya Loshchilov and Tobias Glasmachers,"Anytime Bi-Objective Optimization with a Hybrid Multi-Objective CMA-ES
  (HMO-CMA-ES)",BBOB workshop of GECCO'2016,,,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a multi-objective optimization algorithm aimed at achieving good
anytime performance over a wide range of problems. Performance is assessed in
terms of the hypervolume metric. The algorithm called HMO-CMA-ES represents a
hybrid of several old and new variants of CMA-ES, complemented by BOBYQA as a
warm start. We benchmark HMO-CMA-ES on the recently introduced bi-objective
problem suite of the COCO framework (COmparing Continuous Optimizers),
consisting of 55 scalable continuous optimization problems, which is used by
the Black-Box Optimization Benchmarking (BBOB) Workshop 2016.
","[{'version': 'v1', 'created': 'Mon, 9 May 2016 19:58:29 GMT'}]",2016-05-10,"[['Loshchilov', 'Ilya', ''], ['Glasmachers', 'Tobias', '']]","['Benchmarking', 'Black-box optimization', 'Bi-objective optimization']"
20471,0801.1419,Vincent Gramoli,"Vincent Gramoli (IRISA), Anne-Marie Kermarrec (IRISA), Achour
  Mostefaoui (IRISA), Michel Raynal (IRISA), Bruno Sericola (IRISA)",Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime,,"Dans Proceedings of the Workshop on Reliability in Decentralized
  Distributed Systems 4278 (2006) 1470--1479",,,cs.DC,,"  Distributed systems are now both very large and highly dynamic. Peer to peer
overlay networks have been proved efficient to cope with this new deal that
traditional approaches can no longer accommodate. While the challenge of
organizing peers in an overlay network has generated a lot of interest leading
to a large number of solutions, maintaining critical data in such a network
remains an open issue. In this paper, we are interested in defining the portion
of nodes and frequency one has to probe, given the churn observed in the
system, in order to achieve a given probability of maintaining the persistence
of some critical data. More specifically, we provide a clear result relating
the size and the frequency of the probing set along with its proof as well as
an analysis of the way of leveraging such an information in a large scale
dynamic distributed system.
","[{'version': 'v1', 'created': 'Wed, 9 Jan 2008 12:41:15 GMT'}]",2008-01-10,"[['Gramoli', 'Vincent', '', 'IRISA'], ['Kermarrec', 'Anne-Marie', '', 'IRISA'], ['Mostefaoui', 'Achour', '', 'IRISA'], ['Raynal', 'Michel', '', 'IRISA'], ['Sericola', 'Bruno', '', 'IRISA']]","['Churn', 'Core', 'Dynamic system', 'Peer to peer system', 'Persistence', 'Probabilistic guarantee', 'Quality of service', 'Survivability']"
20472,1407.6067,Marcelo S. Reis,"Marcelo S. Reis, Carlos E. Ferreira, and Junior Barrera","The U-curve optimization problem: improvements on the original algorithm
  and time complexity analysis","Original results from the Ph.D. thesis of Marcelo S. Reis. This
  thesis can be accessed through the following link:
  http://www.teses.usp.br/teses/disponiveis/45/45134/tde-05022013-123757/en.php",,,,cs.LG cs.CV,http://creativecommons.org/licenses/by/3.0/,"  The U-curve optimization problem is characterized by a decomposable in
U-shaped curves cost function over the chains of a Boolean lattice. This
problem can be applied to model the classical feature selection problem in
Machine Learning. Recently, the U-Curve algorithm was proposed to give optimal
solutions to the U-curve problem. In this article, we point out that the
U-Curve algorithm is in fact suboptimal, and introduce the U-Curve-Search (UCS)
algorithm, which is actually optimal. We also present the results of optimal
and suboptimal experiments, in which UCS is compared with the UBB optimal
branch-and-bound algorithm and the SFFS heuristic, respectively. We show that,
in both experiments, $\proc{UCS}$ had a better performance than its competitor.
Finally, we analyze the obtained results and point out improvements on UCS that
might enhance the performance of this algorithm.
","[{'version': 'v1', 'created': 'Tue, 22 Jul 2014 23:18:08 GMT'}]",2014-07-24,"[['Reis', 'Marcelo S.', ''], ['Ferreira', 'Carlos E.', ''], ['Barrera', 'Junior', '']]","['combinatorial optimization', 'branch and bound', 'feature selection', 'U-curveproblem', 'machine learning', 'Boolean lattice']"
20473,1108.2038,Christian Klein,"J. Frauendiener, C. Klein, V. Shramchenko",Efficient computation of the branching structure of an algebraic curve,"18 pages, 7 figures",,,,cs.CG math.AG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An efficient algorithm for computing the branching structure of a compact
Riemann surface defined via an algebraic curve is presented. Generators of the
fundamental group of the base of the ramified covering punctured at the
discriminant points of the curve are constructed via a minimal spanning tree of
the discriminant points. This leads to paths of minimal length between the
points, which is important for a later stage where these paths are used as
integration contours to compute periods of the surface. The branching structure
of the surface is obtained by analytically continuing the roots of the equation
defining the algebraic curve along the constructed generators of the
fundamental group.
","[{'version': 'v1', 'created': 'Tue, 9 Aug 2011 20:04:44 GMT'}]",2011-08-11,"[['Frauendiener', 'J.', ''], ['Klein', 'C.', ''], ['Shramchenko', 'V.', '']]","['Riemann surfaces', 'algebraic curves', 'monodromies', 'fundamentalgroup']"
20474,1206.6213,Valentin Puente,"Javier Merino, Valentin Puente, Jos\'e \'Angel Gregorio","The Necessity for Hardware QoS Support for Server Consolidation and
  Cloud Computing",,,,,cs.AR cs.OS,http://creativecommons.org/licenses/by/3.0/,"  Chip multiprocessors (CMPs) are ubiquitous in most of today's computing
fields. Although they provide noticeable benefits in terms of performance, cost
and power efficiency, they also introduce some new issues. In this paper we
analyze how the interference from Virtual Private Servers running in other
cores is a significant component of performance unpredictability and can
threaten the attainment of cloud computing. Even if virtualization is used, the
sharing of the on-chip section of the memory hierarchy by different cores makes
performance isolation strongly dependent on what is running elsewhere in the
system. We will show in three actual computing systems, based on Sun UltraSparc
T1, Sun UltraSparc T2 and Intel Xeon processors, how state-of-the-art
virtualization techniques are unable to guarantee performance isolation in a
representative workload such as SPECweb2005. In an especially conceived near
worst-case scenario, it is possible to reduce the performance achieved by a
Solaris Zones consolidated server for this suite of benchmarks in a Sun Fire
T1000 and a Sun Enterprise T5120 by up to 80%. The performance drop observed by
a Xen consolidated server running in a HP Proliant DL160 G5 is almost 45%. For
all systems under study, off-chip bandwidth is shown to be the most critical
resource.
","[{'version': 'v1', 'created': 'Wed, 27 Jun 2012 09:33:06 GMT'}]",2012-06-28,"[['Merino', 'Javier', ''], ['Puente', 'Valentin', ''], ['Gregorio', 'José Ángel', '']]","['Server Consolidation', 'CQoS', 'performance isolation', 'CMP', 'off-chip bandwidth']"
20475,1108.6302,Muhammad Yasir Malik,Muhammad Yasir Malik and Jong-Seon No,Dynamic MDS Matrices for Substantial Cryptographic Strength,"Short paper at WISA'10, 2010",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ciphers get their strength from the mathematical functions of confusion and
diffusion, also known as substitution and permutation. These were the basics of
classical cryptography and they are still the basic part of modern ciphers. In
block ciphers diffusion is achieved by the use of Maximum Distance Separable
(MDS) matrices. In this paper we present some methods for constructing dynamic
(and random) MDS matrices.
","[{'version': 'v1', 'created': 'Wed, 31 Aug 2011 17:54:26 GMT'}]",2011-09-01,"[['Malik', 'Muhammad Yasir', ''], ['No', 'Jong-Seon', '']]","['Maximum distance separable (MDS) matrix', 'cipher', 'diffusion', 'optimal matrix', 'substitution-permutation network (SPN)']"
20476,1511.05364,Bernhard Rumpe,"Jan O. Ringert, Bernhard Rumpe, Andreas Wortmann","Tailoring the MontiArcAutomaton Component & Connector ADL for Generative
  Development",,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Component&connector (C&C) architecture description languages (ADLs) combine
component-based software engineering and model-driven engineering to increase
reuse and to abstract from implementation details. Applied to robotics
application development, current C&C ADLs often require domain experts to
provide component behavior descriptions as programming language artifacts or as
models of a-priori mixed behavior modeling languages. They are limited to
specific target platforms or require extensive handcrafting to transform
platform-independent software architecture models into platform-specific
implementations. We have developed the MontiArcAutomaton framework that
combines structural extension of C&C concepts with integration of
application-specific component behavior modeling languages, seamless
transformation from logical into platform-specific software architectures, and
a-posteriori black-box composition of code generators for different robotics
platforms. This paper describes the roles and activities for tailoring
MontiArcAutomaton to application-specific demands.
","[{'version': 'v1', 'created': 'Tue, 17 Nov 2015 12:01:49 GMT'}]",2015-11-18,"[['Ringert', 'Jan O.', ''], ['Rumpe', 'Bernhard', ''], ['Wortmann', 'Andreas', '']]","['Model-Driven Engineering', 'Architecture Description Languages', 'Component & Connector Models']"
20477,1408.0452,T.R. Gopalakrishnan Nair,"T.R. Gopalakrishnan Nair, A.P. Geetha, Asharani",Methodology For Detection of QRS Pattern Using Secondary Wavelets,"3 pages, 8 figures,Systemics, Cybernetics and Informatics
  (ICSCI)2012, International Conference on pp.327,330, Dr.MCR HRD Institute,
  Hyderabad, India, 15-18Feb 2012",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Applications of wavelet transform to the field of health care signals have
paved the way for implementing revolutionary approaches in detecting the
presence of certain abnormalities in human health patterns. There were
extensive studies carried out using primary wavelets in various signals like
Electrocardiogram (ECG), sonogram etc. with a certain amount of success. On the
other hand analysis using secondary wavelets which inherits the characteristics
of a set of variations available in signals like ECG can be a promise to detect
diseases with ease. Here a method to create a generalized adapted wavelet is
presented which contains the information of QRS pattern collected from an
anomaly sample space. The method has been tested and found to be successful in
locating the position of R peak in noise embedded ECG signal.
","[{'version': 'v1', 'created': 'Sun, 3 Aug 2014 03:43:28 GMT'}]",2014-08-05,"[['Nair', 'T. R. Gopalakrishnan', ''], ['Geetha', 'A. P.', ''], ['Asharani', '', '']]","['ECG', 'CWT', 'pattern adapted wavelet']"
20478,1704.03319,Balaji Arun,"Balaji Arun, Sebastiano Peluso, Roberto Palmieri, Giuliano Losa, Binoy
  Ravindran",Speeding up Consensus by Chasing Fast Decisions,"Extended Technical Report of the paper published in the 47th
  IEEE/IFIP International Conference on Dependable Systems and Networks",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes Caesar, a novel multi-leader Generalized Consensus
protocol for geographically replicated sites. The main goal of Caesar is to
overcome one of the major limitations of existing approaches, which is the
significant performance degradation when application workload produces
conflicting requests. Caesar does that by changing the way a fast decision is
taken: its ordering protocol does not reject a fast decision for a client
request if a quorum of nodes reply with different dependency sets for that
request. The effectiveness of Caesar is demonstrated through an evaluation
study performed on Amazon's EC2 infrastructure using 5 geo-replicated sites.
Caesar outperforms other multi-leader (e.g., EPaxos) competitors by as much as
1.7x in the presence of 30% conflicting requests, and single-leader (e.g.,
Multi-Paxos) by up to 3.5x.
","[{'version': 'v1', 'created': 'Tue, 11 Apr 2017 14:40:47 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Dec 2019 00:13:39 GMT'}]",2019-12-24,"[['Arun', 'Balaji', ''], ['Peluso', 'Sebastiano', ''], ['Palmieri', 'Roberto', ''], ['Losa', 'Giuliano', ''], ['Ravindran', 'Binoy', '']]","['Consensus', 'Geo-Replication', 'Paxos']"
20479,1603.02695,Charlie Marshak,"Mihai Cucuringu, Charlie Marshak, Dillon Montag, and Puck Rombach",Rank Aggregation for Course Sequence Discovery,,,,,cs.LG,http://creativecommons.org/licenses/by-sa/4.0/,"  In this work, we adapt the rank aggregation framework for the discovery of
optimal course sequences at the university level. Each student provides a
partial ranking of the courses taken throughout his or her undergraduate
career. We compute pairwise rank comparisons between courses based on the order
students typically take them, aggregate the results over the entire student
population, and then obtain a proxy for the rank offset between pairs of
courses. We extract a global ranking of the courses via several state-of-the
art algorithms for ranking with pairwise noisy information, including
SerialRank, Rank Centrality, and the recent SyncRank based on the group
synchronization problem. We test this application of rank aggregation on 15
years of student data from the Department of Mathematics at the University of
California, Los Angeles (UCLA). Furthermore, we experiment with the above
approach on different subsets of the student population conditioned on final
GPA, and highlight several differences in the obtained rankings that uncover
hidden pre-requisites in the Mathematics curriculum.
","[{'version': 'v1', 'created': 'Thu, 3 Mar 2016 17:29:03 GMT'}]",2016-03-10,"[['Cucuringu', 'Mihai', ''], ['Marshak', 'Charlie', ''], ['Montag', 'Dillon', ''], ['Rombach', 'Puck', '']]","['Temporal rank aggregation', 'spectral methods', 'educationaldata', 'ranking algorithms']"
20480,1407.3660,Arun Kumar Reddy,"Charan Kumar, Dinesh Kumar, Arun Kumar Reddy","Concrete Attribute-Based Encryption Scheme with Verifiable Outsourced
  Decryption",,,,,cs.CR,http://creativecommons.org/licenses/by/3.0/,"  As more sensitive data is shared and stored by third-party sites on the
internet, there will be a need to encrypt data stored at these sites. One
drawback of encrypting data is that it can be selectively shared only at a
coarse-grained level. Attribute based encryption is a public-key-based
one-to-many encryption that allows users to encrypt and decry pt data based on
user attributes. A promising application of ABE is flexible access control of
encrypted data stored in the cloud using access policies and ascribed
attributes associated with private keys and cipher text. One.One of the main
efficiency drawbacks of the existing ABE schemes is that decryption involves
expensive pairing operations and the number of such operations grows with the
complexity of the access policy. Finally, we show an implementation scheme and
result of performance measurements, which indicates a significant reduction on
computing resources imposed on users.
","[{'version': 'v1', 'created': 'Fri, 4 Jul 2014 08:40:53 GMT'}]",2014-07-15,"[['Kumar', 'Charan', ''], ['Kumar', 'Dinesh', ''], ['Reddy', 'Arun Kumar', '']]","['Attribute-based encryption', 'outsourced decryption', 'verifiability']"
20481,1511.05262,Ivens Portugal,"Ivens Portugal, Paulo Alencar, Donald Cowan",Requirements Engineering for General Recommender Systems,,,,,cs.SE cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In requirements engineering for recommender systems, software engineers must
identify the data that drives the recommendations. This is a labor-intensive
task, which is error-prone and expensive. One possible solution to this problem
is the adoption of automatic recommender system development approach based on a
general recommender framework. One step towards the creation of such a
framework is to determine the type of data used in recommender systems. In this
paper, a systematic review has been conducted to identify the type of user and
recommendation data items needed by a general recommender system. A user and
item model is proposed, and some considerations about algorithm specific
parameters are explained. A further goal is to study the impact of the fields
of big data and Internet of things on the development of recommender systems.
","[{'version': 'v1', 'created': 'Tue, 17 Nov 2015 03:09:59 GMT'}, {'version': 'v2', 'created': 'Fri, 4 Dec 2015 14:38:15 GMT'}, {'version': 'v3', 'created': 'Mon, 18 Jan 2016 15:36:29 GMT'}, {'version': 'v4', 'created': 'Wed, 24 Feb 2016 18:58:31 GMT'}]",2016-02-25,"[['Portugal', 'Ivens', ''], ['Alencar', 'Paulo', ''], ['Cowan', 'Donald', '']]","['requirements engineering', 'recommender system', 'systematic review']"
20482,1712.02371,M\'arcia Cappelle,"M\'arcia R. Cappelle, Les Foulds and Humberto J. Longo",A note on searching sorted unbalanced three-dimensional arrays,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We examine the problem of searching sequentially for a desired real value (a
key) within a sorted unbalanced three-dimensional finite real array. This
classic problem can be viewed as determining the correct dimensional threshold
function from a finite class of such functions within the array, based on
sequential queries that take the form of point samples. This note addresses the
challenge of constructing algorithms that require the minimum number of queries
necessary in the worst case, to search for a given key in arrays that have
three dimensions with sizes that are not necessarily equal.
","[{'version': 'v1', 'created': 'Wed, 6 Dec 2017 19:03:12 GMT'}]",2017-12-08,"[['Cappelle', 'Márcia R.', ''], ['Foulds', 'Les', ''], ['Longo', 'Humberto J.', '']]","['Sequential search', 'Optimal worst-case', 'Sorted arrays', 'Three dimensions']"
20483,1301.0216,Jan Hrncir,Jan Hrn\v{c}\'i\v{r} and Michael Rovatsos,"Applying Strategic Multiagent Planning to Real-World Travel Sharing
  Problems","7th International Workshop on Agents in Traffic and Transportation,
  AAMAS, 2012",,,,cs.AI,http://creativecommons.org/licenses/by/3.0/,"  Travel sharing, i.e., the problem of finding parts of routes which can be
shared by several travellers with different points of departure and
destinations, is a complex multiagent problem that requires taking into account
individual agents' preferences to come up with mutually acceptable joint plans.
In this paper, we apply state-of-the-art planning techniques to real-world
public transportation data to evaluate the feasibility of multiagent planning
techniques in this domain. The potential application value of improving travel
sharing technology has great application value due to its ability to reduce the
environmental impact of travelling while providing benefits to travellers at
the same time. We propose a three-phase algorithm that utilises performant
single-agent planners to find individual plans in a simplified domain first,
then merges them using a best-response planner which ensures resulting
solutions are individually rational, and then maps the resulting plan onto the
full temporal planning domain to schedule actual journeys. The evaluation of
our algorithm on real-world, multi-modal public transportation data for the
United Kingdom shows linear scalability both in the scenario size and in the
number of agents, where trade-offs have to be made between total cost
improvement, the percentage of feasible timetables identified for journeys, and
the prolongation of these journeys. Our system constitutes the first
implementation of strategic multiagent planning algorithms in large-scale
domains and provides insights into the engineering process of translating
general domain-independent multiagent planning algorithms to real-world
applications.
","[{'version': 'v1', 'created': 'Wed, 2 Jan 2013 12:06:59 GMT'}]",2013-01-03,"[['Hrnčíř', 'Jan', ''], ['Rovatsos', 'Michael', '']]","['multiagent planning', 'real-world application', 'travel sharing']"
20484,1603.09561,Dibyayan Chakraborty,"Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen",On a special class of boxicity 2 graphs,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We define and study a class of graphs, called 2-stab interval graphs (2SIG),
with boxicity 2 which properly contains the class of interval graphs. A 2SIG is
an axes-parallel rectangle intersection graph where the rectangles have unit
height (that is, length of the side parallel to $Y$-axis) and intersects either
of the two fixed lines, parallel to the $X$-axis, distance $1+\epsilon$ ($0 <
\epsilon < 1$) apart. Intuitively, 2SIG is a graph obtained by putting some
edges between two interval graphs in a particular rule. It turns out that for
these kind of graphs, the chromatic number of any of its induced subgraphs is
bounded by twice of its (induced subgraph) clique number. This shows that the
graph, even though not perfect, is not very far from it. Then we prove similar
results for some subclasses of 2SIG and provide efficient algorithm for finding
their clique number. We provide a matrix characterization for a subclass of
2SIG graph.
","[{'version': 'v1', 'created': 'Thu, 31 Mar 2016 12:48:32 GMT'}]",2016-04-01,"[['Bhore', 'Sujoy Kumar', ''], ['Chakraborty', 'Dibyayan', ''], ['Das', 'Sandip', ''], ['Sen', 'Sagnik', '']]","['boxicity', 'chromatic number', 'clique number', 'perfect graph', 'matrix characterization']"
20485,1501.02211,Sugata Sanyal,"Tuhin Borgohain, Uday Kumar, Sugata Sanyal",Survey of Security and Privacy Issues of Internet of Things,"7 pages, 3 figures",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is a general survey of all the security issues existing in the
Internet of Things (IoT) along with an analysis of the privacy issues that an
end-user may face as a consequence of the spread of IoT. The majority of the
survey is focused on the security loopholes arising out of the information
exchange technologies used in Internet of Things. No countermeasure to the
security drawbacks has been analyzed in the paper.
","[{'version': 'v1', 'created': 'Fri, 9 Jan 2015 17:58:18 GMT'}]",2015-01-12,"[['Borgohain', 'Tuhin', ''], ['Kumar', 'Uday', ''], ['Sanyal', 'Sugata', '']]","['Denial of Service', 'RFID', 'WSN', 'Internet of Things', 'DDoS Attack']"
20486,1406.3597,Akaki Mamageishvili,"Akaki Mamageishvili, Mat\'u\v{s} Mihal\'ak, Simone Montemezzani","An $H_{n/2}$ Upper Bound on the Price of Stability of Undirected Network
  Design Games",,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the network design game with $n$ players, every player chooses a path in
an edge-weighted graph to connect her pair of terminals, sharing costs of the
edges on her path with all other players fairly. We study the price of
stability of the game, i.e., the ratio of the social costs of a best Nash
equilibrium (with respect to the social cost) and of an optimal play. It has
been shown that the price of stability of any network design game is at most
$H_n$, the $n$-th harmonic number. This bound is tight for directed graphs. For
undirected graphs, the situation is dramatically different, and tight bounds
are not known. It has only recently been shown that the price of stability is
at most $H_n \left(1-\frac{1}{\Theta(n^4)} \right)$, while the worst-case known
example has price of stability around 2.25. In this paper we improve the upper
bound considerably by showing that the price of stability is at most $H_{n/2} +
\epsilon$ for any $\epsilon$ starting from some suitable $n \geq n(\epsilon)$.
","[{'version': 'v1', 'created': 'Fri, 13 Jun 2014 18:00:18 GMT'}]",2014-06-16,"[['Mamageishvili', 'Akaki', ''], ['Mihalák', 'Matúš', ''], ['Montemezzani', 'Simone', '']]","['Network design game', 'Nash equilibrium', 'Price of Stability']"
20487,0908.0919,Gene Golovchinsky,"Frank Hopfgartner, David Vallet, Martin Halvey and Joemon Jose",Collaborative Search Trails for Video Search,"Presented at 1st Intl Workshop on Collaborative Information Seeking,
  2008 (arXiv:0908.0583)",,,JCDL2008CIRWS/2008/hopvalhaljos,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present an approach for supporting users in the difficult
task of searching for video. We use collaborative feedback mined from the
interactions of earlier users of a video search system to help users in their
current search tasks. Our objective is to improve the quality of the results
that users find, and in doing so also assist users to explore a large and
complex information space. It is hoped that this will lead to them considering
search options that they may not have considered otherwise. We performed a user
centred evaluation. The results of our evaluation indicate that we achieved our
goals, the performance of the users in finding relevant video clips was
enhanced with our system; users were able to explore the collection of video
clips more and users demonstrated a preference for our system that provided
recommendations.
","[{'version': 'v1', 'created': 'Thu, 6 Aug 2009 17:28:21 GMT'}]",2009-08-07,"[['Hopfgartner', 'Frank', ''], ['Vallet', 'David', ''], ['Halvey', 'Martin', ''], ['Jose', 'Joemon', '']]","['Video', 'search', 'collaborative', 'feedback', 'user studies']"
20488,1511.02562,Yang Yang,"Yang Yang, Jie Tang, Yuxiao Dong, Qiaozhu Mei, Reid A. Johnson, Nitesh
  V. Chawla","Modeling the Interplay Between Individual Behavior and Network
  Distributions",,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is well-known that many networks follow a power-law degree distribution;
however, the factors that influence the formation of their distributions are
still unclear. How can one model the connection between individual actions and
network distributions? How can one explain the formation of group phenomena and
their evolutionary patterns?
  In this paper, we propose a unified framework, M3D, to model human dynamics
in social networks from three perspectives: macro, meso, and micro. At the
micro-level, we seek to capture the way in which an individual user decides
whether to perform an action. At the meso-level, we study how group behavior
develops and evolves over time, based on individual actions. At the
macro-level, we try to understand how network distributions such as power-law
(or heavy-tailed phenomena) can be explained by group behavior. We provide
theoretical analysis for the proposed framework, and discuss the connection of
our framework with existing work.
  The framework offers a new, flexible way to explain the interplay between
individual user actions and network distributions, and can benefit many
applications. To model heavy-tailed distributions from partially observed
individual actions and to predict the formation of group behaviors, we apply
M3D to three different genres of networks: Tencent Weibo, Citation, and Flickr.
We also use information-burst prediction as a particular application to
quantitatively evaluate the predictive power of the proposed framework. Our
results on the Weibo indicate that M3D's prediction performance exceeds that of
several alternative methods by up to 30\%.
","[{'version': 'v1', 'created': 'Mon, 9 Nov 2015 04:18:05 GMT'}]",2015-11-10,"[['Yang', 'Yang', ''], ['Tang', 'Jie', ''], ['Dong', 'Yuxiao', ''], ['Mei', 'Qiaozhu', ''], ['Johnson', 'Reid A.', ''], ['Chawla', 'Nitesh V.', '']]","['User behavior', 'Information diffusion', 'Heavy-tailed distributions']"
20489,1511.03417,Chang-Heng Wang,"Chang-Heng Wang, Tara Javidi","Adaptive Policies for Scheduling with Reconfiguration Delay: An
  End-to-End Solution for All-Optical Data Centers",,,,,cs.NI math.OC math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  All-optical switching networks have been considered a promising candidate for
the next generation data center networks thanks to its scalability in data
bandwidth and power efficiency. However, the bufferless nature and the nonzero
recon- figuration delay of optical switches remain great challenges in
deploying all-optical networks. This paper considers the end-to- end scheduling
for all-optical data center networks with no in- network buffer and nonzero
reconfiguration delay. A framework is proposed to deal with the nonzero
reconfiguration delay. The proposed approach constructs an adaptive variant of
any given scheduling policy. It is shown that if a scheduling policy guarantees
its schedules to have schedule weights close to the MaxWeight schedule (and
thus is throughput optimal in the zero reconfiguration regime), then the
throughput optimality is inherited by its adaptive variant (in any nonzero
reconfiguration delay regime). As a corollary, a class of adaptive variants of
the well known MaxWeight policy is shown to achieve throughput optimality
without prior knowledge of the traffic load. Further- more, through numerical
simulations, the simplest such policy, namely the Adaptive MaxWeight (AMW), is
shown to exhibit better delay performance than all prior work.
","[{'version': 'v1', 'created': 'Wed, 11 Nov 2015 08:36:07 GMT'}]",2015-11-12,"[['Wang', 'Chang-Heng', ''], ['Javidi', 'Tara', '']]","['Reconfiguration delay', 'scheduling', 'throughput optimality']"
20490,1506.03479,Cheng Wan Dr,Cheng Wan,Strategic decentralization in binary choice composite congestion games,"27 pages, 2 figures",,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper studies strategic decentralization in binary choice composite
network congestion games. A player decentralizes if she lets some autonomous
agents to decide respectively how to send different parts of her stock from the
origin to the destination. This paper shows that, with convex, strictly
increasing and differentiable arc cost functions, an atomic splittable player
always has an optimal unilateral decentralization strategy. Besides, unilateral
decentralization gives her the same advantage as being the leader in a
Stackelberg congestion game. Finally, unilateral decentralization of an atomic
player has a negative impact on the social cost and on the costs of the other
players at the equilibrium of the congestion game.
","[{'version': 'v1', 'created': 'Wed, 10 Jun 2015 21:00:16 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Sep 2015 10:55:02 GMT'}]",2015-09-16,"[['Wan', 'Cheng', '']]","['routing', 'decentralization', 'Stackelberg game', 'composite congestion game']"
20491,1304.4222,Hossein Movafegh Ghadirli,"Hossein Movafegh Ghadirli, Maryam Rastgarpour",A Web-based Adaptive and Intelligent Tutor by Expert Systems,"10 pages, 3 figures, The Second International Conference on Advances
  in Computing and Information Technology (ACITY 2012). arXiv admin note:
  substantial text overlap with arXiv:1304.4045",,,,cs.CY,http://creativecommons.org/licenses/by/3.0/,"  Todays, Intelligent and web-based E-learning is one of regarded topics. So
researchers are trying to optimize and expand its application in the field of
education. The aim of this paper is developing of E-learning software which is
customizable, dynamic, intelligent and adaptive with Pedagogy view for learners
in intelligent schools. This system is an integration of adaptive web-based
E-learning with expert systems as well. Learning process in this system is as
follows. First intelligent tutor determines learning style and characteristics
of learner by a questionnaire and then makes his model. After that the expert
system simulator plans a pre-test and then calculates his score. If the learner
gets the required score, the concept will be trained. Finally the learner will
be evaluated by a post-test. The proposed system can improves the education
efficiency highly as well as de-creases the costs and problems of an expert
tutor. As a result, every time and eve-rywhere (ETEW) learning would be
provided via web in this system. Moreover the learners can enjoy a cheap remote
learning even at home in a virtual simulated physical class. So they can learn
thousands courses very simple and fast.
","[{'version': 'v1', 'created': 'Mon, 15 Apr 2013 10:28:09 GMT'}]",2013-04-17,"[['Ghadirli', 'Hossein Movafegh', ''], ['Rastgarpour', 'Maryam', '']]","['Expert Tutor', 'Intelligent Learning', 'Adaptive Learning', 'E-learning', 'Web-based learning']"
20492,1305.7014,Bohdan Pavlyshenko,Bohdan Pavlyshenko,Tweets Miner for Stock Market Analysis,,,,,cs.IR cs.CL cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we present a software package for the data mining of Twitter
microblogs for the purpose of using them for the stock market analysis. The
package is written in R langauge using apropriate R packages. The model of
tweets has been considered. We have also compared stock market charts with
frequent sets of keywords in Twitter microblogs messages.
","[{'version': 'v1', 'created': 'Thu, 30 May 2013 06:35:52 GMT'}]",2013-05-31,"[['Pavlyshenko', 'Bohdan', '']]","['in Twitter microblogs messages.  Key words Twitter', 'tweets', 'data mining', 'frequent sets', 'stock market']"
20493,1209.0127,Alexandra Faynburd Mrs,"Ran El-Yaniv, Alexandra Faynburd","Autoregressive short-term prediction of turning points using support
  vector regression",,,,,cs.LG cs.CE cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work is concerned with autoregressive prediction of turning points in
financial price sequences. Such turning points are critical local extrema
points along a series, which mark the start of new swings. Predicting the
future time of such turning points or even their early or late identification
slightly before or after the fact has useful applications in economics and
finance. Building on recently proposed neural network model for turning point
prediction, we propose and study a new autoregressive model for predicting
turning points of small swings. Our method relies on a known turning point
indicator, a Fourier enriched representation of price histories, and support
vector regression. We empirically examine the performance of the proposed
method over a long history of the Dow Jones Industrial average. Our study shows
that the proposed method is superior to the previous neural network model, in
terms of trading performance of a simple trading application and also exhibits
a quantifiable advantage over the buy-and-hold benchmark.
","[{'version': 'v1', 'created': 'Sat, 1 Sep 2012 19:53:23 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Sep 2012 19:28:24 GMT'}]",2012-09-25,"[['El-Yaniv', 'Ran', ''], ['Faynburd', 'Alexandra', '']]","['Artificial Neural Networks', 'SVR', 'financial prediction', 'turningpoints']"
20494,1312.7363,Andrew Adamatzky,Andrew Adamatzky,How beta-skeletons lose their edges,,"Adamatzky A. How {\beta}-skeletons lose their edges. Information
  Sciences 254 (2014) 213-224",,,cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A {\beta}-skeleton is a proximity graphs with node neighbourhood defined by
continuous-valued parameter {\beta}. Two nodes in a {\beta}-skeleton are
connected by an edge if their lune-based neighbourhood contains no other nodes.
With increase of {\beta} some edges a skeleton are disappear. We study how a
number of edges in {\beta}-skeleton depends on {\beta}. We speculate how this
dependence can be used to discriminate between random and non-random planar
sets. We also analyse stability of {\beta}-skeletons and their sensitivity to
perturbations.
","[{'version': 'v1', 'created': 'Fri, 27 Dec 2013 22:30:13 GMT'}]",2013-12-31,"[['Adamatzky', 'Andrew', '']]","['proximity graphs', 'β-skeletons', 'pattern formation', 'discrimination']"
20495,1212.1284,Mohammad Doomun,M. N. Hulkury and M. R. Doomun,Integrated Green Cloud Computing Architecture,"6 pages, International Conference on Advanced Computer Science
  Applications and Technologies, ACSAT 2012",,,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  Arbitrary usage of cloud computing, either private or public, can lead to
uneconomical energy consumption in data processing, storage and communication.
Hence, green cloud computing solutions aim not only to save energy but also
reduce operational costs and carbon footprints on the environment. In this
paper, an Integrated Green Cloud Architecture (IGCA) is proposed that comprises
of a client-oriented Green Cloud Middleware to assist managers in better
overseeing and configuring their overall access to cloud services in the
greenest or most energy-efficient way. Decision making, whether to use local
machine processing, private or public clouds, is smartly handled by the
middleware using predefined system specifications such as service level
agreement (SLA), Quality of service (QoS), equipment specifications and job
description provided by IT department. Analytical model is used to show the
feasibility to achieve efficient energy consumption while choosing between
local, private and public Cloud service provider (CSP).
","[{'version': 'v1', 'created': 'Thu, 6 Dec 2012 10:57:59 GMT'}]",2012-12-07,"[['Hulkury', 'M. N.', ''], ['Doomun', 'M. R.', '']]","['Cloud Computing', 'Energy efficient', 'Architecture', 'Middleware']"
20496,1705.09359,Niek Tax,"Niek Tax, Emin Alasgarov, Natalia Sidorova, Wil M.P. van der Aalst,
  Reinder Haakma","Generating Time-Based Label Refinements to Discover More Precise Process
  Models",,,,,cs.LG cs.AI cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Process mining is a research field focused on the analysis of event data with
the aim of extracting insights related to dynamic behavior. Applying process
mining techniques on data from smart home environments has the potential to
provide valuable insights in (un)healthy habits and to contribute to ambient
assisted living solutions. Finding the right event labels to enable the
application of process mining techniques is however far from trivial, as simply
using the triggering sensor as the label for sensor events results in
uninformative models that allow for too much behavior (overgeneralizing).
Refinements of sensor level event labels suggested by domain experts have been
shown to enable discovery of more precise and insightful process models.
However, there exists no automated approach to generate refinements of event
labels in the context of process mining. In this paper we propose a framework
for the automated generation of label refinements based on the time attribute
of events, allowing us to distinguish behaviourally different instances of the
same event type based on their time attribute. We show on a case study with
real life smart home event data that using automatically generated refined
labels in process discovery, we can find more specific, and therefore more
insightful, process models. We observe that one label refinement could have an
effect on the usefulness of other label refinements when used together.
Therefore, we explore four strategies to generate useful combinations of
multiple label refinements and evaluate those on three real life smart home
event logs.
","[{'version': 'v1', 'created': 'Thu, 25 May 2017 21:01:20 GMT'}, {'version': 'v2', 'created': 'Tue, 31 Oct 2017 16:22:43 GMT'}]",2017-11-01,"[['Tax', 'Niek', ''], ['Alasgarov', 'Emin', ''], ['Sidorova', 'Natalia', ''], ['van der Aalst', 'Wil M. P.', ''], ['Haakma', 'Reinder', '']]","['Knowledge discovery for smart home environments', 'Circular statistics', 'Process mining']"
20497,1002.1176,Vishal Goyal,"Boufeldja Kadri, Miloud Boussahla, Fethi Tarik Bendimerad",Phase-Only Planar Antenna Array Synthesis with Fuzzy Genetic Algorithms,"International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 2, January 2010,
  http://ijcsi.org/articles/Phase-Only-Planar-Antenna-Array-Synthesis-with-Fuzzy-Genetic-Algorithms.php","International Journal of Computer Science Issues, IJCSI, Vol. 7,
  Issue 1, No. 2, January 2010,
  http://ijcsi.org/articles/Phase-Only-Planar-Antenna-Array-Synthesis-with-Fuzzy-Genetic-Algorithms.php",,,cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper describes a new method for the synthesis of planar antenna arrays
using fuzzy genetic algorithms (FGAs) by optimizing phase excitation
coefficients to best meet a desired radiation pattern. We present the
application of a rigorous optimization technique based on fuzzy genetic
algorithms (FGAs), the optimizing algorithm is obtained by adjusting control
parameters of a standard version of genetic algorithm (SGAs) using a fuzzy
controller (FLC) depending on the best individual fitness and the population
diversity measurements (PDM). The presented optimization algorithms were
previously checked on specific mathematical test function and show their
superior capabilities with respect to the standard version (SGAs). A planar
array with rectangular cells using a probe feed is considered. Included example
using FGA demonstrates the good agreement between the desired and calculated
radiation patterns than those obtained by a SGA.
","[{'version': 'v1', 'created': 'Fri, 5 Feb 2010 10:08:22 GMT'}]",2010-02-08,"[['Kadri', 'Boufeldja', ''], ['Boussahla', 'Miloud', ''], ['Bendimerad', 'Fethi Tarik', '']]","['fuzzy genetic algorithms', 'planar array', 'synthesis', 'population diversity measurements', 'fuzzy controller']"
20498,1710.01249,Hamid Tizhoosh,"Meghana Dinesh Kumar, Morteza Babaie, Shujin Zhu, Shivam Kalra, and
  H.R.Tizhoosh","A Comparative Study of CNN, BoVW and LBP for Classification of
  Histopathological Images","To appear in proceedings of The IEEE Symposium Series on
  Computational Intelligence (IEEE SSCI 2017), Honolulu, Hawaii, USA, Nov. 27
  -- Dec 1, 2017",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Despite the progress made in the field of medical imaging, it remains a large
area of open research, especially due to the variety of imaging modalities and
disease-specific characteristics. This paper is a comparative study describing
the potential of using local binary patterns (LBP), deep features and the
bag-of-visual words (BoVW) scheme for the classification of histopathological
images. We introduce a new dataset, \emph{KIMIA Path960}, that contains 960
histopathology images belonging to 20 different classes (different tissue
types). We make this dataset publicly available. The small size of the dataset
and its inter- and intra-class variability makes it ideal for initial
investigations when comparing image descriptors for search and classification
in complex medical imaging cases like histopathology. We investigate deep
features, LBP histograms and BoVW to classify the images via leave-one-out
validation. The accuracy of image classification obtained using LBP was 90.62\%
while the highest accuracy using deep features reached 94.72\%. The dictionary
approach (BoVW) achieved 96.50\%. Deep solutions may be able to deliver higher
accuracies but they need extensive training with a large number of (balanced)
image datasets.
","[{'version': 'v1', 'created': 'Wed, 27 Sep 2017 23:02:52 GMT'}]",2017-10-04,"[['Kumar', 'Meghana Dinesh', ''], ['Babaie', 'Morteza', ''], ['Zhu', 'Shujin', ''], ['Kalra', 'Shivam', ''], ['Tizhoosh', 'H. R.', '']]","['LBP', 'deep networks', 'deep features', 'bag-of-visualwords', 'histopathology', 'image classification', 'image retrieval']"
20499,1410.5072,Georgios Pitsilis,Georgios Pitsilis and Wei Wang,"Harnessing the power of Social Bookmarking for improving tag-based
  Recommendations","28 pages, 10 figures, 4 tables",,,,cs.SI cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social bookmarking and tagging has emerged a new era in user collaboration.
Collaborative Tagging allows users to annotate content of their liking, which
via the appropriate algorithms can render useful for the provision of product
recommendations. It is the case today for tag-based algorithms to work
complementary to rating-based recommendation mechanisms to predict the user
liking to various products. In this paper we propose an alternative algorithm
for computing personalized recommendations of products, that uses exclusively
the tags provided by the users. Our approach is based on the idea of using the
semantic similarity of the user-provided tags for clustering them into groups
of similar meaning. Afterwards, some measurable characteristics of users'
Annotation Competency are combined with other metrics, such as user similarity,
for computing predictions. The evaluation on data used from a real-world
collaborative tagging system, citeUlike, confirmed that our approach
outperforms the baseline Vector Space model, as well as other state of the art
algorithms, predicting the user liking more accurately.
","[{'version': 'v1', 'created': 'Sun, 19 Oct 2014 13:33:29 GMT'}]",2014-10-21,"[['Pitsilis', 'Georgios', ''], ['Wang', 'Wei', '']]","['Recommender Systems', 'Collaborative Tagging', 'Affinity Propagation', 'citeUlike', 'Taxonomy']"
20500,1301.2486,Manuel Kauers,"Fredrik Johansson, Manuel Kauers, Marc Mezzarobba","Finding Hyperexponential Solutions of Linear ODEs by Numerical
  Evaluation",,,,,cs.SC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a new algorithm for computing hyperexponential solutions of
ordinary linear differential equations with polynomial coefficients. The
algorithm relies on interpreting formal series solutions at the singular points
as analytic functions and evaluating them numerically at some common ordinary
point. The numerical data is used to determine a small number of combinations
of the formal series that may give rise to hyperexponential solutions.
","[{'version': 'v1', 'created': 'Fri, 11 Jan 2013 13:00:24 GMT'}]",2013-01-14,"[['Johansson', 'Fredrik', ''], ['Kauers', 'Manuel', ''], ['Mezzarobba', 'Marc', '']]","['Closed form solutions', 'D-finite equations', 'Effective analyticcontinuation']"
20501,1702.01203,Varun  Jog,Varun Jog and Venkat Anantharam,Intrinsic entropies of log-concave distributions,"33 pages. A shorter version of this paper appeared in the proceedings
  of ISIT 2015",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The entropy of a random variable is well-known to equal the exponential
growth rate of the volumes of its typical sets. In this paper, we show that for
any log-concave random variable $X$, the sequence of the $\lfloor n\theta
\rfloor^{\text{th}}$ intrinsic volumes of the typical sets of $X$ in dimensions
$n \geq 1$ grows exponentially with a well-defined rate. We denote this rate by
$h_X(\theta)$, and call it the $\theta^{\text{th}}$ intrinsic entropy of $X$.
We show that $h_X(\theta)$ is a continuous function of $\theta$ over the range
$[0,1]$, thereby providing a smooth interpolation between the values 0 and
$h(X)$ at the endpoints 0 and 1, respectively.
","[{'version': 'v1', 'created': 'Fri, 3 Feb 2017 23:36:33 GMT'}]",2017-02-07,"[['Jog', 'Varun', ''], ['Anantharam', 'Venkat', '']]","['Typical sets', 'log-concave random variables', 'differential entropy', 'intrinsic volumes']"
20502,1402.3382,Rosy Madaan,"K.Rajan, Dr.V.Ramalingam, Dr.M.Ganesan","Machine Learning of Phonologically Conditioned Noun Declensions For
  Tamil Morphological Generators","13 pages. International Journal of Computer Engineering and
  Applications, 2013",,,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents machine learning solutions to a practical problem of
Natural Language Generation (NLG), particularly the word formation in
agglutinative languages like Tamil, in a supervised manner. The morphological
generator is an important component of Natural Language Processing in
Artificial Intelligence. It generates word forms given a root and affixes. The
morphophonemic changes like addition, deletion, alternation etc., occur when
two or more morphemes or words joined together. The Sandhi rules should be
explicitly specified in the rule based morphological analyzers and generators.
In machine learning framework, these rules can be learned automatically by the
system from the training samples and subsequently be applied for new inputs. In
this paper we proposed the machine learning models which learn the
morphophonemic rules for noun declensions from the given training data. These
models are trained to learn sandhi rules using various learning algorithms and
the performance of those algorithms are presented. From this we conclude that
machine learning of morphological processing such as word form generation can
be successfully learned in a supervised manner, without explicit description of
rules. The performance of Decision trees and Bayesian machine learning
algorithms on noun declensions are discussed.
","[{'version': 'v1', 'created': 'Fri, 14 Feb 2014 06:46:44 GMT'}]",2014-02-17,"[['Rajan', 'K.', ''], ['Ramalingam', 'Dr. V.', ''], ['Ganesan', 'Dr. M.', '']]","['Machine  learning', 'Tamil  morphology', 'Morphophonemic  rules', 'Decision  Trees', 'Bayesian models']"
20503,1604.08407,Wenqiang Liu,"Wenqiang Liu, Jun Liu, Haimeng Duan, Xie He, Bifan Wei","Exploiting Source-Object Network to Resolve Object Conflicts in Linked
  Data",This paper had been accepted by ESWC2017 Research Tracks,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Considerable effort has been made to increase the scale of Linked Data.
However, an inevitable problem when dealing with data integration from multiple
sources is that multiple different sources often provide conflicting objects
for a certain predicate of the same real-world entity, so-called object
conflicts problem. Currently, the object conflicts problem has not received
sufficient attention in the Linked Data community. In this paper, we first
formalize the object conflicts resolution problem as computing the joint
distribution of variables on a heterogeneous information network called the
Source-Object Network, which successfully captures the all correlations from
objects and Linked Data sources. Then, we introduce a novel approach based on
network effects called ObResolution(Object Resolution), to identify a true
object from multiple conflicting objects. ObResolution adopts a pairwise Markov
Random Field (pMRF) to model all evidences under a unified framework. Extensive
experimental results on six real-world datasets show that our method exhibits
higher accuracy than existing approaches and it is robust and consistent in
various domains. \keywords{Linked Data, Object Conflicts, Linked Data Quality,
Truth Discovery
","[{'version': 'v1', 'created': 'Thu, 28 Apr 2016 13:22:54 GMT'}, {'version': 'v2', 'created': 'Wed, 22 Feb 2017 21:32:48 GMT'}, {'version': 'v3', 'created': 'Fri, 21 Apr 2017 22:38:10 GMT'}]",2017-04-25,"[['Liu', 'Wenqiang', ''], ['Liu', 'Jun', ''], ['Duan', 'Haimeng', ''], ['He', 'Xie', ''], ['Wei', 'Bifan', '']]","['Linked Data Quality', 'Object Conflicts', 'Truth Discovery']"
20504,1212.6259,Youssef Bassil,Youssef Bassil,"Image Steganography based on a Parameterized Canny Edge Detection
  Algorithm","LACSC Lebanese Association for Computational Sciences, International
  Journal of Computer Applications, Vol 60, No.4, 2012, http://www.lacsc.org.
  arXiv admin note: text overlap with arXiv:1212.2064, arXiv:1212.5801",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Steganography is the science of hiding digital information in such a way that
no one can suspect its existence. Unlike cryptography which may arouse
suspicions, steganography is a stealthy method that enables data communication
in total secrecy. Steganography has many requirements, the foremost one is
irrecoverability which refers to how hard it is for someone apart from the
original communicating parties to detect and recover the hidden data out of the
secret communication. A good strategy to guaranteeirrecoverability is to cover
the secret data not usinga trivial method based on a predictable algorithm, but
using a specific random pattern based on a mathematical algorithm. This paper
proposes an image steganography technique based on theCanny edge detection
algorithm.It is designed to hide secret data into a digital image within the
pixels that make up the boundaries of objects detected in the image. More
specifically, bits of the secret data replace the three LSBs of every color
channel of the pixels detected by the Canny edge detection algorithm as part of
the edges in the carrier image. Besides, the algorithm is parameterized by
three parameters: The size of the Gaussian filter, a low threshold value, and a
high threshold value. These parameters can yield to different outputs for the
same input image and secret data. As a result, discovering the inner-workings
of the algorithm would be considerably ambiguous, misguiding steganalysts from
the exact location of the covert data. Experiments showed a simulation tool
codenamed GhostBit, meant to cover and uncover secret data using the proposed
algorithm. As future work, examining how other image processing techniques such
as brightness and contrast adjustment can be taken advantage of in
steganography with the purpose ofgiving the communicating parties more
preferences tomanipulate their secret communication.
","[{'version': 'v1', 'created': 'Sun, 23 Dec 2012 14:57:18 GMT'}]",2013-01-01,"[['Bassil', 'Youssef', '']]","['Image Steganography', 'Canny Edge Detection', 'Parameterized Algorithm']"
20505,1110.2753,Bruce Hajek,Ji Zhu and Bruce Hajek,Stability of a Peer-to-Peer Communication System,"33 pages, 6 figures",,,,cs.PF math.PR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper focuses on the stationary portion of file download in an
unstructured peer-to-peer network, which typically follows for many hours after
a flash crowd initiation. The model includes the case that peers can have some
pieces at the time of arrival. The contribution of the paper is to identify how
much help is needed from the seeds, either fixed seeds or peer seeds (which are
peers remaining in the system after obtaining a complete collection) to
stabilize the system. The dominant cause for instability is the missing piece
syndrome, whereby one piece becomes very rare in the network. It is shown that
stability can be achieved with only a small amount of help from peer
seeds--even with very little help from a fixed seed, peers need dwell as peer
seeds on average only long enough to upload one additional piece. The region of
stability is insensitive to the piece selection policy. Network coding can
substantially increase the region of stability in case a portion of the new
peers arrive with randomly coded pieces.
","[{'version': 'v1', 'created': 'Wed, 12 Oct 2011 18:47:23 GMT'}, {'version': 'v2', 'created': 'Sun, 6 May 2012 03:53:44 GMT'}]",2012-05-08,"[['Zhu', 'Ji', ''], ['Hajek', 'Bruce', '']]","['Peer to peer', 'missing piece syndrome', 'random peer contact', 'random useful piece selection', 'FosterLyapunov stability', 'Markov process']"
20506,1307.1568,Chau Do,Chau Do and Eric J. Pauwels,"Using MathML to Represent Units of Measurement for Improved Ontology
  Alignment","Conferences on Intelligent Computer Mathematics (CICM 2013), Bath,
  England","CICM 2013, LNAI (7961), Springer, 2013",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Ontologies provide a formal description of concepts and their relationships
in a knowledge domain. The goal of ontology alignment is to identify
semantically matching concepts and relationships across independently developed
ontologies that purport to describe the same knowledge. In order to handle the
widest possible class of ontologies, many alignment algorithms rely on
terminological and structural meth- ods, but the often fuzzy nature of concepts
complicates the matching process. However, one area that should provide clear
matching solutions due to its mathematical nature, is units of measurement.
Several on- tologies for units of measurement are available, but there has been
no attempt to align them, notwithstanding the obvious importance for tech-
nical interoperability. We propose a general strategy to map these (and
similar) ontologies by introducing MathML to accurately capture the semantic
description of concepts specified therein. We provide mapping results for three
ontologies, and show that our approach improves on lexical comparisons.
","[{'version': 'v1', 'created': 'Fri, 5 Jul 2013 10:05:34 GMT'}]",2013-07-08,"[['Do', 'Chau', ''], ['Pauwels', 'Eric J.', '']]","['MathML', 'ontology matching', 'ontology alignment', 'units ofmeasurement']"
20507,1510.03533,Heba Aly,"Heba Aly, Moustafa Youssef","semMatch: Road Semantics-based Accurate Map Matching for Challenging
  Positioning Data","Accepted for publication as a full paper in the 23rd ACM SIGSPATIAL
  International Conference on Advances in Geographic Information Systems (ACM
  SIGSPATIAL 2015)",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Map matching has been used to reduce the noisiness of the location estimates
by aligning them to the road network on a digital map. A growing number of
applications, e.g. energy-efficient localization and cellular provider side
localization, depend on the availability of only sparse and coarse-grained
positioning data; leading to a challenging map matching process.
  In this paper, we present semMatch: a system that can provide accurate
HMM-based map matching for challenging positioning traces. semMatch leverages
the smartphone's inertial sensors to detect different road semantics; such as
speed bumps, tunnels, and turns; and uses them in a mathe-matically-principled
way as hints to overcome the sparse, noisy, and coarse-grained input
positioning data, improving the HMM map matching accuracy and efficiency. To do
that, semMatch applies a series of preprocessing modules to handle the noisy
locations. The filtered location data is then processed by the core of semMatch
system using a novel incremental HMM algorithm that combines a
semantics-enriched digital map and the car's ambient road semantics in its
estimation process.
  We have evaluated semMatch using traces collected from different cities
covering more than 150km under different harsh scenarios including
coarse-grained cellular-based positioning data, sparse GPS traces with
extremely low sampling rate, and noisy traces with a large number of
back-and-force transitions. The results show that semMatch significantly
outperforms traditional map matching algorithms under all scenarios, with an
enhancement of at least 416% and 894% in precision and recall respectively in
the most difficult cases. This highlights its promise as a next generation map
matching algorithm for challenging environments.
","[{'version': 'v1', 'created': 'Tue, 13 Oct 2015 05:09:49 GMT'}]",2015-10-14,"[['Aly', 'Heba', ''], ['Youssef', 'Moustafa', '']]","['Road semantics-based map matching', 'Map matching forchallenging positioning data', 'HMM-based map matching']"
20508,1407.6872,Ivan Ivek,Ivan Ivek,"Interpretable Low-Rank Document Representations with Label-Dependent
  Sparsity Patterns",,,,,cs.CL cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In context of document classification, where in a corpus of documents their
label tags are readily known, an opportunity lies in utilizing label
information to learn document representation spaces with better discriminative
properties. To this end, in this paper application of a Variational Bayesian
Supervised Nonnegative Matrix Factorization (supervised vbNMF) with
label-driven sparsity structure of coefficients is proposed for learning of
discriminative nonsubtractive latent semantic components occuring in TF-IDF
document representations. Constraints are such that the components pursued are
made to be frequently occuring in a small set of labels only, making it
possible to yield document representations with distinctive label-specific
sparse activation patterns. A simple measure of quality of this kind of
sparsity structure, dubbed inter-label sparsity, is introduced and
experimentally brought into tight connection with classification performance.
Representing a great practical convenience, inter-label sparsity is shown to be
easily controlled in supervised vbNMF by a single parameter.
","[{'version': 'v1', 'created': 'Fri, 25 Jul 2014 12:46:18 GMT'}]",2014-07-28,"[['Ivek', 'Ivan', '']]","['Document Categorization', 'Latent Semantic Analysis', 'SupervisedSparse Nonnegative Matrix Factorization', 'Variational Bayes']"
20509,1304.5971,Sandor P. Fekete,"S\'andor P. Fekete, Nils Schweer, Jan-Marc Reinhardt",A Competitive Strategy for Distance-Aware Online Shape Allocation,"15 pages, 9 figures, 3 tables; extended abstract version appears in
  WALCOM 2013, LNCS 7748, pp. 41-52",,,,cs.DS cs.CG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the following online allocation problem: Given a unit square S,
and a sequence of numbers n_i between 0 and 1, with partial sum bounded by 1;
at each step i, select a region C_i of previously unassigned area n_i in S. The
objective is to make these regions compact in a distance-aware sense: minimize
the maximum (normalized) average Manhattan distance between points from the
same set C_i. Related location problems have received a considerable amount of
attention; in particular, the problem of determining the ""optimal shape of a
city"", i.e., allocating a single n_i has been studied. We present an online
strategy, based on an analysis of space-filling curves; for continuous shapes,
we prove a factor of 1.8092, and 1.7848 for discrete point sets.
","[{'version': 'v1', 'created': 'Mon, 22 Apr 2013 14:49:39 GMT'}]",2013-04-23,"[['Fekete', 'Sándor P.', ''], ['Schweer', 'Nils', ''], ['Reinhardt', 'Jan-Marc', '']]","['Clustering', 'average distance', 'online problems', 'optimal shape of acity', 'space-filling curves', 'competitive analysis']"
20510,1610.05796,Koray Mancuhan,Koray Mancuhan and Chris Clifton,Decision Tree Classification on Outsourced Data,"Presented in the Data Ethics Workshop at the 20th ACM SIGKDD
  Conference on Knowledge Discovery and Data Mining",,,,cs.LG cs.CR cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper proposes a client-server decision tree learning method for
outsourced private data. The privacy model is anatomization/fragmentation: the
server sees data values, but the link between sensitive and identifying
information is encrypted with a key known only to clients. Clients have limited
processing and storage capability. Both sensitive and identifying information
thus are stored on the server. The approach presented also retains most
processing at the server, and client-side processing is amortized over
predictions made by the clients. Experiments on various datasets show that the
method produces decision trees approaching the accuracy of a non-private
decision tree, while substantially reducing the client's computing resource
requirements.
","[{'version': 'v1', 'created': 'Tue, 18 Oct 2016 20:49:21 GMT'}]",2016-10-20,"[['Mancuhan', 'Koray', ''], ['Clifton', 'Chris', '']]","['Anatomy', 'l-diversity', 'Data Mining', 'Decision Trees']"
20511,1401.5108,Mohamed A. El-Sayed,Mohamed A. El-Sayed and Mohamed A. Khafagy,"An Identification System Using Eye Detection Based On Wavelets And
  Neural Networks","Mohamed A. El-Sayed and Mohamed A. Khafagy, An Identification System
  Using Eye Detection Based On Wavelets And Neural Networks. International
  Journal Of Computer And Information Technology. Vol. 1, No. 2, pp. 43-48,
  2012. arXiv admin note: text overlap with arXiv:1205.5097 by other authors
  without attribution","International Journal Of Computer And Information Technology, 2012",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The randomness and uniqueness of human eye patterns is a major breakthrough
in the search for quicker, easier and highly reliable forms of automatic human
identification. It is being used extensively in security solutions. This
includes access control to physical facilities, security systems and
information databases, Suspect tracking, surveillance and intrusion detection
and by various Intelligence agencies through out the world. We use the
advantage of human eye uniqueness to identify people and approve its validity
as a biometric. . Eye detection involves first extracting the eye from a
digital face image, and then encoding the unique patterns of the eye in such a
way that they can be compared with pre-registered eye patterns. The eye
detection system consists of an automatic segmentation system that is based on
the wavelet transform, and then the Wavelet analysis is used as a pre-processor
for a back propagation neural network with conjugate gradient learning. The
inputs to the neural network are the wavelet maxima neighborhood coefficients
of face images at a particular scale. The output of the neural network is the
classification of the input into an eye or non-eye region. An accuracy of 90%
is observed for identifying test images under different conditions included in
training stage.
","[{'version': 'v1', 'created': 'Mon, 20 Jan 2014 22:10:52 GMT'}]",2014-01-22,"[['El-Sayed', 'Mohamed A.', ''], ['Khafagy', 'Mohamed A.', '']]","['Identification', 'eye detection', 'face detection', 'wavelets', 'neural networks']"
20512,1606.05242,Pedro Saleiro,"Pedro Saleiro, Lu\'is Gomes, Carlos Soares","Sentiment Aggregate Functions for Political Opinion Polling using
  Microblog Streams",,,,,cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The automatic content analysis of mass media in the social sciences has
become necessary and possible with the raise of social media and computational
power. One particularly promising avenue of research concerns the use of
sentiment analysis in microblog streams. However, one of the main challenges
consists in aggregating sentiment polarity in a timely fashion that can be fed
to the prediction method. We investigated a large set of sentiment aggregate
functions and performed a regression analysis using political opinion polls as
gold standard. Our dataset contains nearly 233 000 tweets, classified according
to their polarity (positive, negative or neutral), regarding the five main
Portuguese political leaders during the Portuguese bailout (2011-2014). Results
show that different sentiment aggregate functions exhibit different feature
importance over time while the error keeps almost unchanged.
","[{'version': 'v1', 'created': 'Thu, 16 Jun 2016 16:14:58 GMT'}]",2016-06-17,"[['Saleiro', 'Pedro', ''], ['Gomes', 'Luís', ''], ['Soares', 'Carlos', '']]","['Sentiment Analysis', 'Social Media', 'Political Data Mining']"
20513,1607.01443,Dan Calacci,"Dan Calacci, Oren Lederman, David Shrier, Alex 'Sandy' Pentland","Breakout: An Open Measurement and Intervention Tool for Distributed Peer
  Learning Groups",Presented at SBP 2016,,,,cs.HC cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present Breakout, a group interaction platform for online courses that
enables the creation and measurement of face-to-face peer learning groups in
online settings. Breakout is designed to help students easily engage in
synchronous, video breakout session based peer learning in settings that
otherwise force students to rely on asynchronous text-based communication. The
platform also offers data collection and intervention tools for studying the
communication patterns inherent in online learning environments. The goals of
the system are twofold: to enhance student engagement in online learning
settings and to create a platform for research into the relationship between
distributed group interaction patterns and learning outcomes.
","[{'version': 'v1', 'created': 'Wed, 6 Jul 2016 00:11:10 GMT'}]",2016-07-07,"[['Calacci', 'Dan', ''], ['Lederman', 'Oren', ''], ['Shrier', 'David', ''], ['Pentland', ""Alex 'Sandy'"", '']]","['learning', 'MOOCs', 'group interaction', 'communication', 'peerlearning', 'on-line learning']"
20514,1304.7654,Adrian Jackson,Adrian Jackson and M. Sergio Campobasso,"Optimised hybrid parallelisation of a CFD code on Many Core
  architectures","Submitted to the SC13 conference, 10 pages with 8 figures",,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  COSA is a novel CFD system based on the compressible Navier-Stokes model for
unsteady aerodynamics and aeroelasticity of fixed structures, rotary wings and
turbomachinery blades. It includes a steady, time domain, and harmonic balance
flow solver.
  COSA has primarily been parallelised using MPI, but there is also a hybrid
parallelisation that adds OpenMP functionality to the MPI parallelisation to
enable larger number of cores to be utilised for a given simulation as the MPI
parallelisation is limited to the number of geometric partitions (or blocks) in
the simulation, or to exploit multi-threaded hardware where appropriate. This
paper outlines the work undertaken to optimise these two parallelisation
strategies, improving the efficiency of both and therefore reducing the
computational time required to compute simulations. We also analyse the power
consumption of the code on a range of leading HPC systems to further understand
the performance of the code.
","[{'version': 'v1', 'created': 'Mon, 29 Apr 2013 13:22:38 GMT'}]",2013-04-30,"[['Jackson', 'Adrian', ''], ['Campobasso', 'M. Sergio', '']]","['CFD', 'Harmonic Balance', 'Navier Stokes', 'Parallel', 'Hybrid', 'MPI', 'OpenMP', 'Power Efficiency']"
20515,1710.05749,Shadrokh Samavi,"Farshad Kheiri, Shadrokh Samavi, Nader Karimi",Hardware design for binarization and thinning of fingerprint images,,,,,cs.CV cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Two critical steps in fingerprint recognition are binarization and thinning
of the image. The need for real time processing motivates us to select local
adaptive thresholding approach for the binarization step. We introduce a new
hardware for this purpose based on pipeline architecture. We propose a formula
for selecting an optimal block size for the thresholding purpose. To decrease
minutiae false detection, the binarized image is dilated. We also present in
this paper a new pipeline structure for implementing the thinning algorithm
","[{'version': 'v1', 'created': 'Thu, 12 Oct 2017 19:50:47 GMT'}]",2017-10-17,"[['Kheiri', 'Farshad', ''], ['Samavi', 'Shadrokh', ''], ['Karimi', 'Nader', '']]","['fingerprint', 'binarization', 'thinning', 'dilation', 'pipeline processing   1 Introduction']"
20516,1301.3997,Deepali Virmani,"Deepali Virmani, Satbir Jain","Performance Comparison of Proposed Lifetime Maximizing Trees for Data
  Aggregation in Wireless Sensor Networks","13 pages, 8 figures; International Journal on Computer Science and
  Engineering (IJCSE)Volume 3 Issue 1 2011",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper a packet level simulator is used to explore the performance of
the proposed DLMT and CLMT algorithms under various traffic conditions.
Performance of the proposed algorithms is compared with already existing E-Span
tree structure. These proposed algorithms tend to extend the node lifetime in
order to increase the amount of information gathered by the tree root.
Decentralized lifetime maximizing tree (DLMT) features in nodes with higher
energy to be chosen as data aggregating parents while Centralized Lifetime
Maximizing Tree (CLMT) features with the identification of the bottleneck node
to collect data in a central manner among given set of nodes. By choosing
Forwarded Diffusion as our underlying routing platform the simulations are
carried on J-Sim. Our simulation results have shown that the functional
lifetime of event sources can be enhanced by a maximum of 147% when data is
aggregated via DLMT and by 139% when data is aggregated via CLMT. Our proposed
DLMT algorithm has shown maximum of 13% additional lifetime saving without
increasing the delay. Packet delivery ratio has also shown a remarkable
increase when the tree depth is considered in these proposed tree structures.
Furthermore, the delay is also reduced by using DLMT & CLMT in comparison with
E-Span.
","[{'version': 'v1', 'created': 'Thu, 17 Jan 2013 07:11:32 GMT'}]",2013-01-18,"[['Virmani', 'Deepali', ''], ['Jain', 'Satbir', '']]","['Wireless Sensor Networks', 'Data aggregation', 'E-Span', 'Network lifetime', 'Branch energy']"
20517,1604.07209,Tobias Schnabel,"Tobias Schnabel, Adith Swaminathan, Peter Frazier, Thorsten Joachims",Unbiased Comparative Evaluation of Ranking Functions,Under review; 10 pages,,,,cs.IR cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Eliciting relevance judgments for ranking evaluation is labor-intensive and
costly, motivating careful selection of which documents to judge. Unlike
traditional approaches that make this selection deterministically,
probabilistic sampling has shown intriguing promise since it enables the design
of estimators that are provably unbiased even when reusing data with missing
judgments. In this paper, we first unify and extend these sampling approaches
by viewing the evaluation problem as a Monte Carlo estimation task that applies
to a large number of common IR metrics. Drawing on the theoretical clarity that
this view offers, we tackle three practical evaluation scenarios: comparing two
systems, comparing $k$ systems against a baseline, and ranking $k$ systems. For
each scenario, we derive an estimator and a variance-optimizing sampling
distribution while retaining the strengths of sampling-based evaluation,
including unbiasedness, reusability despite missing data, and ease of use in
practice. In addition to the theoretical contribution, we empirically evaluate
our methods against previously used sampling heuristics and find that they
generally cut the number of required relevance judgments at least in half.
","[{'version': 'v1', 'created': 'Mon, 25 Apr 2016 11:28:21 GMT'}]",2016-04-26,"[['Schnabel', 'Tobias', ''], ['Swaminathan', 'Adith', ''], ['Frazier', 'Peter', ''], ['Joachims', 'Thorsten', '']]","['Importance Sampling', 'Evaluation', 'Crowd Sourcing', 'Pooling']"
20518,1110.5439,Vittorio Bil\`o,Vittorio Bil\`o,"A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in
  Weighted Congestion Games",,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a general technique, based on a primal-dual formulation, for
analyzing the quality of self-emerging solutions in weighted congestion games.
With respect to traditional combinatorial approaches, the primal-dual schema
has at least three advantages: first, it provides an analytic tool which can
always be used to prove tight upper bounds for all the cases in which we are
able to characterize exactly the polyhedron of the solutions under analysis;
secondly, in each such a case the complementary slackness conditions give us an
hint on how to construct matching lower bounding instances; thirdly, proofs
become simpler and easy to check. For the sake of exposition, we first apply
our technique to the problems of bounding the prices of anarchy and stability
of exact and approximate pure Nash equilibria, as well as the approximation
ratio of the solutions achieved after a one-round walk starting from the empty
strategy profile, in the case of affine latency functions and we show how all
the known upper bounds for these measures (and some of their generalizations)
can be easily reobtained under a unified approach. Then, we use the technique
to attack the more challenging setting of polynomial latency functions. In
particular, we obtain the first known upper bounds on the price of stability of
pure Nash equilibria and on the approximation ratio of the solutions achieved
after a one-round walk starting from the empty strategy profile for unweighted
players in the cases of quadratic and cubic latency functions. We believe that
our technique, thanks to its versatility, may prove to be a powerful tool also
in several other applications.
","[{'version': 'v1', 'created': 'Tue, 25 Oct 2011 08:40:32 GMT'}]",2011-10-26,"[['Bilò', 'Vittorio', '']]","['Price of anarchy and stability', 'Performance of one-round walks', '(Approximate) Nash equilibria', 'Congestion games', 'Primal-dual analysis']"
20519,0806.1602,Maurice Margenstern,Margenstern Maurice,"The injectivity of the global function of a cellular automaton in the
  hyperbolic plane is undecidable","9 figures this paper completely solves the problem tackled in
  arXiv:0712.2577v2. This version is simply an improvement of the proof of the
  result deposited in 0806.1602","The Injectivity of the Global Function of a Cellular Automaton in
  the Hyperbolic Plane is Undecidable, Fundamenta Informaticae, 94(1), (2009),
  63-99",,,cs.CG cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we look at the following question. We consider cellular
automata in the hyperbolic plane and we consider the global function defined on
all possible configurations. Is the injectivity of this function undecidable?
The problem was answered positively in the case of the Euclidean plane by
Jarkko Kari, in 1994. In the present paper, we show that the answer is also
positive for the hyperbolic plane: the problem is undecidable.
","[{'version': 'v1', 'created': 'Tue, 10 Jun 2008 10:58:30 GMT'}, {'version': 'v2', 'created': 'Mon, 16 Jun 2008 15:14:03 GMT'}]",2009-07-07,"[['Maurice', 'Margenstern', '']]","['cellular automata', 'hyperbolic plane', 'tessellations']"
20520,1111.1826,Sreenivasa Rao bandla,"R. Satya Prasad, Bandla Sreenivasa Rao, R. R. L. Kantam","Monitoring Software Reliability using Statistical Process control: An
  MMLE approach","International Journal of Computer Science & Information Technology
  (IJCSIT) Vol 3, No 5, Oct 2011",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper consider an MMLE (Modified Maximum Likelihood Estimation) based
scheme to estimate software reliability using exponential distribution. The
MMLE is one of the generalized frameworks of software reliability models of Non
Homogeneous Poisson Processes (NHPPs). The MMLE gives analytical estimators
rather than an iterative approximation to estimate the parameters. In this
paper we proposed SPC (Statistical Process Control) Charts mechanism to
determine the software quality using inter failure times data. The Control
charts can be used to measure whether the software process is statistically
under control or not.
","[{'version': 'v1', 'created': 'Tue, 8 Nov 2011 08:35:03 GMT'}]",2011-11-09,"[['Prasad', 'R. Satya', ''], ['Rao', 'Bandla Sreenivasa', ''], ['Kantam', 'R. R. L.', '']]","['Software Reliability', 'Statistical Process Control', 'Control Charts', 'NHPP', 'Exponential Distribution', 'MMLE', 'Inter Failure Times Data']"
20521,1510.00226,Khan Muhammad,"Khan Muhammad, Zahoor Jan, Jamil Ahmad, Zahid Khan","An Adaptive Secret Key-directed Cryptographic Scheme for Secure
  Transmission in Wireless Sensor Networks","A short paper of 6 pages, proposing an adaptive cryptographic
  technique for secure transmission in WSN. The original paper can be found on
  this link at page 48.
  http://web.uettaxila.edu.pk/techJournal/2015/No3/TECHNICAL_JOURNAL_VOL_20_NO_3.pdf","Technical Journal, University of Engineering and Technology
  Taxila, Pakistan, vol.20, pp.48-53, 2015",,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless Sensor Networks (WSNs) are memory and bandwidth limited networks
whose main goals are to maximize the network lifetime and minimize the energy
consumption and transmission cost. To achieve these goals, dif ferent
techniques of compression and clustering have been used. However, security is
an open and major issue in WSNs for which different approaches are used, both
in centralized and distributed WSNs' environments. This paper presents an
adaptive cryptographic scheme for secure transmission of various sensitive
parameters, sensed by wireless sensors to the fusion center for further
processing in WSNs such as military networks. The proposed method encrypts the
sensitive captured data of sensor nodes using various encryption procedures
(bitxor operation, bits shuffling, and secret key based encryption) and then
sends it to the fusion center. At the fusion center, the received encrypted
data is decrypted for taking further necessary actions. The experimental
results with complexity analysis, validate the effectiveness and feasibility of
the proposed method in terms of security in WSNs.
","[{'version': 'v1', 'created': 'Thu, 1 Oct 2015 13:38:11 GMT'}]",2015-10-02,"[['Muhammad', 'Khan', ''], ['Jan', 'Zahoor', ''], ['Ahmad', 'Jamil', ''], ['Khan', 'Zahid', '']]","['Cryptography', 'Wireless Sensor Networks', 'Sensor Nodes', 'Fusion Center']"
20522,1510.04121,Igor Potapov,Oleksiy Kurganskyy and Igor Potapov,Reachability problems for PAMs,16 pages,,,,cs.NA cs.DS cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Piecewise affine maps (PAMs) are frequently used as a reference model to show
the openness of the reachability questions in other systems. The reachability
problem for one-dimentional PAM is still open even if we define it with only
two intervals. As the main contribution of this paper we introduce new
techniques for solving reachability problems based on p-adic norms and weights
as well as showing decidability for two classes of maps. Then we show the
connections between topological properties for PAM's orbits, reachability
problems and representation of numbers in a rational base system. Finally we
show a particular instance where the uniform distribution of the original orbit
may not remain uniform or even dense after making regular shifts and taking a
fractional part in that sequence.
","[{'version': 'v1', 'created': 'Wed, 14 Oct 2015 14:40:59 GMT'}]",2015-10-15,"[['Kurganskyy', 'Oleksiy', ''], ['Potapov', 'Igor', '']]","['Reachability problems', 'piecewise affine maps (PAMs)', 'βexpansion', 'p-adic analysis']"
20523,1107.3541,Sylvain Lavernhe,"Lo\""ic Andolfatto (LURPA), Sylvain Lavernhe (LURPA), Ren\'e Mayer
  (LRFV)","Evaluation of servo, geometric and dynamic error sources on five axis
  high-speed machine tool","13 pages; International Journal of Machine Tools and Manufacture
  (2011) pp XX-XX",,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Many sources of errors exist in the manufacturing process of complex shapes.
Some approximations occur at each step from the design geometry to the machined
part. The aim of the paper is to present a method to evaluate the effect of
high speed and high dynamic load on volumetric errors at the tool center point.
The interpolator output signals and the machine encoder signals are recorded
and compared to evaluate the contouring errors resulting from each axis
follow-up error. The machine encoder signals are also compared to the actual
tool center point position as recorded with a non-contact measuring instrument
called CapBall to evaluate the total geometric errors. The novelty of the work
lies in the method that is proposed to decompose the geometric errors in two
categories: the quasi-static geometric errors independent from the speed of the
trajectory and the dynamic geometric errors, dependent on the programmed feed
rate and resulting from the machine structure deflection during the
acceleration of its axes. The evolution of the respective contributions for
contouring errors, quasi-static geometric errors and dynamic geomet- ric errors
is experimentally evaluated and a relation between programmed feed rate and
dynamic errors is highlighted.
","[{'version': 'v1', 'created': 'Mon, 18 Jul 2011 19:44:52 GMT'}]",2011-07-19,"[['Andolfatto', 'Loïc', '', 'LURPA'], ['Lavernhe', 'Sylvain', '', 'LURPA'], ['Mayer', 'René', '', 'LRFV']]","['Machine tool', 'geometric errors', 'servo errors', 'dynamic errors', 'high-speed machining']"
20524,1107.4171,Umer Farooq mir,Umer Farooq and M. Aqeel Iqbal,Next Generation High Speed Computing Using Photonic Based Technolog,"8 pages, 9 figures, published in (IJCSE) International Journal on
  Computer Science and Engineering Vol. 02, No. 05, 2010, 1496-1503",,,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the present era of technology computer has facilitated the human life up
to a great extent. The speed of computation has raised to astonish level but
the pace of development of other technologies which have core dependency over
computers have raised relatively exponentially huge, though the computer speed
of computation is very fast with respect to human abilities but still it has to
be increased a lot more to meet the future requirements. We have pushed
electrons to their maximum limit to a stage that nothing further could be
expected from electrons. Alternately one can use photon to replace the
relatively sluggish electrons. An alternate that posses all feature that an
electron holds but only millions of time faster and with a far more reliability
in one way or the other stretching the computers speed to a stage that no one
would have ever even wonder. In this research paper the photonics
implementations in computation industry have been presented along with its
scope as an alternate to electron with comparative study of electron and photon
under the computation perspective, generalized working of silicon based optical
computers, the application of photons and their crucial role in the upcoming
times. Keywords: Photonic Technology, H
","[{'version': 'v1', 'created': 'Thu, 21 Jul 2011 05:55:18 GMT'}]",2011-08-03,"[['Farooq', 'Umer', ''], ['Iqbal', 'M. Aqeel', '']]","['Photonic Technology', 'High Speed Computing', 'Next Generation Computing', 'Silicon Photonic Computers.   I']"
20525,1802.07000,Denis Rystsov,Denis Rystsov,CASPaxos: Replicated State Machines without logs,update style,,,,cs.DC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  CASPaxos is a wait-free, linearizable, multi-writer multi-reader register in
unreliable, asynchronous networks supporting arbitrary update operations
including compare-and-set (CAS). The register acts as a replicated state
machine providing an interface for changing its value by applying an arbitrary
user-provided function (a command). Unlike Multi-Paxos and Raft which replicate
the log of commands, CASPaxos replicates state, thus avoiding associated
complexity, reducing write amplification, increasing concurrency of disk
operations and hardware utilization. The paper describes CASPaxos, proves its
safety properties and evaluates the characteristics of a CASPaxos-based
prototype of key-value storage.
","[{'version': 'v1', 'created': 'Tue, 20 Feb 2018 08:09:38 GMT'}, {'version': 'v2', 'created': 'Wed, 21 Feb 2018 07:22:28 GMT'}, {'version': 'v3', 'created': 'Tue, 27 Feb 2018 18:11:53 GMT'}, {'version': 'v4', 'created': 'Tue, 13 Mar 2018 15:58:22 GMT'}, {'version': 'v5', 'created': 'Fri, 16 Mar 2018 16:42:19 GMT'}, {'version': 'v6', 'created': 'Mon, 26 Mar 2018 03:41:03 GMT'}, {'version': 'v7', 'created': 'Tue, 3 Apr 2018 16:02:27 GMT'}, {'version': 'v8', 'created': 'Thu, 5 Apr 2018 17:32:34 GMT'}, {'version': 'v9', 'created': 'Wed, 16 May 2018 16:52:08 GMT'}]",2018-05-17,"[['Rystsov', 'Denis', '']]","['atomic register', 'linearizability', 'paxos', 'consensus', 'wait-free']"
20526,1003.3661,Michael Nelson,"Herbert Van de Sompel, Robert Sanderson, Michael L. Nelson, Lyudmila
  L. Balakireva, Harihar Shankar, Scott Ainsworth",An HTTP-Based Versioning Mechanism for Linked Data,"Proceedings of Linked Data on the Web (LDOW2010), April 27, 2010,
  Raleigh, USA",,,,cs.DL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Dereferencing a URI returns a representation of the current state of the
resource identified by that URI. But, on the Web representations of prior
states of a resource are also available, for example, as resource versions in
Content Management Systems or archival resources in Web Archives such as the
Internet Archive. This paper introduces a resource versioning mechanism that is
fully based on HTTP and uses datetime as a global version indicator. The
approach allows ""follow your nose"" style navigation both from the current
time-generic resource to associated time-specific version resources as well as
among version resources. The proposed versioning mechanism is congruent with
the Architecture of the World Wide Web, and is based on the Memento framework
that extends HTTP with transparent content negotiation in the datetime
dimension. The paper shows how the versioning approach applies to Linked Data,
and by means of a demonstrator built for DBpedia, it also illustrates how it
can be used to conduct a time-series analysis across versions of Linked Data
descriptions.
","[{'version': 'v1', 'created': 'Thu, 18 Mar 2010 19:21:11 GMT'}]",2010-03-19,"[['Van de Sompel', 'Herbert', ''], ['Sanderson', 'Robert', ''], ['Nelson', 'Michael L.', ''], ['Balakireva', 'Lyudmila L.', ''], ['Shankar', 'Harihar', ''], ['Ainsworth', 'Scott', '']]","['Web Architecture', 'HTTP', 'Linked Data', 'Resource Versioning', 'Web Archiving', 'Temporal Applications']"
20527,1701.08419,Nicolas Ruiz,Nicolas Ruiz,"On some consequences of the permutation paradigm for data anonymization:
  centrality of permutation matrices, universal measures of disclosure risk and
  information loss, evaluation by dominance",,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recently, the permutation paradigm has been proposed in data anonymization to
describe any micro data masking method as permutation, paving the way for
performing meaningful analytical comparisons of methods, something that is
difficult currently in statistical disclosure control research. This paper
explores some consequences of this paradigm by establishing some class of
universal measures of disclosure risk and information loss that can be used for
the evaluation and comparison of any method, under any parametrization and
independently of the characteristics of the data to be anonymized. These
measures lead to the introduction in data anonymization of the concepts of
dominance in disclosure risk and information loss, which formalise the fact
that different parties involved in micro data transaction can all have
different sensitivities to privacy and information.
","[{'version': 'v1', 'created': 'Sun, 29 Jan 2017 19:22:16 GMT'}]",2017-01-31,"[['Ruiz', 'Nicolas', '']]","['data anonymization', 'statistical disclosure control', 'permutation paradigm', 'permutation matrices', 'power means', 'dominance   1']"
20528,0707.3638,Vita Hinze-Hoare,V. Hinze-Hoare,The Review and Analysis of Human Computer Interaction (HCI) Principles,,,,,cs.HC,,"  The History of HCI is briefly reviewed together with three HCI models and
structure including CSCW, CSCL and CSCR. It is shown that a number of
authorities consider HCI to be a fragmented discipline with no agreed set of
unifying design principles. An analysis of usability criteria based upon
citation frequency of authors is performed in order to discover the eight most
recognised HCI principles.
","[{'version': 'v1', 'created': 'Tue, 24 Jul 2007 20:19:47 GMT'}]",2007-07-26,"[['Hinze-Hoare', 'V.', '']]","['HCI', 'CSCW', 'CSCL', 'CSCR', 'Usability']"
20529,1009.3594,Pranjal Awasthi,"Pranjal Awasthi, Avrim Blum and Or Sheffet",Center-based Clustering under Perturbation Stability,,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Clustering under most popular objective functions is NP-hard, even to
approximate well, and so unlikely to be efficiently solvable in the worst case.
Recently, Bilu and Linial \cite{Bilu09} suggested an approach aimed at
bypassing this computational barrier by using properties of instances one might
hope to hold in practice. In particular, they argue that instances in practice
should be stable to small perturbations in the metric space and give an
efficient algorithm for clustering instances of the Max-Cut problem that are
stable to perturbations of size $O(n^{1/2})$. In addition, they conjecture that
instances stable to as little as O(1) perturbations should be solvable in
polynomial time. In this paper we prove that this conjecture is true for any
center-based clustering objective (such as $k$-median, $k$-means, and
$k$-center). Specifically, we show we can efficiently find the optimal
clustering assuming only stability to factor-3 perturbations of the underlying
metric in spaces without Steiner points, and stability to factor $2+\sqrt{3}$
perturbations for general metrics. In particular, we show for such instances
that the popular Single-Linkage algorithm combined with dynamic programming
will find the optimal clustering. We also present NP-hardness results under a
weaker but related condition.
","[{'version': 'v1', 'created': 'Sat, 18 Sep 2010 22:57:43 GMT'}, {'version': 'v2', 'created': 'Thu, 11 Aug 2011 17:52:44 GMT'}]",2011-08-12,"[['Awasthi', 'Pranjal', ''], ['Blum', 'Avrim', ''], ['Sheffet', 'Or', '']]","['Clustering', 'k-median', 'k-means', 'Stability Conditions']"
20530,1603.03837,Gunupudi Rajesh Kumar Mr,"Gunupudi RajeshKumar, N Mangathayaru, G Narsimha",Intrusion Detection A Text Mining Based Approach,"13 pages, 4 figures, Special issue on Computing Applications and Data
  Mining, Paper 01021609, International Journal of Computer Science and
  Information Security (IJCSIS), Vol. 14 S1, February 2016",,,,cs.CR,http://creativecommons.org/licenses/by/4.0/,"  Intrusion Detection is one of major threats for organization. The approach of
intrusion detection using text processing has been one of research interests
which is gaining significant importance from researchers. In text mining based
approach for intrusion detection, system calls serve as source for mining and
predicting possibility of intrusion or attack. When an application runs, there
might be several system calls which are initiated in the background. These
system calls form the strong basis and the deciding factor for intrusion
detection. In this paper, we mainly discuss the approach for intrusion
detection by designing a distance measure which is designed by taking into
consideration the conventional Gaussian function and modified to suit the need
for similarity function. A Framework for intrusion detection is also discussed
as part of this research.
","[{'version': 'v1', 'created': 'Sat, 12 Mar 2016 01:12:08 GMT'}]",2016-03-15,"[['RajeshKumar', 'Gunupudi', ''], ['Mangathayaru', 'N', ''], ['Narsimha', 'G', '']]","['system calls', 'intrusion', 'prediction', 'classification', 'kernel measures']"
20531,0805.2622,Krishnendu Chatterjee,"Krishnendu Chatterjee, Rupak Majumdar and Thomas A. Henzinger",Stochastic Limit-Average Games are in EXPTIME,15 Pages,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The value of a finite-state two-player zero-sum stochastic game with
limit-average payoff can be approximated to within $\epsilon$ in time
exponential in a polynomial in the size of the game times polynomial in
logarithmic in $\frac{1}{\epsilon}$, for all $\epsilon>0$.
","[{'version': 'v1', 'created': 'Fri, 16 May 2008 20:55:08 GMT'}]",2008-12-18,"[['Chatterjee', 'Krishnendu', ''], ['Majumdar', 'Rupak', ''], ['Henzinger', 'Thomas A.', '']]","['Stochastic games', 'Limit-average payoff', 'Computational complexity']"
20532,1111.2313,Sylvain Sen\'e,"Franck Delaplace, Hanna Klaudel, Tarek Melliti and Sylvain Sen\'e","Modular organisation of interaction networks based on asymptotic
  dynamics",,,,,cs.DM q-bio.BM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates questions related to the modularity in discrete
models of biological interaction networks. We develop a theoretical framework
based on the analysis of their asymptotic dynamics. More precisely, we exhibit
formal conditions under which agents of interaction networks can be grouped
into modules. As a main result, we show that the usual decomposition in
strongly connected components fulfils the conditions of being a modular
organisation. Furthermore, we point out that our framework enables a finer
analysis providing a decomposition in elementary modules.
","[{'version': 'v1', 'created': 'Wed, 9 Nov 2011 19:49:20 GMT'}, {'version': 'v2', 'created': 'Sat, 19 Nov 2011 10:45:45 GMT'}, {'version': 'v3', 'created': 'Fri, 13 Jan 2012 09:07:06 GMT'}]",2012-01-16,"[['Delaplace', 'Franck', ''], ['Klaudel', 'Hanna', ''], ['Melliti', 'Tarek', ''], ['Sené', 'Sylvain', '']]","['modularity', 'interaction networks', 'discrete dynamics', 'equilibria']"
20533,1501.01352,Yun Fan,"Yun Fan, Liang Zhang",Iso-Orthogonality and Type II Duadic Constacyclic Codes,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Generalizing even-like duadic cyclic codes and Type-II duadic negacyclic
codes, we introduce even-like (i.e.,Type-II) and odd-like duadic constacyclic
codes, and study their properties and existence. We show that even-like duadic
constacyclic codes are isometrically orthogonal, and the duals of even-like
duadic constacyclic codes are odd-like duadic constacyclic codes. We exhibit
necessary and sufficient conditions for the existence of even-like duadic
constacyclic codes. A class of even-like duadic constacyclic codes which are
alternant MDS-codes is constructed.
","[{'version': 'v1', 'created': 'Wed, 7 Jan 2015 02:40:21 GMT'}, {'version': 'v2', 'created': 'Thu, 15 Jan 2015 15:03:07 GMT'}, {'version': 'v3', 'created': 'Sun, 1 Feb 2015 06:43:42 GMT'}, {'version': 'v4', 'created': 'Tue, 19 Apr 2016 03:02:37 GMT'}]",2016-04-20,"[['Fan', 'Yun', ''], ['Zhang', 'Liang', '']]","['Finite field', 'constacyclic code', 'isometry', 'even-like duadiccode', 'iso-orthogonal code']"
20534,1105.0491,Jocelyne Troccaz,"Le Bellego Gael (TIMC), Marek Bucki (TIMC), Ivan Bricault (TIMC),
  Jocelyne Troccaz (TIMC)",Using a smart phone for information rendering in Computer-Aided Surgery,,"Human-Computer Interaction International 2011, HCII'2011, Orlando
  : United States (2011)",,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer-aided surgery intensively uses the concept of navigation: after
having collected CT data from a patient and transferred them to the operating
room coordinate system, the surgical instrument (a puncture needle for
instance) is localized and its position is visualized with respect to the
patient organs which are not directly visible. This approach is very similar to
the GPS paradigm. Traditionally, three orthogonal slices in the patient data
are presented on a distant screen. Sometimes a 3D representation is also added.
In this study we evaluated the potential of adding a smart phone as a
man-machine interaction device. Different experiments involving operators
puncturing a phantom are reported in this paper.
","[{'version': 'v1', 'created': 'Tue, 3 May 2011 07:07:44 GMT'}]",2011-05-04,"[['Gael', 'Le Bellego', '', 'TIMC'], ['Bucki', 'Marek', '', 'TIMC'], ['Bricault', 'Ivan', '', 'TIMC'], ['Troccaz', 'Jocelyne', '', 'TIMC']]","['distant display', 'smart phone', 'physical interface']"
20535,1004.0744,Valentin Brimkov,Valentin E. Brimkov,"Patrolling a Street Network is Strongly NP-Complete but in P for Tree
  Structures",,,,,cs.CG cs.CC cs.DM cs.DS math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the following problem: Given a finite set of straight line
segments in the plane, determine the positions of a minimal number of points on
the segments, from which guards can see all segments. This problem can be
interpreted as looking for a minimal number of locations of policemen, guards,
cameras or other sensors, that can observe a network of streets, corridors,
tunnels, tubes, etc. We show that the problem is strongly NP-complete even for
a set of segments with a cubic graph structure, but in P for tree structures.
","[{'version': 'v1', 'created': 'Tue, 6 Apr 2010 01:06:27 GMT'}]",2015-03-14,"[['Brimkov', 'Valentin E.', '']]","['art gallery problem', 'guarding set of segments', 'strongly NPcomplete problem', 'polynomial algorithm']"
20536,1607.02784,Duc-Thuan Vo,Duc-Thuan Vo and Ebrahim Bagheri,Open Information Extraction,This paper will appear in the Encyclopedia for Semantic Computing,,,,cs.CL cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Open Information Extraction (Open IE) systems aim to obtain relation tuples
with highly scalable extraction in portable across domain by identifying a
variety of relation phrases and their arguments in arbitrary sentences. The
first generation of Open IE learns linear chain models based on unlexicalized
features such as Part-of-Speech (POS) or shallow tags to label the intermediate
words between pair of potential arguments for identifying extractable
relations. Open IE currently is developed in the second generation that is able
to extract instances of the most frequently observed relation types such as
Verb, Noun and Prep, Verb and Prep, and Infinitive with deep linguistic
analysis. They expose simple yet principled ways in which verbs express
relationships in linguistics such as verb phrase-based extraction or
clause-based extraction. They obtain a significantly higher performance over
previous systems in the first generation. In this paper, we describe an
overview of two Open IE generations including strengths, weaknesses and
application areas.
","[{'version': 'v1', 'created': 'Sun, 10 Jul 2016 20:39:24 GMT'}]",2016-07-12,"[['Vo', 'Duc-Thuan', ''], ['Bagheri', 'Ebrahim', '']]","['Open Information Extraction', 'Natural Language Processing', 'Verb Phrase-based Extraction', 'Clause-based Extraction']"
20537,1412.3271,Etienne Payet,Fred Mesnard and Etienne Payet,A Second-Order Formulation of Non-Termination,8 pages,,,,cs.LO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider the termination/non-termination property of a class of loops.
Such loops are commonly used abstractions of real program pieces. Second-order
logic is a convenient language to express non-termination. Of course, such
property is generally undecidable. However, by restricting the language to
known decidable cases, we exhibit new classes of loops, the non-termination of
which is decidable. We present a bunch of examples.
","[{'version': 'v1', 'created': 'Wed, 10 Dec 2014 11:58:18 GMT'}]",2014-12-11,"[['Mesnard', 'Fred', ''], ['Payet', 'Etienne', '']]","['Termination', 'non-termination', 'monadic second-order logic']"
20538,0806.4749,Alexandr Savinov,Alexandr Savinov,Nested Ordered Sets and their Use for Data Modelling,"15 pages, 4 figures",,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present a new approach to data modelling, called the
concept-oriented model (CoM), and describe its main features and
characteristics including data semantics and operations. The distinguishing
feature of this model is that it is based on the formalism of nested ordered
sets where any element participates in two structures simultaneously:
hierarchical (nested) and multi-dimensional (ordered). An element of the model
is postulated to consist of two parts, called identity and entity, and the
whole approach can be naturally broken into two branches: identity modelling
and entity modelling. We also propose a new query language with the main
construct, called concept, defined as a pair of two classes: identity class and
entity class. We describe how its operations of projection, de-projection and
product can be used to solve typical data modelling tasks.
","[{'version': 'v1', 'created': 'Sun, 29 Jun 2008 11:38:06 GMT'}]",2008-07-01,"[['Savinov', 'Alexandr', '']]","['data modelling', 'concept-oriented model', 'nested ordered sets', 'dimension', 'logical navigation', 'multi-dimensional analysis']"
20539,1604.07529,Jichang Zhao,"Zhenkun Zhou, Jichang Zhao and Ke Xu",Can Online Emotions Predict the Stock Market in China?,,,,,cs.SI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Whether the online social media, like Twitter or its variant Weibo, can be a
convincing proxy to predict the stock market has been debated for years,
especially for China. However, as the traditional theory in behavioral finance
states, the individual emotions can influence decision-making of investors, so
it is reasonable to further explore this controversial topic from the
perspective of online emotions, which is richly carried by massive tweets in
social media. Surprisingly, through thorough study on over 10 million
stock-relevant tweets from Weibo, both correlation analysis and causality test
show that five attributes of the stock market in China can be competently
predicted by various online emotions, like disgust, joy, sadness and fear.
Specifically, the presented model significantly outperforms the baseline
solutions on predicting five attributes of the stock market under the $K$-means
discretization. We also employ this model in the scenario of realistic online
application and its performance is further testified.
","[{'version': 'v1', 'created': 'Tue, 26 Apr 2016 05:50:20 GMT'}, {'version': 'v2', 'created': 'Thu, 28 Apr 2016 11:17:50 GMT'}]",2016-04-29,"[['Zhou', 'Zhenkun', ''], ['Zhao', 'Jichang', ''], ['Xu', 'Ke', '']]","['Social Media', 'Stock Market', 'Sentiment Analysis', 'PredictModels', 'Discretization']"
20540,1010.3640,Steffen Kopecki,Steffen Kopecki,On the Iterated Hairpin Completion,,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The (bounded) hairpin completion and its iterated versions are operations on
formal lan- guages which have been inspired by the hairpin formation in
DNA-biochemistry. The paper answers two questions asked in the literature about
the iterated hairpin completion.
  The first question is whether the class of regular languages is closed under
iterated bounded hairpin completion. Here we show that this is true by
providing a more general result which applies to all the classes of languages
which are closed under finite union, intersection with regular sets, and
concatenation with regular sets. In particular, all Chomsky classes and all
standard complexity classes are closed under iterated bounded hairpin
completion.
  In the second part of the paper we address the question whether the iterated
hairpin completion of a singleton is always regular. In contrast to the first
question, this one has a negative answer. We exhibit an example of a singleton
language whose iterated hairpin completion is not regular, actually it is not
context-free, but context-sensitive.
","[{'version': 'v1', 'created': 'Mon, 18 Oct 2010 16:03:40 GMT'}, {'version': 'v2', 'created': 'Tue, 25 Jan 2011 15:01:54 GMT'}, {'version': 'v3', 'created': 'Wed, 9 Mar 2011 17:37:35 GMT'}]",2015-03-17,"[['Kopecki', 'Steffen', '']]","['Formal languages', 'Finite automata', 'Hairpin completion', 'Bounded hairpin completion']"
20541,1607.00869,Vinu E V,"Vinu E.V, Tahani Alsubait, P. Sreenivasa Kumar",Modeling of Item-Difficulty for Ontology-based MCQs,Under review,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Multiple choice questions (MCQs) that can be generated from a domain ontology
can significantly reduce human effort & time required for authoring &
administering assessments in an e-Learning environment. Even though here are
various methods for generating MCQs from ontologies, methods for determining
the difficulty-levels of such MCQs are less explored. In this paper, we study
various aspects and factors that are involved in determining the
difficulty-score of an MCQ, and propose an ontology-based model for the
prediction. This model characterizes the difficulty values associated with the
stem and choice set of the MCQs, and describes a measure which combines both
the scores. Further more, the notion of assigning difficultly-scores based on
the skill level of the test taker is utilized for predicating difficulty-score
of a stem. We studied the effectiveness of the predicted difficulty-scores with
the help of a psychometric model from the Item Response Theory, by involving
real-students and domain experts. Our results show that, the predicated
difficulty-levels of the MCQs are having high correlation with their actual
difficulty-levels.
","[{'version': 'v1', 'created': 'Mon, 4 Jul 2016 13:05:55 GMT'}]",2016-07-05,"[['E.', 'Vinu', 'V'], ['Alsubait', 'Tahani', ''], ['Kumar', 'P. Sreenivasa', '']]","['MCQ generation', 'ontologies', 'assessment tests', 'difficulty-level of MCQs']"
20542,1603.07689,Kapil Ahuja,"Pramod Mane, Kapil Ahuja, Nagarajan Krishnamurthy","Stability, Efficiency, and Contentedness of Social Storage Networks","38 Pages, 7 Figures, and 4 Tables",,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social storage systems are a good alternative to existing data backup systems
of local, centralized, and P2P backup. In this paper, we look at two untouched
aspects of social storage systems. One aspect involves modelling social storage
as an endogenous social network, where agents themselves decide with whom they
want to build data backup relation. The second aspect involves studying the
stability of social storage systems, which would help reduce maintenance costs
and further, help build efficient as well as contented networks.
  We have a four fold contribution that covers the above two aspects. We,
first, model the social storage system as a strategic network formation game.
We define the utility of each agent in the network under two different
frameworks. Second, we propose the concept of bilateral stability which refines
the pairwise stability concept defined by Jackson et. al. 1996, by requiring
mutual consent for both addition and deletion of links, as compared to mutual
consent just for link addition. Mutual consent for link deletion is especially
important in the social storage setting. Third, we prove necessary and the
sufficient conditions for bilateral stability of social storage networks. For
symmetric social storage networks, we prove that there exists a unique
neighborhood size, independent of the number of agents (for all non-trivial
cases), where no pair of agents has any incentive to increase or decrease their
neighborhood size. We call this neighborhood size as the stability point.
Fourth, given the number of agents and other parameters, we discuss which
bilaterally stable networks would evolve and also discuss which of these stable
networks are efficient --- that is, stable networks with maximum sum of
utilities of all agents. We also discuss ways to build contented networks,
where each agent achieves the maximum possible utility.
","[{'version': 'v1', 'created': 'Thu, 24 Mar 2016 18:05:34 GMT'}, {'version': 'v2', 'created': 'Wed, 14 Sep 2016 19:22:06 GMT'}, {'version': 'v3', 'created': 'Sat, 14 Jan 2017 08:54:45 GMT'}, {'version': 'v4', 'created': 'Sun, 8 Apr 2018 10:32:28 GMT'}, {'version': 'v5', 'created': 'Tue, 10 Apr 2018 08:31:08 GMT'}]",2018-04-11,"[['Mane', 'Pramod', ''], ['Ahuja', 'Kapil', ''], ['Krishnamurthy', 'Nagarajan', '']]","['Social Storage', 'Endogenous Network Formation', 'Bilateral Stability', 'Pairwise Stability', 'F2F Backup System', 'Peer-to-Peer System']"
20543,1409.7489,Jisun An,"Jisun An, Daniele Quercia, Jon Crowcroft",Recommending Investors for Crowdfunding Projects,Published in Proc. of WWW 2014,,,,cs.SI cs.CY cs.HC physics.soc-ph stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To bring their innovative ideas to market, those embarking in new ventures
have to raise money, and, to do so, they have often resorted to banks and
venture capitalists. Nowadays, they have an additional option: that of
crowdfunding. The name refers to the idea that funds come from a network of
people on the Internet who are passionate about supporting others' projects.
One of the most popular crowdfunding sites is Kickstarter. In it, creators post
descriptions of their projects and advertise them on social media sites (mainly
Twitter), while investors look for projects to support. The most common reason
for project failure is the inability of founders to connect with a sufficient
number of investors, and that is mainly because hitherto there has not been any
automatic way of matching creators and investors. We thus set out to propose
different ways of recommending investors found on Twitter for specific
Kickstarter projects. We do so by conducting hypothesis-driven analyses of
pledging behavior and translate the corresponding findings into different
recommendation strategies. The best strategy achieves, on average, 84% of
accuracy in predicting a list of potential investors' Twitter accounts for any
given project. Our findings also produced key insights about the whys and
wherefores of investors deciding to support innovative efforts.
","[{'version': 'v1', 'created': 'Fri, 26 Sep 2014 07:57:28 GMT'}, {'version': 'v2', 'created': 'Sun, 12 Oct 2014 11:23:36 GMT'}]",2014-10-14,"[['An', 'Jisun', ''], ['Quercia', 'Daniele', ''], ['Crowcroft', 'Jon', '']]","['Kickstarter', 'Twitter', 'Crowdfunding', 'Recommending systems']"
20544,0712.2923,Roumen Anguelov,"Roumen Anguelov, Inger Plaskitt",A Class of LULU Operators on Multi-Dimensional Arrays,,,,,cs.CV,,"  The LULU operators for sequences are extended to multi-dimensional arrays via
the morphological concept of connection in a way which preserves their
essential properties, e.g. they are separators and form a four element fully
ordered semi-group. The power of the operators is demonstrated by deriving a
total variation preserving discrete pulse decomposition of images.
","[{'version': 'v1', 'created': 'Tue, 18 Dec 2007 10:43:23 GMT'}]",2007-12-19,"[['Anguelov', 'Roumen', ''], ['Plaskitt', 'Inger', '']]","['LULU', 'connection', 'separator', 'discrete pulse transform', 'total variation']"
20545,1501.02892,V.P. Binu,V.P. Binu and A. Sreekumar,Lossless Secret Image Sharing Schemes,"International Journal of Computational Intelligence and Information
  Security Vol. 4 April 2013, ISSN: 1837-7823",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Secret image sharing deals with splitting confidential images into several
shares and the original image can be reconstructed from the qualified subset of
the shares. Secret sharing schemes are used in transmission and storage of
private medical images and military secrets. Increased confidentiality and
availability are the major achievements. We propose an efficient (2, 2) scheme
and (2, 3) scheme for secret image sharing. The scheme is lossless and also the
share size is same as the secret size. The sharing and revealing phase uses
simple modular arithmetic which can be very easily implemented. Experimental
results on Binary and Gray scale images show that the proposed scheme is secure
and efficient.
","[{'version': 'v1', 'created': 'Tue, 13 Jan 2015 07:06:40 GMT'}]",2015-01-14,"[['Binu', 'V. P.', ''], ['Sreekumar', 'A.', '']]","['Secret sharing', 'secret image sharing', 'lossless reveal  1']"
20546,0909.3028,Emmanuel Prochasson,"Emmanuel Prochasson (LINA), Emmanuel Morin (LINA), Christian
  Viard-Gaudin (IRCCyN)",Vers la reconnaissance de mini-messages manuscrits,,"Colloque International sur le Lexique et la Grammaire, Bonifacio :
  France (2007)",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Handwriting is an alternative method for entering texts which composed Short
Message Services. However, a whole new language features the texts which are
produced. They include for instance abbreviations and other consonantal writing
which sprung up for time saving and fashion. We have collected and processed a
significant number of such handwritten SMS, and used various strategies to
tackle this challenging area of handwriting recognition. We proposed to study
more specifically three different phenomena: consonant skeleton, rebus, and
phonetic writing. For each of them, we compare the rough results produced by a
standard recognition system with those obtained when using a specific language
model to take care of them.
","[{'version': 'v1', 'created': 'Wed, 16 Sep 2009 14:39:05 GMT'}]",2009-09-17,"[['Prochasson', 'Emmanuel', '', 'LINA'], ['Morin', 'Emmanuel', '', 'LINA'], ['Viard-Gaudin', 'Christian', '', 'IRCCyN']]","['Short Message Service', 'Handwriting Short Message Services', 'language models']"
20547,1105.2461,Sebastien Tixeuil,"St\'ephane Devismes (VERIMAG - IMAG), Anissa Lamani (MIS), Franck
  Petit (LIP6, INRIA Rocquencourt), Pascal Raymond (VERIMAG - IMAG),
  S\'ebastien Tixeuil (LIP6, IUF)",Optimal grid exploration by asynchronous oblivious robots,27 pages,,,,cs.DC cs.DM cs.NI cs.RO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We consider a team of {\em autonomous weak robots} that are endowed with
visibility sensors and motion actuators. Autonomous means that the team cannot
rely on any kind of central coordination mechanism or scheduler. By weak we
mean that the robots are devoid of (1) any (observable) IDs allowing to
differentiate them (anonymous), (2) means of communication allowing them to
communicate directly, and (3) any way to remember any previous observation nor
computation performed in any previous step (oblivious). Robots asynchronously
operate in cycles of three phases: Look, Compute, and Move. Furthermore, the
network is an anonymous unoriented grid. In such settings, the robots must
collaborate to solve a collective task, here the terminating grid exploration
(exploration for short), despite being limited with respect to input from the
environment, asymmetry, memory, etc. Exploration requires that robots explore
the grid and stop when the task is complete. We propose optimal (w.r.t. the
number of robots) solutions for the deterministic terminating exploration of a
grid shaped network by a team of $k$ asynchronous oblivious robots in the fully
asynchronous and non-atomic model, so called CORDA. In more details, we first
assume the ATOM model in which each Look-Compute-Move cycle execution is
executed atomically, ie every robot that is activated at instant t
instantaneously executes a full cycle between t and t+1. ATOM being strictly
stronger than CORDA, all impossibility results in ATOM also hold in CORDA. We
show that it is impossible to explore a grid of at least three nodes with less
than three robots in ATOM. (This first result holds for both deterministic and
probabilistic settings.) Next, we show that it is impossible to
deterministically explore a (2,2)-Grid with less than 4 robots, and a
(3,3)-Grid with less than 5 robots, respectively. Then, we propose
deterministic algorithms in CORDA to exhibit the optimal number of robots
allowing to explore of a given grid. Our results show that except in two
particular cases, 3 robots are necessary and sufficient to deterministically
explore a grid of at least three nodes. The optimal number of robots for the
two remaining cases is: 4 for the (2,2)-Grid and 5 for the (3,3)-Grid.
","[{'version': 'v1', 'created': 'Thu, 12 May 2011 13:08:17 GMT'}, {'version': 'v2', 'created': 'Mon, 23 Jan 2012 14:20:33 GMT'}, {'version': 'v3', 'created': 'Wed, 7 Mar 2012 20:36:23 GMT'}]",2012-03-08,"[['Devismes', 'Stéphane', '', 'VERIMAG - IMAG'], ['Lamani', 'Anissa', '', 'MIS'], ['Petit', 'Franck', '', 'LIP6, INRIA Rocquencourt'], ['Raymond', 'Pascal', '', 'VERIMAG - IMAG'], ['Tixeuil', 'Sébastien', '', 'LIP6, IUF']]","['Exploration', 'Grid', 'Oblivious Robots', 'CORDA model']"
20548,1205.1638,Aji S,"Aji S, Ramachandra Kaimal",Document summarization using positive pointwise mutual information,,,,,cs.IR cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The degree of success in document summarization processes depends on the
performance of the method used in identifying significant sentences in the
documents. The collection of unique words characterizes the major signature of
the document, and forms the basis for Term-Sentence-Matrix (TSM). The Positive
Pointwise Mutual Information, which works well for measuring semantic
similarity in the Term-Sentence-Matrix, is used in our method to assign weights
for each entry in the Term-Sentence-Matrix. The Sentence-Rank-Matrix generated
from this weighted TSM, is then used to extract a summary from the document.
Our experiments show that such a method would outperform most of the existing
methods in producing summaries from large documents.
","[{'version': 'v1', 'created': 'Tue, 8 May 2012 09:19:10 GMT'}]",2012-05-09,"[['S', 'Aji', ''], ['Kaimal', 'Ramachandra', '']]","['Data mining', 'text mining', 'document summarization', 'Positive Pointwise Mutual Information', 'TermSentence-Matrix']"
20549,0704.1198,Minkyu Kim,"Minkyu Kim, Varun Aggarwal, Una-May O'Reilly, Muriel Medard",A Doubly Distributed Genetic Algorithm for Network Coding,"8 pages, 7 figures, accepted to the Genetic and Evolutionary
  Computation Conference (GECCO 2007)",,,,cs.NE cs.NI,,"  We present a genetic algorithm which is distributed in two novel ways: along
genotype and temporal axes. Our algorithm first distributes, for every member
of the population, a subset of the genotype to each network node, rather than a
subset of the population to each. This genotype distribution is shown to offer
a significant gain in running time. Then, for efficient use of the
computational resources in the network, our algorithm divides the candidate
solutions into pipelined sets and thus the distribution is in the temporal
domain, rather that in the spatial domain. This temporal distribution may lead
to temporal inconsistency in selection and replacement, however our experiments
yield better efficiency in terms of the time to convergence without incurring
significant penalties.
","[{'version': 'v1', 'created': 'Tue, 10 Apr 2007 13:36:44 GMT'}]",2007-05-23,"[['Kim', 'Minkyu', ''], ['Aggarwal', 'Varun', ''], [""O'Reilly"", 'Una-May', ''], ['Medard', 'Muriel', '']]","['Distributed genetic algorithm', 'network coding', 'optimization']"
20550,1005.3224,Amparo F\'uster-Sabater,Amparo F\'uster-Sabater,Cellular Automata in Stream Ciphers,"26 pages, 1 figure","Contemporary Mathematics, Volume 477, pp. 1-20, 2009",,,cs.CR cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A wide family of nonlinear sequence generators, the so-called
clock-controlled shrinking generators, has been analyzed and identified with a
subset of linear cellular automata. The algorithm that converts the given
generator into a linear model based on automata is very simple and can be
applied in a range of practical interest. Due to the linearity of these
automata as well as the characteristics of this class of generators, a
cryptanalytic approach can be proposed. Linear cellular structures easily model
keystream generators with application in stream cipher cryptography.
","[{'version': 'v1', 'created': 'Tue, 18 May 2010 15:11:19 GMT'}]",2010-05-19,"[['Fúster-Sabater', 'Amparo', '']]","['Cellular automata', 'clock-controlled generators', 'sequencereconstruction', 'cryptography']"
20551,1307.0278,Dmitriy Malyshev Sergeevich,Dmitriy Malyshev,The coloring problem for classes with two small obstructions,,,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The coloring problem is studied in the paper for graph classes defined by two
small forbidden induced subgraphs. We prove some sufficient conditions for
effective solvability of the problem in such classes. As their corollary we
determine the computational complexity for all sets of two connected forbidden
induced subgraphs with at most five vertices except 13 explicitly enumerated
cases
","[{'version': 'v1', 'created': 'Mon, 1 Jul 2013 07:00:51 GMT'}]",2013-07-02,"[['Malyshev', 'Dmitriy', '']]","['vertex coloring', 'computational complexity', 'polynomialtime algorithm']"
20552,1603.01179,Michel  Habib,"Finn V\""olkel and Eric bapteste and Michel Habib and Philippe Lopez
  and Chloe Vigliotti",Read networks and k-laminar graphs,,,,,cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we introduce k-laminar graphs a new class of graphs which
extends the idea of Asteroidal triple free graphs. Indeed a graph is k-laminar
if it admits a diametral path that is k-dominating. This bio-inspired class of
graphs was motivated by a biological application dealing with sequence
similarity networks of reads (called hereafter read networks for short). We
briefly develop the context of the biological application in which this graph
class appeared and then we consider the relationships of this new graph class
among known graph classes and then we study its recognition problem. For the
recognition of k-laminar graphs, we develop polynomial algorithms when k is
fixed. For k=1, our algorithm improves a Deogun and Krastch's algorithm (1999).
We finish by an NP-completeness result when k is unbounded.
","[{'version': 'v1', 'created': 'Thu, 3 Mar 2016 17:06:14 GMT'}]",2016-03-04,"[['Völkel', 'Finn', ''], ['bapteste', 'Eric', ''], ['Habib', 'Michel', ''], ['Lopez', 'Philippe', ''], ['Vigliotti', 'Chloe', '']]","['diameter', 'asteroidal triple', 'diametral path graphs', 'k-dominating paths', 'klaminar graphs', '(meta)genomic sequences', 'reads', 'read networks']"
20553,2007.05216,Sajan Kedia,"Sajan Kedia, Samyak Jain, Abhishek Sharma",Price Optimization in Fashion E-commerce,"8 pages, 6 figures, AI for fashion supply chain Conference",,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rapid growth in the fashion e-commerce industry, it is becoming
extremely challenging for the E-tailers to set an optimal price point for all
the products on the platform. By establishing an optimal price point, they can
maximize overall revenue and profit for the platform. In this paper, we propose
a novel machine learning and optimization technique to find the optimal price
point at an individual product level. It comprises three major components.
Firstly, we use a demand prediction model to predict the next day demand for
each product at a certain discount percentage. Next step, we use the concept of
price elasticity of demand to get the multiple demand values by varying the
discount percentage. Thus we obtain multiple price demand pairs for each
product and we have to choose one of them for the live platform. Typically
fashion e-commerce has millions of products, so there can be many permutations.
Each permutation will assign a unique price point for all the products, which
will sum up to a unique revenue number. To choose the best permutation which
gives maximum revenue, a linear programming optimization technique is used. We
have deployed the above methods in the live production environment and
conducted several AB tests. According to the AB test result, our model is
improving the revenue by 1 percent and gross margin by 0.81 percent.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 07:40:28 GMT'}, {'version': 'v2', 'created': 'Mon, 24 Aug 2020 10:18:53 GMT'}]",2020-08-25,"[['Kedia', 'Sajan', ''], ['Jain', 'Samyak', ''], ['Sharma', 'Abhishek', '']]","['Pricing', 'Demand Prediction', 'Price Elasticity ofDemand', 'Linear Programming', 'Optimization', 'Regression']"
20554,1312.2990,Angelos Vasilakopoulos,"Foto N. Afrati, Dimitris Fotakis, Angelos Vasilakopoulos",Efficient Lineage for SUM Aggregate Queries,,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  AI systems typically make decisions and find patterns in data based on the
computation of aggregate and specifically sum functions, expressed as queries,
on data's attributes. This computation can become costly or even inefficient
when these queries concern the whole or big parts of the data and especially
when we are dealing with big data. New types of intelligent analytics require
also the explanation of why something happened. In this paper we present a
randomised algorithm that constructs a small summary of the data, called
Aggregate Lineage, which can approximate well and explain all sums with large
values in time that depends only on its size. The size of Aggregate Lineage is
practically independent on the size of the original data. Our algorithm does
not assume any knowledge on the set of sum queries to be approximated.
","[{'version': 'v1', 'created': 'Tue, 10 Dec 2013 22:48:02 GMT'}, {'version': 'v2', 'created': 'Mon, 9 Jun 2014 21:56:49 GMT'}]",2014-06-11,"[['Afrati', 'Foto N.', ''], ['Fotakis', 'Dimitris', ''], ['Vasilakopoulos', 'Angelos', '']]","['Artificial Intelligence', 'Databases', 'Aggregate Queries', 'Database Lineage', 'Query Approximation', 'Randomised Algorithms']"
20555,1704.01806,Henrique Oliveira Santos,"Paulo Pinheiro, Deborah L. McGuinness, Henrique Santos","Human-Aware Sensor Network Ontology: Semantic Support for Empirical Data
  Collection","In Proceedings of the 5th Workshop on Linked Science 2015 - Best
  Practices and the Road Ahead (LISC 2015)",,,,cs.AI cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Significant efforts have been made to understand and document knowledge
related to scientific measurements. Many of those efforts resulted in one or
more high-quality ontologies that describe some aspects of scientific
measurements, but not in a comprehensive and coherently integrated manner. For
instance, we note that many of these high-quality ontologies are not properly
aligned, and more challenging, that they have different and often conflicting
concepts and approaches for encoding knowledge about empirical measurements. As
a result of this lack of an integrated view, it is often challenging for
scientists to determine whether any two scientific measurements were taken in
semantically compatible manners, thus making it difficult to decide whether
measurements should be analyzed in combination or not. In this paper, we
present the Human-Aware Sensor Network Ontology that is a comprehensive
alignment and integration of a sensing infrastructure ontology and a provenance
ontology. HASNetO has been under development for more than one year, and has
been reviewed, shared and used by multiple scientific communities. The ontology
has been in use to support the data management of a number of large-scale
ecological monitoring activities (observations) and empirical experiments.
","[{'version': 'v1', 'created': 'Thu, 6 Apr 2017 12:36:45 GMT'}]",2017-04-07,"[['Pinheiro', 'Paulo', ''], ['McGuinness', 'Deborah L.', ''], ['Santos', 'Henrique', '']]","['empirical data integration', 'data quality', 'measurement semantics', 'HASNetO']"
20556,0908.2661,Pooyan Fazli,"Pooyan Fazli, Alan K. Mackworth",Human-Robot Teams in Entertainment and Other Everyday Scenarios,,,,,cs.MA cs.CY cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A new and relatively unexplored research direction in robotics systems is the
coordination of humans and robots working as a team. In this paper, we focus
upon problem domains and tasks in which multiple robots, humans and other
agents are cooperating through coordination to satisfy a set of goals or to
maximize utility. We are primarily interested in applications of human robot
coordination in entertainment and other activities of daily life. We discuss
the teamwork problem and propose an architecture to address this.
","[{'version': 'v1', 'created': 'Wed, 19 Aug 2009 02:29:28 GMT'}]",2009-08-20,"[['Fazli', 'Pooyan', ''], ['Mackworth', 'Alan K.', '']]","['Robot-Human-Agent Teams', 'Robot-Human-Agent Team Coordination and Cooperation', 'Robot-Human-Agent Planning', 'Entertainment Industry']"
20557,1610.02373,Mohamad Ivan Fanany,"Arif Budiman, Mohamad Ivan Fanany, Chan Basaruddin",Distributed Averaging CNN-ELM for Big Data,"Submitted to IEEE Transactions on Systems, Man and Cybernetics:
  Systems",,,SMCA-16-09-1039,cs.LG cs.CV cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Increasing the scalability of machine learning to handle big volume of data
is a challenging task. The scale up approach has some limitations. In this
paper, we proposed a scale out approach for CNN-ELM based on MapReduce on
classifier level. Map process is the CNN-ELM training for certain partition of
data. It involves many CNN-ELM models that can be trained asynchronously.
Reduce process is the averaging of all CNN-ELM weights as final training
result. This approach can save a lot of training time than single CNN-ELM
models trained alone. This approach also increased the scalability of machine
learning by combining scale out and scale up approaches. We verified our method
in extended MNIST data set and not-MNIST data set experiment. However, it has
some drawbacks by additional iteration learning parameters that need to be
carefully taken and training data distribution that need to be carefully
selected. Further researches to use more complex image data set are required.
","[{'version': 'v1', 'created': 'Fri, 7 Oct 2016 18:59:23 GMT'}]",2016-10-10,"[['Budiman', 'Arif', ''], ['Fanany', 'Mohamad Ivan', ''], ['Basaruddin', 'Chan', '']]","['deep learning', 'extreme learning machine', 'convolutional', 'neural network', 'big data', 'map reduce']"
20558,1111.2530,Ramesh Cindha,"C. Ramesh, K. V. Chalapati Rao, A. Govardhan",A semantically enriched web usage based recommendation model,,"International Journal of Computer Science & Information Technology
  (IJCSIT) Vol 3, No 5, Oct 2011, 193-202",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  With the rapid growth of internet technologies, Web has become a huge
repository of information and keeps growing exponentially under no editorial
control. However the human capability to read, access and understand Web
content remains constant. This motivated researchers to provide Web
personalized online services such as Web recommendations to alleviate the
information overload problem and provide tailored Web experiences to the Web
users. Recent studies show that Web usage mining has emerged as a popular
approach in providing Web personalization. However conventional Web usage based
recommender systems are limited in their ability to use the domain knowledge of
the Web application. The focus is only on Web usage data. As a consequence the
quality of the discovered patterns is low. In this paper, we propose a novel
framework integrating semantic information in the Web usage mining process.
Sequential Pattern Mining technique is applied over the semantic space to
discover the frequent sequential patterns. The frequent navigational patterns
are extracted in the form of Ontology instances instead of Web page views and
the resultant semantic patterns are used for generating Web page
recommendations to the user. Experimental results shown are promising and
proved that incorporating semantic information into Web usage mining process
can provide us with more interesting patterns which consequently make the
recommendation system more functional, smarter and comprehensive.
","[{'version': 'v1', 'created': 'Thu, 10 Nov 2011 17:34:05 GMT'}]",2011-11-11,"[['Ramesh', 'C.', ''], ['Rao', 'K. V. Chalapati', ''], ['Govardhan', 'A.', '']]","['Web Usage Mining', 'Semantic Web', 'Domain Ontology', 'Sequential Pattern Mining', 'Recommender Systems']"
20559,1212.5554,Morgan Barbier,Morgan Barbier (GREYC),Re-encoding reformulation and application to Welch-Berlekamp algorithm,,"Re-encoding reformulation and application to Welch-Berlekamp
  algorithm (2014) 1782 - 1786",,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The main decoding algorithms for Reed-Solomon codes are based on a bivariate
interpolation step, which is expensive in time complexity. Lot of interpolation
methods were proposed in order to decrease the complexity of this procedure,
but they stay still expensive. Then Koetter, Ma and Vardy proposed in 2010 a
technique, called re-encoding, which allows to reduce the practical running
time. However, this trick is only devoted for the Koetter interpolation
algorithm. We propose a reformulation of the re-encoding for any interpolation
methods. The assumption for this reformulation permits only to apply it to the
Welch-Berlekamp algorithm.
","[{'version': 'v1', 'created': 'Fri, 21 Dec 2012 18:53:42 GMT'}, {'version': 'v2', 'created': 'Fri, 11 Jul 2014 16:55:28 GMT'}]",2014-07-14,"[['Barbier', 'Morgan', '', 'GREYC']]","['Reed-Solomon codes', 'Welch-Berlekamp algorithm', 'Re-encoding']"
20560,1312.7085,Peng Lu,"Peng Lu, Xujun Peng, Xinshan Zhu, Xiaojie Wang","Finding More Relevance: Propagating Similarity on Markov Random Field
  for Image Retrieval",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  To effectively retrieve objects from large corpus with high accuracy is a
challenge task. In this paper, we propose a method that propagates visual
feature level similarities on a Markov random field (MRF) to obtain a high
level correspondence in image space for image pairs. The proposed
correspondence between image pair reflects not only the similarity of low-level
visual features but also the relations built through other images in the
database and it can be easily integrated into the existing
bag-of-visual-words(BoW) based systems to reduce the missing rate. We evaluate
our method on the standard Oxford-5K, Oxford-105K and Paris-6K dataset. The
experiment results show that the proposed method significantly improves the
retrieval accuracy on three datasets and exceeds the current state-of-the-art
retrieval performance.
","[{'version': 'v1', 'created': 'Thu, 26 Dec 2013 10:55:14 GMT'}]",2013-12-30,"[['Lu', 'Peng', ''], ['Peng', 'Xujun', ''], ['Zhu', 'Xinshan', ''], ['Wang', 'Xiaojie', '']]","['image retrieval', 'bag-of-visual-words', 'Markov random field']"
20561,1505.03934,Giancarlo Crocetti,Giancarlo Crocetti,Textual Spatial Cosine Similarity,"4 pages, 4 tables. Proceedings of 12th Annual Research Day, 2014 -
  Pace University",,,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  When dealing with document similarity many methods exist today, like cosine
similarity. More complex methods are also available based on the semantic
analysis of textual information, which are computationally expensive and rarely
used in the real time feeding of content as in enterprise-wide search
environments. To address these real-time constraints, we developed a new
measure of document similarity called Textual Spatial Cosine Similarity, which
is able to detect similitude at the semantic level using word placement
information contained in the document. We will see in this paper that two
degenerate cases exist for this model, which coincide with Cosine Similarity on
one side and with a paraphrasing detection model to the other.
","[{'version': 'v1', 'created': 'Fri, 15 May 2015 01:08:57 GMT'}]",2015-05-18,"[['Crocetti', 'Giancarlo', '']]","['Natural Language Processing', 'document similarity', 'vector model', 'cosine distance']"
20562,0909.3444,Jonathan Marchand,"Jonathan Marchand (INRIA Lorraine - LORIA), Bruno Guillaume (INRIA
  Lorraine - LORIA), Guy Perrier (INRIA Lorraine - LORIA)",Analyse en d\'ependances \`a l'aide des grammaires d'interaction,,"Traitement Automatique des Langues Naturelles, Senlis : France
  (2009)",,,cs.CL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This article proposes a method to extract dependency structures from
phrase-structure level parsing with Interaction Grammars. Interaction Grammars
are a formalism which expresses interactions among words using a polarity
system. Syntactical composition is led by the saturation of polarities.
Interactions take place between constituents, but as grammars are lexicalized,
these interactions can be translated at the level of words. Dependency
relations are extracted from the parsing process: every dependency is the
consequence of a polarity saturation. The dependency relations we obtain can be
seen as a refinement of the usual dependency tree. Generally speaking, this
work sheds new light on links between phrase structure and dependency parsing.
","[{'version': 'v1', 'created': 'Fri, 18 Sep 2009 14:23:05 GMT'}]",2009-09-21,"[['Marchand', 'Jonathan', '', 'INRIA Lorraine - LORIA'], ['Guillaume', 'Bruno', '', 'INRIA\n  Lorraine - LORIA'], ['Perrier', 'Guy', '', 'INRIA Lorraine - LORIA']]","['Syntactic analysis', 'dependency grammars', 'interaction grammars', 'polarity']"
20563,1603.06038,Evgeny Frolov,Evgeny Frolov and Ivan Oseledets,Tensor Methods and Recommender Systems,"Submitted to WIREs Data Mining and Knowledge Discovery. 41 page, 3
  figures, 2 tables",,,,cs.LG cs.IR stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A substantial progress in development of new and efficient tensor
factorization techniques has led to an extensive research of their
applicability in recommender systems field. Tensor-based recommender models
push the boundaries of traditional collaborative filtering techniques by taking
into account a multifaceted nature of real environments, which allows to
produce more accurate, situational (e.g. context-aware, criteria-driven)
recommendations. Despite the promising results, tensor-based methods are poorly
covered in existing recommender systems surveys. This survey aims to complement
previous works and provide a comprehensive overview on the subject. To the best
of our knowledge, this is the first attempt to consolidate studies from various
application domains in an easily readable, digestible format, which helps to
get a notion of the current state of the field. We also provide a high level
discussion of the future perspectives and directions for further improvement of
tensor-based recommendation systems.
","[{'version': 'v1', 'created': 'Sat, 19 Mar 2016 03:38:47 GMT'}, {'version': 'v2', 'created': 'Sun, 18 Feb 2018 14:44:44 GMT'}]",2018-02-20,"[['Frolov', 'Evgeny', ''], ['Oseledets', 'Ivan', '']]","['collaborative filtering', 'tensor factorization', 'tensor decompositions', 'context-aware recommender systems']"
20564,1602.07255,Lei You,Lei You and Di Yuan,"Load Optimization with User Association in Cooperative and Load-Coupled
  LTE Networks","13 pages, 6 figures",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We extend the problem of optimizing user association for load balancing in
cellular networks along two dimensions. First, we consider joint transmission
(JT), which is one of the coordinated multipoint (CoMP) techniques, with which
a user may be simultaneously served by multiple base stations. Second, we
account for, mathematically, the coupling relation between the base stations'
load levels that are dependent on each other due to inter-cell interference. We
formulate two optimization problems, sum load minimization (MinSumL) and
maximum load minimization (MinMaxL). We prove that both MinSumL and MinMaxL are
NP-hard. We propose a mixed integer linear programming (MILP) based scheme by
means of linearization. This approach also leads to a bounding scheme for
performance benchmarking. Then, we derive a set of partial optimality
conditions. Fulfillment of the conditions will guarantee performance
improvement for both MinSumL and MinMaxL. A solution algorithm is then derived
based on the conditions. Simulation results are provided to demonstrate the
effectiveness of the approaches.
","[{'version': 'v1', 'created': 'Tue, 23 Feb 2016 18:21:06 GMT'}, {'version': 'v2', 'created': 'Sun, 13 Nov 2016 22:52:27 GMT'}, {'version': 'v3', 'created': 'Wed, 21 Jun 2017 22:37:02 GMT'}, {'version': 'v4', 'created': 'Fri, 23 Jun 2017 09:14:21 GMT'}]",2017-06-26,"[['You', 'Lei', ''], ['Yuan', 'Di', '']]","['joint transmission', 'load balancing', 'load-coupling', 'heteroge']"
20565,1707.08715,Madhusudan Singh Ph.D.,Madhusudan Singh and Shiho Kim,Safety Requirement Specifications for Connected Vehicles,"5 pages, 5 figures, 1 table",,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the coming years, transportation system will be revamped in a manner that
there will be more intelligent and autonomous vehicle phenomenon around us such
as smart cars, auto driving system, etc. Some of automotive industries are
already producing smart cars. However, the main concern of this paper is on the
infrastructure for connected vehicles, which can support such intelligent
transportation. Current transportation system lacks proper infrastructure to
support connected vehicles. Hence, in this article, we have surveyed and
analyzed the current transportation system in developed and developing
countries. In contrast, we are going to introduce secure intelligent
transportation (roadside) infrastructure that is user centric (Driver,
Autonomous driver etc.) for connected vehicles. In this paper we present the
basic requirements of safety engineering infrastructure of roadside
infrastructure in ITS for connected vehicles. Connected vehicles has network
infrastructure to communicate with vehicle-to-vehicle (V-to-V),
vehicle-to-infrastructure (V-to-I), lane correction system, and traffic
information system etc. The connected vehicle is a good model for learning
demands of infrastructure for ITS process because the system having a lot of
use-cases and we must understand relationship between public institutions,
people, companies in order to proceed ITS System.
","[{'version': 'v1', 'created': 'Thu, 27 Jul 2017 05:56:50 GMT'}, {'version': 'v2', 'created': 'Fri, 28 Jul 2017 07:15:38 GMT'}]",2017-07-31,"[['Singh', 'Madhusudan', ''], ['Kim', 'Shiho', '']]","['Connected Vehicles; Requirement Engineering; Safety', 'driving', 'ITS']"
20566,1307.3026,Hema Latha S,"S. Hemalatha, U. Dinesh Acharya, A. Renuka","Comparison of secure and high capacity color image steganography
  techniques in RGB and YCbCr domains","Journal, 9 pages","International Journal of Advanced Information Technology (IJAIT)
  Vol. 3, No. 3, June 2013",,,cs.MM cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Steganography is one of the methods used for secret communication.
Steganography attempts to hide the existence of the information. The object
used to hide the secret information is called as cover object. Images are the
most popular cover objects used for steganography. Different techniques have to
be used for color image steganography and grey scale image steganography since
they are stored in different ways. Color image are normally stored with 24 bit
depth and grey scale images are stored with 8 bit depth. Color images can hold
large amount of secret information since they have three color components.
Different color spaces namely RGB (Red Green Blue), HSV (Hue, Saturation,
Value), YUV, YIQ, YCbCr (Luminance, Chrominance) etc. are used to represent
color images. Color image steganography can be done in any color space domain.
In this paper color image steganography in RGB and YCbCr domain are compared.
The secret information considered is grey scale image. Since RGB is the common
method of representation, hiding secret information in this format is not
secure.
","[{'version': 'v1', 'created': 'Thu, 11 Jul 2013 09:26:21 GMT'}]",2013-07-12,"[['Hemalatha', 'S.', ''], ['Acharya', 'U. Dinesh', ''], ['Renuka', 'A.', '']]","['Steganography', 'Integer Wavelet Transform (IWT)', 'MSE', 'PSNR', 'RGB', 'YCbCr', 'Luminance', 'Chrominance']"
20567,2007.05722,Takashi Oya,"Takashi Oya, Shohei Iwase, Ryota Natsume, Takahiro Itazuri, Shugo
  Yamaguchi, Shigeo Morishima",Do We Need Sound for Sound Source Localization?,"Paper: 14 pages, 6 figures. Supplementary Material: 6 pages, 3
  figures. Videos and Codes will be released later",,,,cs.CV cs.SD eess.AS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  During the performance of sound source localization which uses both visual
and aural information, it presently remains unclear how much either image or
sound modalities contribute to the result, i.e. do we need both image and sound
for sound source localization? To address this question, we develop an
unsupervised learning system that solves sound source localization by
decomposing this task into two steps: (i) ""potential sound source
localization"", a step that localizes possible sound sources using only visual
information (ii) ""object selection"", a step that identifies which objects are
actually sounding using aural information. Our overall system achieves
state-of-the-art performance in sound source localization, and more
importantly, we find that despite the constraint on available information, the
results of (i) achieve similar performance. From this observation and further
experiments, we show that visual information is dominant in ""sound"" source
localization when evaluated with the currently adopted benchmark dataset.
Moreover, we show that the majority of sound-producing objects within the
samples in this dataset can be inherently identified using only visual
information, and thus that the dataset is inadequate to evaluate a system's
capability to leverage aural information. As an alternative, we present an
evaluation protocol that enforces both visual and aural information to be
leveraged, and verify this property through several experiments.
","[{'version': 'v1', 'created': 'Sat, 11 Jul 2020 08:57:58 GMT'}]",2020-07-14,"[['Oya', 'Takashi', ''], ['Iwase', 'Shohei', ''], ['Natsume', 'Ryota', ''], ['Itazuri', 'Takahiro', ''], ['Yamaguchi', 'Shugo', ''], ['Morishima', 'Shigeo', '']]","['cross-modal learning', 'sound source localization', 'unsupervised learning']"
20568,1002.2858,Massimo Franceschet,Massimo Franceschet,PageRank: Standing on the shoulders of giants,,,,,cs.IR cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  PageRank is a Web page ranking technique that has been a fundamental
ingredient in the development and success of the Google search engine. The
method is still one of the many signals that Google uses to determine which
pages are most important. The main idea behind PageRank is to determine the
importance of a Web page in terms of the importance assigned to the pages
hyperlinking to it. In fact, this thesis is not new, and has been previously
successfully exploited in different contexts. We review the PageRank method and
link it to some renowned previous techniques that we have found in the fields
of Web information retrieval, bibliometrics, sociometry, and econometrics.
","[{'version': 'v1', 'created': 'Mon, 15 Feb 2010 12:47:16 GMT'}, {'version': 'v2', 'created': 'Wed, 23 Jun 2010 15:15:50 GMT'}, {'version': 'v3', 'created': 'Sat, 14 Aug 2010 15:14:13 GMT'}]",2010-08-17,"[['Franceschet', 'Massimo', '']]","['PageRank', 'Web information retrieval', 'Bibliometrics', 'Sociometry', 'Econometrics']"
20569,1502.04538,Dongeun Lee,"Dongeun Lee, Rafael Lima, and Jaesik Choi",Improving Imprecise Compressive Sensing Models,,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Random sampling in compressive sensing (CS) enables the compression of large
amounts of input signals in an efficient manner, which is useful for many
applications. CS reconstructs the compressed signals exactly with overwhelming
probability when incoming data can be sparsely represented with a few
components. However, the theory of CS framework including random sampling has
been focused on exact recovery of signal; impreciseness in signal recovery has
been neglected. This can be problematic when there is uncertainty in the number
of sparse components such as signal sparsity in dynamic systems that can change
over time. We present a new theoretical framework that handles uncertainty in
signal recovery from the perspective of recovery success and quality. We show
that the signal recovery success in our model is more accurate than the success
probability analysis in the CS framework. Our model is then extended to the
case where the success or failure of signal recovery can be relaxed. We
represent the number of components included in signal recovery with a
right-tailed distribution and focus on recovery quality. Experimental results
confirm the accuracy of our model in dynamic systems.
","[{'version': 'v1', 'created': 'Mon, 16 Feb 2015 14:00:55 GMT'}, {'version': 'v2', 'created': 'Fri, 3 Jul 2015 14:20:20 GMT'}, {'version': 'v3', 'created': 'Sun, 20 Mar 2016 03:33:05 GMT'}]",2016-03-22,"[['Lee', 'Dongeun', ''], ['Lima', 'Rafael', ''], ['Choi', 'Jaesik', '']]","['Compressive sensing', 'random sampling', 'dynamic signal sparsity', 'sparse signal recovery']"
20570,1604.06849,Shiwali Mohan,"Shiwali Mohan, James Kirk, John Laird","A Computational Model for Situated Task Learning with Interactive
  Instruction","International Conference on Cognitive Modeling, 2013",,,,cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Learning novel tasks is a complex cognitive activity requiring the learner to
acquire diverse declarative and procedural knowledge. Prior ACT-R models of
acquiring task knowledge from instruction focused on learning procedural
knowledge from declarative instructions encoded in semantic memory. In this
paper, we identify the requirements for designing compu- tational models that
learn task knowledge from situated task- oriented interactions with an expert
and then describe and evaluate a model of learning from situated interactive
instruc- tion that is implemented in the Soar cognitive architecture.
","[{'version': 'v1', 'created': 'Sat, 23 Apr 2016 02:23:14 GMT'}]",2016-04-26,"[['Mohan', 'Shiwali', ''], ['Kirk', 'James', ''], ['Laird', 'John', '']]","['task learning', 'instruction', 'cognitive architecture']"
20571,1510.07244,"Steffen B\""orm","Steffen B\""orm and Sven Christophersen","Approximation of boundary element matrices using GPGPUs and nested cross
  approximation",,,,,cs.MS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The efficiency of boundary element methods depends crucially on the time
required for setting up the stiffness matrix. The far-field part of the matrix
can be approximated by compression schemes like the fast multipole method or
$\mathcal{H}$-matrix techniques. The near-field part is typically approximated
by special quadrature rules like the Sauter-Schwab technique that can handle
the singular integrals appearing in the diagonal and near-diagonal matrix
elements.
  Since computing one element of the matrix requires only a small amount of
data but a fairly large number of operations, we propose to use general-purpose
graphics processing units (GPGPUs) to handle vectorizable portions of the
computation: near-field computations are ideally suited for vectorization and
can therefore be handled very well by GPGPUs. Modern far-field compression
schemes can be split into a small adaptive portion that exhibits divergent
control flows, and should therefore be handled by the CPU, and a vectorizable
portion that can again be sent to GPGPUs.
  We propose a hybrid algorithm that splits the computation into tasks for CPUs
and GPGPUs. Our method presented in this article is able to reduce the setup
time of boundary integral operators by a significant factor of 19-30 for both
the Laplace and the Helmholtz equation in 3D when using two consumer GPGPUs
compared to a quad-core CPU.
","[{'version': 'v1', 'created': 'Sun, 25 Oct 2015 13:27:11 GMT'}, {'version': 'v2', 'created': 'Wed, 18 Oct 2017 15:52:08 GMT'}]",2017-10-19,"[['Börm', 'Steffen', ''], ['Christophersen', 'Sven', '']]","['Boundary element method', 'GPGPU', 'hierarchical matrix']"
20572,1403.6741,Avi Zanko,"Avi Zanko, Amir Leshem, Ephraim Zehavi","Network coding for multicasting over Rayleigh fading multi access
  channels",,,,,cs.NI cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper examines the problem of rate allocation for multicasting over slow
Rayleigh fading channels using network coding. In the proposed model, the
network is treated as a collection of Rayleigh fading multiple access channels.
In this model, rate allocation scheme that is based solely on the statistics of
the channels is presented. The rate allocation scheme is aimed at minimizing
the outage probability. An upper bound is presented for the probability of
outage in the fading multiple access channel. A suboptimal solution based on
this bound is given. A distributed primal-dual gradient algorithm is derived to
solve the rate allocation problem.
","[{'version': 'v1', 'created': 'Wed, 26 Mar 2014 16:39:44 GMT'}]",2014-03-27,"[['Zanko', 'Avi', ''], ['Leshem', 'Amir', ''], ['Zehavi', 'Ephraim', '']]","['Network coding for multicasting', 'wireless networks', 'outagecapacity', 'Rayleigh fading', 'multiple access channels']"
20573,1407.2877,William Casey,William Casey and Aaron Shelmire,"Signature Limits: An Entire Map of Clone Features and their Discovery in
  Nearly Linear Time","17 pages, 4 figures, 3 tables",,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We address the problem of creating entire and complete maps of software code
clones (copy features in data) in a corpus of binary artifacts of unknown
provenance. We report on a practical methodology, which employs enhanced suffix
data structures and partial orderings of clones to compute a compact
representation of most interesting clones features in data. The enumeration of
clone features is useful for malware triage and prioritization when human
exploration, testing and verification is the most costly factor. We further
show that the enhanced arrays may be used for discovery of provenance relations
in data and we introduce two distinct Jaccard similarity coefficients to
measure code similarity in binary artifacts. We illustrate the use of these
tools on real malware data including a retro-diction experiment for measuring
and enumerating evidence supporting common provenance in {\it Stuxnet} and {\it
Duqu}. The results indicate the practicality and efficacy of mapping completely
the clone features in data.
","[{'version': 'v1', 'created': 'Thu, 10 Jul 2014 17:45:59 GMT'}]",2014-07-11,"[['Casey', 'William', ''], ['Shelmire', 'Aaron', '']]","['Algorithm Design', 'Security', 'Analysis of Software Artifacts']"
20574,1506.01910,Kunal  Sankhe,"Kunal Sankhe, Chandan Pradhan, Sumit Kumar, Garimella Ramamurthy",Machine Learning Based Cooperative Relay Selection in Virtual MIMO,"6 Pages, 8 figures, 3 tables, Accepted in Wireless Telecommunications
  Symposium 2015 and available in WTS 2015 proceedings",,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In cellular systems, virtual multiple-input multiple-output (V-MIMO)
technology promises to achieve performance gains comparable to conventional
MIMO. In this paper, we propose cooperative relay selection algorithm based on
machine learning techniques. Willingness of user to cooperate in V-MIMO depends
on his current battery power, time and day along with incentives offered by
service provider. Every user has different criterion to participate in V-MIMO,
but allows a specific behavior pattern. Therefore, it is required to predict
willing users in the neighborhood of source user (SU), before selecting users
as cooperative nodes. Only inactive users belonging to Virtual Antenna Array
(VAA) cell of SU are assumed to cooperate. This reduces control overheads in
cooperative node discovery. In this paper, we employ prediction algorithm using
two machine learning techniques i.e. ANN and SVM to find out inactive willing
users within VAA cell. The parameters such as MSE, accuracy, precision and
recall are calculated to evaluate performance of ANN and SVM model. Prediction
using ANN has MSE of 3% with average accuracy of 97% (variance 0.37), whereas
SVM has MSE of 2.58% with average accuracy of 97.56% (variance 0.17). We also
observe that proposed prediction method reduces the node discovery time by
approximately 29%.
","[{'version': 'v1', 'created': 'Fri, 5 Jun 2015 13:42:41 GMT'}]",2015-06-08,"[['Sankhe', 'Kunal', ''], ['Pradhan', 'Chandan', ''], ['Kumar', 'Sumit', ''], ['Ramamurthy', 'Garimella', '']]","['Virtual MIMO', 'Virtual Antenna Array', 'Artificial Neural network', 'Support Vector Machine']"
20575,1506.09060,Anum Ali,"Ebrahim B. Al-Safadi, Tareq Y. Al-Naffouri, Mudassir Masood, Anum Ali","Nonlinear Distortion Reduction in OFDM from Reliable Perturbations in
  Data Carriers","27 pages, 11 Figures",,,,cs.IT math.IT stat.AP,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A novel method for correcting the effect of nonlinear distortion in
orthogonal frequency division multiplexing signals is proposed. The method
depends on adaptively selecting the distortion over a subset of the data
carriers, and then using tools from compressed sensing and sparse Bayesian
recovery to estimate the distortion over the other carriers. Central to this
method is the fact that carriers (or tones) are decoded with different levels
of confidence, depending on a coupled function of the magnitude and phase of
the distortion over each carrier, in addition to the respective channel
strength. Moreover, as no pilots are required by this method, a significant
improvement in terms of achievable rate can be achieved relative to previous
work.
","[{'version': 'v1', 'created': 'Tue, 30 Jun 2015 12:34:11 GMT'}]",2015-07-01,"[['Al-Safadi', 'Ebrahim B.', ''], ['Al-Naffouri', 'Tareq Y.', ''], ['Masood', 'Mudassir', ''], ['Ali', 'Anum', '']]","['OFDM', 'peak-to-average power ratio reduction', 'data-aidedclipping mitigation', 'sparse Bayesian recovery', 'nonlinear distortion', 'compressedsensing']"
20576,1009.0971,Kiran Kumar B,"B. Kiran Kumar and A. Bhaskar (Department of M.C.A., Kakatiya
  Institute of Technology & Science, A.P., INDIA)",ETP-Mine: An Efficient Method for Mining Transitional Patterns,11 pages,"International Journal of Database Management Systems (IJDMS) ISSN
  : 0975-5705, August,2010",,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  A Transaction database contains a set of transactions along with items and
their associated timestamps. Transitional patterns are the patterns which
specify the dynamic behavior of frequent patterns in a transaction database. To
discover transitional patterns and their significant milestones, first we have
to extract all frequent patterns and their supports using any frequent pattern
generation algorithm. These frequent patterns are used in the generation of
transitional patterns. The existing algorithm (TP-Mine) generates frequent
patterns, some of which cannot be used in generation of transitional patterns.
In this paper, we propose a modification to the existing algorithm, which
prunes the candidate items to be used in the generation of frequent patterns.
This method drastically reduces the number of frequent patterns which are used
in discovering transitional patterns. Extensive simulation test is done to
evaluate the proposed method.
","[{'version': 'v1', 'created': 'Mon, 6 Sep 2010 05:46:18 GMT'}]",2014-10-09,"[['Kumar', 'B. Kiran', '', 'Department of M.C.A., Kakatiya\n  Institute of Technology & Science, A.P., INDIA'], ['Bhaskar', 'A.', '', 'Department of M.C.A., Kakatiya\n  Institute of Technology & Science, A.P., INDIA']]","['Frequent Patterns', 'Association Rules', 'Transitional Patterns', 'Significant milestones']"
20577,1802.09055,Ahmed Fadhil,Ahmed Fadhil,"Domain Specific Design Patterns: Designing For Conversational User
  Interfaces",7 pages,,,,cs.HC,http://creativecommons.org/licenses/by-nc-sa/4.0/,"  Designing conversational user interface experience is complicated because
conversation comes with many expectations. When these expectations are met, we
feel the interface is natural, but once violated, we feel something is amiss.
The last decade witnessed human language technologies and behaviours to enable
humans converse with software using spoken dialogue to access, create and
process information. Less is known about the practicalities of designing
chatbot interactions. In this paper, we introduce the nature of conversational
user interfaces (CUIs) and describe the underlying technologies they are based
on. Moreover, we define guidelines for designing conversational interfaces in
various domains. This paper particularly focuses on classifying the elements
and techniques used in CUI design patterns. After concluding certain challenges
with CUI, we discuss important features and chatbot states to be considered in
CUI design for specific domain. We envisage this study to support CUI
researchers to design tailored chatbots applicable into certain domain and
improve the current state of research challenges in the field of Artificial
Intelligence and conversational agents.
","[{'version': 'v1', 'created': 'Sun, 25 Feb 2018 18:26:45 GMT'}]",2018-02-27,"[['Fadhil', 'Ahmed', '']]","['User Experience', 'User-centred Design', 'Design Pat']"
20578,0906.3490,Mugurel Ionut Andreica,"Mugurel Ionut Andreica, Madalina Ecaterina Andreica, Costel Visan","Optimal Constrained Resource Allocation Strategies under Low Risk
  Circumstances",,"Metalurgia International, vol. 14, special issue no. 8, pp.
  143-154, 2009. (ISSN: 1582-2214)",,,cs.DS cs.CG cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we consider multiple constrained resource allocation problems,
where the constraints can be specified by formulating activity dependency
restrictions or by using game-theoretic models. All the problems are focused on
generic resources, with a few exceptions which consider financial resources in
particular. The problems consider low-risk circumstances and the values of the
uncertain variables which are used by the algorithms are the expected values of
the variables. For each of the considered problems we propose novel algorithmic
solutions for computing optimal resource allocation strategies. The presented
solutions are optimal or near-optimal from the perspective of their time
complexity. The considered problems have applications in a broad range of
domains, like workflow scheduling in industry (e.g. in the mining and
metallurgical industry) or the financial sector, motion planning, facility
location and data transfer or job scheduling and resource management in Grids,
clouds or other distributed systems.
","[{'version': 'v1', 'created': 'Thu, 18 Jun 2009 17:52:41 GMT'}]",2009-06-19,"[['Andreica', 'Mugurel Ionut', ''], ['Andreica', 'Madalina Ecaterina', ''], ['Visan', 'Costel', '']]","['Resource Allocation', 'Workflow Scheduling', 'Directed Tree', 'Game-Theoretic Models', 'Geometric Constraints']"
20579,0803.2842,Shai  Gutner,"Noga Alon, Yossi Azar, Shai Gutner","Admission Control to Minimize Rejections and Online Set Cover with
  Repetitions",,"Proc. of 17th SPAA (2005), 238-244",,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study the admission control problem in general networks. Communication
requests arrive over time, and the online algorithm accepts or rejects each
request while maintaining the capacity limitations of the network. The
admission control problem has been usually analyzed as a benefit problem, where
the goal is to devise an online algorithm that accepts the maximum number of
requests possible. The problem with this objective function is that even
algorithms with optimal competitive ratios may reject almost all of the
requests, when it would have been possible to reject only a few. This could be
inappropriate for settings in which rejections are intended to be rare events.
  In this paper, we consider preemptive online algorithms whose goal is to
minimize the number of rejected requests. Each request arrives together with
the path it should be routed on. We show an $O(\log^2 (mc))$-competitive
randomized algorithm for the weighted case, where $m$ is the number of edges in
the graph and $c$ is the maximum edge capacity. For the unweighted case, we
give an $O(\log m \log c)$-competitive randomized algorithm. This settles an
open question of Blum, Kalai and Kleinberg raised in \cite{BlKaKl01}. We note
that allowing preemption and handling requests with given paths are essential
for avoiding trivial lower bounds.
","[{'version': 'v1', 'created': 'Wed, 19 Mar 2008 16:53:42 GMT'}]",2008-12-18,"[['Alon', 'Noga', ''], ['Azar', 'Yossi', ''], ['Gutner', 'Shai', '']]","['On-line', 'Competitive', 'Admission control', 'Set Cover']"
20580,1510.04908,Pascal Mettes,"Pascal Mettes, Jan C. van Gemert, Cees G. M. Snoek",No Spare Parts: Sharing Part Detectors for Image Categorization,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work aims for image categorization using a representation of distinctive
parts. Different from existing part-based work, we argue that parts are
naturally shared between image categories and should be modeled as such. We
motivate our approach with a quantitative and qualitative analysis by
backtracking where selected parts come from. Our analysis shows that in
addition to the category parts defining the class, the parts coming from the
background context and parts from other image categories improve categorization
performance. Part selection should not be done separately for each category,
but instead be shared and optimized over all categories. To incorporate part
sharing between categories, we present an algorithm based on AdaBoost to
jointly optimize part sharing and selection, as well as fusion with the global
image representation. We achieve results competitive to the state-of-the-art on
object, scene, and action categories, further improving over deep convolutional
neural networks.
","[{'version': 'v1', 'created': 'Fri, 16 Oct 2015 15:05:41 GMT'}, {'version': 'v2', 'created': 'Tue, 12 Jul 2016 17:05:27 GMT'}]",2016-07-13,"[['Mettes', 'Pascal', ''], ['van Gemert', 'Jan C.', ''], ['Snoek', 'Cees G. M.', '']]","['Image categorization', 'Discriminative parts', 'Part sharing']"
20581,1512.00971,Madan Mohan Rayguru,Madan Mohan Rayguru and I N Kar,"Contraction based stabilization of nonlinear singularly perturbed
  systems and application to high gain feedback",,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Recent development of contraction theory based analysis of singularly
perturbed system has opened the door for inspecting differential behavior of
multi time-scale systems. In this paper a contraction theory based framework is
proposed for stabilization of singularly perturbed systems. The primary
objective is to design a feedback controller to achieve bounded tracking error
for both standard and non-standard singularly perturbed systems. This framework
provides relaxation over traditional quadratic Lyapunov based method as there
is no need to satisfy interconnection conditions during controller design
algorithm. Moreover, the stability bound does not depend on smallness of
singularly perturbed parameter. Combined with high gain scaling, the proposed
technique is shown to assure contraction of approximate feedback linearizable
systems. These findings extend the class of nonlinear systems which can be made
contracting.
","[{'version': 'v1', 'created': 'Thu, 3 Dec 2015 07:19:42 GMT'}]",2015-12-04,"[['Rayguru', 'Madan Mohan', ''], ['Kar', 'I N', '']]","['Contraction Theory', 'Singular Perturbation', 'High Gain Feedback', 'Approximate FeedbackLinearizable Systems', 'Composite Controller Design']"
20582,1409.7060,Bernhard Rumpe,"Bernhard Rumpe, Peter Scholz",A manager's view on large scale XP projects,"4 pages, 3 figures. arXiv admin note: substantial text overlap with
  arXiv:1409.6604","Third International Conference on Extreme Programming and Flexible
  Processes in Software Engineering, XP2002, May 26-30, Alghero, Italy, pg.
  158-159, 2002",,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  XP is a code oriented, light weight software engineering methodology, suited
merely for small sized teams who develop software that relies on vague or
rapidly changing requirements. Being very code oriented, the discipline of
systems engineering knows it as approach of incremental system change. In this
contribution, we discuss the enhanced version of a concept on how to extend XP
on large scale projects with hundreds of software engineers and programmers,
respectively. A previous version was already presented in [1]. The basic idea
is to apply the ""hierarchical approach"", a management principle of reorganizing
companies, as well as well known moderation principles to XP project
organization. We show similarities between software engineering methods and
company reorganization processes and discuss how the elements of the
hierarchical approach can improve XP. We provide guidelines on how to scale up
XP to very large projects e.g. those common in telecommunication industry and
IT technology consultancy firms by using moderation techniques.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 17:51:10 GMT'}]",2014-09-25,"[['Rumpe', 'Bernhard', ''], ['Scholz', 'Peter', '']]","['XP', 'reorganization', 'project organization', 'project management', 'hierarchical approach']"
20583,2007.05361,Le Hui,"Le Hui, Rui Xu, Jin Xie, Jianjun Qian, Jian Yang",Progressive Point Cloud Deconvolution Generation Network,Accepted to ECCV 2020; Project page: https://github.com/fpthink/PDGN,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose an effective point cloud generation method, which
can generate multi-resolution point clouds of the same shape from a latent
vector. Specifically, we develop a novel progressive deconvolution network with
the learning-based bilateral interpolation. The learning-based bilateral
interpolation is performed in the spatial and feature spaces of point clouds so
that local geometric structure information of point clouds can be exploited.
Starting from the low-resolution point clouds, with the bilateral interpolation
and max-pooling operations, the deconvolution network can progressively output
high-resolution local and global feature maps. By concatenating different
resolutions of local and global feature maps, we employ the multi-layer
perceptron as the generation network to generate multi-resolution point clouds.
In order to keep the shapes of different resolutions of point clouds
consistent, we propose a shape-preserving adversarial loss to train the point
cloud deconvolution generation network. Experimental results demonstrate the
effectiveness of our proposed method.
","[{'version': 'v1', 'created': 'Fri, 10 Jul 2020 13:07:00 GMT'}]",2020-07-13,"[['Hui', 'Le', ''], ['Xu', 'Rui', ''], ['Xie', 'Jin', ''], ['Qian', 'Jianjun', ''], ['Yang', 'Jian', '']]","['Point cloud generation', 'GAN', 'deep learning', 'deconvolutionnetwork']"
20584,1412.6767,Marina Maslennikova,"Marina Maslennikova, Emanuele Rodaro","Representation of (Left) Ideal Regular Languages by Synchronizing
  Automata",,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We follow language theoretic approach to synchronizing automata and
\v{C}ern\'{y}'s conjecture initiated in a series of recent papers. We find a
precise lower bound for the reset complexity of a principal ideal languages.
Also we show a strict connection between principal left ideals and
synchronizing automata. We characterize regular languages whose minimal
deterministic finite automaton is synchronizing and possesses a reset word
belonging to the recognized language.
","[{'version': 'v1', 'created': 'Sun, 21 Dec 2014 11:56:11 GMT'}]",2014-12-23,"[['Maslennikova', 'Marina', ''], ['Rodaro', 'Emanuele', '']]","['ideal language', 'synchronizing automaton', 'reset word', 'resetcomplexity', 'reset left regular decomposition', 'strongly connected automaton']"
20585,1702.01270,Matej Mertik,"Matej Mertik, Maciej Wielgosz","A Conceptual Framework for Supporting a Rapid Design of Web Applications
  for Data Analysis of Electrical Quality Assurance Data for the LHC","14 pages, 5 figures",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The Large Hadron Collider (LHC) is one of the most complex machines ever
build. It is composed of many components which constitute a large system. The
tunnel and the accelerator is just one of a very critical fraction of the whole
LHC infrastructure. Hardware comissioning as one of the critical processes
before running the LHC is implemented during the Long Shutdown (LS) states of
the macine, where Electrical Quality Assurance (ELQA) is one of its key
components. Here a huge data is collected when implementing various ELQA
electrical tests. In this paper we present a conceptual framework for
supporting a rapid design of web applications for ELQA data analysis. We show a
framework's main components, their possible integration with other systems and
machine learning algorithms and a simple use case of prototyping an application
for Electrical Quality Assurance of the LHC.
","[{'version': 'v1', 'created': 'Sat, 4 Feb 2017 11:23:48 GMT'}]",2017-02-07,"[['Mertik', 'Matej', ''], ['Wielgosz', 'Maciej', '']]","['Software development', 'Data analysis', 'Web applications', 'ELQA', 'LargeHadron Collider']"
20586,1212.5983,Yun Song,"Yun Song, Zhihui Li","An ideal multi-secret sharing scheme based on minimal privileged
  coalitions",13pages,,,,cs.CR,http://creativecommons.org/licenses/by/3.0/,"  How to construct an ideal multi-secret sharing scheme for general access
structures is difficult. In this paper, we solve an open problem proposed by
Spiez et al.recently [Finite Fields and Their Application, 2011(17) 329-342],
namely to design an algorithm of privileged coalitions of any length if such
coalitions exist. Furthermore, in terms of privileged coalitions, we show that
most of the existing multi-secret sharing schemes based on Shamir threshold
secret sharing are not perfect by analyzing Yang et al.'s scheme and Pang et
al.'s scheme. Finally, based on the algorithm mentioned above, we devise an
ideal multi-secret sharing scheme for families of access structures, which
possesses more vivid authorized sets than that of the threshold scheme.
","[{'version': 'v1', 'created': 'Tue, 25 Dec 2012 01:56:29 GMT'}]",2012-12-27,"[['Song', 'Yun', ''], ['Li', 'Zhihui', '']]","['(t', 'n) threshold', 'track', 'access structure', 'minimal privileged coalitions', 'multi-secret sharing']"
20587,1602.07944,Lidong Wang,Lidong Wang and Yanxun Chang,"Determination of sizes of optimal three-dimensional optical orthogonal
  codes of weight three with the AM-OPP restriction",,,,,cs.IT math.CO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we further investigate the constructions on three-dimensional
$(u\times v\times w,k,1)$ optical orthogonal codes with the at most one optical
pulse per wavelength/time plane restriction (briefly AM-OPP $3$-D $(u\times
v\times w,k,1)$-OOCs) by way of the corresponding designs. Several new
auxiliary designs such as incomplete holey group divisible designs and
incomplete group divisible packings are introduced and therefore new
constructions are presented. As a consequence, the exact number of codewords of
an optimal AM-OPP $3$-D $(u\times v\times w,3,1)$-OOC is finally determined for
any positive integers $v,w$ and $u\geq3$.
","[{'version': 'v1', 'created': 'Sat, 23 Jan 2016 12:33:53 GMT'}]",2016-02-26,"[['Wang', 'Lidong', ''], ['Chang', 'Yanxun', '']]","['three-dimensional', 'optical orthogonal code', 'group divisible packing', 'incomplete group divisible packing', 'holey group divisible design']"
20588,1108.3226,Guodong Shi,Guodong Shi and Karl Henrik Johansson,Multi-agent Robust Consensus: Convergence Analysis and Application,,,,,cs.DC cs.MA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The paper investigates consensus problem for continuous-time multi-agent
systems with time-varying communication graphs subject to process noises.
Borrowing the ideas from input-to-state stability (ISS) and integral
input-to-state stability (iISS), robust consensus and integral robust consensus
are defined with respect to $L_\infty$ and $L_1$ norms of the disturbance
functions, respectively. Sufficient and/or necessary connectivity conditions
are obtained for the system to reach robust consensus or integral robust
consensus, which answer the question: how much communication capacity is
required for a multi-agent network to converge despite certain amount of
disturbance. The $\epsilon$-convergence time is then obtained for the network
as a special case of the robustness analysis. The results are based on quite
general assumptions on switching graph, weights rule and noise regularity. In
addition, as an illustration of the applicability of the results, distributed
event-triggered coordination is studied.
","[{'version': 'v1', 'created': 'Tue, 16 Aug 2011 12:40:11 GMT'}, {'version': 'v2', 'created': 'Tue, 28 Feb 2012 14:34:17 GMT'}]",2015-03-19,"[['Shi', 'Guodong', ''], ['Johansson', 'Karl Henrik', '']]","['Multi-agent systems', 'Robust consensus', 'Joint connection', 'Convergence rate', 'Event-triggered coordination']"
20589,1802.06260,Naji Khosravan,"Naji Khosravan, Haydar Celik, Baris Turkbey, Elizabeth Jones, Bradford
  Wood, Ulas Bagci","A Collaborative Computer Aided Diagnosis (C-CAD) System with
  Eye-Tracking, Sparse Attentional Model, and Deep Learning",Submitted to Medical Image Analysis Journal (MedIA),,,,cs.CV cs.AI cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There are at least two categories of errors in radiology screening that can
lead to suboptimal diagnostic decisions and interventions:(i)human fallibility
and (ii)complexity of visual search. Computer aided diagnostic (CAD) tools are
developed to help radiologists to compensate for some of these errors. However,
despite their significant improvements over conventional screening strategies,
most CAD systems do not go beyond their use as second opinion tools due to
producing a high number of false positives, which human interpreters need to
correct. In parallel with efforts in computerized analysis of radiology scans,
several researchers have examined behaviors of radiologists while screening
medical images to better understand how and why they miss tumors, how they
interact with the information in an image, and how they search for unknown
pathology in the images. Eye-tracking tools have been instrumental in exploring
answers to these fundamental questions. In this paper, we aim to develop a
paradigm shift CAD system, called collaborative CAD (C-CAD), that unifies both
of the above mentioned research lines: CAD and eye-tracking. We design an
eye-tracking interface providing radiologists with a real radiology reading
room experience. Then, we propose a novel algorithm that unifies eye-tracking
data and a CAD system. Specifically, we present a new graph based clustering
and sparsification algorithm to transform eye-tracking data (gaze) into a
signal model to interpret gaze patterns quantitatively and qualitatively. The
proposed C-CAD collaborates with radiologists via eye-tracking technology and
helps them to improve diagnostic decisions. The C-CAD learns radiologists'
search efficiency by processing their gaze patterns. To do this, the C-CAD uses
a deep learning algorithm in a newly designed multi-task learning platform to
segment and diagnose cancers simultaneously.
","[{'version': 'v1', 'created': 'Sat, 17 Feb 2018 17:20:50 GMT'}, {'version': 'v2', 'created': 'Sat, 28 Apr 2018 15:06:18 GMT'}]",2018-10-15,"[['Khosravan', 'Naji', ''], ['Celik', 'Haydar', ''], ['Turkbey', 'Baris', ''], ['Jones', 'Elizabeth', ''], ['Wood', 'Bradford', ''], ['Bagci', 'Ulas', '']]","['Multi-task deep learning', 'graph sparsification', 'eye-tracking', 'lung cancer screening', 'prostate cancer screening', 'diagnosis']"
20590,1501.00720,Alexandr Savinov,Alexandr Savinov,"Concept-oriented programming: from classes to concepts and from
  inheritance to inclusion","12 pages, 2 figures. arXiv admin note: text overlap with
  arXiv:1409.3947",,,,cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  For the past several decades, programmers have been modeling things in the
world with trees using hierarchies of classes and object-oriented programming
(OOP) languages. In this paper, we describe a novel approach to programming,
called concept-oriented programming (COP), which generalizes classes and
inheritance by introducing concepts and inclusion, respectively.
","[{'version': 'v1', 'created': 'Sun, 4 Jan 2015 21:02:34 GMT'}]",2015-01-06,"[['Savinov', 'Alexandr', '']]","['for navigating through the hierarchy', 'super and sub (as opposed to using only super in OOP)', 'the existence of two opposite overriding strategies']"
20591,1403.1076,Kieran Greer Dr,Kieran Greer,Is Intelligence Artificial?,"This new version adds some clarity to the discussion. Also the
  opportunity to extend or update some sections. Some new references","Euroasia Summit, Congress on Scientific Researches and Recent
  Trends-8, August 2-4, 2021, The Philippine Merchant Marine Academy,
  Philippines, pp. 307 - 324",,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Our understanding of intelligence is directed primarily at the human level.
This paper attempts to give a more unifying definition that can be applied to
the natural world in general and then Artificial Intelligence. The definition
would be used more to verify a relative intelligence, not to quantify it and
might help when making judgements on the matter. While correct behaviour is the
preferred definition, a metric that is grounded in Kolmogorov's Complexity
Theory is suggested, which leads to a measurement about entropy. A version of
an accepted AI test is then put forward as the 'acid test' and might be what a
free-thinking program would try to achieve. Recent work by the author has been
more from a direction of mechanical processes, or ones that might operate
automatically. This paper agrees that intelligence is a pro-active event, but
also notes a second aspect to it that is in the background and mechanical. The
paper suggests looking at intelligence and the conscious as being slightly
different, where consciousness is this more mechanical aspect. In fact, a
surprising conclusion can be a passive but intelligent brain being invoked by
active and less intelligent senses.
","[{'version': 'v1', 'created': 'Wed, 5 Mar 2014 11:09:55 GMT'}, {'version': 'v2', 'created': 'Sat, 8 Nov 2014 13:20:49 GMT'}, {'version': 'v3', 'created': 'Tue, 25 Nov 2014 16:19:47 GMT'}, {'version': 'v4', 'created': 'Wed, 28 Jan 2015 17:10:05 GMT'}, {'version': 'v5', 'created': 'Mon, 29 Jun 2015 11:49:38 GMT'}, {'version': 'v6', 'created': 'Mon, 18 Jan 2021 10:59:41 GMT'}, {'version': 'v7', 'created': 'Mon, 14 Jun 2021 11:29:11 GMT'}, {'version': 'v8', 'created': 'Thu, 29 Jul 2021 11:44:43 GMT'}]",2021-08-30,"[['Greer', 'Kieran', '']]","['Artificial Intelligence', 'universal definition', 'model', 'metric', 'consciousness']"
20592,1307.3324,Laxmi Kumre,"Laxmi Kumre, Ajay Somkuwar, Ganga Agnihotri",Power efficient carry propagate adder,"10 Pages, 10 figures","International Journal of VLSI design & Communication Systems
  (VLSICS) Vol.4, No.3, June 2013",,,cs.AR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Here we describe the design details and performance of proposed Carry
Propagate Adder based on GDI technique. GDI technique is power efficient
technique for designing digital circuit that consumes less power as compare to
most commonly used CMOS technique. GDI also has an advantage of minimum
propagation delay, minimum area required and less complexity for designing any
digital circuit. We designed Carry Propagate Adder using GDI technique and
compared its performance with CMOS technique in terms of area, delay and power
dissipation. Circuit designed using CADENCE EDA tool and simulated using
SPECTRE VIRTUOSO tool at 0.18m technology. Comparative performance result shows
that Carry Propagate Adder using GDI technique dissipated 55.6% less power as
compare to Carry Propagate Adder using CMOS technique.
","[{'version': 'v1', 'created': 'Fri, 12 Jul 2013 04:57:14 GMT'}]",2013-07-15,"[['Kumre', 'Laxmi', ''], ['Somkuwar', 'Ajay', ''], ['Agnihotri', 'Ganga', '']]","['Gate Diffusion Input Technique', 'Shannon’s Expansion Theorem', 'Carry Propagate Adder', 'low power VLSI design']"
20593,1303.7220,Larry Bull,Larry Bull,"On Mobile DNA in Artificial Regulatory Networks: Evolving Functional and
  Structural Dynamism","24 pages, 11 figures",,,,cs.ET,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  There is a growing body of work considering the use of representations based
upon genetic regulatory networks. This paper uses a recently presented
abstract, tunable Boolean regulatory network model to explore aspects of mobile
DNA, such as transposons, within these dynamical systems. The significant role
of mobile DNA in the evolution of natural systems is becoming increasingly
clear. Whilst operators loosely based upon transposons have previously been
used within evolutionary computation, their use within regulatory network
representations enables the potential exploitation of numerous new mechanisms.
This paper shows how dynamically controlling network node connectivity and
function via transposon-inspired mechanisms can be selected for under
non-stationary and coevolutionary scenarios, including when such changes are
heritable.
","[{'version': 'v1', 'created': 'Tue, 26 Mar 2013 09:03:35 GMT'}]",2013-03-29,"[['Bull', 'Larry', '']]","['Coevolution', 'Discrete dynamical systems', 'Mobile DNA', 'Multicellularity', 'RBNK model']"
20594,1206.1355,Xiaowen Gong,"Xiaowen Gong, Junshan Zhang, Douglas Cochran","A Coverage Theory of Bistatic Radar Networks: Worst-Case Intrusion Path
  and Optimal Deployment",12 pages,,,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we study optimal radar deployment for intrusion detection,
with focus on network coverage. In contrast to the disk-based sensing model in
a traditional sensor network, the detection range of a bistatic radar depends
on the locations of both the radar transmitter and radar receiver, and is
characterized by Cassini ovals. Furthermore, in a network with multiple radar
transmitters and receivers, since any pair of transmitter and receiver can
potentially form a bistatic radar, the detection ranges of different bistatic
radars are coupled and the corresponding network coverage is intimately related
to the locations of all transmitters and receivers, making the optimal
deployment design highly non-trivial. Clearly, the detectability of an intruder
depends on the highest SNR received by all possible bistatic radars. We focus
on the worst-case intrusion detectability, i.e., the minimum possible
detectability along all possible intrusion paths. Although it is plausible to
deploy radars on a shortest line segment across the field, it is not always
optimal in general, which we illustrate via counter-examples. We then present a
sufficient condition on the field geometry for the optimality of shortest line
deployment to hold. Further, we quantify the local structure of detectability
corresponding to a given deployment order and spacings of radar transmitters
and receivers, building on which we characterize the optimal deployment to
maximize the worst-case intrusion detectability. Our results show that the
optimal deployment locations exhibit a balanced structure. We also develop a
polynomial-time approximation algorithm for characterizing the worse-case
intrusion path for any given locations of radars under random deployment.
","[{'version': 'v1', 'created': 'Wed, 6 Jun 2012 21:33:06 GMT'}]",2012-06-08,"[['Gong', 'Xiaowen', ''], ['Zhang', 'Junshan', ''], ['Cochran', 'Douglas', '']]","['bistatic radar networks', 'network coverage', 'optimal deployment', 'worst-case intrusion path']"
20595,1701.07657,Giovanni Sileno,Giovanni Sileno,"Operationalizing Declarative and Procedural Knowledge: a Benchmark on
  Logic Programming Petri Nets (LPPNs)",draft version -- updated,,,,cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Modelling, specifying and reasoning about complex systems requires to process
in an integrated fashion declarative and procedural aspects of the target
domain. The paper reports on an experiment conducted with a propositional
version of Logic Programming Petri Nets (LPPNs), a notation extending Petri
Nets with logic programming constructs. Two semantics are presented: a
denotational semantics that fully maps the notation to ASP via Event Calculus;
and a hybrid operational semantics that process separately the causal
mechanisms via Petri nets, and the constraints associated to objects and to
events via Answer Set Programming (ASP). These two alternative specifications
enable an empirical evaluation in terms of computational efficiency.
Experimental results show that the hybrid semantics is more efficient w.r.t.
sequences, whereas the two semantics follows the same behaviour w.r.t.
branchings (although the denotational one performs better in absolute terms).
","[{'version': 'v1', 'created': 'Thu, 26 Jan 2017 11:21:50 GMT'}, {'version': 'v2', 'created': 'Fri, 31 Jul 2020 23:08:48 GMT'}]",2020-08-04,"[['Sileno', 'Giovanni', '']]","['Reasoning', 'Model-execution', 'Causal mechanisms', 'Constraints', 'Answer Set Programming', 'Petri Nets']"
20596,1707.09783,Marc Olm,"Marc Olm, Santiago Badia and Alberto F. Mart\'in","Simulation of high temperature superconductors and experimental
  validation",26 pages,,,,cs.CE physics.comp-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this work, we present a parallel, fully-distributed finite element
numerical framework to simulate the low-frequency electromagnetic response of
superconducting devices, which allows to efficiently exploit HPC platforms. We
select the so-called H-formulation, which uses the magnetic field as a state
variable. N\'ed\'elec elements (of arbitrary order) are required for an
accurate approximation of the H-formulation for modelling electromagnetic
fields along interfaces between regions with high contrast medium properties.
An h-adaptive mesh refinement technique customized for N\'ed\'elec elements
leads to a structured fine mesh in areas of interest whereas a smart coarsening
is obtained in other regions. The composition of a tailored, robust, parallel
nonlinear solver completes the exposition of the developed tools to tackle the
problem. First, a comparison against experimental data is performed to show the
availability of the finite element approximation to model the physical
phenomena. Then, a selected state-of-the-art 3D benchmark is reproduced,
focusing on the parallel performance of the algorithms.
","[{'version': 'v1', 'created': 'Mon, 31 Jul 2017 09:48:34 GMT'}, {'version': 'v2', 'created': 'Thu, 12 Apr 2018 11:49:29 GMT'}]",2018-04-13,"[['Olm', 'Marc', ''], ['Badia', 'Santiago', ''], ['Martín', 'Alberto F.', '']]","['High Temperature Superconductors', 'Maxwell equations', 'Adaptive Mesh Refinement', 'N´ed´elec Finite Elements', 'MPI parallelism', 'Domain Decomposition']"
20597,1506.08760,Gautam Dasarathy,"Gautam Dasarathy, Robert Nowak, Xiaojin Zhu","S2: An Efficient Graph Based Active Learning Algorithm with Application
  to Nonparametric Classification","A version of this paper appears in the Conference on Learning Theory
  (COLT) 2015",,,,cs.LG stat.ML,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper investigates the problem of active learning for binary label
prediction on a graph. We introduce a simple and label-efficient algorithm
called S2 for this task. At each step, S2 selects the vertex to be labeled
based on the structure of the graph and all previously gathered labels.
Specifically, S2 queries for the label of the vertex that bisects the *shortest
shortest* path between any pair of oppositely labeled vertices. We present a
theoretical estimate of the number of queries S2 needs in terms of a novel
parametrization of the complexity of binary functions on graphs. We also
present experimental results demonstrating the performance of S2 on both real
and synthetic data. While other graph-based active learning algorithms have
shown promise in practice, our algorithm is the first with both good
performance and theoretical guarantees. Finally, we demonstrate the
implications of the S2 algorithm to the theory of nonparametric active
learning. In particular, we show that S2 achieves near minimax optimal excess
risk for an important class of nonparametric classification problems.
","[{'version': 'v1', 'created': 'Mon, 29 Jun 2015 18:03:25 GMT'}]",2015-06-30,"[['Dasarathy', 'Gautam', ''], ['Nowak', 'Robert', ''], ['Zhu', 'Xiaojin', '']]","['active learning on graphs', 'query complexity of finding a cut', 'nonparametric classification']"
20598,1212.2065,Youssef Bassil,Youssef Bassil,"A Survey on Information Retrieval, Text Categorization, and Web Crawling","LACSC - Lebanese Association for Computational Sciences,
  http://www.lacsc.org","Journal of Computer Science & Research (JCSCR), Vol. 1, No. 6, pp.
  1-11, 2012",,,cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper is a survey discussing Information Retrieval concepts, methods,
and applications. It goes deep into the document and query modelling involved
in IR systems, in addition to pre-processing operations such as removing stop
words and searching by synonym techniques. The paper also tackles text
categorization along with its application in neural networks and machine
learning. Finally, the architecture of web crawlers is to be discussed shedding
the light on how internet spiders index web documents and how they allow users
to search for items on the web.
","[{'version': 'v1', 'created': 'Mon, 10 Dec 2012 13:57:59 GMT'}]",2012-12-11,"[['Bassil', 'Youssef', '']]","['Information Retrieval', 'Term Weighting', 'Text Categorisation', 'Web Crawling']"
20599,1011.0594,Hitesh Tahbildar,Hitesh Tahbildar and Bichitra Kalita,"Heuristic Approach of Automated Test Data Generation for Program having
  Array of Different Dimensions and Loops with Variable Number of Iteration","19 pages, 10 figures",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Normally, program execution spends most of the time on loops. Automated test
data generation devotes special attention to loops for better coverage.
Automated test data generation for programs having loops with variable number
of iteration and variable length array is a challenging problem. It is so
because the number of paths may increase exponentially with the increase of
array size for some programming constructs, like merge sort. We propose a
method that finds heuristic for different types of programming constructs with
loops and arrays. Linear search, Bubble sort, merge sort, and matrix
multiplication programs are included in an attempt to highlight the difference
in execution between single loop, variable length array and nested loops with
one and two dimensional arrays. We have used two parameters/heuristics to
predict the minimum number of iterations required for generating automated test
data. They are longest path level (kL) and saturation level (kS). The
proceedings of our work includes the instrumentation of source code at the
elementary level, followed by the application of the random inputs until all
feasible paths or all paths having longest paths are collected. However,
duplicate paths are avoided by using a filter. Our test data is the random
numbers that cover each feasible path.
","[{'version': 'v1', 'created': 'Tue, 2 Nov 2010 12:19:46 GMT'}]",2010-11-03,"[['Tahbildar', 'Hitesh', ''], ['Kalita', 'Bichitra', '']]","['Longest path', 'saturation point', 'kL', 'kS', 'lmax', 'UFP', 'NFP', 'LLP']"
20600,1208.5037,Masoud Bekravi,"Masoud Bekravi, Shahram Jamali and Gholam Shaker","Defense against SYN-Flood Denial of Service Attacks Based on Learning
  Automata",,,,,cs.NI,http://creativecommons.org/licenses/by/3.0/,"  SYN-flooding attack uses the weakness available in TCP's three-way handshake
process to keep it from handling legitimate requests. This attack causes the
victim host to populate its backlog queue with forged TCP connections. In other
words it increases Ploss (probability of loss) and Pa (buffer occupancy
percentage of attack requests) and decreases Pr (buffer occupancy percentage of
regular requests) in the victim host and results to decreased performance of
the host. This paper proposes a self-managing approach, in which the host
defends against SYN-flooding attack by dynamically tuning of its own two
parameters, that is, m (maximum number of half-open connections) and h (hold
time for each half-open connection). In this way, it formulates the defense
problem to an optimization problem and then employs the learning automata (LA)
algorithm to solve it. The simulation results show that the proposed defense
strategy improves performance of the under attack system in terms of Ploss, Pa
and Pr.
","[{'version': 'v1', 'created': 'Fri, 24 Aug 2012 19:11:11 GMT'}]",2012-08-27,"[['Bekravi', 'Masoud', ''], ['Jamali', 'Shahram', ''], ['Shaker', 'Gholam', '']]","['SYN-flooding', 'DoS', 'TCP', 'Learning automata', 'queuing model']"
20601,1208.2925,Alvin Cheung,"Alvin Cheung, Armando Solar-Lezama, Samuel Madden",Using Program Synthesis for Social Recommendations,,,,MIT-CSAIL-TR-2012-025,cs.LG cs.DB cs.PL cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper presents a new approach to select events of interest to a user in
a social media setting where events are generated by the activities of the
user's friends through their mobile devices. We argue that given the unique
requirements of the social media setting, the problem is best viewed as an
inductive learning problem, where the goal is to first generalize from the
users' expressed ""likes"" and ""dislikes"" of specific events, then to produce a
program that can be manipulated by the system and distributed to the collection
devices to collect only data of interest. The key contribution of this paper is
a new algorithm that combines existing machine learning techniques with new
program synthesis technology to learn users' preferences. We show that when
compared with the more standard approaches, our new algorithm provides up to
order-of-magnitude reductions in model training time, and significantly higher
prediction accuracies for our target application. The approach also improves on
standard machine learning techniques in that it produces clear programs that
can be manipulated to optimize data collection and filtering.
","[{'version': 'v1', 'created': 'Tue, 14 Aug 2012 17:04:19 GMT'}]",2012-08-15,"[['Cheung', 'Alvin', ''], ['Solar-Lezama', 'Armando', ''], ['Madden', 'Samuel', '']]","['recommender systems', 'social networking applications', 'program synthesis', 'support vector machines']"
20602,1209.4975,Yanfang Liu,Yanfang Liu and William Zhu,Parametric matroid of rough set,15 pages,,,,cs.AI cs.DM,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Rough set is mainly concerned with the approximations of objects through an
equivalence relation on a universe. Matroid is a combinatorial generalization
of linear independence in vector spaces. In this paper, we define a parametric
set family, with any subset of a universe as its parameter, to connect rough
sets and matroids. On the one hand, for a universe and an equivalence relation
on the universe, a parametric set family is defined through the lower
approximation operator. This parametric set family is proved to satisfy the
independent set axiom of matroids, therefore it can generate a matroid, called
a parametric matroid of the rough set. Three equivalent representations of the
parametric set family are obtained. Moreover, the parametric matroid of the
rough set is proved to be the direct sum of a partition-circuit matroid and a
free matroid. On the other hand, since partition-circuit matroids were well
studied through the lower approximation number, we use it to investigate the
parametric matroid of the rough set. Several characteristics of the parametric
matroid of the rough set, such as independent sets, bases, circuits, the rank
function and the closure operator, are expressed by the lower approximation
number.
","[{'version': 'v1', 'created': 'Sat, 22 Sep 2012 09:19:54 GMT'}]",2012-09-25,"[['Liu', 'Yanfang', ''], ['Zhu', 'William', '']]","['rough set', 'matroid', 'partition-circuit matroid', 'the lower approximationnumber']"
20603,0708.1049,Damien Chablat,"Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), F\'elix Majou
  (IRCCyN), Jean-Pierre Merlet (INRIA Sophia-Antipolis)","An Interval Analysis Based Study for the Design and the Comparison of
  3-DOF Parallel Kinematic Machines",,"International Journal of Robotics Research 23, 6 (2004) 615-624",,,cs.RO,,"  This paper addresses an interval analysis based study that is applied to the
design and the comparison of 3-DOF parallel kinematic machines. Two design
criteria are used, (i) a regular workspace shape and, (ii) a kinetostatic
performance index that needs to be as homogeneous as possible throughout the
workspace. The interval analysis based method takes these two criteria into
account: on the basis of prescribed kinetostatic performances, the workspace is
analysed to find out the largest regular dextrous workspace enclosed in the
Cartesian workspace. An algorithm describing this method is introduced. Two
3-DOF translational parallel mechanisms designed for machining applications are
compared using this method. The first machine features three fixed linear
joints which are mounted orthogonally and the second one features three linear
joints which are mounted in parallel. In both cases, the mobile platform moves
in the Cartesian x-y-z space with fixed orientation.
","[{'version': 'v1', 'created': 'Wed, 8 Aug 2007 07:06:48 GMT'}]",2007-08-09,"[['Chablat', 'Damien', '', 'IRCCyN'], ['Wenger', 'Philippe', '', 'IRCCyN'], ['Majou', 'Félix', '', 'IRCCyN'], ['Merlet', 'Jean-Pierre', '', 'INRIA Sophia-Antipolis']]","['Parallel kinematic machine', 'Design', 'Interval analysis', 'Comparison', 'Workspace', 'Transmission']"
20604,0707.0761,Richard McClatchey,"David Manset, Herve Verjus, Richard McClatchey","Managing Separation of Concerns in Grid Applications Through
  Architectural Model Transformations","4 pages, 2 figures. Presented at the First European Conference on
  Software Architectures (ECSA 2007). Madrid, Spain September 24-26, 2007",,,,cs.SE cs.DC,,"  Grids enable the aggregation, virtualization and sharing of massive
heterogeneous and geographically dispersed resources, using files, applications
and storage devices, to solve computation and data intensive problems, across
institutions and countries via temporary collaborations called virtual
organizations (VO). Most implementations result in complex superposition of
software layers, often delivering low quality of service and quality of
applications. As a consequence, Grid-based applications design and development
is increasingly complex, and the use of most classical engineering practices is
unsuccessful. Not only is the development of such applications a
time-consuming, error prone and expensive task, but also the resulting
applications are often hard-coded for specific Grid configurations, platforms
and infra-structures. Having neither guidelines nor rules in the design of a
Grid-based application is a paradox since there are many existing architectural
approaches for distributed computing, which could ease and promote rigorous
engineering methods based on the re-use of software components. It is our
belief that ad-hoc and semi-formal engineer-ing approaches, in current use, are
insufficient to tackle tomorrows Grid develop-ments requirements. Because
Grid-based applications address multi-disciplinary and complex domains (health,
military, scientific computation), their engineering requires rigor and
control. This paper therefore advocates a formal model-driven engineering
process and corresponding design framework and tools for building the next
generation of Grids.
","[{'version': 'v1', 'created': 'Thu, 5 Jul 2007 11:10:03 GMT'}]",2007-07-06,"[['Manset', 'David', ''], ['Verjus', 'Herve', ''], ['McClatchey', 'Richard', '']]","['Grid', 'MDE', 'Software Architecture', 'Model Transformation']"
20605,1402.1693,Rahul Chavhan,"Rahul D. Chavhan, Sachin U. Chavhan, Ganesh B. Chavan",Real Time Industrial Monitoring System,5 pages 7 figures,,,,cs.OH,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Industries are the biggest workplace all over the world, also there are large
number of peoples involves as a worker and most of them are work as a machine
operator. There are many systems developed for industrial work place, some of
them, monitors machine processes and some do monitoring and control of machine
parameters. Such as speed, temperature, production batch count etc. However
there is no such system available that provides monitoring of operator during
their work is in progress at workplace. This paper proposes the monitoring of
the operators and the machines, by Real time Operator -Machine Allocation and
monitoring system (Omams). Omams allocates a work machine to worker at entry
point itself. It uses automation with RFID and one of the standards of wireless
communication method. The system can be industry specific. Through this
research paper our approach is to make fair allocation of machine to the
operator in industry and reduce hassle for efficiency calculations.
","[{'version': 'v1', 'created': 'Fri, 7 Feb 2014 16:56:55 GMT'}]",2014-02-10,"[['Chavhan', 'Rahul D.', ''], ['Chavhan', 'Sachin U.', ''], ['Chavan', 'Ganesh B.', '']]","['Real Time Monitoring', 'RFID', 'Operator Allotment', 'Monitoring System', 'Machine Allocation']"
20606,1702.00583,Mikhail Breslav,"Mikhail Breslav, Tyson L. Hedrick, Stan Sclaroff, Margrit Betke","Automating Image Analysis by Annotating Landmarks with Deep Neural
  Networks",30 pages,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Image and video analysis is often a crucial step in the study of animal
behavior and kinematics. Often these analyses require that the position of one
or more animal landmarks are annotated (marked) in numerous images. The process
of annotating landmarks can require a significant amount of time and tedious
labor, which motivates the need for algorithms that can automatically annotate
landmarks. In the community of scientists that use image and video analysis to
study the 3D flight of animals, there has been a trend of developing more
automated approaches for annotating landmarks, yet they fall short of being
generally applicable. Inspired by the success of Deep Neural Networks (DNNs) on
many problems in the field of computer vision, we investigate how suitable DNNs
are for accurate and automatic annotation of landmarks in video datasets
representative of those collected by scientists studying animals.
  Our work shows, through extensive experimentation on videos of hawkmoths,
that DNNs are suitable for automatic and accurate landmark localization. In
particular, we show that one of our proposed DNNs is more accurate than the
current best algorithm for automatic localization of landmarks on hawkmoth
videos. Moreover, we demonstrate how these annotations can be used to
quantitatively analyze the 3D flight of a hawkmoth. To facilitate the use of
DNNs by scientists from many different fields, we provide a self contained
explanation of what DNNs are, how they work, and how to apply them to other
datasets using the freely available library Caffe and supplemental code that we
provide.
","[{'version': 'v1', 'created': 'Thu, 2 Feb 2017 08:53:10 GMT'}]",2017-02-03,"[['Breslav', 'Mikhail', ''], ['Hedrick', 'Tyson L.', ''], ['Sclaroff', 'Stan', ''], ['Betke', 'Margrit', '']]","['automatic landmark localization', 'annotation', 'pose estimation', 'deep neural networks', 'hawkmoths']"
20607,1401.4339,Abhishek Bichhawat,"Abhishek Bichhawat, Vineet Rajani, Deepak Garg and Christian Hammer",Information Flow Control in WebKit's JavaScript Bytecode,,,,,cs.CR cs.PL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Websites today routinely combine JavaScript from multiple sources, both
trusted and untrusted. Hence, JavaScript security is of paramount importance. A
specific interesting problem is information flow control (IFC) for JavaScript.
In this paper, we develop, formalize and implement a dynamic IFC mechanism for
the JavaScript engine of a production Web browser (specifically, Safari's
WebKit engine). Our IFC mechanism works at the level of JavaScript bytecode and
hence leverages years of industrial effort on optimizing both the source to
bytecode compiler and the bytecode interpreter. We track both explicit and
implicit flows and observe only moderate overhead. Working with bytecode
results in new challenges including the extensive use of unstructured control
flow in bytecode (which complicates lowering of program context taints),
unstructured exceptions (which complicate the matter further) and the need to
make IFC analysis permissive. We explain how we address these challenges,
formally model the JavaScript bytecode semantics and our instrumentation, prove
the standard property of termination-insensitive non-interference, and present
experimental results on an optimized prototype.
","[{'version': 'v1', 'created': 'Fri, 17 Jan 2014 13:38:08 GMT'}, {'version': 'v2', 'created': 'Tue, 21 Jan 2014 09:01:09 GMT'}]",2014-01-22,"[['Bichhawat', 'Abhishek', ''], ['Rajani', 'Vineet', ''], ['Garg', 'Deepak', ''], ['Hammer', 'Christian', '']]","['Dynamic information flow control', 'JavaScript bytecode', 'tainttracking', 'control flow graphs', 'immediate post-dominator analysis']"
20608,1712.06174,Matteo Fischetti,Matteo Fischetti and Jason Jo,"Deep Neural Networks as 0-1 Mixed Integer Linear Programs: A Feasibility
  Study",submitted to an international conference,,,,cs.LG,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Deep Neural Networks (DNNs) are very popular these days, and are the subject
of a very intense investigation. A DNN is made by layers of internal units (or
neurons), each of which computes an affine combination of the output of the
units in the previous layer, applies a nonlinear operator, and outputs the
corresponding value (also known as activation). A commonly-used nonlinear
operator is the so-called rectified linear unit (ReLU), whose output is just
the maximum between its input value and zero. In this (and other similar cases
like max pooling, where the max operation involves more than one input value),
one can model the DNN as a 0-1 Mixed Integer Linear Program (0-1 MILP) where
the continuous variables correspond to the output values of each unit, and a
binary variable is associated with each ReLU to model its yes/no nature. In
this paper we discuss the peculiarity of this kind of 0-1 MILP models, and
describe an effective bound-tightening technique intended to ease its solution.
We also present possible applications of the 0-1 MILP model arising in feature
visualization and in the construction of adversarial examples. Preliminary
computational results are reported, aimed at investigating (on small DNNs) the
computational performance of a state-of-the-art MILP solver when applied to a
known test case, namely, hand-written digit recognition.
","[{'version': 'v1', 'created': 'Sun, 17 Dec 2017 20:11:39 GMT'}]",2017-12-19,"[['Fischetti', 'Matteo', ''], ['Jo', 'Jason', '']]","['deep neural networks', 'mixed-integer programming', 'deep learning', 'mathematical optimization', 'computational experiments']"
20609,1301.1547,Bruno Bauwens,"Bruno Bauwens, Anton Makhlin, Nikolay Vereshchagin, Marius Zimand",Short lists with short programs in short time,,,,,cs.CC cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Given a machine $U$, a $c$-short program for $x$ is a string $p$ such that
$U(p)=x$ and the length of $p$ is bounded by $c$ + (the length of a shortest
program for $x$). We show that for any standard Turing machine, it is possible
to compute in polynomial time on input $x$ a list of polynomial size guaranteed
to contain a O$(\log |x|)$-short program for $x$. We also show that there
exists a computable function that maps every $x$ to a list of size $|x|^2$
containing a O$(1)$-short program for $x$. This is essentially optimal because
we prove that for each such function there is a $c$ and infinitely many $x$ for
which the list has size at least $c|x|^2$. Finally we show that for some
standard machines, computable functions generating lists with $0$-short
programs, must have infinitely often list sizes proportional to $2^{|x|}$.
","[{'version': 'v1', 'created': 'Tue, 8 Jan 2013 14:41:49 GMT'}, {'version': 'v2', 'created': 'Tue, 15 Jan 2013 11:45:29 GMT'}, {'version': 'v3', 'created': 'Thu, 30 Mar 2017 15:33:31 GMT'}]",2017-03-31,"[['Bauwens', 'Bruno', ''], ['Makhlin', 'Anton', ''], ['Vereshchagin', 'Nikolay', ''], ['Zimand', 'Marius', '']]","['list-approximator', 'Kolmogorov complexity', 'on-line matching', 'expander graph']"
20610,1401.2107,Dragan Vidakovic Novak,"Dragan Vidakovic, Dusko Parezanovic, Zoran Vucetic",Minimizing the Time of Detection of Large (Probably) Prime Numbers,11 pages,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper we present the experimental results that more clearly than any
theory suggest an answer to the question: when in detection of large (probably)
prime numbers to apply, a very resource demanding, Miller-Rabin algorithm. Or,
to put it another way, when the dividing by first several tens of prime numbers
should be replaced by primality testing? As an innovation, the procedure above
will be supplemented by considering the use of the well-known Goldbach's
conjecture in the solving of this and some other important questions about the
RSA cryptosystem, always guided by the motto ""do not harm"" - neither the
security nor the time spent.
","[{'version': 'v1', 'created': 'Thu, 9 Jan 2014 18:20:04 GMT'}]",2014-01-10,"[['Vidakovic', 'Dragan', ''], ['Parezanovic', 'Dusko', ''], ['Vucetic', 'Zoran', '']]","['Public key cryptosystems', 'Prime numbers', 'Trial division', 'Miller-Rabin algorithm', 'Goldbach conjecture']"
20611,1212.6177,Scott Ainsworth,"Scott G. Ainsworth and Ahmed AlSum and Hany SalahEldeen and Michele C.
  Weigle and Michael L. Nelson",How Much of the Web Is Archived?,"This is the long version of the short paper by the same title
  published at JCDL'11. 10 pages, 5 figures, 7 tables. Version 2 includes minor
  typographical corrections",,,,cs.DL cs.IR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Although the Internet Archive's Wayback Machine is the largest and most
well-known web archive, there have been a number of public web archives that
have emerged in the last several years. With varying resources, audiences and
collection development policies, these archives have varying levels of overlap
with each other. While individual archives can be measured in terms of number
of URIs, number of copies per URI, and intersection with other archives, to
date there has been no answer to the question ""How much of the Web is
archived?"" We study the question by approximating the Web using sample URIs
from DMOZ, Delicious, Bitly, and search engine indexes; and, counting the
number of copies of the sample URIs exist in various public web archives. Each
sample set provides its own bias. The results from our sample sets indicate
that range from 35%-90% of the Web has at least one archived copy, 17%-49% has
between 2-5 copies, 1%-8% has 6-10 copies, and 8%-63% has more than 10 copies
in public web archives. The number of URI copies varies as a function of time,
but no more than 31.3% of URIs are archived more than once per month.
","[{'version': 'v1', 'created': 'Wed, 26 Dec 2012 13:36:55 GMT'}, {'version': 'v2', 'created': 'Sun, 6 Jan 2013 04:18:21 GMT'}]",2013-01-08,"[['Ainsworth', 'Scott G.', ''], ['AlSum', 'Ahmed', ''], ['SalahEldeen', 'Hany', ''], ['Weigle', 'Michele C.', ''], ['Nelson', 'Michael L.', '']]","['Web Architecture', 'HTTP', 'Resource Versioning', 'Web Archiving', 'Temporal Applications', 'Digital Preservation']"
20612,1403.7321,Jack Valmadre,"Jack Valmadre, Sridha Sridharan, Simon Lucey",Learning detectors quickly using structured covariance matrices,,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Computer vision is increasingly becoming interested in the rapid estimation
of object detectors. Canonical hard negative mining strategies are slow as they
require multiple passes of the large negative training set. Recent work has
demonstrated that if the distribution of negative examples is assumed to be
stationary, then Linear Discriminant Analysis (LDA) can learn comparable
detectors without ever revisiting the negative set. Even with this insight,
however, the time to learn a single object detector can still be on the order
of tens of seconds on a modern desktop computer. This paper proposes to
leverage the resulting structured covariance matrix to obtain detectors with
identical performance in orders of magnitude less time and memory. We elucidate
an important connection to the correlation filter literature, demonstrating
that these can also be trained without ever revisiting the negative set.
","[{'version': 'v1', 'created': 'Fri, 28 Mar 2014 10:02:02 GMT'}]",2014-03-31,"[['Valmadre', 'Jack', ''], ['Sridharan', 'Sridha', ''], ['Lucey', 'Simon', '']]","['hard negative mining', 'linear discriminant analysis', 'multichannel correlation filters', 'Toeplitz', 'circulant']"
20613,1504.03195,Mohammadreza Malek-Mohammadi,"Mohammadreza Malek-Mohammadi, Cristian R. Rojas, Magnus Jansson,
  Massoud Babaie-Zadeh",Upper Bounds on the Error of Sparse Vector and Low-Rank Matrix Recovery,Submitted to Elsevier Signal Processing,,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Suppose that a solution $\widetilde{\mathbf{x}}$ to an underdetermined linear
system $\mathbf{b} = \mathbf{A} \mathbf{x}$ is given. $\widetilde{\mathbf{x}}$
is approximately sparse meaning that it has a few large components compared to
other small entries. However, the total number of nonzero components of
$\widetilde{\mathbf{x}}$ is large enough to violate any condition for the
uniqueness of the sparsest solution. On the other hand, if only the dominant
components are considered, then it will satisfy the uniqueness conditions. One
intuitively expects that $\widetilde{\mathbf{x}}$ should not be far from the
true sparse solution $\mathbf{x}_0$. We show that this intuition is the case by
providing an upper bound on $\| \widetilde{\mathbf{x}} - \mathbf{x}_0\|$ which
is a function of the magnitudes of small components of $\widetilde{\mathbf{x}}$
but independent from $\mathbf{x}_0$. This result is extended to the case that
$\mathbf{b}$ is perturbed by noise. Additionally, we generalize the upper
bounds to the low-rank matrix recovery problem.
","[{'version': 'v1', 'created': 'Mon, 13 Apr 2015 14:16:07 GMT'}, {'version': 'v2', 'created': 'Fri, 26 Jun 2015 10:24:11 GMT'}]",2015-06-29,"[['Malek-Mohammadi', 'Mohammadreza', ''], ['Rojas', 'Cristian R.', ''], ['Jansson', 'Magnus', ''], ['Babaie-Zadeh', 'Massoud', '']]","['Approximately sparse solutions', 'low-rank matrix recovery', 'restricted isometry property', 'sparse vectorrecovery']"
20614,1802.06183,Ikechukwu Maduako,"Maduako N. Ikechukwu, Francis I. Okeke","Towards Realisation of Heterogeneous Earth-Observation Sensor Database
  Framework for the Sensor Observation Service based on PostGIS",,,,,cs.DB,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Environmental monitoring and management systems in most cases deal with
models and spatial analytics that involve the integration of in-situ and remote
Geosensor observations. In-situ sensor observations and those gathered by
remote sensors are usually provided by different databases and services in
real-time dynamic services such as the Geo-Web Services. Thus, data have to be
pulled from different databases and transferred over the network before they
are fused and processed on the service middleware. This process is very massive
and unnecessary communication-work load on the service middleware. Massive work
load in large raster downloads from flat-file raster data sources each time a
request is made and huge integration and geo-processing work load on the
service middleware which could actually be better leveraged at the database
This paper therefore proposes the realization of heterogeneous sensor database
framework based on PostGIS for integration, geo-processing and spatial analysis
of remote and in-situ sensor observations at the database level. Also discussed
in this paper is how the framework can be integrated in the Sensor Observation
Service (SOS) to reduce communication and massive workload on the Geospatial
Web Services and as well make query request from the user end a lot more
flexible. Keywords: Earth-Observation, Heterogeneous Earth-Observation Sensor
Database, PostGIS , Sensor Observation Service.
","[{'version': 'v1', 'created': 'Sat, 17 Feb 2018 03:52:21 GMT'}]",2018-02-20,"[['Ikechukwu', 'Maduako N.', ''], ['Okeke', 'Francis I.', '']]","['Earth-Observation', 'Heterogeneous Earth-Observation Sensor Database', 'PostGIS', 'Sensor']"
20615,1602.09102,Martin Klein,Herbert Van de Sompel and Martin Klein and Shawn M. Jones,Persistent URIs Must Be Used To Be Persistent,"2 pages, 2 figures, accepted for publication at WWW 2016 (poster
  track)",,,,cs.DL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We quantify the extent to which references to papers in scholarly literature
use persistent HTTP URIs that leverage the Digital Object Identifier
infrastructure. We find a significant number of references that do not,
speculate why authors would use brittle URIs when persistent ones are
available, and propose an approach to alleviate the problem.
","[{'version': 'v1', 'created': 'Mon, 29 Feb 2016 19:03:23 GMT'}]",2016-03-01,"[['Van de Sompel', 'Herbert', ''], ['Klein', 'Martin', ''], ['Jones', 'Shawn M.', '']]","['Digital Object Identifier', 'Scholarly Communication', 'URIReferences']"
20616,1203.0651,Nikzad Babaii-Rizvandi,"Nikzad Babaii Rizvandi, Albert Y. Zomaya, Ali Javadzadeh Boloori,
  Javid Taheri","On Modeling Dependency between MapReduce Configuration Parameters and
  Total Execution Time",,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we propose an analytical method to model the dependency
between configuration parameters and total execution time of Map-Reduce
applications. Our approach has three key phases: profiling, modeling, and
prediction. In profiling, an application is run several times with different
sets of MapReduce configuration parameters to profile the execution time of the
application on a given platform. Then in modeling, the relation between these
parameters and total execution time is modeled by multivariate linear
regression. Among the possible configuration parameters, two main parameters
have been used in this study: the number of Mappers, and the number of
Reducers. For evaluation, two standard applications (WordCount, and Exim
Mainlog parsing) are utilized to evaluate our technique on a 4-node MapReduce
platform.
","[{'version': 'v1', 'created': 'Sat, 3 Mar 2012 13:18:51 GMT'}]",2012-03-06,"[['Rizvandi', 'Nikzad Babaii', ''], ['Zomaya', 'Albert Y.', ''], ['Boloori', 'Ali Javadzadeh', ''], ['Taheri', 'Javid', '']]","['MapReduce', 'Configuration parameters', 'total']"
20617,1605.02775,Diego Sebasti\'an P\'erez,"Diego Sebasti\'an P\'erez, Facundo Bromberg, Carlos Ariel Diaz","Image Classification of Grapevine Buds using Scale-Invariant Features
  Transform, Bag of Features and Support Vector Machines","21 pages, 7 figures, 2 tables",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In viticulture, there are several applications where bud detection in
vineyard images is a necessary task, susceptible of being automated through the
use of computer vision methods. A common and effective family of visual
detection algorithms are the scanning-window type, that slide a (usually) fixed
size window along the original image, classifying each resulting windowed-patch
as containing or not containing the target object. The simplicity of these
algorithms finds its most challenging aspect in the classification stage.
Interested in grapevine buds detection in natural field conditions, this paper
presents a classification method for images of grapevine buds ranging 100 to
1600 pixels in diameter, captured in outdoor, under natural field conditions,
in winter (i.e., no grape bunches, very few leaves, and dormant buds), without
artificial background, and with minimum equipment requirements. The proposed
method uses well-known computer vision technologies: Scale-Invariant Feature
Transform for calculating low-level features, Bag of Features for building an
image descriptor, and Support Vector Machines for training a classifier. When
evaluated over images containing buds of at least 100 pixels in diameter, the
approach achieves a recall higher than 0.9 and a precision of 0.86 over all
windowed-patches covering the whole bud and down to 60% of it, and scaled up to
window patches containing a proportion of 20%-80% of bud versus background
pixels. This robustness on the position and size of the window demonstrates its
viability for use as the classification stage in a scanning-window detection
algorithms.
","[{'version': 'v1', 'created': 'Mon, 9 May 2016 20:48:20 GMT'}]",2016-05-11,"[['Pérez', 'Diego Sebastián', ''], ['Bromberg', 'Facundo', ''], ['Diaz', 'Carlos Ariel', '']]","['Computer vision', 'Image classification', 'Grapevine bud', 'Scanning-window detection', 'Precision viticulture']"
20618,1604.08379,Debasis Mishra,Debasis Mishra and Tridib Sharma,Balanced Ranking Mechanisms,,,,,cs.GT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the private values single object auction model, we construct a
satisfactory mechanism - a symmetric, dominant strategy incentive compatible,
and budget-balanced mechanism. Our mechanism allocates the object to the
highest valued agent with more than 99% probability provided there are at least
14 agents. It is also ex-post individually rational. We show that our mechanism
is optimal in a restricted class of satisfactory ranking mechanisms. Since
achieving efficiency through a dominant strategy incentive compatible and
budget-balanced mechanism is impossible in this model, our results illustrate
the limits of this impossibility.
","[{'version': 'v1', 'created': 'Thu, 28 Apr 2016 11:41:02 GMT'}]",2016-10-04,"[['Mishra', 'Debasis', ''], ['Sharma', 'Tridib', '']]","['budget-balanced mechanisms', 'Green-Laffont mechanism', 'Pareto optimalmechanism']"
20619,0908.0482,Shenghui Su,"Shenghui Su, Shuwang Lu","REESSE1+ . Reward . Proof by Experiment . A New Approach to Proof of P
  != NP",5 pages,,,,cs.CR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The authors discuss what is provable security in cryptography. Think that
provable security is asymptotic, relative, and dynamic, and only a supplement
to but not a replacement of exact security analysis. Because the conjecture P
!= NP has not been proven yet, and it is possible in terms of the two
incompleteness theorems of Kurt Godel that there is some cryptosystem of which
the security cannot or only ideally be proven in the random oracle model, the
security of a cryptosystem is between provability and unprovability, and any
academic conclusion must be checked and verified with practices or experiments
as much as possible. Extra, a new approach to proof of P != NP is pointed out.
Lastly, a reward is offered for the subexponential time solutions to the three
REESSE1+ problems: MPP, ASPP, and TLP with n >= 80 and lg M >= 80, which may be
regarded as a type of security proof by experiment.
","[{'version': 'v1', 'created': 'Tue, 4 Aug 2009 16:09:39 GMT'}, {'version': 'v2', 'created': 'Sun, 10 Oct 2010 06:41:11 GMT'}, {'version': 'v3', 'created': 'Thu, 15 Dec 2011 10:37:32 GMT'}, {'version': 'v4', 'created': 'Thu, 7 Feb 2013 06:19:55 GMT'}, {'version': 'v5', 'created': 'Tue, 26 Aug 2014 03:13:05 GMT'}]",2014-08-27,"[['Su', 'Shenghui', ''], ['Lu', 'Shuwang', '']]","['Public key cryptosystem', 'REESSE1+ problem', 'Provable security', 'Exact security', 'Subexponential time']"
20620,1011.0354,Pooya Hatami,"Pooya Hatami, Raghav Kulkarni and Denis Pankratov",Variations on the Sensitivity Conjecture,"16 pages, 1 table",,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a selection of known as well as new variants of the Sensitivity
Conjecture and point out some weaker versions that are also open.
","[{'version': 'v1', 'created': 'Mon, 1 Nov 2010 15:44:49 GMT'}]",2010-11-02,"[['Hatami', 'Pooya', ''], ['Kulkarni', 'Raghav', ''], ['Pankratov', 'Denis', '']]","['sensitivity', 'block sensitivity', 'complexity measures of Boolean functions']"
20621,1602.07679,Ingmar Steiner,"Alexander Hewer (DFKI, MMCI), Ingmar Steiner (DFKI, MMCI), Timo
  Bolkart (MMCI), Stefanie Wuhrer (MORPHEO), Korin Richmond (CSTR)","A statistical shape space model of the palate surface trained on 3D MRI
  scans of the vocal tract","Proceedings of the 18th International Congress of Phonetic Sciences,
  Aug 2015, Glasgow, United Kingdom. 2015, http://www.icphs2015.info/",,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We describe a minimally-supervised method for computing a statistical shape
space model of the palate surface. The model is created from a corpus of
volumetric magnetic resonance imaging (MRI) scans collected from 12 speakers.
We extract a 3D mesh of the palate from each speaker, then train the model
using principal component analysis (PCA). The palate model is then tested using
3D MRI from another corpus and evaluated using a high-resolution optical scan.
We find that the error is low even when only a handful of measured coordinates
are available. In both cases, our approach yields promising results. It can be
applied to extract the palate shape from MRI data, and could be useful to other
analysis modalities, such as electromagnetic articulography (EMA) and
ultrasound tongue imaging (UTI).
","[{'version': 'v1', 'created': 'Fri, 4 Sep 2015 07:24:53 GMT'}]",2016-02-25,"[['Hewer', 'Alexander', '', 'DFKI, MMCI'], ['Steiner', 'Ingmar', '', 'DFKI, MMCI'], ['Bolkart', 'Timo', '', 'MMCI'], ['Wuhrer', 'Stefanie', '', 'MORPHEO'], ['Richmond', 'Korin', '', 'CSTR']]","['vocal tract MRI', 'principal componentanalysis', 'palate model']"
20622,1410.2501,Yannai A. Gonczarowski,"Armando Casta\~neda, Yannai A. Gonczarowski, Yoram Moses",Unbeatable Consensus,arXiv admin note: substantial text overlap with arXiv:1311.6902,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The unbeatability of a consensus protocol, introduced by Halpern, Moses and
Waarts in 2001, is a stronger notion of optimality than the accepted notion of
early stopping protocols. Using a novel knowledge-based analysis, this paper
derives the first practical unbeatable consensus protocols in the literature,
for the standard synchronous message-passing model with crash failures. These
protocols strictly dominate the best known protocols for uniform and for
non-uniform consensus, in some case beating them by a large margin. The
analysis provides a new understanding of the logical structure of consensus,
and of the distinction between uniform and nonuniform consensus. Finally, the
first (early stopping and) unbeatable protocol that treats decision values
""fairly"" is presented. All of these protocols have very concise descriptions,
and are shown to be efficiently implementable.
","[{'version': 'v1', 'created': 'Thu, 9 Oct 2014 15:09:23 GMT'}]",2014-10-10,"[['Castañeda', 'Armando', ''], ['Gonczarowski', 'Yannai A.', ''], ['Moses', 'Yoram', '']]","['Consensus', 'uniform consensus', 'optimality', 'knowledge']"
20623,1609.04785,Zhiyong Shan,"Zhiyong Shan, Tzi-cker Chiueh, Xin Wang","Virtualizing System and Ordinary Services in Windows-based OS-Level
  Virtual Machines",SAC '11 Proceedings of the 2011 ACM Symposium on Applied Computing,,,,cs.OS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  OS-level virtualization incurs smaller start-up and run-time overhead than
HAL-based virtualization and thus forms an important building block for
developing fault-tolerant and intrusion-tolerant applications. A complete
implementation of OS-level virtualization on the Windows platform requires
virtualization of Windows services, such as system services like the Remote
Procedure Call Server Service (RPCSS), because they are essentially extensions
of the kernel. As Windows system services work very differently from their
counterparts on UNIX-style OS, i.e., daemons, and many of their implementation
details are proprietary, virtualizing Windows system services turned out to be
the most challenging technical barrier for OS-level virtualization for the
Windows platform. In this paper, we describe a general technique to virtualize
Windows services, and demonstrate its effectiveness by applying it to
successfully virtualize a set of important Windows system services and ordinary
services on different versions of Windows OS, including RPCSS, DcomLaunch, IIS
service group, Tlntsvr, MySQL, Apache2.2, CiSvc, ImapiService, etc.
","[{'version': 'v1', 'created': 'Thu, 15 Sep 2016 19:21:22 GMT'}]",2016-09-16,"[['Shan', 'Zhiyong', ''], ['Chiueh', 'Tzi-cker', ''], ['Wang', 'Xin', '']]","['virtual machine', 'service virtualization', 'Windows service']"
20624,1205.0439,Aridj Mohamed,"Aridj Mohamed, Zegour Djamel Eddine",TH*:Scalable Distributed Trie Hashing,"IJCSI International Journal of Computer Science Issues, Vol. 7, Issue
  6, November 2010 ISSN (Online): 1694-0814 http://www.IJCSI.org",,,,cs.DS cs.DB cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In today's world of computers, dealing with huge amounts of data is not
unusual. The need to distribute this data in order to increase its availability
and increase the performance of accessing it is more urgent than ever. For
these reasons it is necessary to develop scalable distributed data structures.
In this paper we propose a TH* distributed variant of the Trie Hashing data
structure. First we propose Thsw new version of TH without node Nil in digital
tree (trie), then this version will be adapted to multicomputer environment.
The simulation results reveal that TH* is scalable in the sense that it grows
gracefully, one bucket at a time, to a large number of servers, also TH* offers
a good storage space utilization and high query efficiency special for ordering
operations.
","[{'version': 'v1', 'created': 'Wed, 2 May 2012 14:17:16 GMT'}]",2012-05-03,"[['Mohamed', 'Aridj', ''], ['Eddine', 'Zegour Djamel', '']]","['Trie hashing', 'Distributed hashing', 'SDDS', 'multicomputer', 'distributed systems']"
20625,1704.04937,Binanda Sengupta,Abhishek Singh and Binanda Sengupta and Sushmita Ruj,Certificate Transparency with Enhancements and Short Proofs,A preliminary version of the paper was published in ACISP 2017,,,,cs.CR cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Browsers can detect malicious websites that are provisioned with forged or
fake TLS/SSL certificates. However, they are not so good at detecting malicious
websites if they are provisioned with mistakenly issued certificates or
certificates that have been issued by a compromised certificate authority.
Google proposed certificate transparency which is an open framework to monitor
and audit certificates in real time. Thereafter, a few other certificate
transparency schemes have been proposed which can even handle revocation. All
currently known constructions use Merkle hash trees and have proof size
logarithmic in the number of certificates/domain owners.
  We present a new certificate transparency scheme with short (constant size)
proofs. Our construction makes use of dynamic bilinear-map accumulators. The
scheme has many desirable properties like efficient revocation, low
verification cost and update costs comparable to the existing schemes. We
provide proofs of security and evaluate the performance of our scheme.
","[{'version': 'v1', 'created': 'Mon, 17 Apr 2017 11:42:34 GMT'}, {'version': 'v2', 'created': 'Wed, 19 Jul 2017 20:19:43 GMT'}]",2017-07-21,"[['Singh', 'Abhishek', ''], ['Sengupta', 'Binanda', ''], ['Ruj', 'Sushmita', '']]","['Certificate transparency', 'Revocation', 'Bilinear-map accumulator']"
20626,1304.3612,Ravibabu Venkatajalam,V. Ravibabu,A Novel Metaheuristics To Solve Mixed Shop Scheduling Problems,,"International Journal in Foundations of Computer Science &
  Technology, March2013, Volume 3, Number 2, ISSN : 1839-7662",,,cs.NE,http://creativecommons.org/licenses/by-nc-sa/3.0/,"  This paper represents the metaheuristics proposed for solving a class of Shop
Scheduling problem. The Bacterial Foraging Optimization algorithm is featured
with Ant Colony Optimization algorithm and proposed as a natural inspired
computing approach to solve the Mixed Shop Scheduling problem. The Mixed Shop
is the combination of Job Shop, Flow Shop and Open Shop scheduling problems.
The sample instances for all mentioned Shop problems are used as test data and
Mixed Shop survive its computational complexity to minimize the makespan. The
computational results show that the proposed algorithm is gentler to solve and
performs better than the existing algorithms.
","[{'version': 'v1', 'created': 'Fri, 12 Apr 2013 12:08:07 GMT'}]",2013-04-15,"[['Ravibabu', 'V.', '']]","['Combinatorial Optimization', 'Bacterial Foraging Optimization', 'Ant Colony Optimization', 'Metaheuristics', 'Mixed Shop Scheduling Problem']"
20627,1704.07296,Pei Xu,Pei Xu,"A Real-time Hand Gesture Recognition and Human-Computer Interaction
  System",,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this project, we design a real-time human-computer interaction system
based on hand gesture. The whole system consists of three components: hand
detection, gesture recognition and human-computer interaction (HCI) based on
recognition; and realizes the robust control of mouse and keyboard events with
a higher accuracy of gesture recognition. Specifically, we use the
convolutional neural network (CNN) to recognize gestures and makes it
attainable to identify relatively complex gestures using only one cheap
monocular camera. We introduce the Kalman filter to estimate the hand position
based on which the mouse cursor control is realized in a stable and smooth way.
During the HCI stage, we develop a simple strategy to avoid the false
recognition caused by noises - mostly transient, false gestures, and thus to
improve the reliability of interaction. The developed system is highly
extendable and can be used in human-robotic or other human-machine interaction
scenarios with more complex command formats rather than just mouse and keyboard
events.
","[{'version': 'v1', 'created': 'Mon, 24 Apr 2017 15:44:56 GMT'}]",2017-04-25,"[['Xu', 'Pei', '']]","['Gesture recognition', 'convolutional neural network', 'human-computer interaction', 'mouse cursor control']"
20628,1603.07316,Michael Kech,Michael Kech and Felix Krahmer,"Optimal Injectivity Conditions for Bilinear Inverse Problems with
  Applications to Identifiability of Deconvolution Problems",,,,,cs.IT math.AG math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We study identifiability for bilinear inverse problems under sparsity and
subspace constraints. We show that, up to a global scaling ambiguity, almost
all such maps are injective on the set of pairs of sparse vectors if the number
of measurements $m$ exceeds $2(s_1+s_2)-2$, where $s_1$ and $s_2$ denote the
sparsity of the two input vectors, and injective on the set of pairs of vectors
lying in known subspaces of dimensions $n_1$ and $n_2$ if $m\geq 2(n_1+n_2)-4$.
We also prove that both these bounds are tight in the sense that one cannot
have injectivity for a smaller number of measurements. Our proof technique
draws from algebraic geometry. As an application we derive optimal
identifiability conditions for the deconvolution problem, thus improving on
recent work of Li et al. [1].
","[{'version': 'v1', 'created': 'Wed, 23 Mar 2016 19:40:49 GMT'}]",2016-03-24,"[['Kech', 'Michael', ''], ['Krahmer', 'Felix', '']]","['bilinear inverse problems', 'deconvolution', 'uniqueness']"
20629,1409.6070,Benjamin Graham,Benjamin Graham,Spatially-sparse convolutional neural networks,13 pages,,,,cs.CV cs.NE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Convolutional neural networks (CNNs) perform well on problems such as
handwriting recognition and image classification. However, the performance of
the networks is often limited by budget and time constraints, particularly when
trying to train deep networks.
  Motivated by the problem of online handwriting recognition, we developed a
CNN for processing spatially-sparse inputs; a character drawn with a one-pixel
wide pen on a high resolution grid looks like a sparse matrix. Taking advantage
of the sparsity allowed us more efficiently to train and test large, deep CNNs.
On the CASIA-OLHWDB1.1 dataset containing 3755 character classes we get a test
error of 3.82%.
  Although pictures are not sparse, they can be thought of as sparse by adding
padding. Applying a deep convolutional network using sparsity has resulted in a
substantial reduction in test error on the CIFAR small picture datasets: 6.28%
on CIFAR-10 and 24.30% for CIFAR-100.
","[{'version': 'v1', 'created': 'Mon, 22 Sep 2014 02:39:27 GMT'}]",2014-09-23,"[['Graham', 'Benjamin', '']]","['online character recognition', 'convolutional neural network', 'sparsity', 'computer vision']"
20630,0806.1567,Feng Xia,"Feng Xia, Wenhong Zhao","Flexible Time-Triggered Sampling in Smart Sensor-Based Wireless Control
  Systems","17 pages, 10 figures; Open Access at
  http://www.mdpi.org/sensors/papers/s7112548.pdf","Sensors, vol.7, no.11, pp. 2548-2564, 2007",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Wireless control systems (WCSs) often have to operate in dynamic environments
where the network traffic load may vary unpredictably over time. The sampling
in sensors is conventionally time triggered with fixed periods. In this
context, only worse-than-possible quality of control (QoC) can be achieved when
the network is underloaded, while overloaded conditions may significantly
degrade the QoC, even causing system instability. This is particularly true
when the bandwidth of the wireless network is limited and shared by multiple
control loops. To address these problems, a flexible time-triggered sampling
scheme is presented in this work. Smart sensors are used to facilitate dynamic
adjustment of sampling periods, which enhances the flexibility and resource
efficiency of the system based on time-triggered sampling. Feedback control
technology is exploited for adapting sampling periods in a periodic manner. The
deadline miss ratio in each control loop is maintained at/around a desired
level, regardless of workload variations. Simulation results show that the
proposed sampling scheme is able to deal with dynamic and unpredictable
variations in network traffic load. Compared to conventional time-triggered
sampling, it leads to much better QoC in WCSs operating in dynamic
environments.
","[{'version': 'v1', 'created': 'Tue, 10 Jun 2008 04:10:05 GMT'}]",2008-12-18,"[['Xia', 'Feng', ''], ['Zhao', 'Wenhong', '']]","['adaptive sampling', 'smart sensors', 'flexible time-triggered', 'wireless control systems', 'sensor/actuator networks']"
20631,1304.2610,Abdelhakim Herrouz,"Abdelhakim Herrouz, Chabane Khentout and Mahieddine Djoudi",Overview of Visualization Tools for Web Browser History Data,,"IJCSI International Journal of Computer Science Issues, Vol.9,
  Issue 6, No3, November 2012, pp. 92-98, 2012",,,cs.HC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Nowadays, the Web has become one of the most widespread platforms for
information change and retrieval. As it becomes easier to publish documents, as
the number of users, and thus publishers, increases and as the number of
documents grows, searching for information is turning into a cumbersome and
time-consuming operation. Because of the loose interconnection between
documents, people have difficulty remembering where they have been and
returning to previously visited pages. Navigation through the web faces
problems of locating oneself with respect to space and time. The idea of
graphical assistance navigation is to help users to find their paths in
hyperspace by adapting the style of link presentation to the goals, knowledge
and other characteristics of an individual user. We first introduce the
concepts related to web navigation; we then present an overview of different
graphical navigation tools and techniques. We conclude by presenting a
comparative table of these tools based on some pertinent criteria.
","[{'version': 'v1', 'created': 'Thu, 28 Feb 2013 04:52:28 GMT'}]",2013-07-04,"[['Herrouz', 'Abdelhakim', ''], ['Khentout', 'Chabane', ''], ['Djoudi', 'Mahieddine', '']]","['Web Browser', 'History Data', 'Visualization', 'Browsing Helpers']"
20632,1412.6216,Ankita Garg,Ankita Garg,"An approach for improving the concept of Cyclomatic Complexity for
  Object-Oriented Programming",,,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Measuring software complexity plays an important role to meet the demands of
complex software. The cyclomatic complexity is one of most used and renowned
metric among the other three proposed and researched metrics that are namely:
Line of code, Halstead measure and cyclomatic complexity. Although cyclomatic
complexity is very popular but also serves some of the problems which has been
identified and showed in a tabular form in this research work. It lacks the
calculation of coupling between the object classes for object oriented
programming and only calculates the complexity on the basis of the conditional
statements. Thus there is requirement to improve the concept of cyclomatic
complexity based on coupling. Paper includes the proposed algorithm to handle
the above stated problem.
","[{'version': 'v1', 'created': 'Fri, 19 Dec 2014 04:58:34 GMT'}]",2014-12-22,"[['Garg', 'Ankita', '']]","['Coupling', 'control flow graph', 'cyclomatic complexity number', 'objects classes']"
20633,1403.1861,Timothy Wang,"Timothy Wang and Romain Jobredeaux and Marc Pantel and Pierre-Loic
  Garoche and Eric Feron and Didier Henrion",Credible Autocoding of Convex Optimization Algorithms,,,,,cs.SY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  The efficiency of modern optimization methods, coupled with increasing
computational resources, has led to the possibility of real-time optimization
algorithms acting in safety critical roles. There is a considerable body of
mathematical proofs on on-line optimization programs which can be leveraged to
assist in the development and verification of their implementation. In this
paper, we demonstrate how theoretical proofs of real-time optimization
algorithms can be used to describe functional properties at the level of the
code, thereby making it accessible for the formal methods community. The
running example used in this paper is a generic semi-definite programming (SDP)
solver. Semi-definite programs can encode a wide variety of optimization
problems and can be solved in polynomial time at a given accuracy. We describe
a top-to-down approach that transforms a high-level analysis of the algorithm
into useful code annotations. We formulate some general remarks about how such
a task can be incorporated into a convex programming autocoder. We then take a
first step towards the automatic verification of the optimization program by
identifying key issues to be adressed in future work.
","[{'version': 'v1', 'created': 'Fri, 7 Mar 2014 20:04:11 GMT'}, {'version': 'v2', 'created': 'Tue, 2 Sep 2014 16:44:29 GMT'}]",2014-09-03,"[['Wang', 'Timothy', ''], ['Jobredeaux', 'Romain', ''], ['Pantel', 'Marc', ''], ['Garoche', 'Pierre-Loic', ''], ['Feron', 'Eric', ''], ['Henrion', 'Didier', '']]","['Control Theory', 'Autocoding', 'Lyapunov proofs', 'Formal Verification', 'Optimization', 'Interior-point Method', 'PVS', 'frama-C']"
20634,1606.05608,Jukka Kohonen,"Matti Karppa and Petteri Kaski and Jukka Kohonen and Padraig \'O
  Cath\'ain","Explicit correlation amplifiers for finding outlier correlations in
  deterministic subquadratic time",,,,,cs.DS,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We derandomize G. Valiant's [J. ACM 62 (2015) Art. 13] subquadratic-time
algorithm for finding outlier correlations in binary data. Our derandomized
algorithm gives deterministic subquadratic scaling essentially for the same
parameter range as Valiant's randomized algorithm, but the precise constants we
save over quadratic scaling are more modest. Our main technical tool for
derandomization is an explicit family of correlation amplifiers built via a
family of zigzag-product expanders in Reingold, Vadhan, and Wigderson [Ann. of
Math. 155 (2002) 157--187]. We say that a function
$f:\{-1,1\}^d\rightarrow\{-1,1\}^D$ is a correlation amplifier with threshold
$0\leq\tau\leq 1$, error $\gamma\geq 1$, and strength $p$ an even positive
integer if for all pairs of vectors $x,y\in\{-1,1\}^d$ it holds that (i)
$|\langle x,y\rangle|<\tau d$ implies $|\langle
f(x),f(y)\rangle|\leq(\tau\gamma)^pD$; and (ii) $|\langle x,y\rangle|\geq\tau
d$ implies $\bigl(\frac{\langle x,y\rangle}{\gamma d}\bigr)^pD
  \leq\langle f(x),f(y)\rangle\leq
  \bigl(\frac{\gamma\langle x,y\rangle}{d}\bigr)^pD$.
","[{'version': 'v1', 'created': 'Fri, 17 Jun 2016 17:50:09 GMT'}, {'version': 'v2', 'created': 'Tue, 8 Nov 2016 06:05:51 GMT'}]",2016-11-09,"[['Karppa', 'Matti', ''], ['Kaski', 'Petteri', ''], ['Kohonen', 'Jukka', ''], ['Catháin', 'Padraig Ó', '']]","['correlation', 'derandomization', 'outlier', 'similarity search', 'expandergraphAMS classification']"
20635,1710.01605,Dirk Slock,Elisabeth de Carvalho and Dirk Slock,Cram\'er-Rao Bounds for Blind Multichannel Estimation,"22 pages, 3 figures",,,,cs.IT eess.SP math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In some estimation problems, not all the parameters can be identified, which
results in singularity of the Fisher Information Matrix (FIM). The Cram\'er-Rao
Bound (CRB), which is the inverse of the FIM, is then not defined. To
regularize the estimation problem, one can impose constraints on the parameters
and derive the corresponding CRBs. The correspondence between local
identifiability and FIM regularity is studied here. Furthermore the number of
FIM singularities is shown to be equal to the number of independent constraints
necessary to have a well-defined constrained CRB and local identifiability. In
general, many sets of constraints can render the parameters identifiable,
giving different values for the CRB, that are not always relevant. When the
constraints can be chosen, we propose a constrained CRB, the pseudo-inverse of
the FIM, which gives, for a minimum number of constraints, the lowest bound on
the mean squared estimation error. These results are applied to two approaches
to blind FIR multichannel estimation which allow identification of the channel
up to a scale or phase factor. These two approaches correspond to deterministic
and Gaussian models for the unknown channel inputs. The singularities of the
FIMs and local identifiability are studied and the corresponding constrained
CRBs are derived and interpreted.
","[{'version': 'v1', 'created': 'Wed, 4 Oct 2017 13:47:41 GMT'}]",2018-07-24,"[['de Carvalho', 'Elisabeth', ''], ['Slock', 'Dirk', '']]","['Fisher Information Matrix', 'Cram´er–Rao Bound', 'constrained parameter estimation', 'blind channel identification']"
20636,1511.01868,Xiao Fang,"Zhepeng Li, Xiao Fang, Olivia Sheng","A Survey of Link Recommendation for Social Networks: Methods,
  Theoretical Foundations, and Future Research Directions",34 pages,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Link recommendation has attracted significant attentions from both industry
practitioners and academic researchers. In industry, link recommendation has
become a standard and most important feature in online social networks,
prominent examples of which include ""People You May Know"" on LinkedIn and ""You
May Know"" on Google+. In academia, link recommendation has been and remains a
highly active research area. This paper surveys state-of-the-art link
recommendation methods, which can be broadly categorized into learning-based
methods and proximity-based methods. We further identify social and economic
theories, such as social interaction theory, that underlie these methods and
explain from a theoretical perspective why a link recommendation method works.
Finally, we propose to extend link recommendation research in several
directions that include utility-based link recommendation, diversity of link
recommendation, link recommendation from incomplete data, and experimental
study of link recommendation.
","[{'version': 'v1', 'created': 'Thu, 5 Nov 2015 19:46:29 GMT'}]",2015-11-06,"[['Li', 'Zhepeng', ''], ['Fang', 'Xiao', ''], ['Sheng', 'Olivia', '']]","['Link Recommendation', 'Link Prediction', 'Social Network', 'Network Formation']"
20637,1301.2092,Marek Szyku{\l}a,"Jakub Kowalski, Marek Szyku{\l}a",The \v{C}ern\'{y} conjecture for small automata: experimental report,,,,,cs.FL,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We present a report from a series of experiments involving computation of the
shortest reset words for automata with small number of states. We confirm that
the \v{C}ern\'{y} conjecture is true for all automata with at most 11 states on
2 letters. Also some new interesting results were obtained, including the third
gap in the distribution of the shortest reset words and new slowly
synchronizing classes of automata.
","[{'version': 'v1', 'created': 'Thu, 10 Jan 2013 11:38:28 GMT'}]",2013-01-11,"[['Kowalski', 'Jakub', ''], ['Szykuła', 'Marek', '']]","['Černý conjecture', 'synchronizing word', 'nonisomorphic automata']"
20638,0705.0828,Tshilidzi Marwala,"D.L. Falk, D. M. Rubin and T. Marwala","Enhancement of Noisy Planar Nuclear Medicine Images using Mean Field
  Annealing",4 pages,,,,cs.CV,,"  Nuclear medicine (NM) images inherently suffer from large amounts of noise
and blur. The purpose of this research is to reduce the noise and blur while
maintaining image integrity for improved diagnosis. The proposed solution is to
increase image quality after the standard pre- and post-processing undertaken
by a gamma camera system. Mean Field Annealing (MFA) is the image processing
technique used in this research. It is a computational iterative technique that
makes use of the Point Spread Function (PSF) and the noise associated with the
NM image. MFA is applied to NM images with the objective of reducing noise
while not compromising edge integrity. Using a sharpening filter as a
post-processing technique (after MFA) yields image enhancement of planar NM
images.
","[{'version': 'v1', 'created': 'Sun, 6 May 2007 23:08:04 GMT'}]",2007-05-23,"[['Falk', 'D. L.', ''], ['Rubin', 'D. M.', ''], ['Marwala', 'T.', '']]","['Mean Field Annealing', 'Nuclear Medicine', 'Image Restoration']"
20639,1407.2343,Kunal Narayan Chaudhury,S. Ghosh and K. N. Chaudhury,Fast Separable Non-Local Means,,"SPIE Journal of Electronic Imaging, vol. 25, no. 2, pp. 023026
  (2016)",,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We propose a simple and fast algorithm called PatchLift for computing
distances between patches (contiguous block of samples) extracted from a given
one-dimensional signal. PatchLift is based on the observation that the patch
distances can be efficiently computed from a matrix that is derived from the
one-dimensional signal using lifting; importantly, the number of operations
required to compute the patch distances using this approach does not scale with
the patch length. We next demonstrate how PatchLift can be used for patch-based
denoising of images corrupted with Gaussian noise. In particular, we propose a
separable formulation of the classical Non-Local Means (NLM) algorithm that can
be implemented using PatchLift. We demonstrate that the PatchLift-based
implementation of separable NLM is few orders faster than standard NLM, and is
competitive with existing fast implementations of NLM. Moreover, its denoising
performance is shown to be consistently superior to that of NLM and some of its
variants, both in terms of PSNR/SSIM and visual quality.
","[{'version': 'v1', 'created': 'Wed, 9 Jul 2014 03:15:37 GMT'}, {'version': 'v2', 'created': 'Thu, 29 Jun 2017 06:35:50 GMT'}]",2017-06-30,"[['Ghosh', 'S.', ''], ['Chaudhury', 'K. N.', '']]","['Non-local means', 'denoising', 'patch distance', 'fast algorithm', 'separable filtering', 'lifting']"
20640,1604.08936,Cynthia Kop,Cynthia Kop and Jakob Grue Simonsen,Complexity Hierarchies and Higher-Order Cons-Free Rewriting,Extended version (with appendices) of a paper published in FSCD 2016,,,,cs.CC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Constructor rewriting systems are said to be cons-free if, roughly,
constructor terms in the right-hand sides of rules are subterms of constructor
terms in the left-hand side; the computational intuition is that rules cannot
build new data structures. It is well-known that cons-free programming
languages can be used to characterize computational complexity classes, and
that cons-free first-order term rewriting can be used to characterize the set
of polynomial-time decidable sets.
  We investigate cons-free higher-order term rewriting systems, the complexity
classes they characterize, and how these depend on the order of the types used
in the systems. We prove that, for every k $\geq$ 1, left-linear cons-free
systems with type order k characterize E$^k$TIME if arbitrary evaluation is
used (i.e., the system does not have a fixed reduction strategy).
  The main difference with prior work in implicit complexity is that (i) our
results hold for non-orthogonal term rewriting systems with possible rule
overlaps with no assumptions about reduction strategy, (ii) results for such
term rewriting systems have previously only been obtained for k = 1, and with
additional syntactic restrictions on top of cons-freeness and left-linearity.
  Our results are apparently among the first implicit characterizations of the
hierarchy E = E$^1$TIME $\subseteq$ E$^2$TIME $\subseteq$ .... Our work
confirms prior results that having full non-determinism (via overlaps of rules)
does not directly allow characterization of non-deterministic complexity
classes like NE. We also show that non-determinism makes the classes
characterized highly sensitive to minor syntactic changes such as admitting
product types or non-left-linear rules.
","[{'version': 'v1', 'created': 'Fri, 29 Apr 2016 19:06:07 GMT'}]",2016-05-02,"[['Kop', 'Cynthia', ''], ['Simonsen', 'Jakob Grue', '']]","['higher-order term rewriting', 'implicit complexity', 'cons-freeness', 'ETIMEhierarchy']"
20641,1105.2202,Vadim E. Levit,Vadim E. Levit and Eugen Mandrescu,On Symmetry of Independence Polynomials,"16 pages, 13 figures",,,,cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  An independent set in a graph is a set of pairwise non-adjacent vertices, and
alpha(G) is the size of a maximum independent set in the graph G. A matching is
a set of non-incident edges, while mu(G) is the cardinality of a maximum
matching.
  If s_{k} is the number of independent sets of cardinality k in G, then
I(G;x)=s_{0}+s_{1}x+s_{2}x^{2}+...+s_{\alpha(G)}x^{\alpha(G)} is called the
independence polynomial of G (Gutman and Harary, 1983). If
$s_{j}=s_{\alpha-j}$, 0=< j =< alpha(G), then I(G;x) is called symmetric (or
palindromic). It is known that the graph G*2K_{1} obtained by joining each
vertex of G to two new vertices, has a symmetric independence polynomial
(Stevanovic, 1998). In this paper we show that for every graph G and for each
non-negative integer k =< mu(G), one can build a graph H, such that: G is a
subgraph of H, I(H;x) is symmetric, and I(G*2K_{1};x)=(1+x)^{k}*I(H;x).
","[{'version': 'v1', 'created': 'Wed, 11 May 2011 14:22:17 GMT'}]",2011-05-12,"[['Levit', 'Vadim E.', ''], ['Mandrescu', 'Eugen', '']]","['independent set', 'independence polynomial', 'symmetric polynomial', 'palindromic polynomial']"
20642,0910.2039,Keyan Zahedi,"Keyan Zahedi, Nihat Ay and Ralf Der","Higher coordination with less control - A result of information
  maximization in the sensorimotor loop",,,,,cs.AI cs.IT cs.RO math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This work presents a novel learning method in the context of embodied
artificial intelligence and self-organization, which has as few assumptions and
restrictions as possible about the world and the underlying model. The learning
rule is derived from the principle of maximizing the predictive information in
the sensorimotor loop. It is evaluated on robot chains of varying length with
individually controlled, non-communicating segments. The comparison of the
results shows that maximizing the predictive information per wheel leads to a
higher coordinated behavior of the physically connected robots compared to a
maximization per robot. Another focus of this paper is the analysis of the
effect of the robot chain length on the overall behavior of the robots. It will
be shown that longer chains with less capable controllers outperform those of
shorter length and more complex controllers. The reason is found and discussed
in the information-geometric interpretation of the learning process.
","[{'version': 'v1', 'created': 'Sun, 11 Oct 2009 20:06:04 GMT'}, {'version': 'v2', 'created': 'Tue, 18 May 2010 12:00:44 GMT'}]",2010-05-19,"[['Zahedi', 'Keyan', ''], ['Ay', 'Nihat', ''], ['Der', 'Ralf', '']]","['Predictive Information', 'Embodied Artificial Intelligence', 'Sensorimotor Loop', 'SelfOrganized Learning', 'Information Theory']"
20643,1301.1390,Michael Fink,"Thomas Eiter, Michael Fink, Thomas Krennwallner, Christoph Redl, and
  Peter Sch\""uller",Eliminating Unfounded Set Checking for HEX-Programs,"Proceedings of Answer Set Programming and Other Computing Paradigms
  (ASPOCP 2012), 5th International Workshop, September 4, 2012, Budapest,
  Hungary",,,,cs.LO cs.AI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  HEX-programs are an extension of the Answer Set Programming (ASP) paradigm
incorporating external means of computation into the declarative programming
language through so-called external atoms. Their semantics is defined in terms
of minimal models of the Faber-Leone-Pfeifer (FLP) reduct. Developing native
solvers for HEX-programs based on an appropriate notion of unfounded sets has
been subject to recent research for reasons of efficiency. Although this has
lead to an improvement over naive minimality checking using the FLP reduct,
testing for foundedness remains a computationally expensive task. In this work
we improve on HEX-program evaluation in this respect by identifying a syntactic
class of programs, that can be efficiently recognized and allows to entirely
skip the foundedness check. Moreover, we develop criteria for decomposing a
program into components, such that the search for unfounded sets can be
restricted. Observing that our results apply to many HEX-program applications
provides analytic evidence for the significance and effectiveness of our
approach, which is complemented by a brief discussion of preliminary
experimental validation.
","[{'version': 'v1', 'created': 'Tue, 8 Jan 2013 02:29:22 GMT'}]",2013-01-09,"[['Eiter', 'Thomas', ''], ['Fink', 'Michael', ''], ['Krennwallner', 'Thomas', ''], ['Redl', 'Christoph', ''], ['Schüller', 'Peter', '']]","['Answer Set Programming', 'Nonmonotonic Reasoning', 'Unfounded Sets', 'FLP Semantics']"
20644,1610.00427,Chang-Hwan Son,"Chang-Hwan Son, Xiao-Ping Zhang","Rain structure transfer using an exemplar rain image for synthetic rain
  image generation",6 pages,,,,cs.CV,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This letter proposes a simple method of transferring rain structures of a
given exemplar rain image into a target image. Given the exemplar rain image
and its corresponding masked rain image, rain patches including rain structures
are extracted randomly, and then residual rain patches are obtained by
subtracting those rain patches from their mean patches. Next, residual rain
patches are selected randomly, and then added to the given target image along a
raster scanning direction. To decrease boundary artifacts around the added
patches on the target image, minimum error boundary cuts are found using
dynamic programming, and then blending is conducted between overlapping
patches. Our experiment shows that the proposed method can generate realistic
rain images that have similar rain structures in the exemplar images. Moreover,
it is expected that the proposed method can be used for rain removal. More
specifically, natural images and synthetic rain images generated via the
proposed method can be used to learn classifiers, for example, deep neural
networks, in a supervised manner.
","[{'version': 'v1', 'created': 'Mon, 3 Oct 2016 06:58:43 GMT'}]",2016-10-04,"[['Son', 'Chang-Hwan', ''], ['Zhang', 'Xiao-Ping', '']]","['Structure\xa0 transfer', 'dynamic\xa0 programming', 'supervised\xa0 learning', 'rain\xa0 removal', 'image‐based\xa0rendering', 'feature\xa0descriptors']"
20645,1401.2417,Tommaso Gagliardoni,"Frederik Armknecht and Tommaso Gagliardoni and Stefan Katzenbeisser
  and Andreas Peter","General Impossibility of Group Homomorphic Encryption in the Quantum
  World","20 pages, 2 figures, conference",,,,cs.CR math.GR,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Group homomorphic encryption represents one of the most important building
blocks in modern cryptography. It forms the basis of widely-used, more
sophisticated primitives, such as CCA2-secure encryption or secure multiparty
computation. Unfortunately, recent advances in quantum computation show that
many of the existing schemes completely break down once quantum computers reach
maturity (mainly due to Shor's algorithm). This leads to the challenge of
constructing quantum-resistant group homomorphic cryptosystems.
  In this work, we prove the general impossibility of (abelian) group
homomorphic encryption in the presence of quantum adversaries, when assuming
the IND-CPA security notion as the minimal security requirement. To this end,
we prove a new result on the probability of sampling generating sets of finite
(sub-)groups if sampling is done with respect to an arbitrary, unknown
distribution. Finally, we provide a sufficient condition on homomorphic
encryption schemes for our quantum attack to work and discuss its
satisfiability in non-group homomorphic cases. The impact of our results on
recent fully homomorphic encryption schemes poses itself as an open question.
","[{'version': 'v1', 'created': 'Fri, 10 Jan 2014 18:02:48 GMT'}, {'version': 'v2', 'created': 'Mon, 13 Jan 2014 16:06:44 GMT'}]",2014-01-14,"[['Armknecht', 'Frederik', ''], ['Gagliardoni', 'Tommaso', ''], ['Katzenbeisser', 'Stefan', ''], ['Peter', 'Andreas', '']]","['Public-Key Cryptography', 'Homomorphic Encryption', 'Semantic Security', 'Quantum Algorithms', 'Sampling Group Generators']"
20646,0803.0803,Husnain Mansoor Ali,"Husnain Mansoor Ali (IEF), Anthony Busson (IEF), Amina Meraihi Naimi
  (IEF), Veronique Veque (IEF)","Un Algorithme de Gestion des Adjacences bas\'e sur la Puissance du
  Signal",,"Colloque Francophone sur l'Ing\'enierie des Protocoles (CFIP), Les
  Arcs : France (2008)",,,cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this proposition, we present a link management technique for pro-active
routing protocols for ad-hoc networks. This new mechanism is based on signal
strength hence cross layer approach is used. The hysteresis mechanism provided
by OLSR is improved upon by using signal strength in combination with the hello
loss based hysteresis. The signal power is used to determine if the
link-quality is improving or deteriorating while packet losses are handled
through the hysteresis mechanism specified in OLSR RFC. This not only makes the
link management more robust but also helps in anticipating link breakages
thereby greatly improving the performance.
","[{'version': 'v1', 'created': 'Thu, 6 Mar 2008 07:39:13 GMT'}]",2008-12-18,"[['Ali', 'Husnain Mansoor', '', 'IEF'], ['Busson', 'Anthony', '', 'IEF'], ['Naimi', 'Amina Meraihi', '', 'IEF'], ['Veque', 'Veronique', '', 'IEF']]","['Routing Protocols', 'Link Management', 'OLSR', 'MANET', 'Signal Strength']"
20647,1407.1109,Dusan Jakovetic,"Dusan Jakovetic, Dragana Bajovic, Dejan Vukobratovic, and Vladimir
  Crnojevic",Cooperative Slotted Aloha for Multi-Base Station Systems,"extended version of a paper submitted for journal publication;
  revised Nov 6, 2014, and Jan 24, 2015",,,,cs.IT math.IT,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  We introduce a framework to study slotted Aloha with cooperative base
stations. Assuming a geographic-proximity communication model, we propose
several decoding algorithmswith different degrees of base stations' cooperation
(non-cooperative, spatial, temporal, and spatio-temporal). With spatial
cooperation, neighboring base stations inform each other whenever they collect
a user within their coverage overlap; temporal cooperation corresponds to
(temporal) successive interference cancellation done locally at each station.
We analyze the four decoding algorithms and establish several fundamental
results. With all algorithms, the peak throughput (average number of decoded
users per slot, across all base stations) increases linearly with the number of
base stations. Further, temporal and spatio-temporal cooperations exhibit a
threshold behavior with respect to the normalized load (number of users per
station, per slot). There exists a positive load $G^\star$, such that, below
$G^\star$, the decoding probability is asymptotically maximal possible, equal
the probability that a user is heard by at least one base station; with
non-cooperative decoding and spatial cooperation, we show that $G^\star$ is
zero. Finally, with spatio-temporal cooperation, we optimize the degree
distribution according to which users transmit their packet replicas; the
optimum is in general very different from the corresponding optimal
distribution of the single-base station system.
","[{'version': 'v1', 'created': 'Fri, 4 Jul 2014 01:39:23 GMT'}, {'version': 'v2', 'created': 'Thu, 6 Nov 2014 14:33:56 GMT'}, {'version': 'v3', 'created': 'Thu, 29 Jan 2015 09:35:13 GMT'}]",2015-01-30,"[['Jakovetic', 'Dusan', ''], ['Bajovic', 'Dragana', ''], ['Vukobratovic', 'Dejan', ''], ['Crnojevic', 'Vladimir', '']]","['Slotted Aloha', 'successive interference cancellation', 'networked base stations', 'spa']"
20648,1710.05912,Sergiy Syrota,"Liskin Viacheslav, Syrota Sergiy","E-learning Information Technology Based on an Ontology Driven Learning
  Engine",,"International Journal of Computer Science and Information
  Security, IJCSIS ISSN 1947-5500, Pittsburgh, PA, USA",,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In the article, proposed is a new e-learning information technology based on
an ontology driven learning engine, which is matched with modern pedagogical
technologies. With the help of proposed engine and developed question database
we have conducted an experiment, where students were tested. The developed
ontology driven system of e-learning facilitates the creation of favorable
conditions for the development of personal qualities and creation of a holistic
understanding of the subject area among students throughout the educational
process.
","[{'version': 'v1', 'created': 'Sat, 14 Oct 2017 10:19:25 GMT'}]",2017-10-18,"[['Viacheslav', 'Liskin', ''], ['Sergiy', 'Syrota', '']]","['e-learning', 'ontology', 'learning engine', 'educational']"
20649,1209.5339,Hassan Ismkhan,"Hassan Ismkhan, Kamran Zamanifar","Developing Improved Greedy Crossover to Solve Symmetric Traveling
  Salesman Problem","International Journal of Computer Science Issues, Volume 9, Issue 4,
  No 3, July 2012",,,,cs.NE,http://creativecommons.org/licenses/by/3.0/,"  The Traveling Salesman Problem (TSP) is one of the most famous optimization
problems. Greedy crossover designed by Greffenstette et al, can be used while
Symmetric TSP (STSP) is resolved by Genetic Algorithm (GA). Researchers have
proposed several versions of greedy crossover. Here we propose improved version
of it. We compare our greedy crossover with some of recent crossovers, we use
our greedy crossover and some recent crossovers in GA then compare crossovers
on speed and accuracy.
","[{'version': 'v1', 'created': 'Mon, 24 Sep 2012 17:26:29 GMT'}]",2012-09-25,"[['Ismkhan', 'Hassan', ''], ['Zamanifar', 'Kamran', '']]","['Greedy Crossover', 'Genetic Algorithm', 'Traveling Salesman Problem']"
20650,1307.0029,Pabitra Pal Choudhury,"Ranjeet Kumar Rout, Pabitra Pal Choudhury, B. S. Daya Sagar, Sk. Sarif
  Hassan","Fractal and Mathematical Morphology in Intricate Comparison between
  Tertiary Protein Structures",,,,,cs.CG cs.CE,http://creativecommons.org/licenses/publicdomain/,"  Intricate comparison between two given tertiary structures of proteins is as
important as the comparison of their functions. Several algorithms have been
devised to compute the similarity and dissimilarity among protein structures.
But, these algorithms compare protein structures by structural alignment of the
protein backbones which are usually unable to determine precise differences. In
this paper, an attempt has been made to compute the similarities and
dissimilarities among 3D protein structures using the fundamental mathematical
morphology operations and fractal geometry which can resolve the problem of
real differences. In doing so, two techniques are being used here in
determining the superficial structural (global similarity) and local similarity
in atomic level of the protein molecules. This intricate structural difference
would provide insight to Biologists to understand the protein structures and
their functions more precisely.
","[{'version': 'v1', 'created': 'Tue, 11 Jun 2013 15:20:03 GMT'}, {'version': 'v2', 'created': 'Wed, 25 Sep 2013 11:54:04 GMT'}]",2013-09-26,"[['Rout', 'Ranjeet Kumar', ''], ['Choudhury', 'Pabitra Pal', ''], ['Sagar', 'B. S. Daya', ''], ['Hassan', 'Sk. Sarif', '']]","['3D-Protein Structure', 'Similarities', 'Mathematical Morphology', 'Geodesic Dilation', 'Skeleton', 'Fractal Dimension']"
20651,1304.1731,Laurent Poinsot,Laurent Poinsot (LIPN),"Harmonic analysis and a bentness-like notion in certain finite Abelian
  groups over some finite fields",23 pages,,,,cs.CR cs.DM math.CO,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  It is well-known that degree two finite field extensions can be equipped with
a Hermitian-like structure similar to the extension of the complex field over
the reals. In this contribution, using this structure, we develop a modular
character theory and the appropriate Fourier transform for some particular kind
of finite Abelian groups. Moreover we introduce the notion of bent functions
for finite field valued functions rather than usual complex-valued functions,
and we study several of their properties. In particular we prove that this
bentness notion is a consequence of that of Logachev, Salnikov and Yashchenko,
introduced in ""Bent functions on a finite Abelian group"" (1997). In addition
this new bentness notion is also generalized to a vectorial setting.
","[{'version': 'v1', 'created': 'Fri, 5 Apr 2013 14:42:11 GMT'}, {'version': 'v2', 'created': 'Sun, 21 Apr 2013 19:05:11 GMT'}]",2013-04-23,"[['Poinsot', 'Laurent', '', 'LIPN']]","['Finite Abelian groups', 'character theory', 'Hermitian spaces', 'Fouriertransform', 'bent functions']"
20652,1609.04373,Aiman Soliman,"Aiman Soliman, Kiumars Soltani, Anand Padmanabhan, Shaowen Wang",Consistency of Social Sensing Signatures Across Major US Cities,CyberGIS16,,,,cs.SI physics.soc-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Previous studies have shown that Twitter users have biases to tweet from
certain locations, locational bias, and during certain hours, temporal bias. We
used three years of geolocated Twitter Data to quantify these biases and test
our central hypothesis that Twitter users biases are consistent across US
cities. Our results suggest that temporal and locational bias of Twitter users
are inconsistent between three US metropolitan cities. We derive conclusions
about the role of the complexity of the underlying data producing process on
its consistency and argue for the potential research avenue for Geospatial Data
Science to test and quantify these inconsistencies in the class of organically
evolved Big Data.
","[{'version': 'v1', 'created': 'Wed, 14 Sep 2016 18:41:23 GMT'}]",2016-09-15,"[['Soliman', 'Aiman', ''], ['Soltani', 'Kiumars', ''], ['Padmanabhan', 'Anand', ''], ['Wang', 'Shaowen', '']]","['Geospatial Data Science', 'CyberGIS', 'Big Data', 'Social Sensing', 'Urban Environments']"
20653,1301.3007,Dohy Hong,"Dohy Hong, Fabien Mathieu and G\'erard Burnside","Convergence of the D-iteration algorithm: convergence rate and
  asynchronous distributed scheme",9 pages,,,,cs.NA cs.DC math.NA,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In this paper, we define the general framework to describe the diffusion
operators associated to a positive matrix. We define the equations associated
to diffusion operators and present some general properties of their state
vectors. We show how this can be applied to prove and improve the convergence
of a fixed point problem associated to the matrix iteration scheme, including
for distributed computation framework. The approach can be understood as a
decomposition of the matrix-vector product operation in elementary operations
at the vector entry level.
","[{'version': 'v1', 'created': 'Mon, 14 Jan 2013 15:11:08 GMT'}]",2013-01-15,"[['Hong', 'Dohy', ''], ['Mathieu', 'Fabien', ''], ['Burnside', 'Gérard', '']]","['Linear algebra', 'numerical computation', 'iteration', 'fixed point', 'eigenvector', 'distributed computation']"
20654,1606.08521,Fattane Zarrinkalam,Fattane Zarrinkalam and Ebrahim Bagheri,Event Identification in Social Networks,"It will appear in Encyclopedia with Semantic Computing to be
  published by World Scientific",,,,cs.IR cs.SI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Social networks enable users to freely communicate with each other and share
their recent news, ongoing activities or views about different topics. As a
result, they can be seen as a potentially viable source of information to
understand the current emerging topics/events. The ability to model emerging
topics is a substantial step to monitor and summarize the information
originating from social sources. Applying traditional methods for event
detection which are often proposed for processing large, formal and structured
documents, are less effective, due to the short length, noisiness and
informality of the social posts. Recent event detection techniques address
these challenges by exploiting the opportunities behind abundant information
available in social networks. This article provides an overview of the state of
the art in event detection from social networks.
","[{'version': 'v1', 'created': 'Tue, 28 Jun 2016 00:26:22 GMT'}]",2016-06-29,"[['Zarrinkalam', 'Fattane', ''], ['Bagheri', 'Ebrahim', '']]","['Event Detection', 'Social Network Analysis', 'Topic Detection and Tracking']"
20655,1309.7739,Shenggen Zheng,"Jozef Gruska, Daowen Qiu, Shenggen Zheng","Communication complexity of promise problems and their applications to
  finite automata",15 pages. arXiv admin note: text overlap with arXiv:1307.2499,,,,cs.CC cs.FL quant-ph,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Equality and disjointness are two of the most studied problems in
communication complexity. They have been studied for both classical and also
quantum communication and for various models and modes of communication.
Buhrman et al. [Buh98] proved that the exact quantum communication complexity
for a promise version of the equality problem is ${\bf O}(\log {n})$ while the
classical deterministic communication complexity is $n+1$ for two-way
communication, which was the first impressively large (exponential) gap between
quantum and classical (deterministic and probabilistic) communication
complexity. If an error is tolerated, both quantum and probabilistic
communication complexities for equality are ${\bf O}(\log {n})$. However, even
if an error is tolerated, the gaps between quantum (probabilistic) and
deterministic complexity are not larger than quadratic for the disjointness
problem. It is therefore interesting to ask whether there are some promise
versions of the disjointness problem for which bigger gaps can be shown. We
give a positive answer to such a question. Namely, we prove that there exists
an exponential gap between quantum (even probabilistic) communication
complexity and classical deterministic communication complexity of some
specific versions of the disjointness problem.
  Klauck [Kla00] proved, for any language, that the state complexity of exact
quantum/classical finite automata, which is a general model of one-way quantum
finite automata, is not less than the state complexity of an equivalent one-way
deterministic finite automata (1DFA). In this paper we show, using a
communication complexity result, that situation may be different for some
promise problems. Namely, we show for certain promise problem that the gap
between the state complexity of exact one-way quantum finite automata and 1DFA
can be exponential.
","[{'version': 'v1', 'created': 'Mon, 30 Sep 2013 07:10:49 GMT'}]",2013-10-01,"[['Gruska', 'Jozef', ''], ['Qiu', 'Daowen', ''], ['Zheng', 'Shenggen', '']]","['Communication complexity', 'Disjointness', 'Quantum finite automata', 'State complexity']"
20656,1705.05651,Yao Yao,"Yao Yao, Xiaoping Liu, Dachuan Zhang, Zhaotang Liang, Yatao Zhang","Simulation of Urban Expansion and Farmland Loss in China by Integrating
  Cellular Automata and Random Forest",,,,,cs.CY,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  China has encountered serious land loss problems along with urban expansion
due to rapid urbanization. Without considering complicated spatiotemporal
heterogeneity, previous studies could not extract urban transition rules at
large scale well. This study proposed a random forest algorithm (RFA) based
cellular automata (CA) model to simulate China's urban expansion and farmland
loss in a fine scale from 2000 to 2030. The objectives of this study are to 1)
mine urban conversion rules in different homogeneous economic development
regions, and 2) simulate China's urban expansion process and farmland loss at
high spatial resolution (30 meters). Firstly, we clustered several homogeneous
economic development regions among China according to official statistical
data. Secondly, we constructed a RFA-based CA model to mine complex urban
conversion rules and carried out simulation of urban expansion and farmland
loss at each homo-region. The proposed model was implemented on Tianhe-1
supercomputer located in Guangzhou, China. The accuracy evaluation demonstrates
that the simulation result of proposed RFA-based CA model is more in agreement
with actual land use change. This study proves that the primary factor of
farmland loss in China is rapid urbanization from 2000, and the farmland loss
rate is expected to slow down gradually and will stabilize from 2010 to 2030.
It shows that China is able to preserve the 1.20 million km farmland without
crossing the ""red line"" within the next 20 years, but the situation remains
severe.
","[{'version': 'v1', 'created': 'Tue, 16 May 2017 11:34:55 GMT'}]",2017-05-17,"[['Yao', 'Yao', ''], ['Liu', 'Xiaoping', ''], ['Zhang', 'Dachuan', ''], ['Liang', 'Zhaotang', ''], ['Zhang', 'Yatao', '']]","['cellular automata', 'urban expansion', 'farmland loss', 'random forest algorithm', 'large']"
20657,1209.1652,Les Hatton,Les Hatton,"Power-laws and the Conservation of Information in discrete token
  systems: Part 2 The role of defect","15 pages, 5 figures, 25 references",,,,cs.IT math-ph math.IT math.MP q-bio.GN,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  In a matching paper (arXiv:1207.5027), I proved that Conservation of Size and
Information in a discrete token based system is overwhelmingly likely to lead
to a power-law component size distribution with respect to the size of its
unique alphabet. This was substantiated to a very high level of significance
using some 55 million lines of source code of mixed provenance. The principle
was also applied to show that average gene length should be constant in an
animal kingdom where the same constraints appear to hold, the implication being
that Conservation of Information plays a similar role in discrete token-based
systems as the Conservation of Energy does in physical systems.
  In this part 2, the role of defect will be explored and a functional
behaviour for defect derived to be consistent with the power-law behaviour
substantiated above.
  This will be supported by further experimental data and the implications
explored.
","[{'version': 'v1', 'created': 'Fri, 7 Sep 2012 21:14:11 GMT'}]",2012-09-11,"[['Hatton', 'Les', '']]","['Information content', 'defect clustering', 'Component size distribution', 'Power-law']"
20658,1109.1879,Muhammad Yasir Malik,"Tae Qinghui, Muhammad Yasir Malik, Youngjee Hong, Jinwoo Park",A Real-time Localization System Using RFID for Visually Impaired,"9 pages, 5 figures, Presented at IEOM 2011",,,,cs.MA cs.NI,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Gadgets helping the disabled, especially blind that are in least
accessibility of information, use acoustic methods that can cause stress to ear
and infringe user's privacy. Even if some project uses embedded Radio Frequency
Identification (RFID) into the sidewalk for blind's free walking, the tag
memory design is not specified for buildings and road conditions. This paper
suggested allocation scheme of RFID tag referring to EPCglobal SGLN, tactile
method for conveying information, and use of lithium battery as power source
with solar cells as an alternative. Results have shown independent mobility,
accidents prevention, stress relief and satisfied factors in terms of cost and
human usability.
","[{'version': 'v1', 'created': 'Fri, 9 Sep 2011 02:39:43 GMT'}]",2011-09-12,"[['Qinghui', 'Tae', ''], ['Malik', 'Muhammad Yasir', ''], ['Hong', 'Youngjee', ''], ['Park', 'Jinwoo', '']]","['Radio Frequency Identification (RFID)', 'smart white cane', 'digital Braille', 'tag design', 'EPCglobal']"
20659,1208.0944,Nader Ale Ebrahim,"Nader Ale Ebrahim, Shamsuddin Ahmed, Zahari Taha",Establishing Virtual R&D Teams: Obliged Policy,"6th IMC (International Management Conference). Tehran, Iran 2008",,,,cs.OH,http://creativecommons.org/licenses/by/3.0/,"  In a global and technology oriented world the requirements that products and
services have to fulfill are increasing and are getting more complicated.
Research and development (R&D) is becoming increasingly important in creating
the knowledge that makes research and business more competitive. Companies are
obliged to produce more rapidly, more effectively and more efficiently. In
order to meet these requirements and to secure the viability of business
processes, services and products R&D teams need to access and retrieve
information from as many sources as possible. From the other perspective
virtual teams are important mechanisms for organizations seeking to leverage
scarce resources across geographic and other boundaries moreover; virtual
collaboration has become vital for most organizations. This is particularly
true in the context of designing new product and service innovation. Such
collaboration often involves a network of partners located around the world.
However at the R&D project level, dealing with such distributed teams
challenges both managers and specialists. In new product development, it is
necessary to put together the growing different capabilities and services with
the goal, through cooperation between suppliers and customers, service
providers and scientific institutions to achieve innovations of high quality.
In this paper based on comprehensive literature review of recent articles, at
the first step provides an primary definition and characterization of virtual
R&D team; next, the potential value created by virtual R&D teams for new
product development is explored and lastly along with a guide line for future
study, it is argued that the establishing of virtual R&D teams should be given
consideration in the management of R&D projects.
","[{'version': 'v1', 'created': 'Sat, 4 Aug 2012 16:35:48 GMT'}]",2012-08-07,"[['Ebrahim', 'Nader Ale', ''], ['Ahmed', 'Shamsuddin', ''], ['Taha', 'Zahari', '']]","['Virtual R&D Team', 'R&D Management', 'New Product Development    Introduction']"
20660,1507.01181,Tariq Toukan,Keren Censor-Hillel and Tariq Toukan,On Fast and Robust Information Spreading in the Vertex-Congest Model,Appears in SIROCCO 2015 conference,,,,cs.DC,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  This paper initiates the study of the impact of failures on the fundamental
problem of \emph{information spreading} in the Vertex-Congest model, in which
in every round, each of the $n$ nodes sends the same $O(\log{n})$-bit message
to all of its neighbors.
  Our contribution to coping with failures is twofold. First, we prove that the
randomized algorithm which chooses uniformly at random the next message to
forward is slow, requiring $\Omega(n/\sqrt{k})$ rounds on some graphs, which we
denote by $G_{n,k}$, where $k$ is the vertex-connectivity.
  Second, we design a randomized algorithm that makes dynamic message choices,
with probabilities that change over the execution. We prove that for $G_{n,k}$
it requires only a near-optimal number of $O(n\log^3{n}/k)$ rounds, despite a
rate of $q=O(k/n\log^3{n})$ failures per round. Our technique of choosing
probabilities that change according to the execution is of independent
interest.
","[{'version': 'v1', 'created': 'Sun, 5 Jul 2015 08:54:59 GMT'}]",2015-07-07,"[['Censor-Hillel', 'Keren', ''], ['Toukan', 'Tariq', '']]","['distributed computing', 'information spreading', 'randomizedalgorithms', 'vertex-connectivity', 'fault tolerance']"
20661,1110.2258,Kanmani Munusamy,"Kanmani Munusamy, Harihodin Selamat, Suhaimi Ibrahim and Mohd Sapiyan
  Baba","A comparative study of process mediator components that support
  behavioral incompatibility","20 Pages, 9 figures and 8 Tables; International Journal on Web
  Service Computing (IJWSC), September 2011, Volume 2, Number 3",,,,cs.SE,http://arxiv.org/licenses/nonexclusive-distrib/1.0/,"  Most businesses these days use the web services technology as a medium to
allow interaction between a service provider and a service requestor. However,
both the service provider and the requestor would be unable to achieve their
business goals when there are miscommunications between their processes. This
research focuses on the process incompatibility between the web services and
the way to automatically resolve them by using a process mediator. This paper
presents an overview of the behavioral incompatibility between web services and
the overview of process mediation in order to resolve the complications faced
due to the incompatibility. Several state-of the-art approaches have been
selected and analyzed to understand the existing process mediation components.
This paper aims to provide a valuable gap analysis that identifies the
important research areas in process mediation that have yet to be fully
explored.
","[{'version': 'v1', 'created': 'Tue, 11 Oct 2011 03:15:39 GMT'}]",2011-10-12,"[['Munusamy', 'Kanmani', ''], ['Selamat', 'Harihodin', ''], ['Ibrahim', 'Suhaimi', ''], ['Baba', 'Mohd Sapiyan', '']]","['Web services', 'semantic web services', 'web service mediation', 'web service adaptation', 'behavioral incompatibility']"